cfitsio-3.47/0000755000225700000360000000000013464573432012410 5ustar cagordonlheacfitsio-3.47/buffers.c0000644000225700000360000014775513464573431014232 0ustar cagordonlhea/* This file, buffers.c, contains the core set of FITSIO routines */ /* that use or manage the internal set of IO buffers. */ /* The FITSIO software was written by William Pence at the High Energy */ /* Astrophysic Science Archive Research Center (HEASARC) at the NASA */ /* Goddard Space Flight Center. */ #include #include #include "fitsio2.h" /*--------------------------------------------------------------------------*/ int ffmbyt(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG bytepos, /* I - byte position in file to move to */ int err_mode, /* I - 1=ignore error, 0 = return error */ int *status) /* IO - error status */ { /* Move to the input byte location in the file. When writing to a file, a move may sometimes be made to a position beyond the current EOF. The err_mode parameter determines whether such conditions should be returned as an error or simply ignored. */ long record; if (*status > 0) return(*status); if (bytepos < 0) return(*status = NEG_FILE_POS); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); record = (long) (bytepos / IOBUFLEN); /* zero-indexed record number */ /* if this is not the current record, then load it */ if ( ((fptr->Fptr)->curbuf < 0) || (record != (fptr->Fptr)->bufrecnum[(fptr->Fptr)->curbuf])) ffldrc(fptr, record, err_mode, status); if (*status <= 0) (fptr->Fptr)->bytepos = bytepos; /* save new file position */ return(*status); } /*--------------------------------------------------------------------------*/ int ffpbyt(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG nbytes, /* I - number of bytes to write */ void *buffer, /* I - buffer containing the bytes to write */ int *status) /* IO - error status */ /* put (write) the buffer of bytes to the output FITS file, starting at the current file position. Write large blocks of data directly to disk; write smaller segments to intermediate IO buffers to improve efficiency. */ { int ii, nbuff; LONGLONG filepos; long recstart, recend; long ntodo, bufpos, nspace, nwrite; char *cptr; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); if (nbytes > LONG_MAX) { ffpmsg("Number of bytes to write is greater than LONG_MAX (ffpbyt)."); *status = WRITE_ERROR; return(*status); } ntodo = (long) nbytes; cptr = (char *)buffer; if ((fptr->Fptr)->curbuf < 0) /* no current data buffer for this file */ { /* so reload the last one that was used */ ffldrc(fptr, (long) (((fptr->Fptr)->bytepos) / IOBUFLEN), REPORT_EOF, status); } if (nbytes >= MINDIRECT) { /* write large blocks of data directly to disk instead of via buffers */ /* first, fill up the current IO buffer before flushing it to disk */ nbuff = (fptr->Fptr)->curbuf; /* current IO buffer number */ filepos = (fptr->Fptr)->bytepos; /* save the write starting position */ recstart = (fptr->Fptr)->bufrecnum[nbuff]; /* starting record */ recend = (long) ((filepos + nbytes - 1) / IOBUFLEN); /* ending record */ /* bufpos is the starting position within the IO buffer */ bufpos = (long) (filepos - ((LONGLONG)recstart * IOBUFLEN)); nspace = IOBUFLEN - bufpos; /* amount of space left in the buffer */ if (nspace) { /* fill up the IO buffer */ memcpy((fptr->Fptr)->iobuffer + (nbuff * IOBUFLEN) + bufpos, cptr, nspace); ntodo -= nspace; /* decrement remaining number of bytes */ cptr += nspace; /* increment user buffer pointer */ filepos += nspace; /* increment file position pointer */ (fptr->Fptr)->dirty[nbuff] = TRUE; /* mark record as having been modified */ } for (ii = 0; ii < NIOBUF; ii++) /* flush any affected buffers to disk */ { if ((fptr->Fptr)->bufrecnum[ii] >= recstart && (fptr->Fptr)->bufrecnum[ii] <= recend ) { if ((fptr->Fptr)->dirty[ii]) /* flush modified buffer to disk */ ffbfwt(fptr->Fptr, ii, status); (fptr->Fptr)->bufrecnum[ii] = -1; /* disassociate buffer from the file */ } } /* move to the correct write position */ if ((fptr->Fptr)->io_pos != filepos) ffseek(fptr->Fptr, filepos); nwrite = ((ntodo - 1) / IOBUFLEN) * IOBUFLEN; /* don't write last buff */ ffwrite(fptr->Fptr, nwrite, cptr, status); /* write the data */ ntodo -= nwrite; /* decrement remaining number of bytes */ cptr += nwrite; /* increment user buffer pointer */ (fptr->Fptr)->io_pos = filepos + nwrite; /* update the file position */ if ((fptr->Fptr)->io_pos >= (fptr->Fptr)->filesize) /* at the EOF? */ { (fptr->Fptr)->filesize = (fptr->Fptr)->io_pos; /* increment file size */ /* initialize the current buffer with the correct fill value */ if ((fptr->Fptr)->hdutype == ASCII_TBL) memset((fptr->Fptr)->iobuffer + (nbuff * IOBUFLEN), 32, IOBUFLEN); /* blank fill */ else memset((fptr->Fptr)->iobuffer + (nbuff * IOBUFLEN), 0, IOBUFLEN); /* zero fill */ } else { /* read next record */ ffread(fptr->Fptr, IOBUFLEN, (fptr->Fptr)->iobuffer + (nbuff * IOBUFLEN), status); (fptr->Fptr)->io_pos += IOBUFLEN; } /* copy remaining bytes from user buffer into current IO buffer */ memcpy((fptr->Fptr)->iobuffer + (nbuff * IOBUFLEN), cptr, ntodo); (fptr->Fptr)->dirty[nbuff] = TRUE; /* mark record as having been modified */ (fptr->Fptr)->bufrecnum[nbuff] = recend; /* record number */ (fptr->Fptr)->logfilesize = maxvalue((fptr->Fptr)->logfilesize, (LONGLONG)(recend + 1) * IOBUFLEN); (fptr->Fptr)->bytepos = filepos + nwrite + ntodo; } else { /* bufpos is the starting position in IO buffer */ bufpos = (long) ((fptr->Fptr)->bytepos - ((LONGLONG)(fptr->Fptr)->bufrecnum[(fptr->Fptr)->curbuf] * IOBUFLEN)); nspace = IOBUFLEN - bufpos; /* amount of space left in the buffer */ while (ntodo) { nwrite = minvalue(ntodo, nspace); /* copy bytes from user's buffer to the IO buffer */ memcpy((fptr->Fptr)->iobuffer + ((fptr->Fptr)->curbuf * IOBUFLEN) + bufpos, cptr, nwrite); ntodo -= nwrite; /* decrement remaining number of bytes */ cptr += nwrite; (fptr->Fptr)->bytepos += nwrite; /* increment file position pointer */ (fptr->Fptr)->dirty[(fptr->Fptr)->curbuf] = TRUE; /* mark record as modified */ if (ntodo) /* load next record into a buffer */ { ffldrc(fptr, (long) ((fptr->Fptr)->bytepos / IOBUFLEN), IGNORE_EOF, status); bufpos = 0; nspace = IOBUFLEN; } } } return(*status); } /*--------------------------------------------------------------------------*/ int ffpbytoff(fitsfile *fptr, /* I - FITS file pointer */ long gsize, /* I - size of each group of bytes */ long ngroups, /* I - number of groups to write */ long offset, /* I - size of gap between groups */ void *buffer, /* I - buffer to be written */ int *status) /* IO - error status */ /* put (write) the buffer of bytes to the output FITS file, with an offset between each group of bytes. This function combines ffmbyt and ffpbyt for increased efficiency. */ { int bcurrent; long ii, bufpos, nspace, nwrite, record; char *cptr, *ioptr; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); if ((fptr->Fptr)->curbuf < 0) /* no current data buffer for this file */ { /* so reload the last one that was used */ ffldrc(fptr, (long) (((fptr->Fptr)->bytepos) / IOBUFLEN), REPORT_EOF, status); } cptr = (char *)buffer; bcurrent = (fptr->Fptr)->curbuf; /* number of the current IO buffer */ record = (fptr->Fptr)->bufrecnum[bcurrent]; /* zero-indexed record number */ bufpos = (long) ((fptr->Fptr)->bytepos - ((LONGLONG)record * IOBUFLEN)); /* start pos */ nspace = IOBUFLEN - bufpos; /* amount of space left in buffer */ ioptr = (fptr->Fptr)->iobuffer + (bcurrent * IOBUFLEN) + bufpos; for (ii = 1; ii < ngroups; ii++) /* write all but the last group */ { /* copy bytes from user's buffer to the IO buffer */ nwrite = minvalue(gsize, nspace); memcpy(ioptr, cptr, nwrite); cptr += nwrite; /* increment buffer pointer */ if (nwrite < gsize) /* entire group did not fit */ { (fptr->Fptr)->dirty[bcurrent] = TRUE; /* mark record as having been modified */ record++; ffldrc(fptr, record, IGNORE_EOF, status); /* load next record */ bcurrent = (fptr->Fptr)->curbuf; ioptr = (fptr->Fptr)->iobuffer + (bcurrent * IOBUFLEN); nwrite = gsize - nwrite; memcpy(ioptr, cptr, nwrite); cptr += nwrite; /* increment buffer pointer */ ioptr += (offset + nwrite); /* increment IO buffer pointer */ nspace = IOBUFLEN - offset - nwrite; /* amount of space left */ } else { ioptr += (offset + nwrite); /* increment IO bufer pointer */ nspace -= (offset + nwrite); } if (nspace <= 0) /* beyond current record? */ { (fptr->Fptr)->dirty[bcurrent] = TRUE; record += ((IOBUFLEN - nspace) / IOBUFLEN); /* new record number */ ffldrc(fptr, record, IGNORE_EOF, status); bcurrent = (fptr->Fptr)->curbuf; bufpos = (-nspace) % IOBUFLEN; /* starting buffer pos */ nspace = IOBUFLEN - bufpos; ioptr = (fptr->Fptr)->iobuffer + (bcurrent * IOBUFLEN) + bufpos; } } /* now write the last group */ nwrite = minvalue(gsize, nspace); memcpy(ioptr, cptr, nwrite); cptr += nwrite; /* increment buffer pointer */ if (nwrite < gsize) /* entire group did not fit */ { (fptr->Fptr)->dirty[bcurrent] = TRUE; /* mark record as having been modified */ record++; ffldrc(fptr, record, IGNORE_EOF, status); /* load next record */ bcurrent = (fptr->Fptr)->curbuf; ioptr = (fptr->Fptr)->iobuffer + (bcurrent * IOBUFLEN); nwrite = gsize - nwrite; memcpy(ioptr, cptr, nwrite); } (fptr->Fptr)->dirty[bcurrent] = TRUE; /* mark record as having been modified */ (fptr->Fptr)->bytepos = (fptr->Fptr)->bytepos + (ngroups * gsize) + (ngroups - 1) * offset; return(*status); } /*--------------------------------------------------------------------------*/ int ffgbyt(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG nbytes, /* I - number of bytes to read */ void *buffer, /* O - buffer to read into */ int *status) /* IO - error status */ /* get (read) the requested number of bytes from the file, starting at the current file position. Read large blocks of data directly from disk; read smaller segments via intermediate IO buffers to improve efficiency. */ { int ii; LONGLONG filepos; long recstart, recend, ntodo, bufpos, nspace, nread; char *cptr; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); cptr = (char *)buffer; if (nbytes >= MINDIRECT) { /* read large blocks of data directly from disk instead of via buffers */ filepos = (fptr->Fptr)->bytepos; /* save the read starting position */ /* note that in this case, ffmbyt has not been called, and so */ /* bufrecnum[(fptr->Fptr)->curbuf] does not point to the intended */ /* output buffer */ recstart = (long) (filepos / IOBUFLEN); /* starting record */ recend = (long) ((filepos + nbytes - 1) / IOBUFLEN); /* ending record */ for (ii = 0; ii < NIOBUF; ii++) /* flush any affected buffers to disk */ { if ((fptr->Fptr)->dirty[ii] && (fptr->Fptr)->bufrecnum[ii] >= recstart && (fptr->Fptr)->bufrecnum[ii] <= recend) { ffbfwt(fptr->Fptr, ii, status); /* flush modified buffer to disk */ } } /* move to the correct read position */ if ((fptr->Fptr)->io_pos != filepos) ffseek(fptr->Fptr, filepos); ffread(fptr->Fptr, (long) nbytes, cptr, status); /* read the data */ (fptr->Fptr)->io_pos = filepos + nbytes; /* update the file position */ } else { /* read small chucks of data using the IO buffers for efficiency */ if ((fptr->Fptr)->curbuf < 0) /* no current data buffer for this file */ { /* so reload the last one that was used */ ffldrc(fptr, (long) (((fptr->Fptr)->bytepos) / IOBUFLEN), REPORT_EOF, status); } /* bufpos is the starting position in IO buffer */ bufpos = (long) ((fptr->Fptr)->bytepos - ((LONGLONG)(fptr->Fptr)->bufrecnum[(fptr->Fptr)->curbuf] * IOBUFLEN)); nspace = IOBUFLEN - bufpos; /* amount of space left in the buffer */ ntodo = (long) nbytes; while (ntodo) { nread = minvalue(ntodo, nspace); /* copy bytes from IO buffer to user's buffer */ memcpy(cptr, (fptr->Fptr)->iobuffer + ((fptr->Fptr)->curbuf * IOBUFLEN) + bufpos, nread); ntodo -= nread; /* decrement remaining number of bytes */ cptr += nread; (fptr->Fptr)->bytepos += nread; /* increment file position pointer */ if (ntodo) /* load next record into a buffer */ { ffldrc(fptr, (long) ((fptr->Fptr)->bytepos / IOBUFLEN), REPORT_EOF, status); bufpos = 0; nspace = IOBUFLEN; } } } return(*status); } /*--------------------------------------------------------------------------*/ int ffgbytoff(fitsfile *fptr, /* I - FITS file pointer */ long gsize, /* I - size of each group of bytes */ long ngroups, /* I - number of groups to read */ long offset, /* I - size of gap between groups (may be < 0) */ void *buffer, /* I - buffer to be filled */ int *status) /* IO - error status */ /* get (read) the requested number of bytes from the file, starting at the current file position. This function combines ffmbyt and ffgbyt for increased efficiency. */ { int bcurrent; long ii, bufpos, nspace, nread, record; char *cptr, *ioptr; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); if ((fptr->Fptr)->curbuf < 0) /* no current data buffer for this file */ { /* so reload the last one that was used */ ffldrc(fptr, (long) (((fptr->Fptr)->bytepos) / IOBUFLEN), REPORT_EOF, status); } cptr = (char *)buffer; bcurrent = (fptr->Fptr)->curbuf; /* number of the current IO buffer */ record = (fptr->Fptr)->bufrecnum[bcurrent]; /* zero-indexed record number */ bufpos = (long) ((fptr->Fptr)->bytepos - ((LONGLONG)record * IOBUFLEN)); /* start pos */ nspace = IOBUFLEN - bufpos; /* amount of space left in buffer */ ioptr = (fptr->Fptr)->iobuffer + (bcurrent * IOBUFLEN) + bufpos; for (ii = 1; ii < ngroups; ii++) /* read all but the last group */ { /* copy bytes from IO buffer to the user's buffer */ nread = minvalue(gsize, nspace); memcpy(cptr, ioptr, nread); cptr += nread; /* increment buffer pointer */ if (nread < gsize) /* entire group did not fit */ { record++; ffldrc(fptr, record, REPORT_EOF, status); /* load next record */ bcurrent = (fptr->Fptr)->curbuf; ioptr = (fptr->Fptr)->iobuffer + (bcurrent * IOBUFLEN); nread = gsize - nread; memcpy(cptr, ioptr, nread); cptr += nread; /* increment buffer pointer */ ioptr += (offset + nread); /* increment IO buffer pointer */ nspace = IOBUFLEN - offset - nread; /* amount of space left */ } else { ioptr += (offset + nread); /* increment IO bufer pointer */ nspace -= (offset + nread); } if (nspace <= 0 || nspace > IOBUFLEN) /* beyond current record? */ { if (nspace <= 0) { record += ((IOBUFLEN - nspace) / IOBUFLEN); /* new record number */ bufpos = (-nspace) % IOBUFLEN; /* starting buffer pos */ } else { record -= ((nspace - 1 ) / IOBUFLEN); /* new record number */ bufpos = IOBUFLEN - (nspace % IOBUFLEN); /* starting buffer pos */ } ffldrc(fptr, record, REPORT_EOF, status); bcurrent = (fptr->Fptr)->curbuf; nspace = IOBUFLEN - bufpos; ioptr = (fptr->Fptr)->iobuffer + (bcurrent * IOBUFLEN) + bufpos; } } /* now read the last group */ nread = minvalue(gsize, nspace); memcpy(cptr, ioptr, nread); cptr += nread; /* increment buffer pointer */ if (nread < gsize) /* entire group did not fit */ { record++; ffldrc(fptr, record, REPORT_EOF, status); /* load next record */ bcurrent = (fptr->Fptr)->curbuf; ioptr = (fptr->Fptr)->iobuffer + (bcurrent * IOBUFLEN); nread = gsize - nread; memcpy(cptr, ioptr, nread); } (fptr->Fptr)->bytepos = (fptr->Fptr)->bytepos + (ngroups * gsize) + (ngroups - 1) * offset; return(*status); } /*--------------------------------------------------------------------------*/ int ffldrc(fitsfile *fptr, /* I - FITS file pointer */ long record, /* I - record number to be loaded */ int err_mode, /* I - 1=ignore EOF, 0 = return EOF error */ int *status) /* IO - error status */ { /* low-level routine to load a specified record from a file into a physical buffer, if it is not already loaded. Reset all pointers to make this the new current record for that file. Update ages of all the physical buffers. */ int ibuff, nbuff; LONGLONG rstart; /* check if record is already loaded in one of the buffers */ /* search from youngest to oldest buffer for efficiency */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); for (ibuff = NIOBUF - 1; ibuff >= 0; ibuff--) { nbuff = (fptr->Fptr)->ageindex[ibuff]; if (record == (fptr->Fptr)->bufrecnum[nbuff]) { goto updatebuf; /* use 'goto' for efficiency */ } } /* record is not already loaded */ rstart = (LONGLONG)record * IOBUFLEN; if ( !err_mode && (rstart >= (fptr->Fptr)->logfilesize) ) /* EOF? */ return(*status = END_OF_FILE); if (ffwhbf(fptr, &nbuff) < 0) /* which buffer should we reuse? */ return(*status = TOO_MANY_FILES); if ((fptr->Fptr)->dirty[nbuff]) ffbfwt(fptr->Fptr, nbuff, status); /* write dirty buffer to disk */ if (rstart >= (fptr->Fptr)->filesize) /* EOF? */ { /* initialize an empty buffer with the correct fill value */ if ((fptr->Fptr)->hdutype == ASCII_TBL) memset((fptr->Fptr)->iobuffer + (nbuff * IOBUFLEN), 32, IOBUFLEN); /* blank fill */ else memset((fptr->Fptr)->iobuffer + (nbuff * IOBUFLEN), 0, IOBUFLEN); /* zero fill */ (fptr->Fptr)->logfilesize = maxvalue((fptr->Fptr)->logfilesize, rstart + IOBUFLEN); (fptr->Fptr)->dirty[nbuff] = TRUE; /* mark record as having been modified */ } else /* not EOF, so read record from disk */ { if ((fptr->Fptr)->io_pos != rstart) ffseek(fptr->Fptr, rstart); ffread(fptr->Fptr, IOBUFLEN, (fptr->Fptr)->iobuffer + (nbuff * IOBUFLEN), status); (fptr->Fptr)->io_pos = rstart + IOBUFLEN; /* set new IO position */ } (fptr->Fptr)->bufrecnum[nbuff] = record; /* record number contained in buffer */ updatebuf: (fptr->Fptr)->curbuf = nbuff; /* this is the current buffer for this file */ if (ibuff < 0) { /* find the current position of the buffer in the age index */ for (ibuff = 0; ibuff < NIOBUF; ibuff++) if ((fptr->Fptr)->ageindex[ibuff] == nbuff) break; } /* increment the age of all the buffers that were younger than it */ for (ibuff++; ibuff < NIOBUF; ibuff++) (fptr->Fptr)->ageindex[ibuff - 1] = (fptr->Fptr)->ageindex[ibuff]; (fptr->Fptr)->ageindex[NIOBUF - 1] = nbuff; /* this is now the youngest buffer */ return(*status); } /*--------------------------------------------------------------------------*/ int ffwhbf(fitsfile *fptr, /* I - FITS file pointer */ int *nbuff) /* O - which buffer to use */ { /* decide which buffer to (re)use to hold a new file record */ return(*nbuff = (fptr->Fptr)->ageindex[0]); /* return oldest buffer */ } /*--------------------------------------------------------------------------*/ int ffflus(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ /* Flush all the data in the current FITS file to disk. This ensures that if the program subsequently dies, the disk FITS file will be closed correctly. */ { int hdunum, hdutype; if (*status > 0) return(*status); ffghdn(fptr, &hdunum); /* get the current HDU number */ if (ffchdu(fptr,status) > 0) /* close out the current HDU */ ffpmsg("ffflus could not close the current HDU."); ffflsh(fptr, FALSE, status); /* flush any modified IO buffers to disk */ if (ffgext(fptr, hdunum - 1, &hdutype, status) > 0) /* reopen HDU */ ffpmsg("ffflus could not reopen the current HDU."); return(*status); } /*--------------------------------------------------------------------------*/ int ffflsh(fitsfile *fptr, /* I - FITS file pointer */ int clearbuf, /* I - also clear buffer contents? */ int *status) /* IO - error status */ { /* flush all dirty IO buffers associated with the file to disk */ int ii; /* no need to move to a different HDU if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); */ for (ii = 0; ii < NIOBUF; ii++) { /* flush modified buffer to disk */ if ((fptr->Fptr)->bufrecnum[ii] >= 0 &&(fptr->Fptr)->dirty[ii]) ffbfwt(fptr->Fptr, ii, status); if (clearbuf) (fptr->Fptr)->bufrecnum[ii] = -1; /* set contents of buffer as undefined */ } if (*status != READONLY_FILE) ffflushx(fptr->Fptr); /* flush system buffers to disk */ return(*status); } /*--------------------------------------------------------------------------*/ int ffbfeof(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ { /* clear any buffers beyond the end of file */ int ii; for (ii = 0; ii < NIOBUF; ii++) { if ( (LONGLONG) (fptr->Fptr)->bufrecnum[ii] * IOBUFLEN >= fptr->Fptr->filesize) { (fptr->Fptr)->bufrecnum[ii] = -1; /* set contents of buffer as undefined */ } } return(*status); } /*--------------------------------------------------------------------------*/ int ffbfwt(FITSfile *Fptr, /* I - FITS file pointer */ int nbuff, /* I - which buffer to write */ int *status) /* IO - error status */ { /* write contents of buffer to file; If the position of the buffer is beyond the current EOF, then the file may need to be extended with fill values, and/or with the contents of some of the other i/o buffers. */ int ii,ibuff; long jj, irec, minrec, nloop; LONGLONG filepos; static char zeros[IOBUFLEN]; /* initialized to zero by default */ if (!(Fptr->writemode) ) { ffpmsg("Error: trying to write to READONLY file."); if (Fptr->driver == 8) { /* gzip compressed file */ ffpmsg("Cannot write to a GZIP or COMPRESS compressed file."); } Fptr->dirty[nbuff] = FALSE; /* reset buffer status to prevent later probs */ *status = READONLY_FILE; return(*status); } filepos = (LONGLONG)Fptr->bufrecnum[nbuff] * IOBUFLEN; if (filepos <= Fptr->filesize) { /* record is located within current file, so just write it */ /* move to the correct write position */ if (Fptr->io_pos != filepos) ffseek(Fptr, filepos); ffwrite(Fptr, IOBUFLEN, Fptr->iobuffer + (nbuff * IOBUFLEN), status); Fptr->io_pos = filepos + IOBUFLEN; if (filepos == Fptr->filesize) /* appended new record? */ Fptr->filesize += IOBUFLEN; /* increment the file size */ Fptr->dirty[nbuff] = FALSE; } else /* if record is beyond the EOF, append any other records */ /* and/or insert fill values if necessary */ { /* move to EOF */ if (Fptr->io_pos != Fptr->filesize) ffseek(Fptr, Fptr->filesize); ibuff = NIOBUF; /* initialize to impossible value */ while(ibuff != nbuff) /* repeat until requested buffer is written */ { minrec = (long) (Fptr->filesize / IOBUFLEN); /* write lowest record beyond the EOF first */ irec = Fptr->bufrecnum[nbuff]; /* initially point to the requested buffer */ ibuff = nbuff; for (ii = 0; ii < NIOBUF; ii++) { if (Fptr->bufrecnum[ii] >= minrec && Fptr->bufrecnum[ii] < irec) { irec = Fptr->bufrecnum[ii]; /* found a lower record */ ibuff = ii; } } filepos = (LONGLONG)irec * IOBUFLEN; /* byte offset of record in file */ /* append 1 or more fill records if necessary */ if (filepos > Fptr->filesize) { nloop = (long) ((filepos - (Fptr->filesize)) / IOBUFLEN); for (jj = 0; jj < nloop && !(*status); jj++) ffwrite(Fptr, IOBUFLEN, zeros, status); /* ffseek(Fptr, filepos); */ Fptr->filesize = filepos; /* increment the file size */ } /* write the buffer itself */ ffwrite(Fptr, IOBUFLEN, Fptr->iobuffer + (ibuff * IOBUFLEN), status); Fptr->dirty[ibuff] = FALSE; Fptr->filesize += IOBUFLEN; /* increment the file size */ } /* loop back if more buffers need to be written */ Fptr->io_pos = Fptr->filesize; /* currently positioned at EOF */ } return(*status); } /*--------------------------------------------------------------------------*/ int ffgrsz( fitsfile *fptr, /* I - FITS file pionter */ long *ndata, /* O - optimal amount of data to access */ int *status) /* IO - error status */ /* Returns an optimal value for the number of rows in a binary table or the number of pixels in an image that should be read or written at one time for maximum efficiency. Accessing more data than this may cause excessive flushing and rereading of buffers to/from disk. */ { int typecode, bytesperpixel; /* There are NIOBUF internal buffers available each IOBUFLEN bytes long. */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header to get hdu struct */ return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU ) /* calc pixels per buffer size */ { /* image pixels are in column 2 of the 'table' */ ffgtcl(fptr, 2, &typecode, NULL, NULL, status); bytesperpixel = typecode / 10; *ndata = ((NIOBUF - 1) * IOBUFLEN) / bytesperpixel; } else /* calc number of rows that fit in buffers */ { *ndata = (long) (((NIOBUF - 1) * IOBUFLEN) / maxvalue(1, (fptr->Fptr)->rowlength)); *ndata = maxvalue(1, *ndata); } return(*status); } /*--------------------------------------------------------------------------*/ int ffgtbb(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG firstrow, /* I - starting row (1 = first row) */ LONGLONG firstchar, /* I - starting byte in row (1=first) */ LONGLONG nchars, /* I - number of bytes to read */ unsigned char *values, /* I - array of bytes to read */ int *status) /* IO - error status */ /* read a consecutive string of bytes from an ascii or binary table. This will span multiple rows of the table if nchars + firstchar is greater than the length of a row. */ { LONGLONG bytepos, endrow; if (*status > 0 || nchars <= 0) return(*status); else if (firstrow < 1) return(*status=BAD_ROW_NUM); else if (firstchar < 1) return(*status=BAD_ELEM_NUM); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); /* check that we do not exceed number of rows in the table */ endrow = ((firstchar + nchars - 2) / (fptr->Fptr)->rowlength) + firstrow; if (endrow > (fptr->Fptr)->numrows) { ffpmsg("attempt to read past end of table (ffgtbb)"); return(*status=BAD_ROW_NUM); } /* move the i/o pointer to the start of the sequence of characters */ bytepos = (fptr->Fptr)->datastart + ((fptr->Fptr)->rowlength * (firstrow - 1)) + firstchar - 1; ffmbyt(fptr, bytepos, REPORT_EOF, status); ffgbyt(fptr, nchars, values, status); /* read the bytes */ return(*status); } /*--------------------------------------------------------------------------*/ int ffgi1b(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG byteloc, /* I - position within file to start reading */ long nvals, /* I - number of pixels to read */ long incre, /* I - byte increment between pixels */ unsigned char *values, /* O - returned array of values */ int *status) /* IO - error status */ /* get (read) the array of values from the FITS file, doing machine dependent format conversion (e.g. byte-swapping) if necessary. */ { LONGLONG postemp; if (incre == 1) /* read all the values at once (contiguous bytes) */ { if (nvals < MINDIRECT) /* read normally via IO buffers */ { ffmbyt(fptr, byteloc, REPORT_EOF, status); ffgbyt(fptr, nvals, values, status); } else /* read directly from disk, bypassing IO buffers */ { postemp = (fptr->Fptr)->bytepos; /* store current file position */ (fptr->Fptr)->bytepos = byteloc; /* set to the desired position */ ffgbyt(fptr, nvals, values, status); (fptr->Fptr)->bytepos = postemp; /* reset to original position */ } } else /* have to read each value individually (not contiguous ) */ { ffmbyt(fptr, byteloc, REPORT_EOF, status); ffgbytoff(fptr, 1, nvals, incre - 1, values, status); } return(*status); } /*--------------------------------------------------------------------------*/ int ffgi2b(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG byteloc, /* I - position within file to start reading */ long nvals, /* I - number of pixels to read */ long incre, /* I - byte increment between pixels */ short *values, /* O - returned array of values */ int *status) /* IO - error status */ /* get (read) the array of values from the FITS file, doing machine dependent format conversion (e.g. byte-swapping) if necessary. */ { LONGLONG postemp; if (incre == 2) /* read all the values at once (contiguous bytes) */ { if (nvals * 2 < MINDIRECT) /* read normally via IO buffers */ { ffmbyt(fptr, byteloc, REPORT_EOF, status); ffgbyt(fptr, nvals * 2, values, status); } else /* read directly from disk, bypassing IO buffers */ { postemp = (fptr->Fptr)->bytepos; /* store current file position */ (fptr->Fptr)->bytepos = byteloc; /* set to the desired position */ ffgbyt(fptr, nvals * 2, values, status); (fptr->Fptr)->bytepos = postemp; /* reset to original position */ } } else /* have to read each value individually (not contiguous ) */ { ffmbyt(fptr, byteloc, REPORT_EOF, status); ffgbytoff(fptr, 2, nvals, incre - 2, values, status); } #if BYTESWAPPED ffswap2(values, nvals); /* reverse order of bytes in each value */ #endif return(*status); } /*--------------------------------------------------------------------------*/ int ffgi4b(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG byteloc, /* I - position within file to start reading */ long nvals, /* I - number of pixels to read */ long incre, /* I - byte increment between pixels */ INT32BIT *values, /* O - returned array of values */ int *status) /* IO - error status */ /* get (read) the array of values from the FITS file, doing machine dependent format conversion (e.g. byte-swapping) if necessary. */ { LONGLONG postemp; if (incre == 4) /* read all the values at once (contiguous bytes) */ { if (nvals * 4 < MINDIRECT) /* read normally via IO buffers */ { ffmbyt(fptr, byteloc, REPORT_EOF, status); ffgbyt(fptr, nvals * 4, values, status); } else /* read directly from disk, bypassing IO buffers */ { postemp = (fptr->Fptr)->bytepos; /* store current file position */ (fptr->Fptr)->bytepos = byteloc; /* set to the desired position */ ffgbyt(fptr, nvals * 4, values, status); (fptr->Fptr)->bytepos = postemp; /* reset to original position */ } } else /* have to read each value individually (not contiguous ) */ { ffmbyt(fptr, byteloc, REPORT_EOF, status); ffgbytoff(fptr, 4, nvals, incre - 4, values, status); } #if BYTESWAPPED ffswap4(values, nvals); /* reverse order of bytes in each value */ #endif return(*status); } /*--------------------------------------------------------------------------*/ int ffgi8b(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG byteloc, /* I - position within file to start reading */ long nvals, /* I - number of pixels to read */ long incre, /* I - byte increment between pixels */ long *values, /* O - returned array of values */ int *status) /* IO - error status */ /* get (read) the array of values from the FITS file, doing machine dependent format conversion (e.g. byte-swapping) if necessary. !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! This routine reads 'nvals' 8-byte integers into 'values'. This works both on platforms that have sizeof(long) = 64, and 32, as long as 'values' has been allocated to large enough to hold 8 * nvals bytes of data. !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! */ { LONGLONG postemp; if (incre == 8) /* read all the values at once (contiguous bytes) */ { if (nvals * 8 < MINDIRECT) /* read normally via IO buffers */ { ffmbyt(fptr, byteloc, REPORT_EOF, status); ffgbyt(fptr, nvals * 8, values, status); } else /* read directly from disk, bypassing IO buffers */ { postemp = (fptr->Fptr)->bytepos; /* store current file position */ (fptr->Fptr)->bytepos = byteloc; /* set to the desired position */ ffgbyt(fptr, nvals * 8, values, status); (fptr->Fptr)->bytepos = postemp; /* reset to original position */ } } else /* have to read each value individually (not contiguous ) */ { ffmbyt(fptr, byteloc, REPORT_EOF, status); ffgbytoff(fptr, 8, nvals, incre - 8, values, status); } #if BYTESWAPPED ffswap8((double *) values, nvals); /* reverse bytes in each value */ #endif return(*status); } /*--------------------------------------------------------------------------*/ int ffgr4b(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG byteloc, /* I - position within file to start reading */ long nvals, /* I - number of pixels to read */ long incre, /* I - byte increment between pixels */ float *values, /* O - returned array of values */ int *status) /* IO - error status */ /* get (read) the array of values from the FITS file, doing machine dependent format conversion (e.g. byte-swapping) if necessary. */ { LONGLONG postemp; #if MACHINE == VAXVMS long ii; #elif (MACHINE == ALPHAVMS) && (FLOATTYPE == GFLOAT) short *sptr; long ii; #endif if (incre == 4) /* read all the values at once (contiguous bytes) */ { if (nvals * 4 < MINDIRECT) /* read normally via IO buffers */ { ffmbyt(fptr, byteloc, REPORT_EOF, status); ffgbyt(fptr, nvals * 4, values, status); } else /* read directly from disk, bypassing IO buffers */ { postemp = (fptr->Fptr)->bytepos; /* store current file position */ (fptr->Fptr)->bytepos = byteloc; /* set to the desired position */ ffgbyt(fptr, nvals * 4, values, status); (fptr->Fptr)->bytepos = postemp; /* reset to original position */ } } else /* have to read each value individually (not contiguous ) */ { ffmbyt(fptr, byteloc, REPORT_EOF, status); ffgbytoff(fptr, 4, nvals, incre - 4, values, status); } #if MACHINE == VAXVMS ii = nvals; /* call VAX macro routine to convert */ ieevur(values, values, &ii); /* from IEEE float -> F float */ #elif (MACHINE == ALPHAVMS) && (FLOATTYPE == GFLOAT) ffswap2( (short *) values, nvals * 2); /* swap pairs of bytes */ /* convert from IEEE float format to VMS GFLOAT float format */ sptr = (short *) values; for (ii = 0; ii < nvals; ii++, sptr += 2) { if (!fnan(*sptr) ) /* test for NaN or underflow */ values[ii] *= 4.0; } #elif BYTESWAPPED ffswap4((INT32BIT *)values, nvals); /* reverse order of bytes in values */ #endif return(*status); } /*--------------------------------------------------------------------------*/ int ffgr8b(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG byteloc, /* I - position within file to start reading */ long nvals, /* I - number of pixels to read */ long incre, /* I - byte increment between pixels */ double *values, /* O - returned array of values */ int *status) /* IO - error status */ /* get (read) the array of values from the FITS file, doing machine dependent format conversion (e.g. byte-swapping) if necessary. */ { LONGLONG postemp; #if MACHINE == VAXVMS long ii; #elif (MACHINE == ALPHAVMS) && (FLOATTYPE == GFLOAT) short *sptr; long ii; #endif if (incre == 8) /* read all the values at once (contiguous bytes) */ { if (nvals * 8 < MINDIRECT) /* read normally via IO buffers */ { ffmbyt(fptr, byteloc, REPORT_EOF, status); ffgbyt(fptr, nvals * 8, values, status); } else /* read directly from disk, bypassing IO buffers */ { postemp = (fptr->Fptr)->bytepos; /* store current file position */ (fptr->Fptr)->bytepos = byteloc; /* set to the desired position */ ffgbyt(fptr, nvals * 8, values, status); (fptr->Fptr)->bytepos = postemp; /* reset to original position */ } } else /* have to read each value individually (not contiguous ) */ { ffmbyt(fptr, byteloc, REPORT_EOF, status); ffgbytoff(fptr, 8, nvals, incre - 8, values, status); } #if MACHINE == VAXVMS ii = nvals; /* call VAX macro routine to convert */ ieevud(values, values, &ii); /* from IEEE float -> D float */ #elif (MACHINE == ALPHAVMS) && (FLOATTYPE == GFLOAT) ffswap2( (short *) values, nvals * 4); /* swap pairs of bytes */ /* convert from IEEE float format to VMS GFLOAT float format */ sptr = (short *) values; for (ii = 0; ii < nvals; ii++, sptr += 4) { if (!dnan(*sptr) ) /* test for NaN or underflow */ values[ii] *= 4.0; } #elif BYTESWAPPED ffswap8(values, nvals); /* reverse order of bytes in each value */ #endif return(*status); } /*--------------------------------------------------------------------------*/ int ffptbb(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG firstrow, /* I - starting row (1 = first row) */ LONGLONG firstchar, /* I - starting byte in row (1=first) */ LONGLONG nchars, /* I - number of bytes to write */ unsigned char *values, /* I - array of bytes to write */ int *status) /* IO - error status */ /* write a consecutive string of bytes to an ascii or binary table. This will span multiple rows of the table if nchars + firstchar is greater than the length of a row. */ { LONGLONG bytepos, endrow, nrows; char message[FLEN_ERRMSG]; if (*status > 0 || nchars <= 0) return(*status); else if (firstrow < 1) return(*status=BAD_ROW_NUM); else if (firstchar < 1) return(*status=BAD_ELEM_NUM); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart < 0) /* rescan header if data undefined */ ffrdef(fptr, status); endrow = ((firstchar + nchars - 2) / (fptr->Fptr)->rowlength) + firstrow; /* check if we are writing beyond the current end of table */ if (endrow > (fptr->Fptr)->numrows) { /* if there are more HDUs following the current one, or */ /* if there is a data heap, then we must insert space */ /* for the new rows. */ if ( !((fptr->Fptr)->lasthdu) || (fptr->Fptr)->heapsize > 0) { nrows = endrow - ((fptr->Fptr)->numrows); /* ffirow also updates the heap address and numrows */ if (ffirow(fptr, (fptr->Fptr)->numrows, nrows, status) > 0) { snprintf(message, FLEN_ERRMSG, "ffptbb failed to add space for %.0f new rows in table.", (double) nrows); ffpmsg(message); return(*status); } } else { /* manally update heap starting address */ (fptr->Fptr)->heapstart += ((LONGLONG)(endrow - (fptr->Fptr)->numrows) * (fptr->Fptr)->rowlength ); (fptr->Fptr)->numrows = endrow; /* update number of rows */ } } /* move the i/o pointer to the start of the sequence of characters */ bytepos = (fptr->Fptr)->datastart + ((fptr->Fptr)->rowlength * (firstrow - 1)) + firstchar - 1; ffmbyt(fptr, bytepos, IGNORE_EOF, status); ffpbyt(fptr, nchars, values, status); /* write the bytes */ return(*status); } /*--------------------------------------------------------------------------*/ int ffpi1b(fitsfile *fptr, /* I - FITS file pointer */ long nvals, /* I - number of pixels in the values array */ long incre, /* I - byte increment between pixels */ unsigned char *values, /* I - array of values to write */ int *status) /* IO - error status */ /* put (write) the array of values to the FITS file, doing machine dependent format conversion (e.g. byte-swapping) if necessary. */ { if (incre == 1) /* write all the values at once (contiguous bytes) */ ffpbyt(fptr, nvals, values, status); else /* have to write each value individually (not contiguous ) */ ffpbytoff(fptr, 1, nvals, incre - 1, values, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffpi2b(fitsfile *fptr, /* I - FITS file pointer */ long nvals, /* I - number of pixels in the values array */ long incre, /* I - byte increment between pixels */ short *values, /* I - array of values to write */ int *status) /* IO - error status */ /* put (write) the array of values to the FITS file, doing machine dependent format conversion (e.g. byte-swapping) if necessary. */ { #if BYTESWAPPED ffswap2(values, nvals); /* reverse order of bytes in each value */ #endif if (incre == 2) /* write all the values at once (contiguous bytes) */ ffpbyt(fptr, nvals * 2, values, status); else /* have to write each value individually (not contiguous ) */ ffpbytoff(fptr, 2, nvals, incre - 2, values, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffpi4b(fitsfile *fptr, /* I - FITS file pointer */ long nvals, /* I - number of pixels in the values array */ long incre, /* I - byte increment between pixels */ INT32BIT *values, /* I - array of values to write */ int *status) /* IO - error status */ /* put (write) the array of values to the FITS file, doing machine dependent format conversion (e.g. byte-swapping) if necessary. */ { #if BYTESWAPPED ffswap4(values, nvals); /* reverse order of bytes in each value */ #endif if (incre == 4) /* write all the values at once (contiguous bytes) */ ffpbyt(fptr, nvals * 4, values, status); else /* have to write each value individually (not contiguous ) */ ffpbytoff(fptr, 4, nvals, incre - 4, values, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffpi8b(fitsfile *fptr, /* I - FITS file pointer */ long nvals, /* I - number of pixels in the values array */ long incre, /* I - byte increment between pixels */ long *values, /* I - array of values to write */ int *status) /* IO - error status */ /* put (write) the array of values to the FITS file, doing machine dependent format conversion (e.g. byte-swapping) if necessary. !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! This routine writes 'nvals' 8-byte integers from 'values'. This works both on platforms that have sizeof(long) = 64, and 32, as long as 'values' has been allocated to large enough to hold 8 * nvals bytes of data. !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! */ { #if BYTESWAPPED ffswap8((double *) values, nvals); /* reverse bytes in each value */ #endif if (incre == 8) /* write all the values at once (contiguous bytes) */ ffpbyt(fptr, nvals * 8, values, status); else /* have to write each value individually (not contiguous ) */ ffpbytoff(fptr, 8, nvals, incre - 8, values, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffpr4b(fitsfile *fptr, /* I - FITS file pointer */ long nvals, /* I - number of pixels in the values array */ long incre, /* I - byte increment between pixels */ float *values, /* I - array of values to write */ int *status) /* IO - error status */ /* put (write) the array of values to the FITS file, doing machine dependent format conversion (e.g. byte-swapping) if necessary. */ { #if MACHINE == VAXVMS long ii; ii = nvals; /* call VAX macro routine to convert */ ieevpr(values, values, &ii); /* from F float -> IEEE float */ #elif (MACHINE == ALPHAVMS) && (FLOATTYPE == GFLOAT) long ii; /* convert from VMS FFLOAT float format to IEEE float format */ for (ii = 0; ii < nvals; ii++) values[ii] *= 0.25; ffswap2( (short *) values, nvals * 2); /* swap pairs of bytes */ #elif BYTESWAPPED ffswap4((INT32BIT *) values, nvals); /* reverse order of bytes in values */ #endif if (incre == 4) /* write all the values at once (contiguous bytes) */ ffpbyt(fptr, nvals * 4, values, status); else /* have to write each value individually (not contiguous ) */ ffpbytoff(fptr, 4, nvals, incre - 4, values, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffpr8b(fitsfile *fptr, /* I - FITS file pointer */ long nvals, /* I - number of pixels in the values array */ long incre, /* I - byte increment between pixels */ double *values, /* I - array of values to write */ int *status) /* IO - error status */ /* put (write) the array of values to the FITS file, doing machine dependent format conversion (e.g. byte-swapping) if necessary. */ { #if MACHINE == VAXVMS long ii; ii = nvals; /* call VAX macro routine to convert */ ieevpd(values, values, &ii); /* from D float -> IEEE float */ #elif (MACHINE == ALPHAVMS) && (FLOATTYPE == GFLOAT) long ii; /* convert from VMS GFLOAT float format to IEEE float format */ for (ii = 0; ii < nvals; ii++) values[ii] *= 0.25; ffswap2( (short *) values, nvals * 4); /* swap pairs of bytes */ #elif BYTESWAPPED ffswap8(values, nvals); /* reverse order of bytes in each value */ #endif if (incre == 8) /* write all the values at once (contiguous bytes) */ ffpbyt(fptr, nvals * 8, values, status); else /* have to write each value individually (not contiguous ) */ ffpbytoff(fptr, 8, nvals, incre - 8, values, status); return(*status); } cfitsio-3.47/cfileio.c0000644000225700000360000076624113464573431014205 0ustar cagordonlhea/* This file, cfileio.c, contains the low-level file access routines. */ /* The FITSIO software was written by William Pence at the High Energy */ /* Astrophysic Science Archive Research Center (HEASARC) at the NASA */ /* Goddard Space Flight Center. */ #include #include #include #include #include #include /* apparently needed to define size_t */ #include "fitsio2.h" #include "group.h" #ifdef CFITSIO_HAVE_CURL #include #endif #define MAX_PREFIX_LEN 20 /* max length of file type prefix (e.g. 'http://') */ #define MAX_DRIVERS 31 /* max number of file I/O drivers */ typedef struct /* structure containing pointers to I/O driver functions */ { char prefix[MAX_PREFIX_LEN]; int (*init)(void); int (*shutdown)(void); int (*setoptions)(int option); int (*getoptions)(int *options); int (*getversion)(int *version); int (*checkfile)(char *urltype, char *infile, char *outfile); int (*open)(char *filename, int rwmode, int *driverhandle); int (*create)(char *filename, int *drivehandle); int (*truncate)(int drivehandle, LONGLONG size); int (*close)(int drivehandle); int (*remove)(char *filename); int (*size)(int drivehandle, LONGLONG *size); int (*flush)(int drivehandle); int (*seek)(int drivehandle, LONGLONG offset); int (*read)(int drivehandle, void *buffer, long nbytes); int (*write)(int drivehandle, void *buffer, long nbytes); } fitsdriver; fitsdriver driverTable[MAX_DRIVERS]; /* allocate driver tables */ FITSfile *FptrTable[NMAXFILES]; /* this table of Fptr pointers is */ /* used by fits_already_open */ int need_to_initialize = 1; /* true if CFITSIO has not been initialized */ int no_of_drivers = 0; /* number of currently defined I/O drivers */ static int pixel_filter_helper(fitsfile **fptr, char *outfile, char *expr, int *status); static int find_quote(char **string); static int find_doublequote(char **string); static int find_paren(char **string); static int find_bracket(char **string); static int find_curlybracket(char **string); int comma2semicolon(char *string); #ifdef _REENTRANT pthread_mutex_t Fitsio_InitLock = PTHREAD_MUTEX_INITIALIZER; #endif /*--------------------------------------------------------------------------*/ int fitsio_init_lock(void) { int status = 0; #ifdef _REENTRANT static int need_to_init = 1; pthread_mutexattr_t mutex_init; FFLOCK1(Fitsio_InitLock); if (need_to_init) { /* Init the main fitsio lock here since we need a a recursive lock */ status = pthread_mutexattr_init(&mutex_init); if (status) { ffpmsg("pthread_mutexattr_init failed (fitsio_init_lock)"); return(status); } #ifdef __GLIBC__ status = pthread_mutexattr_settype(&mutex_init, PTHREAD_MUTEX_RECURSIVE_NP); #else status = pthread_mutexattr_settype(&mutex_init, PTHREAD_MUTEX_RECURSIVE); #endif if (status) { ffpmsg("pthread_mutexattr_settype failed (fitsio_init_lock)"); return(status); } status = pthread_mutex_init(&Fitsio_Lock,&mutex_init); if (status) { ffpmsg("pthread_mutex_init failed (fitsio_init_lock)"); return(status); } need_to_init = 0; } FFUNLOCK1(Fitsio_InitLock); #endif return(status); } /*--------------------------------------------------------------------------*/ int ffomem(fitsfile **fptr, /* O - FITS file pointer */ const char *name, /* I - name of file to open */ int mode, /* I - 0 = open readonly; 1 = read/write */ void **buffptr, /* I - address of memory pointer */ size_t *buffsize, /* I - size of buffer, in bytes */ size_t deltasize, /* I - increment for future realloc's */ void *(*mem_realloc)(void *p, size_t newsize), /* function */ int *status) /* IO - error status */ /* Open an existing FITS file in core memory. This is a specialized version of ffopen. */ { int ii, driver, handle, hdutyp, slen, movetotype, extvers, extnum; char extname[FLEN_VALUE]; LONGLONG filesize; char urltype[MAX_PREFIX_LEN], infile[FLEN_FILENAME], outfile[FLEN_FILENAME]; char extspec[FLEN_FILENAME], rowfilter[FLEN_FILENAME]; char binspec[FLEN_FILENAME], colspec[FLEN_FILENAME]; char imagecolname[FLEN_VALUE], rowexpress[FLEN_FILENAME]; char *url, errmsg[FLEN_ERRMSG]; char *hdtype[3] = {"IMAGE", "TABLE", "BINTABLE"}; if (*status > 0) return(*status); *fptr = 0; /* initialize null file pointer */ if (need_to_initialize) /* this is called only once */ { *status = fits_init_cfitsio(); if (*status > 0) return(*status); } url = (char *) name; while (*url == ' ') /* ignore leading spaces in the file spec */ url++; /* parse the input file specification */ fits_parse_input_url(url, urltype, infile, outfile, extspec, rowfilter, binspec, colspec, status); strcpy(urltype, "memkeep://"); /* URL type for pre-existing memory file */ *status = urltype2driver(urltype, &driver); if (*status > 0) { ffpmsg("could not find driver for pre-existing memory file: (ffomem)"); return(*status); } /* call driver routine to open the memory file */ FFLOCK; /* lock this while searching for vacant handle */ *status = mem_openmem( buffptr, buffsize,deltasize, mem_realloc, &handle); FFUNLOCK; if (*status > 0) { ffpmsg("failed to open pre-existing memory file: (ffomem)"); return(*status); } /* get initial file size */ *status = (*driverTable[driver].size)(handle, &filesize); if (*status > 0) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed get the size of the memory file: (ffomem)"); return(*status); } /* allocate fitsfile structure and initialize = 0 */ *fptr = (fitsfile *) calloc(1, sizeof(fitsfile)); if (!(*fptr)) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate structure for following file: (ffomem)"); ffpmsg(url); return(*status = MEMORY_ALLOCATION); } /* allocate FITSfile structure and initialize = 0 */ (*fptr)->Fptr = (FITSfile *) calloc(1, sizeof(FITSfile)); if (!((*fptr)->Fptr)) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate structure for following file: (ffomem)"); ffpmsg(url); free(*fptr); *fptr = 0; return(*status = MEMORY_ALLOCATION); } slen = strlen(url) + 1; slen = maxvalue(slen, 32); /* reserve at least 32 chars */ ((*fptr)->Fptr)->filename = (char *) malloc(slen); /* mem for file name */ if ( !(((*fptr)->Fptr)->filename) ) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate memory for filename: (ffomem)"); ffpmsg(url); free((*fptr)->Fptr); free(*fptr); *fptr = 0; /* return null file pointer */ return(*status = MEMORY_ALLOCATION); } /* mem for headstart array */ ((*fptr)->Fptr)->headstart = (LONGLONG *) calloc(1001, sizeof(LONGLONG)); if ( !(((*fptr)->Fptr)->headstart) ) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate memory for headstart array: (ffomem)"); ffpmsg(url); free( ((*fptr)->Fptr)->filename); free((*fptr)->Fptr); free(*fptr); *fptr = 0; /* return null file pointer */ return(*status = MEMORY_ALLOCATION); } /* mem for file I/O buffers */ ((*fptr)->Fptr)->iobuffer = (char *) calloc(NIOBUF, IOBUFLEN); if ( !(((*fptr)->Fptr)->iobuffer) ) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate memory for iobuffer array: (ffomem)"); ffpmsg(url); free( ((*fptr)->Fptr)->headstart); /* free memory for headstart array */ free( ((*fptr)->Fptr)->filename); free((*fptr)->Fptr); free(*fptr); *fptr = 0; /* return null file pointer */ return(*status = MEMORY_ALLOCATION); } /* initialize the ageindex array (relative age of the I/O buffers) */ /* and initialize the bufrecnum array as being empty */ for (ii = 0; ii < NIOBUF; ii++) { ((*fptr)->Fptr)->ageindex[ii] = ii; ((*fptr)->Fptr)->bufrecnum[ii] = -1; } /* store the parameters describing the file */ ((*fptr)->Fptr)->MAXHDU = 1000; /* initial size of headstart */ ((*fptr)->Fptr)->filehandle = handle; /* file handle */ ((*fptr)->Fptr)->driver = driver; /* driver number */ strcpy(((*fptr)->Fptr)->filename, url); /* full input filename */ ((*fptr)->Fptr)->filesize = filesize; /* physical file size */ ((*fptr)->Fptr)->logfilesize = filesize; /* logical file size */ ((*fptr)->Fptr)->writemode = mode; /* read-write mode */ ((*fptr)->Fptr)->datastart = DATA_UNDEFINED; /* unknown start of data */ ((*fptr)->Fptr)->curbuf = -1; /* undefined current IO buffer */ ((*fptr)->Fptr)->open_count = 1; /* structure is currently used once */ ((*fptr)->Fptr)->validcode = VALIDSTRUC; /* flag denoting valid structure */ ffldrc(*fptr, 0, REPORT_EOF, status); /* load first record */ fits_store_Fptr( (*fptr)->Fptr, status); /* store Fptr address */ if (ffrhdu(*fptr, &hdutyp, status) > 0) /* determine HDU structure */ { ffpmsg( "ffomem could not interpret primary array header of file: (ffomem)"); ffpmsg(url); if (*status == UNKNOWN_REC) ffpmsg("This does not look like a FITS file."); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ } /* ---------------------------------------------------------- */ /* move to desired extension, if specified as part of the URL */ /* ---------------------------------------------------------- */ imagecolname[0] = '\0'; rowexpress[0] = '\0'; if (*extspec) { /* parse the extension specifier into individual parameters */ ffexts(extspec, &extnum, extname, &extvers, &movetotype, imagecolname, rowexpress, status); if (*status > 0) return(*status); if (extnum) { ffmahd(*fptr, extnum + 1, &hdutyp, status); } else if (*extname) /* move to named extension, if specified */ { ffmnhd(*fptr, movetotype, extname, extvers, status); } if (*status > 0) { ffpmsg("ffomem could not move to the specified extension:"); if (extnum > 0) { snprintf(errmsg, FLEN_ERRMSG, " extension number %d doesn't exist or couldn't be opened.",extnum); ffpmsg(errmsg); } else { snprintf(errmsg, FLEN_ERRMSG, " extension with EXTNAME = %s,", extname); ffpmsg(errmsg); if (extvers) { snprintf(errmsg, FLEN_ERRMSG, " and with EXTVERS = %d,", extvers); ffpmsg(errmsg); } if (movetotype != ANY_HDU) { snprintf(errmsg, FLEN_ERRMSG, " and with XTENSION = %s,", hdtype[movetotype]); ffpmsg(errmsg); } ffpmsg(" doesn't exist or couldn't be opened."); } return(*status); } } return(*status); } /*--------------------------------------------------------------------------*/ int ffdkopn(fitsfile **fptr, /* O - FITS file pointer */ const char *name, /* I - full name of file to open */ int mode, /* I - 0 = open readonly; 1 = read/write */ int *status) /* IO - error status */ /* Open an existing FITS file on magnetic disk with either readonly or read/write access. The routine does not support CFITSIO's extended filename syntax and simply uses the entire input 'name' string as the name of the file. */ { if (*status > 0) return(*status); *status = OPEN_DISK_FILE; ffopen(fptr, name, mode, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffdopn(fitsfile **fptr, /* O - FITS file pointer */ const char *name, /* I - full name of file to open */ int mode, /* I - 0 = open readonly; 1 = read/write */ int *status) /* IO - error status */ /* Open an existing FITS file with either readonly or read/write access. and move to the first HDU that contains 'interesting' data, if the primary array contains a null image (i.e., NAXIS = 0). */ { if (*status > 0) return(*status); *status = SKIP_NULL_PRIMARY; ffopen(fptr, name, mode, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffeopn(fitsfile **fptr, /* O - FITS file pointer */ const char *name, /* I - full name of file to open */ int mode, /* I - 0 = open readonly; 1 = read/write */ char *extlist, /* I - list of 'good' extensions to move to */ int *hdutype, /* O - type of extension that is moved to */ int *status) /* IO - error status */ /* Open an existing FITS file with either readonly or read/write access. and if the primary array contains a null image (i.e., NAXIS = 0) then attempt to move to the first extension named in the extlist of extension names. If none are found, then simply move to the 2nd extension. */ { int hdunum, naxis, thdutype, gotext=0; char *ext, *textlist; char *saveptr; if (*status > 0) return(*status); if (ffopen(fptr, name, mode, status) > 0) return(*status); fits_get_hdu_num(*fptr, &hdunum); fits_get_img_dim(*fptr, &naxis, status); if( (hdunum == 1) && (naxis == 0) ){ /* look through the extension list */ if( extlist ){ gotext = 0; textlist = malloc(strlen(extlist) + 1); if (!textlist) { *status = MEMORY_ALLOCATION; return(*status); } strcpy(textlist, extlist); for(ext=(char *)ffstrtok(textlist, " ",&saveptr); ext != NULL; ext=(char *)ffstrtok(NULL," ",&saveptr)){ fits_movnam_hdu(*fptr, ANY_HDU, ext, 0, status); if( *status == 0 ){ gotext = 1; break; } else { *status = 0; } } free(textlist); } if( !gotext ){ /* if all else fails, move to extension #2 and hope for the best */ fits_movabs_hdu(*fptr, 2, &thdutype, status); } } fits_get_hdu_type(*fptr, hdutype, status); return(*status); } /*--------------------------------------------------------------------------*/ int fftopn(fitsfile **fptr, /* O - FITS file pointer */ const char *name, /* I - full name of file to open */ int mode, /* I - 0 = open readonly; 1 = read/write */ int *status) /* IO - error status */ /* Open an existing FITS file with either readonly or read/write access. and move to the first HDU that contains 'interesting' table (not an image). */ { int hdutype; if (*status > 0) return(*status); *status = SKIP_IMAGE; ffopen(fptr, name, mode, status); if (ffghdt(*fptr, &hdutype, status) <= 0) { if (hdutype == IMAGE_HDU) *status = NOT_TABLE; } return(*status); } /*--------------------------------------------------------------------------*/ int ffiopn(fitsfile **fptr, /* O - FITS file pointer */ const char *name, /* I - full name of file to open */ int mode, /* I - 0 = open readonly; 1 = read/write */ int *status) /* IO - error status */ /* Open an existing FITS file with either readonly or read/write access. and move to the first HDU that contains 'interesting' image (not an table). */ { int hdutype; if (*status > 0) return(*status); *status = SKIP_TABLE; ffopen(fptr, name, mode, status); if (ffghdt(*fptr, &hdutype, status) <= 0) { if (hdutype != IMAGE_HDU) *status = NOT_IMAGE; } return(*status); } /*--------------------------------------------------------------------------*/ int ffopentest(int soname, /* I - CFITSIO shared library version */ /* application program (fitsio.h file) */ fitsfile **fptr, /* O - FITS file pointer */ const char *name, /* I - full name of file to open */ int mode, /* I - 0 = open readonly; 1 = read/write */ int *status) /* IO - error status */ /* Open an existing FITS file with either readonly or read/write access. First test that the SONAME of fitsio.h used to build the CFITSIO library is the same as was used in compiling the application program that links to the library. */ { if (soname != CFITSIO_SONAME) { printf("\nERROR: Mismatch in the CFITSIO_SONAME value in the fitsio.h include file\n"); printf("that was used to build the CFITSIO library, and the value in the include file\n"); printf("that was used when compiling the application program:\n"); printf(" Version used to build the CFITSIO library = %d\n",CFITSIO_SONAME); printf(" Version included by the application program = %d\n",soname); printf("\nFix this by recompiling and then relinking this application program \n"); printf("with the CFITSIO library.\n"); *status = FILE_NOT_OPENED; return(*status); } /* now call the normal file open routine */ ffopen(fptr, name, mode, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffopen(fitsfile **fptr, /* O - FITS file pointer */ const char *name, /* I - full name of file to open */ int mode, /* I - 0 = open readonly; 1 = read/write */ int *status) /* IO - error status */ /* Open an existing FITS file with either readonly or read/write access. */ { fitsfile *newptr; int ii, driver, hdutyp, hdunum, slen, writecopy, isopen; LONGLONG filesize; long rownum, nrows, goodrows; int extnum, extvers, handle, movetotype, tstatus = 0, only_one = 0; char urltype[MAX_PREFIX_LEN], infile[FLEN_FILENAME], outfile[FLEN_FILENAME]; char origurltype[MAX_PREFIX_LEN], extspec[FLEN_FILENAME]; char extname[FLEN_VALUE], rowfilter[FLEN_FILENAME], tblname[FLEN_VALUE]; char imagecolname[FLEN_VALUE], rowexpress[FLEN_FILENAME]; char binspec[FLEN_FILENAME], colspec[FLEN_FILENAME], pixfilter[FLEN_FILENAME]; char histfilename[FLEN_FILENAME]; char filtfilename[FLEN_FILENAME], compspec[FLEN_FILENAME]; char wtcol[FLEN_VALUE]; char minname[4][FLEN_VALUE], maxname[4][FLEN_VALUE]; char binname[4][FLEN_VALUE]; char *url; double minin[4], maxin[4], binsizein[4], weight; int imagetype, naxis = 1, haxis, recip; int skip_null = 0, skip_image = 0, skip_table = 0, open_disk_file = 0; char colname[4][FLEN_VALUE]; char errmsg[FLEN_ERRMSG]; char *hdtype[3] = {"IMAGE", "TABLE", "BINTABLE"}; char *rowselect = 0; if (*status > 0) return(*status); if (*status == SKIP_NULL_PRIMARY) { /* this special status value is used as a flag by ffdopn to tell */ /* ffopen to skip over a null primary array when opening the file. */ skip_null = 1; *status = 0; } else if (*status == SKIP_IMAGE) { /* this special status value is used as a flag by fftopn to tell */ /* ffopen to move to 1st significant table when opening the file. */ skip_image = 1; *status = 0; } else if (*status == SKIP_TABLE) { /* this special status value is used as a flag by ffiopn to tell */ /* ffopen to move to 1st significant image when opening the file. */ skip_table = 1; *status = 0; } else if (*status == OPEN_DISK_FILE) { /* this special status value is used as a flag by ffdkopn to tell */ /* ffopen to not interpret the input filename using CFITSIO's */ /* extended filename syntax, and simply open the specified disk file */ open_disk_file = 1; *status = 0; } *fptr = 0; /* initialize null file pointer */ writecopy = 0; /* have we made a write-able copy of the input file? */ if (need_to_initialize) { /* this is called only once */ *status = fits_init_cfitsio(); } if (*status > 0) return(*status); url = (char *) name; while (*url == ' ') /* ignore leading spaces in the filename */ url++; if (*url == '\0') { ffpmsg("Name of file to open is blank. (ffopen)"); return(*status = FILE_NOT_OPENED); } if (open_disk_file) { /* treat the input URL literally as the name of the file to open */ /* and don't try to parse the URL using the extended filename syntax */ if (strlen(url) > FLEN_FILENAME - 1) { ffpmsg("Name of file to open is too long. (ffopen)"); return(*status = FILE_NOT_OPENED); } strcpy(infile,url); strcpy(urltype, "file://"); outfile[0] = '\0'; extspec[0] = '\0'; binspec[0] = '\0'; colspec[0] = '\0'; rowfilter[0] = '\0'; pixfilter[0] = '\0'; compspec[0] = '\0'; } else { /* parse the input file specification */ /* NOTE: This routine tests that all the strings do not */ /* overflow the standard buffer sizes (FLEN_FILENAME, etc.) */ /* therefore in general we do not have to worry about buffer */ /* overflow of any of the returned strings. */ /* call the newer version of this parsing routine that supports 'compspec' */ ffifile2(url, urltype, infile, outfile, extspec, rowfilter, binspec, colspec, pixfilter, compspec, status); } if (*status > 0) { ffpmsg("could not parse the input filename: (ffopen)"); ffpmsg(url); return(*status); } imagecolname[0] = '\0'; rowexpress[0] = '\0'; if (*extspec) { slen = strlen(extspec); if (extspec[slen - 1] == '#') { /* special symbol to mean only copy this extension */ extspec[slen - 1] = '\0'; only_one = 1; } /* parse the extension specifier into individual parameters */ ffexts(extspec, &extnum, extname, &extvers, &movetotype, imagecolname, rowexpress, status); if (*status > 0) return(*status); } /*-------------------------------------------------------------------*/ /* special cases: */ /*-------------------------------------------------------------------*/ histfilename[0] = '\0'; filtfilename[0] = '\0'; if (*outfile && (*binspec || *imagecolname || *pixfilter)) { /* if binspec or imagecolumn are specified, then the */ /* output file name is intended for the final image, */ /* and not a copy of the input file. */ strcpy(histfilename, outfile); outfile[0] = '\0'; } else if (*outfile && (*rowfilter || *colspec)) { /* if rowfilter or colspece are specified, then the */ /* output file name is intended for the filtered file */ /* and not a copy of the input file. */ strcpy(filtfilename, outfile); outfile[0] = '\0'; } /*-------------------------------------------------------------------*/ /* check if this same file is already open, and if so, attach to it */ /*-------------------------------------------------------------------*/ FFLOCK; if (fits_already_open(fptr, url, urltype, infile, extspec, rowfilter, binspec, colspec, mode, &isopen, status) > 0) { FFUNLOCK; return(*status); } FFUNLOCK; if (isopen) { goto move2hdu; } /* get the driver number corresponding to this urltype */ *status = urltype2driver(urltype, &driver); if (*status > 0) { ffpmsg("could not find driver for this file: (ffopen)"); ffpmsg(urltype); ffpmsg(url); return(*status); } /*------------------------------------------------------------------- deal with all those messy special cases which may require that a different driver be used: - is disk file compressed? - are ftp:, gsiftp:, or http: files compressed? - has user requested that a local copy be made of the ftp or http file? -------------------------------------------------------------------*/ if (driverTable[driver].checkfile) { strcpy(origurltype,urltype); /* Save the urltype */ /* 'checkfile' may modify the urltype, infile and outfile strings */ *status = (*driverTable[driver].checkfile)(urltype, infile, outfile); if (*status) { ffpmsg("checkfile failed for this file: (ffopen)"); ffpmsg(url); return(*status); } if (strcmp(origurltype, urltype)) /* did driver changed on us? */ { *status = urltype2driver(urltype, &driver); if (*status > 0) { ffpmsg("could not change driver for this file: (ffopen)"); ffpmsg(url); ffpmsg(urltype); return(*status); } } } /* call appropriate driver to open the file */ if (driverTable[driver].open) { FFLOCK; /* lock this while searching for vacant handle */ *status = (*driverTable[driver].open)(infile, mode, &handle); FFUNLOCK; if (*status > 0) { ffpmsg("failed to find or open the following file: (ffopen)"); ffpmsg(url); return(*status); } } else { ffpmsg("cannot open an existing file of this type: (ffopen)"); ffpmsg(url); return(*status = FILE_NOT_OPENED); } /* get initial file size */ *status = (*driverTable[driver].size)(handle, &filesize); if (*status > 0) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed get the size of the following file: (ffopen)"); ffpmsg(url); return(*status); } /* allocate fitsfile structure and initialize = 0 */ *fptr = (fitsfile *) calloc(1, sizeof(fitsfile)); if (!(*fptr)) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate structure for following file: (ffopen)"); ffpmsg(url); return(*status = MEMORY_ALLOCATION); } /* allocate FITSfile structure and initialize = 0 */ (*fptr)->Fptr = (FITSfile *) calloc(1, sizeof(FITSfile)); if (!((*fptr)->Fptr)) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate structure for following file: (ffopen)"); ffpmsg(url); free(*fptr); *fptr = 0; return(*status = MEMORY_ALLOCATION); } slen = strlen(url) + 1; slen = maxvalue(slen, 32); /* reserve at least 32 chars */ ((*fptr)->Fptr)->filename = (char *) malloc(slen); /* mem for file name */ if ( !(((*fptr)->Fptr)->filename) ) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate memory for filename: (ffopen)"); ffpmsg(url); free((*fptr)->Fptr); free(*fptr); *fptr = 0; /* return null file pointer */ return(*status = MEMORY_ALLOCATION); } /* mem for headstart array */ ((*fptr)->Fptr)->headstart = (LONGLONG *) calloc(1001, sizeof(LONGLONG)); if ( !(((*fptr)->Fptr)->headstart) ) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate memory for headstart array: (ffopen)"); ffpmsg(url); free( ((*fptr)->Fptr)->filename); free((*fptr)->Fptr); free(*fptr); *fptr = 0; /* return null file pointer */ return(*status = MEMORY_ALLOCATION); } /* mem for file I/O buffers */ ((*fptr)->Fptr)->iobuffer = (char *) calloc(NIOBUF, IOBUFLEN); if ( !(((*fptr)->Fptr)->iobuffer) ) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate memory for iobuffer array: (ffopen)"); ffpmsg(url); free( ((*fptr)->Fptr)->headstart); /* free memory for headstart array */ free( ((*fptr)->Fptr)->filename); free((*fptr)->Fptr); free(*fptr); *fptr = 0; /* return null file pointer */ return(*status = MEMORY_ALLOCATION); } /* initialize the ageindex array (relative age of the I/O buffers) */ /* and initialize the bufrecnum array as being empty */ for (ii = 0; ii < NIOBUF; ii++) { ((*fptr)->Fptr)->ageindex[ii] = ii; ((*fptr)->Fptr)->bufrecnum[ii] = -1; } /* store the parameters describing the file */ ((*fptr)->Fptr)->MAXHDU = 1000; /* initial size of headstart */ ((*fptr)->Fptr)->filehandle = handle; /* file handle */ ((*fptr)->Fptr)->driver = driver; /* driver number */ strcpy(((*fptr)->Fptr)->filename, url); /* full input filename */ ((*fptr)->Fptr)->filesize = filesize; /* physical file size */ ((*fptr)->Fptr)->logfilesize = filesize; /* logical file size */ ((*fptr)->Fptr)->writemode = mode; /* read-write mode */ ((*fptr)->Fptr)->datastart = DATA_UNDEFINED; /* unknown start of data */ ((*fptr)->Fptr)->curbuf = -1; /* undefined current IO buffer */ ((*fptr)->Fptr)->open_count = 1; /* structure is currently used once */ ((*fptr)->Fptr)->validcode = VALIDSTRUC; /* flag denoting valid structure */ ((*fptr)->Fptr)->only_one = only_one; /* flag denoting only copy single extension */ ffldrc(*fptr, 0, REPORT_EOF, status); /* load first record */ fits_store_Fptr( (*fptr)->Fptr, status); /* store Fptr address */ if (ffrhdu(*fptr, &hdutyp, status) > 0) /* determine HDU structure */ { ffpmsg( "ffopen could not interpret primary array header of file: "); ffpmsg(url); if (*status == UNKNOWN_REC) ffpmsg("This does not look like a FITS file."); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status); } /* ------------------------------------------------------------- */ /* At this point, the input file has been opened. If outfile was */ /* specified, then we have opened a copy of the file, not the */ /* original file so it is safe to modify it if necessary */ /* ------------------------------------------------------------- */ if (*outfile) writecopy = 1; move2hdu: /* ---------------------------------------------------------- */ /* move to desired extension, if specified as part of the URL */ /* ---------------------------------------------------------- */ if (*extspec) { if (extnum) /* extension number was specified */ { ffmahd(*fptr, extnum + 1, &hdutyp, status); } else if (*extname) /* move to named extension, if specified */ { ffmnhd(*fptr, movetotype, extname, extvers, status); } if (*status > 0) /* clean up after error */ { ffpmsg("ffopen could not move to the specified extension:"); if (extnum > 0) { snprintf(errmsg, FLEN_ERRMSG, " extension number %d doesn't exist or couldn't be opened.",extnum); ffpmsg(errmsg); } else { snprintf(errmsg, FLEN_ERRMSG, " extension with EXTNAME = %s,", extname); ffpmsg(errmsg); if (extvers) { snprintf(errmsg, FLEN_ERRMSG, " and with EXTVERS = %d,", extvers); ffpmsg(errmsg); } if (movetotype != ANY_HDU) { snprintf(errmsg, FLEN_ERRMSG, " and with XTENSION = %s,", hdtype[movetotype]); ffpmsg(errmsg); } ffpmsg(" doesn't exist or couldn't be opened."); } ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status); } } else if (skip_null || skip_image || skip_table || (*imagecolname || *colspec || *rowfilter || *binspec)) { /* ------------------------------------------------------------------ If no explicit extension specifier is given as part of the file name, and, if a) skip_null is true (set if ffopen is called by ffdopn) or b) skip_image or skip_table is true (set if ffopen is called by fftopn or ffdopn) or c) other file filters are specified, then CFITSIO will attempt to move to the first 'interesting' HDU after opening an existing FITS file (or to first interesting table HDU if skip_image is true); An 'interesting' HDU is defined to be either an image with NAXIS > 0 (i.e., not a null array) or a table which has an EXTNAME value which does not contain any of the following strings: 'GTI' - Good Time Interval extension 'OBSTABLE' - used in Beppo SAX data files The main purpose for this is to allow CFITSIO to skip over a null primary and other non-interesting HDUs when opening an existing file, and move directly to the first extension that contains significant data. ------------------------------------------------------------------ */ fits_get_hdu_num(*fptr, &hdunum); if (hdunum == 1) { fits_get_img_dim(*fptr, &naxis, status); if (naxis == 0 || skip_image) /* skip primary array */ { while(1) { /* see if the next HDU is 'interesting' */ if (fits_movrel_hdu(*fptr, 1, &hdutyp, status)) { if (*status == END_OF_FILE) *status = 0; /* reset expected error */ /* didn't find an interesting HDU so move back to beginning */ fits_movabs_hdu(*fptr, 1, &hdutyp, status); break; } if (hdutyp == IMAGE_HDU && skip_image) { continue; /* skip images */ } else if (hdutyp != IMAGE_HDU && skip_table) { continue; /* skip tables */ } else if (hdutyp == IMAGE_HDU) { fits_get_img_dim(*fptr, &naxis, status); if (naxis > 0) break; /* found a non-null image */ } else { tstatus = 0; tblname[0] = '\0'; fits_read_key(*fptr, TSTRING, "EXTNAME", tblname, NULL,&tstatus); if ( (!strstr(tblname, "GTI") && !strstr(tblname, "gti")) && fits_strncasecmp(tblname, "OBSTABLE", 8) ) break; /* found an interesting table */ } } /* end while */ } } /* end if (hdunum==1) */ } if (*imagecolname) { /* ----------------------------------------------------------------- */ /* we need to open an image contained in a single table cell */ /* First, determine which row of the table to use. */ /* ----------------------------------------------------------------- */ if (isdigit((int) *rowexpress)) /* is the row specification a number? */ { sscanf(rowexpress, "%ld", &rownum); if (rownum < 1) { ffpmsg("illegal rownum for image cell:"); ffpmsg(rowexpress); ffpmsg("Could not open the following image in a table cell:"); ffpmsg(extspec); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status = BAD_ROW_NUM); } } else if (fits_find_first_row(*fptr, rowexpress, &rownum, status) > 0) { ffpmsg("Failed to find row matching this expression:"); ffpmsg(rowexpress); ffpmsg("Could not open the following image in a table cell:"); ffpmsg(extspec); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status); } if (rownum == 0) { ffpmsg("row statisfying this expression doesn't exist::"); ffpmsg(rowexpress); ffpmsg("Could not open the following image in a table cell:"); ffpmsg(extspec); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status = BAD_ROW_NUM); } /* determine the name of the new file to contain copy of the image */ if (*histfilename && !(*pixfilter) ) strcpy(outfile, histfilename); /* the original outfile name */ else strcpy(outfile, "mem://_1"); /* create image file in memory */ /* Copy the image into new primary array and open it as the current */ /* fptr. This will close the table that contains the original image. */ /* create new empty file to hold copy of the image */ if (ffinit(&newptr, outfile, status) > 0) { ffpmsg("failed to create file for copy of image in table cell:"); ffpmsg(outfile); return(*status); } if (fits_copy_cell2image(*fptr, newptr, imagecolname, rownum, status) > 0) { ffpmsg("Failed to copy table cell to new primary array:"); ffpmsg(extspec); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status); } /* close the original file and set fptr to the new image */ ffclos(*fptr, status); *fptr = newptr; /* reset the pointer to the new table */ writecopy = 1; /* we are now dealing with a copy of the original file */ /* leave it up to calling routine to write any HISTORY keywords */ } /* --------------------------------------------------------------------- */ /* edit columns (and/or keywords) in the table, if specified in the URL */ /* --------------------------------------------------------------------- */ if (*colspec) { /* the column specifier will modify the file, so make sure */ /* we are already dealing with a copy, or else make a new copy */ if (!writecopy) /* Is the current file already a copy? */ writecopy = fits_is_this_a_copy(urltype); if (!writecopy) { if (*filtfilename && *outfile == '\0') strcpy(outfile, filtfilename); /* the original outfile name */ else strcpy(outfile, "mem://_1"); /* will create copy in memory */ writecopy = 1; } else { ((*fptr)->Fptr)->writemode = READWRITE; /* we have write access */ outfile[0] = '\0'; } if (ffedit_columns(fptr, outfile, colspec, status) > 0) { ffpmsg("editing columns in input table failed (ffopen)"); ffpmsg(" while trying to perform the following operation:"); ffpmsg(colspec); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status); } } /* ------------------------------------------------------------------- */ /* select rows from the table, if specified in the URL */ /* or select a subimage (if this is an image HDU and not a table) */ /* ------------------------------------------------------------------- */ if (*rowfilter) { fits_get_hdu_type(*fptr, &hdutyp, status); /* get type of HDU */ if (hdutyp == IMAGE_HDU) { /* this is an image so 'rowfilter' is an image section specification */ if (*filtfilename && *outfile == '\0') strcpy(outfile, filtfilename); /* the original outfile name */ else if (*outfile == '\0') /* output file name not already defined? */ strcpy(outfile, "mem://_2"); /* will create file in memory */ /* create new file containing the image section, plus a copy of */ /* any other HDUs that exist in the input file. This routine */ /* will close the original image file and return a pointer */ /* to the new file. */ if (fits_select_image_section(fptr, outfile, rowfilter, status) > 0) { ffpmsg("on-the-fly selection of image section failed (ffopen)"); ffpmsg(" while trying to use the following section filter:"); ffpmsg(rowfilter); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status); } } else { /* this is a table HDU, so the rowfilter is really a row filter */ if (*binspec) { /* since we are going to make a histogram of the selected rows, */ /* it would be a waste of time and memory to make a whole copy of */ /* the selected rows. Instead, just construct an array of TRUE */ /* or FALSE values that indicate which rows are to be included */ /* in the histogram and pass that to the histogram generating */ /* routine */ fits_get_num_rows(*fptr, &nrows, status); /* get no. of rows */ rowselect = (char *) calloc(nrows, 1); if (!rowselect) { ffpmsg( "failed to allocate memory for selected columns array (ffopen)"); ffpmsg(" while trying to select rows with the following filter:"); ffpmsg(rowfilter); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status = MEMORY_ALLOCATION); } if (fits_find_rows(*fptr, rowfilter, 1L, nrows, &goodrows, rowselect, status) > 0) { ffpmsg("selection of rows in input table failed (ffopen)"); ffpmsg(" while trying to select rows with the following filter:"); ffpmsg(rowfilter); free(rowselect); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status); } } else { if (!writecopy) /* Is the current file already a copy? */ writecopy = fits_is_this_a_copy(urltype); if (!writecopy) { if (*filtfilename && *outfile == '\0') strcpy(outfile, filtfilename); /* the original outfile name */ else if (*outfile == '\0') /* output filename not already defined? */ strcpy(outfile, "mem://_2"); /* will create copy in memory */ } else { ((*fptr)->Fptr)->writemode = READWRITE; /* we have write access */ outfile[0] = '\0'; } /* select rows in the table. If a copy of the input file has */ /* not already been made, then this routine will make a copy */ /* and then close the input file, so that the modifications will */ /* only be made on the copy, not the original */ if (ffselect_table(fptr, outfile, rowfilter, status) > 0) { ffpmsg("on-the-fly selection of rows in input table failed (ffopen)"); ffpmsg(" while trying to select rows with the following filter:"); ffpmsg(rowfilter); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status); } /* write history records */ ffphis(*fptr, "CFITSIO used the following filtering expression to create this table:", status); ffphis(*fptr, name, status); } /* end of no binspec case */ } /* end of table HDU case */ } /* end of rowfilter exists case */ /* ------------------------------------------------------------------- */ /* make an image histogram by binning columns, if specified in the URL */ /* ------------------------------------------------------------------- */ if (*binspec) { if (*histfilename && !(*pixfilter) ) strcpy(outfile, histfilename); /* the original outfile name */ else strcpy(outfile, "mem://_3"); /* create histogram in memory */ /* if not already copied the file */ /* parse the binning specifier into individual parameters */ ffbins(binspec, &imagetype, &haxis, colname, minin, maxin, binsizein, minname, maxname, binname, &weight, wtcol, &recip, status); /* Create the histogram primary array and open it as the current fptr */ /* This will close the table that was used to create the histogram. */ ffhist2(fptr, outfile, imagetype, haxis, colname, minin, maxin, binsizein, minname, maxname, binname, weight, wtcol, recip, rowselect, status); if (rowselect) free(rowselect); if (*status > 0) { ffpmsg("on-the-fly histogramming of input table failed (ffopen)"); ffpmsg(" while trying to execute the following histogram specification:"); ffpmsg(binspec); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status); } /* write history records */ ffphis(*fptr, "CFITSIO used the following expression to create this histogram:", status); ffphis(*fptr, name, status); } if (*pixfilter) { if (*histfilename) strcpy(outfile, histfilename); /* the original outfile name */ else strcpy(outfile, "mem://_4"); /* create in memory */ /* if not already copied the file */ /* Ensure type of HDU is consistent with pixel filtering */ fits_get_hdu_type(*fptr, &hdutyp, status); /* get type of HDU */ if (hdutyp == IMAGE_HDU) { pixel_filter_helper(fptr, outfile, pixfilter, status); if (*status > 0) { ffpmsg("pixel filtering of input image failed (ffopen)"); ffpmsg(" while trying to execute the following:"); ffpmsg(pixfilter); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ return(*status); } /* write history records */ ffphis(*fptr, "CFITSIO used the following expression to create this image:", status); ffphis(*fptr, name, status); } else { ffpmsg("cannot use pixel filter on non-IMAGE HDU"); ffpmsg(pixfilter); ffclos(*fptr, status); *fptr = 0; /* return null file pointer */ *status = NOT_IMAGE; return(*status); } } /* parse and save image compression specification, if given */ if (*compspec) { ffparsecompspec(*fptr, compspec, status); } return(*status); } /*--------------------------------------------------------------------------*/ int ffreopen(fitsfile *openfptr, /* I - FITS file pointer to open file */ fitsfile **newfptr, /* O - pointer to new re opened file */ int *status) /* IO - error status */ /* Reopen an existing FITS file with either readonly or read/write access. The reopened file shares the same FITSfile structure but may point to a different HDU within the file. */ { if (*status > 0) return(*status); /* check that the open file pointer is valid */ if (!openfptr) return(*status = NULL_INPUT_PTR); else if ((openfptr->Fptr)->validcode != VALIDSTRUC) /* check magic value */ return(*status = BAD_FILEPTR); /* allocate fitsfile structure and initialize = 0 */ *newfptr = (fitsfile *) calloc(1, sizeof(fitsfile)); (*newfptr)->Fptr = openfptr->Fptr; /* both point to the same structure */ (*newfptr)->HDUposition = 0; /* set initial position to primary array */ (((*newfptr)->Fptr)->open_count)++; /* increment the file usage counter */ return(*status); } /*--------------------------------------------------------------------------*/ int fits_store_Fptr(FITSfile *Fptr, /* O - FITS file pointer */ int *status) /* IO - error status */ /* store the new Fptr address for future use by fits_already_open */ { int ii; if (*status > 0) return(*status); FFLOCK; for (ii = 0; ii < NMAXFILES; ii++) { if (FptrTable[ii] == 0) { FptrTable[ii] = Fptr; break; } } FFUNLOCK; return(*status); } /*--------------------------------------------------------------------------*/ int fits_clear_Fptr(FITSfile *Fptr, /* O - FITS file pointer */ int *status) /* IO - error status */ /* clear the Fptr address from the Fptr Table */ { int ii; FFLOCK; for (ii = 0; ii < NMAXFILES; ii++) { if (FptrTable[ii] == Fptr) { FptrTable[ii] = 0; break; } } FFUNLOCK; return(*status); } /*--------------------------------------------------------------------------*/ int fits_already_open(fitsfile **fptr, /* I/O - FITS file pointer */ char *url, char *urltype, char *infile, char *extspec, char *rowfilter, char *binspec, char *colspec, int mode, /* I - 0 = open readonly; 1 = read/write */ int *isopen, /* O - 1 = file is already open */ int *status) /* IO - error status */ /* Check if the file to be opened is already open. If so, then attach to it. */ /* the input strings must not exceed the standard lengths */ /* of FLEN_FILENAME, MAX_PREFIX_LEN, etc. */ /* this function was changed so that for files of access method FILE:// the file paths are compared using standard URL syntax and absolute paths (as opposed to relative paths). This eliminates some instances where a file is already opened but it is not realized because it was opened with another file path. For instance, if the CWD is /a/b/c and I open /a/b/c/foo.fits then open ./foo.fits the previous version of this function would not have reconized that the two files were the same. This version does recognize that the two files are the same. */ { FITSfile *oldFptr; int ii; char oldurltype[MAX_PREFIX_LEN], oldinfile[FLEN_FILENAME]; char oldextspec[FLEN_FILENAME], oldoutfile[FLEN_FILENAME]; char oldrowfilter[FLEN_FILENAME]; char oldbinspec[FLEN_FILENAME], oldcolspec[FLEN_FILENAME]; char cwd[FLEN_FILENAME]; char tmpStr[FLEN_FILENAME]; char tmpinfile[FLEN_FILENAME]; *isopen = 0; /* When opening a file with readonly access then we simply let the operating system open the file again, instead of using the CFITSIO trick of attaching to the previously opened file. This is required if CFITSIO is running in a multi-threaded environment, because 2 different threads cannot share the same FITSfile pointer. If the file is opened/reopened with write access, then the file MUST only be physically opened once.. */ if (mode == 0) return(*status); if(fits_strcasecmp(urltype,"FILE://") == 0) { if (fits_path2url(infile,FLEN_FILENAME,tmpinfile,status)) return (*status); if(tmpinfile[0] != '/') { fits_get_cwd(cwd,status); strcat(cwd,"/"); if (strlen(cwd) + strlen(tmpinfile) > FLEN_FILENAME-1) { ffpmsg("File name is too long. (fits_already_open)"); return(*status = FILE_NOT_OPENED); } strcat(cwd,tmpinfile); fits_clean_url(cwd,tmpinfile,status); } } else strcpy(tmpinfile,infile); for (ii = 0; ii < NMAXFILES; ii++) /* check every buffer */ { if (FptrTable[ii] != 0) { oldFptr = FptrTable[ii]; fits_parse_input_url(oldFptr->filename, oldurltype, oldinfile, oldoutfile, oldextspec, oldrowfilter, oldbinspec, oldcolspec, status); if (*status > 0) { ffpmsg("could not parse the previously opened filename: (ffopen)"); ffpmsg(oldFptr->filename); return(*status); } if(fits_strcasecmp(oldurltype,"FILE://") == 0) { if(fits_path2url(oldinfile,FLEN_FILENAME,tmpStr,status)) return(*status); if(tmpStr[0] != '/') { fits_get_cwd(cwd,status); strcat(cwd,"/"); strcat(cwd,tmpStr); fits_clean_url(cwd,tmpStr,status); } strcpy(oldinfile,tmpStr); } if (!strcmp(urltype, oldurltype) && !strcmp(tmpinfile, oldinfile) ) { /* identical type of file and root file name */ if ( (!rowfilter[0] && !oldrowfilter[0] && !binspec[0] && !oldbinspec[0] && !colspec[0] && !oldcolspec[0]) /* no filtering or binning specs for either file, so */ /* this is a case where the same file is being reopened. */ /* It doesn't matter if the extensions are different */ || /* or */ (!strcmp(rowfilter, oldrowfilter) && !strcmp(binspec, oldbinspec) && !strcmp(colspec, oldcolspec) && !strcmp(extspec, oldextspec) ) ) /* filtering specs are given and are identical, and */ /* the same extension is specified */ { if (mode == READWRITE && oldFptr->writemode == READONLY) { /* cannot assume that a file previously opened with READONLY can now be written to (e.g., files on CDROM, or over the the network, or STDIN), so return with an error. */ ffpmsg( "cannot reopen file READWRITE when previously opened READONLY"); ffpmsg(url); return(*status = FILE_NOT_OPENED); } *fptr = (fitsfile *) calloc(1, sizeof(fitsfile)); if (!(*fptr)) { ffpmsg( "failed to allocate structure for following file: (ffopen)"); ffpmsg(url); return(*status = MEMORY_ALLOCATION); } (*fptr)->Fptr = oldFptr; /* point to the structure */ (*fptr)->HDUposition = 0; /* set initial position */ (((*fptr)->Fptr)->open_count)++; /* increment usage counter */ if (binspec[0]) /* if binning specified, don't move */ extspec[0] = '\0'; /* all the filtering has already been applied, so ignore */ rowfilter[0] = '\0'; binspec[0] = '\0'; colspec[0] = '\0'; *isopen = 1; } } } } return(*status); } /*--------------------------------------------------------------------------*/ int fits_is_this_a_copy(char *urltype) /* I - type of file */ /* specialized routine that returns 1 if the file is known to be a temporary copy of the originally opened file. Otherwise it returns 0. */ { int iscopy; if (!strncmp(urltype, "mem", 3) ) iscopy = 1; /* file copy is in memory */ else if (!strncmp(urltype, "compress", 8) ) iscopy = 1; /* compressed diskfile that is uncompressed in memory */ else if (!strncmp(urltype, "http", 4) ) iscopy = 1; /* copied file using http protocol */ else if (!strncmp(urltype, "ftp", 3) ) iscopy = 1; /* copied file using ftp protocol */ else if (!strncmp(urltype, "gsiftp", 6) ) iscopy = 1; /* copied file using gsiftp protocol */ else if (!strncpy(urltype, "stdin", 5) ) iscopy = 1; /* piped stdin has been copied to memory */ else iscopy = 0; /* file is not known to be a copy */ return(iscopy); } /*--------------------------------------------------------------------------*/ static int find_quote(char **string) /* look for the closing single quote character in the input string */ { char *tstr; tstr = *string; while (*tstr) { if (*tstr == '\'') { /* found the closing quote */ *string = tstr + 1; /* set pointer to next char */ return(0); } else { /* skip over any other character */ tstr++; } } return(1); /* opps, didn't find the closing character */ } /*--------------------------------------------------------------------------*/ static int find_doublequote(char **string) /* look for the closing double quote character in the input string */ { char *tstr; tstr = *string; while (*tstr) { if (*tstr == '"') { /* found the closing quote */ *string = tstr + 1; /* set pointer to next char */ return(0); } else { /* skip over any other character */ tstr++; } } return(1); /* opps, didn't find the closing character */ } /*--------------------------------------------------------------------------*/ static int find_paren(char **string) /* look for the closing parenthesis character in the input string */ { char *tstr; tstr = *string; while (*tstr) { if (*tstr == ')') { /* found the closing parens */ *string = tstr + 1; /* set pointer to next char */ return(0); } else if (*tstr == '(') { /* found another level of parens */ tstr++; if (find_paren(&tstr)) return(1); } else if (*tstr == '[') { tstr++; if (find_bracket(&tstr)) return(1); } else if (*tstr == '{') { tstr++; if (find_curlybracket(&tstr)) return(1); } else if (*tstr == '"') { tstr++; if (find_doublequote(&tstr)) return(1); } else if (*tstr == '\'') { tstr++; if (find_quote(&tstr)) return(1); } else { tstr++; } } return(1); /* opps, didn't find the closing character */ } /*--------------------------------------------------------------------------*/ static int find_bracket(char **string) /* look for the closing bracket character in the input string */ { char *tstr; tstr = *string; while (*tstr) { if (*tstr == ']') { /* found the closing bracket */ *string = tstr + 1; /* set pointer to next char */ return(0); } else if (*tstr == '(') { /* found another level of parens */ tstr++; if (find_paren(&tstr)) return(1); } else if (*tstr == '[') { tstr++; if (find_bracket(&tstr)) return(1); } else if (*tstr == '{') { tstr++; if (find_curlybracket(&tstr)) return(1); } else if (*tstr == '"') { tstr++; if (find_doublequote(&tstr)) return(1); } else if (*tstr == '\'') { tstr++; if (find_quote(&tstr)) return(1); } else { tstr++; } } return(1); /* opps, didn't find the closing character */ } /*--------------------------------------------------------------------------*/ static int find_curlybracket(char **string) /* look for the closing curly bracket character in the input string */ { char *tstr; tstr = *string; while (*tstr) { if (*tstr == '}') { /* found the closing curly bracket */ *string = tstr + 1; /* set pointer to next char */ return(0); } else if (*tstr == '(') { /* found another level of parens */ tstr++; if (find_paren(&tstr)) return(1); } else if (*tstr == '[') { tstr++; if (find_bracket(&tstr)) return(1); } else if (*tstr == '{') { tstr++; if (find_curlybracket(&tstr)) return(1); } else if (*tstr == '"') { tstr++; if (find_doublequote(&tstr)) return(1); } else if (*tstr == '\'') { tstr++; if (find_quote(&tstr)) return(1); } else { tstr++; } } return(1); /* opps, didn't find the closing character */ } /*--------------------------------------------------------------------------*/ int comma2semicolon(char *string) /* replace commas with semicolons, unless the comma is within a quoted or bracketed expression */ { char *tstr; tstr = string; while (*tstr) { if (*tstr == ',') { /* found a comma */ *tstr = ';'; tstr++; } else if (*tstr == '(') { /* found another level of parens */ tstr++; if (find_paren(&tstr)) return(1); } else if (*tstr == '[') { tstr++; if (find_bracket(&tstr)) return(1); } else if (*tstr == '{') { tstr++; if (find_curlybracket(&tstr)) return(1); } else if (*tstr == '"') { tstr++; if (find_doublequote(&tstr)) return(1); } else if (*tstr == '\'') { tstr++; if (find_quote(&tstr)) return(1); } else { tstr++; } } return(0); /* reached end of string */ } /*--------------------------------------------------------------------------*/ int ffedit_columns( fitsfile **fptr, /* IO - pointer to input table; on output it */ /* points to the new selected rows table */ char *outfile, /* I - name for output file */ char *expr, /* I - column edit expression */ int *status) /* modify columns in a table and/or header keywords in the HDU */ { fitsfile *newptr; int ii, hdunum, slen, colnum = -1, testnum, deletecol = 0, savecol = 0; int numcols = 0, *colindex = 0, tstatus = 0; char *tstbuff=0, *cptr, *cptr2, *cptr3, *clause = NULL, keyname[FLEN_KEYWORD]; char colname[FLEN_VALUE], oldname[FLEN_VALUE], colformat[FLEN_VALUE]; char *file_expr = NULL, testname[FLEN_VALUE], card[FLEN_CARD]; if (*outfile) { /* create new empty file in to hold the selected rows */ if (ffinit(&newptr, outfile, status) > 0) { ffpmsg("failed to create file for copy (ffedit_columns)"); return(*status); } fits_get_hdu_num(*fptr, &hdunum); /* current HDU number in input file */ /* copy all HDUs to the output copy, if the 'only_one' flag is not set */ if (!((*fptr)->Fptr)->only_one) { for (ii = 1; 1; ii++) { if (fits_movabs_hdu(*fptr, ii, NULL, status) > 0) break; fits_copy_hdu(*fptr, newptr, 0, status); } if (*status == END_OF_FILE) { *status = 0; /* got the expected EOF error; reset = 0 */ } else if (*status > 0) { ffclos(newptr, status); ffpmsg("failed to copy all HDUs from input file (ffedit_columns)"); return(*status); } } else { /* only copy the primary array and the designated table extension */ fits_movabs_hdu(*fptr, 1, NULL, status); fits_copy_hdu(*fptr, newptr, 0, status); fits_movabs_hdu(*fptr, hdunum, NULL, status); fits_copy_hdu(*fptr, newptr, 0, status); if (*status > 0) { ffclos(newptr, status); ffpmsg("failed to copy all HDUs from input file (ffedit_columns)"); return(*status); } hdunum = 2; } /* close the original file and return ptr to the new image */ ffclos(*fptr, status); *fptr = newptr; /* reset the pointer to the new table */ /* move back to the selected table HDU */ if (fits_movabs_hdu(*fptr, hdunum, NULL, status) > 0) { ffpmsg("failed to copy the input file (ffedit_columns)"); return(*status); } } /* remove the "col " from the beginning of the column edit expression */ cptr = expr + 4; while (*cptr == ' ') cptr++; /* skip leading white space */ /* Check if need to import expression from a file */ if( *cptr=='@' ) { if( ffimport_file( cptr+1, &file_expr, status ) ) return(*status); cptr = file_expr; while (*cptr == ' ') cptr++; /* skip leading white space... again */ } tstatus = 0; ffgncl(*fptr, &numcols, &tstatus); /* get initial # of cols */ /* as of July 2012, the CFITSIO column filter syntax was modified */ /* so that commas may be used to separate clauses, as well as semi-colons. */ /* This was done because users cannot enter the semi-colon in the HEASARC's */ /* Hera on-line data processing system for computer security reasons. */ /* Therefore, we must convert those commas back to semi-colons here, but we */ /* must not convert any columns that occur within parenthesies. */ if (comma2semicolon(cptr)) { ffpmsg("parsing error in column filter expression"); ffpmsg(cptr); if( file_expr ) free( file_expr ); *status = PARSE_SYNTAX_ERR; return(*status); } /* parse expression and get first clause, if more than 1 */ while ((slen = fits_get_token2(&cptr, ";", &clause, NULL, status)) > 0 ) { if( *cptr==';' ) cptr++; clause[slen] = '\0'; if (clause[0] == '!' || clause[0] == '-') { char *clause1 = clause+1; int clen = clause1[0] ? strlen(clause1) : 0; /* ===================================== */ /* Case I. delete this column or keyword */ /* ===================================== */ /* Case Ia. delete column names with 0-or-more wildcard -COLNAME+ - delete repeated columns with exact name -COLNAM*+ - delete columns matching patterns */ if (*status == 0 && clen > 1 && clause1[0] != '#' && clause1[clen-1] == '+') { clause1[clen-1] = 0; clen--; /* Note that this is a delete 0 or more specification, which means that no matching columns is not an error. */ do { int status_del = 0; /* Have to set status=0 so we can reset the search at start column. Because we are deleting columns on the fly here, we have to reset the search every time. The only penalty here is execution time because leaving *status == COL_NOT_UNIQUE is merely an optimization for tables assuming the tables do not change from one call to the next. (an assumption broken in this loop) */ *status = 0; ffgcno(*fptr, CASEINSEN, clause1, &colnum, status); /* ffgcno returns COL_NOT_UNIQUE if there are multiple columns, and COL_NOT_FOUND after the last column is found, and COL_NOT_FOUND if no matches were found */ if (*status != 0 && *status != COL_NOT_UNIQUE) break; if (ffdcol(*fptr, colnum, &status_del) > 0) { ffpmsg("failed to delete column in input file:"); ffpmsg(clause); if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if( clause ) free(clause); return (*status = status_del); } deletecol = 1; /* set flag that at least one col was deleted */ numcols--; } while (*status == COL_NOT_UNIQUE); *status = 0; /* No matches are still successful */ colnum = -1; /* Ignore the column we found */ /* Case Ib. delete column names with wildcard or not -COLNAME - deleted exact column -COLNAM* - delete first column that matches pattern Note no leading '#' */ } else if (clause1[0] && clause1[0] != '#' && ffgcno(*fptr, CASEINSEN, clause1, &colnum, status) <= 0) { /* a column with this name exists, so try to delete it */ if (ffdcol(*fptr, colnum, status) > 0) { ffpmsg("failed to delete column in input file:"); ffpmsg(clause); if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if( clause ) free(clause); return(*status); } deletecol = 1; /* set flag that at least one col was deleted */ numcols--; colnum = -1; } /* Case Ic. delete keyword(s) -KEYNAME,#KEYNAME - delete exact keyword (first match) -KEYNAM*,#KEYNAM* - delete first matching keyword -KEYNAME+,-#KEYNAME+ - delete 0-or-more exact matches of exact keyword -KEYNAM*+,-#KEYNAM*+ - delete 0-or-more wildcard matches Note the preceding # is optional if no conflicting column name exists and that wildcard patterns are described in "colfilter" section of documentation. */ else { int delall = 0; int haswild = 0; ffcmsg(); /* clear previous error message from ffgcno */ /* try deleting a keyword with this name */ *status = 0; /* skip past leading '#' if any */ if (clause1[0] == '#') clause1++; clen = strlen(clause1); /* Repeat deletion of keyword if requested with trailing '+' */ if (clen > 1 && clause1[clen-1] == '+') { delall = 1; clause1[clen-1] = 0; } /* Determine if this pattern has wildcards */ if (strchr(clause1,'?') || strchr(clause1,'*') || strchr(clause1,'#')) { haswild = 1; } if (haswild) { /* ffdkey() behaves differently if the pattern has a wildcard: it only checks from the "current" header position to the end, and doesn't check before the "current" header position. Therefore, for the case of wildcards we will have to reset to the beginning. */ ffmaky(*fptr, 1, status); /* reset pointer to beginning of header */ } /* Single or repeated deletions until done */ do { if (ffdkey(*fptr, clause1, status) > 0) { if (delall && *status == KEY_NO_EXIST) { /* Found last wildcard item. Stop deleting */ ffcmsg(); *status = 0; delall = 0; /* Force end of this loop */ } else { /* This was not a wildcard deletion, or it resulted in another kind of error */ ffpmsg("column or keyword to be deleted does not exist:"); ffpmsg(clause1); if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if( clause ) free(clause); return(*status); } } } while(delall); /* end do{} */ } } else { /* ===================================================== */ /* Case II: this is either a column name, (case 1) or a new column name followed by double = ("==") followed by the old name which is to be renamed. (case 2A) or a column or keyword name followed by a single "=" and a calculation expression (case 2B) */ /* ===================================================== */ cptr2 = clause; slen = fits_get_token2(&cptr2, "( =", &tstbuff, NULL, status); if (slen == 0 || *status) { ffpmsg("error: column or keyword name is blank (ffedit_columns):"); ffpmsg(clause); if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if (clause) free(clause); if (*status==0) *status=URL_PARSE_ERROR; return(*status); } if (strlen(tstbuff) > FLEN_VALUE-1) { ffpmsg("error: column or keyword name is too long (ffedit_columns):"); ffpmsg(clause); if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if (clause) free(clause); free(tstbuff); return(*status= URL_PARSE_ERROR); } strcpy(colname, tstbuff); free(tstbuff); tstbuff=0; /* If this is a keyword of the form #KEYWORD# then transform to the form #KEYWORDn where n is the previously used column number */ if (colname[0] == '#' && strstr(colname+1, "#") == (colname + strlen(colname) - 1)) { if (colnum <= 0) { ffpmsg("The keyword name:"); ffpmsg(colname); ffpmsg("is invalid unless a column has been previously"); ffpmsg("created or editted by a calculator command"); if( file_expr ) free( file_expr ); if (clause) free(clause); return(*status = URL_PARSE_ERROR); } colname[strlen(colname)-1] = '\0'; /* Make keyword name and put it in oldname */ ffkeyn(colname+1, colnum, oldname, status); if (*status) return (*status); /* Re-copy back into colname */ strcpy(colname+1,oldname); } else if (strstr(colname, "#") == (colname + strlen(colname) - 1)) { /* colname is of the form "NAME#"; if a) colnum is defined, and b) a column with literal name "NAME#" does not exist, and c) a keyword with name "NAMEn" (where n=colnum) exists, then transfrom the colname string to "NAMEn", otherwise do nothing. */ if (colnum > 0) { /* colnum must be defined */ tstatus = 0; ffgcno(*fptr, CASEINSEN, colname, &testnum, &tstatus); if (tstatus != 0 && tstatus != COL_NOT_UNIQUE) { /* OK, column doesn't exist, now see if keyword exists */ ffcmsg(); /* clear previous error message from ffgcno */ strcpy(testname, colname); testname[strlen(testname)-1] = '\0'; /* Make keyword name and put it in oldname */ ffkeyn(testname, colnum, oldname, status); if (*status) { if( file_expr ) free( file_expr ); if (clause) free(clause); return (*status); } tstatus = 0; if (!fits_read_card(*fptr, oldname, card, &tstatus)) { /* Keyword does exist; copy real name back into colname */ strcpy(colname,oldname); } } } } /* if we encountered an opening parenthesis, then we need to */ /* find the closing parenthesis, and concatinate the 2 strings */ /* This supports expressions like: [col #EXTNAME(Extension name)="GTI"] */ if (*cptr2 == '(') { if (fits_get_token2(&cptr2, ")", &tstbuff, NULL, status)==0) { strcat(colname,")"); } else { if ((strlen(tstbuff) + strlen(colname) + 1) > FLEN_VALUE-1) { ffpmsg("error: column name is too long (ffedit_columns):"); if( file_expr ) free( file_expr ); if (clause) free(clause); free(tstbuff); *status=URL_PARSE_ERROR; return (*status); } strcat(colname, tstbuff); strcat(colname, ")"); free(tstbuff); tstbuff=0; } cptr2++; } while (*cptr2 == ' ') cptr2++; /* skip white space */ if (*cptr2 != '=') { /* ------------------------------------ */ /* case 1 - simply the name of a column */ /* ------------------------------------ */ /* look for matching column */ ffgcno(*fptr, CASEINSEN, colname, &testnum, status); while (*status == COL_NOT_UNIQUE) { /* the column name contained wild cards, and it */ /* matches more than one column in the table. */ colnum = testnum; /* keep this column in the output file */ savecol = 1; if (!colindex) colindex = (int *) calloc(999, sizeof(int)); colindex[colnum - 1] = 1; /* flag this column number */ /* look for other matching column names */ ffgcno(*fptr, CASEINSEN, colname, &testnum, status); if (*status == COL_NOT_FOUND) *status = 999; /* temporary status flag value */ } if (*status <= 0) { colnum = testnum; /* keep this column in the output file */ savecol = 1; if (!colindex) colindex = (int *) calloc(999, sizeof(int)); colindex[colnum - 1] = 1; /* flag this column number */ } else if (*status == 999) { /* this special flag value does not represent an error */ *status = 0; } else { ffpmsg("Syntax error in columns specifier in input URL:"); ffpmsg(cptr2); if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if (clause) free(clause); return(*status = URL_PARSE_ERROR); } } else { /* ----------------------------------------------- */ /* case 2 where the token ends with an equals sign */ /* ----------------------------------------------- */ cptr2++; /* skip over the first '=' */ if (*cptr2 == '=') { /*................................................. */ /* Case A: rename a column or keyword; syntax is "new_name == old_name" */ /*................................................. */ cptr2++; /* skip the 2nd '=' */ while (*cptr2 == ' ') cptr2++; /* skip white space */ if (fits_get_token2(&cptr2, " ", &tstbuff, NULL, status)==0) { oldname[0]=0; } else { if (strlen(tstbuff) > FLEN_VALUE-1) { ffpmsg("error: column name syntax is too long (ffedit_columns):"); if( file_expr ) free( file_expr ); if (clause) free(clause); free(tstbuff); *status=URL_PARSE_ERROR; return (*status); } strcpy(oldname, tstbuff); free(tstbuff); tstbuff=0; } /* get column number of the existing column */ if (ffgcno(*fptr, CASEINSEN, oldname, &colnum, status) <= 0) { /* modify the TTYPEn keyword value with the new name */ ffkeyn("TTYPE", colnum, keyname, status); if (ffmkys(*fptr, keyname, colname, NULL, status) > 0) { ffpmsg("failed to rename column in input file"); ffpmsg(" oldname ="); ffpmsg(oldname); ffpmsg(" newname ="); ffpmsg(colname); if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if (clause) free(clause); return(*status); } /* keep this column in the output file */ savecol = 1; if (!colindex) colindex = (int *) calloc(999, sizeof(int)); colindex[colnum - 1] = 1; /* flag this column number */ } else { /* try renaming a keyword */ ffcmsg(); /* clear error message stack */ *status = 0; if (ffmnam(*fptr, oldname, colname, status) > 0) { ffpmsg("column or keyword to be renamed does not exist:"); ffpmsg(clause); if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if (clause) free(clause); return(*status); } } } else { /*...................................................... */ /* Case B: */ /* this must be a general column/keyword calc expression */ /* "name = expression" or "colname(TFORM) = expression" */ /*...................................................... */ /* parse the name and TFORM values, if present */ colformat[0] = '\0'; cptr3 = colname; if (fits_get_token2(&cptr3, "(", &tstbuff, NULL, status)==0) { oldname[0]=0; } else { if (strlen(tstbuff) > FLEN_VALUE-1) { ffpmsg("column expression is too long (ffedit_columns)"); if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if (clause) free(clause); free(tstbuff); *status=URL_PARSE_ERROR; return(*status); } strcpy(oldname, tstbuff); free(tstbuff); tstbuff=0; } if (cptr3[0] == '(' ) { cptr3++; /* skip the '(' */ if (fits_get_token2(&cptr3, ")", &tstbuff, NULL, status)==0) { colformat[0]=0; } else { if (strlen(tstbuff) > FLEN_VALUE-1) { ffpmsg("column expression is too long (ffedit_columns)"); if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if (clause) free(clause); free(tstbuff); *status=URL_PARSE_ERROR; return(*status); } strcpy(colformat, tstbuff); free(tstbuff); tstbuff=0; } } /* calculate values for the column or keyword */ /* cptr2 = the expression to be calculated */ /* oldname = name of the column or keyword */ /* colformat = column format, or keyword comment string */ if (fits_calculator(*fptr, cptr2, *fptr, oldname, colformat, status) > 0) { ffpmsg("Unable to calculate expression"); if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if (clause) free(clause); return(*status); } /* test if this is a column and not a keyword */ tstatus = 0; ffgcno(*fptr, CASEINSEN, oldname, &testnum, &tstatus); if (tstatus == 0) { /* keep this column in the output file */ colnum = testnum; savecol = 1; if (!colindex) colindex = (int *) calloc(999, sizeof(int)); colindex[colnum - 1] = 1; if (colnum > numcols)numcols++; } else { ffcmsg(); /* clear the error message stack */ } } } } if (clause) free(clause); /* free old clause before getting new one */ clause = NULL; } if (savecol && !deletecol) { /* need to delete all but the specified columns */ for (ii = numcols; ii > 0; ii--) { if (!colindex[ii-1]) /* delete this column */ { if (ffdcol(*fptr, ii, status) > 0) { ffpmsg("failed to delete column in input file:"); ffpmsg(clause); if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if (clause) free(clause); return(*status); } } } } if( colindex ) free( colindex ); if( file_expr ) free( file_expr ); if (clause) free(clause); return(*status); } /*--------------------------------------------------------------------------*/ int fits_copy_cell2image( fitsfile *fptr, /* I - point to input table */ fitsfile *newptr, /* O - existing output file; new image HDU will be appended to it */ char *colname, /* I - column name / number containing the image*/ long rownum, /* I - number of the row containing the image */ int *status) /* IO - error status */ /* Copy a table cell of a given row and column into an image extension. The output file must already have been created. A new image extension will be created in that file. This routine was written by Craig Markwardt, GSFC */ { unsigned char buffer[30000]; int hdutype, colnum, typecode, bitpix, naxis, maxelem, tstatus; LONGLONG naxes[9], nbytes, firstbyte, ntodo; LONGLONG repeat, startpos, elemnum, rowlen, tnull; long twidth, incre; double scale, zero; char tform[20]; char card[FLEN_CARD]; char templt[FLEN_CARD] = ""; /* Table-to-image keyword translation table */ /* INPUT OUTPUT */ /* 01234567 01234567 */ char *patterns[][2] = {{"TSCALn", "BSCALE" }, /* Standard FITS keywords */ {"TZEROn", "BZERO" }, {"TUNITn", "BUNIT" }, {"TNULLn", "BLANK" }, {"TDMINn", "DATAMIN" }, {"TDMAXn", "DATAMAX" }, {"iCTYPn", "CTYPEi" }, /* Coordinate labels */ {"iCTYna", "CTYPEia" }, {"iCUNIn", "CUNITi" }, /* Coordinate units */ {"iCUNna", "CUNITia" }, {"iCRVLn", "CRVALi" }, /* WCS keywords */ {"iCRVna", "CRVALia" }, {"iCDLTn", "CDELTi" }, {"iCDEna", "CDELTia" }, {"iCRPXn", "CRPIXi" }, {"iCRPna", "CRPIXia" }, {"ijPCna", "PCi_ja" }, {"ijCDna", "CDi_ja" }, {"iVn_ma", "PVi_ma" }, {"iSn_ma", "PSi_ma" }, {"iCRDna", "CRDERia" }, {"iCSYna", "CSYERia" }, {"iCROTn", "CROTAi" }, {"WCAXna", "WCSAXESa"}, {"WCSNna", "WCSNAMEa"}, {"LONPna", "LONPOLEa"}, {"LATPna", "LATPOLEa"}, {"EQUIna", "EQUINOXa"}, {"MJDOBn", "MJD-OBS" }, {"MJDAn", "MJD-AVG" }, {"RADEna", "RADESYSa"}, {"iCNAna", "CNAMEia" }, {"DAVGn", "DATE-AVG"}, /* Delete table keywords related to other columns */ {"T????#a", "-" }, {"TC??#a", "-" }, {"TWCS#a", "-" }, {"TDIM#", "-" }, {"iCTYPm", "-" }, {"iCUNIm", "-" }, {"iCRVLm", "-" }, {"iCDLTm", "-" }, {"iCRPXm", "-" }, {"iCTYma", "-" }, {"iCUNma", "-" }, {"iCRVma", "-" }, {"iCDEma", "-" }, {"iCRPma", "-" }, {"ijPCma", "-" }, {"ijCDma", "-" }, {"iVm_ma", "-" }, {"iSm_ma", "-" }, {"iCRDma", "-" }, {"iCSYma", "-" }, {"iCROTm", "-" }, {"WCAXma", "-" }, {"WCSNma", "-" }, {"LONPma", "-" }, {"LATPma", "-" }, {"EQUIma", "-" }, {"MJDOBm", "-" }, {"MJDAm", "-" }, {"RADEma", "-" }, {"iCNAma", "-" }, {"DAVGm", "-" }, {"EXTNAME", "-" }, /* Remove structural keywords*/ {"EXTVER", "-" }, {"EXTLEVEL","-" }, {"CHECKSUM","-" }, {"DATASUM", "-" }, {"*", "+" }}; /* copy all other keywords */ int npat; if (*status > 0) return(*status); /* get column number */ if (ffgcno(fptr, CASEINSEN, colname, &colnum, status) > 0) { ffpmsg("column containing image in table cell does not exist:"); ffpmsg(colname); return(*status); } /*---------------------------------------------------*/ /* Check input and get parameters about the column: */ /*---------------------------------------------------*/ if ( ffgcprll(fptr, colnum, rownum, 1L, 1L, 0, &scale, &zero, tform, &twidth, &typecode, &maxelem, &startpos, &elemnum, &incre, &repeat, &rowlen, &hdutype, &tnull, (char *) buffer, status) > 0 ) return(*status); /* get the actual column name, in case a column number was given */ ffkeyn("", colnum, templt, &tstatus); ffgcnn(fptr, CASEINSEN, templt, colname, &colnum, &tstatus); if (hdutype != BINARY_TBL) { ffpmsg("This extension is not a binary table."); ffpmsg(" Cannot open the image in a binary table cell."); return(*status = NOT_BTABLE); } if (typecode < 0) { /* variable length array */ typecode *= -1; /* variable length arrays are 1-dimensional by default */ naxis = 1; naxes[0] = repeat; } else { /* get the dimensions of the image */ ffgtdmll(fptr, colnum, 9, &naxis, naxes, status); } if (*status > 0) { ffpmsg("Error getting the dimensions of the image"); return(*status); } /* determine BITPIX value for the image */ if (typecode == TBYTE) { bitpix = BYTE_IMG; nbytes = repeat; } else if (typecode == TSHORT) { bitpix = SHORT_IMG; nbytes = repeat * 2; } else if (typecode == TLONG) { bitpix = LONG_IMG; nbytes = repeat * 4; } else if (typecode == TFLOAT) { bitpix = FLOAT_IMG; nbytes = repeat * 4; } else if (typecode == TDOUBLE) { bitpix = DOUBLE_IMG; nbytes = repeat * 8; } else if (typecode == TLONGLONG) { bitpix = LONGLONG_IMG; nbytes = repeat * 8; } else if (typecode == TLOGICAL) { bitpix = BYTE_IMG; nbytes = repeat; } else { ffpmsg("Error: the following image column has invalid datatype:"); ffpmsg(colname); ffpmsg(tform); ffpmsg("Cannot open an image in a single row of this column."); return(*status = BAD_TFORM); } /* create new image in output file */ if (ffcrimll(newptr, bitpix, naxis, naxes, status) > 0) { ffpmsg("failed to write required primary array keywords in the output file"); return(*status); } npat = sizeof(patterns)/sizeof(patterns[0][0])/2; /* skip over the first 8 keywords, starting just after TFIELDS */ fits_translate_keywords(fptr, newptr, 9, patterns, npat, colnum, 0, 0, status); /* add some HISTORY */ snprintf(card,FLEN_CARD,"HISTORY This image was copied from row %ld of column '%s',", rownum, colname); /* disable this; leave it up to the caller to write history if needed. ffprec(newptr, card, status); */ /* the use of ffread routine, below, requires that any 'dirty' */ /* buffers in memory be flushed back to the file first */ ffflsh(fptr, FALSE, status); /* finally, copy the data, one buffer size at a time */ ffmbyt(fptr, startpos, TRUE, status); firstbyte = 1; /* the upper limit on the number of bytes must match the declaration */ /* read up to the first 30000 bytes in the normal way with ffgbyt */ ntodo = minvalue(30000, nbytes); ffgbyt(fptr, ntodo, buffer, status); ffptbb(newptr, 1, firstbyte, ntodo, buffer, status); nbytes -= ntodo; firstbyte += ntodo; /* read any additional bytes with low-level ffread routine, for speed */ while (nbytes && (*status <= 0) ) { ntodo = minvalue(30000, nbytes); ffread((fptr)->Fptr, (long) ntodo, buffer, status); ffptbb(newptr, 1, firstbyte, ntodo, buffer, status); nbytes -= ntodo; firstbyte += ntodo; } /* Re-scan the header so that CFITSIO knows about all the new keywords */ ffrdef(newptr,status); return(*status); } /*--------------------------------------------------------------------------*/ int fits_copy_image2cell( fitsfile *fptr, /* I - pointer to input image extension */ fitsfile *newptr, /* I - pointer to output table */ char *colname, /* I - name of column containing the image */ long rownum, /* I - number of the row containing the image */ int copykeyflag, /* I - controls which keywords to copy */ int *status) /* IO - error status */ /* Copy an image extension into a table cell at a given row and column. The table must have already been created. If the "colname" column exists, it will be used, otherwise a new column will be created in the table. The "copykeyflag" parameter controls which keywords to copy from the input image to the output table header (with any appropriate translation). copykeyflag = 0 -- no keywords will be copied copykeyflag = 1 -- essentially all keywords will be copied copykeyflag = 2 -- copy only the WCS related keywords This routine was written by Craig Markwardt, GSFC */ { tcolumn *colptr; unsigned char buffer[30000]; int ii, hdutype, colnum, typecode, bitpix, naxis, ncols, hdunum; char tformchar, tform[20], card[FLEN_CARD]; LONGLONG imgstart, naxes[9], nbytes, repeat, ntodo,firstbyte; char filename[FLEN_FILENAME+20]; int npat; int naxis1; LONGLONG naxes1[9] = {0,0,0,0,0,0,0,0,0}, repeat1, width1; int typecode1; unsigned char dummy = 0; LONGLONG headstart, datastart, dataend; /* Image-to-table keyword translation table */ /* INPUT OUTPUT */ /* 01234567 01234567 */ char *patterns[][2] = {{"BSCALE", "TSCALn" }, /* Standard FITS keywords */ {"BZERO", "TZEROn" }, {"BUNIT", "TUNITn" }, {"BLANK", "TNULLn" }, {"DATAMIN", "TDMINn" }, {"DATAMAX", "TDMAXn" }, {"CTYPEi", "iCTYPn" }, /* Coordinate labels */ {"CTYPEia", "iCTYna" }, {"CUNITi", "iCUNIn" }, /* Coordinate units */ {"CUNITia", "iCUNna" }, {"CRVALi", "iCRVLn" }, /* WCS keywords */ {"CRVALia", "iCRVna" }, {"CDELTi", "iCDLTn" }, {"CDELTia", "iCDEna" }, {"CRPIXj", "jCRPXn" }, {"CRPIXja", "jCRPna" }, {"PCi_ja", "ijPCna" }, {"CDi_ja", "ijCDna" }, {"PVi_ma", "iVn_ma" }, {"PSi_ma", "iSn_ma" }, {"WCSAXESa","WCAXna" }, {"WCSNAMEa","WCSNna" }, {"CRDERia", "iCRDna" }, {"CSYERia", "iCSYna" }, {"CROTAi", "iCROTn" }, {"LONPOLEa","LONPna"}, {"LATPOLEa","LATPna"}, {"EQUINOXa","EQUIna"}, {"MJD-OBS", "MJDOBn" }, {"MJD-AVG", "MJDAn" }, {"RADESYSa","RADEna"}, {"CNAMEia", "iCNAna" }, {"DATE-AVG","DAVGn"}, {"NAXISi", "-" }, /* Remove structural keywords*/ {"PCOUNT", "-" }, {"GCOUNT", "-" }, {"EXTEND", "-" }, {"EXTNAME", "-" }, {"EXTVER", "-" }, {"EXTLEVEL","-" }, {"CHECKSUM","-" }, {"DATASUM", "-" }, {"*", "+" }}; /* copy all other keywords */ if (*status > 0) return(*status); if (fptr == 0 || newptr == 0) return (*status = NULL_INPUT_PTR); if (ffghdt(fptr, &hdutype, status) > 0) { ffpmsg("could not get input HDU type"); return (*status); } if (hdutype != IMAGE_HDU) { ffpmsg("The input extension is not an image."); ffpmsg(" Cannot open the image."); return(*status = NOT_IMAGE); } if (ffghdt(newptr, &hdutype, status) > 0) { ffpmsg("could not get output HDU type"); return (*status); } if (hdutype != BINARY_TBL) { ffpmsg("The output extension is not a table."); return(*status = NOT_BTABLE); } if (ffgiprll(fptr, 9, &bitpix, &naxis, naxes, status) > 0) { ffpmsg("Could not read image parameters."); return (*status); } /* Determine total number of pixels in the image */ repeat = 1; for (ii = 0; ii < naxis; ii++) repeat *= naxes[ii]; /* Determine the TFORM value for the table cell */ if (bitpix == BYTE_IMG) { typecode = TBYTE; tformchar = 'B'; nbytes = repeat; } else if (bitpix == SHORT_IMG) { typecode = TSHORT; tformchar = 'I'; nbytes = repeat*2; } else if (bitpix == LONG_IMG) { typecode = TLONG; tformchar = 'J'; nbytes = repeat*4; } else if (bitpix == FLOAT_IMG) { typecode = TFLOAT; tformchar = 'E'; nbytes = repeat*4; } else if (bitpix == DOUBLE_IMG) { typecode = TDOUBLE; tformchar = 'D'; nbytes = repeat*8; } else if (bitpix == LONGLONG_IMG) { typecode = TLONGLONG; tformchar = 'K'; nbytes = repeat*8; } else { ffpmsg("Error: the image has an invalid datatype."); return (*status = BAD_BITPIX); } /* get column number */ ffpmrk(); ffgcno(newptr, CASEINSEN, colname, &colnum, status); ffcmrk(); /* Column does not exist; create it */ if (*status) { *status = 0; snprintf(tform, 20, "%.0f%c", (double) repeat, tformchar); ffgncl(newptr, &ncols, status); colnum = ncols+1; fficol(newptr, colnum, colname, tform, status); ffptdmll(newptr, colnum, naxis, naxes, status); if (*status) { ffpmsg("Could not insert new column into output table."); return *status; } } else { ffgtdmll(newptr, colnum, 9, &naxis1, naxes1, status); if (*status > 0 || naxis != naxis1) { ffpmsg("Input image dimensions and output table cell dimensions do not match."); return (*status = BAD_DIMEN); } for (ii=0; ii 0) || (typecode1 != typecode) || (repeat1 != repeat)) { ffpmsg("Input image data type does not match output table cell type."); return (*status = BAD_TFORM); } } /* copy keywords from input image to output table, if required */ if (copykeyflag) { npat = sizeof(patterns)/sizeof(patterns[0][0])/2; if (copykeyflag == 2) { /* copy only the WCS-related keywords */ patterns[npat-1][1] = "-"; } /* The 3rd parameter value = 5 means skip the first 4 keywords in the image */ fits_translate_keywords(fptr, newptr, 5, patterns, npat, colnum, 0, 0, status); } /* Here is all the code to compute offsets: * * byte offset from start of row to column (dest table) * * byte offset from start of file to image data (source image) */ /* Force the writing of the row of the table by writing the last byte of the array, which grows the table, and/or shifts following extensions */ ffpcl(newptr, TBYTE, colnum, rownum, repeat, 1, &dummy, status); /* byte offset within the row to the start of the image column */ colptr = (newptr->Fptr)->tableptr; /* point to first column */ colptr += (colnum - 1); /* offset to correct column structure */ firstbyte = colptr->tbcol + 1; /* get starting address of input image to be read */ ffghadll(fptr, &headstart, &datastart, &dataend, status); imgstart = datastart; snprintf(card, FLEN_CARD, "HISTORY Table column '%s' row %ld copied from image", colname, rownum); /* Don't automatically write History keywords; leave this up to the caller. ffprec(newptr, card, status); */ /* write HISTORY keyword with the file name (this is now disabled)*/ filename[0] = '\0'; hdunum = 0; strcpy(filename, "HISTORY "); ffflnm(fptr, filename+strlen(filename), status); ffghdn(fptr, &hdunum); snprintf(filename+strlen(filename),FLEN_FILENAME+20-strlen(filename),"[%d]", hdunum-1); /* ffprec(newptr, filename, status); */ /* the use of ffread routine, below, requires that any 'dirty' */ /* buffers in memory be flushed back to the file first */ ffflsh(fptr, FALSE, status); /* move to the first byte of the input image */ ffmbyt(fptr, imgstart, TRUE, status); ntodo = minvalue(30000L, nbytes); ffgbyt(fptr, ntodo, buffer, status); /* read input image */ ffptbb(newptr, rownum, firstbyte, ntodo, buffer, status); /* write to table */ nbytes -= ntodo; firstbyte += ntodo; /* read any additional bytes with low-level ffread routine, for speed */ while (nbytes && (*status <= 0) ) { ntodo = minvalue(30000L, nbytes); ffread(fptr->Fptr, (long) ntodo, buffer, status); ffptbb(newptr, rownum, firstbyte, ntodo, buffer, status); nbytes -= ntodo; firstbyte += ntodo; } /* Re-scan the header so that CFITSIO knows about all the new keywords */ ffrdef(newptr,status); return(*status); } /*--------------------------------------------------------------------------*/ int fits_select_image_section( fitsfile **fptr, /* IO - pointer to input image; on output it */ /* points to the new subimage */ char *outfile, /* I - name for output file */ char *expr, /* I - Image section expression */ int *status) { /* copies an image section from the input file to a new output file. Any HDUs preceding or following the image are also copied to the output file. */ fitsfile *newptr; int ii, hdunum; /* create new empty file to hold the image section */ if (ffinit(&newptr, outfile, status) > 0) { ffpmsg( "failed to create output file for image section:"); ffpmsg(outfile); return(*status); } fits_get_hdu_num(*fptr, &hdunum); /* current HDU number in input file */ /* copy all preceding extensions to the output file, if 'only_one' flag not set */ if (!(((*fptr)->Fptr)->only_one)) { for (ii = 1; ii < hdunum; ii++) { fits_movabs_hdu(*fptr, ii, NULL, status); if (fits_copy_hdu(*fptr, newptr, 0, status) > 0) { ffclos(newptr, status); return(*status); } } /* move back to the original HDU position */ fits_movabs_hdu(*fptr, hdunum, NULL, status); } if (fits_copy_image_section(*fptr, newptr, expr, status) > 0) { ffclos(newptr, status); return(*status); } /* copy any remaining HDUs to the output file, if 'only_one' flag not set */ if (!(((*fptr)->Fptr)->only_one)) { for (ii = hdunum + 1; 1; ii++) { if (fits_movabs_hdu(*fptr, ii, NULL, status) > 0) break; fits_copy_hdu(*fptr, newptr, 0, status); } if (*status == END_OF_FILE) *status = 0; /* got the expected EOF error; reset = 0 */ else if (*status > 0) { ffclos(newptr, status); return(*status); } } else { ii = hdunum + 1; /* this value of ii is required below */ } /* close the original file and return ptr to the new image */ ffclos(*fptr, status); *fptr = newptr; /* reset the pointer to the new table */ /* move back to the image subsection */ if (ii - 1 != hdunum) fits_movabs_hdu(*fptr, hdunum, NULL, status); else { /* may have to reset BSCALE and BZERO pixel scaling, */ /* since the keywords were previously turned off */ if (ffrdef(*fptr, status) > 0) { ffclos(*fptr, status); return(*status); } } return(*status); } /*--------------------------------------------------------------------------*/ int fits_copy_image_section( fitsfile *fptr, /* I - pointer to input image */ fitsfile *newptr, /* I - pointer to output image */ char *expr, /* I - Image section expression */ int *status) { /* copies an image section from the input file to a new output HDU */ int bitpix, naxis, numkeys, nkey; long naxes[] = {1,1,1,1,1,1,1,1,1}, smin, smax, sinc; long fpixels[] = {1,1,1,1,1,1,1,1,1}; long lpixels[] = {1,1,1,1,1,1,1,1,1}; long incs[] = {1,1,1,1,1,1,1,1,1}; char *cptr, keyname[FLEN_KEYWORD], card[FLEN_CARD]; int ii, tstatus, anynull; long minrow, maxrow, minslice, maxslice, mincube, maxcube; long firstpix; long ncubeiter, nsliceiter, nrowiter, kiter, jiter, iiter; int klen, kk, jj; long outnaxes[9], outsize, buffsize; double *buffer, crpix, cdelt; if (*status > 0) return(*status); /* get the size of the input image */ fits_get_img_type(fptr, &bitpix, status); fits_get_img_dim(fptr, &naxis, status); if (fits_get_img_size(fptr, naxis, naxes, status) > 0) return(*status); if (naxis < 1 || naxis > 4) { ffpmsg( "Input image either had NAXIS = 0 (NULL image) or has > 4 dimensions"); return(*status = BAD_NAXIS); } /* create output image with same size and type as the input image */ /* Will update the size later */ fits_create_img(newptr, bitpix, naxis, naxes, status); /* copy all other non-structural keywords from the input to output file */ fits_get_hdrspace(fptr, &numkeys, NULL, status); for (nkey = 4; nkey <= numkeys; nkey++) /* skip the first few keywords */ { fits_read_record(fptr, nkey, card, status); if (fits_get_keyclass(card) > TYP_CMPRS_KEY) { /* write the record to the output file */ fits_write_record(newptr, card, status); } } if (*status > 0) { ffpmsg("error copying header from input image to output image"); return(*status); } /* parse the section specifier to get min, max, and inc for each axis */ /* and the size of each output image axis */ cptr = expr; for (ii=0; ii < naxis; ii++) { if (fits_get_section_range(&cptr, &smin, &smax, &sinc, status) > 0) { ffpmsg("error parsing the following image section specifier:"); ffpmsg(expr); return(*status); } if (smax == 0) smax = naxes[ii]; /* use whole axis by default */ else if (smin == 0) smin = naxes[ii]; /* use inverted whole axis */ if (smin > naxes[ii] || smax > naxes[ii]) { ffpmsg("image section exceeds dimensions of input image:"); ffpmsg(expr); return(*status = BAD_NAXIS); } fpixels[ii] = smin; lpixels[ii] = smax; incs[ii] = sinc; if (smin <= smax) outnaxes[ii] = (smax - smin + sinc) / sinc; else outnaxes[ii] = (smin - smax + sinc) / sinc; /* modify the NAXISn keyword */ fits_make_keyn("NAXIS", ii + 1, keyname, status); fits_modify_key_lng(newptr, keyname, outnaxes[ii], NULL, status); /* modify the WCS keywords if necessary */ if (fpixels[ii] != 1 || incs[ii] != 1) { for (kk=-1;kk<26; kk++) /* modify any alternate WCS keywords */ { /* read the CRPIXn keyword if it exists in the input file */ fits_make_keyn("CRPIX", ii + 1, keyname, status); if (kk != -1) { klen = strlen(keyname); keyname[klen]='A' + kk; keyname[klen + 1] = '\0'; } tstatus = 0; if (fits_read_key(fptr, TDOUBLE, keyname, &crpix, NULL, &tstatus) == 0) { /* calculate the new CRPIXn value */ if (fpixels[ii] <= lpixels[ii]) { crpix = (crpix - (fpixels[ii])) / incs[ii] + 1.0; /* crpix = (crpix - (fpixels[ii] - 1.0) - .5) / incs[ii] + 0.5; */ } else { crpix = (fpixels[ii] - crpix) / incs[ii] + 1.0; /* crpix = (fpixels[ii] - (crpix - 1.0) - .5) / incs[ii] + 0.5; */ } /* modify the value in the output file */ fits_modify_key_dbl(newptr, keyname, crpix, 15, NULL, status); if (incs[ii] != 1 || fpixels[ii] > lpixels[ii]) { /* read the CDELTn keyword if it exists in the input file */ fits_make_keyn("CDELT", ii + 1, keyname, status); if (kk != -1) { klen = strlen(keyname); keyname[klen]='A' + kk; keyname[klen + 1] = '\0'; } tstatus = 0; if (fits_read_key(fptr, TDOUBLE, keyname, &cdelt, NULL, &tstatus) == 0) { /* calculate the new CDELTn value */ if (fpixels[ii] <= lpixels[ii]) cdelt = cdelt * incs[ii]; else cdelt = cdelt * (-incs[ii]); /* modify the value in the output file */ fits_modify_key_dbl(newptr, keyname, cdelt, 15, NULL, status); } /* modify the CDi_j keywords if they exist in the input file */ fits_make_keyn("CD1_", ii + 1, keyname, status); if (kk != -1) { klen = strlen(keyname); keyname[klen]='A' + kk; keyname[klen + 1] = '\0'; } for (jj=0; jj < 9; jj++) /* look for up to 9 dimensions */ { keyname[2] = '1' + jj; tstatus = 0; if (fits_read_key(fptr, TDOUBLE, keyname, &cdelt, NULL, &tstatus) == 0) { /* calculate the new CDi_j value */ if (fpixels[ii] <= lpixels[ii]) cdelt = cdelt * incs[ii]; else cdelt = cdelt * (-incs[ii]); /* modify the value in the output file */ fits_modify_key_dbl(newptr, keyname, cdelt, 15, NULL, status); } } } /* end of if (incs[ii]... loop */ } /* end of fits_read_key loop */ } /* end of for (kk loop */ } } /* end of main NAXIS loop */ if (ffrdef(newptr, status) > 0) /* force the header to be scanned */ { return(*status); } /* turn off any scaling of the pixel values */ fits_set_bscale(fptr, 1.0, 0.0, status); fits_set_bscale(newptr, 1.0, 0.0, status); /* to reduce memory foot print, just read/write image 1 row at a time */ outsize = outnaxes[0]; buffsize = (abs(bitpix) / 8) * outsize; buffer = (double *) malloc(buffsize); /* allocate memory for the image row */ if (!buffer) { ffpmsg("fits_copy_image_section: no memory for image section"); return(*status = MEMORY_ALLOCATION); } /* read the image section then write it to the output file */ minrow = fpixels[1]; maxrow = lpixels[1]; if (minrow > maxrow) { nrowiter = (minrow - maxrow + incs[1]) / incs[1]; } else { nrowiter = (maxrow - minrow + incs[1]) / incs[1]; } minslice = fpixels[2]; maxslice = lpixels[2]; if (minslice > maxslice) { nsliceiter = (minslice - maxslice + incs[2]) / incs[2]; } else { nsliceiter = (maxslice - minslice + incs[2]) / incs[2]; } mincube = fpixels[3]; maxcube = lpixels[3]; if (mincube > maxcube) { ncubeiter = (mincube - maxcube + incs[3]) / incs[3]; } else { ncubeiter = (maxcube - mincube + incs[3]) / incs[3]; } firstpix = 1; for (kiter = 0; kiter < ncubeiter; kiter++) { if (mincube > maxcube) { fpixels[3] = mincube - (kiter * incs[3]); } else { fpixels[3] = mincube + (kiter * incs[3]); } lpixels[3] = fpixels[3]; for (jiter = 0; jiter < nsliceiter; jiter++) { if (minslice > maxslice) { fpixels[2] = minslice - (jiter * incs[2]); } else { fpixels[2] = minslice + (jiter * incs[2]); } lpixels[2] = fpixels[2]; for (iiter = 0; iiter < nrowiter; iiter++) { if (minrow > maxrow) { fpixels[1] = minrow - (iiter * incs[1]); } else { fpixels[1] = minrow + (iiter * incs[1]); } lpixels[1] = fpixels[1]; if (bitpix == 8) { ffgsvb(fptr, 1, naxis, naxes, fpixels, lpixels, incs, 0, (unsigned char *) buffer, &anynull, status); ffpprb(newptr, 1, firstpix, outsize, (unsigned char *) buffer, status); } else if (bitpix == 16) { ffgsvi(fptr, 1, naxis, naxes, fpixels, lpixels, incs, 0, (short *) buffer, &anynull, status); ffppri(newptr, 1, firstpix, outsize, (short *) buffer, status); } else if (bitpix == 32) { ffgsvk(fptr, 1, naxis, naxes, fpixels, lpixels, incs, 0, (int *) buffer, &anynull, status); ffpprk(newptr, 1, firstpix, outsize, (int *) buffer, status); } else if (bitpix == -32) { ffgsve(fptr, 1, naxis, naxes, fpixels, lpixels, incs, FLOATNULLVALUE, (float *) buffer, &anynull, status); ffppne(newptr, 1, firstpix, outsize, (float *) buffer, FLOATNULLVALUE, status); } else if (bitpix == -64) { ffgsvd(fptr, 1, naxis, naxes, fpixels, lpixels, incs, DOUBLENULLVALUE, buffer, &anynull, status); ffppnd(newptr, 1, firstpix, outsize, buffer, DOUBLENULLVALUE, status); } else if (bitpix == 64) { ffgsvjj(fptr, 1, naxis, naxes, fpixels, lpixels, incs, 0, (LONGLONG *) buffer, &anynull, status); ffpprjj(newptr, 1, firstpix, outsize, (LONGLONG *) buffer, status); } firstpix += outsize; } } } free(buffer); /* finished with the memory */ if (*status > 0) { ffpmsg("fits_copy_image_section: error copying image section"); return(*status); } return(*status); } /*--------------------------------------------------------------------------*/ int fits_get_section_range(char **ptr, long *secmin, long *secmax, long *incre, int *status) /* Parse the input image section specification string, returning the min, max and increment values. Typical string = "1:512:2" or "1:512" */ { int slen, isanumber; char token[FLEN_VALUE], *tstbuff=0; if (*status > 0) return(*status); slen = fits_get_token2(ptr, " ,:", &tstbuff, &isanumber, status); /* get 1st token */ if (slen==0) { /* support [:2,:2] type syntax, where the leading * is implied */ strcpy(token,"*"); } else { if (strlen(tstbuff) > FLEN_VALUE-1) { ffpmsg("Error: image section string too long (fits_get_section_range)"); free(tstbuff); *status = URL_PARSE_ERROR; return(*status); } strcpy(token, tstbuff); free(tstbuff); tstbuff=0; } if (*token == '*') /* wild card means to use the whole range */ { *secmin = 1; *secmax = 0; } else if (*token == '-' && *(token+1) == '*' ) /* invert the whole range */ { *secmin = 0; *secmax = 1; } else { if (slen == 0 || !isanumber || **ptr != ':') return(*status = URL_PARSE_ERROR); /* the token contains the min value */ *secmin = atol(token); (*ptr)++; /* skip the colon between the min and max values */ slen = fits_get_token2(ptr, " ,:", &tstbuff, &isanumber, status); /* get token */ if (slen == 0 || !isanumber) { if (tstbuff) free(tstbuff); return(*status = URL_PARSE_ERROR); } if (strlen(tstbuff) > FLEN_VALUE-1) { ffpmsg("Error: image section string too long (fits_get_section_range)"); free(tstbuff); *status = URL_PARSE_ERROR; return(*status); } strcpy(token, tstbuff); free(tstbuff); tstbuff=0; /* the token contains the max value */ *secmax = atol(token); } if (**ptr == ':') { (*ptr)++; /* skip the colon between the max and incre values */ slen = fits_get_token2(ptr, " ,", &tstbuff, &isanumber, status); /* get token */ if (slen == 0 || !isanumber) { if (tstbuff) free(tstbuff); return(*status = URL_PARSE_ERROR); } if (strlen(tstbuff) > FLEN_VALUE-1) { ffpmsg("Error: image section string too long (fits_get_section_range)"); free(tstbuff); *status = URL_PARSE_ERROR; return(*status); } strcpy(token, tstbuff); free(tstbuff); tstbuff=0; *incre = atol(token); } else *incre = 1; /* default increment if none is supplied */ if (**ptr == ',') (*ptr)++; while (**ptr == ' ') /* skip any trailing blanks */ (*ptr)++; if (*secmin < 0 || *secmax < 0 || *incre < 1) *status = URL_PARSE_ERROR; return(*status); } /*--------------------------------------------------------------------------*/ int ffselect_table( fitsfile **fptr, /* IO - pointer to input table; on output it */ /* points to the new selected rows table */ char *outfile, /* I - name for output file */ char *expr, /* I - Boolean expression */ int *status) { fitsfile *newptr; int ii, hdunum; if (*outfile) { /* create new empty file in to hold the selected rows */ if (ffinit(&newptr, outfile, status) > 0) { ffpmsg( "failed to create file for selected rows from input table"); ffpmsg(outfile); return(*status); } fits_get_hdu_num(*fptr, &hdunum); /* current HDU number in input file */ /* copy all preceding extensions to the output file, if the 'only_one' flag is not set */ if (!((*fptr)->Fptr)->only_one) { for (ii = 1; ii < hdunum; ii++) { fits_movabs_hdu(*fptr, ii, NULL, status); if (fits_copy_hdu(*fptr, newptr, 0, status) > 0) { ffclos(newptr, status); return(*status); } } } else { /* just copy the primary array */ fits_movabs_hdu(*fptr, 1, NULL, status); if (fits_copy_hdu(*fptr, newptr, 0, status) > 0) { ffclos(newptr, status); return(*status); } } fits_movabs_hdu(*fptr, hdunum, NULL, status); /* copy all the header keywords from the input to output file */ if (fits_copy_header(*fptr, newptr, status) > 0) { ffclos(newptr, status); return(*status); } /* set number of rows = 0 */ fits_modify_key_lng(newptr, "NAXIS2", 0, NULL,status); (newptr->Fptr)->numrows = 0; (newptr->Fptr)->origrows = 0; if (ffrdef(newptr, status) > 0) /* force the header to be scanned */ { ffclos(newptr, status); return(*status); } } else newptr = *fptr; /* will delete rows in place in the table */ /* copy rows which satisfy the selection expression to the output table */ /* or delete the nonqualifying rows if *fptr = newptr. */ if (fits_select_rows(*fptr, newptr, expr, status) > 0) { if (*outfile) ffclos(newptr, status); return(*status); } if (*outfile) { /* copy any remaining HDUs to the output copy */ if (!((*fptr)->Fptr)->only_one) { for (ii = hdunum + 1; 1; ii++) { if (fits_movabs_hdu(*fptr, ii, NULL, status) > 0) break; fits_copy_hdu(*fptr, newptr, 0, status); } if (*status == END_OF_FILE) *status = 0; /* got the expected EOF error; reset = 0 */ else if (*status > 0) { ffclos(newptr, status); return(*status); } } else { hdunum = 2; } /* close the original file and return ptr to the new image */ ffclos(*fptr, status); *fptr = newptr; /* reset the pointer to the new table */ /* move back to the selected table HDU */ fits_movabs_hdu(*fptr, hdunum, NULL, status); } return(*status); } /*--------------------------------------------------------------------------*/ int ffparsecompspec(fitsfile *fptr, /* I - FITS file pointer */ char *compspec, /* I - image compression specification */ int *status) /* IO - error status */ /* Parse the image compression specification that was give in square brackets following the output FITS file name, as in these examples: myfile.fits[compress] - default Rice compression, row by row myfile.fits[compress TYPE] - the first letter of TYPE defines the compression algorithm: R = Rice G = GZIP H = HCOMPRESS HS = HCOMPRESS (with smoothing) B - BZIP2 P = PLIO myfile.fits[compress TYPE 100,100] - the numbers give the dimensions of the compression tiles. Default is NAXIS1, 1, 1, ... other optional parameters may be specified following a semi-colon myfile.fits[compress; q 8.0] q specifies the floating point mufile.fits[compress TYPE; q -.0002] quantization level; myfile.fits[compress TYPE 100,100; q 10, s 25] s specifies the HCOMPRESS integer scaling parameter The compression parameters are saved in the fptr->Fptr structure for use when writing FITS images. */ { char *ptr1; /* initialize with default values */ int ii, compresstype = RICE_1, smooth = 0; int quantize_method = SUBTRACTIVE_DITHER_1; long tilesize[MAX_COMPRESS_DIM] = {0,0,0,0,0,0}; float qlevel = -99., scale = 0.; ptr1 = compspec; while (*ptr1 == ' ') /* ignore leading blanks */ ptr1++; if (strncmp(ptr1, "compress", 8) && strncmp(ptr1, "COMPRESS", 8) ) { /* apparently this string does not specify compression parameters */ return(*status = URL_PARSE_ERROR); } ptr1 += 8; while (*ptr1 == ' ') /* ignore leading blanks */ ptr1++; /* ========================= */ /* look for compression type */ /* ========================= */ if (*ptr1 == 'r' || *ptr1 == 'R') { compresstype = RICE_1; while (*ptr1 != ' ' && *ptr1 != ';' && *ptr1 != '\0') ptr1++; } else if (*ptr1 == 'g' || *ptr1 == 'G') { compresstype = GZIP_1; while (*ptr1 != ' ' && *ptr1 != ';' && *ptr1 != '\0') ptr1++; } /* else if (*ptr1 == 'b' || *ptr1 == 'B') { compresstype = BZIP2_1; while (*ptr1 != ' ' && *ptr1 != ';' && *ptr1 != '\0') ptr1++; } */ else if (*ptr1 == 'p' || *ptr1 == 'P') { compresstype = PLIO_1; while (*ptr1 != ' ' && *ptr1 != ';' && *ptr1 != '\0') ptr1++; } else if (*ptr1 == 'h' || *ptr1 == 'H') { compresstype = HCOMPRESS_1; ptr1++; if (*ptr1 == 's' || *ptr1 == 'S') smooth = 1; /* apply smoothing when uncompressing HCOMPRESSed image */ while (*ptr1 != ' ' && *ptr1 != ';' && *ptr1 != '\0') ptr1++; } /* ======================== */ /* look for tile dimensions */ /* ======================== */ while (*ptr1 == ' ') /* ignore leading blanks */ ptr1++; ii = 0; while (isdigit( (int) *ptr1) && ii < 9) { tilesize[ii] = atol(ptr1); /* read the integer value */ ii++; while (isdigit((int) *ptr1)) /* skip over the integer */ ptr1++; if (*ptr1 == ',') ptr1++; /* skip over the comma */ while (*ptr1 == ' ') /* ignore leading blanks */ ptr1++; } /* ========================================================= */ /* look for semi-colon, followed by other optional parameters */ /* ========================================================= */ if (*ptr1 == ';') { ptr1++; while (*ptr1 == ' ') /* ignore leading blanks */ ptr1++; while (*ptr1 != 0) { /* haven't reached end of string yet */ if (*ptr1 == 's' || *ptr1 == 'S') { /* this should be the HCOMPRESS "scale" parameter; default = 1 */ ptr1++; while (*ptr1 == ' ') /* ignore leading blanks */ ptr1++; scale = (float) strtod(ptr1, &ptr1); while (*ptr1 == ' ' || *ptr1 == ',') /* skip over blanks or comma */ ptr1++; } else if (*ptr1 == 'q' || *ptr1 == 'Q') { /* this should be the floating point quantization parameter */ ptr1++; if (*ptr1 == 'z' || *ptr1 == 'Z') { /* use the subtractive_dither_2 option */ quantize_method = SUBTRACTIVE_DITHER_2; ptr1++; } else if (*ptr1 == '0') { /* do not dither */ quantize_method = NO_DITHER; ptr1++; } while (*ptr1 == ' ') /* ignore leading blanks */ ptr1++; qlevel = (float) strtod(ptr1, &ptr1); while (*ptr1 == ' ' || *ptr1 == ',') /* skip over blanks or comma */ ptr1++; } else { return(*status = URL_PARSE_ERROR); } } } /* ================================= */ /* finished parsing; save the values */ /* ================================= */ fits_set_compression_type(fptr, compresstype, status); fits_set_tile_dim(fptr, MAX_COMPRESS_DIM, tilesize, status); if (compresstype == HCOMPRESS_1) { fits_set_hcomp_scale (fptr, scale, status); fits_set_hcomp_smooth(fptr, smooth, status); } if (qlevel != -99.) { fits_set_quantize_level(fptr, qlevel, status); fits_set_quantize_method(fptr, quantize_method, status); } return(*status); } /*--------------------------------------------------------------------------*/ int ffdkinit(fitsfile **fptr, /* O - FITS file pointer */ const char *name, /* I - name of file to create */ int *status) /* IO - error status */ /* Create and initialize a new FITS file on disk. This routine differs from ffinit in that the input 'name' is literally taken as the name of the disk file to be created, and it does not support CFITSIO's extended filename syntax. */ { *fptr = 0; /* initialize null file pointer, */ /* regardless of the value of *status */ if (*status > 0) return(*status); *status = CREATE_DISK_FILE; ffinit(fptr, name,status); return(*status); } /*--------------------------------------------------------------------------*/ int ffinit(fitsfile **fptr, /* O - FITS file pointer */ const char *name, /* I - name of file to create */ int *status) /* IO - error status */ /* Create and initialize a new FITS file. */ { int ii, driver, slen, clobber = 0; char *url; char urltype[MAX_PREFIX_LEN], outfile[FLEN_FILENAME]; char tmplfile[FLEN_FILENAME], compspec[80]; int handle, create_disk_file = 0; *fptr = 0; /* initialize null file pointer, */ /* regardless of the value of *status */ if (*status > 0) return(*status); if (*status == CREATE_DISK_FILE) { create_disk_file = 1; *status = 0; } if (need_to_initialize) { /* this is called only once */ *status = fits_init_cfitsio(); } if (*status > 0) return(*status); url = (char *) name; while (*url == ' ') /* ignore leading spaces in the filename */ url++; if (*url == '\0') { ffpmsg("Name of file to create is blank. (ffinit)"); return(*status = FILE_NOT_CREATED); } if (create_disk_file) { if (strlen(url) > FLEN_FILENAME - 1) { ffpmsg("Filename is too long. (ffinit)"); return(*status = FILE_NOT_CREATED); } strcpy(outfile, url); strcpy(urltype, "file://"); tmplfile[0] = '\0'; compspec[0] = '\0'; } else { /* check for clobber symbol, i.e, overwrite existing file */ if (*url == '!') { clobber = TRUE; url++; } else clobber = FALSE; /* parse the output file specification */ /* this routine checks that the strings will not overflow */ ffourl(url, urltype, outfile, tmplfile, compspec, status); if (*status > 0) { ffpmsg("could not parse the output filename: (ffinit)"); ffpmsg(url); return(*status); } } /* find which driver corresponds to the urltype */ *status = urltype2driver(urltype, &driver); if (*status) { ffpmsg("could not find driver for this file: (ffinit)"); ffpmsg(url); return(*status); } /* delete pre-existing file, if asked to do so */ if (clobber) { if (driverTable[driver].remove) (*driverTable[driver].remove)(outfile); } /* call appropriate driver to create the file */ if (driverTable[driver].create) { FFLOCK; /* lock this while searching for vacant handle */ *status = (*driverTable[driver].create)(outfile, &handle); FFUNLOCK; if (*status) { ffpmsg("failed to create new file (already exists?):"); ffpmsg(url); return(*status); } } else { ffpmsg("cannot create a new file of this type: (ffinit)"); ffpmsg(url); return(*status = FILE_NOT_CREATED); } /* allocate fitsfile structure and initialize = 0 */ *fptr = (fitsfile *) calloc(1, sizeof(fitsfile)); if (!(*fptr)) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate structure for following file: (ffopen)"); ffpmsg(url); return(*status = MEMORY_ALLOCATION); } /* allocate FITSfile structure and initialize = 0 */ (*fptr)->Fptr = (FITSfile *) calloc(1, sizeof(FITSfile)); if (!((*fptr)->Fptr)) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate structure for following file: (ffopen)"); ffpmsg(url); free(*fptr); *fptr = 0; return(*status = MEMORY_ALLOCATION); } slen = strlen(url) + 1; slen = maxvalue(slen, 32); /* reserve at least 32 chars */ ((*fptr)->Fptr)->filename = (char *) malloc(slen); /* mem for file name */ if ( !(((*fptr)->Fptr)->filename) ) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate memory for filename: (ffinit)"); ffpmsg(url); free((*fptr)->Fptr); free(*fptr); *fptr = 0; /* return null file pointer */ return(*status = FILE_NOT_CREATED); } /* mem for headstart array */ ((*fptr)->Fptr)->headstart = (LONGLONG *) calloc(1001, sizeof(LONGLONG)); if ( !(((*fptr)->Fptr)->headstart) ) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate memory for headstart array: (ffinit)"); ffpmsg(url); free( ((*fptr)->Fptr)->filename); free((*fptr)->Fptr); free(*fptr); *fptr = 0; /* return null file pointer */ return(*status = MEMORY_ALLOCATION); } /* mem for file I/O buffers */ ((*fptr)->Fptr)->iobuffer = (char *) calloc(NIOBUF, IOBUFLEN); if ( !(((*fptr)->Fptr)->iobuffer) ) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate memory for iobuffer array: (ffinit)"); ffpmsg(url); free( ((*fptr)->Fptr)->headstart); /* free memory for headstart array */ free( ((*fptr)->Fptr)->filename); free((*fptr)->Fptr); free(*fptr); *fptr = 0; /* return null file pointer */ return(*status = MEMORY_ALLOCATION); } /* initialize the ageindex array (relative age of the I/O buffers) */ /* and initialize the bufrecnum array as being empty */ for (ii = 0; ii < NIOBUF; ii++) { ((*fptr)->Fptr)->ageindex[ii] = ii; ((*fptr)->Fptr)->bufrecnum[ii] = -1; } /* store the parameters describing the file */ ((*fptr)->Fptr)->MAXHDU = 1000; /* initial size of headstart */ ((*fptr)->Fptr)->filehandle = handle; /* store the file pointer */ ((*fptr)->Fptr)->driver = driver; /* driver number */ strcpy(((*fptr)->Fptr)->filename, url); /* full input filename */ ((*fptr)->Fptr)->filesize = 0; /* physical file size */ ((*fptr)->Fptr)->logfilesize = 0; /* logical file size */ ((*fptr)->Fptr)->writemode = 1; /* read-write mode */ ((*fptr)->Fptr)->datastart = DATA_UNDEFINED; /* unknown start of data */ ((*fptr)->Fptr)->curbuf = -1; /* undefined current IO buffer */ ((*fptr)->Fptr)->open_count = 1; /* structure is currently used once */ ((*fptr)->Fptr)->validcode = VALIDSTRUC; /* flag denoting valid structure */ ffldrc(*fptr, 0, IGNORE_EOF, status); /* initialize first record */ fits_store_Fptr( (*fptr)->Fptr, status); /* store Fptr address */ /* if template file was given, use it to define structure of new file */ if (tmplfile[0]) ffoptplt(*fptr, tmplfile, status); /* parse and save image compression specification, if given */ if (compspec[0]) ffparsecompspec(*fptr, compspec, status); return(*status); /* successful return */ } /*--------------------------------------------------------------------------*/ /* ffimem == fits_create_memfile */ int ffimem(fitsfile **fptr, /* O - FITS file pointer */ void **buffptr, /* I - address of memory pointer */ size_t *buffsize, /* I - size of buffer, in bytes */ size_t deltasize, /* I - increment for future realloc's */ void *(*mem_realloc)(void *p, size_t newsize), /* function */ int *status) /* IO - error status */ /* Create and initialize a new FITS file in memory */ { int ii, driver, slen; char urltype[MAX_PREFIX_LEN]; int handle; if (*status > 0) return(*status); *fptr = 0; /* initialize null file pointer */ if (need_to_initialize) { /* this is called only once */ *status = fits_init_cfitsio(); } if (*status > 0) return(*status); strcpy(urltype, "memkeep://"); /* URL type for pre-existing memory file */ *status = urltype2driver(urltype, &driver); if (*status > 0) { ffpmsg("could not find driver for pre-existing memory file: (ffimem)"); return(*status); } /* call driver routine to "open" the memory file */ FFLOCK; /* lock this while searching for vacant handle */ *status = mem_openmem( buffptr, buffsize, deltasize, mem_realloc, &handle); FFUNLOCK; if (*status > 0) { ffpmsg("failed to open pre-existing memory file: (ffimem)"); return(*status); } /* allocate fitsfile structure and initialize = 0 */ *fptr = (fitsfile *) calloc(1, sizeof(fitsfile)); if (!(*fptr)) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate structure for memory file: (ffimem)"); return(*status = MEMORY_ALLOCATION); } /* allocate FITSfile structure and initialize = 0 */ (*fptr)->Fptr = (FITSfile *) calloc(1, sizeof(FITSfile)); if (!((*fptr)->Fptr)) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate structure for memory file: (ffimem)"); free(*fptr); *fptr = 0; return(*status = MEMORY_ALLOCATION); } slen = 32; /* reserve at least 32 chars */ ((*fptr)->Fptr)->filename = (char *) malloc(slen); /* mem for file name */ if ( !(((*fptr)->Fptr)->filename) ) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate memory for filename: (ffimem)"); free((*fptr)->Fptr); free(*fptr); *fptr = 0; /* return null file pointer */ return(*status = MEMORY_ALLOCATION); } /* mem for headstart array */ ((*fptr)->Fptr)->headstart = (LONGLONG *) calloc(1001, sizeof(LONGLONG)); if ( !(((*fptr)->Fptr)->headstart) ) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate memory for headstart array: (ffimem)"); free( ((*fptr)->Fptr)->filename); free((*fptr)->Fptr); free(*fptr); *fptr = 0; /* return null file pointer */ return(*status = MEMORY_ALLOCATION); } /* mem for file I/O buffers */ ((*fptr)->Fptr)->iobuffer = (char *) calloc(NIOBUF, IOBUFLEN); if ( !(((*fptr)->Fptr)->iobuffer) ) { (*driverTable[driver].close)(handle); /* close the file */ ffpmsg("failed to allocate memory for iobuffer array: (ffimem)"); free( ((*fptr)->Fptr)->headstart); /* free memory for headstart array */ free( ((*fptr)->Fptr)->filename); free((*fptr)->Fptr); free(*fptr); *fptr = 0; /* return null file pointer */ return(*status = MEMORY_ALLOCATION); } /* initialize the ageindex array (relative age of the I/O buffers) */ /* and initialize the bufrecnum array as being empty */ for (ii = 0; ii < NIOBUF; ii++) { ((*fptr)->Fptr)->ageindex[ii] = ii; ((*fptr)->Fptr)->bufrecnum[ii] = -1; } /* store the parameters describing the file */ ((*fptr)->Fptr)->MAXHDU = 1000; /* initial size of headstart */ ((*fptr)->Fptr)->filehandle = handle; /* file handle */ ((*fptr)->Fptr)->driver = driver; /* driver number */ strcpy(((*fptr)->Fptr)->filename, "memfile"); /* dummy filename */ ((*fptr)->Fptr)->filesize = *buffsize; /* physical file size */ ((*fptr)->Fptr)->logfilesize = *buffsize; /* logical file size */ ((*fptr)->Fptr)->writemode = 1; /* read-write mode */ ((*fptr)->Fptr)->datastart = DATA_UNDEFINED; /* unknown start of data */ ((*fptr)->Fptr)->curbuf = -1; /* undefined current IO buffer */ ((*fptr)->Fptr)->open_count = 1; /* structure is currently used once */ ((*fptr)->Fptr)->validcode = VALIDSTRUC; /* flag denoting valid structure */ ffldrc(*fptr, 0, IGNORE_EOF, status); /* initialize first record */ fits_store_Fptr( (*fptr)->Fptr, status); /* store Fptr address */ return(*status); } /*--------------------------------------------------------------------------*/ int fits_init_cfitsio(void) /* initialize anything that is required before using the CFITSIO routines */ { int status; union u_tag { short ival; char cval[2]; } u; fitsio_init_lock(); FFLOCK; /* lockout other threads while executing this critical */ /* section of code */ if (need_to_initialize == 0) { /* already initialized? */ FFUNLOCK; return(0); } /* test for correct byteswapping. */ u.ival = 1; if ((BYTESWAPPED && u.cval[0] != 1) || (BYTESWAPPED == FALSE && u.cval[1] != 1) ) { printf ("\n!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n"); printf(" Byteswapping is not being done correctly on this system.\n"); printf(" Check the MACHINE and BYTESWAPPED definitions in fitsio2.h\n"); printf(" Please report this problem to the CFITSIO developers.\n"); printf( "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n"); FFUNLOCK; return(1); } /* test that LONGLONG is an 8 byte integer */ if (sizeof(LONGLONG) != 8) { printf ("\n!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n"); printf(" CFITSIO did not find an 8-byte long integer data type.\n"); printf(" sizeof(LONGLONG) = %d\n",(int)sizeof(LONGLONG)); printf(" Please report this problem to the CFITSIO developers.\n"); printf( "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n"); FFUNLOCK; return(1); } /* register the standard I/O drivers that are always available */ /* 1--------------------disk file driver-----------------------*/ status = fits_register_driver("file://", file_init, file_shutdown, file_setoptions, file_getoptions, file_getversion, file_checkfile, file_open, file_create, #ifdef HAVE_FTRUNCATE file_truncate, #else NULL, /* no file truncate function */ #endif file_close, file_remove, file_size, file_flush, file_seek, file_read, file_write); if (status) { ffpmsg("failed to register the file:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 2------------ output temporary memory file driver ----------------*/ status = fits_register_driver("mem://", mem_init, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, NULL, /* checkfile not needed */ NULL, /* open function not allowed */ mem_create, mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the mem:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 3--------------input pre-existing memory file driver----------------*/ status = fits_register_driver("memkeep://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, NULL, /* checkfile not needed */ NULL, /* file open driver function is not used */ NULL, /* create function not allowed */ mem_truncate, mem_close_keep, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the memkeep:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 4-------------------stdin stream driver----------------------*/ /* the stdin stream is copied to memory then opened in memory */ status = fits_register_driver("stdin://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, stdin_checkfile, stdin_open, NULL, /* create function not allowed */ mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the stdin:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 5-------------------stdin file stream driver----------------------*/ /* the stdin stream is copied to a disk file then the disk file is opened */ status = fits_register_driver("stdinfile://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, NULL, /* checkfile not needed */ stdin_open, NULL, /* create function not allowed */ #ifdef HAVE_FTRUNCATE file_truncate, #else NULL, /* no file truncate function */ #endif file_close, file_remove, file_size, file_flush, file_seek, file_read, file_write); if (status) { ffpmsg("failed to register the stdinfile:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 6-----------------------stdout stream driver------------------*/ status = fits_register_driver("stdout://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, NULL, /* checkfile not needed */ NULL, /* open function not required */ mem_create, mem_truncate, stdout_close, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the stdout:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 7------------------iraf disk file to memory driver -----------*/ status = fits_register_driver("irafmem://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, NULL, /* checkfile not needed */ mem_iraf_open, NULL, /* create function not required */ mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the irafmem:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 8------------------raw binary file to memory driver -----------*/ status = fits_register_driver("rawfile://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, NULL, /* checkfile not needed */ mem_rawfile_open, NULL, /* create function not required */ mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the rawfile:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 9------------------compressed disk file to memory driver -----------*/ status = fits_register_driver("compress://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, NULL, /* checkfile not needed */ mem_compress_open, NULL, /* create function not required */ mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the compress:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 10------------------compressed disk file to memory driver -----------*/ /* Identical to compress://, except it allows READWRITE access */ status = fits_register_driver("compressmem://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, NULL, /* checkfile not needed */ mem_compress_openrw, NULL, /* create function not required */ mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the compressmem:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 11------------------compressed disk file to disk file driver -------*/ status = fits_register_driver("compressfile://", NULL, file_shutdown, file_setoptions, file_getoptions, file_getversion, NULL, /* checkfile not needed */ file_compress_open, file_create, #ifdef HAVE_FTRUNCATE file_truncate, #else NULL, /* no file truncate function */ #endif file_close, file_remove, file_size, file_flush, file_seek, file_read, file_write); if (status) { ffpmsg("failed to register the compressfile:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 12---create file in memory, then compress it to disk file on close--*/ status = fits_register_driver("compressoutfile://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, NULL, /* checkfile not needed */ NULL, /* open function not allowed */ mem_create_comp, mem_truncate, mem_close_comp, file_remove, /* delete existing compressed disk file */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg( "failed to register the compressoutfile:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* Register Optional drivers */ #ifdef HAVE_NET_SERVICES /* 13--------------------root driver-----------------------*/ status = fits_register_driver("root://", root_init, root_shutdown, root_setoptions, root_getoptions, root_getversion, NULL, /* checkfile not needed */ root_open, root_create, NULL, /* No truncate possible */ root_close, NULL, /* No remove possible */ root_size, /* no size possible */ root_flush, root_seek, /* Though will always succeed */ root_read, root_write); if (status) { ffpmsg("failed to register the root:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 14--------------------http driver-----------------------*/ status = fits_register_driver("http://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, http_checkfile, http_open, NULL, /* create function not required */ mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the http:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 15--------------------http file driver-----------------------*/ status = fits_register_driver("httpfile://", NULL, file_shutdown, file_setoptions, file_getoptions, file_getversion, NULL, /* checkfile not needed */ http_file_open, file_create, #ifdef HAVE_FTRUNCATE file_truncate, #else NULL, /* no file truncate function */ #endif file_close, file_remove, file_size, file_flush, file_seek, file_read, file_write); if (status) { ffpmsg("failed to register the httpfile:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 16--------------------http memory driver-----------------------*/ /* same as http:// driver, except memory file can be opened READWRITE */ status = fits_register_driver("httpmem://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, http_checkfile, http_file_open, /* this will simply call http_open */ NULL, /* create function not required */ mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the httpmem:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 17--------------------httpcompress file driver-----------------------*/ status = fits_register_driver("httpcompress://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, NULL, /* checkfile not needed */ http_compress_open, NULL, /* create function not required */ mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the httpcompress:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 18--------------------ftp driver-----------------------*/ status = fits_register_driver("ftp://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, ftp_checkfile, ftp_open, NULL, /* create function not required */ mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the ftp:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 19--------------------ftp file driver-----------------------*/ status = fits_register_driver("ftpfile://", NULL, file_shutdown, file_setoptions, file_getoptions, file_getversion, NULL, /* checkfile not needed */ ftp_file_open, file_create, #ifdef HAVE_FTRUNCATE file_truncate, #else NULL, /* no file truncate function */ #endif file_close, file_remove, file_size, file_flush, file_seek, file_read, file_write); if (status) { ffpmsg("failed to register the ftpfile:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 20--------------------ftp mem driver-----------------------*/ /* same as ftp:// driver, except memory file can be opened READWRITE */ status = fits_register_driver("ftpmem://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, ftp_checkfile, ftp_file_open, /* this will simply call ftp_open */ NULL, /* create function not required */ mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the ftpmem:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 21--------------------ftp compressed file driver------------------*/ status = fits_register_driver("ftpcompress://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, NULL, /* checkfile not needed */ ftp_compress_open, 0, /* create function not required */ mem_truncate, mem_close_free, 0, /* remove function not required */ mem_size, 0, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the ftpcompress:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* === End of net drivers section === */ #endif /* ==================== SHARED MEMORY DRIVER SECTION ======================= */ #ifdef HAVE_SHMEM_SERVICES /* 22--------------------shared memory driver-----------------------*/ status = fits_register_driver("shmem://", smem_init, smem_shutdown, smem_setoptions, smem_getoptions, smem_getversion, NULL, /* checkfile not needed */ smem_open, smem_create, NULL, /* truncate file not supported yet */ smem_close, smem_remove, smem_size, smem_flush, smem_seek, smem_read, smem_write ); if (status) { ffpmsg("failed to register the shmem:// driver (init_cfitsio)"); FFUNLOCK; return(status); } #endif /* ==================== END OF SHARED MEMORY DRIVER SECTION ================ */ #ifdef HAVE_GSIFTP /* 23--------------------gsiftp driver-----------------------*/ status = fits_register_driver("gsiftp://", gsiftp_init, gsiftp_shutdown, gsiftp_setoptions, gsiftp_getoptions, gsiftp_getversion, gsiftp_checkfile, gsiftp_open, gsiftp_create, #ifdef HAVE_FTRUNCATE gsiftp_truncate, #else NULL, #endif gsiftp_close, NULL, /* remove function not yet implemented */ gsiftp_size, gsiftp_flush, gsiftp_seek, gsiftp_read, gsiftp_write); if (status) { ffpmsg("failed to register the gsiftp:// driver (init_cfitsio)"); FFUNLOCK; return(status); } #endif /* 24---------------stdin and stdout stream driver-------------------*/ status = fits_register_driver("stream://", NULL, NULL, NULL, NULL, NULL, NULL, stream_open, stream_create, NULL, /* no stream truncate function */ stream_close, NULL, /* no stream remove */ stream_size, stream_flush, stream_seek, stream_read, stream_write); if (status) { ffpmsg("failed to register the stream:// driver (init_cfitsio)"); FFUNLOCK; return(status); } #ifdef HAVE_NET_SERVICES /* 25--------------------https driver-----------------------*/ status = fits_register_driver("https://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, https_checkfile, https_open, NULL, /* create function not required */ mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the https:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 26--------------------https file driver-----------------------*/ status = fits_register_driver("httpsfile://", NULL, file_shutdown, file_setoptions, file_getoptions, file_getversion, NULL, /* checkfile not needed */ https_file_open, file_create, #ifdef HAVE_FTRUNCATE file_truncate, #else NULL, /* no file truncate function */ #endif file_close, file_remove, file_size, file_flush, file_seek, file_read, file_write); if (status) { ffpmsg("failed to register the httpsfile:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 27--------------------https memory driver-----------------------*/ /* same as https:// driver, except memory file can be opened READWRITE */ status = fits_register_driver("httpsmem://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, https_checkfile, https_file_open, /* this will simply call https_open */ NULL, /* create function not required */ mem_truncate, mem_close_free, NULL, /* remove function not required */ mem_size, NULL, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the httpsmem:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* === End of https net drivers section === */ /* 28--------------------ftps driver-----------------------*/ status = fits_register_driver("ftps://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, ftps_checkfile, ftps_open, NULL, mem_truncate, mem_close_free, NULL, mem_size, NULL, mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the ftps:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 29--------------------ftps file driver-----------------------*/ status = fits_register_driver("ftpsfile://", NULL, file_shutdown, file_setoptions, file_getoptions, file_getversion, NULL, ftps_file_open, file_create, #ifdef HAVE_FTRUNCATE file_truncate, #else NULL, #endif file_close, file_remove, file_size, file_flush, file_seek, file_read, file_write); if (status) { ffpmsg("failed to register the ftpsfile:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 30--------------------ftps memory driver-----------------------*/ /* same as ftps:// driver, except memory file can be opened READWRITE */ status = fits_register_driver("ftpsmem://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, ftps_checkfile, ftps_file_open, NULL, mem_truncate, mem_close_free, NULL, mem_size, NULL, mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the ftpsmem:// driver (init_cfitsio)"); FFUNLOCK; return(status); } /* 31--------------------ftps compressed file driver------------------*/ status = fits_register_driver("ftpscompress://", NULL, mem_shutdown, mem_setoptions, mem_getoptions, mem_getversion, NULL, /* checkfile not needed */ ftps_compress_open, 0, /* create function not required */ mem_truncate, mem_close_free, 0, /* remove function not required */ mem_size, 0, /* flush function not required */ mem_seek, mem_read, mem_write); if (status) { ffpmsg("failed to register the ftpscompress:// driver (init_cfitsio)"); FFUNLOCK; return(status); } #endif /* reset flag. Any other threads will now not need to call this routine */ need_to_initialize = 0; FFUNLOCK; return(status); } /*--------------------------------------------------------------------------*/ int fits_register_driver(char *prefix, int (*init)(void), int (*shutdown)(void), int (*setoptions)(int option), int (*getoptions)(int *options), int (*getversion)(int *version), int (*checkfile) (char *urltype, char *infile, char *outfile), int (*open)(char *filename, int rwmode, int *driverhandle), int (*create)(char *filename, int *driverhandle), int (*truncate)(int driverhandle, LONGLONG filesize), int (*close)(int driverhandle), int (*fremove)(char *filename), int (*size)(int driverhandle, LONGLONG *sizex), int (*flush)(int driverhandle), int (*seek)(int driverhandle, LONGLONG offset), int (*read) (int driverhandle, void *buffer, long nbytes), int (*write)(int driverhandle, void *buffer, long nbytes) ) /* register all the functions needed to support an I/O driver */ { int status; if (no_of_drivers < 0 ) { /* This is bad. looks like memory has been corrupted. */ ffpmsg("Vital CFITSIO parameters held in memory have been corrupted!!"); ffpmsg("Fatal condition detected in fits_register_driver."); return(TOO_MANY_DRIVERS); } if (no_of_drivers + 1 > MAX_DRIVERS) return(TOO_MANY_DRIVERS); if (prefix == NULL) return(BAD_URL_PREFIX); if (init != NULL) { status = (*init)(); /* initialize the driver */ if (status) return(status); } /* fill in data in table */ strncpy(driverTable[no_of_drivers].prefix, prefix, MAX_PREFIX_LEN); driverTable[no_of_drivers].prefix[MAX_PREFIX_LEN - 1] = 0; driverTable[no_of_drivers].init = init; driverTable[no_of_drivers].shutdown = shutdown; driverTable[no_of_drivers].setoptions = setoptions; driverTable[no_of_drivers].getoptions = getoptions; driverTable[no_of_drivers].getversion = getversion; driverTable[no_of_drivers].checkfile = checkfile; driverTable[no_of_drivers].open = open; driverTable[no_of_drivers].create = create; driverTable[no_of_drivers].truncate = truncate; driverTable[no_of_drivers].close = close; driverTable[no_of_drivers].remove = fremove; driverTable[no_of_drivers].size = size; driverTable[no_of_drivers].flush = flush; driverTable[no_of_drivers].seek = seek; driverTable[no_of_drivers].read = read; driverTable[no_of_drivers].write = write; no_of_drivers++; /* increment the number of drivers */ return(0); } /*--------------------------------------------------------------------------*/ /* fits_parse_input_url */ int ffiurl(char *url, /* input filename */ char *urltype, /* e.g., 'file://', 'http://', 'mem://' */ char *infilex, /* root filename (may be complete path) */ char *outfile, /* optional output file name */ char *extspec, /* extension spec: +n or [extname, extver] */ char *rowfilterx, /* boolean row filter expression */ char *binspec, /* histogram binning specifier */ char *colspec, /* column or keyword modifier expression */ int *status) /* parse the input URL into its basic components. This routine does not support the pixfilter or compspec components. */ { return ffifile2(url, urltype, infilex, outfile, extspec, rowfilterx, binspec, colspec, 0, 0, status); } /*--------------------------------------------------------------------------*/ /* fits_parse_input_file */ int ffifile(char *url, /* input filename */ char *urltype, /* e.g., 'file://', 'http://', 'mem://' */ char *infilex, /* root filename (may be complete path) */ char *outfile, /* optional output file name */ char *extspec, /* extension spec: +n or [extname, extver] */ char *rowfilterx, /* boolean row filter expression */ char *binspec, /* histogram binning specifier */ char *colspec, /* column or keyword modifier expression */ char *pixfilter, /* pixel filter expression */ int *status) /* fits_parse_input_filename parse the input URL into its basic components. This routine does not support the compspec component. */ { return ffifile2(url, urltype, infilex, outfile, extspec, rowfilterx, binspec, colspec, pixfilter, 0, status); } /*--------------------------------------------------------------------------*/ int ffifile2(char *url, /* input filename */ char *urltype, /* e.g., 'file://', 'http://', 'mem://' */ char *infilex, /* root filename (may be complete path) */ char *outfile, /* optional output file name */ char *extspec, /* extension spec: +n or [extname, extver] */ char *rowfilterx, /* boolean row filter expression */ char *binspec, /* histogram binning specifier */ char *colspec, /* column or keyword modifier expression */ char *pixfilter, /* pixel filter expression */ char *compspec, /* image compression specification */ int *status) /* fits_parse_input_filename parse the input URL into its basic components. This routine is big and ugly and should be redesigned someday! */ { int ii, jj, slen, infilelen, plus_ext = 0, collen; char *ptr1, *ptr2, *ptr3, *ptr4, *tmptr; int hasAt, hasDot, hasOper, followingOper, spaceTerm, rowFilter; int colStart, binStart, pixStart, compStart; /* must have temporary variable for these, in case inputs are NULL */ char *infile; char *rowfilter; char *tmpstr; if (*status > 0) return(*status); /* Initialize null strings */ if (infilex) *infilex = '\0'; if (urltype) *urltype = '\0'; if (outfile) *outfile = '\0'; if (extspec) *extspec = '\0'; if (binspec) *binspec = '\0'; if (colspec) *colspec = '\0'; if (rowfilterx) *rowfilterx = '\0'; if (pixfilter) *pixfilter = '\0'; if (compspec) *compspec = '\0'; slen = strlen(url); if (slen == 0) /* blank filename ?? */ return(*status); /* allocate memory for 3 strings, each as long as the input url */ infile = (char *) calloc(3, slen + 1); if (!infile) return(*status = MEMORY_ALLOCATION); rowfilter = &infile[slen + 1]; tmpstr = &rowfilter[slen + 1]; ptr1 = url; /* -------------------------------------------------------- */ /* get urltype (e.g., file://, ftp://, http://, etc.) */ /* --------------------------------------------------------- */ if (*ptr1 == '-' && ( *(ptr1 +1) == 0 || *(ptr1 +1) == ' ' || *(ptr1 +1) == '[' || *(ptr1 +1) == '(' ) ) { /* "-" means read file from stdin. Also support "- ", */ /* "-[extname]" and '-(outfile.fits)" but exclude disk file */ /* names that begin with a minus sign, e.g., "-55d33m.fits" */ if (urltype) strcat(urltype, "stdin://"); ptr1++; } else if (!fits_strncasecmp(ptr1, "stdin", 5)) { if (urltype) strcat(urltype, "stdin://"); ptr1 = ptr1 + 5; } else { ptr2 = strstr(ptr1, "://"); ptr3 = strstr(ptr1, "(" ); if (ptr3 && (ptr3 < ptr2) ) { /* the urltype follows a '(' character, so it must apply */ /* to the output file, and is not the urltype of the input file */ ptr2 = 0; /* so reset pointer to zero */ } if (ptr2) /* copy the explicit urltype string */ { if (ptr2-ptr1+3 >= MAX_PREFIX_LEN) { ffpmsg("Name of urltype is too long."); return(*status = URL_PARSE_ERROR); } if (urltype) strncat(urltype, ptr1, ptr2 - ptr1 + 3); ptr1 = ptr2 + 3; } else if (!strncmp(ptr1, "ftp:", 4) ) { /* the 2 //'s are optional */ if (urltype) strcat(urltype, "ftp://"); ptr1 += 4; } else if (!strncmp(ptr1, "gsiftp:", 7) ) { /* the 2 //'s are optional */ if (urltype) strcat(urltype, "gsiftp://"); ptr1 += 7; } else if (!strncmp(ptr1, "http:", 5) ) { /* the 2 //'s are optional */ if (urltype) strcat(urltype, "http://"); ptr1 += 5; } else if (!strncmp(ptr1, "mem:", 4) ) { /* the 2 //'s are optional */ if (urltype) strcat(urltype, "mem://"); ptr1 += 4; } else if (!strncmp(ptr1, "shmem:", 6) ) { /* the 2 //'s are optional */ if (urltype) strcat(urltype, "shmem://"); ptr1 += 6; } else if (!strncmp(ptr1, "file:", 5) ) { /* the 2 //'s are optional */ if (urltype) strcat(urltype, "file://"); ptr1 += 5; } else /* assume file driver */ { if (urltype) strcat(urltype, "file://"); } } /* ---------------------------------------------------------- If this is a http:// type file, then the cgi file name could include the '[' character, which should not be interpreted as part of CFITSIO's Extended File Name Syntax. Test for this case by seeing if the last character is a ']' or ')'. If it is not, then just treat the whole input string as the file name and do not attempt to interprete the name using the extended filename syntax. ----------------------------------------------------------- */ if (urltype && !strncmp(urltype, "http://", 7) ) { /* test for opening parenthesis or bracket in the file name */ if( strchr(ptr1, '(' ) || strchr(ptr1, '[' ) ) { slen = strlen(ptr1); ptr3 = ptr1 + slen - 1; while (*ptr3 == ' ') /* ignore trailing blanks */ ptr3--; if (*ptr3 != ']' && *ptr3 != ')' ) { /* name doesn't end with a ']' or ')' so don't try */ /* to parse this unusual string (may be cgi string) */ if (infilex) { if (strlen(ptr1) > FLEN_FILENAME - 1) { ffpmsg("Name of file is too long."); return(*status = URL_PARSE_ERROR); } strcpy(infilex, ptr1); } free(infile); return(*status); } } } /* ---------------------------------------------------------- Look for VMS style filenames like: disk:[directory.subdirectory]filename.ext, or [directory.subdirectory]filename.ext Check if the first character is a '[' and urltype != stdin or if there is a ':[' string in the remaining url string. If so, then need to move past this bracket character before search for the opening bracket of a filter specification. ----------------------------------------------------------- */ tmptr = ptr1; if (*ptr1 == '[') { if (*url != '-') tmptr = ptr1 + 1; /* this bracket encloses a VMS directory name */ } else { tmptr = strstr(ptr1, ":["); if (tmptr) /* these 2 chars are part of the VMS disk and directory */ tmptr += 2; else tmptr = ptr1; } /* ------------------------ */ /* get the input file name */ /* ------------------------ */ ptr2 = strchr(tmptr, '('); /* search for opening parenthesis ( */ ptr3 = strchr(tmptr, '['); /* search for opening bracket [ */ if (ptr2 == ptr3) /* simple case: no [ or ( in the file name */ { strcat(infile, ptr1); } else if (!ptr3 || /* no bracket, so () enclose output file name */ (ptr2 && (ptr2 < ptr3)) ) /* () enclose output name before bracket */ { strncat(infile, ptr1, ptr2 - ptr1); ptr2++; ptr1 = strchr(ptr2, ')' ); /* search for closing ) */ if (!ptr1) { free(infile); return(*status = URL_PARSE_ERROR); /* error, no closing ) */ } if (outfile) { if (ptr1 - ptr2 > FLEN_FILENAME - 1) { free(infile); return(*status = URL_PARSE_ERROR); } strncat(outfile, ptr2, ptr1 - ptr2); } /* the opening [ could have been part of output name, */ /* e.g., file(out[compress])[3][#row > 5] */ /* so search again for opening bracket following the closing ) */ ptr3 = strchr(ptr1, '['); } else /* bracket comes first, so there is no output name */ { strncat(infile, ptr1, ptr3 - ptr1); } /* strip off any trailing blanks in the names */ slen = strlen(infile); while ( (--slen) > 0 && infile[slen] == ' ') infile[slen] = '\0'; if (outfile) { slen = strlen(outfile); while ( (--slen) > 0 && outfile[slen] == ' ') outfile[slen] = '\0'; } /* --------------------------------------------- */ /* check if this is an IRAF file (.imh extension */ /* --------------------------------------------- */ ptr4 = strstr(infile, ".imh"); /* did the infile name end with ".imh" ? */ if (ptr4 && (*(ptr4 + 4) == '\0')) { if (urltype) strcpy(urltype, "irafmem://"); } /* --------------------------------------------- */ /* check if the 'filename+n' convention has been */ /* used to specifiy which HDU number to open */ /* --------------------------------------------- */ jj = strlen(infile); for (ii = jj - 1; ii >= 0; ii--) { if (infile[ii] == '+') /* search backwards for '+' sign */ break; } if (ii > 0 && (jj - ii) < 7) /* limit extension numbers to 5 digits */ { infilelen = ii; ii++; ptr1 = infile+ii; /* pointer to start of sequence */ for (; ii < jj; ii++) { if (!isdigit((int) infile[ii] ) ) /* are all the chars digits? */ break; } if (ii == jj) { /* yes, the '+n' convention was used. Copy */ /* the digits to the output extspec string. */ plus_ext = 1; if (extspec) { if (jj - infilelen > FLEN_FILENAME - 1) { free(infile); return(*status = URL_PARSE_ERROR); } strncpy(extspec, ptr1, jj - infilelen); } infile[infilelen] = '\0'; /* delete the extension number */ } } /* -------------------------------------------------------------------- */ /* if '*' was given for the output name expand it to the root file name */ /* -------------------------------------------------------------------- */ if (outfile && outfile[0] == '*') { /* scan input name backwards to the first '/' character */ for (ii = jj - 1; ii >= 0; ii--) { if (infile[ii] == '/' || ii == 0) { if (strlen(&infile[ii + 1]) > FLEN_FILENAME - 1) { free(infile); return(*status = URL_PARSE_ERROR); } strcpy(outfile, &infile[ii + 1]); break; } } } /* ------------------------------------------ */ /* copy strings from local copy to the output */ /* ------------------------------------------ */ if (infilex) { if (strlen(infile) > FLEN_FILENAME - 1) { free(infile); return(*status = URL_PARSE_ERROR); } strcpy(infilex, infile); } /* ---------------------------------------------------------- */ /* if no '[' character in the input string, then we are done. */ /* ---------------------------------------------------------- */ if (!ptr3) { free(infile); return(*status); } /* ------------------------------------------- */ /* see if [ extension specification ] is given */ /* ------------------------------------------- */ if (!plus_ext) /* extension no. not already specified? Then */ /* first brackets must enclose extension name or # */ /* or it encloses a image subsection specification */ /* or a raw binary image specifier */ /* or a image compression specifier */ /* Or, the extension specification may have been */ /* omitted and we have to guess what the user intended */ { ptr1 = ptr3 + 1; /* pointer to first char after the [ */ ptr2 = strchr(ptr1, ']' ); /* search for closing ] */ if (!ptr2) { ffpmsg("input file URL is missing closing bracket ']'"); free(infile); return(*status = URL_PARSE_ERROR); /* error, no closing ] */ } /* ---------------------------------------------- */ /* First, test if this is a rawfile specifier */ /* which looks something like: '[ib512,512:2880]' */ /* Test if first character is b,i,j,d,r,f, or u, */ /* and optional second character is b or l, */ /* followed by one or more digits, */ /* finally followed by a ',', ':', or ']' */ /* ---------------------------------------------- */ if (*ptr1 == 'b' || *ptr1 == 'B' || *ptr1 == 'i' || *ptr1 == 'I' || *ptr1 == 'j' || *ptr1 == 'J' || *ptr1 == 'd' || *ptr1 == 'D' || *ptr1 == 'r' || *ptr1 == 'R' || *ptr1 == 'f' || *ptr1 == 'F' || *ptr1 == 'u' || *ptr1 == 'U') { /* next optional character may be a b or l (for Big or Little) */ ptr1++; if (*ptr1 == 'b' || *ptr1 == 'B' || *ptr1 == 'l' || *ptr1 == 'L') ptr1++; if (isdigit((int) *ptr1)) /* must have at least 1 digit */ { while (isdigit((int) *ptr1)) ptr1++; /* skip over digits */ if (*ptr1 == ',' || *ptr1 == ':' || *ptr1 == ']' ) { /* OK, this looks like a rawfile specifier */ if (urltype) { if (strstr(urltype, "stdin") ) strcpy(urltype, "rawstdin://"); else strcpy(urltype, "rawfile://"); } /* append the raw array specifier to infilex */ if (infilex) { if (strlen(infilex) + strlen(ptr3) > FLEN_FILENAME - 1) { free(infile); return(*status = URL_PARSE_ERROR); } strcat(infilex, ptr3); ptr1 = strchr(infilex, ']'); /* find the closing ] char */ if (ptr1) *(ptr1 + 1) = '\0'; /* terminate string after the ] */ } if (extspec) strcpy(extspec, "0"); /* the 0 ext number is implicit */ tmptr = strchr(ptr2 + 1, '[' ); /* search for another [ char */ /* copy any remaining characters into rowfilterx */ if (tmptr && rowfilterx) { if (strlen(rowfilterx) + strlen(tmptr + 1) > FLEN_FILENAME -1) { free(infile); return(*status = URL_PARSE_ERROR); } strcat(rowfilterx, tmptr + 1); tmptr = strchr(rowfilterx, ']' ); /* search for closing ] */ if (tmptr) *tmptr = '\0'; /* overwrite the ] with null terminator */ } free(infile); /* finished parsing, so return */ return(*status); } } } /* end of rawfile specifier test */ /* -------------------------------------------------------- */ /* Not a rawfile, so next, test if this is an image section */ /* i.e., an integer followed by a ':' or a '*' or '-*' */ /* -------------------------------------------------------- */ ptr1 = ptr3 + 1; /* reset pointer to first char after the [ */ tmptr = ptr1; while (*tmptr == ' ') tmptr++; /* skip leading blanks */ while (isdigit((int) *tmptr)) tmptr++; /* skip over leading digits */ if (*tmptr == ':' || *tmptr == '*' || *tmptr == '-') { /* this is an image section specifier */ strcat(rowfilter, ptr3); /* don't want to assume 0 extension any more; may imply an image extension. if (extspec) strcpy(extspec, "0"); */ } else { /* ----------------------------------------------------------------- Not an image section or rawfile spec so may be an extension spec. Examples of valid extension specifiers: [3] - 3rd extension; 0 = primary array [events] - events extension [events, 2] - events extension, with EXTVER = 2 [events,2] - spaces are optional [events, 3, b] - same as above, plus XTENSION = 'BINTABLE' [PICS; colName(12)] - an image in row 12 of the colName column in the PICS table extension [PICS; colName(exposure > 1000)] - as above, but find image in first row with with exposure column value > 1000. [Rate Table] - extension name can contain spaces! [Rate Table;colName(exposure>1000)] Examples of other types of specifiers (Not extension specifiers) [bin] !!! this is ambiguous, and can't be distinguished from a valid extension specifier [bini X=1:512:16] (also binb, binj, binr, and bind are allowed) [binr (X,Y) = 5] [bin @binfilter.txt] [col Time;rate] [col PI=PHA * 1.1] [col -Time; status] [X > 5] [X>5] [@filter.txt] [StatusCol] !!! this is ambiguous, and can't be distinguished from a valid extension specifier [StatusCol==0] [StatusCol || x>6] [gtifilter()] [regfilter("region.reg")] [compress Rice] There will always be some ambiguity between an extension name and a boolean row filtering expression, (as in a couple of the above examples). If there is any doubt, the expression should be treated as an extension specification; The user can always add an explicit expression specifier to override this interpretation. The following decision logic will be used: 1) locate the first token, terminated with a space, comma, semi-colon, or closing bracket. 2) the token is not part of an extension specifier if any of the following is true: - if the token begins with '@' and contains a '.' - if the token contains an operator: = > < || && - if the token begins with "gtifilter(" or "regfilter(" - if the token is terminated by a space and is followed by additional characters (not a ']') AND any of the following: - the token is 'col' - the token is 3 or 4 chars long and begins with 'bin' - the second token begins with an operator: ! = < > | & + - * / % 3) otherwise, the string is assumed to be an extension specifier ----------------------------------------------------------------- */ tmptr = ptr1; while(*tmptr == ' ') tmptr++; hasAt = 0; hasDot = 0; hasOper = 0; followingOper = 0; spaceTerm = 0; rowFilter = 0; colStart = 0; binStart = 0; pixStart = 0; compStart = 0; if (*tmptr == '@') /* test for leading @ symbol */ hasAt = 1; if ( !fits_strncasecmp(tmptr, "col ", 4) ) colStart = 1; if ( !fits_strncasecmp(tmptr, "bin", 3) ) binStart = 1; if ( !fits_strncasecmp(tmptr, "pix", 3) ) pixStart = 1; if ( !fits_strncasecmp(tmptr, "compress ", 9) || !fits_strncasecmp(tmptr, "compress]", 9) ) compStart = 1; if ( !fits_strncasecmp(tmptr, "gtifilter(", 10) || !fits_strncasecmp(tmptr, "regfilter(", 10) ) { rowFilter = 1; } else { /* parse the first token of the expression */ for (ii = 0; ii < ptr2 - ptr1 + 1; ii++, tmptr++) { if (*tmptr == '.') hasDot = 1; else if (*tmptr == '=' || *tmptr == '>' || *tmptr == '<' || (*tmptr == '|' && *(tmptr+1) == '|') || (*tmptr == '&' && *(tmptr+1) == '&') ) hasOper = 1; else if (*tmptr == ',' || *tmptr == ';' || *tmptr == ']') { break; } else if (*tmptr == ' ') /* a space char? */ { while(*tmptr == ' ') /* skip spaces */ tmptr++; if (*tmptr == ']') /* is this the end? */ break; spaceTerm = 1; /* 1st token is terminated by space */ /* test if this is a column or binning specifier */ if (colStart || (ii <= 4 && (binStart || pixStart)) ) rowFilter = 1; else { /* check if next character is an operator */ if (*tmptr == '=' || *tmptr == '>' || *tmptr == '<' || *tmptr == '|' || *tmptr == '&' || *tmptr == '!' || *tmptr == '+' || *tmptr == '-' || *tmptr == '*' || *tmptr == '/' || *tmptr == '%') followingOper = 1; } break; } } } /* test if this is NOT an extension specifier */ if ( rowFilter || (pixStart && spaceTerm) || (hasAt && hasDot) || hasOper || compStart || (spaceTerm && followingOper) ) { /* this is (probably) not an extension specifier */ /* so copy all chars to filter spec string */ strcat(rowfilter, ptr3); } else { /* this appears to be a legit extension specifier */ /* copy the extension specification */ if (extspec) { if (ptr2 - ptr1 > FLEN_FILENAME - 1) { free(infile); return(*status = URL_PARSE_ERROR); } strncat(extspec, ptr1, ptr2 - ptr1); } /* copy any remaining chars to filter spec string */ strcat(rowfilter, ptr2 + 1); } } } /* end of if (!plus_ext) */ else { /* ------------------------------------------------------------------ */ /* already have extension, so this must be a filter spec of some sort */ /* ------------------------------------------------------------------ */ strcat(rowfilter, ptr3); } /* strip off any trailing blanks from filter */ slen = strlen(rowfilter); while ( (--slen) >= 0 && rowfilter[slen] == ' ') rowfilter[slen] = '\0'; if (!rowfilter[0]) { free(infile); return(*status); /* nothing left to parse */ } /* ------------------------------------------------ */ /* does the filter contain a binning specification? */ /* ------------------------------------------------ */ ptr1 = strstr(rowfilter, "[bin"); /* search for "[bin" */ if (!ptr1) ptr1 = strstr(rowfilter, "[BIN"); /* search for "[BIN" */ if (!ptr1) ptr1 = strstr(rowfilter, "[Bin"); /* search for "[Bin" */ if (ptr1) { ptr2 = ptr1 + 4; /* end of the '[bin' string */ if (*ptr2 == 'b' || *ptr2 == 'i' || *ptr2 == 'j' || *ptr2 == 'r' || *ptr2 == 'd') ptr2++; /* skip the datatype code letter */ if ( *ptr2 != ' ' && *ptr2 != ']') ptr1 = NULL; /* bin string must be followed by space or ] */ } if (ptr1) { /* found the binning string */ if (binspec) { if (strlen(ptr1 +1) > FLEN_FILENAME - 1) { free(infile); return(*status = URL_PARSE_ERROR); } strcpy(binspec, ptr1 + 1); ptr2 = strchr(binspec, ']'); if (ptr2) /* terminate the binning filter */ { *ptr2 = '\0'; if ( *(--ptr2) == ' ') /* delete trailing spaces */ *ptr2 = '\0'; } else { ffpmsg("input file URL is missing closing bracket ']'"); ffpmsg(rowfilter); free(infile); return(*status = URL_PARSE_ERROR); /* error, no closing ] */ } } /* delete the binning spec from the row filter string */ ptr2 = strchr(ptr1, ']'); strcpy(tmpstr, ptr2+1); /* copy any chars after the binspec */ strcpy(ptr1, tmpstr); /* overwrite binspec */ } /* --------------------------------------------------------- */ /* does the filter contain a column selection specification? */ /* --------------------------------------------------------- */ ptr1 = strstr(rowfilter, "[col "); if (!ptr1) { ptr1 = strstr(rowfilter, "[COL "); if (!ptr1) ptr1 = strstr(rowfilter, "[Col "); } if (ptr1) { /* find the end of the column specifier */ ptr2 = ptr1 + 5; while (*ptr2 != ']') { if (*ptr2 == '\0') { ffpmsg("input file URL is missing closing bracket ']'"); free(infile); return(*status = URL_PARSE_ERROR); /* error, no closing ] */ } if (*ptr2 == '\'') /* start of a literal string */ { ptr2 = strchr(ptr2 + 1, '\''); /* find closing quote */ if (!ptr2) { ffpmsg ("literal string in input file URL is missing closing single quote"); free(infile); return(*status = URL_PARSE_ERROR); /* error, no closing ] */ } } if (*ptr2 == '[') /* set of nested square brackets */ { ptr2 = strchr(ptr2 + 1, ']'); /* find closing bracket */ if (!ptr2) { ffpmsg ("nested brackets in input file URL is missing closing bracket"); free(infile); return(*status = URL_PARSE_ERROR); /* error, no closing ] */ } } ptr2++; /* continue search for the closing bracket character */ } collen = ptr2 - ptr1 - 1; if (colspec) /* copy the column specifier to output string */ { if (collen > FLEN_FILENAME - 1) { free(infile); return(*status = URL_PARSE_ERROR); } strncpy(colspec, ptr1 + 1, collen); colspec[collen] = '\0'; while (colspec[--collen] == ' ') colspec[collen] = '\0'; /* strip trailing blanks */ } /* delete the column selection spec from the row filter string */ strcpy(tmpstr, ptr2 + 1); /* copy any chars after the colspec */ strcpy(ptr1, tmpstr); /* overwrite binspec */ } /* --------------------------------------------------------- */ /* does the filter contain a pixel filter specification? */ /* --------------------------------------------------------- */ ptr1 = strstr(rowfilter, "[pix"); if (!ptr1) { ptr1 = strstr(rowfilter, "[PIX"); if (!ptr1) ptr1 = strstr(rowfilter, "[Pix"); } if (ptr1) { ptr2 = ptr1 + 4; /* end of the '[pix' string */ if (*ptr2 == 'b' || *ptr2 == 'i' || *ptr2 == 'j' || *ptr2 == 'B' || *ptr2 == 'I' || *ptr2 == 'J' || *ptr2 == 'r' || *ptr2 == 'd' || *ptr2 == 'R' || *ptr2 == 'D') ptr2++; /* skip the datatype code letter */ if (*ptr2 == '1') ptr2++; /* skip the single HDU indicator */ if ( *ptr2 != ' ') ptr1 = NULL; /* pix string must be followed by space */ } if (ptr1) { /* find the end of the pixel filter */ while (*ptr2 != ']') { if (*ptr2 == '\0') { ffpmsg("input file URL is missing closing bracket ']'"); free(infile); return(*status = URL_PARSE_ERROR); /* error, no closing ] */ } if (*ptr2 == '\'') /* start of a literal string */ { ptr2 = strchr(ptr2 + 1, '\''); /* find closing quote */ if (!ptr2) { ffpmsg ("literal string in input file URL is missing closing single quote"); free(infile); return(*status = URL_PARSE_ERROR); /* error, no closing ] */ } } if (*ptr2 == '[') /* set of nested square brackets */ { ptr2 = strchr(ptr2 + 1, ']'); /* find closing bracket */ if (!ptr2) { ffpmsg ("nested brackets in input file URL is missing closing bracket"); free(infile); return(*status = URL_PARSE_ERROR); /* error, no closing ] */ } } ptr2++; /* continue search for the closing bracket character */ } collen = ptr2 - ptr1 - 1; if (pixfilter) /* copy the column specifier to output string */ { if (collen > FLEN_FILENAME - 1) { free(infile); return(*status = URL_PARSE_ERROR); } strncpy(pixfilter, ptr1 + 1, collen); pixfilter[collen] = '\0'; while (pixfilter[--collen] == ' ') pixfilter[collen] = '\0'; /* strip trailing blanks */ } /* delete the pixel filter from the row filter string */ strcpy(tmpstr, ptr2 + 1); /* copy any chars after the pixel filter */ strcpy(ptr1, tmpstr); /* overwrite binspec */ } /* ------------------------------------------------------------ */ /* does the filter contain an image compression specification? */ /* ------------------------------------------------------------ */ ptr1 = strstr(rowfilter, "[compress"); if (ptr1) { ptr2 = ptr1 + 9; /* end of the '[compress' string */ if ( *ptr2 != ' ' && *ptr2 != ']') ptr1 = NULL; /* compress string must be followed by space or ] */ } if (ptr1) { /* found the compress string */ if (compspec) { if (strlen(ptr1 +1) > FLEN_FILENAME - 1) { free(infile); return(*status = URL_PARSE_ERROR); } strcpy(compspec, ptr1 + 1); ptr2 = strchr(compspec, ']'); if (ptr2) /* terminate the binning filter */ { *ptr2 = '\0'; if ( *(--ptr2) == ' ') /* delete trailing spaces */ *ptr2 = '\0'; } else { ffpmsg("input file URL is missing closing bracket ']'"); ffpmsg(rowfilter); free(infile); return(*status = URL_PARSE_ERROR); /* error, no closing ] */ } } /* delete the compression spec from the row filter string */ ptr2 = strchr(ptr1, ']'); strcpy(tmpstr, ptr2+1); /* copy any chars after the binspec */ strcpy(ptr1, tmpstr); /* overwrite binspec */ } /* copy the remaining string to the rowfilter output... should only */ /* contain a rowfilter expression of the form "[expr]" */ if (rowfilterx && rowfilter[0]) { ptr2 = rowfilter + strlen(rowfilter) - 1; if( rowfilter[0]=='[' && *ptr2==']' ) { *ptr2 = '\0'; if (strlen(rowfilter + 1) > FLEN_FILENAME - 1) { free(infile); return(*status = URL_PARSE_ERROR); } strcpy(rowfilterx, rowfilter+1); } else { ffpmsg("input file URL lacks valid row filter expression"); *status = URL_PARSE_ERROR; } } free(infile); return(*status); } /*--------------------------------------------------------------------------*/ int ffexist(const char *infile, /* I - input filename or URL */ int *exists, /* O - 2 = a compressed version of file exists */ /* 1 = yes, disk file exists */ /* 0 = no, disk file could not be found */ /* -1 = infile is not a disk file (could */ /* be a http, ftp, gsiftp, smem, or stdin file) */ int *status) /* I/O status */ /* test if the input file specifier is an existing file on disk If the specified file can't be found, it then searches for a compressed version of the file. */ { FILE *diskfile; char rootname[FLEN_FILENAME]; char *ptr1; if (*status > 0) return(*status); /* strip off any extname or filters from the name */ ffrtnm( (char *)infile, rootname, status); ptr1 = strstr(rootname, "://"); if (ptr1 || *rootname == '-') { if (!strncmp(rootname, "file", 4) ) { ptr1 = ptr1 + 3; /* pointer to start of the disk file name */ } else { *exists = -1; /* this is not a disk file */ return (*status); } } else { ptr1 = rootname; } /* see if the disk file exists */ if (file_openfile(ptr1, 0, &diskfile)) { /* no, couldn't open file, so see if there is a compressed version */ if (file_is_compressed(ptr1) ) { *exists = 2; /* a compressed version of the file exists */ } else { *exists = 0; /* neither file nor compressed version exist */ } } else { /* yes, file exists */ *exists = 1; fclose(diskfile); } return(*status); } /*--------------------------------------------------------------------------*/ int ffrtnm(char *url, char *rootname, int *status) /* parse the input URL, returning the root name (filetype://basename). */ { int ii, jj, slen, infilelen; char *ptr1, *ptr2, *ptr3; char urltype[MAX_PREFIX_LEN]; char infile[FLEN_FILENAME]; if (*status > 0) return(*status); ptr1 = url; *rootname = '\0'; *urltype = '\0'; *infile = '\0'; /* get urltype (e.g., file://, ftp://, http://, etc.) */ if (*ptr1 == '-') /* "-" means read file from stdin */ { strcat(urltype, "-"); ptr1++; } else if (!strncmp(ptr1, "stdin", 5) || !strncmp(ptr1, "STDIN", 5)) { strcat(urltype, "-"); ptr1 = ptr1 + 5; } else { ptr2 = strstr(ptr1, "://"); ptr3 = strstr(ptr1, "(" ); if (ptr3 && (ptr3 < ptr2) ) { /* the urltype follows a '(' character, so it must apply */ /* to the output file, and is not the urltype of the input file */ ptr2 = 0; /* so reset pointer to zero */ } if (ptr2) /* copy the explicit urltype string */ { if (ptr2 - ptr1 + 3 > MAX_PREFIX_LEN - 1) { return(*status = URL_PARSE_ERROR); } strncat(urltype, ptr1, ptr2 - ptr1 + 3); ptr1 = ptr2 + 3; } else if (!strncmp(ptr1, "ftp:", 4) ) { /* the 2 //'s are optional */ strcat(urltype, "ftp://"); ptr1 += 4; } else if (!strncmp(ptr1, "gsiftp:", 7) ) { /* the 2 //'s are optional */ strcat(urltype, "gsiftp://"); ptr1 += 7; } else if (!strncmp(ptr1, "http:", 5) ) { /* the 2 //'s are optional */ strcat(urltype, "http://"); ptr1 += 5; } else if (!strncmp(ptr1, "mem:", 4) ) { /* the 2 //'s are optional */ strcat(urltype, "mem://"); ptr1 += 4; } else if (!strncmp(ptr1, "shmem:", 6) ) { /* the 2 //'s are optional */ strcat(urltype, "shmem://"); ptr1 += 6; } else if (!strncmp(ptr1, "file:", 5) ) { /* the 2 //'s are optional */ ptr1 += 5; } /* else assume file driver */ } /* get the input file name */ ptr2 = strchr(ptr1, '('); /* search for opening parenthesis ( */ ptr3 = strchr(ptr1, '['); /* search for opening bracket [ */ if (ptr2 == ptr3) /* simple case: no [ or ( in the file name */ { if (strlen(ptr1) > FLEN_FILENAME - 1) { return(*status = URL_PARSE_ERROR); } strcat(infile, ptr1); } else if (!ptr3) /* no bracket, so () enclose output file name */ { if (ptr2 - ptr1 > FLEN_FILENAME - 1) { return(*status = URL_PARSE_ERROR); } strncat(infile, ptr1, ptr2 - ptr1); ptr2++; ptr1 = strchr(ptr2, ')' ); /* search for closing ) */ if (!ptr1) return(*status = URL_PARSE_ERROR); /* error, no closing ) */ } else if (ptr2 && (ptr2 < ptr3)) /* () enclose output name before bracket */ { if (ptr2 - ptr1 > FLEN_FILENAME - 1) { return(*status = URL_PARSE_ERROR); } strncat(infile, ptr1, ptr2 - ptr1); ptr2++; ptr1 = strchr(ptr2, ')' ); /* search for closing ) */ if (!ptr1) return(*status = URL_PARSE_ERROR); /* error, no closing ) */ } else /* bracket comes first, so there is no output name */ { if (ptr3 - ptr1 > FLEN_FILENAME - 1) { return(*status = URL_PARSE_ERROR); } strncat(infile, ptr1, ptr3 - ptr1); } /* strip off any trailing blanks in the names */ slen = strlen(infile); for (ii = slen - 1; ii > 0; ii--) { if (infile[ii] == ' ') infile[ii] = '\0'; else break; } /* --------------------------------------------- */ /* check if the 'filename+n' convention has been */ /* used to specifiy which HDU number to open */ /* --------------------------------------------- */ jj = strlen(infile); for (ii = jj - 1; ii >= 0; ii--) { if (infile[ii] == '+') /* search backwards for '+' sign */ break; } if (ii > 0 && (jj - ii) < 5) /* limit extension numbers to 4 digits */ { infilelen = ii; ii++; for (; ii < jj; ii++) { if (!isdigit((int) infile[ii] ) ) /* are all the chars digits? */ break; } if (ii == jj) { /* yes, the '+n' convention was used. */ infile[infilelen] = '\0'; /* delete the extension number */ } } if (strlen(urltype) + strlen(infile) > FLEN_FILENAME - 1) { return(*status = URL_PARSE_ERROR); } strcat(rootname, urltype); /* construct the root name */ strcat(rootname, infile); return(*status); } /*--------------------------------------------------------------------------*/ int ffourl(char *url, /* I - full input URL */ char *urltype, /* O - url type */ char *outfile, /* O - base file name */ char *tpltfile, /* O - template file name, if any */ char *compspec, /* O - compression specification, if any */ int *status) /* parse the output URL into its basic components. */ { char *ptr1, *ptr2, *ptr3; if (*status > 0) return(*status); if (urltype) *urltype = '\0'; if (outfile) *outfile = '\0'; if (tpltfile) *tpltfile = '\0'; if (compspec) *compspec = '\0'; ptr1 = url; while (*ptr1 == ' ') /* ignore leading blanks */ ptr1++; if ( ( (*ptr1 == '-') && ( *(ptr1 +1) == 0 || *(ptr1 +1) == ' ' ) ) || !strcmp(ptr1, "stdout") || !strcmp(ptr1, "STDOUT")) /* "-" means write to stdout; also support "- " */ /* but exclude disk file names that begin with a minus sign */ /* e.g., "-55d33m.fits" */ { if (urltype) strcpy(urltype, "stdout://"); } else { /* not writing to stdout */ /* get urltype (e.g., file://, ftp://, http://, etc.) */ ptr2 = strstr(ptr1, "://"); if (ptr2) /* copy the explicit urltype string */ { if (urltype) { if (ptr2 - ptr1 + 3 > MAX_PREFIX_LEN - 1) { return(*status = URL_PARSE_ERROR); } strncat(urltype, ptr1, ptr2 - ptr1 + 3); } ptr1 = ptr2 + 3; } else /* assume file driver */ { if (urltype) strcat(urltype, "file://"); } /* look for template file name, enclosed in parenthesis */ ptr2 = strchr(ptr1, '('); /* look for image compression parameters, enclosed in sq. brackets */ ptr3 = strchr(ptr1, '['); if (outfile) { if (ptr2) { /* template file was specified */ if (ptr2 - ptr1 > FLEN_FILENAME - 1) { return(*status = URL_PARSE_ERROR); } strncat(outfile, ptr1, ptr2 - ptr1); } else if (ptr3) { /* compression was specified */ if (ptr3 - ptr1 > FLEN_FILENAME - 1) { return(*status = URL_PARSE_ERROR); } strncat(outfile, ptr1, ptr3 - ptr1); } else { /* no template file or compression */ if (strlen(ptr1) > FLEN_FILENAME - 1) { return(*status = URL_PARSE_ERROR); } strcpy(outfile, ptr1); } } if (ptr2) /* template file was specified */ { ptr2++; ptr1 = strchr(ptr2, ')' ); /* search for closing ) */ if (!ptr1) { return(*status = URL_PARSE_ERROR); /* error, no closing ) */ } if (tpltfile) { if (ptr1 - ptr2 > FLEN_FILENAME - 1) { return(*status = URL_PARSE_ERROR); } strncat(tpltfile, ptr2, ptr1 - ptr2); } } if (ptr3) /* compression was specified */ { ptr3++; ptr1 = strchr(ptr3, ']' ); /* search for closing ] */ if (!ptr1) { return(*status = URL_PARSE_ERROR); /* error, no closing ] */ } if (compspec) { if (ptr1 - ptr3 > FLEN_FILENAME - 1) { return(*status = URL_PARSE_ERROR); } strncat(compspec, ptr3, ptr1 - ptr3); } } /* check if a .gz compressed output file is to be created */ /* by seeing if the filename ends in '.gz' */ if (urltype && outfile) { if (!strcmp(urltype, "file://") ) { ptr1 = strstr(outfile, ".gz"); if (ptr1) { /* make sure the ".gz" is at the end of the file name */ ptr1 += 3; if (*ptr1 == 0 || *ptr1 == ' ' ) strcpy(urltype, "compressoutfile://"); } } } } return(*status); } /*--------------------------------------------------------------------------*/ int ffexts(char *extspec, int *extnum, char *extname, int *extvers, int *hdutype, char *imagecolname, char *rowexpress, int *status) { /* Parse the input extension specification string, returning either the extension number or the values of the EXTNAME, EXTVERS, and XTENSION keywords in desired extension. Also return the name of the column containing an image, and an expression to be used to determine which row to use, if present. */ char *ptr1, *ptr2; int slen, nvals; int notint = 1; /* initially assume specified extname is not an integer */ char tmpname[FLEN_VALUE], *loc; *extnum = 0; *extname = '\0'; *extvers = 0; *hdutype = ANY_HDU; *imagecolname = '\0'; *rowexpress = '\0'; if (*status > 0) return(*status); ptr1 = extspec; /* pointer to first char */ while (*ptr1 == ' ') /* skip over any leading blanks */ ptr1++; if (isdigit((int) *ptr1)) /* is the extension specification a number? */ { notint = 0; /* looks like extname may actually be the ext. number */ errno = 0; /* reset this prior to calling strtol */ *extnum = strtol(ptr1, &loc, 10); /* read the string as an integer */ while (*loc == ' ') /* skip over trailing blanks */ loc++; /* check for read error, or junk following the integer */ if ((*loc != '\0' && *loc != ';' ) || (errno == ERANGE) ) { *extnum = 0; notint = 1; /* no, extname was not a simple integer after all */ errno = 0; /* reset error condition flag if it was set */ } if ( *extnum < 0 || *extnum > 99999) { *extnum = 0; /* this is not a reasonable extension number */ ffpmsg("specified extension number is out of range:"); ffpmsg(extspec); return(*status = URL_PARSE_ERROR); } } /* This logic was too simple, and failed on extnames like '1000TEMP' where it would try to move to the 1000th extension if (isdigit((int) *ptr1)) { sscanf(ptr1, "%d", extnum); if (*extnum < 0 || *extnum > 9999) { *extnum = 0; ffpmsg("specified extension number is out of range:"); ffpmsg(extspec); return(*status = URL_PARSE_ERROR); } } */ if (notint) { /* not a number, so EXTNAME must be specified, followed by */ /* optional EXTVERS and XTENSION values */ /* don't use space char as end indicator, because there */ /* may be imbedded spaces in the EXTNAME value */ slen = strcspn(ptr1, ",:;"); /* length of EXTNAME */ if (slen > FLEN_VALUE - 1) { return(*status = URL_PARSE_ERROR); } strncat(extname, ptr1, slen); /* EXTNAME value */ /* now remove any trailing blanks */ while (slen > 0 && *(extname + slen -1) == ' ') { *(extname + slen -1) = '\0'; slen--; } ptr1 += slen; slen = strspn(ptr1, " ,:"); /* skip delimiter characters */ ptr1 += slen; slen = strcspn(ptr1, " ,:;"); /* length of EXTVERS */ if (slen) { nvals = sscanf(ptr1, "%d", extvers); /* EXTVERS value */ if (nvals != 1) { ffpmsg("illegal EXTVER value in input URL:"); ffpmsg(extspec); return(*status = URL_PARSE_ERROR); } ptr1 += slen; slen = strspn(ptr1, " ,:"); /* skip delimiter characters */ ptr1 += slen; slen = strcspn(ptr1, ";"); /* length of HDUTYPE */ if (slen) { if (*ptr1 == 'b' || *ptr1 == 'B') *hdutype = BINARY_TBL; else if (*ptr1 == 't' || *ptr1 == 'T' || *ptr1 == 'a' || *ptr1 == 'A') *hdutype = ASCII_TBL; else if (*ptr1 == 'i' || *ptr1 == 'I') *hdutype = IMAGE_HDU; else { ffpmsg("unknown type of HDU in input URL:"); ffpmsg(extspec); return(*status = URL_PARSE_ERROR); } } } else { strcpy(tmpname, extname); ffupch(tmpname); if (!strcmp(tmpname, "PRIMARY") || !strcmp(tmpname, "P") ) *extname = '\0'; /* return extnum = 0 */ } } ptr1 = strchr(ptr1, ';'); if (ptr1) { /* an image is to be opened; the image is contained in a single */ /* cell of a binary table. A column name and an expression to */ /* determine which row to use has been entered. */ ptr1++; /* skip over the ';' delimiter */ while (*ptr1 == ' ') /* skip over any leading blanks */ ptr1++; ptr2 = strchr(ptr1, '('); if (!ptr2) { ffpmsg("illegal specification of image in table cell in input URL:"); ffpmsg(" did not find a row expression enclosed in ( )"); ffpmsg(extspec); return(*status = URL_PARSE_ERROR); } if (ptr2 - ptr1 > FLEN_FILENAME - 1) { return(*status = URL_PARSE_ERROR); } strncat(imagecolname, ptr1, ptr2 - ptr1); /* copy column name */ ptr2++; /* skip over the '(' delimiter */ while (*ptr2 == ' ') /* skip over any leading blanks */ ptr2++; ptr1 = strchr(ptr2, ')'); if (!ptr2) { ffpmsg("illegal specification of image in table cell in input URL:"); ffpmsg(" missing closing ')' character in row expression"); ffpmsg(extspec); return(*status = URL_PARSE_ERROR); } if (ptr1 - ptr2 > FLEN_FILENAME - 1) { return(*status = URL_PARSE_ERROR); } strncat(rowexpress, ptr2, ptr1 - ptr2); /* row expression */ } return(*status); } /*--------------------------------------------------------------------------*/ int ffextn(char *url, /* I - input filename/URL */ int *extension_num, /* O - returned extension number */ int *status) { /* Parse the input url string and return the number of the extension that CFITSIO would automatically move to if CFITSIO were to open this input URL. The extension numbers are one's based, so 1 = the primary array, 2 = the first extension, etc. The extension number that gets returned is determined by the following algorithm: 1. If the input URL includes a binning specification (e.g. 'myfile.fits[3][bin X,Y]') then the returned extension number will always = 1, since CFITSIO would create a temporary primary image on the fly in this case. The same is true if an image within a single cell of a binary table is opened. 2. Else if the input URL specifies an extension number (e.g., 'myfile.fits[3]' or 'myfile.fits+3') then the specified extension number (+ 1) is returned. 3. Else if the extension name is specified in brackets (e.g., this 'myfile.fits[EVENTS]') then the file will be opened and searched for the extension number. If the input URL is '-' (reading from the stdin file stream) this is not possible and an error will be returned. 4. Else if the URL does not specify an extension (e.g. 'myfile.fits') then a special extension number = -99 will be returned to signal that no extension was specified. This feature is mainly for compatibility with existing FTOOLS software. CFITSIO would open the primary array by default (extension_num = 1) in this case. */ fitsfile *fptr; char urltype[20]; char infile[FLEN_FILENAME]; char outfile[FLEN_FILENAME]; char extspec[FLEN_FILENAME]; char extname[FLEN_FILENAME]; char rowfilter[FLEN_FILENAME]; char binspec[FLEN_FILENAME]; char colspec[FLEN_FILENAME]; char imagecolname[FLEN_VALUE], rowexpress[FLEN_FILENAME]; char *cptr; int extnum, extvers, hdutype, tstatus = 0; if (*status > 0) return(*status); /* parse the input URL into its basic components */ fits_parse_input_url(url, urltype, infile, outfile, extspec, rowfilter,binspec, colspec, status); if (*status > 0) return(*status); if (*binspec) /* is there a binning specification? */ { *extension_num = 1; /* a temporary primary array image is created */ return(*status); } if (*extspec) /* is an extension specified? */ { ffexts(extspec, &extnum, extname, &extvers, &hdutype, imagecolname, rowexpress, status); if (*status > 0) return(*status); if (*imagecolname) /* is an image within a table cell being opened? */ { *extension_num = 1; /* a temporary primary array image is created */ return(*status); } if (*extname) { /* have to open the file to search for the extension name (curses!) */ if (!strcmp(urltype, "stdin://")) /* opening stdin would destroying it! */ return(*status = URL_PARSE_ERROR); /* First, strip off any filtering specification */ infile[0] = '\0'; strncat(infile, url, FLEN_FILENAME -1); cptr = strchr(infile, ']'); /* locate the closing bracket */ if (!cptr) { return(*status = URL_PARSE_ERROR); } else { cptr++; *cptr = '\0'; /* terminate URl after the extension spec */ } if (ffopen(&fptr, infile, READONLY, status) > 0) /* open the file */ { ffclos(fptr, &tstatus); return(*status); } ffghdn(fptr, &extnum); /* where am I in the file? */ *extension_num = extnum; ffclos(fptr, status); return(*status); } else { *extension_num = extnum + 1; /* return the specified number (+ 1) */ return(*status); } } else { *extension_num = -99; /* no specific extension was specified */ /* defaults to primary array */ return(*status); } } /*--------------------------------------------------------------------------*/ int ffurlt(fitsfile *fptr, char *urlType, int *status) /* return the prefix string associated with the driver in use by the fitsfile pointer fptr */ { strcpy(urlType, driverTable[fptr->Fptr->driver].prefix); return(*status); } /*--------------------------------------------------------------------------*/ int ffimport_file( char *filename, /* Text file to read */ char **contents, /* Pointer to pointer to hold file */ int *status ) /* CFITSIO error code */ /* Read and concatenate all the lines from the given text file. User must free the pointer returned in contents. Pointer is guaranteed to hold 2 characters more than the length of the text... allows the calling routine to append (or prepend) a newline (or quotes?) without reallocating memory. */ { int allocLen, totalLen, llen, eoline = 1; char *lines,line[256]; FILE *aFile; if( *status > 0 ) return( *status ); totalLen = 0; allocLen = 1024; lines = (char *)malloc( allocLen * sizeof(char) ); if( !lines ) { ffpmsg("Couldn't allocate memory to hold ASCII file contents."); return(*status = MEMORY_ALLOCATION ); } lines[0] = '\0'; if( (aFile = fopen( filename, "r" ))==NULL ) { snprintf(line,256,"Could not open ASCII file %s.",filename); ffpmsg(line); free( lines ); return(*status = FILE_NOT_OPENED); } while( fgets(line,256,aFile)!=NULL ) { llen = strlen(line); if ( eoline && (llen > 1) && (line[0] == '/' && line[1] == '/')) continue; /* skip comment lines begging with // */ eoline = 0; /* replace CR and newline chars at end of line with nulls */ if ((llen > 0) && (line[llen-1]=='\n' || line[llen-1] == '\r')) { line[--llen] = '\0'; eoline = 1; /* found an end of line character */ if ((llen > 0) && (line[llen-1]=='\n' || line[llen-1] == '\r')) { line[--llen] = '\0'; } } if( totalLen + llen + 3 >= allocLen ) { allocLen += 256; lines = (char *)realloc(lines, allocLen * sizeof(char) ); if( ! lines ) { ffpmsg("Couldn't allocate memory to hold ASCII file contents."); *status = MEMORY_ALLOCATION; break; } } strcpy( lines+totalLen, line ); totalLen += llen; if (eoline) { strcpy( lines+totalLen, " "); /* add a space between lines */ totalLen += 1; } } fclose(aFile); *contents = lines; return( *status ); } /*--------------------------------------------------------------------------*/ int fits_get_token(char **ptr, char *delimiter, char *token, int *isanumber) /* O - is this token a number? */ /* parse off the next token, delimited by a character in 'delimiter', from the input ptr string; increment *ptr to the end of the token. Returns the length of the token, not including the delimiter char; */ { char *loc, tval[73]; int slen; double dval; *token = '\0'; while (**ptr == ' ') /* skip over leading blanks */ (*ptr)++; slen = strcspn(*ptr, delimiter); /* length of next token */ if (slen) { strncat(token, *ptr, slen); /* copy token */ (*ptr) += slen; /* skip over the token */ if (isanumber) /* check if token is a number */ { *isanumber = 1; if (strchr(token, 'D')) { strncpy(tval, token, 72); tval[72] = '\0'; /* The C language does not support a 'D'; replace with 'E' */ if ((loc = strchr(tval, 'D'))) *loc = 'E'; dval = strtod(tval, &loc); } else { dval = strtod(token, &loc); } /* check for read error, or junk following the value */ if (*loc != '\0' && *loc != ' ' ) *isanumber = 0; if (errno == ERANGE) *isanumber = 0; } } return(slen); } /*--------------------------------------------------------------------------*/ int fits_get_token2(char **ptr, char *delimiter, char **token, int *isanumber, /* O - is this token a number? */ int *status) /* parse off the next token, delimited by a character in 'delimiter', from the input ptr string; increment *ptr to the end of the token. Returns the length of the token, not including the delimiter char; This routine allocates the *token string; the calling routine must free it */ { char *loc, tval[73]; int slen; double dval; if (*status) return(0); while (**ptr == ' ') /* skip over leading blanks */ (*ptr)++; slen = strcspn(*ptr, delimiter); /* length of next token */ if (slen) { *token = (char *) calloc(slen + 1, 1); if (!(*token)) { ffpmsg("Couldn't allocate memory to hold token string (fits_get_token2)."); *status = MEMORY_ALLOCATION ; return(0); } strncat(*token, *ptr, slen); /* copy token */ (*ptr) += slen; /* skip over the token */ if (isanumber) /* check if token is a number */ { *isanumber = 1; if (strchr(*token, 'D')) { strncpy(tval, *token, 72); tval[72] = '\0'; /* The C language does not support a 'D'; replace with 'E' */ if ((loc = strchr(tval, 'D'))) *loc = 'E'; dval = strtod(tval, &loc); } else { dval = strtod(*token, &loc); } /* check for read error, or junk following the value */ if (*loc != '\0' && *loc != ' ' ) *isanumber = 0; if (errno == ERANGE) *isanumber = 0; } } return(slen); } /*---------------------------------------------------------------------------*/ char *fits_split_names( char *list) /* I - input list of names */ { /* A sequence of calls to fits_split_names will split the input string into name tokens. The string typically contains a list of file or column names. The names must be delimited by a comma and/or spaces. This routine ignores spaces and commas that occur within parentheses, brackets, or curly brackets. It also strips any leading and trailing blanks from the returned name. This routine is similar to the ANSI C 'strtok' function: The first call to fits_split_names has a non-null input string. It finds the first name in the string and terminates it by overwriting the next character of the string with a '\0' and returns a pointer to the name. Each subsequent call, indicated by a NULL value of the input string, returns the next name, searching from just past the end of the previous name. It returns NULL when no further names are found. The following line illustrates how a string would be split into 3 names: myfile[1][bin (x,y)=4], file2.fits file3.fits ^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^ ^^^^^^^^^^ 1st name 2nd name 3rd name NOTE: This routine is not thread-safe. This routine is simply provided as a utility routine for other external software. It is not used by any CFITSIO routine. */ int depth = 0; char *start; static char *ptr; if (list) /* reset ptr if a string is given */ ptr = list; while (*ptr == ' ')ptr++; /* skip leading white space */ if (*ptr == '\0')return(0); /* no remaining file names */ start = ptr; while (*ptr != '\0') { if ((*ptr == '[') || (*ptr == '(') || (*ptr == '{')) depth ++; else if ((*ptr == '}') || (*ptr == ')') || (*ptr == ']')) depth --; else if ((depth == 0) && (*ptr == ',' || *ptr == ' ')) { *ptr = '\0'; /* terminate the filename here */ ptr++; /* save pointer to start of next filename */ break; } ptr++; } return(start); } /*--------------------------------------------------------------------------*/ int urltype2driver(char *urltype, int *driver) /* compare input URL with list of known drivers, returning the matching driver numberL. */ { int ii; /* find matching driver; search most recent drivers first */ for (ii=no_of_drivers - 1; ii >= 0; ii--) { if (0 == strcmp(driverTable[ii].prefix, urltype)) { *driver = ii; return(0); } } return(NO_MATCHING_DRIVER); } /*--------------------------------------------------------------------------*/ int ffclos(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ /* close the FITS file by completing the current HDU, flushing it to disk, then calling the system dependent routine to physically close the FITS file */ { int tstatus = NO_CLOSE_ERROR, zerostatus = 0; if (!fptr) return(*status = NULL_INPUT_PTR); else if ((fptr->Fptr)->validcode != VALIDSTRUC) /* check for magic value */ return(*status = BAD_FILEPTR); /* close and flush the current HDU */ if (*status > 0) ffchdu(fptr, &tstatus); /* turn off the error message from ffchdu */ else ffchdu(fptr, status); ((fptr->Fptr)->open_count)--; /* decrement usage counter */ if ((fptr->Fptr)->open_count == 0) /* if no other files use structure */ { ffflsh(fptr, TRUE, status); /* flush and disassociate IO buffers */ /* call driver function to actually close the file */ if ((*driverTable[(fptr->Fptr)->driver].close)((fptr->Fptr)->filehandle)) { if (*status <= 0) { *status = FILE_NOT_CLOSED; /* report if no previous error */ ffpmsg("failed to close the following file: (ffclos)"); ffpmsg((fptr->Fptr)->filename); } } fits_clear_Fptr( fptr->Fptr, status); /* clear Fptr address */ free((fptr->Fptr)->iobuffer); /* free memory for I/O buffers */ free((fptr->Fptr)->headstart); /* free memory for headstart array */ free((fptr->Fptr)->filename); /* free memory for the filename */ (fptr->Fptr)->filename = 0; (fptr->Fptr)->validcode = 0; /* magic value to indicate invalid fptr */ free(fptr->Fptr); /* free memory for the FITS file structure */ free(fptr); /* free memory for the FITS file structure */ } else { /* to minimize the fallout from any previous error (e.g., trying to open a non-existent extension in a already opened file), always call ffflsh with status = 0. */ /* just flush the buffers, don't disassociate them */ if (*status > 0) ffflsh(fptr, FALSE, &zerostatus); else ffflsh(fptr, FALSE, status); free(fptr); /* free memory for the FITS file structure */ } return(*status); } /*--------------------------------------------------------------------------*/ int ffdelt(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ /* close and DELETE the FITS file. */ { char *basename; int slen, tstatus = NO_CLOSE_ERROR, zerostatus = 0; if (!fptr) return(*status = NULL_INPUT_PTR); else if ((fptr->Fptr)->validcode != VALIDSTRUC) /* check for magic value */ return(*status = BAD_FILEPTR); if (*status > 0) ffchdu(fptr, &tstatus); /* turn off the error message from ffchdu */ else ffchdu(fptr, status); ffflsh(fptr, TRUE, status); /* flush and disassociate IO buffers */ /* call driver function to actually close the file */ if ( (*driverTable[(fptr->Fptr)->driver].close)((fptr->Fptr)->filehandle) ) { if (*status <= 0) { *status = FILE_NOT_CLOSED; /* report error if no previous error */ ffpmsg("failed to close the following file: (ffdelt)"); ffpmsg((fptr->Fptr)->filename); } } /* call driver function to actually delete the file */ if ( (driverTable[(fptr->Fptr)->driver].remove) ) { /* parse the input URL to get the base filename */ slen = strlen((fptr->Fptr)->filename); basename = (char *) malloc(slen +1); if (!basename) return(*status = MEMORY_ALLOCATION); fits_parse_input_url((fptr->Fptr)->filename, NULL, basename, NULL, NULL, NULL, NULL, NULL, &zerostatus); if ((*driverTable[(fptr->Fptr)->driver].remove)(basename)) { ffpmsg("failed to delete the following file: (ffdelt)"); ffpmsg((fptr->Fptr)->filename); if (!(*status)) *status = FILE_NOT_CLOSED; } free(basename); } fits_clear_Fptr( fptr->Fptr, status); /* clear Fptr address */ free((fptr->Fptr)->iobuffer); /* free memory for I/O buffers */ free((fptr->Fptr)->headstart); /* free memory for headstart array */ free((fptr->Fptr)->filename); /* free memory for the filename */ (fptr->Fptr)->filename = 0; (fptr->Fptr)->validcode = 0; /* magic value to indicate invalid fptr */ free(fptr->Fptr); /* free memory for the FITS file structure */ free(fptr); /* free memory for the FITS file structure */ return(*status); } /*--------------------------------------------------------------------------*/ int fftrun( fitsfile *fptr, /* I - FITS file pointer */ LONGLONG filesize, /* I - size to truncate the file */ int *status) /* O - error status */ /* low level routine to truncate a file to a new smaller size. */ { if (driverTable[(fptr->Fptr)->driver].truncate) { ffflsh(fptr, FALSE, status); /* flush all the buffers first */ (fptr->Fptr)->filesize = filesize; (fptr->Fptr)->io_pos = filesize; (fptr->Fptr)->logfilesize = filesize; (fptr->Fptr)->bytepos = filesize; ffbfeof(fptr, status); /* eliminate any buffers beyond current EOF */ return (*status = (*driverTable[(fptr->Fptr)->driver].truncate)((fptr->Fptr)->filehandle, filesize) ); } else return(*status); } /*--------------------------------------------------------------------------*/ int ffflushx( FITSfile *fptr) /* I - FITS file pointer */ /* low level routine to flush internal file buffers to the file. */ { if (driverTable[fptr->driver].flush) return ( (*driverTable[fptr->driver].flush)(fptr->filehandle) ); else return(0); /* no flush function defined for this driver */ } /*--------------------------------------------------------------------------*/ int ffseek( FITSfile *fptr, /* I - FITS file pointer */ LONGLONG position) /* I - byte position to seek to */ /* low level routine to seek to a position in a file. */ { return( (*driverTable[fptr->driver].seek)(fptr->filehandle, position) ); } /*--------------------------------------------------------------------------*/ int ffwrite( FITSfile *fptr, /* I - FITS file pointer */ long nbytes, /* I - number of bytes to write */ void *buffer, /* I - buffer to write */ int *status) /* O - error status */ /* low level routine to write bytes to a file. */ { if ( (*driverTable[fptr->driver].write)(fptr->filehandle, buffer, nbytes) ) { ffpmsg("Error writing data buffer to file:"); ffpmsg(fptr->filename); *status = WRITE_ERROR; } return(*status); } /*--------------------------------------------------------------------------*/ int ffread( FITSfile *fptr, /* I - FITS file pointer */ long nbytes, /* I - number of bytes to read */ void *buffer, /* O - buffer to read into */ int *status) /* O - error status */ /* low level routine to read bytes from a file. */ { int readstatus; readstatus = (*driverTable[fptr->driver].read)(fptr->filehandle, buffer, nbytes); if (readstatus == END_OF_FILE) *status = END_OF_FILE; else if (readstatus > 0) { ffpmsg("Error reading data buffer from file:"); ffpmsg(fptr->filename); *status = READ_ERROR; } return(*status); } /*--------------------------------------------------------------------------*/ int fftplt(fitsfile **fptr, /* O - FITS file pointer */ const char *filename, /* I - name of file to create */ const char *tempname, /* I - name of template file */ int *status) /* IO - error status */ /* Create and initialize a new FITS file based on a template file. Uses C fopen and fgets functions. */ { *fptr = 0; /* initialize null file pointer, */ /* regardless of the value of *status */ if (*status > 0) return(*status); if ( ffinit(fptr, filename, status) ) /* create empty file */ return(*status); ffoptplt(*fptr, tempname, status); /* open and use template */ return(*status); } /*--------------------------------------------------------------------------*/ int ffoptplt(fitsfile *fptr, /* O - FITS file pointer */ const char *tempname, /* I - name of template file */ int *status) /* IO - error status */ /* open template file and use it to create new file */ { fitsfile *tptr; int tstatus = 0, nkeys, nadd, ii; char card[FLEN_CARD]; if (*status > 0) return(*status); if (tempname == NULL || *tempname == '\0') /* no template file? */ return(*status); /* try opening template */ ffopen(&tptr, (char *) tempname, READONLY, &tstatus); if (tstatus) /* not a FITS file, so treat it as an ASCII template */ { ffxmsg(2, card); /* clear the error message */ fits_execute_template(fptr, (char *) tempname, status); ffmahd(fptr, 1, 0, status); /* move back to the primary array */ return(*status); } else /* template is a valid FITS file */ { ffmahd(tptr, 1, NULL, status); /* make sure we are at the beginning */ while (*status <= 0) { ffghsp(tptr, &nkeys, &nadd, status); /* get no. of keywords */ for (ii = 1; ii <= nkeys; ii++) /* copy keywords */ { ffgrec(tptr, ii, card, status); /* must reset the PCOUNT keyword to zero in the new output file */ if (strncmp(card, "PCOUNT ",8) == 0) { /* the PCOUNT keyword? */ if (strncmp(card+25, " 0", 5)) { /* non-zero value? */ strncpy(card, "PCOUNT = 0", 30); } } ffprec(fptr, card, status); } ffmrhd(tptr, 1, 0, status); /* move to next HDU until error */ ffcrhd(fptr, status); /* create empty new HDU in output file */ } if (*status == END_OF_FILE) { *status = 0; /* expected error condition */ } ffclos(tptr, status); /* close the template file */ } ffmahd(fptr, 1, 0, status); /* move to the primary array */ return(*status); } /*--------------------------------------------------------------------------*/ void ffrprt( FILE *stream, int status) /* Print out report of cfitsio error status and messages on the error stack. Uses C FILE stream. */ { char status_str[FLEN_STATUS], errmsg[FLEN_ERRMSG]; if (status) { fits_get_errstatus(status, status_str); /* get the error description */ fprintf(stream, "\nFITSIO status = %d: %s\n", status, status_str); while ( fits_read_errmsg(errmsg) ) /* get error stack messages */ fprintf(stream, "%s\n", errmsg); } return; } /*--------------------------------------------------------------------------*/ int pixel_filter_helper( fitsfile **fptr, /* IO - pointer to input image; on output it */ /* points to the new image */ char *outfile, /* I - name for output file */ char *expr, /* I - Image filter expression */ int *status) { PixelFilter filter = { 0 }; char * DEFAULT_TAG = "X"; int ii, hdunum; int singleHDU = 0; filter.count = 1; filter.ifptr = fptr; filter.tag = &DEFAULT_TAG; /* create new empty file for result */ if (ffinit(&filter.ofptr, outfile, status) > 0) { ffpmsg("failed to create output file for pixel filter:"); ffpmsg(outfile); return(*status); } fits_get_hdu_num(*fptr, &hdunum); /* current HDU number in input file */ expr += 3; /* skip 'pix' */ switch (expr[0]) { case 'b': case 'B': filter.bitpix = BYTE_IMG; break; case 'i': case 'I': filter.bitpix = SHORT_IMG; break; case 'j': case 'J': filter.bitpix = LONG_IMG; break; case 'r': case 'R': filter.bitpix = FLOAT_IMG; break; case 'd': case 'D': filter.bitpix = DOUBLE_IMG; break; } if (filter.bitpix) /* skip bitpix indicator */ ++expr; if (*expr == '1') { ++expr; singleHDU = 1; } if (((*fptr)->Fptr)->only_one) singleHDU = 1; if (*expr != ' ') { ffpmsg("pixel filtering expression not space separated:"); ffpmsg(expr); } while (*expr == ' ') ++expr; /* copy all preceding extensions to the output file */ for (ii = 1; !singleHDU && ii < hdunum; ii++) { fits_movabs_hdu(*fptr, ii, NULL, status); if (fits_copy_hdu(*fptr, filter.ofptr, 0, status) > 0) { ffclos(filter.ofptr, status); return(*status); } } /* move back to the original HDU position */ fits_movabs_hdu(*fptr, hdunum, NULL, status); filter.expression = expr; if (fits_pixel_filter(&filter, status)) { ffpmsg("failed to execute image filter:"); ffpmsg(expr); ffclos(filter.ofptr, status); return(*status); } /* copy any remaining HDUs to the output file */ for (ii = hdunum + 1; !singleHDU; ii++) { if (fits_movabs_hdu(*fptr, ii, NULL, status) > 0) break; fits_copy_hdu(*fptr, filter.ofptr, 0, status); } if (*status == END_OF_FILE) *status = 0; /* got the expected EOF error; reset = 0 */ else if (*status > 0) { ffclos(filter.ofptr, status); return(*status); } /* close the original file and return ptr to the new image */ ffclos(*fptr, status); *fptr = filter.ofptr; /* reset the pointer to the new table */ /* move back to the image subsection */ if (ii - 1 != hdunum) fits_movabs_hdu(*fptr, hdunum, NULL, status); return(*status); } /*-------------------------------------------------------------------*/ int ffihtps(void) { /* Wrapper function for global initialization of curl library. This is NOT THREAD-SAFE */ int status=0; #ifdef CFITSIO_HAVE_CURL if (curl_global_init(CURL_GLOBAL_ALL)) /* Do we want to define a new CFITSIO error code for this? */ status = -1; #endif return status; } /*-------------------------------------------------------------------*/ int ffchtps(void) { /* Wrapper function for global cleanup of curl library. This is NOT THREAD-SAFE */ #ifdef CFITSIO_HAVE_CURL curl_global_cleanup(); #endif return 0; } /*-------------------------------------------------------------------*/ void ffvhtps(int flag) { /* Turn libcurl's verbose output on (1) or off (0). This is NOT THREAD-SAFE */ #ifdef HAVE_NET_SERVICES https_set_verbose(flag); #endif } /*-------------------------------------------------------------------*/ void ffshdwn(int flag) { /* Display download status bar (to stderr), where applicable. This is NOT THREAD-SAFE */ #ifdef HAVE_NET_SERVICES fits_dwnld_prog_bar(flag); #endif } /*-------------------------------------------------------------------*/ int ffgtmo(void) { int timeout=0; #ifdef HAVE_NET_SERVICES timeout = fits_net_timeout(-1); #endif return timeout; } /*-------------------------------------------------------------------*/ int ffstmo(int sec, int *status) { if (*status > 0) return (*status); #ifdef HAVE_NET_SERVICES if (sec <= 0) { *status = BAD_NETTIMEOUT; ffpmsg("Bad value for net timeout setting (fits_set_timeout)."); return(*status); } fits_net_timeout(sec); #endif return(*status); } cfitsio-3.47/cfitsio_mac.sit.hqx0000644000225700000360000005550613464573431016222 0ustar cagordonlhea(This file must be converted with BinHex 4.0) :$f0QDA4cD@pIE@&M,R0TG!"6594%8dP8)3#3"%11!*!%4HY6593K!!%!!%11FNa KG3*6!*!$&ZlZ)#!,BfCTG(0TEepYB@-!N"AR#BB"&J!9!U)"eJ#3!`-!N!q'!!! $([q3"!2JYCR`K,@Cp[N!N!8"mK%!N!C$#2r`rrJ!!-0!!!"0Y`!0$N0'DA4cD@p 38%-ZE@0`!*!4Da3*KJ#3$aB!!$i$!*!$&[q3"%e08(*$9dP&!3#[H%fHYCRfmJ# 3"3(U0!#3"Md0!!"9XJ#3"[8H"[LUJEpCRC+&h2,Qp5XR2!PhHq4S2H%,ApKQqmJ LNkpp8AlddNfr[1A)MP#1Tai![I"-haEmadlZiRN5eLh2&pPQYb@hMpc#pMQahU[ MjF@A)`YEb',mbF)EN!#&l)[`r)9RmFZHm#-lbAEK#qr)l6MKLpjbR($&#Ur-Vr0 fK0r#Ma`RA-)l22Q&,13AFTY-&L1cK5jN"9K($6SEG(C1mZ4R0R4JEhDp%a[NjC! $GhCHIV6,b@DM((4ffHR#LbqH!ph[phRj4[C&&ShX)r[YiRdmbHkebmMq[(KN$cV cFa#2l)[X86b,,-plB#b!Vl2VCAikk,fqbH,(bq[*l53meJ,!&[`"jhIkI5f1'd% 3,!Q#dUUJp-!lJY+$p5"BH5ma(bKeP6LDVcDZZdeKNN4a8UiQm9CAbqCLA5QIqP[ XPi0Jl8H#i"hHrpUqXi,J3lqkj2T6Yh"H2r[XNdTd(rB03A$L`5"Bk[dc2RMIZPh "b@rE'34[ackdki2h"FF(`H@c#NqI)P4GS[!F,Pp*9ei&5TqF6!e5'Z+9D"fM`h3 SKb"@J#a`!MD',FIf`[E'9Q$lB2YLqf(lBdr#RS`GJ$d&1a!l&(XDGKKf1,B5HcV f$1`)l*RBNGLcX'GMcm'HKld!Hb&f0$D-(B3GV&F8@iSYXeH9XJm!'S'I``l"RSX p(cX+1aCEK4f((@pf`QYP)SqYmP[j5"8[%qfa(pAKIHX%hY3A6jljZ2T8+l$Y9P+ 9ZSABJ5Ud2KH'fm*+)da6PhC[$C1M&eJq8#d2EIU0kPcTFK1[N!#9EL'@!Z3P+,c -9icR6L[c8`j9I`iR[I25%D#SDkA4H$YaNp&-Gc1XG32c$IHfjC@#kiCLM)K%k9U d0C!!+Y"B$PJ09iKRp+T'ImNm&#%J!p"afpL5RV[@,,R`mrF[ZH#ElqrD[qq5V[h AhHR6KErIYIm6PcaA6"*I""A*,da(Ij9Gqfr-+elX!'`CYKcE#pX2#j!!mKDmMrF f[!P[`aGVCh(5hqLkFX8[lETZ[FY'fki@68BZ'4rrPF(qU1%Ur52RpBmU,(M&e-r [ZMjp9qrk4M`40Y,amE22fMMRMCjalUk29a)ACUirLCZM'DkYiq-#6)e-2)$BNji $[H19,-l5)CG-ZI*`jkGdGbVIp'Te-(q&F1rJqXfekDJZ"VeXY&TjXIkPJR"+B'p X,f`j0LE!&GXAfcq[XZ"cN!$HrL9`cYkY)A1@E%VP'l5+hlRcbk0[mTDf2KX`YaX e[DrL-$5@ED`1G2ZkcR%$Fa@`J+rA8&Ll`)9ePk4(B5"I%%P5e4$j5bD8ZL99"C' %"%)')C`36FJTK2"&@%JPj,)HqlYBb1JU,136iJN"K@"#6L'VI1!b4*@kJP$@BGG L4Gh4a",#Z4rl8L`BHMX@BVS-#r0EJEd4Za,lHpJef*Z`P0R0f&Z`eGL*@0jl&aD -K&[`XMABGGK*f-RBLl$)*TGJT`JBa8l$6XI1`0CLRiqGLGf"[3%,JGq$I3N@rVF HHkYa$AMM[GJAB+r&3Z`KlK"pb2NXib@3!(k)1%)!K2[P15X)"&GM)IQ)!4"pq!T #!&`#-@!$&R5![%2Qlm4HJpf%I4lfaGM0@05cV9J)r6EXE1`Fl+ABZGKjf-Z`ml% ,X*GM&f,"JLZ`,m3ZaYiPU$4)UGRfhGJP@0',!Vq$[4Ul&,YDF#,f+Zc[B+r%hS0 YCr+j6bUTE-2`KTkK[Zkqc5UCjSmUeDA%`6[rejF4)l,TiR`brVA3*Hm,%a+b-,* 3m2Vmm)Grm!5eR`CPMk%khMkK4`-Vr9'@4R'j@Uf8aebD5H$HN!#%3R@q1)AA(!- ,*PeY!S[6i&1kHG`*(+DSEhGqHe)rN3YqQb2j1!RK3Fcr%)dV5eHAPR@*'(UI%,* )f"hrVb$680&UjfB4V1HqC*df[aL&i!5iCF2hhkV$Xr!4rp,Nc`R6Uq!!q&D2TeQ B,2,38L0LY!''CqYC[k2Ei6&eaif6jJX[#J$6`Cm+2mfIND*raNQlmN!cYD6qDhR iehPEAiE`T##&'[YlPQU9DGfVFiN+aG3d"p9Cr"U,Il(jejT5GAfZ@k+UQ[MRfAQ c2FC,l,`Pec"4*3dBEV-mfqdq1r+cj1VIXf&dS&`T9q*@'MGFZEpRl,pCY8HMYE" hS,I"43%j5H+E+PXTX"5C[L@5"*hjT*ck(p+-T'pPA6eAME"lC``ZA"'DN9&,k4l 3V35k$q"r4B!'5-[V2ffqh+G,[2'9A[C+-mQ4Hce6diRfMY3c"p(TcH-lB&51Ndq [$2IfR9iq[EGRV)IMSS(+Q"TA(#UI-kB[e`fL%R@hP1SR6VjaNXdRhjpH,Bp,dX- 85VFXPH*+Ve+iDrm(e&0&Ve"NH8pG[9G[aNDV88Xp2hqKFUUVaZSTqNGXbG"!4Xq 8bTZ'GimiHUU8),CXb,ASJe,U*bV2S1[LSrHS&biT)+AqS0jakVLrZJPI4G4Sb2F KI(e'Ym6dEDP[iqYl396Ar5"4rBELEIL#kKRV6eqQj!ZUEqNNA2)f3I8iREc$9HK &#UVhD8!MdYX%2iA[&-[h-AbRCT8ahLri(A`$XmE&p*Q&T$F-LPS9hLDN(V6"PDa ",eG)Z[q3!%E()H'(e&meY,&XP$Z&e&pfQ[Lcq2i3hl$H*#3qp(Pm`mH5N!#qYG" Am9@Z)&"m2m3RI@k)kQ(eJCh4UMYU+kbqY4'4VK%i6Ve5CrSqeV#8FGk"12VGk!r $pa!(5f(#AqC!2adqDY(fiN@NcG"I4`Pc2VpVrar!jb2U@EXJ1+&1r868mdCr(MR S4k1h$YmIF"MYm5$bjrM'H$b)2)"[V-H$b02iUM`H409R0XlM395pGH-p(N69qcA "id&8Me[Ym5#UrVf*(JqLYq#VmAJ3r5+q54i2SUV,b4i2BY+4,[*i%"0ZAHca)#E "i"+2"c(edNhap4h6@dleH"$6@dlcH"#l(Crdl9&rXDrMQf(jrN8BD2#J4$ed-cd HP+JAF*E(Ja,9j@b2"bAUmC[MmD"%IAQAHM`S89h1pAK3mL9mmc`HP$b+lc+2"k8 5$HCl2#K92b5pGG,69kSq3hVXj+e,e50*Vaep[26@JFY5ck9-Cp#pGb+2P0l"'5b @[X(5KcR6FbFpJDA2F1DY"&r+K$(df8Q2AjNN#RV[D)AQE[4,#T%S8lI3e4Hj5kR 4-Y@Pp!U'`BNbeHAbJ@DEZLN6hUqSELU$ifArJ1rDLi,cHEpb[HA+4PY[@*lhGPD [8FYJZIM%kNEj21URA2fAer@A"lKRZCT**#re9hiG[M8HrmVr'YpDMhrPUX[Vam+ %ZLNAaXM!MNTk+hZT6h$pU-Y)dNYeZD'-8hc8aNBh'X*EHUQ2%8iL$6Qpe)F)&i" Z[)8$[!2I"cR3qiM[#3kf@kUh-'EEijG)[ZNYE"A9X6Fb@1qmVr06Tk9I`3FhZQ& UEINqI25GlR`m&i&k#f0f5C38hr[`lHETjEkpralI(QT,F+Zh4QcFL'STp95KZVa THQd2H&#KZYbl*48Z93J,ETDL+6lHlKDAPDRV#YAPmrhp+X4ME[AhUp#dNaHdfa( [A[(2q&iS495S%lfKYjhILAMR2Z*aq`+5L`pFS2F5HJ@hi!haJ@(dkq*l0`GkGI( "AH"Sq,l,!Ei$(D-h&@k)MjjFqPcaJ5P`,RcdfG)ELZr9(+K(I1!@ICriU(AH&Kr FL$jKB)aq9[J12VJ42Dri`$,H#Kq#*Afdq(kI!p0,m,fI`rhQq`+(9jM[D3k[p,l qkUGpPIRJ%16(4mm`Ei@2IPfCQ+*pVqG!MH0$#RfYq6l2!4c$pkmFb!-9T5rh!I2 "Ym"Y69(PS&[6a8H0[G&m$h*iNrR!@VJN[Up`J"FE1!m%0jZ2AQ[i1$kDcmL2Mcj TX!iIp3b'ib2[@mhh%3j[-aqm"$b"*S0rEcFII2%GjU-Iq*hQJr[#FI"4jqmb(hF $0r"pQ!1F%4riqV$hR5)qqKlc`6RIDcl`'mc%4rr`RjL2HRl%I0bCZXEhF3l`1(` #[`(K#45(RZX2Q)qHG$J&2[UBVAapUM$ecmd(VX%&m&&,F(Cme"rk!ckd"pj6[S' 5T)R&"pHKM["4hr"@I1!([!mI[%dQlfJIZ)$QJ)qhi`haJAr`GhcJabHmEj!!qVi rD6l`$jc("liqEMjkh)@(D"pi*ra%qkM$6jX2[Jk'ii0,`8IN'b`"L9Kmp,6rMIR SdIjEmr&qi"Xqm)Lh`NHGJ+[ii)*Ip,iK`Sm[Q3m0!Nk+$rjNCh)-%Ik"DILS[kq D$hcL,[LS5HS1hcFiJ#(b$C@fK#D!$r`!Zr$4RdiHI25pIp0mF",d%(aJ)PL"MjV mP[QHj2"YlcY0'XChc%G0`hI``5HrCcii#6`,(aJRlGRDalYc&rQ'5926ij6%"ip mbRa`EMJ12ZB4r,2ji#(8*Mk`$#d#(l8"*XJhA'm2VmG(EF&Pm-(RIQ3qCK[)j#E YJdZBKS2!,i06RZ3hR$VaY-&+HR)BCD0pdVR!U!cY%rk[V(HP%TkZE,j&*4LJV21 m%La6[PFR8+BfY1iRhqQ3!"5PZ32iC,k#XZ&"Ti-V5[L-6rLRm[e$J90d*p-E&$K &8kUBJB#21m%aj6Z$'+8q&(`bld'*fq)6,UM8RB42hPjTlJ3qiA)U*d[L%kaAiT, i"&18Y"hj4R"rTEN(q%6c8MD$B!6m@`N(m%R6K4)1ia0m9H+-q)5V+"0J4i#$5V- Em%QY+XePN!$[61+91#!qi@G+I!fID"h+jPbF#6iTm3Km`Tq8G#eme"ED*Ml"%@A khdMH9jRq0e,eD[@rNHKH-J(0q!5cPI!"Rf#U-[e[*&a#L42K%ka4QVdKheR5)Uh qGaEDJM,plbcTY,U[4Ac#GC8d"(c#Se6HkL)q`@@Pq4[bRDekdYd[iT2l+'N#q%5 I8MB)kQc9+0SJ2Z($5[-hm)&2k$Ri")Z9jQl)G`ieVc4r!jr-he$5ar#*0UE`Dap B`P`1I033A!DIm#*Pc86RJ*8UEp!@D96U5QPZ"ci4UT4`(KmD0CS92Z(j5T`&Rr! pC6hIjm)IP'CNb(FH'+5N1H160e,Lb2L%IfZY'jr`HbAZL8riZC)`KSpDK,2J%`k JT2R)GciiSU6riC2l+r%&I05LkB31R)NHSD6ri411UU6ri42HSU6rbAH"-"KHJ%p U3%Nc`3IfS2rK%ae(L8[L%be!5DI&*aa5D9B)2[#-H4hbA3Jf+Fe9`3G1S,AL%`e 'LI2L%ae%5EI%*aa4L8[L!hIYh+C4F!1PH5li`(+d3Aab0bAY!Kpe3lm"2Y%[P$J M2Z'd5[UEI+-e$3JY!TpJNl*T1+1&$I!eI+*Y+G2r4ZXH9[mE$3G@T[q0d6fXrMG '2!$p%"mD-9S%2UN6C3eBBlL2N[D,$fjN1pI(L"m`4`DID!R+QN2'S%FScB("ar[ "fI%*MeALJ2L%[bPV[KX,$e(LFIJ%aj8d0(b#IFSDmmH#"8VD&$jk)Y#kmFPE+-e N`5HkQa*ra`GqfbEqX@J$b[5rX@J0b[5rXA"eCIVI@''`eIr'`L&eMiCm9A!YCIT I&Ca%QIjA*IbcqPq9"K0BrDq+qP5Qre@T&Uhq9i@ZSdcrUd,E8UEr9D'c+02rUX4 6VIih6K1BV2ih$JkM62mETlYDr@mFpDa-raY(,QAkhcLpYpAraSN6@2e[($aFQIi h(XkQ62mE,jjKpEra`L5VrifRaT6TIq24pC6TIq24UT6TIq24!*6TIq09deErQb# 1CI@r#F*1Urp08(eBr@q#kX2UIa1)9kEr64"rYIVI"(36CITIYDCH@[f['JkT62q VKQmSdrqUK3G@rkY@69MpVaTG6jRq9bd-X2TIY6LheImQ`Vf9kAm6iA[+p,q*F!p PqYp%m@1Vrde869[pEb*kRc,pEk,iK0Ar*UVQV2jA)kjMpEmDiBI9rfVJ)FVd[aV a4D[reBMh@2f[4M9YpEmD0#aPqPm01SXbr@q5F06UIj2%JDcq0dPFfHTrNm"LCIV I*1'heImQkAj@rjXNc,$khb6d(@Akhf6a2k[r6BDl+Y2r*N[RX2VIC$#DbCY1Q3r PUGI)m,#a8r0&eSpX0(SE@2U'3ph*@k+**%a%KDVl"`Elb$c1cZ2Y2-(1ARb0R6I Cq@)lAf,R+ADHDZGTGTjZjaPfVVAc6$[2X[0X1mqamk9fRQ[RHADqc-lclEc!cTI EHD'G&pQjbXjAf(Q*RCIDq8SlAfARCADqfXlAf(QjR9IBq9SlVl6c+MZ[Y[0eGUk cmaSlVlAcHMY[X20'R4QRD2eEl,c9cY[X[(fKRS1[ca[ejqI&[%PGB)%ZZdBr1rG I5+G1BX"G+P[)XT6EZCHGbaDbPLe9`a@6MlL#66"J)8(jm[PHGbm&F`R9mMIP+G6 199HAPTr8cMVT@ppq8Y6+bT16mQpH03NBV@I5Bq8CNqdX16B3XA9FTSpccS'T%Dd 6a6TlfeeId-ZiA,F#p%CIKPll'2SfFYB3,HI`iJ#3!-`NXe%!81m40qN5ekU4Bcd c8mf`B!e[$H-fRA!IC'YVU"C)YdX4Y03&l6V*83$Z@a"ea3aSG0B-SN-(%cXH1`& EMDh"EX*HM,d%1`A,hJ(6X01a-l#ef*PBV@1*RB1p&$XA1`pl'ABqGJ(fFZa#l#* X&IB+l",X8Zb9f+Z`bl"ABkr",XHZ`&k,ABPGK9f0[3jEKef$ABYGMpf!hBMG)U! AZ`flAB43E"!E`SDa6F``*bPZAcaQVT!!#f(B[NrMM8l@TEAGAJP@lE`m1'lANU" mmEU6ejkQMR$h,Iph+Fb86idDE*i)l`JB3"QDfphM1@``eKN`"GY&mECQP3(DCC& 5D)qPlCDf@YTMDBZP(CD''0TZDBHPcC!!pN,D#QQ*T4@@&PKDAfPjTG@9&PGD@fP TTC@9'U$eN!#@3eS0D6'N$C2f5pSZDEHNMC-f6GSYDE1N[C)f6pSiDDpNE!MM3KJ 63SXPVC@d90*+53XPVC1d60)U5BXNVC'dJc*+K"%LM!jKC!JYXE6#dJ*,kbXYYE6 -d[T+bbZYVV6FdP*,UbXYN!#d2Y,b5,XVEDkdYp,@5MXVEDbdVp+f5VXUEDUdjY) @56XNEC!!M$pTfN(&@aQ#m3@-,@"F!@-6')[!Z!*[0aA'%M#1J$%%6EZQ-&l!@qH "-3+-9fKDhB(fFpV1D6HRcCcfGGV6D61R[CbfFYVED9rheQI`eQ9)VXS!2D)Yh&[ c)ENq"'h`Y(V6iZfY'q'Y%m+S$'3e2BP8V,GALaf*%Grki0Lq,ibZB'3&SbVS&'0 -"H-T["eJ[,8N''-!@$-@JE%(b48I'*X!BKpDpB%a!i`AS(Z-F3+-%8#@C)3!S`- B'F#S!-E)b2JBhHl2k"K'aL!m-'U'N6'-LQ&8#Qh"Y-VbCV6MmfkdS20fM)TK4)b -2p(M0'3X$+-dp!J0aX)`GS*DCK3-)f!BrF,)&aReSXF2b,JE4Q``@S14'S`BB*` 'Bc4S#kFGR$C`fVpTqkEPR*CbfVjTpkE0QjCd@XYT+DIeR(C[fVaTlkDYQhCZfVK ThkCYQhCY@YTT@DGGQcCYfV0TbkBGQcCXfU0TLkBGQMCSfTpT[DDeQ[CRfTjTGkB eQaCV@UYT`DEYQACRfTaTEkDYQACQfTKTAkCYQGCZ@VGT@kCGQ6CPfT0T5kBGQI% XM'9K(!)M@4M&`SJA4VJ`LS84,)aHB33-ia-BmD&l4aM43#XiidBBad(E-f-!"(F CYm*S$dCk-'k&-5Z-@'$%#U09'+R#+"9'U$#HJ6%bM2aJe!FM2KM"`(J2aRS`KS2 a'icGB0`')cdBfF'i$FCX-&k$N4q-lQ#X"b-f'+h"5!e'D6"#Jp%CM-aJ9!BM-KL 0`8J-4Q%`!S24&ibmB03&Bd)BFm&i#mCD--j#Ml&Jc)q-pp%M*aMY`dJI4J8a#SL 42ScbBB32Sd!BT`'2BI3'A)C4([!B4[N``SIa'A!D'G[$'"BpIS@a2B`'J'm`USI a#Y!#16#+4ir!B2b#m"l'XM#1K6%AM',4)eJB9F#S%PVA'Bh*q!hDj)@6-)U#F4' -L@!m"+-X'%R"+!T'9M!QJ[%3M)@JCB!a%)arB1`$iaiBmm!S$%CG-1D"m3k-G@# F!f-F[2%0MS)2rM2k16(CU!5M$ZalURYfpJNEUH*SqmBHf[c'ai8a"rBp!lkHEL0 b('hI1*(94Pbiim#q*lma1hZhM8&cXRdZXadr4,pU@[Y"cm$pfHF%DFjdKFb`pkU MH5Upr4`8A5*Lk$Uid6E,1l"-95+9lNcSbD1l&hVbk!k(RMad39aEj+&,BQq4Kmk *L88H1JPULMad)H`UmS#TZiXmG#rX+I,3q6#Tb%2Aa13L$jd9&a9jk,kiZ-K$KmB P44kk0kB8HHM`Q&VNS3YN@T%(pA9kNBFZNKP&(MT0DSXmG+2-,2,3XA*VNBHZPPP &(P6&'iSmG-IX,2,33I1#)JmG0V1,2(6Kc#Rbd+PcDC'(ETkj44kkIHB9HHJ)ZUc )3pI3r#)2R88,LMadF&eHj+(lDf'4Kik3!%9&(VU1VLMbd('fZ-K$pp4Y44kkS*B 8HHKkfeINSIYNDC'(lT8VLcaddYeHj+(ElUSL$aej0aGjk0DlXmK$4ppG44kkrZi ZmY!CH-qL!Zpp1)m$k(2,,8VMVYR"bUf`E&rk5br5U1BQAcTK2PdCMSIkG-p8)c- bjAMD2(-r@##5KrlrB88HCJ--,r)`,f$S5hRL%'TA(kdXmM"[B0P,#N3b$l-)4QR 2S)C)rGPamcS2X`Xb(45qdkcjSdUeC*C2I2eV58KIXPRcCmI5+Mh3CXfIG41G+4C b[90jDUXa2G"QcCrYH@Z,@I1RVUd9AS,IiES$rAh-QMm,`MCeDYEmf65c$(ABV2Q M5P&UpaiDCXY4qmfD2lZA9EAbMelcCdCBQfDjd-H8Cee@4CN+D6C"T4YC6aG"Q+H 1VrNcJRZIiHm6*PE2Zj!![[Z`9$lQBB$'c"SC5CjbZcGpj9,cBFhaJ)",$hjBXaA S,qpI+KhhY1@4qSbSpTLE)HH)HX6T-jHHqmJ'lR1"ca04Qa4c0)3$4$5MK(NDV!M %h)l4j)RCIHbD$a(09V"V2N4jUm!j0,a('5GjTZ8KMQi%ZqC$9!SMA5Tb[qK[Fjp URbHUf5,-jC!![[@SjT6B04qLQJNa5H9[lc0jZU3kL!QrQ0NKq@*kViZe"T(N'6C rlfEFNf92jAh#c,[XUcc"rGH[mrH4&GGNKGLeE[N'YhepVpX@eIapYZIe,HjebeN Kad5Z@miU30C9ASNEF9)UYHV+)b[Ul$dRMbJID'ec#@X,LDpda)80bl-Z8jkkLBC EXE&GCmhA4G'-d'9"11d'aK4AbXT%UK6QH(Cp[4)hfkrMjV@0b,@bJGi961rDcCS lXeTCFZQ+8LPeqEh&bIX3*50jBqrUl8X5(N&#PV'5d2C5+9QQ2(YQF1[Vl-iI41T K%I8!CkJ-6JM[,j@@hZTakR+Rp`rZrkMLi5M%rq@K(LQTXbYmrEbalHXRF+IU4ee @ZTcYa9E6ec4HGj-mebQ2HNrT[F69-4,[qHCESac1JPY&JL9[U'JJYpPhNLR"68K !2ekU*mqK32Y5YrCiYEF%U01"(lX%aMBjLp4R*pNh`(30PeNVqUmqGdeMJ92P@c! kd,GbS*@jT-95Al0QfNK(khkiq@VR0pIjY+2FM'e&iecl[[c1GCd,"mD#ffkfMC) 8qiia14*5-KdCH0SC+frl@([P,BpFP8rm(FSSViUK[JdE%D*Z'4dE1CAckk[9@0, C"dHLZPUX2a%kl@SAH)KiE[AerSCfPJXm-6DN84Q"JpSQ9'jBK[Dj#ch[&,@&LAp 8lm!Bm@TYlq#`KV60MQSCpe)M[8QX)@+VMP[B86XFjF-0p8j!iDhj!%1plia#STD MhRp+aTd0+G[H4M,q6-4ZZbr22Se8X$[8l-[($EJS0[6dR@N*mTQ&,ZeH9@khca( )&Fh1,rU-*iM1(j,2lY6PJ2X!"6TZG2q(E"AUT-1&a'E9UmHM9T4&B52Dm6pXmMR GI[8iC(KVe++jcK&4)rqjDh-kU20,l1cUU&J&S'Y,NL-pCA4+Z`+kd`k[e@4fDY9 ITCT'6b33P,D5rpVVblAb49JC)0Qc[@[,$lZfDCD3!,"d,lF$i6[3TY'FiaGhFXj -3XQ0Gfhph#C5KrYfp4Uhh"3qedCcjh-AFYaqhLL9%`q%m4Q2IYS@bTEa'BrqK4E I&CmGRr(S*br4q)bcY1f$Zf4m4T!!@BP#V3bj!PPGCT!!Gq6EQ'AYYDYAEf9)bDL ddqUZaFh9l55ZGfTCZRTVIAVefGeRVkl(YA4ef)jX-A$(b'IQ*0#r`jb%dNAZjL3 X'"eF'fahbA4D(Xh#9Me-kVBjlFf+VD`Q$[cF`Gl!ejF[F'(G*BZ83BQ2#c'2#h@ eiG(bD+IGC[bdbidpq,J3@V4ZVNU*HP30AC!!YQJKMpZQIk*PZd!rIc#!hJ0EG*2 Y8dQSV9aF+Cp66Q28RiZLlr8DKK8Xakl!ASYGL9f&ABfp$PZ(AB0GLef2hB$GL0f #hBVGKQ8VRZkEHTY!R)JJp2SpXXefX*0H[dFZCqX5[pI[NI6HP6Gmqm'hD'GDPhU [RkYQ9T[$p3X1Imhf(T*pJ4CqDpeKIK!F[PGl8l[-2KI[,#Dhh+5q30IVmj9XcI3 $@9+,N!$C!i0p$0,SBqHqkdFfDP012R856DqTE#(,8QlRAREZ[C!!Y@bTfJ2T$Z3 +*'!e06p"qI,4YQ2B!QQm&(+(@&qL8E$KhlIcAIlX[F@*"-,iGaGYLdh6jh`Crfl feVCEDbrS0,)Sk)m54KiXF9009J!-V2AA&'@NFU#Tm8'bfrCP`9"edf(hM,$4L1- @-k@fY)1K6HA+kXUCCrT%bmV9-+f&MGblf1d)URhpKe1R(S#eZH81@q*0FG+SGpH J,22,P@lb92D(Umk0aYI8hpV08qLiaCe@&M8G`5DN,Y[#1CjVp1&FmK`YYf$1L9l AMaa,"SBhEPB@(CYk&aN%%9Kl0++T,NJ5Ih[VY'q29qcdY"PXVJchca@!MN[8Jdj UAiX,aPm[lY@#`2U`jKCH2&N-bDcQ2Ef)KZH63Y22P`UDh6-@V"ebbC3V$a2EN!" 4JJpNE,f'9aT0"4N[1hZa908hKc5PS6UD3jV5m)V0)C12EQMSqldCDC*NpNZ62l) M39)TIE%[QG!2@p1CR+3$9k"Yl54Mf$E&mQadYHQddm5eVKjPYEKKRShe$KiZXPB UcYTJbPQdFDbCmi#9aT0)XfR1ml`jcqBj6q)@2)Eal*P2ZFGbERDAiYJDeleM4mF H`$Ki!12K!Bb("c!HEQ-mA-CiH!$M5Gb#"c!HRYYk%XRe8iM,[!"iZUf6Cpqe2@c $AGILZUQ@GV*)3EZT-JRDJ+ZTiRHT$,R,MYT032r5@U--6QT)mV*Hf!ae(BENlA5 T(LBp#kQfNfCaXhb4Zh4lR066S+G@)j-JrHiYD6!@JTk3!+IG@G5D5Z&5d#Tj*Zf GdBNDGE5mh8QB"VhD%(5$5mSqCm$c"KD`P*ab6HeH&LBYIj'P9Dkic6@#JC(bF"Z XPh9hGJE',q*CV6qHPRHVMHYZ[@[P[TP4UN@rYV,iT54,2#SZ)5,Q[$2HbXUAPV$ B@`Yc5pab3a*hfX+(RHd`59dLZ,SaE)a2(R*S!-0"a@k-+"KG90ZR*l$LZMlCPJM qV'ZV%rEK%Dh6HREj))Y'*0f8K*1UD(&Yi8SEQ9qB`!J5l(468BbN%E$F!JUl1S+ SJeLmYPCl'EhhcXc-KrVS[56Z*$9A(NXF,3,a!VEF5aI2R%Bm33%Q+R46F`&-GM5 L@'jahG!*bAU,5Q!RLhhDU'@p[B1$clrAaM"apHITLeP@T#',af*p)XK9#+'9Ifl ,!MAF5E+YFEB`rm660dl+P3VcbCUSJ59,KYkYPRh@1`ehlEr`9XkX64S*MKr@-Y1 X@LS,C1L2*F'paJ9@5#eTD#eUXk5dV-L[2`4X6`9Kr9E@M1@l&mZJ8li(X$*QS%6 $%Gk,VE#iMf,l((`NU(2q'VE[a&Dj!XpLq`9[r$Xp)rGRK9KmJr,he-0EP0C326R 1%bVT)U`25`i@+QIe9h`XhbdM$A3q9RJG'2bH4LbShm)hU*dV,@SA"ePK9IYHcQ' )q@4PRm#E'r"bmE(dh'RXc5ip)HTfI-0q0MLCqP*I`$GF1l'+lh-F+VQS[*&kc0H DZYV@Lch$"#-'3Bm)lRJ,F8(G8eCFr3&E!J@erLUV`C+$qM[,Vd`De*,KCr[pMi* kVA1#%fqLI64i&Ejc[4i8[)EcHGVi6AbmdrPqilIJjr"GB(Ik,!G@A-A(ficLIP* 6`Ar$0pSM48Je1FDV6b&KJeh*0D5&jKP2MBmPbPNi(jrFd9[*0E5$`i5HUXC5K+l %9leqFideB%-I%,B)S5I(UcR8j*X3"CCSa-3NeB[ihXlC6UB+#4XZ#Zii$8`+I4E IaG5(e&Y)Up8bAS)FRq%`KIH6@JSpM'qUAi3PT(I9qTMiRZ6!Zq%$5eL&&VJ$5r4 VL!p-B@PkI&,EHM&kI+a$5`hL3beP$9amV"2,%[2iZ!q,bZ160pI,b10MZA8@MXF (AK+,$qaKFAKm9"M,`H0l)3I`#KmeEAZ-`X*1&RR(pcS1LmhhS'%b[SFiX*`l2M# *"GcaIB3$li!2!'@4GRaIi-#bl2LqaB&Da[F$$Lbp$J@J2X!FI'!Sq)N2hX##k[M !!TC3adFGk0%KiZ-GHA0ma,!`1Mj'V0Q&Db,##4BrahFA"`hfiJ-EE$Y,4'r-dZI ihX@"2LamImV"$Lk*h-2"-*(!mF)!kJZI`%)!h0'qTcR!Ck!c[+XGp4CP[9h0Ar# "`CBb4B9jGP1qU0E,K52J!hGXNdj8p8mM'6lUdfUe8G@2V!QXIEb['Bm51%&[FC2 jL,'E@dA&NfifhpdFU!YmVq"JPGbS10UYjRXV"pEfaFGUZq!'2M$b0[0pR)-G2K- 94YT9L+1UHcJ1[LFi[-Kmm"+`@VkBq-mGjQ0GAeB3aXGk[#mf(eJ'4Z'MYPRY&aq e4#hMidej6hcFl4lc`32fQimhVMFIY8iX2YB2&PkNIAr&!5k'MbfU`%0m2q4`RrF j,MkNqG%LL(i%[P%(pMh926[lK(%(4pXh&M'Q#4I'(0Mh$$cXG1-@MVC[($*'%bl FF@$INpqBREhli+*ZZ2#bI*ZR"Pai+AcKEE1cepkjL"XU1'G(HTYQ'HI+jjiEkHf H(c9C0fRp@$*UXSl4cmP4NhA@`Z8dqDaZ1NVVVGSb5(kf2dVRS6*HhM@h3'YUXmC i9XP$i,e&([TrlL[bX*lKX0IbR&K4I!kBmI41ZB(6hQJX2F"TmT(KA6CSpT!!"Ki DTqR(0-2fc)3Y%jFFf*@)5)hY5S5PKddP3QfACb+!k9kqemliLNFN*RfCN!$8[#m 6XLaUMHKa8N&lejahj,f)Q$96Fcb+M0p,ABV3YMFM029Q"(L[j$EkJX'*'q,@XI( 3DQLSZJK!ac$MPQ6`90fV$FMpr&bSiaq0,02EEC[RFr`HYF2[YaP"Z8rQI2+`(6P U'qQ2jR8FZXHmVFPN0rECGf@`f)*0&CYRGE`q&Sq1f)bXirGBfVGjV(YLBGHFjLm eCEEYdrIBQ$ArVrMe2CL5r&bpkRX8X*1TZ-9[q8"9Drhm&Mp!i194fqD9(ApA'4& YCeJGVrZGD@)c[SlIJfp8V3&,2[kZqKjk*YlaHaKqcqcE0VScC2%*TV0JD0!Qhq@ qaLR3"epqdH#2%1E`2C`"$'AKq4Iq'$NEaPQhISi+TP2!cY3SlSjlR(rQBJ(hk(b 3!*rHS`1!Ihk2)T)IZBFXd["rY@qBkI&kKERVHa4HSf(UH[ipGM#)f"&`Ml@[[Qc aA4P&k0fM(BPqHSmGVl,6iV['lq%%B1lk(VZF6DEmcHHHB0`bK,KVL%VMV2r@EeI @@56J(RbM+**Rhj@4UVibIc"*E2%*jZkSB+C1!14d+b$9SDpVKTEl3p14Tfelq@F dRG`ph#DUmc%Y*PXG[p"LZZja9)[TZXG4,DEl(NHdQ1)ph!YD60Ylr%U,b6hX-eT -m4j(YCLfDra5LqQkac%YjZ"&A!4D6'F1ZkG(amF5(m@lTKIpD2kF(jT1&SKqSHR N%GmCS1N8aelfV`aZY&Rj[rRSVh&2G&'i!lSIA#IG"PZ1-5rTHU@c+0(lf[$&'BT lSQ[KHUemHI`cpcL1`('QA'$FrriHlT[ZKpf,!Bb'PfE[FHH8&lUbddAp(ia!,Y* 4dFFB3GFpMM+#VRXF4I,ZHaa"mZ)pMQP9EIIiP9D9Hj!!Cj!!XhL2SmMCGSeI)QI A2BjT93F[%Vp(3Bk4HqKT#Zdjc$hd+R,CMdZX5ifmjr1i!638IBr#i'4INFJMQYa $9R&T[mI#LDdr[SGlGUTjFY&!GmVRSTYUIZ)10-f'lCG9[M0B%1@PC('jb4BXPb0 V62mNAeJj##l)8YH6JqdZQ8l,SeRBUSG*rG!+km6+hLakRf`4GkkRdD1ZlT*&bU$ %ai@Sa`AGdV@NdaEAF,Qa"amA3MNZ10b3!+$Kmh%KY[MXp$`VRlK@#Z#%Gf%R@2M !#@E#BUNR[K(kL&kLA$-LGK9hc(d+@0JD4Uh&RUT3aS[%1&ic[d9m5Vq)1b921FH ZEH-PLVNP`iXm[6QH9Z6T`h&SNBFK3*9&R[iFVhiT6hbVHiNkLH10Vp@&5$kIi6# S9'V9e8NY[X&C0@3D6@JP[L%0laZV0icJ8k8P'j3(Rm3a*@EBdVk'DkB-[5*SmhR ,H[XUSkA5H@[bqlcZQT-ICjPLh[BRXrrbR[RhNErXZlH@5YIZprF1RM`lqp4Q3Xr %MX5HK@AKBZEMMH$jcV(h18re+IB-,$1&,X"HL"f&(8fH-CDR#MX11ail!FZFQSR B'ZcTj*PNH5l#ASaP`#*,)c""4pifm'lXD[*iGF'XYKAB99LQK6-CD41@'YK-RLf @"dD`(FXXTaZ`G+%c*BJ"3#[*XmIbh)6GLi9C#Xr81&CLY4NQ6kRP!EGX5@YX!RF UX1"+Ar,dXcc81h8f!(X+pP6X308f45jj"PZHSF)YXFa"C-)4%hpRBDGJTj0RYZ@ j&(X*PL%YFl(cX-`eBi,b![*S("!I`iHZ`#l'-U0a+IC+l&ABUH4CCRQZ`5iAAL5 "5*Vf`cNJbDXE[(MYRH!&G6!02"J[j%TZ0a,2drMa5)(JjV1#kkkrPraPj"'mN6a 5%HSA5mHVU'kE9I`$`L2UMI[GAb*4iMl[2QFbrfl$Ip[Xi92LI4iiDal2IR$l[q2 C!ffl$r([1aS[q9qQr2(h14$r6VZIi1*69j)RD(Pi3M#!HZ(p)PerqYAbrqZ"pN0 acXqHR,jKG!#&EPXD0eajU02)SV@96TV&cI*&lY,YF9*2AdJa[9Cc+(Z,`Qc,Lr& ,3rS!GjG(ACC&VDNA8ma'%U`F#Y[YPa2-k%50HVP[*NYJcFha6!QSMHYZ[@Zp($i c5K%Jec8RT$kfjE"#69[dSL6HkQVCLf@LUA&Fh-aQ@"BQVCIIZ,Cr5+T8Fq6FNI* `1iZDdBlrZ*ZH#E1`Nl8l,ck1$XmrRSkrDZL&8,q68`TmQfZmN!$%m[RfelFTfTq ITX"m#40H,''rVl!Y@MSQXU'j!M(p,,N#N!#qQBlAed*&4`C8`[cMqb*L@l6hH[C FQ52Ur)LpV9-*UpG-(i0d%Z3!RHJ11#G"(X`*cd%jd9NJpi*c'1"PD#N8,lDeb(9 4j!%m%Am3[h4m-hJ6Pi0ZSV2!(3r12PJVD"0BJ'a5G!#fRb$hh&Q`pS)lbc3$e&j X'UEMJCPbb%%dd6Q!*VSGRSR2JV-AR(R+*$#RJZ@e1Q'B"$NB*VS$KNQ3!)GK`R- `6(3@KVhJA(el'9U+`S[0&88HKK2a"h&*acI$-(%j'#Bk#m2ai1b$YF)`J38B*N8 ($2X*FXqGK@%[Z,0--c$XaDCK1"kB+BFF$"1GJf'Lff'Bq#`-Hm'CTmc#m1bHX@- `6))F$"2G!F-Nb--`i6NB*MS,`ej`VVkp$#e&iFAQLL)2`iRiJlLNijYKQ,JF$"1 GKH&iF2E"@Q'B`!)-Nk)$K[d%ZHI1`V!Ah&QQ'4MfBY-`(!r-P%-1KSR1`6$4l6" -I"D'[H$-8ak!i4jCULK-p8K6AH*88CiU#&5(*+T1NDSJ8h8,9Ge598kX+XT9Km@ P(RQT4f!U5%b(4+C1Q5N[0"@NTU,B9*5EHU5IS[M6)rpd#8"&#DJJ!Kf5J6U&S)) 8e#d'GFY"18'S+!NG&R"k**`H%DFJia`5FMUPR,bB8j!!FiU#6P(5kC&ALJ*,Mm6 5*E)8CCD#d(*)DZN8@`Tb5lIJdLfjj%5ASZab@#6TN8PkK*+#9(*),1Q85r+#58% b+BSQ4GQNd-a4E1I)0h4d0bJ8@K3kQa3+E3S&GEbSMqF9mQl&Yk$jGUUq"Gfh)$F @"FHmj0JYS49%Y%iC,5ZN0DmEPqCF,6P5T+XP342VDXR43,YD-U4i9dZ#*2(+a+F )35D*,CG-H%Hp0*!!Veb+1,&T6@(S9dYSLRqe*%K#86Dqp3RR,L33-'T*IS$GY@4 *%V0-I&FKqY3X%`ihbmEQLc6&cPS5T1KC-X&5Pc)IDfFmPB609l%aP5J,N!#T,1d SQ8U8JmT8QLaHTV*N3$1G*&Z`k8c09C[1d9+H$F@9!p,Q2+eSfT!!j`#NTZ+cZ*V +NJ(A!dQk(VJ&CP-*1V%fP5S$Z1NN4iUi$AV61CV`pd##BK&NN6L9*3[(5pU1$@, *e3('ITSX&2XjfS(B6j1$B6p*&S6p("N)ENb4VGh'2-f9fjLKT5b6TC5$hR5@9Z" 0CMN!Zhjd&R6p("R)E8T4H03@Z2A$1m(@6j5"fXB8KiUe$@BE-c5"E&0ijl0R!GE 2NB9AM`l2G"1GU5QAP$dbYZDB29CpK9$VkTXIYUBk)A1m-aPQaV9M[,e40XlRk*! !9aSeYCB859%Y%cpVTZC!,e(6mLr[bfqCm#k@e&jrU83(Lr!!l@bYa(5D6$Nf-,K m6EBNkQEUqHT-jFQ8D$T*4jfQXa@*EkCLI8"YVpFNJ@bYeLE1dPUVM8NbPCSN![N k2C!!TNMVmMAUCmP8D'1+M[TXc0A*PlTVFffYpTp5!CPke!,5("%-b(4)-b"2Mfa !QL0!3kCZMF(,dX0F[93GaHJPkDR(3hT$)P%"Qh5LGY9"ef%"HXR4)dk3!1B35-I cG1JBm5cG*A-%p-Pd60JJea'1i'IU+F9Z[F6,FK4iZP36,dP11)PRk+UH([Q%0$d #*@N1XbB5G4-R,mY4lZ5PkbUFBMr3NVL6e&aj,('-`Zc3LKCh@S$R3E%(AM#R%8m !)Ch0,2J1*q,G1K+P1(cf&3r+,Le2QHjSq1RYZaieV6GdC22jErCG@m5*PPGY&)U 2hE[V44XjHMVAXYlH`F(RRmq%0(&e%jALj5DNLB1EU!DqE@*5h0U%T'ZL-Fc5Da1 9T0+*L"4l5B5e[E62RK-"(ZlDPfpJaFQJ11fb3BEY'ZF"[QILNM`X%G(mDUfeR!K 0[CT(Xha[kJe6p-Q%T+L5#@QN45BS5B%5%@QkN`KYHc1Ip53#@SRIaM"ap9FJe-4 hL%FQ48ie-[%GFT&*NGH*6)+F3'6L1e'q-8H,HQ45C'@M4(L1YLGbG(+$4*i@HTU )cPGYZi58c("3X,!CQN8M%eR38%b5V0#4##q@5MH05Z6*P8UVpZ'(jUSSThDBq*c -BH,Ep3f6)5YX*-)l&Be%RN1&NT%m%Y%(Ud(QDVF6!F)lH3!CmM5!m%i@3)Cf%N" mRJ-3AU!!U45Y$)!-13,J4HG"c8Y4+&8[6@ZPHX'j3Zh!rN5#0ZMA#9U3!*r!)[# 6)iIlAR5K3RT3hdZ6VC!!JjJIMmc@6Kla#Fm$2Z%GH%q#(0ald3@dpp,de%F@kle JV`UF5CqkYUj&(,HQfC&Y*BDcbH-T1iPVh+PS2PXTaK6AZ)1R@XAK(1,BcY(r2[A (@Lc4h#rdMr0aRbG1hd2ZPi`V[B`P"HcpNR'Vf1kap-&QPZpiP0bNmX-FRLD1R3r mZ0$6(#UE@ASNRp*D"[DGN[IVp4AZFN'cR4k*@r)P&MqFhmbQMVa6@&XqpZAH[,G r[jRD&Z,6cDc"HbAM*[`CprZckL$cQ82Iiqhe0TAb$IiDKe(YK+e$3RGp"KpE9FT h$aZaK!Gmh2YlP-2Q1eHA0h%2[4IID"phhkFiR1RMIU)FGLAr)GTUXFc(rGd`2MD [*0rM(1l0im,R2S52E5cPZeml,mccq4l8FMKX)mQ9EeqS*hq,K'dIeM+9YLlpZ-M 0(2CCAITaBH'%9cGqA&5EC`keZ[(MpYdbAamIdhD6GSZ2I3r1emFfE9eTGiLkij6 jqRMdER`,I0aGfJV5eXG,@IBaS+dhLI[#I(eFYaiI'e-5pr@jqJMYH4)I@e6+GlH fac6e%4j66E+GTP6kcSmXe)'r(QL81SlAJ4mArZK#25AcIA#K2[bi'2H,eiFI0dL EE*Vk#&qKQVEiqe%``pC(q'HZ*X$Z$R'UDXM84rJbl49P0h9mA*KNkL0mP6E*[0& i!29UkL0mm4I`X8%RqIjk(Mp'DKm0kJ+mCpF*@aq[%TEFl12k#*pUmVLq2a$'[F4 `p`dFH[Zi4l3Tk*hfVYqIbpG[ac*m$rLiJF*eQqq*hIM),eqrlmlIljZ2iRZ2MqZ [c8C0[RklKB[[pA&pYEQRHHr!pi9re"h[)AK[hcY`81rdQ)ql6(R0H`Iq4MjUJAZ `SjTjlm"REX)((`'R(jkrhkHI`XHpL101jRiUqD3+eF60qrVmrCl8Qhl-lXe@4HC qUNGepR'lamUjq`9M[4re5(f$8qCq`6F+Ym!%q9CqFqjq`HekXdrjZ$fU$h1ri)l 2iK-HT2%*(Q0`)R,5,q$lQ[%RkRb`MhZ0DSLkNqq2`0Q5YSm,kLfqlH2HIJHBGV+ 2Up,Z(YraeiL#0j9rjH0@LdYqeqjh,cEQmH16fZ6dHmEcK'F%l"jVK5AJ!h(ic(Y (hUQY8rr*iUM4#Rq2KiAh6eUp2U6,QlK(YENV03,ZISR$&"rhT,C#IFTi*29XlK' jm6&m2c4FNHeFe8-qVYHr%N#0JarJE#prMbm+qm!Vm!Rq8HAcVEJ0(cRPZi8kL&4 ph$4aPAme(JchXMMp0['-Ic-H`#DTDqcHi-(6aVHNEVckZ&YFlNIfIY5cVBpc2SE [aclZC'fiqL&r[fq)GpUY5%qqKhFGk11qqNrc&,C#m3rkHfb$0hLVcFD%XjCrI"q I-ZifK)e6JeB(Ei&2H#[6KS9h&PGQ82G+'#*IL6BZ+S1AJcXq[jQ+$K%U+epXpkr aCNVEbI*dXMeV++qRf1i9TjVq!-6GKkq[MkZ(@bYK[RbIH"rjq[ZiNm!QTBeQ`8Z iKHB0XGhh8@2+0Q)j9CaEmiEBqjk&HbPY2-XlNIF-Rkm5,&$'ef2S&UEqBVY[)*F b[PkLYp4i'G[p1Ef0jHX$a&%d(XGfGm(2e&NqVPceq6`Ipa%`5)%cZQlJ*b90pLT ,e)Cq*p&[!KpUKNGhAbX4(cEhVYr-9VNUhrK9q,&XH4YHjq1Q28#FfE&CR3l[-$J GfhX&@mFUEE[+m`S1'Cb1lAN%A&6#4[P1S`i-6XIfDQPETHeKjCXcAkreer2f#Vp q$lQIVBrkc@b4Ue4he-dr(-+Rf0irr#*aXTbXcJIqDGb0lGd%cLREb(B''mmDr)l Y$H"-5Y[CNNq`bZ"hE1m0ZJFEfa)(cl6hH#Am4QQ,@qLmE'aVm$Zfjbkp"j[Gb[F DX0$L5[e[`Qf8YYQ&(m#A0*l&pYccF@'-LGXXc$"i8lm6V85*Ji$Im(jlMhI`4SS Dj(XGA-6JI@c2RGmLMXf#jAX6ZSc&TrSEU3QPlAQTErL$a[[BRZpG54akMRbRL0F Ch0Vr-&LSE11AQ2L*`DhpGi%T5TbD1RMPI2fK"5MHAlp6R0r(p[kPhS-YGZ8E*Yc 4r##fG`IF58PMNDm@hF6`JpMH')kUT)2"ekN6c3pLHem(Pe2DJ"IHrm3KIL$i)4L Pa#APfiM@B[L"h%0d,28QidrS$JCIpcm+*e$D(*JiH*jp[dAS@1TYaZGiAiYc`IZ *XlVA32&JJkreTm+TP1PHmm!2Lkre[`kI8kClKD89fAZ-q50mFKGJlA,UfI$Df0j 2#!2Bh&MLVJ)$,&lZ[d[Da'Gph%e`"3m[[k)D%icPQi9qjZ(PD186rBV[IYl9`m[ TUPIi(Hq"eQMIqir&rG!*LB2[fATpC!mqZ$rm$lbf1,G!R"`p3Ei9UN@,Pkq(f`@ NGj%2($&iZIpCm$)JIB!ikX2HBk5`!&iXheid#3m[2kbDrRXIYdFkVF@jkQ[*`CE $8$MZBqYl`+IaIGR(E8AImI"bJIL0h8`iV$UhpbMrAAaImA%28cm@,qY6m@2"+,l h``-p[(`[R&qCRMTEqT("brTedP$J&q#Ik+mHAMi'Pe@fi9G)R0lJCAdGV89*2k3 1@1h-eTr@@RKciQK0X2AhQ',3#H@l9RU"`F[pMdQMK0m"0E)KQBHA&G*DV)Dm5hU (aFYDD3bm!lL1CQ$`X[l0dNVJ0I+pkX[cH$Ri6`K!db$IQqIamR%d+D80RAQR""q Y[dEB)abCEr!#AXj%Te&k%rPZ%kjB[0`RIX`fd2!Ep%',Pj23m*9d@RJ'HN1*jrF 2`1(9Z)rl!,JFbHXlF0a"Z*Db4@0,a31Y(V!6M&#f#QaIEE&XiL)R`&'9l8Sd8"K QimD+hjKGM03PB*9h[he`"LAq+mGedS00A138DPMC)T,$a5[X[GmRhQ#hqjUR,C* Yh2IJR-TfcC`R,,4a6iQAQ&fE9%6GH[Hq(Crb1U[DaqE0hVfMD!E+G0D9iZ[fr5k rN6LVXki8cl$hqaal-bRMlCY9ccEZafJJbVDT'b3F2kNC(qfV#1FiC2@5Z&lqr`d !"8PMEfi0D@p38%-ZE@0`!*!4H$-*KJ#3$iB!!$q)!*!$&J#3"'PMEfj038063!# eQI#%YCR`K!!!!HB!N!B"&3#3""F@!*!)JE)4!!JF[-XKL%Vqkr)IQ(qRr&[Nla6 hDYcMFCFjq"YaTmHeLN[2GdpFcRaEjcXYAk0m21qMq8VPh6[[,ARVj-h+FeLHar* XRZHi20im2E`Aj5RJ6I0HR2Y9EqIFjhU,j8l,I9eZP$XeGilF20HCZF[QV*!!Frm F0q9-c,&GMVGcP-Pa@1aj14V(GSQp1qE4f25BR@-hL'NEFkrRVTMdQ%GLYiSj-,D qXmMT%0kG+6`p!r+B3c"H,b-CF*54$%p[fY"-D$T(Emh-i#$Rk@eK'$HR8'ZQ(!T cYqY-%A+HIQQ%K@(XR2`ZdLmbcpr'-b3U-8II58AYQIfMclTCrUa,aK5GkLJ8DZY dYLC!(J4+k5cqV!ZZX3#3!`d0$&*&384045j0B@028f0`!*!4KZB*KJ#3$Mi$!!" $(J#3!aErN!4849K8G(4iG!%!VZP",E@CpXm!!!'X!!!%5`#3!md!!!*C*YQfB3# 3"M&!%3!)(1ad#')JLFI%1Rb*Jij4$SQpPB0bK,62fc8T)G'Ij216P-l"P'KkQ)V "9!65Xe)GTD5H!!J3)B2Y3fARKLIIKp0[UTHYN!"1TZXCRhC&(mcFBpDR'HL$*'B bTRkDJEjBKM3rJcd9[(l15!U(i9GF#&#aYR)HIf+0dbT$lV2bl"JXUUC$EZHE"al 2iakBaArh`'Q21'8UXp'm)bLH6D%Jj*ZT4*peCGa0ec5-ImP4+,3"j!m%ZqTYqZ6 3G)IlBUBS06Yib'K"cmeeX!8+SJ#!)!1BM"JC-!+`$L,X(*!!!I2)5Sk5@mQapmK 4)jc-'!()lfAi9c`$q#LHiJRk%3`%F23LI'9'RJd))mKJ"$&X*HX$!2R!j-"86Di hP&T,(j5qZD143lS3BL2ThP2PI'XI5AP$NipTUQ[5Y8[4mDG"DGPqH44E5H18D(G GRYhHlZ5J4h+q)$f2NA("kX4KNAR[25[cBc!alGMBre3)MJ2G"UBhKAa3RC@#L!k YLdqqiJYGlkUJ`N*eRJ92AV,"NXVII@4++M3fa6*3F@STdf5#C'1L-A!6e&"Bmk- i@SYrMNqP%#KPLKKmkB3@RNJV6mT!k,10E!"'#$la2"5TmcHT!P5IN3-mIH58Q96 #$lKPhbr8+NLf&J("!%4ND4QlQ0dA*j@UqNA-l&mPQMPd'+DhCae+d4&89pQj2k, C$*%#4#&Sih`6FaYB&mlVIM,@B(82mSImU#!"I(BSTA4f0&K[0Bhpe#"`31l*&!Q GjeQd21Fj9$,cK*Z5-6*A$6f@S"H0)mXXp68BV-T,`8&6,QpI3ZUC1dK"1cN)G&H &59X*!0YIFKAPj&eMT@k&q-$'e8kVj0K(+E'e@DqffpAjf3A41$Y%i#mMa'&E0V( @dUZSC--2ZAjm2YUCDYGEa'#3!%!*lImdGq`IE-J"rMa-*q8HPC2dkekJ#P#K3!U 6KaS80)bpFKkS&H0D+KTFM!Makqek*cDEeIVmVlaVp`MSlqK9EiHF[1p`(jN120# 90cC%kk9BRkifTk[eqXJhZ,jECVAm"V`IMITMrqNXlklhKl[p$@hPqZ48LRmK)3Y MCQPdFfP[AfeKB`#3&JQ'!4B!&3+L!GB!N!-"!!!rL!#3"aB!N!1'!!!$([q3"!2 JYCR`K,@Cp[N!N!8"mK%!N!C#Q2r`rrJ!!-0!!!!3DBZi!!!: cfitsio-3.47/cfitsio.pc.cmake0000644000225700000360000000053013464573431015450 0ustar cagordonlheaprefix=@CMAKE_INSTALL_PREFIX@ exec_prefix=@CMAKE_INSTALL_PREFIX@ libdir=@PKG_CONFIG_LIBDIR@ includedir=@INCLUDE_INSTALL_DIR@ Name: cfitsio Description: FITS File Subroutine Library URL: https://heasarc.gsfc.nasa.gov/fitsio/ Version: @CFITSIO_MAJOR@.@CFITSIO_MINOR@ Libs: -L${libdir} @PKG_CONFIG_LIBS@ Libs.private: -lm Cflags: -I${includedir} cfitsio-3.47/cfitsio.pc.in0000644000225700000360000000045413464573431015003 0ustar cagordonlheaprefix=@prefix@ exec_prefix=@exec_prefix@ libdir=@libdir@ includedir=@includedir@ Name: cfitsio Description: FITS File Subroutine Library URL: https://heasarc.gsfc.nasa.gov/fitsio/ Version: @CFITSIO_MAJOR@.@CFITSIO_MINOR@ Libs: -L${libdir} -lcfitsio @LIBS@ Libs.private: -lm Cflags: -I${includedir} cfitsio-3.47/cfitsio.xcodeproj/0000755000225700000360000000000013464573431016043 5ustar cagordonlheacfitsio-3.47/cfitsio.xcodeproj/project.pbxproj0000644000225700000360000000624113464573431021122 0ustar cagordonlhea// !$*UTF8*$! { archiveVersion = 1; classes = { }; objectVersion = 46; objects = { /* Begin PBXAggregateTarget section */ 462A28570A4EF04900AB8766 /* CFITSIO */ = { isa = PBXAggregateTarget; buildConfigurationList = 462A285C0A4EF05400AB8766 /* Build configuration list for PBXAggregateTarget "CFITSIO" */; buildPhases = ( 462A28580A4EF05100AB8766 /* ShellScript */, ); dependencies = ( ); name = CFITSIO; productName = "Build Universal"; }; /* End PBXAggregateTarget section */ /* Begin PBXGroup section */ 22831BBD1146D2B6004A1DD3 /* Products */ = { isa = PBXGroup; children = ( ); name = Products; sourceTree = ""; }; 462A28340A4EEE3200AB8766 = { isa = PBXGroup; children = ( 22831BBD1146D2B6004A1DD3 /* Products */, ); sourceTree = ""; }; /* End PBXGroup section */ /* Begin PBXProject section */ 462A28360A4EEE3200AB8766 /* Project object */ = { isa = PBXProject; attributes = { LastUpgradeCheck = 0630; }; buildConfigurationList = 462A28370A4EEE3200AB8766 /* Build configuration list for PBXProject "cfitsio" */; compatibilityVersion = "Xcode 3.2"; developmentRegion = English; hasScannedForEncodings = 0; knownRegions = ( en, ); mainGroup = 462A28340A4EEE3200AB8766; productRefGroup = 22831BBD1146D2B6004A1DD3 /* Products */; projectDirPath = ""; projectRoot = ""; targets = ( 462A28570A4EF04900AB8766 /* CFITSIO */, ); }; /* End PBXProject section */ /* Begin PBXShellScriptBuildPhase section */ 462A28580A4EF05100AB8766 /* ShellScript */ = { isa = PBXShellScriptBuildPhase; buildActionMask = 2147483647; files = ( ); inputPaths = ( ); outputPaths = ( ); runOnlyForDeploymentPostprocessing = 0; shellPath = /bin/sh; shellScript = "# shell script goes here\nmake distclean\n./configure\nmake shared\nmake testprog\nmake fpack\nmake funpack\nmake fitscopy\nexit 0"; }; /* End PBXShellScriptBuildPhase section */ /* Begin XCBuildConfiguration section */ 462A28390A4EEE3200AB8766 /* Release */ = { isa = XCBuildConfiguration; buildSettings = { COPY_PHASE_STRIP = YES; }; name = Release; }; 462A285E0A4EF05400AB8766 /* Release */ = { isa = XCBuildConfiguration; buildSettings = { COPY_PHASE_STRIP = YES; GCC_ENABLE_FIX_AND_CONTINUE = NO; GCC_GENERATE_DEBUGGING_SYMBOLS = NO; PRODUCT_NAME = CFITSIO; ZERO_LINK = NO; }; name = Release; }; /* End XCBuildConfiguration section */ /* Begin XCConfigurationList section */ 462A28370A4EEE3200AB8766 /* Build configuration list for PBXProject "cfitsio" */ = { isa = XCConfigurationList; buildConfigurations = ( 462A28390A4EEE3200AB8766 /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 462A285C0A4EF05400AB8766 /* Build configuration list for PBXAggregateTarget "CFITSIO" */ = { isa = XCConfigurationList; buildConfigurations = ( 462A285E0A4EF05400AB8766 /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; /* End XCConfigurationList section */ }; rootObject = 462A28360A4EEE3200AB8766 /* Project object */; } cfitsio-3.47/cfortran.h0000644000225700000360000041033213464573431014401 0ustar cagordonlhea/* cfortran.h 4.4 */ /* http://www-zeus.desy.de/~burow/cfortran/ */ /* Burkhard Burow burow@desy.de 1990 - 2002. */ #ifndef __CFORTRAN_LOADED #define __CFORTRAN_LOADED /* THIS FILE IS PROPERTY OF BURKHARD BUROW. IF YOU ARE USING THIS FILE YOU SHOULD ALSO HAVE ACCESS TO CFORTRAN.DOC WHICH PROVIDES TERMS FOR USING, MODIFYING, COPYING AND DISTRIBUTING THE CFORTRAN.H PACKAGE. */ /* The following modifications were made by the authors of CFITSIO or by me. * They are flagged below with CFITSIO, the author's initials, or KMCCARTY. * PDW = Peter Wilson * DM = Doug Mink * LEB = Lee E Brotzman * MR = Martin Reinecke * WDP = William D Pence * -- Kevin McCarty, for Debian (19 Dec. 2005) */ /******* Modifications: Oct 1997: Changed symbol name extname to appendus (PDW/HSTX) (Conflicted with a common variable name in FTOOLS) Nov 1997: If g77Fortran defined, also define f2cFortran (PDW/HSTX) Feb 1998: Let VMS see the NUM_ELEMS code. Lets programs treat single strings as vectors with single elements Nov 1999: If macintoxh defined, also define f2cfortran (for Mac OS-X) Apr 2000: If WIN32 defined, also define PowerStationFortran and VISUAL_CPLUSPLUS (Visual C++) Jun 2000: If __GNUC__ and linux defined, also define f2cFortran (linux/gcc environment detection) Apr 2002: If __CYGWIN__ is defined, also define f2cFortran Nov 2002: If __APPLE__ defined, also define f2cfortran (for Mac OS-X) Nov 2003: If __INTEL_COMPILER or INTEL_COMPILER defined, also define f2cFortran (KMCCARTY) Dec 2005: If f2cFortran is defined, enforce REAL functions in FORTRAN returning "double" in C. This was one of the items on Burkhard's TODO list. (KMCCARTY) Dec 2005: Modifications to support 8-byte integers. (MR) USE AT YOUR OWN RISK! Feb 2006 Added logic to typedef the symbol 'LONGLONG' to an appropriate intrinsic 8-byte integer datatype (WDP) Apr 2006: Modifications to support gfortran (and g77 with -fno-f2c flag) since by default it returns "float" for FORTRAN REAL function. (KMCCARTY) May 2008: Revert commenting out of "extern" in COMMON_BLOCK_DEF macro. Add braces around do-nothing ";" in 3 empty while blocks to get rid of compiler warnings. Thanks to ROOT developers Jacek Holeczek and Rene Brun for these suggestions. (KMCCARTY) Dec 2008 Added typedef for LONGLONG to support Borland compiler (WDP) *******/ /* Avoid symbols already used by compilers and system *.h: __ - OSF1 zukal06 V3.0 347 alpha, cc -c -std1 cfortest.c */ /* Determine what 8-byte integer data type is available. 'long long' is now supported by most compilers, but older MS Visual C++ compilers before V7.0 use '__int64' instead. (WDP) */ #ifndef LONGLONG_TYPE /* this may have been previously defined */ #if defined(_MSC_VER) /* Microsoft Visual C++ */ #if (_MSC_VER < 1300) /* versions earlier than V7.0 do not have 'long long' */ typedef __int64 LONGLONG; typedef unsigned __int64 ULONGLONG; #else /* newer versions do support 'long long' */ typedef long long LONGLONG; typedef unsigned long long ULONGLONG; #endif #elif defined( __BORLANDC__) /* (WDP) for the free Borland compiler, in particular */ typedef __int64 LONGLONG; typedef unsigned __int64 ULONGLONG; #else typedef long long LONGLONG; typedef unsigned long long ULONGLONG; #endif #define LONGLONG_TYPE #endif /* Microsoft Visual C++ requires alternate form for static inline. */ #if defined(_MSC_VER) /* Microsoft Visual C++ */ #define STIN static __inline #else #define STIN static inline #endif /* First prepare for the C compiler. */ #ifndef ANSI_C_preprocessor /* i.e. user can override. */ #ifdef __CF__KnR #define ANSI_C_preprocessor 0 #else #ifdef __STDC__ #define ANSI_C_preprocessor 1 #else #define _cfleft 1 #define _cfright #define _cfleft_cfright 0 #define ANSI_C_preprocessor _cfleft/**/_cfright #endif #endif #endif #if ANSI_C_preprocessor #define _0(A,B) A##B #define _(A,B) _0(A,B) /* see cat,xcat of K&R ANSI C p. 231 */ #define _2(A,B) A##B /* K&R ANSI C p.230: .. identifier is not replaced */ #define _3(A,B,C) _(A,_(B,C)) #else /* if it turns up again during rescanning. */ #define _(A,B) A/**/B #define _2(A,B) A/**/B #define _3(A,B,C) A/**/B/**/C #endif #if (defined(vax)&&defined(unix)) || (defined(__vax__)&&defined(__unix__)) #define VAXUltrix #endif #include /* NULL [in all machines stdio.h] */ #include /* strlen, memset, memcpy, memchr. */ #if !( defined(VAXUltrix) || defined(sun) || (defined(apollo)&&!defined(__STDCPP__)) ) #include /* malloc,free */ #else #include /* Had to be removed for DomainOS h105 10.4 sys5.3 425t*/ #ifdef apollo #define __CF__APOLLO67 /* __STDCPP__ is in Apollo 6.8 (i.e. ANSI) and onwards */ #endif #endif #if !defined(__GNUC__) && !defined(__sun) && (defined(sun)||defined(VAXUltrix)||defined(lynx)) #define __CF__KnR /* Sun, LynxOS and VAX Ultrix cc only supports K&R. */ /* Manually define __CF__KnR for HP if desired/required.*/ #endif /* i.e. We will generate Kernighan and Ritchie C. */ /* Note that you may define __CF__KnR before #include cfortran.h, in order to generate K&R C instead of the default ANSI C. The differences are mainly in the function prototypes and declarations. All machines, except the Apollo, work with either style. The Apollo's argument promotion rules require ANSI or use of the obsolete std_$call which we have not implemented here. Hence on the Apollo, only C calling FORTRAN subroutines will work using K&R style.*/ /* Remainder of cfortran.h depends on the Fortran compiler. */ /* 11/29/2003 (KMCCARTY): add *INTEL_COMPILER symbols here */ /* 04/05/2006 (KMCCARTY): add gFortran symbol here */ #if defined(CLIPPERFortran) || defined(pgiFortran) || defined(__INTEL_COMPILER) || defined(INTEL_COMPILER) || defined(gFortran) #define f2cFortran #endif /* VAX/VMS does not let us \-split long #if lines. */ /* Split #if into 2 because some HP-UX can't handle long #if */ #if !(defined(NAGf90Fortran)||defined(f2cFortran)||defined(hpuxFortran)||defined(apolloFortran)||defined(sunFortran)||defined(IBMR2Fortran)||defined(CRAYFortran)) #if !(defined(mipsFortran)||defined(DECFortran)||defined(vmsFortran)||defined(CONVEXFortran)||defined(PowerStationFortran)||defined(AbsoftUNIXFortran)||defined(AbsoftProFortran)||defined(SXFortran)) /* If no Fortran compiler is given, we choose one for the machines we know. */ #if defined(lynx) || defined(VAXUltrix) #define f2cFortran /* Lynx: Only support f2c at the moment. VAXUltrix: f77 behaves like f2c. Support f2c or f77 with gcc, vcc with f2c. f77 with vcc works, missing link magic for f77 I/O.*/ #endif /* 04/13/00 DM (CFITSIO): Add these lines for NT */ /* with PowerStationFortran and and Visual C++ */ #if defined(WIN32) && !defined(__CYGWIN__) #define PowerStationFortran #define VISUAL_CPLUSPLUS #endif #if defined(g77Fortran) /* 11/03/97 PDW (CFITSIO) */ #define f2cFortran #endif #if defined(__CYGWIN__) /* 04/11/02 LEB (CFITSIO) */ #define f2cFortran #endif #if defined(__GNUC__) && defined(linux) /* 06/21/00 PDW (CFITSIO) */ #define f2cFortran #endif #if defined(macintosh) /* 11/1999 (CFITSIO) */ #define f2cFortran #endif #if defined(__APPLE__) /* 11/2002 (CFITSIO) */ #define f2cFortran #endif #if defined(__hpux) /* 921107: Use __hpux instead of __hp9000s300 */ #define hpuxFortran /* Should also allow hp9000s7/800 use.*/ #endif #if defined(apollo) #define apolloFortran /* __CF__APOLLO67 also defines some behavior. */ #endif #if defined(sun) || defined(__sun) #define sunFortran #endif #if defined(_IBMR2) #define IBMR2Fortran #endif #if defined(_CRAY) #define CRAYFortran /* _CRAYT3E also defines some behavior. */ #endif #if defined(_SX) #define SXFortran #endif #if defined(mips) || defined(__mips) #define mipsFortran #endif #if defined(vms) || defined(__vms) #define vmsFortran #endif #if defined(__alpha) && defined(__unix__) #define DECFortran #endif #if defined(__convex__) #define CONVEXFortran #endif #if defined(VISUAL_CPLUSPLUS) #define PowerStationFortran #endif #endif /* ...Fortran */ #endif /* ...Fortran */ /* Split #if into 2 because some HP-UX can't handle long #if */ #if !(defined(NAGf90Fortran)||defined(f2cFortran)||defined(hpuxFortran)||defined(apolloFortran)||defined(sunFortran)||defined(IBMR2Fortran)||defined(CRAYFortran)) #if !(defined(mipsFortran)||defined(DECFortran)||defined(vmsFortran)||defined(CONVEXFortran)||defined(PowerStationFortran)||defined(AbsoftUNIXFortran)||defined(AbsoftProFortran)||defined(SXFortran)) /* If your compiler barfs on ' #error', replace # with the trigraph for # */ #error "cfortran.h: Can't find your environment among:\ - GNU gcc (g77) on Linux. \ - MIPS cc and f77 2.0. (e.g. Silicon Graphics, DECstations, ...) \ - IBM AIX XL C and FORTRAN Compiler/6000 Version 01.01.0000.0000 \ - VAX VMS CC 3.1 and FORTRAN 5.4. \ - Alpha VMS DEC C 1.3 and DEC FORTRAN 6.0. \ - Alpha OSF DEC C and DEC Fortran for OSF/1 AXP Version 1.2 \ - Apollo DomainOS 10.2 (sys5.3) with f77 10.7 and cc 6.7. \ - CRAY \ - NEC SX-4 SUPER-UX \ - CONVEX \ - Sun \ - PowerStation Fortran with Visual C++ \ - HP9000s300/s700/s800 Latest test with: HP-UX A.08.07 A 9000/730 \ - LynxOS: cc or gcc with f2c. \ - VAXUltrix: vcc,cc or gcc with f2c. gcc or cc with f77. \ - f77 with vcc works; but missing link magic for f77 I/O. \ - NO fort. None of gcc, cc or vcc generate required names.\ - f2c/g77: Use #define f2cFortran, or cc -Df2cFortran \ - gfortran: Use #define gFortran, or cc -DgFortran \ (also necessary for g77 with -fno-f2c option) \ - NAG f90: Use #define NAGf90Fortran, or cc -DNAGf90Fortran \ - Absoft UNIX F77: Use #define AbsoftUNIXFortran or cc -DAbsoftUNIXFortran \ - Absoft Pro Fortran: Use #define AbsoftProFortran \ - Portland Group Fortran: Use #define pgiFortran \ - Intel Fortran: Use #define INTEL_COMPILER" /* Compiler must throw us out at this point! */ #endif #endif #if defined(VAXC) && !defined(__VAXC) #define OLD_VAXC #pragma nostandard /* Prevent %CC-I-PARAMNOTUSED. */ #endif /* Throughout cfortran.h we use: UN = Uppercase Name. LN = Lowercase Name. */ /* "extname" changed to "appendus" below (CFITSIO) */ #if defined(f2cFortran) || defined(NAGf90Fortran) || defined(DECFortran) || defined(mipsFortran) || defined(apolloFortran) || defined(sunFortran) || defined(CONVEXFortran) || defined(SXFortran) || defined(appendus) #define CFC_(UN,LN) _(LN,_) /* Lowercase FORTRAN symbols. */ #define orig_fcallsc(UN,LN) CFC_(UN,LN) #else #if defined(CRAYFortran) || defined(PowerStationFortran) || defined(AbsoftProFortran) #ifdef _CRAY /* (UN), not UN, circumvents CRAY preprocessor bug. */ #define CFC_(UN,LN) (UN) /* Uppercase FORTRAN symbols. */ #else /* At least VISUAL_CPLUSPLUS barfs on (UN), so need UN. */ #define CFC_(UN,LN) UN /* Uppercase FORTRAN symbols. */ #endif #define orig_fcallsc(UN,LN) CFC_(UN,LN) /* CRAY insists on arg.'s here. */ #else /* For following machines one may wish to change the fcallsc default. */ #define CF_SAME_NAMESPACE #ifdef vmsFortran #define CFC_(UN,LN) LN /* Either case FORTRAN symbols. */ /* BUT we usually use UN for C macro to FORTRAN routines, so use LN here,*/ /* because VAX/VMS doesn't do recursive macros. */ #define orig_fcallsc(UN,LN) UN #else /* HP-UX without +ppu or IBMR2 without -qextname. NOT reccomended. */ #define CFC_(UN,LN) LN /* Lowercase FORTRAN symbols. */ #define orig_fcallsc(UN,LN) CFC_(UN,LN) #endif /* vmsFortran */ #endif /* CRAYFortran PowerStationFortran */ #endif /* ....Fortran */ #define fcallsc(UN,LN) orig_fcallsc(UN,LN) #define preface_fcallsc(P,p,UN,LN) CFC_(_(P,UN),_(p,LN)) #define append_fcallsc(P,p,UN,LN) CFC_(_(UN,P),_(LN,p)) #define C_FUNCTION(UN,LN) fcallsc(UN,LN) #define FORTRAN_FUNCTION(UN,LN) CFC_(UN,LN) #ifndef COMMON_BLOCK #ifndef CONVEXFortran #ifndef CLIPPERFortran #if !(defined(AbsoftUNIXFortran)||defined(AbsoftProFortran)) #define COMMON_BLOCK(UN,LN) CFC_(UN,LN) #else #define COMMON_BLOCK(UN,LN) _(_C,LN) #endif /* AbsoftUNIXFortran or AbsoftProFortran */ #else #define COMMON_BLOCK(UN,LN) _(LN,__) #endif /* CLIPPERFortran */ #else #define COMMON_BLOCK(UN,LN) _3(_,LN,_) #endif /* CONVEXFortran */ #endif /* COMMON_BLOCK */ #ifndef DOUBLE_PRECISION #if defined(CRAYFortran) && !defined(_CRAYT3E) #define DOUBLE_PRECISION long double #else #define DOUBLE_PRECISION double #endif #endif #ifndef FORTRAN_REAL #if defined(CRAYFortran) && defined(_CRAYT3E) #define FORTRAN_REAL double #else #define FORTRAN_REAL float #endif #endif #ifdef CRAYFortran #ifdef _CRAY #include #else #include "fortran.h" /* i.e. if crosscompiling assume user has file. */ #endif #define FLOATVVVVVVV_cfPP (FORTRAN_REAL *) /* Used for C calls FORTRAN. */ /* CRAY's double==float but CRAY says pointers to doubles and floats are diff.*/ #define VOIDP (void *) /* When FORTRAN calls C, we don't know if C routine arg.'s have been declared float *, or double *. */ #else #define FLOATVVVVVVV_cfPP #define VOIDP #endif #ifdef vmsFortran #if defined(vms) || defined(__vms) #include #else #include "descrip.h" /* i.e. if crosscompiling assume user has file. */ #endif #endif #ifdef sunFortran #if defined(sun) || defined(__sun) #include /* Sun's FLOATFUNCTIONTYPE, ASSIGNFLOAT, RETURNFLOAT. */ #else #include "math.h" /* i.e. if crosscompiling assume user has file. */ #endif /* At least starting with the default C compiler SC3.0.1 of SunOS 5.3, * FLOATFUNCTIONTYPE, ASSIGNFLOAT, RETURNFLOAT are not required and not in * , since sun C no longer promotes C float return values to doubles. * Therefore, only use them if defined. * Even if gcc is being used, assume that it exhibits the Sun C compiler * behavior in order to be able to use *.o from the Sun C compiler. * i.e. If FLOATFUNCTIONTYPE, etc. are in math.h, they required by gcc. */ #endif #ifndef apolloFortran #define COMMON_BLOCK_DEF(DEFINITION, NAME) extern DEFINITION NAME #define CF_NULL_PROTO #else /* HP doesn't understand #elif. */ /* Without ANSI prototyping, Apollo promotes float functions to double. */ /* Note that VAX/VMS, IBM, Mips choke on 'type function(...);' prototypes. */ #define CF_NULL_PROTO ... #ifndef __CF__APOLLO67 #define COMMON_BLOCK_DEF(DEFINITION, NAME) \ DEFINITION NAME __attribute((__section(NAME))) #else #define COMMON_BLOCK_DEF(DEFINITION, NAME) \ DEFINITION NAME #attribute[section(NAME)] #endif #endif #ifdef __cplusplus #undef CF_NULL_PROTO #define CF_NULL_PROTO ... #endif #ifndef USE_NEW_DELETE #ifdef __cplusplus #define USE_NEW_DELETE 1 #else #define USE_NEW_DELETE 0 #endif #endif #if USE_NEW_DELETE #define _cf_malloc(N) new char[N] #define _cf_free(P) delete[] P #else #define _cf_malloc(N) (char *)malloc(N) #define _cf_free(P) free(P) #endif #ifdef mipsFortran #define CF_DECLARE_GETARG int f77argc; char **f77argv #define CF_SET_GETARG(ARGC,ARGV) f77argc = ARGC; f77argv = ARGV #else #define CF_DECLARE_GETARG #define CF_SET_GETARG(ARGC,ARGV) #endif #ifdef OLD_VAXC /* Allow %CC-I-PARAMNOTUSED. */ #pragma standard #endif #define AcfCOMMA , #define AcfCOLON ; /*-------------------------------------------------------------------------*/ /* UTILITIES USED WITHIN CFORTRAN.H */ #define _cfMIN(A,B) (As) { /* Need this to handle NULL string.*/ while (e>s && *--e==t) {;} /* Don't follow t's past beginning. */ e[*e==t?0:1] = '\0'; /* Handle s[0]=t correctly. */ } return s; } /* kill_trailingn(s,t,e) will kill the trailing t's in string s. e normally points to the terminating '\0' of s, but may actually point to anywhere in s. s's new '\0' will be placed at e or earlier in order to remove any trailing t's. If es) { /* Watch out for neg. length string.*/ while (e>s && *--e==t){;} /* Don't follow t's past beginning. */ e[*e==t?0:1] = '\0'; /* Handle s[0]=t correctly. */ } return s; } /* Note the following assumes that any element which has t's to be chopped off, does indeed fill the entire element. */ #ifndef __CF__KnR static char *vkill_trailing(char* cstr, int elem_len, int sizeofcstr, char t) #else static char *vkill_trailing( cstr, elem_len, sizeofcstr, t) char* cstr; int elem_len; int sizeofcstr; char t; #endif { int i; for (i=0; i= 4.3 gives message: zow35> cc -c -DDECFortran cfortest.c cfe: Fatal: Out of memory: cfortest.c zow35> Old __hpux had the problem, but new 'HP-UX A.09.03 A 9000/735' is fine if using -Aa, otherwise we have a problem. */ #ifndef MAX_PREPRO_ARGS #if !defined(__GNUC__) && (defined(VAXUltrix) || defined(__CF__APOLLO67) || (defined(sun)&&!defined(__sun)) || defined(_CRAY) || defined(__ultrix__) || (defined(__hpux)&&defined(__CF__KnR))) #define MAX_PREPRO_ARGS 31 #else #define MAX_PREPRO_ARGS 99 #endif #endif #if defined(AbsoftUNIXFortran) || defined(AbsoftProFortran) /* In addition to explicit Absoft stuff, only Absoft requires: - DEFAULT coming from _cfSTR. DEFAULT could have been called e.g. INT, but keep it for clarity. - M term in CFARGT14 and CFARGT14FS. */ #define ABSOFT_cf1(T0) _(T0,_cfSTR)(0,ABSOFT1,0,0,0,0,0) #define ABSOFT_cf2(T0) _(T0,_cfSTR)(0,ABSOFT2,0,0,0,0,0) #define ABSOFT_cf3(T0) _(T0,_cfSTR)(0,ABSOFT3,0,0,0,0,0) #define DEFAULT_cfABSOFT1 #define LOGICAL_cfABSOFT1 #define STRING_cfABSOFT1 ,MAX_LEN_FORTRAN_FUNCTION_STRING #define DEFAULT_cfABSOFT2 #define LOGICAL_cfABSOFT2 #define STRING_cfABSOFT2 ,unsigned D0 #define DEFAULT_cfABSOFT3 #define LOGICAL_cfABSOFT3 #define STRING_cfABSOFT3 ,D0 #else #define ABSOFT_cf1(T0) #define ABSOFT_cf2(T0) #define ABSOFT_cf3(T0) #endif /* _Z introduced to cicumvent IBM and HP silly preprocessor warning. e.g. "Macro CFARGT14 invoked with a null argument." */ #define _Z #define CFARGT14S(S,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ S(T1,1) S(T2,2) S(T3,3) S(T4,4) S(T5,5) S(T6,6) S(T7,7) \ S(T8,8) S(T9,9) S(TA,10) S(TB,11) S(TC,12) S(TD,13) S(TE,14) #define CFARGT27S(S,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) \ S(T1,1) S(T2,2) S(T3,3) S(T4,4) S(T5,5) S(T6,6) S(T7,7) \ S(T8,8) S(T9,9) S(TA,10) S(TB,11) S(TC,12) S(TD,13) S(TE,14) \ S(TF,15) S(TG,16) S(TH,17) S(TI,18) S(TJ,19) S(TK,20) S(TL,21) \ S(TM,22) S(TN,23) S(TO,24) S(TP,25) S(TQ,26) S(TR,27) #define CFARGT14FS(F,S,M,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ F(T1,1,0) F(T2,2,1) F(T3,3,1) F(T4,4,1) F(T5,5,1) F(T6,6,1) F(T7,7,1) \ F(T8,8,1) F(T9,9,1) F(TA,10,1) F(TB,11,1) F(TC,12,1) F(TD,13,1) F(TE,14,1) \ M CFARGT14S(S,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) #define CFARGT27FS(F,S,M,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) \ F(T1,1,0) F(T2,2,1) F(T3,3,1) F(T4,4,1) F(T5,5,1) F(T6,6,1) F(T7,7,1) \ F(T8,8,1) F(T9,9,1) F(TA,10,1) F(TB,11,1) F(TC,12,1) F(TD,13,1) F(TE,14,1) \ F(TF,15,1) F(TG,16,1) F(TH,17,1) F(TI,18,1) F(TJ,19,1) F(TK,20,1) F(TL,21,1) \ F(TM,22,1) F(TN,23,1) F(TO,24,1) F(TP,25,1) F(TQ,26,1) F(TR,27,1) \ M CFARGT27S(S,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) #if !(defined(PowerStationFortran)||defined(hpuxFortran800)) /* Old CFARGT14 -> CFARGT14FS as seen below, for Absoft cross-compile yields: SunOS> cc -c -Xa -DAbsoftUNIXFortran c.c "c.c", line 406: warning: argument mismatch Haven't checked if this is ANSI C or a SunOS bug. SunOS -Xs works ok. Behavior is most clearly seen in example: #define A 1 , 2 #define C(X,Y,Z) x=X. y=Y. z=Z. #define D(X,Y,Z) C(X,Y,Z) D(x,A,z) Output from preprocessor is: x = x . y = 1 . z = 2 . #define CFARGT14(F,S,M,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ CFARGT14FS(F,S,M,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) */ #define CFARGT14(F,S,M,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ F(T1,1,0) F(T2,2,1) F(T3,3,1) F(T4,4,1) F(T5,5,1) F(T6,6,1) F(T7,7,1) \ F(T8,8,1) F(T9,9,1) F(TA,10,1) F(TB,11,1) F(TC,12,1) F(TD,13,1) F(TE,14,1) \ M CFARGT14S(S,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) #define CFARGT27(F,S,M,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) \ F(T1,1,0) F(T2,2,1) F(T3,3,1) F(T4,4,1) F(T5,5,1) F(T6,6,1) F(T7,7,1) \ F(T8,8,1) F(T9,9,1) F(TA,10,1) F(TB,11,1) F(TC,12,1) F(TD,13,1) F(TE,14,1) \ F(TF,15,1) F(TG,16,1) F(TH,17,1) F(TI,18,1) F(TJ,19,1) F(TK,20,1) F(TL,21,1) \ F(TM,22,1) F(TN,23,1) F(TO,24,1) F(TP,25,1) F(TQ,26,1) F(TR,27,1) \ M CFARGT27S(S,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) #define CFARGT20(F,S,M,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK) \ F(T1,1,0) F(T2,2,1) F(T3,3,1) F(T4,4,1) F(T5,5,1) F(T6,6,1) F(T7,7,1) \ F(T8,8,1) F(T9,9,1) F(TA,10,1) F(TB,11,1) F(TC,12,1) F(TD,13,1) F(TE,14,1) \ F(TF,15,1) F(TG,16,1) F(TH,17,1) F(TI,18,1) F(TJ,19,1) F(TK,20,1) \ S(T1,1) S(T2,2) S(T3,3) S(T4,4) S(T5,5) S(T6,6) S(T7,7) \ S(T8,8) S(T9,9) S(TA,10) S(TB,11) S(TC,12) S(TD,13) S(TE,14) \ S(TF,15) S(TG,16) S(TH,17) S(TI,18) S(TJ,19) S(TK,20) #define CFARGTA14(F,S,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE) \ F(T1,A1,1,0) F(T2,A2,2,1) F(T3,A3,3,1) F(T4,A4,4,1) F(T5,A5,5,1) F(T6,A6,6,1) \ F(T7,A7,7,1) F(T8,A8,8,1) F(T9,A9,9,1) F(TA,AA,10,1) F(TB,AB,11,1) F(TC,AC,12,1) \ F(TD,AD,13,1) F(TE,AE,14,1) S(T1,1) S(T2,2) S(T3,3) S(T4,4) \ S(T5,5) S(T6,6) S(T7,7) S(T8,8) S(T9,9) S(TA,10) \ S(TB,11) S(TC,12) S(TD,13) S(TE,14) #if MAX_PREPRO_ARGS>31 #define CFARGTA20(F,S,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK) \ F(T1,A1,1,0) F(T2,A2,2,1) F(T3,A3,3,1) F(T4,A4,4,1) F(T5,A5,5,1) F(T6,A6,6,1) \ F(T7,A7,7,1) F(T8,A8,8,1) F(T9,A9,9,1) F(TA,AA,10,1) F(TB,AB,11,1) F(TC,AC,12,1) \ F(TD,AD,13,1) F(TE,AE,14,1) F(TF,AF,15,1) F(TG,AG,16,1) F(TH,AH,17,1) F(TI,AI,18,1) \ F(TJ,AJ,19,1) F(TK,AK,20,1) S(T1,1) S(T2,2) S(T3,3) S(T4,4) \ S(T5,5) S(T6,6) S(T7,7) S(T8,8) S(T9,9) S(TA,10) \ S(TB,11) S(TC,12) S(TD,13) S(TE,14) S(TF,15) S(TG,16) \ S(TH,17) S(TI,18) S(TJ,19) S(TK,20) #define CFARGTA27(F,S,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,AO,AP,AQ,AR) \ F(T1,A1,1,0) F(T2,A2,2,1) F(T3,A3,3,1) F(T4,A4,4,1) F(T5,A5,5,1) F(T6,A6,6,1) \ F(T7,A7,7,1) F(T8,A8,8,1) F(T9,A9,9,1) F(TA,AA,10,1) F(TB,AB,11,1) F(TC,AC,12,1) \ F(TD,AD,13,1) F(TE,AE,14,1) F(TF,AF,15,1) F(TG,AG,16,1) F(TH,AH,17,1) F(TI,AI,18,1) \ F(TJ,AJ,19,1) F(TK,AK,20,1) F(TL,AL,21,1) F(TM,AM,22,1) F(TN,AN,23,1) F(TO,AO,24,1) \ F(TP,AP,25,1) F(TQ,AQ,26,1) F(TR,AR,27,1) S(T1,1) S(T2,2) S(T3,3) \ S(T4,4) S(T5,5) S(T6,6) S(T7,7) S(T8,8) S(T9,9) \ S(TA,10) S(TB,11) S(TC,12) S(TD,13) S(TE,14) S(TF,15) \ S(TG,16) S(TH,17) S(TI,18) S(TJ,19) S(TK,20) S(TL,21) \ S(TM,22) S(TN,23) S(TO,24) S(TP,25) S(TQ,26) S(TR,27) #endif #else #define CFARGT14(F,S,M,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ F(T1,1,0) S(T1,1) F(T2,2,1) S(T2,2) F(T3,3,1) S(T3,3) F(T4,4,1) S(T4,4) \ F(T5,5,1) S(T5,5) F(T6,6,1) S(T6,6) F(T7,7,1) S(T7,7) F(T8,8,1) S(T8,8) \ F(T9,9,1) S(T9,9) F(TA,10,1) S(TA,10) F(TB,11,1) S(TB,11) F(TC,12,1) S(TC,12) \ F(TD,13,1) S(TD,13) F(TE,14,1) S(TE,14) #define CFARGT27(F,S,M,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) \ F(T1,1,0) S(T1,1) F(T2,2,1) S(T2,2) F(T3,3,1) S(T3,3) F(T4,4,1) S(T4,4) \ F(T5,5,1) S(T5,5) F(T6,6,1) S(T6,6) F(T7,7,1) S(T7,7) F(T8,8,1) S(T8,8) \ F(T9,9,1) S(T9,9) F(TA,10,1) S(TA,10) F(TB,11,1) S(TB,11) F(TC,12,1) S(TC,12) \ F(TD,13,1) S(TD,13) F(TE,14,1) S(TE,14) F(TF,15,1) S(TF,15) F(TG,16,1) S(TG,16) \ F(TH,17,1) S(TH,17) F(TI,18,1) S(TI,18) F(TJ,19,1) S(TJ,19) F(TK,20,1) S(TK,20) \ F(TL,21,1) S(TL,21) F(TM,22,1) S(TM,22) F(TN,23,1) S(TN,23) F(TO,24,1) S(TO,24) \ F(TP,25,1) S(TP,25) F(TQ,26,1) S(TQ,26) F(TR,27,1) S(TR,27) #define CFARGT20(F,S,M,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK) \ F(T1,1,0) S(T1,1) F(T2,2,1) S(T2,2) F(T3,3,1) S(T3,3) F(T4,4,1) S(T4,4) \ F(T5,5,1) S(T5,5) F(T6,6,1) S(T6,6) F(T7,7,1) S(T7,7) F(T8,8,1) S(T8,8) \ F(T9,9,1) S(T9,9) F(TA,10,1) S(TA,10) F(TB,11,1) S(TB,11) F(TC,12,1) S(TC,12) \ F(TD,13,1) S(TD,13) F(TE,14,1) S(TE,14) F(TF,15,1) S(TF,15) F(TG,16,1) S(TG,16) \ F(TH,17,1) S(TH,17) F(TI,18,1) S(TI,18) F(TJ,19,1) S(TJ,19) F(TK,20,1) S(TK,20) #define CFARGTA14(F,S,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE) \ F(T1,A1,1,0) S(T1,1) F(T2,A2,2,1) S(T2,2) F(T3,A3,3,1) S(T3,3) \ F(T4,A4,4,1) S(T4,4) F(T5,A5,5,1) S(T5,5) F(T6,A6,6,1) S(T6,6) \ F(T7,A7,7,1) S(T7,7) F(T8,A8,8,1) S(T8,8) F(T9,A9,9,1) S(T9,9) \ F(TA,AA,10,1) S(TA,10) F(TB,AB,11,1) S(TB,11) F(TC,AC,12,1) S(TC,12) \ F(TD,AD,13,1) S(TD,13) F(TE,AE,14,1) S(TE,14) #if MAX_PREPRO_ARGS>31 #define CFARGTA20(F,S,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK) \ F(T1,A1,1,0) S(T1,1) F(T2,A2,2,1) S(T2,2) F(T3,A3,3,1) S(T3,3) \ F(T4,A4,4,1) S(T4,4) F(T5,A5,5,1) S(T5,5) F(T6,A6,6,1) S(T6,6) \ F(T7,A7,7,1) S(T7,7) F(T8,A8,8,1) S(T8,8) F(T9,A9,9,1) S(T9,9) \ F(TA,AA,10,1) S(TA,10) F(TB,AB,11,1) S(TB,11) F(TC,AC,12,1) S(TC,12) \ F(TD,AD,13,1) S(TD,13) F(TE,AE,14,1) S(TE,14) F(TF,AF,15,1) S(TF,15) \ F(TG,AG,16,1) S(TG,16) F(TH,AH,17,1) S(TH,17) F(TI,AI,18,1) S(TI,18) \ F(TJ,AJ,19,1) S(TJ,19) F(TK,AK,20,1) S(TK,20) #define CFARGTA27(F,S,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,AO,AP,AQ,AR) \ F(T1,A1,1,0) S(T1,1) F(T2,A2,2,1) S(T2,2) F(T3,A3,3,1) S(T3,3) \ F(T4,A4,4,1) S(T4,4) F(T5,A5,5,1) S(T5,5) F(T6,A6,6,1) S(T6,6) \ F(T7,A7,7,1) S(T7,7) F(T8,A8,8,1) S(T8,8) F(T9,A9,9,1) S(T9,9) \ F(TA,AA,10,1) S(TA,10) F(TB,AB,11,1) S(TB,11) F(TC,AC,12,1) S(TC,12) \ F(TD,AD,13,1) S(TD,13) F(TE,AE,14,1) S(TE,14) F(TF,AF,15,1) S(TF,15) \ F(TG,AG,16,1) S(TG,16) F(TH,AH,17,1) S(TH,17) F(TI,AI,18,1) S(TI,18) \ F(TJ,AJ,19,1) S(TJ,19) F(TK,AK,20,1) S(TK,20) F(TL,AL,21,1) S(TL,21) \ F(TM,AM,22,1) S(TM,22) F(TN,AN,23,1) S(TN,23) F(TO,AO,24,1) S(TO,24) \ F(TP,AP,25,1) S(TP,25) F(TQ,AQ,26,1) S(TQ,26) F(TR,AR,27,1) S(TR,27) #endif #endif #define PROTOCCALLSFSUB1( UN,LN,T1) \ PROTOCCALLSFSUB14(UN,LN,T1,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB2( UN,LN,T1,T2) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB3( UN,LN,T1,T2,T3) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB4( UN,LN,T1,T2,T3,T4) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB5( UN,LN,T1,T2,T3,T4,T5) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB6( UN,LN,T1,T2,T3,T4,T5,T6) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB7( UN,LN,T1,T2,T3,T4,T5,T6,T7) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB8( UN,LN,T1,T2,T3,T4,T5,T6,T7,T8) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB9( UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB10(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB11(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB12(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,CF_0,CF_0) #define PROTOCCALLSFSUB13(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,CF_0) #define PROTOCCALLSFSUB15(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF) \ PROTOCCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB16(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG) \ PROTOCCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB17(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH) \ PROTOCCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB18(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI) \ PROTOCCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,CF_0,CF_0) #define PROTOCCALLSFSUB19(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ) \ PROTOCCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,CF_0) #define PROTOCCALLSFSUB21(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL) \ PROTOCCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB22(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM) \ PROTOCCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB23(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN) \ PROTOCCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB24(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO) \ PROTOCCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,CF_0,CF_0,CF_0) #define PROTOCCALLSFSUB25(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP) \ PROTOCCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,CF_0,CF_0) #define PROTOCCALLSFSUB26(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ) \ PROTOCCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,CF_0) #ifndef FCALLSC_QUALIFIER #ifdef VISUAL_CPLUSPLUS #define FCALLSC_QUALIFIER __stdcall #else #define FCALLSC_QUALIFIER #endif #endif #ifdef __cplusplus #define CFextern extern "C" #else #define CFextern extern #endif #ifdef CFSUBASFUN #define PROTOCCALLSFSUB0(UN,LN) \ PROTOCCALLSFFUN0( VOID,UN,LN) #define PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ PROTOCCALLSFFUN14(VOID,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) #define PROTOCCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK)\ PROTOCCALLSFFUN20(VOID,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK) #define PROTOCCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR)\ PROTOCCALLSFFUN27(VOID,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) #else /* Note: Prevent compiler warnings, null #define PROTOCCALLSFSUB14/20 after #include-ing cfortran.h if calling the FORTRAN wrapper within the same source code where the wrapper is created. */ #define PROTOCCALLSFSUB0(UN,LN) _(VOID,_cfPU)(CFC_(UN,LN))(); #ifndef __CF__KnR #define PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ _(VOID,_cfPU)(CFC_(UN,LN))( CFARGT14(NCF,KCF,_Z,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) ); #define PROTOCCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK)\ _(VOID,_cfPU)(CFC_(UN,LN))( CFARGT20(NCF,KCF,_Z,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK) ); #define PROTOCCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR)\ _(VOID,_cfPU)(CFC_(UN,LN))( CFARGT27(NCF,KCF,_Z,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) ); #else #define PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ PROTOCCALLSFSUB0(UN,LN) #define PROTOCCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK) \ PROTOCCALLSFSUB0(UN,LN) #define PROTOCCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) \ PROTOCCALLSFSUB0(UN,LN) #endif #endif #ifdef OLD_VAXC /* Allow %CC-I-PARAMNOTUSED. */ #pragma standard #endif #define CCALLSFSUB1( UN,LN,T1, A1) \ CCALLSFSUB5 (UN,LN,T1,CF_0,CF_0,CF_0,CF_0,A1,0,0,0,0) #define CCALLSFSUB2( UN,LN,T1,T2, A1,A2) \ CCALLSFSUB5 (UN,LN,T1,T2,CF_0,CF_0,CF_0,A1,A2,0,0,0) #define CCALLSFSUB3( UN,LN,T1,T2,T3, A1,A2,A3) \ CCALLSFSUB5 (UN,LN,T1,T2,T3,CF_0,CF_0,A1,A2,A3,0,0) #define CCALLSFSUB4( UN,LN,T1,T2,T3,T4, A1,A2,A3,A4)\ CCALLSFSUB5 (UN,LN,T1,T2,T3,T4,CF_0,A1,A2,A3,A4,0) #define CCALLSFSUB5( UN,LN,T1,T2,T3,T4,T5, A1,A2,A3,A4,A5) \ CCALLSFSUB10(UN,LN,T1,T2,T3,T4,T5,CF_0,CF_0,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,0,0,0,0,0) #define CCALLSFSUB6( UN,LN,T1,T2,T3,T4,T5,T6, A1,A2,A3,A4,A5,A6) \ CCALLSFSUB10(UN,LN,T1,T2,T3,T4,T5,T6,CF_0,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,0,0,0,0) #define CCALLSFSUB7( UN,LN,T1,T2,T3,T4,T5,T6,T7, A1,A2,A3,A4,A5,A6,A7) \ CCALLSFSUB10(UN,LN,T1,T2,T3,T4,T5,T6,T7,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,0,0,0) #define CCALLSFSUB8( UN,LN,T1,T2,T3,T4,T5,T6,T7,T8, A1,A2,A3,A4,A5,A6,A7,A8) \ CCALLSFSUB10(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,0,0) #define CCALLSFSUB9( UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,A1,A2,A3,A4,A5,A6,A7,A8,A9)\ CCALLSFSUB10(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,0) #define CCALLSFSUB10(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA)\ CCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,CF_0,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,0,0,0,0) #define CCALLSFSUB11(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB)\ CCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,0,0,0) #define CCALLSFSUB12(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC)\ CCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,0,0) #define CCALLSFSUB13(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD)\ CCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,0) #ifdef __cplusplus #define CPPPROTOCLSFSUB0( UN,LN) #define CPPPROTOCLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) #define CPPPROTOCLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK) #define CPPPROTOCLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) #else #define CPPPROTOCLSFSUB0(UN,LN) \ PROTOCCALLSFSUB0(UN,LN) #define CPPPROTOCLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ PROTOCCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) #define CPPPROTOCLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK) \ PROTOCCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK) #define CPPPROTOCLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) \ PROTOCCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) #endif #ifdef CFSUBASFUN #define CCALLSFSUB0(UN,LN) CCALLSFFUN0(UN,LN) #define CCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE)\ CCALLSFFUN14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE) #else /* do{...}while(0) allows if(a==b) FORT(); else BORT(); */ #define CCALLSFSUB0( UN,LN) do{CPPPROTOCLSFSUB0(UN,LN) CFC_(UN,LN)();}while(0) #define CCALLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE)\ do{VVCF(T1,A1,B1) VVCF(T2,A2,B2) VVCF(T3,A3,B3) VVCF(T4,A4,B4) VVCF(T5,A5,B5) \ VVCF(T6,A6,B6) VVCF(T7,A7,B7) VVCF(T8,A8,B8) VVCF(T9,A9,B9) VVCF(TA,AA,B10) \ VVCF(TB,AB,B11) VVCF(TC,AC,B12) VVCF(TD,AD,B13) VVCF(TE,AE,B14) \ CPPPROTOCLSFSUB14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ ACF(LN,T1,A1,1) ACF(LN,T2,A2,2) ACF(LN,T3,A3,3) \ ACF(LN,T4,A4,4) ACF(LN,T5,A5,5) ACF(LN,T6,A6,6) ACF(LN,T7,A7,7) \ ACF(LN,T8,A8,8) ACF(LN,T9,A9,9) ACF(LN,TA,AA,10) ACF(LN,TB,AB,11) \ ACF(LN,TC,AC,12) ACF(LN,TD,AD,13) ACF(LN,TE,AE,14) \ CFC_(UN,LN)( CFARGTA14(AACF,JCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE) );\ WCF(T1,A1,1) WCF(T2,A2,2) WCF(T3,A3,3) WCF(T4,A4,4) WCF(T5,A5,5) \ WCF(T6,A6,6) WCF(T7,A7,7) WCF(T8,A8,8) WCF(T9,A9,9) WCF(TA,AA,10) \ WCF(TB,AB,11) WCF(TC,AC,12) WCF(TD,AD,13) WCF(TE,AE,14) }while(0) #endif #if MAX_PREPRO_ARGS>31 #define CCALLSFSUB15(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF)\ CCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,CF_0,CF_0,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,0,0,0,0,0) #define CCALLSFSUB16(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG)\ CCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,CF_0,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,0,0,0,0) #define CCALLSFSUB17(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH)\ CCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,0,0,0) #define CCALLSFSUB18(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI)\ CCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,0,0) #define CCALLSFSUB19(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ)\ CCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,0) #ifdef CFSUBASFUN #define CCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH, \ TI,TJ,TK, A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK) \ CCALLSFFUN20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH, \ TI,TJ,TK, A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK) #else #define CCALLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH, \ TI,TJ,TK, A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK) \ do{VVCF(T1,A1,B1) VVCF(T2,A2,B2) VVCF(T3,A3,B3) VVCF(T4,A4,B4) VVCF(T5,A5,B5) \ VVCF(T6,A6,B6) VVCF(T7,A7,B7) VVCF(T8,A8,B8) VVCF(T9,A9,B9) VVCF(TA,AA,B10) \ VVCF(TB,AB,B11) VVCF(TC,AC,B12) VVCF(TD,AD,B13) VVCF(TE,AE,B14) VVCF(TF,AF,B15) \ VVCF(TG,AG,B16) VVCF(TH,AH,B17) VVCF(TI,AI,B18) VVCF(TJ,AJ,B19) VVCF(TK,AK,B20) \ CPPPROTOCLSFSUB20(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK) \ ACF(LN,T1,A1,1) ACF(LN,T2,A2,2) ACF(LN,T3,A3,3) ACF(LN,T4,A4,4) \ ACF(LN,T5,A5,5) ACF(LN,T6,A6,6) ACF(LN,T7,A7,7) ACF(LN,T8,A8,8) \ ACF(LN,T9,A9,9) ACF(LN,TA,AA,10) ACF(LN,TB,AB,11) ACF(LN,TC,AC,12) \ ACF(LN,TD,AD,13) ACF(LN,TE,AE,14) ACF(LN,TF,AF,15) ACF(LN,TG,AG,16) \ ACF(LN,TH,AH,17) ACF(LN,TI,AI,18) ACF(LN,TJ,AJ,19) ACF(LN,TK,AK,20) \ CFC_(UN,LN)( CFARGTA20(AACF,JCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK) ); \ WCF(T1,A1,1) WCF(T2,A2,2) WCF(T3,A3,3) WCF(T4,A4,4) WCF(T5,A5,5) WCF(T6,A6,6) \ WCF(T7,A7,7) WCF(T8,A8,8) WCF(T9,A9,9) WCF(TA,AA,10) WCF(TB,AB,11) WCF(TC,AC,12) \ WCF(TD,AD,13) WCF(TE,AE,14) WCF(TF,AF,15) WCF(TG,AG,16) WCF(TH,AH,17) WCF(TI,AI,18) \ WCF(TJ,AJ,19) WCF(TK,AK,20) }while(0) #endif #endif /* MAX_PREPRO_ARGS */ #if MAX_PREPRO_ARGS>31 #define CCALLSFSUB21(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL)\ CCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,0,0,0,0,0,0) #define CCALLSFSUB22(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM)\ CCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,CF_0,CF_0,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,0,0,0,0,0) #define CCALLSFSUB23(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN)\ CCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,CF_0,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,0,0,0,0) #define CCALLSFSUB24(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,AO)\ CCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,AO,0,0,0) #define CCALLSFSUB25(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,AO,AP)\ CCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,AO,AP,0,0) #define CCALLSFSUB26(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,AO,AP,AQ)\ CCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,AO,AP,AQ,0) #ifdef CFSUBASFUN #define CCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR, \ A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,AO,AP,AQ,AR) \ CCALLSFFUN27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR, \ A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,AO,AP,AQ,AR) #else #define CCALLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR, \ A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,AO,AP,AQ,AR) \ do{VVCF(T1,A1,B1) VVCF(T2,A2,B2) VVCF(T3,A3,B3) VVCF(T4,A4,B4) VVCF(T5,A5,B5) \ VVCF(T6,A6,B6) VVCF(T7,A7,B7) VVCF(T8,A8,B8) VVCF(T9,A9,B9) VVCF(TA,AA,B10) \ VVCF(TB,AB,B11) VVCF(TC,AC,B12) VVCF(TD,AD,B13) VVCF(TE,AE,B14) VVCF(TF,AF,B15) \ VVCF(TG,AG,B16) VVCF(TH,AH,B17) VVCF(TI,AI,B18) VVCF(TJ,AJ,B19) VVCF(TK,AK,B20) \ VVCF(TL,AL,B21) VVCF(TM,AM,B22) VVCF(TN,AN,B23) VVCF(TO,AO,B24) VVCF(TP,AP,B25) \ VVCF(TQ,AQ,B26) VVCF(TR,AR,B27) \ CPPPROTOCLSFSUB27(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) \ ACF(LN,T1,A1,1) ACF(LN,T2,A2,2) ACF(LN,T3,A3,3) ACF(LN,T4,A4,4) \ ACF(LN,T5,A5,5) ACF(LN,T6,A6,6) ACF(LN,T7,A7,7) ACF(LN,T8,A8,8) \ ACF(LN,T9,A9,9) ACF(LN,TA,AA,10) ACF(LN,TB,AB,11) ACF(LN,TC,AC,12) \ ACF(LN,TD,AD,13) ACF(LN,TE,AE,14) ACF(LN,TF,AF,15) ACF(LN,TG,AG,16) \ ACF(LN,TH,AH,17) ACF(LN,TI,AI,18) ACF(LN,TJ,AJ,19) ACF(LN,TK,AK,20) \ ACF(LN,TL,AL,21) ACF(LN,TM,AM,22) ACF(LN,TN,AN,23) ACF(LN,TO,AO,24) \ ACF(LN,TP,AP,25) ACF(LN,TQ,AQ,26) ACF(LN,TR,AR,27) \ CFC_(UN,LN)( CFARGTA27(AACF,JCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR,\ A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE,AF,AG,AH,AI,AJ,AK,AL,AM,AN,AO,AP,AQ,AR) ); \ WCF(T1,A1,1) WCF(T2,A2,2) WCF(T3,A3,3) WCF(T4,A4,4) WCF(T5,A5,5) WCF(T6,A6,6) \ WCF(T7,A7,7) WCF(T8,A8,8) WCF(T9,A9,9) WCF(TA,AA,10) WCF(TB,AB,11) WCF(TC,AC,12) \ WCF(TD,AD,13) WCF(TE,AE,14) WCF(TF,AF,15) WCF(TG,AG,16) WCF(TH,AH,17) WCF(TI,AI,18) \ WCF(TJ,AJ,19) WCF(TK,AK,20) WCF(TL,AL,21) WCF(TM,AM,22) WCF(TN,AN,23) WCF(TO,AO,24) \ WCF(TP,AP,25) WCF(TQ,AQ,26) WCF(TR,AR,27) }while(0) #endif #endif /* MAX_PREPRO_ARGS */ /*-------------------------------------------------------------------------*/ /* UTILITIES FOR C TO CALL FORTRAN FUNCTIONS */ /*N.B. PROTOCCALLSFFUNn(..) generates code, whether or not the FORTRAN function is called. Therefore, especially for creator's of C header files for large FORTRAN libraries which include many functions, to reduce compile time and object code size, it may be desirable to create preprocessor directives to allow users to create code for only those functions which they use. */ /* The following defines the maximum length string that a function can return. Of course it may be undefine-d and re-define-d before individual PROTOCCALLSFFUNn(..) as required. It would also be nice to have this derived from the individual machines' limits. */ #define MAX_LEN_FORTRAN_FUNCTION_STRING 0x4FE /* The following defines a character used by CFORTRAN.H to flag the end of a string coming out of a FORTRAN routine. */ #define CFORTRAN_NON_CHAR 0x7F #ifdef OLD_VAXC /* Prevent %CC-I-PARAMNOTUSED. */ #pragma nostandard #endif #define _SEP_(TN,C,cfCOMMA) _(__SEP_,C)(TN,cfCOMMA) #define __SEP_0(TN,cfCOMMA) #define __SEP_1(TN,cfCOMMA) _Icf(2,SEP,TN,cfCOMMA,0) #define INT_cfSEP(T,B) _(A,B) #define INTV_cfSEP(T,B) INT_cfSEP(T,B) #define INTVV_cfSEP(T,B) INT_cfSEP(T,B) #define INTVVV_cfSEP(T,B) INT_cfSEP(T,B) #define INTVVVV_cfSEP(T,B) INT_cfSEP(T,B) #define INTVVVVV_cfSEP(T,B) INT_cfSEP(T,B) #define INTVVVVVV_cfSEP(T,B) INT_cfSEP(T,B) #define INTVVVVVVV_cfSEP(T,B) INT_cfSEP(T,B) #define PINT_cfSEP(T,B) INT_cfSEP(T,B) #define PVOID_cfSEP(T,B) INT_cfSEP(T,B) #define ROUTINE_cfSEP(T,B) INT_cfSEP(T,B) #define SIMPLE_cfSEP(T,B) INT_cfSEP(T,B) #define VOID_cfSEP(T,B) INT_cfSEP(T,B) /* For FORTRAN calls C subr.s.*/ #define STRING_cfSEP(T,B) INT_cfSEP(T,B) #define STRINGV_cfSEP(T,B) INT_cfSEP(T,B) #define PSTRING_cfSEP(T,B) INT_cfSEP(T,B) #define PSTRINGV_cfSEP(T,B) INT_cfSEP(T,B) #define PNSTRING_cfSEP(T,B) INT_cfSEP(T,B) #define PPSTRING_cfSEP(T,B) INT_cfSEP(T,B) #define ZTRINGV_cfSEP(T,B) INT_cfSEP(T,B) #define PZTRINGV_cfSEP(T,B) INT_cfSEP(T,B) #if defined(SIGNED_BYTE) || !defined(UNSIGNED_BYTE) #ifdef OLD_VAXC #define INTEGER_BYTE char /* Old VAXC barfs on 'signed char' */ #else #define INTEGER_BYTE signed char /* default */ #endif #else #define INTEGER_BYTE unsigned char #endif #define BYTEVVVVVVV_cfTYPE INTEGER_BYTE #define DOUBLEVVVVVVV_cfTYPE DOUBLE_PRECISION #define FLOATVVVVVVV_cfTYPE FORTRAN_REAL #define INTVVVVVVV_cfTYPE int #define LOGICALVVVVVVV_cfTYPE int #define LONGVVVVVVV_cfTYPE long #define LONGLONGVVVVVVV_cfTYPE LONGLONG /* added by MR December 2005 */ #define SHORTVVVVVVV_cfTYPE short #define PBYTE_cfTYPE INTEGER_BYTE #define PDOUBLE_cfTYPE DOUBLE_PRECISION #define PFLOAT_cfTYPE FORTRAN_REAL #define PINT_cfTYPE int #define PLOGICAL_cfTYPE int #define PLONG_cfTYPE long #define PLONGLONG_cfTYPE LONGLONG /* added by MR December 2005 */ #define PSHORT_cfTYPE short #define CFARGS0(A,T,V,W,X,Y,Z) _3(T,_cf,A) #define CFARGS1(A,T,V,W,X,Y,Z) _3(T,_cf,A)(V) #define CFARGS2(A,T,V,W,X,Y,Z) _3(T,_cf,A)(V,W) #define CFARGS3(A,T,V,W,X,Y,Z) _3(T,_cf,A)(V,W,X) #define CFARGS4(A,T,V,W,X,Y,Z) _3(T,_cf,A)(V,W,X,Y) #define CFARGS5(A,T,V,W,X,Y,Z) _3(T,_cf,A)(V,W,X,Y,Z) #define _Icf(N,T,I,X,Y) _(I,_cfINT)(N,T,I,X,Y,0) #define _Icf4(N,T,I,X,Y,Z) _(I,_cfINT)(N,T,I,X,Y,Z) #define BYTE_cfINT(N,A,B,X,Y,Z) DOUBLE_cfINT(N,A,B,X,Y,Z) #define DOUBLE_cfINT(N,A,B,X,Y,Z) _(CFARGS,N)(A,INT,B,X,Y,Z,0) #define FLOAT_cfINT(N,A,B,X,Y,Z) DOUBLE_cfINT(N,A,B,X,Y,Z) #define INT_cfINT(N,A,B,X,Y,Z) DOUBLE_cfINT(N,A,B,X,Y,Z) #define LOGICAL_cfINT(N,A,B,X,Y,Z) DOUBLE_cfINT(N,A,B,X,Y,Z) #define LONG_cfINT(N,A,B,X,Y,Z) DOUBLE_cfINT(N,A,B,X,Y,Z) #define LONGLONG_cfINT(N,A,B,X,Y,Z) DOUBLE_cfINT(N,A,B,X,Y,Z) /* added by MR December 2005 */ #define SHORT_cfINT(N,A,B,X,Y,Z) DOUBLE_cfINT(N,A,B,X,Y,Z) #define PBYTE_cfINT(N,A,B,X,Y,Z) PDOUBLE_cfINT(N,A,B,X,Y,Z) #define PDOUBLE_cfINT(N,A,B,X,Y,Z) _(CFARGS,N)(A,PINT,B,X,Y,Z,0) #define PFLOAT_cfINT(N,A,B,X,Y,Z) PDOUBLE_cfINT(N,A,B,X,Y,Z) #define PINT_cfINT(N,A,B,X,Y,Z) PDOUBLE_cfINT(N,A,B,X,Y,Z) #define PLOGICAL_cfINT(N,A,B,X,Y,Z) PDOUBLE_cfINT(N,A,B,X,Y,Z) #define PLONG_cfINT(N,A,B,X,Y,Z) PDOUBLE_cfINT(N,A,B,X,Y,Z) #define PLONGLONG_cfINT(N,A,B,X,Y,Z) PDOUBLE_cfINT(N,A,B,X,Y,Z) /* added by MR December 2005 */ #define PSHORT_cfINT(N,A,B,X,Y,Z) PDOUBLE_cfINT(N,A,B,X,Y,Z) #define BYTEV_cfINT(N,A,B,X,Y,Z) DOUBLEV_cfINT(N,A,B,X,Y,Z) #define BYTEVV_cfINT(N,A,B,X,Y,Z) DOUBLEVV_cfINT(N,A,B,X,Y,Z) #define BYTEVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVV_cfINT(N,A,B,X,Y,Z) #define BYTEVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVV_cfINT(N,A,B,X,Y,Z) #define BYTEVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVV_cfINT(N,A,B,X,Y,Z) #define BYTEVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVV_cfINT(N,A,B,X,Y,Z) #define BYTEVVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVVV_cfINT(N,A,B,X,Y,Z) #define DOUBLEV_cfINT(N,A,B,X,Y,Z) _(CFARGS,N)(A,INTV,B,X,Y,Z,0) #define DOUBLEVV_cfINT(N,A,B,X,Y,Z) _(CFARGS,N)(A,INTVV,B,X,Y,Z,0) #define DOUBLEVVV_cfINT(N,A,B,X,Y,Z) _(CFARGS,N)(A,INTVVV,B,X,Y,Z,0) #define DOUBLEVVVV_cfINT(N,A,B,X,Y,Z) _(CFARGS,N)(A,INTVVVV,B,X,Y,Z,0) #define DOUBLEVVVVV_cfINT(N,A,B,X,Y,Z) _(CFARGS,N)(A,INTVVVVV,B,X,Y,Z,0) #define DOUBLEVVVVVV_cfINT(N,A,B,X,Y,Z) _(CFARGS,N)(A,INTVVVVVV,B,X,Y,Z,0) #define DOUBLEVVVVVVV_cfINT(N,A,B,X,Y,Z) _(CFARGS,N)(A,INTVVVVVVV,B,X,Y,Z,0) #define FLOATV_cfINT(N,A,B,X,Y,Z) DOUBLEV_cfINT(N,A,B,X,Y,Z) #define FLOATVV_cfINT(N,A,B,X,Y,Z) DOUBLEVV_cfINT(N,A,B,X,Y,Z) #define FLOATVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVV_cfINT(N,A,B,X,Y,Z) #define FLOATVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVV_cfINT(N,A,B,X,Y,Z) #define FLOATVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVV_cfINT(N,A,B,X,Y,Z) #define FLOATVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVV_cfINT(N,A,B,X,Y,Z) #define FLOATVVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVVV_cfINT(N,A,B,X,Y,Z) #define INTV_cfINT(N,A,B,X,Y,Z) DOUBLEV_cfINT(N,A,B,X,Y,Z) #define INTVV_cfINT(N,A,B,X,Y,Z) DOUBLEVV_cfINT(N,A,B,X,Y,Z) #define INTVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVV_cfINT(N,A,B,X,Y,Z) #define INTVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVV_cfINT(N,A,B,X,Y,Z) #define INTVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVV_cfINT(N,A,B,X,Y,Z) #define INTVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVV_cfINT(N,A,B,X,Y,Z) #define INTVVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVVV_cfINT(N,A,B,X,Y,Z) #define LOGICALV_cfINT(N,A,B,X,Y,Z) DOUBLEV_cfINT(N,A,B,X,Y,Z) #define LOGICALVV_cfINT(N,A,B,X,Y,Z) DOUBLEVV_cfINT(N,A,B,X,Y,Z) #define LOGICALVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVV_cfINT(N,A,B,X,Y,Z) #define LOGICALVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVV_cfINT(N,A,B,X,Y,Z) #define LOGICALVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVV_cfINT(N,A,B,X,Y,Z) #define LOGICALVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVV_cfINT(N,A,B,X,Y,Z) #define LOGICALVVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVVV_cfINT(N,A,B,X,Y,Z) #define LONGV_cfINT(N,A,B,X,Y,Z) DOUBLEV_cfINT(N,A,B,X,Y,Z) #define LONGVV_cfINT(N,A,B,X,Y,Z) DOUBLEVV_cfINT(N,A,B,X,Y,Z) #define LONGVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVV_cfINT(N,A,B,X,Y,Z) #define LONGVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVV_cfINT(N,A,B,X,Y,Z) #define LONGVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVV_cfINT(N,A,B,X,Y,Z) #define LONGVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVV_cfINT(N,A,B,X,Y,Z) #define LONGVVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVVV_cfINT(N,A,B,X,Y,Z) #define LONGLONGV_cfINT(N,A,B,X,Y,Z) DOUBLEV_cfINT(N,A,B,X,Y,Z) /* added by MR December 2005 */ #define LONGLONGVV_cfINT(N,A,B,X,Y,Z) DOUBLEVV_cfINT(N,A,B,X,Y,Z) /* added by MR December 2005 */ #define LONGLONGVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVV_cfINT(N,A,B,X,Y,Z) /* added by MR December 2005 */ #define LONGLONGVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVV_cfINT(N,A,B,X,Y,Z) /* added by MR December 2005 */ #define LONGLONGVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVV_cfINT(N,A,B,X,Y,Z) /* added by MR December 2005 */ #define LONGLONGVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVV_cfINT(N,A,B,X,Y,Z) /* added by MR December 2005 */ #define LONGLONGVVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVVV_cfINT(N,A,B,X,Y,Z) /* added by MR December 2005 */ #define SHORTV_cfINT(N,A,B,X,Y,Z) DOUBLEV_cfINT(N,A,B,X,Y,Z) #define SHORTVV_cfINT(N,A,B,X,Y,Z) DOUBLEVV_cfINT(N,A,B,X,Y,Z) #define SHORTVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVV_cfINT(N,A,B,X,Y,Z) #define SHORTVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVV_cfINT(N,A,B,X,Y,Z) #define SHORTVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVV_cfINT(N,A,B,X,Y,Z) #define SHORTVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVV_cfINT(N,A,B,X,Y,Z) #define SHORTVVVVVVV_cfINT(N,A,B,X,Y,Z) DOUBLEVVVVVVV_cfINT(N,A,B,X,Y,Z) #define PVOID_cfINT(N,A,B,X,Y,Z) _(CFARGS,N)(A,B,B,X,Y,Z,0) #define ROUTINE_cfINT(N,A,B,X,Y,Z) PVOID_cfINT(N,A,B,X,Y,Z) /*CRAY coughs on the first, i.e. the usual trouble of not being able to define macros to macros with arguments. New ultrix is worse, it coughs on all such uses. */ /*#define SIMPLE_cfINT PVOID_cfINT*/ #define SIMPLE_cfINT(N,A,B,X,Y,Z) PVOID_cfINT(N,A,B,X,Y,Z) #define VOID_cfINT(N,A,B,X,Y,Z) PVOID_cfINT(N,A,B,X,Y,Z) #define STRING_cfINT(N,A,B,X,Y,Z) PVOID_cfINT(N,A,B,X,Y,Z) #define STRINGV_cfINT(N,A,B,X,Y,Z) PVOID_cfINT(N,A,B,X,Y,Z) #define PSTRING_cfINT(N,A,B,X,Y,Z) PVOID_cfINT(N,A,B,X,Y,Z) #define PSTRINGV_cfINT(N,A,B,X,Y,Z) PVOID_cfINT(N,A,B,X,Y,Z) #define PNSTRING_cfINT(N,A,B,X,Y,Z) PVOID_cfINT(N,A,B,X,Y,Z) #define PPSTRING_cfINT(N,A,B,X,Y,Z) PVOID_cfINT(N,A,B,X,Y,Z) #define ZTRINGV_cfINT(N,A,B,X,Y,Z) PVOID_cfINT(N,A,B,X,Y,Z) #define PZTRINGV_cfINT(N,A,B,X,Y,Z) PVOID_cfINT(N,A,B,X,Y,Z) #define CF_0_cfINT(N,A,B,X,Y,Z) #define UCF(TN,I,C) _SEP_(TN,C,cfCOMMA) _Icf(2,U,TN,_(A,I),0) #define UUCF(TN,I,C) _SEP_(TN,C,cfCOMMA) _SEP_(TN,1,I) #define UUUCF(TN,I,C) _SEP_(TN,C,cfCOLON) _Icf(2,U,TN,_(A,I),0) #define INT_cfU(T,A) _(T,VVVVVVV_cfTYPE) A #define INTV_cfU(T,A) _(T,VVVVVV_cfTYPE) * A #define INTVV_cfU(T,A) _(T,VVVVV_cfTYPE) * A #define INTVVV_cfU(T,A) _(T,VVVV_cfTYPE) * A #define INTVVVV_cfU(T,A) _(T,VVV_cfTYPE) * A #define INTVVVVV_cfU(T,A) _(T,VV_cfTYPE) * A #define INTVVVVVV_cfU(T,A) _(T,V_cfTYPE) * A #define INTVVVVVVV_cfU(T,A) _(T,_cfTYPE) * A #define PINT_cfU(T,A) _(T,_cfTYPE) * A #define PVOID_cfU(T,A) void *A #define ROUTINE_cfU(T,A) void (*A)(CF_NULL_PROTO) #define VOID_cfU(T,A) void A /* Needed for C calls FORTRAN sub.s. */ #define STRING_cfU(T,A) char *A /* via VOID and wrapper. */ #define STRINGV_cfU(T,A) char *A #define PSTRING_cfU(T,A) char *A #define PSTRINGV_cfU(T,A) char *A #define ZTRINGV_cfU(T,A) char *A #define PZTRINGV_cfU(T,A) char *A /* VOID breaks U into U and UU. */ #define INT_cfUU(T,A) _(T,VVVVVVV_cfTYPE) A #define VOID_cfUU(T,A) /* Needed for FORTRAN calls C sub.s. */ #define STRING_cfUU(T,A) char *A #define BYTE_cfPU(A) CFextern INTEGER_BYTE FCALLSC_QUALIFIER A #define DOUBLE_cfPU(A) CFextern DOUBLE_PRECISION FCALLSC_QUALIFIER A #if ! (defined(FLOATFUNCTIONTYPE)&&defined(ASSIGNFLOAT)&&defined(RETURNFLOAT)) #if defined (f2cFortran) && ! defined (gFortran) /* f2c/g77 return double from FORTRAN REAL functions. (KMCCARTY, 2005/12/09) */ #define FLOAT_cfPU(A) CFextern DOUBLE_PRECISION FCALLSC_QUALIFIER A #else #define FLOAT_cfPU(A) CFextern FORTRAN_REAL FCALLSC_QUALIFIER A #endif #else #define FLOAT_cfPU(A) CFextern FLOATFUNCTIONTYPE FCALLSC_QUALIFIER A #endif #define INT_cfPU(A) CFextern int FCALLSC_QUALIFIER A #define LOGICAL_cfPU(A) CFextern int FCALLSC_QUALIFIER A #define LONG_cfPU(A) CFextern long FCALLSC_QUALIFIER A #define SHORT_cfPU(A) CFextern short FCALLSC_QUALIFIER A #define STRING_cfPU(A) CFextern void FCALLSC_QUALIFIER A #define VOID_cfPU(A) CFextern void FCALLSC_QUALIFIER A #define BYTE_cfE INTEGER_BYTE A0; #define DOUBLE_cfE DOUBLE_PRECISION A0; #if ! (defined(FLOATFUNCTIONTYPE)&&defined(ASSIGNFLOAT)&&defined(RETURNFLOAT)) #define FLOAT_cfE FORTRAN_REAL A0; #else #define FLOAT_cfE FORTRAN_REAL AA0; FLOATFUNCTIONTYPE A0; #endif #define INT_cfE int A0; #define LOGICAL_cfE int A0; #define LONG_cfE long A0; #define SHORT_cfE short A0; #define VOID_cfE #ifdef vmsFortran #define STRING_cfE static char AA0[1+MAX_LEN_FORTRAN_FUNCTION_STRING]; \ static fstring A0 = \ {MAX_LEN_FORTRAN_FUNCTION_STRING,DSC$K_DTYPE_T,DSC$K_CLASS_S,AA0};\ memset(AA0, CFORTRAN_NON_CHAR, MAX_LEN_FORTRAN_FUNCTION_STRING);\ *(AA0+MAX_LEN_FORTRAN_FUNCTION_STRING)='\0'; #else #ifdef CRAYFortran #define STRING_cfE static char AA0[1+MAX_LEN_FORTRAN_FUNCTION_STRING]; \ static _fcd A0; *(AA0+MAX_LEN_FORTRAN_FUNCTION_STRING)='\0';\ memset(AA0,CFORTRAN_NON_CHAR, MAX_LEN_FORTRAN_FUNCTION_STRING);\ A0 = _cptofcd(AA0,MAX_LEN_FORTRAN_FUNCTION_STRING); #else /* 'cc: SC3.0.1 13 Jul 1994' barfs on char A0[0x4FE+1]; * char A0[0x4FE +1]; char A0[1+0x4FE]; are both OK. */ #define STRING_cfE static char A0[1+MAX_LEN_FORTRAN_FUNCTION_STRING]; \ memset(A0, CFORTRAN_NON_CHAR, \ MAX_LEN_FORTRAN_FUNCTION_STRING); \ *(A0+MAX_LEN_FORTRAN_FUNCTION_STRING)='\0'; #endif #endif /* ESTRING must use static char. array which is guaranteed to exist after function returns. */ /* N.B.i) The diff. for 0 (Zero) and >=1 arguments. ii)That the following create an unmatched bracket, i.e. '(', which must of course be matched in the call. iii)Commas must be handled very carefully */ #define INT_cfGZ(T,UN,LN) A0=CFC_(UN,LN)( #define VOID_cfGZ(T,UN,LN) CFC_(UN,LN)( #ifdef vmsFortran #define STRING_cfGZ(T,UN,LN) CFC_(UN,LN)(&A0 #else #if defined(CRAYFortran) || defined(AbsoftUNIXFortran) || defined(AbsoftProFortran) #define STRING_cfGZ(T,UN,LN) CFC_(UN,LN)( A0 #else #define STRING_cfGZ(T,UN,LN) CFC_(UN,LN)( A0,MAX_LEN_FORTRAN_FUNCTION_STRING #endif #endif #define INT_cfG(T,UN,LN) INT_cfGZ(T,UN,LN) #define VOID_cfG(T,UN,LN) VOID_cfGZ(T,UN,LN) #define STRING_cfG(T,UN,LN) STRING_cfGZ(T,UN,LN), /*, is only diff. from _cfG*/ #define BYTEVVVVVVV_cfPP #define INTVVVVVVV_cfPP /* These complement FLOATVVVVVVV_cfPP. */ #define DOUBLEVVVVVVV_cfPP #define LOGICALVVVVVVV_cfPP #define LONGVVVVVVV_cfPP #define SHORTVVVVVVV_cfPP #define PBYTE_cfPP #define PINT_cfPP #define PDOUBLE_cfPP #define PLOGICAL_cfPP #define PLONG_cfPP #define PSHORT_cfPP #define PFLOAT_cfPP FLOATVVVVVVV_cfPP #define BCF(TN,AN,C) _SEP_(TN,C,cfCOMMA) _Icf(2,B,TN,AN,0) #define INT_cfB(T,A) (_(T,VVVVVVV_cfTYPE)) A #define INTV_cfB(T,A) A #define INTVV_cfB(T,A) (A)[0] #define INTVVV_cfB(T,A) (A)[0][0] #define INTVVVV_cfB(T,A) (A)[0][0][0] #define INTVVVVV_cfB(T,A) (A)[0][0][0][0] #define INTVVVVVV_cfB(T,A) (A)[0][0][0][0][0] #define INTVVVVVVV_cfB(T,A) (A)[0][0][0][0][0][0] #define PINT_cfB(T,A) _(T,_cfPP)&A #define STRING_cfB(T,A) (char *) A #define STRINGV_cfB(T,A) (char *) A #define PSTRING_cfB(T,A) (char *) A #define PSTRINGV_cfB(T,A) (char *) A #define PVOID_cfB(T,A) (void *) A #define ROUTINE_cfB(T,A) (cfCAST_FUNCTION)A #define ZTRINGV_cfB(T,A) (char *) A #define PZTRINGV_cfB(T,A) (char *) A #define SCF(TN,NAME,I,A) _(TN,_cfSTR)(3,S,NAME,I,A,0,0) #define DEFAULT_cfS(M,I,A) #define LOGICAL_cfS(M,I,A) #define PLOGICAL_cfS(M,I,A) #define STRING_cfS(M,I,A) ,sizeof(A) #define STRINGV_cfS(M,I,A) ,( (unsigned)0xFFFF*firstindexlength(A) \ +secondindexlength(A)) #define PSTRING_cfS(M,I,A) ,sizeof(A) #define PSTRINGV_cfS(M,I,A) STRINGV_cfS(M,I,A) #define ZTRINGV_cfS(M,I,A) #define PZTRINGV_cfS(M,I,A) #define HCF(TN,I) _(TN,_cfSTR)(3,H,cfCOMMA, H,_(C,I),0,0) #define HHCF(TN,I) _(TN,_cfSTR)(3,H,cfCOMMA,HH,_(C,I),0,0) #define HHHCF(TN,I) _(TN,_cfSTR)(3,H,cfCOLON, H,_(C,I),0,0) #define H_CF_SPECIAL unsigned #define HH_CF_SPECIAL #define DEFAULT_cfH(M,I,A) #define LOGICAL_cfH(S,U,B) #define PLOGICAL_cfH(S,U,B) #define STRING_cfH(S,U,B) _(A,S) _(U,_CF_SPECIAL) B #define STRINGV_cfH(S,U,B) STRING_cfH(S,U,B) #define PSTRING_cfH(S,U,B) STRING_cfH(S,U,B) #define PSTRINGV_cfH(S,U,B) STRING_cfH(S,U,B) #define PNSTRING_cfH(S,U,B) STRING_cfH(S,U,B) #define PPSTRING_cfH(S,U,B) STRING_cfH(S,U,B) #define ZTRINGV_cfH(S,U,B) #define PZTRINGV_cfH(S,U,B) /* Need VOID_cfSTR because Absoft forced function types go through _cfSTR. */ /* No spaces inside expansion. They screws up macro catenation kludge. */ #define VOID_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define BYTE_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define DOUBLE_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define FLOAT_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define INT_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LOGICAL_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,LOGICAL,A,B,C,D,E) #define LONG_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LONGLONG_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) /* added by MR December 2005 */ #define SHORT_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define BYTEV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define BYTEVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define BYTEVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define BYTEVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define BYTEVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define BYTEVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define BYTEVVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define DOUBLEV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define DOUBLEVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define DOUBLEVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define DOUBLEVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define DOUBLEVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define DOUBLEVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define DOUBLEVVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define FLOATV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define FLOATVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define FLOATVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define FLOATVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define FLOATVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define FLOATVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define FLOATVVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define INTV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define INTVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define INTVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define INTVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define INTVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define INTVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define INTVVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LOGICALV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LOGICALVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LOGICALVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LOGICALVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LOGICALVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LOGICALVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LOGICALVVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LONGV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LONGVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LONGVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LONGVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LONGVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LONGVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LONGVVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define LONGLONGV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) /* added by MR December 2005 */ #define LONGLONGVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) /* added by MR December 2005 */ #define LONGLONGVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) /* added by MR December 2005 */ #define LONGLONGVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) /* added by MR December 2005 */ #define LONGLONGVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) /* added by MR December 2005 */ #define LONGLONGVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) /* added by MR December 2005 */ #define LONGLONGVVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) /* added by MR December 2005 */ #define SHORTV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define SHORTVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define SHORTVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define SHORTVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define SHORTVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define SHORTVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define SHORTVVVVVVV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define PBYTE_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define PDOUBLE_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define PFLOAT_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define PINT_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define PLOGICAL_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,PLOGICAL,A,B,C,D,E) #define PLONG_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define PLONGLONG_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) /* added by MR December 2005 */ #define PSHORT_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define STRING_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,STRING,A,B,C,D,E) #define PSTRING_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,PSTRING,A,B,C,D,E) #define STRINGV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,STRINGV,A,B,C,D,E) #define PSTRINGV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,PSTRINGV,A,B,C,D,E) #define PNSTRING_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,PNSTRING,A,B,C,D,E) #define PPSTRING_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,PPSTRING,A,B,C,D,E) #define PVOID_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define ROUTINE_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define SIMPLE_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,DEFAULT,A,B,C,D,E) #define ZTRINGV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,ZTRINGV,A,B,C,D,E) #define PZTRINGV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,PZTRINGV,A,B,C,D,E) #define CF_0_cfSTR(N,T,A,B,C,D,E) /* See ACF table comments, which explain why CCF was split into two. */ #define CCF(NAME,TN,I) _(TN,_cfSTR)(5,C,NAME,I,_(A,I),_(B,I),_(C,I)) #define DEFAULT_cfC(M,I,A,B,C) #define LOGICAL_cfC(M,I,A,B,C) A=C2FLOGICAL( A); #define PLOGICAL_cfC(M,I,A,B,C) *A=C2FLOGICAL(*A); #ifdef vmsFortran #define STRING_cfC(M,I,A,B,C) (B.clen=strlen(A),B.f.dsc$a_pointer=A, \ C==sizeof(char*)||C==(unsigned)(B.clen+1)?B.f.dsc$w_length=B.clen: \ (memset((A)+B.clen,' ',C-B.clen-1),A[B.f.dsc$w_length=C-1]='\0')); /* PSTRING_cfC to beware of array A which does not contain any \0. */ #define PSTRING_cfC(M,I,A,B,C) (B.dsc$a_pointer=A, C==sizeof(char*) ? \ B.dsc$w_length=strlen(A): (A[C-1]='\0',B.dsc$w_length=strlen(A), \ memset((A)+B.dsc$w_length,' ',C-B.dsc$w_length-1), B.dsc$w_length=C-1)); #else #define STRING_cfC(M,I,A,B,C) (B.nombre=A,B.clen=strlen(A), \ C==sizeof(char*)||C==(unsigned)(B.clen+1)?B.flen=B.clen: \ (memset(B.nombre+B.clen,' ',C-B.clen-1),B.nombre[B.flen=C-1]='\0')); #define PSTRING_cfC(M,I,A,B,C) (C==sizeof(char*)? B=strlen(A): \ (A[C-1]='\0',B=strlen(A),memset((A)+B,' ',C-B-1),B=C-1)); #endif /* For CRAYFortran for (P)STRINGV_cfC, B.fs is set, but irrelevant. */ #define STRINGV_cfC(M,I,A,B,C) \ AATRINGV_cfA( A,B,(C/0xFFFF)*(C%0xFFFF),C/0xFFFF,C%0xFFFF) #define PSTRINGV_cfC(M,I,A,B,C) \ APATRINGV_cfA( A,B,(C/0xFFFF)*(C%0xFFFF),C/0xFFFF,C%0xFFFF) #define ZTRINGV_cfC(M,I,A,B,C) \ AATRINGV_cfA( A,B, (_3(M,_ELEMS_,I))*((_3(M,_ELEMLEN_,I))+1), \ (_3(M,_ELEMS_,I)), (_3(M,_ELEMLEN_,I))+1 ) #define PZTRINGV_cfC(M,I,A,B,C) \ APATRINGV_cfA( A,B, (_3(M,_ELEMS_,I))*((_3(M,_ELEMLEN_,I))+1), \ (_3(M,_ELEMS_,I)), (_3(M,_ELEMLEN_,I))+1 ) #define BYTE_cfCCC(A,B) &A #define DOUBLE_cfCCC(A,B) &A #if !defined(__CF__KnR) #define FLOAT_cfCCC(A,B) &A /* Although the VAX doesn't, at least the */ #else /* HP and K&R mips promote float arg.'s of */ #define FLOAT_cfCCC(A,B) &B /* unprototyped functions to double. Cannot */ #endif /* use A here to pass the argument to FORTRAN. */ #define INT_cfCCC(A,B) &A #define LOGICAL_cfCCC(A,B) &A #define LONG_cfCCC(A,B) &A #define SHORT_cfCCC(A,B) &A #define PBYTE_cfCCC(A,B) A #define PDOUBLE_cfCCC(A,B) A #define PFLOAT_cfCCC(A,B) A #define PINT_cfCCC(A,B) A #define PLOGICAL_cfCCC(A,B) B=A /* B used to keep a common W table. */ #define PLONG_cfCCC(A,B) A #define PSHORT_cfCCC(A,B) A #define CCCF(TN,I,M) _SEP_(TN,M,cfCOMMA) _Icf(3,CC,TN,_(A,I),_(B,I)) #define INT_cfCC(T,A,B) _(T,_cfCCC)(A,B) #define INTV_cfCC(T,A,B) A #define INTVV_cfCC(T,A,B) A #define INTVVV_cfCC(T,A,B) A #define INTVVVV_cfCC(T,A,B) A #define INTVVVVV_cfCC(T,A,B) A #define INTVVVVVV_cfCC(T,A,B) A #define INTVVVVVVV_cfCC(T,A,B) A #define PINT_cfCC(T,A,B) _(T,_cfCCC)(A,B) #define PVOID_cfCC(T,A,B) A #if defined(apolloFortran) || defined(hpuxFortran800) || defined(AbsoftUNIXFortran) #define ROUTINE_cfCC(T,A,B) &A #else #define ROUTINE_cfCC(T,A,B) A #endif #define SIMPLE_cfCC(T,A,B) A #ifdef vmsFortran #define STRING_cfCC(T,A,B) &B.f #define STRINGV_cfCC(T,A,B) &B #define PSTRING_cfCC(T,A,B) &B #define PSTRINGV_cfCC(T,A,B) &B #else #ifdef CRAYFortran #define STRING_cfCC(T,A,B) _cptofcd(A,B.flen) #define STRINGV_cfCC(T,A,B) _cptofcd(B.s,B.flen) #define PSTRING_cfCC(T,A,B) _cptofcd(A,B) #define PSTRINGV_cfCC(T,A,B) _cptofcd(A,B.flen) #else #define STRING_cfCC(T,A,B) A #define STRINGV_cfCC(T,A,B) B.fs #define PSTRING_cfCC(T,A,B) A #define PSTRINGV_cfCC(T,A,B) B.fs #endif #endif #define ZTRINGV_cfCC(T,A,B) STRINGV_cfCC(T,A,B) #define PZTRINGV_cfCC(T,A,B) PSTRINGV_cfCC(T,A,B) #define BYTE_cfX return A0; #define DOUBLE_cfX return A0; #if ! (defined(FLOATFUNCTIONTYPE)&&defined(ASSIGNFLOAT)&&defined(RETURNFLOAT)) #define FLOAT_cfX return A0; #else #define FLOAT_cfX ASSIGNFLOAT(AA0,A0); return AA0; #endif #define INT_cfX return A0; #define LOGICAL_cfX return F2CLOGICAL(A0); #define LONG_cfX return A0; #define SHORT_cfX return A0; #define VOID_cfX return ; #if defined(vmsFortran) || defined(CRAYFortran) #define STRING_cfX return kill_trailing( \ kill_trailing(AA0,CFORTRAN_NON_CHAR),' '); #else #define STRING_cfX return kill_trailing( \ kill_trailing( A0,CFORTRAN_NON_CHAR),' '); #endif #define CFFUN(NAME) _(__cf__,NAME) /* Note that we don't use LN here, but we keep it for consistency. */ #define CCALLSFFUN0(UN,LN) CFFUN(UN)() #ifdef OLD_VAXC /* Allow %CC-I-PARAMNOTUSED. */ #pragma standard #endif #define CCALLSFFUN1( UN,LN,T1, A1) \ CCALLSFFUN5 (UN,LN,T1,CF_0,CF_0,CF_0,CF_0,A1,0,0,0,0) #define CCALLSFFUN2( UN,LN,T1,T2, A1,A2) \ CCALLSFFUN5 (UN,LN,T1,T2,CF_0,CF_0,CF_0,A1,A2,0,0,0) #define CCALLSFFUN3( UN,LN,T1,T2,T3, A1,A2,A3) \ CCALLSFFUN5 (UN,LN,T1,T2,T3,CF_0,CF_0,A1,A2,A3,0,0) #define CCALLSFFUN4( UN,LN,T1,T2,T3,T4, A1,A2,A3,A4)\ CCALLSFFUN5 (UN,LN,T1,T2,T3,T4,CF_0,A1,A2,A3,A4,0) #define CCALLSFFUN5( UN,LN,T1,T2,T3,T4,T5, A1,A2,A3,A4,A5) \ CCALLSFFUN10(UN,LN,T1,T2,T3,T4,T5,CF_0,CF_0,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,0,0,0,0,0) #define CCALLSFFUN6( UN,LN,T1,T2,T3,T4,T5,T6, A1,A2,A3,A4,A5,A6) \ CCALLSFFUN10(UN,LN,T1,T2,T3,T4,T5,T6,CF_0,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,0,0,0,0) #define CCALLSFFUN7( UN,LN,T1,T2,T3,T4,T5,T6,T7, A1,A2,A3,A4,A5,A6,A7) \ CCALLSFFUN10(UN,LN,T1,T2,T3,T4,T5,T6,T7,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,0,0,0) #define CCALLSFFUN8( UN,LN,T1,T2,T3,T4,T5,T6,T7,T8, A1,A2,A3,A4,A5,A6,A7,A8) \ CCALLSFFUN10(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,0,0) #define CCALLSFFUN9( UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,A1,A2,A3,A4,A5,A6,A7,A8,A9)\ CCALLSFFUN10(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,0) #define CCALLSFFUN10(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA)\ CCALLSFFUN14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,CF_0,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,0,0,0,0) #define CCALLSFFUN11(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB)\ CCALLSFFUN14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,CF_0,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,0,0,0) #define CCALLSFFUN12(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC)\ CCALLSFFUN14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,CF_0,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,0,0) #define CCALLSFFUN13(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD)\ CCALLSFFUN14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,CF_0,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,0) #define CCALLSFFUN14(UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,A1,A2,A3,A4,A5,A6,A7,A8,A9,AA,AB,AC,AD,AE)\ ((CFFUN(UN)( BCF(T1,A1,0) BCF(T2,A2,1) BCF(T3,A3,1) BCF(T4,A4,1) BCF(T5,A5,1) \ BCF(T6,A6,1) BCF(T7,A7,1) BCF(T8,A8,1) BCF(T9,A9,1) BCF(TA,AA,1) \ BCF(TB,AB,1) BCF(TC,AC,1) BCF(TD,AD,1) BCF(TE,AE,1) \ SCF(T1,LN,1,A1) SCF(T2,LN,2,A2) SCF(T3,LN,3,A3) SCF(T4,LN,4,A4) \ SCF(T5,LN,5,A5) SCF(T6,LN,6,A6) SCF(T7,LN,7,A7) SCF(T8,LN,8,A8) \ SCF(T9,LN,9,A9) SCF(TA,LN,10,AA) SCF(TB,LN,11,AB) SCF(TC,LN,12,AC) \ SCF(TD,LN,13,AD) SCF(TE,LN,14,AE)))) /* N.B. Create a separate function instead of using (call function, function value here) because in order to create the variables needed for the input arg.'s which may be const.'s one has to do the creation within {}, but these can never be placed within ()'s. Therefore one must create wrapper functions. gcc, on the other hand may be able to avoid the wrapper functions. */ /* Prototypes are needed to correctly handle the value returned correctly. N.B. Can only have prototype arg.'s with difficulty, a la G... table since FORTRAN functions returning strings have extra arg.'s. Don't bother, since this only causes a compiler warning to come up when one uses FCALLSCFUNn and CCALLSFFUNn for the same function in the same source code. Something done by the experts in debugging only.*/ #define PROTOCCALLSFFUN0(F,UN,LN) \ _(F,_cfPU)( CFC_(UN,LN))(CF_NULL_PROTO); \ static _Icf(2,U,F,CFFUN(UN),0)() {_(F,_cfE) _Icf(3,GZ,F,UN,LN) ABSOFT_cf1(F));_(F,_cfX)} #define PROTOCCALLSFFUN1( T0,UN,LN,T1) \ PROTOCCALLSFFUN5 (T0,UN,LN,T1,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFFUN2( T0,UN,LN,T1,T2) \ PROTOCCALLSFFUN5 (T0,UN,LN,T1,T2,CF_0,CF_0,CF_0) #define PROTOCCALLSFFUN3( T0,UN,LN,T1,T2,T3) \ PROTOCCALLSFFUN5 (T0,UN,LN,T1,T2,T3,CF_0,CF_0) #define PROTOCCALLSFFUN4( T0,UN,LN,T1,T2,T3,T4) \ PROTOCCALLSFFUN5 (T0,UN,LN,T1,T2,T3,T4,CF_0) #define PROTOCCALLSFFUN5( T0,UN,LN,T1,T2,T3,T4,T5) \ PROTOCCALLSFFUN10(T0,UN,LN,T1,T2,T3,T4,T5,CF_0,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFFUN6( T0,UN,LN,T1,T2,T3,T4,T5,T6) \ PROTOCCALLSFFUN10(T0,UN,LN,T1,T2,T3,T4,T5,T6,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFFUN7( T0,UN,LN,T1,T2,T3,T4,T5,T6,T7) \ PROTOCCALLSFFUN10(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,CF_0,CF_0,CF_0) #define PROTOCCALLSFFUN8( T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8) \ PROTOCCALLSFFUN10(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,CF_0,CF_0) #define PROTOCCALLSFFUN9( T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9) \ PROTOCCALLSFFUN10(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,CF_0) #define PROTOCCALLSFFUN10(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA) \ PROTOCCALLSFFUN14(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,CF_0,CF_0,CF_0,CF_0) #define PROTOCCALLSFFUN11(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB) \ PROTOCCALLSFFUN14(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,CF_0,CF_0,CF_0) #define PROTOCCALLSFFUN12(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC) \ PROTOCCALLSFFUN14(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,CF_0,CF_0) #define PROTOCCALLSFFUN13(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD) \ PROTOCCALLSFFUN14(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,CF_0) /* HP/UX 9.01 cc requires the blank between '_Icf(3,G,T0,UN,LN) CCCF(T1,1,0)' */ #ifndef __CF__KnR #define PROTOCCALLSFFUN14(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ _(T0,_cfPU)(CFC_(UN,LN))(CF_NULL_PROTO); static _Icf(2,U,T0,CFFUN(UN),0)( \ CFARGT14FS(UCF,HCF,_Z,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) ) \ { CFARGT14S(VCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) _(T0,_cfE) \ CCF(LN,T1,1) CCF(LN,T2,2) CCF(LN,T3,3) CCF(LN,T4,4) CCF(LN,T5,5) \ CCF(LN,T6,6) CCF(LN,T7,7) CCF(LN,T8,8) CCF(LN,T9,9) CCF(LN,TA,10) \ CCF(LN,TB,11) CCF(LN,TC,12) CCF(LN,TD,13) CCF(LN,TE,14) _Icf(3,G,T0,UN,LN) \ CFARGT14(CCCF,JCF,ABSOFT_cf1(T0),T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE)); \ WCF(T1,A1,1) WCF(T2,A2,2) WCF(T3,A3,3) WCF(T4,A4,4) WCF(T5,A5,5) \ WCF(T6,A6,6) WCF(T7,A7,7) WCF(T8,A8,8) WCF(T9,A9,9) WCF(TA,A10,10) \ WCF(TB,A11,11) WCF(TC,A12,12) WCF(TD,A13,13) WCF(TE,A14,14) _(T0,_cfX)} #else #define PROTOCCALLSFFUN14(T0,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ _(T0,_cfPU)(CFC_(UN,LN))(CF_NULL_PROTO); static _Icf(2,U,T0,CFFUN(UN),0)( \ CFARGT14FS(UUCF,HHCF,_Z,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) ) \ CFARGT14FS(UUUCF,HHHCF,_Z,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) ; \ { CFARGT14S(VCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) _(T0,_cfE) \ CCF(LN,T1,1) CCF(LN,T2,2) CCF(LN,T3,3) CCF(LN,T4,4) CCF(LN,T5,5) \ CCF(LN,T6,6) CCF(LN,T7,7) CCF(LN,T8,8) CCF(LN,T9,9) CCF(LN,TA,10) \ CCF(LN,TB,11) CCF(LN,TC,12) CCF(LN,TD,13) CCF(LN,TE,14) _Icf(3,G,T0,UN,LN) \ CFARGT14(CCCF,JCF,ABSOFT_cf1(T0),T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE)); \ WCF(T1,A1,1) WCF(T2,A2,2) WCF(T3,A3,3) WCF(T4,A4,4) WCF(T5,A5,5) \ WCF(T6,A6,6) WCF(T7,A7,7) WCF(T8,A8,8) WCF(T9,A9,9) WCF(TA,A10,10) \ WCF(TB,A11,11) WCF(TC,A12,12) WCF(TD,A13,13) WCF(TE,A14,14) _(T0,_cfX)} #endif /*-------------------------------------------------------------------------*/ /* UTILITIES FOR FORTRAN TO CALL C ROUTINES */ #ifdef OLD_VAXC /* Prevent %CC-I-PARAMNOTUSED. */ #pragma nostandard #endif #if defined(vmsFortran) || defined(CRAYFortran) #define DCF(TN,I) #define DDCF(TN,I) #define DDDCF(TN,I) #else #define DCF(TN,I) HCF(TN,I) #define DDCF(TN,I) HHCF(TN,I) #define DDDCF(TN,I) HHHCF(TN,I) #endif #define QCF(TN,I) _(TN,_cfSTR)(1,Q,_(B,I), 0,0,0,0) #define DEFAULT_cfQ(B) #define LOGICAL_cfQ(B) #define PLOGICAL_cfQ(B) #define STRINGV_cfQ(B) char *B; unsigned int _(B,N); #define STRING_cfQ(B) char *B=NULL; #define PSTRING_cfQ(B) char *B=NULL; #define PSTRINGV_cfQ(B) STRINGV_cfQ(B) #define PNSTRING_cfQ(B) char *B=NULL; #define PPSTRING_cfQ(B) #ifdef __sgi /* Else SGI gives warning 182 contrary to its C LRM A.17.7 */ #define ROUTINE_orig *(void**)& #else #define ROUTINE_orig (void *) #endif #define ROUTINE_1 ROUTINE_orig #define ROUTINE_2 ROUTINE_orig #define ROUTINE_3 ROUTINE_orig #define ROUTINE_4 ROUTINE_orig #define ROUTINE_5 ROUTINE_orig #define ROUTINE_6 ROUTINE_orig #define ROUTINE_7 ROUTINE_orig #define ROUTINE_8 ROUTINE_orig #define ROUTINE_9 ROUTINE_orig #define ROUTINE_10 ROUTINE_orig #define ROUTINE_11 ROUTINE_orig #define ROUTINE_12 ROUTINE_orig #define ROUTINE_13 ROUTINE_orig #define ROUTINE_14 ROUTINE_orig #define ROUTINE_15 ROUTINE_orig #define ROUTINE_16 ROUTINE_orig #define ROUTINE_17 ROUTINE_orig #define ROUTINE_18 ROUTINE_orig #define ROUTINE_19 ROUTINE_orig #define ROUTINE_20 ROUTINE_orig #define ROUTINE_21 ROUTINE_orig #define ROUTINE_22 ROUTINE_orig #define ROUTINE_23 ROUTINE_orig #define ROUTINE_24 ROUTINE_orig #define ROUTINE_25 ROUTINE_orig #define ROUTINE_26 ROUTINE_orig #define ROUTINE_27 ROUTINE_orig #define TCF(NAME,TN,I,M) _SEP_(TN,M,cfCOMMA) _(TN,_cfT)(NAME,I,_(A,I),_(B,I),_(C,I)) #define BYTE_cfT(M,I,A,B,D) *A #define DOUBLE_cfT(M,I,A,B,D) *A #define FLOAT_cfT(M,I,A,B,D) *A #define INT_cfT(M,I,A,B,D) *A #define LOGICAL_cfT(M,I,A,B,D) F2CLOGICAL(*A) #define LONG_cfT(M,I,A,B,D) *A #define LONGLONG_cfT(M,I,A,B,D) *A /* added by MR December 2005 */ #define SHORT_cfT(M,I,A,B,D) *A #define BYTEV_cfT(M,I,A,B,D) A #define DOUBLEV_cfT(M,I,A,B,D) A #define FLOATV_cfT(M,I,A,B,D) VOIDP A #define INTV_cfT(M,I,A,B,D) A #define LOGICALV_cfT(M,I,A,B,D) A #define LONGV_cfT(M,I,A,B,D) A #define LONGLONGV_cfT(M,I,A,B,D) A /* added by MR December 2005 */ #define SHORTV_cfT(M,I,A,B,D) A #define BYTEVV_cfT(M,I,A,B,D) (void *)A /* We have to cast to void *,*/ #define BYTEVVV_cfT(M,I,A,B,D) (void *)A /* since we don't know the */ #define BYTEVVVV_cfT(M,I,A,B,D) (void *)A /* dimensions of the array. */ #define BYTEVVVVV_cfT(M,I,A,B,D) (void *)A /* i.e. Unfortunately, can't */ #define BYTEVVVVVV_cfT(M,I,A,B,D) (void *)A /* check that the type */ #define BYTEVVVVVVV_cfT(M,I,A,B,D) (void *)A /* matches the prototype. */ #define DOUBLEVV_cfT(M,I,A,B,D) (void *)A #define DOUBLEVVV_cfT(M,I,A,B,D) (void *)A #define DOUBLEVVVV_cfT(M,I,A,B,D) (void *)A #define DOUBLEVVVVV_cfT(M,I,A,B,D) (void *)A #define DOUBLEVVVVVV_cfT(M,I,A,B,D) (void *)A #define DOUBLEVVVVVVV_cfT(M,I,A,B,D) (void *)A #define FLOATVV_cfT(M,I,A,B,D) (void *)A #define FLOATVVV_cfT(M,I,A,B,D) (void *)A #define FLOATVVVV_cfT(M,I,A,B,D) (void *)A #define FLOATVVVVV_cfT(M,I,A,B,D) (void *)A #define FLOATVVVVVV_cfT(M,I,A,B,D) (void *)A #define FLOATVVVVVVV_cfT(M,I,A,B,D) (void *)A #define INTVV_cfT(M,I,A,B,D) (void *)A #define INTVVV_cfT(M,I,A,B,D) (void *)A #define INTVVVV_cfT(M,I,A,B,D) (void *)A #define INTVVVVV_cfT(M,I,A,B,D) (void *)A #define INTVVVVVV_cfT(M,I,A,B,D) (void *)A #define INTVVVVVVV_cfT(M,I,A,B,D) (void *)A #define LOGICALVV_cfT(M,I,A,B,D) (void *)A #define LOGICALVVV_cfT(M,I,A,B,D) (void *)A #define LOGICALVVVV_cfT(M,I,A,B,D) (void *)A #define LOGICALVVVVV_cfT(M,I,A,B,D) (void *)A #define LOGICALVVVVVV_cfT(M,I,A,B,D) (void *)A #define LOGICALVVVVVVV_cfT(M,I,A,B,D) (void *)A #define LONGVV_cfT(M,I,A,B,D) (void *)A #define LONGVVV_cfT(M,I,A,B,D) (void *)A #define LONGVVVV_cfT(M,I,A,B,D) (void *)A #define LONGVVVVV_cfT(M,I,A,B,D) (void *)A #define LONGVVVVVV_cfT(M,I,A,B,D) (void *)A #define LONGVVVVVVV_cfT(M,I,A,B,D) (void *)A #define LONGLONGVV_cfT(M,I,A,B,D) (void *)A /* added by MR December 2005 */ #define LONGLONGVVV_cfT(M,I,A,B,D) (void *)A /* added by MR December 2005 */ #define LONGLONGVVVV_cfT(M,I,A,B,D) (void *)A /* added by MR December 2005 */ #define LONGLONGVVVVV_cfT(M,I,A,B,D) (void *)A /* added by MR December 2005 */ #define LONGLONGVVVVVV_cfT(M,I,A,B,D) (void *)A /* added by MR December 2005 */ #define LONGLONGVVVVVVV_cfT(M,I,A,B,D) (void *)A /* added by MR December 2005 */ #define SHORTVV_cfT(M,I,A,B,D) (void *)A #define SHORTVVV_cfT(M,I,A,B,D) (void *)A #define SHORTVVVV_cfT(M,I,A,B,D) (void *)A #define SHORTVVVVV_cfT(M,I,A,B,D) (void *)A #define SHORTVVVVVV_cfT(M,I,A,B,D) (void *)A #define SHORTVVVVVVV_cfT(M,I,A,B,D) (void *)A #define PBYTE_cfT(M,I,A,B,D) A #define PDOUBLE_cfT(M,I,A,B,D) A #define PFLOAT_cfT(M,I,A,B,D) VOIDP A #define PINT_cfT(M,I,A,B,D) A #define PLOGICAL_cfT(M,I,A,B,D) ((*A=F2CLOGICAL(*A)),A) #define PLONG_cfT(M,I,A,B,D) A #define PLONGLONG_cfT(M,I,A,B,D) A /* added by MR December 2005 */ #define PSHORT_cfT(M,I,A,B,D) A #define PVOID_cfT(M,I,A,B,D) A #if defined(apolloFortran) || defined(hpuxFortran800) || defined(AbsoftUNIXFortran) #define ROUTINE_cfT(M,I,A,B,D) _(ROUTINE_,I) (*A) #else #define ROUTINE_cfT(M,I,A,B,D) _(ROUTINE_,I) A #endif /* A == pointer to the characters D == length of the string, or of an element in an array of strings E == number of elements in an array of strings */ #define TTSTR( A,B,D) \ ((B=_cf_malloc(D+1))[D]='\0', memcpy(B,A,D), kill_trailing(B,' ')) #define TTTTSTR( A,B,D) (!(D<4||A[0]||A[1]||A[2]||A[3]))?NULL: \ memchr(A,'\0',D) ?A : TTSTR(A,B,D) #define TTTTSTRV( A,B,D,E) (_(B,N)=E,B=_cf_malloc(_(B,N)*(D+1)), (void *) \ vkill_trailing(f2cstrv(A,B,D+1, _(B,N)*(D+1)), D+1,_(B,N)*(D+1),' ')) #ifdef vmsFortran #define STRING_cfT(M,I,A,B,D) TTTTSTR( A->dsc$a_pointer,B,A->dsc$w_length) #define STRINGV_cfT(M,I,A,B,D) TTTTSTRV(A->dsc$a_pointer, B, \ A->dsc$w_length , A->dsc$l_m[0]) #define PSTRING_cfT(M,I,A,B,D) TTSTR( A->dsc$a_pointer,B,A->dsc$w_length) #define PPSTRING_cfT(M,I,A,B,D) A->dsc$a_pointer #else #ifdef CRAYFortran #define STRING_cfT(M,I,A,B,D) TTTTSTR( _fcdtocp(A),B,_fcdlen(A)) #define STRINGV_cfT(M,I,A,B,D) TTTTSTRV(_fcdtocp(A),B,_fcdlen(A), \ num_elem(_fcdtocp(A),_fcdlen(A),_3(M,_STRV_A,I))) #define PSTRING_cfT(M,I,A,B,D) TTSTR( _fcdtocp(A),B,_fcdlen(A)) #define PPSTRING_cfT(M,I,A,B,D) _fcdtocp(A) #else #define STRING_cfT(M,I,A,B,D) TTTTSTR( A,B,D) #define STRINGV_cfT(M,I,A,B,D) TTTTSTRV(A,B,D, num_elem(A,D,_3(M,_STRV_A,I))) #define PSTRING_cfT(M,I,A,B,D) TTSTR( A,B,D) #define PPSTRING_cfT(M,I,A,B,D) A #endif #endif #define PNSTRING_cfT(M,I,A,B,D) STRING_cfT(M,I,A,B,D) #define PSTRINGV_cfT(M,I,A,B,D) STRINGV_cfT(M,I,A,B,D) #define CF_0_cfT(M,I,A,B,D) #define RCF(TN,I) _(TN,_cfSTR)(3,R,_(A,I),_(B,I),_(C,I),0,0) #define DEFAULT_cfR(A,B,D) #define LOGICAL_cfR(A,B,D) #define PLOGICAL_cfR(A,B,D) *A=C2FLOGICAL(*A); #define STRING_cfR(A,B,D) if (B) _cf_free(B); #define STRINGV_cfR(A,B,D) _cf_free(B); /* A and D as defined above for TSTRING(V) */ #define RRRRPSTR( A,B,D) if (B) memcpy(A,B, _cfMIN(strlen(B),D)), \ (D>strlen(B)?memset(A+strlen(B),' ', D-strlen(B)):0), _cf_free(B); #define RRRRPSTRV(A,B,D) c2fstrv(B,A,D+1,(D+1)*_(B,N)), _cf_free(B); #ifdef vmsFortran #define PSTRING_cfR(A,B,D) RRRRPSTR( A->dsc$a_pointer,B,A->dsc$w_length) #define PSTRINGV_cfR(A,B,D) RRRRPSTRV(A->dsc$a_pointer,B,A->dsc$w_length) #else #ifdef CRAYFortran #define PSTRING_cfR(A,B,D) RRRRPSTR( _fcdtocp(A),B,_fcdlen(A)) #define PSTRINGV_cfR(A,B,D) RRRRPSTRV(_fcdtocp(A),B,_fcdlen(A)) #else #define PSTRING_cfR(A,B,D) RRRRPSTR( A,B,D) #define PSTRINGV_cfR(A,B,D) RRRRPSTRV(A,B,D) #endif #endif #define PNSTRING_cfR(A,B,D) PSTRING_cfR(A,B,D) #define PPSTRING_cfR(A,B,D) #define BYTE_cfFZ(UN,LN) INTEGER_BYTE FCALLSC_QUALIFIER fcallsc(UN,LN)( #define DOUBLE_cfFZ(UN,LN) DOUBLE_PRECISION FCALLSC_QUALIFIER fcallsc(UN,LN)( #define INT_cfFZ(UN,LN) int FCALLSC_QUALIFIER fcallsc(UN,LN)( #define LOGICAL_cfFZ(UN,LN) int FCALLSC_QUALIFIER fcallsc(UN,LN)( #define LONG_cfFZ(UN,LN) long FCALLSC_QUALIFIER fcallsc(UN,LN)( #define LONGLONG_cfFZ(UN,LN) LONGLONG FCALLSC_QUALIFIER fcallsc(UN,LN)( /* added by MR December 2005 */ #define SHORT_cfFZ(UN,LN) short FCALLSC_QUALIFIER fcallsc(UN,LN)( #define VOID_cfFZ(UN,LN) void FCALLSC_QUALIFIER fcallsc(UN,LN)( #ifndef __CF__KnR /* The void is req'd by the Apollo, to make this an ANSI function declaration. The Apollo promotes K&R float functions to double. */ #if defined (f2cFortran) && ! defined (gFortran) /* f2c/g77 return double from FORTRAN REAL functions. (KMCCARTY, 2005/12/09) */ #define FLOAT_cfFZ(UN,LN) DOUBLE_PRECISION FCALLSC_QUALIFIER fcallsc(UN,LN)(void #else #define FLOAT_cfFZ(UN,LN) FORTRAN_REAL FCALLSC_QUALIFIER fcallsc(UN,LN)(void #endif #ifdef vmsFortran #define STRING_cfFZ(UN,LN) void FCALLSC_QUALIFIER fcallsc(UN,LN)(fstring *AS #else #ifdef CRAYFortran #define STRING_cfFZ(UN,LN) void FCALLSC_QUALIFIER fcallsc(UN,LN)(_fcd AS #else #if defined(AbsoftUNIXFortran) || defined(AbsoftProFortran) #define STRING_cfFZ(UN,LN) void FCALLSC_QUALIFIER fcallsc(UN,LN)(char *AS #else #define STRING_cfFZ(UN,LN) void FCALLSC_QUALIFIER fcallsc(UN,LN)(char *AS, unsigned D0 #endif #endif #endif #else #if ! (defined(FLOATFUNCTIONTYPE)&&defined(ASSIGNFLOAT)&&defined(RETURNFLOAT)) #if defined (f2cFortran) && ! defined (gFortran) /* f2c/g77 return double from FORTRAN REAL functions. (KMCCARTY, 2005/12/09) */ #define FLOAT_cfFZ(UN,LN) DOUBLE_PRECISION FCALLSC_QUALIFIER fcallsc(UN,LN)( #else #define FLOAT_cfFZ(UN,LN) FORTRAN_REAL FCALLSC_QUALIFIER fcallsc(UN,LN)( #endif #else #define FLOAT_cfFZ(UN,LN) FLOATFUNCTIONTYPE FCALLSC_QUALIFIER fcallsc(UN,LN)( #endif #if defined(vmsFortran) || defined(CRAYFortran) || defined(AbsoftUNIXFortran) #define STRING_cfFZ(UN,LN) void FCALLSC_QUALIFIER fcallsc(UN,LN)(AS #else #define STRING_cfFZ(UN,LN) void FCALLSC_QUALIFIER fcallsc(UN,LN)(AS, D0 #endif #endif #define BYTE_cfF(UN,LN) BYTE_cfFZ(UN,LN) #define DOUBLE_cfF(UN,LN) DOUBLE_cfFZ(UN,LN) #ifndef __CF_KnR #if defined (f2cFortran) && ! defined (gFortran) /* f2c/g77 return double from FORTRAN REAL functions. (KMCCARTY, 2005/12/09) */ #define FLOAT_cfF(UN,LN) DOUBLE_PRECISION FCALLSC_QUALIFIER fcallsc(UN,LN)( #else #define FLOAT_cfF(UN,LN) FORTRAN_REAL FCALLSC_QUALIFIER fcallsc(UN,LN)( #endif #else #define FLOAT_cfF(UN,LN) FLOAT_cfFZ(UN,LN) #endif #define INT_cfF(UN,LN) INT_cfFZ(UN,LN) #define LOGICAL_cfF(UN,LN) LOGICAL_cfFZ(UN,LN) #define LONG_cfF(UN,LN) LONG_cfFZ(UN,LN) #define LONGLONG_cfF(UN,LN) LONGLONG_cfFZ(UN,LN) /* added by MR December 2005 */ #define SHORT_cfF(UN,LN) SHORT_cfFZ(UN,LN) #define VOID_cfF(UN,LN) VOID_cfFZ(UN,LN) #define STRING_cfF(UN,LN) STRING_cfFZ(UN,LN), #define INT_cfFF #define VOID_cfFF #ifdef vmsFortran #define STRING_cfFF fstring *AS; #else #ifdef CRAYFortran #define STRING_cfFF _fcd AS; #else #define STRING_cfFF char *AS; unsigned D0; #endif #endif #define INT_cfL A0= #define STRING_cfL A0= #define VOID_cfL #define INT_cfK #define VOID_cfK /* KSTRING copies the string into the position provided by the caller. */ #ifdef vmsFortran #define STRING_cfK \ memcpy(AS->dsc$a_pointer,A0,_cfMIN(AS->dsc$w_length,(A0==NULL?0:strlen(A0))));\ AS->dsc$w_length>(A0==NULL?0:strlen(A0))? \ memset(AS->dsc$a_pointer+(A0==NULL?0:strlen(A0)),' ', \ AS->dsc$w_length-(A0==NULL?0:strlen(A0))):0; #else #ifdef CRAYFortran #define STRING_cfK \ memcpy(_fcdtocp(AS),A0, _cfMIN(_fcdlen(AS),(A0==NULL?0:strlen(A0))) ); \ _fcdlen(AS)>(A0==NULL?0:strlen(A0))? \ memset(_fcdtocp(AS)+(A0==NULL?0:strlen(A0)),' ', \ _fcdlen(AS)-(A0==NULL?0:strlen(A0))):0; #else #define STRING_cfK memcpy(AS,A0, _cfMIN(D0,(A0==NULL?0:strlen(A0))) ); \ D0>(A0==NULL?0:strlen(A0))?memset(AS+(A0==NULL?0:strlen(A0)), \ ' ', D0-(A0==NULL?0:strlen(A0))):0; #endif #endif /* Note that K.. and I.. can't be combined since K.. has to access data before R.., in order for functions returning strings which are also passed in as arguments to work correctly. Note that R.. frees and hence may corrupt the string. */ #define BYTE_cfI return A0; #define DOUBLE_cfI return A0; #if ! (defined(FLOATFUNCTIONTYPE)&&defined(ASSIGNFLOAT)&&defined(RETURNFLOAT)) #define FLOAT_cfI return A0; #else #define FLOAT_cfI RETURNFLOAT(A0); #endif #define INT_cfI return A0; #ifdef hpuxFortran800 /* Incredibly, functions must return true as 1, elsewhere .true.==0x01000000. */ #define LOGICAL_cfI return ((A0)?1:0); #else #define LOGICAL_cfI return C2FLOGICAL(A0); #endif #define LONG_cfI return A0; #define LONGLONG_cfI return A0; /* added by MR December 2005 */ #define SHORT_cfI return A0; #define STRING_cfI return ; #define VOID_cfI return ; #ifdef OLD_VAXC /* Allow %CC-I-PARAMNOTUSED. */ #pragma standard #endif #define FCALLSCSUB0( CN,UN,LN) FCALLSCFUN0(VOID,CN,UN,LN) #define FCALLSCSUB1( CN,UN,LN,T1) FCALLSCFUN1(VOID,CN,UN,LN,T1) #define FCALLSCSUB2( CN,UN,LN,T1,T2) FCALLSCFUN2(VOID,CN,UN,LN,T1,T2) #define FCALLSCSUB3( CN,UN,LN,T1,T2,T3) FCALLSCFUN3(VOID,CN,UN,LN,T1,T2,T3) #define FCALLSCSUB4( CN,UN,LN,T1,T2,T3,T4) \ FCALLSCFUN4(VOID,CN,UN,LN,T1,T2,T3,T4) #define FCALLSCSUB5( CN,UN,LN,T1,T2,T3,T4,T5) \ FCALLSCFUN5(VOID,CN,UN,LN,T1,T2,T3,T4,T5) #define FCALLSCSUB6( CN,UN,LN,T1,T2,T3,T4,T5,T6) \ FCALLSCFUN6(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6) #define FCALLSCSUB7( CN,UN,LN,T1,T2,T3,T4,T5,T6,T7) \ FCALLSCFUN7(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7) #define FCALLSCSUB8( CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8) \ FCALLSCFUN8(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8) #define FCALLSCSUB9( CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9) \ FCALLSCFUN9(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9) #define FCALLSCSUB10(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA) \ FCALLSCFUN10(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA) #define FCALLSCSUB11(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB) \ FCALLSCFUN11(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB) #define FCALLSCSUB12(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC) \ FCALLSCFUN12(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC) #define FCALLSCSUB13(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD) \ FCALLSCFUN13(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD) #define FCALLSCSUB14(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ FCALLSCFUN14(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) #define FCALLSCSUB15(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF) \ FCALLSCFUN15(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF) #define FCALLSCSUB16(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG) \ FCALLSCFUN16(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG) #define FCALLSCSUB17(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH) \ FCALLSCFUN17(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH) #define FCALLSCSUB18(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI) \ FCALLSCFUN18(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI) #define FCALLSCSUB19(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ) \ FCALLSCFUN19(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ) #define FCALLSCSUB20(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK) \ FCALLSCFUN20(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK) #define FCALLSCSUB21(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL) \ FCALLSCFUN21(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL) #define FCALLSCSUB22(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM) \ FCALLSCFUN22(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM) #define FCALLSCSUB23(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN) \ FCALLSCFUN23(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN) #define FCALLSCSUB24(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO) \ FCALLSCFUN24(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO) #define FCALLSCSUB25(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP) \ FCALLSCFUN25(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP) #define FCALLSCSUB26(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ) \ FCALLSCFUN26(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ) #define FCALLSCSUB27(CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) \ FCALLSCFUN27(VOID,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) #define FCALLSCFUN1( T0,CN,UN,LN,T1) \ FCALLSCFUN5 (T0,CN,UN,LN,T1,CF_0,CF_0,CF_0,CF_0) #define FCALLSCFUN2( T0,CN,UN,LN,T1,T2) \ FCALLSCFUN5 (T0,CN,UN,LN,T1,T2,CF_0,CF_0,CF_0) #define FCALLSCFUN3( T0,CN,UN,LN,T1,T2,T3) \ FCALLSCFUN5 (T0,CN,UN,LN,T1,T2,T3,CF_0,CF_0) #define FCALLSCFUN4( T0,CN,UN,LN,T1,T2,T3,T4) \ FCALLSCFUN5 (T0,CN,UN,LN,T1,T2,T3,T4,CF_0) #define FCALLSCFUN5( T0,CN,UN,LN,T1,T2,T3,T4,T5) \ FCALLSCFUN10(T0,CN,UN,LN,T1,T2,T3,T4,T5,CF_0,CF_0,CF_0,CF_0,CF_0) #define FCALLSCFUN6( T0,CN,UN,LN,T1,T2,T3,T4,T5,T6) \ FCALLSCFUN10(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,CF_0,CF_0,CF_0,CF_0) #define FCALLSCFUN7( T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7) \ FCALLSCFUN10(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,CF_0,CF_0,CF_0) #define FCALLSCFUN8( T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8) \ FCALLSCFUN10(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,CF_0,CF_0) #define FCALLSCFUN9( T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9) \ FCALLSCFUN10(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,CF_0) #define FCALLSCFUN10(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA) \ FCALLSCFUN14(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,CF_0,CF_0,CF_0,CF_0) #define FCALLSCFUN11(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB) \ FCALLSCFUN14(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,CF_0,CF_0,CF_0) #define FCALLSCFUN12(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC) \ FCALLSCFUN14(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,CF_0,CF_0) #define FCALLSCFUN13(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD) \ FCALLSCFUN14(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,CF_0) #define FCALLSCFUN15(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF) \ FCALLSCFUN20(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,CF_0,CF_0,CF_0,CF_0,CF_0) #define FCALLSCFUN16(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG) \ FCALLSCFUN20(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,CF_0,CF_0,CF_0,CF_0) #define FCALLSCFUN17(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH) \ FCALLSCFUN20(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,CF_0,CF_0,CF_0) #define FCALLSCFUN18(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI) \ FCALLSCFUN20(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,CF_0,CF_0) #define FCALLSCFUN19(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ) \ FCALLSCFUN20(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,CF_0) #define FCALLSCFUN20(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK) \ FCALLSCFUN27(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0) #define FCALLSCFUN21(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL) \ FCALLSCFUN27(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,CF_0,CF_0,CF_0,CF_0,CF_0,CF_0) #define FCALLSCFUN22(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM) \ FCALLSCFUN27(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,CF_0,CF_0,CF_0,CF_0,CF_0) #define FCALLSCFUN23(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN) \ FCALLSCFUN27(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,CF_0,CF_0,CF_0,CF_0) #define FCALLSCFUN24(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO) \ FCALLSCFUN27(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,CF_0,CF_0,CF_0) #define FCALLSCFUN25(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP) \ FCALLSCFUN27(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,CF_0,CF_0) #define FCALLSCFUN26(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ) \ FCALLSCFUN27(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,CF_0) #ifndef __CF__KnR #define FCALLSCFUN0(T0,CN,UN,LN) CFextern _(T0,_cfFZ)(UN,LN) ABSOFT_cf2(T0)) \ {_Icf(2,UU,T0,A0,0); _Icf(0,L,T0,0,0) CN(); _Icf(0,K,T0,0,0) _(T0,_cfI)} #define FCALLSCFUN14(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ CFextern _(T0,_cfF)(UN,LN) \ CFARGT14(NCF,DCF,ABSOFT_cf2(T0),T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) ) \ { CFARGT14S(QCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ _Icf(2,UU,T0,A0,0); _Icf(0,L,T0,0,0) CN( TCF(LN,T1,1,0) TCF(LN,T2,2,1) \ TCF(LN,T3,3,1) TCF(LN,T4,4,1) TCF(LN,T5,5,1) TCF(LN,T6,6,1) TCF(LN,T7,7,1) \ TCF(LN,T8,8,1) TCF(LN,T9,9,1) TCF(LN,TA,10,1) TCF(LN,TB,11,1) TCF(LN,TC,12,1) \ TCF(LN,TD,13,1) TCF(LN,TE,14,1) ); _Icf(0,K,T0,0,0) \ CFARGT14S(RCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) _(T0,_cfI) } #define FCALLSCFUN27(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) \ CFextern _(T0,_cfF)(UN,LN) \ CFARGT27(NCF,DCF,ABSOFT_cf2(T0),T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) ) \ { CFARGT27S(QCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) \ _Icf(2,UU,T0,A0,0); _Icf(0,L,T0,0,0) CN( TCF(LN,T1,1,0) TCF(LN,T2,2,1) \ TCF(LN,T3,3,1) TCF(LN,T4,4,1) TCF(LN,T5,5,1) TCF(LN,T6,6,1) TCF(LN,T7,7,1) \ TCF(LN,T8,8,1) TCF(LN,T9,9,1) TCF(LN,TA,10,1) TCF(LN,TB,11,1) TCF(LN,TC,12,1) \ TCF(LN,TD,13,1) TCF(LN,TE,14,1) TCF(LN,TF,15,1) TCF(LN,TG,16,1) TCF(LN,TH,17,1) \ TCF(LN,TI,18,1) TCF(LN,TJ,19,1) TCF(LN,TK,20,1) TCF(LN,TL,21,1) TCF(LN,TM,22,1) \ TCF(LN,TN,23,1) TCF(LN,TO,24,1) TCF(LN,TP,25,1) TCF(LN,TQ,26,1) TCF(LN,TR,27,1) ); _Icf(0,K,T0,0,0) \ CFARGT27S(RCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) _(T0,_cfI) } #else #define FCALLSCFUN0(T0,CN,UN,LN) CFextern _(T0,_cfFZ)(UN,LN) ABSOFT_cf3(T0)) _Icf(0,FF,T0,0,0)\ {_Icf(2,UU,T0,A0,0); _Icf(0,L,T0,0,0) CN(); _Icf(0,K,T0,0,0) _(T0,_cfI)} #define FCALLSCFUN14(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ CFextern _(T0,_cfF)(UN,LN) \ CFARGT14(NNCF,DDCF,ABSOFT_cf3(T0),T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE)) _Icf(0,FF,T0,0,0) \ CFARGT14FS(NNNCF,DDDCF,_Z,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE); \ { CFARGT14S(QCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) \ _Icf(2,UU,T0,A0,0); _Icf(0,L,T0,0,0) CN( TCF(LN,T1,1,0) TCF(LN,T2,2,1) \ TCF(LN,T3,3,1) TCF(LN,T4,4,1) TCF(LN,T5,5,1) TCF(LN,T6,6,1) TCF(LN,T7,7,1) \ TCF(LN,T8,8,1) TCF(LN,T9,9,1) TCF(LN,TA,10,1) TCF(LN,TB,11,1) TCF(LN,TC,12,1) \ TCF(LN,TD,13,1) TCF(LN,TE,14,1) ); _Icf(0,K,T0,0,0) \ CFARGT14S(RCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE) _(T0,_cfI)} #define FCALLSCFUN27(T0,CN,UN,LN,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) \ CFextern _(T0,_cfF)(UN,LN) \ CFARGT27(NNCF,DDCF,ABSOFT_cf3(T0),T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR)) _Icf(0,FF,T0,0,0) \ CFARGT27FS(NNNCF,DDDCF,_Z,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR); \ { CFARGT27S(QCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) \ _Icf(2,UU,T0,A0,0); _Icf(0,L,T0,0,0) CN( TCF(LN,T1,1,0) TCF(LN,T2,2,1) \ TCF(LN,T3,3,1) TCF(LN,T4,4,1) TCF(LN,T5,5,1) TCF(LN,T6,6,1) TCF(LN,T7,7,1) \ TCF(LN,T8,8,1) TCF(LN,T9,9,1) TCF(LN,TA,10,1) TCF(LN,TB,11,1) TCF(LN,TC,12,1) \ TCF(LN,TD,13,1) TCF(LN,TE,14,1) TCF(LN,TF,15,1) TCF(LN,TG,16,1) TCF(LN,TH,17,1) \ TCF(LN,TI,18,1) TCF(LN,TJ,19,1) TCF(LN,TK,20,1) TCF(LN,TL,21,1) TCF(LN,TM,22,1) \ TCF(LN,TN,23,1) TCF(LN,TO,24,1) TCF(LN,TP,25,1) TCF(LN,TQ,26,1) TCF(LN,TR,27,1) ); _Icf(0,K,T0,0,0) \ CFARGT27S(RCF,T1,T2,T3,T4,T5,T6,T7,T8,T9,TA,TB,TC,TD,TE,TF,TG,TH,TI,TJ,TK,TL,TM,TN,TO,TP,TQ,TR) _(T0,_cfI)} #endif #endif /* __CFORTRAN_LOADED */ cfitsio-3.47/checksum.c0000644000225700000360000004230113464573431014355 0ustar cagordonlhea/* This file, checksum.c, contains the checksum-related routines in the */ /* FITSIO library. */ /* The FITSIO software was written by William Pence at the High Energy */ /* Astrophysic Science Archive Research Center (HEASARC) at the NASA */ /* Goddard Space Flight Center. */ #include #include #include "fitsio2.h" /*------------------------------------------------------------------------*/ int ffcsum(fitsfile *fptr, /* I - FITS file pointer */ long nrec, /* I - number of 2880-byte blocks to sum */ unsigned long *sum, /* IO - accumulated checksum */ int *status) /* IO - error status */ /* Calculate a 32-bit 1's complement checksum of the FITS 2880-byte blocks. This routine is based on the C algorithm developed by Rob Seaman at NOAO that was presented at the 1994 ADASS conference, published in the Astronomical Society of the Pacific Conference Series. This uses a 32-bit 1's complement checksum in which the overflow bits are permuted back into the sum and therefore all bit positions are sampled evenly. */ { long ii, jj; unsigned short sbuf[1440]; unsigned long hi, lo, hicarry, locarry; if (*status > 0) return(*status); /* Sum the specified number of FITS 2880-byte records. This assumes that the FITSIO file pointer points to the start of the records to be summed. Read each FITS block as 1440 short values (do byte swapping if needed). */ for (jj = 0; jj < nrec; jj++) { ffgbyt(fptr, 2880, sbuf, status); #if BYTESWAPPED ffswap2( (short *)sbuf, 1440); /* reverse order of bytes in each value */ #endif hi = (*sum >> 16); lo = *sum & 0xFFFF; for (ii = 0; ii < 1440; ii += 2) { hi += sbuf[ii]; lo += sbuf[ii+1]; } hicarry = hi >> 16; /* fold carry bits in */ locarry = lo >> 16; while (hicarry | locarry) { hi = (hi & 0xFFFF) + locarry; lo = (lo & 0xFFFF) + hicarry; hicarry = hi >> 16; locarry = lo >> 16; } *sum = (hi << 16) + lo; } return(*status); } /*-------------------------------------------------------------------------*/ void ffesum(unsigned long sum, /* I - accumulated checksum */ int complm, /* I - = 1 to encode complement of the sum */ char *ascii) /* O - 16-char ASCII encoded checksum */ /* encode the 32 bit checksum by converting every 2 bits of each byte into an ASCII character (32 bit word encoded as 16 character string). Only ASCII letters and digits are used to encode the values (no ASCII punctuation characters). If complm=TRUE, then the complement of the sum will be encoded. This routine is based on the C algorithm developed by Rob Seaman at NOAO that was presented at the 1994 ADASS conference, published in the Astronomical Society of the Pacific Conference Series. */ { unsigned int exclude[13] = { 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f, 0x40, 0x5b, 0x5c, 0x5d, 0x5e, 0x5f, 0x60 }; unsigned long mask[4] = { 0xff000000, 0xff0000, 0xff00, 0xff }; int offset = 0x30; /* ASCII 0 (zero) */ unsigned long value; int byte, quotient, remainder, ch[4], check, ii, jj, kk; char asc[32]; if (complm) value = 0xFFFFFFFF - sum; /* complement each bit of the value */ else value = sum; for (ii = 0; ii < 4; ii++) { byte = (value & mask[ii]) >> (24 - (8 * ii)); quotient = byte / 4 + offset; remainder = byte % 4; for (jj = 0; jj < 4; jj++) ch[jj] = quotient; ch[0] += remainder; for (check = 1; check;) /* avoid ASCII punctuation */ for (check = 0, kk = 0; kk < 13; kk++) for (jj = 0; jj < 4; jj += 2) if ((unsigned char) ch[jj] == exclude[kk] || (unsigned char) ch[jj+1] == exclude[kk]) { ch[jj]++; ch[jj+1]--; check++; } for (jj = 0; jj < 4; jj++) /* assign the bytes */ asc[4*jj+ii] = ch[jj]; } for (ii = 0; ii < 16; ii++) /* shift the bytes 1 to the right */ ascii[ii] = asc[(ii+15)%16]; ascii[16] = '\0'; } /*-------------------------------------------------------------------------*/ unsigned long ffdsum(char *ascii, /* I - 16-char ASCII encoded checksum */ int complm, /* I - =1 to decode complement of the */ unsigned long *sum) /* O - 32-bit checksum */ /* decode the 16-char ASCII encoded checksum into an unsigned 32-bit long. If complm=TRUE, then the complement of the sum will be decoded. This routine is based on the C algorithm developed by Rob Seaman at NOAO that was presented at the 1994 ADASS conference, published in the Astronomical Society of the Pacific Conference Series. */ { char cbuf[16]; unsigned long hi = 0, lo = 0, hicarry, locarry; int ii; /* remove the permuted FITS byte alignment and the ASCII 0 offset */ for (ii = 0; ii < 16; ii++) { cbuf[ii] = ascii[(ii+1)%16]; cbuf[ii] -= 0x30; } for (ii = 0; ii < 16; ii += 4) { hi += (cbuf[ii] << 8) + cbuf[ii+1]; lo += (cbuf[ii+2] << 8) + cbuf[ii+3]; } hicarry = hi >> 16; locarry = lo >> 16; while (hicarry || locarry) { hi = (hi & 0xFFFF) + locarry; lo = (lo & 0xFFFF) + hicarry; hicarry = hi >> 16; locarry = lo >> 16; } *sum = (hi << 16) + lo; if (complm) *sum = 0xFFFFFFFF - *sum; /* complement each bit of the value */ return(*sum); } /*------------------------------------------------------------------------*/ int ffpcks(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ /* Create or update the checksum keywords in the CHDU. These keywords provide a checksum verification of the FITS HDU based on the ASCII coded 1's complement checksum algorithm developed by Rob Seaman at NOAO. */ { char datestr[20], checksum[FLEN_VALUE], datasum[FLEN_VALUE]; char comm[FLEN_COMMENT], chkcomm[FLEN_COMMENT], datacomm[FLEN_COMMENT]; int tstatus; long nrec; LONGLONG headstart, datastart, dataend; unsigned long dsum, olddsum, sum; double tdouble; if (*status > 0) /* inherit input status value if > 0 */ return(*status); /* generate current date string and construct the keyword comments */ ffgstm(datestr, NULL, status); strcpy(chkcomm, "HDU checksum updated "); strcat(chkcomm, datestr); strcpy(datacomm, "data unit checksum updated "); strcat(datacomm, datestr); /* write the CHECKSUM keyword if it does not exist */ tstatus = *status; if (ffgkys(fptr, "CHECKSUM", checksum, comm, status) == KEY_NO_EXIST) { *status = tstatus; strcpy(checksum, "0000000000000000"); ffpkys(fptr, "CHECKSUM", checksum, chkcomm, status); } /* write the DATASUM keyword if it does not exist */ tstatus = *status; if (ffgkys(fptr, "DATASUM", datasum, comm, status) == KEY_NO_EXIST) { *status = tstatus; olddsum = 0; ffpkys(fptr, "DATASUM", " 0", datacomm, status); /* set the CHECKSUM keyword as undefined, if it isn't already */ if (strcmp(checksum, "0000000000000000") ) { strcpy(checksum, "0000000000000000"); ffmkys(fptr, "CHECKSUM", checksum, chkcomm, status); } } else { /* decode the datasum into an unsigned long variable */ /* olddsum = strtoul(datasum, 0, 10); doesn't work on SUN OS */ tdouble = atof(datasum); olddsum = (unsigned long) tdouble; } /* close header: rewrite END keyword and following blank fill */ /* and re-read the required keywords to determine the structure */ if (ffrdef(fptr, status) > 0) return(*status); if ((fptr->Fptr)->heapsize > 0) ffuptf(fptr, status); /* update the variable length TFORM values */ /* write the correct data fill values, if they are not already correct */ if (ffpdfl(fptr, status) > 0) return(*status); /* calc size of data unit, in FITS 2880-byte blocks */ if (ffghadll(fptr, &headstart, &datastart, &dataend, status) > 0) return(*status); nrec = (long) ((dataend - datastart) / 2880); dsum = 0; if (nrec > 0) { /* accumulate the 32-bit 1's complement checksum */ ffmbyt(fptr, datastart, REPORT_EOF, status); if (ffcsum(fptr, nrec, &dsum, status) > 0) return(*status); } if (dsum != olddsum) { /* update the DATASUM keyword with the correct value */ snprintf(datasum, FLEN_VALUE, "%lu", dsum); ffmkys(fptr, "DATASUM", datasum, datacomm, status); /* set the CHECKSUM keyword as undefined, if it isn't already */ if (strcmp(checksum, "0000000000000000") ) { strcpy(checksum, "0000000000000000"); ffmkys(fptr, "CHECKSUM", checksum, chkcomm, status); } } if (strcmp(checksum, "0000000000000000") ) { /* check if CHECKSUM is still OK; move to the start of the header */ ffmbyt(fptr, headstart, REPORT_EOF, status); /* accumulate the header checksum into the previous data checksum */ nrec = (long) ((datastart - headstart) / 2880); sum = dsum; if (ffcsum(fptr, nrec, &sum, status) > 0) return(*status); if (sum == 0 || sum == 0xFFFFFFFF) return(*status); /* CHECKSUM is correct */ /* Zero the CHECKSUM and recompute the new value */ ffmkys(fptr, "CHECKSUM", "0000000000000000", chkcomm, status); } /* move to the start of the header */ ffmbyt(fptr, headstart, REPORT_EOF, status); /* accumulate the header checksum into the previous data checksum */ nrec = (long) ((datastart - headstart) / 2880); sum = dsum; if (ffcsum(fptr, nrec, &sum, status) > 0) return(*status); /* encode the COMPLEMENT of the checksum into a 16-character string */ ffesum(sum, TRUE, checksum); /* update the CHECKSUM keyword value with the new string */ ffmkys(fptr, "CHECKSUM", checksum, "&", status); return(*status); } /*------------------------------------------------------------------------*/ int ffupck(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ /* Update the CHECKSUM keyword value. This assumes that the DATASUM keyword exists and has the correct value. */ { char datestr[20], chkcomm[FLEN_COMMENT], comm[FLEN_COMMENT]; char checksum[FLEN_VALUE], datasum[FLEN_VALUE]; int tstatus; long nrec; LONGLONG headstart, datastart, dataend; unsigned long sum, dsum; double tdouble; if (*status > 0) /* inherit input status value if > 0 */ return(*status); /* generate current date string and construct the keyword comments */ ffgstm(datestr, NULL, status); strcpy(chkcomm, "HDU checksum updated "); strcat(chkcomm, datestr); /* get the DATASUM keyword and convert it to a unsigned long */ if (ffgkys(fptr, "DATASUM", datasum, comm, status) == KEY_NO_EXIST) { ffpmsg("DATASUM keyword not found (ffupck"); return(*status); } tdouble = atof(datasum); /* read as a double as a workaround */ dsum = (unsigned long) tdouble; /* get size of the HDU */ if (ffghadll(fptr, &headstart, &datastart, &dataend, status) > 0) return(*status); /* get the checksum keyword, if it exists */ tstatus = *status; if (ffgkys(fptr, "CHECKSUM", checksum, comm, status) == KEY_NO_EXIST) { *status = tstatus; strcpy(checksum, "0000000000000000"); ffpkys(fptr, "CHECKSUM", checksum, chkcomm, status); } else { /* check if CHECKSUM is still OK */ /* rewrite END keyword and following blank fill */ if (ffwend(fptr, status) > 0) return(*status); /* move to the start of the header */ ffmbyt(fptr, headstart, REPORT_EOF, status); /* accumulate the header checksum into the previous data checksum */ nrec = (long) ((datastart - headstart) / 2880); sum = dsum; if (ffcsum(fptr, nrec, &sum, status) > 0) return(*status); if (sum == 0 || sum == 0xFFFFFFFF) return(*status); /* CHECKSUM is already correct */ /* Zero the CHECKSUM and recompute the new value */ ffmkys(fptr, "CHECKSUM", "0000000000000000", chkcomm, status); } /* move to the start of the header */ ffmbyt(fptr, headstart, REPORT_EOF, status); /* accumulate the header checksum into the previous data checksum */ nrec = (long) ((datastart - headstart) / 2880); sum = dsum; if (ffcsum(fptr, nrec, &sum, status) > 0) return(*status); /* encode the COMPLEMENT of the checksum into a 16-character string */ ffesum(sum, TRUE, checksum); /* update the CHECKSUM keyword value with the new string */ ffmkys(fptr, "CHECKSUM", checksum, "&", status); return(*status); } /*------------------------------------------------------------------------*/ int ffvcks(fitsfile *fptr, /* I - FITS file pointer */ int *datastatus, /* O - data checksum status */ int *hdustatus, /* O - hdu checksum status */ /* 1 verification is correct */ /* 0 checksum keyword is not present */ /* -1 verification not correct */ int *status) /* IO - error status */ /* Verify the HDU by comparing the value of the computed checksums against the values of the DATASUM and CHECKSUM keywords if they are present. */ { int tstatus; double tdouble; unsigned long datasum, hdusum, olddatasum; char chksum[FLEN_VALUE], comm[FLEN_COMMENT]; if (*status > 0) /* inherit input status value if > 0 */ return(*status); *datastatus = -1; *hdustatus = -1; tstatus = *status; if (ffgkys(fptr, "CHECKSUM", chksum, comm, status) == KEY_NO_EXIST) { *hdustatus = 0; /* CHECKSUM keyword does not exist */ *status = tstatus; } if (chksum[0] == '\0') *hdustatus = 0; /* all blank checksum means it is undefined */ if (ffgkys(fptr, "DATASUM", chksum, comm, status) == KEY_NO_EXIST) { *datastatus = 0; /* DATASUM keyword does not exist */ *status = tstatus; } if (chksum[0] == '\0') *datastatus = 0; /* all blank checksum means it is undefined */ if ( *status > 0 || (!(*hdustatus) && !(*datastatus)) ) return(*status); /* return if neither keywords exist */ /* convert string to unsigned long */ /* olddatasum = strtoul(chksum, 0, 10); doesn't work w/ gcc on SUN OS */ /* sscanf(chksum, "%u", &olddatasum); doesn't work w/ cc on VAX/VMS */ tdouble = atof(chksum); /* read as a double as a workaround */ olddatasum = (unsigned long) tdouble; /* calculate the data checksum and the HDU checksum */ if (ffgcks(fptr, &datasum, &hdusum, status) > 0) return(*status); if (*datastatus) if (datasum == olddatasum) *datastatus = 1; if (*hdustatus) if (hdusum == 0 || hdusum == 0xFFFFFFFF) *hdustatus = 1; return(*status); } /*------------------------------------------------------------------------*/ int ffgcks(fitsfile *fptr, /* I - FITS file pointer */ unsigned long *datasum, /* O - data checksum */ unsigned long *hdusum, /* O - hdu checksum */ int *status) /* IO - error status */ /* calculate the checksums of the data unit and the total HDU */ { long nrec; LONGLONG headstart, datastart, dataend; if (*status > 0) /* inherit input status value if > 0 */ return(*status); /* get size of the HDU */ if (ffghadll(fptr, &headstart, &datastart, &dataend, status) > 0) return(*status); nrec = (long) ((dataend - datastart) / 2880); *datasum = 0; if (nrec > 0) { /* accumulate the 32-bit 1's complement checksum */ ffmbyt(fptr, datastart, REPORT_EOF, status); if (ffcsum(fptr, nrec, datasum, status) > 0) return(*status); } /* move to the start of the header and calc. size of header */ ffmbyt(fptr, headstart, REPORT_EOF, status); nrec = (long) ((datastart - headstart) / 2880); /* accumulate the header checksum into the previous data checksum */ *hdusum = *datasum; ffcsum(fptr, nrec, hdusum, status); return(*status); } cfitsio-3.47/CMakeLists.txt0000755000225700000360000001405713464573431015161 0ustar cagordonlhea# CFITSIO CMakeLists.txt # Suppress warning about WIN32 no longer being defined on Cygwin: SET(CMAKE_LEGACY_CYGWIN_WIN32 0) PROJECT(CFITSIO) CMAKE_MINIMUM_REQUIRED(VERSION 2.8.0) # Allow @rpath token in target install name on Macs. # See "cmake --help-policy CMP0042" for more information. IF(POLICY CMP0042) CMAKE_POLICY(SET CMP0042 NEW) ENDIF() INCLUDE (${CMAKE_ROOT}/Modules/CheckLibraryExists.cmake) INCLUDE (${CMAKE_ROOT}/Modules/CheckFunctionExists.cmake) # Allow the developer to select if Dynamic or Static libraries are built OPTION (BUILD_SHARED_LIBS "Build Shared Libraries" ON) OPTION (USE_PTHREADS "Thread-safe build (using pthreads)" OFF) set(CMAKE_MODULE_PATH ${CMAKE_MODULE_PATH} "${CMAKE_SOURCE_DIR}") set (LIB_DESTINATION "${CMAKE_INSTALL_PREFIX}/lib${LIB_SUFFIX}") set (INCLUDE_INSTALL_DIR "${CMAKE_INSTALL_PREFIX}/include/") # Define project version SET(${PROJECT_NAME}_MAJOR_VERSION 3) SET(${PROJECT_NAME}_MINOR_VERSION 47) SET(${PROJECT_NAME}_VERSION ${${PROJECT_NAME}_MAJOR_VERSION}.${${PROJECT_NAME}_MINOR_VERSION}) SET(LIB_NAME cfitsio) # Microsoft Visual Studio: IF(MSVC OR BORLAND) # Define ADD_DEFINITIONS(-D_CRT_SECURE_NO_DEPRECATE) # Need an empty unistd.h in MSVC for flex-generated eval_l.c: FILE(WRITE ${CMAKE_SOURCE_DIR}/unistd.h "") INCLUDE_DIRECTORIES(${CMAKE_SOURCE_DIR}) ENDIF() IF(BORLAND) # Suppress spurious Borland compiler warnings about "Suspicious # pointer arithmetic", "Possibly incorrect assignment", and # "Comparing signed and unsigned values". ADD_DEFINITIONS(-w-spa) ADD_DEFINITIONS(-w-pia) ADD_DEFINITIONS(-w-csu) ENDIF() #add_subdirectory (src) SET (LIB_TYPE STATIC) IF (BUILD_SHARED_LIBS) SET (LIB_TYPE SHARED) ENDIF (BUILD_SHARED_LIBS) FILE(GLOB H_FILES "*.h") IF (USE_PTHREADS) FIND_PACKAGE(pthreads REQUIRED) INCLUDE_DIRECTORIES(${PTHREADS_INCLUDE_DIR}) ADD_DEFINITIONS(-D_REENTRANT) ENDIF() # Math library (not available in MSVC or MINGW) IF (MSVC OR MINGW) SET(M_LIB "") ELSE() FIND_LIBRARY(M_LIB m) ENDIF() # Support for remote file drivers is not implemented for native Windows: IF (NOT MSVC) # Find library needed for gethostbyname: CHECK_FUNCTION_EXISTS("gethostbyname" CMAKE_HAVE_GETHOSTBYNAME) IF(NOT CMAKE_HAVE_GETHOSTBYNAME) CHECK_LIBRARY_EXISTS("nsl" "gethostbyname" "" CMAKE_HAVE_GETHOSTBYNAME) ENDIF() # Find library needed for connect: CHECK_FUNCTION_EXISTS("connect" CMAKE_HAVE_CONNECT) IF(NOT CMAKE_HAVE_CONNECT) CHECK_LIBRARY_EXISTS("socket" "connect" "" CMAKE_HAVE_CONNECT) ENDIF() # Define HAVE_NET_SERVICES if gethostbyname & connect were found: IF (CMAKE_HAVE_GETHOSTBYNAME AND CMAKE_HAVE_CONNECT) ADD_DEFINITIONS(-DHAVE_NET_SERVICES) ENDIF () # Find curl library, for HTTPS support: FIND_PACKAGE(CURL) IF (CURL_FOUND) INCLUDE_DIRECTORIES(${CURL_INCLUDE_DIR}) ADD_DEFINITIONS(-DCFITSIO_HAVE_CURL) ENDIF() ENDIF() SET(SRC_FILES buffers.c cfileio.c checksum.c drvrfile.c drvrmem.c drvrnet.c editcol.c edithdu.c eval_f.c eval_l.c eval_y.c f77_wrap1.c f77_wrap2.c f77_wrap3.c f77_wrap4.c fits_hcompress.c fits_hdecompress.c fitscore.c getcol.c getcolb.c getcold.c getcole.c getcoli.c getcolj.c getcolk.c getcoll.c getcols.c getcolsb.c getcolui.c getcoluj.c getcoluk.c getkey.c group.c grparser.c histo.c imcompress.c iraffits.c modkey.c pliocomp.c putcol.c putcolb.c putcold.c putcole.c putcoli.c putcolj.c putcolk.c putcoll.c putcols.c putcolsb.c putcolu.c putcolui.c putcoluj.c putcoluk.c putkey.c quantize.c region.c ricecomp.c scalnull.c simplerng.c swapproc.c wcssub.c wcsutil.c zlib/zcompress.c zlib/zuncompress.c ) # For future modifications: # drvrsmem.c is only usable if HAVE_SHMEM_SERVICES is defined: #drvrsmem.c # drvrgsiftp.c is only usable if HAVE_NET_SERVICES & HAVE_GSIFTP are defined: #drvrgsiftp.c # Only include zlib source files if we are building a shared library. # Users will need to link their executable with zlib independently. IF (BUILD_SHARED_LIBS) set(SRC_FILES ${SRC_FILES} zlib/adler32.c zlib/crc32.c zlib/deflate.c zlib/infback.c zlib/inffast.c zlib/inflate.c zlib/inftrees.c zlib/trees.c zlib/uncompr.c zlib/zutil.c ) ENDIF() ADD_LIBRARY(${LIB_NAME} ${LIB_TYPE} ${H_FILES} ${SRC_FILES}) TARGET_LINK_LIBRARIES(${LIB_NAME} ${PTHREADS_LIBRARY} ${M_LIB} ${CURL_LIBRARIES}) SET_TARGET_PROPERTIES(${LIB_NAME} PROPERTIES VERSION ${${PROJECT_NAME}_VERSION} SOVERSION ${${PROJECT_NAME}_MAJOR_VERSION}) install(TARGETS ${LIB_NAME} DESTINATION ${LIB_DESTINATION}) install(TARGETS ${LIB_NAME} RUNTIME DESTINATION bin LIBRARY DESTINATION lib ARCHIVE DESTINATION lib) install(FILES ${H_FILES} DESTINATION ${INCLUDE_INSTALL_DIR} COMPONENT Devel) # Only build test code and executables if building a shared library: IF (BUILD_SHARED_LIBS) ENABLE_TESTING() ADD_EXECUTABLE(TestProg testprog.c) TARGET_LINK_LIBRARIES(TestProg ${LIB_NAME}) ADD_TEST(TestProg TestProg) # Copy testprog.tpt to build directory to allow quick test # of ./TestProg (or .\Release\TestProg.exe in MSVC): FILE(COPY ${CMAKE_SOURCE_DIR}/testprog.tpt DESTINATION ${CMAKE_CURRENT_BINARY_DIR}) ADD_EXECUTABLE(cookbook cookbook.c) TARGET_LINK_LIBRARIES(cookbook ${LIB_NAME}) ADD_TEST(cookbook cookbook) ADD_EXECUTABLE(FPack fpack.c fpackutil.c) TARGET_LINK_LIBRARIES(FPack ${LIB_NAME}) ADD_EXECUTABLE(Funpack funpack.c fpackutil.c) TARGET_LINK_LIBRARIES(Funpack ${LIB_NAME}) ADD_EXECUTABLE(Fitscopy fitscopy.c) TARGET_LINK_LIBRARIES(Fitscopy ${LIB_NAME}) # To expand the command line arguments in Windows, see: # http://msdn.microsoft.com/en-us/library/8bch7bkk.aspx if(MSVC) set_target_properties(FPack Funpack PROPERTIES LINK_FLAGS "setargv.obj") endif(MSVC) ENDIF(BUILD_SHARED_LIBS) configure_file(${CMAKE_CURRENT_SOURCE_DIR}/cfitsio.pc.cmake ${CMAKE_CURRENT_BINARY_DIR}/cfitsio.pc @ONLY) install(FILES ${CMAKE_CURRENT_BINARY_DIR}/cfitsio.pc DESTINATION lib/pkgconfig/) cfitsio-3.47/config.guess0000755000225700000360000012637313464573431014743 0ustar cagordonlhea#! /bin/sh # Attempt to guess a canonical system name. # Copyright 1992-2018 Free Software Foundation, Inc. timestamp='2018-02-24' # This file is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 3 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, see . # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that # program. This Exception is an additional permission under section 7 # of the GNU General Public License, version 3 ("GPLv3"). # # Originally written by Per Bothner; maintained since 2000 by Ben Elliston. # # You can get the latest version of this script from: # https://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess # # Please send patches to . me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] Output the configuration name of the system \`$me' is run on. Options: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.guess ($timestamp) Originally written by Per Bothner. Copyright 1992-2018 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" >&2 exit 1 ;; * ) break ;; esac done if test $# != 0; then echo "$me: too many arguments$help" >&2 exit 1 fi trap 'exit 1' 1 2 15 # CC_FOR_BUILD -- compiler used by this script. Note that the use of a # compiler to aid in system detection is discouraged as it requires # temporary files to be created and, as you can see below, it is a # headache to deal with in a portable fashion. # Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still # use `HOST_CC' if defined, but it is deprecated. # Portable tmp directory creation inspired by the Autoconf team. set_cc_for_build=' trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ; trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ; : ${TMPDIR=/tmp} ; { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } || { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } || { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ; dummy=$tmp/dummy ; tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ; case $CC_FOR_BUILD,$HOST_CC,$CC in ,,) echo "int x;" > "$dummy.c" ; for c in cc gcc c89 c99 ; do if ($c -c -o "$dummy.o" "$dummy.c") >/dev/null 2>&1 ; then CC_FOR_BUILD="$c"; break ; fi ; done ; if test x"$CC_FOR_BUILD" = x ; then CC_FOR_BUILD=no_compiler_found ; fi ;; ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; esac ; set_cc_for_build= ;' # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 1994-08-24) if (test -f /.attbin/uname) >/dev/null 2>&1 ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown case "$UNAME_SYSTEM" in Linux|GNU|GNU/*) # If the system lacks a compiler, then just pick glibc. # We could probably try harder. LIBC=gnu eval "$set_cc_for_build" cat <<-EOF > "$dummy.c" #include #if defined(__UCLIBC__) LIBC=uclibc #elif defined(__dietlibc__) LIBC=dietlibc #else LIBC=gnu #endif EOF eval "`$CC_FOR_BUILD -E "$dummy.c" 2>/dev/null | grep '^LIBC' | sed 's, ,,g'`" # If ldd exists, use it to detect musl libc. if command -v ldd >/dev/null && \ ldd --version 2>&1 | grep -q ^musl then LIBC=musl fi ;; esac # Note: order is significant - the case branches are not exclusive. case "$UNAME_MACHINE:$UNAME_SYSTEM:$UNAME_RELEASE:$UNAME_VERSION" in *:NetBSD:*:*) # NetBSD (nbsd) targets should (where applicable) match one or # more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*, # *-*-netbsdecoff* and *-*-netbsd*. For targets that recently # switched to ELF, *-*-netbsd* would select the old # object file format. This provides both forward # compatibility and a consistent mechanism for selecting the # object file format. # # Note: NetBSD doesn't particularly care about the vendor # portion of the name. We always set it to "unknown". sysctl="sysctl -n hw.machine_arch" UNAME_MACHINE_ARCH=`(uname -p 2>/dev/null || \ "/sbin/$sysctl" 2>/dev/null || \ "/usr/sbin/$sysctl" 2>/dev/null || \ echo unknown)` case "$UNAME_MACHINE_ARCH" in armeb) machine=armeb-unknown ;; arm*) machine=arm-unknown ;; sh3el) machine=shl-unknown ;; sh3eb) machine=sh-unknown ;; sh5el) machine=sh5le-unknown ;; earmv*) arch=`echo "$UNAME_MACHINE_ARCH" | sed -e 's,^e\(armv[0-9]\).*$,\1,'` endian=`echo "$UNAME_MACHINE_ARCH" | sed -ne 's,^.*\(eb\)$,\1,p'` machine="${arch}${endian}"-unknown ;; *) machine="$UNAME_MACHINE_ARCH"-unknown ;; esac # The Operating System including object format, if it has switched # to ELF recently (or will in the future) and ABI. case "$UNAME_MACHINE_ARCH" in earm*) os=netbsdelf ;; arm*|i386|m68k|ns32k|sh3*|sparc|vax) eval "$set_cc_for_build" if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ELF__ then # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout). # Return netbsd for either. FIX? os=netbsd else os=netbsdelf fi ;; *) os=netbsd ;; esac # Determine ABI tags. case "$UNAME_MACHINE_ARCH" in earm*) expr='s/^earmv[0-9]/-eabi/;s/eb$//' abi=`echo "$UNAME_MACHINE_ARCH" | sed -e "$expr"` ;; esac # The OS release # Debian GNU/NetBSD machines have a different userland, and # thus, need a distinct triplet. However, they do not need # kernel version information, so it can be replaced with a # suitable tag, in the style of linux-gnu. case "$UNAME_VERSION" in Debian*) release='-gnu' ;; *) release=`echo "$UNAME_RELEASE" | sed -e 's/[-_].*//' | cut -d. -f1,2` ;; esac # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used. echo "$machine-${os}${release}${abi}" exit ;; *:Bitrig:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/Bitrig.//'` echo "$UNAME_MACHINE_ARCH"-unknown-bitrig"$UNAME_RELEASE" exit ;; *:OpenBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'` echo "$UNAME_MACHINE_ARCH"-unknown-openbsd"$UNAME_RELEASE" exit ;; *:LibertyBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/^.*BSD\.//'` echo "$UNAME_MACHINE_ARCH"-unknown-libertybsd"$UNAME_RELEASE" exit ;; *:MidnightBSD:*:*) echo "$UNAME_MACHINE"-unknown-midnightbsd"$UNAME_RELEASE" exit ;; *:ekkoBSD:*:*) echo "$UNAME_MACHINE"-unknown-ekkobsd"$UNAME_RELEASE" exit ;; *:SolidBSD:*:*) echo "$UNAME_MACHINE"-unknown-solidbsd"$UNAME_RELEASE" exit ;; macppc:MirBSD:*:*) echo powerpc-unknown-mirbsd"$UNAME_RELEASE" exit ;; *:MirBSD:*:*) echo "$UNAME_MACHINE"-unknown-mirbsd"$UNAME_RELEASE" exit ;; *:Sortix:*:*) echo "$UNAME_MACHINE"-unknown-sortix exit ;; *:Redox:*:*) echo "$UNAME_MACHINE"-unknown-redox exit ;; mips:OSF1:*.*) echo mips-dec-osf1 exit ;; alpha:OSF1:*:*) case $UNAME_RELEASE in *4.0) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` ;; *5.*) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'` ;; esac # According to Compaq, /usr/sbin/psrinfo has been available on # OSF/1 and Tru64 systems produced since 1995. I hope that # covers most systems running today. This code pipes the CPU # types through head -n 1, so we only detect the type of CPU 0. ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` case "$ALPHA_CPU_TYPE" in "EV4 (21064)") UNAME_MACHINE=alpha ;; "EV4.5 (21064)") UNAME_MACHINE=alpha ;; "LCA4 (21066/21068)") UNAME_MACHINE=alpha ;; "EV5 (21164)") UNAME_MACHINE=alphaev5 ;; "EV5.6 (21164A)") UNAME_MACHINE=alphaev56 ;; "EV5.6 (21164PC)") UNAME_MACHINE=alphapca56 ;; "EV5.7 (21164PC)") UNAME_MACHINE=alphapca57 ;; "EV6 (21264)") UNAME_MACHINE=alphaev6 ;; "EV6.7 (21264A)") UNAME_MACHINE=alphaev67 ;; "EV6.8CB (21264C)") UNAME_MACHINE=alphaev68 ;; "EV6.8AL (21264B)") UNAME_MACHINE=alphaev68 ;; "EV6.8CX (21264D)") UNAME_MACHINE=alphaev68 ;; "EV6.9A (21264/EV69A)") UNAME_MACHINE=alphaev69 ;; "EV7 (21364)") UNAME_MACHINE=alphaev7 ;; "EV7.9 (21364A)") UNAME_MACHINE=alphaev79 ;; esac # A Pn.n version is a patched version. # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. echo "$UNAME_MACHINE"-dec-osf"`echo "$UNAME_RELEASE" | sed -e 's/^[PVTX]//' | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz`" # Reset EXIT trap before exiting to avoid spurious non-zero exit code. exitcode=$? trap '' 0 exit $exitcode ;; Amiga*:UNIX_System_V:4.0:*) echo m68k-unknown-sysv4 exit ;; *:[Aa]miga[Oo][Ss]:*:*) echo "$UNAME_MACHINE"-unknown-amigaos exit ;; *:[Mm]orph[Oo][Ss]:*:*) echo "$UNAME_MACHINE"-unknown-morphos exit ;; *:OS/390:*:*) echo i370-ibm-openedition exit ;; *:z/VM:*:*) echo s390-ibm-zvmoe exit ;; *:OS400:*:*) echo powerpc-ibm-os400 exit ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix"$UNAME_RELEASE" exit ;; arm*:riscos:*:*|arm*:RISCOS:*:*) echo arm-unknown-riscos exit ;; SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) echo hppa1.1-hitachi-hiuxmpp exit ;; Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*) # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit ;; NILE*:*:*:dcosx) echo pyramid-pyramid-svr4 exit ;; DRS?6000:unix:4.0:6*) echo sparc-icl-nx6 exit ;; DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*) case `/usr/bin/uname -p` in sparc) echo sparc-icl-nx7; exit ;; esac ;; s390x:SunOS:*:*) echo "$UNAME_MACHINE"-ibm-solaris2"`echo "$UNAME_RELEASE" | sed -e 's/[^.]*//'`" exit ;; sun4H:SunOS:5.*:*) echo sparc-hal-solaris2"`echo "$UNAME_RELEASE"|sed -e 's/[^.]*//'`" exit ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) echo sparc-sun-solaris2"`echo "$UNAME_RELEASE" | sed -e 's/[^.]*//'`" exit ;; i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*) echo i386-pc-auroraux"$UNAME_RELEASE" exit ;; i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*) eval "$set_cc_for_build" SUN_ARCH=i386 # If there is a compiler, see if it is configured for 64-bit objects. # Note that the Sun cc does not turn __LP64__ into 1 like gcc does. # This test works for both compilers. if [ "$CC_FOR_BUILD" != no_compiler_found ]; then if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then SUN_ARCH=x86_64 fi fi echo "$SUN_ARCH"-pc-solaris2"`echo "$UNAME_RELEASE"|sed -e 's/[^.]*//'`" exit ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. echo sparc-sun-solaris3"`echo "$UNAME_RELEASE"|sed -e 's/[^.]*//'`" exit ;; sun4*:SunOS:*:*) case "`/usr/bin/arch -k`" in Series*|S4*) UNAME_RELEASE=`uname -v` ;; esac # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos"`echo "$UNAME_RELEASE"|sed -e 's/-/_/'`" exit ;; sun3*:SunOS:*:*) echo m68k-sun-sunos"$UNAME_RELEASE" exit ;; sun*:*:4.2BSD:*) UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` test "x$UNAME_RELEASE" = x && UNAME_RELEASE=3 case "`/bin/arch`" in sun3) echo m68k-sun-sunos"$UNAME_RELEASE" ;; sun4) echo sparc-sun-sunos"$UNAME_RELEASE" ;; esac exit ;; aushp:SunOS:*:*) echo sparc-auspex-sunos"$UNAME_RELEASE" exit ;; # The situation for MiNT is a little confusing. The machine name # can be virtually everything (everything which is not # "atarist" or "atariste" at least should have a processor # > m68000). The system name ranges from "MiNT" over "FreeMiNT" # to the lowercase version "mint" (or "freemint"). Finally # the system name "TOS" denotes a system which is actually not # MiNT. But MiNT is downward compatible to TOS, so this should # be no problem. atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint"$UNAME_RELEASE" exit ;; atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint"$UNAME_RELEASE" exit ;; *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) echo m68k-atari-mint"$UNAME_RELEASE" exit ;; milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) echo m68k-milan-mint"$UNAME_RELEASE" exit ;; hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) echo m68k-hades-mint"$UNAME_RELEASE" exit ;; *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) echo m68k-unknown-mint"$UNAME_RELEASE" exit ;; m68k:machten:*:*) echo m68k-apple-machten"$UNAME_RELEASE" exit ;; powerpc:machten:*:*) echo powerpc-apple-machten"$UNAME_RELEASE" exit ;; RISC*:Mach:*:*) echo mips-dec-mach_bsd4.3 exit ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix"$UNAME_RELEASE" exit ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix"$UNAME_RELEASE" exit ;; 2020:CLIX:*:* | 2430:CLIX:*:*) echo clipper-intergraph-clix"$UNAME_RELEASE" exit ;; mips:*:*:UMIPS | mips:*:*:RISCos) eval "$set_cc_for_build" sed 's/^ //' << EOF > "$dummy.c" #ifdef __cplusplus #include /* for printf() prototype */ int main (int argc, char *argv[]) { #else int main (argc, argv) int argc; char *argv[]; { #endif #if defined (host_mips) && defined (MIPSEB) #if defined (SYSTYPE_SYSV) printf ("mips-mips-riscos%ssysv\\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_SVR4) printf ("mips-mips-riscos%ssvr4\\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) printf ("mips-mips-riscos%sbsd\\n", argv[1]); exit (0); #endif #endif exit (-1); } EOF $CC_FOR_BUILD -o "$dummy" "$dummy.c" && dummyarg=`echo "$UNAME_RELEASE" | sed -n 's/\([0-9]*\).*/\1/p'` && SYSTEM_NAME=`"$dummy" "$dummyarg"` && { echo "$SYSTEM_NAME"; exit; } echo mips-mips-riscos"$UNAME_RELEASE" exit ;; Motorola:PowerMAX_OS:*:*) echo powerpc-motorola-powermax exit ;; Motorola:*:4.3:PL8-*) echo powerpc-harris-powermax exit ;; Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) echo powerpc-harris-powermax exit ;; Night_Hawk:Power_UNIX:*:*) echo powerpc-harris-powerunix exit ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit ;; AViiON:dgux:*:*) # DG/UX returns AViiON for all architectures UNAME_PROCESSOR=`/usr/bin/uname -p` if [ "$UNAME_PROCESSOR" = mc88100 ] || [ "$UNAME_PROCESSOR" = mc88110 ] then if [ "$TARGET_BINARY_INTERFACE"x = m88kdguxelfx ] || \ [ "$TARGET_BINARY_INTERFACE"x = x ] then echo m88k-dg-dgux"$UNAME_RELEASE" else echo m88k-dg-dguxbcs"$UNAME_RELEASE" fi else echo i586-dg-dgux"$UNAME_RELEASE" fi exit ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit ;; *:IRIX*:*:*) echo mips-sgi-irix"`echo "$UNAME_RELEASE"|sed -e 's/-/_/g'`" exit ;; ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id exit ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i*86:AIX:*:*) echo i386-ibm-aix exit ;; ia64:AIX:*:*) if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV="$UNAME_VERSION.$UNAME_RELEASE" fi echo "$UNAME_MACHINE"-ibm-aix"$IBM_REV" exit ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then eval "$set_cc_for_build" sed 's/^ //' << EOF > "$dummy.c" #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF if $CC_FOR_BUILD -o "$dummy" "$dummy.c" && SYSTEM_NAME=`"$dummy"` then echo "$SYSTEM_NAME" else echo rs6000-ibm-aix3.2.5 fi elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then echo rs6000-ibm-aix3.2.4 else echo rs6000-ibm-aix3.2 fi exit ;; *:AIX:*:[4567]) IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'` if /usr/sbin/lsattr -El "$IBM_CPU_ID" | grep ' POWER' >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if [ -x /usr/bin/lslpp ] ; then IBM_REV=`/usr/bin/lslpp -Lqc bos.rte.libc | awk -F: '{ print $3 }' | sed s/[0-9]*$/0/` else IBM_REV="$UNAME_VERSION.$UNAME_RELEASE" fi echo "$IBM_ARCH"-ibm-aix"$IBM_REV" exit ;; *:AIX:*:*) echo rs6000-ibm-aix exit ;; ibmrt:4.4BSD:*|romp-ibm:4.4BSD:*) echo romp-ibm-bsd4.4 exit ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and echo romp-ibm-bsd"$UNAME_RELEASE" # 4.3 with uname added to exit ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) echo rs6000-bull-bosx exit ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit ;; 9000/[34678]??:HP-UX:*:*) HPUX_REV=`echo "$UNAME_RELEASE"|sed -e 's/[^.]*.[0B]*//'` case "$UNAME_MACHINE" in 9000/31?) HP_ARCH=m68000 ;; 9000/[34]??) HP_ARCH=m68k ;; 9000/[678][0-9][0-9]) if [ -x /usr/bin/getconf ]; then sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null` sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null` case "$sc_cpu_version" in 523) HP_ARCH=hppa1.0 ;; # CPU_PA_RISC1_0 528) HP_ARCH=hppa1.1 ;; # CPU_PA_RISC1_1 532) # CPU_PA_RISC2_0 case "$sc_kernel_bits" in 32) HP_ARCH=hppa2.0n ;; 64) HP_ARCH=hppa2.0w ;; '') HP_ARCH=hppa2.0 ;; # HP-UX 10.20 esac ;; esac fi if [ "$HP_ARCH" = "" ]; then eval "$set_cc_for_build" sed 's/^ //' << EOF > "$dummy.c" #define _HPUX_SOURCE #include #include int main () { #if defined(_SC_KERNEL_BITS) long bits = sysconf(_SC_KERNEL_BITS); #endif long cpu = sysconf (_SC_CPU_VERSION); switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0"); break; case CPU_PA_RISC1_1: puts ("hppa1.1"); break; case CPU_PA_RISC2_0: #if defined(_SC_KERNEL_BITS) switch (bits) { case 64: puts ("hppa2.0w"); break; case 32: puts ("hppa2.0n"); break; default: puts ("hppa2.0"); break; } break; #else /* !defined(_SC_KERNEL_BITS) */ puts ("hppa2.0"); break; #endif default: puts ("hppa1.0"); break; } exit (0); } EOF (CCOPTS="" $CC_FOR_BUILD -o "$dummy" "$dummy.c" 2>/dev/null) && HP_ARCH=`"$dummy"` test -z "$HP_ARCH" && HP_ARCH=hppa fi ;; esac if [ "$HP_ARCH" = hppa2.0w ] then eval "$set_cc_for_build" # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler # generating 64-bit code. GNU and HP use different nomenclature: # # $ CC_FOR_BUILD=cc ./config.guess # => hppa2.0w-hp-hpux11.23 # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess # => hppa64-hp-hpux11.23 if echo __LP64__ | (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | grep -q __LP64__ then HP_ARCH=hppa2.0w else HP_ARCH=hppa64 fi fi echo "$HP_ARCH"-hp-hpux"$HPUX_REV" exit ;; ia64:HP-UX:*:*) HPUX_REV=`echo "$UNAME_RELEASE"|sed -e 's/[^.]*.[0B]*//'` echo ia64-hp-hpux"$HPUX_REV" exit ;; 3050*:HI-UX:*:*) eval "$set_cc_for_build" sed 's/^ //' << EOF > "$dummy.c" #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF $CC_FOR_BUILD -o "$dummy" "$dummy.c" && SYSTEM_NAME=`"$dummy"` && { echo "$SYSTEM_NAME"; exit; } echo unknown-hitachi-hiuxwe2 exit ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:*) echo hppa1.1-hp-bsd exit ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit ;; *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) echo hppa1.0-hp-mpeix exit ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:*) echo hppa1.1-hp-osf exit ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit ;; i*86:OSF1:*:*) if [ -x /usr/sbin/sysversion ] ; then echo "$UNAME_MACHINE"-unknown-osf1mk else echo "$UNAME_MACHINE"-unknown-osf1 fi exit ;; parisc*:Lites*:*:*) echo hppa1.1-hp-lites exit ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit ;; CRAY*Y-MP:*:*:*) echo ymp-cray-unicos"$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*[A-Z]90:*:*:*) echo "$UNAME_MACHINE"-cray-unicos"$UNAME_RELEASE" \ | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \ -e 's/\.[^.]*$/.X/' exit ;; CRAY*TS:*:*:*) echo t90-cray-unicos"$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*T3E:*:*:*) echo alphaev5-cray-unicosmk"$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*SV1:*:*:*) echo sv1-cray-unicos"$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/' exit ;; *:UNICOS/mp:*:*) echo craynv-cray-unicosmp"$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/' exit ;; F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) FUJITSU_PROC=`uname -m | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz` FUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\///'` FUJITSU_REL=`echo "$UNAME_RELEASE" | sed -e 's/ /_/'` echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; 5000:UNIX_System_V:4.*:*) FUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\///'` FUJITSU_REL=`echo "$UNAME_RELEASE" | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/ /_/'` echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) echo "$UNAME_MACHINE"-pc-bsdi"$UNAME_RELEASE" exit ;; sparc*:BSD/OS:*:*) echo sparc-unknown-bsdi"$UNAME_RELEASE" exit ;; *:BSD/OS:*:*) echo "$UNAME_MACHINE"-unknown-bsdi"$UNAME_RELEASE" exit ;; *:FreeBSD:*:*) UNAME_PROCESSOR=`/usr/bin/uname -p` case "$UNAME_PROCESSOR" in amd64) UNAME_PROCESSOR=x86_64 ;; i386) UNAME_PROCESSOR=i586 ;; esac echo "$UNAME_PROCESSOR"-unknown-freebsd"`echo "$UNAME_RELEASE"|sed -e 's/[-(].*//'`" exit ;; i*:CYGWIN*:*) echo "$UNAME_MACHINE"-pc-cygwin exit ;; *:MINGW64*:*) echo "$UNAME_MACHINE"-pc-mingw64 exit ;; *:MINGW*:*) echo "$UNAME_MACHINE"-pc-mingw32 exit ;; *:MSYS*:*) echo "$UNAME_MACHINE"-pc-msys exit ;; i*:PW*:*) echo "$UNAME_MACHINE"-pc-pw32 exit ;; *:Interix*:*) case "$UNAME_MACHINE" in x86) echo i586-pc-interix"$UNAME_RELEASE" exit ;; authenticamd | genuineintel | EM64T) echo x86_64-unknown-interix"$UNAME_RELEASE" exit ;; IA64) echo ia64-unknown-interix"$UNAME_RELEASE" exit ;; esac ;; i*:UWIN*:*) echo "$UNAME_MACHINE"-pc-uwin exit ;; amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) echo x86_64-unknown-cygwin exit ;; prep*:SunOS:5.*:*) echo powerpcle-unknown-solaris2"`echo "$UNAME_RELEASE"|sed -e 's/[^.]*//'`" exit ;; *:GNU:*:*) # the GNU system echo "`echo "$UNAME_MACHINE"|sed -e 's,[-/].*$,,'`-unknown-$LIBC`echo "$UNAME_RELEASE"|sed -e 's,/.*$,,'`" exit ;; *:GNU/*:*:*) # other systems with GNU libc and userland echo "$UNAME_MACHINE-unknown-`echo "$UNAME_SYSTEM" | sed 's,^[^/]*/,,' | tr "[:upper:]" "[:lower:]"``echo "$UNAME_RELEASE"|sed -e 's/[-(].*//'`-$LIBC" exit ;; i*86:Minix:*:*) echo "$UNAME_MACHINE"-pc-minix exit ;; aarch64:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; aarch64_be:Linux:*:*) UNAME_MACHINE=aarch64_be echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; alpha:Linux:*:*) case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in EV5) UNAME_MACHINE=alphaev5 ;; EV56) UNAME_MACHINE=alphaev56 ;; PCA56) UNAME_MACHINE=alphapca56 ;; PCA57) UNAME_MACHINE=alphapca56 ;; EV6) UNAME_MACHINE=alphaev6 ;; EV67) UNAME_MACHINE=alphaev67 ;; EV68*) UNAME_MACHINE=alphaev68 ;; esac objdump --private-headers /bin/sh | grep -q ld.so.1 if test "$?" = 0 ; then LIBC=gnulibc1 ; fi echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; arc:Linux:*:* | arceb:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; arm*:Linux:*:*) eval "$set_cc_for_build" if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_EABI__ then echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" else if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_PCS_VFP then echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"eabi else echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"eabihf fi fi exit ;; avr32*:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; cris:Linux:*:*) echo "$UNAME_MACHINE"-axis-linux-"$LIBC" exit ;; crisv32:Linux:*:*) echo "$UNAME_MACHINE"-axis-linux-"$LIBC" exit ;; e2k:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; frv:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; hexagon:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; i*86:Linux:*:*) echo "$UNAME_MACHINE"-pc-linux-"$LIBC" exit ;; ia64:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; k1om:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; m32r*:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; m68*:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; mips:Linux:*:* | mips64:Linux:*:*) eval "$set_cc_for_build" sed 's/^ //' << EOF > "$dummy.c" #undef CPU #undef ${UNAME_MACHINE} #undef ${UNAME_MACHINE}el #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=${UNAME_MACHINE}el #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=${UNAME_MACHINE} #else CPU= #endif #endif EOF eval "`$CC_FOR_BUILD -E "$dummy.c" 2>/dev/null | grep '^CPU'`" test "x$CPU" != x && { echo "$CPU-unknown-linux-$LIBC"; exit; } ;; mips64el:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; openrisc*:Linux:*:*) echo or1k-unknown-linux-"$LIBC" exit ;; or32:Linux:*:* | or1k*:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; padre:Linux:*:*) echo sparc-unknown-linux-"$LIBC" exit ;; parisc64:Linux:*:* | hppa64:Linux:*:*) echo hppa64-unknown-linux-"$LIBC" exit ;; parisc:Linux:*:* | hppa:Linux:*:*) # Look for CPU level case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in PA7*) echo hppa1.1-unknown-linux-"$LIBC" ;; PA8*) echo hppa2.0-unknown-linux-"$LIBC" ;; *) echo hppa-unknown-linux-"$LIBC" ;; esac exit ;; ppc64:Linux:*:*) echo powerpc64-unknown-linux-"$LIBC" exit ;; ppc:Linux:*:*) echo powerpc-unknown-linux-"$LIBC" exit ;; ppc64le:Linux:*:*) echo powerpc64le-unknown-linux-"$LIBC" exit ;; ppcle:Linux:*:*) echo powerpcle-unknown-linux-"$LIBC" exit ;; riscv32:Linux:*:* | riscv64:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; s390:Linux:*:* | s390x:Linux:*:*) echo "$UNAME_MACHINE"-ibm-linux-"$LIBC" exit ;; sh64*:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; sh*:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; sparc:Linux:*:* | sparc64:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; tile*:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; vax:Linux:*:*) echo "$UNAME_MACHINE"-dec-linux-"$LIBC" exit ;; x86_64:Linux:*:*) if objdump -f /bin/sh | grep -q elf32-x86-64; then echo "$UNAME_MACHINE"-pc-linux-"$LIBC"x32 else echo "$UNAME_MACHINE"-pc-linux-"$LIBC" fi exit ;; xtensa*:Linux:*:*) echo "$UNAME_MACHINE"-unknown-linux-"$LIBC" exit ;; i*86:DYNIX/ptx:4*:*) # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. # earlier versions are messed up and put the nodename in both # sysname and nodename. echo i386-sequent-sysv4 exit ;; i*86:UNIX_SV:4.2MP:2.*) # Unixware is an offshoot of SVR4, but it has its own version # number series starting with 2... # I am not positive that other SVR4 systems won't match this, # I just have to hope. -- rms. # Use sysv4.2uw... so that sysv4* matches it. echo "$UNAME_MACHINE"-pc-sysv4.2uw"$UNAME_VERSION" exit ;; i*86:OS/2:*:*) # If we were able to find `uname', then EMX Unix compatibility # is probably installed. echo "$UNAME_MACHINE"-pc-os2-emx exit ;; i*86:XTS-300:*:STOP) echo "$UNAME_MACHINE"-unknown-stop exit ;; i*86:atheos:*:*) echo "$UNAME_MACHINE"-unknown-atheos exit ;; i*86:syllable:*:*) echo "$UNAME_MACHINE"-pc-syllable exit ;; i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*) echo i386-unknown-lynxos"$UNAME_RELEASE" exit ;; i*86:*DOS:*:*) echo "$UNAME_MACHINE"-pc-msdosdjgpp exit ;; i*86:*:4.*:*) UNAME_REL=`echo "$UNAME_RELEASE" | sed 's/\/MP$//'` if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo "$UNAME_MACHINE"-univel-sysv"$UNAME_REL" else echo "$UNAME_MACHINE"-pc-sysv"$UNAME_REL" fi exit ;; i*86:*:5:[678]*) # UnixWare 7.x, OpenUNIX and OpenServer 6. case `/bin/uname -X | grep "^Machine"` in *486*) UNAME_MACHINE=i486 ;; *Pentium) UNAME_MACHINE=i586 ;; *Pent*|*Celeron) UNAME_MACHINE=i686 ;; esac echo "$UNAME_MACHINE-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}{$UNAME_VERSION}" exit ;; i*86:*:3.2:*) if test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')` (/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486 (/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 (/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \ && UNAME_MACHINE=i686 (/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \ && UNAME_MACHINE=i686 echo "$UNAME_MACHINE"-pc-sco"$UNAME_REL" else echo "$UNAME_MACHINE"-pc-sysv32 fi exit ;; pc:*:*:*) # Left here for compatibility: # uname -m prints for DJGPP always 'pc', but it prints nothing about # the processor, so we play safe by assuming i586. # Note: whatever this is, it MUST be the same as what config.sub # prints for the "djgpp" host, or else GDB configure will decide that # this is a cross-build. echo i586-pc-msdosdjgpp exit ;; Intel:Mach:3*:*) echo i386-pc-mach3 exit ;; paragon:*:*:*) echo i860-intel-osf1 exit ;; i860:*:4.*:*) # i860-SVR4 if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then echo i860-stardent-sysv"$UNAME_RELEASE" # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. echo i860-unknown-sysv"$UNAME_RELEASE" # Unknown i860-SVR4 fi exit ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit ;; mc68k:UNIX:SYSTEM5:3.51m) echo m68k-convergent-sysv exit ;; M680?0:D-NIX:5.3:*) echo m68k-diab-dnix exit ;; M68*:*:R3V[5678]*:*) test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;; 3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3"$OS_REL"; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3"$OS_REL"; exit; } ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4; exit; } ;; NCR*:*:4.2:* | MPRAS*:*:4.2:*) OS_REL='.3' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3"$OS_REL"; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3"$OS_REL"; exit; } /bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \ && { echo i586-ncr-sysv4.3"$OS_REL"; exit; } ;; m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) echo m68k-unknown-lynxos"$UNAME_RELEASE" exit ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos"$UNAME_RELEASE" exit ;; rs6000:LynxOS:2.*:*) echo rs6000-unknown-lynxos"$UNAME_RELEASE" exit ;; PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*) echo powerpc-unknown-lynxos"$UNAME_RELEASE" exit ;; SM[BE]S:UNIX_SV:*:*) echo mips-dde-sysv"$UNAME_RELEASE" exit ;; RM*:ReliantUNIX-*:*:*) echo mips-sni-sysv4 exit ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` echo "$UNAME_MACHINE"-sni-sysv4 else echo ns32k-sni-sysv fi exit ;; PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says echo i586-unisys-sysv4 exit ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm echo hppa1.1-stratus-sysv4 exit ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. echo i860-stratus-sysv4 exit ;; i*86:VOS:*:*) # From Paul.Green@stratus.com. echo "$UNAME_MACHINE"-stratus-vos exit ;; *:VOS:*:*) # From Paul.Green@stratus.com. echo hppa1.1-stratus-vos exit ;; mc68*:A/UX:*:*) echo m68k-apple-aux"$UNAME_RELEASE" exit ;; news*:NEWS-OS:6*:*) echo mips-sony-newsos6 exit ;; R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*) if [ -d /usr/nec ]; then echo mips-nec-sysv"$UNAME_RELEASE" else echo mips-unknown-sysv"$UNAME_RELEASE" fi exit ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. echo powerpc-be-beos exit ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. echo powerpc-apple-beos exit ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. echo i586-pc-beos exit ;; BePC:Haiku:*:*) # Haiku running on Intel PC compatible. echo i586-pc-haiku exit ;; x86_64:Haiku:*:*) echo x86_64-unknown-haiku exit ;; SX-4:SUPER-UX:*:*) echo sx4-nec-superux"$UNAME_RELEASE" exit ;; SX-5:SUPER-UX:*:*) echo sx5-nec-superux"$UNAME_RELEASE" exit ;; SX-6:SUPER-UX:*:*) echo sx6-nec-superux"$UNAME_RELEASE" exit ;; SX-7:SUPER-UX:*:*) echo sx7-nec-superux"$UNAME_RELEASE" exit ;; SX-8:SUPER-UX:*:*) echo sx8-nec-superux"$UNAME_RELEASE" exit ;; SX-8R:SUPER-UX:*:*) echo sx8r-nec-superux"$UNAME_RELEASE" exit ;; SX-ACE:SUPER-UX:*:*) echo sxace-nec-superux"$UNAME_RELEASE" exit ;; Power*:Rhapsody:*:*) echo powerpc-apple-rhapsody"$UNAME_RELEASE" exit ;; *:Rhapsody:*:*) echo "$UNAME_MACHINE"-apple-rhapsody"$UNAME_RELEASE" exit ;; *:Darwin:*:*) UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown eval "$set_cc_for_build" if test "$UNAME_PROCESSOR" = unknown ; then UNAME_PROCESSOR=powerpc fi if test "`echo "$UNAME_RELEASE" | sed -e 's/\..*//'`" -le 10 ; then if [ "$CC_FOR_BUILD" != no_compiler_found ]; then if (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then case $UNAME_PROCESSOR in i386) UNAME_PROCESSOR=x86_64 ;; powerpc) UNAME_PROCESSOR=powerpc64 ;; esac fi # On 10.4-10.6 one might compile for PowerPC via gcc -arch ppc if (echo '#ifdef __POWERPC__'; echo IS_PPC; echo '#endif') | \ (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_PPC >/dev/null then UNAME_PROCESSOR=powerpc fi fi elif test "$UNAME_PROCESSOR" = i386 ; then # Avoid executing cc on OS X 10.9, as it ships with a stub # that puts up a graphical alert prompting to install # developer tools. Any system running Mac OS X 10.7 or # later (Darwin 11 and later) is required to have a 64-bit # processor. This is not true of the ARM version of Darwin # that Apple uses in portable devices. UNAME_PROCESSOR=x86_64 fi echo "$UNAME_PROCESSOR"-apple-darwin"$UNAME_RELEASE" exit ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) UNAME_PROCESSOR=`uname -p` if test "$UNAME_PROCESSOR" = x86; then UNAME_PROCESSOR=i386 UNAME_MACHINE=pc fi echo "$UNAME_PROCESSOR"-"$UNAME_MACHINE"-nto-qnx"$UNAME_RELEASE" exit ;; *:QNX:*:4*) echo i386-pc-qnx exit ;; NEO-*:NONSTOP_KERNEL:*:*) echo neo-tandem-nsk"$UNAME_RELEASE" exit ;; NSE-*:NONSTOP_KERNEL:*:*) echo nse-tandem-nsk"$UNAME_RELEASE" exit ;; NSR-*:NONSTOP_KERNEL:*:*) echo nsr-tandem-nsk"$UNAME_RELEASE" exit ;; NSV-*:NONSTOP_KERNEL:*:*) echo nsv-tandem-nsk"$UNAME_RELEASE" exit ;; NSX-*:NONSTOP_KERNEL:*:*) echo nsx-tandem-nsk"$UNAME_RELEASE" exit ;; *:NonStop-UX:*:*) echo mips-compaq-nonstopux exit ;; BS2000:POSIX*:*:*) echo bs2000-siemens-sysv exit ;; DS/*:UNIX_System_V:*:*) echo "$UNAME_MACHINE"-"$UNAME_SYSTEM"-"$UNAME_RELEASE" exit ;; *:Plan9:*:*) # "uname -m" is not consistent, so use $cputype instead. 386 # is converted to i386 for consistency with other x86 # operating systems. if test "$cputype" = 386; then UNAME_MACHINE=i386 else UNAME_MACHINE="$cputype" fi echo "$UNAME_MACHINE"-unknown-plan9 exit ;; *:TOPS-10:*:*) echo pdp10-unknown-tops10 exit ;; *:TENEX:*:*) echo pdp10-unknown-tenex exit ;; KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) echo pdp10-dec-tops20 exit ;; XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) echo pdp10-xkl-tops20 exit ;; *:TOPS-20:*:*) echo pdp10-unknown-tops20 exit ;; *:ITS:*:*) echo pdp10-unknown-its exit ;; SEI:*:*:SEIUX) echo mips-sei-seiux"$UNAME_RELEASE" exit ;; *:DragonFly:*:*) echo "$UNAME_MACHINE"-unknown-dragonfly"`echo "$UNAME_RELEASE"|sed -e 's/[-(].*//'`" exit ;; *:*VMS:*:*) UNAME_MACHINE=`(uname -p) 2>/dev/null` case "$UNAME_MACHINE" in A*) echo alpha-dec-vms ; exit ;; I*) echo ia64-dec-vms ; exit ;; V*) echo vax-dec-vms ; exit ;; esac ;; *:XENIX:*:SysV) echo i386-pc-xenix exit ;; i*86:skyos:*:*) echo "$UNAME_MACHINE"-pc-skyos"`echo "$UNAME_RELEASE" | sed -e 's/ .*$//'`" exit ;; i*86:rdos:*:*) echo "$UNAME_MACHINE"-pc-rdos exit ;; i*86:AROS:*:*) echo "$UNAME_MACHINE"-pc-aros exit ;; x86_64:VMkernel:*:*) echo "$UNAME_MACHINE"-unknown-esx exit ;; amd64:Isilon\ OneFS:*:*) echo x86_64-unknown-onefs exit ;; esac echo "$0: unable to guess system type" >&2 case "$UNAME_MACHINE:$UNAME_SYSTEM" in mips:Linux | mips64:Linux) # If we got here on MIPS GNU/Linux, output extra information. cat >&2 <&2 </dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null` /bin/uname -X = `(/bin/uname -X) 2>/dev/null` hostinfo = `(hostinfo) 2>/dev/null` /bin/universe = `(/bin/universe) 2>/dev/null` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null` /bin/arch = `(/bin/arch) 2>/dev/null` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null` UNAME_MACHINE = "$UNAME_MACHINE" UNAME_RELEASE = "$UNAME_RELEASE" UNAME_SYSTEM = "$UNAME_SYSTEM" UNAME_VERSION = "$UNAME_VERSION" EOF exit 1 # Local variables: # eval: (add-hook 'write-file-functions 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: cfitsio-3.47/config.sub0000755000225700000360000010645013464573431014400 0ustar cagordonlhea#! /bin/sh # Configuration validation subroutine script. # Copyright 1992-2018 Free Software Foundation, Inc. timestamp='2018-02-22' # This file is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 3 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, see . # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that # program. This Exception is an additional permission under section 7 # of the GNU General Public License, version 3 ("GPLv3"). # Please send patches to . # # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # You can get the latest version of this script from: # https://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or in some cases, the newer four-part form: # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # It is wrong to echo any other type of specification. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] CPU-MFR-OPSYS or ALIAS Canonicalize a configuration name. Options: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.sub ($timestamp) Copyright 1992-2018 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" exit 1 ;; *local*) # First pass through any local machine types. echo "$1" exit ;; * ) break ;; esac done case $# in 0) echo "$me: missing argument$help" >&2 exit 1;; 1) ;; *) echo "$me: too many arguments$help" >&2 exit 1;; esac # Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any). # Here we must recognize all the valid KERNEL-OS combinations. maybe_os=`echo "$1" | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in nto-qnx* | linux-gnu* | linux-android* | linux-dietlibc | linux-newlib* | \ linux-musl* | linux-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \ knetbsd*-gnu* | netbsd*-gnu* | netbsd*-eabi* | \ kopensolaris*-gnu* | cloudabi*-eabi* | \ storm-chaos* | os2-emx* | rtmk-nova*) os=-$maybe_os basic_machine=`echo "$1" | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` ;; android-linux) os=-linux-android basic_machine=`echo "$1" | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`-unknown ;; *) basic_machine=`echo "$1" | sed 's/-[^-]*$//'` if [ "$basic_machine" != "$1" ] then os=`echo "$1" | sed 's/.*-/-/'` else os=; fi ;; esac ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ -apple | -axis | -knuth | -cray | -microblaze*) os= basic_machine=$1 ;; -bluegene*) os=-cnk ;; -sim | -cisco | -oki | -wec | -winbond) os= basic_machine=$1 ;; -scout) ;; -wrs) os=-vxworks basic_machine=$1 ;; -chorusos*) os=-chorusos basic_machine=$1 ;; -chorusrdb) os=-chorusrdb basic_machine=$1 ;; -hiux*) os=-hiuxwe2 ;; -sco6) os=-sco5v6 basic_machine=`echo "$1" | sed -e 's/86-.*/86-pc/'` ;; -sco5) os=-sco3.2v5 basic_machine=`echo "$1" | sed -e 's/86-.*/86-pc/'` ;; -sco4) os=-sco3.2v4 basic_machine=`echo "$1" | sed -e 's/86-.*/86-pc/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo "$1" | sed -e 's/86-.*/86-pc/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo "$1" | sed -e 's/86-.*/86-pc/'` ;; -sco5v6*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo "$1" | sed -e 's/86-.*/86-pc/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo "$1" | sed -e 's/86-.*/86-pc/'` ;; -udk*) basic_machine=`echo "$1" | sed -e 's/86-.*/86-pc/'` ;; -isc) os=-isc2.2 basic_machine=`echo "$1" | sed -e 's/86-.*/86-pc/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo "$1" | sed -e 's/86-.*/86-pc/'` ;; -lynx*178) os=-lynxos178 ;; -lynx*5) os=-lynxos5 ;; -lynx*) os=-lynxos ;; -ptx*) basic_machine=`echo "$1" | sed -e 's/86-.*/86-sequent/'` ;; -psos*) os=-psos ;; -mint | -mint[0-9]*) basic_machine=m68k-atari os=-mint ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. 1750a | 580 \ | a29k \ | aarch64 | aarch64_be \ | alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \ | alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \ | am33_2.0 \ | arc | arceb \ | arm | arm[bl]e | arme[lb] | armv[2-8] | armv[3-8][lb] | armv7[arm] \ | avr | avr32 \ | ba \ | be32 | be64 \ | bfin \ | c4x | c8051 | clipper \ | d10v | d30v | dlx | dsp16xx \ | e2k | epiphany \ | fido | fr30 | frv | ft32 \ | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ | hexagon \ | i370 | i860 | i960 | ia16 | ia64 \ | ip2k | iq2000 \ | k1om \ | le32 | le64 \ | lm32 \ | m32c | m32r | m32rle | m68000 | m68k | m88k \ | maxq | mb | microblaze | microblazeel | mcore | mep | metag \ | mips | mipsbe | mipseb | mipsel | mipsle \ | mips16 \ | mips64 | mips64el \ | mips64octeon | mips64octeonel \ | mips64orion | mips64orionel \ | mips64r5900 | mips64r5900el \ | mips64vr | mips64vrel \ | mips64vr4100 | mips64vr4100el \ | mips64vr4300 | mips64vr4300el \ | mips64vr5000 | mips64vr5000el \ | mips64vr5900 | mips64vr5900el \ | mipsisa32 | mipsisa32el \ | mipsisa32r2 | mipsisa32r2el \ | mipsisa32r6 | mipsisa32r6el \ | mipsisa64 | mipsisa64el \ | mipsisa64r2 | mipsisa64r2el \ | mipsisa64r6 | mipsisa64r6el \ | mipsisa64sb1 | mipsisa64sb1el \ | mipsisa64sr71k | mipsisa64sr71kel \ | mipsr5900 | mipsr5900el \ | mipstx39 | mipstx39el \ | mn10200 | mn10300 \ | moxie \ | mt \ | msp430 \ | nds32 | nds32le | nds32be \ | nios | nios2 | nios2eb | nios2el \ | ns16k | ns32k \ | open8 | or1k | or1knd | or32 \ | pdp10 | pj | pjl \ | powerpc | powerpc64 | powerpc64le | powerpcle \ | pru \ | pyramid \ | riscv32 | riscv64 \ | rl78 | rx \ | score \ | sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[234]eb | sheb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \ | sparcv8 | sparcv9 | sparcv9b | sparcv9v \ | spu \ | tahoe | tic4x | tic54x | tic55x | tic6x | tic80 | tron \ | ubicom32 \ | v850 | v850e | v850e1 | v850e2 | v850es | v850e2v3 \ | visium \ | wasm32 \ | x86 | xc16x | xstormy16 | xtensa \ | z8k | z80) basic_machine=$basic_machine-unknown ;; c54x) basic_machine=tic54x-unknown ;; c55x) basic_machine=tic55x-unknown ;; c6x) basic_machine=tic6x-unknown ;; leon|leon[3-9]) basic_machine=sparc-$basic_machine ;; m6811 | m68hc11 | m6812 | m68hc12 | m68hcs12x | nvptx | picochip) basic_machine=$basic_machine-unknown os=-none ;; m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65) ;; ms1) basic_machine=mt-unknown ;; strongarm | thumb | xscale) basic_machine=arm-unknown ;; xgate) basic_machine=$basic_machine-unknown os=-none ;; xscaleeb) basic_machine=armeb-unknown ;; xscaleel) basic_machine=armel-unknown ;; # We use `pc' rather than `unknown' # because (1) that's what they normally are, and # (2) the word "unknown" tends to confuse beginning users. i*86 | x86_64) basic_machine=$basic_machine-pc ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`"$1"\': machine \`"$basic_machine"\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. 580-* \ | a29k-* \ | aarch64-* | aarch64_be-* \ | alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \ | alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \ | alphapca5[67]-* | alpha64pca5[67]-* | arc-* | arceb-* \ | arm-* | armbe-* | armle-* | armeb-* | armv*-* \ | avr-* | avr32-* \ | ba-* \ | be32-* | be64-* \ | bfin-* | bs2000-* \ | c[123]* | c30-* | [cjt]90-* | c4x-* \ | c8051-* | clipper-* | craynv-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ | e2k-* | elxsi-* \ | f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \ | h8300-* | h8500-* \ | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ | hexagon-* \ | i*86-* | i860-* | i960-* | ia16-* | ia64-* \ | ip2k-* | iq2000-* \ | k1om-* \ | le32-* | le64-* \ | lm32-* \ | m32c-* | m32r-* | m32rle-* \ | m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \ | m88110-* | m88k-* | maxq-* | mcore-* | metag-* \ | microblaze-* | microblazeel-* \ | mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \ | mips16-* \ | mips64-* | mips64el-* \ | mips64octeon-* | mips64octeonel-* \ | mips64orion-* | mips64orionel-* \ | mips64r5900-* | mips64r5900el-* \ | mips64vr-* | mips64vrel-* \ | mips64vr4100-* | mips64vr4100el-* \ | mips64vr4300-* | mips64vr4300el-* \ | mips64vr5000-* | mips64vr5000el-* \ | mips64vr5900-* | mips64vr5900el-* \ | mipsisa32-* | mipsisa32el-* \ | mipsisa32r2-* | mipsisa32r2el-* \ | mipsisa32r6-* | mipsisa32r6el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64r2-* | mipsisa64r2el-* \ | mipsisa64r6-* | mipsisa64r6el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ | mipsr5900-* | mipsr5900el-* \ | mipstx39-* | mipstx39el-* \ | mmix-* \ | mt-* \ | msp430-* \ | nds32-* | nds32le-* | nds32be-* \ | nios-* | nios2-* | nios2eb-* | nios2el-* \ | none-* | np1-* | ns16k-* | ns32k-* \ | open8-* \ | or1k*-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ | powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* \ | pru-* \ | pyramid-* \ | riscv32-* | riscv64-* \ | rl78-* | romp-* | rs6000-* | rx-* \ | sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \ | sparclite-* \ | sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | sv1-* | sx*-* \ | tahoe-* \ | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \ | tile*-* \ | tron-* \ | ubicom32-* \ | v850-* | v850e-* | v850e1-* | v850es-* | v850e2-* | v850e2v3-* \ | vax-* \ | visium-* \ | wasm32-* \ | we32k-* \ | x86-* | x86_64-* | xc16x-* | xps100-* \ | xstormy16-* | xtensa*-* \ | ymp-* \ | z8k-* | z80-*) ;; # Recognize the basic CPU types without company name, with glob match. xtensa*) basic_machine=$basic_machine-unknown ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 386bsd) basic_machine=i386-pc os=-bsd ;; 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; a29khif) basic_machine=a29k-amd os=-udi ;; abacus) basic_machine=abacus-unknown ;; adobe68k) basic_machine=m68010-adobe os=-scout ;; alliant | fx80) basic_machine=fx80-alliant ;; altos | altos3068) basic_machine=m68k-altos ;; am29k) basic_machine=a29k-none os=-bsd ;; amd64) basic_machine=x86_64-pc ;; amd64-*) basic_machine=x86_64-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; amdahl) basic_machine=580-amdahl os=-sysv ;; amiga | amiga-*) basic_machine=m68k-unknown ;; amigaos | amigados) basic_machine=m68k-unknown os=-amigaos ;; amigaunix | amix) basic_machine=m68k-unknown os=-sysv4 ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; apollo68bsd) basic_machine=m68k-apollo os=-bsd ;; aros) basic_machine=i386-pc os=-aros ;; asmjs) basic_machine=asmjs-unknown ;; aux) basic_machine=m68k-apple os=-aux ;; balance) basic_machine=ns32k-sequent os=-dynix ;; blackfin) basic_machine=bfin-unknown os=-linux ;; blackfin-*) basic_machine=bfin-`echo "$basic_machine" | sed 's/^[^-]*-//'` os=-linux ;; bluegene*) basic_machine=powerpc-ibm os=-cnk ;; c54x-*) basic_machine=tic54x-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; c55x-*) basic_machine=tic55x-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; c6x-*) basic_machine=tic6x-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; c90) basic_machine=c90-cray os=-unicos ;; cegcc) basic_machine=arm-unknown os=-cegcc ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; cray | j90) basic_machine=j90-cray os=-unicos ;; craynv) basic_machine=craynv-cray os=-unicosmp ;; cr16 | cr16-*) basic_machine=cr16-unknown os=-elf ;; crds | unos) basic_machine=m68k-crds ;; crisv32 | crisv32-* | etraxfs*) basic_machine=crisv32-axis ;; cris | cris-* | etrax*) basic_machine=cris-axis ;; crx) basic_machine=crx-unknown os=-elf ;; da30 | da30-*) basic_machine=m68k-da30 ;; decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; decsystem10* | dec10*) basic_machine=pdp10-dec os=-tops10 ;; decsystem20* | dec20*) basic_machine=pdp10-dec os=-tops20 ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; dicos) basic_machine=i686-pc os=-dicos ;; djgpp) basic_machine=i586-pc os=-msdosdjgpp ;; dpx20 | dpx20-*) basic_machine=rs6000-bull os=-bosx ;; dpx2*) basic_machine=m68k-bull os=-sysv3 ;; e500v[12]) basic_machine=powerpc-unknown os=$os"spe" ;; e500v[12]-*) basic_machine=powerpc-`echo "$basic_machine" | sed 's/^[^-]*-//'` os=$os"spe" ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; es1800 | OSE68k | ose68k | ose | OSE) basic_machine=m68k-ericsson os=-ose ;; fx2800) basic_machine=i860-alliant ;; genix) basic_machine=ns32k-ns ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; go32) basic_machine=i386-pc os=-go32 ;; h3050r* | hiux*) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; h8300hms) basic_machine=h8300-hitachi os=-hms ;; h8300xray) basic_machine=h8300-hitachi os=-xray ;; h8500hms) basic_machine=h8500-hitachi os=-hms ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300-*) basic_machine=m68k-hp ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hp3k9[0-9][0-9] | hp9[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k2[0-9][0-9] | hp9k31[0-9]) basic_machine=m68000-hp ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k6[0-9][0-9] | hp6[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k7[0-79][0-9] | hp7[0-79][0-9]) basic_machine=hppa1.1-hp ;; hp9k78[0-9] | hp78[0-9]) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[0-9][13679] | hp8[0-9][13679]) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; hppaosf) basic_machine=hppa1.1-hp os=-osf ;; hppro) basic_machine=hppa1.1-hp os=-proelf ;; i370-ibm* | ibm*) basic_machine=i370-ibm ;; i*86v32) basic_machine=`echo "$1" | sed -e 's/86.*/86-pc/'` os=-sysv32 ;; i*86v4*) basic_machine=`echo "$1" | sed -e 's/86.*/86-pc/'` os=-sysv4 ;; i*86v) basic_machine=`echo "$1" | sed -e 's/86.*/86-pc/'` os=-sysv ;; i*86sol2) basic_machine=`echo "$1" | sed -e 's/86.*/86-pc/'` os=-solaris2 ;; i386mach) basic_machine=i386-mach os=-mach ;; vsta) basic_machine=i386-unknown os=-vsta ;; iris | iris4d) basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; leon-*|leon[3-9]-*) basic_machine=sparc-`echo "$basic_machine" | sed 's/-.*//'` ;; m68knommu) basic_machine=m68k-unknown os=-linux ;; m68knommu-*) basic_machine=m68k-`echo "$basic_machine" | sed 's/^[^-]*-//'` os=-linux ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; microblaze*) basic_machine=microblaze-xilinx ;; mingw64) basic_machine=x86_64-pc os=-mingw64 ;; mingw32) basic_machine=i686-pc os=-mingw32 ;; mingw32ce) basic_machine=arm-unknown os=-mingw32ce ;; miniframe) basic_machine=m68000-convergent ;; *mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*) basic_machine=m68k-atari os=-mint ;; mips3*-*) basic_machine=`echo "$basic_machine" | sed -e 's/mips3/mips64/'` ;; mips3*) basic_machine=`echo "$basic_machine" | sed -e 's/mips3/mips64/'`-unknown ;; monitor) basic_machine=m68k-rom68k os=-coff ;; morphos) basic_machine=powerpc-unknown os=-morphos ;; moxiebox) basic_machine=moxie-unknown os=-moxiebox ;; msdos) basic_machine=i386-pc os=-msdos ;; ms1-*) basic_machine=`echo "$basic_machine" | sed -e 's/ms1-/mt-/'` ;; msys) basic_machine=i686-pc os=-msys ;; mvs) basic_machine=i370-ibm os=-mvs ;; nacl) basic_machine=le32-unknown os=-nacl ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; netbsd386) basic_machine=i386-unknown os=-netbsd ;; netwinder) basic_machine=armv4l-rebel os=-linux ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; necv70) basic_machine=v70-nec os=-sysv ;; next | m*-next) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; mon960) basic_machine=i960-intel os=-mon960 ;; nonstopux) basic_machine=mips-compaq os=-nonstopux ;; np1) basic_machine=np1-gould ;; neo-tandem) basic_machine=neo-tandem ;; nse-tandem) basic_machine=nse-tandem ;; nsr-tandem) basic_machine=nsr-tandem ;; nsv-tandem) basic_machine=nsv-tandem ;; nsx-tandem) basic_machine=nsx-tandem ;; op50n-* | op60c-*) basic_machine=hppa1.1-oki os=-proelf ;; openrisc | openrisc-*) basic_machine=or32-unknown ;; os400) basic_machine=powerpc-ibm os=-os400 ;; OSE68000 | ose68000) basic_machine=m68000-ericsson os=-ose ;; os68k) basic_machine=m68k-none os=-os68k ;; pa-hitachi) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; paragon) basic_machine=i860-intel os=-osf ;; parisc) basic_machine=hppa-unknown os=-linux ;; parisc-*) basic_machine=hppa-`echo "$basic_machine" | sed 's/^[^-]*-//'` os=-linux ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; pc98) basic_machine=i386-pc ;; pc98-*) basic_machine=i386-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; pentium | p5 | k5 | k6 | nexgen | viac3) basic_machine=i586-pc ;; pentiumpro | p6 | 6x86 | athlon | athlon_*) basic_machine=i686-pc ;; pentiumii | pentium2 | pentiumiii | pentium3) basic_machine=i686-pc ;; pentium4) basic_machine=i786-pc ;; pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*) basic_machine=i586-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; pentiumpro-* | p6-* | 6x86-* | athlon-*) basic_machine=i686-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*) basic_machine=i686-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; pentium4-*) basic_machine=i786-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; pn) basic_machine=pn-gould ;; power) basic_machine=power-ibm ;; ppc | ppcbe) basic_machine=powerpc-unknown ;; ppc-* | ppcbe-*) basic_machine=powerpc-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; ppcle | powerpclittle) basic_machine=powerpcle-unknown ;; ppcle-* | powerpclittle-*) basic_machine=powerpcle-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; ppc64) basic_machine=powerpc64-unknown ;; ppc64-*) basic_machine=powerpc64-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; ppc64le | powerpc64little) basic_machine=powerpc64le-unknown ;; ppc64le-* | powerpc64little-*) basic_machine=powerpc64le-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; ps2) basic_machine=i386-ibm ;; pw32) basic_machine=i586-unknown os=-pw32 ;; rdos | rdos64) basic_machine=x86_64-pc os=-rdos ;; rdos32) basic_machine=i386-pc os=-rdos ;; rom68k) basic_machine=m68k-rom68k os=-coff ;; rm[46]00) basic_machine=mips-siemens ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; s390 | s390-*) basic_machine=s390-ibm ;; s390x | s390x-*) basic_machine=s390x-ibm ;; sa29200) basic_machine=a29k-amd os=-udi ;; sb1) basic_machine=mipsisa64sb1-unknown ;; sb1el) basic_machine=mipsisa64sb1el-unknown ;; sde) basic_machine=mipsisa32-sde os=-elf ;; sei) basic_machine=mips-sei os=-seiux ;; sequent) basic_machine=i386-sequent ;; sh5el) basic_machine=sh5le-unknown ;; simso-wrs) basic_machine=sparclite-wrs os=-vxworks ;; sps7) basic_machine=m68k-bull os=-sysv2 ;; spur) basic_machine=spur-unknown ;; st2000) basic_machine=m68k-tandem ;; stratus) basic_machine=i860-stratus os=-sysv4 ;; strongarm-* | thumb-*) basic_machine=arm-`echo "$basic_machine" | sed 's/^[^-]*-//'` ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun4sol2) basic_machine=sparc-sun os=-solaris2 ;; sun3 | sun3-*) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; sv1) basic_machine=sv1-cray os=-unicos ;; symmetry) basic_machine=i386-sequent os=-dynix ;; t3e) basic_machine=alphaev5-cray os=-unicos ;; t90) basic_machine=t90-cray os=-unicos ;; tile*) basic_machine=$basic_machine-unknown os=-linux-gnu ;; tx39) basic_machine=mipstx39-unknown ;; tx39el) basic_machine=mipstx39el-unknown ;; toad1) basic_machine=pdp10-xkl os=-tops20 ;; tower | tower-32) basic_machine=m68k-ncr ;; tpf) basic_machine=s390x-ibm os=-tpf ;; udi29k) basic_machine=a29k-amd os=-udi ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; v810 | necv810) basic_machine=v810-nec os=-none ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; vpp*|vx|vx-*) basic_machine=f301-fujitsu ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; vxworks29k) basic_machine=a29k-wrs os=-vxworks ;; w65*) basic_machine=w65-wdc os=-none ;; w89k-*) basic_machine=hppa1.1-winbond os=-proelf ;; x64) basic_machine=x86_64-pc ;; xbox) basic_machine=i686-pc os=-mingw32 ;; xps | xps100) basic_machine=xps100-honeywell ;; xscale-* | xscalee[bl]-*) basic_machine=`echo "$basic_machine" | sed 's/^xscale/arm/'` ;; ymp) basic_machine=ymp-cray os=-unicos ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. w89k) basic_machine=hppa1.1-winbond ;; op50n) basic_machine=hppa1.1-oki ;; op60c) basic_machine=hppa1.1-oki ;; romp) basic_machine=romp-ibm ;; mmix) basic_machine=mmix-knuth ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; pdp11) basic_machine=pdp11-dec ;; we32k) basic_machine=we32k-att ;; sh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele) basic_machine=sh-unknown ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; mac | mpw | mac-mpw) basic_machine=m68k-apple ;; pmac | pmac-mpw) basic_machine=powerpc-apple ;; *-unknown) # Make sure to match an already-canonicalized machine name. ;; *) echo Invalid configuration \`"$1"\': machine \`"$basic_machine"\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo "$basic_machine" | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo "$basic_machine" | sed 's/commodore.*/cbm/'` ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # First match some system type aliases that might get confused # with valid system types. # -solaris* is a basic system type, with this one exception. -auroraux) os=-auroraux ;; -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; -unixware*) os=-sysv4.2uw ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` ;; # es1800 is here to avoid being matched by es* (a different OS) -es1800*) os=-ose ;; # Now accept the basic system types. # The portable systems comes first. # Each alternative MUST end in a * to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -*vms* | -sco* | -esix* | -isc* | -aix* | -cnk* | -sunos | -sunos[34]*\ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -auroraux* | -solaris* \ | -sym* | -kopensolaris* | -plan9* \ | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ | -aos* | -aros* | -cloudabi* | -sortix* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -knetbsd* | -mirbsd* | -netbsd* \ | -bitrig* | -openbsd* | -solidbsd* | -libertybsd* \ | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \ | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \ | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ | -chorusos* | -chorusrdb* | -cegcc* | -glidix* \ | -cygwin* | -msys* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -midipix* | -mingw32* | -mingw64* | -linux-gnu* | -linux-android* \ | -linux-newlib* | -linux-musl* | -linux-uclibc* \ | -uxpv* | -beos* | -mpeix* | -udk* | -moxiebox* \ | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ | -morphos* | -superux* | -rtmk* | -windiss* \ | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \ | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es* \ | -onefs* | -tirtos* | -phoenix* | -fuchsia* | -redox* | -bme* \ | -midnightbsd*) # Remember, each alternative MUST END IN *, to match a version number. ;; -qnx*) case $basic_machine in x86-* | i*86-*) ;; *) os=-nto$os ;; esac ;; -nto-qnx*) ;; -nto*) os=`echo $os | sed -e 's|nto|nto-qnx|'` ;; -sim | -xray | -os68k* | -v88r* \ | -windows* | -osx | -abug | -netware* | -os9* \ | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*) ;; -mac*) os=`echo "$os" | sed -e 's|mac|macos|'` ;; -linux-dietlibc) os=-linux-dietlibc ;; -linux*) os=`echo $os | sed -e 's|linux|linux-gnu|'` ;; -sunos5*) os=`echo "$os" | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo "$os" | sed -e 's|sunos6|solaris3|'` ;; -opened*) os=-openedition ;; -os400*) os=-os400 ;; -wince*) os=-wince ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -atheos*) os=-atheos ;; -syllable*) os=-syllable ;; -386bsd) os=-bsd ;; -ctix* | -uts*) os=-sysv ;; -nova*) os=-rtmk-nova ;; -ns2) os=-nextstep2 ;; -nsk*) os=-nsk ;; # Preserve the version number of sinix5. -sinix5.*) os=`echo $os | sed -e 's|sinix|sysv|'` ;; -sinix*) os=-sysv4 ;; -tpf*) os=-tpf ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4*) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -ose*) os=-ose ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) os=-mint ;; -zvmoe) os=-zvmoe ;; -dicos*) os=-dicos ;; -pikeos*) # Until real need of OS specific support for # particular features comes up, bare metal # configurations are quite functional. case $basic_machine in arm*) os=-eabi ;; *) os=-elf ;; esac ;; -nacl*) ;; -ios) ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $os | sed 's/[^-]*-//'` echo Invalid configuration \`"$1"\': system \`"$os"\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in score-*) os=-elf ;; spu-*) os=-elf ;; *-acorn) os=-riscix1.2 ;; arm*-rebel) os=-linux ;; arm*-semi) os=-aout ;; c4x-* | tic4x-*) os=-coff ;; c8051-*) os=-elf ;; hexagon-*) os=-elf ;; tic54x-*) os=-coff ;; tic55x-*) os=-coff ;; tic6x-*) os=-coff ;; # This must come before the *-dec entry. pdp10-*) os=-tops20 ;; pdp11-*) os=-none ;; *-dec | vax-*) os=-ultrix4.2 ;; m68*-apollo) os=-domain ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 ;; m68*-cisco) os=-aout ;; mep-*) os=-elf ;; mips*-cisco) os=-elf ;; mips*-*) os=-elf ;; or32-*) os=-coff ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; pru-*) os=-elf ;; *-be) os=-beos ;; *-ibm) os=-aix ;; *-knuth) os=-mmixware ;; *-wec) os=-proelf ;; *-winbond) os=-proelf ;; *-oki) os=-proelf ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigaos ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m68k-ccur) os=-rtu ;; m88k-omron*) os=-luna ;; *-next) os=-nextstep ;; *-sequent) os=-ptx ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-siemens) os=-sysv4 ;; *-masscomp) os=-rtu ;; f30[01]-fujitsu | f700-fujitsu) os=-uxpv ;; *-rom68k) os=-coff ;; *-*bug) os=-coff ;; *-apple) os=-macos ;; *-atari*) os=-mint ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -cnk*|-aix*) vendor=ibm ;; -beos*) vendor=be ;; -hpux*) vendor=hp ;; -mpeix*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs* | -opened*) vendor=ibm ;; -os400*) vendor=ibm ;; -ptx*) vendor=sequent ;; -tpf*) vendor=ibm ;; -vxsim* | -vxworks* | -windiss*) vendor=wrs ;; -aux*) vendor=apple ;; -hms*) vendor=hitachi ;; -mpw* | -macos*) vendor=apple ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) vendor=atari ;; -vos*) vendor=stratus ;; esac basic_machine=`echo "$basic_machine" | sed "s/unknown/$vendor/"` ;; esac echo "$basic_machine$os" exit # Local variables: # eval: (add-hook 'write-file-functions 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: cfitsio-3.47/configure0000755000225700000360000065237413471052231014323 0ustar cagordonlhea#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.69. # # # Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc. # # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # Use a proper internal environment variable to ensure we don't fall # into an infinite loop, continuously re-executing ourselves. if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then _as_can_reexec=no; export _as_can_reexec; # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 as_fn_exit 255 fi # We don't want this to propagate to other subprocesses. { _as_can_reexec=; unset _as_can_reexec;} if test "x$CONFIG_SHELL" = x; then as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi " as_required="as_fn_return () { (exit \$1); } as_fn_success () { as_fn_return 0; } as_fn_failure () { as_fn_return 1; } as_fn_ret_success () { return 0; } as_fn_ret_failure () { return 1; } exitcode=0 as_fn_success || { exitcode=1; echo as_fn_success failed.; } as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; } as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; } as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; } if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then : else exitcode=1; echo positional parameters were not saved. fi test x\$exitcode = x0 || exit 1 test -x / || exit 1" as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" && test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1 test \$(( 1 + 1 )) = 2 || exit 1" if (eval "$as_required") 2>/dev/null; then : as_have_required=yes else as_have_required=no fi if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then : else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_found=false for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. as_found=: case $as_dir in #( /*) for as_base in sh bash ksh sh5; do # Try only shells that exist, to save several forks. as_shell=$as_dir/$as_base if { test -f "$as_shell" || test -f "$as_shell.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then : CONFIG_SHELL=$as_shell as_have_required=yes if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then : break 2 fi fi done;; esac as_found=false done $as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then : CONFIG_SHELL=$SHELL as_have_required=yes fi; } IFS=$as_save_IFS if test "x$CONFIG_SHELL" != x; then : export CONFIG_SHELL # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 exit 255 fi if test x$as_have_required = xno; then : $as_echo "$0: This script requires a shell more modern than all" $as_echo "$0: the shells that I found on your system." if test x${ZSH_VERSION+set} = xset ; then $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should" $as_echo "$0: be upgraded to zsh 4.3.4 or later." else $as_echo "$0: Please tell bug-autoconf@gnu.org about your system, $0: including any error possibly output before this $0: message. Then install a modern shell, or manually run $0: the script under such a shell if you do have one." fi exit 1 fi fi fi SHELL=${CONFIG_SHELL-/bin/sh} export SHELL # Unset more variables known to interfere with behavior of common tools. CLICOLOR_FORCE= GREP_OPTIONS= unset CLICOLOR_FORCE GREP_OPTIONS ## --------------------- ## ## M4sh Shell Functions. ## ## --------------------- ## # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits as_lineno_1=$LINENO as_lineno_1a=$LINENO as_lineno_2=$LINENO as_lineno_2a=$LINENO eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" && test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || { # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; } # If we had to re-execute with $CONFIG_SHELL, we're ensured to have # already done that, so ensure we don't try to do so again and fall # in an infinite loop. This has already happened in practice. _as_can_reexec=no; export _as_can_reexec # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi as_test_x='test -x' as_executable_p=as_fn_executable_p # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" test -n "$DJDIR" || exec 7<&0 &1 # Name of the host. # hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` # # Initializations. # ac_default_prefix=/usr/local ac_clean_files= ac_config_libobj_dir=. LIBOBJS= cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= # Identity of this package. PACKAGE_NAME= PACKAGE_TARNAME= PACKAGE_VERSION= PACKAGE_STRING= PACKAGE_BUGREPORT= PACKAGE_URL= ac_unique_file="fitscore.c" # Factoring default headers for most tests. ac_includes_default="\ #include #ifdef HAVE_SYS_TYPES_H # include #endif #ifdef HAVE_SYS_STAT_H # include #endif #ifdef STDC_HEADERS # include # include #else # ifdef HAVE_STDLIB_H # include # endif #endif #ifdef HAVE_STRING_H # if !defined STDC_HEADERS && defined HAVE_MEMORY_H # include # endif # include #endif #ifdef HAVE_STRINGS_H # include #endif #ifdef HAVE_INTTYPES_H # include #endif #ifdef HAVE_STDINT_H # include #endif #ifdef HAVE_UNISTD_H # include #endif" ac_default_prefix=`pwd` ac_subst_vars='LTLIBOBJS LIBOBJS my_shmem LDFLAGS_BIN F77_WRAPPERS CFITSIO_SHLIB_SONAME CFITSIO_SHLIB SHLIB_SUFFIX SHLIB_LD LIBPRE ARCH LIBS_CURL CURLCONFIG GCCVERSION SSE_FLAGS RANLIB ARCHIVE AR FC INSTALL_ROOT GSIFTP_SRC EGREP GREP CPP OBJEXT EXEEXT ac_ct_CC CPPFLAGS LDFLAGS CFLAGS CC CFITSIO_SONAME CFITSIO_MINOR CFITSIO_MAJOR target_os target_vendor target_cpu target host_os host_vendor host_cpu host build_os build_vendor build_cpu build target_alias host_alias build_alias LIBS ECHO_T ECHO_N ECHO_C DEFS mandir localedir libdir psdir pdfdir dvidir htmldir infodir docdir oldincludedir includedir localstatedir sharedstatedir sysconfdir datadir datarootdir libexecdir sbindir bindir program_transform_name prefix exec_prefix PACKAGE_URL PACKAGE_BUGREPORT PACKAGE_STRING PACKAGE_VERSION PACKAGE_TARNAME PACKAGE_NAME PATH_SEPARATOR SHELL' ac_subst_files='' ac_user_opts=' enable_option_checking enable_curl enable_reentrant enable_sse2 enable_ssse3 enable_hera with_bzip2 with_gsiftp with_gsiftp_flavour ' ac_precious_vars='build_alias host_alias target_alias CC CFLAGS LDFLAGS LIBS CPPFLAGS CPP' # Initialize some variables set by options. ac_init_help= ac_init_version=false ac_unrecognized_opts= ac_unrecognized_sep= # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. # (The list follows the same order as the GNU Coding Standards.) bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datarootdir='${prefix}/share' datadir='${datarootdir}' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' includedir='${prefix}/include' oldincludedir='/usr/include' docdir='${datarootdir}/doc/${PACKAGE}' infodir='${datarootdir}/info' htmldir='${docdir}' dvidir='${docdir}' pdfdir='${docdir}' psdir='${docdir}' libdir='${exec_prefix}/lib' localedir='${datarootdir}/locale' mandir='${datarootdir}/man' ac_prev= ac_dashdash= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval $ac_prev=\$ac_option ac_prev= continue fi case $ac_option in *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; *=) ac_optarg= ;; *) ac_optarg=yes ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_dashdash$ac_option in --) ac_dashdash=yes ;; -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=*) datadir=$ac_optarg ;; -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ | --dataroo | --dataro | --datar) ac_prev=datarootdir ;; -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) datarootdir=$ac_optarg ;; -disable-* | --disable-*) ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=no ;; -docdir | --docdir | --docdi | --doc | --do) ac_prev=docdir ;; -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) docdir=$ac_optarg ;; -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) ac_prev=dvidir ;; -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) dvidir=$ac_optarg ;; -enable-* | --enable-*) ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=\$ac_optarg ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) ac_prev=htmldir ;; -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ | --ht=*) htmldir=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localedir | --localedir | --localedi | --localed | --locale) ac_prev=localedir ;; -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) localedir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst | --locals) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) ac_prev=pdfdir ;; -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) pdfdir=$ac_optarg ;; -psdir | --psdir | --psdi | --psd | --ps) ac_prev=psdir ;; -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) psdir=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=\$ac_optarg ;; -without-* | --without-*) ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=no ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) as_fn_error $? "unrecognized option: \`$ac_option' Try \`$0 --help' for more information" ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. case $ac_envvar in #( '' | [0-9]* | *[!_$as_cr_alnum]* ) as_fn_error $? "invalid variable name: \`$ac_envvar'" ;; esac eval $ac_envvar=\$ac_optarg export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}" ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` as_fn_error $? "missing argument to $ac_option" fi if test -n "$ac_unrecognized_opts"; then case $enable_option_checking in no) ;; fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;; *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;; esac fi # Check all directory arguments for consistency. for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ datadir sysconfdir sharedstatedir localstatedir includedir \ oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ libdir localedir mandir do eval ac_val=\$$ac_var # Remove trailing slashes. case $ac_val in */ ) ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'` eval $ac_var=\$ac_val;; esac # Be sure to have absolute directory names. case $ac_val in [\\/$]* | ?:[\\/]* ) continue;; NONE | '' ) case $ac_var in *prefix ) continue;; esac;; esac as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val" done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null ac_pwd=`pwd` && test -n "$ac_pwd" && ac_ls_di=`ls -di .` && ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || as_fn_error $? "working directory cannot be determined" test "X$ac_ls_di" = "X$ac_pwd_ls_di" || as_fn_error $? "pwd does not report name of working directory" # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then the parent directory. ac_confdir=`$as_dirname -- "$as_myself" || $as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_myself" : 'X\(//\)[^/]' \| \ X"$as_myself" : 'X\(//\)$' \| \ X"$as_myself" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_myself" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` srcdir=$ac_confdir if test ! -r "$srcdir/$ac_unique_file"; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r "$srcdir/$ac_unique_file"; then test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir" fi ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" ac_abs_confdir=`( cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg" pwd)` # When building in place, set srcdir=. if test "$ac_abs_confdir" = "$ac_pwd"; then srcdir=. fi # Remove unnecessary trailing slashes from srcdir. # Double slashes in file names in object file debugging info # mess up M-x gdb in Emacs. case $srcdir in */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; esac for ac_var in $ac_precious_vars; do eval ac_env_${ac_var}_set=\${${ac_var}+set} eval ac_env_${ac_var}_value=\$${ac_var} eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} eval ac_cv_env_${ac_var}_value=\$${ac_var} done # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures this package to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking ...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] --datadir=DIR read-only architecture-independent data [DATAROOTDIR] --infodir=DIR info documentation [DATAROOTDIR/info] --localedir=DIR locale-dependent data [DATAROOTDIR/locale] --mandir=DIR man documentation [DATAROOTDIR/man] --docdir=DIR documentation root [DATAROOTDIR/doc/PACKAGE] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF System types: --build=BUILD configure for building on BUILD [guessed] --host=HOST cross-compile to build programs to run on HOST [BUILD] --target=TARGET configure for building compilers for TARGET [HOST] _ACEOF fi if test -n "$ac_init_help"; then cat <<\_ACEOF Optional Features: --disable-option-checking ignore unrecognized --enable/--with options --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --disable-curl Disable linking with the curl library. Disables remote file i/o support --enable-reentrant Enable reentrant multithreading --enable-sse2 Enable use of instructions in the SSE2 extended instruction set --enable-ssse3 Enable use of instructions in the SSSE3 extended instruction set --enable-hera Build for HERA (ASD use only) Optional Packages: --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --with-bzip2[=PATH] Enable bzip2 support. Optional path to the location of include/bzlib.h and lib/libbz2 --with-gsiftp[=PATH] Enable Globus Toolkit gsiftp protocol support --with-gsiftp-flavour[=PATH] Define Globus Toolkit gsiftp protocol flavour Some influential environment variables: CC C compiler command CFLAGS C compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory LIBS libraries to pass to the linker, e.g. -l CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory CPP C preprocessor Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to the package provider. _ACEOF ac_status=$? fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d "$ac_dir" || { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } || continue ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" || { ac_status=$?; continue; } # Check for guested configure. if test -f "$ac_srcdir/configure.gnu"; then echo && $SHELL "$ac_srcdir/configure.gnu" --help=recursive elif test -f "$ac_srcdir/configure"; then echo && $SHELL "$ac_srcdir/configure" --help=recursive else $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi || ac_status=$? cd "$ac_pwd" || { ac_status=$?; break; } done fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF configure generated by GNU Autoconf 2.69 Copyright (C) 2012 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. _ACEOF exit fi ## ------------------------ ## ## Autoconf initialization. ## ## ------------------------ ## # ac_fn_c_try_compile LINENO # -------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_compile # ac_fn_c_try_link LINENO # ----------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || test -x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_link # ac_fn_c_try_cpp LINENO # ---------------------- # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } > conftest.i && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_cpp # ac_fn_c_check_header_mongrel LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists, giving a warning if it cannot be compiled using # the include files in INCLUDES and setting the cache variable VAR # accordingly. ac_fn_c_check_header_mongrel () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if eval \${$3+:} false; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } else # Is the header compilable? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 usability" >&5 $as_echo_n "checking $2 usability... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_header_compiler=yes else ac_header_compiler=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_compiler" >&5 $as_echo "$ac_header_compiler" >&6; } # Is the header present? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 presence" >&5 $as_echo_n "checking $2 presence... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include <$2> _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : ac_header_preproc=yes else ac_header_preproc=no fi rm -f conftest.err conftest.i conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_preproc" >&5 $as_echo "$ac_header_preproc" >&6; } # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in #(( yes:no: ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&5 $as_echo "$as_me: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ;; no:yes:* ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: present but cannot be compiled" >&5 $as_echo "$as_me: WARNING: $2: present but cannot be compiled" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: check for missing prerequisite headers?" >&5 $as_echo "$as_me: WARNING: $2: check for missing prerequisite headers?" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: see the Autoconf documentation" >&5 $as_echo "$as_me: WARNING: $2: see the Autoconf documentation" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&5 $as_echo "$as_me: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else eval "$3=\$ac_header_compiler" fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_header_mongrel # ac_fn_c_try_run LINENO # ---------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. Assumes # that executables *can* be run. ac_fn_c_try_run () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { ac_try='./conftest$ac_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then : ac_retval=0 else $as_echo "$as_me: program exited with status $ac_status" >&5 $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=$ac_status fi rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_run # ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists and can be compiled using the include files in # INCLUDES, setting the cache variable VAR accordingly. ac_fn_c_check_header_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_header_compile # ac_fn_c_check_func LINENO FUNC VAR # ---------------------------------- # Tests whether FUNC exists, setting the cache variable VAR accordingly ac_fn_c_check_func () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Define $2 to an innocuous variant, in case declares $2. For example, HP-UX 11i declares gettimeofday. */ #define $2 innocuous_$2 /* System header to define __stub macros and hopefully few prototypes, which can conflict with char $2 (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef $2 /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char $2 (); /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined __stub_$2 || defined __stub___$2 choke me #endif int main () { return $2 (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_func cat >config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by $as_me, which was generated by GNU Autoconf 2.69. Invocation command line was $ $0 $@ _ACEOF exec 5>>config.log { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. $as_echo "PATH: $as_dir" done IFS=$as_save_IFS } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;; 2) as_fn_append ac_configure_args1 " '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi as_fn_append ac_configure_args " '$ac_arg'" ;; esac done done { ac_configure_args0=; unset ac_configure_args0;} { ac_configure_args1=; unset ac_configure_args1;} # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Use '\'' to represent an apostrophe within the trap. # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo $as_echo "## ---------------- ## ## Cache variables. ## ## ---------------- ##" echo # The following way of writing the cache mishandles newlines in values, ( for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( *${as_nl}ac_space=\ *) sed -n \ "s/'\''/'\''\\\\'\'''\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" ;; #( *) sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) echo $as_echo "## ----------------- ## ## Output variables. ## ## ----------------- ##" echo for ac_var in $ac_subst_vars do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo if test -n "$ac_subst_files"; then $as_echo "## ------------------- ## ## File substitutions. ## ## ------------------- ##" echo for ac_var in $ac_subst_files do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo fi if test -s confdefs.h; then $as_echo "## ----------- ## ## confdefs.h. ## ## ----------- ##" echo cat confdefs.h echo fi test "$ac_signal" != 0 && $as_echo "$as_me: caught signal $ac_signal" $as_echo "$as_me: exit $exit_status" } >&5 rm -f core *.core core.conftest.* && rm -f -r conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -f -r conftest* confdefs.h $as_echo "/* confdefs.h */" > confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_URL "$PACKAGE_URL" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer an explicitly selected file to automatically selected ones. ac_site_file1=NONE ac_site_file2=NONE if test -n "$CONFIG_SITE"; then # We do not want a PATH search for config.site. case $CONFIG_SITE in #(( -*) ac_site_file1=./$CONFIG_SITE;; */*) ac_site_file1=$CONFIG_SITE;; *) ac_site_file1=./$CONFIG_SITE;; esac elif test "x$prefix" != xNONE; then ac_site_file1=$prefix/share/config.site ac_site_file2=$prefix/etc/config.site else ac_site_file1=$ac_default_prefix/share/config.site ac_site_file2=$ac_default_prefix/etc/config.site fi for ac_site_file in "$ac_site_file1" "$ac_site_file2" do test "x$ac_site_file" = xNONE && continue if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5 $as_echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" \ || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "failed to load site script $ac_site_file See \`config.log' for more details" "$LINENO" 5; } fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special files # actually), so we avoid doing that. DJGPP emulates it as a regular file. if test /dev/null != "$cache_file" && test -f "$cache_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5 $as_echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . "$cache_file";; *) . "./$cache_file";; esac fi else { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5 $as_echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in $ac_precious_vars; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val=\$ac_cv_env_${ac_var}_value eval ac_new_val=\$ac_env_${ac_var}_value case $ac_old_set,$ac_new_set in set,) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then # differences in whitespace do not lead to failure. ac_old_val_w=`echo x $ac_old_val` ac_new_val_w=`echo x $ac_new_val` if test "$ac_old_val_w" != "$ac_new_val_w"; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5 $as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} ac_cache_corrupted=: else { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5 $as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;} eval $ac_var=\$ac_old_val fi { $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5 $as_echo "$as_me: former value: \`$ac_old_val'" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5 $as_echo "$as_me: current value: \`$ac_new_val'" >&2;} fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) as_fn_append ac_configure_args " '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5 $as_echo "$as_me: error: changes in the environment can compromise the build" >&2;} as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5 fi ## -------------------- ## ## Main body of script. ## ## -------------------- ## ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_aux_dir= for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do if test -f "$ac_dir/install-sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install-sh -c" break elif test -f "$ac_dir/install.sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install.sh -c" break elif test -f "$ac_dir/shtool"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/shtool install -c" break fi done if test -z "$ac_aux_dir"; then as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5 fi # These three variables are undocumented and unsupported, # and are intended to be withdrawn in a future Autoconf release. # They can cause serious problems if a builder's source tree is in a directory # whose full name contains unusual characters. ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var. ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var. ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var. # Make sure we can run config.sub. $SHELL "$ac_aux_dir/config.sub" sun4 >/dev/null 2>&1 || as_fn_error $? "cannot run $SHELL $ac_aux_dir/config.sub" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking build system type" >&5 $as_echo_n "checking build system type... " >&6; } if ${ac_cv_build+:} false; then : $as_echo_n "(cached) " >&6 else ac_build_alias=$build_alias test "x$ac_build_alias" = x && ac_build_alias=`$SHELL "$ac_aux_dir/config.guess"` test "x$ac_build_alias" = x && as_fn_error $? "cannot guess build type; you must specify one" "$LINENO" 5 ac_cv_build=`$SHELL "$ac_aux_dir/config.sub" $ac_build_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $ac_build_alias failed" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_build" >&5 $as_echo "$ac_cv_build" >&6; } case $ac_cv_build in *-*-*) ;; *) as_fn_error $? "invalid value of canonical build" "$LINENO" 5;; esac build=$ac_cv_build ac_save_IFS=$IFS; IFS='-' set x $ac_cv_build shift build_cpu=$1 build_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: build_os=$* IFS=$ac_save_IFS case $build_os in *\ *) build_os=`echo "$build_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking host system type" >&5 $as_echo_n "checking host system type... " >&6; } if ${ac_cv_host+:} false; then : $as_echo_n "(cached) " >&6 else if test "x$host_alias" = x; then ac_cv_host=$ac_cv_build else ac_cv_host=`$SHELL "$ac_aux_dir/config.sub" $host_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $host_alias failed" "$LINENO" 5 fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_host" >&5 $as_echo "$ac_cv_host" >&6; } case $ac_cv_host in *-*-*) ;; *) as_fn_error $? "invalid value of canonical host" "$LINENO" 5;; esac host=$ac_cv_host ac_save_IFS=$IFS; IFS='-' set x $ac_cv_host shift host_cpu=$1 host_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: host_os=$* IFS=$ac_save_IFS case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking target system type" >&5 $as_echo_n "checking target system type... " >&6; } if ${ac_cv_target+:} false; then : $as_echo_n "(cached) " >&6 else if test "x$target_alias" = x; then ac_cv_target=$ac_cv_host else ac_cv_target=`$SHELL "$ac_aux_dir/config.sub" $target_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $target_alias failed" "$LINENO" 5 fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_target" >&5 $as_echo "$ac_cv_target" >&6; } case $ac_cv_target in *-*-*) ;; *) as_fn_error $? "invalid value of canonical target" "$LINENO" 5;; esac target=$ac_cv_target ac_save_IFS=$IFS; IFS='-' set x $ac_cv_target shift target_cpu=$1 target_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: target_os=$* IFS=$ac_save_IFS case $target_os in *\ *) target_os=`echo "$target_os" | sed 's/ /-/g'`;; esac # The aliases save the names the user supplied, while $host etc. # will get canonicalized. test -n "$target_alias" && test "$program_prefix$program_suffix$program_transform_name" = \ NONENONEs,x,x, && program_prefix=${target_alias}- #-------------------------------------------------------------------- # CFITSIO Version Numbers: #-------------------------------------------------------------------- CFITSIO_MAJOR=3 CFITSIO_MINOR=47 # Increment soname each time the interface changes: CFITSIO_SONAME=8 #-------------------------------------------------------------------- # Command options #-------------------------------------------------------------------- ADD_CURL=yes # Check whether --enable-curl was given. if test "${enable_curl+set}" = set; then : enableval=$enable_curl; if test $enableval = no; then ADD_CURL=no; fi fi if test "x$ADD_CURL" = xno; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Not linking with curl for remote file i/o support" >&5 $as_echo "$as_me: WARNING: Not linking with curl for remote file i/o support" >&2;} fi # Check whether --enable-reentrant was given. if test "${enable_reentrant+set}" = set; then : enableval=$enable_reentrant; if test $enableval = yes; then BUILD_REENTRANT=yes; fi fi SSE_FLAGS="" # Check whether --enable-sse2 was given. if test "${enable_sse2+set}" = set; then : enableval=$enable_sse2; if test $enableval = yes; then SSE_FLAGS="-msse2"; fi fi # Check whether --enable-ssse3 was given. if test "${enable_ssse3+set}" = set; then : enableval=$enable_ssse3; if test $enableval = yes; then SSE_FLAGS="$SSE_FLAGS -mssse3"; fi fi # Define BUILD_HERA when building for HERA project to activate code in # drvrfile.c (by way of fitsio2.h): # Check whether --enable-hera was given. if test "${enable_hera+set}" = set; then : enableval=$enable_hera; if test $enableval = yes; then BUILD_HERA=yes; fi fi if test "x$BUILD_HERA" = xyes; then $as_echo "#define BUILD_HERA 1" >>confdefs.h fi # Optional support for bzip2 compression: ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "no acceptable C compiler found in \$PATH See \`config.log' for more details" "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out" # Try to create an executable without -o first, disregard a.out. # It will help us diagnose broken compilers, and finding out an intuition # of exeext. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler works" >&5 $as_echo_n "checking whether the C compiler works... " >&6; } ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` # The possible output files: ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*" ac_rmfiles= for ac_file in $ac_files do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; * ) ac_rmfiles="$ac_rmfiles $ac_file";; esac done rm -f $ac_rmfiles if { { ac_try="$ac_link_default" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link_default") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # Autoconf-2.13 could set the ac_cv_exeext variable to `no'. # So ignore a value of `no', otherwise this would lead to `EXEEXT = no' # in a Makefile. We should not override ac_cv_exeext if it was cached, # so that the user can short-circuit this test for compilers unknown to # Autoconf. for ac_file in $ac_files '' do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no; then :; else ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` fi # We set ac_cv_exeext here because the later test for it is not # safe: cross compilers may not add the suffix if given an `-o' # argument, so we may need to know it at that point already. # Even if this section looks crufty: it has the advantage of # actually working. break;; * ) break;; esac done test "$ac_cv_exeext" = no && ac_cv_exeext= else ac_file='' fi if test -z "$ac_file"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "C compiler cannot create executables See \`config.log' for more details" "$LINENO" 5; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name" >&5 $as_echo_n "checking for C compiler default output file name... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5 $as_echo "$ac_file" >&6; } ac_exeext=$ac_cv_exeext rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5 $as_echo_n "checking for suffix of executables... " >&6; } if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # If both `conftest.exe' and `conftest' are `present' (well, observable) # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will # work properly (i.e., refer to `conftest.exe'), while it won't with # `rm'. for ac_file in conftest.exe conftest conftest.*; do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` break;; * ) break;; esac done else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of executables: cannot compile and link See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest conftest$ac_cv_exeext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5 $as_echo "$ac_cv_exeext" >&6; } rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { FILE *f = fopen ("conftest.out", "w"); return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF ac_clean_files="$ac_clean_files conftest.out" # Check that the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5 $as_echo_n "checking whether we are cross compiling... " >&6; } if test "$cross_compiling" != yes; then { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if { ac_try='./conftest$ac_cv_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details" "$LINENO" 5; } fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5 $as_echo "$cross_compiling" >&6; } rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5 $as_echo_n "checking for suffix of object files... " >&6; } if ${ac_cv_objext+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : for ac_file in conftest.o conftest.obj conftest.*; do test -f "$ac_file" || continue; case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of object files: cannot compile See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5 $as_echo "$ac_cv_objext" >&6; } OBJEXT=$ac_cv_objext ac_objext=$OBJEXT { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if ${ac_cv_c_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if ${ac_cv_prog_cc_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if ${ac_cv_prog_cc_c89+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include struct stat; /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor" >&5 $as_echo_n "checking how to run the C preprocessor... " >&6; } # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if ${ac_cv_prog_CPP+:} false; then : $as_echo_n "(cached) " >&6 else # Double quotes because CPP needs to be expanded for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" do ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CPP=$CPP fi CPP=$ac_cv_prog_CPP else ac_cv_prog_CPP=$CPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CPP" >&5 $as_echo "$CPP" >&6; } ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details" "$LINENO" 5; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5 $as_echo_n "checking for grep that handles long lines and -e... " >&6; } if ${ac_cv_path_GREP+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$GREP"; then ac_path_GREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in grep ggrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_GREP" || continue # Check for GNU ac_path_GREP and select it if it is found. # Check for GNU $ac_path_GREP case `"$ac_path_GREP" --version 2>&1` in *GNU*) ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'GREP' >> "conftest.nl" "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_GREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_GREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_GREP"; then as_fn_error $? "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_GREP=$GREP fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5 $as_echo "$ac_cv_path_GREP" >&6; } GREP="$ac_cv_path_GREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for egrep" >&5 $as_echo_n "checking for egrep... " >&6; } if ${ac_cv_path_EGREP+:} false; then : $as_echo_n "(cached) " >&6 else if echo a | $GREP -E '(a|b)' >/dev/null 2>&1 then ac_cv_path_EGREP="$GREP -E" else if test -z "$EGREP"; then ac_path_EGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in egrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_EGREP" || continue # Check for GNU ac_path_EGREP and select it if it is found. # Check for GNU $ac_path_EGREP case `"$ac_path_EGREP" --version 2>&1` in *GNU*) ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'EGREP' >> "conftest.nl" "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_EGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_EGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_EGREP"; then as_fn_error $? "no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_EGREP=$EGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP" >&5 $as_echo "$ac_cv_path_EGREP" >&6; } EGREP="$ac_cv_path_EGREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if ${ac_cv_header_stdc+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi # On IRIX 5.3, sys/types and inttypes.h are conflicting. for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \ inttypes.h stdint.h unistd.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_compile "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default " if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done # Check whether --with-bzip2 was given. if test "${with_bzip2+set}" = set; then : withval=$with_bzip2; if test "x$withval" != "xno"; then if test "x$withval" = "xyes" ; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lbz2" >&5 $as_echo_n "checking for main in -lbz2... " >&6; } if ${ac_cv_lib_bz2_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lbz2 $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { return main (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_bz2_main=yes else ac_cv_lib_bz2_main=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_bz2_main" >&5 $as_echo "$ac_cv_lib_bz2_main" >&6; } if test "x$ac_cv_lib_bz2_main" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBBZ2 1 _ACEOF LIBS="-lbz2 $LIBS" else as_fn_error $? "Unable to locate bz2 library needed when enabling bzip2 support; try specifying the path" "$LINENO" 5 fi else BZIP2_PATH="${withval}" fi for ac_header in bzlib.h do : ac_fn_c_check_header_mongrel "$LINENO" "bzlib.h" "ac_cv_header_bzlib_h" "$ac_includes_default" if test "x$ac_cv_header_bzlib_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_BZLIB_H 1 _ACEOF $as_echo "#define HAVE_BZIP2 1" >>confdefs.h fi done fi fi # Optional Globus Toolkit support: # Check whether --with-gsiftp was given. if test "${with_gsiftp+set}" = set; then : withval=$with_gsiftp; if test "x$withval" != "xno"; then if test "x$withval" != "xyes" ; then GSIFTP_PATH="${withval}" fi $as_echo "#define HAVE_GSIFTP 1" >>confdefs.h USE_GSIFTP=yes fi fi # GSIFTP source code (optional): if test "x$USE_GSIFTP" = xyes; then GSIFTP_SRC="drvrgsiftp.c" else GSIFTP_SRC="" fi # Check whether --with-gsiftp-flavour was given. if test "${with_gsiftp_flavour+set}" = set; then : withval=$with_gsiftp_flavour; if test "x$withval" != "xno"; then if test "x$withval" != "xyes" ; then GSIFTP_FLAVOUR="${withval}" fi $as_echo "#define GSIFTP_FLAVOUR 1" >>confdefs.h fi fi #-------------------------------------------------------------------- # Check for install location prefix #-------------------------------------------------------------------- # make will complain about duplicate targets for the install directories # if prefix == exec_prefix INSTALL_ROOT='${prefix}' test "$exec_prefix" != NONE -a "$prefix" != "$exec_prefix" \ && INSTALL_ROOT="$INSTALL_ROOT "'${exec_prefix}' #-------------------------------------------------------------------- # System type #-------------------------------------------------------------------- case $host in *cygwin*) ARCH="cygwin" EXT="cygwin" ;; *apple-darwin*) # Darwin can be powerpc, i386, or x86_64 ARCH=`uname -p` EXT="darwin" ;; *freebsd*) ARCH="linux" EXT="lnx" ;; *hpux*) ARCH="hp" EXT="hpu" ;; *irix*) ARCH="sgi" EXT="sgi" ;; *linux*) ARCH="linux" EXT="lnx" ;; *mingw32*) #ARCH="" EXT="mingw32" ;; *osf1*) ARCH="alpha" EXT="osf" ;; *solaris*) ARCH="solaris" EXT="sol" ;; *ultrix*) ARCH="dec" EXT="dec" ;; *) echo "cfitsio: == Don't know what do do with $host" ;; esac # Try first to find a proprietary C compiler, then gcc if test "x$EXT" != xcygwin && test "x$EXT" != xdarwin && test "x$EXT" != xlnx && test "x$EXT" != xmingw32; then if test "x$CC" = x; then for ac_prog in cc do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "no acceptable C compiler found in \$PATH See \`config.log' for more details" "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if ${ac_cv_c_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if ${ac_cv_prog_cc_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if ${ac_cv_prog_cc_c89+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include struct stat; /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu LDFLAGS="$CFLAGS" LDFLAGS_BIN="$LDFLAGS" if test "x$FC" = "xnone" ; then { $as_echo "$as_me:${as_lineno-$LINENO}: cfitsio: == Fortran compiler search has been overridden" >&5 $as_echo "$as_me: cfitsio: == Fortran compiler search has been overridden" >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: cfitsio: == Cfitsio will be built without Fortran wrapper support" >&5 $as_echo "$as_me: cfitsio: == Cfitsio will be built without Fortran wrapper support" >&6;} FC= F77_WRAPPERS= else for ac_prog in gfortran g95 g77 f77 ifort f95 f90 xlf cf77 gf77 af77 ncf f2c do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_FC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$FC"; then ac_cv_prog_FC="$FC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_FC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi FC=$ac_cv_prog_FC if test -n "$FC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $FC" >&5 $as_echo "$FC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$FC" && break done test -n "$FC" || FC="notfound" if test $FC = 'notfound' ; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cfitsio: == No acceptable Fortran compiler found in \$PATH" >&5 $as_echo "$as_me: WARNING: cfitsio: == No acceptable Fortran compiler found in \$PATH" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: cfitsio: == Adding wrapper support for GNU Fortran by default" >&5 $as_echo "$as_me: cfitsio: == Adding wrapper support for GNU Fortran by default" >&6;} CFORTRANFLAGS="-Dg77Fortran" F77_WRAPPERS="\${FITSIO_SRC}" else CFORTRANFLAGS= F77_WRAPPERS="\${FITSIO_SRC}" echo $ac_n "checking whether we are using GNU Fortran""... $ac_c" 1>&6 if test `$FC --version -c < /dev/null 2> /dev/null | grep -c GNU` -gt 0 -o \ `$FC --version -c < /dev/null 2> /dev/null | grep -ic egcs` -gt 0 then echo "$ac_t""yes" 1>&6 echo $ac_n "cfitsio: == Adding wrapper support for GNU Fortran""... $ac_c" 1>&6 CFORTRANFLAGS="-Dg77Fortran" echo "$ac_t"" done" 1>&6 else echo "$ac_t""no" 1>&6 if test $FC = 'f2c' ; then echo $ac_n "cfitsio: == Adding wrapper support for f2c""... $ac_c" 1>&6 CFORTRANFLAGS="-Df2cFortran" echo "$ac_t"" done" 1>&6 fi fi fi fi # ar & ranlib required #--------------------- # Extract the first word of "ar", so it can be a program name with args. set dummy ar; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_AR+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$AR"; then ac_cv_prog_AR="$AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_AR="ar" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_AR" && ac_cv_prog_AR="noar" fi fi AR=$ac_cv_prog_AR if test -n "$AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AR" >&5 $as_echo "$AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test $AR = noar; then as_fn_error $? "ar not found in your \$PATH. See your sysdamin." "$LINENO" 5 fi ARCHIVE="$AR rv" if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args. set dummy ${ac_tool_prefix}ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_RANLIB+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi RANLIB=$ac_cv_prog_RANLIB if test -n "$RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RANLIB" >&5 $as_echo "$RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_RANLIB"; then ac_ct_RANLIB=$RANLIB # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_RANLIB+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_RANLIB"; then ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_RANLIB="ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB if test -n "$ac_ct_RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB" >&5 $as_echo "$ac_ct_RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_RANLIB" = x; then RANLIB=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac RANLIB=$ac_ct_RANLIB fi else RANLIB="$ac_cv_prog_RANLIB" fi for ac_header in stdlib.h string.h math.h limits.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_mongrel "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default" if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF ANSI_HEADER=yes else ANSI_HEADER=no fi done cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { void d( int , double) ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : PROTO=yes else PROTO=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ANSI_HEADER = no -o $PROTO = no; then echo " *********** WARNING: CFITSIO CONFIGURE FAILURE ************ " echo "cfitsio: ANSI C environment NOT found. Aborting cfitsio configure." if test $ANSI_HEADER = no; then echo "cfitsio: You're missing a needed ANSI header file." fi if test $PROTO = no; then echo "cfitsio: Your compiler can't do ANSI function prototypes." fi echo "cfitsio: You need an ANSI C compiler and all ANSI trappings" echo "cfitsio: to build cfitsio. " echo " ******************************************************* " exit 0; fi if test "x$SSE_FLAGS" != x; then SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS $SSE_FLAGS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts $SSE_FLAGS" >&5 $as_echo_n "checking whether $CC accepts $SSE_FLAGS... " >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : c_has_option=yes else c_has_option=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $c_has_option" >&5 $as_echo "$c_has_option" >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test "$c_has_option" = no; then SSE_FLAGS=""; fi CFLAGS="$SAVE_CFLAGS" fi CFLAGS="$CFLAGS" LIBPRE="" case $host in *cygwin*) CFLAGS="$CFLAGS -DHAVE_POSIX_SIGNALS" ;; *apple-darwin*) case $host in *darwin[56789]*) ;; *) # # Build for i386 & x86_64 architectures on Darwin 10.x or newer: # echo "int main(){return(0);}" > /tmp/$$.c # $CC -v -o /tmp/$$.out /tmp/$$.c 2> /tmp/$$.log # if test `cat /tmp/$$.log | grep -ci 'LLVM'` -ne 0; then APPLEXCODE="yes"; fi # if test "x$APPLEXCODE" = xyes; then # # Flags for building Universal binaries: # C_UNIV_SWITCH="-arch i386 -arch x86_64" # CFLAGS="$CFLAGS $C_UNIV_SWITCH" # fi # LDFLAGS used by utilities: LDFLAGS_BIN="$LDFLAGS_BIN -Wl,-rpath,\${CFITSIO_LIB}" ;; esac # For large file support (but may break Absoft compilers): $as_echo "#define _LARGEFILE_SOURCE 1" >>confdefs.h $as_echo "#define _FILE_OFFSET_BITS 64" >>confdefs.h ;; *hpux*) if test "x$CFORTRANFLAGS" = x ; then CFORTRANFLAGS="-Dappendus" fi CFLAGS="$CFLAGS -DPG_PPU" LIBPRE="-Wl," ;; *irix*) CFLAGS="$CFLAGS -DHAVE_POSIX_SIGNALS" RANLIB="touch" ;; *linux*) # For large file support: $as_echo "#define _LARGEFILE_SOURCE 1" >>confdefs.h $as_echo "#define _FILE_OFFSET_BITS 64" >>confdefs.h ;; *mingw32*) { $as_echo "$as_me:${as_lineno-$LINENO}: checking for large file support" >&5 $as_echo_n "checking for large file support... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { _FILE_OFFSET_BITS_SET_FSEEKO ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : $as_echo "#define _LARGEFILE_SOURCE 1" >>confdefs.h $as_echo "#define _FILE_OFFSET_BITS 64" >>confdefs.h { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ;; *solaris*) if test "x$CFORTRANFLAGS" = x ; then CFORTRANFLAGS="-Dsolaris" fi # We need libm on Solaris: { $as_echo "$as_me:${as_lineno-$LINENO}: checking for frexp in -lm" >&5 $as_echo_n "checking for frexp in -lm... " >&6; } if ${ac_cv_lib_m_frexp+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lm $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char frexp (); int main () { return frexp (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_m_frexp=yes else ac_cv_lib_m_frexp=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_frexp" >&5 $as_echo "$ac_cv_lib_m_frexp" >&6; } if test "x$ac_cv_lib_m_frexp" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBM 1 _ACEOF LIBS="-lm $LIBS" fi # For large file support: $as_echo "#define _LARGEFILE_SOURCE 1" >>confdefs.h $as_echo "#define _FILE_OFFSET_BITS 64" >>confdefs.h ;; *) echo "cfitsio: == Don't know what do do with $host" ;; esac CFLAGS="$CFLAGS $CFORTRANFLAGS" case $GCC in yes) GCCVERSION="`$CC -dumpversion 2>&1`" echo "cfitsio: == Using gcc version $GCCVERSION" gcc_test=`echo $GCCVERSION | grep -c '2\.[45678]'` if test $gcc_test -gt 0 then CFLAGS=`echo $CFLAGS | sed 's:-O[^ ]* *::'` { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: This gcc is pretty old. Disabling optimization to be safe." >&5 $as_echo "$as_me: WARNING: This gcc is pretty old. Disabling optimization to be safe." >&2;} fi ;; no) echo "cfitsio: Old CFLAGS is $CFLAGS" CFLAGS=`echo $CFLAGS | sed -e "s/-g/-O/"` case $host in *solaris*) if test `echo $CFLAGS | grep -c fast` -gt 0 then echo "cfitsio: Replacing -fast with -O3" CFLAGS=`echo $CFLAGS | sed 's:-fast:-O3:'` fi CFLAGS="$CFLAGS -DHAVE_ALLOCA_H -DHAVE_POSIX_SIGNALS" ;; *) echo "== No special changes for $host" ;; esac echo "New CFLAGS is $CFLAGS" ;; *) # Don't do anything now ;; esac # Shared library section #------------------------------------------------------------------------------- SHLIB_LD=: SHLIB_SUFFIX=".so" CFITSIO_SHLIB="" CFITSIO_SHLIB_SONAME="" lhea_shlib_cflags= case $EXT in cygwin|mingw32) SHLIB_LD="$CC -shared" SHLIB_SUFFIX=".dll" ;; darwin) SHLIB_SUFFIX=".dylib" CFITSIO_SHLIB="lib\${PACKAGE}.\${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}\${SHLIB_SUFFIX}" CFITSIO_SHLIB_SONAME="lib\${PACKAGE}.\${CFITSIO_SONAME}\${SHLIB_SUFFIX}" case $host in *darwin[56789]*) SHLIB_LD="$CC -dynamiclib -install_name lib\${PACKAGE}.\${CFITSIO_SONAME}\${SHLIB_SUFFIX} -compatibility_version \${CFITSIO_SONAME} -current_version \${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}" ;; *) # Build 'Universal' binaries (i386 & x86_64 architectures) and # use rpath token on Darwin 10.x or newer: SHLIB_LD="$CC -dynamiclib $C_UNIV_SWITCH -headerpad_max_install_names -install_name @rpath/lib\${PACKAGE}.\${CFITSIO_SONAME}\${SHLIB_SUFFIX} -compatibility_version \${CFITSIO_SONAME} -current_version \${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}" ;; esac lhea_shlib_cflags="-fPIC -fno-common" ;; hpu) SHLIB_LD="ld -b" SHLIB_SUFFIX=".sl" ;; lnx) SHLIB_LD=":" CFITSIO_SHLIB="lib\${PACKAGE}\${SHLIB_SUFFIX}.\${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}" CFITSIO_SHLIB_SONAME="lib\${PACKAGE}\${SHLIB_SUFFIX}.\${CFITSIO_SONAME}" ;; osf) SHLIB_LD="ld -shared -expect_unresolved '*'" LD_FLAGS="-taso" ;; sol) SHLIB_LD="/usr/ccs/bin/ld -G" lhea_shlib_cflags="-KPIC" ;; sgi) SHLIB_LD="ld -shared -rdata_shared" ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Unable to determine how to make a shared library" >&5 $as_echo "$as_me: WARNING: Unable to determine how to make a shared library" >&2;} ;; esac # Darwin uses gcc (=cc), but needs different flags (see above) if test "x$EXT" != xdarwin && test "x$EXT" != xcygwin && test "x$EXT" != xmingw32; then if test "x$GCC" = xyes; then SHLIB_LD="$CC -shared -Wl,-soname,lib\${PACKAGE}\${SHLIB_SUFFIX}.\${CFITSIO_SONAME}" lhea_shlib_cflags='-fPIC' fi fi if test "x$lhea_shlib_cflags" != x; then CFLAGS="$CFLAGS $lhea_shlib_cflags" fi # Set shared library name for cases in which we aren't setting a 'soname': if test "x$CFITSIO_SHLIB" = x; then CFITSIO_SHLIB="lib\${PACKAGE}\${SHLIB_SUFFIX}"; fi # Curl library (will be pulled in to the shared CFITSIO library): # --------------------------------------------------------------- CURL_INC="" CURL_LIB="" CURL_LIB_PATH="" if test "x$ADD_CURL" = xyes; then # Use curl-config to get compiler & linker flags, if available. # Extract the first word of "curl-config", so it can be a program name with args. set dummy curl-config; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CURLCONFIG+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CURLCONFIG"; then ac_cv_prog_CURLCONFIG="$CURLCONFIG" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CURLCONFIG="curl-config" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CURLCONFIG=$ac_cv_prog_CURLCONFIG if test -n "$CURLCONFIG"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CURLCONFIG" >&5 $as_echo "$CURLCONFIG" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$CURLCONFIG" != x; then CURL_LIB=`$CURLCONFIG --libs` CURL_INC=`$CURLCONFIG --cflags` if test "x$CURL_LIB" != x; then LIBS_CURL="$CURL_LIB" # Mac OS: For third-party curl-config, acquire an rpath: if test `echo $host | grep -c apple-darwin` -ne 0 -a `echo $CURL_LIB | grep -c "^\-L"` -gt 0; then CURL_LIB_PATH=`echo ${CURL_LIB} | tr " " "\012" | grep "^\-L" | tr "\012" " " | sed 's:-L::' | sed 's: $::'` if test "x$CURL_LIB_PATH" != x; then LIBS_CURL="-Wl,-rpath,$CURL_LIB_PATH $CURL_LIB" fi fi if test `echo $host | grep -c cygwin` -ne 0 -o `echo $host | grep -c mingw32` -ne 0; then LIBS="$CURL_LIB $LIBS" fi $as_echo "#define CFITSIO_HAVE_CURL 1" >>confdefs.h fi if test "x$CURL_INC" != x; then CFLAGS="$CURL_INC $CFLAGS" fi # No curl-config: else { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: curl-config not found. Disabling curl support." >&5 $as_echo "$as_me: WARNING: curl-config not found. Disabling curl support." >&2;} # Incomplete stubs for possible future use: # AC_CHECK_LIB([curl],[main],[], # [AC_MSG_WARN(Not building curl support for CFITSIO)]) # AC_CHECK_HEADER(curl.h,[]) fi fi # GSIFTP flags: if test "x$GSIFTP_PATH" != x -a "x$GSIFTP_FLAVOUR" != x; then CFLAGS="$CFLAGS -I${GSIFTP_PATH}/include/${GSIFTP_FLAVOUR}" LIBS="$LIBS -L${GSIFTP_PATH}/lib -lglobus_ftp_client_${GSIFTP_FLAVOUR}" fi # BZIP2 flags: if test "x$BZIP2_PATH" != x; then CFLAGS="$CFLAGS -I${BZIP2_PATH}/include" LIBS="$LIBS -L${BZIP2_PATH}/lib -lbz2" fi # ================= test for the unix ftruncate function ================ { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ftruncate works" >&5 $as_echo_n "checking whether ftruncate works... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { ftruncate(0, 0); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : $as_echo "#define HAVE_FTRUNCATE 1" >>confdefs.h { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext # --------------------------------------------------------- # some systems define long long for 64-bit ints # --------------------------------------------------------- { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether long long is defined" >&5 $as_echo_n "checking whether long long is defined... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { long long filler; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : $as_echo "#define HAVE_LONGLONG 1" >>confdefs.h { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext # ==================== SHARED MEMORY DRIVER SECTION ======================= # # 09-Mar-98 : modified by JB/ISDC # 3 checks added to support autoconfiguration of shared memory # driver. First generic check is made whether shared memory is supported # at all, then 2 more specific checks are made (architecture dependent). # Currently tested on : sparc-solaris, intel-linux, sgi-irix, dec-alpha-osf # ------------------------------------------------------------------------- # check is System V IPC is supported on this machine # ------------------------------------------------------------------------- { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether system V style IPC services are supported" >&5 $as_echo_n "checking whether system V style IPC services are supported... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include int main () { shmat(0, 0, 0); shmdt(0); shmget(0, 0, 0); semget(0, 0, 0); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : $as_echo "#define HAVE_SHMEM_SERVICES 1" >>confdefs.h my_shmem=\${SOURCES_SHMEM} { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext # ------------------------------------------------------------------------- # some systems define flock_t, for others we have to define it ourselves # ------------------------------------------------------------------------- { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether flock_t is defined in sys/fcntl.h" >&5 $as_echo_n "checking whether flock_t is defined in sys/fcntl.h... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { flock_t filler; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : $as_echo "#define HAVE_FLOCK_T 1" >>confdefs.h { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test "$HAVE_FLOCK_T" != 1; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether flock_t is defined in sys/flock.h" >&5 $as_echo_n "checking whether flock_t is defined in sys/flock.h... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { flock_t filler; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : $as_echo "#define HAVE_FLOCK_T 1" >>confdefs.h { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi # ------------------------------------------------------------------------------ # Define _REENTRANT & add -lpthread to LIBS if reentrant multithreading enabled: # ------------------------------------------------------------------------------ if test "x$BUILD_REENTRANT" = xyes; then $as_echo "#define _REENTRANT 1" >>confdefs.h $as_echo "#define _XOPEN_SOURCE 700" >>confdefs.h # Additional definition needed to get 'union semun' when using # _XOPEN_SOURCE on a Mac: if test "x$EXT" = xdarwin; then $as_echo "#define _DARWIN_C_SOURCE 1" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lpthread" >&5 $as_echo_n "checking for main in -lpthread... " >&6; } if ${ac_cv_lib_pthread_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lpthread $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { return main (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_pthread_main=yes else ac_cv_lib_pthread_main=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_pthread_main" >&5 $as_echo "$ac_cv_lib_pthread_main" >&6; } if test "x$ac_cv_lib_pthread_main" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBPTHREAD 1 _ACEOF LIBS="-lpthread $LIBS" else as_fn_error $? "Unable to locate pthread library needed when enabling reentrant multithreading" "$LINENO" 5 fi fi # ------------------------------------------------------------------------- # there are some idiosyncrasies with semun defs (used in semxxx). Solaris # does not define it at all # ------------------------------------------------------------------------- { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether union semun is defined" >&5 $as_echo_n "checking whether union semun is defined... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include int main () { union semun filler; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : $as_echo "#define HAVE_UNION_SEMUN 1" >>confdefs.h { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext # ------------------------------------------------------------------------- # fmemopen is not available on e.g. older Macs: # ------------------------------------------------------------------------- ac_fn_c_check_func "$LINENO" "fmemopen" "ac_cv_func_fmemopen" if test "x$ac_cv_func_fmemopen" = xyes; then : $as_echo "#define HAVE_FMEMOPEN 1" >>confdefs.h else { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Disabling support for compressed files via FTPS" >&5 $as_echo "$as_me: WARNING: Disabling support for compressed files via FTPS" >&2;} fi # ==================== END OF SHARED MEMORY DRIVER SECTION ================ # ================= test for the unix networking functions ================ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for library containing gethostbyname" >&5 $as_echo_n "checking for library containing gethostbyname... " >&6; } if ${ac_cv_search_gethostbyname+:} false; then : $as_echo_n "(cached) " >&6 else ac_func_search_save_LIBS=$LIBS cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char gethostbyname (); int main () { return gethostbyname (); ; return 0; } _ACEOF for ac_lib in '' nsl; do if test -z "$ac_lib"; then ac_res="none required" else ac_res=-l$ac_lib LIBS="-l$ac_lib $ac_func_search_save_LIBS" fi if ac_fn_c_try_link "$LINENO"; then : ac_cv_search_gethostbyname=$ac_res fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext if ${ac_cv_search_gethostbyname+:} false; then : break fi done if ${ac_cv_search_gethostbyname+:} false; then : else ac_cv_search_gethostbyname=no fi rm conftest.$ac_ext LIBS=$ac_func_search_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_search_gethostbyname" >&5 $as_echo "$ac_cv_search_gethostbyname" >&6; } ac_res=$ac_cv_search_gethostbyname if test "$ac_res" != no; then : test "$ac_res" = "none required" || LIBS="$ac_res $LIBS" cfitsio_have_nsl=1 else cfitsio_have_nsl=0 fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for library containing connect" >&5 $as_echo_n "checking for library containing connect... " >&6; } if ${ac_cv_search_connect+:} false; then : $as_echo_n "(cached) " >&6 else ac_func_search_save_LIBS=$LIBS cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char connect (); int main () { return connect (); ; return 0; } _ACEOF for ac_lib in '' socket; do if test -z "$ac_lib"; then ac_res="none required" else ac_res=-l$ac_lib LIBS="-l$ac_lib -lnsl $ac_func_search_save_LIBS" fi if ac_fn_c_try_link "$LINENO"; then : ac_cv_search_connect=$ac_res fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext if ${ac_cv_search_connect+:} false; then : break fi done if ${ac_cv_search_connect+:} false; then : else ac_cv_search_connect=no fi rm conftest.$ac_ext LIBS=$ac_func_search_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_search_connect" >&5 $as_echo "$ac_cv_search_connect" >&6; } ac_res=$ac_cv_search_connect if test "$ac_res" != no; then : test "$ac_res" = "none required" || LIBS="$ac_res $LIBS" cfitsio_have_socket=1 else cfitsio_have_socket=0 fi if test "$cfitsio_have_nsl" = 1 -a "$cfitsio_have_socket" = 1; then $as_echo "#define HAVE_NET_SERVICES 1" >>confdefs.h fi # ==================== END OF unix networking SECTION ================ ac_config_files="$ac_config_files Makefile" cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then if test "x$cache_file" != "x/dev/null"; then { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} if test ! -f "$cache_file" || test -h "$cache_file"; then cat confcache >"$cache_file" else case $cache_file in #( */* | ?:*) mv -f confcache "$cache_file"$$ && mv -f "$cache_file"$$ "$cache_file" ;; #( *) mv -f confcache "$cache_file" ;; esac fi fi else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' # Transform confdefs.h into DEFS. # Protect against shell expansion while executing Makefile rules. # Protect against Makefile macro expansion. # # If the first sed substitution is executed (which looks for macros that # take arguments), then branch to the quote section. Otherwise, # look for a macro that doesn't take arguments. ac_script=' :mline /\\$/{ N s,\\\n,, b mline } t clear :clear s/^[ ]*#[ ]*define[ ][ ]*\([^ (][^ (]*([^)]*)\)[ ]*\(.*\)/-D\1=\2/g t quote s/^[ ]*#[ ]*define[ ][ ]*\([^ ][^ ]*\)[ ]*\(.*\)/-D\1=\2/g t quote b any :quote s/[ `~#$^&*(){}\\|;'\''"<>?]/\\&/g s/\[/\\&/g s/\]/\\&/g s/\$/$$/g H :any ${ g s/^\n// s/\n/ /g p } ' DEFS=`sed -n "$ac_script" confdefs.h` ac_libobjs= ac_ltlibobjs= U= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' ac_i=`$as_echo "$ac_i" | sed "$ac_script"` # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR # will be set to the directory where LIBOBJS objects are built. as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext" as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs : "${CONFIG_STATUS=./config.status}" ac_write_fail=0 ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5 $as_echo "$as_me: creating $CONFIG_STATUS" >&6;} as_write_fail=0 cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1 #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1 ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p as_test_x='test -x' as_executable_p=as_fn_executable_p # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 6>&1 ## ----------------------------------- ## ## Main body of $CONFIG_STATUS script. ## ## ----------------------------------- ## _ASEOF test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Save the log message, to keep $0 and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" This file was extended by $as_me, which was generated by GNU Autoconf 2.69. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF case $ac_config_files in *" "*) set x $ac_config_files; shift; ac_config_files=$*;; esac cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # Files that config.status was made for. config_files="$ac_config_files" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 ac_cs_usage="\ \`$as_me' instantiates files and other configuration actions from templates according to the current configuration. Unless the files and actions are specified as TAGs, all are instantiated by default. Usage: $0 [OPTION]... [TAG]... -h, --help print this help, then exit -V, --version print version number and configuration settings, then exit --config print configuration, then exit -q, --quiet, --silent do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE Configuration files: $config_files Report bugs to the package provider." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" ac_cs_version="\\ config.status configured by $0, generated by GNU Autoconf 2.69, with options \\"\$ac_cs_config\\" Copyright (C) 2012 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' test -n "\$AWK" || AWK=awk _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # The default lists apply if the user does not specify any file. ac_need_defaults=: while test $# != 0 do case $1 in --*=?*) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` ac_shift=: ;; --*=) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg= ac_shift=: ;; *) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; esac case $ac_option in # Handling of the options. -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) $as_echo "$ac_cs_version"; exit ;; --config | --confi | --conf | --con | --co | --c ) $as_echo "$ac_cs_config"; exit ;; --debug | --debu | --deb | --de | --d | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; '') as_fn_error $? "missing file argument" ;; esac as_fn_append CONFIG_FILES " '$ac_optarg'" ac_need_defaults=false;; --he | --h | --help | --hel | -h ) $as_echo "$ac_cs_usage"; exit ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) as_fn_error $? "unrecognized option: \`$1' Try \`$0 --help' for more information." ;; *) as_fn_append ac_config_targets " $1" ac_need_defaults=false ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 if \$ac_cs_recheck; then set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion shift \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6 CONFIG_SHELL='$SHELL' export CONFIG_SHELL exec "\$@" fi _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX $as_echo "$ac_log" } >&5 _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Handling of arguments. for ac_config_target in $ac_config_targets do case $ac_config_target in "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason against having it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Hook for its removal unless debugging. # Note that there is a small window in which the directory will not be cleaned: # after its creation but before its name has been assigned to `$tmp'. $debug || { tmp= ac_tmp= trap 'exit_status=$? : "${ac_tmp:=$tmp}" { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status ' 0 trap 'as_fn_exit 1' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && test -d "$tmp" } || { tmp=./conf$$-$RANDOM (umask 077 && mkdir "$tmp") } || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5 ac_tmp=$tmp # Set up the scripts for CONFIG_FILES section. # No need to generate them if there are no CONFIG_FILES. # This happens for instance with `./config.status config.h'. if test -n "$CONFIG_FILES"; then ac_cr=`echo X | tr X '\015'` # On cygwin, bash can eat \r inside `` if the user requested igncr. # But we know of no other shell where ac_cr would be empty at this # point, so we can use a bashism as a fallback. if test "x$ac_cr" = x; then eval ac_cr=\$\'\\r\' fi ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' /dev/null` if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then ac_cs_awk_cr='\\r' else ac_cs_awk_cr=$ac_cr fi echo 'BEGIN {' >"$ac_tmp/subs1.awk" && _ACEOF { echo "cat >conf$$subs.awk <<_ACEOF" && echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' && echo "_ACEOF" } >conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'` ac_delim='%!_!# ' for ac_last_try in false false false false false :; do . ./conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X` if test $ac_delim_n = $ac_delim_num; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done rm -f conf$$subs.sh cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK && _ACEOF sed -n ' h s/^/S["/; s/!.*/"]=/ p g s/^[^!]*!// :repl t repl s/'"$ac_delim"'$// t delim :nl h s/\(.\{148\}\)..*/\1/ t more1 s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/ p n b repl :more1 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t nl :delim h s/\(.\{148\}\)..*/\1/ t more2 s/["\\]/\\&/g; s/^/"/; s/$/"/ p b :more2 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t delim ' >$CONFIG_STATUS || ac_write_fail=1 rm -f conf$$subs.awk cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACAWK cat >>"\$ac_tmp/subs1.awk" <<_ACAWK && for (key in S) S_is_set[key] = 1 FS = "" } { line = $ 0 nfields = split(line, field, "@") substed = 0 len = length(field[1]) for (i = 2; i < nfields; i++) { key = field[i] keylen = length(key) if (S_is_set[key]) { value = S[key] line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3) len += length(value) + length(field[++i]) substed = 1 } else len += 1 + keylen } print line } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g" else cat fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \ || as_fn_error $? "could not setup config files machinery" "$LINENO" 5 _ACEOF # VPATH may cause trouble with some makes, so we remove sole $(srcdir), # ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=[ ]*/{ h s/// s/^/:/ s/[ ]*$/:/ s/:\$(srcdir):/:/g s/:\${srcdir}:/:/g s/:@srcdir@:/:/g s/^:*// s/:*$// x s/\(=[ ]*\).*/\1/ G s/\n// s/^[^=]*=[ ]*$// }' fi cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 fi # test -n "$CONFIG_FILES" eval set X " :F $CONFIG_FILES " shift for ac_tag do case $ac_tag in :[FHLC]) ac_mode=$ac_tag; continue;; esac case $ac_mode$ac_tag in :[FHL]*:*);; :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;; :[FH]-) ac_tag=-:-;; :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; esac ac_save_IFS=$IFS IFS=: set x $ac_tag IFS=$ac_save_IFS shift ac_file=$1 shift case $ac_mode in :L) ac_source=$1;; :[FH]) ac_file_inputs= for ac_f do case $ac_f in -) ac_f="$ac_tmp/stdin";; *) # Look for the file first in the build tree, then in the source tree # (if the path is not absolute). The absolute path cannot be DOS-style, # because $ac_f cannot contain `:'. test -f "$ac_f" || case $ac_f in [\\/$]*) false;; *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; esac || as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;; esac case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac as_fn_append ac_file_inputs " '$ac_f'" done # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ configure_input='Generated from '` $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g' `' by configure.' if test x"$ac_file" != x-; then configure_input="$ac_file. $configure_input" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5 $as_echo "$as_me: creating $ac_file" >&6;} fi # Neutralize special characters interpreted by sed in replacement strings. case $configure_input in #( *\&* | *\|* | *\\* ) ac_sed_conf_input=`$as_echo "$configure_input" | sed 's/[\\\\&|]/\\\\&/g'`;; #( *) ac_sed_conf_input=$configure_input;; esac case $ac_tag in *:-:* | *:-) cat >"$ac_tmp/stdin" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; esac ;; esac ac_dir=`$as_dirname -- "$ac_file" || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix case $ac_mode in :F) # # CONFIG_FILE # _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # If the template does not know about datarootdir, expand it. # FIXME: This hack should be removed a few years after 2.60. ac_datarootdir_hack=; ac_datarootdir_seen= ac_sed_dataroot=' /datarootdir/ { p q } /@datadir@/p /@docdir@/p /@infodir@/p /@localedir@/p /@mandir@/p' case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in *datarootdir*) ac_datarootdir_seen=yes;; *@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 $as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_datarootdir_hack=' s&@datadir@&$datadir&g s&@docdir@&$docdir&g s&@infodir@&$infodir&g s&@localedir@&$localedir&g s&@mandir@&$mandir&g s&\\\${datarootdir}&$datarootdir&g' ;; esac _ACEOF # Neutralize VPATH when `$srcdir' = `.'. # Shell code in configure.ac might set extrasub. # FIXME: do we really want to maintain this feature? cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_sed_extra="$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s|@configure_input@|$ac_sed_conf_input|;t t s&@top_builddir@&$ac_top_builddir_sub&;t t s&@top_build_prefix@&$ac_top_build_prefix&;t t s&@srcdir@&$ac_srcdir&;t t s&@abs_srcdir@&$ac_abs_srcdir&;t t s&@top_srcdir@&$ac_top_srcdir&;t t s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t s&@builddir@&$ac_builddir&;t t s&@abs_builddir@&$ac_abs_builddir&;t t s&@abs_top_builddir@&$ac_abs_top_builddir&;t t $ac_datarootdir_hack " eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$ac_tmp/subs.awk" \ >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5 test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } && { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' \ "$ac_tmp/out"`; test -z "$ac_out"; } && { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&5 $as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&2;} rm -f "$ac_tmp/stdin" case $ac_file in -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";; *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";; esac \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; esac done # for ac_tag as_fn_exit 0 _ACEOF ac_clean_files=$ac_clean_files_save test $ac_write_fail = 0 || as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5 # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || as_fn_exit 1 fi if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5 $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;} fi ac_config_files="$ac_config_files cfitsio.pc" cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then if test "x$cache_file" != "x/dev/null"; then { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} if test ! -f "$cache_file" || test -h "$cache_file"; then cat confcache >"$cache_file" else case $cache_file in #( */* | ?:*) mv -f confcache "$cache_file"$$ && mv -f "$cache_file"$$ "$cache_file" ;; #( *) mv -f confcache "$cache_file" ;; esac fi fi else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' # Transform confdefs.h into DEFS. # Protect against shell expansion while executing Makefile rules. # Protect against Makefile macro expansion. # # If the first sed substitution is executed (which looks for macros that # take arguments), then branch to the quote section. Otherwise, # look for a macro that doesn't take arguments. ac_script=' :mline /\\$/{ N s,\\\n,, b mline } t clear :clear s/^[ ]*#[ ]*define[ ][ ]*\([^ (][^ (]*([^)]*)\)[ ]*\(.*\)/-D\1=\2/g t quote s/^[ ]*#[ ]*define[ ][ ]*\([^ ][^ ]*\)[ ]*\(.*\)/-D\1=\2/g t quote b any :quote s/[ `~#$^&*(){}\\|;'\''"<>?]/\\&/g s/\[/\\&/g s/\]/\\&/g s/\$/$$/g H :any ${ g s/^\n// s/\n/ /g p } ' DEFS=`sed -n "$ac_script" confdefs.h` ac_libobjs= ac_ltlibobjs= U= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' ac_i=`$as_echo "$ac_i" | sed "$ac_script"` # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR # will be set to the directory where LIBOBJS objects are built. as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext" as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs : "${CONFIG_STATUS=./config.status}" ac_write_fail=0 ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5 $as_echo "$as_me: creating $CONFIG_STATUS" >&6;} as_write_fail=0 cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1 #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1 ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p as_test_x='test -x' as_executable_p=as_fn_executable_p # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 6>&1 ## ----------------------------------- ## ## Main body of $CONFIG_STATUS script. ## ## ----------------------------------- ## _ASEOF test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Save the log message, to keep $0 and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" This file was extended by $as_me, which was generated by GNU Autoconf 2.69. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF case $ac_config_files in *" "*) set x $ac_config_files; shift; ac_config_files=$*;; esac cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # Files that config.status was made for. config_files="$ac_config_files" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 ac_cs_usage="\ \`$as_me' instantiates files and other configuration actions from templates according to the current configuration. Unless the files and actions are specified as TAGs, all are instantiated by default. Usage: $0 [OPTION]... [TAG]... -h, --help print this help, then exit -V, --version print version number and configuration settings, then exit --config print configuration, then exit -q, --quiet, --silent do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE Configuration files: $config_files Report bugs to the package provider." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" ac_cs_version="\\ config.status configured by $0, generated by GNU Autoconf 2.69, with options \\"\$ac_cs_config\\" Copyright (C) 2012 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' test -n "\$AWK" || AWK=awk _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # The default lists apply if the user does not specify any file. ac_need_defaults=: while test $# != 0 do case $1 in --*=?*) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` ac_shift=: ;; --*=) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg= ac_shift=: ;; *) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; esac case $ac_option in # Handling of the options. -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) $as_echo "$ac_cs_version"; exit ;; --config | --confi | --conf | --con | --co | --c ) $as_echo "$ac_cs_config"; exit ;; --debug | --debu | --deb | --de | --d | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; '') as_fn_error $? "missing file argument" ;; esac as_fn_append CONFIG_FILES " '$ac_optarg'" ac_need_defaults=false;; --he | --h | --help | --hel | -h ) $as_echo "$ac_cs_usage"; exit ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) as_fn_error $? "unrecognized option: \`$1' Try \`$0 --help' for more information." ;; *) as_fn_append ac_config_targets " $1" ac_need_defaults=false ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 if \$ac_cs_recheck; then set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion shift \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6 CONFIG_SHELL='$SHELL' export CONFIG_SHELL exec "\$@" fi _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX $as_echo "$ac_log" } >&5 _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Handling of arguments. for ac_config_target in $ac_config_targets do case $ac_config_target in "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; "cfitsio.pc") CONFIG_FILES="$CONFIG_FILES cfitsio.pc" ;; *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason against having it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Hook for its removal unless debugging. # Note that there is a small window in which the directory will not be cleaned: # after its creation but before its name has been assigned to `$tmp'. $debug || { tmp= ac_tmp= trap 'exit_status=$? : "${ac_tmp:=$tmp}" { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status ' 0 trap 'as_fn_exit 1' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && test -d "$tmp" } || { tmp=./conf$$-$RANDOM (umask 077 && mkdir "$tmp") } || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5 ac_tmp=$tmp # Set up the scripts for CONFIG_FILES section. # No need to generate them if there are no CONFIG_FILES. # This happens for instance with `./config.status config.h'. if test -n "$CONFIG_FILES"; then ac_cr=`echo X | tr X '\015'` # On cygwin, bash can eat \r inside `` if the user requested igncr. # But we know of no other shell where ac_cr would be empty at this # point, so we can use a bashism as a fallback. if test "x$ac_cr" = x; then eval ac_cr=\$\'\\r\' fi ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' /dev/null` if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then ac_cs_awk_cr='\\r' else ac_cs_awk_cr=$ac_cr fi echo 'BEGIN {' >"$ac_tmp/subs1.awk" && _ACEOF { echo "cat >conf$$subs.awk <<_ACEOF" && echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' && echo "_ACEOF" } >conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'` ac_delim='%!_!# ' for ac_last_try in false false false false false :; do . ./conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X` if test $ac_delim_n = $ac_delim_num; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done rm -f conf$$subs.sh cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK && _ACEOF sed -n ' h s/^/S["/; s/!.*/"]=/ p g s/^[^!]*!// :repl t repl s/'"$ac_delim"'$// t delim :nl h s/\(.\{148\}\)..*/\1/ t more1 s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/ p n b repl :more1 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t nl :delim h s/\(.\{148\}\)..*/\1/ t more2 s/["\\]/\\&/g; s/^/"/; s/$/"/ p b :more2 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t delim ' >$CONFIG_STATUS || ac_write_fail=1 rm -f conf$$subs.awk cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACAWK cat >>"\$ac_tmp/subs1.awk" <<_ACAWK && for (key in S) S_is_set[key] = 1 FS = "" } { line = $ 0 nfields = split(line, field, "@") substed = 0 len = length(field[1]) for (i = 2; i < nfields; i++) { key = field[i] keylen = length(key) if (S_is_set[key]) { value = S[key] line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3) len += length(value) + length(field[++i]) substed = 1 } else len += 1 + keylen } print line } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g" else cat fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \ || as_fn_error $? "could not setup config files machinery" "$LINENO" 5 _ACEOF # VPATH may cause trouble with some makes, so we remove sole $(srcdir), # ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=[ ]*/{ h s/// s/^/:/ s/[ ]*$/:/ s/:\$(srcdir):/:/g s/:\${srcdir}:/:/g s/:@srcdir@:/:/g s/^:*// s/:*$// x s/\(=[ ]*\).*/\1/ G s/\n// s/^[^=]*=[ ]*$// }' fi cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 fi # test -n "$CONFIG_FILES" eval set X " :F $CONFIG_FILES " shift for ac_tag do case $ac_tag in :[FHLC]) ac_mode=$ac_tag; continue;; esac case $ac_mode$ac_tag in :[FHL]*:*);; :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;; :[FH]-) ac_tag=-:-;; :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; esac ac_save_IFS=$IFS IFS=: set x $ac_tag IFS=$ac_save_IFS shift ac_file=$1 shift case $ac_mode in :L) ac_source=$1;; :[FH]) ac_file_inputs= for ac_f do case $ac_f in -) ac_f="$ac_tmp/stdin";; *) # Look for the file first in the build tree, then in the source tree # (if the path is not absolute). The absolute path cannot be DOS-style, # because $ac_f cannot contain `:'. test -f "$ac_f" || case $ac_f in [\\/$]*) false;; *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; esac || as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;; esac case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac as_fn_append ac_file_inputs " '$ac_f'" done # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ configure_input='Generated from '` $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g' `' by configure.' if test x"$ac_file" != x-; then configure_input="$ac_file. $configure_input" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5 $as_echo "$as_me: creating $ac_file" >&6;} fi # Neutralize special characters interpreted by sed in replacement strings. case $configure_input in #( *\&* | *\|* | *\\* ) ac_sed_conf_input=`$as_echo "$configure_input" | sed 's/[\\\\&|]/\\\\&/g'`;; #( *) ac_sed_conf_input=$configure_input;; esac case $ac_tag in *:-:* | *:-) cat >"$ac_tmp/stdin" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; esac ;; esac ac_dir=`$as_dirname -- "$ac_file" || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix case $ac_mode in :F) # # CONFIG_FILE # _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # If the template does not know about datarootdir, expand it. # FIXME: This hack should be removed a few years after 2.60. ac_datarootdir_hack=; ac_datarootdir_seen= ac_sed_dataroot=' /datarootdir/ { p q } /@datadir@/p /@docdir@/p /@infodir@/p /@localedir@/p /@mandir@/p' case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in *datarootdir*) ac_datarootdir_seen=yes;; *@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 $as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_datarootdir_hack=' s&@datadir@&$datadir&g s&@docdir@&$docdir&g s&@infodir@&$infodir&g s&@localedir@&$localedir&g s&@mandir@&$mandir&g s&\\\${datarootdir}&$datarootdir&g' ;; esac _ACEOF # Neutralize VPATH when `$srcdir' = `.'. # Shell code in configure.ac might set extrasub. # FIXME: do we really want to maintain this feature? cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_sed_extra="$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s|@configure_input@|$ac_sed_conf_input|;t t s&@top_builddir@&$ac_top_builddir_sub&;t t s&@top_build_prefix@&$ac_top_build_prefix&;t t s&@srcdir@&$ac_srcdir&;t t s&@abs_srcdir@&$ac_abs_srcdir&;t t s&@top_srcdir@&$ac_top_srcdir&;t t s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t s&@builddir@&$ac_builddir&;t t s&@abs_builddir@&$ac_abs_builddir&;t t s&@abs_top_builddir@&$ac_abs_top_builddir&;t t $ac_datarootdir_hack " eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$ac_tmp/subs.awk" \ >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5 test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } && { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' \ "$ac_tmp/out"`; test -z "$ac_out"; } && { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&5 $as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&2;} rm -f "$ac_tmp/stdin" case $ac_file in -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";; *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";; esac \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; esac done # for ac_tag as_fn_exit 0 _ACEOF ac_clean_files=$ac_clean_files_save test $ac_write_fail = 0 || as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5 # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || as_fn_exit 1 fi if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5 $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;} fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: " >&5 $as_echo "" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: Congratulations, Makefile update was successful." >&5 $as_echo " Congratulations, Makefile update was successful." >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: You may want to run \"make\" now." >&5 $as_echo " You may want to run \"make\" now." >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: " >&5 $as_echo "" >&6; } cfitsio-3.47/configure.in0000644000225700000360000004707413471052255014726 0ustar cagordonlhea# # configure.in for cfitsio # # /redshift/sgi6/lheavc/ftools/cfitsio/configure.in,v 3.4 1996/07/26 20:27:53 pence Exp # # copied from host and modified # dnl Process this file with autoconf to produce a configure script. AC_INIT AC_CONFIG_SRCDIR([fitscore.c]) AC_CANONICAL_TARGET([]) #-------------------------------------------------------------------- # CFITSIO Version Numbers: #-------------------------------------------------------------------- AC_SUBST(CFITSIO_MAJOR,3) AC_SUBST(CFITSIO_MINOR,47) # Increment soname each time the interface changes: AC_SUBST(CFITSIO_SONAME,8) #-------------------------------------------------------------------- # Command options #-------------------------------------------------------------------- ADD_CURL=yes AC_ARG_ENABLE( curl, [AS_HELP_STRING([--disable-curl],[Disable linking with the curl library. Disables remote file i/o support])], [ if test $enableval = no; then ADD_CURL=no; fi ] ) if test "x$ADD_CURL" = xno; then AC_MSG_WARN(Not linking with curl for remote file i/o support) fi AC_ARG_ENABLE( reentrant, [AS_HELP_STRING([--enable-reentrant],[Enable reentrant multithreading])], [ if test $enableval = yes; then BUILD_REENTRANT=yes; fi ] ) SSE_FLAGS="" AC_ARG_ENABLE( sse2, [AS_HELP_STRING([--enable-sse2],[Enable use of instructions in the SSE2 extended instruction set])], [ if test $enableval = yes; then SSE_FLAGS="-msse2"; fi ] ) AC_ARG_ENABLE( ssse3, [AS_HELP_STRING([--enable-ssse3],[Enable use of instructions in the SSSE3 extended instruction set])], [ if test $enableval = yes; then SSE_FLAGS="$SSE_FLAGS -mssse3"; fi ] ) # Define BUILD_HERA when building for HERA project to activate code in # drvrfile.c (by way of fitsio2.h): AC_ARG_ENABLE( hera, [AS_HELP_STRING([--enable-hera],[Build for HERA (ASD use only)])], [ if test $enableval = yes; then BUILD_HERA=yes; fi ] ) if test "x$BUILD_HERA" = xyes; then AC_DEFINE(BUILD_HERA) fi # Optional support for bzip2 compression: AC_ARG_WITH( bzip2, [AS_HELP_STRING([--with-bzip2[[=PATH]]],[Enable bzip2 support. Optional path to the location of include/bzlib.h and lib/libbz2])], [ if test "x$withval" != "xno"; then if test "x$withval" = "xyes" ; then AC_CHECK_LIB([bz2],[main],[],[AC_MSG_ERROR(Unable to locate bz2 library needed when enabling bzip2 support; try specifying the path)]) else BZIP2_PATH="${withval}" fi AC_CHECK_HEADERS(bzlib.h,[AC_DEFINE(HAVE_BZIP2,1,[Define if you want bzip2 read support])]) fi ] ) # Optional Globus Toolkit support: AC_ARG_WITH( gsiftp, [AS_HELP_STRING([--with-gsiftp[[=PATH]]],[Enable Globus Toolkit gsiftp protocol support])], [ if test "x$withval" != "xno"; then if test "x$withval" != "xyes" ; then GSIFTP_PATH="${withval}" fi AC_DEFINE(HAVE_GSIFTP,1,[Define if you want Globus Toolkit gsiftp protocol support]) USE_GSIFTP=yes fi ] ) # GSIFTP source code (optional): if test "x$USE_GSIFTP" = xyes; then GSIFTP_SRC="drvrgsiftp.c" else GSIFTP_SRC="" fi AC_SUBST(GSIFTP_SRC) AC_ARG_WITH( gsiftp-flavour, [AS_HELP_STRING([--with-gsiftp-flavour[[=PATH]]],[Define Globus Toolkit gsiftp protocol flavour])], [ if test "x$withval" != "xno"; then if test "x$withval" != "xyes" ; then GSIFTP_FLAVOUR="${withval}" fi AC_DEFINE(GSIFTP_FLAVOUR,1,[Define Globus Toolkit architecture]) fi ] ) #-------------------------------------------------------------------- # Check for install location prefix #-------------------------------------------------------------------- AC_PREFIX_DEFAULT(`pwd`) # make will complain about duplicate targets for the install directories # if prefix == exec_prefix AC_SUBST(INSTALL_ROOT,'${prefix}') test "$exec_prefix" != NONE -a "$prefix" != "$exec_prefix" \ && INSTALL_ROOT="$INSTALL_ROOT "'${exec_prefix}' #-------------------------------------------------------------------- # System type #-------------------------------------------------------------------- case $host in *cygwin*) ARCH="cygwin" EXT="cygwin" ;; *apple-darwin*) # Darwin can be powerpc, i386, or x86_64 ARCH=`uname -p` EXT="darwin" ;; *freebsd*) ARCH="linux" EXT="lnx" ;; *hpux*) ARCH="hp" EXT="hpu" ;; *irix*) ARCH="sgi" EXT="sgi" ;; *linux*) ARCH="linux" EXT="lnx" ;; *mingw32*) #ARCH="" EXT="mingw32" ;; *osf1*) ARCH="alpha" EXT="osf" ;; *solaris*) ARCH="solaris" EXT="sol" ;; *ultrix*) ARCH="dec" EXT="dec" ;; *) echo "cfitsio: == Don't know what do do with $host" ;; esac dnl Checks for programs. # Try first to find a proprietary C compiler, then gcc if test "x$EXT" != xcygwin && test "x$EXT" != xdarwin && test "x$EXT" != xlnx && test "x$EXT" != xmingw32; then if test "x$CC" = x; then AC_CHECK_PROGS(CC, cc) fi fi AC_PROG_CC LDFLAGS="$CFLAGS" LDFLAGS_BIN="$LDFLAGS" if test "x$FC" = "xnone" ; then AC_MSG_NOTICE(cfitsio: == Fortran compiler search has been overridden) AC_MSG_NOTICE(cfitsio: == Cfitsio will be built without Fortran wrapper support) FC= F77_WRAPPERS= else AC_CHECK_PROGS(FC, gfortran g95 g77 f77 ifort f95 f90 xlf cf77 gf77 af77 ncf f2c, notfound) if test $FC = 'notfound' ; then AC_MSG_WARN(cfitsio: == No acceptable Fortran compiler found in \$PATH) AC_MSG_NOTICE(cfitsio: == Adding wrapper support for GNU Fortran by default) CFORTRANFLAGS="-Dg77Fortran" F77_WRAPPERS="\${FITSIO_SRC}" else CFORTRANFLAGS= F77_WRAPPERS="\${FITSIO_SRC}" echo $ac_n "checking whether we are using GNU Fortran""... $ac_c" 1>&6 if test `$FC --version -c < /dev/null 2> /dev/null | grep -c GNU` -gt 0 -o \ `$FC --version -c < /dev/null 2> /dev/null | grep -ic egcs` -gt 0 then echo "$ac_t""yes" 1>&6 echo $ac_n "cfitsio: == Adding wrapper support for GNU Fortran""... $ac_c" 1>&6 CFORTRANFLAGS="-Dg77Fortran" echo "$ac_t"" done" 1>&6 else echo "$ac_t""no" 1>&6 if test $FC = 'f2c' ; then echo $ac_n "cfitsio: == Adding wrapper support for f2c""... $ac_c" 1>&6 CFORTRANFLAGS="-Df2cFortran" echo "$ac_t"" done" 1>&6 fi fi fi fi # ar & ranlib required #--------------------- AC_CHECK_PROG(AR, ar, ar, noar) if test $AR = noar; then AC_MSG_ERROR(ar not found in your \$PATH. See your sysdamin.) fi ARCHIVE="$AR rv" AC_SUBST(ARCHIVE) AC_PROG_RANLIB dnl Checks for ANSI stdlib.h. AC_CHECK_HEADERS(stdlib.h string.h math.h limits.h ,ANSI_HEADER=yes,ANSI_HEADER=no)dnl dnl Check if prototyping is allowed. AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[]], [[void d( int , double) ]])],[PROTO=yes],[PROTO=no])dnl if test $ANSI_HEADER = no -o $PROTO = no; then echo " *********** WARNING: CFITSIO CONFIGURE FAILURE ************ " echo "cfitsio: ANSI C environment NOT found. Aborting cfitsio configure." if test $ANSI_HEADER = no; then echo "cfitsio: You're missing a needed ANSI header file." fi if test $PROTO = no; then echo "cfitsio: Your compiler can't do ANSI function prototypes." fi echo "cfitsio: You need an ANSI C compiler and all ANSI trappings" echo "cfitsio: to build cfitsio. " echo " ******************************************************* " exit 0; fi dnl Check if C compiler supports sse extended instruction flags. if test "x$SSE_FLAGS" != x; then SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS $SSE_FLAGS" AC_MSG_CHECKING([whether $CC accepts $SSE_FLAGS]) AC_LANG_PUSH([C]) AC_COMPILE_IFELSE([AC_LANG_PROGRAM([])],[c_has_option=yes],[c_has_option=no]) AC_MSG_RESULT($c_has_option) AC_LANG_POP([]) if test "$c_has_option" = no; then SSE_FLAGS=""; fi CFLAGS="$SAVE_CFLAGS" fi AC_SUBST(SSE_FLAGS) CFLAGS="$CFLAGS" LIBPRE="" case $host in *cygwin*) CFLAGS="$CFLAGS -DHAVE_POSIX_SIGNALS" ;; *apple-darwin*) changequote(,) case $host in *darwin[56789]*) ;; *) changequote([,]) # # Build for i386 & x86_64 architectures on Darwin 10.x or newer: # echo "int main(){return(0);}" > /tmp/$$.c # $CC -v -o /tmp/$$.out /tmp/$$.c 2> /tmp/$$.log # if test `cat /tmp/$$.log | grep -ci 'LLVM'` -ne 0; then APPLEXCODE="yes"; fi # if test "x$APPLEXCODE" = xyes; then # # Flags for building Universal binaries: # C_UNIV_SWITCH="-arch i386 -arch x86_64" # CFLAGS="$CFLAGS $C_UNIV_SWITCH" # fi # LDFLAGS used by utilities: LDFLAGS_BIN="$LDFLAGS_BIN -Wl,-rpath,\${CFITSIO_LIB}" ;; esac # For large file support (but may break Absoft compilers): AC_DEFINE(_LARGEFILE_SOURCE) AC_DEFINE(_FILE_OFFSET_BITS,64) ;; *hpux*) if test "x$CFORTRANFLAGS" = x ; then CFORTRANFLAGS="-Dappendus" fi CFLAGS="$CFLAGS -DPG_PPU" LIBPRE="-Wl," ;; *irix*) CFLAGS="$CFLAGS -DHAVE_POSIX_SIGNALS" RANLIB="touch" ;; *linux*) # For large file support: AC_DEFINE(_LARGEFILE_SOURCE) AC_DEFINE(_FILE_OFFSET_BITS,64) ;; *mingw32*) AC_MSG_CHECKING([for large file support]) AC_COMPILE_IFELSE([AC_LANG_PROGRAM([#include ], [_FILE_OFFSET_BITS_SET_FSEEKO])],[ AC_DEFINE(_LARGEFILE_SOURCE) AC_DEFINE(_FILE_OFFSET_BITS,64) AC_MSG_RESULT(yes) ],[AC_MSG_RESULT(no)]) ;; *solaris*) if test "x$CFORTRANFLAGS" = x ; then CFORTRANFLAGS="-Dsolaris" fi # We need libm on Solaris: AC_CHECK_LIB(m, frexp) # For large file support: AC_DEFINE(_LARGEFILE_SOURCE) AC_DEFINE(_FILE_OFFSET_BITS,64) ;; *) echo "cfitsio: == Don't know what do do with $host" ;; esac CFLAGS="$CFLAGS $CFORTRANFLAGS" case $GCC in yes) GCCVERSION="`$CC -dumpversion 2>&1`" echo "cfitsio: == Using gcc version $GCCVERSION" AC_SUBST(GCCVERSION) changequote(,) gcc_test=`echo $GCCVERSION | grep -c '2\.[45678]'` changequote([,]) if test $gcc_test -gt 0 then changequote(,) CFLAGS=`echo $CFLAGS | sed 's:-O[^ ]* *::'` changequote([,]) AC_MSG_WARN(This gcc is pretty old. Disabling optimization to be safe.) fi ;; no) echo "cfitsio: Old CFLAGS is $CFLAGS" CFLAGS=`echo $CFLAGS | sed -e "s/-g/-O/"` case $host in *solaris*) changequote(,) if test `echo $CFLAGS | grep -c fast` -gt 0 then echo "cfitsio: Replacing -fast with -O3" CFLAGS=`echo $CFLAGS | sed 's:-fast:-O3:'` fi changequote([,]) CFLAGS="$CFLAGS -DHAVE_ALLOCA_H -DHAVE_POSIX_SIGNALS" ;; *) echo "== No special changes for $host" ;; esac echo "New CFLAGS is $CFLAGS" ;; *) # Don't do anything now ;; esac # Shared library section #------------------------------------------------------------------------------- SHLIB_LD=: SHLIB_SUFFIX=".so" CFITSIO_SHLIB="" CFITSIO_SHLIB_SONAME="" lhea_shlib_cflags= case $EXT in cygwin|mingw32) SHLIB_LD="$CC -shared" SHLIB_SUFFIX=".dll" ;; darwin) changequote(,) SHLIB_SUFFIX=".dylib" CFITSIO_SHLIB="lib\${PACKAGE}.\${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}\${SHLIB_SUFFIX}" CFITSIO_SHLIB_SONAME="lib\${PACKAGE}.\${CFITSIO_SONAME}\${SHLIB_SUFFIX}" case $host in *darwin[56789]*) SHLIB_LD="$CC -dynamiclib -install_name lib\${PACKAGE}.\${CFITSIO_SONAME}\${SHLIB_SUFFIX} -compatibility_version \${CFITSIO_SONAME} -current_version \${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}" ;; *) # Build 'Universal' binaries (i386 & x86_64 architectures) and # use rpath token on Darwin 10.x or newer: SHLIB_LD="$CC -dynamiclib $C_UNIV_SWITCH -headerpad_max_install_names -install_name @rpath/lib\${PACKAGE}.\${CFITSIO_SONAME}\${SHLIB_SUFFIX} -compatibility_version \${CFITSIO_SONAME} -current_version \${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}" ;; esac changequote([,]) lhea_shlib_cflags="-fPIC -fno-common" ;; hpu) SHLIB_LD="ld -b" SHLIB_SUFFIX=".sl" ;; lnx) SHLIB_LD=":" CFITSIO_SHLIB="lib\${PACKAGE}\${SHLIB_SUFFIX}.\${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}" CFITSIO_SHLIB_SONAME="lib\${PACKAGE}\${SHLIB_SUFFIX}.\${CFITSIO_SONAME}" ;; osf) SHLIB_LD="ld -shared -expect_unresolved '*'" LD_FLAGS="-taso" ;; sol) SHLIB_LD="/usr/ccs/bin/ld -G" lhea_shlib_cflags="-KPIC" ;; sgi) SHLIB_LD="ld -shared -rdata_shared" ;; *) AC_MSG_WARN(Unable to determine how to make a shared library) ;; esac # Darwin uses gcc (=cc), but needs different flags (see above) if test "x$EXT" != xdarwin && test "x$EXT" != xcygwin && test "x$EXT" != xmingw32; then if test "x$GCC" = xyes; then SHLIB_LD="$CC -shared -Wl,-soname,lib\${PACKAGE}\${SHLIB_SUFFIX}.\${CFITSIO_SONAME}" lhea_shlib_cflags='-fPIC' fi fi if test "x$lhea_shlib_cflags" != x; then CFLAGS="$CFLAGS $lhea_shlib_cflags" fi # Set shared library name for cases in which we aren't setting a 'soname': if test "x$CFITSIO_SHLIB" = x; then CFITSIO_SHLIB="lib\${PACKAGE}\${SHLIB_SUFFIX}"; fi # Curl library (will be pulled in to the shared CFITSIO library): # --------------------------------------------------------------- CURL_INC="" CURL_LIB="" CURL_LIB_PATH="" if test "x$ADD_CURL" = xyes; then # Use curl-config to get compiler & linker flags, if available. AC_CHECK_PROG([CURLCONFIG], [curl-config], [curl-config], [], [], []) if test "x$CURLCONFIG" != x; then CURL_LIB=`$CURLCONFIG --libs` CURL_INC=`$CURLCONFIG --cflags` if test "x$CURL_LIB" != x; then LIBS_CURL="$CURL_LIB" # Mac OS: For third-party curl-config, acquire an rpath: if test `echo $host | grep -c apple-darwin` -ne 0 -a `echo $CURL_LIB | grep -c "^\-L"` -gt 0; then CURL_LIB_PATH=`echo ${CURL_LIB} | tr " " "\012" | grep "^\-L" | tr "\012" " " | sed 's:-L::' | sed 's:[ ]$::'` if test "x$CURL_LIB_PATH" != x; then LIBS_CURL="-Wl,-rpath,$CURL_LIB_PATH $CURL_LIB" fi fi if test `echo $host | grep -c cygwin` -ne 0 -o `echo $host | grep -c mingw32` -ne 0; then LIBS="$CURL_LIB $LIBS" fi AC_DEFINE(CFITSIO_HAVE_CURL) fi if test "x$CURL_INC" != x; then CFLAGS="$CURL_INC $CFLAGS" fi # No curl-config: else AC_MSG_WARN(curl-config not found. Disabling curl support.) # Incomplete stubs for possible future use: # AC_CHECK_LIB([curl],[main],[], # [AC_MSG_WARN(Not building curl support for CFITSIO)]) # AC_CHECK_HEADER(curl.h,[]) fi fi AC_SUBST(LIBS_CURL) # GSIFTP flags: if test "x$GSIFTP_PATH" != x -a "x$GSIFTP_FLAVOUR" != x; then CFLAGS="$CFLAGS -I${GSIFTP_PATH}/include/${GSIFTP_FLAVOUR}" LIBS="$LIBS -L${GSIFTP_PATH}/lib -lglobus_ftp_client_${GSIFTP_FLAVOUR}" fi # BZIP2 flags: if test "x$BZIP2_PATH" != x; then CFLAGS="$CFLAGS -I${BZIP2_PATH}/include" LIBS="$LIBS -L${BZIP2_PATH}/lib -lbz2" fi AC_SUBST(ARCH)dnl AC_SUBST(CFLAGS)dnl AC_SUBST(CC)dnl AC_SUBST(FC)dnl AC_SUBST(LIBPRE)dnl AC_SUBST(SHLIB_LD)dnl AC_SUBST(SHLIB_SUFFIX)dnl AC_SUBST(CFITSIO_SHLIB)dnl AC_SUBST(CFITSIO_SHLIB_SONAME)dnl AC_SUBST(F77_WRAPPERS) AC_SUBST(LDFLAGS_BIN) # ================= test for the unix ftruncate function ================ AC_MSG_CHECKING(whether ftruncate works) AC_LINK_IFELSE([AC_LANG_PROGRAM([[#include ]], [[ ftruncate(0, 0); ]])],[ AC_DEFINE(HAVE_FTRUNCATE) AC_MSG_RESULT(yes) ],[AC_MSG_RESULT(no) ]) # --------------------------------------------------------- # some systems define long long for 64-bit ints # --------------------------------------------------------- AC_MSG_CHECKING(whether long long is defined) AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[#include ]], [[ long long filler; ]])],[ AC_DEFINE(HAVE_LONGLONG) AC_MSG_RESULT(yes) ],[AC_MSG_RESULT(no) ]) # ==================== SHARED MEMORY DRIVER SECTION ======================= # # 09-Mar-98 : modified by JB/ISDC # 3 checks added to support autoconfiguration of shared memory # driver. First generic check is made whether shared memory is supported # at all, then 2 more specific checks are made (architecture dependent). # Currently tested on : sparc-solaris, intel-linux, sgi-irix, dec-alpha-osf # ------------------------------------------------------------------------- # check is System V IPC is supported on this machine # ------------------------------------------------------------------------- AC_MSG_CHECKING(whether system V style IPC services are supported) AC_LINK_IFELSE([AC_LANG_PROGRAM([[#include #include #include ]], [[ shmat(0, 0, 0); shmdt(0); shmget(0, 0, 0); semget(0, 0, 0); ]])],[ AC_DEFINE(HAVE_SHMEM_SERVICES) my_shmem=\${SOURCES_SHMEM} AC_MSG_RESULT(yes) ],[AC_MSG_RESULT(no) ]) AC_SUBST(my_shmem) # ------------------------------------------------------------------------- # some systems define flock_t, for others we have to define it ourselves # ------------------------------------------------------------------------- AC_MSG_CHECKING(whether flock_t is defined in sys/fcntl.h) AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[#include ]], [[ flock_t filler; ]])],[ AC_DEFINE(HAVE_FLOCK_T) AC_MSG_RESULT(yes) ],[AC_MSG_RESULT(no) ]) if test "$HAVE_FLOCK_T" != 1; then AC_MSG_CHECKING(whether flock_t is defined in sys/flock.h) AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[#include ]], [[ flock_t filler; ]])],[ AC_DEFINE(HAVE_FLOCK_T) AC_MSG_RESULT(yes) ],[AC_MSG_RESULT(no) ]) fi # ------------------------------------------------------------------------------ # Define _REENTRANT & add -lpthread to LIBS if reentrant multithreading enabled: # ------------------------------------------------------------------------------ if test "x$BUILD_REENTRANT" = xyes; then AC_DEFINE(_REENTRANT) AC_DEFINE([_XOPEN_SOURCE], [700]) # Additional definition needed to get 'union semun' when using # _XOPEN_SOURCE on a Mac: if test "x$EXT" = xdarwin; then AC_DEFINE([_DARWIN_C_SOURCE]) fi AC_CHECK_LIB([pthread],[main],[],[AC_MSG_ERROR(Unable to locate pthread library needed when enabling reentrant multithreading)]) fi # ------------------------------------------------------------------------- # there are some idiosyncrasies with semun defs (used in semxxx). Solaris # does not define it at all # ------------------------------------------------------------------------- AC_MSG_CHECKING(whether union semun is defined) AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[#include #include #include ]], [[ union semun filler; ]])],[ AC_DEFINE(HAVE_UNION_SEMUN) AC_MSG_RESULT(yes) ],[AC_MSG_RESULT(no) ]) # ------------------------------------------------------------------------- # fmemopen is not available on e.g. older Macs: # ------------------------------------------------------------------------- AC_CHECK_FUNC(fmemopen, AC_DEFINE(HAVE_FMEMOPEN), [AC_MSG_WARN(Disabling support for compressed files via FTPS)]) # ==================== END OF SHARED MEMORY DRIVER SECTION ================ # ================= test for the unix networking functions ================ AC_SEARCH_LIBS([gethostbyname], [nsl], cfitsio_have_nsl=1, cfitsio_have_nsl=0) AC_SEARCH_LIBS([connect], [socket], cfitsio_have_socket=1, cfitsio_have_socket=0, [-lnsl]) if test "$cfitsio_have_nsl" = 1 -a "$cfitsio_have_socket" = 1; then AC_DEFINE(HAVE_NET_SERVICES) fi # ==================== END OF unix networking SECTION ================ AC_CONFIG_FILES([Makefile]) AC_OUTPUT AC_CONFIG_FILES([cfitsio.pc]) AC_OUTPUT AC_MSG_RESULT([]) AC_MSG_RESULT([ Congratulations, Makefile update was successful.]) AC_MSG_RESULT([ You may want to run \"make\" now.]) AC_MSG_RESULT([]) cfitsio-3.47/cookbook.c0000644000225700000360000005254213464573431014371 0ustar cagordonlhea#include #include #include /* Every program which uses the CFITSIO interface must include the the fitsio.h header file. This contains the prototypes for all the routines and defines the error status values and other symbolic constants used in the interface. */ #include "fitsio.h" int main( void ); void writeimage( void ); void writeascii( void ); void writebintable( void ); void copyhdu( void ); void selectrows( void ); void readheader( void ); void readimage( void ); void readtable( void ); void printerror( int status); int main() { /************************************************************************* This is a simple main program that calls the following routines: writeimage - write a FITS primary array image writeascii - write a FITS ASCII table extension writebintable - write a FITS binary table extension copyhdu - copy a header/data unit from one FITS file to another selectrows - copy selected row from one HDU to another readheader - read and print the header keywords in every extension readimage - read a FITS image and compute the min and max value readtable - read columns of data from ASCII and binary tables **************************************************************************/ writeimage(); writeascii(); writebintable(); copyhdu(); selectrows(); readheader(); readimage(); readtable(); printf("\nAll the cfitsio cookbook routines ran successfully.\n"); return(0); } /*--------------------------------------------------------------------------*/ void writeimage( void ) /******************************************************/ /* Create a FITS primary array containing a 2-D image */ /******************************************************/ { fitsfile *fptr; /* pointer to the FITS file, defined in fitsio.h */ int status, ii, jj; long fpixel, nelements, exposure; unsigned short *array[200]; /* initialize FITS image parameters */ char filename[] = "atestfil.fit"; /* name for new FITS file */ int bitpix = USHORT_IMG; /* 16-bit unsigned short pixel values */ long naxis = 2; /* 2-dimensional image */ long naxes[2] = { 300, 200 }; /* image is 300 pixels wide by 200 rows */ /* allocate memory for the whole image */ array[0] = (unsigned short *)malloc( naxes[0] * naxes[1] * sizeof( unsigned short ) ); /* initialize pointers to the start of each row of the image */ for( ii=1; ii 0) { nbuffer = npixels; if (npixels > buffsize) nbuffer = buffsize; /* read as many pixels as will fit in buffer */ /* Note that even though the FITS images contains unsigned integer */ /* pixel values (or more accurately, signed integer pixels with */ /* a bias of 32768), this routine is reading the values into a */ /* float array. Cfitsio automatically performs the datatype */ /* conversion in cases like this. */ if ( fits_read_img(fptr, TFLOAT, fpixel, nbuffer, &nullval, buffer, &anynull, &status) ) printerror( status ); for (ii = 0; ii < nbuffer; ii++) { if ( buffer[ii] < datamin ) datamin = buffer[ii]; if ( buffer[ii] > datamax ) datamax = buffer[ii]; } npixels -= nbuffer; /* increment remaining number of pixels */ fpixel += nbuffer; /* next pixel to be read in image */ } printf("\nMin and max image pixels = %.0f, %.0f\n", datamin, datamax); if ( fits_close_file(fptr, &status) ) printerror( status ); return; } /*--------------------------------------------------------------------------*/ void readtable( void ) /************************************************************/ /* read and print data values from an ASCII or binary table */ /************************************************************/ { fitsfile *fptr; /* pointer to the FITS file, defined in fitsio.h */ int status, hdunum, hdutype, nfound, anynull, ii; long frow, felem, nelem, longnull, dia[6]; float floatnull, den[6]; char strnull[10], *name[6], *ttype[3]; char filename[] = "atestfil.fit"; /* name of existing FITS file */ status = 0; if ( fits_open_file(&fptr, filename, READONLY, &status) ) printerror( status ); for (ii = 0; ii < 3; ii++) /* allocate space for the column labels */ ttype[ii] = (char *) malloc(FLEN_VALUE); /* max label length = 69 */ for (ii = 0; ii < 6; ii++) /* allocate space for string column value */ name[ii] = (char *) malloc(10); for (hdunum = 2; hdunum <= 3; hdunum++) /*read ASCII, then binary table */ { /* move to the HDU */ if ( fits_movabs_hdu(fptr, hdunum, &hdutype, &status) ) printerror( status ); if (hdutype == ASCII_TBL) printf("\nReading ASCII table in HDU %d:\n", hdunum); else if (hdutype == BINARY_TBL) printf("\nReading binary table in HDU %d:\n", hdunum); else { printf("Error: this HDU is not an ASCII or binary table\n"); printerror( status ); } /* read the column names from the TTYPEn keywords */ fits_read_keys_str(fptr, "TTYPE", 1, 3, ttype, &nfound, &status); printf(" Row %10s %10s %10s\n", ttype[0], ttype[1], ttype[2]); frow = 1; felem = 1; nelem = 6; strcpy(strnull, " "); longnull = 0; floatnull = 0.; /* read the columns */ fits_read_col(fptr, TSTRING, 1, frow, felem, nelem, strnull, name, &anynull, &status); fits_read_col(fptr, TLONG, 2, frow, felem, nelem, &longnull, dia, &anynull, &status); fits_read_col(fptr, TFLOAT, 3, frow, felem, nelem, &floatnull, den, &anynull, &status); for (ii = 0; ii < 6; ii++) printf("%5d %10s %10ld %10.2f\n", ii + 1, name[ii], dia[ii], den[ii]); } for (ii = 0; ii < 3; ii++) /* free the memory for the column labels */ free( ttype[ii] ); for (ii = 0; ii < 6; ii++) /* free the memory for the string column */ free( name[ii] ); if ( fits_close_file(fptr, &status) ) printerror( status ); return; } /*--------------------------------------------------------------------------*/ void printerror( int status) { /*****************************************************/ /* Print out cfitsio error messages and exit program */ /*****************************************************/ if (status) { fits_report_error(stderr, status); /* print error report */ exit( status ); /* terminate the program, returning error status */ } return; } cfitsio-3.47/cookbook.f0000644000225700000360000007277313464573431014404 0ustar cagordonlhea program main C This is the FITSIO cookbook program that contains an annotated listing of C various computer programs that read and write files in FITS format C using the FITSIO subroutine interface. These examples are C working programs which users may adapt and modify for their own C purposes. This Cookbook serves as a companion to the FITSIO User's C Guide that provides more complete documentation on all the C available FITSIO subroutines. C Call each subroutine in turn: call writeimage call writeascii call writebintable call copyhdu call selectrows call readheader call readimage call readtable print * print *,"All the fitsio cookbook routines ran successfully." end C ************************************************************************* subroutine writeimage C Create a FITS primary array containing a 2-D image integer status,unit,blocksize,bitpix,naxis,naxes(2) integer i,j,group,fpixel,nelements,array(300,200) character filename*80 logical simple,extend C The STATUS parameter must be initialized before using FITSIO. A C positive value of STATUS is returned whenever a serious error occurs. C FITSIO uses an `inherited status' convention, which means that if a C subroutine is called with a positive input value of STATUS, then the C subroutine will exit immediately, preserving the status value. For C simplicity, this program only checks the status value at the end of C the program, but it is usually better practice to check the status C value more frequently. status=0 C Name of the FITS file to be created: filename='ATESTFILEZ.FITS' C Delete the file if it already exists, so we can then recreate it. C The deletefile subroutine is listed at the end of this file. call deletefile(filename,status) C Get an unused Logical Unit Number to use to open the FITS file. C This routine is not required; programmers can choose any unused C unit number to open the file. call ftgiou(unit,status) C Create the new empty FITS file. The blocksize parameter is a C historical artifact and the value is ignored by FITSIO. blocksize=1 call ftinit(unit,filename,blocksize,status) C Initialize parameters about the FITS image. C BITPIX = 16 means that the image pixels will consist of 16-bit C integers. The size of the image is given by the NAXES values. C The EXTEND = TRUE parameter indicates that the FITS file C may contain extensions following the primary array. simple=.true. bitpix=16 naxis=2 naxes(1)=300 naxes(2)=200 extend=.true. C Write the required header keywords to the file call ftphpr(unit,simple,bitpix,naxis,naxes,0,1,extend,status) C Initialize the values in the image with a linear ramp function do j=1,naxes(2) do i=1,naxes(1) array(i,j)=i - 1 +j - 1 end do end do C Write the array to the FITS file. C The last letter of the subroutine name defines the datatype of the C array argument; in this case the 'J' indicates that the array has an C integer*4 datatype. ('I' = I*2, 'E' = Real*4, 'D' = Real*8). C The 2D array is treated as a single 1-D array with NAXIS1 * NAXIS2 C total number of pixels. GROUP is seldom used parameter that should C almost always be set = 1. group=1 fpixel=1 nelements=naxes(1)*naxes(2) call ftpprj(unit,group,fpixel,nelements,array,status) C Write another optional keyword to the header C The keyword record will look like this in the FITS file: C C EXPOSURE= 1500 / Total Exposure Time C call ftpkyj(unit,'EXPOSURE',1500,'Total Exposure Time',status) C The FITS file must always be closed before exiting the program. C Any unit numbers allocated with FTGIOU must be freed with FTFIOU. call ftclos(unit, status) call ftfiou(unit, status) C Check for any errors, and if so print out error messages. C The PRINTERROR subroutine is listed near the end of this file. if (status .gt. 0)call printerror(status) end C ************************************************************************* subroutine writeascii C Create an ASCII table containing 3 columns and 6 rows. For convenience, C the ASCII table extension is appended to the FITS image file created C previously by the WRITEIMAGE subroutine. integer status,unit,readwrite,blocksize,tfields,nrows,rowlen integer nspace,tbcol(3),diameter(6), colnum,frow,felem real density(6) character filename*40,extname*16 character*16 ttype(3),tform(3),tunit(3),name(6) data ttype/'Planet','Diameter','Density'/ data tform/'A8','I6','F4.2'/ data tunit/' ','km','g/cm'/ data name/'Mercury','Venus','Earth','Mars','Jupiter','Saturn'/ data diameter/4880,12112,12742,6800,143000,121000/ data density/5.1,5.3,5.52,3.94,1.33,0.69/ C The STATUS parameter must always be initialized. status=0 C Name of the FITS file to append the ASCII table to: filename='ATESTFILEZ.FITS' C Get an unused Logical Unit Number to use to open the FITS file. call ftgiou(unit,status) C Open the FITS file with write access. C (readwrite = 0 would open the file with readonly access). readwrite=1 call ftopen(unit,filename,readwrite,blocksize,status) C FTCRHD creates a new empty FITS extension following the current C extension and moves to it. In this case, FITSIO was initially C positioned on the primary array when the FITS file was first opened, so C FTCRHD appends an empty extension and moves to it. All future FITSIO C calls then operate on the new extension (which will be an ASCII C table). call ftcrhd(unit,status) C define parameters for the ASCII table (see the above data statements) tfields=3 nrows=6 extname='PLANETS_ASCII' C FTGABC is a convenient subroutine for calculating the total width of C the table and the starting position of each column in an ASCII table. C Any number of blank spaces (including zero) may be inserted between C each column of the table, as specified by the NSPACE parameter. nspace=1 call ftgabc(tfields,tform,nspace,rowlen,tbcol,status) C FTPHTB writes all the required header keywords which define the C structure of the ASCII table. NROWS and TFIELDS give the number of C rows and columns in the table, and the TTYPE, TBCOL, TFORM, and TUNIT C arrays give the column name, starting position, format, and units, C respectively of each column. The values of the ROWLEN and TBCOL parameters C were previously calculated by the FTGABC routine. call ftphtb(unit,rowlen,nrows,tfields,ttype,tbcol,tform,tunit, & extname,status) C Write names to the first column, diameters to 2nd col., and density to 3rd C FTPCLS writes the string values to the NAME column (column 1) of the C table. The FTPCLJ and FTPCLE routines write the diameter (integer) and C density (real) value to the 2nd and 3rd columns. The FITSIO routines C are column oriented, so it is usually easier to read or write data in a C table in a column by column order rather than row by row. frow=1 felem=1 colnum=1 call ftpcls(unit,colnum,frow,felem,nrows,name,status) colnum=2 call ftpclj(unit,colnum,frow,felem,nrows,diameter,status) colnum=3 call ftpcle(unit,colnum,frow,felem,nrows,density,status) C The FITS file must always be closed before exiting the program. C Any unit numbers allocated with FTGIOU must be freed with FTFIOU. call ftclos(unit, status) call ftfiou(unit, status) C Check for any error, and if so print out error messages. C The PRINTERROR subroutine is listed near the end of this file. if (status .gt. 0)call printerror(status) end C ************************************************************************* subroutine writebintable C This routine creates a FITS binary table, or BINTABLE, containing C 3 columns and 6 rows. This routine is nearly identical to the C previous WRITEASCII routine, except that the call to FTGABC is not C needed, and FTPHBN is called rather than FTPHTB to write the C required header keywords. integer status,unit,readwrite,blocksize,hdutype,tfields,nrows integer varidat,diameter(6), colnum,frow,felem real density(6) character filename*40,extname*16 character*16 ttype(3),tform(3),tunit(3),name(6) data ttype/'Planet','Diameter','Density'/ data tform/'8A','1J','1E'/ data tunit/' ','km','g/cm'/ data name/'Mercury','Venus','Earth','Mars','Jupiter','Saturn'/ data diameter/4880,12112,12742,6800,143000,121000/ data density/5.1,5.3,5.52,3.94,1.33,0.69/ C The STATUS parameter must always be initialized. status=0 C Name of the FITS file to append the ASCII table to: filename='ATESTFILEZ.FITS' C Get an unused Logical Unit Number to use to open the FITS file. call ftgiou(unit,status) C Open the FITS file, with write access. readwrite=1 call ftopen(unit,filename,readwrite,blocksize,status) C Move to the last (2nd) HDU in the file (the ASCII table). call ftmahd(unit,2,hdutype,status) C Append/create a new empty HDU onto the end of the file and move to it. call ftcrhd(unit,status) C Define parameters for the binary table (see the above data statements) tfields=3 nrows=6 extname='PLANETS_BINARY' varidat=0 C FTPHBN writes all the required header keywords which define the C structure of the binary table. NROWS and TFIELDS gives the number of C rows and columns in the table, and the TTYPE, TFORM, and TUNIT arrays C give the column name, format, and units, respectively of each column. call ftphbn(unit,nrows,tfields,ttype,tform,tunit, & extname,varidat,status) C Write names to the first column, diameters to 2nd col., and density to 3rd C FTPCLS writes the string values to the NAME column (column 1) of the C table. The FTPCLJ and FTPCLE routines write the diameter (integer) and C density (real) value to the 2nd and 3rd columns. The FITSIO routines C are column oriented, so it is usually easier to read or write data in a C table in a column by column order rather than row by row. Note that C the identical subroutine calls are used to write to either ASCII or C binary FITS tables. frow=1 felem=1 colnum=1 call ftpcls(unit,colnum,frow,felem,nrows,name,status) colnum=2 call ftpclj(unit,colnum,frow,felem,nrows,diameter,status) colnum=3 call ftpcle(unit,colnum,frow,felem,nrows,density,status) C The FITS file must always be closed before exiting the program. C Any unit numbers allocated with FTGIOU must be freed with FTFIOU. call ftclos(unit, status) call ftfiou(unit, status) C Check for any error, and if so print out error messages. C The PRINTERROR subroutine is listed near the end of this file. if (status .gt. 0)call printerror(status) end C ************************************************************************* subroutine copyhdu C Copy the 1st and 3rd HDUs from the input file to a new FITS file integer status,inunit,outunit,readwrite,blocksize,morekeys,hdutype character infilename*40,outfilename*40 C The STATUS parameter must always be initialized. status=0 C Name of the FITS files: infilename='ATESTFILEZ.FITS' outfilename='BTESTFILEZ.FITS' C Delete the file if it already exists, so we can then recreate it C The deletefile subroutine is listed at the end of this file. call deletefile(outfilename,status) C Get unused Logical Unit Numbers to use to open the FITS files. call ftgiou(inunit,status) call ftgiou(outunit,status) C Open the input FITS file, with readonly access readwrite=0 call ftopen(inunit,infilename,readwrite,blocksize,status) C Create the new empty FITS file (value of blocksize is ignored) blocksize=1 call ftinit(outunit,outfilename,blocksize,status) C FTCOPY copies the current HDU from the input FITS file to the output C file. The MOREKEY parameter allows one to reserve space for additional C header keywords when the HDU is created. FITSIO will automatically C insert more header space if required, so programmers do not have to C reserve space ahead of time, although it is more efficient to do so if C it is known that more keywords will be appended to the header. morekeys=0 call ftcopy(inunit,outunit,morekeys,status) C Append/create a new empty extension on the end of the output file call ftcrhd(outunit,status) C Skip to the 3rd extension in the input file which in this case C is the binary table created by the previous WRITEBINARY routine. call ftmahd(inunit,3,hdutype,status) C FTCOPY now copies the binary table from the input FITS file C to the output file. call ftcopy(inunit,outunit,morekeys,status) C The FITS files must always be closed before exiting the program. C Any unit numbers allocated with FTGIOU must be freed with FTFIOU. C Giving -1 for the value of the first argument causes all previously C allocated unit numbers to be released. call ftclos(inunit, status) call ftclos(outunit, status) call ftfiou(-1, status) C Check for any error, and if so print out error messages. C The PRINTERROR subroutine is listed near the end of this file. if (status .gt. 0)call printerror(status) end C ************************************************************************* subroutine selectrows C This routine copies selected rows from an input table into a new output C FITS table. In this example all the rows in the input table that have C a value of the DENSITY column less that 3.0 are copied to the output C table. This program illustrates several generally useful techniques, C including: C how to locate the end of a FITS file C how to create a table when the total number of rows in the table C is not known until the table is completed C how to efficiently copy entire rows from one table to another. integer status,inunit,outunit,readwrite,blocksize,hdutype integer nkeys,nspace,naxes(2),nfound,colnum,frow,felem integer noutrows,irow,temp(100),i real nullval,density(6) character infilename*40,outfilename*40,record*80 logical exact,anynulls C The STATUS parameter must always be initialized. status=0 C Names of the FITS files: infilename='ATESTFILEZ.FITS' outfilename='BTESTFILEZ.FITS' C Get unused Logical Unit Numbers to use to open the FITS files. call ftgiou(inunit,status) call ftgiou(outunit,status) C The input FITS file is opened with READONLY access, and the output C FITS file is opened with WRITE access. readwrite=0 call ftopen(inunit,infilename,readwrite,blocksize,status) readwrite=1 call ftopen(outunit,outfilename,readwrite,blocksize,status) C move to the 3rd HDU in the input file (a binary table in this case) call ftmahd(inunit,3,hdutype,status) C This do-loop illustrates how to move to the last extension in any FITS C file. The call to FTMRHD moves one extension at a time through the C FITS file until an `End-of-file' status value (= 107) is returned. do while (status .eq. 0) call ftmrhd(outunit,1,hdutype,status) end do C After locating the end of the FITS file, it is necessary to reset the C status value to zero and also clear the internal error message stack C in FITSIO. The previous `End-of-file' error will have produced C an unimportant message on the error stack which can be cleared with C the call to the FTCMSG routine (which has no arguments). if (status .eq. 107)then status=0 call ftcmsg end if C Create a new empty extension in the output file. call ftcrhd(outunit,status) C Find the number of keywords in the input table header. call ftghsp(inunit,nkeys,nspace,status) C This do-loop of calls to FTGREC and FTPREC copies all the keywords from C the input to the output FITS file. Notice that the specified number C of rows in the output table, as given by the NAXIS2 keyword, will be C incorrect. This value will be modified later after it is known how many C rows will be in the table, so it does not matter how many rows are specified C initially. do i=1,nkeys call ftgrec(inunit,i,record,status) call ftprec(outunit,record,status) end do C FTGKNJ is used to get the value of the NAXIS1 and NAXIS2 keywords, C which define the width of the table in bytes, and the number of C rows in the table. call ftgknj(inunit,'NAXIS',1,2,naxes,nfound,status) C FTGCNO gets the column number of the `DENSITY' column; the column C number is needed when reading the data in the column. The EXACT C parameter determines whether or not the match to the column names C will be case sensitive. exact=.false. call ftgcno(inunit,exact,'DENSITY',colnum,status) C FTGCVE reads all 6 rows of data in the `DENSITY' column. The number C of rows in the table is given by NAXES(2). Any null values in the C table will be returned with the corresponding value set to -99 C (= the value of NULLVAL). The ANYNULLS parameter will be set to TRUE C if any null values were found while reading the data values in the table. frow=1 felem=1 nullval=-99. call ftgcve(inunit,colnum,frow,felem,naxes(2),nullval, & density,anynulls,status) C If the density is less than 3.0, copy the row to the output table. C FTGTBB and FTPTBB are low-level routines to read and write, respectively, C a specified number of bytes in the table, starting at the specified C row number and beginning byte within the row. These routines do C not do any interpretation of the bytes, and simply pass them to or C from the FITS file without any modification. This is a faster C way of transferring large chunks of data from one FITS file to another, C than reading and then writing each column of data individually. C In this case an entire row of bytes (the row length is specified C by the naxes(1) parameter) is transferred. The datatype of the C buffer array (TEMP in this case) is immaterial so long as it is C declared large enough to hold the required number of bytes. noutrows=0 do irow=1,naxes(2) if (density(irow) .lt. 3.0)then noutrows=noutrows+1 call ftgtbb(inunit,irow,1,naxes(1),temp,status) call ftptbb(outunit,noutrows,1,naxes(1),temp,status) end if end do C Update the NAXIS2 keyword with the correct no. of rows in the output file. C After all the rows have been written to the output table, the C FTMKYJ routine is used to overwrite the NAXIS2 keyword value with C the correct number of rows. Specifying `\&' for the comment string C tells FITSIO to keep the current comment string in the keyword and C only modify the value. Because the total number of rows in the table C was unknown when the table was first created, any value (including 0) C could have been used for the initial NAXIS2 keyword value. call ftmkyj(outunit,'NAXIS2',noutrows,'&',status) C The FITS files must always be closed before exiting the program. C Any unit numbers allocated with FTGIOU must be freed with FTFIOU. call ftclos(inunit, status) call ftclos(outunit, status) call ftfiou(-1, status) C Check for any error, and if so print out error messages. C The PRINTERROR subroutine is listed near the end of this file. if (status .gt. 0)call printerror(status) end C ************************************************************************* subroutine readheader C Print out all the header keywords in all extensions of a FITS file integer status,unit,readwrite,blocksize,nkeys,nspace,hdutype,i,j character filename*80,record*80 C The STATUS parameter must always be initialized. status=0 C Get an unused Logical Unit Number to use to open the FITS file. call ftgiou(unit,status) C name of FITS file filename='ATESTFILEZ.FITS' C open the FITS file, with read-only access. The returned BLOCKSIZE C parameter is obsolete and should be ignored. readwrite=0 call ftopen(unit,filename,readwrite,blocksize,status) j = 0 100 continue j = j + 1 print *,'Header listing for HDU', j C The FTGHSP subroutine returns the number of existing keywords in the C current header data unit (CHDU), not counting the required END keyword, call ftghsp(unit,nkeys,nspace,status) C Read each 80-character keyword record, and print it out. do i = 1, nkeys call ftgrec(unit,i,record,status) print *,record end do C Print out an END record, and a blank line to mark the end of the header. if (status .eq. 0)then print *,'END' print *,' ' end if C Try moving to the next extension in the FITS file, if it exists. C The FTMRHD subroutine attempts to move to the next HDU, as specified by C the second parameter. This subroutine moves by a relative number of C HDUs from the current HDU. The related FTMAHD routine may be used to C move to an absolute HDU number in the FITS file. If the end-of-file is C encountered when trying to move to the specified extension, then a C status = 107 is returned. call ftmrhd(unit,1,hdutype,status) if (status .eq. 0)then C success, so jump back and print out keywords in this extension go to 100 else if (status .eq. 107)then C hit end of file, so quit status=0 end if C The FITS file must always be closed before exiting the program. C Any unit numbers allocated with FTGIOU must be freed with FTFIOU. call ftclos(unit, status) call ftfiou(unit, status) C Check for any error, and if so print out error messages. C The PRINTERROR subroutine is listed near the end of this file. if (status .gt. 0)call printerror(status) end C ************************************************************************* subroutine readimage C Read a FITS image and determine the minimum and maximum pixel value. C Rather than reading the entire image in C at once (which could require a very large array), the image is read C in pieces, 100 pixels at a time. integer status,unit,readwrite,blocksize,naxes(2),nfound integer group,firstpix,nbuffer,npixels,i real datamin,datamax,nullval,buffer(100) logical anynull character filename*80 C The STATUS parameter must always be initialized. status=0 C Get an unused Logical Unit Number to use to open the FITS file. call ftgiou(unit,status) C Open the FITS file previously created by WRITEIMAGE filename='ATESTFILEZ.FITS' readwrite=0 call ftopen(unit,filename,readwrite,blocksize,status) C Determine the size of the image. call ftgknj(unit,'NAXIS',1,2,naxes,nfound,status) C Check that it found both NAXIS1 and NAXIS2 keywords. if (nfound .ne. 2)then print *,'READIMAGE failed to read the NAXISn keywords.' return end if C Initialize variables npixels=naxes(1)*naxes(2) group=1 firstpix=1 nullval=-999 datamin=1.0E30 datamax=-1.0E30 do while (npixels .gt. 0) C read up to 100 pixels at a time nbuffer=min(100,npixels) call ftgpve(unit,group,firstpix,nbuffer,nullval, & buffer,anynull,status) C find the min and max values do i=1,nbuffer datamin=min(datamin,buffer(i)) datamax=max(datamax,buffer(i)) end do C increment pointers and loop back to read the next group of pixels npixels=npixels-nbuffer firstpix=firstpix+nbuffer end do print * print *,'Min and max image pixels = ',datamin,datamax C The FITS file must always be closed before exiting the program. C Any unit numbers allocated with FTGIOU must be freed with FTFIOU. call ftclos(unit, status) call ftfiou(unit, status) C Check for any error, and if so print out error messages. C The PRINTERROR subroutine is listed near the end of this file. if (status .gt. 0)call printerror(status) end C ************************************************************************* subroutine readtable C Read and print data values from an ASCII or binary table C This example reads and prints out all the data in the ASCII and C the binary tables that were previously created by WRITEASCII and C WRITEBINTABLE. Note that the exact same FITSIO routines are C used to read both types of tables. integer status,unit,readwrite,blocksize,hdutype,ntable integer felem,nelems,nullj,diameter,nfound,irow,colnum real nulle,density character filename*40,nullstr*1,name*8,ttype(3)*10 logical anynull C The STATUS parameter must always be initialized. status=0 C Get an unused Logical Unit Number to use to open the FITS file. call ftgiou(unit,status) C Open the FITS file previously created by WRITEIMAGE filename='ATESTFILEZ.FITS' readwrite=0 call ftopen(unit,filename,readwrite,blocksize,status) C Loop twice, first reading the ASCII table, then the binary table do ntable=2,3 C Move to the next extension call ftmahd(unit,ntable,hdutype,status) print *,' ' if (hdutype .eq. 1)then print *,'Reading ASCII table in HDU ',ntable else if (hdutype .eq. 2)then print *,'Reading binary table in HDU ',ntable end if C Read the TTYPEn keywords, which give the names of the columns call ftgkns(unit,'TTYPE',1,3,ttype,nfound,status) write(*,2000)ttype 2000 format(2x,"Row ",3a10) C Read the data, one row at a time, and print them out felem=1 nelems=1 nullstr=' ' nullj=0 nulle=0. do irow=1,6 C FTGCVS reads the NAMES from the first column of the table. colnum=1 call ftgcvs(unit,colnum,irow,felem,nelems,nullstr,name, & anynull,status) C FTGCVJ reads the DIAMETER values from the second column. colnum=2 call ftgcvj(unit,colnum,irow,felem,nelems,nullj,diameter, & anynull,status) C FTGCVE reads the DENSITY values from the third column. colnum=3 call ftgcve(unit,colnum,irow,felem,nelems,nulle,density, & anynull,status) write(*,2001)irow,name,diameter,density 2001 format(i5,a10,i10,f10.2) end do end do C The FITS file must always be closed before exiting the program. C Any unit numbers allocated with FTGIOU must be freed with FTFIOU. call ftclos(unit, status) call ftfiou(unit, status) C Check for any error, and if so print out error messages. C The PRINTERROR subroutine is listed near the end of this file. if (status .gt. 0)call printerror(status) end C ************************************************************************* subroutine printerror(status) C This subroutine prints out the descriptive text corresponding to the C error status value and prints out the contents of the internal C error message stack generated by FITSIO whenever an error occurs. integer status character errtext*30,errmessage*80 C Check if status is OK (no error); if so, simply return if (status .le. 0)return C The FTGERR subroutine returns a descriptive 30-character text string that C corresponds to the integer error status number. A complete list of all C the error numbers can be found in the back of the FITSIO User's Guide. call ftgerr(status,errtext) print *,'FITSIO Error Status =',status,': ',errtext C FITSIO usually generates an internal stack of error messages whenever C an error occurs. These messages provide much more information on the C cause of the problem than can be provided by the single integer error C status value. The FTGMSG subroutine retrieves the oldest message from C the stack and shifts any remaining messages on the stack down one C position. FTGMSG is called repeatedly until a blank message is C returned, which indicates that the stack is empty. Each error message C may be up to 80 characters in length. Another subroutine, called C FTCMSG, is available to simply clear the whole error message stack in C cases where one is not interested in the contents. call ftgmsg(errmessage) do while (errmessage .ne. ' ') print *,errmessage call ftgmsg(errmessage) end do end C ************************************************************************* subroutine deletefile(filename,status) C A simple little routine to delete a FITS file integer status,unit,blocksize character*(*) filename C Simply return if status is greater than zero if (status .gt. 0)return C Get an unused Logical Unit Number to use to open the FITS file call ftgiou(unit,status) C Try to open the file, to see if it exists call ftopen(unit,filename,1,blocksize,status) if (status .eq. 0)then C file was opened; so now delete it call ftdelt(unit,status) else if (status .eq. 103)then C file doesn't exist, so just reset status to zero and clear errors status=0 call ftcmsg else C there was some other error opening the file; delete the file anyway status=0 call ftcmsg call ftdelt(unit,status) end if C Free the unit number for later reuse call ftfiou(unit, status) end cfitsio-3.47/docs/0000755000225700000360000000000013464573715013344 5ustar cagordonlheacfitsio-3.47/docs/cfitsio.pdf0000644000225700000360000376556613464573431015526 0ustar cagordonlhea%PDF-1.4 %Çì¢ 134 0 obj <> stream xœuTÁ’5 ½ÏWô wm$K¶¬c€$@U .‡°»YRÅB¿çÉž™í%Iuõ´Æ–ä§§'¿](óBñœ¾Ww‡/ž³´åöÝ–ÛÃÛíåô¹º[¾<[ŠfëÆËñÕa3¼(÷¥’f.ËñîðKújÝ8Ki&éÉŠS:méÛuØX<®[ÉżYú ûÚ™ÕwûßÃ2αø"\k§jé]˜â¢’nÖ iÄ-ý¶ssOŸ…GëD5œÅ zz¾rÖfµŸÃXzI¯Â¶Òºë§Òí—ÿ8©Õ–®OªH 1ˆO£d×VZúg¸–0_O@Lš®ïWw0~=~w"–-®ÄÖžU¼/[­™Ìm9^ƒÔGƒTwc€ü˜ Ò(—â$±\j®Z$½sYñÄa%w®$QgªÒ:ª'j.éå R‰[Ô…ínX…µš‹ó>Õ›8Ö3š‰¶–ì¼^˜¢­HM…cφ˜'« ú‡œoäâg ¥Xº‹DUw0ÞÏ`Ô±;åuD4#4ñ{óT›4ýÎ  J›¢ó$Ë&œË¤oVÜ*ÿH4P«‡fÅâ8I?À‚­utu;L¦Î{‡YÐ}Mçï fSÝû?D"ð… (D½ßªg%ÒYÅÏkç\ëè+eRÎcilY0zPù44°k®4d J@.j“Ëb¾÷Ôóâ “Æxg'‰.êθ+œopš{Çœ>úæ£Ë"tÐð·`¥d"kA³FnE3¨ C y4:5)vÓ}z_G‚#„ík[ëxËZ#É’˜Ýg–Š‘Yž®‚pæ2Ÿ—ëèk‘¢›@ÿ:ï^­£g"†Í:Uè½7H¯€ÖÔôûZb[ǰ €x¯ÿ Â1Š AìØ=‰å87€³ÏÁ~Xý÷€w³>HÕ-ý†ƒ|–æ’ýóÀÛIÏ.x¿žÈŒ%Âk§—'ƒJ£¥2/œâÅíû¨>7ÈÈ&÷$ç!{6b tˆi \ ×ï¿As+ Î’£‹ÅÓêÉ÷Ò{|<üˆç?‹Ùb‚endstream endobj 135 0 obj 798 endobj 146 0 obj <> stream xœ+T0Ð3T0A(œË¥dhl¦^Ìe ÎUÈe–V€Rɹ N! %&†@!=KKC…4.ˆfCs#3 =C#…\®hLM#Ž ñâr á B!X.endstream endobj 147 0 obj 94 endobj 151 0 obj <> stream xœíZ[SÛF~wû#ô¨íŒTí]ûHîí$mZÜô!鱉ñL! ÿ¾çœ½É²b0ÃX^íMú¾óËúcÑÔ¼hð/|NŽF?ÿÉ¥)f§£¦˜>Ž8Ý.ÂÇä¨x0¦.¶ª¶­åÅøÝÈæ……6¶v¦^—YÅk)ŒkËcÖÔŠ[.l¹`ÂÕZ*Y~b¼­“å>«`¶‘.ÞÊåÛ§¬µt0äŸñ¯¸ºV°¡Ú5ŽV·pÉ+ÆÏGãŸ^—œUN@ ü…U &”¸\³J6uÓ]NÏ&Lûæù1“ÐÈ9tÅ”áµ5ð@ãé§0WÛš°¶âݵ+¥t­TQqˆctY3[7Õ”;°®hë†ëòƒ}°J—s¸¿_ÞÁ=¥`}[þŽ»ṳ̀ð[Ü]?Ã4©ÿx<é`úJ7’ž.•ÿè´ _®íwõ›÷uBÐ4²pÎÁ•l¡ qÅ!UC¨K×.£.`@$nx¹Ë*Ü×å\ ÇšÖC:$M ¶$¼[êÖ!ÃFüåY±‹ý õKsbgÏÛOÌß³Àà™kµ(÷ -µï‡ºÖPÛ‡O±MC›õkPã;43¢:MOƒÒ{d.á ’ñØO¦@®nL„D*Qƒú ‚xC¦Ð'EØÂ°È̉ø:aÒ–ïѬM˜Šlþ ‚}L}šI3c j‰´¾;’($ú¢°Õ‡Í&!9Y[ÞUƒM¨ "Â,Ãú 2ž£ñ!¤ˆ/ZØ!€©²s¸£?àPÎq­»ú†ÿD¸% påz€%‘Êa%T©¨®²À ±îB6‡=DÈOöQö>R…i}¤Š±§’dØ/ÑœÁaö•əޢ{3ÏJÖ,xWèm4áмބUÆÍ=í$áÞM10Õ#¹>Àð´¥4ô%w@±•ë¡nQßÂ}óª!·µÖß‚¼S“³VúA(@x/­=%œ`Ù–‘+jÒÈèÀ·ÿ_Çl‘qÂá˜]ö²Ð¤öïcµqÑ ØIá aÔƒY„{uËD$ûœvF'Je£ƒ\vBÍ€¼%}K•.úÅ‹¢Î‘äÜAà¾o‚ÝšÚXwaéj¸È€0÷°&tê­Ÿ.±` ‚‰T½rd jÄ4SHbI˜!~‘ ¦¬ð°KìZ±\ÃL$1±r©ˆ]S/>Tó¢Ô–3CÀW¼´¹PžXJÏÒI.Bù ûs—×D·…ªhíu± • â­ËÖ’n"îKDð;æÎ.¨ÇS áÙ|J«Îû¾¢$Öl㢧ò÷ÃgµZàÜÌ> ç|?¢¦-b=,JkòP±æÕn“åì•Nk¢}èµ§5j5s"èû'¹)Rñ)3—T¶—–ÏÂ1ÞRs‚ÞчF½ä÷ð†&²Ý$Òଘ”—oÊ8„¶ô,uÆ)1–{Ãà1õÐÁì}E>gHßðŽ› ß.eH}—¨V3¤'ÌqTÄÅ.2&!Z꘳ÔmùÙ{æƒþÁøWÌ59Œš‡‘oc¸ŒÎVùšËctçðŸÊêP¾—ò{¥¡w?¿}W&5xy=±Îf¨‡…‡í½“Q Ú±wŒ‚Òû52ÿJM“Ó(R#‚‹¥s”^Í"b°¼üC 2qk2Æñx8ý¨St¢ÓnŒÕ…07tDwŽ¿¸Íà¢]^éÔm¨2×)Ô·– !ø"CK™ÐŠÅw2¡è¸ý¡¼Ê„4U—’œ•üæ ÙëÄÆØÔÊ(ùí'⸔`ù›IÂÁ¦ÁìÕÞu߈.ÚÕV‡Ð_Šñ×|®A=Óƒ•ƒÌèsT>þ€¿T3òendstream endobj 152 0 obj 1784 endobj 181 0 obj <> stream xœå[ËvEÝû+´œYhÒïé^‡á‘(°à°vâä„È@|=UÕÏyÙ’F¶%89±¤yt·æÞªºU]ú}Á¾`ø/¼ž½;¹÷”K³¸xÂ'¿Ÿp:½/gðÅáPã˜ã‹Õ«3_´ba¬j¸X¬ÞüT½©Eõg½ä?¯¾Ä{¬,ïQÌ4ÌÂm«s¸ôóz©Ƹ2Õ·õR6Îçªo`€U>ó°^Šx,^ò¬^Â8Lˆ0IwaKi]ÓšÅR²¦åÎùÉT­«†1°6&\Ãxõ‡~‡ÃÂT¼ú F­~…Kð+œÕŠ^?ÀiÙ¼²z‡^À(j ¯K© ^ÕÂ6ÎjQý Cã(?Y½„·ÂÐ׬.áÆu-ðîàI§UõG½ÔÕ{¸Ž[åhJé²i`ÑKÍ$Mo•)Žlzò`AФ±h]d¬5…“NÊJÀ£“µÆ–qŠ%wРÍ4˜ÀIF4Às‘kÏ<ÎluS¶¸uPO÷HH°å ˆ¨7Òœ¹žñ$è2ÀfÔ3´ä CF‹$KEo&ù ^âA)5Üe½3yXþ‘RÀãGÇÑ™|ô,žVà!lõCíX¢®ƒ.·ÐjvtP݉ѫŒÞeÈ $”þd0=\ÞxŸPã}@•ëi̤ÆÐÕÒ9tÕ9‚¬ÈQÀp>Ö¼ö7Àh)†Ë‰!׃YÙ]šðÃ>©^hÓ|ñ¾â-N}ÿqÕÒñ[ùéñ‚³šæ†¸õ'Dpx¿/VÚR5Rl ö>]߀~%#>€Ã+ƒ!¤¶ SzðÑHÉø#ÖøØ—ñA~4Â#ÀàyKdc®º_—d{Qƒcq#½bˆ¤b:†ô)ø•> ®‚h”Öõ7¢ŠzÈJ_\dZÞ{º¢q­½mÏ@À Ý´Î]é§o:’ ¬jÜ3 x&“`öôDKDá·>’qÝ‚ÿ‡ç/°á2Ã:éžEœA”f+§¥;ÛV§Éôg[/¤ò3?~|)®<.„,“úƒñFóFÈ ÞÜ5ÚH0ñ„ƒ™?¸¯£¯_G­¨¢¹g´`¢Ó@›d¼ìQQ¸ -ñä?ĘDôõ(.”ŸnH”4öÆLø¢ŽçAç†ÓÏãJ¼{!„W 8¯¦eCd`ø™ƒH¡—5%C@ÆO˜Õà#° HusœòÌ€„NïâQv£ƒŸm‚2Ó2;Ä™Ä>ÿ˜šò¨1±’ÃèCð8¦¢ð&"PFë Ò¡"Oô™0‚¨ „ý¥#‡æ$îDYZÏŠ{O¹V½*ƒj´³Tf†¦h¸S°½_øHøžaÀðÏ‘§©îðyƒÕê½ý–tƒ?¼®%¢¾$ÂðêWø÷E¶ù³ òZ‚¢zZc¥!Œû‘î{³~éEK”ÖŠI&/Âã»ñ‚Š’Ë6ÝЩ“M$Q½=l.ÁÃ÷Á£Iã—ÍÎ oþ˜l¡4<âÚÂPB€và·àøÓw߃9´¦1í~")Ú$u¼c»ðŽ‘ "3a@ŽlŠŠ¥‚‚‰®SPó°ö£ðÿ™c¼RˆëI!3)¾€XlCù¡ÜFÊù)ú®xRâë²Dâ ‹~’GøµS1Ñp>QL›¶)Ÿ ªé.U”ÜÎCÞ’³tå˜ÞÖï%•ôcí¸ÏŒSŸ¼úíÈÍó)JQ >(`ïJ=ËR=ƒ6N®€1ÕgF Üàãß–aÌcºë‚"ÏL¨[Žys_W¢eïÍ=È¿òÆÁ"’À¦xàoŸrY/ì@0ï1ËNáÂËŠù&î”…ÐÒdw‰»¢jFu€Î1á»$üSÖÛ)nJNùÁES”˜€§œAÑÂHq>‰ÈÞ¯ikÆðêQ<ôÊóeµý/ä[|%wbK–D,7~ˆ7”Í„ZÀ<ªi§7ÉF¶£Ã­ÕT¹ýZÕ†.`z¾¿w£§ ôÞ^=ñ¢T¢ú¾·-ã³ç™Û7N6mG n¤Â(#¡ØGK§œŸ~ŒØá¸Ä )|Ѥ³"Ánû#©ð63:Èÿš*¸‰,Q—Y"¸=Ø‚É|HC¢C²ò¸KžÁ’Óý&dŸ¢¶WÀî`Zg¶rÍÔX1¶«¶t}|ã£Æ>|É«Ç ôP&$=°Î#Šë|>6_”{äÝð1V%ŸŸìPD:ü&´jmçÄ0 ·\±$ÿ¦ \f\_Þ™ØB-\'¤_ôà¦}+îü¾ ,©ŠÜ“V–{±™X@™Êúýy yßÓÛ¹ížI„\ 7FŽ*þˆ·êá]”n|žÖŽ÷‰4¯ˆß×aå=ˆ+ü¢“;·}’l]!·¹yÚ²õÀ²}ë,§­TnrÀç»U°öM?zkmÉ÷ñ‚PWxojÔè`íZ™}TZÎâ®#0º,îö¾Ë‰(ºˆs˜â s6Û‡ðŽN_Çmðu,Ö`sœ$ó¹q!ô( öÅ/Cªê¶™âí°0ÄgÒÁrsµë?pÄM¹ŸWtLö/:dŸ}P±>J¶ŒŸãú`. &øÇ£–mV)®îƒÞˆª#ÛÂfŽ`²Ï‚A^6±‰KîàuvÞ¹KãCÀÛÐë˜C5näÏÁš»áà¡ávƒƒìX¶í (×|À q{ÐÏÅ=úc±švÿC‘w¤¡ñù°×©ï`êìdærF¸ºfsèÏÓufB¾u]¿ÈØè~çô;¦Øä¨Y/^”¼ªžÝÙaôˆ0;`èfºþ}d숿™êjSŒ7Sxɰ|oýD¨ù$ÃÔÛ7ª½F#¶^ÜmÑÍV4²Qc~[¹©k  ôc„ÓÚ*á\Ÿ‘¿IW¿¹¬sž7èkkÓÉv‡¾63ìk[ [paÚW§>£HVà«^ÎjŸ¬R:›¶3ßúõ)v*€’ šir6VÁÒ€ Ó3ÅÓÑ‘ÿ&jÒmg§zйdêA;Û>ð ž÷¿Í?¥Vk¶"ƒ5` æ8‹O[ ››iìµÅžuç'cIýšzоö¨û[0D㼬eL•.Ç~-ø¼.6,×19ü}Hhû\Ë›Õ%áºuÀº=ÌíD3øZ»¤1ûÌ#B:üpuò=üûy¦¦^endstream endobj 182 0 obj 2423 endobj 220 0 obj <> stream xœí[KsÓH¾§öGø($æý8 »<²Ä‡­=d“%¸*1–ðë·»gFYrbDZa‹"‘G£™±¾¯¿îéé|±šþ‹¿Îv¼æÒŒN.vØèdçÓ§Û£øëèlôhŒ]œ„¦Ú3ÏGãw;áa>²bdœª¹Ïvþ,~-+U¼Â/KQŒñb·¬Dûé ¬LÍgî¯ño8¬âù°ÊˆZ(y| £})+…Á¾•RºöbTIV[î}èbJ]Ô0¸‚®Løšñ°†Ð~VVçâÅG˜µ8…nÿ”ªø\Jø]IåŠç¸¶ ´_àÅgh†Ðôø;ì£`[ì…Û¢öÞ9C£œ—•.¡ &ÁgÎñX¦—Åë²bØŸ G·.Ã7¢}fÆo‹isdžÕ'kï|·J3Iv/U¯åýÖ8B$5¯…ô ¾;XS¼é¥,¼SQêH#­rUÒØZkd57L„Y ‰dOñ¶ô~ ØÈâüô€óWÈl­€M0+Ž'ÓÃÈE챚˜qpU6(_”íý¦IèE¼ŒØ_RÏÉúr|¿‡ÒºnÈïºét5h2•’@{7ª¸Ç¯ìÒW vÁñ+[FvGÜB+@f|­£2XÊ´$ÞKâ&±bšžÁ—£¬ÛÁ{“6XŒ(%¼KgW¤º`äŠß?…ïp²ãjasëX›˜¹vÔÓ~Ö\kÏH‰„çDðó#@îp_¼Ÿ•¨qÐzÍÿ˜qŽ6qùq2=ÁvIfs[vû…Ùm¬·éé–ÝQõŸ¢•¢&'ÑO<>§Àõ ®ˆäU âúß­wJ¸aÒ¤èøœ“K2Úƒ±ôÅ{e´7œãs|‚Ó5Uô ‹rÜJ,p¼J’Þe”Œ70ñE{AA€y†p‚1C,@ª1Ûøw)Uòä¼d!ISÈé;‘´m嬂jXî–ÃÄ…¹~_Á&ÝŒÞùVïˆ fÀ%n4nò ®©1D!xÒD‘{¨icô{1ΕƇæi KKδôþ<Äø´Myš&… K‹¥¿E(Њ¥ï‹å`?Å´)&Of7P2“*K<„+àÿHqÑò|ÕXwØZ~"!ƒ°1[KìœÌD'É„¸\÷$³åE˰´’%i¯™X ÀŸèÕHÅD­l®™³@§$Žña E ôã C.¸Àƒ’5ÑÂÿ¡ Ûܰ(Þ”IÑr˦žÚþˆâ »K ’çalò86±§ópØÀ ’ïÞ§ÒÖÁ5'‚—Îù_ư}'ò3{?ß…žÁGÄú ³§wMïF=Ý=!ô´öµâ¿…s>'"#ËeY œ†¶sÙâ~Â^O !Öˆ"t2Ùoÿ´ÉçšØ‚MÑî³€X¿‡G¡…sP šGÉ”ý B¡Bmµ°ÀqˆØìFÁw¹®‘ì^˜šk?ǡ˾CŸ‹hLVR0˜)?eˆ"¤¸ ²2O§vÒž™‚C¹"æ–ág³©æ{š?ˆtžý÷ü<‰yF²Pfé#Iúq›Í{[zL9zô€Z–iÚÞ*åY“|œíN{™ò04f’Œ¸YHNB```Nu·ùQñíûu™é|Ä·‡Y<á |ÇÂw%{-©\á`Fa7Ü,ïØ¿K ¶µ¸gÈñW ÿ8Äõö­Zügõ›‚¹æ˜Š¶ Íûý¸Ï¥´þv`· 0˜ïàõÍ¿P¸¶¼•Ç%¯/é½­ƒ¤¤7?^çrØm¶ŸÓ1®ë'ð즅ÓØxTIùœå$ðá\2<çøŽQ»ô Ø*ØîÕìýRfo[üßÀGÜÞáy“‘ÿçqÙ÷SŠÌ!wßðóÞ¶~žÛÏJ\Ç=û/MR-ûqôá(Ì:xþƒ”{Ë7ÿYÈp’‚r9¸+héŽé-!DöBÑûíáÎô59(a¥Ãê`îŒ$-Ö40ÿìák®©J/Eˆ2†tãQœ}š\S‡JÉBµ«ìC‹1¶N)š³<æ)ï8"¤rÈ,õ÷4V:dRß©_D=Ö¬­šÄ—O)›L¦‰ «‚¡MsÔ»ž}½PV AŸeý¨¼õC¨ç’<ïaÙßó”øR‚’í%Ïl‚¾ßl”­*Ì"¥æì`Å¥‚!͆@¹Ô‘>»¯çˆ çƒíëÏË&>,š%ì @‹ ó]Ÿ™éL FšbU‰°rÙâ¹M$À] ‚]JÔÍY¢±.àî°·þÇÇþ–i"üïæ–½av7–»!¢p0p/U†1wä¯%ÏÊÔ¦ÇM¹›ÓTéVLN©L-„ë/ÑQPqÜYN€\¨‘?¸‚ÏÓ¦#'A#æñ:§“nåknÒ×ãM@-š+IWðçÕ³‰Ú©~§¤IŒst íé¯N¾à’¨Þ¤‰qðHHï°\ Žúo¶„³k#>–iy}Qp">l0ó$ñ¹nð›B´„豩T›dtÈ‚ei3 ¶±.å6í…m ®«{Ä[ƈ޹ÉlaL— r££Ê…ÜÁç¸Sº Ú5º£ßTž•CÅ5Q> stream xœí[ÉrÛF½«ò<À˜}&7;¶c'Þb1¹¤rP$YqE¢äxKþ>Ý= $@’HQ²Ê%f¼^^/ü0ij6ið_ø<<Û{ð– =9ù¸×LNö>ì1º< ‡g“GS"œª]ãØdúnÏOfÃ'ÚÊšñÉôlï÷âKY±â}Éÿ˜þ„s¬ÈçÈF×…iÓ#úCYɺi˜ÔÅë²µsÚ¹âUÉ‹i{åIYñx.Ù/+X§áñ&ÝUBËZÛI%šÚ0çüÍX©ŠþjXЧÏJk‹ ºÃ9œþTŠâ¸”ÅG¸›téNÿ _ÜÒhõ&ÂÐJp Cxñ¬dði¥£ûÿÞÀ‹'÷q¤¬5´Ø gÁ9¡èÜÓ’ã@«{' xT¦‹ïpÒ)ìòSig‡°Yü ›Ž3qÿfr OZ©Æ? Jÿ‘é?\:nÜ"ˆ’Ð nÌEèÇßK K"v¦T¸f­˜«ÅR¤Åu! ³P0Yñ^8öø8€.{÷iÌ?ð t\ø ÇÂ&s,%ŽF1ТøUç†Yø®xZvv„3h9P-Ð1Áq!ÿxÚÁ–…¾fÜÖ½Hø Ð9s|×ßFðÃ|>Œ¼Ü8ò'08Cz‡¶Š§Y4aô`ÎHXnFg¯¶I„b5Èe¿D\þaýÕʯ6.¤™çà©l;9Ís#@7RFÐoÖfï¦áw=†‰îëmZ}ºt–o‚ß8Zj±¾Èâ{=ï¶¿AÀü±¸U5[ªìàá•@ÒhŠGÁã~Dêˆ`IC`=ìÑ:GfžF²Æ&M†×"or;ð~o«Þ;Ùp»®S腸ĀîËV^#›þÜ‚Œºzت·KvN0@¹ Ù‹\(ðÜW\/X’žÈÍéF¨Å.É­G'pžáƒÉHþ‰÷Ã>iÇ¿!jꥑ¥è–*‹²Ã×Úék£ ¤Í’×á­ÂkdOø?¯ÿ~˜«óiiEkJ ½‹VNªÞ Àªä¯ðG{|F”hÔ!DwÑvYÿ0ˆdu’,¼J$ÎüZ½õ{ëZsN~iJ¹×ÃåÖÆ^eDoN¶Ÿ7bÝâÿm~ B€üwõý"E[‹QuNóÏ£>{3€i‰Ì `TŽ£ÈõöÉC˜ÏšÙÄÍëȉŽûÞšŸë?lg@óM‹ü3øúÞò¯µ#‡ÿ…hyþþ;ÐIÏã. âpN®¶¸·ÃC¯öÚÖܬ-—=Üf˜íÙ1¿-õ¡çÞ9€VA×¼Koú–ÄjSâDm:do¬@¤D_XiÀ ¸qö?2²ð1!Å ˜¾!¡űAÌ;ãdb&WPºûvEc ¶Â®m+üqˆïyëê¾,: Ï?ËÉÙb¦þgœ‹HSÜþµäΧa“¬ôfõ‡e¥K Õ•\°ˆfÔ5ƒOHrU„l7 Rˆö5`…Œ õ·Øy)È0"ØR.dbvh0v]×Xª;¥û7HŸ  k¦Vé>KÇ3 -ûcÀ93ü ö2 u4mRõY‰©Tõ„.Žƒ°]ZU7œÝ3‚±îÁÀ £3A2O „%–Z€TéØ? :ûÉÇÿF¿,E›0üñ†#iTLÞóÀ 7ÓCsÄS`§rÐE úo¥k:!@ðØBy»¾@ Dÿ=‹íÿ7˜Ì[’ž¿‡{ÑI€Tj9…ÈáÖYÖç­¡à²ÅzØÕ?„sý„©2²Ç†ßë÷ÖôÛöé÷J‡®º½S¥Cô×GmŽ5eþæºTr¥ÈÑûy\b‘¬)}ÁP$Š€U;Xw,Ó×F×ÎÌ{–ÆqR)¨·È®# á6kh¿n%!2ô¼²s> 7GFŸ "„‚<)¨PŒØx\åŽå‘n àn<জ©~–êusŸ¤äªël7 \+µ#”¤zþ·n÷c†G‹±b‘WyyŸò{«9Ž}M"ð¤v³¼Ö0?i r‘æQ–WP TY3|ÏC’0…÷Ëò`".›ˆù„-³9f¨/këùÕ†óÞ2%»¼’û6ÑÔB9ÅBPfGÚàÕ)ÛÊ©/‡`¬¸8=ðS¶Žh¤ÏÈmxzì> stream xœÝWÉr7½³òs3 ±­X.;›m‰9¥r`,šfUHÉ–¼~½û5f“-*dÅQÙ)Öp0Xzý^?ô¼ªÚÆT-~ÝýùfvïÄP¨V—³¶ZÍ^ÍŒ WÝíù¦:šcJ"îjr›M51+‹Mm’kŒ­æ›ÙêG];õ¿i«æhëÚŽO§ºMÛš6ý9ÿ f™šu>4Ö±åù[{«kÓmPk^ÏÖÔŽr“mUSÛD“s™j´W–¯†'’®=9^Õ}~|Íåo¡)5­q¤>°eu©kâö9/{ÁM"óê¡&yÝ{LYj§ÎØeUsï/Ø z¶èYñ²+MØŒQ/y½gÛm’Žò^˜Û–[‹…K$Xú)D¾É™Ô‘º»Ýùÿ#‰šœ¼•‘¿0åo]@Ê!u K亨Øò×ÇÊÀš.„Ù X" ÿ%¢ùÄÈ8¦‚q˜„{!çDíC§¾Ñ<=ÐHá@n¢ß‘Ö_yWçjÁ»iµ ™ß"ó¹0“Ì'Ô‘ŠÍ'ÀøâJȰÑ@ÊpR¬?²áõvÅ&É|õàóÚ¤~Q o¢±‰i!Õ‡s¹1¡ß³Ñ=ÊahEi±û78¼/Û¤/ØK{Íu¡bo§9S>ˆœyQ !?+¨J'ï– g>{ò+O\= Î ÏÉ£„pê?.¦•̬/Z'öîñ ÛLƒdÍwIÖƒH Uå„Ô‡’5ö2ÕYÚ´‘–zùbÄñª«@E¡Ðø8‚tý‰âÇõú¤ŸÈ@ ÕK¥ºžˆîsÑÿ¿—&w«Vé0µºÏèIq!Y͇ÿÙ‡û{““Óš„B"¡Ë‰vÒõ¦HÚvY¾en•§8´h*Ou7_<²-•eGìQ,Ôzª)¢ÊIJô°WÅ^D—¥t‘¢¤–øŒêã6¥ï‡íºø —·—}Q²Ÿ³y§³CøXC(Mh²:Ö] çh>î¾H)d]N½W½:ßdWÒziŒVâ,æÎy(úQÀeßã -?ÝÂñ|öŒŸÚd'Àendstream endobj 293 0 obj 1039 endobj 307 0 obj <> stream xœM±Â0 Dw…ÇdH°“(4+¨ ð†˜Š¨:d¨ø~’ÒdY'Ýݳg$ËHuV2l.ì#Ž/ a^b\eȸ“Z \,›(1ʾ0ãÖaì‚e‡’á¦ÞÚ°š´k{—Ce;ÿÏŠ–º‚Ë£ {m‚%âÕIoSŠ)©cáå—ôÚ¸æµÊU›r‡Üò¤8—ù…-öendstream endobj 308 0 obj 152 endobj 312 0 obj <> stream xœµ[[o·~‚þ¡/ÝSølx_²o±§.ÒU´@܇X’­4–å›’8¿¾sáÃ={%@a8>ç,w8œùøÍ…ÌÛS3ÛSƒê¿ç×'Ÿ~m}:}ùþÄœ¾[÷Ÿ³¿Êôa^òbqúçàK>=ûòäìßLOàÅÙæÅ¤éõΕ9ºìi—‹G±f.6•2Ý€yN.¸éô ÙÚP¦[úhRLÓ9¼ä£÷®¿þ*²1^‡vI¶À<òNWІهäPÁäñ©-‹K°ašwnŽÖúBKŒ&Ì&LŸþÙÌ1Oq%¥,¬æŒ`;P_2ec¹çÏÓ 4VBe§¿ã³3.Æé‡‡±ÉG5´J² <őكD¨ujä°ªVO±®*XÂ\L!³ûqUàð0=Þy´¿›ÎðÛÓÝ>ñWPÊ…kA ºé=|¯“ð$Ϭq ‹€ïìîÓ\rtDo¼†0Þ—»0íw¾ý ΃ÿீ(_P”§¯ãCÀ-ygÂì€Cë§W å<ÇQ`™HóÓ‡8*Ž7ðÛ V¹0„"ýv‹o}ØyTÌv}p6\aJ´,ô ¸aÙ. "Žå\îи.ÃV¸Î.`ó zéÓKœ>Ϩ>>”¥‘é ºjªÚ@« >Z^Ùp'¬:ftކ…ô¸h?¢èþ·uN€Â'mZ X'{ÏFŒŠx iÔÅ\µw/ù1Ž~LVó>t¸T‘4ó²Ðfß‹eöÖ’c=›¶ªÎô º{’Ý{‡ˆ<Åus®òå.Ò t<Ûeψk PˆÃU¸ÐÉ‹#!©šƒ°þµx –\Ò°*^#u°Iží@˜­àd£7ÝH'´àn¢1¼5ƒù|æu~@Ñ`Á`YŠ·¡n·HÖQJÞÐS˜€€X€‰³àð² ¸à!$ÿk"ÐdœªDÈcÔ;V^t%«â‚Çêô:«ïD²znõT¼ö¹FÉU©¬añca9üàÙ» `RÉÈ~uÚ{7]Ö·ô6†ÖkÔôVlôŠ€åm†},ÀzÜØáIâH¨X¥Ï{Ã)£…£`}²$bõdWq$8Éx:<°<5½šÌ1œêBN!_U¹>'²"ßeŠ&¿HÌò…1Q]í‹¡w>ƒ¯_Áß§—žpÔGo=BṺ¥Ç¿2È›ßn”´4¿]¨ ÅRX–‰kT5 :Àgޝ?î\fd4Œv¾ºe†Ù)÷Q°Œ;¾8 :Š€êæ/¿Y9t²¬ R)@@Ê:âÞB žø€Vq¨e[AÑ?ÑN‡Ô÷0¢’ë ï¼3ºar‡þ½‹ÑÐ Ùë°¾)§Hfhá•ÑG«¹ŒÐ†/½¢¿{ÏqŒF¾B˜yŽ••/<æ(0†r2üí½ÄF@c,p=Øôµ„`Ø‘’XšFùv!³&-MÃ`•a‰§ñX …,Wìˆyd4È“:D[üüþX|¢)šª­CÆ(›-í§G•Ó AΛœ¶•{ç ÇdÊÛîÏxÉ1´Î=‘ÂõzKÀ0.Þ$fßL¸<%×VÓh‡Ú˜ï)•jjª_ÉV<&cš?¹²QÛóž4UcĨû?"ï­C.ýw+…cyµû a©Í÷IÅn=ð‘$|žÀ{4 þº¸ô‹éY HnÀgð0¤²3‰¨ï*¬Òì6R0Î26ò–hïUÈbsÔ áN±y'ÞnÄh€ª]je…!\âbGÂÚp° '$Iy"J­ÞŒ0£Lˉ㩒[z© âmåõõ®wÓƒ¾ß[Ú…NÃEܶÚò €Ž*1& Ú£uàÐû¤§©â…W‘Xm,wxT/Tú›É¿Dµ?ïÈ…:ƒC"üÐõ ï¤‡»p$É3¢Ú‘hÅZÔRÞè*ùaÞR5O”ȪŒ™Bt–J£° £@×…a]ÔHE4Ûßv˜-á6Ó}_>G–t´â_$üPè=bó+Ý„ÀP+MãÄ/ž@ú7†°tÏöwC8D¢[í üP«)kñ›¹ªÃ!äR«V, 3ç–ª÷Ø~=„JìºTUt ÙCË+>é…ØÂ²H ?/kÁj5w`ê¢êVŒqì•Ô”¼*Éï E0Wn3® «F€ iÏÙ®œ‘…V [×Ì3D‰1ë ¿º°£Ì;«Þ—™±%q’‡*!› Ogsߨ¦“ÒÆ@pÞ´$’k$Ÿ1ýkUäUÖ¨}l5 ¦†rˆ££B÷&ÐW໨*›¸éIi/};%Feï>¤öûZLYw«ž”òdØbkÚI†çVE{‡]•`àÚz «ŒÑ’Ô×ÕÞ™HŒ2xñÊEg!é‘€’è¼ÊÓ½ZkClPëÿÏ9~Mí½*Î+ènO0£l&ÚëÜ^woH³(aØ{οîHÏ…íÈ!'ÚÙÃ=;Ð~ɤŒê9êgŽ ‡M½ï„ƒƒ3º:&!µ¶ ØÀ·¡­¶#@%. £Nê;_¶v£Ð…0É«ºÛW™Á>Ô^^ï"àˆÍ*Bx:—Íε°½uzgQ(/­?TŸqNƒÊºQsÚ€˜âfµC”9úÂVÁE…­!÷îÕ /mdpôéMoñ+c«jJíÇCà«7ceÖöêZl]Ç D¿ê+p²Áˆ½ä–…L|Hì®+¿U6·]ªrÞP>ƒï÷Ø€é‹s´Ûÿ¹ÛàiÆÃ)Ï6ÁÓ*Ó{&â/†î 4ŸÖlù{^!ÖʇÝ?O‰]8Zï’i6Å~ÒŒÎчg$ƒ½–‘ºÜ½ò¶ÀÈêüöý¸ý±::V égSw£‰£RNü1ôŒ©ñk߽Řs+Ðk•ÎçîSmö^s%@`%O.¾?+EÇHñ(IŸŠÁ»KÙjæ9®¡ yÛì^×;¦$È~5%‘‹îwzÕ!C*ý–f²X`¤°M2†ÔøªÓšdXËàšNÔì×WŽŽ‹ØEà3Ë5É)Û'`-ÛM“1kŒìåã‘û¨³Ü2lLÖƒ¿ßEª~‡"G%ZP9iÍ'çÅ7üt‰ô.¡ó^’Þón:?§\ê²Öý7ŒiI±êÒ]ͤ†³ç¸m}€Qçxô_“ª’}Õ9Àbùë¦Å#œŠYŠm¡ÛžWw‰¸:´ÏU?æÅ"û—’S|…TǤÐì*c¶F[TyW|¾TƒgÝ+?"z ø´Iè¿Z ª0ÜèÊ7Î=H¤?“3©sÌâ‘{Ûž©ŽM±ž/੦Õtúެo'Þ_5í#(«k®íz‡x;Ö!e#/fúj×}ïÄëõì¤ôˆÉ·U­ùÔ”Ät<¢ŸëI´Ú<¡•‚Ä\º×QâN×”²u‰Ü‘\æÔ:uÉvu¾Mvʪ`‡ê¨ûL'×~¨¨†JLn?ð†WÞ­šÕT¹qK³Kúiè-l‚xݹ‹µ!Ikw¸s‘mO‘[e†»¦žî‰Ù{Pm§£Â¥§ÌcõÕHYš ¬zX§cóFTëû.É#tˆoCpÂZ™?ã ï‘(¢=îÕ Ç«\îsGÀÏKOµu·Y.®BõF.F7mèøs¸Ïá:ëT7~VÄs25Ýu1¦8"w‘µê}׎½ ´#Ž «M6Ĉ¸ƒ0é +õKͤ¹wó¿ªeó½*¡·…ÞÖ>W|Ö´*ô Ö­JùùVõµçøÊÉ¢;bÛÜ,¤š\íÂFÅîü–V«4Ç grÁ©öf#–vßDµúT£ÜX1:±TLT»Â#VýÑà*¨Ö Q$öÎÕf‘¢)Ðõú¢WM•Ò\ëd¶è8œüW"ò½Gáß,2kX âh,a cÇ…¡^#¬5VC¤Æ°Ù0Ú8×EÚ/¶_éX!\§:ž+¦¤rE¼q¹5RTÄÒ§V*¸ ½†ºü§­²´þ‰Y®Ê(’ÿç#ç®ØMJ…ºÝ:³i5³ÒÇxŠæØW[H¥gVHþJYÕ»?æS¼Lé;)ŒuÄ?ØõþÊâVW]†a*c'¥ºëß;>¥Á¿ŸÂxJMi“Sèë#jØ '{Èô)ûÿoc=´óy½Y²JVV8psÏ·†°Ø Úõú+EÑöàêiÚî×3• Mɱä[Q% x>rK¼`ëT^¹ê×GÎ\ic*dþÿ%Ÿz éx/~ä#ZõÈG:9¹BÔÓj¹,‹×R·]n©øG.|º7ãuië\Ç!C½6dX‡³ö¶F$IæÏ'&­¢Ñ"O[·ÓWË£kZÆBu=\ÙjUí6 D¦í vÇe¿§®Ö«›ë{º ‹Ýººî@¢u˜4S6ï:ºU*#oûêû9~̋ãTºpÎcH‹sêu¹Úž<]2e°ñÌݤºžwøìRY¨öAð\Wâ´6…*,ffðt§, ]…¢Úä€ÑÞ1Á©[ò—R,ýéë.û‚Ïð޾ÖIà9Ý£R¤Ë¿†Ç6å°¤.·‹ >ûz/ßfm‘.û>÷òÇNL=Pz“Ý%·»\²«Ó¼õÑ8ß÷ë;ñzcÑ$°Ùî8Qt~8ük§*!¨1ÔÕ´v;í ãJ—jR£ªeNWGˆú8~ Œûúî*ñÎUï3 µa=ïj× VGw]â«¿é#t䌎šaÉE`†Zï¸ÑQûŽík/IZcüÐåÂ¥ÿÚÆÎó]»BØúö¡óGÂÖco&¼YѸí%iôõbs§èæ±7rnÆ -ãý‰éÎsã*¼|‹C–ûŸŸüþürýj®endstream endobj 313 0 obj 3916 endobj 317 0 obj <> stream xœå\ÙnÇ}W„|ß|'ðMo³øÍ‹Ûð›FÄB“%ˆ›­Å–¿>]kWOÏ%©$o†!Jœé饺úTÕ©jÿ|4ôîh€ÿøïÓ˾sa<:ù`8:ð󇝸¯ÓË£Ž¡ItùQ¿ ‹;:~ú€>vG“?çØ;t|ùàŸ;ߥÍç`›ûeéǘ¿8>Ë­>îöq÷Yçúe™ã²û°ó»o»½ßççý0¸8îÃïßuû\~2í\—v}·Ÿ¦9vŸÃë¯;ü$ä'ã²äÖÁC[¿û¦ôóI'ÿú!·þ¸´6cagß”W¹_ZDp‹]ÄÞ§ÐÏGû0ô“[Z˳üÝî•þ¸nr·n÷üúH`»'ðã~¼”Qã_à×SøÑÃó<#Î?éæüä&‚ž™q®»©_æ4„Ý}ý¨¼~ªŸc?St¸`zö²4|®¯õ!HÓ…>CV“/ÿåŸØ_‘ KÇd‰]¨ÄÎUl(¢·võüåù?KHZ‰Ø®õÙ›Òð‘ŠíåÆÂØ^©Ø~Ýð}øD>ÚÚúç:àâoû9­¶¤9Ôû˜ú9, â.+:ê7ΫÎOx AòÀŸ»½Û½îöcžpÄä …<¾Ï#'õHO߇oÆÝOðÚÃL†UoÁó kOØ ¨Â‚Ÿã#èÏvÁ/Â?s ^ ‚à<ÎókøÃó‘w¹lÜåÏ}ÊŸÓ´q–ÏàljÌù4?†W—fC"KÀÅPºƒý↱,à"¯þ¤Ùú9ôã,€×ÌÁÅòìGIè³g$Ø,¢€ký¸ Õ§Ø&„H¸eð{’®÷Šh~^ò»Ëo`§]³ÍËîE—-K “ìP>ð J>Ï~›&ÚÕ×Ú¬ôŒöbY<ìnX` (Wš)ˆaÏrØçãA³PØ5‹u„ï*s˜P³`ÛA&!é¯"Ž€G €#ÒÓ/ËŽÏ›œµì³ÎëÆÜÐ÷ðøÞd£&/òÛèq;A:ßnŠÌ¢X°Ç¥Ÿ;3¦‘ ßÌËÆáûƒ—Ó®F[­dûÒð§ +tµÕãÓ ”¼¶ó‘‡ÚOY̳ÒðÉFCÝ…»1tœG;‰ÚŠ ™ÇŠ l~ _IMHÞãcÄ£ÿ׬ë7ŸÓÁéÅH° ‹}àÃKÒTñ˜¼œ$£È¬å1-8Å0x~&¸ŽO±‹€/àµ-ßB‡cp×Åïóv3i”hI§G úª‹ÐŒLœÀçt0àÉÅÅá'gŠEŠ8ÐEÌÓH΋E’|§/Î ¬=Gû&/²ÎF˜ïžÒ6ä.LWÏÌÀy `5~s6Ë(e¯ôeÌ%7EÔ”õl¦$°©6 €¶Þ¥bxQz¯Å‚½b¥‘Í"ÌZ‚¬*¤„ *&$"h2:¢o¦VøÒrÂÅ8£€Bÿ °I3Ä~‰yˆÜ÷1™ÉTZ¨"CJh tKŒ÷dgc·T;3‚ÑÀ{c—È~¡m^0`QÛœ¿ íüT÷åó²(|·ÓcQm¦ÉY Ìç,-ÿàtá 39o¬-†VäLàŒÑ…½ÁªO³Í$`N0‘ˆnÁ½­L4‰c¯:H¥QŽèD¾_ùqàZ $‚RŒÁzoYô:è?/4âÑq"¦°i› U›Bêè¦àƒ-+P9Ъ(úzÓÞ´_/7::ÝúæÊªçFï塱­çh¬ü´l†›V&+L?«lr_£(jܳ+Ù.OÛsb<êr\`^Ë–&ðzàqÇ0³Oº |è²F´V­KjNŒàiñNT”, zR¬òâ½üpˆj@`ÙÆàY zAä¤Ü£ÏZ½Ò-—ò„ÝÛŸ@ÉU© ½ƒè­¬t7 (5µ K/WbþW`Šàr<è¨Ý¢Æy Hžp|h<Ÿ$äõÜ»#ÙŽ3Fؼ¥^í7x^3¡°*Ý¥u²4˜ÍÒ hþ/(YyóqSÕ°‘ø;X­üéb Iš‹É­ÍøPiõ5¢Þ¨¼î(²HpÊ]åÑObT×ê¬öüÖ!6¿"×,Ïp¨|Lϱ”QÞSöÛ 5ZÆ™"sfE~ó:—ï$òkœÊ!Z¢Y&u[Ð)³5kEµ™²gU• 0MŽ ˆ¯™jÓÐxtñÇÛaJ=\é‘A`ô÷Œ-<ݽ[z¿vó!xŸ‰¨€ ùL×QáˆÁ=€¿ø×¸q×LäÏÅ ®Qb`fxKhpVLö¿Ù¹~‹m¬¬@”7J‚Xµi·¬!1ÏÁøäggÝE¥5ThíäúÇ^ Û[Xæjke¡s-™Tôõ„< ?/0wž…H·ÞU\Íåß•!ƒŒ`qà@ƒ¦þZõ¬Ž èè,7_„_®*É>,³FuV­Ã.ÚíUìï.)MÉ~UxSìz˜‘¶‹^CÅõ1æŽÅ6TÎãa#A‡Ð3`Tº±ñØx¼&9©úÐYÞK¥ÀhZ•²v\-GÊ[æg1ΑÕÌåí 5òϱ,PÀÀÿûs‰&” G)‚É ¦¢v@GÀ›;|'1å·€øù+g# !HóxåµK„ZsZ¢pÒ/Vël©PÀÏtA8àr¤E5ª™Ii1‚Tž@$ÿ¶´o zÚ¶è²»‘iã¶„…ü-ãN\w7ŒqH`®Eª+öL:4‘ÁUsow”Ì8à2„_Uî)»Dc?ªpß– ·[w–XŸ×¼Vp}þÞ ã˦®õŸ¯U¾¿V½ãeOÓmíÀdÝö -Ïøß²Îü†}!Zvt5¨ ÉZ¦wËÌ þÀ†¯rÕŸ˜ÌÌÉm$84Íë|û$“´•o¿ÞÐņ|™i Ó‘‹}Ö$_çsâ`ò9.»i 3Gƒ}r.,»Üù©cð²åtsJÀh0Å8ôó¼g¢0;©ƒåƒŸ# ˆ/òa‚ìðõ:Ã!õ`A³q:+ßœÓðùÈ]æoÜ8Gll¹Ó”ÇtLµ 1̸“CŸmÃÒ&£˜ÉaQ ÕgÔ,øO–Ôz£±«øvH¶ysÔ¸¢k1o0ð*·+1![‰ ·`ܺÌTÐ3™_üëà#ä%`z)î¥R'ë ÖfK¢Mî‹K0”L|Ÿ£Q…+ß`T›9Rœ!†{.)®ùvVI~µô’ì<…96ð‡2W«¡Øwp10„µ>µ‰7²*ê’ì;s’ö²Â–{]‰„1¡Ÿª׳œ®ÕüÁ1 þ±<áíføI¬&û+ùSjaìß×ZÑÌtQsIMQ¹É[˜³a«¦€§ZTEgyÁñÃbS¢g¥²ÄÕyÅÎ(‘gƒ"ÙB8<6.XE`PÒ¬zϬg]Bbô§6ÖEiêZþ(ŒÆ–{E?J[<>‡KI†ª«§zQ¨Sò÷Ô½§j"øâÚç< hQ ÅQ8¯UxôP²©¬~Ažqûn!B”qµ…O^€+¼âq‹s èÁ®1‹É³d»xXÍûKPå§É„ã×BÍL†üœdÊJ©¯j¬ æÃ¥tT¸šËg¶V ë“õ™zr¡ÔÒÿnU®…ƒ¾¿Ð"5ýI†_¸ôj2¹1Q¾*ùOã‡Ý;éB#„:/ÁºL 3|dÇ„ÊѾ(qðë-p-]dãï±”`Ü}T+®ñ…êþ¡È] þ…“ ˜Š£"l„…ôr$×¥Y(§úXa 9½¯yKÅÀÃH“oiÿ4ë. /?RÀóEÙ\A@CÍS ›²»sŽ˜p©bµ-÷+‡TÃöç0mÀi¢Ü†%ò´´ï†Ò|y¢Ã¡ÄE»TÃE‡ÎÙë+༷æC0tàãõ($IJ8ÎÙ–ÚpØãIßžÔ;+<åp{2k$÷… J!FGSE„5§) »Íü6‰ÎŠ0ü¶H¤6þ‘GFk§jƒ‹š(¯4Rpç;¨÷»ÿ&Jr Åògš¬Iôy¶À'ÌxÞÿ?S'Ðì@¬Uôñ=øÔcÄ®øØx•…ö\«²Á™bZ¡ùspÙ‡,?ÃúŠº/®ÑKÊ™@°°XÈ«a¤h¤po´&Ñ¢Ü>:µJSàà|ÎÐÍrßDH–´E<~Yõ&^BËì4ƒPW¤‘)ÙZ1A¼øÇ®™Á¶9ê) Pe_k³}m<€Ut³bX iCm{¥î×±@ô—ULôÛ3¨õ„°q MYsÑ©²±Î!Tð1I×–%…ˆ›) ¸R¹jÆ%u#Í{T³î‘—‰áÎ-(кœ“ÝóÎY~ZÑáGiiy–ìõÜÇÎù‘”V|š”»>åèjå«mTc ‰7;ÜÄûT ¤í"S™Õµá¹Éú°(PñB|6@íŠ,5¯:J„â(]Î’MÈ¡l&@šBåÆÀ¦’úi@ö¼äÒÌš¿í Ä;#>¨1©¶ÍÅã" Ü¢[\PòÁ™ÜÂq‡´9'.3ðÅ—Ö&7HfrT͉¹D1R²Sª"À{øÏÂ-sïÛJÏœ Q|k£Xýi ÔÐlÈB¼VóBÊc˜a<3>¦ÉK)’q—,áÙÜz)7”4™Ó¸¥„œ&ãîâéžT)»AJºYÕ<á‘Ù”Ãݪ–´®­(vÅL˜Â•y\å+ïçÈG)¡j˜æÈÁçœê’/!¼„¾ŠÁÖyà4Ðg÷+•Wpxp0³ªìee,·ëàC§$­©µf‰ùú޵š$|µ 5Ž …øÅw,h_!¯Ø¼¦~-»ç|OÕ~¦Þ&.”ö~'#Byã¼ü?i pŠV–L­WH›»ì®C\x€ZÙfî˜ðt³Ã5•÷¦41ú©-dU¼±D’¥‹Ûl(L·¡Ve?ñ¥¿Ï~V¹ª¥^âjkú%ú(ÔT¡_HZW«©W^%p0âþµ4Z}JRx=¥z>‡!ÿ3 }H.ö—0¡'”W+øI…e¶œ§Oåt#7¼™O~YFÁ$9‘Ê”::wy¹6YaÉ0·æx6'3¯€´NÅKùƒ·U%¦òWäÕ®*Z¥j÷¦8ô‚³*™Þ% |hi;®5X¥^3§%)0×ßD×ÚØTÝÊm/¬ªà¿Ž+år×<-¥8üÖÊ÷Xx›0Iî¥õØk=2±c[„ീWfb xÿÊ›¬#$o€ë½.aÃq7‡âlüIIFˆf²)ìEyLQ·¡¸„š*U(®¬Vé*aLYÍUýÿ#”ë¨E[Þï¸ö{ܪˆc!Ì›¬Ãé)çPVºy¬ÌA(õnº–U¤Pé”YÏç]s}Ix8\ÇQ£àìTßÔUDUT'mÊC¹Ûn«NVq¢ÊíÈ3ÐÀ ÆLY…ÐÀÝ€…@šp‡Yi`È’!Ž[!š/)/5`¬Òïp·d–ºSn´Œ*ˆ¹~î%UûAS±=3Ýd§FsMì‚ÕbñÅ€«ó'’rñ¾—îÜöõ ¢y¤J7Ø­¡³ViøªxŽ".ãa¸õê-ÚÜ#þø$®¾€m!ÓVmj0Q¹*¸!»äï¿ÊÃPãÇjÛ¶øIuµíÍc)$¥°•®}ÖÅ#ÈAÄUè¶y‰(UÙ:Ý3ã¡@ð^ÊÝï‘!‚˜܉MÚ"tLÈãù^•bÐJk ²S¹ÑsÁ2h.½¡„.á6Xê«ì1ºJ®&K.°77p0kꯡ1eaÎØÌo+~NrßøÄª9úêÇ_à¸Äc¨é×6«Ü¬~påÊ÷½îÙå¯,T i0–jÜŸV(iªBçPê6úÍL ¦B/ÿCŠ»bÀI>ÖjüžÍâ]{óÎVr¬Š%H%a‘ü-ÿ÷ÄàAendstream endobj 318 0 obj 5011 endobj 324 0 obj <> stream xœ­\YwÇγÂÐ[îäp/3Ý=[Þ6Çòäcg{Ðf €„q~}ºÖ®ê™+c'ÇÇHºÓÓ[UõÕÒ÷ÇÃv×¶ðÿ<sðà/]Ÿ¿;hŸüxÐáãCþqþæðèšL1´›Û¹;<ùá€^îÇp8LiׅÓ7ßtM¿Ù5añçvœæÝ< ›‡Mì7šmÚüþù2·øª S~Ö‡ÍwMÚ|ÑlÃæSøç“üד&nŽ›°›ç)¿œ?îà×4çå·èçY³þyò9Ì.uvvi»!Ïïä"Ï)ÏméÃmlwc7ÏôìmîaóS³í7—yÜm÷<ÿ¼Î³Ól#=~™gû:ÿ-ÞåOç1Ï!nnrãðü>ëp·ð÷;X4Æ~¡OüžíÚ¶k'êÿ~_rß¹Ÿök„d¡ðDF‡¹åa¡—_ƒ‰^å Ÿÿ;¿V-Éôd~5ïÂÔÛŽVyÕ„d¢£\7°waÌ{«z oµ¸ ?ä_¥aO£ÂÆÍY´³é÷é4·¸‡ÆÀÅœòü[Ú¾3xšßiS'c¦^¡e^YŸ?GÚ³ ÚÐ@Òù^€Ç¸0l6ï›>æži hu«ïÐlDÇÊ+¹×ÔÁ´Xœ<çÕ¥ügßT'Þ“mnÜm ­¹äE7qÌÛšPEbpy¸kx‚{üT8’I¡¾n"nj‡½€z±ÅÔãûpPDQ¥D„kóM~ç/ p0èˆ|ŸÛÞÏMº·¦ ‡ù6{¨=ÈÝ=‘á³ÇùÜÂþutxÿÑÀ`8ýJ¶0S˜IH8 .—kš‚PC^¿Nf>r§¢LïPýbÈã,ú—÷d80$‹ó9¬1˰ eÜÛ¢/EÒ¤çòZ‘;œìÐaEIøÈ ¡Ò\g^Řˆê×Ñá…­â¦q•1¦ÍS× œ–Ü]Vêg:>ùJŸ nÉ‚Q¹úy¢uŸÉÖ(ÂÀTÒ'¦èm#ê©àþ£„¯ÿÚN¨W"A|ôœ:PuèH` ê‰æ#ûéç3‘ ÀC+i|ØUZ¡ ôh`T&ùÃ4ÐhÐó ê·fò1Ehg‘î–ð )ˆþäþà4t³=œ¼¯1…UõÆCö¿H7&ÄÚ‘%ì(È•‡Œ9±‡ ¿M­ ©hõ©_®ËòÈi/qcÜH.1á¶ð9ð![³SQÐKBPg Ó„r½(† ¢a…(F+Ï)LÜÕ]æË}DÀUìŽ ¨Ó/ô%?×wЇ§ƒÐùBôL4«¥íø= †ôjØM“èÕ ­3k–Ú3éë²ZgçDÖ@éÞš¨=ÁÊ;g«ŠR"“P1iÃIÞ|ŠSgÐŽÎÅ4¹sQFSP6¤¥h¯3´-½„Ä I×…¼ÎS—ÀÏPtE²Û†~ƽsBe e28´ (Cјz„¡Ë¸$¼Stè‘f( ¾obPáà´¯‰|™AëLÔ ÿä¸tR Ž*tÄš}¾‚]9S¥dõšâNQë ÷<éëGØrQ‰gEؤÑ"Y6ìÒtGÒ8®aHTê²!æ#Ĭ(Á¹þf•w Yý%¶6ÁçS 愪f&d„}b›DÊ…›âÁìÑ„•·2‹y.]X]Ɇšl$ò%ðEdÿ¸ üÉ\ÈÑ ,åBƒ˜2¿)çN =ˆÞ|Κ‚î“·lH%÷Qý.rÖXþ §É\6E…|ߪ]Üç"ÁéZX4Rª¶Ý…$ºUÍV§qjyŽ p'²Æù t$Ä;p[>†÷{ÀVv†Š6\Õ¼XAÀ÷ ù³v½íñ ɼ¨5ìbQ%¯}±ÒaU¼ªœ•«í[*lФÚE”WaƒW&cÎFÂÕ»à0oÕ*Ë6L>óͬÿ_œüñïÆb]‚GÑëåU~’¬š 5I)!cc½+ÈÈ®+Uà~îÔ»”h ØŽ¦žè¡j>ˤI×ŵÏûsƒN;¸’–ûÚfà®õÄ8«+¾`T\|¨S»®Ž}J:aש»+>NŸæÂVX [·ƽì•rÕÛãQØ£Áyeðb@Ÿ®àó1<r‚؉±Õ¥—S†N^—Ç·¬{†rÕåâI“Úe™Ä¥&‚²ûúÚ} S»×u S÷K®+ØM˜ÇÝ@}·ÓÆáa¿_š[,9ZZz×É£T:ÊÌz™.ùq3#!è7…OŒ:É=ëaÄ“¶•3y`wCئ(õYÁTšf6±$Ì{Mì[K#S¤ ×AriEyí3“A"q'“V⢽RîA®âNƒüql5,À¸¦Æ!ôEŸ0’› h]97懾* \CnŠsÌ™Oï |È’²(ÌùDd3B¿å³úþ¥xäUI"“ªÛ<©^€Š‚(ã.©r9’û‘À%KðQHñÃ#mY ¡c€ S—ݺ¢–šQÔ¨ÛßÇÌÆÞê/CÏ–×µ%kks¶N•ýv‘­vŠì„ö`ƒc«èíEÙEÇòA®¿h\ÔûŸ–áRP-èìž@Š£‡¸xëQp¥¼ÍAˆ¹²UѱTšY7VúXO«YÀIÙôg S½èÑ=‹…&£~sÀøë™üÞ°¥êÈø`¯wHaŒž i>þzûL04õ5Dò£æzpÔ.ñ|á˜~ÏÖê14£€P ö_Uá°Iê§¢Wµ÷è•K–Ö'ÌLôù)=†e¸ ÄÔ‘ò–×0ÛÉf¢[}@‚ý9LB\ 2EaEªWLmfë=Ââ -¡ƒ 3)n¸@æk4÷¨^ù´(P=¤¼»É>:¶2)v0oìh/–6C)(?ÃÃ^üVÃ[¥…saÒ ŸyN+mV(®Å·gr@Õ™˜«μQl§pНš$Íx§ÁÊ+v…BŠõšê, –䂾íXföq/I ¡·õ"¤¿ rü‰¹×«Yš,À! ÏzsŽÃâJù\œ¡ÒB½]Šÿ‡,È©dŸúª—kòHC‡Þ"Îè‚6qîc‰Ðä_‹Rˆa—¿…ÐÀKl-Ø%=¥Far|hä ¾0Z»ÅíÏý Aã×Å'^aS œ{û¤žâ¯òsi =–ù¸ÿ¹58o92ê2…œfb‘ Ž«Îm…€h€¦kx… ?‡_Ä«`} oá!O8 Öqî0–lZ×h±Í“†tÔÜh‹zY½Õ ;0’j‹eÜ¥æ„Íb EÅÉzj´E'ãœi¡“3Ak¡Ê}aM㈸½d—< @—ÿ0B¼e'·ße-“cUâŠO–Æo¡£„6ç?-‹×€áNí–O«Xôsa}’™šˆ‘ÿ¿L·¤¥C¥ÃÊ0­Ùãñçbq­¥cÝ2Yõ¤±`-ɧ'ËB3:Ó(Φ˨pLg¯R·©80€ Q÷‹ò&+ŠlŒ‰&2§~‡MÉ”SÒn~ßz7å+*ôÁ,%YpIDt=ÃÖõu¤feºB,Å ]̉?)·¡"‰Z:]ÚiÁ9Σ¡;»ßVXìòÈÂmE F?C¿¦›.¹“ ˜†®¥.o)p™ëø’q k]âŨZïR¬L‚ÿŒ©© JÇAã SŒE;Dé°ªD½ 9—§š•¿¢® œ¢±÷€yfý À˜Ô’³Èãĉ Éÿ'*ϦI*\N%…LÇ°Šº(][œóIZ‰Rr‰qh}jÂÈ:ðýÕƒ¶±Š´ô§ECTP5"a¢¾~f%£X@²æ  +±9õgÐùÍr‰`Y«dÁPGBPUµß³¶^¢ sZyÇéJÙ9™Ðw̹&åÙ­øÒ 'ÍI‘jo‚8kY·¯ …ŠâÆò¶¯8بÙdö}#Û@Õ+Ž,tvÅÐñc„Ò;/1ºŒ¹û÷’KPÚCNõ¾j†:EîÀÔ†Ï"™âýñ 9¥‚콋/{†}è9 a¼¤0ób§ÞK‡q0õhûÌn‹‚@÷29¥a ™ž´õ65±¬ú(Á´R ½¥cõLnLâU2RÕ•i<Ëe7Mt3bÄ•cƒ—MòbH¾™Á‘cìÇ&䕱ökX‚˜ñyb¦õrˆ¸‘¸^É%Š”œd}„Ô*ÀCîø‰w\«Æ¬‚ôæ8¡êíºêçwkÕ§ôyF÷dYoØò8@qA;Y%b0€ãÍ]Ìú=»Më ›xÝI%Y„ZĹ«´jÐê*îi¿ê8.P24yœp¦ØX7GÎ¥ãy²pZl9r2£Q>C¼éŽ­TöáÂ:r÷Õ¾Rí™a7³cÈŸ¥¦/©% r¬§ÞÕ*nÊÇ[ —æ(• ƒ$у/C6*Þ G óÊÉ$gƒ–¿°–’¦u»Qñèt?[CWCÆJO¦_­@8?Ú“Ø1Ù&Š_Xˆ3¢ª1£ð¤vÍL ½|:Kô–]%õRL6£/Xã>g›í™´ˆ¨Y鉻fk?¶êGŒ÷JN€j{Jr Q´„Àg;·¥*²ÖàÔ²J8Ƹ“zÒ!ŒZ›NȺJ©Æjé«AA‡÷Vˆ±)ôóU8Q©öÀÜ‰ì •j’IÁy ]A’‚¥"Ÿ~b —˰-qž‚D]ú(tÇVPKG²0†*&)ÉŽ¶Š|wBzÌ«ðÁ^H”C)ašvSêL}rá8¸£Eý`µNIPËÙ2$A3ñÓ˜®ÄwOé2;´aµ u® ·6c(ÞÀ€Þ­ÔÞpC†Ú‰•€wù{ŒÅD˜3Y NEØrHi©Mb©*‘}­D©m0ôðŽ=y¥ŠÉZ[b|OeU™5VïL š,Ø€OO¾9øñ0Ø/ÈlÁÓÐî†üs˜1UyþæàèéÁƒ§Ç‡7?Ý^<øî°;xðüsôõ£üãé'‡¿;øôéá7û/ãøë.r'LsÞu8¼C¦Tç‹À¤ïÛÆU§*Xä£Û;ö)¬ŠG$„²(V[Ûm­Š„9§E ÙRúa-:–ín½×ræD"-åT`/ß ãízQ.ëhì¶Mû8ÁBô]Rà}_¡[ œt:nß ;Xç†%̽=K|ã•ÿ†¨)·÷qnƲA Ç1½Iƒý ms÷?Þmp&i¬ ‘NùâàGÃŒ!?gól8¥ •Û¢Y²ì݃SoÖ%Š#„Hòr’X®…Âiï †^ýå…£aýÒ©òXE} ™Ø§ØPì5Uñ3Ü’=`û?™N¡sĹ• ³Ò£¸^¥îêÕ]VQoÒö­‹i1dåOª4g@Ï$eiš=âM$^ÃI†† è™êup±ñ¥WXÀ긤¨ÒVÓ‡Öt/®´d1—˜…äI*· “÷iÐEUõB Z§ñg-U<¢#uÖ˜ê,J×fuU|$…k!šë¢!ÂŽ¥ß<)ëJ\;sîÐ%æ‹P¦tî¤N kéœ:¿&³ -1)Lô ]+fŽûdêÀ_6ŽÜj]ßü[ãäìâ{æk§Š’+¡éÑÕzé«@ô~m„·mâ ¹Kuùt!Ö­¤8×zœ\õŽG®Ñ ^`v~–ÀJR—ÌPÛ1­V¶³ÓʸŽE¶uóYSWv,JÔz¯mõzÕS Æ¾gDb½™4çJ—>•¦/¬®"Äó">£ƒh dÄú~µe ]‘Èq„àð¨LØH¼Ò,ƒN¦Ç¿6s+g2ÔY˜­ ÈÉb=nIâ+"¬T ”FR€§³Ö¿°Uøè[ÊöœA=S‹'_à*ÍR IeOÆrÙ{6i"·ò _ð¬îºUؾE²}G¾åBJ¶&Â8‰×¾¨/Ò噣%õû½^œ2ßPÄÿA“766CÃ8ü®då*™Óf¢>¯e£ü”Ø¥Îö(‘å^o¶ö¶2V·*Y¶-Æ—ëD™`­ïïë»Qz¸Ä¤*ÇZ.ç èü!=slqK2'& ¯_G8S%:Ø™*Õ‘´\‰³ÁûC'™Œ5—Ü€ £õTFï{_nlo†X7;÷õtÃ%¯Ári¬ÏC纞"bWefªT¾'Ñ=¥©ŽWÿL…ŽU!;´ ¼Ó0¢ÖKòØ%$Jg‹Û!J›d™+ñáA?_/Ü)æ8¹ra›u¥Dy …§ÄÉIŠ:v†•µ|D¨‰ÒýûXb‹{ˆH‰iúˆîOtÑ zÁVèÝÐã‚AW¯h‚í÷1Næk­¡¤¾]žÑÀR¹VT9 ï+Õ—s’Ñ-î¸3¶· mˆb¤DÒ7†¬hÏïáykz[)}®B7zcÔÝÚLcDZb‡•eR‹+GjÏüU!ÉͲ†Ä!á¯u“ýWòŒÔ‚®žÏKApH¯~%ŸÁGÒ+&N*õ:JÂQy9|2N;v¬8Z/qí¡%?ê-¢«>s!ÓE¦/´[UJo½³K¥ÎL×Ãj‚ï)ˆÀkÜ®w6hVæ'ÁùÒ”lëA Î(à¤þŠ¿AU11«¾ÔÉ“%Z;¨VVé 7Y=Ó}ç½cÉW†D,.êl.3Ïl,°[*:µsðŽR@79(z7Ûº"( ½ Q¾,¶SµóCnÚ9sMÔxb6À{®ðÖÀÑ*‰P–â¦ûts«Œkòf*1Y ~[‚0:Oê«j_4¸šć| I{¾)# 3£¥;öi9—â‚Öö¶Ð¬ZqtìMºÕC9À\ÔHùf©œ3Z3QH×V1(ÁWp=ñ]I†^z‘ʼ ,pî,o,]ðø¶±ÜüJ \¼Ÿ×4ÔÙ6 2}×Ì¥~ÝÍãPBeÛÊ×(ˆó•Kí²Îä @$†¥jùŠéVþ°ÒM>ïyžÐ!<k’cm‹Ge;éoÍê¥Ô°¿rÎÝ•4ßAåüÉ€BŒ¦—óH ôlKîÊîûæãNÿâWF©ë©ß êÖ—Ž˜OJV[.IHòÕGß7Ö–0̸Zý¥ÓÁÅ7£”ë^YÍþ&.Ÿ© 4ªÉ9Ì´}sð_'-äwendstream endobj 325 0 obj 5547 endobj 329 0 obj <> stream xœ­ZmsÇþ®ü‰«|ñ®KwÙyÛÉ7! #N8T’DâÅU€°1¡\þóé—陞½=,R) tÚéé—§ŸîéãçÕ°1«ÿäŸ×ïŽþòĸqõúãѰz}ôó‘¡×«üãúÝêÞ—x6iHfµ{uÄ›Íj²«1ú±«Ý»£t¾ÿÚ}‡Ë£ÓËmJ›ÑÃŽÝ ¬:í×¾{Ø›MJѧÝã~m»<ß ƒñcwŽ¿?é×Îx2u¦ݦ_OS„M®»À×Ûž¶8x2¦«Åµ¶{Tåœõòé VŸÖÕê,ö¨¾¹Ù7­Œß8?Z4b­X»a3™”Øv„ÉúÙM0Æ%pÃÚ;Áâî„o‚Ñw/áý4‚î5ï³^À378º· @´ëc÷÷8oÁ7¿ÂûÁÛ»OõáŸz· £wSV³ /_í¾Í~¾Ï}èíÆÙÐýšu¿ôëÐýþx ïÞô è`œ…³Ö~'ıûg×;òØû~=Âöõˆ¾H‹±û7þóÞ¢Œè½7øäeï»üð;ˆ}ÑZò…z:í‹*4Ñ¡pƒ’üP^Šòà™ÀÅç¸8ºî?=@Ä9×c«Hzß°ÞÖâ’làÒ¿¨ƒ³öd=J¸îµÛb°à6tµnÆKnôŽÜh™xÑ»È/>c8ÄHÀ4ñŠ )Ôð¼ÿFé•2k¦‰]_wTûÈð8Œ²˜ºò´-ûy´û¾¼?an¢àáñp**l8OÖâ–µAX–½ótÛÓî1Z¶D£ó"AÞ“ë†5[;;‘’9÷1Ù 5@¬’Â8v‚ gÐÀˆ­‘„‡ ?ïÇßAìO -Ýd%Å?I:dÔ˺"†tbç'aœ-Ì(wÖP’-ž¿-ç7’ðÌ[aòƒïKŒ9á@x$pU;Š×ñx… Üði"xÔ5#$_â9,õ<ò.RfR@ûЊ¿.øzɱ"º¿©ë°È9_<̲”›–kQ1Ç^ È…Ùx„ìµ¢5ŠˆÅ–Þ‚y#yl)ë¿H–Áœ( ÜLaE9œø¼OAHPé'â™l/°?ÉÙǃIâU‰eÁ_Y+"ÝHa¨/øäLq¹Äß"3bwrãÆÈ5Ç£¡¨©d–é þ£F\ª‰#Ã4Q‰ÊÇB(èað‹Z¶aeÖÄ™i÷P©º¨·”êDÿ(,pÄ A`9-+©¼Ì!²3Èe…lމ¨ˆE–`É¢<  6NìyRê'86bMt‘v›‰`)YGQ¶˜B¾î=DC¹Fâ*ÖŸh0Õôs,’B>A÷RB®Žã]°] ö~îÁ02ÿ“^ÐÞ7ÂÌ*Xá{£¢¯ Q©¤rV›Yùõ{n,ât°ê5HàÔû\aتõ¦¢öv™/”ì®¶¾’'äKМÈý¥o*ЃJ5îÏkñ&»û8]âÆFXRÈžÙÉ@é]³³oT“F…˜ ?û ^΋SUûkh’›!G:gkñZÈÈ‹›ØÔ·¬ï"ê¿H¶ÒÐB3¾Ø/Ô2jÇ Ú_ )cµÇ Mu¤þßòµÄð¶ºúQÊ7x,’‘<v~¥ÐIwR{åLqì‚¶¸U¿g/”î'3#"wþpíák ÕºàE„j/=ÿ¾ ü¼:ó ò¯, ¥ìøžfq™0H ^°ºûFZöco D(Ÿ¤àŽài‡èácô1_íø²†²„8ž•2wQuBKÎõ¯k7 Ý7½U Iˆ2ú|8ÐÃÙ²|×^?ɘZbñF¢ž€­Âs<ÚR™CcõDu ˜˜ŠÆÆæ3ºdvSEI£Ñ×Ôû¬,zSÖ—ãL÷7J oƒºC_ÔÎWŸ°“p$M¾D“GÚæ)KjÙJ›‚èGÇŸÿ.÷s‰löðÓÚUÑÃ3.ŒžˆËÁ¾Ìzˆ«šÕLj¢€§ÄEnfv}t|I<éÓÀ*6‘ò²Bñ¼¼±ÉÖAAÍ«ÞÖüÀWÈÇÒšî^37À“&*Í´AÍ ðMà¢|ÉQÖéD»È#Ùš½û±Ä5ÓuÀqæ”Û‚ },¸ 5é…A/è+ñ>écâJAР᳑t†;­&1­a€¥„Pt0KÆËæ£ <8-¡­÷¡ûÜkŒ+¼ ­g¢J&h })! ’·U·©òç~"5$BÔqÛ-î|”'<õmÛë×^· !¬ÉÉH»Ûd\Î[1cÜÝ.;]òˆ`’8æE8Tø"—w[•ŽÑ1‘W Ô4ºÈ†(Š/xÔyk™ÓÄD'|·íç&å`ãÆ`òF¤ƒE´äÓ"$áKl‚ÕݶQÇh¹o¢žc*–(–Î@Tfì]ñ³’ -g™-癤ç|£¸ƒ{ìhKlϰ9æ XªÈ¹Ð+퇱€C^"#³ò&ªYjõ¹VVÑä6³m)ú˜Î!EÛŠŠLf¿ÌÚHný?”Y;5©ûP2OHÏŠvJtÞ.§³Q1®[ЭÓD…µN•²æåÖ”öFL`‚Ÿ×I6ûȨZwQP°Åž3iÍxCÒt¶!L{*yW©ÒZª\ dOoÿg²WÍ÷ä©h­ó ÏžõÒM~M[…2rùZˆ9…Ï4Jxq»sdëâ &kÞÜæjÓì†óèe?z¹äÝãFWʬtafžµOhËd=ŸQý†ëc’Ú†0 ¹h«`êxS³õ™ÆÃbf;ÏwZ²¿­ Å8š‰éÃNÚòxR¬µ¢¸!ªÒ‡ë’Ël¨¬»ŸS×I`[Êw½5,Án–gx{æ1*§éIïgÔIÚ§ùî lµßfй ͦ®ÛÑ”Øç>Óé3›û ½¡;õ^ýþP©,Ý‚ ìáÚ0ãÙÁˆfÍýOEû4Ÿœ×DÅ’bÖªô/‘TL¡¥¦$û£6MpåQ༦[Ì¢fœØ~¡7¯¹ùè…D& ~à›†Õô,|œõàN,Pï‚Âz:Dœõòz±”rx2³p_µŽÀ:#jn=÷ÃC'pÃÇÚÞjŒÒ|{¨J3³æA¦öªÃ%}Ïâ*óÐJšSn§~uœð\ù¦@1”7À‹wŽ0‹n¼íÂJލÙ¶#…¡sY,MÝ–$FvL•ü¾0ùã‰âñ̇mKÛ–£Rì„ÔK-°Ó¸ÄõÞ¶¹7Þ·õJ®ö*r[j)Ǿ¶˘"¨˜ÚÌ‘Ttî½,¤%å]ée Ã<¯8£(3 p y1¯"- Ü›>*¢f‘xÒ›<ŒÝ]ÛÖÜ%*¡_Êi¦ˆ] §º†Ûî»öæ‘神´qC´U,\•§>Ë7¸±Ž ·y¦áÕ÷?µ%"yþƾ–fÑh®R:† ÙëY4Úûý†*_¦ážS½àß!®Û³økSæX¢Ë~FEî…NçŽA¾Û¿Ó$›£pg$$&·¹Ž Hˆ\@.gI«Z*ö”öqì Hê¾¶ÆûhØo‹ë]¨$îàg‰«îž!êò‘gnøÿCRµÞqUÊœƒAÆU.Ãuäè„sïäb* —Þmß‚î\q¼œ=/Ñ6¹å*Ð9÷°ŒfÞN«õdCfs“‡9عËOß0%²¥BSÌ¡CŸRišbñ¥©…ìk ì3Êié?ŸÒ¬ÔŸ|aòŸ·åi?¥‘|§¬¥iO¯šñÓì‹­9~ýügþŸi绣àÏ ¬Zendstream endobj 330 0 obj 2920 endobj 334 0 obj <> stream xœ¥ZYo7~ü#æÍÝI¦Å«y,I°d7Ø,àˆ,É’`ëˆ%yíýõ[bO¥ 0<êa“źXõUqþبIoþËO®ÿ­­ßœß¨ÍùÁš^oòŸ“«Í7G4%lŒš¼7~sôú€ëM0›9ØÍÑÕÁ‹áÛq«'å]ŒÃŸ5“1ÚÚáxT“г÷V·y8™á~Ô“3É§á ž’U> ïÆ­ a2@À -k£6/~(Û»)Ä qûyžœMqsôãÁÑgygk|ŠHCMIû„„áQeS.·9¸³‰É—ÈJÍÃ50é¢Ö. çÈ„™¬7mæ½V~öHy 0Zv vønÄ’ñzø&L:zk†#7$‡Ÿ1á'$¦'=?âÔŒw’­WmU‘ ‡‹0Q—á‚>âBŒ±MgÚMÖyƒ:óié¢3ÂÍÁi7L£™f­m4Ö&LÀÅ7Èe²ax@ºÖPÎ%MU Ð·õétùZG ­ƒ¤P7E@¡fR`õì ü5a\[Ö öwe'm@ 8Õ¦äPZ\£=a H‰¡¨ XšªüNƒOI%ò &Ò)ùÁ8Ù “ÎÚNJ4©cZ4’á)?Ãx§UäÁŸp¶NF7ÜÀ÷Œ;‹Jh„ÀžÀþp_aS+y6ú™ñSŠ3úî¨5H³¯™‚CR³uel6L§&lB>={À÷¸§C&cª¬p(Ël4-¾C%¥ºi Aq3r-qwÆ øõ3| ö%nPM›¿ …çÏ€x -ümD~QE˜DÍ[&ç0BBX¸fC’!s0ó¢Â&HÔy§ ÛùY…™ÏêšÌ\~]YtÈ¢AA£¯<¶€Óòr…(RÚ³º®›£Û"Çl:{eXœ_G­5Úpø¨ÿþÂN¿ÂßTòà3ÖRÚú ¸¦æ'0;©õ fàˆul,ˆwÖ°•i}ðD«Ððl"´-f(>Ø¥ŠZÉêK;ZË|7;¾GrWx¾˜oá'—y]ùOÄQŸb:r‹1Ûyròcrp˜vŠ{&cXÙ,“¦¤ WÏ=jç€rRêb hÒXô%_ã•°À-.Æ]jäB&_5?Ô,]Œg]0?‚Ò 99ûä…Xüàg*RÅt›¬8P%&PÂ%[èwV¤ tDPKÑE:¬ÖDúËþœóâ„Ïi%ÊœßeÉQ ‘ø¶yîܲ¤à²ù ‰ÖÇŽo«íGÔt‚#ÿ‘fÓ†Œ”óÍ-fFôÝÎ…°LV0&çÛ&â7º?'ÖWëÖ {¡ ìÕ„9ò0›|žˆ‡û‘b$ÆánDù¶ª? ê¦ðR)ËÈ"@ šg-Ff‘´ A:#„BP@ ½;lœጛL~ÑXä›|˜Ñ–81Ew³‰À-áüú#®ˆÙ@%ˆ9‘$v€Žb2[UôÃØö lFh•z³Seý’±”Œ>ûáë«â,™hqh4%C“ŒS(ª#S¿ŒÅ°dw\ð!“ïí^’\ùÞ¹O2%½ªpH¸¬Ãc<;¦x[v¥íϹ¿_±:IýÎSðJCŒB1Ÿ¹¯0ÕSFĬo![oñÀÇM=B(îð?.ñ+*ÉRvC ñ€^à÷mý¸­ÊDA†_|h‚YÛà}G0µh2]7É>ÅÎNˆf-š«ÃV,S+5ÙšG¸éªO´]Z€ºEõ†p'¹Z½EvNzýмï:;M »=®“ɪè]¯s3íKÛ,T‰v¤’›qîÃÚ;.B?ÏÚÖªÍI$*:L›]Ùe¥¹×ì"ÃÚHÅd_g“@®ä‘“‘På†ûˆ b Í>§M8©)Ì©¸T=E-Ÿ} ë˜µ‰t¶TëŒÒì,c±Ÿh2íó)íó锨 þ*üÅø´Åâ SÓy¾xO©:qhª½unìKÁybŽp¬Ÿ>iÊÆ!O$ˆé#pÄŽ’«ÍÍ Ä1Š}ë¢EµŠãŠ×¬žsØ"÷YŠ8»ýÛâhØm¡fx¬Û¢Ò´Ó×®õ-P$ñ_гÀ^¯ôT{¡²m¯ÕÞnnƒ0´¡Í]ÙÒµÊÑI蛦«}ÕÒ@ï;œÔÍ÷Ôþx_“ç%¡¦ºåxÆ.TŒÕ¦õ Ô¤Pþ>F=_AHï8¸Q]\à Հ»(Jܾ]W›`à7&=Õk6ºáà]mM¯`¬b²/ö´§t˜4 Ö—*_ñ%!úê_hOEH}gJ´‘ºÎTáúC}ýel­œ‡µ¢]T¸º¶5oÇ•ïdO÷É®ÓVmæÕt†ÂÄqÉùÞlkèFÙõ°;èU‡"È +ô$®^ö{”‰néQ•^„\L±ÌþÜÊV¨‰˜ü þLô2ó9sƒäXCÍIÎ`m·Å5à _°d´_ÂFQY4}r©‡]x±†â¥†·‡Y§ùú2é$²YQx™”ã.ÆôrÞ_ï.ã“2I¾„J¢)¥ t1Þï‰ç9ýÔ¨nùæwçúÕÏ5ïåÞú¡pÛ¢q~@Qùi©.gªÛE=’jÐ!‚·»ß|Õ\¶]EøÂŸE¾²ÃÞæÉ×òƒÌÜúíš©œLëâžJú~o.¡†˜xO :Pƒ:ÃzÆ'hf”}CH$§¥ ÅâÓ;eö4ÖJïiÅü–o†w¯‚‹ûˆ”çv¼ê2Ï}fºlޏø%ñË×ÚÜ~üºÅWË*éAZ¾E<mþñËûq&àêYJ—×Ãåg Õ¨âZŸ±ï#p½üŠ‚q‰ÅG`Ètg­üâàz¬?XX½’Ê÷¢ËŸîœÉ:¤ŽÐ×Ó9æâºäMÿjÁ>1¬Öu^OΩ°Á `+àžGT?:øüû?‚‚ñendstream endobj 335 0 obj 3093 endobj 339 0 obj <> stream xœ½\YoÇÎ3‘±ð‹wïjzºçòC˧9–eޯФ(B¼ÄC “?Ÿ®³«gz—”bA(r¦§ª¯¾ªê®ö›E½v‹þÇÿœí=zî|·8¾Þ«Ç{oö¾^ð?g‹ÇûÐ$¸øh=Ö£[ì¿Ü£Ý¢oÝÖ®YìŸíýsÙUí¿öÿÍŸ5ÛØ|ÿ06ù¼Z…å7•[ãÆågU³|V­šå><ÿ²ZÉ‹çÕÊ{·®ë~ÙTírß4Í_Rñµ³Í?«Æšúx½ý=vûuì¡é×µkñEìÊ….ÝÄßÚ¿†ƱÃ.ùýW•¿yÏÅ/=4‰ãþP­ºøªièÍwÐ}lëüò)üWÒLZw°Dñy5tkœîÏUC‚òn´‚Z¹¾_a±òõºwãH2ûkµjãƒqô ¿|?àÇL/è–çðçKøq?ŽáÇ-ü¸‚Gq8v¿\Áßøã¿áNáÏËøƒU˜k<Îlíºº‰Só4+Gœ@»<“~š6Ž@Ï`&! ún*ªÃ&¾Ã&g4ùfצo[˜r·¼QUÖƒNI™ øìžÝT<ó“¨mxzÎ{%îÂrcà‘i&Ú xâŸÐz­£IUÉly Èf ë0y äž$Å †ÖªRf—£3{¥†K+Œ ®AŒ(ù3²Äï†6Ô¹Êãh=0®…ºä±»!ÁßÊ,›ç"° ±!8ÓÅ)NC¬ä/ÁŠe°r~Ý‚¢(Ôª!0iE7Ì ¶EcØ tr,6±ËEk‹¼\= ™ ûhsû­Êö£øñJâFþ¼Ü È”µŸÔÙD‘9ë[ý’™ É-5ƒìV¹¢úu'€B»ȋƙ°AŇoÁÍÀ "¿8@ˆK:Wå‚ÃHúç‚Õ+Šù#!´o•äø“¾ lG‘Ǿo–Ÿ0ƹådÄÏ)‰_À‡W¬*#0G Œ­km [;$¦9]{r¬Š7 Zh…A…]ÎH°iG䎇’ v¦N¡”8ì`#$çÑtÄnì”b+ƒÈßÐÎÇgCý@¯Ó DíSzmzŒ¸©’{KƒÄ×nJ˜Ó´ŠÓ-ü ßZnúz7‹ T/¢n`æÇXäq_/æ·éYšÈ|è?4~jÚn;› “ЋcŠ,W,–œ 1L€u£ŠGäÑ£s@å½@{g~--[Ñb6¢æË„šŒÓBm@ 5ŠKKtã4•bøMN±˜ä›Àµß¦æð3CÀŸÿ©ÂLlqÆÁ9|Ä£E¹•™®Ë}í/į3eBGg–•@Ä]eà”÷9Ùd¶SJœ…³°•‰aÅC®(a…aóHͧtuO ùˆûAi@”†ÉR·5•ˆm›!ñµabHàaFØ8ò{3i5m”4O¬£ÇÉ“¼Ef`ö“~¦ eº4u"Žvíœ:TXKÚ1\ÇIiÓéß¾§å ›‚ÑF1â·YGlIifzøo5ÿ->Xü]†.üÿ&F RÊPdÓgLŠL¹¡ ç&éÎá„ZHT¹w•¨mÀYŒC!íçÈcTb–Ð`“]ñš†j¬ «€2N†`Â@XÅ8&è¼n¸ìècj¶]×¾nqbó5£Gý½oÊ Ëãm«NÒ{JvýÚu.£”;Ú…l)™¬;Ý*~¥ u08ˆ©c¯¢Ì,O/È÷PŠ©lr_¾Æ½Ó£Áci³„J>cî?³ñ8“¥Åç.Ëî0ê–%ËÛO$Íš—|%PMA;;Œ1ÅÈö‰šNE‚b}]Áž$lÝ‰ï “°ßô¥_ð&ã­ñ|"R¶6MØ£f`PûhÄ_¶E´´Spl £á-?¦Üƒ‚\»4Ø0B  €ñ˜­Ø@+ù˜Ì`—ƒÀ­™1Ð<ÕÊ8÷$%ŽRï&í6G¡&—eÍ$þºÁÅ%7<+ø»I~u6À˜šißx¡Úé=;w˜ªÆ‘à”ÜdU¼Ýþw¤ÒþŽ™jg&5Õ2&+ˆù~ª¤ëWɦ3Ï‚âuÝ{åê¸â-Û–Jv!ae†’Èà»ÁŠcÔ“MJ!Qèƒ7øL‰“,‘ê4îGÝêöµÒ‡“n“ÀÃËûðÑöÀ >©Ò3+ÉKö$2 ¨I&w)‘’Xd˜x ]íÞÝ”côˆHKM¤³×nüåäÊ[ i“eàÔ]ÐǺ²) DJÑ^ô­Û’åY8‰!&Ê¥T«’¡Hrî¨qÅÍîsI9ø&íGZ(úz˜™àvÀn™ŒiÇg=ßs‰kÌÇd+¦HŽ*“³"¢zݧ˜`S 5š˜<óì %Éø¶â3Wd£xú…p òåþÞ÷{oÞã^{½ˆ4,‚â¿u\v3Àáóã'{ž|»¸¹º=Ú{ôÓÂí=ú~<~öyüçÉ‹?í}ùdñýûK‡@ž?´öMð!my)cô¥Ý±”±Ÿ-åY5G;sì½–Ómvª)Bà 14˜‡Báì—·õ%™×(ÌZ¦MÜ6LÓ@JüÇDèÚ§Aôyá$lþ¶j9^öóg¼¸a³;í(zÎvÃlo}¾Ú´ëj¤õÀ`?ÜmÙžè7œËût̤>íÓmçþ°¹B:\w e(z¨1¹ô’†Pð£mj4Q˜ùã›×°Á3¢ñïK Ó¸`@6(V­£™}ø’»Dç“Rfe•[þˆc]zk$SH a6qg¥N¯²9áŠzä=eä¬M¥­0€”¤0âRß_Ùmyx\s“êìðô^Œ„ð›ëBíHNÌÌœ<ˆ'^÷¤/•x«Í#¹de!f¿KxPÒE’à]ó¢„ þúˆ±ã‘[}]”Yı@7`<“â…é*‡Ñö• Lv:¯ÈRûÆ”eàµé¤£=iìqªÖF‘/ÔµjmŠG™UéœËñèô§]6Ë*)ü&i¤ £ðë˜/ƒìd[KÙu©eZÂAA'[0\œè]vâ”–l·oéá™ØUkg¢bÎ@u¶úô&S:˜ÿ‘êçBÔ¥G(F}ÃmD»×•Ymrlþ½ÇOJë½NCÍóá2.òÈUiÌÃ4æiiv/JŸû¼»ÊIL·¬dö'3½‚2¯s nânvˆç'ôþLU-ônÍü4Ñ9Ác£ÍO¬–)pg¹%#ÚdK˜“ÜícnY›Ò7™w§Z¿îÃL”Ùý¼4‰wIoKï“òŠD~‘k”a° ÄÆîHém»¶É²ù|¹ûÂø<>~?r?P ´¾àˆ@8aJìEjK 6¡Ôi,µJÈ ,WRu‘ ’¸o³–¢Ž«’b‹FŸ òz ¢SÊ<·­Í˜÷}äe‹Tø×ìøÒ¢uBöŒÑDBò79W ŘîVM[B>‰¯O¤¥§úÉ_–– €’Ô.JR;Nn7‰åúCˆÜh²ÈÄÛtn˜­/†‘Š3î)Öë&™wJ~İÕ&C(æ4Ó‘œ ˆ¸-ì!¤€=iëM+?° %löZ*íes{Ž •ß––vPÒVQÇeS–׿TúôA,LØß'qÈ$Ê\YÊa~“Äts©R8Ï¥pšAÇøó4Ù”C= €NŸëÃÏô·çéu‚ʯéá3û<Üׇß@ Ù#Ö¯-plÌÀª¹*Áå¸¤Ï¤ä ·%¥år—½Áå¾úi ¯ç9•’7*bK ÆQîµ*-¡ÓÀ(YÑM÷=1ÛÕ\BÙÇeZÍeI¬Eg{Z3Qï'â«i?pÖç=–Œ4SJ;K²Œw™À&Áö$¿>’A8g ìáÆÛeaÃq Ñ[>€n7¸‰sL>qXe†‹N7W:N¬my¼ÿ½3ãIìôÀ(ù·Ûš{¹»§³ûæld¢y^¶Í“ëÞ`G<Õç–ºfyÞ /ù6PÆîøEÎ1G©úËüKIÝÊú£ ÷¿+ÙÎUUØî8*Á£˜šäW»?{÷5+æ*©§Ã gó‡÷>¬=F®ga9\ŒŠ ù–9ð¬ñøw\†#ºþí]ºÓÇ1r„[(À¦“¢üD·¥cÍóSSÅÂå;}½~x- Õ²DƒüVŽþÏ2k²#i™Ô!޹7ÓòE¨ÙÕ“.—*z^sA œ™t´$® r®u/{ç:"¯ƒ)tÑtèÊì“t^Âîœ)ÍJÒ.$Ý¥BTsøÿ kŽkyÖÓ+%z'‡à \INæk)ýÁ2s‡²:[‚IW-];¿îØR0©ØòTx/wA—G“C”uªÍ2ØÈ*¥¨¡£c/9¤l[œ}vU¯5C9ö8p^›õ¤ÙM 8¹pÌ¥f\ —=”8wŽ’Uy˜ ,a뵜,¯¬`„ÝW¨°4ÑÓ¡¨sÏušv» O?dT1{Í©ÕÛS¯PªKÿK¿#1ü\iÑCØZ#àš˜¥6âë[8`úÝJ\Æ5q˜h0µ+T;Ðmy¸jÿ\Ëûv7¸¾ûc&>Ôù¬¹°Á;sŸJÐNɼRê?»›I@žÂðí 7"ÉxªÔ¦Šƒ¡3x>azË Â¸br¿˜o<•+{©vûÅ™[kæW‘Ù†§e¦Ðé8½ßd˜5/ÒjZž'U(ôkŸß6È?”úÅa2K¹N\ }šëêçYjßTü|xTµèwþ‘·|îØ÷¥‹|é–ò'ÜvËUàÿÇG ûèÅG ÀdR­ùÔþg)இk†å׈qNà -­âWºq2æJGÕ5‘©Tu“K« mÄÎÒËåÈzSf(_/ØzY˜ ¤Fœ¹¶<¯ÅájÝüRAj’߀çõæ=ÿ ,µ:zVž½ûF°Þ¬û¨2e£³{Güͤ‚û3½`!”èÓ]ï¦5 ”‰(toÌÜSŸ_ÛCrþ~ï¸1âªendstream endobj 340 0 obj 4517 endobj 344 0 obj <> stream xœµ[YoGžgk~ÄU4#nr›®¥»«ó0’0‚@ÀI&JæÁ`³LÀÄÎ2¿~ÎZuª»¯±‘2¾·»–SgùÎV~»éZ·éðŸü~öæàæc†Í‹_ºÍ‹ƒ·Ž^oä׳7›Û‡8$xÔNÝä6‡Ïx²ÛŒ~3¤Ø:¿9|sðãÖ7ý¶m¼üÞij§4l›]ÜÞmv~û¤ÙÉ×{øõkûe³ ®o§)ò‹¯àŒ ÁÁ3¿½ãhðí&n7;·½Õà«'øšØatÛôÙÿ…äFgɃo øðˆ›íøá.tí覉ßáÂæÑ·ë·ÇHî <{àúp˜#8ۜݢoST-»Q/lx1²^Ý €ÜÅÞÄOÙÐÐwÁÎ:Z?¢!*jõQ/y±âHQY²ß5zœÏŽ·û_5—_VÜôWQAæL wóaàÙËú@Šw©3"º„éÐ0à%)ñÄ <RBC¸pøy? LP°’¨.™¸ï1 ¨‰inöä'Ù)O£‰¸ÌR:ˆFq1)î‡>©rú¢Ì‚ÒææÁ!Ò—r Ö²1ÝI¼@FÎʽ£‚Mlp¡äk <²Ð0tBœSi"sø….£í¥î;Ä^}_x% Wà‘ö¨“éÒ!–1¤â ðâé„P QtRñÙGó m艚´¹‚vàrÄSõ Žcþ'ª-J,ѤÆí;RM¦ø Î Íšã*“}à默ÕD–7q"æVÅýÁ‹žãÁß/@fÉϼ5êÙqÖ ¤é7Â&„w‰"IÁu&¤»$@Ü·jF~õ‚å+v/J*í^¢ÒG¢9]ë£SÕ©R‡Y£ #l,ñˆIÅ ì,ìé'µDâÿdôçŒÏ°LL¸:Oˆò×Y.fGðr K]1^²By#šÄG®±QµdèIÖN®&OØãˆû‰¤`ÐëLÂÁ—:7QŽ+ Dâ#Ïwª˜`Ì…Õ·§cVrÃd-!iÍg¯Àf¸¤–•F΃4¸!QeAÝÒ ¹_Éñ¡”;¬kηC—umO¾¡Î4;¥«¨ÿ}ù%{@.VFεÊ“Òjé › (ÍZØôP›ôÈFµG1YÑä¼5f‰ÅÐON8É0ÊÉ/ÂŽ™+ ìôf®Ð_Ç z ®Î¥N¬8¾¤“.…ës1æjÊ%ºz4lÀ*Ú¸q0¤ï=ÖœSìr(á›]×ºŽ¬¬mº6…qƸåcÉŒvT?m¿CåqiŒÛH§ï#–Ñ@`cïW‹]À¯! ZðÆ˜ ‹ïµR~ÿáßðsŽñü~uü‰i$õ· ‹“¨÷ÿÃBÝ­¼„ò¦^(T"#Ø–ÌÈ ì÷ ó²øÙr÷ðà›ƒ·ˆCªUÓâÆ©MiG¬ý%¬~Þ¾wpóÞƒÍù»‹“ƒ›ßoÜÁͯð¿ÛîÀ¯{Ÿoþrp÷Þæ›ýuÑš÷ZE[ˆ¸O»RiC«ŸÞ©iTj×Jè¦é]´ô¤³Cõ?.ê?7tŽê/ÉR9‹[Ø(:ãÎúÇ?Pp°°}VühX«¹+VÖ0¶Ž•+±¾ïsšýÜzŠå ¶ñ¬±ãdù¥‰b’3‰¢4ÚzªI´£G¸ e aû_t‡'xçT¬x_‚1qéóýÐÄU™mž¸Nb Í™.Ïù˜h¹_ê¹&lÕJk°Ý²¤aRR.itnŽÂúÁ=Æ2õÁ_IÉXgåð[‚J•¾«ÏÉ©»—êܼn‹AüŠ=k!›Œ&]¹ÂQv“ HÎ{8º^Fzèt¯=¥Æ­èiœ¸ZZæ÷ EÊÇR>¹Å&Ï]qU½¿[ªF¼@ÈcÌ^`žó‰RÇT ÃöÖðí3øÁŒÃSîÊ÷{Û^•I°„)©Ü7nzªô uÊ»Bç¯Bí‡uZ©¹êi16é9sX¢Wdmç*9Wæ ÚXd6³MϹs&,¢§Ád¶šƒõØY“Ô«íˆ È/ñ°H#'"|G%Ô¹‰žfõ:N¤B©+‚.q¿u]O{½Ö˜Ÿ:SÜGÎ<ÕÆ@*:‚¸Æ!´Üm0MÆ6·((:³¶§ÑÜùò|ÙOi™y˜ˆœª©Ï=¬ÙÕ¡º(Môy­../QˆÄ—è+»{´9çDçX­zs ƒm—¹f£GÆÐŠU •Hš’y(@‰*c/'ÉêÑôbg:YW¤¿°¯5+‹·ú )!ew?La¡býUoHQtH+yE“ÇP’¯=©S+O*Ï>ÂèFßÝÂa òJѼĀ @„;Ÿ /)ø1¹_ÞAýiT“›ûSwT–îQ‹Á£!iäãà*÷ùªVï"Ö\å0Ž¢"«•=ݲòb?/ýiMFrDåA7Îtî=MSÔ©]Ý­’S./.}üry,®¿ÉZÚi„€sצ1$?a !öˆÁ(: ðÚÜ(*£ï;ˆ_°ñÊøÁ!ÁØ—‚ü÷M,y1¦cÞ ˜€¯±»ê.ÉΣ¡»Ü÷©¥_˱>Tõ•%ñB Vü?…!.­¦ŠF{Ѷ=§ufÐKuÿ¹0‰Ù%µm´Zk}M‚ ú)ë&è%Eÿ6§ §zè?ðmG.áÒšË;¹ÉÕ—Øàâ²$»Zù»Üœ¬ÚžÅ×/ê.0«Ÿ4覆 3¦j$×i¶ç‹¦6‡¢;ÒŒ€šô¿[ÒŸ–:6Ö‹¿yXõ¥Bä¶Wßί£V )I ² ÈPñÞ—û„–Å{n ò%îJÒšK´Ý––Ý=êIQ3~E[DH!­öì8¦[b‰.zçsÕ—†ÖJõzÑ…ƒ•Å%Ä_$KBdP 4—¬í]Ì6ߨ‘ײϞ÷Ń’+‚Ìeä!k½z—³Ÿý1uŒæ’› ßç({/»|Q¬j*ežKRI×÷Í5Ð9–^ WbYÇâš?]Ÿ¢A–2å´Ù-.TbªÐ—˜j™:.nùÏZDåÅ/³x^ ‚RÝŒ÷Úö×ìÆí¼x#—}×pÿ¨Nµ|+¡8iyÝ'WŒåL¿0÷USU$ô m›ÝˆÏe-8é Í ‡®D§e±u/M7-k\¼F¯ßxâ&{£Ø\©µ°ò™"°¬ ´`QüS8&˜h瘃‡³r(÷ :2£÷Š¿“úʤâ¶ä)ý$„¡¢ê@ÙÄeýk¬ÒwÓöŸ×™¥Ìz‘_·åáëüðU}…‚"Á†JÔ'^þù‡q·´1¯EÕò‘ÊUeÞÉ 5”˜»+‰¹½kÇWÏZ^_”‡ç{ΊWyr}­w“Âuù<-w¥Òþ1¹ºÐ±=æÂïìÖ•¿¶ßAîú¾œÃ&}YBOOÐ.=V VÐZù èõÊ¿ 0_#ËUq½Â(âwy•{qý–AÌÜÜùÖël; eBÈ„ÌîÔ,j¯õ’M¬^ÁᔲÁ)÷Ga—:s×SÑnÀº_z\3ˆO%@GøoþøVõendstream endobj 345 0 obj 4161 endobj 349 0 obj <> stream xœÍ[ioÇÍç~Ä~p À;œéžÓHŽ3°-Û¢áqS$E2â%–™_Ÿ®³«gzyÀ2^îöôôQõêUuUëý²*ëeÿñß½ÓÅÖwµï–‡W‹jy¸x¿¨ññ’ÿì.Ÿï@—¦MåXõrçí‚^®—½[vCSÖn¹sºøçj(Úíü º>é>¶¡ûÎ~èòy±nV_u9ŽC3®žnõM±v«hQ¬åÁwÅÚûº¬ª~åŠvU†'Îá!×¶û³b¬hŒmíë0ì_î/«ºÅa¨ºéÂÔ.|k¾ 3Œc‡Còó—…߼盺„y_ë.®à~Âäõê~^ÂÇ9|ÂGÉ/{˜·öeÛUAi_.vþ¨ãŸ@—cø8ƒwØúø™> Âû°ÏžVüV†¥WÂË”6t85ÇÆsmÜÒo'ñqèMl”)Çfµ›{éBbcìùIl<±KšOt©»¹ÆÛØø™6þœ{çmÜË t[Ñ–m»~L– ª5úD½Ü°>ÛŒÇ?J•lË©é¯]X@s Æ£EÛ Òí`ð¦Ðr¯ ˜«©LÕô„§ èæjÃ\m˜ª¥»áËièÕ5¸T|눬®oAßxó$X÷>ÌÒ'#­ÝÍuÚ óÂR¢€]7¬ªn‚‰‹·#ŠxMC?‘©`”nąà°Jh¦G ®¤§Ç?°M(o\&Ðv]2ü@Üò퉤ô®Ò|¢Ô££< ³÷£m(~XžŠìÅÁ*@¦Uíð美v tuV¸ìfˆ¦æ`Ã܃¶M“¢jÁŠdcã‘™ƒàÖGâ‘.qr†‡e•NÁE¯á£ó{§6¤Š²÷EÖ>ƒEß AÏâ"`ƒÈÐý‹±”'™»7y¼ +N8]kt«à&ëÝ$³šá—s‰N wÕÁ ànaèÝš}£ÔglÝ­ô‹(NPƒ\1öŠM×LxmÍ]åË È ¾vö@Ù95J¿ @Ú)…»¨±¡u¸gGt–RGS“ˆp"FŠD¸ÍFê².¡‹C¿öVßS L qª/ݬ½‰^|âÐà¼ÐŒÈ´¦•ÃFÏ,wÅÎn¹ñÆŒÂd]]Ùw0]J#Q¿¸D«vÄ\ãAöjÑ¢ðÔêº{Eò¦ –ö&h0‘] \³¾C:Ò¯yc©wü‹Vù ÷ù)¬Iº¼ß´¸/gæ6jë N!¬õpl‚Cç™ßS7Dž÷JÎðµyßâO1OŠÞt0yà뮼ô¾ÆP˜XIö2‹8?˜¸é2æĦ;µ(o%ˆìÀ]“—lÊA½dI ‚5·®¸ÌAËWpœ)Ob˜ÊÇʤCÙâ†ôÒº‘²•†q *ÔšìS/Éñ)FÔÉi ’#U…RLŒÖÐfw‚W˜È‹öÞS”ÄàH(͆œÎCŽº½†H@=ŸÉƲDA=B…t÷iÖ;§¦pFøÿ>51‰ñ*{ƒ€@|Cδ“ ".S+$«Àиmä}œœ·LþÙ¦ô“ºà9&Gû?P:ó8=H:aÍ Ì¡T7¤Ò·«C-Û{–ú°ÐÆ^K;x Ò ÀYkã—ñŸ›g&7´gG™g™6¥«Ô7ef6£ŸiãU’ÒA Œ^º²ÃÏ×ùÎÔæëDÞ¨ë²Å$M œKŽ“€Ù.÷*ûmT¶*ÿ¾„d2eêìãƒÜÖ+˜½||,¸ª¯!¦’¦›ösú»ä¥>yŸ¿~Ík]¥ÕäùµÆx܈õÞ ÿŸ¦ÿC.}úilÜI"ÿˆâôh>€HL«Y‰`"¡ôg/Õ¥œ"ï@„=hÛjéñEüúM켕…íßãWAeèL!%.`ízÈ»¤¾æqXú3PPUÞ™ÞN^ô@ÙÚÂUb?Sç…AÈA5’·– L~\ˆ‰¥–+qÝý„h”~³ÁU˜Ía¹z(äö¥µ…NMýãlÉÀ?®e?ÙÒ=5 WyÛ+N;x®ð·åXU ÿÏÒã1ì¡åxÙ¤‡1Ä?˼å>3`¬ !àן“ZÉV˜Â¤%TqpßµIt]††øÑÀ=±¨ŠÐ7O‚t.º†ŽIILg²à&!:åos©  Ùù‰¤Z 4Ì#;Ö†ê;ãTê³9×P=rUšRaÎ}ÀÄ3êI:¦ŽÓÚÆ¹Ý8ÉóiÎP½Ê!ÑSg7’€M§®v?IN½1Ie×›ŠÊäz,Å ³Nμ?-æuéÔ‰¯HêÿM›Mö ±‡2¢ÉT£°©j%‡UV$*ÍÆqÂv( Ô꣜·oáônNW¡¿O³y,ÍêfJ*.Ürµ¢.ÃÿØLÛ0%zãMrCï ïâþF'™öxT4¹ž²:›U‘aMŽGˆÜ¬xF‹09aEMRû‰fóŠ•aÓ¼ H„K$©4v3öI% NšQªd*(qéFŽÒÑùð_254<ƒWHø ÕÈ1Ç\ûØÕ’DšÅWwS‡“T„t#Nëj¾ãæCç1U4!°¦ÇªÅ½ÄÞÈLv†ŽýJb2)V4É"¦ÙÉ!ë:Ã@‚kK[1D‹‰Ns°—lœ^\'.aèµ¾!vAy(´6-…µT¨½¹3›ÈuWÜwÊcZ«‚¢DCβžÕ¨ÆaÍ°× š¸ÇŒ¡¬%9ù(@Ùèá\OÞ%¡櫽Âd¿ÒÊ u‚ Ã=à¦À4íw2tu73Ð*­^)¸š¦Îׯ8Ç )@Йâ’óµ$[/¨ Dh}ª¡¯Ô½¢(éâ@Lúòb…gÞ“¾QYWjÆÏ‘]ÎñèŠ.Ø8À«i„²îqoÓ*ÂTǺËôŒíë­ÄÄ+Un)‚±•W–´wÙˆ‘sÀ–/exßÇBú<©K—$÷9I1;º 5ÏLòÒæè¹Ð›-°Òº}TÍT2À\ðM#ö5™Þµ©‡%G%Uí4Um#÷Cö†ôË‹®c‚è[äî 7ÞYR "©ÛÈå(s•ž›1«786*«Ñô»k6‘àJÉ>µøÿônЏyK]´ñÈ»E|n°K£A{qDË*S­çÊ4pø–R¦^µàÍ{A˜ÃE‚¨Lšel,á= ÝFs}gŠª.Þ*ˆèQ/pÂ!¬»iÁfs˜Få–2½”pƒùP)wMÂÉ“BKZi$¥AwxÙ͆0™Š•Òaô‰‰V¡ìòæhÓÈÅI·œóŸA›E K¬*eÆ#ÑÉ%]†@AºXYøÝÆ20–¾ýÃOž˜c«àɵ—ìÍ«äΕô³õ|†yL™JÔñ§‚/‹eXQ–÷„|v]—]ôÙZ2Cå£gu“âµñ¬(ÚJ½ ôÃR[›…¬\ÂÄp“÷¾Ù(ÈdZ8Ûž^ä“»u;1/ò>ï;UØ ]nÅË%rÃËÆ¨r:ëÚø’œKÍ)Òz¨£ë·\žÐ\ˆ|~šÛlr”MA)ìþÅÎâÛÅû¥÷e‡W݃¸‡¥‚0‡ð· güðwïtñ|{±µýÕòúòæ`±õò^l}Ï¿ù<üÙþËòw‹ÛËo{­âߺ óÔeÏWëÏ$N™\Ó{J *Žõj!{>yéá®E9ý*bhá†úo.¸k3ôãLdsI0º<ä²å€uû>îRÚOF‰}o’)ÁŒtN¿c-4æ áVr5€¶…Lïï )îQÓÆ"nÌuøë Wl¯œË…§}©!`áAòè§Ú®É›”-Þ'¿,LNX*˜æ=â'’=¶þ(sùÝÜû?µSت&ù{“ì=J¢·»2݇±ñH/ri¥#)ß™å™+ô_éóçRýj̨Éò䥫Üó½ÜòÏâWS)œOÚ>Ä¥•›3Ǥ!™ùƒjLó¦8eg;ŒÂŽÿ6"]Œy™ÛÍn1OÇ›šJ~¦—ú|;>ßÑÆ×±lö6§–“ÜB®¤TŠœ8)’ ÿ¹6¾Œ=·µqgVh•Ђ¿¾Šyœ25yÕ•ëIMIõǧ˱V·Ë˜æÆ·¯¢%ãë'üa+93 2¶zô`¥fËÖïr¯ßjã·›× ºì>Æ9bfY`ÞÆ=üz8‰%j‘’² IË÷žZ rímVƒ“NÇVpž·"ÝXèã6Š…Éþv#"1Ì—-×]ä°—³õì¿ÂŠsŠXè€1/ìÅÑÍiïÆŽ)Ê‚d/Ú„WA·ÿNF´,^ix¿ߺNvºy±{b®.M8úC £I9oš"§9.^iãS+núgz­÷/9’> stream xœÍ\YÇ‘Þç‘~Dc_Ô%°‹•geùÁ€D‘wm][ X†=äðÈáŒDRÇ¿wÆ•™UÍ™áB€!°§»*3+ˆ/"¾ˆÒ»i4» þã¿/Nî~k\Ü={}2ížüxbðöŽÿ<¾Ø}z M’Ë—ÆeZÌîôé u6»Ùîbò£±»Ó‹“¿ïíöã`÷ÿæ´ŒKŠû? »_æ›ÿ;|ýõùpp6ŽËâö_õogÇišãþ+h÷ù`ó½”ùv8˜ý'¹ÇŸ—³ÿKîê#>ệ4ÐÖ/ûSèúŒœ éþü~P†Â‡c›î ‡0%\Ï»[?º¶µ¬ôŸ¥ãch¾ÀÎîù«°-Ýûµv8+/êÅ«rñe½X»¿Æ¡÷—åÂS|À˜·gEŸ7]ƒYðÌï•ûêý‡åâi½ø—rña½ø•lÂŒ›@÷ßlMò§­5ª–—ôÕ»Mý‚“t¯ËNÛygË"ð¶vRCýP¿¾j¦ÂmY´Ü¼3~ÌlQj\ŒY¶ÞŒi^fßf ³Ïû˜µj Ƹ%ëÖÁ;Ñ£^Á¦äó3áþ´ÌôHçm–æÃaSrÖšíÏòNÌ~LÞ‚òågyÞ*3Ny_C^4N`¦2¾m漑y )w¾2žÌ“™g—Â8%³ÿ%_.™ä鯿}Êê7Á@¸9s|‡“ÏÓ¢L£Í*”·´u´q™ÌßDß´ø k'¦îºiô¨:9ýøïˆÏAûŸä/°% ¤ÛÂLág„Í3åˆK‡gÐnBÁ=Ëwí®êméÿ8 ÷ß _æïj”¼E6ËŒ_ñöS%“f‰þe° ÚÁâ`yÛ Ñ’šïðØ¡CÕ°dšß$vÉ LÜmLøYÒ#h‚S ¹ÀÛ”'Ztá·!Eší˜¤ÇG¾®ƒÂ>ÿ\À~•áU–€ÏS~ƒÍ_¥-CÑ]b”F”Jzªù®µ¨È¹G0j¡Eíã¦F]æn<‡˜E°^¤yZü—gfg¸îäX­´~;ÏOÌ#ͳ…ý:ð†ŒCœ,í @çBrØN0 Ø• -˜¶d Öð¡Èî9÷EˆB9“¡`d‘ÇbÛ‹¸Ë€CBW…ø-IxéAYó3Ô7£À$²±Æá$ÐlÃ,f@x¿ÿë Š­¡Û¯øÜ|Þ®;o£9†¨ ©&YÒü©WR/+¾ ܶ³*,µyLž ¨T“Ó“UÂ<*'‰—aüÅ¢…c-…r 3ÞÁJüDˬ:ãó ¡Ùn%¿„ÎyÙx™NiŽ"ëDù K¢å"Nà¦$e)tïTíª$©b@‘ýÚÿG÷¶"ô/7Ïa‹„ë¢r)Ô3ã»Ð˜&x’|AypžÌGƒíEô…‚–C6Jì}(Ú­+Y;üL ˆòíYó#Æ¥ìAj-Õ4àF€˜m¤9ë±z}þg € OÂ(Iy®äˆ÷QfÇ"`ˆÈÀÚÞn¡$CG¤ÆQ `RW¥§,$ƒÕó(+‚2îá¾´¸íÎyG ’E@oÉ©?•]c©‚ÙÍb YÏøµÕ} çp„Šxêᣜ’E9-0׉s#¿©Ãï¨vs±`¬·Ôê0o›"_úûýP}™-Ê]žOVx-x†r4Žì6 ð¶@ª2ŸKåà§ÿFã˜è ú|Z1Ǧ*’ŽÊ²(³_v«‘Ì¢J¦?ê-óxÙØ$¿÷©>²“ôZ£ûæÈØSæèœQ×t0Ëè̲ÐÒ¾D¶‰Ÿ ©õÎÙØ¸8!‚ü²²zäN{ÜÕf£($ Õ²‹-lcÖº5Õ^Á4`Î*‰V€\ÚÅ,-Æo5tSò£¢\x2%ª áVgÆŽjóW"‘  Y|XzLl٘ꃰDªÍrƶ€åñĨóE½côÓXF4“ÏÛ­[Ö’k< .¤)ÀÂ\Lƒ€‰ÖÝ3¡ Hdháùè«û{èmë¹ëHމ;µkF2”¿WÓÈ €Zým¯JPD­úÐŒkóûðµ8cCJ} „ê’±=òBÙ ; ’l‰hKÿŽî±V¶‚7YTñCåDw-œ dúsQþ$:%¶bÆWl§YùG­wþªj_†± n’–ž=ó㼤¯¼ä_óE¦€KšFgMt…\39„ÈPCàìŒ0× ßl²T0˜¡a€Žt1)D~˜!iF7g £Íûð¶’ˆ/7¸ÉÊWàP|^ËÜR—Ò»²¡Oòí9šìý^ô¼¶«wÏyBaÙß/ÐÌ@dÛhò|3Ä®8[cÕSˆ‘ ÉË.ÂàŠ¥çL6©1iâ–è8—åþIê9 ’”õÐmh EÝ‹$Í¢a¯Àå\PTÛ8ÈÇ5S{1hÄ}$¸b%ªŽ* -{‹ßf:}LÛ¼O‘Ù+„èÁãÿò­° à žµCunM5)çZµ}tèG’z[f@{'Zó»â…1¨dœ QSS°ðYÖ¶é{dÖf½4ö—– ¸¥ÌÀiùÖ 6`i¦ì6±Df.^O½XʃG>pÖ˜tÙXIæ¤p­}1Ø…¬Õ[qU….Ïño‘¶IÅ^/‡å'L½+10ŠT.Ö ¡_l=im¹øTû5J^KD%ÇR)‘9ì(ðJ´5ß žNOY­g0£Iv!úfª)9lDü*ðÊÏRtSÝâÞà –‰ùä*rê?—°ž);ñnZ¦¼Þ~”ÅkIIŒ,ýuÂ{¯ ïƒ"3Ìà‚8Ï=qø‡g¸þ–î|å´}"W÷cîÂÇcšûù7&F°Ž¦ 󣪲23úø}¤Ìᕚ˜E¼,wU¬jõÄ“­Ê€WÚ¡Våup•Í_Àò ‘×”Wœ$Ÿ¤¸ã…Ì Øt¾»ö ”mÏÛr°è¯Ân ^ÕŽ6{E²“SâÈMˆ1sþ2ÔÌÿþncæ 1>?ÇŠ#ƈJŸ\ò"‘ßr¢²Íä ð0ˉ")TŒ¾G´Žq…Ĉ¾& &N {D9çX9¼yÚ¤oŽg¸€9P‰§'-µ— ìð5?QJÃûyrqÞ×f{°©2¥A:=5B¾M>_oĹ¹ja»eIÎiÖ*ðU ¬jf×›¢±Îwh˜Ž‰èPpFße‘Í”½ÈhÒïj‘ÍGïá9£«&ÙlØb[¬0Ìñâ ¥q[K–Rg§ß­·bø\‡ó5“Š{Ä?-M+ƒ¬2¶µ+ª ?&öúÀ‰ä|"ú××yÒLÅó¼ðÔl¬¸î-+ÜdGµ—Є’›];6t…˜3dŽ+`€?¤¢¡€AøS…£Yß&õïüººäºÞŠàKD¤<±0…Füò’¦GŠT«RÜ]:†ÅnœBqž°{Qeahg:‡>ÚËO)ð4/j%Ǥ0¯féC°&0äX¯ÆòMçHÿ ¤'æ˜wµ¥•P@àIAç[|8‡a’Ê?½m‹IêѶéõ ýG}Ä›I'šßÎìˆLJ)ZIḏƒÇÕ±`†E2\gõúSvâBq&¶µâ,RØ.ön’\JzÕÎc½Qh3]f••`tæ}$2aarÒl¸Ø.K¡ÀKÅ÷¢ëÊkïšu {jZZ¯£­þ+92ÔW ýâ{ZÛµ,]ð±™@É›Ía7û°·“f% ¢ÏPš»p+|#¾x؆°D¾˜¼ö()Þ813•œkù ¨@cn½¯›’æ&1S¨VYÏåÑ|œ~*ImÀî¸Ri}ÕlLȆÇP6ݦæÍ-iU)%“(­$a×¶\ìçÂaqÚŒ#"Ëf°–®--UƒÓ7®Olñ h÷¬ q©fðXˆË»i P1šŸ¨¾èÃ*r¿c²Å‹¾1éx¥Õ‘Gs…9T׉s[Ylü‚lÉÏgLgP$B¥Å£ªqXö=«× µªPBò\\ó²Ñò4·~;—Rô};s(PzGL qƵnI U{h’ƃ2= :W”js¢ðeŠR¢ˆzyÃ8­c—!]K[; iœ§|•K9˜Fn|[´më}“È`MÓ®œ1ïcñâBÜÁâ„‹ö3œ)/ƒRž`…LVGlV}Á ãC[Æé9ïßT©ˆŒqìéKŸ"sÂÑÔ{9†¡]›63&õ5æ»…2Oq;!L%ntE·òÃÖà*n [´´Ø,\·Û– 4µ!‡)O È ‚ÓºDKcRK .bãµ®ëǯƒ. W6q6”∽*Õ¡ò¡xþB§K%œD|êïpÐû|»êµÆû—ÖB°¦Ž#¾ºÛP´c9oHu·•ì5Ùý9L'z‹ÓÁ¯q*U̹×%]—ÿV9íÚ‡2Éy‡8ìÉjÈí6©œý“%ö?îµQFÍE‚ÝxEI)¾ˆš±"( yp÷åãUa¤>ÜÇÓ“Ñl‹æ&å@†'Ýeº&Ãä&JðI ºT®ç5wmýîEu7|p ¦J Ékü¸Î‰KÙÍDÌã\ý2`2mšÂvÞ¢Cª×´L)m™ÆgÅL«DЦ88.¸$‡3ÀÊ€ bî¾ÿ~ÇøFÁ‚r©¿û]näñ€ñ{ _È̉…»¥:v8£f·~ p]í÷ci{Œ<74sf‘8 YœÕ­5ÀÔ¯'ß´¥,ìD"º0ù±°`’:¢Àa†W{§šmЮ՛åå:/ÁÑç{–óboßùq†X‘½Ý+ Ú+D½¯¤J—ãîK×T-–”tâ!ŠåEhª“X#Á#;ðý>Ê qe*%cyo«{Áka£+n_Œ¥,ÆÛ£…¬Àq‚~oÌÎÓM̨ ×R^ž*šÚóƒõ+rî &ÕQ>h=BÏNnÑØö+ìCwB:`³‘`u•Ðóž§.3Ûúq‚ëy»m·zÏï½(„£•M¥1 -{ý–LáÈñU‰.oü»óFìCÝŒ‹k-â&í¶ª×Ŭ‚WtØ#b¾;i,o-ÀªLCEƒMQ.aìâ¿÷¬¢ÐÆûF™èñ7¯A?RßU±åÃ(“ýyý·Þ~`é2âçׄI@à’”­ ó÷ªmÙŠr‹wf)ôüWî}‹`Q•’*ÊŒ2 *å½&Úª%¯còõËUqCLÊëd’,oh\*ô/€(Ùª©HæÏò¿. —9(ÉWUÆ9wÔ.©7³:ÙSv¯X•¨ÚP%ÜñP—vöÝæZGë£b~7)–Z1òÍÉ¿ÙÆ#…endstream endobj 355 0 obj 4934 endobj 359 0 obj <> stream xœµZioÇÍçE~ÄÂìY»š>f¦r>H2%3°-Y¢aŠà¬x‰6É¥xˆ”ü÷ÔÑÕÇLsWRb¦–}TWW¿~õº–o§õBMküÏÿ»{2¹÷\™vzx1©§‡“·EÝSÿÏîÉôá± š}Ý«éÎÁ„'«i§§­³ ¥§;'“—3U5³ºj^íü§8“M防³ÃUs;û¦R‹¾w¶Ÿ=¨ôìY5׳lߪæÒñ¼š£uÝÍ4X^@Ö=t²èVéðU_³m´ö=˜}t·¨UC`JÙ–Öð©Ñ4Wèû–LúþÇ•OÆxC0ÓàX÷E5o¡KkîyŠæa¬2³oñwj|X‰tG·¸E¿âóʵ r÷Ÿ•öÊc;ÇHÍM½èTßsÀüî­q¼éýÊÎÞá‡#Ø#þr Ž(\ÂÍ.+3{nBû\÷†öNÑ=¯æÍl–áúe Nps஢Odðgâl¶ø¤ò#®°Gì…0ì‡ÍC»Ì}³ t¬¦ùNS³Ot„ä(ºq†.e!œyŽ`øÔÌÊ,‡¬bÛkøØ#JZš¸ ÿ¯xg‘á²PTtS»E×*ä2ŽžÊv  L[€à9n…W¼ŽXÁ1—•Ì|㽪ۼ1Dºq&yé- ¯§•FT4Ž•ðèLÚØâºÛá¥ÂõS2\­•Ù f lÓt¬‡)ÄBdO®Zµ@«ÉGOEt8°‰ÇeU+ ÛŽØMrñ‹xêõã*¸ˆ!ð0O÷å'‡,VäE $0FGò@Ó¥FZó¹ùÌ_ôFÇ%ûÙ`Ç_ Kº÷† m`PØfN ¥‹—¤\œ¸µ3ùaòvjÌ¢%91qS¥à:·nÚô°]çP =ÜžÜÛþnzy~µ?¹÷ÓTMî}ƒ?>{ÿl=ýËdk{úÃÇJ7¥ ê×Y4^¾ ž" †¾`…èò|j(H&ÅD†|I ˜'¬£ÃM¹Íh Óm&UÕÆL8ò˹ ñ LÆòÎ &Äóƒú<Qsƒ½5m3YqRdtt-¹ÉŸ³×‹ÚôH1”½6 ¹Ÿª^ÇÇ©"Ãî-£º!ôE4ÂÒg|Q¼ž04cC<®-Ê'aIIMFYá Ò;pžÈÇ™¯”3ä¬bB{îá­·ÝÔ8DËmOD‘ œ#3ólr'Q,€h*¦›ÃÛjLძ•\? ¹¬é¬¢ ‹F)¸-SÀi-T‰Êu f¸4…ÑÑ« F·ùÒCŠG· Õj@í1™ªûŽ‚ç¸ð QÝXÜÑ9駦v¸ZDÓaðÄw«Î/d5¯ÓÕªëŠePðàMíB h |ð”\ñX´›ôY¦Su퉆¼‰]þpŒâ5ÂÓ¢K¨­ø[fjëjš*o€ŽÁK{ä…p¡®“JNHÖL v”!=Žò¡’ž'Y9<Ò‰‘@lªXI’öS´ÑPe쓳S¨rÙ2nç‘ì¶ù¨I¡>l”.jYXd–ì!ÏoŲ€îë´, ]=J;Ú)ò?• ]‡Meª ƒãL¾ŸÎQ•«È$º·(pGoý˜¬ÐMÿ¶n#qìñ> š7óÐ9†Œì|®´øLð8 ežb´O^{¢©ý[©j$ÅbUñÇg䆳ÃR0G¶œ“,E¥D•´Ý„÷_áʲÿ~O^z> y2鉑”Ð%Ñ Nªªÿ%oñ êËV™r¹F…ĖM3_w°·êV²’u.wµuR8kòz^¬à… ¤%ek,eæÄ³ðÄ¿‚düÒ‡‡S%Ó(]éƒô‰'&þ &¶ðD~–/žfK *„îç˜.Á‚ÒŽç|v­ ÖFeÚXR¸®4QÂuÏoÞÓ!¢Â³ºœ#jôÜ ‡ËõóÀ_½•5å Ž>¥…¢ÐÝŠ´Ù€ÿh *ü«±| Eô["ŒØ‹0áKã.SÎ2á–'föÜ×¹1 CÙÝÇžÂV6U£ôàm*Í¿eðãǬ$™kŸ}õU’¤ º’ÒâXŒÇÍÅ>oG¾ž*¸_ °¨'ê³oœ|h@šJ¡âo,¹áBŽÞË`Œ¥³¡*zÔÔýì3ü|†_fÅnÃb>Yœã þ`eïþ~ éZб¶ Ax¯Òïh¤ñ<ûžÇ7î±s¯CÃ{YÄ&£Þ•¦&öp’âÒY©ccÜÃ2+•Ú¾£ªWŒÐ›ô ÍâÙQ Æ«4–cG/âÈGL¶_ØPöxçlÇÚÅNl}1€Ÿâé‡Ý‰M÷ÂG¦,^&×['üXËPó¯ý¬|½3p'À?|³Û(üsÌE`â]ÇŽcBÛ;º6wÏr$â‰ÌîÖ-¡Ž{îDTÄ^•Pv£áýìÔá1䟉%1_<õ}/ ‰Ç¡?9‹Ðø"žu¬æÅ‘Ç%Ÿî{ŸzR„ãþ¢¥ÓÌ=ù¸'Û3ƒ±¼?•2áQ*ÞE:€Ðê ¸=Z“ /â¤7|×`‘ k[‚ÀËà‹€¥eŽŽ+ÁÇ_”Ý&~Åß0áúˆãã@q´ä!Þ,6ô ÉÒMz_Øéßá£á·ˆ’5=#žzeÿ7¥3»ˆ˜Òaè݈ÃÓŠè9)5ÆéÑK÷]¹*á©›L\/ÙEzc†îggGn±¼îéd| |a\!Ÿ@N fö`¨f¯"•$Qüƒ Í Ž¨£õ(¸ôW*Ò˜ý'ÝŠjZ¬—Ù(O¦³ éf?樣tgbÉlð鬨›õ(¹ˆÐ½.Þû½x…÷cx^ç™Õ3‡ÎÜzèz)žºÞ^ªÀ×Éc°ïuœÁ–ò„sô è<:_.¢óð#žÇûIuøñ*tdçAéÕ-‡§†J*b ,e@lí‰Êv sÑUÝ’ÝŽÒ—%<Äîß3` \”l.K™ä‘ EWL^«[XC¦ï®wþxCº?Œ™ýã’\*Ù—f “]‹…,è‚û6ˆºqvöË&"h ìÛ¡l»UfýR‰ì?ÒŒ¸ã_ ƒÇšLÄßç•×d<𬤢’˜Ü•¿ WÂw-”޲˜Üëç$KÆDÐMÇß'|¾Þ£e©ñªddr’¬KUº·ø…‰ÔncI奒2<Ëjï:’oòÇ9¿o¦\öuŽ”¦kÃ.Æh‹R#½Ð—ª÷ó<Ƴ ˆ'é˜á£Îßçe ƒÅ÷›Lê?15Ómà*hCã<6F¶Ë9FÞ2ÉKbUÚÉeIlzÈ–“×ÍY7) ø-j$¯Zþ°*«Œ¾uoLžþg°UÀíÕÕ-ïÆ”˜P®Õšþ†û¿É^;ñyéùöKöÔöß…OOŠ :jíÐÿ‰õ·dÃôý ÓÿŸÄ&“¡C»?8nîœÉS⇟òž¡7Qh"Ü GOêì:Õ ÞΞH$Ÿ½¿gAPe¥ôÎOÜtÛDZLE|heó“ôÒuéô²•Dt&Œ\šT,xeÂOvw[á^>žÅE²[,%"h7õšÒ_.þé×ðˆsN7;ÉF¡N.MBÎÔ%åJiÔ`ae 7ûЇÝ^x,*‡—±Q…Ƭ²AiÊñzÜøkœóehü26Æ«3úž —„åýK wÃþÃ0ÿûWPŸ"¡’@ÔëqT‚ëQ9> 6ë×±, ÝÁQëø/¬}¸2/EU|É}Å£¼ŸúJãþÃ俜ë„endstream endobj 360 0 obj 3772 endobj 364 0 obj <> stream xœVÛj1}߯ا¢ Ù¤½ŠÐ‡BKIIë.´à˜à:±cð%YÛ$yè¿wF««WI‹±v}43šË™‘cš±˜âG=gëèlÄò*^ì"/¢ÇˆÉíX=fëøc‹"MP&¨`q;ze×<®š"c> stream xœU»n! E{¾‚l3.w£ÍKQš(JµQ¶šb•ÿ—b3¬”ˆÂà{ï1p¶1 ºF=®æjÁTíéÇD{2gƒ]¶£W»ojÉ(­À‘Ѷo³…ÑNd뜒m«ùpÅ”Ïö ‘9ý‹p‘HûÛ5øìîóœÙí€Ü xrMûðaŸ†'¥º ‹¸DÆ¿öpÜ÷J{ì­h K…¹Êh’]¡žÖ ̵#‡~Iv) $“Zdîø*Ѧ<+^¼˜Ü£ž{sŽ^PÝUŸ8&.0×Яû¤uhæUÖ/"'Rendstream endobj 370 0 obj 242 endobj 374 0 obj <> stream xœ½ZYÜÆ~ßÈ_˜7;H¶ƒ<È– ;q'Z?Vk¥ÕI#Y§•_Ÿº»›ä’ƒ`±»3d_UýUÕWÕýËnèÝnÀùïÙÉgÿtaÜ=|u2ìžürâèõNþÝ{¶û┚L;?ôãèÇÝéƒîìv“ߥ)ìNŸü´ÿ²;¸~ã<ïuß{ïBØßí†~˜Ó8·!³ß¿î\}óþ>å0ŒÓþewÓÔ{ àX!ÌÎÿûô/:}ì§yr8}J} yÞ~wrú‡Ÿö7±cêç0ᅥéÜ<ø8î¿…§ðy ûSšwÊ0Çml _²Ûÿ€sLit4óÐg7漌mÇyÒþ~tyŽ Ü4„\7–µEÚêóym¹wãàum0wD}Œ0²ß¿‚éóÜÄ=Œ÷÷à÷uèýó.íÐÃh3ïÂW|ü¶ Ü:EØ|w> ºyÜŸáð°,nŒíð<92À„.†2 5} â[ûw8®Çf´êži™°2øïËpŽ“Â—p)0;h'—64ðh_½WÉøÝ[ä9Žîdq4YtìœÇáfÚ8µ‡Ýa;os/\Ó5†¡à»Óû€¾§iH;÷0cáKÜÿØéÃê=4—±iY´7(4òÞ€À ZNoK §ºŠð*Žóó›Á#,Å}m2>/»W>²)LÏg’‡ÐÇ#vaFF?hoTÉAtrü¤„‚ª!͘)èØyÚUPZá.$x\𒬦»+8DÉñ3Ž5~ˆ¨â™d¬ìÊPÖr‘|žV€G–ã…©>ÁJá-/Ÿ¦~{è©ËßÑðÊ7°3uð).{¦e£8fU#i{‰£{b2¸¬õÅè‹à&}ge-ØÑáYHTÛ±|½h³I%QZ{Ôhªá"zµý/ xSPZ@Q:V›+HöL \¤AtdD´@“¢½†Éù‚kÁiðFN•a:T”)tD5!N Q@ÇöºNí¦_C"›úZ}‹öºða$_ñ€%øÕ¨Ø2 7h\—{säÍ<4ƒ „ w—­,ïnêV<áÒ%jnÚAwŒÛ@„ôƒ+DT“çM]ÞTœ¢haR0¸§½jSÏ땉¯ó-Ó4ЦßVºr,NóÆL¡t‰½HÒOüò:A|$k)ÛøŠÙ[VØîÍ,ë°¸iX-•é!xø(Ü‚„ƒó•seg!rºØä`¤å WE²"²jטfrÝg$Þí<;dV≠2ê♺WsEáÓG-f‚ymÛ¤˜,œõz$\^½[ÏS½QâɛŖ7ÌÓ¿ƒŒ,à ¬8ˆ'l‚#?g×·½{p97YS²µ¯ÙøoTÄ'¤Lûª(=ší‰Œ¬W‚÷h‘ëÍ‚œ£:pµì=`¬FüóZh±ÁoºŠÃ’”Ux2ã?b‡‰Öx«‹kO<³µn|T»¯C"-wg¯Ëì· š›ûN§]>EÃÖpIŽ?Dðxj­Õ^òs†|Î1'VÉD;Ã+c4À'Fí7 [½fÊQŠJòCsŤÆB_Š!òdìÄY–Ö‰ãÖ·)SÜÿ ƒü€K2ïk\‡ž¼ç $+…5z ÖÈÚ0P¹BÈœ'P-Uå/XÎr‚›ÖÞПBýÉjq^Ì¡Ðå¸Pe²ç̲ÍüqÌ׊c­|¬Nï*™uâ ýjÆ&±±) hvœ¢¥q覘īÒäê{xm)î›â¬Z.úê&– ɣߢÑâ£ãÈUË£è[J…Õ4I›ˆ×zíjŒ¿â^(E$D£5ùPpEŽ”Æl¢¢ò°ÁÉW{ƒœð(½…¤A쳩JXJ_mî§Ìš˜å?õ<¿–EÃ5Õãi0Ÿˆ>+D[Œ–ãʼnÔ|)¥Ä%ÓJÏLŠ^ð“;·+­¢NÐJ¼Ç¿[y ‚Œ’˜Á¤hG®ŠâÕÎ/Àu·¥hÒx)Õ ˆ+ j‘¾& ey…T‚¸kFiî"!‡Q¦Ã¡æAÅ×ç ÂÌ0ú±²:÷a fQÈÔ~„•¸‚!ÖÈ‹°ƒ†ìWáQ2Ú"ÄêXcâlª¨µ§Õ!züÕ­% Õ´éÕLsEf•°‚hÊÖˆ0­#p.XÎZ#3ï‹rü²“b&‹â”ú"tžlé !›#‹˜Ñ—´c9Så"ÏcxÝT—D-¶î¼T¾Xçì$øCI’Aè*­}n^»d{% njrx57¡š…‹Ôlðæè¤Ca”æšlà d`•K¬ÑõX¡t#!m ¥òÕ”‚[‘[ëß$_¦%’!ÌrSoˆÃMXûÉôÑî9mÅuöÆ Ñ¥æyl“×àkæv_$šçß v꣭i"-‰®V”©š*’ÂϪʈrdªÈÎU®¼U…˜ã¬ :¯‹ZT²:¶`ÔWù…<1ª±:ËfÒxE œµzp¼Op•‰\Ö…™ùý*— ŒMSÅ¿Ï9ÀUÔÅ»–e-Œ«{䈞Q¥ú §—áÓdžË)R¸\ówôá9´½‘uÍSÅvsëM@ Œ+ÖAëÎ.Íæ8sj&£}=jjø^™Å\³-«–h¶&AUs¶>xcðRGžÞF*P|£S>mÍþb97frk‡·Í¨9‘”â€ùÕmB&Å€R—Éýhþl‹Ñ.òòƒô8pù{ÝìŠi(cht1+Eõy«„ ŽÉ’nܹ”JÞ\m‡ª~Aøm&W@¤FpeÆDên80a“‰Ëà†«É&Û!´Uî­‹’}¥@Kº$nÿ'•7UÓ¯&W_p5¤†6‡œ:ÙºìL¢QmZ™¹/êL-—¥LüÐ|åiÊšWÈÂÏâ㪪%ÏÊ;´þBÒf&,©¤Í­ÁK½z´Bœ= Ì*,›±’}ÔC¼E˜¨]ClC2ˆyÛä¡.Æ©m&FµÔ%m…´’ª{`¦s¬ª°!†r€ý©„ÖÄ?Œnl³ãÂÃQV’Ç]·É8ï:­hK›‚Uq§¼ø¼“kaë£þƒÇ>ùˆÐ{ÌàIèßsxY] ÀXnÝЂ“µS Hž¿Â·WCNÝòzÕô÷抌.ÞW§ÞÔÓ/ÛQ«ãÂèY"Ú•áe/¬cÔi^à» ø›>anÇWzüe5 û¨!&öΫf—ñòüÊÊM©®¯@i D*úÑ*7ׯ4*G|‰o«D®ÞàGÏôô´›C©}×Çîê&>(Dî³ü5"ó¨ ¶I‹)Ú—T × 5!E’N‚ߢH—…Åþ–ÚäZ?°'¦*úO\±´稜|zo~ˆÏÖ§ãMÞÒô!ç:Ub¼ б ÉáƒpñE õjJ·Ñÿo!ä(.ÒÅø aœ,„œþŸ`aéîZ3~ÐøÉ§Êcu3èEñõ‹‚^UTiª|)ï!ãþ"§OÞÝ4›*ììøHù[Êÿ¤|i'rš2qø.Äoª£,]œ°¬J¸ óÔ삜DɦŒױ½tݨ͓%*^Éí“‹y¯onÓ°E羺oSsÌ 4Q ¹I!ñ{sëतv«¡’mE–̲?·É-£Ó‘TrB÷ÕæÉŠ>B?Q6ë¬/úõ!}u é~[$Ó”¶ œŸm"NG¾j»Ü?½®¦.Pj%[‡ˆ4”TŠ»Ìþ‚S²y2ÛàÒ5é>µ½Û0**ž\30ôÉ™ç\Ìõ´[Ôí*O N3o\zä*Û,¿CÑ×|EÕLnžmœÍoƽp˜g»ýSR"䂚«˜-fV9qàûv²^΂Þ,”os6`>u~«w=äMsX?–³ö*a6Ü“MÃW v„^-6Ãø!U»½¼ôŠ“Y„^9˜¾>o°Àiáì ßS`T…2KE•–Ó¤€ð¹Ch÷%HwºÊè®ñ0Uƒbs¹¬=]ƒÑ*ýEæ{i;tQ¼¥l™âƸUü86^4­JKRN îõ”‘c4[LU£þЭ¥ª¥5œõÝ+•$óÕ¹yFÕÉf>gà)µÒÄÇÒ?w~QL°äÄd#¯h+Ø©ø»92‡uQ”ý:'8±d·v-l\–¼ELÌf=¤à£ÑeáÛónhÙøX¡)YÄK\^ß¾ä )Y/¸žš®:¬Æ7)ï_qˆ¯ðÏ¿ðÏ÷ø¯Óìÿ&/ÒÀèÏð1°KÛ8“£µ àʵEjm>+Íïñ*\ë]^ ãžÇòÌ#’oeòÚË"{ÿÒ>n¸ª<|؜ЛÛå‹B$²¯ýwö§Ñ@%m‘båß&‰mÈ4k½xÖBn…é%Ï»û¤Ö«¶|oßÕ >|YÞWi&òT÷õ=Î4äJsÏQPGïíV‡§öð͆à›ù‘w8ÐÄŠ`Æ€Âó©¯NOþ?ÿÿêiendstream endobj 375 0 obj 3629 endobj 381 0 obj <> stream xœ½\[Å~_YÉ_Ø7¦#O»»ªú†Ä$ ˆÀ{‘@q¤¬wñEÆ»‹í58þó©s­szºgg ‰ñLO]Ïõ;—ö/ÇMÝ7ðÿ}öòèÞƒ6öÇO_5ÇO~9jñçcþëìåñg'0$µùQ=5S{|òäˆ&·ÇC8îÇT·áøäåÑ?7mÕmRÕýëäï0eŒvJ˜Æºëó¬“ó<ò¯Õ6m¾¬ÚzšÆ4m>­Âæ»j6'ùyÝ4mê7ŸÃ÷Õ6Æ6?61/^WÛ6„)ÏÊS¶1ŒuÓÆÍUÌ#bL›¯fk<„é=NÿŽ—k`Ë6Œ4ö›*À÷±l'¿ó%ü½·|‹mlê¡&º l¸yVmûÍOy¿1Ï뽨bÈßÓæ]>óæ×*Ÿºiúns™¯ñªÚv›ó<«…ƒ› ˜{šx™çÃÑ[œù:ËûÁéá‡<"yí.Àšqð—Çð>Ñî4n®aÅ+ø§6o*^÷’Ÿå1c>@ÓâaÏ`åL±H×8•3‡³|ÇÂ_^Ãä1¯6?gæÁ­ðOáyÈkÑd|v^΋ñsÙ[§Â:ïàù€ËÂÐË ØcW‡aÙ¹¨BdˆùXÂ=XóyžÁDÍÛ ò¡C:tyÜ0àǧNx–¼Ð™~…µòõ€}0<íð„eZÙ½|š-j–¹›Oçž’þLϨáÂ[¹ñ6ߥë›@?*Á-Ÿòm3[`‹0 ›&?Úæ¯Sþ;o¦„Ä…"™ahóg¢] ±¼‚ŸømD`/ò–¢caè'>=Ë‚]åMFί„´€cŠ€ÒƒYÒ`4¡6Ü^³YH<ÙébèèȬ‹@ÚÍUU–¬r½SÎ0¶N1 ‹óAƒ&äпñ76ÊØ"|FÊCX„‰E \þýQK¸ÜæIÙðÒ ¾¬âç‘»… b ÉýcUwp´„z'ŒÄíQÄ„(bÝ4=€¤¿M®åæ?Óch‘¾p]•Á xžÄNÙ[øÎJ4媙ð+t¨X·e9èGÓö@qþáØ6àŒ±…Ýz± ùD,ZIɉ74|ÅÓËMó±'™6dÅÊ—éÐ×€‹kðà¸ÐϪæõ"6´)Ë7Z²ìKš±éspÎzG–}€¤: ˆh¥»£ƒW̦qó¶êbž“”ç×K£Ü•2d|aoÈ}ãàHRÝ_EŸYx€¡YZÀF$u¶ÍKÞqHL ç³=ÖÂÖb?™[$VÃh…–&£éä4@M0nЏ'ˆ~O7zô V‡{Á’:›¥½eìiÏ«rÒKufeß|¶%º×ŸÉÝ2=¼!dŽwi—ã‘l9H'XÜHÎ}n±:KÌa8#Å$»ì¢£úá8áì36‚wd¹sò«à{öH"ŸËà80<Ï\ËøºÄ‰u¤+çTĽ§¸ Ù»[Êù/-ê€@¯¥«üÆX/ï7ŠÎ`Ü•„0—&¶Þ×ÜÈŠkEͺ8Þe›¥7,ăa$Å‚­øâhÏ¡ÃóCâDÒ€Q)Õì U<¾ ìun}[CÀR0ë88ecDÑ¡rññDÀ¨fbw?GþäßyÏ wîk\ÿ·¼÷GdN¯›ŒÝ»ªãÏ'FoÖôgPä„ 0=;âýðFÑ7x‘ý`‡nÕz˺,‘:$\lPÜ{zãŠðñ΂€í‹­ ñ¨+öZtgï´¬tÍl@3èl‡áQ'‡"k›NÀÁ×`‰JßSÄ!à„²õ…Ĥ޳§aAÓˆl"ÍPÐ=þ!ÔM€¨L8wÑéà±ð”øêjC´ndxNâ•õAÅËÚŸñÁrdVa¥Þ±]EÛÈ‘pXÆê¡ÎôyŽE¿4ƒl匆À]NIðè’ÉÛª€&‰ucmÚ‡†©Y,)ÇsÖiö"&“ Of÷ŽÛ©²±çÐHx*æJJœ"ë­5ŽF½†/»³ÀÑ¢™>˜ß,XйLN©·À˜ ?˾…[™PÁPÒ ¤•Åf ž ÁÀ93óU´Õ`i‡ÚÑ(ˆœÙå1ŠšÆIíc7 },³Í™¯ÖÔ«;Ò~"Y''í ŸÉPFåo7Ø&W2 ²U]’aškèföL ;ïâ1лJ³ÖŽ‘lέþžS0¯ù=wf]Aø™Þ¡ƒä(V¶s&@òTR_|mà¿È„•ÜŠ`.Û¨Y’Â0Ø8H¢­3šâáäL=a"žô}|@ÇNY]¨”ÐÉ›Ôþù^¢9±dù>.2Nš=Õ„ÏD²ºHÐ’ÌÖ¼ù ‡*êe¯™šbH¦©øXŸZsl>/ûâ¹Ê©s°Ã8i!»dR%„“$ãÎtf÷Ó¤9ñ•ð[³÷ ·e5'5ˆ1°ýl£Mqò^ p?Ñ¥e]%W‡<þ›ž8ª€È¦“V[ED»Ä7©$Ëtð"rYƒœãZhU| èmÙNÞßÀäÿ°›êJФ¡ŸôƒÐR77ešÙÅd”¢Ý,ÉÚ¢‰¬n4\ó:ÊÉžl™XAų¾É8Häúnœ½yV†›hw!å(V¡Œ¶ ªD)ag˜$ ªV ª|Εx“€Æ¨pEÂ2†2—ÕnœŽ›·´Fž0à¹-œ©/˜öa»èÁðZÎÑp"øÜè„­ºgxì”2Íx9!agXê fQ/ú:ó5…$}R}I"Nº¯ê„À¿2â” \â3QóR¡Ü0ʇÐA)ìI[S1bZNy1ÅäEpÙ£ÔáÒx_JˆhV{ÊœÈáÙjJ(‰çܦ‘À· ‚+ %õ‡â¸oò8øƒîõ~…A MwÞÔäïGj|PX¨h7?V\Š¿ûâ *˜f d’•/y+j­Ÿ@]æE½f’ÅÎnC0IÓ­2ä£à*6ÇËEß¹”°Xî‡ ó¢7¾‰ITMÒŠÛ, ŽËñ¦ÿ¦¥uûœ‰i¸s=s•®Wœ»éGŸ§5&:Qw²ùJö™Ú2U4‘ý°Yôc•Í9$ÄH¸¬:ð;¸Ü±ÐnY ˆ×X‹´Æ ŠÅRˆE¼¥±Ò¤‚ÒvW¦${ß½ŠôÃj”º)(NwàÀÃn!¿m©‡%λN]‡PžWRÂwrLQþP‡T^Y(ûï¢2Ít©NƒƒY_d¶üôÀµ„i§Ugm_i"’·d§D‰”³Ò묌½“ö8¨·‡çFâq{Ô:0܇]©ln'æ :f™ô™b‡¯g.ñ£R«(QÜNá› 2¯?5Ç"öõè^šû HJ6>ú¾C¨x6ÿÆ’aº r[€­‹ê ÅšÊÃàþ H-(0*y=†oËp YKï9}¢”äÌÜÅc) §Bòû3âÒO_;L ŒÔÑHhAÉ8¬b¬…Ê1ŸkB+*ÍÞpaùZË32\MÝÝ”lvŸûÎfÙ,†}Áf¾5õÚCê0aO5v`:ncPóS4@ µòË‘µÿ]N\˜¹•r½>×öP¤ÎÈ]|˜ý0—¤€ÒãBCÉü1Díćšî gÍÿ´¹-ˆD±ÃÿýXñëÄÆ_°«ò0cÉx,û[.îß @R,¦~ Ã8ô¶³òæ„ Ý"|9Yh74w7&”u°w¦M:¢îßX,§×rSIBð°ûº¤¼åçpÍúiT†÷ýоI{¦´µ¼æ³W³ÞCu–§RXº¥ëI¸èÍé7 M9—ó^ù²·šj ©ûÓ?a®É›ìÙÿJÍ A{_l>1¾hAø…ãÒ†Þ–0KÞ §.óJ±ëÉ›Ùvã>”H»:këÕ%ž­CyCвhƒˆù}U]õ…ðÌ zhº6´ZÀ. _ M¾ X1ÙÃ$’†`l<½‡F<ðJfy¤Úù×Êûò"ŽŠ°‘ŒRM¨*$”~j®äÙ¤‹_;¹ "5µb”gUi·Ößèëòðc}x¯<¼§ …ž/-ôº<¬õáÓòðõÂBgnŽ‘[±(ógOSsfšÙë²||«—U/Ùèm!w Rж¿¯ñ¤‡”Äü%Ž'å*[ßR2õ˜fMrZb™uzˆ­Üy»Šåþ š½Õ$ÏJÔÙ9ÿÝùÂH)؇Eìî^LØé1]–þ‚çè¯ÄhPs {á^°3P@vªÑÅ~~rôüßìò†endstream endobj 382 0 obj 4525 endobj 386 0 obj <> stream xœåZYoÇÎóB?b‘òf];²ÄuŒÀŠK‘„xH<"+¿>UÕ÷n/EÉŒ Ä 0Üíéúêì}3gŸ3ü‹ÿ÷Og÷Ÿsi懗36?œ½™qz=ÿöOç–4ÅΛŒf¾|9 ‹ùÜŠ¹¶r¾<ý8<|bF97 1 Á¥öF61§‘|x‡½®F>)áà“—ÌØáb\Hk'(ÜKJÇÅß—JäÕdåH^ëIIïæËofË/~¾ÃÙVkØö`“çÆûá(+„ÕpH-¶ž°G kœ"gÜ;_}:ÆOÆq¦†3\ï¸Q¶&Å$¾Æõ^iá†kšÀŒ6iczX•Ñ$Ë-“Þ'eF5ù¬?ùgH/•,’àj’Ê”„‘¸ˆ'I(¦¶Š«aŤ9—~àÀ&œ|2 T*”VÂû'pŽÉ;Çù°ƒä„°ÜÙa9.Ô$ —+¡|šà˜tÃSXgÜ!ÇšqŽJ“5 ¶á^X&%J>‚ØàœÄCÅ‹‰)édc\€¦kíš%—HT n¤Ž'WP9yæ ’¥C5 X'dÌï€? jåáfPßhPœ_öàÃ)Î’°ÀCñjhü Ç-ÈÅ€Ja ¥‡#n¤´m^p€c†&öQ¤bò Rƒ$J”"}åøD‰âãðD}ØÆ 4ÊÙm 5âó%jˆ†³}F‚ ¸œŸŽÂ#e•ùLðaÓH^ãâøBsW‰w˜Å¸)”ã¡PÚ’ù‰ 0ñå ,û¾ÈÓ*ZHe `ÃÕ( Ü7‚¹‚D‡‹T.PÖ°ÒÚúZ½Ô°N°™ÍâÃ[De˜Ž$¯² Âb`¦Ìäá”H2(²L ºNß 3‹4†BXD),¸œ´a"¡CJ ºó‚ *¹¯! ŠVó…phá<¬þ®>ÆÇ>öñq‚k|¬ÂÞ Íüð[üü2O¿Êh¸Ìcçø˜ðr ]SYF¬·B'i%ZÁ;¢@%¡(9ØIÄ%8²3ÂDR“r´a†phPMûd$"!­h‡žµ&›!¿ &%Z8…édž¸-—•Ùœ‹—}È,ŠZ‘álÀþãlY*r"×ÑjÀMªd5•$ÙÎõm,©ƒ—L¦á‰\jG\f!]£*ˆNò^·B”“¢I´sú æóvaã2yM`iA”sßÞâÚh>$ŽÖ|V ^ ³@Cò&(’ãjUëá_#é€N’AZu] ¸¬à˜ú¸æ+/Ðùz¯¹H2ML–‰éhɦ»ÿG|<øî!üÛy4ÿÍìñÎüÙön[[¿¥nÖ£P$CM·-ÒÛÎ+VýâS𠵎s ¯=˜$µrQ`òA²wXS}Šó@Žg oÔáFKa+çŠCØù¨QÜO|ó8… a§SV¦lã –Hàb–]oÔDù‘É}ˆ“@Öz¨l ý|¤ô1t“ðSUÛ4÷È’¨ÜãU¢Lî«©”mkiÓv6bo¤ã1œqQÒïÃXÅ®¸ØÛÔ*—N·)”2©t‡¤_ŠR]bÔ‚R“¦¡’xrŒ½}v‰IçFàÖ6ˆañÃЛ™îÆäHù-Q¢´õÖv^î6åF@Õmºtòÿ«¬žëy”¬aÔçX¥<-{²&‡FfE&䌻CôŸÓè˜ÜSÔ­J¸ sÌ=dÇMÅÚkW¼¦‰mµæ!¤ÕžÔˆ1>–›ŠÍÅIðC]N†éçn!ÍŠâi½XÞ«Œ”º:ۮєovÛzmÔµ‡÷©bVö¬­×^âö˜h<ÛÞH-±ƒ¢1V]ªjÎÛht<[5P³1—Úu“?´ä9¶ á4Ù§e_Ù¹×ÈH%³xðÚTþ°·ÍÊ0Aw7‹%7â›)5§/ ˆÑQó_ÁÆ^’±¥ÀåRX@óÆëÊŒŽìÄ•uµ•w¥†£†ùé(Ylµø¼ªÆöqßhšnè»ô’Ö;§š…ê/4Ì+b¹šê¬¶K©h[—rÖc.5_o}¥Y¨tÖ/Bo äÍ6}R|b»˜s}¯!1ÊUÙW•¿iÆ“ù7|M5¯mU_iQ½.‹«°Qõ)Úðš4G‹co*œ´cï¹­ÂKm‚²;&èúòûQW„}¼r”Ðt³m2Uæ2BI¥¸ ZßPª‚Z>¤©EQå ½œ(Ân³·y[0õ¶G9ÎUÜJ®qRc¿õKÁ"`]ÃWØ*¾´Íë„'Ƀú§"]‹¨lfeª÷°v‹š®wœ IïÒö$d/áÀu „Ÿƒ—Y¿â!!'¯F¼SŒ-*º ÝhEÐX»Ã¡c¦Koº©N÷‹¹I³ZÛ†è6-óL6’– üu9ïÂsÀÁÔ†.–m^¸æiÖ²çÍkG,L£Mt1¦Ë­k…óHØÇ.ÛYLÃñwu3}]Umo~‹A¤eÕE| Dw׋H²½¾ÆŒ—’G:au‘}H—ÖtàoÆp‰]ÞDhÝTÓö—ážûå˜n²ñܧ£ÇYñ6ümÞå¨6Š4ˆ>V0"¿—OÊÌ“J;yp,Woy°Ü³×»§×‡ÑQ3^-?ª³š4xÑÜï:¨×(Ÿ‚hg£‹ÇïêR þ! ¢rãõ?TËÜûêw«¬©ò;ƒ³,ôpŒ¿ *}Œ¿dbÿÀ¯ôvgs f1rø6O~Œ±>än<²Â®Èƒºhò~ü"rUE¦J?äœÔbMïÏòàaOG¼çyðe¡ ”´ A1ó㺺4+F븺€’yÆÓ¥÷÷óGÒ[òªáwNw¤³?çÃÇøÀÌtxŽGà<4ýD`°y¨‡3ª‚>K¥¼êm_ÌâmݬïXˆÊ8û>UÔ¿8¼#U<̦’d/9%-ƒËùç-û'ùýNÙi™w‹9õ)nnÕóë‰]»Î½Æ#¦ŸÊ`P˜8òOmQÍj¤)ßÇyÒíÖŽ>s]þr; ò²vRÅãëFÙ´Ê‹:~]uU|ÜœºÄdT-^!¨œ~oEÀ"Îkë¡»´ç§)ô…G‰‰Ëžk•¿H”t©JÁN»ºj¾J{É(”3ÙÜÒ¹b‚9¬ŠnJܳ­mî(³ÏžB¹õ×È™eÿS!àa~ÿ¤ì´“—ep·,žŒô0tÑ`¬Mn£œË‚ .{.VTåÔa»Þpvc YÄÕÿ²EŒ'ËOv 0䯗ùýU­Ë^¸¸n ²‡«.F~.‰~ÄÖ¿§ü¸`¥{£k±.Ôc‚É@UÁW /1m*Uó^|Þ¸_šæSAÆê:÷²h±[0w‘ÑIÖl —Í\ï¬=^¯°O=ë1Rp}Üã®Í9†Š?]ôz·(â«EkáGÖ¿Ä=hà’úº¯º|WðÔÆÒŽ÷[å¹[~å/8þ%³_⣆šZçŸ!<›ý*%mçendstream endobj 387 0 obj 3368 endobj 391 0 obj <> stream xœíkoÛ6ð{~…}¨\̪H½¨ûW·lI›%.¶n†ŒÏ¥Ðci¦âJ•º‰0ÏÝg½¥ç¯ªBïa^wáÓØ®Ãþ × e)-*RQqT $¼½AšÄ¥¨*‹’zéègðx¥ç€“'eô¾~O-ÌH?ì'ðúF&• Àmª)ƒ#wèû¶ë< ÎõPç¦ëÔe•Òme¶d;Ï òƒëüâm¤îü@×ù¶e"»0çtÇÆï®ó‚:Ï]ç§ÐBcƒYƒþ)ñ½SÍ2ú'¤N½óNˆÍ+ÛÌR]z;Ã&ÛÚ)/å˜9¢æMÆ–S3vMØ©æõ4V½,cáøpÝñωc§qý@F3 ؃-¥Œ`ãz‡š‡.kö"Öµü¬ìÀ ©‰²üd#B¾óÎi&v;õ ”•‘‹Ã-·Ø3x} ]x¼Ðª+IK­Õ¢D¿›eÓ8/­Fw׆—±äoðj¾îÀcXÊ\kj»î pÞ Ô¾{ýàÔ)«IÝBâš÷+Na\ó¤Á48æK=G“LŸCZ1"QÙ—Td³ó i•3O´BRÎ62•‰æäŸš9ˆ\õ:;ìÁŒ”†°Rø9ð‡Ð™•`%•ëÐ^C¢1AÉÍŒµhèßqhÐ(Iø9%íÿ6IªöUhÎWI}¥üÐu<òTÚ\Òsï`묄¸9 þ›X—‰ŸÃH,ÕþóÚiñ ñ0×yL„ ‘çY왲¹ŽÒq/‘¾ëðý™¹Ëe‘_/u0²ßä7|OÅwàC€YU¥P¸qY <Èo4€bø&§¹EÑX\Hƒ5àiÜeÕP÷7dÄ]õAO×s¤p8ùØŸBD: ­>užsT93õïCü‘Gm6';úÆ#KÚ ë®çy,Ñ]?o xŸ“¬™”€wìõYc`§8§n./`˱ÉsxløòºÝÂ0‰,Ã0S“u0Ì‚²ÊÝÀ†ûõ94ü¿Î0†S²*Î\dçÇ‘Ëà;½ïŒQzµ†yŒ'ý„xkÈÏl5Ýy·3]…BgçÌgáhþ”C2ÇÑìÛqAz㹎Bó•pù¥ÅøM¢g?æh@Q¡¤ÆšÈ*°yx昨P¹èq“à낺ã5…vËSÔ†ñQM * óU-1¸G¦¼n}OD¦%?zº+  XnÊRÉ«Ö{ªtÓоT+%[cyKLQ R¦F)xü¤Š`¨»ïñdÝÉ"út3MŒ*]5ûÓôŒ»I&Ö©s—sŸ^«1}ê?h–mÂî—¡Z™dfF£7gIá9K8ƒ¢8¿ÕBû\…2¨ÎÒJÍ)zÆXû¥=ÓJâ³-k”…­¶zÁX)°Ì¨¼§ÕH'oÙO é âiD®ÐU(r3È)73ˆgRÄ·,A6°zma!Õ’Ù! 8nA õcl–4;‹šÅYbÂšç‹ «ÿÚC·Áe³Èé ƒ°ÿŸœ23jE¶ˆ•s³—$§BÆ¢¸]A òÁ}T¶UfJ3š¡lôÖ2‹Í4(Ô>,’ñnä»;ñ倅ƪïþ&«É~}µÒoc¸f¬zÎô|Â/Tn÷­  î»ðWA+ÍühfÆY³ Â&AXßÎc3§aYpÞ²Ëf¸¶›·ÉÖò„62Éõ«o Áµkm~£MivÈU^‚f‘ëQJT¼6ÒþEÒaSF– Iê1ä$Is², *Ϫ%µ¼’=kQVìÒ¾ù’D$¦~–fÖË]¦¼2LÏ·Q¡ì ‚!€ªÜ]Mš§Lš>SpCå9cšçÒú6„ÌCá˜â#̆ F¸FÂGb­.ygÐôÌ:ý»ÐF¯\çe 5›t¯oV‚Û=å8 ¤«Ë—MHäK_Ë¢‰²Œ‹D\“n*Ž`v8½óuîs]\ªÜÜ¿$K z±?vî‘€mz ØÜ¢“m_;N‘`hÄ„I=x5¹LMÅ€h+È ¥¢ÜÂá& Ý˜â»Íu3F»kf,3QA¥³v¢Ãùºóràk/{<ÕåÒÆ;-rã`¶7Vmré.ذ†1ë5Þ½ò»î}ƒur£É‹~ÆT6ò2šn'¤Ó»¬Å2՗̧/B»»RÍâo¶H`#B³ Þ Ê¬'_…0†¤H‘ƒî ÖÝuADÍÇ̇¨5XõŽafÚ‰´ŒçªÙ¡Ûù {Î"ƒÐUÇÄ£Á4æyš L¥ò5Áúª5ÁÔtuQ@ ³IMϦ|oxÛCÃßtˆ"ñ³E[åsáΪÑÖ’X@s•ÝÆf/LÖxªª\ÝBÙ,›S3#æ†I”nÄ ê¼óJ,¯"öýeÕìë#9UãI=ñpWÅÝ×S3D:–ˆ²½j¢øU?ÎL©ê§¶cjfÊ|=Å9Ó(³µjÊl:ÊPfxߣŒ jw™È“v'è`QF墅<ØùæÌIf£ÈU|ëiôXü|S½©EȈþ²oîÊRŸD›·"> stream xœÍYëO9ÿž¿"Ò}¸Ýêvk¯½¯~£!´Tö åtwœ*šð¨Ô„–„Vü÷gí›u  } $³Ûã™ß<½û¹ÏrÞgúÏþŸÌzO¸¨úç‹ëŸ÷>÷8L÷í¿É¬ÿ|¬—4B‘ò–µ¼?>ë™Í¼_ýª‘9/úãYïßD¦e’§EÂáV7mÞ6U2H3™ì¤"ÙM³"ë_‡iVåŒqÖâë4…È/“íT&Ã4ãyÛ6²¥}ûŠ11p»¤æ"+˜ÕLÿ¿ÒâJî‹+Ë:g’xèani%k@Ó±þýV»zØWƒ–ƒÌ¼J§D ‘)-™¬5ñ)Ÿ(nSHÈä‰êœB㡎X ñÏc+O‘¨D—m£ž»³r©mU©<ùçh^K®mÙjñõ)>j(¹ÈËŠ)GõÆO6‚ìP/ñ|íÉô.§â—‚GÛ/hå%¯D«†!¢o×CtCGzx‡jL^¨¡ªJ –ü¥~Dâ%­œ#Q1j¥ä? š@/KÓæ‘ã§³úVÊšû^ø×z^XÔ9‡Dhâ0½p@ëÍ­5Ž&I$_CiÙY ©Œx¢‡¥}r3ðûFŸÙ))=‰)=­¤|· ‹]Æì@Rß89$hÖ9èŠ4¿öÙ{uó_cn°ôÓˆôìî•ûãc¤¾ |Ë;ßcàosÏïRmZ!Û¼aÜÕʼn™—¢ñ•ýevCŸhÛià9™ãŸéÚP¶Í&Åë(ü4Zë • yŽKÔlÁf8~Oän¤àÊdTÉ Z™!ñ=É —´}U)¶Ä?:‘ûj½ÈÍ8Ïe?“Ìf ¾.¯ªÃ2yÑ9il= Ä™ â)Çè ]yŠ0ê‚´²§‡k-Œ(Ëï;·5<ávðw(ÓIAj¾«çwÇöIÌ obÿØPÛBÀ!Ã3ŒîR] 6ºl¿u¨YLSRBÄ‹X¾[PˆS ˜w£ÙÖ#Úk3ºÝÅýÅý¦èf‘¬:Àˆe€€’a]`Ž¥pv«|ž ]¦t¼n:Lɽr¶C0„_K6|U}r÷ŠIŒç"f/êcÂÎÖ¶3´9]â—+»Æ~æˆa±+˜X³Ø °ÎAŽú‰ÑüÔ!â‚€›Ç¸ÿÓõÂ+íOÅH6•úQz§/c¹ë¾f-¯s í®·BRèÎͲ¸ÒnT º¶”ý F1ŒîÙЬÄHÖ%fŸfUèªî°j,SŽ0Sž£U'˜?’i)ÿáÍÿ®›Ãë(.}B‘?°ÕK˜ÖÍØ>ZV¼Ä»ƒó[4?ò3‚ßÚÎ2Ú®z|Bû2ÖÍGï<Ñë ­œFãilSô­Aô¾AÛõuÂ>> ƒõ·ŠˆYlTIU<¤CÞÁT0ra÷c%¸žˆUŽyä;¡-á·]mi×$…ÒTfX7âÀ^¶‚Ÿ¢¬KrÁk$:;ÝPd|°xSz{<ß¡–'É÷5ÔF]ÆrϼëÄMíqònÞ”RÞ‘Ñ Ê]+êúúþðÚ¹‡9aŒõ^üÂp¸‘Yì\•+Û¹&ØÌ´$}ŽDND[IDúL1ŒÕAÄ ‰;›·úÛhDWšQêÕÈÕx‹ßYP65xÍ&:íÓÆ¸K{wšÚ„Œˆô–®Š1ãzÐXÌ0Wœû·Â{6siý\xiaFº´–‚Èã•—‚ÎÝ´ÇaÕëaû4£¬°Iˆr§¨~9X|·Úeð84GÀ­][ß~›"Gà›|×ù|³ò´âÇŸVÄN+6?í Æî® ù¸nâ{èöM¹ey‚˜[qpbpVÜúØø1öQ‚A¨ôžC<"‹~O–³ßkx‡ßú¢µ æ6Êá>@اC+‘k œê‚@/ÌîÞÇP} Ñ¡&G( ½úÙ¶³.Ú‰ÍËX= "ñàúRRf¯¹ê=Í Ò¬ð5Ž{ª¿ÿ+%>Fendstream endobj 397 0 obj 1741 endobj 401 0 obj <> stream xœÍ[YoÇ~§…ü¾i'ðNúœéÉ›K¶YNlÚ`¹KŠ”I.MŠ:þ}êè£z’Š%# DîöôQ]õÕ=úm_µz_áOü»¹ØûË·Úvû/nöÔþ‹½ßö4=Þ6û;À)NÃP;¨Aïœìñb½ß›ý.¸V›ýƒ‹½Wºñ«ÐøŸþK‚•KŒ1-œ£ö¶0óïÍÚ­¾lt; Á «Ï³úg³6«Ò¬Óƒo›µ5ªUÚ­lÞÂcxˆÓË$kZ¥únõ .ÿ¢±ðMk\¬pŠ6Nøº1ø5tâÓWxêó×{£aíںС‡iÎ÷ù1Íþö†hx‚_Ÿá¯´ }׬=Lé{Yaû}íZë:ƒ¬XG^¬­j{= ÌÜ𽃛¶pž×Ú+—Ô¦o;Smg{ Ïoá ØÌÀÕ¯‘ Ê«àãG7]ǰAßÁ«ËÆêVk¥W¯àf†m¾Ã¹Fõ0gauŸ¬²Ö¯¶¼½†CËcØÝö}ë\÷Wðw0]ZäØXä œxÈç8f›sH»¤í0¸ÕÝMi# úiEËm°ñšë\$S{oøH¯†^lúS“E&×ͼ}¶wðçX§Íºƒ;­B„ô«MãV»†èëèË1ü»‚/ˆD§=M9ÑdaÔÖ;ÁÂómY ìòü ·¼l@†J[º4.€þ‚~œrØã;úrçÂSÀÞa"o‹cHvnðüW è‡Hœ#-ù>ïJ«€ÝeÚ§0ͺ9^‰N1…üBŒ¦º£3q£$~À‹ ;⦷ ²ß̺´û2ãŸî!Š/¬TpOÜpÜép°'ñSœ|O‡[•»È†jð4’E¢“4 Ñ7ëL%üJªza·H#^q︆ã}§Œ0dO_eóõ2ž¾~ƒÖ/bˆGø€@qØDt¼kB‡h0hÚ<"ö,ó Éæu™ÙˆMÚî§šýTÚ²$A$$²÷;$¢OI¿hóartžxÑ ›<:"OÇ©¦à1ˆ˜{̨ɬY#†ŽL£Ä'ˆäùéŠyAþ9/CÖoÜêWr—ÊtRÆ»†ì£w«7EHŽŒn–OÑ«ÿ4|oóŽTÒÊåS²bï*Œ 3õx C~d~&,2° F Q†ìy^tLêI 8d‹hó|rú‰O:½4'…u*¤i{4MNªÿxY  hƒ&â*gêO0fCžz h1oc¢$¢Øv’Ëlœ 4DÜR°1ªtÑU=mÒ™Ò¤ÌÏڥцW#Ò‚lnâj“ó˜äOÀ”·ë±I—ã:ªÆ0Ž9ÜÏð÷1šÔ>‘«Z—QÛ)ØT}pGÄù&Û$t”K¨Á¸[å0ƒ‚d¦i$½¸ë#é¸âXq%DWeôŽÉköKêDŽ`á  0£Oƒ´0fŠÑ숓yQ :ñ¸  ðÕkùùjé ðqµ­9e¡%T¯=8¿½E`qzÒI€8²ª}ë´KòetÙ\³Hª1DöéæÜ%êþ9‘çîÄUŒƒ*\ÅØt H~ u#ÇP%U§)¤èg¤7]2Z14zÌ—IÿIƒÏÚóm§Ðâ¼£g;›ƒ¬GÙ&õ—Dmœê$]GŠ—Ìº%³î éÒRÚEwRùw”JܲÔWê2ÌÜ•íf´^>¤²vfÑëR€bç½,îb9hê,C‡ÌÒ! ²ìžÒQ m)òpch4ý]u”Ô=&a ¶7ÙÆÜàjOZ°„0z /l»a&Šºä1½¬ªUU’™Îˆ©æ¨ÂàSmŽ*!R ¢œpN†D C“ÙÓ(ˆ8ÑËÔh,p5´`‰sDÊk­[²lO)t•Ú†ää:&KähŒgL€ÀצcW_E-ÆÙ¢,6U³D »•¾Ä©q ÜÌÄË´.PÒñ±àŒÍqƒO٠ȦrȆð.›îI€ª2$ÃPªO1×2Ža,+JiŒ¶ËF¸7d²‚ˆ™·"©ÈiZÚg\&0Þ§§°, »åáÈDÇ0¼ËAÉ´닞ÍþàÒŽ‹„,XBQÆ]G> Øœ3JŸru/L…èä_2:8i‰ÙùBå(NÎõ#SÅ•"S4.b- €šfÙ]åÚÓŽÀ’ƒó­4GVÀoWŠ6Âuír…è5Û[,0Ѥj¡õUœÀ›³§œ7SeY)|%E¡«Ö²±» 83u;â7:3=G“²î:Ù*ˆxQ¸0µy–£¡÷€*ïÊæ‹ïXÛ¯*ÕŽâ›à„VÖ5ž<9z;KE ÎæGò 4·”Åc\ŽÄcÓ }–ÜÕ¸ßà–ä=ï:ÓØ KíZªDZ§UƒÌû‹ž–ƒ˜qH9Û’qIÜ-˜ëÅØÒ‹yÚ,2vlÅ\–¤)ôìqSg#v>DÚý’ê ­ "šÜ”)­˜ Ô0Ô÷¢ƒì ˆ›4Ó™t8öl¶\é]‘dèÛ[•‰±a¤ûH¦<<*»œç>Í1÷i³÷v~â6 5ߺAy.R„`¡Ú5 ܧº‹Â³³þ!]œ¯N«P$"}¶ªÐ-=ÜÔº{ͬ¨8“¤žËHðPç]ÈQ!*Yà¾u!ç£ç“Še,O [Û¡kéD×§<†vSûÿX2NÌ­Íðkì`a°²Pö° •¬° §3]ƒh‰ù®uÊ‘jzE ±Pñ¾˜õ}Έ~¡{bW¾H=™\Ï)aW ±A\Á[ª 9jÂ|b\¢ŠBç8QÊŒü˜Ÿi¬"ÚŽ»4‚Ég±y(hVºvþñZSUò&–c;Yñ Ø÷HæUL<òÎEÑ-ôwᢒÍe¢p)~ˆtêi}M®iI] É¥ŽUã}ÓÚxÛÚÝ¿N9k’]Õà:Œ÷ ïè8R%Ýy˜ÉNÐçŒ ásiÓØÅB…v¹Œoc¨Q8XÂMœ™£I M.ä&Q•è°ª6ĺ‰k®Î—ÌÀ“Tõ|Ac΀6ù]}7‘fÎvjæìØVÖ§Ø‘Åt•‚A,¶\(—u¬Ýa/j¡U-N”1#_¹‘ ÑLîßÄÌ£sÑñÆ lÒÒ±¹5k$f*³gúXTŸ5}ؽŒE5m.àÄZÞk]Q¢–žzÌÛX‡1‡kbÕTÚýê= §£úåÔÅ.«g61¡ü6Û(O~q‰nD‹–ƒ6ÕÌyöZm Æ, âX5À¼xI&L‹Ü&ðË‹[L?¼gÜbBÈÃZÓÍÀØHY5Ę¥22 É œ•3¦Èè»Êßm›ž~íJWQ8KÖr%Þ.I´Å&fîõ£WOªF¿ ù¸WH½˜SÊÔ§æ@‰7t-­E¯ÁG›NUúL¨¡OjèÍ5‹Ç¯ò‹'94¹š±)çdû–+Ãu­Ó“g|«¤« <üÖFŸÌEÇ §BZbSge ÄG5Í*}Ìaê+_XØE(yʶ mô A*jPˆƒm?*hAöò&¢žpG´’)'*ÿ”uâ-2Nå¬ù„©ÃWî ,äµç#ßËjJGù‡F¾„Z÷ È7r£ö'ó¯ÜC Ql;ï)XšŠkÈK™“NΟöBXêò1ÅÊŠ›¼¦À'hòÉåèUŒ§­qBý‹§®ËiwÍI§-mQŸö NÀÌÈqz@GÖGQHV?ç­¦ëßÖ•õ·YT7™”³¢˜/òàe5ó ¶BÔ@‡´ée©Òã[fä/éÀB_Æ‚í:ªÌ§ÇÚc¥*~?K º—¨–;Õÿ3a§#žž•综Õuµ¿×CÔàJçÎwƒ×³"=—Ú•È{YÈ;¯T7…™žÒß?‚¦¸¨3V‘N‹¿’TCV…ûe•¤ú,~Sf>σ_”ÁûgzjÑÿ^ŽxÅoB, Ðšé±ÆŸëbó×;š;ô|nù›ò‘Ú3ؾ­>QºÛ¨dI<Ä<”¥§2í_P•^ý0½­°šU£ºýË|ûYIÕš!ñ‡^y¤ž {9…̆è®þ`6<`æG0e¹}ÿlÄ»³šwceùõÃeéNäRû¡ï,ƒ©_ªëJç÷kñ.ÕóAT¦ä$£TPr\(ÁUÄ? î²ÏIà(œ}[N*ÑÝ,¶Žç_Í ³:Ò ÜÖ8‘ƒSCw8Ç›³ŒÓž¨ÏR|'Hj?trÏ8”÷{gÃT$„€·ò€"¦äæO,¦“9N¼“È6®ç‹¼7sŒºX’]à:ÖÉs®ï^þªÄ$Rôh–Ä.Lœ¦!¹§áZðQš#É‹-„è+‘#ƒ9J?/Z¸-â¥ç»d-™ä£9̉®\Nøþ{äw37X|YüÇõxjìÅ™RhSh¾—æ:zUÕWÜVD% Þ–Ñ£‰ˆS½>Î]Šçô¸tÒãÿÏ‚þ¦ãdfwAæÅÈ`(ý14~$m¡ò(ÌûU¾ •tzù¿ërÖq§ºLXÚ4©²rU Ħàf“qSý‡ÕYÜ!¦”ê~mNƒ7%yþïjn•õ8%!“è¥Þ×R$*^Ï=/÷½S ~*êæ°èÉÁÞ¿àç¿”3ù·endstream endobj 402 0 obj 4224 endobj 406 0 obj <> stream xœí\éÇÏçÿˆ‘£ˆiÃ4]G_‰òÁ`œ/Ö$QÙ ,ʰ»`û¿O½³^u÷ ‡mE±"DÓÓ]U]õŽß;ê/WMíV üáŸÜüÊ…nõìò Y=;xyàðõŠÿy|ººuM†Õc3ºÕáÓêìV½_uC¬_žüs«v]W~ðßM?Œõ8tëO«°þ:=þ,ý½]mâú.w«_wŸU›à‡ºilòqú{?u¹ ¤w±¯צç®Ç!ŽØê“ô"téAX?¬œK¯Ûä«jÓÀ­ó} F½UÅõ½j#mîÀ>}·O£…nºÔnlÒ‡zù™fùû‹bœc÷¯Ã¿™¢³dŠmtH”:Ü&ê¸D•±j©ep£m¹‰!‘±s«MhêÞ#uù6Ípý.ÏáòCº¤Y:·~ ?Oáò"Í K#5ަ7®íZøÎ¥%u„æ0÷Ä–}ø$?LŸh›!­½__,½?Ò‡'ùá¥>¼ÝG$éS}ø¼~>æVnòÃÜý\ï.òë¼¢£üð*ñiìÓhº›yžïè4Ÿç™>|c’p¾(F’[îý̨| üv¡n»&iɽƒÃ˜­°êõ#¸œìgkúí›1ÀíV9úJû<ÚÁQáË%ò=±Ÿ4+ᇗK3õÎxtqÆúzΜ·7áØ7ë¥^GKܹ°m}c¦öàÔ¶KS{•oKÂÊåÚõëb“¶ÀïWE7£ rûMUû•çKª\ÊA)®ñ]Ýxêwš5û×(ADßþë² ç™ûGÈÛC=4N@þª ˜éõ³àÉF¾ºQdQsq¢²Ÿrc9ÉR¼ŸÓ÷ñYN²U0jºˆ—W…ôóÓB ÀZ ê7d‚—y‚¨Çp9ZâÛÑ’È^Y©È}D:/—¦w±!Ï ŠÏlûƧ·`¨7ÁÑ ²]…4yR­8 ê$ßãgÙ;ª‚b†€m“Œ WxLëHÆRÅD„_&·“y›èÛ4|Ö—HsŠˆ3ø?4ÓÑ™€‚›Øô?¶À Ä禯ƒ©b¦Ä¤˜0·Eyb±ÔÓ:Ò³Sx›nΟØÉÒ×y²VŒ, ,Ø´J=$X–3þ0¤uÞˆÝ6Ó€ ‹+$šL-¬”’©úÈ×k0 Œo„m̲íE²`É2‘|Eäoè™ÈE¢Wr´ÌN^Ý&6¿3¡Aã14ÚjÀÇ`×–¹štXï#K`² ˆ>ß!s!`|<ôÄAp©‚@FÆ#è0& ^Gü÷ ÒçpVyB0È–ɧM©C‡[Yš~‚VÁàÌSÃh’ælì½*«¦ó= 4¬Òul¬öÓX§…MËòÁŽnNÞ–¥ W‰RÕŽ-1GWlA+ôí2E@›Î¡ÞÚ® 5û@I@éç–plp¶†m,­a‹(§˜ÍÖkQmœª¼ç•šDá6<»8tH{\%a" ŽÏÌ(ï/”¦K‹ŸSá~†­Ad‡­Ú܈¦Õ¾Á]H\GÈâa47M† CÁnù÷40§à›5ÞŒÿ*Û. Nß àôs Ö’…Ÿ£®eÏ ´9 Nby0gäZú .Œ‹(3~¿ö@×_ `ÂöZïñ01¤ß!NÀ.¸ç>Áž_FÑà#†L®Çô¶c 0NšC Rn&‘Š ]Ä/ ~Áä`Ü!Xñ“!n't÷žÕÒzá ßã ʼñ§ ü#+<òðË<´‘1lcü¥ÂJ4*ƒ˜´Xø4gmOØF(±íOÀfruæø2Ømú„K€LyÆ›~J Me’-hcÉw–ª9'£W¡ŸºSˆcý‚Ý.¦D ͪt$$¦:Îu…ꘄGÓREìâSŒÝ0@à¤Bƒ)fû¡ÀìåÆ÷Ž’…>ù¡_p|G°è¡[£î;‰›…Z }†¥ò¤2‘Ï3êÊ¿ýଲÁÓB[pv˜[jor¾·¡Áˆ†CÌŽéþBF,!ÛRÁÆø¢7`äHfÙr…_NãŒ,2æñ\ ­Ka FbÁp\Kƒ#²•õ½·&Ï÷½Aÿ'Eðb¾kþôÐ0K9LjŠCæ5A@ž+_3wWcMU§l”­ÊÑ‘{ÂQÜb@ï4½{ &;û°ö‘T³K/`obS…ìËÆ6-:?¾·à[²„Ž×7¨+Ø:qdØœ¤ç‘ ô$¹»Ð¥E=Ø›é/îˆàr>Uþƒ¤Œªme"À͹c_;¯)(øØàqa;gñ]U¸4ÇB>ö^äÃ×*³X?°ÐÔ‘ Ï"p?‚WLxb9)ž/ºî¡é0˜Üõ‘, Ð¡Pr_…¥˜ÍÜJDàýEI#È톢ýËê’½÷é7²ƒËŸK`Èç ¨¦aÕò(Ÿ¥ a,/iŒ4àUJ«—LžæÄvìl—I/˜~ôLx?Í´øÒEA˜œ8Ôìo4ÐYöèd&Ä‹%§]Ü_í`Ñ“ˆ¿%Csè¹ZÖäð†}¡-ÇHKY/tXÊ}ø6ÇJ§>ŽFA@0ÈS$cDð¦û˜Dà+o]ìOa¥AA°wkëEŠ1"²íöüpÁ-)Ê\¾•$+Ɖßeä†ò™Iƒ> +HÈ$PƒeH÷´›¬pü˜ÅöU¤­HJ÷I–ÑG†7(½âkâLP‹Ð:ØQ"çEá"FŸgë ûÒ6Þ3ûÛð8eZŠ/„IÀN°%ö¸h˜ÑK˜î+‘íä‚T¶Ùs¬9ŽuI³N‡²ãâWYè'fÊ·pÈÏémñL’H…Rž:¼«ðÂDßSxÅ ~º Ð †\k êŠ$¦˜%52ù‚Ó2¬MˆÈI(¨¹‘#Ìp§@»šÓ™Xh1º"Š ‘9qp~€•uO«{¥m›ÓÆ mâç)½ÌÐJfX3B²çá@@õj—3ó‰&ޝ9Û „nÐ mÀ$„øl¡×ô Zh7&ËćY>û‡)’2­M„¹­æÎð6s~É'/Ä^ÐW=Ïà«C)SO#íŠ ÆðÛ$+=êèD ”Å…X–äe×E,»|ÏŠå0Ù(bJLQ^Ù³Ao»æé]¾ r0uÇ–ŒÏ:ŽâÜR%Pÿü¡ ËÕ"`‘”¼$ùèåœð$Êšç.hÅ€b»x/Àb¹ÅYŽ'îcxÛ§œgö–š~žâÀŃàÅ ¦v}\PµúØò7f3ᛋ ŒŒ}GY>^©bø²dQL~G yÛý$X‡ÎòúL‹óy~-’åƒZ5_J« #m´~­AÛ™¼ýA©S¹óP§–·tõïWe„É.Šõdºdcù÷A°ÙÍêkíÞ‚ŒT{ÆD‘ìé¦:n²/•‡5P9‹åq©%¼Ma,ì°6;r ‘äÇìvqbk\œ8ñizW϶²QBpñw€âHÞ3%‘UwòÚ$vEº¶TÌ1‹ÌÈÏ{{$ì(ûœ½¸®†%7n2vÃÔ(¼—¿ž4©¥JH+™ªSÁ¤RL•ÙÜ&žü,RÆ4(ÆoÖU0ÛvÄ ´m)ä2^M7©H”ìÉCDâ´VÒã·‰*8XJzR™[S8š!XÊâ@vÇqÈÞ¢ÛeS àƒyÏŽ†‘YÔX^Bu#&WDÐîÓP÷ LoÿIdîÔÁº2Œá®Þ•¿ ÎP¶ݵy Æ;HOãn)4<¤|ìùt;‹åˆw™pÑ%D9˜„È¥tjÞAŒï_â"oƒ7¤›Ø¬¿,ÔÔÓÙøä›*=Â\ù\ï,b_IOYÜÉ>æ$éQë H5Öýíß;ÝïªØ–Øê¶÷Ñú%W19ѱܲ‹#LFt™鱓ëÊmpùø†m ë\"ÈóFZËÒ“ÙfÇÀK”“ Ê ‡žVWBÑCŽV4àÓ-F¬’j©Öý:_ ƒÉ?„‚r›âʉŽ3Âq™ŽóM6g[N¢a¥|Ÿ )ÊMkv[vøèX•†õ}2ö;6Xá$‘xN;î¼ê¬÷¦®‹¨Sý¸7éØU â-û±ô5ÂÛoY.…ƒ¬)Ã(ŠbÂD¶>E™:æ°ÐT/~Ožg¯Äá¿d©ç™YÐcñ``:w¾qâpc“VM8ªLQeM~köE¨ˆ¥¯·ÎBߨðëÝRYŠ¥"rWj}7-Š{ÇTo ¸q~ú8ËôøžŠ¡ö¹HÝXô¡!È„?¸Ë‚yrʼn|æ;{ù»ÊŒýþ mUP#rý³Úùe\ÔßVšÖXéyTzÝïw,†ÔbnUd–*±R3"bTJe!˜  f}›j¯+Ú[T¾çñ½ú‰µ»‹Ú`ìû–P Jw4‡¢³¯DN“ôCä¥ì±‘„¥P{ž?ä Ñî$¦‰gµb'êˆ$ÂLê&ùŒv0>ïb%íâkð °¢µ5aQг[•4 NiÍ50uBHè© Ã9}Áb“ˆ]PD $†„+z²¤I›d€jڳ̩:Í%ßøƒ ŠÙ(‰´{¢‹Ìõlú&û÷j5u¯ÚËy»•µkeºAS~‚ “hq©ÊňÅÈÍfò^RqÈãw•ã‚ãfn”„8%Nó)¯ZJðù6Á4tæ>\à„+r—Z㋇pã©pŽ5àAšˆµ7ãú&<ø(Ÿr»_í=ÄsaõkáXWqr.Ÿ‘ÁCP‰Ã—Fϧi^U ÇrNèL^^ÒõÜê:žÉùó»›Å)›¶¯=¤­K½Á@U šg˜ÚDÔáò{¸@Ê"ù~(Ã(Ú}˜çÅílìó™4ské(Ð[´ä»×;HcªççØò‰),–Ä;%LÂ.WÊ!JÖI!‘ ¹=D”¯UÈî”BvO/ßjlü©\rúòÐq  =ÔÂ…$rZÒ¦ÿKpóD/ù ¾½!³ ¿^ÊÏýÔ£y_ú‰øsk‘~×þ‘®¤Lº3]Ÿ¨@X<³§ Nõ®ÄR×b?ª•’(6\Ï㲬¹àöÍÛd0«H ¬bÞ/7ö‹AM™VMp?tÐÜÔdÌûiÊ',5 q„ú¦3Ú™Rcî³½n êgƒ]žË!/ÀlÊèÆmçOö&f#S!jѿɩè!•ÿyH ÝÚ¦ ì¾®)ñ3¹üw«^±»±LRlçdzöïr·eüd…®¨³­S»aŠÕvóãès2ÃvyH Iÿwˆ~!‡(Ä:à!ãB„tÉÒ°…b˜lá1yƒ‰¢O<ÜP0æ\™pÉ´kå߯rϼPÛùÄõi>q}eGÖëCs¶üµ“&Òâåîƒ>4§üéË)›1ù?@Xü/ òŠ_/­èb‰ÉÏw DÿsÀ81cò°5€ÒïùỎqQcðòûRH0›ûåÁ.SÖendstream endobj 407 0 obj 4680 endobj 411 0 obj <> stream xœÍ\YoÇÎ3cø7,íÜñô5G‚€§ðñ>æºLζ?náÀ}ø¸y"^æßáçúñw½/þ£|ÐÅwáç_2›Æ>·¿‡ßù#!—ÓÖé•?6y)ÄXEZ¦q³s¡M)A¢‘ÔKø¸€Gz÷ʉíø8Õ^éÅ€žçRB‡+>Õó¯•RgƒO ÑÛrô#=újm¤—zðI9x¡•ƒÀ >ú;ù,Ù)OüÐ:7M«‚|%?\ì;ÿÿÄEÔ0:úQ9ZñŽ¿½,§ŸèÁ‹r°,À(Ñ>ÞUúTx‡ >·;!°]©MQ¶]F~qtòÑÛ}ÜìúÏKi,¸;Nh‰°L„Ë÷öøóüƒ3áÏg…å0Ä”¥@dÕ„)/(Ü„Ã%Øþ¡\qɬëºõAÜ]žu#n&Î>kB—ןg$c Ç^g²õÌCËʼníÞ3`1«§…iqÚ„lsù¬A@Þ›&e{<É^™û#¬&ö…E å2QM+_ùÐîä[Ì?“3£¡þ2+jõ-|ÓRôͽ=;¬zCWkŽï󬙄J﷽ݠ¶õä@Á©¡û¯“"ï÷„ƒƒšù~B†»þ ¼³×iÃÕ^–œ½’j6ÍÅÜáeØ`qþ¬Î‹CÈĦt >GSÒîÜþ3‚ºJrë³tQÙ²#ŽªlªÄçHpcѹ½'CîX¶!XÎCBQGä|‡»ëTh0ZA: Û¨Ü\¦$U¡…€ªÄ(6?ëa@Á3ò" pÐ]S¦ •aÌÓÃbð·èg×áÏ¥éA—àê(à¥a“ݽ(70ô™§@™¤éd“²ˆPfßÁÈ_6ÅäÃð]VbCæ­<, þ*¹“+Ü{@Ç`u$¡ÛXËH—>Êàž¨®:`dL^‘æd»ÙEÑœ¢ŠËhSÂìHoåxÑð= ôZ1ª®9t"|”,¶±nijþ]Õ—t‰–V›6޼aEbbÐ÷#Ê\(] zņe×Á5dëAiäý`>ñÿŒ»ÓèÐÿ EàÌ ¼å?aGÕ¶Ú/`¥*`к‘ ¹ºèàË[½À^ù´ ŠuÛ.ÓÃæQuëŒçÀ3{{s¦‡?Á=OÙ¥Mí¨ºò׎·“:åŸ=j׫bõž4bP)Kò†è\Qç.Y y«±+zÅ"Á„CÒ³Ï2… ˜}o]ªqè‘ʶ\rIÙŽ\#P`ûÏ :zuR EBpì-ˆƒö» ®yÊl•ÝH6(³Ðü”M.Æg¾ÕiÂî!Ú#àéìõ²õ…¤²ŒØ-±bøp¹ ¯Œ4X¦e#¢%ð UoA°Ôç}ÔNtHõ0ô´˜JØ‘½ÆHã¼÷wÉ[öœô]H¾°vˆï:rBÏ‚ÇèpµD©³«¢,;øÙÅv¡Ñ;7µ¬â•ÉçyÅ ‘GA¬Ä8‘´ RX §DË«` \’§ÿ„ÝI›áÁ¯aÚTlN¥ìS›Ô¼bÄ3&…À9š® ¬ê"L{‚‡G=JŠÏ$dÈ$Ïp6ÕÐÝ,ð’”aJmð¢ D ü5nÿÑ€‹sr‹Ð`½1^—À':Ä%Y«(ôIL3Xx HÍêéŠ/•&5–†x×$üÿ—üýÙsðJkÁ#º1——åÕ %iÆðúƒ„å…–;x¯KëP*›ªyhÑ]XELòDÛX¢rzí–ó*¹¶“…׈È ÐEÔ3´ó,J2¸2>ºNµá) ph’'±®éFÄ7ê° eÀq”<¨Î±tD ÿŒw—ލó 쬱ÐâÖ"âk ŽÉêÎ'².Ç|ðORc1n>‡0«ñ?s33mîž%dMEVÃ5à•w[ÇAÑR}šé :h Ô"žÕ0SX.-<±6­ÂX&9ºcÆÔvNÀ4û|Ñm¤ùœuäLÇÊA)¬áPN`ž|\|§¨âÂ)«i(kæ M£¸Ç€1¬·€­r»³L&PP±ôˆê]®! û䋲Ö9_ú:zäåôbÏKK“há‚U3´ c#G˜Š±\v2 ì2¹ï­Áo4úc°Æ—]ÕîòiCViš»Õ"†l ŒÓZ ;é¢<³^±ÂkÔ†ÞƒE/±ÔÏUŠ)ê;_²Ÿâ^ùV‹“s8^Bm…õ¬ðË¥µIr§½aÞ Y«YOÉrW‘ÂjrYk9„ YÜk8y6rŠ©uÅ)Â2ª*)Ü­ì)ŒPŸ« e+QØ,yÐ'HKÍÔB E¥F„5™iÀ] ÙQ ÍÑ"m¼’¥Ñí†× [º) ¯Y˜×1Ô¼îƒÚ edw433W"]ÍŽ,|ÿäp%ÿýÌÆ·žrȤY„‰âŽD¢ë¶?¾Í8­µc–83»ƒìK0yÇ*œ„ÝØ³èó‰Çc ¨Ÿ£sD÷Ñ™óg+8ˆÌP@Çj i0æ*òq˜/Œ6 õx-K¡ø×µž¢Ÿg½ƒ¤2 Øú@-ª ø?Ø0=Õ).uTª&è(¦±Thª8[NÎåžµ )º¯sæ2Måcž÷¥CÖõ‘ã½WÞÙÄ™ûº|q/[F ؘËÊ»÷ŠfL:b9œ2‡@W¾+L+¨ h«²}6X Ñé[­¶ü³ðFÐ 0l2ŒË ÷T¨æ©aƒZàŒ9tMCtˆhÛä\˜ò±sYê=UÃò9,iË×çÕ×ìúÇë 2ÔKô­© ô6“§Á¥©¾r—±°6ã8RäÞf©Mhĺvº> o€ÄPµÜO—æ èÏ·Cï&ÌhA&ÒuX$ïZïÇ.ï¡ Ølλº¼«ßÓù‘‡L£‡Bn$ŒÙ¾aî;OØEo§>ÇTi;ÄAXG߉^¾ý6@†·@ô8º„= Õ;K+3%d¬·ZH ÔPÿÀIÚý9G}‹lNH䯨¢î0^ êLqá±1²—„âµ’£ËÉFC®óЄpÇô®ÑXžÃÎ XRe³1}ë%58EãK4éѳ`ÒìºB_LcÙ£&3lJ”¤T¨Õìø»×qÌ8Ìr9`ã¤^±Œb/Óök-•ºHÝŠ§ƒÐ×s¬Õ‡(”YªÆ Á&æ Â>±— ZM@À=¬€=IœÁ‡ÐAC3G©8óaá“€_ê!(eò™.'iýEœ«ªÇAæûù7S»ì•ì¡Ê™ý½I)ÚΫÝ]tƒfÔ$™™=+CˆË©d -Z\­´S]Ãäâ4Þ<¹h±“ÄR¼ð›TÑTL„‹_Þ¾‘"tÅn |äŽúiêûQ1~OK¨”™ ¾§)ÊþÀ†HÜ Šab?Kb_ÂéinóVõ,öÓJD6Õ呂1]c÷(ºÊû¸Óèjnã(†0ñ"cÞ¨ð›¯>”@¬u±žûpS´}­´kѺV“Ö^«x~T;!Q–lß±CÁüZÕä5yÍBã jαÁö²¥„Ñ•Éä„4¯o`¶•´îÚ.¨x&IêD ýÚ. HçÂ…U§¤âÙØÚÖŒ¾Î*R†j àÚ/“å,¬ŸÕ›¬äÍ׬àõžÂf[ðÔ„:{Œ½= ÿ OÀ*/±VHä÷”±­“µ ~ûlaã™G{ª‚¯²¥˜U§å+[&QÚ>e9ϳ}ÅÜ+JÙü\k©Þ,r ªíU.Á÷ë]¦m*ÊtÎzÚ•tAŠœ3Òå߬ë#R[Dši«²y,¿þ}ìI4Ù~´Cæª*yðÊkOw —ÀÑêæ-«dã[hæñZ=>o´õ³ ƒ€;'G߽؄ÐöØž©7¾Ë¶Ûç¿àCòß³gG·ï}|÷ËÍë—WŽ>þ~ãŽ>þ>nóIþs÷ÓͯŽîÜÝ|û®½çÞa^ž§u=õŸãzµ;é3T Dý° ç+©b­ÓÞ¶ãSu;¸µ@Ÿ#ó›™BFcZ4îÉ4ÍtÐÑÝM8< h…¢Q‡¯à+”v²ÞTf-?JS Û‚²ÖÀ¼iT.ûoŽÎE!öI1$u¹Ûg'™.ÇùÖë·¼‰iI’#dØ»üó˜{°¿×F¹·EjœÒ³^&mNÿš[6»jÁ}2\SÚ…B YªÁtÍV2Ì,¼é±Ö–Ö: ¥!§-Œ§þ¼¥Ôh†r×:ºys›Ób òc Û=}¸D)øVðmm£†e{¬ÄÖ7Díˆ!äæIÀSî“æà*ÙDZ7¾ÆÍïørÆašf0°ºÎÂÖ N¼’\™ëø<@©wƒû[ªKJ­qº_cvº¥¦¶y“ˬšÂÅý.µ}\„tÒ¢5Ó…˜œ2ä¼Y)eQ=eŸ¤#•áz£=Yº¢¨¶|Ÿ/걤²Ö‡†‹ºIEÃSþ°…ˆüÀü:ÊDæ¶*RÍgdd")ŸêŒñ97| ŽZ ï †3¢’d„TRò€xŒêI´èã: ‚éE®UFY7‹9üÌÖJÿkf­mÙëP¬ç©("ûå܉z!ß;,CÝ\ñæ6Æ‚¯Jä¹µ:ˆ™YwÎ5Ò™¨ôs‘“Tp-"Šõ£_IÚrP£V31ø`‹úE½õy-P”'Õöƒ)#¯ÏMGý’`*zžº‹÷€)6t¿'÷ K#Á€·ò­Ã Ÿ;€Vá"`½WÌÊê.W ñ(“ir{3à«È®!²ƒ ì.è7oÒÁÂtÓÒÃdËÐw†$5t¢”Ųi£„VÕÿPé{Þ-Ra*ްÓ¬e¶0H‰'(•ÆÒ•V9ÍèQÃ%üë–ƒ~ÒRôõýšP‚Xmä/³E•½È%Ç›öyJ¸¢tIùŽ”!~¯ämìÆU•ÕëêžzI؈ŸX6C-’‡u®ðg›žsÁB4Õ–6ö>ÅøKîo¥ÖQ5ÎqÇju¬ä§l¯ÖH´tÝaB¬W·ÄîvZ¸ni±3îLÓž!=Ѷx§ÍíHöCUA%²÷ƒöN ?ë¾õªÕÄäq¥[Ú].Œêø¥›8zÐNJZÁź~åúB¢li:^j!¨.&ò£>š”Ó=u,J¡ƒ…â­ƒƒV^H!7¯\SÜ»øÔM#,ú_|Ê/‡+7Z}Æ¡vçÆ,¸uíYjÎç8êi´ûú$ç@YZBí£«yT®Ú§V÷ïÕhÊߦ{s«óŒ{âue¯k hÙ´5õbT dþÉ:Ê‘™ýÏ(Ü7QªÁ‘E†“6'©n;´ƒ6SŽfÞˆNÝ¢ø^_x¢ôb›y¿§Á æ BÔ^]Z·çkðKTÆ4TžBîƒÍ5[\Smýmë€lõ~o?=;] ÌÎÊ“Få)¸å3üR6Zv²À8YyçeÿÃPI_õ¤êhçÉÞ±¯$ܰ§¤ V­¯n ƒI¸¦y²ª†í³7-ŠƒvŽh À4‹·Ï/a«ìõóÆBX œ½ªztŸ4oUËVò[ÈÎ ¼%,õFÇ@QìFòÒXGmiX‚ ±¼óÁ$> rJ±Òá².ëŸkÌ#CŸâ& 2}>¤x¬D3bÏS§¦BÞ„ ïåàw Ðsª½¢œð9É»Fʃ”¦‚NVetnî{ß¼¤„¿¿mö½°©6;H#jŽ^»ƒF‚ÞïS^ƒóHOàkl íÞQ€Ñ½Í§¼{èu£oxºjäÅ>å´yÓNy‘ÏÛrð=X^ÜÔ•Óü[9X½‡Gµ˜2AO”z ÌQ&èB û¹^+®êWØr‡ÞÈW—])£~§t(dùöèßT©endstream endobj 412 0 obj 5268 endobj 416 0 obj <> stream xœÝ[Y·ÎóÂ?bà‡hZðŒxõeÖ-ÙX‘-í$²àì¥]Å{H{XRÿ÷ÔÁ*’Ý={%@ÐÌ,›d“U_}u4ûõÌ,íÌà¿ø½s´qï‰õÍlÿlÃÌö7^oXº<‹_;G³û+ìÒyhZö¦·³Õ‹ lg­›5]XZ7[m<›‡ªž/+¿m×/û®™?­Íühÿ®ZÄÇÕ"ÌŸT]j7_U ïý²ïýüa囥1m#}àŠ][Ó †ÿ8ô°¦›oâ\_Wÿ´pÑÂ]è窅üü 'hhjê3¬pæÅØlÜÒâM`Øü ÇesÑž®y{Gšß¯Âü¯ñî8"4¼†¸瞯þ„¢6u¨Û¥é@Ú«]°ÉÚªæžÞöyÏEpnÙ6³…7ËÖö=8„ÌOðã?ö«Eí ܮ㿷ðã-~ìÁoä ÿ|†? ~<ÇO`å}‡p??…åã>AÇ':ú"5¾ÒFY›žÄðB_¦ž§ùÍ¥ñ\÷RãaÞ¥ËÙ¯.GSiøùÔâ>“FÔE r7Doý²nŒcÑ/QFúýEǺï¸# ü\ÕqžËÒãU‘Ýçð´‹$­|çÕÛ~»±ºûl¨Ù—ùúkËFù95,ÓLŒB…VULcô£ÎúBÖÁÛ<ÓYÁ?w"˜øvIüç/9`<)‹á÷ó?iêWS¨9-aÑÔhe@#rýiºþ6>NO´q•Ój6õ×£tùëò„D2(m¥žo§ìଚ°˜+†ï]1ü—ÛÖVÑ(?/òIQ‹ÞÖK„‡~® Kˆ? â±ãµK«,”ôZê?©ùPŵçO¡À<šNöre…xá8ÞÔÔk;0«ËAüFw—º(~3\‡_Ÿ‹?ñ!¨mhÅ+mü!õ|ªß¤ÆÇÚø$5®ª!4Á üŸ°ñ'…ÚlX¹øb ïiŸUliã»bþÚt@œ74§±OL¨AŠ?&¡Í² '1ö&£XaÀ³wÆ‚ñÁZÕø(L†ÀÈyåç¿ìq[O»®çÛ0oϱ×I剺üü·Ê;êØôÄe{żÅ GEìJ„޶CiëAîVæj¾œ3­kŒ2!©f-™ØÒÁÈ$À²º÷H& îÞ¿ˆLЈ°ÔëiÏÁ®‰¨ß÷JñD{ÙJÇ´çZ“,ô¢p:Ñ#±"êžÜÛh« ò¨ž:9i»ê±µ—™®nEkˆ¦ë&Ç›Y%.­2ùJ¾½RÆ¥¡'Œå–ë ª[`ι’ÑbÙ¤A³Í2Œ¸Þ Ù|Û.›¶/Œ6Ü™bç†3Öe®¼šVÏ4éç¦ À0©Œ´J¾=â”4ÊB„Þ‡i½xÛFuÒv¥e‚FV^ý_ 4‰#2ÙC%³Ep-Wšø{Ý«.ÿx§å4 @ׇèHB/“dŽ}·ƒÍËÈ֌Ŋæ.ew2×Zà`g¸#î=`dL˜` ïCr×ÖQÈØœ‡­Ì|5ì”,ýúpqK½#O¸­˜ÊnC2IÝÓéW4| ö«'DÙ”ŒŸƒ¹ÎOAáIr:Èôêuütœì%Béú–“ܸ"‰r—pU\ì 6Ðlp¶AñþèÛ¼ÏÒý'a±ój6bÁôY,xì@â´ú×^ˆÎ0ßEî²Y:s"êi篰<%$ümâc*…§ú²”œ×gµý0ºó踛˂ˆí‘ìN«ãwpëV‰SÒ?”San¾ ä0w ƒ•|B\+3Ѿ˜E·.ÀGÉ‚1ð¹1uŒ6иf­Co(Ãzïr @Á®ËÅx½'sf“¨mo?Èjç(6Ù„P·a¨ v,¹pH1T0žã'‰°ÍÁåã©í &¥¡æ6ËøÅ<¡ç*:9ðë™,Ü7Œ,?@H+éìdxÈ›2Ý84ô½ÕDo:<¤²-äŸ)‹Š1 †=h4)˼VîûóöÂSÒº{¶ËLÂl“¬7D@æÚƒÅ¹‚d»Žû¾­øl£³®Ëî·àº2ï¤ Õ~«jÔ”%.X<VcBHÁ~©UÜ/¢K4Žü©’‘Lp—©pĬÓpø«ÈÒ¨Icooù@Ü̼®¾£p_U§Ñ‡»Ry£½5¼´<äÛNa"ˆ…ÓõTÈq»ëméDw%䣥ìÇpÇèM*Ç"‡vn©'9ÙD× 󘋑t‹ÌÂ[Oy{T‰á­T‹í8£—¸ïZÐOÏj,™’ÊÄ™q΢•ÉËñê­Ñˆ,¤£j4ÑZg áí\±vEÂÒw•R£`ÈÖ©®[°ž(Shìefï” pÒ3ÿ© BLA—_æ”øˆ£WZƉdße–Ï!à¡Z:Í)hSdhX\+.2zªhq1jîIv‹GŠ®cF–s~­<-ÕgêNig,äu¡¨äÉØKr—~À…ûÝ©øXAHÑ ,J $½]ôGjo@ÁŒKA!")/ÖÙCޝ¡[MáL¤GøÈ_Š7UÔfî’U"¯f]±7蹉ÜM sæ.{_@†âùgt‡øø»«ç!­K¹M ® )†+?Â4à"šb8ÈZ[[¦†¸õÈ0犨„ÄsÇ9®HÙú,lÅ"DdòÝi> –ù¨H`³ëŒÉ4麟Œzq¿)´:ÊÜéŽ@уº­XâÀx-©Ü×——¾™jYúft5TKŠøº¢zBB²î6n/Ô5qMµ!ë L“Ñ>COÕ”Öð?“Ó‹ü0‰:ø°ŒzˆàiRµlT¹a•lVˆ\êÂÁ*„Ø_”Q€V„ó²‘wáZD„kEâFÑ9Ý‘¦z)yëèBækQûaíÃ7FÀ5~ ·V+áÀ*`yYÝbǪ_Ùãø¡EôTwªìÀIÅ4Dqcõ³X|.–kH|«P¦õ‘4×䮋(Š…žíØe á®} =\“R°ÁS‘§Çê{TÒ \Ä'#„²‚j†!;s‘=ëïŒ<ý¤Cñ¹_é¸&)´p º\*weJÐÚ´òsú›tˆ}vòü4«/¹X –ø 2AØšs﹆ŸX\V\ïL 3&‹.$uðk+Iý”ò#J´ä²ÊL Fñîr[/\$ ³0S }27E¢âÒÊÐ …S†V¹ø%³ú¢îBÍœ©ô™ÅÆ£3š¦1šx£'-|°t¿a©C]ÏÞÞ,¸ŠÀ3#¦&nPƒÑMví€eUx $­G¼¥g¨¯³ ¯ÑC«in­´ì«-¹¼"Åöšõ–ÞmRÙ:÷”þ1¹ Ô\DJò4ÏnÑùcW¤3}Û=vY倩Sk#±(¢Ò—¾R¾<ä¿ÐGQJkŸVnòø/8kOÞ¹8ûsQÉù7:¿™Ž¡íë:¤¶ËÇ9©ÓA%G†Ó©óxª÷<åVyùªóSÏ´Ñê/“.m|^œ+\{ï†Ûz©­°k"’¶|ï z ’·P¬‰Nåöñ$,‰þP.+ÅÇ£¯z˜e§Ó¼Ã¸÷uçB˘ãm—A¯8ü> stream xœÝ[YoÇÎ3cä7ìS´chGÓ×L?X²dË‘/‰ŽÛ³")R°DÊW´òëÓuõ1Ó»ÆÞŸ„ñDZkx?Ç CMO›• ]†A“(ŒsQ¬”÷mg+ÓµƒGÉy˜zù>^ÀÇQø m¼„Ÿ‡ðñ6ŒÛÁêúåGá«Ý™¥ `eZ×wA÷ö?üaùÞ8€3øØÄñNág˜Mu¦IfCuðè.ƒ¤õœóxŸâèodµËuì‡?бí|à^~\Æ­†EŠ”Ïc÷7©ñvPhïB³^Þ‹Ï¥ç_ÆÆSã“ØøÔ˜V³¿ÝKÇF˜rô¹ÓÚ’ÎbãEj|›¿îºà˜íèyêù"6¥Æ—±ñpû˜Ùxç©×ûô5æQ4ʵڊÍÅ•¹üýçÅÎà«5>ßï«BüF_i7´Þ/VxÆ6ÂÙ‹™tÀ­à45®cã«|‡S…u~ùרø¶6æºÖ¸©IüÇ&~½;Ù´o{ß©ÅJ­ŠÆ{6÷aØ’•h°eDã‰JwjDFœ°¹€~7µÍ§5½HǵžG9ˆ`¼ôêI ¾ojÒx[ƒï™lÌf'Å̸©À j‹äùA>èþ›wi²¦Óó;[ôht£'½$þ{)Œ„S7†…$¨;\þ|SàylÃá/O‡mC…EY‹z|…Qâzx•¸ý«-Cç´:!Ú?`¢¶'Cwñ㮼~5‡P}ò¥î«¾ÀäÌô¦°ð¡Çe&òþ6õ|?K_ÅÆ'©q¿©°Æ%˜ÌL,YhÉŠä•ÜÇÌXÓ>ª¤´ÍµäëÂèîz£g¶™¶4w G…Ám#ú~líIJ®‹3“$®29®k;ÉD’¸ÿ}Uâã«@ô``»ÿ4§a»nv0šKõ÷ö ØÚ1“Ð"íÍ|®­çð†¾ [©D1Wt14¹®3ÐÛÁù=Š_ná9qžÿ— (nÌë©õ`@^Ü—¨‰¶[Æ¢¤ÏAÖÀªt"Š2Ú¢ü EeUkP—ÓQ]¨ˆÀ>Áh¿‚ªÛÈÀÿúð¿a¡ZVa?nqNaœ‘"}ìfM~/WšÎéÑŠ¶ =ÁÖAO†¼þš¼Š@Eñ)[sÜ—iÑ(ƒ>ĨMTÔßÒ«Q]¾Âmüv¢ïáë8:¥ C É–“˜Ž1ƒ;*IV4øåÈbÕ¬HÃÊ…ß]¦\P´‹ÊÇáÍØcWGz‡&í-¾~Z‹}(£ŒBãš@ñ'~®!`$pÝ! å^!ª òÁu½:s×-ò`cx3ÆíW ½+²Ë11B)&OGªÖQlí!pDž€J5ÉdÄ !b BB¯Ýòø9çg°œû{ßìý²S÷xbVíÊ]Ûû…é<”ià úÞ£½;¾Xœ¿ÙíÝùn¡öî|÷¾¾þyôÉâO{-¾¹îé´ FRŠ0Oké€zfL‘©¶®V+§ÿÕjÆ/V›À´'ÅÂ2ɤ¸ÃŒ­» ¯¢«IŽª]ŒZðMüX7¡ ¸‘ ”'ìDÏ L`‘×t*Ú!ÝLýÅÂ<ÈÀ¼vò·ôÇõ‚¥˜‚dC£c!JãIÁþ( :sÆÜ1‚Þ™:Ê9'é;5fiÛð e†E0¥riª˜n1!¤´ºµP9Á±mÈàÝ`æ­SÊŒÁѯ”ÒC@Æò“&ÀÙíaµ!‡éÆ/º q£Ai„wºåËß°¤g¬”Åáà_\øzêÍ`(↉<©¡³Íœ`”Ò!S¹=½ .䄆R½å9­Å„(Ç©!5@“LïxDã /·ÓèUL`¨0"xF0õL#ò&”–M@Çc”ó˜¦uA‚ª7®Z“2aár$VÆœ<4h6+F1ö]Ì÷8r±ëB©êm ¡Ï’d3<­–¬îä-Û)r¾>Ì龜¯Ì¼ÁS誓áà ‡òV‰)Cô¿øS¹ù„èw¬2øôãX4˜ ¯å@AÙ’ùÃWO–—ÈHªQÑ&*•,¿Sµí*¢ŽyÈ4Ùh²RXsÊ_bŽºÀ8*3û_;î«”R«PœåN8V¡ü$‹Ð€Yƒ—“˜ö4¾+¼ã{ð©½pe‘×aøXMØ‚¥lÈ}†¶¾›XCD_”ESÌ´%ÆJ©6úgqå9#AÖ“ W/àÖiòË Göü”1¥ÖáÁ¯ùrZ<-Ò1…¶…%tª¤wk(I0y‰²Ä°*qökz莀v:#V弨Û‹Q¼¦B¦µ³ò’˜Q,P÷äØ%[êµÍZá8Û„·D4Øâh-\óê1Ñú®±eÁÙ^\eä–‚äz:ŠX§zÃ8 +}£Î‘!]ð(I:ÎãvÕão3 Ù6Blkùý¦išÃä:åA›¤õ„›rñe‚‡v•­/]ÔÑ;'>%;’:¿ž“ÃÃÊþ F2H|˜4‹c UvÃîÓ”"+²àNü™8,ÞV±ÊñY°I4 ûÌÑx»ìÆ¢|FNÄ'X‹MwW„kÔýFrÕ‚ZL¶¢ÛI¬·‰<•e†Âà‘S‹jN˜9ºRûkŒ|-ÞœšûŸCâ•Nõ—è¼°Xýîš…øÁhS†Q?Â®Ñæéq-à“S3.¬_ͽ£-í1ÁNX­Eš„QÜôÂ}æ Ý3‰HÄKJÿ´™tkðÆX<¦Ñ¦äˆ<¿pÃþ2 -…ÏâåÅ@ôœJ“çX E§6à26ä2[Hã5è§ò.J@öC1Œg'¤cɆ.f5pËõŒÊILßj1Š“JvÓ—\6‚JQÜÝGŽ(Ìøõ*å"žëát¤3•;üÔuÅ£ÿÒY¨¿öæ)¦ú>Rªéð• PWzœ{NEܤ(Àâ*+ÊTdÁýf"ÝÎ:Ý^àÓ]”BždC—`w*¥<–¤wAÑ ±.w•ÈPc—Ìú6rèr·á \æzÁ‡­˜ú¢zE—~*È‘Dû>dzµ"¬kãao5"QéŠÄüœ„”^WJ8‰•Q“hRœúš<…?©Õ~NE:*ï:!þmò°CÙ…AR˜“}q’1çþ‡¡­P8²¼r9 X¡L ÊY5È ñ²b^Õ,kA£€l2›À2Ýøs!du©I˜!AÜË›rY”/ƒ]-"¶T¬rž“ƒKSË"Õ‡¨b¦KpMá´Í®'dÏï°1R3ྠ—ØXóyß ‘Ô<žˆb[˜ŒViSlùïÌâS9ÏcÓ¹d,– ó[s¥íüCõ„1„lP+W¾[¾„Tøm¢q,ÃÇüXÐå„<6[‹ðû‰ô~IQ»Ô—¶úBšbv±¤™\øÄ#³Øƒ›ç¼âzÈtH®¾ø6äñÖõ$9Å™r3⓯G$°ü›–LǃñzÅÓ*è<`> stream xœå\YoÇÎ3‘±@^vïhúšéIàI–bŇl‘¶á ER”`“”)Ñ’þ}êèꮞ™å’Œ$0 -w{ú¨®®ó«ÿºêZ³êð¿ô÷èlïÎãúÕ髽nuº÷랡ǫôçèluï»DMíØfuðl›Õ`W}ô­±«ƒ³½Ö¾ ë¶±ëžþn†8¶cìך]Þ¸õ—øå3ü ¦ûÍÆó·ƒf㬥Î7nh»nè×w›±ƒ'ÑA{°ðsã6À ï`˜Ì´ãý¸~œm;ãxÎÇøñE#¿iTGùú¤ÙtøÕظÞo6‰ÊzäOÿĽ{£÷îÐaûǰe [uMÀž›ôdãºv0ãÈŽh?Æ»õs\åú_¹ÅMÊÏôqˆ}ÇÑ™õ; tý (#4ØÒïÛL¨í`þ»€æÈË5ž½†ŸÀ÷cäm ¯çHÁ<»Â/§ðå9N‡¤D\MxóR(ŹNZÓA7ch©ÑÐY=—ù\§s4UîKäȘÔÀ„àúH•Zø5Îp}7²\4ÈZ ½ð\ P__ÀÜOq^\DØÔ™zúD± !Ðd-QóacÓ‘¯¼·­—Å_œᆯŽ_œŸ6'Žý¢œW½–žÄ^0Ÿ¤QH¡ï™Ä3蓞ÔÔò˳&dã;ßýjc\úÎ&²ÓpØ'èJ ÓøÚ¾n’F‡ó8Û"²!K„H5‚ž{Ú†gÕL4 '$y¨½ë?ãD™ý“S»Hfã9’0ýY¤ó‘ä—fá±=›„TdÑyΓ³ª9Üý¨ˆ•#K›îm¯Nî0ïgŒƒj—=€ECz’LÀ.€ã0X"Î :Ïœã½Ì ^âÀq †9|ªQ Ö³Â9_KŸŒE+Dr•vOrÆÈLІI˜‹#HHèA¥ïÈåwH,Ûƒl”„]WEz2­b'ŽIà³½ƒÞÛ)}š|‡ßâÇcüx‚ƒ r%ë!ƒS1GyûŸ;‹Ÿ—¦~—ß”Æ2Ëei<ƹaë¼G¾ßÏš Œv†|Ç:æŽf£/FºŽÎéa~þ¨Ìt÷ÓL†}ÖŒÃÜx\O4Û…£%¹ÔÃE÷?(Ï·“ù&Ÿ uù:õ³âw¥»ŽçÿZ˜W¸Õ…Mʯª£¥EJéêDñ«‡ÀìEµaùʾÔA–8äaë‰oR¿:†yŸÚùXüv°dÝAЦ^,y°³JNøµLåj¡sïû6û d%m=\'"4e=½' yM÷“,!ûøñ ¡ºÛYòÿ¢pÜÏÏ–YåÆƒÒ¸¿äá8YžË%‰¹,¦bYd^•ãWrrÈr2@ ŸcíÓj¼‰Ç×Hþ]ŒÆ~² É{dï±_DÂý±DâU~þZãBãUuø¢Ú¯¥ãm‘Žd:{ýg®g·9™ÁB\·Î6£Iü¥͆H?1í|‹@`ÊØ$÷˜38â×BÿžÁÄ73ü…²^Ë€* +§²˜Vâðœj´Ã’xY ”Ï/ãA6A5‹&'•68š«ÂÓ¤SìÐ"ʳˆ:†~kp¶Ø÷9ß¾šôXFú?,ê?þCDÊ3$#Ày(ù• ³Ï#~&ðÝRJ&ý¦±(ÑË©ò‰ ¾ÁSœÀ5:„;²Äð­¸!m˜´°8á+•ö+kŸ&¸:1¥öt»Ñò›4”&ËÌ6pA|„¾kÇ€â}RcbÅæ‘"EnDÓ„ü(öÉ­h˜ 9ææÎuàáÍO¹ñï;t³"&ÿ‹„Q2;6Þ³>áϬ`7<£q@0£j§Àì}µ÷ëÊ9 ZºQ\AXè°nà§úÁÑÙÞ½G{w}¾z}yu²wçÛ•Ù»ó ~Üûò>üyôñêO{­¾Ú^­©·%Õ†¶§uÇ£ŠÍ§h2ˆB,©|˵—>pä Úžqc â¢½ÂŸè•Æe0ñ%ï[F3µ&3Ò ƒ~ò3MÈ^P©Œž]ø€ubb |Bsuc5O6cã : Ê 5¿?+`ÁqI£¶ö¾¯­¹–)±=» „÷Bœê¯ž´`ÂúcP`+%~Ú¤úI6÷‡Rô!ýVÀ|b…ß~Ò¤ IÁÝ¿Pͧ"Û'8IL¹ø™ÿ úŠÅ˜‚õ/ŠÜ¸žX -7QY@l,Ež ³I×œé¶ "cŸÄ †k„ïC_ñ &ˆ°ÐÉocvõhŠÛ\5rà t –µìéy<‹RôiÃ:ˆãÚ`Œ×=LfÀä÷TíZ ¦LøYÓµ¦ØÜ—¸ºó¦'Ï Ãºq@F¦oGHM\T#†pѶƒE%îZ€e#ì &êœãúQçíÉCOßcœÜ11FdVäƒü:…ÐF8’“ìÐwf…¿¦G_vuŽòo€l’6Ä€ 2z3¨â Ey]ë¬éÐl¢MóV€´ãESí:Á4ÊâÀø=I(b)/{*ò¦ÀHJ½®cÐ*×)Tù#[tâ@. ÉÔò;Û—yN’ºQݕݡç1QÈZ޼²8«ÒEQÒ‡‰ðáP]ªÑ©©a+w\h,iUʨ†É‚¾d¹6[]ä"Jgö˜CÒ“¶³ªô²D¨œ‰HŽÓb$"Û…¢f&C~¬ªg•ùT†Î·ß«U´=r©ÐSÇj´‡ºtÊ[_ˆˆ^hÓ&?2ºYÉ3¹H; %h’ÓO]ðqŒ‹„|Be)/ž%Ø @¦.™¸š74Ãèr„Çv±6*+ÕvSüQÕ×£%e¤edR®K"EI­¸ÖƒK™| ITËZ:«dÆQIQªÀuA×3Ó™œ«^ŠãºL[Æ”oljÓcTò©îAdËD-ïÚ{Ëökd.§|4!§€ø ŸHÇ`*É ¡:ðÕ•@ôy>†¾ŸK<¾&Ùr!3-49²¾»Q50z  ýžkoå$Ýìr «Ä!â¿Ý˜…+‡$$: WÎYÞÐÉ)5¦Ó¸*ölWh2 srÛO6TŒ€`‹ÅT•œp)ê+úXL]:"¶`iÓµ ÓÈGú/™^FßjÀwv&Y¾³âÿ¶J9JŸÒ»×É‹>Ãu»JÌ<^Úšµ/ÜÏ!’nq „óË„/™6qMÈë‰à™ßµœ™ZÅ9Íéºt‡…Í`n•d-ßiдº àË1d]¢ŸÀ_³ƒS2wÑ,Ká Ž4zù®HpžÎP®WœT2¤ð‰9ïMÌ IÎh¿µ˜Í.¾ 3”[iPI Þ Ëzõt”ÁÏ,”¤1UÔåÂrVéˆ+· ¶ø>F·$MW:XĬ^‚=} …˜búY´¨£ëFÌ °fVÆrõƒ£¸i(¹|],ÏD×l›º¾L~–O¹^´‘bžÛåÛG“àp’Yç.Éo|Ë-#TØ@AEbO•œ-àÄ„ä+¨yÞÁ¤[ÒíÖfHa~>Ðl’®$nI$¦É†@w»–l_åùrÎÞó•½p,ã®å~+Þáû\DZ‹0“óžîíØÎÊþŽ0jh°¸d¯ 3=nlò”;ïâ–Øá3Íd6§GI¿‚¼ä$a+ hÁ‡ÛgÛ\ùȯI[¿ÇXñ&ªÆqàcµ1ÍèÿQBÉ2R†ÚÙÃJîÆbÙ'I£"ØE"?œ!Ýt+3¤›–ùŠp–C ÀSt·¤–ýxmF^0¾Ü W¶ö¥¨©¤´’'ö]fø|Å«[W÷<æ¤ö¼êšàÐ #ùÊýÌYNAwýû‰Ùqù)œ_ û¢ÓÎ^zdÁòNŒéÓâjôí^¬í§K< –³riTì¬î ÆÉ¥OIâµjF MÈñÐi“ƒØ¬Øm° ¸$Y/°?²qtS§x,H0I¬¶ÿ: ïݾ¥¥C?¹çû¶á;«ã69LWª¯—~âQ‚ 7i‘[—ÑAR r·C rl ˜ÔE­ÜȈЩ»Ä¸ßWÍ0ÃÔN/Ukg¨ éȧZÙûÊ`Aëì×¹-XXŠÛR"+Ú“Œ88'"UtÞ×níËõàd *·ÊêP§QEÒ V—ú…I v0Æâ«óÛ*Õù[ÆåɈûl¥‰/Ú_Ý:=L†€P»˜ÅH¨\¢wVlë¬D CÙ¥íêHìóÀ=$N~‘J˜¿$Ýž+ À[ È"ŸJ5¶š.3ýÓ[ãsa0Nê#5¾! `‘ :òý g•Ýê¥ó‚gež\øæ•܇/#j¿‹E‰Çè@èIhMÐêsK%D¢\=ktìmN:aõ‹ ÚtÍ+iã»+C©tܼ&±Ï¥ëG]è(ƒ~ÉåƒRü8/cN…Ž…„o›:O#LÀ„yž¦°^–ÌÓH%{Z/ëbäh—ñ¸#Éô¶›"óú¨al£€¨*!cKšÒ•©¼k¨¶ˆqÌ5ˆ®7üzšH¤eš…| P¹¤î±¤³Sgäm˜ÄçµÕ­}RjüžHNd‹¥e„ÉÜ8åõ†S…I¬•ìCþq‚i›6¹P>ÐaŽà?VUeù–PJv÷ztzÆö7Oµ¿÷c-Û½&¥­”ÎÞÍX}IÁwãNiô÷xòUÂF¾a {[ÞpU Á¾Ê,‹8”¼ù~áì]~ñLYHF¦ì",FCؘÅèûbS¥šÞæá¤\A^#Ræè]µEH~ŠÕ¥}co-G’ êSÚA o¨C»öE£¢Á9š”[9 ”eëžk—RÚ«œxšn†ÊK…!ËéUCùŽžœÜ‚lK¬·+TVvJ<Ç–9Ç¢ÜÜÞYa­:rçwòª+hŠ'ßnk ç†Ø¨@k7~õÎ9–êeCÃW"šBî!,¡[^ÒòäŠ'±pótÉŠxMéIf§ã‹ÖcŠ·ßË¢{šÀ¾Ê[ ú·¸ýÉøÛ½&Q‡…È ÷r‡ý2ª\I½[?kÔ 1™é¯|‡µÌò}ð 7>)¥qù™mÄ|»æ>UC¨¬]2›âX³J«rÊ…2…Ka†õ¸}£„¹ŽËåWâdqUðÆ7{oh²yýP™l ti qÙ8†ï–Ñ`ÖÑuËeÓù >O;y©“ïWÑ0Uy¡=-Æý8îÖâ´uhOÔ5×"ú·®_à}ªÃ÷bGnÒ¨Èä\ž ` ;­ã‹:㜢C6Ïu‚s‚$S6ñ\_¤êc“ãuY\ ÜQÙúzv"îÇKAp¶½@KoeWÿŸ€ù>2Œp­·b¿át`±½ú-N0Àºp©ØQζN÷·¡}/_W· Õ0å²N`äFïÖ-N˜N°1|Ž©Í…¯*2æ*ÂW{ÿÍÀ‹endstream endobj 427 0 obj 4449 endobj 431 0 obj <> stream xœ½\Y“·‘Þç1D?ÙÝêbáªBÙáQ¦ÖÜ (KÉ[»C9ÜðpHÍAZûëy‰*ÔL“ 2vWáH$y|™èŸ7}g6=üÇÿ>}tÿ{ã†ÍÙÕQ¿9;úùÈàë ÿóüõæÁ14ñ&=ê¦~2›ã—GÔÙlF»¢ïŒÝ¿>úÇÖîÂÖïÂÿ't‰Nw±Öviž~s|šZ~µÛûíŸw¦›¦è§í—;»ýËno·Çðüán//¾ßíí»ÞxxÛ¥7ÖNé%4/œíú~¶ßB÷ÿعôÍèÜCc#ÎðÍÎÂ×8¨O`Ö';è¬I}÷ÎÇnŠcú(m~ȯ±õŸÒøÓ4$Â×ÇðG†¡GOwûšŒ£eVÔÜÛ3/ö®ïF3MÄ’ËÔiû&-òf·¶ðçþ¼Øyøà&«Ú^ï\jµ÷Æ!Wàë+j¶÷=< Ôº¤ÑpXør”]COŸhsÛÿMÔ^ìì,Ž­ÎvÔ»ý´V&ƱÇÑq‹dJ7Y|x¾_K뫼7°þ‡ÇGßý¼q®Plö¾‹;Ú±óq3»!‚ >xttÿÑ7›ëË›G÷ÿº1G÷ÿ üå«ôÏ£?mþíèá£Íw*¢v€(˜¨ó$¦…<\ª½Nkœ¦®ÿ´N‰ÆšÖgÀXEðsÞÖó´{/p3ñ«ˆ‹ï?r?ÜàB?ÃÝ0tÑÿªýp±ÿ<²ã’n³5­ ž6ö$5‰Õfuº‹R¡ã·á´Ð ú{íû¤&³ýi›[Ÿ¶[ƒ€~ˆ“ÂØIp\¤³]º „¤Ne~Ò#Aöj9ìÄÞ‹Ìاaè-i­ÿIÀnEUõn*™@øÌé¬AšØ†ˆÉºWd±%}À–´¿‰¯B ³kÂÌJCµ$WqZæz¡ÔYšAÉwyߥiÏÐÔÛíÀÚˆ¢RHxCÆžƒâ¦Hü™ÁíF^k±×ö7`Ü î¯6›Î Ø dk‹XϨ)H6qIJºæá ë5 ?Ÿ „ ¸œ·™F ì¬l9I·s¨A„X‡'"³9gcc&§:”ÃòžFŠŸ¡WÎtŽÂç’¢MÌ铃ãAÜ-wØÈaÈ»i«)8žSôe‘ÞDO09íV… ×c·_ãBóäs7Â=%öÂþÜË=I'K“¤Edð$_¤Öx‰{3u¬ÓþºËŽG9õ¸ïÁóÉö\ble¼ò©Á°²úŒb¯"g©#¹r§E€¸ÇIz'–ÿ¢¤ÒLËý†ékÉ‚iÊìek•žø&€}°Eí(™Ì„M&z‡u‰$-È9™Q£¡ëBüGYr½È,þÍBd”n»à…£`7Å–«Ô01NÚfΑR—Â*AH߉žÓÿ$+i µùw9»Üùs?´NÁ$¥Ó¶N'âò“gê=Ëb¦“ŒëÁ°ø™'_¬™Ù“žî¦Ç4ö³<.tCÇÄ6”MO.O[#ˆ%„Ž$£6N)2"M»ù ò¾c¬øeŽº!ØJB Þmª˜°ôâAÞß¿/06“`ÑB°> 쌲D,äh£¦8Ó/bξ*OÁùÁð¢ úö²ÄÚ>i_ݧ1 ULkˆïÓ*3„žÐH‡ýŸ²×isL’\ â5YDÐ!ïMðó½Asæâ­þK m;Yí Îmï| _ÿTÁˆJÖ®)N…“)k®¥Dz‘‡g›§NÄ¥õQˤ³f£Ö+µB²"E ŒC‚œÒÀC¡A}ÅHÙ|àÖѹz Ó²ŒR*Ê-¿¦ “\)åŶx„)Dà6–ª”„V>e9'…D«­uÒÒL‰'}!¶{AÜŠÊòfÁv@f>t]h5ÂSØFÎ1‹½Ö$ÞïtnóFDrn¹.êPùÀy… ˜à†È‚¶õ^°”0cØ«#gÈaIJÅz6‘7©˜§±Fe‡Ám©]øâw³x@ëÚ–á xUûß”%ö»VÎ {ÕG‘â“+ƒ&­ˆf> ì#¹úUºìœ¶¨r†%Ü*¡Ñ §'X@ l¼í'Ê1ÚÄOí›Ð’‚íbA&¬ZëOá§'QÑ÷l·oÄ-r†û±¶7lÒ?«sÃçY MŠÄÏ7àà:&ñÓ“€ž4­@C¢Zk¬7wÌá„e_;þxÂÒÁÉ6ð^áðX hEÝ9Ây?Êð#ú=wDa"s*ÚW³h™1‡_mp½ËºôµñÞ¤Àe˜Û¾JÍ`ÉÀÿ# ¹Š>8-Qã˜×„2˜¸þ¤šÒì³m£ÓtËM¸ i0äƒ%„7 ]òþÄÊ1´b{3äïˆ4 1âx‰÷Êkº¨¶»%[5HÅþ¡Á8JÉ€êH©)Ñâ×…ÊF‚O¿NÏ2¡Mp¯D¼“'hˆ1’æÖ€€Œñ¨ à-5v‚,8ä´ÚÛB¶.<0Ç Qa|s7Ül;¹ìnFR>ÞBöÔŠôÊVrè –™ AeM˜H4»­‡’Boµ ¤äÐ ïâˆ2¢"{?‘@ ·®ä…ìF¼E€RǾyˆjs;~UĬÚçR–Ý(<›ª ¥U\WAþdC)%é̤ÍZ0ÉŠ&Þw&ç#¿Gþü9†?@]?q$‰øûÞál°/E3áäLmŠ5µ€¿%ï!­/Ê÷ùáMyx 3R.ö‚DòûóV§ù!ÄÉHq:D{¢æA~ù÷Òãa~ø}yøms˜û飣˜´ õ´ôú*?ü²<|œ>ÌÛiá¼ Ö‹êAÃ`–%Ë#ÈY±à9ºâÆ“Ê dV)•}™¯cµ×;¦ã“vŽ%ˆRÿy¥Î_þi,Z!QˆC%‘Î Kô¶Î^ò\"b MÆB¤!pÛ°–è¡Ö† k=F$!°(–ŽhŠ)ŠÕõWJAöM#“„Œv žÆf`%‹Õ» ]‚ -l›X«ï”iÔT2LÙç)èŒÊú“ª»½ÐÀ¡•—…%\¯ª ¾]NV°@vä.‰$pt—ΠI:!‚cåµÛê\GåËÙ¡†HSÈÈØ»HiþlÆ>Ú"»‘j%m¯Z³ nšõQ‚é°píڮ2o‡šðQcoÙÅoBŽ,ܦD'E?…˜Ã ŠwÝÂ¢ØÆ-Ü-Œ+’¤T.Ë=T4›äx¦-hVP,õøèøßÿ±õ;Ó…J'R‡.ã¦mL$š¤zræRW›ÈMùø¶úÅýÒ"C]b0“ ¹äÃÀ TbLH“‡©nëÆË#,*ÅÖÉÖ»˜”]⇙þ0"ÀíbŠ0ƒªL"Pæ³Øn̹Â4Ý€’ «Š°[©OïÉ-]§°ýq—Ü¡˜œ3ýV:Ü”YÊÐW@£³fp¡i¸\/œ­jƒl$àt?”F=-Æ·ò~%üðÿhX?™l·S‹€5eä]%AøéF‡S¥“#¬·ôÊ>%ÆnžNô\%ç4à¡Xd밺̙9¬y ëék [eiŠUȺåC†vÄNª2F®’ Õ2ÓE· æ¨&̼_xਇÔñ-¶D ÅsòŒáŒ7%ê:Y—NíÌÙV6 ;»MT¼ ä ž7 ‹+jë•­L‰k¾Ùבœ˜¼Éüö¦ˆßsÐL¸Ë¯$¨ÛŸAIÝKRÆqU¾W”—¥ ¹¢ Fx²+Ѻڶ½Ú?–Šü¨tañs}Còœõè ÎûÀüp²J`v¬A¢ 91b‡”8s\6&V‹ÐÁ"ÿOÕíà †ÒµÏ0ªÔ¹Ìo ô¤ „¡Sà„²‚¦ðPML⛜”®‡£—ƒØå<`¯Q#yÑ,áP 2a@‰xQÌÚ¸¡cþTX¬ê-Z•% Q^ÙW0Á—™ùèÿ²§¾^dE fÕŽ24£´`ÁB(ÎäB—ÄÄKüZWԮØÍY~g®:nøï8éã-z]¹˜÷F|ÔSòÝ“WVʉ3úéiG+9)ø© .ÙS¥™Ô”ê降«5ZÎsªX›^ûÞû)רÞâr=r KÌ•/œ%.sþ÷±ŸYò*C*nðí⦡/Nº.E Ÿ/Ltq®K|¶YûÎm+=ëÚNò|rLaë‡Hb1T«œG\q6a”ðº,byŸÉÁ)jÂ¥Yèw€À$°ò~ðé™BÑO•Þ4ën$°ð¥“{°Ê[Êz ã¤$–Jed^&T ÕùŽ6Ñ í8°zUõ™¥ í·_ÆžXHÒNiˆä)3(sµš¢WåŒ)õŸ¬Ó-…,¾ É¶¶ÿCm¸¥vsˆÚ®æÀþ XhÁ5´Á5€o½1[cå9å ÅIùø„Åä §4°ö6®Ëƒ(S®šèL@.˼5-C·|ëšCå?„Ž•á"É\ 1ªœÜY¹<Ò®¼DmŠC¼²ážÀ(CÝÇ¡³’U6ŠU&@èäâTgyf@ø ¶~•µÒ¤,_EàíÙW¥üëpŸ…<`\­€uðÛßï,¡Í'•°\nú^挡ãÓ/Nÿ0U0„ÍYÅ–æ!Zxe˜ê€±È[¾ˆ#¸ÅhzÜÌ_gðB£§ºPõŽ,3bLxk2D^×›çŒýz“€»Ï"Á>®`–Y&è–Y%"増KâÇ7.k=!×+s^§ ëªFŽηsýsv{Xaɽ®T]qgšeß u~HJj˜Ý¶‚=…\ƒª$[ YO™ƒvé÷Fˆ I¾Æ B÷…$†âaÖ€ìl­1´@H2®ËY>qv·®²°t}`½ô ûŸNn&ik»¨U7h˜ µ¬åH¦ð>—n+¦¸&n)h†­:çp¤w£Î²†Fuß8¿îYÝ2.÷d8erª ®.Ï\$c)˜ÓBªÀê¼u³†Ïµ’ÓÄÓ6pRÑ«¤"ÄCjòÒv.‰YüV€÷ÇÊΫuNîðÚ_Oþÿ"¶”>!~‚*›þ‘@Kñ¥¶« ‰#çv<·$×ýü*øªÎâYz´Ñ>` ý{U¯tÖåîª.5¸#‘®¬V®§+ì'….½Œy†Íé»\(„-·¤àBñÚÖ(„ÛEëÑfñú=©uS´Qâ¾æ›`y!|‡JRi"N0Þà=¤NBÜËVDèæxû‡UIX•×g9ZÖ«(cIéáå1-¦üWbM¥‹Ê ÀéUÅUêc]P•b͘öQUo¯zo1Ù•NI•ñ3®íº"Lx4ãÇUGag«Ê­.JC,ô‹ÝèG5÷+=Vf !”²/Z£‡`‡—kÆFùXS’4Ó0XR ¨·R¯e’üy]»UÈ;áB¤ÙðñºÀŒgžÃq )°ÛþFŒéDZ·R ÆEä´ÇOXud &WЧ1£AR¸>¹eºKMC3€Ór¿*RU‹Ê9êØSi2Ãú·m÷Ί.Ï™+T+åWU^Ôó%SÔ¾÷ê ÌOÚ‚R6»>mËÇ•ˆŠ/[)óûD3D%—9·za˜j¹ÝôòžÙÕà]òõ_‘¡!Ïw™år.ˆÖ]#eóËa—Œ·Qöœþr¹%{U"Æ?^€HšJ_ç0šûc<ÆüÔ}±yÆy–(n^Ô:HKñpGÞRýâÝò*qeLZØ.ÂJæØ‹fÀÒÑc.Ô~üÌó9'¬Þ&½—+\z{{´?ê°‚‰Ijÿ]g¾ÂØDSèGÆ_6/_³W†L™y] Çó/<Óp¹T äæU9Ê-uó+çÓ3ØNಔú½YE¹x[òKêǃä7¿*¨ÒM©I¹2¥~ÿáe£Ó=/„ a1Ï9B(—$/sÈý¦þ9¡­µ ú×WÖ~^Aýš„àÍ»õr7c±7mÄúKý\ÑuΡ(aÉÖ—^½ur€ç׸( Ìì:ùàb:ÔDyMg;]µ¹ Q¸/×ìb—µPR>Í®Á%,˜%X²SpAKn6áäØ|CÜšù¿áë{&M7Êéí¥"sb@hr¹‰¡~ÏNîW©»aEÿ¼­®-ûC(@M"–Uÿ¼?<­:á…²$j¿Íï¯Z3´ª[f…)|=Œ~•å\áwGÿ^ŠAÉendstream endobj 432 0 obj 5565 endobj 436 0 obj <> stream xœí\YsÇuÎ3¢qËñ½.ÞÑô6KåI´e›.K‘”].3ƒ 2".¢Ÿ>kŸžé@/©<¤XîéõôwöÓx·ë;·ëáÿ>¿:ùü;†Ý凓~wyòîÄáëÿ:¿Ú==…&SȺ¹ŸÝîôÕ uv»Ñï†)vÎïN¯Nþ¼‡´ï~ïòï?§Þu½Kû?œsÝ<¥ý¹Áw‡£Û?;=~{zˆûß×/óãnž§8ÏüþëÜê7ùÉéá÷¿=C˜òXCî-íóˆ=|t~ª>q˜û¼€üéOÚößa€¡ëû‘ÖðuþîÇü2àRž•U|­}ìLÓ˜G|ñRŸ5Ø™7ò8y|‡ÕÆòäÜþh¥iLyØ)“õô"“Ògò¥C¢–ÁͶå1ö©‹ÓîúntóL=nójöïáÇøqÀÜþ#|}?žïáçÏ2ç)¿›`]ÜÜhŸü5õ’¤<<Ï[]dŸëûòð½í._êà sÞÿ¨^—VoôáÛª+-"šNï[>¶^—‡—<Ò4î¿×÷/ËûŸôáåáMkÎ }Øé§Ÿ•×Ïúô_õ)â1¹nØ3ÌœžØþIþ­|î¯ëv¯ôPñ(?èÿ _¬Ï›Ñéí{»Ý€çfæ½(¨x¥ oËv>¶HÀ;œµ`pQuJnÆø}ÿ¡5ÓYë¡AYÙþ&±]èÒÐg¡ôû“Ó_ü™è’÷—|²6œBèþ 4;“O:#¾ÍEI“áMÝ¥Úyúîû¿Ï}+aËìÔ÷Žð‹ÜeN™>oÃ#8óÖ~É»Á}„Ž$á:BÐÙú¼…·Y«¸ˆ½^CØät¿ÕõëüU*2P°Ú |øoꇉEYä„)RùrCp34açYiere`æÉ‘©«™8$ÐOàK½£q½nwÎPw!ï3á£Ác3@³‹ˆYZHž:aS]odºäh2ÏÏ—´ a5Jþä}µ¤>âžèo´OöÍJöN__YËëëƒàá˜g’·@1KY`ío€øÀs¸.Ø}þs»äs„ç 2D`XÄñ|Ða{ L±$lGÛKÔNbxä ‚.ô¾sƒ`î† QÜ:J…D¬¢ô,@ÈmRþ8޾>Ñ¼Žºo z˺ú¡ÙD‰±uÁii|W²cÄ ñ¶¯S ¦CYC¡¬­Ä#Sð#(? „ 1 EvÄ€aáb[8²Ùjq@,ÀáìAëUH½9„IÄÚØÌ݃>•s€I`VÄ|xÞ ,%øä®¤R»1 ²+ɱœ[ˆ¨jÚR1.ÐF˜»€Ù(u•Ì=“Ù!†Á(Èð,?:¤›eQæ‹Xá)ãü/<²„î GbŠˆþ4Â`|¼ÒV?‡¾=ªw‘;»JòË#VqÃkžú|$derzË~ÈA¿:*+‰6mØD˜“Éu[1ζ ~Ù`ºš¿lh?ËS# Hx‚r>Í)ø ÍRY Yj üÀº4öG†)à3©…3xC¸QÝd4Ce™MAµæn¬8#˜­e±P¼À&:² `ó5®^C_ÒÒf·µ~¨Äï€jù’†‰+…ã#,‚1WBhm¡ä4?3ÌÆÊ M±§½|`ëìsµ>° fbô[9Ž¿Oâ3vSúV&ÈÞŒPÆϪO*¥3|@áþ†l…5j­Pái…¤è#Ò\±ÁÖmtr-@è¿Á| £?Æ0¢¢Z¡˜Œ6:QAð†Ì‚1/ ÕA†ƒ]bž=²±KÓbã´! c.¨ >™‘op«[F)PaÎ2ªqªÀÑ4…‘GâwÍ-~}DÊÞ`hžÅ(Êã©‹ˆ„ÊâjáXÖòä >Rã¨ñœJ}Ï”äÇërþêRÁ‡¬Ù0lId’I-/jg颱­G±Ãj5xãºT¶Øùòg Ig«€ó£É€ðNÍŵ9 “ƒœÏ+û$èÍ=a„w‘m\›øæ¡,¾¤çB£—S¹¤e€·TÁÆ·©­!a~Þö€øZ4UöùûfHk”>G0Ù–ž}í)Y•–ó¥¥F›c!Ijáò+7GM|Œå¡Oâ×î ¶m(¥q©½8MìïE©j´iêq¸…+ {¸UYP|õXkK‡‘„Œ†F:’U8ä[‹¿n‚ñ3‘flnMΊH †AÀ/¼3$”²×¢Ú¥ ?[J´ŒâÂ#ZhN8–BÓ&FÂäOSӲⓘf SNÛmÿ\ÄL,ÖOµzjjL"T­2ŧ dÁ¶<åt¤øñÖ‚-ªºQ E,ù^Q¼»¼‹*.}0z¯¾%>äRÐb§ñ“Uð´éGèÈàé,ÎY†Aì¶/5ñm@È 6噑²$ºÎpá?^Ø@ gÆØT‹ ‚@g=¼°wFÇ6pb†k`Ÿ…Æ­+Yµ¦ªá%ŽX9L 5q²ó‘á¾×(³¥6Îó¤Œ&æ"X…’ªe3ùÿ«V|•ÝŒrÌâ‡D$ĤZ¡çL€Ç™âUì|Ó ¤ÍÔŠê®tý{Òõlã.–Å´xË.3t^îR/YGJÿËŠá&úÒ- ´´e® ªµ¼ò&Œq&–ó:$ª!xâ¼Dâv´qˆ–Ú[ÑÆÁ„ÍŒ6•Ø·ZtÌ^\É0&»º›-(¨P©¬5ŽZ#`=Õc£C%eF¬ÝSXÂ…Ê3j­I»pñžÊ*˜]›l÷j ã…Ì¡¡I?£ÝÚ†)«h÷Ž^Rwñ÷Û†YèT>Í´§Yf±…H|Ÿ]FXœ*Þ³èc¢Ôtå®}?PN=GÌ”)†mC CéA÷Ô„’5×¼!S«ŸìÇ€óëIï Æ.ªÅkô´Ò7䆔Üã5àl¿*b«›¼#r•›Ò²–·˜¶_åìڔ뗸ν$³:Ê ç÷4Çó=ËݾUîNª&:Ê! •ÄØí€oMhzXÇ—,~Lй:©ZÄ ÇPW ûr+§„Ù'È–öþ±V‰Y¤D-f ›UØ0d‚Cy8SrST°ÇD®i°æP©ëâ„H9°ù4Ó¹ãl7VJsNw-}µ6îìc‰ªû¢A¼-ÿEÂÕ‚A‘¯u-ÇjŽ ðHÑå6Î\÷¸1ÇEÊÍzL 8­Œ 0*qŠêÍ#~-‘ÀjT<7ã‘ ”si*g„à I4±WkùÉØÈE¼¤ˆé&gGïãŽÄèQ)„Gpuð3 ³…C‰—`ÌÛrâ’«;މ«ô>b°Õ’/BZmöEH"ˈ *½âÚ £&òö‡/ùߊ"¯‰…(é¸ÌƒÅA•d”ØYË£%ƒ'÷0bÂ4·ÎGåªÆvþ¼°;¢'w» .£aªªˆQ¡Ê:ÙT!Š6[ ' Å=„‹(~1Ù°EkÏ,†µŒ±Q7EÔ젟âŽFGÉÐ&úE]qì¡NÇ ùET¯mfŠ< ë‚ é—§'ßž¼Ûe¼ Xa›ÏkÚe¡ Ü3¸|æÃ5»OŸ|þì«ÝÇ÷w/O>ÿãÎ|þ[øñô›_æ_Ï~µû§“/Ÿí¾Ý®æ­‹¡¤šÒqLÓq=¯2Ú®EêW0h®9s5V³þÃ×ó«~XPò4:¶i.âŠÇñ ¶-bù„¥ÆCù¹".¿–Ê6ó^2½ªpïµ]}(F¤_V’…* wˆ(õeÜâ³ÝcX62Á`§™”_ í*\À±.# ÏPûÁb~*.‚ *ðÜ9‰Â‘}ç×áímÞJàÛåß}¿ÿq¼5ô]vPÏ6ÄwI Ìö*'—ºéc•À±Ze²*J,zë’s(U´ô†B>u±8ÓhÕÄ Þ`(<ÌÄó<é¶N]·`Mæ×ÑŒ ¡ÌsRþHÖ² õ —*ã±s×+Æ]&Ov?<Ð:«èÙ'ǃëÒ $wè’sYÐ:}Öçu:4ö€{ žå†ùw@Bd@¤~BC;÷îç‘_G4¶ò§¬ gà~û2—Ü:Ç> #^Rè’ωyMÝÝ3ñ`Ai¢cËc;4Ã8uc„{ùx܇AVäFó)órêF¨>þ |­i ÞSšaº1x^»›(˃†qÿô€ùÅ1޲7çyM’j¼Í2†ÆªxOZ£Ç‚Œš°Ÿ·:aÙîX[ðn©Y2úÇúøa¤hæA÷ŠÜ_r/ŠŸ†Õ™p† ïÐ÷]ÅL¿cžÞIb¨“м+“¼Ußšw)F‹ðÕL~îº@o•˜r¦úâ‚sL3çb×õjo4¢õ’Ër¸‹•9“qµDEüÐ*ñ¢Óq¡8H4›¨ââÑλøiŸ5‚ôokŒŽÕ“x’Ó„fû]ß9òžkÿ¢"©-„’IiQ¤¸ÐWkÌ¡ ä¼©â{UÔ¹$ŽtâpaL¡¹ëóW¼+ Û.K‚?ÐâA»³ÿ$:\KBiO™ƒ@°ä™Hw¾’9%ª•×ù½$¤+~W’£¨äצb÷zAëm‡ö—Ç©¹€±Žp¹Í"Š™Ò<¯ì]…JE]QÝúœ½3¨æ„ÛpßÔ.Üó½~ÜÂäóƒ6RM,c-öèÇuy„Ìø-Ð05×Õáòñç ˜Ö0þK=ࢢ„ãÉÜú ±5v«¢Ã,Ïë(ëØoðô€G4Bù\ ¢ž½j\m€K-9k[-ü~B5•š|ràRW¿ÿìïÉ«­£½˜gžþŠS#3Èá\—Oœó¼âKX‡k‰8¶Ž8yÄZ•"O.šú¿¦N|n ¬átÑO¼ê“[ˆ* %e­f›à*ºgè£õšŽÖîZ4.¤z§émÐr½õr™m”lÈ#z4Yd˜UsC¢]Öªª¶8„*Ï£zŒnÚTW¸ÅPj®„#|½Ð¨$ž‘ð­$°ÿYÃäâÛ?xÊÈçZŠªü4éŽ3M~`$~êš%òR¥  BQþóR€{/œ°c[[ª<\×¶,ƒs< “Âäã~ÈcÅ{C©‡Y–Ÿª=";"¹€*C¬iò¦Í®,¯ ¯ôŽŠš»ï€¢wbœéã βfêoÔRòw,v½ÀdB&³a¤vųL!9œ^B6œ o²†› æè:¸t?­"'¦Oö$ÈÃØF‰ºÈµ¡³ƒVàQh_y‰ä¨ ñ÷,û›Ú%°â½³óó°jÅMš¢ýÍ Še<(²Y¸š1Oda¶ñAöŽ¡fï!hÇ9Tî#Õþ©™ËårL(G  󵄪µâñ²q•¯¤H𨊈gìª7ó‘J°ä:ÀF2Z :dqV„Τ2‹5ÀAá…–Iݸr´9i¶r´qÛ3š 1RÜæ•9¶ïꉑ’uè<"¤ÓÔ´E] »U¶UçæNbmn-"ŲåS¯L6–®[- Rc)]I Ná^… Vl©`ÅÑ^[w[ä–Æ .ô@l:DÏŽÕ2Ëv]ÆK¨ëÂc«f|³Hæ^![@LˆŠÝ´(¹±e¬=ñêbÒK“¬,y3cÞ³Ûñ×\ê´Z„¹£*–¯Y̵fJFèݨrÌ®óÔÕŽ@K¸â䥟èrÿ¶0{½¦UÕçKZÜE©v)…§X¡«JFås\ëZmvÂF7D–w{:¨Í4–ô†ºWþéz½² w¸ŽñÓoUŠ9Õ!2‹~¬}˹—œrÓ ¢òeN˜Üj{ûxQzUl: 9 fÕ}ŽÁ5d.m+Â_M·z˜Ó´sZ3"‰ßk3bžs³ØTù;- Ĩ}_C q§ûÃcq,µÌ¶AâQÃfÁ˜V*;×­nìç£qJ²fÂSž8ÆDh± ‡\‰ÑxW3€J `ÖÅCëÏ,yí-µyÑsjÕ¼º*Þ³ðZyݲ G˜TFËâ6\3NjiÞ’ä \Ùð ÷Þ,u…¹–ÂÉqÄÀ$?üΔ‰}Edû¾!> stream xœ½\Y“ÜFröóXáßÐojØlu(„Ã’V¶èX­®qìÃʦf(rƒÇŒxIô¯wefeVV¡ÐÓMy jº@y|ùe~Ý ½Ù ð_ú{õâⳌ›vO^_ »'¿^¼¼K®^쾸„[¼‰?õ˰˜Ýå/ô°ÙÍv7ß»»|qñ·½íÆýÔÿ}ùŸðHpúkmûv—×ñÎ/»ƒßÝ™~Y‚_öŸwvÿ]w°ûKøý«îÀ~èÎý`üÞÇÆûxÅÚ%^„ÛóMÎöÃ0Oûoáñÿè\üf <<À-Æìá›ÎÂ×0©O¡×¿tðühM|öà|è—0Ç|ÏÉe¼ûO±ýe™â¾‚¯†ÿq3ôÓÝaŒ·Ì³MKQ®Þ!­ÅÁ ýl–…–§þ´;LûÇqÆÇÜþ54÷(ÎüEüfWml>ŒûW±ŸýM¼ú6>W‡°Ó¹ýßã@^RKšp¸>t {€ß@;ö‚íÀ½ðû5ü½ÓWlGýö €^Þtõ¨f¸™{Hñã24çFüšzˆâ<°]|^¦ð(ý -·k`÷ŸÀåߣàЯ;Xk—yš³ç±¸ˆ-=ÑCzšÆüþgZßNÙtskû$¥TF)ˆô7øÍ¡ .»\Ö<· a~ÄgPqÅJ.y9¤Âz² ®Âú)z/Fî­Þsjβ:À4cOœô’š²f Á'4y]‡4ÇÒe\÷–׎Í,ßBúXxP<ˆ¥B0ŒÜÀW‡·þûŒ§@,04š(z+,ÍûGÉì¯ßÂ@ò]ÏnÙ $Š"F S7%ÞBÛ‘W¥4tÅ #4Ú0eé*›2S Xj…ààÒϓؤڨÅèLàMle¦M}z…ÔHc2H¤²¿Ç Çø<Þ?›¤—ŸÞ+¨E#áu V΀.ºí¼+6ABšyiš)<ÍU‚¿«Î×"è²úø ¬ÚRâ.P§i(W ÖÐ'Ÿ4‰7ôi Fs*­f0¬ÖÓTèµîó7åÉØM Ú¨µM™MÓ,‘9ŠzçYpTói{í¡÷Z†\Üœ ›¯°=›§„þÚ–h"¼{~») yXÓ´­°wéÎ+)jA®ü[ÿd§Lj)ñ|ßh/JƱD¸ ¥X1¹AxmZ3ZD!$ÓÇáÏ{ CÁ é± j|ý$ú(~_wÀú‘zM¸P¢È›Ìm½¤ïÅ@@ôÙÑ¢÷U[2á%X4Λ8ò…ˆ÷ ²Î y\pß/¥Ð*–ð9¶Â$ú%N4Áµ•ÓKàJsÓVÔ$¯ŠÜÂhâ½ò ³”†æ­Ô­â` Î>,s©‘J«€èQÒÆR¾¢ ´cCb’)"Á™Å¤d³VÊ4V\'úé\Rö¶~{˜ã“ß{]8‡týP°B…'³óCäÒÆhCÑ¢3¹9pAÓ€(WÙÕ*µF©&”´8ºl^“ÚdÂQ³Ùγl”!ÅÂ])ÐUA Ê Bá½ H\ÁaôÍ‹ÛÔHñyÕe2ˆ³lŠc•¡±KXKL¬Ïe™öP‰ŽÏåGÀ>äI›ŒJYÛX‡âía"Wù6o.µßŒgyÅ´üuYP%³L%ó†M_»‰lø+Ÿ™ÒÎù6~Ýð"Òè´ò èóÑ#ÍÓæ$B%Š=A§\žG¡¹”8™Ç$ …‹]™Àj” Œ-ò[ó›èK•ã¿Á&hö-¨)#õ(Y i-ŽüO@@ÌñM>§N∬LáD¤±åU-VÀ(¬bà„*rd×hÀ™mÙK\ß?€vʧް[, #¼Ì›Íhu¡}–ˆèe#§$†e «+ÜæUÚ¦9+œIÓ'QÔq7ÄVÓe‰Ges@K;’Œƒ¯‹-(5úÇ”MÛ;@±¬HÌ=pGìoÂKé0ø«˜›ZQb€C‘·‹Fm´,„ÿ”ÍFIãÕ¹ J“¤™h›«ŒwÖ±PºFѹÚʦ”ÒÎt?‹;©dšÈ™÷l¿Á ¿”²ß훀Mä*Q7¨cl%Î ãn¾è0¯îLty…½Ö(F+9âg¥êãNŸ ––¢Zõ«Ò¥,’ÕÌ_°21˜Sz· Tgí¬œ$GÂqYû:î¸é4½UÅ,O˜«+EÒ®˜93"TzÐÜ¥ ŸJÜ–ä?h—¤˜’Ï ®2}/Èò°ìs]…5 ŒÉ–Å­SR\ƒœO[ܲ p'‘òfX{Ôe(SEâªÎÊM*úÐY¹2š¤„ÈÒ]ù¸µÜ¥d"µ¸JµÁ@ØÆyã·@E ¦7e²9eœa‘³d[*‹k´àQzZ§·€||ƒˆDa™e•ãF>Iy¬w*]­@çöôNÎcÞIÉéÜršd ÕZfë˜ù#£$6*Ũ,«ô0èiC$9ý’Uq,Œªli®yAí¬è‘àœ²£šú‰?‡Ò€%]ÿ¤@O¹mX©¯./¾¿øuíê„UU1Æ ;g@dÃÎGÑûuZ_<¼øìá7»7¯Þ>¾øì¯;sñÙ×ð¿/¾û2þyø§Ý?\|õp÷ý¹\@ OØt‡U\›>~{¸.Œg¸1¢åp9w[ÁêHÆ¥QNUàí¢ÍÌkÛ‚?¦Ç8§&µ~^¥Ÿ7J­ß <"Àš)k`\‰´ÚœÂØ®6ǡ̽^*G Ù몀ªªþàQ›R(UÎ+OÇ@!Avø5'Å…‰Õ¾«+·l6˜(‰¸ì‚£^ m/ìüM'Y¨ÜM$±Wƒ*“ÊŒCb œM p‰ŒoRà ôý²uÝFaHYû2¹¯]D+Œz#­Ê9$*kªÈ¢vX%H[õ=Ž‘‚‚N}®@?1†’e â—,7 ®ÞÓ:VE†òÇ٬뻋-à’Íš-à:P%nOhJÚ‹i¡aÉøö¹¤x¯‹!ÝHäl廨öuå»îrß ›–ÜR+]‘’©ë©éÙ&^m=}»eýtx(1ò(X€ Þ@Ea’ìºø`©ÜÇxnɹ*÷­Ph•N„outCié1×ei]ã¢Êþ¬Ó÷C–øˆóã™TôZq²\¨³5[äm®Ñ'Á³q½EðÞJ„Ô2K9I- _-A]A:.õ† ¶.iGóPÖÌè²~˜WS4ª…ŠFÍcQ¾òuÕñ)ˆ·† ´uœÔG^KB%5‡…€#ç€ËºàŒëW%ú)BéW³‡ uA"’°Em%úól¬h£"Ø2q?í=‚-£mïBÒðCi(¢d}”ñ†¹ŸªñjêEpÅù¹´ 5î÷¹b3¬èDû›æÂ`ò÷¾Hð‡ã›ÖT® `ŒËG6ü°aµw*ë’jaÛÄôÙÇ1 =Ì|ŽK—‹Gs3VÐO’Ÿ^¡ú“N ŽO.Ynñ©ôÆ:FqòÙ„Š+¯iBíæœºÑš²Â:d—”ü¯pnŸTT ‹Qüí/§óœðÁ« rÆ™fZi©Øà-ðir¦áÂñG+8˜*ë×f87Œ`ÆDHZU¤Ïqa~);£¾71æu1Ø2œŸ€ Øs¥`Ÿ2©"uëôê@™Ï§JN9ÅÔ`6Gi¥Hœ3{ÐúìàY¹!¶â/%ßôXƒBf;i`|B•ùµD«f?%‹jU”FgŒ¦f6x>õÐÃúæájͯ¦ÎÊ‚1ÆÍ‰¬ì¹¬²>W¹JûÖšñ®Ïå¥|"9xMÏ;V‰±•?˜ù‘ _Î.`ÖG=„% üb÷ÀU‡É<¯¢M #®ºõ©_9³N§ãÎ?íõq9qŒ½èl®±‚;.Âeª^ t–;ü ñÕ74qé¿ÁG:Côilò)ßua¤A˜¿þÔÁ©F©Œóôéaª¯çmÐd=+rÎvÖš7ÕUÙ'¬ /žõsNÉ~K‰§‹´*œjp|X°¨Ü6„ûR‹ü•¼*ô§R× ­¼…ϥи̑} M„^åuPå­ÍͶ2laà5Oý,Oºšcù°CO óíj¡·ÏªóÁ‘W46pî§–Xçz¶æ‡Mè€ ªk˜ó}9lC«”´£™ï5‰ìádöNpëYbs#.×G˜Áh‘×3hBØh á¤i¥®«W$oGppŒÈ(ƒ¬J]øÝ’;†ïšnR4¹?,–¬êÕNœœ^€6…^Ý[ȱŸk¹ OêmUÀyäÅ&©B±:‘ÿ:Yt—–õ÷ÎÌáì1sØ×-ÎN £*¡®,uI”,t ¬<Éê"´V-íÉX¹æVÙ-V8:Ìòqóê@®ô”Êžµl0KtP  · #ˆâü0_¾N¼ïâÏ`'ÁÁ·N®.K–'C§š¾Ö‡pSés¬zO€¶ñÛ!gD@#tDŸçï5ä4_bc¨³l‘0Gùå!e¤Ñ šr¤GÞ/r›„ËÚPÚ¾~¨_™”U*º¾€RÀÙgQë[i¦|¶(I+t¥¥œALUc ûÿVIo手8dô™àÓ1!ËËÖ Us“×mT»·*ÙA³lĵˆM¦IE˜0 _¡†¯¾|”gxNŒI}ϧÛ‹™™ºH¶„/Êú–eQX°b+W˜ BU‹UâäÂ>¤‰‹úd²®ú`\AÛšÍõÛ56+eÔx ŸRbߦ³ y aÖ š#Âsj\ :ZÌ1·˜j 7 ²ùÜܨäVBBE¦8.B±še¬C—­÷·¬ÓɬëZU”è™V9KzeÈÑreSRZa\»Gý†®ƒ eaÇ]¾aDß`æpÏw}ð±Ÿùƒ}ƒCÌzÿ#±,GzŠor¢Ç†»!ïÑúœ_:ì¯ôlšÑa@M`ª»¯ºUáØm’ôÇ1Þa%lÂÈ«,“_»T¯ ªgQÉjŸc“<®WVð¦)Þø__-gð…í^§Ù#šªÎ.6ßn|¾º‚‘© Ñn…Wä:½¼`/j&²7^ìH@53$7«R¶;Õ'ÌGή „*©àÝ,ðµ¤ÔÇRtsMÎa•ºÎ»ê‘gØÐÅ6-\“‹1ŒÑtÅ›ŠŠª-ÆStî`QgyGxwB}§pï¤Ó"Ç’ìt¹u‰ÈB틯S‡ü´ÏN£V"r6-­Ìú0IZ)»9…’"VBª£CÞê1ëB Ë6Nð®ßQ¨êظû0‰ mÕ%gðVÃãóïõ’ì:aYgád¿Åhú]£ËPªaÊóøÁoÔ¹déÝÐ"1§W<Ø8O(o-Ã3RaóHZÚ·¢T}±R<ýG^SBÐ,®¥ª5‚Ô((SN‚4O5•Á¹i>ù¡Ujê=­£vú}¸(ŽwJâ“S§”Ãr¬+V"é½JNÞYD4,e’¯Ï¹JÊÿŸfí*car8–ó9¢À¾’‰Þð²zK!g ×¼Ieâ¢$KǨZ[^üÚwòB£Ï;§š/8ekš•d|Z3Ôõ@)çÝ8°«Þ~¥Zç#q)0 ¤U(EjuaDëD«9pã"}§2F!¿ÄÝgU¾Bþ*ŽƒªÆ™øVR…‹ EK~B‰’.ûšÒ[%qåË@4Rj§–€ˆ`ß5E›Q~ÁKQ4Á9†ÜÌ¿Rr[¿ŽòDŽ9³­t¬Åˆñ‰áøñŠÓØó‹ÞÔR”rš¸ÊßÓÈÇ„6a¯P®C]‰[1 éTãYéV£º°I Þh‡$÷<¯Oª§Äw‹B9¿ 4;‹ñX»s…]qûc˜ ˆõõSÚ0ßY/wÿÃ#z¶å0Ï 'éEKEˆ6êTdÇ9ñB9®endstream endobj 442 0 obj 5824 endobj 446 0 obj <> stream xœ½\Y“ÜÆ‘Þç±#ö/ô›5ˆ:ì›.‡é°dË…bÃÚr†‡Vâ̈Cš+ÿú­¼ª² @w%*{€º+ëË/ÂO»¡7»þÇÿ^½ºxôwãâîÅýŰ{qñÓ…Á×;þçêÕîÓK(2¹ô¨Ÿ‡Ùì.Ÿ_Pe³í.N¾7vwùêâŸ{ß…}ßÙ½Iÿü}˜Ó&ì¿ìÜþ›ôê/Ý÷—ÝÁïw»ÿ[w0ý½™ÖMMË›4$hÉp§é÷¸ÿcLiŒKŸÐ"”ô‘ûL3òëEeü÷ÿ\þϽx>Œý0¥õ»¼NkfÓ:]à’nÜß;-”IÕnàÁ³Îcøê{GíÁ (u â`Ú¥’zöF޾§¦éÀ»gµ®Rcðhô¾È?ô<®m®yËm§9\C_Ðìï ÞëÖÕ ¶^Ž<¿él„ ½c§0Ùr¢?ïä4 ÜËùöØðMéìM> /iµ­¥Y@ã–Ö¦ò d‹ æIâN¦*Îù²Ÿ à€¥9þ>7 ÛðŒÀaže$ô&yàYŒëC,M‡pKCpz…ae¡ ÜøCÉ –ÅšzÛù¥Ú»ÿD©Âby¥"íC.w•úƒŸ û§,•Ábák\x:Ãô© ˜ùm—Ê¥IÏu–NL:ó•Úˆ½;¸„´ÿ™¡¯>\ðвX€ú¨Ä†wèþ~Yæß zÌ÷ieå´a)X÷rÖRqž7,/Éí}ãfê}RfrÚ¿M;”öoD"Ì ððZ,øžØ”Ø+>ºJ"ïäÄ€UsÁµ®éKhÚ£ÔÏb‘û«F/Ò9‚‰}qyñõÅO;—€µz’óigg@·iÂ<öÓ<áÓǹ{óúí³‹GßîÌÅ£?Á>ýÛgéŸÇŸïþãâ‹Ç»¯·D³¿Ì ì{Ý$MA$âï€ÚiòÆN Iµ:ÝÕi\-zý«>]\¥Œ9Y6`™óòÀ›uÎ’øÊ:ÍfÿÝ>ãGuz¼:/|úqª“ÁX0+z–+òù]¾í5t”ø)m²‚3k¿q\ Ǥ 4‘€'Ì|ê·D¿ØM!0Æû>&!Ht„რ1IÈ’øÔ-IŸŒ#ƒ³‰ùßbpIÛ&‚«—%©h«™`IÀD?=xCŒñ9 ·BrÔ¼,Œ8á[QÇßu©Öà±V«3¹ëJIR®9ôK0¼‡f'×?¿Ú.kxô#ÂÍÁÛ•\™ôö36C}eÖµ ÚøÚü¬ñB£Šö·“œÿG–â •óŒ§(cö[ÐQó<ŽúHT ·>g4a£ ßÊ”ý‚T9#Ä:ý µH‹'œ0Ñ4j|“~ñ>c'Ь™•Ú½IŒ[˜Ÿ7—n›ˆyS‘.hõÄVg¬ÊŠR«*ƒ‚˜Î2uü` *Dù¨N“m§çòenI«è¯w¥‰Ô{¨ÙᚤÂZÛ9ôÙHÚ[K/2ËtŠ6w¹UÖ×ò–8í3¼x£À>5ìàpy û’~“ ›’ÀLóLS™ñNX³OŰýÄvIC ’NÐ;‘•ùû"€T2€*FƒGB”Ðø)?j\z!Ú)Ô:1¬Ð ˜J*·6êweZÙtÝÕô2ÿºôM§à#hø¸.ØPöm«Ùõ°€Åj†ïiTÛË'ÈÚ`bRö‰z0(çFÚ®:âóªìH'M^”t-ä•‹ô4ã‚PNb=Âs>_0‡ïËav#Þ`7 ™Pã~òʶdEWô,$\ãEZ$M©5$y<cc2âr™c‡ëN6F6„ è€ ®Så8K‹„8¦·ÙÍ:³V-0¹0²f_·/#ÄqÓ¾ŒtN—¦#׫å*>Þ“oÕS­ïŠ(3bW(„Ó«‰ 6‡¶±ñ?ù¯øã`ðü~Îæé‚‘aˆ‰‹(­3#r(™À¦` פa nä%´nã¢^£üžÒ31kȉ!Å¡šXn”gCê£Îf¾Ü†Õ. }(f+Ìù#¢gД:C0’,Ùí5kà5é"Pf5}±äcÙÐpÎ#ãiÔäò/°°²CX”uh^5ê,ÔT¦š0$½Ú@÷T¹*§ QK@Ê&5CÖãgúõ£‡¦¼Ñ°I©C”ÈL1Ä7ÅÃÎ6k+Í cv{Ùq@8_‰4]³bê4ÖJǼÁ„¥ö (Ò%8Û½× X3²Dm„õ˜6v[Nü§ c :ïÍœa1´žm•ïMοòÕús$1{Shšê’>oÃyæ™D+ ×Â9`¦ÂȨb}圯wû#å½ê­<â µä+]«µéx9Š6âù{@¢:hý†Ëí Ž´CÂ;Îã/w»Ýµg˜]&+nf¿é0fÇ-YaÐ2¬ §…Z®  âÿP+¨¸é SÈǥ̠‘ û­¥(P(íÒ°ZÇ£h‹)ŸüL©Ô¼U¦ÉCc†í ÎÛÔ»|Þ>Iý ¤?²ù pY= S9ÅüŒ:Œ\ÓO´ÅU¤Ä> [Þƒy8½á4º³6<@r¨M(écuÃqdé€/œ‘Ÿ¤‚@þ µ¾¢€&È™÷ÿ-ë*ä_P~ÑtAὬa@Ç€_¦—÷ª.ÇÖ%8]V¡ýc±*—«àP˜Øx¬_ 1aßWš²q@Q¼Aæì: äãæóà»Åø¤ßÿ!u÷æáÕª œ¼·ZE$šv›}•¬¥Õý4÷±Ø¬ëòW+uñøó¦A$sŽó¼æCã7=À¬JÏjº“ýJ]E’Èij €Ì³¶8*û2ÉÅ Ûr‰Nl\r LÌJ˲F¶$ŠP¶o‰>Õ‘^ï@!W2kê-™ÃëÀ%¶ü“b§žRhÝ5*§‹èOûÎHv %¢S•¬äNY÷Ù]Vü´‚³&ma/K)·ô†Àº N w'2õ„ãl£˜7Ÿt™ÑÈphGWC! QPŽŽ3 CÉÐÔ»MÔH¦r@ôBÁÌjø¦r÷Ùí*FÕÏhTéèÃbäK{™÷U»Ôn‰×xІ†rOnøakÔöhÍäJ:áU–›Ä phâ»EÉà zý?G©·•F”#×?j~ JΊ|)òÇ„ýLÝHœ6&®iŠ„‡¢îk¶ãš JÖÏH-DÀ©HÙpÅeZš´R1û^N˜ úabM³<¢Û´‡~)`œe"þoN€Á@”Ðçå.IâzÆÀ¿Uiâ ‘QeIZÚ:^é´úöø¡Û,StÖÀGrr¶cCg£&ŸËcŒ.¬÷vÝW-Ò#ÉKÞ,UYEuBц•ò+›¥ä‹Jg#ëó+š¥ÜÉ!çÔ@_çeÎXŸ§÷ ,:ËGj+¤£ÖO+ŠÙÏ-”/7Û"gl¶ x„«Í–>@ œâBUX†JØ}Á#_ò¸±ø¶«AÛÀ­­6qdŽØ¼UÒKe|&=íQ Ÿfªœ”©ñÍ’ü¬ð+cCL™óíltÕȨM‡ H´óÔo„¿n„zNSö`µßjggJ‡øn/KÍF$¼XŸJÇÞÐíkª¸ÊÉØÛ0à,ÊÁuº—p!ä¢@ÐQⳜµBD2Õ›ŒŽv@ yˆz“ î´°¡EÓó4RÞ CØ®K2–¾i¯˜(bw•ãã¶tzœ2l&yH‹Ó.- f@}°ä"ðœ9k #J-:¤Ùt€T¯á7t€Ô¤½Å¼$f 1¬É·l ±sˆèPŸ™”f£ÓÐN`x༯ÝôÞoí îÊöPCjbú-†"X;z¬•§“ÃìÝœ­Q9fNgÔo­ê° ¾{N>Öʶ¯wu¤L‚—ëË)Éhï´m¼úRIœO2ã‰M€åý„É”ö®IÊUÂZ“¾)Iuj/r“jŐڃÕÿ½Ô§¤ç"^QزtÅUI$a‘ØQ1M~–SGB¯“«Á9–šŸÉ¼¥'A'°#¨õ'gZ+`Î >÷–Åà­Õžâû7%ã ·gT¶Ð;hkü•\ÉBŒƒÍºîlÓ|muü¾è?µ;’fõ‚Û]SuÅáfâ¹flÞÉ:ƒ ds:â&á¨öï³™ :Ù!ÕuÕ ÓË5?”›œD’â–ÉA‚´—Ëa`\Ç!_v¸ZÈN»ŽóyÆ€¤2-­¿q© òêK^ºu1yuTnëd6œ–p2œÓ§Šê^}•uô„fÌò×D‘–rW÷¾æâÇIoç…… é­’o²‚¨îSP ë&¤”Þå„ëFEذ·EÁü’ÃïÝtê˜m8K½òRç?gqíx·Â†Å¿eWO‰˜lS6ÙêôoKŒ»Îrá„Ë­Mwd¯ª´¶Åêj Σƒ.dtï%È YH‹ÛÍ­¨iÕÍÿŒ3Åk¶ðb ’7c>·9ðÌöKzmrnÁ4Ô (ÎÇò;80p]th6ÛÒÁŸk7oËA?ˉ6RzÎúÅ6}¡nŠÚ|ßr­áT6³JR"Š’U¹Õç§(jÀÁ¬)¸•G—¿Ä%©•_Úœ…k}© 5hP¶^¢*_V‹‰•êÚ×*¨½Ÿk>XA½Ö[¨íþæÆéûbس¯üžËâ°ˆ™Ë9Wñòw’µ«C(TVÜx¿ˆÀ¸Yæ°Ä0ÒY®¶´^ &_Š}/âô­î¬Ms•å^_XZ¦Ð¢§3V€ò}E²<ˆŠë{u‹«S¬öYeáœkÈùî5,q{eã¥dê+=œØ)€pÒ ¡èµældòvy²´To¿ÓúC¼u«90zpIVôŠ.R&ŽãK8«0† ‹B¬–(XIà gRS…z's´QnvÌYêV|{$®9Q¢ÍûsrVêÖ%aåt¡9Nšz±¢Cq¸Bõ¼Â³qÆGh6{ùN!»èx4•"b(Ø(뽨zÛ5$ê5‡¥0¯ˆ}"¤¡°ÂÙ$^µŠncj^Ôb†ß‘@=µˆyWOspë_àÙ$Ø&ѲJ´$=Ifª®¼¤ûXÖx)Õ°ëÔÙyu¤¾§—¤%ÿïKgóŠY_¿¥I[ù³6KRV…¢ŒÚ{gÐHAn'wöœ+×ýòås¥%ÐܪÅbxW| Ñ`•KàÙŒ{%Rg…²£!gÍÀbÉ®´÷šÞ.Rt®ò–,ˆ’|ùŠ"ó¯MµÂ|1y7´fL õ\“ªu«J;rwqkX… ×/¤•Ö!˜cÑiG“²…HS­œ:1­~©@Ó›œðAA£D´Ÿ PÑ€…ŠžÔÜ[Ònž‹Ìæ@h\òFj»üM‡!Îà›àwÖNæ˜2«â#:í†Óp,ýS¢3<ªþšç±B¯‘,œ“^n ð@šÔÉ›°Ú`Ñ>p[÷ˆ` ë-E‰Á5‡ [È G›rkGØÐØ Ñ]uÜŸÖðU§ÒÍäT²Ä“Z¹úxF&s›ÞÐÅÑrƒ‘ÝËûûÿíêÛÕÙ“ièûJà[&¯h>õð×å `Ur†P³´&gưC“j®Ržô-'‘.í¹ª¾´–dß`äù̧­ýäU™E¥^‹Ù®Û>3è†9‡yH ¯—PWû$Ya_sôrh‡Êï•EÿØhf+ʇD¹SGÁ’jó2YúXBI¥ì²f^^ˆåµœºËßì)ŠŽÂ·sBâAIm\Šä&Oe¾—/^‘ÆCþ»Xœ+«¡Àp‘&Ô~ö*©)ü²ÒÁò˜ã½²å£W߸ãèæ!KÊ¢äaœÄPà ã«Ûƒ·óT—ä¯NåoIM¤AøóP7ÝòST|Ó4I¼þRU©óoý}¬üQ«[˜HŽQæ÷§¾„uÞ÷­`‚hO ýhM°uCï|Íëj,Q5Â{Áhá½…’!ê©þ}¥•‰t«Ç·ü°„I˜Ò²§M‹£zÎw³Kö™Aš g_'4¶¹ºU®ºú'Àh&Þ$ä†J!E‚EüºÊ´|kòV&4±_3¶(Çñ:Ý„Pïa@«€ÇrXKŠñ 9¸|ÔÊÝh2P8íÏñ'ˆ¶ɀعYx|r~¼ÄyØ5 ãQ)*_¬ÈD” ”öS8RS‚[Å„hÌ¡Õû‹5Šëì”Û‰&rÜÄgšBËRCº^v\q¾Í&UÒÇå÷\ñ©WIÅ#Å;±ðM)·Ö¨X<•>͉¾"a%u´±¦tvhfÈŽ^>¢‚¬¨((gÿ˜œáDz48²×U}©ÉM£ˆæ‡|}ñÿú›Ð%endstream endobj 447 0 obj 5259 endobj 451 0 obj <> stream xœ½\i“E’ÝÏ=üˆþF%¦N2®ÌÈ5ÛР]Ž46k6¬Ù¶Ô iº’†ã×oøyTW3°†5ªª¼âxáþü¹Gþp>ôî|€ÿøß'/ÏÞÿÊ…ñüéë³áüéÙgŸó?O^žß§DW~êçavç¾;£‹ÝùäÏÇ{çϽ<ûûÁwé»ô?þ.ÉÁ^â½ïËs†óGWåÌ»‹xø¤sý<ç8>èüá/Ý…?<‚ß?î.äÀWÝEðC?¸xˆåæ}9âý\Âéõ¤àûa˜ÆÃpùŸ»P¾9pŠóŸðYçákͧ‡ðÔÏ;¸>yW®½1÷sžÊG9ç¯zÏþ¨ÜžÇÒ†áë§ð?¹ ýôuw‘Ê)Óäy(Úѻ౸C?¹y¦!yÒÅÃåÂ÷åÃeéì›.”Ï!Œ¥=#~}Ö]Œø›Kx žÿ»ìÂTÜá¸Ä•!K‡Ÿ`8ž—Vñµ¡ csÍ ‡×Ðh8ï×òhóûMyÄwðÕI h`m3ð3\û´Kr ÂevÞàyxƒ+9÷ey .œ} ¿k#à©×Ôˆ2©‡oòØå öúicësHm<6dDÎç Îþ[¿=¬g -€‡º2·9¾ï‚ˆðô8ÂÀ–aüXƵ`prĶbs®tÊßtÐx˜´Lª·xÃGf˜ìkéÌvÆ žäoëm˘Á8„ËÇ‚œaSm ÆŒÆEéAOƒòÏ.a‡Q0€oeŠî•¦å€ó‚­|KuC.P̘ʄúiÀ‹á¤q<8Z†ÑOØT\°Ïê¥<>eDÐ%#ˆÁŒ÷yÐÖ¼€û‡5²üä-¼èè%Üx¦“ð9ùÒÇàñšìð™Ëóf²ß"ž¹E8e´&pÊxaЭõƒœ>Îh. Œ€]ÄÛ<ö9 äÖ͇ú#>ä­I`µ¢™Úõ:`\ë) çÑvaÔƒ~pÌuQ胦‚`AëuÅÐMKb(p€a¨Ï“ã÷d:¤UÏôqMûŒu»à!AÜ¥9ëÈT+#?¡y¤ÈöR]BÓµV¾/'ƒ6<N¾ªwj P,ú„0Ç3_Á¡ lÁ¼ã2>é-›$10þuìŸâM7 "·óø®Gëm`À>~töåÙç!ô#zÑ2ù¼89ßù¼LõÔÇ ~ùþó÷~vþæÇ·ßž½ÿ·swöþ'ð¿ûù°üóð£ó;ûøáù—wõØÁ—çFxNï3yíÛ†e¿Ñi ÐØ?¾ÑãPžkÛü=­ùˆÞn hQq("´íÌ}KS\Mk&ÛßÕɦ=–¯ÉÕ Ëc‰oÈ M©€WÖ?PÖÔS†ež6¤eqÙ¬ê|³üä6µÐO6÷¹ KkðaL~.MQƒ»í[#q îcé .  /ø,½äº.7‚=¶z‹F<(¿=Çýš \òŽ,ThVß¡õps_þéÙ£÷þ~ø[+P°a±µYØ ”ÝTÚ´[wsĪ`ÈÛÖ˜…~N¥éB’ú ¥Šr»Ñ²‡B;Ã0 }¿\áÓØùfuAGžtѸCˆNû¤(‡¿W<‘@?# (<œ=ܼ8xÈï…§tu…¸ˆ>äY㬘à­‰PyCãCÌ QVÆOp$” CN”‚0 þÉ|!›« Yì"´{Ë%]Úµ‚+‚¡õEÐv·‘ ®ád–JY⌤„H^cX­K®™Ç„4àï Î%¡‡Nå`±¦Æ(n¸’˜ñv $ LgJûw0ô©½ž÷å›\Ëú{¨{Í4lŒtá„×A'ùã/]Fæ˜#¦! ]ØYGE}­ŠG¾ {Tè­%)«ºh°57⺓.Aº§µ¹ Q¾ñJä§-ÖcC±i$Z««s.|Ÿ&ÖÄÐáWÕ”ÒŹŒÂ7‰ƒ[Ç{3ý¶¶j³«„ƒ§ïg¦u&?³1µŠ¬S&ô^%ýƶis­¯‘ÛÖYv²kïð¬2Žr+Z¡k$s÷¯ØÒùÞÖÒÙ!¢ÁH‡w;_½ œôªš.8Ýqc;HbpÁTSôsãÞ 1¯ÂA¤Û6FƒFÀˆïwIÙ…ó|žÇnÜ×Ö ÁWlÆÆ)šA@ Æ‘·ÿ¤ñ"‚žÑ» 2ž‚r*Åk7f@Ô V|SØ·0Ž[ Ëaž $7õqàV`Žè+®{ S\ ÛñzRÓÍà<ÁQ´V†­ñ‰Ðm‡±s]Ð3ç7¼–ñoa ¨ÊFZâ%Í™†/RÛõSG!yAëo‰!S˜í(L[˨Ó)Ìiø!̳.x(.ˆpÁp|@(ˆƒDêŒ+3¢#Ä ‚ F¶Œ3kxØÁ"r o÷\4ãÂ\„çBhñ§Ö¶pƒŒI¡8E̘¬^ºâê Ñ…L#j®–ºÁÎsV–^ðêE˜zfOHçö˜ N9p?v0ß•pDPb²†¨þq,CRì?à±$Ù Õ¢\mÒ®k ÁíA…<»*<6u¢@p’q‡ÂbŒwÜô•¼Ú/èxë.kC”E•Š< Ì.O@'d!:î%YŽÈ¾‚·áæ3'³°#q nîGhqkk_Êm~Øñ†~lÌ´D˜ƒ^ô– æcß8EÃ_b$¯û/X*FLau.Ê`ƒ¼žÐPq¸|•q½Ð¢5×jyX£sŒ°s-ˆ0Ò˜ÿi—êL¿D‡~»ZÄäÉz$1Cp ã™gž÷åÀS=¶/¡ÚC]˹Úàò܈óLïvàæ¬F¸%—Û yÃ`r}¨|éÖéä¤ykXÔÈS¬ü熎.v }¡=av9ßfÌŒŒØ›¬L"šJ¿ A¦óVú¦n·féWö@¼¹m»æŸ"Î\¬ü"_«¿ R¨R†‰Œ#åWâõ[Û æÎÖŠ%2 ­j^°k¼T"®,;䛲ˆc5(em¨‘%HƒÚ-ã×VlrYÀ‚¯—p±—U¹!ŽD£nœAøÒ®]Á³ý-$Ip¥³•Í{V.Q;˜¥J;ŒÆ\O¯)Å ¡W µd ¢rµøÌ7šP…ZÃ6ýYˆþ} ´\VQ!T iÛ¯É÷lGÄb$=sˆègݼB¯Qd…ï{é⺫”["* Δ·X#kì!¿LìUSÕŒÑF®~Ó0‘VŽ&ìAާø5± !PÖj.V+CMºn ,`QOK1ŠÕÚñ]U‘‹©ˆ1hœÒ†}YHÓÅCMvì±”Õ ÃüŽ©úÈ¥À#º3ªaà~$‚¶Èl,³z˜H÷”XÖZ÷±|Oà4îå†E^Æ[-+ŽÌx¢ìH¡ Oié*L€{Iwæ¼TÔ2u"Ã*g•ÔëMKMJ`²oÌJ%ÂH¡Ü3b;uÞ}¦O00­È@Îç?0xò° œ1š±Í’‡i8µ`… “»ÛdiЦcXÑîmA„€L*çÄꕊ˜‡öÄ,2äq,Áõ *VY’%d‹ú–«úxãåÌÕÌS. jVAs7RpSó•¡¢,f¬ùÚ(@)v¹m5X¦ŠJó£O:“V[è§8½ÆËÅq#h’ÙŽAÕÞ»rr÷ã±cc €œæj$cÜÀ Ië,ƒÐr¾ÏÊÔ—Pž|ÆßREÆŒŒGÇ&N;¥aÔj÷»+Ôá;Inh«ÕÔÓ uˆÁn$­À„rzá;–D÷)´kÔs.{+Ó²—$™qO­gƒé<¯ZD§pc9^J}½Zê Ö±ªmXØÊ×ÊϽ-Ã{!4„°¨k^R»7 Ó`/~C9Æ@ü£b«vÁ–a¬ÔöÉ § ëÌ_#9»Uhc²S% Ä ˜kâPØîÉ‚Uì ”îX§]n“¬`^¶¬È1°¹ 5s°¨ ÷m¿¶k)”Ü¢UM]¶´íõFÐ4Å¥2ˬ@êyDnÅïa˜(|Í}¾qi‹Ú↚ TSFJ!IJ¶hàâ\y׺T’ü}¬z³©|»¬ï)&*Q ™r¾KmĹxÑ }ZñóF¦æ¥(m {¼Ôº?dÂG*%ŽØQfð»n¸Æ TÂÛhEÑ 0žKMª¬ I5œ·àë9 Î`Ī­úKSMº“…áb [ÊcSœ> ):¢d0+»6VQUQØÔÇ̃ª¯IÕ1¦‰ç©ñÃR¾ut­¾tŲ5ƒHñ3ŽëüN•vrUËDÙ2ƒýj“}=–i–e^Ž"Š.kdÖzÅgõ1Æh‰×(‰Ödb¡KMZW³¦ÙÕçN´ô½U6” Ê^„»K®šºŒh-fInÏ2²~L iëŠÃVéƒÆ^‹ÝÉæY¶Ó)~+›2æ†bMã­j-†o$i6&+LµÄ[ËÒ:ÖÒ/òLÓ¸Sò’ïÎõFÚ¸rÄN&×xCõòÉ%ÛZÂ&á¨Ê!DzŽgíÔÚ‚¾™|1·²­õ®Nw¤z‹Ô;‰B½Ü8l”œÀùް³­AÛ­„EOtÒê|™]:Z§l Óyñ)Å¿z¨o.Nš M°±Ìnš }Z.è“s…›9ý-”wøäB ‡~ lçy¥tÒ¡x4ôÞO.STÜû1#:|y 'ÌÀ y‰cÁKN£=ã9>w(ÿ+à+O e pB?¦„{úä3EupªƒYz7'3ñŽÕô!z,Ó+w/ù§@u;|ÚvïšZáF\C\ÜÜ?. ·MѰݪ]z2¯dJjí]#>¶2+½èq¤J(¶ÓD1fÇG_K“šEóE>?Oëm(ÏnYœ½¶ Œ±’ÐÐd=Dhê.å² ´¹ðsžkboÓ÷²‘ÊØ#É?žäªYÀ!x-HþÇv™ÂÛ-QXTC$6»õ ߆°g|G+>°ï™W‰½ !ªâ}è$H9¡´ÛUšF¸±O’Gðñ^e,÷­]¤Dû¬¬Ùgö@Æë¡nÕ•º,IHЛ¤$Vé›Qït¤¯:Ýp"YŸv·{ièï÷\ŒÊ¤í`íVÖ[ŒÙõ‚ø‰¦ÏÈ#Úä_¨ý¢URvÉ!E¸Éìn”)òTËáX{—¿{4G\8°Þ¯úõBøySYiînÝKOu'ó²4öK¸ý/¦+ZÍ.­w2JòžWûV½×úy¡™SÙP\“iŒ>ïDÀ]Ý‘7š4aïS¼Ë¾£ˆÜX¾mt±ÒMR ·‘ŠÏ· ÜE Å姤v‚|ëRŠ1åýþø7Ôz‡Çj•i< ƒ¬ÌxM“J‰È¬!˜”I`·¡TšiCÈ&ÐþÔøx8U£Ò1é㿥ц݈bÂØ¶ÅëTeÞÄlˆM‡ªZïLjëév´¿mQ½¶Òù“T 5ŽsëF{MI)ö –ö:“ϤòT&È wÂ#ÏÛt3àë†NK¼k‚¢±¿Mס°¶¬j©9óÞîI2Åï(JšÍË­ÔbéÔo:=j|Õ‘ËÞ"*´ÞN^ÙŽ±N¼(23`årÒ&±nê&7²íÜÍÖ*½4BX²!‰;ØVþ¼ÕUÖôéÖ·­=À3•“oLªæ.ì6Ýze”%…wfGgןŸv¹sò^^#ò;C.«1 LÉ6ø[¢â¬Zª&ZÅk)[>©Œ›U.ŒÂÕÊÅÓ7‘à†£| NbpŽ€CÚߦ¦šì¦äs 6~Wì·$ŠºÜÚ+ÕÐ$Dk|PS²&Ùr jø'ÚTv%fñÁAbLâÚS ÜÍCÙ_Äáe“Ä«øÐKñ-Xú°GêºI„…¼¦2R¦­µ‰auy“qh‹F*,‘÷šXB–ÌJuZ¬S'Þì¥ ë ¾†åþ*I ×4g࣎ÀàŠjäŽçÞ5[„å–°ÛÆÍ˜…:†fl³Q_uZ³ÝlƒŽÀ¿ÇÝÀŠ|šxq7‡Á…ÇíWÖNrOÐN[àŒ5’·ùsAÌ}ø:7[,Fݸm_ª„™ýä’,»Ñ‚û ÓëZL’êÆ¸iø­0É«_/¨rd\¦§NœøHjßFò…p;å•P"O(‹2Òm¶#‚ÑÔ;¯0ÚŠx`/lØ´©á+ hòðm­cMˆMaº-^–¾õò¶ÝòZil•È*GoªþÙ2á&*I¦.ºÉ™¤ 6*hð.ÿ¼Ìˆ wß›”w;ÜÑy4­¸µ íi·Èü¯,Øj³°u=C6 Š °c‰¢tÞõn÷«ý]8áFί³Ìá\!𸆎¿yÛþÊšz¥øôø[‘L>u=^<—&¨½hÞ`!ãкOuÆv1êv bL“Û4+¼iµ…$Ò[Dª;ÜÜß–ÌÞExT Ó™M…¹á6’¸ÞÄo½‘W6àÆ¬ó–¿|nÀd÷íª?¼Ñ‚þÙ[)Kà“( úæGißÓ.ÙM5Ë]0ôŠ-‘°Ä¾q$Õ™’¿%C’J­'K’è19Îu]Ð5¯ò<Õ>,/\E£khÉÿ¼¬¬5ãÕ¾;€v„hU0¢¿®VF˜òBwÿ¹ã-¦¹©‘«ÔŽ5Êîe¢dü·‰:·ÓQ’ìh\¡‚Ьi¾7ØÜ NkÍÆGÇÞ™•ÇÞb5¥ïûúã^™•gØï?%z_Ö§u4?Pqæ+*ö)–²¾ëÕñ… ¯²ùn¯bŠtçî,ÞµW5½ðEÍ9ÀÛ-jÏLš»þް»öã„Wwøßni•CNðÜÖ(›æ\¢ xðÞ?p<гðÀPGÇ=ŒŠ¦ÂoŸ7çJ”ÿøv:‡oŸhšùEÇi{ÍјâÖEóÞozÊþÿcˆK$°j:hœ UbˆÃXº&†¾z2›å© Ó=yÃÉ ¾vs‡ü*/ñÕM~—u¨Ñ(Jä5`ƒ:Ù=wÓ­MhM›æiI¶øÌµt¾äZœÞÙMÁ‹aç=Y•,ëÜOêÇutÂBë0ÖE—¼³JhCÛ ?Ͻ_–˜½m¾%`”Ô&(ˆž¡4mU;įbÐ`@w.‹P4†ÔÒ ãîÀÜy¨Õ" %÷N9$͇nm*áê’SR8Þ³c¥°Q+IhwIž\úEõ]n¶Û«51Éã«òc`¥ŒãqÅßÖ;ÂÖ’î|ÚîÍ“Òá ª?/ñÕ–-ŨOovpm½gÎÐ9)t& };¼mÜWÈ” s€;JVf‹Ë¨~j¬)z×èDo©õØuÍÒQ¼sùפ`XIˆÊeô–ùê´x_×µZËø$Sð3¢‰ÞAþ!¥ô}³¿˜×ˆóÊ_Ã¥5{@0 ³Ç…ýך‹0Ó¯ö0¡ûûòìÿÃô Çendstream endobj 452 0 obj 6024 endobj 456 0 obj <> stream xœ½ZYsÜÆÎóVªòöÍ€Ë aƒ¼‰Š,+%)–µ)»bå)R%‘«ƒ”"ÿz÷9€å!W\.Z `0ÓÓýõ×Çàýºm̺Åÿäß—g«;?ׯO>®ÚõÉêýÊÐãµüóòl}°Å!ÁÁ­flG³Þ¾ZñËf=Øu|cìz{¶úµòuW5µ­ üëè÷&´¦iMWÝ«7¾ú¾vÕÃzc«-^=«7}Ó¶¦ |ó_õÆÓŒ¡§G|ó?õ¦«îà «®z„7éÉã4YpðÌŒÕÝzlynÐWOj˜r ~¤Iÿ»ý'îÆ›|7¾š6À†¶G° ‚u‡#7òdãÚf0ãÈv0à?E!k_}ñp`;TïðÞ[PÁ¡ zÏ踑3¼úˆÃ= Õg”ð5 Kp¿%mëÔøw÷ý@÷qÆ péi‘#ZA¥š$¬§*8Æq–~ OP.ÉâSÐ: ¯ÒèÆúžúêù|ˆ žÀ_Ü¿OÏkÛ³1.õÞêÓŽ¾ñÁ¨¦¿à,ø²¥UQUÝÒ²qŸk!i­Ð9x‡ö5†~ª8™¢>"@  ƒ¥Â"–~9|±³ÉJ8íÂFSÒ}Ü9j°á]_ý5N"úB±}¯úîmÎ@8ÒoŒkº¾µ¼)˜Ú·–‘±cÕZ”Àƒ-ÑF‡zOLémKÚâ!d;ÜÌH£Ìh©‘•1ËØä×Û¾œÍÑ%®ÓŽtIPÜ•oDx¾ˆf#YaTFp$„üü‚“š Úx‡“:×¥‰qRÔè¥ —‚7é¨Y·]5‡»7>‡:¾ìœGM)2À‹? –o{6r†}Ò ÝWÞ9M¦‰Ø¶ênrózIT¼î‰p‘n•0ÔwœÛ¾o+pÐäx½#oaw%²B6–pᢎíˆc§@qn ŸÓY•¬üH·3.ŒSÝ«+–¤—j"$}눹Tø8„ÀQŒ à8Ð5î‡àáÑ#°ê{flÀÝ­¶ßþZý Ï"«œ3kãnœ“¶8 ˆMâ^¦ájÅ Örd¤ùœÛØá Š D1N&nÓåø¾TÃ߈˞Wº:nãô‰ÄëïðEW z¦ž_HøZ˜ôêv¬ áä2=JÒ²‰HàéË(öÿ”Þ]õ#ªú¾ÝÑþÉ`|4}06(;*®’«Qð€%{0ˆ† ¸gKçåÒ;¯8tyHôË‚ÏÓ"Ïký)\N[/©¼ÈP‡®#d ·’ÁþÔƒp„ïi)U)ûHßJeÊ=‘XÀ].t¥·©Î·‰¡žá<=áñ(9· â0‰œaŽ<É9CóïJ¹4YÈðø†ó4\¢Œâ‘tz¯lõ©v‚ðaÛÉüÎ[ ;æ|34v|˜68§®H0-ìÇ1ÈÇ,EËa!£äD¸G%#' dL*C³‰ÿÎtsç'7ôyr ¼ ÝI¤i-cJŸ%¢øÓLÙÙŒ‘Ø~a¯‰¨„“8°Ù,8O¸²1oæ} ª<àe½Â±ôÖèrÃã“ß8XV‚îlqÕ; ^T¸,%N›UÞ©…Å` &ÔŽá"þ8΂iOT…Ç)Œ&âŒÙ~Xù¥ŠÆ$ˆ¹6°Ïû¶ð¥ëÕ˜Èç«Õ¸ÚØ«Æ=‰£-adŸ†v«®B÷GïÈYÙ ”Ù3¹çéJh¯ŸÃH…I6Ñ.Ù K<„íÌDcM ÅËÜD1¥èÁ% ò) „0/DÚ¼&¢»T‘vqJÐÚM³E®ËzŠk%õD¥Ò}$Á€ÖÊùêtó8“d™ËDò Huþ~©¥¾¦ðžœí ›—Ê1ƒ…¦(}—´~”r ™îÏ@°“K¿˜"Åi@Ï-H@¤?¡‰)âìA—Ý~ wÁ­º¨ƒ¡\ÙRÓyÍeÕç(y`¿K [S Ãéè‹|M¬÷Ôű9òbÁI‹Ú0¤Âu‰ ¸^ßH¨B7XlFúýTCÕ?ú¼ì±ó©7:ÞL¢lbyëbFOsImK5¥/’Ê)éU®ÅLÚ·>6M>.TdK™`ÖÝ0Ènn1T²yu—#[µó ¾uÀãЃ³w]Œ³%o¹D#³újî½ÀµXôÜèý7,‰AlK…›…+ T¤]^ LN)UoAZ›ytàöÉelRÄLÌÀk\à¸,§¢³‡)—“æF—[2óÐ6´dá¼€‹/fÝ‘ÞoÛÈòZЇí9§*CÊÐߪc»žà.µ!F$LxÅy\¤.度KÎ/-Ü'Ì7V=©a±Þý!–uô6‹FK/PF( ˰:­SC9Oàʆœ\ip‹ÙB gùVþðüÃhëN¶Ybz¯É#ÇHõõ²æ„ÀÞN•¿ÃÇ>rFBQ“"ùkÓíÂÂFZ œ| ƒîu¿\ä%¿Á3/Ý BItŒ¬œ¹Šw‘Óæ—°B;qÓªòfí-‹g&-usbS™²ã!a ³Ð.vÛЭ¦%5 ¥ˆª-Ú¢æûZ[¸jDm7¤ÜI[‡ì~B³¸L0Ê#!¶`Í}~°·!–Ò/¦6ÑFÙ¶ÒBËM¿Ë>Ò¢ íÇ&!:ÃDÎrs_£ÐF˜:ÞÝbS‹ttå~Œóĉw—r–_t6CK¾+4—haÞ>‘R¦l¡~oÒ낳ì?"el(?‘bUZq6Xm~уÁg"’¿Hº`»Râµ— N£„ŒÞe^a¤<éù§ï²’ƾ‹Qk'¥~TØYt‚e¿PFÄÝ0;癳íÛ¬¿+EVR¤ØœÝ²‡¬0?°ÑÀ“Wë»ûÜŽ –ݼ%¹¯8·c¯m[Û›¼ã¯ÔXžÞ c^–±ã<Ƨ‹²Ìz˜§9»ä—±+k‚bGí|¦Ä8+hff %çÝÀŽ'’,·óËYn¯BGÔ\kK[i×pÉ‘æuTW½G¯‹Ä ‘¡HÒ_gN:t™G ˆ}rì|šÔ§½o)¹`ü  &«ø›ž[ݪ?¥€v`G{1ÖMÑ’õ×f¥+Ñ$¡7¨Êð£ÆrGGdÎ’–t€q†é.ìÇ,G4‡$¼¤ŒyPxEÍù7)BlRhM%4¥Yýa:Ð]¬Æ ]èGöªí#*Øq\ü¦„…˨*Þxè}ô„G.š$ •ÝV:‡¶~zÂéíÐÌ3øT¹‘ó)!½ã$êH8‰áæû'ÉxM…TÎzNŸçY³coFÚ`aÉ'ŸqÈ©÷däѹ:ìì+y"Y.o­DÓì¼vvTëÚÉ9²vhÌþ³í'ÈŽ½’ÖI5ߥc®wÅQ±~SˆÆî© _wF®Ç3ræI †6 ìœdÊ(º+ó ›‘¶Ê’Tš‘çºÝ w}äS9=ÃCz2Wab›ŽY5Èp¹=•Ë#²óå¹ØÌ¾LkÓ‘›#×SâØÝü¦Ö£,þŽ¡ÓN"'vÐh°¥|SÇÊÛÔŽ”Ï…úiÄÍO5gi˜`8>>%.Ï~Ï„ü © ‰:çÎÒ>ç}; AX8Ú½Â/ âÇ2×Á(Ezgshq4 Où¡‹ãÓ†«¿ÀÄH›qõòôêþvõtõ~í\ÓÓׂÀ/a t3âu¦ñ¿?> stream xœM¹nÃ0 †w=GqJR²,=Œè•TŠN)šÉCÐ÷J:qÿûIA È@vNq7»‹-§ûG°wÇ‹ §°›áª’Y[±QcèßîhfJÍ‘úì>|ÂÁŸýÁ,5[D$ê‚þ¥ä5†ìïck57‰â_1ˆïÖŸ0¬ÂCŠÄÙgUi*þ%‰Dcñ/f¿Å¤³™É–ºlxB±²–³ìÞ¶>£ùaõ†”kluÔteÞÿä…¾Ñù­}Ãdå£]ë˜cë àÈ8Š}ÅÔÝFÏ/ˆL§endstream endobj 462 0 obj 230 endobj 466 0 obj <> stream xœ¥Z[o%5~øyÛsi|o›$@ŒÄjÑîÎä Vì0É$#&—¹˜ýõ[—]îî“I!à¤Û].W•¿úªì7Çf²Çÿ©ÿquôåSëÓñÅ»#s|qôæÈÒëãú¿WÇßžÒùØ™)%—ŽO_ñÇöxvÇqöǧWG?í¾ÛŸØÉ¤óîrâ&ç¬÷»ç{3™Sòvw[·{¿·Sp%•Ý9ü*Þ¤y÷vâçyr ¢,ï³uÿ9ý»L¦9ϧq ¾äãÓ~þÓî[˜Ã–4‡Ó¡±Àlïp6_\ »Wø3ecâîN‚s;VØ»4ûÝ” i÷ €ßðð”Ô‹Í»gð>d“b{Ÿ¼Ûý“eÙ¨^ï]™"|Fkt¹xXâ ˆŸ/´H3›Jٽğ³K¹t½³ A«èAÔ9ÊwS ~÷í•æ˜w7¨Š“-»»®ϕ᣺Vk¨‚ïøLT°>;1Œ¾7Xp÷TLaã–É&ãĸ`…€M ™¾Í&cÑ’~† ½}¾èà4cM…pÝœçÝÁ¿qrø”^Dù+ŒÈSãÉï!$Àn(ã’?<ñ!Ó¬¿Ê\ïÐb¥äPH ú•ô‰,ù†ÜáX‚*Yu­Ô€õË3*ÐǶY=¿øðdïpÂL1àØ0Ïpà] çI š]iy¾GsC8N%Áæ9=ƒ=ó–ç6`0VÅá|ÑuMÎÅT/1Äè®,ˆ„j›¹ÚK¼dG@ãà÷8¤ ¯ÄCð„‚&%Z¶ò("êw CãØÙà´Ïç™CÑÏ$í5¼yÍÙfëI›¿,ª-ïﺸë6´/äD¡™NªN¬ŸbÄ­ŽæÂ€@Åй×Õ¼>³‹èo|AÖº‚J[·û€##™©þ{ÖC¶þé‹%Sád7ø•a‘ø%ÒØ.™ÍAÒðÙ ö€ü†E nåG”D_]u“ÜŒŒŽ*žf‚MÞcÈUk=cy8ô3Ô×X[FO D±¤,Jϸw]ÛÊh»‚±€6÷ÖNs M†ûUT_qzOæ«Ê\wÏž© ×glÅû³8ŒûÁ$rêÚ*ž±9Çí.Zt9²ëË¢p«k§p#ðC 2Á¶1sÛdʼnQLâ@7§Ÿ‰ÂìJž½ã'ÓPRC%ºŽ!,T{lDùœÈ×CÄÅLÈ1¢–X4Ap˜-H«@ºˆÂâ ´H”'€ƒèq-¾Ïû¢ïÙ{‰µG&N&H­`—D:Éø&CåÛ «—ay1‚ãõÏC˜Ñ›a3þ¤¼ ù×eÆËŒÚH’‹y³·[±v>(ÎqŶÀ¸bÆ‚&iŽ`ò–¢lŒ7·k> ëõŒh4ä¿nÛG0þÁ¨L£ä1Yÿ ñW-¯ @¤rÍàwJœ¼YÿhÌ_ :@Ñàš»ÕG"™T©(>{Ò¥þü°'4ò€‹hŸ-ÀÎŒ_²N¤ÝØ6žà<ä²Ìš©»ì‚·0ZW`­§Ûß÷ÞÕU¨ ¼Þ…1€çzÃTаN÷ì±j“{™FcV– {€Y­HÁHZ4¬·¼ãŠ„11Hoe£ )«î@¡ã¬Ê´ŒÂ–GxOi¥oæ(jïÈÖ|81\ÜÀ£¾â9‘%œ@¬Tж02_pìë÷#;˜‚殇F ð-Ÿ»Å È’T´€,»s8‚7íµ8KAë"ú¿Å Y¿|øZOyrÍ@˜åëy”³¼PCʇT#J³Š£@:¼«p旚eU=ЪH‹U;kíÏä*ƒÃðGQ£×Ö«£Gm‚JOÜì0ï21ׇC¯¦H[Míäú¶Â6®y$Ÿ’¦k$yÙá.•¶®Å©y(^Ð<øŒ˜M× [_Ëhà ucAð­*!|Ý‹û±¢)frò'G”Þ òáè=¿Ä»[ 3&”.µ¸éˆ?€ØYU/còäý€k Õ=`»LÌGMõºæ6õ貯óç] ‹/aÐÏ{gÉþ‡²¹ª…ÆâêPn§xô¨˜ßý ]ÙxÐÅZœ¢Ì›ìY ǰ``KaAFkEÔÉH% øÊ‚=?c¾€¨^¢A/Oäë;KÎT]H¥,(³¿—K ÑïHS¸x¯L6¬—:kLW¤ˆkX,Üx¸g])CrQõo†³h…ÕYo»Äá}p…ÓíÕi5Š×¸UͼæÍÆ«òJì Ú~Æ "ñ®½Þ„4æ-¸Þóªùç=ÕTÅ96ÆÈOÙ&¤’³E3d¨AÞ”ÐëíßöØ2)ꚉƒ‘4¥øVISܾª…«ðUyW>³¬¾“Dd…®¦ûÈ݈oP¥Ü}ŽÒ1./Ù>ƒ-Pjóc‹êC q¤!l5 ô†ÍÑXzªà‹3"êÔvZHY·Ó¬óSn8ø5¨ºÙuËS´ ŸŒCÔb={±^i÷!¢I¥Aú8¬^ì)„j´¦{~E ?=…pwOµFn:-^çÙuÏ5¸hXæ¶Ÿ9\ôÑz.œÓ’ûÎÂØpÜC¼å–·bQIìl?ÿXÖX|pvò¶,x±Óª8AêÛ¢y±² ÝæÔ=Y–TYY3Xuick3ôþF‡AMßâ³CC×KÇPâO‘ÂëZáóÐa9Äz\­úläÛýÒ„»Æ‡Î(-w„ì!6zÓ 3)ýµšÒæÎªÏð-¤Ê£ZÝ÷€‚__á7p‹a£F.·e¯ˆ‰ÊÕò7b³Õäq *uÄhêch޼ªÝðh¶3Kqvó£1†ßÊþÚ÷*Á3×v¡*¶UG~Q¨,:¡{»Ißì|¼åb“*’ÔnP‡(çO\#ÚBÕj5^Nd©ªZcµ>ÄTM[S(£Ë/*FÔèj±”hf&‚_EÓ6õ5W·²îmÇcÝýE®ÆºgÍYk…÷˜¬ÚÚ â,‚Ä¢;·#:ÝFäZ?XrWÈV7]¦¿Õñ#›vì”W›Æ°é`©u‚\JÄôáŒ-Ïìi¢#¥[ÝÄ­­‰´û/¬é3•‚ŪUÐ_×SŽWƒ¿¨1‰Pü¸‘v·ötÓˆá”í´‘ƒë@ì;¼Š«r+J¹ÌjVkÀv×"·vŠÚ§scѽpod[\Ù@~+äLÁý¨“I—˜¯·Ò;Y‡uæ¢æ§QPÇ蓨ö髚£Ó”[463Ä­ >[Ú7Üö”øßž±ËÔÀïn3‰‹Ó„±E¹ÅÔÎjÙfz¥ÓNæ|tSS¥ñ.rÎÒj*'«Œ…þ¶zÚÌñOàÙàsÂti5UWHÒÑmæJ ¤ÆÖ‡ I5àÛ5€È@3“£1ÑטêËÔÓFû PW*4Í„j99ÕgÔy+Ïæñ0íç8Ôb3CõZx6ÖêÚ’Og¦ÀÒWµàu٩ЀۧÏq Fµ !oò‰ôx<ŒâR‰`U"PxLNÂuôYÊëÕ|oúßµÜëÆ È ësþl•3„˜þ³úDþlûý¤ºð1êXÁH R4˜Wõ1á5Ž Ë:gÌë vj¸ºzôôJ¨@CaD“±4W ´j±oíÊ‘® PˆŸºlîì-|ÍÙ‡S(€4TuKȧôú XôåP.³²¾¥ \Շ䰥 ‰Á£ ý,õ¦h­/; r-äþ€È‚1ýìéîÓ ®9ƒìðZ†J˜¹8œðº$ÑM˜ Ä: ŸéòPÜÓî{¼U ÑÁ›•&?oš2õÖiˆ³ˆµ)P™€üá9ü‚ põ‘³äTG—¨âd¡Þ}Š« PŒTá1=²þŠ—Ÿ¹­¯Ïá!^êÌ(Ò`S>ùX̓Jì—_í~û'E~u³>ű•´eé2ÆË}75¥¯«Ï™m¡@³±_KGªz°Ð\æ… ØOçqØb2¬ÛÆÅtŸór¡1€t€P£^z +’¹÷t¤mKUåic~g\ó1øyðÊ€}M]µ“n¤^cƒÖŸßõRéÉ^˜šðv¹õ¬ÙÞ`4cä¸e¢®n² ,[íPÈéI·.G>Ë«mslY«@£*« &Hºý+è –ßExÙb€*lº_ðÏ ® äí/íÏ·òŸ†HuÈóöëN¿ 3·5¿¤™\©bíb¯Ï?{§"Ôp§Âñ¤aezݾïë{§vOl<ô•‡_à¤\'|ͪ¿hÃ.·¾íSþÑõÈÃ_úÏzibߪ˟ô·QÙ~Ò©zoJ¯@Šš‘Èë1ÙRX¬ûËX…ÜÓØÝI_oúÜvŽ ÒnHŒÀ†£  ïÐL(gVcmcM”vÿªû<ºnó¸b–—.Ü‹CnÜQy\ïËÁÛí`ÛU¨4\’/ã-Ì÷ËÓ®Ýd¾§”?ºf¾±H/öÄ\ ÿV‹˜~Ðá‘o™øqÄ'¿¼¶ÛÚ 4·6¬< enüKp>ÌÕ —#¿Yá%d;ÉÝ¿k݉ 9ô{È8Á"µÂa•ë`JêX<2*ÔæVu³¦ø!›ƒ—:«` è„BÍZÞk·l‹ñW½;»YÝ»±•d]½æm±Ü5R±¤º4ÚDy“æWèêþ§]õ¦@ÁSø’€ª!ñ­Ï€ÔÂ2™ÿþôèßðÏÿwÎsUendstream endobj 467 0 obj 3829 endobj 473 0 obj <> stream xœíZKoÇÎy¡±ÇA;ì÷t R$˜†[ âÀ ¸KRàkE.iéß§ªú=;KŽdSÎ @Îô£ººú«¯ªkøaÎ:>gøþ]Ìö~äÒÌOnfl~2û0ãÔ=Ž.æ/pˆâÐÔ9æøüàxæ'óy/æÆªŽ‹ùÁÅì?lu#Zý߃oqЕՔÞt¬ƒ%Œ|Õ.TóMË;ç¬rÍß[ÑüÐ.Ds€í¯ÛEìø±]HÉ;ÆúFƒð®]ô½…>Ù¼lMûw»0Ð/D³Ÿ§½Âi²s¶÷+½iöXƒƒÂ*8±œó=̲c\ûAÿji HqÆ9TJ :¨Œ0 ‘sÌ$(!5­o\(¥9†K”.- ý?.ŒiÁIИV¤e@5 óú^SÖÖ_på:¦æ ɺž;çMz “šXe 8z:“mZIÏKÜî9¬ð V»`û<:ÐìrÒúÉl’Ô%µ²‡í(Ùœ‚dæMtã‚IqÜM¶ã îçHÜÅõaIܵmÞƒ—yÙbŠù¯Í-jŠo—øpøG¯DïîÔðBA™c<&X*ÌMó`¾W½•pe˳©6-ÌÑ©ˆL’€‚î$ ÷øEag ‚ïZ–òVBÓÞ&,’r¸EÑüç:”Ö°<÷Ðk†/Ñ"3…üËVÀšVËB0.sŽéTzh?׈&ç4÷[Å6ÜÜÂïnhÕ† ¿I8=ÏMT'†šKe›ß¢q 8·pR(:7DO<)MÂKÔD£Á‚×8DÓAÇÎ&@Œv*š3 Æ»ñ¾ïœ ÑâÖ¸2Ðd¦O-À¹kƒ¯Hîj_ѕ΂³ˆÎàà=÷ƒ€×Ü‘ „‘ïÙ௛„ª_ñõÚÛlAG$ñȤïXÅ^?˜Æ]D`Ó…²†¨h–¬@ëqÞÒIj,ö™5€nÍñà/Mj=ÊCOSãan¼{ƒµŸ§þUÕŸ•Ž¿>¨Ixú¥Mý¦´ªMÏx`wHJ¶r”Òà”¢38!Å‚‘ç ÄŒ¦s@|ßz Dúéˆ,±¸Û2k'ã"™D§ÊìAsm­Çn`ã¹60?Zkš ú+¯¢.µ µOîi¿h‹{\)½Üzn¢åÉ®xŒJŒyS±W^¿ß¦(Ò¸ »s”æ‚õ fô¢ÄÃTåÅû FU©Š9a«F˜!Umð”|k‡œN'° /LQp ¹‚d ©ñ{djæõ@ÛìE§ë£¦5ÕöQc¨fŽÞ:ÄÀ³—Aèò,Fóq!i¡„UÔË}h #a Û…ËçS¦œAýØÑ}ÝÔÈŠ–G¬¥Ë”Í$Çõ¡\#9–d>ÓF5ŠÙ»QTÇcž Ñk?0äX‹*w‚”N_%óë¼n©qAx‹¸aÂ™Ž¡¥‚þ½ÍÚö?­vøŸÁÄ’X8.VÑE„Èä”ý[eü´ÿ)Ң˸*äHQK0ª™²»‰\¶× d§'Æbó‰ø*ÅÞ%EI²ÑÔ€¼N®ÓàÆR|ö¿â8ÕB FeÉR°™s\5nF#ó› d Heæ‘¡¢¬&V ‚fÞ{BªBá^å Ű„¯ïŠÈË #NP–.ÐJÆ-)çÑrU¯¸O•óÅuüMŠÔ㾪PdGJÀç¾t…" ýbô0xÙux¡zAÊIIá®(œŽ„:hz=Hf&º Wª3FçiŒ¼Ç„KÀd¨aöâY¥ƒÝ­¨bä-¯(DÔŠ>à5Rk¯ á|uÔz@–c,%üñqé“ȕʪèx8#éÀÝŠ9êkoš{—jœ¡Oa6ÄåÊü¡›Î°êФËíc!R¨¼¹—Žý+¿5 ̼´ïTÔ„Ý jTJgïC Ú*œŠk ¥¨Æ:•Ø{¥)ËPâ‘ù²÷Ä®ø—»`Ø[QÁ<±Šn{Ê`¢aq.ÂêŒ(îÀAEÉ\£ý„S8±Ñ˜Áw½.K) Ùr¬H@KO.¹°MÌÎñjRAUÖÁ`Ș)=(¨Ý,'.´^¯˜ðT%ïâ3õÂÃ/p $f7Á§øLŸNÄ'âm—JDE%B¼Ÿíáå9‡»®ÿVqXÆÀp)Q=VFb¨|±Að#z·‹ˆ@u GéÒ¦[Þér3ôÑNs.]#Àq9¸³ÁÂ3^M­ép!e–IŸ‘uÂX¦ñÆ ù{'.¿'aÌõHH(ÖzÖ£/®ø}æs«5}/‚(ÜK£ËÇÌê wTžé‚©}:m;Ùãgl ‘Éw !¨Ýâö¥âF©3ˆï2h‚ë_æîQñ£µ%á@#×G¿ãÓÊJxo/ªæô‘2Õ&bÕ{> Qˆ'yü2æõ>ê„*«)ëîj'ÓÂÑ Ü-KDûŸÉ»ÖÉU.“—¤i~pô&úÐWχ|#c{ÝŽT/+hc.˜„dršú)•I7×§‘þ×qÜÝVa²¨y¾…R˜™=út¬°y èùئ+sÝ·éBfNW•JÊùlðýØôâxsÿÕXÅöjŒYV£›ÿ›çþ‡|^q]1•´e帮çi”ÅA’Âuªp ؘ’¼OßvÿH€/k€¦Î"h¶hù¼4Þ”h™­}ö9^‘ëâ•S$‚rŠ'§xl§¨¾äÐëTÖ_Ž™x=b»'€?üOxDtü®B’íéR~­oÆlü„ð'„>ÂÿxpÓŒl#º÷ž|¸Gm> ÜOIû¸¿}ÓëÇ:?9¢ΊL­å¬ÆŒÿÄëÿÏП°yúN¨Jô¢>fô†>¯Ì3D¿ÈÿÅ¿©”ª¼€†Õà?å ?róq ãÇÿ°ö)øm[AüSå¾ãEÞßN›ðøß¯Ã±ÆÊíccý_[ô)îíì3ñÿîendstream endobj 474 0 obj 2730 endobj 478 0 obj <> stream xœÅ][“ܶ±Îó–~ļix¢’àC"[Ž•R;V.§lWEÚ•V.K»².Vôïú4@pvvu¤TÊÚ™! âÒèþúënä×M¿7›þÇO_žÜý›qãæüÍI¿9?ùõÄàå ÿ9}¹¹÷n .þ´ŸûÙl=;¡‡Íf²›1ø½±›G/O~ØݰÝwvkñïn ó~ãö«Îmt;»}Ôíüöûnçܸïû/<ìvf?ÏÁÏÛûp¾¸í;7l¿€gðŸûù¦Ø´`bМ¶ëè¡°ý+Üû÷NnÅwâK¾‰=[¶aíOþ #ôFÐÓ¾qÎâÀ\PüîÜy;ïƒßì\¿ŸÌ<Ó ø–ç¹WOãw[0~ûs|íe|þeìhü°³!Þ3Û³x7Þ7Ä̰}ßÇ_w»?àO;¿}Ûá_hÛpÝc…—6ð¸jð 6ÓO±0ÎyÚ^Èñ¶7ÐŽ‹+¤.ò#.67Cðmwã‡÷0Z¸‡CT=ØÁäͳŇNãÃð¿Qf^>Ñ0_ħ_à$ÁüÚ9ì‡Q&þ}§kƒUãÝðs/½€wQO߯QƦã§çj”<»½•~„W¥i7؃ø4üw²ŽqZÜ L(3Ïà+÷΀èÚ¸%ìöËx 9ôÃ. ÷~û¿po¿ýq+ ÑÇ~ì⯧| 7M8ŒØh]66è¶ÝHóýÏø}˃¼v ì<5÷¹¿q¾ò‹ ½˜¿EEàƒÅ!¥] àõV†ÅãJˆìËz>¥!ÄÆpÈÔã`|¼g06m—xÑ9¯„å- •óñ»7"UÅ^r @óö<¶"ÕXI\•„}X3çHÌ.ж‘–¯ ˜HÿPN†9P7aÛçÙ"1W³•~ƒû.á+JÂöIü8“Ž›ìˆo|¥剆gYiÝ6fTZÏ’ö¸,vhԯŖ„Ç+°'eÙùƒ…%O{GúÆ=³ºõ˜VþÊ1Ú‡¤ aqp3 £°, h0(Ð:y%wF´ÄEAèÍÞ{‘ƒBí]o-íPì)? •·%e£ž&­½þCö-Ê)ô'ÌáØè™—]4/q¦L¹ŒZ^½iŠ®Ô6ZŠììp©`îþÓÖ…¦è hµ®§»QݳŽ×FŽGo+_ ›}™°¶îøúc ‰–þ•ö¦ÿ-\ô(›ÊŠàåKhä …¹¬öö*J ZÇKRßnú,ÎÆ£ð¥>€ÍžiHb,ÒkÌÀfËõ±)›4Ì«Öâæ73j¨’m¾pêœaÕŽ±Š3³Æ*qÿy—›ß­Fø!dQñÖ-ýú¢jù¸Ï÷f Ó½Íßä¿Ï¹B0è*ªÓqïÆZáñnš£„eqsP£t¨hPWAçx¹^jŠÿì‹«¨"P•oH7;øúSü§ÙÍmÇÆ¬6äàL?ã2j¹ñ½ ]á+ÞZN4Þ.6gu²CEôÕ>•·è}ª^'@ š×r]÷¥0ÄÑx3&-ÜRjÍU²Îímø¯‹âù1ÕØoÍW\,ƒÇTc?]%Ì€l¥vî·$…ÓPÛí–¹?RQ3Zo 6¦åº£ ‹ïýEºö^ô *®K%›ÎXSþÓ¿Jë›ôpä_’*„è*î?@g¾óvé‹ý£SîŸ|ü¦k ±©ÐF„™YR`uL`¯ìáÉ£ÿiûe î†Ýb‚³ ÞtòÝɯ›ØÃÝÛøÎ°1nšö>l†qrð7:Ì÷œÜ}ð—ÍÛ×ïžžÜýçÆœÜýþ¹÷íñσ/7¿;¹ÿ`óݺ+]J¸ÒðóµbäK¯`¶õŽŽq–Ãçèè8íG_ôõLÔ æ/ FÚª‹‚AaJÖº@€ZõFZé½—Z4ÀX|¾P†Äï°âKWó»VçÚa¿>Ã\ƒ_ËG †§q?~ŽÎN=B ÝÙˆAvÝ{\ä;rŽMvÎóÕWY5¼…U09ÌM‡¥ï}bhð‰ûw–î¶fÐeKÝÝËN¹†äùO&ꩬnwY¡/« .Õè²ÎK„¾ØPbk?£MnÛ…3­èÌÚ©?ÊÁ¶À̶Fk@–ñ ÖÀÃñÕvôèñ²Ùan£ ;öy‡ãpyÙa|%øw¶»ç‘D0£¨sñääÝ3xôµ„e‘Ð*£4|¶ªêÝ™p€N~ WÐ8å|ÙÏ-EÄŽðbuÛ¥ÌÑÔØÁµƒ¼9{ˆ`§ûíáTÙݹ¥<|7͸¼ÅB°¤Èr8 iân(†Ð'·pÆÜ×>¬Õ¹xE ï: !"†–".í=ÈÌ ñMn"û«á¢o×›ü䌠«î&=A²c÷C^YFôÊÌï~:Â+/Ç0Ú1ÍRÞ 2K%ˆ«TRJ31ï3ºyÞb ˜ƒåQÚ¦F+YG_©zj€×_1ÍÑ-#Ƹ¼4ú€„D^ÀÄ Ÿ25”Ö\µÌd—ʹÈ)Í •pF…~I‹û†ÖfWÉͯ 7ï ¾ü)¶ú<Íø ¼¯Ë"¤òŸ¤ ÄQÜžÍ,X‰è¡dØ ³EírÚ9Ö‰ÏU4yªèÇ¥K¯ÅM«”"[(7áÛ2Ï‘õQÚÙF½RÈ4ºMùZ…øÖ"㽚€<ÖòˆWs”ØÁ„FÅX†@¤—ômOäà{Û»øÞ óñØÞ2ò3AçOˆí{Ø~và'ÞÞ;„œŸ¾¯Þ›±èë™ÚÏñ/h‰£´2“ö¢•‘A_pëX>W4Z˃‚IY:³Œ?®åí0,þäëâ6%n°ºøé»§dMÑÙøp¬CÁXÄ›ø¨ÿ⋦ƒ*rìQ¬Äã}ÐFUÄ ˆÁÑ ÊU¡¢Ëf  4«Åí0î=«~+Te y¿æÞß´FMkXBLj-ÀúÏL§{ñݧ¸-Â$‚+Æ»:[Þ;à3PDLÇ@Jü1dèë׉•ù2-Zʸê_¸€SÂöF_ó€9º“ƒ„Óæ½] ÛY7pèZ#lîä!„mYx“]t6P„¯vêØk‹°W1¼Zðr÷Ѓ Óhx ñ0œGFƒmhrGë òh%LäM_Ȩç(ÇÎ!z_ãH2™D´ZRÍÒ¡¨¥Eþ”  ·Œ±:É`×Ûe“÷«PÐ|DgpŒé¸°e°ò5‹ÎÍXv¤ £’“=ë{ÎÉœ&$¦Ä£zø“æ9½™±?¼ÃóæÀaD ª”R¡Õ©¾“Η*ÂýÀ­þ+þ‡ÂÔ2|žq°O¦š± ƒâ$&{ÔÓ–¶)AgÛ`Ê\ïW4\üY(‘'ÚVØÄn«6Ey΃Qy1B’[ðf’ÉË|ûqžCæÔÅß›R$' Ê`þŠ Eùó"%SpN’ »Ï¿ãżü@£G{ŒksÚ'T«âz*”SKJ°Ïp¾4ß]A¤¥Ÿ7ÕÙ%¼CQã… œy2³õƒÄÓ쎌3°çg|9íp>0-å^‡I^0'Á‘[õÇd4î¥}ñWtÿmîMfhT`¤GöEn+†k…=8c¶ÊSÄa.É“$ðTž¸x,;¾{—B+ cv2G;.£CgÀà‡?¡3Mߨ‹ãM—8±þsôu÷¶èª€(­Ž$9¡ˆäÄŽ]Ûw°6 È?õØ,ÈìÇ­C„7`»²«•ÊP­ÆÕŽÚ;Mã;æhwr8yBëU_ßwÞ˜Ï3‡€Î&{Åz·Hãv·‘9üÝö¨ét·s0屑 G´éM]C;I¤ïŠŒ}˜ÚÞ kgo!ù˜à=fꨄ;É j%?5|¿Éfƒ*¾Ú>gRÝÊÃkûm¡BÜ ÕÆÉSkcŸ\0`©Ã`èÍy\{ fi¨‹ÙP©%v˜@@s}‰Ì´¹°ì"›½Q×[4ëZ 'y_@%Ãïw2:OwšnŠ\Fر€ñ€6ǵô•4:£a•’U$ Ž+p•»æ— “Æùñ4FY=.>Ü<3Ø€‡Þ££®¥DdïW¨7»Âô¶]ÉDã^‘¦á(üs,""ç¦aøÄT® Á)sc*× ?}_ÇÔ}-p¾^#•¼ÉDq9ÉÖx̬N+¿¨oÄù,¥F* Š þMƒ3ï)}©`ªŠÌ¸*\[Ør?¸Rh/sÅÀÕ$ Ö1Ôvˆ81ùx»ðŠà ¨U|—|cfíD܆¾±Ö=#àžœ5ôðêÔ_ŒÒÍeð˜·nA›ÂI­ESN/lÅóŽj§2Ô/ø£d0°Z§ÈþÍ¥?E2ð_Ñ ¥èýLÉ>ªS—É£_8ûšuc."=eýT–‰%1@¯’™f;˜m+|N—¹˜€˜m¯ôäk.Z±:û—êBÀñ&gÒÖæ0Z‘œëø‚/2bùª1•™¦!•0јNƒ5ú»‘â,¡X+F©öF»Š ô2Ý\%]­ )¤Ow÷K$Udg•œÓL›úú‰²æ@z¹d¥ßRˆ^ÀXzþF¼ƒ¢Œ|Oø«®r¤å–d9 %Û#mù‹ÒU¨R¢çeû$…‰lr#ø‚Ü yÔ䯰 3Gº‚)Ôw¡§…•Ù£L0Ëã7Î2LæÚêÝhr]bc÷ËK ç"ÉÓEfì¬!á8Ãbn ~gI~ý‰É>HŠ3ëLœAàI*©¬ 7Ÿ~‚3n·ÖÕV½¼bµ0i²WÇ,,+tˆL¹¡½©¹3úa)Š5iʃW$ÖSôãÒ“Õŧ«s‚87G[lÖG2œ‘0ÁRd®M N&ß/ê›.@’4[œï´¤2*—;‘K¸-.öØ**PæLÑ·ÞÑ´-P…7E¥(TϪÁsÔgydPåŸ{t~3gfÉZ²è4lbÁ­[ Ôt¹ëÉn¶JäÙLóv$Ëæ÷éðŽ÷8ƒ}ð9 Ï@Ãà´(œWá@s…F˜†<öé°òÁÞ–hZ0ÇèÍNLž>ı–‹N{¤ÑP¡e?BËÒ„ d–ý ‡z]‰–!œ# \1{Î*;—#3šÌkHô>1ò~0UŒ¦æ¤Prœ…ª†_ÇéY}´„E|$Ôu¸Ìñˆx‘æªK[…Ü dÙÂsŠd¡Èð†9ëšCqRDèpx˜¥6J[%Dmx:4`ÝJ¯çïî+â|(gOMãÒ8j’ð&S9låÇ‹RÆ1‰_téŒ]ÎI½)¼” šÑÊã„€Dê<²b•Û;åâĺd.׸2ó½Ú/–Íž.ë)‚LNí‹í˜t¶JIVàñ n&êW”AΉTsUÄ&ˆj¡˜`ʧ"µ@fîx#{‡·kȉF°î*8-~ü{â ÔíS~ChSb]&±šGÍ®¦]x«å,ïSùFs³7Jç½£wsEó&ªck9LRWFˆ€ÇEkg­¤/k­Œ‘Ï_ÏçÛð‰²OÒ=µ±váœkâaX w ȉ¨IÊ™«øÔJhƒ1H3´­|3´!E¤3Þ©s‘ÎYÆšç%.S^âd¡÷¿Ò½Šv’e‰F%H¦mjU¬rŠÌåj£s»5QTtÚ Ø\«§kK‹éÊ9ÜËZç*…Ç\×KèâØ1…Åû²LB諸G!#Ð6Id'ÿ4›cæOW¹–fõ™6k5’ý˜ç•_}§ãã*‚Âõ˜6Q?]Y¯¨Ñ„ ‡…¡gÊñÍ£“1É£·•O¤*iœ1p¯2÷’„±Õq.½œúÿºÉœ]º¡ñŽÝ@ZÆ1qâ4§ãã6ΓÎ]Äm@¥“8'í.aº²A”ŽF*tÊN(9‰ÓnñÓ°zøz´ GWúä1èœz‡çùQ:¼ß[¯Kª2¡7]¸¯?(ƒ—ÊjQŒÄ‹‰e¬ÉùîäÿÜnŠDendstream endobj 479 0 obj 6150 endobj 483 0 obj <> stream xœí\i·ý®èG¬óEÓ‚gÜ<úrŠaÇœÓĆm«]]°4»Öá#¿>¬“E6{w•8H‚¤6›g±êÕ«â|{ÒÜIøÿówÞû³ ãÉ“Wwú“'w¾½ãðñ ÿwþâä×§P%ºTtXúÅœ>¾C/»“ÉŸŒs<8rúâΗ»Ð »Ø _Ÿþ^™CñÊ4üœÞ:½H5?èöq÷qçË2Çe÷ ó»?v{¿;…ò»½<øs·Áú~Ú ©ñC·Ÿ¦9= »_w_û¬Ûé¹÷»OòkÀká°ÌõôQçáÉwÏRoGZ<×Ï»'©ã9MÎÅÝYz Õ€Š/ÒW,’þBïÂsxwNÅ\5î^¦ããóô÷u 䜴7âËoàÃóÔ$”¾„Wa‰âîUÞ ¬òP÷ÕÄ ÏDûÀøÍáw"U8JÝ7VdS³Õ1±zËÓQ%H…—Š”fžêލ+U|Î’cÁo":i±ìÊj¨§FÙá‚¥Ã`ΫïèQ}“桌~Χ#O>,j½T5« ãú CöZ6•z½¨¬ðú$á¼A}ÆÇAºÿÀèv{ýš„;4ÅÚõ@Þ„-›= åçLôi¼•( ®§©6Â";cZÜ~ÃÆ¿® v<'FÆ …BÇC¥Úzÿ=MŽúÇC֧馌agñ_•± pÞ¸–1Ø"ÀDÎ+xeî oÞd寃EûÓö:±Ïƒ˜.í+‚Æ ”Ð"ªâa[úÕKÑ#Wît &ÅrAÊ©²Â`uñ]’TÂRá(”—Ôšê62, íL–›Ò©Ê zkA&;|{X›6ÂbT˜Œò¡Q³¬ùׂٓ¿+/h ]锺ó5 EÐy쫵¡ºŸ—Âð€.Rjæ¼$ò+-ê‚ü+9ÈjBük宋5EløŒ€3(À öˆØ‚• Iªœ(Tk8Ýà-îÝT·1áÔÊ»—¥!7ÊÇ«l ŸZ'MyØý*­€ÕeÞ ÷Rµ›Zh{©¸4²‚çöX—œäa}R@–€ê4D^ËUOÂ…±†RË]çGÉj nã¢ú¯‚jE?™¯õ%úWÇ¡ð †9 #ŸÌdŽ*%É0ê3 oëò,•ò²í5lä–ê C/vbÕÙ-S^K¥Í{¾ífƒK0Nˆ [N¼8J8î€Ñ¡ž"Dqö¨)`¨¸Ûc©á ú‡ä…G_ªº¼elXü‚$X…PÔuÉñïP.LE@Æ3yb­oW¼-.ÖLKm$·+ÔÞø@ÜHãàŠïª_"ãû•gêëPÄ`½oðJtzè‹eFä¥Éÿ±ui{¡-6Ü2Ž,ù…t¾Eì±"}J;yälHïØ@g"X•2+ég§( {!™ú‚g=òsßT3~r[ÇÝŠk½-† ñoð ´Â&ßK~c¨"š Ù½ QŸŠ)}7?,¸Óè Ýﯭ-i%ÿ=h˰ÞÅ{ÇÕ,zNÀ#xëÕõÞ…†#«¶ÊdxäâÈÂZ©(5Ò³N0?…ZdžtxðÜÝYm¡>vû ÿiÒ˜îÛ\îÓMÓ/%,3ÐJ/Ó2>ïn"ŸK€Fß8–õš<À“ëý| s$”ó¼õJ†1/;Áè ‚'…_u >¢6æá0©Ž±Êul®' §ÿϼ&QÓÀw/3¾{Tì›™Ù¸<=ôŸÂXíRnTÏ2à.Tœw?oâÎ×yg«qUu¹®©plÜô&òq+>Ç>‡ùçä!ÍR÷@Dk\ç#vOLHX¼¦yBúxò[¬à Zg5o¨@ÑÒª‹Z‡=„ÚôICéð”Ü‚ _”d·*/UY jƒi‘u™pq~PC’Ex@ñêôQy*(þÖtCó£`ÐUOfà£nÁ Å¤‹5lƒˆŠy£YÕ´ ­œ »äxC[¥‡¸RA?‰.ÿÉI߇-þ6†ƒUØŸ·¢ý_”–K™Ks”ÿ&%?TÇ×Ñ|¿µ§Ñ§*ËÈšhŒ€Påô'CÜz¤\yXÚ¬XžŒ Ë$¦6ª¡…„ªd] m#Ü"ª(—”óÚò®*Ù'—eðU,û¡:@ ‚ó(üì*ÈÖð`§5a<_ÿ9èJ·N¢˜<~5Ãí¸=ó)¯Ù;ið¸g _Z‡<©TX¹ðÍ ÎM´}gúõoWHiVÒß +GôàRÅíá,Ï3&HÀ`ÚKÚ[t*F8Kj@ÚFªdòx*õvâ)†‘ÇZj¹Ó*x ¡â™CŸJh@Sl• $·Y4Å[´Æ”~øÜ¾?ÛI»‰VŽ NãÎÆ3ÃÓët‚—®ú-INúY*EʱT5¿ŸAäxߵІ³`Lƒ*Ì:ÕV– 8ûÀçš³v|±ãe&x“™ÝØCj[^1 }MãÁ–mJ§¾¬IQ=µI¶.x#•^Š.&Øšbiý(œÁè jܰ³™§0)66ãÆfÆ\ÊÙq{šuÚ«‘Ž`RT3u§]™ÔB1{F®lŠAÁ‹=½~;¯ uDFîÐ ÕZ¼éì…¬ÊE˜ˆó–êWíÃaƒ[pîà§eÂÌÿ JY¡w)¸{Mbòßà+$|!?B Ä™Öïë,ïI­iœI·¼‡é\'—ìãšÈ…¯ ^ϧϾ•öF¢š‰r¡Žk!넉Ö÷µÎU£WKH¾ ©j3¾™3áÊð¹ÒÙ”¿ÖS×Lúy‹ ?¶Ú|Ñ5XÈZY(éW´ÈÍõ4~¿k?yÅÎZ…o ÖÖ°ó™­ÙëÖøéß.nÚJnà›·aNÛø^N.l çE«ù›%6/K!°j þ/°ÿy]ßµ4|ðQ”Ë2{é{†ðŠÁ#w~Å5ÄžÈÈŠkXÈ£P+Uåš`yÁè3E {½,ìÒWjdîÒp´h;I•‚îšF%MÊ"ͨ(yÚ5€Á´ìØÓ§(b+¨PÄdårå5eäF.V~öeäÑ`Ý&È3hS‚{€Wreì2½¤g8–Üdî*‡¶ Vžmyä-HÞ#A*/D÷œ=> -ØÌ9I}H+Üàæò®Å\Ž|§Ã+„ü üµ¢(ÐW¸Ñ¾çC.†úC5Ú$£ÿVױÙl‘vÉ«á¼s)…D+ eXЍ€›¥?!h°Çø¥ÑñoqBÊP™ÄÅ@KsK—àßÒ '™SñŠúXûÆ‚ÎÂFó/Q-lræ ’~1Œ[ú“C–ôAíSžûÑsú{el/mn´é@u2›È^pYg:©.Ú: ›YP’ê#nʇ‚Â2,“äŸÆ^W¦©RÕW%·6öÙf€Ø.”àìðàŸäý†˜È9èa¸|2*hë6p™\âi&’Y„a9–¦c(Ï{¯8ö5Y«—÷f%ƽ¥H×TÍkÑbfÓÐ[åýÈ‚r¾`E¶ Ê⫆ž1›>’ïNùyóW´ýk>”ýTÛÞhn¦7ÔxZ­ø2¬’ý‚åuŠLÓ5 ¨ôMõÃæ–¼PΙÄh>ÄÙå膃 «î€Ÿ›MpƒH3· 7$räÔ(ø”ÊPS ­Y¾v–¿ŠŸ›E¾§7.k‰QBÔüÀ˜9¥-ÃÙ¦Í)©Z²âù1|u£¢Š_?çÚª>› aˆü`…Ü!ÏߦˆëŸPBÁäG,¶âÚ­ß”köH¼’ßÁ¨voÊ!ÑõÿæÏiÜÛ€w®Å÷x¬½kΫÕR3A?ô½*­¾Gdσ¼PY$y•'Ê#¶›2½éUƒ`MöÅ7Ä ÷%™¤÷×]H¦qõOw˜ÑÕH ÿˆGcz¯ÓŸÑ€¢ã0—J_Ú ¯UÊ]RM¨ãÚr®¦±©×oyL’k="ªûçnã„9ðz+L¥ø$\¿GÏeÅGJ‡¿AdQ†¦hòHK^wкq%êpÂnª×2ã„7Ëj˜§:»¸ý#f¡eÞ¢ŒÞŒV=’!šý:QYÍ´QU6•Æ—€‘i•œDÃôca¿Ù(‘ÂHð¶JŒãmF¶ÕiÅ××ZžïµßF©¡çQ]BÚÖ[*>å¶Á<@Þ¸]ÐÊ}[eš›hq>ÁGŒ›Ÿ-õo~ AD8âokåµí—k¹ G!­c·” æÎ!¿Î£“Y5R½‹ÑH¸R85Ñý:"ˆ¯²°µA¿‰~.€¨:t\‡º«í…Ýt‘$ó©—FÊÁ‘ÏG’È¢¯~Î@eÞ7ÅPb_Iª6lRu®‹ò/’™PK€ñTµÐ!•Ìm‚VŸ¦uL’L›¿&F<5/ÃT><½ó§ôç:Q`endstream endobj 484 0 obj 5066 endobj 488 0 obj <> stream xœÕ\[“µÎóâ1ož¦¼ãÖµÕ<¤Ê€œÈ¡ EÖ»‹½ÅÞ°½ç×çÜt$u÷ŒÇCRÞ™nµúèœOç®ùqÕo̪ÇÿäïÉåÁýÏ‹«§/úÕÓƒ Ý^ÉŸ“ËÕûG8$9¸´ûÑ¬Ž¾?à‡Íj°«˜üÆØÕÑåÁ7ëÐ…õ¦³kG‡4nÆ×Á¥;¿þ¢;t.mÆÑ­t.¬?è=ÿó°;4p=ùqý·î0núÞô ?:ÖŸwo:³þÇ~³á‡GÝ¡]?†oó§­ýÇÑ_loj²}6}ÊNZ¤(Æ‘‡ÞŽ›äW‡®ß fyÀ1 ¸‚ ××ðáeçÖÏ mg°žç@_Ö‚;D Q…D;•ÖwðÙ ßÃÁý¦7a}—`^ç#±çg| §¦'<=ŽfÄKyÈ L€Ô¼(+=ÃùFz†TžäŒ ÀÇ®ø»ÇW8èåÛˆ:¦5Â0P s §7ØKX6Ò“š!x§rܳôõ¾ÈÃ]G̼éëD¢Éò‚pfÏt“«k§Ýa€é†ÁÕn¤W!ïd¾æ‚þg”%¿~‘ECáÊh²X3oË+þ…Ü…×Fr¢×_2«·å"/ÃâÁ­_åG Mya‡ÆÁßÞòúð‰ï^ÛÓTPHš7>K’ä|u0»¢ ×u, Äá.*Yêø8.„0ƒ_p\@¦´’±{ç"ÏSž–2âo:ºYARoÃÆë["R¢÷ð2@â^0?ú>®¿]oA¾ùiWÆ»ž`uÌêÍÆÙ !üi&—TOòD)ü‹(e xðm‡!жaËœ#L°E¬pßi^Ѿ¦¢k2u!󙢜ī#…1ñ"ÿ-‚%&^³V°¨o½ÇMáA¹ò«3šhàUASF¾ú§Î±*À^ui ÝåYq×uõÞŒfªo2œ± ˜(š¨‘.ª‰ðípo$`O6nïi]yã‚MxÐÕŸÈ#$œU'ªãqÄÝ&´ ›ˆ Í›‘Çv €p«“€c³Ø™‚Àq¶¬­FL€T ]q¥º¢¥™B¾eM÷TŒ ¼æ´ó 55Àj•_‘e s˜¡ÅRH}¨\BÅÀ°~ÌÚU»hï‰}”%7ö7%YAÇ8=»‡¼.fOžõ­P ¨·ï²¯cû;·ž•ÍlÔñ¢7è¹À_ç¼*8ޟĨDzŸ/“ˆ•£e´Ê‰–IÒÀ#ƒë!œ‰ÌÒ]1ÞýÀz Ù$‚¨¸–M±YžáâÀìõ¤¿è£Øcº»¤ŒÎj³S)#reº2šppbBÄnV6éºrF§ˆp Ó­^Ø›kMŸJ¤ RÜDuZ³,¯¿ZBÍô85}1àŸó¾çiÞ)õ†g?Ê®¨z¹¢Íز‘²æxxtðÙÁ+X}¤hRZA(ó­B‚y}ÂøâýG÷}²zùüöìàþW+spÿ#üçý¿~}¸úÃÁÃG«Ï¶G­ Ÿ#ã!„‰øžM},iü¼Ø8öȃ·Oì`q§ÔÄžfŸ6Á(»©‘Tû~;Cbֻ΢qЉJ¶FÅÄ—Êûü¸ÚQ&¶j×.yÿ‚·; )å=[yì|·oÇλMz-t#n'x°$¾}‚‡¸± Á „áSÔ‚¼jŒA¡VôeÏǠܽ)¶A™E”]t_$šËÀÅ-èXÔ[Á·nƒÒTÔr8-obe¼ãÄ ¡q[”éKø‡‚»èŠäŒvæ±Î"¢ìç(¡ŽåÑ9· ü*{Am¨‹Ž<:[ô¯¯Q¿Þ$åßUyÙÖ K·9-û6q½_Œú–É$$ïJ¼ñL\q£6E´‡/§†[ÇVÐ1XRMsӸůpúœ@ÈCèeçÓPÌc îsw-I&ºõ7¶(}„™‡0CϤ"ˆFõ<‚;Ù'@ï(ŽíV„DzéœqYˆN5×Ò(ꆦºÂêŒÒû £àS±½ªÍ£'Äìc"ÆMƒ>9 ìÆ)™çð §ÞçU^è+~ ¶ô÷å©ìx Xš*¤¯BfND©›úJÝçè´ÕD^?[rTE¬²8·¨œZT–Öª‘Ùv®¢`ʳè+8¡‹NœòQ¹)̲»ª ˆyÇ;µ14$NÌ)†5Gƒ¶Õ*SäR¢5\~D¸Üæ·(Ÿ,(zEI²dÑFŸc)¹!1ä%Pc3m†& FÝ:Ú6bRr:M™Íãz--l  Ê.c3P´HŠ^¡_´É)C­Ê4ÈÎÃÄÞ¥µ3Èðj[¥Ò( §i½¬HŽLö‚2¡›F¤Ñ7ñ×Á¾v#Àfn¬Š1gíí®s‹©oêF$b¥„É…Ä4òBŒ31¶²¢:ošLÝO¸öÝ FU¹ãÎ˲º©ãu_£ž Ï,úGÝ•‘Â$zϨÛOuÉù‡bº _¢Kâlû(Ñ~fÓ_gÓì˜(íw¢šÕ(‹+î–œ=ÍîLÿºPšTÊŒÁä\Ï È=ÕçT‰öÍkÞ?QÚ³]–_§îŸl¦@U”YÚ»°ØKÏš‰^sMA&UˆªJÎÇxë¡–Uè“¢Í6‘ô—JfØY\‘ŒP.®\q°‹ô-§œ2êkq–ã-¿7g)O¹XÂQ8ü\¡¹ÉD(.-¥=$%ö'qâ Béµ~¢5¨åMÔä(™ef¢y57´˜GUBí¦™¢²­ß˜E.;§©–ð26޽ƱóµÊ½‡^e ú${Ér Hìk˜&b³Qä=²YVm«jih¬6høNÄúßÖz†Ü™vB ¼¢©:¥œ¬Ï¶dæd  ¹’!¯®@N©Eƒ2 -‰Á Y;¥*Ñý”ýÜvc_ò̘¬ÂÃV-Yö¢/›¸>ó¸›Dzì–Û}lÿNW¯u>[ÿ/ÍsÙæWt¸Zõ³¾ žöí„âëä"…ÔK­ÔZÔ;|ç¬ì‚@³É@¯~V`£ATBŒNÈIòÜ£³É/G)©qºãëîƒf5M”À’][¶‡9šR“£O¯®ûÎ,Jê*[Åg¦Å¶JFKTUK+C&¬›Õ.œ5:36Q#Äi5ž£ C '>¨ôv.I‚"ªïð+f¶ˆ›´tºKÔðÝ⣜ë8Üüú§õ}x‹í«QUÎéD/^ÔVð°øEøè·ë¥gÏõâËrñÅî‘ú ¤86¬ß]zæfiöçzöqè¹²ùG&²¼äª%?’®]ŠR¡jÒ 'ð&V~¥Q ¨ÂX#0Ÿ” x ¦Ô(ú¸+¹„DSûõ×òê’Û¶ž»¶ÌåÄŠ³ÖC–óVUþÄQàa£-ݤ´\s¡ ñJHÊÞn¬š@]¼YˆäÅË}ÙQ£«¢k-–I1ŒGþÍMÝFì>eصšlËA½×±ÈðwOÜe‡y³®Ç»$pƆ\ƒéó”÷Üœ{*<›Ò%;÷º#õF{¥©Owø%–S-õ/Фs )F“¦9ÖÁ9KLúvêO×ë fZª\¬ çU=Ý[Ö¡¿¢ñt¹\’ï?«KYuþc—Þ>_âÈYܶ°U®—‹Ý“…ŽS-M•F¤ªbäD§ã>ÛÃÄoSð¿šeߊǬˆeðé¯ÇËzºÿ;<îo×+h^.]<¡ …}OÌ€«z¿~g¸1-ÿ5ÜnñŸç ·ïtF •XH€i.Ô"¼­Áïá4þ. Úå‡ê·KÓ_4’–‹¯ê² ÏTõY…Ú½²¸ßux8iXA`í|´êÅ" ØÉNFW/ ÞùÞcܸv`ö €5úõG]¿l?ô<:·0c¤æÞd7®Á׿À¤°  ÞB\ ù£EÙÍaZ$Ì¿5Ñqî?¦Ð5„×zO8$%$Ï tÞDnìí½5”_Aú’efòm™~Lõô‹n¹ù||pôî7mý“|#Q¹ä åJËu<¥ÂÄ,ñœäêó÷²+›¦î…–ÜÒÍ•†©FÑÀr»½“ÚÒMhþ*ª4m·)V}ÚUþ³šó0Ï÷á´íOþÓXe—¾ÐÙ4­Ù”`<‚ÑT1Çr›¸dŽÙ•õ´BÕþV5-/Wn³ØŸ|K韗€ž¨×Þ]³_$÷ 5®*r%fP_·+¥ã’ÃÝ£ÆÁÙlãóY?e Ü0Ú¢z•§_ê{“¼ð´ÞŸäÜZƒwŸ[´šZ¿D¤}jýžÚË'yRãáÓF‰[©šÜöœEÚVFh£€É­hKbð¼ ¯Ú#B”çžXªJ^×Ý´2ÒTØðy w* Ѽ}h'¥Ö"HbØ%ÓÀ Þ“ÙŽõqÐ<³Ý•jH“‘~ÊÃ3àóÖB® „¨Z«Ñ\=YhCÎ )µT)k”Œò†‹U½‹ÁRqC)íC½$Fz7éì/“jË\VÙJÈQ&3aNs¿îµ"— ”¿š´v†Å–ZáYÒI{ömø!‘ÿf-ŸíÒ;¥ñ¾ K{‰ëÙâÞ7ªLêŽåÌžBó–Ì€Ô鲦Îת6É»ÅG•°<¯9íôPŠ6ð×'9Íu¢é¢ªóNCl'‘„-eüHYœ…2K(u³²õŸ+ŒLÑ3“ÎîIF2¸)B˜3ѨkÝ`I±=àqÈÞrl­mÁC?8bš©1ì¥P6?ìÖv&)€î¶øqÉiúX gº&m96Rʪ9ÆX9 KG‡–JÏ4)W«TÊ Iõ®Í£Ñ©Y×ÞBóuS¨}΄¡Ñ‘ºy>8Ôøw¥ƒýЀ;Š_Ò—89úQW˜³°¤Ç¤ÁsÁÛÌ`ÉÎS±@¥•Ã;nokÚÇ«V3ñ;—Û9&Çó‰<ðß°Éœ»$›îÑ/CBæHR gi¥ó³×¹¿M1z+¦mæ[8¶R­~ÐÀgÿz¹ñ'·ùk“x^0(¶ióØÝ¡žÏ^×=©iÓ~ʯö.äDqðKØÆ³ÏìÚ”d5¬3âgeCÔdUÈxÜQk5”9ÿDåùW<·h– µ2uÓºö¥Î…wåc•~gíA„´ºcŸ§Vòeo?Ý[ìÎ%¶PuK¸Åv±gÊ3sºTf,@(f$3Ö¦máD¾ö¥~ª* Ÿã“t´ry¹Cl–54ŒL6v©Ú6LY.5鏨”8q±é³*UP¯û¸½1°ªáfÞÝ[–Ù>õ3Ǫ^ 7ú±i%Û¡$yç­ª˜¨ð,ö­àÐ2TnBò«XXáÏš0àþ ßv»NJ&ðÅSZùäÞîÙC`N„×äcžxЬè/ú1 ŒünÀkÕo]Žõ£Ácso{96Pa¬Y¡ø}XÏÇe“à²<7XáÊ;¯7iÙR´¡¢]¯m? hýo²R> stream xœí[YoÇÎóÂ?bß´#hGÓÇôLˆKv"‘cÙtâ  Š”(%â’â¡ãß§Ž>ªçX.%ÊB¦vû¬®ª®ã«Þ×˦VËÿ ÿž,[_,šåñâõBQ÷2üsx²|°C¬‚¦Ú7^-÷Ÿ/x²Zvzéz[+½Ü?Yü}eªvåªöûÄ)½)¦t®Ö=ÌÚ?‚‘«µ]=ªTí}oýê«J¯¾«ÖzµíßTëØñ}µ6FÕMÓ­ZX¼®Ö]×CŸY=¨,Mû¡Z;è×zµ—§=Äi¦ö}Ç;ý¾ÒØÓ;vÁ‰rΟaŽ6u£ZômEaï¼G¢4’ƒÄh+*ƒD˜–voÊ:hŒ†u 7¸ºéqñØÿ#ÐÒ4­VDFhL;Ò6@Z óºNV–Ü_+ëëÆ.צ©;å=³ô%ÌÞà™Î˜#ªéWWøýê`6œþMÕ"WZ»:n¾‚4âŒðŠFœBûsøÚ÷p =võ ‹˜Çé[MÍç@}ÃËâÖ8ÉÕzÕàr I ¦!)jõ‚÷±H¢é£¶gÚé> á08V9Z•®(¥Ç«‘å~ ==óý„3ÆFU±ºvQU²¨Û{/ô#ð>ÜüÈû±4Žö꫽'[”ÅÅÃ9âB…‚ò'Ö "t£õ}aDt¸ˆ¨!ñrêžÛPy‰³¢MŒ³<ŸÅ?5ÿ†—Ilé’m*ݱl.q¬¦;9­>ÐmÈ€Ì :-z’™‚ ŸN§I¢YÖ,¯X4–ÚÑ äçö£|ă |¸˜Ym“i ZÐôµšP!%%ÝÆ­~‡=Ù³éØ_‘o„k~³¿x²x½7çȃQè—Ö)`A¿tÚuµíÑ¿?Ø[Üß{¼¼<¿z¶¸ÿ×¥ZÜ„|÷þÙûzù›Å7{Ë'7õüÖÁv´zuòþCMÕóTz¸Cî× Ò£á+¨Dëõ#Y!²S *+S¸#ÞÖfh@K;b´Ë ‡ •í'µoâÅ8Êu\»Q¾tímݸ@\íL¾–`²Ñsâåh•'uC[Ä=è5È•±Îý‚_ÉÊŸâŸ7lïáÏÓ8ކ$ßkÈx"ݶïèf܇]t#L£°.'©ñ 7¾HG©îÇc„R2ÜÅzH?Ͼ(;^áàqÛxºlwS÷Y9]Îê^ÁâËÔ³ÉD ÞMÑ‹ OʘÀNÖwdƒ¾„E ßÿë6½+™ûRãU1)4¾Ïg©ñYú éÛì~1µÑAÑ(N?†Y¢YtÊBÈë$e0áJ¤«´çAüAnEiÏo¨´É5~~¥ÝL©âij|“ ‰ËÉüù¿–êî¶t“LëÉ­)èæ† úŸcU…ÄާƳ­µ¾'¦N©ã$xJÔeÕy–G¾›Ú=_¤ƒ) |âæI醴¼œñ£0FÄæ¶2tQiÕvå$Â`¸”ÎáþGÜÝqIð:|ÄÕøªµE˜bºaˆ¢+3 V@@ãQEñˆ ‘RŠ‘¬¶£œÁš6”Õ࿌\¬­íƒQÔ!¥ÕN03ÄԡҭМˆÃZCyÔöõªlˆ¦1r -€&‰\„…ࡸ¯È£,[–óLʱS2ŽûcxÑ·E™l1ó¿ö†#Mœ¡9E½díù½UQ L‡ü#q1E¯ÐXiÔ€—á(ÈQÄØ|æ(ÁC3¼0;DJ|–Ópð0.gD¹ G¼xã ê­S³wÃë/rx-Cnc˜¯!=¡à ¢Õ »B{ 4-ÁQ”£»‘¤¬k2LˆvÓp¶z—I¼­9“ÌÓS ™2O"ŽuóŸÒíº2ÁÄľø¡¦G-P‚+%<#òÅ$]fØöt!—Ÿ†®ˆ4jW©ëÌûN^¥Üï…ãÏ"fq`<ÐÌ@F³`ÛjÜ$pRàc¬CÜR‡²nkÆ’Q©ò&*º/ÝL€JÓo80‚NÒ]HüNr`P•H«¤B¸…V¨fNذn‰´òà¨(1ñ$^ëŽÄA:m‡»Åí€ÁÚâÍvZæpì*…Š4[Àž%„9e6R_eØ«,ñzNa›¶,W¥,TõE6Li_V:Q™l°k¢î ¥²žØ+©Äß„KѧÚÁMÁ)ºgÊD¢3D ʼnbðõf(Ÿ)Jšš†&ŠØäíVØx™> ¬>®b¢wãh^á*ÆÖbp[ÓR¶C±{ °C.>dçpìšÔæsf·ž¦m¦3OyëÛMÌÆûe¢OgBK[NÓ¤R™ /ɽqÑ);xÛ“lv!m‹2Y[Æ«¦õ!išˆ¡nrYóH·q\wÊ–Aå4F4ÄÕ.]Üì̇%¶@᪱]öGn-qî[iBc4 íØÇkRÄ8g³i K˜e VÔWZÙ‹¯5u4©‘ñ±û "Fƒ@{aìÑËÄø2Ýx«w E~-Ûñ£‡x3Uݤ’’„ƒgå{|´ˆÑ®‡£Å&Ö Eªy•kâËi%E÷10 ½‹H xΙrÔ˲3¸&r( ßŸ.‹ˆ…ClË„¯M !B¹º¬VCÃYï„|ÑŸÆ7•.H .œ–ÅÊ2D-ÛpŸãíf|ó?é’>ÌEØO‚@húN%WÃÅgdæ,ÎpæïÊü·¬šF``w`5ª¸›»ÎÖ .¦¶£@ôÇ †Ë¨‰HHåðFÔÞÅ呸§"çãG+†É5ðнÙí–GÄ ÝCØ:¿Ž…îÏçÅPŒQHblÁdB™ì;òÖ¿µ@Õr‚ð!¾âèÿü,b¾ú©LG5Zm[*K~²ê'6Ã&Xy–ZŠbæíMzEÅ¡ÅÚov {ÛN¡Á £†¼OnåÙîùÙ5Îðò¿Ó~ö2Úígkín®˜ ^Ö3FÈ ³ÀYr£ÑàÞÎÄK­§ô [jT ÇZ±vnäˆaÈ žKw®æ‚ ?êš±[Å%vp«0wèViêÁ¬»¤d"¼¬t‹×G •”„;È-'Àæyˆ£•¨Ø2±åâZÄ’’×äå8>ÏIXp•~ˉy–Ÿ.mGqO‚hgHs{2#Df":³¯x& ØÔv`¶)„™°)_kÊQÍœüÂKÍd§š–Yë' ·lGâj§Þ!ê–ãÄ;•æ)‹|ƒQjL3‡…ƒ;8S¥×ƒmä&w»"‚KWwZlßc& "½“¥û§V çÉ¢žÉÏôÌ5J±auD!³:ÆJšŒ };á"í®¥+; äõs5*·¥‡ãG—ün6œ•É&«V =áÍßN`pÇ/Ø% Üéš+ê ×ôÍäêÅ›îüš»õ#5RÙbÙ‚^Qša‰ eS‰â,¢Âé©s3® õæ·«qIixË,ë?džÀL @Ë[2žòY€}¢ Åó%óÏõJµCÞIãÅÈ¿šÒ’A¤/ó°¸ß<½[Jiyø8¥å¹ +Ä¢ð¤>Q]*Z·´“aÙ¤Z*E€\¸’*‘y®6)®¬dxf°Qº”ꋼÆMàJµ-9•¡¸¢IÅ“Y`›‹O\•wžQ<ÅO_Ù‘áKä>Š“¼ ÛO<ŸU£IëÁpZL©˜4L†b’ûÅ©4sm›.h=.{oE+룬»©<(2ŽnpÀßøÕap…q xáuwWµÓÕoÛK 4–6‡~æ+KŒMDQÄu15Le×ðãQ,]¬ÐSŠžõ§NlèæÆU?™F~TIZ(Ma`‚sËS; EöÕLHh^ͺèȲm©ZÌÞ Õ¬k¶ªY~˼v„žXú™1ƳÝO?*B Ìcš Ø*þüçæSÃôí Ž§½˜Ïu÷ W+XrµaƼ».®õ^„OìÔ½¡0W¡Èk¬P¡`;El2Â˳d–G^j·ß#m{/Ž1ÿ^"\áÞÑHƒ3ù+5Ív«`v0V#f3;ñ¶>r[E¹ka—[{ÃXÅצg Sù¥€1xpÄ2¨àú~Î’ßTŠ×—ÏårŸø±iæE‘õ.DÄ%>Íc^NáSg#_I(KÝ9½æ™êó)F•ÐС™39}üôõ u·Òy1³»(²L¼=”KqÉV‹æžçG %yӫƱ÷ʧ֡ŒWªÌü8MŠòJ™n½T–ãB1Ô‡ýöâV1ˆŸ,þ *ÿ™endstream endobj 494 0 obj 3566 endobj 498 0 obj <> stream xœÕ\mo·îgÁ?â€|ð­­—/»Kh§v`5IÓ¤2Ü") G²%ÃÒI–-»î¯/ç/»\Ý)‰ƒAä»].9ä Ÿyf8{¯W]«VüÇÿïÝÿ^™auòf¯[ì½ÞSx{Åÿ¯¾8„&΄K­ï¼Z¾Ø£‡ÕjÔ«ÁÙVéÕáùÞë¾é×m£×ÿÝo½ÖÃ¥G;^?6¾¨Ö{gýúûfßX…;jö-µûgh÷´1cÛuC¿þ®‡v*<»oàªÂït¡´+û¾Æ~Ú”  Á!wo¬á a 𤑰!>òW\nü½Ù‚HZÿëð/°&Våkbû ™ Ërx–Â1Ʀ疽Í[îsÓ}Óµ£òžžSíWõ­:-ÿ¤»½_6zùÕúC˜Ôhq ß6f}Ä\?×,€Y…Õ¸†kWÍ~Ož‡K›Fó¿…çUø<¢ª`ŸÀãfý"ü®+EÁ°çЄÁèfqìÖ_6–+ÈrV–šÚ ÜÇΈ™°ÏÂoÒƒÙÇ‹ ‡“yvq|˜ÎqèÃSïa‰ Q. Þt#^ßÀÀin—ð5¶½j@ F…9ZYtm#ÚÇ¡Æ`Ú^áËxãæâÂjÈ„Ëçz‡KGÒ…ÖZ…²h¸Ù…Óøx\¥ÅÎY(PS˜÷³ –Ö·ã°ÚW¦íÁ˜pV¹±XÝÕ™l«EY¥qAsEYc;Q”¦?Uåˆ^¬í—õb5™óu¡„eåì´t·#݆ñ`lLTVï ˆw½†Mb5àQ¿þ ¬ÌfÞiÜ:qcd6_á: ¶Ã;„ 7F‹³Ví¥ }b/0¡+º6ëo¢6¿…yy?xD>Øsz üú*ÝïáN¯ !u8Zúã\ñ°¼ã¨yme,øvQ.<ÔÈ£Eôޑܯ£qnnß7ÚBð|â°*À†Ò.î)cHÏ™W7W±ìèå:Iû Iõò´SšÿB0i”/@5à¤3žPUET}:EÙ û^y¬‹îÀ˜82¯Ã×#øû÷3¢+ÝÁ}FƒèÖ;Ü ÷Cߺ£~ÓÎÞ¨íEºx/~(ö(Ø ˆ ±Vöèkî3˜ž~SÞ8ƒ?aÁû WXÂ{ñÎFÆ Åó¾‚?Ÿ¦Y¤6/“¸Å€r±Úò,^$1P„Ùô¯ãÅ·µþ.k#_ÅO(-îhœ]Üψ’Ïk£_å2ÊÅWµ‹Š…žþYÈt·ÙT$q°ˆÁ5$ò¦h ­=½ÊK&ߤ¶?6…ùÌY†u˜]¹ÆÝXÆÓÆkÚoŒ×ù^®íïH†. úJSA «à!¢çFÌg0Ù7 y¸» ï0ÂUÁ;ôdÔ‹$™û«R$F±ªH_Ø Eö îC›V^–?8x‘ð±W:óúϘ‡ÙpADHëÔhø ÓñO¡©gÕåDƒç‰<ÝÉŠL”ÜGjlO>.â1¬Bd°¿Ÿ Åï#L¥&Ï <¦ÆÊˆÇ(±E<6] r ú}-ÓJÝÍàj ÑÉiþ–ýelsdü:^|„~ü^SÁí·µy?3øIè™þYZÖmè»eøgµ‹%ÎñE€¹¤ ÊÙÖ NætgH'î—Sv43c)Ÿ±æ0ÌM¬s¸Ç‚=˜1 K=}¾@^ª9¶ÀÇBfã]ø+`=¡E= ³cEU :Å9>ŽÑ-ƒ¯uúÅZ}—b-†œ—ìæð:3 ªï<;L‘ÒÉ¥]V v<Õ%xY¿%YŒƒFœ9Ëö8òè‡Ðì'„ƒ €h¼ØÔ·o GDyxi¯q›Ô÷óJ±¸&A þã/X4¦~®Rí ö:w¸¤dnw$á4Úί¥á@f*¼|O`\ãgXïÑär»Æ‰F–‰ éûÖÄw™|¯Íô—Üî…9f7‘Œ±ÐI Љ…•üÐ ø;ÄK ßÃdê’EϤ$³dJ´ÚjWSâ¹–av´‹3üƒ~Ø:ejFÂmX¼3ŽÜÐöòä† `¡€ð“Á'po㈷´iPÙê–²I¶”gK#Q†('f82€‹)™âŒÏ625Ò¼ïDµ°õD¢C¨£²äÛf”œgº …‡K‡Eê“=—ߎr¦Àœ`"e"zB’´Dœì&¡‚¤‡À)… 5Ó’!O3Ñ’&É÷§,ÑÒzz –À’"ˆ£xÈzô†âÍkÑ·ä”Mì¼èYàòŒ…‡î Žþ#£íÈËñ3»Dø)¸/¨ÅúÄ7¯˜[†Êbý¯Lÿåͼò÷Á&ÿ¿þÏháŸÌ3Ø~7æùÓ•vfh;…ú)íÞã5¦s)Šæ¼(}ð‹í÷#nÌ;¹‹´¤·. ª<“¨ìÁLhéE¶Ù/“±"‡vZn‰gddÔ @i†9ú…OÏŽˆ‡ƒ=ͳ¢a­ŽâEnsrœ3k)Y]ŽÇ)=ª´G„“ô¨5ý\'õ„>ªÇ.z7 2#Ω`¿ìJT?ÉFÕA¶xÀ‘Y«ˆ7AMG× QÀ¾Ýj"³79HÙÿÔo¢Äºrhóøƒˆ!1¿2œ€.o6âÇHC#o0s_R¥ Lœì.‘XM¤"_Ê¢Óqi]§Ä|6ɺNpiCÏf‘Mf@ ™Œ‘<+Í ¶—í’}e·éd#8¤€>OÝÈ|Ù|hN¥ÿ¹c N ÅtÖN©»Y®¬@„T3J±Ðœ=¹q9õ¶{؃ä)lÄËØ:[o ­ùѬXtô#ºXô¾\ncu™yYÜJ—|Z4Àɯ˜Ó³¤£h÷Ï›xÒ-;ͤ‘=Ò^ôM¼]€ÈiîŸi}¸Ãvë£c,>U¢‰•„›o9ER°ÆŒŸ` Q”uh†çÄsô”/Ÿ7¦#Ó€†BÑÉY˜…õ¸¬Œ¦Ï²Õ¯áÔëZĉ—“]VÈÆèéÀyõ¶ Տޗ#¯§|8¨éòŠÉ á†(÷æÐ¶ÈG[ŠªŒë©r˜8¸ìÁÔñâ±eÍqfÀˆð1?ƒd Ñ`ÆE{¹ V8__Ëá¿ nÉÌËJ†`Þ¹H\= 8Mc,ë%)"9ý­îŽ»ñâ‘o„Uy²Õ|Ÿ˜“I Sdîf1…°±T¶D¢I¢ít1Q™Mí¶$ÌÔÂaÄeø"„ œx£IÉDMɨi<•ëWrg·3”Žœ ~dAÞæ¥…#I±ä¶%ò"½"©:WlN‘TàBr‰·"ÚÁ“Šôb#4ŒIÇ®u6£9CLöusc$KíÌM wç &Ï W7L¹[¦v Íõ×1ÌTÝµÏ 1/˜Så:£LUª{â#”›%¿9Õ|šƒºO2ö*[é±ñ”MÁê8Ð@)ÂmY6§Sáűܑäž›jòy\ãS”øEÙT†Ãd©Ï‹pfxEkD†çN;Dh󃃬B—.ÆŒC»œè•‚)š‚2:Ñ•éD°¡´`5Ú-Ýnš¹ãÅ£E´i&Ù0©’&!¼Få1u|À~¡3[ºÎÂ:è­ÆgâBÛr9Dµ(J¸ìœ³žp·ï„ólÊîÎpèŠà„¾µ)z‚N eùÜ+±EŒ˜ÂÇ,ø1ù-èý˜mSyQŸd3“fq]zt•iú¢ôü5Ø‚C)C¼|v•¡Zý¢LgJ^žÅOåz\a“ í¤ ©&9óGçS.m–ä~ª&9CËŸ“Ô&6 ¿u²pË\²¡RÙVVË•2Ç·(Qúx©J3®‚±;èIªÒSµÐïÑP1 ±í•2~mÃUb@(0Ânì`vºå¤è6x|ÓS2; †VrÔà M lØØìö(ÊvÎv#¤Ï‚T rôñ* s¯FÔA°E¥Íú{ÎZÕÏİZ¤P}H7O¯àbÖßKš¡££œð¤âL«FdJc$a®S×é™ÔÏ&ÝNr½ ­ÓW³À°Ÿ¿Þ;¼÷CᥭœôQæWÙtº]G~'§/¼_‹T]v2(èìÈà#Îʺ[Ú[Ķ0¨JÙ¦C‹'|èï¦0=)S–v3Ö¡Ù©U†cLã§|µ(­¦j «Ê@ÁýÕL¡s‹Pó4rSa¡Ç”r<*ê°bÞ—‹¯ð½Õ»Œ1Lr+eª§FKþ­Œ”ýœ‘b­É½Ðē݀züÔ‡ßS4 å>|€ü %òD1¡Rp,¹Æ³M$¥ñX“€·ï sÞа³²0#K%Å‹TãëyCý»å:ˆ0Ï‚pb-‚_À(]åZºØÁðÓ+*1Ôì¬Ë«Jâo!8akbðGHCSÙÚ³ÔÓÝ J˜öç‘®Þåf|¼ MrzɼŽä6GLVÆ¿É3Œy2'\š\ŒzYE}ñ Ãúts+¢ec:ÅÅâ™”bÕ”ëN"×â°™CqÁ?¨jÂØí„yòæÈ‚¥I„UdûJÑDFî)¸8˱8ênƒ/Ù,Õ`ì¨È0µ™¥ˆ¡»äò ÓÛbA ½‹5Eø2YýayÖEl%žz¥gŠÄs NgŠ8*¿›å”µW]q¨8Ä Û똪Œ‡¼Ð_*ݱòºS“8SøŠÞ#§6€”efJélI)ù5àòÕÌ2eÎ]U 8+Õ:­˜›ÎX+æí*¡Í£Ã½ïö^¯ ±Ðn:u+7j(”‡£Ø£ó½/öî|³z{uý|ïþÓ•Ú»ÿþ|ñ·?‡®þ°÷è`õÝòL*ßøÇ‚±Po2(®X‚Ÿ ˜&.Ø2eUJáñÇV©ž†©É*„+ªSÛ”œ¾9kƒ,·uceðì„KäK¼˜˜Ï@ö®> ½® ³gÅ8«9!9¡'aãþŒø VÌÛ hËt¶¯oUñVõ,Ȉ+P‰ŠE5˜–©&mibúmÒDxó$c«^ ¥ièø—Õäå’€Kzšµ‰ŽÖų>Mœ’K®¹†$+¹.J²¨øíŒåÍ3„=8¸•u!û˜›Þ<Õ«à&lxÜ<ð[ðC˹@CÜo °”¡WîAB<µÇ8ËÒ±´=†©bÇ#(þyIw±Âæ»°äGó\Ù¼ÓÓµ³*’ ÉüŒU˜¦ZÒɸÇ|¹®r*Æ3)š½Ž¹2WÛÆ_®`N&žW÷ ^7wwPª:­ÚþÃh{ßíý];.˜endstream endobj 499 0 obj 4570 endobj 503 0 obj <> stream xœí\YoÇÎ3í±oš¼£™îž+€X‡m%¾CÇ1ì I] xHeóß§Îîê9È%mà –vgú¨ªþêìZ½ÞÔU³©ñ?ùûàxïÞ7ï6ÏÏ÷êÍó½×{ ½ÞÈ_Ç›ûû8$4ð¨ë±Ùì?ÛãÉͦw›nUã6ûÇ{?¾l‹¡lÿµÿWœ2ølJßUn€Yû‡0òA¹ ŧeSãÆâ£Ò_•[WìãóGåV_|Sn½oªºî‹¯ÊmßðÎ÷Ë@Óþ^n;xï\ñ8M{€Ó|5=ïôqéðÍÐá Ù'Ú9_Â竺iyÐ% „UÆn‘(‡ä 1®ƒ›×ˆð-íßšÐá@ï¬ãa¸ÇÕý€‹ëûo–ºn]CdÈø#m¤µ0¯ïˆÒ÷›Vj[‡¢ÜŠ,·¾®úfY¤m¹…S­ëºC9ÕÕàAT]æ]ß pÒ¸P¹±ø2éaÄX<…©‡>„â†öCï‚/~.ÝO›âÔ,õè¬z×:_Â|8”Þw(@C;'KuÁOJaßÕFºªë[W¼$B7vÅ =ó õç°ÎÐT-ˆË¬c7½Ðùoñ}Æ1ÈRÄSZŠ7@°çðɇqPP¶Á‚Òµ0¬†Ÿííßý„âeØîp]í¼ˆØ"h4pû­ïF¾x/ž¢lj¤¬4å4ü%:Ž®ø ^ˆîŽÖƒe|ÛÓ §€ög8çñÛ_pÛ—€‘óZØÄÏOpm’b]•ÞѬKœÅGˆÛàºDí!>ÇÁ=aõÇB—¢epÜ[Ü¿)`üJ¤3'c³¶u?’vÆ—V F¯¿ˆªÿ°D‘û&T *a¥^´ã2ª02„ŒQ–âÇ’!š¨£Û€íÐp Ýj ^Ä×Oùè`šwŒºí#㺃°v…3 &7zV²,²šé+ Ú‚‘hÛq`¶ÎQ¹ÏxצfQº¸};ÒÇ'úOö„#Bü#¬^´/q¼GÅàì@Eß•-Z»6Ð’x 8 ?ÿ„ëá9ƒgÌZÓ¨}Û#I´8' (ïÝñäÐH·5Ò·¼ ¬xŠøˆüâ×Á3ÎÙêãŒY(^7tUÛ)Xp=$EiÄEºR ŇÌ&¼/¶ñô$‹µ †‚ií¹†…@Z*BQԈ髴™ƒ#Ïy¯º¢¬qDÂ&aÍq{©bu£'ú'f„A³upÜ)<ýSÞ•g&ÂYß#tÈû0 (DØÜ‘ÛÍ5ù ›|‰snâ\ çg|¯}…k1 :¹ÝÉ>N@fðñ+™|‰“{•=­àH‹ƒ5‘gºÚcgìÑi&ð0§M«(p}OvB±*ùý¬Ø¸@ˇ†s&# ±*O_,ãD†ŠTd‡mÃË'4ª¡å­Ÿó Ÿ, ñç¶0Ž„åH‹ݵ¹F L°Ó¤6OPM[²÷bæC< ™¨^-t&s,´N’–=‹&PícæjÔ`Šašzš03]â2}`ÌŠ{cÒ6Ž8d6²Z#ÙŒ¸…á}îà<¿˜¹zrouW…üæêj …õýbŽŽ8Šü-<"ñ”v‹VMÔY=ÈìI;Ð -Q,~ŽËÝœUH „C–’H§ >ˆ$×^‡"ŠÿC B ì†)LÝDäbW¼ëií³Dûi©`Ó ñ#P àe{|)ÉDK™@`«N=õʺm€`~î‡}»`oiq–ѲƒÎ]‡R@bˆ¡TBŠê@ê,C€18“è'.¡'‡l ¤Eê1šÚ­;Vƒ+É–_d^–ôÈ©Ö:†™ð”[°,P¥Cêø™:Á9þ:€$U,¢‰ñ·ä~Ĭ öêÇž÷x K“&à&mÃÑ-rÊopgâÏìßøÃ`â„ßÒ³ø? ã4B'Á”§…i‹{°Ÿ¯ã~<'…™´MDŠ>L¤œe©ƒÏ˜)愘;åÆÐ–^¼ÚÚšó›»ñõY>¹+>€æ¿ÀGWÓ"1¹PZ@ïÆ÷GéýÓøðr‰Á§éá/ñáKËÙHe ’­Û¤Lñ £s:׈Ÿ“¤„ÔÍ.„æÍüf™1$ Ž,;j¥È¸–ûÕ 2äy³¹icfäGš‡> ÀûªÍ‡4u%fi&Yˆz ­äœ°Í\¹ÝüýHá¹æ+5{bzsßyÆ‹¤| Žh)(h„$v´òV¾§ñÀ ‡¥h¥£ÕFQ ìJÄ¿Ä06FF7²Óä]B’3åcvPòý*øiT‰ªWs’¼–!5^.ÏÆ(¦sÝJÐl*^ØŽUï¦é³ÍÕi mWp%¨ÔŽ‚j+z2²µ×˜±c—I8Rawl¶1wmBŒÂšz¥¢A9în™±wÒq}]—ù>»š–-˜ &WóÕx$ɘF&ï˜Ä™ÝÓ2 $®| ?¦¢ØƒÏò€C³®Ó̇IWD4âD·ÔxMÂ(hŠyÓq  ÷4á“.Í¡½p`ᨼ0  ŒY8©2“Wbˆ§ÜñåõsBôŸÑü²(c:+`£ïdàbÍö“’|žï¸¤[|†/°â‹oXÈymZYÃúõge{*Á¤܇8«]¿°‚ONÍc!•¶ÇÊø÷±¾6­¨3¡„ˆ”©§Jü—ÌÞ ŒOFWÓvª¾ZÏZ.‡%b"€ ÕŽÕ0Dû†ë¶5…Òy\Wªïú†è¨IJ‹tØŠ}š#Á£l^Éä¤Ì9º®¡P’F|ËG”‰'ëVVâ³±uOÌÁÁü„²THÉvtx?2Öñ@\/ýúK&RGßjC;ççNŒ^Òd*ݘk‰Ïãæt£Ó]ñOà'· ™ÅY]U‹rΘ¤{<Œää„É©=HxY¤d›k2/k²«lF’+,ÒŠï$šˆA‡˜,ô¹(Œ`I -z¯¤tT‹7‚׺žVMcFއw (ÜHõP£¡×ß‹úx©¤þ Õ$£OŽ(úO kÌ({gnébM··.ÿT$Ç ýx‡ì·§ìv˜”L‚y¾ÞAAu&JxbKŸ¼(_ ‰£öΤ±YhdíCÝI`‡o_V„`1Ì`¢'¥->]Y-˜ÞÓ,”Ää£#øT9µ&1ÞlJ=3;y¼p¹D«Œ±-@ú¡„&¦$’°À%BkCÝH(z¡nŠïwÇh$¬pzY*Bä%Ìj¸lËÛiYSyªÀháL±­ÚÓNY%ƒTU“Åøö°”Â]˜Æ'ñ.#òäMeÁ$q™ÐÛxàiÕíÕÕ  K_«Æ¶n/œæÑë’•Ù¥«QàjÌW;”Ê&f#zpN5r[øäþÈAîZ)1ð,èÕ­ <&…z/e>¢ÚW£4ð½ÄÀn¥; íez–k¶g|gªý2C/íÆñª;G·‰îV5XƒÇèè‚Á“‰š—2¦÷íµãüõ$eÊnm…Ç[‹(¶pëý Y@–¬®ƒLË1%Ç—’–k…Ý5é¾1&2Gx¼t3Ût¢§{NlbŽãÚd¢ÃDõvÜÒ±tÿÁìB/]M°ÁHºq„É” vRÀâ¿4áCФRè„â}´¿÷õÞë÷UG­/àφ $äLüêÒ ØLsÿñ޽ǟoÞ¾¹xºwï»M³wïSüãþWà¯Ç7Ú{ôxóõMÛl`Øþä6›D$Æš)Æ¢Ø'»³Ñ4½}HÅ*VLR¸¬jÞL-9Ù?ÍÚ“Ò˜+rÍÆç×] äR„¥àÁcHgƒò¶j q'—Áâíeò\qF¡-: °äõ[Ñ͈iÉ¡»Ám´k[G&ö§Û­ÕBï%× ¸’Ü »®%Ãñ„IŸq‡`"§o8*«éâŽïËGs_ÇF÷—_*b„ÀÙ¨Èú:¦é+5¦Vx¢%ÏßÏ¢GÆR.¸}´À%Š+—¥záŒFnHBCN¼Ü™ó;ó%×{…;8¢Z:…•N%¾Žz^¶éTSÓ…Û” ħ²=ðÉÎ!%Û¯äýÙ¡ñâÁg·w¹¼íèw&ïˆ‘ÕØýgbº+”@Ï46ô6­ÉnÈåR>,úe©jJqÈD!<¬öëbk÷ç±Ç¡½•Y‹wS"‚õ`/Œ\q›ÝÚBè¶­Y®P_ÃÿÛÒß<…h=Õ÷ç©jÂÀ9FÄm– 2èz[2ƒ2µ[_ÞQ2`R»d[×’úhÐ6ø˜)$™]â¾”ÚõŒ¢DÔ‹Í ’Ì7Cñá›EÇ¡tÐÌï’ÆÊ Ì31ˆ©Zc4d,·Nréà“jS­?«JSY;4)t}[akS¨Ê½fhßÏÅZ-ne®«]_’ ¡xv»;ÌP³±›ãF Ø“vCSSIõÍm Pe¡»$ÂÙ¹œ°P¨BPüX(ç¥ä³Ú ›ÎªÏê½ò’snOkº¯]Ë%˜õ°«Õ°žXYè#Ìû/=7Úh=Êk5k'CAËi¿Óµeã=è–ÑRm“Xmf¸³Òƺ’(¸°nDAé8x®ÀÍ|mšl %èÄX“Û}5»ôd5½íg€YJ¿\¢÷.šJ¬KhqB".Ü-ö9îPEÊb5nûñ1‹¢L3υؑș†/K—Ža-±’óY= Ö p.KÓô8ßùô¸'ðÄ•ÌóɘvDRÂ2k–ògmz¿6%™÷…xpi=Vs²›ð[ô…Poõ…P¿uƒÐ‹#}QiÃ÷ Ôâ¸iw¹õÃtÄ>ƒ?²ßãºf†Ãø>ëZ¸ò¡éþ83Z—õtp…ë >4-1O,± M¢s÷†““%⎯¦Cº^Æwûiê÷ñáWéá#‘Àß´{¼Ë˜ÐÎWééÅB»‡i‹ù NbWfnêI¨éèEÄd”ÐÀG~À!DfïŽ#Œþ>ñÞGŸ²¥f±9gñðóî$¬c½³CÅ„P¼jâïa~_ õÔd˲y#ƒoÞ¹u øþHMÞA—jîý}tIW]ºj¿[™©ÏB/mÍIÒD ïì­DTÚ5çjD“T¹I•š©.ǻФË‹€¿«0gÀ'êéëE|K*5Õ¦ß^‘r"¢æ œî®9FÌ©£òp]s¢Åû¿æì 9+#õáál¿|ÿšùŸø¸ÉÓÚ·ñ¬7p>;ôƒ´Eo÷f«ÿåVþv–q¤Á»ÿÏ s18¹8zkCåé´³”Âß°¹VŠ!.p °üþdµ6À%Åw%Ý[wý¼ónQÆzlü´Æv+곊DÎqb^^œàïœ^ã}¬µGVóuMïÓ[¹iª6J4îí‡ÕËäu¶~3ùÅVV»Heí¼wJÒ{e¼ätaµ½–ék&Õ)Ó&±Øä°ÖéúºrÓ|`íÎÓé+øÃÕ…ê0îrgÛwú†‚®÷PfG¦ÅÉ á•\^÷|–“Ã}ª•¤ŸËf˜×W0½´Ìë&-càJÌñï Sqǵ3„[bº*˜ÄM—ÎËuÕ­ ÐÜQÔÞ®ÜD4ºë~¤#?–ÎØkVpk/Æ/Ô¿¯)2vkviù÷Š×0$¸æç€5Óëdþ§ ÆtC²Cë¿…­YÚ"·ø8qÂà£L'?‡ìÆ[àSjƒ±y¯g÷¼¼6Ù[c,ˆ_ • ºº[¸õ`¿íÅþÓø[±ì_:X®ÌOsÈlÞüç¬úã»+º\®÷¢Ô=ÃÒ\kDÉïZæõùaùLÉ[-ÕÎìl ˆ|ŸUö©¤<ܸm€ot;lÉ0}ÚÔw2_¿XTNÖȽ]ÏTàâö.N ÔýM|tìðùzï?A×(Üendstream endobj 504 0 obj 4466 endobj 508 0 obj <> stream xœÝ\YoÇÎ3ã±@´#hWÓÇÌt#H‚ø‚•8vlÓp‚8(R!:(Yú÷麺«{fÉ¥%@`XÜéé£ê«»f_¬ú­Yõðÿ=>?¸ÿ½qãêÉ«ƒ~õäàÅÁÛ+þs|¾úô†—.mcÍêðñ=lV“]Áo]žüc=tÃzÛٵǿ›)Äm ãú«té‹nc×L>ï<|1Ûƒëï»ó‡ý¹Ûx÷÷4î§ÎMÛ¾‡õ·p=3éÙƒ«¿÷0…±¡žû~Zû§®ðòôÎ;žÁÁ&\ ~ìdK8ù†6.7~è6cÚ’µÿ<üÐÄM?¤…D–ÓD —¶»Fn¼ÛàW×o'# øyݹõë4ãú‚¦5}XŸ¥¥Í¿‚ÕÓ?nôHš«4ö)Œ}”®Mýú4ƒÇÖÏ˳8ל/®ßtƒK~}”ö³¾VO_¦ká㈓§áÒyZNš.ÃÒãúwð¸)„ ?¦Ù¾†ý}](ós×9؆¶»É¦ÏÑ1ïzÈ»J7»òùàðxBM¤¿ì6ÃúIú€Õ¥õbcLO‰[+´"L·¤‰asÈ#¤ ‡ôqš,¹(ßî´Q5þ©ðž“>{uèW¾Ññ6.Â&Ž÷p‘gzR=ô4ïAC'Ú·ÆÞÒÁ„qÃP#Â#Ÿuލø„å—ÎF K¡ä <0× Ä§f2{¯„»8‹€OëÃ…Øx°#µè86®îó‰¼ÇðD— ùik6! q7çpštHOû<îðÌiÌSxšÎ_“‡vÜÒèšSÙm·CÒâ)áøx‚´eãðœÇËãg…Àðÿ;(ÂÖû@³ ?‘ YÐ$òh"˜ (pÂÁ¢óÉ3>0âlˆÎ}"bù@,‚‰‹Š¶FN’d¶wÈ%JéÚn¤Éá[ßÏù&c>ïH„P—ÎŰaÀ¹Þ"Àhg¸i-ƒh£Eô-ˆÉ1Ù™iÜ9Ë5JèbáñÁ—-½ZÖ‹¨¦z³õÞ¾ŠR­õàÕ€æw‹è§Sy4d;”QÎýkòÏFÌšu^¢bŒÝ‰ôJ )/>g­¾„sµAÙJ¶4åŒÜŒ6°GšÜãP”ü$ºa`dñ2IÐúõC0±UÛ„¢§%ò2…çB¢-3 VA‹}ÖãÕaÊ@÷²Œ\ P`(§1 9Ë“^²6…# 1—b(C¢T÷kªd²»¡ƒD#ÔNqšN›6v2O£»VóG@Ù¢€s e@ŠÑÝe5G8×´h OjãLJ«µ« ?­ÐºÆ»I–-ÐUç4~DŽÂRx g5¶I¸œ^tc gíϰ%Ã¥G´8Af~ævž’Ÿñžœ#Åò×Ê‘K¤ÎÙp'âz{­ñjL2ž/!lÑ%˜€bí †Šµ–}škõGiÊx£%¦XÐvªjÿÞ¤×#â’/: ÔÞP|\k£`¾€·>Hw¬ïYõÎ#ÐnÐp·µÚ¹%ã1ÌÆ)ÆC”Àv¢q`¬"ûÃ2Õ©–ðÌøÀfìTÅ !¥¦0sC‰zêÄÆ&IbpIÒ¦¶}H"G=…=ƒï¶`0ä³€OwÀÀ#Ò¦þ_Ÿ'wñÚ³|í]=øUžz/¨¯˜?ie?Qt?­o{\›ž\†=ÉŸ•‹e[gù"*»ô4ÀSïDäS|µiO–=}}C¶8ô¥én¾ý¼~t&&ç;—ÕË2rHÝ“CYzª•Z#§¿»DƒGù⻥5êdȵ|B™&óš/^ÔûdHÜ] ¶šéb‰WWåâÓzM2¥×®"¬©x­ÀGï ®C…Ô«´‘ Á›çá¡ÍåË¿­€±Æ6&e¢“S|ï!!/³4'Ñëo¤A!¨ÌÿD‹Ó"‡QV&÷“E´g 8AY Û1ômˆwkY!MKVÓ>²‚2ë?’¬Èì7ÉJaËi¹ÿrÇárdAVª³ÉmÚd"O«s,HPå`Ìeåm‘Šz}E\µ{¯‘š³õÜ7è`°d=#oò³|Æ×Yjî±~ÄøUK_kß,à¬ÿÂE¹x¶ÀÚ‹†¸ Ì{ifEÅË|ñ| XJöW½‹È9ZºX«>¾¸[óÝÿÞ ¾ò|ONz Sœˆ«¾s‹UðòõŒ+,óè>‡îM¶)FoÛÈì)ìÃ{¿£á¢qûæ}"ž]OBñZ–«’bGݺ:#´Ú€GÂGƒl™rè +A[KH ]H wÆxéUùCEW_vqK-U‚­\¥;ß’«ùf,èê­è¼R³Qtª‘X—sQùi í¿FMBQq*s碎¡r>:ô)©LDÒ·UÑ-…S!h³#ÌQ%í.é*WtÇ$)Vo“ƒÛ‰@à…*r¿. .%‰tƒ ÚK©ô6gž×DË1eð’Eôºd††má¤+RƒJe4ø6æn W4ˆ¨ w–<ˆ'v]'ªŸÃÉLU!D~{ŠÎV§€n0,6RU üp :"8¾ãí i‚çÙH }NAreͪ ε<i+¸XéJ{)ޤL¼§a¡€'óÆ\NÑ«NTbJ? —3O(“zœ·,yD“5K»OÌ Ø"™³6g¯·0|¤Pr,NöºÚpTw;”©’Ÿ#Û½UUqWÕÄ'yf…ÞÛ9¥hZõT†RI2çšüµ ;gk-ÅÅüYÞ»1ÏËM aÒVz̆ªëmÒ~n hwkFÈ6öf·ëE•.ƒ"DSg€] šTå ÊzìWH2-…uXq J­JeOy–Q…y:‹úªJºR_Àu\9TKvN9Y p Fò)v—ñ«VÁT¨ÊCö¹íÁV¤V†ï„†÷Á"¼<é¯ †¼@®q-x%³2ÝÌç¨ÛHïѾÂUFä!~¾>S#{=M1b¸ÉT¥ªÚÇ­Í®-¡ §èa<øQ!0Õ6É]÷MDÕ1µ ,9£Tm‹Z×”¬uU“”ï`'¯¤PÆç¨­Yfœj%«Düªs¢‚Ф=”âÑQ #HyÃŽšË"·‘æl˜_mÏÁ&´ùa¹µî‰J{×Úd/HÐùX4vf£BÅï¾3z—[áPED£ºéÈ7² væÍ#…Á ªáãû¸ÍŽñ%½I¬®ÄÕ]*¥\°še¾²tÔ$z^pUP¥´–aé ˜:÷ ªˆzûÜ ÁÕ¬3Kµ!º*F-’ÈM[UÔsË,ÍZ•W^§¥ÇsŸ†L†…:ËžúF°»_ùĤ é?ŸÎ7Ä`oЃä µ0ì—ý}©Q:OPÍ*%þ½³¿·®”Ü”ñ*Ùj•¹{·ôPÉñ)¡ÌR¿þ}šÔ‘þù¼Å\ìÉÿ&Ÿ·PÊ ñ~~´F®óm%‘ŽS#2£Gd2¹÷¯ã-1¶EçÔ&þÑù1ê€ïSc©ñÎ:¯6ªÁcÛÃv{36~Í e„¢#Ï5©»‚yW8eiøØ‰vú¸Gr=—â‡N®G"¶Ë’BÌV›L°–âöêsHA0ŠÏ/9õ}Ùå@S—†e_<-²Ø²«û~KxβBíGòvÍ98÷#²:bηìé:¦¡TK60'Ù%Ôäœå®í9®ÜöÓ®j|*ŽÕ 5)–8Uœ9û”ëÌͬû+žfŸ1a¤vQ5sîÔní¬ Ë),vÝUíqªu¥éí¯|>;\ãÈÕn9xàÒw/.$6£ò˜_!QÔ¬øw‡‹1µ¾Ôo¦ØAún2ìØ[>ÈÎ}Q#*ÜèWÜd9å!nq¬Ûãнjü1˜K­ƒÐ¥Øâ(Ç9FXÈãæú&ç‘ÀVuôÒa[}ctWõ’9nbÀ8ôn7P΄ôÈð}èkZrrè7E‘ ’õ1·`«·9N”2nó˜íp|ˆ¸GWzÄ•4Pï9·Ï6ZFr7%êr„£úÚÎ\ p¦ùCî×lêÇùµ©ÂlÕ+ºe ú‹Ê­Ë¹ÏgRfU§Š~Ò ù‘6ürꡆŽäOÞX©•CŸÃO:v­¼‹åÏe Äb¥‹‚øQ^ÅýÕo{MZ“ >MßäÏ› EÞ±©9J¡(.!¨}ãÐÇïÌ @Bà7CÚgo*Z‘HEŸávAÙJƒYÕ-þ® \Í©÷ʨÄmÌìa¢\X6Q\Á²{¨­:UR½æâñ%]WÜYB¤SîH’µ5‡´%9Ç›ss¼q¾ƒÊšþóÒ|²T€¸m‘wIÂ-r·RÍY²Ø€š ½8]'¥ðaݱ’Q Gê]$¡Ð‡T@aiOrýë'Rp õÔݱO/°ß;g¯¯©èß^k­”ØFÓj •¿¯I‚]¯vIæ‰È*x…Ù“Ös‹Ã¤]u7ˆ˜â ºAC‹HYtA&­¯´‡÷*Zª\>'ïÓ¾çužK¢õB§xO/Î\ä×l2tÕúDdϪ·œø¾˜úž"Ý›!B¬¼UÁ¬7·Ì\ð*ê“‚´ì&s7Ô¿ûâðໃ«¤Güµ‚ľ°JªÕ€jLQÇçŸ>8¸ÿà/««—¯Üÿieîÿ|ú×ÏÒŸŸ¯~uðŃÕw»¡ ¹ù—ÀÇñ° ô£à#i™Ý;“’ÿ;±ùRoQýÖÁßòn±]>ØõÓ÷¹F Dç¨À°y9§›¢•x-Ôe ç½ ý–貦Gñ».赉¡é÷L©¡aöë û§ù?è-‰rŸ+)Ô ÉOÑà·y‚ê z+"Þ"£ªrZo»yŠp–QþoFìŸTTÍÿ‹ Ù2çÙÒÈ«®N½RìpS’·äNë&ëyaà^÷A êw»…$îÛꜪwYTò¬óW#hW³¤j69‹hΰ$D–£H3vÓ䫛ĬBÅŒH{TOl¿“)¦Goñc%hQƒwðoð-CRendstream endobj 509 0 obj 4425 endobj 513 0 obj <> stream xœí\ëoÜÆïgÁÄý£ £¹rÉIÇìÖy9rƒ Y’eÃzÙ–»}wfvfgIžtRš4(‚òÝr¹™ß¼çòzÑÔfÑÀéßý“­»OŒëGo·šÅÑÖë-ƒéŸý“Ž]˜âMª‡f0‹Ýç[ô²Y»èz_»Ø=Ùúaé«vÙTíO»‡WzW¼ºÚöñ­Ýƒ8ó³jå—+SCï‡å§•]~]­ìrÆT+~ð¤Z9gê¦ Ë6.^W«úøÌ-ïU_û¶Zuñ¹µËGùµÏà5W} >¯,<é;˜”võ;_Åw¬«ÓÒ¤/+œWºa€CY8ÆvqEcâäÆÅC¸w‰ßŒï`¢s6®ãât«»ççOãY𦵑eGÜ&­ï…`)[¯I¹J´\¹¦fˆ¤]åÒì¯âR]c™òp…åa$ÞEå–—@ƒ7q·åiÜ·‡»|ðÒØÉvß_T¶‹Ç²Ë°Æ[8éËxäý¸Ø^dÎ1L÷´æ)qÅ4=N%a~ßÇÁ>2Õã˜gè0÷TzÄg ËçÀˆ<ï,nwŸ†—pw¸À@‡…Û½‡#Ârs{ñ6¸CzéUå,¾‰—û¹²lÜáV¸ç¼è‘>rÈ W2B\$[Ú•/+FÂ\Ë»"­8ÓÙ;‹wJPy‹÷ŽwŽ/4( Çq¥3øAçð#MM\qMOÔƒ3$\¤oÝòÁ´wj—ü´<1½ÉÜ©¡ñ@]ÝûÅ*ŠD XCb @^d œUØå€ºQþâ)â×|Á ãqS¸$]4Š. Ë#/-¢E°—p’.€(†E`ÂÌ÷È{µ?®,lܯ0Û 0”ŽG È&ðD:X.h9a*ÌF\ ®¶a``©`“ÌÌÓãÄYÐ0qzuYX¸ôºZ”zc{¿=>;ò¢AQ{&O߀ö†ÖÐÄD*ç8e¡dDô¾”ÂQº5©zº¼Æ„³-b>žÃ%AŽª¬<ÆÊ‡%݇"='Ê~nõM¸é\‹ÔßY‰3õ‘¸…*#ν€-:$äÚÒ#ßD·€„ÄyŸÂ¼Ç‚h :$ñ)ŠÒ 4)ݾeíäG–ù Ôw©½gÄÉr—bŒÄRð÷_ÎÄ/†p-äÕ‡8K‡4ÆÔj$ 'Î6xdCâŒ'ŸáN^êtæñAaTWé¶¥Êmó†ø òRà0¾NÚ»¶4 ‚u•¬¸3Ca—ãöu ÐÛƒXñ À…X>†?_‰Ý—܇NÉò{øóqµê‡¹42ÑfðÕ2è⡚­ÀÝøÑ‘áøAž¿*À›ïæÁ·2øSZ)ªÙ3m”yæ3|™/dp/ÃJ=â=/®E‡óà"Mˆ~Pc" Cm„†/6§ð'îÛš}™Úñ_ðøÂîB^ñšüA\Ê&¼¨-‚C8»-ÏóŽdð2žÊà… ¢°Ž§?.aÏòJbHôƒãt|b~»Ü–Ççå{H€ÌÛ}yò"r¯ðž¶ç@TPlzǽ9¸åwvòêŸÄ¶Ùä8QYÀÁ·¯¦î,(Õ½_Êài1“a´­)­ž«3ÍŒ^’}ôb~¬ VOý|çk‡Ì/TDØÌÑÇÀ‡Ý5qÒA›±¡¢WK®Öv4zÔ`/ØTÁ|¥Ù`¼€¨å7óžßÂäíN²O°mR²¥_å²Î£@ñ~Üâ)¬Ò)_† ¤,rÆ £›ì!P‹PR¶R¹mrá¶âC’AŒ»HÄz”jZr™²¥RŽÐÄêFÚàu“ÏáÁ¢ œ¥×ëÙ?ÎÞVéSMý§lЮÊۃัhƒUdù¢4°pödÿÚ:¡#Wë\Âì­¿ãPê€qJ&ˆº— “¡ÌwŒ qx•;dÉ €–žæïEßžbг€”¾wͪHt/û¹ÀNECù=‘$ìD°óÍÙ/2ôÈÖ>¯Œ÷‡Ã5ywC }‚S1:‘$äÇûÚ ˆwÙ0Ä âƒÛ&uè‹ë(øJsO™ìŽ×tIXC>¯x)Éz$P|›è™ð0¾~¿ÊÉ ¡NÞúŒR:«t—ÒU… ÁùŽ%β¯ ã™BW«ÀB›„0«ƒmL‹”aÆ Ú0ÑSÞi¹bî$ùòéXÂÔ$T™|à6` ŠNù{Î +eÍãJaùˆn-Xpåy=HYƒHÛŽQ‘|[/”CŒN\jñÙ)ª=Œƒ!‡”X¡²¬u×RV³™bšAÇüY?eç[1ÏjExž·šyL¢‹—Ú€[¨NâÊ*Á²eØÙˆX$ˆ”†(­Òdzô{F“mÎ,Ìq÷`2IÞ`b~xuÔ9F%(iÔÿJ‹ÁœB¥ÓíUüI8Ò\-IÇ*ÄSö TηlÓGSji²¦:GhG‰œCû«0?ÀQ‡5 #0„ Jc²ŒJÃv™ß¡ï®E›SEš ËV¹±Âá¾%­‚ro96Øi(,ë—âÿ<“Õ“E„ãM•¦Ñ}× ÆÛ•|—¨ÝCÚŒ¦ÒÕ”!h”Úš¤S³žÀײ¹W$(çn=æÐ•AÌÏ~…I0a -–p1°šSjiÉä5¬ 6igN˜'äp2¤®vcÝ@ùÆ$/5ÍIÑõ2C¼S Žw`¡Oi‹3ÜpÆ!II᜕'úŠgh²/%<>Ò²Òz'`Åâô”Ú/RNqÒ8ÒzÒSÖ‹dõ†¨õ‹\¹:ðHSÏ©e]×£(ÝY—nâõ¬…L¯Dai[ª9­ÓJCé’¥öÙOy>V@¥Ÿdô~®ó…1ï´‰>`[„êÂeL; *ßçÉ Ö1/UB%÷k|Ý”ýºC…Œ'<Àýìn}³õzá\Ýa0¬_Ø¡ à9úÈ\(\íŸlÝ{´u÷Ñ‹‹7—‡[w¿[˜­»áϽ¯?‹ÿ<º¿øÓÖƒG‹onZ„üñãdïÐÍÀ¢ä,2ýÚ³:cúºû Î#‡Úºò¬£Äñ ú“ELxƒYôq}il†`¡šë4#ÀlR¨ƒø_bJ›ØRTì :ëm YF±…¬l“YÁ@B›ŒÙ&‡DYøKü†ˆ¶·€YgÐò{ý¢îׄYçe8HŒC9`uš˜dÅ`wUpè+t Å¨VE Èú2'dîçÓ:ÙÆëÜN…äKëÄÜ$a‡<ÔoŸÒ?Z¿—ò·ª¬‚ç¶®ª ×ÎV„>ÈZ)JêK‡‹µë4g¤êE¦kë`É`»¹r‘ï›ë\¿vùWÐð¤s’'™š m‹ú,žãWÕšìÜ„TÄY–”·Èùñy)‰{Õýopx¥©:üÅ$  d¸ùÕ×Ró2y;¢® µ‹Q«ÏUá}2äþ@â+£ÝÈà‘Å= —´|ß•ñ”F™êy(÷+nyJÛ@ø^\6> £” ß°4;ªÞ+oI…Ý¬Š³Íú6e4M-¾g…ÊGqœóÉ€§'K±õËJEägÙR HÉ Îøº¯ÿyVÄ{Ê¿#]§ÒÂðð™®ÞCîÜûPú4"é§ÙòPx¿RÙUB.Ö6 =£4 Óû „mÍ!ö¤¢*ùx9„‹?X9M=QGµÛ\|Ï©°¾ ðâ£PCª¨Hç‘ç”;C;‡“Óž*¶›ÄIp¯qGéoá?4e¨úÎeÃ¥ôp™D«LK›ƒkifIuñ¢¥‹µÁ(ʼnavë…`öhGÝEvV•ži¹Ûà2íRæmýŠ3ÇJR‹„âzSi³«7xtó:±‹ßêŽÎq(_nR܆Ȣ$~K¡+ŠÊàÔÅ>”¢K‹ƒ£K1| ”Òžoþ] ‚)zMî5W ËSDï ëúèÓú}Áî0Ý êC”ŠÁ@ÏQ’îÚ4Wä+(¹2ÎÕ0ÞÇÍ]‚ •ë=¯®ÈÕ)‹²*óit×RÜ«2/k=™N‘‚”ÃUwŒ+j½X âk¡Bw*× õ¥ÈDŒMž"ŸJì—ŸîYs¹¶Ëbùïdâ0´|;k¿Q`]CU ½BÝ+c%ú8—_c¾à•¨ŽQæÃVðÝ\ÀTÊ*wyê·¾"˃ ©’'zñï+Kk"Ž.%³m`ÿGaà‰icÂ/õÅSñŽW&98ã.5„ißÌuYXGÚl¤™Ìcé£5‚Á¨@î\r.²VOcV\6 a¬¹q«ž¤¦AAc¦ññÖîö\$ŽM¥KêRòW@èkݨŒÉ’=XÑÂ&*½ ýyàôv0“`¢,÷jÊrsªšo…«Žƒ[Œ¨;îj4ð¢2o2ù,„Æ\Sw#m!IÅíܤ{…—Ä;ÝØ‹iKo‹>&5NÎEÑeóæe¡³çúטÎ*Ç­”x$Õ—¾¢Ò”if€O0žÔæMÊtIo!Ñ %ßÿ»*ë€ö ½8\Eaf𷨂`’”†³ÙNDÛ/ÿPÚA«$ÉwåÎï\Ùÿsf [²¢”Om6(a¬¹ªw\Óý­¬9ë[;ïä+Wá¿=Ý¥K7/‚M¼Fö0Å?.)ú§d¸8DÖæÒ«Qm¬á ?[œŽjã%þùÆ´ïÔ•ÆÃŽ}[•¢}­o î©¥¡žöÜ&ñääÁ)ÃÜŒ½>1„ó=¯ïU_÷~Ž`>Ƃ粡+0®kî(öšm/ÈàI©†ŸxIýÀåJíNRQÅ„Â÷g^Õzk×» ´ÛUËdWWž˜Ê} ÚÏšI|Ÿ(ŒÒrOúyW‘÷=[e·Þ-šQ¡L-¨Ø•iy M?Py—š#qµçü&-tP˜ˆikpÞ²èýtž^×™{9Ïòóý¹Á¬] Öªå'-·Š.;9áw›îÓí¹-ßÏøX§/55'‡ƒ# äðl@%µ=|Ÿ›O÷õ²èŠ2›Éý$w1ï (÷ ¦nËã|ÑÜE}(8ÞÉïmÞe«ž¿RÆB+œi?îN‘ÛöóN•óàå\Ðêלy_‰ôüÒÎô}Ò‹üÞ»’¦åä5šczÌ­wÈ ¥DèÙó9*ê½›ƒf¡y&úOr™¯Ð> stream xœíiÇõûÊ?b¾1v𮳫‘lɱÄ8Á‹Š£h`¹Ä^6»àý÷yG¯º{f‡ N,$v¦®÷êÝGÍ/‹®U‹ÿÅ¿÷nÝSÆ/ž½ÚëÏö~ÙS4½ˆ/¾:À%ÁÀP;tƒZ<ÝãÍjÑë…¶Uzqp¼÷¯¥kܲmôÒÒßU†v~ù ÝiVzù%|ø¦±øEµÃ찼׬ŒU´ìoÍÊòº‡°îAcú¶ë¼[þˆã°NÁÞ•ÁQEß;g¸þ3í?Á¯ˆ#î5q^?’' Èë'”BšêÁ·![ÒÌú}¯Qþœƒ•#6ò54Þ-xÂ5rJ‹Á牽„0ã?;ý„q8’Ô0!À'f ݬOtõ:^Ø#Ëá§QTâ½VÊ´Îwš¯äO”_ÙÎÐ^7t†³™ý‰lÀ8«£@s‰Ôfè(}grÀi–N“ÌÀê!x?†W0›§’ƒHE‘åIDI³â£¤ÃnËÇUB'³n>Â( ‰UQh4*€P³,â’'à»·žÔ†9_+àõ{^´–B½&‰2@ kU)˜uˆ¦!©Cö²øF€8Ì –$»ˆ c¸Süõ˜I`Œ å0á>…”`eŠ †jÍãü )ÿ™G!ff-Þj^pãB’µtc67¾¸¤j¥î;üè‘/LŒL ÐAûŽÔEê)~õQ¶‹HÁ’ìölï6‹žîU1;Ò,i7ÐQ'ä£ÊŠÑš"£§ÔY p ù Ö“Ép›Ñ#Ë„NO'1â}EÆ‘Z’`þTŒ~œ¸-4^ß6Iˆöñ¦Jnø;.úoæÄçÛÌwÚþu™A‰«%Eøy™W~^Žû<¯g{Ä·©íÓDèâòçþKvGEÍû ˜žü ûur)Ôd$'…1Btô€ÍâêHáq¬N_ÓD¦We£“é(ȶÏî n0ð}aÙÝ:&Ÿ›Ho“ØØã:øm|â-‰ù¨¸ú.Û¤ÞY*«£k§ß‡¹®sZÑIñãFhûf Àç×€®öàgÄI£ä ]&ö‘'mÅÐI³iƒˆ—ZVŒÆÆêê“béž­ÇT9í@ºF/*ö¬ñ§hæœ @¶ë|ŠU\49¸˜T7/Ëê©î…¨nÑÓ"1Ä7 ÓVš\™æ;Û<á-*#®¥¯IfmcàBk«(í` óÇp§ÇM+FQŽ@à&|½‘Cc‰[tŠ6ºÖ˜Îç˜sÆ¿bŠŽãâ¬8~¼öÔÒD‡¯c0“wŠÇ™|:{PÓxm]Ñ:Ñ? `ã£49 µ`®†S†A pG0N ÖÖ:ÿKeIN š$QìI`Öìt¯„yžÒ…(@ˆUÇ´>FÕfN3J¸ù‰FjjCªÍlŠ>d´z‰ ±ûÓ3J-‘~è7EÆšB85’v‰[ŒÑC·”eÿô¨-ÔÙ„—x<ñPˆˆ±ÙÈŒå€]oR@Î Ö „lÈD¤…cUµpbH2_Û*£yÛlŒÓû:§³¤ˆÙ® rÔ”©hB°ÑY}–Œ §-IlV¢àVÃq$ Q,‰'Ù¸cû°Ù²­Î–«¤51ÚLf§–e~¼¢±Ž‚â£F®BtΨ¡]z”àꘪ$ /sÔÝ61ß6jù6œÓaåþ‚ˆ”Ø$YŽœˆ/äñ ‚§(™ïýüŠi&á.– ­xöe^LcÀY8½¸L—ð"qÕ³<ø² ^¦AÒtÅ‚@-Þ˜­Æ8çKNEL]ÇyîÍ<}Vï£ËíÇ…@ùyæ¤âL¢×až_לÛ2x9wñ'U8ÉÉ_ý)M ë47ç(ødäÉrÇÛñø&”=óà?Êà$] ¦ß,£¯+ìÉq@ÖpTF/$Ò¤`F·Ù°ïç=1Z;öºH*²KDŸBšÀ¼¦iô|âªÇY|“yé/ŠÐ^%…ú¯v–qå¢e¡_‰¥.À¸·*×YÔ3‰jíÍÂc„ööDÀ[DËyͽx;ÍÍìúSsÿß57ñÿEͽuO9[¹`×·šT¹òÁº1³rÎu%’ñA3Ä:iÌ©ª:ÄÏö,ï»T`mUB²ã˜8f>8·TŸé0ÛúZ¤ÃfZb+e·œ'"Î_Q4µžóY°"×eDNsF4‰0‘,[ËNµ>äòå\q0FŒxMÌ blÌ$ ›ÂyFÛ"#(6âÀRŒ ¶f †Ül°Ô„pÛbCúÐ[Û©‘‰}”ø·.Y1†ò/r O>”âo\€w¡’nŒ¡ IJµ±®©Ø[WâÆ¹Úå©À#œ>®L©ˆnÑñØŽ¨qU7Ä’k_Ëy…ìˆXÃ)ê.¹µ¤”+yO®—ã*^®³9/Š—ÖR1i£tP¾”ú?Ó:õiÔ#J– ')¦ D곦ŽoÒ–x¬×Æšá^›á‹B誂‘ÕQï£ãd~cw ¸º«ByrxëtŽ4~’Îqõ§Ô±Œb‹?M9#¦;¥œª´Uò ܡ´2›ZˆÜéZßeÂQPôñ…á¿eC úŠØë*}•꿪oS·`k‹B–¦F\ž0dWT´¾ŠÎöS6Õ¢ýá‹×ögMäl'}J­7WFþ*¬#qëHˆ7·çæ\mçW?´ÝX/BMA¨£Ú€*=â:m©ðP7Pò¼3רzD5‘=¶X`m½¨]·å†õôn©N¤X©„¼=/’!«EdN–EÝX/Ò¥ ´KŽ.RÛ¬^L«H¦Šš‰¢r455ï«r„iø+Ãæ+u&³˜ÌÕ‡|Š„ôä›úxöî A*%”¿w%(NœädT¤_Ï·¦šÛ‹D"*ÿ˜õ¢ò>:Ò~ ¼/~<˶HµfAN‘;ŸÃã fèi˜teAÊ8דQN>9ã ­òJÄbi&eU ìÁùBèÿqê)#âW'E»~Íe›"üŽå—?áV„iyÂôºµ¨èL²—æ]ʱA„YüÖL.Æxˆ¢¥”rL¿FK}óàŒR”D$Ò#éI*L@¸ñÝÜû„qSzôâ!ÁÞ—޳EòÍ¢Zž$ ö¡›ÄîS=#Æ´½ÄKQ¸•¸¤ˆÄdïÛ>“þmº…† ±0à}î9I¾|.d°=u®µvd[b¥À‰H¯‚ –€D“8Šâ"3GÍ>iÅó2†ŠÁ¾JânöëÄN4P1É=¬;’/.ðì³4ŠXðk€Ä‚ë–ÛÁ)$-=©?ž)m¨T”^R¹D)~¥¨¨]Zµ3ÕýQO6Øe_;^‹ä/b—{ à¤ll 1õзڎ-É{1‹]ϵᙲ0Ò»7 ¯°ý4—úq]ÙiŠeò¿k·]ÀžçÅ/Ò^^rš·]^GÀï^ÌPè&`W\G@;-ƒ¿ÊèîS°™àȶ†ø3'“ö‚#3®¦*lÕ‘{ŸRâ04¿ßÚ©Ö Õ[/µ!.A˜óq‰éüèEx·[=Áßò ^¹©ûï¸9çì)âÑ _¯t©¬˜ƒŠôiÓ/bÓ Çv‘§…ï½èÂbß,W}cµêR> stream xœí[mo·þ.øGè›wƒÜzù¶»üÐMš  Ú&MÕE²Î¶û$Y¶¬ýó™rHîòN'¹5l 0$Ýíòe83|æ™!ýú°ïÔaÿÂß“ÍÁ“”_¼9è_¼>Pôú0ü9Ù~y„M¬‚Gï½:^jXzŒc¥FOÆ©×ñ Þãì”yv³u«ˆƒZÕ~Ìœ%:=€Ò·ø¥"³¥ß0 .oq=>άxÁV ­ŸƒUp¡€-²ü vÃ÷>s§bŸÄ‡§ ÿò#-ý=uÔ;zä~–H~ãüÄ+ý< ZcÒHmJyÙ 85.ÚŒiƒ :_#~\—."/7¬”¿²µQ»bÝ7 Ý»6`©Q¾ÄR×MÆ3˜ñü3÷ Šå”'±Hú³ðÀ0Ìóoüzƒ¿®Ê&¨]~{%éÙ +"ö×°#[î Ì¢Äù¸Ïó´ÔKyx•¯?><‘‡ä€ðDižŸœ³\(,ñ*¬Áõžââgòú²ìG‹ø<4¿9‘7§IÈã¼9iiȹäeËøp-³‰¾HÚ:“÷ç©Sf½ÏòUfïÅ+¯ÓÃdíŸÛø±í )³S¯XéÃ~áã*wBàš‚xwdZà|‚=ü¬Zt)Ø= RÃè$‹–x3«ôõ@q”Ä¡:\n°“&„£í®2ŽdNå>¬€"J0²ù¾+ö÷iÉ®³£ â•aô2Ì„¸o©%Å£ÔÕµ)wá£|ŒšË¢ë: Ajˆ¦6¿ o #!}æ_<[‡hl;= Æh? OçL´XCÄjp7D38BÛ‹܈<â]T=ɾ ×Ñ7ØÞ´×Ÿa›Â®Þ7ßµéö0ˆ–®3WA ?g¹p'ž„ø>Pl% ³…™E¥Aqô@43C˜ê‰j{'½eOéu7IR,f _2wŸr3ÞŠƒ÷N5òáw{S EB4'l"/ÌÙb‡C‡è´ŠÓ3ï€4†õŒâìÒ(¡E€W•ôŒ‘9 Ï!¼Ž)Fgœ?˜#x0XÒ’×™ºæ8àb{‚q´çi†ÌÆØ- ï´ˆÇa7¨´¸|¿&NwKY%òüï#DŸšZË)—½­Éñt`šAL†Aˆ6Û‰x ì~5¨÷Â( ™vR3ŒšÞ§ ò‚]°X¦×8eѼ‰:r%3’Uª€yÆ]Éϲ2aL jˆ!Ò$î…ØaÇ]eAGà)èäXØû¡Sc_tÿ°4KHz¸fØwN‹³$(/ç™ã²`lGÊ+ªµÅÄ2ð¸,ã>—¹‰cc)ée–ŽÌ‹’¬OŠ; .›Þ–—å̘øjÈÿ5¸[ Xä§É.Z""Ŷh®à™õ ÷ .)5Hα4ÅÍTpÈ< -JNn0Kè.cBŠ >OšÉqS$µ¡\¯<5’¨õÔz¯, raÙ'eÝD¬‹Ò¦%Ëf*2™`˜“"%½àNéPŠgµŒ©¬£„Ô‡×Y2ï(ÝŽÔ¥<#/HX2Ç!ÙøOãb#Ó1fé~aô½ÌiGêÿ_âaÃÖ”KQVhøe»ýwc6Æ_ßIÔÂcULë Œ6ÿÂ_¿kW“GUûFIC¤ìä¡Iñ0+rÿT#)Æ>©U`IL#…è,Ax*Ïî(õ¾Â‘&b©iøËÉ‚½äägjì4rHdéJ÷æt€ð²`:‰`r²{ºÝ“L¦Ã„ë-\æÿdò½ÈdU­U§üdSY¿MÄ«©¶t‹ŒTŒäÃÁȼ™3/f}•½+%ÔŒtaŒ6>ñP)æ×0™°–@?T¢µNµík8;¼Ž5TFû ­w”΋*-“C êÅrH±ïŒ‹ñÂ2ò=ªT(C舧¡¶»¥p§ýøáriõXz<Û¯h·©m¤´y?Ý´ù¢f‹äCºóâÞ¼ŸŸdÚ¬¥úm˜(‡O€ )ZNcÙ¡{6þöƒÓÁÍNm9[Þz¬w2f^Ñ~)¯² |òšå¸—©OHX˜C–›§ˆ ò.cò Âm—ò(G•© èÔï]Ú‹'Áâ!°’`´ïî•IÌq ôU€\³ö1=•ÌU..Ñc±! FŠÙñîyR6F O¯ŠÛ5>£Üu»ÆônyÔ÷€Ö,Ïcºt²“]ð»Ó}(äÃàhó˜{ÇŒ>O)CÍ‚öGŠër¢˜ˆ R(š¹C¨Ýq#‹B¤­ßÊz$q8ÐŽx^ÄâtØv²+÷¼ê+ë-q³–––e:ø¥í*F>mŽ—§èÑ(¹C0Ͳß=îojç¹EÚuR‹,XZÈ Òc_d¼zè·[O»‘úâÉEL6f GU1¡¶8©Ú &r±ÿàr…é6TV×LŒÀi˜ò¢ÜL ¾BÀH1LO¼Éë·6“•+·IHTÜ%z D ‘p !­¡óâ²`œ.êì~—O‹«~¬ƒÒ£Ä¦±Ï—ÐÍѧ'—†ïrÀTûeXCÔÕ|%Ïòò‡œIߣæj-³²ÃÜñ°Š˜½]\Nákw^­Š,ÆŠ·¾ "3s7Ùõ÷cAD\$Ҙɕu'Ú¾'ï(âf¸ËÓm{4™àp¨ºP8gŒê¾Ýã‚û\%5”­ÈSµ6`¨§i·¬ÖiÃñar„˜î,hÇT»T¶&s UoN–‚°8$Ë"ˆÉeU”€B’ZÔðç‡ϸ)*s·,oH+¼ðWÉr\MøZ»‡òk–æ&ãñEpT»¥¦š;Dìu=aï¶“„Ô5²µóÊ>.5¯ñÖÊ®¨Äüø[ö/ò1ׇrëÞ7(¥&‘’¢Ê™S@•’Uïúï!¡/93þ˜*g«{¼åpª*T¬H:øüû ޱ{endstream endobj 524 0 obj 3169 endobj 528 0 obj <> stream xœí\[oGrÎ3cä7œ7Ÿ1|FÓ×™’-Û Ö+[–o¼ ¯$Ê"wEQ²HÛʯO]ºº«çBRÚXñC ˆ<œé{]õեϫÝЛ݀ÿòï'gG·wÏ^ »gG¯Ž ½Þå_OÎvwb‘ÉÁ£> ÉìþxÄ•Ín´»8ùÞØÝó£ï÷¡ û¾³ù÷aœRŸ¦¸ÿª;Øýƒî`ö÷ðÓ—ÛßîðÉ4öƒñnÿ§îà\ê‡aÌ/ (ý¸Ý¥aQä~wðøÚ9ï\i^¬â|Šfÿ¹<º e=~ŽøÑô)M>í¿ëäÓClð.¶òGèý›î¹MêèPÙNPy⇷`n÷±sOƒyÐ9lÆM\úÛ¶Ñ{Ò¨êÛ‡ªÖþåáàÊz£WÖX“ ÷á1,¨‡Î\¸¤3I—ã,Æõ!–§óç=ö׎Ÿk¿n_ÈÐà 1aÿQyý²­÷þùq.ø¤¼9©ƒ|¤‹s“žš¼Ñthýùá£úð¬<¬u>®­ÿ;/äiy÷¢VU[ù‘^õ~Ù_}xYÖ­ÿs'qõeùíØ›÷¦×åÅOo‹¦Õ™ÿ´¦¦ß3š®™Î:$žÍ0ôŒT"ãÎøÞùhI:|t´ µ­—ó@>†ÑÃüAOôÁ—àÙÁ€]ô¨)à½Ï â= S€9QÑÉÂÅ“³#ŒÔönp.è’pÝR1ÐPLSMSüѧ” P#.ÖÇÞNnNã “§…‡Þ(ŇÞÚi)ÿ%Î:Fk-ª*˜Ú8:Ð4°@ÑÛ‰Œ‹±7ÎÁGùfLû_±þ49k ¬ª…þÝ„ð²ýMšx§œ7°¯±¨³&:=íó²jx'<¡¦Õ­2ìûy.UÔ÷Ö5«ËÚħ:R#áá v’19çÆU•å@YýáèáGß³Î;Aýù´£¹Xëø° ÈŽ‘âR½êÒsÚ™VM¸Änˆýh Þš1œ«…ÍsyܘŠG}¤-aÅyVoxsžñv\òIЪ’z¢ãq*±n°p$í;Áñ ¶¬/Ì5ï}ny‰Wwó¿ ¶ ÊZ2ñ–tâ¤pÙ†ÀQ~rñxÜ©_Yz€‰÷™;ßvVd_PøWb&A/Nª,AA—ì^Wñ¢D£<_ *o˜!~Nû b™dhÊ3j 8ŒËvÙ‰ˆª— 4ó¼œÁ]ó!$·’ííEóñ|‚~V¶¼ Ž£-ö—'|’E|%ݲY*j‰`°(ç“f—µý —'¥­Ú„½M†6õ—*½Nj3Xð â$НHg±E‹Ñ ­ª3ÎY’ÛéÀ'íXŸö²XƒL- rç­xÙÿ5Ž$|…Ûÿ¹«Ç™Ñ‰œ,5Uªžf ñ¢³‘•I³³4Œ‘FX-)X¾è-=GíBŒ,çäÜݪÃc‹´0zäðæ†jq€ˆ °ÖZÉg²Š9™(4#°½|–¢e‰R‘èË]95¼îÈéaÿQÜÉšžfa’!E뀘ò…R#D¯8žk!CøŸÕj–“~A|Ð )øü,[8"œ¤½'yEU‹”fí‰ÂÉG:&—Y‰ŠÜÂÒwìº1 SÑspB±Î ÃrŽ+¸aÒ†àf´pE«T•Ĥ+}Q u®ÜhÛÏJ0æ¬ÆØ/*Ýù´.µúÊ$@+ZÞä¾4 ÿή"â ²÷j°-"=o‘5Âh+\èØ±|>nT+MÐ6ˆ,ÈxYUö ħ`’4!S·;7eZ3ú5# ú‘ Ç”ªìi‡ OkWÆ Æ“|š‰ˆ4È6κUà¬îÔóNMx š¥žH'É42šQU†ŠÓJ©È9nªžÐš'µh¹§vñšÍ7¤7µlùuÆà´¢?ójyàzÜ®£œÍK݉ˆ:µ[„Œô›½š¬ƒ¬Ù$ë8¥Ä¤N7ÞSö$—ÎG:‹ÃŒ®Iôd¬2Mí8B8kàÖÞSÌÝW å ÚVKØ ¶ÜBÈ¡(ÖŽˆ%lù_ªÇu^Óœ¤*°ücaqù€âU*…ÎSoÉDPèÌÜT 6\ÆŽØÓŸ J×!²ñ,*Æ9M7cœ“á…:/Ÿm Kxi×å¶¼"G £Q¶ÒÆÉ³ã ç í=Ô½NKÓ—½W>˜Šš™ZÃ,µ7¾à™MtoÈYû@Öc&=ЀN¡>‘a§º×ÇIúxQ5þezÐÒi£9Yÿóëíõ‰ë'u>Ë“+œ§D Îo²íC+Ð<‘&¢Ì<(ŠiñПý¢ FAÇö®ÁŠÍÓÜdÞV.Úä„@øÁ,åºñ´ô…;Îèè†Å.ãÏb‚ƒ§˜…™H2gœy3\‹1?`•b{Ãÿ¬K†½ ­¨ ð lgCÐYò˜QëZ¶/¦ð–ƒ`i3ö¦HÓ ŠaõpéïÌ0¹î©ÖמÍlò-hgµül|Ñ`Ä!™‰}È@<’/¥fËU²¡øùNx£ÉB(›†¸ø@»DpqVÍÅ –UǺËÑ‚F˜¹#‘=8…Ø{>º›†é_IŠŠZùs&ñ¦ŸŠ³B”‘Z™¾®µÞuqÁ·{ÏNPl* ÚžÂqŸª1iú03÷”I¹t›ÒÖz%ó¯zh´!wD÷Õªʹž–aéY}!‹˜æÍ¼F GÏô…fl;/³€@²'j(GzB%4M¤gÿ¯7õDÇþwàÅŸ9!Š ºH:µh²xƒ*a˜Uù¢Ïi, è­”–8CÍ$Ù¨‡;=(Ìú€Â†‚ºÒ˜ÓÌ÷^U÷¨QÕšÝ@²G=ý–¨z°¦æ±Ìê,ûøCË4©ÒçŒg $Ãm¹Í[ð¹ª[<©È<©¼bË6ë$m‘_®î²†üYò‡fEòLsÓ½áíäë^W#¤©l¥4Õb­óiççIDwºf]¸új™Üfh‹o=’Õ•3sWž2nF?EXaöÂÀÞ¨+461õ¼>@ƒ%[r®üwnMv°”:4À<ÈV”Ìy¿“¶PÜW=Nëá°êÖŒ…ÞB ‹Ä•:S‰¥ã«5ÌdРב¹ñëWhj(Ï-9zR•52,¥FR¡†Ä?•€0댹f‹¢S-7ƒ¯Î$2‰jç¾$ʤ‡ß‰<]÷‹VDý‚Ys߸ì”…B6ñ¤ ‹;øÏKÅ—eOž^+{HÅË»e›íÏÞ vײ•âŸf«˜ÿð VÝ v\ÍÎR +djÙBIF‡Òu}UŸ ÁðÉnËÛ1® œ„ŸtºG&ÊÞô¡’¢fã=†ü“iÔZ¨¼Ð/J£Ç‚uZ¾·â}æ;Ã¥ CJb$š硵„†mS[/7`Ù»¾>zµ=éLrÚÍN;‹ë¿ŸœݹwtëÞ—»‹Ÿ.ŸÝúÏ9ºõþ¸óÕ'ðëÞ§»:º{o÷õöm‘™Ì·E è ¿ÃôÀ1ò…‘’¦‡´a ºŸ`ŠÀëØhØ¿V[¾xág¶9)kÀh˜Þä¬Å„âÕY1„ÕÔø:ëbžcµGw;ssº`¶ xä7Ÿ®0'úm¦ë`ªöݦ»tô%+au¼E‡ð{XýºË rásJF&%k!Oqß=/†vcŒšÛ(öyŸdG ÕkP=l« Ì{ÂA0[8¨  sH0ö6òÓi?À Nb^ïsš£ò’Xr FW‹¹¤ÇÃÒ Ï9þ–´q°ØOo7Nˆ´q^ÂC ù ÆôBª>®&Ô>LóT+Iäª/p¼2Ç8·hŠÿÄ0}%+(Õ?‹çrPÌWr/ÉÕLtt Q>½Ô4ê fÜ xJ€kˆÅ;ƒ ŸÌ&C7Öà³òÆÈd!3˜Dœ Ú £¢lØÝÜ€æÔØ…›aªŸp³¢w¯1Ø6ìm1}Ê~ÜdC¹hªË;37¡ê%¦D žŠ›§M6* 6S®sކ,F¥û7Ö­Ê›ºIWsŽÈÇ—lõîòÏeI\~š|㤼ACN‡æúÄ4HÖ×,‰Wü²<›û/.Ϲ®(uÑߘòë|eX—EN‡d]Tw¦w"…Êí–x¥õJb®aŸ¢HÕa+[ÇVB(˜1úÈd–µ³ñ«;Ÿßȉÿ·×"/wsºÚ0ê¶1nÝSp½´¿žq±u‚µÀôŽ>’œQ¡#!$ ŒÔe}weà4›Ü]ÉqÉïN|•å‹b&á%­ß”‚E‡¯’š–ôo€ s2øJòZÏ â/¶c¡6ÆâuÝm´*§by©{q7g ’g$í¨64èñ¢âµzÛÈM õóÐ&nšƒs¼¯(Ó‚Hénk€Oi`Dp¶ Ç$êÍø.*‰Ó›Ê2‹A¯KäD´l“ƒÀÊ1¼EÇZæ®Î¬«ñÿæbƒx'Ó> stream xœí[ëoÇÿnõð·ÞEÜeç±»³•‰¤)mE“–¸ê‡P!°ÁXøÛÊ_ßóœÇÞYûšˆª…ì÷œùs~çÌðónךÝÿÈÿ÷Ov<1nØ=¼Üévw~Þ1T½+ÿÛ?Ùýf›xEíÔMfwïÕw6»£Ý‚oÝÝ;Ùùiå›ÿû÷Þ_±KpE—qhm€^{ÐòÛfíWnL;MÁO«‡]ý½YÛÕ–׬µâI³vδ]7®z¼mÖã Î­¾iÈk}Hº`*ÛÑ4ܾTÔ©ÿQ*<ˆ…'±7iá·²©öCgyOOW8_¹ î}YVËNún¢¼«ÏË~øó¾4T}Í8Š NÓZ39Þ«Õ?…ïSáQ¾D-¤ Ilû™.‹z)|^+|› Ó ?mô廎¶ck>h.cíéæGT׉øÕù¶COZʇeôôSø\è¹é0Ojçö>Ô`sRÀÆO#üð„S×qlz–šžÆÂCB4-o{Ô¾\@­N§¨Õ϶øéÁT"n³£ýÕ—¯ë=V ÛÛ›Àˆ³C__Ò,~`?ŽMHM¿…RáÍ-ýà;Ü ÜÂpÏМÁ½…à‘;Z3(Qškƒ€€T†Ï£„”Cä¹´ó#XòGYñóv¿ðEÀ¾½E}Qÿª&ΣÚòî'e¸S–S{Ô–ÂV–^JµáÁî§Ö{û½–²íTªk}Ò–µÅ»v3ZPU™{Ñè_)Σ *©Ô«b¿`èÎ|f¿´ U7B áÖª¦ ¿y¨ÿ¥}œJK¿ªú÷H”Öµ1’ߢžÙ'Ðmð“ŸáîntûÁÓû"âö@¨IÙOåm;Ë€gÄõä™o»ò0w³â­Ÿhûn OzŠélò«Âø9–QߣƲ9À¨ä?ØÕ’ÎÄ2úëyã·f¢&=æ/,Ø`ªµ~L Ž¿5"Ì`À×€ÄIŠ0 1 ‹çeÃÙ ´¤Kh¹—){‚ ÄIðl} IÞáα•Ó˜G:Ð!}´Œfj^ƯögšŠä‰VÕƒ Xºž×qX>røÆt¥ŽœOé(³Ìü¬íÔ·»Â‘LŽÒÙ^,“%s‰Ä÷6¢'Âï´gcâ ‡jXÊ'byqÍŽé ¡jˆ™8Óç9(6šüœÖT®c„š ä¿ôS@½Ë<ýl«–¶:ׯ„S‚È}lÍþ嬩­ÿ‚Àe@#2ï_‰šµRvxš¬ß;¬Â£7ªbŠÖ1˜zË0Sè- ñ>b5(ÕžF|$lŠÚ9W AÄ[*$ ‰Î'©©óA:w³ž h9KSàO‘”±ýÊ@éA5–2—€g7…ÜŽ~cÚüçe$AWñç³Üµ&åÃH–ç:6´_#>5~p=óÉC¢ê.6ùO¯Þ ÿyQ#i¸óÚþÞ7›¬àæ™Rê©Ê´ª™l#Ÿ3¥[úZWòåU¶¦2®'Ô÷mtï·‹ï“\n x‹ò?Ç¥‚Âã퓳[ëÉVQC‘°ýMwn¡;w™1’^Õ°le7rt & ÛŒõ·P¶L¢-)Ù&«wÁµã;# RFnHò#o™H ôÖ,É·®—û×Èçs.]¸suÒŽÚ#î…L™s‘%ã>`áŒÖhy¤l…´O*€M^1¬A#×) ‰Ë|©”lC9Níx3‘8s®ßg]…³@Д$­‰æ¾› .cWûñ+M"‘SÏfô.ÌcΚ’ Vb° ³Îˆ” îPTjóDø= ãh ²ãÒåSko‰„êj<çv—A§œïÖ¡á ÌÐŒmÀÀfïñÎÞ½ŸøBþuN?!ôq$±ß Vqd”0þg›YDÌëòИ$k‹b|[D3s„án:GyžHøy($T]¤ËvÒœFÁh6ã]g$…³(Ió¶3lXãäK§®fUÏ'„:Z0ðT‡Ñ{Ca E/Ê@Š@Ñê.ž¬;/A–ìåå‹A0,±½x6ÖfÏÓáTª%,Æ/ÅžBó‘eÿÎ[ÃÞˆöqõ/Øò±#oÇ#à>áíÄýÔ p>Œ/«úp*ý@ ±Å$4˜ÈgWÕ`6Ô€Sr=’¨NcB%î¹4 … ´:ª®ÜM°‹`k§Ir3®*pSŸœšXJnFc7à 充0$ä3éßõt¦„à…¬å¾ä£Ôká`$k²„Üq)¶ àDâádæô@ω§Å¨ à­¢måœØ†Ñ`£Ë2N–£H&O¡´7z$ñ4Laéb; YjÜu¬{ËjøG;"›'ç9%†¥.«Ø»8Õ³Â>Ôð@`ƒœÅå;”VP ÑœwY1…¯há|;œÁ߀ßP*‚Òðl0á.ŠB—ÒE(ŸÛØ!šùs=WQò³Ä]Ý™D# z•,¥-añLHs€ÎR¯žZTÝÓ¢Œ¹ÃZè|ˆ´°J‘Îù"ÒÂÉÝ–z6å‡40±H¢g§Ä >¸ºº~Š·âµ%<¸†(Ž]ám©'}X8™öR˜"hï±n·æš¥D¥‹Â£¸p$Þâú&Þ¸AÑ.Û+#÷0ixý4-]¥º%»*­õ7 öQó=…15â­Õ6:ob|Ã,Êm—ZŽÈEæ'!ínRA 6©+ÜxƒEw®+•~céŽôûMz¥¼Æ| ’!ƒ&{¿Q\Â`ÓòMý>C.&òÖ>Å.ìšvÌÒge°Â»Ï •{Ù ŸÈ¸ªÛòrIBiŸ¥¡¾Áj°µÄ[¦Ñ¨¡ʶ€çN8>µÂ3Û¥i–h>ÜÜÐã9¯tY 4Ä :è G…K€°¿P “R‘I(Z=ä SÄã†PX»…x‚c¢Á©*4Øå·´Ó½€iÍ Ùþ.íp?%š…x)"„‚-ì×-ŒÑ('¥‘6L\~Q+¨¢¦.'ƒFBɆgé;U銛¯¼!(\=„R÷>º’hâ,…¤QÏ8Œe\p[^pÔªbbGMâäRœ’©RA)ïhÀÒ~Y¾/ÖüΆ+5… :FâQ û“ ¢&O/\‡”ÿòD PÙhðó‚÷ >φ¼¬$þJnéé´gªÅ£ÑTs=sÅ,zÎðÍ™XG9dŸ SÌrØùãµ­buPk»“,Î26RKÜQ“ZÙH$±ÔÏ£‹Ñ,‹qš®!6ºšœÎØ0ó\q"i¼HW¡§šøŽ¤ºÚ3 ]Mv#!k¾!Ý-ñ”­Èÿê˜qè¤Kû ‡™h˜dRtㆼ©$§SæMN=øâÔ󤊱´»B;Ö<Î5¡…¢ë¾tÅ6)Âø K]æ‘9¨šms ñ_Om¹TÓÓ1/FBò.,y–H!“¥a¹r/¢#f†˜³2×™®7b•ÆÖºIQ4ßáò)é>¯KSˆ)†±B^%¨é+ÉT3Qƒ[ýÒà‹°2GNàC¥gÃOÈVŸ¦Õ§é"@¯Â÷~×Û^·ÖŽž€ý~—ÐÑÓO˧ñÛèíæýtgÇ é¹ó„ä|Ü L‰yyÍã nq _¬®Ìˆ]ØçUÏÓÅgµýÎk'_¤oíTÆ"]éâ£üÌ=ùŒU `†ã~^¹¯°I•8ÉÏ$^s8N‹=ÅNðÕ©Ø{µVAYj/ª½Èí Š PøëÍ´v èZ«Hx\§.‘ôŠ,N?'¹}™D ¥Š¥å¤w›´¸;=¹+˜Æ½_“œg5 ç‹׬‚ß7ü5ÚkJ-líÞ#„*„ÈÛFWÍGoÛ(9ñM3*–€ L0€B€Ñ(²b¸ä¤1~—Ý †gG†ªï€Ë 5Pxï¶1¨‹€?ÞŒk‚u“<“òkq'€AY°ë`’ñ®@’}Wƒøº+Ž‚?ˆ bW=È }váŽÊï3êÕÃ>nx«ƒl¸Á¢ÃRã‚ G©²à’Ô³]ÇãŸ5BkÒðƒ)Gˆ†+¶‡Å:¨ZàlL`z¾3P|§84ŒB=PïAFù<ßbü ``#~þqH/ÁÞïqz–´­ó­™Xj ÷91–6GÚžfß(Q³Œ”îAÛÈš ä¶À¿4ÑÐÈBÇÐÊFe6h@<…{>â˜"µ“3ò4xT]õH̯ù¤÷à7îÒ * šä¥€ öŽÀ¼h@½Ux$Øpcñ ’L#¬>ì¦ ÒQ#tˆƒƒ°)[LbïfÉ.àcvÎ.rß'uLP+ôµ0°ñ9!"`=HB/äèf›M°ëQCR£&8~,±e'åSlЏˆX`q/ÍyMºòÒ(äQd¸ŽÖëã&F~h}M’’m–æ¥L À>oì–Q"™i5™BÈvñÀ¾ØÃßz´äÉë N¥…píEŠnò’“³åÅ‹ rLÄÅf2!ŽÝZÝ¥óè™Ò Ì\Ú}Ó%>¾^L÷ ¹î2@‚ˆ¥¾Ê5_î…«_Ö_Šˆæq_­Ö"³*YEpù« Eƒ\/g]¶ó)X¢@ë‚?DJñ2ñ×£’~%ó…4,ëîu¢°f,Ú<©-Š:Ø<0¿àiàÉ2r™-Â"¦@…‚½fá,)¬»nŠG E0zÑ›˜"—I°³|¯|BáF5GŒP,»2Âa!lÀ³Ã’á&ŽñV§[ÇDe?‹^óaq=¢à$äÞPRø¶€ÀªX‚`²ø^T,€ú~C± † °ˆ_z Ö²¯4MçÀDÿ›’U«ÕD™.‹xbx={ûZb¸c;‹©Œþ)èLù$igȆ܀ԩÆ|fè3E8=q.½)T3Fmj JJŠ–$ðiÆ1‰ òòˆ!ð“ ¨„ ƒø%Ab1*œGÌjó]øß…M~›ø¾éÁb°éfœG?Vg}d€aA/Â%NŠÜ¸éy##6ÚS h pƒÀ˜d„|'Éva$›(ìe§*E¨°8€cO8j×3~ÚÙP‹±Œß4ˆ6tCbæRäe'z¸àlºv˜rE„”5³ŠX¹¹pÒˆí@qZp~·M´Ik5n€€L’×óô°æ%-ú K%òGR¨ì¿Å)1‹•–¦° © °˜Ã]²…rj_7…c—e’Ez•d!„óÞã„€:ghÇ\(,&ÒÂûC7pàXCùjL(»ƒêA4ÌV8ã˜Àš$Q ùcÌÉÌ AUY”vdY£‘ Ǭ Iί –Â!NwS!&JÂËdÁRÍÃûÿ6IÐòϘMƒþò~,"Y&דöe-)0"˜¯6•¢þðm˜Ä?NçGÂoœâÿpM£qKå',<„‚…wK?p½ð>Ý}Űd?&(éçÉ‚ìã%:/y¶I-‚vÀdõJ‡¥@“,a©àØzJ‚¡âwmª;Ý‹å°ç¬R™ ‘tÄ8BC3¥ãêCá÷8`NXz¾ü+‰µ6ââN”D@m0S׎«ºLãR)JBLKá¡xjúœUbâõÄØÌL\’,á£0„5ØŽ 4¶1›9iã.l­Ybí1jà iT¶T;¶TRXŒq•*0f(c®Glz9êô–ý˜pÅg2µ3eÀ¦Ã"¸Šß¹vPÒõ-E¹Î —B$žŸ‹¢¹È859¥YcÏQÐx9ª¢£²4çri—4³Ò.òÙ`˜í‹`X‰y±rè–tvP—È’ö]’ÈÄa¸Ø™ ˜ìb-®ƒPÇ“Gþ¸AÃálÒr? Q¹cæ<ׯAºÑ¼Ž…rè/ËÙ ˆ sd², Ö£ Š£§Ù+ºÌa sƒ‡ˆ´.I$…NK±-¦H^Èg–Ç÷²¤Ö<óqê'iDÉ÷F«e'6KJŒòdòn|šÉÁ/„óÿ +†qó3ÇHÖ —Qµ ‡SŸ K ¿Uô\)>IN zsÜ€bR@5H‘z@¥—„ËðÓëì’áè¡K ð4~l«Ý5ôsDù£‹~É×Q\e(ò¡ÅR];¤’@Ìœ;kJë¢d®uõ-À¥Ðòå…9Œ„a£”MO®cƒè¯5ЉÀcG½ƒ‹$>p§l EO$RÀØêDŒfµq-h1Õ쀵ª×ă¨]Ù™QÞWÅSh2žŸâ9t @è)1ÇCÅŒCùU ƒHòàÑC ’Èn^RxÆ­í(ˆÛù#(«gîÊ „h¦¨ÑH÷îÜÔ$s‰it)ýAŒ=ëÀß²Ö1 s4­–°í¢p§Œ›m‹¬$Í^ð‡Ä<’¶ŠM-›}„péEžeR 4xe…/[ÈuhzjÊ\!Á:¹#=«Rm¨êÇ’É:æTNöÝrGù~(Ma©Ýøj®jbݲžÄ^ŽþTæÐ#y¢ö\lÆÀ*¸O¸]aN„pΉÞYÓÐô4UâÄW«kΦÉâ”ì×D%c\«‡I&ÍÍ>Šsœ›w)ç-gVbÔWMãX$Á•¸  ¼s´úrõd­©šÜ­ýZ ›¯¡¸ã=LÆÝ>XÝ:ølýìâùÉêÖ7ë~uëø¸ýÅß߃ÖYÝ9X¹<37i Ä™9Õ·aàœ47·P 4Y×W÷VÀ dQ%¸eÕg¹ãéTëÍoÝð,j@2ž:×ïpжXjÅýVSkï:œ—w8?M?Ï+ÓÅ»ùâÕ+aNOP°ÞÜÑx¼YŒ<â0†›VÆÞ|»´ªQ¿Actó·=´?ØÚþmêwT¬Ó¨éÁÕÝ¢™½WÐrÙOâøçnx“ÊÇ ý&(ô#-—²ß­ ¯^Ã^Ô&V_ÓNØiqêÿÒN¼Eû?/ŒÅ@z¯ùøóš‰wÂÿT„PîH ¿È@݉bã%»Êý¹³ü¥&KUvý¾ã\ ¨en’æt;šÁ¼FP³[ØúÏžÙ¼ o~çðæ‘{Fîº/ ×_ýšëŸÀn×Wº Ð êË SÄÃweoÞP±$ȵæI¿:ÎôbŽ;¤ÎÕA5ˆÒí«w¥^}ªC9 nê5_ VȨñé¡ i)Ç(aa½ÑNZŽ-ÓúJ³Éw‹ý‚¼CìøÆ_¢Gui£€[N×Þ[âÆ™hšÝŒw5 Aí§ái}þ2‡EYê¬;j?\Ò]ºrŒÑ‘té±4,{™tXnçÒÔƒÖ€šËl}UGS;*A^§£©±½oæM\Gv«M\º\¸§^è…ZùFQæø3ù>P1‡Q}k‡‰âÓ¬<.ôÖ° &nÞ‰F®?LÃב<Åü]"×j~Û‘'þ¨í;¤y±ÔŸ€ñnøÚo£rëÆ*HÅèm«ÙD…²d䱟+Z¹ÉÅçiCe®ìu$ØÂ¾ÆÈ…2Äå«F.”Ñ‘;SCgÒØwnæÆy Ù}ªõv- ˜poW|ài¹ÉÝ\XÜYùâÙa£b#—¯lÅ;‘Vü:$Åe1<v‡¯nÒ7ÊÆkþFYĦ´2—›‡Ù@a4*“÷ÁìˆT˜µhR×5Õ·—ŒÜìY—+ódý®2QjÖ˜µzX꛳VΆÆâD™>tc6žG· *;:çxïFì`R†&öö^Æ7¾_̘Љ5LýûQ¼Z!1Š Ú±_l#·:9ý«ðFÒâ¼P×›ù|=#t‰³Š½È¥FÝÂ[²:M'¾±×y,¿:5(Þm-£$"°ÅW·sÛ{Úc§Éø 9=*jÜ9½w;‹Ò¶.²ó¸¯lu{Æ]N¬.X3sÇc´74ýÇïtÆPeöf§a[å¤ÈûS¶ú±e‰Õ/Wÿ‘M¬Þendstream endobj 539 0 obj 3879 endobj 543 0 obj <> stream xœí\koÜ6ýnôGø[GAF’H,¶@Ûd»»X´ÙÄŶh‹ÂµÛ¨=vì8¿¼’—#j2vÒ´HƒÀÎ Åçåá¹/ÊÏv»Vívðÿ?8ßùì±2ÃîñõN·{¼ólGáã]þïà|÷Ë=¨bU(j}çÕîÞÓj¬vG½;8Û*½»w¾óãÂ6ýbhúŸ÷þ Mœ)šŒC«]hµwj~Õ,íâŸj½wÖ/¾hôâQ³Ô‹=(Ø,ãƒÇÍÒÕvݸèCçm³Gž™Å—ÅfOšåžk½øWnö43­w#ôFÃ7@%Ê6߆6Ú´ê©Ò7 V ½øÁ{˜”†éÀdôzT*TîL˜„éq”ðMÙ*£C?&T7лqÐy|þ]˜K×õZá4¸0ˆÃ„©õ¡Ý8j¥Q^Šr©Û:·»4];*ïI¤§aÜÅ ~=Í•G)=…ï§\h×°ž0¢Zü__¯«²Êüú%öE•oàëYúõKjqfË‚=‹q'Ÿ…ñu‡cSû§¹Úe*¼Ì…W©p• aå:|†õ-ƒ¨û¡Ó´ÐŸ0t¹2j}]>8ãõôÇm½—_–íP÷¹b€ÚÒ“oó$¿I…_çÂ7×´Þ…ÏNHã´¶ðë\˜çu” Ïd!Ò¿RïtòA sÓ‰…çµÂU±°øñZN¶Úè¡íu¤‡Ï#‚”VÙVpvµÒ+eÃÙÛ¯ÎàfÒ êþÔ ,ÖÛâ虡kÅ£çŒw4]×®½F“ályUÀA46̨_a Deûð‘Ñc•ƒðó¼1XuE§ŠŽÃ× ®³Àð ä;D,rÝ_¡Þi¨—÷Z@€¡1´RN?¼àîF#SÙ ôAµ-,@M˜ÀM<ˆ.ŽEš²(S〵8¸Rèf7 È—Õa îŽd½G  ¼¤û„êP¶¬`Ï›<+–¹‹²Ã_6”ô *›1|T~ñºqT3 qzXbh-èú$4β÷k‚T^%„ÁíáøŒ '68Ì÷°`þ€²PI«5Ñ_ÆÍ}A}j⹸>.˨°¬%‘$è§€6Ø!èãEch!f@@ðÒèËa‘Pc"XHÖØ ,‚åXÀÊÑ  ì¿V(ÎéfóHŸÀwì tÉI¬‚.ÓyÙhÜxC†mcH­€ô¦ÇÐLóŠPÏÅ¥pèMÊÒ7„06ë§f4H¥#™f­Ä|˜µ n'@Ê@i•@, 3H¶ë¤Á^­N+ ”š¥mYI„ŠNq-‚á–¼vDX ­†. ó.n ÁtIäW`!ØdÜH‡Ýd2‹|µYç_{¶ÚÚ“A6Ãé<>ªz …sl-Íý»dvâ&ÆFÜ¥}?Äul;rõÄ!‘„U;„A”âQW05l2‡™¡±b·Vb«…ª2ªCX¼Ì“€uŸáO˜LTZÛ•v„Û=—ÀŒp™‡ˆÄCG“ÁsG'ë†ËtÙ¤.÷ñ¬ÖéÁDï 0ÿ›5&ø;¬V#fîá©À1O*ð Ù úñÌöPrH‡t+PmêEIMitD`éì–OéÝáÃËØ€7½—à;"ž™N´ ›Lª5Þe–T•Å<ù1`y'‘½œÊ!B Ù'ÂD™)ëŠb.Jƒ$ ÁT ,£P#Æ]+7-ö1qŸ¸ —©òb]´õ™(`ÓqÃTY¼êR3n€”§õZ ‰)É Ÿý%bzÛ¬{ ª¨M’ˆÝˆØ¬à’1i O$Œo¤=Ù™nPM/G^Û Ø'ÚÎbOЩ#¼wá 8j@bfÅÇÉ&<8hPßš:ÉU˜¯¯3Ý‘H€ˆù$‘ñ¥Ú1Áî(/ÔpÅnF<ÐH.Xë¿%kèzuˆaxÇ\a–€'*cò‚ˆr˜÷ƒâ4´p•BÀÜ>&,‹£<ÑO]Ø0¢p½¥yCsìÏšÈQY%Â:vˆ´ºÆ»Ï®¦Ïù$YOî8Gq€¸`þZøçæ5ªøú ¦u!Š~µ-éÆÕÀÅëÞžƒ0^xäˆÂ$˜¹Ö>âl&b»ÃÌuVÉA>Ö ªZQ Ç SCÄëJ¥¸*˜Ë)œÇLJØT„S& ZZIR“@®²%®øðNq¥½“µ çúe“‚z16¥*PUý–áÜ/Ò6ž5zÂN}%/Q„Þ ZQ"hxÊVÏëíõ”Í!ÝŽZéè€5¼w¤3Hž%ºû€§uX£.ŽË íÒÒƒ¤cŠhÞ½Ìxol¦Y¥ñªJ´ˆmDeQOrOˆj(%’6•±Áv¶ÈÀ`5oÄ@gÅ.s”Ør¤Wà6 ÐwI·ˆ|ÒmrVœeº”ÙÚ•lærJÌ’Ü÷ó¢Lx²Œ£=à€x,Bó9Î^XÍ/ @'i&Ž2-¹ï¥b%R1-¬²•eZEzAƒúR0b³5% Ù°Šâ ëá4«ÅÖ'‰ßÄ¡á«ÃCi5{Y²¯áÇ)€;2̱Ŕô±Ú  aÚx)±-­ºb,[=›·¢ÝÔ­¶"ymÃ7:%´ºqK~°ºÂÖô3z 7Œ—mâü \H™â‰Àöžc8[goR¤|’¹‘aü‰„6Âú-´g{Ó°ùÕj¾Æ£>«PO±š¯É¼,5¬KJt‡j#t–Õ†0eJi¶E¦Æi´'¶ÍÔDCeš©aÃkÎ/©lÌÝb&¤Oh¹¥>Ù&eˆï)».ºZŸ2+ý€ªÒ5vHfÔ9îr“ÓP­SrôU¤k8>±)]ÃUêérY]<>Isr–Æ Í©™0ñߨ¸ *}PÒR,n^%KÓÄÞi’†Õßm|72Ðgòá(ÙàG•/^ïäÄÝ7K;ЬšƒNÁL·PŠK^}ÔY…J]¶ ÏšPœ9N˜> k¦O”V¼NÖÓ¥èu̾\ÒØ$¥–8·”BX×ÉDfᙕnÓ;Œîo«Û˜­€¥§œy¦9R¼n„Û ˜ w&/¼°¶Á·cFÃ5—Œ÷m¶ëkn 9t3n¹aâ‹ d<Aæ[8ã¶(qÁ 8Ò!1¼ÀñüàÌ‹^ÆfTùU΂ˆDh=*.;çdÝ‹?Åeç¿j:ôíïIÇâ–÷J¥Z:”oÁÍE«Äõ¯J+‘✻9½–í †¸û˜íü ³0¹©Ç÷Álù}Ë·œ¶»ìñ¢bMŸþºä÷{¼gò¾hRŸ˜dü8­ ˜þšÉne0ùmA™©ôÝ¥š˜ü‰òƒ#ÊVéμ¶,A¼‰¼iº4Þm¹³¼vPðd‚î‡Î“ÄßÇHLŠöóŒÑ­ip?‘+¹Ï½ÌÌ?pù7>>©‘ÖUm÷VÅ©ÏÃt£æØqúøõ„¨0âöþÈ5;^çgI1nð;cÅ·ygø-YѬíâ6ï oÍ­ËÖåŸÊºÌ ± û3ìæëÈ9 ©xIgæJrù÷1 |ÙðëR [?¶ñšßîºËûâVÑë™E ¢È)päÙ⠨階Ué¢m~ö§‘]徨Hi­ôVkñNž§+}|U„^Ä9Vq¯m?§êS ®9rz6eÞµ‰.àzJæ<‚H½‹èáõÌ(C~ »âzü;•Š…,RÈßvæÓf”Ùu;Í¤Ô eÅùÊ'î§Ø¾/†›±š†‚[ÝÝXŠr’݆›1xÿ7ÿÑ–)¹ò<ÒèíÄ”{o1ͰßpÚ=_ -_º×zä qkxš]ç̦ì)^’©ô¡öb§h[Þ‚Ë9œK†ÇØšœ•!»%®pþ„…𷆯»”æ>‹r‘7K«w‹Ù¥Øáët«ã%Ü‚ 3Y#q5¿¬Æ3Ÿ¦ÏWñÊG¾`hÊ(]f€p–1]î‰H-@ÍÚíòE8IåLgºYoÜ¥¼ÆïUoÕL¡Øå̬§8Æëƒ£6é¯:H¡¤iŠ£yÎÀðâ…ÇÈ‘†^øø%çG/ÿГ¸8õ¶l ½QÍ[âî?ÜÛùoø÷ì\¯zendstream endobj 544 0 obj 3905 endobj 548 0 obj <> stream xœµ\YsGrö3Vaÿ„^<Ú]G_òÓjÍÕÒ¡õê CZ9lA†€â±:~½+¯ªÌêêÁ@´‚ÁÁLwuY™_~™Õ?žö;íáÿ=¿>yøµ ãéÕÛ“þôêäLJ·OùÏùõégO ÈÒ¥néwúäù =ìN':αsþôÉõÉßwÃ~Øu{¿ñïÙ4/Ý2»Çû3¿ûë>ìþ¸C×÷ã°û<ýz´? 1¤ßÓîOû³¸û|@±/¡ü×û3Eüî›ýÙˆ©¨ëgª ÿçÞuË2Ç忟üt2:ÝÉ8L]?§~>¹H}‹©OÓ~€’gÑ/ÝOÏBßMnY¨À³Ôz3î.ÓשǞ½‡Æ_íÝ|}šªy—úx¹p!ŒËîeñóôuž»ÞÅÝ ƒÛçé?ü} ýÅxøÍþlØýŇ49XŒËínáZOÝJ9üÈu@7fxÈc lˆû`jYÒ,¡\{A=‚1qõgûJK88É%=Îí‡yÂGÔpßíaJý2vƒ—¹Î ÎÔì}ªê‹#ô¿½Û{XÀ™šæA¥yY¦Éƒ ,pÜ=I«Í¼(.qìéοÔÄCŠéçàüî:J†yT©Wê²ñª//HÖ¼ê3Š òÌ…n{Oc•±áÌ‚d¨‘±ûpûgç×01vQñC?Óã´ã%¸·$™tC‘Ÿë2ÒK¸ ¥g¼kä@jGøÊ;ƒeW:(²J+›Ähv~.kµú\«t)õЍæáîÕ~Àeè#> ÚUSB5æ7×[ Ù)’ÎÐ*@Òm¾µLsËEº`¢á9-]å®’¯‹õ2ãvâÑ~”o¿Úû<שéÒ±­õ˜h¹ôôÞìýbæT¯àñÜ[’0š”°a™i2¾ßíËÂ1Ç{øqz•!ȸYŽ0‘ÖÜKѤC]ÎÏxîXTÈ/D Ø}ð†Šöý²s©@Ÿþ¿—iãÆT?ô.>*¢[¡š;l‚&:j1ú4Õì" û4•’Fáÿ'ü®{¦´QG&)÷1–M»!à·ª£j¨èèPÇI±êöǶü|À—"ý,/ô.Ÿ¦H.%3IF+¸E­$~¾K¦ÉÝ,{!-., è®Á-ØyØÃtn}šæÿŸçð–w?ZºO\çÂOáç|\æ"où§tô<—~W.¾ÌoËÅÔÇ8ÂÆwSO}¯4ÍóV…¯[*™¸’‹¸¦é*Øj«}“|Õ³Aõ¼µ7^ñ°†žôéƒ|çF æNñ¤‚ŒÃzÆeFù+e^–>šåb³ä«|‘º]XMâûÖt?oMYiùMþ†½W”i~¡U¶z&­êª­!\æ‹ç­&Õ¸nóÅ›V?^Q5¡(Ï0 °¼!øÎg°öÖ”„¯1€9ª¯òŒÉ×·¥lÚjr™Áa˜N]ìB=í³qìÆS€|>ˆ¦ž¦˜¶sÚžÝà\²œcÒE.éî1‚®í;ïç>Õ½Oz\‚ŸR·|—ÌØ)yüRPhÒ¾Ãà.¼¿,úi\Ñ}ÒuoÐ nJÏûnÝ‚µï‚wcø{Ú yê àªu˜#ÍoˆnŒM<Òä~qòäÁßI»ÿ9Ù´®È\²žL ˜ D+O­Ý4:D j;Ù¸‘à)<Ê4OpÀ¼/u¼6_5®Åú²µ}ì{ykãïÉZùb¸Œ9ŽÕ#| ê¾¥ž„  5ù”ÃvW zm¾Þ$÷ X,Èæ‰IÓ@ˆ{Ý‚"üÄè5`ƹ ž•9³è…k4ތ܅-Æþ?PÍÖèŒú~–v&ëWGV+íf–™ú8‘!Z¯;ôŽE"©9‡¦p%k1ù(²_Eö[Í„‰êüî¤ÙqÕ ÎâLú+£ë¡ Å™&X ‡žü˜íU¬à¹F´ØMœ:¨–¯îîRËœØÉ(‘_“¿†~Q)ñ_¨Ííþ‹€™€V(ü3´E†¶HE|×åÐZ®Þ¢š–]é}åÁ„ñ ÁWI(´J#±¹Lá-oœ¬@®^x4 ·/fÊÕæTjBœqMÂ8ãsO¡ ®Ì:@c¿Âe—eaZU©ïÊ¥4æÄ> (”Z´5Ãòº¶gó} zHÊæ PðIÔ¾ÝçƒZ{¾iˆè©›Ã"róe]rûâˆ(ɽïr×Ú‚%³öuÔÃÐ+Þ2ø£ýÐô–Ùe•'Òüà¶õEl´ª/­|ÂÚGæÀº?w«8e5qð8Îw¤ B£6_zþ6]rþ§Ø&SdS¯`‘ Ñ‚QÍr­ìh}Wß’ž©¬™ú)†ŠÏ”ä€ Ãj~…o‹­F=äf Áú¼oõSXnMª™{i5ÓÀÿyƒFáñÖÂù£òß·m VJFvIݺºJÞ9Ü+ÒS4R«¨nɯ¥A—1æ«á2cÀÁ%+J<¤ÒW`_‹CÀÌŠÎ(¢jP…cñCÍ@³ábQYHò)0‹¬RF¹„1‹Ð” h§ÄåwÄ ¬Ñ•X§f½jHl%z°*N²Adg^cT)ï(lÃF:t *<Æ|ÄÑîrW±DØõe›»ŽãòÛlÒPÒ ÕAk覌Ƌde6ì&ã›fª°È*ú, (fú…µfçÀ)a×8ð̶)‡@OŠv'eRT 7'“5NyÑ…x‡œq*à2ü¢\5uÞª+ž÷ñ03’NÊ‚†žS®‹¤ê„~†  ãª+Ò‹cVg Š&teÛò£[Ú%÷cÔ8wˆ•(˜&–¬Fݤ=]äÞo;M:Âh»Ìž‚BÕ³U"íì9^X©°¸¸àZej×rÃ28^}n¸Ãˆ ò[©K&±'Ū A} +ÚBJ‚šÖ´‚˜ƒ b¤×:úÇ£\Á†Ç[«Þ‚RÓà›¨'ŽsÖ¶™/UQ±ZBÏ÷uÄ{®Ca¨TH6)® õvêšÄÈ»ïUÈûý¦%eÅ.¶cšäö&ßëo¥ÎÖ©aâ29öóY™ø Ô,)ÆZ²Ç¡€†ì‚w™ùKÈs4ÿ?âüa? má̰8G×/§l¹’FOž Ø#䢯ÔUwìUžœ|uòãi²Ç#曦)›O½K°nžÓÕÓ;ϯO>{|òðñ_Oß½yyòðÛSwòð/ðñÙ—Jÿûé?MÊ«%Q¬ïrx¡¨Ðîgk—PT¬ b’.>?uí,Kž;У¨yZ€Š~màUäÞê áFt’DI›šS_ªCuØZµÃ8.-ô›’/h÷v#¬’Îxjµ›ñ­u=3Üß“eGXH_“ \‰€(xœ³Æ(IãDJ’h fùxƒºù†=œ5W?Æ>I¨I&?95WùÛ\€„b="Ó?ˆ -fžñ…ÐfÅ 5§CÑ ¤¸’Æ*&<û~ˆÇ*LiQâÕÞ¤©Ã8U†[‰Û©å¬##äñtF›™9›êxÒéîçœÈU3Ñ“-“Ô™"\SFóÑÀEëÇ(úk,þ® F¤þ¡äqèH+–`ô_ö=4V¦ª˜k¼è)ž†Ñ‹Î²"ác ùi+f“2qøÔN m‘QÑ—ý<_{D$-ôó7$©×kQŒ “Hæ ø´2X«$YKvÞÙ>¬=‚­°ÐEYY„€u‚@&:3Îã?S| ‘_c)ÔD7F—ôÒT´³ª,CÊ*=¿"cïîHëó ýW^_NÕáô¸ìe¢p™´c^Ù»d…V+óˆí¿¢«ž(RGƒÈ Ï´ï"C•;ÁÝó•c”_ ?J[ÇQ¢‹St˜Ê°ÇiÌ1_u¸é}î>ÄA+u:)”•t¿Ðð}BÀÅYåhL(ûøP†ÏYœœÊ$V`Z¨7í¡óIÇÇxŸæ³LËO%¼Ê<¾b­ô–í¨ô¬Ð s¬”´bxqv<Ú ëæªíí¾•bÓN8q“Ó0P;·¯v1sp>ƒ¶JÝ.EY„Y§ýåì‰{$Yê Jeå¬â¬·®sx¦¾R¦`ÆÂ‚€Þ)ÕŠ­½äåÍâ( ­i¯­=‘Îwê·bˆ –Æ•à£þ àºÌc¯p©â8Ë0MÇ%}çÄZ{àŽÎ`¡úê#©˜eVK_¥§Dr……»sÖ˜‚ÑÍèíçòÌwpUè—ûïQ yÄ4 H5/¡ä'(2»ìgv0*ù‹¼ûž<†š”7ÈäŠñ!c§ê7E©¯9 ô©W<êí¹MÖæ‘ßSûäy(’ö¾‚¦k…¿J¨¤Yuh5óB¶—3-aåØëã½¼–ç©ðŸ÷ø¢NË\¥qÐ[–’i[Y+}ˆ© C&· ¶l¨Ì†²ä•·S|YZøZ|̱¬Eq~*fÏïºûÖAGz$ô~5Y Ô¤ RE2kpt9š¨P#(Ä (je—Uf9ÀŒÁ‹ÍXÒba¦¿+Ñ0Þžâ#Ó¸×iw‹Mç§Ä!€ ozÒ€šh†öÝ0¤ï ý'þŽ¡}7p;2 0´ïö9ëhÛ­Á®ÊRZGO9‡´¡KÈÝUâ¬d)Ç’5¶q=Ùûö¾‰ÙeiGcŠtwnıZóö,·:aŠýéCn~ig°kׇΗ¨ËAQLspHæÖ±}:åH)¼Ü)ø:òQN¨\5?©|n†¿n‚¿¿ŸÀ&4Fhö% ¬/ÌÝúä«—Èåœ,¼øÿ’×XÄx2ç„€PLÞŸD÷~YªG’sF_—p?;}ÀÏ¡kæ¦ïÙ”Y?Çmy¥Vùmcj× u¹:èÁÀÖ³yLº¢ÄEùQ”.8uÎhÁô+kš±$ÇXÀ0HP£Ÿ-Ëis\E²(x"•5P%npAcŽ4ªWOÑ>H~î*jÓ^‹…Îjš‡#sY±ä¬ä_—ã ™_UøîbŸOc‘óøž¹õé¼n¼U"ß;~óVÓŸ‘ÕQD¼¡Ä æá~ÂOaÁQ¢®Œ‚±pë—˜.0³ ’hœ„Ò= ½dð}9¿›Æ‰i©Æ¤qú©›Æ•Æ1|¼¤ÇüBóÓ8Å1S\¨Úpö˜©_}Ôã-à¼òö@&hº5Fè½Õú’Ö§¶ÔáV{Ò±ÁªéLIã2y)*¥`ôwœÎ‡}íéøtñu2û/ä§y!ÆxKš×– yÁR¹È©]~!¸bü)JÅ ©XŸ—„²L«§Æ”€…sò¦¾~΀ð(Â!Ä’§ÂÄpç3P…€ÉQ:¾^‘Ûœ-Œî±‰ÜÍ7RЋk×iyŽ9)saµÖ:µ"ä³@&}ç¢x’­€Ó2“Ñ>}ï<ÿQ±õ^¨zCpsëókoš£Z¬2WʰZèÙ­h{9Êã–£<…ÕÇ”š/káF×»s™ò­†%(9J½Ê9ê˜yW“zíe>éíÖ‡Š8¡¼z§ÏÿS¬TD&§©ÌàÅ\¶õ¡ß}›C¸y ët6KYÅ•/Gô£Ó/îüZ\ñŽarY_Õg Zü¢,bÎC§Dß‹CõÔªo¼’CÑUY† ÿTKAroQêЙ)NÀʯ½&¸/.{(¯=°G¿æÞäHc’.‚/è®á2¶_Ôï:¥G)“€5ÓS=”mƒwŸ8Ê<â(‚î¯Nþ#üeendstream endobj 549 0 obj 6044 endobj 553 0 obj <> stream xœµ\Y“Çq~þ ¼hÇÁu}…C’BgH´,B¶Ã¢@.°€ ì."½+Ïʬ®žP((ÌÎtבõU_fÕ—‡Sx<ÀÿøßÏß<úù_Cšß|ýhx|óèËG~Ìÿ|þæñ¯žÂ#9”¯Në°†ÇO_<¢—Ãã9>ž–| ññÓ7þ~•ãÕrÿ÷éá•%¹Wæé—òÖÓëòä¯Ç|õûC8­ë’׫_âÕ_Çxõ¾ÿÍá(?üõpL)œ†a¾Kã§Ãqž—ò[ºúÕ!ãkŸŽSù=Æ«?Ô×~ ¯¥ÓºÌÔÓo~Y&xˆ{í;ÿ^Þ‰é4„‘úø€–VÖi]aP†ƒ‰Si1„òðÊ Òˆ½”¿BžàÁ”bi'•Ç´žh\~ÿ[Ë0Œ1à0øKí»)CË{óY”^úG–å1 §9¬+‰ô÷åmœ,ôuõçC"‰ÂµUTø—põ¬ˆôuyí¦ü{Wþûªô{õª|ñMyû%ÈçM™Ì0À[øý×å½uEÁŸ·ð>÷¼¬¼ O. þä‰Ýâ ÓÍÐ&|°ÇïaðÃtKÇGù탦KDzdÐ6ö½ã0Vü†&PÆ”ËZO2¦¸üSÑ®ßÂ78Ëçm\ÇSŠÊ`² ø ] .î`¨6¨íðœKO˜kaù šA.«cx«¼F—FñçvÐß(T_ê"úe9AïŸkÐ0Jå9 ¾Íõá¹´—M{w½N …/¦vÝ@8G–α}œ†HB å… zƒ™Ó¢—–t6.WßöJï) ¸J/?O:ÎEV9áð[‘å}ùg…¯¨Š«ŠßÂOEäLÚ÷Ï-4sð¹#Ér~ƒ‹ 2éÉ/Ð$ö¢ö±iåëá•XXt Œ·áÄažæ‡ºLaþàp9) Ÿ z¨‘ ø¥ê†7î€aXÍŠ dŸ’n`  Ò3ImÈ‹õSÅòW ©Öu $dl!{ ÂY¨S´mÔ=¢ûŒ^‡b¼nãº0rƵJô¯ËÛªàx¥i@”¶È5›Fè3Ñ{ÚÁBj‡ö¶j™(Š+MYßÔ¡| jöíFá0LÇ8á8¦ãŒÓß(Ažú«ì¬iDð[ð¨˜F¶Ï½ý†qVd«@«ó*o„VíÖm™I°l ³ŠQ}eÅ;…t·Ñt×ðØ‚Ûã3»³)“‚†4e±A5|hÁ%¯0ú—úxíöÕ!z›3@cÅ2ã gïõ@ãD»à àa¨™î+ tS¢(?cR¥Ô®žlRyùŽm&ÔÕ~ó ‹žÆŒ{êY™YLµ½7¦áq­pj´¤ÀïãC5j¤e‰VDŒ$+\æ¡cþp2ì 8䀸Ó0–lfŽ;F^W¯£F¬Õ×SŽ8èíÎæÁ;? YHî­ì[ÐÝKˆ‹.t×~Æ2lVóñÈF|†ˆ›7‘ºy#–ÖŽyp¾3‚7Z6Í­:ƒ÷Õ·÷ÑmŠ<μãL\!b²ÚÌêÉÚ‚ßL`ìg0ˆc ¨ekhˆÎùhøÈÓ÷ª¶³þ¼®EÅÙ«¾i´÷¢âþμ±d\‹C…Æ}̺Lo÷Ð&nxov\“Xê˜}«lƒ7F>ü‰C€­6l€UYg ˜G´ØÃ¶Êæe5{Œlú€Š‰¢·;Ô<¯œjæAÔÏxAŠ«t¥àoù"MȤ}ú©·9Âgˆ·òCN‚€²Aßsk ‚¨¿%"¦?8ºŒM(Ÿå”`Ì<û˜—•qÈñÁGñüÇŒ¾ùûU!IUÁÖJ“Wœºp¬n`’€—œEÛäçT· Sà.ÎHbÇT-äakÈw]•Š„@‹±;ºÙQ²,Do+>¶VˆWÃ"ëÏ*ƒ,Ýë–ÌìFÎuKÞ:¦2×䤄“›<³©BZ ?&dQNú[KqZÈÁg%á6tÿ5™¶}°~?§È$^T‘Uçð™2Ò{Ì0Ñbþ°MCÝ’3á2¡}VÛÍHZÆl¬$˜±£ŽÃâLù ôãb›0À}ºÉÖ†*Vwâ3ÏfÐ;n/õ¤ÊpUÃ&œ¦2Œ]´t"z`¾q±6Ìdè@ÙÝ HÛ¼DOics&Ï6Õ7rYPƒXŽ")M“«wã<¸¾ ¨‘ï ÖMn‚sÄ1‘·ÁÐ ƒñtñ¼>ã,™lÀVÕo|ºÊçB=ý{ÁŸO-˜Ý+ ‘S<ì†{/¼.ó¤GŽWo•1•ˆfX…梌;º9PÜc$±ºh&wæ.?'ågš|0-þù‡N¾Q¾—í÷­Ø5PPç×:§IcÌ0TÇ´ }Ù †lŠvãcŽ@lj M›ŒèÛfÔŸ^+ ¬iŠ&˜3nþ«CÏø±ËWüò"iMßå ¤‹]ê;W]æâÅ‘)A ¼¥ÉÜQp=’ ûÿ<”à×&–óLIOÅ$ ä%|¿^ž9uÑNžLDú€ï&a#,”È© #H™É¹©Ó‚Á!ÒÅ©˜É¸61Ÿ³˜s…Ì­´°´ ’øêÄœ ²ày¢.¢¡.€`ÞºvN;Å›Zàmé^‡™—,Ž¶Ô±™J´ê–ìõÔUCÁó4:æ²õÌÙAy€PGK•(¦}IêJÔÛw‡ÈôŸÈ³Òij„ÅóKA'—ÞZÓ>e¦Ü:´Ùp»;GÜø“É¢¢_*ç7°|Áüû\Ý.«YŸ° &ÙàôeUțԸ¿kP7Rãá¾­¤4ä{ 3¼Õä^wóŸÕ2«¡®“)÷ùÔê,%e™Ù”¸H-\­–iêÐÀâvy®^ zIŤ1xT6i´“Ýâ~_ר¶rïØ™ŽÙ¢¦(¶Ï¾M¨¼â40³M*g=-Ö¾™ZC¯ÏP k¸ Ž žÿü}•.Reè×*žMO6ìÎÕãå—oŠWÓdűȬÃ31]¦„) ÃçZ®™,š´=uGãâ3å[×E´™¸mÚV–2:÷C;©=uÙ]\³:ßÐs  ]]èØÏ\Yjžäm­wM ’ç4ž&S‹‘Î?Ñ¿ìhPX€{K[Å“Ò=~ H,½¶”Ľtµì¨·Ž®zN‹*E9MjÉÐ\RÂÛc*l±Ã‘EâíâÆ‰O+ÅŽ!G\ë Ô Á« ¦ L]ÉË*»šÀ>×NNlq’ÉJV]k„°ÄƤ1BhP®Ø§|—µ²Nª4¾#³¦~fÈMlòB7øœ0ûS-2ƒ?LskZ~^Z™­Øæ‚öl_è0ì«:™HûÆŽ…:›ÆªÑÝQf’ê²C¸õ©ŒÿÛC-°†Rãô‰´)½–ÐÖÖ¦i9-´çRQ´W‚‘f*õ­Æð;·#>?¯³ÂW’…`RO¼@öûCÂástË3‰#üïê#:NøQϤ2ÎXYI‰M"ècÓaÄÃ-`^IʽHFrÉÑfNg˜&ŽöH}_œ/ÎÛ24æ‘U¤áˆ¸D0[NÒ]’.sÿè™>@cÈØž˜|$Ìq[w£¡¬gN3ŸwG >ìD›÷ºñÜÄޞƺ‡3ùÕìx©æ45—£V<6<Ä@Âol*§ùBSCÛ/Ãz†¾¸«n™ÌÌ0ïâi2»X*µ‡ªØ¬~µîÂ]•}Ÿý© ùA/™ãí™[&•Fî"`]Îû„iª~õÕ_$—ÖÉ«hÁ=6Ó‰ ¶¤©RDõ4¹‚¼óg¡HêP‘3ä¦Û X;·z €Ü²šFvÇ Ê7XWŸ®>ýJŒæ†S=]k†.ÐÓißy$:v0ÌHb™¶åÔešjÀ,ÛhUˆdŽö0 íÖCƒ­T2><\7~_]?ïf”l3xD(ï6u¦‘$ ¯Ýú‚K~ÈöÎ3Z;ç9‘WN²XzÒd6u·æLÕšB­ýP  %~reIêwP1¸.b¦,Gâ®_’·þ` 2‡³9KŒ8—Ž Ê›ªAÒká”SÁ í7ï¹¹2÷~´„Fç´Íù8‚³xqªüÃNÒV’L¶¥ê£8ÒqED›ˆ®­ÓŽE%þ®|÷?Ð:E9,#aë#ø9àâ!áÁüµ+<1k±Pd:ê' "IQiDäNÛ0)æ¦ü§áXoåYÖBR&‹®LÏYÒo£—¤Bv˜ö©b®ku虌:…SdøO¬:dxEְ릖+(Gï¼ aÊk­½Ux/¬¦Tø,“94çLVj˜,éïdu-29WîöœÜ¼¾KiÅŽA11¨uàÑnk°i»-5ÐøžÒÏ×f mE"5KÇí²G+Ûâ Oëllžw9| 3ÅB”€¦í\ҸZ?„qDÐ:]•Q*MmÚM±´9žg£»Ë„"Û˜3Ì/'”ÒÖ8ê6c­“gºpDEo«¥ÇÊq5é¦<¹¢-Il;J„ù—.U5î™JRn¤vTmþÜæÕ´øæŒ8vÃÜÖ±h›l"“â­Ȩ^JãM¦¹sÄ£oM'sOxŠžÕxn´?Û&“@²ãÁ2†UÃåýµÛ©¢V_è] ó©ËÑkµá9¢þI%IØ[¢üÙE>úº.xi²\?C—¦ q×àr®ßó¡ÉÐÞßrÑ=QÚS}„8ŠPægKóñ7ÞeâKz¸FÄÞH–´ÊÅ€Äd®÷OçJµ¹Õ‹9ÆM| Ïucƒœ¼r: Ô›Wö åS=ZW#9Ç_¹휲RŒ_SnÂE¨€XP‘ AßÚ÷ûcÑœbë×…ˆo“íiµZ‡iszb¨qNgòŠo_ η¼ôb“L¯¾K¥‹â] iM õ~ø†€¦, M…”âZ1‰¢2ùCY Ó{TÁ¸JZÁk+¹ëÀ^‚Xã1wŒ[nËi„|£HÄ—‡óëöÒìäÿ zåÐG®ÅŸë«†%C¦#¤µòfÀ/ç&:éÑXq³,›úŽL‡áàœÃÏTÔÁ¼žýÈ›ÛÉšÀ¹G@´æ„øBçA;¬±z ö6×t̳öû™À¨†Ž_hoĉ0±Êqªîú@‘Ù;]ù;Âz'é¤xmÑó72!ò‰Oc=¾çž©€ºÎ3 ßm-Œ^žÒMË}¹jï°›aZ÷μõ ¬i¶^A©SãÕ Ej®qF¬sºšœEÙ–òçæ½ÝºdQg<â½\ýÒFmn‘Zç ­jv° »5¹É#òÁAOÀå:JG¶{ê:l¦‹ð)vÍ•CHÑ­›}ŸEÓlh³a–7 E’¼klš¦ÂÀ]w”c àB“…rÍQKHlDHóÂ’†$§ÙDç4À/H1ÁcT¢éý‡0µxÊÚò™jöö}U/¾Ø„®UšÞÕÜ aßÜŒ}ë’ÖŽ(f[mÝ2[dòñššdœ€lKûÜx‚ÒJ¶>h«ˆv {äêB'Žê+_* ›:1¤b3F ‹®®bÃݸãî—È[©ï}_É™`VÚÂä>PÒKAb↔ŠÃÍ•œX"£e.ŸT·ôL*-WrKªãrî®L€Äê]W`ïÔ–›s§=™Øz}â¼½ß-º7SœlW2ï•’Éb`ÒVƆ]ê¥gO†Iİd©Qà\Êžnôœç´=XícñÍ…ªZ|6®Ýý·I>Ë å$ ¡ ­WŽSc(`°`[8 gŽ{Ç¢–ˆ%×S‹ºÎ½¨‘k2 ”qQҦ½t ø¦é&W˜¼!kë°['Ò¢WÙEÎXšnï™vê¡{&ˆ÷Ò —Èú½{&"&>Úƒó‘o þI÷L8²È¶|Õ0s­'ܹmbЋ<í㜹i"RáÖOÉJ UÏËOÑð7Shˆvfö¾£‚ï‚ï•:tï©`ëN ¬Eí ÞÇÛüw¿»bHZ(È¡lè¨íuð¼½FN¯,ñ>:‹ëb‚̨÷ÿÀ¦2ð7OýGùßÿÀå©endstream endobj 554 0 obj 6311 endobj 558 0 obj <> stream xœÍ\Ys7Þgm~ÄTž¦·<ãæÑ=ÝIíCì(±·ìø’T­í[#ÙÞȺåë×/ØÍÖÈöÆÙJYša³y€ •ÓY½4³þ‹¿÷ÞlÝ|l\;{y¾UÏ^nn|<‹¿öÞÌníB—Î…¦e_÷f¶{°E/›ÙÊÎÚÎ/í¾Ùz2oªf¾¬ì¼Åß‹U×/û®ß­v~¿ró*×,ëºmæ?‡oÛÕÂy¾¯æ·«…Ÿ?€Ðí!ô\- t±ójÑâÐÕÔ ‡©Ì²ï;ß?Ûý,Ò½H߬–uÖ¹»kóaM}Õ@ÏE|²põreúž:Á4Ç¡×ë°ƒs˜c?üèio«Æ…½4~þ<ô8 =.¡û~åa£Þ­Â:Ü|õJVÊ#õýüMØlx:v€Önþ"´ö0AK“Y”ךWrDs,lg—µiBwÛfï‡Á£æ'0.h/üƒ™B ,Ä@ïºKkÂq_Ò„uXçE;¾â aÛ&-À‡Î î<õ„aÞVΦÅ;Ó ¤`Ý03("ˆdM#€Ømäâ +D­;«0@N¸ÆÕÍO(ê0{xìà G• ê3Ö„ÕX!ˆ FøXyÀ·q¥úY”¦³¤¼ýÔ5ìWáTÛ!,…» ;áa`ˆ3Xll¥Æ ·˜ Ÿ˜/Ü+N„Xd©,Œ[6mmI8,Ek(ZF÷d°ãðyPKÒ]Ø#Jþ¾ƒTQžoa– ô•„ßÃCX(¢ôDe5¿Ãv&ƒ¾ii<軆~>Lï?šÎ7Lä4~ìšù?á#asÁˆë¢s©Ã3G[TsÃ~€äçˆ;WÛeëv°Ä`E\#ØÃžq0ÃjeQ,›'àYÊÈÌÈ\zM:‚IÉ·3p† "æ:E¿âð‰A#hÁ¬Ï%‡E€kúŽ$ÁÞ¤C%¬<")ƒ¨  ó…>¾îÐ+ˆ&ÐÍ7èEVó{Êçd% o7LTù ÞÄ×ä £µíØï‚:Ü€‚S4R·êÑNN©Om@[é ª5šÁªÁa†ài,™KGŽÔE@3*àÀ~p*ÖV¾_$¤ÆxCpÎóÀˆcS§µõz\©a¢´¶ ´ÚÒ g'9¨÷ÊàH‹ï¡¹M¢¢ë4JDî9÷^ï ‚Nñ_j‡Ú—t A‚Ã¥¸Àš¡G© ¤aÀ‹ « + Ê Wò}¸ûA¸á€=‰ Há>A*Æ%¢ÔhÁ@Ás…ÝßÛÚýÇ“ùï•g˜xœÅ·8ËÓ3ŽìýY4v®Åýœ)`:r”? 2² xi…˜­ñhÐ\‹È‡LßH¬áˮϻÜX?¢¦`¤]æôà‚úÂ0¬CÀâ1ƒïu5ô ‘¦É·áP‹<Óˆ¥m±ãéÓð 3_™ôÏo%y+®Ëù†¡·‰Ôé·4ÆvBÈ{{wëÑÖé̹e‹Nµ›ÿ[/m7kºÚÃï3ݺ»uóîýÙÅÙåþÖÍßgfëæøqëáíðëmmß=šÎ¦òD…³)×¹ ì&Ä®¾¥„êÇ Ì‹UÛ¼D´ó$Þïä¼]­–ÝW،Ĵ&Ûƒ Šû62…Ú!@‡‘ð·”Ç·#1ŒuDw= Õ _“F˜Eª¦Çµå¡j v1.hØY“SÉfGè"ÝLêÃt}‡ˆjÛnÙþ‰ú0!±0MÀÕõÅO`‡“ë·À˜º¯°~ëkÀ‘Ú€E4%Š ÄÖ˜>#HLG0õî(Žå”’Y |~Ái §<1¨½c÷ˆ½÷*ô©¦‡&XGL׃ó–ÀªÖ5&Ž6e/–³.¡¦‘ýØb‚ã5ÆË¸¿n¥Ìè} f%†§H fBÞŠSqˆŒ¹ECJã`7Fä<VZ»´Ãxu’üB3â@UŒ),± /(ÛɺKbœ);ªXÔã,1ãAQö©Ø£¶¸æu5æ…J®#M«{É TÒ›øTFrâhœvð¦Æó«³(r¿t-‹üX¸Ú†ôòÃaÆb³E¼äY€‚“ o‹'Œdy ¿7ðꪥ²]¯SYåk£ðøk¹À’—NP,c‡žeã<@¼|_O3é¯ZTuGÅÆ£œŤl\׃<Ó¦±?‚Äpš4™–xDy+ 6ðwJß`¨MÈdØ‘À+ôF ‚y¢\†KR1òíà†-CM[gš¥ÖMVÀÂ܈0 ¿TXª…°ßöÓËû 4Š£ßA öb,Ì>ŒCbÄ"ï  ƒO„ HWŒá*¢I$!q‡ùsȾà48y#]Òã0Y:2D¡¼¶RÂ5f¥)ÝçœZÙâ Od–4LàØc4¼®TrjÓœýv핃¸ZGâQÉSj¬Þ‚À3áfÉe6‚ÈÊF…§½˜í˜F,*)¤Äâ°8Õ T1»ƒTUæòjY¢T:T?zÞ㢮ã*I£ÈLZÆÑ3r(ÖH¢SJeÊ–P›Ü•hì _>RAÈ&éÅò€ ÖÇ‘t¡9¹ùLsIO˜(:Üû(LL„Ð)ÿ7Y˜@ 6F%Ÿ”Bk¾¼}N?Âwܸ Ã|=Y$|4HU!Ãâ!e÷˜…s‰Ðᑟsüƒ±(L%ùO³å¢B.Uo<ö=áÂniÄ^a%¯˜Aýr·T‹ \î,-UëS.I ƒ’ª-(îŒòÅÒWêýSÅÖ5tï;(üc/ÑóÂ#«[±Ì|m¢g.Æ=’Ĭ˜ŸJ:å<ôÚ´%êBƒA;y..B…J3…“I°“°Ö/Ñ&…Aa=çAñ,‡ëŒEîâ¬Câ<¨ZÕTÚº²Ü÷~h×\‡Ow†!œâÃäþ˜~áÙ‰Sש8ÿDÙq©Ã]L6 É€£”§U ÓO 0ÈÄï‰ëD˜ XG™ØE§ Þ€¨à¤¶­­^»"·  < ½øRé:™'±ûÌI…ýFo1Ò—@¢Ì^„·„…þ” S>éØÁ•j.Â1¾«‹‰‡õ¥£UkÛ”g|o~•;¥ „⟺E†»õ* oy1pT"ÜË& F›ÎkƒjTúذäôA4¹©Œ;¬Ù4¯% ¤²Dwp,]ËÙ#˜‡Ü#òþjã\}ÊÈ"SÐt¹ì³‹ÑÁn 5ã’Sªe×8]ãRÉÊ.Ó¹ šÊ^òYé+£,¸ÛòŽ*÷çg«Êãªó ë¾Ûð§¸õX¯YŒï=¨Â.*¿¬2ôÈR¢Šá¸%Nù_Íü¤;ÐI> W,Epu$_"‹qv¹è´L—y RQ_iöŒ0Ú5å'V…„0VN7VÅâqYÔüNsUv3Þ·¾ 4;«oPFeG1ìæcgz]–_X`P-ÞÄî“gyjØ#],œ*l@ BÞ…;BÍa] oÖ­æ¿Àw¸[0¿?¶ƒü-Ý<„ä(DÏð’NÊ•pD+Âüî'¥:MÏŸÈó©ñ¼š?J÷¤çvjü­Ô¨zÞˆ‹§û²cÈ]w¤ëíÔøƒ4ÞKÛÒøŒ‹·âCÜZöpé}áàæ^përÒ3:ï,*MmÉ:ÇÂ7M ôà2ožèbÚŒPBÕÒÒQ¡¯áXreÐ9*ƒî §ºVÚ£`b_¿ sÖhóŸÓóËó»©ña¦‚ê’=ÞêH1"=ß+Í/ÊEY·åùƒÔx_¦ÆÇ%Xì”´Ž¡«/Pñ@ï—öçôÁ°Õû;l=ä©bëY8Ž€ä¨ "ñÿ{™HyTY@$ ýøp6ò"(ÁHA¸£Ê >‘~œåþŽ6öV_k|ÄO¥wÖpáÉ€x°¸U¯_e¯ó:Jð8KçÒx!ð8,Áçâê…ž‰'z:×+Õú‰‹ÊPÁ;ÉþjaôV×Ã[  Lce\€Óvq0õ1¤,‰Æ,}â‘Éq\å›Ùœ£ ¹Hžâ1ü:=yÃá9Š1bŒ–c݇@É[ék™_f¬d“ž×ò¼N7¤qª'º n•…ÖLq5æÙñÙ©<»,yÇ3½ ܺEhž‹;4Ù õb#ŠN2±òÇ÷ä1šFjðûÙ¤ÙTs¬ëFZ Æö34åŽgÊ ’–18¢…0,a°}E`AÀGQ’ó‘#ˆû˜žJ›ÒÑ‘Dò¢\ß–EØ“Š9%Áã’ò‹º>Ò0”æã8ÊY\äOéù]y.»#¼HFÊÒ ôQÙQ>¥Ùä%è„<I zH5Ÿ"²—ëôNêú€YI Šc=¡a'þ`¾!f¶—-},þý’úÔ&…:\”t¦Û÷âÖ% ‡¿,­éBFŠr¨…X¾+E¸×¥ý¾’­Éós‰09úƒ=ÏP^Ô5º ßz ®÷+猪0f±neá¢PNbïÄ´^.»•ÿ "^.<¨b- äâ)Ïßø§pêîMv c˜®í¤±‡åŠ6?؈ՊáE—ŸaÀ"qÄ©ä*ãé9ƒºmÿµQÌ«–ÙSòw)'“à™DTÊÉ$U²µƒ¿âK ¼Ôx*ЬM4ìË „u¶qf¡ÂÛYiÎs½‘±Ëð‹.ŽÍâ¥ØMîýÅFÉXœˆ.äWÙê5•°5_á½½¢aã«é=TrÒö¼*DŠõ_¡ÄÍÔ†cRQKK= <ËÊßq¸À¢0·~àÆO¿Æ²I.jÌÜ‹ùª¶ê!Oœ@’æg¼“-7D‘/µZþIö|zd—¥Æ<Ÿ‹Xÿ?²d>.“+òS&­Ñ\6eE2ÆKÃ#åuÙÙè×ÃÊcÛ:›KilˆÄdþ·‰v¤)Ÿ›hlËÊ®_ ølO®G¥ýGÃEý“ÒÛÂÚ~e¥?)ý¼$%‘çe k¡ê/FÞ×x,ŽÔ_ÌŸ$«Éé"¤ _Y4w2ÑÈRÀŸãÿbäÞ_±ªÇB»¾¼F!û3Mã¯6U9ên⓵“øü=-è³Ë¥bÃa´Ñ’œy Þ?,¾>4bè/ò¢ï%ÊŸ&ÙE¼,5>Ï«¸½œ(Ë/êµHÛ„ŒK¹YíNùßÑè§^bí.fÉlù¾hU41Ê&àÕí€ñÁK¯KP²m¢v~“±ÜM€x™NIóhë¿·éendstream endobj 559 0 obj 4579 endobj 563 0 obj <> stream xœí\YoIÞgïüˆÖ¾l7¢‹ªÌ¬‹Ñhƃ½ à†‘F,ë6¶µ>À~ýFDY•e·›CBˆvw^Ç—‘Yùn”gÅ(ÇîïÖÁÊ­§…®F;'+ùhgåÝJAÕ#÷gë`tw†MLEY›·ÅhöfÅv.FµUÉ 5š¬ü9.'å8Ÿ”Íþ]u©«L5Ðk6‡–«“©¯OЬmÓŽïLÔøñdªÆ3,_›L}ÅÓÉTë"ËóšÏ&Óºn NïN uÛœL+¨Wj¼ÁÝV±›ÎÚ¦¶Oúu¢°¦©°‘{ v”}~‡>JgyQÚF&ÔFi«¶E¢’ƒÄ¨ F, hœk B—ôøU˜ j­` Í5Ž®Ü×?Zò¼T‘á Ãé1@Z ýêZYQꢕ¢œ¥Î@gSguѶV¤ðÜñGüxƒ{H: ^Œ÷ñç6~dQíø?þÄ­ÐøÒPoñã8ô=q¦*¡¥ÕŒíò3PK:ªÆïBá'(T9HÁŒ‹P˜sNYªð/蔣zÍxŠƒæ¤iôŒ›¾…‡\x ÷¸ðS(ä>§\½'Y÷…0¦ij,&éÙúm®Ÿ*Ügêaê_޹ÅSþúÐ~5€Í jYë&ËŸÓˆÿõˆ; Oø« æåxhaÌBo9E‹¨ ß"Ö†I™*m²ð/«\Y’PzÈ£x, Žt “ô,ÆTÙÇk¡¡Ý¸µêžqÝÝP8‹äè ïpáªlé¾mpõóP¸Æ…¯Bá=.ÜH ´ÎÕk¡ðij bS‡fd¸ ÍÆ€Ðõú~}QÛ.z+4 8“Ø8åqw“#ÌÃWÂC‘ÅCÙ6_ÅÞ¬‡.›LçÏŒ¬žr*4Í"´»B°2ÀʧY‘œ$éñS¿GS×>NAr-5Ц›Œð 4®Á‡”êÝuìãÙvÔØQ»=¨ Î­Á1àÚ”78;±åˆ´¯Às›„5èÙß¹ÈLëVÊ`ïG˜ô þBFdPw^Í7¼š‹„5u’ö|žkD;2IQÈıÏT™<ãR©´Ÿ ‚”›.*²ƒlÃÿT°Kv¦²•¯¡||>þ߃ÿ‡‘ìPP¢Fí5:Ç0¡ñ¡Œî1(.¨CÕæö™øð3Fô¾Ñ=ІÖä°Bå‘%yø€ 1°Gha âß]*±ñÔ{ <9ÞKßÚ2?' *˜:ëÐ ¤™ñÿ&ZQXœ0ªEÚ*–é<ÄJ„»a¢p’±:}•e;EªñMŒÒl$ùSˆ OC§+ÌJÖf+OVÞ ¢¬(ð…°­™ZYÓŒÊ,”i0”¾»±rkãáèôøl{åÖ£båÖ:~Ü}¼ 6îþ¶²¶1zrÙ ÛÔ0¾Áç ¦@{+ðäpå¢TOû¬2Qæ`Ì`¢Ì묉™p@¡(ZÏ L(i‡Œ.q´C&L<9O º)˜;oñwÿŽG >àÀ»e›)9l?)Ñ:*²ótjTMs£ÿØréfÈ¡QŒ¨¸¡ÌOÜ-KzQ×ÿ±Ð¡)í4˜ã™¬q³k£ F‘…Ñ4y‹‚è’sÛ²=ýnK#lY¿Ã—Uáç#Òð&죥7=àåÀà½)TãŸå5¹CÇZvün[qaœû~Rârß0SBg‘0;4×ÑQÈsŒ§€Ø¡,"´ 3ŠáQ‹êÕĤáDzó¨tƒkcÃH.>T&íVX›Æ1 „ õ2àÊ3o\ ‘¾’”Þ ”E*<ô‹Ñh`kSíò]ׄM§Ïª óþÌŽIC£Ñ!:\Ø-"Ô*rŒ 2&f¨KOZ¬ñ„#%ŒCaY(«ŽÛ“=U+\ÏÇa"-ƒÝZȇ´GϯÂ:h;Ô¾òË'^9ÙÆË'ÝY#öƒv^ºŠ…ÃÇhÜÞV„Wè 0¯<‰÷ä¤F…ä’›7©ÅÎ>ޓ׆F‡¥Æ÷ýöoS$‡Â›´ì •ï¥8²Žž¾>"w" V”¸öqPû‘”XXßÄe±.¥‘ ¥i‘ÓÄŽXš§—üg½nض»fstÇfèšÐwzD{c®vjÉÆÉí¯¨$vŒ¢–Ée£)ÑÑ,.‡¡~žBïA¤y¿ù·ŸÂ´Ã»e7R„JŽ ‚hA /R¨ ÙOç³m¿60-7ñVÒ5÷Ûh2Þˆýº½Š6nßâu…b'2lÞ,ÀÚ›Ås`ý¹˜~“š-ÿë„Îk±UÓã ß˾]Üïσ¦þÚ@[¢¼*ÐR˜Jn‰³¾æäIhÉÓ´¤Ío-égÃî"Sz5ÞûXû&ö­X²yJÛCï\\!kóûØÕxÿ>fÌ5[°yÔ#Hȵ;í|ß¾èD@4ä …fS¾°°k÷…a†%u7ÙWš·‚Þ“¼•aoûc(t)–gQ`ÐêóTgBÇÛ)EÅhIMYŒµ£·<±‘©Ê/adŽRÃ/Î{ÃqÌâ#ÏêÊãã«ÄãDÀR¤ý”)!÷ÖøUÏ?éöDpv–ö–¾ÌöBréw’‚ÇG)¾>‹‡ƒè±/‘eK£¦vF¼/]xb¹ ÒÿnPî‰_î6þe¨·#¼ãw¬¤˜E¼ÃSi§ãŽŽ#_Ý_•¿–=ÅÌôKõS©/^é¿’.²)¹qÄZŠH"²êÇ!‘wñ›EI:.µë#LÄ1éÛ¬ØCÞ“x—Ákwd E§­•À°ÿ*ޝuΖèZá‹Ç¥83B!…Ñ;1Ö¸vš|ß;U»¡^h-⺋ òAçz#Å1‹!B`«êB‚Çw"(ä:«ÕÂæä$Ôy%ùkw%óïÒh.ÓÄ*íö¹?ÎvÞ¶‡ヌ†ú-Å<âvé-èã”úbWÚ«ž§|Ä%,"štŸÛÞå¯ÃŒºn²Bu_ñ^§… ¯c‚´Ýi6îæ!—\ ûë¨+í)^êØùïë…8î©ËsO €çÀ5é >vìÉmœ¾{ŠÂçs_ã퇵֗ Ÿ‡9öíeÒÈÞLEƒ_5>.æFÄ–gS"Arô¬c P¼ÅÉòž˜LÆŽ<ÍÞ¦%æÞNjϘ.(þÔêe‡cÜÅ=èY &—r›‰°ó$ùµ¿Ã‡ÝvÜñ:<5:ûÕù^DMÂuí$BçøˆéÔtrªê¬ùW02;“¾‘ùqVàªÖˆ‡ßJ‰å@>³¿ HP×Y~……ý7ñvVl9Ρ•ùÕÅc©ÅØc øœ>ÌÇ®âß 'µ+öýøœx?´‹ÅE$ÈÝJuJJã›{±ÒOÂc¶…Ë2b1`Ïᾟ¸S¸á0°=ø:Õn@Û%›s0ѹ=ä/‰¹c²x¸ÅfêftäÓxàØ.V6!G9vMt"\SZ\Éi ˜&Ãç†Ñ_k`ï‚íbFLć0äKä£Èé]¦?7ŽE|€É°Ix€%xÕÝT0LuaŒA±/Ÿl˜ìµŠÈ.Ù”Þ§ÇëG0ÞC0~’§ÛžŠ´ dÅš#üdJ颵2Z2Sð€¬Ë¬ú(½)d›Ô Ù€Çlc Q*äE9pª©[ÜZ>Km±EWOÙdÚ”ñµÆ„ƒ}F+Úˆ4†à¢¤ª? i<ƒÁ”NIƵŸ¤S× 'Á\h €–óo³ðY)˜0Wc'™”x ¥0v‡N·¹%òïØQ‘I'þN ²wÒS¦l¡Ü¦}‘$èÒ`T/­G—MpV!ÅJñygÁ±ïflã¤v ¢Ÿø‚Ž]5dÜ£»I¼g,ÌMïiëñ`j­}octœ†säÈmu' VSCÙ½Ø_5`^‚_ÍœU÷ÅS¿­šõ²Î(F+ª F.³ty¯NÄu¯‹¢¨ Ê›(öÀþØîrQPÒ‹ˆ¼Äã.8êN>|’1é ¥0*•päÙ|‡žù¬#›ñ„¤F9YŸ¤D!‰¿®pÙIß‘®\|ÝïÐÍÀBy6V”·Q&I_¾„!6Ã\âëhîNü]73dÐ~åoðžxf^ÉËnDKòŠÏÝ6ÃYÓ-À}y®–œ5ÝR¦1<'$ß öŽhslÝß¼#<âpXerë×—ÍB …dýÅ?dhæµéÚ¾ arxMLŠ]¬óÊ^Yd+Ó\Q‚û:`õHîryáLEQ<O9z͉K¤¶Ša·žWõ.^e0A%½*¨iŠÿmS%)Š7Æ*ÃìÔ`F¿;6è6%ÿ„wrº÷uÄy𘣠/¡ý]ª¾øJ E÷r6ã|–.`2¯Ò [W¨ò8çZ$º%eiºKJîÙªJª;>µ;Zì üm˜‡ÏÔ†{=0ԾȎº¦¢¥ÊfL[‡¬³ºl‡º4®¿5-ZÒ‹ô×^%:ËŸq~.Ýo’´µ*4÷°TÐæ®þ!f´úÅ+Ød*/É¡(Ð ¥»sg³¥£kHêœ`‹ ~殩C 4EM•ÝÉ QH”¥}`7þÄ%*eChsNW×66ÆžUMâŠB27¸ˆFÅ["&¥Ý™Þ&‰»E@WøN wé±—{Ê2f1ŽÑBäZÚK)†¡i7ÕÈ¢:Ü¥®_©Œ›=þŠ÷ö <›ëÍjŽvHP–ó;MAZçP¬)í©á £¥¦ï[?;¿{Û%¶“ Sâ603ÝÖQÖ¿(á'¹ëæ.ÖEÂÂ;–Á½¯aïQÉâ¢{ºÌ%Ó+;½0E( äă· ñexÉý+Êñ~ÜÁøq?Ðê“7ÉuM—ªœvÛè¢-º¢M\εöÏñ®Al‡¹7¹—m&Ž‹½…\øXnáûB¾½ò›Ýà>st•ÝŸ™àBqÝu^Jv¿r{n”+eéãÄÅ…xG\ð.åÛvžÅìûÒG½Á°›(]ã¯ÜÍNiK`<¥x³(B3%„Ç=Ì"ÿˆô%!FUt‹œäöÔ€ Oªºqûؾð˜ñpKùBüPö÷…¼Ë O؆PÁ3>X™Ý"x‚ÏãYøÌ g’“½ñ⤎è:MûNžÿä³µâ(O8cªä««¹´.‰·Nü ñÖe?z0ÐçîŽ3¡Ñí”'w¼mÈzá´?éîIƒÁ#új¾›p-5¹™½ä˜%ô„x Å)ÚY(÷ìÝ …«):™øå0lïj1çÄ™›!S*Y/Íņ$&Mð#ÄáÛÆw u ÙKq˜2òîÅx{–@Þj˜ž¿Gšÿæüžv¾)4?W¢¬ÄßR^qñ0b®c¼ì¿H£¸´7yéo~naRÒÜyäƒÆZø«;glŠiŞÙÜÆxÛõcž¯šÈ“:c*ëûo§“yüîÜf>}$ Ýú<ŠöçÝ[ëã'^‹_˜øó¯I_Ãëí«±ûù¾kî,êÅ<…ª'+ÿì¼Ð,endstream endobj 564 0 obj 4627 endobj 568 0 obj <> stream xœí[mo·þ.äGè›wÝz—ä¾Õ臸MIœÊ*PÔ1‚ót ÝÉ:ɪüëËr8Ã]îIv·0 CÒ_‡3ÏÌ<œ]¿Û/‹j¿„þïâbïéa¥›ýÕv¯Ü_í½Û«°{ßÿY\ì??‚!¶ME_öÕþÑÉž›\í·j¿éLQ©ý£‹½×Y×Y‘«¬Á¿³¶ë‹¾k²ùLe?ç:û.×uQ–Mý`¿}ŸÏ´Ñö{›ý%Ÿ™ì%ü‚a¿ÂøÃ|VÁ•½Êg þ²C«²sËáà_òªèûÎôoŽþBšJ iê¶(;+çÑÒËVå5Œœùž™.‹¶ê{7à+øÆ.mZ»¦Î¶°Ë¥±ÏŽs“-ìÏ™1·ËœÛ.íŽ_¡ëÚŠ}† ÔÙÚv·%~…EŒ)ʪήòY+½ƒƒÝðq`\è\ÂÒ-Nx›«ÆîQ«ìVA‰üqq›+,QÁæ°X×f·¹êÜ̯:SMi{¬¾NA“°ÍÚoc·[à ØÞtØnu«ƒ|çöÆÌ¨Î B\ä PÕö¤æKØ"¬‰JrÓë÷€¥/ìWèõÊ\å8v1 ίín­:¬),è_„O0×+U…-Õàùu‡(s¶Sh¿º²J»Ñæ§a2ͰÇ\ú þ†G×Ú8üöí}Oд3 ™¾±º™Uº¨›R9¡v6^Þ€œ5ÙÆÊ®»–làl’_C{…ØÚL÷%¢רå­f5áUwÏ‹[â0¶`Ðÿe8ˆ4 ÙnlFÝ‚´V5´Â sĪ{û—¸ÿ´ÅñÜ}‡£ÈPâÃ)2QÊ9"P—U¡HÜH_è;·ÒÂö°×ljïÃX-:m_Ñ IК jȰöôSHÅX q¯p7¿ÞŒúOþ¤©ºïÜ…1õ„ ª`µÊ ¸ ~Ä`qZuXÓÙ3Úrx¶ oRñX—psnœþ6Q„aßt¦ÐäŸÒÖùÐ ˜Q°«â6ä¬8îœoá{ð°€ؤ콛a³.ÒÁ8œélaUQ¶ Ÿ,1¥¤ðCI‚ àˆ}§'ââÈÀxÖÌ5DÆV +¢Þ÷óïBÌrÁËé$Ž_pß(tG˜XÒÓ|µh—F9#ñ(#iÝ„ô þ¡k|?Q€Eþ ê3Y#!&’p\ŽQõ…ý§½£o_;ðˆ¨Å®@Üäºs)S˜ °¾QœS(œGs?*ÓŽ’2îÝCæÛû>¯5ˆÃx9÷ŽÑçNNÿÞ‡5ª¬ ìÓI9Hºò–è^Ó î«ó’¶PT-逻6); ж&¯2FdÜtÿäLýôPW½$6ÿÖEç¸^ã„>kÃÚ€Óºêq„À™oD®åµû{èÀà "º¶…ïpƒ/¢ÞÐR¸Šûõ[ÆŠaËqãuhÜNŒôŸÎ¹Ûîaj`—Ù·©%סñ$²J`¡ñ*4XØ ø‰"r>¥F±w„’eÜðÈ›”8'BŸ˜Ü«ºP†0Çb\ñ”ا…@3ЀMÝõ µn£ðÑXÇŸZ½¨ƒi0ö·œ›Ÿ….S;±!xM™ú‘À· [HµêÀ0’›“ BrŒ³”A¶»GÌíÌðE@Ñg F"^,w<1(k È{§@Yvª?(G—datŸçŽÃÅS–‹Í‹ÜD|-•@ÂÕE¤ºKõé2ÁUE%Ù˜8†{C!•6 .8–àá¹QÈá¯.–âÆá¯"ÑÊǹà¯Ä~|2$þ×wv†ÂZ‚Iß_¯‘{Ú/uö¼ŸAb®+¯.dwîÉØ ìt)¨%¥Ìo8ñ®Ýȵ©Š4@ÜŠy*ª–*2þy Åä1ÂRÜ6ÓÄJãñ"`ê•+·,¡RhMT<È熩’éZß¡Ýï`’åo<ÁÔU9¸M _øþ|:`¥…µ—j#òibn„ÒÂ=Æ—ìvh¸äUñ××V­|]ñÇ5ðT…5“¸lx~ *<Û30:‚ 7É;\£|í¹I¡~pã±—®Öaþ:º,{%Å—å­ µúÿ'ø`Å…u¨¹Jäµ mR_GBW –OÄ ‡]so”w¬TM%&¼ãB‰Ý§C}Úü-L®\¢xl3 âá@ªBU¼ï€ø—ö«Í&~)’]U…Á bº²úc–!üXŽ¿µZæåc&1>;7Þ$ˆ6›ç£ø„õ ÆH>ñ%æÚ^Ô%±«•cŒán?Ox9™’{3ŒÀ0K©$I!ÿ2®òðÄóác丗®BUõy*;Ò‹¯ClÆÌ-xÌ„=ÐÏBŽZºä„$”$3ÑÊ`½ÌW׸†êÂ{WÒ*n²À ·ª*¢J‡RªNáQÔ Pîsyš*LTÑ%-Áq[™>Týµ*µáì1o€hGÁÉØK\²=]û›ÎÕ'çQ ¿ƒƒ˜U8M_†Ô5Qµ¶™½¯*$œÝ=NLkPù»kº6,dO¬¤êLÓs œ9L×Ç`Ø€½(›¡‹ÛM'žÖh.Ïqb9Jµ¡~k¤ ñíûÊEnG¹¦¾Á²zKÕ/ÃüJ00O€ˆ?Æ'TÁ%£9ïR>‹ DW·Cæ„`EùÕpòñæ!ÏH0XÜûŒ$ZÆ"‡S÷Ù€ b{Hò® tØdxW‚M(…ëͱcÓa”ù‹¬4.&ï(Ïá61w:‚[•ø0VT@)õ¶»85:Ö¨—(I(¢^âAüįýÀÚÔT–÷ŸŠü^Ë$‹9îÓEŠ#\I×L¤{ÎÝo¸ñ 5‚)Œ m ñ™Í¾Ux5176V«£Ûmh<÷¿\mý“Y‘ë°h\J=µ3Oéþ<æ8P.éÚXQc~'J3W©=·RgcÛ°ò×øP2!Ò*%ÇÕn{ŸJÓR¹LTãS5¶EdpúNâ°_Kí ^¸äº§/gÙxÖ„p:ZÖèÎEX7.ÎÂ\v¦N’e웿, >²¥¨ãžÚ~|$ñÕ °Šp˓ޒ×~tЯªJ¤Bî ºHZê|÷VDZÖÿÿ²˜$öù*ñèâ4ZF@ ¯þc9½õÉÌ„ãbîp° H+ ']ðkpi¼åák†bLE/ôQ¨ç‘?¥ÂË$<^¦\‰ÍÇ9ï>§J†ï+iÔaÈbæ<…Þé:Ú‰ƒ:%2Å ûÉ}‚Γ½b$üaÔ ¬‰~¸¬,Â:$Zª ²š×>(¸s¹BHXÕ©Æ®ÅjZD¢KygRõþÓ2ÂÓ𠢿2Çe Ö´x¯tÃJVÊ(@÷Œ|Oùlwª¯de’¬LY‘úÿE;* ÇÚËÓeäÞôÑ×Ôê:*•Œc Ë[8lø8tHl„ŽÑQw ó5HÔö¨XîÞoÎvãÆ»TFTO9 ‘Ç<—ó)`Ô@ä3úxÇXH¿ ÈWkrqtÒ3jaê­OÈ"—:Û…’³_Ýj·ÚO^åØ[ÖçEJuIêµesÝä 7$–]7IÖ·ð-.ø&_‘ÀXÈ‘cHF!ˆ2Ç25rJÎÄ-VEî,¸+Ìú¢ÕœìéÚ6~0EQºár:;áî—ªÔôŸ!ÿ'Ìqã2ÖîÔ{ÅcW+vϹŽüèû£½Øÿ]®‰Gendstream endobj 569 0 obj 3211 endobj 573 0 obj <> stream xœí[YoÇÎ3!ä7ì[v íhúš#@,lj8Nl3HÛH(R$ó²IêȯO]ÕÕ3³¦”A`˜Úíéîé®úê«£{¿Ût­Ûtø_þ÷øòàÉ.ô›³ÛƒnsvðݣǛüÏñåæé!v‰šÚ©›Üæðô€»Íà7ý[ç7‡—_mS“¶¾Ißþ ‡Œ¡2ô­aÔá ôü¨ÙÅí'k§iŒÓöÃÆoÛìüöÛ?nvòà‹f‚k»n ÉÛf7 #< Û§M¤a_6»ž{¿}V†}„ÃB;¿éÇ'cò[p óãCÛ¹Ä>k¨#Ì2õÓ„‹ò¸\ŒïaFç s`!Ñ[à›‹=v ÁÃ<ºœ=Œ8¹<ÿ¬¥ë’w´ŒÜ¨o¤×ÀҌϢ n²¢ÜÂZ¿ÙÅíKfÛSè;ÚÃ~?Ç?/ ÑM$´—øý ÿÜàŸ{Ü,Àaoê:Å'ÔñBFwL©‘»ßÊ{l#Ì›HW=½œ᱈þB_”Æ6—Ækm¼ÔO7åñ÷kÝÚÅIã m<YQ2§Úx½6çei<²ò‘ÆÇ(‘°U¶y¾öΫ,%¯ÃÈÎm_—ÖZNø1l.ŠðŸ7ˆ…RÛN̨ìîä)¤Mi¹Ó½*ýÿÔÂe |Ÿ5HŒü‡¾¢Ø¦WÀº®¶¶yÁZyÏ}µù¥>kâ~Ab§ï ! ×…E6¼PØùÚ ¢ïZ CË1Q#6›žwÅn×–¼Šà‹òñ­l9Í,@>Þ8¼´‚&8ÄÐ*§ÞÎÀ@Ï }ç¹Ëû“B7–>„´‰í™GÑíu‘É¿%E«f{¶f–m-§ EÝù¡unšXR=nóë¡ÿF3+"¡½-Kú‰òçU¦äŠÂ©— Ù’j¾Òή¬¼ÓÆníñOד³œèqiô¦'b;¹á¡÷xê8D÷Ðk¾ÑŽ ”it“4~ºfŽ{ô¸6†ìÂ+EÞÕÚ‡ÙN~¦ìC5‹—™þ˜·GÖÔÕOa#EÂ]ÂÔ0â“:÷>ñøÿ@/z°Ûͯ¼Yc¨ ±Ø¸Î`ÇküXÄlXçªx¹k+çwµëË5-ÛAâ/*Ã5ü,¬Wñ¬CÖ+°\ èð>=8üà«¥}½ÅG¯+x,¢•óbû—–á³TžW/Y òýoŠ Æ þFPH«•óöí¢‘ÎT@ÈzfoÆz¾í²ÞXÐ…¹Ÿ(Qk²Fz%tÎQЪ /ÊL÷V[K`<,ù¥¸W­V%ï íçÏÊóCmü²Š8ÿ5žqø¿gü_óŒf€ÁÅ_ßÁs~©üy™Õ'žóhiqÌlk¯*;ऊQ".wi[Æ$Š¥#ÿg$KÛ3‰rQÏ›µ·¯æ&Wk¦{±¦ü·%7YO#.‹C­éhÅ·Þ–¾·šgL~%íDnš'رN;îI*ÕúmâŽWStʈÃ<ðf/³ÿâ¾W]ÒË5‘—ÄðrÅr+ Û{O¥åÄÛI7˜×&°æÃ}›œ ò¤s`,=Ö©v±ucJÄÐfóT¤êÚ>Œ®§‚Sm? }zx€v]»ã€Gàó® ã´}ŠK¦!"âðµó¹kÀÇGrp-ñ×[=´~Jà5À§ \û=ç×8Xòïcô„Û—Òö lŒ¬ùš6œÆÈ¦Äcî°²½ y98úª<~Cï&Õvà]¤VX—Á3{ÍQ¹îËu/ lyQ“'cƒÍáz®+Ðq×Ððí:&$Ú cæVjƒ™ÄMÈeã@¤ïØ÷¢#¦ªßH_ivÔÇÔQ ü×IðݰµìØñ(|ÃÚp6탯ezL,ºI¾ÇŽ=Å1 Ä&ÐmÛ8#³íRÅh±ÿ)n Ã5÷õ;pn,Zz‘›¼êÔ%„XJ§8$öe#EØ\°´•P„2XÉä&F5t“H9:~ÝÓFº‹ÂZªæ‰2Þ"X`kÎL1´©y]#Ѐç¸1Š¥E2I”ϲ\±3â' ñ dzf˜¼°ü\Ý‚A:i¬z¸ÐjöuÄI`P žÑûXðØx[êΨË{ݶy`>Î!!íqZ^®ªRGr¼ð;I’rÇO`¼XNP/VŒòõc‚Uª¯pšñô¡`¹FæõkT–Å«±Òxó¬¹,Þ(‚ =ê/©~"§¥ÆŽp1´9¶»ñ¨ÔB[ž jK9˜á]Ö•RÚèu~ ‰c6‰½ÌQ†eCMn—Â2;Œ3þœ7€ÆC Û¿pðÉ>ÁÓê±/C_fb¼j<îÇg&ŒLK?ÁƒÄñ±€ *¢.ˆ?Ô‹¡'ñݪ‹ìkÌ9 %+"‰ö9˵¡ÆKU;„ÍkAìÛÖÕý€kd·Ð“Q%ëÑέš²Óf¤Rôg€YâmFf@@ðó"c —„#,FKÞsMa¸í,Pú_$–?åšD…%Š¢\TN—3!¡.™ï8ë×@†C!GM×Å0îg> {ãÉI—<¤¿{f LG:X2ÊØ‰a0¤^5)0ÌHˆ`tZ6Κ$ž?RžÐ—0ÂLZ¿-»•ØÅ\cŽ“ú @Ÿa«µ93ÏHß‚OÀÂÂÔÝf¦ç€¹~H]cŸ7›¢­`ðBeFÞ¬kÂj©r;*ÃØ{EU@’³½8û<’0f(ÅÄSðÄŽr£ˆ'’6P¹]òp´ÀYËŒ­‚}JHµçÙ×—óÔ³à’X4Ä;Q±'ßJ{J»YºT –ªØ\f›YxHÄxuœ;€n4Å?Œ,%Ã3IñL…‚Lp<#ÛÀ¶Q){Íè'JñJç⇨˜#)Ø#~„ã prýz+oE塺LÐÚaîÔN$LÉNè’kÜ¢ *Jø¡7E‘KÝÂ÷QݵeÿAI€ »J®ÆÁ´‡%ÇÃ;ÑÏá*H“¹Ø4s+u®<£æä˜ â±¼Orïi†-ŸO0føOÔ>3Ü¥ÑËÍ—ÖBí«¢s¥tIJ³Ë¯‚Ÿ#½:toQ÷ãþ€ß ʈçó˜jåÕ¢ÈFEu¹êÌ‚ŸEç7pV„¦[âßC¤-A=*8´ÍØÍ*XœJ9ˆü`¤µÖËÌö;̹̳ªü-A%â £JNK=éUª·q?ö½Ö=îífˆDü|MjUMiY«‹ÌMqMü±õãÃϾÛ`MnªÂ q½§„ÉX~ñîëÓgOžýzs÷ýý‹ƒ'¿ß¸ƒ'ŸàŸ§¿ýþyöóÍ>~¶ùü}oÅB´ /wE¾kWªŸÒÕ¡àÍSˆËs½Š.é ¬Õ¹ùí›ýLóïØ`¥wÛ£—h@“Ô ”fµ´Ÿáa†#—Ë`C¤?|)e2Ï=PïfM5"X1~ÇY2,ùL€ò°g|R¹¬ŠŒaè8äÕJFš‹~bŽŸ±0.È•Ã$eÏ\¸¨Æîx‰¾«—xM«›9†kÜì„w£qÚâ+–䪑µ qþ}Yigx „+S?9åî†ïô솥X*DlŽrò|+iBœŸhéVÓVeIÅó}uÁi-Wâ~èù³†o‘ÃG®“ûø{.”Ͻ» FÒµº¶Y]ؘ åÚ%®í(VBU¡ÊöÚ‰×a;ÈÌÒ:?‘Ëðš5)_£ °v±6|Åç¡Â?÷ÊKfãtZRäØÚìjáÌ!]döÉ«Ýñ“ƒÜ†0a³X?MîË=%Ä úC” 0éÃNd.¹^^tåRû{ðˆÏÑ@×=´¡ XÒ ƒÐiœ𣓓 A@ %~$îû$¯ßUEzvÏتž&ÍR€ª>QÕ¢^Q…,çFv"5á?ê§äˆŸ.Úšk¦’SEYçDÐâ©8Y¥¥Ì8E_>SÞUMAû„O¬8åK ±8 6¡()ic?`2ÔSqg¯V÷˜€¾Tø°5ip~Ðå`\2g,<¨!B‘¦Û[È_&°˜¨æ{¢OÇÚ[Ëdy6¾³ÔáÅù‘¤òO±ÒeW5pŒª5ÿžÌ©N6~I^C–•û Â2î6G¤;ÙDÍ@U¡Ì•ã9Ž«SýsDׯ†ãGrd°À†(±ãê×ìè´1ªŠú ;ûÈ#º‘”:òÃ"êº*çHüyú¡W=pön Ù×ek¥|Ÿs&qTLCtÕ,ëÆ­àÙP;ñŸ =X,-?O«}ŸAãÉ>ÌéƒL:¼‰ÒR¾. Í7ëd>ÙUºåŇö(Ü4pâàɽŠu—3p{5ñàÌ™ €A®÷¯j¾>Ög€¡;SS¯Î?¬#iùDfvÝ¢:£ å<œï@˜ŸÕT ƱÝõª@5¸yÁ†ÃË~_MÞ†à¸Ñq°!¸=é) 3O3»r‘×±éS'å+Ëß}½mêr–‡rÓ³„ªrB¤Ó»åb‰ï~¾ø«XŸ&1júŒ£Ø­}œ»µ-QI’ô—&féUo³ó Õð5UÛ’/«×·(M±”FŽ2Z†rËŠú~‹¥?IÈìU‹½®eí$xÝr±0Ÿ—À4MÝÕgF)SD©³³šv$‚kgGÑ9ðYÔfõTbþkT¬ÀyÈÇbjÇ Ž­\ó–Ÿ–N‹;Ýå²ûŸ¹=^~‰x¤ýèëŸÌ1›Ü$F—–’ð„JSŠœ&,7ˆÍu×r ôyu…Õ{>wXÆâNºR˜}Pÿf6m?ÐÇ7õ8Ú¨¹ö\ý Ä,Rd·¶^sØ\æ~«7–Ì wù©Ò§Úø›Òó3müei|¸'ìÃ\ì5¿(?T2—p‹ê}i4¿¬Ý+n2’¨oÄËáuý{¨åEe¹|1[VÄìW=æêµÌý}¹äýAµ°ÙGìû¶´ÖŠ_•¾ßTR0p¤BßçBŽendstream endobj 574 0 obj 4342 endobj 578 0 obj <> stream xœå\ëo·ïg¡ÄýÐ[÷^>–»l‘už.\§NT´…¤²äHFlÉ/ÅIÿú΋CrwOwrb¥@ätÇåc8œÇo†³~¹êZ³êð?ù{üüàΗƅÕéëƒnuzðòÀÐã•ü9~¾º{ˆ]FMmì¢Y~wÀƒÍj°«0úÖØÕáóƒGë¾é×mc×ýÝ clãÖ†¦¯šMXÔlüú^³q¾Ñúj;íóþÿš\ÀÇë» uæv|þe3mg¼[ÿ {Ŷë†õa3:˜¡Ç.Æ>âHxf|XßÇñŸàŠ;Á;¹qýÒòwr(¤ñj0"=@Âa2k¿9ü 2›’¾ŠFàÅá‰ìß5=÷t&–=7Þ «ëÚÁÄÈÝ®õ~áÇ«fÓ7ºn\ßÂßoðã;ü¸€ÜÁ>ný?áÇ7øqHloÐ-\=*òäMÎorÏKm<ÏO—z>ÒÆoô›’Ð ܸ?OrÏ—–<ׯ£Üø¼>§ãéÒ†`ÎÞD’®¼úëêyAòBëeþ*Ã<ÈÒ×6‹”¸ae@‚úÞòÙÃŽÇάPò~qÙ€v]P]ºvtÃóf;ôk 2i¬omD=2mç’}MãžQßÑF$Ó¶axÞ¸¶‡QñpÛ!²¶ýàä,v Ö‚ ™v°¾Óœ´þ+ÜØ`{늩Žà[Bç‘3°!\~+¥å¸ìËÔ=èl| ¶ê¡´.OÆ:ÓÃ1æÇÑ#ëMë<œ²p»÷¥¦XÇîÞz´6[T]Ó·1t6éîgƒhK΢B‚H™ ˜íIl€œÀææŸ6$¶Ø[šäéç³F+5‚$ÐYƒf‰ÕŽ©ÊU+òqNš‹ÈÀì7òÖaoo™`Ðì…õ§MZó^6Šh-ÅÂ~Å“#ºêPýWAÒqfpÞdèÉО5x$p¨íèÓ •ƒW&;¢•¬oâ4xšÕB†2¼¯n+†ƒ<½Í¤+Ûñïµx£8®O›žš~`wÁü‘QÈfh/•ΟH#;KúVÞ·}uŠz”1Ú`%NC§níŸð?yò‘ æœ Ö÷cöáì@¸Å]•‘~}‚Eb²œ„Ûú‘$o.°ê²ÏØJ Eçf2CC–¡r¼XaækèI˜ ¾Z9°J2ÒâV]pIýfäcC)}Ÿ² 9°*H÷Äç[öþ£µŠ!’+gÖdíì`õ «G¿Àj£º¢p9mþL…U'eq`òHú82•²)>¹ f\yïúŠ÷ޓϬdȱbÛ‚ÆÙe‚:瀈 lÑ3)è*iG¥$àñTqÈku—ßâÏSüx¢O¿Õ.@):¿J•¦×Ïãú¬ç:]Ç|—Åétɉ¿ÒÆ·•Ûµðí~­u_¯FénÔɖú.çoéãõ¸Wº¨#œÉ‡ihÐÆÏrãîž0õMfµÊÍ¥íÜÍå± å³_ÂÎåHêÙv;wóB·¿ÍYÜËÅ’Rý¯Z·YlœcÉR÷i¯`ØÁG¬¼¹ Ý’'ßØÑ—_B]w§Z®î¬ Dœ¶' IßzP€<œ€B^Ù†`Ô¸ úíLÿÀáÃÎx¬4AŸv§Äpü0¶ÖÅ"€ ŽÑ&Þ8Çð*C´ã†@Ó—À­1rÁ ;t ïIï3Å8 ¶NÞÐùÉî 6ɼ9ÅpdEMÝ6v@j˜À™ò<4ýAVoC_ÔåžÑã±àKa¤Ï_(.g®~€ýõ§]ΣQ@2É…1²F×Ñ3Ÿ7Ͻ5é5ïo¶ˆÎR¶0e%9bPL­ApA2…‡øŒ6,[ž`(Z¬ÔÃDŒ½9®Ú Ù½’‘r°›¦0&iò*T)#%ùÈs”9Æ2¹d92sEÄz–¥§ }ûâ§)ËIBû¨% WFQéºbb˜ŒP9XbDLl!š:ÊÌ比Î-KŠn*ÃiN<¨ÎÓ°âp-ùÉÈ’_+ÑÈaþi²rÛ!%QšÂ¡þ‡B q¤È=JdsŒ³Èp6G¾µ*-¯ðÔbì +9J\'guYÛ€êЉþ­Q¥0…Ì©Œ)•(eJ*M"þšBçÖ¼0,/¼”ïÀ ™8Ë*.|™†Ç.å…2½®ÊlÑ×Äød,ä”§è·¼é€UàªÇ~®sø€uN¬H츱 –ÍФœ8Ó¡^ðBkJ¨J"‰dQàËYå`'î?ËÞ’Œ T„ágF.nÀs—Àe˽„ì§¶F ö^¢Š^Ö©h²ßx0OLs“ Q¨´—­¨ÍD,…H])vÕ“'A­¯S& ̈Ÿ®v$3ïÞÍjYŠe= N§»•©(“½LÛ«½AÉ"¢Õ—섘w— ß±sï,±Œi Ñpc °«Öà<#ÓSQÄ:&•m׆çZ€;tKàŠoÿºô$Kî*ÌÝ=†Yà,ß¡í%Ê}^É ©ë§± SÀ©Wª §Ñ¨²©i#SIgæ K:g9ü8Y8é,I8ÝdãÈÕ ðØÕ!iq- jšZ;è—ÃÝȆ7ýÄCØ¢j )C)¶µôO$‹·[›&õa¢–~ˆù€±¾5FÜîµü0¶|w¿ˆE½Ø|9Æz'7âõÂoùš{ãÇn?ySì‡}ÖÙû{±W×3ñìã(ýêÉà\y±©œÚÚQöáÉáscqøÉ÷{òÍÞÖÍÇ.])'|³GSƒ¤ å§phÔ~žøÏP—κ²úÖ'«Ÿ„Q´â4z½LwÝŽƒÂš+ÑBR8Å¢úbf¤Ü.‡ËS¥´)‘ór.†ŠÙî S>9Â/4”ãʰš±ðï;÷þºzóêòÉÁ¬ÌÁÏñãîß>‚?÷>^ýæà“{«‡ÛK'Ùn) Dà<\—¡²ÀšK!:Ñôo§3tDßû§3øÖVdæbÀ©"ã! r !–ÚtC¥ œIQ‡Ék;ªI²–üé̪[\Ô1=ó#>ê'Læ}©• —sMeëŠõÓ\²Ä“,͵C4)»F;ê­îÚp¢&Ð0áY‰4ª%±?Ïj§¹5[–k^ädÚoÓºyˆ;Ò ÍÜhV‰ŠÅÄ‘ò'C§»>¬=à‚pgât“3ËÍ7´¶S‹{Å5€ÆËÑÞ=YN)JåÕ•Qªàä*óX§ ÏËaxX… !<(Ââ\ »IÛ¨=vª?|dLøâbEù§rꓯˆ®LªÉíÊV#l‡@4o7Âé"­Št6;PYV+¡Î¾Öµƒàv«….ѾO«Ö¯¼`¡Ö…w0¯XHdo‚P¼rjBwX; ‹WÛR’­;Ÿ›<ÌFR!Ÿ±cNɺë…P³xˆ$ Щt¥ª¸´ÉŸÇ‚fxÇ÷÷Þ/TzM@3|`Ãþè&=àk ¬¿e‹„÷üt¡‹l¼8›8±j©€ÏsÂô…&oHI$3PA΢˜UMlŠ™Ÿ¦m$×&©¶%ØZa\ž3ì˜rîZz:²¿·8n|Ÿâ;X×bk·jiöÏ‹ÄzÓdTÞ7±@t‡F¥ ÷Ó†¯s"W$uÖ諞oË’”&šÜHf=+üÏU)tQ/¹—!”×QC;¨£YJ Dâ@;[êó¦Pä^2yŽ)8)3 ˜oA³£j–‚ËBÑ«Ë÷ Ù'INåU„EÄá # gÑDüDƒÔ‰êÀÅÄU’'|é«›sÚ,Gõ¹B¦ìoTæ– À £)‡ŠìÕu|¹F—ÒÓ ¯Nà —aÛébç—ɧzÇèz)®ÕfšÉR4Q¤ÄÉÔ¤[IíÈ’Ë -µ…Û3—.h[|BXiéîÇOK{N4šöà4Ë—DàE¢lÁ~WùtO˜;°]3{É­•ÐŽw>æ¬È‘È•k‡œc Þßco\³ÿÅμϕçE’P+¥K”+¡‹ó‘,†&@¥8  ®rúBÓ_"@¼©ÿ¦Ø£¾‰ûª±ëbÄ,›Z¹èG>«ý d뫘 ”3G~­úë]e‚¹ö°¨Ì|²£1o—Þ.K÷C×ËíM¥±ÎëÍê=‹m«˜ËI÷¯‘,N°®Á,/˳Ÿ.\]zÍívuܘæÓ0«*ZÞ[IfY>J–ˆ@ÒSªÃ”{~Oî½T•oU#Q ÇÙÜ@>õgèÇùvý¸ÁºÝÿký؃Ž}ÀUš‚Ò¿¬)G‹š"ae™PdÖ+÷`Ûï­<;­y:ñÉï§Ü~¹4Z_r;ÌíW­‘©ftRtÀEef{1CÊ øà‹›À©'zoN¢Ý1ð%$¦Ôäò_ßB«î†SµI`YÒ0ç©fz£±ßžrâŰLvzÅ)-ƒbkŠOª‹Å³FÖ–/Ð1â²`žÍ Ê'üÙómwºUì½$üJ„[ ô+ —)’ý:¹¡“jѬ>ÊAeú÷L¤¯t™’«£änÐ@Ô>½åy<©0RBH'F·Û¹féÔ@ xþ§$?ƒï‰–YoAÐÞpæùŠ“Ökv_xŠ$J‘MÝü¸c¾Í­SG> stream xœí\éoÜÆïçmþˆý¦eà]qÉ.`;ŽãÀIGAz¤(lɑȒlYqÜ¿¾ó®™7¯Ì¦ï;߯îTvõ¸ZÛÕ\¿_­åÆ“jíœÙÔu‹›oªuÛvñž[Ý­<>ömµñ¾µ«‡ù±{ð˜Ûô]Koú¬²p§ °ˆßêg¾ŽÏX·©MC‹¾ªpaÜ¥}DY ˆ±!îhL\\»H„kð-ñ/ã,tÎÆ}\\î`w×Áærÿ»HK]7Ö |1½_Ikâsmk™•%÷ׯ÷›Ú/×®Þ´¦ï‰¥x¨Gð8¼ 7{P¹Õ­HNGÄ '«,0¾¯é:®–…ÕÓÈésàÎ \«‘¸æÓÈsÜü»$¹(>nªDeåë&ÞìPV/#=¸)ìþ&põ>îÞ¤ìm¼4o>ƒUgqùóøØìÒã"¸—¯ò;.à®E™©«×°ÁeÒ‹KxO6Ê—u¶@´)Õ‰ÏXB+¥óžÑÄsßþØÓ\ëÑ"\\mã¿ë¨{Èz‘a¨Q‰ˆâx:Ä>ÐPÈ~F~»¦Å³¤‡ÇÎÀ‘vÌ9ƒ¸  6 å1‚Ð]w…dMó…o†p—´4Q‡ïlqŸwÀ¸qÆZSGVQ›3Xˆ†·Í@P¤Ž<ÞÉ@ìB¿ˆ¡ÛÿCz³ºMbŒ—1@dˆq,#wD˜Ùy‹»`oÃZCg,Qè‡U”-rƒuѰô+¤Æ!«½o’¥ŸƒM®áa‘9ñZ‹B`™øø °í5àØµ+€dl"ûΊ_Õ¢•&~_Ðû¶¹²*ù 7kWßs”¢UÆ{—Ò°‹ª6ð$H , [A"Ó šÔ|ÂòërNð9ˆCSÈñ Ä#ÍÈ„Ëì­HµƒÂ·^e¡ƒãoÀã€ßН, µû)!@‹í)ý`Lhä@‚¢´D–)ûd–ž33” `9›LŸ®#T’ !žÁº¼KÂ>§%Dÿ#¾Z=+Ûcn%ªˆwñ<#Ì¢Ýõl·§ïñ lLSÎQµ•Öc÷¼ç”ư«¼`Ø:"Ï !Em<[êFÝFV‹n\— Áæ-R™ «‡œÔáÛÐÍy<Ä—§™=gìÀ²w8Gî ,UiÈ !«$"¯tŠZv¢Š8¨ã]J;‡¾Éi¨×‡‰ç` rÍù Sý"|â¸òÙŸ– ‹„GËJ¯ØlOÇ(äKžÑúäŒQ+¤èR&z'æA25ÚPíÁ-Ž>æT@q3j“…Ð$bH7\JŸÎl‹"¶AB. '-V(þMè° êö¾Á!íø8åž…ÄhJGãVÇz;ÎßlèçéÔÔh]ÂD¤äZÁ·¾ã0+#‘¡É>ˆóTÌÇ0Ö#6Á ÒŽdh#¯}ògäíÛVgMOª5cg"åäFHŽä'ª0á‡r´ð´.ìsâ{R”ÖrÆÒg3þ2€´£q`$ %Ê‚%‘žÃ¯]+‰ò(–ó†’±ØpŸñ,‰ãŸˆ¨J} „0=*{\V%z¥ñ[4Ò?À`ˆ§úÁÄ;E´š.›VÎ 29J|BˆÓœf"]̱üÔhtÙ‚Õ ØÙ˜ÂB$Å­ó  xT¤ÃŽ+Ï!±©ü,oÙ!ïLUéte¢å“Œ?ìÛ1æ¼R!í³„—(MBð©\Å2ø%3;`ôØa‹ —™Š”o{¬HQ´*Že ¸Ü»Fåìäç‰Fç.ºÚZ¤'œñ%ž`íc BÎ+spÌÙ?.E¤âzð_§\ à“E‰»³Et:½Ý7r!H-¾Ã 9¢¹„žB}ìtLšÝR‡}£a#Öc»¹ËiHضIº–š'céÆwnñZ–úm"'®Ã©z!gϹâïM³?ÅÕ”Rí@"&c’úÌ1Šgü¦Õõ¯í˜øf=? ê½-±úÌÉ /æzÄÈŸ²ù²_‹ˆC.ÃüHŠÒ€øy&m>ÇÙ‘™IC×'\máæw~y­Ú/).v&{žEÙG äájªi—ìlá’U“Ó`%À›‚6훩ň$i¹D6 ˜°ƒèPTäòiÙ°/Z8,R‡üZêó¨`8’,NSÆPSnäÚWØCêd/:hÁ“ĄàE]¼›4x- šßçF’)Ó€©sÜï)lú¥ÂÚLÄDl+&Úƒ£R¿xèè&>Žáݾa}æÙ”agfK¡0¦ÞUÛS}Ú¤±m*µ[q±è¤Vt(ʆv¶LhëýJ„¸qÃÑ€qCJk³ !)ê0¨p¡g‡Oõ⤠ºê0ˆÉƒqÒXJÃg•Ìä¨F! ‡)§U~e¾¯J÷«mùX(º­šO»Ä›‰L< ªÏÁ ß¸Ì§¾H‘ì8Ê-‚N‡uÌnÖyáÈ.)ŒæhÓc–uʯ™.â¥X_ù©ÊQ`ÌMÉ6«%¿¢5—Xï 佡)„Ñ#^Rý4\¢Ù êºÝœ< òžap«Šn8’УHIƒóÔLÛÔ(Hš¤d ù—Üò7akË¿©möö£ªl ËÖÙcq›Ü¸S#q8ñÒøŽÌN ÔÜ?Z|³x½Œ¨ðû€(Ônio6¾[:(jt|qp÷áâðá—Ë·o®Ÿ/¿_šÅáçðŸ»ïÅ?]þnqÿáò››~‹`M $€| ㇻ‰tàöÿDFqû‚Æ4ó¦ CÞ×¶œê¥¡?•*ë55)Õ` E©¬¤¢v–R1xñ/òb,´†Æ¸ynjª"Š—0†ÆÉ"IS›A?RM¨FJ¨™ÀÜ`ý…o[:§}µìì†4Ò*_÷“û)Á†Ú©³¸ÙU¦»âñ†ѺN Õ€Í(’ôK%aŒT\Â8à`wr ²q³Syt gý»PL‹KU„¿æ’>6~JÁ\7‡_}–½ÔA¶Àñ<Ú™ëG=ƒ‹ì Ø¿Oûƒ<`1ÛsâºÎ>ZC.ÜmŸT_mèIJþ”åi¥â†Ó4|Z,Õx‰y hçmÏÄøü §Pˆ_gRuNç7¸š-—4mjAi,Èa¾D8­µãtq›vðDâ 嘼\? )Ç*ª,Ÿ ôÍ`ìRÍÉØu‹Há¿M°ÒS2UŸ)–R JµÒGJއ“f4Ä ;~VI„”Ú°¼å·r­ÙÛZêi×@=àºkS š¦±û!J% O“y*ºÑ“VfPÖ¦¿¡üCæSðXáÇ%;f¨#‘ú¤´[£7žŸ“óõ`änn>LÅ#éª×­>¹ão£Däh{ìÿXÊÁ ¥º¯’Œ˜Ž´ÿ’Uå>×ib¤Ð¥: }Û'öâ Æ¤7·iܾ­¨ÆÅc-(ð]3V*㢠Q1Ódhf!ï˜Ä6ô9Ô Åv*‚çbb¡Ʃrä~t¹\[ç`InUßZñäô0-~!ª¢í·„1©Ì r¿@¡¡I„ƒ ƒ²PÃ7»Fƒ)oªÑhJ4RÔ爳>¬¦Hè_™Ö™Çìlû”¿|84ÑÄœ„™m_™IF1þ¼¬­ÇcQ˜˜v“É#—W¾“É®üu0s°íÒšü¹*Nñ6¥ u2ä¹m¸/¿Éä|+¦³%jfèXÉàý-™·Lùæ ©¾0 4kc7].þ–ý"P›†C“ú&>ã|œ>r‹ÆAl,‚»Ð¦ w*4Û!kâãRUþÇY¤ô]*U˜P"·©¶ܨ+«ÓCl~Ôdòº:7%8G¾á·‡¶‘0{6š™W^~åÜ\ß@m¤ˆW¹£Á‡Öœº>‰A]ùUwL=¡¿¥sDäøKpéÀÊËz)ž8º ZBÜø;ü u1¤‰îâµã ÇŸÖ@‹ñî{h†„ luéU¯¡¥ªZsªŸÏýN¹xV€IT¢~ܹüaï+AO_•7Θ.Ì £V}œn_–϶cQ‚?©œ©˜é½È÷ϦºN•å‚ëîéó™?ÆM|Óºý¥Oqî}ºx©KLrñX—ÉäâI¥ªäM4Íu6uºótñTêIoŠ·Ã¯0pt9ºÊ_(ªãÉÚ[gͦ Ñý pã,©ß9khc©=ˆ"}—$~RÚù"ÉU™´5Äè.ઠ*§4ã‹×ùb¶ºÉ%"@ƒ€ð­Ý¤ÿÁÂÔYýaòª¥a Ã¬kÿžiª÷žécksÍÂû`®¿­¹>J÷¿Î÷¿Jä‹s+åײ)Ú•êMš6µ:õé6>˜w³ã2=‰ÿC <ÐÄ4oˆïÏ_£ì/´ßlí~U<À?_ 2$EgƒšpÓ{âAÖË×Sç~?몋o½?ØþWý?âªÿ«V9é[á 0‡mõÞfº—Ûþ`ºÜö Üv²ûÿG·ÞoÿMÁÆendstream endobj 584 0 obj 4902 endobj 588 0 obj <> stream xœí[YoÇÎó"?bß²#h‡Ówˆ,ÛQ ÃRl—‡ %)‘¢%û×§Ž>ggJŽàHAr·»§»ººŽ¯ªzÞL»VL;ü ÿÏ&{O„²Ó“«I7=™¼™Ꞇ‡gÓ;û8Ä+hjû®Óýã ?,¦NN­×­Óý³É³™i̬mäÌÑÿ¹ó}Û{;û;4ý«™ÛÙ·Í\Ïî5s¥Û¾W‚>Ê.y¿w¡IYìžÝih0·cÿ“Æ»¶ZÍþƒ£ú¶ëÜl¿ñ f08DÀs^÷ø$ô mg÷ñùïpE‰ƒ` …ƒ”Ÿ=BZþÙ¤ñjðDì@Âa2)Þÿ'2B‹’ÚEx±¿û‡ß0Òèrä< «®u¢ïù ݨÑy…i{ÛÉ8ñ gvüxÛ¨Ù5²ò²™›Ù9òÏuž:N±ãˆÛ üþ¶s…ûzß–ðí íÿŠÀM3{‡[Ça ÞªÈÓ)©‰m°±c|B!ÿaøÈkQØ‹ag°²Îô¿ƒhåá1Ë<>-ˆâÃ7é+ÄÅ‘ ±²!\¹@ŸÀªåH¥mg@ëp2d·êl 2˜{•; &ö"Yçñøa=f¶P0,nñ4u9°¬£-!Sƒ â4Kú…  ·³ð‘Ä—·'ð Ù%ÙÍ«c‘ÎÉtîñ{¾ˆÂÐÃôÒ" Y }·=—½!ª5(]´ýJr\7û3~ÆF”|ì»ýÉãÉ›)ðÓ’ÚÃÆüT –Z?µºS8'’;÷&{÷Lß^^MöžNÅdïøçÎß¿{w§š|woúx½‰h@01­˜à—×lf"ŸˆçYh×Ój¼hõ§ ÕŠÖÔ´fýæJ²XD>¶]×úÄ-Ÿì\_4kh8#’~ì€W9‘d–ÄÕ8z|UŸà˜·(n\'FÕtHVOš= X¨c<-NC”S”Ú™> ©(§¾c›”Eüõ¥ï+jG¾Ä(’h²!AàOƒ.›V$]ÆÍiOl^¤)‚yA%·Ò’!äŽÊ:4un¨¸‹| #ZOZ¥¬kµf­2½gB’…|.ÑxãÿÈ+•O+2&Xó¨À’(ìF+EÌ ð—Ám‘ƒý1›2ÄÉb`Y’ _K”2G ˆŠ9îÓó#‰ž±5” Ââ#üÓÉmÁø|vÊåx ´Fa|´I6ILßQºÞ#CSà,gß0jAeM Ï+³ƒm~8E€uÑ=ƒ;èûÇ{šG¼Á¡×ñAthªˆ–/ò‚«JÀ½Àèƒú´àÁ  ¿£m¹¶¿àòSŒÝ'“‘—kD€,#‡ï:GY ÐNm¡b4)Å#¯ !É(r\¢£Û÷t+]ð^*Ç 7Æ{— ï$D÷< Îþœ&ˤ=+ù^F[ÀØÛ10v¶Œ¥¼Âçƶ­t–ú pó~3,«W2háA9?öý´¿ß‚o'”…ghZg;Œ@*··lbè@byBðÜÖ­ÔH‚—÷z¥4ïÊ${F\åbn¬bh€>²1ö­Åø ë“éTàeÐ.8ÄÝœ-šUHê²ÜãWmûÌ´-á}äø#üóÿüæYíˆ:´]™©7Ùß晴#u0 AE ßgw‹ÜîRŒ¤V˜SÎʪ˜b›+#…"| m z½Î+Â\+@ã0Úö;Áhwƒb‚v¨µEfKg1Ý©ýì/ð5ÐÑ…ßÛÐ#‹ïÀò0ŠžÀL7¢ÆOåJRK^_ÁÏt¬Ãr§’×'ĈÇ:…ɪJ„Q¬¬Uˆ¥ÐÌhCáZŒI­¡¬]Ä®J—,±®LzÅ¢“æ½Î8Ñ啪Á ‘X[l•x1Ã{hí þÿŸ[%Øeqtÿd¥ºžJãͧ¡ÒÃj*7ÚÖµ)á<ÉÇg )ºÉu¡Ü–Ë;)Ø©s[¢›Ñ Â-o#•Ó1(§Ô(ÝÎËÜxÖl„Ï—éÓí<ûÿiDUly%¤R9¤ªØÃTiÕú¦Ó3½E6X¦8‘Xz?JÀÚðŠR—ݰ$ÿE&3>\Ý‹´^þB·% wVþ?Zjã«Aø" ˜oI*·[¾åiÓËœ¿à Ls©9£‚4j¾°’<¡]kÎ0ŒæN¬© 1 ñâšÛEcÒ%! ÇýKc0´6á×ëDZNcÂQÑH´¡8Ò^smMóE×:çÂQ¡¬[Æx[¦ß2ÿQ¸ ÉVËXÕ}(|«¸ÅR&©¨SS+Áîú&QøkÁAkÊ+$¶èµ±Oè®ïÈÕ—r°†W艹Z…ÈFØaL3$Z‡04Õî8I”îW,ƒ° n%ÇÜ̦;©>éÓ½ b ý9h¨t(z q´¤øxÛMHŠ Sþ&WVÓÇõé%»µ©½ëÆøµÊ~€÷×ÄzF’aX8ß‘JmÂùù"ÑMqþgyYkÛJç›ÝéË1»^ld9Fhž3!Ywƒ*Åјÿ”Fˆz_»í•íù¾t×WÁ¯÷…Õûð»_¥ÑýiŰH/P|*¥(Ñ0š£~+ÞYEvAÃùfÉWµÙYmî§ÆGyäÃÔøCnÜ>²ŽóvP®qLZ‚â¤] [Ÿ¯»lU³¡}¤vá[`n*À‡#ùŽŠÃ—•tá¾ fBEGØ­m:ðQÎÁ¤nµY:3S€„Ô­ì1…ª[¡ Èà`ðæH˜l­3”·Õ­Õžòõ8—=ÝÞâî£F„ušRÒʃ¥³*>ƒb„A­-„©øâ–n3ƒY|ÜÊ8'…RúkDM(r‡°ñep•㥵Fšiƒ¨,N£·ÙÂØrÀ’3R©¼¿3€Fh#žðÖÞl ̤[ ø¦éøýÉþ­g3±Z'ðqQºxÏÎT¤Â=X†æéÝ„ˆIÄW!i²Í|J2BGÎØTÐT6¦üš_Æ[}óx‡R³Hµ±N¦cÑôi3xSÆÆÐ:s&R6âoÓû$Ò§²<‡·wƒòR˜¶ä«Þú".ñk9çžÞÚRGÝiÚÂ×\Yý |¡eðKq±ö„ßO 7;ŠײzÞÒz¬‹„7'±ñQ#ËO¡ÛË6–”RðaÃë=ƒ*Æ1û 2TæòUB†0T¦ªº„´¨=Lò„aeÄÖ„i”;麕S*¤8Îð׆ߌËdb] ÅÿûtLaûNŒmŸkl†asׄªS€ò–è…®ñ«¥EIª¾Ú|„ Oôr뀛ÅFRY½>¨°^]=-⼪ [–E«×‹b([Oþ hVÐúendstream endobj 589 0 obj 3428 endobj 593 0 obj <> stream xœí[ëÇÏç••¿a¿e±C¿f¦;R,Œc"ƒ±}ÄvBdá;¸;ùøXÀü÷éztwõÌìílY–…ow¦ÕU¿ztUíÏKÕꥂÿøïþéâÖ×ÚöËà µ<\ü¼ÐøzÉöO—·÷`ˆÓñQTÐ˽g š¬—ƒYöÞµÚ,÷Nÿ]uM·ê›î{ÿ‚)ÞVS†¾5>ÎÚ;ˆ#ï4k·ú¼ÑmÞ…Õ'Y=lÖfµÏï6ëôâëfm­n•pñ¶YƒïìêvãpÚ7ͺïYÝ+ÓîÀ4Û?ÐNŸ5Þøñ.0QÎù2Î1¶Uº£AW }@”r€ÓÇµŽƒ•DØw‰ß´ëa µ&®cãp «[‹§÷"-JuF#ü0ïˆÛDÒº8o ³²æþZ»Ð*·\[Õ:bé“ÈŸ ì= 6]ÁŸÆgñL?Æ? OÜê0Ž>ŽûÁ3â¡V¾<;„iÀÂ~uÇ>#ŽwÆ+Çï0Y#?‹“¸lÅåz…“dYŸ7bÊS"X©¾<õÓiL§$+ øõ|UøõFŒDWk߀µ;<Á‘ëVûñü}Qäþ8·ƒIÞ®.€÷ôñMì7ÁµÆ%àæÕÏaûÂC‚ /ÛÜe +"ñšˆÁïç ÈÉÝêuAÁ B{ˆ{óº°Åú³ÉN|¦=‰Ù0$¾‰™×ÂKsC°c6e œtÍG]G¹w½2tb h&!Ø#q[ïAš%Š]†áy:ãh@®'ékW1¥3´i–°Y=^%¾çÍ’Lá~¹ ã}\®ãåuŸã°÷˄уD§«ù†¢›“7ƒ=þZ¸0:fŸ5¸I45YûÌ& ¥¾z°t^Ø$ð>n²°A‡ïÈHœeÛ@<,°(ò9ÐÆç¬„•‚“S°lÑ|YG'(¾ak«{ZŽxZNý¼ÂÜ›d :t4ÄNü6ì‘O ÃÊš _ƒÅÄcè g ´ùÁfƒå¬-Kæ½Är”:²\x†£‚ñZx< U©°Å„W'Wò%‘—™ÏÈ ”U]ÛgÛô´IΊ€‚L|u$¿d_ÆÖ4Y®‚¨ÄìD#žðª¤Èä´¢ËZ3akí£AI–d/q’}M”„Ãcu«àÌÈ!u|#P|N¢a¹Î£x˜­¤Õ¼°0R‰¸WО[1y#4:®'AŸ9xôÞDGž,É· Æ®Ð$E“ªœ<œ´`¯02€eð(ÃÄ1è:‹œ WÀ-P¶e3¶—$­C°&=ú[áwH9“ `L‡gÆU9‹î³&™{¡öÚx‘‰‡8¨ŒOì#\%j¦Fd6Ê¢„Ø‹¸J<,ŠÙÅl+~4æküLÙVvÓ5׊ʀ‰^ XJ¦ ¶Ehæ5Àp¦õ£›É´OÄ™Me-1eæM‹C7EVK(qµ$§ÂئÀÆĤƒêîò…Vs9’РfnŽÖŵ3k’:BøYL­ N~êË"6p4ü½É¾0Ú£¿Å¯p#X§)9€± @9‚ÑqœŠÿnÆ9ðÙðgÃÏ×–?úÑûZô1Ì¿þz@>|xÂÁŒ÷S?c¼NM¼8n˜[š&Dáe6)²SS7Uãi½­P5!àÕ„åaQHk *†øÄ$PTÈÅW}\YÏZ®t‡ˆ·6Të*ø¤À#èÊø}¨°C¬ w.B”Y€B–ýFš´DÜ# EÕ2½"^ÚoÐát¾ìK"~Ô&© BÅÍéUT@üpùF;ÒjK3Q@UØ|z½ÃoáÛ,ö¶Ï¢ tukU7¤#XXázU¼Q-œu¼C+Ëx—.N| Åpx)ÁVx²Y³H)r¥OЛ5jñ†3œÕ‹e ¼@Kðù`$Ì`þ&#l6‘:†ÅÄætŠ;Ì(†";ù+¥«.kiö뜆¢0‰ŽV›¤b‘Ñ„ÏÈöQÞçïœã+ǶÛ7©9aóµ©(µík7“â,–Õ¡Îbu­ª¹Œç p×ÄÍ€g¸#Jo@±4Úí‡üâ,½@ªðœ4ø‡<Ÿê#C›¾G«|+nenCCEÆäXΗ„¾ÎÑ„ÅÏ‘«•:6ëñ!rt&_œ0ýÄXQnä×Ïëyx”›<0 ð‹üæËBäƒüðŸåáî‘ÌeÔ·Âã2òB’žnv²ˆ?%Š£½ŠÏ®** ÁÄãG«PçʼnϪs""=¤ÑÈÄDe#Ss>: zü>¾¬hIccä)Ñ´¶½Ba†VçDï[hÈAÖ‹“üi“?½«†¼µ†dëõ§†ü©!ï¬!FÙ­!øõ o—È=Ì£Á¯=õÚ Tptø»P ýüæ¨ùDOÀ½1wœ2r§ÒéU—©ÒMÆuÜ2ÓŠI#\ª (›]ðÉÜ×s:0¤Ê'™üF0<É‹ÖçBðŘóÚà{=èß|ç•Ý)r)øf-\…³©ˆ+œ¥Õ¯Nǯei/4#j¨…æ½µyÀþ½`šGŸT‚t}—Îl{7° IçO´ÿýªÊŸáËnýºõµî\u)¶ƒimwâ~¬t¦±³ ÐPdòRÚ¯/u‘Ü{ªÌOJèm-Ž˜.—Tà§„êEIwƒ“A ‡˜kddTù¤©Ò5Ø I§l ¦s0a§&ÔþXå³rFª›awbÝ{*èBá.'µÎJVì˜óFVä*n¶Jös”ü@Uh<ÄâBäà€Ù?Ñ F”ÅÄS»Ï£øï>0î³Úœyä:šiõ¤ R¥måÔ.26{Ü’2uP*‚+ªTM“ÂLHAÓ¤,C.UÊϸ%˜n¥·Ezh:µÛÑÓSJ`¹0s§àH´•!¤¾)¥_N|¦NÌ=YÉðT› ‰¶@ ¾G·°Ë¬€áæ+SÖpQ<¨k¼—IÕV};£J…HsÏO:ØÅK0Ðòù ”’ÿ%•z抮U‡vàSœÜ‰Ø…3³-Ó—¡|ÀÈÌ‚,uÈaú†¢ QÊÝ=µã ºÅô¿Nv›W<(/êmÀâÍ¥¿vQ^ß*ñrG&J­°þ3ŠŒr%„Úš,+ç«TÜÌÝ)UÓYê—9Áã¥I¢ù†ŒÊžØ¬5FH!u¿*@nm(ªì’6»e>u¢üu>T˜¸"õª[à¨ýC‰ÚÙ/`bÒ=„l·…*6àVÏ· вmBDÅIè²ÛjÙÆaÜr(E0î<©';05-å26nRͦïêjãu‰:¦°˜qÌûñ=ù‹‘åèˆ]™·ûͤÈS,UyÆö¡›VcÁ:%Üô¾æpK.^/+ ÎÜ‚IúÞ®Ù×™ãÚQŸ"U`;QüÏ^¡º–Üæ6XtÔ4²­ºÕc å5ÍTî&äZÖУ‹œ§ .¼v©¤ïl²FW wK¤kJ‹®ñº ­DÓÇ4 ý;F†¤ÖÐÁŽÁ/xqò߸ÓM\å»GÍëØ¸f „ô3JÚ`Fèb8ÿ÷}öa (îV» ¼Ã£<â‹Ò"_ÈqèE?׃ÜÅþˆìSmžþÇC„†Ï¯VÞeÀ eÞÄ9ŸÉæQÿ) %xºº#ˆèª IjË×ÄPQ1‡À} ÆüÕ§ ÷¶á-åabÜe#'RÉC¾¨^çnÿ2N¡eŸ[B‘ï¶M€ýïË_8i–0&„fnfÕ…ÈXw`–§Ž[Áu„Чߧßqp0ìeë<,Ô´ó É&‡=óDqÇ /ëuÃàÒÍú¿–¨S\b °â‹&raoŠk¨W.‹ÍŒCO’sˆaV£ÏÍšolu•›Jµ›if8£ ô Õóx³Õï½zùJÏA¾ »µü çûsÉš’Àû-ój»’«¥ê!¾'s“^æ‡"ÈÃÅ€ªz…ú‰¡ÛKÉËm*šøá›òð¹äž Þ_©fsÙžÏæ±åœœâaB¯ÒýH-G)íS.ÌL7 WÔ25¹ò[L÷ûw.¹¼þߢ{d?Û«+%2ù#)Á®ÎæØ5g3æ¼oƒ÷s:&”àM~ø¼<|*w¬ŸÍBç(»A)xúß& «¤7HN§,¬”ÿ*Cï\÷!úR®í{š«âµ+ÏŸV96s<œYâi!òÆuÅloæìêÕÌä*>æzÇ .€W(’Œ‹ïµ6âBkÍ(â±W«`À÷;ÎßZô£VSïõõ.Öúqê{Cw4L-¥¥ß&ŠÎÉò‹çOóõ·DâòžS¾ÜÌ?¿5ÉV¹ƒQ­VÜÝ[|µøyimÛãÏ´c¨í—ÆÇÐÛù¥uCë=üîûö½Å­{÷—›‹—O·¾]êÅ­Ïá·Þ‰î}ºüËâî½åW×ýE¸ñÊ'Öµ ÃiuµÖ!#þÑäÜ^Ѝ'îVå”nªSnÄVþñf•vãß}EÚræ«Ê¿ÑCñ»ÑÂ’Æ*Î8a•³`øë…q" S!'’Ú? .>%½ $g•jÓPº_-þõ„endstream endobj 594 0 obj 3712 endobj 598 0 obj <> stream xœí[éÅÿ¾áØo¼A~ãék¦;‘¸ DÆNÌ¢€ "ë½°²‡ñ®qÈ_Ÿ®£»«gzÞ[ (‰„ñsŸÕÕuüªºæûáW‡üÇŸ\<|¦Ìxxq{0^| °ûÿ:¹:|ÿ†x›ú0uxt~@“Õá¤Go{¥®¾Þ¸ÎmúNo&ü{;ùÐ?nÞ‹MŸwÛqóA·µ›O»­±}FáO=ä1OâŸc“¡{ó~‡ƒ©úŸu~êeÍæ+úa˜6G7qCTœçm€™±OÙqóæ;j—00ÈøÍS å‹<åˆI£ÝâŒÔ„ÇÅ´þÛÑŸ€VIFX)ò‘G§|þxv¹µ:ôÞnÍÐO*p×™ÍwÀ‰³H’ð˜7qÒkhƒÎ—´›|j‹ã4»ãØçÐ~‰<‹üyÉ\ìw›[ > zÕmüÖR›qô5L»ˆË=Ž‚ÕCdLа11tD‚n `rµô_Ãp¸¹iównJg '‘8hB±ç*’+Æ»¾N,ݼ{ñ‰¸éÑÌ'KgyÓWu䙵‰Ý@ žú ϱ˜Ê,¶° ËÃ?á\që1M†SŽOÔ%f…|PqQÔQ&DÖ¹øsštÕÍ瀼»d krå›M^[PøM—ZQ¾˜[ez7š8ò¤p‰¢’xÔ®çåv-H‰]¨K?tFK>oùß;þn¸ò(íÀ‰H I|2ÆaNDÆCÇI‡J¬4¥! ǵp±ºû±qñ?¢ÞFi´#–I̾ó bã¤ãÎLd øPqþ„‹×TÀEÖ¿¤É3aEC¹ hq<¤zB5:Í·FóÓ’iCЇ¨HÐYú@Ý<‘Z„³Ü0XQºeÞx«|?ÒæG‰Ñl'"1v ›·€Z¼86[ëÂæ<Ş+jQk^¦†Ç™Ö—Ža(JÈܰ!qlƒ¶v ¨d{4W„-’ã¯;Íâ’fÚIHÄ íæ~·¥Y®Sºõ㈄~€Wj´í£ûâ%Vàd+Mú}ç˜ ï|o¤)i§ïÊpžŽ^a©É œèÞŽkÉÌÂÒÀ4£Î»à‰ôOÐk‚/Û5!“ض™è¨@F_Jí·Y„¨K=‰vYMz™å hÕÁà’• —»Ç‹=… ²ú<ï"eP‡€Š±&ƒˆ BCLèL{} r2x\£P€»³â¥@#ã™Q†QˆBu7fþÛ™SX±ø‰†°}ÖÃbàéœÒ;ŽBD“]4;øŸêGHdèlµ›Ø¥ƒ…¥f"}Á¸AgZã—iØ…]ƒ²ž>€%âo53áܽµDo3K<̿ĸ‰”ãQ‡€htID  Ö`ÖЄY—}òÑPg@ªÚíÅyÙý¦–VEcΙI£¯ "â~òýu`cîÄh jôÿî i*üA­m»j§³«&:kÌaˆrxÒÓ¤þ¿ËÖ‰ð¹v^G1vZÞ»Ëè$­"0|pôÎ×çïÆ %«¤u X‡Ò‘ ¦Ñ¸ÂEÒ3†2ÉhÆFíüLf˜íZ;”€…@id‹'åíu øèùÂpkm3Å“Ydየ¬°ÔèÄ• Zªšè×,á6B‘!4[ NG¹Z“Ÿg©áH…-˜ÆÉ¬w”yf×´€UB¨Ëì7Ð SÿZȰx»™2“xŽl“ÓCÏœÐõ˜À$¡:ôÄ¡£Ë6Øù f³déÒä*{ÓE‚´–mÊܤñÜÅÝå,å@êó$ËUœvFd…E–lµ ‰æöæKäŠöbpB¬ÉMO½T½µ«Ä³a'–9ä6ɽôÉsQeºTFQÎ"VHLJoœÔØ4IcoLG¨­æ»`õýFQÖÄ!3M çG{^‡ù×¥û4±9‰6> ¡Ùž¦¸ ‚à,`0*NÿGŠûFqÖ"VD¥0“CpÒ¾ëIû<9®%…¶äÄ„÷DFKB§}xECéb“n º€ú\ d¨.8S7˜Ìoña‹.äóâ ÿ ;GÑÔJ†è¶‚%±JôQ<RJ¸’è­¦3VÃSÔ†¥ófÏàb`ÿÍ—ÅùÃÍÃîÚ‹‘à w ºÏF*2AphnDC£‘Å}aÑô”m×eí}oŠÁi{ø&Ðç8ƒój&¹"¯¶3½‰ ÷í5út®1œ¥asŠÐ Ƹ/¸áë[øç EÀ[ħs ³hƒG]x×Ö­+`ÛIû²ÕxY©ºŽ¿!íWkz”Çíœ`š}[wÃn %~'÷\§™>7@WL¦ñ)ʘ…ÜjÃÔØy™‰ $!ëkõ:7ÞµÖ{ÙÚùUþ…ÔbÆÏF×ÕœtÉÍþ“I—­‘…Ϋ•Ý%\šmïC}d´8(—ú4œ/‰šmc_—VaÒÌ|Fô*nÁ5á$‹èz¼|7Ü6S‰K)31¼ú#Iþ¾Ëx§%Eå‚[â¬ECÁàðÏ?Ô§Ö]€§ŒfGåüù¯«ÿ†`õ‚0CÞ€5­ÁIKönW­5¿Yƒß¬Á¯o ®—ª.„ëKf wØ’Ÿvj÷YiüV*Æ® ÉvÇþïØ‡Ï”³±¡!ª€ˆíLó=0–×Â’€pLä–cLÈ(Tã·2çÔ$å8A/Äùow„»¼ÛT)V~õ¢äSNi²ú8é]ó?À^±>ô¤õ ]Ë‘B΃sD× Ï3³xq9dϤ'^hÇ3 TCÉ,ùq‘“¾zį°ÌùBí2ŠíW²ôé}FrgÂ0 £@Ï“oåXN¤ìf©]ÑCïjƒ³rkX2êÖã†" %@I·Û—Ì¿ö ïj¦÷k÷j ^û=“züÉ S_0ÇÕtÁ)—E¯wq:_ÔC;ÕË«­ÎÙ>½qˆçÇÕìÂj.‹_×õJöŠ%šª·6'à&=Õ ÜTo~9ÒL[-Ò!íü.*Ðn±ËD7$׸zâN¹Î?ÐIꨤQYÙ—’ T6‘ÁéØåAª v|7i‘á¼Æ-Î{Uã¼7?ç øòJ.÷[Ô÷³qÞãÜø´Ìy’?.ûGµÍ3½j¾"lÑŒ½‘ ®ÖõÓC¤™²€"ƒ´¼ê²è»®e±ÉþO‘ÊŒp÷DŸQ[3ÒÉO?笳vð=ç³%·ƒAmÈ…*']z”¤w4csº:'ðVÛ”·jÀªeÒ[”€ 9q v#ì9VYÔµ} çcµLÒ);Ï>"&@¼m¸¶M<ç“ø3ÏðXh¼à<ƒBjïÿÖ‘è:¯T¤ª(ÔXåÕ±LÖÎqã³n ÆÓ+íãå.vAGP™0ôI‹²|^⣄yM~2ø†é8l(C1giÀ%#¸ÁzÀeÚ\SÊz.@ɮѳ¯#ŸÚ’¤Œ,2N’¡¥æHž%ªžÜ«'ÄÙsrz½t¦ŒÊ%Kþ¾±ac¡a®QªÖÚyÙੇaíYŽø„„½n“DQŸòÛz"d¼`ã 8ƒøx!£U~¾L”I3þr¨p• ði— ñë]J›ä¥nº:..£EP_‚e¬þq˜[Û4®ä¾Ë•NÖF6¿ hœgðT{íy®`—Cú™9‘ì@hì\Kd“F½¹/Ïk`´/\ꇑµ›HuQfѨÃõpaIûþ]HÏ·‹:ÒT%? à‚àœõäUJ .œã0A‚)'BÙrÞ.%Á…ŒÅW$ÁÎn~¤îYYó¿:+«ω¶¶ôñžB¾IÚâÁJšhþ|ÐZŽ*ë¹ o Ꭵ&®.1i—‹±¬dhkêsåd¯È‰¤:ñPÒlc:r‹¾àî‘bb%^¤)™QDz\/!Õ‘%©K_$“ˆQ$ÕhÏ`8gÃÇâÐPr×T2³n‘J‘|±ôeþ×§õE1Ž¡;Tî.½!É ½•5¥liWiÅ۾俇±XÅÏùƒ±ÝóW `·×¾s(‚vZŒV1²|¯3rxk¢¨u§w²/3`CmËRˆÈià…O2d¼÷Ú“k4Ë•ò[FUXÇ÷²°®LÓ3³±–Z]«°Égâøºr¢Dn–g9MÿÌf:caSÑlèuï%’*7Ó¶¨]ºO"‘ûŽ“Ýǃ”Ê@NŸºŒŒ%”xÊJoõ7H3ËÌ÷”Ò)#í©Z½å”V>;(’—Ôx14 .tQ’[ÍLˆ[Ђ ùNóÇC*ÇåkÀˆ¹ælÍ5W¾ŠÀ+YÓVû|6~9ƒ9½@‘}ʱyuq»‹Ëw}Ó„ÔÞã›&^+äJå”l™!K‘3~\ ØJ°ÉÀÚÓ—h91òVÁ؞‡Pà Ä»”Mc?.¡{”ö4—Ý}ÖUÛö÷¯˜ä’ºV‘û-}ž¹ýKßj5*g-×´ ,w„Q£õ²F{ß]áù @À}Ú³gnÙtEˆ²a€œÍ<eEß“¹{`"¿6ôs7/Ÿ Ý0È'ÃÝ‘NtNA«½&ÛÉöÕ«5’'d»ž;¶~W15Üx ïg¶=}l£š¾+ÿª£E),Ð96~^Äg>8]Ú¬äWNoTØtðpô¨Šù¢Ž:?ÉÿLó@H&U&3ʉGò‡Uf¾¸Oê/Ýåšø> stream xœí\[oDZ~W„ü¾qWЮ§/s{  ÈŽÙ±äæƒZ”)!")K–ýût]»j.»ÁÉ“8"{zúR]ýUÕW5üá¬Ù‡³þÇÿ>»¹÷É×!ug×oï5g×÷~¸ðñÿóìæì·Ð%‡Ò´›1œ]|^g}<놼ñìâæÞß6í¶Ý Ûöÿ.þ^’{¥ïöq(o]\•ž·»¼ùŸmØãÇÍ£mÜ|µÝÅÍ´¶ÝɃ¯·»”¾iz|¿ÝõýPž¥Ío·_ûf»ëÊó7_Ô×Ãki?=Íô»m„'CxxѾóey'¦}Zêôt‹Ë(c7ް¨ËÅÄ®ŒBéܤ²ˆÔâ,å·;è˜R,ã¤Ò=Áèi€ÁåùËZš¦—Á:#NS–Ö–÷ú>²(½ôw,Ë]jö}G)nª ¾yCÀ„8àçÛ4ka<,M]Coþ®ö‹p #·CŸ6=lîÊ ¼Wz”>þ´×4³²œ ï Ç3§¹Ç±ðè^–…Ü \Ò íæŒ +‹›· ÚðáwÐëUéþ¼¼öFh±šÞÖ±ïàõ×iZßÁ˯UEÊO©¨ÏÐFÙL[&!§6ï;ÑNs0":QƒÏ½&=®O‘ès íæÛö¤½Æ&Ne>i®‚Â…Üê©ëþà¿¢s°Ì­sWt¯íšH˽)‹ÀW^ón^‘€»µ†]&QJ-Þøõô~m°²nó÷2Ù³m‚ÃÍüTçºð¤0Æ%Y^/¿vô*¬ØŠ–ñíVÎô!¼Bw5/¨¹¿—Ž_Õcœ*ÒŸUÙ`´8àzP®dA}ÕOз'Xg¯Gqp®X„Æ}‘ø“{þ†鎅Pd‡ˆ ¥r%aûÈ* ¿–¿$Ý}¿y +—Ñ@·ߺ¥ÊåX²¨?½ピ†„çÃ?~€!ဇz…îx8ž‡4F5#À{x6Ò¹ß>à!¾áš;œ€‹ÜÒÒÚ¬ÞZèƒÛ)m CMO›úî¯Ô D‡vÓ(ñ9.‡æÆõù5ÝÏ5-Àh¦œë¥3›F#’ÚøBAVÃêbGkhf")(ô¾*­ ¦›_|÷ªÞïzóëOWÚñ!¬šEox<‘B@;$¨÷Ûˆ—@únC“P3ðwq¬z©Zök=gŒÐÐZ ôz—B§*~Çã Üш`P;aõÆìççCМê (Lç‡cÂÍn:5<·‚VMƶzõEI?ÀómˆvbºWsÀðÇÍõŠš¡¸Nʆ£‰ûÜÑT£ü,rSÈ(=*±2yt+ÂØ=ÜðÆ°¨²²ÄœîÓ5¬{­Ê†°ÙãxF‹_,ièò|Ære°w!’yb©x5EÅ„»ì ½¶1éž3ImÍæˆÄ¬öÀêÊ €>dtÁðé?Á0½TÛ±¤‚oሂa!¥ŒX½ÆMƒ9¨zKýù‰&‹Ôò®.Šfë;é û‚©[Ú/_Ë”;Þ¦þ¨oÜúÅ…JI€mŒSðžž—_«ûÞ6ºå¶×>`<áiñZ2ܱÔfÌÅÂ÷‡ogQzDè}Œiz„tÅr1¸|Á>Ù¶õ‚²µr×Ô¢+ç-m¥,ዃ}_—X•ŸÞÐAŒÃh%†šÝ£³õ.\™5©†”D0†‘E€þ;‹ÖÃÃ]{xGPjTwö7„¼­‰F\C×€gè<=¶zèÁÁj4Ô4Ó;†ÿ¶zp3‡®€z3J‡ss ½×ě̈kƒ“T;‘ÑØ£ùÃÉŽ0Ü™1Í=‰2ep>vô‡Í ,‰JM‚~î¥+ î[Zøìf„Sø9|Ö¸Qál„EÓå¦ë-™šgª±Œ 9 +m‘K‚Ø hü‘ÃDÖÜ‘ÇÛ₤M \¤£ÁNF<^É}$ñ"Fúö„¬8Dc†øiÛ‚ìÛ¬ ûNüЀ’Ÿ#=¸~6êy«;;‰ÉÔ‹ïFo@ãaNš×uÓÅi9ž.³ÓP9VÆXT˜btsõGaG½Þ¶Ù’ÔÓ¬S&$sÑø4¿ ⮈#‚ìÐqdžùUéWÔªê…dZ…Çend‹µ“my”yÄbš¬Qi…²k‰€¼§rÕ9³H#.ÿa­‰xúi,1†¹©sF®¸Ú¢1-¸8¶ÇÌ:±ÌWqÖ<ö`ÌRÖ;d *Þ‘=ÑršxÓÕD4]C Wª;ç”å0ìE?’†/· ±;ÄuÖïñ43I#P`BbðHÄ€)´Ã"ä§@~š÷vÙóʯ»m²ž’º3ÌG¹¨ªö¢;GÊwÚSgsQȲy¥*o€ ‡u&´€ý01§¢–ö/ª‰Bq¦DÐhínÕh6¾Ý2›B|Äч9ÑÇjHå!; róÚaF Å®Ñë2—2ºÒÈh${l±ë„ rÉžs(´e‰8dGöj%(&ž : ‰ÌÙËzd†å}ªçð9¬¢aW¢°¤¾æä4`µBo$›¬¥àyêÔÛ½føfDtWtŒÏ_´#‡“È|<†–[Î+‹·ä¦ÊZÀ=ƒÿÎÙ"°üí…]ý(j²Dõu¤ÙOcÆi¿ÅSÌMÖ˜¦ØÏ×MïØš+ÛœZ™‡±Q0a+|È•:µ©p¡&óÑy'îã[öŒ,9}Wç¾õ«:ºòE›}T³a–¶ÆÁ’¿2Ë'4²¡®ŠÞ"-ãn†‰ò™‡$§¯u¿Žƒa¤àÁ¯&óX[U¹mð¡ùt»Ár𮈋Z2Éåâx Ò½ßF8¿®­W½Æ52Àw*†½ÍLï L#…¸áTè‚pÔæ½ ’œ+@;üx2ÔÆ¹Ø¤b½ wŽyÜsÐf6ÇËF´4çc2ÔâÆžˆ;çèE#þ_¹~Ž·Å9šVÀ&™LÈÄ*§%!Q?‰(u7!|Ò˜H<³XºuÜIÁØ“A+kjÄ °õìÎ:b°›2qŠŽ Ä2~EäaG2×ÚeD­›ßÞ˜ðòÕÇ5·`‰CÓûSMÚµ¦+@»¹zÕ¿Z@ˆŒy5{8§3›p°U'œ¡ovP[O&sX+æ*G?L!íMZ2TvPˆiq†oäP«jÀXEN_ŽÌðlò-zÔÕ—#fDH£ž±LÙºò•»P8d*–Gïê†àâ¼ qƒrv“×ðB^d§îVýiFÑ;xg.i¤1\Îß:ß&O’Ò8¤Yª0,þ³6Söi3›‡©CXéSyš0›i %‡;J¹Ï<°–RÜGؘ®­ª @o‘7o­ø¶Ùí;KV—Tusì+Eª¶—¨K1Ä>âjÓ±òªñ3…ÄM m7F͵(Ͻ gÙ˜3þk="®ß€ ‹«=l¨æ?‹{JPê-g—cÈ—cÀä ‰?‘ý$]‚‡Kê§yÂê/)¯[^I¤°TpÂ&6TEfß–À±¸(¯z|ø²aP$¦ë‡£ifd 6"ûµ6U5€õ(£äl—` å…q‚Ær†²#D¶i[!ÀyÄyôÈ4Õ¹‹öýTdþJ|§ÅK狾žÙÞɺ¦f°™W Šq¿ú_·Ëz#ùåµüç¨' 5q¿~\ÉM_“,Àר“zÃê#ïúyž¥F-ÐÒj””¬QÙè–KísþBR¬@rËc€ÀH6-vQ~_SC• T…/…”bHF"PØ {S¾@rãÓ¾¼J¹¨À~й’ }_„ JtdÍB„†½r¢,š}è§ëñ4‚X  ¾ŽdC¹š½!W* QÔš£¢ó«iõ:«r‡u^xgÒÑPà'aF'ts³mJÒw"+ÐÌœÄô:÷‹“tŽÉöŸ®¦Å_ °©ô€w¸Üqp,ôÉסͶ˜¾L= MºÞ°M‹5÷¡¬n +ÇŸ¶ctŠiW1A«dqÊ—z-ùi–™0…”÷Û•ýÀ±AfhR»v·ãÂ]©;’5ï”í)Ý÷ê‘9/#vt+/ù#f…<¡Î®•ÜêÛɵÕ,¾–…ÇaTw`±¢“¾$ãÔé÷G*”2s¢œ9)D¡ ±8ϧrÌ7§‹8ÎcQ¡J™WÕó¾9D§‚cõ|*{m|ò!b>Ç´çóÃÄ|éÙbÀâ½ûš.úin™æ°Lb\Þîœã‡³à„ÿáêy½Q/³ªkš†Pã¥çÕGÊ9НSO‹¯(s(ÙX E Àêñ´QéÚWí5Õo™Ê%N3?ndýÅO*ëÓÌ%ʲqɲA$ùÌÄl¦zXzÛ¼ÞèGª¢PLå:T%©¶Ë‰!&Üø@,¯¦DnÑ|^“mîÙG“‡°<ó¾›iѧ‰;¾¨nø3 £‚›@$^]µ„ó®&ÝVYTÕ!<>j¨Ü=TgœünÑ:CozLÕáäÜY•yy4>söEJ`'ÔÆ”“a:ûçsá;ðK’2OK$ëÕö$r—bö…ËÚ[)ÝIxƒ¢ &£éaÄú™”UðHÖËIïvÅ©´zÈaÖé Á9‡*.éá0…Á“Az¨iàûI$Ckú>çlbÖEÞÊTvÉ7ˆG=…ë~®ˆøáêâNHý|(…sŠ¢ç6b× ˆ¯h,[è†Õ99ξ5Q^Ñuƒ”•~Xú„ ’m9©*£§j/$€MÙŽWµ#”{õ…(¦¢ÃÛ1SDaYS*ù׬ŠÀÚ6 8-®¾ïüê»±~å4ÔðÄh=N¾ eL˜!_«¼†ÍÑÌŒ´»#ÅúÈý`Ê©ä6ß¾qÞ›·²s_޲Së’phÿm"všúæ=¨æ)R_ùœAlK9Oô >³ÿ•ÛÀ >åŽO…ÞI¤VµRÖ¸3a «‰6Õ FÔ,DŸœ8ÀoåÚŠÌgŸ+ôqú©Óz'xq)¦Th»ïòì«3S·¨ç‡+Ñ!YÃaYŰŠ-BG†HoKýØKߤJŸá˜.³q*·ŒTC¶¾>¹{É%USé ØMB¿—‘ûÔJ¬{;ÞÀ¢3f¿ð•#¢ïfÎØ²•¼þ]2Μn°stxE'Ý]r— ·ßOoJRG†é:!$¡Ê§0¹#{eÚÕ7ÆjÍ­ÒÏ“ºU¤9²k.ì´ªJ—ѧH5•ÔÏRI3Áøê>ü®•XÏ‹í4lÄä‘ó¾”z»’|Ú$\á< Ú‡¿¬=õ‹Ö„ÌÆx„ÿ?S»ÓnsF¶¡4ÖkÙš7òþàOÌ4\ªÈ*Ñï*V°.£õ€Û0c ñ#>}áÃZ«…Õ#›ÅŒï&n½Ó9X¥=Eé¹–iŸ8]$ïtݯ€QSb rJÒoÕ®¡Ø“¤¦­¦¶ÍH@~¶˜7Oó¤#][\×iÙIØ€•.–4€×sðÓûõ¯ ä` `õ‹øÁqìæÆ„µGÓ³: ülg”Ò$ãŠÓ—éçb¥fÜû?bàkµÞ¡óì^ý“y nKdýZA!’¦Ó-0p9|ˆtü+f0‰3³óˆ™¹/¨æ(ù°ÏÄ4p‡±º´m <,Zý—ÜHt üÿð+* ?`ºÀ–éé³íÎÆu©é'eþÖº&Ì¿w˜¬¹(m|%¨¥þzϬHf7]³FÙöÁ+^iÛŒ(éúøµ7÷;â×vdeF^WúüÒ=?ÔøaiãÏõ' (ðÚöèìNâ3¹Ù—Þi£¹5¸Ïæ'úüËúü©6~^÷Ì#E»æ€_ºàÇœ•̦jôÝ‹½ÍµbUßyï–ïªËå馔$¬ÿ$.? uΔ#7óÆ«UuQ¥EqÒÖÃDœ·VWæ‡mo–oÝ^ô–,,þS}~QŸÿE¿ªŸ±*â'ì :ÿÆÞ+û¹Âì"ˆÒ›ßV«5·ªõï¢ÉEFü;@ûZÏà• ÔærQÕÞÍ^ƒ¾˜ØµŠUÂý±+èÙïƒþ±ÿzòøïôW@Tþäü£UUàDýQOAT|Ã+ÈPÁÒŸ KE ?­­n~Ô²—¬“•ð†zàö> stream xœíÙnÇ1Ï ľyWðŽ¦¯™ž Y”ÍÀñ!1;Hèå ó)ŠÒß§Ž>ªgzyX’8†¡ånŸUÕuwµ_ÎÛFÍ[ü/ü]ŸÎ?W¦›^ÍÚùáìåLQ÷<üYŸÎŸìào ©ÚAÍwfÒÿÐy#§!!¯ã™¾^‘ó1ݰåc\§'u­#ðà:‰eècwizf5‚ç·Ž%Åڄlj Ph¡«|Š@ È€!‚BgCçÀMø šµW2²#^©Oôö=‘É ßù´Zœ-8†QƒGÕ,Ùã„þÁêxö$<‘ttkœ 炤ë{ÍcÎòï<q(n¼yÁ|abptâ9k¢c…l¦]àïlâë(µÚCý CÓù?"ž˜ðQ—@ãꌷáã:—@l’ÚŽ²(Ct£èD\ÓŸ =€ö ¯ãà÷°8 \ùzi˜pQ WÇ; 8ƒN¬Ž’¹mŽÌFú䊅²U&ɨV}×õDØ$Q˜âºÐ9‹äÂÇS+m¬˜ð4ñ<Ñž»ÏǤ­C¢X¡m%²a]j³[X S >²«a2EúôäG;ö-©:žàWÀƒQ\‰^ÿ&ýfLÖä ²´¡®EË _£•´Žm`öé¢ÉqQkij =‚ýƒ¹ûÜ$Ûˆë%å_@/áL up„VÜg’ :’Dv4³6Cä»5*92¶òàMý” l€-*šC´Öì8H_Ôeɱ‚Ä̽ʆåî³J÷« l͘7ËéV¥½zÂB¯ƒe¤ËH‘È*µ0ìZj`ðCÈb^ÈÖ ³·~uIrÒö2÷¡{T›¸7ÅAÙä&%J> Í±SÒ2ÉÛgÏÉÕ\çÈå`ÐqåÝèäq"Áxƒ6aÁ¼% P¤“j*—4ÙÐ Ç|·4½¥õß'®#Š:ûM¸'Z !`ëï{4x¤ã½yfíR•Ig**¯x¶Ù JêH8hòô#ó¤cF)S†VÛ`N«^PÀj∑ï"M^ðZÔ@çMŠÔY{ Ç’øó%²ÊuäRkCf‘󬽈õŸ£ÍÌÎÙV´œžL=ÏúP-I§‡Ž†Ø ÜLG¡Õ—³GßSÂÀFß³£pDÃbµh#g`84ˆC@“ž(·—C—l-´gƒ 2Ú/Î/ ›ÿqÐ5Ã@r²Ás¥=Ò‰Òú¬ÎÑ뮇;膋‚9[ºõŽA%¤˜nâX³ "mFÎe¯JoĈ5E’?QUYé⨭ٷ³—scÈkçÀ"~n†, üí=ý]ŸÎžlÏoÿmþêòzöøs5{ü~<ùæ3ø³ýtþ‡ÙÖöüÛÍ…J£«°P¨d vr£-å=W+±71I{oÖ*ðøü/¬U Ì} læü D6ƒi`z÷K€ Þ­q%˜¥ %ŸS)Ò7`ƒ°•n  êãÒk¬h(Per„ñ+œ;”Ô2“6Xª±ÌuM0v¦§«‘ÁKv DwɸìMÅ :ÃY„E~ú04ª•ƒî§±¬Ž.hÑ5 P…ß‹löW"‰»<Ðå0Eä.ø»xW”.ø­\Sä,Ðât}H£áO•^”øáš†)°]KXˆÝ(Úä›PJ‹öHÒ~]‘‚7E7M1j”JmR²YÓ}m¦'.æíÈÝŽ$EB%8à!}‡˜–!ðíÙ»Lg.ßPõ:¬øU¹”·ÇB“v”à Õ_õ<ò{R_-ßPżFÛf€3ºÂ§ E8ÅE!AVÉ1SÁÀ˜2¸âQqUÙº¢\¶ß¸J Á׫¬¬öÝ‘G>Ťf³Õæü+“ ôIÃKtÙR+ý WY|,]yLÄ,XepáqÛ ßï×Ô­U¤Vß°Ü^~™Œ×n0kâ…‰0µ'Ùe•ÝÒ^dË" ÂkiFßS%7›G÷þ^‹ìÝîPTßæÆìTd+.*³ÿ7ߪÄÃ.áÓG+Zöq™jº“j?Ïsn ðE {lÝø$E pçØPtÿsÀÇW+ñø^­ÄâûÅ/VF¢RP”íýÓÔ¿“û¿Kß䯭ècYñj¥ÊzÂïz]‘)ˆÌ;±[[–ðiÜð¶ AŠ{<ÒK ï6žú[Ù:áêë*§|’èW}ɰHew½zfB¼ALo†øQÐ@¦#<žª> ªÚ4rbC’õ» ù݆ü–láü‹™c=ÞUqgž>ªMºÌ‘þý-ÖÉÐM»ßé»”ÕÝ(¥R/¬Êô1ma^jÚ½4+x¶¿öã8ÓÏĵÎiŽE:ª‚2p%ã°XWµT¼Ù,ÛÆ›¾‡eûi³îŽVJÛFøZÎ6ÊBÌŒW*p¾ÚR¾ÀCh^,ñªˆjвõ‹^q!¯‡.4v–ªçTÝÆÀ°dgý€azÚó\€‚’Ðû¦·hÞL3ô†Ÿ]ðN¨Ú=ô¤ÏèÎÌôVŒ;ÉkŠM¯ãlîvÚĵ»ÖFP`$Èøÿs< :äiY±‚@Ša6ÊJx*®S™vÕ,x«ÚC îdéƒM%š/|Êru‘µõê<ÒIà]¤z8äzÕÇÒ­{ÖFbQœ,â«TïRR„•Þâ5pò³˜5I… –¥0€x=*‚K…|\C’øÐ¤–»»„>‚š(½éEØ]Ï#c 3çþªõD£r•¢®³¸…™Žt¼€ ÔÚpÿºHO ?õËÌCY"î1Kz>r_&ÅÇW©tOϯe5|×ËEÃ++S]ñ1vñ ݳD¼í| "½ôbªý7¿­µé¹ï¸}òúÇòs~|ˆŠ»ß,Òe\hd›>׊Ä,Ÿ¶”ÒšæÖ”{'a̓oyµV_V+…s÷9c^T@…E%•:|;û/›*8Ëendstream endobj 609 0 obj 4291 endobj 613 0 obj <> stream xœÝ\YoÇÎ3á±oÞÄÑô13=IJ%X|†Fì ¡I‰"Br):üëÓuuWÏÁ]ÊR†ÅÝ™>ª«¿®»÷õª©ÍªÿøïÑùÞ£ëV'×{ÍêdïõžÁ×+þst¾z|M¼‰ê¡Ìêàåu6«Þ®ºàkcWç{?¯»ª]7Uûƒ¿B—àŠ.}WÛ{Ç–_Vû~ýueêa~XQÙõ÷Õ¾]Àó'Õ¾¼ø±ÚwÎÔMÓ¯Û8x]í÷}ˆïÜúqå±Ûߪý.¾·vý,wûº¹z=Íô´²ð&tЈgŽºÏw±uucZjôm… ã(C7 @”r€Ûʼn‰p-οßACçlÇÅæFw—÷?EZš¦µÉà‡iFœ&’ÖÆ~}o™•%÷÷™—û®©{3 ÄÒ_Ö•[_À¢6‘S7‘Ц£‡õ‹È©×‘ðõ-¼<Œ/Ïâ$ƒG6ÞÄNh +÷ëßb[h)Àq~©ò@ðý ¾ZäÒËø‘‡³ëk û 4D>5°63;$¿ŠÛé}Àö¸%¯€À@œKÞHc~é ±A—–šžF‚.¤9P6f,~}SµHa—H¿­€Ë64µ÷‚ÏC=3,ËL)!2ã ö0ø^ Mñï,2æš`ÖEàm@ñ3½18ÙE‚ñ1 Lø9J£­ùÉmêω^9lAñyÌ ‡yá^­[FHÔ#ö™ûßm×Xbn6 Žˆk†Ž*×rpů·%¾Bk×oa©Y#ÀPMƒÈsžÁ¨¿Âs ¦”ÀP­%JáPÖs†œuÈy[Ù@ÓÃÇÈ‘…’í) >ªÂ ‰ SoßÃ0•åÕ'p5ï`…¹S>ytí¸¡©Cˆjä#>,0^p8Bä‡+W#»ÊP—¯¯Ôî2M±1}›7Ư?+ड$€KÇÎÉa—7”¹ßæ‰T5í©‰CÄvĨ‰Ä}ÀGð´Ë‘‡Ýnž­§qÀ„Oßò™9X«ç¨ôÖ:›@‰~Ûv nm}:¢—…aÕx}Â~;%Œ×zTtÇ$Ã#fà+²—ä[$Vm PØÁ×>J x|TœI¼Cô¹¦¯~÷<Â]` Â0T½‡%m©6ÒÏ·hu@ƒu€£è§ÖÐ ÊX™C&Ôäq~-³”Sˆ'Ys)ÙBŒ§}×7…Ï´ zÐ"cEZ#ʺ¡c±/½leÒ Q{ÓYUÛ7hiÒr.I Þ,€ß÷80”ù—ñ4âDÛçñõ_  »ŸE5ÎKÂ8Lð uß zèñ¼6¦ÀéaR€ŠÞ£I6Ú}Xºa¡r›,\2I…ËüXsZiáƒgæÀÛ¼ûm:zÁ-‰EàAyG|—Œ<51ò ¶c áêKÁt9a Ÿ y²X³Ùõ ™µ>r@‘¶ƒ²‰Û(x(•Èk‹„ƒd Ɔ¼ã0`iqEñà(˜ qk>TA†­ïZ±.K“‰Ì§qNÆW+X:bÃB2‹UlþUägæBbÿH†ÀlBÇ{PJk“Ï*²Ú \8o’\+,6$5øY-ˆ,™äXÆaã«ɧlÒ¼©œM8 òæ¼²°[aé «¼Ë1‚b§­9EÚFv¡Ãww ©(Ý ê&DÓóê˜ÑðG•ˆ8dO%Ô¨ÅF{<¨Ð,H³~@Áo³DSÓX=’>ìGl‡õµuI.I½R§ãnmfá<ËÃi{ûÀÿ|òb3‹$*õ&x< o„â)KˆÌÏM‰ìROážÊ›Ü—õ–Ò뜜9’ÖŠ·ÈÎD˜>š˜€dYû„•M>¶@ű(J×2Ë}:o…‚DsFY2×D 2=Û ø”©¶ ì@·^;ÐQMüø|ïàÁÏkS¹Y?ÛÄ!á22ÐêŒ^TéA‰«Dxö¢zõ äj[Ù¤ƒ“¼á^daçÍ]Îäv Œý³ .¼%zÂ7!9‰ƒc‘¨"ˆ è牦N^AåC˜´Cà§E¤¡ØåŽpµÉåV.υЀNȲP¶—ð*Su ÃAÍ›€òš…šo@X„õ/WépÀ'$!àmÓø‘üʧG¸¢\òÒßÉNØâ´ i:3’èoEó²t¦qÑv$Ôå ,vž‚5*œ± Jå …ò(ñ1E;àGÀÊO)§"p É ØeQB‘š(N“êRÃàdÏæ!/³ ›l"` }°†É%Z?`ù<~r°÷ÃÞë•su‡AÉ„°Š–¦©}Xµ¶u ÌùøÙÞ£g߬n®n_ì=úûÊì=úþyüý—ñϳ¯VØ{òlõÃ} ®ïëÖÂ<µ§(€©8ééãñ]Gyñß¡Ø7>Rl4ÉÓ¨€ ^AøLèÒ^"ß3´Ú´>ÌêšArjý¢¨V—£RdÚÀ‘(ípu'ožMô¶¶ÁŒ´Ü–•Œ±K°a·ÛA#'›ƒX»Ÿ¯¤£À3-‚¼m¢…±ÚÀ‚ã´&œ ®5dbdŧèŸð5¿Å~ èÅô¤ñ[îëÉìGqפ ¨‘r°òÃ+íu©áÔnØøâÔ°Þ‹ŒfÓþ˜ü¬üÕ‹3Ò´  #ƒ¤×—e?\S”¦¡èçQzóJ»¤ªyk–(ÊWWþ?¼Ì¯ÒÇLQì~–nrË‹ôð$O”ùv:7æu~x³•Ù?ôlØïJÇÅÂèò1o ¦éa±­éh‘õç ™3¡îd´w …'š`î2ƒÑ9zá¤ØvØi$À«Þ\$áŽ]É£ßä×·s}‘ñ87ñLï/Š1å0?Ø:çôáíoÐñÀ³pV ´t±»™ÁQM10Û–^¢ërüL\%‹ôbDµK8 Zn·ŒX¨*C³°Q9”*ï>Ó®Ÿ‹G0±iAhus6 ²>÷3â…¼0â%%£jbáLUƒÚÚYÜ;òc>¶rH/”\½N£gS ߣæFÝa›mzãåœü[ÖÙ|þ?Ò#‘¹Etß[‚åîJFœù`™¤3óôv¢@¼ (–Ôï$—ÜÇrÏ1ü•½Hˆ)-TNZè'GW6¹{N=ƯnѼœ­ÒEæpœølKµدŸ`}³$¼8¡ò¹ÏiG•;—ÝRñÏl‹ò"uʉn×sÒ¹V2ÏGñ+òÛ™Ç=à÷4Šú°Ê!­n$%$ÒtÉž‡Ï]¡¯8uªítL1ºÐoÛÑŸæÅt‹vÓ:…r¿8]D°þ1Œ.Eh!ˆ¯ò»¦Y‚]â‡d%Ñ!°º²ad£)¯ò?¼#óqô8|l ®ˆÃ·àŠ.'­uvXæHMf>‚­Î$-EiÊl3­¨ôSÈYyÓq€s½ H†" Gµ#“¨¡ [Š·Kâ½és U¶|n–ëà—àhR'‡,`Ä,å¡Í(ž:&/ Ñ5­«³ÝP¶zK°Îa@–c”ïÁü±àg‘¢»dMCB )sX* Å"¶ •¸6¢øxŽ%!eÍñHÒ• ¼þRdI˜ÍaaÛs®Ses¦sÀÀÌâŒ*KY‹7\‘f$˜¿h/„-04Ì•øÛ®3Ž;Ä7š~è?ØŠ½f3/|-¸l¬*+O¼ÉìˆRþ.ƒõºÚÑÚúTkæH¦/Ù¯ÉtGx6¾PL8µÄUËl…ÊøÛ¶ÝÔõ-¨› bd³Ó@^ôC|ö{YÙ¦AÏ1[ÙÅRgŒÝ€ë‰{°ÎóCÜÕ\"¸ÝìŸ̰ƒÕV:e£×ïfôbu«*“M’¾Úúm²›ÚlË5M­_){©Áå bÉ$‰ ¦ô­·¦–œqwª96}T¡ªo\¶£Q¢÷²>)ö í3›vÐ:Ï1ñ¶WÙÊJŠ?Ë¢Í<ŒjòPjsÛQ®)EQ°7?(SœuU™˜b>c Ãai[-µ-ª¤Pë¦hz·v*Â\.›f€}×ð©‰(Dñ-°ºm\øý«È~l65”l£V{R¤ ]gÊôÀ#+hÑS*ZŠÚ0IÿµEâ/’Γí/ÉòÁOÉU3AÑýÁ傿?ÕøÏ·Iÿý$jùùdYIBi!,ýѧz‹±"ÚoIš@žÖ'H[™ÈÁIÝ‹ïÑþ-¡¢È…¤¬SÓê2”ãÌ.q ģʀSŒ3>­,çèåpsá“ZÇ)¿Ìk*M0ÊVIò¤(OÁ'À¹A%]”3Ú¡¥L•x‘â¡À2B[Ôóu“F¶’ý5;g#Ebu¤¡KÞÐáìÆ[ÙSôH,ã‚Ù¹¤˜ äͤã /èŽc×¢[]3šÚMLÍnv\…à+†ãromö—Ù—NBàéÚd€{ÎÙ Ž¼´*É.ëÌWVÅôíÆ¿ÔØ-Õ‹îrsd·û Lˆ¤4:ð8Z½¤—êd†¬ò·ÜÄ+î(õ¯îíë\ò•EàSÍ]h縫Ž5—RÈH  q¡ˆ]™n°ˆ…¼©mr¾ì´¡I\|ñoñðß[ð¸tƒ wU>ÝsçÒköƒJ;q‘æN§\‘^nÜð–ÝqAw|½WçA&–Š#¶ÔmÎ˜Ž¥¹ª=6òaB¿íF®¯T—b´@»Ò‹Ã œÞ3´…Tì›K\¡¸gDí¨Þ'Ÿm¨ý,P•é¤6h׫KwÂ5%=èš•ü–€Üjæ2ølfO«ãüT|F üFßW‘XêèNn Ä-‹/.½½,P¦*éõÙšrºùbùb¯I¹TÙôš'í6ùjJJŒ$w¯\!B’¦úôxG y‘I¥û6Ôq6[w¯u¶cQ墰ì|VŽÓ*ï 2M‰¿ß z=¯yqWÿÅ»¾²?a—ËâLy Bžkü´•CW\ÂèJ§œäN~ ÕT}ꋪx[ ‰”BÛf|‹eS/Žñ þÁÏ?Âq@¿g‚÷-]Š¿Ç]þ† *á»h@Yãø÷0HÄ´µéRÌQÿP_òI_béA«¯<ÍE a»›‰¥B*õÜèÔñM#Q%3œ½ 0{ÿ£J?ìý{K+õendstream endobj 614 0 obj 4390 endobj 618 0 obj <> stream xœí\ëo·ïg!Ä¡ýÐ;ÃZ/_»Ü)P7.ê"N›TmÓ Ųe£ÒI‘¬Øé_ßy‘îr峓öS8ºÛåc83œùÍpxßnúÎlzüOþ>¿Á&ÑÁ£nê'³9yyÄÍf´›!úÎØÍÉåÑß¶a¶ÝÎnGú{<Æ©›â°ý%<úÃîxØþjwì·OwÇÎwÓä }´}nóüû ¹_oï¨1?Ç÷_íâØõÆ»í_°ÕÔõý¸=ÙE#lb _ôö„wÆÛϱÿœÑb#Âa#·¿CZþ˜»œi<ôH/pÌÚœüáf„@Q^œœÁúX·ÙlyìíÔE¿9v}7šiâÏaI7»ã°}N¡õ›£Ïg<‹é#2Î=­èy Ôß#ô€^– ôþz¬"†Ðj¾ª·Ï§ÌÀïvY3 4Õ¬ë¥ðG Û×ðýV0MÛ=¾º"’àõ€¯ ®áÉDd"ýØï‡èv¥éq)¸³}•^î‰\¢ÚZ"=ÆqK$‹HBÚx^x1¨H1ìXäD\ 2ØõCz+œÏãö-°B¤¤^Ð? `„îfû ®9È|è¡©qD 9-{°D«Œs–_?äyP•ÊÃÒ9‘LÝ{ŸB—oÇÑiåÅ9¬n²´Ú½Ö·cYå±q]z›ë“aºždŒ}‡ò¿ÆYÇnQƒè8¡_4-L†¶_Ö´qüÀá“’¨j*7¢ ©ñŠ:Ê6`yË ¾çÍŸ_)¤JðÕ0­EOœ›ŸÒKÚQòGö´à7¤DŒ—O:TéíÔwU×WJÚ•Ì‘³R¢OI³G6s+ÊmK9Çžvƒêsƒ§)–ç›]ÚåS¥wÄÛýúJ̯œô*L±¡W¸3@Gþµs¤àÛïQúowéBÙ˜g¼É÷I”—yï¾@¥v$ÇóÛ›ïÒhûdÉ",ÚlÀ¿ÇiqûØ…1á‘Àj]§yhò/²ý–© ò ê‹v¾V>l„ߢã½NGôé˜,lT¢dAb{§l­À‚Çh’ª•ÿ’iñà‘@ÇmDCoi~/ã$©+;ç•°[ pƒ @¿çtŸÓQ·Cáw˜i.¸z°YdS%K\Ú*ܼ.!StWLñê:¹$ÈLÔP8žú¡ºQ3O›2±%Ç.ôÄüd”ŒgâÖvÆIß'®,P–²eŠšcª1g‹‰µ õ&Ì0*;¿ØÙ ;Š'"‚Á×vÉê1Jï’§'^Øl‘g& +§…òñ†¦´A·€c Q$E)*ù0Á5m²´EU&KæïG˼ÇJ‰0ÚÖ-LRd¼siã&͹™C]µ¹Ä· ,ÞµÿAdEÎL¹amª½'êª'Θ64ÞhÿÅÜ­I¨KÀÕÏáõÏŠžÿœLLà0¿ZÁç-Ë’JÖjÈ~‘Uå>±)5sp•Ý mãMÕMä5~_µ#Éô@Ÿ´Ë6kð3“Eü&„饣Aòc² Ú®–Ée€StrÏ=¼ªhXmNe«’Ù•®k»‡(`Buˆr ºìžcTj—¶Ñk‘±ƒX]Ü%ü'$ËÁ„ü¿>ÇÿáJ‰·üõ.=Í©/2‡c60`Û+Cû²ÿ\EùáE~øÁš™;!-~•5; 9ÅZÞÈÒžVÚšNêA¸jû °W½n“0ÊÖW,LûíAK–…ŧ­‡wåaÙŸߥ’¦¾²–{C6ÀäM3ì\3«>  û)×@¦HLºòŸKM~α|JmˆûôÛ2ªWô L€n/ÙsJ#Oå8=1 /•íKö>!e$ä)jî]®{±×µOþý˜É¿3¶¦¿Œ¨È÷âAmD&æè9y|²@,:¨Øtˆbö½$"júL^EŽ]à¶ô¨•kV€Úcn”8±ß3p¬2 «#S¢±‘ÊÑwCœYeö‡¢*:ìOÈlž®v.2dɱ" 5‰ÚÝB~´˜ûST¨¸(‘;RÆ*ÞÑ ‘1\¥70‰$Îç¬wðÎþ–?K,Ž•‚’½ö¾hP^ï^âeµbHŠ)ÕÔ!:Gš&X×ÝddT<‘£˜ÔH–©µíÞØç¢•ëbõàåÔ¶÷“ÌI ¥›ŠŒ¿ß2lWá ¡xÚ÷‹î#s»{NøÌRäD¥Ú¡ØZ^‰¦XîýsÁv”¦]R*ð‘ƒæº—Àü¥r¦•ïs†Dðd[Øä¡,‚OʾdF ¨¨£; B$èyéï—ý*ØÄøÝ2ÔôÉ ü¯ ¦ã¾72]²—稢¤•?¥Y樞¯¸â ­fÅÿ?Zý?Zý´šêV“25Ðé^so©9-•× ºÕ,O½h ´LtÞÒFµI_·HºméÞH>½­¸Í$™"é¢)ØÄ+JJö=Kþm%î,äÏNümB,Œçƒd2yËÏìá]~KaÁA6LãaÁô·ìV1<Ì[:LjøžÛôA“œtT¾Wqò(ÙkߥÁ;Nõï™8ÜèÙ?/ÒÆÇÃâ$:b´f}dzArŠr4ˆ^ü…8h‹ŒO,Í }øY²÷:'¤À;Täs«©p…9¾–p#!µÂƒµ„[&Š¥ã«ê<›:â<8ÐbÑ!=ßkøN‡c%•¸lJ& †Û`b¤—s4~}Bª„s¥D ¦>êÁXÒzyÖÙ™FæˆYö‚{`ª¶}๾ êX_äÙ¨Ã÷ØŒhËØÝôhVNÓn²nõ^‡Ÿß–pM uæ[‡HÄœL?üAf9L÷í¹eìæÌˆ{–¸å¢BùœÒ”uÊöf ð€ß‡l§æ¬>¶töêRB׎}e³ìhfº¢ ìÀǺ";0~þ¤Jõ@ÒŸœ}yôí ý@E4°yâÆº1à dì|IJœÇO=}¶yss÷âèÑŸ7æèÑoðÿ+øóô³ÍOŽž<Ý|¹^°3³ßR°cÁìO`t0ú±‘«vª‚ÜcëdÖüoÈʵ"3ó³e¡P—L˜|³7lÕ9ñU]m@òm¦ÛáÅ<ñToÌyGò%·¬éØX¸K麅n~®ŠãµN‚ÔáJµ+-•LÕÙ>©ïì,wà*‚z^|KèxPö‡|k3Ëá©W¶‚ö£Û5û޶0³â,m]žBåYê¤NBÕ:¬_ÍzK‹Í­e‰*à9rÊǯÎR¶¢*( Œ9*#í>Åäç§Œƒ*õ»Àç™1™Êû|jÇrTC£Ë‚ù,6æú+©LS'Ü)ý3Y ®êx<´{"qß°Õk€÷±ø‰A5âüg~VŇrâC*BÁ¶ëó ,ÿf×ZáæëÔçe™ê8QµDÏ%Bü!ÑóûŽ æ9m ÖŠ‘.Ëð¿(Â8üP⬵ä7ïyø}3R®] >Á¸ª0ªŠ½Ãx×å‡óf$¾_Œ‘ÕEsÖËŠ€€u/ÑéüCƒ¤Û³–ÙÞUŒoD‚s[F.ˆxæ‰Ð‹™ÓÖÌ!§„õûÖ¿ÓJ&2/g˜íî~ú/0¹qèu ÁÖá¤ójD¦§Tn·ƒÀ# ;.Û1l°’À²°R¦Ñ_R[Àòè6°m´&¶Æ€¦ ½8ü‰±Áô<æÓõÜzŸZç­—èW¢ÁÑÒ¬D!n×ÑwÆLÛß /v°ŸÒèD÷-  ç9‡ï?NÕçüÙš~ädÀh½EæƒGl^ƒF­F_QWG¬õ’< ‡jªÌ¡íðb$G!ð7FÂéB}3ðwoQ®’˜(G©xFRo¹äá‚\'8¼IáÂAç€ì*=Û½T³&5‚à1ѤÍJl¤j|^“SW x—ÊÇDÖ®{ <ÂõnžZï)K®á Ÿ¢éCÓŠÄAÎÅÙƒÔ­Êæ:ÅbțӸÚà‚C;e ¡r:ddªêXd]ÍÒÉy“¶Šòœ±² Ö’áð–J˜¤€£,½6‡ªšÕðMù„fVƒ“ᲩÕ3XÁŒZÉÖ¤~ ðÑs„›šŒ9e>%?Ug$Ns  òK¹°Ñ ,ÔÑQ˜–¬Ø¹ØÏñ5‰y¨Ó 2'ͪ‚.É‹¤bùèhRǟҧ>Ê1‡åé¢Ç¼2@6º®È%Âqtë­cs1Áù¬ŽWã"½3läÀü£‹qÖÈÕc%¶lmCtïS %´B |gÄѰ:ËøýVì8¿JLÿ¦‚ª N–¶²@ëë§yÉf}¨×;R’DR§k5yùXØŽŒËVò…L†UWK>[Â*ˆH΄1õ2Ìöþ7Ib$÷”´.LJû”ƒ£û0”'2ó*ƒ¼/EÄ!;ϵ›9—fû´›*µ]O7k;„s³ƒ] m»Kµ½ÿAê§+zöx)†õ†sÕ«YÀ&Elž5êЗ´•4žÓUñ̬V¤ þÃýGš)ú:§‘2®ëUœ²¨:6Ô[,Ùž*«Ü+c¬x7;mO˜£[]Žás “Í×ZBö}5C@ =,ˆIÊW½ÜhZ”IPܶ ¶¨æKfpšI¾¸UÔŽùææíŠD,Ùíßã$_©|±º ÷k©†émÖ¢OS&Ûoº ùºÞ³]Êáq| z §O<»½ûÛZi‹è!Rkþ÷S¹Æ’(©EP57YN_ ¨ÈkòX &¹(w˜º^üVå6¥dT<ö³Ã«"‡ŒJò»3BÄ$þVá°Þ%<3ž¼xu› b|u}ol^“Ô÷È[H_ŠrÑ¥´P>GÝ0VÝ‚ íx­ê [ÖÀ³J@"c1_©Ý9M–]AóTjvå'D†-:«)^ç¼ôÊíæ]ƒ®¡úšÍ…³ŒÎþ"_åÂê_¹Î>‡ ­j¡“].þY½™r'ö}Q4® ±§ m™‚¤tkTÈF¸œ’‘‡_þ”ÉëK\T7˱zO·z¹~"v&—*÷dÿ“Žÿ¡ŠÉ~œ[Q©Ä&å@ÓæôŒAL2Bôœì X§r7X> 7èæg¿àª¨1š´¯WÚfcÃ=Èáž0Á”2ù)O5£vYïæ]£Ö ihZ9\Ÿ·!µØ.ŸÓ2›æGÔï$…7*Á¦A»ˆç-ìùRvquUA–¯‡¨ròk˜ŽkÇÜT`Šê}h¨‘ö´”ø]è0 £qãó1Zuó¦Ú‚³l@'g ÀÛrýBß É>c_$¬@D.¢à¢\Ø‹H¦ŸVŠûrZ—Hðu>ƒ±¦y#-]›-×ÏêohEú©[+YN—YL¥¡´pŽÑé¦Ôš ú½V7QÚäpÒ íÉ/u²@š|·sXªtU¶Ê+}?²Ìõ±¹Þå´ý,}ÕóÉQëÊe£L•n¨û•ûBý øLb~–¹ø´¨\9 eœ¾=K£PuOâ(f…íÚ¡Ýûr šœP,¿í°FÒ :ÃFƒ"Y–à;7è’»â tFE®·þèž#A1<HP¬ªÞúV®”Ç ÄƒÇÀ¸ã3`™üh…%þ}^ø÷„ýLúŠ-è—/>ßnÒ4ÚÃõ:Ebj€òCÈî!TE$¸!ÿDß3á +° f¯ÝZ“Ü£vŒ‰3-û°üM‚¯VRv:¡‹Þh ;ó gã}™Ž…´@§6¢|!ÔÕ%%­Ë¯ İ*(÷Nb­ðÈ^˜gÅoÂøªoТ_ëþãwšsÝ?þ”‚dÓOG %åvpä1•ÄbÛ8u­SuZÿâÖê]µ«/Xúà ñœX¤¿ô̳jö·v9PÄò9ÜKGâ"ßd½±,ë餲—I¬U`–i®„/ùîû㓌a©tçË£ÿÌb¥endstream endobj 619 0 obj 4689 endobj 623 0 obj <> stream xœí\YoÇ~'ò#ˆ<íÚÕô1Gȃ|Á6d)Q(;‰$¼Dâe.i¿>]W3=»K2’mÄ´\ÎôQ]õUuuÍ7üy»^¨íþñÏý³­GÏ•i·–[õöÑÖÏ[ ooóý³í/v ‰UþÒÂÕNmï¼Ù¢Îj»ÓÛmoJoïœm½œµU3ÓUózç{èÒ›¬K×.tï{íø–_Vs;û¶R çzëf+=û[5׳¸þu5—Ï«¹1jQ×ݬñƒ/ªy×õþž™}QYìöjÞúûZϾ‹Ý¾„nfáúŽfú¦Òp§o¡ÏÓ>Ï|mµj¨ÑÓ úQ\ë¥AF·~D¥|ãÚx!Lƒ³øß”m¡¡1Úc|s£›—û/¼,uÝh…bðÅ0#NãEk|¿®Ó¬Ê\ûseÝ¢¶ÛsS/:å©uLÚPu?;ôrÔvöê•×Û¬õÏpdîg¿TFûvvågš-aÎ?ù…ozj°^u-6Û­¨sh ÚÝÀ—=ø8­4Mª²³K¸†ãÂûþ? ÎögRd¤WW2,Lw]”Jaûs¸sÄMixƒ¢P{j¢[?L£}O/Fƒº2†ÑP°üÒÚ;èë']k§ÍŒR¸íõ^×-‰e¿€ò‹dˆN7Ê¢ºcëã€V2ÿŽ:â!`õ Nø/‹§æA}T噋¡Âª“™nB×+€™sÒ‰°‹ ±5çÏýØM[ëi(éÕ´9¶C”¼ƒàº×t:Pb?b‡Î–Ô4#èA€©—ÑW`4†Æ»þP^½þL+ïÆ|÷¸ <õnaž&ðHfŠ¦ã…¶:13W=Ñ/Ä ‰dzöoXv>¹ÉÜt ÕÊš0}‹1t—­æêð+*?v+¯P ^¨xÕ/ù?G®§âÊÐz`’žÆ0Z‹)`Ù®›}ôKÁ¶>²ªèŒ(¼FñÁ p¿B[[Ä–­imp㽈•`Åï-†½ŽÔñÔÑyaA±´Z1O.¶õ‹l <Ù ÓMæ½æÕ³¿Âxýì«àZy¬SñoO`zðÿŸ†Úá]ü˜ Ðô$":hãØü?ú݇œâ±ô|!›ÇC?½kY±/†&[kÄï.Ü6xû­øòPÛ»J®ÛU8à¶ÞsÏÅ!Ï@~ }~TºÍ:·:–࢜Ÿ-1 úPæž"ÕÛTÒ4ˆ\‰<ì2âÓjü TóCpªÄ+DC“‘Y v.óµë“V¥€¡>²þÚaDGíq°“ð§Ê#û!­"û»ˆœÞNEÖu4ŠèèL×9`XÈ<¦“Où@B޽¿¶èbwÓ9Ô¿Än{WÓ®àažŸsô—2–8F –ZмqG—É|`ƒ]OsÇMH€«ÄtäŒÃæ­CÇÝ%™6 ;ÐÅg ìÅÊKBöf( å!ª0ö2û'[qØm>,…¹Lt´ï`tNãÞ0²5šI·pí'óÈ7ô­Åá`Y5%æs^BPŽEUŒ'ZþQöt|¬\©¼­/9îD{n²íCs³qÓA/Æmž­žfÆ6Ù>eõpçOÂOš,…Œ„7ÌGÏryÎÜ,zã—ëÓ¨»Ä €ð šoÙ=á„/”‚‚Ïà×}øx! éW¼±'ݨñy:NÙìe”ÿ ´~.‚ìÍ¢kk±PðßïÂ8—qˆ›0„¬À_¼ 2^É7jDÒÒCXäì/þ¦÷K‡Š ¯fÐ&WNÌ¡“§<´u:Öƒpû2ï‡3{Ш1{îø. l$ à _|/ÎýWCá2Ü¿ˆZÉÌ ãćñâËécÆu:RƒgδÓnì´.žf{aS÷…‘Xæ½túñÅ“8ÒyIúà 6±5hI.=à§õ@·üÁ~ ò>Çï’cÚ¶Yeÿ55G”ý&Jw.îe Š8hj:\^„‹oâ,¿ïKÝ—™øâ~¼x‘Zk•p‰¶—–D¤háã¬Ö½ ‹‰aá«5ý´eIMÚ-‹xa„£lïCç˜@g6 QoçÉÖ΃—¯ŽÓø€Kò!zŸqàhHl#ÇKø°ðñ:üúMhü$Îÿu¸ø4 ¡rûÇpñq¼ø$\|Q(†IŒª§qÉ€œD#.KᤗóLïCÞD¨­QØY/±îùȤ‰¡Áº‡9;¥Èº˜‚¸&)¤å®?盹ëÛÞÈV=‚"ù߃`ë“1xxÅëj"ê×ÒýiI÷ï&¢»Ää½R§›Ò|²‘vpÈGÿ¢•“èÿ&[O* ŽêR“a÷£ñÙ û¤AüNbÛ%AÂç¨M¨2Ln snwot„ã·‡Ž›Òx—¿::øâÃ> N]Ÿ—4)äw«pB]ò ðv8 ùpE–áÚǰŸdرO§¿v¦Ò1ÙÖ—¥û³Ä.Úcœ"…8Š€:,*Édnü®¡áÐTÌ Èû×åùNð{È l‡_3'óãtõ Ä®WÚÛR¬ù.¾+yU:. ”kãÄy¹éá‘P’ýô8I|¿Êá©wîðk€ ãwŒC¦–æãã……Žb+Õ¡í§6ÿ ‘¹“ù?C­àÿËüq{ÿ4æÏÒËqð›:•Gt( îmˆŽw¥qªB¤=ž24}ÿ˜dÑ!푈=µõr¸GÌ Á=C|nŠG§™øT­Ñ)Ö¦6+_ñ¦¶Ñ¦³¾jE²nšã-+Iè¼ w_Uåž«Æf“]|J'ëJÚȲþŒŽ‘R_áéú%ÒÆà‰¸OöuO̹”t¡ÁÇéÌ&Oº‰˜ä˜6P ?nÆíi™Ø‰Þóls†wý4¢u‰\ÇBÚÙ?†RaÍt?»®§ 7`œO*äÉ´'ó$´#RÑ ³6½ŠµJjœHWU1˜‰rÈT£ŒS©`ÒÛi&Çyto?$QœK©—¤‡GÃ$HDÂ-^­»]â$±®E€xLÇ\A»híÿöÐ]Ÿc¬'ASº¬°O€º!lMÖ‰Ä̵DÝGsÀÖ€f`†…w"Fªi´%¢éò£{ƒ¤Ô2 ´FçE= HqoÅ>ì»~ÒE}K”ðÞ$–ûXåì§½Íü4euP1bNø¼¨^ø ÏíkâuC xpÿ TC$nEÒüÃÀ¦ååÑs‡ÈóH}µ™ÈŸýP™”3Ê+° ~üKHý õnÐG÷ˆ‡`}‡ÆÀk{J“‚Á‘ÔæÔ@კ>ð† "¸t¦1¦*pPü›ÑØšd è—•‹éȗш§´¯ú(ì æ„&"°ZñÍÕDÅ š„v1"­&ÞÚЬ\ ׆X3%í¸¸Š<Î@H…rÖn<¢'°Çq$šÓ)=ø¹´ÊŸª(½©l" 5æ–í %Lv¨Ð(—hž> I1„Y Ü8º¡­qˆ¾Qh3ºFiSvh"B`*†M- 8#Èën°íi†DDè‘¿ tùI+³‚ÒýoDþMy†ü‹ ÈÌ ×#H™‡Ÿ*§£Ëø`k¦sþ„LÖ‘krl ªd»KØG¦<º¶l_‚KÛVò–oüT~…»B\‚h2Ã*… BE̲¸‰.qæeÊÉ«ç ?¶`ÊKt'—‚¿ý.PT3G×$œ2,ÅÄAÌY—¸ôDzÏjÌMJR=ÃcÌFéèî*¨ª¤ÖuQ…7½'ßÔ¾}ÙùéçMxáÓ/î;.|éät œ¯^q §\‡@Á@ptí\z:Z±÷-«GGôøn%(«ÏQÉ¡4+Äñ¹B-Ú!¯H^L̪OÉY f-ÒÖ U‹jÞ5]<>^£„€Ã=<áII}eáËrM^×(ýc¡œè­EÄe0´Æb´ ¯x[Ã=½ú7¬Ê ÊlRšã ޼‹¡{Μ½W1Fu,‹ÅiÔþ‰Ø²Öž ¿Y¹ÊâÞÓguG’-i÷s&)ç“i}cÀ‹Ë·~„Mj¦´°ñÙ[äo,$µržÖ4ò²Ö¨ò“îÇü—*ÒWö“:Wö§ð<ûõÎÖßý¿ÿzq?5endstream endobj 624 0 obj 3983 endobj 628 0 obj <> stream xœí[moܸþî_±è')ð*¢$Jb‹Cqi4#×&›öç X{í]ïñK߯/‡äp†W»k;¨{0 ¯e¾sžg†3Cí—Qž‰Q?îïþéÖË¢¬Gó«­|4ßú²%LõÈýÙ?½š@“¶ÔE™Ê•M·lg1jŠQÝV™(F“Ó­ß™Ê$K‹¤1ÇM«2ÕÖɺèc:®“¿¥ã*y—ŽË*Sªæ±È}›÷ú÷µ.*k¨N^¥¦±-‡úiÛd¹¨ÊäWh¥²T2W¦…¯ h 󨉼¨Ÿjž½ÉMl¤ *¼á»Ò»6ædCeXM’y°º>gN‘ÿ’zJ®m¥ÍÒÓëm3Ø]±.Øg14N}á^°[2ˆÉøf™úÂo±îW®¥î°ª¯Ö‹¾¬U¹ð1¤‚ù(†ÖkùÎÖäÅP6ïÃÇ9*º—JiÔÀ@ðVú ßÞý˜.Ÿ c~FðÞ“ 4Q¢¬Bz™î[¢ÐÛåKØ}„ 'äMé³VµÖÍ\,GxÖ+o‹§œ¢VS»›êOç½È*ðI´#V‚/NIé‹*-£ÎŽ™óá,Ð'í(1d ‚K=½uH„}\@ùsëôîþ–õ?B¡4ø§e¡Uà°íâ áZj¹Jcìè°²ÐÒËT@e7_H;T]‘§×€•ZµÜx°P`ZU™ö"ÚflÉn •©›á?—vú\Ô4Ç‚„ +­¾Ã`0ÇW»GcÉE›UBI^§8ù½M3}›Ó„* ¿Zëûî{çÖÎCGha¶R‘ÐÖJøtºX1ËühL…6g~Z”¯µOÞôž é` ’‹Q*ð*KËŒPóðÆKþ‹æy „vâÞ†Õ[Ïrj·nYÂÂ/$¬­ã4ù]ײ®°H;¨Yék]Ë¢…´…U6µ (Ì‚ÂåšãSvù»t¥{¸R3ÔrofaîYúVic(¤g±Ñ±™CÅ6kï¾ïÞ´7+^˜a•Éî.ÿOPؘ-|E5¬¸ 8ëSËTPÞª4†ÙŒínàÁlHî' d° µÚÏÍZku ¦”Lv/qXg…ж;áÍb“¥,Fç)QÔ6†¼¶K°Ç´ëgÖbVêÇ´{qÛ‘ªÖ’DÉŸáBHã„™ÓÏÜãŠêºL?A&zÒPñA`ð{Dº¡›ÏqpÈÜDkš¢c5n|W-=Ë¥("Œqû ƒŠaÀ–´+¹ Ò´º… Ï 7§ÆµÕoNHA£àuH.ˆì[ÙU_½ô +íx1̬·X‹aZoÝðÃ,ƒgK4ôÑVC}â¬+‘~~¡Ì‹¬©ÍQ^y¾G~á2ńžogFðÙÛxß;¿ÁÐ:ùì<ç¬Á“ËÈFšc~­ÄAU¢Ž?G‰ÿQ¢µ¶Þ"„‡^¹Î#©ñ¹ ö¸:ºÆŸa‘pÆ´V1 NÓ0³H®UjŒ‰‡1Ù^r蘆¢ ]Ä:}‹ið æUš¸ÚSPË”•’E³@î.ÕÙ¹ÕàŠO: ÆG ŽÄ–¯lÕÌ.aÛ+£ªl¬ˆVú,k<4:WÉ>:þÁ1ÑW&šß9DBªakÒcý°= ïœ 8mƒ?šìcv‡ºŸãM]µ:>™7QŒs׳◱^Ä­ä„ó­ŸÝb0„îëþ »ågz?»†<ÂGHô 9tpÚ;‚GN,·6*é'–9Q =j¹=ÊhÎð(zț譾³~‘'LCs ÊNY÷NÒaÔ¹E/ UK“’&›Ô´ð.· ¿6ÌN Y¿È4vÃG\åïHÀ*?Œ:¡ž©óǤNxëÍ|Ä5.2òVlÀ¬exZ®ïÐÖOb$êÜ~¸Ë¯ƒaèÝÃVéXkÈ3ïÄZÞ-ÖXðæ|#%W®mã¾4T_¼ËnœÐÜrôú˜¶/Òˆ]ÏAßqZvŸ‰¥:îL8/Xü–w韩ôG«øu5^ñ'Týž:}ê ÕyüÕwc Øo T«ÍK ËíE!›~ž6@[G’lΪ¨ùŒ×#E¾ŒÜzõÀ…v7{ßòˆúÜ·)¦.¼ãíMEs¼…IÉ®«Ç1QÜùÂÛ˜=b>ðŒ<çðŽÕM¸Ì¯ç9Ü!øî‰ +DüP|%éN”Å,~¥cóà‰^ÌÚG+g×{‘Þ+ƒA™8æý„óõDGx0SxC–à¤>¡gbWâ~/ï?PÿJ¼Ë)dê@l–" óUÔæVe5Ë»Ÿ8¦+®<~AŒçà¤ä®9ñn¦BÂ]a±.¦çœý@ñ(O'’qÀ¼â4†nô‹Nwä\°08ÌðGÇ>> Â燴ó’C)#B°RC#™G°1•òelb¢ßC³rݸB£“àëw°Ùw÷Q¤ƒá©NƒBæü0vY¤ºß,Eõ¹XÓ Gì÷ ô*ã êWeÛë‘7Ë‘«ø1MÚ ½¾ŒªÕ,¦€ÁѺ¶ŒkŒä›#Ì)†Äîà ~t³eŸÝP¶›ã}»õáïãQ!Àú„­,úèŸ{¡á‹èÛeÀ†xƺaF~é¸Z߆Cµª¯yg9~«˜½Á=áPbÔ2Á%ÓIÞDZãnÁ]X_ã¬y4 Ÿw1vÍc…QW5`*ìQ î½Ïo:pöŽUlºTLÒ6¦°™ˆ; cp†…´Ó/1 ½¸ÁwØßûÂÐ9v…Ì7œªºú3?²ù¥Æ7“­êŸÿe›!óendstream endobj 629 0 obj 3031 endobj 633 0 obj <> stream xœí\Is·¾+ú¼åËïy°pHª¼VìxI,Ú—8•¢DKrI$%Q”,ÿúôŠeÞ ùDñ”J¥l“3¦Ñh|ýõ¼<wæhÄÿÉÝûäGãâÑ“Ë{ãÑ“{/ïz}$ÿytvôÙ1ñíò˜ÍÑñã{<ÙMö(&¿3öèøìÞ¿6q?„ƒS’ë¦LqgÌ:>…‘Ÿ[¿ùÛ`v9'Ÿ7Ÿvóak7ÇøüËa«/~¶Î™Ý8N›‹ï†í4%xç6Ÿ ž¦=¶Þ[»ùºNû§¹]Né«Áâ›q|'¶s~€9ÖíFxÐ÷ „UrÌ…²( c#¬h á}~3>â@ç,¬ã`¸ÃÕ]ÂÅõýO Ë8kH yX¾HŸÑÌ›&+ªtÓ‘ñ;ç£EUnE—[7î&“3«4€6Ãä-Ù]ñò&¼ÆN»èé³>Œ!n^£Þæ´ù&»yN?y’gøÓkØØÎg˜ñ¶”AT‹¯½%]”ï]Ì œ¯ÌׯuÎëë_áá ¼¾¶ãÎY]höÚ ö[óiËùöÞñG¸9nÆqŒhã.9°ƒˆû›?¶SØÚ¶ß¼_  ·)XܾO6GØmú+n $‰Ï×M~óÄŒ0 Þ“4y¿y4Ø´³ÞM›g0yJü ›0;`¨@fœÁzÓVÑXàjø K_4r–¡¯ñ}ô9{‘:§×Îùxë ïøœTUýe´h UUdÜOѸqo!oÃ@‚€‡Lÿ\ `‘oq^ 3¦Íùz½¤IWõ5D™‹{,~Ac Ê#ŒO¤+ÅFË~§(ˆ»ÝÊv·cÞåÄ»~68KÊ+oÀFl¦È*öAúG-OxI ºDä©8ÆO4­á‚϶ÀCø™¬×l¤±4[x–ð2ÈÍÏ@Ì+ n›%š؃Æs³?aóg6©  ëMcS`8xZ«÷¥Ã½±q9‡ ©ê ½â•F’K,;¤ÎÜtŠyÊp´ê»Ä´£z»-WÄŸ 0T&µì‹dBw~Þ[6iÈÐä‡|-uð S‚­jM.59:‹óªK0LöÂzX(C¸ÂQä3QÖ)íÁY–M–ÌN¬ÕæLëÒZ8o\‘“ä,f½/™ß³O>.™}ã‡t×MÐfÞ­ ™CøÁõ_ón:tÁ-d^þÁËÎÈÒ.ªÍ]0mR¥uÞ®¿fbH¤T¹fòˆ·«x2iÙ£ï¶XŒ„÷iú}H˜Ùø”Lkǧr,pYqùf…1ú’ ,Ž–Õ T‘ùà×h´¨CVdY žÊ^éðÁ+Z7)FØH‘§jO†P<­(`#ñ>5 ¾îj˳£Å‰Ï“OZº²qó1øŠ­µss¾]?79D#—ع±fšëaùDzÜ7VÇH·d¬dW¸ŠBáq‚gøl æшLé¾ŸÉªŽ¤˜Îˆ;füѳ£Àož¨@—ùÎXʹòj-/ªã›½i°oŽ«Æºg  Ô̼'.R?V=Jò°X:[BçgYk½9’¡¨õpCÏi)ˆMA¯%Ú`UÈvñVûD–Rnµ05½o㤑–m£*zöw ‚Xp&4 w¿LbϬ/f‹®ÍŒ„û&Ç;éÈ»£§g¦3çæuà iß9ž,ðÓJÊ%GÕCx¡©Ø«Þy“éΧDÂê e%Tl»ƒoÜZG|R¹ås?Ôp±p-Žk¿Åal'|ï»A½û—m¬9ޤ|…šÆŠd/½ël)“zšˆ.&Ùž=~ï| ^‘Wé—źjmO¾x[U£ú/†óê³äáAGýËqw¸›Ì TÉÇ Q-c|ÏÙÆXA„É“·7¶·–^ ßÝ—K<‘Ò‡¶¤ŽGW{«ƒ«×Tÿ r Ý!ÑÛÓ½aó©®2v(*®VtÔ£[Gå4ß×.‰‹¦Î.™…ºÅHáí 5ÞmŒeÄ/¶LìqI”²za9$ÞHÄ*é’Pl;˜P3H(»wû!a+÷ýj­%Ò(Ƥ!?sï¿2À™i—R±Ðs\‚©ÃY{œ H†—ì~O¶ÀFÁ[ª>ê¼l’ 7„wo³õ=㢨 Æ·˜­½§.ð¶ GP!ö¢yõV/‡gÔÑ|ïŠ+*‡‰ ¯X—'Àɇ™ÿ<áà=*×Ö\ gppÑ=/ÛÁF‰y øpo4¢.t–‰Ëîߘ?ÄŽ»è+íë-~²há뉊2XWˆþw‰f³­@,žq¶5¹fwe¶P˜ä; Ó¤Y·²ÏÊÔ^Ôï%`ÇÂŒö]a‰TñâN'œ´4F.ýÃæ‚לIHºÃú¢r¡_è”%»æ½}XDÁTmÀÌóvD]Ë‹>”EAMÔþNz¿yÒ|†Õì\%·Ï)_e9KÌÂk>­² fè.ìcÐ »Ô˜S=ú¢˜@Ö¢ã逪Á²¢žà¬iO¹´5¬ X`ˆøÙ]v~ž?{€ã&²tÂöŸ1ÞÍšÑÀŽÈƒ50ÔD„I¨ÎD…Ÿ 5ŒVë:›çƒ&7g“¿/PD™Þb°gx`€Ÿ{“Wœ÷E90w•åÏIKD ²‹è­Sãµ.FmV-[ƒP#Æ£BòÍaÆåwÖ·îLLh¶Áo+œ«O…(½•?¨O®|sŽ3«ÂoâÆ¬"Ûè±F ;H¸ßµN……)ÒÞýUR%܉v»NéäNõŽÝŸ%¤:ÔÁÑm.Ó9½}{ 0)Œ÷LŒ´°ÑþÕ¡\ò6ñ2­Ey(…©àBï¼èsŽA_v¨³æUL‘km,ø¶âF­ƒ˜Á-–KàÂf¼©m%²c-àrDEǨprÉ%^ÑÁ”âŸT¸Ÿ’£Ÿb—£´ž…­ƒ»ÄmþÍYÑô°€^ÓÄôS&n³œ­œßâäz;'ŒcSì-¥· Á‡ÖFJ]¤Í´Ë"yOãÊwdmn—Pûªø ­‰ÂE¢LN.ÅŒQA§mâ¥&gÂÈÔ½Ä!ìßHñ}‡œN,õ¶lËÁ1UbÑ—ðå÷Äí‚_‰föo¨÷€áëék¼œr¶SŸóU ±˜÷4¹@B£lÛBÌÅLhŠ«µ„ýHŸâk KadK&í1^ðkç –¼â*Û$À9é£âB,%ãl÷YÀ/è$#ð¿¨qŸ M¢‘ͤ3 ˰ÙE‡Þ]tˆ`œÂ~tH$VY §X“×÷[ú&Ð=sÍ[A¹Ò´Ίp]G3ãçmðL5¹tˆÁk)#‡¬†µj‡Š—r£hîÕ0Š´}º/´Afêu®¡üe(ï‹sr&·®‡Ò•SÎØ¹Áú ‚K0Yiƒã7ˆ8´'Ööð×·ø¯WýÜ¿}T?Å_Ÿé¸GÑÒÄE¾Oà{n,ßã9»4š<|T>+/»ô¤…Ÿ±¥ç2p¶óÝ”Ùí‹ç²‡0r…î£òúE?¶ý± „;óWøÑŽ´8¯²6 ýhAìfÕ“¥‡W}½ŸÂË‹äÌδçk#!? ü0Äl«’m–»ƒÈíHZÿš²yCÉMm†U¾&1Bò šR`Ñ·‹¹Œ¾Ú¼°Ö :-jþn¹êwv^ýûõP€~¦;Ê7ؙӘ»ìRWty*ù„B óXÈé"VBý[œ;í¼GŠ+Éɬµ„Fú²ø#®G»Ìgp 7ë+T¥Z”ØwßÌøa(ghµ¦ù\š=¤* J0å¤#ÑKL;­‘BÙ­]d¶è‚’¿ËTfæ ãBŸEw}s¾Ê®ûîC,¶°ÝÀ^½t²¥ÿA^k¤ƒ™ÑÉTÆ©ÜÔ;¦’Ò-á) nÚc.xé¥xæ6eõyC†—4×^C†ç êí²«ªbÜNÒ”ÞV­¾áJ&ㄞ­¦­Æá½¹.¸á­ÝÐá=S’kâÕ €þ:©&„šU<td åè¥Î‡@`í’@Ž™àRÌήæ–B‘îˬ–'L8; ¿XÏ)”åo'›x(1Ý^Ãð0ˆ÷ñCÞUa>¨hʳÍh^!fnæñ•¹‰æ]•‡/êÃJ"ŸýŸæBóÜa4ïgd%E ñ}t ê»ôQ¡yL (?„ûí³þ)JõFÛý‹†‰Þ…Ö6̦ÐÇ>b²Ñˆä›Öd.)Ê}qÓ¨As'.׫ìÎSC6sŸ·»6ºC$ŠY夅¡|š¶ÜZÊÞT0“ê,=Ï+tÑÁ ÝŠ«ÆäNá[ÔxÚTŠbï÷€’IÎ|ÿ‰Þ5Ù2:.Ù²ÑÔŠ}X+xüÌ­Ì›ö‹œÚÝa[ÖxɆ‚ão(]ïÉ5—©yxÉ;ݰæíÛ¸i="/ú°z&GŽ%Ü‘»ºÈüÈ]dïÙ½á] mZû°v9ÜðCîU+V•¾ ½¡ÚŽ©·îM~TI.J“}mÒ‚†‡ùË,ÔöE'ÆÐ{1£UЋxŠ0Kó®a@j“kQA=lé Ý5‰ÎZŸy»èj¸™[ëÝOëþf~RºH¤j²öæ"IíüÃuf•F…Íà牂Â1þ‚c šÆ«/™˜Õw¬H&,ÞSvåµklÊ«­_‰[RKJ"’g^v‘Å#áòä‘tŽIãLÃ$­×ÈJM{oj!Mô3.èg-g Ìå=S\™ÁQ÷Wúclš¹šÃS×X3ç4ï,&Öe»æ%X®é)uá&ß15l£Xi…yEË_—Ý”â jÛºú÷>†^µ[£f9£82ýš³TKàM:ë“NÎv*%ï‘0R½Z¾·qQ7×?> stream xœÅ[ioÇÍg"?b¿iGÐŽ¦Ïéq‘-92¬8¶h†8Wa.)K”æ×§®¾æà.å#¸šé飺ªÞ«ªÞŸW]«Vþ“ÿOwG÷¿QƯ^¾=êV/~>Rôx%ÿîVޱI0p«ºA­Ž_ñËjÕë•¶Uzu¼;ú~í·n½ôÿ¦C;¿þn7»~ÜlôúËf£Úavàïôä»fct·Íú›Æàs£Ö_á“úå¿Ã·‡xñ´ÙøS³ªœšu}Û˜Ýñfäa&0+niÔP¶ÜXëZVÓµ½~ã f²¾À«fãÔ@szßÏä¦Y¿…¶ë”Zÿˆ__âÇóô”îâÇ+üø)5Æ×Öïðc‡÷aUÁƒ„z¼”60’F逨^¤›/óÍÓtó§|3Íשá.®f£Lë|§yY?¬qÈzŬòƒsYŒë†¶Sn}7=~]¿÷¿Þ“†]¿þ \êŽÖÇ .f&ˆcÄ›/çZ>O7·Ô5͇o\æV¥hx¦–fš^-OÒÍ«¹›oóÍ<ñ]ºº—{ÿ5×e‡×ן׋ÃKk­Nw$Þ»¹Á«÷Ùè΍éÛüÖ»j‚Åúâå.·½—îbŸct«ƒbåqC¸Á&îFK`­¯-jNOhàSLÕÙÚai¡ƒÑt`¥Ñ\cf-[¹v@}–“€I¡MX’_Ïnc‹÷@ÞÚ$e˜™v¬£§éq7É4±‘Å[hƒN£A±BàäYH¾_¿oœÁçúq°còû÷Hç ¥‡«¦PU²]Aè6±Ùh:8X•£ \Tê'ŠöÖiüŽ“Œ.45¡y:·´íqø,tÆÅ7ˆE/ã°Už‹:êñ'sNJ¦ƒkƒ"'‘xòé8ÊÊ9ê…ö» §ï5,3vøßÆâD,I\®h¾´k:§Øô*]Qƒw¹»ü*jý«´îÜMÉn ÃBCÚèm`îšö&6{–šáZÓëd&º·à[ÕÈÇ&ÝÁÑAñÐC^tY‹Œa~@ŒÃ‘Îé/Á!LÃúpk}ÓŽÑÒËûøÔ”¬s#u+1–‡®†°î\F…ä‘I‰¹ËÂê¿IVõU™À<î‚&¾¥6ûÞçé‚ÛKüئ?¦Æ5×8l{GBv¦KƒNÐ8;ð%Ì(ä& ~—&]¡‡Ðˆ‹4ýmÆàó´º iŸÔ”"ƒ–€ÆÙâÍlâ²B¹ù:ß<ŸY)Ãc #èŸ;|5·o*<“›'sxzšož53 K¨ÂwÿT²Ÿ)ÈÛÚ‹JÛüa ó(9£D‚˜àM†€œ¾ Ä ˆon]êptŠŽ¿Ä¨ƒñfŠ^Eß„[²–·h(2kòpøn†–‹Òí ±$$rG‚ž‡fÒó^€ÆNb9EK€¥û XU¨ãб?zD·‡ŸØˆ¦é W!ICAˆK,£‹5‘„e„"PðKã;’ëÇ¡í¶›¢ëèþ}PÉmüZäxxœVöºÚã<íÓ6[Å^èÐJѾPìø*mOã•–F\ºëZ¹ôÔòp›|´3¯}4ìÊõQù(çZ̉j°¬UTbã`Ï•ImiÿÐÉÛžî ðF ÊjS(%µ¹˜SÒm™i½¬¯Æ#'b5,z¤$(íh§÷ó–KÙ:kÉWÌuòB@*jf¢i£ÏJ_qKÞPãé P:£šmçfš‘)Å,^nÓÍçùfE> ƒÏÁû6a½%áíã%Û½=¼Ä©ÖÏ’’Ìj°Ft±ÞI’qÃY\âî÷gÿ‡œÃ„Åì‘þˆ°{‚ù·~¥À±8§IϽY!kÉñ·k6]«:@@tmXAßC—az @b£”¶­€¾€ÃÒ0 v ¹wa†| {¥Ðµ¼\~îºõ½×äpMÚüä1Ž5h<²Ê4ÖÞr0XŸº‚ü[xÞ÷^r8:ââ­ó|YÜçZ BX_ã¸]ëà­o°eÁçâ^¤å¾£9:½0/Á(t à»C°¨ª5ôs–÷ŠkLEyt|÷ûj(›ýØ¥øA¦7&dè¼Èî%ûGäQB6\éÑI&¼B°A]5š\Q¢~8¦Ü´~‘UÒWápäfó$0ƒû\ -‘MIx#0|'ŽJPc>ercÏþ(Òã<:ÊNPè)7E9lyâ~ìsJ*Th¿q5*ìj3ü¦ V\ …Š8Í€” ´€’Bœ?æ6¹Yì*?˜Ðh^TÚDøº”_`IFSR;˜¢£¸™ó±Ljߌt¯+þî¡]°šT8+Püîå”úS¢àPfH“þÚ ?zHì@È0_»ÆØâC£Q4¾û#C#ÖNDÀû)W' ah“LRP'jYô1U#™øžÎS‹Ó¸,U%Y ÑÅž†û7ôóÓ;`>ê[%†2T¸Ã\™æO3Ûuh H*ØJR‘ƒ‘n’·[ØaS° UXa¡hŒ˜ÆU¥ÖœàŽº!oÏÓ€e bŒûâ^nÂM¾‹¦‹`;0´ß)}7úÃã‰üá5FÁø²†ÓR¸ÓѦ]ië,‰?9&ÜOÒ0Ší`§‡¤cVi2hžEô ßM¾¥”é“´ú'ñVz§™7}|Ând ÉŸ4ºôšÅ%±¶¬½œj7YŠ­Æfñdã=²’PÆ“ÛbWK‘äd“¥p3¬`–·Úè³¼cì(j;K¶÷!»ÝWsAOH¶ßˆ¢X}Ι‚³¨Ô`&£Ä¡`ÉÈN«¨í¬Ú ¶v˜—XR s$#ï½­ ß"*™£ÅìŽ|†Û~Ùõ$çÃ52ESh¢óÁ ÷Â(§Ú>e8z$P/¹…]ÆÚÅMOQ±3ÒŒ„$åS4:O?ÍJÒâ+¡DëJm¸¿àáÙN½M–b´äÚóÜɶ´ñðTý”¨c×@w0f‰Ø—ž…ª3S7–5銛 LD?*|’" W<êUäД8à€u¬J˜Þt #!cÕ©œ¥9EVcÕíKtHˆõ ¿²Þ Ãn‚’MSrœ¶meÄr‹àL͘A :®Ê?ÙÏ$i0Iô3*Äk–‘òeN¢r[±%*à0UŠÌú‹Løs.w2;Òx¥5=Jžå)AÉ91SÚ$qÁ£=‰ŠšŸDU}^§ksÒdYKˆµS¨t£Ë²õ«‰ßVACí.*Ç‘r%£¬wÊp8£ËvÞÄÅn4&»:)¤Mì™å‰Ñ4#®Ä4ŸgÛ’òÍò:UV£w1§ì…*–ÜàSÌÔú”'D_”ÆÄÔê¼ä±^§©]’A€›ß°ø¶¥ø,gëæ"§“ 0¢N´œóF7 ©Pœ öû,–K£,“ %“´f²·Ñf–BÊéÓt5cFšÔ«§pg.cxC$ÃYé°X5œ³ìlˆ-ðQ)JŠ=sôœ}EÕªTŠ‹›hSa5t>Š ¹hÐ8°IlJ¶½`.ÉKàþš³æ>{kGK¹Ž±Ì€"IP­TÁ‹<:·ö§ÚÚ^%øÙ°+„Cñ‡½WÔh.Ø—GÏË\ù)yG 1˲çoVdŸ;ÝFYàëºñUj·Kí¶ÌÃÊ$ð4U¾ÿðÛ4źmÈ/…»¼¹îsè’1^>ѧÌëkSE]  ”/vC‘Þ•~y>>­Éì}ió<Òõ\îºó›jær>ïðîßÎÍyvë“fq!9Õ}›Š¼¾5G1½ªi\ßÄMà=’È271~™›PšV¥¸ü°GnåÁÌ/ÒÏu”ì6~³ôE`5&É·È– OŸ¦Käã» ¢î'Ï–#JWRýI|+‚-eEº§rUÖ vuœAÙb`ZDÆ8˜¢ÏÏ%ÍuŒp͆€ï¼à¯|€8CãÜðúYYýFÇ­úˆzÊTqQ­> Å#°>Kç3( ãœ=š¡è_ oÉ}ÉS/FddYCmî–ˆ0ÈQÁ·nö¨F¦4þÙŠM¥hÓ„|Š» KL!~2yûÂ7š®n.ÇW.x…5±˜‰+êY Ì57¸~lª¦ª¨/|1 ESLužkŸªÄ7xrE\)Éc‡ÔÝÇ–Lu`µªêÿ®JNİ­í2×RFÙÒÄRÙ$•UêªdÅ*Õãº,é|éýLî]ȨœuñK$)0.ÍÑñ4ÛÓªâr΂&aÑÈÉaܦXÄrRí^䩼À:µZF¥qí1›Iæ\•gººœG Ißæjgñ éÂþßΟÜúœÆïL=¯¤çéù‚_H=¯õL]î;ò‰¤ÓPl5:hÁg,ŠZdöYQåò }üÝ…úi£êH… ^Wü"¿4R’ÄK¦7³\ÒèûÏzürV)7?ŽTšÃH%Ѳ’Îl°,Ÿ+Ú<Î-0¥hÇI Óq¬îª8£†(_H4e"v̵&õ˜OݼŽ)žcÁÏ^…ʶ,ËÆšT;.^ÄòÔ4ú‰¥ª–Žä«Qt ²ñdäͧ‚‹œ×(è)ÎŒ©*®µ™Jkä@ïÄ! ú/;$®“ô‹GöÛÈqïé~ËL’Š~h¨àŒ^å ·ýÜ/Qf¶×¤SÜ¿E´,ûËÇH<þ^4Wt •ñÁjÇpRT•jGGŒr+ìðáñÑ×G?¯ätA·‚õ‡•uƒÅa,øsðºÝüduõæÝó£ûÿ\©£ûÃÿøþ{üÙêG¯¾^þíîúä·»Öküil_ ƒo;Ò¤½Gt}¤ªÊ×üÈlËúÔ褲7“#ª¨®ûŽÈUÙ¢ÇlŽA˜ô^狃'MÎæN\g6C]§˜Ò¸8¸pŽlUóÉ‹3™À!$ „Í“J~}ô?-;Rendstream endobj 639 0 obj 4081 endobj 643 0 obj <> stream xœí[ioÇýNäGð›ws4}÷ˆßI;‰M#0âÀ¡¸$E„KÒ¢HBþõ©£«™Ù%)Û9Ãàj·ÏêîªW¯ªÛ?ì½Úð¿ôïñfïùWÊøý³›½aÿlï‡=EÕûéŸãÍþG‡ØÄ*(êÇaTû‡§{ÜYí½ï£í•Þ?Üìý}å;‡ÿ8ü#v‰¦é|¯#ô:\CË»»ú}§úqŒv\}ØéÕ_º½:ÄòO»©øª;0FõÃVﻃ"Ô™ÕG¥n_wêµ^ý¡tû»™~Œgú¬ÓX=6J³`Ǻϟ¡6ý 7ú²£†0ÊèÇ…Ò( £=Œ¨4 aÍ¿”õØÐ ãhnptqp©ÿd§‰‘ óŒ4 ˆæ _š·Ò¨±ÞÊåmãþú Æ‘·ôæ]]âÇè®FÚ¥Sü}ž Íê×3ªÕ÷øsG¹ö?´´£2nü>ÇÓü±NMdcun}“ Qz ßQÆØ.çÍÂ~·Ê‚e‘õýãêm…${Ç}Ú |ø‹kÝàï+©á>•€¯ÚFRªó\xYZVc®sýQ©ÛŒDb‡Õôuuœë^•GõNJ‡g¹p½Ô²’üdak'§“űcµw.ìY)mů4öhVŠ_ogݰíw]sä`ûÎ6 kloH À’ØÎ¤¶hÍG5©â LÿÍçqH+ ƒ¦¯@iŽ pGcnã8ÐB©ß TßãH]R_’Ù°¦9êaÆûpYÚD<‚+ýê·ØŽÕ0WŸƒånÚK­o ÀäÖ4/v¹ÌØu†ƒ‚^(‹¦‘Ú½M¾Íùíì×4ü"ÃÛR”ë>¥ãaÞ+\}¼èp÷ èbÌ ¼a1ÆÖ‹y3ѾÓG¿Öžh§xU!¶‘?\¨‡ u†<< p ж§²Ô4hÞH FGX5äßï)ÇÞ3Ô¸1–U% Ò8+mØ‹ñŠPçHT -ÞrI Y”&³wfu×9ô,ÎRŸ Xß­¨¦³I¹î"Mû;Ù’V øÕÓ׬¯dD/Iª¬ø8ͯeM'-’È»4259çó$A•‘=™ §Æ™ƒçÅceµ!dBØ¿>+Ñ£à•(Òi™8Ù,{tJ×*&6b¡Í¡¢”ƒU´éE§1ÍìEo’ü­“Ê&“@æ„á5ïîÚy‘Ÿ<îñH›¹ºª7®q f²ßÔ ©iÂUVÖ{ì4’†mj÷’Í@¤PÑ“,­§î„j¼FT"k~Ò Æ8qÅh/+É^M¤Ÿ@„×Z¦*/aâ²®?pdºÖ¢÷ÐäÒ-A«I—³‡Ä ¯‡ ï:$³ˆØÓŽ;€+!Å ¸‰ŸWÚƒe—›*ïI‡4D1Œ¢Cç„®Œ°:Ðæ¾Ä³a¡ÔóŽž,¨WužÔe'ÇDXZ±Î‰·³ï-.wþ­Ô~’ç.ßf>q Í7ñûš5½É“k7O&ùoR·_Iþð¨‘ÊôW g.[,…yöÁA‹k9/õeõ·ÝBLp2Ÿ‰ym{NDþe)½hÈo¥«c…vçúLÖËHW¨òu݈•Ú2xÒ8-s[T€uÖœcÑ.^ò&kÓEÖnQ@¤*>ûßÍvy´TØÆe©Ã2þúè¨Ì=.*Ã<ˆÐ¦¿¢vd¯ýœCƒï¬PaÑ vó´vÁk*_cבlä´9&r/›´£ã8÷*vâÑ™´ °gÖóF?:6sXYÈ%¦ÂÙóa¯Ôg#ôV±˜˜ìJ…^¹ììÎÒÎ*ÓRh¢{Á!ZáÊOœ Å¨rð²$7°Å%NéüŒÛY#*¹­aZÊEW¤D‹%«¦®Á\§˜K8ös!ÇvG´4ÅÉo‚ºú¡…Q".6‘¾˜oü§‚é:˜G(2Ï„ŽÑ1Í–ñN‚.R#czmE‹fd@WŸu¢S9AšZ~Í’¡>?!¬«â}ô_¶ ši[R–°%Í×E‡q&V^ [0´aa£ckˆ·%P‡ëÈ:ûç¼(w•?ºÎ q‘7g•©!¨S!94ãr¸_$|ËäíŽ0§„\÷ŽÜ¦íÑ„ë’Àil¥ ’!ñ­2Ëìy1úœxq°Qˆ¿½e?ï.Hw*“<ûauDÀºlQ®Ü2+|:¼,Š9hš2e/]etf¨ à›Pk+Õ.|}jëS6Rtî}¦‹ˆ+ݨ¦•¤Ñ®’2A`”wk*q@8²rÐ^LÛk"É÷…ZÕ¬ÁS|=Ѫsô“TçZÓ$‡©øÞáÇܪÑ,R†DÇiqó$%žº_HR†¡µðƲ3¯]N`’F§¨Ý×· ’3öŽŒíRŽŸïðÊx(ùŠe-"9vsDr£Ÿ’0™A",§ r"±‡´.ŠŸÂ<¿¨t”h$ß숡äõ¬AÐÖ‹MÙüÏœG¤Œ8Xš¤HT^EL¶@t.óANÐFÄ+2 Úh-¼4j‘î7ks¯ µ8¸béQ2Fgç“.ï`ŽpzzW§¦±}Õ¶1çÀi‚·ÉP½o,uz}‘ï¸Ä2£îrËQMñUwÔmà_].ü˜nJ’1r9ˆ@Ž®®ÏäödÛ¥h$,)xÔF]Õµ©äú#mgåêÄÚ’Èï~÷‘WÙv” 7Ó¼^£GS1…¼íÍ.ˆI^+§r\ž†zÑZ@1ëíÑyßàBYtO¶ Îwz¿Ý8Eø>BÈ+ƒÝÊ=j“ ´Q¸Å—å(W í Ï,Îè(…8`¾ÄuÕ o«ý†…åK½ôVGK:.ÿF#ì¨&’5$õP9ÂdÎVKì'½jÝ­'O,¦ŒT^­\¨f–”–ßÂØŒW'¾Ý ^×ÅPóê¦ínt…ö´êµåa—ë#:åŸ?xno<—pÓm ž³eÿ<ÿϯù% ¾mö§Ì€‡žÍèO{‡Ï¶¨æ3ѱRÀú!o9ëÝçQýËÜ|éþ),ß”Ã=~àHÖõ‰Û‘Ùü÷îcLØW€ ÎéÉ}Œí£ÜÇëTpd| 0:„cÆy±†ðÔÄ(@e=®>‡Ò0 Ö!œƒwˆÁâ½î}ÈEÞj>ã ­Æ…€# ~°üÚcè=‰ßà8ÁÒ% .Þ²’á”Qè3òìU)À°ë­óìÂл_ÃÂÊŽÉG‘ÿV„šM@£²ÌHXèHÑ”ê!îˆn1ù¢ñ¡1 ~ÒÒ6BÅ8½qS*_ÎÄÂý. {@†ù‘!ä@3ÓCêÉUÔYßPò'#–ŽBŠ«ÈКí®=å‘'ôS¹"Ñ„‡žÖJèëç[³×Ç57Íþë(“œ!¢”*ç™^È–wv5{GÒ¾áÌpšd“!+¨~É$[Ž_î°û¹¼(«$–\Nág4ø¦Óª=ËûʤUžBYŽÍ·>~yÒuc µd³_æ•f:’Â9§‰:öº­>Ï¥ÕKüjcýÒfËf˜Š{mÛ‘*¿Eû¢¶å@L¤<ÊÎÌÚ,@©rye®*yW AæÀÃna›UØ¢ã8 [ª×LoG”`ö¸£]µ\é8óØ$ÝŒió¯] …SŽ'êÎSTD–ô(š9TJØÉo'®jr&´m7ç<ËŽj©ì.—¦u“G‘G<6pÒé9^® ª¢Ž»š'Î)ÜM! ÈB‘)~°4âÅEh}¸p©âøï–ÈÆë%¾…T`ç%ð[ƒŸ~øý­u %° ƒ5 ip«þð |£«“Hæ8ahó"5´y4; œ9Q’ø8»%„*É?nABõI(èQöZÙã¢Fø@•KWÉP>þ a@ÒQâЯ>ìÊ£[ÆÁÐglbäãæúâ³UÜóaW8uÅ[µx+IQÎO7¡Û@Xòü>æGœub§ ƒGß;=‰‚sʵý¿ „õPéõåë–v’ꢃ-¯Ù[®µåµËÂ1`¦Þ ìÏÊ%’_|I“¯’á©üI7´éjz'ždÕ(-¾¢V»8ŽxQ“³Àr™%Ç9ÉϳT0éò=‘äñð‚ˆ¦}ÂkÓrIt¯Y)³²½lßa”Û¯ô•GgX@é.ã7!ùº¼œÛí$îÅTMN²»h5µÛÈ(ô*xJ­=ä)®sáf ¢ÏZO1Ë+Î6Y0÷ ‹ž¨ò ß?(ɲ_øôpï¯ðß¿“D…endstream endobj 644 0 obj 3592 endobj 648 0 obj <> stream xœµ[ëo·ïg!Äý[÷^¾vÉma»)â"I›DAIÈ’b¹¶¶d;é__΃ä»w:91 Èw\.9þæ=÷j5ôj5À?þÿøüàÁ×ÊŒ«g×ÃêÙÁ«…WüßñùêÑ!Lñ&õajuøÓ½¬V“^ÞöJ¯Ï¾[»Î­ûN¯=þ¿™|èƒ×߯¡Ãnc×Oº^ÞmT‚·¾ã“u£§8lÖ_wžµþ<©_þ2~û>|ÓmÆÿ ¤Y%I³nê©;<‰‘’©s<ÓY9sÃS7fè'½a:³¸®r}~ $]ÆÕ/:=¹o;£×§]¿î6n}Od&<ÿ|tx¸ã.Ž ÊšõY<@|âh6|8ޝÞt&-aÜ´¾†£ÂNz¯=n9XöàT¤%oòæ\ñãã˜U…0ض».÷p§) óÖ߯˂ßñë4–÷áݼ+Œ^­f% !HÃË8–ŽÓ¿ï:`°ö™—2Är£BuAÚ½ã©ÞšàiöÛ¸>ž6îÿœDšô€»ÿ”ùHQù#|}®ò83²9ÿåÉ×üÔú9ò7ÀÅiBü¤qñfßäÁ«2xœÏèÕÈÓ4r\¦åÁ£2ðÆÖ÷$EéùM|]ŸçÁ‹2ø,F†óÇe1P‘»Äcñ<¶w‚sf«@4ppôˆ0ÂÆÂ€ÐÈX†·€¸Ánoཀs’0œ—SUˆ(¤uý$QW‡´îØ ¨#±(ÉòpM€ˆ«a •(!ôÊ…Äá­Tßt‰%—H©Š¸,fq¸ÄO goÅ‹gyÝòÚ/0‘4Ë9ÅËÌ.ø6°”b…¨íÃ¥P‘²æÕÿñ¥i[À!£`O½ŸÂj£Lï\’lqßFâBÜ7ŠmÐHàåè‡|„ø&ªa§áp&ržÀ]í ó=¾Þw€sJNÒ]f¨Ÿ¤Ç}ô{<Å'ñ“ ëãò÷âÌaÁfÛ—0¦‘œsV ¾7£JH©‚¯(묜âHœ×fŒ-t^uxÁ+M"Ùb¤àñX Xá\)˜nÌçX˜+`pœÊÆW*8+;&FÌŒ:AˆŽ“âóU Þ½)XÂÛ“X±zëÿ±y½@¦ðÒßv£™êÅ{ÕkÁ²zËìKœÀ¦a¼h êOñ?ø<:‡çoÕˆ´E¸ýº‘påªëFìÛ¸‚P<‚ 7:EZ«“FŠ{j ³Åó/ÞšÕ0¬Ó^‰´e „Ç*«M^‡í­5¾…Ä­˜L+²ªV6¯U°.y#>w­¢Ð=+pJ¸÷…÷÷ p@zƒAËwwÏFbfÏËìwïdžQÝ» ‘†a:¯6p@ÈüË⬣Xš‰vvɆòFuŠøš‹¤7'Dëä°Ó¤ê*îÿ’qO,Oø6` $Àÿ—N)2&e]‘Jh·è…4eÍ|(GÎBÕÃð5z^ Ž+2È+é×_´b˜ë³ÆzØaºcrÒ~ Nt¼½ˆ“ÏðZP^¯v¹BÂï^JPh…ú„2cLdmÆlDa˜ë£3L2Û%Žƒüˆ¢.ÑþV”\<º9û;ERüIJ ñNÀC„€#§ƒÅ™0XQU,*wƒÙN_ìöo{µ.Ù Ê.¼¶g¨`òäRê!žPEg«µ¯Q¢‘¤h][óƒ*ª6È ÖÉ«÷Mç÷R‚Ò‚”%<­'_çU€›x\Jâýbº°dë”Ö,ÏGñ}?úA5¼Â\"‘zÖUyËœ:4˜:$âNÓqú”¥4¨þèé}x%äÕŠTÈ5™w¿Y:ò>d¦Y:"eÙ“âSr 9#Ï‹3 ‘Î4™Eðdú±q'$‡„ø’Ń¿H5µ,:0~"»¡áìf|Ñ—Ä0¼ô ®O$ÿÚT|Ü QÅ`‰k³Ú©ï™¶ÅŠ,·iŒ'ºûü ÀŽýéáÁW¯VÎ%ÓhxýJû0Fݾ2Šxаž}²új{y¶‘].Ïr æ–J´BZi.%¢E¢MÜ2œh£&ÐR’èÒ+â=«È Wñž6djv,¡íEIŠP´5'@˜±Rý .Ôn@„°7g•X‘t€™è¹…ƇӨ¸¬¤"·i/A{þª‚Tániå{=þdR8PA优P)èóÚw8«¦xr‰Å’l=è²oh½o3…¹6˜ªÀõÕÀAuuÌZ(F:笼[HR^¤Z§ ¶g8`½0%±‹´4­ÊÙ{ÊIw™˜DI¦ÐOcÒçM€‘×3‹˜¢„jŒA£bñ3•ʧªÌèІÿÕ.Re7¾8]«ä¶ˆ SO2ôú?`^ެìÓ”Fa~îŒÈZ–I/ajW5…)™h\'›Y·}ª Z5Œá[dìTL«lœäÌKNdQ2c{@w%%“°¼Þ™÷H­rÊ1WÚLŽt`®¬D¥KzV2i zÙöe2Á˜‘"òí«=Í+¥bª˜÷"[òºy¶ˆxñ²“ *6ìtÚy-7Þìɼ›4Ë8~‘ÐuBù“Vi‹úǃQ·)=˜Õáç‡÷楙œE¡R[¥AxÊ,Rþç¦W­.>-ë_¡x'_SBŠä{Þ3ÏC0;J3¥B£w{̉«`°ª´‹b;‡·ˆµ'ã›Å)û=•òÌõ Oˆ§KŒLu´äê”ò&HS0ÙhŸ‰*–”ËÅÔø5¹JøúVWC…èY«¡æ.?˜«¡Bè5l“;ØðXwsŒ´,ÙN­Öý°Bí§Æ¡äÜè;ÞÓQ)f‰6]މ±¡-*7‰¢Yõí䎄‚;§Á ø6’žô3` ÐGyºPU'•æå”Ô-åä²Pd-~wDOý{U±Q'*m£MmuâöØX{Å·Sü SuŽ´Ö@ùþÓØÁûžk¼³6^šàÒ »uÏ"¦wE¤­ËzÙY™é6 :c Ö…”5Ò‚½+·¶SÌ)Ì@EÛKœ‘å Ö[ ©¹Gý?ògØéOiì>¢x“Ê%Š.Þ‹MŒz·gUw¾†  ÈeÊ–›_†œFÍ®[U!±S±z;Mn²sB§È_4~^æÌŒÌפëáDEeøœŸ×FnOŒXŒá b­+;µ§w–Ö¯ ̨‡žvM¼•êmCSvkA{Øœ5 ó ø¶\³Ëðg¿-µ,hQËi;åšÚ¡G$?­Z°¬ÆXP°œ¨Á}ÎÍÒÆ‘æ}Ûá‡B ìÍŠoS÷CÊ{aLëwwûåÆmMµ«;Ó`D½£7Ù!ÛÆ¦3rÎñøL@Åx± J@ä¾CÖ8¦êž°xUÂ}Êžã9ó5îûßÚ¹jr–z4s,uÍÊ ¼!ùÇXŠ[Ô]tꦯD–‚É=%fÚ¯ìPgó„ŸÌ¦¼í>IÆÜ?…Ç­UTŽÁCû¡C“qœ †áŽ©ÊWµ%'j’‹—°K>qíDËFh³€`WÞØèœ#ÈUJÖpeŸœ³(ºc{9+v SÓï^Õzdè§ ßXì©+[96¢XUj?¥ö£¬„pµ Ó>‹¥¨=-6¹/ŽìèÅ÷º…jK™Y»Z<ør©šTiŠUs{í;oÔÔ+€_]ô¨[B´Ë—–³í/Q Œ/%壟ÄT”R SÛÆå„ŠÔ !Àz‰É ÁMRÉ?jŽ3Âmj\~WâAñ[’;4âñEJi=Ã’ ùÉ_hêÊʵný¬DžäÜC˜ÅÁ†‹ÛzÆÃ¼°%³ûI'úŸ–~#bû1^z-4x¿T’‘‘ÅUÑïà‚??ä¯OëÉàì{b Õ]î¨jJk³T¡S)Ñoó£:Q€„ ÜmÑ ¢8ø²“Ôy°/ƒÕësyÆ ÆÐwØÈ¼ßFEî²’§TÌ€#õzáÁ¯™œç%¢ªÁÀýž·ÏÜpñqbøߨ0úªá'kµÛ¦²²Õì¹f½‘øšù¤~³oËïu©n=½~ß•úÜø°ôC½¥>q¿Êõaç1 ö%e4ªä(9_qÏjÎ,c)øw†at¥°3³Ûœl9Üï÷&$U~Ì실mAÝŒͧrúÍRJÎì÷ëÂ*¸=²þýƒ/zrzèßðÚýHÃÍ£3:6.“Ë`êD¤ÃÞåUÉå,ýþ¨˜-Œ!à%—Ûâc·W.êbЍþ)‚LüÔ5œæ·¥7<ÿVI¤5uú’ø—ŸK“{!ª ß~ò.úßWüÍ® ¹×K¸âfÁ«ì,3Qzµ×Ó´æbŠÓÛX*»C Œ¥8 >jú1EäqüÚŸ Íý3xì­T zÈ"ÝÝ=VÚ­Jk>x‘ÐdtJÞu©Õ {Ë ºˆ­üáÖ²âÞ¿XrœÁF§$Ï¿êW§ÛÖŸwWmÓéUóz‰wnÀZì5;ªÓGnžŒþ¨Ê•ØëÒ>•º£’XóÄŽÒüý[Þ{Ó5x<¿rTôÓÎ/6ØU‹¾çu+ª Þ[zéhiÓ“Ù}ÆM?Ä}–}!­/ë1_üzÄÖàendstream endobj 649 0 obj 4243 endobj 653 0 obj <> stream xœÍ[ÙŽ$Å}où#Z~¡¦’Œ-3òK€À`aŒq[²e,«éÙÐôÆL÷Àøë}×Xr©Îa¡iª2c½÷Ľ'NDýxÚµæ´ÃÿäÿW'~k\úìÕIwúìäÇC¯OåW§ŸœaoàQ;v£9={z•Íé`Oûè[cOÏ®Nþµë›°‹Mø÷ÙŸ°JtU•¡om„Zg¡ä§ÍÞï¾hL;ŽÑ»»û¦ÙÛÝ>ÿ¬Ùë‹o›½s¦íºa ñ¶ÙC„wn÷Iã©Úßš}ï­Ý}™«}ŠÕ\;Æ{ú¼±ø&öXHzÁŠe¿@ëÚÎ.ôuC¡•±G”Åáà`l-…;ƒpzoÆ÷XÐ9 í8(î°u±q}ÿwK×khò0õHÝÀÐÔ+¦ ¾4å^l¹w];˜qd““Ò_AS}gÕògMDĸ{|…ÝÝÁŸÁî~B«IϨØ+Æ`¨|{áåX‚ãy‚CQ•<‡Ö#LÜAGn@×Du!¬ Ž?{Äx숋Ì䩤"8gxmÛЛÓ=,€Ø¢É£o.åzôYÃ&¸„t0èIÜçÀÑ%‚à;­é2 $Ò0aY\£~÷=–%È´ÜÀ $¬¤–ÞàË@5ßyÐ’¥J8εGøzœŒø¤°˜´Ž _ðêÈ † ùîûnÀ¹‡Ý˜U Ž•#N *„ožâ×HC¾Œ™ÖV{ÂS†¾ËÈó9 Ç9Ÿ¢œ¯*HZ u=ŽÐï^pˆåy¾IQî§ÆÂzï"¯IrM³£ºÏl$ž›ã+xx60FžµŒ]Üg§#@ÒrO± `與£úäsi"­×ùi¦ŒTTÑÐaÇ‘º|…; V<‚Y,Jˆ¼Õ ‡ÏÙŠsXЏ4:lÚ"XÇXq°4šq2øºQ ôBãE{ ³‚ØÝž´µQÈ(¨¸•½v[!PžQjuöí³<ÕQ`»®ŒSεnêx„ÑΣíJ´_X0V‰}®;+1F¬RŠBt¨£çšaf‚ qÒmFŸ,g¯Â–“8Û“›ÔÖP œû€ù»”@5-cg‡CVB¿wËùg†Zç0 æhlÃ:×’5ÃÌ´1Q:Z™=q.ñ3Ì}÷߯OÁr#€y±%«øÂ¡K¡¥@ŒÓr‘¢äÙP@ûêpjyÙ'wÛœ®¦)x i|ÞP<Ï (švÁÐ*?C+4\²Tœ! Zrþ¹„PÈ=ðJ-f÷º ´½¤VAµÎäU‘6:w¾â¿K0ø ªGF“†\jè1ÛHq—<Žß4ºXâ9RàáR”òeíL5ò(бwäÁ”õ`ñ0^%sã@ÖÓX_>—´ìÀ?¼.ª¤´»pÆÆ•3V-#QÆnwŽ –ŠqŽ“±×1gÃ:MKÔ07Qgv5a²#ZÒœ/hs‚Ðã†x&1HòVÙѤ>ôuRgŠ!츨´ëuÏ‹¦àØ ä ¢IüZÄ?܇›Œªx¨Œ‰ ¿ˆVJ{‘f?¡·h&É*™È¤´v‘W—ZìW%â•$îÐüë¸s™SMOL¶(Ž‚ØÈúZ 0¸ö.DeÊ•¹ŸlìtmOaD¿z›xêµ.h«À–Ò‰”É4ýú¾ÇmÑ{ºbŒ¹¿)at>‘Hœ9!msá³kpc +Ü":*â|0ФÌB¹tÁU4 Ï±ˆÀrÔ¨÷:¶Ïº+=c\•슈$\›æV‡¡dŸ ÎÍEèO IºMÂýKàÀ€%Äøq¯°Á%ŒÁVÈúMi°‚0Ù@ˆ[¢›UFQâ>#ȉ5ú~šê<œ+µh$ÎŒµFÚèFI :].?`fF0 æƒidJ~ƒ †Àÿ'•¾Ç?—齸À?Ï @ë³€°8]>„^lWÀþifÊ×éáE~˜Û{ÁU!Œ,vž¢çºHtóý¥JçéáËüðqzø«3iø÷ýCzw+†Ë½¼ªÞχ–Þç‡ÙШ«ðÇÁË´ž%‚áp=ÅJŸâÅÙLÝ»žÁ¿¬”ô•wŠp!-mÙïçpƒ0Ã’èföV“·fÀ!ÈÞ}š’Et[àá]Y;v{É"ÀaMÐÐÆ¥¤•³e8†—IeÜ€"iìJïþœ´¬ÜB~{[Š ²ÿ(’n‘¯—ô@äéý@êëÁkJÅ8ç:ш$—ŽèPãÛ†NÀärPa\ÐÆ_++‰ªÒf¬G½Ôª`qµ§¥5‡ˆëgð-‚ evØ+­¿Î Òæ°ƒNDRg7,H fÒúõàÕ¼™@f‡¶Wˆ)”–7Guÿ*Í@²Bn­’Ó[Ð ”Ù˜CÜ%†ñ"={SfbG™œU܆GV]qg%­˜ìWÚhÁg˜©Ž8ª³A‰-ãKÑO Þp\–uܸHÐÀ*éX¦˜¦{é ÆÀ:)Kû¶õÃ8=Ÿôè™EQ=›p2ã‚ÀgtàììòñlãÁF Ÿýb)é¶"Fô–é½}]Ršîàx·KÜ 7zѬr¼´ ~[Ž÷zIªº¬hÌœe=Ñ‹ö!ûœ•E/™Y‘ÇnèpM!çÌ.ëZrëï^6{+ gRæ4™º5WßÑ›*Õ9·ˆŒ¼ãS¿wÅÍjÁI'…L Іw]:¨dìÂêÜ‘¯¼ÑŒr·Ïéô8µÂ“äç,4ð|Z¾áóilcÅÓ–x¨÷)‹å[Ä&ÉÞó Õ€èÝÑÛ ,úèû>Å]Ľ#Ä‹¥…©¼åI¶ e*„®o§Ö*ù4Œ›Î6µõ#³¯^XÜœ}uÛè§aí-_tUa.A’>”˜e Ù¶Ïù±<ÇpÝ[»RUÙ º(NB®>BZXÔM5m’opTÜ~ô«tÇv-Ȧۃ8»CzóWNùñSÏ‚âªbn¸y¾…É<²¼þB6™¾ˆK·*;7¨ü4 ðÍŽéÜY¡–Q³ë„^:ÝHÏØþ±ŽnÌÄøê*ɦýÆk°zä,kO¦÷Õ”n™´1ÏDïM¤3Uô~÷²:X¬ïPÈ4Ô<“³¦÷¢Êñ”‘¬@Œa?“âõ½K‚—^« ‰ÔÛ@½lä9Àe.›O½}>dÝ” ’ô†”ñ¶î¼©Ã& Äa4Bˆ`ܺYø‡Ÿñ•gf¥¯‚ÔŠ"EmB§>—ÝÿÄ ø7lùôEEðíÐI7:»uÒ½“ʲÖÔe«ü·TÑMu¢~làÇW‰Tfå³B“òF¬7$Ä®KÜ{FŠsF*4¼ Þ&áóFç”èÏNoÍt3ÉÌ™WäÜíîá2Ý›%RZ³J=ÞÀŽß!#WÕ÷5W~¼–英P€„EdÒª¸«¦R]§€8ÖûIâZÜåÌ|¿e¿ôsÜLÛOv»¸e0ïdË`從 É5Æ—%8“ˆàxÅŽ1Ë}Á˜î`JÄ×ôxÌõ·µsôÈÂ^Žðõo{øÏöÉNÿ ¡‹î¶šþpÒ ,(„*O}A;ҳئKjr¨JGñ›.Cóà;6ém¹S ÙD€-4\mš~k3¬mCX?5é.¢´yÃr46VÂݼ§…ƒYÉöVåT©›\…¾Bobf™ü@®ë½$Q£*IN7õN2Ýd²„Ê€[Q™g©M-K;ÀéåY½wžËo©2¨Öd3¡5A@†ýt<ß§5ýeMæßÃñÒŽ0Ž¿²ëÛ<‹òSîÀJÓú³·IƒVØFfk*ÀÀN”Œ·ᎠÔ4Io°8b™Tùe)ÑÿòÛ•x™ÊMš{" C2ÕBb©”Çù™æ} ±Zïªu¾c Æo{¬»!þšG¨U2µïFóƒ$Ó¤¥;âigT¤K #|”4©­éÒ÷ñPºô_ç0tô~äß®$QÍå5Où©P?O’>¸2I¸Læá_ÌäSI&€¶ø%ËRjZû A± ^+‚CŒz kYÉ ñ¥Pˆ™3º=ƒZëSÚÄ éõWqzjÙ©O•ôªliÊño‹‹-*ÆK¿pM›YIÆÜÄ1ç`Ö UN¶’íædK‹ÜöÅ@vY] ,è …s09£ÆirÿàGþ)&ÉâמÅÏ;ÿ©?Ÿ-Éù?ª+â¾þÁÊÓ$üÙÙÉ_á¿ÿ’ë¬bendstream endobj 654 0 obj 3937 endobj 658 0 obj <> stream xœ½ZmsÔ8þžº‘oko1ƒõb[ÞW °pɰW[¹ÌRl Érù÷×Ý’º%[3“°ÜVª&¶,µúåQ¿ÙŸ·›¹Únð/ü?>Ûº L·}r¹ÕlŸl}ÞRôx;ü;>Û~¸À)ÎÀÐ|hµ½x¿å«í^owÎΕÞ^œmý«j붚׺rôÖ»a>¸®zC‹zf«§õLW{õL͇ÁÙÁßÓ“7õÌè†MuP|nTµOòÅ/àî^Ö³îß‹ kV¥¬Ù¶Ÿ7¸[,£8êÖÏ4jHgάmçÛž™fÞ«að+N“ê®êY«âé=ÞŸ†AS]Âϼi”ª~ÅÛ3ü9ŸøóþüÊd>òdzp²¸¨Úê>l{Ç ü$¸Ò¨ÐÛ9~”Áßxð†Q< ×(ÄL™yÛ5ÚKó®bÎY&ÝÀzWýÁ\ÿŽ?×9›÷`b3À@_ãýžýEHüx[qQ¼Á ¼â+Ø××V§h{ÿìƒ,=âAf§¿;¢Ù#<Ë40aç”ÏeM‚Ùý2{>ÝèJ.¯å2¬²ÆUïêÌ´€ñÖfÈ5vnÈØpTº~è½±Um*S›â±P|$vk Zà¡j‘;Kj=Oሄ>ƒ.¬…#¥ü °AçÇ::ÛK¼?‚S†AF ¬¡6à¶ÃExU}ÊÕ¨y1Lº€uïñÖ}\GŸ|¬&.iõ×Z;ZA¬.Ã\×[ƒ¼x>~ö¯GL^ŠË¾7©¬ZW'u‹Ïœ!çÕ9`ªó¾‡¤ÆÉ—(aCx ÈíÆtOkÔ¿QjnÀ@AççÌh²PaÏ#/*­UD_'V¡íð¡aƒ”¼˜EÔ¨01µ)ê'vQÎh£m¦¿¸C †B£ÔsÕ\ ±ŒÖÏ4 ʤé tÖ•¥cºôÊ`°G'°!«ÒÎD§«ð ç ãÓes“Åjº%)Èa><Þ÷»˜Ë,ÓõqPˆ~ºu.“g#âË•Ï51 R>Ü&ImÍNRŒ;dËR|¿Éà ‰DŒ™¸„ïšIˆxI"1ð—wM#ìÿ#МHA1Ám>ßW”Ý>P]ëöýÊr²¡}ÆtÎ=SE¢'\Ü*5Ñv]Z¢[0¥ àû.ªtCn‚ñ«r§˜••ƒ*ÑÅö½—¶1„Öèu&NýZ¦Ç('Ëãtâ‡#¥KÔ:ÁäM’jä17IôÐÍ[=:ÓAI­(É ŠÃ?"ÚuðçMYÂÞžÕ¦ñôpFß…Ãw+C7Í$½Ë=Â1\»’SÀ1Èü B63|ÌÉãf@\ ¸9Ò&\'fh2¤õ]%gM9^%ÛtMWbN8.a2¹jKši²5y÷2¯!fàjרQ¸’FÆ#݆r® !KÑÈ'^¾âæê(äEã®’‰IOB~Öâ1Ú{(Us¬Ç¨I”1±÷¹.ºÏK¡’y>Wézäì2aÛ<ñŒ}_m ÛŸbQÝ gbQLò–Q_}¦.»IÀªè 7%UèУ¼'&Ô,€M²¶‹:£=ãÒA¦HÅ!âÆYA^¬ q–™+;!X`t&T³ˆ¯ïÙ ÉÈü©NȪêC{D<ä_݉¢¯íT$=‘£’,ÅÁ‚€“–‰J·o™$Ïå5ÎIFÔ')qæÖïs¤‰‡˜vc#æk™ÔÁñ©öU¤*ÖÌÇ¡¹ˆgŽÊä6¤>±~|êJ¸X]®pxa0ûý®âNÿ¿ß§°'Š}ÔØ3騿úAy0@žS'6^J‚ªQ¯@dôE°Á—Õ ¿¹ˆu9®ü›ßüõÐA2±¤â6«ÞLâž.ð±â 6õiAɹS×ö¡0ù[+ð64WÌÜ95ò ÇÁi?õvúÕ¨°Ök[9Zt»-äšÛÕ-›Î:J+f•@ƒ´ÎQ© Y;H ,ø9W…vÊix«€ÏpÒÂ,|Ùc饤‰qþEPcíÞtit÷ïaÀp[Îk_茲€7±ç[j0º*H™Œ M‘m%*v ú¿ârC¯cv‰9c,W¡|È”éÉ>? /\HZ‚ûžìífH™²)Ѿ6ALÔ”ö½ºÐ™™is+™B0úEºD¯ËSðÖ™‰ø¾8éÌ[l9Ï/9µ5m–U †Òsa”_ìÄ@êCª8}d©¡ÞPõKqóO-:§ÐsVÏJPä×Òg_JïW˜o\çy-tj¨7ò’3*þé•üTvîðSdÚ'~“7(AÔ—Ÿ Þ[j!ªWŸóô—Âè>še8EùùSy¾(Qzʃ¯‹”¤l| Ï_—Èò`òÙË·,?/2ò¨Ä袤Ùsw•rDÐν|g°/ßìÈÔgr™ìµ+sïeéÉLã7í0òOÒÓz%ä^òàa‘uyžpV¤”µ9 ”ž|7Jb˜™^ònÄk>Åù‡%Hì§3GØÏ%Æ\Âó£ÒqÙ]WŸ"»„f"¬ô`_f X‹W¡”àm‡÷KÜm¢ô8ÓM¼<ËçrY¢eR©~žQü cB!Á6ÚSÚÛ˼ïË¡=) ÒŠ1Öáü\¾jË „X`XùÀ¯¨>qÏKÖI@¶fßþÉ@±“UB±µV%nHÞÙ§ôOÅ ÉGŹ7bÝò„/Bì([–˜tÔ§¢|TóW}"~¢½¢qÏÓ™Ó6|&×G¯CaDö¼(*×Ý´tžgQ²³é‹±R߉qÙpàßäõ(È/Xˉðß™ ð$OºÌ”--‡èOsü†× +m¤KÚ—@?•L’•eyÓÇËRãbzÖ'…£…Å-÷¶s±¿D™´Uâå„èïÑ,´Ûnnƹ>uÃÐ$wÀ_âä‹mQpÂÌuj»b?Lú5ñ³Û·¥%Ž3qú’”3K¡´S¢ô²t`ß”9!÷J|&nûØ$÷ðëCÝ[ý¥Hlo…Ü/¦oùÞr#yÆ^ÆÓÚH.â%9PZ”ô”ìuª2<€«Ô5M”e“ÃLêiô¶4s§•MEˆPz[RQ’¶ìÖûVO²*KÙK¹J"ÿ³Ì€™Wçú²t#׎ô/Èr‡N¾<¼%3#_þ0#qg]=¼‹®¦eÖ⌶)Ù¼=#ç™ÆùÝãH¿ôžñ«vƒ~mI¿{Ñ:Ð?[¯•dæ«ÒÁ-ie,»Ñø4`*†nzjH¶¥Ï«'i+ŸHÜüÑbëŸð÷?)äî•endstream endobj 659 0 obj 3227 endobj 663 0 obj <> stream xœå\ms7þîâGø[v(v2z›—«ÊUÛ $¼&P—+ÊØ ;8$áߟº[jµf5»ë…ºûp•ŠYk¤V«ûéWÍú÷ݦV» üþ=½Øùú±2íî«ëf÷ÕÎï; ï†N/vï.`ŠU~¨šAí.^îÐbµÛéݶ·µÒ»‹‹ͺÊÍšÊý{ñ,éM¶¤kkÝûU‹3?s¯šÛÙ½JÕÃÐÛaöm¥gª¹ž-`ü šÇ«¹1ªnšnæ<ñºšw]ÙÝÊâ²£jÞúçZÏî§e{°ÌÔCßÑNßUžô-L »ÀB¹æ¡_£MÝ(G“T8ÑSÚa¦4°ÌèÖSTÊOnŒgÂ8ÜÅÿ¦l ÑžŽñÓ P7=Ï=/Mã´B6 ïˆÛxÖœ_×ušDiÔ E9W­­û~wnšºSÃ@"^gÏàÇ#øñ~€ø<ƒþÇøñ=?ø~„ÊYϬ…ßÿ{c;ø)Ÿ@žS…ŒQ>àÁ÷iðŽg½éQò ~~˜ž'JߦÁ§SÚ/QÚŠ§"¥ð´_Z´( N1 ­Ç†'j‡ÞÏè=QP¸±CmÍm%§WåÄùÂ\ 9Dç¶®mô4hŽ/÷áÇb5hºhîf$–Î$„²дÓàqI•ÅåI+p<8”úÝÅáÎâvùXû|¢£üAñX}ɘ±p”øz4Á×3÷˜Ü1³µ¿Ì‘¶¼—6†[ÈöÓ¨&šþ ƒCI„IbàiIÒOJKb ¥Ã¥"ùCÉ£üY{‡B[2ÞãíÎ-nŠf4³'d‘ÆÏ¶Ñ ÒÌ’P»q´L5Düødi4ŸKvL¬ÌñSf¼ÇH:bœý´bQ"*@,àÌt>”±{ùš½Äî%›8–J½²7p G%÷À4W™Ù/,ˆ£)sw·‡V£Cg«0ïxËÌü–˜ùă¥ÁKüÏxðšŒï¬Dï%ž§Á÷¥™gÉøÎ¥rºA)ÿÁƒ¯Ó¢ßÒqÖ=ÿ¥¤î#býŠŸ¤gW ¹‚M!ë¢Éœ“µmÝF3q÷4}—F?fbˆÏÓ\AáUúøÜ ´ëê®ÔG¾g|ÈG%WRNö>+ •) Wó¤d%‡ÛPzTâi]êS¤ô%?œSB>HHígÂ-øIAu9Äîqü|Ã;>Ï ‘Œ®p $á‚‹”.ÖPJJxXRü£’¼ŠQñºKz_|õ;ùÄ0ÏÿVe:å {¯Äã³L+eY¤T ÷÷·á©Hi+ž—à3eŽúÎ9¥”xð>á<×ÈxZ¤{'+¸D#âq ko·‘Ù~I<Ïyðíæ”’ÊžoÓ8È“Õ<]lN©ÈÓ”ïX‰ˆýÍáñp ±èYß|ž7xóżA‘ÒVÞ`sJ[ñ´7xó%½Áù:b7ôƒóÕ.`sAåÌ-—^‰ÒLÄÛ ž/_ÇÈçÚ}‘Ò6v_Öý–v¿H›Úý¯3P6ªýóÿ&Û³(Qø á¤T‰êâ¼$ùT’ˆâUiðÃêtéË <ûsØMngbçO‰³w¥ýgdÇY>ã¯UfBÉ}ÝoRµcÇ«ÓïªX¶>«– XÚ0V±¶3±TÀꊪØxœôsZKÉ~JN4ž–K÷”HSN¼{KË›N´~(%óÍ»ið¨Ì\ÔzrPß–¨dE×â™,QÇ:U·µÓ…­0ÛƒŒcA~4 s ŽÁï%üZ¹,¶È…?ÞMsÔF¢¬ï£Ó=Pó¨ÐA’mSD !0'A"-öåd§Ì€#t¿…E 4KjÍ?tr4ú"MM¦/Úɳ¿M@þb½ p© ›êf%9>ˆ Ù:UØIU<(‰î~IÉmlÂå1{«vhk¸t#.Á9£àGL"Î÷õDXÀEýÔPV1ë®Vº1±>Â( Î"»/9~BÔ® eá #=ű·<–àÜ.-*ýëÂ}ýØC!¿ÝTµÅ»MÅw›ª2³¶2aþè.š/•U( í< ÙDÇŠ2m jà@mø=ÀWU¸ þ®ò©¦mh/z½2~‚ŸÛâܰöÜ/xOWÎ>¦ÃFðÉg^¸Wœߢì%çhé»JË­O+ëAçpø#<¿È½2(â¤×Ëx¨ )k‡æ0˜˜ñÄëlÞ—¶µö°ˆ\×þ°p¡ ZÃëxFœ7O\|I1¯Q>TDY#ǼGNLm@¡ƒJàË)￯IpÃÖ-З(’Øìh«+¾)GŽhbåõzÐn×É‹x¯c€K¯tïU-ƒ#poô([;­ðVÀ1Äàèà儇Ôm ã™Ð*{jÏÃbû<;Á¾‹… ÃAk¸|æ}}šÈðî›_Ö>Ô{pè4 ˆ{ 0»J#dÏâ¹vç¶ÑÏ Bgä {ÿ=‘…ý|Ï!`z®{Ô±c1æ6.·‹À+úÓÁ¼´øüa“쨵€xƒ³°cxæ‘0@§¬–“a ØÓ>ÏM" …7»%Æâ`«g rñXä,³9:`Ê1¦8á @ÍãeŒðP]ƒâÂìÅ@Ì}ËçèQΛ"3œÞ(dzcwÁx½5$A–‹…_oð—I,’û³Ñr$ö»ñÉ&‰¡E¼ÎêW09”©[¾¯]ã Á :”¬o%Á¶-õ_8. QëÄô" `Ó¿Ü6vø’DO¯5½”)*dÑ`¼*Á3l0…ÇÌ1ub üY™`ŠUšÍÕgÖµˆ¥?+‡±ÃòÂQÇhøú3™À›56Z1ëÄ* hú­¸¿¶QÅ“~ÅN8¿Øahɱ.âbÆFps"æuøîèÓ“"9$7ù1ëwp6ŠýW!zž9Ý‘Hk„ÆrsƒWѼ› c@Öj¼S«)Y}Apjº$Ve¡°ÍŸô2Yor¬Yã "=©à–"ŸâëkTÒiò(½(jø*%:aÌ× (}åÎ"Ç(euîÝ¢ 7Tæ204µ1§³à–àÉuBO@P›>ÔÕÔ›rÞ”º¡ÃtR›xÈB®×$ì/øé{ÎÆ?Ä\]4 qm°˜8åbó„ýжTšy‘¥Îe@ŠœÛ?uî°pxYM·'oó9™WžcH•ÜUlgÿL\OuìbÙs»*Ti©ž¹*õÍN«BV|/‚kw%ªôËR•þ*u«nW…zä·Õ,d‡Ë;Ûì, Mñ~ÂY¶‹ðöåF¼«;ç£ êÛ®sÐï5+ù¤Êðù‘ŸbãbI_·h)\Üþo,%•¦¢Cæ£Ñ|BDÚÞt„ùÓ’9±Cü?1§5/.|Ÿ×ÏŒíµÿ–á‰n‡°¼8ºé-¿â7iƒøn·î—òø/aƒË­ëê =_Ð é>§bUÞ ±Á ¾I7$fDo+C)¦m>½ ™ w)(Ç‹ùeÛŽóKÞ5OòCr`¤kmŠó·8ã©©)¾‘æšæŠÅüO­m®P¯_Õ½U©˜ ÞWPM ¡iû§áË ±ß€.+ôAÔ€ÑZZ‘<ÆŽ¥ü¡n k}òÚb-¦eãu^i€ž ¬¾²o5Bkhêp¹ ùÀ`Žð¾qߎò¼ØµAù{¹ŒK£D›#Ï#þÆ¢H¨y0I¨yJí&um–àã°“uƒ²VNA¹ £-6 6nÃPÁ9ÔÊ K§ î,ë‡I•‡}U,ˆ¼@8]w[‚mÈÞGV"+X(Ïu·²»†¯—wà,ã¢ó¼×QXjP:ùrÆ¥–P´N™hŠ…Ätãjºê §»B¬Ø&ö°ÕdD= ‹½óûõC¬/²vWÖ¡kL¬ï£[wÓx£5Þ&\¥~FhªÏ p§þD*¯ ”T‡Ÿ£)Yˆ¾¤sB™YB@‚ bÔ@~‡æ† ¿ÊÜN04n­i¨#’`q™Ä;2Ò¼°E(m_‹F]vAΘ»®pTkÈå–Ú1@+á´¢ÿ.”üÃZõÆN茇ØyÃN‡wÂCßN´WõêHhLuB¸I#‹hèŽ,GF]PÅŽ`RøþsÀR8aè:ZL!úRƒ²åÞL©š”aE ¶Ý ó ý5 æ6‹€±¡øÎñþ+¸DtòÇA*: îkÉnY¢ ny‚;®Î‚ŠGá9.£— 0ƒŽ/ø|<&7•‚Î4¼†‰T›µé"Ï·ÖÛù~œñM‘ t‘éê6å6@º'ó9Ÿ„ÓÐM”>!kJ™†)Ø0ËŽRk”TƒWÔ:tuCÀw½ÓèÞ(wI 7Ǫ·+BÚ¨™d‘W×YsJS8ÊrÒið”Uwº¤´–åí=ôü*`áu"ĉ¨h¶m†:µ¡F6„ÇX[¨ñ0ßTôUÙ˜á×bÓ7sCRF/ºZdl çìf¿'Ë2ù@™ tWײMî§Éï~Œ/z@oùÍN;b„xäœT´VŒŠ·Þ³*Ý(Ì•*¡ÎTȺãÙEæml÷m!•TmC3¡òoÈ[ƒë@Âû„¤WøÂñ÷Q-™j©+ÞF)Ãy¥%Ó¤›OUØ…¦‚¥¶HúÚu¸ÿàûÖ¡òÛ”bö(C¡ m¹ÙÁªNý™Š“$Ê?Bç$FŽqžê½Ÿ—yãD-%ò—©’LÚv‘ÚϽ¢a`]‡`Ü´ Àåº_úa³q˜ß‘Ùì{aa”8ö\Á_ÛÀ¸!þ6 LZ…zÃ?]1vPøwâ¥ÁªV%< Ÿ´m ¯8è%Gˆ§KF„¢–^¬T9éZÀ„Ùµ8ªP@F–LdÙµèèT Yk§¼Êdɲ G‘ì³VEä©+‰ˆ¯©B—]:»q‘M¬æþc]cæšÞPyŒeïJ`&dïVT“²w¡½ú ],°[øŒˆ¼Ë2cRx ¨Ç;WîºD—1èÚ)›ÅNéå­ ÓñüPã-ö&GwüÕ×tÇOûÃÁx&îüæ v¤u×л#K÷þqÿü-©äO&^¤ËÀB¬å`ùbï´yöòYï,v~öÿýŠ€Gûendstream endobj 664 0 obj 4217 endobj 668 0 obj <> stream xœ½\YoÇÎ3ã±oÙ¼«éc® `'6¢ÄJl‡N EÒ¤ ñ°EZñ¿O×ÙÕ=3¼"†–»3=ÝÕUÕU_ãï6íÞmZøÿ_<ÿÚ…~söî Ýœ|wàðö†ÿ_l>=„!cH—öS;¹Íá·ô°Û ~ÓqïüæðâàÛ®é¶ûÆoGü»Æi?ýö›té°ÙÅí‹fç·_4;·Ÿ¦1Nôïü­Ù?¤Ëaûuà~pÛ?Áòá?¦_ŸÁ—?7»þ_‡¿Ò¢³¤ÅnØ·c¢îð$Q4$J\ÓÑÈà&;rc·ïÇÍ.´ûÁM=ñ:Q²½„›f×¹ iú~¿æ‹aû.}ìÛÖ¹í¿áç‘\Ûë8üø·.Ò®Æ>qhØ>OKùèPLJÜ;Ò‹ïòÅ<òB/Â&}ú[Ù¹°ïúÖÓžþ¹UâÎ…`zú{Þcšò™nOéÔ1HlØ~œF·#Žþ5Q,ܺ Ïžé7ùþzñ:_<Õ‹Çùb^ÿD¿æÛ‰”8pyûVï_åû—zñ )MßCÒû<òµ]Èìƒ/žWk‚’FóÐ}›?¹gŸ¯ó׋Bèð5†¶'Wß´±wû¡o]Obï¦ñU~¦ÊzSªþ¼Õ»ÿlÒ'Ÿ°.–ç&qslÝfçû}EÉ\ÒÁ‹‡Òéü å£t*ߦ“|ÜDX±Ú/Á­›4ð*‚|Gü™¤@ü =ªpoÀxPbüñ:Mp #Ïh$ÈÖ¸âõ`-ËeàMp‘¤Ža‚zý.)˜4MNL‚pW>¿oí¯²†µ>tE{¢´÷´.ºOY,±çÜNWZÈ”w«^5xړͶv(ls¨xDzO`â›F6 ÀG¤ðñÞÛyϽNGX+Ò~˜E¼oÜÞÊy•WYÐÄ^xj¼Ü{Ô8×!TŒé¶Þ9 ) Ä…²ôêúÎÓ~Œ•®q`·Ú6±Ô/03ùð àj»¦ù) ÓÐÓ|Þ€î¸È}Vß¾„1eýCÓ ºW=¾%íŒVm’ÿ‹@b3N*ìG+!…_6¨¡#ZÁ³MSVãkø¸%ñ%Òaê‰.*¿àË…511+ üãÝ:´Y'BåGY—FtÀÜHŒ¢QpÊFÁhd|ÕжPÃ`nàÉ™‘ä($ÓÖô :˜¢m'£mrÐ/3!o`ë0ïHgÛ( Œ„˜¹]À¾9B<­¦FXÃøû)Ø÷û¥­@œç<-æ|ôTëûVCKÖ-X3Vôª3J™'¶æm¼[ÓÑÒÅÛAóEÄ·øõ W5@ît/Èý²Áá»ì§Ñl ÐHâB'‡{³‚!Öõ:nDÌÌ[%˜&Ÿ9 ¼‘ÈäQ®â5×å‡ÔA IƒËðs¤8oòHúXx]¥bŒ·)P œË–ä Úôoרæo “ ]HlKJÆüUäs¼w’ÛIŽEB!ÆËšžÁv€oUÜfäAÆØn§Ä0§Ä=ÀGsã'àÑ€][ œ@ÈTú»ÂYËâ»Æœ²Dbœ¾:e6Þ‰„r÷øˆªøB}^¤!ŠÙ؉5JfLðõ[±”5î€#}¬;ÊK~®{‘á0``ÞíŸ €Ñé³1†€k”1zÄ”>ØH-8 ͪÏt2l6à*£ÚW…°n)¤C`“¸ÜëiÎr2B¾5Š€LXV‚m FŽ üA*ÇÔ‰äϘ—®WH`qºÁ¿D»]×LÍÒb\NH‡6V"*ý„¶á®ð)tñÁæª'?g$˜Ÿfæ'˦ç)ö¤úû1‰ÞTjûž f³P˜¶?¨²5ÆêI€PêÁDRÁsÖ¡vï³ ˆ¬“¨XÑEÔYš`¹ú!ëp¾S_#à u%tßPy yçvIά ë°¸Žç²,­mrx‰Ûœ©Á]Í„ÅÐÉ "¢zF• ©h‰ËI£’!Ñ ØDàìr…·$ñZYÒò-©­Þɳ¶?;<øêà»M2Q=æÁׯMŠ^71ŒÎØñÅÁ§/ž¿x¹¹ùþöôàù_7îàùïàãÓ/“þ¼øíægŸ½Ø|µžs¯àçÜCÛBú#­CIwÌó(s­7\¥5ø®zZ}b±¡u˜ ªLç õöçæÌ7±4xy2 èIQV’Q2@OÄ*bH§ÿ?pBúvÌ\8Y0ælv4:6 º¶¾>†ÿ‹âÅdžF³7T¨ƒ!ïH™ ë‰Åöä}ÝáÔB§?šÁWTÁA‹Ñ'âæþëšÓea[AÎ\ý¤ª#]ptâG2$'$êÀå\rºóód‹ÖM¿¿Ï(íï:?}„mã^Ž‹O‹X_þ îc²#b‚Ò8 ôî,^åàß<{®sq䃯”x ®y7ZRÙhÄšó9=obñÅ,ÁñÊH¹˜«V&jxÙèÍRüÿãRtk.^",Ww)Z=5¶–šDF°3“˜2 ¨‹èºH”D1]™ g¬)9ñFq᫘†Ebÿ,´ìf¡¤Ø~4yu­’Ñ 2ÄA£ÚŸSq]R&€?’}q˜©‘ZÞRц*X“šŠÜ 3!TJ¦ªw:ÐÔ Ê°ú ex£±„Š_BRjéЉX]z“%}‹òX«û`ÙÉmÿ #êÿÖ`Õ>]ê¼Ãàâ¥N€À§w”2«ú­j|ãNv_Z¿4Î9´å°ô°à7ÒCÆ Z§‘L,.‰¡s`:¢ë@ª†FNa` „¥¢—éîKáõgÒ°j Ê?Ň«“ä\œïc?/#áÚ‰e‡R7Êë~™×Àý~Ò@ìR4ý#”;ñ$.Æ6šà×pÎ&p”³ ½Û¯ê˜QÏùJüÓÑÆ(¡b½b_`î/ëfÒfi~9sWM2Iï³^ÎÂmADo™{æfˆr)»ÊªMûâàðÙ?RÈ´óË Ã„Û„;¥éãøì*\>E|~ ±ï8ÙSiºJQ•r†#UW7ÎÔŽ¤³8Z³+Y{ÊYÜ .šâWgÓyc´Š°¿#/\…sqàãÈtÄ:þÿ”E€¶ ȱ&B»² A>Õ‚Q»Î$rÆ<+{‚Î6«ÌLYÏZ@äšØ „œèZWžc È)?ôIçè÷>Ö¦j)óàGžÜ`Óaù9 KEïAäéPw¬|)þî¢ÄmÅ`„#´êrPܦ滇¹%Ó-PÙ®{ˆ?.R»ÄmO%çÜ9¡ºöwò1I¾…„Hž̲ͩéÐëøœ‰Òì+2wš¶¿hL6ýJ7I¨V5H’ä¼½ ûÚ óÀšé;++ßèå  bêæäð ÒÚRüàY4yÛ“yàšE¨ÁyTlMHbQ³ÃsNÔKÅY0 ß.šlPˆ”JÕ^2¹À,ÜK™„­ÒÇE:ï5·ÕX)º½­¦geûA´Ÿ»’8{´>GÅ0£Èt<(¥«ºQ–øq6!ÄØM¤Úv„F¥»Ká¤Ñ!Ó !Õƒèê©òj³V­9^[i€óü]Ýneê‹8ÜV_Mö¡ŒÉñ %û–ö-åŠzµ¤î$óñü-xv€§ØöPÒ-ãJ0T¸™ƒ hõ6áƒ.îY£¼=ò>ç/«ùò±ÔÆ©ûÚdô4´kýW¦¤„}[îÞF­*Û\Ð ®e®;Fàý,<çtf²'IÚ‡eÛ"p–gmëÏÍm*bÉö†Âê¨ÎT`ÃÐH‡í!ÙýªŸ°ì¿±ýWì°h\îóQ[iµŽdU$œ^YÃM“ð­ß—bUðÆš!`+³KÔ’$ç}c¼ÕäŽäâ~ß&jÛ$â*x<Ì¥V¸xWŒ6û\Ô¬p.G_Œu¥GL†|%o?º:¤‡©Š~:ŽºŽ4þªËÖTA÷&ÛUTF‡ÑÃÌ Haè…y\<ŽuÁbyû¯¬«“V;:'¨ɶQƒ0aèIt,SE_U 2’zLkÞH1æ¤Ù>o2Tå6¬aß·5*æç¥YpÙ¯€‰¿h¨&Ž–áÁiòCœªÁÏ)6Y’I) »t<ŒÚ·Ö1êf‡LèA5Œ¶ç.¹A_(¾ Ùåë7zQ‚[WáP¶4—³æ4k¦Œº ø‚Ξ)b¨òVQ´&ÑXRBÅp€bH]éÕ‡BK¡õhé ¤ (ˆŸÜ-Ê{šá˜Ê9G3|— êˆú“=Q¡n˜00Þü÷V.Äs,ÂýÜ󦆢=XR¡˜ŒÊêôu³ƒÌÓè’d~›ìÇ¥5ÅwÅb•žÔ%¤¸Ö6„fa-‰U¶íºJf%ï¢h>6‰_¦¡ÖëÎQ^o½Î`ž›¹³Toç`ŠÕ÷¶Ôd¼”™•´û°AXe’é˜[‘=Cý.¦S–§ZépP…¼pÍgÖ1.«NúV@è;6åš?y„þt5¢4'G|ÏÕ òª=Án‡¦üo`¤V° ʪd–¦‡6| Q‚N;2z·°ÜZ\…\dpùäòszSbü²{Ì„dš×n½ºïP¿ä@»,”&í¹y‹_Uñ6ÔâÍeÆÑ(†–ŠÇöÒô%Íòš‚ü¼Ü­”' E©^v˜Bîb(_Y©mÙê+:b÷˜ü¤±IGyg÷Ê˂yÓ¡¨úè;4¶ú]G½Š„9²¼H\ôž»ÊLmWK¹¾€K’còÖZK®~ìîiuP.×Nf°Ó©“Pl˜å Õ®jGZl~b­¹thÜ‹óæÛõ„O¶¦ö¹Ã’ ˜­ÚœÌÜÙØá |Zõ§8xŠr¿X‡…>A¢âV»Éó:>)øì,ÃÈ…QëÙ;€˜nœ8e­ý¬üT¼ñzì|»ß?ïr™×S\ DÑBzÛåô\>¼ZÖZR ¹`ò7égÐý©Þcó«b]ýz·›ÜzY÷´ßÐyÎŽY:´vb<1CUׯ$ Ók2?g`wgÓid‡¡ëM̾ËèFaô2aƨ£0ͦJè¦ìñoÍ¢)zì£pÙÙ˜êà·ƒËØ¼ê€°…®“œ1*SˆØ}ÙÙT„ñÖ©–ˆS°#¯Ä +Yªl&YòKOM—ï©¥VÚ•·#Ô»À¹™fzÉç¾&‘Ù»¨×é»çS]1{5¯6jÞΰ;\ÚÇ|O]-T—ÝYÅúRé5ÀsÛÄFáî½Q¶ÿ!À}­’à©ÍÚZ‹Ë-¸X÷ <£Ú„Å>†A¢Ê+9ÓÆaþ ïÓ;˜“Yôÿ;èJ ^µ‘מC•ð´Vm[qyø«9´Çûk±ó~OïDÝór úoì"ÿêà¿f˜endstream endobj 669 0 obj 4711 endobj 673 0 obj <> stream xœå[Ýs· WóGh¦¹mrëåÇîr“Ƀc;“db»µÕN;M,i,}øìÿ>@à.W:)N›¶“‰¼Ç%Aø±àÏ»M­vø/ü{p¶óè•2ÝîÑÕN³{´óóŽÂ׻ៃ³Ý¯÷ ‹U¾©šAíî½Ù¡Áj·×»³µÒ»{g;ÿ\ôU»ÐUû¯½ïaˆ3Ù¾«µó£öV¾ç“jißVªg‡ÅãJ/þ\-õbÚŸUËøâUµ4FÕMÓ/ZO¼®–}ïü;³øº²8ìuµìü{­ßñ°'0ÌÔƒëi¦o* o\Â,0PŽyéÇhS7ª¥N/*ìè© Ý0SØftç)*å;7Æ3aZœÅÿR¶ƒŽÆhOÇøî¨Äãû¿z^š¦Õ ÙiFœÆ³Öúq}¯ƒ([+E¹ ²\š¦îÕ0H—~dè>R–©“ÜqåǰòCϦu(Ù+˜óÐËóÀÿîż&™ªÆ-V¾[ëðí{¿xì?.€Æue'žé0ÆtŠš®`œÅŸ¾S4ï~-¾oã;ìûúŽûEþ$˜øÌ3t‰<œzD3uòÔ` j6½ºôrÅ× 4G0M_ì TqDjEuÖ÷Ó‹ ò¤k7ÔSQÄrž4®`¥è3þOÿGÓºÒ´zq“8ƒÉ,àQ‘‚€ï£ h Õ,y)«8ŸÉ5`@ÀqNPˆìÕæ‘¹©´ßPÁ„\³ø ™r­Y|ˆ°‡å.5 ÏCléÕv¦ek^"Àæy[ÂðHÂk?.üÛ =]m0ê†Jľ/ÖìE ô~$ÞD4†Åv-.V¨RЬü‚–fÄãbaîHÚ(ƒ–¸ #š=OcXf*ü±¡#ÑBǤª)\¼ìæ[dm[[› µŠô”§'5ú– 3B‹kÒâ „þ¨X¦ÂãòÉÑo~]|u(ATHTFÓŠÞÇ §i¢).ÑÔŽVºŽ"ÜëÊw~VYîu0 (‡Kê °‰È’²N€@ƒÖ¡¹SqhK ÉlÇ`&i¤÷IdmÅÚ[EeÓ4ØÉâþ½&ƒæÉ2¦»Ä{¸VwH}B¨Gz9„¤^½p€» {†ÓÒô†HRªîl’TFŽM¦aÅØ/á*ƒ(@gG„EÂ01n’çñÆ ¶~’º_‚[†Vé(¸Ð‡ðB ÉOÙâàælZ\I—v=»jyÃÛ×BúoÒxß®…ã*–Övj8ˆ,»¬„Á¡"•ï´Œ…”›fj.´SÆ©ÇM„üôššr‚ Ç•ˆªxTÚ-žÂüi—]&º8Ï¡6C„ÏØ…Æ©?Zøcêš´köK!¬O’eÄm`! ºþa€l zË[) R\knÐme6×cî ž:—ÌÑ Bƒôã†îï«d´@0ú‚§ñ{Àb}§ ¢Ðà€QZq„ißá´SÏæŽXA ‘•ð3·áNpMNÆÕSÜÌQøSœ µ›› iD&hE#‹F¯“1ø1û<æ%¨-"ÀNI"H˜ ëË­RÜÐÙ6×̱9ò™EÇfQ%ÙIxá{˜>9[ŒLÖt“ÞŸ”¶*Ø0M‡†-¹Wvñ•4Mˆso_ˆHE‰ù/Y#WWȵ?2¹HÁy_’:ˆ)ö™Âå¤Õá‰MÒ}'<8:Ù¡ÇS¬0.o`•àò-¸’Øú˜É£Xíÿð(–,$cLJWaÉPø˜C»]Žë 6¥÷³Ê j>*âÝ œI67ø‘çƒÏû%áóLjýŽ÷˜Øk&–S(”U±Ãå¾/À¢­û®QÝ B@_@·{Õöhx’Þç`OyÙW¥¨ê²fä¨ÄÈ=¬Ö7é}®•ÐøQ”B ¶rb·Ï"G(°·õ8Áøñ6ÙJÊM¦DyëLü¯èyÍÂd$΄ÒSs»Ê¸'{jÅôïg¶óÔ|ÎP8/!éø.'»É¦*¸`Üd[EH5ÛÏXœ#œèðMçŸ]}W²ìnFK&Ë:[gDC㣙é£NJàa»{VÂ^~v‹Ü—#6Þ1}« >gg¶Ÿh½âÖ\,… pj„þƒ^ˆ_#û¾Ÿ°>0;lÎÑ»“#®Cf xua²fý_ØÄÓF…ºõ‹oKÖðujÜãÆ—©ñ7þƒu”C Ì®à%zžŸsã³Ôø"3Ë‘ü½¶Ba«‹ú%BTjñbò8ÒxŽÿ‚y¿.š÷ó-Œ>ux¸·ÁävMJ8–åù”MKÑHwìeÉr9ãM¢âïrEsÏ!Èi Ò¥ÆëÒô+ô‘zS2ŒÙð‰áÓcņàþŠÝ* N¦lèN‹˜Ì“’›eç Ô”T뇞Ì÷ü½ÒX¸ô¼2Tóôü5O¯9%û…—•¦º‡”ø ¯Rú·åÏߣŽPc!>HQµK éFè'²ð”Ž…,·kEn R梓ÊKšWµP~Õq…ÆIÈÚN~¬ E<)õ¬Ú<ë[®ø¡O’M’;e6Üö‰Ü˜3Æ<î|¦*Æùï@ú/àx…Åßdn@¹Ñ%÷œ%yD@™n v.ÿ­FÑ@lÜ>ëzTj¼| /Æ:ÔÃ,Œ›É&¾ŠBayô|ˆXømáOˆv^a-ò`„Óág—mÜmØÃy#ÚŽ.ºÛ7%kÅëÙ/Éð–S°˜ç%® Ñ”ëÞÉ62÷p¦ mñ³‰ˆ _U1³­*JW’¬Iê-üaW…ýøã£¼0Aò¨¿>Þù½(à#…õ9kÑ%•ÃOÙäŸ+ ôsð›'Zµ5Ê?|báÓàu•–Tsÿûaéd2 ú2±¿DóÃ1eðƒf ~F3ö )þ[¾mM^AóSIÉç%$–´þmŒ\òïÙÝÛ7·->ÞQí?‘ œ¨é4Ãç”ß·wïÅûØÂxì[·ÅY)zC$gLP~=gJUŒ);üÚáWü)t€#}&=•0¤¿¿ ¿eÜZÀPçÛE5Xû¼M¢u Ãû+S}s〿𲆅céI—½–I}êäº>¥Þ(£‹gªVÔa¤I_¿'a^MŒodX˜¹Ÿ!¾úàß%ÔþŸÄxS¸¿5cè›ïæpör£1„)ç¸DòöëtH°)õñ=Û‰gÜóI×qoí(p{‘ö< ŒVÚbÚ³àÿ|Ÿa͈Çòm5ckŸA󴉮à´iŠé3%î«9È#µŽÓM"…Ùq,¤~Ð!…Ú°o¢ÉÓUܰhˆ>]ºÄÊßcõCä½ì„ £mØ&9VÒUŒÄG¼o,}üó ùEþ±±‹à.m%é:ð^ ä5ÝŸÓ}=¾?‘…g„&-îÍ®d¿j㯚ñU ò#yÛIKHnxØmEÀ±³·_Ÿ ~³h –ùloç/þ¿_Ç\ûendstream endobj 674 0 obj 3919 endobj 678 0 obj <> stream xœÝ[ëoÜÆïçCÿˆƒûÁ¤ë;q$— ‚qÔmÒ$ŽŠ pŒB–dI‰^ÖÃIþûîÌìÌî’Ë;É–ƒ¶0|â‘ËÝÙ™ß^†?ûgËÏvaˆ3þÖzhµÜ}³ —Õ²×ËÎÙµÒËݳÅ˪­Ûj]ëÊáßUï†õàºêŸþÖn½²Õóz¥«/ë•Zƒ³}Ç'ÿªWF÷þ¶©^ÔžU} Oò—ÿá¿}ßÕ«îÕî߀4«RÒlÛ¯ç©Û=ðõžS·0reõ°vv¹2ͺWÃ@njSû¹ªC¿FcÖj«ßÃ÷sÿ±nÕ¸jÏOrê ¬léñ©'ä°¶°ÍÎÀ@W}QÊ_ô]uá_¸òó)óÁ¸_ü®q¢3?Ì«ªËtž§~¸g€½:ñ·ÞÀr~Ý÷O/]ÝÂ+~ tH¤U8]¥á9\ÃvüÊT´=+kù=ð倧p¸(=ðÄ·¸(Pë@.ƒ'ÞϨP 2lèu¾ `µñ×V±nj¦÷˜˜ªq0LaiFJ˃\Tõ®n_ß;d”€8d¿¡Ýû¹ªÇ~ܹŒ{ ãh’zÀ{â9ýD ïaå™ÓvžÂÅX‡âEt~Q ”5„Ú î¯ü`¿‚i²VJ€åÆöñÝ ¬ßDA¨Ã¦«~ª ñøW˜ûçZØZ’ó5¬gQ†Ç¦íüœzšh¿ :á̘näpð¨n™!–ÖéŽg@ŸßƒJ„tMë4 Èï Ø×yü d¬];QÛCܲ«pWcÈìËh™ÖªôqP1cl3R¯.AY| [ëÓëZþ[Œ6Ö#³*E–A¤"0ÚÁÅ(©w^DàÈÍ5HMÒ!-jÊ¢À—Ñܰ.ýѫ"‡kX˶ =Þ™\„ÂuÓÃ5IR¨pd,®#Ú1 wòyGÏxbe‰,¸,JǦôqž b ïý<0x‡0ð– Õ–è¸8…ž±ÄÔ¾ú¾FÜôCõ  AÒý.âáôygáƒBÁDk•³™Vµ0a8Ù¹~ L~dFh#ÄЮrS"^!ð>1­câh¢Žü5Æà}ÐFÖG¦•Õ­Gʃy4Æ äöà²E$ÌYu™n‹í@ÛàiÝ8 kŠzÎ^)Š;„ìÌmŠH˜Ý$#Þq¸×p•ø2`µܺë3'Xƒ ‹R‘ý"((ˆó º gl˜„• ¦Íûq”å! ¸+êÌæÓËì«lÊ´îÙ9‚¨v@H{PC´aH¾M¦öe1Αzƒ’´^ƒ+%‹ ;Ò²¹÷Q'Aêljiè v²¨Õ!¸Ã‘4­&¯U¢—ÌE»Önb.0ž‹5~ˆ|D˜ÙŸâÁ‚Öâ&DÏ®‰™=\ÊlDo¼„ÄIE¸¼¬ D¯jºnü4pý”½ m-÷2™+F‹fS%Ï܈ð°%w“òÿgìêi—QAƒ‚—9…<ê(¬õZ"W6’>b¼3ÊÆ¼P -º)[ý”hý€£F?ÁBg¾®7LöaHSB©m‹QêA¯]´"ð÷$‹.G`Û¹m+Ÿâ2ڙؑK¸[ñU°Aƒ€'‹]3¾  u]´tà@]D¡ƒ¥A³,NæÉT\ÕŠøéü†SDt luÂs±çÁ ¥¡‚ÄÙÁýÜ%æø4#E3¬gS˜xêQà…LCü­‰MžÕ®,‰¹Th`…£È.R×[†HpRÌDFž‹îÅ‹|‘Š> w).íkæ^ öàýV̤í¬Èã[3DQ†ö$þðÎ!ï&>ÏA¨xðÆ×²7°¢ÃCÞ<í‡`°M&S‰7ÆGdtVÞ6àEââ‰+¸mŽa²©²ûž¢I Ûd´Z»xjÎEvâ†t'IzBGW¸l³ê‘ƒ†¼X¯Q8tF¯ÈO0÷ oṯbsS:Þ°‘˜Æ’B-D£ÍÁÄ ø÷Ƨ0-øÊ'¤pú¥À+L)>"‰¼3ÿħÙÌ™"Žøž˜8À8àÑj9þ¤ÆîB¢O[°€WÁœ4ëVIüõn‹~ǯё³éÚhÚ9]Õ6Ì;ì9¾â½0’Ž t®¥ŒGÏüg“^ý9 ²MÂþÑ¡Q"6Ȕӟh³;/Œßi’ÑÓ>žv‚ÄGõQOáãGO³"Ǹò—ºÁ Ð0Ûhx‰Ñ@ì¡mÈËÈ““HáQéæÜ¼Ž7ŸÂLáv™¦ÍR8N^:,|'7ãcHÊ t^;‘›p1*„ò|ó¶Dçe¼y+7oâÞoÒ%yäYéõÓĪŠApl|¹Ø}òÉõ¹˜&$<0 ð(ŒHÚYÓw΢^ϰ‘߉,yƒ ãùê"e^ò:ƒæ"›)¼×¼ˆ/]¥{Æ‘ÿ[JÎé´Ïlw9ŠàÒ7‚Q2€xÞòX" ]˜w=βõ:+NušúêÒ²“ä]hÎ<–=›€ë(èwPüŒMÁ"ì3¿;AØüÿŸ8C$ öAqÆ7s”ýˆ@›¢+7] 4kâ‰{ÞŠáÇUªp©ëcÊ«Áa qPbàõfñžgûˆÖ|xž†%ÕÊ|›{š¨Ãƒº§äØóž2¿ô‡‰DswƒqsÜñX÷£Ú·ÿÝjÏûýód¿{‚Ñ_#­ëcn$h/˜Î Þ?Á ¯úd²ê…¬zÊK£Õhi…Sùˆ\û9ãjfoÈmÑ÷¦Ä¡«‡sŠ ûòü¸¤nW¥›Û™ÂZrY’yQíoJ73œ¥N³g¶€Cijmš‘P8:ètìéäÒ¿†‡ ôÜ%ÿ$rÎ »$gL^-$FèŸ0õ}Y‰bÜùkÔ‡Û’ #¿ß”ÌÊiÔÞ½ôuK1À’¹‰«_–FÞ¤#7ÚÑóè„‹!ýM €‰-I¤q’QÊò¼ÉtpÒá'ZwéJã*œÒ~¬Ã‘JS*Ofø½_'ÕÊà…“92INÏÇ’sƒæm<ÿÇ´o<$#ƒ_Kî9)ZL³šRfùÑ;«SÊäáø ‡f:“LZ4L3Ó¢Q*Èz~èÁr„P¤’ ”0«œ„×=˜ïœ×ìÞUBŠùÙæ6\õQÂy¡4#¤A ï”&3¡ Ö†Dü–µ¡çç‘t}ô’ ý¡ª#^1Ÿ¬sYòèóÝÅ·‹·Kc<8¡§he×niö1˜[šÐ̳¶øìùbçùWË›«ÛÃÅÎ÷KµØù+||öÍ3ÿçù_–¿[|þ|ùí|ÿR® Ü¿d=”;Xf­-µ0mî1!QkN!jG95àÁµì÷`"Æg»<Ï=»Y´êEfºqÒms‘ÇRƒÑ£‘T5ÈûªX¨°¿G¬™S<¡Õ(–2ÑžäïÇϵʨšp Õ ,˜@ÇXÚÞÙ ÊøBÏÈÌì…⢷…661I µòQ- üÙê`±A…ë¹ák2æ¶'¸!mOˆ0ÒB”m¬0k*ƒI&ô6ùk“tÜbЇ8wKI1©/ܹŒltðÂSWq‡|¢¤£11x˜¡BMz…´QžË+.ÔžHü¡¤»o.§^§O»"îSu£¨MQsê8eaƒû¿Q3F,ú‡75ç¡aJnQÈ‹R(keB-^‹@ßû˜ŽAÿQªJ¸Ž@„ùG@å£(¶U`Þ6ie%rÎóFb]’dý"9ÉMsˆO6%eS6_Tä±51Ô"Bä’‰B·!SŸTóòI°52µŠB¦Óƒv¦G°MÅǙʑ eP, íNZH=ç÷G©']/Ñ—žœ@hÖÎ i_Gìã¸ÉâŠÜ”PëqƒûJ*g(n—¸àlwÅzÿ¤6–u‡´X¶c)‡'±+‘ûòKœ6˜Ÿ žu‡R …ßC4WÁ2÷”4 mU˜‰ª”Ꙏ×RçF0g•ÎQï`´€qÐc̨¤8ôžuɵµ£„.ï1ÔvÚc8îi;` í0n3ÍŒWÚk™µ|ÅÂåÔΑx¯îBR›pqª;aª>° o=×JZÙ¥oÃñz³!¶RÝ]¬Z;»î>bˆ­üñÙt°ØY+«„A‡©+îÓ{la Ê`7:ÅÞ0ï ŽWÜ#ªÕŸ»÷Lƒ»mº¬ -f‰¸¹•»ÈC “¿…ÉoÙêA|l)ö,µÍm”Šß§úM¤b:»¶6J%{º.;÷TI—ûä €ååÉ tmç¶°Ø!uR§–±2Œô ¦nåhÐrû†°öAÝùÃà¨0ßú„}!}GA + ?¾nQ¾ÖuП¥•g¢þ˜Êל||⃭múg E*ŸÂ¥¡pL‘ROÉLç–µäøãO(VšÅ:kUÚlC¼›ê˜õŽLº,¸y`|°m7{eØÇ)öÖZŠÓ" ÞŠq¾Ö>h±…(4CÞ±åyt—Fç=s÷Øzèu6ðæ Êx˜ë¢®áqçf§¡NæÖ…z쬆<­¥¥”FäŸ;J;Á‰.€Ž““«ÞÜ 0>AqÛ³µ2gF> stream xœÕZYs9~ϯpñ‚'£c®ÝÚH² »²Ä\ B.;!v8Šâ¿¯ºu´dkìqŠM¥Ê±[Ý­OÝ­£[úØÉRÖÉàÏü߬ÜyÂDÑ9­dÕ+ ›;æßÞ s¯,’)RZg5ëôV´0딼ST2e¼Ó¬¼ê–IÞ•Iþ¦ÿˆT")‹”WJªÿ^q®'=Ù½Ÿ°´®+Ywï&¼»ôx·ôͤgž$=!Xšee7WÊÓ¤W–•jÝ{‰D±¤W¨vλHlÄDZW¥îé„CKU“é}™ÇJ†‹4c¹fz” £ÒRu  8À0¼PSÌ™P D޽¨_LÀ(Wz„b ]T Ü¶?UX²,ç a¢ë»QÐr%W–\›R°Ú7eOy#­‹NOdiÉêZ›ôXõÛÂÇX‰³­„¿ßÂÇ|ìÂxTL7ÂÇ>|¬)(Êa u÷ŽãYUzx¦hðåª7PÙCjwϱ)ÈÆºCGñ"Æyêˆ#¥/«=®Ý˜¾C"¦ý€°Þöi…n“MÆ®}ŸÚŽx€´_=PfhR¹u_c_¥Æ;î+¸Ž1™*?©HÉ‹Œk?öåg`ôO±Ñ“.ƒÑ†Ã¹µÃqÌÑÁ_Ĉ#ß—0Ê×]GésÄ5"f>Ñéu¨Q²î/*ûõubüUͰnÏ3o^W3¦Á*ü>·3À3Â[Ç} 3D‘çsáñÔ\ļGìñ(fé÷& Õju>[Ó8Á|±š†±à! ï4YgyÎÎhèï¢bLoT7QqÞa@Yjó¼²jk¥¿:ËçÇÆ¡EÅ›·i‡.4ã‹îZ…7 ×b3Ó›®ÁÚlÕW¾!‡Æ¦ë¾1¶Ò™Ù‘Ͱål~øÙüpà 8øÙÜp¶‡7Ü€#»åyøÆnËÃVX çÿ ñ1{dôèn=ø]µƒ†·¯L/c‡žUG ­1•­ô¸Ôçä¯S© ÷ÕY{_¥w­’)rÜË @‘£Ë ¹¾¨s?Òæ )Ë*å=ŽÒEfŽ89ăҠö`½1"mà{V)U`ëIæqbXŽ 1ÑJ±+ìØµº/ýx4ntË¥ùm`„Í8×Vw Îôøö‰P†  9WSGxÆ£qqâIFçuÒ¦w ülö9á謻@}ï]rƒ ËLJ¦2  ^ ¸ °™ |£í@ÓÖ¶Áà*ÌËT=_‚¸lÓÈó-ðß!±å0ÉI5ž2yÅ'Žð SMäü»ôŒ ƒ‡¸€ÅFÖè[ãjÈI!¿ô”I±Ûw`QMB舰ž2:ufFü]4Öy¾{…l-Áuï'ÖÓ3œ¥×%)p-¨“ø,g†¤“p$‘³(ê…rê· `  bÔñS¦Ò•<ãbfüÐù²m5jåOGÛ$|_\ª ™a„ˆXO;_“†ä[d,­ü¥2a<ØëäžjÕêИvàò»ŸØ´|èâWðñÆ~ÓÌÜФrÌï´ä~s ß(,n9bŸˆ;ޏNĻޏÛµH‘Úµ-Qî-¢Úw’&Þ…¢„½æ{Ø‹,s|ÚIâ{…7"‰‡ÇpAIŠbu…úƒO@¶ç‚ï õIh‡6ï“àìàíó–÷3QϦxwD`š]¡ö—JNdºèß×ÿ:;Á±~†•-c·ÌYŠ©y‘ªå߃ó|Drà­<‡*Xè­‰ãGÌS'ðZ˜æ¹`@E´0É-†ô¡ú-÷1 òÜ Gò÷²`6œÀCg™G³ÁlXº*‰ÂøsBÃ-¨6ƒ¥a¡úËÀ" -`©è–¢{ká1!\÷8Ñ} Û³®»ðyé„·m¸ës3.I¸'.°$”³`¾O„ß;âq°bQ‚­ïèuyY‹·ž½sDo š¬ªÎ<'OQZ›-½»Œ¹­ðbq…å– =æDAãÂr¢€r o¯;Ž lí´Ù÷ Y¶Ãg[öŽ;Ó³dþâ°··0m-çðçŽèyv(ç>‰ML*|n%#w¹pU’­Ú¸p¶­®Ñ…NóœÃÂÚ°kV[ÌÙ+ Úlk¨Ùˆ®;Öq휳 “ÿ¶Ã)øâš EˆZGT#¢¥ E¥ám×åXÄH+'Þ}ðåæªÍA…ÀQÌ´®%ÁÍÝÖi–Óñ …åžEÀ ׈h犈v~¢‰ oí@Ç=™†]÷ê€Co}"sÜ?¥ŽmVwÇí2ï:X ûïy ÑDÓl¨çµ&…7½c8UE¾qÍ[D¥mŽZ1€œÉ:”ó’1›,ç2|jR¦ V¯ÞÅÑe‰ˆ–Ú™«¢ô“ àä•. îRq êæXt;¥2!ž•*Žù ütæ’Å‹”E)=½ei ´¼b‘šµ©ô]k«p~–úGï’6zµ£´A®/gÔ[y•Ù¢îtŸ­k­0€Pƒ.‘Š,KKní;փɺk5èžRx•´TeÏ©Üé×lZ¬Âîî*üS+öÕtwx%vÓÝÄ%Ç¥k f¯÷H³®»× JÂaÑ îm”W༳v|ÑuDq`®r„:³×Uá~JŽ?a‚qcp7v¸õ€¾°WBæÈí,fâÄ%q&†tqKñ“nÃÛ!ôš åü]SÎ?õ命¹ 2;€ú‘cKÕ“×< Ò ÁôÀ@ÀkÞÃAa©½ªÒJÔ6@*Ïæ¶ìãÜ:‹¦²ß2¦ŽÌKîø"œ—ãÈ›÷ˆnÚšöDZ)9ºR> stream xœí[ë9ÿ¾Ü±Ê—L‡Ì¤ýhw7ˆ“îà@÷€°'„8„6;¹ÍrI&·Ù̓¿×Ë.w»g&$¡(ÉŒÇm—«~õpUõ§íÆœ¶ð‡ÿ¿xvòà¡qáôòåI{zyòÉÁŸOù¿‹g§¿<ƒ)ƒ‹C›±ÍéÙw'ô°9ííiüÆØÓ³g'YuM·Ú4v5àÿë~7ãVßÄ¡³fíW¿mÖvõE³6›qüHßñ—?7kgû8ìV¿;³ú~)þ*~û >ü±Y‡¿žýHóF“æ»~Ó‘º³m¤¨”Dªh¦3£ž¹ö.ÒgO×®Ýôf鉫HÉê9üsÓ¬;gŒ–¾¿€Îù·i[cV÷ãœ>ÄÍêA¼mÇèøqµŽÿÅ]àxÏÓ´Ûx`Däг4ø(>Nƒ×ññvŒŸûÕ. ~—wÉô<®­ù">Mƒçy°xœ?½Œ,£@†Ï={楞9§x›)¾—¤™ ã6]h#r¾89»·ïƒ^ ói)80Ðáž !úbx´ÿP™þøìÝ4ø<ϼ+4ºÊü¸'žt6ëi 5øÀ¿ø:,®j”ßÐGïMïu±ªâ‡Ì½!âîåKi!B ÈË„:ä8‰ð†åèB×½ƒ‹ƒ iy“*8o283÷wy—G…Hxð¼&ѬOóàU [–Õ°°g|R ˜Qv7V`8쑌±át” L\ÁZ¬~¿ìpÓ¾DرGÙÕ½©±÷¶&²—zPá—¯ FñàeaŽê|Z'FuãpÈ  ¯K›„?\¾‡MºÐÀ˜¢zÜ]MXh¼‡øyP3ÏSkÕšüøvPQ"ä/£ÚøÍ‡Çuæß^»dXçç¿® «úí*¬ó4££ l‹ÐcFäu&ò§ÅJòñÛæ“±VÜݯ ÷’¿)•á&9hü¶=¤ <øuTºQC{Õà:{Ū©8¯ ÞÖd¿¹Ä˜³óE$iú®!tµ­#ŽÙÆÁßj˜jRˆúûh»HY‡Ô£×Â-F`7q¡hKC‹ ¹jС @eÔ–[øœï[ ¼qxWMO\Ò*Àá‹b‡.ŽÛ[átQõHñìŠÕ!#‡6ê’ÅŸ_æ¸H-’‹ƒ;Ü Ù5®§Í^C`Rê;„ÓŽ8à2)óÙ°Núå G¢ºÈX xmÇ^x ñÄèÑ’¤É[ØÖ'máÀ8§àõ½¥9Ï3LjÄ-§ÉË05ü->ï[‡Ïò…±øXglƒÓf\½þµ­%û0Ä;EÛ|xÓSlÔ ­®6Îî§ú r¯ÊÁ¦? x£ñeƒØù¾g4‚®ô¶à"ÌŒK!`¼€¾W%nùZÈôÄePx°ÄÌ‹O!9®uˆ³º¬ãýÒã¢ýê× ² àÇŽ„˜÷&R…O?+¶€dÃÀH’l!Œì<“N˜j7CRY„m÷xìhÒËŒ¸Ì¸¹‹“Ìðž ÛšíL ¯ð(P=sÇøíŽ0Ã+À=I`È`Cv‚}4¤Ç!€dž¿<¥¿„: Ç{ñ¥¢ˆÛŒšR´á@ãóL›éª†´;¢ÉŽyt.*¶’£ñy²’o‰¡ü:µ*̤?¼'üöžïp#µg·wÏ‘ò ¡u«OF΃ނ#±“£Æ9Gö˜A¬¶J¸r‡{7rA=¢äÊHâ±âá–ႚ}—a ´•Vd&_KŽîHè%IËÀhû-¿ëfdÙÉHðñê”Q%l{ÄÙ=®¯‘™b8†¯ƒ#1ÂŒ-|CÑamE¬IÑÝ@¶G¼’¨õ]&©Dá]ÆÍe’wö’^Ûå wwx¶.« \w#ž@bˆ`[#¹MâcÆ;3á|ö2èÔÿ=ÚmûNÛ9Gë“Rù€,®>œQ?ÃÙ¥)lQyùŸ ®øHe¬~^o|“­}%B°rß§Áúƒè²äÄ=átù]ø…×q-C^/®jYþ(ÒGZì·¦ŸbÖpaÒ¥˜S@Á(Õ™ÐdˆŠ½<l t¢Ñ±8Éq1Ú˜ÒÖ†q$2À¢L>€þ*þf+œ2 BÆ'EÉÆç¢‡8ôÉËpô`å)‰½.)s»¦£•†)qq›¥Ï’%‡0…Áï†Y¼#{MÁãr¤‡Cð‰Å:èõ#ë2‹YÆŒWæåUãl&Uàù‚ÐE“ÿI&æù@e \”íшšÂ^)´¹0–¶H0ÜÜ”Gµ¸qFÐc‚W¼N[o²ë’5wÌW¢á((©TÐÑ9¾OtI“‚ÙíÄ'F4[GÙ6M)ÉRZ¤¸_¨ÔKÎæLaE”] „08‡v(v ¶ËSý¨ÙãVTôõÎJ²»Œá;TÙXµ-²•ºƒG *©Ktý\ Óù‚Ù½ÝP.tê̘ KæÜ«l+Oìȯy¼ô "Z«¶­ÀªêyŠH—NzCСIú n 1X\¯ ¨¶ÉN%Pµ37w‡¤ƒ‚aç ¼)DÂØŽ:;ÓÂ[‰Nr$T‘ $!†tñs®“&âuâíÕÿÑôjû)õBÈ83bªŠ·YÃÇžýÒ;‡Z *µºM9ò¯XG%ú“P9 „IÛ\Å»nŠDJé¦l¡+Sº¾§>ÈY©¢š1ÏJ½® ª”«ÊûåÜ’ª·9¸î5•LØ®¶gÎrª¤x‘›¤£~~Ѩ<œ<óUüM<.©.²ÕMóÔUÔÞKƒ˜5-.Ò®‚F†î}f³Ñâ®–.³«* êèû’úÕD¸ÔšcH‚To‘k}O’ò3oª$-åî•*VUÓzÍâ–Ðí¡0+¬Bú»€E » ÛoÌƘÍmÄS¶pT €ÒÔ{Z·biþO~?ÆäõèÿËMÇ1"÷#,_Íöü¯<·üáÒч0x?†¯ú·™ÆIe,ÄH §TC¶‹×z\Ñ¢~šðòM“JK¬7tÀî@%­ÈS¦B¼$€±3Ò«d@N-!Ñ¥ûÓ¬D.º®ä"g˜—G^‚S›Ár܈ÿ@˜…åÔÊ9jŸÄÛg-ÀT°»J³ñ&á˜ÒŸÜ WíSºO!åÇôßAxnÇP¿Ï;yò`é4$ÞläcÝeDqa6¡L+€ßðïã7¤˜1õÎRrµÈæÄyŸ²ÏH)]öº LETÏÜ„sŽû«®º®[c Wá,%:tÊ«ÄRÚ¢oK©Ï¼åÌ\Áî/eÚ'ƒ²H€Ø…‡¢¥j`Ê F#oíM äóˤŸ©ü“ø÷aƒ…`©|ÀºÆY38T³ZvÏ83–˜‚ ,ŸO‘ÝiY8–DòÈIÛgÞ”µ}*VmÈ™“æŒêð4ÐÚNà‚¦(O ‚í˜À3IÕ%‘}ÞH&MŸJÆâÙ˜ßé‚_‡²S´vé G*ÁÅz…³2—ÈÈï®-'/²FäM¶MJ3rÌY2xå#²Y˜‡×ôtY(]ÖÛzÝÑb³ÚÚÕ«¦s©“Gú?°–ÊP)Ñ!8—ÈŽŒqRâHîQ*q4ÍèÎ’¹ hô{œ:.â t=}-Î(C B –«ž¤jÔ[·.A‰1‹=–žžÉ˜Ãûý»í‡õKg¹ý¿¿|GÙô—+§–Ä+î`I~/¶“úlY„B!53˜Õ•¥’Jª‹)dþH½Ÿ¬ëðgöPµÔ|™í32*´è±R¹wÒÔ‡=‰hn ÃH—½š÷¥¨6·®£Œ6Ödüú/²Ä¯mU*Ó¨^ÆllÊò|q½ÂJ·îVLÇè§-G“r=XÄ·´@kúéå «£à œjkQ}N¥ý³ãPéIŒiA,{ƒVPZ[ª†›DþRðØ÷ËÀ:PbµœRá0_N›@nÚ„Gq°l²´Åíé wÉò ]!x·´¼æb35-ºœ2úV…‚̼‰ô§ ™0E»+bM›¬xä#¦‡œ+5–Úe¥zŠ[•Ö©Jà„U'é­ŸÙÉ<õ§ âŒÎ.›®ÐŒ¸­¸& öÀr&°þ)Qˆi‰Á 7<7,Í|šW2ËJß·VI=Ý;©Îhă½>”úy¸‰%ÉïLFû§Ñ• 1-³/ÔBþ;´|EÐ<k P¨@—'?Iå¨M·yÉ?5ðˆP{’OI”®ßs}žÎXÆêhÊ‘Íø t/hݱƒ½Ö ý¢G/ò^~fi`1f®ïà{N}ýCêâ6S»œ±õfÚ–¦½¨\˜[„°!$„ÜN–àÀ×cuÄ­LCïôBkë‰_¢6e-åý:J z•*®fm”g)ÚË´xÙnaþ,²W ¯Eá´Py Te§ø@?.ÆätŒÒÜlE?’îÆ)Ò½à3gæ=­(ÈPëâ%¤‘§ Ò…n¬Zô>¯øMjªâ0œí¼D ùì8ôôýöË{ ZP ç°°ÜC[ò`Ðfr€ òæ‚j³‡F(ÕËt£üwµÇªç¦ã¶E÷]ÉÉ-gäñ«xBl¾wE aæŸ\›[vY@Kq¿ ¤Þºä‡&WG‰p–3ï$·µ¶­ˆ‘9¬ij]:¿  ì6ÆoeÑc•@|]RbéE’9ëDbA‹(ˆ~Iã¼éŽÉ7‹/çò t€ÂÁ' ç.]—Ãm‡ù­ü&ˆ²YÒáYÆãÉÏÁùJ+•ñ÷&ÿ¼²#‰X'ÄY¼Û_°¡Èæ,á_HK[ä(õ¦ï¹ç•´j$wù¦H"éÇuŒÉ,ú­IûX R^4Ràxa.½*gý˜óéÊ3y_è1£  EbJ½| ,©¾`2›ÆU·Åúé`(¾,f!»Ðºiô-÷juM+n2æXȳy ózËBu‘jYHû!æ8aLÝ×ÔË"d¥¿½–»ó$C.7Fn¯U2~"O(¦K“{ ¿J΄J£­éæFMÒOõ—`fïbÆ;œHö}?UeÇfv|f¶)e‡P=ƒ`€¤“st‹q%Äg)ÎÛʤ=•WI•ʯ9pãÏÉSåkýÙ»œüLöbñjOŽëŽâv²FSq¦GŸ-A-@rÞnÊzï0}svòBÔy&ºlý‹kÖ^PIéÜwAžM/0 ꦰIYAÁ>¡­ßØaZ¹Ï4¬C®÷õök–jÁãM É)êbNy >;;ùCüóO_w1endstream endobj 689 0 obj 4386 endobj 693 0 obj <> stream xœíXYoÛFî3ÑÁGn`ÒÜ“»/-bÇE iœªÈC®å °$[–œæßwfö¤$·M‡EŠÜ9vvæ›c}_÷¯{ü~ÏgÕþ[.M}õPõõUu_q"×áç|VLEqXê\ïx=¹¬¼0¯Q«:.êɬzß L7†é“W(båHd0° 5™ç!kUó’ñÎ9«\óœ‰æ kE3Áõ#ÖFÂ[ÖJÉ»¾ Ê;Öƒšl˜"±ŸYk€.DsœÅQLvÎ~§˜@Š5ÈvAÁRæ'²ë¹öL¯1‚gœC£šƒÆ9æ^‚RÓ.ðÅ•AF)è‘À.Q»´¨<Ò[ú^ Nf„Å´#m¦iá])¹+]Ùr-;ˆY+ûnàÎy—ÞÀ¾Í+玼t‰ß7aQ6xØ‘7§ø¹ÄÇ,üIÜâc‘˜Ï‚e hU͇&‘€=ºö6-.òâYZD«zG¡¼L‹Ó'8·ßçÅiqlrÞ-Ò/Î3gá‰y¢ßezú-/î![z›é#¿”;õ–¼³Ó’Ó]‹ë‘óò+F1¤bºœfêãÈ9;ăR¨»*¼¢òV(Ó)[·€amzáwùÎ zŒ‰>ª Fÿº+Ì9¢ÏÒâ2sÎÒâÃNïþYÈží’_=áý°X¸4ƒý‹¯tx É…iC§×Îþ«ùCo×ãüY>?ÅÉ®wåÏò«ÎŸì¯ë]ù³ü?¾ÂüÖ®Õ¸A䬂~Ä»à Á$L2°o i xÇœ34me4á0ôk¹Ñ©qw Ò"vj©ˆû¦€( $¼Ë|7ÐJoáÿÐ1j‚i>¡:¤­XÆ¥Ô>Ê5ƒÁ‘ÒÑF ¦ðDG“ꤺ¯aÀ04A·µ0Zဣ-xßZœ¬Ž«ýãëÕr}Qí¿«yµÿoáçøEýMut\Ÿ|éÌ% ¤‰À}:æ.Kz ÖÅõ: YäË’õ9ËL~ÖQ½eÈEDMþC'ß å‘Ñ|£$9I;|ÇFmˆ}©Éu#Ÿú1 ãxS^ÎG>-a:`â ŒrÀ5Ý|Fxà ¦1‘$¥ŒÀ9ɾIñe™¼q¸B EÛ:™l6ÂÜSøž{7Ì#7å=7®3v£s̘À„Ô‚TÓvpn’èÐûu†fò+Ú;õPó í¹?çL¯êÏñ@¬£E觘§™ºZöxï!òÊOÑ‚paÍ»¹Ÿ þÛ; ^LC»^¡•²à§i %ÁTá8!!;1­©N ¸H+r!ÕJ¯;àÉló.T‘¶¾x~öc¶•E {h.ú]7ýÒ:˜,††BØ9NI± °žêI3bOÈ^$À~bÂÒ^Yâq‡‘ä“=æ¡1n);)k,](È‘˜†!ø=­‡³Ik)¹’8æÊÐÿ¨ˆq‡ýŠ˜†t4ÿaãNAw†màKÿgµËÊž/®_Î{4„Lç†DÚ(óèÙ“NTõm‘¿Ö'ñ¸™ +ªĨêqµö] S /‘zч2ªð¦AÓAʦÉ64Ií;œ4æl£Æ3ù³®Ó_âÄ$èMü/¢7W¾È¡Æ]a V4¾á¾€³³Qý,vŽ |{âORô8M£å߸§ÝŒ¯ht»H|³Y%êY¹‰ô6lÅÛ´<„w±ñÀL¥ö¤úgµendstream endobj 694 0 obj 1453 endobj 698 0 obj <> stream xœµ[[o·î³¤á¼ùœ"Zó¾Ü>:mP Ò$*ú¨-Ëv[’#;Nþ}97r¸—£ãÄEÑXÚå’Ãá73ßÌPovf°;ÿã/_Ÿ=üÆú´{qwfv/ÎÞœY|½ã._ï]àqçÌ’K»‹çgô±ÝnG¿»x}öÝþóùL 9ï_ÎÝàœõ~ÿä`“cJÞîoùñäöovnJÓþªü4y“Æý‡s?Žƒ+$˜ËûlÝ¿/þ&ˇaÌ£…åc‚ŸòîâïgünóŽSpee3„lm€‰Ëtn˜Ê(šwiôû/Ê› iÿ¸ (?—‡2Aâ[š +ï“wû¯`.;بÂ\ž<¬T&Ÿpf˜lš¦²uPHœ²mCo`z;&;Ñvó=5¹¡|“÷ïpy“bÚ_7I.Ëç¾ ”5sùé{9ekOSÙ)}äÊ1±â‚-G9Lf"ÅMeã”âV‚-„0¦ìðøýíÁÆX»¿+ËÀT¹8ûúìÍÎû!áÙŸ‡!ï¬5Óó.Äœ‹,€¦GÏ>þr÷öÇwWgÿµ³gÿ ÿyôÏË?ÿ¼ûÝÙ_ï¾ÞÆY/¯à¬èP@ZÖ¡íû(t@“±h;ʃmyCL çÿ_ÞŠÖò>­ŠŒ!å¢à¼^PPNý<ºËï×0î²l ÆÁ&oÊ7å!H>å„®ùórXŸÃ ~q(0ŸrFH;:ÕoažÇ€Àò¦ã+8à€KÞÂ+ÔÙÍÁå}ãOe$ÎýŒÐààCòeÍ€âòò )ɃßÀWï?>–¹üþ5“Ĺ¢}’g7åe†Ed°½çðk€oà ]¬óg´ã’zvY*‹Âjã(å¾?ÀÉû‚•‚I³»xVô~MªunÿB xJ§ð+êãi›•ð%3W„•@ÐhÝþ=÷Å‚MØ[?Ä® GÕ€5˜ž—cÅ'øî¶þçÕÖ„E=~*sÛ´ÿOyôþàr‘3p–@ñŠ,& ÎOF‘±¸ãþP–8hÆÞ‚eȘF D Žªó—íé*tÜï‘w0e®+À¡[ÓÙÍüOÑMå×`åö,‡x8àžáñ- Õ+<­PxEŠæÁuAŒAàÏvu['q~FO_¼»Ó°…©q§#ŒÈÍ3|›ô>4Km3ôN²}ÄzlÑÂk8jØÎ‹ò>·ÊL.á’ß6ÄÓ¼s.»riB!ês6ÈÁ0°º€¢ÞàM¿#š,ž5| Ó=×€|“ƒ"ªÉ%áâDÀOÙ“Óá¯}Úƒõ ^L(ðý(@$å|±éT¨q¡™`OÕÐ\$Í4¿/`ÿï*ÔdÍ×ÀT1T =‡_af‹ ¢1tDZÏ@©^PÇîP_ªœº칄z5M¢œ&L‘"RÄž@—|p°)]rUåààÇ?‹4ìvð!p¥Ô‚Õj;³½»‹HNq øþ30Ë/Ÿ0Õ];v´‚òl·¨ªsû>\¦N|2Õ@ßÐ}O“[b ¾…qײfÞèuù”1üU"€àmsB‰ ²ª£| å´Œ‰âýSçü}N¸£çMÛæpu”¬á@”Ð^¾œÁ““ÉJïha€qû¢LE÷Ý{¬§GpëÌÉÉÀ>9òùBªãU=‚ŠQÖDç!àz)ÏG *žYˆ¸/¥aØ E$1Jï}ådåQf•ÌÏÍÅþ…„Ž&Epb4°)í&æÕè] ›øPÁ¸êœXå_UI –09 %¸DÀiŽž-k£NU·ÙoÕi=L¥IEEe’à•„ø0ál}bC\™}MÐú5CŒ4ÐCLèQî,$˜ñƒ˜Q‚š™ZÍ‹ø#`·Æ£èpFµ}¦ÕŶu"%®°@`òÒ‹Fµ/5ÖlŽYÅ«¡¾4™"2ÒîFç„ñX¯¡lBkxËp‹š€Õ,ÑКë¤T´.Ïô:À°(6xåúXØÇ9àíÎ#–_“r€?5\)ƒ©¢ü¢9>_¼fÏŠgUÞÞE>`Åf\·7o«½9ˆPÞŽÿjNÄ@ÒôÐÌe¶˜wÛ¾eGY´GH\cÎE ¡WAGÓ„|déØxÍ85‰ì¨DÀ$·mRË,OÌÄóËq¤­hðÈ­íC·ñŒÓ5‡Áû Óгß8yTÝz¬ü–^@FIÐqª5,ùi‰%L÷ÁÓZŽoðüòàyf°r›{²t³•Y*æxbʦ U?}ÂÑš&žûÓ`í:u;ÅU¹¥Ã¥B\Tnú_ÞóZÑ¢O™TT„0ƒ•¶´T¿[+q<á³knʺ™·Âù0Õ!¯îjÒÁ˯å3äñŽ{äa®y£ØDAPý§ðR²C :˜’\N"½GtX2Y]z‚B|^sØe9¡æšrXOÚTÊÅàÁ==Ì#!Õ¢¥ÉêºÃ&ZºÀÜ‘=‘nì3‰9 n³ø!{{Â3EѶ9¾"UĈ\÷Þ ¥Ðj„üˆ8à–c졳D„â&óˆéàÁGòš 7Ú~w%½æ4 §VìòH¦J!µÀÔSŸªÿ¿'HúsÂIè9ÐqÊâœN°S@dç±²æ©Ú˜äëᘖ.|1ßÝ–˜غ;-dâp…ì òžHg‹f›ëVg\ø_†0”>T6Ãg µA‹rèZ½ƒM¹ä%3'·È¼ÖÃ:ž¦[ëRˆcN‡;î]YÍ63Ñ´>ñnûÔp‘6ÿ&/Õ¤ŠSCŠ®³´‘QÚ%WAX|™ÿ˜ÓT¸Ñ.¯)}8 ½Ùi¨MŸ/ÌtƆVX¬{ÿ…jAÂ.j±šI„® w˜Y; »#.ÞiNWrgŠÚÄêT ¥2Òì€ÖÚ1ÓXÉÀœ?5û’²b ªÍ ÅåÄAØÿž «ò§ƒ‡‘t|C«$Cè_•Ç#ÿ É54:Q#µÎï Y·)³-ÇqïiåP¬‰Þ•É“±DŒéË~Œ–ŽÞJ®j'!íªthQÛ§dZ€pÈ­;ÀÇSJÐòåªs— {Q㿟èZÊ£Ž£ƒ7hˆ0ø!T¼©m,¸Hs·]CÐpY¶õÏCWF^æÝ•ÔlBÕŽ<ÍJRMæ¸ãÞ×nZ1W¹h] Üt4Õòѧa/«… qš®z7¶öÅO‡t‘…ê½úìˆ| ÌÙ<×4@,ÉÇqµ>S}~}Qå¯ý“µ@ê=•—NkµJ`¿† #°¨@õãmˆs²lr„÷ àªGÚ#c/šÕo‹IÑp»sR…øä~ôÿéÀWJü˜tçþÜAo8ïÎÁÛi"ýüŠÛË>¿¡A¬F”`„ R©/á?cDPT «ˆZkLê2ÂlL}çîŠÖªõ½ïL õ°¼¨ ™¸QòܪZâ”׸¿?ƒTtÙ¬“Bóht•© ”*çMfŸb%iibž¿Ã"õquÙŠÿ‹é¼Ú˾õO¶=ƒQ×R#Áè}=;r!öÓ».ÕX$ÖžX½¼¨ÕZ<]%Öƒw¢hn&Ù¬qÄk7•øýëÑKçå-QZ¨^UQf¹¼úÃ@q4«©)9Æ ß×u=å¥z—BM®CCù’§ªª˜Ð°e³b†çEnœÆ_e´n µH©¤îšàŸ(6tgž`»žS¨{h2<Í~Õ¿CÀ:®U,äb7Fûv IFYpMï£XV£×ší¼µJÈ®8ŒXÕU¯õÎÜ¥ºNð> þöÅ“>¨âï¦­Š¿Cj>ny ÚâÑÞ<]+ tmÕ÷ôƱ3Q¸…Šž”×ÑQb‡€Å\F¿0×@ßätdòµ™±+'›ÌZûñcãJÅ̯þ!)™ w~4šP00ê—˜Ý8ö"è“*onr­;K•ØyØúÕ°&›ç9û:A»äBòâ.Ôw6yÇ=²ÖjY³B}<Í7†_Çf¸š Mk®—U¢HŪ&¦û0-É @ÖÉŠª?Í+&¿ªö² )’ÎEk9•ÒµwB×’çÊs¬]õÜ1™™ÎjOÑvð­ÚÛÛyÈ#öq*¨—TuÈ×z×°^—ë‘®M½n.êÈžVM¤²&Í¡X_A!šqLûìï½_´Ó©C)­¿¯)àú”|ÌõvR­¥½“`-2Ó•U¼E¼Ý—æ'U‹=ÙNt­gÙ%è® RVŠÖJT:½±?¹ã"ä8: ¨æLNrY-µ»%«ò¡E–âÞVz{ÕÀPP§kge ÀW_€ü´ ï±§[O[èÁ}ö^°åß\­çÚý¬^Zom¦þòßlÇ83¯ÜhEµ¬3ëǫ̂6WQš©çkÝqv[R’ë¸ØÒHý šþFt ÖdZB™7Ð]RÖ•›TwrøPÐWï¶æõJ<ö†{ƒ]ŽD~u$k‹¹sÃ-ŽXä¾"¹yqv è£ÇÓ/ÙSý@EÞèZÏö}Ü´W” ìàgüj=T;ÁZ©âêvçh:ß´š¶¿ý Ê½]ETmÍI)®¥œì˱©¶­0°§U–*-¶’2a¹ÞÊìÇo}œKõžúºcëäeåþ”‹^gŒ\àŸ²g•oëeï4¯Ô(1´‚¶>pʰrç4¾Ëì˜^UWSÿj£Ç5ø ×\+,tM›õðêú#Â)‚këÕ—}Õ6¿§ê“›2u‡X\5e¨yÈAßû–ûÍ‘fì¸n+ Jßñx ™Ëdýzóš¯}€fODú§YeRÿéVhGâÒ’J·c ?}ãN3ÂH±ÊjþŽÒ?/VÖ^u¬½ê þHh…] }Ýw­àȲ~P§Ïùìôa]žÿöª£däpâàÝ}W°UÁä,Äã8sT€PG~' –S–¹Ö@¹ëõsê¿zƒö™ÂíJé¦xqh-ÿÍ2jŸ™¢:N¹r[²æ“¯Ûºlk@®Žé¹8—§EÊ@pŲ­G¸ÀÄs ÄÉ5IöÆâˆ£“þ Ör@gOàG"Š-<Öìãò :„Ìê rÅŒ Ê"ËÛF.;}ÉÜeº÷ÓÝé,“ŠÊGa&›Wì*k½žŠôöw@Ô²ÿªy¨ë›Ej\£“゙¯ÂÑmQîsµ°¨ ®*À}ín£O¨MqWLÔ Ý_9ÜX¦)jâx~}ö?ßêendstream endobj 699 0 obj 4033 endobj 703 0 obj <> stream xœµ\[o%G~߬Ä_ðg¢x˜¾ÌL7ˆˆ‚B$$F<$yí]Û·¬× ËþyºnÝÕ3=Ç>°QDâ33}«®úê«êj~8zs4À?üß³›¿úƸéèâáÅptñâ‡_ñÎnŽ~Ÿx“õqˆæèäÍ jlŽf{4ß{tróâ»ÝÜ»Ðÿ8ù4 ®jÆÞ§F'çéÃÏ»c¿ûcgúƒ»ßuv÷uwlw'ðü‹îX^|Ó;gúa˜wSê»Oo¬é%}Yzø‚>ŒÑRßè,¼ ÓîËÜï·Ý1þ”6_¥6&ý1äÒ«)bw6:ZS ±!Í3¤ÁÃ~ ßø=¼¼K2¾íì”Ö8RãÓôú¿…&òLu» XmúaÆÝ}ú3B7öAª~ …I£yfk†òâf?–ß—0Í g€ð_§›“äLܽO‰9Žû¥FvçдÍÂßÀÐ[ ò¶I—oDKêl %ÜÉ$þUv£Pž·JÂô¤@åM ðž÷ù”_¸g£ø:ƒ#¾UŒÑ»Pfq“¾†$yé‡Dí@(Î Š¢R?ÖªHù'K{É* oS ˜Ì<[űãØ¸~œK29äÉ–­$­.º5y\ªˆ$ ˆø=),lúÛ›îLÙôô΋qîn (cÜù¤Q6dyÒð ç¼Ow8Ýôl(Ïà;øt5ÅZ9'ZnC!ð_ïiu2£Wµ5 z¨Ñ.i ädý”Â¥f\ÅÚæA`Ú×û¼_8=„q¶•ݧ4€˜üŬ޶ =ñK®Î¥ƒ(š ݾ‹q4$™2„~¨I²JÔ¤1Z¬Ú|ĘÊKø}Ý‘Ø1ëË[ø„Ô‡¥"óWªÆ,42ÑǼ' ÀZpAÆ™:¾èP $[T–Å{’UPw+ø8FP÷gcT$ñ¢R5?ÉbûÏ+R"òÉ!¢­&“Oæùç'Ÿ~G®NÙ1b#¶-¯P>‹âLÅŸÝã3ø@¼‹H†hXvz^Y.|wA=Û)¶×`gC­²ä~ì¾w%©sz«w®ÀÊ­^XB¹zÚÀÔ‡ÅMª°j’=™h9#’h¼füŸûÉE1Çæü3Vœ1^<F‚`ì{xÍ@ÖNq‚LJز¾…—Ùry“ vC? ½3êÑgç,ðhø@š)& ¿dµð÷rÏ-ÿÀ€ÄQ{mfžµ5o ˜X6.ï‚éa†ôS6)·Ó´ÀV¼3¨š§•i{Ày³0¼¶#bèðŒ©‡xì Èf 6¬lÊ{ÛŠìG{ú Ñ>u7Ñ.èb!?úG åDôèbôž^*Ïr1šg®Nhç·¹e& Þ#ÕZ³ð µ3¹«4 ž–X#=È}-òŠ1 úIÍØŸd‚÷¿,VÌA:Hx K|•æ¸AcÓïì…ÿŠdð8Y¥—Ö/lƒY)I3ýœn*¤/KY =OꑱJú‡¯ƒÛýµa+ö´ÕÛ†(JW#Æ]5ìnŽeÀcr<0hív I7þNiqòÛ6yKX7#ZØô'ûºÊm-TFí¬u[Öé¬R]tôŒ„s];*_‹=͇L^=­ç^¼ N$á,㦥¼#YJjÚU¨rU¼Ò¬a#Á’·s%ïJ-hIiº®@..aÊÊÌxbÑ™ÃCfß"2‚³a¶-¸Nßú‡(oÿ ²IZ2 –ɒ漣¼Uy± KT”ž`ޤsA™ì—²e¡Ùf§Lë J Ĩ[’³ n‘G`åðtÖŸÀŒi¥)k5œ g 5¦ðWaáW^óÖà5½&6 OE$õÙ çj˜RеF(’Û’˜eEж¤&Ïq2À‹ÓLUÌñXЫ ÔA8™¯ù(…æ©s‹é^ý±7}HΟ„0u¦gon÷£1.îLZ´I¨0y¢qv í/av hY³KïÑ÷½MÄÖœÕà~¦l?O&ýõ-g,=µO{ä]ü”áA a샳»¿wÑôIÖ3¿ƒ—~ÌŒp?Ï=0Τ`F* S3ºKùó š„9ÅÆjÀ+\倯(}—6ͼ”z?ǹƒ /Iè,Êb Y;îã‹IÝg)L•­×ÄâÄp—”/Ó‘ØrZnЧMØà.è'bœ7ÅÀÆ7Ì,MrˆH| @ŠR¾^y{¹MN‹Ã$çž q2…5.=(øN?Úý’-À´fJ:pzÌÏc#RØÊ$h_² ­…Ë3Ë|ݰ¾Ê¸¥ÝÍâïwùÓ6±åæLo½¾æ!ÓÆ}šž?Ñû©ž±Cà×»u¥û”Ý*=¶¤ðº¥6_W“—-ºªôBéUcgÑ•ÁLg€½µ æ©:J[=-Ðàùnqt—þ„££’ãâl¸Ë±Á-f£v€æ“¨53¶.ä8ºn™Z9…ŒˆÈä3£­q–R}_³k²~qXóJ%ƒí”Ó‚*óKa‹÷Œèš,§gxo´ ŒœÇžî…QCØ‚’ h1°i'Gr¦ì‰/ÇÞ—##òÛ çbqêÓªC™EvN«¡ÄÖ¦¼+ÍDP¢Ÿ=dïs‚_óë)ÁöQˆ4g IµO>—è†i]N” eÁ#±$"S¼s¦ú¤7’=ÈÇ[Œ› °‘ÄSž8“þ¥ñˆE$Ùô&Ÿª>Ó~`¤O2«}G|fÿa#{ÉtoÝn$ÚzJIë èiCº3 LwsÌ'ñD¼Û޽¸} .²Ì”?÷Z)ÆiéH'Àh1$ µ‰8VѤæ9ü9¶ÆÐ‹Rü)*@TÑù/Üœsi¯Z(À­óæ‹GYÃi>ËKMÊxŠ!Å"½mK†¨2/±ÒbzÏ© é#l¤19„üdaRn;ì~‹i°Ý¾´ë3lŠ¢¬Ç  n4¿ÅÚM|’ù–nÙ5šSZÑ$vÄJóg x%«Â+IQ`mÌSöô:WÞôTO^JNŽ NÌ2Єm6î“ ±ÊqX +|úx}_AK8´~WºòS™Ø´@^nÍD#e] œqД šG0ÒóÚuÂÐömÕü†ëtˆÝÙuºÁ>á:ÛnÓ i)h/Qê*å«¡B¨‘d”|ÑBÈF± -®<$îB‚“º† Ä :k7*œ9RaŒ8¨Æ6FÖY©‹ŽJ ‚?ÄJª&^ió `u”(3ô¤iõ©µØØÃ£l÷©”¦Œ=WwU°æeÏ9ôûx5g?—™kû±1™ZVý¨2`Â2>tËZ/¬ez¾ÑjN1/ªcVÖÇ”eË1ðœÄç¸Ïü¢)'ø­X«Ð†åñ¡p@å¨kâ–k¼bvÔÉKeR²uˆ³C6»\m·6ÒŠ.½‘â(uX‚Ã’.VöP„œ…ʸ4”˜˜ÐFâÐ/Îø³ä6Ìc&:ˆvÑ®uyšöêrN¼Ë̃ÍA<*Ó;Íd1×,FâI 0SŽI*ºêzw­a·¨½È¤H¤BCa:ÐÛùPVùœ¬qúŒu\Td¯Éª®Ì)"EtyD/ÕH4/³E‡Pd5iG3ǯf%öó›„'¹öêF'æ ˜t¦°œp˜*µ#g0)Ü¿K²žg”U&A˜¡zÄ)»§Sß4¾¨ FkÐ' ê¤â”3 jkÏ2Ò 1Њ*Hša3Xgpz'/‹éâ<î“)TÄZögì0ÚjëÙÚ#æmG q{8-‡Þõù1{~ZS;{ÖÏå+5‡bæP0!éׇQ„à?éJ5 !çEŸ, ÇŒ`X6k—DqrµíñÈÛÖÏ5NÙê³K)³Ú[R•«7fM§ó"Ü?É9f>G‚ºf>‡+£>J]Ϧ*îT&Ó(µ¶~/e¶Œw¸¦uåýíB9öÔÉË¡d®ÁRDµ rª®S¯« ¸c°¦mÓ0O}I¹q65eÁϦ¨Yܧ]]Ì­ ùÀÒÌ£`Á¹¦© %›÷i”Þäm­ü8x3×ûlj™úПrwíR§Ø{¤Š–0«.·I®/:;ê‹W4¶Æl_—8wF£üÿq¯É(ÛªïMês} É-¸G!>Ðn×8¥‰í¹ˆ¤»jz \çšdÔQÛ ŸŸa‚¢IN‰5Ô“±ñ¹¦ÍUŠ>{cWN Ô·wÝ“Å'ø©Œ¹Ð˳ºpP¡5Ÿa¿ìB^³$i—ݺ~aE”xŒìn vCæ*fʺuqÆJ‚z3˰ò=U‘Jqy˜êNÙÄÈÊ„@ÞÞî`ìiT9}Ý!¢x·RÉ*++¹©]¾aqJ±«>í“d3åÈ(ç±W‡G–Cƒ.ëÙ0´½½\²P%5pdqâ9Ñ­RfºwÓ­2$°`EHI†~ÎJ‚!æR• ²§¢v]Ù¸…{¿„­ëu*1¼òøéç"^ÀÞ«Pv†Ó6·ÁMêò&\hAO]˜aµynìk9«±¸ÌSåUƒÙ“‹²áð<Ô¢dYÈÎ|¨2òZ¥} £‚9Ò1½ë]Õh倧ÿõ>…ÅF9{9¨ÔÃÃÇ=¢ÇÕ×|òÉ»޸剒§ÀßÊ¥ß,v[ß~ˆR¦™>v™9ÞV}æDÂ:rûô0™ z…ƒ*9é±T€«1µÓñƒàšªôóÝêZ ¾eš+¿_òÅÎ$Ö BjÞ©&žÔÄä)çó¥Ö§‰lEÔi>ˆ?OÐ:õÑï®’¯iâœkôÉwûªËc&ú†"çG©t:8L’¬@~¥X¹º-½'r¥[Î+’¾?‹Wò‰¢róyú}»’¾¢¹å]}³~ .ß¼Y_â&u½žÊö³]ŸÎ0©ßÑ«:/Sqó±á !ÄYdŽß¡hj±._>Ný¯ ­vêÂðÃPìꓬ?CE–| …Û0©œ+ò$' `µî5Žár_®Ž–äXÄ*ƒk±Ø‹ Å·.¬AŠÂâxøÿY‚ž‹d1Sq†1âO}¿]ÎÞ–÷Û'í㔯Ñ׋0s=m¦0pÓTÊ¢À,ÎÚþ?Þ‹Î{sͽ7ÊäÔÁ‡,rˆ ­#TfW´Òë¬ë㿽»´Ìº=3T,¥]oå–sujÌu«‹:ö‰;Ьú£¯U,Ù¯õ±Ó*ùPR ʾ:›¥óâÕÇÊ«ö¨b_œ¼økúç¿cù:Ýendstream endobj 704 0 obj 4516 endobj 708 0 obj <> stream xœå\YsÜÆ~Wü#øæ]•¸ä'[vÊNR¶#S•JY.‡â%Æ$—IÙN*ÿ=Ó×L0À.¥ÊSJ%æìþútãíA]™ƒþñïã«GO_לß>ªÎ½}dðñÿ:¾:øâšô.ܪ†z0‡g¨³9èìAÛûÊØƒÃ«G?®Úu³ªÖveð÷¦ë‡jèÛÕázãW_‡û_­7Ιjìê›õÆÒƒpnõ~X½—«Ïר­áÇßÁÔ±®ûÕßÖ®‹7ÍêÏðć'Ýêk ã„ _†¹¾]˨ϡ1Ž…“bßøô§Ã?Áö¼ÑÛóMWÕ}ØááIØUv3¬h¹á'WWj€c¿YoÚÕi˜ Ìx·v«mè¿Âï˰žkxþ$<šª6 >ÿÃ-,ètí±%>ôaYŽCÏwë ÿ8Z»~õ;l;AãέN¤a Áüöiâh¡¥m†Õ=\ß&’Ãä0>tîÝêû5Ù4=®ï×m[bGœ‚ûؾ^Ýd …‹«ð€ÙÀÓ€ˆ¶·BZØJÛ†j a[¯ÎÃß÷“Ñi5Cß…Õ40…×W°ÛcUÃ-ЬFNÁ 4íÂÞºfõ~¸ 8ÅFázP=S—S$c¸Ý&[æÇ6 Ù |DÀ½„׉˜zlŒ«š¶¶D–-1Í 5¢HƒÃrC7ëñ¡àxèF ðÁV¸¤±µ âÿšÖbÂß°´€+×5(EŸ@s÷ù'øuƒW˜àM¶m¶K\ŒYèækš]ãÑu@)…‘!7˜ÞL·3D1p} GM²tÝÜ‚ ÄÛÐV^wÄd £ßÀ%thwý$ñ"C“Ü|Íݲ”5ízho)(lTã¸@/ ' £¡t!ŸÞƒ<„vV$JÚÀˆ„9¤ ¢®z"M€±‘hP×8o‘ ð’Na¤ÂƨM¯o‘ÊEðÊÃEð™´Ä=HŒ~¼Nu ‘‰‰ì®¸†Y5†•¥¿®mO\Þ À~ÁÍ"ˆ¨Âz¬µØH¨˜f¨‚ÜþåÑáãƒ]±Qó‡}ÛËRéîÂý a@â}hÛôËÍ‹õõÖæêÿˆ®ÄùeL¥¥à)sÍ·C”KèÛ¨€AXñèRoùœÇ =ÀÈodÚ/y¯}³$´¾u"«a‘H4 (§ÎšÊFAý d¶óãÊÈ  ÛàE8’dA× ü ZÛêñd=-tï™úB¨OynÔ¹Šp¹dÊÃ(y(¼pï8Sö¼É\ߟ,‰ lúšÍ´ÍÇ'øg¤€ºq ÃƒU z¾i•×õ&õ"!*ø&Aß8ö:Dû!ú¯Öô³3A¿EMɨtà™¤y»VT*mdÌ=hVþBþlÐÂþ3—7e2‚¸¶F,Nå¸cÇéV½'Þ³¾7U+0"éE=šl´ÞâБìÿRŽEPë ëã-lÀ(t)”ç›dGR˜ú^Ç& £#Æ[ôù\ï´úµˆv†+vØ|®Øµ–A=Ê„@òˆ½®¶.9Û¤+ôï8Ý6¨¨/ÔŸ#M'c(vOÝ(À*+%c†[å4ݨ5+^ÄTa(] ã3W´°Vò*\ÝA6‚³mêCþj~/ZÁ±šs pBXVhR|ÄùdËOfôȾmQQaoä`‹ã b›ÙC@oolOj‹w›ë-˜aj)5r]M^êµ™É#J dm¥Ä­=ÌÎç6D=À°&¬1<ÆØ$ÇRí‘°Ð]–ý¿Ì…™s6³Гˆ\ñGx´ƒÛani2m¯C%Öù®¡àʼ Y>Z¾€Qh©_Ϲ¢»H{EáN¾©2­,¦ÒÓ‚ó™î©~·D4và”Æ„E"nÎ(m2™¹R‹‘'ªëH/Á"†ßŠ€tGr¯Ë¡Ãî ˜›\.ƒ½+Gc+˜)f Ž“ùééÙ}4^0»‘à>f' ¸¾%'9J+žplÙ˜7uŒÜÒ"¢lê©Ã É"cüë°]j£N¡¶#Å­Hôˆ‘B›”ð'Q+W ü4‘er”<îmôê-Š=H|E>#:=}áÌ Ok𬝣 Z—„nç§«0_S“²ƒUPëw¬Çx%ÇüÀÔVOáïÇ ]ka÷lGƒ»t™ž¿‹Wày$ÄšíQšµÌ&I¹2òü">¿Ë hœS‡–“–[ÝÒäÛgq´¼žÙg c‚C\HÑÉ/K“\‘þó®Šço4;àz5ryF—Þõ#¦A5 ¤­"B¾v5$(°ÇéîÓxIÚ —šë¦‡adØUŒ%<õ^¬f'¿‡tžž21 0‘®®4¸ð‘;ß&¾f” ½-ñᢠ„ªâkBÔmÚÏ…æ¾t½)MrÇÂ8x…£m鬮;=§Üüy¹åþâZþœnžèNˆOg«69wE|=ã(7Ü]€Oðo|Œ[Ðb&ž(£cu¡9èԽ˙ÝHó¤kVŸ¡óÜ äè6àOÒ5K¶%¾_ÏRG ›0‡ß¥·¾ŽÏ¿LÏ_.è‹ë¿ŽJŒ¿Ö7§Û90Ë‹ì­érÍ%LÎT—^€¨¬-¦wUƒÒwB%¯W]ÖRçùºP\õÍ”;ê™F0ž(ŒzšÐ”(v/ºÁclWÏC4zn л^nùzÆ’I÷Œ­¢-v.=?JÏ_Ç›—¥9?+Íy^BZÙò(y9ÏÉÁ¡ê]‚ÝQ!—<øúD¨Í…šå† Qg(W¸‘Öšy°E° Íù~tð£†?1Š<Ó›2®K\ÉlÙ;¿zµŠwSÓÃxóïéæ÷ñæW%^½Z“šI~ÊÙþ0ú@äËÍÏ3Bp™]ÊÞ†Ô8­\«^{ì‚NvˆµÍ’n¡1wé–“ ;¹Šz{âšzغ›ǶD¡Ä ›’“}—Dö¤„­L }ÓÍßK>Ë)Ã#Œ©P˜‡)«ßϘMEÉã“d›.Jè¼.rï8±7çiáRAA)*µm²ìà^õªÆFwgbqèé.X\D-qÙ˜À0orvóHn>K~å7qFùæó_“„?I±Û‡ŒþÝ hw`Zn>_V?ODÝŽc!Ðxzµ<ÅÍR^A ·ɹ¹LäYòR°KîõÆÀÞVî#`2º:-ç h}]Œ ¦vÿªt³èß’))ZLó‰ªIVá(?±/É#9Mb¯ç›®ì¬šËD =cøuÎü~I òŒ0Ñ4ULóȤOù´dŠC[Eúg{á §Ïáõ>êÔD'ìÜ<ÖîŽSúù(Z+´Q½DîA‰+P wq%Áë]6h^¬•ý:ÊØ¢"{æä®ùçü…?éýÄü̇QŠ@ì§a5Ëk8[qàÀÒñßeä2Ÿs沈¾r=—ï–¸œ²b•hÿ{’½…äÎue×!yžsçw2gñœ§h*§*ªÖ³•›3k)Ý™y‡œ€W/ ¼4¾û—Â`#¸§iÊ·%­—¯¸|¼Ä…AïTŽI ¯Jt;/Q# 0CkAI©ÝÆl¾wk ¾®DECÈmM=Aîe‰ãçs¤bè%û4w¢2oò GŽ…öp¿“~x0àž”Bså)iiEh!ghXT(„¾E…2âHší·ÿ!GÔóßþ8l˜9š¸Œ‰Ç¥4ÅÌY„©m»`Çßd ›º\i_Ê{Iû"—Ki£ëRWå Þ–Tú»k“ž'2+cþEjú2Þü6ÝL¡Ê!©½Üp0%ÒiÊËÔ5E.³µi“VôC˜yÇ~33möÜé‡Ë¥×*°žk*ÕvÑcK¾‘¸ž'%e ž MÁ!ëç}ó%›£À²ÇyÒÔÛu´°ðVŽêÁND•$”f÷hé=ÆéZ¼ìäumã½çñÏKf-­±˜¢ÙÚ‰’Æ„—”4'¯Ëáe3pª¯Ç™_1 #¾†—7ä£|è,ÍRe®\HN?@ªÍÒg\7ÐËë˜˜åæ½Æ‰J*çH²ªà÷$WóàJ8ð18'IGz‚,Ïò™±íÛÊÙô>Ki†ý’ 7­³ .‹¬í-Êe––’¤à™oU:È6O+¦™¨üÊ“B& ³º”î"ù_QÙ-*Ce‹Ù¬Ú;c’äîÙù¨Ô!ž~û˜3ïœÍRJ8c”¶äÚ˜ƒtÌàã¤y¢VC5-1ÊQ·##z‚‹=ØU9ý’»ó 7§r79£Rrvc ͉Îäpí(m0ïŽv¦X£¤L«Jjn([“'„=f*/{T¤ÂY2h|#7Sx<©bw)sNÒÊ[ª4é)íe$jN ©ÊT‹é] ¹J!ò•‘n;,Qù¨¬ ¸0Jdë[_Ê ;­à”6KÂýG=3Ñ>G*ÍÔ\Ý‹=“ÄÒ^e`DîCq äñ¼Ž Qp‹GŽ… Mܫۉ̥$cºmP ž0š„œ°Áð\B˜ *ø[ýCŸ$!@ã™Q„ǧkÌö…u~Th(›Ýóxˆw %H¤0ú”(˜ö`f¨=K¬’Ûì¬Ã@XL‡÷ -U¾#³Ýþ¶É»J!ªæ\á<«ÊÔî4R¢` ¶±ŠÎ9Ͳ ç¦ÞŒMu’0ák¸/œϤ‰u#õõÕP¨ §Ó™vnìdœ²}¨*ø‡ðRTÙ¶üŒRs”žü±¬èQ‡3Ö¼k_µ}ÊMœw̹¬(+R2x ÇÐ_íÐeo ƒü³ XÑ5©g=2E ðÃRÞêcdƒªüÞž¢˜«èSã¾s…'G×¾¶9çY Ëä8Ñ›¼q7n6yURÜo’=›±áôÅ€‚ ¢Pt«ÏãwtÐ~ÎßÑqž˜—}—×iOd`ô)K‘Ú¬¾ ëq% û.ÖâëÒGD8”ƒ[ÉAⲌ𼉧ØùîÌ8`âÉ3ì-¬²†÷ƒ*|b ó5ÚµÜNúš8ÄŸ;j=ÇÁŠ€ïÁgVñPoÀÐÌ{è;?Ò0œp»¹›±“ žyeÉ;”mïFŸæ}pGœ9VðQIñHnŸòÝñãC¾­§fijBXú>„7ˆ¤yxÞÅbsè/8žóßâɧGØ ²ùÈië´‰\ž\»–Þ§M^Óàz¿©Žv²ëô% ´iváë/ãÉ Q$/ tÓŸ«ÈŒt£»eÝR¯V|Y±<Ãï'É›)㇬?¼’mðÿâÇ|^­Ã!§ôá ã£V:Ò§y|áh2?Ÿ0T}~„뮯ñðf]ˆõ”íøfZÅX¾ÿKŽ/§Û•‹¹çÚx¦úFEñ}[N\B6:ª„»_Dfá­œ ¾:|ô×ð֕endstream endobj 709 0 obj 4797 endobj 713 0 obj <> stream xœµ\[$Å•~!í_è7W"ª6ã–¬}Û€±ÍB³’+oÏôÐ1Ó <öŸwœkœˆŒª®ž5²€ê̸žøâœï\Ò?\Œw1Âÿø¿Ï_?ùÏ/\˜.nÞ</nžüðÄáë þÏó׿¹„&ÑåG‡u\ÝÅå·O¨³»˜ýŴă󗯟|½[†´‡ô¿—€.K¨º,és§ËëÜð·Ã>î~?¸Ãº.qÝ=üîóaïw—ðü£a//¾ö!¸Ã8λ)}Èo¼_óKjYFøˆ®«§±?<¼Y¦Ý§:î—Ãÿ”>Ê}\þcYµQȯ¦‡óyÖä,a„Î/yKž|™˜¸8á0ÜÍ,÷ã!äÿ†w_åÍýq uq3Îü§ò*·¤‰YˆµÜ÷$Å}³[WæË<ø-ìíÛ<ìî.ËéoÃ>í^Ã_Wù¯‡€màMnÇ<ƒKøèMn³ÎyKðbˆøÏuþ4.ògXó¾\Üý ’„®0ê_K3^5 ð^8l’ÇÀ0Íσ_òäËB¿ÃEàê©Ï=ôÁõ<Ï“ëPf@ar‡|ª(¸ü ÒŸvoó`Ë„K¹#Tˉ0s âvy‡1ËÕ HË‚¬LWWvX^Zþ#æ³W!ÏxŒƒ«!Ìž·$õq\wÏà'-„´ÔÖÝ÷$Wïq–7ÙÉOðÓÃò,×8,TVÛÊ?“#QÁôË Èk•6ÕÑu$Øüžw¿ÏbMÓèI€Ú;ìñ§!À¾bæåQµ€ï $w·€‡ƒÏïàÏ„]HØÄÓ³#(‰ž0þ0@dðŸ²ìðù<ƒ•Mlò¬8웢 xp¬Y™e 0 NB;ó-SǹĄ؄“ÄCÄ=\!Ê|fTUh õÂn¦™ü0x<$î¼wëOôË÷pΰ’E'\H ¸‚Ãy5x™¯ºXüúƒÜ|¦\ðÊ9Ÿ‰.d†úxní@£ËËu¾Lq#ü¡^ ¯ν ’¥ƒžQÐð3-æbwèfHzT,e©çæ¦|`k^‡X½Р)fœ%Ü;6÷žv*z^º.¨Bù“"53ï•Ö(»ˆ*6º²×°éug/ž«. }$CÕn`´­#jû2H ü* [ýC$i šHëBB¹½|-{HüLÄÿï/ž'käJ^a·,È[A*öFÆH±(*s‡mnx9£SpðÅûUÐ*«éˆhy4rÖëêV:¡‰ ÂWøOÖ.‹^¸+Á~¥LôKGó%Ã-ÃzÙÀM\YYø´ÔTη€ œo “Fa”—wå!´3¦¬ÖYÅñL¤o-K+@!Ÿ2fyñwUîÞ\ †J¤¶L4C~j5%Ï8BÕȶ«¶ID¢ ÀßœjEÕ1 ¿8^x+H3öÞå›~TDl±T·:»…L¦zTo©,Ü/€ÈA»íÖ?ËOG œÿÉ&=àl‡8‰*çWЏ ¼'¤ŸÇÜojè ®k…½‡…Xðk@ \ÃȺ„·½Õ>/èÄ`±'™ŠeC*¹˜XŸW³Ñë(±ÍO`ØÅâ·hVßèÀeVkÏÖ·QÈjOÍ6òÏövXx Ž @w¾pñ9»‡XaÆÅ?{rùþ×»ip‡4GwÍ’saÝù,P—¹ov¿1 é§eL @ŸGñì´Ì!¿G³8|æ™aA8Œ1ã&7ð‡yr+²|8i\@J¹¶¥‰†LLØ^ÒaÉÌñwØך§åî¢_/q}£cU–4Õó`÷,•$Ó3êDX²Ë¹-?ŸÃ˜Ë&»2:-)-¶O7êFâ¥ú… ™´j$´uÎôÏ Þø‡ÂhƒÐèk;ãª`:9>™É'«¿-i‚$[g4s, ?瀰/m¤Q–o9”Ï°Š¿KO4ÿ’ö ¤ð=ë‡ÌE¹ñ´pzUtaZ[F¢žEß±…yÖõwmj½ßI{¯'¾Î:Òh¶»Ž™}Ñ °´Þí¼Qd¿àvPò¼€DÑ÷O‰ÉW g/ZäMy¥&ÿ(TÁŒÖ[±\)i¿ÿ¡Ä¹Ã¦¦‹‹>ºË>aч{ñ d7aÐtnØVž9öq‹øÉô:L®kO†O±&™ähÍ"ÒNl½¬So­'Ïci÷ÍN[õÜå÷zÎ@å”ú@GûÌ^ãŽã] ¦Ï7mˆÕKãð†‡,½š»½`Cùè"Îb‚`bèÔW,&ë–î®0ÎH0 ‡å¨†ëgµžª3ZÐÎ%¼b¾~›€_W³qœÿñÂùX¢HfÚæ³DÃ9´œLo þ²$“í熀%s¸û¿*:\9Ž–rUðNýÈðÆM»_ñDMêGú D÷¢1ª]›{²Aˆ%f$ W’<Êà¯%Û£N–$„Îó.‚z†¾©¦ùÖÀäóÂD³uq5;ãÅ\ÙP‡ò·0OUÂ|:àoY6‡L»Éä?4½ÞdäóOhÍÈzŸýRZ¨zÚÄ EJf’é¥"6z¡ 4žZnAè~(¬ZûÁ|ó+IãÍGni³zf—ÀPÐû–lŒÚæg%ËsLÄ{‘ÚÞçQÜ)c«üJ>‚GÅwQ³Ùå¦#–7øVÂ>9‡ þHÔCFîéf\U±áŸ=…iµhs ä³c„-^,÷a¤m)Ê2¥ƒ§Ô7üyÞî’)¿»èÚr5±æÞ¦úä §oòg¸å—"iðöœo“ `¦éZÞDmRQË|‹„Oô Ír(ù éî…L1½ƒ/ˆùcšÑ·h#±ÇN44¤u³Œ`&âr·2}EᘠǭOÌÜ£©tH'c¿2W¥0˜WŠžÄA,cG =y9… æ^Ê|(ŒØ˜N 5kä2cMPßuhv ‘ù%>¦¾ƒ-*ƒ‰öÔ övË)‚ä*»éú ¬ð,§s:O.ApþNz´€Km'NI—útDv;gÚÍöÿõg­ú¼@j¾XiàdßAn 0a'¡1w(B!Ðë@ü»Ö½‹޳f(f fà¶šåRÊ·"¥9k‚Gî4°¯¡ê·r⥠‚aöƒ)q+(‡ š†¢aW¢UF7n¯K 1V'ĈÂù/ê 6‚+÷¼Ü-T× ÎÚ]8[›¡ ž‰&‰”ÚÝ2¹¥çˆT‘Ž_î×%Å¢i䤩2§lq êðŒèð6Iƒª^ÔH% ,˜KÕ Ä¶sR3+Èðb½šDÚqŒÒrh—³y‡TgÀ2ÂéW*žwØDÍW_×RµÁ¨f{½Í %ŠL¤IÌšrªåHÏþ-Y»âÚAsE<+2‘ã¥c—çHªq_…“xoõ5²!o0Ên.x)X´ ègÑúm' ôàË€9–ªÔ‰ UªÆ¯Ô¥-H5ó•ãí§YÖ^¶ÆlŨCdƨd—wß•ÏÜLÈì•hòr5‘Ÿ:I¬BM"ÔàMr®wµÔIrIGh íÜuÒÜ6" Y.Î̉±t䃡ðØYÍje!NnR­¥L!U@A‚%H*ñvé\}ûtÓÍ ¶Ð5Â|tÛÍObðñR5ÉÁ*2^ÏèLáqõzLQí£ž¨ ’BÃ¥Ê-³ú–àχEwÔG'ÊÈ<µ…ë(5(BÿDÏÿÄ£í𙈖'û¤Žý¶¼z}l-ˆà…×:î7ЭRÙ}ö²±â6šÃm‹xa­¨LSüµ2_ ›FlM% ø÷WÚðH?Ì“:í\­N%g%Ëañ©à¢qFœ 5:YIí@IS7‘¶®?ÚIËÍåé<œ*še9(hêeF7¡:1O§×Ù|uð•|uÐÚº¾çpHŸ5´ùe›Zç¶"ëìij´Ö$sÑýž*å„€L©¤×6ŒfZ`3ì„÷¬§ÄÕ¸äY/[SPriÝÂN^.´û»D){uYöwÐñMñ$O ô–—sŒFZõ›Ÿ;f4ÞÁf¿]Ø› ØÑ–lrZ\ÞϪ7¾4c[qW¿v˜úTLO6A'+•{‰üsÄ/á9È'WäRpÖ±ÜXó{“/)ÖÙH¬r,¢\_±/‹\Gd2G?óé_H.´:åàw1ÅÙÅ“JÏ»j?qµZ)‡¼ø:dÆ8û3%¼™™4ÏIOƒeçòÿãÀ‡H0©I¾Ä¼oM¾H›»Øzå Îk‘n|àk ²!t/y?ÇKh"×lØXä:ùª†ë›!7ƒe.%H›’zSuU]uD‘ã;%e¦I¥×0H¨=E]^<ÞŠÉ?꛲˜&9óò Ánb.øqR·šÏ$=Hûƒ³áë˜f6&N(“ÑÀ´Cš¶çRvOÅ8kˆHÏ$Öä¾ãP¢Ø¸—(OUCŸÉ{·æ<–Ȩ³}LÒ?嘜h$‹–¶IÜ{!µÈŶx£M=Ð=ãÊ!7 é-áݦ“bÒU­ýAÛ²ûŸa‹D¤LãYQ.õ1+kkžÛbºæˆ)?zFihpß>Ÿl²ÌZº¶5ôÕ¡s(W>QªÝ9½äRxuM®;’|v7M¡Â/pèô)‹SÞ%¦Uò¢)lñŒYs$­c5÷ëÅÐ i£h€v§Õ[H‚¦mÆQà ÷ãìçܶÅ%ðF2‡&oüŽnÉ@%ÆíkS´Ï@d^Ö˜eJ±|S9B,›7r7Ñ%n«…WkKí`e¸eÌïGä%ø÷çDh ŸiühZâË3§ì:h¸p÷÷Ë6béã»òðc 1þ…åŽüÆÇ³é¹9?òׯ¹^Úc¥Ïæ¬ï{ |Ñ[êç=ü»§B§j毟-Ó2ýQ¨Ëj%ùÆ6@„AR9–ør÷›þ++Ö_ëÏ~Œ#dŸfŒïV·v[Y‰,d¾1ݺUœYD5•ßäëLË£.Ÿ°ŸW{F‹îÈWvÄٺŎUÈ‚ÙSCÓüƒyQ ]$c”ëJ­9U'ÕÏ‹Æc =>'ŠFí£Ë'ÿÿ÷/BÅ““endstream endobj 714 0 obj 4646 endobj 718 0 obj <> stream xœ½\K“ÜÆ‘ÞóXáý }lØîê {°lÊæ†×¶l:|XïaÈÍ0DÎ"iJÞ?¿•ÏÊ*=Ó¢åpXÓD…ª¬||ùeV¿ÝõG·ëáü÷Åë‹Ïÿ主ywÑïn.Þ^8üzÇ^¼Þ}ñ nI!_:ÎýìvϾ¾ ‡Ýnò»1Å£ó»g¯/þg?vÃþØù}À¿‡)ÍÇ9ûßtaÿ—|ùiwðû_wqÿ>üþƒ—~Ÿ¿ÃKî!ŒÇ¾Oû/;ü0û?t‡¸ÿSþ&z¸GrÇyNq†ÛGAþý{ýæ7ùv?æøý3xü·úÍx…ÃoðÝøõ“2F~‘Ûÿ²Ã™üµÎ ?3ø²ópw^¬ª¼õWp>Cãcúíÿ>û/ctVŽq˜Ž}Ê¢|v•Å—²Ø\7Ðaí‡ûc¾tù›gzâßåîf\ø7ñÀ?Ë_°.ó‡÷y7.AœùÕnØÿ¬kÈs û7ùãLB¿Ï7¾Ì‹»ë@Œ xì:ïÝ·pÄûáÒ}yÏßò.»0Áå´ÿ^öކýžùÝqÿ®È=•ïpŽþ'›ÿéýþE~¥~—é˜É»²•pŒ]M—ž¹Ô•ägõà kš^ƒ‰Ñ3÷²’×yy«YttÃËÄî§ùF'R¦ ¨`áçµD˲ÞÍKA#½âˆ-?žö·0ÔˆôBoQ^å —‘ÌïÊ¢x´S×øš–—/á‹nºÁ¼:[íºÚù¹?úävïÎ×;˜ÅOÞ-\ã6æù$T8O{ÏãÂÝÇàÐ1øû÷.  ÑÖÿ‡R%¼•½•HVPk^w~†ûÝÑgThF;QîQa˜`Îðß㾑Bð6ÆÉ\ã"q‚Íûn¬>.•2OeNS;•vp~è³@¢ˆºÒ÷窠+×äUçä÷Û«ëj4ä>Óù®;À"“óÉ(É+–°'7Èóó¯CßêXðj/˜VÁ¿u2¬îÀË;d cïi•¸0Ò+ü?)A~c%cØR oÀ™Ãí¼:—7ùM½W¤—d»#ýf7_†÷Ýóî“v´pJèø\ãèÔ®$ØMeóî­8[} ä >v>‘Fª›ú¦Ä¦âÄ>¨‚U>t/«Ý4{1ädö8ô»lkl`û¼:?‘ ²t¢hyøH²@ùà&áÓ0w˜òg$´ÀØÏµØDDÑŸe÷ÑyôÔll ;,MI¬†ßp 1SÈVÇèÉ·|´yÈ…¡ð€ 4‘E¡XÁæÎ0jöÇ›Vm™ý]¾¥Dzó®÷Ƴð¾NÍâèdÝ<ïÚ¼­½øÚR²3™äðCqüdp'í"¡]HÔt¸' |–„;zÌÃÄçl|æ@Eã¨Î7ˆ¡2»C{|"E˜œsˆ²7‹íÀ¬þþ„}Ï!ï„_ëeÓïÄË9­|õËN”K qFó8Ò¦1ÙÂ|³?CàÇ­«¤¹àrÉÀ¥\ùP)–¨P£,´0Ô•aNº>Ý~Ÿ=³X ê 635ºƒÃ sô+Öè=]T Ö,F45…¢ÕV³—*ÈöàGò,ðÍO ^ß—U¿ï+h‰ŸÐŽDK| n«%>ƒŠY°.ÐGÉÎþ8j²P\_“U¡ Á| '"¿Ñ56T ²†øÁ1²YE ´£®r·Ó`µíIøZé-çx=Ô/^=èW ¢_‹è?‡5¨‘Ü)¯5“ó¨8{”—úkº†­äm0=£ÝèFIqÊ4#NY"sÃ#Îç¡„0“òn DW×!×KãÒ÷£ ^›´]éÚ«N€ªlϬ8¨MßÙto±¹ËaDØ‹7M`,-²ô€s›Ážæ¬Ð= ‘ì%û –HðAÆäõrNµÊ@2Èen*eˆ•_8¸F}Ì*'§2.Ï‚ý CîVâ‚óŠÜ‘ÉÆø6§šÀìæõØ(.‡–Y«’ˆ¦nV™DÑ@Uä8ûS{_åÁ•³á`°±hŠkû‰qaKR»‰‘ECÄ塯{$œÚÄfÅÓý8ùÐ_ë¾Ðæñ ½ÓD$9Y{I,ØÞ‰«­¾EG ø'¤Ø2WÖ×}ï\KaøM—BÙ]µœ—·6 =t”|!uDÑ¡S¿!†8ç$äŇcŠ&ãË?™6ÌÄÔ1‰ ”!íë¬!QG ÆlmaumÌfe#“¾•Ñ ûÿkzt« |[Yç×,vl8ôš˜[±°]Ô‘Á{F¶9CÊ?!)+0pœ¡5ÔÈnQ*ÓïHÊ¡¾dwªr’Ú«e®‡+\²º¶N÷\¨‹oò=\J”6»™†Öéþ»Ášë€ Ð[°eü2ó† ªÈ%L³DäLü+GÀ‹º·å.Øœ`Ád)%ÿ¹Ü¤T"“X‚”º¬=¡3[-…V0,¢7ÿŒ3à,/ËÃZÁ¶_°ƒEý•\]âsâ**:ò¦X|]4퉫øº ÚÔœª”OÆ|Y1‘Üc!ˆx]HE›¬Ýxuwý@Zì[ʩڑ#Í_»XgÜa|4 Ūì.$`L|ç=½§˜÷ €tȾ'ý+&œ!•¯æ»è{/˜êrqV(AL&·@ª~-ö~¦žùI`j¯ÆÀÄœ ß’ÄBn4îÑüó~ÝÏ cß®^@×2 ój çk¹}Ôd“­à­!P­•+AȘÔî×LéJÏhfà‹â’ûføõ†ç©Mø²ãX<…c[7¿ë£VÔL1Z)’7¿–öDçJkÇ)Zϳw.Ê ’“×&ÏÛS®ØÓc£A¶6*¬;mu‘Vñ%žð ƒ…Ôõž±öyÑ¥ëé)—›úceÓŸ® º¸\¨§ÞÐDRWRžJAÔ£;VÌ£iÚj„ ×ù=”âƒX9“×pM W¿DyÕöZžvY!P6/ì«ä‚)´G#CPYKÐÛí3Sx|Ž9¨kj›â:·khHKüh¡ƒCZ ì¡‘¹x•¹Ûµ5ÍSQñmdEƒ­øPpÁZŠºH&Í]Gb߀Éúeçí Œ1¤üY£7u2RÙ‹ç>VS/ÌÉ+If%y]¤yvâRVQÓà_¼~§Ä ”žÀŸÔ¾+BòM0PºÎÊ?ev¨ÊšW·A3öui³ÐÈõú»Vž1¯„kP>Å£’—6 µ aÖÖ°èúA‡¦ß+ú£Fÿ(_ÝŒõy5ú‹ÃQš‘¥u Á|Í™:é;Qƒ%Á5×v‘»dwAàF0D³¡øh”¨Ôîn0t\+m<¢ yÚ°&pl0 䃕-¹{ѹÕW‚„ÈìËôšîÎEMR¼a_3ûÚÉÌKí|Q±êKßHáz«ŸÐÜ-Â…m¥ÑÂÔ9-{T|3H‹$3Gßø7@9#•æóÆ„-‰5¥ß„CB펪Q˜Ý7!Ð ¬T–è€ iÐs…a®êO}iÝ1­M­ÉJ“ÁTóû*’›kg2êÇÕÆL}ÿFôéÓ9œ¹ªáèK4ÝIÖ…›ÁL² ~|Nœ,ƒ¤qâuÕlU‡“ù;<Æ(u“ôJ`쉮;™º›š~$<`‘å­åJkßFBªáØCÑ)ŒiÓ‡øº(­˜ÑŒ‰{•âŒx#š.RïÔI _¬IÓÊ9UjÒT…ö=' L=“°~JÇ’Ìi³IëÛT:èù¯{À,ui!¦ â|ú&ÈI¥áÔT"³Áò†˜wÓ s†í7 [{Å»­˜J²ÚèL³5ð4nR áUÑVå=]˜vÙÔsðñ@qdøNU²ß]<ûœµqÇaÊ@ 8ÎåH²Sv~ÊÀNÀ@iΓú<ŠÏQë%ÞÚgœqU.^ç‹Óè2Êy¥_—ïÖn„íÍ&çz€wYA‡¬¦ô|Èœ°Æ6ãçu|F‰œE%¿ù.yy#†ÚŽèo¡ûÈõÛò5luÎèÇaÒ½O}HæÞ2Áo1oTòã=ǹüIG˜æhšy)„ …ìÃ4ˆ¼àfn/`Ä4Ai°¼Åä¼³<³ÊG‡^vPIåRÌêž$¶½»‡Zƒé¸²Ç*‚Âô<À‚š åùÉ+}¡v=Î&ÊnvéûÃÎ‚á“Øý0+ƒXJrZ-Ô@?õ6&Ä5›“ŽH}–ïɳ­6ò̧õl‹jñSEò«f9 Pš‰y¦^ZœSýÒÒ&ËXkÖ“uæ§ýGTܽ’½[æ÷­Ö/ä€7Öå˜O´BSâêšvÏr–’ÿyK à›ÒHšú j€;inˆãF¬´æ–65ŒK?¨_—¦…A𪩤1Zt_ ºê¤šäj,…†GÝÈ6 Ç –áÚΖŠRÈÃzÎltL6)ÙC¾6õ8Ú z* ‹ãF¡²í#…ðYTsíiÝ× ‹½©c]Å!@ÒÚ»%Ž:Ù´Joôç‘ ü–¥G¤[ï:nÐÛì;S­DñH*ÓÕÅþ×W®GfÀª”× VTé'ËjjìB¦ŸÃ»ÐÂà<(àbX?”¡‚ó^Œš}?ŃÉ"ªdT²›+^aíš´×\k*Su–cyúTumýH&TLphÚx›F „¢¤•ƒhøü"[w>6õY³‰ßØÍ ‡µ²*ëùØÓjýï33Áø7N†y¯«ýëe¡GÒ)ñ—¤‡OT]0o›Á—3#Mò-v¦Ë£ÌÁEžÈ/\RË]ú&å¤6Îûçêë(N’˜jÆK°Nj´guø04ô4¼ë´ø½ð=µÌ4þ‚9³U%õâed³{Mù„‘ lisTi“ˆI×'R²ó?ûÔº«î^G`î#!Yaì}‰—Th̢ܖù>Ø,ÔÜ,´®‹¸º¸áô|ÿOn=‘Ñ[Ž/8B+Éa]ù´QWÏS/Rƺ£Ž„S{ÂÚ C©IýNöX 4rÉ3¥Y!CiL7,ú­ïÝVíë[nÞðq±^pÇwr$·Z}Ø8ËÎ5„î0׎*(ýBjN-aÖèýäê7/еým‹wBÙ®ëÝ?§¶$¶nPiÚÓôØæ=׺eÙ5œ«Õ†Ü>mO˜èˆñÇ@àÔôYÑ0Ý3aÔìôca¾7ÛVñxdbùóŠÚçß—x$;UŸ¸§9V-yR#òiQz\mÊ’I8åÂ43tbªC¦Õu¦Qˆ^{ÈÎÅ—ÒºaÆÉðTúU5•c"žHü*µánƒ‡xÑÛ¤.vì–1¿ƒåúž~¯e$Hˆ…aü5¹š9™ùÞH¡®1¿Ä fͯ|Ô”¦Œ1§W6;%>–Ø4U¿N±20η‰˜šD̘ÿò7`'S¨ñcHª ©ù¼%${q”ÖYµÃ(ø¨:k~á@ÔzèÅÎç¹Æ×æ÷´-S׸ÔÙöHÜÜœr„1iéC¢”ƒB¢0¼J(Ä^æ€]ÜqE= ·5{a„ðàÔÇYï6à´Uc[3t¥<”­àJú4ë†å×Ñ¥DÍBçŸV\m‚[Ë7íö¥àXq÷ѵýý æ¡ÅÖˆçø é~& ŒŽb,nèn¤=«kæÚ ¤¥7j˦eÏž±` ¿ÿü†µó"òã ÿF<·'-)B±i4GýküqI"m4±%Úó‹æláu]4ç/ e¤^@sB²)ÙXæv¢é1NSû´2½ìÏmf^Ý µ ûF1t&ÁG¢.ªî^¢¶;—x·m§jMÓ`Ç¿cz5ôñ&Û3Kò/œÇ¢ 8HóÔ‰^²Í‰_jc «•sÑá•ýµP.*±íÙÚˆÏG$Ì×uÓ¸tº²DêΚ5µ®ýêÚ)PÒßý0/`8¼ý{&´æÚÇ]uÓ"oŠ<øEÛtUŸÜ‹¶À©_X§¸«E_)ã‚e’Fq6õƒ2E ž«)ÓFwjžçC©ç8×S!Ÿ6›ßYño\v– lS)xœ.ó&ÄÛj“4'Ã,QÜÁ„´Ô©®/8個ª\¬Ÿ@ZQQv`óò'ÝGÃÄ"àO*"&ÑpHç7VÚ¾\(T¹âÓnú<¯ޱøPªJ§4ÃóQßÕ.âõ*ˆd&çUq–}ZÜ•Òô> stream xœÅ\iÇ‘ýNèGÌ·í2ØíÊ£ª²l`Y–v×°­]‰»XC2ÖÃ‚ÈЇiû×;ãÌȬ¬f“0¼$²«òŒ|ñâ(ýt5žÜÕÿðŸ7/üüæ«goŒWÏüôÀáë+þãæåÕ¯A“èò£Ó:®îêÑÓÔÙ]-þjNñäüÕ£—¾;¤a:øaúã£ß@—ª.i:ÅÜéÑmnøÅpŒ‡Üi]S\ŸþðŸÃÑÁó/‡£¼øf8†àNã¸æ<ö)¿ñ~Í/©eáKj¸®žÆþjðð&͇ÿÐq¿ŽøSú|û¸ü#­Ú(äWóŠÃù<ëä,a„Χ¼Î”'OË„æ.Î8 w3ËýjùÏâá¿óæ~?к¸‹™ gþº¼Ê-ibb-÷#IñÆÓâÖ•„‰C<ÍCNÓ)qøó0åÑÓ×Yf¯‡ãtø!Ï?gÀDc:¼Èž ñpÄ…:§îJ›g¹ËÛ!žçÁWØW*C⮇°äwøkn2æÂá&rŸ›Á€ï@æ/Ašt0øá ´°Ä2ÜXÿŠS<†Ù@ˆ3®ÖŽÝžåçqÉ[œ¯à7ö»Ïc'œÚ¾)§kþ oniWÞÂì#Bå­ìý9ŒG›¹û”Ÿ'kÛJ +ӗЛe2•§÷´¿°¤(ÌÛía!Êéßs‹Ö’,½Zxí@(}h¯ ÇíO;`Qîó!¨'P(YX™†LH‘¡øÏ‹ ÜäQ,= ¶U1&ÄÞm9t$C1NJ¡ =ƉXn£¦ŠÂ¡ctxyÀ ‹ê‚q̰µÎ‰,é Â×åôpzÖ±‰.1+×F¯ïÎô]‚Nœ<âÿûƒt†}Ø6-†”gD6Ï øÍÊç»ÜØåVÔNŒzAË=ÝÆ—Ú3ÙSŽfÜ‘Çý~Pf ¥‘¼ ñÏ"XßõµÆ;­ÕÚÖPD÷åI.YºÃgfŽ2ØC¤±‚Ú²\ŸrE¿Wí=öߨcŠ0¡ˆç±n_aÜÇæ…LïÇ‚ò[yqS,{±ÎoH¦ ýzŠ•Ö|J Ñ,°™Ðjã'$ÑÖÉíž=Éu1Љ¥Ë¿@Æìþ—‡,ïhi¸\ãÕU¦U|´lu)&½?ëž‚ u×y}«¯Ym¡Tj­µk½"[&æ^t,dŠR­»Œ'ßõì±ó}é¬Fƒñmm¶V£c/æ¹»^Qp Ðý\b$óŒ æœ¾0WlsE Ù>óF&µŸãÌw†@ T­då¶@ä!M] þ·ŠSÛ›’GˆœUj ǹÛP·1j wŒ^€ÈuãAÛ¨ƒ5Ä8’ïNVucÌ‘Pj­†º vÉZ‰ƒA™ú2·&™zkJòZPìxi,ö±äagqè¥ÀUì(6¸A»˜Õ D±|B”—ï—zÙ ¡\üB^9'^·¥áÙC&Ã’xµ‰8l?¦™Þ1Ëe…qÆgÀͽa#Bwaß3@‰Ô`3#oeÞx…ðØzU´?cí¬Ýuì&ཆ#eã-oÁ@ÉÆs¿ßF´fBÕY@è|mTÓ8J…Û/¾Ò À)NY"Ç: ±¾&u§e.ñ*ÅÑc™8»œìSü(Þd£û2Ȫõn˜{ ¤k$Ÿ±òmD¹¢äÞÙ© rgM<•¶¼UyŒ¼qà…RÛVõ:÷ýMŽ^3ñ=ÛÔYŠ6\Á¡Cñv}íí¦/Û9o·ðk^B’Å¿¦ª³7˜ƒ!εØ8¿°,ß§DŽœÛJd³& îÒ ñ2ÒxÓiV^gÖö–uŸÛ8½ÇM[FÊ‹^ Ž óÓÀLò¨>6AS·~:;äòR+d9ŸK´J0£h¿[cÉÊ«Ÿ NŸ£}? G ÍïG8`ÅÐÆ_ÇÅZšì K3÷æè„ T°ž‰ùCâç÷CÏyÀU«*]]è­,¬ã?!„/ösIãÅLœ]wª»Ul ÔÜÙVÉÂÓ5uBáùMdoÆ» B¹å†$R›qêwüD¦ÞХ܎ÅR+½¾kà'¥MúLƒõ츸ƒÃà—Kh^¬6ž§¬U§ßÚy †ÎÔ̳»»ovó=AÌ‚|ìÏ;/åN~¦šPöàîÁk죨»Ë<`øS±¡¿-‰í¯QA¯Óáóa­]Õ4¦®¡GþO¶hPÿgp¼öÏå%´ú’“ kPBÜÂMCsÚøu^8&`¤_ ¸J“اôùf-‹®eÚ¬…B!7ìMEÕ¢å–ôª-šSÁ¼ùqŠ -œ‰€þE¯Í5¡A†zµQ×\‚Ñ«ö¡ýïTûÏf•gº¸ÍÞ ?V#÷WèPŠ“p=#5:Ž5Mã×êŽvö'[ó+Qj[¦0áÊô”^ª­Äµ'T/ýPÉHÁ²jŸ¡ä"ö” #š<6DR4ëTŒ2«¯®rIàér N¶¿C+¥~ð[=e©$”7¿—ƒÿ!·™µøY/ ¿Ð°YÇàG@E¸­þ5¯ÃE¬Í­«/U“ª2§%ÿpX„òKÆB ‹q>ߪ41Ô!Í–äk§ëâùüú×0 •N>?wÆ=HÅàU_l^sS®l[عFw ÙÆN $:ºèý` •‹ÍÆ'ètXxl`„äVµ][ HËÑíc@rV5‰¼šÐì&i^¿4¼ÃZ+]J³þžÜiôãM<¿­M_P*UtPþý§<òÿæÿ…ý©|7ª˜?VHElö­G†Æ>¡Þ¸¨–½=ã±^ëFŠQÕXÍŒKékãF†’ \Ê2°À»&›šÝ7)¤h_‰ûôk3x)^¹wØöI…&Ê™}?/ɾ~p: ×M²J8Yqm/amÉp£5f´ ¬ÜKÝï+¹òhc„-€_Ÿñß„£)«R Q“/Ñ+GŽw\·i+;|ÀF… ±Ï´«jÍò®.wó³õnEÚ Wós”énØb-¦¸lkÞ¬{q+ˆ­„_‰ýù7Á­U ;DÈ!ûì3‹ÖÐ$ÊF?Bt‡)-Î;Ò;ÂoüϿ懎Èî)7Í‹kÄ/îùE\)çÜç½q¤õr–Ñ~,>ü¿ò°(é;\0ŽOŽ¥U³î§TLÀñXÚøÐÛ–÷¶¥Ýع9/ߣÿàÍÛ~£0e*™=2<àI¿RøjÅÓi.΂n)Çј¬DÖ ÈKžM½‰±²mmb¬.G„ãÈêÞ”žˆ5ö½¢©sJ8²Âý~'wvÒ|‘j˜»¬¡©•’`¬.d'áë“6hC3¸G{¥’—ø1E›°úMѦíäÖ¢§ªƒ Œ>íóSóg·C^GS6?‹>ÍÁ2 ÄÁe_FCõRiΓȑWÙ=µ·sR'=ÁY­ûÊ^€Q×›±1Ô†‘\ãHó&'Ê‘—Ï,YH%»¨Ä%T Aj“ƒË–Õz-L›(±‘l&«-™ X!"…“ä½X\κɆ…ªÔ@¹Ù²oÉå~h†cýeo¥æŘß-ÐTSB»©Ðà‹I­âY›p}á¤b¨~aœ{Œ‘q”6™º‰úqU¾t;@•÷Ý:óóèâ û ˜|üe†ÃâXLROF¨†™HQͧ-hºÃI­L%Ú½'ÍçŸOÐF[]i¾w31Îñ×°©m­¿-àŒYIák%uŽežûlJM¤”Wšx0+2‹31éÜ#š±âŠ_NÞÒ÷/­‘ F_”,R)ÙPêgEÉR€~»XqÛû0ËËu#\eÚh+9 “{Ñ~ƈÑè·ô$ Õ…å*ÛÁÌ“=2š øÄâÇ@3ÎÙ·›ȉæn™×¸°b¾TÎQ>|1Œ§9,º¼§–ù&¿Ìݼ¿€}õyŸ!úû+”úÌ•ÜJUQcô˜FÍœ¯%ë&Ÿ:†Üç ØËìbÍëzòº—À“N)JÕ\Ö?`#Æ“÷i 2CÀRR™õ5Æ'm^ÝÈ¥©ùOgG„¬ñä²Óþ ¬#F̃Èëw´57GÓ›ì’'ºH¯ËÌf]F |nê•Vâ¢2R˜n¾å³Ñ {e`£+_M4šü­eª¢ÍÓrª*ƒÍ\]ï¹lB99MÓTô“AƲ@Çf9ÿ®rxÛú|×Cs[Û#i ¯9 à3ÍÒˆä6¾‘W³éÝ_è3¥M=}…ä+êÙ¯gFrÑÅIc£’Û›&Ch\u¸¼)o¨´hãµîV/Ã~m¦%4Ĭ]éD :s݃}Šìê'âݺwÂåÁºŒæ³ïs¹ýâh…R:ýôÎnFw¬Ù•Oë.-"›mF?¼>ë— myV\»HV+z¦|–[Șگ7óYWúÑÕÔ¤ûç\2Õ7FÝu‰Ëú ƒouåÛôä÷ºHÚúܪSÌ3ç_¾-Ô®’šT'±UÄìÕô¼ãG˜­nUÕ<ÖB;¾®©ðŸ]ÍHc)ñ]ýØÎ×RÙw… `[lÊû7ßîß’×ÝÿˆûaÉ«“”„åoµ»Ä”ßwÕYÖlŒJú éÕ±Åå²-ñêL^kkf1¯´›”Jí>þ9)£-Å 3©6§ŽsU³Bɳ’yáÏ\ Î bËGäH¥ˆ$VE$E¹u+Ið³¾*«™ÈÅix½6Û~œrÒÄ_Å>öMof€m¾:»{ÅǪ(D@fSño˜yC°Õµ‚p,DïëPUÛÚ¸î[¥S'xŒ[¶¦¦d?;;\Æê:U‘>yýΑŸÖ ·PzR`$œÚÀW‰gN|¬Y¯CþäÇúþÞøæüñ€‹„5wýÃP¾*†Ðæòæÿp&ÐÿsE>l-«©Üõ´v+n!…Ðô”2lûM¦Ô®µ«dtÁŸ¦dª¯-wr ¬^½Í5`ÊfhIl‘P’ oïfèÅy¦z~QÆ{ÁMd¥,G½æúô­á‰ØüN.½KÉ4ü¾F7{Ä%Äy:üL[Ýô2 /ÊÇĠ¨ÇÓó«}Ó˘–/ì¾ 1RaÂ~¯zÛã¨w&½¾ú²IÞÿ²ÎûqÃ|ùONsÿ”³¾$Ëô‚§ÛænšP=(”º;p rÖ;P³Þ‚9dü<;›¡O‚þÞÛ&\KOÈˇ¿30ßùËž8.ÄÆnþŸq𮇃 A/(8( «lžàà‹Þk:ý> stream xœåYKsÛ6¾ëWèVÒc±Ä‹'§Ö“Ì´ã6i¢žÚŽëJ–í©,9²ä6ÿ¾»‹'CP¶RÅŽñ˜"Åbñí‹ÅûaY°a‰öwr5øö-ÕðüfPÏ‡ögr5ü~Œ$Z@SÑ” Žg3˜ k>¬´,ޝ¿eU®²"癤ßQ­›¢ÑUv”dö?å"{“xvœXÑ4Z6ÙKüc/¼ Ί’)ìçÙøx—*ìœÃaø¼‚oQ÷4Dn¸ãù^³ïrš_Ùnø•0¾ $Úôüš»ÁDMl†µD\Q”¢,9ÿcü#b"YŒ‰TuQj€e<(4@ re(kbÊ‘”ª¨ô~ ®KfF\‚hÙë|¤XC«á÷¥mÙ <@Ʋ“vÇ>Vø8qtÔfˆ×¾cŠS? ÞU JZ{ê¡ñÚ7ž…Æß3ßzOáúÏr 3­I ÓÝš¨F­”"[úîUè>òKäSÖ’esÐH¥²ß5 ôÉ<4‚¥&û".Z‹uOÓ2nmü£^S—Nái¨òðþ¿âà‘=âuÁXÓ<  Ј¥¶›º»`œ¥´xêm`éÓw¯¼ ¥ºQßJî¨oDK×wêû25áÆŸûÖd^ǃñÁið/«7û¹ˆqwÔW±CºFÔ¥kmùnw¡+¯ÁÓ<áäK¯ÁàäG=Z]RÄý$ÿm·¾›Ð˜¤œÇkSe 1ó^ ûWÇ‹×1±`±óª>1Q(ÕhÃc‚:¹ðF+ÜrJMs›nr¿ ÛÂS_y;€©dC ¦–6tû³³’WêNö…R @âã†Æ~ÇÚ¤뉅Æ}º’l´7içN‘ª»žµ³?U%ߢù¶Q·cã½Èë¾ßÌTÉV¾ ™)7ÎÔÚ'œ<ÉDÔÖ øVq” ¯stIÁ 0QÔ°„_h\Pxÿ²eìšþ#=Ú”yXb•}ƒ#*R ¹ïÆdÕ Œi¹>Eî—¹DÀB– ¦ƒØg}Fè4[ Ípf8x{ ‹Sø©É $CùGœÐ¨KA§Û\ аŸƒ GÁ$™= 6ÃϲŸË™É4/jÎšÈ åkmϤBHÖÐb8R$®á·Î݈ w Ó1¢$À¥’U¬²(ŒâàS1Nç3K¼¤õZ)£¹0.³ñ"LüLpƒx7M]s¯Cc¼¼f…›ko›¨óX¥tÀ^S«µ¥‰3B\.†krpá„9ÓÑ^*½^;ž4ÌYVšT;·¶»2ãJH¦A– ˆ©6FºŒm#Ò'Æ"Y{3!–ÒJe¥°:¡#,è<¥OŠÌoƒMQûˆ˜Øö¢¶¹ÝÝl¶Éǧî“ç©2 ä'qð¿cÃØaÏŒÌ-B>‘‚vÏ™ûKAÛÑ5Ú¤0ËïKñj\”ÿ'99ïKN&=ù@wÙé€^Æë¦O.éQAHpÜa}?iËVø÷™ n…»a<ù\°TL²÷~í…ö+©Bmû³Õ z1†UŸ­1âÖ¯÷Қ܄èÓ*IûûГ–ìBô—gɈôÜ#½°à8¤÷ ïÚGã«”u.vÁ4‚ÊcJéX-¿ë}\L#ëú÷y`6¸‡Cv剓6™Pív²PŸ½ïÎö(yr@k“Š I\Ÿ|~d¤§)ø¢‚âõó@º[Zc¬ætî â~u5ºfv5#ÁL…àÈÜn‹èZû]¨Qãk ¦Š›²%ŸþÊœÀ+iÙ¨LWØœ;„2[Ïm5ÖbYõQõpOIëi«-"îžDí´‹« ihæ‘ÃGƳJ™LˆŸQRD§j® {[yöœ–ïŒÉÚ”HƒÑNïà~K¬l±4”–¦&Ï«By´ÈI¡ã}0Ú€gW¤½i->ÂÞ½zZ_ÕGûiUõû0ÊÌ”ù~Ó2³„c?d™Š,í»˜LbålÛ‹v[s+÷ã”ýWn  _Ñ>7÷ ¬tbÓñËëI„’ÉÚŽ¿Õ¨ï3gP©mlk´¨“u¾Ýæ´ëœµ|5òÀ„­[¼Òf¤!|bjÑ5£ûÉoSN…ÿP߉̻°´z×íÎ>»mÛ)%À]ôÛ{æG.ùÆiGq­ÓÎÈlœ¸ã¦ØìÏçÅ…õMƒâBܤàIŒß¤ÂjŸÆ¶1ŠýýеRTKÛc¢ì`ÃÚÝ„;×Ï+ï’HÜ_Ö6Þ½QïÀËàwÖ(± öfA/ǃ_àï?|¶†Iendstream endobj 729 0 obj 1732 endobj 733 0 obj <> stream xœU;O1„{ÿ —ÞÂÆ»~ܺtPN…¨‚HuEÄÿ—XÛ—r±²g¾™½;iïPûvÖyXÔÝCÖÇ_åõQvY¯ã°è‡Ú,åÉ_P×5`ÔéÌÑ!麨OÃL„ôU_ÂáÂÉEê·ÁFóèJáXÌ=yK¦¶÷ìYØ ÷“É’íD!*"ç5aÆRhdo€šÂÙ<_r?Àöë™Ù ƒrár1‘réq$­‰°­à€Ä²'K9O©Šcî1+v³î‚Ì¢ÙËÇ½ÂØkEnšzóö*‰s·Ÿ8Wõ.çÚXSendstream endobj 734 0 obj 244 endobj 738 0 obj <> stream xœ½[YsÇγʕßpß<“òz›¥'³Å$àä¢Rv„„A#lþ}ÎÒ}úô,’(ã…t5KwŸý;Ëýeg:»3ø/ý>>?¸õØúawúëÙür`éö.ý:>ßÝ>¤GÆ3Ý0¸awøó¿lw£Ûõ£ßžüØÜi÷¶3C˜¦æE»wsÖûæ¨5™úað¶¹H—£kÞµ¶ .±yŸ¢7ÃØ¼m÷~; Œ¸–÷“uÿ9ügÞ>tã4Zܾï»àã´;|xpø·›§mt‰¶y›;ZG‹™.Ú!Ææ ·&cúæ·p´×»aôðÚÞM݇È+ 6êNðêd†~h^–Å^ÓU; T"í}œ,Qæ¦è0"gœBó¤¼ÿßpÄÐüŠ} Ùá¢qÈØHð“kÎq…ÐÅÑ6‘_ð¾Õ'¼,Ëò®“wù€Ö„t@2«–Mûúàsƒqw8HÌŒËÌ=l÷Jkxd´í›û­oÀ2|÷ ü0®9nœ®§cû’¾ÄW_ÃÎk&8’ë{¸ *ñ_xý#x÷WÜc‚=ýy‚×qÍ ü¯á"NðV°ô7r?ТiÀ÷áCœB¤‡Þá@Ëá*?ã;¦yÕŸð6ìn›ßð¤ÆŒ¼H½/kOBÔëÖ °Cïš÷ùírI†ÄñÓ{:Kpn"›½³øXÍá ‹¬NxÂLr´:>†æ38Ð3Ž.ón³ ¾î\ ü…¾ ÈZu›è:â£åQ'ù™D?h\ì-«¬è}H'ÍÏ)*õRHæ>Ó¹þõ=Ú(’ûšõ'dÉ ùƒ÷)pÍЇÄx׉wøh¤7Ÿ!3X~,qZ1x”ëÄïæ_— HŸŽßQðæ…Kþ€Áƒ0ñö=Šj¤ë¸>+vætÞïžFãÝSø‚ ‘q”×ÑŸÏËêqR¤–nœÂ®‡ÓÙI‹*"gÊ_´G­Hrq°¤še ÅOmb맨U­Ú-œëóÔŒ¼²#êÈ {ñZðwvŒngØ}×b Ûéln2ìÂ䬸ø`–X(Ê,6…¬Áÿ°ìÈt²ގ¤µ“ͻɡlŠ-|–Ý$í> ¨°œ·9aYø«¬„©µöfí) #/ðÂ۸暀lx0ҟŠÄMY”Î`Hí+c„·¼M¼/2ä—”ŽdZ=š9´8²×oTî1%SbÇá)à¢TL$£g%K–OÏ[8G¥å¤_™)¨`Œ57ÛÞA;†|Ø$”U2o™w$™=¼uRFÒ;Ñ1âYåp’‰9-÷…ô%æö<)ïpÔú쀪Útð¸'(êõJ`¯–ÿî “Ð†çâ¹èœ À¢ ¸5~š˜KÏŠÖ¹¬t—kñÏϘÄ ­SU4+2ý ω?2KkŸ–^AFì…Úy‘6¡];P‘±µçZ*,JÀ¦È1.L8¹¿¢mnæÍH,IÛÀ\mßKSa›ä¥Y§P¹¼#6ýÔÀµ§  ¼É“¢…?µ¼:'Ú ·­¥#[K¬Ao—Nù‚ªú­:×AßêMÿU¤ 5£¸„ñf'"õЦ›¦¬^wáú·¸Œ§C~Ó*¨ërˆ”Ë—Š»˜ÅR ¦'—ëLÄà \Ft0ȸ"Î9ZœYˆRXîTÆ]©[«ÏCMÈuiHžÁ¦ÏˆÊ McÜcþÌÜsem#wñÖG†ôÌÖÂådA=l'ÂG¡ù7æ6ì +G|·$¤% ƒå%è‰oà(Ó{EKîâ‰Ì nJ¡ÌcØŠ•ƒJ)Az˜‘£©Â®Ž{>ùîÆ@ÚN”ì=“?ÎLÊ_JM7ieääHZq)š¢âäsb?üˆ(Ô°|ØŸg(Ó}Vôyu}QAFULP ÞQc&gGB‹ëx”µ¾ò(>ŒdÛÈvû{•†Ð†aÈ艞d#~/ª4Zâ2íª´3+˹µ0»À*ÿ`¼~Å!_2î%A±€µZ„æË6).¨<ÚBƾƒWºÑÏœ|Šáýþ@þ€5ì)öÍmX RÅ=pÙPB@»¡Ä<©ý´å©TBJM2§|5ޤûˆÀÐ÷Ãr”T>’ ÞÊÅWéICr[>y¶vñ™\|«Ãm1$õ©„Ëty%ê•ë7[|çxdGnÏ|úXæÀ«’+òƒŠCwõÛù¸—rñ´p¨ðòeyòµæ¥²%$ì+MSocRµ=úÜ=£e%‹#9<žÎLämbÏØæDHzŸ?ñ‹g«‹ú†èÅéER/*Aæ£þ ÷»rÿ_úbfÍ“+e®õäìZ&,¹X{ý\üïšî—‹BÜj•k/æ9°m>jëŒÀTIìŠå BêkØß¡7æ´@eC ³@b8Té©·ýÌs¦5nR§Êµ‚?V§òÁKÍMª6ˆ[¤k¯R¢ïzÁíø.U|ê|pN…Š ²ç`ë0І €´Lö™Aàb~ÙʉóŠ*8ÎýyÙ‰½º.Xd6Ð"©Ü@T×Qä›ô¥¨ˆ=‰‘®íHᦿçÑ¢¦ÊŘç/ D§ÚU†¤ƒ¯!)è!§¿C8¦ò—`è’?+‡RȨJ¸fUªŒMA /–š%è”›[ðþÿ¬‚ìj³®uT[™—#“¾ Yß:ö¨5ðϼdè@ú@~ è@u?ªj¹Vq}ËúTWO×@ü¦6îñ•íð»¯ÐíÚ¬XDÞ®›wº_¤Àž11µ¹Æ™‹n‚]!ÀÞ rÅLI…`Õ;ú˜ê,¸À<±¾')À²ÁPZoSÍh\±È&DŽ–j‚©URéÖ©bé….½{ EÆmj/ÉÜ­bÀäE²÷Ó:̸Ž(6úIüj€¸¿¨Â²4´O}CVW".ÒÑÓúRî¡ëØOc†V\k“€–žà*h*„Uè{ˆÚ:¸y9Ä §·Bêè¬ù*ª/m׿Wú€ýX/—hÎmÍ!*M]`@qû¥¸Æq7fKÍŒ<˜¥˜p ¸/–-$cK¹¨n6~ ßHS#xÈ›¥X [g«Â€pݼ€;9`Ü„áêzœxcƒXŠ«½ªcÜ"–œ@QF;³cSæfùhÊ1«T8ëE‰rº3²–iæeŠsÂsdÔŽ¿¿hU½ÆžBÈç­î*× ô"µ– TŒÒÐÄ#æÞr¯Âúiœ •ƹ͑‹k²‚ìl"ÇɇߦÌŸø­¢RP¨Ôe3‰É¯cøZ¨ý<õ!Ä=ÝOÙD¿¬/J¨…lôqula±êw©±¢xL뵺£¥Ä(2ÒªVrê”÷l”20`¦2î™>%|%]ŠÜÈÈ]"– +Ô¨jë(Èb˜”ÂXž[ëCUtJ QUØÆÈëÙv} ”#¢30U;°/<(­¿°èâüÒÕ‡Ô—^õ$Üä·q– é¿Iù‰óM%u4³á€yFAT|Ý–®MÀ*c0½JIåMšÇ¢ ÕÚ¬WQSZBÔV1™¡}ß ?§%š ´(\FÇȯ”R-!tsø2Áóþã°A:`ð¥16 Òßñ–Å„eFJé ®wÖªìì´­Û¸nˆ7.bb?ÑÏÑ7gÓGm_ª`±œA×4–¬Œ­”(O ¬ V¹©ïÆeÍX†… U†sÔ uƒIø÷ÓÞ%½º¹*|tS ×ò¸ÉhVaîLǾA¦{{$ÿá¤YfóšPZk~uûN²w5zšÖ´Af2 ¶U#G’V)Aæ9-J-ÔØÖ*X²3›¯»°s²ºÖff[æZGð<qÈê5ŽjÜE&Óz6’³2 B—!±ÌŽhFGšÀåN¦)­:Éò•Þ¾z2´Mu_·f¸*ŒÂ쨧«æJ‡ùözƦÿm‚P9·Tæw[ÓÇÇÎÅÿQ•[s¶Ô‡!Ã~(–çÿ®Í-dšš¨¦AÓlÎl 7«gN¢­_Ân?Ì’òjP † ŠÎT¡HHÍ»ä‚íR§NR®ûOæëüÈ:ªçÓÊjJmà´Sƒ\[êS¼#kϵ†s³0²œ\1],çé\Q"œb0ÁcíÓ¤ž¥ì5ÏM9IPãòÎvVóQê@I@«ê4ú<¨RO6çò…È„O!×ó„Bg“þ5LCŸ‹ÉW '] ¬Bo™pòRoJxìÆSe_âü<× ·zG›åA‡æ=L»±øëO«:ìœ8ØfVÔ"»¢2ˆAkc•èËÓ˜ 6OK¥¼ÎЧÙýõΈݥºBžÞHlyÞW»ƒRFQŸÕ0ÑJ,Møÿꢀý¼¢>6GÚ©s%û—m¸Ä‡é`?ϯIˆúæï)œ+U¼¦<Ýó$Õ6ö§V§±¯„Ût! <_é-¿<á·Ï!ù ÿ‡sÇËéÕ¹?Öx|4Y ø,ZØ3”’Rž> ˜aÇP j¹6–¾mÄÍ¥hgn{öµ—> stream xœí\YÇ‘ÞçYýˆüÀn‚ݬ<êZcw!J\™ Ñ”¨1¯µ0†=¼LrFâ)ù×;ªžƒ²ù`gzª*¯¸ã‹¨þiÕìªÁò{ÿêèöúÕÓ7GÍêéÑOGn¯ä×þÕêÎ1>’\ÚÍVÇOŽxpXõqÕ yâêøÕÑŸÖæ]w›öÿÿ‡ ©Ò†]3À¨ãSxò‹Í6¯· »qò¸þ|×ßl¶q}Œ×ïn¶zãáf›b³kB^÷0ùîÄ8ÂÍõ÷›Ô¯àãðLX]Æ| cà-ñ@옣Ãg|,ÄžËë{eØïÝnƆv"ƒîâ„6‘Ößm¶\qýÇ \iÚܵzL\߇M8uüNþ`ãݨ{8ê÷@ ·0®ï£P´f"톼ڦfׇqdÊânÖáh/aü½‡ÿo7‰>ŸâI`Ρ_¿Ø$¾ÿ ’ïèÚ4]»>2¿†…ñYp±ˆðp¾ùŒ‡Â†x=ü˜ÏÈOÐ xÿÒúÌ/Öð¶öx yâùNôÐø †$cF‹Ì⯙€ põ ²è-p„f 3|lC\?‡cž™P$A†ƒiýH9a‘ÏÓ ùŽU–*+Piñ¿Ýyæ*·©EíËËnRñxÉ`ÔžûöCÐã:éjwC‚cna§m)$ÆmoÛ0–“>—‹ä e¡?ãŸÏð2±Žú?üZ&ÙíbvW+"زítžÿM}ã%‡Û–"C¤ Þþ±G¹%‚ø<·;g…dî€gvÿ¼Üß/],ú_ßM/ŸÞ–Û…^°¥+D} ŒÆç>ñšäéî”(´›Ç<Õˆ‚G‹)%¢ï${Cgª4¬ B:ä0“áI%FþKQ•’®•Û{ží¥Ä®ç¦—™i ôÇ™Œ³×Œ( ‡Ò;E!¾ß`<ö#qP&sè"…Úľ;šR°ìãæ˜Ä0?R°¼DÉ¿0ÙF­yRÆH¦À­ÇêB±øÛÑ«¿­`l(êWØ¥ÜE’® ö‹¸šFÂô`,Û>ƒ…±Üµ!@Ž@«Z¬‘ªE˜"R´Ž…è1òKz²Óód“¶©k Ø¢.æ¦íÐFÂÇ¡OT“Ðùϰb—È´49ŽØ³7 x¨!¸úÀ©@½d`†P)4dàêÑ4». –!_4ìz0q¦œƒ®Ý™‰—rè².Ò|I¼]NùÑíC—ÚÅÜÌ“qRO¦tAjÕ×Ë óPÇ5r ¡ l8XJ‰Z§0IL™„ª´NQçÄq¹sa]˜’ƒ6†j¸Î1ó¸1²->`"#¶×øv ½ô†ˆ“ \Wæ%kƒź÷J4-ý^t´ v§5½Øµ‡ü§Vœ#G­þ†Öß»ö `ÎH…ªªU\uñ¦p¦‘&LFiïÔAÕ Ëõ?!@«áÌxNJ+o)&"žKуSéé¦ôÀA–5T%_ª š>øbp§1:qЧ|>ˆùÉB('ìàuã,ˆ a©;¤o&žö°.Q´8™pá¯uý3†l D "}·"¶Cõ-Ùx,®=°žïq÷Ò³/íðØ©´ãöBꫜÌ=†ðùfYì¦ý‹e> ¶rž:öR|@Ûd4aâ®GŽ™¬ÃkGõb²xޝ€ß_o†–#¶?â$ V_ú.¥1É©«kF´|Õå$[š7Þ%"÷YªÇK¹ò©ê&à¨th¯ .,ÌuKøÒŒ ud œód7¸¬Tævajnø”µ¹yçôZNÓé´©Ë'Ù…ÒÎ~hƒ@²H‰ú¯‡!¨JžÌ’ˆÇEÈr_”evõyšD‹ê!ZZì[´Ü¢¤8,tÛâz”N*\“æ­½õFõ5LÛ–2„­>¼…¸1YÈæ#lŒ¡ÖëDUŸ•¸v{Î÷Sx' Àod´m’òØpÅ’ÅþÌñáÔ1£ˆIÂÞuÈ÷8ÓaŠ0Í2®G ½dÒ÷#6É»|ŒµÄ m•Žûcdé4ŸuÊiëÑ ¹ÐP€x¤mt‚f‹ËQ \çÙQLþ6³Ïô~áY± Ug)›1Sof. ø*pˆ©´µ:Ô¬M4áZ±-5„6ýÕà êAcñJJiÿ™‡¶lP:,8`±Bö¦˜´rî?°ÿ‰M‰ÁHä'í €[ìO‘ýMú¬4ÏÚ³>Š N§N•bÀ;gþð…–Y/Tˆó`Ù N –(f}øÅW[ÚX Eä÷rƒ{õØ~.DT¨8ã8½Ëž‡¼1̺nñØf/ëŽT@WÊH´+\ÄRË4²FŠÄ™;su¥ò^æð›1}m‚ìîç)•îGkZÑâÈŒ• ù7¢[dY«ºkMó -Á–ÖÊú´öɲº0Ú½ÒRR&y?Bzm+þU(Û<凜]<×ìRh‹u&/ÐÒgê:]yÄš5ÏMº¬ ÷„ÍŠ‘ O;›Æe†NëóW®lé(N6¤KY_õ_ü°x^5§Aî[ ðÛ.•À‹z“­Ñ¦¢¶iW( î1ûN€È 1žÝ*Ö •ͳs&ã†&iZâƒ1-°Lª‚«//ç Ó¨¿sä@Š#·†Ô×\ÆFs£p©> stream xœí\YoÇÎóÂÈoØ7ÍÞáô5ÇCø%ŽmÉ ,!‰¤HÆ¢HñÈŸ:ú¨ží—ÔRŒÃÉé飺ë믎îñ»yÛ¨y‹ÿùß;G³­gÊtóý³Y;ߟ½›)z=÷¿vŽæ_oc•Á@Q3¶£šo¿žqc5ïõ¼l£ô|ûhö¯ª¯]ÕÔºRô{¡´UM«ªŸêEW=ªºú<®MÓ¶JU‹ÚTßÔ [ý€?¾‡†Û5ôÖ*kª¯àé ÖÆbjûm½0º«~®MÏ­ [c\3}õ¬6ªG3pWÿ¬ñi°#t²Ÿðe)´þ÷ößp~VÉùY×7íSÜÞ…i 0˜Ö\X=6ƒ/LÛôj¹ ðÄz”¢:‡‰à¤÷ l„!‡®úŸß€X6´TïËΰñ^mñ즟wà+¿åg[}¨õ%j¤§S˜aÛÒ wZ™o¡ü¿Ð’–Å~´={:{77¦éHs Û sm;ÛtüsfÀ߀…¯ŸÌ¶žüc~~z±7Ûúy®f[Å_ÿø üzòíü³GOæOW£$_Å€mÇ‘âLc(‡ é\CSËu:¶¤Ó󘡫^‚ÞÆå‚µÖ¨H˜ô1¼ G© +Çæ8Ö1·¶­F¯¬Jý`ýK£#Ù~­ ©kØ®ºBAªa„¿›DØ…ШïuR¦¡ß¸á Ä`=œ×AŠÔ?ʳ$¨kÖ]ñ<CTƒqEë3ÀÐ!cÍ÷KØU®mì0_(Ó¸®ÕŒÝ 4~“ N›ÇK®àùŽêà¡Oê²*—zz†KFö³a¨~·¤®õ¤p©t\_’<,jße‹êgù%´Ò •Á&•„]êU†äÎ_âò£6ƶõ‰ÓæËPâwLˆ A˜¾xCÿxò0Ñî¥×ÄNKkZØø:ðÅET6Ö`„%M/,êjŒKÈ5ã:–0!"µ½Hð¢:ŒhQá vf3{_þÃ5 "_ˆZa„JBŠŸ!ÅO+`±sË$çh+"Þ¡/ÂÊÃèÄè.ÏÊ"=:À»#»p–¨šÁ=2¶#…v#vpø€Er†áó}Dã±Üÿ¢ßC¬Ã…éÕòâÜÌ3anïƒl$È!E.ÀD“éGâ¼×´‰ÖADç7ýŽøJÝ$øØ H%í~ÀnA»€ºElˆ£[â ¿Ä}´NævH¶u3Î)‘s £ØŽ,’á²tD‚Ê¡`‡r—£<šUkhï*°št,0æ×XðqN “wÜgЯÛu¶u˜>ž`úáÉÇ ›ê¾ÄYLº_e»: ?PVÔC(›¸G–ö ¶B$YK\½ 0´Ô:JÈ/N&Â$'ë¼(lx’€ Ê⊎TäCêz¿–4—ïQƒÓÌ (ůqàûð¨-=2•'‚1i cpâUgÕHÙ °!-ú\»ÉyÈ 5”Ф‘VšPx/2 9³CàÒÕæŒlêã¸Êäln{g‰~ WPš-ÌØ£ÇêƒfL±yÏ(Vê0˜;ªç6fö`7ˆ·Ü»ñóÌ©&÷,Ý@/ÚŒÎe4x ©M§ªWXè½ @:»SßÁ€ï…¾Cèi²s½dMdø8¦–>u/‘zÉm'¿Îh%Ä`Rª?1Q J“öcêAü‰~[×(&Ïë•á…Õíˆî¦ºöNà Ü÷ÖÂ8†§ð´ŽÎ{?’ê=nŠH[-²)º{‘X:ùïIPrÂ_0A œØßMñëY…@Ðo‹°ÝŠ](7 hB°Ò±ÅÑ)ÞaYnǘÃc|†NJßÌ3ª&âóMšCа:Š!üHØð»pPܜƻ„¸¯<µBL=$?º‰}Ké ;è¡Rø¬Y@åÞã @!=ц‘г•pºO5ßÔ*Èto·“…‰S-qõ¨*+XvâMNµæõ®?Í¢ì±i±N–Cï¢y›ºGUÈ·"‚:¯²¬Ùcã­cæzŽÜ HÈ÷~GrÌ¢ âÄ?Fÿ;ÌÎG+=C(>ÅÑö½ã×$26”²Ã UcÀElÞ-Éí÷&=9|\…e IÁ~rAɹ=O°YŽLÅ`+ sY¿¢ßçY/ŽçŽh²F’¸@Še¨Øa¤•BŠIv–ÂQÐlT<6½¤~ËêX·¤]{g馔ñqO ¡¯s¶Ñ'C½°”)t9ea)Q† 1 3(Ñ`² ù•ØåUÌÉHd£–hÄöɳ‰ˆÒ)ª´Že^ø ä ´ŽÏ">ˆ}vCBBƒÐÅ;˜ó­³Öœ†Á¥Á^(× \Løš(Í!ÂÙõæ€LP#üMIÁ ú>âF£½ pèbò jq+ïÇ;Œõðã4UÙ“Nª-_· «û±ð0îijŒøµÆ:N<‚_*:ŸYl-_¼ñÓs-oÔ‡ñõIÞŽÖáK_4ôgžÀ®€óB¾ðU*| ÷R/cáeªy*k†Â´Rïå^Db9(ÜŒpWNèÎ5}תn²ev#tPT¢•ÔÍT>Jy'F,yýÆ*µŽ=Qæm—Ô}›%9I…‡RÝiIX0w'`JC¾-m&è.òÂÜž¶N(½’ã¹C¦#¹ç’„?sl,|“|_ß §±öy6aò~x(þdj;M'­¤ï¸´>I÷»©ð\¢d{¹îŸã+èI°té¬4ÐËRáE*L¬þKþô®­VÍà+*ÝšÿC‘º…ïKÛìT.˲Õ8®quÕ0P’ìîFìN¢¶û´@I²ƒé 8_¿rËl!0þv¿iÛþ¼1‡–¬ $æájÍ0UàUÈêŠÁŠ„§~·†¿[Ã[Ã[bãwkx­5Üz¦œÍâ(Û6-™GŒ£"¹ëÚïßàÝÔŽ×ì_üÊ 9å7Í]sh8´GØZ-'žRJˆ{—WRЧ8°UVt°ŸÌÈ{GMŒn±o¬ºã3á8¨”¨?ô‰qfÀ'ËèaP¬šmÇm–…Øã•‚ @B±óYÌJ¥N¢%CO.f4k^y1|…áuåéA¶ÆJ×å¶ Yë§ f‡‡F›LÅÆPÊö¥¿·¥{Ûþ²ÿôœ§i7Ddàh¯Ä­-Ý«b®*¤¢t:Ì‹¨Ò][=Ç_*&ê¦4%umõ"½_'Ïé@êY½À `ƒÒCõakÌ»rc¸¾TMé-Ü” Iu+ñAWßgÉSœ“ß%‰ÄˆŽa[i+ìzP|–„¢yƒ½ôcj}B‡?ûx#η™È(ÆÒ¥Ýã4G‘ù;®§×]DÊ®t‹íÏ¡|ó…0å–¸§–@'¨Rz3ÑñBfÓK $´øžNÜP_Ë·fˆG¼RjÇ\'½î ÿÙ`IÀbq’Ú„Yâj‰üwv¶ã)9;ë×qѸAª·‰}”ª-^ç'Ȳx§ÐòÊÏݤ´»äO5|‹Q •˜Ø;ÕȶAWÝ K9òƒx08r’QÝ‘W¬|Rœç™3Ñû•^ôcz¡q?cªrÑ÷Ì4Û6 Énk:³|Ì0Zˆ1Sy8GÃkN.(Xçu“%¬5_< (ÞuÅ ¦í¾ž’üê±pÂß™3|+#¾M=¯<Ò5=nZø­õÝéš¾Ãþ‘?ü‘îI`V<²Z-à-ìçpt•ò‰…w«Ä[çšá3ˆgÑIÎÖ/oGb ·jw¶pƒÒ¿ø"žËà Áóå¹öýøYTa02kMõº ®…®>‡zœRÀV9|Ä™Øjµê?Ëš: ¥§û/Y‡ËäFù‹ü„ëüd2»ìIM´¸/ÿ-]qÐ|a|íÃ:ò²—¯“ú·túñDY^¾‹ÓÌÀæ÷xhv^ˆÓ7}hvþñäå}¦,¯ ëS¨˜iÈsgÀ!ˆ\×éÕm:ŧáäÞÓœ…DÓæÏÑ®2ÜŠÌáûã7õd×_”{ÈÞQZS€p’™Æ ñªÔbȪ.Ä"ǘç8CWk§7žÈ“q³™iB5õxSMœ–¶îy¾u}tµþ¹Èo=±Y8Ö8Kʧ,JÒóº¹M³^n“5ék"+]ôùAÅúû½2i@e>G8I-êèºø|¢íU“¾T¹©kÁ£«ø 5ɯ¿£Õ8vŒkÞé>‡r˜—Ìâ>?™Ä}þ3 ýI¿z'òîµõ×éžc;Î*-‡Ž?Ê{êt«ýD‘.xªóm8±zk\г= ãW!M¶”Í®´÷'ä„â¯>rRÉB±¦'¡y Olr°ãðÈ•?H×Ë›ºèyäyyw è}}(¹»VXò¾â±÷µ‚%¥ÏÅ×åòì"Ù„#eÿ(ÛY,³fGémm’û´Äœùqê2 N~?Uœ«â¬u¼+,6ò/÷ô‰¾Y~ ›;“Ý;œþ²6Nb¡¸+1ñw˜õ71Pæe\€O_†‰3å ª]éLÅxê»Ùöè9?›¥©èÖ½ò±¬»ï厣¢“RŸgR[ÎGﯲჂóñ˺F-ÒÃ`‡X™Éõ> stream xœµTÛnÛ0 }÷WèQ bM”|‘^ì`ºvë<ú‡,I»M“&Ùü}IÙ–l$P¤ƒZ>ä!ÚLI`Š®æ>™'¯.Àìf(v“<$àݬ¹MæìmE! $rÀªë¤&+5+l&A³jžüàVäôûY}$Š5=JRYdUSŒ|'ÒŒ ³™ão„æŸEªyEøH¤­ãB¤F+© ã%&—èÑÚ¡“_ Sòs Çà§‘ó9èó%Î[#æ((VQh‹q?‰´³N7NùNÒˆjlÂð¯"-Õšˆ¨\Cës4ÿ„D ¢†RÛíä[àwX'Ä:Ãax:&ΑW–ºž¨×h PȲ`©Q²çêÉ^q,ʧddþ ¡ìÀÑã™&VV:[ð-=/Cô:D1œé'£<š&…ž»îS:<—|ÀeŒ\pÁaÓ‡Ë|Ú¿ˆþ^ïÿ¬¹ à*FÎxÁ¿Êé[rǶ³{¢öØï§=ö¢c†;3¤~ŽJ+@±ÁȼPº{_™¦l”9·zñ ¡úQ"ÃoÉøÿû÷÷ÕXð6‚Û®™³x¶/· B÷œô—Ò/~ùchýý¢­´ýªÍ‘Ô&‘sgYušTƒgȼ ›VMúz*_ÊðßdÆÍ*xä|ph‹Cÿ|Ài7<øÞÏö´ÄOùk¬nè;lŽql~ûœ¥jéÇWoý»^ùVà~ýÃZ“Àþ¼otóÛ‡£´äZÌqè`6Á{¯ZÊ4ª’/x=¦¤ðendstream endobj 754 0 obj 596 endobj 758 0 obj <> stream xœ½[YsGÞg-?b‚—Ù°š®£««vŸ8 °1ÈWx÷AH28l‰K²ÍþúÍ³ŽžîA"€ „FÓ]ÕYY_e~yôëUß™Uÿä÷ÑéÞ'Æ…Õó·{ýêùÞë=C—Wòëètuë€nW¶ïB°auðË6«Ñ®†Ñ­N÷~^ßÞì›®>Æõ‹Í¾í¬5έ7}×Ç!gÖ¯äëd×çÓy›BZŸÀ§äú0®ßlöÝ8v&ˆ8—sÑØÿ|¥÷ÝGƒ†Î»W÷þùóú>ÎkzoÖ¿â§û~€y÷a‘cc™û.™ȃR ÄÑo}×G×w.¹²÷ÆøTÏvRºÁ9›'ˆfý; J1fý%~›ü`cý°—8—ƒIë š¶C5äÕÎÊ·Ïq^Û¹`ÖOPOa¢Ìzô2nH 0K¦5ÈTöJµ`\´ë·x¬Ñ;Qª7°Í]ê+5u&ôV•z°Ù÷¸‘8‡§±8™ ©K1¬ Ç~èúÞô 7Áç¢Xwà/a¤‹ ºtféçåÆÅ®7Þ­ÿ„R5+Ž$($¸>Є"Lâ&G‚[ g…›PS?Ú÷–&8TIŽyÒ”üúU‘R„gæË8ô~eYtiz— }D™#-e}oƒŠTƒ"áxéx@ÀHà„Åi|X?åµà û½~g£—¿ÃË@¥B¾Á¡) †_$¸0޼½ë/P0GJBÁUù ëqs’Ÿs­Œ>›¹Œ vf …Ÿ‘Ðëë0ïÍ Ì}Yë¾qÝ0àÄ%ßßXºÿDwéwO‘yÓ_¨Ædñ,8X€¥/aÇév]*o‹ˆ ˆÃCbPÒ-—m±¸X»þcãøùüMìü‘ ‚{È|n ™ïåXÜÇ ûÃúY~Ô;üÖbÜú+QýžÕ‹eÐ.éܸv¤ý{Œ& >àxÆ•íboXùÄáì8ÌE:C÷6 ÕX}ˆàßp¡.¥8æEÂCiü%ì.,æ‹æ Hˆ¨hZªý€Ûpå¶ ¯ÿÊPañ÷Mê,/á…h,Ò!ÇŸWb1hØú̉?×ð[¼LWºU­ÙjçPjõP¯ã &Ç!<ö Íœ^ÇU[‘C7½Ó!ÏuØ<:éúò}¬,¾™6ÕƒH^÷ô¹Hû O*Ú§PVÉšä1¤È>ÐЛ q3p¶ž,'fõ–mƒ,ÕƒKÇwˆƒ™#T£G¶~ήû!ÚÄâD8ï¼1Óïð‰„é„F_¼ËKݪ¢2]Õ8ýøîŒ$Я;l³wy7õÇêÉLgú×±ø‰Þ6çõìLìbÞx{Í1ôµ×4HoÊ©|^D}³ð Ǥû ¦äa-Ÿ#ôÖpÁX²iÞò•ç²¼g¨Þˆ};ë·P&}|·Ù_O¸Þ€j³R½\yQì?Ûb<þhqòñ'À9´òvbåËñÙzChx¥g.œÃƒ’!÷¡0Iì(o©ßTœ‘ïÜ~J>´åðgW“¯áÆFvö!/qŽ~aó;›†.»ñÓìNÊ—/Ÿm:>©¾Œ²  a7Apêwùß•¿ßnÌì¶Ž¡ *€8&L)¹úHàÎÖèª-÷;2¸Ä’l?np^4*ΑÚÇC2XS})‹–Ë ŠKB ÂìºßvLc…ØäùÔ_îLÝ!ê|SÓºgóNŒ1 ô+¸Ä &ÚË+Šð­EE[šÄ%"2ï½Ø::dùxO\‚¦8D¢£\¢_1Yb ‚J1~…Di!úbx¸požÜa‡Þ‡yƒ¿E˜DCÂjòP%eKß2.›m‘Üÿ"›È qÔl®†ejï+gçÀA…ÆVú·É—h«Í,lDW‰9ŠÓXƒo©(Êy(R¢§ .÷LÝ[*vkðd:ñÏWõè$åéû:£LVÜšNåƒÅ) „ŸÌŒçés{ù½gÇ­±ˆs4ÍD›P$f_â]šh[‰»Ás˜q¦ÏÄ¡aÜt·ÆÄÖc‰ Ñj$–V¤ÐCƒ!!9€jn“Éa_Oèü•-¬N2ÄûÍáñ]åÌñ²«%(F©̪BM{}Ýè¥CTÂ=GÙ–ê‰Ö¼!ný¨¢ReþŒáH¢œG[.™î§FÏ™>@I¤*Gþ…1ÄZ1¸&Ö«(´6#›¼Š£žãéàôÙ†1sG}ϸÐó_ÓSšÚ&ÆhIkÌZÔâ¸Õ¬Zôyw+~BKÉ"©ƒ0½°-™ë [,°pÑg‹õ¸Ló÷ïNãê(Àý2Á'”ñäæqaŠqàm„xcÁÎTÊõoÄoRtÞe;ô'‚ ”â˱¯Ì’ž¹”) O:,[çõ‹d+%kn½s¦h¨äì¡I |¶³´aMªÒ‡—ä9JÞè4™Ê#Í8Y"8QÅÄ*;ÇnsrÂD”·-þe¦÷Û¦*½„ôĤä:JjØIjªï[¥›ÞP¬ÌþÖn£ß&Ó¢|‹k¢ñœçüzSrBJ¹2ó 'lN·Çak¯ËÓ?²ÌÜq.ÃÞæÚ)ûUÁJœÊ”XÙ‰;Ìg–NŒr5Zºå˜B ¥2Ï豃&ØPœVö€¯‚îîÁ:;D€ŸòœùÚŒ‘ÒÂÙx» ùþ²Q+=jgÔZe¿›bPÉFó=(çÙÚÎ I‘TU²9_:=”³u5€$0bŠáë4 â1D¬ƒÌ÷ 3"ïb ³úž¢¦£DI†_¶+¥‰0›U·ÈØ&ï/ †(Œ>ÀËÙLzæÃÉ⬤·Ä¢]è r67#é­fMÁIQŽ$jü{µ¸·¸ÝYA‘j6Q¬õD^4-ç4þÂ)u¨šê¼vDãk»E^×)3X|ÞÀX¹DYÊúQ}@¥ü,è;¼CiÓŽl<±dqꃒI¬‹1|qþXãwc;ñK]È8Í[þ…bX”¶`ð |`õ’*%f¸BøL#€¡VÊ<(ÿ'I<â®PœÆý;uÿ…Kþ)R8x>¡ŠU©r)ðöÀÅG€3š?Ü‚›è`#”"¾{°÷íÞë•s”–îW a\™`mgãÊ:×ãï£Ó½[ön¿)*Å›p½2²|݉jÂGŠ¢ZÊÎÕbc8~rµ ëë}£–ÂLn.-JoÙk}äÅ;f»øïbâç”ÅŸ_-£æÓ¥ÚL„â›rºTÄm¥ÔÞÊ'úÒZz°²ŸC+>Ûjå±,µ2Ðjº2­’KËZa;ãÇÙ[çü¡ÆÃbˈjÀ…Oi<À| «ó3(-vYº‚ ÿ9¤\-™41õ˜q˜[ME–HòÇ7aÁžÍ±a¬—ÿpÖdSÍÍ •T “ U_™|‰àÙŽIëì–—½á~¹¡jd«:¨ 5Pòêâ–ùÌS]¡R-'n xh™JÉYŒ¼²ÈIßæ\8]Ý‚½xÎû¤Zõ”™ŽÕ@¼ð÷©)Í81:©™,tøœÊbÚ vF¬´õ©ïïËÜ•wÊÉËíL§cá+,ø¹fŠ› Ìc}ìV+¼ô9ÛÑUY*mE 6}ŠD×ÝŠvàû°Dp¨+¥Bæ¯b¢µ1Ró<9òºN-´˜¹W(NnejTzª¶&;†ì&šc?±Ô6ôtÐónQ¿¥âÐ¹Üæv‘5¨ë{²óI¨À~‡U•Ô‰lh·@¡flÚŠ›/<—TUcuwô’‘Å$#×?äÓ6g0)»Dê·ÚLº/koíç%€L¥Šù~Ì'ç›Ô¿u·ó<ê Mf*Zª6›Zmy3¤·i§Ù6oJ%›Œ^{Ë:]Ýêúþ½ fÌ Â3èÀ wa\ ×)æºDVRa9â ìBu ã~#¡J 9b(ÅùºAÃUÃ*‚Í¥6×f+ Koç«g ŠH­9|–{ëså¡é@ÌïJµiÚÄéMUEæ½ç\|BîzU¨p´º§FMÉ¿¥ä«]quƒ˜²DT®ÑУ±$o’lCsiÑKµ'×t‘«Ý67ìS¢zìŒêW誆nGb dÉçEW h_ç¨L˜v¢P"MZ, D9TME#'öìrRø z>j}ÏŸeé°KíÂ/UàšÕÂ6Ü3®Ýƹc@šà—]æ„1n hûõ†rqu'S•Ôø:'619MlK†ó¬ ß™¥Qó‹Ï6qVà3í'j¨øx˜i”CÈïaЊË}]`oç„JÖ‘ÐãÜ—Kñ G@9 ‘CÍËx_f³‰P¾òq‹7™¾9òik7dwü ù’ˆü*ÓG-I;*j}¸8bD­ú˜ ”TÙý/¤C¯®Rm./¸Í.øÒ€¥ËO½\¯ ø¼\©«fS´³¼ªõðO-#–Ã++£ôS6JU“-iX‹Ý¶5úR’>÷ÔFn=Ë ûvïÿЛ¼endstream endobj 759 0 obj 4531 endobj 765 0 obj <> stream xœí\ëoÇ‘¿Ï<ýûq×ðŽú93ø!Û ì;?häC4)Q:[-Qv|ýÕ«»«gf—»L–ÈáÃ"9ÓêªêªêúÕôÏ+ÓÙ•Áÿäç嫳ÇßZ߯®ß™ÕõÙÏg–^¯äÇå«ÕÇçØ$XxÔ%“ìêüùw¶«Á­ú1tÖ­Î_ýi6qm6ñ/çÀ.£oº ¶ƒyÌêü Z~²Ù†õÛ¥4†´þhãÖ_o¶n}ŽÏŸl¶ùÅ·›­w¦36¬G¼ƒ7Î%x©:?­ÍŸàÐÇàßÖ4ð·ïp?UuÄ7F=uù¦¥N~ýùÆa›±—q Œú_µõ÷|%úåW¸wýú?a´Ïq´Þ 8¾ñ;Æ8¯ŸâR°7­é»Í6B¿apÂÜV[áîÖ›n°)1“¿Úxî¿|¼™2ÖâPOÎϾ9ûyå}דLaþqePiÆUì~D-ùøéÙã§_­nß¾vöø+{öø üçã¯?O?]ýÛÙ“§«oŽÕëú.Ð<]`úéEÞ°°>ÚŒ(mϬa¦Ð[äÌŸ7¨ˆ)®ßo¶ýúÖù^üÿãÏÿ5?ƒ6a¤6 A¯QÈJcgf|‡?‘ |€§–´U/Ø è„_OóMASã8—?°~½À·8Ë[ýr U(S ¤|ãã€×ço*MW8¶{¿¼Toh5ÈBJ‡–4TO×Òg×Ê‹g¹7ÈX6"¶½’áÆ°þe¢À_x|÷^uΪÙmH ·¾wW[›:Ç£‘^ð¶8{™K‘±¬×7ØEDë¼ÆÆ@,l²w(áiCø^{‡¼…†>;žÃk݇ÆÎÓ$oXðX²N˜V¹s­_¡—àE£h_mœØ·‰N¾ÅY ‘[Ö§›ê2ò³²òH+çÉhùj*Åiž4@oÚ°¼ ´y¨Í£!ÃòœmE°]_”QÉ÷u‘Öe!ªÊSo:nõ®ºÄqiÊ4Õ¾µåNÿ†h»ü†³ä§NæŸÂ0v!À<¹@ª.x#æ×¯C²a)»©Ž \òv§¦:š€»ES}÷6åÉ-‘_ió_7_L#«‚ÞC!ð¾z$>˜5 sw„aR‘Eo†ˆ<9]„T›€ó ˉÄÞ|ÛbäýÀÛðòðånÊÃÀ±ÑÉ) ¾†ð½Î”ÌîoÜ_¬ZbCF‹<X)YÜ6D6•­kÀ¡/Þ঑¦ÚÑØÝ®v‘!rÇÂ[ôv,ál6ú©oü¥ÄÂÙ ÿ†¡cb÷­7½´ëÇð¨ÄHâ'š)Œ|Z¨ÑÊë²E[û$¤²ËМˆ•»{¯(cvtÐn;}†#Éh™åbDv-/ê J”âù®šP‚, ‘[×WœE…žˆ—‰¦Xw4ì‹^Tuɯú‘ }Þ y}Ø„#¢¼'ˆó:Xó}ÊU'L¢ßsôñ¼ì1Қ͋l¿ïcž‹¦jî«T[?b’ò„äáØÍŠ1ÿ`ß8B†nlVˆ›êš¥;ûÅ勿úÞ“¾Zˆ˜-9ÎúúŠ)¹Ã”Ï÷‚ôÖÍÔˆ%œT³‹¦™Rã6ÜÊëoM~àM–Iå*Çò9äÎÑœlP6mm]|z‹Íé Æ#r”;Ÿé+P'}ÓŽOê놑â8|÷…ÄÛã¢43ëÙB˜%×Îíœ-%y¢±¬¹±"]š(M£ä¢"nì‰Qà•­5Õ£tV¦‡T†WÚ=gl\åá¤ÍR·¬c€lãä rî†Ä×QázKèCC¶ÃK(a>q°µu— ³öÈJK Uäš]—:äSL’jÃj–ó¡çd›] ²Õk68»Ö Ûï,«wx3´µZ¥lŽv³£ÿ•¸N15¨ø³P¨,Yé÷{Ú„"\˜Ê¨Îr Åù‹Eʼnó¹2tÑeõœº~âqðžfÇíÌèÉaQrtXMVä6WŠªBŒy©Yoq”‡îô†¹°'ç("-ÚE hÚR0±'gTÏœ”ÒÃG’¾ú.)ïr¢3¬Ž½Ã/`@úýåÙùZp˜‹C°Ô¡‹²¦µe°`û€éC?ïrØÑŒ¨o¹Ó{|ï¦[nê¯/y¨‘”&?Dß=€m§T#=ƒ' ¯ñdé°¥í‰Òü(„À1®¿Å‡!Ø<{ËìØ%d‚³~>9¾~‡Þ¦5ÝtÞÙÞç\q :†Íå/‹Ø=´aS¶_óX¼ ƒFÓnô,€ôöF;•›66#?¤uCd=-U§×U>I5%8 LSMEü7/rÁyV3Ãi³›YXZdãÂY`Çf]{6– ‚X ¸‹u ÏíRn¼qwè¤Íʪ”àU ¾¦™>Ï¿ š€HVÌÎ×ôúW¬@ÀÑ=Éëñx\¡†^iBI¦`nŠ¢óPãí+fº•ƒÒÕœú«i?~£XON\¹9+±Íçl™øÖu4»r¦Î‘¹.:Œ$vtZ=EÄïe¢BïKlñÿŒ9ý_ÎÚ‹ò¥ñ æÝ!¯Gš=‡,ClõGQ4YJà0U$ÕX^nØÇ=ʪI: ›lô¡ ß5 wkÐ*¹ç”,¨8ä^ȤÛä¤w›ˆóÙBàÜÄáǥ²ÐdÊÔ´iCãG ê5‰a™ÎÖ|¨sò<6qDom§ƒ~¯Ú„Ýéå{ lTËŽ£Ò¾î³[ÎäØd’à‘ÙµÁX:–î´Á•‰s˜oƒ ”*ÖüFf˜ïž s^ÊE²Ó9´t!oŸ¼ 6$“² ‘E^©Cïïàµe¥­(ï9j»ö¤Ÿ!æá'rç”)À0ãúU€½ÙKÐOµÇZ&1™áaHL¡³-‰)Ó¶;mÿ0LŒ6¡C×~¿i«ž ¡´o¦›·DV}ÉNf%S©äšÇâCåâñ5ÛÍpRÚÖ ®Tü*ÚÒt.:sòdtp"vç)•ª¡ Ö< ‰! MÐ$jSÄgœêË'æ°,D‚VWâLWãÌXåWÆÏ´XËYÞSõÈö¥àÐ ŒCÑNDŒ!r&<{Ñ÷Ò€€ùë!1z4‰_çj1ýßÕ4«ÊPíÒ€æ¤19ËŸ½y6é{ k8`=\± Ñ1¸6a¿9°ýHÀx`ƒe§¦¸Ö(X8ã÷­2ì&n „Øžž¸q@ª4qÚ…1fùO @ @<=<Æ„TOõ%*Ò‚ iÜb1µ6¤û˜Ö˜áHSâ±ë°¤lQyî²$b5÷FšNQ¸àJ@¾#F}z~®÷®!w!¼!½ç‘©Ý›*¾Ÿ}±†MX9(:Ê#Žó )¬ÏÀ¢=-EŸ%£$u“Y-x™¬Œâ¬äîåsS˜uXèåÝ@Ž×éó¤^̓öŒ>áDÇz^®÷ahDh{B£Êµx½}¢R‡ÓÓ ¡VŠ-½»Õk(玈ñþñ‚RIÚ•¼øl“e¿¨fG¶Ij‚¦Ð‡˜ ËE¯žNÞ‡‡&Ûð6µ¥È5 ˆ×:ãy²—˜ŵb^ d\c¶õüsÐtjâ¹þŠ^â?osr•²ñÜŽþüki|]Ú½‘BPªeCOÐcÌÿš2÷Q™ãëòð¶>¼,ß–‡¢ÁïX_Ýr”c;]M—‹ ô‹Ÿ„üh¸€âƒòú¦íGËùP’\¶5“S+ª9hÈ•—‡7U,9˜ò°ÊûYùíÃ:úK­Î+½^à‰¥À‰*a?gûošÎJG~àfâœç`œcî¤çƒúô]Ó £ã³§øë{N4A¨bKÎñ]í„e¥3üŠNs¶÷u'‚• Q)¡cWÝî-×A[ÞÊ\ÊpxöÞº)(ûo-Ê dU”O¿ØhˆzZþî’ç%±Àcòu†À¬¸•ÙÌ…‹#0àEû4yU·z'þ•)ßkh¹dœ^À¹\ p4àÅõÇÚ1¨ÜƵ`‘Ú³A/W §ý4£õÑF}#À0÷¤–Ú»YA²”„êöÎ7‰mß„ÑßKµ YaEúàƒœH%ýë1lû}l¥o"—~Ÿ|ŸÑ‚Þ„\ˆ—)z‘·Â¥½bì«díß”„6MÉÄ nWëÁ/D Äþ¶Qëœ4I2ëÚLºØ¢QœGâ9Æ£hšlh.e‹ì²±·*"¨™·ˆh-|¡rãí ‹Åi¿6‡Çm^Sëµþtø%&/•r9.„<Ru\‚¸ ©ê:ú™‘!+Ž®:ï(ÔšÛ?îFà–ÊÇ|¿1É.£v µG<2ššîn­Ÿ¢Õ •²\ ¸Ò—^¢;xN¸1ì½VÌ-#Zx(ª Æ…þÖè,}tñŠã:9°¯í~E»®1U´hRñ@; ±cšbª #Ò˜·uvW% KÁß‚Tñ;˜*;â˜1ÕüåEóµP1Þ Ë8O ŽU¸ý¦jh>¹!mA›PBˆ£±UvíÉþã0U*kcr(¨ºm•‡—Óš—Gz§ŽcûQδ,s'¨ê’;Pe®øRgcÌ‚i è`Ó0ÚÝfü’”–}’XÛv©¸[ÔìäÞˆÂïAŠz]wM³¤â ˜›VW´xjVÚ{á©.ºS΃xª]¡{Ê_Æ ¨žžFT[CTON"#ª-‰û!Õ\KþT/}ÚÏ{T¥hà8l?ƒª§'‘AUMâÿ#PõäìPõAÕÓ“È ª&ñŸ Tm>8Tõv²Ÿ;AÕ8b, f!4)m{üˆ¦ÁõC1Ug†6Ô²†6í¼5K[߄ɶ7ãÑPª·mqVØÎ] ¥Â÷^Ä÷0 6õ"0 ‹s§õx Æ’«V§ï¤öŽ€éÓS ÑSßP»Óä¬Í’©³aÁÔ‘ÖWg'FS}ž59ý€a÷ý4»2Û âämbÂâ±a°b•(xj °æ£ÓNÌ¥{U!`Ýüa‚¬ t;Î2ð:@ÐR¶Þá«ãj<^•ñ $:ŽJ‰÷X£å½trrcÀ½¤¨Ý«^s÷AZ©>û(ÇÝã€UòK•ÿòb¾?¹…\¿œwžw0é6˸œàGe!«÷Uk—wJ}[ŸT­`]Åâþªþ T=TUuþdµ\á#''úl?½Ë`ë\Ô×0FÁ'ñ+B_iB£ø[Æ–>ômX»£¾Xwý¸AÖrŠÖÂ]™ì[Îc7‘½©¶ÖÙóÍ× úÛÞ"’?È †ó8»>ÈŽrôð÷}7ÄÃÈgÚÿܶôcKßåfmµ|Å+T|•/ǹã^‰Í­ ýiëdQhÜùf£Å¤ÚžÃñ@!ùé‰,Ì«i=è*œëWu,7/”ìvß—<¤`‚99~<è˜Öšü^áyë—ZŒÞƒ µàÇ‹lþà?ßñë†nÅ(PLS"7@MéëK&ò®¯†Zí½"©Wn`r=¥]3ƒ%‡\p2»ƒ‚?ß÷ÑÀÉlšH^¸o$…Ý }ÛË7{~m W—"½ÎÓ S l?®ätÃj)¤Ë¸»\¥ïœª¼"ÒrcU3üE¯ßcüó-5þd<Ȩ› –ÎsÝÂmÞó5GmÓИī×ݨz„>ŠôZµäÞÊ*L¬á9]–ä[&Õ¦½yd¯Õ–¢“¯~>›ê=6„ª|qP¾ ÉåDæôš>>„ C-Îꊺ’Dâ’¥÷ɨ…RWÒÚ ‘pW/€¤#K¾uEƒÐ'Á'3¥Ù¤é‹oÀRÔë³Ê– Û ï!‹Õ„ÙvBXKÂV ©±ÝNUSq‰Ö±ö®†¨;­Ü2¹ê. Ž´¦*×pUo¹_f¦NúŽu‰"ª&^b™iÌEòK£Í|ßÌIå{“hŽ¿½ ¯n˜dbÕDÕ¼gëI_⨋¡Ê˜Ó¾ÔÍ`m×mA·ëÅÒ/*ñL“JÕ™\:òí§ù.ª,óË… …FûØP!^œ*Y{Å5w±¾¹²¦Ü3´¤éxiÉĺÍUšPÖ܆žMñþÂÝŸñð¡Œ\)’PÈ©—õ=öx¹iád}Âò1-Æ–5v’kßÊ…EXrûî˜ÕÉIï+»Ê·¼]ÊeHê6}™ÍEO%uï4 ÌÐ~—©c!ÙÉEFm¡EKxte†”‚Î/&xÎ ö²žïdÕ¨<.táôêŠ}jïàÊ·$ì6½ç«ª,ÝtêÛ ë•Ë«w\º›_ίM‘3îþ˽÷ÇòíÙ — ±b%u \{=ØÍÄ» ©­ÕP%žm]¨0v—"ÑRÜ1ŠDwVQ䈿x·ë=¹ó›Îßœý/¿Í[endstream endobj 766 0 obj 5240 endobj 770 0 obj <> stream xœí\ioÇÑ~?þ‹|Ú5ÄÑô5Ó ,[±ø“ ˆƒ@u!’HërüïSGÕ3=»³¤WÈûâ…aŠœ³º»Ž§žªžŸ6}§6=þÿ}ôòìî÷Ê ›§oÎúÍÓ³ŸÎÞĽÜÜ»ÀK¼C]èƒÚ\<9ã›ÕfÔ›ÁÛNéÍÅ˳¿oýÎm»Þ*ú÷|ô¡ ~Ø~¾3ÛïwFo¿ÙÛíŸá‚owçª ÁÛ°}°;×Û¯áØç»sc|×÷ãöbç Üéôö8qog·_–îÃuVÓƒá¡xÔøôätÍþ™Ÿ|¿Üü§Ýù¯ÐúÄaY%‡eÝØõFvq £ 0  _iTWž[ëºÁoÎMß*¾ã9ˆ¶}…?ÞîÎ (Ûö þý<4Û7ð$PjûOüóþx†?曟âÇøãŸùb:ö\áwøãF9âpÂö.¼DIïã{à7㆙zš¾-åƒÏòA­†ßqLçÊtnè5î‡-¾³ ßý¦>ñ"ŠïúÐõÊm?Îcz¥.¢Ä1Ý‘„‘ÄžO¿*’Šé,#y]Î_åƒïÊÁëÖ˜ÉËéÇå4 ‚J¨¶¿/SzH¦åTˆóñàÃÖA!hQ‰véרŸÎVZglghe´ï¬ žWÆîLS•ë._ÔçïÁ `¬vû’ÕÌæ=Z% ßÚòvGÊ8Ð1í`²N³ƒ«JŒÊ¦zOš²  ^òåvûQ9 ³¯ã¨éÌ%> zÜþ¸Ó[ö/xýƒÃ·f5äW×zòz|ñË¡ñlȨV[Ð4[ô®ÿ/}±Óò¸æ]Ì@ä%‰òÝIf#D»â¿kù­‚ײ˜Ov¸†éò„_—ix»K‹MãA5³žDBQË`.ãÄE^çå(ôß”žŽÏÀ‘âÿ(—CwçÄax¨x– CÅñY²ûs£t§íÄî÷è€Ñ¬/ÙâQ³pIƒÆÉOÇÑÈΤß~}¶ã0€Ö‚‚æžCn;)é-¿÷¥´ózNà©0Þ²^¼âþÅÙwg?mŒéaç¶ó«à)Öoœ·ô/Àº{Îî>øjóöõ»ÇgwÿºQgw¿À÷¾ýþyðÙæÎî?Ø|· ø&¡$>«F|I§=#>ˆ)h^f}µ¢-¦q®óBL’¦QŠúy6§4«ñiˆlҩ˹gLjÿ*Vù˜—\p2õxktÃ:"š~LnÔj½ã-jLx`k paæÊK«*ÖÖQs𠻏lZ°ëF¥pùN¶llÛhx€j}ÓÖDð§—"–ö•¤ŸäìC$+_âD;Ô°Z]Ž1äðžóF#\ß÷9½Á¢V™ÑhÊÎ2-´ˆp°à}^ðäûGMþç‹,ægY§Kâ„ntd-µÅçaÔÅ‹öŠƒ5µ¼"õ#qÚÆA§Ñ°¦6O ßé z’9)T; MŸ0Öƒ¯‡ù…“H”`¯™á|XC‹Åã`‘f#Û¡ˆ+x7»Ì@¶º6:Áõ˰ր¦PWÒ>zÐ[¡p€èVŒclñ° ‡ PZ‚ô ëHxŽagzש gÄøÞåA`pG¨[yWV$ñÞ¨@—e‰ï ^)k˜adñ‡Ó…·–4ì0\ŒÃïÀÝÅ7þ®Š®çq@µ'^é'•6Ä8kÉ_žÌû(ÔÂÞƒ¯OnR4˲Y½öCȆX^KÙþÉ!×Ti‰6¡™@4µXC©Þ3üžÐS"«M…•Ý1žGÆôMæótÍÜ”úLBlZU0i=éØ¾Çˆð)j>G3Wó/–Õ¢R¨šÃög6¼Ã&ðî¤%¤a÷G›ç¤ht†”(¼æ¤)f-q¤å·– SÇäb<òhî0Èä{1zxËP¦04©h¨½d¨9¹vÉkÁ%&›(ýè{Zðµ6zŠüÎôFèÓé9Èi-¾ýEe„™Àic™¤þjÈk— Jú]n°¤Øsz…k¡éäÕ®u,ªUšLe!ºaòcŒûòöˆ+lÏÏRÔÞèã xv’À‰4¿’gÞ”o5ešÝD¸hwÈ·ÈôÄÆ…ëå™Íl¸o ‚<™‹3RÒÁÕ·žmÐuÛ3µÛ~‡}y…‘q6íÐÄÍÙ¿ÿ!øAÁ %úS”Ìú£[®û\!`­¿† 0Y;ó{²aת8”r‰÷i’uQLðɬÞ'|’Ó•˜‹õ€ÀîéW¬ €.¡Ó˜P8×¥Kÿ—%¡Ôj‘ƒ·ä«UÂ]ªhNoGr\ËU‘Äœc ´¥¶‰û–µªËºãŒË.¼xï¡ßgÚ1è^FÄtÅkÇ@zÛcŠЏ.í"æq$Ç•n€ Ê•É/íV[$,&©º Úœ´ôe žÚ ¹%}´AZeÈŸ\J«FD:µ˜³ðà' -e¤¤MíšØcÖODj·á‹´+¥äBÄV‹çªFm•†&Щ"6C¢Û÷‹$¹h3~<(òNܳɜ¶n‘â^Õ„8ü}î‰ú®ÉðăÄJ¨_ä·ªBSõÐV „Ž%ÑŠé*°Ÿ{sVs#T{$ð9Üm¨]hIpF½Tšgnÿ9;ÌÛ`¿dœå¥ƒ?²nQ†±'}ÕPáŸ'E.è Û È3E<ËóÑ·ÉllI;)éÖã,¼Ñ;Ð9f«šsޤ+zp¤§tÃUVñŸÉ¨W†–¢n)E€áä˜AÏI¤É\1Ðï)–Dqà àè†:(X±ÎûRÊ º\ªÄû‘§¸Ô©2b§OZ´0"Ä€o½1ÐçFŽ“ ë”ÇòˆV"$¡=•4ks©œç«šX—¬Tƒln«¯u˯åÕŽb@R+æ4ýÀÇõå—ÔA·¬çwr}$÷S’õø±lN“#¿×êµÄ3 ›læyUÝÉåuÓÈŒý¼hnmLH\Í9ÃUùÆÕõÐ赸èEcòuïuärÄ=ÝU䦊%é=W±‚Tž<ØdQú!E«K¿’ ¦×¾Î½ªÃ4ïæÔsÌï”æÈŸEc0W"I…ÕŽN”<Ö5«v§V) ©7q§"ðPÆŸØ‚Û6à¡`*nìNmpÔ¯vzaCè´”µò¦´¤=«û”Çi˜6Þ¬Qj6+«Q¹rjOûö3èC%´,04÷0¬1d~¤ÍÏc…ÍW  íÁ‚9Š!oM°Ýàr9›¥ò¯-põ4S“TóȆ‘l¦à»ä+¤´³Ë,?ïäp‚mN{,4'0{Bi¢ßKYÊUÄ4ŠªÊà:¢Ø!‡åªýø44{"À9ÉÔꥤˈ{§8§sœÅ§“!ð4ƒÂJžk•Ar[¬Lå<#郗P˜¯czcWA\ײÉ`¡~³I`à€Ùæ>>¬›°¯‹~±‰€¿[×âi_ÜUªQ:á¹øž_Tà=wjaÂMv•šõ©ªïe2*Wa¦%xOC)ׂ^·´Ÿ’p;KÛP©"_ó7\Al÷»ÊŽ‚Ê›‹3/rï.Ž"ö›Á¤Š½IÁ‰øÍ†•3ÈÕM#ø±³ÄÏHµôÉ­qà(š?¹Ÿ–>–æ94>¦@3DÒÿÙ-KýOj)2¼áò-ªU]òoï6666åMiiÛÀÒ©Pþ:÷úew]g3—ü|òáÏLÜÌsK—œ¡«Ê¥–1x³µDgÞwÊÐe#+[n‰Ž_ÜŒ¹ ·x&§„éûã‘#~qûÔ€²ÅÂåaý ªÕ›0óð›ÑÙ“6%à‡˜ìà=‚+iüþ¶jÍ Ë§–?u¢T‘±ˆw/+¥§äisRέ`ÕÓ—P¬oïã£<Õ†!çÀٯܺ|ã½ò¨V)¿éÃÑ¿^‘RôÀ¶Ù_=éÔz&Z€ ‹'èw-~NTGn‘ö4ý&öÑØ~ÓÏÚL§o¯é7úÂ%kü×ñUõwéHí­ÕZµ/IÃ%¤.£„€T­=ͬ¶Ê@i´µ¥—Å¥–­¶¼EÛÔ™Š€Òy/NµÕŽÁkÚ8«å].R3)mCn³ªZªmËgL»Á¦™SŠVÇpÁ±§m%ìêN6»îr¼ÏA‹ØN¿>S¼–pM©t7?ÏpFÓ]&®]K…I»Å)Ź!ŒHô2E¥ïÎþª%ôendstream endobj 771 0 obj 5082 endobj 775 0 obj <> stream xœÍ[YoÇ~'ô#ø¸#xGÓ×Lσ 8¶ã$P.™ØA@qEQ‘xX4eëß§®®îžƒÜ¥Ä0¼âÎôYõuÕWU½?w­9îð?ù÷ìòèÙ ãúã×·GÝñ룎 ½>–Î.w‚M¼GíØæøäüˆ;›ãÁ÷Ñ·ÆŸ\}·›°±Mø×ÉŸ°KtU—Á´0Ow|²ƒ–_4[¿ùCcÚqŒ~Ü|ÞØÍßš­Ýœàó¯šmzñ¢Ù:Ûµñ›ƒ·ðÆÚ^ÿ˜›…c@Ÿ¿ià³8‚›ÎZtÄ7mzêò¦¥Nnóuc±MìeœFýknýmƒÏ‚5´~ùSîm¿ù Œö5ŽáÝ€cà·2ÆI~øGÜ ö¦=}ÓlôËÂuf,…»5„Òo]×fYÈo`ÞÍ~üÝ ŠÍmÎñûyè6·ð3šÍ¿ñë~\ãÇ%~ÜàÇ©¾ø±nü?Þk;éáX*ÈëLê:”;ž£”Xž¯õáùá™>¼Ô‡¸e ãÆ¶Æµ¡ï,ïðû ÎYo‰{ßÖ/ÞáÇ+XP7‚VÃæ©®ÿ<íS—"{úv2´ü7úú*¯´éÒ¢I&üð¦ê$?‘Å(>Ë‚zh¦§å烞.=¼Ë³¶¿oÒŸrZƒ¯å|ëHÞε֑å'Í'ö4ŽJ‘Óýfì@Ú`O¶ÀGX ŸGX¢Û\4Ûcñ€n|ÕØ,µÀq^ÃÙ×±àaà×8Vp$˜khØržDZ M£õyl{‡/oðƒgÜöx´-bÚcÿ$Ѱy‰ÍÞA³bˆÒ^OÃ͖ͽqí;ìÄ+Ðç×ùÙKí•$ÓñRÏKü`_:ƒoûh’ ßc—@X»@#îã-°A>PÄJCÌ K߈Á½¤!.TH8žY”è¿¢xÞñ£%Y§Ñox⮋d`àç<ŠI¬ÞeCÖÝzp~MCÞªuE‰lmïZß™‰e8M x…Æ—ÅÏÎ@#ø?j†¶N¨¾RË.D*ö@l ¡®€–HÁ‘ C)´öØ¿&xô·l–< ÔT s¢ÄkRž ~é9ßìöŰ³!ƒEÓæ]àò"xEÛZŸÐUˆîCƒç,ö½n§Üé”à˜}ß` v‘ÿŠ×„‚z¢½ÞcÓq FÔ±v^#÷ ÉÕHP…x’@Æe1&~]DYž§‚–ôcT±$T!™?[®;žÖ”é9)·‡t Õ¹Î+æiÁ¹Àœôؑȉ|‰ßi |èRÀ¸³›Ÿ`ciül‚k§‰G@€ÛDˆùt¦«‰ÚP\„aÝé)´d"6 ¥­)6¸8µë, –™Ø—MæBð±^[K×925.PQÎú6z5ˆoäv¤ûéVtS‚íždtžé[>ÔilvÍ6Àt4ÕP¾U¡™©KPÃR÷AŒpf\ÚHmÆäÜ…ldï’U >ZÂÊ5ß c »ÈêœkÍæ‹ö†!K75_ˆøí¬˜qÊðòy…ùqè Ý$²ÍÊUÚ ®ã´4~¥¨h/¾³+–¨”ˆôs@ýt„hºf`[Zf.60”ž:\Ç-ot8ó–8ù¯ µä`R0P ÷NÖ;±mQ^0¶/lks(Z[rعáUHlEµ™›ÁEXòÄÓ¤~ £Œ.•JIÝR‡dwBÔã•&Ué*ÏŽ_#0–·ª{õSÉŽyölÅŒ«1S‘Ù"Å5¿$hú Á…o4¬@•Rn¼/¡–ÆÇÅKZþßã¥" y§-¯ó¢¯J‘ŒïAWO—öœã¡÷KQL!ˆÒmÕˆè뼎WùᮌÆ|$ùM‡`ã~!¦Ø#Ñé­„‘8.PüÂÌú Ÿ©8%…DC§ºŠ†¢IMʼn­X4 µ›È´)ÖÎE©‡ÌqÁ°ý¸F.® ‰=,~‹]'ÞŒ+;’:ˆ£óìJê)ˆö.l5jÒRhŒ¹€K­RhÐ|ï ¯dpmz¡:,YõËÊMèHgZ;±¨e8ÅÞ²qŹojÙ_áœò·Ø¸#Ôí’“~’a¦Þ‡Ý,A²’¤7q™ŽzÃ|Zå ˆÝÉ :ñéJ0PB¨RsáqÐH¾î'RíSÙ¿«+%¼_ÏF˜B@_UÖm›úÕ½r³uàwWö6³Ï^œ>‚3þ˯D™0â Õ‚ €ÓÔpÌ3¥Ïr00 0ÐÚJö±u´’tæeÕÜk…£÷|ƒê<z®É¹ ©Ñ! –4ûg¢bj(«¯sc"m4¥e°Gü#Ù+*€~nøê¶‡ó†ÅRrÒ,×Â^{"qÉ^Û{|Ϊ‡ã”i%³5O /WXnm.N¤£sù¶H”Mì ¢Y²‘rü´BQ¤ßÐþRÌê÷ øx£³ŒãDs´*ÊÚ'å;»Œ>VÀ ÜSÁ0C°¨ØŒÝrR‰ F[²¯£CîÕʲƒ ÊLó7_è;OíS¡cä2Â2v%cÿ)rÄOqµ‘¾;9ÚdkÉ3um?Ohl¼¦«=¾ä› UøâË’ƒe0¦“±ÄÈd/•"ªkŽŽ;Ø+1øŒ¢ju—_T!&NÁ„{òTz¢ûý*9ûˆ åûošT& Îõ*upE] òE‰g”#? &°tóhVPkÿËj—Íž5‡Òêy'ï«Ó5OåWYû…;TçKª]Ís+k•?FÒANú?]þùÒ’ ¼Ÿ,yŸ"CQ0(¤4òéì)W9ç[£â6w¢ŠÆÃBÉa ¬6áݧ“iàdvkUMžìùNR£Â%Y¼_´Ž„]„W¸êIÚYïB6ʹ$>aw+§þû^¡áM¾c z‰Õ*%¤¬qÅi]XÊ{‰Y¥£ü±Ê˜L«ƒå+q«Uoüco_±Š4V2oõƒ•; ^í¥$_Òu•%#>^ Á*Ò*œÄró-Ûó‡ä]„ÖõUîM¬Åë‹Ìñ=5Òó³ A“Y³t ­y”ºVi¢‚fê.ÉÔd”É'ÈÌ›òF—Y¹õ°òSBg¦|Ϋ£‚Ç¢ ñ‰PÐ1_û°†xÁa•1!—¼‘š4$æä;æy˜ÿø–ïoË.btšíÐè@È/fJò½\Pª¥Ñ÷ë\òBÃ\@•H‹Þ$¯NaäÑp漌Թ{îŽc¥½a—î­0ø8Žæ¦6?§óŽ÷¹Á™”P ¶§w[&Vé9Ý‹a°ë³ê’áÎã„còJk®£L{`R‚Ñ·Þ£ˆœ3Ÿ$RVí‚hôâ-«½ïfFŽJWK°JyIÙëT€*«#%8Ê8RÒ‹Nca-è]‡:WïG]š¦jã#%‰CŽ¿ãª×š è9ªÞV×ÛçÕ$4ÐÁJ:…nªx]ÇùP]Þ “œZ68´Y#w9‘\ôÅ/!~ºýP“R¹$â9óSjª¿a|:jœÍúu©,¿èúÄ+ )ó¡NI9Œ²¼P^˜ÔìiNjk¯¢G¢5j°öKrhÐ÷ˆ$ýNl§ ?ãÆ)¿!Md…ÛÊ…½,ƒð‚ úí£}Ü]É|1ðžß–ýJy‘½ïJþšÙ Ì,<]ØdëÌ')2.”Ÿˆ’7¾?Gq¡ïwÕ½æùL×KÛ)fúŒ3\¿•¤ˆŽoÁÙ*)†Ð©¥`<À‘4¬6ãÆ'eð€{üɧ…-£ *líSêDBÁ´J½aˆíÆÍŸQ}l´iÛ¡7#þff\‹Ö®/_#ž°&8búVâ½I…¨™ž³Â·läpÉѲ ùuò+H«õ.,¦‰à๢èlö»‘JD ,‰k1¼¼®3­¡,ÿ¢e‰v9ÃÙ£äEìr¡òÑ·f¤¶Ÿ¯Y¶Ëö€_e™RJe©ëò?¥ÆN85ÁÞÐzô:…}dÆÒÌ? rŽ®B=6s`VÒF¡ë9ÿýKEBúÍšmuBÎbôz^F”ögaròŸ”¾ÁV\e®ÎKJ:D¹øbª’ž_øáV`q…CÏÉ.Šþ‚r¢È·¾L¡a+~fùÕÉÑßá¿ÿl9³¼endstream endobj 776 0 obj 4058 endobj 780 0 obj <> stream xœí\YoÇÎ3ñoÙ5²£ék¦'€ X’±-ÛLòMI´ñ°%ÚпOÝÕÕs»¤)ä!0Lrgú¨îúºê«êZý¼j³jñ¿ôûôüàÑ·Æu«³·íêìàçC¯Wé×éùêÉ16‰5C;˜Õñ«îlV½]uÑ7Æ®ŽÏþµŽ›°n6vmé÷¶C3ÄnýùÆ­¿Ý8»þz³õë¿Cƒç›­ó^†õ—ðòÓÍÖÒO6?˜f¢ 434ôǧÎäAr›cüx„|«Îßm¶]Ó¶Öþûø¯¸oô |è›6Â"Ž_€àì6[:3è–[ïCÓÅÕÖµMo†{¼ÑÖøãÝfÌ€²­_áç×é¡[¿… 1ëðãþx)o®ñÇyÝø\Ó_?¦Ûñ‹´†I| 5aý$±-IÁï^•gòð]yx!Ïå!î…¿q¥[ãšÐµ–—üý…¨×(2èo’°¡H®dõÔæJ‹âh)ë?Ã*†ž6ñcè[¾‘–—sBŸÑzáà‡¥eÙÒ—s,_ÊÃjcók’.âcZàd¢w´V%ÄÛê]zx2÷ðº<,pù~“ÿLØ ¾B¤ó#ý8×X7DÖݸY¨›Ð ¨Ä„u8T¸!„ è˜mkÄÍŒôâ'|ñ’Ÿ¡*.6¶Ãój¹ËùÆ"ä-s@t4&n_?€ºéz W ¨À“àsê…?pÁ]’Eížò7<Ù$Çk8Ù§,ñQn"ÝÆâ~!öáÙÆcßÍ€~{‚`’EÂñËeP\Ћ™É”Œ?J¯÷89.ƩäOàU¶G0êÉ9Ûk²Zhç"¶%qpoð@D§À& óÿcŠÒ[1­î…¼E´¶$±¹@#EÚ:Õ¦ô;½À˾×TÃ,@Gy­×j°!‹­³¦±¹ÚZhYØv4»ƒÈâþÆN€Ô¶É‹vŸ£±'‹_t‹¢ƒý Ð*ï7´EEc#vÉxøv|ŠÐÂ9¼ÐK&bÛ´¦Ú¬RPŒd;’Å™@øÀC¨ñ‘eµ¬Ø¬:ç6ñ ½&œ…ÉÇ{Æ)Ô¾‚ì˜x5„ZËTÈ’ê D¼àbzÐ7Š]x[ôJ åwvx&Q¼9‘Å4mµûbIÑk&‹«(›3lqˆø!ˉ¦˜š‘'U ÁкB»H +ZÍ+Q-ç|><N'kƒ 'лÁP’=íit¨Ã@nRùÖ¤©#+â’yzO‹?¼õ]? ¹?Þ{)M®*"H”¾µ;Rúóv¼DéÅþÞÒŸÿŸÒ?¥7eºÝ(=…Ä…S(q’Œp—äcýܽe£”i—æ;ár œ¾&ªg<$Û Ù³€3wɋۓ›ì5'O ­9yŰ”SD¢J߇zBÞ±y½0Se:™•¡ÄV¦]uf´­…sñæºyëyÉFoÚñ"/,d6ƒöÇÁsŒ>Ù|oÕLØöpÞ£ý¦°HïA?]Ó{açÌLFò(ÜüßðÛ7x4¼Ûûå9~*=ÁËi¨@%Ù=Àºc,¥"¨€ävîãñνž‹‹T5Ûò–§¾>š°Î­Oo·JÜ'Á^\ödqÐ3Õ_v€'ÉUÂp¾äI¤åõ¤?vBþ¢2þõ–˜Pu ünÑ%³ùø’ Hé-"sn.é,æ$±j/rôtLjq‰©´x%Råñ§þ(¹¼]}˜š8» {F’%å|c$IZ‡“ÝFÙøS*æÔ7*±eÚžŸtn>Å™wöm9¸œúÝ–oØrð˜|`ÛÄvœ[­HNŠ"­¤Öµ7è†Q¨Óq¤§Ã¾› »ž”=ÎaÈë˜päÒоủ§ð Ã^ðr¡¿%a‘Ìaaˆ³ŒÂBN§Ê)ºØÖq¶ 8ÉÇÅ}&ÂSXwŠs8v²YÁ–ÂÅçî.2ŠÒò&nn–*)xßjS";|‰cÔ‘ ÃóÔ9†u•«¡Û_ðG9}¥!êAe£{éÅkšY¬àK´eûÄpi% ÖÑã È+Èæ‹)¾¦Ž±0Ým£üø[¦Ð*¤Uœºd§7x”ûd¨²Rùþl –´Mbœ º¾ª£›4Û¯Ð÷4Û*p¥*{6“òSéiáhãœÒ_S3l¼å- Ï÷‰ÙIìaSÌ4ØQÀ’9U¬\®Ž3(7skÕ_ÈšQâ‚6‹KFßí¨hã™Iº»¬ðÅ×W0 ˜;;*Zo˜8*Œ$ø^ò’UПփ ò™ðèö)m9˜+OJœË¼%£”QFrZ:éÂ1»0…¯ÊA¤ ¹ægbir½ ãR]LƒËT9P ç W¯üº hº’k•šÈ(úKºÓ†³M÷ÏóÅÝûôøà›ƒŸW@7;*åƒíŽ+p}ãÊFð¸mÄâÀ'G޾\½ûåúåÁ£®ÌÁ£/ðÇ“çOá×ѳÕ>=Z}³\68"®©lÐõÙ3̃¿¨tðK±4O“°iËÒàýÖ·`¼*a?™1çÏÊQúm½ªˆÉ‘ËÊØÈ‘ôÄNsIIÕ#BJçªtXáqhÃ䉯ˆŽ¾/•é$µt“1eƒ#õ­\žˆõ¢8°S5©fÀ†>ù uaÔåãJ¦Ü¿Ù+- ]Ü©JjØÞí z0¾è›`§‡=Ôt8NsWÐã }÷!¤ÅHÔWÒ~%;üIJ—>cíÞP¨‡èy‘+ÊA{ x(g\PÍ™cxa¦'Æ((as7¼Ûž§É V1Á.Ó]çGG¤‚~lkØG#5G³Ð†ŒÅ.„˜˜ è|¥[Ø †Â;âÜÑZüÝ;4ò†Ü[ y8!–ïÜè6O@pqÁÂö¶’VWZQiú¨|°çkŽ›`MáŠW™çryœÔŒ±mŸ‰BðLIŽ}&l¯ª yƒcøû\Ã!h÷;@Ê·q(®ÍøM$û4-÷Þ™’ìKçÃùrÁxkÀhýävDóü÷›Øs‡Å,4¸îˆ$’2p¾øÀ½óЧ›*|ñ¡óЧ›òпSÍÏÎyè‡K/ÅUÓIæ³Õ;dÈiÅþwÌߘv5Ê ©H\Ý»Ž’Ñ<'£{Uü)ÅVÕ~Þ9Û=7í=’ÜÀ)ê#vKroÈý…X¢¶‹’À¦,Ó«l)¤”ÞoN¥ú“œNê+™Þýÿ”o,ÜÇÆ¾á»Í}’Ns ÊØÖ~c’ LÞñ[œén#×y3_xpå co¯à´˜UB‰ó9'Ê~M6)ûÃ:a¡å™TGäS‡4Þ½\ƒ¾k:ªäÊœNÕ)©¡—¬Àu•º­&òœ€ÒÙ<ça±(Ö-™È¹ï¸Ô2 ýÌgnTPŒëWÅj\z&Åj\AÐ)»µgÙšO5 iŸ‡5É_ 0¶ºèÅÍXMƒ"?×2áî%Ý´Rý–6ßÅ’Ü‘à:µI!¶A(?‡œ*´ê6Ôø‚F§¦ }7S â;…f³bZ·ã2)ßsr)]%ì Dª6ó]K )UòÓøÛPÓÂKÐe/°¹]G¯œ@÷ u}Ì{‹OÓ¥BžŽ\ |µp”î»Ð0Í™ùVW¢®%l¤ EßZO—Êø’)¢Ô¦hÇ0ÎXG_\…ßæA³^ÓÁ/Ût’£s¿Ùe ƒ¥ÅÃKz:¡%Ô‰‰hÆ©(®ŒÖ·Çã`ýwÉCq¤^Êóld¨—â™íP(–o-v¢·t£e{®eWfÖÜ1Ž£UJµ<å{%SV‹¨=ÿ[¡£m?äZ¯íu[˜¾ïÇU5ùF¯/%[7YTò©- æ1kìÉñ•tN¾1 <5˜)¹ˆì9¶Ù5åâà áIh‡ð É:‹Õ©çÁw׌Kg(úðÒv”¯Ÿ—ökùîå?çÌßžpÉuϹã)ŸîÛ½îh“«\"õ‘†>“ò s…÷oª«²¹øÌ³£×>DÝççX¡C÷'Ö´vßj‚…b€4)çk@)qœßœË×ÈAº5sR£¯+¨5¾é”î§1÷ù×JÒâD:—Hýí¡¥’a6úßï_c8×Zš¶|¨4NÙ°*ÑÛ¢Šæ.—£20×:Ÿ´{‚G—ø±Ÿýœíò·–ÖK*ä1ÿC¥vc)Ñ£±EÇÆ‡ú–]}ÒŽ30ÞeÈ«Üݵ¼¥/Zˆ‹øæà¿‹èendstream endobj 781 0 obj 3972 endobj 785 0 obj <> stream xœ½WkoÕFíg«?Âßj#ìx_ön¥Vj ‚TÐBzQU• Ý$"¸!ïˆß9³OßÜÐTU”k{wvvæÌÙ™Ù³zèE=à/<VÕÖžPc}tQ õQuV ž®Ãã`Uo/ ¢ õnp¢^¼«übQO²­î…¬«êÏÆµ¦Ñ­ùkñ3–X5[2‰žöêÅ!I>j;ÝmóŽðL`ÞÐ.†5Ix>6—m˜|ßv#o, o|DriÁ&OñsLÊOèá$ä­#’$EK’߇èÇV– O³±PéIòÒ™WÃC^”Ç>ùïý$ýø& Ì̲‰—-°WRõÒŠ5»B$Ö„që÷)ºl*ù\W^¡RöÑ€ºk°‡i€/°ÊÄ$Žq.›áŽò˜lÒãIÂ#êŽT0†8ô1ÒZ="¦ys˸^ZëùƒÏ´Ìãínžù6Î@Á€c·3©ÌNñ€z7A&2DM~Å f%ò2Ç–ÉszŒ›uÉÖÌüy›šN°ê{SÓ|pî¦fP¸ôŒT?¥³Y8y<úZD° úAz‹húͳÄaðÇê¬b`I÷0¸‚ï‹Õl:¥ÚÓ4¶ô>ƒŸFøÏ,ÍúfÔ ë<·¼ŸL-ã¬w÷»VÞ+Á’ì´¶ŒÛë†xÄâÆéÒOß7aicXÕ(øÑо§Fƒ¯Û8:¸–OÄäëTd„Ös–·_¡ Ä#f ì’I~0bi"ŠbóDûFœ]Š-Ý?Ãþµ< |­±Šm!Øt‚#;²”6}*Í3hC“¾ws¯À\üs±¸É‰,?&³#(˜8!\·F1ÿ–aùÕš^äºù}h¦ÍJgn ¶³¨^VgµRìÆP“A¶’l= ÂÁZô:Û»ÕÖîóúòüêmµõ{-ª­§øÙ~ñˆ»ëoªÝúå¿í‚NÔHûH0š;!®©Ï}ýÝl(§ÿãpJä̸ØZ0‹÷Z"út$&Ÿ†nµ̓–[á0¤˜ ¶¡cÈ´!š €ÜEc^¬ÿ‹ z´¼$7póò6IÎe¹ÄÌJ:ÛŒ”7*N§w4$£¯4w%D¶ZßÊý‘ðù´ß> ÊLœS²êð© Ocjö“ŠXF 2ñÁÉ…åÐãá(=ç“tš7ìâ.þY"›kÙö0¦¡XÀ/¢á”ߤ¹wV沯å@Mo€—‹Üjsc›#—š-2¢l´s_,|†…ÜÂ#Q‹ù!í3¶¸a©±csØA®‘‰`·M8r·AZî™M”ÓšZ¹ÚP~Âó«XÔä‘÷éŘ²IäyØ–j1Ê áëZª…ëG=³4Y×l§ï¡ßõw¸¢T=o‘g§­rŽI}ïæL“*\QC˜ÃNÜqˆg .Ý-õZu¹×GinËK÷eêvúÉ™GKÎ:ó„£$âÿ~"ù/·™Ú'ï’ÿtQã¾bSKŸäq£çÚ×ÍüB÷÷ ”àæ—Rl¸¬8}ËUóYÎ `mèLp£êÛp;VÂÍnǸÆZŠ3±%ùq@—¶ÌßùspŽÃ b·½³oBÔ¸“RñžL?×iìM^ÍåöÓ'ú¸É÷™[´©Ò¦~aÑc•Úâàù†AøKwh‡;?h¬ULîÔwë.å‹S1ñ1hÇüx€ï£$sšÖ]&Mq+q~uºGKOÒ é1rH}xäT’̃û%ŠÒÂBËô8ÍŸäù"Ž›€âx¥ëy±( > ¡?²Íÿ¸ËƒÐÛ —³Áøz•_/2qéŠÑ­gõ—ÕßLþ'Lendstream endobj 786 0 obj 1587 endobj 790 0 obj <> stream xœ½[[sÇγâqÞ8›BËÜw&)?b*¤;Uœ”0¢¸Häÿúôez¶gw8I¹ŒÎÙKOÏ×Ý_÷Ìy³3£Ýü¯þ=}utç¡õi÷ìí‘Ù=;zsdéõ®þ9}µ»{BM¦3cJ.íN~8âÎv7¹]œüîäÕÑwû{ñM 9ïχc7:g½ß?ÌhrLÉÛýe}\ÜþÝ`ÇàJ*û§ð©x“¦ýñŸ¦ÑÁÇò>[÷¯“¿ÈôaœòdqúÇàKÞ|ytò»ïö`Ž­ …¦ÈcL%ÂÀǰÊÉø2íOa½wûç(CÊÆD Ž${9?U ~i½d¬œËþ Åt$&-Ù»4ùýý—ìþ4mNÐï„V<›«&Ť|ƒÙÑFýðõàÊ¡©Éåâ»ÅüˆŸ‹M¥ìÀ“K¹„¶œlÕr¹_*5éèì!n@J9ì/P0;Y7í¯fëÌ ƒRÈëù½è-¶ðÅ_w+XÀÏXLáÝ*£ ÆÉÌ “€¡1¼ û'øùñi˜ÎüÇÞ†±ÀÂñ+è#%G„ ª"  ".ÞÆXKOá1è'~{Ï®`dla2õä±h–y ÕŸ©gÆ’H§uìž¹+Èé3ËÆÓ—8ÍŠ/~‚Q¨ƒˆ Ç} ÏßãÔ`f"ÉkGXrœÁù/Ô§°¥ævrVö u Cå„ëú¡~‰–›uÆÊ4 „Yc<¯£‚~2”÷ÞTyÁØAo(|iÚ„±ÕûyjÚ½ÛØœ6‹¶•›_¡K™&GÃT*~”…œ·–OeãûMœ{KÙJ馄¨’¡êŽ«îŽ­cD‡*ÔÛíÚFw[œ|S ‡í+‰0ŒÏJÁ“"O?á‡ú·÷²a…¯i € Nøìåà4l.êÔÇô™§øiˆñ<( öÂÏdRøG ½ÃÍ÷,e36𸤣_ÙÀû!'\|Þ`“¥¡UŒp‚QÜ5…S¶JZ¾A9B Åƒ>Žç¨º}2| F¸¾à”°âD°I€U]ÈV 58G ]¼FtFëfñ*Ž.:%ë)ŽEÈŠFÒ¡1¡CDeá<¯Û†;†Ÿ©Û‚øs¬1íËhû°Ÿ85 ºb ! œ8f³¸L]sÓæ)p¼ næ ïÊÓÚLí…` =—ÉbÞ³J!èZ² ²­ ™_Osÿ½>£÷ÜGû»Ä÷²± Z–SŽÏ|0÷ì »`ÑÜãuÃxZÐ'ƒÌÜwKK¬OÏç!Du¤$Gxa}oy?MÁM@¬cíM/ÛCAÎiâq7IšÈC 2BÅ5Ô<%ÔÑv6äÄ\ê€ /#+‘}3xïe£Wsl‡ÿjZ](Ÿwtɽ#èÒXµi[Í`D’ì§ÁWë%o†¼I¼ú"Nã,Ï`îs‚T±e@Œ!༠vG€ØpˆÛ‡42i¥¸f“/‡ygœ=·_ÌŒ7D칬ó˜!1¿E2ûh£³h'»ý‚™BZ½Mñéиÿ™(©q3êÂÂûÝeÆF8N⣇VZèþlá +ø42q¦z7sÄ»u‘ÚG޼³ƒX~^ŸeºüÒF?^ƾ°öC5žŽƒÊn€õ%pÈ—ݶ— 0ñ80è0Fk}Ù[P,v0bH<ŽÑAúƒ)„ü*fȲGH €µ?"=êÆÏi0Lë%›Ù*ÐGûým޳ ØÅ<ùõǧÐkJ‚ë[œ¸tòdÃ>åÑCFô‡ ¢>® Ø®(S6òM&@ŽX%Áù_ϯ7‡Wê;‘ÔåíB]˜˜°Ê 3c†œ6®»)VE‚¦ è¶`‚´ Â÷ÒSÐMkŠÊ) Ir¢œ)ˆBBÊú#æ´>¢ÕB&0¼Ð§Oë"bÐ9$|ïM²;l§RèÑÐvªùƒ*™du0ÇÁúF!ñ«g×ó³¤$äEt.Tè:Æó}xû›Q¢à ŽX&Ùœ„²àT®²Îs¨jn‡¯©F}†’qŽ3óßP-Jž+;ºT޽·¦àqÜ´4:õU¦èhlž,zÁ i8HuBY_Sî"†¿EåòÙÇh奿8J°D„‰q;‰8,Æœ bàÁL}Ú0àX¯¦ƒ†ä]=ÂÄÙ…ý¬ªŒ6Û}qrôÍÑ›ÄãD5rk ÄL]ôè{°*t÷ÁÑݽûñêéÑowöèΟñŸ»»üi÷›£/ì¾9\/Zà¶Ö‹¬ÆpÐ3U.8CR윔rXÔ`±öòT²Uá}ñ1(™àÚ Õ–È‹â”· u×­1¦\oaO@–Œ’’-&W­¾ p\)ÅÄŠ[1“23óZˆy³ZL.Š¥)Ÿ4fòž'fˆiR®¥Zåm^MyðçgìE‘y¼b›3è+Åè*MwÛ$I‹Tƒt Œ˜ÇeÁ½nÞbñ“Þ‚g›i‘Zñì÷WÁôÜ»Eá 9ÏV/¨Î CÊ1ÄJ‚ùNôpi¢ïøºm}#„bï·á‹åôLž =“ÿ£X~å÷kZrA‚v~HaU‚z‡Ù»9D‹CæÊT_ÓÒõ3™µ Œ)âÁ½Í ™„¢Ä«wý¾Ìy0ˆAâª*R›¾ÆVi‰yÿ[ZtåzaŠäbUö>³ÕÈ€›’¤(KÏZ—CÙRÇz.öô’#©½„~è›^à\]D­g½Ë¦"Hs¦õ5e_P‡ƒÙÜhŒTÖvr\…²CùÕï!LÒæ%òg‡휎ò@¨wå°ná´œ+A¥+öE·Ìãu¬k‚çn›x©E·ìJŠa*TR¬ö+màP'UZr¦ØãlØHvÄNVUÈwëêzÒª1gLdAUÇ^´[·¤eÇRBuR"¹|Um˜Yˆ®/)‚Õ¶·+Èhë£ä0-™O݆k«µÏUGÚµj¤˜ï”Túõ‚)†œÅ€ŸHé"…DЃ*¨ðrƒC8È:‚ŒlÀzŠVÿ3Ö<æ:0Õ­‰v,°µòÄâ¥Á­º}eƒqí^ŸÛ4¶¾úXš]嬑žvV\ûêÓ.$Š(‡Z¡üÐJ'p€ܤÔYñ“{èiï7a;ïK_ÖtÇ‘I•GEðÞ¿Âc/Õÿæ†¥éÆ¾ º7Â$äœ ‰;áØ9~¦1:]H}é\fä•>"Ê‘™Àªo£Ê™¸ dx»Æ9R.¯{è'&ßï5>Ô`••JɪÆUZfœ*Nˆ\­yÅ…¡æ6Îĵ@þù9{ TþCÌo¿ÀMÆzÕŸ_éì· }z§vüd.Ó~1?ý~ BÝ$£³hvϘç©·)×ëy)fh¼_ ðxÐu¦U:—[9ÒŽÄ©Jöë¢Ç½c¤iYiÊQtYyr”Á½ÐÝèa"‘K9>Áå«dx«øØ‡×@6㚪…ˆÙ)]u8z9ÔˆÊ÷õçևȧi°™¿çÀYkÉ*ë>­Ãì‚Ö^ Cjæv}èUØû¢©ÿTtÅSÙЇ†QÓÐ6Ê#»S†ã©ƒ±3NZ°Ù"_Õ+‡@êÕ'$r,ÒÈFX)‘ï;.i»áäˆ=}2ìe¾Š» ñÝ’:²…k‰Ëÿª–æühAÅÛ™Ìf¿0©ßôI Ó¹TÍ`Ss¹è¬ºU3³Í6›A:iðm«±¿ ÜnßÈÝÄzsy²èD{¡&ÕX2¤ºðþæØÍ©jw0!·þ€æ:HYÙ¦Ëf•-ëDÙe/*¿Þ[¹Z ÀZ–úŒý”Êòí:cåÊsÉåÎ¥ЬœÚ|3C.yÎÜç}½7kƤ }MG1“OºFGsªãè÷¿àŠä‚b½X:oØÂ ™ù¡Ì ô7/6â`3ðë­XÔÁ&ý• ­ç©NæJˆ¨È½¸2F7RsRô¥¦KŽ/qŠy.ÙÞX9¡éËÖOTÚ5õ›‹j­ô BsnëÞ__¡ǹ¶©.CýòD’ÁÐæŸŒ|ÄFö·£#eëö;O8(«wt­)t˜gKa¡ ´L¶éÔø›£ÿ“ÊTmendstream endobj 791 0 obj 4140 endobj 795 0 obj <> stream xœí\YoÇÎ3ã±oÚ¼£éc.1àVàø)ˆ+J¢S%’–­_Ÿ:ºº«{f–KTò`¦vgú¬®úêì}½jj³jð¿ðïÑ˃ŒëVÇÍêøàõ¡×«ðÏÑËÕ§‡ØÄxTÍhV‡Ï¸³YõvÕ ¾6vuøòàÇõXµë®jÿsøì2¸¬‹3µé ×áShùYµñë¯*SãàÇõ'•]WmìúŸQmäÅ£jã cÓô4x o¬áåú‡jÓqÕœ†}ˆqįñÃÃôößÕ¦ÅÖvý9 Û¸zZîòee±ÍÐqgZM z }¬«Ór£o*j£Œ¬‡Æ}„Í›Æv0¢1иq°dzÀ7ã;l蜅q4w8ºppyÿÖÒ4­5´Œð0ÎHÓÀÒZè×÷–Iį́I½1f¬ûn{¬{3ŽLò˜w}†.¡»A"ºõsü~ºõîf4ëŸñë+üsŽžÅÎôâ¥<ãÆô5 uÞú¾ƒ÷ãúÌK‘ù¸|š¿ÒÉÃg3q·>ãž6@Þ¶k,oî§u¾„ËØûb~mm3ÒQÞÇï÷c›óØèñÿ|;{ZþQ|ý*­ôLÏ%…ÆC¯:½Hï·ñáYŒ§uL¨sžÎQçlnÌ—ñÓ³ôšö1àc5æÙtÉ£SýÕ>Ÿ. *ûüu®ÓIÖ_mTžªá =Èó ÏÚ9X®ÌPÌqž­Z:½É–¥x†ÎÌ3í8ðx‘)Þåìü³ ®ç~ÆòŠ83#Dn‚$iRTx7GÅŸ5Ûµ¶™§õ©n5=ô‹9ž™îCyˆÄ‰rôõÁáýéYðicOi=Ðx`2° ÝÏéɤ{‰±"—Ö®˜#IÆOUú¸N –X*<„Åùέ“èœO™st·>‹Àgs-ß^Kú©¸ªFNi¯•G%$³¬¿<ÅW,E¶«»(E©®EI ¨ìÖgzÄu] *õˆ‹bc+Z6¨$ä#­áÛ`óÖ×ÂÂy§=mùc nGÍÞâ3 ÊÓ劸u¨¬»õØðÔ Ó¦ñ/’ž>×À¨z¬¥o4ü12² Ô¦g­o=°Vˆ•g9Þ 57HÝȼ=[0]®¹¼þ*Ãc·Á­¯†9Ö1Ó´h?ð>_D­N+¼Àãñ[èNçèµ…Ã^¥—Ub@Þ1ï÷diÓ£&èDR3ü†tÅQáø^x8›«Ø;·z¦WlêY4ÖÃPh䵈á°Ù‡ß¼^ÁIvd=‚m3¬ŒúuêíF‹ÿ‚=úéÃÿ¹º|sõìàÁ¿VæàÁWøçÓï>ƒ~¾úËÁWßßÔR5¦¯ó 0+«GÕ,úåµú®¯ýûXkÛÔ6[«â{|ãÛ#$$ˆM¶%k›D¢ Êá"ì;6{"¿à–g¸qú¹L‡`»èÔ€kC?g4ÅSÕö¨Œ“>) Ë†.<$Éon´¦~Ä(²»\“Šê;=OEïˆe…ÖD7Ò,Ï9àÄŠrý8Ѹ®oóý5ÜF £Óy~†{âDãe«G°ŒÐØ :€FzTóðÄ:ëÖÃNVÜ-šÜ-FËcþskþLzÙŽ‚¯CÆ5i„Òrý@'®X'˜|=Y=®gýIš)ÙŽt¾JÏü8ÅhÛ pœ'Y\ *· œQ¨Ú%ã/ðOØ'ò÷iv‹^†ÁR»°kc<­P·Út#BäUì5jpp½ÍÁAc’½ô±ç$¬Sæ•ß󀊹àDó!±o®c}S€86ÅþÂ/£Uñ†©†÷ÁD‹vh‚e1mÙ ŸBЂA‘Bž¹ïeŽ®˜W¹–£§S¶<‰/Z­oޫ䠨@ Î ÎF‰Ó|kc¼¬\ÃG…-Ú–Žw›Ç)¢}ÍŠ›ÅIºF[?”sZbDÄAêÙ2¿Ñ»[`[\V“Ù€ÑωÀDdGϬÍL/í®e)UVÍÛàø#ç&’ƹ*,o …gÇÁéK³)¹ˆ/¬Žæ¬*¶jLiÒ—Ï›6S4v?±Í^ªdÑ›'lo¨cT8âSh„ëÀdÏÐ&HnõÙÆñ00þRq†¹1à[7]܃–WÈ"ɺkmÜ’]"Jdú(°KŠCÇó·Œ6‹NÝTÍcbÛàÞfðå<s ;P¾‰ÌH¯"0:ŒûC;ŠÜgƒ ùTÔ;é{¶³ƒÀ:(°ø»6Ù‘½%M;åSvÅùö€)8ϳýŒ×n|±ìhc¬‹“ -¶Žç?“ ÈáBÍ)²®·‰d ¼ŽÖC¿ÅÊÜÒÀB16srDY¬WN ;“7Ô‹›J*6¼ë)IÌg0^@ÙVÑ‚K†Ž„Ÿ…²xP³'ʸ¡Ël™‘]š[DrЭl¼Kèç?È¢ ó*,"Ž£IEÄa6€“¥äбCN¨~ ª ‰XÌ_JíLh§H:æÓªŒ6¼‘)›^°ÒgP™ü& ¿Úezà€ÿ‹…õœ Wø9+™w™k± ƒÔ\‰Å!ž\fDÇ»pb91Úé[2Ê"Ëô¬{þ-EÄ/˜B˞ ‚bI|õ É­¸ ƒYO‚›¸É]æ`àÈ7³ 7r¢"9YÊÁ’l_„M<öž©EÏ”U#öa“§\·à˜QáVò›°¸™¶KhOSã8óL'œÜúY­ưŽ!;ÓLÍêµUf¸HÇÎgKB5쀟"ª¾Ád<â׎é4¨B4†L½|Sz³¢¿®×V=Mt‹ÃräÚ……yÔnžÄ`­¨*À.UÁöe̹ˆ¥(võ‘rôæÛŠ=ã}V‰²¥° Ó¿¯ºšØÌ!BûÊH¬­™cq]·q1œ¸%4™XÈ”²é›xlA ˆÉr#ß™JæÌõî±ã*»¤&£ ýÓòòY®ƒÄ:/Ü7WL‘”kr¨š‘P"l+7˜YPnØž™eÄj²ð$(vÅ-Ý(ë*aêºZ(DùlË’—[”NbiSYu¿¦£¼¬,/TTî'—RZ*¥/¶ŒòDú]Fy}Yל鲮¼NpZŒ•æÅ Àc°AÑ¡­û®™%–þYøgi`’’=KÝ~¥X%OŠFÈE6 ó,Ö¸Ît¨ZíˆÎýÖ`‚ ñ8–¡QÀ†—×: +®ï~­£ 4‰kã 1ÿÈ5ÔD,|%=ÁY®ÒÀþþ=ìʃuæl¶«£Ü¡zv]fcy½±ïåh|ï"Ê£IædÚ¸‡€t4êÒ‹*ˆ)ݼ¶UZÜ’ Â@ßâ1å‰Ü¬ 5g’‘“«×ùd1(cl y¦‚Æß1.0hŸÁs¬ÀJhKgµË_–¡&çï)WÖ h°M…OØþ|¦î`[ɧ¬N„œ=“—–~H•2µdcœ=l!æ|TáË`õwºF ‹QÈv>WˆÕ83q/tXᬚ© \žÄB8Ó\Š¢JFâ>"„ú¢°ôÜ|Ë×%ZYÐÅT(*[Ų L|D éG)7QavÒð}Ê6ÒØN>3Lb8J¹b´_ü6Iœú)ËÊÅ2‚X¦‰« 2©!ŠtrܲŸT ·-ðMª‚˜1SxÕÜ_I’lçïš,…`ž®.BïËËÆ2Iÿ>–í‡Úf«.5¾èrÛ=îp”•lx-ƒO4"ºàÄÏçgg÷­0?U†`bî÷2ÈIòt%MSE©6cŒ‚ Kõžî6}ì^£ªD~«X6+Žthµýy7b?«{—œ£†ZËŽ¬E|{9éÙĹžŸ‹*ˆÐobÂÛ¨u)‡­%§-½çãzjê¬`¶8—_šQºqBIuëtZkgÂñǎžWQ×â5‹¸9Üåõ<É牧#{ÅS»ÞĶf¤«3w¾^k-Ùqj½¥Ñ@”έÔÖ4›pHÆ•½#žq”H>ág’´‰Äa”sÈËk%ò¹†ÜTy—:¥â«G.ädÿ\Ñ ¢¤±¦"e¸ýÁIJ$Ê÷ã¯{%“z!Âé±4#4Ä™b9K÷Äcˆ²¼Î9ØÑ̰Sa•tSü|.‚C1wáÌ7š&MQÏ<䨢Mrõ:mö¤š‰SªÎlËSMs˜’^—R¤Î£µ»ÿqºÉ¿G\jº¥4þvîáÕ$–µ_,Ê×ÎL8ÚÿÁ{ª¶ålùcyOÕ¶ý44eƒU\â£íÝÄX˜hnKNVO˜Ùûå}T)!Ð^í3Æëò:—í›dI}+ü°µ“ŸP!+<‰Ž ’w]ëát´I6Ë)o{þ†®sbDõ`šâ•Jú$×/ljX–mfñ©õXŒ/ðy뉳d’d˜ ½°#úö ݵÉh4°×ê‰\E¡/w¢3Ð fÌ1ƃQ?®òyÜÆc|åÈð ~©™;};Q˜üœ •Ù™‘&AVÚ[pæÈÉåÉUVÛóâúž`â¦"1"óéú+xc‰eƒÇiüá“À·9? ƒ%/aâY}¨4&/Ð̽eKÎýx«Pr—šv05й€H8{Ʋ¯IüI²úñy-¿”Kü°³\:FîÇü^U€1s˜œä®‰;4)êe¸Nüæs,ËØàeˆ»´¯j¯Àžìíòõò(1;büðÝ¿%wè„äK^ºežÅxDŽ'PVH]0°lÏ\35›Dý6^—¦KU8ª"2†Ójù±ü#|Ù¯ euYe›‡»ëe,°¸7‘…´¬_ñ禦 n}t¢Ì-®ÛVh©ãÜYhÀse¾ˆnÇ—£W¢t”Ç4°Ç“JW”ê;ó©¾®Àð 7dx-…8lüæBÙ:úµcÄì]rxÛ×®Ãy0I žEÇ™áv ã`ñFØ{X*øC&_êýºS} ÷Ü4þG¦—ÿIÔ8Ü Y*Ø"6ðR²º#ÄTÜëJ—îºxs*ê»Çª@Xœoù.Ú¥ó©K‡‹š00p ÜÂ¥µõà@Ìß[¹Oz&(<ÍYH €þ»\åÔAyÅs!ÿóŸ=~ mRøsÇ?…v›%]V3¾óéÜ,-^ûðœÓû˜x§[=Œû”{L9-«û¸‹ f¶ã_t‘iÚý<ìï* Øv½±‚oî²[fïI«Ÿ«ÛÜb)âñ*‹*n£ÇãÂÏO=Ž®Î#UµÿuP×ñºÂ¤$W… K7Yj*ç@Ê:*™>t«.y‘ÁqP*óÁãÏ÷4ê^ff4Kù¥JÄˬ?ªRäûûƒÿØwâ´endstream endobj 796 0 obj 4889 endobj 800 0 obj <> stream xœí\YoÇÎ3a8aß¼+hGÓÇL÷H¬À·•äÁ6ŠE!I‰”eýût]ÝÕs,IÉ¢Äjfzº««ª¿:g_¬ÚƬZøÿ=x¾wï;ãúÕÓ‹½võtïÅžÁÇ+þsð|õÉ#]ºÕ í`VŽöèe³ vÕGß»zô|ï‡õ°éÖÍÆ® þ݆84Cì×6nýp³µëG›­_¿Ù:×7m˃/6[Ó CôÃú><† ·þxãºõ§ðþßý2(Í3˜4Lg»õwz)®¿†±ÿØÈP\ù*Q6ÃÚŸývèÞ¡ïBÓÆ´ÉG‡¼±°éh¤ ½¹õ¦oÒ­­k›`†Þø³ŒÍ ÿ„A<ñeâÀq"dý„¸ìú®O±OpkÈŠ4.k¼[¿I;XŸ§'»übôã:ͦÞö뿤¿÷íðßÝ4°kÓ$Ýú(ýØg`^úÇ9¼6î†Dœª:[†î~‡—€ÕóÀƒtñãF®înì<#…7[ÿÎl| ×û‰ª ¾ð2vëg‰âSxx^´è\_˜€äÏÉàT&|ž&%Š=nó–ö£—gNªMmH¬Þ§G¡ž€é‡!¼O-À[çµóÇB¼à.]?T VŒ¾‹á Ø…­g>ƒÕhH«`´”ép¿ a°?\ékÿ!Ì‹Áù‰©©Î7 g˼pþe‚‹ô°3§9_Ò‹Óðº…*ñ$1DáŒÁ®ŸâYYÐgÝo¥5Ÿ§•?Û ¦[1Ó‹{òx œú@^‡ ÙEJáÃ)°“fUOqçøÈÆ¢`á‚ô„E¨fé¯wdllÍo¦²»´sOI÷@&v“_¼Mì"¢Nõ=$÷Œp9‡Àq<ð¬NÙîÿŽï‹þòéav@ Ž/ÀaUÏ2Âà™jOÈRjMxžS7ö}®>Bùõ†8±µ~µµ¶qÙÉøÜ~Aš^ìô+¡芖‘.ÃH‡èQ†]Öra /¢M£’ÅNoÑÌ B| Nˆ²¶ýC‹x<÷z{>D:Ò8¯­ô¶K’”9±G„;#Ž›Ú¦Ø^Ë&Ʊ¦ Åy ‹”l‡m¢·¢_ðAÐ}D#¶O”“"½*F€OF‚áÊd€u¶SsA»£nç¥Ä¶^.oV‘u†cyÔ)ÙÁÖ¸¦ë†X6‚²`yÉ%x÷]hÑ¥®ô-ØrÀA¯ÆêÒÆQ¯Á5†oÊÛ ŠÃRòÄUá6\FW(íéIIn =Á#󾔇GŠš-H‹âP:»É_ ØlÓaé[S3‰ôÊÖâêAëÃD^yðy~ Ü”¢<ìèÎéR¢Î ì°,’fÌ*“¢B™‹K‹â¾Ê7kU’M¢*õ­¥½Vn^둈YWÖƒRyK¡ FmÇZñÒô.»zûlbà¿‘I$nNw–§2iy‹ª§±ÕaOƒÈ•Ök%¯ÏFŠÃ&º±Õ$8é‡y‹t¬BE6@hß(®P—¬¿¢ìoŠR)c\\å–lÂq¥G@ÿ!?lû%é#käŠ.•Ñ ÁpŒrkËðC˜ØGÊ¡¿G¥4.f–*óÁJEÇF¶l,bê4dl%Ëw–e¥N¾%8«|„{;¬‚7'YîLYñ…£^€kñJÉ [y 는Ó~yUgP0Ù »ÿhïÛ½+çPSÚUây\¹®óÉ»^ù>É(FH}òpïÞÃ/W—/_=Ù»÷¯•Ù»÷9üß'ß|šþ<ülõ§½ûWß.§‡Fn§‡\X&63D…à‡…à/€`•™ù*'o@^_æWî Èú(âeÓº¬^ ÙèïMÕ«R\ߎyu¬—˜=2MÝ€ªØ>yð‚wQÍ—]·4ºëGVv r^%+ÈFVhÆã*5å—œwµ-áˆ:»±ùPE0yž’lS#é(¤ž8‰#§öTë'0ÆtÍ ðµ½M>€ÐÙä$ˆ# Áiz •Ò”,b¥C_ÃJŽY†®YÛt<«]¯"ÚúÀV¦fîmaŠCÌPê¦o¼Ç¼_OË<fƒuTïÌLOÀ £¬h¿?Ãå9Ég‹èEO‘kôôY=ÑàWyªŸùR6ó2N"ñìdÝK”ØV‰ù¨¼P¦_šEÙ÷ypØ¥Á7E [0†[DHÚJDC à;ð¤ðád£X´5dÁó¼û»iCD#ý7ÚÀA~é¸ÐZ¯fÉY¼³{«'ÚÊ–ÝÉ*ð«èyñ°é<É—×# ,ˆYùvrørNÔ/ß‚í?ž[ù´Ü¼Ðê6ø¦A1úÆgá R„)®¦cFâµ6+fÒÉÒú¤RixŽ’/ª‘¢û“»JQ™@ ™‰J‘ú¼ÂäΙœù=°øúçøtNnUbßw=Ào׎LõìB×^}‚æÙ#ùÍÿ@ó?Ðüÿͯ!ñ)š+•<¯˜#/ý:ðÑØ'elMW­]¸h­^³'c÷e a—±ñ)¦·¹jÐùº¢ŸØ ŧº¤ßoÜ|‘!…@3ä› ÂµU©ØÔuCKð}ôi?Ô5}U’ÍMÕ½ªÆáC "¯JŸº²!vQ¤›Vû<‡åŸå8 ÊŠ½I‹ôã åÖ »RÅÍÝùnGY¹o16|½±‘æËÉ¡m':u†ýŒJ¡[ÿB"ÑÕQ=ãE eÀØu3 KISä‘GIÑMIy¢ˆìfœÔ*—œïšÄÏ‘Už˜Çéî’Jgõ‚{pþÕo1dBp+Ó†í{L™qrZ&í’A ûZ$Õ¶ih¼Rmë+Z«#EJþFÎö Ëpà°D?® –Ò7:W÷Ñ“§:ýØ×çÚ‹$9*µÆ¤å0¬M9GÚÞPš¨êÝUb¶d!õU>œ£|¸l=0Be´Øò$ˆ¥ŒBõH¨Ã¼Ù`,:©o} "#¼¯RÅép{î}@/–7÷¤s k»]*‹€Õ„ŠJï$mXðÝ»]0ÞtŸ6¥™zÙ¿Â?ÝúßÈ@)^`KØHAm>þÙá-û!=´i…ŸÒßÒ|>΀1ÓBŒb-?äÄš‡´Ë d]KI£Ü{»$ß…)wÈT?VuUô$ÏQ¦ÕCƒF;ÆË·(I0Q’“åÔXË ÇQâˆoBƒaO‚ÅZ(…ä´%N{i×âúfì| Û:1º¾§º|æÑF• €Z)¯xWÄv°q ÿ1T- ¹Ÿp´^š[w‰û¼³¨kÛìsŒa¯É¹ø¶Ói†‰pÉKÚQäÀ«½äø§En$I}D—`ñÙù®ÎÍ:—ÿW ƒ¡{•iÝòjtí 8û®ËÍ%$ îÙÙ £ªïÉìDËšyDJXªÙ[(³Tøu]) ·– ‡½­ŠnÕ‰t€-0¼ÿCE6¶Ð¶¹@+ôíTuñíûƶڱCR(àRê5Gn(|[VI»”…Ñ4W¹¿¯Û$jV‘eüq=£EºO7¥]Gè¯FA7ÕB ›e.þ¢6Vöþ)ÿ€æ‹1@ ¦cw ÓøIAD;ÔÝkTÐAg P·pxîb‡^ú…’ÓM6˜ÁPõÂ8ídd((²^<؈‘!›ò= ,vS¿70„.ÑÃÃ"âQ¹(ÌpÚÏøC> E™sþPåäù5ŽŒ:´2 I­/7`’‡'mNÎM Ô»ú…Éñä6¼#E¯;¼guKºêx/ºÈ1ï\û¯´ÛUõJè éiÉâpKý×Y¶n˜ÓL"P€Ï©qFci[žã¸27°ÂãI4‡UY›ƒBì¶î}`ÜÖLLˆ²efêõhˆÒÜÁ;­u(‡À¿Q]9Ô }¿Ô×@§ŒŽ4 õ”^!%7•W,zZ‚}‰£tÓÃ÷\Ÿ­´8ùL¢„iì¤GŒ;çŠñþ-°ª'*+5!JZ‰jC1꺢Î8Ô1ÔÈîÖ_Õp5Ö“ïD±™úéåè”{+îh§û %°…Íôú‰£Ú »tQ‘Àkë v–PjÞzöä3ä„&ôr%¾Ûñç uÔx¸ÍªŸ ÂS¿(a7_7”…(Ö¯ŒÇåj cE^&;¤³moƒì*š—»’´]r)ÕÞDd»O!¡wøó´}ÿê"’ñˆüÜö÷ÙQl’rFë4Ž[Š.©<;OŸ³X1zÿôaš¾ìa4¥°»Lh×ÙÛad›š“L&¶¤Ë'r€XÜs|Óžàb{‚ºU_³> stream xœÕ\[oGvÎ3ä7ÌÛNœQ×¥»«7ÀöÚ‚xµk›‹»Š”DBIñbyóëSçVuªº†3R a‰ìºŸóÕ¹—Þ¯ú­Yõðÿ}öîèÉÆ«×wGýêõÑû#ƒÍ+þëìÝê«èâMü´ûÙ¬N^Ñ`³šìj ~kìêäÝÑß×s7¬C7ü×É¿ÃàŠ!ÎlÍGœÇžì6~ýmg¶óü¼þ²³ë¿t»>ïßtiø¡Û¸8°ï'œ|[¬cãúÇn3ÒÕ§}aÆïà‡g¹õoÝf€Þvýuœ¶wÛ9 4äig¡Oi0îP£ÿÇX·íÍ@žwØ1Î2q?8ïнïíg4&vî]܉£UâoÆÐÑ9çq±»ƒÙ]€É¥ý¯q/}?XƒÛàiE\&nmˆã¦É2©Kîl œÍ®â·“™g"ùŒ¼‰‹Ïë—_ŸÅÿ/ã„ÿÇ„ç±}¶x>ø~ f}ß¹õu‰ÍN70ÛìÃú~¿}&žòmìÓbÇÓÈ»w±‘‰ ß#+½# &:Œ @±v2®¯áw`Wù÷Üý\fD¤ð¹)ÃèxÌ¥ti¯úþgºaޤs‘þBúà$ðF¥âG7NH€;’Ž:.p ÓÐz€ø2]lÍq˜ÌÌKŽkô¹q^Ê‹¸mœ¶n¯õÐ)`'èð>‡ C¨‹ÓðÓ€¸çGDÙSBMsSR”ßeä}Ã::}srôýÑû•sÛUq¼ÛaåM„‚ «ÑFrEEåþÕ³£'Ïþ´º¿}xyôä?VæèÉ·ðÇWùcüëÙ׫:úæÙêûUû>rÞÃ2°jþ§xçXû~ÇzY4Ùó¤Ó@/ÿ)táHŒ¼ÂyT‹¯ù®_"¼²ÉÜ’t»`ëŒ ¤p&``…PŽúž…,ú*þΚ‹Õ®3s¥v·ý4O«0šü†\Á÷ K@ð[šç’?"¤ ÿ ¿‚¬ËmâÔŠ;¡ÖÛÔöLܧENSk!k6~B*¬ŸÄMØ7@Ý^ånyæûüñª1!B4þ vE)~ZÃ&Îà‹r;p[û€þZ2 ÞB!¥};7ʬÿçq$ ÏÒÀ‹¼ßrEÛ£öùBTB5R>Þ§W­9 &Íjw—­áÀø~V›¸k­wÚúø?füÔ¥ÿ­àI¼¬ƒ/àèãùCo2Cçšö¢‰Ø‡ Á"ç¤CãcÉðBí •?àߌפ°}¿ß>t`CÆqÊFLãXzÖû§ð#Ùg ©¯KæNZv©´4´ ¨`æŸ;gE— ºŸ²[°ooð×Wðk¿”ÿ²S½{7Ó#ü¹÷°w.ÑËãiúO…&$Ê"#$"¥Þÿ$ѸŠ~4ümB (zøVv$³#ÑÏ€5j«~°Ÿ›L‘,$I>KK˜*si¬ =’Ï‘ †ÑŒ´ÛL%fö°ˆzÒâwpH“öL°¤·ÑrO}ßÀȨÕÇHj°³[eO¸JˆH´ °up¥ÏöÝÏÝ´Çd>Ç mHPaIü,‘a‡õïØ*ÐÍög¾ÿòíw™u7 ¨2•U (&ó2 éÖ&нE“'*g®ÞŒèR](uêÀšðRàNPÎzT€óÚD|yd³Ó¾DùµÏ_•¦m¶¼" ?dŸ–Å„ÀKü>V©[˜Aƒ¯ÄWÿ÷;t²™â5‹ ÜØaËP´ T~¹Ð{°I^°º!%]k(lAu‚ÈdÅûRËtÑ6W; (<à—Üvù¸f8&ý¢¥xÚÓ–VT«g½uÓÒ÷/[jæ®Õ|žuÝÏ­öÛÖQ.[[ºbƒ bï¼PÊÊjAÞá)Xj­’‚¹/ W°±“}_¨É 7–âÉ‚‰ó„ ´ÊÞdLì°gç-”èÉüX„À¡ÒY¾;:ùâïë¾:ÍU²¥’Ù™j gnÞñ‘Òš‡m^€Û<Ó)úÿR'e3¾âã_SñV®Â)SN «Hw¼ÿÍÃvtQ—TÒrܢF7»Í×ì¡ ãñ ½ì—t·ÙÎÈÍl?mñS²€³q§Ø,QsÞ‚aFÀ›¼Êá€E·eËÁœ†ƒðÐÎ'ã_,&%"ÐÖƒF€r­n2Wó^.š}ïs_u/Ž9Z@|x¯ÂvÚ…Ê|8Îl½–{[Êî‡ß{å‘çín3‡•–:€7Œª›VÏ›Öòçr°©ôÃdùëÖÇ}—÷ÇÔ~’Û¿Î?>Ë?>—ãÛJJ+‘£®¼ò.Õe‘ÁÉãÎtËû­A&;OŽ÷§F–f ð§_4µYËÉ,~¢¸ä“_Ôû VD’ZþU# ;ÝwÃ]vÉ–é¾õ1->bÍß0l06xÚ¹l˜£Q^oO%¸°ç6©nUƒ ù&Ó Ó<°7âv”è 4ý³vëÝ–®‹#o²ˆôžf‡\GbŃÙéø/Ó7²’”¹DqõT*ïGv;ç*Qþm QœüÛìà¼$Ë6º1Cè̈¸QÙM+ÃãÙ¥‡ÛŒwÇdoSXsGذª‡14ç*b­DQG¸~j¦»RXÖJÀ ™0ubˆvŠwx²Tk(HxÉø4\…ÊÐ.s£Bk>Ê+}—H3aè%‘T‚(²Jx°FþPpRE!0pd‘\×Uþ õõÖ©0æVpI^C–l¬ÞÏ9ÌA”£¼¥…€}ò‹–¸çÔ Óá¬Áf ´Ñ÷Rð¼ Hs°¦Êì¾$Û”Ú¬°C'*µ†0ÉSH?E„DˆŒtÉ$mÉzÁ#²&³•Ô ðJŽ c’/WôëÆ"Z%¬x;0)&ç½wioûs‚ —tså›&’M1çžVûÓ¦„o‘rÙÔ®S¨2$Ô\4„À[-¡B•ºEž—‚PUN÷’Âj̬%ÎH ãy¥d>$‘úöˆ¥à u&½©b×’˜Þ‘ð–À±¾ª†su0ÏMžÙ„,yQBnðûn—+r˜‹“˃RN,Ÿ]1m )!—²Ê:ôèÐŒ³ y†&å§FÚ3=@µ¹@¦u!çáX õÛœ¹dñ2J9Š$÷®P%Šnß. (pVBì-³¬’öçrp/ÉOóÎì–Ø=Eì_Œ² áöÃ[ Y 4ŒKFhaÎÖanÑa¿D?æ"ŒJx‹°>×Oi¡Œyˆ±a ¦4NVè,GTÎQ‰È·”÷y(£Ã¤™ŸÅVT‚üEÍAgGäw ©e]ˆ]ZkqñQهʛÉ|K.Mªý˜![±¥+#âÎ`§Z.˲Qç}ªÁÒKIªD)yï\âAy¸ªivéV¦‚Õ2Ëj‡ä&{)º9Ž ûÍA˜\ÇÚL«J¶“Hx¼2*vISIŸŽ¢ í.Y3r1p4‹þ*%¸P%P]Ù‡ÎâJºô\¢%^pU]̼?O`8K¦{TÚØ¢øNm'U2ч¨é™Ò®yÏìǸyJ…yJ¢ÔyuåÖß“'C¤ƒÑ/íEÝ7$Q–о9.Ïé!¤Ú­öð·ã̯*¹XÀ”¶L± Y²eÒ[yšÉ4¬ƒêÓ¸ 9£Æµc”©ýgÔeP^=°N<©³Š…H·ÝüÊöóotP…¥7Z„A~ê:¬à ¹Ü ³ íɰÀ¥¨QQ­ˆqs˜# êÑÙJŒM63¯±“t®ÇÆç'ëÑ΀&I:pQ”rѪYEo‡tÆ.}…~ÉBô,‹`êÂXÑà3Ù7ª¸©Âä}Àielùsj!}þMí1<ê4½„959 !*È9KA‘\Æoë’-(B—=qM@Þ¡ ¡wÅ¥#F”h]5ê Ä)†›£âóe·°ÉzWÕŽ#€$ýÈ䜷ÑÔ­”J™Šú"XØT˜”Þh†-*³YW…Ç)ÈÌd+•»ü[\>hb*T¶œeõ¢Ðgó°^LijαÅ(¥h†+ZO»äyªØ»ª*kDY±°D’ϾPOquuÙ‘çÈÿ"‹v éc<Δlþœ¼l•S%¶«À¨ÇlêxPðug¤)Zɶé£PKø2ü ÅŠó°´PiJ“Ë‘Süà+…Ö—W¿s¡êK¯ wKêAÜ(Ûº“6å U*ûcƒ‡ÎÕ¨éG¥|«°çò|2ÜÙN®]!¼ÿËù2 r"¯`¨)ÉØt;’1Åâ° 3ÖÛLΡÕEr6íf&Ü·«öpS yJ0]iaQo·RlO9ˆw©z/¸$‘ò£aWY/yÐ…ƒ­Ì×Ý‘-Á„¦dÕ™¢‹+É®(Ýç‘^d:HT®úÓ³+ò&tâçâ!õ¥G‡†§ñ©\á¨ÔΖQº_¼±àÿ†Åä0ÆÜÂ3r—ÜÑ/…jì2 NóÊO“"2)gÚòsÓn²ôT¬X…ëéªLuÈ,hž!(ó¦ãç”Nž4äüqÓìq˜¨˜ÔG*2qY?&Ídl¥˜˜Ñ¢>tX;>s­ôg®¬Hˆú.q›¼̈)—xSaYà\ DÓËCªJÊ)³&oEètmÓ2FîG©ÊþxGc˜ñ}™'ûY£n´´Î¸ Ÿâh„a€÷GŸŸ9Å6[Y‡:èÒc ·éû7ô9ß¿ý7_-Ìû|l(ƒQÿ.PTEߘiPQ áÑ{ÈUðN4µXÎ,ïA²ìý˜?_¼Ýðœ)?4¬1{|a) Õ¾hÁŒ‹lÝø)‰kŸ}—ÖB¸Hïséðz»Ç,&{½.S0Éîk•Cx7¤·i qË:ŸÃJtÓ£KIC×Ï[ÎL.“Ê×ñfØgKJ=¡'Õá»êµr¾T;Þ¨ðN 9ŽÎÃÇòd<çxLT°Íg€ZF{7&×9¥ÒV©ÐI,Wå8IšOê.+°:¬—Ú2ÞWñÐÝ[Ú[i-U:iá ×°œv¿s­¾4_º`.ìXe\Q¨†3ñE)HãA´XK#2•†£ãÀLÔEç4Á£ôÝØ—D#{†0âÂáÎÏÖ*×—q¿måt41è̘Êkf0œVâCW ½ARªŒÁ‡”žà¡Jô ¥'´½¥'ŽTÏãšÂQõÄRKà"•gCÞ¹­T5Ý‘k‘¼ìÃ,ñ]/©ðRã/©Ý!µÎXæü ­TEœZENªrh•áѧÒùãÛü1¿œÈ•ºû ›Ëý§ÑÍ×gÖËÅÎ7å8|-~œ_%üð“à”cG{À¿H)_û`,eTŒ‘—0~« …Ê÷Gÿ ÑsÅendstream endobj 806 0 obj 4772 endobj 810 0 obj <> stream xœÍZÛnÇÍóƱoÙ1´£éÛôÌCÄŽ +pâKhøÁФH¼™äJQ¾>uéꮞ™¥(: AËÝ™¾wÕ©S§û—uךu‡ÿÒߣËÕóïŒë×§w«n}ºúeeèõ:ý9º\v€EÚ±ÍúàõŠ+›u´ë~ð­±ëƒËÕ›± ›¶±C·qÛqè7_4nó²ÙÚÍA³õ›¿5[çú¶ë†òâ«fkÚqü¸y¯ñ‡Ûü±qaó9Ö¡¥´-h›³aó]Õ†Í×XöûFŠRŸÔÉ_adó6¬ýûÁŸq†ÞèúÛn€I§‰ÁÿT2x]r›Šn]×F3Ž\ÃÀÔºÆ-¶mmk¥åšÑnn›mØB7e^ðÕ 8#³9i<ñƶ ›×ðf³+%¯àëæÊÜCŸç0Ékh‰ÞA%Ûq|ˆ@ç¸'§ðó"•}…eé¼ÔÕÇ/Ð(öcèÇaª…ßÿ =âïª@êš–Ä𜨥c¾£MÇ‘b'©þUc{R°4'œ·w&î©±× .¡B FšÖ,÷x†N°iOMËÐ`Bn„'‘ÖËú^VÌÒrcÁXšq¦•çåyõÂæö6R…Òà[Uoq4Ò_ž²Ù¼Å†ø) 9@Ñ­*zUŠbGeÌÛÆ¢µ=.ÂÖ]ëìz ECßY^ \N\Ê;4qúÈÛwJ±ù¿ËŠ£IôØ|¤QÉã¸dÓÒO^Yß“¹|Yû}|SùÕ†U; !ù~šÁCuÐìyy¯µA]ÃlØ^®“ÝÝ•ê€/l yöklÊ¡‰Åùðà¸mñþÍs¨ñué–À¥v`>1û¨Tð>.}’ëòªBoC‹¾Ï“Í}Uöû. UÊ”ý¿åwìC¸E½Ô«¯}¶iddax€ÊÞa4.Àwã AòSÏCB(ÅM}‰è€Ž ¤<ƒg½IƱuÑÁ¤Á¹˜æ‡•dw.˼.s•…§%;fË¢î\ÏžT;4ƒ ö ÞæSvˆ†õ&tÜ \ì¦Fm•©ÎhÔü"¨CÛgàOx&då©?=á"°Ïêu™}B×GD µ«gªpn줔I•‰h6þHøˆûAÆòŽCààdÅf0Æ(¬Q¤öÀS±CÞYßdø¯j‹Òq%t–ÊÕ°Ž k§aòâ`õíê—µsmOl9¬­q‡uo`.Àüä³—«ç/ÿ²¾¿Ý¬žÿ°6«ç_âÇgß|^þiý›Õ‹—ëo÷3—:ö s±¦‡~{©1‘—kŽ¿z‚$! ©-¯B¢g±¢šxïmâ¸÷#™Sñ«Yd͈nÇÅ5®ASVx¼³J{D°ŽQr)RAëŽ0 Ø|ÚJÕ¸ Ç)㻑…è5ôíJÛWÉëFÜî.Ç´ÔlqMl2mƒ¶cka‡k<$:+p&þ@c>&ÂH‘n‚›'Üœnµ€U …‡Éë(N&`uŽ9„Æ&]ïš} ?Ó IñÆ%Z£<‡†.–v”ð7ÅuiV}ՆÓî3ŠXØ%¿áþd_:/ûr¢á²b:i·1nЊöÙ2ê;ƒ†;ÊúIge‡«xÈ+Z£=óáEøTù€Á; L³¹\6!#MvίÒú8ÍÏÅ2Ä (®µYí¤²AØ;F?ˆÀÛPÆZ'þ?ñ¡´…¨€wÜ:«j7J“üfÐ6²“Þ§LR Ô~‹–±µ=¢âã22#`!ó÷‡2×¹ìI•ùXŠŽæ)$Pƒ»ƒF¿çä!­lÙà´Å¤mŒ”O~h(:jèdcâ)×ÀDFñ%Ôû–“Q I®Ýü d {O€€01~¡¹nJR«ÔÓ„vp#æž¶í½˜ì9Ú×CÔ6etçé¡#oàÅÿ9¿¸ª‹Ð‹3ùÉ…ï“P~`úþzIi&—RsžžiŸ—‡7åa <Å\º^¾Ÿ6ØóO |òK);÷äéáÇá-î¶´°“ùªÂyI&«9ãÁÕp]ît¶"GqEPˉkv‚% TÚQ5×Ó‘%›mךp…šŒ(FèÐÌÛ6,ÑXßÚ,ŒÒZp#pX˜e×JoW]DÂvÂ5Öìˆå¨Q:tRð–ØwP‡¡Ã°ùÊÆèÁ…îÑ…zz^¸(#QO! „²Lâ>ȈÔú¢}w2’3.a˜Côý Å1µ¬s2Pš}žÈ„pçS–• ‘è_­>ý±`~ÁQ´'?j­`_ÐþJUp›£Q4¹Æºœ“_ñoNŒúŽÜ.×+ÙT•;»À‘hÂr Å%B+ Ýœ¢:̦G[F‘G.í¤8tÁÃìX‹²ôÖÂÔc(2Y"1$+×Sð©Wû/^gbÖ” w^"wMpõÓ,0÷ŸdZçie°åàÚBÄ%È,Q—*fÍãÊqÚ–N‹’ÛóŒkú‘ç‡#¹‘Úsñ†Ÿ%½~U m'‹‡ÿ+Jˆ”v’¶T I$?m” .ðKž1¶"É0çuŠ4¡9?&“Gåfd‘Œ§‹•Üe@¼<9XB›vÙŠ„¹$%Ѱ§ìˆ‡ÉFå[Ÿó °ëkKM)9 ‹œ_)O):" >”YÌ*:ûhÆAþ9Öˆ!¥ëlhIiÈâ÷“\Z´2ï$Œ$*C¼ˆU°_ÇS&9°“HÍ0iöèâÀfF,Ö YHÓ²&!¢5’0Ï"—+­c3yƒªQ–¼^eþ›ÕQ¨rÞl½%Å:VF—]Ö–‹©-6‘IKÉEHýØ:S0þ}Vqä#íµqê;¸aïûÖwFÖ0¦¤`#c &¶§¬P!sÖ´*ÓTV=ózK6kg¨nÀ{ÂaåH¼*—³ƒÝr‚wÂCKvy°Ä»'Ê.›{@ §Ä5òUy[Ã3azA“Ƭ"ðA×?àçO·¢aâ–þ.¥­ðò÷øÕÞÎo9™ftjiUÊ:—9ËK† ˆdÁÆɾžñ3ì»ûðaˆžêxñÕßâ:Êùæ7¼É&òùå3†E’CI\,g$Tz¢ñ¶¿ô–ÑOŸŸ§Ì`.-Àgö”¤%ìàX•ô½Ñ–‡_Fd—düó(ºÚ‘øŽ¶üÂÀ½[ÆòLÒG!ŸÃUÆÃLŽßyF{Ôy-Öx´\ƒÆ(4ÇfÙNx­uÑ£Ì2Nù¨g(§i–…ȳê[¾ÝhÀð”/•ŽÅíÉ‚ìîCHVrxÈü!‰œÊ,¸3.ëž|Š.?=Ÿ‡W –eZüNxÄ=g0c"^û¤@%¡rtEìíB­™j)yžh‘êëcÐ3e-ƇXSÖ r}øØ/;ê–yöÊhâÛ`2œW‡±–m7=>} „VG WÙ¶0ßr†Xɯ{#úFÿ»á.#=5ñ¶ùìXžqá·s/Ò‹rÊ·-à ^ø[e4ùaêÛf U&ª@tW…ù>‘ªÌï¬ZŽ2yxõoÜãâ 0ÙË*L>Ÿ©4é¼Õé¸ã*õ&ÅÑÇäµ+Ñ'ç’x'O¥‰ã»q%NT2_ÎsdªBNC"Ô gä—ÚøÂæ_˜éñB ®gB¢•ØQ¯À…‹»ëœº$‘ZÕ’ {ÊÖß6–á³VBÆlJ É'åEÏgKÙn:Ùr,q='S RÌ0`­íø±GA˜$Nè3¦åctª—mLj¨)Lç34_îI5ïjqW…î4%e#Ðäcч:~ZLR†"ö›:[QRôöîw(²â4Ï8Ï<% MÂgNTÂÞ È”Æ8't’Ûé}ýàû8ÐØOóU9Š4=‰4{/«ÓT¬6¹ÇE³®u¾+ÙQ6"0@“O›!ð+‡JžHåè†ä좥=üÑXÌ˜Š¿Z´c¹f¨rÂ¥û2ùÔF1ãÔ6ºG\êÊÚÈðÅaé cßm²˜y¯/ê¨f娠øûfrAÓREÙÃRjïýï=ÝO1ÀÏÄû)ÞÇÖG`.ž.FÐ äQ'ó«ûÛoïÿƒ…83†z°µV©Tö2ƒ™ºIž×P–½-JbðT¤âËq}Ÿ/ÇeÏÒÞ"·'jå.[ibì}Êâ£ÈA23M&™`%¹ãÕçÉÍXR›äÄ$×*taÿm)¼|Öˆñò£Þ–BBÝàýSÚÞ ™‘QïêÀ·¤?þP‡1õ“Ç:á.U”Qò%(ISÎï–5$LzWân>:a1,Ý›ÄÇdm³µšçγþCð¹.®Äp¹ëóé’ðQÄòÃ¥‡»¥©Ó¦ÕqíÛÕÞd,endstream endobj 811 0 obj 3708 endobj 815 0 obj <> stream xœåioÜÆµŸÿˆý¸4¼4ç"‡Z ŽÄENGEÐ6E K²lÔ–lKŠüú¾cÞÌ’«•œÈ-P–v‡s¼y÷E½Yu­Yuø/ý>|µwÿ‰qýêä|¯[ì½Ù3ôx•~¾Z=ØÇ)ÞÀP;v£Yí?ÛãÅf5ØU}kìjÿÕÞ?צ ëŽÿÿkÿ¯¸,ºj™3­éaåþÌþ¬Ùøõ—iÇ1úqýic×ß5»ÞÇñGÍF¦;ÜÝEÜ\žÿ `éº` ‘ó‰t €`Ý0Ø„j7¬Œoï-¢z“p wl3ŽŒò°o<`ѶÀ×à5vh{$L¶ÝÐÀN×úÐ30më:¤@cbf}ˆ×Œƒëƒ|´q} »=l»>o6]ë¬éáâðÙõ±uƒ‡Û±ÞþΔýú®pàïí-¬ÁðE»>-ÓöcÔÛ§ë¯9ÍÆ6®ö¿ÚÛ¿‹\éÒœ þúÎ ;~Ñ88aœÀyÝú9²À1À02ÝŸ6¶G¦±ë_áÚ4å8qÒèàVaýÉ9Ò‡·"D88(ˆwÂÛà\Üii÷Š …ëü€Síú.{ÙX>FÜ'€æÀÚØ—19G&Ÿ—Ýóœ€ý-Šc€îò ?vó}ÞôÝÓâ#ùòW!ó¦§8~Ô  Ýz#8¯öE¡±es³&<^dŒ$ø<| Æ:Ù|ïpD8"á`âªÇD oº¡Q›DuÔ"8GyÏ«à«1ôf¢×d,º¢=vÁÝЉDUäQäQµ¹!©ž‚é"M#£·û$á8² »‡—]ŸÂ¯µe/<Ø#©üú]RAœ{L³i©;bÜ9!¯bü‘`0„iEgö,ãI­Íð⬰{ƒ¢t™5Ì%f±¦õQxÙ…ièÉl!œ{0ï ²~Ë, ž k(Ê~×^Jq™óÃF´>SÎ20ÈÄaŒ 9)n<.„™àaI '¼ãÍ}‘nÝò²ÔGš‚ˆAäVƒñx1°›b^à1Ò­Ï좀6Q >¥qüú^Z¯µNf Ù ^ƒ h¦É× >sS¢·@Æ|u5· Öv!ý´¨žÉM·Óœîë·ñOz*üÓ#fë^D Si!6N-ÁCD˜yZæ$¼²’÷¢M>úWî è"\EÐ# H®Ñ_¸”gˆ“èˆ4¯‹–ÀË0ˆe»H¦ÀB²Dz°~…¦X”ž²ÄçH¶Jõ 2"IM,Öã™=sÁOÑD!Ån‘rA„ËX£(c+§ò£rʲ‘UZÖdô#ëK¢lV$ *Vll¡<úÂFøàƒèœW¤,,cÊ:áã@pàýw*Ù"qƒ‹¨íú—&8Z%q¹°†ÎbVË6|ÂLéRµ^"¢œ5lð‰œl'³}8Ò6ˆ¿Š¦»ÿÄ™Q{S°ìÀ˜xœ/`kR xH0#a±ÁOðd‚ŸIø3~=ÁÇù)=Ǩ/Y—Èý@äŸëûp”ík=+Œ{’Ÿkn–AØÊt`1A¯ÿ´V¬™§žæÁ—e¸3t`\G¯.sYž¿Îƒ¯ËàY|[/òà9î9ªK¼(³^æÁã2x^€¸Ôç*’ ¨ëЍd3ý¾ÔZýL2uÏØLÛT®HŠP™>¥À•{AºL¡œ;LsÔœI'O)â-|‘ŒM;‹ó’©¯*=ÊÓ‰í1*­„T >z+jÛ¦‚ŠÄÀ‹Zç õ~LYð õS»ŽT ‡$p#-Ÿ`/'•˜õV¨t7=>„àAäOs™, JJ/»pâ1Ø¡.j¥õ¤ŠyÒ(¥xZÜ5y—J¢ m®—Ý*%Þ±zþ4“ä´±> %Âx}V)m çƺ‚}Yf-ºz6—æìRÈÐt‡8ËÝ¡øöÒ`ȇו)™žœÇ‰Eê¸øFR<‰!žiU3/| ‚6 Q‘­*’PuxÂNU5;“åƒö^CÐIÆq[;^¹qíÂ$Ó¶±±¸Ò¸ás©I$Ê꺩¹#uMh…6eç&JˆRé½JáwÜ1úÔ ²¨ài¨jÀ)?¶u—åB°'²úmÁ->F^MܾÒV'?e”ƒÿ2G—![„ŒK»eÅ ¾ãVnÑ]L;u| 'ͬ Æ@Özh+a­&©Ä>YÔE’³Vž_‚¬×¢g~%‘^pÿ®JpdиڜHˆÉ¼;Ñ –\•€pnKÕ4­©GÏ7Äî4‘ ž ›’+ÊÆ«GÏAE“¥R"{ÉhV¥u7˜Vm¡·Cm4±ÛÊ-0z*º|TM=æ‚6xƒã%«]Dd¤DœÑÕsU{ð•Oä2eSå^ á`Äw¯š„vÂÚð„¸¥êOXbØø:Ù¦žõVÕn–<¬ªÎ œ'Rš'å]Ú”çŸFljÚÖht‘˪L­DL®÷d#ÿŒÛDv]ž`O ìcl$÷1塤?”{'îŒß}t·ÛÁÞnÔHÑ žc$jœ]#9ÇB(tºž4¸Ì€oøwé9Š)×jíuîy-†ndjBC pØ”¾ü_¹±ÔA7iRÌ5£G0¯QbÍz1*%'´–ŠƒpÙr#‚"~Øo_߸èaØ?D§;×ГM,¤”ùRCVb•J°{Î-€¦‘½MWE½©V·þ…;~£nOLÊaÙ³JÝŠ•¿„ôK©IDvAΘã) ¿ÈcRjgƒ·¬}§ëÙArm¨ê¥EOnW}œ¯¾±'Œš«Åå~Ëú(5/݈Ô.0µÞÏ1rɼÌÌ<8 E¼`•´j§º—;\¥ìZ…©×.Tš¡pÈ3 €â'FÖ´û­ç„:Xyúâ´“ÔíR‡S2Ž]NÎgN+ÛŸ=n縅QyQ:ç’ÔNMH•¯¹ñ›ÆéN6ƒbUmàÄW´/†#ï‘MÙóO­U}_õVI‹˜°äµÚúNƒ•%ç9ùõ6O.i0šGµŠ“ë¥Á^è¥ó @)¢OÓ`Å„Ü~lWþëéÒ%Êv¯—®û¾*àR1~Ü]4-4*©ö~éøB@u‘éÊQ€,AÜ,$ÿÈ9D3¦"дF_/R½ÀOJÊàÍ%¥ÊãK¥ð:©(sg­[ƒÅJ—ÖüžÜð …î‚A6î삹¶ˆÔ]0%Z‰Í‡7ŒüÿŠÍíõ‰\C¸ÚD²t¹ZºXbF%¾Ý%fËÍ',] Iû¡²>þwgë©Ï)c4£K]ÐKqò–CwÀQ]šò–%ÊwžÓ÷O« Uç’]’Î*ê{ªcMÕPq3ï1¥kþ¸2¹fžæô«kãP¥_·ä…=îßÛNÁ^aj©ø”[÷UÆÚñ«“ÄË,eÝ–¼°*þŸ¤·™l´m˜)·ëF ¹%=Ì}éÑ _è¼I49ñ¬“ûUâY‘]½ôêÒw^ÈûïR¢ŠGU =+K&Å É2—,ðè®N&OA½·°õ}„Jžb¼²BÀo"Ø6'>f(f®ÁD³ ”ÍÉæˆº{GâU%¾èÊ–’‚êíuÕ”PêÓ;×Û?½€W©ÝËl¯¥$>È’3܈ÿB~/²~9)%D·¶aÍõÞp**l’QÖ«ªÖ5îVÕöH´”ã.¡í¹f&:Ô?¤c»B꣢êLDªkÕ!eÎF_©Ô¶½ŠIÔ(Kê`ØÁ]I?¹-=, mqY6œmgUŸÜ}7}µÊq£V•ýLYòªíŠ_¿¼ÌQªJ>0ˆrμ!äò–ò;{Ó¼å—íùùÆMÜ{ÙÅ)CŠ+Õ…>³xy)sF±³ªéO%ê_5Ž2fA[¯—á_,OO²=:‘J¹bgƒj]^xýÓOÞ»œé—”n¯¬˜ònò8r{$+Vrs™¬fâÍy†äæJ«—x$+­ÅsÄ„ååÌÊKHØZsŽº¦[D/Î:]Éx®ÕYî1.§•wê”ÄÈåŽF-f¯˜«?¾°‘Û]á+eçWwan<²PL½ƒ¸ yšÔPŠ“ŽoI¤?…¡mµOµ÷3aÈJÀ³Qä<7<Ä!_ oã-Jl$ͬRÜÑïŽzà q×»£…•Púœ¯Ý-õÞ¨7h„&©U¾)¥®_²7¤þr@]CvAœEoÙ^ížàÙ®›ù<ŒÇºš"#oûÅ®Ø;…_– –ÊŽæÄÓ5jVù±ñµNƒ.Ê/Uë¸B·ÊµXÖ@ÿÑG)*ìP> stream xœí\[·•ÞçYÿˆ~ì6Ô¥b‘UÅÂbDŽ+ˆíX# $F0£IƒÕ\,i,;¿~y®<¬bµZ+Ë» , kºY,^Îùxîì6mã6-üÇŸ]Ÿ<|êü°yñæ¤Ý¼8ùáÄáã ÿyv½yt ]¢OMÍÔNnsúü„^v›±Û 14®Ûœ^Ÿüm;íúm³ë¶þÝqj¦8l¿LM¿Û…íw»½÷±™&¿ýíÎ÷Û/vû@ÿ<Þí]jaÚþe·š¶um„¾ë·Owz·ýú~—F;…Ovûnûuú¶|»ë¾?ý#,;8»ìлfˆiå§iµ.­²Mÿ§¿Ð{ºÐ„°Ùû¶Ý4Q§»4àö,õz½Û÷øá:­j{™¶óvGÓ“®q§Wi57ékˆMëúí;XæË¼!xülçÚÍKxoJbj 8ö›¼“K†ž^òÓôê˜Æ _[|í6=x•ƽ‡…¦µuð~ZŠ,£uØå9LÖ#íÓº¡0ØyôLva`Ó÷›x…ÿ§¶§¾zŒ4œ'b› –’@înj›¾^¤v˜:šÕÁ;0GBL„õt|ðÛŸaAЩK¯1­ÌÖ ýaŸãØm_0mh Ôå.?&š˜.!„È}Æuð?¤÷z7ïíNH~©m–tW¼Ó½óM?´m€ŠË8ц…°Š6øòó.â¶»íƒÔÑ@eì Ht¢òrò=¦Ä€dgø!DÞÂ{ßûq×{à±EAdFaäø¶¥Ýî·i5¢m€‰|ë 0/Ð9b?<_°ðv@&Í¡W¼Š’à÷JM<ÞxБVO2š¾ôOmƒHUDÄ ª¢S;‘ö  ðé^Y,„·ÜLô–¦1cB©ä¥Ú(#?§“|Äaˉø¸ ëHƒG`âò·ª++"¬1lý‰çrôððÁ >à1ßÀ×¾Rèè»9ÛYÜìe_1¬3Ì} ".=ÀQu€@ 54îað+8@‹øáñÝNeÒAÄoÚ 5ÞÊÑɧ*KX6Êw¨Á¾ðE¤'¿dVPÅD™w]“T&ƒÌJùÄïÝèC›È± #Ð;€²m4²† 1¹ÉB# Ü„/ÝR¼!ŸÈc‘ÔÄÏ5É…HâM–R ñcÚ-Cù—8âÃH:SAñãÎã.=¨:‡0õy >,äg*ò'Ä H“K_‡C}ˆÀH4¨ª0ß·8“ÒÌï[" ŒNÂÁˆj+QHR'˜“HAÈOÑâ½K´hX #”򨎢 ¬—Åþ‘W¬ô²¹Þu…Ú5 „½&È(õzøˆš7Ô©mÕ Á¯ÎÑV Gäâˆ]Dâjx?¥üA¢ãôW(ý¼ÚN`¥Lj±[øê…R‹¹mf›ψßþu Í’ÞËŠpfŽÀræ&Gê ›-Îâ æ,¯ì\T÷Ma‚Y2Œ(Þ„"Ð*C$B‚ágó’¸OO¾=ùaã}3 ùØ7>‚xŒ›>I›Dy0è=9yøä«ÍÛ×÷—'ÿºq'¿„ýù‹ôçÉï6ÿròøÉæÛuS¿´™ÅÔOØnÆ~‚‰7½m2«;iÂ_e!YOa,wp®|ÎØ>ϪX÷XÔ¨R»«ª„˃(²ø’ô=‰?†‹"¢[!²2’Žj´§tiܲ ŽMç§™¤6üÚל´!É·¢»¡eÕqINEqðFG m¡ö»aB+F3 rNgÆèŒôPL x]ÙÝ-2g¥¡Ò¥6º±S‡D7´ÇÐ ,x‹³]’Ý>QÂtÈA§½o]0‘ÑÖãÆ7D ÖuïAΖl§l}™ùò\D²)Y9GFJ"g:£¤8•{¡E)´Å[òt¦Åd…‚º.¹ÉìMfµå‰ÿ >1ý¯c/²€Sa J¹CeÅ LýÏ]°³ˆzó¾ê[h¿¥í•ÄæÄôW]Ôyþ[û’öDH¨g“: 8–Ü'·Ë(Ss‰yæÀ¼ÄÙÀ—y/Ï0zfÁ¿Ó®§©C“ˆ͇O½›¬àC·Ë¥6iÄ ¢á 8~ Ù£鉭WÜèÑ mÿCÜÈÜ.ÔùÆØ–6°MÐâŽdq?LSu-NC]Ð»ÒÆ·ÖÞ’ÆsmD’¦Ï)Áú÷-ÌWnBu¨}ðŠ×ß·ŠôÏõñ]ùnïwLæÉŸôÉ7y‘_kãrãû{†)â)}­·¹ç;m|•/µñ&7âê"’÷—\]Ú1òZé•“4¾Ë)†XWµå´>—8Ÿù’¬cß5Á:óÜñ¢˜^Þy û,wxY@Jú¾F8âZ?/V8û}έwGäãßrßï îX!ëÓ‰ÂLK#oõp½UEÂe>IÏ,RÅÊþÃN=Àׂï€ã,ÎÖóî2¯‹­qã÷–Ïa¢ðN^VIæŒCåå:îk0©JƒO°ÃÀŸjSÞ,€¯-F-¯e)¿!äo"ÍWÕQå<ÄÉbðMƒgUÞWÏÁßw3ääÉ'5ã4®ý •ÀùG*óZãM±§B èiú¿©>½¨=DlâWÚx±>ç1Gm!z–"pj€¼&bJ`.TñYi Td¡•©Y°R¡|~”P-wÆ÷ÅqרB¥çGÐôñ•2#½L$ªÄ’ ·µ^äžwÚø¬Ú’É¥ºË'¹ïÑ—p¥œ1³FïLÃ'•—Ÿº>”fô!ÅYZÑýÎWsŒ.ù ‘xÑ_qT T”*(ܨ¥@™Ãñ-Å*Õ['Ç'p (bÙyÈÃ'J21m¼’`î%v<ðFê^ùYëÑ}\º 6q´ôËx{wWG›cF´™¥OjÔ˜û¾V’!û5$!J ‡>‡È[ïZ™ ÎcŒÇŒatò/&9”ývpyÁm«GÖMèfÁ$rö4a8NMˆ3±†ÑíçëìÊ<§xò¸§à™v.Ü,b'AÞà‹LÇÒ×ÿLÆ”tÑ4‹ï€ëÒIÆìQ‘‚Ôä#ä¦h‚6/Ä)¾¶’_ÐϾ„2¥Uzñ ‘©L¡ÒÆ)ÒŽDe B@£¤‹9“œÒ×7Húj:Ñ Œ£}µô æ£8ÿÀok²Qº6Ÿæ0`›A3dWM@ð0cNþ/NèïS[‘US¡°Içzn7É‘^œÀ6àUI«g‘³I2°,9±ó!Á~ Bá–zž8}…Å,C˜!z ÍÖÌ)áAdŸkGÄÇG Ç·½€…¼Va¯KeAÄÀÁ]•À9+b±”ÚB £ÞªF©-.!7ø8D‰ºF{*wXòóå~Î÷‘¼ºkk„Ì2$½ZJ¾d›/kžj„Ï1§Í©fÆüO¡D>?“ÆAgjnlæ¤À†¤ÀœEO“fŸº\³$Œ´}­ „µùäõ,ÃÖ û¿^Na© WtG6ÂVÐÄ}¹¦…vSê(‘ÄìV!ƒ 嬨‘Ľ3ÊL„®óKÄ©·£M†´:Ö3’š³Ü¹ÚNÓÂÅ9é ë8:pÒn ø/͵á&˜x™€±ô ìðÍ2B|>Ê‚n~>€n“Ó¼½ ’¯Qyi®\0'œÍ5Ü1Þc0ïÀÆ©,íÝ®‹¥r¿(ÆŽ_FÂjÜ.óÛÈ7%­4–ÜqkNË )½(&œfâþ…åWz½Pwüº5 ‰&cEpç(l‰Æuå‡ã aXðϘ Âú÷†R­{:ã:–ÁzWU  ,»Uš®É™‰òšk‚&FDuoøiî—dã~F2Á OfÎe¸“Qln(|Ë… Up©†­T)p1øh‹T[=va?έhCýç’¹ ík-gúíš¾¶˜U_i]9)8v-´Æzý·wuBÝšCKº¸…Rg+––4H°€oR&'6%ÂJåÔ¼Mò¹EQlàÃùß²xh7äì/̳ìÙÆZ˜ÏªÏj¹Mëga.+™Ò×ZÍʹ¾‰>MñŸuçd1bu)¨ß?µ-d¯4² âÜC±Øœ xc­‘e~à2û¾Àçùî`èí®¶³Ÿ–!}¬n8)õ#pÄÇòûãü2ÞciUK°Dbûཅ”5|Éä/.¸ƒ@ §{çä”P Æ—Ü,‘á"²òƒë¯»Þ»&Æ›ŽOV½ÜõC²`ž¦ T¼,E³wv'n}©cr¼‡_c©±kºP,õ¥¦3èÈ}œ@‘V͵¡‘[nš#Êø‰Äx ëÄ ,¥3\L*Ã$÷s¡^d¹¸ÀÅ*V/oi —w8™¹ˆaptÙF}ä-N,­ºÄ°‘«]²±c-’‡xÜà–niOfésË®iyD¦ŸÅ`±ÐtäÀSǹÝRøIÖøÔá4d“>tM-©¢¹¨ƒ%ºuU¥’mA >ú1¡=Ðe6e^7W€t_j«Ìk‚…cœ"r6Å/ƒ¹‘oÜç0Ù_z ]T¡rµ¦ˆ§æ»@Jý2 «k5Ñ{ÔÇ fQóUýåúFJ9Êu‚C¡Y¾˜µ°ÂX4Kö¤ëa¦¡/ÃLünô:ý¬×eÎ6f%ú x/Z_›/„pýQ«j5[2­uÄñ¡2±;ÔyƱ²>/½ÌÊ»veô³Œ 9E^¯_7a–pŒ¿4)¾eäWíÖ²¤\L2‚Xž] ;xk£hý¢«rûŸ+ÝûNu4‹ºÊ= k;º0zð2¾«GwUêX›S½Û¬‡°.ßõ+~§‹ ó$E™R‚¢w‹Ôc·\®Øµð±·æDð§néC”Žƒª¯ÝHÒtÈ#>â¢ÖÌÝjâg‰¹àá4Þô[þŠ•¡I޽/Ü’+äLâ·‘ü…®dZ<·Ka*HEj:sŸjÅø÷Õž9dt9MÜfɲìïyPe4H#)¹dCÁï‹×|^[ú¬ÖXF'¸üô«Ä&Bã‘EÁÝx\|â)Hj#Ó=U«i]Z^¾šì!Á€žž •[P¶2ÊwT•Í#.gªßÓÅUtY¸òÝæÂ™¥ŠÉJC%°v3½¬d(äŠÏj9t©ÈÖÏŠ0JPO`Õ3µkt(~©£R§ (ð¯Uã[”Aëg1×|-ž@4tVU#•¿Ì4ã좼¹W%?”’E Ö. j¿¸q\‘‹¯ä{ñèpÜʦl%¹­¬jØcJD¶RÐKhxË´–.¶oN[s³åÇ9 W»‚%ßTS.~qdq}S)Áö…>œ­…‘t&Þ[ÜWÜ%ëaMç€fó2£×a1θ-¡eå Ço^T‡u°tNêIM¾»{à‚<¥h}94ƒÊeP©ºU÷°¿óß2^*Î K” |ÍmÚý+¶ä‡1æFíöø2•õÚbGØ,J#øÇ]LÏ—²Ïâ—#Ü…Eõmí°Rë· ï´z“œÖ¸¥aG\‘r%Ø5ÇHéý¯tøm«´Â´ð?hÛcè"$Š;‹TI YûGŠÊ?A7è˱·RL»*ñ"ûä&s%ý$Ÿ"OC ¥“G^ÜÔ}e^þI–NCLßžüu:Mhendstream endobj 821 0 obj 4723 endobj 825 0 obj <> stream xœí[Ys·Î3ãÊoØÇ•v48xpª,K±_²L—Ä©”DJ$Kâ!Q”-ÿúô£13K-yp©´ÜźÑýu7æåjèÕjÀéïÁéÞGÊøÕÑåÞ°:Ú{¹§èñ*ý98]ÝÝÇ.VAS‡¨VûÏöx°Zzåƒí•^íŸîýk­:·à¿îÜ¿÷ÿŽÃ‚i†Õ+#÷¡÷ÇÝÆ®?íTc°qýQ§×»^ïcûýn“<ê6øŽ@¼‡'ZGx¸þ¦Ûx#ºÙ؈?Ç/êÓv‡½õúLƒã!ë4ö ž4ýŒÑ¦”ãN_vÔ¨DüÝGØ}´ŠJAçÁ'†g_ÊzìhŒ:º¤nÏÏ¿^†ÁiEl¤Æ2#M¬97Žš·Ú¨(·z£TìG¿‚5ö£Š‘·üæ]ŸáÇk®pÍúþ>If}‰ëÕú?øó~<ÅÇøqˆÿ)m?•Î0ÖÆßÃúÐÖÓ…¼­G¥ïÓÚØÈg¹—¦¡°½t~м’Ö‰º`é\¶^$^ÝIn·Êã‹v-ôvêºöyyòUåìËÒøIm|wϼ3ç¥QìË3Ézn|º´/Ä]•ýe¹ƒ×-_?©½Þ.1ñt‰ÝÛ¸Æ~Øõ›òü¼>?á¯Ôü´ƒ¶øVíð¤CYã¡Ð!ˆ«:¨Ý.ÁJþúªöý¡+ÍHscœë5«‹á½Âå4Ô.O›ÓÀJOmð´xàæ fâ¿øãXüq,~ûcÎÙÙÆcï{tª÷aP¾Ø×Á„ðûC4Ï:=¢ô<€ôc¦ÀS毘EÔ×çÑÔö–=¨ÞÚ¼«?v:2ɲ+‡Åë§! ñº@—cÞf­iÆÂ‰¦ÉùÌ–¶îƒJìLjÇèIQPŠl\$òi‡ˆÎr‚nšŽØBÃ\ å;è šeCÒE¥À}­ôŽèÌ…?`$Hý¾üj÷ ’tÒ“:yÂJ>®ïvVöºû°¶’Zñ!c£¶h‚çÕáÁ.akÍF¥waaQY3FEÇ¿R¿$69§§³š…ÆcªcU{Ññ“Ÿ‹Ä«žáö’¥÷[UФhÓTÅì¤þUZÄ¢à&ÍÍŽÞø‰;|‚ëÒÿs:~$rÐLتNict´d>Êy¥]>È#‘Ç'¨;¨‹äCuÔ3½Ô‘ÄßÜë*º§9ðü y!Ñ,ͪϪùAÆ ²luæ˜V7L,p%$ 0ñ:¨22F²*WIÃ2ƒ8cuÊW¤&¸] Ö œÖcž/i,lÙäÌ¿¯reöy‹0²PÊmQ0‡úÕŒíµF+;¿Õ^ášž±%BoÃø,h£%J;Xâ!/Ñz\eµ(ÍÉ2íldŒ·äEФf¬Šê‡[ïèïm<ã†ßÍZz!?²`.’K'ÑŒ¼î7Ì"ú± †­û†ž.رͧ¬†ÆX‚]x$œÎwE¸ÁJ£vé˜9Z>é³déAÙ.J'¡H(·%©æÜ²åâ5µÆ+gÜŠ˜<ÙqµeåLãé@“hqHp³QNØõÇŠ5Iȸ©Ê‘æeK'@WM äÔ¨‡HéÔ ¤e\AKùðb´3š‰/Êps Áíb¬ œDiÍJl™mn´`•–ür‚d¶06+èu‡|Ox×T¶ß"U©²n‚Õt²Üɲ—Åçmm4Úå¥z-Tm/±µI$L¦o¤_dÏǰü<Á—ôˆ†ôݶ,“ëøöIÔðÑõe §_—˜'œ®Ú0öu ÅñìèÆŽÈo|g°ýª4.…nÏšé÷ ±ÿÊù³“Òá¬ò*6ôÖRÄY©>^j¼ªUh~•»HKã¶{µãýÒø°6>*÷kãÇ¥ñ£òm‰ N¶¿d50=®àÀë5G¥ð„`¡a¼Š­"'Ô;¥L\X…‚Cãék ¡áã^ƒ’­»îG¯"Fpj®UÆ€LÃ7‹ejã§* ö(CÅÊ 1t‡>ô£ÆA‰y˜¤Õ¬m`¼OQîYëÑd°òc°C‚Ñ}3ìÃþŽ'®ÜB£Û‰ (G3‚\€ak•¯êäh#€eÄÊΖx»ÄÉVÞ8!05Α\àÙ1Ž«ýÏ÷öo¡< »p"¶Í8‚pͼYn­HR€™"lÛÿÆ· –F‹†ÄèÜ7ÝûÑiñvÍöœ‚7¨#º|ìç5"(ÜIë(«T&§<ȨF ƒ`ö1MãKé:Ðô'•MI­ ê1’êÃôlnÓã*³ºLŒ9›–(0R°ñàP2àÏÙêð«ÝR1X~¨QK‰wÞ¤2ƒ’~Ÿº\´n€!@rš%Qƒ•’”R©`S¹\ÃÑ„c‡Øo”&ÏþEq˜Xæ@.ÑJ¥ƒ¬Ý|Ö”Hrë?:elVr^Á<¶×d]%Ãn\cˆeñ±K–sqc‰ÛÐ…£§ÆäÇ-ló-X†ŠÒ³'ü jƒÀí=ÄŠì6XŠÒ–áÄe ©UohZ›= õ:Ú©’o³,.ÊÀâ"O”“¦Q¤jĉZL*N¬Ù=ÛÒDYˆB^ÇKqëYí 3’¯z1ž†ÎNM¤œ³'ÅVÇ&Ãép¡×ÉîÐÊ® pOdDÞ´À(¬ñße¡òsA[“¸¾0‹ß7~´&›È_?~|Wàx*@ÚBd,ʇϗß6 ó·\è„ãù{D¯M9-k沪•¾!”ÎÙ’’âÑQec?ËøW÷GCN;º«¤§ +ŒHÀsåd®â¤ÅîÈ4Æ|$‰™%•9ÚŽ‡Mž¢¦uÉ}ž'ì4 Lñd£JN.ÙY×óìÜQŠ07-•wWü/E‘„«)¼3ò¶X®´5Á.ÖFI'ˆ}=±H‡<Á¶ª©(TÛUK"M ›,ÿ6i8 ¦ƒšx¾‹ª )‰WÓr›‘1E¶½ /M6G0% #·£¡KsÎQ%ˆeÎLõ-ËðQ’,ôǸ q–Â4 ͪèóUiqcNvzHX¹<^Cjí%ëo¢š ¬Š7u΂- ÛîRWÎò$¡‰¶Ä0 ÙÖÐ~Õ]†K¼š[—,ýO¸lÌ2 \p¡Bw^…ÒtæK …ó&q$‹5”cEÑÓ );èö2E–„M)›«O&™dmÕ°ú‹Tl ¥ðÔ@ÚÅ\Zµd’'­1ý¨‹I” ÀM“[r³cßÊíNÖ8qÞò °p¸K )Tèy%Í I—M"i¯,¾œ`Hœ·‘|‘î$¿Ÿý–/˜Tóu‡ 8­ÍÊ kNä+ë Zj±N²™ÁæÍÕ£2iGb29“ãØ-¨xbUŽ ·©ØØz**—ÕjêÈÍàzì)Ÿ¹7•qü5×ôÆÿøöhG|{Áá°wò:h[¯ç/]N¼Ü m«…ú?,<_‚éo—päâíË“…õ ön§;ŒÊþ‚,Õ;‡ïžÎæ¤ÓûÎ9Å:E‡|'ðñ¬5]v¨Ã8çDfk~‘°- Ð…L2B¨hs¹æ&å]Ë"×ÎisoµÈÛç‡ËÉ|¬ÔZ•gàñh×ßu!ä*€ÕJfæS¾>ÄtùmèE+ÚïãZ„ ‹V˜èž1†ùü—X 0³®Õ1‘˜¾.F,á3'DÁC4ßÍ ½Mþm±°4K…ê N…¸Ý ˜ð]u½õ”3¿ã†n½t’¼ÏÒÕcòýɶp/áfXÀ¹ÓÜêîâ‘ÓH3G¶CÚ.­tòæÊ·Õ ôÙ\'Pû§>#e(GwãB¼O‡iî%D‚²ÇKtuHä0 >̲Ì/E ¦B)¬yªðvºj‡7žfuzñ±¸ÛtëÊH2Æ6‹š„](Ev10çåJ“ôvå¦X“»#¸}]9ÈóÕl‘ð­0ËáÍxS"í“NÞŠšK4nèÓÕ÷×¢Õ ‘ò$íØhKJÁÖ¼î9ë ß4REÌZC§¶©˜ž|õ)¡7zM);.¾–À¹ Ûh ø•­Á{uÑùZVNôºlÍé áïïï}½÷r¸ÓÓÛtàOÂJfÀ«þ^¡¥Ç×óî>Ø»óà‹ÕëWWO÷î|·R{w>Å»?†?î­þ´wÿÁê뛾¸§ ¾¶0KŠNé¶ùÆNm½Ýʨ†`è·`TC<æ[F'•:„ùÇ¥¢ˆ»M±Mk\·Ý|5\*É¡•Ñ¥ÂÐæó!v£KÁ¦oµèÀîc£Ý¤ÔxN‚'VŸd ¢-ƒ¹.«AÙ*gü·†ë6Ì•¥Æ<ËeÃæŠãâ ¬ ²þ«¯ÀàÝ¡v%rQ-Úñ’5dš&zšÔ6ÛßÃÈZÆ%ƒ™/&Á¸t/ä$éz;½ÒÚÇ”TpmV!c ›Â¦äFþy½É‚n|!ùC ¼Ï—6 ^ôÈŽN$pÅí_ïoMÓ è¡Ä øÞ0†6Ê“U=Jűåñ6½¸+Æ«v¼Ä"9ß$1guõ—¢<á‡4 {âU \; &À3vxÍHä²ùªÈ`Ëvõ UZ~w§—–Å ÁXÚîù%bD“é½âü4£®4i«Ÿ€¥&@JkäèqœoŘÞRþ¾«/Zóˆ{ð+Á‘±´ëm‹ Cmš2‚[ôyM¥Ôú×’yf2wiŠêõ…"óÝ™&ûÉrF_J–!ØÏ,ÂI&¯ÉéàNæe6ˆ‰öíú)ß<Ê{´ºÜ9È€»˜Ä¯÷þ Ç\‰øendstream endobj 826 0 obj 4200 endobj 830 0 obj <> stream xœíioÉ5Ÿ­ýó-ÓÈ3tÝ]­(‘ö†ÍÂ^ŽÈ±Q¶±IlcŒ½†ýõyWU½êí‚¶§ÎWï~õ^Í‹E½6‹ÿÉïÝã­»?×.^nÕ‹ƒ­[†ºòk÷xñÙ šÖ}Ý›ÅÎÓ-žl]´Á¯]ìoýcÙWÍr]Ù¥£ß«.ôë>´ËŸªU»ü¾ZÙå—øãójå—÷ñ¯Oaì·Õʬû>øžÛþ^­÷Eµr¦YצYÞ«d.Îø¢òëº6¾å¦a˜‡%‚_þW¦Æ¿Á¸G•ë``×.¿ÃvghMl5øÙáÆ.p÷_ªÆN‚ï!o;ð° µÿÜùqâÆ‰o̺ €–=@…ÔðP£WÞúµ÷‹•«×é{t‰;áŸÁNç•£ÿû•_ž@uu=…¦^žô=i=‡õ/·'•ma,.±òµ#¤ã´—ø±' žà8œ€C«uK½@¬Ð"¡ó'xYÊ!– L"àa×å¯0'ȸØ6ô:Ìø8”éÓ–Æ•P¹@}hJ¨Œ#BþZ!†] »µ&â?1‰ËÃk†û ?Z˜méãI$¬š–Žf†Ôó±³À­"¦D:(bW!^¡v‚‹HƒÌ…»ü‚+`ã|x]……5 >€Æ ý1Ù°iiõ¯2ðQñA…’H8=´‡Þ7´‰×ƒ8îÓÊíÍòëØ‡ó-s"3¯)`µxÊ(˜D¤#a$(q‰Q€™Aá Ÿ$™Fp½ˆö ´¨(ÄMc,ÏÄsž-ˆú+€„äÒšê¡V^Lf†…¨ÜôA:|OØÆ?Ž–tð¨¨ç%j¾4z©^'½qP)ÉOü±—ùßOT#’œã| áGXµ¤ÙQÈ+Œ%„/Q'3yFM÷u=WP‡ÀÇ{KBþ ¶¥™Îˆ²/w¶~Øz±pnÝ’  ‡…k@­Ú°ÚukЪ}vëîý‹ó³‹ý­»fëî=üñÙ÷ŸÃ¯û_,~·õåýÅóö®ÔíÑÞ9àfÞ‘ÍÛäÀòA2.æ!`-Âû€8„u 0ÒUÑAF6AÎéÑŒÚÈ,Í7¨µO%³2{™„eöˆÞ÷ý{9¢oÜÚ5ý*Zýg¶d tòü)‚µhÖoÿ¡YwƒSd@Ÿ$±„"aždw É}Of“‡f")ìi'†¤»±3“túKV .ñ6L¶=Û d°}¶#}ŸMÍp,©å+\† DÞ$ƒ†SCi>¬(³ëƒûtf MhsCV' fv(p¾Ö„¶E.W6OÎÙFEk{Cúñ¿Ñj¾Æµ.++¨NVwDŠU¡ ö ×è#´d”M8Ìj˜ÎÁäcYkÑ¡A­-Þ‘¼7•TÔšq¤”n‘ÇkØ·O£“ˆá2£C‹i¼¹6uãßËšš´©:ÀÕ>ßaáé m98&/¸Zÿ ä…CAò c˜f]9ˆ„X:ª\ëŽ@”ͱk‰qpƒçø±¹FÚ8xjÆç,O#\»6mÔÎsHÁ^ ‡>ApèÌO“ƒ‘e´ŠUíW‰÷³Ÿ¨„ï'öÁ÷iýDа±OØÔþ'Ó¢`é5#j0#àØƒúðQÝ®(B¯hÕ˜žðˆ'ætŒÈcü ?^â³r{Ÿ¥ÁÄ ˆ¤‹#Š“œuf¿¼ û¹:íÇsžfÄž¦ÆÃ©Æ—©‘4 ü‘miK~^âžåiÒlÝq$gh$`½“ºOËytìm”O{’T˜|’úŸýÒxªù(6¾ÊN—í¯Ýé$õ?Îý¯¦¶ÏäT9RLžFæ5Œ š8òÎ § ßŸ ïHLþ¡¼‰ã…wÍð“ôøï4Dxιۻ žÿ¼(ÎÇþ\\´r`‹0$²ÝÚ¤‹’÷/"ÄÜ£(2–DÆÖo).ŠÔé¯"ôDèÛÔø]ù05~¯ kÞLÐÌ]Hš+%¥Ç©û Dn(So-im»¾uA;(™îô¶lÑÙ¬-ò.ºV^2ê'çÛ“Ó) ±ÿF‚ôö"MÄí[½Ø_š½È¶¥Ý›0Q“8%iÚD0e}Öµè]T¨éT ý¸u±Æ.þ@Oe0£MÄ"ÑϽsM•ål·@¨4^˜“Æó7¢÷þ¿œO±kÞioÖù[z݆ïB ‡‘MÓG™R‡Áp}x ŽÇY±àoÉñø¨/§\œØ_êƒ( ¥ê˜›¤!¥A²¿3©`Óâ7W¬ví7õêÿ­^µµ»%½Z`Ozçü̱ÍZU úáî_i*Ï(Ðæý9œ»Sšÿ±ÎKzÊlÎ^Š-23eæ?)¸Ï÷›«š¶X‘Û̺¦‘éët÷±úV*Ô†¾éÍ4Û˜ƒÏ§¸á| ЬxP—e!¿û£i|q›ëæ¡6‹•‡¹Iìmå&+„°†)(Ló¨ŠiõXý£îÑUN-µañÕRÅ *‡ g(uß÷4ïÓ1YHµtaÏõó÷òXf¨Oo5e:ËaµKhäÖ=ÞÜë¤]L#Œ“ Úö{©Ø YÖ¸hGPP…K^s à´¨àËv.ùé×Áõê %Õ 9ÇŠTÝøÃNk.âÀ: ªvP½Èy ®úqaåz3YØñ0­ŠÔÉ…#8–ÄׂZ‹0ßIl·M‰mÜ¢„󚻨ó€ã]Y@æj—3(\êm!í‹™*Ç`Ô¯1é™R+Dƒ &œÉëZ4Üd†ŠbS—=t˜«¹,/u¡?"Ná\k·î’ëú)ÂÓ f¬%WÎùòº%}~Èn2ÏsÆLs%èpÎÇ„[×$„ö\B!µUÄÚ®Lk#VXPé—Þûpœïe.â#—îÅ®6Ñɾ˜5‹…|¡Ý°œÈ*†Œ÷5'Ð/“Ø7-APûÆSãTÀÏ•ÇbIAeŠkc¼¯î>t¼ïÒu]²›7 ÷?Q›zÖquÈµÊÆÃþЊÁ`'¼k'ãâíÈ8ìwX¢,ŽÄ CtQz;y "üǺíÞ.¯ÿ{ªÄ¯Õ›¨²”šVE¼_†TÙ=–GjžäŽ+½OS·À«Ë­ÕE€'/â¼mÛ­ö¸Ð*¸v~àcËqKã–žxõéM®ñ‰rb½8 Z±p„ÑäªÕ_U`-Þ¹¼5œšVz͉ ‡*b˵Bd^ã§xJŸÉÕ¿·ë‘c}Jvßv™"?ŒÜ“%¾Ï«­hÛãã S\ŽÞ°Å0@Æ›ƒJ¼A™Â òø(0Z"~UEnˆ•JÛ÷åË2Kácß“ÂQ<0ºÄ°ƒømUiG'e·?÷:òIXʆ’ˆ¤¼éÚËO°œ¾2.,’´}Ÿ1¯ hñ…›*µvްnbh\Ãål\#ÇÞQ…]W?¾¯²eÁTŽÑÁúÔŒQÌ0·gM¡xÙ5ŽØq¯Ð+y-t´|§ßÇâ!ðµÈ&Ï#f Ô‹(X†éƒšÿ¡ÿ1>1Oø–ųšì·t%+î¸ë+ŽÄ½S°ùߌ'$²¿‚'Ä×= Çõpê¬Â¢uBwµÒÊàèü¤–Ÿ€Xj×A× ›_æåW[ÎR¤¦•™(m—(;G·sÊj¨ j}-ws×KųT:O©džr8¥^_ 6|üÀ g²ÈA?/+W¢ÜicÌL ¢‡žP74ßÊ+ĸ|° 7§µôíôà>c à‹k-ójâÇ$e¦&žÍ~h͘B'—ÐWß3á &>–]¼ÞE?œœD<ýQz;¦ ”Ü̧۬ÂßQ)ˆNèvtoño²ÚÎoÄõ—& 3b:Âß”“ù¿Éƒ!ßðåÇØO&L´„æ9­±^7ëâÕÈ™K?Y¶pFgŸ”gIXr,ç>¦¦Ü!âY¢Î : àK'4<}gW®Fš‰éD[;äÑ‘ÆOü)Kô´Ç-Û´J©Îš”wímêO™ qUÉÔq†ŒÃuÅ‘^ËñBÁ8Êyˆ«m—Š¢Óälá4©rßMÄbsžrò%›åôõ`;`WGîªÕæ8÷&ÊöÀµõLJM@û<¥ÀêlÕÆ)¶+%çɰLJ” òÒ|·Ð'Ù+Ÿã dìݲ”îªGá×åÈ fl¨·µÃ0jòânŠl-‡ôÑXÍ.»ò .χÉwfS!F‘+“¶QþÒ…ô%-§90LJ"݉ù &GºÝôì lçÈ‘.ƒ- rc»\Ië"\GªtI—4‚Œ¡i ÆŠO8)1ʨ”ãuz,1KðEÌ"*lÖ‹©müPj=VL‡‡BÕtE<à$eÖÇ…ÄÂ阊“M©)”¸Á•Ü,^¡¿>"£o=øaëgÙƒÌendstream endobj 831 0 obj 4364 endobj 835 0 obj <> stream xœí[YsÇÎ3*?»,c9×îξ¸*²d›‰d[2]J%N¹(¤Xñ¥Ÿ>æÄL¥DV©.æìéþ¦ûÛAÏ»©häTà?÷wÿd²ýJênzt9ӣɻ‰¤ê©û³2}²‹MŒ„¢fƒœîN¸³œöjÚYÓH5Ý=™ü³’u[ øoêö_»ÅnVgÝ´ld=w õ7õÌTßײk†ê/µª~ªgªÚÅògõÌW¼ªg: ÑW Þ@RTV?׳Žû$ÍiØ,ÄŸãÃN¬ýG=k±µªžÂ°B7ƒm¹Ë·µÂ6¶ãÎ$Môþú(ÝÙr£jj£ ÈCã¾ÂæB¨F” ’hž¾IÓaC­Œ£¡¹ÆÑµÅÁ}ý/ ‹­’$†+ 3Ò4 Z ýú^9UçšI\›šÂ›^«ü?µVÕ¼6Õ>ü¿ªuu ½@•\Â<Сò·¸plx å´›–ÏŒ`-œÀB`™²hŸ®:ÀúcñµrËêC=Ãq­T–jN±Ék”Õ9~'P˜#/Ð^M£1PØó’¿¢Ö¨ Êwi ÏFÒH4OR#¼Á²E­Â`þ(©S†‘ØE‘ žÖqµq]£ÞÕ`š! %XØù* Ê­Û W¯I ŒmPµˆN¢ÕMjþok õ²ïS ¼J”û×ÒTÿfPY:rM?\ÞÔ°}` &šÿ CÓÌ-kkm;¡.µ\šò fOÌø>Ý–ãÙ÷báIÚ=•£§½I°#rËîgH÷€ÈµuTBA+ ꀫýÚ#ݦz-l;¤&º,"roTŠ×£nØö×:ƒ"pÖd^X÷ 1:aɾŠ$7µ.2pÙú1·@¤3äãÑé£'¥(ÔflËб†¨ü;]s@“‚ã~¨ÄA”AÙ1N1ÁàäãR×fq‰7¾AvÉ> Œá„¹Ôü d hÍ[¢šOaÆ_PŠžü8ë°Ž‘΄Gj)dzÉ´6ž+y,·)»0hW„Õt‚”ö*Þ2ˆAÉ1JŸ: ‹¨0Wãôï9„§RLŽ|·.õ­óౕ*jŠ é$­[ZQËŠ ]ya°ïB’NvtwïèB¼Ã¿G",odŒ’ Ž©^d¸Qç×H潑ž;^¯Œñâ¿TíÒý¿«ú÷&ÉO±'{ÿsOÈRb=»‰VÄ/Ø¿Yâ ªc­†îs7®Cõ‘—ì,60 [´»Büõ P›ÇiMe­v RK›0HDÏ#Uk™P2³ÆñÙæ¾¤Ž$·;K>ȹT@*¯Ñö-E·ÎLoâØ¸&jaØd×fçbç±¥éB•Mò;—.68¯^K/k>úZzݨ~i-+ö]'”]æh}nëèÒV¼”Eæ¶:s äç!Jš|œó ¯dR ˲è}*©•ã=l™H¯ØÇX {gTz=ˆ°…pÏ`¢ì™Ì[Z¾üFÎ…ú9ãyP²Ÿpç¬É“”&Y°V8GšnŸ|Þ´IÂe½}J‰ ëÍ6ààËØïwxæ ŠêEÑ·/eÎgÙÒtŸ´…U .tžsƒ®tŸ4É‚vÉÙ²K³ô#`–rõßs¼²¯ž°š1*ŽôæöÛçuæ°*ݼq=kÓG†$ÿž¯Ø]­õÊ«Ådétý^²4oº‚Ç4ñIØ_þ²5ËΖÃwÎŽb¯er¤|.5y¥—“ÿKØendstream endobj 836 0 obj 3031 endobj 840 0 obj <> stream xœí\ës·ïgÿ~ Ù1χÇá€/™ib·qÛ8‰£L&=­LJªj=lËr¢þõÅî‹ÅÝ‘¦äDé$™L,‡Ãc÷·ì.øzÖ6jÖÂéïêlïÁSeÜìør¯ï½ÞSøx–þ¬ÎfŸìCobSÚ fûG{ô²šõzæ¼m”žíŸí}?‹nÞ,ôÜàßeïC¼›½Xºù—‹¥ž?‚>],íü1|úSìû÷ÅR5!x¨í‹eGý.–FuM«ºùg‹ô.¼ñpa›¶UÖQÓÓØÍÆ!¼ÿ FÆÆïb¿o¦{7ÿÚc?…cB«‚ï&6ž³ÈËØçõ=¡ióØGPëçûšX%ib;Õ8ɲ¿Ž¤P‘mü¿[t©wgeïeê¾4mÓ«ò[frìH†àZÿvôü ê$®ðíÂÌã¾tÛ™?›ÇïqêW@öø ñ±ŸÃ×5mAµ~þlAô…wà#Pµ§nÐÿRãã— £±íhøÃB¢ëEœ—±²Æ¡|mGðÕ •ãâ`>5ÿ7 SV«s4ÂEjBú–½AOâ0"®öQ?„-h‹Ëm`“Ö $ðqm&29ù|¡5¾]ÍMk2y/˜õÒi]LfqBagüÔi1¤÷FÅ‘ƒ`½}\‰áÙÌüŠ;]Àÿ©·'NºÊ5–€Þ#kÒ¼o`xƒïžÅ±ÕéñÑáæa&Û[ê š(®Keš „;}Qæ„­y•RHc°ù"Ým«Q&É&´qý™ÑA¡ô¯âkÐ-®1ïA|,óxÞÂðæ&hd€ÔÀ[´@øæÍü>Œ@ÐaKëj®!¨M°bÀ v9Ynë†I]óË¢pcD€1´«¨úÆ°Ø .Õ{I ­è³ˆî ð厰ÖuÚƒ·,rXÙ ¬ÔÀõ°ceÜ‹ã1R²l§A³lâûÕÞ2m qÔO;¾G©±Î£Ð×°²Ö!©aÕÀ+pÚlä;MÂ~^ÔKÞ(NÞì·Ÿ¹™žãФ˟½1˜!@ª ϼBº“nù½È¼D¾™ìŽÈ0–]Çd7 ¬Íâú¶ZÓPrýõKîQq&C¬Ü57¾˜-¦"®'¥çS2\^?žÆ{FZ—ÆS{^Fz€úÿC5É¡œšÊQ¦^zòb ¤ZÓø!¤~W4w¤hN¦¬±µ\}~.4Íɤz9¨UÑ¥p 6yô°>ú«0ØŽ»)Ž‹'n¯’•5‚g,ìYgPD?PXm ±¶ pÿrJL5 ¦„?’šËÔœnÍ/¢æV‰jc¹ß]Í­¦øª’=¼W î0ÒO¤‹ðONô–LÁµ÷Ÿ‚²®sl>…ššòz$? ÷';œU›ÎÊk«m#<ç×XßöCû]ßnÕ·eIBI\IåÆwSKú›•N|¶Mãëwи#‡îr .¬p‡Æ÷רoÇ•Æ6FÕ}×umG…ja(·‚¹Q`]ç8:e °hÁÞ¨ÆbX¿7U·K.°èæ3®qùº‹·%ɱ&Ä×pÅœaœöšÐªœ¨zäG%¿NEÚ³Á¸øêìOd*Äâ¦Bu9 ä aîâWO;]a…êü ·ˆ×Â×Ï´¡Œ¢Áã¤j»,\¬ikmOÙµœÍNÜ…w!qÝ#©F‰ë¯·®¤ŽtŽ¾ÛžkXj&RÚÕËz©!MãËXçBWuоNc:˜ê¥˜SÖT˜‹û‰ªŒ9NqOÀPd¹;¥rÖCì†ÂËd~£zbe—éâA }ÚÍÌAþUÍAxàÇ•>"¬Ou Ý…ÛÓÿ¢â4gòžd¢Ì™D9­qµ.þs„‘!÷#G¬&u€’X¨6sT-€¹%KâW03J ¦W¬•º"¾—tsàU’”°àÝÆ·lªàÓTzñuà_aFgiGå]™h1ôd^+NÍX-ŠÎhá¤T"A{Žñ/ÂHH‘4CÎ.®7)užÉ[Jß0sG™ERaHÔ›ªL¢.Ú©k´N† `’v5]:Ú¢NHÞ  ‚ªtU€o«ü!|—ºÅÚ“5ÞÅœPß*é·]iˆ«­¦Tð*%ŠCÉ (*Ùbm€åV ­0Ó4ÔPWè¼á‹kc0Wi_¢B!U׈ªˆuѲUÚ÷"µ?VàFv­Iz}‹ÎI0±ãû½$¬8t{´¿÷ÕÞë™1ÃZÜc?SÊZ°ÆÚE÷Íz¨îýäñރǟÏÞ¾¹:Ü{ðíLí=ø þùäËOãŸÇgØ{ôxöÕæºß?•ê~•ê!ôçi´§Ú_dìÀ·²›Wjµ»›•Bzµ^i%›Wè"Âý]¬Š—\µÂPw ¿˜U¥ œðTˆ( ÁÜ|\!Ç‘^U~¢öäÔç".;¼RÁ_¦Ú‡í.^J :ëM—_t)ÌeooL¼¦,¦2¢6zRŸ!‹LbTXöPÁ¬É¼çRа©D9_®`™N=álpøþv.¢}ʵ²Oò=¢t 0ãòæ]Tl*+ïY±fµûº&Õ€•ƒ2dÒ]:ðM6fN†¬: »pí3cˆu †Õíäë6} ¢S|i­:>{ ]‹ó4ÊÝÞƒèáâÎ],7*]/wG"ÒûN —¿Œ®V8<ÞêELW [T!]©­Üþ)gükº™ÃG«Ã‰ø±P(yúú–”eéeUÏ…ÙƒP±8ºa©-_p,ªûg Ü¥èWV’¨ª[ܵ«‘ÌN%¿Híj®±3Óås“I¤7xI €[U¹žN ?ªrý æVo³‘•¿˜J ¾Ÿ•¸Ž‰¢–Êç8ÅÚr‘kU»½€nxøuUнG$ØÀ<‹wPÜŽ5jB—³ü’õçÓþŸ“Þæ’Þ6evo”ôÆØ&¾£ðàÙ£˜´_gàÂaaV’×ÇéÒr?Œ(½óu%<¿’fjÉçK²j·+mt oÖdyÞÅØqMSŽ’æ¡j4ŸTÅ1½ºÝ˜nŠÛ©´•Hl pã]ûAãä=[¨Ÿ ý¡©Hl1jú¸ KNKì–ïÂI+hDòm Ò¾ 44Å i&ÆCzË%¥-78a$®—C% ¯6æ’€ei)[ióoyä¨wœeSíBXá!f øá¼>y°É± áÑÕ`ª+ñå ¾Õ é¶ñ^$ùCÊ5u¶:ÕyN>ª°OHN+{«{ÿD_¤\GhäD8l£VÖ@Ò|WðŒ4såÒæ»q(µùHÏÁ¬D\ȉÓ|»/á"s8;àm|œ“ÂíŒà”­4)Áëɽήt·üDÞÝpÉ®Dûèw$‚¹é¯_ä8Ç–”l¾g…û2ÊТäA©×è-×'(¾$n'n:B' `SÒ˜U© Ä›>àw$Heô-*¬¬°†¿WâFõmU‚¸©§ò3Èü…îBþ™Æ¤ÁrjZ<熪Ÿ}ÐOÕô‹A"AÃ9îªú" ¿´’1ƒ"€ÂX‹ÀbòÏ^Tü†'øŠ(‹ˆ–y€©̈\…ƒAº> stream xœí[Ys·Î3£Êoط쨴£Á9˜‡¤Ê²å²;±e¦\‰ì²)ž ÅÃ")Zÿ>è@cfv¹’bÅN¹TZîb€ÐÝèãCÏ‹®U‹þñßý³‡O•ñ‹ã«nq¼óãŽÂÇ þ³¶x´ ]¬ŠMíÐ j±{´CƒÕ¢× l«ôb÷lçÙR5nÙÅÿ¾qßíþ†S 3ªU>ŽÜ=ˆ½?nVvùY£ÚavX~Ôèå—ÍJ/w¡ýq³Jž6+v]¿"ñ6>Ñzˆ—_7+OcDw$ûâçðåIyú¯få ·^~Év¦‚£!Ÿ6úOƒq8ý÷8F›¶SŽ:ý­ÁŽ‘ÊàãzîSèÞuÚGŠJÅΉ+14Kü¥¬‡ŽÆèHÇÄÄÓóĵtÓ —ÁyFœ&.ÍÅq}¯™Õµ„V ö¦qm¯†X~#¯³|lxiÃc³íaËKø½ÙŒ=àËY\ëò°±8þâ“(«â"»S'q¬³ H&²þ$Ö1©ÄãCè0È‘<PõÚ€“húå-ÌO^âÿ•vÀéP†Â*pç@>àÃçqýhMjz\ô ô³Ã z ƒŽ@¨Hò‚x¡­=õd*ØŽØo@:øÖè¤áõž«í'©ž7(‡>’ŽêP¹îå—Ž°çƒ´-Ÿ„?I*qÅk<,×Y¡O¹¸E¡–§¤xÁˆ9Þdݽm4îË&8˜œ5Žô¨mPõV¼çUÔuç;M[eN¥ˆ\yO µ×  œ†97¨|iHþ"¶;!Iø„×ó’ýPÄÌÃŒ½,Êû"& Â$Ûõ‰2·F Kc¿±›…_‹ÝømÁìá“£&+ôÀľ´_ eÛÞ«¤†Àƒ"ãÈyä”Y¾°2!aX§5´3;c:¼?4pÆn¡Ü´ËÊM'ÚG™ jYÚª™m t!3ßx<ÚQ±‘4jsRdï*E6–Dû<é0[¨ë) eøÔ¨¡¶­® &.!ž×Ö‡NÑZ^€^ŸÃGܬSª4è=€f³¤¾‡Ÿ·ðñªî;¡§§¹3¶½IèéH\dlŒ]>ŒóëNèmá%žj<-ç¹ñªâºŽßÁyÓ­ILÿv S×;ˣ僗¼× Èíûùñe=Yð€;F±ŸŸœ”EîÉîDÒ"ÉÉvs㛊?ù䯋ÜXó P‘ÏË!Ý9¾ J{s³ ‘Å™ì~÷mfºkŸW}!LÏOïÚP«Ëù‹¬ÕZ]”~¼Ni2ëMÖUÜE`'(‰a!Å^ë~Yäþœ\ÎrãÙÜvÏ×rÖ¡–¦pSïo-¾ÒxSqš¿mÒWöˆdVºoU¾>°}xÆ'pªêÇ5ϼC£ñrŽYǹñ»"Æ÷0/ÏJc™ïßr’5Ö§(ìoÖç×o}²ÿ†$ 3¨å?áãËLò1°!äSJçmN1 Ù,‘¨‰sÙÍ îC[¢ßLÐÑÜ‘¿ž5Aùùó¹AŠüŠíyQzþ4gÊðÚì¡v…;)”ÆçÒ¦Æï ¥÷0‹‡¥ñ™hÄX>FÐ}ÆLÄrõãj=ðÕš@QsgÚ`³ ¿" ºMÐö3˜ÍdfÖ^Ž¥ÐÓ"bqnÎæX÷R2¹È9Ü6ºòË gÜÞu>#ë¾ÞL†Aßh¿Ès¶J6mÜežðíïš›–ó£XõPq.r¦ù¦ê¼)aÏ"ý–.¬ä—¥ñ´™&^?âXv$—ÂûN™sÚÅ,QM(òÿiÏ’kÑ2DÎ$Ò£›¹üçhŽQuŠ?ÉÝîÊfŸ—ìKdBg’|‚î"_oi&;—ÈàéÖ&]‡õÁ6‰§Ûa“;nJ²f¢¶ \ä"\gaÓµíÿöšbsªéû¡§}»íRÍoš?åÚ º¤Œt%~ÛÃ<”b?3$k\¥›¸BEcöp8ÆaUÉŠˆ)˜Ç»á\¼’Í+¾ìàK4_ÂÀ’m†(Ž2Àù¸‚ ò½qÝM .hÉÓºfèä \å?B£ £?%³uÄf׬ã?i¬²ò)¾­PÆ”qh(nç÷¤+ÅâKµH.NdjÊ<ÕËo_Uþ¸&Ä«Nà ê†L42hC¡…9u¨ǃ[Ýá³,^7˸l®¹±=ùw]r´äb…ðn |öÇõ8¥…€pDƒ«ÉN·-Zđѣ"BF/h3uE”Ÿ h©pÌŒ^ælŠ+ïŒâTr¶Ž -’HAS)£¦Lám‚r/:áÀ:¦NËSoТ_bQÜ÷u:õ¢J§w¶‡åÆ’FÓåEQ×»îmK|_Ò§ÿ·z•’¤íÍ%ieŒ¸m-ÉçÅ¡ã»ïeË åt/«l-]ºÌÍYòÛÙ:‚ú듦 r«‹ÙsÜ‘#X£º¡dýNÇäW“#%÷ï‘#âõ‰ZãæF1²…邆no€¥›®”FiWº[L!¬ …葜EMÍÕØ‚ÜA²…÷ßç_)˜Ì!oZHéçGy%ø~IzaÅX ákïÈÄÜM­– I\@¦;·Ro]‚'¹sÂ0ƒ{›$çÍMÎfpŽ-nŒâQ™”:¤jÿ36„Òr:µ/Ü+w|Ù›Ix—3Œâ“÷“O†^‰8øsò}©¨Â†W”UwÓcz¯ûK„Û~¼»óÕ΋è’=¾U91'vþ+™¼§õèÉÎÃ'_,®_Ýî<üf¡v~¾ü8þyòÉâw;Ÿ,¾zÛ7¸tZ˜¦ƒ—…ð%®ú%„·¬]iLCÍY©Qpj¹Ô-‡ðY¦/·±/u7:Ú8|ߥÉ>pœsÈ>dcœS|çõ(øÃëß¾`­¸ŽË_Xà3pÔžê¢ì;Õ Ƽ˜ãtUZ4¥YÅMïUoôßóñB|ðh¿PÑ&9§QÅ£+2(P¸žÎ ùV:å¶éb¸ß÷‘®™6ëÞÁý©RÑ0jòh­ëm·áñÔx YµÆ‚s9ŒßºÐ[K1X¯&©‡hl½Zþ†›kéú&ÎÔ‡^[áB@-È+¤8¡ì£z ŽKÙÁëªó ® á³øÜ[BdóVhÑF¥¥Ìyù³qö­FÛðùÎîýgåI™ ®¬eEu‚ëð$õ-n#‘¤/Ñ¥ˆÅzJÔù…ºÉûd·•ß/ÁLl®•À™8ðäò¢2Pñv›B ˺ŜÆYõ3ø‚uT:õCJ?­µ˜‡"gS4¼d¢tÿë$QÄ7yé¦H¹Œ;W7‚°#(ÇgäàqE}3gÆe|bª™|­*¦ ?&DÃÖ@Ù[¿±›@98$V£*ðÍtç |î2=z3=]¬MŽÔ†¬ªVŽ~í{¥c>ðÕÎûìÎendstream endobj 846 0 obj 3890 endobj 850 0 obj <> stream xœí[YsÇ~gùGàÍX±Ú9vwö%UN¤Š“¸ÇËåH,â%†$H‹„dæ×§9zv$dI–“¨T’€9{º¿þºçÀO³¦V³ÿøÿ/÷£L7;½Ùkf§{?í)ªžùÿ/g¿_bg ¨šAÍ–'{ÜYÍz=뜭•ž-/÷žÍ‡ª×•žúÑ»¡\7ÿGµèæ_W =Šÿü¡ZØùŸðÓÐö«j¡êapvà²V‹–Û=©Fµu£Úù—•ï‹=žT¶ne;.úšYÂÙù_pd*üÚ}W™öÝüoX퉥 ¿œØ8®þ¶ b,£|åiC®Ôú`ùgÔ‰UR'¶Uuç@-Ë#P…4ð·¯Zߺµ²õÂ7_˜¦îÕ0„^¦86¨aè'áÖ¨Õüt\Ùù+TÛ-|sšt¾‚ƒ¢ÔÛ¼Á²†^îw‡ZySéÖµó+™†:E5 Ƕ‡ðwÚ@ÍÏ*”Fw0[«A*UÐ4ŠË^²,PaȰ„…/£ê¿Åš–f]U¼hÃná&ÙçD¢¤(ÕgaéGØASjŸÀňþØã¶B˜F× êÆrlºN:y>¯4ö‚µa-‚þ8¿í#x ~Ôà¾Âc,~ ]S—£-jÍkŸ¶º€º;b !®c'°ˆ…Ö­’bÆOÛæ°†¾×óSÆ)YÌtj¶P¦nr¤Ð~T¼1ÙT`F8ôŒ£ 6ö‹£=¯ ­ÄXVËNĶ`3/¬1(®™‚Áh®xì< _h44 ŠAÙÉŒ2—/sf`Ÿ4-|ðÖ_šáت&:Áïg¾Ð ˆ¼D?ÄŠu¨ Qßø‡ØøU¬=Ä®b;Ýö-©ù1L ò„I¹ãIÂЙ-A&ÆB\³†ÏH6¹uÁ’‹ñ’¸÷M^qáåm€`–G±ú:ïG‹Ø÷ ÉBÍ: )ÔyëSý]©Ó& ?‚™ìÐÃKŠŒØõ+)X«’éQAGyËPx Å’~—ìòÐêI}Šz_¸*nR¡ïd!R€¥9§QÅØÚA4m„õ»‡•Žåì›<œôÃN~¬*G ®){µîÕ4@ ÙBá0-›f‚u ‡¢pžù£p>0 p¸ð¾ÃÉçt2B• œNHÌ!†#ؼdèx¯Ü¯G Àµ`í…)@ÉŒÜkÂòl %çxç'E¢1lÅáQ§¶>D8Ê\2y›„"F“ã}ÎËÈ ýüEŠÔ82þ]§œ"¦%žëaa‚!©'G•;âëÀœJo  Kxí§€û1*½e¤œæùDœFú<ä6jþ:(ëaF¶n‡ˆ™QFâG'”‚ò’µ¢¦¯ÝVƒÒÙÔ%à éB§MÂË:Ž”’‰Û,ó k"Á ôˆzá| c¶SŽ€­ˆxÍ„¢ký’L׿@ÁxÖrÒó£÷Rª Š5-sºPìÂcW&o#¢Á?#L=ª0‘"îíÑ7ÆLäQj:œ£ó«â¯Ðvå½OX ãxëHZQJ)QJÙ0b:æÁè#q^Ô5d˜i®c™y`@lfh-, ,C“6¸! ¬ì¬ ó`-I™c6p ‹L=zr¥sÞ<9#*8¸¿mHýƒ€Û…ÃAãMÆLµEØ׌™0¥ÂŒ3¿òœ­rE¦÷þk´¾í‘e´ +!¥Ñ–‚N_%¥°VÞmІ4%~@‹e$YŒñn":¿‰ Q“pÄ|[Œñ~fËf,Šž¡ŠG 1ÙÂt¶ZíòÀÄì[— 6³]‘˜’J¦FÂ` m…ûX ¥, ’õ-«.ß&­2|6 #(.•qE+ÎÙëMØ¥á €ÎG}袆g>z\p:üw#ò¯ÈÎ’CÐ »q¡ˆ\'¹6ÂF:n‰qn6³-»ÏÆr`¸»àM®²»ñ3¦‹I9Ì92,…OÞïMÂçóWL»)·ÆÁN¸»0"à é ©¥%Mð†¼Nl??PH\vVêDþõ"u¼¨ôÖÁ1GB«”+ø0Vtº#Ѷ®§™±"y†Ç/uËþÛç¨'vmÊr6 uØ62í;R•' àð>Tòv^’û|J…b>Üð” ²¦hF¯§9x! :9Bã€f[Àó›ûϰ]v“‘Ù$cj`Òa 4áhØÖÚft5IŒì6À3Hq2K JØ7µÆ‘§óØ ![âi‘üQY‰ÁyJÝNœ¤-RÖc øæ£!­<ב–f=±#JÚp…~ÇaR¹lÑeŸÄÂeêó},ü:>õ>7X1Ѧ4ÑC.ývÞ{_˜¾J¹ƒ÷—ÛäÛL¦±ïvãŒæ»9jŸ”æ¶èÀÉÏRýÏ%'Ý6R°|J¦^”:í'*x`ΣTø¢„¶ƒ4çû!•c15AŠyÞcJ yš ‘ï!LíÆðúD:¿é<”§IéCýa•Õ¬2Zº‰ÂyBŒ@´5{¨$¥1Ž­Þq% \Fÿüaâ‹%ÇÿGÛ¤HºÓùxtwX‚Ïu‘î ©F ˜{€ÄÞßHÑaâ€âD<ûS%¶ t—°|– .˜B°åÝÄ…°í~±AþÔ.|‹eQ:•Æ«|Â¥âÄøXM\|÷ÂÏë{Ns»n|š µÍ=¿K@ILJúS…–ˆþñ©ÏNñ}*b™X¾ÌާÁx÷ßš‘ð^.W)_¥l}s.´ð½Ÿ“÷Ó…‹âøP“`õö/5Å»{z‹¦éð\¾!|G š<þ@!Š<ÆÄ›¿òëýÑ‹†ð ftçºÛÙü¯ñf¿”¾P·M‰añÒ¦ç÷ï°ÉÙd,)FKþÿÄÌw?›˜ÊlÊ©p·%9v"""ˆ!„®&¥Ï9nºZuj9Ë?0ýLÏ´ÒOz¹ƒŠ­½[ Õ¢©UCî^W xNßÃTfZ¬ûvÞ‚ *mk=àoçl­ìСÿ+ ÈÎÒ‘z軆_Dô®îÛ‚gjc ¾eo‘išºw½¶Æó#Ž“ÒMD¯[mâP¦““ÊÆ཮'B‡úÎ"!Ÿ%©×Tmè²çwtíjˆ…®-ÆSirùÕÞòѳùwUºlf*Œ¤”?èwyÝ™=ì4-?½ädF¾½´:0©|…¢»­/PüC“é ƒt“u™þ.îDú"½‚SZüâá4¿õ9Î:¬8?Õã_W¶1XÅG]!¼æÏÄÍl—êûž§Pp’/‚¯Rp+K‡ñ‹ÿ¶-n\ž.÷þþ•T”âendstream endobj 851 0 obj 3316 endobj 855 0 obj <> stream xœí[é“ÇÏg…?B߬¡Ðìô13=IÙUÁ`³)Yœ(j‘X±f/v6ùëóŽ>gz´`’*S»R¯»ßû½£û½}3­J1­ðŸý½8ì=ª™®®&Õt5y3Ô=µ¿§ÓÛ8D h*»ªÓƒ£ OÓVN£K!§§“'3QÔ³ þ›¢~vðWœfT2M‰R40ó` £¿-æzv¯e×ÝÍþRÈÙƒb.gØ~·˜»ŽGÅ\ÁĪjg/¡GÊ:g/æ ω†Ù}lDŠ?à‡ýÐûïb^ãh9»d+Uv¦æ)ßǘ†'Ó.hhö0Gª²5º_Ð@ Ò5°¢û‡W•l€¢0¸R°Å«À7¡¨”: †+¤® wýa/UUKAÛ°~EZ¶Vü¶•–ÕµŽY=·¼†3–­è:f¹(”Ý“'j*é$ƒG˜½,ôìø½„´·_ácG’x](ICÞãØ_ ‰ÍM=;‡—ÈcœfPJzö®¨‰ÏLïN°F¾¾„ N3³§³%°ý†¼u-¯¡¸-™t/°~Ðúç¶ E!¹ ÉâHO)˜ŠÎ³Ä‰I'¿7(p{R © †Oÿ´@(ož}†dðè¡-` îä´@¾+©ËÖsùÄh¤¬Ï Ù`c Ïu‡0³£0òñÐuµ–.l÷g`¼óÊÛ³HÇè»çÑ8C}  aG–dEâÂmÏÀXë)`ª¬&´}Dâc§aðC‘›èÈsE?¯5ŽÎ¥`ºÐÄL‚SC3P>|~do$%ÇVuKЇ£®FM\_Ù‰ï ϰaqÎQµñ3ÏǶڅ|îcpÍkgTp?²¥Þ ŽL&~ËaìŽæ‘£R%º4†­K£€E ÷R3£Ž1ª@˃ǭEGk£àäq)?ǯh~è˜t=w¼v<ø½ï¸ò¤.]0ÔÍö`=¦Ýz<'ŠÌV¾ñuh|ï¯'(á3Få©%(Îû§ñ³ãŽ»óºêÈþÞôÝé<:û-;\ÏÂ÷¼ ›<Œ‡3IM$ÇI˜åÏ|ãaû„ ;ÄXŽú7ðQVÛlGr|¶ó.7ò$4®ã•]#-Í>n'¸þEøxÎ5ÜØÆb½ˆ5d“@+EâÞ&ÛJlÜ uÏ2d3EiØ=}]û^òí³?ÃöŸ¦lL¶tVÈJ¹@ÆàÍ–®²t7ýÉ®eYÃØz›êË¥å)ìgáµëÄýpQÛýÊI a:¯†Åšìmë?ɉùÜ7þ}cå ïQ-Å—9êë˜yYBCô3’IÙwÝ-0ÞYéuiïr;;éíg7/¹ÃM=s'ßÕ#ý67õþ%ýsLJ.4T±¥IoÒ”l¬7ú¨kÂ"5ýÙ5~yóš÷ƒïû1L½ï¿×D%ú”JéÞ("‹¨8cª™ w{NÛR5¥é?°å–Yh8%k«¢–XdQqvë*AQ˜Úƒc×üˆ.*ã’ÒœlG4u<Á¦Cµ¨B†f™LÃO6¿ás—;ål²Ô¦æ}I´˜ñ,å#´U­ uYÐðP6TC`†ƒî'@ÿôߢ²*ÃÁâ"šÆQršKþ„úŠ’òÒRAatœ¡uÿAÊѽѼ½¨çUœö¶Iûîç7¢ÔÐÚ7"œ0!f)“²¥¡c5±oizø$2"i”±}JR7§ÕOÉ4»F‰C]U„$Sµ;Vn¯œi§ÂÌ,GÎ4š©'™ ät/‰‡@ï Wnø,V¯.‡÷¢8C—f!mžÒ!±â’°¶J @\&,š‹« ½Á~„S&ÉêqA,*È`ÆòNòó\2QŒæÐ2ÕŽØ¥"õ|ïÓV NÔ0J“kÁ¢´å šÌn=H¨öC\ŒCÛ*å‚‘! ‹pè*M¹CQxÎõŠ\PœT$*(`;ŒD';iˉ§Z'GCðÃ".åñf we<¦~F„Z<  ØÁ½¶l1ÏÜŠ½‚E'¬¨2T¶íˆ‘µJË%hà êÎaì0øy\2qMÄóTvËB=N‚*æªüX |$¸^ÕÕpöašOšÚ/ÏÙÇA™÷1:)u¦§ØÖW9è&Ë…µ8fDÊÎ/æ¥Ì+˜aQbâ6‡‘ƒŒˆÄ:ÕùÝÛ™ä4]Ñ5¾‘6]ZoI[–±#`·jÊÚ‡÷™¢TÕŸT5U/ЬÓÜ ö?™ê.ÇG¼TíZ³ØÖ´ëDÒp' {¤Ô%•xX|E)_Ù Ç#€){W¡>™<ÅrÀ„0öõu«ú@,³ä¦çòw¦lðC±º²áøÿO=וïíuñÕ僒›áuçKQWü‚u]Ö'Ç·|Ö'¤ÑÓw®AÙe¥ëÎyUŒ¼#Á©©D¿p囀—4ƒ¸lG?Þ¥ÏJ'þYéeáɲ¨?[µ²Î\Æ¢…•ÿ‹ݰí³eå‚HRsÙ¬›{áÞ"?ga¿E~Nú?2Ú”K{Fîü¾ÿ$GÚ¿´÷Rcaå/vìw`Ǽ0#;†wx®üÄü¦ö,uŸÙ³ÆìÌ[¯À?oàXêQŽàsZµÝ¬è'µh[eÔf„J.½§ËÜßSŽ=]òs)`û饋³“ç,^®xÙkþ2ÞÏñ¯¤¶{@X¨6Ü®ÿÛ”d?62ú”;úwƒ|iP¥ é&û0ÁÏËáåÈ_=ùY¹ù“K{·…ôõáœüSê§endstream endobj 856 0 obj 3471 endobj 860 0 obj <> stream xœí[YsÅ~WøzŠïP¾Ãô6ÓS©¢ ‚+$@@EŒ+X‹eÅÚuÁʯÏY{¹3#K¶ʇ”ãW¥¯ð'ªjá¤ÈV6±.=ƒFn:E‹¸Aètp åˆò¢Ï;†m´çs¥ëÉü46wÒZ8ý’7´O {€DH€„lWŽ([RÐAðs¢*bƒóH ií3‰äô! MÒd’û•28C¼øÃe–㋤Y²â»doâÌXz“µ`Á_˜Ö%q‚‚Á½Q9‚ÉE´N¤ÑÑy˜ÜãW!±„?Pé¸ã…vðà›Ôq¦Ñ¢—ÙOÓh˜ç‡ždöPb;¢‚ûžå Ç©ñEn¼Iש‘Ÿñ¤¤ØaŒ|äïWHD}Æä{ÊŽS9OèF¢ëýÔ}YÏ££=” 6©çyésŠá¼¤§%'Ç©X¨ç©ñin<+Ù'ŸæÕ?dFf&_Ì­wL£ˆðLÎÉÜÈÌ]ˆ33䜖Dø1’6Îí¾IûÕô‚ÌL⺶zpŽÃh…²v¶óF­ñ }Xé”mm4[ÞE†Ò¥¾RžD–úû/ø‘Y~–ì@íÇñ¹òÞjYJFa_™Í/«þ)Gsã&7f{ü¾Ñ‚ܰk f„`Éâ=!vpVçÙè¬c³°ÖBLÕµÑ ,ë¦Ív«\Œ¨aÇÕçè¶lð–XÎÄ8òµm?ô§8'ÚeÚÁúÉ4!$Á„R®u°>ðZqðèX½DëĽFÒ“Dɺ­!Eêc;€žðˆèÇÞVƒ7JÊ5ö÷ôC¨¢“œS7@Ù?zä%xCPÕ0 ÀÀûݽÏvöÞ\@5Îhˆ¿Ñ$‡ðld5"ƒˆQR $ÿ‚\ó–lIáÏGrDòú~ òdR‚+… ð>rÒñ £™ÄAÅ5SètL¡šâír EÜC¼ÖyÚå£}9®Ñä+6Ô8nM632 “SŒp1§á×cé hCcÎó÷X6(èyÆëÂÅBÏSðO<4o¿Ë‹“TÆÍË$ä¥Ì@gäF(bÿaoŠìš·åFhY½'úV° ªÃ!΋$ºYJ¡Fhã„E4«„û‚†pV R¸¶õ±'µ\Ó~p„Ëk0íÃ@ÄLÁ´'šŸŸ+.øYW%S4šq úfl¬ÔX׿f4}› »š–—t(Ã@äJ•®À2Œ Ÿü¿/¨~C5"áUª~A’£í+ÖÊŠ¬Lt°:®Õ~&»™÷”Ëj¹ã'ökí8bŽªõ‘‚ëKÞÚ°23³ÃÃ…_á4VÙÉ=òQ3wú§ð^ö;TˆÊs¥¹rQâÖÈ´Çäð¼¿}éËm…ßNI'Z/ñ’]2 |#~lÓU=š*5QfRbƒ‡Fæµ¥p ¸LoûœÄÔ9wÎåtÕô[ÖJ)H®J äuN`7 ìŠ%G4@š5à¹ÌLsåÕ€·q ë—ƒà%±„N5I¨‹p ¥Iî§©²­„¬ìR$Ykß-¾nÖ˹ÏS¸¡”¡êÇÉi•TV1@Ò¸‰àµ”›Dh£2³PQ*f}šè7°ÌrJØ*¼ƒœNÝ„¤s')ÓII\‘éÕˆøJ¦‘?aú溴é$…;+W›æ<Íb —¼Úÿ?…;I=óþE™yMóÐó¹Tç¬ÊI(Oý]’ÅIvv°0RsÎUéÃ,—×îíMÎÐ’ qÎx Ïš‹*,ÒµïÆÿøŽcÞú/ηôAÞx2í·ö2>0Ò]ô2ÞXB>‹^Æ[Gê3‰®ÀÑNC .LÓF¯¼œ „¸‡¡%Þ Â}£zA,V3›KD›'ß'|Ú $~ìaLOI˜ô?ϱ°.fFp‰ý$½÷)’œf«Ükû­&Úõ4ôš5M=ù]ti’Vqb±\Ò8ZÛ¥ªªNŽ!Xy!Å0#ß‹‚ÂeÒôä‚’úfµ@.‘_{]á‹U*Oˆ•ªûïS>Àûy•½áCÕ±*?lOÆhÜr¹ºµ1:Vê_rY!‰n¦ÒPVžGNË[u_V“º`sÜ”%¦n$¡•OËçOôÖ^'÷4\'­Ñl-ÙiY-ÈÊÝ~ýýÑ&¤µí-… É0­“Ph=ßLlå†ùd;ÂLR*ë†{(lÏ9O¸ã˜Ýº i’¸;øž¿Ò8¬.¸ÑD6ËXךô˜æ˜xAÀWX’_HeñJŽjZvÐÛ …]¼¶ÎÊÊT¡¦>”锞 ýûbc©¼MšZ¾IÃ×énêÒå È ÝQ BBçß_É9z9P0ÞWG|‹*Q+¿£\åÂl4[kL'ÚÀštDÄ™LŒŠÐíÀ©v‚Z“'€¬M®’6•¯í` IæÈR¢[Àiáþ7ix×Í/2x¡H·ÆùuÆypšÁjé<á;-¢ÑM¤“+­& S þE;ù4á°Ð©â–9ûü0òÎL õ)O»ás ;œàÀP_’ŽFŽt¡x][ˆuª>è‡FCëß~q˜°6™ –Øð(Ë‘üÆÔû! ÆÖ(l¢mÌ‹ZÛ¨ ªäùçV­µóÕÓÚ\oí\~\I—‡+àzý’ FØ9DT±­Î–*©‚¯î”Ñ â^|#*;´Õ z¡†Š ã'±;óm_–S÷ë.&ÅÕ2Ò1šŽ©øR£Õ æÖ€F“¼Â¶²å 'n¢ÔòÒOPÕ¸eý§…§«ƒ_U èÜßò23! öa> êˢȄm]õ]вƒ*ÖFÞ=d˜YÐPŒ£Uûºx¬\·¨¥t–Hü¯$ý)Œ‹â5!!†:s ©&,’¿I™]Ì/"+XÎ<%T Ù?ærù«âMýŠ|‘½¿ îéò¼±‹ñî\ïj ›Ò:<òô%;ÕW´°Ñç´³L”lª :w~L)~åÕ ;D¥él ¢Ÿ§W2µ¹w”™nW/v¶¬ìXé¯nb6ºU¶l—­Ú¹Y“ʯ‹^LU—î —¯L Œ¿ä•Izt^¼7,ëM/©‹¢=ÚVH_ÿ@zúô¶(Äç«–'Tþ¿ãeÍãܘ_ÜÌíÅ· ŨӹQO~¿çyË{žŸæF¼Þ”[zº(µÄ·zÊqQn¶¨S²D+[r89ägµÛÞÁÁI^Ë][7TÙ@A×ÞW“dã̇ ¯›ÔK/µV‚â€Ûžœä1¿ªùŸV|Zò¬ù×sùMžd±ÝͰgÿ2¥°ö¼ß~7ÞYãý$5îå9ߥÆ/sã#±¾Ñmæ6zqßÏŽo»#¾È¶y;VãõÅÝMAÓ¶÷~ )¿3+ž°íܯgÀÏæ æzÖ€óýûþܤ‡Ù€³åàôjΜ—öTyÍJùÑ%¿m{’Wz7N卨šTŠ=¾èTýt…z=ÚÛù'üû—+4Ÿendstream endobj 861 0 obj 3840 endobj 865 0 obj <> stream xœí[YsÇ~gùGà)ªÈõε;û’*%V;Žã(ôC"±l)E$Hñ’™_Ÿ>æèÙ]€Ða©b³\¢¹§ûëî¯gofM­f þþ¿<Ýùò‰2íìør§™ï¼ÙQT= ÿ[žÎþ°M¬‚¢ºoz5Û?ÚáÎjÖéYëm­ôlÿtçé\UŽþ5•;Øÿ»ySt3ªV-ôÜ?„Ö¬öìü/•ªûÞÛ~þ¨Òóï«==ßÇòÇÕ^¬xRíèØ4ݼ‡Ák¨Ñº‡Êù?«½–ûˆæ4ì×Xˆ#~‹¾Îµÿ®ö¶Öó¯`ØÆÔ½wÜåO•Æ6¾åδ š@ôþ;ôѦn”ãFßUÔFé[Xû›7naD¥ qc`%†goʶØÐ ãhnptãqðXÿ¬¥iœV´ŒP˜f¤i`iúufQÕKQïõmím£g°ÉºS}Ï26‡™çGøçþ¹ÂÅÃðj~YVœàŸ0GÓÓv¦êó²ß~Ý AEËTó–$ºÍyHKCráëÜòE*¼Í…«T¸È…§©0÷ÙÍ£• ÷sŸ¥Âïsácìäá‹]OMt3µ£“\¸Fò ‘ëW¹¤æ"×Ìåêcý2|UÌ/fô€sY!PNGãÚM-±PÛÖ];Û<ºPAmPU¨%C»!ÕèåYÛT}†²N, ‰Š`€SÙ¾£]ÿž†¸sóYó—EýXÉWS ¹L…Ϫø‘v©}ÝúFÍötW«„ùWr¹q ¥ ˆ!Œæ­¦vÔãÿü(Ä‘*æOƒìÆð9/b[‡nB áy¡ÝP¸ÅHsG©^ çç_`¤Ã\ø|ʲ˜œèã±xþ%&ÏwÄX¸f,Ÿf¨ Oñ4¼™¶ÝlpZl8~<ÊÝ–› F8HÝØÊ ž#s½¿÷¸[xܼ$á*®%~báÍÔ’N Yïz n“ÏEÍoás££µ›—ShI.·µ¿r— ÏÙ‚wXØù`ÓÕ&ùà¶2¡ù€H‡Aáiþ­¢íƒû†5“ŸÁH¨“ïÕÖä¯*’"WOörS9bs6ã@U×Ï-lO">ƒr´cë¨ Êrß•E÷¦h²ËÌ÷`žè5¶oçÇÐɱݽ®Œ¦ž·Øóm¥©¸¥iP±ä&q˜: t'µä:CÚê³åEÓT¸{Œ4Ià€_¤²oβ{(yØK˜^ÛŽ¾®*À!ˆ%ˆƒ!¬{$í*Š…´Úª–KÔ·/ì6ˆ·”n\^Pƒ 6asìµïÒI‚Üå˜Ø÷:k[zÑùåÔ¯™.{#„r›wP¬R*Aðd x±˜eP»a*λ@Ù¢-½\14qÔä9 SG$áJUCJ‘,¡GçëpœéŒ»„e%â¿ÛÊmíâ\žæ íÙUkž¿pP´D§‰„XÌxi¸¨$´P ÁZ¤ ¥¨ÁC›–*–‹ïtÒâ Œ)ô>Q@ Ç/" qjtµÚ’‡€&Ï ñr‘»e…3öªª^”²9®œPô!/²QÈ;Ö̼0=TmÒ[hž¡”?æñÈnðXàøžç²¤À½–l€2Mº:ü÷Xæ‘!·DÌ$Á Ö… ˆ”È¿`1ãÞ±ò ‚ï:vÆØ¨:r5Òýe£è_¥¹¢$yô44­DxF{Íên4Á`‰h$À½íbY‰¥„Qe§<)TüÅCaF%gj(‘ö…Ú#Qô>* f•ÚeµbsSHP†»ÈBÊãd=³­âêÈag7Ž‹åa®ÖäíhÀ„ÏOœÂÐL×ÕË‚O¶c{™ îLQÍÛ bAÁ>ãNK—üÛáÍﳑ¤œM‘åbÊñ⮦ֱ=“¬P4ˆ4z1*eNÏÜÙתUöŒ½Ðà(ðT²›)p7A2Œh·‡È ¢m„I_í5µj ä¡M5µ7]³™q±îܼ¦Àaê~þ”v×~N„ÓßÔuÛ9ŒBà º¶!`Æ£[@åõMm`œ¿¢Œ Îbï,Ò@ÑwÀQñäoÓ:”i[MÄÖ´¾î…OpeûV¯ãRÄ^嬨ÚuÅù½Em¨Ú@bí&‰9,¨5†¾ÝÙˆGµ[rImŒ¯äWåq=( &äèÐ'^9ÐJŒIG¡PwZ€Z{vªE Îõt \µm‡©€M´Ê·)„I²‚«¥è[0ÿDÀJª¾šùâx¥-Û†ý¥ õÎÔÊ ÖŸ£H`Y1|á¾4g„PƒdBßÁkÞ‡Oö6)E«ôµä@Ú`~=Šc†êbªƒA±vŽô0+#móÜn§©ÕY]B)ü›úá~§³þ±®g‡ ‘o±ŒIÉ6)žiû”?8Kgú‹ˆ¢ÌŸRFs6¤áÃ̆š¤f ¢^0P/‚ #F\œ·›? ²šQ>/“‘Ä×${aö…QÇN#z-`ƽ¢&¼•’“¼Âà&äÿ7Qù…à´#Á1Áq™g<$4¦l“ÊlU©Ìà¤;Kñœ+É܉…‘PÉž0“?ˉ[‘Hˆ&?ß‘ æ7Sç ´ž8¥'v×>äáÂ=ÅÔè%ãŃÃOxYð ø¦˜68üãÌ5  ™«ÍCÛPî΃§òT“PØAm¦ÆvÉ·;Ÿ|{ŒŠ.œ@¯E1qx% Ò cì€g Šl«mÒéK>Œ¸X”#N4•G3–<$q‘Pú2{Mw836û´!q“¥+Kœ&ê±U$­ g}]SÏË#ßÇ|¦ÈISB"f|´ԔϪˣ¼L­£¤NY£O£ƒÔt„êðuÆ(Šîöì¢`é»YºÓ¨Xáš°a>ƒìj¼ŸÈw‹QŸç%›nÕÄ!Ù¬GóÏs§“JÀr`è8éÅd8ï2,Ñ¿·–v<)/Ny7k¢+Jê–çÚ~«„Œ®­PÀAÑ¢‚Aˆ ‡‡#Ž‹„©¸NŽ-)î:ѾrpÌbP%SÕ)ë ôÆN¾{=¼ÁŽ ï5ŠÆ‘4>Á2“rµN~òHV&në|@ˆ6Å ƒ*8rl¶R²nì„‚G–-wsðÞÈŠ(Ìi]GŸ"ïCaý9µxPÅËÚyé…°4ˉÍ×öæ zî„IÚìdža⪒1âh3yQaó¶îPÿãRµt`kÇÁÅ a‘ÐÖ}.ßMÜ⌕Ð,í ,¿-NSVÙ@ØÇð–°¶ W°•"[G¼‡¼l- ˆàwt°ñ†0C7G8;`Pìû:¦}鯵W#§£{¾+ÁσœØw¦óžp-7]{E(‹§&MóžžC÷ŽâÛ^š¬oÓ¸üsáÿòd2Á~ÞM"ÕÓ|¯³è¸¯e¤ãמ‰õÅÚ³iÑ<FEÎ ãê‚©þiÉs 0¹D2fvƒ–ÆÌÿ›F„Á³‚h““kÚq .nsyç›i’m‰ú:¡ä2Y^àGF±Êó‚ÙREp\™ ¯H¥;8,$‘J<Ʊm…CèfüªLù,a®² Ñvç•!Á³ Ónãð2"ld’œÞÔN]³3áw<Óȳrwk\i&?C…K<./†‹ÃFáiŠS0’k¼A1§ásȂ҄tb­ß°ëoð x¤bx…—9Ù{\áá3(¾Ä¢+¼EjG×u[¼Bœ|êsQ¼XНOF&.ŒŽ§ž‰Û‹TxÀo­6Ýæç]â ßëJœîç Ï»r«“©Vk/³"î/7­ã®'Î×rJ£ørt‹95ç¤ë.3'.FÊÃH!’xyx%^@«wywž¦![, °ö0š$]ÞÄU2Nª¥§ ÷ýñ[þI!Ò±OZ¾¸ï=.ì9hl;›ž¼ñ†žçûÏvû[|ð™ºðáï¢Yna£µWÅšÖ=¨M9Ã/hÀº1ŸÏ€¦ æjÒ€ïøÁn6à;žõo1çGúÀAéã8•bêø.¬K„U y\,bø`Ïáuït>‘Ó¹ÿ½Ô†Í‚ßK}>OwÿS© •ÑDïúS©ëŒòûŸJýÊœíýO¥þ¯½íãýÀÿÎà}ëendstream endobj 866 0 obj 3403 endobj 870 0 obj <> stream xœÍ\i“Åý¾æGì7O O«ëꮎ@Æ`°XÂÀáXíê öBB`ù×»òªÊêcf´G’zªëÌÌÊ—/«šŽ»Öwðÿ{vyt÷¡qýñÓ—GÝñÓ£Ž ¾>æÎ.ï@•èRQ;v£9>yrDÍñ`ûè[cO.¾ÝŒMØ´Ýxüw;ıc¿ù¨ñ›¿5[ÓŽcôãæãÆm>m¶vóEªšÊwm× ©šà¡ß|ØŒÝæ¤‰.56ýܺÐm¾j¶ýæ¯ÍÖ§»¹_:Ì}’*Zè#¦*ò^|”^¸>¸Íד“©YxJsÖ¤ö>n¾œŒù¯Ü—êã>L"‰j´©~ 0¨WÓyØláe4VOòód` w’ºH/ú;¶éM°¦j™d=ƒý÷Ég o´~|0m“ŠNΓZLRÿáÚn86¾u¾·P{ËÕ·®k3ŽÔjL“ ƒ7TÚcܘ»5&I¸÷I$]ëCšò¸yœÞ½ãæ=˜­ó6­èª<>NË\jTµ:M­\ç\Øü˜ž:oSûÓT3ÚÖ÷VíMê „×näíæ‚æíæ9>uÆÊÐä)täÚd¶¥‰z}3êZc²‡4ž1ð{7Žø^ªÒâ:›…ªjyÆvðJpÑ«ÙýÔ£³I•Eb´b›:ý²qÉ:=åÐOÌPŠ.“ÍЙaPC³ã2×GÕö%Œì¬snX´—ìäþÑÉoÁðüæì³Çic¼[LÊóƒÞÂæ:Ñ«ôLµƒQ¬¤‘ø.â6ã¶>UÚzpOBóð3MÖ„´’­Ke[iןC7Ðß0Ü ¯©Ã®ëa0*ãéÁ¬°šíÉWäj06Ngwš†¾€¡ûÍüÆ·ðp Ú¤mO3žt¿".ɧÝ%)ƒà·l_¨yS²¸ÐGy:¯xR\z#û}ØÄÕ äÑÃáÏ`#/\*^Ã`Ñ`ufåI`¥Ê3ÒŽµªˆÜB…ž´r–ßTHÇÖƒ?Y銅mPGTmKåSr-[Yé6Í3$Ó¤‹â»ñìÖÒü‰z ÞÓÊeÙŽ’Š=¬vëF‹V†z¸*ÍÎÅß›¼`¹~D݈©¥MIz1(…&ôJ›Eý‰6‡lêÊ.ÒÚù :?b¶É:÷êZF|@ÞÚü ïŸs_`µ]Àr5¿¤Ã4.ˆ<¹MåêE›¼7f›Æ$ósÙZ…d¿†t[¬¤<]Ë®9Ïð“YÅS줶Y7v¨¬=¦õSï}¶ÊW ¶Ì"èmæÆ‹Gk c,Ö.$FÔX[^þÐmî5~JP 2L=Å0ÉÍC«o`éÐ;=ÒÖ÷ÝF¤Ír‚ /оaH^É$†¹‚gH?ÂâðØE5>èq00>[åw Œø}ššék°ïŸ;’‹Õ doð'PL*(µ\C(–ú[LîyDψž,Ä„$bm?á4Æè&Þ÷¹ßã–Š*Q3Ú„ gÄÄJ?µ±U}¹¡GÛ½$ðp IVñ±°c«áEÔ>êÈãP˜pѯ²˜²‰lËèÂÈŸ /46"±{ð/˜ô¹`?f˜2SZTZo*¥‰=ðféûj·ˆÇT^,`Øë²?'Oç‚×ÀDzBÈJ£xTF–I™gÚPKàW ß^`Ä^œ/-È$Mx± 4{xZæ•Ú§Ùòh?¢j/‹èZníoX)‚! ì²ǼGûˆ=ü\v&X0lDc'à*ú÷ .­³vMr¨# êB_„z•Íü» 3™º'ª~Qõ$ó.AÁ[óTV!’(ò¤Èà+Ü£2°&CHô•’² ¬ZFŽ„ÀÏô×úF˜èC• Á—"ªDUlލr(§Øõ~Í\•×knŠEµ—xóú :L'®öɵïå9Ü/üîÃFž€wþ=+ƒ+Zðr`å}hüu .pIzÞytËž&TžÆûPk>”¸TýT¶ë»¿ét{evôm¯ ]l2Âjæ^Êü!‹Ù÷†+ÿ¸ƒÈ\OÏOµà$¦ÅdָϋLh~©­2Hr07¶lB›ÀzkŸ¢R¥¸(²Í¸ç­ú<4%È Ö ×Ùß øTÐHÎ,]!¦ç0`-Õ+èqÕï,šÜà2”_ì ÚÁŠ&ÉGãqýO4¨¨ÓeãºVÒ[ÅJ³£á¹×–#¤ ºÅd"t}I‘)ž$¡§dÐ*—SqK)m¦¦¤.ˆÄï.ï$S.ŠZ.pèèbVŽ"ó‰'âpÒ™± 'S„ÝHñ$>° ·‡C$ %Ô1Â{Î…:Ó$ÿ#?q¦ôËåg*ŒÛ:ÌT"!toà.ИN98e7¹ðe),ý]äBtéÙ¡Î&‘üÀv:ÿ‚ýê…Ì+t„Ewò뛺°È„`Å$ìóüæºLòU.|T /ráãÒ¼ÈòL‡ó5¢„©ðÝþ?](5_,õ‰cFŒNþYz©zUª*ù³¤Á«….”¾*/K¼þPé{ùÖ¡Tmß‚ abkrzà ÁĉRIᜀ?QJ!Oé(ÝzZ©•'â ]>l9W’‘šƒpÌîÑuŒ*=#w 0 ÐWy ºkÐ Yñ,¨S&¿¡5½:{è…±H*píŒÒPÀYû7Ÿù©e[ ¡ªÈ:ŒìU߀ÑÇz”ùVá°ºêƒ@j¼¿r ³v€`i+UL†Cž›Acð;ØŒ5x(7G¯ßœÉp6c'“ad\d/™·Ôæ SÄÛ·6çG¨yýºf±Î\xÚQuËÐÉ¿éS¯O¦MŒ×“©Sq¸Øš"Ý‚áàÑTr²EÈMÅkðh$.¥ÎÞîLÊ'0å5˜Ý*·©Ó«Ë< ¢" Šsªíà•Ö™ö|x 1®æ3§·æ4´4»ÓÎ<Þ§9(ÑËlºŸ›"Ž8Ëë ¢éxáR]­É¬×*Êõ­¤ÏÔJp›o·d¦ÇÚ£]eÔßÍ?û9GŠ}QØÂ¡.\èãCÝ'Øv Òešƒ’YÌ5ó=Ô˜f€·:éÖ|ùÑ×E“û©.ý´Màµâlç×q¥a‰Š·r|HQŠmûaÔ»Õ‡‰¢¶Q_B_¸¦W_¹c “IéÑá§‘pYœÒ{ïìñäk€Ûáik~9`[€BUJ‚H¾åå|ÀV‡ÜÙ¥˜½äþ÷%i3'Êü'3àß&hÁÊxðöTã3ãÆÿåñÒàp`2vß‘ËýüæA™ä¹ð“R¸¿¦ó­§rÕvü´'úÄiï!‰SüYŒXÖ|ºTX§L¹#|< aš-ÏÿBaúzx‘ÙGf£ÉûX}¿p0Ðc{³-üæ@CNH|È(ù¾üXR³$mˆ”2µÖLâöÅÒ'8¼å”é§àÖèá1|ÇNgMΆÕÉ ~¦S§UV›Ó]az#`%·L™3Wß1tôUÀÒCȤržÅ9IE‡*õŒ­tX8u⫇w;ðg¹'¾,øµ$«'ß¡p.ü°H‘r?ìáÈiþùH;9·&Ýà»[¼Ý" ”QßP~ÅÓ½_ —žž-!Ê „fœÓC§D¬N×Êñ­aÉv·>Ë[„¥_ä(/¼ 2 ]JœrÜlr‹kòï4ºCXFu»7@#þ"èVhÄß¡¬#„{cF˜˜ ßÔô0)¶½×§4íÓ±þz±Îo×@¦©XžFþš¨@¿ˆÉÜÅC.Æ£¡u³e1•¾t%D®¢á’¤›?nè3UGIf<6þ¼!?˜8ÐB¾èøÇo\â¿À ðð'I)7(é bÆåÖŸÁðö ›FÛàÿqÄ6£Œpçg ]-]íªÐµ““Û]7øâ©Ù-Bì<¥!ˆkç…wÞ.ÜóáŸä öZ³ã›Ç\[E)_äë­‡¥lrêËë¨-åC_1 †é¿ý#ý÷Ð:endstream endobj 871 0 obj 4210 endobj 875 0 obj <> stream xœ½\û“·qÎÏ'ÿ÷›wUÜåà1TÊ©%9fÊz3e9¶+9)RÉ£t<’Ê_Ÿ~Ìî-²TâÝÍh¯»¿nÌÏçÝÞwøŸü¼|~v÷[†ó'×gÝù“³ŸÏÝ>——ÏÏï=ÀG¢ƒKûÔ%wþà‡3~Ùþ|˜âÞùóÏÏþ¶qÛžþ÷Ûþþ_›BõZp{7À›ÁÓŸnwqó§­Û§4Å´ùdë7_ow~ó¯¾Ýéo·»/vݸIÐøîxŸàææ»ínàwÌãÔì}¼ˆ-þ¹_îþ×v×ãÓ~ó4Û…}šz~å[ÏL¿LRPæí¯àöëù¡/·ô ´’‡Úýï:?@‹ÎÁÃ]I÷¹8àƒ!xh'Àã[6®÷ÿdéºÞ;C.æ©­‡÷ÆÑóT—ìTïœKûq8‡1îG—OùÐïæþó ^w8‰aóþý£\ ›kôè6ÿ­nç»tíaþóa~øYnúÿy&ÿÄq€ûisúQ´?~~Ó9•/¾(olërGëáwÓ¦·:σûûû¬GÃo_×7žÉú.ÑR~œo¿¬ßûÿ¼#‚úýØÒÌäe¾Uî?;<²çå"ôÓDT[¹ÿU¹ÿe¾øïåâñ'AzZ¾pÓ’ìu¹xјsžƒ öʸù7øÕwG§âãrõºz í‹«2/å5\ê&ßVz€Ð5ž»¸qð¤õaôû8Ö§½iâ·`L?F;ü¾‡M™6=ìRçÇý@›ÜC ö7®¿ŸºÁƒ~xØ?.M¸ªn?aèaÔø~—FÞélëgùßu“ßü_yEÚþgž˜3¦ ¦vu·÷~ê`Nh³û!= ˆ288?Lõ ¥wÚUç<è`ùعQeŠÞ<÷+ö  ƒ q7Åa0÷ËoQûußé@èÞƒãÌõÜ56:_Iüd¼'´…IÇÀÚ9ÄØÐÅmÀ4~ŽHïÒ°y‹ïÃØAU`éèÌ”ÌS&V¨,Í5> ˆ‚Ý"Õ RÆ}Š•Pwóý¯¨+ëH™ÆÂA€Î±z|‹ Ç@p•å¦È@"F#(«ÿ¢¨LÑÖ A­_m4w¹û êL6æ)Ú˜Ç[,ªÝÎÃöÁéqzÔu‚øå±óüBdJÓÀÏãµ xç[¶ÞÁ&Åÿù;¤g±!l‘½‹øÊ@ïÂ5ÞÖ¥‘×Ûµuà'@ßIª,‚ëT¬à"½‘±ái_âß¹ÿçC ]üeâ˯¿â{ü1ï‚€Â'˜§è)¨ú1Õ‘b„'°ø`+¤!`Fƒ?ïàC#Áý«ì<åUð^æ ~›ßå‹¿àÖJ v7/"ZBß½ŒbÓsÃ:]ÏÊ‘~þH¢†‹c"MÖ>ÀN§€Ìb¯è‡bÒ¢á@#¶ :.º')pz_à]GE}}±eß¡‡}hCw‰Ú‚}ìD‡"+% wÅm è¬ ýHá“ìé‘öä•ÄgŸ[ûcVÛø¾§ykªAì¼Ì"ì/ø%â:;‚r´X=Í%>„£ºÜFÎ|óõ6ðÔ²\_ÏŒ#ÒöAqE`ÂÀãE»¦ !W»$Ga( Gæ»W½Ç}œÕ7m°ÔZ¾;tXq~àáþšâDÒ+GÓÅyÎŒ‰çIó:i0¿f·µš9ôK^{](!úNCO«Œú »>ôì6×>u•¸Ð±58Ú¨C Gp£Òs×ÜnøGŠ>¿+ਠhf“:éÁEÕ¥Æfû°D'–sÚÜÛFëì›öu¹Jù…qôÒOª?¤uoÐ’äÕ&iqß…¡ã?p?²*ÇŒgœñÿ9«šÖIU®@ E<´ê¡G8í¯:7*]­®[E*éÚ®§b ¿´ª}6cÔë°†®J™`‹_ŠC4Ãÿ³5|‚ñT_,á1Ë °>(¡`¶Áòlà ÒÔùHúxÄ¢3’|™lÍ÷YÙo‹|õpIÇ N•§È Ž“Ñë‘ g[ALár;ˆÀ¸Š…±áë'9<ÅðZ~ý\¼~^^Àáº'lRš(q8ÀØôÀÑu¥Zú¸¸5*K¹³ÌÆ^ƒ“¬V›«åÉg¦è§‘æÕhíh?ÕbúÑQÌk`Þ*¡»¥Å³›ké'§^ëƒ(€–¬ (9ÍçÒÑù*"£fß‘œ¤üM¦­ ‘oð[ؽ":Aôê…ú8ÄŸ2ƒñ˜†¥v`!Q!+x=ü ¶ÞOžD³ûX—½ÀO Fp)‡LÛ£ömíî²R!jðaÃðÑZŒ]±dFj…«+ ¤SÅéÅõ}fB}‹ñšBdOðWº•Fp†^Ö0–ÍÆ2(4×èOPsê|Á6Eï~¹Ë£…6NdÎ*ø¬á¨Š;b° çC÷.eG×¹`ÉÛ—o¸@᳂½Ì‹gìR6©8D74 ÓØ òŠîã² W"*OH¥ VtF6ZˆöußÔÆ"ãµÐy]ËßSCh¼¾Ú0CÔ!F3P›ÀïtÒB!¯IJ%'ú¼ÙTô×á-£2jÃ=lad¢KãÂÐkÀ¶PÛÊËâ¶+@3þ1OiÊúu¸\»#2ö\Ôf»¬ÀÒ„„¤yž\Ý:E‡‹©›Jˆú&‘SÕõ†ZšmÚ‡ýb;œ€? 0º¬ÒÍÌ­_†ý;ß§z[S³Œ—sàŽ?_òŠË¦È;·$V¬R#m­ÍŠíš¿z"H0ÇE°MfÅÄÛ~b_ÿ#UêbÖ?pöÍÙÏç P¥`7Mç€gÃ~˜Îcî ØüËçg÷îŸÝ½ÿÅù«_nŸÝý˹;»û'üçÞןÂûŸÿËÙç÷Ï¿¹mzýåä±\AJq´ÅÅQ¯‹› ‹Bܤý¬‰»„®¢Äøè=!£ãGöp^k€°:¼ØG·Ÿ>Àð"tý°6<ãKÉòh &¯"Ûá?À úÎÍ׈HíÑÈe±Ä†–ÙE›âÜëEx¨PàuP¡ü ºdPFß·_q9BWט7:ñù Ï,û#p)ÁB@Ž€g¿B ±û@š¹î¬’,b|t² èñ=æ*3⣨õ.ákOT‚ŒÉs\ †ÐÕqÀÌö-ÕÐ<îKöÍÑ·/¾Èr¶ÄÚ”Í;ó£uúŠ£­Îz#ôg烧¦v>*{Þ×^‚‰jÛ "DÏõ_¶†éÎ.ƒ+^†òE±ZOäQ螌Se—ž–Ðö¢Øz-}ƾÎlæ°\Wìï»É([‰±*·h,,çÌEyi)Um¨ôØYz)äa‡¦Ë¸¹yÔ—y·6<,bnœÁãY^ɰ¬7Ekó÷ )Ðo§|H­,èI“ŠN& Ò¥(Wn*ªÝ×9GHã;EŽMæû3R:2¦ æI>$’qÊ;§#óp=;ÿ‚6¤=/ðäX‚˜( Ê©Œqy?çjf¡Iv¿s<`}à«"õEE@‹µO<ãØ]u茈æÜ¨æÈ+\"Üßo ž…¾ÛüeID/–õÄôôĦå)Žjïv¾Ü<­i¹mn|þ b6’­(2™ÆYkЧˆ‹ÉX¬¦Î›Œ’¥WýÄšA‹f¨¾ìÁâ<>bJ&C¾$ÇÈ«žæ±¦ÕÉ·)4ÍwÕ$ð,˜ù‘X4ÏéD™01-jË&&Ðè¯ËìUÊ.¾O,óq"ˆõÊf§Êͬcâ`qÁîÏEÝ·ˆ;cäŠú=.4ÏLäÂdc¼ffia*Zr™(Óœïò›tç«|G4Îg&'Û¾9wAʃláHðœûé—á%a`í¬Ggö´ÙºËY$urUpÛ¢$VßÉyª ?§Ç¢›ˆ…=‹®;ªcë?Rò(%FTKB/bP]g7kÚ‡¬QysXÂ%ú@p•¯-ø©BÎEç›J–\Heýˆº‘ùÀQ:ë·ºY ¢6‰Ö](Tê‰Ðžçã.¶ÂEóÔ¶Ì‚9Ê$ÔÎ7cbv2ÚH¢Ë¿þù~+ªLü+ýaKi:T4„ýÍUñ~€÷eUyWì†Á jÜkã£m¼—ÆÑÊøeÆ?J9ùe¤¼#ùe9 øŒ#è¦9ŠÿÝšò¥â4|ÅX¥ÆˆoAÍ4;l6­MzFîá O5qR\ñl>­^¢iŽ6dUnKsRSâi¶ G†ÏUÉ œâbz.ÉǪ’SL™Å1¯y.®ÎaµáoÐŽ¨€X³À¼Z´®‡k»0:RJû(U7Z[K„®ôí„`´MPç*¡XoÅ¥¿3åÊï"7|t£&®6ÍѧþÔdvTÿUºÜÆ#ô5úT +yGACô]Õ[‚¯8Èó,çšÞ»:Ï3‹If!ðUI£ZOK'=§.²J©âQ± ³øañe¯¼[¢ ¶S8BOBQP(wØÊ™Ç±¡k„ë^¨êÞD¥Ú˜åÎ|¡U9Ô$”ú0‘¡!ÌÏ{$”FŽãŒ“I«›¸2†ø0{UbçDb‰Szo;ßU"ÿ•‚ jñƒ,_J^Âdæõ1Ô!Ú ³ŽåÄ®-øbÚ6›Á«ýÓáû¸ïO\ÄãRƒ¾c3ï]jô™gRÃ:Ê Å_ç9&Ço冮ra1{ $Š2w¸–¦z r9ž8þ¬XÑ02³|¶ÒûœG®jõB‡óG@TQë3&`Ò*DHÅ`žš· ÉÔ›c‡,:λ¬<åå)_̾*›ÖÒ5ßT %Fù§y‰¼Õÿ" Örf¸L36¹ T›<:À¡ªÀSŸƒ¦ÃEx!q|z:cŽãÑ*ËØÊPë°µeéó*ÑògZ푲°™8@cÝ"yíÜÉÂ8MµÎ ¡c[³íKvöŸÑUCaK(seCIÍãv+ô 1ŸÉ/µ­5î"Ó¸Øcªêa–à•+Âf©ñv<[â“[³¼Ç ïð•jh#—{ìgz¥C«£×W˜“k…W‘KUŸe²Q·¨¸uFÙ ëÓЯ&gu,øÃÖQ¨œ-äÉL4yZIÔ\çÄ×èŠúI°\D"©2uQuÉŒçB¦ ž<\Ò"²¯/- >è.Kù±áö\Ú—™VJÇÀ}õ‡Ü^ÖI ImÎÂk#L+$Žkbá,ÔÆˆõaô]žtP“aÓm~Î¥]ÌLÖ:…<á9‘NÞdφùyä¸ñ‘§+bßÚía|æÒß2©vŒkÉ9µ|â2wüVÅL­»Z$÷BÔ­ó“qU*ºS|‰ƒ”†¥áNà>dD5À4ÉÙ¾9ó'Ôp˜˜1EZÈÖùæú·‘+“ÙøÎ,&ÞXœ°’ y³õ¥ÐîjÈK®ðËh^åˆòú!u0ò¡9Å©iZ)Œa©ÞDyÛ•,èÈõ;&©ÆÞPÜ9eôX\¦ŒŸÅîOÝšL†¢5T¾®>2õÐÄNf¤svãíGÀlÍú œ9Çêú)Ðh+ VÜS 1Õ7Œç‘â’ý‰…¡R¤^«y¸nߑ銇Íú,ûû¨tºÃ’d›×›üI}ì\Ê>usø_rOçóD™ ª¨t¢ZÒy‘Iå­'«R• uÖ™E‚vâ¬F» ¾¬$MG­^í%ç†e-ËÜvrö *xñðjìY‹«–C¨Õª6œœ/O›[l–\°ÉMC"µgVrÌ]µ×/†£üxôdŒÿ~Ä¾å²€Ê ™?ÇÄá&ß±£@m^ÆÇÉÃΤzì:!*—‰*:‘ð!_“d±¥åÕK}ÃÒKñp®Ðµyii±”˜«“j ë'q†»p+[(‰Ân™×Éòçµ+ÁÐBqr ¬`C†R¹®[2ÆEð¯QÉ¡4Á‘²×:$<ª%ÙwK÷ÐôpëŸÏ|<+qe\oÕ©'Æl ^T:¢L¯$Ù«rä«Ù;•çu©Ì  ,¿®Sm}¢ºG—Æ€?ßA8x¬{tiÀº­{Ĺ£²Î'ÛŠa]ÔøKˆIÐ!zê±hEôŠ8f>œj7a¯ŒHB¾÷Ñà&s¾ ë£ÂëTšq:ËÛ a–šÙÈ7êØ cH³2Ù“ÈWssÚrÏh«ü°mT ¢O:%ÂØ nIÝ$y d¹ypëü- ŠQ–à C>+šÝ4’K9ú¡ÚÑ>•2^ÜÑN=EƒA´*ÇxÌiÊ¡—9®GÅ)hM£ãC)…G:¹\µqZ¸ä¨ºžtzµ ‘5Vb"çìØþÊ!0Š™Ñ/bKÌ©dsºü„ôºažÖU`Úsm±.Á¸fI¯OÆíµZÂD‰Áð¸ó ò²2ºµNͶ…dåÇHy”;F*ç)‰ã½yy Ö®‘tc) |WîÝ3}Sù^Ù}à¬zoBǪ)Cöijü£@ÌbIFû“µM¶¯-µL˜…‘:=¥‡øL÷ZÜá"…šâ‰Ø­i”ní¼Ï“\çÓ/cÑj!‡TÐbå,NˆãÊB%±¹R°¹hOó¢êu4xB”:«Ž¢!¸CE­U.”ÁÂ*º]–³æLŽFCªÇTížò JZ‹æ£›•ŒŽx²Ã#ŸÈ¿Ý™õá'‰X}­džÎb­@MdÔä›–‡5 á¿g?¶&ÛyO,ˆO*Û)5¦ø¹ƒ\%_ŲÕ':·Ä뾯^¸˜/Ü¢}ÌaDM]‡d_šõeF"Ñ·|¸L{šÙ4”­¬U0ÉqK;?3tûeòfýìj…fˆµØuš\ XmÕ-ôWq@¾2Ñ:òNËjó· $ RJîVDmèCµÓ{úQ&VfãX¡â,½`Ëf2G¬ßàÐ9i†Ã2Œ ¾ìhqš¦oO`F“™GͺƳB ÆYKtç’aÖ bU+#TÓJ/¿þÒ8NA›:u{­98ÊŸ6ΠŽÖÆÆ·:OO4¢Ì&„†[—/6Ž…œh–ð®Q ób|"û¬ù»(ìÁË)ƒfU§TÌçÿ$ï}o“þ«.üx°‘¿gRòƒöùë2ØL}À^c–Þí}NÿU¹_žõ‹9hö©PÝõéŒwúÈ‹=R(æ°©ý¢ZEfØÔœ§µLQ¶·'âšpý43·ú¦Çæ_¥ø¬gË3.ªíqMoîBùÿŦœ/<¨åo’xÎ`R8A´¹[0lîn°ÏgMŠ€óO‘„„ŸâÔ¨ Y«`S†qw;³î ÉæPnSÔ0ÍÌù*ßOÓ2XàŸùóæM9a7ÇÛüá´až¶ÎìÄϨ!Y.ë2Øœ\³H›ŠMFó™5{ø+²[‹Ó1B5™Žn9mœ«¤S™Y©’¾XÑê›Ö¡³U*ø`4ÛŸAX«\Íï†fß—9³\ž©»´1k®¶nĘ*kYúžñZúU”Ÿõ“ÜÃ>wË“Òþ¦ÚœSœ ³go¥<ªƒTÉù…ažù¾Úæ#KW°ó+¨S© =u2O¼¨±áãßÔ™©ôu„fxŸ,°Ç¯—B7ËZ]ý"廨}“ôýKVº÷YzŠ›éÀÌê“fÊkóÉ,“gê(ÓI†xýŸí<¾)ü{ly G¥® ­Àþ–Þ²óT¸"ÁT Z[ @ã8ê qYË6vËÆìlš×1Fuò»0"©]ËTóx⟤ k–3*§p=Z ôN|"Ó¸fT¦e¹šæ‰sš¸Í±(¼XÓ0.›œ­¾+Çú(«‘œQˆ·Ùëmâísp§žÇ≮ªÄx¬HaÛžO›Êçïw<èe¶x^íœU- ž¡’6#•[ËiÉ7 ¹ôJ¿heA¹Á6³¶®:“÷nŸæÐ ±\]ì|5ÂTBœVÊ^”ùºÊu*ýò‹txºµc/©œ bœª\=;)eq(¤þeËŸÉ=¹hïíw¨Ê¡Þö[ÝñO [‡UÆ^«VUE{`+Ë—7*Ã%'òdÆÌqå$V0¤³>Ü¡<;YG Äuž'•ꌽÊÛUh” Ê·>ª•~VÁWO•;¹Ñ`])S)G߬î\ÙªðþýÖo¾ÐTöÝog&õ=)Û w䛳ÿMÔh†endstream endobj 876 0 obj 6248 endobj 880 0 obj <> stream xœí[msÇÎç3•ßpßrKq«·ÝÙJÙUÆÆ6)Û`ËI°‹$$Ù§“ÿ>ý2=/»{'B@$¢ÐÝÍÌÎôt?ýtÏË>Ÿ7µš7ø/|>=™í›ñÃjÞéyëm­ô|÷döhÑWnQWzáèsÙù¾î}»xX-ÛÅýj©wðÏÕÒ.îâ·Ï¡í·ÕRÕ}ïmÏe¯–ŽÛ}Y-ru£Üâ«Êpí.> ýÍ÷ÓÓà+6’ßßU¿Áø8̃Êwð„5‹¿ÁÓ¦¯›ÆCEöpƒ_•öÅ÷Ï«¾Çà>æšÅ=àJ†ss,Õw•þ”‚æäjZµøZŠîàs?d¬¿ÆQi64×ïAD˜–ƒŠ®ÓÜ+…}تa@”_qÕ(øÎ´ Ï/»™™^Õ̲»¦ÈþÑ4N+/Þ•Qiø44væ¶*7·ëkï%}+ÿ›Êaó¥uªný|išºS}Ïhn¿WÚC¿Ú-Nq8x·xQ™–Mñ Mv5qb•]\à´PAžq‹ghkE0:Gd`Ù%à §„¾Ç0‹5BL‡öˆ=hJÏ0^°Ë3l:2©~ñ¥ÀNö¥“ý ¬²8Ûñ”:‘-õŽí´…^²vGÜI‘:ÅÆ±ÅžeK7Mm£©X²}ió Šw΃ ¾ƒ~°Í‹èG¬C­“¬ÁZÅ‹ˆ…ÐjEëš: îgÝ´n¤êõD5*­1d¡³X2þ3ó»Ô|5`Tæ2L|©LíÚFóüs;Û€±#Ñú:a…„Ý·ÈQ­óD»¢æÐûB)¡¯3(èjìVCMŠ ¶ª)Ñ›À0¯ fÿy!-°Iõ0ë-hdüâü}Véel Ĩ¢;»³fÏçÆÔ-q48¼Ÿ–ôЖ¦ä‘õoßíÜýnþâüò`¶óÓ\Ív¾Á?·ïw¿œÿavçîü‡Íñ $‰FëÚ¹~ÞÁzËAáçŠU‰³ºH,ˆ?}<&( …^á#A“.ªìRì?½Aõ¾ÅÚV™ÒûÏ‘ôúÞ)]:˜UHM.ÚH#øT†hvZp/tݸ8Ó/˜6VΠוn‘!tÖׇ}‰ýiH¸v é@îzÏ Ò€i™WÑù 3 éeˆwÔÜA…Pœfçc¨3F—вèbA6 Ôtd[üù{¹ß[Q¤-)Ô¶a¢Ø/+‡àhåÍL‰nÆ#?…ÿ(øœ´?!{G@2VS24©­­é…IiàÁ ‰HQÀD¤aÛÉôÔ˜å0yâyʽîã”ÿ„Ýr¶tV°@¯›†X$•eÏËY‹ '\ë"Ö/EcN%üĨ"‘ö´$U±³öäu®cxÄG¢³’j0Fvlw”q`R£w¯Ë›¦aÞ<ð%oîFg¡ ’œ‡Ú–b B¸r!¡4!mä¡‹ ‚—îÚÚ¸¯u„奄¢€c¢"úâS‚Ý¢Ò[¤ÞR¼aPEX*CSN1÷T =¦ÎO>Ítâ}¿ø çµmàâ¨g‰¦O’”Z*~K9AŽIÑ[I¹Jwó#V®è?” %%úYSw¥c‰el=c—"~ p;ï' ƒt«$×5¶$)ZRu Xä:IC°ðGßeZ8„G!Á.’MA ÊÜ>·@`z‚±Ç„z©½&HÏÒf5Š—Z´òúÅ×EþKí»Ú´P1ø“ z±s±%þ"¿2º|q”,~À3Dù‚w'àÉ·@+†´'$J¢eˆÌ8%ÛrÜyÇÎ'ßÑÏœ9¤ßD•ål’Ha­nЬ ’19›ÊËLOÎ,¹¨:‚kcn¦4"ä´Î·”£½³ÜLiÎy£ÇÄÌtŠè&ϲòõ•¯ ꜯ¡ƒfçí£âgaüЫz"d’¢Ýºê,ñ»äô<è-~R‚sËKûÉ–B‡D±Ø€wOžî„.­IqY¯ó4Ôtj9v'»5”dNå :5cbÃì 6ËŒ´À¬¡í C<8åã\a*¤ qn©¨j4<´~ÈßœçoP+¡¾kÇÐql*dÓÂò1ÈVU§¹á:cpˆ½udœ`œ  —&æ•´¡sD1•ÞÌRÔKÉgH ÓÊíS‚ m•$_“Êé'Ȭ.ã|=vMsÓØµX/ôÝpßR Tìœ'ÚHÅ v²R ¦ 9¤Á-%¼d‰>x¿.Û-@7ä¾mfúè,¿ÉögdRí¤w$)«G“»ÒîºÔ¬“d™¾öcý^Q¿­ðÕÔÄâ7ÜîyÓíÛXx/=ó},ü:^ÝÒö¼ž p<¡kJÌF¤ÂÕ„ÄYì»%©"ÑÖŠñéåë=f%ð­ÖŠã–irc”²I»¬ôd²í:µ}‘J/Š™Yކ4<›À3Ltc>vÄ¥x:t gj79ÇÇ9ϱÁ'0Œ7>›™tʛۭ3 ²ËbR¡òTþúçrz7ZäSX^×*žò]E„ŠGøçIÐÈx6«®%×MãmhÉNN¹ÖXmG±ðEakšßìðÛº?.`µµûÕT÷‡Û»_Mu8Ñ=F0ò<ß³i_2H@¿¹BÖ z2†—Jã§°¯Ãm ãò sò_zÎÛÑ! EDiðdÒÙIZÛx-¤j¸6yV’âàó‰·"ŠéÛe `*û­¬•Ÿ"ã¯yk)L†ýµÐv*œªÆtKy?ýô¯Å‹ÆdýLu¾_ѺÉ*ÔYŠ®qàÛÙîÍë«É N7€[ z˜÷‘vI'hî¬z ô6#hÀíûž“‚§à9h™t­ý)\[mk7tÅ·@?K©æU¹ÛÿwX]GVZ…?¶ãEÄeãÑ9‡Ùx±oþ1ÿ˜_w6·®ß>™”=rÃûI¨;)¯»9…ÌÉîåW%ÞÿµTö^YLd~[?*òñ[—ˈ÷Ûúi‘@¶1dñŊ⊄þYH@ñè xãB‚Pû!.$>®Þïê!KÑ„® Ä¢˜tµœdC±B7ãŠØA‹­²0>–¯`­ñœ²läËX¿›ê7ÆØ†æSÛ›Ò^fὩ0ãz÷fï§`“LòrjøÕäðŸI¼ôÎFvßã¤'Ò¡ŒßŠØwŠ[ƒð)ŒóR\úñ¡‹muXè×;ty(ÇTÙͼüˆãÊÓ £ò½ë˜û‹/è7:öo_óT%&¡×·eZ¤Fi£´Ñ´ÌÓÍ›¸d˜yŸ«½4ÿAoE—¬ƒ’w5=ƒé"ºMbÞÑ;¨–Ö5›è­n(Rôfþ“3åp8~Å]¤%¿é09\8¬w¤qv°6D›6¾f“¨sox%»w*—bñ—7ùå¼äéø‚z|U&ÞšÂ{ÂòªÆÖ«Úd>¼‡os…·=€½I0õL*ø‚Æ3â¨Ïüž¿L ;_ ·ì^>´kº˜Ÿ¿â·W\*ÉK;t5¤ÁŒ'sT¹¦)]ëòFTv·9Tã%MçñøBcÍ×øãk¡yù*¬¥]ÝÚa–FäX\W–´‡®j¾4wõ%nÄ[ŽèxtÆ–·P¬\$Ñ:{ÙdpûWOx­©Øµ RÂH“NWl¦ïg¢@–^–‰ÌÌñ†çiä2%¾3ùÂM}—ÑZò&?¡¯ø•RÕGñ}ó`éâÆñR+º]/î¢Á]páŒü‘å@ ¤kžÇU¼Ü$þ¡ÃÕÛ©¼ä, 6¸tuõÍÑÑÅ{RCÉ®9Ø ½ßÊö¼‡#iqw8{2^”—«ÓÓYð§Çûïø.J‘dëólïïq²þ£Ø:Ûx•Ç’<ø¶H퇴ƒ4^ͬ'Ò…w¸Ä+'óÖw²møëÞE*0åÃÉôóã.Òÿüòâ5 к¶…Ãë‹´Þ0ÐD²ÿK! —nœn_ tÃ=×l1ðnn_Mqî;> stream xœíÙrGðÝù½e×…–c¯—T%r” (•J E„eË&’-$ ðß§»çÖŽdÙÈ6`…¬íééiõÝ3³ï;yÆ:9þÓÆ;_0Qv†³¼3Üy¿Ãh¸£ÿŒ;?õE2eMÞ°NïhGMfŠwÊZfŒwzãý„¥ý—iñº÷;N«E0M°Œ•0³7ìŸÓ®L~MYÖ4µl’Sž#I‹a˜¬œ~ }ôSŒ²&¹Hë ŒI‹O°&ŸÌŠ2GùC…•ß ò~Šç@Œ5ÄÖ>Ÿh HfhÄÄ|üˆÓYW£Ü",l?ÞâÇ…ža óCU¢qy«»ñs Ì‚çä3s œ9Ìc Éy ’xUã§k“?q˜§—ÅÈW“ÅÈ—‘w¨¨_!ÀƤ1o=I‚Ï…D=N©ÖY1Ðö4$6\…àÑE\TeLå5ÚOdÚy€kÄ1po[Ó÷µÃ}hP]Nš6W¢ Û¥IÄ%>°LßææÑêK$ÿ…£æÑðøÎÇ6@§ÝwÈ06Œñ‚Õu|ö»´Â’ ÎaŒøéä•d(3C9¡xЦîôövz»ûÉ«ÄJÈú¯õ&`¤»È g»¡dݼ© !‚šœ/œ-±pERz2u˜gèÙç$p%½Ðž>s˜O-ð¼h’‰´<l,êš›fÂó®¾ûúÉ9„ÇÛLÇžÙP2©ç(wÀ_ÊwAž¨ FÍM{@3'(!C¾ÃÌŒ³©8 Rç#;Üs\ýmÏð±N>Àví¸÷ó§1Cé[àE$¼UÉ9–F~“ívýÑÎ ýpîëÀ_¥¾Ûuy•uÎ áV»¹„+¶ w›po=áJ%’pÌñ>&Üm–ýò³¬ç!Æ ¸Ï† `¶¡ÜsÃá2f~ÈÑ¥¸WÏüö늌…v|·—ño j§áO1rÙLD‹«Õ"Úên·©\0¢a/ÕˆÍK¢1v9oÀYX™x¼½·"ªš"{°7Pldo¥ %Ê2ܺ€”€UËk;Kïfh,\DN²ó7Cü}™ÛÆš#Цɹ?r˜ÊäþÛ\îLs%ÊU›4šçö& W»7_ï&CžÛü<³(çÏÒ¾Åö †‹%õ™,qŸ¬\§ºÔééjÕ¥îÖ¨.[äש.5ù5ªËùHÉÈ3^/”ŒÁBòò*ï›,/µìËK‹ÅtµP^ÎÒ ÿlË˯¾¼\c!mZ×)®µKûaI¦Ÿð0»f]d• éY“^Îl\·‹×‹:ñ—Õzd«.åŸ!±?gÓÅIL˜‡ï:aš%¿Á­Ïå¯SBI¶Úî)3©”\®W@áùÕ)X3 Tí„¾Š ”'øw¬”/u­Ò¨’ í¼„|¤~AÅ ¢ ú•„·X¹'ƒ¦Ròæ^j&òê‹.r¦Ö#¨Aqû_4õ”Cg·•ᘬÒNíüàG]Pä5tã›ÃËLœå ìœyÝtt£2 ¼ˆ…ʼêfý,p‹'Ót¥ÿEƒŒãc–¤Avµ|áÅéH)âAÇ>®é«XÉŒzEÔy+>´ƒ>µÞ£=}A*5éxB%FI͵í9UÌR~07†£p>XC91‘ðŽãñú¸SÚE 8Y‡—‚î.ø‡[û<·Á¶[û«Èo·ö7w–^´·ö‡&Sy¡hÛ{Ý£ÞëËLïÑ…"9…9ÝlØÜæüÙ*ת¼Fróº«0ózMå5ævܽòQúÆ·¯ïo~¿Ô¾`#“ÊjX´ 8¼¬s±˜ÛÎeÛ¹l¤sYEk51}ëS_«ºrõâÜöÊÕ¾oXFWѹh8ŠRûÚþ!‘ÖØòb÷&B6tK×Ë›¥!Ï(ø†{–ÓÍæ› |Ž”az{þkùh[±´± VÚД:þßx„&gO—÷?ûÜþ§Õï|nD›¯•ôFç>qÓùD—ñs¨é|\‚~ëZM™ˆÞsÚT¤Õ~/› mÆ«š U…Âê&H®ÑÚ¶H¸WEÂêS¯ÂV Õ5¾¸$UH zM àØ\`IŠ.Rغ=<ñâœÇ¡9•BøÜ]4š¸&æTË^: ¼Ã».„ˆ„Oµðoe ~©,™^­£C6¼N„<òœÞà Øï š39&)0ê;I%ý^ºý¤ÞDæˆÝ‰<¡3AjížqÏWÕ+x÷ËÞ5Ëèš”Y½©’SzÏ·f¼6÷¶4â 5¯æ…§‹xKÐs$U0îË&£Øku½ „‰> stream xœíis7ò»—ñ¾1ãâ ºF#}HªL8*)r,ëýÀ*eûãà òëÓ‡Î7ólã²K¹(žg¤V«Õ—zZ­·3ÑÉ™ÀáïÎáÚýgRÛÙÞÙš˜í­½]“Ô= vg6Äihê¼ðr¶ùjËÙ fÖ™NªÙæáÚ‹Æ·}Óµª±ôw>8ßyg›µsÛüÒÎUó¾kç¦ùŸ6öi;—÷ÎxnûO;ïîa;ײï„ì›Ç­æÞM ø´âŽ6¦I"jm UF­€lWBþÔ2nm¡A7Z’{ãSñ¬uLgUóÆõÈp±ªðtBHcqI´T­±OÁpzЮùéûw²™84=ÊDÀbzxõród¿‘%ûM/;ë@› àºnãÿ¾ítoJèyŸkÑ Ò{åZ=‰8î­Pù3 ªÙmÁ  WêFÁã$ò^IÄÇÐt ¯J\£Çû°ÂCà !Úƒÿ»Øgü´#ï$âè €êcšó6t¾Fã0¡Iø |Gt b‹çCœ[LQøÙjõÀ*ñd‰ÊiVÎ,#D·à9LsŽâ®\(B|‚m¸š÷‘5ðr†‹@–¦¾#„—4Áy‹|Öj@3 \Å•2¥2LE1êo/UE7:lnþÀ~V5œë€þÃ|hªÙfzè¯1ñ µl7©è9öÀ‹4Eã[T@ Ê6Iÿˆ*˜×@æèÌl,îQGh-À|˜œ ËÕIPÚ8Ô»¶'s1NÀÚ&ýA-èûæ.±OY¶/ČëDÞÃIXI`؉r¡5Ÿ!„B_‚Uë„õ´I”õIoòò÷¼>ìØiɉ€x^g`-gÙž ^…ÇÒ]¦ù¬œC6‹Ä_”X°`Y ­+›Ÿ6$5Z«×Qä¢Ð¹(ñ;¹ûh¢{AŽ–4ž»‚Ú œV*W€`Vë* ®“,¤RÑG VN Ö{Ç 8© ÙD²Ç8ŽVCÎ%Ø*’+ÁV»68P-}åQ‘µGŸ¨:™TyQ °Ñ>¤ ‰ÑTÜsŽ?giæßðõ”g%¿?È1îPñµ~?¸x´fÆÇ½ Æf`}Èø_gùV=úARgòuj<Ï8H ï0´î?º6úý ytúƒ)ô{—£?˜B¿· }šñ“‡5ºK{â*ÀR§‘’Ø:f`×Þ»  À‹°(Iïâ®61켂ÜXd€íÑ0„}™aï'€ä”ag©m†”–~ö¢22_µÞKÊMOñ5‰K7oêÞ7eo$ô÷©Æ,áß+¾çÆôD{Ü`ŠÞ‹ù€^[èéiv‹Fdü`daw/+f¥ëéÚæú‹æ×&±)x²¨²ã X¹ñHÊЬ§î“zÜi`V/Ècöp¼BË£T÷JÙ¯Oðã¤2§0ÑÃÔ¸™!Ÿ§Æ_r#„™½ô´Œ£)ô™äw¹qkÊZa>Mý?çþŸRã“Üx5$,©´‡Âûf{þ?&È`Ì”b­zš8¾¦(>®„EšŽ*vÄÇ÷® ´ðÈ5¥–-—éDË5:Z.òéÐÄœ;pf܈ [ÏûÚvÏÒ&”Ĥ›oaôøq üïzê/8p:¥¹Ya>L8Ýaå>Dª äMÎt4…ô %fY=ô­—L›ðÓ[£ÖàÞ–¤°¿¶µwV>½„œÍ1þO_Ÿ2ÐзÆm ñ¥2/ú6Ð fÝF_Qt±$×Ü¡I·qK.øëh·‹#?ÁÚ2×ë eìbó ¿×oB™š VÍ?.¸ãóÑ©ß0ÒÓ—Dz„¾vKÁš–&£B{ ë{”ud=íý§ñ'q3ìó‰Eö‹ÆWqºþœuœ5&ä|jάdñ㊄78= ºí雨ß,ã)JLÜá+òóv^çlívN7aª óŸ!åP4F2Ö$7b±˜*¤ÔävʸUIDC¹Å*!x©²+²è¨zÞûqPp!“Ytm†´èK²è+²kµõææsd×Îb˜ÀÀÛ©m7¡ú-õ¾¨bž±†×á±Å4úµÂcÜ¥ùÈð8lŽ×Gè¯ô×GèWŤìAZ)%&Z(§ñ_e€x· C³^öòKrV«wím€œxó™ä«v¤ÿ2,¾ ýM"ž…÷ëS„ä¨úý”ŒÎ&T!J†~œüušÉ-³~¿œ#x߃6&Øújd—Ð~0Åîý)Îí^‰Ü„s“Þug2;ð7}-™ÏmüøiâÇ:G§„þ[•+ØThÂÕM oqÍWÓdÐqòÿc"ŠÛ¨feT£–ÏäWF5ÔvÕÜF5·QÍÿ[TóEãc}:¼Qز÷u·T;JN£Ú'—£œ:À1Îþo@~öä˜fÒtÚXU'ÇŒ,JŸ|+»\›Á¬N×K©}c!î‘Y*¹U€BOJÜwNX¬SÝ`¥w()Ù¹AC±Oã…€f#´¦ÂºÐƽҩæÏ<$à‘29<)uÍc\¬ –ô=–œ)ålTX3Û)뇞ê€ÑiàÞ¶Jg¬¤J ú»VtV[c¹(XwÖ[GÖuj0B£X& ?¥ÊÉ^¤fÃÐ)ßc‘ðÐ Êû ·§9HŒ@÷2m}ß<ÃFà2fïP½3,dsÞb>Mqi]PÎlÊ¡6À ”†`¨PÙù¾'%3ï½·±Æ#¸BX¬Ûƒ%€NÙq³°ÖÕ„à›'Ð:az\pÀ Æ`™eg‡Ôd™?@šÒ1‡Øy ’p=HRI8€jÈ1Ï)ÙÎé”ǽ>à<„á=ÌÎßSƒƒkLÙ‚ô·*Ž'šÓ ¬v-æcé´¦SË> ÚŒ“ÀLˆ&Ë ô>òL^/›ü¤å¢D4ZMqF®ã|Å[HY¿sÃUj·'‡…]Eá$öR®1+.e_JQã¼T¤¼ßV‰äéŠÒ0èõX—íU*:¥.Š÷lÆXe¿•(“Ëœ2Uº©3ÛÇ©:˜Ê`½Á"ÍÈÉÃÊãZ¬á6ÆÓn°s8*-5¾º(‚Õ§ŠÂÀ²ž'Ü/ê5™XŒ)bkZ¤$!A+¼†d¸r‚¼|]|Mׄ¥r÷}ª6¦‹NÈSÝmø¥({*‡KìMßÅúö\ÐŒÕá½¢½?”R£)š/ë±ÉÕÖAwt¬îÅó‹¨OF4ö¤’ä(ü©‹—ß}CK]:w`ý†N6…„» .H3•W«\‡ë{óÞ3±ŽRöQ"ÄûÖ×—4è5•$?G?*z…‘ ç{pQÑáDz‰FÃë૆Md‡æ‘½+êøÃJrÝ~æ[¡TÆ\£žû Ñ”ÿ_î˜RkýHEéAŽEiº&ÆøÌq‘©Œ« éŸJkÔª«ŠÑñ˜AdÛrÌtY©¤Ž7"J•(îÔ>`n—lÞ Oˆ´R°ê/»²!q4ú›ÒN”'Ý[IE¡(yuÃ@7wBã³g0Xµ•æÇv™PЙ7öþ!]²ø£Uä¾LÞy,|FŽ•/Wí…KVËö|õoBÐ5"¾.këw„øÕ%€ÒßâæQ¼T!ú„ùak–›£¡Àˆ95;dÎ51¸áí¯+uR^ÓÑâô5‰Ø/„‘vµpëçê o Û vjtö=É‘íLx/Mêb®PC¾¡áUqFŒñ—›ƒ)<~À9¦­¼—–/WÜŸ€¨’6¹ÒíÄM¨Ü[€C€øÕàÙèœú Nš—ÙAkpÞEîoùzHذˆTÃj¦ö+Þ3<§ðP6bˆpÛ9vXv`éž²Äñ¾v·Ç×ÿ‚Fôå}ДrgWµ´ùK]™)ÑŽ—ºÈbí´ã)]Ñ‘ð}ï—¿€¾LR}ÄÃLd‘q<‡Ê‡…+J¿¥Üe°8Û*‰§p‹Ó°Lþ‡Ê“ŽÈÅÔ7Isæ“Å"m|> stream xœí[Y·~_ù ƒ¼xÚð´šW7û!âØI(v"o€ vì!í.¼‡¯®_ÖÁb±»gf%Y>’@ÐîL7Yd¬úªŠûdÕµfÕÁ?þ}rupïqýêìÙA·:;xr`ðõŠ\­>=„!Þ¤GíØfuøè€&›Õ`W}ô­±«Ã«ƒoÖ¦ ø¿o¿ÿ Ó¢«¦9Óš>Í<Q4& î\Ú‰£UÒ7ã{èœMt\‹@<¿ÿ{ÚK×kpüPVÄeÒÖBš7 –Dį́E½1m}\%ÛÁŒ#‰ü$­»>‡Gðãi¢ÑÈÎGðý~ÜÂK`*-kÖÏàë÷<Ú­?Æ){ÑÌ4)KôT^”‡ÏäáãòéǤ•†òûëò> ”ïÔJϪ÷üðhéáíÒòß6ù#ˆrc†ÖÆÎ¬6vhˆîB¤¶ð¾_ˆ„ ÉÃ×3øñPÞâ³cøÒ»‘Á lA¦[_1=?$-§ÝÞK‹&UæEiâ£ÂÍ™<<.OôüX´é30¶Iæú·߮aÍš%eåÅ%óUÙÎ#a¢ÌSƒÇwŸFË~oÊûË¥I·òðª²?é‹_RÄUˆž—¡GzÁv¸½EÓ-ܼ*ËNj˿㚷K,_T{R‹ÂGï"(6´Cß%‹Š cÜzêqõHšCã|•Õ'l¹…yŽ˜Œ0H)FiëZžeñŠÉ§eäÃ¥ã_._ö>§K+¡/ÏÃb†‹ŽãdiåË-zÎ.êÝ7’ß¿®dÀ*ÕâºÑ]ËÙ½pøÑ7t(oÄIM”¼äÚŸ‹j/+ÕÆ‰æïf´?¨7’é¼7ocÛÿl|üÜF.Áñ÷è\ï¡ØßÑéפ‹t ð.û‹ÿ‚ÿ®@ þ=‚û2ú«²Ÿ/åáËÃý#³úŸ ùc½Å$m%ÔAt ™„9«ºCôÐPpókC=a²ƒÊ½ðžç/@¸oaÞá`ü’‚MJƒƒ¯r3Ÿ8Ãè“<“˜fÇÃ'ÉvÊ@3¬`È/“–}ÚÊ»Ga¡øSÊ|Þ¤,ù1¼€)a¼R<T…éÑ=]7¶‡ Ø¡«ój‹ ¿Ç•žmpñ@<¼!ŸŠKß4I~Hå$ÍÏð5,.vîŒG]âp û8ÅçHÀT9 ;"pÊ;š÷=í¿ëzœ{ ;§×H@¦0çÚO˜ ©,l±pE‡)mCάö²Ù«ÑØÈ“ÒXó° KâM0?¿—¦Àùè:dâµ¥ìý×´®sòC X†\KJ¯†¼j"§ ðáÈÙ൩2ÿ‘f6?QÒAO ÖLN:˜8‡‡‘è¬ø[âÅ£19’®˜~x´ ¿Q gD ë)@5’ U¿þMzF°\Q§'dÌEk¬V;’Í1y¡Œ›½õÁ6‹flÈñç¬X°3 ²è6âðhÛ6ò1ª5= ÜÑ6“ˆ\ÄãUÍ&Ëb&kÓ"‘ ö1Þ!f`¹jHà-¡Uèç@Ÿê%‰-'“¤ö~é1Yïª%…ã-õÅzO‘ñPPR6D̺j( “xJ€®.æ™#+H;›Ä¨Ð®½ CÐ,V†Öùl4Xw2øã±äè¨>5ôhyùœrz§Q Æö=ŒvX-rõA¼ gô¥x”¥äóÑ¿4 Ÿðàߤýúº3—ψàoÜž[¯ #°²^Še‰¦Ä²™1—4/|É3¼V®ÞjTœƒ§Rs ™‹i)W’‡Ê_ŒÚÔTô$Áγ4ØgiÈÔM§ÃÏfQoPp’¼$›Š­÷:Ü‘++ùût…À¦m®¬7h•)àÂ7ìý;RèPœ“qª©.á3Ÿïº{¼娾ÃéŸüøò÷|Ýœª/‹G» ;[ïF– ÝÂì9_§÷E_€Ý©ãz^êÔv'µ7P/Ü/Ô5I]LN;wvGWÚ¾Yø.J¥§¢›ºªá‚mù’>ÝMà0HeßúªŒsÚ¨¦©²»bXÛÒÇ {6ï­úóùáÁßÒ¿ÿáR$endstream endobj 896 0 obj 3905 endobj 900 0 obj <> stream xœíko7ò»QÜoÐGm`mùÚ%ù¥@Û¤‡;}$.Š^~ÊI-Åq,çòïofø®V–ì$×à.,Ëäp8œ÷ ™7ÑʉÀñ÷ñbïë'R÷“ùÛ=1™ï½Ù“4=‰¿Ž“ïÄij½ðrrp¶ˉU“Þ™VªÉÁbïÙÔ7Ý´mÔ´§ß3ë|ë]?}ÚÌúéÏÍLMáÇ÷ÍÌLÿß¾ØÇÍL¶Þ;ãÃØ¿šYà63-»VÈnúC£Ãì®|Z…‰o›´˜6I¨µQIµ²‡ü± ¸uzú]CKÊlúVVÎ2ê™´á%®šžÈ,“‘-µ*¼®ÖŸµ+jD|hц±Kœ…O:ÀÔ)ž·Ö¨Ê—ŒzÕ÷¤î„'™—LU_t˜Žw‚c¨ø& V9 Á!*ܬ:_;†ä”•܇`Dö´AÒЯ¡'„%j+ªgÑ(ŠÂBûⳚΑ=DRÖ‘“Â.£%¥½Ó®«à† '”}ÒL7’tC ’€pÁÊŽ¸ú˲ ñØ¢e?¦¬H‚_1S.I!¹³(åÚ©A8&6&v÷ŽîäÔP|»9´ýFïX@ê”ÓÄP²$E¦[°‰ sÈz2oºBERÈ’ädi, ©‰Âå™W\Éäœw&Qžp‚ËœÎ>%`0üUíýˆ6ö‚‡Q”æ;bsŒ´Óœ¬™åªÑ ’p;Oz7D¢ä^Ú¯éÕÀ¥™à ,©VJ16ú8*Beê ¸öZÅ#ÕHÈ„T!9,BŠ!sèÅZCÍÖÆ]XÌòÁ%VwIZ›öjGì!X‘£ â-ùýmŒ8:H¥Xþu’œFñ'YE24E>K¡Ç)ž…”ÄÝEž±¸Œdä˜ %?Óq/ÂbCÈ]dNAd@¶ÙS­!61|!£ýRõá#;ñy¨Æ{Ý‘>MGú¦!s5&gT%oJ˜PŠërê’7ú7¦ÙX’CLL‰Ñ¶Ä¼pB!( ª"]Ö7Ø Ý&ײ¢:_• —•7º@Böê¥Nœ¥ÃÖ+;ªÓØpý û8Œ™1!D¬"X­Õ é: xP–Q Z‡„me²qjmדú:¢TÑ{,±òè ¯< %wNÈTyÈF(˜G¡QE‘?A%c!;‘žr1*öѰM‰•ë( ‹GFOÅâæðXU ÔÆÆ„.r=²>Õ+hð¦¤f LÈû¶„VM¥JWe‘Ó‹0›2p–¯íP@ÏcmâÓQ1¾búR­”` ÙúnÁv¼¥£É1B¡Ÿ$~Ï–NißPƒæ$wnø(_¤?‰ö0›º>»¶tæy𺠖-Ž>‹–Îã<óS!òÇ<ø÷2¸Òø^n¼,W·7…®¸ïLƒïò·D±4Ÿ ÅÇeð|¬·ÅN´;Y²ºÇÁHÀ~;•ƒPM^Jꓤ¯a?¼W“—àÆé{[‘aC"Û3ÞoŠâ¯² ¾Mº1ϧÑЯ©«zžMðŠzŠ4Sú†7… Cn“ip•OÇú†ûe·¿¨W‰sŽ ª™V*¡ïí±Þe·U@N+·•݉Þ䶵ƒÓ%ç.yÔq•¶ó]WV‘/Žë‹ãúlW§wðVHÔˆ§âZz“fîážýçv›bÀ “Ë‚|Øéûݦèr›ò[ã\•UFI~Çoœy°­‹þ>_µÄë ¨Jûx7â”ïËÍÅÞ¶±$3ë@Ò¯8e«T§\¼cÑÞó;””µP™Ox3R×'`,æŽÅÉo 0e­ê¡É®B‘Ë3Ö­z­R •Šœ@ß$Â]JJüå®7ÊÚœôÇÛ‡£ªâ®ºj.õ7õ¦Yû€7¶’Â.#¥P[C©kÂp„º×Ôsõc!b[%²«*·Ð`qu‹ ;bÞ¦æòLùÒA åJÝú>LäUXIêP–!pˆ¥®ôF½Ê-7tݨ^njÐÖ‘ƒ©@D©€ê×ebØ+v’€v5¼DAö¡jE²I-mªúcûE‘šƒ¬(>Z¿ÄèFTù²Û9ºUÁ6 ¸¸Aùº.½x]±½!z€>ëÓœÐ%Tã$Ø95*!­·Ÿ(!+÷ø¯szó"Gœë¸vײdb,*^Œ„¿²„ÜÀ*–¬b97Ízòq3(ŒÀŸ&ß#j]w7jwʒ΂c Vù¯¦<-¨I/ÂùŸ`ÙhÍöª“H‰ß@·ð„H±¦c!•ñlë1É‹¦’t­H;N,›¡ŠVjî«ÖŸÅ°D쪤Ü%wz°r]ê,¡zÿy¥luQù!/›îéÞå?™%Ï9“Ö«Å÷c‡ÝcÐyƒ÷¼Ò¹°82+Ás>ŽÕĹQNk€Åñ0sZæ Géá,áåEA~o¼ö2£ý.óìœ+{ÚzÔO΋ñ^ä½×çë²èH ülnê»ÓSaÜYÅË©AO*í(«â¦Œa,Ö- ¦ËŒ‰®#­™²Ž*„Õ¸ésp*=¦TC1÷wðC0èjœÕ!ñ˜ ¶²TïІÙÏ6VT~UMÿÌߘ øsL‘^Ý®]£Ó¯²QmXíÇô'²Œûqìd ðx±þ9wh9˜„éKªòßNUxö˜bˇDø"¢«uÖ©:ãìéFv†ÿ)zgË­$1×±>X–oËWæùƒ2ÿ{ü¹ >B6:R ’C¬·¾ÐÇ1áÖ #€p9]öƒø¶žM&[pžgLëÙä %w]Æ`Âb"Ôm­S2ÓP·ªau¦>¤gâÃs¹z&&:’Ѿ‰2ßÓ¢Ð}(Øv¸0µá²˜?pý-½m«×ußÄÄÞǶމǽz1AP底ÍT%vþc•ß J5úÞ+>³z}{Kÿ"=oHï4ÂÄei¯äz8†›Ôm–ø.;Ñ?)Z›ò_$Úйy/l–¢N=‰xÏ|‘žrœ3owÓtô"Øägš«A—ƒ¿ÒÂéué²j“Э½Ý±]×™úéyywCÝŽðÜ ¿4ÌÍDö¯ÿWiú.Í„úºáï0vv ÁëÁ z¤€\ðZ¤ìQõðo¾T®b²«±nŒZ´±;ƒo ôG¸ß¿{a³Œ™Wü“e±/2ô³±ø°©2=ª…ß¡JUêÖz&ÞZ–uTu DCïO-ì-UÐú—âÜú‹Û#JU6ðFê†e쥶W&· ¢â]hØ¡$J жz(‹}SA”aŸZ0ÑFv+IH¯ÿŸK’ªÒøR^|é„þvB?je±.ÖÒ)«+ìý¶/ñd5fÛžþ°íwéÆÞ¹ zì-oÒw*iìýÿþSÅendstream endobj 901 0 obj 3361 endobj 905 0 obj <> stream xœí\[s·‘ÞgÚµ¿á¼ùŒK n3ÀƒSeÅÎF[Ù$v”J*ñVŠe’Ф$Rrö×oß4ærHɉ³)—|gpm|èþºÑ8¯wCovþ'Ÿ/^=þÖ¸qwööhؽ>2ôz'/^íž<Ã"ÞÀ£> Éìž}Ä•Ín²»1úÞØÝ³WGÞ›.п؅ÿ~öŸX-º¦š3½¡æ³S(ýóîØïÙ™>¥èÓþËÎîÛÛý3|þuwœ_|Û;¨8 Ó>Aã=¼±6ÁËýïºã‘ë¨âÔìS|ˆ-þ ¿<­oÿÔ,m÷_A³ƒëS \åÅ2qäÊ4 ê@Õþ Ô±®LàB¿î¨ ´’Fµû-;B‹Æ@áÁÁH÷?bAç,´ã ¸ÃÖ]ÄÆóûßÃX†!XCÇ¥GꆠÞ4YuðZÔÇ"k˜c?™”Xä®sRz¶žÐÔ8ؼ2è’Ý¿AI]@w·Û¿„.Oü-öŽÏJ+”Ò–°PÐï/;þ|³¤/Wa¬\ ê;èz¢TÆw1ÐKœ©Ù_cS XŠ“úõ9öRº;$Ðþ%âH%Jø’ŠóHÊÐ_ÀX®á>¾Ã÷0¼èW4~ÖwûÜt‡8Áú¥ƒs¬Œ Gè+hý÷ÎßuŠÚ¦ÔOòo+”¨$bÅê7Ü‹s^¤ŸGxW ×g2@A-B„eQ•9/õʈ-`3wRÐ.0û/d^§úE¹]b¸müþ]øË‰’iîIšC@…Øû¸LöaF²øÑqÍËè\ ÉcC°´Î[ÚøƒUðy™x…°¹[l}0 f^â3Æ ¶ódÏëÁ=©WHçg Ëp¥ïÔ¸ï2ô‹ Õòly'­½®›ŠeyÖ¡p@•‚ê“ÍîLj7{è£K‘v» ð…$|‚Bø¢‚I4Lû…/¯oÚz$¥GRÀrQÞ\5ÓÍ‚o„—ß_®Uº+•~‚ž|'6MÞÿ¦¾ÿuyøõáý%aôJæµÔ›{W/?¼.ß—oy´`\?h´ùk[¿z°e¼¸Îh@mÌšµy®Ð=}ÙÈ?—UO[±+lÁfû`[eŸá ‰дp”2·å þUÙTkuµåÅU7‡hÔNFê¼¾?Ñ+Äö„a~øùFÉ媟ԇÓËŠ3ø˜žWñ­´EUD·kÑžv8¼×bÒÓ\BûD?e4P}FÓÝ¢>V“®Á°ä\nŠÈ…Q [Ÿ5ÿœËMCå=ˆ‡‘‰“XÞК^2f(Ç1,©mÓ‘UÕIýºÍª\`Òó\ÛcS-/D²¿•0}-=Qà'ŠËE´ßc±óc¤ñ/ç4Îùc!R¥©i ²±ÉòPXÌð˜x9P&‹wƒòá€P¥Bç3JÅÚäQ`eá»×¤þ«NÑwr®ØãØLV†¶JM ” Ÿ!XQýˆ/"¯'¾v$ƒb…â53}¤ÛÇZH’3D•'^ 4®SqÁ;²âKR‡É2ÃÐóCÜ 1]{ØY²‘±r-cÝŸ6C‚Š ‰-¹²°tKr=M‘Z¦Æü¾àp¤pžØ8¶Ciù- ÛÓ½Z€5{—2Z ª£ýÁ!„NhÞ¼Þ¢UƒTË’!P鬾çÄT;0MyAqöµ¦Ð\ùëk:$êºq"¾žöb!\–W;Q3@Ã&Ñv&GU ÄhiSF 5Õå–o²™Îx¢7¸}yE®…uÓÝÃ6S¡ê×Ä¡÷ÿK )Æ6hÓW†ß€ƒßYO3_Rråë},LÝÀbmT•©êÁ®¸ƒØï/DûxôxN*‚Ð:ZÎp¢"(+µêp£.Æ@¦¹TPÜjiinf9(óˆüY5–R`y_G{Qý™Ñ*¤3xxº­*nÌÀÙ˜TiúÝ5iÙ áÎÓÒE&~`w{à0Ð"‡iš^–s/îuþÁ^«˜Ä±7<à“Úk Z_OhdÛ>e4óuÅ‚¿ï¬€’mje²¸X–xGäÊra­ÓêøŸ2‰±©7c±yuIOyh8}Eùú0y¾jê¯:K0³`@ˆ¸©ãÉS6U/5,šÇÙêšXûÓª› ŸH ¬ÏµþñÕ£O6;íuCÎcG S«V’Õ¢×)Éšƒ^ªi«kÉckÌ͹ j-r”Á @ˆ‚jz„q8š¶zŠœe¥…|š ÄN&f·Ü*5y ÌßûY—qŒ ºÃÃ5… ºj=óGFåÔpÄŸKLßæcUÎíŽI¡y­‰®FæÚ×´6q ZÕ¨CJfÕBŠõFÞMz‡Iß§K²ŒkZ Õçg¢|Ó´D(ê"?‚H(’1ä¹yë0ý·2ö«Vü¦jOž­óóÄñìÖC­…:Û†/p+ÕÖÇÁ’PUXa©&˜„ç"t—Lõ¾³]PJå ¬Ä‚ÑZe ‹Û$Ú‰–Ù„W^¤Mf1[FE©w`ÔŽO&Žóø[‹µP;Þ•™x/¦§D³9öv%’ˆ/ÁK#I„¢ãkÔ’½2v~Œ¢0#>ÒâDhí8¿lø‰g¯›F@‚VOt†¯”t=íL7tò|dv„ÅQÑ`s3ñ#£ k:ŽûêšfFdl5Me6YOŠ÷š¥3¤"åœávÀCùW<Ù¡yÐ ¬|¶âŽY <!G6ç§Ã¤¨°ÃÁ_Üû¬z…¶,¦å=Ž)‰ÅÝëØµX%$5ª!k÷ˆÊØ •ó´Õ(IÎ=µÊnj5Ñqd;/ä%# Šõíª›•wÎL /eH߉Q„Õ@CU46Ž,œ6çu«k:|Çå3OA>ƒX9:°:@õ½Ðfå´UÙÙ™Ã%3k5Ð2°ƒ’ÅM‡yE9[d‚‚/tXü€;ŒPˆšFí¦-RAΪœƒ&YN<΢$>-ê'k˜0‘ö•}ÂñŒqÕ¶1â£+Ô8{g°Í«·6k2C&©ó6‡‡ƒÉì?Q^ß‹ÆÙþ¡\fþN žu¢Ù1JÔŠ‹•ÌÅŸWD¶í|Q;0ù~i[f3wÊ«™,K(bôšÒ°ß<%Z?½¯'&Ï‘‘¶¾§ÇPÙD­7 –`˜n-XR‚»EçÔ±ÄéÀQpÖïK´NÃO ‰ÖûE‹†àU#Ž L6S±CÃŽ‰¥ zRåéZKœVx´¾7ÈRaJ¦…ÅüÀOvŒÝ$Ec¢Ò!,JÀtÄ-&æ‹§vç1ÃFðØø…•֗˶2Grˆ¼ &8ÃNv³±Åi_ñ˜µðÎà«,Üú–_ á¥Uã7‚€)Ùm‚®Nöû^LšU’ë'[Pd¤kP(lÐhzÇ)!ѵñDÓzDZ<ûÊx©,­ÙDÍÅ—PaŽç"¬¼º¶U£A¢§xŽ­®zð9`;ß²ÕàO­ –3wCšYÝœE° OÚCVËòétV$= ®”G~ž-Çþ³ºYU’þpsui mè.Y œ稪Ľ¼ç–ž2¶Œé A¢‰M5ަ¨QüiÆYMU"d"¹6XÜn£‰­B$Q­ó«]ÑC³XŸI™²[U–Ç«fí™ìþ½£T¶S³<tc‹B *¨´NŠCZÆóQÎ=$Iˆ—£Ž3 —3¥¹¨²ÊdèäïÞ“·œáB"â3X™UÓªÚËB«CUH2°3S¤"¾kË,QÈLófƒ˜àVq”£¾&Š”¹×–šAfkGâü_²¾žK:ìܺÍÔO” q­ÜÌ©’¨=TiåtB‚`«³C>‰u%&©ÌH^4ñÖ?Î){ü¤ûJtp\½„Q“ nŒè>m!ï(Ù¯Ÿ}sôz*h¤¬OàqH†¡Áç4zÌÂxñêèÉÓ£ÇOÿkwûæîåÑã?ìÌÑã_âÿžüöçðñô«Ý¿}ýt÷͇f˜ºÉq?xZÎY¦›òòÛÃM@3ŠábœÉ¶ÃU µ9>oÂÐ?ÅøL¤0©àá˜.Âæk|Ú-¶5Í-…eŸðnM“ÌÌÄH–réMrÐÛÓ(± ©·ÃœyW{•p“]ÁÑ5džÏ”8ú\ΕúzÒPB^Ú‡<ÖœóH‚w•4„‹¤ù9G*ç¢õ™â6Rév”´ŠâË8©³'¬40j=^5tׯQD$â@¶‰5_¹FÇtg’±‡Äi¶¶ªçô.÷“&Ùҋ纆G?2u¶fþ°:[8Ô¿RgÿY©³—kó®yÏg” IT+þ€LØœ>[4øóEu¬sÛˆpž»ÐŽ—ìåíPFùïç[R@À…&mBžLM$ *‘TåŒþˆÖ‡$’ò>?¼”'kÛäQyH4о®§Žzç0ƒ¿ˆ4ü˜ÜÑÈj¡ñyÀ«,¢3/:Å¥oÄ ( lJ]õÙ˜/S”Èl{äWZ[ägÒÍ”I™21Ú¼äØô}GMظ8Ö']¾ž'µæ9ƒ ˜¬gëä+]è}bDÛ4wdÎ[»DÁqO¶UÇ\d+Î[üxEir¤@Žÿg¬:07»ŸU79¢Þ@juz–[ФIVÿÓ;MgKŠeæµR2/“Î.àC’´ÿ䌣5y[!‘ñ‚RFnÝVŒUDÎSfJÄd¬§y=¬p" ®1ÜTq_wKJ^â,³ìQ áÆX!u0fÿ6§7Ay½8Iš,b=oÙN¼CÐH R)C(Ë4|t5Å~ ƶὛÐÂS« {q_`«Ñ&Ä›íÇ)`à ÚŸ˜@õ„7š¡ºµÁFiÞÑ7ô>z6µÐÓÔ{ïõ˜®ÕJûªÖEÔ½v”"‰‰ejzKV™/`Ê–~uôìó?s˜ŽƒIÉBÊPìǨ’¨UÈ/sß”šD-Ã:òž ^¥Î‰á3#‡Ã7*L’ÍÓ;EcèìÛ¶™8jlA½È®Äa~±®$Ï]ŸhÆ}Ò•ó÷’[-V‰LU˜/_„/·%>‘ð¤“ìÎÅ…ùƒÏ% Ød¼;Ãܾ²\L=í–qÅOëë«•×hÖ"_™¨ùóœøSÛû7¸¾rª„h­^q/©œë\UÔœVF+¢gb²~%¶|ì-ߢY&Rx*ÍÊ1_ÇWkºÞ±ðÛÀ\Cj4r±8¬ž cG ½SAæ="f è³澜(c„—~š#Õ+7ew³6Þ²°œ¢.’iÂ×̨íTò¸6øž÷œÈ“å@I‡#-Æ ÎÏ‚xÝJi~ìÛÊ7FÜVR"ï'^3_wB!à8ÑÖHÖÞé F)3‚™»U"¬Ñ”aý¢–KûµðòIýº–ñÛRvò°ö:•øS='‰F?_þÄ_^ÈiŽ:BýÌÂEqû+—¹ªÃßt4>k¼¿ù¯`X™wƒœçÁmImoêÌ<¸U”­¯«z”÷dØ–k„HÏR:ðK+c”à ’E«Ö¾€V=™LÊ3A275Ñ#rÖ­o’O­QÏn’ò;‘Ý_Å5Ã{ؾŽ'aŸeçÚsøV–}ø6R ó“6L/·õíNÿ~*A±ê0é$#µN> stream xœí[éÝ6ßÏoûG¼o}ò[’my»@ÓLÚ,ºmÚN±è…b2W&+s$Í¿")R”™7i“] AÄϺHŠâñ£ürY•õ²‚?ñÿݓŃojÛ./ÕòpñrQcó2þ·{²|¸ ]¼ ¯Ê¾êëåöÁ‚×ËÎ,[ïÊÚ,·O?®ú¢Y•…Yµøÿºó}Ùûvõm±nWO‹µYmÁ?Ÿk·zOŸ„¾_ëºì{ïzz÷C±n¨ß£bm리êfõ¸°Ôº cÃ|ÖPÃ'ÆExjëÂÛg´&íuÏ/ šÛ¶á…]=,pHjå§4â›Âwa¹Ö¬¾ãš*á-ÌjT§0OYUµk%dÕZh3a8>X¿ú èûN†l‹$€¦­DD`¦ ]g~ÞþˆßÕZü®©ËÖ‡ØÞ R¯ƒ´áo>ô^ÇÖµ­Ê®î{ê¢>-L`£êVoº†öf7p‡ökáI ø¨C÷ðó~èj}`Þ­.`göCÿÃÐ'üÅ{Ð FCË%ðr Cj\f> Ÿ°ØQèvUÄé?.b×ÀWßc[ °%±J/\ƒÚÂ:8?üÚNŠ92ffu¸¹á] Šâ€çzu˜ó´ Ì9Û„ïa.ÛQ‘S³zFöÀSF®]í´H@ì¦÷¥5¼'@ÏÒˆŠÏ¢¤ƒÜ\¼n˜ ˆnj# ‡nÆ ¼á8á°–抈Òqšç¢1(ôk [ƒ”ØY>¬Zë É$í‹Nïe¹ŽÜ®k[6meˆéç°gQz~õº0žž@Ö¯ KB¿€#Ôáé »CƒhûÂépKEÓ¢¶ºòI“Øa "©k²â'…y¼e ²¦Eî§Î<%C?o¤u%¹ƒ4À>µÓJË{Hó„m?"ÅgëG·JL¬£¤%k•%ŽPélÕ–N Á€a¤Õ¢ž*"ɸG]Ã{¤wZöÇ*Ex.Œ€N#A>…88n«âX¸kÓ3ïG›ì ©4Ì•³D‹ FÎQ›Þ“&RëÈðñ6NtǵÈÿHwà܇=ÈÎ )o4-hw®“rîÓÆ¸A¯ÏÒܲi¨ëÐÏy\èC §ÚXÎáٵÙÉix9¶ñ09‹†©Yl6§u4™ 诔K3a‚®e}²s ®ãŒ™Ê̪¶,36†É¿‹iŒÜµ¦+é¼ÁÓ ¾5Ϋl£Ú¤=™$Hžä<³Áxtð*é^;°}À{ƶe£f¼A}‰¾ÐxT§dûI¦·ÈµØ=hTª…ïOyãᦫPI¢˜ìÀM©DK<˜âh@ó1þ ï,njî Œ¯“fïk…íKÑA˜ $Òwj7˜:_‡™ù<½z®ÑAÀ=mVˆÉb0ômt¨¶lëÚӤ§´Â¯|,г¿†‹Œœ©È„·=8ú°i(Ø‚®“㊤Œ¡RÄßx»‡ª‘4%OÓ¢6å~S5eWY‡_'Ý,€21"=;м(“Üê5ÉME¦7ìv[2-YPÔZ­Q]mUå Ä»-n„“ˆ¬NAê|=¹ÇóQ5Wõ)ÂSË«yÕIܪ*üÕrç¨eMšÎGÃÀä “’yº?QS®4F…š<4µ¨ŸÔ¿åþNS¥£°Z„!ÀS]”³Úˆï0}Z7w¯¡‚Ý–x V ü œK¿TÒ‘^Îc#åàT-Ä >Ý_BžCã4v-%ß„]™,וÃZyh˜áƒœðrÅ€mà/1¸‹øÄND;,5 ò—P˜ci¸”© iêZt Âz¶’õF˜CB'¨ðJ^^f)»$è™ÏFw=ä&å#ªá8²D€A³º'Íçù8äý~ì˜-§“ÈF‚K²q<5èZ^ždp‡ë; ¾ö¯Rû—òò³ôòöž5%™+DèbB¼9÷c°íµ<1µ!¼»µü˜welFèE’,£Ò6M9ÈIWp’?÷Uos±+ÝÂ;kÍðâpH<°…@ñ6nò´Éº–v{ˆyŽvà>£”{®óUµC zÝ»YËrÐlŒ´]èmþ‰hâ&D 2po¦çx-*¾ÉõŠ@ÚÏ[ˆ,ò•TFÀþF¿% 3ËeƒëI-ê ÉõaÒÞË­ß ¼Ð^ ×by-¤ï^ËMâ÷b¥íÄZÈa¦±÷³©ý¹šê™Èy®w ðûÚ{ÕñZ+"Z sÁ›&?‚yªÎihy²ãµtœÑ^ð~1q0t€ç™$\[tF—¹³—<h2Å“ÓNà0éÜñH}U†Â! ¢ˆx µ­?¼©Ã`áûâ&†\ û1îÇžÍ ¶ Ê™+‹{>Ù÷Öyoœ –¾tººf|—ë@œý!ŸÚ˜Wù©€Ç¨žžŽøI´A½ƒ'>©ÍùU+¿|1õ2ÙéÉærŽfF³Z¿ÐóŒÇþ„ZïMuÜèx’‰9UÄ ¨Å Õ¯?a‚°?8“£û? ÂIûvjÿ^^>M/·øªSÎdÒq¼šŠ‘޳åÉÜw‰ÝŠX5MAÙΔÆ]LQñfò,¼£P,Aç›Çb¶'Áظºâ‚_Âè,Ë¡ÍÛ•Wð{)¿ayÅ5fTᣮ¸o†LÂ] •; úÄ‹ûΠw]Ê5ÎþÌDí&åüÐ*¢úHØ ¥šÐy¾TãÜÀÚaê²éE;rÀŸd‰¥~ËesÇÕnÈP"‡¥ä)"7Ÿ|óí‘@ëß…¹òJI·Þ´’“UM‚ŠØ¡%Ën FL¶>»g+Û?[@ÐjXã ãnÁ3±‚Šª¦žù˜¦næ·pÓjÛµ»Õh0òö­Š¼åGUòOT¹†‘RX-šÈ?_6ñ޳æ‘?H˜àT_/øÝ# "·‹#¬º3|‹„¿¿Œ_>­­¯såé*ÙÑüþ%_PàΔ‰R&¿kâû@ËLkݶC³¡&õ%|n2Twd„_‚5¾fÛD²ßOh)ÂÜŽY]]z—ÌyTªüáçÓeœ¦ên¸ÈÛôch;–Cr侌n€fXE]ˆ¢JºÔL«ÈÌ÷¶ëK®o+TÙËíÛ/¹rAæ`py#û²?Ì‹×#Õ4Fõ ¾|SEXßÙø»ª=vw¯ðÒ§Šƒ;ÈѨ ?g’éB6åÓŲw ÷œJÀs,ÿür;èàNceÞ¹O=? ÷’Æ?!rÿŸ¿Íê·•ާVÏRÊMˆÃÏŒ§ É¹”r ÞÏå–šü 3ÊwƒîãGL_/þ ±ÉâÇendstream endobj 911 0 obj 4049 endobj 915 0 obj <> stream xœí\[o\·~Wþ½y£Ý^Îí¡’&iSNêÈ@ZÇHdI–”èâ‹äØÿ¾œÎpÈÃÝ•R·Mð´Ëëp8œËÇ¡^î¶+³Û¿øûðbçŒëwO^ï´»';/w VïÆ_‡»ŸìCoBÑjj'³»ÿ|‡:›ÝÁîö£_»»±ódašnaÃÿ¶éžîÿ º.ëæÌÊô¡çþQhýçfémÌjšF?->nìâëfiûPþY³äŠGÍÒ…Žm;,¦0ø*ÔX;…ÊÅ7Ͳ§>ª9ûˆ_‡/Rí?›e­íâÓ0lëVÓØQ—Ï mÆž:#8êýUècݪ55zØ`Ã0ÊÔzpÜGмmmF4&4n] ÄÑ,á›ñ=4tΆq\hî`t7Âà\ÿ8ÐÒ¶5HF,”qš@Zú ƒ%V;3iV/™VC¿»ô~eÇÖËϼ‹Køqº`¢[<‡ïg±Ð-^ÃzÂŒfñ=|}?ŽáÇü8‚Xq?®¤ñ¹ }?ÎåGhÌŒ}¢[saâ$îIá3ùô.U_7c`žGÕðuª>mØ×–VDÕ{©úFõA®¼ ]¸ìºFÅ™4¼¬7ä oT©Ö}xœ½/./`[í4®:90©ËMêr.S_®a$|ôA¾Îõ¸þD$M/¥é|(â L:uíÅ ·™TÑ÷\šžë.˜&=JeϪäïÉH‡©þ"}|QkºnÔ8éÖ‘žJ)ìÜÒݪ÷»Ë ºniñ¨á>B´cXöDÎ ì4J>}:ãO²ûªlñ“|RbñSMðÜ|ªÕ?ÊQ[Ó›ÅïG=ÎüW$ÿ¨Öð°ÒPqü)—¹}¬Ï—;ûž,¾[EŸ‰rÐçQ©uí„ÊüT¿Èû½Š¼Å†ÁIÍe&£¬KÓŽ^e’9ïtS[\˜ÉO®XÿUª(…I…Û[êqu3Åôª¦=³ÕϵôÏ1€½è‚¹iƒuÏ%ˆC³‰1±ó¼‚©¤-z•Û¢k1C¼wk¸ÂcÞ+÷hÌQé×ãÚÞg b^˜Ž9×ñ ¼p-ÊÓ§Òt?5ý‡~ ?Ž(:¤þ ¶ÕjWUý»Œ”¨Ô`_á`¡­?' ŒÐÙ™ò`nö•?p ;ùJ¾¾‹GÊ}ÐÛTu5‰™ïj…7µ ¢c|‡ùªgâ V¨æK"û]£UUp†;Ÿyh>p<³ep{qÑ\ãbóÂåÞ¨ºè €—¤ËzÈ özÜÑ×5´øv It„í: îãuC;˜{²s/T@«øKìy$k¡Œb â0ü=XÁØ /˜ԛϵôuX ·BaFôC‰–<’cª£s^B¹¢CMKC‚G0¸´ÌWäSãÊzæãAã@ßš ™0ÐDÂÀ¥íHï§…Çúè{<¶¥³Õ©nç¡Û1ñc ‘ÂòúGÐdìßʧ4È o§ÐmôªÉ®¶…f¸ÈB,\56z#á°•ºù1-¥GGÆÞƒ2¬€o \nÀÃþ‚wâ-KâÑuÁŽzažѬ‚ Ò8¡lÂ1Ôn jöwHY°04Ô9þ廂C„ÛABϱ/%Æ®E±‚¯/Ò-½EREZ¯˜^UVý¦ÒÆžG‰ÇAµ€ýxNŒ%r?ŠÚ° AËÚecAåu±7 COÎÉÀ÷Ãÿ=Ü´·JàHX ðhÂÙBwVóØIæùc ,Ûȶ+7ðçÔè4‘×áy…‘ Å%/Å5ƒ•FE…ä®ù–‚h2p-Ò½ 0°kؾDzX:Ákž îz ñx¸‰ŒÑ nl~e8.ážæ§·ë§ÍÂíÀPMãL,Ý„2Qˆ¥ :‘RâIÒ“¼âPè3¤v*F ûE ÝØ¢¥ÄsIJ̵v5Ž,X‘]¡¡E¶F}{Äü5H¹ìt˜, Q)㉲m‡õOð^³i¯R¸ÍS1±Ó=GG‰‰KñŽUì=È…íJö¶·)VöÏY²_¢^ ­‰+Åý;븧 v}&Ç\ðF½mZ>`‰£±£ˆIˆ<’SAkF1:k2Sùl+ dè€IO&»×´À˜u¬Ï$Ñ„¤|B¡ø zæä97â^ÎÆ8´SzkY$”2JöÙíQ}g[`»\xßb7ò4Ô)ˆå@‚ëÐæEyu׸Fì´@Å…çHN<23ˆ¾jã(ȵ“0Ïin_A3›9 â×'ÿÃjÏ#´Ça£=ð–KaYXf¨#‹‰ý¾‰CNö}»FÄOŸ˜™A*'¨£>*ÜL%!ùK_Dm4*m%`gG1¦mŠ3”t†¾FŽº`GŽ+îO*ƒ~XëÒ‘ÙÍ%qä3^Êîk ´‰¿… ÅeåNήHgÍg“­Ú)Ǿ$k6nÈg6È–·ƒ"kYGŽ«¸CØ—@…a™çmÛŸI&”éRôwzÈoG¢ÊãÎ÷(Ë3á¥Sí²`A¢#:·½(,ø=£ÀM»òâˆËpÖ;Øx6q’!0\hª2K¥-3ðrô¥éna¡‚’Ü$ņm”¢Ë4Sî[Ï¡w;qÝû„Þ_s¼½ˆœÊŽe(l÷$ƒ4k0ºŠ}>¼`O×´¤ØÈpt…½×t'Ö…ß›†_¥×†¯bm'›‡_b£jsAHOóØÛßh¢GWÀE7lŽÒ¯Ÿx/!Vϫݮ³¶ÌŽ­ úÓÔö9Ôí‚Fõcap ¨;IÕ›†¡î À°íä£äwúz{T{2¯«ê®ÊFºiѨveð#A°3°ú·†Po›)U…™½­ê×zy!ç5B³;.Ç5B¤ð­6>uä•âP\KÖ¢š•<'Ubpq‚ÔÅÐY¶zEJåí'+²Ö' EãJ̉ÁØs’3Íž+‘¶µU|8çbŒ»Öh ÛÀÛ7µ=¯Êå¯>gÅ~6"}FÆI ÑA¢I9EJòÞU‡š[Žšј¹Uý‘âI\³Û!Æ6j_¬Åðõ.¨¶ÿ€j@µÿ;¨öÇtáàÜ@‘þ­án ¯Z³úhk)VÛJŒÔmÅ»X„0g,†8¥í¦0ð[g]œOvDõ*›JpÔ*Ã0"H"}1\¥(Þ«d“û*v-Ñd†U0Ï«CEóŸîÃÄ—˜ä!ǯ«ñ?M;ù„i¶†¡ã$LaÙF¼”ior9>——kÁˆ3z×¾ñøü˜s¬V€’ô9ú!‚³ôˆÕ9†e— Võ­ÏP½ÐRC¯|´¡%¢è6`»xòá#Þ% qŽ"B¦âo:ž|2}„ômÐO¿ŠŽq¨ °êÝXõ¶»% C!TËBUƒd`L“ëÅKboÉ1PAÌ‹üâ­ly.^ÁÉžëŒ:PÖðQ‚">š{`m¡_²íôÎ7õúJ¢D†mŽÌ¢ó€ÈäPè”ÕV"V*Ç\Õp™Q"“í«”Fçû4ˆ]_Á_ô¨s4µ10s45´âûŠ¡—›0Ph%ÂSæÆPôAaŸ{Ûg˜k‡¨Ìþ:¤8®Á,>oXóH¾ç*a®Ý€8æ2†¸ ¼«ð¬Cîk1 v lµj$œ vìú ë‡<@×¾_Ée–ŒáJífdÛ1àÝVOnMXF‚™ËH¼OS#ó¿ÐÆ>LbJcy4HÆh¡9Ë,Ò¸›]u.=Z™eÝ”—_íFX‡ŸÚ÷!—êZ”—’«’:ëÝV86™~Ge¥ƒ{+­¬™¶C¯5Ô5sX,Êk‰·Ú„µ¦ñnØZÂ×ÑeŽW¿S ·ƒÿSP•óœæá©ŠD¿—ÂuðkÀôÈøß:úʪ ä.Øçüu-þêJÏv-þšRÿð×õ<ð×ß(þš6)Ë"¾-ä™öå½Bžê̾¨±-ñ²š\LyW^Þpý žQK}HžÙÔÿtÂp÷Ë UΣ{ÆÑ b-øÓ;_¦;zɇ‹©QðéFÂÍ`ׯ6ϧ2:âÀ¼3øS2ÀMŸ„ñá7òaBþH†ß8±‡YP«3¢~ß Ôúƒ ÕY’B’+ÀYf MœƒÄ1M4Eœ3ô³\†,ƒ/4õðS #<Ó fòÈž/›¥ÍbÔ:ã0_Óãᘠ’žQ tEÃðìÄš!I0 aªa´ÙenŒ¬÷œFâAOÉ ,)”¹]„†.à µ Ñ ™B oQ>g%0uúk€?e—˜ 4.V­dOù ¸[¥ ‡8ã%!¬%ÒÆÐ¤€vS í 눸q3 ïDB ‡`o…’Z½9! E)f‘Þ"šG»·ØìÞ国J÷;²å“aæŠ&ð˜Ú©°™,ôÞ\%GÜÇd  mIöÆ‘ú))b¤§¤f›‹B™ë7'Ù¿/’[|Í ‰Ê9W°Öi¶ã”Á7 ÂýóÎCQw‡»m%-˜)9ˆ5ÆoFØÔãå%Ó<Çæ×©j‘픑¯9éFÂQÐðP s‚Ä”`)ðt4P ëF• LLvºQ¡â¯‹1êÞ§„þìºð…¦<&q³RéÉÁȶrƒnùY¡~^c'ǤkÀ¯19™Å$ñíÆtO¸M—àUÏ7úPuIh¹ÕZñ=€Í•ÆfMÂ9äêrè*ÝœÈvò´¦\zy=É‘WÁ1Ùh¥»B>c¥W„Iò)¥×´—N÷Zw'4ÉÑüÖúJôâO"±¸ $¡ÅžQ &Ë|®QpУEݲ^;Ö»OÇŠuÐ\*YÇØÕèEÇ|Þ NŽÂMIÓ¡¿¶éªf¬:€þÅ}P£Dåôù0+,Cd›Ó"Xßýù›QèqwÃÑʱÖàÌïú\PЙ´ ÞÖ¸žžL™ädyþñʦ꤈m¼ÐW—Ì` –“´€ËœŠF R®ˆkSsV¨=Ù˜Ü9‚ÊàС‘M/•ˆLÙÍrUËšfZIô‘ùeõ3Šl‚BìÒ­K‘¡Ù[}Už÷jæ.ñiÌ/£`V.¢°À:rå²Ö»@žÕ¼K‡ þ2ʈvzé;ÊkyiJ G|=º®UÜó lMßljÕS«ä?ÔÉòÑøs;¸¯·#žü-¡P4{±C ù—ü •¤Ù2õcé¯ÒMñ&Dçz;76üZ(m˜ 9et9l1IvÄ7.w\FîúŠF(ÞˆdFÝá-¦ËËÁ÷Nr äYML.Ñàô‹„Ä+CL¶òŒ˜¤ÞÀq´o›/ÉøtZÿ/;KWŒñ.’/‘n¢T@$?}N ¥úÆÅ'†Û‚îž/.¬¾ž:ŠQw¿ré‚ð¸á?Äs/ÿ˦šràü /‹Pçu…q!é ¼ùû(Ôß}~Ó—vFç4é½€S!{¢e™á«ºLç4ɳÆiË^5Š?×k#`TÌ;$ŽYI6#fq¤å(¦üxSˆOŒ/Ê·Ç>œŸ\ûºàÄ»¨â5eõQ“·)3nU¾Peò6¿Ï. ª7t ­ ¤À3‚)è¼RFf$C7Çûz4'¹M1ù¤0Åí-Q$)´a‡+–ìòá4¢S£–!¢{žÖRj${Ídj ‘™·b°'ú+ ™§"x)¤ßC%'•¹)ñ* aâ#ô™òŸe™;¶R¿c‹é½Édò\e¼£€YÔd2[°áêCsE2¦“¤t«^k”jšì"vèÃæa (©øÒñ:ƒÝáib©)"®ˆeöq¡uîvÌãùlçïáß¿Áw…¯endstream endobj 916 0 obj 4720 endobj 920 0 obj <> stream xœí[éoÜÆïçµÿˆý¦¥¥É¹8,Ðqâ¤.Üø¨Š&M‚B^ëBdIÖEÿ}ß1o’kI†R©X¢æâ;ïæÃ¼©Ûyƒÿ…ß«÷³'oZíæ{g³f¾7û0kiz~­ÞÏŸná¯a¨î›¾oíÎxs;ïÔÜyS·j¾õ~öâ¯ì¢®ÔÂÑïeçûº÷nñj鯪¥Z<Ã_VK³xŽO_ÀÚÕ²­ûÞ›žÇþ]--¯ûªZêÖÖMk_Wšg·p/œ§O|QÉfz‰­ Œ¶t¢V@¶ÏW~[ñÙÚÁ€^<­hKš•§´ãMå;xS‹ïaŸm€ ¯ñT•-‚sê¦iC–ˆU­qNÁvzÐ~ñéûgܲ%4=KD3»Ný´õ7¿isñÛÖ΃¶ÞÔ[¶‚ðW/2µ1ó¥nê®í{^„¢>ª°Ñ8»¸BѲrŽaç.Š©¥?ÏAÒû(Ê2Jˆ¤:RCnσÀ˜nZ}Š ÄS/ð8×µ‹"€6‹3~!H+- ·nþs$Îñ9¸ÇÞáTªY¬`?„éï”PO/Èÿq!§ãAhš{lšÆ2÷ Ï¢P϶f¯gæZ׎Ì}ij?×ѵ÷sgµG€=}>{òüïóóÓ‹Ù“ÍÛÙ“¿â§¯¾„_Ï¿šÿiöìùüõz×*u+®¥»®vºÇÕ†Ýk(·žJR÷›SiU«’ÊL?ké3­kjõ¿ ¬Üªœ¼·•r躬¤Qhb@?V :h`WhZ£Àuc{ŽFãrpÒR÷° cgiÀý[M&‰§*±&§Èæ6 !·š y7Ù-Êë”Mí0ѳOCÿI'’£#´—pžubG?A‹¾HîIFƒ h`JÓ«ÎÐeÙ#–Îvä¶äÖûi_pSE¼õ ù,];¬CÀ¾ K¶B»¸Ä“qÉ!ý[š†±›w±6TrBÜ-D3 à¸×4qŽÇ¸/6`ûwJ7è܃i<Áò6KÂ4=)®¢`{ÊZõ`¿Fw© Õå.ÖTRö®#¹ƒ?¤ÙàÎ@€&­#C)ˆ Cdˆ2sÖøeþ¢å1“-" Ì§7' T‹ÏØM—C2&Û{fIò°ð;ø½Á¡/Ø!Ç6VÊ0KNþRY´bcIÀH-®É áÙÇ`sŒgqœÁ·a0ȼA¤ÁÊ>êŠô÷.,±ÈrWHZ)ˆT뉸†H›4< Te”l„EuÅÂkŽGKP¥T†¨ÜÖÁSà)÷ß……€@qæ(Q–‰oçÓüáÔ¦‹8˜¹¼Éô¡ó‹8ÿ2Í¿Iƒ×¯ê3A¤U§¹€2v÷)BÈàe|jÁHoE­<–KñÑ@ŽéE=k­0Ä4Ñb3ÊeCIº<¾Miíy!ëð‚™ÃH]â²E¹%ñ‚¤†ÆHóÑÈâsóËÌèsxTMf-û‰®í\ü°Š6læ®5¹r¬Òí4xUêÌó¿Ö–7?nÛSƒi0A%5Ñu!W²¦À&<ú¦%l¢’½«ôdñA =>ØÄÄÕ2P%*+çL—/ƒj»[Ö͘\H«›IE+®âZ¾ñImù•¤GO¤z–:£Muoy¹`H¼-Ù_*‹Y”s)ÁÓð Ñ7cnšÚ¤Ô/«Ÿ^ÏÉ凔<ÊæÅÄàHroŽôÊ÷)ÓD«è¹RŠ HÆw¸¾§›>Šå†’´ž÷ójÓóTªNW>«²î—3RZKºöí‹ö¼œJ“üx}s¢MTçM¸Â1FàkÉн¸¶d–ÆIñÒJE¢£IÆT“Èûsº2]›8N篺H`5]ÐëaÒ‡³bdEy$­y¬þŠzÇqm$ÖÒܵ$FvÏRQ†öTVSS4høÒ’D¦’]Ûh“ºCä®è§ëcpõM‚Ôh;4QT•Ëí–ýBq)¯òìj, 6-`ÍLâQê“·z]ÁØ}ëI‰Œ®¥ùQq΋9N¡)}´ÖÓÉ®âl0$⯄¥Aì®w™Â…ºåhÒãb^åbB`TøÈñáV—eƨPѬ±N.òIÂEãKš¿1Œ ßAûܬÃ|[—G¯é?|"u®~÷_E nžÂà °aØ|\ zXŸßòS¨1NŒýugʳGÀQ·ñ_¸gô8“o'ÕaÆYõ€ÿ'7LüaâøvéWJëï‘>OÉéDÎDr‡“‚wœ'Ó¸I‚Ôp·csjå¤g\:øæû…ÿ ÞâüÎ0'¥™÷ñºº»º¤|ÓèeËBÝ BÝ"…‘äZèZ‹%w©Ðœš?ÞÑÿ’÷zö_­h°Éendstream endobj 921 0 obj 3279 endobj 925 0 obj <> stream xœU;OÄ0„{ÿ —va³Ä±K‡8„xäL¢:ÄU)Nü‰];‡¬ÈÉÎ|³£-D´ g½÷‹¹˜‘“=|°s4Ød»^ûÅ^Uµ (£X  ­_¦Ãh'²)ÉÖż;ô££þ|Ô{Å2ÿÃ#&!맸¯}ÜÇXJŠ»ôäž} Wu¾ñá$Ì>°€“+E!*"º©3gö»Õ¡&>èËöO}óaT7¹‰Ž%¹õ¤žœ:ÜZ´gô“0Äpì¦Gߌ’R’ôi¹³Ú(I"¢˜¥ ÷-ò…CR#3I‹5³†ŸôWé0¶ëðwc[#ÕFᦉôWoªy‘óƒP`$endstream endobj 926 0 obj 269 endobj 930 0 obj <> stream xœµZKÜÆ¾/ä/ÌMd ¡ûMvn‰aÃÇ‘Ö'+yW^ –ve[ò#¿>õêîj’3Z I3Ãf³ºê«¯^üñ`&{0øGþ¿z}ñÉcëÓáæç s¸¹øñÂÒåƒüwõúð·KZ2œ™Rrépùýßl³;ÄÙ.__|;|:ídRX–áÅxt“sÖûáÙh&³Ä”¼ÞÈÏÙ oG;—SžÃ§ìMš‡ŸÆ£ŸçÉÁ÷ò~±n0üqŽþ?—/’„i^f‹’Ä8Ÿ—Ãå?..ÿüíð>b6‹Ÿ‡ßðc˜­ ô4·d;ÂÉgãó<Ü‚da1)¦áš>Zr·âr$Ðç°Â.Æ…4¼Ä}ÓbL^µÏym†-¾Â_­ñK‚Ó£Nb^ìðš~ÍK°míð¤Éð{÷vtyŠnÎMpÙhY\9—q©)ĆɇäP!É㎶(ÄÂq6€"éSœ‡itS´NˆzëOÆÿƒ/θ‡_F+’Çc:ˆÖA À–p—.ÁÌ´{YK–Z?ü §J`¼EÂ`OS6™LæM @µ~øÎ4\â·'ã1ñWÈû0³ ?ã÷wp¾YøþÁ?~™ò’üp7F”/‚¾<.öÕLZ‹ Ì£ œP{––á—[ÜçÿÁohîpGÜP ÆÊh‹™a‹àñVÂÒÞ¿áÞx^üEÙæ"wÙ¥Ítý þ‚Ö†ïáÞêwÔ',³n¡+$Ö ?‘Üõ™ò ØŸD Q×#jÚ›§º4[’羂f¶à[·J¨òÛu{v±3ö(§=ZP5ŽÊ%$ ¦ù ¾w.êdMòuÒÊZU›àáâ*H]àhݺOUB"-“˜¯ÆbyÜénô 䳯À¤!AIÍ? í@ O;—Ÿ“v.›&os>X”xÕò§qßñ#®ÈœðGÑAñÊØ+¯DX8NH ÈNõ 3`ún}Œžôת—Ïñ2!@) z2Ñe™)DôöH\]½«~B ´eóI\52ò2þ"ÛJ0@ÖŽHMRFWo-gá/?ñýx~ô„â(FX¹%ÐTt¶ùeA6ŠñàI9Ï‹• ²’@ž=/©*f’ëxânòfï)u[v*‘•¼*b\E‘†4Šê}¹Qñ¶·é·q¿$¶zËQãÂΨ kT篣[ØÏÅÿ^ÑÖtønmÚà,u~ :¨-à$ ÖËSŽÂ¬%ÁÝÞíŸWm}Ùüù îŠKœ†Bç¥xZ‡È p#*Øe0f(P¨øÄ£™Œ~PÙ¬Ý31B„3„^QȺm#øÚŒÛ@E¾-7Š ²¿Z£!†ɹ=º£äà˜ŠâL!9bÏË÷cï<ÑÅw#* ¡ð;²¤#~P©P…Äm#92¬Ü&¾jV°µ2$;ÕE‚fá«–;ÚB'APžd¢ ùEªú8 >ŠÔõ2 ®öåÔ¡2ã³òuã¦Å|_2݀ˤ¥ÒMXJ)˜q[´¦ý|¶ƒŒŽ€àmä'm­–cìâéõæy(ÿ‚Š!7aèÑ{öQq–³«lÈìÛ,‚« ‰àB[Cx 7S/œ#n@‰кOO 0øyƒAs4Ã’j~‚±la|lá%Ï|'ÜX6{§9oY<’ŸŸaÁ2çQl´J–Ë>èB³ŠÄ(=kë%—™Å­· ¤×ŽÖÉXUèBAtŽM›ÔofænG•óCE¹JöæL§îóÉÌš+į¸ñºcˆÏÐÓÏ^ªVƒ™ö[¯R_KB)õ’Wã×À=.÷N'ʇc©ŽÎNaÎóÕ.Æ®Se#fHQj4fÃÏxk.l'l›b$Is•ÎÞâMžöU¥I´vœªÐuIRñ<´û–²\UJ¼»:…ePD»º†ç¶ å‹'²P}¸M®ÿtŽN“[ŠÆwé´ËÉ(£ÍæLþ/ªv*“PÐúz\"ÓÁ#Ö/ê‹‘lŒ_RΧ–B&{o’ øIpØø‰”ÞqC0¾Z¨×è13ƒ§>Và.¥d#7ŒjHÔy˜[júøjtî"ZboÓ ¿©&¥Ë`©ÜUP>ų‰Ï‡fom¦kâ¥~-á“zJaUnÕÆUe·æJ'?Ôˆ@¿ìâ~>­¶¨ktÙÆ®Ô9Gˆùô½*»q£¡[ÌÙ°™jKl'©,FyÐIÛ{°¹u;B¡¹1;Uo@㺹bKUÔ™=Û.#ª-)t»â+ZØá´Shj²Xž¯tûBç’° èðP+âÛIþåÉsf‹YR‚Šì²kÛ ÒòByãŽ>Tî'Ô˜u£e¯rm¹DŸ2<ÿçä ª[ÎAñç«‘»¨‹"Í—]MírƒÝpŒ,.’À½ãÉÊöÐ=áZkSÒs¦Îá0}s‹iòøXÏI#nU‘Í÷»l¾!劈àèb¦z¯ðb_ŠªtQ,î ònE«f}£ÆÍ¦Ã©Küä{4iuç-å¸Ùj¤êî8ˆ¹¨î¸[\ 4µ€ïli•›[5¨‹_ÕÃs‰Ê`á¢U}#Ùˆä¥{àF¥ˆT/þ娅÷hcÎÒTá¨êß5^´VÅN¡(Çÿ” #4½ lŽ‹¤M` ¾vOTÛô_¼i!eç¿Q¸€é7©r V~Zcÿ?«V¿nX ôgí;å$i #Ü« í©Ÿ—ï—¹þÑväv°Å憊I¥õÒ@qµ¡&Püx¾>ƒŒ€ÃÃL^HµªJA""xÔ0liâþ`IÖæ:k¡>_íé¿?|sVº©à½Òzѧ¯Äâmlì߯ T¾µ†± û{)gPzÑæi•oœïvi{ _]â£0°;ËÕš1¿T¢Ø©Š)Lå³,C­Ë»ªö1żÁÓ˜ƒj/üA9“ËNâ_䶇ô"]æ¤@'ó„ÊFdu"±t³+oöÒ+¤ñÌõ@±¡íºT%fÕâ¤ñnUAø@™é—) *0pÒÕ¬“¦â%ë’¼4xQc•csš\?fÀ»ë*êT°Ùõðù¡Heç’øS3ÿtåÈZ·Ý¤˜íÒ5ŠË2˜[fêý|èlOÂt=#F¸4mèÔ3y ¯™l^“PYTRÑNB¢ò÷í¨»¹Ç±éóLm²[Ú<38îÓæI<ÕÃGOcÔegÒÕq5}êÆ µÛº.Ý 7; iΩ¼ÂÙI"UHê³›×F\¨Ò%œú¹âÆÏ‘ªÎó¼ÛÒïÏ °®ÌGëÁ´;˜Úk>c}K¥Àè•LP¯l”V/Æö½ ©“nôð§1Úÿ§‹w9.ž¹&Yß ª *Q€2¤¢(—QM6ïdGèËò¦ëèîj‡ò$RX«¡Ô¹Õ¶ÁB˜ÖSU±†0sÓ6Å’lÝÁð…ÚãÅX^[yÝxÊpõ|r iL˜¹5&vYeÁ¨^Ðoq‚?üå㥠U¬é¨¬vÄŽ²t[•öÞ“ºqÔÊ•Úã£Ã¬}ENW .TU;™µ<ë¿–Ù˜šßù­.WŽí+ý&•­N^yªï#l2·Â«êc÷†Îkp°œ¥”¸-CµyÕtÙqϥͦ€Ã{#ÅɸXA†¢8¯ßçr~Ùnõ6€®K×=áªxˆèFôÄÃ¥ ònÅÂÛ^îŸÝ ®˜ñáØUÒ¹E9Æ7pßÒĵù”=xT¡åªKþ·ôê×¼d¢êË=–.óMGë± rÅž[Wö;}ÒŽ)× ¶/œÅêØ*wrž½*´ûD3ZÂ.tL=nJ5jKHz_Ð.c´7ªr½“‡ŽQe3M ´øÇŨ/ÆZ°t§­Þ¶YÜjÜ„Vw‚ðãÇ%?/Þ–í~o¼T,-¢¬‹y²´UÒ¶~ÇG< ÞÎ#~¶øwJƒÃŠˆÔû"5–×w{Ú Î&ùÞÂjxÛ³‰‚E—–¢²(ìõ7Ô¢wݓό~cMõ¥’J0¥·-SFÌ×åƒûÌeƒô9¾‚ej•×r³3ïÀ•¬?s>pŸ÷ÌL}Ÿko°‹Íó0«æyy×DZØš69èT{«wª¿¾NDáY 3ùÔÍSŠŸåüþÄœ~U”NLé`<ßi.”Q@Wlvµh0\džmçö>e‹‹Í[!žq0|6¬ç6Åu»Õw2,w¹Ï¾vñtäçb½S]o¦šëeŠV¢W¥>YÅ µ…¸ÑbAh4÷E(7øÂ:"Ê #ªHloT±r„Xd<„yòõ/ w;øëÙ‰?»¼ø7üù„¶Û°endstream endobj 931 0 obj 3535 endobj 935 0 obj <> stream xœÕ\[Çu~'„ä/ì§ΰëÒ7y°d qË µQdH¼äòfrw).)Šþõ©s­SÕÕ³CY ZÎtW×õ;ß¹öütÖÜYÿñ¿O®î=|äÂxöüö^öüÞO÷Þ>ãž\}qM¢K—K¿¸³óg÷èaw6ù³qŽçÏίî}¿sݰóéÿØ ?žÿ<6‡â±e9 czòü2µþ²ÛÇÝ¿vî°,s\v¿ëüî?º½ßÃõ?t{¹ñ¨Ûßzq€>ýHw}téšmøö%]øÝש×ßwüå÷ÐÓÚÄÝW]8ô}q÷G¸óïð'µ Ñ–yÁÇ`BÒfp3@ÿãî›n?¦«ÞïþÒùôað8ïæˆO}×y^¹m{Þ€}èSúLû€“}‘úÜ=MŸ|Lc„ÝëÔÍEZé».àÿOÓÞ¦ÛCšþ<îBúè.´z OÃ#ÐC±ÉgrÍ<>ì^¦ ×pç9ö€»ú,---Ã9lÆ£Ò…÷Є[·Ð;ì—~`o  <…íôQhñ$=ô^æÁMbL£ö ~½„{—ÐMÄSù¹ >Ïõ# ×÷S6Ô/iߣàç¦ 3Ì?ì>t~Nk̳yM<~ÚÙ »ºÔÓ£•zÀÌ +À©%üàŠ¨ Ì7ÝœOÃíý +‚n#–|ºðÜG?êS°Ñ>ÀôÌÃ0ô›b"é™ÓD{ öOæ÷׎ [²ç=Ù»Õ{ÚÜWx@N€ý¦} cÄ£§©ú‘v¤e†÷•4 ‰”¡ïú™.þ.>Ñ ½æÅ.R#†u¤0‰§psYL‡eF‡§Vx#í¤>ƒÞf xÕhòBðùn&"éG…yŽÑ]5lnèÃaŽNWn|•Çÿ ÌaÁdÖ!G`N^7¢P„¾ É{ih Wv0ΈåŠÅÎóÓßÀŠêgг×5„±"¬½,Ñ4,3­û«n!)”Éz:_R¸ž«tMà Ðàqޤ ¥`@eôD>–wÖ”½êaâ Ev”zÈÛÎ,3ê{iXÃJ=r†EìóUîíMµqØìè" ø\¥­ ¢òFѵ‘Ø€¿•Def#\0ÄqSÇŠB¿‰ÈQ KFz“©æ½^L£ùµ^¬Õû&¢à Ó÷XÀÀô„;QÒS:?,ˆ‹kÁĸFÃ(Hñµ½O\h·§xm÷ÃŽÉ –úŠÎzï'g‡ ÿÚÑüó©˜-‚¢fZæ €âv÷¡«püØÓìI57O;Í$õG»¥¶pøÊÓű¨Ã§9`Ôñï ^³; ~/ØÆKÙÚ¹„©#ÏÈ jZf99.9lÀ÷˜æ™M¡y¹óC—.$Å †%ñP²ŸŸz{ÌW_@µ:ƒ¸×+õÖ¦áÁt?¤þÜH'À4Â%¸ÑÎÔüU©0`ÛDwÍ2+üÌYøÇšPıA4§gƒfý&;uflñEêCز¨@kÊ*R¡#D Pg xTu»èó)¢d~ ™áÄüî'@ø{ÁªˆÐgÌcÉPUSö¢á3ØÐáã"¬ŸeFJw¤2#‰ —lè–=h•e¬”½áÁÅ9ZÃqå9~’ · $0Ôrqñ µäQÿJëª}â0âæƒÀ†û 1"‹‡I!…;tP²éU8‚ h‰Ò a½mc$Ä©æž V—bÐM"ó±r0XÒ ò»¶ßÔ— a¬gý‚0޶/0ÕÒªMÕÍó¼"QVàq…CžËÖÞÅB?wC@¶ºXá§4Ô†hYKÎͺ£td ËPÅË-‰I„]F&Ó<ÛÊ E÷®³ ³þ¸X],æ…€ò­ÍŠõŒmŸ¼rÂÕ,˜Ã ¾ ™M';Ûî€@¼ý¸$Vž²‡´ª‹/efÆ-­Míe¤û¢å(k¨d𹉯JjÄlÚ[ËX\–fsc Ys¯GXÔ U;”Þâ‹ bï[ l©Õ‚>Y F%±„ÄtNâí2¬Õa@€ &X> jуª#ñLÔO m.ᤱ@s§ÀUaOЊc¨â]Uô °¤ß¢O/¯LzYÜ<ƒ‘"û kç![äŠI2ßn©;µé[ñ‰Kô¼q̵m'g\ºøæÄóÅd²M$<%Û”¶¸÷RÍI¬€'¼wË!ø>м¿`qD¯þ&£ƒl¾yÌ+ÇCV}£Ž‘D`åÝXØV ŠŒ]Ó >ª d(í›ÙQtìh+€% ùý… ê¹a}…qj„—xN)” {9Æ‘|»µ)!c9øih´œ–kÁe z£nÆhö2-ÊYè¹³´<à£Ùù™h‚(üTùbÆŽj¢JÐ B>{<š±ŒëW¹y¼%¥Iuañˆ.2 i¤ <¢9)Œ…Ôá±;qIB@U³ö,i†â<¿qHÊLµ¿¤‘"ŒEÉê6ŒS½ÄÒx ý­€Ž5/#bJ\´CdQÅÜ'kñ˜o‡‹UÅôϼŠÓ[lŠRvÌÿ ¼X:½«ˆ  wŸK¢%ùˆE¢Å/3ã,Í'yobý³ä¥‚[мTúé^(âLR‚ÌK¥€×„ ôçPÜÅSÂsl¦}’Ë`Üýç +n\sš7Êòç=ÖqB°”–ÙªÒ¬9Tª4¸9Ŭ÷”,*m:6ê¾Õz…Z°6 Ö$Ê=jâ±Y9wV)€ñ‘œÖáØÈŠ9š¤t£›ã!ž1ì°ˆÂ[ƒ t¤^’RöjýÆCxaã[ðJöûh°5xÂVà W3{Ôä‡ÓXúì<2ø;M¨~DíÚq¨]½wÜxY¡²#¸=Qh§¹·ó"v˜(`)ê>œJþ²áÜØ/ê›ÉÜ”Ë=joï~x«á˜æÑ¸Ù͈§t{AÜ@èsˆv­•mÇÁ8›Ál)£ø£p90V”ÚTF¥1–mp9«@ ŸU°§$òXÉm¥ÁÌWæ@kØ:ÈÏ‘ŒßF7Vs âš»5±-†ˆÖô.ü@Гeðâ2·lÆÂåæE«VWJð`S;£ cüDE_fâ\‡DØ}ÀdfÞgC©´¢ZvÙ6K¥ãñM9-:8‘¦Þö&#ûÈKW]jcԇߗøãà‡?ŠkÔÎgý(›”ç<â?“^˜ÃQÂcìõ˜˜‰¥Nœ—(5(¾'ÅV8ø¢CgÓØôø6xÊ1M£{‡ôÎè¥_hƽ‹»ìå¢`Üz•lцnØä©ŒŽÇYð¸’uûØÕH¬mœm¨M!‰üÓìǺ(A6 …°òý10‰|]©ŽÜœ °oTÞƒjˆ—¸ @ÝŸÚü` ÉßÖ)WàTÇEg=Õìü•V\XV ?ØzŒS 1Žë7õ0Ž?ø\µ`+FõX®'ÅWE$›!„áë*8óÈ- N 퇘u.G3iÎ¥Cgõ‰fÿvªà´@­†@bEc6r©í2Of%ù*p¥‘ÆMJ’FJרËÿ¾wƒ7¨1fvß2I’F°ˆÇƒqÚøg(ûeèØpBþˆÛ¿)¤mz9­laÜqjÁʳsö…Ó…uÂ/L~{b÷1óKûßUfî“–B¦3šýŸ²|í#AR Ç3‚ Xב½WJÖ 7á: çx%C8Š"øch¬ ­›KXÜ!Ɔ€¶bp¶|Çgr)dcÓ˜y¼UR Ò¾²\k7#fÛRhÁJM;Fs8kbæ|žuðíh7–´Ü×u§ ¯ÿw¡‰–ð¢Fý¬Ÿ®µÝ»¼á·zÒœ šiC¼^üQ[¶íµ~>Ý^ó^ìµlxG5¢e*©‘Ù>HÙˆBPf]ðça’­h®÷„À ˜¦^#°ÿ“n+‚S®è_: öÂZÖM_ßêÃæâ×åhÜ'³<Ûrfj”pyúwØ Hæ¢ z&ßj™9´ãÄIðy’Ëï·]Á!‰Ðð+]Áý–² Âê¬7yMvµÔe¯…˜™|!¢³l[/>§Ì|_FCŸ—égôÈX«¹Ò’ë˜r¾ qW”};_h¬±2ܰ.%sÙˆ ®ìõ†¶¥2WÝ€Û2YŸiÑÌä¬kžKÓI{¬B"󸡹ÉeiŸÕ¹.òlvÐŒ´J6…É &LÇgeΕ1‰bæ-7QJ'—È¥¦s!3éÎjÑ™ò*Eµ(?+¥˜óT採t`q 0§äÙ-=Õjèñ{³ãµºáIµ’Ñ(B¶$HVµU4ªÊ¡¾ %žÀ7"fØ Ös2ñÔq|]Z58}bÔ „Qoî× äó4ÖÃtéa§EÆ9 _UƒÃãLeü õ$ÎøiΧ¬»Ôt¶”"¤.'Él;ö³z¾*ìV‰vs¾,~´]$ÛÆäçÌ1>Èï«<.èf!µÔrÀADñ€†¦ñ³UW\ä°•Aç-aKõ±Ðºw6¿]¿b2 câ0wðEI Ø¢øz®$ö«ƒÜ|býªMooßäÉm±"J¤¿›SÇè5UË)ù‹{ ¶Žª(è ³H/µ[‰¬”jâýª¦>²hŠÓ‘‚äÑŸìJ ŸpApe¿Cé„ïÞª·ñDì@\´s±tI„&1Ô8a-Mž\®’Ê%D¸‘Ñ™¾ÇòP/þ¬ ŸZ)û’î­‡dÞ)yi:_ Ø4ˆ|RÛC‘’‹§Ôz¨ÔÁ ß+ =EØl° &¢‹1Ù‰g4¿É}kБÈpž#™]û‰ê~ÑÌ_²VÖÔ⻊“Xô2·£î .mP)7\ˆ¬7ê<àdáG…îêSÒÅŸ"Ô!4üFBýëR¸7ú'ƒîÿŸP¿k(òÛ–P?Ô†Ù†xš¾V¡.¦óÛÈjâñPÔz;öÖªª‰ðKÉG/ñy3`Çâ™Ù‹œ¯ü~.ÃŒ%òØ«êT!cSz¹¨®õœ©0/¤oûNY|‘€Å¤6߬r<É>mb)ûMç+¿vÈw¦ºœcOˆ©*@ò*aV15Åž[á˜ãÒ,‘ÃV¶`3¸T›|Ò‰ ¥éÂj,ô„kÇÌK•ÜR TÙ¸Ñøo~™âÆ>–&jåNK”nÌK.EæÉ ‡£¡š¯7/^¦[CäÜ«ùm§|÷ÔþL¿ ÃŽ~X¿ªhbËw mq™õNU>õ¥þæÈ#ؾ¯»]¸OÎ!÷¢©v%”M‡_+VÇvXpó}Ù¸Ì÷˜4TÞ´“8Iu6‰3„üºÚVáÍ2·Ù9Å-ê —H+Å%rÃR_߉FMÔC‚ý*Àq´ â<áªÔýùª¢û ‰y‰üÌràYVœ~?Þ«1Âáçpú õ´[Ù!Ä?Ÿ`‰„ì·”Ûðü;6R?H|wZBçH Ú?d¿(È3¾5(@ o¢5DR®ýÂêGu³g©ŠÝÇi9hŒFŸ)*¿ŠƸôwUÄqUIÀ/¥êÏ3Ш¹ÆIƒ‡s¿•ë¬Fd‡9N”nºÝE™ó~I ÛœO–YI-d.›6Ôì%ÿò­Ê8ÒTïwÛ?Tr¶å ]Á%DcÃf°éy_¾t?“: €Ï—öY+ L¸lZ~}©HBÌÄ6ÅÏB0]¬Þ0fT`*J…saøê%<ªwùQ©õÔ,mB¦)s«‚ Í`±w’žj¾h¶þí$øõ [oF?B1@„Á°[Ñç—€¤æø÷¦H·Rmð_À¯Å£Ú€2C>£±[½å†?Bo[æìƒ±FÊÑø'hJØ]KÊFìLt‹ÝUzíÆ„0U¡­÷çËÊm5íľӘõ/™4*Úô-¦#Öã]ÅQ\lZ¯¬þp~ï?Óÿ8]Ézendstream endobj 936 0 obj 5029 endobj 940 0 obj <> stream xœÝ\Ys\Å~wR•¿ '˜!žñíån$¤Ê`\ClaìdK–È’°,/üúôYûtOÏH¦¨P¤(gºûörú¬ß9—Ÿ÷ºµÛëà?þ÷éË·î»0ì_ÜèöŽoü|Ãa÷ÿóôåÞçû0d ©i=w³ÛÛvƒv{£ß¦¸v~oÿånÙ/ºô·^zü¾^®¦Î­;×/¾Yúi=O½_ŽÓaSû4 8#=s‘\h«Óoé_jëOÚÚ¤œ‹óÚ+å>M; Óâ,ï<Í® a qqº\ xˆàà®p›1í=-ö4uÓ~ {òô }ŸhÀÛyóÀ™â„÷û"Ýï˼ñƒôÈqú3#dúS^'ƒÑ0l.µx[…®8,Ó Câ«y–!²ß×KYí¹yŽ×sʩŰÐÓf^-W}ÚMÓLc¿x E$ˆ6ÂS[áÍÁM¬˜ò+ÖýÐyº€…Ý_êf’Dd4f]šÒE¥ÍIzì(›;…QAΞ¾âþéô bGmOà·—ÃSÂ%ÎB1³ ÂN4é*+Ç×K…eÉ ²-8Û»åÊåNËs(é‰VÑÓÂLõè:;/Ð7t1ÑÕ g›MÜÅ!D¢ô~êažyƒüâÏzctLéNr=ôéæggJÇèSÛ8z]¤o`Ûi¢ì+>Ͻó†1.u™¼ÂôlDòmY¹FŽ…lÓÏN¯õ œ¤tÄ™`mÚèñç6¹†/ />¢2zRrzd9'x8qÀÕΡí\x¦<°mî å¨s‹+Ÿ^V— »‡å“Ü^Sòé„¢ä<9>묊•ðÙc–ž#"©$ ´ŸÜÚ FëïPQ¢`‘e›‚ p Ä¢Fì…3Y ¥îÁÍ金OÓ}€ )Y©4 ÊFÈ·ŸŸÓ…&½ãÓZQôÎÿÔøÉS’…NøÓk›×q7Ó Ç)œ­Ü§ù&z;£4úÖÈÜø“|k[ÃaXÇh­¡‘û¯i™ £ÁHàãíÂ0í¶“aPI>UQC¡AI­µÜS°¨#–9 uE]o˜ÏcZ°ëØPÏpl ¸ÔUœ¦M–Ž#ËGTÞTagéÑ©+UÍØ§>÷…¹CJŸ‹˜£õb'޾Ë4å#h%ãÄD aœQã=^Ê}Ý”}9p˜ë[eÝ\Þ.ðÃ<¡*‚¾7Ë@ƒÔ¢Ž=v68ä¬Þ×4n9ÞD&†Ž‡¶.QR}¸'™MÏ6ܘaFŽ;ÔÛªü¯lì2Sð^¶e²ÏN ݱ‚Ês™A—…mË›ã»2¬IæOœƒpJ¥mܱӿ²³÷ŽØ¡ÑÛ¦¯Ÿ¬S³[äZV¡Ùìvî0Mb3+¾ØªÄE/ÿŽZüKøù>ðÛ=øØ‡ð¡zž"=ÕÆ³ÜŽÏѶÝ7N¯ö'^íÑö…Ågé«ïp#4ìçBIqãëfœô(·~¢ù[²qñ.þšV ¤^Û‘›û_qù¤²c&o¸ØSÑGµu´„ÃŒ:ÈÏ ÃQÕIS¢’fôM7mUK¤ý8°?‘¾v¿Ê_õm¼öWaBtà Uò̇ßâ½Â£ié_AÃ{Üç†{ëç¨2G™²·{(þ,93úŒ…[zBÏ" ì8ÓÂ/—tïaq‡gSUàÅŸI˜˜|"¶Ñ‚ç¬1<*Å©RÅQ"îPÇz,©íÿˆÔ&Ö¶.1z«É`e*ãzàš'bêV´üvÒ¥‘H'n´‘%=`Þ)ÝUj–¥„‚[œºYré¹·¬#06Ì.x¬2F¶Ábá‰ù"Bì3:qÀ‘{<•C®;Ü÷a2ƒÌáu$3‰·€·u&ž „x‚ï7Ë/eÐù/%܃ ¿bïUɳ%²¦ÅD¾‡4G×ÍñцÃFÇFÐÍVQíØ!Æa­œÂ‚ÁÔ?(ü…K‰ýˆ$ÉïTcœg»½iø·ù2áÛf$MûC:¼‚óa”¤x³áJ>AóżëÒJHöÖ 7œé$nxŒ[^¾ò>ÖWmºnñ鱯á*_žKΟ@ŒØÂyŒ 2¡¯á-xúò‡ð¾ÕƯrãíì-üƒ¼^u]ÜÅéJÃK;´oèÃpR0±b]Í—b €žvtW…°QQ„6n…©”]S‘ÚP‚ˆ¢ÚÐÚ@°9µÏ^*8Âà‰‘ag,£LÿÒöŒn4š\›¶˜\–aJAôÛ oºß ×!õ *mé{`MQ³5"4÷´náÂ@Ùv„”•@mÐeóõAû{hï dw7ö%Fî5kö~Ý{aðÂøF„öÆ~m¸&FàÙvT_‘ÏvÈd)Øu„=é¹gј¥Â¬™Ë¬ÍJØÂ|¬R¹×Á·À_¥ùoçH7:N16!€Û¥Љ‚ñMÿ픀žòYý@¢Èb¦µ¼W¨U±ØDÍìÎ÷hAT$R¨^÷¢sÁhš‚>™î©Vhlb`¢ËŒëà3Hn…ù4ã¿™Õ`#sA5®Ä¢m÷¨D§nñl(ãq°*3¢d»ËÙeDTnƒ ‹UjØú?KRÙÁšY× VJ3õ`˜u\Ÿ#!ÌÞ¢ñ^ÜŒ¸ çI À€pw Q‚29sDSƹ½ÌZÉ/î@G¤) UÒ$ßÀ¶îƒ{ÞLì)AL0ÄôºPÉfSÏ;•€£(=ÌhyöÝ“‡öÍ—i;L¡¸Â‚0GqÂexiù²1Ò,‚ß­òxÊFö ½žÂ@ŸÎÂNÂO*ÃõÿÝ<ÑÆ…ë)ÎXi¹©›PÉg¹5#üù!ƒ¯tÚsãdŸ‘ÆhýÁX¿OôŸ½ÅaFÊt]éú‰^SCÊø.ÌY¢6Ó:Ã’¾3)I«L¿2säùŠ®Ê!’!g5ãªï™l¥”ôS‰8ª Ùs³å~9Y,|˜ 9Èáy ’5>îr(yUÚYÁ¤0Uvs†#•š=µ¿²5J·ü‘XÝärÖ,ï7©tâz1þæÜ³ÛØ>!ûs2mšÅ[¯ã7Dñ«ôóbbódáÔgÏé z* ̯𺬼#²±/Ú4f3ô‹ö*¾6¢÷‰ÚÀ`ˆ¢juUï½d‰V ÆÂ;Ĥ`Nî  ´«K?¥Šê¾mÅXQAlr òB$;”× ‡ü8_'¬ðRh±üL‹(ç :u3®%U9¼­ëÕˆ‰»PHŒ¼ÕU À¶©ÓC½e?9[0ü§#«žeuBƺ^¶f¼M“L¾³gÔš#Z¥†òÞC ZÕ‰fÖ·–¹BKÃË›ï)È©Ëx¾%õÍK(9ŒLPk9¿æ‡fö;ä—( ±AL‹W΢/EÚìO_ˆ0÷/æ••Ðä QÊŸømàëë  å‰¿s‚š>L¹ðñ”MS"¬*ãl®ùÎdmCoW¼J©)¾W\î¨@cF‚ñ^iEB vƒðcœ)@9ÈxÜ©>ø6CY¹GaaeEaë ßlV®ËÃFØ]½¡¥ñÕÙ C¾´èÍ8îîÆ¾LE¤“_¶V6U>¯—h/Æhº¯@ ºæÉܽg÷l¶¡îÌc ˆ¶¼\&# ãž±Y±ùÿÖÈÐzñé]%³îjÛÎUgå e¿b¨q-¯1âÓIäL¦†høÅòjžÌ47èç‹Öí´F¾œtl÷¿jÝ<4Ǧc\¹|ù?:‘™¾Òþ;¹ÿ;mü´¸—?®©]¶$ÃÊÃ&C’äA8:Cùæ‰;ÚøNtbvÑ¡ƒFFÆþé‚™«› …¯;7:6Ǒ܌¾Èü uÖ§ºò–i^àT—.wf4” Íù§w¹ÿ®•!Xtî-/*LgzÕXöåþ¥ÿþ Kß¡\endstream endobj 941 0 obj 4645 endobj 945 0 obj <> stream xœí\YsÇ~gùGð-Ø”±Ú9öÒSbÉŠírdŤ+NÙ®xŠAÐ(Jÿ>Ó=G÷ìö°§â”J%˜³û믻gvøóqUªã þ…ßçË£'ß*Ó_oŽªã룟>>¿Î—ÇŸB«\QÙW½:>½:òÕq«›Î–JŸ.~˜©¢ži÷¿)êŸN¿‚fÉšõ}Y7®åé…«ý¬˜ÛÙ…*û¾³ýìÏ…ž½*æzv åŸóøàÛbntUVÊâ•û_º§Ú*WÆ+~ŸúŠ]èÙK×ëó"|y=ծ޽(LYUÆØÙ—ðäkøáê«Ë¾ë±L诩<4Ð3;)æ+ÕzöB»µVØà´è,¶ú¾Ð~ýFõ|ýó €¹µ¥î*ååðw×óì5ü¸„wż†åVílßïù˜R³›øuvíVÚ·nZf¶ˆ­Ý4«ªómÞÁ¬¾I­·©Œºè°É6Õqif×ÌÎRá-ºÎkÕ;YµN…ñùszþ]*|š A&ª-USéã¹2e]÷ÁUšQ>Ÿðû\OáÇ“ôã3>s¿X_ïïÚ°Nqíl™Kiägéãª1«ÖÎøÄb›—l ÌÖ*è2”]RÅ 訫+3û!=ÿ‚ž?O…ߥŽnÙ,RÅsaDRà U\¥ A?ÑcšÅyêg%éüët©{]vÑšo%¡\¦‘×#ÃGk:÷œ Ÿ?fcǪ7\,ñùhо†1c™<èYê‰IëŽ>žPÕûTõ2ÓÀ`W50_N˜sS9cq–ïèG{!G9³÷pë\]×Í'ðýÖQÈ¥ã¬majŸì+Ä~µ >ýÔµW ÒâgîëÂÑâX žyvCEéÔݧ-åì*/½9øŽ4M ÈQ†Æ/Ÿ†ú$áØ iŠ8Ü1-4µ`ÿ± †v0UãdæçºåS„±azq.ÈÉl@hpíþÃÀ'^d€}YÙˆÀs/²é^á»çî ·þ¤nA²¡š9ʬ`\¥;'È8…(ÉmÁ¤»UÀza¡lDÜGP^ß5iZ~Dêå®Ð @ˆ…éWµŸŸßUF¨ó $T`V”¬¦åE–pᆕ5(~èW÷q·,tÀ`RA€ èA×VÝ)t8 ˜ÐÛÂ$„™ Zør°¤^aÿ0bÝ«Þu~¶FYà4/¼V-~t4¿,Õ=èœëÆïIÙÑŠtï$@Ï /Iƒ‰”ýp0QËø}U˜ÖKãŒô…:)xÙ×Y¬Ì ̯à­¢ÑÈ2ˆ´­fáD´ðšÃH¦­pÁ¨†$^)~‚‰}"  0êZÕDÐMÛrt.ü‚Û˜Fc0Àq–„émÙÑ!ÈÅwì1èe“;õ$†áI ÞÕzs«C”Ã0*IÓEz¶© ô"Ì-2ÐDzCálbçç q…µ8Ê,Æ4©Þ.d®_Ž Mª"H¨+„âä°cÔcO—6¹Zð¥ Ò)¬7ò,à¢Ç9@×ù¤Àˆƒq‚hŒAR!úc !äDö šj=Maߪ™‘sžvC"ñÁx/O}ö`Baå`Kôä"vP‰RË™ñ“ÄŒ‘ä ¬ÇIå,'Ñ®ð™'ã]úì‚)~…‘B”d1/à|ê.VÓ°f62?í£8Sû©ýB¸h$…ŒÊŒ¶˜?aå;ÏèÞ·¥ËÈ(ôA3÷Þbÿ:#e\ e’[þEŒiXpóŸbÌ2&tÊ´ÇÊ–Æ6ú¸l@µrÙ_½r4_»XѺd?Õ-tQÖªê[—!Ï•K¹!yňÚiÎ,áù-~RÌE—m£¼œêÒötUvÑÚG„uÙyEcÕ^?SË×G§DœµçÆÆGgã@ÓUÊøÔªŠG©¾ÅØ\}BÑÒg_ÚC%д­ºä } BÍ ï:Cl]:p„(Ê*ßä1­ *žÃ‚\²ÖCQ¬29œ´è¦Š™x3Ä‚¸]–_°¦lµÅœÚ¥ãˆÑ¡]ü†ðÎÄE†vFoo`V`‰]ôUVi$n)Š ICc"ã0÷†E¶. uýXÜíÆÑÐ>õ¸ŸÇæTú:ê• 2‰‰D«WI).™j ªð>"$òC† AÖ¾ÄÅ„àûâÞh}ßé£×þ!v#T¯¹Hˆ]Ÿ†˜¡ƒ9QðI2Ruëw:r 뤰g9ç~¾ÆÎ¾ŽºŠ+’AŠÖ=¡B ­Sn“’•œ›Ù“"ÑP&Ä<0£°›AîRΚæ {FŒ!ÎJž7Ê OFã=tp9b<á¥:ø ظÒ>¤ ëÏCJ¤sTÒ}øáÙ¿#ŒGð0_µ‹ÞüÆž¡ÀÒ•‹xÖ±­q“ai|¶uÅ÷—² *å–„?‡í9¯ïqúòám¾¤Ý¼fÿМdézêpåKéù5ï^Ül£p‚v†`v(ÔÑöm,¾‰k°|ãìB…%‹Tø-‚mþ…͸"Ë|kçðª˜u$RB±nÓ^áÓÔš©£ ¦Šn¹¢ ùMÃ…4ù•$7šç{/¢+IDTë’D´àÒkôR’ðF’å…ùQ™¤÷šö•³ÂáŽnÏ—·gùïSá2«·Í²EàNµ£œTzJ_Å-e NcéZì78ÞÌ0PdnB¶[X·PZܜ˸æË$šªý¾ò­¤”Iv#aù>ÞKâ\KÚÚP¯ Á4©OÚ_Gˆ'°ÇÂÞç[kI­ I­9µ´@JC>îY:3´?¥½Ö×#EÆM±„ƒX5Ÿ=mꇽàËLJ@Oeê)G"?‡änîýõÈ^~•%ßp„O×d-¤êÅžŽ9$Ç &öžK@ZKÚJú?ßý‚߃ÐIìFÉÑ2rÎb´.˜ocÆiðÉæ“?:‚ÜÐÑãéÓTøŠÖpcK¦|Sƒž0¬N+­G¥óØÐ ÙyÇOJ_‰S˨6ž>ì–/kN–š!’ÎÆôü+ YäJÛBXÞÏþ%9œì¨7êúVBÅ› ¢â*“âЪ»žÛ ›õ )ø­háëLí¡.èˆ÷UàÜÀ¾ïrsƒpWבŸ]áÛ=Úß„11ž_J ÷AίÁ7ˆ€Íü ‹úcVÀ”&(¸ëyévôÑŸ†¦Òf«¨ê2ó{—ŽŒÂAÁé¾a‹óIn€â)û74o…c\KvAZ=› ïH,Ñ9ƒÙy„•Ôé­…Ç µŽÃ„;©÷­$–G\iW¶À¨@­ÖDjô§È¹C§ú1»úP§ OÈf;ÿЉTS•]ÚlbÓzÁ/¶ßä ÷@ªá9K|ç(KŸÞJ&jrêý#n€m8BÞ œ 2 «8/ܽ …,+ýRRÑI*dÁÈ7ä ¥ÉoHï´Ž‡Lªcóß’ÞG Pq¼Ý¼~+vvF1¸<ˆ€»ùåÛHÖ¸>Ʀ ±ƒ÷$¯C˜3óÉÿ ³†ÒÄ:¹YEL4àTÓ¡ªÊ‚ûH¨íÓ{iùnR(<ùïe)szbmJöÎÈ4ƒ¶ŽÕèŠú‘B% %ŽñŸD­-k8‚Òâmì—™!¢i)p Þ6‰jÎ%Ì ‡N™´Ý´–”5•c¡­fV¿"¨­ o2ú‹šÌö°cs13º—@ÅðóB-Åk'R€3ÒwÄQ`¢+QµŒ]–ûA9"˜ÍÞðñ‚:_sŽáva'öÃ6ˆ?•²â»l"¡ðI¶ä±îwCg;©×“¨ñÕ„rÇéwöVwœÈ‡ë~œæ>ÆOTígž½Ê]ek×E=÷ªlھݥè±UU”!ø´09©pxy‘àrÜÛ¿à:&unè”óJR<)özëGŸ6D“Vt%¯÷¸q»l)Š‘`Âz$y õp{’Í'ÛH[q$ž8…4Žó¶óotaÍ®;$œùË¿×x®‰ŒÃåë´VÈU.½tÞ;éËуùðüÄ*"t¿Ig< å‡÷…4‡sI8„«)BÛÂÄUõ ®Øz @¤XæI§öÇž„6õ~>c¶¼Ÿæ²X™å4“;Ï,¢šë®*›áÖ}¢¥UnK“a>YØêË`k29q)Î_v[Ô™¤kïËo弑p°%"ü­6(ãÇqx JËAÁ˜Aè…âîRüH±íî;ð{ÈÙ“ù±}I'%=ŸÓóoSáK’êz·*ÙÍág±T¸´¢NÙÙõá¡ÖÎcóq> qÍc&½q„Å쬦ñÑa_¾÷!¿—$ÏòI}2k9p¯âN‰í{KâÍÿ·]‹›d›k.s¯-&¯ÃÓ‡É;´òU«‘&•eŽz*&ÞÚäG„ü¥¿=YBH% e/ä1÷¯âÞK3YK8¹‘ Å3ñÜ¢NWÆ{f,[œ!>¤Cˆ>å²ã—@ü5ÑTú‡)²À\VO‚h#)f¡Ÿx¦¸”̈zzOͧ‡‚b(>¯ÛR›h•‰“-’–1·ÿ[dÆ"ÎS •E®ÌNæYæDsxžÇ}#zÁÀ,ùWb‰qdL¹w[ÜU† ÁÓ^fzÍÔšìÓ÷ô÷˜ ™´ï%H‹ïA$Q2Ÿ]f’=ð°gO”t-É3ß°ŠÄLÿ“,j›-$rìø½Ï©9çïHÇå J1°ùeç=Ž—qÂø5ŠADK(Ï_®ç¸rx8åÛXðJg+ã‘Ö~HW"9n†çC“€¡°R¦=Î/—ð8’½” ·Ù! ù+)ƹŸªàe]ÿRm€p_(§ò¨©‹Ýšº‘d"mXå§ ã¿d œñt–_À+/¤® ˜1to1\?øøë9Æ_yYùÛãÆ9ø¾c·û&.2^ÄËÿx©Ýó7ÖýšpK¤¶ù¤jÍ'•-ã©û ÷ožøKrìÚX¼Oþ(C¼Ä>>¤{5Òe·x»Æxná¾m Žò?ÑúFé8œ îì¸j ï‹¡¼ ŒÍ n˜½î‘Á*0Óè\¤×YCÔe+ÿ7Øm™ fÿ'è6ï6»˜nìÅ Bþ6W¸_–—û¢ìÞ©¿ÕæƒEºÿÊ®‘®+-þ†pÿÉd÷ƒêáfÕ—ÞÆØaÓ—o‡ ˆâ×pOôóÓ£¿¹ÿ>†×endstream endobj 946 0 obj 3939 endobj 950 0 obj <> stream xœÍ\m·‘¾Ï ýˆù¦™ƒgÔ|ë& ÜÛ±avÎŽ•ËÑá íJZá´/Öj(¿>¬W»{´{ÎI8’zº›d‘,V=õTµÙ ·à?þ÷ôâäÑ]7¯nN†Í«“_N>Þð?§›/ŸÀ+9Ô[‡2·yòò„»Íä7cŽç7O.Nþ²u»´êŸÃÎo=þ»Ïƒ; .m¿Ù…íãÝÞo¿ÛíÝ¡”Ëökøýd·ÛŸkƒúÿõä÷0ntvܘÜaÌuè'g< 3í¿¦«¤äáí=¿¾Ãar¥H«}ý0 #[¯‡RDW¥9L~‚^Û;|{Ê#4u.ÄCˆÛ?T±¾”Ém¯ÌËïàöK‰Û»:ó<Ÿ½ÙíÃXǦí³]8”) ~û¼Îq:Ä|×ÁíÎÆ)yè)”±Þ·ßB§¡6°Zu5|b’ëTÅ ãxð>n¯¥‡·u„ÃäGŸêu W¥ú[MŠ÷~û¾¶ÉÃa ®Jèê¤JN,uŽ£4Þm…æÅ¹¼þX[¯îY¨»õÝÉ“ýËö‹:`ª€{lŽbMuË«€«+‹¥€êòíŽ5ÿ‚ÙEx€ké«‘:¨‚y¸äVH¶¿¨—°Øµûœhªc]ù`ÝC½k›}#Þ½™nšBwg0jínȵ‘[O)À³_z—ð×ë*2\Ôuq_aßu«ØƒsÛsjP{Ì(೪·ØÉ™®t‡Ó}‰¾Jâ¶O·ÒÁŸv"ÛqßKv>ÛÓôt‡j†=_î`+BH‡ä™ °²WõuŽÖ«6§éҺЄ.v¾ÀR¹~#HGêbª"öø–)‚dµ_˜J®Çç\;Ó…p¨ tó-¨y=‹Î‹b¸‚ŠGXyº‚©íen{i ¢ñËÕØÁ1‰ÒÉ~À{((´6ƒ_›ŽÈ¶Wìbì§ñR©&¾*¶ƒ Qƒ€{ˆã¢KøY'T`Ü{zÿºÖÿ[~¢˜`¡H`)«¥ƒ—´±HûN[_·›ŸëÍGíæ#½y®W/ÚãgzófíæÛvóToôêU{|£7_i#7/õæ³µæÏv0åä¦õq®ôæ¯øâT½i›xh/:½éõÅ,÷V½ÇÞ×¶à»a‡‡ ;¬'ø þÙG7↞VM%{ަ&V¿ñ4P‚^å'²<®j&Þüwx“N ó+øINgÑÛû‡ˆï‡zOÀI^ô…ãóE?óÒ7ÔžñÁ¹8˜‰qJzÐNI4@‹3Ï6ÕŒ ¿¶°è+\=@£ú °Å> 4¸ÔU$0‡ÓäÍ¿4ö\îÕ~ÝA†j¾:Kêèø {AézáB£óhlžµ½øW-T¦;ÉýÔÞ °õ WÈsðL{ϱîÆɉìj…¸«˜³Å1B§yþ °éÿ?ƒÍêêò˜¬yHù—4Z(üu ˆ#çÃ4þ¯½NѰ§±¾ ›ÇÍßàb$È„W¬¼çôºNzÌö²AÔ†jñ*¹\î@¨G¬„ÚÀØ  ÿа“d0Ç&÷!6pIo² cÐÇØ-d:•½{K§ÞUn°Æ¢®’srO€€°Œý­àÐL–N:1 lè­š•7 ­³ïñ²F° ¾R1› +;ñy®c53©KŽuÊŒ»¬'Ƀµ¯IâÈbÈ­Ë Ú˜a(r\Á6ŽUCŒuø¶ð'µ vɘ’•÷Ø&¡Éà öãA' aM`ùà…ó¾Á  1=éÖySX*P? ‚aóøJ| xFB1‹f\–»Íòéâ“ùçõÅNa„ëãàwÉ€¿`p¶ñ/¯¹§K ­7ª&†pDY6Ò0ѧ0Š>Í5®^¼ße°ŸAÇY×VüO‘“Q{Ÿ¬ª‘xà4Õ“sÖЄîhƒ²›Î[¼d¢˜P"àVªï‡µ<_q3gØ+¾êa]˜è¡k.vû À€Û^ÅôáËR}GÜVÌPÌËT{½~ à 3Á°z”=3U;XˆS#†Ý¾†äá¡dÁ—¦X”Í ø°vLƒrƒ«òJN LDÍ=Ü! `>Aº;% 4Ô³ž "­haê;:géþµ™ ƒEAå v—`Ôl¯QŠÓQ‘Ô"Yˆ.áÅ#ÊgíEé¬óBý̱÷uðE‚D4gÔ+ ¢Þï‚ovÄ ±Ù&ˆÆé 4)9|žÄ)J€ 2ª-HzF)Xm\ kÕÃîàÝòu?ÿ9 hB Ôò\õQ&¼ Ï^³"ÁÍ7ܬÛD–uÝÞŠÙPÄå¾VcUŸôa7¨e›œX!C;ˆØ´Ž%5G RÙªÁm®Ù{ðCư{q_>Û”?°§½­ž+kX„§•¤¯!ö¼­qLÖ@3˜72ŽÇ>æA¼½Â:G —ŽAÒdàv‹päw¯ØÿtØ Œ€M‚0–m¡åq$ÊÏÑuùÝí›Q¤Ï€XÀ‘m·hTê15ÑÕ"zŽ)J‡çꊅ’Ùd^Å)q U2oPA^ïˆ^ÄD\[É»|Õ~׸‚ÞkJƒM­`y²"É4{¥ìÎ FFýiLˇÞòF1Êöç]dB$.gô’AŸñw—ângÞ,Pâ2,Ô…¹³X o"AiB÷ {ÎMýsœd#‚øø[è/ÄÇ…GR¥˜ÂÊ}ÝI`™ì˜¾?΀7/m2·3wÙèã ¢l9_õ^íÙcð¬bR"yàÖ`8°˜”€ˆü‹suå?ê/Éšr„œíÇut #VT³üB…MÞA¶PßÁjÿ[#œñ|1eAúcNôÜ3œbºé{²/Ø ¹š|K=Šc)n º§‚ñ”ˆÑ8§u*HŒÅ<óú{«MÕ—°y«ºõ„¨Ñ©É#îfœ,"¥ÝaÔsü¡Ž· ¬t½+_ñöÔå#"®íKë[Bí½j@Ô½’¾ UIˆß«ªãE^È[¶N¢Î8CèL,¢Ïîi;‡ dJ{Ð®ÚÆçrÝ@ ؉!¡ç^í÷ˆcLB銛ßÑt{oÕPª0ÇçmœŽÎà]9{ͳ>ˆÍ“q)X«Ž Cìl”/¤•Hp³ð/°×9«Z3L1AÌ= FÞT®i¨2 8×½Ò'66¦}&¼‘6Ä=qå€v¥¤C\³+õE2Äkî×t~­Ï›0c¤ZŸ{ï9ŒB‰Ïy%>`ƒÁ:sjè‘εÕjRBw½¬'ÓØŽñºô.LΡ«/p­º­uX2Ó¦EÕ¾qZ}æ÷Ö™¤½f0»wñtF’‚*•Q Hu;ðá ?؇¬ú¶. * é§QÈÈtà•)-±É{=í‚Èã`&,h­PI_ú» ÖöÎÚ·è(o3Xq ·Ñ,±*%Q˜Üÿ.œg¼†EÑ @Å21©œ·îû ´B° žH…þÇa^ ©©žc÷6£ÛÃ1Y ›'5ü±R; x€ù<–ãa¹ÚÍ«†˜|j;&üì8uVzLŽ’ Öè¦êSÔÀò!ú-ͬZX~ÍØYÁ¯èüÉÇ5cÔ’œjV4aAW‹iÌn¨ãgµHéþd¨wPâ»z„2h6m@#T•×4ï .FÈ|‚Ò@hý¬ÛžK»×ºàϵ:å=5ó8c¡×ÀÛ”–™««x4¶HxDü‡9g¡:÷3ÝÁ¹öî¿«“‹GùÝRÛæ¼©ÃÐÇG£w«S‰P-\Fù]!Ÿ‘Ó%Y¿£ñóî8'í NmüB×Û@F[™Â0wµpþVósn/u¶VœäC”4’E“±œW¢ ¸ØXAX1[¢A:3Þ{Æø˜Ï5ú»­” þ|ÎÐa¬>ôÀ„@ê0Å… ’(ö":åžãÇ•&¹Êâü?®Ò$L˜8˜Ã?«è…>^ùè2û?^±2ß Ñ|DÉp»/³R–5ìfãA[dR¢?õú"NÍÈWÂŽN””Vž!º_ÁR”Ãé~âxÚ2¦Ä–îÓ9Z€Ã»Ê–%%¬µ;0%ObÌW’ä}ñ¹S™°šm;é§#—M6,ç-©ªìº~ËóÛÛ™µ"jp”GíC&e”ßžð‡¤@P¬«çïó š˜…4‚©>Ü•f@±9Üžå]=r>ú¨Ç7Wäî³ûxG.Æx˜ü¦F}ù.Z‚Ò”v q]àÑ¡üø >,î>_©ÛmW.3[d’þ¿q‹’«[œ?ÁŒÿUsØÍ¸Ö˲œµÏ4÷ó{OüóLñ±ƒ’cwÊ:iÔbƒ“ÈøùAG¸Þ|¨ÜÀ ?Ӝȉ~<'í<ô?%Z…>ÐÀ§1aìËÖå5`ÌŸ@ÞTQPTy×?‚Õ/ÆÂ(ã}Ä&€Š9ªLÔÔÁJ•¥ù–ß–Ù,äú§sRê('Ù• rƒÞ—ÔÛä¯~‚§ô vÒ÷RÝòo9¢ð9\)³˜TT>*ØVát%ò³nYO .øW?Γt¬1;Æ$te ¹ ‰8Æô¶@þA—ë¯SO#PaknÉs³Çq"×¾,Ðr÷Õ#e@”„¹ â.]5ØIj%›¡ª'“GÆ/^ó´òñrÌÅ*±ÒXRok—àå GБ±„.ö¶“Xñ8Á²‡;K+©.ûŽ ¶&–Jˆg‰ð¿A ç¦Û2jºí×ÝŠJ[ÞÖ0›ü Êü›‚Ì3ÔU`cJX„®[ò–Èd Œçî±0_ݦ,‡yIã¬C¨FòyŽá*'Õü9ŽDÂ>-Í̺éþ .vMîIæugí%|mCT1ÕëšÊþ.´Ê`BO·6Ýl>¯“cÖ5lê#Ü‚¤Zÿ¾’>8kÀ½8ª6¸–:Ñ®!—à_¬&ZA—5iŸóIN»Š‚µ­tk‡\IGXЧ»–¡'ÿñäNl4‚endstream endobj 951 0 obj 4829 endobj 955 0 obj <> stream xœÍ\Y“ÝÆu~g\Î_˜Ê‹/RºÐ ºá·8²l%Ž’È£*§¬< g¸¨Dr(SKôïÓgíÓ `æŽé‡‹ä½z;ýõY¾sp¿»šÆùj‚?üÿíÛgÿôåì—«WžMW¯ž}÷lÆÛWüßíÛ«ß\Ã#a.—ÆuZç«ë—Ϩñ|•ÜÕ’Ã8»«ë·Ïþ|š‡xråoâÿ\ÿ+4˾i¶®c\JËë»òô¿ çpúý0ëšÃzúçÁþs8»Ó5\ÿíp–_gï¦qš0•¿c¹ëÂ\®Ùÿ¤}IîôEéõÓ¿| =ÅòL8}6øqš¼§ÏáÎàŸòŒn\óŠÍ`Bÿ®ÁMý/§?ç¥\uîô߃+¢›±Áõ¶úÓàxý>]Í¥QŒÖfœý4¦ò™ä0ç²Ó4-°¸òyZKƒ0—UNcöÉ%j}†/§¼œ|YüìÃXæ÷EYòèÖ5ͧ{óð÷py °äE”µ,eœ)nÊ×'wz^DƼk:ø¡,qIÑAO~]ÊåÅvúZn¿(·Ó4úrûCȇ57£ÿ¥t?&Ьh"9,<º_×Ó[hžÆužO¿.ßàB£óÞ4ù~(;–²âŸËí"Wöá=Ï=ÐÆåà ¨Û ]à,á¹$áN?Õ•šÖ0~íVû‚µyqç²Ñ1®™ÖM¸ß ¯HS!æ@|KÂÍ/rÀåçà«J$OŠFŒW“EÌÀñ\Vì¦Ù‰eEHâ™/…œS.k÷F£ß>Q¸ ¨!pØçñôIùǧÕAq¿…5Ìl³ñ¡&­¨áy·P‹¬—p´ŒA`ÄŒ`.ËX×U…D7ê¶½¯x²·UO˜–0jyªX·ž±¢ükç¼¼Åцå:«Zƒ$Xi™\]å-‹–%Æ0g]áýR•\û® *sÌTÍ# ä ýhHAä;ê}V`ªn,]3‚÷•/ÓÕbaè§€0ìÕÍR·ö•´Lrá+4‚Xu¬bf¯%tû^ò1â ’z*ÐJPÙtuOè!é-²{KØ`ŒçQUˆÌPÔ÷à‘@êÉ2¹ãI8np*7.S5åq¸e/¾ÖÞôvÚèD ,–I‹¬-`ž•eF·ŽäZÄH*‡ÆË|œè^™5î+o©,ðÉ+8ÞX¸í1Œ:Š^$l‰ש™[n]eZœG£èîÐÕìUƒkI‚,P‘düqa#9Žgx¢8‹cñã,oŒÀB_ÿœ§\°9·lœÛâ嘠„ÈDçÒ¯Š^×ß©\úí,]͈¼·Õ€gZ‘`»LÝÁ(›Û.Çu7t£ DÖæ£=½dÅçK< ðfF¹;«{2 å¨YxW]™-”P‡Ç ð'@-lÏ.š¨ùzëSm¼Ë'š±‚/Zk{’[g¶7NáKz5D݆j8È8¢ÁžLƒ8òqÂŽ’ÑÌù½à®EíØoHU–“ˆÞ/hDwæø­ø ]v_žëc?C{o‘'bUo:­Ðü¢ŸòØìrk/X·ÜÔÉáªXMI×8÷„3( Jtº_ÓÁ/áßfë{¨ê¹µGÈzH>Íh¦þ¡‹–[lX”NíâÝNœÅ­EMF2]FeÕ™i¨ ‹û³+BV}Fëm£'œ’¨a‰Jaõk] ô'ꦊœ&ôñ¶nië‰Ð6óл1m™@BCº‡š»öEz0­‰N#{Æòu>ôg<õœÈ +sóJ3ô*å#ÃJžìå4zW ¦qøªƒ,€‘àþ)æ ÔÆÜ(| GCf<8e Äÿí…O°M]›ÍìØ|âÒ[…vGnO<°шˆíÑ{åÈFn£³MWV1Ç6Äb·qrFˆ¡ú2B$¨bÇœ§Ê0¬Õån45›·Kb,œtËA‰ñü@61[N¸Å¿!*ŒŽ¢ãà €"^Ê¡ª$­ºÈΣ a"&{Ð1ñ° 5œê²6¤b5füÚØž(Ï®LQÅHÀ)xÑ^ÍÞF"w¬+žÕ´µJ9o£RÄ-ÇC†[Á*>“:q•Ú)æ0ÇD< ”4Û0® v6Î>Í2T«@0i#ÃÒ[ÀÞ¾þ‹ò6x^[HØ"{Fà#F{ö »†¾ üÈ<Æ1çùJá(æc'=>B£-(_׬EÖcwäŠ]b“¹c6š$…V5 a܉Á\"~½ÅH–ÖoI$±€#ÐzèÉŸ~30RãÉoŒ= -äwx§­mñiº( 4îH»ÀÜŸ‚6i|à ޶ÈàÅÍ]t¤È4ŒàpÒ˜³_zÏK9á¡v’¥£8îlŒ¥Ùr³;ÅQç€Ú#9y‰Sxüú©ÂTLœŠ³)l¨íhT™Ê«F‰ÎµÚ¼¤$ÎFZ[­·ä­Aü„"iQfÏ·š7T•—AF~Bz‚ùç†fÆI‹^JàV5g”ʽP¾z“•G3BմȼQgߤE`Àc—V~amž_èœTår3 ùF)3œ»¯îઔ“ é—Õ«ùfhµ™Kd(T@Ù§²nØGåùa&‰¡Uf9ký@O¾ì×§Ao”ãµa Tú6C¨ ãᎌ¥1Ÿ¾¤ãéĈ-׃á"H’Õ9í즋ì‰?®÷üB€­#§ zw†‚™‰Æp2`˜ ì‡aÌÈëù¾®¹KWÎd>L€¯Ä€‘ÉÔ.d~:×Cë%”Ý7…(žNU²¥b¨#æ½Ç”…vã:ȘÍh' <Ù‘äq¶Îkìn*y& ¾C6˜1Ö?Þ)ÿèÛHô­,)¶—£ê¶ÙRÂ(°¥‰Fˆ/ Г`IpïD¡õi°‹k=K¼ó´º”•v;["ìá<5N¸-'M@-Ê&7fVIIXAƒ„ðt+×Åéö,ð#&çµ£ÔHÔ ’šfzõ­.Ä·&·Ik2|Võ¥ÎM3:ñ'(?'® *fÙUy¶”ÀQη$¸éqEÙdf'¼ÕLìsdZÊг-*˜ÃÃn(ák^Êx¸xQNx‡$£‘•$Áü$ðFž8#~~ Ë¢fºÃ°‚…¶šï^Òfâ+Fr¯jàfri&TÖ[ºÕ]j£åùe@짪û%¡†±ã/¶Ž©ÇMª@õ] bµ$á ûu!7ô¡a2µëq=,eS·ü3æÔæÑ)”ŽC™:‰ú¬|A’Å«ÊY¬®5wÜyËÚæ6º%ó¯Exð÷ßÈ_³þܲ<îNµË&: %oAõǵõõCÚ_ìVªe…ÆåìVh#,¾}gídý9‰` '±à´†ðH]y½±&êƒož³8Ð9¤§ò&¥=þ8(§¸Ç Ée)|gÌó[³s˜2ذ;ùCµzDˆñ€ZgŸ¤í²ÎÙH¶·Ä‘õ-¼µ‡\9% I“Mšªt„÷ËKZ¾€wª?.q‘R¾¥§Fµ¢ÖßYã¨~ q—n”–³Ò¾W@5Óy3p«#h‹%ŽÊe™6eT»gÔÛ4_~F¨|¨"çŽd­»Í[§ÊVÀ„^¢eC‚0 ¹R¼ÎV?½”pÒ2=(û©JËÇIŠ‹„ÎUƒŠýZJ‰}ZšRêeôPA ¥Ä³–ÿ½^wõÚå#<4u©~£±zõQe–3{!ä?9cæ±>Ø×B‹wæ, › eÔs­³ú¦ö’\ö¿ç•òDšÃÐµâ–ÆÔ* ‘~‚Eª)d ¨ZiÕ£pÖ׌þþ“³JXLcÁalζ Ä+Å`”ÂEÅ`*’×´­lI±@ r-|ÔÞphR;¯‘ÊÖxÿ~ Šü¯ „7è> `ÏΙ"¨¿ÞŽ™ù:øÙ%o}7—& ZÇó¦ÇHâ‚5·Ð.tþwkß]¢r©÷ŠûA3ÔTàtñêÚL—àUN'˜\T0TƒœÎ™‰f "‰«A7Þ?®!Ù&šÀ„ÿ·+£y åöp,«~¹-ËaL+RNTéÕzd¼e5nÒÏ´Šϲ¥¡…¦[¦Ê_U2O• ‡€˜P·gã…ºHÁs±–â•§Å”} ­—Cûd¹‰˜Ë@^nÏ/3"ðeMâÇV*ü˜önFƒöÕ©aï²Ã»t0Èì;“õ×xèz[·™u-‘ͬ·jêÅ]'—îª(š@Ã-B§?[¡+©¡9¯Ì3U+ ‘Úâç  “õL›hÞ:ޤ$“êK.uíxCŽ]¼D`þ7¬Ë’Û:»à×äOÁ†!ÿÙä'$<çÀ¯’ýŒéÖCçñ } ­G ˜üJï~Æ!Ðdá{£•úób˜JWáX÷}/à*`M½yÚQ=­ðWÚŠ¥2šéÐnad™Ñl¹vÉB•Ê.Y$6îÈ%óy×é"Ç\Ý,HŽ*\¶ns‡A§u„-!¿×”09Òr@j”W…,”Wê5ù vœM¸D­ôãÔ]{8òiæõ±rÇL•"ÞMÒ^Àðò¢ÚÖÆ°ŽßG“‚“¼}AÈ­¤¨Z—¬\|‚gt(I0ù’TŒôJUO©LÁýŠÍQB>KýÕ@Xù?5ÉkD÷A68ô»êÓåéá½ fÉ5¶…Vª®[oº~ÒLUÄ}ÍÞ:Þõ[õ‚ŒŸ/{2¥ÞãÜÕv{zïÀœñ’°Æ(ˆ9;¢,¶ÉhCyèÍê(ñq%p]äÓ¼rtä³>¢=¥4ŒŸ¿Øè\ò•¬$?^’üÊ.evÜ(Gä£ßJ`Ô¼_¢fÆØû:]™¦×4;œ£yîSÝæ¯~½*ô¦ìÐ _R㢆í÷ÈŒÃßzC¿„…R!RL ÁmŒû@ÛÈÓ"$£ÃÕ:\J°˜š±"ê¦C¶…Í¡¸ÍÜk[pØHjO 5É–B^iñEB_¸©VB쎣%»—Š­&ì`Vâ{¯ŽŒ$ae­ßAy¸Ôt|ô¢@5I|B _¯/ꨮ™dŽmqüžÛÙ‡ÚjÖw†Öl~?[zŸ8ê­ûÒ'x8ÿÛÕÀÕÓ UÓ:&÷773Àáð´À+|ؼ·³¨7L•¨0 0’V®½ÎÓfºè®:|]|3T~ZfòX&gmа„»1Cü ¹œ‡49é’ÉTÌÈÌ¢V¢€è>îMDà¥2<æöƒ©–ì;¨ZDJÖxÄLòm–¥e'Y–Õ@Úœ4/[±ÚÕ=¥J¡ž0Mý̽=öw5aÔ'‹·1$;n:9òRçƒNŽèœÇÔ†Lj<ú­—Fo3”Kä?šò‘?vþ_þØÍ+Ó¼þðù™™—åbr>6=Áу×écú蟻á'/ù½ý!$ü¥þ÷‘dGá†ñŸëS¼ÿšY—Žß ^ßx^®!L–7j0ä8Ì+©™hÉN‹q©Pnÿ÷ƒ¾¢.ŒU¦ŒŽzwäÆFRùm¢üaíZ3ëUâ3yŸ×¼ÄkR4Äp3#ÞÕ·¦Éúô{9l«Íß ½›nMá9"åÐÔ î¾¢* è÷ì[5…}ˆßèøÄ5™Wþ+#n’èç.¡Õcoóà*o¡h£Í:¼2Áî‡þ†%¤k\ü3yOËÓ+=AÜAÎÿöúÙ•?ÿ‡DWendstream endobj 956 0 obj 4954 endobj 960 0 obj <> stream xœµ[YsÜÆÎ3㱋”Ä\8”ʃd˲R¶ãƒI*eûa-R¤ÊiQ‡£äϧéžKR±e—È%0GO÷7}ïËM׺M‡ÿçßO^ëB¿9uÔmÎ^9z½É¿ž¼Ø<8Á!c€GíÔMnsòôˆ'»Íà7ý[ç7'/Ž¾ßº&m;ø×6~ëé÷nì\Û¹´ý¬ ÛÇÍÎo¿hv®¦1NÛ‡ø÷I³‹ÛÁ„¯ë?žü÷Îî“kû¶>9ÍÛá6S“pô.¿Ý…®Ü4•A?4°ÉÐ!q{_Á¿×@Ð>žÚ®èÏ‹f×oÏàYÏFú(Ãá?á»7ðÞ8x÷ ‡EYŸv ‘8ãg8Ëö|x ÃF ì·¿60j“‡-"®û‘Xó .½‡™¸ßM€ÁÀý{ÆžØ cð¯1T”Á#ï‰<$LØØæ×Íþ t.ÜëÇžf"àÙÓfpa§gàõ‘±¡£S Û‘¢W‚ãó¤9ëN•¨«& pì!Ù“Àî ˆ¯Ç@¢ž˜4E¥‘9ÍÄ»°}ÒÈ"8ë“BD6ÊšÏ2ù{’³Gv€žåtYnçB›úÎóqìef§')‰Ã@=™­—Qá·nhe7µ°ØG'úžPJ ¡mÂÔD¦° Â4|Ú_ùm¸'yí"Ìÿ´‰ùÌ~Ã£Ž–8iÆÀÈ» ª“‡—~ª³€êÄ„_4¾ç J¡~ 9÷`ƒc˜ƒÿÞâŽ2‘Šl—.Òö*ãÔ–Wâ…4žšëéq+$mD„® Ñ.¨¨áFÚtÂaÞ`çBW9cnÐ$ü"ÓÞûÞÌÔ2 zoÀ¥Y*C”ÏMMÓÈÇÿa RþÏM*ôÛ&xÂÖßð¯¯`ÍGðþ‹fÄ­ƒ» uMú;p,©ã²àÃ" ÄÀ7 +ãqM{]Ê¥Öx ÈóiRœß A}Šœü<ã¥yià´ó=ß™ ÁM¤õø<=Íáyy籺Àr …ÛÞÈ<£ÇÃu-%ó|dÝü¸JÔÓÍ¿Æq¬ŸÌ²ïÏkÛàÒ/$“±~áE­Ÿ­ !‘]êì"gƾ‹•Š ¡§‰Ÿ `ÔA!ðWpJèÁ9-@ý)#‚M}üàüD@]¨Ã >é%À/Ï êÄægåÎè1z#ÄžVˆàæû(:g)Äňðˆwð`æNÃkÄ`¬nœ?‘(߬i<•™±ü÷XOì2!;6ˆÖ'ó~ ²ÿÛ¤õÛ!2Øp·8Ý’%Y—ïá þû ®ñu3öHþ°½ß€ q~/¤;&Ú“´Ý¥è¦àب™ˆ…ö"<«Ú;V/»$g^ËI–Óè/ 2vÅüÛàE¨:ƒ¶W =ç q¾ÙìMb–Br⓸ ¤DÊêk6n*\Ì^âY¼#vç‡Å’|!בêàA#ŸÐâ|§×Oóðä蛣—›Úž XnÜÄ)­7 þƒ›!ʃÇGǿܼ¾~svtüÏ;:þ<øúøõøÓÍŽ>Þ|s8x©ƒ ^â„€Ä]$~ÚåTŸ”cÜoƉùaXñ¸\3뫌ûèö3£ŸD¢[Xk¥¬y «'Æ·³7?±¡Â?J12v t-]üU‹ÌšÁÓ¥¿³á<¤‹úCÎo¿ÏmÇפèÔ¯ííüÀi]+„J+ÈA/„¾#²"+áKùK8Ä¡bôˆÄ ÇnWø7jÖß ôª¯Xø5´ç¿Qõ°ý¡ËŒÌ,¸| @g-MÛ¡–£H7¯re׿(“b'ë[ðˆîs¬çÜ$âÏxÍ.¼_F6ìÅC! KÉë½ñ^°4¤›¼Edrr¤³8ÉdcžÕz„#'ŸJ4q¯•­vì˜9zˆêg†Äjì£b–£Å”(?]F?ž[_ŒD½n`H“¦¾mXyDwk ·€Mu…9¬MÛkîæh‹|­ŒBÀ0pJ Üù=}¼‹w‘]n¾ÈɸFÖÅ—ûH_£FÁO½zuBA‚ªž}öñY_‹üî¡BUJëÚ=ët›/ ™äX*¨:‚]7ùÐFp%úT@½¥©‡}bÛGö!Tq­C)$Úû˜ØN4ø†Å#/›æsFÎä…š¿cÎÌe$h.J¾P£i]' Ôï6 : tçRoAEšO“b9Ô[Üò  ¥ù†ŸªC€ƒ‰‘ïvmu0½Ù!ÚÓ¶‡Ü±çʼn+ü²vР.&¾ÏyµEŽ 3ýåäÞ°4Fgõ!üÝ‹ï8ËÁfÕf³EéÛT,JV^°*é²åñ²¨s¨Uœ' ìì2 Ãe͈,DQg$Ç»@ÛR5w²X6P|Ê:]ÀyVåå8uÑòDä ÿ) Ï`ýgÝÅŠvÆDãkÂÎÒï›Ä$VTIùKf®Ç55€"Cs1Msd[—£†ó5 bâ[´vHº-W]bÄ%ÿM±!ž™µ`Ã+`´VŒ“ðe_ñ»ËÞæšŠtñ$À·1ßÎ.»ä·Ó¨I>ž[MvÍQE‡«A¥Ì&b$H 6 dÙS1]DcN–âËɺ¦ÆÕ&šÄû÷ £”\¸ªsGHƒ=¬ù@õRŸà‘\* y{tc>SþŸp%û´rÁÃCÓìà~ÈèEqÌ—#¿TŠM½±ãqyHÉ€‡x|v`ëÄô[ÉîääL²5-ƒì‚Zž;EF"&Óú)ß^åsFÊ–È.“þKU\œ3ÐhýØ­¾ZÏ÷X{ð;â,_ñHj YÜA}8ãèctÉãïç}¹!;ˆIúJÆ(¬ŠÎÞ4(%€Úè]ÃÅÑ#©Gf÷' l\¬| Ž·e—_$`èƒ ý"dÎyØ VÅVXýhIæ²Ê•`º}DaœugJ†þiåûñp¸j‰¹ Ž0.¶y™â®î…ÉÏs\68Jw`8·`fB/%©þ<×X¦6s¨L?Üv:Éê­¿c)——ŽzÀÂ{AÅ\fQN:Œ¥È9.¦ªÒ¶Ð=¯Ç˜®\H™äz« û¼=¹âË'»6Y&³Ø«à7(©»ƒ£¥D 'd)q®áP¶o¸ ½Žc×âå fR³òàÂgÙ•û{Md¼Ÿµ ñ@„äÃå$ÞÔªSô›ì愹<ø=€mï?¤Ýœ(ûû°FÕ‚p†Ó·&¸ÃO®Üת@±°ßIê®_˜Á1’Û¦™§WÃo7¦ ÉxÀ˜.ã?÷äæ Íin9Ñ0K¨š$ëº"åä&'y¥ÄÏ1w°¤S`¡§qúÀyŒ„þqŒ3¹£Ä5ž÷5mþeåšrÐÈ)ÿÚ’a£Ù°Á*jJwß9ŸH¨q‡iâ Ìu È±™ >w€Šq™®—&­Ë˜üxy% ÒAà°ˆ•7P6M£ëÕöÑrÖ`šeˆœXì;ìü:ÒY~nPˆTxhêîLS{»è…¼F! w ´pm='öºÖ;Ê TT…@â±êxNÇJ>„LéÈñNjcÐ2v-Ùs%(¾Œ\ížP„y®ËT™ï8&¼²Wç¼Ñà~Öm¾¢x¾ª¬%zÁn oœÃÉ0ŸÓ9âY™Æ‹º,à]_j$U5Ju²ôqÖËÅ`¨ƒnLÌ=AdpSÅ!P®®}m“§U††Þ+õáqyxÝ”–:óI^¿Ö‡myøDž­-tyóœ‹5Š®kËŠš ~EÅ.̈_E²ŽGNËǶ }­C÷««¶´ëD‰òì?úq¿Ýhº?«¾Gñ¶Š/ö1b©,ÌÒÙÒ°  çq8;}§]#(ÄžÕéÓëò3¾ Šf}>O•’‰yÇŽ/U ¡T(JÜ™{RL\j:Sl˜Š¥vÌçL¦•O]SâUu†|¤y.™”}u‹—ö‘¹ˆâ Õ¾d®d¸¡M¥‘Ï–³nÃ2½¢u‡øç=Ê„[.i#oksCPõ½xB)¯7+­”[)À™¶†œo- ©É0E>/±âeÎÄ̺$Û[eÐÏK¾ˆVͧ0‡CÒ‰$É‚ý}¤×l ±zµñOxmÌî>&Vè“bAAecï]ì¹Å»Š÷‚ãþ©A\ä{õÉd'dÕ?fË=‚c$”†ži\ï¼­§‰ø…_| »>ÚLÓ€zÂb´Ú¤™óUg+˜ý¬B¯d…â@´KêuÞ¯ÝR|ÜÚr?Ö8.ÊÚžÊ+õ}ˆ!¦ã©j‚…-z‰2`Ü«p Ÿ*¯"qLjÍ:þìÂbã¸Ö)§®Ö¾n5Ò¼n¿lÙò]+ÍR—$´[4gîc4J* nÃV¾’â+Úìš®!3M³¦ÇB;¥Œ3otÌéÒõ¢‹CyE‡•ˆüP“ÏÓꜧÅJm¢ÕŒ<ŠÜ±ö›pXû†Ì†e:³$àIÓ¿`WŒ[<µ³”½ä.©4 DFxÆ ¢¹ž<°ŠSã”U  ÊH”R}6hÇßX«›‡˜”[5,g£V!¨ÎEó—hÖ;—ëZœD,o™iÄœ®¿™*P¯ ÂÐŽQÃX ¥\¨…Ðù÷À.sk@çn7x€:_¾—8±JÑUpœ­‚ q’ëd¾—_Ü%áóÖ¦S[ߢ›çµl2Ì-–fÜg ‹ª"£N;d” 9+M—‡²|ŽêÜÈ\3ýòƒBúB˜G³×þøÃK`£Ž|ŽUð"­{²²“ñc×¾¹t‡SÏ}FVÎò½ÉÙ×PI$X¶£¯Î*s«Gv"ú&ð\¨¶ ¶p@nc=ø÷ÝÍüOn÷>?¼–pRã¾€z-uò n#šÍíKyÝ_%ms-ÏF3²F•²]†W8Òs¡ ààÍZPºš½]Í Ÿê'ãäÝæ­d‘ËœŸlµÙ¤ŽÿŸÕ1dóÃÄí~郤¿°×ŠzN¡vWQf‚@*}sô?*7Ììendstream endobj 961 0 obj 4496 endobj 965 0 obj <> stream xœÝZëo#·ÿnäR Ý ¢õò±¯C[ôšÒ"MÓDE4ý`[–ìÚ²Ë>ŸÿûÎ Ér—²ÎW$ ŠÃÝ­¸ä3ó›çòÇY]©Yüÿg›£ão”igëÝQ=[ýx¤èõÌÿw¶™ýqS¬‚¡j¨5[¬ŽÜb5ëô¬ím¥ôl±9úg¡Ê¦0ð·.›-þŒËz“,†ªiaåb ³?)ç¶ø¢TÕ0ôv(^—ºøºœëb㟕óðâ›rnt]ÕÊÒ@¼¨à­¶ Æâ‰ß1­@B_ÕOKÿãS¤ÔÀ[|^šª®±ÅŸðÍ—øÌ1VWC?Ð2<Ð_x¾4H¿-¾-ç-Œj]|_jxh´¢‹²·´ê»R{þS±Í½æ¦®:xvrø¼€“º+¶ÀÙ]9oŠ38ðy8«).ä ì c¶¸/M±„wÊ=né‘–ÓRœÂ'@榃kvHZÑ.¸%‘^á48ißàïk˜‹G¨‘v_<¢@ýzPª¸€YŽI£†Dɽ®:VòÐp .AĨž‰‡AxjP·pü9~!3ÿ΃_ËÌßòà­Ì¼äAษ‹ ÞÈÌs¼—Á%þž³:TpÛöˆVwtªïË¡&y>•ô(b$j[RÅ ©”Q¼;ÄÜ6¨§w¿ïËp¢‡ ?…/`"âÁcêÁç”(ë–²ýi©[PicŠ'TeO«/½þLH´ë4.t/o˜n*mgs8\ÓÖÚ±K;? >nøFçöèk"Cƒ Ã3[dbëŽpÆtPDpÚe€8,4*°éF¡¶$¥‰µ[ÿ»¡­Þ”C;Ãó÷Ñ´ŽŸùc0©Í ¬^ALÅE)piQÄHÏ‘ˆ¼k½ÈyáNœ0¨âßщl±)Q¶zè#78æd®èÁ ©’=Œv¸'ŠFÉi½–§¥è5ôK~(/áÖL‚'êÙ‘´ULâ-r$œX7b@·LÛ»'~!sëÂÂÜóOÐj†Þ‰Á£ßÜ“|M¯H…yñ;G8ÔäÜp×Ë`Uø…¡kSrÞû·ø(ð!:U4ðƒûxsçú7{ U¢v\ïZžD;\VÝÉ9”—óû›Ä=²B–¢kü›ð¥ºN!aN ú&‡§k§ÁFŽ~…wae™[$È{ÁµPÊ‚p5‘YbLw9<ܰ†¯¼ÁŽTâO/ÒÊ©ä:åÖ‰ðä^õØ#×Ä@ñ;æMï%;È£cŠ˜UÎk<$ áù'ÈÃÆ€R69øÞä7¹}y0ì ŸÙá<ã†âÏ>:¹y†nä»ß¾ßÉ3Õ´nG!J%‘Üy%í²ÿP€ùÒhZ„Y€ÏÿBé«lZ& xU%®Î •,ŠMŠâ¸QÚ»Ì&MT„Pf¸‰AßpJ‰u9šÌ8ÅDR®: m=DÙ€\ât…õÚ{£ŒMÝDµ{î«ÄQréS®´¬°ÓuìÆô†²„¨YAr— MÒ®¡†^Ÿjcûî%o\mðf¾ô{eÒF©^˜€¯‚I ir’“£nX‡fœ²¡ø¨u䪔­×W$øÞšà˜ZÎÉ·JœãvÐ*lqÍ ¸#k¢> —:¶#¹2hÊE(ÒCŸÇt½QÒv‚/NIMOü’Þ¢¬˜ì ¸ØF=”i]ǾÑ?í«‘æºë*£c'0çóÚGfITŸ€^øø >Hsn\T¾Ž ~>ú<Ô§¯ë-6ùœBœr”WfãßqÎãÊÌ(1“™·¹³‹ŸÂk ÞQ¤z•¤•!íÖ]¥tm¤ÌeùLÆ¥ìÅGüÔá?*ùé&k{Í’Ûò“¤î›\HÒÛ …š—Õ¿ŒšŒ %ÕŠ"’P?Î%#·¹-åé:·ÏÝž5SUç4:-1‹RÝžÜí˜;JÖƒZåxô§Ÿ œ‘¹Ù{ܘ±Öa‚ÛӱŘqéÔ“U=±ŠÄÔÈžx•'ƒ[¶ÌlÕñ$©·ˆé"I¹9IG.søX¬p½gf ewLP )Ÿ'H31“ ´Nrš9¡ç¸ºÈ!f“NõlEè¹L”¹—³~OŠü-8Í6j7EÊH¢›—fÝ÷^©¡Úy$x×y2+'^.ÝëÝduFUìÖæ‘_ûÿëDãǹR) _%úL›üËÀ¸üô i·ˆ>¼“kh¼‹{Iuä·fM,Gîå!ÆNPO¶ÉÊ÷B:¨‡ õSI\v(>ÿ¡¯DJ å“  §Ùñ^ì„ÝóD1ìØ…sfØWξL„;åiæÂ§'Å_eâÊÀÅéº2'éþÇ i§‰8žÀ:›€L¤žéÞýOì>ñ¯äy~¬Á:ÈñsÆúç¸Îô?;‰N0òR&§=”ã=¾ï§àzä²þñ.ëçÒ¢íšQ§%M eMÈ^^æ}ïë#|¯ïSûÒœiÄ̶¢¹Êq8JRÊ| ôtÈ|Né%™›—f>¢H‚ÂY|N_©_òÛehhwœA„Œ)ëHC>(O¯¤Ÿ1°Ø¡'Å$ýòé–ié«T®£Ñ¢L³K©+®âpo9èLóN¿ä”M-Z÷"xMU°ù=ÒlßRc'é¹G[>[Blsƒ‡ëiÙ}jOÑîËî{OW;oìKïˆã&[³¦â¾Ï¹¬y565]éþ—áóv$?}.ØÉ……¤ŠžŸwHÄ3SÄ@G©¥ßåxÙ%œ”?m8~AN¿è¾jûZÅÀ·9ý½ â7®Ýo[ËÝü[áWfwAîÛpéMiðCzݧsK ÞÒ ™pµŽ¯ „+&¸Ñ¥ïÞ„Ýi]]q#Û]ŠÔá>õ#™ž0΢v?h»Ãk'ƒMnEÙÖõ]£oa(Ól¶x¯ŠÚä¢"7}²úÄèѽɾàËEEÝtjáiº4êøGWÛœ´•êF¯;jöGƒNÀQz2¹‚ËZìx“Aí]G<ÖíóÄüâ?ú¬X»Ár ò«˃_yr_4,tÝzÕðG#ë¾|Xî»&–äfU‚P1€¨¿N‹6,õøêStÉ$š}Øz×Dir2Œ¿ á…–Á1‹ÅZ_4î¿ESmÅùØø£W°Go+@1 í0DÜ:þbWîœáËÒ–D¥C²‰÷{OÄH¬ʛ-௦h‚¿Ðh¨…cö É‰¡×xÖYŸ-Žþþ ’¨ñendstream endobj 966 0 obj 2847 endobj 970 0 obj <> stream xœ½\[s·•ÞgÆ?b*ñô–gÔ¸4íó‹/–²Â§skƒàØ÷5 ‚¾>¥Yá’}g:ôiŸ£.vóó v{#]ëš&¦ÅT§ª,,rßøÕ›voñ~˜ñ¡xõ{óÚÈoÓ©"¦>rÁ}Ô'ñ¶™ÃòzR*ë–iH½ç!ÓÜ¢è:.R"Ô†¢Uﺜpaýö3Zp\«C±>Ûª#Œ#öTîµêNë;Ô©ÑNsÄéŠ=)Ú\å°Åë.À¸¶?áÍi¾”¬ú²KU¾f*à9O·¹êŽŒzÌô6`µÆ™ôèRrª5¼ðÕÑÆÁæçÒ· P±Â|­ rQ¶Uð½À¦ õk½n(X € ŸHk»Š»º¡™†ÙŠ´±ábÑêÓE£t(zöe±ø†¬nÐì|&UÒ ]¦ÌñSÝ‚¢ä:‡/pÓß0lÂÒEÕU[J@,„´D%AÝDÜÙ]ð¬r)Ä4A·^põ)ìîLÅ(‹«èGÚÕ?¢xøô™Èѧ qO¬VÒ€}0ãÆÁˆÁ#˜ƒrÓ_Ÿœþ'¢9Ì–ë¡34+𽟠etð|¿Ïaôã°õ¦\a$ r!îa•þÓµ÷°ð¨’µñ[¼œâ4¡ZÁúç1’r…ÔÓî9‰§qè=ê%¨JŒÁ7Ü|¤qðIS‚ËÉvz©·qÆ~¨Ý;±½Ü} ¯œ£H‘#©aÈ m!ÁÞ–vW4¶Á‡`‚ û˜`ïà6ŒÛƒž]‹¸Ñ›–Ÿ—[µ¢~Ô9'ûLêsVá‡×:÷¤_bÙÊN˜mõY忍ül·Ô%¶Å½M&Œnà?Øo¢Ú •¨ür¢Ýmp€z¹.{mWfÌ}}P‡Ó¤;5L,Ï Lÿ´ÖˆŽqû?^|¥@ø³ ?“Õä៑¥a9)Ô=]Ny§yßgø>f¸íã.+”Uà«“ŠŒË´ˆ4ç¼·M?vµ+’òš7 WïÏfI€±T,å43“ˆžuF“p‰ hPO¢',jô$$ºFœUTEôߨY+·àÒ?ˆ5áò¿cX;JtŒ½¤—óêÉZÒVÐÖ¬Õ;Áèª+FÑPôȼîÀo}CÈ+”mÌX™% tíqÇ&…øQÌç¸æ^8WÜ~Š/™ ”kÜ¿ì…)Z¥©æébM§„uæÑh“n>7‘\Ê c$ºV÷ÞÔWlçÙPâ./dO¿‘>Èœ%¿¸ƒÌ8° ?½Gý[Í“¹iíj£Rc_É5îêÑÕ©RØBMQ”@h€ÑÿmÛ…™Z‘î”§Ÿª–ÞV-ű·¿uô*2ÅŽ žh}Vx9{]ð±Ìæ  i0ý¢œwA‡KÚÏô`ÁõF¿›¡Ž‚Z~£\´¬ˆ‹ú<&Ú;Íós,S=d8khw³Øªˆx;œ¨5OÜÉ„Ÿ© \2óê÷ÀbŸQ•0lTŸË»br²“£ Ÿ ù¤žg½Ú™ʬ"­FÂlÿ”ÖFç«YYêJÁÃ¥ÃN‰`LyYègY=bÌJC‘Ͻ^YN¤[»!Œ@‚UQTæTå|® Ï»Ê_éÝ# ï ƒ?¤L¤4`c¶î Xz£­ É0öþ‚'_ö>f'$v0?iw£bØÔEu ?=ñûª_uú>rÆOñý –`/¿/ÝÒ?¡<# aA<-éô]4/q€Ï•¶6Ñ–qïЂîÐú>TÏïP¡ÊŒü!çxçF!ˆ˜ÎñOlgXusUîÈÁ¿¿Ñ6t›R7õ}OíNßz¶+*ˆ éF¶>¥ }äM¹ˆñiKþº\4ï¹,g¾èââçåâûmÙ‘¯ÝÈ‘y×þfMŽ·åâÙÚÅÛ†ÄÉEÂ|þúÛn•~ïì {u­uP³åG×àþnbc±h>{ÚrH2þ)>Xí΄†UÄÀÁæ,.ÐмøÒt?¦ŠküÈô¤X41?yYûeX„ü´ó<;½ 8> Dxï3ìl .M1lxèž?|ñ ˜9PŒÀ†«T*ûÙsc #¡¾×(õŽ+·ñ-F⬎٠"®ÐÏ5¦ ‘Ç€¤Ý™ŽëödÂ9ié• Xæ~Ùù Ñm¨3¬zè}$1 ßù¤ÒœBfqÉÏVC–c|üᣓ¾Ù¼}sûääÁ_6îäÁðŸ‡þ=|<úbó'_>Ú|{8rÞnuœû ¯Ë^‘ePøü›²è(öÿ–AhÌ\ÿÎoQ¤£u£ü€#½Õ}}…³B«ØnqyPé6á™^Y¦Ô„µT}ò—[’+ö¶ê- ž~EïXÙ×Y¼*ï‰êëÏài7U™xC³_ˆÅ`{PÈÛ3¡€6œë§•hÕÿ¶ÐÙx¬{‰#eN–4‘Û&Že6¯ÜÏ Å ·Þlt‘\@Œ^ã@ È„(þ«Ô[WuÉÒŸ[¦94ì/.¨£EàTȸJÀžðmô^ÄáÆç¨‡MÐh¢‚£f}¤>BP«qk~$â)Á”?'1®P »ª‰Us „ÃæÏº@Î9…Oi'šüÎd‰P•ê'DQx‰µ8" ŽpnªQ;k'Ù +Æ,.™yôEÓŒâ5š&{¼NròóL§¸ZÏ~™f (±MS™`ÅR–Æ¡š6Fí-±z>‹„&즑¬Šxâ‘Qk–Hð(«"€f´Ž„·’y ÈD•d8ê?”Ñ­ÚhÒ½Õ ã°Ö‡n-¦Ù8–DÉw"öÎMÊ ÿÒµ?LÅ΢X%6iBfÏð‰\²+ÚÀÏ•Íèà…‹ú$šrB™ ü¬aÿ5Vg£eÈ`¾*#~T[{ð½H•ÛÄ¡O½v¥RçDjgïžÇzÍdìîÉߨ¤r“Ü/ô§,°Ÿ-m.Š{WY ¹»²ž¸)Iq§!Ò8°.ï‚ ±ô”7æufÚ0Î º…†£µ¶ž÷&ù‘f/`3%ê–&ÿVt'Ä‹æÜ—Jµ¸?p©ÍA­$ \K‡1í©£¹"kª’iY‰qŸ#åƒÕÈTÁÎÝó¶¾ã™”ñPÚ¾$p4¨!î"¡tω]¥wâ ­$.•ÄeáÃØ%÷±(AØøÑxÅEQénElh3@y54ìÕ4÷_W!WˆÖ“ÙøN©z¹Q»<[åLSñ<‡üc+!Ó”mlG)M<@ û1 \Ø×Rl…]î)ckBê’Ëka&' Ü±ª'»âç´5PoÙÄ¡úÕ‹’ Žsn©I´;G·LÄšäk[‡›v¶3ë=ò‡»’¡Þú¦çÆ«+¥«Æö+Õ+âˆá ¦:iî„¿W¬’L ÍÚLð,ãÖİb­/^•–b‘<Æ…+)È"×0–ØÍý%sM5ÕK[ÄBÈ#\5®òÛO¿êŸÕ¯÷znÌPV÷%ãJãrñOŽËýw¸€–t¯µüx†O':à Ҧܻz†Ùí‡1ðõümÑvì×ÃB:¦Œ†vûÙÐq¿ù=lú@¨Ôïƒw)È¡5è͸ô¢ÆÕB–õ ´5¼çÅ¿¬:HŒ|¤ð³9‚êiÄ⌈~br®ü÷i"W˜fËÑbs|ÙÖuU‰Åá;¯µ…ßûöä_8vµendstream endobj 971 0 obj 4920 endobj 975 0 obj <> stream xœÕ\ÛrÇ‘}g0ü ð“fšawUõ¥ôfYV¬7d{-Á±òJŽ0ð¶"ˆKô×»òZ™ÕÝöÃn08º«ëšuòä©ìùñ¬;ögü㟗¯<úºãÙ³7º³g~|Ðãí3þqùêìós(’úr阻ܟ?}@÷gS8çtìÃÙù«ßíúý°‹åØ=ÿOxlŽî±œÃXž<¿*¥³?¤ÝìûcÎsÊ»_ïÃî¿ö‡°;‡ë¿ÝäÆ×ûC ݱë6ЕÿÇr7¤¾\³¿Õº¤Š°ûC©õ‹=ÿñÔ4”2i÷å>».Æ´ûÜù >J™˜Â1σý^‹ÁÍõ»oö‡±\ a÷—}(¿ ¡ÇÎ÷s§¾Ýì³ÿ¡ŸÆã˜Î±;Ne2h^•šwïáã)|¼(¥Ò¾ß½„?ŸÀÇÑÝݽ…7åZéc™Ó®¬ÀWÎõÝî—pï >.¤(ÕvqWEðô£“OãÝ•îÖžRá»ZY¹e|&רܥöûZúE…ßh7ëc7ðñwé+•+µ°‹y4ã¹­™gXÎ~2­¼ªoÍÊ@Á)õfÐWµàÅ~*V4tÍ.|¥õ¼_ëî‹“ kÁ§Ú`}äm½m'Xêy¦×þ¡yÓú½~å.ë!LÇ^­ö¿Ë¦z^6BéP•)«ëæ²\i÷zðúEÙ«o÷Ыe`×ô¥ ´Ré1MtŸ OXŸú ®…²–Ãî\ƒnëÓ|­”)[¹Œî!üý²´ð¯ásÔ!»xЕgt‡Zy»çñCç.J® \{S‘å‡r»ËAßïä9h,4F¼Qê+=ì‡k‰gXéŽÑô5í>+?íaÒc—Žã,Àø¨Tüýz4–öv =ŽW;þ\qè ÍbÎÓî±^„óÆ0Ö2{Ae¸+P_an§‰~E&è'ψ3š'afÍ"œ=˜2èRYO)eÞîeMžk{0 ž… ÚgšŒ ^͹Ã9ûæl z.tvÆËŸú€Ëy[»{£„‰…•+šz\Xמg~ÈtêtF>eôÔ)©öî“3Ô.6äŒ Mö@.»,GoÀS‡óÅ3UWZšv«Ï/³ÓãšyndªŸ°Ç¨ø±Ô`ãŽË籘”f9_âÿrŠöÞ<q€]ƒ.EMUö¶W­¢^»â9*nõV+x Íç<ôA—û5Ln6SÍ ‘ù ~†~_”‚IŸà 9¨š&\ÅÂ(ˆK ù(!Žs‹O @{èú¡œ_Î'Ü-¸T¶š‚[ è.„àÂ4.qAzÚÚÖÛŠ^¥ƒ¸Pí’qíkSDÂ]€p2­| 1‹mA“îi„UÜ)жºÈ°]`eè`Õ¥|Óú)´qª‚,ìêš§>g¤˜|µ!|ç€m¥R¨Ò9¼óGx|D£[µtÁ*®7+1 ú)¼r]¡3¼bÇ#YÓ…¸ª+\§j n»E*sÃ(0Á²¯Sz ,(†Ú>oLËÁ‹lî>®ч¡ÚÜ-Mlª¸æ?(C¿ñsò$Ös䶺¸°§K5  Q¥•iUÇÑA3Ã)Ça-̲Ìç'¥Õ‚à@>Ù;cå9»/O@»h@0ZïéÐʱUœ6Ø/¸ß°à݈4ãÏ{ jÐV¿Åë¥hœhÑu¾pÑá—K¶Fµè ŒZ è"r7”®cû(N¶†nÍØwø'švã5®¤ž^üÙ+ Ö%åŠ7~YšÒ-Pf °RÍÔÄÃ%3šóº!ñD «®T:ÝO–«^ïÊ–7. úš³š-NáŒL·ªhLj« “ƒÜUWwãùØmej֛̀G&YÏD0ôjÀ³ ³.%Ý&ðh=BÑ’oÐÄ>yÝG5€ÞÄò¢B´D.JÇ%e,ôàŠ1%٪氟aö¦tS+}ª‘Ì>õ º³‰ªû³â‘ÛRC‡+æ»@ƒø…éÙèÏ- bYƒ ¶hªƒ­”¢î,˜ù±Cü-¨…bkb=7÷Ж1´[s0]Zw˜< =VX­ÎØ–l·Š¤›°I“oÄQ{p«¶sØ"Ô+ áñÙ¾xUQ2p9 = 3ÅAwŇaì°œ èÐÞÂäƒÆPü¦å¼Õ+ÂeÄW²SÆ©æ*MãM窌`'¡mý O&„ pe6pŽþQÚwÂø¿D´kœ’Ó¾Ô¥a–CÔ,cVj|nKW á ÈðjX†°°—Ðõh,`‰(4Tfmš¶Ì0L޼ KõÆ;UJ>Ü|†¥O3C&n4e²¡Ò[šO㜜y)¢9á‡ÙÐ òØ´‚ Il(´làå¦}¥§×Àì ™2,¾²8ow–~Œ.&Á•bv8…¨ *ªJ©'SÃ@æ¹Ý=é—ähKp’X»O˜9!l¤.£r2‡jk:ÞÍS+@ðfS#ŸL¡YOPÚxAì½ÆœM`ñíá®WÊe‘µZú]è¼¾Á?žoaâç*Œ>®œjqg »gôPÌš±x^¢p,9ÖëBÝflÞØ"®« u!Ëx'µÙ@´¶u±÷aìXZí thÐ!çyݶL”÷6ü] uÇÜ®×Öº vȘâåÝÆ#²K!>rÊš5Ã×½ÿ^‚&v8Þ³ê?t€ˆ(b2¼ÉE%‘¬åÀNf8Ë@5Õ,aÊ ×DÏÀ²‰âj7ñ \apÜ ž59G?H¡õ ²xÁA°9æbNÑE«›'cuN¦!r-•±”I°»ª¢ÈõÜ8i 1tÓŠL•r¿K«mÐaèjW\‰¶Ö£ÖÄrmƾÒQh¸'ÖYC‹k1埡âŽë=¯D i[Ù£ú×-^³#ûpƒt,åvk ¦º²·†4ËjÚYâ¦M Pd˜ª 'ŽE=_J®îÂtò±óÖÆD€D’K]·ÐÀGÖêIø™û€™Äò¼Ê¬¹‡³3S¹¦§ ‡”ûþµèžY¶I=|¨°—MÆ…T™4öb0ïaÒ&U &$"z8ô°¡Üµtdþ •:ЦùZ Tõ4®ñcÁîû½vG Gåm mÆ-ñ)OÚ_FC]â â=6€OÁõ1ŠŒ±8ã þÜî›×sÓõÓ1¯Èå{Ôè:2-šÂ§ÍiÀkŒâ £Ø Ö <3ÌÚƒ]õEtVÐU¤Ý1ïÈÌ)¶r†g8)›âÄH@¥c+GRCÖcØiÈq^lˆÒNÙ cýòP'÷ L€ky®RNŽbeÚ„N©‡"³9Œ1Í#ùH‚½Ñî M¼\Sû,jŽÑ’• ­"š!¬ ë”jA"× ybOõ€œrIGR1R #û›9Øp>,IÖ›¦ŽŽÿ¤üÿÀŠ}B§´*HkŸ“JFq§øÑÇ?t‡µ,˜RJ­/»Ö†5' âŒK‚ä4{+壈îÊZ +f¯TÝÖél©nZœP†­rxØèSÜ“ nî ýþú² ìHŒ²ªcĺõÜðìöŠÀ¨¯*é[‹y‹ó—²‘”ô0, ®Y)†Õ,”îX h!On- æ:\à²!ºÿëئ^@ã÷`µ¶×=Gî–RBݹa)jF¦å¬Æ–Y;ê)—¯u;CIbä\Ü0׊Ó6¬îgαŸ ‚g c—~Ð'M×@N[½­=qQ)ŸS?_2/ó(1¨tœ¬%žHè‘•d+•ƳêÔÑ„}, ÍŸZ:¯¼8û6fÞì ##ð0=¥z‰ÜâKX9šI}ÖØY²Âp[*aýp A¨¡?ª^¦‘]K Ý:Ž"íÕéó?‹Ž‰ä±{ɱÅx]KµkªrÙ-O# ã_g5®XåF4 dC«>©¶•M­ÌÞš©@˜ðÌ|Þ}®[á §ÁCœ>Ýs ×;Y3³O+¸_ˆH»¤†·Â÷9ÎÃL/ 8À~ø@E²%k ¤hJ nÍøÔõbf`ŽmÈJÖb ø{,×'íywýí–3$æ5“Õÿ¦V¾ˆ=IçÞ̧¸©õ´J—êƒMîØð– V~¡v¨¹†õøú¹õOlÆÇ®À‰WgsØŒ×3Ö¤Kž8nÕ†a‘7”ã 4§£ÕAÙf7ÝúK¶ºñØkRá3h Ïc ¼5A¢ð„n2 ‚°–!yÃCŽÜר\µøK mÜ Úç´êf›3(ðÆ^÷â™ð0‡FÃNt6+º ãMõ£ÊÙaÉ®øz烡N?ɺ³éÉcä#üq°}9¢îÓ2`¯Œîò!Ù&E)Z•¾ØüRG¦³Jü¨ ÎDY:pà åx_!ˈËÅý=TÖVîÛÌCÞCÛÉÌäÁç{ËÅ<ש«‹VGk˜¾qÖwøò5:gC.}\9 Ú£œ’+Éúj4ÀDÐ$¿<怤Ѷ8o½f éñÏhmWŽmàÞ5ÜÏeQCþS9ñ²+’¨fŠ* tZÀûBtºŸè Z]O}`–Ф:@ãPÛ2ÊÀÓ›€¨¹ê/k¢~ßz»Ã¯Õ0Ê·{þ“E¿!/–ÝšNÏX,ä`ç# ¿ÑãX81‡ }—6Ï °.w±-+2Y&ø°"«!H-‚3#X§\é JIÞPYÏ÷l³äŒà‰:j?ê†T/Áû2 “49=_`Kš0”n¬µ±%™g6‹S‰H”ßf$@þÁ³oÓLž”\GÀÁ8at_h?ñŠšRþÕ~H×ûËžô>Ô”…ËÍL~eð…LÄo„Ù …³§í¸<4ü™-çSr¯r V›’ðèŠÑqÔ"›¦Å1¹d® N'•aį°ÅX7™R;Õµû¸r¤¦\É µWLÞÔäëû ÔBî3 }ÂQƒØ»•¡(kÉMqÃ`Þ> Õ‘¶š›Èé3rö‚Ó±;Ú4\N´-z¿üYPºj¶Áv„+oàø=>=m]5¢â$½erEˆjY°2ª¦0,v™ /"ΪÙÚkb„m(bÁt5ôè9DZ•ëîÊ(3áŽZ4¦(=–FÕð½¼€$¶ôd·«¦• ÃC-³¸‹Õ·—ÇO¨_æ”X7" w u‹0Ò‹k=¥?VCÀ°Ÿñã>Ù¬yå}Ië˜B뇜 ( õŽììÄ¢Ù ¬²8}/„¾öWU„(Õó‡8® ‘Už^žAž6JZì†É÷VJcÀ^‡È8H0 »2Ž=7ˆ¤P8˯N4oJ6ähÍ”štèEö¢d£É K"Vp»¢ñ/_"i!EÞÀ‘7J‚£„ˆH›¼8Iuã•§‡†„ìTy§Ÿ¬ ¢¾ÉP´ÇjÔUj¥¸¡+hÞlò$S8;¼UW­_E¹ní•[w±Ë5gÎ6ÌX9ÃÍXÙæ:‰&Ÿ›¡õп¼aUú`lË+ß1J˜wL†R¾m#ìá1ÿ÷_çïiHG´ôÜJxÖ´d¼i-Žf”ý|ÀËmqà÷¸Û\³ÛR)£þåsåà/æ q®ñg¢·ŒÕé9¿2İE†|Þ?6Žù5¬å÷Xä‚­¦¼‚\Ûü­4õÙÖW–„¡PÿÅ·?KI¤fåÝ €p€ÇûCóCGöún/_ßñFo¿¨¦_¿‹âÚ§÷ÐEÌØÌX=]x_KÕ/Øx¢å[QÐ'Ò»D/Ðó'Èùï¡£ë´v(R§õíHþ–’{õ9ßJɵ>š:ÍÅ×rQ"wÑïËdÿ»ò¿u ºþŸ,ì•СþÁ¿#(•ýט?xÿá 6Šß”s£e.Ö:iëZ/>£u©ßAscsýN Z†rU—Í(ýïóÊ7ÑÌÇqÑÛa碧D$P~[ý[#§”+…ÚшäW\òÆ;ýOõÕ2Œ:qÃ3O0R¿| #•ä*å^£8$â›Mœ#=IƒÍ¯Iiá0|;J}õ yÃ_¤! [â·ƪp¾[JËR?+·1· !tP<ö7!7þ~­òµRdŸz¾þFªk5 \YNýL3Da ž†ø—=_°Ê#!F™KM0/Ï5ef™3†%%”ççÁŸ"pD½É®ü©JPv¯=Ï«/F/ôjþ’¡Ü² aìëÑÈÇ`Ý6Þ™æ»%ôfÆ¢mr‘¤¨‹l˜-TÖ[ƒ¸a%lBæ”v¿w¯ÔÃ×9a:ó@_)gò®Œ1"£CeÚ®À/Ì:ÅoÏü©üû'Â!ú¦endstream endobj 976 0 obj 5134 endobj 980 0 obj <> stream xœÍ\mo9rþîóP>y:ðLšoÝÍîÃíeÛ`o7Éê·D¶lIXYÒZÞµ7È«ŠU,²ÙÒè6Ã’¦›Ý$‹ëå©âüx2ÌÉÿòï7ïŸýÿ7\Ü?O.žýøÌàí“üëÍû“/N¡ÉâÒ¥C£99}÷Œ6'³=™0öäôý³¿ìÌvcúìÎãïý2šÃhÂîÛaïwN×Oáö–?9ëv¯·û ®}=ìÍ!ÆÅÇÝ—é–ƒn÷MjùûôÿOƒ…›Ë„7}ú°„Ý¿~÷ÇtóËòè7ðè’î.Ô/vWÝ翾ê]ü'Ô”>ÄÔëê“~Óè7ÙÝwÃ~¢>øâ4êW2Õòë½I= }|#ã+ï,hù ¾H{ãam‘t¸ÌIZ1ǘ!ft\à0{¸cbÙÅ@[}¯Å¼î¸Høã æ”Üì~¡~Ùjð„ZLõçO",Ûbʘoá3!ë’À Ýfµ8¼h±3y¤÷ Ç¦©‹×é “R£Àn\†)0BpÎ"ü@ÃM3ã}aÚôëáÍ jÚÊ8Ë´ Þ)À¯i·À4ÞÓ¦tÎg°8êإن4—y¶ ;_ÛŒª1_½ì5…å£á¨~Ï+Ä`ž ŒF’â1Ä…òF‡óAAÞ¥±ãV_PŤÎ[Â˲ ¬pVñ"l츔FðŽhxÕ+»9¦zÜ ¸×¢úIÐnQz'#Χ±Ãn¨–ßÍõÛtFT–±] ô#ìãD#.¸¤E?áÔéMYá¹%âGµ nõ$¡õÂÄ úÌ‹öSøô»‹!ð¨üHVãç!€ŽžKVí»ÚÌ,0oÇ‹Ïwî @ªê©'cB=‹ÐÎ Ó¬˜2«Ý#¨ò4k÷ lÈe1™€ÿh\òa Ë>|^ì ‹Þ"+Õæ==‡ó†·þWz®‡‘WÒ/f6ï½^?Q[1æFcÓdµ±ÂG×v°R<@¥ržŸè‘M­lb"ÁãW7(u•–îezßd°!h 3PÎ/Øóo-õo(*«ê2²VsŽnÀ„"YÈÛÚŽWN…Z »f\2¨ÉLއe­®Ú®žË haÄ ~ƒPRøø<ìA}&H/ ×0УÅYæ¶vͤ[û€iKo Uþ\š°ÇŸ­¬1™Ö€ ­ÿë"½…Y$µjÃi£ÀqÉ”0•ç¬ÎÀ“bcŸ&ÇF‰,Ð]AY£­Î.ȪŒ9@Q£2ó·Õ2A¯gø Û¼H·›þ¿HﶤNK¬€²‚Ÿ&”ßzÉçEÙ¸†4ާéPTÁÏjó!mÆš6xøŠ´ñB àQ×Å•g°$eG3±bßÌÁ#Á³8ÞfÐ êJФ†ŠÈ×`‹íþ?Ó;?FþAƒ–»¿¦ÉÌÔ;6¤Ûû2Ús¹xU.¾—‹oËŹxß{æV.ÞèÈ“eõ‘lºÑÃä–ãÆÅ0.„ÝõúüÜçuyèµÜÿ¥Üÿ¨ –víY¹ÿaõ'l.Õ ¼ Ö3aÙ{Àò×ÏNÿþø¥û ëç;K÷²º¡®ÙÙ¼º6L`@vîÿÉê¾Óןõâª7Ž‹òβø·¥åUoH{‹¯^QVtŸukê³n­¢¤È]U³Wm}œ‘ãøÛ´ÏC©-.Ì’Là…à ‰+ÁÓ½€êJ@dò¨¬(ˆÊÀk¿­ñ´äë]™‘Ù"²a…Ÿ‚…ór1,¶¤|ÿRû't?6æû¶ÜÿŒ{õÑf÷½n ú>t‘²…¤õ,/ª±—ÕE$y§©ü'Æb›­ áa’o83;&Ö3½%d÷JFüUyÉ©\ü:‰£­º»îMøeYÁ"Úz›ð®²€Gnì²2?W’Ua@VÐáÇ–«ËêO÷XÞõº·1‘Û¾-¢ºì®øYi{¾ ½v«´ÏÞLãÁÙÆìcfƒ9&;›­XŽÙÜÙI¶G¨ÖLT3cšÛ´žhävš:{®o›‰Aq¼9_75i ¡ÆG Y‰´ù*¨©ç°»€±P•± ‘÷¬ ߬› —©¢&œ`å„h&!¹J}&ÇÑËž«ƒ^ûi‚à.Þ¬(©jPÅÙzIJ«+ È$×§’GQi¼Ç¹5¢Še™m„r4[ÿìá#B•GÔhßV¹¦™%µN4ÂBÍS…ºa ‚=cnPÆ„ÀëàË¢Æ0DÌ/Ì àk"kЍK«µ«¨Äð3Q^Èü u„  >=¥Ôsa*æD  ó´[QmfZC›s9…mW¤ÙcˆÎK ®álp*ýj`'‹®DŒSòr¿“'ñηÔ!°ô… Pà*6¯QÄ©‰Ùn2©äŠ‘' ÔÎsQ…·™Ã“LØÄƒrëýZÕV0W- t6d¶„hyôÐÉR SÑH3tŠDTõ;^d_ƒ8§'‹!d¶&¥!8; Àl­q°ÇňqÒiШȒ¼q*®+ÙAÑfˆ;kVó¤R,oZ¼ä7X³¼îe`Ê’ÿÓí©›]Ì™”yÒÜhá½Ó·Á²ÊÞõÇ §Zk0)t:Í5).Ìk%"ûº*1ßd‹Ýõø,¯nΊ-$0>K;§0‰”¢ Žª' ŒªÊeg‚w„$›?6ˆ"Eƒsð5÷Äqè«­ÅÜ‘J™Q¥Ôè/«6÷9u4ýÞÉè`jiÔH7¹WÙª ‘Ø«aŽÝø-ÛI‹éµÉ¾¬ífYõYšŸ®P™Š¡Ðí‚/¦¾é[­Oæ@eXâÊ)7Ž8Ô„m‹Se¤šÈ¢½§)37ýFQ°u¹‹±§ùQž°u ÐB.cGZmHŽ£5˜UÍÅ÷ࢸç¥,$A ŽDALbºlWÎÙ­èíµµ~‚Cä*zzŠC„5ót*¯}Џ Â>_›Cœ}Ë%ÑÒå:LXç뜓üM“_ž(bgÇR¥›x(M‘ çok´Áª»bTAï:×áË[OO¸…©8z˜Ï GÅ—3‹¦£Å“/tœyÈ1Ôj¼(÷[ìfò|䑾æ£0ÀLuÖƒoûpdúðwTëÀÐv¤Šd®rbÿš¶¼ÉlYÚ˜¹KõØÝ ¹ÿÍ*U¦ÓV¥T›ÒžóJ“eqÔŠL†ˆ•‚*)N‚ejƒ¼ÆA·´+&.ŠoTÝ–ÙŠ§§ÐJi0ðŠV«…¬~<¥ZÔH‹Ìˆ5É=©’ÚP2{#å?ó`¸ôp²æòIí=qé䆵FžÇJU„¥„­‰l3ôhd)ÅÖŒâ(ƒTM.fY5V~µ²²B¤–óí“*íàÒ•’HE1äŠÜ#œh’ô²¥¥Ó†Íy…ªÍ‹i¢”\¢Û$;T½z ®bt–KõÍN…RNÂORàQåà…òã"g?au/'—GUÀâE@y¹* +ê8oN^‡)ó ŠºÉåjã²®¦Ý×%U¨ÙÊó ºS®lâ›.œšxÓ*ˆ+/Ê´}Ú¦|ëâ²èðGœWU‹(†¤p×ѲÂ$ß1ûµI?ytuYß2ÕCÐZø‰•ä`†çTö"SÈîÀ²®jØN§®Ó#^ü½ºö¸A$“F»¹˜âµYœù(°Œ=«–c¶}´µO^Ç8­Ô×ñWçÚ@×fíJaO¹_”×|˜ÅÏT3«ÈÐ΄@ O¥‡™ÕVЊ§)`^OîBžÜªH#¼I}ÐL¦—†6óxúãŽMLIbœ£‹ÒšúRä]WT³a/†+wÑCßUx²Ý$]vãLË­ó,…jûEU *Íúsr€ÆœÜñ¼Û0U‹E÷EÇü0¨t&%Ú&ÈßCªó¿éWõœSOØê ·‘gÒcqk^ìmÙ±ÙYn|ò\f£k™J Ó›àŒNDǼfûðVM‡Œ9îè½ÿÏRR|ÃùLK«¤aÔ°¢Tþ V³¾ð<¡‡çØ’ÜÊ·ÃZ#ãZ¥ðøyÒñ¬*z¦)·Î~΢¸\¼Û-5’êÐ Þ%ÿX@.À¬» RŒ+Q©e-DJ' ¢juÉ/J~:O¾¶1½µ^³f9ª¬X³Ü« ,ãRUôÎK‘ûêõLŽ¡EkNˆ m3FqÜ%ápà"-ãæã ÂÏé¥î“åÀ$¸†Ù'AŒôWöÍ‚“‡àX ê3`ÆÓƳ£ hælz¡õT.7zJ›ÓÅê~®(ÍYý4bér×ø—Y2`±å7ØTrÂ<,\zSê Í<˜y43©äÙ¦4’Oéêä3QV0uj&еö0O&.DÄ,PmPM4d8,P“\µå\ɨÔEؤ³OÊÇ”Qñûý¼û6¾™#d/‹³Ö¨ÝÃÕ¤_£#6dtËì¶;JÆÕ,Qd'ÕTË ?Ú¥«3ÝÈ«üûìLçXw•›RÌJ0ãñþšö3AüÜÒg<ÚQxýðNÄ ¯Í»>HP{q¶<jïë–“uf ÏæŒM@Ž’ [A9|Íñû•@ÿ+ò:´9rhs1Ôç5êÈxÿÌmµ£mSƒ¯8]Fš7=Ω¼b®_V¸ ì啸OŠõßQ°xÿó¬²U³¤Û­5n[Ì磴6$êµÿUɯR›Ÿ¿¶j6Y§*Âÿƒ¦¤5_”ôuÛ“É–Ãß‘¿r¢V\7<«Ys d-cQ]ëŠr¨òÆëó{¤È™^ÛÀ¼sêäl¶ˆq¥œÔÙèõ1vq°F_ç2O‘þËrw lÑ”|¨&t”YÙF:ɶq$-.5¡)º"G·ÓPúí¶ËǼéo¬Ñ”ß~V¼8ЮŠ+)+Ü«JÛ¨7ÔKºñU¬Á^’œÅ´”pň{öÉoƒïÕå`¡òÊkܹ›­™©Ùçy×|úc&AÒÖUž’Uü6gQÕ!^Q‡bfäÌs µWÍVÕ„Ù„[£>»Èfº²Æ&> stream xœí\KÜÆ¾+ò¾xÆðPì›d€’؆$ŽcïÁAÀ+­´2$íÊzX‘~}ºž]Ý$gGrà“!ìj–l6»«¾zWÏOg}çÎzøÇÿßzçî7.¤³«wú³«;?ÝqxûŒÿ»ÿôìÏç0$º|©›ûÙ?¼C»³ÑŸ¥)vΟ?½óïÛ»â~øÏù_á±)TÍs7¤üäùeý—ý!î¾Ø»nž§8ïþ´÷»¯÷¿;‡ëŸírã›ý!ø¾ë]Äôù§Ëw}tùšøÎ%SøÝWyÖO÷üǧ0ÓÇÄÝçûÐõ}q÷%ÜùüÊcBôÝ<Íø,èï: n˜?í¾ÝR¾êýî_{Ÿ? Þáçû)âSßí=ï¿&Û p}7æÏD\죽Oyr?ì^åÙw/`=ŸìƒO»óŒó˜yB¼Ü‡<:y×òäsÀ!×pí-ÍõÍó2™ò˜)í>€¿Ÿä29®Ë¸‹Lϧys4Ÿ“wÀ]·»Áw«>Ï›ÍäÍS}©lRÀŸBøÀû`®éE¹ó¡Ip³¥‰Ï ñQ0‘÷Éoþ1¿ƒ_÷D/>(^ìÊÅêqþô²Ü~±öÌ•^|[.~¿Ó«§/Éo, >Æ0Ùç_îÇÌ”¡Èiyé^?¯ÂÇÅɈÏKeÇ#Åcf-, &`pœæ<À!óøjƒúsXpFô<Lãåcؽ.KŸÐ,ðÆÐMgò²zOËBØ!ïgœÝ¸˜»çÐ?„wþCÒøCž´Â§C!§‹ŒSÅ$> 7¯ò ·yðGy¢Ô³€Mƒ¯!½¦òè¼6ó(aWbñpÄ%<Ñ@ú1m ïG»xt±)o6e·´ô™”³òvç|ÚÝËÔƒOcÂ9 ´LÐüʄˀkÏꮕ±¬$`qãÔ;Düp§À)ƒwLÓ{ÃÆgòd=x©w˜°ý >ùÑ!>¯ÍÈ¡¬ÆdAˆ óDÔÖ°v aø0éÂÂ@ì›< ETK—Äú¨\g€æ'µeÕ+ zÇ«ŠigѰÁøhÅìOÀ^L¨y dnàê€W‰èùÏô>Š™0œÞmÖ·ÛaCï†Wþ7m1ªoEO@óÝ4-õ­N3=z¤¥¼A.gdop)Luæî…e$Þ^Ãr NìTæùs€Ù<ŽÆ\ ªÅ,…€bP»„GS[Þtò€`ÏèÁ½f³ÛùÊÖòn€å,5Ч †w}Š… ÂØ˵ˆˆÙ îîæ[ðóa¾:æ™§Q˜Ò‡%…nœ4W ¾ÙÖW¯÷~"­oC„üæ€@{­{&&p4Ü —= ð HdÑ(zg,nw^AÉ@ªKèJŒ.œzV”½ù1‹Â÷^´)M+íÌdDä#“ôTËÓb_Uc¾ÙO0O~i"<5t©ë#+G›®Íœaj¸ÐN·tÎ〖¬ˆ?Ü< º ~¬ ®geG/jÜ@|¼U@èâÑ žAæÁ®g}Ôš§`òTiðàç¡(ÏFÃX]€ o¤µ_ µIåLzx¯¢ù™ÃúÐ#jÕ}ôÙc/ä>klà!R¥p¸° Ù™·vOYùªÜƒ¹' SZuìûúh±t±:š‘ä{¨Írž˜LY³ÑFe¥ _Yœ³²*Õ–Ô³Àì`„gTN•RfÕdTse o àa@Œ`…$ŽYÂú" xg£€*EWã®íZøÊzˆlÝX9cÝ£J0ÉCSAX±L8 ¸(WöÊÌ…îOõ‹"ó°Ê¼Òc¾K IòšÄq|CQ ˆÜxÈ6EnÍãηáI¿P]Âu±FüRcÐg«8»uÖÆžô‚°O¯ñat©\üyp݃ØðA½Ø¾‘ßßé’Ââ5ã;ÖïCà)ÕQ¢Ç™ßÂÍðãèva‰ØˆÕò&‡4yÎÜ 7¨—õ_©‚ꈎz'ΙeÖOû„$“ó“‘Ñ*®âkÅÛ)w‰#àëZYgZÅf5X_(Š‚¯Úm¾i@Ï‘¥ÅºÍL‘Úd©Ð °\Ü Ð=ïg¶IJ+LqhnX©Àœy¾*êÉ*•„†¦)®+h¥¾ÞO(Ûè<Ç>â;[ï(¼Ô×µÞëÀ; Ï7¤ÁvjÌæ Ž–z!#Ú²à åsâ•!ør¼3z'èƒ÷,\Üô_ ¿+|‰ÁR’ÝThÚ GïNHd•ÃÖ“/ WuX¯Ò „)Þhm¡`}~ónö|ÏêÔH±l²ðs]Ñù •¡ÅÜ3!?Œ)B?jݳg$‰ 9‚Íh«k_ö‡Ò@¿è]À`/öFïŠ*ãØŽX°–R`Ô[Y±ŠÀ ÕJ B)S6xã]Ë\­R$u¾PŠ39!…Ù,ÝÆÃ©¼&’¢T;Ó‚Â5œÿˆý¾ÙzØ,/ٽ̒hŸµv:’‚ Ó"´Æ´ i‡Z1xZ¹Å >`‡ºñy.%ÿXjåVs> ù§²^s GºÈæ‹1²j¯"ùNeé‹Ô‰ºØÙ|jP¿©bí†)XyÙµë²ÆoÃÌC<µÕ³ã`“† NnF¥"2(E´áO‰ ªÍá½ýºwõ‰¸ÏHe†4Wt6ipÕé6A„/¢qŒ U ¸»K‰×“L¸Í!²0AÒí<õ«zQTM¸Í“ÖK]qXöÔ£¾`emÉJ*›¼¨Ô¥*J;Á Zͧ›—• Ô²…êO½ˆˆ™§qÔÔgtä<Þcfb×Ùo‚ÌD°Itî¾¶mu¨*¹VÀ)~ñ3ñî•ñBpî&ƒ‡\\¦8°WÀà¸ávÍ@Ù?®Ëtèc•})#*$â‚¢µl„cÑ–?Jz@ò\ ¨PÁé‚ ¨Ž&o²Ù‰y%ªÖàú$+[í2Çb0Ü´ÍvsRθ6yŒFtþ¨’ÙŠZ4n[%È3,“U®xO€WÒLDŒZ5ia­,RÝãõ”©=njyÁ«q¨V+&Mb»àeh¹¡+ƒ@ûUCÐ7›Ö£[ÚЪ±—ÕZ`B™õò©ØŸV®Š^¤ÚNË`º+ëË[÷W¬¸(ŒTTvÞŠRº5˜é6$î Btð¾Kã<¾—È¥ê2É¶è ³ŠÝДϸðÁ‘m¾“”&Ä÷Òäñ¤GÒÂN®?m³aìU¦J8“:ìÛŒ*Nš 8É©ÃaÔf+E"Ãh´t¹ÃðÎioNÁ&ë~ð]uˆ`3µ¡9â(\åzN§Þ½NYtתµ8å,y•ÓmðÊêa; q®ü÷Ó²Æ-Zù5§dhÕÃ2SFÍHSÁF¤ªòu”Žö=æ › ѯÍ!ÞùiŠdôÖX¬M&Œµ:åQ‡ñ¥Î¬½'B¢&­sI+„H RéU.ÑÚ]©eƒi`G»^oÃo^ô ™ñÀ}[¢™øU¦Bˆ$-4—8®NÓˆNi¢4“‚^–ÖäËuמ×Fnjã¼”0èiwn¤Él>¬é<8½(bѸËìïÊf¶ÒÞ¿Š “”yYª3¨9+äû¼*@·v,¬u¤X©³a‘OšP¹% |%ùÓkÄhi±è|ŽÃ?¿n³0ÎùÑE÷‹]ìÛlŽ:‹A÷àV¬€—š"‡ìuÁÛ&Åû®üBEŸz$0*á+ê™®z³qK5ËŃèLBé•çKK‘}ò Ü¢Z•õ¶ª”/dÍU©F4†uý™¡^;˜l½k¤øz%låõ¦ÛêäÚ;¦z`?K7D*‰ú^sceèë>…“båþÕ&J•É¥2Ôš€ìUV°$î²iÝPÜDòÊÊ(#ÖRfpfÓ¥Ê&¦,M*Èײýö•¼¶‡\è;Pf½éäÔá¯4ÀÍ%vO±9€Í§„oåTRÉ¿SSÐXò¶µiáÆ £)|©ßýQE ´ÑÚ¶@¿æÇy 胙Ka Ò ÿ嘜óÄGàÄ“TŒŸúE蜮”=mzmšbw÷¸©Üù¶XÇ ›Ì·sÈjI Aª4—©xÌÈoŠ ‹Í-’Ç„²©Š5$¶B,ý¥'&õv~µozHikØ£¿ŠËFâÞ³å•ï0´hwµ¶ÚjîT™Fš³Z5û ` OiÜZȈT!Õ¬_±6åg¬XêꤓžzdQA†ín䆪 Ÿ÷¤ÇS¡«‚?OšXZµ6jZË­§¿l0oY_&(\­t£?`°åÌ]ç ì(ð†>JSëº&’Àø{Ú«¨ £õƳ6ì†mÖèÑ.0ÛXX0eâ +‰JPجݩ‹ª“éÖn–ßx¸Í!ŽÆÃÅ¿äw†üq»îŸø 8€Œ¦µÝèöæEÞ4ëT%ží@R+„„ªw÷+§>JùÌ,™7ÚV–7ëçH°e ºõ#ݾ‘GOäÀGyäªÜ~«¿ßéD—‹·œ ñ9 LZÿ=ˆF[ëÍe}’`‚æ¤\]]ÿÒrêWÌ9.L=x4TïÐË@Ôz7„ÕÓ¦¶õkùÍ#–<¹ÊlÅi]íh¾±Äô}?`†‹ˆ)R5¥MÏ,ŽŠ¨'PŸ¡ÎWiÚÞèõŽuò{ˆ˜Ã^í¯¢4é´8ÌSj{ÎdŽ'[¶}|I¶ˆ‡:lñ¡J(7Þ¡Ý;o^käË‚ÄJ«^×´:˜B^›m2 •aõ%ò=’n.Ùª]¯iûÓZZ5½µq+¹íàF]hÞ8±!)ç•c¢²ß/aò›9ùÌÉ/]š¼qõ@äK½ÈçÙ²íPƒæ‹î®Z¯Ãzc¾"ä¤ú-I;„£³0e¶¯åéÿoËò¼[)múüJÓ$ö¯ŒM5õ¶t€õž»R—mL+ð#‡-$¼ggtðÚáIÓµ3éÜãÞµ¨_dýÀâIãP&Ð9Cn(‚íæ Óˆ¦n­÷bEÔn 7U6˜Xo×V±Í6¥ê†oïÞš§-Öögå”™µ|>4½Œ&Ï•¥ê‘O¥çVñó³+Ô.¬ÝSž½ 3ªpŒièÃØžƒT+IÍ(y:]M 2Y’…\“4] ŒõêÉãS A ×Ma¶ ²„xGŽ7B7zùeÅu£#3ÍçÁFg[þu¯Ü%ó¥T•|ˆ˜½à©¼×Ã3ïzÔmÓ6ƒŠ‡ßlóÿß6›o0¼yst¢'uþNè#7Œ¯ù6BÒµo8xWÛ> stream xœÍ\[oÇ•ÞgB?b°/;xF]·îêûà[,-[¶ØØÀR$uA¤!Eж”_¿çZuª»‡¤dÄ K=]÷Sß¹ŸÖ›U·s«ÿ“¿O_=üÞ…~õüú¨[=?zsä¨y%¾^}vŒ]r€W»±ÝêøÙv«Á¯úwίŽ_ýmí6iÝÁÿ»_'ú{›;·ë\Zo¶qýåfë×Ù„õ|øÿøt3v¥1Oÿ ]K·ÇGnÆaýÍF_~ºÁù<þÊ=u‰ð#§õ›¸~_Ö ¾Á 2´æõç¸Þ÷ÐdÛëNhéo`ôW0Ä´¥Oñ1Óc]ÞŒþg‡®Ý»× =®ítØÚÿçãÿAªFg©“Ûõ{|&Ä ð?{o¥uºÝàÆ‘;ýŠû} [}EÿoÃà„ýúÞl¶ýú-ò~¼†6ØsÔ„oqÔ) ¿’ÞÃt0×ejºÚlÓú\úà˜shïQ_íq…3|Ç÷]x Xz\ãÙaJ\ù-î•^@?xìèfqQÙ­v¾ÄÊFhªëJV|Gptì_6ÁÓ;`úá’¤£Ïi—£y/›‡ãºÏp+#Ýb9Ë ÜÀ96ðð÷+Â@ïM‹§EÊ ‰&ÄóÃ_ÈFœZ÷¢4›inÊK ç0ÐMávboo3„ˆôÑ>J%éhiÅ;Õ–3]€%Ùº°K}ç™03Jz¡!)tß!á{ꀡàû3Ý(1”Ó•µsÎDe ÏI z¾á«F„t ^Å §é¥PS  t<„¹gï7A ê‚ }‚Ã›æ ØÜÈpžŽTr༙š‚°éD;» ö#¸ pÐ7Á™,Ðù… )Oð‘‡ç*7Q(€ä£¸¹qé•Ao¢ c¿ñ=®3TÊ&½Èâ9*ÊT€0+b-dY”A2êE]®¢mߢ BhKcfºÜ1angúL@\.Ì,).¬€»¬ø’wÛ0t–[½K ]"Ã]‘¾¸ì‹©á«|µÈ#i•­ '”?Áax|¦Î’GZðQÑÔqÚ{i°^7Qh8Ú-#yƒ:ã'Uè—=^ÐSŠd- `r¹ÌŽë”¿2_ ÃXÎ>öfV{vÓù¼hŒÁxÕ;Dƒ²À­Å âG¸³½6£Ð¨+–øý|f2)ú¤:1·hu1O«¥âaÁ¤¸)è®Z zäFLDÀÍ£üòº±Q¿<>úîèÍ*˜ÈäË«à#Üd^%´trF'â³ÇGÿeõöêæüèá+wôðþñÙ“Ïá¯Ç_¬þãèËÇ«ï»-íÕ½@ã|Xg—ÄŸ•@‡wœzÆó?ljæ·;6·QZG8,á[¡°WÉdd÷9CLõÊ3B )ZðU¡Z¥æ²•ˆ[aÂÙB"¿éAc¯bƒÃÙ¢«Šà÷*‚ÅŽðì­f/â\NHªcĺ¿T ½*ñ†:±‘Ýb"¢]*} À¬ZáM³ËCŒ,²pCÒ†º±ÚÃ$'àäê„ùÔ?Jl•UóÂ8P›+oª!cßúGåÊ¡';tít+ƒx.¡ëTs#"3ø|ÎÀ¤q„6Z/VZÀ¹ÝÂ%Óƒˆ‹JñFË öÆPœ8Sd—CÞH瘛Žê#°‡SÏ58^B²bǸ¨lCeÐ^ÕÀ”ûöÙ‰o lr)€TsRˆs¸Æ …átqÆkßj;‹±`œ5©pR5À33Iñ_L󞈭Y‹Ê0š–jg~Qÿ×òNý•\&c«7^ñô”V³y¼ºn"]}?v4Ü.¬#Ïá7 -½çžuþ{-9ø-B+Ä¡„TöêÜ)&ê5ô,Úgš?$n˜ê‚0íkx¿.8̧è ç’w‡¡T³·þ#^ ¡‹Äs7J‰Hô±X ·šaɺhÜ•dvmãP½£÷/] Ç½¢K®¬6 2µÈÔ{—?5¾ƒ^ºn9§[= Ú”(‚¹T…ft}ˆh¡õ]Ä¡øuãéX±r™‘_×L3ÔÇ*ä«{+Gm%–RôOkvù0D ¬ L ˜ z(°”Cù:+GöÝ\þ R¦RP¬õÅp¤aM€§O¹h OŸÙ`}ŠïÕ³ö©³%õY2gp«gÕÑ*a :MFpllX<|bÒD1„ðc ¤ÁZå+yP4rÕ€(õщ hB¼¾Áºÿ£ã¼Uv•é0¬¶“ôôa—F:Ôox2BpÆôhfYS…7Á¤òÜ{”›¹Ü ñˆ‰yM(:8•{Âû¸Ìç*'Ÿ\x}*¾táå·,¨Q!Ìð5rªÈ¼iˆMaÜõË<¤1C5÷ÅõÓZ‘¥ü$§Ð ãÞ.ZˆòÓ†cwà,¸^!WÌ#pOÛíâ"O›H ÅÃ$"\öI®¢@ ¨ ÃdŸä’YD nf¥µÑä71–°Ä6¶B„VA› £8‹ZÄuñiÂ-¹Ã®!¨M\g ý ¾k06M)¨Ú‹33.µšKÖ#‘sKþãn™(íkÀjbbDƒ¹—›©‡IA¢ÏL¼Üá’]fIªÅǶzÈ-FÊ|4ãu[œ¬¯q2€A·óÀ¡‰•hÒó2Q‰oq&bçûÜ¥Y$ Ÿji‹7»Ô6|uAs¦eŇ^#r¢Z o]ã>ƒƒ+òì]’‰F]”"nÀ:ǸÖuV <¦ì9˜iOq©<„ÞÎô 2í·Øê‘j¨í`,l‡C±°à8v ®Nrá½fŠöÕ`yΉ¤F¸6bxØÅF|¸nÙì’ÕÐä·^Z "fú–å8òDrt‘8° ·;ôê“zÞÇ´îA’•§*vòâÑG¶òZpžÄW›ÀÑ»©qaà³ÖÙ>=辋pO‹¦¶ v×k|¥z[iÿ¯›/tÐÖx¡S™ô™PœóeSÃs ¹gñH¤;²èÉRªH1âxýã“ÎJÚVš«ò«™—TnÁX$“ °&-M¡É¿E©²àDc±T’$6×#üôü~R眨²É^iÿb$¢6ÆØH!³ý…ŽX‡¶r*ù.ªß·Öe|ºÁ`ž3䫦V£c£˜ªBÞCfI›TäÃÛ¢É/ö\ÑnBÇoqMTüÑäù(7þŸÐ – â[xãƆ.ä©„Å3˜d1;/¶ÿ”åº?m"žpÝÆEg>ol%N›ÄF^ìÜŒU®¥\bR:…Ö¤ÛÍ$Ëvúº‰Z€8X²\ë5_‹Q7+ÙøÖ,ªj|6Sñ\äô-Ž£Øâ¿m±’§KQB9쟀ÿÖÄ-Ôþ> t3MZ›¸QÞÄ`U•é©4b$­ðhc*,Ø0k¨ªª¸hS}(f\3Y2†AZÕ˜ß ác³ªât7ÆÙ™ï›„w<3ú39B ÷ëTËÖzts>[Rï¿Ê·FIÎ/ ;Ý«FFïx¢TÏj¤MåÄnR a¦µÍ¥fì”âúj*ƒ¹hM/Š·b€î‹ó‘H×bR±+ ) _1ζ˜›¶­´­õßðSsMðS£HnŒÇ^ëÜïg  šÚ`§Àòó¦4^7±µäF•¯åŽJ{]{vÌ'vïÚó¹Ý£¾¼Zšómyù¢<½^š}_ÇœÕ}žÙ-i{…äI}y³´OX=ŽçNLy[y”®˜u=g §„™Ó®Z<óAÿ°ƒô-[M<0±s¥ðwÂBì‘™Gª‰ä!ÿ[·ü¸¼|R_þ,dÁŠÈñݨi.s¡½Bò²è*ç[rÊËgK/ë˜3¹ÁœZb˜Lá|É«%Ô\ÛÃÍjæÜ3‚7Ñ¥“h„ -#,Àæmíû¢Ù¿>þi&^•X ªÄ~g0Ý-& ˜|ïA S´rÎÓ¯¬Qî¿ OÏ––¿Ú,€ômÅò«¥íÕ•Þ.!óJöD>ƒL` ݨ@OvšÇûÀƒ0Õƒx.˜ú8œ08x¢ÖþÁñ¤ ùzIÒ|»Žý’ìn 'ÇK{Ï)¸ÄIç—û¦¼¼Y&WK7^Ë®¡lÝJù·ã7B$ÀÔ•—]íÙ•—ŸÔ—wô„»qX·uãvxh6eÙwuš»º^.ö]³¢á©D®¬¿·"© óVä<ú_Ê^ÿ,ü©<ù†yãˆþ˜³9±Q1Y_>m«¼üe‰?©¢÷.cð.ódß,Z/œµ¹­ó¾^DÙÓJ¸ÏšjŒü·.› ­–ƒé*«KÕéݱô¡ÆÒQe7ÀãðœÄ„4Vމeoò™Kàgc`y!Ä\ P12r(À=äÝý¿e€»W‘Üä¶bŠ xiCE¥P‡s†ÀUüÙŒÉèÇÁj9‚A1tŸOk ØÎ®¤¸ÕY¶%ê1Æ´XkÙRŠ@ÔšZ’ÄÄžþrÕ4³½S#–µ£Æ±Ïê~¸¾èX˜ xä_poŒÀ4•Š'rj‡ë56)E“Tê3ÎÒÖkïk€ÆÎrA¡JŒó˜ØÑ^•r‹H0¾øìj1Ÿ§Óÿ·1…á&Úl>`(àø/N&s黆«5R=)ò¡ ,~Ðüƒ‡yMQ?+Úh«ä+€Ji*-^JjÐ|ù…Ÿ& ÎM>Å“A›(_X`:Ì#P€-§Ÿ³h§1ˆÄ¯~ÆTr›¿¹ Sƒ'´ù^“зECV-¿'¤úJã˜Gó _ÈR©¬Þ7ƒÛ“1%ŠÈÄh0ä¶?Æ p»õÝ Œ;TKc  LÀ…г–Ù2&ʰ«‰›èóAN×÷dPë·~ƒ+?Ñ¡/_F[O‡]î)üL-Úüƒ°} ¦[2i@‘å ×Šè¤ŸëøVâ7p1Õƒº<—å¥É,ÄM«–áu¡F€M3Wï Ø®õ@ýƢ䷢J©Ý§—殼m‘„—)yËéÇ{T Éî=Gµ~÷Ös(’î­ã°n²«_ òA }>XŠÍäí?ûÁFG](¸CCHnÌZ[E¬`=YNmF—±Àøi›Ê…¢sÏù¾%éª{65¡š¡]LÙ{¾’}Y˜æe Ü&à/r¡ë§ÎA“…k? n²ÏøÁ†ë¿c“̉[ä[G#àç¼2ÜD†âºZŽ\ñ»µ\¦/X.¾—Â\Kªw×Ô!L²{ÏlæÀ+ÕZ«‚pj¨1‰ZQ'(ÃO%‘Õ"ØM0þ Àõzúo* ~ïò:ÕtÏ’™5ÔZ¼¨;þy„ Ñ<|DƒüóÓí/îÁ >.yêw%!V¨Eø6@³ÍÓ(9œRSæZg$lŽ1kíi¥ÓpX}yg½J#>g¥*¥¼–ßJ·¶ºV ®{ZWò‰Ò$•[Ñd¶²¨IG“9¼øAi)µÐªÓ(NáSþIu:b.Æ•~>‡ÌÁ[´l°TÌ>5K¶åHXŽÚ|BWÄ4¯§ZÑÔª4…M¦ü¦šÅØ\œ–¿ó§?ñ7O¦ÔÙ3uBÇÄE¶‘Œ‹;@9ùÚî`™yûïz(9ZpÙo›bñT„A&}GûÝÑÿaBf“endstream endobj 991 0 obj 4836 endobj 995 0 obj <> stream xœÍ\k“ÔÆ¹þNò#¶’ŒvޤnI­¤œ*›˜Sö:µ‹”MÕY.^H¼X0ðïO¿×~»ÕšÙµq%E3R«/o?ý¼WÍ«ƒvÛ´ð‡ÿzvëtn<8½ºÕœÞzu«ÃÛüßÓ³ƒ»ÇÐÄwñÒvnçîàø‡[ôpw0õcðÛ®?8>»õݦk†‹Çfx|ü¿ðXpÙc󼯸äñ³Øú¯Í¡ß|ÑtÛy~Þ|Úô›¿7‡ýæ®ÞÊÍ¡ëÛmÛy ·ñnï»xÍ6|¤}Iýæ(öúYÃ_>ƒž†ØÆoî5nÛ¶ÎùÍ}¸ó%üÛ8ßoç0ãc0¡¯´ÜtÐÿ¸yØŽñjßoþÙôñÃÐwøÀq<>õ¨éyý¹ØY‡®ÝNñ3É'û"ö¹ygbݰ9‰«|×®`fñÛ±ã·påMã°åì6—qRsœÁ4blû2¶ƒ&ð?\<‡¦Ô)|ýÆÀg°•Ž;;lò<Êê})ÜŒº¯œóLD¾¦o×Òƒp ÆSà`ã$±›§ñ/´û- ê7Ïà‚§Mc¾¯aqˆÒèGèºß|h@º ©±íM:MäGžŸ™‡Óm»ÅP,€1öAÃ86móYÓϱ×Á–ˆÀc‡Ðƒa’}hq(ì8dà{Õ¶0®¦?ØÜøÐ€ãNÐ`ÆÍ¦»ñŽ—†Ž>m܃ûÍ¿`pfì7ñr9Áv.‚­íI>ßo6>ž~sŠg¨ß܉Ëé&ÃÿůßÅ¿pÄÇÿo§[Ÿd`Q5ÈànârpÉo µÃ-˜2õ5EdòžÜi]ؼƒ#ÂòãìãÔã•mt<)xìL»Ž…Q†p“?~€m^ikðŸBÚÔmƒàì¬çû¦ »D“˜vCS< m;šÙÈ1H;øL7>»ýÍso6ø…iÈëì~\A¦|…Ξ‡NÉׯp¾Ô@^ÓÔÜ¡˜uÃHZº×§´×¾#d r„ÌÝŽ_¢XpûÇ„# Õ‘,/øÑ¨°Ë%§z@ä¾ ¸©ž–”Íg*o ç~¶u¾ (D "bH$ãÆ£ã¡y!¬ ¦ðSãpo|?¿æà”yÔûŒCz¡hßµ•Ç;byFßAè.jC‚E âª|G¨ú‚Ôb)#3ZA-¢‹«`s<.D”Sj…sMëé[<,õ>yˆ"YQÎ^¨¾5líŒzy8w>‰¾m±¼Æ¸º¾|·3nÄ¿iÇ<êwpnT™¢ðPÔpÚ}ëqOOÞ>f›Ôê%kfÚ1Ãn£Êþ"@'¡Ò|{Ÿ´«`:ƒàp¶“ZZBÎh¾ôcö,kןÇ#ÔBÜVƒš=°`ð0,Ü ½ׂ.(g—ß6=]y¬ê›;ùæÂqùHèPšË¶˜ˆ0dlâZ:†77•z¤%8hÏ x,ç<'; ìH=²4Ç1'Î"ÙsLÌ8ñ%¢x¦KÃX¾é0jÁ–ï_Žúø]qtS°Ëš-+‚½EØÁgÂñ§8 ‡`"ãû+ÝýO»ï¢æù›^Ã-ECŠÇøaêì¯IÝûð8c¿! “Œh=9¹ˆš Ø÷ݸ‰âÐÀ3n*zļÃv÷ÅÅHšÊt!¢ÄŽP·™ÞP`.…#ŒA’¬” [ψ$ÚvÎu• €)‡ºð"W+æã ÄÈ–“¹iFM–¨Šæ9³m·]-­i8~'“eÜD+͹IÎ& %(®R•Ý’v†Àwéþ…¹pM_§Cp=v¹8§–z†9½û-žŒkûh#wêª&7ÂÃs…~â¸KçÀù€–öNúÛ&(€,ÎÄw;-Ø1 [µ¶ÅÃŒæÉSE•ÁZÂÔSƒ®ˆPÔaª‹"A‰ÓMÓP'ø›˜8Þµh·±—í]'V‡ÑË$<Ù3ÆG„ÿäÈÕ@ßb“óæö†'E¹fÆö^ÉDM¥ÞïV}Þf£ aÖã‰ïž'%Å»4£ì*bÈ÷۸עóÜm)`Ã6hg„Ñ'0i,6Aøq²@ÚÈ “KùëQÁš£‚èj‡m¨uëOLô‚ãSÒ1ñ ˆ;ò¡»h ñ^ªHÚv, MI3‚z°mÔ„*¦q,ÂÀPO¦Ùh9Q±6RWŒ®ÈH ɉŠ ÞÐZxq="Dú¦q,H ó.ÛÊ´“œÂN*ŒÃŒ¹Ïµ6?6ê–æ±5ðäÚ]=¶j/‚?“ãd'¥ˆÂ¶Õ…W€ÁHÏnr.@,0ng4ëÑ!ÔP7¿Ÿ=öC†\lG„‘Ôdˈ¾zA ny+u ¶CÒJ edѪsh±z£@;‰ñˆñmò£ãÍY‰…i_b—g“ªÓC`}Ð@ÖùÏøM‚›C«çôY\ŽéF¶ˆ3‹ÌXªØ?0“P ù87jøì&ñHdå¹ÏùoÔ`Æ%î+GÇà%˜û“jÀŠ=Öƒpú•àXO®1ëK‹K\Ô3¾Ô ˜i™+vJÒuµÀ§è¿mÃaE^Àa”ˆa Š]\/ö¢‘º"_‚°:OŠM<¡0®.¸Œ¥É[â Ê;‡ÀH›ô»Øò÷É`‚¯`B]8lFM{LXƒË5³_‡"HF¼ð¥Zƒè6vFJPm»j Šœ7¿z«Ù˜Înd²€õCÁ%ëåÖbKa Þ"êú_Jó¼hÄñÇíŽNY$Y3ýœ°û4u¬”¬ >y ˜`)cXW|K¯;LHô¢ÏÀ›à@TA0Ýø­ÑfrÍtÿBlé·Òî;IœÅÁõ Ì£î‘°Jô`Ôò‘®föß É0Ÿe™?*±¥MV N´)&¿¢&‚™vý•ÚÓ÷F˜haâyÆ’zy±«–ߨ½°Ó°Og,˜\­e(¨Äj^ÒÓ‘„/fŽïÝk0ø“âÓ~žUO"¸øx9±,¡±¡£ %ôÞ™Œ3"ÑOf÷.8!;æÑ¼šhÎÊIÐI0¸+™¯èdn‘€*^ë.Yä Â ’|ÔŒöi[ ÄuHfÛ½ž”û=´d}4¯ …ÛhM›€dQdv6àwžM ÄoøG¸âœ¬òcÈ~\–Y@MÙ‘Rͺf@+½ K2{5¼Ìø¬%ŸIÂXm»žû­ïþZ½4½%H-DÇ9²"Ýf¾Š ÔXBã>’²8 ]ŠÈ(£ž2mA±ŠÚÚšV¶¬*>ƉÌÅKb…ö$¡ai-Ÿ¡¬`k‹ØÒeÆu(ÝTç8dáW^ÈZüªMéµÉ“Òî äu]·L¤ÙxÎi$uÔ™soXˆ+W8k\æôPx8˜ÑƒÕc¾æù¸®C;i©»aÕ¾³@,t7^—¥«œ÷ÙVb`{oUa‰ø ÓrÆ{˜ŠŒèATâ+í°ÅL¼ #óü–é¥î˰¦b‡I ìöÒªºIt€Ó(YÔ|œKž‹GJmñøj°ú¢©¹w`Á±~¼q¨ôf¦ÆËIåµ[ͺîB¯‘ïÌãëO2’AûuXðìã˦,9™–Ö3$Cl8*=Padáâ(œ¬ÓœW×d6«:Xi®é2>aÿòÝuAÌ4§ôPk#Û»ì¢?I±^t¹³bÅiÛŠ¡X¯ë[Gs;çÀÄôã ć½Àiu9š5ÜE„o¾“»[NîJãsmÂ÷Ðmk;|ì8 w?}üJA’`ðhcý,=RóÞoÓCídE¥ˆÑ F«—„¨fS´"n°­X"\µ±Lü9j¯oè¸Cc“át%3– ‹„€¡ã!·PØ7–ã9¯eÓyr7å€c³'”à Ü"Å|"9x“¿éUÂÄ$\®#ùÈÖ­oôË“†2.Òw‹d³:--9q’/N¿dxÎÙW ©ökaÑC¥Z»<à4 ^Ür“=¹>BHxTÈÈcŨF‡qt3†I \³9é“û’>pèˆI8ÛÏ1žð)IÂC¬Ç³+0ZÕ¢C¼ºè)þn}Å™-ñ8À5Ì¢äQX×o€vaºâƒéì×lQ2Þ2]oS«…B!Ñ»Bƒå™VCKÍâKO\øC"A³*çÜI’„Õ3Ù‹ßdNŠ¡m;¬3žÔ6zH¾G‘>Ô@ W3t³V^rý÷¹ ¤Kk+Êiï „öØðCõŒÞž¼±T?LúµVú×—F•‰e¹Ì‹ú8cï±J—”Ç9»r‹Zz;Qö²(H\GVXÖ{ʵT*yÅèĺSLG£8ϰuYJ fàD3 ždµ¼ÃL_r†É.ˆ“ÓC0r•vc_‰›%`&ìÚî,™ÑÓË4 !g¨ËNµüvZ²Äs¶«øQ…IoÂ-ܦø¸fÀ§RËå/©oé&¶g8¤\F/ý û,£‘Íåü…=Üè0e‘B+sA™Ú ,9S8$:N¡%¹\0ZT|ghiïÊ‘á6ÿJØ*ÞØA1pV¿ ³Ì,"€¯#A¼Ïícð¸e5‘pGÈ ëÎv’ÑïHÜ–;ôê`ÓZ´VCr¤¸tf5¸X)´þyq@¹a4„F¦Ìù3ˈ–4{Ëo¦EW?ùx¨œQYULÅr—‘c{…“0̈¸Iц„3 ˆ¢RÁ-Š '-DþÙuE…qÎÉ+#Ÿ7ùÆ«Îë\®ëᵑô67jæÚÔ[˜DÕþ7u¡eI®EÆL¼DVÄ•íëò÷t®aéC*:›¤ «c-[3þwÁV5¾3÷}Ç®ÑÔÙ‚‹]ÛÕ= y7m²Q‡úféì×Í ð±…¥4‡ò4‹9¦LÛþ#»¡¬+YP9ßHTÅÔKÙR<Äcıœùë¤8÷Eºý—n™fÁÚªGYy¹(ÓWbçp #c^ò؈ž}£9ÔÌŽÊ{‰€}¾¥.U^gdOB Ða®^kÄËÙJJ[ª€¬ 5VÝP0/{á;qö4ªÂÆi›—$™Éœ b™26Á‡Á]¡–Ûáä»$‚ò:Àá7«)&.Ç­•Þ*fÆR?®ù¤ñÁ,W8r²»2·¦ë”ÞVJ³yÍzP@æù¸Ä|C2ÿµnÁt¹ôša™¦æSMœõÜnßp-þdæ°…¨êžU¢(5”ž4æåŠì­r—³9R¸'döÀ¼±U ˜0Ý ÕÝã_¡àú,¶èg4v{æQºÌáÖØ|¥Z hkþ€„`HèLh.PIé—·ŽÿÀïßìÍâL®•2ÔÌØ/Jb>ð;mìÊ ú@ùùÔê»—KSоåì±#eZΡ£4“kLøEî?K÷¿ÐûŸ¥ûߤû–áõþv6ŸLßÕDq®Ÿ°bŒ~Idßì/k³O}fQóJË §À§ÎzâÅGï‚äã¢K4ͳùAˆìÝ.¾›…_Ž?Z t-¾ c·ÿŠ\£CNž>OÛŸ–}UjmqñIm{~ÊYŒ.Þá>ù„ÑÅ·©å›´)oí˜Õ–‹§üÏïÞé{zß$ÿ֋_§‹_êŇé⡓ƽ- vmä3ÐÛ¢çVP„ÙTþ¼±8±21Ë7‚–¶ç%|f­¡Qýý1,³Í·ð~:j¨¶ÀaÊ©eB€Øê[ƒ‰Ë&ÎRíþíK½Ïä“"&‘· =vô4qb7ZæùB/š}ºJóü\ï?J÷õâQºø©^ü*]üœç4o>QºÕG¿5”ß&<˜«GÙðòñaj{»ÄŽô±™çºØ¹“°Óë#¬ü$duU–“úO׉•ŒG‚žÌîu ¹¯jÝ'i¿Îf'Ûé”™jÌî?ªpÌqzèÛ*ÈJx1ŽtCÛ±Æ1¿ N°ÝjuÓm×óWÎì(x=óx}ÜßUúìÿ«¶Û`¹…««(³D=GÙ狦ðK~žc4?ór”pd6ß0ÎÝôñ~BRf>]<m¿¬¢®ä!šÕ¯§ÃÐ þs²‚_ªÙƒÐiD£C¾ßè­T7™û%.Ïj×Ö„¥2¹†M³ÇP=ÍbTg†”c¨±Âߥ‘²ËC¦ér5³Š²Y#ä†aÛÖÔ™1oΪ¦P¾#«uÖ…ÒŠ~Z[br4Þf30bîÏÅæ¤Ž|eƒâÝçý:Øí7ÛFÜ\¯Â¤1›im ‰±ü/?¸U¡_ÖqUCFÆã>PFþ/tÂ÷TË;ý$Gœéá?a­\d¨˜çúk`ÙOñÐÔý0!ÓÔ5ó“ P=ÔòãÖ•?µô’í’Yí+̘¢ /k»w• „™q ~> stream xœ½\YoÇ~'ô#çÁ»‚v2}ÌLƒ<äp.$3ȃ, <¤¥`^æ!‰ÿ>]WwõLÏòl$w{úªª¯Žî©ÒOûmcö[øÇÏ÷~ýoãúýíÍ^»¿ÝûiÏàã}þs|¾ÿûè\ljÆv4ûïöh°Ùì~|cìþÁùÞë•Yw«6þ4k» øwZÓ´¦[ýu½±«¬Ýêwk×5mÛw«?Çoß®7λø}X}¿ÞôðÝ®þ°ÞøÕüÂQÿ„O߭훃¿ÁN¼Ñ;ñiú7spÂpñgXwÜÛ ûÆ7Î÷zo¸ûƵÍ`ÆQF™¦¼ñqóø©€„¦3í8DB6&r(RÛikCëÂê|yØÎ«ÃØ×µÞ®¶i¢·‘®`#]芽õclµÍЛ1¬Žã¤M\dÃmlŒƒcãû´æ%NÔ¿º Ñ¦÷Uòß;xù:2wãýˆìüW€W×ë ,âVwÀàÃÈ3èšqt«Ðv{Å û(h;^û¸..mûf ÅÑ0¦»€ò!®dÚ鎌◻Źi\ømœ &ŒS@gƒóàÛøáN–‡ÖØß÷qÅѯn€=ã"ϰË­e­~2›vE{èñã;Ø™G†ð¾¢ˆ„s`nœ,_¶kà±#½ ê-Î…#`­É$q_ÙÝgâÆ`Cq Ÿ`·qß=J™V2ãÇÎÕÇ©sî’'8ž q­G|8a>’Õ•Þˆ Î½Ë yÜË×­îe›@ÿ†°1®éúÖn@q•Äwà`ä/ ¯@Ây‚ ç¤JÑØ†ØPÑŽ»ˆè¢z ’®sÀO\ÿl-(¸¡n­q«V‚…’x¢ Ôò âÞO³~XÓ>G¤. V=ÒÕHz.ipn$Ðdiˉoð ñÆ]Ä/#ð¯9 äÖ…m s§ ,,&‚. Ôl³± ƒkâz#ú;rγ>ujk Yð óáÕX6þB@b»©Â9ÖA‘Âñ’1ÝËðtÑN&³±æôÑ÷ZÌBX×"\kŒ“ŽÙ"ŠÉà1 ÉDk êÐØâÐ(àÑ~.bRÑÍ$D}³¶Õ™` Ò€Ø1÷.í’ÅÙ2v؈Ò.›Lš Ü#„’Îz ¸[D–Ö[m.,JN u—O¦ÓÆúàBn¶¼Ó¢k— I´w"† Ì-yô[KŒ9÷Ð ÓœáOlï&¥ÛÑ&ÌâÜø ý™r<°Ø t6¸ A­iÓ×[Ú?X8f9Zèøa|—.m¯Å?ׇ¤a¸"0mã-9\ ´`ݶE r’án=’XÇ©øÍŒ@‘ ûZPIè¦4©h`*d€¨u;ì–r|(ª¶_„!’ã«Îò„D›¹J¼{J06¨°áW?æAiÜ”DÕEuŠIá=©˜ ]a<9ÍìÀ:Å1ç¡óõpý*ûX€E~ŒÇA_¶D(,ä~´¯‘R„ÊØ¸dð¶´Ç|bQ°Sì ¿`êà’¡ði´õŒL(ª¾E–NíZ¤j[ai˜àöUƒ ÞI!ÍRg(` ÷lèÄ3ÐCМÎ2–äIÖ<)z-’S>X¿ú1ÙÒWèDÑp~Ÿ¾\Ó_ÁÓ[†d p%!Úé{Ðæ±–¶d‡P†¸.ËÞƒ2E2‡—ð•å|©7ã,¬‹Gl#€«cCÌÙ9ÆUº2ú”Ãò`Š$l·…ËŽ±õ,¶Cô O=yB Í8Ü0q#Û ®Æ© UB<ÓØtŠ„ó‘!hJw¸dOˆ¥=‘è:)ùäuŸ*È‹8’ÏÃ<õiö–´ôã¼)ï‚E—vªj{Üìð#&cbvL‡èá­Ä®´oVyàR¦Õ°µ.Ajc¨`¼dÆØ% ¨,lÅÔj²;Û-Û•DÎ<²Na•Vʪ7‚s^˜É.¹&ZkREŠc´¶Á!IQø{HÄ|X;ÜSàªSG“å.¥«:ËÌ“ˆÍATce½£ÂJN‚}‘“:. Í¥q’+ƒ£|ÁàÑl¢$p¹`*S`Ú€Í HLÔµ]ž…^mâ~²¼ÐM‚‰‰‡•YŸ,zŠúÔÁ ðrÂcæÜ–’;G{`—GgJ•ñÒž‡Þ'C¬ØÁñ Q_gº°ƒy8æ«Üû&1«:5è$??ÉÏ/Òó»ü<ß:Õ$t]k„9cpq¬®4#w-r‘o`–€,çˆ â2ËnqAdÂa!Ȭõø‚´›Ü Ç’j1î¢àC—¸†´ÅsÊ (LD]ü´2!8|QöŠ*]×Xü15ÞdýQ,´©JfYÕæªô^OZ0d„ö3 ¹¤Kܸ-áJVë*°× ’osk¹– H tùFš•p˜Ü òúÔ¨.=swi¼_ân­_æ]¨ÎMPVe‚iD‡•ŒŠ¾wx _Áôº½©øˆ„ö }ÞÝ"gƒ²š]Ÿ4âÉã)°`»\57à7`ùV bn2¾ywgs¯ÇaO º¼k‚ ¹ˆ ´š9JÒ3‰+­GÅhݘéæo^Ä«Ðö»º-Ë®';Ê»‚cùĪÀr”F;‚àh×ô…纨)É}6ÿ7ˆK±Ø\i«ÓßÕè<ÍÞKÍ_ÆK"Ñ&µŠ‘:Xn)ÈF‚ìS¤VÍÉY¦ÿ¨Î(~WCq®Ræ+=\LtUªrÜfëù»°µñ*‚yØs õ¥5˜(È䏨ÀD- e^ÍÉŠò˘¨F‡…vͧ¿Îò«Šbn¬Û…ž“ˆ¨&´9ÉSÆ4-]óW$õ)Kªdò–újJ¹ËƤ/ã3Óé)yORúEï©ÎQóãKµç›ì}ØÃÞÔ„ª_V<ìMÍ]ÕÔóC%ðòšék˜Ê⿪édÅ„aâÁ³xÑqº R)îK9Û~LWÉÙMbò¬™÷âÁˆöR¯§J1.{—¹ý©Û§gžˆÄM\{zˆ­ö´èÏgÆåþü—U¹ |ͱ*eƒà÷79œÙäÛ‚*ϯ pìð,CV„ó0ámMzÏŠ‘žãšw9<ô¶0 [z™íEŽ][£^•:¨Nõº²â2³¤¯EÒyKÑ<þ4úsƒŒÚÔmZ:Q¿žÁét¸WŸ*'܇™ÐÔ÷ÝãR*ê—hüpê"”’Õ8—'<^@võdõY·Qïµ±#»nÕë²ÃŒ¹Úqo鼯†ÝNPÙG8N/áä®MìF:áÉ=LPµÆ%ªT€uR³Ÿjœ|[SÈêÉ´•ÅB=‹Ñ_à†áKÚo_“¯vjx0Ü]©Ô<<Â÷úÔú&·ßs=Ì3µùñ«ÇHc«—ô˜,Øk¿óˆ+|e9wë_ò µËöMŸ¢¦úñ§¼ =šŸ8XÓÚ¯³†©v]2µi§ýçÀ Íl›Uôj]ž¦–ÎI*æÝ>ÕXV¨”ÄÑÕ#Ëymõ§¨¶â=76lX ¦«ïTí<Óum¡m­ñ¢€“ù¬'œqwÞ6°l®“â߈$©Ï‰~ w©µ;§]ÔUU½Í·>s>=Án~½[ÞåŸ9²@¿&°¨õÊ«üYM¬"–üÚ­n¾{:î*´/»2uÉEò=â)+Ǿg;|°ÓŸÛQ⋽ÐýŽR‰eV?±q¾qà1ñým2‡ÿ]û"cÏB^Ô¬LùÓšÓ°Dåûü¶XªU,@ÌóSšíRŠåì¾å¤Û·­{°ÁHΨí镯‹”qùiqÀESæ,s¢…0Þycþ=f†Ð.‡²‹Ú.½zOù⇜­à󏤎X¨Çˆ2Ö¥'@aNÐÅ':}JçÎ4µ °¢C»˜œà)©}GrÂÁøYÉ @1æ;9O] ¡’Ýá3¥S§\©¹¹J™#¸u9GÇë"ÝÇ[|p¹.ò­<çs#§ÿ×þc¢á?Eé$o‡ÄVI㜧ÿrÞÔ‹i:OO"§¦LbïpfEäÿâ¸_eÈ€Õæ„ª¢Œ¢Ï™FµJJ ð8£SÐCBdÌ%Ø!÷sbˆ$æ:]:9yx£ªí{âIU’ОA9O¢‚†”"$)Zã9Mo)Wˆ7 \á>$rÅe3ó›¡žãÇ™TŒ“ˆ›RMJ®rCªû’z€¯RI^Â2  @8ç¶Ræð:>„z=…ˆ7±Iš¡”Ár=!ü¼ª¶o0÷%ò †~…Ý6t¢,ì9¶¶c xŽ9ÎÙ_jkXèTfúD€éaÊ¢ lYÑ‘ÛË©\l7eš994ç‡KJ:Q\Þñ•\§G˜0Ê(q¬ä sr-m^ ‚ºŒ¦sŠ_t1Lòˆ”xÌatÏ©äèROe=`+\÷x¿£rIK{û™TL3sRƒ Q†ENœ kŸ¬ÍQa›CÏ{¯c`¤d¹Cfñ °oØlö?ä¤+>ˆDbÔ<“𝭿âè Ù RS%öÉšÞÁ}(ɽÀ”£ 6Żˢ ÆiáøÄs´Sª0%Rgvª¾…e-Þ¶cíàDp•ÃGñ aµ’Œ ö"œEZª<{QmŠN\ ¹¨)©ÃÆ Žf»L…'³ “SŸ}QÚZ pÄ^<+À¡ã®E¬|ÇOu¥Ú¼±^›S7]C;1K ñuЬ¡> stream xœµ[[sÅ~wøªâÁ»ÀYvn{¡*I‘N‡`¥Jü K¶L°-Û’ŠÿžéÛLÏîì‘ ¡(ŽöÌ¥§»§ûë˾:è;sÐÃüÿ“ç·>ýƸáàìâVpvëÕ-ƒ?ðÿNžüå†xus?›ƒÃ'·h²9íÁ0ùÎØƒÃç·¾kLÿMmxxø7˜6¹bÚôSà)Î…æE~—çChÎqÕÆ ˜1î¾sÃØMƒ‰ŒÜ¹È²ÑÍH´™lóŒÈ7¶¹y7¹H“íÆÁÌ“ZGmÉ +õ,òɺy:8üêÖáG¬1Qr$32È‚þüÐ4DR†æ$ ü¸Åù©Ç¯/aÜKœé' °yC|<Ä‘o`Ô¬ö¸Åó†fÉŽJ5ásѯ¸›A#„ýâá›`:<8Zf`“L.Q™ŒižÊ¸­°˜âìåãó)JeÇÐðÊyçùàéùy ìï\º~Kj`F¤Å5oÛÞÞân¤ðñ`q؈ûAÓÔ ãq`9?ÄùxOPäò Y üžä÷Ë´"|jg;©9pð1jAÍÊÂÄÿ-î/èO‹W|ñîøÐ;ãâÍë-ÖÆžÅ ŒO⃨“‘/‘%4)جñæá'¢Y<0œÉÝ:kaW¤4nvë…ü'X‰lÙÛ¨N8—KÒÀ Yî6Êô™ÉÕªBDG‚ƒìng“”d£& òãÂiÖo×4‡jðB/a) ¦E‘¾ƒ@â.®EJ¯º¥z*Ô_ÂÚ0‰¨â4¥w¢U"<<‡Åqçtkò}(Ǭæ2¯ûA.>9Í ŠØx ŒSÓ±Èó{²^Ć ±¬^xüR½ ƒƒ7H_hѹ¨ö24i/ÚQ´hùžf…{Ì~m I\¸,"º™lIèq»éh÷²]+¯¬ šºGý<¨B“ƒäýÎY ܈„*µ³IõF.L'i•é’R=J·ñí±R£D€§û–ÍËk8Ñ<ci[Ÿ0«Z|6ïCtd]+¶¨ˆ^»cÁ&ÆÃá­ úvjc²‹þ¹ ²NbT&wë™ö<÷Š’X7Ò¼u§W± Ƙ®œ³È{­<Etªü•54UùŒ8ŸüéÊUX;¤£¿HŠÎ&.5¢VÜEQÚè æ0‹07µ ޸ܵGRÞÂFÅŸGõúºãMð%|Õ~œ(_C¬VJPëé’Š­EéH$¯”÷ÊžòXäZÚ áŒÐ†4\î>L;iï³ Í­#(ꀛzd/:¾KôȨG…±,/?Ü Óƒû!Æ“‹7Ü£ùç?q)$,–~#èÛv›»ˆéÊXü6,‰÷·Ð­h\òíWЪÀ2H;$óu1aѹP寏_:5%ë w͘äfÖÀ \£KÐwð`} A÷h"“TXˆS"] Yƒº·¬8ã9¤#ò€sÐ*È.©@Wbä„äöÚy‘iáç¤Ä«µcå:E¸"¡g¥Iöÿ·õå½ñÖ¡‚•&|KmÀy^O@½¬Ö ô¥vèÞÃ/å…)19Ùâ%âÑ«)„g-¼Ù¼'Ÿ:/JYPJ.yãû©ˆBøxbçF!.ÎI× Ö¥žx`ÄË€.º£6+ nŽf<£ Ô³ä3ᔥy+ \6!EÈ“¸î'²h‚œ.ÈÒ9ñU¡ïµûñs_X°ø7Zçä_a²ð1rN6K\Í z€ûFÙòs”Ëlfœ!¬y·`]È¥iÔ‹ûiÆyJ÷[8ï É_únšDOÀ”úÙ¢UR&PÖ«EÑ$$+÷¨Ð Õ”„ígâÐ6ÓׂW"Ϲ ’M%ó)¿Æ ‰“Þ›+¥ QâKïUoe!fˆŒ©nSÀ:§”§óiw!mOA†Í‡”àð|¾£”µpü-¥–цÍ€+0Ð*ɾ«5¬´ 7æDêYt!g´õ ®½ÃAjD<°º4ȉ{ËàŠæR-eŠü'~‰šÊ|x]åúP*0Ýäz”5Ë´¼NQíqº1ÌÙÌ™ƒ*Ûý¢6.Þq'ªm†º‹ƒól»"§ôÚH,•3”¿Å˜'d§R*©RÈu;Qƒ,3 c«Ä‡švš@ªu`mh¾luZ’K·ë|%ìf=Gë.„œÀçÝ'_ìNå#ì)EÑ-JÎYÉYBgyÏ"ÎwwY­XS\‘ð”Ë[©„†ªñÒE³Œ2u‘X®µŠpyë&sžŠ}åqN¨ ²ˆe­J*1/Ïãí†Æ29:?̦ã6yÃè¶ÇTëY`H)QäŠ..JºÞ» cWî:QGÌã°íaQ+›$´~¶Çðˆ¢ƒFnQò …DG`¡*.Û¥L˜Õ3› ?›î}¦‡64k—ylºùQ¤~]s柀×j“€ïù°D“t-ÚŒp÷Ãö»˜“x[©ªæºÕR d¬ã‚Ò½ [J÷Rw'nNÒâë^F"Ò²æL½^Ÿï­ßmgSÜ_çÉ-3êEÛ¿)imz$“@ø6?ÃGŽk!¦o~É©­sð{E©Àò /ð1gš„â_Ò‚ 0²Ø§´‚K?>¼&`.Ε¤– GTNŠaŽ[XsIteãS&¤U«.Žûl¬©«ø9í€my~}É`’™Š”¤Ë/dsA#Øã`V½` 0ìd|¶ÚBF³‚TÒA?Ä8$D:’’¥Gê³(—f`—cç›6#×Ý!È&³€Š·92ŽPY°c_m2Bݳ/"®"¬QáÌõBï„×[…~Ü„Åç)"Ž9”N_@'’”Z¥'" @jzÝU6eh/°ìÐT{ëíâ¯îQleù]õOàVZRŽ ÔËäc9ÓÈ>‚|N¯zï0wú1/¶‘RÈ}×ÆÓ x¦:p--R´¬>&>ëD‰ºÎ5<ÍæšÛK°š?ØÀÙìå¹dËép³Çu‰v*}j:Lfœ¨h!¤è’ØIe‹„ (ôM=8)zÕ±ÈñŽ.%±Å=±x§%\æW®«Tð‡À’¼A3Z hª|s’ì˜yÙõµ¦$Ëèm­à:‡Q Y"ò›TØ ÷¾Øq4©1,ɱ/´Kà€Ö14j‚T’½ô7´[êú¤H^Ú_¸ -1tªF‹Ý£EoQYd.¬ã_†Ãé²b\Bºq–ÈAÆm#Ñ‘îd‰D³)ûââÄXýÎ rß…¥u¹RÎaÄ5SÏM¹œ ¢néþ yp3ÇJ’h¹qö7ަ$ríäÒnï§zëè1“N³”mFaDlY îÅß°  C4n÷€äÁòÌQzõ07nök|ÊÒ-2º©Ž‚‰jd9„"²k#iã+6Pô¹¿)äzðš4»þ¹ ^±J}>>o¥Èy>0Ãw˜êö‚+-{2ª£ðƒ4—Œù¯Ú”‡UO«W×–^OL¿`ïo‰eTk좤St3Vâ|]Z¿“áÊ—Uö¼Ë£x!ùU¯3úlå²l54‚Œ®ïfäjpê¢vŽ ³=G…ÇUÝ¿H¯„«ßL!öOá ÜR…¶·-üðuŽ~—Ù­ËBBFäáýôðóüð(=,|»ül¤ŠÚãV%o¸ÇH‘±B¿-Ї=‹î›*«’Jûïç2o§¸ì~;b’®Ÿ*S¹ÝhAýÿ¶!Zœ‚¯ÆIÊqr‹Ñ§™ ­ž9%€/oý3þ÷?Ñ’­—endstream endobj 1006 0 obj 4385 endobj 1010 0 obj <> stream xœí\ëoGÿ"ñ/XâCî¢ÜíÎcƒ„D --´Z#@i$œ81'Γ6ÿ=sžsfwÖ”/(²}ïî<Ïœó;ÏÉË“¡w'ü㿟Ýùà+¦“‹×w†“‹;/ï8|}Â?;ùèš,!?êÓÜÉéÓ;ÔÙÌþdZbïüÉé³;®Cþé;o>—Áõƒ¿ìŽñð;øõywt}JKL‡?æ¶_táðew ~ÁvæG_æŸ_åGaÊíÂá·ÐëãîèÉ/þÔ…¹†y¢Ñ¾Ê£QãüÔÅÃ'‡Á—éðY™çón™¨Ï©Ž•;ðÚùšÒ¬¿†èëî8~/>.á.°õ']È#:Gßðù‡]r×<Þ©6Ã5~Ùqÿ‡§¿zFgéG×OK&éé9“1äŸÔÐúÈoaèg—5¡ŸæµÆÐ§¼Õ7™†ƒõ>g´þðý2ïé; Ð“.®àeB’^ç~ôFoò‹1áHð;Àðå9 sžÁn‡åðÚF<ªGùc"²BËw]ð8°t qÆvo„TõÇÃ]øþª;Ž\Ê&þ0â0¯`&á*oã¬ÃfrÐxÊ䦛vêñùsø: ¥Úk¹ì€ÜaÈç299ŒgyYÌM0ýEþáïçn³¯ÇÊŸ¼/:8éû6o1œg\ 7}ÜEèaMÒË #­ëÛÌ@ÜÞ^áO~ œ†'Ä/ÿÙÀ  ­ÞêLð¤Ìñ„{¢yxÍÜ&û?ºÐÓà‰ 0Ta$Á]}ßð1Pe€)=¾8"ÑA²@Ô?‡SÆ_$`>—ú<ÅçwNú TrÀLÒ9†4¯ù33!ì95†áÆ^ð‹NIYz¿Ãž´3ÃU¼™è°R¼É¹óˆ‚tWTf€!§™ó¦Üå=­òE-6Ø–ŽˆG0\P-.8Ƥfê#Ûf8ñ´°ý3zŸWiè“ljEÅÑG”—ò°âêè"²La86xò'ì›)mP¬y“¯ø;R„¨äA:ÇPq$. Ž–7C‹!6Åý"“Ži¡mo ׂD"‘ÈÄ[ð̤·Î›Ê9Â^+Î –Efeƒ´ˆò|Å)xÆÂ“#N‚ÊLŸûÍžhû†‰`÷ãbÝÊzРcÍÜÂt¨4¨ŠíL× ŠK¿ÌIøë-¯õm(\ £GT¾—g{^èŒ Ñ¹Áá…)ïîa±æÏ+3Ä-MúŠ‹ G–gs XI¶DfÐÎ)gîÿ·2·Ê8H[®q…EµpAõö(8í¦Z­¾P•D>|…ü‘c|äÆŠÇË‘«¾¸ê=ì¹gÞq¬I€Ø$|Á„ðÕºÆ,.%Òb0…wàVäšðga´´5_‘â;2‘j[Ñ+TàäWq^n;âq­Œ2PW+rƒB`Â!|ò¸u_š K6Œ.içyÜ]…j²Ç]lèC°`¿ñðÍAÞ‚l~»À|þ¦#¡Ñ…²ÑãÓ¸µ;‰ ‰$ïÅE˜pP£Z˜õ»ˆ˜Ex!C¥ïÉ–y´|ÕšÝk˨»Âç…p•Š‚ÃBÎu]M0V¢X4ùk±‡¤I@­–Yà,•å2IjH³úgAޏ+|TE©vr $3¼ÅŒóí#ô˜Js1ŸÖæÓÛÚˆƒîC¯¸ñc„ÑÏ “+ÌŽ¤.ß1¢f¸Ë-.sˆ¨Ò™üB@µ…ÝB±py9Ë5@ÂÓ4×J5yÛV8{O~žÝ>"šUž1ŸÏýþ î‘8š…Ï…}Z¨”ˆ(1pˆŠ6¨¹#Ìhœ#æDup{L-ã½iaO“Ú²lq=« Œ$î2OãökT6`„ü †¤²ö¹øŒ?R|"UZL1 )hÛ÷ç@ŽZ<Ò¡ÞÁC‡´?#û_ ÄÊÁVpòdÃjýÈÞÌѳJ?_É£ˆ¢žêxҶ¶¥ð•7ìéÅ=1Èf#+Ð÷nN»ƒ¤Ã?ÄÀ@B| æò±Rÿ¼ùÏ,>ø*¸dãG?Íý’1+ñ¤Àʳç_ßÁ¯ÌDn@›ùpÄ@ŽÃ¯Žüžš Žã°ð9ä7px¤Bš£ˆŠéS ¯<¼¨$ŠÆŒ É ú¾ f¥'·ô#}øYiyª_~¦ÿ ný<ïuœ‚¸W|Žsèc~'ßyE¬ËŠXy)§ŠZºþ@Ô¢ ñûó-µx‘­‡¯˜0Ëü &sŽÓ÷“vbÂ’rlöïÂxìÿOX%lÐ÷¾"lƒš¯þsj"Ä_ÎK›³jnœâB¾Ç@ÎÓQ߇ÒÉ[¡oð|CBòø¿NÂ"ÔH %á&ø~ ±W¯µÏ‡l¥¡#Úhœ{¤¦2غEG"ç îØÛ0V p½'d©ðyüO1"æÔ%ƒ€+GôįãöÖ® Úfï5:zþ`~…:ê%­7Vêè¶ŽåÑ{²r$ÖªÆ1hš¦©ƒÆÒ­ÛiÖyÍ$Ã%qv‚}ËL…ℳ«&Æ„˜Ö˜ °g?öüøH^ÿu9(oCH&”i_#±þ©?ìÂxø¥{sW_Ÿ Q[©ŸäCÇ<&‹¾F—¯ö®îW.Âd9KÍçhCÁjÉsH mffµ´›¹šÃK0àÔX#/u}HƹFL›(Ñ÷©²êû²RÈ`ÈO‹#\+!tØùÏ;++¢…üD±®\žíWïzo—‚U/»ãÆm8é·Ä†Äfîm°SSŒ0ø‘¶ÙhFrØôº5bD/±2¢)b1AäÄz˜Åo*†60y·µ·¯žÑË7„ ‹d>/ öHÄ Ú¶Bô½Dÿ^è†:i!ž"†w¨)ÔÔè­õ}Ÿ‚Iü†-Ì‹á<Ó´I2jämn~aeòg]Ӈɋœq®L/F×ãiíž Ú…½ÀÂÌ[T(;<°æ@8<”g #ŠÛe“6%Šk½Ö‡/+k²xGò0ó“Ñ©ú´Ó§oVŸvãI±­­CfÖÉrÿþ| \øÖ™ÓH ÚÌÍÐjÀèšÁÊ÷QÓê#*å0X±D&N 9¬H‘Åš•<X-9©hjÃ_ u¿WÙéÉß×tÛºAO®ï½Î¯ T Ê2`°Kàp£í°sJ²ö‹ismqR¨›,¿¸ØôK«/;)xzž˜€§Á^Ì/Åt:/®CÄ猲å±sÓòÙÂ@ÓºóB CªØ¨­²[‹±± m˜C œÊKZµô“-ˆÒ¢±©UÌÅ@_J¦¸*á‘zôJ‘vÕ\µ£³HÎo,™Û0™ ¾Q>]:·â×uÒà¾ß)jdªJÁ&ÊC(ÍY6‚µ©üâêz¥Ù+¯^9ÒxˆRÖ¹1ùa’y®Tiòs3wõó€Q¨ü§¤c±uñƒ§Âbr'W4‘ýg/מ‹½šGÆØøWƒš¿ Ãå L»Y3·I¡h¼m†çz(°[S TX¡ò˜”%ºž±\ÞÞ§ ˜ä¦F~e'±9bálVo°ó- Ù¤a  w;êXAP"åsL‘Ró4môÐ,-ò’Ë!¡Ô¹¯ {vÓ7ëñoMßÀü†4A–ÝR¢Uôƒªð)òlÒ¾´’r.|úkîó“r˜& ò˜™/³u)K¿½ µ`Ü’ *l)P§Tgÿ5-ñ¦ãVYZ”U ©P©CZ½GÅ;óm¼Ö‡â9‚óíJ%۲͆­¯Ÿ@L¸ijPKACž°¦GVšù{}àaÉ_ãBÅI¸ÀvHO3ûº;‰½;¬xÇÅv6¬Nã)7ÉÇs¿¬¶UŒßi¥ä†>x“<Ôòøšpez¶RÍX™5-w¾„NÂÆ“6”M=÷-iÉZ™î$¸­µ%{öŠšËªìŒF™€\ýª)ÇÝ)ÐPÔæÌ* Dš·ºËÕ€5¬ë,d ÝÉ„½{µ¨®l‹ewVÜrKÀ"–K¸cµgøêÒHë²ÕæZ䇪 Š|'‘*¾p3§Þ—hC}c’VÑÜá]¬—–=°K>ZÅ2››[è¹|Ï(•‘X3QD†Û¨ŸE#•¤£¹÷´©°(–±$m{B ‚°µèøF3~79i)éžTÅåû®µËJé¿ç‡Wž¼^A ˆYüY¾ô·Bp®ÆØ‹Þ3ŒTØÅµ.º–Ȉ®ôY±üvog×ÝöªW¤L}TE­e,Ë-Wooðñ°A‹ "_t+ÿBPó M¶gç)™É:Ù\{ ŒãmNî±ÖÕ´ÛYÞ¥ɶ0L܉թûéÖÈ›„ILPÀÜu‹ªS=htu±Ý*œ¬½þ°uR£²Ë2¶Ã]"£æ¸œÅÊ•~M#I¹°¾âsÓf;²IèÌ}+¸•G_¾ažêÒ™¬£6×~Lñ7‰Døeª<þÅ5LDø4·µe¢Ë$ix¯ˆ*ÄèX¥ š­þß…DäÓ—/ƒ¶°ËdÔÈÉMÛô[³Ý2׿\ˆöŠ!ؾ!Ÿi÷5,\Lý¬p±Wþø&UŪî£N~ÄèîÞíb¤°š¡©ß¥æ¸‰«î§*«¨î¦Öi5,ºä ]@‡åHÖ@4•Öã”çrG|“¸€Ýs-ã})Ðd]˸œd#ð.¥¨G'WoÜ8Ë 8Fáí——q“´ç…þç?uÅÁ¡5«¶d Ke¥c¦µ+8Ð.]^eIZ)ã嶺ô`™í]„£«öi}6kHíðZª(œóñé?äÿˆ›sEendstream endobj 1011 0 obj 4845 endobj 1015 0 obj <> stream xœµ\Y·v~W Ü¿0AÔ¸;Å¥¶~pb–aûÞkOvF3’,XÒÈÖâ;ùõáYyÈbu·¼@Ô]Ud‘‡‡ßùÎÂþù¢?¸‹þðÿ×/îýÛ×.ŒO_ßë/žÞûùžÃÛüßõ‹‹ÿ¸„G¢K—K¿¸‹Ë'÷¨±»˜üÅ8ǃó—/î}¿sݰ‹éoß ÿ{ù94›CÑlYØZ^Þ¤§ÿ³ÛÇÝg;,Ë—ÝÇßý­ÛûÝ%\ÐíåÆ×Ý>øþлˆ/Hïé®.]³~«}I~÷Uêõ“Ž¿|= 陸û´ ‡¾!îÂ/àŸôLˆþ°Ì 6ƒ}©ÁÍý»oºý˜®z¿û®óéÃà6¸ì戭¾í<Ï¿ÛÞMþüÅ>ô‡) ƒäð,µx™ìcêkÞ½éÂîÇô†Ýãt­O¯wÃî:Íà6Íûyzô-Ü{‘F“žvŽZ†4®ÇÝUz,ß}œ¾NO¸ŸxÓñõ[¸P¦éab›©­>rÝ…1Ébð0܋Χžæ1Ò0`<ÚæñJ®>¦6 êÖàå8ä× ü´¤ã£ô´"O`„´êú‹£ÑÀìþ‘ÖŸ^ûK·d¢¯;Xˆ¦:ŒN RÑááqä§³²á•âÅW¹N»GIàKº:QûÜêG‘ó:P‘ƒ$ /œøµ{¢‚QïeØ{ü¿÷4úãº€Ò Þá+A•nQç퓃à³N;•¡¯$Üv„°k`àW$µ‘®¿¼4 Xè_cT}ħôͤH¦gÜ}»q‘IÚá­2¸+Øs¸4¯žEåHoõ½*G=ZëjNª41/‚„9‹ÏO>àÁ®QQ¡ÅÓ¬Spsš<8==%œ*ý{¤²dHgIYx¨,Ã2Ólt‡À´à î”7 öP M˜új;‰’BËg´ÏñÚ4žPô'*,=Nã,™F\ý_»Ÿu^×möˆ] Ø+èßpE ãŒp ‹0÷kÈH±—2lØü<¼,=t© £<:¹Üõî‡>9ØÂožG@Ï ‘‡Ó@{—»ŸŒ0ªÌF oIåÅÜ[þt£j†Cs/ÁE# (­ó5b¸5²…0ñ„ª¡]ÏSŠà¨ ààÁUàáÇ6œ5€Œž|æ>b÷Wôi>öu8oŒ”µ)©û êĪÄ;¿¯¬IiRž r9u½”Å®7JÔZâÝÞ?I{¬à#¡w‡/ö‰^Ís÷_”½U¤/}ÒÂÓû„¥TÀ9lj7m²5$ããv §=‚éëî§.ªÜþ ÌC-,Êö†ual¬òP\@ù<5@à ©ÊòÆY)™‡ lkñŒö5GkDe^õL LPÅ"M]¢5P¯‰$/ m=±./³B©dBÅ•ÜÌa¯C£!D ÅjþWÇ1tŠ£ä%øÊÁ’ ji÷>­gΰûç56Jú9(úx"  ¡'#q?}ݧ§‘è#_üRÇc<‚ûð\Ô•YI×Ú¯4 'ÐUj…ûâ½|<Œé¤©ó#Ù ?œ¦wzdÀŠ»¤¾d©†CœEtPF·än»Š11 FÜáèi®èÔ²Ejäöeîãan_, Ìt?íjp0£¹Sµã]>Çb— ¤1ŽíY¥éú˜­ÿâÔ7Àöø(ÿ4«¸aÇÌ#ŠK÷/ —¡Àxý¥5#qN1óŒÚ¨<³þòQ}ñ„›|!&rBQ„|`ßvøË™ÈÈÔKõÞŽKn–cÍÊzxÑ’GÖ¼„LOZ RéSV"ñø†…ÌûW !Ö¤¥A¢sÝÔ=B |^~”O1=¦¡Ç肸ÂÜBïQh¯Jg,‰ú†°…ÌY P$@·û„`rGXÒ42Ãf²Û9Ó\á[ìÈ&ÿ/ w€øŒ¾%\K®;ôÈœK>\×4ï ´RdÄ á–%X5͈¤Ï2{N\4d5©¦ô–ù‘ôÆ{H¥ 0›Öë”:SˆËTf)«*¼ ™yf¥/[=«dŠä9úð¬×ÌY¥ý¡‚Q«MƒýTÐçÉ1%¨!æ‹wqËüDü0'#çÄÁão°®cöôcÉ)8´©éõ°T¯=‡ïŒsƒmœ™ã#‘[Ž9ý»Ò Š6'q¡´L9˜ƒrùQ¼>YÁÛÜyª>Šå»6>8ÀNh»ï0ÿ>¦Mçe» ¬}KBå½ãÛÚC¬C¨͠ĢÊõ2 Îûcr©`%ÄÛ$÷Â×÷þýˆý× zŽ£äx¢†ÜPqGËTö^Qóe¶£O{Öê9ŠÇ½¯Àáž¶±k…Úõ¾ÓVeØÔÇa¦ÿÈý>®¾4|ãWj9HA‡ƒ9¨®)‰>Ê,é#èûÙý5_¡ºó•1HŒvY¡îcŒaÁÁNì^Øȯ°ÆÂDéEl¬‰8TPÄÉ„a(||rÞ ‡a€Š{ÖäHö•Ë$-ÄQaÏ·£ÝVG1É‚ráÎR–HÑ«¶²°CÙbFàég¾× BžÚš=Ad*y×ÑàÕÊe:´å¤'EI—Þw,áxæ+nˆyWßp0ºGæƒY&Kð›µN;¨FűÑ9Kí×"Ö±ÜôŽ¡ÜŒr‚œÃý„ª3Cî%åà®®­¥-ñ Oȳ'b¾¸i¯åô„óâ‚¶Tâ¸ïŒo“nޏ37 eG¦fÈN—À£Þòô‡bVhx¥U¹•¨iEfG'³<ã¦Ä«ÂxŽ Â Ë8“xe³Ï}ˬ‡Ò¢åä|B±ÄàûHêyǡƠïRÞ!±Ýaƽûªàµ™gµÂ8±&¡¸Ý>d«=cÚEÕp5oò½ÓÖ*ÂÄâ`aXoƒÜ äj<ÆDùŸò{Ma—Ÿ×ógõŸÞÖyB¡q(;–@—5 Æ‘ô?fG'V2Ùí¬šÏm7*yQ™Ü¨U‚w!šY‰ÐÇ ¨Ýc£ò8ž·¿ET‡P)‡üßu@ØUþmõD ²CT…œ¢Ë!'’°ÜØ‘ûDõçöbeÝù¡£$ˆã# À §}¾†:#I¦`ó”².üµt`ÓÊ,3ibÚ«0ƒHý†Ôܧ¿{í"§9ÈDÚÄ$Ï©T›µ ‚A²•‰öžNf‹N\w±€(Vɦž±÷Yl6ëcz:+@òìਣe •Ôr×ÀÀ`¡ébú&ÉÉ“š¸ƒj¼[H ÊŽÆ®˜;ð“Ka®‹$Ã.ŽÂ•‘dñlÖÉ tè¶$Ö9Ó–½b ¢é–Æ Û­©¸°ðè.²«Íés–J„B‘~.4€œúZY±‰”tÕK`i£ô`T€²p2?ú¾m¥—OU޳^™`ê7´kÀ> b}J¦2,ðÈSÓ4Õ´ù—T‘ǤMêÕ5åcÎæ0ËÜ¥ÅÃaáÐ8°iëã×ÏAžI‡–Eï:jñ n±²~R86Jix¤k:pÍË_”¹èúŠÕÞ¨Ò†;ÀâY+%VôRxB³RÕìY¥0wƒÎ‹ia^]Çð " æÁ©W‘™¬<ÙóÓÒR[¸2Q!2pk%&æcÌ.¼J˜¨ë!¸5žA6Ö¤æÀÂD‘iLËQ¤eÏIœCH¥)»Gc¢¼IY Í|m£LÜ_=È7D#àšâi{ýÀ:º´3Ií¨¦kÑ*0»¶hÁ„ë^édµ¤vQÒxNÙc´y^g¼¤¢MΪ˜qeëd†L÷n´rfœË‹›†¨ £Bh×¶e˜ÔÔ*޶™¡‚‹íÀŠ f#@L‰š­ s]FsÂHXå ΠÄq¦ø6¦59—€Uä!Ä9 2™UˆãÂVi‹/­9Äw”øjTˬÄ!ZãfLW XæØ\êÐZÅ9#ª1|Þó)Î…_Ëg•¿¬8"f"†@ YUÌ; !à†ñV99d¨’gTt•H6˰~\8oÂ_*h)vº ‘©^ou& ¸ØïÄhóÊê܇¡¨•A’Á®®[˜ü ±É¾‡Ô“nÅSdQ‹í­!¡.Á­ hi:ùõÛá™’+§.‰ T¸Dš ÄÕgQ>ÛÌQªLÊ‘ñ¾iáLÁv¥Ü“C”4ÉXÔR)£l%4_å~M1”aÙ`8¬B Ygp’ Ê{Ü܈6q€ÐMµ:_Ü»ü×ïwÿÓÅÂù…R­øW#.ï1ÉJùGö†m$Ч |N@oäâŒFµ—QœÓ f»æª#àöÑÔdGIK5ñSÝ­ÔEá2IÄGZ|6÷‹[•ÎHcâ>&ýYGoä5@ôþ%ü™÷aÝK¯™—•šs4‡¾‘—ä¤Ç{Ew8ü áeê©í†/´b4\WD{œàéG³œÖüH­'ïàî&iùYÛ¾$Ä4DÏÑ0تŠifÆ:Â+­ ·Ê‚7òVG+%úÆtRëß&8Ž8ñ ªB@²„Ö{/ê²%{šd‰IÃ8H–&¹óÁ¦ï×”Ç Àe·9lMä#3½Òa Èìo3||Vf‡ xQ`¸—Dg+©FõhíEÁÿ‡²ÞøýbÒRÏ7Ά8¯ªâb#ÞØ®}(Ìœ ÜÕqA›j‰LCÍ£«øw,CØZç7ÖµXtÀìxš 8åöäU7O²0þÓÞÏ Õâ»bó´Ëì ôE‘Í[ÃØ¼9¾’ƈpìü\¨.”Ã\±‘Ƕƒ&V쨃æ PHiÇIdÁS©iÉÈŸ£eTrä¶´l ÿÚæJ \Ç¡ä¯vuЬ£ï:Ò Ú™TGeÖÊòîˆy€DªÇ0˹VŒh›‚r|P¤IªWݲ \AÆ%W=ä2T›Ì šW³º¯$ÂyÑ‹üÄ©ÊÒNVå£XVy<.‘k—Ôÿ­ÉeÅŸ¦#ï*Ýš g/ÄPåc ”Û[±IFüúlD~ðIa3¥àS bb¸ áí€R†„—«ø5´/ÎMÔ‡/€bŠ,¿o Ì7è/TŸDÊ_嬇Dؼ=´B.Þt˜C,ª î‰F¯Æ'¾¸È}ã–Ÿ„`˜£ƒ1pͺ-Sob5±¦RÙW1öühîePÉø§Îôí;£BÏ;B šJvúÚèçšN–8°Ü†5YËFm)^7(³Ò9?÷[nd”Uƒzÿc•ÑŽ0K…h0g Z‡qH舒ñ o5®ëê¼ÛŽŠ§»´:C ¤œY¡úûhÏn#¯Ex&¸Td)Ø^B@£ú˜ú2)üՃЗJÕ¹ ›Ïd©¿Éo1É(N9Aì|N–ö;ô³¶©Ý*B ǹ\Ø&èÑë­#@R¸µ>øuR¥Î¬ùj{c™~½ÀT´Æ|zô¬gD4ß©T“ÓžÞfK8ùÉîß¿k•˜[Ê*1O9yqZ& <(D€Åe- ŸðH{Ò‹=îù¡_ "að=&ÎQWP8iüûL#¬„ŒÕE>žEí¯ 2¨È2¢U^±Âœ\|ƒ™¹œÏ3¾§µ+"Éoôâ}ù„4ÙcAC!}ÿ@. ”Ÿ]ªàà'@áÿ@!ý¨÷žå¿Ö‹oNLíîÏRëÇ Ć*¦§óÑ h³yÊý §µs0:= EO9lôœÓÌ”k°ä8L¶yÔd~ë_d=¿ã¶«êãoÈ·`½Á[1mJ¯ *q{a×…ë†FÞ5IÝX *D¹y´m”¬@œŽÕn\#¨$¤Êò§çY†ÊoS_ÅëmpÎHS)ÊÍ¿e õóEr¶t‹©‚~#m¡ï*…èüØsq¢Ha`d?eëU3+ 05kŠåÍ[ÀÞÞu%¦`¯0†[”‚†°Ìwú‘Š!'ý½(—‰YéPÂpJ¬ÆÙQ£ «Çä?:ÿ“?“×Ü(u—[&eëª(þUŽœ”ü4…›p¿ãk¤Ï„F1!$/¿ÿJ+µîøøÿŠìjÐr„êl?Gúêižý°=À z ¼IC®ûm†è[‡kÞšGÈ0179”AXjâ(ÀÃîê*S™n`_ÿÔr›ËªMžM‰Éë_>ˆt$³L½“#>ÍB%_<¸ì«œ:ÄølÝQöâ,uí±Hd#RF<ÿp”)ò¦?ÖeAß D¾LìëC 1[‘ðÇ%%`Àe’ÍäÊ1‡ Vë¶ÓÚñÖõÿZ‹T1¹©åüølÜYI•qYåY×Å;‘rxÌèN¥ZŸ‰H¥2$yè9éúT¸T¦p9$1ç“4JWw{'µ?¡´>#ÃËÇ]À䞪Ȳœüm–0NX]"1ÄU§kW«Oóh&÷ª¤á«‚q•™>Íøº±Šl‘–MeŠóŠšK®ö¬¤ ûÖí¬=-{›ÚÄFÏkñß–ÃHû/Žš¿Õj¢T\Þû{úóÿàÐ÷©endstream endobj 1016 0 obj 5068 endobj 1020 0 obj <> stream xœí\éÅÿ¾²”a%`˜¦ëèêêðÁá0 ‰ã$°€"@h½kl„½ë“#}ê]U¯ºkfg„¬]Ïv×ùî÷{UóôxèÍñÿøÿ³ÇGï|b\8~ðüh8~pôôÈàëcþïìññû'Ð$ºô¨Ÿ‡ÙŸ|{DÍñdCô½±Ç'¾Ü˜nÜ é§ï¬ú¼ƒé3n>è¶~óøu§Ûš~ž£Ÿ7Ÿ¥¶ïÜæn·u6b»÷Ò£»éçÃôÈ…ÔÎmþ½nw[»ùwzñEç¦~¦@£}’F£Æé©ñ›: ƒÇ°ù¸Ìs§‹úœä±RÇ^¡)Íúg(â@ŸvÛ°ù'¼¸]Â]`ë:—F4†þÂçïuóº¦ñNr3\ãÝŽû}òW §7šž~4}ˆ‰¤'çLFŸ~ÒÿÔÚ™Y·Þz“6h·nè'3ÏÔk›Ö½ù~݆_‰Ä¼ºwÓ'Ǹ~ CbÕ£“7¹ýͪµ‡ž¹Sš| ÕäÖöÞ§a¶Öõž¦þƒ,t±-øëã}!Ÿîw~s–~.ÓÃLO€È/Ó/˜}ˆ›Iî'’ÍfóÕ&}¾ìˆnóCç,öÖmÇÍ@Vüô]âõò›¯ºô$í4ўюÂ0fÒ czCØœ¦ ÆÏ0å0Ø6oçô)zé7nÎy¬D·{MjG=|RP˜àAG”ú!«…O“¥5ã«´!YáCbŒµH¿ ÆŸp‹ôð”¸(­€>ÀÚ·¼ø-Þ8GÚ÷Às¡üa?VLüM[q#ÙÙŠ…­8oA……%ÎHaèòØ‚ä¶>§öÐ@± öü@uy´€ÓÖÏd†S!2‹š«z÷µ(œÁ"ü]DÅÇb‘“•-y)«JÆ©i§ÞºDEøÙ9Ñ̈|ÛÔw÷D–~©Ám"ò<ã¢i Øç‹ô|²"âvAΈ´ØŸD}©áCQ!5(Œ…kH¿Ü,o‘Ê¡R‹ÆÜˆ$C˜1/]Y ¡´¶Ö¶õÏŽ3 uÚyìeÚ¡´ËtfÌK ¨”ÈW„üJ}Í‚È#žåÎ,bv’' ‘s".&ÑWBw¯ŒDò'ËÅ·Ü,-x µ€­åµ‘ðÐÖkU\›aèÈäæE_ø–Ì>*%v8'œ5sF‡¼Ø‰‹&5KOÈ¢ê+KÞ-•†eÓ'S”Ì4þ gâæ%Jhm×Ñ x2ò3Xøù²Ašõ{ñ"@!aÜjCÊÝï,’6b˜pJ¦ÚĤ—FÄ+[Ø|”…·ÌªDÞ„í8¨ýBZéásâ8½ä3å½81¦ä£îfxÍÆa¿=çns$Eš]²0D²É ;ˆüÂlkÙJ1çÁ— _-…‚ÜBzíÅt“,§Ø‰â0W°Ð$¥Þθ·JJCFŸªÀA³Q4>ß+R¿õlì¿Í‘2{¯”¢µðÜ·B-Ä™ƒÑÄ:1—¸ÓX“¹ÂÈšå©íh¯¦Ø 5øyCÆx”`ƒ²ìÙ@{‹æ·BQtÆJ»å½øp"5°ß’—ñãλb \­¯Äh¢èN‰Ó¢–¼Â< þžÇö((7Åóÿ`=7„™ä霦¥cÇ“½3½â7K);e3÷9žÆXD`Ð*d§ :6x$Éuœ³Ã(¶¸¿‹ ‰ügoêo*7²4“n &œÊG„[űiœbrÍA,Ñz޵¤_–‰>Ha|Y< Ÿ‡>'ÉO©Úl³)•ˆc¶œVñšñ«õí·“´R£ÄqçRaÂD—¦"±§ä¿Ê`•Þˆ×~r[ì+\À/e(ç‘„L“Ú…WB–"‰¯˜#YR¦€¢À p)'ZŽ’]¡DËÂ,–~Z[êjyO<ÅÒ¢¦±s€Žb˃?Pü_аٕ„UÔÊ"â*šœ»p°ƒHŠš²Ë§58Y•D厒i°ƒ>DÌ] \ªX§ìM„³É‘/q÷ Õ¹¶×.€ÉYð¢í¥¥^7òÃGU(X‡ VÂHÝX–lN̲5«¢èÁ‡{0ɉ‰bßlŒha‘&—ð÷€ zvBaÁ^3% ‹çZ0ѯ˜†¶ÀŒ•ß³3Ù8eÐv8$€bÚèÙ=-ƒÊ‹2Möö,lVK=w —ÀÌPÇ×{ çÔ¶ ’‰ÍžCLµÏH[áîO9yRŒŽR%ªe.Ñ ^œvm¹:/¶©)þ,ZDÚJe&£$3¤×tl`ΗœÏ¡„ó#Ye¯<­``Tcäìá%Ùf^Î$Ñi,§© 3 ']tä‹/˪vy4^'f¹QÙõ¤ÓF"……õsA© –ëc<(uEoãgtÇ’‘L !ŒÛie˜fóFšàÍÔ÷ *6y®<ÜÙÒ²âL¸ŒŒ­ì`-œ7ºvVDæŒå Q›.VÇ–ª&¥†œõYIœã)8«ºYÊZá¸ãmøgJ¦¢rŠegÇ)‘œDš9ߨÉþìYY•ª+kÇA)£uœy]jG3­S~•uIâ?Úœx?#Ân«žÅ´/-#xHÉÚ*EŒØíI•M0cgž%cÂYx±°Þ_ׄé2Åà9!icônM~‡Ö((ìTÇ£{W«p7J¨+lxŽ1ÛwIAÌØ4íWøú“­¬ËºŸ rX‡k(w²ËԿʺÏf]¤+ùÞJ¾€&ÅòãŸSE+±÷ãJ%9¿ M÷܆Ê”ÀÈå)‚[ʧŠp-BáÞ¢…oäî¼ÕyO ÅHQ.XÕ/9„¥=¤åŠú'0¼h’¸ØÇiÖw!mQ¾Âоrí-¡ù:µ€$/6M3JÙI1é‹ÐÂÑ@Ú†–jÄà´B´ÚâïGŠV°§ŠFe¯ [ÞIÌŸøó¨™5!?P$ú¸CThd ‘ V¸2yi8[¥Ãà‹!ÃÀà(bÜá¯9Ϲ¡ 3X©ÙI«‚Œ‰ó*ƒ¯VYl‰²ò¼Èñ:f“Ÿ±‚#qKT#]̾x‰í—HÅà&Wi~/` s_ŧ9P¨å¨ž[³Üä%Yë BÊáœ×æ€ý³¤<ãÂxUþÍÔÐpÛÕæfa‡ªdøÞ#Sþ-Œ¸Öѵ¥*”„íýN¤µ ²cc±­HRõcûn´tæñë‰%Ž Ä»îS@€D¤&dŸˆ1β:&ˆš-ŽN‰”øc…I>,ÂÖøÍI‘ryìÌ÷`0H¨ŒyX Žƒ-|' ð†¹ Çn¢ÁŽôˆ<´QЛIêäGUU‘Aâ!r,¹¬A6ª,\ÿ\¨š ëòœ Ì.U2Ïap£¾¶(j’‡®  m0—Xùð‚^áVS…¯S¸¶E d±Ç³+&×]£§5þ”Õ—Ãu(M¬lÿ³sf#j.Ñ$ËÝäFvBéý| €*d¡¦/hÜA…6ëòó¢úµ¿¸Ez;ô^´ö\¼T²†óǹlõû+PàZ†6Ð/–ÕÊ`×Ö?i=HFœ¡¯TT ñÉbDéwppœ«éH†Ú#TçStž ŸNu¾Ép„’ö7—6]ެh:Œ]=n×^ÅJN°ý”ã)~ –çÅ\‰AA˜âT–T•Ý(+ ½‘«T“®Rá¡‹8VñjaeÖkµ²€Èƒæ(0ÓnαÍe‚mùÈO½‹Í³Ivè#œ¢ÈXÝër7"a`¬ˆØÜ»|Hë‹®62Ú¼Œb3|rBŠT¤•ž5,è7¤‰WÔ2P… ŠXnó&ü‚Oíc[SoiÞ&R@ ’YB1¡3¨¬è.°l­X³G[džËV§Uqëg,Ñ4CÏ\’¨5€CÅPùM˜é•ºæHó¬[„I#ØÍ»»8 Rï[+aK_¢ëLQ×ùu0œ­²¯Å¾¢¶cjCóâA«#ac ð¹|€'µí£y!÷»hT«¨‡ýí.}O âT‰ðͽ"œ´{»®£S…ÍiúR¤Êî5¥×;…Þ¬ªõpi{…0|t¹²•Fâ'Š]>X¤/Vm"! †q³Àó3T¿¿h©â÷lßÇea™äIµÄû¬­s'Uè)oqè]Ö.ñ®pJ%-$Ùݰót,YAŇ³f©ÑH$Ü Eà—Yßà#Ÿ÷xžß|W9U~ø <|¤ œãL¨V/«P¼TÑdæ”Ç4úƒLŠÜ¾×ÊûŸóÃËò½gåáy~i‘Ÿ)»×ôÁ~"\”‡ßµÒ6c†£¥†z‘Ý8HK¡Øç¥Ám̦¨ËÜ©|ÿ–_ÖÑ^K"¾_·D, ø¿‹Åbñy~z»4-ÇÏ¿)oÁRétèùýÃ*<^?«žâúS@xK¶5mŸ³\`²…Â]2ÿ úR[¥¡f µ2jÅLµVpZ>ž5%ó~Em ly) ÑCöa–¿²ü‰Y²a˜aùûßå•yö¯ÕV”…ã–žÚR‘’–¶„óƒ†pÊ Äm–7$Nà×gð ®©<ÁÏn ¯<¹ðÛäÕI~ÿYy7?ü¸<<ý¡JþŠmçWnG6^8Ø‹özÕ²iéî­,ÅZáV‘à6e?ƒ!𝰠ì€WƒJ*Å\£®‘"Còc¿¬Ë©“CN^ sUYåCƇ$ú¥ÿœASŒè+ÀâòLÈÇw¿Þçª'lCÖrbS®^èC&tbqYàc1¼~Ëõ*¯.0íÊÛ#妑Iݬ2)z¸+®Ïà•€‚f@Ø©—õÙ™‚5F-* áO:ÃŒÄLÌúæÁ ’ƒ—Àx º™¢™¨d)MFâÓÜSî‡ñòÎõÑ/K­¹¦ãås%f\Ë´‹|†¤ÊËÙ‘dlcÊù^!QWȳ®p;+ݨ0–½F€ù€E¹•ÄJ ª"W H72\%§3h ëã+]%álždÕÄ|Þ*—´äzƒ¥êLÓÄaÔåº.‘ïØìeVw#ô}U IlÅ›¶‘ µ)Äó¸xpJf<Œ£ÞµNvðÌ{¥;ª¯oÃBÓÀ!1¼‰’ÙVZæMÀ‰”çNÏȧÞ# †&–ãx#iŽ¡Bã_é,:ÝÊ‘ŒRåϹ·uV›ýü:¶‘ ,‰|hY-õÁŠ…\˜a‡‰‚o†•|܉“4À˜f‡˜z닸¦¢Wãúi«æÃÅYjP‰Öîš>»¼ëˆ—@€UÝ6ßQÅ:Q ê Nê6d; Ó ÇÞ:4[àÚý.LΆb¾}‘Ä׌ܮLæ7ª¼IÐWDW4ÌèEü%–’ äBPÙ¯‰Sð”ò¯†ÙB¿s[óøU`5ÎÊ÷Áju²L¤¤[[0€Ðï‚Õ´@•¢«šGÐí\Gýe`5š´.A«½%xM€¬ñõ ÝëÔû4çÿ FSz~ŒÆZ~-í:ØYfÈWÁ~ý ¹VÆ`÷o+cºÛ šBßÉè´ò"(Â[r5†Á)¼œÝ‘ãÜðm@Û¿méú&A¾Â̘é¯}H]¯ÀãmªeÏØî¢u³Ó 8Ü æsÞû(w%GyÉ(YPgeÎÔ!| o !` §Ÿñ‹lš “Ç¢µÍ?éOÕ·½l„ôûnxÑÂ5ÒF?–°>Ò­c÷6ÎYŸgâ£íy«¯Vxë࣊|÷}Ÿè fÕx‡lÉë*²/×G—WðÒ‰éÛ7FLØŽè{Ýaß—´ìü6¹È:뺖–Ýþ-F‘eqQÝÌ›õu@<°oÛ )ÞöT²q¿ñ O¥…ü¥ ‹s¢ùºU׿_×IA×7òåÖyYqx/æE±heÚç/â0K•\a@}uïbu’¢y±JŸY¸}rô¯ôï¿, ž endstream endobj 1021 0 obj 4730 endobj 1025 0 obj <> stream xœ½[ioÇýNøG0`í(Þñô1}Pb]­(8„")Š0/ñ’ùïÓU]ÕU=ÓËKL pµÛÓgÕ«WÇö~Yoj³ÞÀ?úë`í§7Æuë»§kÍúîÚ—5ƒ×é¿­ƒõ¿n@oBS=6£Yßø´›õÞ®wƒ¯]ß8X{·0U»ðáÏV퇿ðÁeÃÆ±n»0rc;ôþ[µô‹•©ÇqðãâIe¯«¥]l@ûÓjÉÞTKg›º1hÂ_žZoB›îø{š‹§°‹WaÖŸ+úð3ÌÔ†>~ñ¬ruÓ8ç/áÉ/ðú8oëqqlè×Ô :˜¿[¼­–]hµvñïʆ7­58`£<Žú½²ñüÎŒúüK3ØÚ¯/]S÷AQ ïÂÄ‹-x9 ›€ Ýb¿Z¶pæf€³¸Å¼ÀËNx íÆ,~ }š! p‹x² /gyŸÕ²wn gZ,qJX„žfËQã%/ÜãT±ñ³ô S·fÄE7Òó=y~wd¦ÍÒšÛ2ÓIz¾)Ïϲ™š°%ÏsiÁ[ï†Åy¶~«–=%© nñUZ÷Š“í§VPgsmƒöŒ nlÔžíX¦8Ö[çFéy5±§¥Ò¯ú§’ÐE}gÙ YoÞÄïǶWÔqQ¨g´•€ôO׉O¾Î$¹dQÚ¾6÷já‰XÃ×+ a¯Ê­Ô(º‡ã‹Ð´NG÷i(²üQI»ç¥á‡dÑÎ ŠdC ´Vîp)Ž2MóÛÏEž¬´Žv¢Jïxž™­öJ“JÆÂe§sÁ‡A‡%^ÉO¼²SZ~[OÏ**“Æ™Hè³ô}PïúªÉTßû0–%>‘C?Œ€5Ð\ËyþNÑàÛ&M &‚an|$|óýÕfóJ_–zÊð÷‹ô6®rc¹füÐ…­z® »W†@è}%Bz,‚xpõ¦ÎKÏç/Ðâ#yûPÓ ÚToêajSD3‚Øb ´*ä,˜ÖaéùW‚è¥DtßÈ(ŸJ»W†q ÜõZ:¼Èš½ûÅÌ ­ŽžwJê@Q›zêæ¯‹ï7Kp<ÕrQÞu~Ú"EŠœnî~“ç¯JÎa#ƒ(“×Eù\ºÒöI&í ®¿¬m<|§tæí_w¼ëðùádÝë•Wæ(…éP¤”ƒ/ÆîV›º²ï™À@J¢ù?¥ÛñÕF~ZÂÝ^I‡œ™²§-býTbΛo¤˜ ]dÏ9C›[+ËŽ,{¬+Œ*ÙÝ_@~§ìµ˜s—–?‰Ê¤J ‹Ù4åÈ‹47–ÓE)e;)ñÐyiwû"§¢×“#—f:+1Z~ø9Ÿ œ¡‚S¿Q¶R ¬‰"¨^²RxŒÂ›Zðu0ùÊŒQöµdç¥AÛ 2?á‚CUå´réJ±bŽ_É 7äi Æâ%vK°#‚”0N…>øæ´Iy–Øx§0~^ýŒav«CÒ•%ÒŸø#¸‡l¤×9-¢˜­=’PúVq5~/*¨ÿ! µýذ¶÷j+9Ì|”ÌžGßÔø! ¯‹+¢F²Ê΋1:;íëLâµæ»`º,*u)He¯Ê&/„Tk¹¯¢ŒÝ\þóÈ< c²­©ðòæ®ûizþ»<—„çÒø¶þ7©ñ©„5”ty™oL³oºcjS‹ºTÄÿy&w˜!Oƒ€~ož×”°$õ/¥Ýbšì\«­‹Ê‹ØÝ)z³O7™Øëç Åv,¸•iÕDœ·‚ÃOÕ4›%AK£r9…Ê.xÝ9µ `_… Æ×mx¢…Èd3N¢»³™d‹Õ“’g¡¸ÅÛ¥˜d§ßžbÊšLÅWJ§ÚžÊº‹ì¨¥p·µ2/ᔎ”ë„Íì®Ê˜•ÛnÓ¬zÎÌqŸµ"àÖÔJ™ ²èHŠß(¤:‚ŽøóŽŸÐ“1Öýé~&ü«)ô^®Lä˜:(„ºßBÙõíòVtû:L^Þ›Ao’‹ª½#+–Ó]“öÀ‚w)rä_’Â%¦~ÝøÚùÎâUÛ4 û¶Gæ2uÛû  &¾kû0­[ÓŒ=?máÝÒAkxæ}H$*×Ö5±NWž¼[<ƒÍ„ ‰ñ,ûøÎ 6œÊÖ·#|inë¾3#¦ª@Aw-16BÄ9Ðæ.Ìîj3´ñ«SçM ?œ£išj ¦z×ñT°æw2H=ß Ï]Ø oÉ85äÝžöƒI¤ù¥¯ýT©þWåZ ת€œâGÛ9Ãr[€?aEè 7§Lƒ>ÀYfÝh²¥ †^aÏmî]Ðn,µÈmÖ„Á‘{Ã`ÜgÃä¥\ ƒ«`0‡‰‰q¼$5´ÅUð~˜“Ÿy3R8Ö-úÓˆËã¹èMâ‰6 û>ÖO|<(¼Ù&a|LÒƒÈ—Š™›qâcü®ËÁEË·èP¶0÷nøÃ$9–ŰÑ>l!#*‹wC÷ØÎ*¡‹Ï€LBSß[¯íÑEЂ?µhÖðh.¤ÌNGÒ?EŒckðnÜ’N‘ ðbÏfœ»Åê\ÈÝ&™¢H±¸‰å-eŠRܪ<îÿ;-Ö`8±ˆËŠ®•‘Ð%ª=Ž ûX8ûv*X:‡‰?¦“ª';4< Áõ˜9˜øX°,ƒÆ¿ÂµE\4’ÉðNVN³ Íã†Þ iÂM á ýw" Bìc=ê wX#&K´ˆÚAwèØ®­Uú`8‡7Å&—-'&é:RŽ t:±6¼š‰šDµjÁh¤sàm'(GàÅÓæu‚¼÷Éú“}°–÷'ð!Ø»x5õYØ ö¸UEX¢~x&ÀUœ\“"l•ù Ö%Ž8dý¥åüDóÐ+Ã^è×ÎlSá)¸0Ä“n£*]ä¦t}3êƒÌÀçÉ” kºÈD9ÖB„b:£ØË{{¸þ‰î±±=柉šÑtéøÍ ŽCSQ狪Œ$fÑ„#ÊVÁäÕyJ­U4ΫpSç²I_WLpñ¤9Ãm$I+—D,N’HŒ½À(ŸÉAÜ56BÓ2»wÚ›lfЃÎF MUŠŽÚ¹\Z>–±§„ß•˜ËÎWAŸÀGG^=Ã'¸¹ï*å O¤ª0ò}Ê_³~ÕÞŽX b…âñö*›SDtÇý«œ#±-\D…-ÀwÀ àÂIâ«hÃöΟêý¢r‘VÁº‡¾æ cü~à?a*¸.„©Ý`Iï$ºI;‹Ž0ÅmÞ]õ1鎕£IdáWÄt?&—< FåUôî¢/EЛéú‘QÇÀ¤]¿ˆ¿0 ]Á®ÑÑL%àpÇCÈ ¬/º¿ŒÒޱC~¸ºUˆVb!ÎI6‚ЍòNnôèÆE„ˆÒ7ž¢oÅ9ýˆ:?d¥¢ý¤Æ¶ ˆ™ˆœr^b…B~0¢…ÎmS*&0 ÍjÄ­ ¡¾™ÓPßD/ Cöñ/*š2Uï÷\9Î!º‰`jk똶=mFÂÍCÉtÊ`@¹Ý!Lø¾J«@q{DÉëîsÁ)ÒâÉsþJ[ãïê¸h’w¹¨ò«¬ ƒo‘Ƚ¤L ¢Ú ¨ ðŒ°n= ;Ïö=¬Þèk¼6%4žÈŽ]ôäÅK¾U¹CæhÖì#†wåˆYùrŒÉMWf—«’MÈ7Ô)Ç• ¨ÇI–xäàÿ)`ŠÈùæ$E¦në=¹¨b4k e-ìø¡ŠŸ§ý¼ý?Ñ¿9| :—–~¼£PQ¦é§U„¼ ¡êêä/§)¢í§…yzhCÜ:_‘†)Ä¿ªÜ$âg¨;¯s5(ò™¯ËØvÙÞP£–)ê)Ÿ¥ULÄЖôlRžVWås¸t4AÅ—„G•«©\Áö}ÒKæÙ@Q9 ÍŠŸ],¥˜(”<).N–KaN˜"²x‹®ÍTã'špm,òÊYtáÏ\í®ëÑÚRøOËp°‹u¢ÍIyne‡TpÛÔÉ$;¯i´ƒRª7é .DVÚw‹Ÿª6ûžð‹büõ.•¾¥Ñ®mîÈØ CÆC·rÉË&Rß«®)|Bå´7D¨WÄò\Všÿ¤GÄŽÖåÚm¸T‰An7ÜÊ‘9õ¸Uù’î q¿Dœ„¬¾G±žO²{V%­’%sm¤£+Ù Ä·²ÆÙz.ìvS ñºm¼ÒŇm#kœ©J€™º7ç¹S;åFÀCvcL:ˆDú”*Ъøû\Gá¶Óz~ ¶-£T¼3[3n+œØàIú(ûuò–xn´cFVª 0­+a ÐnŒŽq¸0èb(«æd…œ NñË7Ô*GÀzådªÍÈÜFÙž‹´8·=]=Ê¥aMu.*’\p¸¤tÆ*tÿbí~©Ü|w×txIÍ/–Ê©òFÎ*wIá¶­»ašïûA¬‘·2Ùð5œ§kÿ ÿþ /µêSendstream endobj 1026 0 obj 3819 endobj 1030 0 obj <> stream xœ½\koÇuþ®êG°N¿ëú]ï\öV8FäÆvܪrb3h;(‘"…P$eRŠTýís3»³$%…Ak9»s;ç™s¾:èZwÐÁüï³—>ûÞ…áàôúAwpúàÕ‡¯øŸg/¾<„O¦šÚ¹›ÝÁáóÔÙŒþ`˜bëüÁáË?î\ÓïºôÓ6Ÿ>ï§Îµëwß7ÁµóÜî»ÆOí<õ~÷_Í>„±íºq÷uvß6{¿{ÜLCj™v‡Í>¦ï›½£—OÒØß@§ Çü¡Ù»?‹ôŒ>Åy÷oпNc¦‘÷ÅöGÍÜ¥®ž‡ÇßÁÓ“†ûÿõðßaËÑÙ-Ç޵Ôv}xÌ;é'4=Æ—ú÷½‡¯÷üù>tíèæYzíá»®€Né¹›S‡è‘ºv £ûâûLŸL~ Ù¹Û%Òø]%OÒò»iŒqwÑøvµiˆ~÷sÚe;úèÝî(‘d‡.îΧ®í'—ÈÈ]ÞÁ€Óä&¤>SZÓM"O;ÄyŽÜ;Ìóî­~Y¥—ZŸpøøÁá'?­Ï€Y'iÖ8!ÇÓªúÝe“øXø{z3ŒÈù‡ðåybõMÅIéÓ©áÞœ¦/û°„/ß:®à~M×ÀVütºL¬º€ÑêÒ&ž5°nšq§éžF^ ,iX~¿â Oa®´<Â6Ë{hš~{x#$²%¢Á̰˜—À¶4Ç•l•w†˜à‰;<Ÿ4@b?‡6¡‹¨áÝB·y¦­>‡_{$üze÷aqqÈ ¾id%†RÐy½x{”ç´™&ìŽmiƒ@™0š¿>¶ëåHOÇø™~Ã/@x¿ÛËâ€{¦ÀÞ¥úy"B “&Ĭ„»´Ú[ðÕ§ y~Üý-¡iõÀò÷ÆÃ^†>¯8-.º€|~Óô I(Þ¼&äÆ<¤Stà¾bçe#8¤v2œ¾àÏÒ ÇðЍÏ:ÊÓ›¶>¯û‚?pÄ_;T˜'d”v—ã;êf…ÌÄaaÁ/_!­-vNöP¶ \K"sž@DË^¾ÍcÁÑfæý€;L-SÀóó(QáKeícÓ±K´w“``ø`Иߖx,N4Ã$)™!ã'»š³ÜOCÉNHCçiÃï#IˆU.‘=á…2›±˜^Sß 1ã‘7 ÕKxŒ( I©”>ðpVbP|d1F}¹Ã°Dn’¾ÈØaäGP[síÈcœ'Ñ/†¾"¥£'³¬‰¾CYc€GxšZ7(ž  €?Íòdä¤$œ¯BÄÙna§° °ßiQÒžðrBKƒé&¡ÿ×s(Ì»ˆØ´˜" ÚZ 8ƒ–)ˆ‡¼ì™$1­8"Új' ØVÑ‹! ‰ªWÎÉ ‚ õ凌f8à „cs¨°Ó`;nn“‰2ˆªþº™‘ÆBo<@þ„«·ÆþÖ^/ à]×ß±ÆKƒÉÊj„kmkÐ@jˆT£CŽë @Œ±+þÔe•KxòÙJrBã¦X Œ'Ž q³öŠÕAÖ è§©FÐ]ŠG_k‚ЊIX²þ¡Â“˜#² ©„¤µý º^LCV†0~œñ‘™cÕ0oº¿Ýݤ"bòÙm€$•šñG²d1[ƒŒX;OEë¡êO‹dùVˆ¡·ÐcÚ}œFý1ýüÚÃÆ˜frx3¡¹µ€| {š ¼ mükú†%ÌMk*­á™$,½!Ù9*9WúHöSÇ›è¦lS‰’è\MX?fW·"g Þ6.ÏÞykã&òµ°ßÒ–+&3Q—¸f+v_âË[X›Ø­GS€¢øžT`ùFÌ(M>.·  ¶³oûà"J_øUa'v·ëÔæv+=ȶ &Ð$ÍJþË#ñ:˜À‰s[Sr[`­¾ž²£†D„¬„µ)«d–ŸŠmP)n”³”QÎCÀN6„Î ZÎôÑxn=aÿiÓ/÷cÔ~‰Á3ø†|)Ï@pl£‰@çS1x³n¾t sgȧ@TCá€ñ{ÒÄ?íÒ 8ÖŸ¥ážjȹÝ_UÃG§oÁ¢ý’MÐ-œz4Çoq¤‚À=:Yë©¶T,C“áù%O2“[u¼˜¸âÆšÇVc;Œ³`=3;É5­4­ºÐ~¡ãÀ†ÒY'tÔ–€ô°‰³—Õ쓱Ãå?€A PÌë¥Gx_Ww¦žÞXxzÖÉ;Ê|VU¥|ÏFºBOÅÙ+Ñ®î©RŽÄp¡«Œ*â&‰ rz|”ñ DDh£wI"×;r˜¬~¸DwðcNÕ 9t1€e`'¿$™»˜Àë¬_°£™ >Ïæa­}Šc´^‘JOÕ^{Wè(Þf©¢^Ž^Ë!ÁËï}–³'gòêñE:m*qŠÐƈ[îIŽèËehLÂO Œ"GÚÄ׋¤ÈJ'ðœ…hK8š ¢)AÖ“„Ë"nE›ìÛ«BÀÒË•P8ÓXÄ8X=µZHÕ€kªRßÅѯøy>/5@Z㊇¹(´[y̸¿Òß K}Æ*AœÜšVÔ@Å8,4–²ú…1ZŽ ?Ž@²”«F—3Gù!”mJñš©È&ä=Ã\u9¤oMªQUÜ ³›,#+Í×™ˆ¬ƒ]¶ˆB"±ÚÚKï¦}­ö· îò¤,9ohSàæY¿fìÑyŸg£ä7ÆLY¼š$dŽÜâCf_«®'ÑíªZÝ•(ë¸ nÜ#(&pBëv¢Ì šÅ.ƒám<•×Ò%)ŠRCg¨ÒïP®d¯˜ ¬¢¦¶L„<ˆ`üj8x å³ÌQÍû Î¬±µq»…vGÀ7¶SÜèÉ#XXmYÃYù§bT( v[U†6[´‚OB44d÷· °…]šÞÌ"_ñöÐmx4U¬ëëO1Б$¼¬¸{N‡D9<ª:Wé1 iÓ‘šåðsïms§*/sW‚>._Å&ª¾>‹­XXÉ>õäÖ¢waÐé2¥øªÂaFûñË[º†E¬–JòÂJrÔ·nh£‚ÑxQ„7%L]¸é%—!ŸMÚÀ"¦Ý—#ÊÎÌ&ËhB‰µºÒYÁ™• ÝU–‰K¦8å¿Ê(ø•Þ¤†^í›HR­ÐÏ„^} k Mð—ôó­¤ vžƒ¤’¿+"m¢ø‡¤Žž¬ ?QìIý>"s ØL0¤c¦^Ô–ŸÍ÷ÈÝ¥¥ÝeÙa eá{6çn™õ±UçPy›þ*¯L¢û~îEЦú-cL˜u(ò6á!ûâá1áaKHª`–£ž l‘rŽ qƒ.í÷B¹  ìçºy‹_©¹M9‘˜9ç`ly›ÒÀD€j=ÿë´ó=‚_…Ö ã”eÀ™ø l‚¸E8×JòÊñ<#oÏÍ”¾pêA¢„Ë)i^F`‘+ pè­Ë™k2D…1W—¸ˆÕ¢„ÒÍ{Æd›BÕ ×Ú†á.]¨‰Ÿ¹l\¹™çl@6óÎß>‰j´° —¯Aæ{ãjtÕ¯Q`a‡,‚‹ˆ Ÿ¨Èk9LòŸº’š4e’âÌé—ʪ_sÔd2~•QV›@Ø 6&"€À†¤ÚljÁjZâ–š4AÆ`Ã92Y¦að¸J ”s÷ñ «¯KÓ~{ƒ¢jš­¨Òè'/ÎD?ÅHžlŒUX,F†¸y¡×Ò„Ž Ëô=oʆvD!V 2Í‘0‡Î«•Üw$gƒj…UP¬’ "'âXÖ,“íïáácÊ&»»Æ }·(Ë!m#¬iÊ^žFÙ´Ômcaã{(/nü˜ m<î¶Õ\ºx{ž)¶˜C±e´jZEaíÿĨ²]”2ˆåà L ¡e쑊ò¸†R0)bÁL>>2ä"¯ØueØ`A˜¢мp @ØÛE•@†q(J “Ä|®¥¢e¡dߪߥbJËJ#ªx9½{°óúW©¨9(6*†ŠÚ4S>TdˆæJ¾spº#VÀ_IŒe&»îþØ'œp ðØ ÞuZ»÷É%qË0j!h(ã(ÉU–kÙYd‘1•VÄ 8ÛZ^>T$Œ•-¥ Ùœ÷-CÂe±ÍÙ/ÄÚ0{*¥Ï(¾I:ÞXû|‘7b‹e†œ“”ä/zv«:B h 9ó5rCàÀÍÍ… ǘ5²RrkÞ[›ŒâLS¨E\¹Z$‡J-|üL¡Æj2¡Þ ˆÄ²ÐP¸qe‡dÒÀÕ² Fù,yi Õˆˆï¦Òx)&²¨'«ßiƒ°n…j\T×,JË0䕩ȯѳZ˜Vx¬šhKEù¾<ù+K€•ëý“àe¦QÜŽÑO=Ü10Ù ã¬ØÅìäLr\Zåk)Ÿ"$iM„HqTpúÿÜpmàcƒ‹©Åk5–Ö—èÚíý(æÖªzSª +é3S¦m—Âün,JÛXK¿wÚam²{»BööŠ$d•Qí!·vÒĨ‹CÕn“œlLÉtXiý~­£rQ…GáàŽœ}%b.ÑMãHŠÁAõ2ŠÑ:Ë_H…¸ûW:$É®qsi)µ3Ü’ë2N¯Ë|$®+dÖQ„çZù€Ò>‰#– ì×é×¾£ ÆV;~•iÿ'm„/1O8î~«éÉu ›g\F+™'[˜B7y¢m|Ud™ó²¥ñ\?‚Ùάó¢4Öu®ÃH <Êû'ùñ«|£ÍËÿçüÁoõË~E[QÙïGJT$âµÎ{ œXÞïQÕS€Ò]øÁg>à87›|xœ×tXãÃçiù=ƺ õÏkD¹ÎºNt3²ÔÈ%Rò~֘м4¾ÒÆ»™ç; ˜ÍU×YgÞ㻘÷yÁ<$SZ?_²”g†¥`1¢€3«9RöœðÛ8O¬ê·9œ5{Oogï7w°÷‹{Os§ŸkLÉ컩x±‡ÿ'îã”ÅÞOïÏýoîâþ–ûM5”`0ðEÒ.LQÄÁ¥âà#pç^k~Såæwy¦ïkÜü‡6þ£&4 é2šŽscúr S,ÏÐ]Z9ëÞôÑJ,A_vs3šq¿É­¿Yž¡•X¼Ð£rZ9C/”ˆL^ßã],"ï…¾¾)È—×ÏF”§‡•Õ Ôá4 «”¾ÒƫڱºÌoíšä}ˆ"ûi—[=Wü´Ï¯ÇÜ©)€à’×v~÷¿òA5ȱ¯› O) Œ\{Fq./ãcfuaF£çÖyÓ;4Ð"[¹‘ó_"ý69%þyIF†Áiröc޲¹v˽=)üÒñÿ¬±©'’”„8;D(©Ìf#´/ÅáÁ[~]µ€ ¦¹Y–” s(ÏHc²ï9tºØd¼G…ˆ”?_–.ÎV‘òÒ/ÂGÆZ/*¦o)`R”fö¢òv­^c˜HfO—@$üT¢äE±ï1}%È$â É»Âù6Ìø[C×§¾Ù2„«ÂûžN½² g rKbˆ+RS7n\¾»j!sYnR©KWÔš†¾Hx>2RÚqšpÇœ‘502×¼MLV/^m»zJ'´†Ûà‡€ˆàã'«ù‹Ö¡«H‘¬pÐp‘kœ^Y°uW@#úQÏwûü­wð·}úÊýy¼¼íD*ÚcÔÒyÃ=/¥Ç”Mí6"¯Å\Aª¦nm ®¨{Мíx—g+Úϸ·%‹ë¼è»|ÍòÑ™Ë~ºb-¶v[Î êmº¤7£u›ÀÌÅ¥û…̪¥ª7°€£&¡~I}sÇ”ó»KF³´të J÷c©°×b© £ïr¹™=«*½©zÚ˜˜¹MñDG+¬Uìî}˜äXK D˜QÄZЏºÓ/@ äz¾7}/DŒ¾íb10{øÈ0æ0ç­ô\³ºº èûÚß½ðT q½ìCÒóœùÝªÇ ”í®›[ÂfþFdÍy0%ðÅJU7-û+BÕü|m¾¨–È•Ÿ¡/ɃIØUòùÒn«ul´u•Ä—iÁº7ürÈvÈ•€ í#ß'zD©­l8èýÅsNøÝëÏ,óiL¾åañ€·êQÜü‹mœœÃëê5¿ÕRò\óãÇtw×”žÈ_±¨Fеèšþ¶€3Kµ¦È6€å¯ü²?v"Öm´¢¦_’ÿ•‘³¬™‹<Ä¥Þ©O?.D„åK3'Ðíçÿa1§f›©0À%à5#‰k›ÂÞ +1 qc²N£™ª‘'HÐíƒG3¦äH@µÃ:ÂORÒ*Úº˜ÍWf›sñ‘Tv3ÓK'ÀÈ‘4mv©Iߘ,…?ð”&’ÖO-ªÌ´Qù¬ß9ÓÐ-gj7BäIÄ ”àóš !ŽåB±íÀDïáv¯Ûý <ö \7Gÿiṉ‹ŸkAµgúd¢s/j‡"¤(ëÉÁ Áô‹0æKæÁ„ò&¯äýúLisS’¥ŒÒtØ}²"Æqmoj×»]Ç!êF ÂŽf·e2Ä[¬ßD3s|ÇD‚ª <±·1󨆊£g^'§40¹åËO0<ìþ»NÜ> stream xœÕ\io$9rýÞöÇ0\¹îªMy­±XŒ½ë ëÁxF°ÇØõµÔ­,©Ô:fºýëÍ8ÌdªJš…c0êR&“IF<¾xdéÓI»s'-üÇÿžß¼ùåw.ô'—oÚ“Ë7ŸÞ8¼}ÂÿœßœüÝ)4‰.]ÚMíäNN?¼¡‡ÝÉàOú1îœ?9½yó‡kºM¤ÿÿëô_à±1MÓ®ëÓ“§©õß7Û¸ù§Æí¦iŒÓæëÆo¾m¶~s ××låÆwÍ6øv׺ˆ/hÓÿ»t×G—®Ù†?h_Ò…ß|“zýmÿüzêR›¸ù‡&ìÚ6„¸ùg¸ó{ø‘Ú„èwÓ8ác0 Õfp3@ÿýæûfÛ§«Þoþ³ñéCç>pÚŒŸú¡ñ4ÿà&;ÿ­ú]O¶¡Ý Éd‡¯RÏ›øq?nÓÔ©s›÷ðkº;?ÁTôNjèaªcošÿq“¯~ÎW›tµw-¾†.=ævgzñ6_¼´#X¾çQ?ÁØÆ®O-f}š‡àc ã|tò‡GŸÁd.$€´ N¿sú 6 Œqs?ΛmHhGø6ûÂr: –‹nðfŽ÷ù½çzñ<_ÜëÅ3Â^-­êZß«šißÛÎiÄÃ!ïS£ËÃf-;5ƒ³š^-ì.ׯëvÞØz­[àƒ¯=²ÅCã!‹ÂߟÊâµ–Ùâ—ùâûÚ0 œwC×åg|ôõ5ñ%|ûìJIû?¾À»Ò/èÅwºN®•aÒhã4&FéçË(uèÛXθkŸÇ1üqÍ]ÅpÛÑ},fËïj^0¦}gÇÁŸ® ÐgÇӬ⡥†Ä0E¦Ôõå.šÍóÿÊ/³gürÔ¯ñ‹±v¶ñS­÷ \\f {^mÉèU*«2Aö³1ê³kÇ|‡’Ì««Ñµ£N9rùø”Ýg:¸xÖ“¸W8ñ^}õT†0G;!×\h›ŸØkyªºä•3±tçC àû¦²3Ý­}×uñç89Ïõ.;¹êùÃþ }ßÛ@kr•íý굆ëês¹ÖöjçY”ºÒµu]Ž1 „ŒNóâ»# >SYÛŸj_[² îkŽÏ®3qÃS?ÌøìÓ"RÍÂÓ m|«f{´Óáå!öDkGbµ½¨ÅÀumR—/7nU´Ýä‹7µ÷ÜfãGzQï§,Z.EÓT,êòÕö¥“än ÓXÈݵÜEiçka ÕÝqŒé]J)¦)lþŠ/Ä1k¨R@Uw]ÔŒr“ö—ù5ЦfλÚÅ·zÑ­´´^Έöíò;?t%B_Tt³tEÝþ‹t#ù Dö‰š£ßü£6T§èÊ·,#Üu\NfaW#øÅh— ߺ:þ¹Þþ¶vÿÊNr© ÷µa¢Ü‘[¾3ïêêùˆÌæF½’‡v¥7žô“YW7¶aÝþK¶2êýKéŸ2 ßÔüó¹fjÓòÉ^\fá7Uû~>h³ṙôÐya°9Ciˆ ëþÈX”íÃÂÚ¢l³ »ŸÛ7,Ùýhùcàšü§šaÔ<®jn»Î¹ÇE­eVvjã¨jãÛš9Þ[¯›t§"¬>UWU1(ðjˆ¶&÷á¥ËkËÏo•Jµ¤…o¶…)3Ê¢l«¿^—<*UœàZ\Ž9üMÍ뿪,¼emcVÁ˜áö>+˜ÖÜVo-PžÅ&f'¾+]-®U!iÒaCïÕáj”sÑTpœQõ™jïþèÞsKÀFì"®s3zÓkÖ]×¹NSä’T\Xë P}¿ë¼Õ°û*üÍLJUJÛr§ôfžzg=ÆN¿/‚IָΡçˆ Ï¾¨ºû¡fû»ÚÅÛÒö〉d•ö2…Ý×FRBTDÀCÍáÊ{¦$587ËL è‰kžm0×q¦ñÛzãÒÑ‹Œ­Ow¡¿õ‰¿´iØW—&qm&”€]/àÆUã77´Åm“îOcçÑÆa@…ŒwÏš »®éù}º ²Ív4?ÁÝ›ÆCá7Ûam¡ßðÛ‚&’`sè<™s:_wÀ}°i1ÒPxÄéZ öN'ºopØn‚xMà`áÍø!‘kŒãrfvN¸JUGY¤Éc¼Á¸îcëtð"`8ˆÙ¼GnõF—'q™>$Àb/‚öiÒˆ¡¯¶ñÙï±±T€C€ïˆ ·ó§FÃzrÝ2/:×Þó{ÐÈ}F_[²BÉ*Ù_0å5x:7Ô§ýÏãÆûŒEp: J–Dw”¢Ì0”î"c2½ uq*ßE‚äd¡C_[7ãµ4BØ„ûÛÿ4öëp0ÌÒ?|ö:ÿ!ïäí]$´qçºI vKïåAöÿ¢6¶Hïlïf¬l#ͼ„8¥¤ä²'^üž~: ¤€Ãèí'{>·É¯,æÈ,nþ‡AÆ\Ã׃‰p›Ç!Oàãkå*¾í[‹}{‰HÜ©²2’ø¸ 4¥ÐT\ÔæY°kú%¦g³çÒzˆm\¬ÃEáâ2åÉFÒ:¸HQ, ­’õŸ€=<ë3UÑÌL”¢Àß6XçñŽ÷ªñL\B{8Æùqz8~òˆƒŸ$ìr'dbð¾ZŽÝ=}P +b G­4D¤„X?¶8ø8x|#ô¼—5E]AœÔ—Á§ µŠÍçvLY~çG'(ûZveÎQ Yø4–Üz@æyN›‚ûÑ&ÜF¬k?³üöcЖ^=0f1Ã@!¾ÙR 4˜·=)ÔÖÌÈ=@‡LW4k@XŒBWläãŠ[GëVõ(SfÍ'È<3Ú¦ «H‚(ó4ƒª6 ï;MYŠðuŦ’pøcÓøÐk\{’`h GH»>ïà6¶y$¥ jÍ’(¥‡¾Ëâ‹"?Ä]? šô‰'u¼‚nIïÁ¼VǦŠL']4hˆÙÉV…Œªìuˆ¶%ö)lñp·nÚÕÛÿÑD™"IÖã8À•2u?Ñ2>È6•œ¹I«‘òØTC)äqQšK§1aÉÀmFŽ°Ì™|Œ¸Â–¬ÄÑ=8þò&Ý0ï3‹axZ:ÆôN©í SLzÂ+Å(ùfD«<¸æøÙÒÏÞü¨K\O,‡Ï!LudÀ'_,Чo"«GŒŒ˜õ5ýÏTB³+ƒ•Òöâ¢Q@9,ÂŒ€.uÀ¡(…cìÊAjÌ*Ù"¢årìÞM.Oî„àߙұq„ý4)'z'k`Æ eÏB Æaš–Çsm°&‘õëÉ+rÉ4ìúL%é¡zFÜ;’%¯ 'ÛÙÚs O B½àY ã°ë,üå¢(´B¨,E^ßÊû9É‘» …ìÆèZà„Ø:Ž ¥ãT쇨áLáVn÷Dd gùà£xB—2@|OO3Õ™RÍÓøPÖ“wÒÇU“— gÛÐÁÄ 1ÃctÄ“3žâõÑ1öÙ.#»™Ôv,JyÝbÖïX’}Z67îJ¯îÙìÓ<]Ø+½é ƒ‚H°G®„Áö`Šrkˆe~!¹O±A#bio Q|­HÛé=Ñ¿¢<)xé1×´ä ½à,—i‹°K0vq,*¢& ‡8š0üŠÊ(ö ! Nsç žË ‘*ù:NoŠl!\Šváµ\þèR" Bœá‘\;›‘Ï%½Iª1j²`n̸í‡d9›€hiU÷©aTµä®´Jî“£91?,Ç¢yÎj¡`‰fúpÓ„v!·~ÙTMyÁd«ìÔˆ{éΟ^Ê`ñåf¸Vd8ãJäm³Ôñº.Ã<ÄTh¡z›¸gsN ¦JÉ} xZón+1¶º;qΪɈEb,xû£k’m,·—´XF­–ÍÃÔ ªðôu­.ÅÄœ¸Ìñý\gÑ6‘ðÀ‰¾…q.³´Û ªîl$õ< ª|¢ëIÕo¦ö¸(}ÀØûb)ù@cha‹>žmz‘®4‘³uSu»)œF.:iPθ3&º ›Ž“»f)ôr¼³`[Ï%¥¡t~žEú® ˜ÝüÔDm#1¨jkw³aWäœ7ÊŠZÄï/Ø1ð#”Dìå( Aò#ØFÑi¹FÑ¿šrz*b<[ðªT5ðGÛÀß4Åf޼åMtÇ·qVqE3-I @£ñ*oÕäòû8¨NñN¾)g”í´ÂÆAÐÄW”ä¹ Ö¤JÚ£ŠXx‘œ \x’8l’ÁÕúÚô!ô0Nàm¡b(~é“e o97 3yð-gˆãÏÉèXJ.ÓW“œf:¯ëÖæÀKq8§ô5Ø‚Ðþ\×""Æ<…Ù¶¨8©@™’Ûó0$#ü½›e‰¯«ŒCq"éõMyÖŒ ñ¤Ÿ0*}M¡îPÅÌY¬ið½Æ‡ñ«ƒ£P¿4¢ÍHƒÏð‘ØQö4 •$â&Þ Ò>ríPTÙ=qd‹N¿Ð^µ1õÕ mÔQºÀ>9¤Éd–%}iMœz§%¨GRé=pk4…Ò¬;ˆŸ0vºa¤9áôŒ¬qK÷™áØ/nMYÞß™ðÓè»x>‹Ø{ÝÈu³ÊæjÄSŽ$$v¬Ø¸Š]¯g’ Œ’1tGWœVæ·þ¼"¶êYêÚ‰ {0&dý:3Ò¯IˆBäüL†hÊá,ï,Êi×Öœ—MqÊvÏ{!|ÉSÈ«¯aIèVi-Ú"ÀóçöÔ+ž4Yg˜D÷ƒ|uSCO¥m›`D[~Ù69Í“£‘·ºŽ)ítOºÏ@ŠX0Æ}ðß@Ÿ X~Õpiš¼%Õõ.QÁäz\MH¤•ìpÀBáÃC? &·ÞÓ26Ðe°WjŽóW „]´w߳ʯÐî{û 6¸½†Eð¯V”Ƴ‰õžË-l…2NŸY†Õ­»A G{:®Å'c 'J–ÒÓvA4á´YAJÛ®*½~œ©C•ð7´p€œõê"£42äh’“}._ØØz.þT ‡.Ÿ…ÄâH 9±®3ù¬9ý¨¤#<§¿GQåâh!¶ÌNy\q-Ò£4„û_q(ÇœW†þéC  ÷át9žÆËïE·µ³!Ð¥r?s­ÓĶŸŸ Aꬦ,Üâ5¸ú¿Ê¾~®Ü‹¨—ø¸×‰µõÓ´˜†»hiXõñgŽa+’žJ…_òíóå»g5@G‰ïY±vLnÔÕNúBMj:T׃ÅYÛÙú‡=]Õ¨Y9,ŸÇcëN6F—X9/RàKu`öj/9Ås½Hrsì_ÎC–/;u²- ØÒDyêvIÂh¬ÊÂ\c,|?'ŽG×ãÒ^„,|(A–ã ›aŒ‘)Jþ±_ ÂeßÓw£ûIPË?€P1ŒxgV£03`yƾ?VÆ7..üîôÍ¿¥ÿþBtiendstream endobj 1036 0 obj 5176 endobj 1040 0 obj <> stream xœµ[mo·îçƒÄÁýÐÛ·^¾ír[…Ø­ ÇI)…-ù%ˆdÙ²ä—_Î9ÜåÉvÂuârIÎpøÌÌ3¼7Û¡7Ûþñïã³ÍíÇÆÛo7ÃöÅæÍÆàã-ÿ:>ÛÞ=‚.Ñ¥¦~f³=z¾¡—Ív²Û1úÞØíÑÙæ—éÂnH?}gñ³ÁÏû8˜~0a÷¸s¦Ÿggvßu6ös v÷s·wnê‡aÚÝïÜîA··»‡]SKÜu{¿»M»½¡‡Ò؇—"Žùc·wßÃÔF~Þ} ïaï4fÉð»Ø~§›‡ôªåáñÁwðéQÇïÿûèŸ ²7ZdL?Æ$õÑ KêÓOèôÞóÓ½úÉÌ3uz’–‡ÝëôkF ÏÓoa¾ß’—²4øž¼‚~iÂ8îžÊ+ãîYçw;—»Œ»“ôpšÓR=Œ±{ mÏp*P.¾û3¾÷ƒÂ<)ìüm±{^ƒ/«ñ«‡Õ$`Or‹n’ÄawÜ©÷ _Z‡pãAxÙ£+1É ;m­~R ÚAq^¤ÙCD»xßÒÝú˜wúâO­Òb’iÀMú©+Ûó=¼âP3´PÏ„ËI¦Cú`flœü„·‚zçý0ilz1†ÝYú˜ž;çS÷dásœBÚÈ4Xû¼ØbØhJ,ÖÞ¸>Œƒ%é`Ie¨ Ö±6Tèà€Å)ï¹sxHàOe*4ëüˆöCÁsÐNÀ Oú—QACÖfæ>­çáæèÏ¿Ðá³ðÖËþÚköÏ»€sb7X({wn$hHCú0â)ÈBÃpiÛ‰ž†=l?%ýº“?ù0 ¾€aG€…_;rÄ]Tö֛Ì"ëô-,Ü¡|ϳ ÏéïÚÞêÿà¯c¶‹ ϳÅé1`n'>ÉÖDR°$C¾.ðÁ^Eìô€o!«²}rÙlUóܶM7“‚´mîI±Ó€ÆXa\P6@Ç#F<Þ ¥c'Ïß§V¶Ê—Ű2Êž&-4Pîqvy3ç —pÀtií×N »Ô3+bð‹ln¨™t?co2š†©±%ÙÑW>N•ÂhïQýE zº#;¡°œ “GC³:—1«EüÊYÿÉž_Ò‹¡‹˜í¤Šo9‘×ÐXˆÿ v“˜d޾Ó,ö˜r~-#ƒZvs6™Å0b€ÅºôêIc»w]Âc0’'Ê¿‰‰ˆ©À¡ÅìÉÉ­àÆ3®ggyŠ[ê"³tø8e>nc´ðÚζ¦œr£)±|´ÕœðѧH¯_µrþ˜òždhx+0¦^Öë2@ÁÒÛ-¡ÕZ«ÒR#]”çç¹1EfaQǹñªÀÚ´4ê*T'q‹©T R¨<§O½¦&;+z{Úœí¢­ÂWÌú8…z铟 ä‚ôDÍxÒ‚Ør›>åYþt°–Žó»Üø¤¼W• &Œ¾Þ·­‰®Z#‘06¢0+‡zH"e9‹ ?«¡ÞV;ºÐ<¼¶ŒÝ·Úš5Ƨ`,º9.Nücaør× ÅëÓ½÷žгÎÎ …„@FlÅòJB¥ù¯V~!Ä4² „"Oc¾¸¼¢d;Ô1)䞸aŽ(1]˜çåê¸àýzhî©«×9ØLjß$uh§pÚ ƒT7y¾èU”x¿K¸ú$\§IY:Sg?Ä^µ-qêó r¨›öçÑÏ…¥X—xo’|IÁ(+ùT¨ A;ü|Ä})!¼r ¯¶NxŽeÊ‹™j;)ȶ`‡*'!² ê œ ÖTòD‰:ö"Xˆw’3ëú,–Ê4šÔ,"Ôºlá³}ÛB,Â, <ÑZ¸XÚTˤèçÖ& …á2utáJË.±&“œ¿a aV)øäˆ¥–J«Dø»Þhêpwðhq±2÷P¦ž¼ŒV’‚W¼)­(Ö@Zo„øfäÜK5?G¨HÌ*€]H¹žàr1cC\Ïèº~mA,Ý$å×ÏYÆËÄ…F\¢X«þfǘaªi(D¢ôeÛb3°Þ+ s•ZØjÔÈmÈâØX冂Š4FÍ Í—ýU¶i¡{¨ŒYó¢°ع¬àÌ'-ÒpëpÊ}•})´SÍDJ¬T,´ÃÓ{G›6o¶Îõ#^HH[·nJqr$Î¥°!mÅñÙæîƒÍíßn//®žmnÿ¼5›Ûÿ€ÿî~ÿuúõà›í6÷l8|ù¡Ž~äòƒ›pmÀ͇|"oæò@ÕŸCF”ÉÛÙÃý‚ÿ»L> }%“%ã<®Ìÿ5Ö±—õ3fÒšÑÓY9ALìõ¹Úcã èH#. TV… ã ÅÁâ*ò/ ¶V68Mu½°X¦q”ÝDÝTj˜ý˜Ê¯Awœ5èßÝ1(ê„ýd‚W©ù9^€Ê2æì Ku°9!¾M>“4 #Ë $•#ñÄí~ÒûNPš™RŽV,˾¸k¡;×ùxÍ §…±ö7Ë,å¡ò}44mM5?z£èÙ$t ¬0¯bF>Y¤®ŸË§[9"!½Ôh¿Š˜Éçu9îÚº³PÞ5🠶û0ñk’ç)Ú«ŠðÕ©½bßà*›™07þ§Eb`ÁhâXô ²ëõ˜¶³E¹®Çl2Ïjö’¦·ÞÊó:ž³¥ÞŸ;_•IíD’'ˆp}«P‰Ñm/÷2 sôϰu"ÃÞX<Бçpè—Vcr”;QJV¥Éª\2ÃúúAÈÑCÌá)|\Uwì8ìîç£ö ÀËQI~dP†™°Ñ즪A©«ìe‘ uPB F9Ñ Ç‚ÇTå³*x·ßÖ×Ô53ˆWÊ0×ø÷únÄ3n'TXDž„®eUÛöt`i"¢#‘È!K›ÕÀ/5/w]&\ÕòÞòcë Oª›rQµºØ’k*uw$,[¥][-uÒ©A¿{áT Y°¥ }@ŒÕžE} ’Ñ,2Ê•ÏC3†ŒBøcªS؈Ûw¯ì\Ïã òþàp“ Cd¨ ÆT iF,NŽ>%†œnHÅCyX¦¬nCºXž¾Ô¶À•‹°¼ Q ¾Ë rP®z0iUåle:¥^íŠ*ÆÊzÎó­†÷ õ(•#]’>«½ »5OC5äQP¹XBä_>0­ø¶ å©&8Yß#uÄ彬°Caa‚@VÖ±<c<\¢I0.k479 zeXpïT ž³ÿ¦˜áTúdé€Ö’h?9Þ—–ëŠìO­äÃf,’«´è)ݪؖêKUp9ì¡&‰ìÈ_'•Šë«R:¦À]Ëúá¿,ó~“Þ+ïçÆG¥ñ§–‚ŠÖjUÉó[¹ñãç4p…}aõ…ËÙ®¨¬ ® ëŠ&ÈQL¶ç'¤Jù.¦Ê"ÔEWMNÈåM¾SxØ%y&Þ䪫*°“£~zF„ úUÒ¼5‹š.Nö¾ˆûM7–߄©„S.ùY3o£Î3MóbzØÛUÞ°Wé[Çe$TÓHŠr³®ša2Á¡;~ØüJKendstream endobj 1041 0 obj 4208 endobj 1045 0 obj <> stream xœ­[Ys·~gü#è<Ä;‰w‚spÅ©òYIʱ›årÊʃDJ”c‰ÔEYʯú³³»¤œbq9;3¸_}ÏOÍhO üðßó§'üÖúéôòå‰9½û4K¾k–ó§Òò좼ýÙ° ›¿ vÌ9…¼ùdp› [·9ƒû_ [yðí°õÎŒÆÀ”ß±Ê;>¸1§ŒÍ`B¯¯ÁCýO›ï†íTî:·ù×àÊEtœ )`«Gë÷6ëõo­q£ §[oƹƒäð ô¼ù >®àã~ù(Z»y_ßÂÇGe‘qаÞõ±)s†õ¦©ÈEnÚvÓÔ›oÚÍ7úÍC™µŽVoéhuðÕ›]ïsÙ7ç~~ µ¾@Éà}uröû7× ¦søxÕ ñ ËÏ™ìA~×õÉ܆sksèDM.×óf[oþ¹ÜdXÞÛÔ»ŽlÊq©ßRþÇeyhœ{C'LàcÔCøxÃ"ó6dÙãµ¾¾\¿(˜5~†FwÔí݉ôpoº#ª£n‚Ìè.“[ωÛ<”zëÒèHµ‘[ŠV»Pàœ–±Ò(ÝäP¯ž@ôäm(~,ßÃæ1Õ÷^BŸpq58´wØt *Ý_—ë+èßý°|’66âK8„_A Ñ—™Q“ð5á ~€Kƒs†¡ŸXèÇLj ÐÈCGÁo~Ê¢sŠ4³ ÑbK5Ú«eº\îÓ&cèýecôŸaÜ€Ðá'm° .‡qvV,Ê/@û?ñä.xä2Àù@íQ†å>˜€yv`F‚»¯Q|2 ˜Ü ËÏêæãJû$k”Ìe핺¼Ð¤ë&‚ÂÛ+SYȃ8-L6Ø;Èït`vw!;Üÿå.xãqwÈÄ*@`Q™ø–1„ïZš1ôq> ËÔÂS»jƒß »äEmUJy‚o£²Ñ—N'!á:?©>ÆF çêÒ€^«m¾ÃD& £ûõT\/A °#s(0· ¸óŠQý”%ÚºZÚÊcÚ!=©×8D){ÕtŽ(—­ÍDŠ(žâ y€UB+Œ[г]Ю ÁÏ_Ñôa4_Ò’’†å5Pmì53•`f£¢–¶mÐrkÔ¥’¿·½Çž«~¥ í1¿Ëw2ÝÃ|—g\'?ñV8fOgûÖNà,_“mèÜ+Œç \Uy0)ª÷„ø §—ÿ¬Ó}Þn]W¶$Þ:t–/%®°ÛyßVÔŒ ?½hó…áºU‹"<æ¤ðÈX$1 5úœH²¥É ·Xþ("*ß-Z?1­øŒXF&FäÂmæIq„6b"#úåPÚðtI<)ナDDãY/€ ˜ðì<á×·ƒ'pÞÀ´h¬Ç¼(³9#`y…ó¾…ºÕÅÈd®¸£‚„+éü)"Ì—HÆù,cã//ß{Ñ™ÌK†t‚¹ûJímADq¼ýßá È=M>¨#t›ãäü°}D„L{[£rȉIܘl`B ÈÊÂTµ“9`ÍÌX×`—ºhaµhŽwE¿†=ÚÆð~Ám¨ú~¯¨5£3Wõ¢Úö+ì, FÌð+ѳ\Ã[Õ]P Oaa±•D̽DÒIq¬f1åwç[^ïÌ$PW[›â¥ÂÂ;aä|´7/«sÀ Í]¤£Æ†2¹yÙn–éFK ÿ¸>ÿ¸:«QújTqÛ8qk ¡66Û"ø2ëe¥jœŸè@7=~ZLËYîþõ‘eššEº!ò{‰OéÖ¯!ˆ?¦½c ˜#\¸Ö†³~ÜRÖïWR›zþê0µ[Α¼éåêþ/ËQÞš©¤ÇöÝ\]ÎA"g°µdKS˜mH½ûãÉÑ’HËU‡$ÅÊ£!ì¤ÐÄg)z‹Ô·ëAMûõ¦\‰Pé5¼)×xá™íõ¡Öí&1vÖ³n0ÖŽË ¹Däyœ‚ð8x”.àÐâÙ/£‹û»¬Ù寄!±[äݳ¯“ƒÚ„áè€vã⮄h§ƒ²ÀuPä˜B¥ÑHößAó]Û‹ÑÅѯç}¤¼¢æÌšýªþvqìïm¤©’Íu’ÃJ&³ôO/e'áË{’¦à°¡lª‰Ê7¾7TÇ8…ÿ—ÅÁq­ÚèIŸŽIç Øµ øØåuHxqÕžVÙ U!ÖR9ˆÈ†Ëò:¹“ÕÙWÚgv¢7°PØ“mư§e‘|À uŸ!X±0zWuj¾['ŠFJŠ_Hˆp(¥£Ü½EXq(“@c²ø‰¤?e`„DÒ©O!ª0Q=Sªà%в¾w¿…W|ムøNÛM¾iB„xÆLåJF§_Öò–/¡q¨Þ±ä Ëìp(å1 ¶¯¡E^ñ™÷ÄiÚ`+×~p”25Ü¡ Š×òxæ|æJl­²U ¡œ3aÇMÜBÙŽ™reï­¤œ8TÀ‚d¦ BÉE¢³Kæ…iF|]¥t¦I–л“”Û Þ6І{Tµäp§>¨~ÛÅÉ·­Æ˜ï0æžx¦á€õH¹žMü{¢C¬¹â­TN™:í£„¼Ö°˜+=#:›,l-]ŠêM©Zy©BWå…F“?^¿ÂWã4 nó²g<¾»®ÆdñU{ÊÅtŒïòÇuRRDE?4àô´9]·&J¯ÊL}%õühÂèªqì¾WÀ{3Ž]Ab$Ü”–ʾ_½Í·&ùØffl”Á®o¼H Õðó©-›£C pÑ•ôº`ÚŒÖ )¸6ÅŠrfLeçØ½£¯é•äò´ñ/º›ïaÆ6N …BPiàž8•«)¡/V‚F²º­¯´q&%8ûWÚù¹¾PÀ TS»)‚œæ±v‚ jjp«˜Ÿ"M[fQ°ª¤nr4­þû!]¯¨Þ¤mÇUñ0Í:úÉe-u!h™u^À0Ù[ÔÊÄQh0æä‡:I±â›bUlµxÕÇw-½`ùrâ“_³f?B4×JÆIu°­‹MÏ^jI‚w˜\².­j6ÀI¦‰ae<,sÏUg7Òí&7$“,im"b··*¯Ë 2ñ>\ešvÂh2{¹ÊÇùÖ\üšo¿à#§ýÔJ ,H®§27íˆØ²Ì¼H…"Ó³q&JÇu‹%(P`Y7™RÈUì~ÚÅS™öÿÃ^@Eq=±.!6—ù¶–Ó¿®i3¦ÉV´Æ7&å¥Ûd}›s¯¸öž|î’èRž'vôc`ÀþX»‘xˆ®&ªk‡µHõŠ?Xiw¾¨Ýî %Rw¶O©We»àWS)á?7Û·Cwƒv‡´º£tjí8VýuÅXû¿„ƒÄ0I‚d²¡ü­¥ìýÊ)$…½sR±©Bʲ«þ:mÂÞT<:º“Îêÿ¡‚WœöÕ>卿ºK9Ù¥>©_cÿã_7¥Ø9ôâ]þ¹´¾šî]A—JÖO¦z»r4Õ»Pè)áugË)ÊÞeÊx­Ç·À[]!Ú6;AeÌÈ9Ý} nççvñßB”õ,æ^¢“âOBw>¿I%pØP=d›D©¦­›L'9lý„ØH@—Èy§L6_f²e‹3õk}7sWoXƒ*ÈÁÉõØåê+¡‰£ø“!iâ8€ª2=Iæ†ßõ¾‚&o«J€wgÀ¡Ã€Œìðä–UéÄE-§Ö$ð¤{Ä>kùÕª`ëF™°Ýã­¡zý ‚>¡EäB¢ém×Ò±ìý›pÿÆUâ¸j}ö·¥)þWf¥¿j–Å’)áôå¼G-îÞwWº€nê gÚq*Ê®…UË”°.åâU¶¯§F¢. .³Ú/èMpnYŒD#nœv–fK|ÇŽ Ýñ£&ÊËíÜ,œ7O­-³3A$™EåOW`˜V³/K¼E&+\ê2cOFgÀ]¬.æn¸äµb:‰ÙˆèRŠ«ŠAßý×˵–ÐÁàI íÎîHˆ×büg'ÿ,?ÿ×9QÃendstream endobj 1046 0 obj 3858 endobj 1050 0 obj <> stream xœµ\moÇ‘þ.äGN€ìÚÍôÛ¼HÅRb$9‘iåÇhQ¢„£DÛ" ÷ç¯ëµ«{fÉ%ƒ@jwfº§»ººê©§ªùÓQ¿sG=üãÿ_¾»÷ûç. GgîõGg÷~ºçðöÿ÷òÝÑŸá‘)äK»¹ŸÝÑñë{ÔØþh˜âÎù£ãw÷¾Û¸.múü³ë<~vøy;õn×»´yÞ·›çà6_w~ÚÍSò›tÛÆ]ß›¿taó¸ÛúÍ“nò•isÜmãæ\zÞmÝ|–ûþ+4š°Ïoºí°ùÜÈÏAïSœ7_B;|:÷™{rܯ?èæ>7õÜ=Þø>=ë¸ý÷ÇÿSŽÎN9&·¦<ëãSžiÌ?c—àé-ß݆~7ºy¦‡päoóxÏò“o:?n.i¶Y›×ùãæ*Æ—çú&ò²‹ù™€.r#¼øå¡Mãæ$_û¹Û¦Í+¸6äkC¾†¢ˆaó±K¤ñ9èã<ÿÀç øíҌ½Ѽ›ð”ŒnJøòóWxtr³Hï¥Ç¸¡6„„“;)?vÁc{ž5½ ‰„4â*žÈ\Oó5sÃ(óñúiÞ ã,Â×^@|ø|`@e‚ø²¥€÷ç÷ð£ç¸ØƒD¦8”>Èk#<éäÅò$ÖËÎCÇyîè>ÒûûeœË í×ÅXvº&Æ“rñ½Þ¦ØïQùø°ïñªtŸ™nÊÃ×J7†yª¤û¡R¯²Â$ÝKÕÊ QMhæû±‡ß¿…_Oo¥ÊÝËë¥tº¦«?ÛÛ©ŸÁÒ¡•P$m>Ú½´ìèrmµ.ôÓûr›&í@¾)WWWëáêr¾¸Ãj-ö¯A”=šG\×åûG]´sYÒb‘i™s®#™ ÜOä=út9Fºì<ÄèFŸßh–F•QßFx:´h–óbm·k¯ÊÅs½˜?ÅyBOõqMoÎך¿ZS;#Š•zPÖçI¹úx±Ú‡/æ:l}¾ ¨Á˜ ù‚è@ç«î5?‚Ë‚ÌýLjîW]xd z &ŠÞg€‘["_ŽÉ£o†¯üšÜ%ùë÷âókËãÈ —`Qã®9_=À•ÇšÂ=¸>ýó»jÉ#ºÙI[¥Ä &¤¡U. `Úy7So'Ü5ü|Æ9òAò!Ã/&x²¾ÅvˆažÇÛ²£/ÏçÊ£šaË!v‚¹½ÖXæ5‚ê&ƒ dö^oœÁš'X9ÓaiÁœÎvŸGMÛò„·j?`Þ?*Ba½ì¢Í ý,뇟g_ðuQþ§¢‘(º—¢š0èÜsÜ> Ð`=^58ñ±«`RTòÄŒ~Âç–nó+)/\̓7Œ§G­c] ›¡†­“$Á@–‹5t<‡—)\ªÓå© ú déDmü„ `tîi‡·çÉßVaCïQa½ø™7e›”.ToQÿXBµþ‰@h&‹V@â”ã"õÊ4e¸Žë][¶+‰\àÑ]±‰ªKl¥ƒ‰CB¼ÿ°£¾ Œ¹ñt–ù[©M`cj&,R­¦-¾9R(çWõXC)£Î'dÕúɨaóÕ*ø0Ô™ØÆôqŒ%Kzª9+sJ’ìûÙÐk€™ˆCy¨«šY€–‡ñÉ×]' :ßšwl4*߀,äη¹‹§¤D0ÚCyÙœ`;Þ²ý¨h ƒ"˜ð}fѺ8"δUÅ^îåHì”øCø¿BZÑàm /ºÖ£¨ŸO@ÁꦾØÇkhô^sQt²¢µé-4M\X&J”<ï0À®sY°©gÛõšQœž§À›;¤ˆºh†a°Ä "O–wœXC®ˆ§[û¢²ãp`Qq•šÍ%n¥lÕ ¯+-ÇæC—}vŒ®­ãÏ+ïg2M TÉN³E9Ñõ´žÃÀ¿ÕmqÛ<¢Lo­SÒG^—!ÑŒëÝ6Žyfßfö·¹jD+W‰$æp²p‰4c u˜{ZC¼•g \éËw]ƒU(DËáu9‚Q×}kÂo‡‘¥¢Im•O¹™ÅjV#Øu(‘XOH›÷`tÃøuåŒ> ©ƒÝ2“cø÷îØ‘ªy· '¾w:Ì„ËG6ä¬ñ [“ßâ—0ö4Ç»o…0ÒcÜ–qI\…È·òfzV‡Ú«U¤V[¶ó!ØG¸¿h1ÈˆŽ¾¬%kï$1¸Û¢ñT<%O¹6kŠAQ¾dëËîì‹{CØÆÅ›}…§Y§Åƒºˆjˆñ$Ã3úèbMØ÷AðæòhèXÅ»l€^ÞÀpô~'…Ðþ }*_çg×úhòŽÓ.xÑ$èR~ݸhÂÎÆJÐø´Ø¥5m0ÀŽP: ˜jZª™0äI-þ¢0Ÿ$öo™›*0 îwâq²5~fÜ+´‹Ñ\iÀå°Ò+–Çú¼H,Ž%fÒßhÕEÅ‘`á.;$ÂŒ@’…f¸×rQ‰û¬c)“¹b"÷Š'Ji–Ž:ãTš¾6ý@°Œ¨BÏýnRô,m ’ÚÆ‰Ì® ŽÙäüXôFó{f€ 0‹Jº«o€ÁID¼l¡’Œy•‘Rê/î1d܃wœkm‘@2ˆRKX¦ÚôAò u ¶š4›úƒNMÎl%ó€lsVÆ/áÂ×Ên;I¤ÍŸ€§&éK]ݯ˖y¢½t7rú¢ßüQoþ±0ÛÏô⣵nÌŧ…Cßðˆrç7 ÃÕà«ët²•Ñ0õ®¥“Iõ„ö{#aïeÉ Ÿ#?ìæhµB¥èm†ô6Ø@)U¡Ñàð•wŽ€än1m)zôtŽÃ…ÙìsufBM¾špưL~Ótr[¤Ê­³`6»ì6µ@†Q©Ù<¡*È ÙíkÈÒeb^ÛBÔ»Cqã—yk+h£‘¿ïžPüNI«ãnÂêƒ G +i³kÑ ¼£ú_tT…alÎ4þ£UîÇ}Kž$m[£G&μÁ}ä}kû©tÂÅ%ÚÝ» 80ë³'ûBsŠƒÔ_"êxÑÊèu㙋ÃÌxMÂÏ´K-6s¯•Õ(N“yÙZ±º¶æ°j°J¡È¸„‰©yIÖ;škPdé¼34kE à«O‹¢(ðkQ­wÊÇ(atÎI3h§¼ÍJ¤& ù Ü›&¡Ô츴žqÉvÍf\ÖÂñ1›²ùK7cJ5)"º.õª+€OÕ”•ÉØ×œ·p;¯ø‰Lc¼¡'¦ŠÍ®éF‘ó:K[LÔB›­@EOŽË°Lë«Ü-Þo¸—Éýá6¨¶_°šy:KûÅ3¯Í—ehLÓcChºÈ<}*·…ªe à£cJô‚9MùgàÀÂÅ= …lCÍjÿ‰ÃYšMV‚1 ÛdGõýmsÅLãÎF± feáßQ¶ Lð* x)07ðYƒbh{Un°i³ `0gûì ·²Q´.Ycºj§i#ð¬û¢x ~Eµ¥JT (ª&´m› Û³‚䝨 kÔ-ÉI$žãQÍSÚØvÉ?¯£rQó±RTJ%ìA?ý­´ÿJ¥Â-!µú]îX$ô}G¬9jˆ70ˆ}äùÜNÍ—$Kd«]”ï{Rh–Ô`ŠpšÀ(‹A¢: ýUg+5WòžöM“jð¶_je±‹MÚ¿|l ؤkË¥~†} å(P…G!Ž–x>©Û ŠŠÀ­9CM1n"µ(ðL2\”!WÔlÅ77XõÛ£øs~–3¡dÂÒKÏ©Tª+WR!¦z•MôOíÅ€µ?uß 3*ôa)á½$ÿ @øÚmo熑·Ãií#ü8þ>.ÜPIŒ=&ŽÎ–ÃàE@ ~PK=`§àVŒ•¤XI•&¦Æ*‘MD^ŒXš±çõܧaœÕÄL}âûb8™i©!&/·)?WÌÀºÁi5§JQ “dg«@ª”'ÇáƒËÑ$F¡,û~îiíªiKœuZÙ\Ù™b>0¢3%GJ&)í’Ò…?ÊXتdT¨öj&[- µ{±ÖÙ¬—%='˜i•¹ ;‚_ÌC+Ic(XÁ\vWÃúëÐ[ðá¼j³cÓRé3KÞ€«ññÓg8þOñCF¤ý°¼1׎—Äóÿ¡Y¢à(Øý8è@ÞAŸ7ÈH4›W$‹YìŠ$D9O7H}Þޤѩ¬J"Âv–+œ…4Œ¯«PŽÊŠfY­Â°ŸW׃û7|ä¿§ò Ö œFözÐùzÇp$&î( ´m®Ä¨?:Ï[õ6ˆ0©kœÏKñ1:<5üR xV‰äý‡€v¤µI…Oo¸)+)£>eo—úˆ#yT3Î%|Sá}a˜ÉQ}Tm‹MmÞ'‡oÂyI R×Ñð>-~MT¤H+Ð 'Y~ÓáZœf¸€åɉàÏ}U6œóûHÝ×›ŽKï®È; F‹¢JÎLEO?ÄéùÚéE®.áÕçdÃÎ 2áé {x ¢…Oé:ƒT CÁ<¿vê×¾ÂÁn¶öx‚”|`ÔÑæY}ª‹&’®‰Û¢Ò?ÏêCb¸>}‰gqÆ»¤/·#µúÍ‹l’kF‚r·ödFËÔ© m‚â:z¼©ã«–TÏR™ra5mE™±ë!ÅÁI}³IìÔ‹Øx§*GõRHAw؉,›ÿ‚Qðf¢nC к(ÈJ\š’q\ .#{:ôk¨âÀÿ5r“ƒ’·kõ!†‘[w‹‰dÑ„¿_ä&¿É?_Ø¥4hj½Î‘m¡ŒuiEñkQ‰!¦š`ú5à¶{+ÐêÃà®ÃMPI(Ø ž½…§æýıL…Û"å8Î’‹ø!ˆ°çø ¼Ì$ÅFwΧ bÐ=ð £“š–£ˆÓÜÖέóý;I°V壂÷¡` Üõļ÷– ”0»/NÉ€÷,™’*:¯‰± ˜Q¿8D)Ä`(Ô½Ç)±¸}~'eU¬;‰Ñ7Lç-³7y xðd_úÖžX`I²p†sØcáë¼®ÓRÍfM‰˜Ok´¢cRlâJø`̤¤p cG*^ÍYS§[Yè²°H‚î1…ä«XA ÆFÇÙôQ²LûµõWb踋U×,U/­y”ƒã`‚y×rkQ[Þ_Á!t1ó]q¾X‰ïØrÈgo>;µ$T¯9XRtÑÕ™.Þwà "GiÞµQTå¡åcó_N}ÜšRÅn4¤B A©"À-1X"th“@ÖÚây² Ñ™±Ȫ”ZÊC¥ –ÌMÞMJ^°þ{ñì®1°,Q°Ã¥”µø€9š²£o­ù ç£÷ͨsoÎ’ ÎkŽ ˜RJUÅÁWh_¬QÉþPùÞ½+ÐiS6^-S©ª·¼͸6VœGë# “ÞKÐ0lþ·Æó§`k%fé´´’’)mYœF Ãu`…2Mƒi!Ý™Ø)6*ôðgš0pSE=Ä˲[w:F3ðõæ*¨å!æyŠÿè–v΢U‘ªXôdkÉUËý>7XTÅŽ£FØ]XÏß–6],4;'}ûk…“RÌ÷æÉı઒Öj‡!Õ\‡!¤\8×Zµn*d…S• :ÒñX;òt€óõá'*µðöàŠºÞºøÒØ9¤bþ:C } a´«(‘Þ_ý‘‡z&M *§F¦Ä. ;6D+e9hby×l”Ìi¡6bÑ^ãÐ?î´BÒ5R0l­Â6A~š‰¥Y.4…+ Ójå‰FŠé ó³ƒ=CVQa¬KzLÑü5_Îoi¬!Ñüò@(é@cºG8­È ] Ã<"Û ™)=åk˜s<ÇG¯ÝÚ›ëÕÆ!WFQhl[Öº—nñ|„ná¿}øe‰UÏÑüãİó+0qQýå½þUö:üªß3¾MíNc¿3Uz™ËÞ½:MÂkM$ËÐÂBÂËò£˜…_:(‡N‰O7©*•žä0¹#ÝhËyV¡$éÅoõo¿dÜkÿ@RH1r¯;,K\­æÌÕ¯æÞG>*, „äˆÈ¡B‚O÷wšˆç/^lÚEû,/1ðÿNš6oÈ¢L}ôMÝÿ¶«N†L ihGè?¢–› n+¯§k÷·>˜±NQ®%ù mhªÌÙ¥³BaYM-&ÙÃc b˜ÈTÑBa H3Ô_‡ú«=×AÍü/ø£+§®áÿõue½WÇ&Nav»½„k ‹„æãÔ›š~q Yr7ž,3‚YN¥dÙ¾S`II¼4>U„º±•O›óàbzO¼õ ±ð<GV‹ÿ3©ssåx.Ë¢¶¾õ_o‡•á¥8 ‹ÒsŸÜŽY\ˆs®Ïv+©¹tæM‘À…Ž•L‰çÄêç9´ø#—ô,˜K[Q#zÉ>|2'T>3J ÐÛ\\;A"J=J±ûÑQm`º%‰‰€(XÉßÅÉ"R›öü¹‡EÅžç¿g'Éó†#Ö'­d Éúº·Ê«Z8|žWŽŠEƼ­ÂÅ>­Q<"jƒ'-í0(Þ¢ŠÈÖLqø&W1%ú*öÔ‹ª9 j”VíõìhhwÚÍ)Ä_6õœ7J‘ù´çøìÌŸ7ѡަ›Å)ØNN¶žvÅ‚ý‚?ïSQJ$ŠCŽå£ã{Ïÿþ,ßÝ¢endstream endobj 1051 0 obj 5520 endobj 1055 0 obj <> stream xœµ\[“Ç‘~Çüˆ öÓxN»ëÖ]û€ÑÍHÈ0DxCöfÐ@$À6¡ðß¼Veu÷93€Šõt×5+¯_fñÓÉл“ÿ“ÿ?}uã]O.ÞÞN.nütÃÑçùßÓW'<Ã&ÑÁ«~fwröã îìN&2æØ;röêÆ;×¥]„ŸÜ¥¿ý/vË¡é6Ï}¡çÙ9´¾×íãî›Îõóœã¼»ÛùÝ÷ÝÞïÎðý—Ý^?<ìöÁýà"M0ÀO_}tðÎ6üKK‡ð»ï`Ô/:ùã )A›¸ûª ý0„wÂ/÷ñ´ Ñ÷sž©.èÛÒ ?Ü=êö#¼õ~÷‡‡äu8ër¤^é¼ì?L':¥äqÿ{!À> ýÏL×íá8†aqsð<ÌÐ!:ØåÐç0ù)5mì37ÉV.ÄÖ ƒC‰óèw—Ì5ø˜vÿ‚ Œ¾0Ú]úž§¸{ŠÔƒ‡1ÛÇg@Èãî-<…8çÄO ÞÊÎZ†ðcïó÷oœÝù)€Ž)Ãü@ÓžÇÝ8¸§]¤ŸgŽ 4‡_!E âßKÓw] æJï^EŸá· ç¨ëëÎcÃä©åÏÝ>í>à@pxsؽ€¯í¼å‘ZI&îŒ$‰‘¾\Âlïè°Û=ÇiqžŸqÐ ^æÅG\M1Ñš–=UxBÜë{|G3ã/l—ƒîÇžp¿Ð5{ZÈkÿçhŠá‘çÀ/;<†0ø>g•'¤ì-óIo­º,lÂ…á‡8Êpž–É\ý  Öÿº¼¼ÝÉaÁÁÎÎ|@R˜Ïx+(­ÿB6ãIðHÞuÚæ¹R.:œ)™Þ¸Õ½ìuïBŸÒœy˸öß!µ€Š1Òö£Lhß8 ÐBØ"Ât¸ºöhð£c¦£—ʱ…[AïLÓLÜúU7ƒ  â" yL‰¶ÿ ²´$Ì›ÊËx°¢!‚›9’žè÷åÌ¿©ãÜ-/©/÷åe¨/ÿ£/7E6&¦ì%ýì#±"óè?;<ð<2Ë+ŸÐ…·žáæs+—ø®såAæìPëø±¾6"Ö`¡øGDŽHÁ¼|Ø#–oD©Ÿâ{<ŨE–jïA¹xá®qðL—F[_¡¸A•S˜Y~Qì©ì'°¶òcá?ú{ˆ$ȇ 5aÄHtU C&Ea¦Ç¶ÂÝãìMŽÃgËËj)Í#~9/tìñˆ2ÉèÜøëºç‰ê)úÅêH“ˆs̨op™ÐÉìç©/æÿ©,º*6ÚŸ‹êWÇTS[ÀK“ÑG¿uþUË<ãþsª%8Ob¬–$4,äg܆[ÐXxŽCÍ<ŒÄª±¹³ž’x,O”Áhëü…TÇ>"QDd">÷g¬)ÕBY]舭-¾“ ⺠«Æ@«(œøDÎ)ð˜Hû"y/ñ=“ç"~,²kNWx^ÌÉ!;ã™ʇ•9 ¹T>˜ß7¤Wqâ¡ Ýx7ÄY9¡*¬%œ¬Ö›½UßN6F\{ntžîM´ÑóîÄ©¼/^J”gVൂ3؃8ò’wÒÊʱÕRÂúÀ𖋉©z˜¾dÞÙ0­`pÐv<ÇÁþÂÓ>æmÿFW¡ö¬ ñ;þ¬RUÄ9¾ã³ ³Ã=^ÀÇç$|³›©9:á§yψ)@v½*Òê™VôJÄ{q“\ï§Ü¡üŽŒl|s^˜ÝÙú1Ïëñ+Ï–µE£BŒŠÒåtªSë -™lÓ3pÃ"vÒÔÇûüzø©¼ý¶>~W©m÷› þS7݇}„?¦Ñ-tš±¡ÑiÂQ!Uš6bïÙçh¬‰h©¥#–x_;6k¬ìYå¬üðsõ¨'½ðÈϹJ@Q2¦ÇûFËö3¦rå²NøL¯0C¼‡Þƒ¸ŒAß{¨¼à¯Çøë»"‚ý&P.8íÿÀ£JSõqiküì¸céÊpFœÉÙýƇÉ^¿ÿ7ì3 5ãÕï,ßïÖá¿¥Â÷=/õÜÄ9ø‚ëµ}©}ßÕ¾ïË÷·m$rØýÝ7DÊ¿×âKÒZácùR}šl”Ê1bcÒVvx²ht±^Uqå-£ôÑé?ÒAï ž“m®6®§ˆÂBHÀÁ?C.5‡â"žŠ ú±Ä.›PÁh‚Qbj Ë)nƒjùrÔõPU¿®²ZÕk£9;Ÿê¢§‚8XÕü÷F¦Ïx4z lé¯Tã{!J¶¶´‹+Zå!Ø­ûjŽ0ÐPýJJ¥?8…(ª™a™_ iJiúÞNÓ'¤g;Kþ=º9‘8O¹‡Ïp°Ù#„-ó½ÖHÎljhÔ à¿þ E7MqÂc_xš#É{IEôŽªÌÎ8|öÑ;`ÓuoD$ Ìú ¼D ž†> ØaÅSôÉÎþ²>^5<÷J> 2ðý8%²æJ ëÀbˆ»eW€¡Kñ¾Œ &²3«ï›ÊxÚE­jˆ3kHGzÍ'ö¸³Âg®ª£(±+™¼4°-âCµTOy¦*Ôºž4¸êç5q. s¢à•þ&#ý‚dÀh']¨Ä+:‚,Žü97õ±zsÒcj$4Eèö“éj´aBk2ñ÷d¡ÖcÒ/: ”Mæ£ÄŽZÔ]´»VaTrIÆL_°1lv©Q,zT焵Gƒ_“†¾PÍH¨TεQbÝRpB&Í-~¹´BLé9hx ã2ì¦hÆß0Í×]uZ‹ïy{3»$±ørQPå1{/h™üêÕ!™³2„fM¤ –I‡þ´˜ü‹‚? ñ@VÕKû7u¸²>w»UÏfj‘È8«<÷¨ #|Å{kýõ-¤= [|VÕ>jµ½µã ó5p«Ê …hÈ…ªöZP”²sbFõ¸–TÜe@kAjêÓ¹áþ‰ko”eH­¢(¬%;6Ú®.èPì(œHâÊql «„eç²`0q[CáÞÔ&õ<7ã |Žcy„¡iªIWÆ‘#rܼ‘è…pGë{*òµå]Y1ñsÅ0dÛ-/5ÒFvͯ6ahôU3‡­´Ýˆ"Aœ ²cSJo–˜Keì׺„禤À˜áñ«Áƒþþ˜9Ãa4iƒHΣŠ_ÓøüoŠgþŽ=†y HÚ¢ n6»VÜÖ† f3þè“{ŠO±.3»•ÌC R–nr1[ê£F×9ÙÎAön"5­AU„A,G$ÖV¾¡ãRJS4±}±HªŽ¬-5}j¥§Íê(Øð=i“|ØHúJ‹ ^¡6¯ëßHA’Œô³,>øþ%ùêžJÒ†wÝúâ_uÎqÁ]Åø g¡æ"¿šüŠM¾Á("6€.lzP6œ+åäÂI¸.qÎä*ß8\›©Ï©SÅ"B,ÈÌg¦†“=æ©°3>ô±è©c:Wü ¯†iq¬c?¥oN‹AÅ›Ï Éxgf`&C:+å·Á]಑òA~†¸OÔÓ>c=÷Á$WèÏ—å+.‹ÎÕÄ£йÝs½…ßÚÑx £c_ÔÇ—6Ô“§[ìý¡¼<­ÐlmùïÕ6¹:l –t³û­òòÑm â‡ßÖ—÷ÊËåé~ý|ËNżbJ“×ú‹£ù™IÉô7¥¿£G‚¨3<O'ߢGÁvØ øÌcYßÄ‚H_ê!cçVØÀ¯Æ,·?ŸYnÿ¶Ìrû7e–Û[ÌrÅ”ŸÆ,·fY'4BFbÔHõ!Š[ƒÉJbÒ¶/ ç[ž ‡…xdm¿L£UP¨„Çÿ@'µœw´3 çÆeì¦î 4dÐê¾+Ñ^£ÞãÚ{îWiоLß•*ÐËÖâ4í°(HRD ?â²×IeÏ{ÿI’S?M’ãrÃá""H \,²)<(N ŽÍAÆVŽŠ|¡‹&ÖRŸµñš8ïÖn“wì6ÕšU®Íœ¥âöa—ñôÇ9úŒRÑ#û…¢BX–TõTü*‰"Lëgo–!Pà2æn–ÜÏ4Ô´”¤ï©|4~|Š™Ë{m¼Wü%ĆÝ*ï+®W*Q5¡„^ÌëåØšç$ç’hjyýd+©ß—²çðUËWeÐÕ;.Ç8nMXk=ž50ÛU¶v#pD àƒO†ERô ×iU '< ³…i}yM"þ Âåµj»V–Ê:p³ð˜.-¼ŽŽ±VÒuh°'O¬Wc*W«»tÿ›__Z ñô)…  1ZO3û% '†A¼E•府)Ó°%¡B£R z*%Û%1±×œ“¹0qôôã&’#k¨näee}MÆ}*«†’ž1™°#fšuÖÜ»â€7Á„ç¸& .y¥êàeއT‡äâÇèÁ™¼¦×ƒ¢Ÿh÷­~Zi™¢¡Çµ~!ãèÁ™BTc‹³u¶Â©pÔ+´jñ\ïçüÈÒâÌ+^¦Õá7 ø=Ò £³õç˜ëØö ŠÇVdâÂ@θSˆó*Бè㬀Uâ @aÑ'Z‡Ú²1*EI›Y²t*7°°Ñ¥;f¸4Š؇Lp€yvx•œié(¼äÔ­ª¼t½œ/R}Éu¼¸ÉlÛÅÆš"Dªßé6kîСÐ|ÊÓÖ^,çùˆëVÕiäÑ'õ(ÞXF*’5 ©4£RuÒf"eË‚a‘ë©bÚŠ|›n»¹¡ž0NÑ¡‘‹×Jã¢ãk s(Tþ}eV/ì®-r,A?~âÀ?5iU<Íõ+ k‚Ãé ñæå×MäXut’µ8·fÆøHMý€zì׿1ð~A|¨t¢u“º`]ï$k­Ê'T_üpmëè£E¬m,¢|­×û“¨û”[…ôìV€rÁ©’/¶‡éH‚I)´|el–JÆÏ¼-ª­ÙLJÆ(ƒuJX6~Üʱû_óRh}Èå6y ¦Š+ÞRø¨z— N9b¶”¢y:jLÚšà ~hS'«ºÚ¥M•£¦ ìm1}iž78êL-8Ë÷Mäe$è å’Ê!ëøªß1ëÅ÷Ë%WQ†5Â&¸‘Ì.†ɲQsg‰]ÁIi e\×,’’ÖÛ†0ºxµ¤Êîqâ4•¹õÞ8qQÊ/‡¤S·ê=`½”]a„ä3WTN¶o˜ð4Ë,-Ui“µ>%Ö8›×(À‘诽MóÔÔx«”ª?.ôÅij)³_\Ǩš‹É!8ÌU•Þ²ÑuyV¿ìL]ÆñûYžH]ûŠ[b)À€¥cªÕ»R›»¬´> stream xœ­\YsÇ~'T~ƒŠßqq'3½MOÞHb'N%±c+e;Ž@D$ÙXòëÓgíÓ³á¤\˜ËLïýõY¾sz~<úñd€ÿøï³W÷~óåèÓÉó×÷†“ç÷~¼7âëþëìÕÉïN¡HöåQ?óxrúìUO&w’rèGwrúêÞw‡±‹‡¡üé;‡¿Gü}ÌÃØc<|Ùù±Ÿg?>ï\îçÝáëîèýÔÃtø´ó‡Ïº£;ü¥Ë©<ɇÓîŸÀ£/»ãH/ÿVÚþ#TÊØæWÝ1¾€¥´žÃ|ø=ÔÃÒ¥ÍÒÒÈuñù£nJUÇÍã‹Ïá×ß:®ÿýéŸaÊa´SqìS.³>=癆ògî"”>òÛ£úiœg*„í_À_”A¿.ƒgúoxÏ^âœÌœq‡§]8<.MÿÔãá¬ó‰–¬´ã#Íùç²PØìSh’ž•Z7ð «áÿ ¡ËÎÁâ&¨„ ]Ú:܇rÐ5Ô‡öK×ÏÊOZ©+êÛ‡T†áû?ÊBÊ¢ùà°1èå-ìÎÏR‚ú=âtdG`²Ð0>SpØ:”¦6t'„€>¿è`¡Ý<öt¼ füu/ÿ*5>Á‡•—éÀ /X§òȹëRFX¸„ÒÔ' ö²NýçNÊ\hE]ùÑ´_Û-¥Nn—á ™RÝ`z€¢ÍÐIÕ‡C¬ñGßÇ48ZŠ^p'£O‡ç¥ƒDÀÂSrÚeOXzÔÁ‰Êe cY \ºßtt– /9yx*ÊÙò8Z-—£=8ϰ¡îŒþ‡Î;€/' 0RÁ…«ûíd˜ýŒÐµ[³ØœVv%[à tðqÈôb ×<ݪ°ÊÞ…ÞCWº…óË›ò±k‚e25K»ø˜¦+eê†â¼"ÈÁH HzÑ/![Kíò¿Jó49Øî08>4[ˆåC<=ÄPœ3Íá»dpq¨ÑsxÀH¹OX\•Ñ<–sÎG¬œ{ÓˆšÃçEcÄúªT\i¯‘žçðòÌŠÌsòk‘Rãá_ÙòJ¥KYøû_ìÀë¿äF¯:Ô.wÚOÙÂÞCç°*$“|YuE œê²ÍÞt°b9¥:6¨ÿ¨d£l$ ;øÐ-Á¿‹©Ïqw1õ†Ôpö­XZ!ÎÊl]P¨™ƒ'ÞÊ!ÄÐ m ª.Ët . æ{LX nÀ­„íÆ=nDO;ˆ*­ˆz Îk ã\êÊ^q ÉQ Û:BA7 À…ú0»¿:Ë83áçT)a…oª‚+EB­†Š=–ªemðù5<»&„…±“@ *¼+对Ìm‚þd8º6åAÙÞªZt9hÛ³V1Pñ;-9`Žaô8‡ëŠFßñ A)|`vhJ­ÙÃú?VéÄ_È¡ EóTñPž®»¯V˳2U‡¥Õ‘½£.Ù0°®÷IN¾˜¨WðšÚÆ=ÑÓ¼ì+3&¿ÊVàd&EZ݌ ¶fÆê Õd'ðB¬5kµÒqvø°ÂAuI*5¦4 ‚ÎìHÍ1ý&À¥ ®áªðZ’UYq `õ ÕÀ5… tÄØ [j ÆP ?„-ÈS-žl+˜šÃOçþŸ° Æm(þ‰#cùs1‰°üøzÕºyvDÁÈL®Úg$±.bå³Àhe¶ÖV<ãÇØòl:Î5„U®¨þK+kãgž~©­nž?„ÓŸX6‘4±t-’—f¥‘hp} †ÙÂ4~¹©ßЦLŽ„mDéÓiÄ ¯%ù1¿ªËtTkÔªl¨âФa-£.å4Â^±Èf©ª'û8°¨‹z²ÙÁÇžNÆ2”x“>ö®¸Å'§¹wú1¸“ÇÒÕ€Pà÷PàÃXê}ö“›bSÆþ¦"ÙÍéÊlGz ÕõiŠ êáGBA]´ÎÒE}  ¶^ÔÚô>”¿$C:æïâ߇²‚e²Eèæp;µ{ÓÀ•y|‰†S9‡ptʈ¦²u\gó²þ4£¡.rÀàŠ—Üȵ¢óŽÍÊŒ`Ó[/šÖ®ï#±e¯ºÆ}Ö”?]œW?|I¥ç¹QVÖé #yÆ{ªá‚rtYj« 4»~­¨~M‚Î=;Rà@‚ŽB ÉÆÃQR‹&Ïeª ¥ïV¿.¥)²ðrÒÕĘ6$è&~hfˆÙ±>ؤ!Ð(‚!¡Þ#ñvÕÅêÊnÚ£b…<–’æœÓʶÆLÛ{cЄbÅ“lÕ†:Œrj&eiÎ` Ð`¸ÀC³±1>&\e!RÄ"G£Œ•ª‹#°:§ælÿf¥­c0Œ(T#9ãÏÙO|cýð4c—®¼;J;çÒΧ"ö]«x»|"ËK&é G3:56ÀsiÛ•3E­A*nLVFCÇo¡c€nÜÐý°¾ó¼éôê’ƒ}0-^§UûtA»Ç©QUEº¡Z2vòË­µðÂ<‘åiÕ ”µ…ç†{, ¤YA¨æODÅ”ÿÃg ¿ðO" T /øf‚Ì}ªMPmhš¨«qTcA~]Z#P¶~?¯-“Ïÿ]YkOšÿ!`b8|c›–ºoõáu}ø“>„ªhN‡o?¤z,îH¬ï¨ë‡u0´Æ¿k3}øš;AìÙ‚ŸÁ“Ô㧤ËpøžÎÙþòÁX+v´»¼¥•ÕâH¸Òù¦HrÓ€þíw_ßwàë]¤åSµê:µ`~€Ó³ ä·_‰C*<àR.¸4ŠÿÅ’ˆ‚ M\ñFj8ORcGöÀÄ,·²(gCãé€[¨J»r#™ÚÍ`l”Ò3¸iDÈ‚=‡˪™ªýk^¼Ÿ¡Ls4Míõ3 ög=.9!˜,g#õÏúªªþÖîmµ/M«îD¯Íó#@àÆMjí‚H/ê¦aèØé“_¶A׮ŖšI-I=£|øŸœk4¸sã\û}‹Û•»[½T˜ÐD”Ôéê|© †:Vœ.î…À±×˜„u;YHß™#føõwìRñißçµîOkç¿\ÖeCk¦ I¢½èFšQe.¾8q¬;™ „UhádNc8ü¶ü#x¬ÁGÖN"u>“ü[¸Âãp”*øˆh“™ÇˆE4b(b8|Ò`Ìøe¥Ä"r ¦,X 1äiWú„8µ!­§4ž9'u-„fumÿ:R°à“0¥†ð óÇBJ€ÎS@[;xã€₺ÕÁ¸vƒ…ÏXO©m±*Ÿ6|ò&ÇWÁdšiˆ!>ø¥c’åBö‹O`B¢MÑr•ðõDpØhëÆ$¤bŒí2‚)ÕèÃ2æ+­[Ù ÈHF±òѸu+/n‹—kã‘ãžj™@ÆêPæghå98t{xMF¢1Z Ù>æ8©Z‘6¢X²ïh€–«o ή¸yk(ø¬.%ÆS(¤2»aPæÈEŸÈz‹ð”)"”ï×b°HRzFEýrSqBÆ‚NÃÕ ïÄÏÝ ms¦ÇŸ4¼e¨ëóBµJá3’+¬d‹¸ª”ˆHµhíÎŒï\X  Úy®dˆ±—JXíbCÔ„†›Æšƒ£›O˜iû¬y6ï0î¼±‘¯´éE4tˬiH"«Eò™Pë£na–[WRÍJª~чEÔ7^"¥¥¡áÇPc•;º^œ~G<Y_ˆ#{òªã¹Vh =å•~ÎËï§Åzíæ£Fc=èV±ùÅ*%ì i*!囪 üM ]KCç%«ñsMDÔ€Q“rÐ’Íàqe½.hñv·[BéYe¹ÛôNn¢¹L˜W÷Mùó©CoszåB=9zPö[.†ÈÔÝÎGƒuÚ‰Þq¢u˜HϪ׊;»¿Ò[!e¶³JÅgÞD_QÈÄÕì"λ夂0‘Ûdèü4 SÍE~M-€ä²L‘õÑÎmÇsµ¦ÊÜìI¦­úkKŽCˆLKe6;Ž<7X¨&ÅlnôÊÝRÌR¶s¥¥ßKjå½Ol…<£A×Fëjñ^-rœ ¨†\u‚r³çö°Ygn?ŽÝN<³‰[ÉÏ5Èæ‰Ø \4†ÒUÕ«#Rõ Y?ÕT^Ô½%ùÇqíE#@÷,`ÎÔ"ZQ̹^˜3KzJ|8äšÃo< “!ÌGÇsJ§¥2§y†Â¢6b8n”•^ÝzHΚD^É€UÀµˆ£Ø§ðÿ‰¸úk©,-¼ ÕÕ\B 2ýVìÓ„9k¼öA}øPØ_oB«_Ô÷ŸëïšJýöΕ0sŸîÄ.cŸáüàú©¥ˆ·x¶H±ñ.y5˜ô9LÊ™„ºøòh3hÕ4"X†I¤jBgL®ûÙWå`Ž¡já¹HW³xp˜›ó™üBô<·¾ó2u%@$Ǽ²"»º<±‹œÃzUb;΃½®"™›¬¥_‰O­¾Rñr b•ùøÞ› 4ÓV‹—Ù¸³&SÂ’y. €Q½i] ÌÓú“v7$ (ËD\#Ñù[WT¬µ`#t™l!ŽÞ ÉcHàØè Ó.åþrÛûY~’ÁÎÜf“T,vQI'½ÇÐì5ùÛ.y(q;÷¼%æ4”ŒKÕ-s~[BPäÙ/h5¶Ý”ï/CëÏÞ’˜µÒŽf·$ ²TëÿÇ$‰N“l²›Z‚Å¥A©ûEŽuzR‘xF~Ä"op< ÕaJâLÆõŸ†ýÔŠ<®S+Æ¢"-„4ejìËÛ3Ú]"ËÌŒ¬&,]C&Zã¹OwÄZŠ&Õ%Ø”‰ ±oÜÅLò‡úËkJAA$Õž§éÃü!æ¡Í!÷´Ñ›‰}ÌV‹Ìaºõ,t –kvP{ ‹Ï?0:‰ƒ(J{î—9åRta"\ã¥Vs5Ç`®°6‚Hú³!ÌTÓ'ÚÛ[tQ© &¦¶éÕ-(á$¶.0lr·Å–‘÷°aÖ‹ÅUæ,z1 Œ¬çQ"‰žÅð6Ò‰¾˜íU^ëøMÑD>a©_²m¢'RõR-ˆéÛ]ÊZi¥N§a}/™ÃD,XÄêGv–fž~hŒyö&7âi ÊOÉz¡lÓÑ<`QyÅ…ÎÊ[¢öòmKgí3ÐZ![.yšð2 úáùÉÖMœÛÐ0&ãvêØM£•MtØÊ,Z„uÒR ͦ7}írÍM†pÏöã" ‘àJ¨Ð8ÍRá°Ã¼Ñìäe[º QY¦¯»Ùл¼¢ëxó4§; oó•ö‘U~ÇIÅd:¥zÝói+>ªFT¥ …‹ñ¡ ƒÑ}¢ ×0„@sJÐu–O‘ª¼w­€‰üo[¯îrVV—ï'åÐLßÜ #Iü-EØ`’­¥´ºï¹™ÖRJ¶’ÉÍõ~ÓÞYg·Ü ´hL¼FÐZ-éÖ4p€Ù¸í6ú; Bþs¨€Ó5S¥s9 H“Í£j@uAWÎç ±A‰p#s½¨·v9ätûR7ÏJ^JL(î™;Ôf°Ì-Ì~›¹Ý’¹•²ÿ3{ËS__ ½ªV… «AKÂpFúe ÂR £Þ)ºl¬5¶&楪±8’‡À{vm¡ÅìÄ'úœBkyoÀ_ôïn wX‘î2ÙË#°Ê¢‚“aKHm’þàC1&•qÍBº™l^šïôVX£—*˜ƒno/Yb;ΪýÃ@©úë¼C ¼íêÖwŒšÑÙ\+›GËëÔŠÙ&@€Ÿ@€ü]XjÈ]ý ò¹9/P}nX虩‡¢RÝë-çQÝ"Œ'Ì6žÃíâÔ§aIß0©Þ|à¡MIa  “lNŠ$bkJÜ"#»—4šÉ=˜tÛmÅ_w6îðÕ4~ØE¶[¾ùn {ÐzL7gû{/¶¡iài—L¹ ;é¸rêP·;o<7kúiÆÛ*‡‡ø Â>êðcí5û½ÔƲ†¡ÉíYdi¿b(W¨NDqlïêäå-:ónÞ r˜S›óQÊ7¶…x°5¦Ù‹+22Î6™z3Ksó@MÖÜ0û×)šqbåM;ã’ïË-áê»)«ïe™U¥)¸úA9ïmÁ˜qmâ>Ë,]&ŠýRnNœ´[¾—‡³É²”U”SwBçRª˜º5òÅ4øÜºyùòÙ…Ê$FûÍ+¾=)ßS˔ЙŸøu3úhŠèˆ:û»~ûÅ\¹E¬òÉž·(_Ϭߪ²ˆh^ïô$@“•h‘Ö¹’”ö‹0—5¯Gy-þl „¼F“I¸08¨î{8ñ Ðõ”²LÄTÿmESh=I£F6O{ŸÒr„±`‘Ô˜‡hƒÕÅòÇ—?©“ÏóÕ—Óâ¶Ë|ŠðG¤ý¿šZž"ÍéCó\Ô‚·‰´×m»_Á8ô˜?XÜÓë“Ó{/ÿýÖÊlÌendstream endobj 1061 0 obj 5559 endobj 1065 0 obj <> stream xœÕ\YsÇ‘~çêG äOk9£®£’íZGX²¥¥+1l?€Ð" Jà!løÇoåYYÝÕV¦åp(ÍtיǗY™YóÃQpG=üÇÿ?}~ïÇ.ŒGçW÷ú£ó{?Üsøúˆÿwúüè÷ÇÐ$ºüèú䎎¿»GÝÑäÆ9œ?:~~ïÏ;× »!ÿë»á¯ÇÿÝæPuKé0Œ¹çñYnýq·»?tîÒÓîAçw_u{¿;†çŸv{yñ°Ûßzq‚<øîßúèò3Ûð[K†ð»?åQ?éøË'0ÒÛÄÝg]8ô}q÷9¼ùþä6!úCšvƒýQ›ÁË㻯»ý˜Ÿz¿{Ôùüað;wsÄ^ßvž÷_“mÏ؇þ0åÏD‡Çó¤Ã¼»ÎsŒ!Ïv'ð1åÁ§Ýwùcþ>ìNó>^uaw™?ÿ˜Nù½ð+´ìòW_zSýú2¯:C·½Ÿwgðý5mÈõ3Îñè0cs³Œ˜Ç™þ?uûHíòåù>¤Ì’<Nò4"·sy¸¸{ãô°K|þ<Ï ýç7vžÿA«ÌÖa˜s«‘¸»äíænË!l W,\¼0"Á똢åǤElÎdˆ˜&CÖŒK:UIAJ½ÖF¡‡êá›n8ÊɪC;ÖÑ$Q´[ª!Í´éçOQÈaäç+X1à1¨>€±Å#¤¶RÆóÅRòâ8¡VܦÆ0[“Õ¡š9Ñà—v•^ìad£툨(yW°ÈEI>^Úâï`ޱ‰e¹]ÛVõ;g@ô‡QÑ®½ïQçÊaŒ¹×½¤ͨUâT™ÀqÐå½Ze=ÓŒ$)`V Ì2'¿8çÖó`†.ƒÑ zÙ0ã&#îºFâñ:†X5ÉÞáèÃRĤ,ŸMw^!&ŒD˜6bçOXØD»˜Jû6âÑ”C ä$W0Ÿ€~ñ£2YúÑèĦDû\x´ÂŸ—>_è@ŸJ`!$TñàE¦¬1Í3á"//’NñK|†´§†0‘ñŸZrVzè״ªì_-¬mq»€Ä°i"ñ`Ý`Æú ›Ïc± ÁNk¯M4˜%²°¼Ha¶«“±Œm™3Ò´”¼à¢•˜lçUžN»0Ñ`xB’B˜·ÞBïKàaô=ǵOÖG±æôBX§.37x BRÉá®q=¤O4WƒF"\$B~š³…%!ûjÿe]»ç`~û„îÔŠm7wzëÙü”,Æë³wBP¬&A¼d%¥´ ŠQ¥7¶yÄ_ð÷®vžÂ¸ôǾ‡6l…Ћ”‹ çUk计qeD Ô—AY8sdê[ft¸à)(ÆØ6Wt¶Û'L=ðToeèk:þƒ;^ÑGí69îäX˜´^ÿÒIÈݼ7‘ö|™]10ÔfïÒÙ„@ª»ýMŃ=Óâ„'p!žãS>êÒÉH}‘g½½Á0›¡PvÂh‡‹\ÅÀ‹HVõ.Ä1y-J~VœoQ=FY èd“´89¸Ÿªc#„*²OAüœ „ëxI€ýœ¨ŽÊKYàSÎrýˆ6¹¨§øzŠKÁ—•ãA4†Dt$˜QNJw˜1¸¸MpAi˜Lf\¸HÀ˜µ#„ë‹Â‚9Cl‹à£GG­ !‘Ÿ«W.nJìg7 (ˆ›'z/!,Ýéá.‚aat¿¬·Pii›,Ð"žSI/»¸Åï­¸¨œ""ÚCÂׂSÙ¢“Š‚M;¶àFX˼àW>9‡¦cïD*) »‹µŠžý†V˜½¢‹eøš›±ë{ІÌÁt<†€ os¬ÌŸØdYV±q¤°„¨X–Žƒð™(xi*¡(ÜWmipDVIù³ÔA–ÐÄêó× *LÙøàQìÉ›VgâþËÏdÎ.^ì –¡¦Û“Ày8æIh!$:Ø<*¯aèd—ˆêúÖ8ßœ¤ÙÄDz·Ð1Ž>‰¨,‚<èpŽÅiÙT~ä('_@sgRU<çŒ+õ §aE<âG©d# ²T‡³ø¨%Ö´@£¶GÊAÚm’³äZ2¡ò³0½X+l&}Ú7CìQãBÙ<-¥Mü˶1[ž,éú‚Ä'áDܦÎh–-*n5F³—y«V]ùAÍ·îº?.}×M†ÑØæEù^¡ÖÂÇ¡¥m¸8±lϸPx¨fpŠ~_Ô&F Ái¼Ÿ {\_Qñ‰G”²F‰XV–$øˆ‡Y0uÆ®±Dc½Ž^ <ÕçkñTmÀJPå+X˜Ñu>eY£ŠÞh¤ÆÈVÛnE4÷>æî‹XÚWàbDƒ˜/Ç 459ÌÊAs=*1FWs"] ß?²ïÎô…žæˆ°û­6ØÃ¨MÓ—Öù0Oõ¥ µÊûŸôá“òð®fdæUyúCùøš>f¿üãûÙi{PœañT>ž—žZÀ´cl©ZÐ/îðgHNZãlôô sã}éïë÷Ùßdß 0¡3bLçdÑÛòÔô:+~ÂBÔOï†À"ò²¿¶ñu~éGLVþk¸Òè[âç‡*¨.ï®Û:ö°Å‹+«ï(ölí4„Lõ´E]Éc0×еæ´ý±ZŒ$Ú‚a¦¸X±õa'©—ÓŽ31´e;W¦Ã ‡ô¯S»Fße¤Œœ vG @k.¦Å²µNžÙ6¬µóÉšôyÂÓ›ÔHÕäÍÙjÜwŸ´Ú ó~¯ª—!c˜Æi›3§·p¦ýþ}VÉSñÐ*v<ýÁBƒ9¹•itZðÑ ‚êÿß¶Ñ\ÇSË\²H“ò¢"-îsNï%?Q;…úóÜÊ«ÓÙm(ùoÆ*j+øX 𣀠%ÝÞõÞ’”¬Wó@©Ž^׫¯T óîÙQìFû%C,vãaw#F½*¶|½¿OšŸ Ý©×KÙbû?u?­0»¼»¾fë–²Ó!qÍNßÍ»{¥ZV3¸ðöPr{“ùüR ^R…Tç–N×·tÚµãx¿€ßÝ»_·º?ØX² ãý"Ÿš i޵,7Üü¯·¼‘KF”z”šSkeGÚ ¸îtbÙßÖÚFµFnKS2ó¶Šèi¹§È F–¿í(ªw¿ÃLüLåe“fÎAÿ!jÉ•E%‹"¡æ»$Pm¢×8>Qr©Ž˜±+ºê\¯¥&£ˆýµ]降ÎF…š’ä7FmJ¢ÀþÊò ˆDéw˜4Çnš íeƒªE3TŠq-Wå5š´âÕ©›Ò«žRèBUï0ÄxKDb@–WJ_gf`*K.iQ«5)$©8öo ö> î9 AÊŸ0—L¦’mVqX˜ï±òy±ù™Ça¸Šo4¼‘P˜ÄÃ<‰9Õº\.)¥ð!Ó ”›cØœ !¦ ¼qçN d9ïþf@Š×öaÓÖ%Ë`2µC§,¡­˜•õU§¬‹$1,O5×?iŠÃ' ‡æTs¹±U¬¡¯ë Ï9<\Ëlš²ý gKë‚! Ç‚pHu†lމ0Nx‡ehVoÂÜëòG?ª,†Y½Ö¹rqyÅÀ@Ù¤Rdju™€‘,ä¢jX“µç6é»`)äpg‡ •Ï:,Kˆz˜Jä—èDaÌhÄfÇ×iéÔ¢riýî6¸p‰®YF±sö[Å:ªKÛ’ŽéZä”þ@ÁÞº®€ÚpØ<ª()Z 7¿o!R>ç?`{#AŠÄ¶IÐùU)ü¶åqÕ*Û—"KP³’7‚Uaëln$ø0‡R«¬¥v Sg ™ŠÒwÈž7Å{°Eg>koXVid~+û`²¥Y¶Ù)[B™»äçý°J³P…g³œ±•KùÂì=î¢!ž;­«¤B0Ë Ž L¸ë˜~+1¥-‹Þèp¸q- J$¹Ò@ʲå1y’»ô‰äâ$½ pð¢ÎMOJßi†ïyz‚,ÈQSéé ,…kÚî6ºBìBâØ®Íšd©LÔ¨žZ2ÛÄ™Xª5[¥ëš$vSÑ¢¤ŽT„È:’ÓûMó˜’õª;*ËÈq÷ÃÏõ£fª-‹Q`ÉjeàB¶¥G^'pÅßµ•>PmKÅT¦¦,ôBG®½‹4 !Œ)£]¿Ì ý©èw²þÂÊÆnW5ê ßû+ëõ ý«íŒ%§ +BT5¾„GÁ˜¹ Ù£rÁF͉,ÑV[),q·y÷A7l .«¨ à”‘>è´¬©®EÔ-5ëùhƒœeì“Z€¯@Ö”^V’›8­š‘©ßæ:å8F~n¼©"0­Ýì²ë)&¹ôÉ!}Ö šú;:(p“„£Y"«2#wÅ̽…¸¯Pxî¹*OªúêZSóÖ[¬ªùåhS9Ócƒؗ¥ÉžC~Í%ãÌt±ØU_œ»±vºê’oÙü©mX‹óÄ©õýÒ±ZÆ ¶$ÉÖ˜ɃÕ_ Å%­xƒÔWúPɦw›&$Ly“#;ls 2¥¤Ñ˜øZæÅq1¥!¥²ôD;™‚ÙêÈNÒ"v1AX³T» TI¼>«Lr ‡ Z“]ÌØR:ù‚ܲnºŠ'à%&ŠdSȪ™½Ü‹¹-ü4 08V׉²¨%jY»Ù^+ â]zê€^Ù)—Ô¾^øøZ¤rC [¤ö FÎéú¡Ü6<ûVK j›Ì…ƒÕ‚t)¶$¸µ¾3¹$¹’õ~J+G]j™Ôé˜rt÷eÃZÁ§\+º}ê—R´ª×]{ìl>Ö³)5´¼è|—‹#D…ÚâñOWBÐÎWd¤ ô¬Êo¤"»sq-ê‚;®_Ýä8_TŠK¹’úq+X2õHæÎƒ–j€‚Duh'ä,ÉýŽ•*ðF§–*‚à,J¤µH8CþÚ¿o0Ë‚Æßëàè åžö' Ì¥<š‹@×]Êš߸W)ªeÃbƒBÐ⦠å¢Õ=“ÇKm(øÁxÀ¯‹a-.FSª#à¶é Ð2m‘‡Ü¬`Y›¿”°í7,Ìo÷–«kÈ–P³ÅUnêA/ 4e¯U (6Õ¾E×N©t0)¯”‘˘ä¡$Yž•èäÏ»@‰Ö`Èï¶.áÍQ·¸÷B•næ·'öƒsÊ’õOÐ*ÑOÒ‘}/»¿û-ßõm‰èÀº"kè‹Ës†t-Å>ßânåŒCîXN ²³ä ž™ÐÓG%Ý7nÍr>’p*ßk¨¬äýÆMmµ]g*é2:ýiŽè§i•b17´)Ðæ†úd¥ÎYgoOöå‰V'¼ÿ-¾ º?™¥[‡§×~Y·ïg‚Ç–ÔÉ•U(ð[ÂTÁ™¹!gÒ;®êƒ¯|¨Fºç~‡7Ï ¸©aƒÓu~‘xóÔ NU²TŽa<)ÏÙ@;ɺOËé¯/»4îCýGñý¬§X©BJÔ"'§Ê@÷¶|On°YWÿÕX[¡ÛïBTaûC=Æo.g9s•bí²A °³¿XòÆX4Èñ~eïö㥲Ña!^˜¬¢Kólá»%>έ$M €@yñZ7²ÄI‚·l-lRã(ÉÈ«½Ž~ ÜS¹ßÉò.7.…î1è·Šn:ýßÍB®/wSïÅí)ƒ¢þêøÊOïýwþïÿ{‡¥˜endstream endobj 1066 0 obj 4994 endobj 1070 0 obj <> stream xœÝZmo7þnÜ0z@¡ ¢í’Ë}+’i/ r×&½Ô‡kÑ…lÉ–Yr-ÙŽÿýq†/3ÜYŽ›^/‡¢ÊšKg>óBr;,ruXÀþß“óƒ/Þª²><Û‡g¿(|}èÿ99?ü꺴¥mÊ»¢S‡G§n°:lôaÝš\éãóƒŸG*«F…ý?Ï4>+|·…Ê UÞf¥Ê»®T£7™nó®­ôèßÙ¸,›¼(šÑ7Y9z•õèÛ¬­mK;:ÊÆfôšÞfcå^¾¶²_ eþëÑ÷ðÂöé­éF_Ã8ìmeZIÊÅöçYWءڋÇoàéuæÇ¿;ú;˜l7ÙT*¯[kõÑÔ[Z9 ¡÷Ø¿—EÞ¨®sPþœeft™+ûÍØáÔV[8êÑÖB€ü ƒ/M‹–Öòu†v›rtÂǶ?4CÏë¬Ô¶_íÆ-í¸Fã¸Sû8º²R ‹ê &8±}¶œJ®Ü› ÌXÂ$Ôu…·N»t©þÆ­ÆEÔDžÛn¼í m‰/ý#tåoa¼UU•¨ª±vÒKS[ÕbÝêÜDü7´ØR;=bb¹â¥q/#¤gVô_@®k§Â6Ó ­Å•‚‘¦ö³¢ VxEWR­L?ˆqL]¯ÇV`U Ç±‘Él5ð ebæ±'i€UСd3Oø\ÈIØX•yUÚgg.;¤àÖ*$Œ]úÕ„¦GU"jSXQ°%Âç™ã—®m­›×Æ;ÒÞó Ê-£u\ «ÀOŠè§¼ƒØÇÍŒZ×Sk˜›síÕžyìXcCw$'g¼r>heh4Ê“Ëv>åǺv,±ö51}© @È #GEÁÔªp$‚78³.eKùª,|ô#qéñÏZJ4# :|×b]qûÌÈÎbã‚×\£ÐøYhKK“—ñþ¦ ôß©ê«5úe¿ïÃëhrÉÔƒ”±3Ì|"©³—ÔøXjœÄÆ)5.ÀÜÓ&³9¾Sar~”ÔXgX›gX:ž3}CG’ø—ˆEEQ2Ä—IÖõçQÎ*¶ý’Åžâ’è&W±û=\KþžE^-SAqVj\.ªÊEtj[l÷RþÝúnö2ò¨Œ„ôm'¤-Ç–&‡Æ÷±qÎè¦cÙøWz}ù1•晳y?nåiBãiìøkl»¡ŽÓ8áV’ÃÝ+ÈYKšMXcèH+°æø… w¸œË:uFâ{ÌS˜óÁ£)ÛÔûÂûûuWh($%þÞP+ë?–ÿ…XÉz’’s ®ÃâÅRZ H­ËŠÓý*°zà~ÇÑä÷ÑËœœ]±ÿaÿ./;•èÏpÙÁFf‰ÿPß(»U¹Ý7Ï'æf‘éûÝ+xd§ƒKþ·ýÌ[¦nvÜ™G?Iø]Â(e{9Óz] þ´þ½à¿»` MÛPÞ [©Î—õÂ2³÷©{ yp›¢Q-†qe°ÖÉ·RcâÛ6±†ÓˆÌ^ÝO8ÖwæÅ÷Ý÷˜æqÒ~–ëÏÚv¼¾KB˜+N»ÜÄ­Cj0S0åIccÇ<ž]Ûo91Ê…8¶7lP“ŠH#·ê ·#I,–â¢Õi1×ãŠ]̉f{j—M‘£BŒ* Ç 8C4TF줂ë—îlNS*,?„ qloØ'C*S¯$*,ÿo©Ð á'aÅ£¡®sÛ ‡[çš7TÙÍãÐÐhUí]´©„)1!9ÚºGüý½ñž)A¹ðDâÅ,Á5ÂùíÁÑ£ÐuðV߆­¥» І­d^r>¦4´Jx1¬ $ÐkH\z&™?“$mz> Ux·c¹yMißš<°žç{ò@σËd LÁ—&ƒÖžßM}6.Ù«‚¢ÔyÏ­ŠeÝ+ÛhC„Žv‘,NÜ$aÌò±L‘CßC™r$°óØF2?FshÙÖÑY¦1Áü”ôc©_,Q‹öÏÊüüLàã¥äm ׉„pâm’X¶–ãêF’ù˜”¿Jº [—´4o}êiØÎéDô±%IlHiª°Ö#Ð*&™óà,rH¼èZ¯¡÷ø9‚ŸqÜ— ïy“ȹyˆS­;è P’šJw²ì|¢s·¬âñኸVk#­kZ¦úxwÌ{V%\¼ÕiŠ\!íÓ/2Ù†Ñ>Ù‹IÛrv„ÎfVRÏ-Õ8i–g&pfvýì>§Œô›ôx¤ª‹(¦,CmÃÖÓá$PÍÕ3&uî©VzÛ,Ñä‰ðiGs¨TÞU•Æ[˜ ,áñœØÊ0.rUà—<6#Wdy[6º©’>üÙuiuWšl¬x~±aò¦©*Ø'yÓ¶º†[Ê2€‹G‹¬ÒîÛt^7µ†«ç8^Lvqà‹+I™®Æ/¬jÚà-?|Ú üMf'lŒ†[¯8ž‰ÚÂøÚ@Øše–ÜmkàA] »ÒÒ0Ý3HÄ3¸°.Øj˜Tè° wgeè<1«% ïeâ(ªí—{*Rk«*à£~_Á°8•,œ‡ÐÕ$ŸÆeê*±o(‰ÂORއ¤Áëu&jMæ§ „å]åD¨Á–e_…´¸·M ’%q’Hs±‡È3*VÄz~5`„/{…¼±'‘€áa¶Ôf{²æµÔ˜–â“È`Þ©$žÐ9m¦’ì?\‡tƒ MkyÁµî±ò”¼o\ ÕËÆÙž€#rKPfHÒ©Ô(VfûO—ù~€—‚à$_eL4å诱„$)7T€>ëå kø©Èû(•éĹ2åIœã)ñIÅÆ†Ô§es‘ªà,Ný1¹ˆ2«’nÈ:bøáÁ±´Êi‚A§í¸¡:14Ô›rxdõ&Sð*!ÏžùÊU¡M<HÁõ"]5ÚôïR‘¯àç;øy¶*®‹ÉÂÆÖ ËÜÖPVø»R<Èéè )T„Ÿ¸Æ•ÆœþœzcXl÷ ¾ÿIÒ0ÃÁãu’Ø©“°ò³d™b ‘Þ©¹y ¢Ó*wž¡YØK’3˜ÙƒÈœt¾¢Öïèñ9aõ’Z_P=ñQ6õþÏ$R‘¡bN·„iûëºEƒB(ÁyÌf>‰u=n (ϸ¬Mº_pÉ -ÛÌá'x6jFÜ~ƒö4íz–ˆ«…Jû y+y3ÛR$aèNfµëŸ^°ûÀ{haK1¬ß¤ †Þ†¶S÷pP¯çÄ9ÆCîdS ÄÐr÷žˆÝ´Mvñ-³À•î&F÷?ŒfSKlYJ=¥ƒÆ)íXˆ•Iw—Ì4QÏÝF†B&Ö¸i!óüü+T34C‘‹ï¿•Í×tÊúÌQ „æGðóUZ} þ~X‚z_¿¦Æ¿Ñ5 ¥Ï¨ÃÓØ¨¨ñò¶ùê¢=gò9Œ*vXWGƒGÈ!ôþ[/¬ôÌÕ==&Ï%®’'L)ˆT¿–†ŸH1/)«|”ZçÅÑÁ?íÿÙæ»­endstream endobj 1071 0 obj 3105 endobj 1075 0 obj <> stream xœÍ[Y·~_øG ü¢é@ÓnÍf?ˆ-_r|$Ò‘!ùaïÝxwg½§ ÿ=¬*’UìæÌ® zH6Y¬úê«*rôó¢kÕ¢ƒ?ñ߃‹^)ã'7;Ýâdçç…Ý‹øÏÁÅâ“]bUhjÇnT‹ÝãzY-½pÞ¶J/v/vÞ.UÓ/ûðW7ý»_ÁkÞ¯cÛ»ðæîaý¢YÙå—jÇÑÛqùq£—kVz¹ íŸ5«ÔñªYݵ²¸@þ¶¡W[ÚäÀ7y®4…^~fý´‰_>…™ú0Æ.?oLÛuÆØåKèù>Âcu;ú_¾ÉàÓÀünùºY¹Ðªõò‡F‡‡^+|a·ñßzÓhÚ¿Qc±Ýš~ô‹•éÚ!(ƒô¦ƒE”ÂíüÃå¨ñ7>oV}çQþ‡ÜÆý·¹ñ4ŒuÃr/7ÞÆÆ ÈóÜxįóÈ›bδæ:÷_rx¿W#*í¾˜*=žÓ£5~yWyÍ.Mn¥) Ò@}½³û§·bKbŸ5éoXГÜ]¬÷j3]Ç™üPjt®§KVsudÚåh–ûUå°r~âÖ“B–ô¸®*R˜â°P$h¯jæûZã9kïtCl<ä=ŸÍ v×|ÞªÍôkn|(ö6·Ø!o8 ߎ>ŒðËOxÀÇüø‚Çþ•[¿àÇWüø-ý´PÙJùq±ÒC«²s¾ ‚-¿‡ðñ]–ókøúçüñ/øPðñ>lz¢Á¾þ>~lVÞô˜kÅŠboÿ¥†Íëöæ>ꥷŸ—Æ0¼Îýkîg2A'ÑŽ5@¯› E_¾/Z+(¿á9{ÜT*·µ.vPÁþEÍ DÀŽ™IÀŽß×ø´°fõAMC—’Dç¶8«¼aÌ>F&÷¯j„u^ÕêŬÔsYÀB£‡ðeÊx‚^«°•Ö½š‚…_&žÑYÔ¶êP—þ€B%€ZˆÈá¹U†* Á­4€7‰C‚C ^Û?Ì¡žî0w5ß((Rð;9ÌãaCØ[ìäŠí}]ÅÆÍìÆ ˜®k–­»Îïæ èÃGß?!‘©ª’èâqýÝVÕóKAHÉó‹µ*ÔsTh €ÿ:>¯I^ÛçQ ›mMÉ¿T·¯“ì*,ÂñV_{·ÄÏ&>6Úॽ–ÂÏ! öq ôTËñK‚ñ¯kÓ5.|\ƒXɩɇ«rÍ9nÎn”L.vùñeAŽ};¸N9ò(HýÑ.G%…òpØh`Hj œ¬‚|aâšíB ªêŒƒ)x7÷¿äþorãg3°d™pe滋(g2íYúŽa¤§]žÆ­Jûâºë¦‚¦º=yc">íoˆ–±ñ9K÷›xš“ò¨7H= V¦ô¶}<² (é( P샤¯#)åÞbWÕ ú’su†vY(°a~« ç † *ß”ÇÌ ùEÞñKß<Á»«àr7ÛÌQ+:‘î²kåéÎÊ»Î|Æ•àS(ïÃ<ú*« s“vÓ¬²È%_Z×»ÿƒœ¤šÄŸÕ¦?圄 @Äû*_ :¬'î¢hWv“H{Ù€aÍà[mÓ!QY«ÏCyŠ|ð ¬5‰dѤ³mÜ0nÙŠgÅ6·:\µä}Œiß0г¡Ž4ô‡ôèÿûJH¦~€Î üÁ™×t¦9²okÓ—ÇFs¸ ›œT!´žjJA,W3vª“ÍóÁ2 ¬¸¼<®¶»3—T5ñ˜¦æv^×Lúà …Þ4ùüŸ0ñs¤ßÐ '±•àò¼p·yÉä‰êª™¯lq(9?|½)NÈbã~Í %ÓÎó—jh=¨Yžu[ø­à|á˜\! [Ó:Ÿh¸þ{a ·ðJY=¾Ù®,8©Z‡ò¹ä]Í%&7©2ÏtÎöÛ/6‹Ü³VøäaS=ðJtqX³Ú¦3éYNW² ¿“Jë§WXëËx½­°ß¤Ó™“˜ÿ˜Õx4ƒ_DrRãéLa›2Ÿ´¥÷âß÷©'Júƒ;´aê3c†›ž•VªõbeU«²/¨Fµý`ƒH=õC˜H·½êÆ!õ†6òè^éÖ*8í6aÁBU•F"ªÕv”Õ~ HçZë@ciuÐâ0´ÖöË/›®´ê{ßW^¨»Öhå €H·]0†ïŸàSïq¦Pô ˜.,ÙYðÙµjèÔ0ÈÇ(œÒI8åèžf Sõ(5µkõ­ïzàx²|EÉjý`\/äü€_ýY]+#^YgÑYŽhÁòŠ3P½Æ\’î¡ðF1À‡ÜÜxd‡uÓƒ´€z\.¡a/<nœÂ¬qÚ`À%]ªÎÓ¸Ô†é –í˜8iTÂÖ‚Yö-Ž:×vÀz ÚaxÑŽzq6xç<ÊsäÐ9‹£4:®¼N¸>$< I/MÐxkv¸&Ût=ß_L9à—ŽŒ–€-)h> ì &p6©œÃ2"&zµHhQYƒp·^=&S{XÇÂE$f©…Zºs°8'§±Îà’3ØÇIôäHi!(#%Nÿh2]"'ÙÞÍ™°äÀä®+‹×96¹*H éŒà§-ìJÀ `ÀpžöTx‹°Í”Ñéµ£ðÕoóÏJVi’C’ódåá÷/`¥íŶQÉ@A1ZX;"ž&¿MÐ-ü9TðU~[ðʉq7©öd»xŒ÷YÐ ù¯Õ;M¥]ÜaIPÉ6@^xijS˜`–‰æ°~Œ¦,csP›HÕ¤=”îdXMÒcÂÞæñtÇu•“bA¤÷ˆ8èŒ8¡E´I&îK6Þa”龫™C] Ž ÝÚŠ, ¹WI¹8ΧŠYܾÆŠGB¡^¶9¡Ÿjr/CdÙ+X¶Àv-ÓáöÁ|è‘ÕàV#qqÙ=QxÏ)ºÁh%=Š@üÑ«Sõ„:^sÁ݇Ñ©"ËGzóƒ (m€0d´æ¸—BvÂJ1ƒh×4|\Öª¾ƒmQ.iÉr%ǵA>;J<b n”¨§Ó蟰ֳ$åPÀÐÿþá“’¹ý\ Ž,…(>@G?AQ°7›ïŒÅÝ2£½ #K g.œ¶ ùî:ñUtb–™`ã)¼`Óu3ßž¼*œZ §¼Èº<%ßV×G%–‰s\éåÓ²>K3å–zU*©¶é5þDuP™'sµ2M b‰2=äu¨ÛîhÄÉñJm:);Œe 8x¡ùu*B¢Ã¼­†§ô®ö†ðèû6Ãñdžlí _íHׄ6ú|™vÆŠœ9¯ 9×…©çÏä$€ŸM& {ÓAÉø1Ͻ+L—")m¾d5ŒjàÄÃ$òªU¹´ßU½*khS&#£Né9·r1KL,:Û Ôëé±.VâSŒRá-º•LmLJäU2M™tgr#ØÕv]ŽTùç`gñBàjöÑÑF‘ZWPY „‡±öÇë!;ñ”$h„‰Šß9æ ì{ ʺ4«s> º(yë._CD¢#΂çÒY_üú¤¼|ééT_ŸäT\ízÒö¦ c=êœYO.JÏËlnÍ“=sxß;&¨À&¸¶”Ue¨ÆN©»šçÝ ì‰©Ö{q©µWz4¸×|¿¥# ñ˜c=‡  &‹@§Ö:’:{ÉÆp§½æ˜þt„ʼnCâP"rê¢ÄØû•ñו¤8Vò`]Ì¿úÓ©¬yö³Ý¿‡?ÿ566®endstream endobj 1076 0 obj 3972 endobj 1080 0 obj <> stream xœåÙrÅõ]ÅG¨*¾“âÓËlJñaIR@Ћý Í’ƒ,ÛC*ÿž>kŸžEW2B¥TººÓÓÛ9}ösZßí7µÛoà‡ÿž<Ý{çsºýó{ÍþùÞw{_ïóŸ“§ûïB—!¤¦zlF·øx»ýÞïwC¬ß?|º÷ÍÆUí¦I¿uåñ»Çï[磫·y¿Š›¿V[¿ù¬¢_}ø¸Ú†8ÔãÐoþ^mãæóô`L»ù‹ôû¢ÚvuÓ¸fئ>ð5vÔýã*À£ƒqi“ãàü°y¯rð5Ž›Oåõ§•‡¦¡+Wö=® lþ/>L{汆ù±÷G2 >aû{ÕØ¤¡žvD/pCŸÉÚÿØ‹Îb/¶®î†„ÀÃSFZ›~CÕBï-¿Ý†¦îÝ8R'œÿ6x–iÇ4{ ç' ˆ°ðË*l®Ó<çé÷yµm7GéËÓô¦#ð cz Ø`¦!í3¡ƒÛCŸžZ¿ù1½é;š?·~_ƒz·yœ6p©k³TÓ%pMÓî¨ß5 l6‘þœÊÖaŸÉY"+hGpà%L«-m‹s?ÜȌǫtR8ðE>²‡•ôx; cjö´àYM['ÀÿÏ(c^\wvEôæ}BÖÖǧá/•˜.´§NŸzùð67úúiåñäÜæ!ØLËÏaô¡¡0GÜœhxq™vg'U æ-3::ß!M È[ê¶kf\ÄI ­@ „0@­O )š 1s™ó ò$‚­HHœë."ׇvh¾o€-TÒ4é¦Ýü»lû|<‡SøøOZ –ýNàã>.ïÂãÓrÊi¾R‚z¥¹ñXŸè·«üú…}-?iãYnLì;àj¿ùJߟä÷×Úx™­QUÔú¾Îïscš¾mF<Õ¯ï3ýms³ÇQ¨ÅJâw¥„røÃ0YÇÌ>ù }MëŸ2 ?Xq©_Ÿäaç¹õ"}™¿>Ò¾‹º ™ËuDˆ*)˜]bha1kž“ x $Ú½¹œ}d„Í‘þïX f¨.K~Àl$Æ>;”`GYc‹ªO&B‘À²*f!5ÆRýQuÀQtˆ„B=Áh„,£*†Ù8¢QâEòĸ"y¢Î'ªpµW²0²:kaíwïPü[ œ¶•† ÊŒ®7J“‡'¡cß{ >c¦ÒEî€[$Åx_ÕBú„ Bu¢ÒêJT Š9´õBŸ4÷%RÁv–•™ ææÐüM†ÈSG4ò6 îÑØ82皀 ͵‚ÙÁ” ´4Þ©×NË*•wÒlMåS66UhDy12ò8 ˆ¡ój©/ª¥rÅj*mÞ¢Jt‹B*œXH't.ª8}tk¶ ¡&Í(6äŒÚë r:÷|„6Ž­ó¦W&®‚NuEÓ°rÄnú@KÅ„!\”&ÌhZÒòÏ«ìªúS2@+*%³’Fkk@›±Vó;ø ö'ü¦ò…!Êý@è1õ„"òI¿£1/ÞÏ£ôœíÑtñ%ú p"I„€™“iò‡`]dŠ ¸‚ùŒ†ÀY˜^@1G«aïk5bÒIÖc¦³Ý6ÐYdÕ%Þ6RÖ6ÌtKô%§­ èFq+ùW!°ušÖøBç+Ĉày8ìíiiò·–ˆ³”ŸLZ>V "Î@Ú ÔJt›õh4GrÿÆ«Ô'ˆÇ“õ´¥C|P¡^겪z,2²Ô`§0†ˆnÇÁwiÒ´‘Ù›%iD+!Üéi-GBòX…» 5ô{ÑI¶¾¶q˜?‚¾`Kw›oI’Å4)RY’Ò±Q*û$) AUä°#ðda§ ¢4/‹ÜX~™–^‰°–vr{ b|ƒ–}.Ê&L!‘ÎÎÌçÌ(‰!,e‡žÌùABȇLá1ê°è´õ«Ôò€EîiðxNIJJ_L=h’©m‡5¸;H(öRϲì@õû¨ÈøR*S= êþê¶—_Ã.¥Mœ¡ÐÕ±#)]ĘNñB*+Ü.6S©UcÛ£ç¬6†!E§PF±‘‚[3‰Nr‚énlÔv@ulÔ·ÄA •6Ó\XD´•YÀLC„Á@ØZ4{Á2n7öñ!`ìÇŠ<§®Qm¢H½‹8XÃLNThÁ7Æúê, >ö=Fhæ²ÃÝÉâ"a´ªÊ"t2 Îp©NìB®Yš£+œ‡læ<ÎT&±B Yà´Ý” m'}Ä“p$7Õž õÉ®(À¼hîIÞ·kP§‹aÇ‚Sªa2®ÆQPÜž¬ 5ºO˜\®­ŽÆD©á$ƲËLA ¬[5S0(Ô«}Èýz&½²Æ¡ë”ÊâÅ‚qUPäuž{!´0á퇱ÖíÜ4ó4Å0$ ÌÙ™e'‰3 ·¾KÞnðY¦ÁÈŒNJ£ОNLœÇÕ™øèDBÀ(ð#ÉÝ#tlÝX3•¡¦bÁç‘ÜÝ„œÐ«–Köò“ÅZºŠúšG£C–°)^Y¥€q]%nNFÇØâ¡=N,šÞ Ï¢MÍÌððÒl÷’Íè6 r1g½Šn,=Ñ(ô0¥Xã‚L_’g«Á$@Q0„!›œd@•žµ+I²SYÇê>CL¢;¢›Ì"º‹J"Wy gäÌÄÁìÚ[ÌBz1p¥øº[Jm¢GÑdGäÈ’„Ré÷²¹:X²óW…›ÝÕÌÛ^Ü`…^»IXC…m˜ ¬BÚ±ZMü­ðî…ª?!äH*ø„cÓ>K1a ›S‘Õk´¢(¦»XòÝL' |!En¥Ô‚2! v—Æ@¾Îé›É’ÄÂ]ZG|Êx¾l»%|—üV¾÷idGH“àQßd¥ ù”¦ð´S·.Ûê%ËâãpÍ\å°i4’ÕAÙ®6ãÁ$jQ²@>[0¯1‚æ ©¿gœé?µ_læDè³fÃ4MR$+!b 󆧰qƒ¦³„À^Û\˜9rµq2å" ´•´Õï+–ßr´7s5Í 1JJiU(ª°5JŠ4|Whw¯( 0 ĶWQ}N'ùð¹Ïû}6„M`Èq/ê:]Œ²z£mÜÈ,¬X=ŠÕÉþæ DÐz”ÅÓDS a=g¬Š#ŒV-¶^_ŠóbˆõØ4°(1ˆ!1CE"í4ð×1äËñS–ƒKA/Èæ¼Õ³±ÃU–¼FvÝm,A,rL~‘ç€&Å3ÄÑÃt©×XÖt&´fe«±=7‰?ˆ±¾`«™ÌìÖu¿Ùeç*ØÌT$§[TJ2n9ˆ$[šD= QãŽYKºÚ‡q!ø©û(ä5ic6ï× yãì ¥ÐÖºÝ? mL¼;olx­ø&‰2„ö´…8y”½j޶E9¼6N˜nDOÃES7®¤­ÑÔ˜íÁžglZ1ú',ŒeF£®]Ñim ÆÝH³R§“áTâòÑ>a®1¡TÕ×[×íôY %ÚiHØvÔ$¬†óˆù˜ØD ÐiÜEâÏe­ôîȃHn p™ÔÒLš…dyw‹³6<€_ ¦[J-r•E{¯(…„8(EÌÌçnJK®QÑ€>Ã#»*¥À•å¿[ê¾ë'þ3+_ïPÚa?¨ã*3êóÒŽÖSîä~Å:‡ôk3Zøpðá+SAÑwM²‰·4âF»¼(ÂX51RˆºÜò>»Ð¦ú#Ïd ^B1•êeçýIì™5æž7E£ÌôýÒò—KƒÎ¤p­¤÷ÉÞáïŽSÄä~dœBmD“Pôbr±øæ—Çäë¡Oé’&Wjl»ö×Çáñº®òJw®Kz}| âêlQìÆõ⊫µçtY­iƲ$¹0Ë”U¾¢qRdÊ˺×ë²ô,IëÁ94³¤zÙ–ÿ0ì+wE€tíü;æHåÐ’÷q¿2ÇŒaÒà]û4K­YÅãLÜsÅ£¹ ¸xû‹ê«vñÕ¡ûVÙ}5“ú‹Â³Ø]‘9­–;æö”YB‰Û©k.u¨"*–Š•V ¶¯Eå-“Y3¹1tÛù|k¼Iäñm÷I†Óx½‘ÌbBTjÀ«á°ª¹t¡»á Ù ÁhoÈÞ+ª{ûꓱiíw9”ug!×T=ã’óÙ¼Ÿ{©ì»(j¶Šj­/\”À×hí¸D:¹‡AE Ë xi.#™(N› •x¥¾YºPÍNcX¸€ŠT`ÿJônVT*`&w¸S_­}‚jönÊ-7䣹Å^Úst·øˆnv³Õd«P&æûVèÄ®¨¼‘TlU!‰m™ ð«w|î]*Ù¤£ ¥0'ùŽÈRù¿*ÄlôåÆìÜåúµÛŽ“þñÄúMUÙŠ£ÿä² ±¦"ài‚Äi\ I»®˜]‡x?<Üûgúù/³…»Ðendstream endobj 1081 0 obj 4490 endobj 1085 0 obj <> stream xœ½ZYo¹~ü#ôæî`g¶IöE ¬³¶±lâÄ«lØ~Ð-cuxuÙò¯O<º93²†¥6Y,V}õU[n7K³Ýà?ù}p¾õýKãúí“ë­fûdëÏ-C·å×ÁùößvqJk`héo¶w·x±Ùìv?¶Kc·wÏ·ÞT¦îªþ·u÷n÷ï¸ltÙ2ï—]+waöOõ¢­~®ÍÒû±õÕ“ÚVÿª¶ÚÅñgõB¼¬Î6ËÆ´´Aÿ—ðÔ¶ÆÒ‰¯‚,a«‚Ô§µ|yŠ’:˜ÓVÏk·lçÚê|ò+þ€9®µK?zZ† ý#LÇå÷Õoõ¢‡Qk«×µ…5´`·[Zõª¶rþÜl 1ÀÂ5Ë>³njW]‚ô±©ÞÃâ ^€ÊWõ¢«ŽàÃ9<¤µ`¿¾£58rÈëðë)®;‚ïCSÝÕƒstmµÖ:©·útubÓ’kP »S{CxH„8[ØÎg¨²-»êPç éH·Qí×r´Š ;K ¦æã©nï«pc:ˆqÜ$j ÛuˆzÚ-Còñ6é<Ú[‹h›–¼IÄœé: ŒÞ â€9{££X=Ác4dž*ŽNÑŠ2D?[½é¡È-{µ`»¡«îñ´º¾Ã¸qd†hƒ‡#™7b ‘q"vém ²=š‚§‚}ØòH]F;GtÄ=$~£ŒMn'XdË;?²Þ^¡…p¢PD¤8 ‹^­|TœšªD(q¦'<ÄA¢³óÚr\g¦âl»¦'Ìj€Ù6'JÃVS¾ˆ'‡G-ñ”²¤5„ž=~‚ªüQ;† xÌ Šýid@×Ññ —ÁþªöÂq#If¦™R#ÚÏÕŽŠÁ/@ð”£po4[äÉBQýŽAÔŽ4í|ŒhpÆRV\E¨dÊo&T™œ<'¼ÀDs‰¿)NÎù9…Øãuò¤Ê$ļÕ\1Ò´¡'!ÍáÓDGûfN¦,ˆ¶à)&BnNˆ™Ñ¸,QVãc /|pP;ŒgãqˆweÁ¢<Ò²Ç2­P0Ð÷ÓŠÛ÷m`½‰R¹LŽs Ù AåÀÊ+ƒ³…´Pšî‘DžÔ!ʘød?à}ÜŒD£óé¢JN–³Ö¾„r©f!RÏŽder>8£ÿêcQ(˜ÌHË“|Då!€üëÖî_Þpe‚çõ†ŽB .o$ À)¤5C‰ªYk&È•B¯4ñ׿E6†ÌèiÑCØ–šŒ9ó óT«R„£¥îX&­+—œžC(Ô½Zº„òS’è%f/D‰ æ@x'•-CÖ*\1:=+÷\U›EÀÊ.-à³1ö¡tóñøZŽ5l‘C5 ˆº€F¯á…ÖgmiÔ9.÷ܺ!¯þ´øì»9Òþ£¥ù±!P?%ÛÔqÙ@™ô€¢Ð †ó +…Jä‹MôJL«´ÎIµMz‰I9Åð~бÝ;b©=>,&™éLz¡¤;»=†§ßÃÓǨ¶@Æ.@Ú¡¡X„)ÏȺŸb žt²»Þ°5Õ±O¥'/ÂÉ¥mhói/ê8]¤äÅ9dšPŘ•®@˜cÖ™,fݘu£ŽsXi‡• *Ìø˜ÔöäZ­¡býŧ™u“¤a ȬvÏŠ2·*‹Š åž•‡qXŽƒW|¡:+ûUŽm]±à<«ž×’íZ=%ŠÄê\k´Õ'4|ˆh>òqß`!\‰}HßÿÇJ‚¢[4ì†}å“騂Ž.€àB[³¾ 8Ánt4ÁíÉâKî¼>¨ÖZQcZ¶~9tÁòA¿k:"uŸ'Ùz#9G0ó‡ÁN UÑtÙ~eK%êîñ¯R”Âýƒ}Ú¡= À”úÛc,©÷²¶Oýâ³I{¹˜\°=ò¼Z°È®¨ŽŽhúÊ9oÚ qJ–¶´tkÞ)@g-µýÚË ÅCšjúÎÏÀ:ëw`ƒr j&‹)åð}›i“ˆG0¤`ìMm³ƒ‘@Êð†1ÔÌbýß–»‰#?n›`7›TØï`6bÔÇ·t›!È9Ø02ðØBy%D˜³€nïF6…rpZ‹ Q`;D OåB؇õ&”Úã ÜóUÌÛ°5xƒÂ›6߀9-ï'],¥µ!­Ô“YïWÆ&¾1Ø#LpZn“K¬Ò êXú†UzÞíÈKÐ ñK¼4„§7W×ì-?†ËG~eR¾®¢¶yEJž³á2°÷I·Öâv,3hA¢$æv~¹•ä ˜àò +­!.DL®Aµñ¾ˆ—CáÚBDXÏà±ñÖjÚÇØ0 ºoJy—UÍáöš¯ÆPòÛJŸj#ÄÍ­ÞÖzÇÛÏnVðÇìpX,´ T‘CÉÂTC¥0 ‰Äo¸¿  $»bãÛÉD«|ºK[<±2*r˜•n¤›¤â„öòY2æ{â$;ƒÛ­)DåÎ^¬3ï§MV¾H‡‚÷VôZ•èLË™RB0ÚÑ—¢Îøô¥¨­ð](h é´!%Þ (4=~\„ä_»†»ÆC½#Š#Væ9º;¹â̹sÞՋѼ@[‹Î6ülmý4j™ MìãÌE܃ïÃà ê­¯µ’8y“^,ëàIiðJ,À X²SZŽa"r#±CÒ}D±‰0»Wâu ¢¦Y¶^º šãµ×<ÑXÏ¢¬Ý0øJL@ø/˜àPÜ®Ý éuôÅAR…™gñãm1[]­…רž‹øÛÙ„ÄÈ8÷¢dNºÖU3ñÍîaÉ…é»ÂTS<Ë`¡Î¾+-: ƒ‰ÆGi§­¨;.ê*š<Êi&ŠCÉÿŸÀ†6»*4RÀIA½a#¤öS ™ ͽ,ƒŸ 6eæä€JÄ„¿ã˜SctÄÌ·˜ÒUèò1‹8i%]QŠÄ×äŽØ‰GžüAKi òik‘?dþ™Ÿ;ðª$èF‡ùrÆtaÐ~ cõ‰?‹–¼|ÅÓ&ŒÒm04˜¦eC Vµv²þX€mŸÆÑœºù¯2¸«Ëaú7ÿ{zœ“ÆyiÏëH?K–ÍI#a÷Îa=õlvÊ*svÅŸ£½Ž¢Ü¢\çö™A‘?²«Éi¿d‰‰§¥äôi§êà2ÒÏn*)¥§Æ¯å·§ª|—…Å$ â²<;ÌCM·—rÀ”e¥æšå®4XL|‡OÑ÷=mîÂö ÜcÑŸ Ê9_ÄÑßâÇßãÇ—qî3öÎEÓÜÇy‹î¹ÊN%sÕŒ_“«—91„³)»Ü„Áð²˜R¶@\¢)äÓüñ2|Ý “óy<ö"3± îÄÁ¦ {R¿£& Ç5aÄgyÂP÷ž•€tRÂDÊÁúvW2µz|—õµ†ô„‡EÈÜd¤5I(]·´…·‹åŠ2J8Þ§\z?I"]»gmÜúPŠnN%>ÉB&‚DSò¦µA|-&Ñö¿Š)O7ã¹UÙ,É’AW\z[2D^ň¤ëÒžŸSšT:_™5 g[EªLñ‘Òù3T¢¦ÛÀ*#þhòËEŒa0ÉØÑ¤EãcÎÃxº6•¤ê­è˜ìÞg}k]\ìòV9¢ý²Æo’±Ç´óC×…´nÙñ°J¸¸Xœ¤¨Tµ0 ÓNýJ: “ÃÏñÙ“hô¯,BÔ¹Ž~sçú*Ö‰Ù?Ílµ‘56‘ž)!7C»rÁænTgæÅì뤫 Ü ä@ŸsÜxŒB|“zIõÜþ©$‰œo¾©xýuþþ&&ýqöDÎð<Œ!â™W©Ã¿RÒœÞР¶~Ƥxú½ÄBG™YÖb¢…QÏ›lÑæ78?¡‰Ìõ¾¹)O}#ͦÁã™Ç&]MÝÒ=å†8{^âó³Ò¡£M®2ÄÌ­÷)ÔûÄ•˜nüzÇ~s5ð…¬j–‰|CË’%”Lt\ŒÛ+Y0Qí²°¨G0+jûlwëßðï?N¤Úendstream endobj 1086 0 obj 3470 endobj 1090 0 obj <> stream xœ½[Y“Åöó?b"ü ¬iu]ÝU8ü€‚ ,(0øa]¤]!-ÿzçYGwÏh%ÅÎÎöQ••õeæ—™¥Wë¾3ëÿÉﳫ[ß7¬Ÿ¼^õë'«W+C·×òëìÅúö1=2®mß ƒÖÇWü²YvF·>~±úisg»3]?ø7O·;ÛYkœÛœlû®aœÙ\Êåd7o¶¦ó6 ió¾%×ãæ×íÎcgaƒc9Õ¯cpÿ>þB%ñÝGƒ’„Ðy—âúøþêøãŸ6ÇÛ˜º!ÆÝÁ"GÈm^àÄ&Å"ôÆø´yއØ÷„DÑCQ0“Ã÷Ý;ÓÇÍg𒉽õÃæYy©z_çriܼÆË.yoE^o@™]êË›:3ôVå}¸õ¨­†ð›—Û‡¥õ†$¢¯ýˆWùöïxÍ‚4ns“ÀZw~ó^t]ŠÃæ#|ðùÖ¢8ÞÕ¢4Vu¯ƒzs² °LƒCÎñ!ߥÄsЋù§å& eà²ñ4 ŽƒÓ=Ç'byãÿ,N¾øUœRô ÕrïxõÍêÕÚ¹n $í|×ÎzØ…¸ö!FP,bóöÑêÖуõ›_¯­n=\›Õ­Ïñãö?ïÀ¯£»ë¿¬î­¿ÙÚV÷ŠZgÇ ótž±{P?û"àÿ 0 &ÆZàj¯ýæ&*|íºfÛ!WEv›ån«…ý ›Ç„€‘¯¡÷f[Ç+,ÆÀ)œóhÏî£%QXoõnGF¼bmF§ÁÑ|=ÖÉWÁpÿ cìí€zßÙ8âÒw€»ÐÎÏaõ§ð^" y…ô os…K½Ì8ß3ÑÒ9 ÔƒAã%46Hi—ªŸ —[‹«wÅ6itù¶MF€ÃT*m´Kóɪá9üÎafz( ,ØC&ü˜BF¤Æ…æ•-“vó J1«˜o9ÜÀÁöm;íÊ£¢‚]#­"<›÷|LǪg|w"¡Žm6™^©qQ4ž7p(;8  Èt#äÏ)²ôúy`·Ýc"… _”ž–Ä’WÞ᪠RäŠqñ¸Ù¸!É‚Ù/Ò&G0ÓqÆ‘Á–ÂØhèñ üÚÓJÏ@¢Œ'¢DÃÔ Ã×i㊯,A¹Ê:F‡•ï‘¢2T,≌Ös^0Ômêiº ÅàmKêü|«ÂÜÍŠÿ>_ÃåÇ‘Ì\ÀÉJ`l ]ô ¯é*ë¸fqëú9ˆt¾A2à”{v—V†Oê´tŸgxÖñ¯á´dáˆ0&'3§åüHJ8Ñ­¹¤=-0yÄAÉ ìÚgqß¾1NÐþßMäðÈyTCãí³­Cš„7„ÜlëQÚ±Ÿ» J}A³pqhnð™'$v¹EM^täìò„e¸ÁÐõ§‚.ˆâVÑ%[ìæ·­³"´hÛoþˡ鋋)›®"Ç@’”O3²Pæ^no~Ù:Rš«—«±´,_¬¬ò_¯YgÕÉÓÔ‚'Zjë±T£g¸r˜‹°ƒÆ÷9¼¦ F ˜uºè°ÔBy;‹EýÜÿ R¦^0rèû,+é¨ ¥2M€§Hiô¯ái#ÓÕS¼~Å$îk>IÏ,Ñõ\ãZ¾{Âk¢ÁŽ ƒÅÅVm…(†®")†ž³ÂÚà3f#r‰€èõ‡Dð÷²|ž¿Â)ÿoÆ£6Ø]£ƒ‹û–/$ZÔ‡9ò¦ÎV-éL’ä‹))-T3X2²·åÎhûÒ[­ƒíÆUÎZU©‹jti[]RÅIÖ|ÐãÜH0ÞËS.ïßâFëLªaEÑc× ÓAŒ0¼ò/M÷ðãGüxˆ_ãÇ·øqfï#)ððÕqæ;y燬ÚOñÏûøñ½<âƒàVyûN~üë¢ðùâƒrñ^¾øU¹x¬m\Lç'KÌÔ‡\*5EŸL4KbŠl»u\n KË9Æ_ÁÃ[LÐZ6Á*åg$”’_—+µœóíÞÔÌo€S%J‚¿o2µói³á¿ÂÕ_é •ÇIy§šô™Œ‹nN¬·1в6!àÏÞ”<-äúœKÙá`9Â…œ«Úc¦ˆëÁ‰vÂ<kHœƒðî*`Yòg.36§Át1×c­˜Æ)éMµ, sŸ³x~¦duÂuX-©†P„iPˆäVosªŽ[ܸު,)Ùk¦(t}Ú8HÇ ”n0_?™8AÜÈ„a$¶·\ˆ8'QÚá$o‹QoËèçN¤ª`´œCK¶êÆ@ùRõ|®Ò²ÒÓg’Æ!·u¦µÍ“$Ua•tZªÝŸtá¬_–›÷u?‚ŠØCãÐ~"-ïfÉ9 áí ‘%´„˜âì×øñ6hº¯¶$„Ú•”\âNŸ—Ìø§cC ¡†ˆ€ª,¥X?æ ª-Ћq¿¿pþ¿pR{¾È ¦r ÌOyu™—aº8f’{!´Ö„f­%s›pY +h¡'Õžæíº*ÏaÄ'wÅݘHgå¶o ô <] v¾à}fðá¥SÅÑ×5í:bùÀKÄö~\*Æ{5™Œ)»*ÐÊù̹´!àZí|(¯å½•š 9ytäiÿ.Z£PÁ¾ KBMNÒß™Sú!Íø¤_LŸÅøVž@Ëc0¼LUoÄ6P`¢·Ü3õŒô=ÆŽ0“ V üíþSF»³üµÀåΉŠE…XÍsÒ’¿}õÏÆ!úqÌEȪ]brý1{§Ê¬›Æ7Hå‡#73uì›õMc-g¯×¬?rº0NZv¹ó+»|¢ hâvöÐl˜X‚3<Òœte7X÷¼•ìgÔMxZ•ì“ÏÀ…°·›ûƒº(è3™FÕÅMr¹¹ÿ¢ú^m_i›B‡óÞÌ:'¼Çr¦{&óà£yáx˜@ EºìId*i¡R¤}*ŒÊ%?${è!ñ¦ú-ƪ»¥~]÷F‹ãлӪuL5 ix©©6¬qj T.kHhÉ0–Ná»ÆD†}ŠuÏ@‡Õr¨ÔwÚ&±ÊSY!Ì»C‰žrS²l»ß—i½±mÙ•‡Q/®ŒDšvù¹§E Oœ¬i¨gçÜ"*q“¦‡›e¸ÝT@ñ*Û@Ùø ®Õ3ÍzZ{2ÃhÒ¬{YjÇÓskbA‹ÿRO‰šLü^¸Àe"’÷z<°'„ðÄãõܵۓfŠö‘ õ¡í§´a•CMº^ÜyÕÒù¬£CÏPæ(`Q>o&!¹°Ÿno;㈒‘f/[’w¶Ðƒ‘B&d¢<ñ>w0ˆØ™¤iÓ Áe¨ªiЩĴ¯ÂZh¨)¢mšÕYÏ'pfùª›¥î×íܹ¨e&ž–`,e¥!4e%Më÷œ ÁÊEî°TýY+JZ®](¾Ë¦ÿ¦¢Ð¼S·iCj]¦è >âC†;ay¸ÅN6E@6>cw¿½ƒ·.¦â`OdþÞ RŽ%ïVuøóúy¢š¶ò°¯­uY"ñ¹ v®íTmè— CH¯…)‰¡û0穪Jv¸¯¦*¹õ²—–¹AØ›iűd«+¹IPº:V3/¦‰¼eMVp„ÑÒ”ópÿÁ„½¢“ƒ?tŠT§û3AeõpËPIwº• =þÓ:«Bä/¸57·õY€æ¨,‰:‚QÎïMi0J7•fŸ)ä3^|äèzu/x>oÁ/W{pCxhEÎÍH –?”ªÆ¡àH7 ¶d‚/V÷LÎéiÇ­J¨¨ÌåHw±Ç‚li‚*W‚ŽÖT,b˜HN« Ï™ ïMi{òVä0GÑP¿ËSáBD=óUíùÀ f㬼ššmŒÔ,+E 7 ü FùáÇÁÏPþä„…ãûU€ý.á:#ŽìVÑ%7;'U£D›jpïbRVËØÉÌÀ# Î5cê°Ð8"K5~è´¶kaÇëÿ€áþ|=ÎêÊ‹àðMÃCk ;Ô)Õé—C8áPšÎƒ ÕrÅËÖ§¤é¨^Î-çùª\¦„•ämÕR)åéËÓÂ[!f>–ŸA°"tÊñ¼ÿóXöVˆ¯À?ù¿‰}³úBðLãendstream endobj 1091 0 obj 4038 endobj 1095 0 obj <> stream xœ­\YoÇ~Wô#ˆvízúšÃ|H¶â32ذó@‰: K¤-R¶õïSgwõL/¹‚@ôîLŸÕU_}U]›ßú;êñòß'¯n½ÿÈ…áèùÅ­þèù­ßo9z}$ÿyòêèãcl<ÚÍý쎎ŸÝâÎîhôGÃwοºõÓÆui“àßÐ¥ÿÿ »MÁvóÓ°óÐñøÒmãæóÎíæyŠóæ£Îo¾í¶~sŒÏïw[}ñ¨Ûßïzi|ü·ë¶ã4ïæi Ö»^ØÇo¾ê<öƒ74Ø—øç£nî Cð0bØ<è< !nææ8«Suoª×/PzÒl© {§KWhd˜qUãæ|ä·xt¯àÛ„ª:Ã6Ö+ú›(|%ó*3Î@3Âgn{bµàD–Á3.zýBšú~7…Yuñ'iU'ELyùl0m"Q=ÎÇý¦¨×%öÃ)†Í]˜±Ìœà;t´b9 ž,ZɉüU ZèYð”¸ÃŸ»Ü7p Þà‹²®¬}¤TºoR«4O¼ý_»@ YÖvž ‚Ž™d'},öxß{úxF¯HÝd¡¾Ÿ*6Ý^¼XQ1—S,jBc¡Åâ?Ø.L2($Ãápy (ªg´8ÕsøÅ¢ÅÔd•æo:íÉœpfY%‰jùjp.ê5‚Õªvé¨oq¤Æ¹¿n9˜³ÇÉëCGÜ“Ñ=]¦¸_@¨C?>+Û;±1Ô‡ Ž:«ŒL¨C=ÇQgÇ«¡Q´Š¶[cÕ˜ìCt•wÐ'Rr‘XÀ‘á|*¯ÕæùA³µg7â Ð4~ÖšL„C ÄÏÆµFÏŽxþÝ)óèý0 ¬ñ¸0ÅHfx[Õ¥l¦>µÏQÚf0üZé$©àŠ×Í@AŽ¿¼uüŸ¯ {xÃÄ(Ý´å!UÊóÁ ®á3ÀƒìWd¡÷µ1e|@’0{ÂJ`Š› ¿:‘éáÎ=»õÐÏd3(VÇègöbF¦8ä_(–u@v‘’2Àž¨ö‰&fDBÊ^íL*¶–Aœßš#³0,6:x›ˆ”ÞÎݰËäiwÊ®DR'å#¹†•}¢…{‡sZP]ãj–»åÍßܤ‘d¼Fê8QWK”¢˜ÔoµÁÓk$,âÊ *M8å!й’†6¨§zG€­DG°YÅ%òfa±q=,Cƒƒ±^-lÆJz4Ú:ÏW™¦.‹¼‚s»”ã¥ð`ŽÁ2È–køÅ¬ƒ‡09ZÃu€ÜOD”†ªO,œÒšOã*Vüš»õnäÖ3ð–kÏ@úLªÕ'ËÀ‰å¢2!ô =%Õ²¡¤Âaú´>´à øž-ð_ž…%AXú‰›2‡¸¹‡[˜I‹Ôý—zœOý-ËD®ãZÝŽ©ó+´O8®¨D‰1õ>‡ Ūòê²tÆ¥$ò§ ¾šš¤vˆ8Ï{ÔDdftmááeèó½­9Iðqµø¥Z–(KÐŽÄRÃÝÒøèÄ-ñ óâ‘UdCtù=ÄæëNàƒ€¿}ßy›ß¸‹=GZve‡ŠQˆ• J±â·[ ½LŒÐäÿNjct!n>è$ñÜ\åzi˜zÇ"ûÿoðÏ×øç3üóþÁlËæGX}Ϲ àa)ô")xuŒÐ} ê/¤ùÌé;å€(Óî/sûó²þ³üð9Â~û"?¼,-_ÏrEw”?òÓҲÌþÆÒ¾mróN9_af!ººzßÁQJæÉÕ›»´ìPž•‡Ïïê'"‹ ´Ì?©Žâaþú½Ÿë‰•ñq½Á?¨í¨Œ¼D®m )ñ›×r\€”ž>Y?-kln±´<-/ìn`Ràâ4ls„Â*>ÞÒ¥j%g/VÊP:½,OË?oMÿ´:M9â­ý·„ÒÎ3f{›9FtJh”€ÉPQ¤ Ü@†Þb3¡-šyĶdøâ,£â(jÌì·í<¹„š¡½(±EC…½%&ês„ ×…:¼E¶¹ð$n÷–_/(lŒWÜM“ºÄL̪HãdE¬å0>óõ;œ´Òyšf‡ñ^&Û‡§ãp¸t]8b$ôþ¤x`4_\)JrÛMÚÊÑ»Å0[íYº#õ {Ââ•—Ë4_2SÐx"-ièØ2_±,y¾8Hõ¿©ûRö9Ò¨úñ*_(Q4Ê ???ßç"ÍRªÀêl‰™P¸áÛ…c!ËK’Žrøb ¸Úlc%ÏZL—6‡ò%æBù¦¶l³À4ß›)®¤)ÃàŒA–û’¯tÒûªèbZg,Dü –YYW^m}³¼Œ*H”c]15œ+d5Žž\dIÊìa5É;•þ=Úé2Ú6t•-¥6èXkaŠd»M‹­IédøŸ—Ñè@KónäìFéû”Ĉ­Š±Xd“uÄ´N½‡Ð4Úƒ²?ÙºödòhKÅ t³‚¥a¸D3õ U7‹‰fÍ€«ì€E‡ ,^Û}!ˆX§ßü‡RJ¨¤ïp-ŸŸ&–Á äv¾Êú˜‘¨èvCM«D^< ži&pCÄm¹=ÈnÍT?Uv*íî)Þð^jÜÿÚìS&ã8cÀ£nãB¡áxŽnnÅÜ+QÌ"‹{è±Ýθ=Š)E=±ß}·ä *ñì3j.}Á;ð ö°œXПZѧlÓ74Ûß kïG¡ÙÉ¥ø>ð"¾ê |ÊiÖêFo‘~ͦgr¤Ÿ‹£Å¦9)Mna”Oå ÇÜN…¿©³¾ä!çÙ™Ìl¹ïÿ4›Ié‹ùAê3-RµaÌàï×Õg€ÖJù†š’ßùP4qº7M¼_ '†ÝϽ脅‹>¨¨¯–wt[ueFŽ’¾·úp˜›?M(C<$ê9y83oÔÊ[1‚öQcDCˆÂê-V£âê…šÉÁåÎ&ñvÞ•8#ûʱŠl¨pR¸™æ[}¡&ZÓaƒ @¦’<“Ìëu aª„ ­„®Èã_7P²ëÆ—-€ç Eu>0¦<Ä;t|‘» #/•4Pºj­Y CóÖì¹q6tV_bÌÏH¢9ò¡@0#R­‘ã¶ÝÂkOê·_kÖn~§yé§CÏX¶¶t•Îä65Œ)³ :.1`Ìrà¶¹nT¡ϯ$ׯD6µ/‹9p‘G1wc¡Ù“Q%ñ/ÚV¨Óî‚ïÂǦúÚ$Œ3håQXoxëìÔâ¤>÷ 8˜ ¯Ó •x:'=Ö¡]œ–)…ë eà 3_ç:-Ž!SûuÚ!±þ0@ò¬<5[p¿Ãœg© Y]ðçÉ+q%f‹¤Jße]yXBŠFåÚŽ«Ðˆè!ÁJý5W.gJßÙ9'>þVl%y†ØY” çå:æ-׎¢Ò'Ü1꺠»+›úk™FæYL”É)éÁqÐ:®°uÌqcuRÅNõ¸ì¨šT‹½+Q!Ë£»ž[U9 ¹¬´Ÿ¹ƒ§W[SbQd‹Ò9ªóg1…v݈Z|Ñù€4÷¶(ä]eTõª Œuظ¸;4uçùÐM §ö¯ÐX0±¤ÿðÎdÊy¡6N®¯¸)òXÜd\‘UÈŠ%ÚÄI…~x XxœoÓÃ`S½Kв°S,³†aÏÅã<Ä6¢{'´ßíÒ©Ø>¥GØ%×ÏX°ºuŽªà6¡*¸)%¹ ÑG¾jï#ªÊyh‹k‰}è¦DF:+}NËǧð~P ,k Þ»u/7D:  ÝSdªŽA øúæ x8ú¾ô­ôÏ.€*ƒi˜î¯É2’uM8Ñv Þ !5/ÇB¿s3I!Œ© <„K…ÒAÉR¡š9Á^®ÝÌÅYÖ¬SK_ûa}ÍÆ˜CaÌt¿WœÅÒèæI±{SêÅÙ%oXËL5ÑaÎXréêÇjÙ‰,¤b'ÙTªä?åÚÕGÔœÓ&ÎS¹ÁZx´é)´v~ª“òÒ'ÆrDâ Y66ó/Õ"f­“»£Œ„÷¼,9øWaäʇ|ÚRïG÷ý2EÉÿÉ\‘44ÕÜšPxH²¶7$©uµ%?ÌÀÎo2 J"5«’.GÅ ß\„À•²Ÿ£ù¥Ç©Áݸ¿U Í¿ûHF§´(j”Kåì€äÈÜLG6ðfd~9÷¢H™º”‚Äݲþ§êöäÚ?Äò{£C©gÝn_gŽ^Ýõy;Lóv&ÜiÔüWƒŸJë”óTäiWAqŸ1WM}ÍæÆ¾ŽÀá;&lsF Žuän:‚È~­aÐՠƺ†O¯ 'Žëñ‘¡– –( «ÏtÒGÏD` 'þG(áßdzÌòfã¹›µ“ 8õ)ÙÏþR÷[TÙ>2ðT¢þc"¹öPäÅiר¦û+óÅÀ ÷£-ݸdW9Ù¢º±­lþðz)°ÜÇÅñæâfIC.l,•޶¶¼wVH¤Bl—x{BuÌÒÓ~ïÚDm•ox%>/˜‹Aƒ’© ÊE®8Ú?;*‡¨+fHÓ¤"%¤0¿*WAMœú=뛆3¬Á[~ŽD4›±\M–OeƒP È4&Ñ(tò…cTÔj•*d’ÁW-”Ãß~V÷šðöFôkåYS/ì(fª±DÉÒ¯µB2mW9+µÿ·F&z {U¯Érš Jƒ[Uòæ|ñ}8eå¿üå§iž·@iö15¢V½m¸`U/®ŒªÍU{ëˆsN·\#œÚÎÀµ?¨bšµ¾Çú¯AhÆŒÉÆÍY-Ì/ Œ1”ød•!ô¢&A‘RAx@ÎÈñÏÁ*Â5€·XÆUüh]©NT ê½´–åS¢ˆþühÝ©¹…ñÓTåUiAÞá\#vÚË›hqá ŸXEXçQ^¦Þ†@T¼æ%áÖ)*•šs•ì‰Þajâq®èK>%}½t©À“jÛñÒ®“~ëZ?äÿ”zܯ´f£’—š>è´œ÷QîTˆŒ–Ê_pˆÜïú•Ðxå¶Ë•0äß|%÷e%×W¼.ÞO!ÿ oy=°O­åÿ`ÀÜá%ë=LÚ<È?1,ÅBùbRc4x ÁP6ößÒ#'µù0?¹jN%³õœ¾Ôjöã©ÙFªÆ ›)ØÓ[O?¯Á¿,ö÷L~ã¶ßD©Êb²QMÓM}[³2BÆØ˜™ n¢.t™¸N/Ñ[WRìtÿøÖ¿áÿßCõendstream endobj 1096 0 obj 4531 endobj 1100 0 obj <> stream xœµZ[Ç~_ñ#6ÊÓ‘§ÓuëꎔÛ`À²cK$+Îòk/ˆ½™em“_Ÿs­:ÕÓ R„˜é®:uêœï\«~=zw8à?ù{rqð×g.Œ‡g7ÃáÙÁ¯Ž^ÊŸ“‹Ã¯ŽpÈàQ?³;<úå€'»ÃìÇ)öÎ]ü{ãºDÿûÎoýÝNƒë—6GÝ6nv[¿ù¾ ›§øå;üø²›‡ò2OƒŸvSêç98xí7Ϻ­Û<ï¶#qð|Š3> ðþA7Oš§ÎŽú õ'¸Ø¿:}aÆ åÿ}‹›ŒÎn2&×ìóèTö–àîn¶£·1½Ÿ·aè³›gžkþø?žântóçn›ü°ù;ÿ¡Oðã{уs¸’ }ðwG¹3E”HOÇ6 ™oðãüxVÖnÉ8|ô>>gÞC™·#Ù­s}Iýœæ‰%õ`ñ •üT~3c ,¼‚›ŸAÍ7¨Á[q#pø f˜hÒ%N’Ó¸9Æ7!à5°ò ÏñÅHSî))!Î ÆÍï8î5/A"C¶ˆÚ”™}üX°ô´b‰ŽHù§ÌwîÃa`ÐŽ éÎ1ü¼Ä}œZQæ!Lý¼B3g¢‰¤âˆ”dÄù ðøD׬H2Ä€"ÍÙ“xN&H8’|DðEy@nŠ›kà f{jŒ0:9¿¹‚^–ÇüK)£BÞ£„à%™åVv²-v€¢M#¡w¸ñLk“âBÇòÂ#S ^ø ¿ðb…½QPãRˆ(2è(ø nþÔysȇ.ö°iOŽų…:PuÊ $ßRFØ'7Ìü" Ÿ´ššrŸÃa ßçÑÍÓæ¢×<ÎÁgž‡5<å¼L?†oa]»ý&dzrèÇ„ž3¸†e`$Ƀ4“˸ó¡·…:ãP=¼àn'ÞtècœýH+ºÉί\žà³)‡Ñ²ÁSÐðo˜ešÒh¦ðâÞ!­úà;t,D2Y´hŸÈ*Qs§ª5Oú{Å6b&³ÆÇW4¯º”Ÿ™ºUò:¨ëªdÄÆåt |,¾e,ŽEL°R¼spsq°Ú©N#gs©¼vÐR á²§ßÐØñ =¹U,Ÿ#ÿ™æ¼ÑÅ÷dæ~šzÂbæôÙfÓ ÏI„Èu¢Qƒ Q[Ïf¤I™ì` 1û !9[;eyÕEj×uÓ'F*i„ž‡À‰ºyysR¾áNÎXÅÖûü· ¨“:¹ ‘Jë2ƒ‚XÁÝ¢a!¢§bgS‡ÏKøÁ 9Â7,jìð­ TY?é,0Ž»Ù 4‘>‡ ™©ÇŠ"m™Q·Ä‚®R8Õ7ƒ_UßöQ7l÷(?OVdÚÄãM Xªõ_ìsš}†Ûf cÝ-S•ܽù›úÖEZ5fv ²ÆO?¡SdÀ½®_/ù+¸!tMúô¼~½­_OëØŸëS°Ž8g]ã¬~}[ç]­¾._WÜ S·¶è2ÙŠ†pVãiAùž$ðéü€6rÌn‹ÑŒ`gèjüÌÀ»-nër‰ƒ—hµìßp‚‹~ÑÔ–\2uNQôT¿K ©5ŠèÐÞÔð•ó¿&/¼Tø^T=ãs¨lÆy ŸùD¹D¯>»?o9ƒ*(F§rWó… F?¬»dÚˆõ|ith§Æ%_!}–ÝÇ=;y¾É„ŽÅz¯»’E€ÊÀ …o–K&Dpò&'¼–\¿ ¡Dõ¬3dd E4á{P(¹Ûâ HâКFNû&—0¯0ÅU§Q|Y¯I°óL o`)8iù1ó¬»ìo\qIJ芕‘»£‰õ§:iœ)1h`‹ð<3 ¿ ¡'&|òº“å¯L\¶>)¨çy-¨›Ø2ÍÍ&‚ƒ{¢¹ëÌÈ@öZ,„ÔÞâºlOê\¢Uγ˜‚ÁÕìL%ðAÇrpKÑÌÇPR˜r^jŠ Vv[sÜÚ¼’vÎES ™$]L­Aÿ×PqF«ïGÑ®©à¸)XƒÉcåÚ·Qù¢ l¸aÅ`ƒKKâP1íbT„RÒ¤~…Fäwàw¯<»9iv‰ü°vÚÀÁg#ʆúÐÑ«³2ö…†NHëßvËòqó¸ÆnÕ‹E’©Õ€írOy3J·ƒÔ*ô5™Ô”ViÀkQõ¥ä‚®ÄÖ16=”ŠÉk‹jÊÞÒDZâJ©Øí­hþ( „à‡`ZZ5Ýе%¶íb×Èv¬fõ{$õ|ÔaWJ»'/€l‘(‘qŸÄmaÑ¥©-}én¤H1»P3Ý#0T~By¸==¥¸rJ^`Æu¦Gò¤9þ}éÐm“cQªéÞ8•TÃä\u[Mý"ÐÆ”tt¥ÖnRRÞÆ¸7@K·f´:[õqë,±Ç{Tè>#ΰ-aâÖ ò~É;êóWÎ.d¯‚ZßJѽbPÑùl5³YìeEÈUé p)m±Bõ•$Ü}XOãîÛ„òTT‡T]K“÷¨ŒÓOV–éd×ø*mLw)k¦‡™ÀÌ!K4”a%„׌‡ÜR œ 5‰–$…Œ !“i^µÉ‹È°ù)º,¬œÛ”Ëf¼L¿¶9÷ÇŠ`µM•²ÔT4>¾€h˜–ÕôZ]6C¤&Ç1³Ÿ[u6*\ò`?u0ÏAFjÐé{Ó0pƺH'‘úÈŽá¥zQÝP¶•µÖæÀÉ@Ì+æÒèÂç)R;U|®…`…Y ï#àÈì7MЉ˜Û Ó‡Rƒ8{¼!-%HÝib1gÔUp¼SÓƒ¾dÙcøþ\Èp?2¥fÞÛÀßF2醭G¤e ¹CR..KÎ?Ø©à~á(Çù.mEw"¾¤FŽ×æÄcŒD¯¤&ö|S”fŽ×Žª"ž+;¾Í‡eúã‚¢]uãaFºMv°ìʱ3ÊxªfÎó¨ZŒ³ªZ cŒÅƒ°gÝϧÊÑâ ê´kÓ: Ù“ªI#WÚYSª˜™ C\mªu9;%뾞ôž潕µ«IâN"!`»ælé^î;ù2¤½}6G•``ˆíÃe±´ÙKw{_;M3ÏY3Gn|a%D‹‘èqs$À §§\ò„:ôZeÜ7C¡aï‹÷aÖƒÌûí° ÓÜŸ÷ë*ìx•?ðÝ»¶'G ¼.L^ò*/ËÓK£>tøí¹ÒÑ#X9i%ú¯ÊüzÚkŸìŽD‘¢q¬4éc9.r" ›–ªÐºiz§i˜4H¡4Aª¨tèï+óu_wîb.@`êùXÊ¢ilëü`Úèmm­H¥ƒnO7ýµKMü©g»<^Þã!©Ÿ[)Ýö[¨ ¬[ŽÉ1øìawnîÐɹï§Ý³L\âã&”¦õÛ!8ÛÔŽ|c‹ÕÖ‚—ƒÈ}ÍL륛IwÊìí GÃHæaÚ2ö®8|ùŒoƒ^ñóTxï;-D¥R¯ˆh/Žñ[^ùè;{¦Ý^y’#Ú~k#k)~1½(›K’w:{ä,®ÂÕÃf9ðX»åö5;CÓ©÷_›ŽfLž#QÑ›IAƒ9>Ä!Ô™T;׌לU‰é=<:ø'üûÖ×àÔendstream endobj 1101 0 obj 3476 endobj 1105 0 obj <> stream xœµÙrGrŸ'øˆ~ìÞ ›®³«á!Èæ0Zãt‚vÑ$@ãß<êê™!9L(ÔÓS•••WåUó©ê;Qõø>÷Žg÷^ e«÷³¾z?û44]…½ãêþA´€¡Î÷^TóÃ/Õ +ët'd5?ž½©Ecjÿ®1ïæ¿à2§ÊeÒÙNÂÂù>¯7­®7¢óÞi_¯5²ÞjZYÏq|£iãÄ˦U²ïz¡ ?þwM;8ßyg ºëaÒâY?m$®ƒBökï•’€QÕƒJéz3#4RÔ¯šÖºa5TBwJ[‰ü´ÌP«únÞ3_X2ƒ&réÍ @°ìŒèýPk` ä ›ÃÞÎÁ§µõiZrŽ|÷¦w¦>n@IC/†¡Þå ¨4õG }PsrC7¨~¨`z°Â;^c½’C}†\(-¬†E´»‘–õ%¼ôZ9‹[å$‰÷U^òGÓö°‹’ „“F PñP®Jˆ®2`ÑØRhûÉlþï7¬×MkiKiH}— R ðV!ÉUÔ;$ö0a¾U$œ^ ~€6$JH´"½B0I`{€‡NPѨ@Uâ§0FÙ¶ÑLwÃÿ?2Š]xõøȵõ>“®ë;ør¿í33 GBuÁ(<(·Dví÷8m”«¿¢,.²ÿÔS `BÃB ó¶—lasä¬[iŸ'øu D{œ«®Hâ>Näs|¬§Õ¿LïæÍO§D¼“?–/¥Bít4_k”¡ÝAó™”&OnÇ0‰À i¤+Ã)Ñ%ƒ"c˜c`^ò¥Qü‚w1ÉS+Q‡ ,2D»XÒ¬r=YÒŠTˆr…v¦,;µp)3tKI†TŒI)·¹!-ÖSpÞmPØ ¬S»XZpžÙ9'p{ ¹âÿ0u,ò. <6–qõ€¼š¸Ú8Z 0’M{À$^b®ÖŌӲ`2Hè4²ÀN¨™ÏœûJY@ ä,,ó¬O'¶9]l×m:\ÈüÛ4ú8XÒ”´…øzAy÷ƒ0ÇÉ3 KĬN&BQƒ“š&ƒÊ¤ïéë¾2¶G :{°·ç˜×n§šn«q”æsˆî- úaãÉç˜d½$ëˆôfu}ÀIE“»ÑVéUz—í#¹ô¼š¬h'š™ `Ê…`‹Q*Ѧl4©hߢGûŽŒ£¬óQL¼¨xF±° 3 Co„$ªB½u¸tH=ä™ó,T{éH´Yý¡>ÝÊ¥j°j Ö‰J“¡ýb[TÁãÚ¶enÉ”ŒwÌô(ôX±y-‘L…Ù5ÓÅ1¿/<þõe±ÉeñšÀ“WÃÅëd±|e¨’Â*ó2”Ä€Þ{àøú¾a½Ÿ§Ä„ª€ÆNSÚž…‚ƒÈ=n¶1Ÿ½˜}ª”"ké+°«„1}']!;ë°Ñrsvoóiuyþù`vï·JÌî=ÆÇý­uøØ|Pýk¶±Y½¸m S§+4ÇMäá ý¾ iŽÃÀjz½&:<½~€´³$øH'ެܩx’Âèç‘õ´ôˆ<‡ ŠÏã¤ì£à,Q¡àÕ}éINyÁØ™ƒPx ¿´x4ü˜XÜ­à÷ØC‚Epž¦Üî,£O1½8иx7ˆáÃ1¾ËVJKXããbœáÒUÁ‘ŒmEÄ‘ÆUS ~ÁþàTc@ÃM"˜ÒMF²£MøÛ{n £¾ä‚§9 ÞĆ>KÐK;d61þXÏS§!~}Èm£¸#lÖJŒ¸°lê°ÑIKKÐäÐ1K‰ñN6šäè©1¥!!,a0Ú+Ï] 8h#.ã4ƒ48µL¶› YGä÷%¸ËRªiÅ)+Ù U>jù8½¶…èhû›æ]¹Æ(íÎÊtî$j2`¶Þ•.GkÈ”œ«¤’ûèr4¸bÈ1q£Nêä%#W)«Ëc9©ûœ¢ä”Vóæ¬D÷ÿãystšJÖ¦´Uä#g™£ëô Ž6‚§-ÛZ 駬“:šG¡Ç‰ur)C¢S=†Ò2•3”]jLYj,`ÊÖ¯0ãÚE%‹Žed44QþÀß@Š=„˜R²ºž"lf(MŽ=G™ÄWyz0™Gšrï˜ù Þ&bÂh4%„£¤Ö&Ií'qN¯Çèï ³Šy.À(§uŠ<' ú,gBGœ„©056Ñ¡D¡|ÍL~ÈÚç¤ÈïQg>öʧ«’ u¹ŠÜ6f±ÊÏcŸ8u´òEÌÃÌ~&÷n(z‚ˆÆæWX‡Nmƒ|åX°ÊJC­‰–ãª`:ΰ†êv%yÛªV»äR3ï÷3#þäJþi¯ÅtÒ„k HÈ¡€DŠ#KG °pÍ2#ÍÊ¡»´2*׋›\¡Ù©Z¡¸‡*®Ë–ïÃ$ü U¾9»y. ç‹¢|­ 5ÜîjËs18Ò¸ë§ÍÕIŸ(X ò1ÅD<µ„éžþa†ÑâMÙ )gP˳g‘—TDÐΊ¸Åñ…˳X@AB …%ëvš7l4×xî‚Û·;öic¾$ed|öLM†®@QvRºï©ùr6JM¯Šôõ èþf=Ä£h]ôóŸ›å”¹Hӱˆe·È8ÈôÚ>gÅ,±W;KÑ!È]åŒC©`‰–%ùª›D@¯ù&]#róŸ¯Vb~º«@™V˜¯ó1¸ŸVÏÓjúúz´ZáÌ(Ê&0Ý/¬…5aõ«ØÎ·ƒÄD•*ØÎGÁ¢.¸ÍBµY¶’NÛqæ07Ô÷oÜÀ>™ê²•òåfð¨é} “*¶ã—Ø4¥SˆÑSÒùE“dÞˆó÷i_ôüѯã÷pŠßó)Ö.óUJîi_M±ž}—M9bSþ06“àK î5×Y­ûç­¦.:¿4ñl=‡‚a’Ë£0ïxH *–ƽ;q¯û&yσ»–X $ëýËÔÅ d߯ðåHBË—hü‹×§ÎHù[ ο6Òq\¿¹Ð‚;»ÁG›±“NíZï‚€øçÎÅ^n‡ò…èëëb“Ÿ-"ªƒ1Œr¡މ€ C‚{ÛNåx(…¶‰¹˜/;¶€ŠXõ4…û³…Ä9å~µ…ºL”ëѯdr',¤®þñÊBâ]„5̇é‡b²Bα QO5‹ø§5Îò8î‰T1£@Û´|w/9âc’ò7"¾IåB”Ê8²FÝÈùj!n©}¿c.S¹˜ê„  ¸ã[èÚ%l˜–;û÷±¥C¸@ ®ßžÇ^Ö(ÿ[*Løò£l..Ã+ï6©†Meœ¦¯lÜ@„$Å& [fÕüCtñõ+Y‰¸aÖ6¾ ¦Ì‹Ùÿ5—]endstream endobj 1106 0 obj 3060 endobj 1110 0 obj <> stream xœ¥Y[oÜD~ø+ñP±Æs³ÇHÿ¾ù¯®¼6&× nÞËm >S›p÷ZVסïF7M¼É3Ñ@wl6mÝ”Sn¶puÌÀ[lŽÚؼmשy_áÀ%ð÷Ö‡mÛ·ðö2¼zȪ#mÅ#çÍk i| ktÏ@ë¯p é…Lº€w(¤£½§ð¥‡½çJCxÐMkŸ&Ø›pqz|\2I8Üœñ‘>Çø€;bœÉl™ *á® (8Þw…Ç%—½c¡Vý»Ñ;Õ9‰^ìQ[šÕ£Ï?ÂN¤Ø¬ôð›/ðë@êS „ˆ¯Zݬð)uÌwB‘}ºPl$SV·&ªl™g-zM& +¸yå» Ã7¼ !ÎA\Pð³lʉ䓬wåöPéd–¾·DMΓùäŠê´à…„ª#JÎwÎæ ¸¥É³ $eà\T!<Ø|ò”ÑÖ÷FˆîóL^n‰øªxîÒø¼·Ž?®Î=2ò§ºƒ¸Nb˜9!b/LÊ·v¨¦è”"«¦~0gçvÝI 9±”÷nîþüp=1™ÙMEFæÊ |b;k2GÆ›íeyL”æ³ÿ(”Bg§"]/Ñ»Ñò€J©ìÉ=%#h΂T”Ù×ÿng=_—Ž´“ èäÉ¿«X,[ÊŒàs&¥ö"†fT Hì5KÄá¹U–èÚs¤>ðK&Õè×k$Î嘥úuH9kܱҒH’;=É/‰ùѼãQIʤÀò{r$o =ç‡Bi¶št­¡©Ìó@âêÕSl“¢ sÈà)qaTG_P>R³ÏaŸS9§1@è1qÄ¢ô@“á–òè¼ZÜF1÷„TÀõŸ‹Ä_Q’pÍXTdÀ~h‚´9*}IöF{ ô¡Ÿ,'–(T¯åjÚ‡kø²Hº™JÉ@wrªPËY¦¸˜KG¥ãƺøt|,²óyÙû¨i œ­CÔ=-ùŽ—@* Ý÷)géµ(¨®nUêïÑ(òคÙAYI?×Þšª—\u?Ã\nf£M¥Òy/Ñöw£ *ûXü’è.-ÆÞˆKàD¾!¬FO‘×úÿµó)2ÚX_-Ñ›{èëÀ)•þÜLm‰]BÜXÎ.´úÍiQY±|°È°»±¤Þ¶‹“‹… 0`4L6YySxÛÜ]¡@‹fáŽâ9á=¾ù«¥î6‡‚Ƶ…ÆwؾëQËfª¶ËÈÈÀc=!ðb¬êdhí‹ù õtª–Œ=§²G2dÂ×´N}+o¸aq‡\¢~äñ Âe©.ÿ…" ®#¢‰ß©A¨•/& ûÅžG Ò¨ >X ÅÎ_¿i£‰¦hÅ…:(L§mó„Æã1a½0ö`!ý:‚Ä+.·J£ Œ5b—+‰]´U a eMd9W½;|E>ÝÞ\º®û'æ³ÎzÖ` zÑ?%1ˆG®cèI·ÖJ̱“è9%—-Uìç6«êÓ÷N먞RXî½’œ¬Ân·yŽê‘Ñc˜aƒeï«¢Ò‹TüFE‚JPk‚ú?‘±ÞЃ•P¤‹9OZж¨X`«è‹¤²å²!z÷Þ8ÝaE:AÔ-#ÜNÿgX‰n¢èT¥=™²vG8ms¯Ýï¿ÐФg =s# [µeÆ9 çì;+}vŽ`6/@ƒÝÊÔ‹A½ÕsKl]V¥ñNi…üäQGP{²Ðä÷¤¨Z/3µý“l®¶r—ƒÍwx˜2ñPÍ®ä­!öEi¤JÀ^, Eµ$Óò¸Å…FU¥ß^¿_Vgÿ.*ŽË:ðîi¢j¨oipW¤Ѓ›rĶЮïw§¾rê¶ÑÓ< €èt{Ò9Pe@—¬)™‹0+™h[d‹†üÅû­¶H#ßw.¿Ê²Œ(Y¨q° °> stream xœ]1O1 …÷ü ö;¹\2¶¨HP²ULEítCÅÿ—°‚²Kï½ïI¹@bäs½Ç%Üì%W8†çp ²Úp=ǶÃ#EL➺À8…oX`V¨­°(Œ%PhÂj›hz޵üÓVY ¾¥Xðž„{o¥ã†_(*×wŒ=Ŭ‰“”µß—)έsouMs2³:£øLêœ9kÙ“?êé_0gµÆŒw”M̹àÃoÜ{LœTðâduó¬þŸÝ¯6_ŸÜAendstream endobj 1116 0 obj 207 endobj 1120 0 obj <> stream xœ­[ÉrÇõføæÆ‡Ð¬½«¾’lZ”,‰Û’¸@!)@4ýõε–ž8¤ 3ݵdef½|™Uófc&»1øŸü=»8zð½õióò×#³yyôæÈÒëü9»Ø<<¡&óÆ™)%—6'/ޏ³ÝÌng¿9¹8úaûhwl'“BÎÛóݱ›œ³ÞoOwf29¦äíöJ·½ÞÙ)¸’Êö9|*Þ¤yûvwìçyr0€Å±¼ÏÖmœ£ÿ×É_U’0Íy¶(IŒSð%oNžüñ‡íœbž/Û×ð1OÉ·=ƒ9|ôÞ8(d, Í+˜.›É•²ý„´Ù¸¶á)|žýö„¤ Hö¦y Ñó*½KÐà5ô V¶—;W¦èüýmçҳŅè³ñe–÷.Z¸ËÅoÆáS6&Ê@s‚N—ø1›ÓöWlà‹ºð`Á*S1…^&›ŒÓ…ƒ\Öáqe(uâ¯ùŸŒ4êöÞLÆX“Ñ& ÿçóTrÂEE4DA=6ö`õR<÷{¾ °@ï oŠôšžBÔf44Å«å<(?Ô¡à, §ƒAs&ñ,~Í Ì(õíQ™z£L—¨×’£#hîödÅž”ê¤õ1)ÐÇ@£¼C}œãClq¶ƒÁKuŸ£L‰d:Õ…?çÉñÙåUïJžb?ynŽÃ_c“çÞ>ÃAQš{øá’¿y=_=CýETÍ{Ùf»®8g[8GCëRhŽ? #ãÁ»@¢Eu™À‘Áy¾Üi³jù}-’õÚœ§¬"œ öÊöX_àje¹ÇÖO1âÎÂUÓ2«Šà[˜3ùÅ©j›ž•¦iñ¯Nß°çΩ¼Êƒ¾ÁãyQnÈVUI«§¿¿6W¡åÀ8Gö4Œ|ÄéÐÿÞã š;$TWz©"cãÿÈè ~4 Q›t „\ú9od£ˆ±tËD7lvC0¤LKý‰ÜÈøÔPÀÙ“€¼héz>zÉó”» MæÈ²½qÀˆ¥ŸqlpðÝÎå=gwx·4|É&Ë0í/»ÂdÞèºçÕi²içÈmdyä6„K¸Êo±M¤Š¯€qÁþ KÆO Lpזܼ¶ó%ƒÌ€ƽU¬è>bD{œG1‡Zï¡Ã C0…Zuý_·N8ÙG›«'ÈVm½T9æ=#>‹’Gù¢.ý¹ÈY{Ò\Õc»îŸ Íl|u¢EôÉR]½aEÛh#ãè Q AÈm`Ë*Ù}adí÷jOœkð2'¬mmšSÙð&Jv~)$ñ²Ñ¹8Úãꯪ®(Ú0F‘ÏÚ¦†˜Lò ð‚°É¿A}}üSíaøÓ!7ÇG¯±7¶¥×…™vÖR¨uôjNÁ3àÆÂÑÞã´·Ãíg’«Ov¾4–ŸgÝøÑz˜Mßù=ª¢û~-.§Ü;Ü# Ú D`5ºzzÄÊâ0ÉW šØm" ªÀPµ7õ…ˆ´S w«³v²GÍ;÷ýVQõiíYé¿oÃ@Æ{ž­“«s"Qß‚™ljAD¦ª6Ló2¶âdc•±Y`‚q°\ÇŸâŒ]§h 0FdÀÍg·©6 õÓ1êv `ÝC–>{Ú×ÐÝfGÊœaê”™G`Õý´ÿ%‘Ë€Œô%7Íž#eu.ˆ—;o'ë˜6ˆ#¸dàÖ ’ }p ˜ƒ<³%£2Z[ÂmÙ&W©«7ÓlK9”ºÛQР®ï´õ+œ¢‘žÔ„xh 8_c¥3.°kÓØzˆ$c×ùRËMy¬nu‘•ä–Z)ñ¡M,á* ÊÂËHºanC4ÃFÔ®îXlG˜ØÍwÙo¯` …÷F2{ºí¬qŒ}òMyäK–”‘ m€•Z’Ô­b~˜«2Ö¦k1ddh f²Òq§V¦Š^pŠlȲ¿1‰¡Å›.J#áY¢§H>ìhÇ“hC( /`ÊNb¹Ÿ±S ]R°—Å Lêʉ\)’ÉôHŽ/2 ­ÎÝ2øàR!sÔ¡1(QXO{1åØÍV3µÁ™„HykÔå ˆ”ˆî¸¾¤j°{k*Òâ„*äðÑÒ 7£ª+ÿÒu|^=£ùÈÙʳ‹7“X¢îΫáŒp·FþEø§ WÔ0&F{¸å dwÆìîM$g‘ýï—;ß[ÃÖ8ݱ+Ölº²Ë<ÜíÓ°o›ÒéÕ?QÝŒgž–Œ¤B}†R¥[ŠvNÈé¾[?ô_õh^YjÏ.‡„ñ=J”F·c(cÈ¢pÑC–®Øäš¶é–e÷¸ Î0{…Ô~ ˜¤Ë9¢.IO¾)Ô÷zü’ø’gŠ:òð{ fÐÉBØûz×ÍÉ óMÅa{Düªuů5=’5… V¬Úä–,ãú%½ƒÐæ>­šCFà¯jß`ؾ(íw(Á}ܾÍÔ™R·…Bó } Áqt'”u,IÑ>Xá åŽ`gÕ#•üär_–¹%Ö‘²¢l¹h¥–š°¤ïš1ÏHí±Ü`Š~fù2׌ùr´W’¢f^Sý"¦t—âqé! þЂGüé-©e+´$eÞhIÇáa¹‹ºüûRêD’™6§iMN»¢Wñ-qRÊ{¥)35È é{ç„Q¹ïð  ª„/5¸uyÊ™„É®t5äý² ïcµ 'å’–íÔÖì]@Rc¥Q•C>Se% À:Ö)•ïuœï-—ýŒ­é™Çç!Iš} Iê“§ÃxYÇàež881ÉâUS)kA£)p&wgAVÀ_¿*±—PÞ£ZHL]áØa/y¾«\Ô­~X)J¸m–^Ø%þ÷÷X”v^sȯ٫éè>®¤î g½f Õ=†*öž0….k®Ú[-sì~ûã¶¶Cv….ëe±yœ#8Õ·ž*hK—úesŒF°Ú³\(/¹¬Š×œm´_Ù%c¡ v½#µÄóÔØÝ¼jĺÄ1¢ö0W~_±Mˆ’…ʃ4XúŽc*«Ÿ(v÷²Vté—èÃYmÇ”{KÍL*iS¶“˜¯âN¾°Cì]\Ö‰8|È,Ée›~qp¨Çqøô“ó¥¿É¡7åo/rIT9<å:‰BšÀ™-¯ Œ™PÉÝnºûZFçz­»ÆhÔ¿ô-ÉUô°Ò%Ï31¬zH¤e}Œ‘¶Ð2Yç:›³ëµ4µtHz"Ó¶'ÚÈò€ú\õ%?°èÐÂ88ÎFË^ot(¸¸KЙ`RÎõ‰7Ûå’ nËœõŽ_{xÞer\ 9þŠâ£Ò¡¥2ÝÅ.z@ßhÄúåQ‹ŠÜû™Dç†ûw¾©Šçõ†Äx«¬ Ì¿çPÖÅù+âCh+a ¼OZ`´¸¾Æ¬‚Yc¥p¯ºÊÈUƒ¹ÄQõîÿq¢Û#¾#=äµóâE²1°Ì½dD…d½·ž>³‹E`M5;¸Û™‚åk/ËÛýz‹‡3¶’„›îZÊäà«V!m?kÍ| °rªµ„¾ƒÂ9^=á³à¸ˆ£±[4nnž|£vÇ7¹,g¯T»ÿîè¿ö Ýendstream endobj 1121 0 obj 4166 endobj 1125 0 obj <> stream xœí\Ys·Î3+?bŸìÝ”w48$•[–mÆNâƒNÊe§\ŒVUæ!ñ’õïƒîF9–KZdâŠËåÕr ÑÝèãëÆ¾^´Z´ð_ú÷éÉÞ£¯•q‹{íâÅÞë=…·韧'‹à«â¥&´A-žïÑËjÑë…ó¶Qzqp²÷ýR­º¥‹ÿëU÷¯ƒ¿ÀkÞÈ×´îàÙvq°‰O?^­íò³•jBð6,?\éå—«µ^Àõ'«5ßøzµ6F5mÛãqðeïjâË/ʃ/ÆÇ”u46Œo_VnùÉÊÄ»ÆØå>O“žþfp8Ããr5gâÈ.Nò·8Ò?âÿOàEøã ÜÃÁÄÔñvüÖiàZ'fÔ<\'n¬MÛô*bÊåÊ,â{ËgqXWæá«]žÂµ ^[žE<‡¯I†Û‡ñÒÓ•éãB- ½{Ô]!ªõËÃ8xf:_­»å˸þE¼Ü·xã †´Snoàþzš&¼D†*…´øîË5\=‡Ò‘šé’žå?”ÞqXXÚéJ;¸¯Ë`D_¾"þX È´4/½ˆì¹\¿µKî+Û§§<ÆÏQ2‘ŠŸVFã· XQznùf¥ÓžÈCžÅ™»øxßëå° ‰8$"Hè$­½\áàqÞ£|;ƒ MÊ#×oÄk’†å!˧#uÀ‰5³b­LÓ¹VGª…òûj‰¬4QHÖjÐ-œð8Ns —<*H’tT>”Î5o;¼-5Úš¯²rœÀ>b»Q/póÂŽŠ{‰÷6…}Þ~ßæëOà5`²ŽKˆŠI„¡Æ\£°C:”µDpá5páŠé‚å ¹(!^õ=ïé)êëYõÎËŠÔâªYd§Ä(°O [ßõ8¯°OGEÛ›Ò.æ‘Îáù:¥ó–¥Ùâ¶¶švÜõªƒ/EŒWBÓl¨2i¨1]ð´V´½1ÎಣU1lŒÖÆö¸Å&÷ó¶­ìS¿²5!!&Sa:‹³Dmõ4@$Ç“ÑËäÀà‹×¬ä‘;¦¸nÇÁ†uR‡™Ò ‚ nl*ûW™¥´ß²ÚÚho©Ä¨5°¦ìy{&ØÕáâl&œy¦Lf!.=½XÆê¦Ji/”Þ<(æŠÊÚµ7Ôœ²V:Eë«­ÐsЩ³lTHve+Ÿ#jÜj?<—ÝHÖå]v*<ÖÕØÙ%¿…zh´‘’¥‘nç*‡(Ã*rPãѲnÎLÀh‹¼!·æúÆ8U¹5òÉ&©î¬ Í‹ ¸[3+XåxÏõAš1Úd³'ý•Aw¶ÝŠÄ1È©¥(ÅxØŠú†!s¨$#«¯…N~^ ƒ°ïVÉ·%~Ô–ê¾í«ždxflûbïàßc‰á`Ü·ñãSø€˜‰Åø”nü9‰üî—ïçWðéýìçbˆÛ©€RÁ>Zøˆ¯è"‚°|2$ŠƒüæQ1VÏÒ æ ûŸ–ûõtm@×ýE¾xVùŸt1î¯N·È§oòÅËòäy¾ørîõ6p ½m¢ëjéâi¹x)'šÈpͪ6ßùë[æp¿T¦BÛëF[Þ=WåöEE|þC¸tµÉ_ɘÑ@µ1èÄçðñ>¾‹jØâ‰l&ýÀGa¿Š•^ý€‹ø7ˆ£|õ.ç„HÞáï,æ‹_&æŸdì&˜Ÿ.¾)ÏòÅórq“/¾—¿½|Š>î­´èö«õÏpZéDºxŒTƒbŠøëI‘÷ )‰sMŸñ³Š ‚Šô©½R[¡ÇµÙ8`C@~›´#.ü%¬÷ü5Zñ„ jZݵ>™hÖ|ð’Å꺄ºc£تB^N±²"!}Û°µëû'7÷yÑ9C’}gºsA’­ˆæ5M™6ïó-¸'´½ewçMMæÿÖr4ËOò3Å~SvöQÞÂ(¼MÅ]Ü‚äÞg[çot /,ALªÂᔀ ›…*MIé<é ïÅKïfN*iIO¦tk¼'ÉZOb.Ò©ïS\¸6ªKÖ–&­rÈ›ƒ¶ŠS2Gp@¥l¹$Ä(WeÂqÖè RƒOWEgœ ®eHÚ×R:ï¸:à¤Âh O87Ð0ZaÊ™!Ƀh#ñS\Ón >À…a¾s˜r-rˆ gRµ”Ì –€—œCÚ’µ”T¶%)ìäLc3ÎcIi:-Â9\I”ÌŽ¢0ø³øÜÇy€oSŒ™Uûú‘€ e½%çàÄÄhôÞ£4Ã(¤íX&‘/VÝt.fåwÏ#8§fÑ[Âä`ê®SÒ™S&VLßTìê„èV$½¥ñ!ŪÅÛ‚é|ãX_&ˆxFÓÜÞÐ"±v(ÀÁÞ*‘Œ¤©&£„Úç†ùlJïqÞΦ)Hƒ††«1wKÍ1g¶6 g>äYP‡ø®@®ŒÌw1§$´IršmgŒ¿çwaf˜êÉÁÞW{¯Æ ËÛÅÌ¡êzÛh¿°.ªyü÷éÉÞGû{öÿº¸<¿z¶÷èŸ µ÷è3øøèËÇñŸý¿Û{²¿øê¶ÅåÚ¦QMï¨^€Æ%k9¥åvžPß¹‡!Ô‡ŠÌʺΒ§Û®ÌìÞÉÓ-â(’‘ ¡\nç¨eó¨›"ùÊôZvoˆ\DÃõ ÞH Énáü m#<«tö¤¸@$쓼¯rñ…œÛ~ågàOD4Pê’öÜì,ÃîÀ’@?¹•“íµöwÚΈ¥9ÑáAôPð˜çÄTðg]¸Ñm§ï~dCþ6Z†‹9ì(?«= ïøì…¡L‘_•íŸYTÙ¯4dx"rˆ‹ò¨½y­f%;¹­„½ ¾¹«£ª|Tçñ]&"ù(áCоÊò|*CCe‰²‡dQÃ'\SíPžéÀ¶â¤¶#“¸\ÛK-GŸ”Äè¶+¼¦M& >;Œaùgâ7‡c­µó–$RÚ„\gDÜõeÊ€~„?ßä4¤<‚© Þ­’7ŠŸèf« ,‘;9û§qüèRÈY—äæÍT¾Wò˜Ë:“ÃdS~ø#%GÿuøƒÓ¨ë*%â¯Ç–¸’‹žHP· óeÈE–ãy~øÇüðOùîœD3j6ÉB‹u#å: +\Lñð\ÊÜNØ×¯ܺIºT(ÄPa G–IS9Ÿ«cÄíR?É’ÛäçžWÂ}©ŸLÉk3%…bsßþ&õ‘Ô­­ f³Rœ"Iý0?÷ì7©ÿú¤¾ë^?ÏÒÌpbñÔ+Ûê©g¹¨:ÕJéžO±«`y›RëørËR†7ûäM–Øqþvã>µ®÷R›©¥O]¼”Ûì]AñsMntÖÑgI7¸C`†+JÈ8D ƒT*FÚrîûƒâ.tæi0מI»æi5Ö7î!h™®iÝ ¹P]Ìa„›1½Ó¾¢p+úi[jû¡al $†INt«¶‡ d–¯Üy`¸ ­(yIv©ßÄWMoÊ¥ÚÒ0wL —wA;îœüá2ÖpJü"¤NkcÜ ;EÑ3¶©F¤éO#:Aƈe^F“˜R‰@fð„\YhsU4‡UJ¸ÔDSiA¹æ"㊔2c£áL¹•ˆz½jÐ$Ô·G†« Y²²Ñp+q^¶Ò¹‚Çä^¶?é¦ÂjÀ*÷¹Ýh 9}› žúFjZ£ w¤V4DÆæjˬ–uqw-ƒ†²lœaø^MÖ`¸)®Gz$‚WÃvG$²T,Æw˜Çªt”°Bщ0zÝÝ)ZÚÖV ámaæÛV‡x»Ä¨!ÔUh)tÚ)oЮåî³OU qÍòíÉŽkÛ80£°ukõ¸©j1¯èî”6Y‹ž"œšL…¶žáµÒR{L௿fë&Ĺ›ej-õè§‘ÅÚ˜*U7:r«,uŽ‹¦ýºý9âÒÝu…Ǧ…×ù•ôˆT¦žzвp‘+P÷4Ô‡QÉ{$i“°T H+zö îx.¤Éú!’~l2R9Š™’|ç«¶Cç«;…ÔýU)bÔƒ‘®…ZÅtà4O¤ Xé¹"{S‘¸c¥Ç‡îax‡*L¨Hœ ˜¦\èS.wnŒ¦ôTCuvÔ-zI*ÊôÚ‰¢¼¨Úò¥çUº”63x=(ò°þ?¯Á…d,Ê€XŒ.îä}±%Æ”NÅ6Ùà€“C&LµÁs8RG")1«"CgCªH$U´o.¢ ÍF*Ía%>uGpe(äê4â`6åàÕá t¥:N\ùRJF“¸aÕ(Û*w»ŽnªžôKï×Êšž¿)2´&Ë™È ”ôaâ8 ŸJ`¿-Bþª§Ÿ‹F–NŠÜ¶ô„-9P\ªkHY†ñ_®t Æ“G¶`WÄù‘‰òÛ®ñ*j’=ct=Q;Ä”ÐàÌVœ¢¹ê¦ü÷U_¤A¥Íè‘@DJtûÀÈR·èð¢l?ûy¦ok7\\qƒßCâ^bøðejàk ]î‚€U(¦»ìúf5(¬¯¦ÔàpJd°,Y÷ÿ%€rL}ÁÿjáléâF5 Ò¥›ìŸ­Nsb2¤GÀI;á³Ê1œø¼ÉÍœ”öÊWÃAЙ£[]iJ)ÕÀfãñMØ™édÐ=l~ÌáÁ×!0×n0´t$Ç7ysÀkÝŸUÈåó‰ÑrŽc}íZ„¶¦²sЇiÔmŽ(œ9È—ßP£ 9Y×a²%( 穇-8ã³bé¬0jÜFYµæ¯é´aWdx²2ÐÁl#O0³JÈÔYh©QΠû2Ru0ZD©thÚÖ¾ïà±9“cªÓ2·Ùåª×ÖÖlûµeqg+Ñä˜2=Ùq<À»pÊ´U°ÁÇ»M7)Ö»- ©rñæT¡4´¶54@-¤ƒn¾¼9iqý¢–©=DØfçxxíf¢ºÙñÐ$B2fùÃ2óì÷™ ¢Û5è4™ZEàüÏÜgvhã†ôB/ájžïfQ”êxæôZeº÷¾–.®ÁW+™iÍ£Þ­0>j/ œVPwk†õ=†->´ñuëã[ߪ…÷ÉÞ¡VÅ­Ñ>­Jaýª"µ>pðà àÛ¶aeC‹¨ªƒÑµêV?Jñ*eV˜O9SçSx${x¨p|éw9¦ÞÕàt”Bß½½Þ·Y)Ñ%F–»Ó8Ѷǰý0È3GRËûî_8450(%™ç%Ò£ñe7šþLn´óø_L\ã«€+tn¢üÃq_åo]9¦‘º@§|­Càü¹vÅÁ h•Sꨲá™õeºá™çݰÊf€Ì’,3&Â1ŽS–1ÀÜm–¹35Œ+˜\×@Ù(TjéD´’mn,½zι¨IQÞ4´ÆÑFgñÈl­; ªeG™ÈSý°8ý¥_S°RI™!½EO½KG÷H™S¹‡XqçsßøÃ3½ ªldqb+ÿTM_ š@²Öɯà Ò ˆhÎwá¨pËôjþgND†6H%z•Ò"‚™ v©M¬Ø@%ÿZOúaœú7*5——Óó–còȲDË$`Yº%Ìß@5‡jÍ£ˆô£ÒEeÄŽe9P?y*h ÄM>ƒ|©íÖ»jY±qðèXÁŽŽ¸?îXì½Ss? t׆ÿ0¼t §‘noXQz§‚K ¾’­ìÏú*j3¹ùèWžm*58îp©Ê¼Š°è-ù\˜>‚£)}ËÈ„LQµ6{¶èÙF&næ—er›GÔçv­ Hg _kJ=(?’~à¡o:­fšW†E‡úôTbn\îH€ÇÔÖÌ`À”ßÊ’=Ìíã"”Ÿ­ Þ2Ù®j.©D‘¶òøâîø&ƒ'~7\†âœ޶µ£ˆñ¶0MŽD¤ÆUž¨ü–Q1Ý_íýɨVendstream endobj 1126 0 obj 4568 endobj 1130 0 obj <> stream xœ½\[“Çröóáß°ošQ0M×½Ú= 8G’0²CR8- Á. ÿz祲*«»gv@: ‚Ù™êêºdf}yíþåtÌéˆÿÊß'/Nî<4.ž^¼>O/N~91tù´üyòâôî#ì’4 Ó8™ÓG?žðÍæ4ÙÓ˜ý`ìé£'ßmÌ6l,ü¶vãèï.fMØ| M·;ßn§š½Ûü´ÿçvç\Æ1oþc»ó›/ðw¦ÉÁW·y°ÝÙÍ? ß=üòùÖCOããf·uøÍl¾„!¡wöwùúþek±)ÇÍ#ò>9Ñ0[i¤¥}ôåÉ£¿Û|Ƈ¬œ,: t(è'œ@›&Òn®¡eNÍKìÖ˜#r•d ùuN ig'ƒ×7¿nmfAéÈ|Ôßáqî\š,ÝyÕnyÝÎÎ3Áþüæ ü’èð‰„QlŽpr®´=ÃÅmq1 äñgùÉÖ%^BíHKÇ/8Ag„+ÎX:ñx ÷ $'Rl^ U›“%@Áõ]n‘ðÀ«!Á+S-á1ÞÎõ êf"‰!W3孥ɟâ¶%hM-pe—[‹w7»]fâ!ˆæÝ~F7ÁhŽP¹.äòi ††g&Zð Æ É~¬»Ç½îd³;ã†bÈ{¾…ûû 9Ä<Ç_€Óež·±e±Áó2ÑÄ Ûh5•PØ“.& °|’ÕgM*‘0GH<1Ý]ÆÀÇ+a,æ´¹'ÖÒÝ¿ÊÀ47LdÈ / ~>ÿÚäAõ¬È þÇ3N¨…ûºœ¤Â9SÁ–3…Ä\²7"H€žãÎ@;ÀöóT$úD u+½/è‚s¾ù"F¨áË‚zIº¬šˆ˜É]ŠØˆÄàŠ<,¨>x²‰þZf¯ëeu”žÖË,θ³¶ˆÛ[Ò;!I/nDLb8’¾x3‘v.òEDÝCD éù|[hðô€Ýyë7?o@ò‚D‹¡Üy9Ä„ø:ð‹-œnÝÑ;OÃü#‘Ô. @å€äyŸi¡ݼé磂ͨze{ˆì”¯„µeÍŸà `4Æ-ÛYá¥HRXqx—b|3¤0x0É\¯¯¶ ê¼E}6µIMúý¦vÓص ð÷ûm½„˵ÖXú¬Jf}d­#ƒ{?e¹$•®z ²‰Íd`šÀý§r@Ÿ3H€&û0ñ±±‚ÖrÀPžŠzrzQè÷SV"íx²1{Æèå<‹‹¬­”yª1[£Í:Ôe9ø %·CØ8ê¿‚ØÎ{bWÀMCuòr™Ü…’­(DÇì6Ò´SVŸJµTY¨‹-}Bžñ³Ó9A¡D€&‚ì€r¸UbßUnY39,på;@ƒ‚7=.O•ÒÏê ļqMC½‡A„ÈϬÚù‘^3Á"RìI¡ásœ$’šXŠÈ[¦©ù©ÑÀ» l$#°ÞÁÕ¿èÝ¡U1¦°3Šn&oF= ›<Ý¿""xtŠÅ³d…•ÑZ…i X®=Ê©#Â1 ©SüG–òh£Àsö<˽o·( ÙW>^+°)›7u?#*‹ ©;´Í^ù ;êùèiïˆÔ†hLˆƒª˜Mã¹ ãE On7ã=qÔ¶‡Gk¢¡Í2YE™Àçé=lìÊ!Fà#ÒüK¡*6R½pµ =º¡Ãi¨ðK–áB–:r"LefÙå VüØá3 c5f=P³‡ûeOffq÷"Õ;¥ñ6٪ŠÑuÞyõ;Ùn¯Á>R"ã&G"#¦ç”è§°¿Àʺ¢Òœ{)H¶Îw¶|”@ɼàÓÜ1¶–嘃 P®¬Xþ`@GKÞÞšP‡¥EÞJZß(3üë­¬šZ®YkM¦9`$x.[2†È ¨*ö ÓwfÖŠ0ÔHÖÿ¯ Îx,%Bb/‹ü޶šU1cBÐ/@oM¬+Þ€!ÉêÎbˆÂå*kÁ‰…Ë{A¬¹qêf©3‰H¯áŽ\g‡‚‚gvõ ~eAÉ3PLQS¾£0“ÞÓ¡\ìµÌÞÆ\òYT¥Â6ô?G2k'V}œñi†cg˜¦Á5`zÜhVüò¼0<×ð÷gä8“Onœ¢PŸ­µ?ÖdB-q&³ ºŽwÛãRçIÄ\–髯è"[+È'Öˆ¹à+ëaÝW Á(ÁˆÇõe·® ãH‚uaÒtü1—Ù$ô½' «á‡ª[í6%?Ä…;¯ 8Ü„¸ƒ¯Ù’@Ù(†Ú¼\£^]ôþ9ÞúµC“ƒsÒý]À€ðÞGG±ôßgMl–QYX T{š¯ ÂÝ÷Æí¬"ŠK=‘Å•#¾¹ñålãHx@«Û…í!ΆŽVÁ?;ÍÖª,fÕÈ0ÒûAâ’\>"´—bo=Ö`«¦ЀOÄ¡&b¸ÒÌŠûnÑÔE–2ÒQë¸KL*Å0›±Âßùvé~ßjbÔvÞk6%¬6“yøF{h«s­6 FGºîm\\É­•MŠF‹Htêal.P¬,²¬BzŽêÀk/µ”VÌc<*ȼ†ÍÖ v®‰õ@!Í<5 .^m]Fùvv%ì§YÝ+γ¦fß°v%쥑O9¸=eA¶ê³žó3;«H¿D•÷.çXŸ°ªðñEŽo3_Äç]‡U´Ó yô+~z™ºø”qÕm®òç½;I“Ѿ A[@6uÔj­ã)ge³cw¤x2Í×Òü°aZáO-B•ÔìãÄÖ'RƒkÀ©Íƒ&ý8Ïi^tqËû5T=€*íY¯q5°Ðù“úŒZLšMþ¨åïª;S×l¡–Lžì§|Qý•3ÊIOK^RÀyU”U4óÉ>Dq#rôWKDgÔ¡½9ŒÔƒY ž-òÇN&¥9{x8qì[âøop9Yãt†¶äˆý˜ÐËu°Ã ²¥ˆU†ù¼åS¿…û}CÔ騖Ym\¤A©Ëñ÷gxÇÀ9º°/£jMÈ=ºÔ6PrBéäŠýQÀ¸‹ÝyÎæôA¶Eö™z]“\Õ†’Ç)^g™Gœð 9zôöÆj¬ÂŒÅÒÍ’À¡a/޶¬ëœ;Û ©Zz‡ÃË—|Y\.e0×Ïåìßg¾¬#mš"®¦:öïiMôsiúüø;~`š–ÌÆÍ·øñ?¨Ë'Û]Ê>R¡Oš›Ðµqlƒn v„SJ¾«í¯[çàZ©Ó~Z¯?×V±4¾l¯(ÕFtOÇLo#ýÖU]Wë{e¤ëÖøJï§\Âi»Jt.‹… *îrLø¿ÿ‹÷+]¿Ä…ô¼ðˆÄÎnÂÃ¥è×Hk[£+$„/(ýs·V¡tÛõÇíúǵñûMkÝÕVÓ©˜‹[hz¶Æ•çkd»ªO4 -Øþ×võ“ÒPgõøÚúíΚ¨ˆ”ˆ=7ö§§UÀ,aø¢ë)ÐB »¯W`x=…f†úD"ùÆ(„† ^¥xµ–U}ŽªžÊãÀpl6áP¸½ç›]X¸4óT‹\Iº-=X˜„Vû)f/I1·|D+†Åª¶©eø…ÿ BGA$÷øñ²G¤¦\€ÐžB¾B—î7Ú= R–÷ªÄnÆYòcÝPndhÎÉò‰¯Î î+,0Õ{¨–)»þXlvJ}v½EÊÍk¡!mË7e)ïúÇ…˜Ëü¹ŽzøØ;Õ¹×;Û]r­†ÂÈê­òZ›køwŸ€–¬[‰·DTÔþ„²µe9YòªsÁŽ=)µöćDž»ê¢5jdh‚Ör*ñÝeé0«K)ã±Ã»î=:ùæä—Sç(§;ž‚´äSc09Xá`ª>yqr÷ÁÉ_¾yuýôäΟš“;÷ñãîß?ƒ?>?ý—“{N¿Ùÿ–‚aä-Æxœç ×,¢£Ì‹ý uÁþ9 lˆÝR;eÿC ×ÿŸ¿À± E¯p@{ÛžTÓ .ä£È×Þ½Y '7þ {³Ö ®ßÛ¢|´båþåúüç°ÂËg¬8NXlÌA“ÁúËUaQ…!ËJàææêr`ïŒÎão%¶®Ò"³'ûTlÝΙÏ*ª xTæS Ú ’›‡R•†S•^Ùu)7ÎxæY N‡–%íïµö]‹Ïð“.ËÄm‰KFn—¥¥ìÕ»EÙëMYÐÙSÏò¤ù>µÅÁ‰ßw¾ÙU®ƒùY?E-Ê »Zw|$úpU›ÝqUm¡UµÝߎC²céÕ1`TØ<‚óx@ƒñ.ïé7ôæ±¾µdæ>ƒÛ£K`õPX /cĭˆ/ë¸DŽ'NM…{íU'xÕ&]ýÖjÚ®j!9§ZAÿƒD›‚žÍ€”SÙBšº÷°´ÑW_³¢^ÎÒ®Ÿ—9M.5€#ÅÆäm%¥Ѐ,5€1«%·"=Uø5‘†1Ë[Q^@›F¤´ù§½ ŇðÞþÒS!³J9P~_J–è=?ºì™ßD¹s8/´®ûøÜ W #ìøŒË§üä”oÂð©Dú9;–¬¸Z¨+¯ØPˆIÏ^RˆäƒíM™ ¸áòìÕ ºÒGÓúS-Rœ˜Í¾JÙLï&ègÍõs•.OK\šHÕ`X!Ç> Rv*ƒÅ#Gô\ù¡òŠËWô0Lg®¬î@I‰§–Yf´èŒÖ‚­P˪ÈáãÌ]\-_©:¨dAîõïEa6Uƒ Le´ÿ)4Žím^C-ºîªZ½nBépÌDý@Âã6Ò¬œFÝúvK/ƒ)GbåMõ uµÇ¾9ù﯃Êendstream endobj 1131 0 obj 5298 endobj 1135 0 obj <> stream xœµ\isÇ‘õg„~Ä|Ó̆¦Ùuôåo„y™\ieðjmkÃÆE€KCiþ{Wž•Õ0é`€t×]Y/3_fÍ/«ºr«þñï“«ƒG?¸Ð®ÎoêÕùÁ/_¯ø×ÉÕêñ!‰.=ª†zp«ÃWTÙ­:¿jûX9¿:¼:øëÚmšu›~â¦ù¿Ãÿ‚j}°Õ¼o l½:u|–~¿ƒ© C¬=ôøv'ýÞäõ~ú3¾ÇõuŸ_ËÜ×ç0„yã†áZ,|žžÃomÁ »Nï¶ò|H|•ÆWGlàxËÿ¥y§Åp<XrßUÝ "o0 ˜¬òm.Þ-õ¥xQd9*x¢µMšIãø -Yã<Œ.tåí½¾¿ÐÅÐqòôÌŒ©õX8´8—õ—E/_BÝ @•U ÜB,–°[Y­ UÓÖžÖWQdª-¦ëuïñÉ,}Z×ÀРÉg‡ßü² ¡jÒ:ô+œ«b¿j±p óøåÁ£—ÿ½zÿîöìàÑO+wðèü÷ø»'é×˧«ß<{¹úþ¡ðãB¬šAa¨úHK–Сè¸ –ðr¸º×$a”™]¥Dù²Ã\o| ë:b=ˆr+¢ ‚ô\ˆ(ëêéùJçÚé»\H$ñèÖo6*~JRÎm¶4À6¯û)¼è`§}n¦ã`‡ûRª# )£'ÉáOF¶ÆNa,Ü1μoBlrH+6´rŒŽ Ï€«‹§½Ìèè,ÓY‚¡áAù1¿5ðšp3DZà—|°ê–š|›+0:qRœCÛ‚˜¡47C/§|æ Ä¡‰m´ÂàŠå±Ap£!AUÅ^Ø?hç·†öà+Ÿ ÑûÇ뛃ÃÿøkÒqIÂ`ŽìõYZùôþKEšz ÷ øáÖú–Ÿ6¸ý! ™ pÝ?¥7(•=èO|#@`*ýK%8ÙòÖ×¹X5÷°¾û¡×OÍBˆX×Rϡ֑Óû]®t¢oóØ?¡àÛ¹J7úðu~ø~îáN^˧Y} ;õ8«?:©¤^?mÒ9 Ô ($ z¬ Œº¤cä×ä€çGPñ5êk”©˜´ííH½BsèõÌ^B)?WÜ™+—ÖMtÛØi¢'Å“-3Ó,Z&Ila;{ç{<ß?¤VéȱIG ÑVŠ_ÂÆ»B(Ö£vš>¯>ÏN¯Ì“±eNáQAì àd®ˆl®kg:±›`ÓpÖ!£Žy›6»˜­½-M¿„&é¸ñ(;Ç€z8Ø]ƒs†ˆÇåVáJ Ùëè0©ì‘dm#—yžž‘©eŒ<=j­ê ¶FAÚK:šË^Ký«|Ò°?z f¬9j#|ôie}4ÂÁƒzV ?ü£À[‡hH¿Å¸ç¶’¼¢ÿ”[ún®dîóK}8 É’Áó¶Å¦åµ_–·˜Ä©¦À¹JE& ùVë²UÊÀˆMBÅB*=F+ª!íCÓqñ‚„4µö¡4¾ k”4®yëÙ «É K€æÌ,”Ò“¿€<‰ËÇ mšbí9C!K˜YUâo !=BÍ &²¼ó‘h­ÈŠÉÖèLë6ýç>d1 ¢êDl´‰P¢B„fÍUúu0–^¦Ç; u*k¶asu=,9!´N´Á*(âÜhz¹ÉÂ3(¥åæA£1«ÉÛ‘z*<Ö¡Æñ¶÷•;V‘"x’Ÿ/á íÓ,b⌥ühe¬=ÁèáA4z¬]p³ÚáXæ>H!ŽñÕŠPUØpˆ;—]Ùê9w–…δQÐ ohG– kZ ؉2‡ ¥0ÓLñ0Á†öʉe›Ï¨ã òf¢°»#¦Ö*é,¤†Ä¥}E)mâýRsMãY3Ç“$DØuÑŠ«·ø` <#¦\ Ö&y x¢kÔ˜U—†ùkœúÐ×÷qó!ÏtBlÉ1t,sÉÄ]ÁÍ<ð†hdÇ‘tb3(ö´Ôü>˜Šý§-›·hi´mÇstÙÆMZ£-<£xâK 1gÑÂÂÖlh Ç%…)£Ùrw„ÁΔ/Í Ãa–ܼ9 ùE%V1͹í–>C3£4[až2Ë®£=ÓÓ™ïP6"ˆK‡J"°¸Ñº†õƒ±n‰¯4j_´Ý ÓßbHËÝ"ÛPÊv~£<&2œÐÃÿµÖþ3ü÷“–Ã&ž¦ýÀàP‡¤&S‹QkwsÄfƒ]Žùȯ롕>éÃs,â»üð”IJâö¹ “©‰ÿ$úµ§_™ò¼°^îLùáÉÏy6WG¹Q7ñÖ>Ûî…<Þ¢¿M÷‰ ?…?=8©­Ý­ÆòÈÓÝ ™©yD+öÍ ¬„.fRáÍ¿¼§qè^?ÞÍ1_ä>óî*Xœé&ç »Î¿ÊrÄî^ I¯‹ÑÁÇz;»rï ¯.ew³eÏdªƒÚ²7”ß~ŽÉüÕ繋r‰ ˃&SòŒ‰äW‡º€/$DÀ ýÈû‘ÌÔßgIûQ*i‚FŸ“}Vd):¹[rßÏõ×s%oh=² }<7ÜS}x:'€§¢a2E _3ÙÜ[´i*Mä¸)ö{šè@…·ª'4ù#é묩ÉËÑlŠHaM´”„¡0Žˆ:(ƹcZÈ—ÁÏ"9©­K°[ZË Ù‡cQbÁÄP•ïsŠÑªb(×Ñ»@öI«¶°båkewyl0^É„hÕ}Z  ØÈS§Q66mŒ½eÎmõª@¡p³Y´“0D4÷Ž]½†ÎÝ ÍÓ*!â|#{g³8fZ—_±Ã&,lñ.[ÔH_“£ƒ|K‹[ Ftæ'E}P¬Ð³gŒt@.’£dù!q'éü·Ö囜7“…T{T§½pÙø…îÎs!ŠˆäÂ_–Ëì”"i Àê ý¬ŽØß1~ü+$@Rç &ÈiT˜FÎÌ´Aí÷“Í‚kÆh3Ë¥‹œÐ󼂮ÄŸ|œÄÁ"ÉW?Q4R¤€˜¨†»uN Ldhì­X€ÏЭ:æ%h)¬Ã,)i4 Zx±RKCeòƒB§XÚ€Nw­„y)6´CùÐsiꎗ,AìT>yãçJÞ JË>äv¤›Ÿ7*6€uDÑúI3¤.rQË(Ù0‰WLv°Ü«^¸cñÊ4 #ÁÅ®”hjë2]^1ÆÛ´ºKê¤Ìˆ¶I‘Fš(‘«2àŽp)cΣb"šS¡JEy¤a›¹¬8¬»:‘Ÿ¨|Ï£CMq—>:ZxëB™@5àyeÔ¨ÈqºcHc^ÎH‚·“t"Ì'F†ÐihƦai€¦ŽÆ]›hÁQrð¤ Ä4Šír”Ñ׊~üµ¦Š1‡ªÓ`H† ù ÎëxÎ~ àà8üނ÷(8Ÿº9»Z<{¿@Ïûr¸.%^±;-mI6st¬#HBvM6‘Ô(®÷%h¤gQð °Êv[íF}˜Ps±-`:WÌúºÌä5ªQï, Eö‹ìŒj.%p  ªêN3Œ C/ƒ¹Ez:³•íèŠLAK¸ö›\È“•MlrÊ Çpä8UR1!ŒÏO¡Re!î' `ª' fâè†( £Y&EbQ÷¥èÊ™|fùkÛ)ðqk¢©ã(}fÜk¿Ý»{¨Z‰}Ä\˜+Éè­MŽºZò=Þ*Ú#*ÌìsD‰{dFKŽï 6æ"]Z($±B±Ps CC—’ÞÌ Ö'MÞæ]éc±+"ÒY-âœg¸s- ‘ÔÓ0™ûzÐ2¬ Å&,‰n ù‚V½ÍJUï/ÙûP§™5HµÑKŠ$O.²ÝœÞp²É>àèÚ¨!ÕMvøÎ¥Â ~ñc>²TI,3‹$ER(åádÙKS¹”£Æ¯ùø¥••CSaÐm Ä ûï´)}øÚ ©ÏjD²«„¹„YÎh»2ÓÞr]elââ@Û/ƹõl`Š+~†x2‰*£Ä“Â|îa|–f,癜— Ó¡[%°NCñ˜g2TƒÉdpW5Üòô©é jÕ¸:!C›wàŠ9ò}Û×è†ðûKýt–>u­K"°…źiáx]µ¡Kº"MQú¹J]W»®£0iÚ§4öwMi;ÒÔ ÐÝTF‰{é³wm°%ê*çÐÕ®+ïû:ô¶£T6Ù›°22äÊHù=ß ›Ö5<À¦2×Q3mYÚ àd“'0¥M˜áLܽñÙšù0ƒ-ö&6ä[+rÚ´\é6TȾiuÙ¼–°elÔ#’Ü$ç3Ô^("hz&pô °$¬þ­ZPï«O¢o#ß^š£±6õ9^.×®À|ŸÆùŽ8”¯æšËj“Tfi;Ö„£ÄÒÉ|¹¸D6 ”­Íl©Oïˆ\\Øô60£Ì¿t •IР«ð' ò}ÛMˆŒ3pÉÄãè«3zsCséáxˆÊÂ…EÎ7Í,X¦!sn©ù: 1-PÍyU6ÒîqA„ÎÎË ][xj|á¢×ëj’ÿÝéL¦­×o–`‰Å¨6YrÄàbtŠMïÜ\ÓÖ¸ÒôïÌõ¸ýt—ØxÜ{¾ò¸]üæŽ0KEÀcµÇå^\¶;GCɕ֨ço¨W þ'I°™9ÌJéRóUÖ‰Ó+;E(ïþR•Ï ¯4VWz&fcPl¹?+«1Z-èÂ:ܧ}ްêG¢"äÙ\ß<Ê™o‘øýG²¦ìÝYW[ë­d&º6KX¢ÉŽ—t,ÓAf3‰ç¤ ÓÂÄœ)wçÍJ®KGM´oÆ7¼I1¹© @ÑÿöØR±¦ ^Rü`’cŒ¯ågh €Ìº#½ÇS,ñ«¸ýÏNžPóí»RñíÈf™AùæÿÁ îÎ|=ùöŒÔ„«8ÕÊ2tËFš¬$«â¾U¤òœdz€®™ £Ð³Ê¬Ç"V†dÕÚ)aX¬óe5kÕÜs·ptƒÐ4'ˆ¯ß…)4ü ÖD-2ÅIž†4U”lŽc¬£°0‚jÝd÷)‡fv.4 ÍFøø˜Jgä! ‰#rÇ<óhv–í<¦=%E©ªó’>ÒlÀ÷T´¸ÝøzÎ/î3S3ó^.fÄ¾Ö »ÿ#=T6h´,Ré»XúBtMÖùR8ª\ˆ;Ìo¿É—3þ(<(­dd]b~š‡gKŒUÌs>¸§[6jðK”H鬎®WÜeHO¥ÃéCÎÅØ‚¤LŒ¿cÀš\ÏÆ•éWwd_Î\ײÍôëàå®Øâž²J,á…®ã°|sú%&Iz |"$tþ¯æn"E”oÙ9’¼hþýÁ?¹D±Üendstream endobj 1136 0 obj 5506 endobj 1140 0 obj <> stream xœWÛrÜ6 }ßéôvú$u"U¼Š|ì%½M:mÓ}‹û°ÞulÏØ»M'õß )J»N;Û €ÀÁ@½[½ZøIÿw÷«¯^+ã×׫a}½z·R¼½Nÿv÷ëo6 †–ú8DµÞ¼]‰²Zzíƒí•^oîWoÕºFÓoßêÆóÿ. ª”k6mg›ŸÚN7¯ÚNõ1›—xïZÓ|‹Ý_ñçzû ˯ILþh;ÏúaPCÀb6ð]Û™!Ù%M¨æëÖ8zòªù!/‘бxöÍ÷­!ïä<>¦Rƒ¨Âß?7?#t«êЭS½ýfŸ"F¤®uîÒ.yÕ*Fú Ü&ÿà°«Ö6wôò@>ig›‹†¢Æ: ìè/¬öR#Iz4Í Ö®h Ý˳mÞÒ{³%/'pt•ç>"Ö[^K¡ÞÀ°%íl­Xÿ±Í Ï’#‚9CD”óD™ÁpÎáü¸¦ÿGúý»í܉¾¹'  ñqáHr•2\!~Ķc`“”5œx9zG-'48Åz˜D0^ûõ÷mּܴ–àŠ@–ôo&ËÇSÔÌxQ Ôˆ!Ñ‹1–AWì7)𠹡™0)¸N™ÞùAKŒ[’  ±¹`º®N„OpÌì˲m.ZZ ¢ód-FCt†.Ó‡øþDŠ#¹L#ŠŠN€™ÙhÆŽ!.™‚ÓÅ ðŒÝJV-Š|P“tvªr¾3qà³™Ö[q@¤ËCò„O2Ã× Þ¶f„‹šC ·2…dÌ\ïkª¤C/ñˆô¿ÇSU*è3<ä ÐyJÓ~J:Aê<¡´šƒ¤Œ}ŽDÈP„‰B9é¼I¡Å \Bí†@¦NH›ñNšZ£á»^H>âtºgV L*ƒ Á§ßçVqÇêôh a+ªZ–f¿rÛ Ñ"V¥AKpµpù¼ª#}]pê6±51sôb]¥’O\8Âi|¾ÖýÄT> <·öÓ†FÖó‘^\ŸQ5b±„ÆÄ¹R¾:(æÒV˜Com¦Ú#¯‡ÜsÐ@Ï•°zÁŸªS^_X”‚}¾¡=ÚI˯Í& Sj¹¢ÒÂ!½\Ùðù8Í]Ûª:ë™maœÀ1ïc—yðrÍsOÜá¹aí2w”†ño=¯xTÑHa¤yËÝŸÍ YšŠÔÚÀÚ¥H©áb8îĬT™9Y•¹>Óp2ôÚeKûZÅaXç§Æ}Ì]SJŽL>wÒ·9FÏNq‡½LD‹½Ó™h‰îÙÛCc.Q@¢>Ó3GAÝHO]tCÅ×%ög_Òû¡uè„:&‚HᘊU»H´œó£Öa«fù1ÅkK vϺ^bc0ohW)y;„HŠBÏIƒÈ-ô0u!ÄK,HN¯›ÍBÙV®N¡UxMf Ç×ÒÆÌxd§Q‡á@`åôT=²æW±©Ð^,}8ù ›l¼„‰ÍÌæ™‘DAãå€ÊÃÂÀ(àâ#“tìÇ2JKíÊôLÒÊY<Ó 7»p—Üé<òjrtÝᦧjÚ ´ Î$€%ßYiwÆPžfäËÖs󙓬* o‘o€*³iª2$ó—ñM¤ÞNŸ¢ úO@ëËó@YýŸÔ-z]u¥H·fÜSøR©bOνZm¾|#wò+þ¢ öXXªë^ÍëF&µ+Ÿq´$jmºÿ,n dx”¯„ç¦tbü¢y-Fdi–_)c¹ßOüLÖ:©:åXq“œÎ~¬Ô¼—ØçÍ—¿9kHM3³ðåfõ;ýü 1݉ƒendstream endobj 1141 0 obj 1444 endobj 1145 0 obj <> stream xœM½NÄ0„{?Å–vãÝu|q § @ˆŸÃ¢AT‡¸*ʼn÷—˜MrÊÉZÙÙ™ùFÊ™RdJvÖû8¹›k¡ÓŸKtrgdzLëuœè®™%3V±¦ÊÔ~ÝfÚ •!Gj“ûòz_–ùnOô:&Ò›7Qû{ºìÇZ‡\ýmÿ:ñÍöcè.Â!tªSÚÍ‚‰PE* þy3¾"ç²°Ya.þ>(TÕì/5«ûÃÊܰ߶À)È%/ }bF ÚGÛ´vU ¯^ذ±Ÿ16÷ŽóŒ^MJendstream endobj 1146 0 obj 226 endobj 1150 0 obj <> stream xœ[[sÅ}T~ƒÞØM¡eçº3ÅS ¡âT (•ȃ,Ù’ K2–/˜üùôez¦gw?I¦(áOßîÜzzNŸ>=úåxžÌñŒÿ•ϯ¾øÞ¸x|yw4_ýrdèñqùçüúø«Sze9¶ó£Ç§Ï¸±9^ìqXÜñéõÑÃ×㉙æèS®Æ;YkœÎÆyšSˆÑ™áUù:ÛáÍh&osÌÃ3ø”Ý—áõxâ–e²ÐÁ¾œKÆŽ?.Áý÷ôo2?-i18“&ïr:>ýûÑ龃>&k‚[`´yòÉŸi4›²^à bšç0\ãG“SÖ_þ/ºàœÕ_ÞPGs q¸„îã2c†â¼– M|ž²‰9·ø®Y¢Éðný¨^8#+…”¬Ì ûá?¹ì¼¬ÑØ€)ϙט'g+kCûá›Ñ O ÙpŠ¿ý0žDþ `}˜2,ö ¿<uÂð&Ÿ§y^"ÝÓÏ ¾¦Ù„á~Å—a®ž=‡×‡·Ð41s^Ž–~>@›è§œâp#à»w¸ªœ“GkZX:Z­<»ÀѼ¿À>8ìÌ€™à;š |¤™Åög½àäbžÐ@õÙ÷ ³ÆÖ‰—!¯v¦ó;™i¶¯ÚúoG4´ÍàÑùôüW5Z-‡¦‡KÇ]™èW¨_1)>ô‘ÍS|T¾… âÖ,‹U¯Ê@§bûò qÑš›à~X\04[à‘¥÷Ú±78›ú5~Ì9îçÍhqö)nz h™“bšã¦ðx¡…6>çb"Ë~Ú ÄΔÅç*\†HƦ‘ÑBo;4’óQ}; ö…ÕÞÔÆÝÇx¯JwØ‹ è‚';57bШØ‹äGä#i™*Ta'h[‡¦q3ZXN6Œ|É@(gÇw~¡p”!º&µ‹"•ïÎëwíé—ÐopÝ ;ŠE®zàîƒf(Y•Bù]W;+μr.²úÓ4Šîä=9Ñãܳu‹ò:ÚÚ/ xWŸD´s„/µOwžP¼À…ͽ¤ãÜ ƒf^ãm÷Ä×±tx­¸çصqì_¡ú€“ܺxç#Mû@xC»yž€÷W¼hK3;G¸Öž|4M£¥Ý,c˜<9;;’v¬.ÑZ"ÂõBëÄ]nF/µ¼Úëâ&ôD€éÿoìœ%l@>ñ¼Š~áÃÁà¿gÞéd[ê&âÖѰ•^µA'"¹œ ŠVCáW#ëÒâÈ–¹h#-°âŠ)Êg;?p(΄ÔÁE¶ëâ²³ejUã¿™M?¯ Àä–w[âvÒ5¨päˆÜ.¼¤ È苽Fm v)^u5rð %>À4‰:Ú E›/Ŧ hSn„–Ü´—½;Ð+ÈŒ|‚½OŽ ¦ˆN36¢pgÛ§uêÉyÙxΠú 7®û°0¼¯çGV ±ò¢ý^i8´È4ùÎÿc$§Û9äTfdEªê­ÁW6W‘–†»yàD Ô˹dÏÃI$·Wšµ­â”áuzÒÔ\òm×}߈ý†Ö³–Š:ç#Ž 2’ºMŸ#+ 4-å9/JNuÁäaS“X” ±Ý" Á$Œ\_ë™È[]JLû(!.-íªxy¦ã”ï].í±sü”\Î>°$ÂÞÓñ‘ªÃ3÷õSª ôQ(¹`⚆Ÿ†úþ# ‰R3|F¢"Záç’JtïUË£¯u°ÒåzÅu>Ã-5,àò\ Uæ¨1µgÅdˆ>ãz(ÕçÃÛ>Uªq>ú–‹ E†ŸFø (ÛF•/É÷4ãÚ¥ð¬&a×^OÌ-û¸Ç—…â› øÂŽTß5|ž•"±æÝ$ï®æS®2”m„wÜÄM”éØ! Þ¤ß ›Îs‚Ò)dI”Îå)&÷t'Ê)JB㟉ª#ª@×]Ëwœõ¶„5{Þ?âäît žàcNmž4îÓ©F݈…Cu¬ÊYÏ!Õ¢$ó¶f‘D»SêU(ÇýØf ±jÇMQiiI¤!ˆUnJ†ÁÞ _½h~L@…ÛquXhòO¿%øXtÓŽ[%ÕÚ±‹—‚ÄMôˆ}æønT|߃å*ád4wˆÍÑTä@œ©}øÀF›Í¥Wïw `3u8¸h7øìf÷I§¬²Ìþ`miPìÌ«%Q–jªð´D¢Ø°,pBBï*RL¡³#'çØU -€Ø…ÙË"šV”\„MìûÅô2–xYÝ 5õCÈÛÂå´šp!'C¦8­dü}¬PÃ㯿•ÌÒO15îX,°#ÿ"ÖH*O Ø“-ö8e¿a‘Dü1!é'îD’a(ßá ½K…–̾ʀ±“º (èIÀ&9qýf´MGSzœÀQ’k*ÆO€¾ë ¬nrÔ4ÆañàMŽ?…›NÁÌ@ݱTcˆv 1[Ÿ—ÆlÍB¨gr ˜ÏSt‹38»LìéLâ¬]LZh®“‰pß„¬ÏòBšÁ”ß±³¥‡o±‹-axí{íLôí»Ë:ýgðÖc“L6ìÏX¦ñ-MB&<€¦Û‰ÑùØÍâ ê2$ó™§dgÂnéwÄ·ÒÍ·£ÐË™8Ê€Þ=V©´žÐ¹©Z]Ò·AÈú”-ËÐýŠ&MÕ’"µ6šß`ŽüíyOÜè s}‰ÂÆ–úŠîém)[œØ"P)HYéë"ïú™–ÞÄÐP ^‘w,¡¥Y ý¯q”P+Ï©>/Idj™Â^Œ"»9:Ùíñm›x¡×X‰A*¨ ³RºpY;ЇBU–ÀÞߌïª3”Éà™p U[t&¼–?ƒ]dHN( $cŽÉL§MªŠLÍ`”#à#'ñ?KƒÒŠ÷hüyŽa·¸ƒ£Ù¥*U¯‰õ1ɪN³•Û븋W‘'¡,¶j±üRÒ驪˜ ñ£/‹5J,B„% =«ªM¥Rœ­s– ¬™ë*^Ξ¯*ô~ìššt3n2Á•ª_¾|1öê<ÍŽô^2,V;ç”Å·yÅm¼NŒW±ð¼ËS4sÈ´óýÙLÉFÈ"=i’-LH6Û.l–€EI#Ljñ@_µ`K/5’¤‚’ QX˜ÉÃaà iµCâÇ’ä*å4„X`Íä`~=uR~ä]w,“Þ²—Rrï¶à_Þ…”¨ km.L¾ sQ8Tœ\4â–+í†Öç1šzøl$€ÊYƒWÛqn·£Òð<ãÖ×mâ[“ލ.Y% ¬m伿ù-R¡×v}uxš Åè!öÒ'y••Õ›PI*,Ï[Vkú0)ù´ä+:ï}‰bIÕãWZþÇiƒ_•‘Øúí –÷«ü‹ÐÍï4ÚÈGöJtû¤NñõƬa†—†ï•^ÞRìoKw°†•"s½Ýñ’{|À6„ùû)6Š( 4¨"¥ªæ³\êݺ6°—7ªÇŠßpøôzþþðé S^L¨^MìgJö*Z ¼ …U óHågÆÊ(W ŸVï¡ÙI2¸6Õ ‘]R>ôï„«$…`øÏèÛÍå_«‹ÐåüQú)0^rŠªSk±ÞÆÐË+d#>¼¾Þzè/ÎX”™ßÇSê‚â,c•Q:r÷dv®ú,foIŠÁä/B¼Ók¬‹/–¢fkÑ_t°úÚPsAÍ„E„ØáÃ[!_Z–GˆÀÅ"]»¡tò±ò§IW{LÓPº'wyÖ‚júY+3RI4~ÇÏ›$qÇ@±v¨M&X×ÇTÙzUP>XÞ®¡Äù©«²ô H’a®Â«Œ|]t-ß߯ØÁ>X#ŠÏèèx>C¦Ñ•3v÷»Ji:ìò¼_ Ó,N$ÙInäÔòëï ³ü¤ˆ[~ZÓ´]p9 ‹¦½Ê€|Âç=Àçª@x2õžWÝÌ‚œ MV—ägG>ù°ç“P^ =¶Ã­P4Ô:¯òõ•ayñvç]eŒWÒ¾;Æ… ö²¨nzIÝ-«[')W®Œ@|꓾žT•¡W1wï¾æupÈÞQ5‹%¤Ü½r³ÕÌ2wØdÓ¸½ÚU®Œ¾ÇÓ—J™¼Zß{ÑWæèv`®eÓTÑrXQw®—& í%Aœ.ؤø@ØÂ»m¹†Å³™Ó̾šàS(Äÿ”%è*ƒ‚¹€ÛH"øð»1PÒ݈×¥¥¾•­Q©gË JŒ®þDj¼}Œ?…r‹i’5WÚ)¹¼59 éKÌSèU ¸uÉ‹’à¤Ô 2.`Sûˆ€)¦è#æ?F«øòW`îÃ7ßpž/™qÓ`¥,Y²×6(2É[EŒO…Ô×KC¸…–h›e@Ž'ƒu%‚rUKìëmÅ¥v]gUô±P¹dMÍ mÏJ‘¯qØ µž©j+é)ÄfÆk2 '{P«ŠH¦]Ü¢–'\}ÃÖ»%°1ÿž+›;â•\Ó̵þ}Pœ$‚Æ»Ï[˵L⎜™}Z·«FÏ€¼ºªÌjAW¡#>¸*c—k­«­,7Yqìçåì/Sr¹…äËFs_„ää'dzf!TÏòÅÉÀuî'°×D¼Üãô–c»øúR‰*»ÊRS¬Êçõ÷!æe9ƒâ­0•w’ùÛw:ÚéûŠN=A)÷ u‡mÊ."SL|7ëIÉ8Tùv£¢î¢H3s+˜¨¸ Å df+ÚÒé1ê>Gp©°µhEq¥BÇð¡صTÃLl£è E7¿ i~ÑÂæj—JÜä:ͽ‘ ®«>ù®ºØ!#¾ˆ*ËëCÇÊ“¸Š©’ UB}˜„Fw@NRعXù“‘þzOØq1áMz¯Øˆo1[ì5v};ÿ²$ëRd÷¹¦LX«“¿‘¤ßºÉÖ˜"êmqúž`nïßbp͸Õe ïÑ«ØËº°\ðÛµÏR€¸¾è;føsî¸Ü6¥ÕöhµÕÀõŽø¹úˆH–J½ÜÄF–´Üf+èžWLsÃ,8M»‚SLïMÜÏ®}©¦T"5ÏÉúj§¤Akon(¢Ñ´¢R üÁ›“v©šú›š©‡Æ~KvýærB•!í.íë+]êÎyær`³¹\Âå :s¢¯%»òŒlå*ì½]‰J+e¨¬º÷$b§÷Ý îoÓ”T~ 7] /rVÿQ¡ÜèÝÿÃB‰4÷ç]ë›$xuœ8òêNà›†0]%æÙê/_zšlT±bŠ+‘kÉpBg£TÈv½ÖûÓëêò´+Ww´¨b·‡…ìu%¯*W˜rº÷`Á¥¾ìšòÚT¥ï5NIøªÏÕ¾ÈßàÁÒÀ³àü¹ L$ÂÏÂùþ_NþÿýÜòBendstream endobj 1151 0 obj 4342 endobj 1155 0 obj <> stream xœ¥\YoÇÎ3mä7,ü´hGÓÇ\ ¶e[o30;©ŠER–DÛrþ|ºÎ®î™Y®´vggú¨®®úê«êùiÓ6nÓÂüïùõÉÃo\è7—¯NÚÍåÉO'Þð?ç×›Ná–èÒ¥fj'·9ý÷ =ì6ƒßôclœßœ^Ÿ|¿u»nÛ§¿q×ýëôïðØìc>º&øôäéEºûÃÝ>n?ݹfšÆ8mÿ¶óÛ¯v{¿=…ëv{ùá›Ý>״퀄ôפ_½ŸÒ Û/ány.¤+}ºø¾¾óÐÂØÓצÓ÷ÎyúþEêï“ôˆëéñovÁC'›LŸ\ìÓ !} !Â(ZhÎù‡š[ÿv·ïÓMÞóœKQíyÒûÐ6ƒ›&šûUzf{–fòŠ&7¥vž¤Nóé.âß üØ¥nÂö:}ÜÞ¦qŽpG¿½€ž¥q¼K½»vÄGÒõàcÙ^¿ü›Zè¶/wû.]I÷Áƒãöyj®Ãp´Ùøp ý§›\·}‚pŽFþ”~€^nè{Üþ×ÒŒôÜs³:àó]RK1lL‹—VÅå¦&éÎg'§úžÖ]›÷6»±×DgénP€¶ÿ13yµ,‹_¡£s–å h$ÍgÇ­†nÀñÂåÛ,ëù\¹c‘êí.Œ4¥Ÿ“î¨PÒØÊ% ƒx•µZ¾)ACp#üÝix_RL@Â* TR;øÆêšÆMâµô<ˆ8´]Óé¦;ÃÙà✉.\îHâˆK}®Í‘˜<,tbÂCw:„[úbÒ‚AGbí_Ãtžv‡J™”¦M›ò‰vô¤”šíM—¹l/çè¯0á=ÏxïBÓõ­—‰w*]^ ¯ƒ#½äÛvº-Ó £¦Él¯p€“Ç9LúÀÒ…aÄ[f«zø!êÈW6ÞØ¦v{Õëa¢–ð)¸Qµ´x ÚN}† l?¶&P4ï4›·o¥Ÿˆ­¤éÊý0&Ò Ò¡±GÑ¡d}»‰­èMn¡Ø6¤Ð(ŠÃ(‹˜öÌv½ÿú±ÝÇ•]WSK¿| ¥‰‹Úó"+¤vX©#oÈÞ‹æà9¼?&Ùº_ܱ5jlLy½Ñ‘%ägMµQ}0Ñ€µÁäIÆÅÐ@l/O²W Vê&Ä„½"ilÛÂCwY×Î(Àïc ÿ Ž×bÒ-šÑ f£¦rr3ëzN‡t#îhÅã*çs²5a ÀPÐîØ¯‹èE `<‘s»å¡ö-â+6úBö <$~þ‰uãÃPait£š–2öÉõÔU`­CàQñrâ5e=²ÕB©F4S²ØáóõÅæxhTDÖO¨‡g<þ´•Ú yjzR¡1«1<ñ™52싈ùŽ‘²×¹Ê€ £Ñ® ˆqæ)Ú^1ƒñŒ“ ÍníÉ&/©Š,΢€Nªgd%ÃJz¼´î¤'0Ê™ Œ4–€"§)‘.‘£ŽM¹'U¡NUàæÙŽHÏÆDA¯²˜·4Ü"ÎÃqLvéKðŽƒp•õ°·XÕ€é+öCÔ]`ØŠÎwa |‘`JU»È†)ÐPÙ“Æw‹*Fw[Ñp†UÇÆ‹¬lÛYqhNWL"*[ñRopŠ þGftè,•˜yF` ĉu*pV¢Š˜1sÑ&1Éñ±BûL*¯óÀõMFX ÃYd_>‹7¬‚«EU(–ã1ÚÁ8z²&}!ý؉ë¯!ý@vqIu,–ñ#ñÌ…\g½ FfÈÖˆf†!JHö Üí'L¬rØ8hù‹|"[!! 6ü.wU0Èz­LHŒ}I×Jv»"² k¨ŒòF+[«Òl¶_«y~ºÀÜÞWØg=l“)°zX:N+¹tCõ~j!Úú)+ÊìŸPžqULj¸)#ô"-ËcS€yYà¶ÚûªÐp¡‚õåQ×Åd¡SoH»aßcÙÇÌF‰,á'@I¨±¼Uz)cC…=Ì^Îb*³Œvû+]½IÞÿ`–x}u£Ö·ÝB.«Ê‡ûªV‘ÅTD5/ÑÜSš9gOE‡9gãÖxgÜ.á^[XOÐ à<®Jßì€;.s‰RŠ•=ÖÂ"ÿ6w{Î[ï¡yâHú˜WŒb…te-r²?l¹í†7ü j=ËýYMïaؘDzûë®È÷ªÑé'SE%¼“ælŒi)³¢¸FŠm¾³ç,y®é •ár[Þ$&ðš'Z¸EY*INl=Þ˜b.Þ“ó"sgç\à[i†îhуB}%5d3.’s0ýÒ.Ùôf@aV—Š¢t?|¨Gbþ!Ôò»ôØÂ™ <=Ñ&ÕõäÝ-Üáë2±×ç_¡‚l(Ïø¸6€¨î´`Š|G u ”˘™åM7,ÇÞ;¢˜‰ 6ÿÃ=8$ôL«¯ ¶ìd,ǽ–Øk¨:ãŽ\¸`<7/«*ò"‡dÖ`Gf³[mK?Ò¶¬”“™\A^e¸]hœ UûHUÜ\Ä?/Ì{ÒEFgoËá°è¼rJ(ÛÍÕ‚QÏÀs‘Ù¶ü7ìÓBþÃZ¾sYg:˜¶áhtÈ ÆšÀ‘pÿFÓX¥ãû¢¿j¤ŽÿÒ6ÛûÞÕ:}<ø+’¸ä>ÛÆ·»ÝhùÂ’~JU)‡*£YÔûà9NlšjQߪ9 u:ÍÓê¿Ï©’æÇyž³XÕ0û¨&œ“Î\Ôl‹°„I´T§ $ý¶Ts{*ü=-`’DÂÄ[öǯVhÝ=à Fk[`iº©J{/åçò0rŽö\‹’“oâhK㠋Ź”%ÁÙR4)^¡€èÊBy<*±iáü c‡FË<(ëHÕß“" ¡7ÿ?v‰¬‰¦ôĈ¦Ž©ìú@õ Ìg;-,CQ}P`2ÿMá–ž4»HÏåWU³’ Ìš§Ú+*Í…F…¥Iž9ÝRå}ïìÂØYPOxÀ’Gä3»µƒJÇïoÊE©C°%0ÙFj]¨‚äYl]®X+X„.Ó¡¦M\3ƒìîÃs'©5I¡:ƒU–7].²mk@…Q¿˜£ÑeÃvQ„bR RD“‘ó7…ÝàÀAá{®f~¶Ë@ð)í™Æ\rZ=S ãÅ|"˜²RÌò Ú!¥ÈHH94Ód©‹¾ÖžÇ’"!Y(¿ÁÓ\fK¥ éþ¬Rè2˜úA dÎYP9 =q}¼ÍUÛ ø_MlXš˜Æé˜ðÏLµcUZæû¬£¬ª‘ùEªZè…}À©äa^-hý´ï*Ï¢µíçŒ\ϑҢ›‚ÆG¤tÁSʹ`r…[Y¨Ä¢… óÔN#¹Ñ”ÆH¶Ú²8غµ#ìZÍt”.c*Å™ciæÈxU'HAloŽœ-ÕrAù¸jßy|‹>ugºCk/[vxßf}Ê9xâ$ïPõbº¯êŒí\:{9ËYqœÛëÁ4µnšš{+Uê!´ÇsÝv½ª²'•U)õê137Ù³’2uæ#à{¥:’tp­ùØgbM;y´éÑwwœáÓþìý`…ZYÀZO[²„ÿYÃe¤µ°@¹ægð?(¬!ææÈ1‚2§qïáûž/b!ޱ=áF ¨sŒ¤îÏz=¹Ì.>̓\\~õˆs ÏUÙÈ|š*ˆ†w\‘²Ë!Œ¼SàÝ]’aŠŽ¢áYᜮÌåiÊ¥WGâ™6BÇeñ[=Ÿ hº<ÿ[#=!ÅYäQrÛÝS ,¿`$» Œ¥ðÙE\f2KÐpà´T6Äz ©>:£¡ˆ¬¨ û•_PŸ}h‘‹<ÊþªJnܺՑ* Êǘø#\O…#Ä%^]ßäR¼Ðæx*;Ò1÷™Æ…!Ÿ7ÈC` b÷>XìŽoüYÅ%™¨NQÛ¸Æã9Ūà ÇñŠÆíTQ9)ãh`+S»{¾º'Ž~ùxÇ/Y¨†Ö'5¯ :æ)§½|ª Nƒ®d¯òqO®öÀÜmÌŸ¡-Ö©ÝÉjÚ“2c¯¤ƒ¨#ç* ß-iwp t$˜A´›“~2¦’xµ°AÎÕVÅYàGsµL•Ù0o8hv2«e “ú7æ"Ý=ùœüÁ¨<Û!K)šk²@g·ьKTV2cE`((«Ë\L0LHAHu£5ù$:œ®r]±ï`›çáéi¶üÛm dv  \OÅ|Ø”»\kòK0ªlƒN RlûKd…oŒ3Æ•øåk äe_ee¬ÒMB‚ ®‘²t.`ÿU9YÞ/Ðé£Ó“¯O~Ú¤°¼Çw¸%Ó?n"ÉNÿŽø®ó듟<|üùæõË»§'¿Û¸“‡ŸÂÿ>øêÃôÏã68yôxóõï}]\LV„G³ò¥ÓçmY¡yçJQ6ªèêÀy²„È ¹T>²#ðÄçÒï"ªY?]ý¢réЩ·òý0de;/‡uÔ¼L®ÒIŠ˜æGN·ƒ¾Éç¿60žu°_ØfBôX~$dÜ€LR£gx.K{¦cÜ~·’w5ãùRÿ–y]á™gq-n±¯Oþ#–ƒ^endstream endobj 1156 0 obj 5522 endobj 1160 0 obj <> stream xœµ\[sÇqÎ3¬òoÀKªpR:G;—½Ù•Ë‘¦¬Ä’èrU¬<@E²D”(J–½§¯Ó=; IQ±àœ½Í¥ç믿îÙ¯/‡S¸àÿ~v{ñÁ§!M—/Þ^ —/.¾¾xø’=»½üð)œ²¤òÕiÖpùôË º8\ÎñrZò)Ä˧·» ‡ñ*•ÿ§C¼Šøû¸ á4„ñêÇ|õçÃ1^=…¿žÀ_ýñ¿‡ãxõ»Ã²žÖ5¬æ ¼ê¿Ç¦ÓºLWŸŽþôp í%Á%<¤Ó0„7åà’W:×þßÓÿ‚Îä`;“Çpš–ÒŸ§7܇©ü_#œ}ä£Ç4œæ°®tÒßáé g}ôôâ“‹¯/S:M82Ç|Z.—5œòr9i;”¡þðÉÅO>¾üö›wÏ/>øëe¸øà?áLJþ}ùõä?.ÿåâ£'—ŸìO‚o·LÂOSZñA§LÈeØÒXF ]ý^ÿ/efÞ–¹ RÈWßÃWå»oËT¼ä –'&ðX¾þÆœÎ)×­8›÷娛ò±|æéêù!_}sx]¾ÿV&®¹ƒ‹_À…sùrgˤüch>ëup·ÛÒXø¾Ì¹9å}h!µ@Ï~ O€KÌyÏá¼Ïû²üI'BÛöWŸF21î6ûâáÛ1RkÍ5¥GИü¸§e b@ßâBFyM£4ÑŽr‡qLü=ái¯ð ,Ž$ ¸ŒAé$Ìäì§Ǥtæêàñ˜"!ô-OW7rí?…pãå1¤Ó8 ‘ú(ã²À¸¤DKüFfÆ[Ä eâ_³AŠEò`8ýƒÀ.æÏêµ ÀM,š¥yÜœuõ¬´oð…5V8ŠÖ gâÍ ‰ðí OM “p­¿‘ áp^4dpbL8¡vU#ýÍ!þ¤°Úu\PcËú}ú§‹§ÿö7Ítõüx?îáô„†õüã¾'4\èQ^lð>ùKºN¬ÿH£P+Gñ¼·ú㹞uõuZ‰h—udn©‰jè01jše„ò2Êê•5KØÓ\óN]q2Enêa™†c»oa(fÄ6?øtj9öÞÎÌ>ò Ž…¬°þ EóQ=3•3§Ç‡í,W›+ÑûD8“–ßÒ‚4L§˜=Ø©÷ó€j—‡)a5œŒ„¨ío*lð(BúYx„ƒ?àäæÉ¸D¡#¢ Ý¢ðƒ8¤ ŸÎ&Âà5‰§š*ÒgÂGi"ú žãªnB{l\Î-q.¸ÐÕ‚î*nè€+o,úWg¨JyÄžáÝÌ`ïºÑPú*M3,ú̓þžZ.E+&õOM¿`–ÙþÓH$F—*¨ŸÊÿ…¯F›2Bš£®wÙÚ É¥cˆÆ”O`@oø„¦ÝÀÐQúá]Ñ+f4+™‡¢ÎrM0šFèÛJ&Ï*ÎŽÌû‡8Ø÷ZÀëä0áм¤cäH#ûzø Îûîb5)¸*Î}Â'³§‚'™9Q® îF Htyú½ gæbøø Œõœ{²àÂÚ-—tš'± 𥞠•fMl¼çb˜PåfF+¬8V‘–o')½‚)ûüªƒj' øM#‰ààMÁfíó™-ÝZÞеÍDCãqñT9H(·šÔ²Rz=éÐçßÈT¿ KóèXÏ2à˜}øÿù¾‹8™œ.å:jSjGò0h#h„÷Üeç· tØ.b }ÃÆ&žc±Mp>ïKÆ %ª©m¨8< 'ÇÍ/}œ~Y§'Vñ³H8 chnÎ…Ýöˆ¥·WÂŒ09¡ eŠFœ#yÀ Të¿dVh)÷kŒ˜üfÞ ¼G`RÎYteÂmr–Ƹ9ÖG=N‹R%’†oiQñ™ÕÇõ4øk¡Þá’iÀxT,«VÝ\{»ßÂòªÛnù¹LíýÁH26ÈK¬MU³èC°a?þÔ{ˇ0 ™.Ú>.i4W•!H7‡>‚ÉXxû¥¸Œœ…n%|„¾]3Y½ xÍXƒ$€<%š£11À¨˜ÑR‘§½Æö½£a:j½6J+N—Oµ8´]ÆqD6¡Ëì9†8›òä¬ç.eÈr†Ž@ntÇxÕL“œr:WèÁÞ³1ÏÅØÈG·¯7ßmâå‰ÂÑ#7ÿÖÛ KwãJÆñ×C3)™eò¾ÄX¶A\š×:±Vgª…¡£î†ÂNKã΄ݩ¢Ã¸` ¬uÎHñ4òäÙFí! ò”– a_¼8êˆIeIºÿï î:…**~çÎx©jNIjaÇYÓûTeUD1Ö¸`U6‹„ay4ã<ÀðÔÙýu=½ÂÅ«ƒ5æ¿ÙàlLíž&DÜŽA±™5m é£ÔÏ•6‘Œ šÀRtf(ú@›{`ûÎ`$²Òpí³úŠuC`ÎÄg¥´õŒ|Û¢kØ£gçÉdq×äÀöh¶¹°W£/š[}ïp–áÒAå©sâ¹41f%ŠÝøô:l_©¤0®«ØVĸüßi à™,__e Ý”qœËÀ ’ E/™È Ü ¤ç®W“‘âqØs|€Ù«qq0 ݰ±Úz0ò0x/¨rÀD¾%í –Lb“³¾ÉjNØ98ž=‘ª5 ]¼4"ð««*#Òû$&’&D›Š«ÆlžqTÉ Ï„‡÷zC”{à¦ÞÕ[7®"„†ù¬++iki“çõy~ŵøÅÓ/p"ãZy_³…`ԙĀjáиº:±Èw=§÷•š©Žá¨ 0ÁYÁ‘'d×2 ‚Ž±Ë¼ƒü`vžÔk ;ª,܉¤3×á¿&í¦‡c^Éš7ø¯T|h’&qnø)¨p[pˆ/ëò”I 0÷it xÔ÷¡\䈎vQ471¹'8òëz?ÕiX"· î6 šEE(·@f‚ Nôà^ÈÊžÇE7û¸ƒƒm­òï 4@tÍ£·ŽŽ¤o±bRíµ“:«¶?îÇ Öè¸ãÖl°¹Cpí\÷{qLvã:ÚÁnôXt¿_R¨Ðÿ[.Ë02‡ÜK¼½L\׫® ׬òº,ϸ’«WèÎ[õýú†1(å¡ås‡j8åAX!aSÖ¢ÊA˜ù‚5ô#³.ƒ…½Aƒ$WAA‹Ý#†½•ËeüTö6H2Ų·VWºÈ0*íè£YǦ‘^ýh$2ª­  ¡f! ¨é‘6´<›J”•ƒu-s‹DÔð‹K2ŠZq’ôª$×µ’q¸Gx˜ãñR²íʽ÷Ä®áü.£ˆiË !øY‚ÊšAœ…D3>[σc‡ºÂ•ƒ‚ä™:ˆäÑÌÄ"ަ²y%~!)øoh>Qº}NhÙXXNâY·ºW~¬¡–²ÏÅ6KBT¯|KNje¯¤Èjn"õ¼î›Ó © ¾&Ìu Y¹»ãOGÝ%Ä¥„£òŒuß§6À€oYar UòúÉ0ÑӆІççÅ\®‡å¦y´¹¤† é‰Y¢]WÛ»§‘Àø˜›’„Úφ ¶m¥ÑÍjSSغ +KÏlx\(’‚W„ŒŸÖ´_,&Âx¥Œ’á:iJF…«D!FCÜ:2™‘OÒ€óa,YU•ËŒÅ##`5©ÀIÂ*)ªeH¬$ÔŠ’4­¾rä'(IÓºÍüŠpô­Í"7üIFo•ÌC;VmÞbЩ÷I¼&ùXÛáÉíLNêA2ŒEKr=-ê~ ¬ÑW9¹M\=$÷‡Š/ö90@ êhu(%Ä81«óš|ì´ >lïJ¯8ÕrWgVȯAìéüïkÞ°M²ç!ª?À¤é°}A+×(E"u²WºïM¥ŸàAù¾Z‰"ß _†˜SnI¹æ’rióˆëƒ&¥;â7 ß 퓾‘œ0;¾œ¶‰>;£»Q¢n>¥*½¤¶Aàâ®­–‚-§ÞXzlRúÚ xrçú±Õõa“w|¦AÔG°w ÙÃ虋TªDÉ}ò€þH’”mXÐ"Z“ÍÈ™…¹érbVì¥ñr+É•q ‰4SßaRT“Àµt²šqЏè]£¹ÜÉíÃ.2’!aãM¦#ûÊM ¹ÈZÊÙ‹« ¨ñ;\ìØu“TÊaÁ ùA•¥S¦4Ä]Øbcl&Á}T-h•CFX¬ækØÆÛ^ vØ[RoÌ“(þÇ8' 3è‘“ã’m¶Î>Ÿ£%bU“ü ®Êš>»§[ó‰cGC¨9 ˜ÓQy€Ÿþˆ­hë´PðžávFã4žzycò]é”´ jnÙ6…æ¢i}ù[XåùäSdÕ Ä ò‡÷¬Šöw 6FçCÓæ2ÒðkÃÆß]zìz:öfØw/&Ç ,jÇJQJX5º˜="DÑŸeDëfä;Õ ×ôj £€L‹…·Ä®ÆçRáoÚGuÅçŠÌ4}&š2>£—……" WÐId‹›2<5çon/^bTzà>‰ˆ×ÁÕ­rÀ²£z`Ï1´]k2`Ñs"rР0?\Ýé2·Œä:9+.ÔU=RÖÖ’[YM6Lt]Òí¼Ì;Ù’7J”ÒžSI—¨2ŸLµ+™’ìmf?ú¶S)©–ð’祡¹Z¢³uMœr­Ïûí¦ÜN¥cWÖ¡JlùÖ?Xæ4•,Ú£?:aÇgu¸± ¤½ósR¡ v¤B¹lC¨÷P¹.Õ^¹®,_‘ˆD8k9“Åš÷$Hf;5f"Ë‚¥’Éž6(E«›âÄ•ÑP`%ÐÀÒK1X6~'9.&HÓð)¶Á¢,¨0hÇš$„Š$ïe#ïÑ…ž¡ßÓSÚõ‘j€“")mç©·1¦ûPUß¡SÒ‹ÝÞ²°—B¡˜¾C•ÅÞäJ \ÒÕÅÛ}k#Á;;¹'ˆPv”šTs¶s»ˆÆÕZÌEl”•Xƒ·aµ^Î`¼ÞëÜØ+–u2‘›;¬³î`™Nqˆ¦¶dÓcד!d&ÄûU“m7˜d¶–züÙSî:U)l-ò8¬È¯Ð¡MÞ Z]ÌÈ}ö–&ªÓb’¸ï5I­1ø Ù¯×”Go·OAw]:’“H$¢ê’:µ`ô˲Ý,’Uñ°¡n‡tõ3©BÇh”$•_`èÃrà Áœ­†®nÒæë‡Ùµüi0rû£ôpmÔùì1øÈŽ ë£sÊÃl4£ñ'¹P’´>D¯µÖHnÉOˆÁi*q(º˜ê/ì×(¹Ô­cÿYIo¯„¨©Àb ³”x¯Ó©ÉA7f…y¬€üΕ3O5uguMK]6ÓèVý©ÖšØU… ð·ãìvEÝO¹ìe<æ-¸5è¯ÐÝγŠ÷xõÊì@2#ŽhNZþg¶JñeŽñδG÷ÆÌ>Eec[±Ì›„¶v2sf-MêEï^”\ƒb5Sùø—áþ¨ ’y»¯Ck…üûE°.‡*€t_šEdÄþ<>î›”üœýfx‡½Q+±ª(ŒÖ}Ö]CZewDÞÔ‹ltDß凋ºd³îÿÃ{|V©Ô"2Oy‰—f#w»©(Ö«ÔuÈQýu7¡ñ…öÔn&Xì{«°¥]É[F‹ßÜRC”¶ø‹ÖÀÚöR6®Æ™ûêE·ÒìÒ’aœ~D ¼uí8|†v|áR0ÜÆ ;u©<ŽRvìõžäÇ) -–= Óí&›¢«IÜg1ëâöæœ ÉkØVãýhf×€Ìd)Ä’c¿˜Ï' —Ë ö£¨IV¤&¿x3!&÷íšùH.®†'ZoËN0h‚Ï KuÑM…puXJÔÒ=$P` êÿ02Û•sd_Á©} Žy“¡™^TBþ)‡åy8…ÚºˆLº5nÜŒ†šY¬»‚«Ý\ÕxÎëÓh7bpÉ_A­k9lhÜS[Xg ƒ*¤Äah… /`Ù¹|H![ª…lRS¦¢îúáB™‚>”ù`Öâ›'Q¨ Ì6¤VTª<ºÏÏ_¤6 <”Nű·cû諸x\¶‘ï&ç ¦c=ªÞ’áì—n‹ ôý> ËZ©væ»cxçߣɂ ƒiªÜ)Z¬Ó—ƒn 7b~\©ÎO°…º /¯m_>)ZôNýŠyÊnu§Ê`à ®ó¬t,¥âlÒϧF›mÞH;é×Þ&¸ošÂ¼‡MR_§¥¸&o}h·~-ƒÅ¢Q+ÞšLb u£ÑV‚xŸHhޜů"5x£µÎv§e»•S+lýRŠZt~cpJxz7ÁéxZ}An;ºÿMŠÝFÿÛjK¯:âËWÙ;ÕÐúW™ÓÑ›—Ø:A†iå4L?_@–œQt¼µÀE½Í›>;ÜDw8 ÞÈ6i 4*O@â}Æ$ôUNȨ>¹ø']i8,endstream endobj 1161 0 obj 5915 endobj 1165 0 obj <> stream xœ½\Ys$·‘ÞgJ¡ßÀ7uoˆ=…£®‡}°ä‘= i­ƒÞ°µæÜÚápFsÈÒþúEžÈDU5›rH¡‘ì®À‡<¾LàÇóîÎ;ø>zyvïÛ†ógoϺógg?žüúœ„x~ùòìï»°ïwcù×íûÿ¹ü^›’}-æpH±¼yù¸<ýÙþ"ïþ¼‡yžò¼ûÃ>î¾Þ_ÄÝ%|~!_|»¿H)ºnÄRùw(߯8—v§å½T>ʇàï¯öZ˜úóoåÁòw"ýýŸ¥¿?•WÂ@¯»O:‰Ødù-ä¡<Êo)e¢ƒæBœPÔÚúwû‹¡<#ÙOÕú"u‡1Ì3=Ó rq\ÿU| B<)ÿÃîÝ>íž—fåoœªÏˇt‚¸×ÐMôa:öÃa–áBOöy÷fÑï®JwðÁ«ò³|gJ¢ïà³÷Ð×;k»Š47Ô{&)¡Ý‘úE±~`y‡¾|ÑŸÐŽâ5üÎϦ±HæÝOe%ñÁÇÒ!¶ CŠØ0¥qN‡0j^–¯yây4=¶ßòî¥)øüai™vÿ[ß(íóÂ>ÒßÞ•¯§„Ë  ‚@õÙ›=LÀœaR—-=–åß}L-Ðîþ¹®ÅÕ>M‡ò\ÚýßÂrÏØÏS˜˜„YÆ Âb•FËÔÎcA£Ì"õñŒ¶ÖOÊEH‡~è"Í ¼‰^^OãŒküOX4€@—åYyj 1ØJSWÄîwƒ×4°4iìk³Ï+¡ÑGûó”ð‹Ä»ZÀFoV‘±Y!S–?„^á_™¸Ü(&6ô¶ª+Ôdš‘½“Æ®Œyû 3à›Ð“1 sœº|Haà½âGhtFøOhâ`Q+,è‰:\^š€¥GÞ×åþ á ­O×õ¤ »ÿÓoµ/Óø+?ï`›•Uœd¥bl ý“*=ý á%cG|õóDS`ÕRJ¤lÊôRg?ËN~¹O€i¹àÒ (Dؽòì_à3èoªmz%RpNã‚xö¨jÃ|(¸ÿòìòßÿ¾ëèÓ¤É8Ûv3j¯dÃÃæì«@W¬AùÐb Ç(šõ†ÁHsúJöžèÅ9:Ý뀉;2ö#ª,ÿ%ïá8>ûƒÚGPødÊ4¦Lêf4›&n\` Ò£n†Ã0 ÄÍÞØÒS0²ºeöšf˜|«+2×4'¼ úgžÌ‡Q`r«Žnõ±î–ú¬àëJº‰?}^uïÇ û*˜]êõ/LcEÞWÍKSæ5/ªCQ°¥ÓÈ¢80½¯À»fÍñ0qÃ>–Õ—w žÖ—¶}*‘z°{*ƒßaõŠ% §)ÍZÝ-0¡ªÍ±ë_~Åç j®5 ÅöQŸcÂ-æ±¢ ©Ý‹ô¹4ˆÚ8ô‡<êSíRã—°‹Wjw‹ŠÃ“G^¿Ž 6¾æ¥h,ÆM"mï|ˆKù²ÂÖëûú[kÈ$Õ!ÍËãôš÷µ€%W¥£f<£áõ  ^dgu¹ä)Я¢{©Ÿp?uu-XÛ>{Oƒ>}UQ´n:“9ÝŽÉ4ôun ù~ÆæùYŠqÔM‡qP±e)͸MÞS¦-Ë– ‡hFèµóˆ=h¥Í®îÑ‚©0¹}´ÚþFÍX“”r@k½ûêµS‹<ÇEX6á4P¯¨!´ÚÅ “gÅŸÉÖ¿€Vjd °"¹€ˆÂ+ræŒÿƒ.G®ð‹Q=kuœËÇ–zÈtè#Œ<úØš®ÅÇì€+0ê;tlv,/HX}=£¾râ}ÄÎxâ¥ï ˜ªâ²°ÊQß(¿çÅTæÐ#ìÈ `ÔÐï^T .T3šÓMýõ¹ ^e—\VÃö<± õ)´U·ÍÁ ZÌ 08Ý<¸VªX㦃ë78fqÖe¶€¨Ö߃VmwKÅû¤ —ûZ7å‹`£Š&ýV‡÷‰u$„gU ôŠöDid8±{ÏÞiy\Ä+[Ào‰6R_CÜ´ûë>×%‚wa¶B¿‚ §ÑCBtòÚÅÝ' Èž„/pü‡²Qàˆwä44a•"Ÿ'ºècè±Ø-üAR¯eÛeA 6@BÃŒ^¡¢"ûx̪9c\ØPš'g™Í‹j¦Š[ðÀmþÚÚ ce}÷¢«Pþ ±<=Ášç`Cñ2\ÄV¼%²Fñꂽ[p™»…2çV½%þL ‡9ªDg°žQ† äØR‡  uˆœÄ€61xèk¸d„½ÅƵﱙ1êÖFUKVÝ¥H[ÆúâÚ¤¨ 0iñqˆ=öÿ¡~hŒq Á®2tw ¨^¬¸Ÿ°´ðà ë;åUíˆ;zTGT{b”áDl¢Œ”Í0£Á3jM9“)¿¤/à›¬6ÿ’ ¼ì]½–Qwõ;$\pÑdqÇacqÇnÛn¥cçd–q hyäã÷—c¿niA„…Î#„õ‡ir*Ìé@˜×F:&¸DRmÁË 3G„ëpaòn:ˆ;º-à­Ž1<¿Š%²7…k LðQÍ‘çƒÞ'ШD/++ïøˆ½1@vßáËŠº¶Äl³Ô3‘Jå¸Aõ±ºØp¡sŽŒNð± UÐjÛXMðÀ ÑÎ c¬QŠDaÅHY×{6£5¬š“ÛÄ–úˆj$œ ýÖq…ÓbhèŸö=QÔ ÅL±®…¹Ø½eûiðÕÄ0×ä‘_ðнšj3J ýi‚ÜO€ÕI µûy‘#Y,‘r%†mK'9Tq Š\A¬Qo‰jÞJm ‘Õqˆ>&ú±À\M¨Ì·[báak´­éˆ ˆªCš-ˆ<—‡€ÎŸU›B#²=ÇGº¡e+^,Y`ä¨DØ¡!#pèshŒå õc4$?çbjÊàŒ§ºü5åv!3ÓzòÖCvÛµ÷€úEŒ†6{q Ê.«.Ôðsd&:Q𨧩ŸPNtµá$s@*¡JhûuÕGê:úئF*[|áñïw­‡ªaŒÝ„ú¦%d>u\5—…XŸî³ak*ƒóemð>`bRå®&¼KÚÂß`Ž]ŽWðIˆÌááb ;-$èwd¢Ë¤ö•Äù¬BæüK¬}Ó¸T€Áªx“¾ÏI`X.ŠŒâ4£­ùW\8\¶ï÷ÞÚ²ô^'Š>çüÍ3rŽdPdK›Q|óºžSW_[Ã"jØ'ç¾,½·Ìm´)ƒ4¤&S³’ž¡–/!Ç"Ú¼qY” •\á,IãêÄùsžýÂÆÊÆ [¿¾÷Ĩ*“ù]úZ2H˜Q®'{ñÛ ¡4Q†ÐèBÕz},5õ>€Íëñ´òrM¹–yȱºuq$ä)]æ?°½‚ÕŠoY„jzÆ(äŸxÍ”²Ù°—·äù¡“ê# '‰$]È(NÑ»ÿ¡pð–é‘^{U› vþJ‡q~‡šx¯½á "›:þ»â·B†Nö ÁÄj M-¬DÑð"l f+ÿ»¢Ò{Â|r+VúÂ<©!>÷ýâ.W¼w—|*›¼!#=É Íu=2¯9_1kPOcÙ‘0ÝEßr·@†Ñ1$gÜIÀ:¿…¨ÈGËí°/~jœsžF³äV˜ ã-ã^©ØP ‰Ú–‹åLK¼X¯Â2ê–[×#§e)GΕ?EqŒE´B&âH´BÞÐý™‰Çõê'×ÈRðýÈ»UƒMbÉ|´#üLxS£qb"3§Ôdù^ÕÁT¥bð‘ê ˜Î< «x:Ž!æ>¯KtÅõd2Xïû©Vª„hËl3¼¨SÊœmÕW›4$2䫤5´-ãRŸcé0Gv"$u›3™ø!Rû.W®<ÜL™,Òxb#M˜Ÿ‡Þrsr!¹¯*wå\rJ`¦Ã®€Ô×éLÍŽY­Rš)¾•~#¢'W߀(¿ö¶”Ž\ É1hâ]Ý;ÖÞŸSIæŠy—c8Vøe"äó£Ãy±¶O$×1Çc[‰ø–xt/! è*r<±£_)Êt¥ï¦t7‘¿Ö¦Ÿ®ˆ]M5*~Þ‹²–µ”::i2^8Ü”¸ ÙP²MM®A…sˆ]ܬ"–Ôj±Ä/nq }ƶ‘_9B å²aÓº¤å\X“¬k‚Š—À˜–Þƒ!/®9Î×Õî:¹ô¸ •-ôÖ!4Þ¥¸¦˜çk\SŠË‚AúÏJç6õK¯÷ëË'’Þ¢™ñ¶_¼­¹:‰¨( x*þ¢&X¥^«S^jYÉ¿Ì?à6ì|p#ÄåzœÂDzÃ4_­P°m9V/âÔfsÉÏK²QâU‘Ýô½ JÒn=° Š@æ´=ØXͳz<žÿg=k§Þ-­IoxÕYãäµ;‡;ÏÈ>—©NÖ’|NÖxíù2{ªì+—$à{¶ž¼ô©.6†XkJô¼ð#¼ð^íHꨙ0Sžðq œ²ëš&Wó1LÕ¾´[oš¾µ6ç (q½Šì<·Qw2®î‘ }4WKèábˆ/Æ—‚,KS?[_¬$«QQ¬‘õ/íQ6QT?žGc”ÁËi fª®yç£å`FÖ«¤Å –«Å¬@^ÙYt Ó‘©c'Àpj3'÷u}ÍË¢*6üÒ™\´Õz.’\®efGö’8 Üs‰ÎtÂn e›©czalOA¨ÙI”†œÓèRòוYõúe‡`¶x†uTe%±ƒ¼ðEe]à#cÞ$MC±äV…‘‹XYn¯\V µÅÇ`ÃѤyépÖ‡sÄ+ §êx{WÒá>3tº™ÂFݲˆû¡/RŒ i2ØŽÇa*š¥4j! q 7/â]Wªã”¼ÞZ¡ÍM&fÃ\l…ºÞ½?–ðÑh3)ðZMÃu„]ŸÍáÂâ<©úYVc<¥”zë³@Ñ$µ©ždnW0P¦cBØÈ¾O“O,­·|¦Ñºz„mê¶(úæÜÒ‰°¦Õœ²T#uSÁ9 MÃÕQ4ª#Òøö@týGÞsé ¯0Œ²…®xD«G÷$dTúø±Ÿ*=‰U'Ö æRÐzfTÐ…;·"Å›¯í4å‘­œ8'ŒëàjÒ¼Öš¶~yöNvB[§ZŒúrg§~Ço±³y޵°²úã°ÐCæt½ù‹ã3È?ÈÙ±U3þΪ;²è®Âhæ1Lö.4mÉI_„¡l]êeEl‹#)m8Ýo¦©¬¥LX¼Î˜2Ø£$Rè°ŒÓ8i}C¥¥6.Q¨IH eý•Dé&õ’S-2ý™9µÁfŒÔÅâ:ÔM㪎²ª®íf®2nM¡°žVOWqÒRV"çmÊúGb ŸW:ÐEË_Êñ­gŵ®ºÆ Ækf` 78ÿÔ»j×ÿ«ÉÓt#I}ATäc¾º¤#22I7s♯´ôå{|Nf»ïe—öæp ´jüùÊbêI™}‡úࣗG©BºCà6g†‰,p®ÅÅÙÔç®QŸ¤Df¬Ùh£«5ÔÒ[CXM²øƒ–ÙÖŠéÐ7´uwç£ÕÃO˜¡H'!«mKÔ ~ÕÛ¡À¯)_V€ôóæ¹[uXÔÏ0>~Igq½?%” ‡w:ÖSjÅh&º…Âx€ '`”z^„áÿz¿(‚hà×kÍÝzJ!·¶ q Î\ñ¶sUÐ{œÆÙ>:Æu€¦^œB/AOƒ-C.ÊNáâ´§´³»È`éLû»b¸†Q9œöx%1´’ìYn,L†«7z¬¿ÛIݦæsüm¬ç(Öœ_ÅyÁc]æ%jŘÄ0âtñéæ\æ¢VÆX¢¶bfQ&'1¯KÂ-ßÌNh¼•(6D„[¥ä]Ã-œ$Ô¦JºH{8¤ª/îbSá¦5¸’F÷˜!Y¶L“[ÓÔaªìWîŽÅt—ˆ9@Rä7-ÜÇCL3ttÈ\ {Ô7;Rk<åßEä¾è×1x‘ëäzôP3áwÚ…9ÎØÅö5m’““âÞƒäNUøÎrŽ!é·-  &&D<Šó³ÜÍeìÛ’B’iø=$ÍxJVRM78/_͹‹ÿŒ7^×hÎñå®o,µA‹+°ˆ,Ÿè4'×ΰ‹Œíj)žèšö´ŸÞ[¶,L¤\©V}0ß³YPœí |G’ø6½i׿j==L^–g³Ò».†>×L#×DÊmU"hµyº‹qËxz-x]ɵÃYó]f™×Ë Ý€êRÇT…¬]èV,Cß7– çˆ3´ª~ëRMâ…­7ÉÏÃâ"%:†»R7$åÝC-™¼è¢<}P$¥qÞF;ÅÐpË$"+‰-vYy»¸AÌ™ã*Ú=å;u)ÈfÖvtÃæ­]Ìá@ý‘(Ù¥êɰ¬•m2«†F2 µÀ±nƒÍ#I8ê©CåZˆÚ2€ sü»N,3Ùgº­ê‡ §ªÞê G+µ”"³é5Í%ÚCÏ?o5R0c}+³wtþõnÆ-kçwcnMS:S 5¹¼$öÊ©?Ó„aúîvùMWZ¢'-ØT‘]‘É(æ®^Ö¡)ð®=Nì ?f‚Ø"&dOäØP ÀȪQW -T`¶Ç8òr!œ¹d¤‰SCT*¦õŒš«b›Ûg¨Îe…¥6gª5 t®O5ýêñM_Ç1Q~ꄲÄ;×7§õ¤<&Öæ›¥”°ârRGüÄ ¼÷4˜® ýŠñpŽË“7Ö¶©ÕöÇÈgRs§ÝImp¤æJYàe¨/7þÎÑ ìݪWè&sÙ-%ÉóìL¦\“yÜ&ÿ2vK¦Ûo¼á¼x–!¤#„› êT´q 1þj£™–¯=|¥ ®øR×{ð×ùñlÇêÛÔlœljyÊê)nW„²M±åš6É) lªe2y±VïÝre)צÓå ¬MõbõeÎS„+Wš‹vd‘šhî 'å½±êëU“F€êJÎM¹öJyâÉÇ[…ƒ¾ª97‘²µtìÁ(ÎÚãz?Dðaš.q?æ`9§Ìà ™‰oÎþLàJrendstream endobj 1166 0 obj 6251 endobj 1170 0 obj <> stream xœ½Y[oÜÆîóÂèoà#x)Î…äÌS`§v« nâxmò KŽdDÒʱ'ùõ™ïœ9sáre·Eàhw93ç2ßùÎ…ïš¡WÍ€ÿâßó›ÍÉ÷ÊLÍåûÍÐ\nÞm=nâŸó›æéKœ ?õ~ðªÙý´áͪ™u39Û+Ýìn6ÿiU7¶&üë;Ýjú»uƒê5¶ßv[Û~×mu»Ã§S|zÑþðïn;¶O:ç{ï•/VЮv[£¦Þ»©}Õm'~ü}·UË-ϰåïé‡A) ÂCg=?ÀÞw_ëJcì¨úÉ{vц9ü ±zŸnÍÐÏÊ{^ô Þ‡U Ð}°ãm0ù_Þt¶}yÁøi€.޵» ß¡YøžÖ¼ ¦98ÈÖGÆuk7Ó™ga)íÁ^‘{°Ö^‡M¿c-NšemÏÃ?,º Âá›°'|Œ ðÁNtFø¨u{!’/ %øÌ›ö§´cÏ:àÄàë]t/€ò…,|ý#ö¶ƒkuÐÚ&¿“Þ—l 샪¤76Uâ ¬¿^Æà¼‰¤²ÂX 9OŸòoð¡w½èk¼ÏÆbõ>èŒ%Öøhº,¸€¤W>"׸x©á¢Ç°jžuyŸa!nå"=$tEl•éÇiÐ슃kœ ]ïk"OC•ÑnL|M“£kzÝi͘?Òõ$¨] †Î¦F?ƒ¿¦±ý(†sÌèòÄÇETàð«Êö¤‡çdcé_q?ÂGg ]¢8 ÷“µv&~©µæ!ÆmTð³@-­M6ÒiSf†@ `n£q6|•'Ã8¼ç=­j«ðDN¸ªP4µæöy'Çœ 1F¼‚‹ç°Hg@ÖëÊ¡¨¡õ¤‰â¶l.¡jô.Y-αtV×$¢G‚H" <¼Èd”ˆAj¦ñ ci+a¤ Úr¥h§|€þÍf÷³mÌÖ2nŸÈ–=ùÖ,‰³G°Ç’b|Á"ˆƒFÑ}dEGº§ÈKEÉš·‰jæˆÇx[8—\ dáôÛDÈÕm§ø¡œT¼­J²‚„UB¬B¸Ç•,=ND(gÙ%§dÆ0¸6¯Pj“À«€oP‰þÍÌÚd‘xòCÛ-u™ J7öHœj‘%3¢à¡»œPEäè+q3ç§2lè ëËo+EÂŽáGY…|°†ìx ãŽÝRSí™Bw⦲n^ŒYŸHÍZ“+«Ü§-eªŠÙo9PƒOŽQŒðVXÁ¿‡¯eåû|M1°ðݪòWdŸG%RâvR¬Òé*[ó¨ª ßøží6/7ïš@uAkÌlMï\3ºÁöÚ¡—yzº99}ÑÜÿòáÍæä_Úœüÿ{úÝWáÏéßš¿lž6/w9uc ]Ž™ç~²Í8¬NÜéu­=ª®‚ÓÿA]Å®V7ã¸. ˜k¼e®aÎk×Ê ÎÔ¨ª`Y„ð¶`M¬¤í A…³ñ[.† ¢·¦—,uM™‡““7Ÿ†Èªô¿/Eë\í¥X‰U3jÌU­¢ú +ÃÁ ‹2ºhåˆáËׄŠk$¡”‡âI2 ÄPJ)²0iµ]¨Ô+±Ý‰’ajUÜ^D2"¾b«¸­8õÔEÛQùÈ"…E \¡þuBQ¼q]Õ,³÷W¸®Á®Ö`zŽlnÒ8¹­Ox—pþ¡+kºˆÿ¥cßÔü¬O Üôp‡È †U•ëì £Ë¶xÙϽâ'SP¾˜²´ q­¥M{DMÁIjdlJ#NQ)À‹?‡àËÇ‘9^áJÏvžª ¯r‹vv€°¸ ¿»…~Ì)”¯AVŽœlEHqfÀÄö`ãKÁ1õ_1#­õIÏe$,©‰' ®,#mû%PJûxGæ &ÎBGÿ¼Ô¨ÎéáþЫ9Yù[l»êñPœ@DšÕÞfŠÆoÒ:&ïà6|ê­ϱ_„µ[_!f¸ä¡õ>6Ø  i§–ŒpŽŒ†áøâ‚¢¿ ’"ñ>òpAÂEG‚¸Á¡žÜ)ìÒèäœ5K]zPŠ[Ž#Ã:‰êý8‡ø£ˆ‹ô4>ÄÀöØYdjIÍlo&áh°)Ò_âaý°2jpúøhrX§.æù¨Òb†Iw5/†䀟ñ`$DÂ*¿×3Ú•©Âñ ÿXFæ‹Frò+ìÉû¬~_Š»U†«e¼¥Á!Ni×>éZ/ÈK±LÉ%úH•Ë”²×uœÜ޽Nc­Å+XcÈé¥Ýð©¡+ù÷÷B¯E†Î÷ ?Ï µ€Émfâ²Yq¦x–¹íY´,lXÍ·šVó¨/E¥ܾ<’+RôVç~#Í6 ÖŠS*[Žè1–æŽöJ…4 •Öá¤ãwzZQ>Æúºº*Z“¨1¸–EVžµ‰“zß3iÈnìg¾ûƒãÜ¥FE©Ô¨|~å›zPiF'£§> stream xœMO=o1Ýý+Í`×€Ïgm%­Ô¯‹§DR5Ó Qÿ¿T¸KÔÊBðཾ@ŠÉÞ5Ÿfw7‘8ÿ¸gwq´ŒášN3»£'ü¨Á8|ög“Uù/ãLQX•ýKÙ²ß!ÅÖjnþÙ¿c`ß­¿ÁpLD(¦4. D#ꔹ)Á¿û¦ím>~A6‡ZVxP¢âxůºo«*«|Ba[‹¥V”‹D+‘lW$³#®Ë©î{ EIÌöçMwú~e†H£endstream endobj 1176 0 obj 224 endobj 1180 0 obj <> stream xœ½]ÛŽÜÆÍóÆ13A†êûå1N DAÄÆypü Y²$ÈZ¯,ˉóõéêî"«¹CîÉ" ywgv–§ûTu]اùñ :yð_ýúý‡›gßHío>݈Û›72¿}¨_¾ÿpøò6ÿŠ?(Ñ9§Üáö‡›òayðê`½>Ü~¸ùöø§“ìDˆæx:«N)áó·ZvÊ*}|ÞŽZ8¼+ïK­¯†oßβsR wüoú”O,ýný£1~wû7„a:¼ÖvFÇp¸ýûÍí¾=>OŸëdðéOÜDg‚”&¦kÀ·ÂY—0œÓÀ½ÐÑ—‹ØN}ü ~Cz©üñx5tÚ˜ã7éÒÆyêûÎisü\þ®3òøKz_…˜‘«Î!l½ìƒk}‚ßÐQ]‡adšà.Š˜‡ágë:a„:ܾJ3ùÅéìÒŸ×ùsð‰¯no¾¾ùxкsyâϦ ‡¨ÓÔ…ƒq2v!“_>¿yöü‡_~þüúæÙ¿òæÙ_á_þóÏéËó¿~wóÕóÃ×Ó·¨ãè`H.ÔYU¸~q²ÀËÿë„"LâL$øÄ!?P)}]ƒóMÂùóél…6q‡XÁ.Ý4`cã>€M¬ ö€?$ûK¦cÒ7*v1ªãËôJ‚#¼Ë¯§Ñ(á­cLcR' ã8{°ÅDÒYêÎZp‰ë É_ù ÉdžzCpÇïÓØÞü›±¤ä°a¤RÉl(Ì",Ù’²I%ªœöªòèÓk¢2atú(2á–¹´6!-(;0¡MgÊø^@ ànð’8ÔßÒÚ<ÍŠò>³ÂZ¦P" }‘kl÷ ¤X]–×5î‘¢?))Ά:@ð `áÇSñXÂòð" ¯w>fCtéGYÇ,Cù{k Q$jÍc®wÕ˜íÌ®mö_nøÙ¤jÐg+$>ôæt6ÑØ†;)c\ÃŒŽFîõSÖÒyu‘™™uÚ X ØAJÊuŒ—Ö±;úZÎ ¾M? ©Ëñ»D’K$V j`낪NÉà.A5]¨“n!OÜ ‘'‚±fe:EØ`Õñ?‰˜Ð”/ X¼¨”†…î’òø]"ªv®ëYÐ`Q©¾x Pf]°ÏÍDÕdÔfä2ÍP 7øLÒl•H¹¨Î©g[\(€žR]OÕ;yIJ¨—€‡¼®ÞrwR®cŽ8÷O¨l´.þà ?è1 ú·=Z˜dø€a¶mJÈÒ;™£ˆ¥\ Ïº;¹P*w&(šú2yLبT*_gÀY ³!ÕCîüÑb‹¦±%A^»¨)gwÉHÓ… ñ^A 7R¤„½ÀI.4SBf³|,ŒõiÍÞ%[N‚ë4|ü„…ôlPA>¸‘"è˜Æ¿NQ^§é®ØíBÅ2gñöÀM¤7PªÈâ&@P!Ǧ®ë5)ü.‘]m›–!þõ¤ÕGç2™;-ìÀ¥Î^Bq¿mïC° Ãaõ"åBZûüÑäÂ~WgŽL–¨Â1ú¬OX—*«´‚î’¨4Ýȹî{úæ»¶2ä®-;VHòœ´P_×¼þYОéçRŸM®6e&Í i‚Z›&hi÷I´„öà*z¸±"= þ˜5ãrWÌ’àÓ0°p}“Aì“ ¤eɺu pcE.@çÈM1oçX0Ëî+avòaVû7Vd@}…m;˜Ðé÷ödö‚äÆ8„Œr‡Q¬uv¬• µ-cÄâÑm¤÷f—„8]hÝüsÅùGœs›(Ò/KÅ-ÜÁé¸Kþ›.ÕUtpcE:ÔqÊûb„Pè#õB¯°Bï’ÊÂ^˜°.•eÇŠL¨MQHÁªÉGÉÁŠv~—È 7ôºÈÍŽY!P/&Wmå‘ )g Œ…Ë—*_ùéIC÷+£97V¤‡@½DÏ4P+ì>@­uœņ:6r3òÒ#9+ïÚº¶w«÷~I‘ÈÝ% IµõJÏæ†Š¦3 }©ß`Ï“R4¿˜ .sàèä.éG¬­Â5,pc­$4PŸ²KÕÖö(¤†z»Ð”Ý% ª¸òj¸±Vj¨÷¸×é¿ aŽsïJ¡´B§Zm*–;rÍö§õl¹°ÏÞtÊ ‘5lqc­l5P'vA¹”̓ïL6|–m³±vß±vä;ý ì¦Ìï|²ùf(7Z©b‹ôºNö–÷à?´ï`…Ò˜Ëc²h×m¯ÝK¹!GÞ±ˆn´ÀGƒ”N¾óa<ù2M|Þ—-Ú©‡ LÂüËäBÁÄÉ)ëí.:夔Tçq‰…|Ž JÆÅ8ê±2åA(‡š¨ú /F>ñ õºžnCt+‰aG\‰!ˆûfPn)Ûß”Hy°P]O ·ÌId+9a\9× KÁ”Øq~öAZàÅ\8 ·69ISVÂŽ8btèFJíÒÿøEiÜ)Õ‡‘Ȭ{hÝö.Ä­KAºFªšt±#®tÄ=À—%8%4fÅjsRØÅ*•”± f9)üˆ )1H=è~$ÒÂ_:'f,fcOZ¿ð±+W4¢\¡·…‡¹¨Ž*ðá½Do6ÂbâÈn×yqÞõóÀ­ÁyT"¯ðÎG)·Ï*”ö¾>9j¿‹²EŬΛ–ää–³ZPzØ,Ö*ÜÕ÷°ü¾ž0nÉF$#ëc]# ûÉí«óp³3…õèr$¸DÐÅ­"A‚IÏê+ž ЉpT°c$ϩłJ+drK—y1×?¼žn 2BD$+)aG\)!ˆiÓ$(©€*³hHÙ s+I¢$YI ;âJ AÜ–è¹ Íž€]…]ORY¡‚’u¬ð#.¬PÄôfbȺãësÅã*ìB$…IV’ÂŽ¸’B÷å—üŒÃûy†6pnQ 24ˆJVĸ4¾tÇŠÜeꟳ³pØM§¸·Ü #r“•Œ±#®ŒÄ—(˯‘# c-Œ#è\¶Û|˜g>Ç®w‘CåöûºIíÕܰËZ*7²–ǹáX¸¡I‡ÿ¡·'Và J×ôVÖ!v± ²‚b—ë(aGW)Atwx—yF+pI"6pn™ Ad.ìѺ¨é-UÊG¿Π`ëÅœ9QÃ}–yz'±j¡ö™S-ìxNæ“Î Qsä|`ÃT’]™ƒÆC”9‹Œ‡g5‚óSÞûÙ}Ò0»:ôÛÝctèãx¬×üÉx×ÓÄ-ÕAšˆTgMì8+MçD–B ;Ïü±‘׳Â-|AVˆðåß?×fµ+K$Î3嗻ȞTðc)ÑËçï«îÀ§<7`ªhìf.­yA2ÍË2.ØqV.œÍ'‹ÕeÖ{·ä¥rÐH^à˜é¾º/êù 1¸=”Di¥z Í™Øä†ÍôÚäK!Å©‚*À»1&Êãh8F[×#sjR;?}ðÔÕDr d*‘@å fi)ÉÏ- v>B«¶‰‡Çá! ÷˜÷ãa†Hê§|@˜„ÄÏ¡"@ܰã–ÇT®yÌÕ\±ƒ,\5 ‰ôíÉ”ySî9Ê6ØdÄ­ ©”5"š«)cY(i’žÔôF•v áq)nE n–k\ŠdáçF©úÑ\GYì!¢R)“±ªÅG•bh4÷t9|“–ä¹^ˆÁÏ+µ¹Ä=.FS ™wõ8üÁŠßÂÁx"œd“]ÊùlŒ®Õ\•Aÿr"ë̉SÓYªÉ{2wÐ1¥E¶{ŒuLÉ`˜Æ °§±Z³ÏÓ€à±%f,«01¨ wk6­“ýYmúÒ‚Õ$ÞkXã9!kDä´˜5v¬…µVAö€µ"DÖxz’Ê»XÐ3l5áe [Üò'dk?-&‹j!«Q–¸J+ ~¬‹hæ=‹ ‚¾OÑ¥èm2sƒÍüŒ[#…ÌÔbêØ±êZáîC©ÏµÎ„2Ö{Õ×êõ‡É/­rœKýÄä@­t~—Ú4DÑ ×·Iiáœ)mkõÈ9Ä›­&ÜB0´I"[l“ìX‹M¨Ì=S—טI*­CÓÓËËVT²ËÇ*•T>¶”J~¬™J u€‰O‘aµ•ýa*8åE †?}(ôaGR=¶@rÆ v!’I„p‹ÉdÇZÈ$Pßö³ûjˆóÕGhXW»¢ŠÕ ¹EpÈ[ûx§E´±C-´ H§Y#ü¾)‰†Å–R-ú“bã-¶5,r ãE"Œ[L#;ÖBcó¬ª <ö¥Ð4bïõ.²CD½Ny¢d³JæûZôìaxXðæy»š-jPó-6(v¨Å ¤kí‰pµ§ñã¼UJî`VÜŠD4+¢H\lWìX‹]¨ó†…güâý†•œÆröøàžl[È4 ãbÙ±GrË…4ÚÚ½O =Èš ”áBͳº•s²k +«ãÇ€-a•kf•BÅc+k—çÍiú¹ƒÆ»}t°Æç{cl1‚ ØZeñ `ìô6ÏãÜjU`—k¢ý¹æbûaÇZì‡@]b?ì(«ý˜—ZH¤©£øµ#åð†“yì:i}›­^ÜZT´¾A‹ºØøØ¡ã.±=vÕö”m)M:^õf£1rÞ–6[ɸU²hKD%»Ø˜Ø±c"P—X;ÊjMf‹åMSÆé¸ÃjÄ-ÕE "RÝÅÄŽµXºÄ‚ØQV "0ŸR6Ã3ôÅ­-Fƒ"ÚâÅÅŽµú®Ùæ0ÌðSn§ÛÜnwD×ÂR4³K‘A"=^Ì ;Ö ZGùøÜs6³:˜¸‹®Ûxðêñè>ÉWª~³Žâvº§Å%OYAֽƾ¸µÓh_D;½Ø¾Ø±û"Pgí‹Ü·ÁCDÛ½žˆPŸOÁºJ°«¬+‹Te½”E~¬™E užÅa – ˜aä»q®ÄÈ¥»q›…jvU6RH¸ˆ?v …?Ä9OÞü®ú”¢4»&É#šèÅü±c-ü¨Ã`Ø­@¶ Ã:ÙayPn—lšÐÊÎ_6]ÑÆ2¬÷-÷úsS–ƒm×nu7šQw/6-v¬Å´!úÅ[Þ"ö1îòôM4´F m­{R,¢ÙYíd„0Û· í‰ÈÐÛ;ÖbOêZ{bG\íi4»ô7˜Ì ÑO ö º=Ø®±¯ÍB!·ží‹èéÛ;Öb_êZûbG\í‹@~äÆô'(TEo0âY¼¸@ãXl[ìP‹m Hך;àjZâ¦ÔÂ)®OçÔrôxNº¯š(1(|Øâ\иC¨&ל‡°ÔèØ±f›k ®´:vÄÅèÈôTo³˜tÚ˜(<>€5ã>¡¡ÚÕ¥c$®¶+v¬Ù®¨³$aíøð>U±? Àqök¸m¨ô]:Yâjúرfú¨¹ÍýÛé §©Â¸ïM×{ Óãˆr—Ó> stream xœ½]Û’7rõóÄ~Ä¿xóÅß„²·¯?Ý ·¯o~ºéÇ·åÓ‹÷·_>‡_Ñ"¾t C·Ï¸Éo·NÞZ¯OBÞ>óí8˜;ÿëƒùîù¿ÃÛ¼¢o“Öž¤ï|þ2þöâ‚×áîëÃqä˯Gy÷Ÿy÷烾{ßüïá¨T8 Â7ŸGk㋃ͿTÞ_Úæ?’Þçãï«»¿Žø£¿ÄW¥¯º»¿ü9åéÏÿû ãWFŠ»çíÅúˆô‡ÿëp4ðœ,íí»é(í >Ê? "·ûðÝ/u÷)þ xßWÏo¾¹ùéV©“Mýæoƒ’ðVkŒ: ˆúòÙÍÏþãö—Ÿ?¿ºùânÅÍÿ¾üúOñÓ³?ßþËÍWÏn¿¹–Â`O YŸª3¯#‡¯b§G“ø„údwÏ ¶Ã÷cäà}d0ýŽÝ $ >þühfîBüIÈæxT‘l;ÈÛ£P'c‚_B‡.ö×thÏ»žn€HÁ÷ëAÉðçè©;@ʇع!vwdÂÆoíðÅ&¤'¿Ò\àÞ—ÍÐRƒå¡4 ÇW¬‡áHÀ(x7ÄÿÿÚFOú@øü÷×Xc‘à3DÒ…Í}Ô­é‹y“ŒßûP aOÎv ß`d÷&“ÿrìTg´‹?é߿ң=€ÿñS1Äçœ1‘¬¯:à,'2¶u¸"z¤`¿?$dw÷øÌÙqÊ^"Š—ˆÂ…ŽSe"B«E>a¼ÛÇ'âƒ.}âz&Øñf&(Ú{ìÏû6’#ÆšYFº†qz×0Nmàìp ! ì‹ÁDœ}90d¢hý¿l–ˆ´™]BÈø Ó ×À·@Ð6dš#d4IzŽQÁ‘c|¶'µÁüÀ·Ð@оÅÖ?G1 P«´ôã#h©;„j¼ý9Çwf3í]ã¹b2qd‘Ý­qÞÁÊ}‚Š8m0šrÃ-FÓÀ^i3ìøŠÍ4€T»û{ìÒ¯ãÊıEÎʲáE‡Ø3{D?ñAе–ÂŽ7[ E›°H ƒÒ /ãÈ}ŒøïÚ™W» v‰…´ó`Õ«9áÆ[8!hK¤\Ugù”rK)­¹edª­1»ÄAñAu«àÇiOƒƒNÑ;:18ÈQpÕ!àžÚBMï™”Ê ¯­•RJŽ_q+sÍÚÈa—ÀHm§ñ«`Þ&¾0ã'Î%®¸ ý°Ã ÉØŠñ{Hbˆ¥B¦U.ŒŠoJ)%½ÌA”ßÉAâpƒ6˜ÂnhLä°»e¡@d ¸± iJŸT¨o0\³à߯o3ßÅ2 )ùt@$°2ñ­¥ÙÉ5¤®¦¶”n¬ÈJƒ?gŒOýïÇúá”Qv›øû_ˆuÏ ;qva7ÄnˆqíÆÝ¯‚ »Ä´ñAqÐ\Å;ÖÂ…šÂ¼&ÐaCHÑì$ËÆ"åc ²G0«| ˆuŽ.Ä3\˜”Qe‡*dè`Îeô ss.åôp¯Á¬ó 7¸]&êø “¢õLj.ƃËÛÃi6ü~0¿úVCÚÃfÇ ;±Ñ9(lXë}O×z> °²ÀµîFËIaÓ1Nî2[+“6‚7£…7ÒB`ã<Á‡à1"–Z pš /c,-t­ì.sz|ÐiCßá†$5ÔOM­…°@“up"+ƒG$ï 9ˆ²Ðv€Œ]’¸®¶z;ãáÆÆC`_i=ì‹õ„43«œ·sBg1 çaÍ>Q“°Ð›Y 7n´ûæ8è|p4AÈ:m= 2ìC òd6œ¸q#1ötâ|0ú±`jáù&éÃ>Ž´¥ã°ã.üPØõ`ê‹|z¶r4R¹z´ÖB¶†¢…i:ÇyGZš7]¼Ï.½Â·¥3ûøv|йoãNƯ‡8áįòêã7dfìGîƒ]ÄáÔvÈÏOûB0™9¹Ìšê7îd‡A¯™ ¥•z—’´No“VgSÍ 1ùà";vx™â¡Å„8ÈœÑbÕ*WÑÞﲊ:éiBpŠ)å'qŒ˜Éò„*²C. žÒ€9ŠuŒÄ9qµ£¨Êa¤jå&£Ë©bìžæn¬BxHçP¨/Àz¢¥¨ÌIžûTAÿöptJ¤ ±ËBRhXç-r§²˜ø Zv“ùÌ•9&)S§á%$¿`+¤‚½1Šõ|›ÒI¤$÷Àà]ÃôJ†ŠbäЊbóÀ y Xkàš¶*ßÂûô鸦²Â¹YZ–Z"ìT§TOù/¥…l¡…bp¿УÀÙM>Z£_~§ŠákÌbN¸±"' *u ‹[X·OaB|P=꿘n°HÁZ_ÃÌ‘7ù °’Þ`Ô>å %ß¸Ž n°ÈÁš'nƒõkÙ/3ë SàB«iÌŸŒÉ'VÙÁÂ)%ÝCí‚^ØÜϧ•RŽá=xK\×—’7׎+é5®âw*šñµÊc!Ü@3þ²´ç¡ÏbÍ—‘6 ØÁ‚ô Kœ7:0æmÁ©¥ä¹õ8{ZUJãvª¤S7z¥CscÍÔ!]eCìx“ ux¶Ô«ï`ÇÒÓö²°Fo§*3ë VÙ 7Öl/RRKRí¥.òrƒ£Sòʱ_ïUåCÂ*6¸±f6:¤e=Q·¸?–díøá ímÖ–òì,<“¾C´¤D1 ô°ƒÍütP±()Mpd„…y°Õ(ðÕsÄFž#ü>Åb]ÌÄ 3“"êÙ º,|Î;Nq nü*î‹{k•MU”€ìQŸªêßd+¥ÕûâI›v‡¨ÞÜîü>wÒEú|v„¡·°ïw¦ˆ—{òãaúp‹„S%ÃóÙE ð·CXÓ.d='õ.‰9ðØ`SÅFfˆïŸ<`x½Íp‹â¡ÍQ¼z6 Üãå\j@zŸb?~”A–çT”ò1pjÐi“Žœˆ¢àÊ9T" j¡ ;øz„c#3{6êz{áÖD{!Ò‚ ì…e±‚R=Ù^¸Á¡½p íeƒñ…[áí…(.°v”Å^Ê™å­['õ¼P’Ë4^Ò³²£6˜£&Ë®çˆ[ñ9j’‡ (bY(j ﻽¤(¾.eæIXô¥)ž.7¼®æ‰]±ðD¯'Še&Š¢<¯ØóD«óî£çqv-D$£‰!.à‚dábT±1ˆ!ížrÌ¿caýôÂ.ˆˆ,EÄ4°£,4Œë6ÎD$)ëÆO Iâ»Ç…#Ò>R*¹ʸ6½ú¥È{å5_"âòKlL³ I¢õ%ÉÖËŽ²X/Ay•õrãCë%øFâéÁ)Oã€Im¸þbWºD“!R— L†e1‚’ ÕŽWù:mA\Ÿu>â˜DzˆÀäzØQzÊGé™qt¹“z§’ê—Ž®µÒP¾qîèÎç Ä­[v-©ÉN.0$vÅÈ—X¼Ñú2Ù€‡Nöùþ“‡ÜïG« ÜÔ_Läû=»4eakT›òÉtñ£ÌtQ”×ñÕzÞ«%n½›±ëW"qç–×ÇŽ²GPV ¥ô¡mñ_CÕTÚëêÏùnL·Ì%R4&sùtŠØQŠJrLîèá`ÉAq tÜ:–H²\@;ÊBAYO^?àA§š’ÊãÜL|“µÇØQC|c;ÐcáM›$‘ ÄLèõÄ-ÉDd8X;ÊbAe©i”¿÷FW/‡ênlàÔÜ:œH Ñá\@ ;ÊB AyAÉô%²š;L•¦Õf^\¥ZPàÜé­X®ôg¬ÞtO˜]IÍ•DØ;Äb;q‰ápcDÃAŒ—ƒ¿±¾ÛÖ<Ã.|Z † Ÿ^o3ü(³ÍP”—fs¶#lÃã;Âë'v5T$ˆ¢. ˆe!ˆ !¨èÝ‹Ð%­±zÌ•6^±ë£"SDuSì( SåS™šË;ú´{ÊŽ^v¯A;˜:м#”—s*´×·²+Qv]`Pì(‹A”TÒû¼Úf<`À.ŽŠD4qÔ<°ƒ,<\+1«owéEWoÝ;r»ssHº¬ZAìgb’‰hRšëzûá–GEû!ò¨ ˆe1 «ef«q#LDàQ31-9Ž%ɦKýL;U‘|½áp븢á׆Ã޲Ay¥áp#L†Cॠ†Ü?~´n°¨ƒ;l?ÀpËÊ¢ŒÉÊ>ÝNØQ;!(¯´n„ÉN¼‘u¿‡ó’“³ÑgWÙUc‹±PÕØë…e6ŠòâZ5B%¶=¦²ÞuÙc‘ "»€ v”… ‚²gã ]+”¦r{q*m£`G9†»—^ìN Šy7ŠØUmÑxˆ°íãaGYŒ‡ ìç7û©Ó˜Ï*LsåÈ®r‹5™Ûü°ƒ,ü4´V5ôC#Ë“De¹EˆÈíØQÊ®h¸èûÀ¾UwXS ‰WùŒ´Ÿp«Ý"ArMí+?ÊBÐÊóÛâ$g¸cní[deXSaʲ°BPN¤’‚Ðó¹ÈõC»ðmá„ ß^Ï ?ÊÌ E9Á‰©’G¹HðõáñC@ðKW+ wþÒ6а%ÚŠ>wp§'EB®·$n¹^´$¿¢Ö”d1¤’ØQšï«éŸ¼JwµÄAØæØ…]Òi"’¾ xbGYx"(¯ êѺ6iJ0×µI8=Oq¹p”N%‘³&pT’‡¶žÀ®—âMkŸ]ogÜrÅhgD®x±£,vFP^mgãqôÌî¶ô.Àî˜íwi"¾é)Æt–‰Û(-É.ÑŒö§×Ôó£,öGP^èÌÕa¦Ì;ÊR‡IQÎ|´J„‹ƒÛc²«I£õÈ5õ»ü(‹õ”—ª÷õìÍ?‹°o»¾÷SbËÐãRŽgqÉ®1Œ‰5å³ü( ceíÍzÌ{ØŠÈEX†mi²ËKF:}éë)ᇙ)é`6e¸}]íèríB®ÂÊcS²Œ[ɹÐä/«Q«RD]NOƒ 9éÏ6øû ì$Sßf%?{÷°‰›Ô«È¿mñÌÞÄ­•\XêÄ’+Qä´e¾ªF{¼ht&|ØGæ9†)ñè _Ü–‘RÓV¤‹,©¢36¾wÃâî}ŠN/5•×ÓÄ ½ÐÔA'ˆÉ=JŒ]¤kå" ÍC·s­€<—`~U’ñérÇïÕ!krãUƒ‚jï/½D#ÒX)!÷]Ê--s«.×#kDv¹r’ù¨kG?2¸Ä;j5 °çÖ¡î˺ h—îîµ]·ñ½®•˜%˜kÞ÷Œ2C ññ¥¹aN-rj–»^ JqÅTUÉÑÙ`Îk¹árÙèhçZÑ9+ôËß]ZlåôРµI nv¹c »ïº“;F9w: ÓÖº¬—Ì Ô¥¤úŸkç‚›d½Î¸$Ò®¿| :ñÈ8¶†nAadå\“ùjVØVФùþŠêCpNÒa÷èBìÀAMÐÓakèáÖïEzd·õ+û»®Éw/êWµ=ÓpùfþF¸‹F”']˜éL\3÷'çRévK’½e¶s-n¡_äNt[Ä”­'pd¥*šÆÌ`­r.U‰±gÛ¦C“í ZâÅ‚åu¨v<Û>Âu“2D­~3ä–Fº=»Cv¬…Ã^¶¸Û)Š}JƼ“.éÔ.þ¦œe­ßdYÁ».paê/¦l¦‚½éßû6ÑônÄ­Õq¹™²ë #—MWx9•ìX •r ÑI‘ÎR*­‘N\ ´]5µôÇVGXÞ1ÙP#õ°‹"µ‘p[ig\F+ŠË’´§ö”hª¤Bã£`øtÚ@¨[¸nê†5É-ŒIÄ—›$;Øb’ì›Ú¿/ÏŒ˜^Y!—¥kœEU’àU¸…|‘C"仜Cv°…Cv”ÃÏcÓ}ëÿDqûñ+)å~œr+#§D x9§ì` §,^d_f"S1g{ýxœ½Ù˜Ê­·‹Ü½Ýåܱƒ-ܰº0I\°6bºaèAAé…Þ‚Í\+LÌÃê¸Bã³­Ê÷ðm;6p«£}5õàåæÅ޵˜WÃÚúôÇ|”ïI&%Ô.ÂÌڧг×enõ.¯³é’njFPsµyèÇ®j\̈ª/¶#~°ÙŽ(ØÞÈdóª[§|n1äR墄@ X"vmc¤h/§l¡€ízUNdr¬‘»­þÙ¥Ž‘1"u|™öÇ“ -<“ôÎÇ‚ø;S:¨Ib„‘Ì÷‡>ÁƒMõ]3«~‘bUö6™ØwÎvmz¨m%£߈ ½ž§™JlSÖ„vž;ÈaL»fr )£%åd =›]h53¶»j§ @Q·¶ÜãMÎÙ½á ì«Ùþ`®‘„^÷ä2²F$—kÝbÍYR/<ÛC-vØ%¸Õ(6ß®bׯ.!ZÂó]2K½‰ñÝdŸl6ûpËäbŸ L.å8ÅÓ\;K@ñc¶2 sCú;ÍÌ’¼Ÿ—.­ò,‰ ·°y´À.£[ø¢2ºPÆ;SFa·üÞ«.È{Hž ž£l«a‡]X)#º[PÆ»PF`¿=$å,¯ì¶R$`|/¢`ADá|:eq=náZä‘×nÁ#;ìÂ㈦ñÅ‘šBÎ/Ó®¹Á‘s”¾ÍÜ[äé#"·OÈÈC·gÔ… ÞXŰ‹ºbÇ4]׳ •ï»­Ùlà?ŒEÏÍtfrvùKþVùt¿)iÕ(¿SÇëI‹‚Ri‡U,&D;Ý|ôâ^E–;íÕGi†…ÝùràÑDÈ#“‚Îçá;µÛ«g¨h‰ò4¤á­rlu> ´íÇ­‘ŠŸÉ¤fÈå¬Ô™O/õO¹KQäl™›—Ç}KúT` /<”Š$Ró›© <ÖÇ-\ŠäíR.òØ›’É#-yéÀAOÂþ·‡ãØ…ôy°iÍ}âŽ@lž\õ±›Õc—A-ÄRT&bù›’ˆ=tp]ò\™ÜRpº%»)²G”H¹ØcoJf¯€ž.§³ñƒØGv\ÏT`é•'T›ŒÐ•ŽI"¡ªú²Ã¿ÕôÎ.ЦHDX¹L‘½)Ù{9Ù5¦È M‘ Æ‹½ÕåÉ%£„èÆ¾Îà6û¸UeÑàšª,—½±·$Û[kÈJsãÆ‹æÖ?oÛ¨=< FŠtST$ï6Äqëç¢ÅýÜÎäpqŠÖ§E¿X7gË„îˆÚÑyÎs‘Û'lØ5l±“ˆ†më$’¾›Ó±Ò0`î6Ÿñ `?IïS}GZŽ×ÌËéve[äŠ(Ûþ:2ô$Ó½oCêÇl»O;§M–øån \â$»¦¼©S`ëýöU;9-eÐÝaã²È삲…Oª(;É'$•KžT+ÿ„éE;c÷il÷õ­¸~…nØÐÝ ]‡­ Ùåi‘Ñ&OË@({# ¡­çj?dæ´Þ¤i0œY#n3WäVzEâˆÔkQ¦"—P¼;Ðú‘9¢ô.RÀå¬#Ýz÷ãÌÅÉ1âôûtkIx’ ly¹ÇÀ:çz­IHõ c·m­± n±V´ "ÖJN+’Hª/xœì”ܧÎÂÞmAw–kΜP+˜a ÎÕpÇÖ1Ž^’uŒn–%6Ïù²«·¢eõÖ-‹½ŲH Ôu–ÅŽ,‹À[cYÛYÜú³hYDvcËboA±,Ò‚9!rþ%]åo­ì$"“cŠík8åV¨EN‰BíÆœ²· pJZð…‡É2m(<‰*R«/¨Ý*H ÜJ·…Ú3¥Û-¹åoBæ¶k‚Õ"ÈÈž¯7wUn-ÜB'ÕÂÝ’Kvø™Ê¿?ú÷îpôʦµ!2z6·ã–¿-4uò·Û2ÅÞ‚ÌTׂs²fb°¯»`GŒ÷ÊóbëèùqÍKâ/ßÎXm ˜[±·ê.ÅÞm-‹½Ù²º\oYì(³eu('|¥;sœÆ-0\«íˆÀð¶ÆÞ‚l`] ®70v”ÙÀ:”3;úVÛMŠqmvB”[$¹ž%"ÉÛZ²yuM¸0¯Y*‹|ãxˆ³Ý¾Å.…{‚'À ¾,'¢Ð9úfŠÄ¯öP³6BœšööÔ¤¤ÜF&¥„ü››ÿEŸŒˆendstream endobj 1284 0 obj 6509 endobj 1435 0 obj <> stream xœ½›ÛnÜ6†{-ô!t¹ºÌóá6m€º@¤0E/êØu‹Ä‡$6’¼}g(q5k¯×XQCñÚ{â'þÿ ‡ù©ƒlþ›ß_7'¿KíÚ«/h¯šOL/·ÓÃûëöÕ¾ÅHxjˆ"ÊöìŸfü°l­Òƒ ­ fª=»nþÜÈÎn<ü·ýëìצ7Æâ[z|úÞôc×»Í}§7_º^áÛ^Ÿ5o›O­†¯K_Ý›!´Q+øLë¬ÕƒÈúê´99ý­½ÿüpÙœ¼kesò þxõæ'x8ý¹ý¡y}Ú¾=ö*¢ ¢9 ­šñ2¾v½Ù|îz»ù¯S õ²3Ï’J%";ªT&u8!}ß™Í-tøu×ëôcBJÄÝÜtÊ{¯ŽC o“Y_ݹµ1,ÆH=WA#±½a¸Q³0„ôûòoèò²·©à„Z¢‚ r5TP~ðªHnÔ¬!M*`0`_¦`ÙbßÝ áa #Ga6aÅ‘ð%ª†8R°+‡5‹CH/³éGÊ`0é¯ðW”…ÑðœZ1bй¢h§HnÒ¬É ºG’9WpF”Ãn0Ê,‰|† c„uÒƒ’¢ ߺ^b¦²0†äL%ÖF¬7u‚Âz]ì¤Y„”h 7ÿb·â°‚…–xF˜]ôz#Èi«T¿ÐÐ Šª_vÔ, !½ÊÃÅÝ,ÈV |EG£^”faȫԿжS" 7j–†î“æ.×ÄøÂóÔv¤å§'©è3ìÞ? gß@¸›èi]˜­@ý"ßhxºFÅn¡½XT±³£fßÒÇùõ ½²¹ô+æVCÊCÆA— zܨYBš„@ÈT"éméïpÚqLg­pªNƒUYNå&Í’Ì ˆ—Jr¨Æ­Šn_vZ!.L„ tšTQÍÁŽ:‰@I‰ Æ0`¡ s xÓ)´†U˜;Ýæ#ð~^µÇ-.À‡EÑpf|”UÊ ãJQânÔìBzœ[Ø'·@Zò(Ì=‹MœµUªhh{7b¡M¸Q³M)µIy§êg;ñ!0M1U¢Jd¬÷)Ú•!¤;ÊŒ©5>ʬæ{¢fgqÌ,‹*E¥QÚµ!¤/jó|C>sÓ×1c;ƒË{g–) ÌmÜÓY&d“SîÂÀV¶R`ƒ2…ÍšÍCH?tZ¥¥=˜ÍØhÃlÆ€ºUf3ÐPQ÷ssæîϘ´ïå²HÖéFi Þ1Üâaò¸M)įܲC×*áä™íPœ·:87xc‰_tô±ÊÌ ‚!©Ä2쨓e(éq®á']C Ÿçk§ n‹ZÎw6o0é wØ?Ë2¾FW™‹éÖKüÚýCHô;áäBøÌÔ=µ<ÖÈ6^ø*Å%44è¢â’5»…évÂÉ-„pê½±&·YÐ6dç\[¤–[1áX¯ª”˜ÚlQ‰ÉŽš-DH´;ád!B8Õ4óŽ(b¡K\ÒæEë,Ì>F»*µ144”%nÒìœôHã°NÆ™Óðt3ûeìO\¦èC¶l­á-dºXÅÁ•ÕÅܨÙ,„ôH·°Nn!„;‹Ìi[ß ó§…Ñt¶Ný — Êê_nÔìBºã“Ã*Mxü˜P›³ƒ¹c\ñîÉä%Y[˜T´Jù+Ô`ËF nÔlBºÄ,옓Yæ¾] ½V¡k†¨cnUU!ÖI/ÐPazaGCI÷N^¹F§›ü¨Æ¡](*ÝI5KD³:ø„Ð%éEy['½@C…é…5›…î7ËÈ~Ûi?.š¥ëù’4JwIìºç3”°ÓWå$àiÄš5"¤w9·~ƒ_Ä|ˆÌ®w‡D™ªÌ¡¡¡¨°g'ÍÌ ´ÿe:Î7©w×q({^”…a¡+¹TºôÈ%;jV…&H¬ŒòÙËôÄð» w¦¾kˆªtÊ*> stream xœ½koDZŸé¿É¢¤÷ýøÔ‹ºHÛ8UÑm?Ø’,¶dÙí$¿¾3³;{{{{GÛÀ¢BÍìÎûy÷v-ör-ð¿üy~³zôƒÔn}õ~%ÖW«·+I^çó›õã31¾ÚGåúìå*!˵WkÌ^ªõÙÍê?¹µÿÜÖþïì/ˆt¦œÛ«˜gý‡­ÜÇLÜ|¿Ýu~}²Ý©Íß¶jóíÖlžâÿü{»Ó:î…´ò~»s¾.e øB—!¼ðzó÷íŽÿô'øV9øÖo~Øjž~»þÍêÉÓõ³Ïµ%)ÜÞ¼g/]²§w ^b…/Âæ ŒÃF±ªf$±7dµC¡9¡²˜‘Cü‡‚¸µU a“‘f!" ù|«ýæz‹FlØÜoõæEŽÊÊ ¶¦¦Ôë•ÐlÑßÀmß$YNma;T"…o’QhãH]þ×öM1Ðhm×@›ôqd’ »_ F°=ø ýzÅ”¨ ™ðÆ8ˆ\Ým°$üæg´ô ¶½(D'EÉ'¡€Ó*R¶]†¾@Öî€bM2s'ü÷š‚´LE+,ªÃcU´¦!mÆ ö¾kp~%’\P$Æ’HÌo¢EÂQK²"²Åa¤œDXkÌ` NêúÔ6R0“.•gªMîÍDŽšüˆš´’í¨{(zÏ ±Ñ2¥µuÒØD^\ ×]f¹Gï­w p̲ÛÐ(µîÚE9…{eél2KˆmÕ EQ(ª[V7Úœ å3hÚUÒ\™\b‡_øÄ(£žzafxŠþs®vQlã’‚HS Ve0éRÌIG›ÈŸÀéÇ,«³ ÇŠ 1šYHŠh!èš(éÓJ€ü SžW%vMÔ§©D•v‹på@-™F» zÀqÂ$iOxË7ľÚ/KøKºÓ"ßêáÞâ±p‰Å€¦È"•Ò`/D™i Ç2 FöxEÀŸðØ‚qO1ìHÞ„0 i•N3\í=XÃZ{Ñó~Œ®.…Á àqçáU:詚ÒÏ„ŒuÇ­ê8å¨D—*A¿M´8Lª–ƒÁ°)ÝÊ“‡‡ˆéVTá¼âr)>4ü‰©än,Þ6íò8:u9ç #Sn–Ëbý9ÅgpïjeÍÎJ|éƒÚ/‘>õO<äÊó“8¸ôÕMß“‘ŽÄC¨šÅ¡CÛSY…Éà  §AìAS†½Én·Á¬?Ìö‘8o»k¶8ÁcÈD”TÆÆh§ìLÃ-O–ÀgB턺 ëÅ„Ûzz¡äÃÜz·Ì  ù* Ñi”fFZ›¼Ë{ƒ°M~že9Íš/=TSX ߟ²ĵˆ3pP¤fj hOËÌ}\ ò¼×aa«#µÎ-~O #¼y'VÁ(tb+œ:ikÉRPwÿ !PyI’d½fTÇ,HÙv*¬ZüŒØevà*çû…œÏ×j© «¶C©¹Š0Ò¿W3§^\©0?ɺSj4ÊŠ“VÎZ€^áÂoG¸Áf½4¹Þá8¦ª+_Ua M„jôô]PbÝ Óˆxå¤kêŸ ö¦ÖᤱkTcHfh)&ÑààäýNÒZ¯Ýù­±A „¿„´†õ¾ä5¯±‚L=Öó&ªÚ™ÚB½ äý"úOÉË툰NLÇÌÌ'½Ùœ’šðÚ KCƒÖ‡E{S˜÷Âq.°Q."l¯)°¥™ñ"2Ë­í`îAäf~‰âÜ‹£ÍQŠ«‚…ªç dT@PÚP\Pn^+››¿)VŠ*VO­tÞ J‘–#ʧZDåý”…”͵熴=4:5RM¦åÂî2Ï%’ì8M‹ýpé ^·a³Œ©1d£Úúºb²Yl€óÒX¸òëÿiyM2X“-ñ]èô(A”Uœæ5ËZIj$ꎠ:§îw•v¾ ÷iæ.ªèþ€›«?m6aÐôŠW ØI‹X ¼«ôM æ9=´¥[ÅP%úËRA ‚ôÕ¯Þ6ý/ˆƒ¶Ív¸öÕÖÄZÒÞQZSÒ˲îëW'Ý\ÔÚ^ëaÓÊåZºWsDÝõΠƲñKŽSg\ôh%Õ1/.(y˜ TiJ º ~à.‡Ê×4%¶“fžyÉs# ÆJÅ2tª‹§Ê ra28;`ÞLƒ ša²Ûn@y¯€O7µó¶&¿9]݈¦éGˆziF3ƒž„ô•êcŸà¦Î•! •úG|Þ|ˆNâ#g:â¶úô!îÁ'ÏF!"Î…ˆíœåyV³ ¾y„d”[[´bI>—ì3–T;&˜RüÕ—ã3Ãy¸òa«Uqz©ËЬv—pöŽÞ§itÊ.ºå¡ ;Põ|¸éÛLƒOƒ3ó«hXЋŒ¤—S/ËX/mÙçè…mü'‘ª‘霎P‡T”"Ûè“çüⶸ.t_Šh‘>¯û¨w«~‹Üý¼\õšèµâgÜ—gÔÒ‹ÆÎæ@—|UPÞÕZȯž5Tôn¦é;ž‰ŸiPtR²Œf cTe—¡zȪZð3oúuº(á B†Î«!Ç©¹.‡ÜM©™É‡*"§—u~·Hñµ½âî ¾·RU$–Ž»v-Uïf°œê¥$éj·¡j[”=‡ëÔD>¤Ý‡îÛ.Yo9°%¯–}”AÌ·#]áþ·óŠG…Yù4¿Ê¡Só ´µÓå ¸Sì(ÝtO!¤û¶Mƒ3ЉԙôLñøi‰‘9Vèƒý ãCIøgPêçY«ÕQk™Õysõ…²£µì3ÓyUÌË/àŠ>Òˆ{.‰Þ  Ò„íbt€ìnˆöwÃKŒí;Ì#¯cgÄv^Älg ]ÌáöçɤõaÎ}‡òBÁÄêlœ/ßE¬ÆùÅ50•®yÕvÏ5êtº“o(O<[ý`5c‡endstream endobj 1478 0 obj 3570 endobj 1724 0 obj <> stream xœ•“Ûn1†¹6/áKɎǧß*©Vâõ* TM›By{f¼‡lB+TE›=}ÿÿÝKgA:þõçÕNÌ.!dy}/œ¼{õµìO«œ·ŒD G¶¸²ý&:1ÈäƒÍ(3F ^¶;ñUNªéŽ«öƒ01&FŒ/Ö£#õš ×ÔO¢nµÉê‡6> ØRT g¾SB°)”íGѾé%ÿ®½:¤ÉÈ’B’ÜIFîN›¤6:ªsà™ËÇ¢Fîž^)&•ÐÄZ}Œà'e¨F]}âˆñ¤Ø&ÅVÍ6P«å4ÇèîØavþ ÑŸÚ Iþ©f€@Ñ­÷.ÿãÇ­Xн ´±º=-ÒN©D™b.6"ûa¾³Å'y¸{؈Ù böžÿæŸßÒiñN¾ ¹|©SÀgÊKi8Ëh”É0LDÌ8“j“Ú-=ë ÚBhº«-÷ÝÙbÏ=ó¼þ†õˆƒ>ž®îztZjs¦ øKZ&< uß)…§‚5›ÁQLçDÅJ皢m5Í®ŸÔø J÷ŰýËDò[›X _÷½c“1Å81^ÕÔZ¶,b¥u²½ 58tÿ̘G;Þjßâ±fæ›iæjÂ¥ø nlõendstream endobj 1725 0 obj 484 endobj 1747 0 obj <> stream xœm=k1 †wÿ Ò`×’?ÎSšB:ô#u¡2%4Ó ¡ÿ*ß]ÚŠ0’_½Ïk|ï|¯¥ŸFs·çáòm<\ÌÕ𴆥F¸oÝY%W}eh_f†\¢c6š2%ôJÇöÔ±Ö˜äì¤(ÙÎêÞ»ZK¬øJöŸqKVð™(â®_>ɆPç´‚ÙœUôy6-„ ó2qEý_ÈÞVªJVuÀ=…ÊzÿA¢SÆö'þ>1¿“M=`þßm3oZ?réHendstream endobj 1748 0 obj 211 endobj 1752 0 obj <> stream xœÝ[moÛFþnÜú‰:D,—Ë׊Câ8m ¿ÕV¸¶‡@‘lÙËv$ÙŽÿ}w–»;3ä0²ç  ¨ôrömö™™gf™Oƒ$VƒþsÿŸ.¶¾?RºÌW[É`¾õiKÙ×÷¿ébðjlEÊAšÄE‘ƒñéVÓY Êt—z0^lý½ª8©ê,ºŽÒ8M“Ò>j§yª£óºÖIQF—Í{¥u4ÃÇóáHÅ…RI}6½J3˜‘}YVëò?ã_ü:²¸¬JëÈó8Óu5ïnÿþ{t8LË8­rM`´$¯µŠ–ÃQת¨kÚº€U]Õfaæ½*]—ÑÚ,2­j+#°„å踨óèõ0‰ÓB%*õJWiô7ÓœUªÈ”Ù<&E^ÀŽÒ¸¨’$ÇqIÛHª²P5í´]ëL7Öª6g×IÝl¸ŽU‘¤~ÃfCô©£ûðt?f§y‘G£á(OÕîI›•ŒrUÇumµYĉʣ1ü}?ïàgǽIªèÈ4˜'¥¢a}u]UE¤BãC#›Ôf” vèZOM£9ýÄœè$4^bÿ{Ûɪ·yw‚ïÖ¡ñ—Ò('¡qÖŒw&(u!‡]WnýII–ºd’^k7Ò"fÒNññ]¯LWTv6„ãÖEW™±¬ñÌÔ‹á(«K#PSÉ |\±¡šÃ*£7(ðwQö[wÂ#L?ró”ŽóÌ –a1¶ ?‡¶41ÊpðDmØ#®¬Þ®àM€DE°ºpàì3QÛ”žª{ºp ªrr DÄçSáa¶‰ã«ÉdøNZ ´’WYÞ2î$¸¡ ­…åÀQÁ µý€5rГío•GÎè$8ˆ©³{\¡ó 3wZNÝÑYxƒÚÿØ<¢Q,àL*{Â+iâá^†Æ9¤Ù%uïÂÞ.Ã~¯éU¢K¿ß5Ý7^ì|íáVèº(ÿ@‘ÖvUIÞ‹{¹””4ν}gDU×þ¦ÒH§R#öY¶5Iñ‚š\eØ??ó¸Ñ’[aH@½/Q½lÝòZn]1ºÚqh<]í)µ·îHäPÍw=JG|y—:¿Ç>‹ÐøAýB}Š_HçŒg²Æa‚·B2¡fdã…á?©˜5b>Ì:­rÀÙKQ–Œð"iQ®Ó 9XÜ+Àÿág츅ÛÞ{øó-üìÁÏO€¿<š¡ò27ÃFUEÂAn$k[IjœK’mÆ`u;•°(r ;èˆÁšŽaå?ÃÏÁÐQ¨¦—Ý«°Ã$-ì“ÌÀF"U`\!û}ÔÖÈ5μ$H?“HöÜ`&»¬µ4Ó\jD?ßÕ×nPÕ¾ÓÈf08Ué ›~U¡w¹’:Í‘fýú^€Îü˜oƒà6¡¬*¡¹Ñcx 9Ñì¯Ò£3<¶/9’Ü0cE>†<ê?¶DGAœÄÐ0jýåC-îAãt)F7¢mâxEÅMèÎûýÐë°P›À½â¸Ùé,™BÄ0Õ]{b™¸ö™äRˆ‡î#Qô3`qÄü¡êº•XÅi¶Ü-DzµYøa@q„Ħ–ùqÚï7þÄ´À7¾@è¿ ïI¢õsh<ÀF(|ãûÐØkÎnÉbR=C­¼£çïß„Æ}6(z`Ñ›¸§Ÿ>M:6ÄØqÝÒ£³^‰Ìæ¶a6Ų́Í;‹£NÞ¼,Kt›á9G9 8!”v:ôYíÉ¥¶-‹ª9’@±B€1˜ì`.Iv _i<4q¤Ó]׿‹ ñ£ºw;‘|iSi…,úË-…ÿÿeÉ`Lm]™Ž‹Ê£‹øÔ«L9î8½ ©À=ö蟉h<éø=¼“€»¦ÇïÆ›ßP™þsB~xŒ$žö‰ÑTÐNNëDàqp'.``-šƒª ‚®qÚU/|²Ì{™PsUW`´@ tTÂÒ¡ÊNNÉõIƒbáÙ5–Rc…H¢EòU…F¨@V…]‚XæzxÙbMQäžn¥>ìÉ:œs½ Žç\šòLÊeVÈv×LT`S9¤~{+‚€[)º®&¬U±*<žø¨¾Ö+¯‹„Àu e͘ÜI½ <Ϧc,ÜØ’+Þ„òBÞ¹ëwbÚH|üs?æÏ–já:Z\³Ð-.0õ®½ñô@r‹Tù²Fó ³6†ê|7†‰VÑÕêÅÒò:®/?µÞìÆ|x½YTð%F’ß’pêÔ1ÕIgQf÷X6#±üs‹]7›" >˜xfâ@F¸_鸪©˜ù^D ¦ÁªES쩵rÊ‘_AÚ˜aêP´§…íí¡ËD›ºØð'P{_È·§i¶e&rU—ËõÕ¥t€É–O˜¦Å€fû¥ºÂZjäÎÕ†¡ºÇ'm¾Sðf& Σdž1Clê…]×9@o£¹®;FY¼£‡î÷7Éîã€ßLîoì×i/ñ]x?ÖûáÈ%Óßÿ+ ê½:±‡Ï?ç!˜ô®ÞOC”¸  ó4ñ+÷úl—ì"/Ú3|ã?ΠDÞ4ý‹ ‚øÙ‘Xõ …¯Ú8^¦„úµ¦z}:ß´0Wøp©Í+m “ ök6»²M,1:ÌÛyo—Q9”m4bÝ.äÈéáU0oïl]ïõÌácèb¿Ü»£Ç«IzˆŸãt¿  I79&Ÿµ!ç?—:ðÌ‚'EjK©8zS=ÇEûR=¬ôxÄ£gç‰^w¥˜}HŸKõævÞ ·?W’× : Ÿ/ ¹ø[Ÿjža=;%1‚Ë%ybÖ%¯ÃÌÈ9¯>8³ˆ×ÒIH’}8íöA'÷Ï/„%Tê:•P°›NHhâíËõxqØåšsI-bZÊ*ç¨pŸŽˆn~C”øm/òH /òûE~JJÈäï&IÒ‰ìxgóHþÛ6¼úÜ®öÐÎ¥& %œzeÉÕê1[Š”ÖÒGV½L+»Lk~²ƒ 3t®òÎܺR›CûlOÀpfèðÝ>º,:M¿f]>óß >F*ø·ëÝÍD$¸ŒØ©vñ·Ïâ„óƒèýÉ-:¦Ëû]xPb§— j-¤¦ð%~ŽÝ¹3ºÎ}f1‡lRÆZ¤¯ã`5Í×<öKc¾Í†µX›ýÚß“!÷Dq÷·úVRÏ‹zXÏuÀÚÿª$Æ„ç=º¿ÿËb޽síûlÅ‘Up:ŸŒ®À…_àgj¯Ö`¸#UÔC*éž6UkH¸ú³ó†áwùìÞûÞf->b|<`#áô8*U@_HË’þ€"K¼å—ÝZŽÓÍÿÀÒក¸£à<½« Ôê_å$*’TáI•ÄŸÑŽþ/æ7Ð)¤2EÿA˜*RûOvLj¹†æ&QË£z˜C§ñÖ¯æ¿?¶ñ²endstream endobj 1753 0 obj 2898 endobj 1757 0 obj <> stream xœÕ\YoG~ׯöÅäB¤çâpÆAlËNX¶W–6’E “º`2I]ùõ;}Ô5]áiy‘Ešì黾ªúªºG_w£~¼™ÿü¿£éÎÓ£8Íw/–;ÑîÅÎר>ÞõÿŒ¦»/ŽM•,®ŠúeTÆ»Çç;®q¼;Lvó"ëÇÉîñtç÷NÜtŠêÿ¨;øÏño¦Y‘òfIšõ‹¬jy<®j?ïÆý²,²²ó¾ÛS¾¾êö’ÎÛnÒÙïfóãc·—¦e?ŠUY¿ÛËsÓ¤TMÒŒõxÔíEækœUiÒ9ì&æg‘»^«ŽªßyéFéGÑ ‰M£4«îíUaœåüùënZ}KS?3µ7Ý<ÉMŸÐÆ>~Gc˜šªÉV“ÄíL—|gz~kziÔÆeévhTuÑY˜3óqj>VøóOóa«ÌÍÇÄ|ôªI”Eµ;‰´sÞí ’Èî˜Y³]bçÄ|¼2Ó«¦wöª:QavÐu~ #¸Ç3ßE4ì\ñBØÐ%žQá W¦÷Ò6?µ=™¶aƒ»êY\ÚIŒðùœžO°ð† §b’~1É‘g”Û…¹ÂKj~FcÒóSzþ '¢ß73æ€OtÕ5Nƒ~@÷CfiQÛ"¶xøzEu—bPÿÕtÞKʤê½§ýA%n‹[ àAtÅñ“•Ã~Y ¥Èa;h‘÷bj¾pÉ— …WTH¾°{´­H¡°…võyê–>( ¦&7¸LR˜™_p¥C£}Wߢf;ü"I-lqÖŠ«‘¶F’ÍBÃÕLì®UÍJN¿âó}z~B#Ýi‚ -žÐœ Ög¤ ª„®µ>i¢cJDã›ãþnr‹uŠvêK%A>yÜáÓ¥TÇ”anE+û`ï®+²`·ë[æ¹VH»tÊ{‡œ e°ºVfÌTÞh}Ž´MfºFÍϵŽ&ÞöGqçVø™*ÄXøG—à0×L’h g3”ኤb‡2£€BõÌo3”%5Ê[é_Þw¾ÖOà+ zÃ÷4îÒÁä¯õ‚›Óz®ø.¹Iµëé>>NϵÂXxB…‡¤§_´‰>pk …sÍ Œ©§+!y·ð¹4ÖX•FisÖâWjVêö»Â䢷Ѵ{‰fx*MnjÊOORfÀ!붨yR³ÀpBq­áåL«Ùd\A_F ðóKWQL‚ðÔù»ó®bîYÇš>~ƬÝì1mn²Éä(ÇRj§¾Ì,Äf:a/¬¹7WàýZHÔÚZÎÂë¶©Z!©È7è²*ì1=ߪÓ&÷K¼¤iƒ—òçöÿ·{M]17H¾q!-”2²íFúAjQYµ,5®™µØoÆ‚[>dçT©±×’%/ç|x¦r-íÞ|+MØ×\ØÌ½³ÍÞ0ºÕ&¢òuR6ëç‰wNÔœÙÄ»®‚OæoªXWà nÂp ÖQd¼î Ÿ99>žq¨{D¥ôõ-}ý…êîµl6ðxc>L¦À4ö;a÷—æã9VÙ#äØv/ÌÇ'lÂæ^‹ën“aK{…Ÿ4ÎóŠ ÷H jOdßQá‘6;µ§±ó¾ðW*|‡…GÚDÝ:Y”Nó$*SÄJOñA¾  €=¸ÐŸ•¾áS¶°L+±€Ë)Í]½šÉ¼[;ß™¯kaçÇWp÷Z€Inêžî‘¯±¿÷¥èñ z”u ô9ïV0ɼԄzH…ï±Píóc€í8cÞFw÷4:óÜ/´^j0>ÄÂöÉq•¢§šk!Ͼò.Ÿ“/+ŸÈ°ü…Öÿ)–Y‡#ȯ³Ý]«á¯Há@á3ÒÞ'šñø´¾°§íê¡öx_“ ’9­K,|†ß¦ZðLã?ŒÃcމ¥5ª¯V“¡IqG$GWñ‰P¼l`Ó½¼ôSðÕhqXj¾Êͺ‡j…±úõI³ûÉmŽ^I.(n·qqЧ|;œÄð1ÐxS;Î3ðÁDBx†£U6†]ôc XvãDƒ³2–àZ20äÍb±­¾0¥B™)‘t1Hr!ñ#Åc«[ ºhWxƒÕD*Œlœ§)åHºÎ%Mu%jÈYΦÌ̆øâœ»šGk³#…SCv6å±!u}aÖnq-Ö²RøËWÖdö?¬C€À)¥ó&ƒ)ö ÙcèÂ’ùZ<ï}Ì©¶½*ái«IôЙ]P 8Õú+€AØÿ&jó}§ ÖFoò$4×à/$Êóðc§¡tô eÈPÍÐÒbä!Ÿê^Í´žD†—$þu«uPŸSM7/d#K\“:­öe\YŒöÙy±"í’ˆ@)AÒ‚¼‰ÔOîX|ŸJn0“ü0£Vªg$þ1ÙÁƒžïZQS΀ úoB š™SÄÌ04ÛÀÃ4oÂ%Oî°lŒýRµÞJk´¼œ&¸ð%ì—ǵù¨Sò;¤ÝÙˆž¢Vi¶ùÚôÜ–|>të—0 YvpvçðGì‡êИ#Ïh; ¼çX‡‰ôu¸Ã}©t~AÿÀçFiØ‘µJ°0 »rŽÍ?Ï´TÄ€ s”4‰¦b-¥®TxÈ}ü‰;¶ô€å‰§Ze©ëþ–…Hp2Å)ܚԢƉgÝ-8ñ¬A¹Cíi¶aB42P|Õ‚|!93“\P…¨«Üî¹ÔzeÆjI½ª¡ú}£¡4Ø×$HIÄ{ÿ“¥_ŠßÉ4T ÕrŠgawBq«´\°bXóçsÊYhfGÞ-á¡Ö¦VÍTf&c1—èÈeý¹ IC˜%G§ÎÓ4 %µh²i=?[ÅzÜ£y°q¢^¡¢…—ƒØ  Zõ‹x[5ož»^’ÑU5†—Û LK½ÙÂAX2ˆ8áOÜdIS›ø§s?:{EšËv5Â]õ;.w5k»ÈÒÇ*SY𚤗À§T[ÇdvÓU”¹)³Þ2"ìa®€…~+å¾ Ù<šÚíÒ{«ùŽÏ¸Bà[úš%Q57úxqÁL‹šr`>F5s2_ë'ªÂš À|£ˆ­vj[rη,Œçd‚¦vè×Òt+§ZÄæ`‘p$Ðc¿ñ»¨D‘Á µ¢ã ¢'t–±’ôü-©£zÑLæ'TÂ]Ò­²£“"³Àâ9Õa«Wï X$M iGVô|™‚ IëkíkwW5 nì#-È–ÇÐï—F´iVëÚ[#žÿüŒ&ßÚ €Õ!iFù«ú!]=Ö®51èL@"cDQMÂuW1S-·”›®CËHUpØú}D¦œÃ2^ãœXD\jµØ\T>ñ@ªx©=7Ñ!I£n½êо%¿J"`1äD«É–ɲAì>4»žòÁkjÞ&˜3FÞ’¦Ë®¥Gk©ï«IÁV«ÒpZp‹O­a¿‘Û®Óy9/*Õ[ 5oÅÎøBvtÿŠÜùI2ßhâ$Ôö`ŽD V™µÊœ5fçÞX§ñáJ.?õ¢¤b3p'ø)ðÜã#<Ÿc®®íÍõôš†iúw®ªûü“¸ ¹­-sfáa[çæLrtö–:bv $íC1ÔõWöNƒ‡€qù®„Ž0_Dä ÑBögÁ"Þ‘ãæa)þ-Œ‚/¿áœIÍò³¿EЦQ2óÎåîˆXûKYa†eoۦ篖4^W]+˜sÜôš‚ìLœî鬨åÚªáÒîuF °ú>-í¬|ëZ©gÍK­‘ê¨]a»º> stream xœí\YsI~ׯàÍ0!šæhìЃÙã]yÆ+ɱëðL8$@²Â€0 É̯߮#¯ªl¼vl8FM]]ùåYÙ|©4I¥iþù¿ƒÉÞ¯ÇIÚ­\.öš•˽/{‰í®ø?ƒIåÙ©ÒNò¦F¿ÙO*§{nrRé´ÒF7«t³v#iUN'{ªI­SÍòÿùß¿Nÿ‘OM“>ŸZO³ÌÌ©§ÍF/é÷+§Ã|ÖËZ=­¾6§æã¤Vï´šf3«ž™ïsü0_óö$©®Ì×F­ž4[F¿o'ºžOµz+oɲnu”/”ôó/|æœúçØxF+?)ëU'ØCý l\æ#›ýF3iWϱÑÜ3Mòënõ/üå#Ç|$¬9ÅÆKj\òG²7jöª¿cãSùl|M†ŠÍ,ÿÒæO7¥Ë!¾rº§– Õ棉Õêí~/'HÇNq b5N©qY<c*¿G¼Ä®ÏÖ¾¦n…ߘP㾇E~— ìŸQ?=äW•cºü@œb7Täì·ðÖ)‹¥#´ BÎŽwúYåôhïô—¤ , ™ìYȧ–‚¹Ž1—"HÀŽ%à´k©´q-À ë¹Ý4€-sé•[«ÛJªuÇ÷™ß±‡î”ß+uøÃVºÑó¹Eqísw)x³n¤ª±.g¦Y*ÄXµÞhôa#o¸fæŒtšu¨Ýn9ÐnÉvÎIz¡û’£L_R+ÃÉ)ÉÀ‰Sk½V£Õ½& ª(KöPfüBu?â†ð?¸¹à){¢+Ô‡ŒAN{ohjɸy¯Ú±2r}Öø¶ÂÆ;j¼æàÆÉ‹Ú­¦AǾP( ¦¸DZ؇¿A ä»O:ÝnнÆäKkîe­¤ *tÜ æpƒhC3aFüÒŒx_¡œÍ>[e®ÉçDäxäŠH¹“ôgu½t£Ý¬±jÒ–U@? ãôgMȲPQ—ÍcöWØ+Ô™ï£âü%€=ªÙH7KF‚X@LÕ:Ÿ‘ݹԈ]iÉG²-5^kTgÞÄoØÿ‚úߨ*¤9¢Ú ÆLÒü•i;6okÞyÇ[xûÕ|ãŽÌÇsNívÖ³’¤²@Uþ_éɶR à Ó†ŠêÐÀøB^Ój3¶yTäD{HDŰä’gO§Óhí9'+3VÑ2¸€V ˜¶/ln§ZýÜNY3ÕNÁL Ñ ,ýxå ´Ðß ´1ܰsaL=3Uu@C›d•ˆyò ªõSc]x%¼Œ}ëG`c¨aX•s£ɾÅNeØz&¬ðëˆT`ÔÕ«5œaŽh¨›ËTÐL{Õð³G9Û!ÎP'Ù"æÊ,Ö³…y“¤%T§˜æ,JöÁ|"òºÆNrÓœ¤i_‰‡'ˆ"œ6v(åZ Q(*B`{{+ ž²\ côɺ‡ æø n sçõ{¹¹4<]ï®0&Ýi¨¼ŸÊ]B)ߌ&~L›~æò#eÑÉ‹h€¹|ê×N}4GÔ}¤NzG—Çê½öƒðÅ-/ëclŽï£â5|D_áÐ|جà>h0™m.ŽÛ_`#Ûû[lü¯NÄÎù=\ÿN7"@ñ«‡¿Ñ16âÕKm¡wÚɵvÖÍ¿tʳ„ Ï+j–°t¾¥IPëÉnÈ ç,5÷/²3´dÖrM¼zKšiœÛ[ìKSÈL˜u±\æ¬íÂ/ftW™«Qf,!Ç’×P÷†I9}×P\ />ycÂr¾yTÔL«_"6øiFð8ˆ_ë+î”Õ(²-ÐÏзš£ÃŒÝD£%d±òNQû£a‚ÔØ:`„õû>Ë8ïEa!¡ë&¤qzœÑ㶦@O%Ç…Ö8àIþHìŽIoÝÆ”"3©&!BÂÇb‰„h¡1is=î´³i2ŠÜù)òdÌ3×z^uóÝÜÉ…îL,5™†/´©›ÚZvyúêßëùvMùYá'o*F”øMh,ßøœÿ©lræÞ8Ñ8 §YLÅ,*Ó8TR¸EÔØÙ¥?Ë­ ÚÎÀ°µ[mÓ)]ª@†EÊ45m-Âñ¢1i|±8zH;äOcÅ5Ó4ÒF¥W@€€‰%õsM‘Tõ¤ÄøŠ Bçæ© øÀ"—oÛ/ ïS5GëÜ7QÕl<Åoá19,ö|ýù á•&}ÌõæŽÛ‚Ë÷4VrH öÞQv€ßš¥¯Z-p D䆯¬½w†øu.Õ e–Òg›£ÏF¹„¾Ó-t|Ït'ü&…j¨ä$rM¦ÁÒ]MÏLµ5ÏÖ¯YvÔXtL²ihPdîàRØ;Ì~ÎK¦fùRÅnyo p¢¦€y}c=ŽìMefXÃÑáBå>ök]2c+AvÒàŠ¸*òôœ¨ *xâSúiUÌØ´þŸwlpüWdP¢_Ø¢ñ ilÉôwB&hÉNŸ®Ï;UÏÿ¼€b%á d§$ß'à$WÌ3Ù§˜H-àÙŸ‚ÐWÂ×á•4ÜÅA“µÌ¦à„Y9“¨r¹°÷”u}87WUuä®M4y =7'/÷Ô¹LÜz4”بž¡ˆˆÁlª5•}1Ëžä&>7cÕ {uñôЇ?„d!ªâìŸÑ´x±@«FæÙîU±Ît蔎 Þw`D'Y0+$žMê!Õª¦å=XºŽàü\>H±t A"Ù¡T ûSÍ­A$ýoà’´¥f£<:ŒU³A pê#úVƒá˜²5ey?õäCT'êQ¹Z=â)6ÒØ#$ ÿ_k|:¡‘CmŸêéÜ”ï3~à8L–cÖ1¾€Jå:t]90Ä9h²|b6.¦[«äçüaâ² Vê¡êÉÜÖO)£Ã®‡ÓîªíUY™´€×È‘]e¾M˜Á4À’`)­ 5CßêøŸ v*»¥œ)¯Oâ"k}ã!5Ò) ÎNŠi,ñØJõ 6¡¿\vüÁ%çÕ‡43œ´£¡Ð4xœZ.×ÃGéGïMƒSþáÅW§q®ý,æ%ný0żBGàŒl×ÀTNmP Œvô>%Àäêa¾7pQÄQ%‡]ìʘŰ“ÀôfKgËpõÁŠ!¼¸Gñ/=Oð òVœR±Òo ðC¤R²¼O²Üi» S)ËÂOQ#)ËÊ =°t"™¦÷ΞÖÎùFÌaär,¸ Ø|CÿÆÆãHŒD°Äê¡?i62,ªç)MyÜ D1“›/SQŸQV(+…%qoQŠÄkl¹úÖ.ãFFžÇ7 †ca" “!p¬ñ6É­S }¼cu¡¡À\`v5®iç]dv1»ÅÌ®x! ?ä⃞(Æ[IúJ-LÖë\Ùq‡úfâÃ=–ì§ë« QI)œes¹Š{A®(¥6— d;ØXùnQhópƪܑ¡c ì|#ñöü/oP•E).P»}<6ø¹.·™ì ðEUB_Q² ;ìaç—|äâèÄ&ûÝϵ•Ô„.”§4€×íÞDZW»J`ý™¶r(¤s†N1¥@¶ÇŸ)6ä™KêÏ4Â=¦ðŸìSªë•òXkTKOÌ3'íüsª49Ÿ•lyÊ·ÆKªˆ\ðU˜Ì´‹œa|\Èäþ‰ÏV»Ùè…Š­!9@fδÇ*zõ„2-T*D…lÆÙRöw©‚ùË/Ò`¬ä˜ÈÀ5%7æî‰{“LÚC=)Š5=ÌÓ¡—EÑŒºå¡À0)(yk’{Ÿö|§JTåMFq¤È-U×p§¦'ø&G K¸b›häHfµ6³‰x¬îÖ—B7FÕz…ÆjT‹³”‰ÅsJ>–3 w·Fd@¥],—£±Æ#é¤zwf«3ˆŸÕܬü!ŽuªPxÛjq&L¿Ó˜­&ßtfN¶AÞ Ë ½·Õ³dä|ŠÖB$;Pꌟ?¢Â5Žj*~þˆÊ¶?¢¢èæ™ýü•ƒâþ#*ÿ'¿œ2‘æ ù; VÿÙÚ–Ø7a<œ±zž•ÌC¢ûJX·ò—9[D§½"!ÕY ,7?SÞ'ŦÆ% Ée§k©€ñ“r¬F÷PõŸdЏ ~Çt«ûÝbõOÈåRwÁ8&ÛAgÐîèb]XÏx±öµŸ{¾¾©ªÕéXjkÒÈiH>‡{F¾‘xÐâ\ë«ÝZwL~ü˜?h¡–2lþ+[ÿF@ùotÔ VXw¼Ìú›ï¨oS ¯ Fªö¸„ÀjŠiUF¶5ð@)Õ3Æk¯Í!&}’ ðª¯pÑrj‘ù•ó鿥^%qGÙKç¿ýž»ì^ ¿˜1åžð"CcØ ¹(z ¸dýáéÞ¿òÿ¶{O,endstream endobj 1763 0 obj 3532 endobj 1767 0 obj <> stream xœå\YsÛF~ׯà[ˆDD€„Àuù!vì¬R¶â•é-g7[.ŠÔUæe’:˜_¿3Àô…iEy“M¥"ƒÌÕç7Ý |i´Ã¨Ñ¶ÿ¹‡“ƒïO£$m\.Ú˃/Q~»áþN/úö‘NdšÂ^»5úEç¨q7Ò¬Fq£?9øw3 ºÍÌüÝÿô¶Ý²„w‹“N˜uLÏþÈ<ýC…½^Öé5ß-åòUЊ›'AÜü1è4íA+Iza;ê6_˜¶0h¥©í’uM—¤ÃF< Zm{Å™i›oƒØþÌÒbÔ¾ÈüN{Å,a»Ý#Û)I"3|>¥iŒ:)¿ÿ:HÌU’¸ÕØ¥ËMãÔŽ }òÛ¿ÐöÉ÷f±æv”I¢§LË‘¦•´Ã£¨×+(41C4ÏíŸüjiÿ\Û?¿»Q;9j¶‚V7n+wM«™1kÎìï ÷ÛÐne_ÁCQÏ/ŸÁ.?²@,jœQãצ{Ûð£}Ô<ÃÆ1=9ÃÆ!5~¶2ó£ÓhÆÚœClPãŠ/Ù] zGa/ëÚ«‹‡S÷+ºÏ(òïÓý>6¾Ù™àþµØˆ½ì$™Õr=JÂnÚ6ºòæ ÿ­ã®]dsnÿä\1Ë‹ÛfnÇÓ äé  ˜œnŒQF¾…­Îà™¢Ë´‚pœ2–/¦ûŠS®šœYݤSæï/4fßPãa¦Øxi—œåBºÒ8¬J°È,´FhÏD'Z2íß±ñGzò]†xiÙ‡<»Dêã8Ï.Ý#78Çy6u£˜uŒµŠo¶¼O§(ê>œŒJ§ŸÙgýµÆº)g®1d¡5ª«Ó”s!H[p>2öy[+p§M4"¹½¥Öª‡7¹&Ýnƒb#-aóÝÒ–qa¤¿ ÑhÅ½Ø ÙB ·#[`ýY’æ'\ü[ûÓ:›æOp£ùÒþ¡¿âdžPÙQn·¢Ë#2X¿àýwšÁúDo±ñ”âOÒRá6þOÁÆ¢1§Bš$èö2æÀHäoÐ’YßÕM» 3ÊsÅTð0å4ˆW\š.½t‡É» ãý[[?hd{I¿¤]¬[›Œd‹Œdï÷äD0´(3Ü:l‹[”!š4ö(‰w·°lʈ0û•ºüw©»Žð~¼Ý®è¿>ãÕÚ9;»Žnæ¸UÂhðH€ºÄ9—B8ÇŒu(öƒ´jTå.œ'VÁ„3á Ç»$Y#KÉ ¹Ãµö¤Š¼@% ñ?k›ZcãfæÂ~Ð:%“¦hÈãÍPä>I?wçx–[õ(¾‘ÞOÀÇ‘Wྸ Rî4¢¯n5®Ž5ýWQ¤Š•.ÉQ©°ˆT†™ÒØøJø c;‰5ŽoˆÀ$Î9ªøupåkÁ / ˆ"§Éз*¸ñDÇbu»gøo¨ñ†$v"ØàÑQí\ãÝPh$ŒD"Ë$~Ì7â¯éZc¸86€>©-y÷Ctza‚ ‚‘áìO‡ÓQ¢%:(äžÔ /‰Ë=ŠËRºŠíç–®¡8Z6Sò\FŸk.%XiÈ+Ä Ä`G17ü€KÙFÔŠ&R9š•(}­PzgÃ6ÂMS&< ¥OE^gkw$ïšæcA:ЂQãX𪚰jXã#vÿ^è¨/á ð+:\ÐÖïk¼<ñèâ$ây?%~Õx@–Ÿ ¿êXH# +½ '©$'r³œVs ý¿Õ„ä)¹ð/ 5ÐUâÄÿ;MÈ#.ùac…¤^JìlæåØž¤/)ˆ¥£¡F$u¿*Zª‰¾,k@íB[²8(ùf‹¿Óæ$Y ¶+|DBçÚýñEŽýW &+(•@VË–²°Ç›”úvT+«æäðù°ÔÇ3²ñ[Üsû&ù£M)¾Ïs6üXÅqÚ„ åŸ ëoÑϽŽN¤MŽP% QV9U>Yék¬LRAÇ[ü9”â<ÕDúK¹E±K:³èÑ÷9"°Ð¶X&dÂÉês«Q™Æ\i¤gÚ§2i®5ø˜Oᯠsä,¹w ŒÓ8z´%—Ñ“Mv§Cmê^ãVª?²Ar²*ÊÀ¸äǧ'C×dËžSˆ¦÷mðU† ¼“.‰þ ªÔhOþVFu‹>ŠIJë¡FóKé?V­‚[–5SÃ’f´‚¦#j!ªò–Ð,í$™0—~}/‹½°p'T‰_4â©^Hd 7M§?‰MRc´_Ñ&i>ºT¤r†?¶³øõÉ®t•Iuûõe2O³M‰Á¦Ôûöªº$¥göè„ ì÷Gj<ÆÆ÷ÔÓP·ÚNTØA‹b~ > s’Ìڋݰå¶²"aùPÏJjÞKÀ$Å/~GýU8ßR‰pHz¥©±Fdµ~B®OHÛÚPãÏB½”ñ`/™pü=ã–§&²$̲r2óÁLAi›˜ oÁHJbŸ¡dTœ,™;qº)qYڼÔ1‘¸l¾r=8é†LUMWš~°Åt3ûê’^5gW5î°&:í3¡k…ñŽsrW,Ãdå1cÒ.i× ˆ˜#œF¸VexT«b~Y*BREñÐst(²n/¡ 9îvÖISM0üT½«^©‘@7{°Í+&ò6]m,À3{#Œ­VpVØÀ\ž’,ŒR48SVß§[¬kÍö ¡ëÅ¥$;ý°)‰+§SÝ CæW0ìÅ÷Éa=éÚ ý=¿(p—ª(¬º’Ç<ª+ôÆ@²Ì†EÍQ˜F˜,•;@±èœøcüC+_àÏuÉ$íXIâ‘*w‹š¼S'Öe@¦œ‹ç´:*l*ê¡ÊÙl–`R•—ôt¡é>CésÞ]=áÖi´«i¤—qY·ÇÇe™Š“J q¸k.9ˆRM„^V=UŸU\Œµ…¡(Tx(ÜìÀÞÉ¿¨Éƒ²kfÔÜÇ"uy‚ùÖr#XCj §»ªp‰?¥«ò'Ý+¶WO`÷Úèceí/Ê8ƒ”a«â.eôÄ Y?U{bÌMµz’–ñíMáÏÈT0 U¶›h ìÝtÕSË9Nþ@­ìœû’œ%€ °cŒt„ Çú˜í‚Y =IÝ÷nj’b»æ%ò ´%” 3ȼF*՜ОM>æœðåöÞˆ×ê!ÃOúràôþåò86z,i²r«)<žW¥# Øžtª=‰Ëƪn/œ2êz®ÚŽsâçÄ3#G®ÇåE)Rª¹t&EV»{ž·Çk„eÎ V#“nl“ÂŽ¸Ê½DQ?Ìâ¡~B—U†Ò©aä =SQ7ÕÀÙœµ&U9_xòAïËùb´),b“úÓq`.“ê_¡dg'#p¦íšX®æ`Ù–;E¯·0<Ž'âÔá[ŽºZ–Ü’ ŠyVhvš†ˆÖtw²IéœÍg–KQq`2•Ô¶„iIiG(VKðàe¯Nꋯ¬èï;Qu…h`†ÂZLvb-õ#^@›_×_*d˜¸ àÁGfŸ;Õ‚”¹c™èâ=¡º—'^ ¤çY÷ 6²W5ßÓ*¿ üW„õ êúïÎrë1@N±7ëÄËž< G¯XèËPx "0c*Þv“ïÕ˜GÝzˆŒ•»zFG†rŒóŠÝ¿ë— Ú{Wñ$»å=÷5Û{]^¯Ø= §ÝRéö…E*Y±ÄÄʳÕ¾2jö%QÙÅ+ˆ‚p7{뇄 ·*—[kØ6WµíÕ|ƒ½dˆ†b~yÓ“ªâ|#£…Þ˜dô˜¼«…Y²fÄÝ ˆz§)‡Ú”ŒC3øj©¾œ¦ ÀLIýH]‘•¦I({¡6ÒV3¤#°í->€­¡V‡4*È\úUªW*ô¶©øCüWõ¾è;ìÅ^‡¥÷ Ù‹³'ØØ/æ|J7™+U“9¿kb§¾øðDT?ÜÁéOJ#¡µâœ‡ ÂÁy‰ýÅMÁþ*ÌÈ-’Yq‚ÙæÊ°?‹¨äè>e Ø}]¸îVȸ¢EÑŽWõÝ öÔcòD$^>Ùsüÿèl2X W×*F—ƒ„…Ü(Äâöò²„ä0÷þê~Y†JšO“‡thU_Íÿyi̳€#y÷Às’ÀˆlRÝWv¨¾Éñ–<È!^ßjlˆõ’! “‹Õ;}­¸¨Y€-j¼ï_ýS.Þ÷[n4þµO¹äžä-´ßs¡çés„ê¾ÍrŠìã+4#y¬m V¥~Cfoë OȼÐúRàŸ­©Zp’å“Þ¨—a¾êüÃü÷_qE¯Øendstream endobj 1768 0 obj 3325 endobj 1772 0 obj <> stream xœí\ksÛÆý®_Á~²˜Š Að8ãò+‘k;®Å¸é4DI´&¤Äˆ”Tù× ì}í”lO¦3Ohøbw±Ø{î¹]äV¯›´zîÿ{ºØùþ}’ŽZ³ÕN¯5Ûùc')o·ü_ÓEëéÄ5$…¨›÷ò¤59Û©:'­a?펲Ö(t“~k²Øù×nÒîfÅi{øïÉ«¢kšäºkg0L\ŸNÚ뎓‘gž¡9É:,ü²Ï”‘>YºuÈrM)Ú%{FÝ‘·Å¸áвY‡ÍÓRè-[Þµ÷«Ú8ÍÔ.[ ‰:ã$ãMùeò´Q銤¬ š I4ÿD#©c1`!Wì3˜¡‚Pf3øõºC¯ 5A@ÓÉ}…ãð!“ð±÷>âû©ÜßcáH„f¨¥¬lÝŠpÄÂŽ3öøª˜Û ö0ÂdøHº}\“w2žD=ótù(0˜ª÷F‹ù¨•íѱfcQìírÄ@b41}W¶>а2ñÍiš×ˆu¾gáKäqæHí08A.C“/ =WˆóT¯P­ jœ(qbè!gš(Œ÷­¾c%<«Þþ&¢\‡œ¹ÑC}”ëÚZ§P-ŽgKMFõ{Å»FsÑîkixŒÅeŒ±æ f”ºaxüòµu°%ß gÎîØŽKþ.C¹ …ùNDx(ïõD媕î~GÌ´)M#„ûÝ´Æ+W‘g÷¯ä‡’ÝÏÈmÓê9,]ª†w¤ÄM+„Êd.||¦½9h§òjÌÝ2ÜØ[QÃí“íu„‚¢»ÒdOè¼#nz¤ïÓP]æ"Ì…éCB„ÒåC=é9‚×R²TôT+º„ÏpØíz”¹ª¤í/Ò'ˆ]:UoÀ.¢tÉ‚ &Q¸o+Å_²ö3è°ÊF ÄÉ3`ƒ 4÷! ͧº¥ZÝ|¢‡ˆ³S„£™Òôú:¦Q!SýH¨²'B „z›ê›Àe¡f MW¬¾2 _j‡¡M½ŒÞ»Ÿ_ÜÏ ‰H˵pTZÁÂq¤@¥Ð—<Ǚ̈́…‡âiªU§ÒªR(CþÐÛãp•áocjUpË!òp°¸"‰¡²m‰RN´öÉÁÙRÅK$»è²xåÏöåòµô:é òmUu‡ÄO"A¦ðϵAîŠ1uÄD"ΪpO-áç)fÚƾ’C0À4^Ƽ±ñpŒ:Éð·h"¶LѾ¶ºÿ Y×¢G[Õ!é©`aª ¨6"qýmeEÍ:Fk{î¥&Ò„tÅž…›°m«¨Ö³6£)åÄK§âS7Y°^# @&2E â,§øpôg¾÷70TRÃÜl8ªj:Y?0 ¾ˆ¬®y•ذë2q}èÿpRZM ƹ¢¬ÜBøö±4-ÚXCŪsK1åÝ;†Ê©ø®%w V!Žjhª°v»}†©(¤mW†"ˆË`ñ.ßÂÌ>Žfc¬q\÷$zQ›@ë¬>®?ªšë´"–,íf¼{<À§:O$kJ¬uoTd™eíé@WÖ–)/YãAuÚ”ì(\ªº#_¤2’j¾p¯:$é®V"Ö„K^ÉM唦èæA["÷fì0Œ‹æ¬¾µW•N9`¥ø†õ7·Þ‚'›Â’󦑸õ9ª¼±ŽÛÛïïúÉJËq°yëÐ,Í)¯ŠÄïkë.A;Vœvµ¾mV7ÅÉøLÀeÜa}æTPUÃÖ×%¢*µÁ­éèBª“Šé”‹»n JUa·a“­¡zaŠ{UõpÐíqõVù˜Ú8hªúj“S²e}âMEȃ#nû€hÅN´€o™"lÏ‘hõì>ñF<}U.{ãÙk1½3öKo2ÚŸÌØ‚.-í,y)i ÈY„½”ÜN]h}ÅÈ«ÛÉŒ³¸£l£õ8‡ÇTª\";Ùpð œÎ©îBÁ÷n0È.íGå:ýÇ•1•ÅØN½·Ây5(¨ì«ô<ȈìvÅ0ö¥ƒ¶n„Ç6°éçý¨ çò…Ýwî§,Ò|Ô(-“Âên¹ÅäGç¯ü;ç”Kn¬«TÑHZòNî‹ü(Â7,|&Âwºeì"eôF}b}QT¼ò”¦ 0¾+ÀJux´Õ~ó׋³ÿlï¸/ý¡ÀÇxXF»G›ç ϼàÓ ufYe½ùø=”¯a>¥E²©Hw ¡aLÌÚe–ÁÒcïd¥¿b=ÁÐ~Ãý—辬hùÛ;’_æ_<íåãÏ¿hxpÀë©õ‰&ÔK«LH\ØFmЃËbˆKy —]îÿÚpÿiÃýƒ†û¯eåêÞ~Cß}´Òê`™´|Q7IŸÇ ²\7xÖÔàQ¦Óà­&M=o•e¹s!UÃòê‰F‘W¿¡‰ä(æƒ5¦˜n(4ı{‚99΢f'BU$ÆU”Ø$ÂÙãbS4eã‚óchÁÙPŸh¹2ó'¢|¨É,¥­ßiH³nÂe`ë](è²!¿òx4Ô…é¦VK³¶’¥íL”¡jÏ.›>¡O…ÖC¬P7Ì3aXJšûV;`¼MW`†pÀk:YhÎ}ªàIFÕÚÞ‰ö óCМÁ°:x'ïË•þ?³5ê £²@|^æH¸bm4Ál±†ÎjM™×p k² N¬GçÀ«­ÑRZ·7¼‰iì¢ÇîCZªú§´ DþQCˆAºlŠºW¨eÓòà{€ªL®Soîó¾;ˆ‹m¶­¬o-GèÃ|ëD_Æx;å.k¿7ðé{ü  Öë`Çwˆ£ˆ‡ö-¤è¼Ž+óÙÁ•øfŽ'ù ÅÍڀ̈́?×På É^æG²âÈKÒÉÇ‚ÉGèa¡b3{øUÓ¦§ ìO?XjôcÁw£Á®9óée਎Úã?7‹¦¨RŸð¤`5¼%¶òÀ†;Uµ–jÒc9­¬*´‡¨&:G´©˜²@^‘ƒÁÇWjzçè!ÐõÍP ¾'hi8ɺDo¿ÇÉÝ > B WûèUÙC¢ì#OºìñÙÄà¼éè·/Y‘Áwh²c^Åoé_…بV± Âm üÅ÷Ú mðKöC'ÃýßÊè~c o˜ˆQ ;7Òø$…:¼ l·X¥è „€ÁÈÞõ €×[ìnÁ³*³Íë é~.ø î‹ ]ù¾Ç&<ªeCÍÐNã¥ýôT¹û¬´ÍÁþp§²,Åd÷MnÞ²PÕ~EnôPbûCòÛsä¹FA,4VHÈi Üp‡{u_ÖŠ³¦OZst‚v%i®rëgý¬çzƒÝº°¶,;ÛG^‡qíD‚;¸9Úà± {¾ÎC¬;|nÐoß4V£/$g7~ÑàýJð?§X+ŽOá)‡ouŠÁ¤WÿS%…[ÞÞ”cbjÝ-ÈwÄk*|4_8†‹û¿Ú¾ÚŒµ¥ ~¡Ί;Çè(]Êê¤ã’`jÛ{O¿Ÿf}êú…ûpu>]„ñ×´¶xaãê‡+F«ÿs|Š=|‚'Uª& s» ®dS}Êf]”ÞŸíÔ‡×C’Ù+šÏtóÌMÔC@ôYxNö =D"³c¤UßýùUrPâèrðí´ÖϺ£¬—ª{Y•ÎŒQ½]™r{Sßâ˜w¿—õ µ©ƒ°ö¡Þïµ”H˜IÌþÏ >WW |% lž˜Ê¶ß‚9àÊèSÝ]ú·ÐŸo­ –¨l±0|D‡Õƒ#ûeè`&c-†³€¨‰M_Lvþ^üù/T¢ endstream endobj 1773 0 obj 3551 endobj 1777 0 obj <> stream xœíZÛrÛF }×Wè-dj2\.I‘íô!÷qkÇi¢Î¸“ôA%ÇÝ"Y±Õ¯ïÞ%!ÉJ“6ñxBÓØ88À.ó©›Ä¬›Èó{8í¶íL´³Jì³Ô6U˜éÌ _ðåÞžæí¥k–Fc<΋D@í¤ÓøN))•æÁ@>&Xç<)%"¤óÊ*U:g®=¥t~šœ8á;aßSJjR;g¬åãÂu•ׄ[®e 3œpBpàŠÎ)ÿ:_1ß(-RÈW侟Qø„O(_=·Bk¡³ÀT>- ðàV>œž†Qç 9¥âSJÅS¾Þ©¢" OÙ;»kˆím'ž:á„>E·T ½9ËdËØ1í ÒÈh‘ÎxJÁõÔ ·YǾž{pŽ*eº‘‹6IDkÇAƒ’I¼X)ÆQÄ|°Æc• ½…näcåÔP3 qÜZÛ¬)Tè¯ßVXØf­+úôhû> üã®máŒà„)`<!(ú„ïCÃPe/S[‚ÚÄ)…7ú5ãepRûZ»¾6 À§kë ©¢+Ë‹ÜzºLýpQ—`Rcã$‘£üZl¼WÃ0ûfOâZ•l§WÏРÞšÖ°»Ñ2 pµE¯©ž•à5U:ÊT8´62 ÅóÑÒ¦7h˰r–ðÞÎ0» uì¦b¨$&ÓÅE†²Ëøîö|áÚ¡Xì-¼Ç ¶'ŠÓ1Å M?‚ðIÌÅ=›)‚Xd±w"”omO=E€¤y!’\a‹^RâÕêWá™~CúاLãfQÉâ¯J½ögLº5iUxˆ š€JëÚæ¥‹pKBÍeÖd(ü¬1 ¨yL`o½”ÕŽw„O#”<6€Ï/õçÝ|pEEñÅPÛ,GÖ 3ðê¥F¨2wTBþÿ`µ+:5^åTÏiYÈéý,?p€¨-ï ¦_™‡Æ¼Þ±ƒFÛÊk½»ŠÙº ²·Ý5a-·L(·Ô€š%5È+˜’¨Pª×8*Ú¬„v¾òìêš-ûúéH¯ÉhBµ¬RK ?»Dox¿¶Ê³iRñ棋•LnpAcRjö¸Ž&‹¯Wîõ k[RX`‡ÚŒ4¥Ô÷ }ëÆµ'Ø(J]µ»^ݼM½èiPGÃÛ×&÷°8µ$2òÀº=sÈ! ¹—8FÎ+—=ì .C†=K‚Ef&`<4¦n9uîG„!ÒÀàŸ‹-¶ÄÕêÁùÎZè¾àØ áj@f®v9tÚ“lu2 „+´•âŸÑm¤âè%º¸½Ú WÃË{0[$ºˆÔ»?TÚBt¯á•ò §°ède M¼ðí§®'àcâŸp¿ø D2&y¯@r Ày¶çZbFYn°Ûrä-á%Ô}û¢á\â$Ù¾¥9‹z·Nj#[«Ôß`;c¼oI˜,HjÛP•ìæû®dAyª’Ý«ü}%ûÌ Ðw|¸šR5mû Úá5íÆý]jÚ½dr_Óî¶ìÖšö¿ éûšöëÕ´pþ—óøÒx 3ß*Œÿ1•…èê‹s[ؚNJÚòíOÔ—5 k<ÞD‡¡À„šù²‹˜çwåÖô­èó]ðÌ豓XtÓà[93é¤†Ç ø¬óçÊùÏûßÄÏß\¶Oendstream endobj 1778 0 obj 1913 endobj 1782 0 obj <> stream xœÍZÛr7}Wå#ø8ÜŠfqÌåQ¶¥D‰"{-*»©$¥’E]X+R IÉö~ýv40ì‘HJÞÚry4Ä4À9§= ÿˆ\þkÿ^LwþþQêrp½Øƒë¿v¤}®F|ã1w.—¦®SÜ¢êœ-jI‘Q¸~%ÜÆÜ2ؽcÆ5‰a_ô¿õÇñô%)µV"Ë1íl¼,¹îsÎò<¦é»MÖÀ”ñ“d˜—\¦y¢á(¥¶§¢_åR—o9ÚfÜÊ÷è¥hýMò²ocÀQnÑXP@|¥ C‡ÞZ‰ów ò^>äD*cªŠ ØšˆÍQðŠièœëËu¢Ðx¢<ä#•ÝÌç1|ß0{&—ð?»¥½Dï.l¸>rK¢ÅOVí«S ‡(=/+/À{ -2ŒÇÏFýiªÀ³€ßq€î4àwæÛœsiò‚o/Ñ«Éq0?¥¹PJ9¢’`«sš—ƒòdaÍ–NɉΓc^v1§zÂ^~¨®SìÙËKßD äéßë{,ôäž~Ô˜d^c¿N橬û²^ŒÒ”J)šJ>/÷UUGï0Ÿ¸¤½%<“4èW:ÔµNŸÇ‡Ҙóô™ã“ÍâÉNéÓK"›ÉÓPém­;uk§`Á2¦ýŠ´¯Ã7ËѨ©ÛNî›1×eÏÓñ2Û““Äi5Ê{BÛ¾ßKÂ+ŠÎþe‹Ÿ  uÕ…4%~áüŠ›Çixþ1I™^xìÁÌÂ_¨ÌJoí8óÚZûÜf«ƒäwz…ø5M'öML¦D("âõÎØ2òšC*ý:p…’¹Ëp¯wðL༧éŽ{‰‘ »y²Š(˜:ç)3]R:…¶…IÎ;Ú;¬i•>ª‰Ð¾uµýˆ÷×Ïœ½õEk{÷.W²ŽÒÃúÂþÊÂDÑvÎuºåV4N«sÐAçð²Ø“S†~HÉyŠÝUr "‡Õ, ý‚o¸À!u_ÓV³-áJDV ŒçÞo^3ÎÙ,ÓɈ½›¶P¡˜–‡a_ Q Ó¤ÉÐ=[*mõ?J‹ìaê<>.nÚS©­ªûõw¥¾=3-¿é ‹b`= œóž2] ¡S J¢`3¸Ú•oVÛs¯nbì¦rÍÏ–(œøí}±uDï8?¦Xú<ŸREìœ÷î‘¡î&G†Ïßì‘"…s$µgŽ —”’RhÛc&$:iíû–~5¸¶<ñÝ_ºÝ3ÛÈÔuN Âá ß uÑ áŒcÄvË}c³í‹}ÑTyzDÀ~÷³x†¥óØÒ3Ÿü<ÄGÚËu×yjIZù5³Âkû–£ÃowäÐd5ü7CƒöG;ÿ€ÿ±¥¼5endstream endobj 1783 0 obj 2523 endobj 1787 0 obj <> stream xœÝ\ësÚFÿî¿‚oAè…fÚÎ?Zl7N›NÆÆŽã‰Hç¯ïÝIw»«[ Œ!N&Štïûí{ïÈçŠ[÷*®ü“ýÛl½<õ‚¨r;Ùr+·[Ÿ·¶åC.VŽˆÁÅã|ôLmK>öäã\®B,È«vä§xÚ¸b“‚†â»!,L$TÕ¡i>‹ôeð:À…ø±)¼ÉZºÍê{S8†–7¤¥›¨1'¦ð´¼,ï~u ð˜ºåŒu>ªuÊù²‚Kh5Ä“èÂ{n’Iú±$žÔ‘+¤¢³Õûe."ËG×ëP—¥f6‘B Òš°Ëº_sݙ¯Üìcè-'ÀaCnö©¨÷ñ NCnÎ))Dˆ JfDà ¾“¥ê×kGvNj*zÈÇŽ©=5ëo~#Ž)!@ÈCÓòæßmßpP (Õpc¹E*˜ˬð 7Ò°˜eªW9R»Lei‚ë„ØtaÀ }N­îMéHvdjå›çE”ÑÜjo!9!<«Ç\ŸÚ[PlŸŽ¿ªØ7oFÁYø7–g'ܾ¾pÛèãîa"Îцo8¨Y=?âÆü˜ÊÁCùrî±1Â82õ}nhNbõ=uÇ Þæ´O  SNQ°ö‰ªg¹Ë¸‰:!ñq€·ÊyÉDXÂÖdŠäbʹ©Z‚£rÇñuiƒrÇ))jEž¥º öÌ,J‘÷ï¬Âk>¥l²)  +APXSjyÈ4M5Û•E6¯À NX?¡È ÈØ;+’4 ¢¨éfªg"Â󌤬xœHäÐÚžšƒnÈŽ‡#ª¥Ó×üfº€à ۆ‡Œ÷Ázšït“eOLíÁR®Jîñå·+°ÔOV›²^ß%Ç,Ø1A×ô9>bž°GºãZNÀT|äòh 8æV1©ÿÓÐå CCð¦~¦I’ÙK †Ôxþ‚5œ³<ï÷\=X½¡=¨fÖõYƒrZ”TayN½E+ ÂÚÍ@Öà¬_–ÇYc(´Üy«ªøj‘`kĉHõï¡ÓÙ2b­Ä('ØWð/£³:†:mC6C,¤ÑŒo“.êNmŠá*¨ø•³N÷Ž7 ¬dâFJ1™Žr#Þ¢‚è èÍ–5Ü9eóÊ€ †¡-©ìÇC¢²ÁܘÛ°êí pÝ'¸¥Ÿ =ÞrŽ'cz+÷9àF‹Ìô™#6U™¶¡‰Ð2<ŸËä8ýÂÔ5—Îù\y Š_ï¸}²é«ÛNÖûdq`C©o\!’™çK_˜4•L ¹5'U;ëo«Ü¤uÌ™¨0•9¿úJ{𺺭 ¥§©/Øôëq ÚƒN.”ò¯hÚ·Žé—:{éø5“^”Óp\”3‡* EcŒ(Ì9uÍU° Ú¬ˆ Q @¢9è£ nðþÄ*| Yü•˸e@Ÿì5Ь`ƒ-!ð#Þ|ØtsŽ ŠáY÷‚ÕUw$ü[…7,' ù3†¾!8™[tª ÊŸ †õ'¨–^S]ű#ÈÔ”C}‘—We¿#-’+õˆLµ{[¯ÄŸÿÍŽ·endstream endobj 1788 0 obj 2586 endobj 1792 0 obj <> stream xœÕ[ésÓFÿž¿ÂíÎXÕ}L™.B’§@K‡Éi<Ó;@øë«•´ûÞ[ý$+Æ¡í0kµÇÛ÷{÷.z®ãõ\õ§ú÷l¶ñý‘ĽÉ|ÃíM6>lxÅç^õÏÙ¬·5V]B/or27ózãËr°×‹üÀ‰Ó^œ†Žç÷Ƴ?úÞ ê§ùßdý9~– ¼Œ†aäd~o¸NâeYo|ž: ƒþ¾z<7¿Ôã•y}§#õx­ãü‡¡ãz}_½Gêá †¾›ªñ.w\×óú×y£“ei÷oMã5ž™Æ¿©q‡W¿¦ôù‹i<¡ÆSÓxEùBaç/Qÿó}—¾MãËÁ0r³œöP ª?SÏ"ž¨›Sã”¡g§‰îiÌ ¹ú©ô'ŠÝݽñwÝ‘:2pm#¤ü%Hý…i7Ÿ"7u²4y¼Ô󜠙<ÄÖEÁBF[å‘FôÞRã9­rHS«xYþ(‰Ð­Lb^”?à íRëýUP»‘µåÈwµÚk.~ ã ‹/ÎUºPÆ-°O=11¨¯šrXÍ9Tòe©™º’#)ÏÔCˆUäû)“•€ded8Æ(Û!Ž­›)—€’qáRÀ 8i•oÅ+¥W[j§›’3Oч‘Q®¢‹°)’‚âáE/.$&>EL"*™F\p&•2•ô/‘A¼â;/Ø•÷á^îBÙ(M%ø¿‹ö{…$bÂb=µ†œ£ï „nw‰!4îÑœ‚™!YØÛow šÿ šê– ‹î‰-ç© ß·—B0ÒÀIS-o– ”_‡ÆÉ6ÉÀØà}` @îÂÄu Ô±M×5)¿Ó_5 ç¤a¹$^ÏN/ÈÌ@“p¨o³  lãŠE{{£^+#+,hÜ%dùwƒË• ê Â•:4ÅŒ´ãVS~NòàvŒ}{Áƒ‚Ø CÎwD´S5¾¨G9×s|l ¯j¼N´ŠÐÃ@9½®‘Ä¡ùph˜­tÃób)ó!â2“ù%Oá6·ÌwHî›Æ15nšÆ-éV#åsW禹ninH’Ih™|ÂÍA¿s»$Dd“Þ‰©Š1Íx‡Kr,·‚j’²Ò…dNäk2iJÔ†U¿¡ŸäÙ¸4;“§æõØ´í›We«|-Pï®åV(|dJrLA0Ù4Æ€™i<RÌÃË ¦P¦sШ]·‘ßëº'fСтšG¹&š×°åÀ-˜ç•»–B‹ÖÏÔDó ñÚ‹ëçœ¹Š£ûÆ><1Ü“Ñeù•lFÁê—d3ˆ­Ìf,ø6ZÉ<'{ºàXè½Ï@ùLuOņ_£5¡7 áÓ¦…òübyœªÝá"üŒÜ¡\šñˆ9 \ªÅeâ£-È%Ëä=m,d¼]ðP‘™‰BñÞ—1ªd@G¡$ñcÈ °DÞÊ‚÷ºú|j'd!”´´ÖÉZGû*æb¤¹ÐøH{!ý£x…›Ô(0êúÇJVãædñÂúN¦~Òv=-ŒȬJá¦Q²Ý šâüŽ0x”ó;’ÌÏBĘ÷ª•eWr#²bOîZ½—퀈<÷)¹ÇÆ.ѹ§8öb.= ¾UßB¢ÑU)gæoÅô-1 ³'Ð2Ù963zw¨×bÔ­|Š;Ò®·¤àb‘âÓýCòot¿ròÒů-nW|7Ì0¯ÞŠŽ¶i¸±äÀÊ^èœ"Õs#¼ºo1„§Qí’ÕD«)I¥-°hà)òºítíV#ßKðz¡Íñ±™‹Œ?%~ûjKLŒ5åúvdÆÞã¹é7ªÆ†qT„)¼È&﫳‰(C—3 ÛÄ @ cƒÀAźØO`Oì©wͬt­“&•2:9,'ß•ÃHi^¶)`Úe‹í2g*DŒßÄê§m ˜}ýê†eW„¡—Φ8çgÎæ‰\ÊÊÈ-SeÊ&å:o” §œë±XÙ}åòX Óï+dýÏÐýÑä¤a½ŸÎ®#@GZF''GÕò9±°òz»Žk×ö;øµzý:ìYçk”õ“£F‰ ¢LýP”„æ‰O<éP«©ˆ^ßušI&õôë¢ޏŒ<)&Ì;ëˆL(;Á5G²¬G·:R†ÓÀñËÛ¿¥Wg98´W &ëHùZ¨ÅÂ*í×o/kr !«tƒvÜ”ôÊ·I±4³nÑ|Óvœ@ÑxYÉMrÔ>`±¶¸ÎÁ$˺Ía™rd(nÚÖ†¢¤íȘ òÚê?ŠDIƒ ÈZÀ ×íü]vÅcŽzÂbvS^+…Ý(ðòß 3‘ª0µ¾§éÕEtÝ|'… Ë¥1ÐÌEðia½'ñ :g*X·ÒGã_ó?ÿGžÃendstream endobj 1793 0 obj 2455 endobj 1797 0 obj <> stream xœí[mSÜ8þί˜og_ÝÌZ~÷§+„Ê ,v³µ{uEf€äÈ,3@ø÷'É’Zm?¶g äö¶RƒG–d¹Ÿ~º[­æ÷Q4£Hý˜¿³ë­ïND’.—[Ñèrë÷-¡oÌŸÙõèÕTuI…lšTQ%FÓ‹­z°ñ(/Ó‰ˆGÓë­_fAYÿþsú½V&þ°8Ê'e)GNç²÷v(&UU¦UpŽÁå^8ŽƒÃ0vÃ4x£¾¼ ÇIRM"‘;á8 &á8ÏËIUæõ÷×a¬ÆÊ¯ºûTµ½•}ÔW;둜#Nôú'á8R·D\ÊëDv3½ÒI‰4WÙ‰XÏ%[c5u™ÈQ²çvXEúI¦û©\Ce±P½“D÷׫3÷Õóåȼªä{Ù+½Ù?“ß‹"®…—ˆÊÞ8Ž„’ô8‰&…¨ªZˆ‡rº`_}«©Sõ¡o¨µ«É¹Lù±ëºü¨V!$êÎ{nØžëòÚ¶ÕýÔWù‘æ™jw'—‹7bOåe+y3wÿŒî߸ÆjüäWR‘Ä7*‚;ÔóÖ5žSã™kœÓðk×ø©c¸î)RõLÓøzžûOÏä ©9…¾ ®Ü½ìÅÔeš”zn3â·ÀK…j’G“2µ ÊD%5® –ÔO{I­Wl¡æRÍ>E1ÉGc‘L²<Šë‡t­×…Y.‰â­Æ4Î|~ +¼ˆÓz YUv+駤;®íÐi âŽb•y uV³äI‚Õ/#õ[!ø¤aWzÒV#z¥Iä#ÒBÒlˆ;_ ½9³HÙ§"¸@(\!nÐê–>GÚÐx«“z’V…¯}X§.ú:x­ªïªÖß²šäNÚ§Ì{Ú©}’µmü›VåsÒÁ5DÓ{V† W€?FÓ¸TÂ-åué͹b0yfðõÂ0¾*ƒ¿Së“I´çŒü ·ÛG®ßž[ç¡2ÞÒÔ@êäD ÙABªêëšz›ZSo®3¤·WHÈó¶NH=ÓŸ@•ƒf~Åî{Úg‘]@d¹þyZ`“íJÓ*¤äãZ™›œWÚpdt (³C]ÔçH~µõ$¦”VE@Q¾Ž3~N=Cª]=ã°¹ºíÐ-aùȳ®·ÑŒK:â=É:aïÏLõ©g-¼=Q}ç EG僭é_1|¯@œ¶í¸-;gEšaHK‚ô=â‰ô ‰òÒ5Þ!c éNè, ñzòÒïÙËõ qý ºCÓ“êyT|t.ðrùŒ@ºa+õñòL°#ô#ÐYÝ¢žgþbPb·ý»%›™AÃaä;¡áoQäËy ìœ ²³a>}hɼÁ§Äç†!á{Ã4éó†SgÿþáÌá!.Ü;O¹Ù|ǦŽI]?i;º·<Õ@ÌùŸ&ÙXç Z‘Ñ"¹IjOJÆu…gN®èC¿Êrÿr×%Ör!+¥ÃóØÈ-+2¹éj/˜‘ú§8R2ÝÖɼmÃì}&bí±EŠzkÄÀUˆ ì Kš2á7Í7U—Ä2èò¨ç=d€Çg/¤üùÆÙÒð3­×ýhÅë£E‚¿bKƒ!y;¸q­gz!íå—Æ°—f‡ÎÒ‘‘ûEj«(bŽcB8ÄÎ8=ÅÙ-Pã¹/} 4‹®ñéÓ-SB»Å¸ï î8µg*<-Z’â=0潨©sÙ·Çç§ö¬;®ßŶ^ŸXn®#pú à æVªeƒ^|fRwù¤p{´+†ôØÜäáb§ñ%ØÆlN„hXåìØ‚}ÁÆ7pW`·wìöw×Á¦S寔{ Àz%вYYróo(nˆâ¼·5Q(¾‡0Ÿ¯莋„Þ H¨xJ$ô AaÄ5iå¸u¢×¢òÏ ÑfáµaÑ%X%àvpÕŸ¸9Z1寸ɢŭ³ßP°¼Àž±N¬tïwy°BW*X¡¼‰¶ƒµ…fýÙû{ô6=8G÷WýÔÈ’'6%eÎ íùÀF¾­n´sÙ¥Ÿê}Ár‰Eq©nP¹A £ìî{°Z?ÅÈZê ³Oу0’ ¤Äbx⼤Õwᡎ7Ü[Sû¦±µã‰{—­?5p°tø“Cì$l÷?#Fxéî} Þšû<Áéñ὆9‹£5hÕ®™è¢•%ËFQDû½qUD¯/B–ŠÒ‘ñØ¡æ êÇ¿uÜÓ)ìp®ûÉ+¡RUݺQÐÒy?Jõ`£D½õ¡èà!8,‹a/èÛ42ÑЩ^´ÅÞ0j€zr*ûèÀëg¼Ó,Ñv>x.ùDTŠ6>½¨°JƒPY#oßmOñ6.kc¥C7Ï}?I„l“Ñv5Æz°m¦¾B‚»Fßo|èA=Y ;iž85¦r:ýõ§ÐÄ’wnòvI‡ˆ¢Ô¹$䮟Ö÷ˆ^o…”åóO1 ¦(à‹cÂ.xêßE¤¾­8é‡ Qƽõƒlä˲³IÈýü‹¿`m)„Ç,0:k¼GÊ뤺8l­×À‰{,°káÒñ_Jlj-L+buHl²³<,iÇxuζÂs¶ýqànì»6Ö/´ã´ä¨“ÄÞÑÌ=’<ÉåÆÐpgÀõó#|šî^½Y…€åuôLîzðŸ±p¡+´PV:aK ¸¬Õ¨±(›£Ï½êZ‹¼×ñ±¡z¯-è×WGàíN-èžU°m"Kb¿wp³FÌmœÙ3ì ñìð!˱Dð2_d÷¬HËÚƒOH¼B’ÓNO¥-ÀlskíA’ « 7mê«»›p¿3ÉE5%Ò<°œ¿FÛ;¹Ú¬¯¿{™ê:;ûƒkü0¬,–öë+hWݲWê¹Ú={ÁÍul®×§í8gs˘{g:¤ wHÖ „Ê qtýqLG˜¶Ç@]ì-ò]›~OúÍǶ3œûÎä-ɬjpÞ¸Ù÷‰YY8n×ÍÀ:prq ’žE;6G K/Ã>˜D|ß læWÍ„]yp z¾öòß0’j×±ö¥×,1úÙÇ·®í'×OÁŸ§)sƒ²£—ZÑ®Ï6_oÀì¼ÏFëpw»@s~îxáZ3ÒF´Þo0Û'£,¶ ¥PÖ¦¢ 6/”ýr‚—Øz·¯0<â¿‚Ôõ¶^¡2=ÈÍ&®ëó˜Ãü}è²Ö³²Â€n9H—‚†â£èÓæ%×È7l¡ã{YuúZf×Dõ¢ « HXGômFŸ_µBªòÍC±ÕÄÈ«Háÿ|Ò å¶c\ƒvïQ­Õ¬$h½@”d¶@„ñßg-<ÀkçyØžaÆÇŠíT\İÕqìZˆ—+ðÂlœ{ZµS w­™¸Iîþ¿ ½éÖòç¿CA›endstream endobj 1798 0 obj 2593 endobj 4 0 obj <> /Contents 134 0 R >> endobj 145 0 obj <> /Contents 146 0 R >> endobj 150 0 obj <> /Annots[153 0 R 156 0 R 157 0 R 158 0 R 159 0 R 160 0 R 161 0 R 162 0 R 163 0 R 164 0 R 165 0 R 166 0 R 167 0 R 168 0 R 169 0 R 170 0 R 171 0 R 172 0 R 173 0 R 174 0 R 175 0 R 176 0 R 177 0 R]/Contents 151 0 R >> endobj 180 0 obj <> /Annots[185 0 R 186 0 R 187 0 R 188 0 R 189 0 R 190 0 R 191 0 R 192 0 R 193 0 R 194 0 R 195 0 R 196 0 R 197 0 R 198 0 R 199 0 R 200 0 R 201 0 R 202 0 R 203 0 R 204 0 R 205 0 R 206 0 R 207 0 R 208 0 R 209 0 R 210 0 R 211 0 R 212 0 R 213 0 R 214 0 R 215 0 R 216 0 R]/Contents 181 0 R >> endobj 219 0 obj <> /Annots[222 0 R 223 0 R 224 0 R 225 0 R 226 0 R 227 0 R 228 0 R 229 0 R 230 0 R 231 0 R 232 0 R 233 0 R 234 0 R 235 0 R 236 0 R 237 0 R 238 0 R 239 0 R 240 0 R 241 0 R 242 0 R 243 0 R 244 0 R 245 0 R 246 0 R 247 0 R 248 0 R 249 0 R 250 0 R 251 0 R]/Contents 220 0 R >> endobj 254 0 obj <> /Annots[257 0 R 258 0 R 259 0 R 260 0 R 261 0 R 262 0 R 263 0 R 264 0 R 265 0 R 266 0 R 267 0 R 268 0 R 269 0 R 270 0 R 271 0 R 272 0 R 273 0 R 274 0 R 275 0 R 276 0 R 277 0 R 278 0 R 279 0 R 280 0 R 281 0 R 282 0 R 283 0 R 284 0 R 285 0 R 286 0 R 287 0 R 288 0 R]/Contents 255 0 R >> endobj 291 0 obj <> /Annots[294 0 R 295 0 R 296 0 R 297 0 R 298 0 R 299 0 R 300 0 R 301 0 R 302 0 R 303 0 R]/Contents 292 0 R >> endobj 306 0 obj <> /Contents 307 0 R >> endobj 311 0 obj <> /Contents 312 0 R >> endobj 316 0 obj <> /Contents 317 0 R >> endobj 323 0 obj <> /Contents 324 0 R >> endobj 328 0 obj <> /Contents 329 0 R >> endobj 333 0 obj <> /Contents 334 0 R >> endobj 338 0 obj <> /Contents 339 0 R >> endobj 343 0 obj <> /Contents 344 0 R >> endobj 348 0 obj <> /Contents 349 0 R >> endobj 353 0 obj <> /Contents 354 0 R >> endobj 358 0 obj <> /Contents 359 0 R >> endobj 363 0 obj <> /Contents 364 0 R >> endobj 368 0 obj <> /Contents 369 0 R >> endobj 373 0 obj <> /Contents 374 0 R >> endobj 380 0 obj <> /Contents 381 0 R >> endobj 385 0 obj <> /Contents 386 0 R >> endobj 390 0 obj <> /Contents 391 0 R >> endobj 395 0 obj <> /Contents 396 0 R >> endobj 400 0 obj <> /Contents 401 0 R >> endobj 405 0 obj <> /Contents 406 0 R >> endobj 410 0 obj <> /Contents 411 0 R >> endobj 415 0 obj <> /Contents 416 0 R >> endobj 420 0 obj <> /Contents 421 0 R >> endobj 425 0 obj <> /Contents 426 0 R >> endobj 430 0 obj <> /Contents 431 0 R >> endobj 435 0 obj <> /Contents 436 0 R >> endobj 440 0 obj <> /Contents 441 0 R >> endobj 445 0 obj <> /Contents 446 0 R >> endobj 450 0 obj <> /Contents 451 0 R >> endobj 455 0 obj <> /Contents 456 0 R >> endobj 460 0 obj <> /Contents 461 0 R >> endobj 465 0 obj <> /Contents 466 0 R >> endobj 472 0 obj <> /Contents 473 0 R >> endobj 477 0 obj <> /Contents 478 0 R >> endobj 482 0 obj <> /Contents 483 0 R >> endobj 487 0 obj <> /Contents 488 0 R >> endobj 492 0 obj <> /Contents 493 0 R >> endobj 497 0 obj <> /Contents 498 0 R >> endobj 502 0 obj <> /Contents 503 0 R >> endobj 507 0 obj <> /Contents 508 0 R >> endobj 512 0 obj <> /Contents 513 0 R >> endobj 517 0 obj <> /Contents 518 0 R >> endobj 522 0 obj <> /Contents 523 0 R >> endobj 527 0 obj <> /Contents 528 0 R >> endobj 532 0 obj <> /Contents 533 0 R >> endobj 537 0 obj <> /Contents 538 0 R >> endobj 542 0 obj <> /Contents 543 0 R >> endobj 547 0 obj <> /Contents 548 0 R >> endobj 552 0 obj <> /Contents 553 0 R >> endobj 557 0 obj <> /Contents 558 0 R >> endobj 562 0 obj <> /Contents 563 0 R >> endobj 567 0 obj <> /Contents 568 0 R >> endobj 572 0 obj <> /Contents 573 0 R >> endobj 577 0 obj <> /Contents 578 0 R >> endobj 582 0 obj <> /Contents 583 0 R >> endobj 587 0 obj <> /Contents 588 0 R >> endobj 592 0 obj <> /Contents 593 0 R >> endobj 597 0 obj <> /Contents 598 0 R >> endobj 602 0 obj <> /Contents 603 0 R >> endobj 607 0 obj <> /Contents 608 0 R >> endobj 612 0 obj <> /Contents 613 0 R >> endobj 617 0 obj <> /Contents 618 0 R >> endobj 622 0 obj <> /Contents 623 0 R >> endobj 627 0 obj <> /Contents 628 0 R >> endobj 632 0 obj <> /Contents 633 0 R >> endobj 637 0 obj <> /Contents 638 0 R >> endobj 642 0 obj <> /Contents 643 0 R >> endobj 647 0 obj <> /Contents 648 0 R >> endobj 652 0 obj <> /Contents 653 0 R >> endobj 657 0 obj <> /Contents 658 0 R >> endobj 662 0 obj <> /Contents 663 0 R >> endobj 667 0 obj <> /Contents 668 0 R >> endobj 672 0 obj <> /Contents 673 0 R >> endobj 677 0 obj <> /Contents 678 0 R >> endobj 682 0 obj <> /Contents 683 0 R >> endobj 687 0 obj <> /Contents 688 0 R >> endobj 692 0 obj <> /Contents 693 0 R >> endobj 697 0 obj <> /Contents 698 0 R >> endobj 702 0 obj <> /Contents 703 0 R >> endobj 707 0 obj <> /Contents 708 0 R >> endobj 712 0 obj <> /Contents 713 0 R >> endobj 717 0 obj <> /Contents 718 0 R >> endobj 722 0 obj <> /Contents 723 0 R >> endobj 727 0 obj <> /Contents 728 0 R >> endobj 732 0 obj <> /Contents 733 0 R >> endobj 737 0 obj <> /Contents 738 0 R >> endobj 742 0 obj <> /Contents 743 0 R >> endobj 747 0 obj <> /Contents 748 0 R >> endobj 752 0 obj <> /Contents 753 0 R >> endobj 757 0 obj <> /Contents 758 0 R >> endobj 764 0 obj <> /Contents 765 0 R >> endobj 769 0 obj <> /Contents 770 0 R >> endobj 774 0 obj <> /Contents 775 0 R >> endobj 779 0 obj <> /Contents 780 0 R >> endobj 784 0 obj <> /Contents 785 0 R >> endobj 789 0 obj <> /Contents 790 0 R >> endobj 794 0 obj <> /Contents 795 0 R >> endobj 799 0 obj <> /Contents 800 0 R >> endobj 804 0 obj <> /Contents 805 0 R >> endobj 809 0 obj <> /Contents 810 0 R >> endobj 814 0 obj <> /Contents 815 0 R >> endobj 819 0 obj <> /Contents 820 0 R >> endobj 824 0 obj <> /Contents 825 0 R >> endobj 829 0 obj <> /Contents 830 0 R >> endobj 834 0 obj <> /Contents 835 0 R >> endobj 839 0 obj <> /Contents 840 0 R >> endobj 844 0 obj <> /Contents 845 0 R >> endobj 849 0 obj <> /Contents 850 0 R >> endobj 854 0 obj <> /Contents 855 0 R >> endobj 859 0 obj <> /Contents 860 0 R >> endobj 864 0 obj <> /Contents 865 0 R >> endobj 869 0 obj <> /Contents 870 0 R >> endobj 874 0 obj <> /Contents 875 0 R >> endobj 879 0 obj <> /Contents 880 0 R >> endobj 884 0 obj <> /Contents 885 0 R >> endobj 889 0 obj <> /Contents 890 0 R >> endobj 894 0 obj <> /Contents 895 0 R >> endobj 899 0 obj <> /Contents 900 0 R >> endobj 904 0 obj <> /Contents 905 0 R >> endobj 909 0 obj <> /Contents 910 0 R >> endobj 914 0 obj <> /Contents 915 0 R >> endobj 919 0 obj <> /Contents 920 0 R >> endobj 924 0 obj <> /Contents 925 0 R >> endobj 929 0 obj <> /Contents 930 0 R >> endobj 934 0 obj <> /Contents 935 0 R >> endobj 939 0 obj <> /Contents 940 0 R >> endobj 944 0 obj <> /Contents 945 0 R >> endobj 949 0 obj <> /Contents 950 0 R >> endobj 954 0 obj <> /Contents 955 0 R >> endobj 959 0 obj <> /Contents 960 0 R >> endobj 964 0 obj <> /Contents 965 0 R >> endobj 969 0 obj <> /Contents 970 0 R >> endobj 974 0 obj <> /Contents 975 0 R >> endobj 979 0 obj <> /Contents 980 0 R >> endobj 984 0 obj <> /Contents 985 0 R >> endobj 989 0 obj <> /Contents 990 0 R >> endobj 994 0 obj <> /Contents 995 0 R >> endobj 999 0 obj <> /Contents 1000 0 R >> endobj 1004 0 obj <> /Contents 1005 0 R >> endobj 1009 0 obj <> /Contents 1010 0 R >> endobj 1014 0 obj <> /Contents 1015 0 R >> endobj 1019 0 obj <> /Contents 1020 0 R >> endobj 1024 0 obj <> /Contents 1025 0 R >> endobj 1029 0 obj <> /Contents 1030 0 R >> endobj 1034 0 obj <> /Contents 1035 0 R >> endobj 1039 0 obj <> /Contents 1040 0 R >> endobj 1044 0 obj <> /Contents 1045 0 R >> endobj 1049 0 obj <> /Contents 1050 0 R >> endobj 1054 0 obj <> /Contents 1055 0 R >> endobj 1059 0 obj <> /Contents 1060 0 R >> endobj 1064 0 obj <> /Contents 1065 0 R >> endobj 1069 0 obj <> /Contents 1070 0 R >> endobj 1074 0 obj <> /Contents 1075 0 R >> endobj 1079 0 obj <> /Contents 1080 0 R >> endobj 1084 0 obj <> /Contents 1085 0 R >> endobj 1089 0 obj <> /Contents 1090 0 R >> endobj 1094 0 obj <> /Contents 1095 0 R >> endobj 1099 0 obj <> /Contents 1100 0 R >> endobj 1104 0 obj <> /Contents 1105 0 R >> endobj 1109 0 obj <> /Contents 1110 0 R >> endobj 1114 0 obj <> /Contents 1115 0 R >> endobj 1119 0 obj <> /Contents 1120 0 R >> endobj 1124 0 obj <> /Contents 1125 0 R >> endobj 1129 0 obj <> /Contents 1130 0 R >> endobj 1134 0 obj <> /Contents 1135 0 R >> endobj 1139 0 obj <> /Contents 1140 0 R >> endobj 1144 0 obj <> /Contents 1145 0 R >> endobj 1149 0 obj <> /Contents 1150 0 R >> endobj 1154 0 obj <> /Contents 1155 0 R >> endobj 1159 0 obj <> /Contents 1160 0 R >> endobj 1164 0 obj <> /Contents 1165 0 R >> endobj 1169 0 obj <> /Contents 1170 0 R >> endobj 1174 0 obj <> /Contents 1175 0 R >> endobj 1179 0 obj <> /Annots[1182 0 R 1183 0 R 1184 0 R 1185 0 R 1186 0 R 1187 0 R 1188 0 R 1189 0 R 1190 0 R 1191 0 R 1192 0 R 1193 0 R 1194 0 R 1195 0 R 1196 0 R 1197 0 R 1198 0 R 1199 0 R 1200 0 R 1201 0 R 1202 0 R 1203 0 R 1204 0 R 1205 0 R 1206 0 R 1207 0 R 1208 0 R 1209 0 R 1210 0 R 1211 0 R 1212 0 R 1213 0 R 1214 0 R 1215 0 R 1216 0 R 1217 0 R 1218 0 R 1219 0 R 1220 0 R 1221 0 R 1222 0 R 1223 0 R 1224 0 R 1225 0 R 1226 0 R 1227 0 R 1228 0 R 1229 0 R 1230 0 R 1231 0 R 1232 0 R 1233 0 R 1234 0 R 1235 0 R 1236 0 R 1237 0 R 1238 0 R 1239 0 R 1240 0 R 1241 0 R 1242 0 R 1243 0 R 1244 0 R 1245 0 R 1246 0 R 1247 0 R 1248 0 R 1249 0 R 1250 0 R 1251 0 R 1252 0 R 1253 0 R 1254 0 R 1255 0 R 1256 0 R 1257 0 R 1258 0 R 1259 0 R 1260 0 R 1261 0 R 1262 0 R 1263 0 R 1264 0 R 1265 0 R 1266 0 R 1267 0 R 1268 0 R 1269 0 R 1270 0 R 1271 0 R 1272 0 R 1273 0 R 1274 0 R 1275 0 R 1276 0 R 1277 0 R 1278 0 R 1279 0 R]/Contents 1180 0 R >> endobj 1282 0 obj <> /Annots[1285 0 R 1286 0 R 1287 0 R 1288 0 R 1289 0 R 1290 0 R 1291 0 R 1292 0 R 1293 0 R 1294 0 R 1295 0 R 1296 0 R 1297 0 R 1298 0 R 1299 0 R 1300 0 R 1301 0 R 1302 0 R 1303 0 R 1304 0 R 1305 0 R 1306 0 R 1307 0 R 1308 0 R 1309 0 R 1310 0 R 1311 0 R 1312 0 R 1313 0 R 1314 0 R 1315 0 R 1316 0 R 1317 0 R 1318 0 R 1319 0 R 1320 0 R 1321 0 R 1322 0 R 1323 0 R 1324 0 R 1325 0 R 1326 0 R 1327 0 R 1328 0 R 1329 0 R 1330 0 R 1331 0 R 1332 0 R 1333 0 R 1334 0 R 1335 0 R 1336 0 R 1337 0 R 1338 0 R 1339 0 R 1340 0 R 1341 0 R 1342 0 R 1343 0 R 1344 0 R 1345 0 R 1346 0 R 1347 0 R 1348 0 R 1349 0 R 1350 0 R 1351 0 R 1352 0 R 1353 0 R 1354 0 R 1355 0 R 1356 0 R 1357 0 R 1358 0 R 1359 0 R 1360 0 R 1361 0 R 1362 0 R 1363 0 R 1364 0 R 1365 0 R 1366 0 R 1367 0 R 1368 0 R 1369 0 R 1370 0 R 1371 0 R 1372 0 R 1373 0 R 1374 0 R 1375 0 R 1376 0 R 1377 0 R 1378 0 R 1379 0 R 1380 0 R 1381 0 R 1382 0 R 1383 0 R 1384 0 R 1385 0 R 1386 0 R 1387 0 R 1388 0 R 1389 0 R 1390 0 R 1391 0 R 1392 0 R 1393 0 R 1394 0 R 1395 0 R 1396 0 R 1397 0 R 1398 0 R 1399 0 R 1400 0 R 1401 0 R 1402 0 R 1403 0 R 1404 0 R 1405 0 R 1406 0 R 1407 0 R 1408 0 R 1409 0 R 1410 0 R 1411 0 R 1412 0 R 1413 0 R 1414 0 R 1415 0 R 1416 0 R 1417 0 R 1418 0 R 1419 0 R 1420 0 R 1421 0 R 1422 0 R 1423 0 R 1424 0 R 1425 0 R 1426 0 R 1427 0 R 1428 0 R 1429 0 R 1430 0 R 1431 0 R]/Contents 1283 0 R >> endobj 1434 0 obj <> /Annots[1437 0 R 1438 0 R 1439 0 R 1440 0 R 1441 0 R 1442 0 R 1443 0 R 1444 0 R 1445 0 R 1446 0 R 1447 0 R 1448 0 R 1449 0 R 1450 0 R 1451 0 R 1452 0 R 1453 0 R 1454 0 R 1455 0 R 1456 0 R 1457 0 R 1458 0 R 1459 0 R 1460 0 R 1461 0 R 1462 0 R 1463 0 R 1464 0 R 1465 0 R 1466 0 R 1467 0 R 1468 0 R 1469 0 R 1470 0 R 1471 0 R 1472 0 R 1473 0 R]/Contents 1435 0 R >> endobj 1476 0 obj <> /Annots[1479 0 R 1480 0 R 1481 0 R 1482 0 R 1483 0 R 1484 0 R 1485 0 R 1486 0 R 1487 0 R 1488 0 R 1489 0 R 1490 0 R 1491 0 R 1492 0 R 1493 0 R 1494 0 R 1495 0 R 1496 0 R 1497 0 R 1498 0 R 1499 0 R 1500 0 R 1501 0 R 1502 0 R 1503 0 R 1504 0 R 1505 0 R 1506 0 R 1507 0 R 1508 0 R 1509 0 R 1510 0 R 1511 0 R 1512 0 R 1513 0 R 1514 0 R 1515 0 R 1516 0 R 1517 0 R 1518 0 R 1519 0 R 1520 0 R 1521 0 R 1522 0 R 1523 0 R 1524 0 R 1525 0 R 1526 0 R 1527 0 R 1528 0 R 1529 0 R 1530 0 R 1531 0 R 1532 0 R 1533 0 R 1534 0 R 1535 0 R 1536 0 R 1537 0 R 1538 0 R 1539 0 R 1540 0 R 1541 0 R 1542 0 R 1543 0 R 1544 0 R 1545 0 R 1546 0 R 1547 0 R 1548 0 R 1549 0 R 1550 0 R 1551 0 R 1552 0 R 1553 0 R 1554 0 R 1555 0 R 1556 0 R 1557 0 R 1558 0 R 1559 0 R 1560 0 R 1561 0 R 1562 0 R 1563 0 R 1564 0 R 1565 0 R 1566 0 R 1567 0 R 1568 0 R 1569 0 R 1570 0 R 1571 0 R 1572 0 R 1573 0 R 1574 0 R 1575 0 R 1576 0 R 1577 0 R 1578 0 R 1579 0 R 1580 0 R 1581 0 R 1582 0 R 1583 0 R 1584 0 R 1585 0 R 1586 0 R 1587 0 R 1588 0 R 1589 0 R 1590 0 R 1591 0 R 1592 0 R 1593 0 R 1594 0 R 1595 0 R 1596 0 R 1597 0 R 1598 0 R 1599 0 R 1600 0 R 1601 0 R 1602 0 R 1603 0 R 1604 0 R 1605 0 R 1606 0 R 1607 0 R 1608 0 R 1609 0 R 1610 0 R 1611 0 R 1612 0 R 1613 0 R 1614 0 R 1615 0 R 1616 0 R 1617 0 R 1618 0 R 1619 0 R 1620 0 R 1621 0 R 1622 0 R 1623 0 R 1624 0 R 1625 0 R 1626 0 R 1627 0 R 1628 0 R 1629 0 R 1630 0 R 1631 0 R 1632 0 R 1633 0 R 1634 0 R 1635 0 R 1636 0 R 1637 0 R 1638 0 R 1639 0 R 1640 0 R 1641 0 R 1642 0 R 1643 0 R 1644 0 R 1645 0 R 1646 0 R 1647 0 R 1648 0 R 1649 0 R 1650 0 R 1651 0 R 1652 0 R 1653 0 R 1654 0 R 1655 0 R 1656 0 R 1657 0 R 1658 0 R 1659 0 R 1660 0 R 1661 0 R 1662 0 R 1663 0 R 1664 0 R 1665 0 R 1666 0 R 1667 0 R 1668 0 R 1669 0 R 1670 0 R 1671 0 R 1672 0 R 1673 0 R 1674 0 R 1675 0 R 1676 0 R 1677 0 R 1678 0 R 1679 0 R 1680 0 R 1681 0 R 1682 0 R 1683 0 R 1684 0 R 1685 0 R 1686 0 R 1687 0 R 1688 0 R 1689 0 R 1690 0 R 1691 0 R 1692 0 R 1693 0 R 1694 0 R 1695 0 R 1696 0 R 1697 0 R 1698 0 R 1699 0 R 1700 0 R 1701 0 R 1702 0 R 1703 0 R 1704 0 R 1705 0 R 1706 0 R 1707 0 R 1708 0 R 1709 0 R 1710 0 R 1711 0 R 1712 0 R 1713 0 R 1714 0 R 1715 0 R 1716 0 R 1717 0 R 1718 0 R 1719 0 R 1720 0 R]/Contents 1477 0 R >> endobj 1723 0 obj <> /Annots[1726 0 R 1727 0 R 1728 0 R 1729 0 R 1730 0 R 1731 0 R 1732 0 R 1733 0 R 1734 0 R 1735 0 R 1736 0 R 1737 0 R 1738 0 R 1739 0 R 1740 0 R 1741 0 R 1742 0 R 1743 0 R]/Contents 1724 0 R >> endobj 1746 0 obj <> /Contents 1747 0 R >> endobj 1751 0 obj <> /Contents 1752 0 R >> endobj 1756 0 obj <> /Contents 1757 0 R >> endobj 1761 0 obj <> /Contents 1762 0 R >> endobj 1766 0 obj <> /Contents 1767 0 R >> endobj 1771 0 obj <> /Contents 1772 0 R >> endobj 1776 0 obj <> /Contents 1777 0 R >> endobj 1781 0 obj <> /Contents 1782 0 R >> endobj 1786 0 obj <> /Contents 1787 0 R >> endobj 1791 0 obj <> /Contents 1792 0 R >> endobj 1796 0 obj <> /Contents 1797 0 R >> endobj 3 0 obj << /Type /Pages /Kids [ 4 0 R 145 0 R 150 0 R 180 0 R 219 0 R 254 0 R 291 0 R 306 0 R 311 0 R 316 0 R 323 0 R 328 0 R 333 0 R 338 0 R 343 0 R 348 0 R 353 0 R 358 0 R 363 0 R 368 0 R 373 0 R 380 0 R 385 0 R 390 0 R 395 0 R 400 0 R 405 0 R 410 0 R 415 0 R 420 0 R 425 0 R 430 0 R 435 0 R 440 0 R 445 0 R 450 0 R 455 0 R 460 0 R 465 0 R 472 0 R 477 0 R 482 0 R 487 0 R 492 0 R 497 0 R 502 0 R 507 0 R 512 0 R 517 0 R 522 0 R 527 0 R 532 0 R 537 0 R 542 0 R 547 0 R 552 0 R 557 0 R 562 0 R 567 0 R 572 0 R 577 0 R 582 0 R 587 0 R 592 0 R 597 0 R 602 0 R 607 0 R 612 0 R 617 0 R 622 0 R 627 0 R 632 0 R 637 0 R 642 0 R 647 0 R 652 0 R 657 0 R 662 0 R 667 0 R 672 0 R 677 0 R 682 0 R 687 0 R 692 0 R 697 0 R 702 0 R 707 0 R 712 0 R 717 0 R 722 0 R 727 0 R 732 0 R 737 0 R 742 0 R 747 0 R 752 0 R 757 0 R 764 0 R 769 0 R 774 0 R 779 0 R 784 0 R 789 0 R 794 0 R 799 0 R 804 0 R 809 0 R 814 0 R 819 0 R 824 0 R 829 0 R 834 0 R 839 0 R 844 0 R 849 0 R 854 0 R 859 0 R 864 0 R 869 0 R 874 0 R 879 0 R 884 0 R 889 0 R 894 0 R 899 0 R 904 0 R 909 0 R 914 0 R 919 0 R 924 0 R 929 0 R 934 0 R 939 0 R 944 0 R 949 0 R 954 0 R 959 0 R 964 0 R 969 0 R 974 0 R 979 0 R 984 0 R 989 0 R 994 0 R 999 0 R 1004 0 R 1009 0 R 1014 0 R 1019 0 R 1024 0 R 1029 0 R 1034 0 R 1039 0 R 1044 0 R 1049 0 R 1054 0 R 1059 0 R 1064 0 R 1069 0 R 1074 0 R 1079 0 R 1084 0 R 1089 0 R 1094 0 R 1099 0 R 1104 0 R 1109 0 R 1114 0 R 1119 0 R 1124 0 R 1129 0 R 1134 0 R 1139 0 R 1144 0 R 1149 0 R 1154 0 R 1159 0 R 1164 0 R 1169 0 R 1174 0 R 1179 0 R 1282 0 R 1434 0 R 1476 0 R 1723 0 R 1746 0 R 1751 0 R 1756 0 R 1761 0 R 1766 0 R 1771 0 R 1776 0 R 1781 0 R 1786 0 R 1791 0 R 1796 0 R ] /Count 196 >> endobj 6 0 obj << /Count 16 /First 7 0 R /Last 133 0 R >> endobj 1 0 obj <> 4 << /S /D >>] >> /Metadata 1816 0 R >> endobj 8 0 obj << /Title( A Brief Overview) /Dest/section.1.1 /Parent 7 0 R /Next 9 0 R >> endobj 9 0 obj << /Title(Sources of FITS Software and Information) /Dest/section.1.2 /Parent 7 0 R /Prev 8 0 R /Next 10 0 R >> endobj 10 0 obj << /Title(Acknowledgments) /Dest/section.1.3 /Parent 7 0 R /Prev 9 0 R /Next 11 0 R >> endobj 11 0 obj << /Title(Legal Stuff) /Dest/section.1.4 /Parent 7 0 R /Prev 10 0 R >> endobj 7 0 obj << /Title(Introduction ) /Dest/chapter.1 /Count -4 /Parent 6 0 R /Next 12 0 R /First 8 0 R /Last 11 0 R >> endobj 14 0 obj << /Title(Unix Systems) /Dest/subsection.2.1.1 /Parent 13 0 R /Next 15 0 R >> endobj 15 0 obj << /Title(VMS) /Dest/subsection.2.1.2 /Parent 13 0 R /Prev 14 0 R /Next 16 0 R >> endobj 16 0 obj << /Title(Windows PCs) /Dest/subsection.2.1.3 /Parent 13 0 R /Prev 15 0 R /Next 17 0 R >> endobj 17 0 obj << /Title(Macintosh PCs) /Dest/subsection.2.1.4 /Parent 13 0 R /Prev 16 0 R >> endobj 13 0 obj << /Title(Building the Library) /Dest/section.2.1 /Count -4 /Parent 12 0 R /Next 18 0 R /First 14 0 R /Last 17 0 R >> endobj 18 0 obj << /Title(Testing the Library) /Dest/section.2.2 /Parent 12 0 R /Prev 13 0 R /Next 19 0 R >> endobj 19 0 obj << /Title(Linking Programs with CFITSIO) /Dest/section.2.3 /Parent 12 0 R /Prev 18 0 R /Next 20 0 R >> endobj 20 0 obj << /Title(Using CFITSIO in Multi-threaded Environments) /Dest/section.2.4 /Parent 12 0 R /Prev 19 0 R /Next 21 0 R >> endobj 21 0 obj << /Title(Getting Started with CFITSIO) /Dest/section.2.5 /Parent 12 0 R /Prev 20 0 R /Next 22 0 R >> endobj 22 0 obj << /Title(Example Program) /Dest/section.2.6 /Parent 12 0 R /Prev 21 0 R >> endobj 12 0 obj << /Title( Creating the CFITSIO Library ) /Dest/chapter.2 /Count -6 /Parent 6 0 R /Prev 7 0 R /Next 23 0 R /First 13 0 R /Last 22 0 R >> endobj 23 0 obj << /Title( A FITS Primer ) /Dest/chapter.3 /Parent 6 0 R /Prev 12 0 R /Next 24 0 R >> endobj 25 0 obj << /Title(CFITSIO Definitions) /Dest/section.4.1 /Parent 24 0 R /Next 26 0 R >> endobj 26 0 obj << /Title(Current Header Data Unit \(CHDU\)) /Dest/section.4.2 /Parent 24 0 R /Prev 25 0 R /Next 27 0 R >> endobj 27 0 obj << /Title(Function Names and Variable Datatypes) /Dest/section.4.3 /Parent 24 0 R /Prev 26 0 R /Next 28 0 R >> endobj 28 0 obj << /Title(Support for Unsigned Integers and Signed Bytes) /Dest/section.4.4 /Parent 24 0 R /Prev 27 0 R /Next 29 0 R >> endobj 29 0 obj << /Title(Dealing with Character Strings) /Dest/section.4.5 /Parent 24 0 R /Prev 28 0 R /Next 30 0 R >> endobj 30 0 obj << /Title(Implicit Data Type Conversion) /Dest/section.4.6 /Parent 24 0 R /Prev 29 0 R /Next 31 0 R >> endobj 31 0 obj << /Title(Data Scaling) /Dest/section.4.7 /Parent 24 0 R /Prev 30 0 R /Next 32 0 R >> endobj 32 0 obj << /Title(Support for IEEE Special Values) /Dest/section.4.8 /Parent 24 0 R /Prev 31 0 R /Next 33 0 R >> endobj 33 0 obj << /Title(Error Status Values and the Error Message Stack) /Dest/section.4.9 /Parent 24 0 R /Prev 32 0 R /Next 34 0 R >> endobj 34 0 obj << /Title(Variable-Length Arrays in Binary Tables) /Dest/section.4.10 /Parent 24 0 R /Prev 33 0 R /Next 35 0 R >> endobj 35 0 obj << /Title(Multiple Access to the Same FITS File) /Dest/section.4.11 /Parent 24 0 R /Prev 34 0 R /Next 36 0 R >> endobj 36 0 obj << /Title(When the Final Size of the FITS HDU is Unknown) /Dest/section.4.12 /Parent 24 0 R /Prev 35 0 R /Next 37 0 R >> endobj 37 0 obj << /Title(CFITSIO Size Limitations) /Dest/section.4.13 /Parent 24 0 R /Prev 36 0 R >> endobj 24 0 obj << /Title( Programming Guidelines ) /Dest/chapter.4 /Count -13 /Parent 6 0 R /Prev 23 0 R /Next 38 0 R /First 25 0 R /Last 37 0 R >> endobj 39 0 obj << /Title(CFITSIO Error Status Routines) /Dest/section.5.1 /Parent 38 0 R /Next 40 0 R >> endobj 40 0 obj << /Title(FITS File Access Routines) /Dest/section.5.2 /Parent 38 0 R /Prev 39 0 R /Next 41 0 R >> endobj 41 0 obj << /Title(HDU Access Routines) /Dest/section.5.3 /Parent 38 0 R /Prev 40 0 R /Next 42 0 R >> endobj 43 0 obj << /Title(Keyword Reading Routines) /Dest/subsection.5.4.1 /Parent 42 0 R /Next 44 0 R >> endobj 44 0 obj << /Title(Keyword Writing Routines) /Dest/subsection.5.4.2 /Parent 42 0 R /Prev 43 0 R >> endobj 42 0 obj << /Title(Header Keyword Read/Write Routines) /Dest/section.5.4 /Count -2 /Parent 38 0 R /Prev 41 0 R /Next 45 0 R /First 43 0 R /Last 44 0 R >> endobj 45 0 obj << /Title(Primary Array or IMAGE Extension I/O Routines) /Dest/section.5.5 /Parent 38 0 R /Prev 42 0 R /Next 46 0 R >> endobj 46 0 obj << /Title(Image Compression) /Dest/section.5.6 /Parent 38 0 R /Prev 45 0 R /Next 47 0 R >> endobj 48 0 obj << /Title(Create New Table) /Dest/subsection.5.7.1 /Parent 47 0 R /Next 49 0 R >> endobj 49 0 obj << /Title(Column Information Routines) /Dest/subsection.5.7.2 /Parent 47 0 R /Prev 48 0 R /Next 50 0 R >> endobj 50 0 obj << /Title(Routines to Edit Rows or Columns) /Dest/subsection.5.7.3 /Parent 47 0 R /Prev 49 0 R /Next 51 0 R >> endobj 51 0 obj << /Title(Read and Write Column Data Routines) /Dest/subsection.5.7.4 /Parent 47 0 R /Prev 50 0 R /Next 52 0 R >> endobj 52 0 obj << /Title(Row Selection and Calculator Routines) /Dest/subsection.5.7.5 /Parent 47 0 R /Prev 51 0 R /Next 53 0 R >> endobj 53 0 obj << /Title(Column Binning or Histogramming Routines) /Dest/subsection.5.7.6 /Parent 47 0 R /Prev 52 0 R >> endobj 47 0 obj << /Title(ASCII and Binary Table Routines) /Dest/section.5.7 /Count -6 /Parent 38 0 R /Prev 46 0 R /Next 54 0 R /First 48 0 R /Last 53 0 R >> endobj 55 0 obj << /Title(File Checksum Routines) /Dest/subsection.5.8.1 /Parent 54 0 R /Next 56 0 R >> endobj 56 0 obj << /Title(Date and Time Utility Routines) /Dest/subsection.5.8.2 /Parent 54 0 R /Prev 55 0 R /Next 57 0 R >> endobj 57 0 obj << /Title(General Utility Routines) /Dest/subsection.5.8.3 /Parent 54 0 R /Prev 56 0 R >> endobj 54 0 obj << /Title(Utility Routines) /Dest/section.5.8 /Count -3 /Parent 38 0 R /Prev 47 0 R /First 55 0 R /Last 57 0 R >> endobj 38 0 obj << /Title(Basic CFITSIO Interface Routines ) /Dest/chapter.5 /Count -8 /Parent 6 0 R /Prev 24 0 R /Next 58 0 R /First 39 0 R /Last 54 0 R >> endobj 59 0 obj << /Title(The Iterator Work Function) /Dest/section.6.1 /Parent 58 0 R /Next 60 0 R >> endobj 60 0 obj << /Title(The Iterator Driver Function) /Dest/section.6.2 /Parent 58 0 R /Prev 59 0 R /Next 61 0 R >> endobj 61 0 obj << /Title(Guidelines for Using the Iterator Function) /Dest/section.6.3 /Parent 58 0 R /Prev 60 0 R /Next 62 0 R >> endobj 62 0 obj << /Title(Complete List of Iterator Routines) /Dest/section.6.4 /Parent 58 0 R /Prev 61 0 R >> endobj 58 0 obj << /Title( The CFITSIO Iterator Function ) /Dest/chapter.6 /Count -4 /Parent 6 0 R /Prev 38 0 R /Next 63 0 R /First 59 0 R /Last 62 0 R >> endobj 64 0 obj << /Title( Self-contained WCS Routines) /Dest/section.7.1 /Parent 63 0 R >> endobj 63 0 obj << /Title( World Coordinate System Routines ) /Dest/chapter.7 /Count -1 /Parent 6 0 R /Prev 58 0 R /Next 65 0 R /First 64 0 R /Last 64 0 R >> endobj 66 0 obj << /Title(Grouping Table Routines) /Dest/section.8.1 /Parent 65 0 R /Next 67 0 R >> endobj 67 0 obj << /Title(Group Member Routines) /Dest/section.8.2 /Parent 65 0 R /Prev 66 0 R >> endobj 65 0 obj << /Title( Hierarchical Grouping Routines ) /Dest/chapter.8 /Count -2 /Parent 6 0 R /Prev 63 0 R /Next 68 0 R /First 66 0 R /Last 67 0 R >> endobj 70 0 obj << /Title(File Access) /Dest/subsection.9.1.1 /Parent 69 0 R /Next 71 0 R >> endobj 71 0 obj << /Title(Download Utility Functions) /Dest/subsection.9.1.2 /Parent 69 0 R /Prev 70 0 R >> endobj 69 0 obj << /Title(FITS File Access Routines) /Dest/section.9.1 /Count -2 /Parent 68 0 R /Next 72 0 R /First 70 0 R /Last 71 0 R >> endobj 72 0 obj << /Title(HDU Access Routines) /Dest/section.9.2 /Parent 68 0 R /Prev 69 0 R /Next 73 0 R >> endobj 74 0 obj << /Title(Header Information Routines) /Dest/subsection.9.3.1 /Parent 73 0 R /Next 75 0 R >> endobj 75 0 obj << /Title(Read and Write the Required Keywords) /Dest/subsection.9.3.2 /Parent 73 0 R /Prev 74 0 R /Next 76 0 R >> endobj 76 0 obj << /Title(Write Keyword Routines) /Dest/subsection.9.3.3 /Parent 73 0 R /Prev 75 0 R /Next 77 0 R >> endobj 77 0 obj << /Title(Insert Keyword Routines) /Dest/subsection.9.3.4 /Parent 73 0 R /Prev 76 0 R /Next 78 0 R >> endobj 78 0 obj << /Title(Read Keyword Routines) /Dest/subsection.9.3.5 /Parent 73 0 R /Prev 77 0 R /Next 79 0 R >> endobj 79 0 obj << /Title(Modify Keyword Routines) /Dest/subsection.9.3.6 /Parent 73 0 R /Prev 78 0 R /Next 80 0 R >> endobj 80 0 obj << /Title(Update Keyword Routines) /Dest/subsection.9.3.7 /Parent 73 0 R /Prev 79 0 R >> endobj 73 0 obj << /Title(Specialized Header Keyword Routines) /Dest/section.9.3 /Count -7 /Parent 68 0 R /Prev 72 0 R /Next 81 0 R /First 74 0 R /Last 80 0 R >> endobj 81 0 obj << /Title(Define Data Scaling and Undefined Pixel Parameters) /Dest/section.9.4 /Parent 68 0 R /Prev 73 0 R /Next 82 0 R >> endobj 82 0 obj << /Title(Specialized FITS Primary Array or IMAGE Extension I/O Routines) /Dest/section.9.5 /Parent 68 0 R /Prev 81 0 R /Next 83 0 R >> endobj 84 0 obj << /Title(General Column Routines) /Dest/subsection.9.6.1 /Parent 83 0 R /Next 85 0 R >> endobj 85 0 obj << /Title(Low-Level Table Access Routines) /Dest/subsection.9.6.2 /Parent 83 0 R /Prev 84 0 R /Next 86 0 R >> endobj 86 0 obj << /Title(Write Column Data Routines) /Dest/subsection.9.6.3 /Parent 83 0 R /Prev 85 0 R /Next 87 0 R >> endobj 87 0 obj << /Title(Read Column Data Routines) /Dest/subsection.9.6.4 /Parent 83 0 R /Prev 86 0 R >> endobj 83 0 obj << /Title(Specialized FITS ASCII and Binary Table Routines) /Dest/section.9.6 /Count -4 /Parent 68 0 R /Prev 82 0 R /First 84 0 R /Last 87 0 R >> endobj 68 0 obj << /Title( Specialized CFITSIO Interface Routines ) /Dest/chapter.9 /Count -6 /Parent 6 0 R /Prev 65 0 R /Next 88 0 R /First 69 0 R /Last 83 0 R >> endobj 89 0 obj << /Title(Overview) /Dest/section.10.1 /Parent 88 0 R /Next 90 0 R >> endobj 91 0 obj << /Title(Notes about HTTP proxy servers) /Dest/subsection.10.2.1 /Parent 90 0 R /Next 92 0 R >> endobj 92 0 obj << /Title(Notes about HTTPS and FTPS file access) /Dest/subsection.10.2.2 /Parent 90 0 R /Prev 91 0 R /Next 93 0 R >> endobj 93 0 obj << /Title(Notes about the stream filetype driver) /Dest/subsection.10.2.3 /Parent 90 0 R /Prev 92 0 R /Next 94 0 R >> endobj 94 0 obj << /Title(Notes about the gsiftp filetype) /Dest/subsection.10.2.4 /Parent 90 0 R /Prev 93 0 R /Next 95 0 R >> endobj 95 0 obj << /Title(Notes about the root filetype) /Dest/subsection.10.2.5 /Parent 90 0 R /Prev 94 0 R /Next 96 0 R >> endobj 96 0 obj << /Title(Notes about the shmem filetype:) /Dest/subsection.10.2.6 /Parent 90 0 R /Prev 95 0 R >> endobj 90 0 obj << /Title(Filetype) /Dest/section.10.2 /Count -6 /Parent 88 0 R /Prev 89 0 R /Next 97 0 R /First 91 0 R /Last 96 0 R >> endobj 97 0 obj << /Title(Base Filename) /Dest/section.10.3 /Parent 88 0 R /Prev 90 0 R /Next 98 0 R >> endobj 98 0 obj << /Title(Output File Name when Opening an Existing File) /Dest/section.10.4 /Parent 88 0 R /Prev 97 0 R /Next 99 0 R >> endobj 99 0 obj << /Title(Template File Name when Creating a New File) /Dest/section.10.5 /Parent 88 0 R /Prev 98 0 R /Next 100 0 R >> endobj 100 0 obj << /Title(Image Tile-Compression Specification) /Dest/section.10.6 /Parent 88 0 R /Prev 99 0 R /Next 101 0 R >> endobj 101 0 obj << /Title(HDU Location Specification) /Dest/section.10.7 /Parent 88 0 R /Prev 100 0 R /Next 102 0 R >> endobj 102 0 obj << /Title(Image Section) /Dest/section.10.8 /Parent 88 0 R /Prev 101 0 R /Next 103 0 R >> endobj 103 0 obj << /Title(Image Transform Filters) /Dest/section.10.9 /Parent 88 0 R /Prev 102 0 R /Next 104 0 R >> endobj 104 0 obj << /Title(Column and Keyword Filtering Specification) /Dest/section.10.10 /Parent 88 0 R /Prev 103 0 R /Next 105 0 R >> endobj 106 0 obj << /Title(General Syntax) /Dest/subsection.10.11.1 /Parent 105 0 R /Next 107 0 R >> endobj 107 0 obj << /Title(Bit Masks) /Dest/subsection.10.11.2 /Parent 105 0 R /Prev 106 0 R /Next 108 0 R >> endobj 108 0 obj << /Title(Vector Columns) /Dest/subsection.10.11.3 /Parent 105 0 R /Prev 107 0 R /Next 109 0 R >> endobj 109 0 obj << /Title(Row Access) /Dest/subsection.10.11.4 /Parent 105 0 R /Prev 108 0 R /Next 110 0 R >> endobj 110 0 obj << /Title(Good Time Interval Filtering) /Dest/subsection.10.11.5 /Parent 105 0 R /Prev 109 0 R /Next 111 0 R >> endobj 111 0 obj << /Title(Spatial Region Filtering) /Dest/subsection.10.11.6 /Parent 105 0 R /Prev 110 0 R /Next 112 0 R >> endobj 112 0 obj << /Title(Example Row Filters) /Dest/subsection.10.11.7 /Parent 105 0 R /Prev 111 0 R >> endobj 105 0 obj << /Title(Row Filtering Specification) /Dest/section.10.11 /Count -7 /Parent 88 0 R /Prev 104 0 R /Next 113 0 R /First 106 0 R /Last 112 0 R >> endobj 113 0 obj << /Title( Binning or Histogramming Specification) /Dest/section.10.12 /Parent 88 0 R /Prev 105 0 R >> endobj 88 0 obj << /Title( Extended File Name Syntax ) /Dest/chapter.10 /Count -12 /Parent 6 0 R /Prev 68 0 R /Next 114 0 R /First 89 0 R /Last 113 0 R >> endobj 115 0 obj << /Title(Detailed Template Line Format) /Dest/section.11.1 /Parent 114 0 R /Next 116 0 R >> endobj 116 0 obj << /Title(Auto-indexing of Keywords) /Dest/section.11.2 /Parent 114 0 R /Prev 115 0 R /Next 117 0 R >> endobj 117 0 obj << /Title(Template Parser Directives) /Dest/section.11.3 /Parent 114 0 R /Prev 116 0 R /Next 118 0 R >> endobj 118 0 obj << /Title(Formal Template Syntax) /Dest/section.11.4 /Parent 114 0 R /Prev 117 0 R /Next 119 0 R >> endobj 119 0 obj << /Title(Errors) /Dest/section.11.5 /Parent 114 0 R /Prev 118 0 R /Next 120 0 R >> endobj 120 0 obj << /Title(Examples) /Dest/section.11.6 /Parent 114 0 R /Prev 119 0 R >> endobj 114 0 obj << /Title(Template Files ) /Dest/chapter.11 /Count -6 /Parent 6 0 R /Prev 88 0 R /Next 121 0 R /First 115 0 R /Last 120 0 R >> endobj 122 0 obj << /Title(64-Bit Long Integers) /Dest/section.12.1 /Parent 121 0 R /Next 123 0 R >> endobj 123 0 obj << /Title(Long String Keyword Values.) /Dest/section.12.2 /Parent 121 0 R /Prev 122 0 R /Next 124 0 R >> endobj 124 0 obj << /Title(Arrays of Fixed-Length Strings in Binary Tables) /Dest/section.12.3 /Parent 121 0 R /Prev 123 0 R /Next 125 0 R >> endobj 125 0 obj << /Title(Keyword Units Strings) /Dest/section.12.4 /Parent 121 0 R /Prev 124 0 R /Next 126 0 R >> endobj 126 0 obj << /Title(HIERARCH Convention for Extended Keyword Names) /Dest/section.12.5 /Parent 121 0 R /Prev 125 0 R /Next 127 0 R >> endobj 127 0 obj << /Title(Tile-Compressed Image Format) /Dest/section.12.6 /Parent 121 0 R /Prev 126 0 R >> endobj 121 0 obj << /Title( Local FITS Conventions ) /Dest/chapter.12 /Count -6 /Parent 6 0 R /Prev 114 0 R /Next 128 0 R /First 122 0 R /Last 127 0 R >> endobj 129 0 obj << /Title(How CFITSIO Manages Data I/O) /Dest/section.13.1 /Parent 128 0 R /Next 130 0 R >> endobj 130 0 obj << /Title(Optimization Strategies) /Dest/section.13.2 /Parent 128 0 R /Prev 129 0 R >> endobj 128 0 obj << /Title( Optimizing Programs ) /Dest/chapter.13 /Count -2 /Parent 6 0 R /Prev 121 0 R /Next 131 0 R /First 129 0 R /Last 130 0 R >> endobj 131 0 obj << /Title(Index of Routines ) /Dest/appendix.A /Parent 6 0 R /Prev 128 0 R /Next 132 0 R >> endobj 132 0 obj << /Title(Parameter Definitions ) /Dest/appendix.B /Parent 6 0 R /Prev 131 0 R /Next 133 0 R >> endobj 136 0 obj <>endobj 143 0 obj <> endobj 144 0 obj <> endobj 148 0 obj <> endobj 149 0 obj <> endobj 153 0 obj <>endobj 156 0 obj <>endobj 157 0 obj <>endobj 158 0 obj <>endobj 159 0 obj <>endobj 160 0 obj <>endobj 161 0 obj <>endobj 162 0 obj <>endobj 163 0 obj <>endobj 164 0 obj <>endobj 165 0 obj <>endobj 166 0 obj <>endobj 167 0 obj <>endobj 168 0 obj <>endobj 169 0 obj <>endobj 170 0 obj <>endobj 171 0 obj <>endobj 172 0 obj <>endobj 173 0 obj <>endobj 174 0 obj <>endobj 175 0 obj <>endobj 176 0 obj <>endobj 177 0 obj <>endobj 178 0 obj <> endobj 179 0 obj <> endobj 185 0 obj <>endobj 186 0 obj <>endobj 187 0 obj <>endobj 188 0 obj <>endobj 189 0 obj <>endobj 190 0 obj <>endobj 191 0 obj <>endobj 192 0 obj <>endobj 193 0 obj <>endobj 194 0 obj <>endobj 195 0 obj <>endobj 196 0 obj <>endobj 197 0 obj <>endobj 198 0 obj <>endobj 199 0 obj <>endobj 200 0 obj <>endobj 201 0 obj <>endobj 202 0 obj <>endobj 203 0 obj <>endobj 204 0 obj <>endobj 205 0 obj <>endobj 206 0 obj <>endobj 207 0 obj <>endobj 208 0 obj <>endobj 209 0 obj <>endobj 210 0 obj <>endobj 211 0 obj <>endobj 212 0 obj <>endobj 213 0 obj <>endobj 214 0 obj <>endobj 215 0 obj <>endobj 216 0 obj <>endobj 217 0 obj <> endobj 218 0 obj <> endobj 222 0 obj <>endobj 223 0 obj <>endobj 224 0 obj <>endobj 225 0 obj <>endobj 226 0 obj <>endobj 227 0 obj <>endobj 228 0 obj <>endobj 229 0 obj <>endobj 230 0 obj <>endobj 231 0 obj <>endobj 232 0 obj <>endobj 233 0 obj <>endobj 234 0 obj <>endobj 235 0 obj <>endobj 236 0 obj <>endobj 237 0 obj <>endobj 238 0 obj <>endobj 239 0 obj <>endobj 240 0 obj <>endobj 241 0 obj <>endobj 242 0 obj <>endobj 243 0 obj <>endobj 244 0 obj <>endobj 245 0 obj <>endobj 246 0 obj <>endobj 247 0 obj <>endobj 248 0 obj <>endobj 249 0 obj <>endobj 250 0 obj <>endobj 251 0 obj <>endobj 252 0 obj <> endobj 253 0 obj <> endobj 257 0 obj <>endobj 258 0 obj <>endobj 259 0 obj <>endobj 260 0 obj <>endobj 261 0 obj <>endobj 262 0 obj <>endobj 263 0 obj <>endobj 264 0 obj <>endobj 265 0 obj <>endobj 266 0 obj <>endobj 267 0 obj <>endobj 268 0 obj <>endobj 269 0 obj <>endobj 270 0 obj <>endobj 271 0 obj <>endobj 272 0 obj <>endobj 273 0 obj <>endobj 274 0 obj <>endobj 275 0 obj <>endobj 276 0 obj <>endobj 277 0 obj <>endobj 278 0 obj <>endobj 279 0 obj <>endobj 280 0 obj <>endobj 281 0 obj <>endobj 282 0 obj <>endobj 283 0 obj <>endobj 284 0 obj <>endobj 285 0 obj <>endobj 286 0 obj <>endobj 287 0 obj <>endobj 288 0 obj <>endobj 289 0 obj <> endobj 290 0 obj <> endobj 294 0 obj <>endobj 295 0 obj <>endobj 296 0 obj <>endobj 297 0 obj <>endobj 298 0 obj <>endobj 299 0 obj <>endobj 300 0 obj <>endobj 301 0 obj <>endobj 302 0 obj <>endobj 303 0 obj <>endobj 304 0 obj <> endobj 305 0 obj <> endobj 309 0 obj <> endobj 310 0 obj <> endobj 314 0 obj <> endobj 315 0 obj <> endobj 321 0 obj <> endobj 322 0 obj <> endobj 326 0 obj <> endobj 327 0 obj <> endobj 331 0 obj <> endobj 332 0 obj <> endobj 336 0 obj <> endobj 337 0 obj <> endobj 341 0 obj <> endobj 342 0 obj <> endobj 346 0 obj <> endobj 347 0 obj <> endobj 351 0 obj <> endobj 352 0 obj <> endobj 356 0 obj <> endobj 357 0 obj <> endobj 361 0 obj <> endobj 362 0 obj <> endobj 366 0 obj <> endobj 367 0 obj <> endobj 371 0 obj <> endobj 372 0 obj <> endobj 378 0 obj <> endobj 379 0 obj <> endobj 383 0 obj <> endobj 384 0 obj <> endobj 388 0 obj <> endobj 389 0 obj <> endobj 393 0 obj <> endobj 394 0 obj <> endobj 398 0 obj <> endobj 399 0 obj <> endobj 403 0 obj <> endobj 404 0 obj <> endobj 408 0 obj <> endobj 409 0 obj <> endobj 413 0 obj <> endobj 414 0 obj <> endobj 418 0 obj <> endobj 419 0 obj <> endobj 423 0 obj <> endobj 424 0 obj <> endobj 428 0 obj <> endobj 429 0 obj <> endobj 433 0 obj <> endobj 434 0 obj <> endobj 438 0 obj <> endobj 439 0 obj <> endobj 443 0 obj <> endobj 444 0 obj <> endobj 448 0 obj <> endobj 449 0 obj <> endobj 453 0 obj <> endobj 454 0 obj <> endobj 458 0 obj <> endobj 459 0 obj <> endobj 463 0 obj <> endobj 464 0 obj <> endobj 470 0 obj <> endobj 471 0 obj <> endobj 475 0 obj <> endobj 476 0 obj <> endobj 480 0 obj <> endobj 481 0 obj <> endobj 485 0 obj <> endobj 486 0 obj <> endobj 490 0 obj <> endobj 491 0 obj <> endobj 495 0 obj <> endobj 496 0 obj <> endobj 500 0 obj <> endobj 501 0 obj <> endobj 505 0 obj <> endobj 506 0 obj <> endobj 510 0 obj <> endobj 511 0 obj <> endobj 515 0 obj <> endobj 516 0 obj <> endobj 520 0 obj <> endobj 521 0 obj <> endobj 525 0 obj <> endobj 526 0 obj <> endobj 530 0 obj <> endobj 531 0 obj <> endobj 535 0 obj <> endobj 536 0 obj <> endobj 540 0 obj <> endobj 541 0 obj <> endobj 545 0 obj <> endobj 546 0 obj <> endobj 550 0 obj <> endobj 551 0 obj <> endobj 555 0 obj <> endobj 556 0 obj <> endobj 560 0 obj <> endobj 561 0 obj <> endobj 565 0 obj <> endobj 566 0 obj <> endobj 570 0 obj <> endobj 571 0 obj <> endobj 575 0 obj <> endobj 576 0 obj <> endobj 580 0 obj <> endobj 581 0 obj <> endobj 585 0 obj <> endobj 586 0 obj <> endobj 590 0 obj <> endobj 591 0 obj <> endobj 595 0 obj <> endobj 596 0 obj <> endobj 600 0 obj <> endobj 601 0 obj <> endobj 605 0 obj <> endobj 606 0 obj <> endobj 610 0 obj <> endobj 611 0 obj <> endobj 615 0 obj <> endobj 616 0 obj <> endobj 620 0 obj <> endobj 621 0 obj <> endobj 625 0 obj <> endobj 626 0 obj <> endobj 630 0 obj <> endobj 631 0 obj <> endobj 635 0 obj <> endobj 636 0 obj <> endobj 640 0 obj <> endobj 641 0 obj <> endobj 645 0 obj <> endobj 646 0 obj <> endobj 650 0 obj <> endobj 651 0 obj <> endobj 655 0 obj <> endobj 656 0 obj <> endobj 660 0 obj <> endobj 661 0 obj <> endobj 665 0 obj <> endobj 666 0 obj <> endobj 670 0 obj <> endobj 671 0 obj <> endobj 675 0 obj <> endobj 676 0 obj <> endobj 680 0 obj <> endobj 681 0 obj <> endobj 685 0 obj <> endobj 686 0 obj <> endobj 690 0 obj <> endobj 691 0 obj <> endobj 695 0 obj <> endobj 696 0 obj <> endobj 700 0 obj <> endobj 701 0 obj <> endobj 705 0 obj <> endobj 706 0 obj <> endobj 710 0 obj <> endobj 711 0 obj <> endobj 715 0 obj <> endobj 716 0 obj <> endobj 720 0 obj <> endobj 721 0 obj <> endobj 725 0 obj <> endobj 726 0 obj <> endobj 730 0 obj <> endobj 731 0 obj <> endobj 735 0 obj <> endobj 736 0 obj <> endobj 740 0 obj <> endobj 741 0 obj <> endobj 745 0 obj <> endobj 746 0 obj <> endobj 750 0 obj <> endobj 751 0 obj <> endobj 755 0 obj <> endobj 756 0 obj <> endobj 762 0 obj <> endobj 763 0 obj <> endobj 767 0 obj <> endobj 768 0 obj <> endobj 772 0 obj <> endobj 773 0 obj <> endobj 777 0 obj <> endobj 778 0 obj <> endobj 782 0 obj <> endobj 783 0 obj <> endobj 787 0 obj <> endobj 788 0 obj <> endobj 792 0 obj <> endobj 793 0 obj <> endobj 797 0 obj <> endobj 798 0 obj <> endobj 802 0 obj <> endobj 803 0 obj <> endobj 807 0 obj <> endobj 808 0 obj <> endobj 812 0 obj <> endobj 813 0 obj <> endobj 817 0 obj <> endobj 818 0 obj <> endobj 822 0 obj <> endobj 823 0 obj <> endobj 827 0 obj <> endobj 828 0 obj <> endobj 832 0 obj <> endobj 833 0 obj <> endobj 837 0 obj <> endobj 838 0 obj <> endobj 842 0 obj <> endobj 843 0 obj <> endobj 847 0 obj <> endobj 848 0 obj <> endobj 852 0 obj <> endobj 853 0 obj <> endobj 857 0 obj <> endobj 858 0 obj <> endobj 862 0 obj <> endobj 863 0 obj <> endobj 867 0 obj <> endobj 868 0 obj <> endobj 872 0 obj <> endobj 873 0 obj <> endobj 877 0 obj <> endobj 878 0 obj <> endobj 882 0 obj <> endobj 883 0 obj <> endobj 887 0 obj <> endobj 888 0 obj <> endobj 892 0 obj <> endobj 893 0 obj <> endobj 897 0 obj <> endobj 898 0 obj <> endobj 902 0 obj <> endobj 903 0 obj <> endobj 907 0 obj <> endobj 908 0 obj <> endobj 912 0 obj <> endobj 913 0 obj <> endobj 917 0 obj <> endobj 918 0 obj <> endobj 922 0 obj <> endobj 923 0 obj <> endobj 927 0 obj <> endobj 928 0 obj <> endobj 932 0 obj <> endobj 933 0 obj <> endobj 937 0 obj <> endobj 938 0 obj <> endobj 942 0 obj <> endobj 943 0 obj <> endobj 947 0 obj <> endobj 948 0 obj <> endobj 952 0 obj <> endobj 953 0 obj <> endobj 957 0 obj <> endobj 958 0 obj <> endobj 962 0 obj <> endobj 963 0 obj <> endobj 967 0 obj <> endobj 968 0 obj <> endobj 972 0 obj <> endobj 973 0 obj <> endobj 977 0 obj <> endobj 978 0 obj <> endobj 982 0 obj <> endobj 983 0 obj <> endobj 987 0 obj <> endobj 988 0 obj <> endobj 992 0 obj <> endobj 993 0 obj <> endobj 997 0 obj <> endobj 998 0 obj <> endobj 1002 0 obj <> endobj 1003 0 obj <> endobj 1007 0 obj <> endobj 1008 0 obj <> endobj 1012 0 obj <> endobj 1013 0 obj <> endobj 1017 0 obj <> endobj 1018 0 obj <> endobj 1022 0 obj <> endobj 1023 0 obj <> endobj 1027 0 obj <> endobj 1028 0 obj <> endobj 1032 0 obj <> endobj 1033 0 obj <> endobj 1037 0 obj <> endobj 1038 0 obj <> endobj 1042 0 obj <> endobj 1043 0 obj <> endobj 1047 0 obj <> endobj 1048 0 obj <> endobj 1052 0 obj <> endobj 1053 0 obj <> endobj 1057 0 obj <> endobj 1058 0 obj <> endobj 1062 0 obj <> endobj 1063 0 obj <> endobj 1067 0 obj <> endobj 1068 0 obj <> endobj 1072 0 obj <> endobj 1073 0 obj <> endobj 1077 0 obj <> endobj 1078 0 obj <> endobj 1082 0 obj <> endobj 1083 0 obj <> endobj 1087 0 obj <> endobj 1088 0 obj <> endobj 1092 0 obj <> endobj 1093 0 obj <> endobj 1097 0 obj <> endobj 1098 0 obj <> endobj 1102 0 obj <> endobj 1103 0 obj <> endobj 1107 0 obj <> endobj 1108 0 obj <> endobj 1112 0 obj <> endobj 1113 0 obj <> endobj 1117 0 obj <> endobj 1118 0 obj <> endobj 1122 0 obj <> endobj 1123 0 obj <> endobj 1127 0 obj <> endobj 1128 0 obj <> endobj 1132 0 obj <> endobj 1133 0 obj <> endobj 1137 0 obj <> endobj 1138 0 obj <> endobj 1142 0 obj <> endobj 1143 0 obj <> endobj 1147 0 obj <> endobj 1148 0 obj <> endobj 1152 0 obj <> endobj 1153 0 obj <> endobj 1157 0 obj <> endobj 1158 0 obj <> endobj 1162 0 obj <> endobj 1163 0 obj <> endobj 1167 0 obj <> endobj 1168 0 obj <> endobj 1172 0 obj <> endobj 1173 0 obj <> endobj 1177 0 obj <> endobj 1178 0 obj <> endobj 1182 0 obj <>endobj 1183 0 obj <>endobj 1184 0 obj <>endobj 1185 0 obj <>endobj 1186 0 obj <>endobj 1187 0 obj <>endobj 1188 0 obj <>endobj 1189 0 obj <>endobj 1190 0 obj <>endobj 1191 0 obj <>endobj 1192 0 obj <>endobj 1193 0 obj <>endobj 1194 0 obj <>endobj 1195 0 obj <>endobj 1196 0 obj <>endobj 1197 0 obj <>endobj 1198 0 obj <>endobj 1199 0 obj <>endobj 1200 0 obj <>endobj 1201 0 obj <>endobj 1202 0 obj <>endobj 1203 0 obj <>endobj 1204 0 obj <>endobj 1205 0 obj <>endobj 1206 0 obj <>endobj 1207 0 obj <>endobj 1208 0 obj <>endobj 1209 0 obj <>endobj 1210 0 obj <>endobj 1211 0 obj <>endobj 1212 0 obj <>endobj 1213 0 obj <>endobj 1214 0 obj <>endobj 1215 0 obj <>endobj 1216 0 obj <>endobj 1217 0 obj <>endobj 1218 0 obj <>endobj 1219 0 obj <>endobj 1220 0 obj <>endobj 1221 0 obj <>endobj 1222 0 obj <>endobj 1223 0 obj <>endobj 1224 0 obj <>endobj 1225 0 obj <>endobj 1226 0 obj <>endobj 1227 0 obj <>endobj 1228 0 obj <>endobj 1229 0 obj <>endobj 1230 0 obj <>endobj 1231 0 obj <>endobj 1232 0 obj <>endobj 1233 0 obj <>endobj 1234 0 obj <>endobj 1235 0 obj <>endobj 1236 0 obj <>endobj 1237 0 obj <>endobj 1238 0 obj <>endobj 1239 0 obj <>endobj 1240 0 obj <>endobj 1241 0 obj <>endobj 1242 0 obj <>endobj 1243 0 obj <>endobj 1244 0 obj <>endobj 1245 0 obj <>endobj 1246 0 obj <>endobj 1247 0 obj <>endobj 1248 0 obj <>endobj 1249 0 obj <>endobj 1250 0 obj <>endobj 1251 0 obj <>endobj 1252 0 obj <>endobj 1253 0 obj <>endobj 1254 0 obj <>endobj 1255 0 obj <>endobj 1256 0 obj <>endobj 1257 0 obj <>endobj 1258 0 obj <>endobj 1259 0 obj <>endobj 1260 0 obj <>endobj 1261 0 obj <>endobj 1262 0 obj <>endobj 1263 0 obj <>endobj 1264 0 obj <>endobj 1265 0 obj <>endobj 1266 0 obj <>endobj 1267 0 obj <>endobj 1268 0 obj <>endobj 1269 0 obj <>endobj 1270 0 obj <>endobj 1271 0 obj <>endobj 1272 0 obj <>endobj 1273 0 obj <>endobj 1274 0 obj <>endobj 1275 0 obj <>endobj 1276 0 obj <>endobj 1277 0 obj <>endobj 1278 0 obj <>endobj 1279 0 obj <>endobj 1280 0 obj <> endobj 1281 0 obj <> endobj 1285 0 obj <>endobj 1286 0 obj <>endobj 1287 0 obj <>endobj 1288 0 obj <>endobj 1289 0 obj <>endobj 1290 0 obj <>endobj 1291 0 obj <>endobj 1292 0 obj <>endobj 1293 0 obj <>endobj 1294 0 obj <>endobj 1295 0 obj <>endobj 1296 0 obj <>endobj 1297 0 obj <>endobj 1298 0 obj <>endobj 1299 0 obj <>endobj 1300 0 obj <>endobj 1301 0 obj <>endobj 1302 0 obj <>endobj 1303 0 obj <>endobj 1304 0 obj <>endobj 1305 0 obj <>endobj 1306 0 obj <>endobj 1307 0 obj <>endobj 1308 0 obj <>endobj 1309 0 obj <>endobj 1310 0 obj <>endobj 1311 0 obj <>endobj 1312 0 obj <>endobj 1313 0 obj <>endobj 1314 0 obj <>endobj 1315 0 obj <>endobj 1316 0 obj <>endobj 1317 0 obj <>endobj 1318 0 obj <>endobj 1319 0 obj <>endobj 1320 0 obj <>endobj 1321 0 obj <>endobj 1322 0 obj <>endobj 1323 0 obj <>endobj 1324 0 obj <>endobj 1325 0 obj <>endobj 1326 0 obj <>endobj 1327 0 obj <>endobj 1328 0 obj <>endobj 1329 0 obj <>endobj 1330 0 obj <>endobj 1331 0 obj <>endobj 1332 0 obj <>endobj 1333 0 obj <>endobj 1334 0 obj <>endobj 1335 0 obj <>endobj 1336 0 obj <>endobj 1337 0 obj <>endobj 1338 0 obj <>endobj 1339 0 obj <>endobj 1340 0 obj <>endobj 1341 0 obj <>endobj 1342 0 obj <>endobj 1343 0 obj <>endobj 1344 0 obj <>endobj 1345 0 obj <>endobj 1346 0 obj <>endobj 1347 0 obj <>endobj 1348 0 obj <>endobj 1349 0 obj <>endobj 1350 0 obj <>endobj 1351 0 obj <>endobj 1352 0 obj <>endobj 1353 0 obj <>endobj 1354 0 obj <>endobj 1355 0 obj <>endobj 1356 0 obj <>endobj 1357 0 obj <>endobj 1358 0 obj <>endobj 1359 0 obj <>endobj 1360 0 obj <>endobj 1361 0 obj <>endobj 1362 0 obj <>endobj 1363 0 obj <>endobj 1364 0 obj <>endobj 1365 0 obj <>endobj 1366 0 obj <>endobj 1367 0 obj <>endobj 1368 0 obj <>endobj 1369 0 obj <>endobj 1370 0 obj <>endobj 1371 0 obj <>endobj 1372 0 obj <>endobj 1373 0 obj <>endobj 1374 0 obj <>endobj 1375 0 obj <>endobj 1376 0 obj <>endobj 1377 0 obj <>endobj 1378 0 obj <>endobj 1379 0 obj <>endobj 1380 0 obj <>endobj 1381 0 obj <>endobj 1382 0 obj <>endobj 1383 0 obj <>endobj 1384 0 obj <>endobj 1385 0 obj <>endobj 1386 0 obj <>endobj 1387 0 obj <>endobj 1388 0 obj <>endobj 1389 0 obj <>endobj 1390 0 obj <>endobj 1391 0 obj <>endobj 1392 0 obj <>endobj 1393 0 obj <>endobj 1394 0 obj <>endobj 1395 0 obj <>endobj 1396 0 obj <>endobj 1397 0 obj <>endobj 1398 0 obj <>endobj 1399 0 obj <>endobj 1400 0 obj <>endobj 1401 0 obj <>endobj 1402 0 obj <>endobj 1403 0 obj <>endobj 1404 0 obj <>endobj 1405 0 obj <>endobj 1406 0 obj <>endobj 1407 0 obj <>endobj 1408 0 obj <>endobj 1409 0 obj <>endobj 1410 0 obj <>endobj 1411 0 obj <>endobj 1412 0 obj <>endobj 1413 0 obj <>endobj 1414 0 obj <>endobj 1415 0 obj <>endobj 1416 0 obj <>endobj 1417 0 obj <>endobj 1418 0 obj <>endobj 1419 0 obj <>endobj 1420 0 obj <>endobj 1421 0 obj <>endobj 1422 0 obj <>endobj 1423 0 obj <>endobj 1424 0 obj <>endobj 1425 0 obj <>endobj 1426 0 obj <>endobj 1427 0 obj <>endobj 1428 0 obj <>endobj 1429 0 obj <>endobj 1430 0 obj <>endobj 1431 0 obj <>endobj 1432 0 obj <> endobj 1433 0 obj <> endobj 1437 0 obj <>endobj 1438 0 obj <>endobj 1439 0 obj <>endobj 1440 0 obj <>endobj 1441 0 obj <>endobj 1442 0 obj <>endobj 1443 0 obj <>endobj 1444 0 obj <>endobj 1445 0 obj <>endobj 1446 0 obj <>endobj 1447 0 obj <>endobj 1448 0 obj <>endobj 1449 0 obj <>endobj 1450 0 obj <>endobj 1451 0 obj <>endobj 1452 0 obj <>endobj 1453 0 obj <>endobj 1454 0 obj <>endobj 1455 0 obj <>endobj 1456 0 obj <>endobj 1457 0 obj <>endobj 1458 0 obj <>endobj 1459 0 obj <>endobj 1460 0 obj <>endobj 1461 0 obj <>endobj 1462 0 obj <>endobj 1463 0 obj <>endobj 1464 0 obj <>endobj 1465 0 obj <>endobj 1466 0 obj <>endobj 1467 0 obj <>endobj 1468 0 obj <>endobj 1469 0 obj <>endobj 1470 0 obj <>endobj 1471 0 obj <>endobj 1472 0 obj <>endobj 1473 0 obj <>endobj 1474 0 obj <> endobj 1475 0 obj <> endobj 1479 0 obj <>endobj 1480 0 obj <>endobj 1481 0 obj <>endobj 1482 0 obj <>endobj 1483 0 obj <>endobj 1484 0 obj <>endobj 1485 0 obj <>endobj 1486 0 obj <>endobj 1487 0 obj <>endobj 1488 0 obj <>endobj 1489 0 obj <>endobj 1490 0 obj <>endobj 1491 0 obj <>endobj 1492 0 obj <>endobj 1493 0 obj <>endobj 1494 0 obj <>endobj 1495 0 obj <>endobj 1496 0 obj <>endobj 1497 0 obj <>endobj 1498 0 obj <>endobj 1499 0 obj <>endobj 1500 0 obj <>endobj 1501 0 obj <>endobj 1502 0 obj <>endobj 1503 0 obj <>endobj 1504 0 obj <>endobj 1505 0 obj <>endobj 1506 0 obj <>endobj 1507 0 obj <>endobj 1508 0 obj <>endobj 1509 0 obj <>endobj 1510 0 obj <>endobj 1511 0 obj <>endobj 1512 0 obj <>endobj 1513 0 obj <>endobj 1514 0 obj <>endobj 1515 0 obj <>endobj 1516 0 obj <>endobj 1517 0 obj <>endobj 1518 0 obj <>endobj 1519 0 obj <>endobj 1520 0 obj <>endobj 1521 0 obj <>endobj 1522 0 obj <>endobj 1523 0 obj <>endobj 1524 0 obj <>endobj 1525 0 obj <>endobj 1526 0 obj <>endobj 1527 0 obj <>endobj 1528 0 obj <>endobj 1529 0 obj <>endobj 1530 0 obj <>endobj 1531 0 obj <>endobj 1532 0 obj <>endobj 1533 0 obj <>endobj 1534 0 obj <>endobj 1535 0 obj <>endobj 1536 0 obj <>endobj 1537 0 obj <>endobj 1538 0 obj <>endobj 1539 0 obj <>endobj 1540 0 obj <>endobj 1541 0 obj <>endobj 1542 0 obj <>endobj 1543 0 obj <>endobj 1544 0 obj <>endobj 1545 0 obj <>endobj 1546 0 obj <>endobj 1547 0 obj <>endobj 1548 0 obj <>endobj 1549 0 obj <>endobj 1550 0 obj <>endobj 1551 0 obj <>endobj 1552 0 obj <>endobj 1553 0 obj <>endobj 1554 0 obj <>endobj 1555 0 obj <>endobj 1556 0 obj <>endobj 1557 0 obj <>endobj 1558 0 obj <>endobj 1559 0 obj <>endobj 1560 0 obj <>endobj 1561 0 obj <>endobj 1562 0 obj <>endobj 1563 0 obj <>endobj 1564 0 obj <>endobj 1565 0 obj <>endobj 1566 0 obj <>endobj 1567 0 obj <>endobj 1568 0 obj <>endobj 1569 0 obj <>endobj 1570 0 obj <>endobj 1571 0 obj <>endobj 1572 0 obj <>endobj 1573 0 obj <>endobj 1574 0 obj <>endobj 1575 0 obj <>endobj 1576 0 obj <>endobj 1577 0 obj <>endobj 1578 0 obj <>endobj 1579 0 obj <>endobj 1580 0 obj <>endobj 1581 0 obj <>endobj 1582 0 obj <>endobj 1583 0 obj <>endobj 1584 0 obj <>endobj 1585 0 obj <>endobj 1586 0 obj <>endobj 1587 0 obj <>endobj 1588 0 obj <>endobj 1589 0 obj <>endobj 1590 0 obj <>endobj 1591 0 obj <>endobj 1592 0 obj <>endobj 1593 0 obj <>endobj 1594 0 obj <>endobj 1595 0 obj <>endobj 1596 0 obj <>endobj 1597 0 obj <>endobj 1598 0 obj <>endobj 1599 0 obj <>endobj 1600 0 obj <>endobj 1601 0 obj <>endobj 1602 0 obj <>endobj 1603 0 obj <>endobj 1604 0 obj <>endobj 1605 0 obj <>endobj 1606 0 obj <>endobj 1607 0 obj <>endobj 1608 0 obj <>endobj 1609 0 obj <>endobj 1610 0 obj <>endobj 1611 0 obj <>endobj 1612 0 obj <>endobj 1613 0 obj <>endobj 1614 0 obj <>endobj 1615 0 obj <>endobj 1616 0 obj <>endobj 1617 0 obj <>endobj 1618 0 obj <>endobj 1619 0 obj <>endobj 1620 0 obj <>endobj 1621 0 obj <>endobj 1622 0 obj <>endobj 1623 0 obj <>endobj 1624 0 obj <>endobj 1625 0 obj <>endobj 1626 0 obj <>endobj 1627 0 obj <>endobj 1628 0 obj <>endobj 1629 0 obj <>endobj 1630 0 obj <>endobj 1631 0 obj <>endobj 1632 0 obj <>endobj 1633 0 obj <>endobj 1634 0 obj <>endobj 1635 0 obj <>endobj 1636 0 obj <>endobj 1637 0 obj <>endobj 1638 0 obj <>endobj 1639 0 obj <>endobj 1640 0 obj <>endobj 1641 0 obj <>endobj 1642 0 obj <>endobj 1643 0 obj <>endobj 1644 0 obj <>endobj 1645 0 obj <>endobj 1646 0 obj <>endobj 1647 0 obj <>endobj 1648 0 obj <>endobj 1649 0 obj <>endobj 1650 0 obj <>endobj 1651 0 obj <>endobj 1652 0 obj <>endobj 1653 0 obj <>endobj 1654 0 obj <>endobj 1655 0 obj <>endobj 1656 0 obj <>endobj 1657 0 obj <>endobj 1658 0 obj <>endobj 1659 0 obj <>endobj 1660 0 obj <>endobj 1661 0 obj <>endobj 1662 0 obj <>endobj 1663 0 obj <>endobj 1664 0 obj <>endobj 1665 0 obj <>endobj 1666 0 obj <>endobj 1667 0 obj <>endobj 1668 0 obj <>endobj 1669 0 obj <>endobj 1670 0 obj <>endobj 1671 0 obj <>endobj 1672 0 obj <>endobj 1673 0 obj <>endobj 1674 0 obj <>endobj 1675 0 obj <>endobj 1676 0 obj <>endobj 1677 0 obj <>endobj 1678 0 obj <>endobj 1679 0 obj <>endobj 1680 0 obj <>endobj 1681 0 obj <>endobj 1682 0 obj <>endobj 1683 0 obj <>endobj 1684 0 obj <>endobj 1685 0 obj <>endobj 1686 0 obj <>endobj 1687 0 obj <>endobj 1688 0 obj <>endobj 1689 0 obj <>endobj 1690 0 obj <>endobj 1691 0 obj <>endobj 1692 0 obj <>endobj 1693 0 obj <>endobj 1694 0 obj <>endobj 1695 0 obj <>endobj 1696 0 obj <>endobj 1697 0 obj <>endobj 1698 0 obj <>endobj 1699 0 obj <>endobj 1700 0 obj <>endobj 1701 0 obj <>endobj 1702 0 obj <>endobj 1703 0 obj <>endobj 1704 0 obj <>endobj 1705 0 obj <>endobj 1706 0 obj <>endobj 1707 0 obj <>endobj 1708 0 obj <>endobj 1709 0 obj <>endobj 1710 0 obj <>endobj 1711 0 obj <>endobj 1712 0 obj <>endobj 1713 0 obj <>endobj 1714 0 obj <>endobj 1715 0 obj <>endobj 1716 0 obj <>endobj 1717 0 obj <>endobj 1718 0 obj <>endobj 1719 0 obj <>endobj 1720 0 obj <>endobj 1721 0 obj <> endobj 1722 0 obj <> endobj 1726 0 obj <>endobj 1727 0 obj <>endobj 1728 0 obj <>endobj 1729 0 obj <>endobj 1730 0 obj <>endobj 1731 0 obj <>endobj 1732 0 obj <>endobj 1733 0 obj <>endobj 1734 0 obj <>endobj 1735 0 obj <>endobj 1736 0 obj <>endobj 1737 0 obj <>endobj 1738 0 obj <>endobj 1739 0 obj <>endobj 1740 0 obj <>endobj 1741 0 obj <>endobj 1742 0 obj <>endobj 1743 0 obj <>endobj 1744 0 obj <> endobj 1745 0 obj <> endobj 1749 0 obj <> endobj 1750 0 obj <> endobj 1754 0 obj <> endobj 1755 0 obj <> endobj 1759 0 obj <> endobj 1760 0 obj <> endobj 1764 0 obj <> endobj 1765 0 obj <> endobj 1769 0 obj <> endobj 1770 0 obj <> endobj 1774 0 obj <> endobj 1775 0 obj <> endobj 1779 0 obj <> endobj 1780 0 obj <> endobj 1784 0 obj <> endobj 1785 0 obj <> endobj 1789 0 obj <> endobj 1790 0 obj <> endobj 1794 0 obj <> endobj 1795 0 obj <> endobj 1799 0 obj <> endobj 1800 0 obj <> endobj 183 0 obj <> endobj 154 0 obj <> endobj 1810 0 obj <> endobj 141 0 obj <> endobj 1811 0 obj <> endobj 139 0 obj <> endobj 137 0 obj <> endobj 1812 0 obj <> endobj 760 0 obj <> endobj 1813 0 obj <> endobj 468 0 obj <> endobj 376 0 obj <> endobj 1814 0 obj <> endobj 319 0 obj <> endobj 1815 0 obj <> endobj 184 0 obj <> endobj 1801 0 obj <>stream xœµWixSÕÖ>!äpÀRÆ`£Ü¤¨Œ‚-“Ì"™ ”y¨ØRJK[Z:%h›f>'ë$Mç–Žé@iZ ´– ˆ\P&µàÀ¤(ŠzTÜ'ìÜû|;MEïsïç§?¾'OŸNgŸõ®µÞµÞw‹¨Þ½(‘HÔ'`ùšeýÝ?Žž Ã{ ¶>BN­¼ÄàÕ»i¸ôþ`t~Ê€6 ¤Ä"Q¼JŸž½=Jé;&|¬ïÄ3¦÷äï?Ãw^\DRtxØNßåaʨˆ¸0%ù%ÖwM|xt„2ÝwÌì(¥2a¦Ÿ_jjê aqÉ/Ä'miìxßÔhe”ïêˆäˆ¤”ˆm¾ ãw*}W„ÅEøzнàù— RF$ù.ß‘´“¢¨‘ó6Îß¼à•…‹/ \¶|EÐÊÕkÖ®[¿aÒä)S_œ6}Æ„üü'RÔ3Ô êYj&õ5‹I¢FSc¨±Ô8j<5zò£ü©‰Ôdj 5•z‘šFM§†PC))5Œz’ò¡dÔS”75€H ¢S£HÕ¨ÞT•ˆë%ïuZ¼EüFÏHÖÑ }§ÏkÌD¦¶oL¿~ývôž8ë¥î/ê¿Û{°÷½1é9ƒF z}ð°Á¥CÆ™?d˲¡’¡ÑëíÔ‚mrKªEÍÎ…b¡Ø¹DÊV™swA&˜Lº]øŒë>ª°¨ÄÅÀiÌ9œ†©á_·´C5\äÍǼžÍk’hWåv€¥´AQÝV÷fy#ƒ€ÞƒÇò,¯VIr³ŽÍ2k™Vë%8‡à°¹ƒ#gùBk_À좀+2ìcp '=¯J°ŠîFæ9DuÎ2±) “¢9èÕŠêö#?€Ìæl7‡q1›!ÜJ^eJ–7p²½5 t 6´ü žã3­Ö—€,2(k¬8ÄÛ>ÛÙØ °Œßf!gÍZNÇ”Óç¡D_žÆõ>8Cè†@m(ÈzòÞÏwXZ Ž@;Û·Š.½2°òE¥åh!ŠôA}pvž80Ë ')-ÄÜóæVëG$í=pÎÜæNÛRÄ[Š˜ :2ó3›oçFÒ„‹vÔæ 7î‰Ñ8ç\©1¶ öB¹YfgË9PžÓšu“]vS2«Ž3¦±Ñ ÆXáiF¢‡÷¾š}rJ¡â~Õ·ÀW̧sßÃÞrœ»¤ÈbÛËò¢ï”¿´}ÆÜWÇà/¥ñiPc‹u·â0ª— åôƒŠIá~óýpoÅãú#/g¼Ø¹AøLzøÌɼ6wýb¹psÄÁ*K"Oò1ÆJZË3Ó²´9z­Gb;†JÁ¼¬ñ(4ÈI»¢Øy±°œ´t¹ ŦÝÑ24›åÇeføÉ85«J3ªŒ±ãNl?áJù\‚ýîzÛñ„’©™Ê¢Î…(oB³lîÚEªÎ &uOì´;—J Vƒ‰åXNΙY#Ç­[î£ÓÙ äÃëóCN­®oÅaxNÇH†½ÐÔOºo¾­¸}£äðL‘ž7²:Ðrr}Ü®y ‚‚6®ÎØÌDìu -)4ëk4Pqô—§¿yÆëÌäy¯)€<µȵ2Þ‚}¿¢ÓÂÏbç³Î§¥Å¥îÿ0ÅH•»VÓÁX%©§hÔ¥£è)ò&?Ú¥v=ÒiLFPËrlP#BéwQµ$‰ŽÅÏFNÄËîid2r=qNýNŒÆþ®P4ZC˜ˆv¢É£Ñì¯ÀËI=ô`îÐw¾_‹ý2LxñœŠ­kÖfýG¼³ Oßq –}¢çt±3K“èõx^ð:<‘`ö»‡ß@U’[ô{Mêõ©l&›¡¨§;Q%É$ëùø”)ÀL¦Û‘ÑÖlË;Bx9ˆFò½aX” éf5y²©$®whÂ+;}¾DŸÂÇi“\{;8õL©èž™>"Õð% Ž8Ða7¨qbÔŒ®JoÒšÔÒÙ 6ýqàLÿÔD?`¦Ñ¨à×À þV:"Ò~‹{øâº©n½JXy¾„ƒ^JvгÕvI»œÔ¨^å@Yad%W¢i^«Ív<Ûî5n«y;ÄC)°R,¤1úr…^űéœFaJÐ…²媗£€™€ûŸA‹ò½üzBqöóoÞøŒ…y÷92ÁÊ>|N>ä÷Ðí0ªó馾٬Α/›Û|ØdxÞ‚7áT¼Iñ@4ëæõ}Ç÷+ŠUÍáÅäX­åŒGÎ:Ð>©àA±3Tx(µ5ç_ÆNwÏîËdv·Alw¯Úž]^C_,Ò§tSMÓ%øi©Öæ°”ÜÙŸšÐ…(Åû¾h= Ìg÷ƒðü™ÉøÉ•~ŠÀq³¶.Æ£Ð9âpþ F-è)šE£§ÐÐïP¯Oç]ÇO+ðOÿ­©™×·„ý¿*Úôõwæd±ÑšmД鋣üIŇÅPªìÎ[vt‚À1~÷Å‚}+½kx¾cníÂÃåø‚;Ü ù"ù= "2Ô‡FðÓÁ˜³Laˆàt°‹™zeG×­ú¥6S¾NcÖ«Yyö†èèh`BÙ×?©ãk¡NALf]RkZ}Tur3¦TŠEDÂvçÖðEÕ¹²BK31ßÌG¿cŸ™kp…·p‚x ÿFRt¡ü.±ðy 2˜¹­1w d0³û5å¢Ks+¡D^Lœ{ŽÙ˜ÁÊ£q§%––•¬Æ‚|ž/*>cWvnþ…è“Ð@Ô¯š;qXwpGAÐîˆ"ŸT[L¡ÞS»Ž3Wº®ÜBâ7çŽÈ0—À.¹t%Vo±Ê‰s‡€ˆØé/r‰èxR,´4B%Q¹¾û3F'pÉl"Qæ*·2#zu·c:„üŠÚÐØ µg®ál,q†:ç©ñ1î`³GAzToé„z}φð:ëÞ»ô‹» ì<äZŠÝ—ÔíI"Ôs¿;ƒ…+ÒÇÁm6Gƒ-qÿ11«ðÝdr³Ïzdá~Uȧʬ•Š÷„±¿ßÿ÷Æ^î’°é 92<ôÞtÄ aˆFý´FîVãA€ un;É÷¶·ïk8½w ¬¶$÷xïe‰ŽÓe*ðnWН@îRf+äÊšÏB½Çz/ H6Áz‹Òsâ}R¹Â­2$uý’›jewƒ¬,¹…Ä <*é‰;äQšø‘N¸!-©«9t•ï¹±D°ë‰‹Ž„e–tÞsç2ñ¤²2ó)=IUËêZœæ ÷yIÈàŠÁJüÿ¾s°GÞ£Qì+H4láC=w€3PÌì’åêJƒ–¼ÙhÈÁa®ÉäxÙd°ýññ P ù!²ï]?Z2-ºR‘+G‘­Y›ÏuXÓxÃã?7ÎÂôóÏ÷Ivâ-·ÅBšOŒÓ§fe˜L&³ÑÌÂ6œ,‰´».w8yä ð5ƒÄ“NLÀÃgâÁKÂ[ÅMMuö¤WÄÈÂ$o¹ðî3À|ܲfÑü˜™x(öRà¼Y£1fC–LèC“تÆO=W‹úÝ?[/Bþ?¡¡d v¢ÛÒjh„º•ªüxØÁŒ ÆýÇFÍ)9Ÿ ïÔ·´Â~¦6³.*}³fñ‹Ÿ®¿ƒäˆB’Ÿ/o¸0¥J޼¼ùN2疞͛º2­$¹¥½ª¥þP8dËž¾–[LgkòšdÍâðõŠˆQ\(›FR4p3k£É‡*¹».ô”C«ÖŠ¥ÓWj)$Õ·2d rÌæ¬¹Ë˵Y›ÃfB¦ UÒ&¥ú%N¯OÙeX Lš{¶YÿN¶Vœ cöÛ 7^¡Î³ç–ß¶”(~pÅhZ+ô•.wõ•`ÎSÔë.ZfGO~V\-úøJùLŒR…³Òê=\µûrõåí²B=Ïq˜´Š©›õÛÿÂòBªÕ6Žl%p:.k>æÓ½¤L ÙzÅù¼¥ _ÞÚq|ÏI`Ž8Â_IÕá>‘ŠÄׂ#×ÁjÚ—sÍÆšmÀ¼^ÞZS­¶ïX™“Î.ú ER2‰£ïݳ1$}G¤¢¥ðŒýæ7mõ¢›W‘• \‰>—_Ü}ûï—[¹HÔù©|;Ës`fg²2.¹*Ón; Þ_S»ÄËñL|üùf<ÉÞ9VóÖÛŠóç*>†3̇¯þ„½n^¿U)?‡¯Iþ±ÂÍ]ŠòÖö>"K¾léVe6¤0äD¾<Ü,VÕ®”T‹ÐSBˆXø„¬Íü‚¼|¨f°žÆƒùÒ*E½o%{²éëB¾ÄRk=M¤”¡ô–MófFn^5oÇ UhÈø¬É aÒKSßÈk·çÊ+îîE7¾íŽÐèP/ºp¬õ8jè#úJ™G,<„ñÿ|Õ²ò™{¨ßM«äšvѵÐÛ—ÅB°Qz+ Á¾xxîž*{Q‰gÀRfY‹&\ÿü Ô÷„ü$z¢Í‚7¹6Jc+PïKí¨²ùEÛíó¥{ÙsI%ó·b6ñ%E8–¼¢Žï&QáŽÎjÑwèS±0Ò9ä×é/Õ‚Z¾ p"©µÇ‹6À18Ý0ÅUåcŒå²'ëqd·Èè·Ã­» ÅÑsr߉Uv! í,γÓxkIG¿kOÈûõžVíÕ×^èåEQÿ+ïÆ endstream endobj 155 0 obj <> endobj 1802 0 obj <>stream xœ¥X T×¶­¶¡ª4ˆJ["jªqQ‰8c∉℠-‚‚ „yIE&é>ÝL‚€"3Š ´ŒB‰cœMLbt%/yF“˜Ä$† §È%ÿÿÛ3¬ä­ÿ×ú«TCÝ®{Ï=ûì½ÏU0fý…BÁ-\ê²vª“飽¯ÿþýßà8 yÀ½PlÑÏ"ÌâÝS,YˈA£…38vpýÏ!?XmU½ òÊ Íú«°gØÀaÙÖc¬gZ—X.gZvwƒ„v’¼¸LÑÒ}X)‡vÏ’kvC„ÁÞÔ´x¢ïùvxzRfê<àc5l£þ”¡šà-8‘yÚb¬Äig@‘>«@¯WŸÆæXÎ^!væ“éÀ¬¯  šá4ôœÈ‘/å`YRgNâXËn+:ï³ F+dé勬µª~rÍMÃÑ_14Òy.kèL_wÃ;¯/'’ÊRÈý¸¦É~’—çÚQuŽÌO5×pªöky௶ì¾L§l7b‰d…öhçq áÐÞZ%cü‚€%¸˜{vhöƹ–NT#› Súö¸Ï1ãCâ,ö¸iéy̪~$ŒFögñÕO}óµóMòB¾Ú™Üˆ¶£[÷=æ« ™ß d('ZÊwÒ›e•QQC1‡*å& pÄ”gd&yÅi<±!ƒÙãk8ûÓg8H$ûˆ‡@T€Ì§íp¦ä¸ºôDky'´BkbEPù6X ø@¢-»o'Kò/’â:Ê™Êî¼î©B)äǧhµi©â+–ž~ý;Øq$Äø!½£—£9B®,MŸ°+tê42‚ \fs`f•÷UÍÅÝ÷à3x+ ™ëï¼ýΧûÏÒÕÀWó*ˆ*+N¯­¾Fo¨¡{jE¼$m”¶4[ýD˜ƒC­Ua8þK€R½¾¸¸¹ålnð7ßZF¬ÈhWïÅ;5pÞG\z(å瘵ÜÓˆ0؄~ÆQVH7ž£ôþ'r“ßæpèšk.qKÓ I­j—)E/ùYk½\æfVŸñË¿<ÙÉÙ~󭨊«;Ðñ€nÓë¿ý%¶šbc%v3]ÿFz9Àæ¾õ³tý¬†k¡kì ×7ÐÒ·F–³”»ö–˃%E|F)gÉBnqvÞ à%.Rª‹„Hð1ÄêMoáJk3Su:íÞ5áIQaùy‰Ý®ªÓQ•ô1lîvƒÃ…=…‘EP6%PUPN×ùVº1DÂåGÑÑhUýçâœaÚŽXyÀ}áMØøƒxŠ-+„ªÊ]°K½LO¿[ÉSÐ<^ô6qð$–{§ojˆ;\W_Þz4®$Ó É­×¯ÁožzÅå¢L’—BƘ„ƒãßU±‚ÔRÑÊ'àTa27iʮȵ[N"ƒÓŠOgQê¢Àè’ò%~‹:ûã°¢âܼÁ†"_ë­Ë q¯3„õÅ] …Ú´½é Ý»w¦ãpäÌ›%6Bç¡ †`÷öÞa·9t"ÄšØ'İ¡œe8«Ïj¸¤-ëei.>.'Wú¼}ꧨÀ~d˜¹¿†­Ñ_5ƒzh×뵨8!åò‹F\yá5IÂíòx;þPuÏS‰ë|Ë\Õ™º¯sÍã‘èÐÕ«Ž_’ñ´š\`]hÔ>—\0›;ÜpªöUK ]5°:Â_ºycr0¸‚ÿù=(Sºÿ&¼B9Òº—çSÝÈ4âü8ª#%vS&QÀzØv­ù– NDc”/ѽE®OyÅY}xŠÒ†üO†vØ­Û»G§SŽR +ÿž–÷ŒŽÞ³!Ø}Øì­>5+?»²øcQUÛÂBãü×J›¯Ü¿tíâašÛ}Ôb jV4R‹á‚C”Ø#Oâµ±Â?ÇÐCÂç®$î è´<±ùr2¾„/E>¯x'ì‰×iweˆâÖRaSÚw¼8 …†’ÌÌ"5}?4ËfÔÂÈ.Jy ÍǾýäóå;!^ìQ²»ÉBs‰Ííª3vÿo–Ô÷0)É …›˜"(åÁì!ô1×°)v‰ËÈpàÙ¾lK²²7Û¦uç˜*#I~¹MXÏá’߉BþñÏ™'Þœª³iwîö‘ÄnÌt2š ÿb2N Y¿ §ªêªy¼nF²¸]ñ›WSÏJ,Þ:çkšÔµ­RA\„æàŠP¾—%û’~NÞ{N‰ç»…äB>–~)Þ”Ú+,Äèta™Q™Zš>Ò¤•©÷h…³¿ñH$ úxCh–Žê/—qrFÏÇ»õºƒ`sò+Õò=*ôú#YUY8|µ‰€=©Àø÷o$UÍ‚Ý!mm¦^1|ScøjŸcLýJ)o¦†±¢×¥ß]wZ½ÕèuÈ®sÆŒqdñÝDtÆim?•ŠƒŒmFbº:vƒgðb:b´mΨ™šô­åÇjš› kûƒXëƒ(ðHnéf[zÝãtTv7ã¾IÆSkI≚L [É´%cq& ˆãÑOì1#W…àrdóÛ¯¥Þ†‡p#ëß'ßm¹z³ú2õ)ï…5¿Ñ¸${.¸ƒëÞi~n>.®1k¨¡ÂzÙà Ê;Ìc¤Äþò a¾æérÓ°w:]ÈIdà3û}_“Ú<1)95âx߆¸š£õå-­ísãGÌ©>Lß¿¯;+äz¶"¥W–r‡ÎÚo¿ɫêçç¥Ëþƒ|ÑïÈìÄ‘,N„y Á\2‰VÀ²Ñˆ“¿¾mÄè«ú/]Q‰‹P \Z«~NÆ}è)L‡›íípóÑ#xÝÇ^Ÿ®&–{„ލ3ÚjÊ?ã.<¸%EK:¨>z°Ü°_¯ÍЦ@:Y_SSRZU™Ð°1I“´IŒ/ô+_@“7nõ×Íe›ë©îf‚ҷǎ€¤ìõÍÁ»2]bÁƒ_{a>jÐõÁå[GS¯¿~\\ud9L‚ª€úMyÉp ²äî㯑5”ëÙ:4‡¥þkÈ0b±¾£ãÊu(V÷vb}5¨x®ÖJ*¦ÍÈÿ§ [»rK´ˆ_ý¹r-»»’‘Ö±®·…)8Ñ??m­JD#þ*`àÐÙ0gÙ*x…ÌRã¤Xù£gÞ†wøg¤ß'd…Ø3ø÷äiòhWD“g|îKê8Õii1õ´uÛꃨos7`ý­m'c®í¥mÆÏEŸ¬ t«Û³K§ÎЄƄÀrH¹ÑªÝŸúž.gç­Õu¾)Xïôö§ÑÉêÕ·ÈX«ž`´ì%S@—7èuúNC+…3Zcï,åTÏ ä›ÂÉÀã~¾AA¾¾ Am­Æã')@­h¯ö_mV7Ú}žâ{Oç¶[«îÊvò4Œ¯Û’¿ê8\µi;rí»Ÿm#£*Åì(Ð>·Í¸¤×FR²'YôÙ´²cq>Z2yá¤1‹m,Qw®?ž†Š(^õäõ ±’ª) ø ncç‘Éeè*êANÌs ½¸×Bç yûÄŽŽwÖ?Ioœu ÍŸ©Uw•¯~äTJù¡…bãÁ%E«„i´¢R©4FwÏ~ufcI:¥û|4/øÇ¿çqÔ°ç³h=\¦½ïK‰£üàÇBÁk„55¦•S°ñÈ(1º{±ðgY?Mw´^Ê`ªÉíñß›<Ï¿øõýX«:ÿ·#ƒO;¯¯Ø1÷?õÿ0¤ëZÛ2ÎÉ{ÝÆqÇ“)Y0<}‚=xÚåþ~ÄÐÙðQfÕ©åݬ¤¨e­üå¼L„ܽ¡.«ÌPMf \¤õX ½ìÏUÃ)¨M&ó{V '®²ù×&…p¤&ÜfCP\Ëh2ŠüøŸŸcÚ¯ŠÜÄì=Õ`S Ù¹ÑEöŽ.=^ù/õ£w€:Ћ8ºQR\Äq膢R.ÆHêv2w¤,Ù™–œ>)õسRÓÙ¶öcÈ~rC‚¯x䯾O¥v ãÒ©+N%UÕ7Wœ>ëw0)[¬­jÜoþa‡û|·w×Ej²‘øíÚM•‡M¼¼€ŠÙä6JÅhÞt_ll²:…Žd åc_¤wGk­ÚñGá½ò»á!Þ5:Ï s–¼æ[ÞØ^]âÒšý{õbÑ“ûê€ÿ8kÉö]:b=6]½Y«Õeèöè´{(‰ªz’ã àx’¥¬ÃZ Œá}tƒúX~u5´ðíÁu›ü‚Â×N}ºt¿ûÝç".„>¤Å×»/*$ÙµLw©{’W¢“ðTš(ÏbksÂbuº¤Ý"ù¾ç s ¶135>Ÿ÷žp}úÇ K¿D€EÀëæ½q_¥7Îø¶ºˆ#^9‡Ûq • ºáäf?!B½2ƒ5"çŽdì×§a÷šWçi÷ïÎÔÁÞdµgŒWº/̯҈üê22ß É‰jÒN­Ç®Š"Cö¾<±©ã|¥¶Ç0ý5µê°'Q9ýD£¡¶ŠÆ~Î÷@T’wʲ—¼ŒƒEÕÏ8ã›ÏÐRÝ»Bì2žÂÁ5¦´ˆ¸ ‡Øâ(kUzàWB)È–·å¨’ίR-9žY˜!ü¶Ê°¦¦ªšÆk~×MМåLrDÕ/0;ÿµ7iÞQ·h(ê¯ÿ…#ÐÖî.¨VõÄÀ*ð›ÇÿH® ÞÞ”z0±îÂ!‡œ—.|óíí`é¤,¹\ÎÅ!ŠÒ¿Lyh—ŸûÁ@M/ñe£ØçìÌŽÍÖåk x Dò( |PT”mØŸû”Ðiç°«O"f ÉH l\߂܃RÎ;b§²NåIù7Ë/7´ð½ÁËѸ®¹‡%÷Ö<4_l£„Äü°8Îßú,¯ù“Ó›Ý×GlÛ*žŒnëNÂ%þ{§vµëìI›y<Ø$ªÏܺÉsÁŠef-…ÖŒa?dfJëˆdž»Ð/…_xódä‰XØÀÏtLôtð<óàÁ¹¶†²Þ`ÛÊqH§2%`”-­Íåø¢ "#ð¢ÃKÊŠ¤m þ¾>n†²Â¬ÅÐÎ>âïà~Æ“ºa8õ̧ ¸ XHö1^%#ˆøí|DÓÝR^ã-ž(7 “áÞwßÀ‡?_®ôÚ“­.Ü+aï1~&]K3 Ó­r<€ƒëŒV7pÈnt²“n›ú/B­”Q€®'W+Ê O†ë< Ä ¶õr%N$V××U´H¾EZ½XSÚRØüzͦÔÄ;ÔK‡Í…Å|•U[%ª~:OÜ„¶ ßçòØÖÐÐ&ö wIš‹7PUj4Œá´kRÞÓ²(ªr!HMÞý'…'qdQ:íŸt µQ}Lì¿a?y·ñ‹ÚòŒ]•bBzxláýk#Œ'j«[ÎnºAú‘Ádœ?é/Úÿæ>ÿþJì¢Ü¥B—§Š"¼¤ÄÛè"<%—&öšQþܨh§F1Ît˜[ƒw„§:L%é$]GR&èI"¦cš¾I‘„@XU±ënÊYø.Àx{ßÙÂÇ· ªà´Ä•n*Ù £a­§4ï/yì >B’Ó¥“”vã Jü¹[)T@AD²ÒRĹžã€ö);4eìA¸ ¿\Ê÷µ†;™õtÒë§çgy¶œeò~yE>ú”ìgÉÆ> endobj 1803 0 obj <>stream xœµz xSå¶ö.¡Ù[„"[ZÁ&™çAAdÊL)-¡-éܦCša%é<ih:–¶Ð–IhA&9"‚"Š‚pEQ\»~ÕóI[ôÞë9žÿ<÷>}ž@’=|k­÷}×»¾;¦gÆÎÎNº`åÚI­ÿ.°ö_’xÃ/Êöd{è-Þ=÷œxÅQ ì‡Í}qÃsŒÄÎnwXò‚ àèо~áƒFzŽ4iæÌécMž8qæ yÞ¡;==vZéîçèNß r òÜé=häl¿ððàY&DFFŽ÷ êûÚ¨±ƒ"w†û ZëæºÇÛkТ ÝáƒÞôôd[ÜxÛë‚ ÀàˆpïÐA+ƒ¼¼Cw3 ã:o÷¦ùA›oYòF袰ÅáK"–îYé±xÆÌ¡³†½úòð9#\GÎõúè­czí³m\ìø î'=ëЗa†0«˜™ÌPf53‹Ƭa^e^fÖ2Ãf³ŽɬgF1˜ÑÌFf ³‰™ÏŒe63 ˜qÌf!3žÙʼÁL`1™ÅÌ$f 3™YÊLa–1S™åÌ4fó ³’™Î¼ÉÌ`dÌó ϼÀD2ý'¦ã̼Èôd0öÌ@FʰŒÀpÌNæfÓ‹Ì<ËÌfz3Lf7óãÀ1}™ç˜yL?ÆÑ®—ݳv½™m´®ô:»íôðëñžd‹ä£ž;{ž¶c_/*Íe¥l ·‘+}fþ3ÏüÜ+°×¥g5½Gö¾ÝÇè0Ê!¹¯s_Åsž ï×£Ÿ¾Ÿè¸Ü±E6äù>ÏŸãW¼Ðë¯þ/õWôÿÉ)ÏYæ¼Úù3¬pf ÷À¶—‚_j4Âwòò·m<|°ë—†Ä }c?lã0óËã_Ö —w1eÄÕGÎyÔ„Q—F}3šÍž2:`ôÑ1ÓÆ(Æ.·pü«¢Ú¡=,¸Ù".5ÚÕ¶Ï“ˆCÚWðiš¬Xˆµ2-žxv|í½É3n½– `÷êéÀmšZí‰ÞC-ìæPs¥A—«ÓËb{éI2N§Ò+AåèÁBÛ`øÀ!8ªmÑXO‰fWA|–¢Ž#&1—G{rÓžDHÄ6°ˆö-&Gìq½/÷—Áø'嬛–Ð ÕëZõUPIソóÞKpDŽ+دœ¾x!oýZÄÿÓc7B(h÷qè°4Ä—ì2®ùàê´’“Ýø‰%ƒö¬ìÈÙ©[䶬´ÛYì*Ú×JÄáâ <¾„ÛLµûkïêœ-¬—ÖU ž°< ôêl“Öá¤Ñ¤*ˆ”Ìq"<®×Ò²!ÝòM%‡tœ…õSÏo€•:½õ¬2öm(K- ÂÄâDf´øÈÀmÃÁ™¦L×¢¯ƒFxÔ¶ÕoÓÅTA)äÒ³òpú8ád’¢WT v†Äˆwkmê Wi¢[ž&:н'c…shßDk|É„-Ž(¿gÎÔ_&b¨ØƒG-[§Ï:&àsÒ‡õ¯lX¾e:‘È¿Jæ–]¾׸/&|J^:zTHoè¾òŽ Vö“¯Fñ𠔢ó½»ÿbæu"É—¯$ó¤ŸÔU“U'ÇJ\Í~×2~ÉÂ3‡ÉDµÂ,N4ÙU߯}·%¢?îâñùOHÒo4±#ýÿã|û|ÿ-ÊB\ywØ^|4ô0¼ pNU®:z¬¼ áˆJ÷JwXCSé ë#¶G¸mß½¸§ÃÏîHÄŸÅÏøÆwÎ¥×Í{€ÆSLó¾F¢³U«¹8*R¡LP)åd&)'Kñ­Ô\ÐC†s¹9ýˆ`a}i¡¼À¶éÏÓÛØ,/9a¿ø›Åî²Y\i–ˆ‡ÛòYyô«,®X ‘BÇ:©‚DØ›¥Yh¿ïΠ7›$ípî © ÐBŠsL” ¢‡´ö¡Ò"GVGfHÚÓ»Ê.Üe$õísù€ ¶«ÝHí!ÅÙ(àH\kÉœDæÊÉó¿âm`tRà‘ô]¸ѺðÐêœi0ˆ$j•ï–Èàµk†Sx‰]9mŽ4:î¿ÅT¡n‰Ï½Ã“Åÿ:‡â™Ö{¢½ìauÂŽ ¯ ÜÑäÒïápäh>€æC¦΀<Ì‚tPDXB¼°+póß¼‹,>ûÁíkŸ´LÝ@5i6eñy Öí·Ãwq‹ǘ f ¼ÉwÇyMÚ‚y4E¡d|ø|ò:M‘s!÷؇yþ¯ÈÍX*¦-LÂTi'õy)ŽƒªuÅDΙ¥Aaßq¾›ïâ€nY~réÉþ²ø*~Îc–È­8²©¥ìÈï"}PwL_ Mp šlœØÃÎÓä5Èq<•ƒ»eéA«ÔÚÈDá‚ÊãL¥æüÚÚ€wAvc>ø.‰w§DDÃgoÉ¡KV‡®Ù­ ‡0ئéì”Ú¼pˆ‚dJ¥x™d;‘žX«, ÀÕ;W„R ®@­‹&‚ÁShë•ìHWà0‚N™ñú´(€ôœô\ŠŠÜÓYì)î±Ø5cOuG‚oãH~Âf— ÊÅpÖWhËßWÙd ŠØ¿}Þ•Uw¸úÁõ<¹.›Þn?'®f› á½ãv·Ö•vç)àm ¼ýü¨<út†Uju±ÿÀ»|é KA½5¬Vì7}TgX ZS4}¯MZÂD’ã4kUùZ«¨:FzÝÚMš0„ÝÝQ5B±&7!C™˜5¤9EcZ>]Xz÷yPÁoç' _ïŽäg§ŒxCŠ5úÌŒÂï±ÁéÒ˜®°~ä\†Îܨ¦ ú›*ïMºÔäØrcë}œ~ù*5'ñÎG|ºg•Ç1àÊß)¼%?ê® U*v©ŽdèÊRËwзÑëàæâ­ÀÍ\äº4ÐSY]j¬ÌO«Û¦“WÕÏ£>èø¯ÉrVvèä&õê¯ï ÝÛ¹YC/ô&—àhSÙ1.gð#ر vºmÙQâí–Û83“R±ôwŠÃÄé<.ÁyÙÙ'[oYÝpˆÚŸÀÖÂÎn7œÉ›””’J.‘6'¼ò¿@È,rt"XJÊ3“s Ñ9ЋZ«íµÎõp Ëö²ëaOzàak˶¶.‹]¾¨“`&òû8^Qiih.:f…Eˆ&PB‹¼AŸÐ ‹rMvzb“Ò”+ç8Íù>Ùj 3¡¨(Çh;C»T {ÀUÜYä@§=¶ê;Â;#Ïn]³Z³Çjß+õ]%Ô@‹¦¢ÓDR  L5uï|øÑ§lEA,_rr\°Õ·ïÓÖ›¨m8¨Ý×@´>¼†³‰ ÅôPú´tÛ¸8jãúðøA—³ JÇ3«ÓeVãdÇËZ6_ÐmÖF}G¤T™ç€»kl45kÅ<î`¡ tyÅO¿]G !¤Â»r‡a-ìͪÝn{¼w­7ð­k¤þÍ¥´çØS-ö4ŠB§nmȘLJJ/ÇSû¾â®ÓgˆûØýPøµPg‘úª'ÒKzQ'õO*-–J­¶ÊÃTú™Aåè3‰8…Ò¶òB«®žªQ4¸ê#:ëcÑÇÐ1.I«IKN´ND‚&U®&²°²Ê„ÎÅüQÞ¢±úáè;§´„ø]Ê„ˆuA‹–CÖ¢J-éÙ&(æ*£ŠÃ##ÝZ|O\h>s¦BpWÓVw¿ÑluzïÇ›­ãÒ3¸›Ç韶œÌ¹ õ­v¨•À…”FVWKö½?÷àk¤ßÂçÙOäùïFR¸¾X‹½ss“@MT©v_–èœLÜ0åN“;ü2²‹WƒªÅŠ[T¶â“Mjº8ŽÌyêuÔl0¸³ µÇéXXÇ»ýå08V%t,*í‘‘Añ꜆ìô<Ô¶÷qÒu\‘v³ªÑð¾mVù4þ‘UbE73Éi€65šuœw¢³ø¼É®ÅŒïÒj¿(¾ÌçäY+Hh\¥Ž}uì™?”5bjz¤RRÛÑ'YHsŽÏ¢åÀÛÔ°¯¢n4™ôÚ³p4¨^ÒîŽélu—ŽŸ{›_Êâˆß{æqñÇ?Bœ°»Ü+×[¯1dá‰ìÛ‘hEöE8²ß\ËayOâÁR°h1[Ý"Ü­® ;Ò¬>CÍa£þ|Í‘r˺ST(Zâ,ny1tјV‹3«%×>™OÎ×ê¢è^ ¨‘Q[¤Ý«Öi!Šë(û‹J”°i:mºRÛñÐ)'Q§Í®²Êäâq¶ Ž=¦õÓnÑì‚]°Eï× êÇà,ï˜Ëvb.°ç›霜|)Ôºž˜Ágâ¨ÏÌû{œKxÉIòk¥&”·þ!e7aé'§˜{ñ§Ñt`p8‚’²Ü}Z²F™¢ü†M‚$Ø žûÂß‚KÐ@£.¨lŸ^iGÝãöÇ’vo¼Ï£;C‡Óed1G¦’ÔÖ'q.Ã18Ýò9ù’C^ü 1‡¿û ºäRòÒô r8†û°sÃ1tšXf©ÏÌ©d¿)ÆNx0à‡2tnÍ…á1Ÿ…½o2äêkÀÜ=ì©"// ›EFÊ%ð+n¾7¹oˆô32B ûôþ÷í¦nc”‰,+ûµ˜ÚÀú|!–À2ðlönö}[¹¸›%ŸVgB^‚’SiêúE‡ÂHið‰SôÅ-uëÊ蘱Ï6æcŸ'Ž×Ÿ¼q©¿ì¾!¾É“AÖßËQR6u§©VwJ_Au´¾;MKUå²ïÓÅ|mhyP@DpH°)ÄRm.¯¥­´-ÂÒ>±ÚñteÈE|ÿâš«øƒèÄ“ç-+‹¼NÁYçN½s_5‘n™‚N ʼ®¹·ÙÏT­61Uð[X³£y2<%Ó§ žqrþÍ`yžª5ñƒNö *u_jµOyH.•VnáæÓwÏÍ8¾AXsJ}QÛ ÍMu÷Ôîj›Ú³tú¼,tCÝIË΋¾wi{æ“o±‡\v-ýtº‘¦ä,µ&Å_Ša¶¬xÞoûiÙ%k1}¬ykÍË«ùĺ%O[ž!BQº±ª¸ÊhcPPtdÈÆÓAg®¿{ñ+jÚÇ÷¬ «Ø½;,l÷îŠ°ššŠŠê«}hÖg–ã¼F»3fßÅl³¤}|ûL¾¥Q¶ ±BœVT‡c ”Â2WS®„s;!~ˆà m6üGéßch¶a“…û­mb¬°4=ºŒ Šv’i¶ÝŽNWŒ!-vO.Iž<%JÝØMÚ&ÍïDyÌ^|ûÆàˆvŽŠQEÑãªuçôåÔÜÖhk:óð>Id¸ØI«Oˤ†1ýÊùÜì ­-úr«iÞ­N€ :¬ÔÇwv¼2m® 2>‘Žƒ‰ƒ“þ_™”LÓ¿Ói¶[¬N3–'CF¿:Ö•ô2ãZAì÷—ÓD– FŽÐK {ïJKƒr ‰Ã«l±6b_íVÍNðƒ­zß?4bÚí¨’H.Iðöeü}v û4Y'õf0ÓþßøU±®¼¼}0µ²í[%ívâ§|acUÍûº®=hë¬ñtºM[B}^ŠZ©Q’å{œˆ‹¨WÚFëš3`¶mC/¢¡m÷î¾g5³Þ×ñ‹SVT†ºJ@Ÿ‘QHûùµÿúìĶqüóñÉÿ–jÆ1/Ïíéc—[O»ï,ý/ù ,ý%LòË`šÀÒ3‡rZ‡@M€–Îã°¼;ÓwA(Õ)4£;v8‘©b‚6]“I§ø}g¡Ò–ÀÅ6t¸ëwtžsÊ!ß×ô†‘wÌ#ÓD…Ö@-šáŸÒÓò}е£ÝÉlH*ZŸ¬ôœ)f8ᬎÌÎ;?µNñpúé{‹ã‰ŸpûWNvƒò'¢pþ]qsh¹-+|Ñ"zíðØ ÙüTkS›'ì± Xm\-p²KÀº¼Þ,#Ä­¬2c“ÕÖ}Gr¾c' š-co {|‹+LØÿ¶ã‰ï¶Z0ê.5fâzÜÆã³3f«{¬Ÿ¯€Y£².µ–ª|ß¾*ÈTg¤j5 N“G&o‰\ž°-˵<Å ¡™æ’ %VN޳ÑR˜¥7d¦ yŧnA˜·eGûè½`3'û…*Ǫ00/ŸmÎkOÆœ3P0ÑÎUWb®¨ˆ1ïŠ÷KÝ6íòhì)—ýŒÜß Ìê&Eyùlüı{G˜®Y_úË~Ãqâþ|Øw¿èà’àcan&í…zNœâUþ© V¬”'&Òª¹Ô UFÞí°—€^øON³eN²÷öWM0÷Ðëþ²{ýeè„·ø –ŠçZ+Z”;MBœ'¸TÄ™Š÷å<¿ý­äy2€N_!rÙ/ĈÜÂ(ùúïô<ÙäoˆDu,ŸM‘[9|–\çW@àyeQô1øJ¹›µî…•¡Ô6Q²6Çø®ÚF§ Äåâ{7ìN›¿¾/ƒÅ'|Žuw­œ#*)qMªŒ •î";hK4ç\(ÈÏʼ ´žžREìlb±k°‹ÈáeZ@·£GáH®ÐÊÂÛ†·³O¥ï-¼sø]›Çyr«\Œ3:Þy²xŸ•›ãЛ?(ºÚ×—†„GïvlÕÅéRòÁ9 ºî ™ÈÿϾmÞßÎ` ÍÞ‰ðÃXy8ü„õ Ûtq¿mŸj?”pï¼×råêÅ Özm]å'˜âø·Á%îþä3GÌš7>ZïÖâ*ä%6†š©y¼f÷4—‘/þaÉOhÿõíŸG¼[„¨òØÜåMÜûΩŽ:o:Ï{}ãÌi Þ½}¶öâçÇ:WÒpÿ³½â0k!—ÝG¯{VHð ïÏ’„¡ÛÖĬ×ïg×”XŠ"b“½–œÚñ9òtTˆþ´Žh"ìû“×m‰vsv¸…{Àëé÷å(ì)È~~š[öžåÈs¯ñ±° .D7 8§àXycÕ‰õÔ{Ôí,qË÷O_Û¸;GO¡¶æÙPŽçšp|ž7Ún÷’ˆÅèÌc¸´° ŒÆ(ˆ“_)ýÞçJ‹:?Š—“©Ò›Ø¢Óò!Ý9/9G«NP¨…Yä´=YýÏ¿ —ÆGAddÉÑWêIÆÛ“¹Ò¸Î å8U:‡´h5êDP9+r’óŠ yáž¶ÇÕúˆßð¶µ­¶]͆ zbwç‰׉ÿäæŸx;QíRn¶ w ÷ØWet<½/°e”µRðývKñ"½C³FC,Ùºdv€­œuýꙻسŽíi“¿çs"­>‚VKfºNëÔ±þ×IÉ gEnrn®>=/[0‹ãùÈ¥8 _}¯ üdë¼!„Ù¸`£\\Õ1âO¿ |YÌ#»ú‹…ÿížÖÍñ‹8À‚Å&»–Û.à3ž¯–´¯À>¼zöò]n°6¶ú8z²éý£¼T^×j}4ëµJêæ§wo%5G…Ò@µjùºÑn‹Ý7$QûúÒvdOÿ#*Gco/\9oÝ`Ìõ“…‰£Ý¶…Ãz穟®øîós‡ê…˫ΞEã¾pF‡ëðÆf>øõY°pŸ5ÕÖŸ‡¡š¥³¦†…î¯ò&×¢ÀC+Ë‚66ú,_»25¸áOÝÚßpªÍº€ÎVêRÞŽ“´/ÀOø§ íøæw®‰_“ üS:wüýwÊQäOÿ®ßíɦ½ýeÿÀB1?á{Ý%C¡6¨³+Î+*ÈSeÇdËÉàK(¿T–“žùΊ¢ØT D…D2³_³/JÈMˆU$&$A!çîÅçi@ Î±Š¸EzJIŠ/%ò¥QɪTHtÖ@H€ƒ¾#¯ÙÇ$çåä&  1 VÙ64ý2¶É{5I0›ø¦Ñ¿Œ}ØD^ú-Ž¥™QŽGšð¨ÑN´o’ˆã0ƺ™\ø´×b´Ê"#!*^ u¤ŽÚJé;ie4Ú¿Z…øë«´—ÝRQ «ôþ…;¨òsCˆËPù¿úÒÉgM̓Ž^Ë©‚äj!Y›!W¢äþPøgiá§´'óä%χ¿í‰/Ið®:k—‡¥¬ÁUüYRº†µ‚9Ûd¢J"ª0›7u¨"X›Ýéô:'ÿÔúv‰Åi±¿D\FuFUm:^•”¤Èß›Ÿ–@颱¹ªÂôÜ\ƒ—OuüÃN©øÏÜj{MíN&»ƒ·1û¶DtÇ«<|’ö‰ßµmßÌ,ö€U0?dÇxÿEisàUx=}RóÜC³®FZmëG凿®½œq“ŽÃÄ—\å½`µ9úÅy¸çà"\Ê>U†Ï^Ï1C\Š.™ësa¼‹ËãÆ® tƒÎyVl´¦z|޳íÏó V.ŸÔ“Сõ´UrE¬¯:q’ào}îð4Ñ¿/ºž;ø³“ÔyTö?éT†ÉŽÂÉçÒƒ/$â:ëïdX e'½ûÖ±#úä¤Áo¿ËêíÞª4aw£KF0pc ·‘0ÿ.˜Ðç/¶P!x£=ûðÓ–÷ŽWGNв1šHëVžRZ•¬N€dHäËví>Ù„à~]1º´ U!þøÿ!^ê-ªتr–}Æü»b0e­g\´^ïaÜ Ü8ò U†; ¾ÿï–vÑîÑÏUÔ§U ^šä0ˆ„ˆüØÒ´î½·?Š‚M¾kùïëÂí?ê°>Â'pO³KÞàFé†Aÿ'ñ<¼Õò·’ýêØJ!I’ » .3Æ”¢¶îÌ*8ª%Ò­6&qA îÎË4IÉŽ|ÖÒëò³B¯žÓ½Ÿ1åôî}ÙØ»Ãü?Z+† endstream endobj 140 0 obj <> endobj 1804 0 obj <>stream xœuU P÷ßeávk€øÚ­Ý=ÓÄ 2 ÒHhÁƈ€£¨<Äã¡ÜÞqwÀP9Nàî¾;ò×ÝÇ*"(|!ÅWðQ_$¾&cR£¬6Íä¿dÉL˜¶3vvfgÿ3ûÍÿû½¾ÇÜÝ0Ç%áQ1A+¦¾–ð¿ÂùEnü¯ &^L¬ñO<Ý-¢NÏEæ9(ím´m6Fà8§. W(sTi)©éÒ$_iPhhˆ¿tÅòå¡Òµr™*-)‘“F%jReòDxH—nQ$¥É49Ò¥«R5åï³³³åê…*eµ¯¿4;M“*‘©eª,Ù^éÇ N#N”ˤÓÍL¿Ãre¦F¦’F)öÊT†as8…J˜%KÛ¶"øw¡˃0löGl ¶ Ãb±ìc, Áæaó1[ˆ½ÍÁæbsEؘ;fÀ¾Ã7ã¼[1›èr§Üw»ß÷XçqOâ'é–Ü 7’5¼Á›ï¿ÈŽ#l%üfTBà h×tq'wU¤È>ÔgS¦ï%¢޼Uy(–d\D0Ùf‚vpÁ´ÏyþÆEn<,Š&¸=|íZÝöhF8øÿÝ*0uPÞ|¾®™_aÇ;ÆPÇÁÇ£}4¢}¿(ÁÓ±0W˜ÿz’ Yã¯Ð\FØ'ÄÑÉ×ÀU˜.Ã)è«í§ûŽÃI8•ãÜÛ¹"!R!*c—bçn­ Ä+fÏÀüÇõè#”O÷>ÿ¢Ò¦2F_r ”×RÐ`·×:;”í +¹@mcB„DXø?P·[.A8á´L#É&ÃŒ5ݬ7ÿŽÎί´âGPÎóÑV(×éµ™…‡˜ôÖôŠý@ ^)¶@jO*Û¥8vèL᥂ZCk¶5¯6T‚jgð†=¯3™+˜MfcY €*€âVXDæ@qu¹ÙÜÔÈ”K}CÏ®!hê‡ #‡öuV±)ÊŠ Gäaup…êl:óW„W¤[³þ0”UåVvŠo;ʵµ>¹bÇûï =£cÍÿ²Ó¢4½ñ'S»âêâ ü4‚³å·8})Ƕœ´öuæ²,ˆM"…݆5!°šZõ­êêÞAS¶«3å4PM#uØáÌ-dŒZŸ/ƒ‹õLÄYÚ7l_BìžîAäƒVé¶0Þ|­`·Žñ.Üö€à}Ñ3Úyó3³ (Éóa?hÀ[,"½yÂX¥(4—èÞÊ}µÕA˜´;ã"3Œ± ™X3S2•ŵéÈwÒÍ'~1Kô¹r¥,¨t­X8^vÜ¡­ÍÉÍÒq²É‡ûÎ^oc½¢Á5ááÂëàï(wŸ>d3‰PB g—Ü-Õ%³“fR »ü§ý|Qôs;\ü—Ÿýá3'ËŸ6“¨èçYe¥újXP–òŠzT2áícž| I6è™lNÒby$&Áþí pCõ –o'O”Vßeì.!P’ &“^+p“7|¼ùõºf¤´¡ðé”è¯ü<”G7[ÀöæÓ—‚— ~O˜-øüÝè­„5U—éÅÅF6#äM"P‰KÚÑZÖFšmt% úÚÚ?B…°ØœFy#‡ªÍÇ~@aü$Ý–Õ¢ÈÈÌRÊZG§µ­™!šæÈÏ«ŠÄ$´þ' ƒ"Šc3D””ŸdywÒ{B•Õ4ñ® ·ND<âÓU­ý_šEy·°” ÆF«ó¦zdC‹ò…M“:aßX\°,pƒVQ_µq p¢ÂëA=Ss  > ýirÒ§<ßR\u`.=Ü85Làúé%u<ûí{Jð‘h)1äê·ê*Œ¹(g”ÄÙrõó6òGÒá ð7 ‘Ë¿µ~éÛû¡´©­¾«]kSÁd`l·†ÎŒõÕ…u+cׯld…8!ËCÍã¤x]–ó›Wè}òz~Óßz޶¿ P$è\S‰ )]9X™3’¯zþ°LøåúÔØ¡-78¶«Øe…nÊ•eW¨3òe+¾ ›îëço¾]{wY#ó¬uø|I= ñûíÚè°¤N}}“£¾£K]—Y4ÝQÏ­—PÔÑÑ<_­a —ÀÊãÓ JÓ4|b\|¼8Òoèç –¶Ay¾ÞõŒ04™âÁ¡†åd²Q6cćÓ&þ/#>ãZBnà½èI/¡deÏ“v~‰ï{‚Jž¼ê§…‚wc7©·•W1’ÃÆî 8A5çÙ22äfDK|†æ /´ÉQ³à~3Xpó |ŸA¯ï÷ ·3Âü•t$(ÏÚôÀ À0 ¶õYN×ü\;ª5öXX yTˆlY03eÓqüÙ¸ÈîYÚ©iRqÙ•¼UÛâlnjg¦Z´O,´ã}c¨R\"[Ñ=ž?NÛó4¼96Ã:.ùCE¤.  ü‡u¯;¹æ¶ú<ƒs\#Ý,¯`„„ûô~ˆ°j^pÆà/ðî7\n¼y¾ó´¸iF4¶jc`•èÃO`MA´Vp‹Ô¦Â í|¯«_d]q›@}4ÝælF­Ü‘üPÙçàR5i%S ƒ™tNâ´ŒÃQñùœÓ̧“Á†#âÉjâÃë‘¢º²I"$Ö®Y£o1³ÜCìž¿°WyzŽ6xzaØ?•G7° endstream endobj 138 0 obj <> endobj 1805 0 obj <>stream xœY XW¶®¶¡«DÄ-A“jÜqÇhÜ“(Š+ŠâŽKƒ ›ì²4{÷é›}§YD„VD¡QLhBbLLŒÑ™D>£c&hÌ)¼ÌÌ»$ñM’ùæÍw›è:]÷žsþóŸÿTË‹~ŒL&c\mžñŠôçq¤L|©Ÿø²HÖKa]I–`-k‹ã/ Ê¡¢ý,„[3r™,8"Å)xot¨Ÿo¸½Ã®‰ö3æÍ›3ÅþGÇyö ½CývyÙ»x„ûzz„ÓìÝ‚wùy‡GÛ;¼î¾wþôéQQQÓ<æ‡ú¼1qŠ}”_¸¯ý:ï0ïÐHo/{çà pûÕÞö½Ç›ÖûË)8poD¸w¨½K°—whÃ0 - vÚ»8dI¨sØÒðeË#£¾ëüÜÖûoظ镙³^=gî¼ù&ZO6ÝqƆͬaÆ0®ÌXf-3ŽYÇŒgܘ ÌzÆÙÀLd62“˜MÌff3…ÙÂ81S™­ÌbfãÎ,a¦3ÎŒ#³”™Á,c–33™Ì,æUf3›qaæ0«™¹Ì0æ†g^d†3¶Œ3‚ÉpLÆŠ dl˜AÌ`f3TfÅ,¢©`,˜Dæ¾l­¬¡ßä~åýžÈÝåÍ6>–œeå=…JaVˆìVöŸ\L¾£•­ÕF«kÞpÕz’uÉÀW–ÙXÙøÚ¼;(cÐOƒ 3D3äêÐð¡? 7,ý…ñ/tð3ùó/Ú½x|øŒáFÛ‘¶9¶Ûqv»íÞá<Â}Dìˆæ‘#Gz¼4@Ì°éº ft4‹+*d⎮y|J™æ@„‚&-%šèº²M‰MpFhF:D­RÔuP _@•æë1f6¼!8?3ôú¬|ÑŠˆ£åT•¢Aÿš ~€šÓ),¹-ÆòÈ‘fK§°é²³he’¡e¸erñvòßy¾Mú9¹ø¾å'h±Ÿ‚,H¶T±ç³ÁKI.9«Ø*ýe8D×Ïû;£‹ÌµŽ ÇŒao ¤ö÷LX›®ÔÍwLXe–á8„ÿƒ/Éw-âUO»ŒR‰›YœwýÎýïæ~Fæ*qlí¡ÐÆÝ›sÌÈò U¸œ}l\°e‰—é¯$É×<¾ƒî,ö/%ÌŽU~ó «´;SÅ&Y=ZcZËÅZ æqäô‡d™3k y‘ ¿7gàœÛq¨@ôd-O^ì£ Þ)oTVž8Yf†÷ qoip…lwn.Žð‚MWG‚7Uà #zšeçq”¨k‘w©»fñU!¼åävzYõB°#ÉdGvOœH&¢‘E´*MÕíW«!Q«L"S¿i¬€™enù6ùŸàûâ/ÚÎ]¸ú(ï4\èq˜,Ö'åBpU ¯VÒT‘fg‡7ÊžÐl¨wx”Læq½¢&¢5ôàð埾Æñ(L»CFºnŽòߥ<Ã’…¿d¯;ç·©q›ùc§;JŽ÷q§+±%ãœ6¯T©*Ûè–):Ð|ÅaâK4_M¿æk‹ëÑæqF’)8ˆ¸*‰ë߇óâœÄÞ†K~Ç6Õy–oÂé¿“ï6ßíËöÌÎF¼û«M4K u¥âF~·bã\ßö­ Ëi …1¯’ÑdÌ£ÙhÛÔžóö%Ùñ»¨ƒU¼Çë®ñ{€[¹¦Gâø?µu~yrþvzøHŠ·3–œ–Îo‹óh¶6JæŠH2q÷²8âˆ-Šûyžo*[ð°‡â-µÇdÁKÐQSÁ´¢˜ð\‹"Õ–Ý?R·ïRuY*lĽ5óäÉcääè…¼)gb!.1%¢9OSLM©´¹}Ó!÷×ýœ=âhÉdî¿VÑUêJ\‡êgfÑÙD\G_}GžIlÕµ€ï¾Ó»»¢N 8pÞîù±Ãº³ìýœ‹z=X”¼s²°ëpŒgBÍ¢"2z`#®I5‰ö‡eMŸbì§rq ø&_ÙûS5´_HÏHLIË.Ùmð.LòâhQŸ¦¬M3¥fÁ‰¤¡àÁ½á‘›W•<R+´ºà"!#\IXv¤g롤B8X~Ò÷](»³8¤íN‡˜¢Ê”žGü òVæ¯É‡ÓÜÇwÀˆrÃ’P½ ‹Ï‘Àm„Ì*¥Í3Ž—»YÚ[Y¯ ---Œá¿4+Â4öà«a9¬ÖS—U8j ‘¼+4*>@íëÀ¡Èå ¯“aZÃãÒK';þ¸Š0ˆý÷Õzñ«âŽfåÿ÷Â2+€¼J)Ë)¥°f|³Bö­»-rôÇñ8ÖLÆ¢›‡BëàîàÁí¹NêÙQ7Â/_i=wEèðØÄ. X«›gršØ“f,3÷&öšä_X×pþ©YDýó¡Ë‚zü{JÊÈ5,{jfsE*<¶Nÿ4ÒõÔõ@`žÄkääï]¡ˆ²¤‰çÚåw|*®æ†áföÍ«¼•^sVÀû,qþ jvÂÅ Ÿª¯Àu³ ›¯À…K3ë’Ç•¢k#Îîã…1Ô½‰²è~@,Tl£þ´Ðõ{1+ÝánšQäÍ21Y´á³‹³r>ÎÌúh4à {AëzîÀÖV¦¥hA›¦V’þ$ðxÄò¬Y®YB‚`-„ô˜}ÄââûôiU`W9úÜ ŽÒuï]^â@>»43û}i‡ M< ¨'Ä÷‘Í}âééjåhRHXl²|O‚œ+Ý`3=Ç–«N63ù@|VRfj^¤&#E›ñ&YkK,—ìÃ5K©½?¸C`Ÿ=Ní’•R vù|9O±Ìö))Éþµ«„LCvåBsª =kq–Iv„¦ÈS¢Bžáï-:OF¹«´9 ѵ‡ëŒMå)e1ù‚)·Êû´Ù{žrK^!3w¹#rQŸýùí–Ö ånPýMhWs Ò˜qÊU:(*ŽÈÎñSçDûoõ4ú 2õß ´ø…Ûm墟8ŸÇ$ÜQ˜Ÿ›sìÌ욊 ´7P•P­=¨æ´l·¹l‰7ÿøÜÃ>þ½Iƒ>#+ Òí·B„ bôßRirþÚGæ{Ù ~@]$uZ-ÏèÑî"P©‚vù…¹9_K§r£§ò£™WApï©Êi)T'i4ÊYp eËÏÉ„ }6Ÿ³èHÖÑÆ?!!.%e.Ø©Øôz¨§ÔÛ‡zÔ¾ÈÙ:Ðeç(¡%ÊÉHK•¢Z‘ôaʶ½VKúÊi„ 7´SöÇ|©{u­àŸo±kaKËKËK*Ú7žM’äXcï`#ÊwÖ9ÓˆŽ?“Ø“1g£ÝÙ¶rÓqå&åo‘%²î»¼ÇêÍñ´ß“Á€Ã>¡â·²IY®ÓPÍÐmÚÉõô¬^¶‰©mr4wÍæÕùZ]ýPÈU+&w›Ÿ Ó‚]5ª”âu*uºƒYeú ]íÑRù. È †×!¼yUl-]uF]ºN \÷l ï¼ÔFt«Ã7ze~Ò=¹¸Cø*ÔN¹º½MéÑâV¸V’w³Ç‘¡Äþ±#NÆÉ'Ÿ–ï‡ÔXmF|ª2dÅòHwj1N‹#Ï)ë,ôÍºãÆÆò†£•fJ\¹ÄZ·…á­„¦®Á=ŠdŽ’wUá·<úÇ“PF^&ˆñA{2 ÷Òe£ÐG Ýä"¿VÕ{¿çþEÚ_©Xý0ófó§­—.×tR±÷ªnDZµ.´M:$ÎÝâê·^µ€Êb¼ßCzF‡1Ë'w$e(© …™ x¬xòI‰)_¯Õ„ý꤈äv5D¬l,nmöiYìHäÞ„Æ-T]!Ïþ@YæÒ»7aG¯˜Ç6êU‰ïóø†_ûöÖcd¦Ü"ó”ÝSzYDñ[-#Äl¿xPØÈFÓex—{4ú&qº-IÈ“ž„üøK[=Æ{(N@CBeÈa?ˆ€ety¶ûñ½¡­»E¥É™ñû´)ñZeÚ–€È`X )“ïqÃö§v¤\!Œ‰òoOúc#½ÎÉœçº^;‹¼¦´Á)^Äö¿áX r ë’óÍ{ê½<ü¼½ëýš›ê›²˜,§üÓùÜHóÔRW/ôÏEœ,õÌs{Bvþ.~qWŽÙâ*Þ¡2ã2qí¦Îno#ÃBf$hËû†te¥á$%C«NT[C[ŽO¢L>æÍD¶¬q[Qœò̦C©OÂEh*# ãë‚a3§Š|XÌ$ÊÃ8>YЖAfÔÏŠkÓåæ ùù¹…55ïo¿/ ËŽŸ<}úW—»DVCPEðÍ~)5\¯®yüß'(¢ˆšòt.ÊrnáXà®wC&«×ô)÷‚k½zv²øÍ5–äÌÉ%ýzÆ­^ƒî’Lã-4ñ8ô‡‚¼üÜÏ$¢‰¢m;Üú(Ž-¨ÎHNOM§*†¬ ã-Eû[œI‘­…Ï~ÁÙ¶¤ ¸°² GÛìdJ´ZNqTYUë?¡¦íP-½ò&¢ Q—™ž™HåU× fQìÕâèSÔ[±‹ÿ#^ð4<„%cƯ%VÄ)G¼/ˆsWÎ` U½ýp;ºÜD‡ =À´÷¢*ð_´S¯§Ÿ÷xúùsår7ÉØ5€Jyß.†7få]®Ô¬Ð8A2=ââŸÃXIGãC‰iq¶Ä£Û—ˆjËoÍ Ídð¦ÚÜ¡OÈÞe±îïr£rµ%Ò°¹FÚë<÷lgï¼ë­ÿ{^gˆÅømKýc…Ø[K‹WÂdØäéÎýÇÏÅd×Ï|t¬2bÁÁ`ÂÚ¼d¡íÀ³zñŸ|v™ÞpSÒr[¨^GEÚ"ëÃÑ7§Mz’’¼Þ½Ž,,¿“"0F &õ™Ýd› C^îfˆ35ø«4N¤Yó‡)}!ºÉbÒß9CL¦4¾ÐQ%ÛP‚‹D[têö0Äö¼[²²Ë©Òé´Â h×n–C;tÅä¢ý©\͈LqݯNNYû)§OW45üåOÅù(ÿúÓv¸Ï¡•ýç”-'­œ²Ñ¼¿ª¾Ñxª%À%œ8Õ‘eî^ë[N 6:yª”$D©“(¾£íbĹ´ûw&œ8Ž=z_hi”}‰ýÐEjgEx“Ρ0Æ}Œ"LäòÌ#îJsnq=暃ê<=‚‚<¦?Ú€ƒpÞWyôvèwdz­ðMí‡çá+îªÓGDI,æ¹Îßr<ö`ÝÑòSUê#Û²…–æOÁÜp LßNµ{ˆ_ˆÆ[“ Ò¦kR3 Ò¹Hj·“–¼¢ç!.þYjKpÿÀ„×&8Àkc¤8'Å"´’Bâ& ~“xŸÏÍ£ÜD{™"ÈÄ úÐ,M¾&óPì!@œz|©4?×ð5†9\® sĨøØWWÂ%Í€­Ü²vÈ©)*ÌÎ KèxÞ 8µ->ºÊõx+Þ¡Ž^îIÎ,øwž;_r§·±[üæ¤ µk®x ÄrË>gØD'”Gnh‹·¯ÑÉUöjÛæCYö˜Ê®¢G¼ö“¾êÖéË=£Uëö¤ÿ«< ¯›ö™Ã`³Ýk¯…:9¸u|õÅÉS§k{<=QVgMø)ÐÃÐWª­áx”_dq ðÉ)‰ê F#4p{«üCöÄì\rvócj:íkÌ¿XHb‰0ñ5*T•÷ßBë–wŠ?oˆb#ï׿¿·Qv¡j]b–2/Pï{¸%AszšvGÚùoâX9Îïµ'ÀÓÓp¼·ówXüæ=úA¸°çƒ³¤gd—xÍ‚=.n;’’µZZ(IjCÑ7Ñî“=gÝvîÝãåSãÓVWVœ“C]N²ŒÏÖK8§jÞŠ$óú}eÄ-T¸¤×–·q6ZÐj(Ðé ‹+H€´$ D†d,a—’U@gc²ê3²Gî`„žr;w  ”ÏÝ=ñž¯£ž\åŒKÉhäB*5 .-ÒAS­D ba&‹AzmÙJf b™ÐãABÈÕƒñ @#Ä~Š«—q=ÚŸù­ÒCaô¢í‘¸žO'c±h‰Vy'ò!ê° ŽƒnwmØÓ¡ª¦³;ÞO™`Š(ŒÿU»ÿKûÃg¸„­1h}•äêï]§Q²€‹ïÉ °CNs°˜¿G:¦³½yìËáåߦPRî™Ægn²óâr¹˜Ôµž§Á¢AçÊâòâ÷¥'Ä¥ ÝÖÿ˜ECãb]¤.,ÏÊ/6ôÓ$>4ÉZéì'}ÅR„—ùû€©$‘¨¤Lš $1Q‡û ôÍvÞ £Œ¡5±%€ p .äœ)zx9»àüþ¢9TõχÕ@÷ÇFEíU‡AOk1‹™æVšµ8´”ãÃ.–¯Ó€¿°p%‘Kß„íS•+ŽB‡áD!×]I”*¶Eÿ#´Ñõ´O÷—©vûËXÕ“i°KÿÃÁ*`}zàVaבµC[˜ïC(ÿmª¼þ`#—è– ÌÅgŽV'gä‰iQ1цآDJ¬MBèš‹;+ò d{6k¶BÙÁÊbN…uÿ#¹ÖÖ(«²¨³¶a˜ÿ'cô endstream endobj 761 0 obj <> endobj 1806 0 obj <>stream xœ­Wipç^!#ð¸ f!*é® Ä±  „ÐÄRc̡Ɨ0²lIȲ%[X‡W’%½’¬[>°ŽX¾„!6‡m07L @RRH€d€f&M'í'gùѵM'IÓ™&™ÎþØÝÙy¿ù¾÷9Þg9XÜŒÃáŒKK_ÿîüyÃɱiœØ³cb¿âʘܡCÆB<âã:ž¿3 yŸFâ_ -Oa\GR¦O“H+dÂÂò¤”üÔ¤ùK–,ž´`Þ¼%IËJ2a~®8)=W¾SP’+g_Š“ÖIò…yERʯwÊåÒW_zI¡PÌÍ-)+‘¾ž:;I!”ïLZ+(ÈÊI+$byÒêÜAÒèîæŽÞÒ$%Ò2¹@–”.)ÈĆ%Š%Ò·e¥òwÊró*… Å%ñ–­Á2±ç±uØzl–ŠmÄÞÂÒ°­Ø ìl¶KÇVc%ØdöüXÖÉ眳pLw·-®nlÚØû¼Òq³Æ¹ð—ñÁñ»ÆÿyÂ&vÇL ±óÚplN˜ƒ Qú U¢4Âv†áº`ÝÓ^ßÜwã&ྲྀìòôíÌĪ|J-4UC9¾½­°ÿÁ>”êðÒ Wƒyw IK¥©™€—[ê#Þw3SŽÇÏpÖAÀ¯ƒªÍàô:]-µÔ(ÙUÉ; |ÄAQ JýgƱŒ¬œB¡˜Ò dûe?âäPé%Ôy9áÞwñÖÀû¼kE¹Rf¢ø=J#ËY¾ðLÝ=·Ýj·¹©„¡ˆq¢œ¡wîpÑ›× Zh W®Ò‚RãF ]à¡L´ QšñêW A1—y#_݈¶B¥ Ì5UÔ­)žý.k'à_ð>½•ÍL]#f2½@e­};w)à3yÅ`w9í^«“Jˆ-це[ l—Rïr‘"¬ö>DüÐÁªZ“Œ¸Ú£liŠÖ8¹ÊW´¢pK™ŠÔž*ýLä;\ín‹ülmøÜm4÷êñð¤›÷ôgѤsÛ®OMüÚBôêút°I—Î,ËtœP‘'plx@]W.—Tf¯(üÍêF GþôZSž‡Lü‡ÄYèîùesèêíÖ.]ÕÐRÐáZgeóžÏ‘¼ï2ãó^ÜD&~¯_®j3à èË=~¥Y|/pQ]l&q·ÇÇ¡TÔR^J©­8ø¡J‡N¦+geQÀ¼?E”/Öl1”K„üümù°ÔP R_ÐíÁ¼®:°«¢¸ª ¿«âî×7w3@"NlUmK©ÚJiä´¸†L|Ô^%mË™ÆÄ1ã˜fú¢£+YJ}}zùýøeTOd3«hÑê×XJm0ßôõw ñ¡£Täto;2/xÓT ˆÿé$4ùìÑ3¹ŸMMŒ¡»hñ –¾ÈƺÊÚÚR×Y×E]BoxÛYºøg‘s„Lªñ[Iz:[ŒHÒ(/ÕŠõJªäu‘†½øU‚-(ð‚æ¼“;ѬZ2ñ/Ƙœˆ(ÜUåR…D¤ëƒmv’5ȲèÐÔ(eßàÉcŸ—ÎÚÛ­¸ÝoÝã®qTS%Pd*Ù‹‡-ÇÈZœÖcñP'Ín”CµYo¦0±gD 1}ÞÀ7­ß÷yرצ¾Œ%ÿd¿|ññZe ã3ñwW>D‰ˆ‹¦ 1­dbÝbˆ8Ìyxᧉyú±ÉRcTÀnþÆvôw[#uäžýõ—XGî»ÑF©—U.WæJ€?ê, Îfvv |ïV¢ßOxÇÀæµï¸øؼ[ª›«©ULÝR×A´p´†ÿƒ¢Ÿ ïf·-ß²}{ I_ÛȆ È*þöÿϳ2 ܾ>2«gÜnsdwу §ØÀÒÎNl´í;#x¸¡]¡H´üßF}³:m°ñ}z¨$š×ô ø×ºQðÛà¨)"Û^ `‰?ᶦîÌ1ø²fº”¬˜3vÕ·1à"o3¤ËÒfi²øú]ê…`†RP7u8ê›!ˆ‡+¼*™L±s[¯rÿý^”Œžo#ʱ4*µ5†yL®o\tÂՉ䄸ÅÁøñaO<û‡ð/<)\ endstream endobj 469 0 obj <> endobj 1807 0 obj <>stream xœcd`ab`dddwöõõ441U~H3þaú!ËÜüÓëÇÖnæn–•ß7 }üÅÿ=\€™‘1¿´Å9¿ ²(3=£DA#YSÁÐÒÒ\GÁÈÀÀRÁ17µ(391OÁ7±$#57±ÈÉQÎOÎL-©TаÉ())°Ò×///×KÌ-ÖË/J·ÓÔQ(Ï,ÉPJ-N-*KMQpËÏ+QðKÌMU€¸MB9çç”–¤)øæ§¤å1000Ú10È3012²þèàû97eÁµóïýøÎüÓü{…è´ “'tOïžÞ<¡aŸ}ßgJÔMêìîèæhhjjhšÐ:³EþÇÂß=€¸¶¥­µ»I²aJÓ´¾ÞîI3äøJþpž6mÆ÷Ü…l¿§±¯âºÌ-ÇÅb>Ÿ‡sÉDt¦vÌ endstream endobj 377 0 obj <> endobj 1808 0 obj <>stream xœ-Ï_HSqðßÏÍvÕ5+X=Xó—)Œ9ÿ@,¢Aˆ24_LSóîî:·kóêm=Ôõ_›;s«ÔKPc3‰´ECG¢ô"½öÚS/âCB/áïÚ¥èêíáÇ9çûùad.AcKk{×÷a{A­ÂêÙõœ ´”Úq0Q VXÍ+êÞ)ʤý•´û2a,ŒNµ ÃÑÏDRë«# Ï%'it»=¤%ÄFxŸ7LÚ½b€ yE}"]‚gÅ(©½ÅáËõõ’$¹¼¡—á®Ö9‰Ä‹r›a#cìiÂ"¹å ±ÄÀ¹ŒÒ*„†GE6BÚ…6F™+9?B}HDýè.*Õ„Ìȉ:Ñ.–Ô¸®h©Üï®,¦Em:è·g #I:þ6[¢Íf!“qØÔøVŽþÌâ-õŒIí )û~ãN†škÎï4QôkwgÿpI?¦r*ŸÃt諉ievðÝ»¡á©Ç‰X ¦Yù½›ß’zßk/¾{¿¼:»˜|’L§á),LÃxòzº· oƘ…C{,ðò½«¾·m <02Èãúb¢úsl3ø¼;53À1šß}sòÁÜØòø›IÈõA'óŸä_Rù¬A*¨ìP|ý…âgF$£L‚|ÑÝÝ’ph:i‚¾Á@˜Md8 ÛŽmpJOJ6²t’‚ìZh[^F™å^}3Ý“ø1>oÈuÒúäË`~,^澿*¬Ã'Æ6²tpmñ˜V¥XŠåÅ G¹ù´ÿ‘µ¬øÂjÕßq„þ ¸Ñ endstream endobj 320 0 obj <> endobj 1809 0 obj <>stream xœZ@SWÛ¾¸¹*.âUPÿ{q·jÕºêÖëÀ­ (²W„‘0ÂÎ #ìMØKëVœ8‚ÚgëW­­bµ­­Úê÷Æúÿ B¿úýÿ¼÷žœóžw=Ïs‚€2ïE áRGÇiS ÿ§.Ðè¥ÿ/³D¦ß÷ÖÞYš!KóºFZéƒÁ±°e e&øÇ-õ{º{HlßÛõ¾í´9s>šd;}êÔ9¶‹}ÝÄž»\ül\$n¾.rác»Þ—§›$Ìö½ùIÀÜ)S¤Rédß Éþb÷ïO²•zJ¿à½…ï/š°mâöI;>pšì¥¦SvÔ ÊžúZIͤVQ³(ê#j55›ÚA‰('j0åL±Ôj(eMõ¢l(3jeN §,¨Mý%¤8Š¡xª7eKõ¡FR}©ù”%õ1ÕZ@õ§R¨EÔ@jµ²¢œHtɛè7‚Áë^õ*7`oöØü#ó2 Þ"Þâ &, ãÁè=°·Koèßײo–e/Ëõ–ßö›ÑïNÿ™ýë  ðÕÀùó[ ±R‰fˆÒÏÜÈöaÓÙ—C¦Éº`è#ëÞÖk°A6¿ Û>ìÁpÉð+#lGdøå¿Â¹)œ'?ž´l»kää‘þ#Œ2µfTëè¡£óÇÌ#s~Ìc畎-ûÝ8Á¸1ã¶«?}¼B_Ö__†´¿kAw_P­÷2þ>«8 Wù ?n¸_»ÆZŽ$(>9:>>E2¾U¨ˆ{EW ºz)rçË·€Ytùh w)òñ­@Åü+º¨ Õå%dG¥óñ©ÁH†¼T̪èkXg­éŽE¡U먵z®GÝPÑ×0W?˜m@»¸%t„˜LT…òùc¸ÕÙt3è|2o½Eðΰœ{qçÀé³ùþŸqXº[Ø1®Ú0ãdôËÍGæs¢¯?ENž¡¡LÇÚz¹Vp@ïdGá,X€Ä¢Œ.0¼'ÉøÑ´LŒ|}ÊQ9¿ [ã,JËQ}Øø(<ªB|9 –8Ûà"‹`:"ˆ¬]Iîþnœ&Iø§°ñW¼ÑBü×G†$Ñ‚“ÖêÈtÛˆôð¡þ ƒèïʼ\½í&ðchØàÏ^-;zµ2·W?Àf¡å*Q!_Ý.§E¯z¸HIƒÅå¶{ºm׿–ðv8—Å"Žþ®n‰ÓÖÝk>äÉÂñZøZ+¸ ƒJ™Þ|ÈŠ“ÅæØ|ò{xý4 zA¯Ÿ~+»à™ìb‡»Ï~¸víæ­«öS';,ZÌw{BÉkˆÉº ²c×]Î+Cü(-?=fÇhl*ÊL4<® Ækhx_²À+ÅÂî{Ð×4“VÜ­Õgjupý²™>T-D•¾a 1q \r"JŽ{Õì(ÝL2Œ%[†íñJ ¿a0ß·=Ù„¢ä—Ìǽ?7È1Sg¾ ðþ£7m—Ïϧ†§DÔ!¦iJ ûÂb-LÑÂõÎÌT“ Ü‡¹PÄ^ºxöÊ‹K>œ¸Ü~ùÇOrxœù!—#ŠÄ€àùO ‚Ó¹Í)ÌÇ“=¯MÎwûK·×ü§<¦»½yYû‰?÷è°ÙH²™}Á(”Ãh¯ØX/~‰0ï3Ê…!~Ð#Cñ(ÆÆ³ •pðšÞ›‘ÕÀ?– 2O"å–âa÷ìtP¬3»¬¶Ó޾¬]Lw_+ Cƒ-Ì„gÂlÃcaû V/ÿY-$ÏÜ{-€ÍzøéNG`ʉՎz[Ö¸p¸PëZµŽDÄ|ì$,œ½®o*×ðØ{kXÏ3Åz+½€]·uΜÅö7ž<½¡ûæî±vœ±J‚µàÜŽ¡ºcºí$$<ײ¾&Ëõ¼qëm¦­¯À¥BQ;ÃP¡+Šh܇ÊJ¸g#\9<œ!y#ÝíÑÛÂúølO®½·©¾ëzv)ø@+ 1¬f¼ô3ôãTAEÒJÄ”•V—Fž½yeØ*G^ôõ>ãT¸—)ÓïãÖ¹¦+È75lֹЗá%x¥ƒdf°jXA¿Óöà©ï°}É#{Ûå^=";ÙäèMtW°º¥…(­v¨è%œ†LV’&M§û¥}’‹>gªêú6ß70•S…§„×wˆNh¨½ Dy\2ç¬qF¡$Æó$sܧ¼*çEÏšc¿‰Ü8lϯ©Û×çÜs ʼn9ˆ1D„Ÿ Œ@⺬BUS.×ì~6¹†Îô†oOò¢—èwÌj¼Ó™Žb‡Z8Jš³ªHZm7¶ÂÐ|;œÕ×äÄÃt6ߺ}#bæ. ÆÃßüv¯ñŠSE|J¸:ªªÓdà;lIˆö”qu» \ˆÍ–cðpl‡WýŽm ï…Ãuå¥|0’=mtÏuío¥CЧ“`ˆõ4 ³M>ijÐÝ™6çC#ð:ücœDO¼î~ûÎý#mÅHãᥠç”ëb$ˆY€ÎTò=º¾à‘<ÈíHû¬ì1w=Vb'ìN}Ú4•ír±éê¯3ÚL¿Ã`²†Ì„ÂH¥Ã‚:ˆF ßLoÁ§-”tbUäñ¨CaW’r

æT%¤2lÏåjµ@½`ãXeÀå/3*ˆÑö+égÂ&u,½dás{îq,ÔÁ*…Ó‚MGR¸Æ<6þúTѰm/¤)9I6?a¿7ZÊ M¢¤\Žzj4\2¥í3è`…A t¡ ˜5ƱÐ6ÏÙ-ˆâˆ©&ݯ–'.«~)c-nµI¬ë—Ø(ÌýSò¨RQÓìrÕr‰ÕMi·ª9ª]®Öˆÿý_=êFô5<Þùfm%þ{“’oè`}Nn<ê44Yú<àÍnèÞݵWVƒ²ùN”Ê"‹A¾Øäÿ´ÄB²^ójã;AȳÙÌ©5­uƒØr+Bßpc–!XŒu½¤mßXñ뎷p'"K]+êÛJ« ]ºãJeÌÓhÛR )+Í®?À +Ùú¾Bµ1`ž¿98fg»QÖ¦l.NÐsLjñô|´£†_ß„ⱄx9t' Bß scÉÕc:ak­g¹<Bˆ·G Ó÷êãç›ÓàE5,ÍŒŽ³Öò³ž•OêvÞãfÛп;êÙ¶B(yCjœ\÷ËÈ7¸‹ÁªTƒ2"ét˜•|Ô®'KNƒ n‘›Ï‰‚®ÿwVÍ©¢ˆ£ Ïv²yõfè¢Í«m;ýˆÁÓò¤Z—¶<± uÀèj52,ýž~Âá°ÜfðPæ në·õ3ÏÛJùÕÓœVä&„ILd ¯9ª®¢‘ó¦:Râ=EZ³ öòj;Þ1´—S/©q9{Ëe–³z›±Tä}×òÝå/²äRÈPS‰ÜAâ7Ä×Eä·\!)£E×Or+–’¯¨¦×):ÚöZbÅù¦·XëµGÏo"ä™Þãé5˜„¬ß  û™Jð 9Å8Š›/Á¸% „ŒÛéšùc ÞìFlÍ¥€„•Ëf½ieWL†ôÖsl­Ù‚ŽÍ2ŒKßšvÒÄÈ’&^^gr‡‘ü&yž[ï>xa˳†ÃîPÑ ÕD”ÒÎ0<àe¹uÂ…êq‹Fd<ü>hP︪n d•ŽNw  –mc9NïþöASýu±AÇÏ5&)éò;t}h+Zp;,ýªI›'y§5³+jGÔèò ~T£ÿã:_D 1ßo‚òÿ_G‰Ð€×>à prGYÝŽ¡4ªêÑܯ!ï/.˜;D÷›,vjü­—²gHÂ辰[0Ðåç”}%ÿ¢ww‚ùpK ß‚ã0ä7aÈ‚òC!ópýW#(Õd@/ËÈÊ›n xóÞ~“ëóýÿÿAß¿endstream endobj 278 0 obj 4577 endobj 282 0 obj <> stream xœÝ\éGçó‚øFâƒgP¶]÷Dç’l„P@h½ë¬#{=IìÅ„¿ž÷ê|U]=Ç !„3[]]Ç«wüÞQýýŠM|Åðé¿×'¿°««×'lõ!üÿêäû:¬Ò.®WïžA'É¡eòÌóÕÙ7'ñm¾²beœš¸X]Ÿ|½6½ž6b²Öʵ œZç'ÁÜú íFëõ“Í)Ÿœó^¯Ï6§Ðê8“ë/á§Ô“ÒrýÑF¬?ÀNJi+Ö¿‡?ßß(xÅh—(³þÞP0’µtÈÇ0íŸp,9‰0ªÆÞðà« Ÿ¼wʯ߅Á¤ÆÁRÀê¥ ¯LBcHǸ<ë=O3xÎìúuyR¹<…åîïg¥€„R°ƒ‰9 ÖÙ%ib7:vt+i-°ßiêx*Ùd¹÷±¿Ù°Izoaš V%¥ãé­¶Sû˜¬Ç•ŠI{$ä+8 cë×ð‹y/ùú¾â…Uë°£–›õبӓ6býIx+çI×á—–ÆòõÛð“v\®·° Ř€3!#]ÂHÆM–i ήÅú&ü\¯Ÿæ¦ô†áŠŽS;‚€­”‡}›÷ø*¿\×U¶)*%½–‘Þ­Î>=9ûå×k¾‘£âzò†‰|B霙æ0_8X ?_c«Ö¦|Ì£aÈGÊ \®pÀIësøááTɯ#ëÕwÞbGÇdÖ/÷@R8yüãæ”.ž”f \C&C3$…´ÖA.Â/!ÕÒ‹ ;ßf)¢ÚI+À7  ÎY‰'[6QŸÓíÀs`Í÷ª„|TÄæ+|®'R¾ g)¼„sr{‡Kt–]‡,‰äwik¸¡ºµ²ŸõdƧ—q°Ñ4Œ&PƒLPFx³A¾@ʕ٠<Ä—^U‚ÿmv ™O]¼VIå᯸ÆIÓ;ð27p޼qìo@4ËOÉm}û²¨òN$ež½ô}Y:üˆËt0“Ç]çÒù£¶+ï\ä»gL,€E¯¢Ò T©]r ÚÄ&P+.ËÞ«4 +´ÏTÃû¸žH ’þo›òf3‰´>œÇ„ÇžÊBÐ]8î£Æ¹¶5sžÐåè™·˜GØÙ©ƒÇ©•!ÖU½ÆYÌ*Ör]r~°ölæ¬ãµŸ8ÓsµÑÊÖœTyŽGH5> Ԉȳ‰¡¹©ŸÎG‚A+(°¡7õù›DÎC¢+PQp˜õy¦‰±iÛFÀû¸î‘8½(C€±y^NªIZC’ÊQy Z0šÈÌÏ«ŸÂ¤…—„$P¥•‘‹ÂŸåð*ËR- BŒˆÊ-IU}§h¥%ù‹jUU¾Á=W»Ìtl7?G5êv¸Ë¯@åÐCX…vªò8b}ܪƒ¡•ʪ{FÄiGˆ„ý¹·/PO8«SÏ“†2ì:œÆP°ÉŽ.F2Wû´ˆKµ1ss%#W>¥6 ~1®äúŸDÓÁÁËp°¤ç\¹ŸW"qýYÃPé{^»‹L6Sf 2†sÌÄö+èD#BCrÜE•㆙ ¦ 7¦[­ŽŽ…\”(xn€yôXΈVÇ)Ý ˜¤n†;ßH Ð ´u{b8…nA. Àk{ЧRè`bÈyÌÂ7x¸$OmX*ïšpî¶,îmåòB žÑÎŒ4 §¿¤Ø¨Î-[ÙÊ5 ÛMfÇ>Ù¢ÿcÁDÈ-ƒ3¶Ü›ðOB”eø÷ÿÁ5ÂÞO£‚  *ö~â:üYÿ©(4âïÔg[답ñ¼4þP/K#¼£´)4ëßm lŸ½BoJãëÚˆj%¶ŽÜ˜,ú-H/g½ôë¾€?Ýðî xžwv_€CòB(P~‹hL±^¢-èÆG.¡,äмº·'YŒÊ†õlÃø8mX"AÒ†aëlø5.Ì…ÅßË$>¸1@H.xëÇ<¤Ë¡xt9’>r2ÚîÚ§þBcFÁØ‚Ôò^-Ù¦¸Š`H$°¿S½;ò’ÂBÊäˆrXí}8ßCk’Þ èÚQ8˜mf¸ñë¯W W²IÉÇ%¦ CPxÒÖÂYïp½pºƒGsªÀª8ÛE²Ñ¦ ! ­}R£pŸbk”ä/+ m dàw.À!Íì>Ç’è÷n[ ´ßáËÍÍ´¤L€â÷"p ÷R”3ÕzJ% wâ¼÷T «,‹“‡-èr#2òÕp+‰±’0)¡ô_AQ~™˜I‹JGØó´Î2F騩.jŒÒ3÷¼“|iI㿈.½Èñ[Ð^äsai'9N”¾$š6ogɃq©±+BÂ&É5Yï5@$"Ï &"{¾NY‡ ãö$ÃU\Æ$¼çáh‹jovy3"3ÂãW-?£>Â@Ã#´E®“ JøœFÅxˆû»´SŽn!èE”J~…È$þY<•ñ òb+á¢óÈÐz”zaTqé;G›žKr1(4£ Èw#;¤C®õ©’:$LS±Ø LƒXŒÏÔ1ˆƒ¸ß= ûM9ÎE‡á|Ó Zk$RS`Òâ®6dSkô¤ wqSa?_ã?çèMăõßËncïù–ç±¢µñYiü±6¾…š(‰@Á0 @aÈÀ',†°âãŽÈõ2Œc‡±¶¥ñºt¼.mÏhd,Oø¦ ràÛCœÝΫ‡s‹ˆßÛ–âx¹ñň,”úùÀ(ñ cdú]Œþzp•m^ÕŽ-õCˆñ@ý*.A¼ÿ„ÎþŠËåhi¥ã·äèȈy—#R¿3g;‡Êbîøjt¢‘'HÐë>g[Ñ¿*¡Ž–-ðgÌpP¾È?;ÆH‡Ág!`ºX½|àØ³rXãÑËbôÙt î%ïOÌ2‰"¤Š”)Þ.¾§¸×æJ[|ƒÀÏjãÐ_"pÙh1‘´diì$M“™ 0(?pÌÍ ² L>¸A‚Rʰ//[°1Ç&æJT¢ Å‹„E*ûÓ]&£:õÕ#мi1eZ:‰¨UøG‚ ÃÌ$âb <•opuBîvì’«å&DU÷—¹”ÊL]b d0•…/ x1Äú©Ö„¾_U(‹O¼¿#1Úo³&]ÖÖñ¦)î–ììÒWÿMTp5×1^;²æÙLD,õ@ɾj4å ¥šLÉ\6ªkÙèÈ– ]®X^ÉC‰Œšœæ AmºÉj{¢8’4ÿƒÑÖ~ 3‰à#E‡bì›(ª%‹~­ºÏÀ‡Ró@>¯ãÁIO” mÈ®Fnhð†ä±gí(8{9ˆqµ›a;jžc¾M”¥‚æºBü<¥Ø ؾeþÓYKc¡Uvöµè”a§×Óî?T±±´õ—›ˆ€èïwH"ë¤pµü”ã"+R¯QãKAÇ„äIuÊñBóY Äj3Rmd%ä³T1Ü rZm–IU3ËÁöœph#$öA±1Ô6÷¢‰SƤ͞[þÎû8vì¤}"P;‹†–ŒyŽ‘8é;ôÒ‰€zt:ƒúñAÒ÷W˜ÇtH´Zi¼GpÌ@ñ»’ˆµE€夰¡•FsiBŠi¼©Ñ…;«D  ßŸoJ´1›ŒWÑäsLÕz —JКRÏDy~Ï‚Z·Vt`1ÄdB)Iƒ}^%¥ésX ûÌÔ¤ð"Az7ù1l3‹ü­xL!ßG…ÏN !c(VMžT^5©G*I5TvOʽÜ“_vÌ^(# {…ek9g¯På@0y¬¶a ‹ó3Ì.&aQãÄ=)ü5s~}÷×éG‚Á þ=+ò'v$ÕÖg»­#…çD©T™?‘¦¯‚R¦uÏîi2­¨”µèg> Ò€—Í8‚ÆÅ´má¸ÂLÄ"Oñ Šf‹Ìì›æ5L ÙÖcag“{™”/«À9ʘy´­ÊÞWUV{ïÎ÷Æœ âq¤£œÕ¨æ¼¬"å8û«:R‚õi”y]ó¬¦-"¿Ì–Jåäª)V®ŒŽÅx‚[ †M`¡òðæLU±’kžól+ÊíÑ·ÙÂñ’ÅÈc"@ «FèzÛ4g·×]‹”/ż¸ß»™w¡zÚ¾Fr÷ÜmÈ®æ°t’ZÆeñ&·ˆ"ÐÞ q &xÖ$d‰ÚzG†¤huužÙ¡P1|+ô@.--á¤H(ÀNônª‘JÂ|.@™dáÊ"ìMX† 7t¸£V51Ê€Áiæý8$0¼,”Ô&øY÷†ò½Cm»ûhÛ3Üu93S©OÝ¢«sÌ®‰Þ#’”bN€c D½¢¤Ô3Çý9šÇ˜ÝP“³ ˜«äÝ%Á’B°ât׸hí ÊD[~6¹£†3áX¡Áã3Tfº²ÔëH£‰>' -™m,"ÊiŠ|¼9È/¢ý|Góxþ¶ÀM}Ž (H9H?†dV'o K«q½‚.ÜPMx«%“ù—Nµ|4¯ÆÍák …5%–Rhw4*Âê"[)à„n}ˆEýŸnµî’€3÷³ JçK£—‘ ¡’¶(Ýž©Öø<²iœ/G0÷Ïv ö´ÃE€T¡~ý)Liíîx`¥ô„'i¸y©@Ðjåt¯ ¸±ˆ>)+!_jú,A'`àÌéŸmÐ1įE/Hahc‚3ݼèô&j€e—[‰5¦ŽFÿxb@ãËŒTYº\CÈýj3ÇBĨ”×*B:´Úþ½Êtã‰F fM¿ÀWœSKq†9Ð{¹I@>ã’#f;n×”0íO±dArÚ⪛Æ/C˜Ž|«à6Ÿ9=J&›’b«­M ëTrñ±!£¡¨Ï¾­ñÅáK5´xý™Ç¤áE€„µDÊuñXav^‚ìB³C—¨K°FË ¨”÷„¥¹6“HD€ífðy ú%‰´¿–é÷Æ>“î;$öy´zÖwäøh[Õ}® Àš>öseâ5Oîºz`LÂ!‹~E€#4Ð~]ÉÇ0<Âr6‚æG§FæùÙÜï8"ªÄX0(G&ÞÊ’»oKc´d×méŒãîöÅDT0)™g´ÐUJHuO1p½:füà«<1«Ú!¹|Öû.«y'SûÍ&tº †im—¾îäxåÁ?8;ùüäû•Œ…ÑlÛÅ9€XέÀÄá ‹ë“wŸœ<~òÙêÍ7ÏNÿeÅO„ÿ¼ûç÷à?OÞ_ýääƒ'«Ï?~Ù‰`úø%Ç’˜çŸ¿lÂ’ñƒŽ`å~kûQarØ÷¯¡“ ©kZš¢L ÂÞzË{ø-{}Ì~1…fÜ®Oxp >Τ‚ÚÍw3L,OxȯIzè¿zSzˆ@®l’€@ x‰öÜ¿ D"9ÊÅHÈ’†1­hd·ÕÝK%cÄjæ$©E~â½e?x訔4ýÎHãÁµg¾+¢Ó¹¾žzvå¥`)òKê¶F¯¢ºe\µþ®Øk÷Ä箎óácPÝÐ]JÖdg·*Õý,=ŠßGýÀ»´,®Ïbª8æ|þåÄ£>gc4Ù1]íBÈy¾Å=ŠygSarÎ0Ô:g•ñ:ï,_®—”òœí·~ÍíRÜtÏDiêÌÌK;:÷’©ûëä›67XRl`÷w00ààÌEXpLO +LŒØÕšå£ Ø^.$ôw Æ0ü°Âåä5ÿ7o8küùÉÚêRendstream endobj 283 0 obj 5107 endobj 287 0 obj <> stream xœÕ\YoeÅ~·ø–òÀ½h|è}yQ€°‹ÆŒEÆcwõŒÆ>·Owuu-_-}ÿã“RÚŠÕyóøT*·úžrÓÚ•Õ&øD? ¯ç‰>]K;9ëÍêÇ5çðÔiòé·°Ì'Ýܸâ§ðTÙ‰sµúŸ:ÏaßÓ‚ãƒ4wbõ¬„C¬$uZÀ ˜ ^^Ñ~uw}¦á]ËÝꇵ˜Ó@÷Çk5ICa>)€—Ò¬þ‰¯ !Œ!Ï뜉<˜7GhJKËã)(GO˜óªÓ3É&˽§ñLf_}Ž?Ű${•a+«ŸWøóþx‚?~ÇÏñÇ2ú!þy…?Þàÿ®Ï²Ü™ðJsS‹ÊhxìWÑ@‘÷ruY†^Ô¡OËÃûÍûéá³úð9}=ýö¼~übôÎÏëü4² øCY¦ôä¤w§g f  <kGÏCOÞ0‘åüó5œw^_ Èj ä“y¿Ê (€³}My8(ͤ•F¾å§ ì‘fcœ5d:dƒ°“`nõr­Õdpaô#km8µÁÜp¢yqý e_À'*pNêpÏP°´†9­VJ< X©`W¿ç5žTɾ^ã¡r'‘±ù¤RºIȸÙØý¸š‚O.æ„T &e·Ö(úëUód ÛÖZÚÀQ倣.¼øÎ(‚ÂU¢G Îs(&Û‘‘ -Ãþ8Yö *½ÍË«5ša-¬‹Ò Á(éóéFá.•š\â™×*¨EZ‰Ø‹/ŠÂƒê£‹Œ3Tÿ-'Ó=‹†N+¯l¹ yQ‡Ç}jPº†Ž|xÈ¡aId(MS/ÞD 6¬•ö§g°kB6}‰ÆWi­[–gq 8ɇ‘‘Âû²ô{†:´à) 3¡I^Ô$] Êxªwù¥Äà ùdN.ž6ž*ÈÒ> çgŸ$|¬ÐQ®a!Ôó¬™(‹_W?@lü=‹#­ˆ¯HIxíOH˜Äøhß`4ÃЪØHü‘®¹Z#½ùˆài|5 |qéUTÞD-$•ŸÈ3ÆÑ<$ÑŠ‚ÍepüÕoQ]øEy•áWæñ÷,bªèJîEeº0ñÏ˼fúBÑbä¦LopØ]+܉4Îdkbóf`…ÏÐä[ò^G?à#~Á#b–5GŠK|Qm°ó©ù®b£»õ­×À7ïÀ8–™é!ßTÿk‘*Ì´‚JX”­ŒæcëZd'TÔhµ ¿&…?&©y>_c{‚s$fî!¡xJëŽ`w“ÿí&¿„y¾.Ààþùí;Å<ËЫ:ôMyøª>¼)ŸÖ‡÷ËÃJ×ËúqBF@èj„¨.GÄ?.ׇWåá“ »S>#€Ì¡‡ãv ¤Y„ìL’WІ¥Ï÷iò]€4xV þ;ƒq`{¤»@bŸ SÄ>µ¾©’€ a,†cOŠ3ÜéѤÎFý¡>`ਠG %‚‹ôr*±¤ZvqÔ«¦…Žñªi‘ÆÃKÚ™<Ì”þ“"^ò„ðï¥ßK?•A»lÿB•Ÿ:F› ÀݨMÂ2ð)¾GaøþkÓ\¤Ïe‡¾!C“ì€ö²#CùÆÃËNštS}& }K!YBpÂñÈÓˆ\³ÊT×5ôlxBÎŒÕs¨„8Â9°1Ëú˜‡Â!EÛ4ã"óôêýˆKÁ#ìX-NDLš™6ni)D ö>¬âœž„Rk™3a„>›€î*8‚8ËÝãM )`*%=>2$¤92 y”Im€›lDºMŽªXž—j·Í§t,Á¡Ä{Œ˜|M¢øfÆ!!ôù~~6V­ê °¥h.kC£2D© K0§Ðtœ©Áqï+q‡~¸Ã]¤o°­HLÈ"p1LQàü†¨êk⣆  (ã'£²f Öb3Á“ù+&5òSÖ f°¡€Ö€-ç Z™MÆQõó‘e',|]ƒ€ŒŒHÖâ­Å\Qe"£Ú`‹d¨>€™Ñy‚¯–¯þ†ÌG£­¢OôËÑ©Y:¸úKåqð| ª5ëåLf:(…zÈtVå Û(rô+Nk11ƒ9Hª \™éeåX &M§¹ë…Èœü:¶ A"td+ä7¸Ž&~sf®²#Yç)/ÏÜØÃñ\k¢û0“SûÀå-Z {\6 9Z=䯮ÒŽâEðû:Cu"ÒGל°±“‚¾R–ü·1ŽP6˜-¥Ï¾ƒÌëì'ª”‘¬-1üÃÌV´ †Gc*dz¶Å ˜ýjƒ Æaf¡–=ƒðìËÙTŸ4?ð,Sf–j`€5¹Z–z†jOÐLÑëjYÄÀ'æL·M7„X›¢¦ÌY4)€i·s9.öýÍÚ…ô› ƒ¹Y°?‰p²`L °p`Yè[Ú‰)¡«Ä£Ýî¨.äO_´ZR‹RZX¸§ÖÄTé I–8A¥È‡Öð/¡#¬€Žêç8%È«ÒÑû'ˆ}[žgo˜b`™iš„”2Ño7. „zK")êò¢]K¦?%R•ö¡´²³ên±ÕŽ!¶QËXNɈåªèÍÉñ¡å¾J c0Ç&Ë}2\"Du K¯Ì ­/9Q½„(TLu ÷$·ªÃHEÒîƒFôpÌj„cùX;Ïœ­yÜX+ÈCkM0E›o‚CĨ–D¤ƒû `ÑÅB¡›RY •§õ’ëVÀh]pA-f‰Yr²áVM0€PX`u:—Ýoš@ø*-·…2\B–,TfZw½M7ÇÃ-=†7%°«¿âûy²È~ïöC—¤²ÅÉBîKBd$ÏÄ*æ3n޾ËYÎ|Axʸìò0ñÖÔY‚õY“ÖhYŠ¥nâá ËÞ$î°Å¼ìU¾h¼dojï7ÖI¨¬zʃúV(¡’ Œ£ȥͲ‘0¦W’èöæ;+—!5fÌç2Ûpºà (wP3Ì,R’Y¬Káf$!ÌÞ3ÿ´4 ”±¥"xD1†„·›Ä­¯}—2’”z'8büÉ;$ûÓ”ïºÞaA¦Õ,©9K [²¥ÿY§²ÐN)áß˧h‹h¥å÷Í9[R yBgë^–ªI]–o^—ªIÍ'/óXÅ·QqU¾&D4µ,8Èw™È&¥$’Éޒ¦U?}TA(tlp¼©û Ï2-”w²Éåpåƒ9&­KÅ»µ‚k&$•u“Va/ÚkƧ5m1  ˜Õ#è€ L!Ðz›¹è’'z-–SÄb5a­o§F¨mÍD´a¦frb¬ÍÐÁ_î[aæeöš6Š™fÙ&'>^öPÀ¦íAX9É9” =õ½Š¹¹ãÜ×÷‚Q‰ÝQÜBzßHo‰ÇámÔgCóÏΞÛÛEhšé´â@Æ×K¤ÊbzðÖt-Æ‘,Ä” Ž`wÆcÜÿ2ùw6eÙ`G2?Þ Ý&ß G»äíîí¢„çypà Ò9kf#o22)ûm1íöh,YÜm% ƒÇÍmWgjnT.Ã!l{{o”¯(gҀ歽0Êâµ&ôÿÞÛÝrYüåM<* ¸ZpLÓÂÒ÷­Ôf–«öy¾€UúßrÑÝÜF éè= \ÄÄÃØBÐ"β*å¶[šØäu \!>àΠgßóGUñ‘UnC£š¸ßšà.fÛæÇ³9.}—LÖô«#–ä6t?sÆ·T&¤ØT™(ì]jEÞSíÞ[÷þ–%4Ü|Uâ¬oðÇÝ2ø—ÞîôÁÌPOŽLÛúð1 9¦Z Sf!ΖV½mmwo§ÃnK(Õ?\ ¥è±³;¨²sërZW(;Å"é™1¹vhDm‹VÊ© FФ›„vˆRk)ÂmèQ(rhR ÜÜë£Ür¦i; EÔ\84,Â]¯Ð0:\ÃCŠêyа€‚yî3“)c6s'Òî)$ò«å"ÖmXø½^WÒZëK2Fù|¸.')T S—ìc¦¾)¿õ8N‚1)0•Zé4k ±X¸†Õ„X;Á; ¤ Ö\aÉqœ-)eCç$Ú3èDáêˆÈ-K Ú"ÃBá4öª[ˆhH©¶Á“‹ ¤k<@¬¾b&„¹M rœøw†\¿¼nh5ZF$:ÊèžÊtTôs ]‰´ó * à­´âHpݲԣöV0Ø< ?Öf=«8'VåîÅSR#„žæº°M…Âu“"HØ ÓË´œ•+‚3T/bB…&¡cL?Ñ̤bnC\ºæ³¥©æ¦GŒÐîâÄõ¹|gPºmzJ”“¨ì½RÕËÝbv!†lî&ly»6F=À»,³ûsD-sÉŠùp͈J±~[ÈêË!±8Å}éÔWµSŸ¨ Ðó–;ßÒŽÛ¤CΪÍ} 9Æzg1ÝRwê^‰\rt±2F&Û,Óב*¬S½ªò»^6™šåø²÷™)£Ö7À&ù©=c$o.Lˆ…ÛLqLL’x{%ùˆ»íN´Ëp&ß×8"¹V{CoE6´^àÐ(lo¹hLÒÌwÇäÛÀwçt_j)Iéukˆ7\XFºKkà [}HÁ¾Zn.Ê®—v$ÍÓ˜Ws±Eâ(0ü1›•,ó°T¹é³;K`X\íŠAŒ'W"Gu÷`Û’S¢'¥¡SÆ.ÁÙP‹jîªä>´€Û1 ÙŠg¨Õ»×Y•ŸÛÀׄÎäƒk±yÖ]Œí½Ú-Ú¼­¹$—m Ö÷|«FmÓvh ÷ô"6q.£úWj‚T’rvØfڡվݵªv»&·ÙzÚ;0îIÒwÔ‹ÔuÞˆ‚Ü:9)÷©*Wò“|B•HÀÍï\/§N‡¸.7…í¨ &•ždW^#=DgÁI£µ°D´ˆBï»èÚ–ú@`V{N÷Ìâ·/ð[ùä¦ ¡‘LDÂg’¿žAÄÚv|¨æxÖw5ôf>:MúCÇVÒw] Å47¦‘÷&ìJ—’¶£$’ß·À ¨_ D¾•þ‘ᓚoæI¦]ç.Ñz7¬­ Ö–í—X?o÷õàçÛy´M:¤Ó°¡oi±aŠgÖ<>ËÌ=š­K0yXzù0$$w‰Hh×¼Vév¤ íÙ—À3ØšpÍaè!õC!qÔv¹¡= ¤‰œG¡¶¨¥ÛÿnLs«QîpE!‘9G9B Ãæ›.âm*¥xöÎ̲VÇA¿åo@X‹®N†oò88Yóö 2)=Ö:‚]%"åu°ç½Ämäu°B‹ù­’ÚaLe-6óÇfÌÜ÷?öTÁî‘Ä& ¤j ŠÉhµ/. í–ã$ið;Ó\¥ëmôdg†Å³t't­"ߙƙb×´!¦®½måNn0÷·`™Ó5ÖÜ£"c–íPQNíѦ¿ pK‚»ƒ7´º+>õî!·Ñ…­¿Ö™9“™Œî=6Xäíɲ_ØÒ™"&‡};6§Ü-5ãÚSäam)µeØ8r=ª·>xëÝ$Eо99ÿ cZ-ª‡Bû=»0-?ü­<$ýÌO‡ûǸš‡K¶–]”Îæ§£ejÑübsÃòƒÁÀáŒŲÿ­Õú÷™‚!r %T2#én"ÍU„ø+F†mY”HgÛ~IÏl@9*¹¹çš5üãüä_ðïÿÜ©àIendstream endobj 288 0 obj 4528 endobj 292 0 obj <> stream xœå[YsG~Wð#ôæî ¦©ûxذñ}± b7Øá„‘ýï7³Î¬îê‘„û°A0ÌTWegeåñefñz—M|—áŸôïÓ“{íîñùÛýþï¼ÞáaÂnúçéÉî{0Ir™<ó|wïÙN\Íw­Ø5NM\ìîì<̨‡i“µV*üØXç'ÁÜðõ(aÜh=|7nøäœ÷zØ70ê8“Ã#ø*õ¤´¾ÅðNRJ[1|?¿,1ÚåÊ a…JÖR’÷ൖœD ªq6Þ/ƒo«Âã4Fø­Äï–‰'el¿Nü³¼ð÷Ëv“éœÚeôÄ@¿ÿ‡*.MÏŽ*‘¿Êà»f+ùëË`š’­/}£ÒÝ­3ÉŸ5›Í_/ê22÷°9³üõ¼~}[—í/F ]² çþ:–án”Cƒ ºšŒÊß(DyÜÊš ǃ^Åu—É9c¶ï€1–ð¦uû£&¯îùàc¤#਋ĸ…kÉìîpCÓ7ŠWùÝhŒ,žnx¬ÑƒÈøC²µ­YF¨ôD¯úûÌK*3Ç19P Fõ)z î-Šœ0zìJ%íWÊIq÷_cÏY¥—£ÇK¤©uÞfq¥ÒBíw°3Ìšƒ»ÐšÌ!ñ‰ˆ¦§•ÈÓyÉZ°š“#tb@@eú íUfû­Æ´JŒî 0Â2B‡Àºƒ…®Ì€ NÚn%<ª9/Ç-¾IÐEt!ê‘aTgp ,N€÷áVá½¶@Êt¶Š3ê9|8ÛH¡4§›ÙGà1F„@`dà¶ÁµQ@Í‹Î\3 2K 9Ä͘€u«ÚÅAãm¶ë#Ь“ÚhžL+)r¦ú›…3bür_” Z¦MDIÐc†@’dÅ™Qçã~[ VÕš\ò¯J;ò¼æåtšP¾í62äU„fò4Ê[:¼†ä& ’D¤Ò Ó÷Ãé.ñµ¨FŒ›U›-ê³¼¼N$o-Ä_QÎÓX¦Ò>îòü´|£æ”“—2ÛG˜ã$õ±ŸáfÀ“ ­0´ß+Eûûa˜õûêz2¨šG$ c6¨ƒÆ( æRA›«˜Óü³–~¨_ ãO¾çOY×{P2V¾"¤U(ÿKyÐBtÀy°®‘Ç#»@Ù,¡ñ›!RL«À‹Ø€ieÄBÿŸ6ø°‹kÓàË^¦P_t@ðõ =%)Ey\!þIÃwyo1:ja=yÜàáœ+\”ÇDg4 Èx¥f39éÝ,uã£Ø *vk€8: ˆy¶_ÄJb0Ô¾ŸGí¶ÙðB‡8¾h.NQgš`’Ò>„.âO+˜Ù2dÀ„öA<÷vOE<ÇqÜã ¬6bá(aC°¿šWÁüI\ÊÜ_µ ¬8_|FÑۀ幨 _P¢´d‹?bn¨IÙæJx$¡Ï 5ùÁÑbdñ¨´°v?Ê­þ%ΡšÁ•lK5Y-@ÊøYƒ,Þ-áÄ<7ØŠÑïRÿS3€@6ô¼*äY€]ÿ¾Ž3nÖ²‡¥WË;`gaf¡~‰+àŽ¾n~(ÈFwã€3±¢³¤(„ð±»óBtˆ–cõº³Ÿ÷Û5.VÔ¤ à¢ApÜ,UÅmc-~é@¶ /uÈRêmO^ð Š o4šgõ)Zù²Q°ž d%ÕÆy¢J¢±νÔ®f¥Ëœ[÷[¦5[ G z¨»I:)JÎXÏ ÁmoÓgÌÇô‹ëÇc•ö|ý ´BnŽ}ƒ”+Á¶MA:7Q)˜Tª"Ô³Öz¶$•ZÚD¹ U¥;½Zz±¸Ö¥Ð[ûþü®¤!Aøû¸qýƒd™'Š R§2()漺Wþ“^¼Âê{M¸ö %fûÉÅA|ÑàM%(¹|Tò¯zPþ¨“»„œFQr°p¾Öy\Èüü¿LªjqY§¥i9,W²•Š(ÿ3ÜžDé}Tl«jÎY4…+ç羉œ:¹gÐ++wQí*i+V…DŸÅ¯Ô»EwoŒ2:p–2ðgíÙ†B+è„á,èu˜y,¢¤ë…ßÖßaô“ÊDPWP—e+óyuVΓÁߨÎBŠì’]qɹ×smÔØI ß¿>4k$´ !jKÝÔÁ{¾jEçÅ‘æòKÜ}lßÂÉkOñÔüº_ëß–ûqGÑ/k¯²uJà?áÇÂY¾ÿhí÷æŲvÜ”–{NVpV¡S“.€\rm¥½Rѯ!W0{Ųø˜†2V˜ù dä[ ©|ñ-Õ” c׳<Åùzïo›å…J†ôYú†ù2 I–k/KÅ~*â >9•}VKlB@(©e™û ßX~Qm½, 6éöBDæ÷~ÕŽo:3 ' ^¢Þ¡ä´ÛFðÇzÿرpáˆY¦ÂX ¢ ¤ìÅViC8W &&Q"öíZGÔÌtKc]r?¸mâÑo‡6šÉ›ß¨ä¡MΰS ÄLS£#ÅtØ àu¶l¥Bœž¾Ku1Lå<Õÿ•«6e¤J‡Orq·ii,‹Š’ÛyS#Õ´€Á;Ë»=íý׬Ñ=_Ò0öàÅa!&»ó~ -;ã­Ï]ßȃµ/Kjõþça¹ÿ/O~ú¸™@†ü¨h³/Hê>eÐdr;š5ñúýv&ñâ!FS_ü¦w$o±Õ*»™±ž4l^Ml®ú5 ë(5zC’vr/´ohï4Ûîü¢9Î{·QŠ“¤®õ l®…ÌÌrqH]–zµÿtND¿¤}¸0pÝ»ˆØ6jÖpZ^ÎŒ™'·ï8Û»îÉs*G/É/òVœ9ïÆ`µ¿¹ ø—æƒÓü¹ø•ÏËØUœ&ºÆ´‚.½ õKóïÉ+²Ó¤Ž”’„,„V–?¹7Uÿ§µô£¦ëËûŽÙªf°-;eyë÷_2’½à÷¢\cõÞ“ÿvÔ«)ôðìZŽÐÇFÆâÿ.¼"4zp-+¿]h´re-[ùʵ|ûì#"§¯övþþ ²Ä>ƒendstream endobj 293 0 obj 3427 endobj 297 0 obj <> stream xœí\YoÇ~ü#øÍæ¤ïã%@l'Nlç²èFâšTdC)K¦å×§ªúªžéÙ]Š’$„`k5ÛÓGõWwÕþp"fy"ðOþûâùƒ_}éOž¼z N>…ÿž<øá¤'ù¯‹ç'Á ©àÉE”'gÿ|Þ–'^¸`føòìùƒ¿Ovg'±³ßœ}ohÙ½áâ,¼tv ?ÞêÙûåôûœc &N¿Ù©é/»S9c½šÎژߦ§Ú„éKx*#Lë'«ÍðRqV^/}²Ó~>ºéo;)ái°ìÛ?Á2¯æÆ?§ÆÏRšéø4D Ëàøõ^p<ìEÀ +ƒš~+á+i› ¦‚´†WlœíN-¼ëe˜¾Ú©Y ûþhgf­`(̧ÐR»éÏøºRÊ96ð¬Í™·óÒöØžòÊËt Êð[8Í×pªÅìeŒé6ìN§Á‹K¶stB•;ûãNÏÎg§ëÝ©ò@MXý2-g¢¾‡zïõôOøšžùé |tnÇM?Âë!88ÇwíÇ8“˜-Ðæ§5³w*Lçp¯ÏÊd7ÃÁ8äª}s‰ËÄÙè8]5LÀ.íô·âœw†|Lc”60ÄZía{§p³vú€/YFÖ ±¿Âeíl¥ÅðÜÞÃw®ì6eø4ÿBÈ(¥œ•`¯ðú¬…Ãg*y­Û·ìœOp“)?=E¬À÷’Mþ†Mþz‡\û¡­½ÜÈ´‰Šhsà¶øe«?î ZÀ*6–«ÝXàÿ})À™Ry«sÈ~WIsØs`dï<š&õô9± À/_àõ¥%•Ûv™rN‰X€‚óÛØ,\¹@t¸ißœÂ"Îð¼@’8;à àa‹˜§c7ÈŽ.N¡RBeb £–Ä~šnD9¸Ø«^°0Ë/h Þ ç ÅÁ»º¨1ô Îé-ÝFCÎhΰ¢4 ³Dim ©Iâ|½#1¢] Žb›a̸¦1ž—ÑíGsî‡x ‰ÐÝ`•‹ú´}ÿ‚¯T‘ ¸c[¨>Ó½@aǹ&êÀ‚<ˆ;WÏÀô¢ôN 4Ý=û*ܬ j9D./å×M\á˜ocHç~ÒÃ÷q¦8{Cm{Žƒ•‚á> B P“ÊøO= `ô TÔÆZ»|%ïÁ‰óvý Q lïpîH™#Ž–w \0ájÇLâÌY?ã1½üb/̯{Õ!°~x³ .O 2ÀâMà`#ÔŒªi°s$Ü¿B™od ˾¿ÎR\@¯ô´®(j 8‚itt³~_€µa —°IiV¿ã@«[= –uô°¶w. |$Wû8ø²³uNñ¸½_\x2°0`OÛ%»…ê¦d–†$ó!ó"Éè2&›&4‚+C{re^àHn^heHð2AÊ‘xF=`3å†ñ:¥©2BÓ…ËH fññ€Ñš$8y ~[)ÔPc%ʸ覗絘¥Î˜¯é­ôÉ‚~eFðŸüè_T{ ª|4\¦3iƒòö¼¿Õ Çøúè%^)¼gT{öÓYL‡$&€å‘ʤ¿&êl±Sš4a;Ÿ¥׋ÝfýdlXHè&ñ¢ƒ7š ân)’q µ G·fúÇTañ‹vÿØÕ§ ^Á7ÑÓY&™æKéÑ4ü\ôâ´#/î§‘¼¦Kp£:7ŠX?›øÀy@5F;7éé=øøöæQ’áàÊ.ìð„[ÒÞŽä˜ÛÐH™b<^Ž$iÃr!©“EQÍ Þ,Û[ßÌ,* Z=ÞP7G–áxÜ^ŠwŽeŒúo2"ÑÍôpà®5x6ðÖ¹™üÞ2âô†”ô‹½¼‘ç²Fj‡E-äÌ€>eHºhh*£h?ß ±“€t˜zËZ%ÃbC<3KHE9Wì¬å¸s÷Uiû)º2‚z+¤E™èm*þœ ®º0ã{uÅvCñu‰k-x¦3@Ì¡t8ÄÆF$ ;ÈôqŠÅ‘š3Dd”ås#ÞÉz3€E’ ¦¢5 +ˆm}_åˆEÖF€UÒëfî%ÍM⊠æ`dá‹Î¿I÷îp-š<ÇýÏt’‘[:ÈúÑío#µaö·SEFJOXLW™,6L½Cœ#™éð§$ˆ‹Šhxþ I–€–„zÖxÆHõ Š_cБ <ð?VÔźjS¡|Ô)|±²Ôr¯wiA›‘µ±¢pß1Öœ6޼„CÎêâ>ŸôäaQÆ2ÍÍjSÜä¶¾ J­(´¹l¡£e’ г0ës—ò9`)ðäòHÁLÞ˜ dzãw°$ )p¥OsX)§¯ñŸÇÿ}V¾À(¼¦Øðô þ|»2úÿôÚœRôÉ—LWœÆ¼ÜÌ€¦Ø˜’Bb9¶‘¾þ©}}^>£y¼‘lž‹6ðº>|^>¯Ï·WuÁë×(Ìœ%µýk¸)%H¦ï~m†=¼©_µ‡à(ç§x¥U³}ñàì—{î®Ý]ÑàvtODM7B”ÃkXÓâe{xÉO[>Qˆ_D¹;~ #…”# <\ICÐUØ_„5ïí"öR¿qÆ+( ‘ú?È9—£­]Ôß³«c3–ŸHýá`žëÑ<œ-ËÀ«Ñ&4´È‰—!oös Ò:,pQ>.€‘SÔÕÕ*uï5ånXCrÓôK‰LßãRî&½T2ÜÆ+X2ÜÆ£}¶2/îà¶‘<¹;%¸qW–kçët½L´0z#ؾrbÐaæâ0DÃ.¤N±Í¼Kö‡¶ÅªÝÂϪO'Uµ^ëµ`œðQ]ŠA˜”Æèq\‚zë$R9f{¾"ÃíV¶Üòb…<|¯¾Ù‡%ÛÃíÜA¬¥½–dÊ­ò)j2ŒI®SÀ«+¾å—ŒݫæÁñÔþÜÒwë !ØÎÌàn)‚½Âb(¯3„C£•eµ‘ˆ›Aþso:l3fXÔ¡¹uµMJ‡Qm3L‡áíeÍï¬cÌ_*Tn‰±>ÀÝçÅ@E4?›øbjŸVü‘V"" ¹™ÝYäÅüõ¢M5Š×”„' ~ÜÂŒ ÚTIûÔeÌR±ŽÆWãqñív¹£4P‰o‹üËrd-Ež@®T/º [‚ã¡|ØvþgY&ØQÆ—bÎo$ÄJ”ä`‚¶Žüú#bÛ>œ àêL‰ýfèW?§p”ñŽfè†ñ^¬ÂäE½ÃýW_=å­Ud<FIN1•[+"ÝNÌ:Fo܆cÌi–½›<@H*`š”†g–‚*è`“¥Hôñaæ`%I ´‚X‡ÂJ`ê|Ž›µÒ40IGn°©ð?iD(H#f#„²!]…Ò¨ð*\˜=Ìô¨¬xC´Äˆp~ÄÞ`ó´ik&RT3謁Üöõ KýлÀ3šù§ò(+KY$ê²g3.W€`’BÔ< „©î8×ô)­Þ]Û€DÔJŽ©½úëmТëÍܲß-9V b†åѹ²RGà—° eŒ*E¤Þ¶€Œ)+Õ'âÖ±¨n{¨Ÿ[dvl¦'õ ²JWõ¼Ï®ãõ=ÍZíÉ,ëÌ’Õ¥lIú6dí´tsAr±ž]¦‰¿r=2‘­"Êè…j^%^KiÝå(›¶}}fâº6RT¥4ÜÁœ‚¥±>oQº0¬»ìlãQ&îÄ$kÂïàJ[Þ“~6*%œnUFd䪌¨uäú}á쟤SKf(—HîEÈMóJ“ÿݱh®1-ìЉ»¤z•ÎÝDJÚ’!•êF°E®øÈtR°&±Øõ6|^ÒòôkC×GT*Á{Ÿl˜Vx‹K,ø~àNîòÛ(cû ˜E"¡‡/­{{´Ô¯nBU¦ló°Ðb±ðÐ2E¼©M_¿ä±†uÝ_UŒ³ºî/ðêÓÓG­$÷ÎåÝ›.P.`Âz-ÓkaõR ×@¬I‹žÅƤÝ ÙíwA(ëÂyåÖ…óÀ8Rí­›ÇšÏ¸…žƒ5óxâÆ<¥æ‰³ï"È‘Ê!ÞR4Ó…lUËSÀ3ÅÝjÌ­K•cé%ºéOzÀn­ÊCeÜ6J½ ˆ£\_êX²ýjÌò•E­j­¨ï l¶DÃþ£hC¶X–Á´Aùô°^žE˜»oí¿’¯úqõᾬɓŸß=?˜Fyê"P=Tô*}ô‰jê]»V05•¹n% ¬›ÕA«¤‰©1j]Ða… è‘C+nß§gB×§g¢§àÎyÚÐ]êÊ¡:ñC϶û²‰ä^_Ï 4$ÝféW¸Ù¢ L#O3a5¨Àu_ áR‹Ý]Âõ2¹LKëw—­Qˆí…ØéúX’ì»ò¥oÚ»MÌ@äù1£Dÿ¬˜¿j|ßìbN¶Â๷ÔîþÌâQ 2`X0°‹AÓì"26'¶*±tRÏ·kúã'@¡”È“Œ½ÅÃŒf#?/SUp1Þ¨„?ùD;/Eç+t`,®‚wcñ`:0¦kh\q ýΦìn®l&;C¢´•¶Z¬‹UÇß):"Œ QÖ7?¾Ô’§‚{'`ËK¨È§Ò…*%W½Q”^ CÒØ¿£^‹èy¯…¥)ùP¯EôwìµHçšuñÂ’Cë’cɃÛmmßÀDaц·¯å){·–‹´¿=„¥8Qqk°íqíHvÕ¦ñžZ.¨¸ðØ–‹ý)©Ò™„‰zõN{.\J!î¹(]K‡R[㦠"Î[7] º±q¯eˆ÷µZ¤ÊZ9Ë®àœer ±Õ‰–…®”<¦ç‚h¤6ü¨Ö=”SÔîVÕ»ÚªÞ}ÝL¯Æ+ÏÖŸrM‘§ç‹EøÉ8²Œèº È)Ã#º. @Û¢u]à+Ö]©Áôè® \6†=![“.æ.¶µq©–ç–]ðöÛu]ЙâF;Ó¾n‹”þˆ­´ìpó`uógPÓ6ÕÒ=éRéÍûê¾ þLu ù"¸šÝ7_Ü7_ü¿6_4 pß|qß|Á›/4K*t±Ïûæ‹ÿÊæ‹ÅÝÝ7_ü¬Í›œsß|qß|Á›/ªÔÕï:wRz$6.ò÷Ç5\ØÈc`Ê%Y.l wè]v\xq·n‹üÓ‹}·EnãXt[ !|g:¿ßn `ŸÚ-ìzÝn“ÑÖR>þÚÏ(ɼê1èmOısÊ+æ>”P·ÿCÝ7«s£­:òë>h_ædÆú›‡‰^ís3YÀO;;±4l—¨A8¾a&nFµ£_SÈ/ž£ÑJöÏj}BwÏ,+ÔÖe7Àº4ò™°ªA,‚CmQ¢Sz÷©Žg;ì1©ª}ûŽè×äq¢˜Éw¬†(6±Ú_”ZV{šÝ;EÐëJ‰có0©c‘‡I­:š±Â—y} @VŸÄ#š]³ZEøgzÑbA%[?I´ÞVmsÉøQ[ÈÌÀkÓ«³f[×# æ¾n¿·ù~{öà¯ðç?v.endstream endobj 298 0 obj 4590 endobj 302 0 obj <> stream xœÅ\k“Å‘ý®Õ˜ýÖ—ÝiºÞUÞ°#°‘ Ö°xˆõkcc4‚°t#Æ¿~3³^YÝU÷öÌH^ÄUwuu=òqòdVÿíb™ÅÅ‚ÿ¦ÿß¼zòþçîâÅë'ËÅGðß‹'{"¨ÁEúßÍ«‹_^A#%àÊ– .®¾zŸN^X¯g!/®^=ùódfšrvΩÉÐ_.³\üôáA¹Ù-§a™®ðœ\诗Ê,Óï—fÖZ3ý ®ÌÎK¡á¦œ>9\Êé7‡K1{àöïàÚGÐDÚYzOMðÒ‡pIÙY,núâ æ¼醆'¶Ó3ìDk¥ýôëƒÂaZ—zø¶NmŒ‹=j7 ÇgõIÖþå=¬çOppÝxÊÛÙhøõAiùùárÇ·Xvõ?a8ÖçxOWuØUÞAZ4'üÿ\ýv 6‚íLb^õM_FSa`²¬Mwx?Ä)*l]!é›ú {eÙ¯Ÿðø$ÎëRúyZ±!ÜP"À~d`]²a}³Û´ÓV Xƒ襾Q¹´©f yÀ@”52b³—‹È[IóL[ ›Ê¶$kn%èKU0´àhïŒQ¼iéø&ÿxYžÀͨϿB}´V WºmìÚ% e¶`Ÿ„‚×W«™¹C+UîËY\u0Â2oa«ǺÀ ä2rYÙ—x]“óªZÒ ô0qm¦¯ð½x5.ë¢H ÈîUvãP0›æ yÇq`·½hÍØd­®^¯q"hGÂJ%Øep…ôè±3qÍ;¬ Žó\À•pá=ÖÞâb:¥Ö‹ÀúƒÛm®’–ÇâÇØRH.ÁLøÐ^ :OÀ|è×ü!©e6vzZ$u ­Om%hÐ÷8p §y³Ø_U¸*×ÇFõhÁ¬e’]G^5£\ª–KÕÊDˆ‹B:A®&® ¸À0/€Me¯Á‚ ¥†ù+X*œ?ë½µ² ›îvnʯ"O{â‹/ð¡ÊýW—½¡tQ%§1ÅÇ:b.otͨ¡¼)ãaéÌýÐȬd˜þ2•ž‡ï€õ2°2O»n&Í¡".³ö€5åfçð­#󌢠@E¬vÒve®­†‰»v{eHêÓ=Ao¶@#Æœþr(íþ{À%“ùÛªâV˵ëFHîÓl[_0²Ï\ z2Ê좞,”Ú´ö­¨<6'þn0©):‰ëP„êµ¼Y A×Ñ÷oO*_kó{ÊwÓÈøÖU!Ž0°aÂò a[æ][ &L°…ˆ§÷Ô3‹"¨÷ßЉskУ;Pó¢³¼çÍØÓά[nÐKit] ±æhý+Xì[bÖ3Û t'%±UdÔ™®ÍgÞtú­Úõ<î°Zä4„GqAZWÐXBœ¼c5A0 ÒÎCË*«ÉƤ(M‘±'=‹Jzµ²G ˆ­B¶r;6ôyÔ¸Ú_Äsn»TBÛ?tä1? Ž‰óuÁ.YúL²> vöÜßÅæ ïu} î DŠZɇ¨tœ$3­¾0¤,Ñ'ØÙ9Vsû"îö"Ì8J ih ÓþˆÓSüÁÃW¸¦ VêDŸ<Ò ’ éœÀ] [{›¸Ï&ã%kçk5žMþo÷_sÓèП㠶‹L²ÊPþ5ÿHU"3l‘Rо¡ül‰ÇÑ~qY~ ã!L|ê8X‹Eä”qm8øó þ2 2t©ºÄÖÅ¿âÜHE¦ÿÅq‡³§Gb›»zÔÖÀå0ýæ#ÂÝx]š~_›^÷.¾)_׋°é*ν˜»H²¬æùq;Ï?>pž?Ö·ß•6ßÕ‹·å"Ͱ‰wïlÆÄÛ i›y»Ù«€Ä]˜Cы̔ӋIgR†ÉGçfÀ^åñÄq¨Y8p{i© c,ŒCÁU”d$=²†=ô’ºG<÷Myѱ>ó""?ëù3é¾°ÑRôTÞO_àój‰Â÷Ut?7ýï[èói½ÆZ–ÛÔ¥Ÿv‘±]È–ÄÑ-`Òˆ J:âÈð!ðb/ãŒÑ|†æ Ìl`#þŸ1VAˆÌ®¾‚U´nÑ!ÔŽê"Ò%—†@(¥ô^»¨–,Æ)`=& FòÞ%M ÏÍüèϻQÇ=,{±4‹vÍçÓÚåŠ+HcL&]BHÖ¹åjˆ![œå]<4?Æ4ö5 QÔƒØlaVpù¡ÀŠIdÏ qñ‰w%à(Mˆ"R0ÈÅ …´ðBK~Yd©Â&§ÿ(N€ü¾Â€”ÄPŸ>ÅtÀyÃ;ZÇê¤{à×X[öWñø± ÜqD¶£ðH#Ü@²S%.c‘Úü:f4.Óòµ8IÅë:o¿%t9‡¾Gþ¶Êq÷~7–Œ2f}t'0h!¨ØF—CåY5Ý‚د5üw†¡ª¼Á†Œñ¦(Ô¡¸ˆ 9ÎÜhþJla¹Ñy5½ÀÑí•D| kð).!μG•rb–"-©¶aTkc¨¾®ðëŒ9Ç×ܶ _›_G¢¼s&–CàÚ§_¤þ¼iµ/mC@úÃl2L߯tëM?æT.âðÛѬz• EZ«VƒªÊ¤×ãÃ…XQÓ/4 ÙÉߢ +ùÛg1ά"“³Š§cgÂØéO¸€˜íU<û9zg!l(’±6#áu—Žr-•]a¹ÂµoP‹Ù±‡/2è¡?P Z!tŒuEõhM($Ó&Wú¢Íi­ƒi,UÈ€=e,Žé%0Ðmä’`Pk3tÍlâÅ®8e fÔC"$ÕM†‘lxßGòf a„é;® "°}^$ö\s‘R÷èW”úæ*¸c‹`D*TYù54ÏÖqßhQLû$Y±r"I Æx£M.uýE³¹°è’¦ÑÕ§&™Üæfi‰Zl•ôY© ©öäù·Ãˆ\Ö°GÍnªÔp!ZCÞM³ØTj¼(Z¨=¦5é ~~ Òs–°' P~ꯈn¾ìq¯Ä,—uéâ’9!ß 6ì!¥°§´ï@1{Pê¢i±˜é½´À¢ã¦kš„ÒzJ%KžE‹ƒ“ü·ºæµ«è~:¦Æý’¹Gd}I2°<ÉœŽ\(u¢p?¡žÈ„ëé¸w2%¤YŒ{œÃ«ƒÂ“m`Þc‰f=M§µë ÛíFµƒ-zg f¬»áï±Ûô´]\”´§sž€}Ñ Ýç¤t#w«Ôæ8»G0e±‡ž…þ3±láïŠX3d™ väòg‡˜pö”²l0-ɺtYΟÅnÃ}(SŒå?¯A`Áûã¨fòETü€AÊEþë„ çýaœCÛÜ«™ïØ(wÛš…t<1gê´N'­ñkæywK}òguº¤S%{"ŽŠkÓ‹,S…ñ c¯y•šŸá(ß± Š4ñ\ñ® FÜbZm‚â„!R5áËÒæË¦R³>˜/þ£×ò»rñî@1&ˆf¬ó¤ŠG¹¼íjÇ…RËX;Z2ù-Í<Æ ZDÌð`ú,ÊɲÆÜ69¶gÍ‘Åùš2-¡†.³SS |#4tüÜÂV#fNZR°gùY°Ò²Ú-”$êÐζJD㷦ájßÈ4…møÁëE Û!èm¡•9YkwÖ *æz%ÀŒ‰ˆX,¯²”¬ö„Z'"ÂÙÐ)‘ªS&’«Ü1×ä7ÀâŸIW¬øî]AQô†šjè d“Ï»]/ub „.Ê#éŠíÑñ!]1¦¬{ÅŠêßhe.ü¬b;øIÒ") xUJþsagµâò¾îô/öl9uevç^ÖBã‡}Àª¾»ÁHtou§Æƒ8žX ÐpR‡Õp²"Ÿ!7Á’ÞÏMäšËú™ž–¤ Ívæ1$E\1¯Û´=ì:™äó%œÃKCéÿWª"ó†¤*<74{© ¿ìÿ¸;˜ ÖuÍc*ö*rùÛ'+p—8‰˜\´©qµÉuÿ`r"U{®*SÖåöíWe˜^ E˜Œ¬U6ÀhÁFç£gé‰5Vÿ§ÓvÍM\=†› F‹¸ˆx†oM¼êqŒ:xÍ{Û’ /97±}úª_]âÎmÎsÖCžÈlÀÊc üîÎsž`8*/¤üù°í±¢l¸‚8]OžîѵP»–•æÊöïˬ4ƒI¦KÑÔ¯l‚_öžÂ§ZÆæó/¬×3“§Š¨bß[®D[÷?ûuölWæ>j¹nƒàRIç@‡¦¸fu*có™®I³6åÜ×:¾k>©Á ^â´Œd–…ÊÚ†ïªÒ•cÅ Ka!Uþø7ïΆŒ•Ù€O¶Ú2à¸F:M¦Q„k <•„j}’# ñ÷k.ž*†°äA†Œ¾b (R LŸúXjît H‹X Œ_õ±é’$ Pð7y¨ë³ÙOl®«Êí8âíú{)w9‰Â>“לý¡µ-¡«kR¾ÏØýºJSOØ”Èàj*û‹£Ú” Žzß—ŠbúWß/ÛOñ…h=Îõ]‹£X"7>ËÞ—øÁÂÇKËõKM}_à&h\xtïqå÷æRÄ™¸1±¯Pšé³ü6&µCh8—Ö¬Ïf5ˆô˜$•U{ôΰ­ŽB§ ¾õáÏ”™_φ+1ˆ612*ãán£¼´Üý¶ÊmysÚm•FW®òÇÃð(ãF$dÜC§L}Њâw7胙û"·Òuc@ˆgŒQ`úþK4Bfº„‚i¤£ó[ã“&‚öbçgÚƒ4˜3vV}&­ v¶]5ßWR͉ø\²Å=?ü’œl¾v™™f·’Î3³ª_TdµÍÏ®žüüû²ëendstream endobj 303 0 obj 5214 endobj 307 0 obj <> stream xœÍ\[sÅ~wøzãœZvî3©Jª’`ÈÅ!DŠÊåA¶ÀN!#ƒ„Ÿî¹vÏÌ®ŽNR©ˆãÝ[Ow}›ùúl]ÄÙŠÿËÿ}öòÑ»»³ç¯­gÀÿŸ?úú‘ˆœåÿ<{yö› øHHx²„5ˆ³‹/¥ÖâÌÉ3ëõ//^>úûÁÍAÍ?/þ-”`-lXV.®àÃßÏÕâ\âð»£XBð:~}”‡ŽçbÑÚ8y¸hß2ÂËÃû0~âa$eò^BWÐ@)hbÂá“ã¹¶NøÃ§G¹¬«yÿæ¨%áSèOI ¥²‡?cs)¥µäËÖgžô§G攇N¤]Оî úÕgçj]œ!íÆûÐqìɯ Gg]…€±áŸOðÏ?ø÷ÿ|…þ…¾Å?ïÔ¯Ÿâ?¯ñÏeþN"ɽ=|Y¿¯µ3°#öð+˜©\¯ë»o[ƒËÙÃÛúðu{øcyŠë…-0vn|òèâç'-ìÉîëÒ:ëÇyNWK¾¼f$°fYÅ›!Á»ÃþÒ-×fñ*ø¸ç¢î¹>ªôu'ذ7HÀ,§ïozï€ã>‡_Zƒ¬ÞJ¦ƒÁE—ŸŸÃ‚XŒ60_,pì‹éû×È­Æ8+ɧßU¥ìªðÉ)ÚýóÔ|ylmnð!Ì=¤ñ cÒÆ‘ü $Wé€ š–"•>\¥´¹W§öªWY”4ª“z~dë®Ï¿À ÑÚ®áðvk©èH›«¦Ò\´ñ…¬ø‘•ÎÕ”òëÉðÿF]$¥B­×]—×ÈbÁÁZuã╼– ù¬¶½…^‘IÔ ê´°YÒK\²µÎjì ‰¦ÊÓ‚–ºLT+¢ªošŠjËߣ†€Žð§·QÕ§Ý1@[ìèi#Õu,-z V …¥óE­M0í¯•kÀežKØ4#ÏÎQ‹˜¸Þ«¶^à é‘-‡×I½#è¾!ñPm‰LSü8s¹’ôpy¤2óy!ãÒ|ƒD€€n 7m`‰\]rvDî,=x4®îDQš8ãïŽF/ÀÞ>öS¹å–¬€,:Mç ì[¡ ÝÙ7ÁÌ+øš¡¶Ê3ä Ø0d“/a ‚ðð„³¿?"ÖKç m 5É.-y3ü~±"lñÉ¿gøÏ›Š€_ÍtöËö°5$Šü«úðvðKÃvýo€C®*Ñ˼àÛÕõ&pDu.OäÖ¡³›ØCø™µ'Aª]%9D`?œ^@ëüÔø`@?؇¨Zã0|È€S´wþ'ùD‚žÑ+JC /]x “´RÖÏ(µë ­(ÆUd¬)jù¶-5CŒ®N@I1m’qSÑD Á>-pÙ”‡i*"å}€&C†[”f€Â(Ì÷}‚ ±V5iW  @ä\dÞ‹Öêý#¨_bF‚ìy¬úúŒe-˜”oEøeRÈbo—ÍŠ~†’Ö·GѾXÉ3âù°ïLˆªÏþ€³Ÿ‡¥=˜=¾jgkp†êl+¨Ï@ ±Zò0ÊQðx1aç×ø¥Œ¼‡ÏÈ{åS­'ø ‚ªÍ«g@h|ا‰ûd= nò:#ëKPx•õ3Tëjw ¨F&ÌPº„ó^Pñ’&ô)¿NX ˜±Z[\‚Ûêœ0ržÿyõ p„ ÑÍÌà]p;â8òØ'Z…¼‘½3xK ÁÛ˜ ðFÁ:²0>öf3œlT<Áy­Ñõ¸Fãj¦K³^sdÓkƒgŒ+®3Ë‚qØþÞ €n£új¡j» ÜÞ¿jì„܃»x8²*pT¨H½Éw*™qí}Óö·3½xÅ=™WóÌO„VŒI|™&‹|©UѯùÑðÿs˜¨4@„§%šFùsÄjwáÖ†SY5+ØÌ#ÍàïÁNŸu… ¿Ê†-(ôÎv¾LoÐáR)fvÂZ@¥¬ag-I7˜Û©µÛÇÿûøÛÿû˜”6‰q¿€R!˸šM!DBÚ€¨ãP7®q;Ðvx30°¶²s(Br²0ƒÖsÔÆl MA^-àòþ’|ñÂJ4MÖÅ)¼NjÔ[4XÑm#F¸Äèñ*ñ¾AÍ ®½Výbà%ô`­wÁÁ¢À|q`è°O£)ˆQŒQÀVêòàƒ;öûM3+Mk•\ŽŽÍða€9’™ÿ »5 •¯½ñüI¨|€¥?NÆ(ÀÀcèI©2 %B˜‰&PºaYÖÚÄ*J ‹t]¢•^V¦$]âï¢ÙF¦ôn|oEŠ;ÔAQ YK§·íçÓö3SB ÐMí|›f*ÙTÈTëôÓœ½×næXªµDs‰5ò¢Gí‰)ùs´E´‰“vÛì ¢c‰jD-M>jz}l`é’÷D|/ÖLCûÕ2V«@`ဃŸ JðÔ,áÆ'ÊâŠ"æOr‡‰  ¦¡âÞ*Ñ]Ø åDjMWE¨U;ÊNhœ Š¿W%½FÝÞºd&øù=+詘)d\òóíl°¥¢S-ÀV*Þ³Ú è’,Õì@U*`~ÒoZC87´«‰ž§U‹#¶­ÆÌ–,q‹6t¢cX™ù¤2¤é]#7k’$H€“'~Î ù¸cš§V×5§ò_ÔÞ°åbµ•O}ˆ±Ç.¦àlcs?1ñc¯p®"hµYp1.ÜÆù7q f¶ÓÜʪ{yÃC,à2 !îüÜk¬A!±/VhgNá6åMähê](g¢˜:‘£¡l0ÃOÉÆ³AOm¼’¿PiƒjGdR`ϹjéÏÂU]è˜F9RØM[Joê6f‹5ÑÕ,¸N²µ q‰Ì´67ÜEΖ¥(sH†Žàtg²Ía7¯dò&A¸—ûª E/“èN5ÆÓ)!}¤%™-fµëMDì :A«g÷àIÄ};±†#>#hR¾¾å\ߪ{uÜkó¶o‰{‘džu'’ ˆ£0›“A¯IY—@ÅšËfR!$$:M8#~8 Za} M‰Ä]Âä*ç¨vr%y覀I‘BV„ï3žˆ’X$øP¬xáŒoÍTN aÓìÚ5™ù® »¬Q¶´Àøö)‘ŸD¨A$J¬üæ8×™½\Õ€¾j …κ¶4öÙ7k<ŒöUG·˜)Û5De+˜óü^¶BØà”ÅÌ+ 6Q]€°Ia«°‰¤P7ÙaU1ô÷Ö Îq"Åá^yÀŒñ¤¸&±ž¼jdç&æ÷ ™íeÄÃ&{ âƒ!Y jßVACô $c密ixtxÁ'DÖ¼âbACïÙÆ5Igxôh0³'X¯uGœæÙ„™È‘ aL”§ú„q¢NÙÂüÈ|’t`IL|3hlyUæ&-ÁĶchޤç½ÛÈ7fÊñòh:OK—ˆ:ù‡ £œ©LM°?£xœÑl:ex‚L•¦6\‡\¨8ÕºÈ!™¶e••‰gïDvXÉš¹ªÐ$ÛËó÷E*,E+ò@ü¦ù„úÈ„œ ÆR÷†FØÇ>ÃltÈw 'W/DÞS}°™uö³#Úà^Ò4 %׌D¸ºÇËsÖï0h†¹]½„!ì¤(+隘R’z½iøä±¿µrÞ¢ÝKC¹GQÌ£¶…!Qñƒ'-Ú¯!—Œ¬SžÅjÕv'ïyS)ôqwö+Ê®Uxˆ›j/®—MËM›6—QíéO4ÏRjõ$%§ÀÓ+$tX¼3Z9FâGXí¨tœY\¦òT5aMÞ«±AˆA m¢)ÙÉÝU™8o5¸Ð¢oÛˆª!:ê>ßÌš_ͤØDäûd’bÎnˆW“ÄÎü¼‡å!‚IV‰Š8u¸Ô$騳r¾OO"Ûè<²7k`F"q˜¹Œ1ø.ƒõp“‘„á"½@É‘8ä´Ô²e¡?jØ_«gG#–1êÐ3“cD˜çÄHȬRü‡ Ð-8•è¶ÊÛÈèI„ËÜÀŽh–ûLçÎÙÍ~¤=¦½‰}<1™ç©ÜèwZ3ß…Ç3A8³ò“t`aDQòbê%7NtÒ°6ä]ª4•ßËÓHîc2ùÔšä&ë"%9ˆÜ~M˜rLÛF×lH e¿å²ý<í ŒN.;™\Ùáq“6¥æVš¼µqʼnæáWSb2IH4è͸˜ùÏÌßœ’®¸ôª«¥É̱éŒåîß&mî(inÖ(RÔ ×Y²oÙütYÞܪ õeºqaÂs”EgXjMvÁž7vÃ…Ö\°pÈÖÅQ“!\S¸E9KB¾ƒ;-ƒ©˜ôƒY­Hç5=Só+Q¢¢=íÅ—;qÔ|²>·x½æg] ¢œ_¯™¡KAI=aqf+Ô=ƒC{[ÿ¼åþáyM¢‘ñø§¶’êï7UFP£Ÿ–—ø xygHüŒÛ‘ûXn|Õ²Œ$‚Äú8]p…sîX§×¥r&¢o{åé‰Ü×x´±ó!¡’+eê1ëV¥ÐUÓÕ†m1µ "‹ÍöËòð´ÌpR’!3·Ÿ¦>Ò;Å¥¼›"Ô>š—%8ÚZß‘Œj=ö'i±bojÄmD-I’7£Ѱ…{^h'¸ºø²Fmy´ ™ºcÅ¿.ðt_x)v¡ÁÙºÚ=«3(Ìš3}À,U–”˜§f—gö­‘\ëf1›ù*ï†àH9Ñ`zš*Ë' ŠÛ˜¶Ã¶/gù–þ–°tÉ]LX¥ÐÅrÝN†*·3¬òN뿹Gr…z³EŠËU«'¥Gùò-¼39ÃSî)›»yù¨ÀCÝ”Y¸ªtÛ_ܲ[jMİ ÊìÊaäFIòŒU¢Wîo2Ã(‰ePB«³¹3e65Þú#=Èv$õvÃÍîÝ¢dg@9`nópÀ 0Ä’m “2¸|ˆÚ_çÃÎ¥UA gŽ`Ô˜y€,FNqÝ-Å ¢œ]¬ Y­åìHó dp;‹Œ2r51ÛˆÑ[.ÛŠ„PHæEUY­j?SÚ×ÙWµ*°Üj }'Fl>± ‹YÄZOÛÁâbúê¿#`å OˆÈI©='“/›ë®×»,¤’ár­!Mv¨T<Ç/Ìnê`7†ÝRÛÍôÑ5n:bk*§$¹shŒOnœE³´¤Ó$ándà…aºu%+$s„€ä Š HÍ2*ìg%uï[ë!öÌ]~rvç„óo‰ŠÜÂ"ñ¬v¶lG“±2»û_.Æ"°H‘¾ýSkb£2§¿À¯^ã’ŠuÄI÷¥@œïj ËL¼5b3,!ÓнóCˆ ä¸ÀjØíP$.ýán8ÕÃöþð~ 0—Çz-f)•!•xSšJ–~«Ýž—O‘*rIÚg8Y{ï øµgN¥ó¸‘ëµ7ôØ¥³ó¢„§I.´Ð* ¤kË$¹–›W"Ìà'bš_ºWp>–ZµÃïðÉ/Ú­>e™ ¸áéN›Å‹¶l½1©·×¥a—{¢jÖŠžmݤãÐk»œ“lŠ~›:Š—>þèÀÛ*{ 0Ó+WcPòu‡s¹Ìt ›™PÏëíC„³dðcR+ð ~µNf'D me˜2iw&,_çØ_5º$D;„©Ç,µ,»>ÜC™ù°°€bÉ“†'d½@”5´ëÈPì‘/Í(Ïœ_—ü ©S!Èô™:I[Û2VÃ`ðÅÈ(‰;Û2\ßQ‹ázÛ@étä¦W5ùxtGÊÉÙ«Mûj®DËH^_<ú üï?eo“4endstream endobj 308 0 obj 5668 endobj 312 0 obj <> stream xœí[[Å~_ñ#önÄ´»îU‰Éƒã8f9Œ¯­ìŽ×Ø‹íüúœS×SÝÕ3=»&XQ„÷V×õÔ¹|çÒ/Çø_ü÷ÉÅÑ­æøìÕÑxü%üvôòˆùÇñŸ'ÇŸ@'Á ep£cÇ'OÂhvlø±¶r`üøäâèûN÷ªz>cDücc¬øh»/zíZ©î«~ÃkSÝI¿VËFÑ}B R‰î>vRÞ=è7ã`ÝhFMÇ} “i-µên÷ØÉ؃ÐÝ?p7Œ£‰/Êhú|»wã02nËÛý÷Â9×¾¯xÚ´¨c0cXTœv:Žšu_⩘“¶»c$‡ýs|Äý h}Ô³Á9+]<ªqŽ¥÷x¾{°K89œ[J§èjd;÷à‘ØpÕáÐ;I‰Ýè,ó¢Ÿõr‚k G<ЈLüîjgé"8“i !˜ßÙl\‚öãÉ×Àpí„' Ë0Z`‹“S`»½ÂŽÉÝ`åñH ´r¡¹úga^ äþ¹ßpËüó VÊh­Þ38å“üôØ–§8pÄÒW¥ÃO…>¿ô$‹taÒé5\§µò<±ñ¶ŒÃÍ™¦¶åõ+\× JJºn~}¯iŒ–¥í<=<îý^80£".n„€]ùÃ8'¢Øm(®#üð9†kG/óSœ„©HD.d÷EsaœŽÅÖòþ²ù5î‡q²½gå=û8ÌeÊŸâ8륎CvÀý8ø¤ESB4œÿ¬÷¤£H|Üai„SéH̉Ä,#:Ã<«w¿öJp1ÖOxž‡]•¹ò°t£å‚Y +Ì™ïZóÑE ÂÀzê<ßi–¸øÖ‹E$Ćá¹Fèñ¦ˆE¦GáÊgHî•$áˉ(l ;=â”òn¼ßhüޝJŸó²`¼Ñ6å ÇÕtf䤜³pÑ@Ÿˆbdƒi²¹Þ¢²þ‰”G}/¨F ŠŒÉ !G¸uB‚ÊÀÁMf#úñ/E’ngUy—w óþ Wƒ3rÌwD|Þô Û8›ð¢¯ !}Ô Î*GÁ4ØC¤2`@¦¬4Ÿ5Øq›®œEÒ) é³– ò¦%Y°ÌQné²0ÇÝ&ND-Rºž“§ Yà"+‰Û.ëÅIÇmeK6‘^€RßSV‘(ž²û8qcaî—án¸†!<šE)°3 €šËÛž£6©Ô} KêÀh§SÕ—ú<ðÅYoD4XE8$åP["Üe>B¥óçJ5ŒÎU¶!êŸmKþÊÓLðc£Ú+ÊÔ`#î›Ø/ú¾bë´u­—N?1‡ÅÈ4¨¶æ-@ÅѸ$ kUOÐÙi-€œÒ ÕØNPÆæC¥AFQ;ˆKD»X‹™†JG1–k5§Ø(€¼T‡0E¬2¸¤Ã£ž»ÉP†?Á¹@Áv;{Õð'—éΕ(Jà´ÿ˜Òsíç- bdÐ{äIæü\‡3`ön¤hžá¬jéÒÓ=nËÚKì»Fk_½$×°Cf™[â*³°¾ó Ú’ŠÛyì÷°JJý^µª$ÞùýÿðKm€Ë"MåŠêï,PÇYä/¯ý%,œØ'¡Ãj=„“ÛIiæzçÈ£xç\àn¢õG‡àwÇõí×å” g a²ð¸­èò  ýVký\é…¤@‹J$¸šôœi.tZº¢ËÈŸ/¹iT­—üeIEA}™! #^¹¬x²h¬ç­'BÁæj6sV"Jè7Ìç²ÂÈR€l¯°ìÆpÅБ=HX³P`~Õtm±e€¶D·KG„‚‰M š)¬tVØ‘g¬°¯çKð”9t)¼ùSÞ•¾ÂêéPF쑉¼T Eüïüb¶ã@èŸ.¬†ê‘Buà)»E ·C3sà;< ¼†ðw¦û=’”Ö«éëB\Td2Ì f‹ƒ"dq^³ªk»²£§ÙÉBA3©ÎÄÃØ¸° g\kdô Dœ¸z"öì®a“"£'¦\¡PQSòºàØŸPy“80îªÖÀkœÀ¬ puz·i QŸz”Ä•ZÇ‚ó`‚þAÐ9’Á˃72y ï0ÌËig"s8æ²ñö-• kâËÉ$VØé ¸N²@¹ý]ÜŠp ‚ ðe—pâ$¯ •äÐDË ûs0ñÑÕ·=DQO «Ì€g"ÙÉ­A ‰0µ&ÆlP¬Ã8Dé°FfT?Ñâs´²¡jÁvð#޾,bEùc˨çÞ%=g¢sìg=ßV˜l#¸ò÷2C_ȶEWÏÝî¹cÈ¥çÁÖ–*™LOþ®ëCò £bÕäÕ›ôŠ¡ø!°,m•l°ƒž¿€¼í¾ÄŸ¯p×ãðõóü⇯ðï Ž³ñþ¦Ó`ÿîϰG­?å9ž£L™ô®|j¼,ÏsãÛÒøin|•Ÿ^—×[WtLjü¡O­H‹ÌëwN>Ùqî;ÿcç¾õ€KÊ€RV€Ù«ù€÷¢•Š`À˜Hµ¨CC¸ÜNÜ”_Y 3y–UÔ“œê]kt­&1¿*-t5QiÝ¢»ˆÐ\ôpTè,æ> -M îD¦P ih£rH|IDcB4v/DŒ”ŒUÄ¢Ö jý= Ì·±éÂû"B»­VÜdK`þÈ8søö:°Ís<.œù¶%!…Û?m5¾nMT¯Zc²±u¯X™  ¸‰H†ÉÛE €E<škqó¿ó<ØÑë)BŽöUö11ì =‹}ëí8ä™ÊhDÙ§GÜÑz9Ùè¢ÿ=عŠs3jãü I²®1#Pj}^Èñ¶ˆ/wÕƒ…à½@‚3T:(úï÷²|³˜¾çj€ºJ©äjHŒðWî‰èJ>î½·Ë‚Aɬ×MÉ€i­à1U ‡QNcQèFp‰~Oš´Àòî}G¡×/T®lM‹d8hJ îãÇ<ûÇû3M´b>…Akv£à?_ƒÄø(ö(a¬ç@†]©„/ðoD DÝž¶°ÇE…=È3ÆS×ëðŸÿ›:|'f+º›Z´*» Ó0¿ôÛqÌiÇÇkÑí¼4žSbÎáÝu‰y0$”7‚„– ¬ª™ í¼v$†I¼„䑊©ªãâ‹êÄ(’X›,žr‚qƒÍßG4r[m[ÕS %ùXv]æûjÕˆ Ag\F !I™—KZÏçÚwÀÇØ}µV˜ s!Ãn`ÖI8MT&íkÄmÓé÷™ë&¡‘}¹Åw}ñqWGm‚ÀœM& Žp¶¢-eý»ÖôÊäIeˆÎgÁ‡8ÍEÚ£ýœ>Yp1Ó‚³¯åEO#“+(õ1máÀÜå‰Û¥Y¡)qG»4k’tA˜SIn (â×È’/2f¥´3Žs:Ì¥»D5qjÁáõ¶TEêóí>A“ø¥ æ±™ðY¸yµ`*aÙ[T }A¿×Tjb¥Ë’Ô¤EÖåÎc9GrJnY’·{˜êxïöl´¾ÿ½gŒ¡Æm× 8kHÆÄ*iUʤÁgÆû¼nPü# æ:fÅ/b©Ù’bJN%sVƒF§ªš½x†0NõME®#Z!HÞ.{jHG¼¢ÓFUáG%F³m¼ÎÅ1²]ƒ8+?ˆXi®Š0DYûWÂØUÒŒðš >’òÒFÔ(Tª0ݶåËOZ!Q” Î<ß[ÃCÖ¤>†…¢íßÖf4¿µøcÙS£Ä Ź\8¾l‹ÂwsjÐÙa¸ìItm©p<€6Åé ßõ±,Á­ QùƒÉ€â&U4 Ô]÷ /ÀÀ ¾>!|¥¿•ó‡¯õ}‰ÆÄR÷äCPÂ[ú¥h•Ï,H»«ü£Qìµ]¿¨<É 3’rÚú¥QÒª œã^˜o™©ôyQ1Y!ŒEsai[5«F&‘«DZüô Ê°JÚ“Ò7*â†ájÔ¥4N¶Jã4 À“þ.ɯÃú³<7Ži„(É—-Ÿú’þ _'Yª_™8“÷þïL~pÎä|Á«¨•ù` ‹fòœ®<ñ1ãÒ?á]»¨­Pá{uMA\ôÔ55«\ÓïŠ?Z'M¹žæ$¿l½8 ;0Ÿ “þÓ†÷íëÆ/u¼½RŒê¡y-|Áh¨Ä?šAÏJhcãû &=œËõ$R_ÄØ‚¾å¤lqIä 7>%R½;";ÇZþ·-q,E¢¬¤1 Å^¹Åà÷ btù½V—Þ99úü÷:…çendstream endobj 313 0 obj 3857 endobj 317 0 obj <> stream xœí\Ys·~gò#øæ™”v2¸‡¤*>äØI9ŠÍ¤œ²ü ‘Řܥ%Q–ÿ}ºq6f0{‰N¢DV‰Zbq4}|ÝhøÇÓq`§#þ‰ÿžßœüökszùêd<ýþ^žüxÂ|‡ÓøÏùÍéÇgЉqhÜèØéÙó“0š~ª­à˳›“ï:Õ«Nöêû³/a„`Õí†Ñ ³ èøI¿ƒ1αî=œ³Òuèy÷¨_±AJexwVú|Z…´Ý×ÐÊLk: « ð çnà †§‰>í…¬qºû{Ï´ZE¾ý –ùd67®ø)´J30&»/°Õ:Ë`ÿ9-Øh¡“b–wa%ìba%¡â–ÃT0@¢\÷M¿R0Ö0Ûý­çÃ8* ûã^‚CW˜Opà¥ÐÝ_p8ç\kÒñ¬ÌɃy=y„¦¸7,œ—ôVñVb s.œ†íEè<9d58=òtfŸ÷°:³ŽwÏ€b)ïÝk É}ΑÆk Ø#HÓM¿âƒÖFKҸ40‹¬Õ°ÅW86Êî9‘R:Ó½ìWÀ"¡GÙmàÌa2a LçÈÈaßÒ)X¾¥xwQZŸÀÈÐÝ¿ÁB°U«ýq ›#Ÿ Á™»îç„=18à œ€“I"µ.Ë\P:p§\Èî×¥qÝú ã)øžÔÀÕÀ…!sL¸ŽM3®cã„ëÈ àºí€âóSô«…BŒ \2É@^äI60Ý=Å Þ\gÎëD·a:.=²¸ ]w—…”v\—Ö<&qFÉHšÿ+O†ƒÆ2ç‹ÄC׉îM¯ä`4·ž±×yÜ]ÑÄ,.¬û]V;ÜúŠƒ(:}ºÅV¨ž‘£HsàQ¾Äqá(x¹ùëùv7 =ê–ò¼BíV váõl‰ÒêX:òò¸W!üÇ?*ϯ«4nÚ¤°T&ˆ–åžç(—`›…?‚8æ<Ë.Kv€ÜÚk8Q…M¤Ô1L§´©U:M¾æFw? õ=D;|‘—HvCƒHl‚. ©P… ' $W‘Ê&…ÅÆµWîä`³Ôš â!•èn˘"Ÿo=‘Ì ^dºHa>NÞ–îkò)˜À‰¾q…úvKã:Dµ"SÀj$¦¤of6"(]RÄ!Q„´•7c@ãŠ2¨ìM)ÞWÇ€pcãÈ8cøõ;üñ1þø|‰?þ„?ÐMz:¿>îðçþX#`mAB®r§×¥ñAn¼,/sã¦4ÞåÆÛÞ¢ke†Œ~^:Þö¡Ã(ÈŠoË×Ïr㵟ÇHFæYoïXÚnhǴີÅW¹ñAž§t¼+¯ ¾ÉmOhÇ´ .Á¨ü>Ú|èŒÕÞ”þÕPÿuý®Ú*¡–œMêKf ú¹||ÞF&{Ý$çuu¾aûü¹ ŒÀÅ ›ˆ²{'`$-€9sÀH ï¢Ñ ÖöKH=H½¯Gxü²xœë²W(Vd+ª5µ¢‚$ô%м\Ž™:\IËØ¸v¥‘{T€^ÇšòìÅñ—íĽPƒ–,;Ò#=µS†;[Ó–…Gå80È}-ô|û;ƒew¡Ö(ÐXÁCÑÌ(Dv¤D±OôÆç‰¶‰ƒˆ¹¶…üÌ%Ä8Ú“ ƒf')gwˆÏÎ Oc3Þ$Šy¤¯/ƒwEX¤6IHíÆJb,åº7Ç^ƒGgkø’:â÷Àðú`ã“ÜÕ§CãœhJÂ=€¼†D ‰5C@8Gb  §!-ßÌì ƒ5ã£Øá˜~pÌ÷æ˜Wª€å“àJWJ¤ ¤é{ž»¬ÞvŸÏ³¶$&k9DÂì7M÷{]Ñ?Y‹L†ÃŽvÕ‰mKž¿wêP?­íÄO³^@ÓöÕǤÔRz¡s ŽÚ6cESùš*&ó6ÆT!Sò¿Åo¿¬½ Z»bþncì¤\ $’á¨Üj[­bQJ±áÅ€µLPm…›ò´X‹GÉdÉ|ôÞZ‹'ùë—åë›­¨ú¶Ò‡<:u¤ƒ‰¾Í¼nþ,ÏS[­²á#ùîu‹˜9ò * …É85©hé¢j)ÝP-¶Kµ¦˜øGv¬ZmÏÿ îóï­N}þA§öÒ)©„Oßß«7-‡)VpoI±œž*VöYµžxŲ0“ùlÓÔµ44Cùßô­8nÓçÜœŸf  Q.=þïdШ,K4åi!aYŠWkaõ¦šh)ÂS&iªJç|Oú 06 …ûøOÐ[‘op›˜‹4…B¢Ú)l(S§KÙ:ñÇê_Ä™•èxïãmŒIR~Qi¤N&_´ÂÅI4îh1äª6ér4©#Fo9ÐÑ$ºÛ2jú"s­à4¦Kl´VAó&Hh©È 9¼Ô–NbÅê¶"ÅD>\Ll©ÃÅŸšú0M2 ŸÚú£xQuršUŽ4É%M°ä9f÷5øýùÝzºÖöxc£b‚E+¥5(í–ˆöÄw\Ö  Ì«µÚ×?àE+¦u'Ý“®„,cäY­!·EˆÎYf©ÖÆ“åR7o:Ë “¹ít¬Ñ J>•Œ±˜¤ßqÀˆ.Ààaêü— Y|¦ÝŒ^g¿Ê©ÅM•ÅOûV¦­ äkŽEGóËz*ï*X¼¤$ûF„Œ</ßø`†äß rZÓžŠ¦uÉ­“|Ï;§æ‰ðN4ì(à3Xa€²Ãw£ÄVhbOPL¨=¡qZgóu²stÞ×.ªaMðÅlNÄð¾¯}1~wàÝz!̉fêLwdCLˆ%3U&l›t­oÛ¹C¡Yö™‚N­Ò› À¾#ÖÉMÙõ´q>—¾®-`%ØÐ˜#ˆ‡=pÆX%2²çxC=õ«D*`¯Ô†Ó[ªp2†Þ4¡cpûz¬ßc<°ŠB/–£¯-0ŠÑ k[IO ‘7j€õoX9ø-ü„à ¾)ŒeѦ‚3$E/qXíGÆñæ8 [ýßRãë9«}>•Šâ Ç“›¡'åã¡pßçÉŒ9ÐxSðSñ Þ¾í3^Ɔƒ“xÀ0;7C(ÄQ#é¹)IæBøšTĸ$n›wJ¿¬Y|`O‚÷h½Ì*î­¶Û øÆ¦XQ”1(é9±¥Û“¡4Hñfލ*äóà½ûgI8ÝU–~fÄ,-hlÌ´¢ÚW),´-(rXÄ;ª rI®aaI…B´Ä#P^ø¦ùæÝ?®Àø x )9øÁ–·àY¿o]CÀú¾°d¤iŽmi&öUÔ“;RãÞ(üLnÅP…I⤶„ÉñX&0ž”c&ò›gÞ Â4Œ« ÚÊÊ0ru Ìu8•ÿ±Ò˜¨ò™8Ýý#ïnšf²¦$vÉÌImB–lÍÿ—\“êëu-$€D\ð¦”)aŽ“2îN,¢¯Rž™öp¤…,OÝŒËI㤺êçèÝåž¶›o}˜;ÀÜ„×d w²˜Ç© ‚C)ì4ÑÌr4¤¾ S‹RÁÑšâžMk¤Id¾ZªÃމùa*ø‹©ž©GäŒ5ë,sYøì]Åäjk’ªÁz@½ÊF\U¥•ŠU£dƇã5ôâ”1I² ÑM»ÍrW÷–94tÈþåqŸ ©ëÓêjƒ|/þ瓳ßìYf°³‚³ÑŲ¤ç\ãn¤ìy¤–#²dâb±K2¶VÆÆwòõè mÂ…6ò㿾Èà‚®“Š JIk­¸Îµåöþm‹ÞW¹#Ëm¤pgݨjØ1oÍS:Þ4(#üy¶OýýÖÚ÷ ùí  YMݶŸTûž P#ù;k¤XÒÈ‚ÄÉÀ˜lÃBá—è-y’÷X+Åÿ¾V^dÙ§ú;R͙בҞ·j_"ÜlÿyRãU£îŽÓ-Ì«}ŸÄW`|Ȳÿ¶h`5ašF4ËcÏsW¢«O§&Á©`$¶úâ'|óìv<„¹c¨§oºÐˆc«1IÎdÃ9cbÙ¹ÎÙ§'ÜŽ‚@ H[±h|â¾¾Á›ÛvèÞ¢I|N©î÷1°¿QâÈ$¿™‘“·œU渼VpM ’œ¾€ÃsÒ=ž¬`rOß ‡•*– †Ó­Inj<°À"=°À%FK MŸSU‹wÜ^4ø~ùš©rj^±‘ð¾Dvóë:æÕðG$ÔûÏ>ŽÍå¡t~à©xêžÚ†§>;;ù+üùºkÿendstream endobj 318 0 obj 3895 endobj 322 0 obj <> stream xœí\YoÇ~'ü#ø¦Ý@õ}$H;–8‚ìXŒ“@öʤ(!)Y¦,ýûTõYÝÓ³‡L?$1 Ñ»³}ÖùUuõ¼9f?fø_úÿÙ«£ßÚãË·GìøKøwyô戇Çég¯Ž?;…F’ÓÉ3ÏOŸÅÞüØŠcãÔÄÅñé«£§+³Ö«i-&k­\ÙðåÄ:? æV_¬%<7Z¯þ²>á“sÞëÕéúž:Îäê |”zRZ®>] ü _”‚FŽWØU*è+Ã'Á&gMhþþ}Ž#˜‰3³úl­&)¹6t2lóéšOÞ;åWß®……K³úöóƒEž®a7‚…5ä†q,åÅêÑúD¬âĤ$Ì'íä¼äÐØ³¦ï‰Ô,Mí9³«@‹¯q9 áéæþÞÍ#Œƒ¥I—†} ‡0†4ŒD³Þs:îî!~UJ*—§–ÿpúðXDø§´˜žžÛ4¬þņÊц'ŠóI¨ãÉ&˽¾€„e¬¾Ä?Äç«§øç3üƒLZ}…þŠt¡Ilü~ý~…oñÏ5·èÌêeiôS}x¿<¼¬,oêÃÛòðõÚÁÍ-é}MÚÉ; âwU~¾ª?¿+7a«8ix¿6 ¶Nd²ÜÑdVdNHÚ=/ª&²ªÕu Øm4˜¬ò´ùýúÄFHë ™«¬ÉmÕ¤­H]¼V¸cä8:TB´è†­±Ùw€›Ì"ˆö .Ä‚{‹åšK‰®ñ¼82Ç+ä–1Ö¨´,Æ3¥; Õ>7•ØfSD~Œ¨…¯¤OJR(‘ftQ†•Ñík¥‰xÞD4â~Ù ‚2Iá¨6%2,. ¯àì&KL$ÒÉHÒFúmxÄhUÀI’*ýbÀÌ3ìN:@ž‚4ÄÙÞâ/@;¥‚‰C6 Êúú —)ð‹Î,ªªØ*ÄLÐgÊsžÖcZýÎk\’\)4p™“©6C;EÆDFK²e²Z\"®T èLÑe]¹å‘MI $¸x@› ·a‰~Q×ÊAO@ “8)òt­dÏ5Žñ*§…?UV²<Ÿ'~€­ªÍ_×ßû)¸—baßæƒR$bµ~0 ‹´'<ÕÊQÊ8A sÕúŒÐý˜wAìfB–€°QXh g4lÔM2‰äb輯6ò#­™‡‰äašÅ€Á†Ú ×Q“À>õ£ “dÃ0ë΄fQúY4¨u=d¯õ‡‘ÿ¼Œ‹D”„*ø°á®à´sdÇ}5 p> J;W'[¼ÌŒ²áZ'“è\zàÒ##PŒhɵ̋k•€¨ï¡$B%7 ³0ü)¬u/ê(yäè^"Aƒ&éì_fnb†.:…þ(3W„Îø"Å)îA•èL;"Vj®c ˆ©­j=‰È¸ñ'Ò#eÄØ’ãÈçiÍ&»@Œå¤¦JDú–mU­Ÿ†ÂæÖ@)À3@—›>.qêÍZ7CDÒè±"eÊpÌ&,éZ^Dƒ¼"ÍŒ™S38òîøNðè.ˆÕ%’DÆð¼þÐèA¶Ë0ÚÀ-fh7”ó!ºšz~$Ñ£u$·¤¨*˜²6“ Ý ÊcÁÛï“ÐÁ¡viLör âDe,ÊÌÉ'Lr,¯s`—Ó:ïyPÑØuň&¸.î×Á`^j fuN‡^ —lüÔ9ómÓHo\¯[-ê¬WQ @¯˜ÊZp1’šhK:®Z!C' ŽPkIäŸ@±Æü×åq&"X=¢cC?@„¼Š1n×tðŠÓr6Õ¤)!®¬JYr‰­ QI”ó,–1®è(þ<’èÚeÙ:Kà™*ó “J`Ú›ù„]±Fö~ }¬{Ñqt"/ËH›0aä$6½m8ªmm›ôÍL΂ÿ¢J’`àˆËi¢ ‘\-ÒÌvE‹•– FÛð\"Õ!q8tŠqÇ»µVø¥.®Í F¨ûCâ1["—|@$òÀeåÐsäŠfª8‘%‡!\mŒ% 6}O%©>0ÝiÎAGýLà('µ09O²g…‰•ކBKñ QŒ›ØÛ;3ɲàÔÀÊý"äê€_vºïéW2Y_¦äÇž¤TוIÀgD=š“ƒÁûòqöìMã‘h@t–Ÿû¹ªN•ÜY@€êDÒš8.ˉ°¬Mcm1°›Ö0¶ ,¼‚†n4uJk:¶n‡2ϳ0ß{[µçu ¯Ë~lÔ²©vÂ' eyßšiÌ£P!möñIà¸ÕÉxðºáZÃ>–Æíéܲƒì…¢+™{Š6‘œæ˜«P…1IT%ÀQæí²§”vè{ ¢¡ úcŠ—"¹ïí¡g[p¦žq3‚ÍGÃ-¨¬‡œHîPÓæææ!Ó¦Àµp¹Å_…¼ON“?¯…'¤I„I®KåÕ5VgUŸu.´7‰²­[J$>† {x¡ rÒíå<–Ó,wsŒR.°ÂacŸx‘@âK|È}=ùÅ‘¾+±øûÖY¶)£hb$!Í®kË<07»LÆÁFÛóbÃÀÏÙ¢ÑΠ&æ”ñ´°U-l P›pádÁ‘Q¬³ÔÚœ€ËÉ­{!9#2ã=ì ‹àÔet©„M Š\(ŒÊŸhR?GT®®,¥AQú”Cž¥’ ¦ÊÝ'•LØ(CD³Å ¥#™a<`‚£-ù~B5𷶆éÝ~KX¸'Hà˜„b*–¬4Ùe‚EmSl)Ïiä•Ú¢¬à F ½‡/J½O toÁvDqf2E3Ú¿Xw³”˜ïá!õ½šÀ6ÖÕ³6m0ÑXd—†M¡û¥ãýÌ CÄ»PAï¯É|¢FqX@ÊËà×?®K‰ˆ50'‰V-R#f3e•¤ ‡ C<£º’3Ć‹ºüJ!ãÀ äEuMž!¬á—¹*[xòOˆÑpu)ïV䎺Ï{XŽI¬Þ-;,òêÄ4ìul"®%¼ú¥Éä|ik5L·ÒpZ2Þµ?uÕVg Uºh’_8žªc°ÎáÀ(?жÚ¨ÕdëšS®Ñe[Oü3:¦Q<ù¤Ó¢Ù+1¦ÛꊙÅÓÑ{ €JÐ8ª=ñ»óLÂ0Ù·ó4–&zZ'ßÐz`“µëOGÎÍx¿Òß¹K æô ¨4!qbÜ«í¹STE"˜aàViA`Ñ‹¼S1Šk“Êr"p…iû…3•Ç÷Òn™¾3´–{MMqK"][Ýò4Knª™ÀTZëßÃÂLU%ç KؘAè#„àBf@}Áôˆä '52Ýžçr’OÈAÅr¤e"Tº¸/,àsÐÁÎOÕpsû ½ÜB:mvx×ú Ä—FØ>áá¼Ý01âlFÏXL¸ùaÌ;"ÎÞ6j-LLPow<ûÔ^eúêÊ;k1 ß§L,ǤÁ׸8™¥ š"-«ÛH+dí´œ×71²¡>ï)׺‚°¡ò©‚3s×€‰äÜ«ø_ü}vV˜†Øà3š”* —íG.‚jÉxá2\·²; *C—ÕÍÙ}éˆÛ›„@Αœõ>Ú·=;yº³àµ¬\"ø!}ˆµ´BÑZÚXBûèèôwOÔË•^ËQÉ-/šöM,×Ü´ËV™’GX.û{6€Ò•ù{:‚¤f~{4ŒõŠn4Ê1 wöû!†Ý"“ÊÉ]1æ–³¾²›CcJÊîö*,Õ¡ÇÄÒiãï¯"|ƒ0Lˆ%Ùøé¿é*¦ê¿/?·eóåÚ)ºŸ—§×Þ¥!í\>/¾M8§Þ}x;¢ÅUi¸0bžð‚t™]Ex;º_°iÈÜ}Œºš›~h–°&•x«@ƒ¢el ü»k ±Î•²opq!äcã‘a †Ù4EþhŸÌ.ûM¶ëpt´NÌë”ÊéîÐ:1Q¶Z§t,ô+Z§°/¿ý«ü°¢õ€#™¹iâ³êÖ=R]:æë5¬qÙeÝs“DRn'3G}9¯Ì<ÕÌì.ï űÖt!Sª _ ™RÕêžR[ÚÞ±^‘O)émúbÅ”V'y…yø”Îp\.t®R…Fñ„&€Øè¶erÎÜrzÀr£C,ŸÜ•ªIØ&~-¡¦éÑϽ¹K]1)úœsz\†A£j"Éo©͇â'” %P á‚Hb’%J.$Æ*ÍN}è…x2 ­œß ¿©,8cƒk9gc aBÔÑãÈœÈV:dãH­évN5*MúIýùzðs¾a!ÝÔrfrµáÐè"X“ÕI…f‚†hÅç°©Fc]FXç.šfüHú9b;§ÄÜqp˜Ô_v7L+¬ûî7X÷?ëÈ0„fgµé[z vÐô6ß0%·vÛ ¼s€xÕD£'\òòµSrtêb$‘ ¢#vl¨PÔ ¨•[ƒ>oG²¹¡ëÔyŸ NÓNfà”Ü@­aâSû±øÔ²‰ózdnÜ]ãS#wãÓäš~E|öµ Ÿ‚4mŧɉmŧi+cT­b…ǧ£æeK6&ö=€/>©Ÿ `ãÖЧ×Ӕݚ4j€a÷Lûï‹añ$Ù‰aÛ|=úÀÎÇîQG¢lÈ‘ìÊÖƒâq9\Ìv‡Éä2DMƒƒ£]G¾X+Û/póû[yÄtä"ìJ\˜\J®Žª. Ùs©@âýòjà+üNgyCRåƒ0 •=³Z%·H’¥ñÌz¢‹“¥úu[~êDXNDÃj½Ýd¾ø Èüße0™âöyÕÅÇ`Žçdùƒ>—åỼ¸3u×+5î Ñ{3K€ÔL£2¢Á3Š2kä—· Ü9¬ÒìØþ¡ÅWâ €­F.â*ÓbhŠ)—«Üôil8Ä×Ó0“Ê[ÞF{ðQ®CC#0@th5³a@ŘÐ.&ªE@'u¤ |s T –>œÕ¦©Iïë$6užäÅ•IŽØ6=J“®hçÚp4Ëuî|O¼Š'ÐÙJ>Š„NY¹rì6 ÀÓ¢[ˆâ‹Ò-h» ‘|¼Ã3Ì`½Zï¥Pƒóãüº¼Ã(Êɶbñ4¾Á캑œ ÚoÙdDÆp&ÞUêŒòƒè´•8aDí<®—ýå+ÉuÚy% Šíí…¦8ø^H³G]¼äÞ¿<‡¼hïðf+€Œ<š›­ñúµ!7ò2S퀩ˆéSÌy ’Ê@ nJ±ùø~æÈË+rÔlQñŠhýaPWÑ•!àÅÃú  -À˪r·pÇ—Ò‰Õ?áy›9³ëp•ñú¿ÕnHB,æ'·0Óò2%ô<Æab¬Vé•üW°íÍ-y?­ÙýXx dc—FeL ð ¹ÝruX‡_e}ÏZØ|,Œg¸é^FžW×Z!/à WUS¬O4‰¤Y ‘÷¼ÓÖÒ×]švGe=ö÷®éçÒ”[5ûÂbm‘2’+kFr¶Ñ6ÏHrEÔ.¶[m éÛ!(OšªÝ‡§GƒÿþFýoÛendstream endobj 323 0 obj 5064 endobj 327 0 obj <> stream xœí][“·q~gü#¶Ê:ÇÅ=ÜI%©X²§$ÆW¹Tœ‡%צYZîR&WóëÓÝ@ æÜ¸ôSJ¥åÙ9\Ý_ÝÀþp1íÔÅ„ÿå_¾yòëoÃÅ«wO¦‹¯àÿWO~x¢¨ÀEþç囋ß\A!¥áÉ.NQ]\ýéIz[]}ág»ƒ/¯Þ<ùïۺߺÿ¹úxèæ wÓ /]Ý@ÁÏ·—fBŒjóÏ[µ‹q¶qóO[½ùýöRí¬uAo®j™ß¦§ÆÎ›oᩊPmÀ–6;øFë¸Ó ^犾ؚ°›Cô›ß*Og'¾}Í|¾¨[üžÚ°SÊn~‡O稠,¿ì –‡¾LPÈ©Yo¾„–°È -—˜5T/¯¸¸y¾½tðnPóæ»­ÞM“ƒ~ÿfkwFCQ¨Ïh˜Kã7ÿНk­½¯j¹{P/uOô)7¡ƒJ«`g¹ 0YP¯½¸4Ó.¨Ój| S훯ðÇ3lgš”¢ÉÞüþøÃ>à;üñ¼ÇO·—vX~óÐ6Tc*”êøËöRãÌÏ~s_þT¾+¡&7”Àœ×‡ïkÉëÑÇòð]}ø‡-?ÅI€uq~ýúÉÕ¯Ží×åÇhÜ¥yðZµ4x=5ðÛúð¶›Ç‰½Ãÿ|ï [ì—£1ßþ5û×ß‚xK‰·n7›8ƒÈ«,(òzkRéN¯¹]Ä2YM}µ… §æ¨7„Mj-¨êNP $pJÌz[óÏi×Ùè ä¥vqç`»×ï¯AU½¨enaO‡ ž¡_ÖÁÔq ÷[Q⡾õÇìý<θ…jaÿßmu€ ¦®(,ÑÖ`«få£}ƒ6–DÓ…±×;Œ¡NÞÕ:n¸(Ÿb¡Ü‘à­¨—'Gð'|ÝSß—&ºy ÌÓœ‡Ž•:¶X†®q3±VcïP!ÂÌu=`¬‹a 5ï´‰¼äeù¬l‹§Qàž|‰öT¬çfQ¡§™˜’hÂq¡Ì(õ–ø5,:Ë=Á÷Þ…ÍƧ(e¬´hµ4 ú%^¾-•·å×p¬ öAYù‹KT‰0;iÈãÕE1«RvÖÂæ“ÄfHMe9ýäiÞ´§Q'öv†íè{^{2åÌQ"‰+ai¤T¤,­±´¡"\#b^E’ßüE}x7ú÷††Ç0Û/Êþû€Íi˜#³.ñ¹Q'ÄÇÿ*å÷ðÛ~—[Qú¡Ì”ú€pZGàóÓA‘¦5<(='¡×g…ž'Ê«VFi²ÂFàËp¾D=‚˜¸òvG,L­î5/ÛpGòR„¤ÿÞ%1ŸÀBÎ- E›Þ¨PúüXà¯åºšõM«é¥Š ŠÛ!í§²`‚¨ßWÛ‹oˆ¾Ö ™z=EÑv-™<ޏÕïlC Õq-·Àm^bØb#E- *ùï±G.Ù@ç\+ßE”ü”â¥Nlêë.†Œ›j¿N ÿ>qbCŸ…¦ƒÇ—_Ôi~±s–}»‚´¸\šÇØo¹7 *ú9•Ä*„Ñà‚h `raÑâÃРñ«òTÅ-‹¤ž'œ­ª•Z¤TP¾ˆ÷Ê -ˆüÞýD Ñ #",GBànRì²ã÷èòV™ä>MA«õÅžj„Ô ™ôAoH°Ô‡*ú¢¤¨“±žÓëÎ@Ô¤•ÎÅé ¨²‰c‚’«rB­é1vÅâ ìŠ/Ždü-†\ÛSñ¹™HìVðùbs }¯¡»èÌ͆&7Î4¹½lPI6"˜@Aç<Ë Þî¼å-ñ +’НӦèªNèBºe—šÍñP…[¼«O‹<¸Uó€-9ïØ\FP¼êPp6Y硵¢¾&| ‡Ïr.ù)kbÃÈnŽ‘zd]XÃ3OÎÒwÏë«CNJ>EæA;2‡Íßc…É í¸oUdÅÖ{‰vÒÎGÂcÜ^Ÿ4ÍØ2õzµ×/tê¨òãv§½ì"Ò†U9ßfN¼g1Gîh¥Zm’šÊúºxÈ$þEÐ/¡ÆLÓÜ¢´üí!x2²! æúYˆ™ñ:à29á°¬z˜ð<Ì‘¾z[K6vüÒÂèÕÉ;À:ô3œ\OîO]À*kK/}¬äkÐ` ‡X2B­ Bøë-Ø:rDƬô7ð¾÷½p¾†ÞÀ#úko"…c‰uŠßa×4‰­èš‚î—â“Üc¯Û ¼P€Â·Ìc,nE’eØ@¡Èr«3iž­cŠ2IWCogò»ö*Ø´rެuÁìþ>'MÝü8ÿ*#áªjûù0AÊö{wN¾ábGbkÞNÚÃØöÃÒ7؆&öd‹>ÍDÏ4—o¦„@Äêk^}…±Ÿ ׊Ã0âÜê8v{?à÷!;RÁVtT7ŽNîtê|ƒ*^W7&¸É“ëEý÷#\džcÈ<ù3€0& µ›*Y’«Ò~îEoÁÔ €ÛHE2Æy"±ä¯¶äe[ èUÏ›D±`ég[Bé~!~Yg«âòÚ—òÐoÓ4gÒºå_3œHƒk]F¹ ¼ ¥Õꂚ` K·› _P¦å‚Âö`v€^\âÏ„ÎT¸)[ÜxGˆeÕðScnÌ. ^0côzƒ Agzù>@ÐkQn³“ðsÀºgÀã[™Ì$è~7OEÐóš$:OkÃK>°_q…K8‚׉Œ`ÇMBÖ3náÆàĺEÈõwÈE!7‚.Ì➆Øêo±æey_Ia­š»8‡²ùði a¼ðM.¸e¡»ÅÐqÏM X§€Dâ}dªõÕ:kö½7Eò¬†›ç0e‰½Bim !×Ëžvjœr…Œ¤|_‡ÿ]¿áùÿÌnDlX{jà¿Õë:ZŒ…giï:ŽÏºc@‹Ê% Òßf?jZ¡B¸E7o>+u qø,C¶P-‡.¦ó4ƒ”X“4­î…<ÙÛ1¼`wÝûLʸHLFˆb~HºB{€¬rËpc…Eè´ãFVLy#wu¢P4Fø½¥&™ˆÚyä„Ô*G ¤fJ}E#Úüo©cØ™ûÄLê¼’à‡l~% ÇCf^•âë Ô >{|Ãôà6<R ÈŠ_r>ËØgr%Þ@¢Ññ#‚·’NÏ3uIº•­ÅBºá+Rý#e(ØóWÛ6ÊÞã£Sé`B@k´JŸÃ¬[ ¼ü»¥âꥌ/ 8Ä‚ì­ë6+CÇ!䋵>ñ½/! ]«o°L-Ý)`w¾" Ôwk—‰ Š«ný8 #Äuï…£w°Kš.€õÅ@7òX¤½Ö%ÙÄhÓr3²DÇ´$Í"p”FÞÚ‚¬îPÒ&¨'DÚèM¬ž㟘B߈Ê_À ÐœealZÂ*¯? ­ß1+‚Êéì8¾øk‹ä¡"ñƒ—ÁŒ@´i @P“c.¸ì4#1ø`DJ"¥R-Y9ª Äë‹-aXø$òËÛ< ’{kD!8ñ~Â@`3YÜ—ÚXM(ÁåM•£„cåw§Û±O´^+Tfý b`Æv\ý-/ùŠÆXÓëäàãËQ,‹ u¼0Á׬ŠáÙRÎK²<Í”w%|«\ÞÚ¡ÁuäT·¬{ á6“ÐÑ7<†°’ƒÂI‘8’N[– 8þ¦ ¤å”žÉÙ£÷åˆåµ´ÐZRQ‰~-ƒ@§¦pe(»Škš~}T~V ©sí RH §~B„H@l" JÇ€ññxÿÕEò_ó%˜’œsrò;Ù^âõ‡EgDDn‘³ECÌÙ`m¦#Q n=q+ ~[Öf<4ðÃGåÇ­³ ôÜæ_< [9ŸHŸšž)F‚'èó$P]«ü%SzM Ë}j|"ÎÁQˆ|.¤K Òujyê”A4¹Æ§ïâ¡k}‹}yÜÉ’Ú•‡Ñ"”eb†2kß²çãD”He£xÐV—y™=éeþ— ¡ /×>ÎÄø´¿›§„Þg›fø>­Å8-ñ&ï £×Å—¢*wmoŒ}¨9ÑÜ"ý!–æh4tgop.Ðc+“½ÄûÛ„ä„£Ç!×£eÉN‰†³TÇCôý¶v¥V‹<ÖŒ´½ðT{0Ó@itG“œK²LlB¡±Ð…]bªU› ÂN£mYöè ;3bØ®·†TƒmWéßÕäKjäP&ËžX/~lc½”o¤Õéj:ñ;ñH5S8êÈã}h¥3ìfS²ñûœ·‚R³T¼SŠ9æÖ¸=)¹yÚîäÓ†”WѤS Ñ€~:•)Y¡8±Ç{#®"„ÊÃne~/¿Í€ Ç™lË;óˆ>¡ÓK@qbÊWOå¢èÿ†ÄEäCaS˜$£ž“MTÍ~IÊÑÎD® wBƒ‰œ!Lúve£_jy–b½b?´•éLªÑ…×ýÔO3‹;+Þð^äRôS}œ£™ByWÙ BÅÇŠ1Dì²I•­ÚtœÊËŒƒÛ/”Ù¹Ÿe¡ûº(Ú®ÙWR“¢Ð·û’?[ û­Ý(u7»¤¡(ý‚d>™`šÄ½¸l'îâ=ÌÑöÑàù‰µF'ã.TcŒ˜.бѬDZà±´#³¬ìþCJŸ‚KZ‚YD¢4§± á ²M¢ WIMÛñ†ŸâÌÓY¹Ð*û”97l·~/<õ$ ´%±Pž†“Wœoˆ+iæ}Èà4ÑÆüÖ}¯õW/àûšêPDp‘W0p›m:#ó(òãÓq‰˜³ï¾bòäF[&Ù £?KÓf9Œ^¯™M˜ÞI—ñ@´øm6¾R’’Ý¡™tA&Ú׳~L_OFœ…³l o'§ñ 7Q¦0ä4¹5ËGz«þ†„팹`S…xe‰ È÷hOme£áw}¬¶P†Žl©#›Z’-<ˆLÌ€òÈ|ÏH˜ÅBݧ%êºZe‡ävÄMbæ³™‚o&Œ2C¦ì[Ÿ›dsfF‘°9ã…U¥Lž¿ž Hâ?ÍG¤:©‰¼ñ»ÙŠ3Lìnw¤‹`Ž…,9¿xžf!-md_Žl/™ÊÖ{Í,ez‹cyt­Æ×Y–c…›Ã0§`óvç;øªÍhËÚ#f ¯RCtͧ0§k0M¥Ò-)V›4²_ÙE,ÛÊQþêªAÁlîr&ƒ‚ÈNd=Ͼ:`›ç#üµÔ²#Í‘ÑìôÎË´ñÔû–òÏãÌòdÝ<€Í2#ɯðS<7ÚÓ¾ßw´³ˆÌ<â'j͇>Xý=Í ÓÌmúÏjÅ a¬³R]:…j޽†Ž˜õ€ç ü&<ðQìXDÄ~m`a§@2¯qL*F9+PblÃ<‰Ã9 s²¤-rIvÛùÕ‘)Í>kl2…C‚C§.Ou5ñƒ}‡Ëm°}RЈ¹ošºÖ6qŸÆ‹=¢1RÁÑÍpã6ßó`„¾mǵÂð°F3º&ÖsviÊå÷x'ðg\L^ƒ:#+@·Ü0é-„³ú}mÄx‚îŒ=±ï°è÷•·ËÙýÔñd}Š£®‰Qƒ{ øÈÖ  @ÊoœfôªUˆå¹ˆôN" ìzOiÍú›ƒÀºyºCÅcúìèÚ ŠnÓå,x²‹N¬ì¿I¦Þc[м‡¹¸-F<¼+ŸÖ‡/ËÃûú°Þ¥ó~‹ÌeÎ'={S ¾ÝRŠëdÄ+×õë÷¢t€Ma÷|éÏæïêÇQûu.þŠ÷uËõìÿ—k°\×£öÿ(‡täÅGuêÃ7ƒŠÞ5Áèåƒ(˜…9‹8®±üÝÈ“oFBZ7êt1RQvæc.F¢£v{.FJY‡±Çší ø œ‚ Ê}¼e]¥ÔIã¨"ΠÓÓ.M5Ê©ž!e.šÎèéêÊFƒ­YVW‹³z|ú€œC<ôƒmiM×.½è껡uA³€©Žä^¨¿ó`x䘪Ë5Nmù©˜ã#ɂÌQëÜȹr×ÂÒç?þ8µXØ’GHËÔ]¥to#ùröä£û^0˜Ù¬’7p\¤Ðn9û° Ò=#6ûÎçÙ“LÎV›njkÉñìÁJtnQäÁ- ˆôC{·ú:éR‘?ùøÕ©û–Ÿ2%ÓœS|¾@cæU´H[ôЮܫáÝ5 }ýT„jóMâ§Œ5#7‚“ª©¯Ñº?Ð$kÄ#½ÊdÎD—ô®¢¶?aFÀà|Ç(`•®˜RÐò»­5UVxà.ÕMÞÆ…r"íäîA¤)o¡äjëaÔ´.š •4-ö†¸j˜V>t“ÊrÄq¦£^5Ð(Žä¦£ „Aò!¨ÛÁñ ÙA™§œ¼ŠouŒ» Ø^ÿu÷WŒô__œªèœ¾thÎË]õçºÄE?v×YÉÔx™Å¶dÍë Žªæ‡\`V_ÈQµ'¬ØÐAç¹Óããz),’çErƒ8X–®9¸Í0caœ}ww“LÀãÄD ô4nÔ¶)÷Ö$['A<*=Çp¡¦?FŸwpN1Gâठ.þâ³õ½‹<”ÊBRìCÊMo¯¦³ -ð,Ì*e’gHps,‚ÆļjÃ_ ¶X½?¯¿ìì[ Ò±Ûë!RHºÃÝ 0ƒ¹IŽÀáˆåº‚G8§g| 3_Yr ­€R~×aŽðblÃÚ¼÷è"ìäc.´^E\Õ(¤y\½A¯´Óœ¢àsÛΗ<2q•b#{|E ›‡M™Õ3æ–eT•r[”‘B{ÒÑ'C—U`÷^1)ÒÆx”D2›JÎ(ÔlIT7ŠD„@Í>RiR}²¯NéPÏŠ.n³tKÛ•ôÞ.]úè,²ó/¿ËW èêÙ™ùr[Þ^ãSÛ]Z‘ükqU£ßV@WödKo"›“CéÝ‹ì-ÅÈ•\܇gbBR]”µ¨¡3ô¹¨êÃ"qvyšÝ¿j¾ðøwV»q^u—¦%ÄôCÍ ÎaÆtà¸Æ‘¥ž«‰65Dyc“ÿúM²Þ*Æ1ˆ„²;ä?s Ì[))ò†;ÇwŒ¬‡aŽÃ”•ñ5žSÔéXr£.­imëáøú}õgm”shϽËF “vûôS\uÀîµAÙ¬‚š†ñÉiLlt«M0kã =ÚcG¥8r’®ÒjDÑ,½6"Y.ÙkoÀ!}=@ÊÛnxv ±å÷ íãFWœ¢«aT> _\¾ç¢ØMUöL]O·qa–íYzž|ܵ¯Gð‘ùžÔN«–øÎ>z›U@ ³oóà8 ðØýK㎗*Ñï³ìïX»¦#Q2ñä›xÆju‚=UzÑÁÓûèžÕÁ|±§Ý¼K§íJÁ>ǽ^( KJÈ0ÇýÔsI|#ÏÁs"*%æ‹Ö9gj¯3¹ð ‘¼*DÔŠò·Ù)ä4 Q'ÅY‘JDɳ"HëiQ)/.ç))/5§z满NRÎÉÍêú²³+·âÕûE"ì*——8F+ Ô wÂlwY k×ÙOêØ?wP«–÷×'+)×á-®wÜç†HZpt·?3L_bT‡.ÍR‚Zv²:¿Ryij2”$w½ÇjçhÏøPjs ²#kqÔ5åÀïþ{¹^mWÒÿþý®ô—V¯´INi쓜ä}}ä¡_GHÜÃøo%$¯眅|Ÿ”‰%纞”…Èçt[ÜxÞïÑåŸåIÑ£tBIæQ´B-2Eëe"“4uɦ›ªùÖdqQsÍ2¯47kˆ§2-]\ÃW˜ RwäCs§]"ÄŽ¸Ž.t8t†Gïòv >ÜTeào¶ÞÜ¡KÒZ`J Rņµö°§•׊ÖÛzLóØŠ§X=TQ±Œ¯ïé·WOþ þû?BÓ¬Ãendstream endobj 328 0 obj 6248 endobj 332 0 obj <> stream xœí\YoÇ~gü#øÆ€;îûò‰¶cË 'ÎÃZ´H!I‹¢%û×§ªÏꙞ=HYp‚@´ÛÓÓ]]]]õÕÑûã1ù1Ã?éÿ'/ŽÞl/nØñ§ð÷âèÇ#:§ÿž¼8þà :I-£gžŸ==Šoóc+ŽS#Çg/Žþ¹2ƒ^ƒ­µre×µu~Ì­>$´­WÖ|tÎ{½:ÖÐê8“«oà£Ô£Òrõhø¾(>ŒWøªTð® Ÿ5¡û—ð÷#ÁŒœ™Õƒ¥äÚÐɰϣÞ;åWgpiVßâ{~d@äÙ«,Ð;Ʊ”«Ï‡µX}Œ$ˆQI˜OÚÑyÉ¡³gÍ»k©YšÚsfWï/þ‚ÓÈQO÷×É<Â8 MŠH¾ocHÇÈ4ë=§Sàê>ƯJIåòÂò}û[DöOi;2[xvÛ¦:Ø-ì¸VÂN¯%-÷>v ÛtÇ5Àä"¿5ìõ-N¬µ5Z<çB¬ž”O×0ÁU}ñùcá‹^½Ö™»Øé®vzòâœ|õ,KÔUe[å÷DLÈ$bÖXÊ"“¯#7•kx˜·Ÿë:ÓmÜd­]Zyüa4ÆUÛžç›!,Kj 3‰R!ÕêͰfH§õ&ñ[ë󛺼Wø>Ðä]⃕…õøçÀ>ʜ؆CRNÞ·LYØ2A(ÀÁš DAÌpº“„àÞ-vÍ%¬Š‰¸f"šUÚªTQ%=‰ˆÂ¼ø…Ç£¾Õî…€=FºNòþÕ‰~ŒÂ"Œµy*|©ìôOŒm=üÊøf€)QN`J+ÂY9Ÿ Sî³ daƒuÁÍêg"¶ ¢Òx1QÈ7z«ˆ‚9—ÍÑ l1z~žÛópÞ{ Âx Ai¯#-ŒY*Èô¹n·3q¾=%( ÂRÅX:::n{r&¬oh4i›Œp“óA¤¶È:™”šp «`„MÕØÇÖÙB[¯³ ̾êŒ^ŽOo>r 7•Wh‹ê‘©Ä‰Ç'1-í]äÝ’Ì«pÈ Õv—QTm8}¢ÎÙ¬c¢&%²Ì•.¹¾8ãä›8#÷$ÒL7ód‘æ²PgEVx †’ J¸,FÓÚj8¢[™j¸“ ’ÿéîIô½ëŠ[¤$ÊiRæá«Ñ{‡Ùô¾1)¡MË%.DsaF“MµÃ ŸËQÜ7HB(Kô?þ}•ÛŽ)A0Éø(¸‡<‡ÁêR„6¢ô¥¶G&¦á¦? ŒZɉŠ/)å¤HVר‰ J« œ ¾=ÁÇ pa¥-êíg¢!-Úqëƒol;¶)f5Qß}ß± Wía [ý3Ž¡5_ÓaˆXâÚ‚šœèu4©V‡'Hõ!;¢óÏ‘#¼â*Œ þGüˆÇ¸¸HTrž™ÐÀµàj»2C;<¯23¯4…Ìy.eÊ\pœ$Ì""â ‹‹¬yàSP ”i" —¥ZöÉô;VY",»'‰2Èl5mµù¿ªí ;[ÞÔ?!ß@;Њ€´o\˜bù[DEÛ—@´÷Ö˜3×’ˆžˆ–,ï_%93eÙÀ¢„1‰‚#BJ4œå&˜Fð8kHœã£:C¡øí%2X Ë’y«'$ )ùÞ'$8“\Üû„d9;M6¯ Rž/yµ\¦ǺþõŰàœgë±ÿÁ¯Ë ɃT·vy…?4 0Dƒ # ù¦§é‰òî‰ã¦¥¢jgáXT@‚ۄƪ#Òàl”y1%‰­-ézÉÃi 1 å¾ëþU5ÃÉ"«h{¥.¶_°Úm8 N`W;†aäý—i$  Qòáà:‰Hg 5 àU¥g1À"¢™ßOõâKsÕ;—úÀK½[¾U}¨c{ÄÉÍ$ïÔ¤q—˜šjL|å(¡R{hôLHEÞE_*ÌDùˆ@(-¢UäE¾ºÁ›ÆbŸ¤¸á= ynÍr#¬Ê5r‡8 ÎŽË>Ñ:œÕ§ùêoÅV®¾[á¿wøŠlÁZ ä3ö~‚_¯ñŸç©Ÿ@qwÁt¤>/j#Yƒ†Â¯þ„j èóç©ë¦v}Õk|R¯kc}ý‡òé´>~IçÆ›^ã¦4¾ê ôº4>ëMþª6^ö^¿%=Aؘ涱rÎŽ`[™$¯|7”縻EÈ>?:û=ÝLÌĸrx-´}ûÿÍüMoæû…¢Gu ªÅI°€ä¸ªAöò&àz”ƒ¤:£vžYVü'ënœëø#Ê’ær`˜ I@Í1C#éé‚çf0å³NG»]†8ï¥Y.—¶`v­CôkSë5޵CUbn¤Q•1TטñËþê„’$ZŸÚŒÞËßéÄÔÃ$X=¯É‚·º„÷ÅzâŠÍãkd¯§1Ú¹‹Èh„ó]‹™#ç)˜»Û( £b­Q|µU]pPç=Ì bÛtÙé9šNÏb‹ö™ˆf/špýT|‡¸g{Ü‚cQ"¨ÒÄ$AÛ •æ§!T"ôm6¥ç9e'FË{ŠOöüÐÀ$¸]8UÙ™5f›&ÁÙ»AÑ &¸Am†À¼4@¿®3MõIÌ\’£³¼&ù^’"5ääd7p&¡S ³³lÌ*v…6ðÚp8ÙÙÃÕèŒY„¬Aˆ4uu>0îh§QíšfOnf‚’âÆaÝ-Rýw¼ÙB+Ê)MK¼&µµžŠ9 §Ùk"`t†ëµé}Ù®›´.±á4‡‚󈼞jй·BhíÉ fd×@ÛÉæÈ­¾Xñ'¶å0Ñaò íÎcF"J’6Fi¿söMa4Š„ñ¶¹!f*ÔâÃo°îeõ· S9‹ý'¨3±ôÔ M–íCÏg=¤vsúKŸ.[¸ë] ™¢¿>àœS[ÿÅÖ}áŸÞ þ}Šy.î&0ŒnSÞÄ~Íù\vMH«OU4!¨¡LNÛd‹OÊgr Ãʬbä1‹×/Hé…z–L1WÖb©Yd&—)Õ²-›ê|sZ—óO<†¹;Á†a†ÎFžðËB.I5%CÑ\-‡õÈO2gó@ªÿy JxßÉރΠÕ0IJ¤”š–yJ ”.RÉc<ðÅgOrïhŒ¯Ù²¸í ï4ÍaŠûÁ¼†OìѬآMM«›æÖ—†¥GZ•*¨¢á4)@êf–6=(XMãŠ3 ‹¢P…¢'¼³cê¢Ü${ÑÃZËòØIì€nÉb…¦Ðsr ÊÛ9x&v[–·9*¡`Mê H¢ÏÑžX¬ÔW5Ùæ¸U% ·»bŒ–Í)žëŸ‚n">ʦd¥„u*»HÛ¤ä%1Ò´ÐÜüÚeÛÌï£bhÞa¯1ÅFæŸÕÜä EµqšHD|Šª)ɳ\—ŽÏ›©·Ù׫žIï†~jãÓÞ”/kã òzŽòÔ·‰E¯¡¬Mèh'h¦™;‡ƒ~¡Ì˜‡·®Ë8§½ ëjï:6\ËVÂÏëãÄ+TD·e ›†éH宯J×M‘b,Ej³àWJºð³-ø%­ µUÒÍÿøA+Ç…àçà œPS!‹(Ê–yày›Iùô} CÁí1ÆT‡Â ÆBUÎÛ€AΠԾ„ T͇AÁtŠ ªÀ äù~“(hˉð•”àgqüªŠ¦V4 ɤ.?±s8Ë—X]nì4uý2I3Æq(Þy2ATSX“ëö T¨»…±mhƒýi}+.CõBL)»‡†j‘;Kb(ɲµäδbKmÊ=;ËÕ–úÙX0XêÒYKéÄjMÌsì«MÚ-ÝÕ#fcv [1þÞ¬¦f¡¦DL¢P6&PѺ‰)"ÇŸ ‡,œ"¢USŽHxPv_ÀPÆhkëü,ˆ4ÑXUŠZÛ‰JÏB-Qíu‚pCÞ£~;î­9÷%‘qR“èæ y'²*Òø®’sfMÓ3ªmDχž4Ö k·cçTw¢.0i#PþZûè:“uM´‰­)XÌÍøÂ¼J[‹ÞSKŸœWò¹n7È ŠTЊ{ÝsÃP óÛ4]ãÁM\+¨á¸¥ð÷†ˆQ},"~¸†öÝ@1õœÃeˆªÌâÊe@Ú"Õ°Æf?ðo"›1Lm]|nFSàóbýbØÂr‘ŒÒ‹õÀ¥û¼r…æ,`C JQà'i¥BìJ±u,E帶V«Ÿt`)–¿„³öjNÖ¤6§‚óÅš@<üÔ’9ü†4²X5[ß´¦c1A1=H3ã&Ƨw©ëƒòW©Ö0[3»ãj]ª–¯gfž“ÉrUz¯¶ÿaÇ<{‡¼jvòɽ brãÍÜö2…t6äâ¿L‘^DÍí1m( ð)Œl ·˜ÎP^ñ¾…Õí6TóÅ ÈÄå.T‚ñTæ…xÜÜ„?T#°EdRÓañªŠ–ä3)…Œ^°eV¯XcX(ä0ìN§À_Á¤×}ƒÀïàP=X%gK]Ù\™9e o\»T°(iw ÛŸìÑBǷɸF ¸áQsƒ÷"K"–r®OÁm ­)‹‹[±¨±ßb}­zH´¶RyÓ=Ò¨õº±×öÒF«Y둎ÑW1U$’>»¼8«†ÌÑW¬²Ô½àk&9_½êH:M]mþ€ÂÉþ›ã®w“©ŸõB¬•f7ìU×uëý~ÞQ¦WG'q×ZúwSâ®?lŸç´„$´9 Z)_ˆ-çqî %\»*Þõ&|^ƒ© å$½#D;‹»6¡ÚwmÓÓ„kyÄ=~PˆÖî¢Í‘#^Nq¼ò zÁ†Ìpr³ƒO´Sòê•v­1$j>‡¯Bv= èh±1’5òEJþ£/¬L½þ6êA¾pƒÚÉÅIé VFi»×®RÔ¹¡ã}æ]¿·°µx XÁhY -qè E§ù±§AFׯBñi… ñ»^2˜sÍUð’ñ; =1»å&…n©LµöM![(„¥L†+dbÚ„ÝÁ-¼ªë·å¸§?å5€]AßKÍ€%'%D¹É˱¶A}ÞÎ&á±…Ø H}ë$Þ#6Km¹Ç᧘¡ñ1Bñ÷Á¦)>–[ ûG B\ÓLî0§X'áÍáw˜±@ŒS_/çÅ4ùõ†íÑë(sš™Åò+åú8ä«ü‰”_}ñëáy‰V5©ozXâ¶Øð…·³¥|Ó³¸µÖ 1è%Tæ¤èë×b¹_·?ÖGl)'Ni˜+r%—ˆ;žj¡ä<Í”pz¶)1× K×Üzgø—"µ¤¤bßrÅÔýP}2ù‹%}²]ù‰¶*s9˹«¦2dáüá;ÓøƒXI3wîe·Ç…þt5²› Jö^ºÙ¥Ôn²»-X¹5ÞŠu.mÊ‘›©ÿÑûÝ*ŒÅM®ù·ÕÆõÖq›ö «ï‡äRï’l?Þ‘èsÄœ Ó¤òQ˜‘yrƒ„TEwÏÉŒöXÓ¬¦»/;Ñ °Hí<Úøš£‹O.3a Âgn;T* a½Ð±+íD’I"[,”c5·Ó£ôóИKÍÍ–ŸïâÓPKüµ?±ú;ü%?“W~fÐÓ[Á¼‚‘eÍLG$¡+’Á!¨ÃŽÔ3ªÛ¸%¸Rj'?n•i»Wáà̕˿\UÄDOônó+é§™HçšÛe}öK’–H¯ÄGh`ŒÿYš³ÜyQlΫØ4%Ÿ} þõ+Yendstream endobj 333 0 obj 4638 endobj 337 0 obj <> stream xœí\YoÇ~'Œü"/Þ5ÄñôÝý¾ãÀJ‹IX~ H]ˆ$Ò’([þõ©ª¾ª{z–KÒG†©ÝÙ>«ëøêèùþpžÄáŒÿ¥OŸ|ø;|üê`>üþ|ðý ‡éŸÓç‡C#!áÉæ ÄÞâÐÉCëõ???øvc¶fã·æ»ã?C%š6L³‡NÇgÐð“푚œ Alþ´S^‡ÍG[¹ùz{$&­“›ãÚæ³øTi¿ùžŠÃº…Ù&øEÊ0IÝó@Ÿn•›¼ vó­ðÔöë_`šOc㌟ÂSí&!ôæK|ꃀi°ýr-ØÖ2C##¼Ü|3a3)“&ð†‚JA6÷¶Gú:á7ßÊiž ¬ûã­ž”„¦0ž’@Ke7ÅîRJkYÃã:fZŒKËckJSH'â)hÏOˆãêÃ#5ON„Oãs˜Fß|‘?Á”BA6wñÏý þ½Ä?/ðÏSüóÿÜ)­Oñë9þy–ÚI$¹·Ô/¶y^Þ=<)¬ÏÊç[Äû¤g0Ž6Šù°yØYq•ñ÷“:Ðl òð)?lº/Wô°<|5Ú{øz0ÐëeXŸûÛü4ž!?Cm&¯‚§CTv–ñÃVÅÖ¤š)`›$xŸ³yÂ'­AxàÜò'8<递V!Í‘t0´Yã'cq7 º[`Æ'Ãߟ³:çˆüùç‹øÑδÛüé¢=ÉZâk1«´Ï­ã#\E ëVW1"íxOõc«dP¤ê ;NWú*É(-²04b­fŒç€ 9 ˜Ž±5#®´ñëiæ±* ƒ)UÀŒ?kC6TeÚN̨ï%û-Ñ`,7­g¥eý„Fg6 f울¦¿h€ÁQ& K1"Cé(ÔF&ve‹ó!rÑeåô:Ä輤-j³ÔN(Uµ7’µl¥N "µ’™hªñ¸OªYÄõÌÀÉLá@gØÄkÇðU¯2%ðmžõøw0ŽÐ%xãïÙ—íèÏp^bæ÷¢aöجI‘ çPé_DU¬gO¢Äx7Y]H#@òT§'&Þ ²¶6-—á´Y5 y­ Ñ~¾Uvr0&ƒ¾ _ÏxànœJÁqô¦˜ûJË–í¬Ú»)¯6™ "Ak7*yRY‘³¢zTè·% 1p3¬–*§ ËN¸žf*=ÿŽÆR[`Uº?ë·¸À™øh‹]@­0?æ |(‚öüaÄ_F[º2ªùÂO¶Ã¡Õ™øô6Î}=+¿>áu†£_Ž@üiyx^>+_gbÅ?A(lfÅ|¡/qFã8M^ÅÐÏcóÛû&¸wÎ s¼ðc„HxÔh‰”Ízá²YwTR¯¡§¢ X&âígG[Ô‹c_¥€X.ù;ŒJQk"t•W:*(¨p,•¾¤–A‰€ÀÞˆ™öjµ„½¨B‘?”i`¯ò­òPÄqTX‘Hä«I[6æ@Ùhµ†êÌüœ¤•u(>úÈÙyÍ<›H/°÷8"Ф›'!9¸mèjXçF{×›y™L8h^àZ^(RJ:Þ³Ú]ÇL‘îÚºÖ!úZÛDJ>„1кX;É™ù$¿«ÓÈW'¨Úìí„Ê…ÙtEÍ 3º*&eÌÕˆ ‰Ž=d~RåM‘¢uÒ vnânÌIun!HèFS¤Ó5@{äØ^Œ…HZMl3ŒÐ&ß2ÇFkIod-f—ØF:ß-J‰ŠU-*ÝLGÏ61ŒcVÁ(ó¼7r@pÕ&zÄ7t᥉t’ éÖJæ814Zîe À »ÌX”ÍDkf)g ¬#¶q¾bQGÞM ÚwÊ?Çh“ä¯X„QkÖM †Þás9{SS™íz¦æÎ"| lÍÆ UbŒ¶2ʰ¢‚²?¦vÙ&»¯à'¢^Þ°ÑÜ2ÎÍBUЮkÕž‹­ññ¶›ôpe‡Ëõb)1d ¾ucTóóG@ß õðšÆŽ›¯â½Ê€,—×äúÀ©ÁrZ­Ü¸M?GºÄ´.ëÄRî†t©–‘M{±ÓÂDÃ’hÔŠcÙ…:'h£ GPÜ,JGÃ2æ|P1וXm/×ùR¯˜›,ž)îÉä×[X؈‰«¤s« b¨cˆB¹w]éÄ‚VTnÞvÛÞ-Tó–$S©ó}#ÛGñX¿Êœó5¹O©ap»ªté*JŠ$äãÔ¶¸™à¶›¤Ò¢WJ«!(á6#‡¤JÐiR‘µž)—¸p”E;šgÃä‚TÂÚj–›ÖMkmKªlClµŒØ¦z¸ôåNò›¤âE~µÊ6ÍbE+Ð(æ©=èEå­ ›4v€·/ff>€ÅJªÊˆbɯæ?³^ˆ•¿‚3!å(ÕÂ2èM oŽâP±/quü ׎ðÎçÊçTãŒÓÉ 5/}f V€ÅâBì)›)ÁŠ §´V%xâÿIÏÔ½ÛJÐË€ÁÊ’Âé>Ôä;@KS‘ô*n 9ãÒó,j-=óͥ˼ٗæ% ¡ª’©ù›”hG­Ö®XEyß6Í5x/ÃR)‹Ý¥:PJ>mW]xƇjJFû\H‹ö­sªþ?¡ðòÂOÍ{|3¨¥ezrGyc ëÉNA_­øc´[7cG›,dŸ²»X'oö+Pþ,æ†Û/Ó:M¡§y‰“šä`Jp»±’“à&`¼Ÿv³åÌ-y”*“G© e­?{%{_!gº½ÜÛsOéðš»<ÝÀƒM¸¢eÈ\ÔD2ZhJjgžZfX»ib¹¯pÑ]l+œ0Ü[ /épÂêòPQA#yïe¯( Jó/Ù*g&¨ªþ2òZíØ ÊZ ÈÆ³q…’SÓ•O$…å,Ј¤zµùé:Iï^Æb·«Á{œvöd[’ÒvG·"øv'†ª×ùhûúf¬·Ûêúäs“7“£ýé\PÁVŸ«­Aj‹5Pó)³iïR¤0õPí3ä?ªf¸ªÀƒõÉò°²´Aél.h"‡ÌíFNN¡cëíÒ;étç"©Ó¥ÑxLlƒîÜíõªæ¢TP³Ïý B÷`g|ñŽÑNè@9À®n‚A§*§w£ë¨dèei$-K%Ä8Ùš·¶±lü‹:ä0Ô›•..• ¶lj’Åy‰4‹ê¼=n ™œ/™€—Ý$•6AÌók„„ð’Ä:°ËÈ;n ¬´Fõ=®Åc†ÅE GQy¿¾Â…ÅX[ó!†Dwd‚³K@š/Fç:tb³W@ öNþzö‡òA÷Ê%ûåéÂÊI-Kÿ¹.UIòv»˜Sºr"²šÀY˜ˆ0 ë€/F&­‰Š¥h‘ Køº!þ^­1)ò“SÂÙ6a½õþf£(Æ>u§I×–!1l"¶B‘«+)Ù^#¬jòŠmr†óè $âìr?°wSÔIä[»•²šŠñ1øzדD… ©Àüi&2M¯ê/4IÅÂ^¯½[‹òª¼Ù„Eó¹Ô{hAVñšõ¼ê/œ •áÕ"Úª÷“–ª1ˆJt=^2k…li6~/gÝÎ9–¤aäø4A¾‘Úg’;Ìt%c)Y-¼•† 1n×ÇîBï Œ²Ý5Fƒ¸ÝQ¨wéIç»+ÖŽèf ³°,ü^¸‰—Yçr ´n E_*йIôÀÀ@:¯úHÏð.^7Lº»ò˜â°Ñ!­^–ÿ¿Rqé>÷[¥ÉàÅó¬vôêkäËK/ì"G½ôò¤Üo©÷D^òyòý–Z×zZ~ÂfÌ÷[^Ž–¶¼ßrÅ v¿¥Îüx…Ë®w¾)™Ýu‘¾ø„r/üÏm !‘CÁiS/ÉeËÞTP¿ Fƒ¦õMqVYýjõËbTÍýa¦(sé]òÓ®…‚•/ÅÙýPp<%½,X“Ë”B_±¦ɵ‡úó@` %¬ä­®É~š_ûIúwø~¸JÄ;üÿ@àŠ*þúî×›¾Møt0áãkCé_¥nÆ—›äº,ü50/¥ûB/Ì ížÄ›HŠ^¥¨WÒy®W·D]uED7¼ÂVÀ,Ç^3¢ë»$e)Nªå ^äí$w†c¦\L––2»Õ´S¾TQ#ÃùãíK™æh†~£˜p¼i6Ï>Ùøyê_òbýòe<íÈ\Ý“—äo‰ø7ºþÁJÿ÷ñ1«iJ¹Ìµš¦²«±nˆ~k¾¥ˆºÁH*Q[¿+•^Ÿèšp•EõÂn7¯ÉA¾±]ªŽì ff)õ2hñ+ÛZØ=k±þÒæ· `âþ¸Ûã®Ü¦¼4m„°ú÷ÜÀv%UÝí(gÊ5‹ø"ôF‰µ‡¹fQDF¦k˜¡l‘n=ˆÊëÊ—fƒê{¬ÞóL/³Ø—§¼¡5~›3e„ >¾|ip{¡ÉéþÖ}½?Ðü¼Úcƒ™´½ŸÉŽ 7x‘Ú>–wâxùöy«HS¥k*†{ eu¢ùÕfX©(Óð¨`Àj+ùЋÝB/y‰Úá À”ÃTAïat[Ó_)ÚÿíhMÍ^ S‰qÅGeôQp¼–QÔÔUMûBôj+?§WKíõvÛZÕ¾~·”¦b¡¬&•Ä  G…üóG[0œ³ãý¯Ò–qà›ƒ… „‡ñÙñÁßà¿ÿ&ÆÈRendstream endobj 338 0 obj 4983 endobj 342 0 obj <> stream xœí\YoÇ~Œü¾e×ðŽû>À‰$p.‹Øy )Y2Bse‘²’Ÿªê«z¦g9\ËO1 S»Ãžé¯køÃ…˜ä…Àÿò¿×ß?ùð ñâø þñä‡'’\䮿¿øÝ% Ò®LQDyqùí“t·¼ðêÂ3Iuqùý“¯vnowÓ^MÞ{½óôåàCœ”»O÷®;kwØäBŒvw¹?ÀÕ …Þ=…ÚNÆêÝG{…_á‹10è÷i’oÕîÕôI‰)xGÃÿ ÿŒOp“n÷»½™´–ÖñÉpÌG{9ÅLÜ}±®ÝîŸx_œ,òr»Q‚ÖP¦g™¨vŸïj÷ .AMFÃ|ÚO!j ƒ£èî=h+òÔQ ¿ûdñœFOJE¾¹¿ÏæQ.ÀÒ´JKÃ{à嘄æc”| ÜÝ'øÕmB™Byù¯Ë?‚þ@ELÆúIPáå3P›…ÕŽMMàFÊI™‹ƒ“—1¦>…Ð2vŸ•O >)að•~|½ÃŸoðÇ-þøÜãêèoñëküqÄoA¼¸ÅàØ˜»vñ¾^¼j_׋÷íâu½øràƒ•ïÉ×^óyüƒi‘é××í×/ÙŒøo$›ð®[¯±f÷[:*F=žîõhÿ­?hïø¶–÷´‹oF÷|½¯W“RAƒRít ¤Õè„JZ5{=²iÓ˜l,_î#9¸ÂÝÏø®8ý=x9̪äî9ú‰Ÿ¬7$ pmË5¹1R)P¹E¡?¸CÓµ6ÀðçuLý¦lSÔYD‡ñN9šÕ˜5`ùóG'p=à¸eox˜¦õ A 1Hí¾Ù+X¼Ë€1GøèòÜ^ë¼H¥ ‰‚µžý Ú8°-Gë¸ÍÁMX!®¸4 qÊi/§aãß´;« ˜,g;ÇM‚¢•ä Ä1ì17å1Ï÷hZ˜ÉÕøð-Z“1NDþX\Ó÷øh59ZWmÇ·UvYm^Š5¬"ÉNÈò4/]ÞG'BçU–TøãÞÔkà[êG³}@¬ËûÀ_ûƒ¥A,Âm[X23§àã«v×U³E\ꆃÄD@QT‹òâ 5(¼†dr»® èÌî#Æ–™ÉWA3‹Î¢Á\Ö{„ö¶š2ûͳôp£#Ü š™:þ¼›ÞQÝu¯†:?è @c¦×¯¦à¨00ëÄEGCë#Ñk¼ƒåH¾Èæ ×õSç4èî ÛòEûÄ4×uö? Á›Ž˜Oƒ/ù´í"™ºˆq÷ëA¿Æ‰!z9¾äÙ:™kýºˆÝ½¡¦U„,cd±å-YŽ¢‘aÆwìãæ øŠ•˜ª7ƒ-Nõ† à7¬ò ¸*©Y@Çh•¹ °G/v‹g¶_–hüî7øÑcÔØIäiay†ÔÓîû Þ,ðå<¡ùÖ,.¹éŽÊ•ª]¶D¬§f1IWSsŸÔ½Ùî>ÞãÞ¬A’H•(‹Åè„CI"‘d-qß´_´Òõ%¯8ëŠY%~¬Åk6¤ä0 Ä@)íS,Ù<™ÑVęѿìU0¾ø%¬×{»Z>ÀJæ9yFà}–J((× 5x¼aŒ#j"ZW¥ö—©|Ä‚h¦ÛZX*n‹/öÁ€ñ¨f*8ÍX^/ qÕmƒtóP*Ê?³üÛÈÁ¶—,Ч¹ê·j ’+[3±( ÕÖ™"I2Ï’4v&ÉHUHñ(P$ÄÉåmJ¬ ˜äpf[(Ô²©!ð*ÞôȽ™u©]Ü RâšuçÂô¶#IeJ4@ø½:YfG4[£+ À°[¢kq§¥Y–)Gj‘ Й󮨊’Tœá ’"†U@T¢O‡YËã°º-íW’ã¸É#ÿžI8èÙ®bKè-‹#7&LÈü¬1)ö£[ìeêyZ¦u3–Är{löÖÍíÀòîRBðÊØ#^ÅòÑpøßa#Œ7(¡IÕ´ŒàEJéÜCíþu‰°ªh€OÛ-*Šú8üoâX½—¬ØàÈü-:¶RÖ–(P$T˜-gÅALLygâåÉ_¿nÞ3XI#8^RÃW8©· bšX!7WSF-ƒœóDîÞ1«[Âî‚@»myb•ˆÈ›y¤Å[ŒËu[ú8îm (t£M/fN›B±dWY¯BbNÃf²B n®5’dnÐVû~¶…0v•JzqçéÉCâsgl@IžÜ'ÙÂó†z’kSP]–Ø]!ËMe³–KÅçcvFÒó`k¥F#²códuÉqYÛ Áà 7Êõ“œSµ7BH,C/Y(‘˜Òûƒ‘nŸ3[?ö$XÙ©×›<+ x¥Êfüù<èpKZ— DÀ­°à3«Gõ‹Ãžþ²Œ€vܪ „ *(yf”¯4DùžN¿j(Õ%Ú¬¦Ápà•VOŠÞªüŸu™C? ¢üLÇÆâ }²ÃÊtVø,°\:ä|ðLÆÈQÔ°}à®%ù’L·ŠWÊlʪ{vÏ«¹f|ª³½ÁD¶Ý)Ø™ÉIÈ|sïP˜.Xø²þU3Çtæéæ]ä ñÊÀâ…—†½—­Ê©Ævº¼.PÀ¬Ô(œnižk'´tÖÔ™ïU—O®J”§=õA¾á¿Ry0›D .«äDïXݳÎ[ ­×Ãa5?ýícÞ=sª3©Q$9ûÊü‚pÂf± Çvñí Si¬Ëš·G¼S±F«Ä©mÈçõÇH6­ñ‚6_eSf?Ö1LL7õâÍ#dWÈâ¡èn*wÛþ³s·›ZEÔ&Ú2ñRx„×\gP§v=#ʧ#½-8Ù%º7W;&ÖàérËÆ}k'*"W6ÑöX_nˆn‰]½x$ÿ@ŠñP¬[òxÒBŒÖÛb< N”íJiT䲊¸óí+¬c:Xåw‡=°Iˆ¡Â wÊ'eôVg‹žâÃ"%?Ö×1“å–§”É‘~ʸ˜˜¨ÆŸ¦’²O=)\‚´C£1 Štjƒz,ÐÌXCé”0 7b !Å-‚ I´$µ<ÆD\uÑyÄ 7R°T|Å.;Ôô´P8;ˆ2(Á^¦h¶kÂP¾ <~˜ÀDóÃå3÷(&%;q™ÉÆ)TÏ´y‚Öìy””¥v–yÓѳ²¹¬ •I=j¬BªE뫺ªüÛ C,.¢Ý¿(eRÞS_ôo1/­˜uqD»Ó3ó™N·7aÜâ8ûU ýþd~¾¬—yä+\¥!*¾«Úq(v·½7X,¦|•ÈÅN*ûÕ¨ªĶ1ëBõN!“ bDº~ÉœµYú§[¥/So%Áá`Àýb±ò‘“vS€5~=ŸÉT¢'jfDfÓv"“nļ÷¬¥]§K&-½ç<‰o¤F9(¡“½la¨úl:“x¤°ê9…ðY(AfتÁ Kg*M™³€,ÛV:Ó,Ã@aµVᩲgЙgâ¢ÿ_qQ†VÅð : ÕT©>0dîo$”Q‡q ŒÁÞBS+Eï7WŠ› ”sØôR¡TôøÇa›>þdìã %Àm؇0å:öÉ9ûÔf·}-+•ŒÈ'¤w~ØÉúmƒ0«)/Ïù^»Úw:–ST»àÕ³ggI~PësÃ)|¨ýƒ­jVÐâip}v}`=aÔꤢ#gÉss‹OêµÖ®ô»¦ÎHÛ%Õ%ã\2’c¾Ž=lµåHQ¤~À:<­#ÂYM}÷Í©ü[Ú ¿(K®Þ)%¨®ã™g¯4Å•Æ_j÷R}9\ôr„,Ef¨¯˜0×\f|Ö6ìSÒ ­53U0¢víLjDÖÒ5ê=e_C76î-{Nß< 5½ãeficÓ~Õw‹î˜—.3Ùúh+’k½ Â9ɪ‡cI9x%jX&–æl€’µ¥ü¡ì°jçx(Ú&Æþr<3˜w¿çûÒ˜¹W{è-W*©Wï‘íø[èó9Ù4kº×¬ 3‡Éý£×=†g’–7¢l eÒ[ð1æT´â1º¼´åS*_5áîø(ª”ôÚŸj².ÿƒ“éÔèv˜µŽU7}û`iÛí²çäta[CŠ{¨/«¼ux&ÝJ„í -¿¸j4¦Á;o7šQw€átÊ M脌7&# i1°®¿=•ÛÍ1~£! l©Ü±gmiûÉ¥ã~ÒwŸÐën'÷ìÝÄY oì#”d›ëëeË“Ï, Þv82Üzú®Zü±¨xÿPI•Ï.ÝÀäÏ4ind*9öð½Á.°“rQ.³xEÈ=rû:öEؼì*°Ôú0¦ fo>H¯qûÆ<Ý¥º3µ¦ˆŽÔÉhËR…icâEê*Å*ÿ³Š­ñSz5~ Åб ¶nÀ•!æõâóžM@$,ÔÏ‚„O2 D"<=s·Œøn´Žö{;þ–?mDD&áŽß ÖG/äþ\tËFº`Ûkög¿òa  Ä«C¬»“ þéŠùÛù^U‚ıS°o®üÀ‘4^6Þ¡ºPÈ&"³O×Ç´ã¼;R©ùß6Áí¢Õ<Šñ0¾c<Š`¾É•X£-sC³7ßÿ›•¥Ô¶â EBŸ–öó +U»,çìåÃLe¹¸|ß„£|Dšr‘Ã~ß E~MD{ôc‘)²üøÜ?ÁÜšÎÞúãLFXàŽxôª¸÷æ¡{‡-à’UËâ<‚~ÿX»…Ñ»Öç–:±ïâ(·IãY¿ó²p2ÚrE〠5\J^¦S9·Ö1m 1¸¡pКÆíá6Y:ì»õ³:‰W§:' x†š|°$nXº~`7¿JŠHl¡±ôzJg÷¤±u»OOLvœ–¾öªðé“ ´;DF¡(Ù6s¤ù{RO3BÖòØ|¡or¿y×eË«ôI­]ge=öì/ü„hN‹p~ô®U”³‚,1ïpž1RÓðö÷_Êí¨#e¨Ï³ÑÂØ+ò…Q¨ w™S ¶ÍÈ× °Çàzjèa§ªW™pObþ¬—ÜOÛ¨y¢4:¥’WM)³víÁߪ—2ã‚Ǻcð7MÊoF³#4<áÆ}*d“ãÀ´ŒJ> stream xœÅ\é“Å‘ÿ®%öo˜o¼G0í®»j»6{ØË‚`}°;ÒŒ4 fÀò_ï̬+³»úÍ{ZÀˆ§î:³òøåQýÍÙ<©³ÿ-ÿöêÑ/>g/¾{4Ÿýþ{ñè›GŠœ•ÿ={uöë'ÐHix2¥9©³'ÏåÞê,è3í/Ÿ¼zô—߻ݼwÿûäwÐÃ(ÑçiŽÐéÉ%4ühn¦RR»ßîÕ”R´i÷«½Þ}¶?W“µ.èÝ“ÞæãüÔØ¸ûžªÃšm‚7Z§I+è^z¼7aŠ!ùÝW{¥àitìí`šVcãŒá© “Rv÷Ÿø4&Ó`ûõZ°=¬e†FNE½ûfÂ&f2®L5 Œ..í¾ØŸ;èTÜ}¹×Ó<;X÷¯÷v2šÂxF-ßýv×Z{Ï>éc–åÁ¸´<¶¦2…*Ÿ‚<·se¡Ÿ=;7óTJù4îaà Ô~w4ýGs.x½{ “‡ÌîõÞL1zXE{„Mo¡§ Ð5ÿõ9ÐàH¬Ãu^‘Mnw…¤ð“³n÷ vm-œu¼©ƒ¾é_íÏõä} §)›Ú}½£ƒ1uxº_ïqæ8©Ùõâ⬟,éuë4Zeï/`5O{›¶°+Z¯6v÷oûsæIÎtˆFûÈY‹â§°™º ÷Cx¥¼£|²‡õ„¤yÏÂd:Á2ËôÞ…°Ê‚Ňb?ÿDr…ì`´@d‹2®¹íŒÙVÆù­3!²ã>ֆޅœÌü¡ ÃeŠàå™èŽDOÎâšÏË¢ÏA¼œŸu^{Vͦr¼Ÿ}•:|ú«:…¤”6¨+<ïÿg8OuW)b}Å9£²£¸í3Õ¡Äñ=&ˆÑAw¦>¾èóÖÕØ`Uòü†cm¿vÀÚòþ´÷Þ~¡ÏÝU8нkÏ?®{ãâåä}ñyeKžya;í 9Ëä‚O01°·Sã_<â?n…[=ÌÆ*‚|àOÿ$Î6ÒÌÄ„ qVLÈô}X0 1ð‘á I°FÍi‡_YÙ(¿ÔŽàÓ}ô¼Ñ@ Íic”l‘” \ ÖcU½+»È–¡Îr¹'¶fk–/™m®¿2¿À?†5uœm›aÄÉ“a³qVù€>9hN®PwžUÖÌHSƒöäœÌN¶`=ÎÑÚÁ¶ÖÏð¯wøÇMi§q•@Ö7­Í«þ°w|ݾnßö‡÷íáÕ>"ƒ{?ßD1s^F~ýmýª=„ÞÖÙiú P#%²”ë1/Fû†¾ëɺÒS¤{Óß>zòÁy¿øÉiÌZ>kïúö£ƒ4~Ýhü¶½¾ï¯¯qœ`;Ôç½!?¡Úpq@† éOu@¿ø\[ú¬›¢¥…ÂáRòY8ÜÞŒ ¢rSÂã-J6+pëÑ4àjJt•Ȇ¶ˆø, ýìÈ¢mÁ@;ëÉ»û ôW`! ìа÷F o˜µ‚eØ–i‰ÐXL ¸ ÕnŨ+(e$°nFay:Øñ¢L“[€gÈ É£Óq p¤Iœ¯˜1ä˜7x‚S°/Z6ü†VUH»mAö¬Îf™ƒ¹»–¹Í¦tFËTÁ•‚žvNeftœ|Yô¬ØšÁ&ÖE£æ/‹6*ðE~ˆFWÊ!:ÆA^åðÎpC|ûÎafH¢ÎËü÷Ö”l´Nà×z2Ò°â‚߯¤Q{Ç!ïû£Áfä2à¾[?ZÙ·¼Á«]§ ù=¿îõ‡väml3=lg©ÂôÆùiÍóØtÈóÅË1!ׇ±ÔrhžÌÀà ÂbŸv߯®ÐÅ¡ ô2Ièk¹žcqYÜ0uC†<^®Fzó£¦ÁãÖ ¤ªé©á|yþ‚îe¡š tÝyºÑBu`,ÏF+?ƒòe 3Ú$ДÎë@ˆ®æ§†HiCIjL{.¨a;%MêÜ/Îïñ¯š‘ø¸ÚäŸÍw;ùCøýètk}Ã{W#|+L¦w Óèùg4—Kú£ÌeqX`©]´‚Û5’KY²…¸9›£S£#Už‰Ü¾ô³­ ¯*][á¹l=[ÔßPÛ‚G³¦˜Hwõ2R/òFï0o‘9¿ ï#PD2dÔ1€ŠïºT»±útƒ¬ãñ™(jŽV5Bj:³5ÊÖSëA8³û]ä(ö•ËTý#á”^wó OP‘¯ê•s°.yÓ¢'þ†}²—uŽ4ÍÀàj£Ôó¥7z ß«½ζv¡ n„#¬“š<…t…7Ã}6oÿu`òÞf~Ó>ÐÄÕÎ5¤WNö²[P”zŸñI;Ìm>ÍÂUçB£P•…/zÄ~Ìa–a¦D˜±H.Äæ–´<`Y¨\^C.›1Á*'¤‘ÐN€uø¡7n»»é? ÊKË„†M¼‹M-ºt£À݆­Ñg¥'jŠ,3‹,"'9Kûv`ÝšEmOØéåŸYš 9ZZ-‰ç˜ÍFkå臖øëoRÓæGó‡Qcm¶Q1°œ{eÈ@åÿ+¶Ž²ÖÝメuÕOZ×£@Z(Ig:à­Ðz^Íi¡õ =¼À´$l\FB\[°íÈH eUfp±\*%|ý–Á¢”BØPJ8pÅ¢3âC’\@'RÎ) ™µ(ÔÑ!aKÉôȉ¢c¾­ä¿ðmWíW]ê0íÑeá?°“§ú€åisÊÜ2rúCw‘Æ:ÎS‚å‚ó/*ôsjA»>ù“a*ªÅ~t`%=0y'­«¼·!åÐK d¶³P8Øšûþô:[ó øq¤<ºjÏÄʤÂŒÿ½5f³VÓ_öC‹ì¶Ž…h¢ù¢º_v÷^‘ €-Ð `Xò‡Þûåut›g¸¾¤]°¦õÀÔ„ŒÁ(Æ¿k“T-YÚ ­Ð9Ma÷¡àõåwò) "HÛ€[¸ß/p² S5"–µ4ËlÂGÁw•£_›Ðpbó³˜ãÉס‰!e2¨D°óv çd¨úQ‘QŒÔ³pÕ_%Ë $(iÈJÁ¼Y~:eYUðÀ=;$xÅFT媈”Yî=¾ÓŒŽ`“¶‡*ZË#8}•– ~"ÂêûÎz¸cÆÛ#½ÙÎb8¯àè¼u[T &T Dó@Ô"bÔu3Cóxþsfh(¢[ý§áûþÃQQ–×Î:ƒ8>R.ɘ™Ü\¨>üQ˜„ÿ`ä ‡Ê×:•åKì·¬ø¦¦l¿ÜS„5%Ó¤)‘Þ M% ëõÒ‚ï…b‡N€Õꌅˆ°¹6E¶¬ŸqñÅ^Äá«9"Ž7É|¸:Ç”wŽ8–yÏ3!1ú¬ éXå2”9+¦û0[ ±lñA/`4\£qe%…;k H° v-ÒP›ÎO‹ff.ѤV[M†¶ Pw;]Ô°OfMpôˆ5‹Lê|©"µrdÕFŽA9í¬d®ª×6<Þ¼ …„ÏLÜvƒt®0Â-¿¶´4gV¼‡ xŠœâ@µ* Óü ¨*êh?TêJ›Ô»ÿË€ü‘ä+·nnìp¶ m”ÌvÕ§ï7ƒTë8æÈ”ײ@Áк‰ÜD>–+¸OåØx¤m] ÚGFï^É)Ä[Á ¨Ýwˆ'™ƒ€Í;‡‰t¿JiÉt˜ˆÙ ÂÄ"YL¸ü6’·f›ôf˜Vg…MÃdyH,5 Ö¸¥Û$y£Ú¶Ð $sÅ>ëô!›‘—áÔÒœ»QþŠgƒ†7|uÂ2¤}œoÛ³«±›Q^±Î¬º¨NxÃ6“uIÀÒî¢LЯÁ:ù¹"ü™± ÷lêÏ…kSÿ²=Î̼Ø|E/'óãå÷jÞ4fJÁFàJÂaÅaùäÍ‚À*„Š ë>@˜ÀÛ¤HßÁNJA76Ä)¸P¢Æ™@E–TO„×îþg?f“ƒÆzd‚8¡w´oÐÕ6µ:,âùyr&ÌÏÄdžµCeŠÝœCáT­VÚE'nÃ9AY>Æî @ñlØòØTxÔÞã uŸ†R›©Ï:½¬TÊûuVH£ª:Š)›aÉ?Mîf.×[§H¼. ñ9èÑL™¾éäéJñ¢Õg` ‚WCGÙÍh2QkHœ‚˜¬iÕ`ÚRaL®]ê!]€À3ëË¥=隺æðñ¨(CZ„ŽHp…M——€¥<ئ`ã¢øëÍl«Xå2 G»ŸS<)½žCÎØ2ÀÞ‰×/.™f·š¬ŒÄ [ CƒLõÛF\[æ°<`7,s!òPŽœ_,g®Ï•8Y5†MÏ$Na9î†T ?u£MŒ(ô‚RIÇx½\æÛ²Û@)Ó| §h¤[øQy;&¡+?Í,𠲬Î8ã¡@ó:»]߈`w‡U.ê^÷Ԁ̱ˆc µ¬‡ù££¥‹ÝÝ—E¨kñ^Çx¶J7êpúëT?0R•›.)Ö²w{ö;D¥œfÏØýµö¬Šu-²-Êi5è<ì£@ô…¶{ Åm"GLz¶Ù §´éu—øÊ*uZn°PXÆ‘Š»‡‚ÃD®3-Ãû·£÷-s™›`)N´éOP:JÜ *E©Ði³*†O*q9:›L1dOÁУ"ëAÜd^ÖzܵDÆ;.• ãŒ(¬žß®pÊÕ/.”1hsŒ|e²Ý’(áà•¼|M-ºk‚·Lq®ó$˜ °°%ÌF0£µ¨eÌ{ ¬#jJ0U ²¦ÍvuWæ/uÐ/ÑÕ¼i~ T1æ¨RÀù—ve™ß|(»n²þdO»µý¤Ø•šc)v%A±)v%ÜÂ*>V¸†¨Y®ôUðS#@¾¦Eæn}á(ßó‹˜ wxÇýêÃ<˵m&(NC–™íaQ±Gƒ~V2—Ù–l—\G%€›’¬‡¾# ¥2å ÇhŽ8ÂK<Ö’2wb©…õ‰Ò °¨Î•àÂË,âV¾‚·GQ’M$uW“Ù¬^±ì)9n0™ícË<¯Ñ;Ι£}xMæí>†lP;¸|-c\ØÔêHœEHW"‰ „±€ˆ©Ÿ‘«†ã¯uÝÂU“±û±«ÖâXù.†‚9%&­¸¹{ö«òÄbÆaSYWHÆÍ“P¨8–l ³Bz%Àpïu}+êõ m·¡TµwÌP4\#ÎÐ TSÃ2#Ï„f•WÜ.½b½úв|drÈ+.,œ?ôéë-}ëySƲ‡J%ÞŽx{ °_ìJM9²‡€e;–ZŽªf}} WCf}Ë„Gg*ØÏ¶ñË5‡Ø¥$kÄÔgb"}!Eî¦S¾”2…±„g.Ìî¼ëw ·ŽÉç¼û±F(—àš-1T:Ÿ/IW{Èwè„<èºÅ´¥àkdÂõ+\èŒuâÆèzÐrUxèV7¶Y’ØfÎÅ ªÍ?îzÅfynÊWáòº4V+S+üêÈVÑ^Í'Cl%ÒY˜¤âÏÐûMYEp¨,ãƒ}¾£2ÇuOVš ÏZwSín÷éZy[î3˜…<—k1ã\> z{Œk#«Ÿi¡´´59Çòˆ•ËP_ªegmIÇÅÁ(uêÝ‚±KjwÒb´òf}ÛBtº{šÛžG%ã0EGž+Kzáƒë.#¬¬ DkÝÌj“%ªE~½¬g˱ÚÜ.$«Ò]þi³`|í);›ñÙ®0Ð SÿÝPFe{;œ|÷¯ÝÒw™x)%¼GxaWÝ‚ùµPOwÙ7)kÝgs‹$º<'^€´®€‘׺¸ƒ“- UùÌ"üɉ[JÇ%aë‹§Áqpàe±¢û‘,ÕO}ŠH´«·þ`¬,“uÃWYUšÖhG±5½ª‰0™í³Ce e§NübÒ)v£ÖvÍi¥ôlLË"ÄäÑÚ ï‰¥¯Ùµ†µ¨ÓžW_‰:_*1\6ﳑêåf$;þr#j#«§~­^WFq]ÙþšI_Ͼ÷ÊoàÚܰHäìTCæ­€l¡S™o*ã/‹Š•Ò¦R×»ýÜ5ȃàõ*s§1Ø8º¸&¯¤#<´~ÆÝ‘>úÐ*߆Y…Ûz‹bè>£ÐÂÑ_zhþ’`9•$àœÊ øÅ H÷ÝK¾_Ôû÷²TÓ#ml–{oyà ð;sª[,ñS¼#rJ¢ãн7Íò©’a5F‹‹§™˜_$ZIÒRès f;¿×Á•ä€ñW‡”=íÆpÜ3Ô8õ'…À„¥Ü…ãZ̪Dù#ðUÍZOX—°š…#ŸkWa¨ /‘–JHTùÛFd¹ó ÏÀÈÖmr;GP­ãª¬%*ïrÐ/0dš÷϶I&eèdt]czå¨Þ„þ}#Å„Xò€ç,?!SÜe&–¢Ì®j]cŠß¾IŠªŸv#s\â߆w± 6ñ,D o:öE•amÈ1â·Ó… ØÍYáÿˆ‚öÝXáå–ü—7‹^À{˽oÙFÇbþk«dCVËÒR¾`ör'v­8€ùxúF€5Cïwrˆs×£¸»XÍË/ð¶Êß8å#(Œ}Fù ê³x­ÈøQ2£ò‘Å(Í#ãщH*~‰%#Kor £©ƒ³ùY9ŠéÚÄF ü‹Z,qAº²Õ7ÿ*Gf¾+¥F³%8Ø®ƒž{“˜˜H\ÏKù¦úÐ|Ãøˆ[DäÈa}èn¬D%¿`ÕÈ©óoi#èIùæô» K«Š%–eÖ[a¢üU´êF)„²ÔÄ‘3`Ö¼ÉeR,9C ¿«ÑŸLi7Vwej äÅ›ʽ€¼å˜-ÌÏS3XÙoæŽó­TÉŠOkµŸÎ±¹znt«m}{¦«Ý`Z°hŽcÃÓ7´.ÛE8®)]4êeøõÉfÅ@†œ¤‹Tâß$w‡—À`³2?–ÙÈdA rÝÅ8ÇëhIŸh&çH•Ÿ<úoø÷²¥b·endstream endobj 348 0 obj 5799 endobj 352 0 obj <> stream xœí\[sÇq~géGàgYÀzç¾ãTReE”,‡¡m v*‘ü$ˆ2p@‘)ç×§»çÖ3;{ΨØf©$ìε§ï_Ïþt4âhÂâÿÏoýê;wtùîÑtô ü{ùè§G‚Åÿß}y ”€'£Ÿ¼8:}õ(ôGNÙYBÞ<úac³9:çÔÆÑ'nö£œæÍ׃‚ç֘ͷÉçÙ{³9Nàé,&µù~*3j£6¿$þ h þ=4’BcW¥¡¯¢_rgg©ùsø÷+ÁŽb²›/=*%Œå“a›ß bô~Ö~óÝ0;X¸²›ÿÆ~~œ`‘§ìFN´†Ô0Œ¥½Ü<Näæ).AŽZÁ|ʳWû©ê{¢Ì§öbr›_-~Ó¨QJÏ7÷§figXš’aiØzHkYÃ@4ç½àSàîžâŸZ+=§)¤9ýœ;?mÜ8Íp„§ñØÄ`°áI|s¢¦Ñ ïCƒ»0˜1b³-K¿(O_ÂÚµRn¾è6-ï¡“6È'6oÊû«Ä4?'mØ9Öé:½~½g3 Ç,ú-üÏæ%üt~4Æc#?œ•lˆ÷ØØ˜¨<ü‰ÍvWVƒC_c{1Jå «rJmná!œôY˜kªŒa¦9vŠë¼ã[ ›ùÂ`ïjF:Íq9RéÍyþ•éñEKC|‹4tØÛn^ ÒFƒüü ³Ëüº»¶º­p|$«s£N½+”˜QÆ#»lãôÀé‹™œ˜ùLiÞhè”zWZ^ç×åW ¨ŽQŸ?ޤ~SF`\€’ƒÞ€”ŽÖ:›NzqfòåëZjžgdÒ%ÛJtNâæO„¾›d NÄøÿ¢ÃÊaNd­üèzÅÑíd+>ƒ¥½Â…ã œõ±MI ~rqývÒ™à 8Ã+2ˆXéùº'ŒñôgWÆ€Í0ž`ó½(Dgb‡ó±F…òžZ9 åØ*ZñU+ÛÀ6]”ˆRÌ&Àí:h¤VúÝ“ñ­EªÂ{<|éըߗvež¼h±äpœ&k„ü#jŒFÍWÿ+®ÓÒÏ Þà Ҁ2Œ{+)‹ŒœÄQëDk|ªÊΠ£ ¨°SÚÀû^÷ðV‚ýkІÊyKûòÈ%¶œU8í"7$B$ÆÏÿæBÙ kf.”‡C1ró±xW‹3¹ÆvŠ„ðEPÌFZdeƒX½áOÓ4L ", p[Û¥…6Š x[»X—A{—:üØ•(¾&´)`0ŠÁ ®TÜym.v$ßÏcüg€nLµ¿.LÙãÙ®ôã2 ŽVk-)¬4:éXìtÛå£àŒ5ÞS”JT>à›°×¨“X~v;…#gd”6’Ì:"è|^îAÐLzänA~¶Øâ? æÿ¢<ìúzlÝ)7€Ì ü ðÙ£Ó'?D¯¥Õ Cli©îšà½ð*J>æØìÇèM$Â]5†üÌ$Ï-³Q0ÍY¢INE’£È–5®?žÍcîÝb¯Úz'3_:°åöø!®ÃÏì€Ï¡‹F_MïâúËŽ³æoŒ%kNÜ[@úyIš©Ö 9fØi:"ÕøKZ¾"zpì8eO:ªJJØäš$ò ÞÓÀξ²°Åfª¬hœÊ y'‡ÜíRŠDQ4#;2nld¦Á˜ý­ÃÓ‹°&<äΆmíx›^¸yQ•‘µ'ðº(ºÛH괛Ěž7~Àœ½kÔÐS™¾‹ÑXƒqÅ´3û…úsMAL2 “•ŽWýÀ§k‘™AâÜ‹c'˜ »GÚqÔmÌZ‘Ór‘`D.²‰WrAH0³ÓÓŠ&šÊÆO=Á †ÕK «Ìžâ.yҜ⋿.þñ„3‰'Œ*üÕ-FG†(&=?ˆ—Ü(\º&[‘ÔZPm¥æÖ¸æiÆèYjàpµO§퇢™øÔ1z•gá ÚÅUÓ¨¤n”Xë@<ÎÔ*s{Ófwnˤ«¡ è \_ÞW㔢Ãf- ˜`m“Ð*‹½XŠö[x7)îÃèË8r*9ÓÓ3ÛHÝÒÖ¬ Ó”eŒÝ KN$6 EŸLÅÖg•Öíë߸ßF±d‡×£KâÊi*C×¾áÒà€©¹™Î²b›Á’†·µCSD$ê~9Ë‘‚˜Î<_:½Ò£*ê¤îVÉi=‹oÙqââûÌšg3õ–³£ÐòcCºy9÷ò:rÆÙ¹\÷’{])‹dõó §Tޝœ'JzTiz Q±ìäÎÝçù`0ÏW‚^˜ª`€Ï÷9Ci³cõ‡mËìíè îs"]ÅBh˜9À<Õd · ÈE §r,JL¢HAºBP$‘‰gšS™Æ«êå1™³ð´;Y"²•õÁT [K[ÉÈ0_ e} ÉlÊ®úß"ŸÒ–,4Ä„æy|%Å®<~ž÷¡qÒóY»uæIë¤]já¬9ÃV´8ÝtŒ"íÄ,µM-’Kùt-î„ †&}˜+Ä Úd…ÎÅäY* YØmܯi"ÚVÉpU»”bÆm¡g¤µeùÁî2~%6D#Ö½7ä?ˆ:XÒ¿4Å3>gÓ¦¥”i£äÍj—îÓ³œÈ«zFÍÉò™UÂ'Z·Fq  OÕ…:—b¡ù„A[ «,`x~­ÉßV}|ðót³Cu¡ÀUE)½§3!ªµ˜9QÌðÐk)a,ÁU†’`µ’Cä×Alf‚²Øàú5e úÐ"Û>ËF4ûë™eƃ¿Nt åR°rp;…Û…°&¬!@¾¢,‡õ§ÞàÙQ¼LDB·CCПP+Ù†Æúýê˜ôæ! ´ ÃeosU÷åÃó‘·üuzˆyL§¦PL°$-PÑORxÝ{_–ü¾<<ŽfÇhy]ubó'â=-OkêáO,ñ¸¨T`[×v"á%–­1M¿„‡ø/¤AH2Ä•\V7ûºBExrS×r-GÈ*ß‚%W«îð«ñ0oäMÆÚ ˆU›\n…\šn¦¾âÔD}B/€ñvÏÈà~ª³ŒA/Ê>©£ciÒ4éqò É_Fôó)á M‚ùîõáuv*B ²Ïõ.C vž » 4µv¥ê-æçy™wŒ!À„ïEu@ºŸGª±à6ŠFÅÌQ EͲhµ=ÑYä2;|ÍR•”—ªÏ2ævxI B‹1ó[ã‡Ì#?çM/Ó¾‰½oB7JvSª¡(Œ†|—µ e+@å諺ÐeÚ¿·pÝ:qª×¬X@š©¬R«Ý¥2чïf³Îc;ƒd,*š˜!Ÿ2†ZƃX‰NZ ¥7)Ö²Ó Â@µ@P† gƮдDTù™pø"gê¤puiÝTåÔ¥¢c H]›ˆ@ ´&W8‹Aõì‰À0f’MzÍ€_ÃjÜðÄ`0!9D×Á˜>dE*‰ã„± 7P‡w@¢ºô©`|Y@#-¥ ©»Kë“‚SÁ£@lÆaÄÈiý‡‚}±Â©EÚ•_ŠòÇhQ²ª¥¶þÇ!<›tæcÔfÀ¬qjäĽYÿï ÿ&®Mÿ!09æÅJÑU¿)«Ï¢{x?BjrX0Îr)¸€ž¨,rÓyƒñe“¦i¼Œd4MFw;U¸qaÔ}õÏ ænêI¤Ìªšb8;«òl K«|ù‰ráÂÛžB“P…­™T­»o¼üoVäòÛ¯„!–L3¦j–šKñõ>)ÚæÑPƒ=Õ€J7WJW•ªÙ ë jƒœÿðÊÈãڤʙ¯Q¿%®´Ró‚Æ¢¹Rÿí¬hª^Z Ç´Ý…p¿€ßצNÀ4J± ¬ç;L«;Šîi¢¯÷°§ª`iªÓÎWKXöÅOhèÀbr hÊx»ê«®XYSø×»<R*A8ÛÜÀYÂÈO†šú•¡o×êÊÞö¬è)àÅ‘õÁ»üà¸\ÿåòË1XY«ˆ"m1D}>”Üoü¦Ð³AL3Õ_ìÉ‘òñå ä:‡¨3ÙIPA@H¬ ×.ÈI)R/ÒY¼&W}ÆH²¥aá½VìÛ*?¯¸×ñ5&˜]$¯‘Í:?÷׭ǾL\}öc æA|œF]­ìÂ2ægV¿dJ±ùfO*ìܧ YÄÛ-‘þ°¨°Ëæ 1¼šÈ–ßëê¢Û´b¸0³] ÞF@Kö]ÓHçС«4XÐø˜IÌþ‹©öÎmM¬÷J‹‹"§ZÀôñc¼¯WhÊ®ª2|±þ’×IÜúC/ÌÕõÿM>8^Áñ¾ð!Xχ#eÜk‡ƒ¾1 „‡l¶ï“{%[ ¼9rຖߡ(’µüÁâžA¨àj>Æ¿¬°o#ì¤ò휽ݻJ Ò·šïC$NM¸«äü[N¹•tbEöóù€‚m€û£¤kªÓ5ý;õ¼x2ÒöªŸ²¦Çm’ Ñååôܽ°ÖË 2@ѧûGIòµÈ¢'nþPF‚WêÏuíú¢ƒ×ü«B·ƒé‡ä•L~^¨‰cZMïíþÎ:£ ùI&ÜT*H½ïWëRbŽˆçø¥5r×?qbŒžçz%É¿ð| Ÿ?gŪ0ð›‡õͰ’ÿ;«²Ø’¥no­/zÛ™R°(úªYšÉ»È´W*ð‡ö[ëôž)ôÿ1h`[9Oâ3lû¶ý Û~†m?öÿl°-è‰ù3lû¶ý Û®eχ ¶=(C„6``÷‚¿òÃü«F?([ÁeŒô©øWV—(jwÂOÅ¿ ZÍÀª%}>ä ùÅÛPvúŦNMïzïu;9i<þZÓ­Cñwx ðËòí³øŸOÄr»Ìœø–ó2#A:Õ›Þ8lßæ#z’ŸÍ5ÕtøšÉnöïTð’ŠoóÓõi|Hó¯”3ôaã.ÿ„*øswýúC±²ƒm—ëúl_6ì• ÁƒêºáÐmT„ñÂm!ˇ¡º`ì(%h^”QËÏòaQ„ô”ÛÂOOýþù?3]ù¬endstream endobj 353 0 obj 5354 endobj 357 0 obj <> stream xœí\[“µ~wùGìç¸|&£»”©ŒÁÄIˆ½(àa½¾,•]ÛøóëÓ­Ö¥5£9{I¨ÔåewF#µ¤¾|êþf~9q4âéÿ§×þpÏ=yym<úþ=¹öË5¥ÿ^}z „„+Cƒ8:~|žGNY¯¸y|q퇕]›•\›ŸŽ¿‚'”hž°a=YËÕ×ë´6N®Žk›ÏéªÒ~u®ŠÝº8Úw¤ ƒðxîèÖZ¹Á»`Wß®…€«Þ°»ƒa>›õ#Þ‚«Ú Bèռꃀa°ý\l²ŒÐÈ/W·a$lâa$eÒ^BWð€Rðˆ «ûëgð«oÖrGrºÖƒ’ÐúSÖRÙÕßñq)¥µ¬áqí3‰ýFñ˜Liéí‚Ô|6i6jœvC­5žl²‚eÞ³¼5®^Ó ÆˆÕ«õF*®ÙºªƒYý B;çT¼-PAÄêÍÚèÁYéW'°qç¹ÅëúÔ#X ­a?W/ñ±0ãkWO×Ò ƒNÕཅ>ŸA;©a}t ¨a\äi½†Ã¿€ÖƒR:ÈÕ;œ¤ ð`ân­” •ˆ†sJ€q cV?®ÊÅòq#•´¾^úq O( Ë@Vdëbu»ÿ®hpÛ½4ÓçǺ/+ýˆ õ4®´T:JÅöõ@ã ¬Èû~±ÞÈÁZg5."<4hXª$¡C’?º/ä óšáݳªóyùlc·@ÜTuœR~rÀÑì G³º 2dsÝhÁÈ<8Ëú=v š ;YÉúc]\§EœßFz4q´‰Â€†ÇyNÔ"ýjG wÀŸ„Æj¡œ‘h;ãŸÖCÔ5ÄëOÖlWO‹V“Þo”—¨Z‡„rf@‹k÷n.1þú¨´y‰Vk ºÀç84;Êø$³ˆ‡Û æ ùÅqLËÀô:“‘«Þ—=ÞGmK2ÀT™`¿0 ›M0ê”±W㣠M6 oP¸ßÒƒxY›q!-Aw.h‘Œ´e,§Wo«º¦UF3¯úVÕ½þF35«Ú‡*m©4sá8 M £íŠ®³FÑãt¬c#']õÔŠ<ÉpM¢€nÐÒT·zÖSÁ§¸¤TK-£–àrU•ï«(U£ÛY=²Š µ ¢–dIEaaÓö<+€ð¬®^Ã¥30'û Êži5t£Œoâòƒ+å]0„Ü#[ˆ·Pp²©æµ\ì2-µüàÙF  n¾8||Ü CÝy»``¾~Ô©“Þ“ákÓ'±õDÂ=¢‚-G<éÓlZØMÇÊ4të i¯$é|šfëöY|•ðí'XN«Ã=ïœ#„.®‰lu³v€d·×¸ÝÖd»÷š&@'oܯ0è‰0PC¸Q]}9¯¿$-ä͘²1Å`H&.¦µýMn"ÒyÕr_›ô5/÷•õ ÈŽÚà‚r{ÀAN1¶jô_gèßBl²‹ûlø„»&Ç͇°  %5½1M¥ ¬WXR¾¤qˆ,`óÑqÀ€®–)_U<î1d00U—•¿þ†#˜e„€MªÍlÓù´ jþÒT¬Åð!´ªB‘ ¤©µ1a槤uŽédžŽµÓ|3” upÓó+ƒüýŽàM „â3˜E:ðÞ€¥¦h(ÊØjßdlý`cn7”¹ ãFàAlG!5à™~€ÃÞDô…ư¶¡3dTAj}Š¢Mćí$B#3 ©ÍE½X|\/¾(ŸÕ‹oËÅ›k‰ná¢.еµáÏëh-#‰–)·Ÿ²g°§Eœ]{Õí¼4¬’Ô†ïÊ€ðˆHögØ9FÅõzÒ»X—æe½ˆ9[ºÚMÐÃ!Ä«€z1Œ.8ÚE½W†þ~MËW‡›äh™lIg#¨=°»ùÃçܵ§“B‹›²æYŠ>®Zò‹é¥3ArZb¤ãÀë®!=äþ ÇÑþàÅm6{¦&V˜ÜAÖöÍïÜÚÕ†çEùmñi1¢Úð¼6äOϲ‰½*¾d2¢ÝÅdÃßöü(hOÍ^¶÷ž×„/¹÷lz€Ÿ…P—gM&z¢–CÓ¹XÇd²õ*ƒ´œ Àú*Ë3±è4 DÅßÀ`})W)ë0®Ãkj1KÒ@’mN'Iö8µZÂQ?“f¾ˆàR¾†-U£ŒÆÂk>ýƒÚÐáZ ¾äކtŒYYaölžoï%(䙣 ,ÛqZáýÆlž¤¡ÒíÚ ë›5̉å–« Ú2VLN‡V°&x ,VÅÏ-_ËÃÂÖÁ¹%Gúµ´TýƒCjµ¢é"mwz¶9/Ù¨ îà ·Ø!£Ù÷w×wnf˜.2Œ‘“Équµœ:䮂"ò´†Õ'Zûï7«IÂXâ~”´Î°|û]†ŽÐÑ bžÈë¤áú.xµœþXò¸q™í6 ÿ²ƒwÒ6ŠËÞ«¨ý\®/žÐáÒÊ´˜‚iÍëªÔs¾U&×3}*…*–ÎîDÇT5³ªåœ<÷¹ÁMéo¸†ý Ä4L©&¢f.Ö²gê–zCGvþ)ø'èjð¶5¨§MÏ[©c=ëŸ0€s`KƒFL:ËÎó¨ QWx¦ÐÝ<IK5öNyÌ[¨€>«ñ¼ï_^bDö˜T ”þ™‹ŸNÄ)V- ithÛ>4[dœö6vk~¥%¾ŽÓÚÌœŸYŒ§.xëÇŸÂ\ú”^£­Å—U.Bå—|±žóK¶SK"«¤0B*µ$>‘ëÍœ[U"/êÅgåâÛ>%óKx!™îѱ²¹ÚÈ9»Ö‘·6¬3>ÈË6×›Ò˜Q¿êP¯¹ÈFÉM~±KM©òçŠašÔ{:àp–Jú=yB5ö‹šð-þùþÀ“áêSü¬ŽÕWøã/øãóÒøV~võWüñbÕ[ƒº´?ó™uv+[Ö„º¬ £i«&pÝ˼—êm¡$ý/U¯,åÈd}3•)Ã99wóf¦VmÓ¨×[ ns’£ÍoO€?*•¹KRü“Þ®¾c»Ñ7–¹ö¼/kh8ÈQn!KÆí‚7Æ¡âÑ# q·´A[™ËËVcõ´XHÕìs®‘Yv°ÿ@ެ wÊŵ¥¯-ñÃê1Û{w7€Ê@ñ¸{¸SÜ(}»Y?ÙṆ\Õ˜yÕq)Ãf²©<í>q^­¢ßÏ#¾¦¥mc©|® 9=σåà™bi5´­¨Ît-3À¨£ˆñÿc€3"%$~]¤/öCˆ”Ú_.‘RËóÔ,1¡-½ä¾‹"Ñ›^X‘á'Œ'”:ÑNsª¦gÑ l„TM™ÅО •<°aƒgE2ï#Gæð¯ X¿‚²ß—DÂØùEŸoGäIÏòã8Uç·HÄqîfçK"ލ"¬¾ñå:*‡XœÈˆè|S·M„ƒX› Ò VO™ýäœmH÷Ëɹœ%‘Tøœ}È£=“²ÎÛD&qaÎX.’.Ê ˆíw™õÏoa[®½]†K%¿¤…iä.Wfª4eÄœ‰ãYwún[þòHÎKþv_Yò£XØ‚]ÀàÞ  ¤MŒ£å£ÒÉøù'±ü“øm.Éá»;¹8Þ¤ù&¼€üê'¿Ý+Å~9–N¥0³Bef&vÑõ–ì%’ˆ6—=úíuü6:nÆúé$Ô{ú»[O„„æk:N§Y-V?;oYq˜ñ,ú·y”‘ér­Ý %•ùÙí&[q×/ÑèÅ<ª´¤(¦ s]ŸWn‡)/'7½¿Õy)3‰ÿ›¼Ù•RD.)ã)/q;óûçÖOÞ¸ÛÁÍÀ¯8°OÿÂ5£ÈˆïSKˆ1mƒ•[e?$‰OëæÔ´ü4§h¤»å½r;ý.TŸ»ÑÔì; ‡yÑ\\Å2Õ¥ZÎ[·I÷šFM)øHtÕòƒ¹‘Ó6^:lIW-cd$O±‹ÙûÜ$«[ÎÜ"~Èã~â]ÞU‡|Ú1ß8ô‹/JqU–Dä4°¥¯"à¼ccâ¯9Å*R6d¥Â;ŽŸ3cC1ún©{Ö^®Om9Q½c¡¿S¸M¼z6`íó×ÜÛ¥\Œ! ºûå§´Vmþ¬OãÛHøÚ8?—öŠE3‡ŠÔ'qLœý2‰#W“0¯?G©—?ÁŠ_ šYÙºžR8PËøkêHܸ{íøÆu㊺qEݸ¢n\Q7®¨Ãu㊺qEÝ‚nÔ‚ýÝ…Â$5.ÕÉR˜Ì%™Ÿ~wåÈÇïëlù 6ü=‹„ò\Žáš¶ÌþùñµÀÿÜŽendstream endobj 358 0 obj 5082 endobj 362 0 obj <> stream xœí][\E’~·øýæª÷!ïv$`47F ž]FÃHclÓFj»Û€ÿýFDÞ"óä9Uí6û°²MÕ©:*ü _ŒFŸ¤FJ|UxWÓ'%–à5ÿþý=öà)Üáã£Y´–ÖñÁ°ÍGG¹ÄL<|q &®Ýáø^\LòáV£Í¡4L}™¨9^ªÃ§8µ ãi¿„¨%4Ž¢{÷R[‘‡ŽRøÃ‡@‹¿á0zQ*òÅý}G¹SÓ*M ß7”s¬a"šQò!puŸâWc´ eåå¿þ ö¶ˆíŸ±~¶ðᓼmúhSCxÃK-õÕÅ¥‹—1¦~Â!åá§Üáº>|Ý>­_¶‡êÃoë§ëöó£úðª=<1äËúéÁ¬£íá>øzFlš¯øùÓ«£‡_¥7¸Èõ+_ËS$æeô 0©¾¸"Z'T¢Þ  mâá3üóIíˆ~ø'þùÿ ‹þ„þŒñˆÇSãá׿Ô?_Ú,^ÏÖý[ÃdÝÛö)>Xé±£õæ>Gb  ýgi¹Ù[³ÿ¨CO)+|3Œ ~œÍâçn¾VFÔß}¬§3>zÊWLJ-3EÐ7´Ì¢L¥ëŽõ']=mï¿èX­|ìåÄx‹üvø]}JŒ¥$P^ÆÄX6†÷by ±üð Ø/®ã¤Ñ‹t¤ãt•RÔ3Í »±MÞïÏÐªÉÆá)¨oc¤R4Ah&¥†ZØ&4løX¼Ø“o’Žv¥3[ÍWÐ!LYIÞpxi쬔9¯¶ìú£§_IŠäÆ9ï ›Ü‹ÖM~œ§ ò£t Q¥#dGbÜmÅReÉ,Ñy‰­÷n3a€«€ÊŒž©e´už`ù°^º¶1Ó×Â؆õs]ûyJ; Ë mšæ!39„Ì[%$ëé&ëëZ‹"Eéöu+“Y'=_ž.¥iÒ8>‚K"ówp:±Ÿ4†nâðAû5m¿ÃK:7ÀßOxà—㥠È{öÒuù5Lp8¥~“p#AÇ6xÆÇ†ßqŒÙeM:%ÒvE`–¨x^u°ëöf¢€Ëî£À$*iÚ h÷¦¢†Ê"ªEÄÈþÖ dq\l /ã(•wP6oÒ‚cÔìá|Á?­Y` !÷–'ÿzÚ9mxÊ(ê÷“Á~©úïÅQyh*4ç§ÆdíS׋=êØð~ý„Öm©¶¼/&E\$2K'’:Qd0–Ö›»Oê?›Û-2iƒY‹6tK²‘(Ò;y?·ÈæÙDÍ?FîG~Õ.Fy\Ù§Ó±Kf¢NÚp×m ¸¥±yö~û™ËH™ÔU@ðä¸2/ZÄ¡Ëùc-ïHÞ4®6ÿ`µyMÞ‘¹QÞƒÅË=y'Þo/uòŽÛ ÞæIit…vF ˜õ¤jÚÓ2 ÿ5%Ê/S£Ä¬×’-IËWÄ„…lÏCãt pªëˆ–‡Â@±7ê *XøbLKû'™ çìÆ@õm/È%avè†T\ð…”b[Ù3|aÒfgž»/RÔ“—Þ[ î™TC‡äª;ö4ÙSëk <®@Å0*U$ÉÛ˜§ø¾%~W ðdWöcÝ:¬ë1A0Çዱ -XG¦k}®‘µNsg< õý`hÖxÚðê& –ø=¯w PõŒEŠ”3ÖÛéhÜ€àMYŠÔ¤>v@N ?³å`GTJAé€Éôa™hYž–gp1³P9éæu‘i寷›¬ÙštX²±®àÖÅta¦ÉÎU5Æ$0¹> lª_Û§G48iJñ`¶1sF|uð/Û;ÙîÐ8Y0AƒvNÍÃ{¶æ$T¬Ç‰9 TÙÅ"dø‰–Ùs÷Žï‰SãÜó}OTáÙ÷$Û¿rþ™&Ï…Æ8(øä `¥B1µûP˜ %[Æ‚ÀOšÊþ2Yw9ˆa&Sp°wþ×ì0WŸo•HAv—qŸÝi»¶p@œ5Ã>›¾df*%±5V­f¿J%dŸäí!Á-.üèÙd ·wÿ‰ô–9 4„ÌÅ3|×’Õ'ªiÕ}fn¦À• Ba ThxXÛIAn·»ñiv†¡=ÚÃ=ãtN¬fIš‰¦ðàNYùYQ‡²ÛnG–EÚkxp•Dl)ä4ü ”aKÕ6¡ÁÛ”¾‡ÿBƒ„âýk¡x]µèú«úð§ÙmPqÒѯ‚–ºÑ;B„ñN!v(1 0ÿ*ϪÜbµ?¥ˆ#Ç&zîgPºtT.’J‰ÀbÁ ó›ýOÁ¨éù÷ËtÚ)†úˆªo1&U¾«*2'–Ìûÿwùõ«Šþ{ì_Dfdéâ7™Q”™œR£#ŸWýÖ ™ìa”mì!V ¹îXËïx¨Å»–±²„°ŠIæÃ'_à–„(¼Àc/!&ð °x¹´|`Žò´/ÙÕÒmýPƒ¶¨K ó’GoÎ*Yú«Ö¼­_€×ÜõÅ`‚»ñÂôL wö–,"!Éú›ã]ÈàÓ:¸‚wÉ6|ï"ütpyŸŒÍ¦ÐúF•ç±gvK°¤%9`sab^Q¡ßt ½{CCøALf v¬*´Œ¯4¿åÒ™mX<†S Žî &ÆèhÅÄ8ÏœpƼ ®«Ô6[Qcó›SÄ¢afuZnï1ÿzü×冒Ð.¹ nª2©¼Ï0w=ÃÉìTIGæV0"(h‡c =oŽ›¸Þ¤|ræT3๠oÎlŠNQÒ[ëÍÓn• w]¯8–ÚM-ãqŒ£ÛâS˜fï7ª!K€‘GêË(;ˆtl@ò1;$»6)ÕÙã/Íð÷¯`Æõ[ü\e㪰{6Þ1|ÌáŽY—+}ÎùÎÒ)þ†Â()¾bÓ»y“= ·@y9©!¹ÆCaLß§--»SÓSBø3\(RU¦““©H!qJ"w¢å›œ±qxš“iᄌ±Ø+N3‡>óˆúDNû„¹0#äžø†Æà§çzÀ² £8¾Ñ‹_ŸÌKê5t‡“e€àuÇÁ}³×M’vŒ\ƒ[ÁIy€^5õd¶Y{éÐRBO¾hÓòtF6§ÛÀóæ+×ÇE¡«8KQ¹mÓJ+æ¿^‰)Î$ú¡\“4¦(šÀ‘ɯ „rŽÅtš²¤T¾Í ·H[2ßÌò(íuvªC&•¿]IßÀ¿iBì”2(L½Qš6©;Ω–´’uªeE%5¦•ÝQaÈ»¸*mÛ)ÕZJ§ˆ K œ[+\Vb¯UJýì—~€†w~'-˜kÖÉM섹 hT…£jÏ S¢^`áZ‘-«jg`8ƒ®oŽvîAàše22½¡ì®ešDÉö‹c04·~Û=P–ç÷Ï‹©<¨Î-[ŒÌØ…iÖùPÇófÈs‰=ûof¡5* 3Ó`ÝÖ¬48G­3ãnêzZ†:/á>%ô¶g1ÐùnBsNÚjДß&hÖ¹yÀÁP‘QU,?—8•bá\î<*.‡YÆ|Þ ‘ÓkI¾ º Ý9Ú¤Ò­·fôâA+Iôvr¦ä8ö´N‰ HëèµsŢʼ´Þga@ÝüÄzs³‹p‘˜Y|Ñ>§9äÚÍ`UWtnU]½›ŒD»âmýdгÓT‰ë0[£^%û”ÚuWOìÑgÜ#Qo(‰oê3†®¿âW\¬ ü‚½¿âS3Ϊú; ¥ ÿqL¿™ÍðäÕõç·¹ûB–€µL=œ-âá9¤]“ÇY;(1¶”{òú—Ĩ½½Ž.±¤uÚZ3U29Õš”Ëþ‹Ižè&€E M3>­¾ñì×'Ô·&‘­ØkV‘Õç¾y:CÒà¤R®9ÕScio^ãÜ´0Œ&‡dLèGI^ðKú,8«aš˜HŠHÉ-Ç¡U÷áF8ª³–z ”œŸg†¡éþ«¶â$5;^5£T+PžWk' ®GðöNá´¦gŒè>JòÈ|š^f…Ê5rƒžQv¥wCˆ;–ŠU;Ÿ…rí¬H_gµ~›éôä¶’cèìàÝ.5È0¤KO%uêd ú]-`eWT†*'â£\…±”¯Ia¬b§ïuc¨÷ƒ¼&mfafcÏ»ÒÀnÍ£Ž¯k‰êÈÂeG¬[4ç¸X5ÝdCHÍ g±Q«#­¡j_ç—ôþ6ÝíW¹ õÆÌÑï|ÑÁmP…¢`±â*~›Wµ}®m‚d— >7Va2ÜÇëXÖËaº¸S&Ô¼hKÑ:u7ÂjÅ]–Nn~Íuk2…^USgq¡ži´-C Á!Ü Ôà3à™ÐÛ‰FËq>ð»4ᆰšá×£°‚›ËísÑ ÁŒsТ½Ä:e-wÏôSXXã„ãÐÏ4'˜·¦ Á¤>nãg>¹_’XZw£Kvg‹Gt~A‡Qµ³’<Ä•¾žžçwô¼#Dò6 C¤GŠt'Ч¶½Ôæ*O^Nj;©r:KÊ̶êЭ2•ÏvI'©¡¿3œïÏ‹ëÕñ€ §8S¹ùñü3uÊ–W!)Lß<;`„"o×—hYbv«ÏßâI tNPo:BëBÒüòZPš¹U‡Zò>ºãWW=“ ó;lfrvÅå¬wQË€B’zb…‰ÃâBÃølï?›äë¿å•G:G˜jW“³bhÚ[‰¨µAO$9ûW%-ÆìÜwD+êá‹–ÿcì4ZfšGs”ˆû0@5X˜*Ûù%)ÑUÉ^Ò*;ÐãÂ5¹»y$G¼tµ?ÈŸ¶YnxžóÛœò|z´¿Ì‰$r«<•ý¾ºÂi8M0ª‰ì»Ñ,} çµÄHnUÄ&“]fˆ5‚‘[ááV‘ôÉðpvU QßTÒ}áØ³ô5: jPÒ‰…ó2zÕÜ[éÕ0Ö"©é}f¯A;Oê“֕騗ϩoN®s9RY†óWÇída: £ÎÕÇMG Úy0<ÖQ„ÀÒùÅÒæ}ÎnZn׃Ý$xæŽX3oéžb:îbz×§z¹mË©ã3ØØZÔ¯êmuí¦ãuð”HCA£7Ë2XéPn¿y2E[v ŒÔ4;ž øóá!·yB1»“Ò»¼œUÿ‰<`Ž"O潜å &˜^p¸/GÿûÕ¦Î..è9 wF5Üšgë*:A÷xÜÆùű`uÇÙvMÒ­ªL§J|ð™&+âß –tqK)ÂcJx¢ÑË­‚¦»¿¤¿ðÍ{àf7INEòe9³Yå´RÕæîQç•Ý­Õóê^Çr"ú¥ÌÀµXmãîC,¼GÏgD¤ËXcÒ«i娛^ÅӀʔë3Ê"m?‹ ëÇZXÎoj”X´Í»"ùäm¿G±^¨%0Fx‡ÇÄð )ráCú½(lA· ´{ãð>A éå±Þ²0%øê'Yé¼úsòæt#žd.÷ÛBO)׿‡I¼óì Î/Ëï9ƃ_9DÇ¡¾³ÙL”¼ âdXi"6îÏíp°œ éžåòŠS0Ö_áw°‰9ŒkÌÈîÿ±åêÌŽöÞwv¢DMû ÕØ¿äò¸í6—¢VVä6žUº&ѳ<÷¹%ñBöupŸ>¼÷_ðÏÿ‰–endstream endobj 363 0 obj 5486 endobj 367 0 obj <> stream xœÕ\ë]µÿžòGì7î­²‡ã·ÝJU 4„(…¥TD7YؤÚGÈ&„ð×wÆÏŸû( ¢ l6¾~ŒíyýfÆ÷‡“y'3þŸÿ~t}ïÏÜÉåݽùäøsyï‡{"v8É=º>y÷ : -S˜ƒ89ûþ^-Nœ<±^OðáÙõ½¯6vk6zk¾9ûF(ÁFØ0Í]@Ç÷¶§jr.±ùÛVL!x6ÙÊͧÛS1imœÜœµ>M­JûÍgÐ*Lëâj|"e˜¤€áe¢÷·ÊMÞ»ùçVhõ†|ú ,óÞbn\ñ}hÕnBo>ÄV,ƒý—´` e†NFx¹y+a+)“ð¦‚JÁ6ŸoO ŒuÂo¾ØÊiž ÐýîVOJBW˜OI8Ke7ÇáRJkIdz6g&æäšòÒ‰t ÚÓ[€Ã‚yõÉ©š''BH·ñ&޳o>À‘öybó/üçWøãCüñþÀCÚ|ƒ?¾Þàϵ÷ þó þxŽ?îoO%¹·›GµÏmk¼¢Kc›íº5Þ¯ßo=†p›g£)_n^ö¬È29ƒó8-`Hi»[_;>¬mOZÇ绤cÊ<Ïk ÑÖL3ÜçŸàÖä¼9¯Ÿ=Q}Þ_Qbñ¦Õ ¼!‹|å½håq½ÒóœN¼üJ†}½­Í‰‘€k(#)&cON%€eZVlþI:Qeÿƒ-P*|›ï€óU•Fr4l@È¿ª ~œXY=O•Ÿ'cäæ‚¶âx$\À§ÞiàµÒ’„J8~ ²éÔæiݺE‚ç1ÀÃα+Ÿ(&¥U¼Ÿ{ jóãÖèÉYé¡Ñ —Âö‡m¹«Òþ®$áð,m+'qÓF\n ‘N)< =ƒ”Û¼CìŒäÕ9^´‘Qv¬u6·$k+e¥Myº#B+íYÚºm¾ÂS1 w¡ñ<³"¨ÚÊŠã#(;ým¥ž¤rT½=®J¬Þ<ìû¢iÏ4Á,ÊÅÃEäc™E¡Ò ›7Œ.S&zÍØÅ«66ß´ÅÈm¾ÔhåÈ|wxšú¦©3#y%ñXNe€Kñ'§`' ‡OÇ#ÑæXP"–ž:H• <ÚxÙâ;ÊäÊØ LÎÓá]ÙYÇ–hƒGÓ“;&Rõh5`fgÏY’ ¨²@´&Ô3ŽT(\:²™ò` ¥%l€»PÑ –ƒqÃN¤Ï€{›J×§|‰÷b5\gm¥Ì”Täîu¬O~=GO¼‚åÁH°ÙIð‰à\Týl‹L,L<]2¡BZO>hLI˜ö2ú2ñ4·Eö(ª„•«¡AÒ~0‘œúñUý¼ê#¾êè¶8o㌟ŒÓ\Æ"÷§ˆÌ_íŪ®ŸUÔ„ÜÖµcn´dM‡¨2:C{g<²$8{–$;[ÔOZZPs†ú€|>”kœï­Öº"ôA‘Tž´Rý¢7KÈ#-\–3l jHËè jðZÉThì=*«èuÐB×ñå/·ÜÅ£ZFiYèæ$éÈ Ò[øw‡uëŒ)6¬Š’Ùa˜‰¥ò¯mx§¸Ûà£Ñx“K_ÓØÏ¤‹„9w¹¶ÚELúæ\ÛqƒÈ¡6èöFÖøëýE‘ø—ã#‡Ê8ð‰Õñ¡C§-w5 %è–Ž F`še@d·3 9°†b5bÈbƒÇ¥“3¶ˆö°Á1c!8?Ùãú…#ÂÑ¡áÆ ]”õñ"Q° ÿÀ°¢Ã/”+üÚ˜ø¢ÜTßÊ‹5ƾåê?_ †$ Ðf]á–lIÛÌŬz9-L˜;>À€sÖÑJÊ íÁDiŒî™±ßÎMè­'p·'tIµ,5)>k.Û0ÆœÍS)m4‚ãÜzŽÛ}³2¯”":!̪ ת”e^Ïf³f%j‘t…O0O“cyÐÏ9N8½ö•Ì›2§nPÌÒy§RXpÒüÒóÀ5Fø§qq‡èÎqìÖ×ìô$+§±Ô ÷Ínxv·å^&oj‰7ZÆ8§ë%¸wʈ¥CXç­†‰i®z7FÒ«åå ß'[¤ûçqn £S*¡½Úï'â2‘ZQº¸¼ÃÒ®°€ÝžÇ÷®ˆÊÍD€Ö ©HM)Ä9@"»ÀaYxVyÆ™Æ3µDŽ‹ÃÀªN,^¿¬Æyùô#¿ ÕÃâµ ÎÛ›çÕÜ¥òÂÃ:/Bóvñgœ%½Z{çF#¶®ºÒ@§3s R¼aÓñQ`Æy‹ÓA;ÆñÓ’ó‘Žêò0©êÄ?2g‚ß'˜¢qaòšDãJ*›DÜûVé\SuõãEÁAž¶“‹üL£‹¿=lR0 Å‘ž·ÞMzP(Ž/ÄXõ<ááÔÌe­Åc<­©¨‚Idà¢øªëFcŸƒ•ðO ‚æ‘©O'"øOO›„³6_u–ãÈóvƒÑ]POr pO§X/xƒ²“¾[(É‹¼‘£“›8ŠM/i1n¼øyŽ×dŸC?»ÜvÅ+r0ÓTžšñSªrõr[_5©¬›í€›ÿœ•Ößo¬Š”`]ᜂ"Y•bÏ·+«¿SáŸÖ‚1&-t,ê /]Fò…ɾ€ Y¯ºnù¨¸zBõ7a­®‚Wᣈ\ïÒ¹Oñ¹ÄÈ.›ôHTGÓÔ©ŸïÕ5啇UHÎ''F6C—,!Äìá#OCL¼T'¯½ï}È>)£õ¼h²K¦$ÝÚƒj“ze9(xR”ÐQaôÝi®\BqaÌ¢EQùíz¾1R«ÃÊ9.pÄì½4ÄsxP¥ žuíLá£^׆iËãŒá©•B˜f½hÔ)¼_^Ú±‡A_ô%À*ðfö2¬{Ú·’å+:‘ßVç0MG Ž´ð‘HÇÝæëg\Q^&ÝÕžµÃèK9^îf0ÇeïãVS=‚`û3‚M7SK.u<Aoëk¯'"iŽÆÝÇ䓹ǚ ËhíX·g5}'ÈìÂæ‹³!u‘h=ÊWЯ@!¦›rÚÀQÝftñ×J·âoøý+©Ä¿£dóåöÀÒ-ÔŒ1´±ê¢^‡~ãFm|2ê9¬gz‹j€Æå]¹fï{€Á"0Ø0&à‡/O¾mƒ.kãíhú‹Öø-%d×[þE{‡ÍõdT©Ûù–í¤{†£…‹)öA *]ùk<°¿Ï„¿X{5ÀMaË%¯èö’ÕÝ÷vù {•ϨU¢ý?)%VÔ:LÅ‘o­ž‹ï«;=ª¤%2Ñá.B±šäy후Û`æZtªmgø…HÒDqˆpÕŠÎ{Påñ³Ãt^Ô¢ô Ó¯©>ÖDj˜=Šá€¢È8©wÇ€.õNÌzÇÖ¡œ1õߤ~‡µ|På8&n¶(s#\…0d-wË—ì Ø”OßrH]ŒO¢Wð»kkü|T¡ ºÐ/”Š~sY™SëuéÏa£ã¤ßÍ“XbÁöž¾\XÔ WG?ì}Mžz˜&d%'®$Ì;0QƒÄ[,Õ"^€#e ]3Å®g™‚û¼ä+¸©ÙüÉÍÓZ¬‡ˆ8XDÄûòå¤f,û€À4_¤/{SñK"vÂŒêµfã~fû"E«µ 묇¼3!ƒìúG„1;À^H°J‚7AÕ!"•/@3#O±qU —dJªö’­òÈ8Ì ØÉƒNzµ…ÝFÔz?gK×Y3ÏXt{ïC:²/§*÷þz¾•$mqfuÉæ¬Sþ§KöæL•®nËl¬­Ù‘Ë_ß3¬iD¢f0ÿžåMw~‰Ô£ÔÔô…"±*W#“/7YÉp+î½Y±«4òwk!>:B™#âS‹O0Ó’J¸<}¨v`ºs‡ZŸ“ ^ªõRíµª¼ó)ï”Vµ–†IÙ€2^«ÅêÒVd5—dùÁ ¸‚Öã×L—@ßz˜jÏ ’¥;ÂÓ–9¦Xš ªE2÷=ÚþhEÜS_f¸›íX¯ÅJÿzvïðÿÖÆ\/endstream endobj 368 0 obj 4890 endobj 372 0 obj <> stream xœí\Y·ÎóÂ?b€./ÜÇÖ:xúÅÆ¿$8ã8õïø‘saLúȵ^ÿ°ÙΓu³™õú¯ ³(©Ó„ÖŠõ·3Yé`j >긴qŽ!mBuÊQÚþ‘_ZœÞ i×ßÀS¦&! ûSžà%×HX)4¥¿ $Óò› Ïéjq Ã쿎ÿÇ'CŽ X<ÍNîø4ž–Ú¨0PZ:p+g˜Æ®¶bž s.¼ð%PàÉÀe²VLó̘§wý3þñëÿ|Š<Ã?®ò§§yôküç­ÍV½¾ÌOa$Çû_÷>ËŸöFÂ|jvë³üà]õ-ó×\H²kœõ,??EM“.íH‚¹Ü39«øúmQ0ÛàÙs *t™ôjq†iÊ…g#áA”ÃL¨O²QðŒu|BSK& tÎŒêUy)ìÇ)Iæ$#oáœrâLÅC€‰#aˆæ0õtF?‘¾àÎù$q•rl8ü—ž¬ázý>¦0.h³…Sœy¦¹¸åÚMН¶ ETdzìQâO~,ºò5ØÏÊ]À±3PB:O‚Nžo¢•­Í5žQï†Ö'Ò¸ID£œxa°#é!¾c,^·K.ƒ"y"O¼X;æ€w°%x¡7V\ù}òw‡jóry9W²—…ùÍFÉÉh§ˆ ‚Ç.›'‹Wýi½ü\2<#|(þ =YñÐ$&ørƒj &Ó[g-ÑÔ€²â¡ „Y²¤1¾*c:ôˆÖFSÕ‰ëS'‘³¥®p¤Ö¶½öµöÚz" 'Ùs¼G–iÔÑFÄÐ$é®C¨Ý§°Ú;»×Á!€qÔ6K5á}rÜnž$w‰Ø`Ø£tÉÏ"Í‚™ò,°N SÛtOˆD“Òiþ)–sAËrÅi£YQ[urH—ÞOÐ³Ä ß K4¡§T8PjÈ¢Ð2£÷èI¶ÁÏ;áž8ØW<È$Ú°(JÍ(ÈñÃë‹ê.gì‰ »QëÅC…Éãì ¿‹ - +&AÄÑÜ-±QeýѺÂÉrМ`¦6©,1jæ/`ê¿+ÀªpçÒ³þòÆâáÿÖ3³HJtœÊcŸÄov”÷ûr›’ã(ïŽÅ1ˆL•®@óA$| »­=ÁÙôÊ{XèY—ðY´Xïîn¬W#¼ îâh´œ?¨vÒÃoï{pí¬‚kˇï6h€¹q#ˆçíóìáÇ<¾$}¼‘ŒDæ) õmXèyVžåÏ{ä^‡ižk ¶,(ôVg ÅçyÁ7=öžGw ¾@Ü qÜÌ<샩5s#~þÜ^æ?Nèa…CCüé¿§˜¿@ðùrw{dâª÷BlBöcГc«ƒ0v²O`ÊB¨›tV­«Ú×ÈZAС ´öá‚XJlíƒP™—$àØ¯ßDKLÉÓÚTÂa­Ç®Êo°g誔MƒªOzÁW …nW³wùž6”è .çv5Ž>K˜yËI^io%Zë¨â 0ml£†_>Íú¡†ßf-çùHÉ}l¿ }dIˆz(¡™YòjÑ/,|„1IÛ0M£ø>mKF³Ò¶ÝF1C…FÛpÇÊÕÚ&¨-Ëá5µ- FÌ¡\›£Jë*>^W½Ì4'iï"¢—jÌ )Â%¯sÉÄBg™Í)Áqž5ô¼V€H|0ã…*Â2Çï-ÞYXô6•o÷YÇyTÈA$Éñ-©*¦~ªXˆlÄ¥Ÿ$Ê-°’˜®ñœû…(©RD,&‰xȤH6^óÂ>ÃKò(¥ ôr˜ÄHà¤Ú;|i¤@ó ë`²k†qóiÖ*_LÍ:=¹¥!D'41@´Á” p?Z–À'¥ï*» Çùh9DOJQ…ÈHNù¸k"½e*¯A¤©EÊaµ¡¾Éô§dÀ³#¡5ÌêÃúçµô“ ž”ªÉ«Ä\†ôé<ÛFÞÛÓH¦³WæAEeÎ'Â#‘ž²v Ľ^†MŽ'ÈäVΘ­®ò5_bõÅ8Þ©¦ƒ«”XØb'`ùG…=‰¥mü̲š˜Î‰Ð«Ê¾JþªIU:Ä]>nqñeº^Ö%Ó9بC‹nØBòB‰Ñ‹@<æ1ï™Õ ª4çãPwߦÖù!š—bÝ‚Ïôü´ÙRDþþEnc¤Â¤ÇO¤¤DÐAñMˆu@»ñ^m¬ÏÂ(¤U… 2xÖ £@頻Y,öaN¯ˆVqÏyÞÏFi{¦£f’õ¥a©SÄyÚFb‹“RúilJØ?,9‰r<Õ¥§àÔ‚Žj[>ûÊÚÂÖùM%Å„©´’•¾Nê¹ªÉæ‘éìn(=w,;÷àeÜzmÌ÷Õ>eV…hrÌûF…ŒÞ 7+"o ˆ5ÀÀ8‚¾ð½ýê8j‹H3ÝæWìì•þª!IJˆPÂŽä´ÚzO¬d{73ÛT粘«[V¹j½ÄZ—`K Na¶g÷®ÜÊ®vàä<±CôÌòžžùŸ¹F¤Ó‰ÑÓ&5«B(•Ó/!Ö±ûÔc(ºuÇ(üDw¬T/ ÍàÎøÞ·ÀBixÒVب]UXMá fŠAà°f4lþ‰=*ý8 I- 5‡È`üvAÕåá K'ÉJVR˜Npè{v$P÷Ru?–½ÐØ0’L‚=а*ô%0ðßüÆp¢€ÀFð¼1ŠY­þ ¤>ÜÑÄZWØbõÐΆœGYª0gÂCò1[=$Âc$·)wãã^ꥉØo“)„W;úRJŸï´Âa¦FîHmÄŒÀDŽٴ¦«Â^š ŽÕ9&"¦3>‚ˆê€åj 5z6)á«Uƒ*éFQ5ZÚž ¨#” žÖy— º4#4¨mhç{ªº‰ä”_Œ;?0Òá¤YBtÓ,u†x<çG¹‡˜¤îöKTì 1ìÜ Osm»qPQ´*ž¯™Œ° ùšÑäO¿¸”Ð@Œñ?OƒþX”÷óMnÔ 9tïOv:’‡‡x|+Û÷’ƒ)¹Ü‘ƒÞ S*{Y»Ñœ‘}h¸ä;N”ì&U¿ËYœìÞ,JBø§Ë„MþæþÞw%$;Ý TH>»$,êG׊žDÃëJ}Ý®=ÈG7n|±I…óùÙu›ô¯×TŽb†íì—Îú„YY“ô ”6Žo{-û´=£¹-°g¾û=õúBõe²B~ Sz€ô:û‡^$Ð59dO/?žóŠ´H[ÊÅ…ƒ*ðª3SÉ}h€ø²Êx“ÆY ç:aXÕ‡’ÃFÔ„ŠGêÁd¢KùYE$Ò"šªPÓÖ£(”)Ø^×õ¦— ';N \Q׆-ƒìm·=õVDÓŠ”iûÙ‡žW­ÂáX/„6'u=cäc£>a;D*ýTn0Ô®D“f"n)D9Ì ;žä¤mã‚hËèá)•E"VjãaïåFøÆŒ%>Né]¥|™v_qì“¢¡`ÓH¹sjJT ÚEàßÍYá…?Ø9U~÷y­0òƶ›Ä¢A6©ÍZÊ¢0Ynmí¡ àÛÚ­í&ùI}=uuÍæ2ãé·¡ ÏhM¿'¼Aõ(¼©õÂ{e”㊛ݎ¿Áq|¶8 ±H±–to:õʇì5žÅð§²µ»æÆµ[œ¼D¶˜qj)ÞÛ¶e :ÌM’mí¶°ÃdèÕÇ[í6W÷²›‰!NŸ™ê`àñàNÎW,xƺ©/N’ "G¼#}É75Æ(žS²±Ýܸۤ&Z9 Jý÷&öc\'Ö_Õ‘kî½%áëž RK•ý?šF³dã¤Å–ADàqF{ƒô“)Q¸=q>}C7ü(ÃÚzÝaÒ ÷ºÞ¯ow<ïí¹{‰·,I6ú¶w.¿Ûu`mÁÔ%—UÃüÝÊ]âþÖÎÄÜXg/†ð:E¹kÔ»b}¤c†cyèC/{ùJ û¾B¦]„;„`¹Õ¡ ^n ¦›OL¹ú†cíMú…fÜ_•˧y¦*ž•±ÇÎÓ&+®ïj{v!°ú¸›Ä¹Ðšò¡é:ªoùM¶Ù»]E¶ Ò$#P*EîØà!ø.‰ùW¢ 訮œ»EÚvõþ=Þ…¦ ´)¹\˜×Ǧ–‹ y±W>µÅôHmsz±-µô 1˜*ÓÔn—ýLämìmcÖ××SÄ<‡+öCü~^fŘåî¾È¯îZÆÑ2XîGú¤à•ô\øûuBvùDÇI­Òu5ð vÌE0_;|Õ‘æà8\¼6ÙôåÉ.G¸å–û&ç*·ÊÍt¡Ááû?îe|ô þó»‚æˆ¥58> Ékü˜S¹dKá»üð´<,i„‹(Aø;íÍôט)ÊôAÌä†ðžk÷ Ïvo“ä^5lÂ÷½µ\OjSgƒÂÏ®˜r£øFª\ip0/ìˆÑÜË—°[àð"D*uAØc䌂 ûeŒ»µuf`é:ÜoÃD0‚ðµÖÈ×4.?zµÁßÐ0Î!Ù¨/\¢b§q'ð‰°þL0‘ê™Ó í@2|ôÔH.ðî?SV9’ù N:‡›céa™?¬.YÞl2ðñÇ2ÒÃC&¸6Í|”\^‹[BA0ÇHNß¿*+#­‚ûäVÚÛ2A¡¿å#ÔËZ€*1oÿiT~LPÒò#Ä>׿ÜäñÔM ¿jÅJÙQYF+÷øûRÎ7Œö]Mø‘àZÌ®'0¼jQ×Zâu>ò¢© ›D¸…C7q¹¢ kRXßïÙ\â¶Qw¹‡ò:^0¦ÄÑO×MöB§ÏŠÿ©c/zGÁqí¢åûqÚš`4rWš°#·Ã'ýiã¥À‡îïÖ”Ú(JïâþÆ"#‘ºOꮩ½4.ʹò®Å‚©[ÔböÓS³Šò5KÞ¥95݈ª.žå¥·œor Ýy‘,ßÿ‡•ÒÑOùíÂt¸wS5µ€F2{‡„zF(/™nænWoÉÖåBË çw¼hBdr±ibè¦CÊÌ©ûÕÿX›¦w¥òa5)Ç}Žï€·þû£ÿgó\æendstream endobj 373 0 obj 5026 endobj 377 0 obj <> stream xœÅ]YsÇ‘Þg„¿ošÙà4»înGìFH¢,sW¶% ¶Â±Ú¤A.A$Šü÷›Ygf3ܵC$ØGuy|ùeVáõé<‰Óÿÿ>yrÿ¯îôâíÉ|úüwqòúDøNã_ç/O¿>ƒ‡„„+Ó:¯âôìŸ'ámqêä©]ô7Ï^žüׯn þ÷ßgÿo(ÁÞ°ë4/ðÒÙxð›íNMέ«Øüq+¦u]ôºùj+7?lwbÒÚ8¹9+Ï|®*½lþ WÅ Í:ÿµ îH¹NRÀë©¡[å¦Å­vó÷­pu1äîŸá3ß4mãÀUí&!ôæ!^]VŸÁçÛ¾àóЗ2b‘›?À—𑾤LüÀ"¡)xA)xŬ›Ÿ¶;ï:±lþ¶•Ó<è÷×[=) B{JÂ\*»ù ¾.¥´–j³BS6iÍMi°§tOÊ2þVzž[dVÇ?¨PU@梸&7EP¯³/R‰Š¦À|Œç?± :"©ÒµÒŒJÔ% ÓA¤<- ¸Gâf¸Fk/„}Œï¯K[:æ¥8 …Û~bíñåÇeoJ\ÁìïšÆ)-âûž˜êž}&ÖçUq ÒÀŒH|Ò§¥Ò'ˆH< ˾ˆ €Ü×*Ô  ÐÆ*‡ÐFküúÚ/jé›`ÚÝyå0<=NƒGÅ×%5®ÍBÝu7 y’¿5øÔIòÏüôÓg€.dÀ„`L·ÛÄ© ¿ „0U/,L•n–PWˆYÜìè×ìüñÿø:,g7;1kå¾(eý‡?@ž¢Ç}Þx)ïÇp2ôŠÔù°á4‡ØìFzñN3˜(ÐÀ7ùâ‹øä@ýäeïâã|ñM¹ø4_ü•þ”n?Jq¶²’}rö¯Í´ © Ãô`p:ÐíÂ<ÝvràU˜ C:Nfè};u÷&_¼(3TæòyyòËxLjûŠŽÉ é³Æñ<Ç?§ÞæŽÇÞÍ ¬§õ#V!b}’‡ô.ý^¼ÌsuÍod¹ ½¬Ô3¶©«Ë÷§rÿ?éÅ45?í]s*'—'Q¯ˆ›²¬äõ«|ñz²w^.æÁõi$p•^;¥JÖ>¸XmM‡ÙQCƒ>`þfº~‘9Žêkü¢À[il !&¸ @×xL^šb@îkï"Gø>}èER TXp÷Ò¹Nð’œ7èc‡OÔ ŽAéÄyÛë#’ïäHËvŒ>yîE€'€}¤]ÎÖ1>V¶fààš›dCJ"ë¡Fšä[øuÐÍ:d¯ƒ%¨DªKë®<â ÿ9 ªK¦…(¸ÄÆd¡½u´pÀÎÙ0/íàú*É& §Z6Yš£c )€JäubMfFÖ ´3ÀÁ–-Å$7$]—«): ™•FQ`ý»¢™EŒÓȵËÈÈbwXlG;WE  k`ÜÀ<´jP~"ãIØbsÀÿ¾ f ½@º1¥.2…éãmBœG­€PY'­˜iù‘ORÖ!XGm´÷CNO$hE¡}Uâ×^€Â@XœaTä¯e)²öh;!HìiŽ/ E:1f4ÎÁÜ\”"u•¬š¥V"dÖJH{T˜¨>AלEž}T5•ð!7× bül"ñ ·‰Ê.þÚí¨‘eöjPî¿'ΡG!¶aLÍ̪±Sò”âz@žŒF-֛¡Il}àz$Éìu‰–+Þú¼ßôH“Ô#M¹ÿ+?Óc5°k×™3[Ù¾ðůø¢.*Á¯—và Ðp À®rqª¸ó±9%‘P¨Øs¥×g8ÄJÙ„¡'YÅÑž'ËR;zYä&7ÔÕ ì}7%BHL.Àb˜P–•zžvK v; Õf„å<¯3ò]FÚ¨˜ëù€ƒ­’‰Wa¦ò_ýÀÛà>ØXÝò¢Ï:#2ÿ™E4ˆŽ¬T+i¨^¸Fumm£@ #ƒ`”kð.aŠ8•4´mØƒØ²Ñ æ¡#ø€LÖê¹mFPjá»^ô™MÆæh7õ4pbøÖÚÂSV>§õ¤÷äTàôYe*1¾¦9LmÄ0sMÃÛ+2+R~R$C¦ÉÏ('Z¨F&¹òèd$—QOÀífŸR=}OkßÎ9Úv*òŒËTý3¢¦µ(1]šž6ÕÕCu‰.—UÈà ³ ÁÊþ¨À¾¨~¸§¸.2O¬Ëˆ\žõª7£¢š2Ž"‘Dyzç" Kdƒ˜§0„/CQ¸„9çØ =Æ}B6-Àâ*äå±V«_ Jß’ó‘±:Õ<ª„ë2¡Ú0ÏÐsç®ßó7!›>ÛC .tKØC¦|¬SR,ð¥Ã!I/œÛé‘D#+µÎs0x,9¦“{•ZP°‡wAGa|ei¾¸ˆ; ó?0«WŸãd‘Dz‹DýC,çgXÖ°£ˆG©´èÄÜä \T•†¦]YŠ´Öðû¤²¯«µä»ö¹o¾œj-AHC˜H:'ÞçV–AhFJúxíÕÃvdãK ‹äzT¡¼D<ÕE½ù/ÛÜEÒã¼ùx0áÞ—¼Y+ÊecXèHå[ØL½ È\„:rà «¤±Þzõ]~¥£ª„eáõã^^~ Ýâ­vIR“À‹,˜ŸÅQ±'~°!Òl €Cy Å‘Ë #›JöâC2ˆÝ°'À.9©ìtF„¯cd%D½à˃šX„ªCª±ÈTl²;¾ÆÖ‡PÈhªšÅÚçÔ4o˜ î/m Å`CòiéVb ¾¦1ÚÈT'Q¤­Œ )›®çPh6r!‡o÷jSt>êëá@¾ÖÀwºˆæ…ÜÁÈ݆,8˜~ Fú%]ý𨍛ž‘dÅ;ÙДC„ár\ê›ç‡UiëÈ]EÈÝž!㪊I«($6H²ÂºýEuI.tpU½‹žQ€u¬„‚Ð ìŽÄ 0Ž `0\ή±žÅ̬¦>×ÿE"W"—½ h˜TN|µ]gj™Y=~ÞÂ’NÛPV&˜"Tĺ¸ÙñD»ÕT yYCvåCrT+„)šÿËZ!d,Õ ¥$ÊÇ Q Ÿ€t7®ï•™\RpÊŠ„¼Äkº+ƒ× …Ea˜ýŠfXIäk­…{s~w¢B©Ý{œZ £m:ÁÿÊöƒ墑rñ-˜uÌ%¥D…ÕŠ6t—uOmÆàuOŒA¬{¾J0}+ú4ŸzÖº/Ÿda éag ÄS1SÚ$ú=Û#~'/é!Y*fFØ6M._+XïR?_6íJ%½¥ël·!Àë5QRyÉÈçGù,)Ï]UkïÄ—B…g*‰U$ 7Ji*%@3ÛT˜Ã6œ“ÊGÈÚ¶ëÚ~6¡é¡4q‚8:™4ëZ\$?B²®«õý **„”o.XëÛ¨‹0v,M"ÌñÈæGO0›¾'p”©™"â+õ˜Ïêèfte?©ZšU/‡¹æb´},¹®» ±HÇ.I¬z¥"­4z«ÒêÉõ6×û´H?X8XKª©‚®ô®£ªvÒ ~_ŠIËÞŸ~ô‹¨ä^äï|}_zül»è 8|ßc2ØìáòHÙ€H{'$|a\.ï)+a1y釭O]°¥þ(/Ÿ¤ÈmÇ(üøJ6«H&Tgó¥Gw©‹Êvø÷T,TšC`MvP&–Åæ=fLeö° ©„NsÃU¢ ë2ÚYÇÊ+ÑH–5Yvd+>ùÝÖh迤ù4§ÚP*:¡„ìZ®Ó‡½R ÃËÔí[na Í­Š±Q×ÔËÌëÚ† iö»qõjxx´Y‘õÂû©P[²-½ûJ:B w»ŒHGG*ånÃ;â:¸¦®œ,åi;R—«úÔšùgü§QÔÌg'P ê¡øþ•Tb$3É·(I=ѯNbm±£æP“ÑsŽ‘ˆt¹¼.Ct{fÙn`Í>ÇóÈÒ‚}.ïÃPÃ:E…Rþq– ñÆå`E^Eš\p”H»Ž•µK(WV°ì ‹ ¤ljµk×t.q3*—ÒU2ì Š •)@é1䤷½ –dHäýUVœL·`©(|ænðpQ e3;}¡zYj¾»À—o.[Õ«tÆmGøLìdð[ËJ“3ÈE‚|é†Ëêý–vÚ + &êýPé”*¤Ž}ý“‰>ÛaÅØ"bÙ%/»‚Úví9Õu§ ;”?Ãþù88ô}¤â9u‰:­nOË@м‚\á~Ѻ´"`ðý•„QEC‹2 •B,1Éõ¤¸ ?9¬0ˆ »@†‰°p!…{º?ÎSmí4ëzÓ×iœ”?èmbÇî„óâæJ¶ï6¿1µ°ˆ%Sý¾Í=úOšèãúº_¸µŠÙl’Zü²”yl…OGT§bD”ku>À`^â¹ Ç×$ôãŒQ(RÁ%jÎ"ôWd›×¸ÉwD³gùÐýßtD2¥áx¶«$wÊ<,©ñSp=®S˜`½HÄÛTëµê›íî~*º±o,튛(‡¹šYÖv™À…>÷ñ̦JN­ê ßÑÚì%­ [Zf(Ýy‰uƒa»ü¡ Ìg°â¡mÓ9â!…ýDT¿’2އ×|%˜Áð5 S‹v ÙYxw’“°3eó¬ (/•ý‰Àª¦îHË´¬tçrë·Ec³);(Ѳý@šú£ f w!´ˆÆ½vi(Zô0…èÓL3äІ„I»$hBÒdRÎ÷€ R® sˤŸ%Í’‚›•ý¥ž§‹J«š5‚ä. ÎXŽÅ »Ç}\ë·p(Êu·! Šʨoš)E×ö*ŸTÒCŒŠ'ASb«1…`^+ÏKÂbøñE·ˆ…Ub†ù“‚VôLF…žº l}@CñFËîâÛYb%¿;˜O j*û±(]â¾Ãõ÷Ð/NŒ>U·¶± Ì6 î¸Êõa3ŸM•˜½qQÕ¹¸Qñp‰|d>¥0—cpxS³xL 12¿5ñH˜Öj^æÀXÑcJì&Ïø÷×uéëO•Uêc;”L‰ýù±Z„ì!›Ð…ÂûÜ'’µW°En)q‰$ª@â’xôY@IיŌec&ùf4ºú%¾|+YL)TYÑCeÆ_4¶¸Ú“ÈÙ+×ÝÖ˜vÔ“,uÄö Ñ¦¿D“Ü”pÆd€“ã/ŦºÓ@… Þ 'gž=SýeêI>”B’—Á)øöìäǓק,ûó+a†—S©­žìr*Üâ«Î_ž|ýðäþÃ?þúææéÉýŸOÅÉý?â_ÿð üõðÁ鿜|ûðôÇ[•‰õ}Nâg Cá¸Ì¼d_âd+ïD‡9{¿—K|Fh;ò%¡NÌ_è…Îï·aŸ”pwăIÖ2lƒG¤8ü8L¦3ÒÙiWÌ~¥çT}fæ/$¯¦¥'³k&Ìœ¶nÀµ*1õTH)–"i­ï1q†ö“p&Ä¡‰ýÓû¶Ä]ÜØûTHìͼä)$ MJhôËVsW»ƒÈée>Y=¶-0àk%Gþ“ðÕõ ÂG>7ý‚ŠÂÔ;»2Ÿ¶ˆ»i•ÕÙ(¥ãSÂòî§Îî¡90½ä×_3Ÿ‹<‡!áN0»%?µ-Vúñrï”Ìšý.ÆR¢Xû×$œ¼é,xè(ÿ˦¾4@kAÉ…?ðƒá,ø˜›N¶’¹>ÜZ¬ïl÷ÙújTÐ’T¿ªIŽôñ½å†n&À°8ü¼×;÷o eˆ¤ÚlÑlñ{«SÔ²Ö VÒš=è5nàîÕøEME?Y gc±—±ÁŽÓØÚ¸sO<4ûhA¤Öe@Ääh™Åˆ\f½1™ÅlÜmk"уÌU1ëÜüøÌZJw˜•Æ(umšÒ!TÕM’Â|²å¢¡N=¿¸>l>¥¦ïµ9L6!>À:äÜ@bEÌaV„Œ¨:–ÕÇ‚iís$Í¿g ¸ŸCãüù<œïPaËDS>]Îèf[»s¿®*²ÎÄÓ§JUÃqäÒ¦¶vá‰YÞå^Fç|Þ+¡á®eíRmÄÀ³3[¹vûI 5¹uY77Æù±{…;SÝÉÌ+ÚE=ÀL'wÓB¶SD¶ºÖ{Å(éi?ü‰ŒøgS·ª8ÌOH}BrÿpÊ´VŸÂ¹§6nióé!°2ìáhïÔq;ÇŠƒýý1=èÌ:Àí%.ºñ$¬CˆìA>PÖ›¦eXÑýXÊ¡‡ú·(þ°ÀŸ·þ×^øùR®:Jù*h JqÁ°°7ɬ²³SÊ.;ê3ª@ó̾g¼S¤ð$<ŸO€ã9ÒÊçÍènà«+^ª?¼éè]Ø4ß·±N¥#³ÙVÁ”3i¶ ÖÛ&3½[õ§›$JitXJbd#;¯ý½PÇsä|³iËœ_"x‡Ý™(¶$y »íøtŠÂÜÞV¶”˜! 6ôºwZçwI°2–¸Å†ý‰^Yüþ‚Ùøsû=„ñ>zYÿ_ä=þ"„N~5†Tý­Ê¿+õ.E†‡%ñŒ*CéñT;~ŠGù©µà‰ÄäîŠÛre±Tk,Íq”ãR⺧ÝK'—ª^Vwš{ ÷‡žf&ûˆŠÙ{‘–¥@Û-¾dèS¥:Îà‘ç{ǹèžF3ÌÅ—N/5A²1‡Žç.2ß§¼£Ô§–û'xÜŠò&¼rJáU5Oàül'Ýðƒwp¸!½Ÿ…ÿ¤šš6\Îûz› Yu÷ýáôÝopjH†} Ö a. Rd~q÷᡼£ì€¯+¶ýdeGª{uëEaËïŽb§dtN)w˜9â…ÄئC¸¿ÛÆÊÃáÊåˆî_6Ût7ºñ?ÎÚ¹rÁmMbóïÛ|tõûÜÆ›r@ó»|±{àø½rñ}=þô®wÎôe¹x/_|_.–×ËáÒäê÷?ž.^GD&ÝÚÿøó|ñÕÖÿfíÏ«Þ÷ÅçùÁWùÚ9£‡€3=EœbâFúú^$öÁ­%¹'í\5?â;oòÇŸ4m†nâ×" 'q“H-½Í-ñÓÁ;½É¾-÷ñ·Ñ£Õ}ôÇ“ÿHëÀ0endstream endobj 378 0 obj 6408 endobj 382 0 obj <> stream xœí\YoÇ~'ü#ø–Ý@;éûx ßqDZ˜Ã°ó@‘²$X"i2•_Ÿª>«gºw—Ø@`H^ÍôY]U_]=?²‰2ü/ýÿäÍÁ¾µ‡/®ØáðçÅÁÏ<48Lÿ;ysøñ4’žLžy~xôãAìÍ­84NM\½9ø~eÖz5­Åd­•+ÿ`áÁÆ16 iWŸ¯%¼3Z¯þ´ÞðÉ9ïõê þôÞ)¿úl½‘’OJúÕ'ðs²Ž3¹úr-ð «Jo¦9oê›ÊT Ã.´"Q ˜Öö•mdÐÀŒ\X¤D¥ÏB±f¥.3@¥®äd€ÿJ²~Üo«›)çïШB·kdçÂv†<$ƒ‡’SIÛTÞÎ@„ºƒnåNö €ó:6àh¹)×Xnn2‡¬Iò9ì qéNɃ „š}ä'W°‘á@WJë[üç þ…LІ‰@8µ¶yWž”‡çõáëòú(€o‡þÇü7£X¨ŒÏôY˜ûÿz‹—a^ç59.Mò|MÃåroëÃËòð¢üzU_ßÒ…ç‡ïÊÃËúpgwàI¦¹%ÏHóòð$4´Š÷Éûjô“M—Î/Ë8çåÙu¯áI§á9%Pžð´7NZZée çÍ<ùçUmz]š'[TL®nér&•Ÿý°.¿»ÎŽ´`Kˆ 9*Œ)÷rvˆoXÆ)A´ËMù×Ô^oú[ÚØ!x†÷žuØ ’Ü\á8âÜ[P]áá,ÄåjßŒÝ Ø˜¡O¸ ™ ªmæ~õ–ò–Q[4X©ôv¬„ 3°xTªðÁmbA\ã”àÌ¡ æv2jäÓ¸®êw¹‘Ébƒ «·Á â^ŠŠ‰x\™¢76$çuB½•V'**ë:V'.Lî¤Ý莊5Fž„n,¹ûÀÐ?ñ¯'E‹|Šÿü¦ÂPPö†n[z·x»§^ßÞ=è5agK]_Uï^ € ’'|ÕÛ"Ýw§6<ëAroÂ…ò„´ËBA_VE~^¼îéüÀfÜù gžJkÎ{TÁζ[ÔQWÆÑÊЂ¢_ôæ»êóCÝwô!¯ËÃãÞÛ^·j-°£×'¨t©_%°Íi{±¥s„!7ºèÀÀ-‰Ñ`LâA¡ÿo¡9±a‹bsÓZ‹ÝoÑÊë‹ä¹ò÷­à A¢ŒÔçË!ŠôdsÃqDµ:dßܘEøÞfu"k”£Ø÷…5…ä†kO ñ²(Îß”gs\ ÔÕ×òÛÿãÚo×”üUáÚ²vqmGŸÆ5,PʈÖ¤Ÿd‘X²'ÀH%tå\ø/Ïh)ŠTó ˆ“ãF ?å–¯Ã/LÎ` ÇJ˜ PO\¢ä¿Ä•I%êhhBìY‚Þ³~õ—R;[`h.ïÑ }dJ{X=ÙEÁ‡Ƽ©?ŸÕŸ—8˜6R8Œ…Õ+CÛ^ÃC +Ñiñ¸ä³úº,/­„+ÝÃ{ ,üäàè÷ßÓ¬C'+Zuž"yµ‘ $ó0‡4Æ0ã…!m•$ʈ:Îê]Ò<ñ§yXº l ʨÒÀ ’bîŸE?òôˆ©#2v…!¥EœËâN·¸ÍÒøÌtÓûŒI+4«ºŒ¯…5À˜Ñ‰5(,˼Ý2Ê{'YÕtò¦¦2$˜AR,W˜ii…$5þ%ò0Ó‚§\Ž„£ÂÄø´ŽYYîibô%)ǶqÐvä<€ùãµgÐÞ©I0ðcÃ@Ok—˜p—°.#²Ç­·Èž–0OÊ< ˜—2¦ I[E¢Á9i`j&;Kù3‡ñ5 ÊœGF+¨´!K0LUš˜¡Es™gkÙÖKæX£ZÈ–WÙWc§¸3‚½BÊì—W)+é&ˆÆé ÍüÙ@;)pÛ³Ž…\Gy”IÄBߘ²¦< «ÙGæ; øåO$6Â0'ƒ„S©n6™Êf7iNr.$WN²ÛYÁº•be!Ô<™ÍDZôc“)ÕzÛi˜ß;ëRƒ¡1>g€™kÓdòì“g$áÛ²v[Úp–·N2 ¯lÄxÜ0™ *ËÆ*­Ø=ã–ß±ßݹ?áØVF«W{ .·ÕlÕÙ”}.lS–ʼoýE¬Þ@ñ?‚“˄谰Zº@m”~-G±ŸºiÓ{Õ]kâ—è’8,€²]aû›†×[áûB$Ó÷N·$æ‘N"M™ÙêÊWqUgìMê1»Vßó”ÄhpE˜ré%Ø›„óúÈP‘:•Œ%\ÓÔàv« Ϧ½³Ne³DÂjƒT÷iÓâN´$˜r«…õ“Ük%)ßÉÅÁKE‰,»¶FñJå–­Úä(MšaÞ8-q @:8n—Hé62'±‡Nh $á Îp"zÛDa%™Û«Õº%¶6Œ?Å\’·!˜Ÿ:ܦÙWȃ/<y´´ØdTõaÆân­¾^Fh—à|6J?,‹ƒDO˜Õxÿ[#É" $ØV _­œ·€ñVh»ŠÙ„œã¥åœáÙBûõCÈ:ÆËÒáŸ1Ÿ›ªÁgÅå©î ÏÚˆÒáBƳ²Ì$êè«Ò[ç±J?ÎÛ\o«ã¯õ ÚŸ.h] ÓÒZ™&yÜÑû&C¾HÕ(ߎS(T:¶Ïý é‡*ófÈK ®&áÁBÃRi^Í¥ÖÀ%wJ‡×31 bS“/½(¤ŽÌ{/æÌ‘ÇýÒP–…³iÒPFo-WÈ}öMè–¼ÕÃZí˜apY3e¦æ¼†a܈ٖJ yÆ¥vm+k‡G)Ã%IèV¯î¥æv/`yƒ¢,J˜Þâ½4Qr¾q×­ñ{ÚcÔ*=°Î, ÷»g\¼Gþ©ZÇÔ&Ô²‹‚=4mˆ³¨š6ðóþi«œGàzœ>•àÈé‘~(FÄéã@æx_X~›¿'öăd *Âïˆ X!§%5•ÐÄ0M~¨ë'G ƒæè6~Úd«Ôï™k ekn²#3¸ ؾLð®Û…ˆ“»CƒÄàÉúÝšÉá·ªUÙ‘*@ùzWJK.d=‹zZîYÞ“àºS$†µpÊïŒ~¨@|°»ÐÞMvÞª/Þ:bvke8YßC–ò8€¡ZMIKyö3‹~éÆ`ΑlÍš¸ïVÍœKä"£])ÄsÑïoKsÂÇTôÎh]£‹KÑè\Ñ";Œ­'Å£uÇÇM”nù°ëA› ûb4ê>«mnwxYm'eÈÅyLšø ')÷ÿˆMþì@² wÅs™Ûì«ÚÍë/JžIŸ«[ÕèТøü>ye°üP@nóçDÚk%Ó‚éÉ#<>y]Ù.“&eyºIÙ¥rNŽQ a\wS2fsчö/±S:y kºå=Ôx¨»,úé¡bî uv‚÷Q*¶)5šÝ FÖ•ÊvïçŸÆojÜU¸Âç(dN{èú5#?1E¼SsJ›%¥=|BýÛýFÆ€`ír¶s¥ÐÝjþ“ã³´;îRË+ÈU]ßKflH¤ZKémùŒTÿÓYÛ­›NÄÁÑ›àZv ÇEíµë«^w»ËZ[£Nñ±ú.ºìL÷}Ì©q–\„£þ]¡¶:¨Wc©ôƒšˆ¯«¿–§ÂN8 ^¸sg@?Æéu'':÷Œ"4õÂ'ÌÔ{Þ…"u¼ çñÛ^×a%:"îß+"ªTp'—5ú^eîQú¸I;n’9â\(@Â&{…«TvâlV™‹Ð2‡w­e4à·Ý4c8ÓÙÅ< Š„úaÐZ…®b ÊÍÀA±>£#®Y·…éSyг”…L¡ýbIíÝõ-ñý|0IµÆ¸9D˜Ï!MÓ§É[Ž›{ˆ˜Q(v‰&ï–üáÒTÄ×…;=•®[»¥ˆIÿ"z2-Ÿ×ØÝ.çàÁ¢˜é‹¹ïcoååÑúŸü þû/2 µµendstream endobj 383 0 obj 4967 endobj 387 0 obj <> stream xœÅ\io·þ.ôGè›÷-¬ ï#@ 4qâ4GÓÆŠ")PYr¤À:ìȪáþúÎðr¹z_hcX^q¹<†sÂ:œžs°f9ÃÚà Î"•×0ÐÎÖp¸éÈ9“ÀÓÈL º[ãQdyµvÖ ºä¥ŽËb®€£/prc¬QÓÛ:ÏM}Œë°RÖ_V¾: bÀ$µc·`Ç`Áæ1QÚØö=.FH•^ k¦7Èç– u¬¦µ5‚®‰,OÞؤ‚óÖyiØéÞX?+éÓ–q–õ-ã×£Óé6 ›a ¥+›E†B€€åó¿ÀU˜Ùh;}¨G÷:SMÃÙŸåõš¶1ÏNHù%VÇý@>¢}Ø ŠÖ†í¦MYn$IZa€9@©iXpAeþ¬öÍ“àî@ò™HƒúÑÈça—'-+ïþ g—èi˜©4FÉÖ>hÂÒ†kÌ¡§wÛ]¤?Ô¡kGd〬®ã|2y¤ ™ŸêaŸç©Pž¬yâK£ÃL«²„×íÄC¬Ë+û,Y¸céïÈg7ô¤‘!„µ’¹ýœžžÕáôV™Y»tºZͰ Xç¼HÆMÛ;Qé• ­¶ŽM³—h®An=¦e0þÕv¡Õ›¾‡±ŒáA©Ä]µLÞK2R;a¬Íb§uÏ^'•/AÖ,ã k:Ë*ð3ʸŠ ˜Õäc…ñÇŠS§c¦yC‘ŽÕYÕ«P`Œ£Ö&/3(¬UžU”.‹Y‡F–ÊÇ_´D Ô©G{?œ<ψœq2zQ–ï©è6$$¸Fº`:‡Ú ç>ÂÑλL*vQ˜|¤¼AAN‘÷8' G”Ì㬨;•œ…qU——¾ïq=zæ0AôWldÈýt!±£u”Ô"«·BVÍ@Tîq£ïu:ÿ),7T¿Wƒ˜[›u¶Ž °Ðmh+ÞÖîÍ{Ð$à@dYVb)Ë€€ „ý©Î‚n^‡c†ÌmíhÒ¹ å:Z8jµøëéhy6~F/ Ø(à‹Tz,’…LÐg¬Ì_U>&lFèoÞG— ô¥_²ø%…Q¯Zº{ÜA&ôÃVI ”Þ<ÝèúKGŸÁî> ¡H?ª?Ð[UóGN;iu÷‡Ê•…~çõô½ àøŒ1L¾œhðô m½‘k•Oþ´ògøüÄë3ì¦ôºBŽ#‰[ÕX<›¤m„g #ùšÆÝ{gÖΆ}öà‹pð|µêŽsÓAž‚/X›õL£7(¹“k#p4ÌkMfèÛ E¦'žŒu¨2'†­’<¨¢s¯6Q‡ÃŒœKªC‡Ÿ4ÆPzÀaõ»ðè¡O+­ Hÿnâ(Á\âJ?ÃG†9Øà÷T ï[d/€Ä’¯#û4Þ½}£Oä03/ì›  R-¿¼°ÀÇàÙí[œ"RhC½Ý|p¸fî `òöæ<Ù0N$žo°ðAœèåcʼnNÊG5úó~ÔxUßÔÆ§¥ñ¬<ŒbKWµñMi|Z›xÕm+º}ƒ`3µnW©lÕNñ*¢ZîÀÀßPýYöv¡6Uf)ò¨pê7’ž—QµW@´ ŠeãúÈ1&ïgãÄN …è¯`9Û¸5Ãr=T–-Ñ0^-¶V&Xl'ƒu"Ž® g÷®Gâ~E¥ kÀ¸0Ç3 d;–ãíA.åü·CA¯"?( «¥'Ñ%õ |ñªÚÉjºËÜd¢ ^†øÑö [sƒSŸdvùìïìîñÈÿ©ŒÜ†¾ú"rõ)<ÂÈŒWƒ ˆ4T£Œ†b.VÞ6A¿~:ü¦S€hИ®z÷>÷!Ë‘Dy¿D)ÀÈB—'õÈóR.z^·`£<ï°hü° È=,ôéù ô¤˜Ô›¥G„N½c¯,ŸpÎQ9náJ%¨¨ÀÇÓJw{t%åK¢Dh]ž¸ÒÖã!üÐ:bQW™ði£çš §!;ÑfB^Ä‚ÁF1º‰m½$ù)ü=q„#"ǜќ4T=ua@"Ì{**ÕGÃe(ŽžÀ+ôFÑŠŽ)1ä6ÔR™ˆ(ëªã²x+_ècb˜÷j³*XÄU’`e3- |相ê0ërÕJÂ%’¹ÍE‹4…E¬pPU¨õévˆ, ß&Á*F{þ¿Çh˜tAñVEkùõÉ蛺޲¢Gn\0i¬wn9)Ë ˆ¯îHLy,!q¶ BÐhz®ó°·–O#—íû@uK1f"îÇeeq›£)Õ‘ª¯F‹ÍÈ_ô%lˆÈn³÷5nœN´ÍÉ!SfYV:¡££eèô ª´©z7Ì@r~!keŸëjÏÒØ«ž È]çÖ2ðri¬’¡|hÇà´6!ó¯<˳”ÔsA¼„Ôý”z‚!¤˜JyÜòôĸGÛVrïV2$Ê6F’¶-$Oµl«5ÄMÉ;£åöÎ0G ͼw!âù$õ€ÆéߊlkD©>Õ·µJ+>­dÄ ‰ÛP²V‹ÁHn§çi^§N)deU:8ÇüÙLŽŒÅíÐßúaUSõOúé Ñù‰páVòøi§?QÅ\^†hmz}B…2‰dev„ÓŸàŒ‰«tÈC'”ïÚúžrD3`?Ì2ôåÆÚ}á0NÊíJ¡ä¨º²eê°é6>šµ-a4 Ä:Tǽq´P&…’ËhYŠJd$Ð)¨EAwOém/ˆAÒ‡1`.çÈ©jã$C%=JåmCäá*„"[+x­¯{Øâ‡ŽÊêp²çíIÂ8OD>|¶ÅáCС}(‘KÝJAÞ¤ÝΨ„ꃢáDÛ©¤ù©ÞƒD¬G¢#srÂׯ+Å‘•!˜Ý·~l/­² djuý“NsàšÉ R=}'(ðÅTÏ>É›cÕ*ª2D›Ä,td Èì¶<ù F:aªè~ô“tv†*ŸjôaÕL uÇÈæ×áA'¯þÍ7ÈXrÕ-j. :㦔ßë&ˆrYxΔA•^¸9ùŽQ榖Ω².haÐ̪òب> ý»AÇØIà©tøB—ÛFÈÑ‹R>ÔÜŒ,DÜ’Ü¥¨¢d›*bÔ@jÜA:Žwæ×ŠpŸ·Aºgåé4s¡1%vÔ!“d W ­3º 5FbrèZ-±ÅÏYÌNêêEïß› \X”W÷½žç¼ËípU½á‡H=^xâ·8Îéø#H=Î$ø¤>ݽÍÿÈ—ƒ1Þ`Uf„dºˆK* ¹g çAC$ïÿæÎ,ïˆ:‚PéQrKÞ·˜<>Hø.·ºSéϸZ±£:Âay--&‹1îG©óÅýñâxÐc ¥â’¦#µˆ«¢äxåˆß|¯VYÛU˦ûT‚aûàÎ2ÍCªW6ùâ‘XÔ]¢·#3qÜž• O …îþG¡¶¥¹ñô¨6²­µ_—ÉÁe°¶œÉ.}ºŽ%°²U,¯cYÙfKÇ·±BÕOˆzˆ¾èÇÅ;ðÛnd Ü`ò ©Ü]R¨q§‘@ ‹0ßs‡ìoò-L¹\[|‹Î'dD'e»¨äkcGÆ|¯Rù–a†+LÑ6.éÀ—~»çA 5g½Y)%J‹<0Ó¤Ð5C6/k®û:o«šºjó£zݵÂÀàwå 5Ï’kõxáÿ«â’ L÷W,Û¨MþŸc¬óxö£+ ¦ä-꺂sì$ I³‹ÎW6Hb[&˜vµîž?¥.ÒAÚwËô 0à»A¬‰ ðmÉÐu´ÈW5r ‰“oƒŒO¨Xá°GUÁ¹1‡,‘’_îýþüIÞÝbendstream endobj 388 0 obj 4544 endobj 392 0 obj <> stream xœÝ[YoÇ~'ò#öM»‰v<}w ˆ[vlv›zâ¡HŠ@‘²(Y–}ªª¯ê™žÝ%cII jöôôQ]ÇWÇü´±ñ_úÿôÅÑ'ß»ÕÅÍѸú ~.Ž~:4`•þ;}±úü)=CƒX?=Šo‹•“+ëõ äêøÅÑ?ÖvcÖÃFÎ9µð‡¤Ž­ÇA*·þj£'‚öë/7[1hmœ\ÿe#ùŸßo¶ãàÃèF»þ }»Ù*%× y ÍÁy)ôú|Áû C^‡ÔÄèòX1ªõchJCÔú‡ÍÖÀ:^{´Éo}¾Ñ,a=¬­$FÙõ_ñu)¥µl`œÓ… øJlÿ N––pÂÿóøÏ@8  #q=Ðîø,Ñ+lL¨=¸ÕB R¯¶jD’…øÂŸ`´ å–Ž£†q"ö}‡¿~\ãïO7[<<óë3üû½Æ_çå›Ò÷j³•xFo×÷aûc î8êy}ö¢tž×ÎW½Î§¥ó~ÝÈMé|]Gžô:ßð=æÎ7¹7Ò ˆÓÐË ^ƒë*SÕ»a†`G™ïáae–k¸’«Ê%7x±Æ8+a 8ÎJGFŽÑAâNq¨f=6ÒZHI'ñÀHÀx¼v ,{Vg=EêtçqŒ^Ûµœ5\F.¶Å X vò)…; |xœ8 Ö¨4©Sjý¬NpN (|½ù_Öæ›ÚÌg„ýu†k”ƒ™õÏ£8–§!—y™7|H>©4'è­Ü ÇF¶ŸÆiöèJ4,%Øü'd P¾Dfdc!¥aÇ@ûM+JË&‚Å-l)èõÛ °K£ÒÓQÔÆÎWcI#‚¸¯Gúõ4°³#Š\­AòŠã(/à‡ŸûQ“ɼÇ`4ó4/yYž&K ÀH¥"ž~+]«­À Q *0Ò*üL$ôʧ#!‡£Tƒ ¡N¯|úlz™8OKi–Fn܄ц³í9“¥ü56òª·(’ÐzbÌI ë¹Ôás¶ÆT*ÖÈ# öÛjÊÈËÚ€qrÂòSŸl€«ƒ72Q72èVý½,¦¸¢¾¸æ2„‡ #P؃yÀ8ë²}ô^q«ùCº   S8Û«$~(JÕÆ`­³:Q–A¥æÑÄàþÐNÜ+œvÖppfºO’þI¥¦Žž¼C[/‹‚mÚuVPúy)ä¹Qƒ”YÚñëòàY]¹]º=4êoëù«Ô°+ÏïD± P0&DˆE¾ÕtÌÅžÆÜQ±ÃCRo«ê³('YI±ƒÅ”ñ¤Y VD™˜É*<܆=‡°š¶8ÜՊ`uX 6-F“Y ÷w/ŸóqbrµEå&(~-à0£RË8Çž~g®e\[ ·!(j=‹Á€|¯ˆºˆAƉ×k85 X³nq¡M_Ïx™¼p6ê,MP,º‰´%Ž»oõzct“±K<âQ…©,}ÒÂÑìEŠæ®*YIÑ2„¼w ñ\l¨‡“00ѳc“—€> w—w ˆí9r¸ä=egªç!?Ø Ú­îÁ¹a´ÌÞ¹fôpvR¹ÑF÷ "ùûi Üb~ØnAáW=¼þ¬}3Ðuœ•Γ:ò]3RŽ4òSjö_¨Žs/ºžÄdûá£øú#ùÊ„ÅO"À›ë"#f «RLŒ©ƒ;@A{1ìü Uý{B>õy‘F6óo‡Ä>¤Õ`Á¦9XóA´%ÀãÞw0ƒB&°ÄÊȽ¹9LA"«>ÞªC{­.®gA]#–O>–R‚ÑeØÎV&S]&Ø^õËŽ`â:I»w$°‹2ZÔ»äpïvp’G2³×GÁD¦zLG ¦Mf—˜1oÑÂe:öê„‘q¿®u'Q@ÄâLgÜH0×:Y:“âç€2|Ñá^òr¦)zíKàIJ>¬ÿÅB*·³Ê3UÌòï¡ÒwKêVñj¹ì^à^[XµŒÃá÷Ó£?ÄâD=½Ëà(2­û£0y£J0“ ™çû k‚•kâ¬Ð‹jÀs(q>Æ{l`öBAôºñªˆé,›ªˆ³ UõYDÎÖZÀVLéÏR<ÒÚAa–œ¸’Ôù_pâêë×=ÇjšbÂi–QzÞÛÝ›=~`žÉ;æì±ç§½=ÕéϺ3-Ì”›mBŒù•¹y›¨ÉnšRy½GÔ- fŽðÎŒÝGryï[?Š ¿šƒ\^žÖM:ÕqMÏwJÒ>°@×Ü(hAí 0™1fðÁ &$írt+Å×hYv§ÕÀcF”µ¨+uˆñú[¥Õ´ ”:¼›/lðú¼"†- çg¼kåÉ©—ãÃùH·Ø] ©ºA˜b.âD£˜ØP‚xްá·Ö"Ðö¬´¸dŒébêÓýY@’J„E'7Ÿ·¦\ÚdG‚6üV˜“ÕA¼×gà÷“$ØdI Íòv™”¤–âæ>{P ô  šåÄw?l˜ý€€I «@%qZ<è « ÐBo\” 0"ÁßídK†Ÿ˜&66óòˆ!91OÊQxeg„øWø0„¡H / ²X‚4NE$;ÔZ˜7(3ç,H³! ¦¢ëPQÂyÏíï®|Œà°}¿–’¸HÛ½îÓ!ùÊÅÀZ½'Ì”lmvtf¶6Vbð©wšZ¥Q÷FÁneiA²!; ·ÛZZJ¿ªÛšZº‹6*Fü`jd <æåWÀÔD×]/)2»hlsX´ã~ÙvRº+%îdk•±ƒÒb÷À”†wTœÓ†ÇfeèßiSô}ªßY4zB ÊM ÙÃÃ,ô†Zc1 ¾;3’#lªGPËP½À9ÛÒ§’TÊjÍy ¸'Q"FDtI"¦ˆö=„²¶¸\(ªÅŒ;3¬Æ™ K¯ô¤h’¬Þm¼¡…OÓ„tÒ–ù?l ¡‹¡‡i‚3‡ ع8 N±;•9aAö^GU¦ÂÉC²í·,°ÍIŠCk'Šê}_‡§BÁ1ðê\–Røµ“6ið^I‘¶l$Kæ„ÊbZ:I2ѺLŒjMA %BLƒò²6Jçùm²!•µú3Õp!bö·ÓòhþÓºÄ^ŒcîÜãâSçÞd*qs?ìVµŒÈÓ$¬«ETMÄäVV~ã<ýúâÿÙqþøqþÜ;Ï#jŸ›½P?ÞI ç`)¦ äYÛx«Cã48²p‘¶2b<– ®@Ù7ñP+ô?p!~#"dX‹Òì<0û€kãƒDå#­q&žÜ)Â'¹óB €¢ZáöÁp;)rnâÇ)ž¹$½«#ü½¤ÖHš1÷^ÀNPVȘwô•S^üMm>©Í´%=:“¶|loùّ蓘q@MªM/v‚¹JÊ%{tüû^EV‘èÊj3uè.g6ïz£|·Üúªê²‹èOjN;‘‘2+¯…±ƒ‡Ó1µÀL+Ós Ÿ<éúm®[»î!*MÞ<*£âf&†^D€Þ/­­ó³Ð ÊòºóÚWŠÎjÙ­¢`®'D#>É*àHªVሗ3Ó×ä·Ë§MªCÇåÂÌR<Ô ýå=µ¡?ñžC”é^N’í¬œ˜”ÿtø¸oüŸDd;¶ÕãóÊîT7×7ÝÝ‹Nd7ÝšRP£Ë]:k‡Vhûuq“j:âQ Ûß RP%ŠX^cWuø/ÌËQFf›@O«~[:lzD¬œp‹|ú ôëb2?ÛäÒïˆCžã/´ÍÄ#ñÏj`}–ÎèCŽ,_ÎŒ\M2Ÿ4ötžDŸ¥£«…g¶ú—(9éÍW©3g;›òèFÞåÝʲ‰¿½h¾ É`££bþïpŠºUã·!Í79³B»ÓŽ—Ú,BASu×¢'’†Qð¨âuÝä›®²LÅ{à#õUr«:'Ä Ááca’ëM™²ý|’M9uk¹ÝJ¥·½B±ÛTæ¥o{@=×/{–¡ÿVü¸5²‘ÕTðP{¬ÿV¸òa–Ã$xͧÕIðª0\Ð@Ì áÒ_ýþýÌÝ`rendstream endobj 393 0 obj 3658 endobj 397 0 obj <> stream xœÝ\éo·ÿnôÙWøm–7Y -r'm“¦‰ôHQ8²#ÖaÇ–süõ^Ã]î;d¥ ÃÒ—Ëc8ço†ïùÉ4Š“ ÿ¥ßg—÷Þúœ¿¸7|ÿÏï=¿'¨ÃIúuvyòî)tZÆ0qrúݽø¶8qòÄz=ÂÃÓË{ÿÜÆ ÓÆüëôð†Í6Œ“‡—NBÇ÷6[5:‚>Þˆ1¯ÃðÎFŸo¶bÔÚ89œÖ>ÄV¥ýð´ŠÃºÁÂl#<‘2ŒRÀëy ÷7ÊÞ;|½Z½aO?ƒiÞ[Œ3¾­ÚBèálõAÀ4عìk™ “^ÂLØÅÃLʤ ¼„¡à¥à†/7[ï:ᇯ6rœ&ë~w£G%¡+Œ§$ÐRÙá/øº”ÒZÖñ´Ž™–ãÒòØšÒÒ‰x RóSئcتit"„xj£bçÙ!›1ØI¶gæÅ¤†k üåf+GkÕó8§fxO¾ßlaGJ9<‚ÖF›áåFÞ[ØÇãÚŸ‡i4FO`ŸÎ95\ÕÇi`;Ùᦶ¾ÄAÈgS}TÔxaeayx\a|Í)U õð‰hŒ³’=g{™/Oñ;O †ãžoâïÞ^šáaR1N!°™zT--q‡Réá;Ü!’%°ÆnO6ÿYiÄá]€áýÚž‘d›OÏîãÛVtM‹O#[YÖ8 ¾¯8\0´íí¨aâ:Èã:Iyû'ì¨G©ޫljï¡äó[>蛑0¡ÇEPʸí­ô¤;N¶ ÎÙŸ¶£!£v-¾¶Upæ,ˆŽÏÓñÙIw¹H­ü4N°ðfó°] ¿Dâ(o`Ž4ŠéÕF:`ïI±ž³¨‚CÑÊ?T-W—í<ì±ÒLÜ¡ÎÒV¤“0ÖqÆžuÇ?ëX\(;L¨†Ìö;ÑxÔÛyy¿…±ÞD"HhW»·r‘ú Ä$^÷~TVd^oUDÃS™TÒ2ê÷øþ9Ú )‚’Y5ŒÍ$ꌉ ž7Š žâwHØ($‰°Zsg„•Ö3ÂÂPU:ÊŒ©«TfLÜ)AÜÄŽùf(|Úcγ"…Ä7U ã¬p6, l³~.ãT!c€š–5M>Á˜îB1º-w}³Áy4¨ç|Ìe†‡q­Ú"«ý!Vûž.ÚÅØl 4ƒ ßÇZ ÃôUÙ‚í€8ë‚ëtZS)}3ø(’6ÛiÔùr ’‹AWZ×™JJpeÓîWeí+ʶ Gt\O–!“¡Ùêòî> ÊC3™¬«`âÒ,·7ô.Óƒ(‘:­a8­^ÑãÊó(¾Ê’¶/êzÒ¨¨(°b±åd”ˆž)‚ÎÊ:t#ßÑ‚úšORT‡1žnî1žÒ¹wnkzÞN•·Ú»ñæòÄe¹¯ÐvV«¢ÀÕ3ÖÜÖ=Ãc˜ÀSÌZT+ ¶äJ©·¾2Ø%“‹Æ>JŠ<NX9鼨Xü«²Ý ¤)2ÍZ['Í‚)·Ã?úÑ;„ i£ÜiDwk"ˆùÿySJò ã5°˜c&`ëgðœ,*ª·KØÁ~n ÆL›…ó‚ÇpÃ… ³'®Æ’ ¹W€Üó*¢è‹e¼@r¥W|@ìžø×’T}hs€?¤â[´»È!U†çþNÃÚ0V3cø¥@ yÒ°²>r çý< ÏLp0Âð@´C§úa@ˆ S¤W=i@gNa³>…÷­¾¾Ê±èØ,lQŒ?ŽTEž~¶ÓSa'ùh·}QÆ‚ŽsYÇá,•rìS:OÕ=OUõúÒ 9n–¡ÁÂD´¶ lq×Ä:ûöʨáPEÝ.. ÖRÎÐé&ùåûh"5ñýÒÑ!É9dØËßTS0:väçà}°ç=;ðçQŒÆ¥l,•K˧(@L)õŽXFØdW >Ð&¿¿²Û ’Ä¢´Î‚P¸åGòø°ÁÎý&صj¦þ먕3—œWÎ tk?çЀY¾ëx€pZû„åaeö²J&¤(µ 1ÚskîÌa9Jˆ€~Ø Â7镸€…›…ÂõN³·²N3¡ €±Mùu^‘†r¯ä“éÆçhM´0÷‘î»n†xœ,ŸZEeö¸:”ˆð Þˆ^ýåFM£Îv“€(8aâÆ™8BüƒNB¬¾ú&óxAMØ­/ ׄ*-)$¹Žƒ(m@Ó Æ§å=æÍç­jÝúðù<;oÏ<üET‚rÐèú·¾Ð¾P¥G\ô˜b´:«þaRÒ‚¤Á`n1Pm…Þ–By߯Ó!ºÓ.‡ç?co$=r™B“IêR¢ {¤fîó²6>*¨¬†C"3²ìù}i|R¯Jãym¼Î†§‘ÎÊóõù ¾ØWÍê‚§Èý÷0<0%†û—½á+-Îjãc>™Ëºù{d:kÆÌ1¸OŸ»ø8°WÁÓ麢ÜôAùéáÉI{¦p:ÂÖw ¢>ÙÕ£è!9<%'Ñ9®:Š&GZç’” Œ¯—]t¯¯Ú©,Σõ"¼Û%2%“ÜYdX|Œ"†3šÈóe$;%\óEI? S<\ÃÒU[t6„XÿÀ×½Gö½ŸW=Á¤µG E¬Aï'7T Md±sñ žU•Ó¼™ªÂ¡„E ‘{jø$[48¶xUG~Ø™9àL›e}Ý*ò¾¼Ô‹ÖŒ2 Ž]ªEúñ§"˜þ^ÕâSüAÚÙ‚|òaboR•¸SÒ$àíL@S¦Iº*¯«1oJã‹V)ÄÖý:¡lÍüÿé„nìØê€Ù{ÈyVüJôÊX–ôëûL¸:£Ülußv¦.ž¥ÎjÁæð|Y_a±Ð'¸XÑ'9ÞÙ¥òºKÔ~)Š Ëì܈Ídñ‹Vß«²ˆfŸ¤g&wÞaÿÿÜUOËÞ‘Ün¤L?ÃKw¦t+ œÝ¨ÖÜÒM lÏï,AŒŽÒñ0äV+HH°„B.ב‘©.¨‰ t6¯'¦ÜP¼¼€‚¥3|VЯ6rø3< ðF¡)ÚÅIj)Æ$Mü8E,¼o9Š ÷´„߇øGˆEm ,aOâ¸Íú‘øa4z÷©: ^4*û} ]P[³Háõ°˜F›"·1m߆ɘÛÝQÊ‘1­® 0mŒÓýE 6Ñ–~('1Ùa%VÏŽVÃ!¶µ'­Í)Üý5í‚OÙ¢b­+¥ï:™»]Ї N‚°ôÛ&§‚ë…³g¾øõf¯ûX8’óÞšñ2‰ƒeGÜÅÚ7H6‰¥–‹­,GÀ:`i’µBÍ]ŽX¤QÜÛäq87w(3d¿ÐƒqJ#du„CÑf[¶ÉžŒ¨<ÛÓo]#‘n5CGr׳†·× §-ê(cÂºÔ ÖÏ«R½é¸"ȧeŒËúÑúN196ónZ¥Þ ~–^RU$»W`ª)çAл1fn†[· ÍœÈÄëàà˜ ÁÊ{®ŸKavn›Ü2`ºšH²‘k¤jlvÛ"lº-rê©ç´«î&”ÛJ¥ëÖ  ©Ñ±¤¥oj8ðÍ€mfgìŽÝëDݵÌ*ž"õVE©ç 1Ñb=gž=rg“(ì±ÅÁYºf o–*kÄ7Å JÂâTUˆRì†ýIÚüð›n”À Ôµ`Ñ×8T2ï ¡€®àQ¶ªŠö©Í^Y;Ö;ŒòÚ½ l(`¬Tä?þÌJ—ü%øYv‚Nd_u“…rJzéç”ó›å:&Œ#:'…Ïyb ÑÜË›XÄ @ôÔÌ`%)!µ^U•ŒY¨=ÔzŹ:EkŠ—BŒ§^WæÚDšXˆê_mÀ…†úäÚµZ¹Þ4•Êd) $ƒ€?uÇ"-Ÿ­údW9@Ô*©ž©í•ƒµ ö¶:fWܽÀyC\äÖE#ÄÁA2OÙ9 ÑLLïM˜†È’ÁY£˜±ÑhËíC¬ÛTmz­cK–Z©¶~jâmY@•w§bñ}·_ÊÛÅÍ´zþî „¤¤l}Ãî`Â×Hbϵb¨P*&”‹éÅÂûL^ÿn÷3WÀUX”ÆÝa9â‚o~ƒ *­x¼ikµÚ—]2 C”¾¤¨Ú±d"3pc¡È—3øi·ž·ÓCˆ{2ªôLò†·Ñ‘ñQ^|Ô1x,Ïø‹Õ¸IZM~1s+xEJä"ƒ±°ð†ixñ¢¦py·]©^Êx.0Ò žÛøöÞ²Ì&kK5ÁW­Ž›U —¸pE%¦îÝ«0{†Ð-bDX óP‚Ã:`ŒèÜØV†ÍÌE§î¯[†”wm]‹`Á}ŽgEó¸8Ws¬ªTßܾhX¼¾ÃÜíe-U#5¹.žê»–Ö…ᦫÓ[ãâcõRãú0}_”ü<*îzUÅ.‚_ߪå™»ÄP»0’j!ëXÏ™CtÓÊj4éªF³äj–*ƒÝ™ÑâZÇ¡ Æ©¶Àæ e¶kŠ7bÇÔ.ühWqöÏ2°‘o,ˆ£XÂÙ'VÆœ|* øõàìî œýó Õ_¤ë.K¯*a “¤5c´‰{:$D¼£×Jt%»t¦+:ªS'GOVrgÔ]"9v…uÙëØ™¯ÇØÄ$Ûµp½:cú¨]Žñ "¼è0­4-FÙez:’n]ÙæY¬“‡möìöÎ2dh³Zêik©gòõ²ÂY—ÞéQ\JæI¬œ9¦ÙDGck=íí#Ú¶VV«öŸulmk³±"u\‘LìA1™ „ÃøÎÿ… ÙÅXÕBL3`=›ê¬éçl XtÏW²û,é«)ñª>®ø#ÞÙÈ$Œ=î¼õ'>Ï7y{H¿¼=9¼Î]o4³ÛÃhUXÄx¹yÕ‘œ9¬ÝãU•¾C¸8÷ '¡OávÀ…)ýd¹TÒ‚± SÌ‹+Éñ3qÊ8f] ºDʱŒëËŸ·•€õ‰ØhlÛû¾ÿzJ5…Õª¡6MÕ9TŸnnQ©ð´ŒÁ *W=·êr­Ð2•2îó¢÷:›èœûoéÓã¦3N$ö¹§½BI˜2J¾Y¿ù¦v}£´Âs#'êzÖ[Iéû¦1\VZ"¯0š §º¨ ÒIœ†Z±ZéyQß¿¨«ºìNËæjKE©|•$€—¢²2ø>ð×®}S!6;ÂÎ~oj_v4lC¯šè@…äã¶5ºy°'Ý¥×*ݨœ Õ(¶Ž * ´`D;orÿEay¹;ÉÎE"™™Ùœ·½)8yQy*Êß”çÑxm-ËZ¨üV«méšÒ=ðzç›^ ñ¾] ñ»+Z¥áï2^ÉÎÕƒèq«8Oåëwá«ä¥"Åm Úœþµ±Y²šj7XpÍìÓ·UËßщ—|¬Ùñ}!Ìï[z“»ÌtrÂØÄùžš, ›¶SRrl)B<âþ½å]0(â@ï•JNn‰5Ñ5­=ɵ|³¦*J e˜ž}@JþSÚE5Ûâ¶wKH±þëÝ„!E‚¸¸Ðë{+I̱[\KŒUµz”ÆÆo xíû:™ç1)-Õ?±/ ÂèÖ³S>6 Ïi€Z¸zHjd†¼g°Þͯ™žã6sÎ.¿5ÂÒ}élî¼"Óð¢t¬ò@¿,&,MÁúaß«xè5ϞƄ»áKé}ïBƒ_f)(7þ߯ޒ¥å0ô›â·†ì¿¸u!Ó·.‡Á¹Ðàæ#&rV¾…è¶×36Ö+ÍžÉóÓ 5‚ I–@¥NtŽ\j„,jŒÈpÛ/œH”]É‘õ¾Yæe,ˆÅ‚ÀÒöœ¡Ìl4R™-¤É–*º²MhùnòH½ÇT šÊa¯‘äJCßhvÁ–4_wö ûpÿßÖ±é Gñ^ãëéæÃ ÿNàZ®ýE—öëœ 8:p}UÆ`áÌEÏnbT«¤Æz›†…Sõ ^÷Þ NîóÄÂÝ%#>8½÷Wø÷6þ ñendstream endobj 398 0 obj 4594 endobj 402 0 obj <> stream xœÝ[ëo7ÿô0ú¥³×ìtôIó¡$¶ó¸¸IÎ^çÒ´‡ÂµÓ4hlçÙ"ÿý‘zR3œÝµÃ‡ é¬E‘ü‘”òn§kÅN‡âÿOÏo}whw^}¸Õí܇ÿ^ÝzwKø;ñ§ç;wW0H hi‡n;«ßn…ÙbÇÊãt+äÎêüÖOYôM»­µV5~Hß°t]×Je›û ÕZ1h×ì/–¢Õº·²y¼ôçábÙµnèlgš;Ðu°X*%›cø\Ágkºyˆœ†ˆvœbë :›ÆŠN5?§´0D5G‹eëh˜v¼H³î.t Kk+ ›Q¦y‚Ó¥”ƦAW"ü+ØY\ ÷ïÕ?@p "8ØbÛ9Ýê äeA< ¦0Pj:pG.U‡"„a¡8ª¢oÓÉDv·ìýV¸(›þ€|ö½5²ùgᜑ¢y¿X¢ô ›Oa¨ÙŸ‚T´G.a?-îõ>{ÓÎ4o ÕHÀtÚ¯=ʵZ¹æe¦AÖx“ä3 eÕü¶XJOÌz q´¦9Çc¬Ñ°x¹¶JEÚRéæ FÛjÓ8ÑÁK' jsºPÐÓÛü^ø=)K Cøó4SãVÀÁε 6BÈ”~¤pÆuàDcP6ͨ[°oAº?£®Ãþí`š¿r€o[IÙ;[à‘+0!‘O˜tje#ž…SÓ}´SùHPïqü9²ª[ƒ‚únH»e†u¼J¢‰¾ö'8ô:©öG}°ÁO¥uGàÜMЉÍûÜGÂ(‡¥„ƒpzg)TÛ£Î{y\Ô‡•ÆYCTð64ZéÕmÌ vG^¤"/}?=‹¥4èöÐü¹èu †äüŠY©?Õ`´ôImH°whr7QÌT­ÄvÈg¡~±·Ø÷à˜?" T°©‡@K ‹½N%GÿjÑ·]'œJ³çݾ¿$;×<È4Ï®M„"ùIm^°;$È´N+;|[qà»A{o qA †î’(–¶ü€G¨a׺ù¹É–“»Ûl,¯2:â¯Û‘O¡š¯¡ƒ `ACÂ0Y& xå)A¨#T=.IÓ{_L@aõàÔmz¿úÏ äFz;ÂKÔÝ—£ºA€‚AòüëèŒßNQY: 1‚  [ùÚÈ…ÛÊðòà멳?~ÐØ}@A±½§Î³#s æ¤;E–Bér€ó]F7 ]‡ÇE‡Þí IÜ~V*T¥üƒh.*Õ€rTÍÏïËŽ»‚ž¨žŽ~7îDÛ‰|’½4~2^o‰U~“â´WÕÔÓÄp9·`ñË«xÜpíÞ£2)Ý‹æqÕäØ/ó1ª)Þ÷ #H¯­É¥€cçà aJ8‚Ÿ)Ad¥GTgªíôKIð˜";ŒÚ.r]ü!{>Œþ:„>ºÆoìÒƒwµ©«§S-GHKK½pæè8GòÆÞo±ÇÙ™ß^Ù¡5ÒÐSCCŒÿUdGe xâÑã$õi©|w¨]CÞ q0(¦ëDXæ,ãù?= ÿå~í‘~‰¢]úhÓŸÚd}ž{aóÚ¯úæî´~Ø+D»orã§Òø27Âô^v 6©á²Œ:§ËM§^”Æ”ž|»æï@rÌ^N9ÎÞçÆ³Òˆüt~hÔÐØÿ±ôŸpŸrã‡ÒˆÈZg²”Ö©Áùã,Å„ã q8Ÿª¸õY "Êu³ÎKíwç:J¦Ø.ã;N@‚³Bü¥§ÄäÂ45tÞûóájÎÂBºò !/í <#y)ùDK€°—ÿ>­õ¡&Yeú‰Ž(ÚàÐ[à IÎáoöc¨N¶{&À‘¿údó(‹Oi"¸”€öÔÝ“P  ÷ÖKêm•o Ba–‘ì­d že´¹ÌFÁÞQæaKFÒ.hŒ”¤‰ ·f¸Ô͵f’¯$%’;_€+©Ê0¡o:RyÔ)Vq° ½Ci¬ã&@5\Õi`ƒQ[A…“émÀ³‚„±S.Ö¯“g€„4󤸑Ñiƒµõ6'û±ÍmƒÇtlÄûyLÜmk²Ó‹u+ç ó¿‰Ð+­·_…±”xÏûÿ¾´ÅÂSXGÂYö2W¥¸B]Và[€—‡[7„²·_÷3Px¤}< ·¨²^2(*¯l^xe ¾+¿pY¨!FT;ã1à÷Ü÷²Løœÿ⨼/g”ô :Ÿp$.({ô”:Åÿ:¥ÉÐ)û/ h]7…ÎëY1|Rû+[–Ù Oc¡9š ÒjCËÃ[€¤ìn’8¨8EâuCRh1$ÎI!¨öÙn ¢0ÕIàÃ,gFàŽzD01¡gþK Nt£ºÇ5AT‚>(éj•Ú›‚(¨…?NR¨U½7Æy'aån‰NÑAˉrÔõzˆ4¯_Òðe>ϠǾUxFQõ¦÷^0’¸QéR[_™^gÙ¡úgI%d[ N•6_}ÇšYþ?5À·%ظ[ì>Z¸5@N6OKaí9,eM,SúpC_$ïݪtöt]?—n"0¡Õ!Þ¬}z(¯Ö!º&I67“Õ’Œ–Ô!ñRŽÃÑÄ«îça8Šï—0À_~pÇ…îŠð|=¹C•ꮋHÑÆâAὠѪ]tô8‰H7uVÓÖJ©è5³RûJTz9£äæŠ]áaXïÝEuŬü¥³?OŒ ’ô5Xæä§héÊ÷É }­êÖìp4ÂDÍû?îdë|]hdWæ¯ÅC¸Ç ÙhQ€àsùkâ¦gŸ7Te”´– ™ÌF²Œ2†ø4i*¥&÷OÓû·™ê2ø= ­{鋤»O ´b©ØûH_öÔº(¬õ5å†Í>r`øv¦´<Űëâ^l½ ð©MÀGìpÐG¬‹(äE|´¡ä,¸iÀ­Xm¶XTâX> ¤1ÇÉü´ ·žœw!–•à 8Ÿ_ý‡µ€ÃõmßH3_~Eiç¥qå5´uþmÇq| 󔢯œ·­µ±½w¼Š'ycl()†LÉiM—»¤D ï-ËQN± CàT4ìzÁæ#uu¤ŽP=w†£çL0i7¬ qV7®ìæðã$eû9MÂø£y6SrNnÐí) Ü0QÏD]j ò:}²D¢)_“8ÊQ×!þuŒíæÞéŃ€hÇ¢Þ6Ão|‡‹ø6 Z= …’ñ}¹³ÍÝÜÿ°ô¯8Jsãs–Òãܧô?çÈÑhlß#âu¦_°ŒìsŒ®89”5÷æ„Säè£ žeÈÑÀ“Ðß›¥¡Ê'Yk¯Œ½]E¦¾¦6ôÃÈÝϪñ$sy\È=ÍG,륟pÆR*BX±”î1Jå`Wr)ö“­æàÖêo?ùã6ÂN=â´ã 9R³TŸô÷8ÕÞç,goFuÓ›•·ï9Úß º…Q½ÝÜø„ãn¥{•lÒçaùü¡|r´ÝÕƒ‰n£Bß©ô’P jŽçé}²”„h'†x‘Ÿ8ý½JSÿo¹ÿ5÷ ¨.¦g@º<#bÅW|åÜé%[™~±â;¯é9BÒ¯eÖˆÄ 4s&ô_—!O¯NرŸËéòÞb'Õ´Ñ‘úûíßàætÝï$D5S‘±'zAG&Pؤ÷Ö£×Qa¤¬yÉiQ-°iÕ¢­P^tåQþZßM¸Ú3ðoy9ùU–2Ùü—TGŒÀÙq¥2sVœh­´Ÿufþ¬ºaÓKÁ·Ü‘MUQÞ´û,™“ œMMuùUňץʶoaÈ?8 ¶8~F˜>-$ßT$+`ï™Ç½¨ˆáj{í#~½}ê/â%Ì|¢'G|D™¿^¡øücïægOÅW?_¢>®,”v9JO9sý‘ oŠ}Üæø$žúN9“Ú©¯G·¥õKì`ŽÂȾÈÑJ‰'*FÖ"vÙÁþBiÅ ‡œÒs*'´¹9Mcã²ÈQµÕi¤ó‚¹ËéǦ¼£PzÁ‰ˆ„'OFóz:«ŠÒ¹˜„ìÿQuj•#Ï:›­yoŽô»ùpï¾{Ô5rßw+W–ÕÝ«ÈjšY­®qh›‚Êí¹˜Ø '_©œE»A¾š“ïA:‰Ò?Z/2ò˜3\N*1YѪ$+ܶö’7AÀtG²³¥6=øyö$RÍÆ™’&¯¼ó|fÍõ‚¾¿^¼†cæ íbây3òᵆ••ç[SÚã(]‹'–ÒxÚã&­¸Æ9F“Ç"~v/Vü?sLAIMŸñsDAê ıámY$º9x=Îúò0#Û¼ÒXÎ&3‰5A:k“lU¾)†xTw°{q[X#ñ¥O¯È̃Lî8³µ7åh’ #¶<Û¹F²ëÙ7† ªeϸ©‡¬%l Ä†B,ùÊc ùp{|½}'3›£™lëY0C|‰˜¯IDsbP´DÂS­ÁÄžûÜØ`¼•ÍñÊnÖ¤£¬g eKIÕå¨g¡ž¾›•¶Ì©ëS›8¦‡0²tÈ ·÷š¥âF|B¦¹ÎÌþ•Á¤ÜÁÜ{ûó›ܦ3ÙIÖ²)šßåØÞÚ•ñ”+m¹zøÆRÚL\R‰ùVœ1Ö”¼YTæmd5„|íp÷W·þ þ7/‡`endstream endobj 403 0 obj 3963 endobj 407 0 obj <> stream xœÕ[msÅþžòGäg-κó¾k· LÔp¢WKoY!Á ù÷·»ç­gw6çäüpË2ÆÙ™žž~ïg&ív­ØíðŸðßã×;_=q»§—;ÝîwðïéÎ_;‚&ì†ÿ¿Þ½w“„„‘vè±{øçŽ_-vܵ½náãáëß®1 Ù˜ÿÞ‡J+ìÐv=,:<‰ß4KÕ:7 bñ}#Úaèõ°¸ÛÈÅãf)Z­“‹Ã¥xÚ$¼üœ!àÅ?^\ÖTÉ\Ü«Q‚å¢S6ˆçÆËW1²­ßW)mâ÷uÝoè÷+ i]¿ÿ}Ê&µßNü¿,ö¬Š' ÒtÃâ( ¼Ë³žÃ7,{Ū1vœ÷iðy<­ ¾»¾F‚A#»²ä3P¾veœ±?eÎÎkûeÎÞÇ™žñ÷¦p!°d,Vw—X`™¡÷¥*åÕ_ñ†Q²8r/ªÎ  ‡OÓ”§iʿӆûá«îÑMôBàÿKüÑå“ФñGŽqµŠ”™Æ/uÁ‚JÛ.´×Ô™Ìò¾Ÿ,‡.ä‡4x¿V,k4ïåÁ§×k=¨»5êûµò4þÊkÔQŸJÚÖÈØÞ­ºí~Á1#?Ź—…ÿ-ùe*Ç笅"2 ‰dê$Iæ!ŒFêÞ<Ôȩɜ$ÝÃï½@~ôYžšýò¨v_e+Ë%àóÂÃÃàÇ…Üñ)äÛ¤ÇïÊLzzŽíqíÈGÕ#Y[TÍ¥U²˜ñÕ© tĈÖ‡VûÓŠ­Lù¹#,aYHF;‰Á}u«”$Š>˜ÞiÔŠ:˜¥A«ª…ý¥À"T£“¾¹¸ÕÈÖ9§"Üõˆj:[s`( OƒÌüµV[ËA®0æ>Ëô_D¢oò؈ÛO˜5ÐŽ,:åOÄÈœG2XŽt‚ÎsÜhÄ›”Ób3®ò**v¬uVãöºñ*¹øGµ¶ÀèEÉ ›û¿GÙ°A%ê¬d<²•ãc"ÐvÚT>Ôym³¤h’FpÞYEH—È¥Ó¾ãUÈbÝ!*ÿYÞ(ð!mOºÊ_<¯óýƒÑ‘CéÈeµ à¨ÅÛ¼ˆ©IzF,êõ9I¼‰O§Ùg™D²*1Ý¿¿Í<Ô¸õiUh„R+yu}ÛR­2`*ʵÚÃ¥ÎÎi;¯qoRBJæ,ÏÓ°`{J™©=àLF¬zj¨Še/(òàfÌ#NSÑjËmêy²ïlr̸ÃL',§„µ‰³èülUéïÈú³Yˆ´FƒHó’¼9˜1û¿(â™K²tÝ÷¨›ÞIÊÌ¥BPÔ®zðÁNƒ„]UáÇÀÖ¬ ¨£ÈŒÌF“Ï\`ëÒ™VªYó‹‡dRJÖØÐŠ—½l¡ú<ÁøÈ¡‚¨I“Á¸D˜ƒA¥ïÑÆV²ô Ûœ'{9É®q;’?Y”MÉÔŽ …6 8‰’/‚“4ȤšMÒ HžynÁÌ͉ç¶t*V:J-;Yi×…IˆIU'[+è.¥ÆN]F9ûƒEò)Mœ>#H¦&KmÞ{tj(2R¤ÍqZxÄ “ÏDf³»ˆûúe1-zÁ›JÞ@cÔÝ­'´Id¢ --À§D¼t¢ûž³"[øÃ‹˜B{Ȧ9÷"ÍüÛEÒÇL¨š€P[®‹ºˆÉ';К¡Ä;‘÷U™3²-fdø£§Ñ$ù‘á2³Ÿ„è2_\ed3ßÔ¶;ñÆŠE ”¢‘À¬kË›ŠQº ÃÉ8>àåžë•B®£ã­k‡aÏ ˆlÊË¥Vk±É¼œ!qZ³u^Ë‹’ÐDÞOb`ªÂ¬Gã\›:þú‘nZ>RäTC™Æ©3mÕËPÖPUTÊ“9/d0ºJö¬”4–°¥RØ}W>޼{’”Â=íÒKªt˜‘íE’Âà ²Î(­s¼ß€F'êôë ÒÚu°%.%oyöRo÷>þ–ºQE-%9=ª°W°S‰ªwªl0#G 4+0&”ˇZÛ—Œ« †á×gMD_‰×„½„æ`MG]øtɧ´$Ã’†vöœt€ª´™Öão#ð—šbì® veêq’èy`+¢5Ð;eºˆøézBùnB¨sÎ8ÆAf’69[Ñ5•–¹@ާk»¤Kè†RvÂîe`%H#ãÍï3»¤¥-áë£`ÂH=òõÄ'š>ÿK¤¹zîgõèk(¿K’’'6´Ÿm(“’R'IjWøãYšzöˆÉÛšªò™˜z«o7ò`†ƒÆwl^çˆÍBÓ‰2è¯aü81þ:Fˆ’qµøEuB&£ 2#ŒpmQó³L¯ÞÖ¢³§¿¬‚P³hÂ}S¼XjÞÎ "&;åf†¹î5ôH]ö÷Bdw~ÁøD™÷Ž¢Õ¿<~–a«£š£°ÁªNš©_ß®ùÆÛÚ`™&„>¦ÁµÍ« &[~Y¡^œ EÑ÷dC.aæ ž‡C›Âüf†‰¨žù\¨žïçQ½N>³=ªG]Z¼¢2Ò9ŽˆðŠücƒ¯á œ£j (³°$^¯ŒôœÏt`—øöoZÄc9Çú¾j‰ŠÞ´ì,Üb„,® 1zXO€s‹¨ýt¶d%•¼¡á§,=\ÌïîøÛ?ÌÕ+>Ÿ¶ñ>lT¢2±R>B7h¡ —JÍtƒ™» ÜØ *)}\Ås10H›¤lÀ5¬C«±6‚†讀'X/§´dHØÔGˆ²®ƒÔo3‡WùÔ*áÊ þ$+î$­)Ã*%#Fbݶ‰²HoØ#Á“×qH¥ Úö@$YwGÈJ¶î‘¿h ¿¢¿m xBÚò&mÜñ¸‰°\vó@vä­ŠeœpÓ˜®÷dPöX¡‡µô@w6Œko¢ø6õ®Pfw3 8ÕµÖ^× |à-uäÃLt€"Å•…‘lág³øý]Þäb–(Ð2:'– AFZZ[Ũ7 Ïq“7Ñó(9œ„:õ¼qAVuà~Ú—‡ßdTïB`‡ú v®o+«Æ˜Œ6ÛWà_ 2&sU–_Øœ˜A¢RÜÖ ŠG).¼ú±G˜±|†ªÅ³”às-Ì ÖpæEæ(ZvšÄޝ äñ(Í Æ5øª¥ŠÎeHÛ1£ò¡{˜²Ž!EÍ#ô q¤~A9³Û_Д@^ú€8¶¾KQš,óPg¨‚äÐÓ‘¦P'‘³&‚iÀ¥Ì–<Ê¡a*KDHn^ïT‡—Žn #Ç»%éæïP_˜±â¥ ,PµO¸Ò‘ßܤ_Àx1”q+\É„{úÒØBº€û}¦+uÖÞj1ÐQkή61êô](9Æ¡+ö½µ†XÿB×£-¿¹ðÝ×]¡Ï„é¹Ã3Y\”šÄ\ÁKˆaS£,$ÕùÐ*7\¸:ôþúþ:ÐS ›ˆÆpܾõå ¶qÑøÿ´3}½òe…0…‘*‚òô†$-ÈG «…ðÏ5ØKŽË장—Ò×bg?ñ#^ÍÐÑÊZ¦Zp|‘mnîþNC—­yËêªÒZ´Ôõ)–=q /ñ–èÏc9Vm`91eÜA^ Å‘êšå,ƒ¸ uüÓJðgòÅ$׌<9jz‡‘ˆ}hõrØpãWˆ©‰Ðß¾6è…CS6‡> ©m‡Õ7®½§µåØØC—²•5ÇÌ”…¾SmCgo÷âq·zD…œkÀ°¡¼òªè5a! ° ÝVY¤„œJÌv®VyJoh‡o©§áˆŽC7mS„îzqS>=¤e@Uí²G«B¬Oxé^¾ À‹Ñu‚\ŠaNùH~#/öö?àMóGJ|î"È¥wgqu<Úcë¦|çúѯqüsäÈÔâµË>ù;µN™ŽSÆr« à©R”3ÔK¯¬RXéQWZ3²¼w­ª¬Y¨ï0&f Øk„Ùöãlíf:@l· z¶»3Ö[éôîæ0 ÊÊ(z[\k"X¿á·R›6×¾\‡&DGÃ>Ê&pR–d Ìiþ<â5ƒXØ{ØëR{+›Cƒ£ >Zq×aœžçά†/i&¶Ý,3ÜIv“z˜\@¬„!#†¾6ªY±,ç߯´¬^RÆ*ü_ÑŸÉ¢ÑNåüµ`Ì$ÊvÎŽ«ì¾‹µ’rUŠÁK˜Î;iy·ø(•åÖ½†np´å‡dZˆezŽç·ây'Oô˜O_¹{uÈ­êîB£ò„¿L =0)Ä™ òÁ*v1~¥TÕZtÐçõDÀ¾æeMt(äÚÓ%Ñ—ª‘¯áÓs™ÿ‡kø oÏÃo'k?þ`pšïóÏk×ð™ú%?o¼†?ªñÆïæIÉzü`û‡;?Â?ÿ%‹¿Tendstream endobj 408 0 obj 4056 endobj 412 0 obj <> stream xœ½\YÇ‘~'ô#æÍÝ v¹ò®4à|H¾ä]­4^@¶÷aÈá±8CiHËú÷ŽÈÈ#"+«»ç!Hê©#Ï8¾ø"²¾»˜'u1ã?ùÿ/ß=ûù—áâÍݳùâwðï›gß=Sé‹ü¿—ï.~} W¦8Guqùú½­.‚¾ð‹”¾¸|÷ìo;¿w»i¯§‚Ù)øC§ ‡ež'mÂîw{3í²ûtP“µ.èÝí5ÿóËýaž–8‡Ùï~·>ߌѻ¿ÀÏKø9…E+»û¾°,1:|@M1.6æ«QÍ¡<«f³û~ê˜ÝWûƒƒ~,¼ö—}yë×{;A~¾†É¿ûo|]kí={Ú 1*Þ¿™å.‚Zþïò°p°6lá`ŠÓ¼ÀÚ]^ÃzX³wô ¶üÁC~ò`f\²H/¨½E6£–Umõ7mêWÐÁ·eC^Â<­UZï>Ò=,q½‹~€ýY¯Õî´aÃä|`ß¶ÕÃûÆOκÝÎݹà5{[û~À…õ³e7þ¿ôwÓ{CͰ˜mŒ·|èÛÃïö=y¼Å&Œõ“uf÷~.ðKûô"SíÆŒi—ðQ6Ž;¼—WƒÝ¹Æ;ð‡Q¬™Ûºbø-5 (Nz^@t‹Ô0™û cáU“~iùà»Ö^ìqŸõ™ÄÔ)óCkµÎìºuJº9âþ ë êô¢Jiꊭ׫´³JsΫ›×‰–`‘-–fªDØ<ŠèlYB¼ÿž~ê ÊnâÕð–r“˜ |ù‰Jyµ7¨¼*î~DÓ ÁD+sÐ!N‹½8(‚:kZ!ëk‘Ñ $²ÚbBÚèàA;~ÑÞã뮣†u·ÜÄ|¶‡©PEn8¸%û3¾f&ãÔî{g'XéEjçG®\¸ÚX¾/`F-,„ž…’*©’^6á/ö lŠsV ü‡´¤E)åûöó#&X*5)eølólÔéO¦¦m:M¾Û5xÏÌ Þä2ÛnÒÄæ†  €Ñþ.ªq‡ópB,o“ô,Á%5?¤ !E÷àpä?b|Wo«83«€úW¶„6ÊãO&èøüË¢OU±Ú³IŠó,’»¸Ðdš Þâ¾ ,c™fe ˆ”Iw“ÝFÇZø¢™ÄöÎÔ8ϸ-•Õìnû³ÁHÚÎ;ÄéÀzZ(\äòÈ˺]çYíôžW»¿ïÖ6ùÎ×' «×îðÚ Ë³p1kB"ûg}åŸq)ӰГ£¡È]co6)7öiÞr¡O’š%—ߢ¾õ®o€éÅQ!1Vˆ ²w2ƒ½ÂvúõvΊv@-»éL»YÜô5+¶O(×Ì ç3*ðu*Vm+\] ¹èf¨³0§¹H“¼%‰YÂ9ê(wÑ*À˜MBI;ç‘<¡ÓÌJIžM­¤Hîu=q¯rÖV„££ãÎg÷÷}•‹w ’ÙEB²É€Sà¿gEKñ 4ÙoÀÂðŸ_¡9žg¥„ŸhQ)I ®5jÁÜ}‚ô4úæWvÏóÃÑ óu}æ¶]ü¾^|×.>¯ïÚÅ÷õâÕŒËìb²rí•xÛÂ:ý'¬"bëïG=ÿP/~Û.¾ªoFÃùP½h·_ŽZo ò¼]¼4tÕn·‹GïÀÖ–«°|ZL\Ò¶,÷ —‡S¸ü‹=‚K›Ñ%“Óìå—`ÓÒÄAAkæ¡v0 ÷þ,(Ÿ›BuÓ·Àù2£Ÿâ8•Nz{¦¸ ã¡Ò‚³à°ó\³mñ`oåu»5=‚hÀRàÀxx†ðX)0ZÙA`óö(€yyµ$lýä9‘«‹¯°VûÕEÃZW×p¿ð±Aˆ†¥êfæK⓲ÕÞÌ´@ÂXšÜ{ËÑ8ƒÏ£ór(ÝâsÍxK1mÂc=>Ï>Ÿ  ­º…ÒgŒ¢>À=ÛÁ$jÁrÁ³re l \ÈD@÷ o5„ ô''ÿÒ!€ˆdšƒF>|•BCš@0o#o”ÉBðÉ0¶(Ø`i´ÙÀú+d$ãp¦oLN˜(âT¿‚avI[Øõk±;ÅÛY…‘8—×rfx¨hÊG.¼°ú€¸!¼ Zk#×+9¸Ò¬Äeö á®Yù•sï™Ãó45+°ë3 ˜—ÉÇ­b&}4Y)÷g¢&8F<ÎìÛY'[0–52ÖÌ:šeÇfýQFzÃÃàHçyaëÚª0y'\U‡¬ƒˆ‹)×›½+lmbkÎÐøâª64žd<°x”YÎ*[¸Xƒk¸#¬·Ô·¼Ûä\0zØDíãMC#Þ~qJHŠyXG®Å™Ã)Ö¨! ÍáÉÂÖÂÓ‰ ¢—˜Ž´`ƒÍ?¡?‰$R{NKéBb,.~K^swŠÉ³ã_4²8SD:‚±a2ciÃ<´YÆý.B¸æ ‰3O¿Ý£mA(M)_!!Ï;l¹½ø§Æi1¢þkj¡ÿºiÜ<_”¢3£‚ ,â64äÜ<#]꜀£nÉCá I4 vÍ(²x”I(†"%½¾8g†?P‚ULkE2…ëFëîãù F+~UÄo`»°v4ÒÞº h. ökíq‘íe¨~þ¶‹lS<‹æ" :èHžñq”v z‹äÞ[»7êÁGö­äàJˆÖ‚‚góët}ñšÆaS ÉulS®rýÇ'§Áy# ip4³ð@n÷ #»Év8áˆßq2•pE“‰éÙDv$:¿K±¤Žv1Ñ–[N %p‘)‚æã’ )!WÈÎD*|šÿ¤x‘–bH…‡°£c-Éð›ÿ»WJ¥ÏébJwÝ/&ßëÒ"{—š²45Æ-БGàx•¥šg¦_fÐ¥½/±ˆÀíBïÐ,&%‡Ru$7ˆ@g¬4‡ÈÐIÖ|aDÏ*ßL±½{èÀÓÚÞ›®quJplšqqÈ©TYe~›{;€ ^ÓNù1àΣ7Ù”üeJÚ¼ýºÝ>û¡ðX”X‘2E‰2X`>s!+táýB8hÉSV×üù³ËÿøÛî€Ë˜e±CŠZ, ¾íl’PÇí³èEPL<ÏÖ§7^»ƒ—…"ø rEÁF…A–«DxÂzJ‹kh¦¹wîŠ ç†)%Æ…¬õÀÒ`}&‡ÖÕ»„dàç*r»²ÌC-‘ÈÞÔ{4¿9 N…ȲìïҺɎÛZ.÷¿"²Qƒˆ©ÙeÑÑÆpÅpÅj¶ªÖë×^ÓÐá±-}¤s–iYžŒå`Ê#¥U¥fAÖ2%OOÂl¤­‚äE¾Š±ùHâ¸\_‚ dz‰ƒJ ŠÀ­97$Ï‚myRÓúÄ£WŠG: ÆF3ª~è„ú|Z§ø ææ†hbT¸Í˜9÷; X„Jj!¶#ÔÄ4näŒóÆu{³)tuT'ÙÃúd»’à@Dƒ“ÌΦµ÷®×bÏur‹ŽÉK"ÝŠ,$p#K ”2Ì”„Á<ñ™iJ);ÓUl­sïHfr#0{Ã×_ëM²2‰ä #²mxÏ–úÜEZÜûL)S!KÉ µ‰IR…_ÐÛ’¹Yk›<®æ%ˆì-&ó©þVÌ›ÞwŠsÚ—Dý{†Ædþ%B(2‰Õð­éÞ¬½~Œn)M¦ŸSî¯Ðû>¤òˆÚÍï÷òXAÊ ² .£Cò0ìw_î—Æ†þu};òp­ÏÉž¢ÄM˜œûi˜<®ë]ÙÞ’/H¸XU\Œq»½,.øCWX~@†FMþ©rŠ: 'yJqJª4Îã¬á=S6X‰èÏÓ,x|µ&ØKêé<‘L.êЛH¦ÐkcœB–’Ã6؆åÜ›‰jØÇ *`äq˜Ç‚y¤›25ÕUè¥Áå JKO=–«ë· çĉš¸;‹ì2s‚¬Ç¸.¬¬´§í‰#ÎFÍ͸6?žÑíF圎*Ị̆+B#¢M#EG$ôQ«_D¹Ù~äÊ+³…+ÞÌwäU|ÁÑG.á¿­ð)°Ùªæ¥+·›å<¥žúÜ®“6%ï¿ãÎóœZÿt(!Si㺟ï]‡o3Ë‹ ò+i)w†‹~Wwõ˶ÔèoæH=1¹…ä]ZaWÌ5–½÷"#.Yªü—Ÿ– e]u13QÊ&Q<’š“WÔ4acÝ©M—„SÁ¢ã]4ª „v`oÅA5N=`•´îñr-ñ0Õu@`Œ°æ‰È^ˆ7AQôÃdŠarxrRq$†f/]óO%öAÛq!êÅ`Iš.Ú@¼r¬Î,£ ÿGjWÈ_ÖonžÚÑKÈŸU 5õõB©õÐļ,ÊD‰ÕGËIâ CŽç”¢¥ÅòRj·ø‚ÓeÌ\ix:^PX#èÔØá±G𠣃}Ýé™Å oóµÛÐ!P>k³XÎS¶»C³6ð|f—il‘ª< V1t_ç)‹4êì§yŒ7XßLrW<ÏV_ÇJhMáDʦ•ÏCå8Wµ3kÏë³;†2¢)Få¥_&g>ùÉ6ã/ R’-E·û½Íl|—äX¹«îÄ×(­Ç}…pNó¬Ý—ª—m@²þ¸ªƒlò\/-‡4ÿBФ4eL“€Ï[妎> 6€ Òšü2ÕjÈŒŠC]iu:;ïwß1pÃì±<9¾yÜ7‰Æ¾5€{iøöçœ2®ŸÈÜŽlûÕ¾–_>„›#Í0À#™ dftcR£çú¾¢ÏÝéÖmçqêyœ'÷3g}_«À ƒŠ2adsá¢ÆÚíQh¹R[AØ”¥swFН¨«zhŸ†~1%ÕÌÉʳQm¿ÐêöøÙ ‡‡Ø\ÍQ x Ò¯ ÙÇÐÂÔGáß:ó×ÊFNè*n.*šANæJŸßOX·©Ä°$*Qà€dœJ;Z\J"=#¿ÝÃ_Ë•’Ž±Û ÷à{Ž^Eúþ’*Ÿ8¸OUN C„GªrÊ÷Øá…a}ƒ¶¢ÊJrhMˆæšöuµû¼‚0ÀT¼ÊLï †ÒIUnØNœrÉÉÈt„×T*+}å ݧD©oŠ¥o ª,ÊùçVßì9½´Í&Z×Þ È’“£u1YìñayVß…¯¦æ´,%+Œ}‚l2†]o÷578ZjÉáæŽ¥Hƒ”óíÃOnÛùr€ZǧgÄf´:8;ÀÏ mš¸ü¯Aº‡§ÍpªP&+BÛ׿U±¿.¥¿q÷Ĉ‹ÊÏ$´)û8m4üék¼¦»\þ`î¢Ý‡}H<Æè+Gçþ8”Í|AoÚ²6¡«]/´¾ª^C–±§²)^ǾB9ʧ c_?‡§ŽšôÔ‡Ž=¦« çöë›Gº¯ÜKGn ëÁq¿–Uzé%yË ÛQ¯$*ëACÂÙ=\—FuY[¿0vh,pø÷eÍÒˆû¤Ù©“9Ã|6J½ƒ}^n’x=Ïko(P\FŸ¨JLÿIô? Î=á@2 @ÿè 5tiòÉÀŸÈ¯G|zùìàŸF_U¾endstream endobj 413 0 obj 5242 endobj 417 0 obj <> stream xœå\[s\5~wíp±9gaGw‰- N¸ l⥖‚}pb'q1ö;Y“¿Ýº¶æèÌŒ»–b‹ÂÌh¤V«ûë‹.ÍoûãÀöGü'þ÷åÙÞ§ÏÌþ뫽qÿ+ø÷õÞo{ÌwØÿyy¶ÿå!tbZ7:¶øj/Œfû†ïk+øñðlïçÎôª“½ú÷á·0B°j„vÃhaÐá1t|Ø/Ä`Œs¬ûºgƒsVºî‹žw?ô 6H© ïKŸG¡UHÛ=ƒV怬é4Ì6À/œ»3žô Ö8ÝýØ3­V‘_ŸÂ4'´qÆh•f`Lvß`«u ¦ÁþS^°?ð2B'Å,ïÃLØÅÂLBÅ ,R0@¢\÷¼_(k˜íþÙóaðýe/Á¡+Ðd)t÷=çœkM:š‘= ëÙ#<Å)¸aA µÞLÂ8¹¿ã`˜sA/zn%Gѽ‡)Œøèº¿BÒ©î²_‹B²»Â™”2šwoQZÖKëm/k5ð¸üŠË0ưî–&%(¨;/Ô@e ÀÀ…‰Ë°Z¡ƒÐv°¢BíMuÚ{š9Z¶{éÉs!»#˜–°v}ì_1#%†¿+;(­<ÃËDû—ïP’“Eà,ïQßd]÷ˆ:nŒ§%$Ï4„£‹FÏú´6Zz@Èà/]æp*r$×… F‘+7°Q‘uµDŽÜ’ÙéQ j$CŒ`!É“HµIó¦#¥1‰P&ÞepÑŽç¥59ŽêÔ,jÎ)™u¬¨LT*)“ZÐ&ŽŠ$¹__N™ÈspVû0µ€ÎBŒ£ílðF‹°Þ˜¨Ò#ËFÁ½B–`~aÛ°ËHÑT%×eP”«žç”T„‘ÚC$ú ¶‡î/xp)ÖxoS3îj«Kz'³dã8/Â|Ý+ðÌŠî\#—/RÂ2¢ŒWÈ6;™,!v¿+àß~˜½ (¤Þb/ÈøPb/ÛxbÓœ‚æe€?‡¨þWE*â$ਠ®ee@ŽÜ™ºLÌß“m!|dmZ‘÷°>wða™Ñ攢â"6‡þ½Ø\îÞÚ3qg½ƒ¨O, î[,p:Ša„[´>kl܌޵OŒ ñTôýnâ)‰°jŒ㤣÷é$ê—t ñÑ€áShrã$›ƒ[!©Ã›Ľ“õ¯‡%î˜SN‹;÷ÀæÎ Z&`W–ÊÅì2L¬L€wÈCÅt§œáâÇY£Ð°9¸[.~‰§ÖØc€‡FÕë¼LÝ]Ô¬™·L÷¸Jmq©µO§™¤] ”,æ=»€5‚è÷¨! †qXÜñhÔZ‚Á óa¡唸ýMT¢* ^ šÖ!”¸âÊ›Ôu8yP°f!½óÕb #crÇeù´”ÀStà”Ö\aÐìÙŒÃ߬³ì~P@w¶ÙÿG }Ð=Úø5Ø ÚŽ,(Ÿh¯Á#(úë“|‰`P–vÿ©Þz¤”]Îh¡tQô^ý“iÚ6u˜q²qqJ²¦ƒ+m—(…Xjæ¸ š·ˆbT’Üë•Hj Ü3âHÊÁì ÷;õÔÇ»yêÆm•ÅÎzlœ³,ä~!#Ôå¼)Q—èû/3‘Ä-H«öm^0õti{µ9‰½hfT¡á»ÏÒtaÛ'mµíƒíåàt0ãLú ¿ Z¿÷Ãðå¡`Y8)FXGjFoŽª°Ú'¥ñ’˜6žäOoËÏG­Æ2åª4ž§F\`öùßíþígÈ:€áúOŸ¾*£0Ô¿$Ê·lüãÚLLÛ1#·±ðÁÈYÖ¼‹Å,üˆ±¨"´öû»â¤NÕmÞ€^³ØbH’ÁhS‘“dÞ/4wè|П`ñ87ž–ÆW¹, Ìç'†ò¦ôKPx†åDA5ZBúýŒÚŒ‚T)­rã«Øè^6“ÿµe§ÅЯKc!Y­Ss>ï('KþO5)±T?ÊgÉU«çš¡wO­_”ÏŠöJ+l÷ògV>~V:[Ò¹¯4lq^b=E$ÝUç-A^ßFs‚œ’Ïr”µNŸs݆y¿ŸìòÅfµ’ø÷®•Hµng™8Äb¡ÄA™¦Á‘ªõ¬Zi£ïiµ–Fßåä#+¶Bñ-ÃÍ:&Q¤­ñ{²¿$ÞëÍžú¼ß¾ ÷M°mT~v&#{ÙTÌj[Ef*+l¼òþú¿:îOĘîþ•o4Ó'¹üúh§ÎR§exÏ…§2þæÍ4®Ú°C¾j“þ®ßßð˜ú.;Xõù¾Ò“Y¿ÜBzxV&!µu×¾5¥[°j•GÔ ñ¹”ÚvÏ¿~ƒîC•ƒ=‡Â 2®®§ìåG>¬É2¹\»>dj`]ëҎ܇’ÑËxï?ùڿͳÖø¨ŒÞrÛ¤4¾õ¬/gÑ ¢­ îGzâ!tÉtMI|OM…A´$¶þÎèù ÙCì~uõºÕx¹=5Ú=».» ô³Ï’ÊêÖлø]⟼Eé4^i°Š»V-ðFt—Œ)îÃëF3¦rh·l-â¨%¸ ‡L$X¬Z\ÕŠHÇÛwr0º¶«|4qdáó>Ýâ8& AÖAê ÿ”àäûøÃ@˜>ÉßÝáÃÔ QrFuÑÌrΛ Ïš4Ç“«¯ŠÛéŽt8àó‰râ }u:†} ±p¸ªw“x ़O¯Ég=z¿‘SKžðEK¹«‚NZ:¿W¦-DÀÉ=ÀæÎmÝš¹]9h9k­°é;Ya¢tÝ2¼*aLYd\Ä‹–FŽZüþºÝoâüÒùÜyÓÎ ±úpuQi0ïážÏùN–6˜Ý(®øvÀ#¯ræí`Ugä^à$a_6p…1Úa¨c£D+¾Á1Ø&„}àÕÉ]ç³Bæ¸p'ÊAº%L‰ÜgȱêAèÞðÜV,7ëž\´·t¿l56w?78¶9È¿“‹ê’?ºË ’Ðçè”ßû%ådêÓŽœ¹'/û§Òóån9›ÑN+=V[”­Ú~ÚÒö“JÛ‘³i{s Ó~ØB.7¾Œ[,ÔK&ÿmqJχFëÔÝ®}ÕÓ «'Va¥Ê_Ò ðçÛ pþ"ƃ0œ‰pY‰9¼\¬ÏäX/:Û‹Ö!ËÏèý‰–ô9© ´&\WaÅ£¤Å˜k¶}Eäô‡œF5³c9ÌôÜ©“í-’¯ÃŒŽò=TZÕÏ¡ñ Ö"2Gر|êcÇÆáÛZ™ªãÃè\.ø³ÆWãIÖ/ßãËs È&>n«ÈD”+z,¦vÆ A»À+ Êt9¢¦²âÒW¼ÃQ"%ÁnÃöûé*_/MxQxÑ6`[ 7€$!CÁÓbGN-11L&\­;Š„·Dû #fÊ)Öu;Á©K>ª½k¸À‘c]ß™JP >:Üûüó_çA>endstream endobj 418 0 obj 3693 endobj 422 0 obj <> stream xœ­Wkk$Eý>ø#†|±œ¶ÞÁ…5(¢¸Î"âú!›ÇÈ$Ù†›1rÀž“÷D1ÎJ¸Ëùˆ–,aaÔHÊlÿ݇˜²Åü A\¶@‰;mÝ”ÐHV"yƒ‚b$E&UR…{ïw¹ç"R¯4ÍO©w=¾@Åà]%—ꩤiK¬Áhb¡Žx¤Ü %w ¦Ë½ÍSê›ÍUõV£ü¦ EÝ—\W‚¶ç2¥œôYÄÿ/å•(ŸÒI‰Ù«”‘„&õ"RaÁëÔOt§ô“a²¾- mVÔÅ~‰äÝP±€2ì·™è-Ç߉tí Kúš×žÐ±rë’MK–vº™¦r°Ä€­T¾ïy3ÕÓ>F¼DH©¯’Ð6‰›ëQΤM>»B| ÷fÓ,9N¥¨³­•0¸MZuupZš–¿èe›gÏ )sÑCŠÚ¨é`Y}Ú[97ªG¢º‹mÇt‚øHÂ8DÙ›à3rΚF'ý½Ì…X-êU}2e™RÃQCY$½Y¹C`,]ýªº°:I]H _æO{œ¤b®¼:ãºnü»Ðª˜U‰jR…·•iP…ñ]®%;‰›…¹Ts%òyÕ(KÚ²ÓÞ^TNmɪÿL¦ÊÂßpÎSH1J][|ëŸ7Ä\æ¨ü‚ÂÔÚ«œ‘#]f·Ö‡¯²h”9ÜÕõWœ}Yß9Ãic?¨Æ¸åDP·M‰9}åg÷œî°£Wëp¶v‚é|\¯$×ræÀùx6tô‘¯.ˆiM•G*<, ›BÇl¡Ž{v”nvŒãw5Ð$ÁÉÅ`àzA5ÑÏŠ¸ÀkBGaîýàªÃW’)/6çL`–Žƒ“Uíz‚^’RªíI/¢æ|¨÷_ª’»öZW»½Zšû¬7¢Ï£6„è!ÏÛç>]5ÌËå¤vé£RqK Þî’J2›5U‚\‰ò©$)a×µý"«õD[èI ʉ%tP4Ñ}Aï$›kSl)Àþ²€ãñQàF½¢G‡ÑÏt{/žé³Kûþ³‹œà£ Ç-pÉè{x‰×úäTìwr ®Ez=¦?ý¥>k;n‰®ÅšÀŽÇa¡½‹åO#üyÎ$}Czý¤…Omð¾’à«4xÒ,Ÿë`çó¤^·ÁM<ïc-Óu#Á¾-ó„œæø>Ý¹Ž“z¨+ª”Ù]ZÒVÜ/n•éüße0ÊÖ×uõ¦ ¶ ·mð²O¬G(j~Æë½7Øž{ïh!åô̓ûÖtƒûþ0ô°¾]/~ÅÏ”µ¯ªendstream endobj 423 0 obj 1371 endobj 427 0 obj <> stream xœeQ¹NC1ìý.×Eïú.ÉÁUpCƒ¨‚H•"âÿ%ÆÉC Š,k¥Ù¹dï­g±~œinvæj]ìöÇx{‹»5{#‚Æfgç$Q Ü|Û¿ÍQ-¶¨Í52–}g>¨¸DÙ¥ÏþEŠÜØWˆúˆ 7 \JkBwN¸µ];¥g7Ž1¥~⬎hˆ•Ö@¥Á¶Œ$blT«@þg´t¡p--Ó»ZÓÙö1‹  ‹Dºhm‚˜Á¿ì2øèâAJR•n4(I!MUaA¤F¯n– -RéÍ){ŸÐ{î"~Añ–!ÓÓ«jÎgÄ~òœêÁ÷Pï¬Ó¡EÆ/¬ºyÁùêïe*endstream endobj 428 0 obj 275 endobj 432 0 obj <> stream xœµ\Y“Åöóš°ÿ¼©ÇÁ¶ê>ü( ¶&lÐ:ü@8‚½XÉ:Vèß;³Î¬®êžYí ´š©®#ëËÌ/Þw;6óÃÓŸ—¯Okw7?°Ý_á¿›“w'< Ø¥?._ïžœÁ ·l6F˜ÝÙ'ña¾³b§­Ü½>ùnúbÊfm”ufz¾?³\Êé|Ïfo˜a~z›>õbúyÏg/¼òÓõ>“ZóéÇý©´fv“Å™œ´V˜ÿžý=®­fë,ǵµž•ônwö“³?}7íOùì¬eVe³rœ‡Ya.1¥â¾œ0ÎØé+!µàbzöÂŒue)¦gq£x üôOœŒÍB9ú)Á:œõž‚£z-ñ 0ƒpJ+89üÌâ :øåÁ÷ñ¼nfJþ¼˜¥|zvÀŒ6Ó›º™Kx\j)™èn…ÃP—çdL§‡„É¢ã.röÌGÙù† "; ³q&ñÆ@®Jy²SÊÌp±ÓgñS¼Ÿ÷rvÎÂþ„òÒÚY…K|yvòÍÉ»”³  8U³ÛqÎ<ŒÞ)íÜlÂìÉÓ“ÇO¿Þýüãûë“ÇÿÙñ“ÇÃÿ=ù×ðÇÓ¿ì~wòåÓÝ7«ðkÏ‘ñw=KƒËÌ*¢ðÀÉÂ]¦ýéõ^Á¸(q/ð|¯GCÖO¤´Á“|ò)¼"z¢«z3í¦_Ê~˜›~@,à ÃAã åÉË"ƒú|ÕíqsŠ'T’|ŽŸ;+ƒ:@±Þs€*þd€OƒÞxšwV¿Và‰*¤”Ehòr·{igxÞO¿ Ú!­7u+Wžx!Q9k%ƒ,`ûTí}JPfzG¦ß‚^ê‘þ…iŒ5ЬUáO4åF:Ü[ òü>eÓÓŒO¿‘5ˇ—ù‡´ a³’i°•/öE ø5b»³+@B:ŽånºIwÏU¹=ük’«åfº¨“Gx­È2d$yŒåô¡îwr*ÁB1µ;å pæwô¾Ú‡l`s¦¦SXfTûA/àíðÇWùÚÊýÕÉAîÒƒµ3|ú>ûë^x°ÏJ„» øz#ŒµÓ#ø˜©YÀ¡Fq¢b$ê,Œ‘36<ç“ ÞZ°¡m¹Z¼3>Ö”•¹@Üuzä´Qü %eƒEÏû ÷66.6¸m¼uá%\:Ïl,C:ôÒuOŽE<Ÿ¥¡ŠÂ׺¨h~UY´cqV®昨ÚMܦ÷ŦåoàAn‡ š¬³ØøÀ C]½ÆïtúXýp½õR=ˆio=i±0ÑÓ$d m‘üU€ŸW¼¾¯OKn©3Àµ?¨³z $É* ÇT$eýûo ùxÖ¨<¥D€ÙêYak 3=# ƒ£ŠD)¡†DæŽÂª°:ߨ•²–»@mïJzýE¥±ñÚŒ.äÃÃPBsŸU#O Á7 }Áï~ Ì&ŠMW²µÇšz¹m|V|ž\”PT9qQ"ýô#XûñEÝ Ÿa@-Y÷6zMï%=kpïœéU½À‰²oÚÝ4\)‚ ‹( †…f 94;‘9gç$‘®à*¡@‹ñÃ]ç§“2D µÊÙ½£êÁÅK4—6Чaôy,Ð2ànÁ1ô¹œÃFØ*ÒÔ»{¡>F–Î…yÀgŽˆ²P$DZÂgI`æmWèÜRK³WT.?Ÿê&Rá1º3blçøa °ÐA•DÓØc‘ B¡[±ið#"T yCNTE‹üŠö°Y®du-iZó±p,@µëóŒS¶Øà‡´Ai¨G"ƒ€Õ'UÐ5À(‘wljPŸQ_™ h 9æü¨«¸ì{ ×9׋.‘7|Ç\¢:ãÉãK†tÓ/ÞmЦF©»drÆx/3ï5UÁ5'†Ñ’°«ûÚ´ñ)§m¼Yõu1‰ BQYiŽrz)·5LàŽÒ¨D‘‘2¨h=Ÿìs2µOúžWŒÔ˜:±(LÔ@ºTÌ 2Þ†ѕָ?éâ ._hFJ«5YE$ÊAhNõ¨þn#ªã’ŽØp “t:‡ã¢Aê+è¯b’½®ÐåÏ’ù\¤F;|~¨h9¯k’9p.–7³ˆCËuÉç„ê!0·l­T^¥$ \|¾Á(¡B’æˆìo–ÍyR,ÔòêF@ªd§ßlì»5ß#ƒ‰ ‰R^µÔCtwp]&šp9|)žùAPRŒ(œ–nµÙª79j.;²¯Ö² sGˆh"·q(E]vZ%OÒ”tßÛ‘§!1¨Ä´¹ZF´c­–Iœ…늪«'ñ$A|ŽÒ7¹XJ´ü#E›d(ÄÖ¶M“ÅÌ‚›Ú¬rt€(-L>èPˆ;>~Š‘†ô÷¬jé¹ nLø6ÊN°KÅ%Ég-¢iØÜWD>àºÛ&ZçAc˜”Y ¬^Ô&¥K“s‰´Þ¡¬IBì"kÊ¡² Óv Svß.ë3Ѕ̽Ãar4cÒ¤,ÕØ­”Q’b“!ɨj‚aP¸à ÖjÝÕ£µöAëwBæ´1¼/—š{:¾Ú{ìQ5àD𥅍"s„—>ç|?*Â"Wݪ µ4u”GÁ² Ò||4/2¤ª‘Å8Ä\xÃ& s¿Vi10ïŠwLõNMMÃä:“Q¤ çŸ/SØQWüâ÷Øó$tYòá¦Wüe¦ÝI:{¤‚Y5wÙ ×g¢™N#Ê]¹ÞŽ…š3ëv,·‚‹$J`ëÔ»Œ Ó|;c—ëFÞ‡˜o\ò1ÌŒ´£+ù$6«@‘ñxÄÒR%î ’?HÌÐaé³µ ÷-¨æY·h@ ÛÌ5S¬TÛGA'I–£Ë«J²T^lWÂWYwêÁ‡{½Äwt ÷öï½è­Ô ?ØÄߟЇ¤¯Y–êö¹ ²hý:IýULEà­55IÄ®VBst5™øh·ŒÛ[gKÃC8ÁÌy×-ðË^+0H¥¡wïCH-CìQQÊìÆSYË[;.µi1bÛÔBÛ£C·Û·%Äöƒ”ö¹â"²á´‹A¥&H`EèR|±2´ýõ-a¹Ñà{j_Á›@Åô¿ ¾%ñM9¼Ñà~éŸ9ÌÓ51j{Ýä ²O´«±_tT MòÎÊÝÄèeß6b™ÙYašFA-І½±Ëì„.¬·oí°-’óq—CQk¶;?£ºLì’ùªÕ½Ý^„ þ£#ZÀ'w[.\ÆV¶»ß1–A´l$\ˆ¿ëõ»;€‰Ö*od7:}ÌôûÑ®Ãà¤Ý±娤P¿}ä»_i¿UܽsQ]øµ¢ºð,¤Œ×lpÀ– NÁ$ÏýŒÔ&Žšx6 îšÐÍ5èv5>àëºç Ç`Ât­Ãmû)ê1KÛÝöd 0£œ•w„µ8ñ:zRÇh›¶u†å:ˆ°l}nËÂÜ‘ÚJϘ ¹#©ˆnŸÍõeŒV¢x“án,ðÏ`uE1­)³&Õ›5ñê&5mÉ85“¼~ÄÖˆÓçoŽçôMÏV’O«‡*o}g¥îÁË• žŠæËžÆïª ³0¹h¡ýøÐ™nârbe ÉHo’nƒ­ ›Cº?Aâ9T?´Ìi…\×1]=?<ŽK5qŽ‘©H«K§£R”š/ŒÕˆb\$峬…Î!:U³9G1jÓ–ý‡Š¨)åj?]^s”Dâ+™~áÛ¸! Ü“*nRØ(ž¶1Ÿ´Ç4ŽD;”óy߯`Ÿk-±hI› J3D!—Aƒž%õvŸ˜f,Ì Î@µæe ×µ¨òû˜y¼Wá@s|IùÚ7]lK YÞ%†Õ¢Ó ÌÁ BÈ­T—¯-¶ –ŽÇi¾ìX$?“Ä6¹ˆ rFúq:SÓèéyY~8|ë©jZ±©”çòyWôËQòZZî2•›MAµr¶_³âkÎ!§Šëé“^›¶Ë;dÔ‘ý‰WÈÉùüšcèï9ØGÒ@µ}‡$wµ w½ªwé¨[ï´IôG±6‹A¬—Õ ¼è·‹ù6?¦ÏC.SÞÓKÊ—:”"ºÓùiûmYëã^aZoÿ$ìkXØe"Ð^ÆŠc£[¥Óôf†¾+|«á h\ËšŠ *µß(¸už% ¯-6rï*óRÝ9œ–Ê/Eó±. _‰Oe›¦I¦y©çmÅé‚ë£Ë‹á1BÈÍÙúåW†k©ú˜þüí!&¯:]N¶S¡ámP€¯ èö‰`¾­nªGÑN[“ñÜ­OéwÓ1?€]’,¦Ç á‹^‹>¢^K÷¤aX.xG$÷: ”KaëÙØALBž½Î5:ÀÜI奧ùŒCµ-l¼¸'R [-@¤×¤†óRscnvª{¸yŸUËÒ¡šèÌ:5Êr;¦0†ýF`ÇVŠ^eªÕ7M–5õº§™–Ç‹!ÌúE9lí÷È ÇY¬½E%I‹! i ú¦V8m“¡OEÄàuAöGÞ‘¤ˆKbä¾Ï1ÓXB¹)q®Ó—|=Ò»$Äý{—BA\ÉͶzá5xÈ»´ÕWJq ` Er"ug/"ˆ&h%1vî‹O»Š·9…±ÀÓÒW)o]QìkÇu¢›}m]¯ó5Ù² ¾ã_p ©=À胼à( qá€+Æ+ê²ýU ËDÑPd­ˆ¢çu½OqkV¨¼ãåÚÔYŽ Œyx߆é-ÅîÅ\Ž”ÒŸÀ.ý¢ÎR¤jåíô´yò&s•'È^ß'¢‰))ã.*—×úF†/ÏMÉ¿y$ŽÖ#°‚§¤Œ!oÚCjÀk$¯Ê–Cg&FTzx”†ó zûÈA‚Ri`”ŠiGì,K@dajiZøÝ^ßœüW^ÏÊendstream endobj 433 0 obj 4564 endobj 437 0 obj <> stream xœ½XÙrÕFͳÊ¡7¤T®<ûRyŠNeÁø¦ò@åÁØÆ¦â!_ŸîY4=ºv ,fzzºOŸ>£Û– ¼eø7ý<¾l¶ŸÛöìMÃÚ'ðיּmx˜Ð¦Ç—íÎ&q#ƒgž·ëWM\Í[+ZãÔ/×—Í‹Îöºs½þ}ý¬¼Záô `Íúæíö+9Xë=ïžö|ðÞ)ß}׋îY¿âƒRÚŠn]æìÅQ©\÷F%X [ 0.„§³‹Å=œ +¥¥;>îñÉÛí£]ç9³týa¿W•ò:M€?²û&pŽ[¥U`9¯B[ÑGͺÈà=³ÌÀ™œ¼³:Mu‚«` 9NŽSœúÂð3üÛ- È6dóhFcpþÀ˜ a Hmj𢦃â=L™ƒÆ¶UˆòbdZÚÝ¡pFõEø$'ßÌ3t,Ü[ÆJìð·2þwÞxF_$Ù#\ˆ%úìúœ‚_ß”à×\þ—UH¤³)´N*e® kñ È E_UŸÒ”€6y.lÞÙf¨pVd×Ô›;ô[©þ“ ­UÎ…+¢cAÝ’ÞÄyÌ•ŸH*hiU2`´j®4të¬0)I ³ M¾ÖËzå “*G[ªΩâó@´0zX ÔwKÐàPªv¶NæäH­b®«ÒÂ"¤Ö)ÙÊÛœl„>©‚륵ÉÎW‹÷ Ò8;öY„ØyYsØ­W-¿¼O*‹Šz¼ÑY±¬a’bzˆ™QæÉ™IíÏóo-ÔÓM“Ô(Œ“0=Q¸¹—Ëj#à]ÕtòöõŽØxTÚ{èB>ÜYt5E9tßÝUöX>sl~]·†!¿ˆŒ¼YEQ„=î= © ”É1­ÜSFEZf^¯,|å¸ "HÙøI!y® ×Ì„¼Ò<*g‘×ðõeIÛÚpÎÏBÚé”eêQ5þ’JŸHÛšn<‘^uá@ŽB½¿Nä rÒŒ·½²Çès°ŠoõÕ‰^ø&Bd†a«ñ›äçaiüj¸Q…5A?¢¹@0Ÿˆ9£–,OÐ%î ñ$¦cÆNæpÿ ’ƒÃf;C\fI_õNL£§]’/x˜½usÐܶzjøD ï\Ë-\‚¡õhR~_6;ûÍöþOíÛ»w§Íöo-o¶Ÿâ;ÏváÇþ÷íWÍÞ~{ð/¿†s¸¤…Û éƒøQøJ¼'½®DêÕ·x6ÁA›‰/6Áñ» =¹ÅÒ#BÃߎO=²…-þ#ƒy[¹Tÿæ‰=9Ä_ä#ïÑ,OLîèêºV‘Õr^<¢Uï-}zÍá;hþ1‹~fendstream endobj 438 0 obj 1816 endobj 442 0 obj <> stream xœµ[Y“Ç~ß Âaßèqh[u~³ò¡°%Y¬ž„–Â,»’IþõÎ̺²º«{" =Õude~ùå1?ž‹Yž ü“ÿ¾¾=ûü;~óó™8ÿüsö㙤çù¯ëÛó¿\ p®Äìœrç—ÏÏÒËòÜ«sëõùåíÙÓ‡ 1[g|pÓ‹Ã…š•’ZOW1G'œˆÓ}~Õôæ 稢‰Ó³<ÓÖÊé§Ã…önSÀ™‚ö^¹ÿ\~•Ö6³^âÚÖÎFÇp~ùϳË?þ0}I“gÝôëáBÎ^É4½Q:˜Žª1nz M8ò)}”’Ö¯žâp²0ýžj«œÔÓK\@úè§WõÓ³4Ò3}‹oŒ‡£Â¾e0$p‹]„åê`í¦Gm ¿¥Í /ac*ÎVù˜÷\K+!ë¹\,âfÖÆ)‡Ó8£,â Ná0Ó|гRÅIÂûRùYšéØ€Ò«¦w­g-µ„ÂPç^Þ¡2°×w´” ˆ§Rð~i½~­JLÞ“T 0s‘îH‹²Ð G’BƒLá“÷p¸àBpé—íûG‡ ¸Zc¢ÍB„ßÀاÒÓÏøÐZïÔô6 µB¥*oÁG@9àÒîbÒ†ÔMÃtNIœd:£¾]Á˜×ðOëgƒ·d`©Š[€š*ç={±}ÿº­ø´}Lß+mHŒÃ}ð-ÿ–fÕ>¢&ÂmXMžß“X\”GxQ.>F‰Æ´^äu^ÄvrÉ06°¡×õÓKP¸==GMFùŲ/iáú=;â ÊßÁõ[¶ÙnK°8¹= jhAw-.ŸH¼Ì¶ì«ò-3¥•6ã@4 úåìxÍ*^[´Ê@¢êõÃÝA®Ù[ú†×)×Ò¦ÍM4¨+oÛ‹ÌÜÛhfÊ‹e¼’‚–t€„1ž_¨øˆpŠ·ô‡ƒ¡~ÄÁY§Wçl‡`kˆCa÷g AÜu§ ãœVg+CàÊŒ%…`ó}Gþ3 Ëüm˜†½ÁÐ¦Þ v”·øsÞAÓ;"2lX ¹9Ø^ÞÆ¡¢» «Ó\@K6dït½Ðeø>f?Eï Ãìà`ŠY"ë/ð„Àpµíûª—8¯í0¬ÀLÆ0€«d±løxZÀk냖K "‚ÿ‚H¹@[ # ›}YÑ«›·Œ.VfO “wL¨c‘-áÆ–ÏåÃèV_4%}kJ‹ÎðÃüc6¿à™ï¹Kš]†|KÀM»!q¡He$¸ùi‘V³‹d˜’v¦ýòµ!,4cxŒò$*3`^F¾–)5[§N×€éÈ K.ÿé¨ò’p¼±Â%©Iò’ÔVÅ8 S´vd„(6šâdÁ`œMO{G›±VyÉ\Ù*™çZ[æõ–=d*vߦâŽ:/Ë2“!ʤ<ÛwÀ º ¶\32²ˆ,ŒÞ ÿЭ0xîÐÀÐßÐ…IÄó+÷„~žÝzkPcÉ?ÙG™‹ƒG³ŽØî(œ®p1àmÊÎt\ ¿í:S@˜vÄ T¶ÆvSNÒväK[˜[yËÛ÷í¤½Êj»ðYWý?QúÊtVF8nÞ…Šã½½á>͹!°…`üÚ9Ó¦²I<³„;­¤…tªy~¦¥_PI8Vð³wŸ•ÉÒç3õH¿AÕDë(Èå‰îÆ—º…F€º¾¸ÝÜ€ ´Ô)¦a¬€Ý ßFIñQSΆ xó!ù„\€ÌpÚM )|»rY,ÊÌžq;ãû”ÍàA¾`Ú¢-]¶ïס-â=‚‡G³Š\qël?ûÞ9í-áð›¤ìæ®Ð¿‹[Š¨Ø«6/€n&ÏEäÐÕz. &¶..Â{ÕjyÁ¢¨7a.çiõIÃÓAzä>‹é@ÁÍÈïyÃé ŒŠíðe£7ùÃÜêó ]Ÿˆí¡Ûï@±Ðç_R_z²Ï€6€°hçx ¿ƒ[¾½Ú „L]¤–˜¡Ht¥jkIÍä4ÊBûTÝžö‚V÷.Ϫ|]ï;Zѱœ¦¿+‚$†­»Üœá{&%K½¾ëO¾©æäXÔôø§ö¸žqÛûâDÌû¾cL¾¾3L›±,Á…öUçN`²Å³žB$)aÊ0d¿(aø…Âlôﳟà’ÿ;.)§Gƒvåêè½ͳ H³u³“vN-ØÞø1À”f–’gú®º½ôöC;0z7P*ñÎã©C²qPÄnìŽbæ¯I»\¹±á¸È{z¬5bŽl§™üÏ®‰È±ëE9lÛ2ì|¡ŠÓþoMŽÎ(`µÓߪƒÝá€ÏpÜb:Kß!‚I¡  ²kW>Ï uÐÄ.iÎâ’»ƒíqB…E\òŠŽ`¤ï™X;…7´leu–9LcÖ¶c#TU¼a’½ŽJ™ìn&¦ÿÎ)Ý0­±ÎëWì/¦Ç$þßÍaÑðõqÔ×E¡eèFŽ„ÄìF‰‘ÌŸmÅjat8ôo&C…ÓØòò IswWøbH'Ûõe[I²RcÀnÁsËÿ±8k#Ç¥à›À™,gð]®ZÌ«.ERóQYõÔðªb%þ«}ЦL*ðá”GXb.¥ÍRKÜ4$m0øÃí¸ž–1pW–&T>UàGÚ”gl›¤ÓV,’Eïl†º+t‚"f)Ÿ(WL“reÄSËq}Ô‚:k[(%‰·_0“ûͰ§×S8 –ö»ä/î¨#™fåÅÈVFËñ£³ÌÊŒà7]¬NƒÙ-/ØÊYV°U!YÏ*ÉŽgÁôé-³Ì‡µ²‰rÉ eŸUÄ< X”5ÐÞf,×e£–—Š»”ôÈóÅ]|xM)^ð#êÕ:+™¬r*ø=ó¹§ð#ä$îzd’KZ9}èþ·î!¸oT£$C07ý{–›[¯9L…X™eÐeý Bdð5ßRoÑ&”Ä4Ì[~Êc–O)§Õ[ð1®o ‘ß°›|èT,•ñªâ‚¶`Ö¸jíõZ};Ï@5éOH‹ÕZ¸M 8¤¹ì"XÐßðéï‚ÏA¸òûêdîÓYSöÑS5¹løqD§(Ñćˆß4§ÍÈòtµÑÙ–LåªSüÓ^cC v ‹xdÇ~³…?Ïù7àøNQaL?R}€\ÈQfc+Ló;NQ÷NÉ6¿c¨¼™dS˜†§ #«b¦„ê",ÙCGó©ñFx74»œ½Œ'Ç@“fµUQ,óòƒ&‚Qzª7!‘2\µqbѼp¯Êëºâ%ªQŽÍÚ^)¹[Ôâ”—?̇i *¦RúV*i7@¦:«šdÝiƒqïÛöFJkµïbÅ9ÃMùe÷ì¤ftœ1w=Ô×X µ3 —²TR±8CH­„XøÀÎ(à½kàeÑÝj%‹î©Oà”$ºÃÖÖ­ö%Ü :¿ÞŸŒŠï¸ð(lØêðq7” R  §s .43v˜kÎtFüžY^ñ&x™fÃ, »ƒHGJÝ+;ÕIÝ–9±â(ŠÜ˜÷5Š®v™ÎÛ«ÿ¨SäX¡ç*í¡|sßô»ªk­+ò²‹:ŸÍN68—¼oÖýùºcŸ°Hsy˜7jÏí³‹ :¯}fD(8êÜ ØmSµ)ƒˆKׇxi6¢±+ÑÁMWˆÌ©E)mÎÀ݇F>šl+kAìRÇíV‚â…›*d>ºiæB¾,êH•ÜêõìiµPŒßl¯sÀ·ðž7K׿ Ä3ï&nòö²·O:"ꋆÆ;‰zú¨MÏ$Ÿ%<]tðÐY—Ñy –è2Éÿªz‹‰º•ä&~©å2¿õdàFìöU‘,ôV»ÌJ/1‚mtgý3Çvs”÷¥tø+óÁ'†N¸‘UéoMñæÒUÉIÇë¢|‚ãü‹ÈFåÐ+€”Ô"ô" ûÝk¤N™/ꤦÜ{¹ócT±ªý@p«Ï–¶+‘Ô°dzÇÔβTù»ƒ53 ‹´øÛ¥·^%¢Û2‰K&)m5±Æ†Ê×%ÌåQâ÷UrH(‹‡­™a• ®BCžØÇj£.¹>oG?‘Ã$Û±j]Oìî;‘2TzÞ´Úïyë~ S(á–w] ÿÜDÄØmJ‡mt.êó½ëʹÍ'Ù ‘Ô•°.ž-/f| ¿6s:}–Ÿ\±™Y¦ï.§¬™ñ0®„=G³ÍaŽöÃÈ6ð(þ‚W.ºí!ÇËÛÊ«óÇšæxjN¬XǤŠÓü“%¿ëÜf™#ƒÝ’´ JÓæ¸›Ç‡G;ävâ¥Ü)gÜÞOH=#@ì³6Ï* bíÊÌktù±5æï¦Ì³º6¸!(3½í/öƒÊTÈA·Co>k[êhO­ô¨68WØçâ‡Å2Ñ©­¥ÓÙ–únÂô5XT£/£¼K®íýüe^”<@ÔĬNù]žÖ˜Œ5·L;“ô}\'/]Ð=f²³s ‹sm¯ËsRØ0Æ,½Î7Y×ì¸Eù„E›4âÍãA;‰§uìÕHD‰tŒ¦NÁÕWGOU±Ó[¿6+£}R€Îº¡Ð{?¬0¥!¯ çW4b»-zêo­½h–qD’Ž6ú>>àöÃ,¥‚ê°uhUP/-H…åM‘Ï1Þ´(cÔõo6Ò`ÅM<Õ©ÌÒñ­¿¹¥™¥»†¿hhÉ“ pW!,8ûYןrx˜-&,üòòìßðçÿ>è½endstream endobj 443 0 obj 3934 endobj 447 0 obj <> stream xœí\[Çq~'ˆø/ì›Î:‡Ó÷y°c;qàØ‰Ì$ $YrÉ¥,r—âM¢}ªúZÕS3sv%> ¯gzúR]—¯.Ý?\Œ'u1âÿòŸ¾zðèËpqýöÁxñOðÿë?þøÂ(ú…íiöðÑã+høÃÑœB˜guøçAæy²óá׃>üÛpT'k]ЇǭÍïÒSc§Ã—ðÔ@·q¬<×z>iÖä«Úã² ìøO0Îo{š&g=}ñ[h®ÝIÓá÷~|8üßO³1êðÇᨱ½±ú#ÅŽpÒÿ ½w!Ä—»S‡¿ G?‚šÿ=èÓ8:˜%~ñxŠi5…øíWƒNäâ>fza­AÍs"[ZϤFsx‘º·³;<ŽÖO'çæÃK ¦m—@w0­iò0lûõ Ö ³Óúð¾šç“ÑÓÁÀÏ0ÃÃá9,1vHSÞÙû62öq2Æ–´~ 'әߕéÜàÓÉ:sxÝ>Ç~svÖyˆ`LûîiìU­É¨l‘øý4ŒSñŸW­ÙUöøÃ`â'eýØ!ø#ö{b&œÁyj¸àר¬9ü8 0yñóL3?Î|–0ü:©FJ\çe$<%É›¹ÁŒZ¨"-·0ÀDhÑfñ™Ó¹à5ýIÉ^xð™$€\èÜјöº5Á>IÿÔ@ªÔËìl&8þjÏÒ"¬¹={V:†¹¸1œœŸÊÚ±ÿÖ0OÃûúMUë¹[wˆNëfÐ0†ahŸÜ&ís,<*Ó5U;Q~>ùúKÛ“Ô`šá矱ÖÚûÃçðSùÈ4H¸ÆxFÃbÌÌ¥´HnêGŸŸ%Ý㬥ÛLjÒw‹ÆÁ>Òã>£ÎÔ†±ž£,ó=j5K£m^ô| Sô =åsÒ ãKÔƒATý‚æ 4ÑÑKšO“‰4WêTÕÎŒP¬³ŸU¶±‰¥J9b‚Þàkõßm ¤7‰×ë.yÙBdÒÊâb"€V~Ødà¥(,…€`Ϭ  jt?+è —•œ±æªÚg? Ç÷+Ì>.÷j!ï T¦…ñ>/’ $¢D9qó”h“Ù Zfç×ð8ãIM‘ cüô2zK4ùˆl 4”B92ø-·*H0> ™âdA§Ÿ!1z†P^Ô«™ÖÁÛ%­ &|­ñ#®Úk÷8Åk>Ͳ…`’½×ÛB8"â:üU4;dºï°;XîLmÇmÔù¸õz 0D‡ïÚä©s4ä™ðf„ý¾à¸d¡ïIp “†Ù ¿”=#t²kò’ˆZy#©ûº£ds‰Ù«\ÿ#Îd>…9I›céíu3~Òû(/™jÜ®ÃqmÔýKvE]gWÒêý¼Í®°kã<·#_Í!®“ #úºqpé6á¾' –kdÀo'£)˜G0L×׎ØìSCµf·¢ä@§æ":gY0 ¯æÃ7LuRj^·ó™³mOó”ÔŒˆÆîÕvÜ(è÷’ŒH Lfj‚À2äõÊÅNä÷:[» –êÎ’ÞH8§·­]’¡L?nt^7!ʳCF¥Ø7á¤Þ KJº °¯vS¤%R:ã{\vÌbƒA~3à,”óÑМõRϺi‰ð2,檟nIZ nŽQ[©«“Äùxô"Ý}íS£bÿ ˆ÷\t—ªê!ÕE‚ÕDó|ì÷6 ÎÖ ¸E èù•™ã ŸYi„"¡gôøš$¼ Æ 5÷̉¨¯×Ô?z0ºV{Ö%B퀱gO0‘‰½Žá©«Å×w$³NãdÂ/ /¦(¦_@Ыx‡›7S›ÔàEöð=¸] ÁRD\ëºÙ_Rg¨¦1¶ÝäEkˆ*ÝÔ‡ Þ·^ÉŽ6ÙiýoèV Ìc̉9!Q58$ƒiÏqžHj½ýBŸ×úèPº"Ç+I™¢·»‚ÁnÙ1_ã£ø¬jhç@ô'Yxz}_¾;Â3ÀùFèj0ø*ÄÌ·–k"Sˆ¶ˆÛÃÔf Ip BY&Ø¡ùn\ë¿h°‹È7î& \ "H*Îe˜ C¡VdPÝ lÜO}‚EPÞ¸¿’i†dM±Y1e8;c VÅ$Y_STÕƒ'–Þ¤·ÀuÜ_‘t<©0?ª.È»’J¡Å 'þ¦ERåxVc·ÄŸ`‚Ê%!‡­½qQ¦¨çcÙÚî¡KØËÄ#Kéì9~ü*{ú`tªÐ~úŠà—¸¡¥šö¦Ø<ÔQaNn4iÄäjEƒêLÔ$¢Ö-‰Ø)a”H‘•^W¡‚¾NCm«*œhøóÁ~s‘À ºÆ „eÙ®„ÏòfÌýf€Ç`8Éã,x3ƇӞª«>=ΈÆÛ%E»ôù—VÁ§hïIÆ ó$ïº5ÊôPd×dJ½Ût’z‰*•åñnÚ´ÖœÑB )¬š¨¢f“̸­Ê(CZÏïµY!A;€ÊrÒ1òBTHfJãÿr)$`h‘Ÿ.›“¨ nÊLþD|ÞËžfBQÑÖ–`,!† Î@úQ‘9³Ê˜”rj— JXçáýºÆ'©¾k‹âÊ¢a(WÂI$Ÿo0>3Ï5áhHž}')#ÚŠ úŸšÔJ[c“‹Ïôãæ%áϵZ€QU¼ÇðÄÇ&Y?Õ9T£|AmÁ£/•y5ÈóÅz2Ãÿª”ÚØ‰çÀO,É$ø ¦ƒ6ÑvFjÌTháŸ/ñR‰ô6½@ˆ¼’c/R¡JÀ:š±âÉ/r.aœÖMC”¾{.…‡«j&½C>…[ƒîe0ï¾ZÎb¨÷Ä0«³â:ìd9PÔLŠ’µ-_¯š¨<Ø¢F¦‹ïK¸8³¤zîg•jÜV“åm—Â?B›ÀAÏ’ÑÍ„S>GÕP4ø'àóïjcLùÄocc‰ÅÁü)2aq10Ø%„,*–XG‹ ¾DU0Íc…ûëZ¾öû!¦ç‘÷äplÉo“Ï»ô’…ª…ª\ceeéœ ´1èYßå”[°G‹7v&~‰9dv¬À¹Pkä‰~ó¦=F§ˆöÊ…PŒ`‘ÑtÓM–ÇXX’k§˜ö1¾wq Ü@¡!@5Ec0“×éï¶ Ð ¾2[5†ó8CýäïM2‚ »ÅÌV}d‰V)˜Øå(€y4®¿É4Vt Ód•t²ŽœÖCä¤Hh?3œ^2v/KN K¹4ñ”§p„BØèvÛ©¥¡”o¤˜âSRSJ`zYZnr–bâÕéÖAFÝ ßÓϰk@¢{)h\s´·‘Ô; úª6Ž@äkÞØá…4þùœ=Kí42)èÑɾÝÒîJ¤*ì‹ìyè¬O§Ü³ »Lª„¯Kè×k1Êì÷‚ì]híc†Ún‘F3ùþëÅ\`7¿’ AAúÀ@”nБ6©”•¾Í!*zI(¯S E¯ëiG#WFl¹ ".Zõ¡>¢jé“+0ž|WàÄÙ>jdi-\#‹à•U°ødvÄ(`‹C•ÔP¬ùƒdNs¨˜GJÖÍi³aU?fòKs#¤¡šSæì ¨2ÇŠ9ÅÇÈ2ÞÄ@ÊjÍJ©Êô©ŽürèBD¾H1Œ{øÛ ûõÀØyˆ8=ù4C]4öî)>;C].žùÕý=+´YS‰Å­>óSÕ?«é4ï‘5×wwYÒšÞ'íì$»Ne%a£¤ž¬ð³V|Fê?þV´Æg”P[K°Ýß5Š ©vÈÀžªé(²JN±!ï«í¬›ßRb8˜ŸI‘_Ý—æfc°H²æx­‰õ¾«új=c ªžåYžŒ«ji=Fql\[¼n Sv½Py >xt½ÜŠÄ=—xVDs£?gâ’ƒÇ[§˜Ë²’¥(91ñ4Å~¨ª†,?zûe"–ñmÕqуHŸ}(¿R»›æ(¼«ß¶‡XÍšj†%ëúþÛö~3v¤œ=Q%ê­?ï[/fߢGà9ÇFD1-Ê&JhFªŠ.±|žŒ—™‘då…º›0(Ó`‹rä\oYb(4–—fWŠÅÈ­š&6µ(”^Vï–öÞtV!ùz2¬ÆOY‰MÚe®ÇXDªA¡y¡Âü˜×^Š5´©†£©))׿LC³ŠéÎC¸S'AÞ.‹DŠö,à÷BÐnkJ»è°ˆz]±5—Î"íþ;tœÎï·ñü®K©¢bÁ "žjžÉYáÿ4?S­¦Aƒ§øÁ€â‘¶D}• šW‘½ª7ÈŽ+5hÚ œ§6nÔñP´Eâ´Ó ÅdbóŒ¸w«Iué¾ú¾W ËZV“F*œt—4Ê%÷$qµ`¦Â±ÅohU´Èçrq`t)ÂJù‰”‚ºæº6:ïhõtNóíZù2´²@ð€'fV…Ætnþæ9¬Zsøe'u%!)Ü3Ъ±#q>îsEÆÉ& tXµ÷ÏD ¸5½’üf‚}ÖlK¡‚Ø©” ë’þl%Öòt²×çµ;‘ëú?ÎuÅ;Åæ0ßú|@a[·eVø¤8uO4ÄI¢QD«DÙ:~¶dkRœ¼9ÿÙõyŸ¯+ ÅpõáQýÓ qĽ1|þ´6þX1óu¡U¿•ø£ÚðC}ö¬5|9DH5>òšú ¥Ýo¢w k¤ð=zÌ&œ€Œhp'F@’ÃÌ'Åo¢b˜ÕT¾¸¢“¡÷ë:h#OPMOUhÓ‹ ”NMxYLí|N»Иg¼ ›S‘V¢)WŠ$í™K”!,DRØÞ­©'î”Þ"‹rPSòÅ£ê}e:j V¤Š£ä0ïž§Ç‹óÕg§#·LnV3¼²œrü´9çß:ò‰勪þš#aÏЩqÔr›:p¡EnêÃËöð-}X¿)êïº>»mŸ4 Ö´Ú[©aS[MOþ(MâMUÏHß‚}& ø®5lüymøÔðmp[c‚'Û*€HÔx©ÊriîÚù›¦wÈéíÿ4«•ùã}çy¦Ú -Ð4ÆÝÉÈsN/‡Í£›µö–¹lùÜ¥;3HÀÕ szlURŽ5ÞKySŽôÿºæ ]+nËŸ* ÿgu UBßM×4œFÀÛ³*ú/¥9ÞA…bÒüPÔ!N“CHr —Œ²ÿ-yýýa౯ŵc7ž- ËÏPªæGêîòž”Èéwñ’žåÇäÀ9’)¨X†¹uÜ)žDW†²ô–· îw:‰ä8f}•èËõÕ;\?ŠSâ•Ñœiz—€$ùøwT|¡^eÐâösÜʶh©<ÚÐHÁ/“ +M>±¾ªâÓ„°½µ\ ¨–‘çRœOpéŽOûs¼ñ8T½ ƒð´h½xM*K–„î= mætwÜŠ(–›Ø-0ßþ¸~wV¹»a=M¾˜Ð2N]®¹Ð÷Ýv$æèn™_1µå¶Šþ0O*Ôñ¤È•ìÒÙ„ñÛ¨â~Ï¥$©Ë” u¼<eWŸQpÄr#þÕ_DzQ}‚Â)_½e”é¸!?tE¨/¤xáM¾´i½ÐCºsoõn<×ɬ]]ÂÉÂ?I§Ù¡r ï.ùŠxf$—tÆŽ®ø#ìÙrù«Y’r‰ìº±xýÙþ¡ûÕËuHä¦)0ËNO ”Í“NLϤɻvwH¹Z ¯'ŠIÙ‘¥ÂJ#…áܘ"éœ%™­¥”¶âÜ!¯‹ÚÍ^䬷‚[™/ H$â.Ù©[,‰KŃny’4ûÞE`ݱ¢…¯‘¤¨Åìëù­þÎQ¹¸—ÅÜssîa?6w¯Óý¤GW ÙbåšÁ?Ûâ‹,ý‡Úu‹ ]Ó˜ëúæPŸ¶s2#y?Ô§g×·ù‘Õ·9s—ú¶r^àŒ ®)÷T¶™'ùLwa›¹;[(—ðË`@:šÒÔäÚá©«|T" €’5§·ÜEU.€aíÊÇk÷YØŽu@ f%Twç¼Àt1sµØ‰ää:ÐŽæt·Š «Œ©fŠ—ñV©#òI:­“Û¡xðÆ è4e{÷3UøŽÝ'¾q`ä>3ýé…|ò½n‘¢ŸÙ¾”ù”ø´kJybÚ•r±ò9W\Æ}2;¨ð”oTó:¤D Ž¢ºîN)ÄjÕw®© šL.måÜäò1éb»„:‹«hyðpë$ÄFí»cG;ÐËXW$å[º(ëži•¯uêÇÂ*—ËŠw»8ST a[9‚ˆ®Æ¨éýÝãÿÿû_V¯­„endstream endobj 448 0 obj 5727 endobj 452 0 obj <> stream xœí\YsÇ‘~ç:ÂO挗Óê:ºÅj#lS²ìÚaY I @A ƒ’’¨_ï̺2«;{f [öÚ±dp8¨®®#+/Â7'ã NFü[þ?õà½OüÉåëãÉoáßåƒo¨Ôá¤üwþêä×§ÐÉ(hâÕÉéWòÛêÄëì ôÉ髟oÂvÚ [=xïÍF¥v>ÄAaó‡­ŽƒwÚm>Ýê͇Û¬¼Þ|²Uc„!lzð;|BŒïó—­…AÃh¿<ý=,æc‹Ã`=§e 0ué¨FÞsgík8ÙøOÅ˜ßøyímC·GøŠ}ʸ·;³y…ïðã+øÆQ©ÍKüñ ?^àÇPŸæoðãuëü9þ¨ðã}ü˜Úº¶å~ð£b ÁmmwÖMЬSÏüü}z>µFEZêI_¶oÛc‰´Êû!ØJj2nÐfsD¾…1Â`'8Ñp<Öjc7×оZ8>ÜtpÃdíæ ¾F5&R¨aš€Ø[çíÛ›­Ó÷©Wøç‚a­Ò0YþÉ<üÙ _ÓÔxQ¥©Û0le·ù«öjó6õ*¤“ 1”—âdñÀõàœw¸‰is¹MƒÛQÈ–wðu0Æ+—ž^ӸؑF¹¦Y.óÒÆÑá.`K6˜6v!íïUÞŸs¡ìocÝ’)7*<²]9£2ÃäF …‘ö¦ƒTÎió@S>jìi¨ýïGà°$RÀ?SßWÃN¬Q• øZ£÷÷ÛÝ8h­÷e½Jk” ´›îd´‹(é›Ïð±êNP÷¢t2qól«cmDÑÈ£Å=ÝEŽ»ª“ïgÂ׸Çtå<þíÖ¤—k+h£Fõ ý‹²‡˜ýf¹f$(0ù‚q1xô:réDÒz½$-2pÍæ9‰ëM;ÇÂW•üÄb 0Ê7¾ã ÍöHï°ÍúÔ#ƒ‰™ô´YO&šWm`ZöBºŠØ%™(”I21Å Ä©b ¼bBÒLð¥¹9ÝA“uC…ù=>¢/=½×í~2²b1Ö'Å"-UÔt­#j[“U1ØY¯ˆ«‘–­dµ|;mÿEòCüø´}{‚§øñ”›°j×>oçÔxÓaf;R>û¤5žQOäz|€®ªÒõêz×ßPã›Öúµþ²5Ò70À83†ióß4Ó3Þsù:ƒ_l¥í?¬’×`‚]`ܪ)1ô¹¤»^t¬CÂÆå³²ÙY/ãÈãÐË8,´†Ô7MYê|/MÈä¤ Yg˜_fBß‘¦ÌÚ Ó ·?#!bÆVe’º/Ì€¥·nÝBFvóÅ5£þ‡CÖ*qF}¯“è<(Û©ŠÒ|Zk0|«ut"‚Õ`¦¶`Ø$Z YGTUðWfL«tŠ+J&óBꣴïu¢cs\pú*í7Y/Á»^[¡–P bR×›|*£B[2–Èñ3^9JÒuÈfŸG«*ìbºjíýDüÇ­îymlO’D56‚+4j³"¦>ÜT¶¶¸ùÙ­,{~žAOl%ùÔuGÃ&>[ÁŸI*-zór i¤ëù!"g~‡Ïa} `ç­ñfËhþ–^cl|ÇE°Î…ÀN.aÇ5Ѳ`ö¦©yŠÆ0ø±Æ'­ñ4‘ÏǨÐL¤9 Çhü(‰»Ö|—Ô0?¤¬{η¥—À€èÀy”ø‡õá'¸”G?fåŤæ!.=€¨ÂiCŒ67dÔÑTR ~»3klIxü IeàjrP®ÊñÉkœ6=‡õJXôŠû¢Êvó‹h±wp7£2Gx>e½^—¾B^Ôžéäa2uȅݹ!ÔCmJRÀ€EC»‘ër¶Ùò5x»`¨„ïÜÚi³õà!c“f®˜°SÅV7g»@Úâa: !“MF˜cï:Wu¼Þïx›ìóKÌØë¢4C´\E,¦J.Pˆ,öóŽçîã <«fjT”æüÈþÌPß’¡4¨ÚCýGjü¸5þŠ`ôÿx¤‘ö"RåAa;ŽHÁüa„ðhDÚ«mæ£ A€äýNǬ´w“öÁ‘~J”NƒR\ù”Ö°ÀG[tï|‰vF`þb½’ñZ×m*Né`ŽÆëŠ÷a ýŒ1öŠ^ Ž5^,ÕlÅQ‹ž÷ÚÀAC D¥ƒíQE¯f«#¬yÐ ñžÈ8.@^R¶ë oQ矑ª§˜¼>,S¯)uZðåe°kuƒR+ °¢TšG m ´ö`¡ñB¥LqÀE’¡çõè§ÓcÜV͇ëuÚrs¥³M~ /-§¸ˆiÇ='´ „Ϫ¹©#žf8xfŒ³­ÐFÓá¶ãùkC— sS‡ž¹³ŸYÀEËfÅ©¸¯\36ŸZrØ´GÕåèºØlR“nÚÆìµ™+‰ó®½Xªêõ' ãóƒj${SUýp#¸¿ÅLî¨×qÍŒÏy4¥;º×…Á Á›Ð ”ð§Äs>uVa~Íßãžaå`RÜ7dRÐÞä­w¦ä°\_—m÷ˆ¥8M6zÎÍ5-g‘;Y=Ê6xSþÓâîÏ©ñek¼&‡A‘?jÏÄ÷ÔJ™oz‰ÆÇÖh©1ðwj£å9*®áœæ9p`s­¦¿Ã_±cõW@|Æc]ŒcâÞ&íb€6MŽü-I+k5>›ÏƒïÎñÌ–²NYo¿.Ãò™°+ᛕ™ÎQÁ¥ZŸw¸ZGÇßÎre 9Î#™Ë8Žú–ÃÿåIUmt³ÏeÂCè–5Hx&)Uä°-×ëkÕ¨\Œ–œDézM…»B13yê¹¹›Ó'it`%oŠé™?5e&û˜}mÎæO–¦îH!3ù4È3êÔsÌo¹hV2äàÄKÀfA A”1¦ïH#,Nÿ˜,Aå°¹“MìÄôðu Â#oÇÞažù°ã%Ò4U<Ž,¡5Ywˆ¹ÚNü@k 4ÑÄ”TÚ+j®9w: O±—RÜÑO ¼snõ w횬!±¨:€ÚÜ4¸ëç\d©æš^,¨fFøgá_ȶYà÷Â2«,ér^û%+Ý—úPÍR:4LÞKœ÷Cë(-¢i€ Д $2q" 0¶Ü(«§áiJ–%Íœh{W³*“}…FµÏ?§Ð(QK.#7¥@¨n¹çéU=˜rB$…ey9>ø§1%¸Ì­ÚQ¥A¶?QLšóSžTº$<½ÓÍ2Lr0ïCþ½…G³BïŠ`°ž…Pr%ñzU`ŽáåZ<”À ù v!VÔ«]Rñž‘ž ›(˜³A«¡@PhU­ÂE9í…›lhrÅ3;9ÇS„k® ãêNò¶Ãy}%BU¯…ëfeVï¶bf¥yñ† @vŸôÐÅ ~‚À[I Ý'CПžb*äèÍvÊË6˜ùY8rÅq’ô^QWZ¨ØX¥{ͪº/‚0È 9ôL`m‹(lØæ2f'ÖˆÔízà r-T. IuÂåq[7¯ûzŸ‚¦‘»ÞïôÉ,L›Ö£9 ;hTö-ùª@n[ ä¿×>(n‚::¹êX^X:¿k•ËFaV†8ðpHm¯Çšè‹‡,“Ì1n?A–ùѧŽwåc÷Eìƒô"£Ù×ÝÔúÒ_Râ\I¤TÔu—G¥nfË‚XKòÝRã×­ñLâNbª»®È5U©F‹‰~ŠÅ%Êhœ¤%´ò_´ç¿ —Ö(ƒ_mÊ(òE±¥°¯™Øfó?ÔÚ–ÕÝ~±œç’qnð-†7®òHé׫ÙÄ#ˆjsÜôšx$…5“3•à&«äMQL\I‡•¯÷`Ä1é Óì²'ðe¯®Ø}¨z f-‰È‘¡UqßkÁñÁ£RpZþ7¤rÑÜc+`@ë)!Ö“1"vâq&ŸH HWͽEû`©É>íÒ«W‚Õ6Éa+fˆûÀí²l«/ž¯Ü=EP6)™i†…?f†ÍGêûJ z0¼Sy– º÷Þãà¦Õê9iêzKËaˆHrq$õ.RKÚ[¶—7Ö+b!Y‚Ž:ñð;\_JÎÐqøjøIú{¾×.EòY¶®¼ŠiÒØ¡ð›– ”nU®ðº¿°ëd!VY¥Ü%kå/?6”Å HM4©L㧈ja—Gõ—rÓQŽ×ˆd,™ƒ½ØVyšzˆw}Ö¯ Jh÷ ¯—Ì–’ |4÷®ôÃS³¼ ¶¯< i”oÚioIÚ3¥Ç<ÖžÙY, CYLUµaÐèä{EŒƒm9‡TƒÔ?½X"oj¢™»Â©Z˜¹éËulJJWAa%G¬\§ (®6Ös%÷ªt:¦4«{" v-‡U‡ëMÌ]©H6ªŽ0ªÑú¸M¯—@ ÷K[Ç ÉwhJ]*ÍÊ,]$µ†|S‘åFˆM¶ÆûË{6¸õ^¯3Æœ*câ-[0~{‚"( -²§fª¤Bĸ+ˆš— í‹Å k2å;Zǰ´ëŒ`Ê©îËü±ø»ËŠk=ÀüŒ:Ý7¡’†0}¥Ê ý=ö¤±)ÔšñŠgxå~µIÆú¤ÌKž!4z#›0 +%¹Ê$Âêa°ü@7vZHA¹ÃJÇL–ÞÎrS&ö ª%­"ßͳ-z|–åÆã¬]”>õ¥º‘b SþjË´w»Xº‚/–)o%ÜZÈ üÁøå^Ëí¥Pt¤(õ1ydáúŒÄ|]M*CÏèÈI#†mp…·œÅ³âvCÔLs/=g+öu¦o»š õÚÖ3r|ð ‹N’v%.î@ˆT‡= Oʇ³Ôø]†]¡G¯ÎïUw±'7À”³túx¬˜½P+ÁK1âx({³ÌTýVňJ•Xªø8¿­”= ¨÷¿¹ÍàŠ,‘ó cH|#^ MÄ*·^Ø °2œYþ@¸Ñ“Á: ËÐzµçˆû½]±’AÇwº‹4éR,Ä™ªx—yžz Å,æüvž¨ 6ÿö‰h[ÉÙ)-ß#£çµœÑýCÂ'Ú‡”³<"r~Y¶9Îw“õœ×»[ǹ“s3gî(Ï ý—ùEyÁ¶bèdžtK¿ó-WLW.„óí/+ÂTÿµá-¥[¶xµ¯×Úå®ížû¼ØNbiéN »:,]£a£JÒr!eÜgÕÛ~œ-¨¸™™:bºÈ j&À½“)e‰G$Ú¬f_gùñšwÔ“˜)]»P%fI…ûäÝÈE¢²ì[¼œÎÖ·¨èDõÚ8®6€d̪ÿæõ…÷Pý,ýÚ!ûö ÞÜ)—nœÓÑI§Ðôþ=KBh_’mWV°Kü•ÿÒ’'/º¹Ï¹–»ö„'«X€=eˆl å*gKš\·¿£|•4ל]î·ß§…+oñõT¬Éª½éåúÞ‹~U)ÙwÛ¦ž% ½å)–œ Lý>Z¬‹2†ÿ’WÒ̬dúÍ6™noÙã‰ºŽ®4xÍ¿=ákfË(/Ú8T]®ø‚ü©ö ÔÖOû¦§Üu›avо¸Âåm£ÒÁ§w¾oT|½=Ì+D –:z)QíLêù®&™¼üüN¢[})Ú>Ÿ–·qpúËîôëHtïö1=ÿsk¤ßê6gm²ÿ¬}ÓXû­Ä±œO+Kr6å·*oSôczþ¸5þ¹ tÅVÑ:ž 3R2û%ÏRÖ ‰«Ålìï„•3 ]²í,2ÜO¥½ž·™WÖ’ª×mêyžsŒéªîÿU1~#Qê9ÓsÈ ‰ý‘ùO™ó6N÷[¼jÇØà ‘¹’ˆB–ïneæ*2w|êúü»nîÚõ%'K}¾˜4;õËz>éó6£«zJ]oy-;ÙÐ)óáéƒ?Áß¿{Øendstream endobj 453 0 obj 4907 endobj 457 0 obj <> stream xœí\YsÜÆÎ3Ë?bß¼HiAÌ`.ø)–,YJÙŽ,3§â”‹â©ˆäÊÜ¥hÿûtÏÙ4v)K®ÊCÊeÌÑÓýõ5˜æ/‹®‹ÿ‹?O®_ÙÅÅæ [| ÿ_ür |‡Eüqr½x|„„–vè±8:?£ÅÂÊ…qª…—G×ÿZºF/e£ÿ}ôWÑ :Bvª ::…ŽOšUßZ; bù¼í085,¿läòe³­RÚÊåQéó4´öÊ-_AkÓúµZh—rheÕåÇ<ãt œø;Xç«FµÎie苯 »Ô­èÜòYƒ­±ËøÞ }/–ß4+‰ý{%[XÉO„D ÑÖú—=N'–?4+ V¸å?Ùv*qÄQ“ÂY?öÇFvÕ ^E~­`¯V C`[Ø]¿¼ Ó«A/Ïš•R¦Õ¶_~ZµË+XÔZ§$¼WH‘”ËmÓ›ÖY¡–¿5«®•R úÌê`C¢']Á¤ƒ„.ýò14®´YÏ7È­U¤wa׿,r•J¯›@éÂL×ÀNà›5ª^W àOo—kèsW¶ ăÈlß“€Ùi$ˆ†_„nͰü{nËd®a×vBõË“< Î_Ö}Súê´¤ŒÐ|\¿92´ifF¢³”`ì~Ñ z~çDR²“¨ Sc¡pLÝ U"OYªNÛé„o'‹G¹«ÞÐ !`ÏÒˆ›FÚV'ã:º"Œ„ÇÄe!ÈêçÐhp¼GVšòZEÒÙÉL£´dÅGindÔ*qj%zèØÉÀ°ë4¥Ö$È $¬Âú[ÔmÓvð|ö­¥AÕA×z1è"à÷MïŸDÞ^[”eî†M=,Ö»H­'šà}l¸¹€ =-ÊPÖ ïá8ö§+}È;* ¨ÍBØ› pA"2äwim™² nDé<äIëºNËå}±¼Ÿb•¨W(é4q$§¸IÙW\¢JmD’Á“ªR©È.GqIt$C4ëSÁügŒîÄopîi¤üž[V£5îu°Vçø^)×K"+\⊨7à ¬Tk!d Á€) óÚ Þ"šûÞÆëPd¢W!=¸ÀKPÓ©Ðbx@ñ=8_øC.½ÂéÝÐ٠̨QÇ,èqNÆ?×’8Ò@²ÎñWá7Æ*b½Cs`fÔ¬6Ÿñ½ÆC¬Ó`Â4ã‹NS„Ž­ƒZ`¼„ÙgÜîíÓ)&, Ëg÷lÌØÕ®‚¹W" H—I‰ò"Ÿí`VÚ2 'AÑ€EFø® 'ƒÊL‘6à+iä >Ì Ð’.'…"8§ZzбY—à—0¼ã]wöE‘9D™_£µ•Akó;/¿EúVá¯çõ0È¡veOJ”7 C;°æ$ $F-tp<þ ;`pg2'A:Ѳ¨ÁÖ`#·+ïUØxš=_µŒÃÑÌj$›Zé?ÂAôT=ìééƒ ŽÊÛ L,—\ ™ä¦ööS®"£”„Ú9îy…€“Ã?Þ„‡ón+˜àó'wp-Ð_¹,žH†T&îm¥ú¶³ƒ [t˜Yå ´ Žºðtæâà #1°Mï¯üÚ‚3|‚”ˇçàˆ ZL  ›Ò­ƒA±£1\’0‹£oŽþ¼+µê¤÷+>wpÊÙÜ)ôU*¹,Õ ˆH âõBo;ãh‹R±Î—„*Ÿª:穚sFÉ'R§ æH cúÁÁ¨!gB¢¥ ú}ÉLq‚†rhOK²¾l”enܲ@húAÙ]Ⱦ†Œiö… œì}õÓ2û§¬÷>Ø)¿ab”9þ@Å)ÚDìÖ[Ü@°7)rm—ŽÅü]–xã™·œb€øñ§'S­è$µe8c¤JB3N®#jtYRªI6â8ÉõB‡IqráDµ0éá¡Ð!”  N6s‡F á.``î-,«_ï‰RÊ>`¸Vèp²Ü(UÇ<òPé*TöÎx;NôgeDÐA„€æ{ä2 jÇ =á|'9` Ç^ÓÁ¹Þ@×ÓÔq¸? =½M0[*š~y‰ Æ[¦ÇÃF'”z®HTG¼HQ-Q5ÔùP®4^RÝïaRâ£J€HTueÔÚ¤ W¿+Š@”ˆ;¬ˆqª„޲Ì8°‹lªÕˆä7w•¯NÊE¼É(áÀO’èœ:½ÿ`oŽ(q¹Qr–û_©õ• ü)Xú &’üƒØV½×7/Œ¶CùþzÿdÀö.W°Ó> l:ø }´‡a˜Ñ”v ÑW¹ 9Ý9ãšÐx\¯p&¿x9}A§O…îmi|“O >/òcºSvû¿åÆëª'>¢÷º«6æ<Ò¦Ö£òø2ÂÖÔzË΃ӑ°Z!˜AW¥µ­ ¹Í§@ÙH½ˆHò\Ús…ÎQ¤².¬Ýp(~—ßqü¼åĵñÖÂôç £”eÎ/Jã!E{j¼£sNÁuËÉõ˜“kmÔ&:æPZ–¼ß³u¢ii2SUø\W“ ¤®5õéñºAÈ…ð™pi„œ©Í3ÕàÈF©F‚§Zò»ô÷ å{|º(:Rä{¼g¢{ŠÃ©T‹±^qè¹åIJå„~²û5&ð s€Mœ+Û¨-™t$jFgM?:µ½Ì–?›ÿ‡¹àÿ›ÿÚü?Ïï‰u>Ê/Ë`§9ý}ˆyF9¡ .;A©G¡CZ"IŸ†Gw_„¾fI«ì«Pã]m §ü%˦V&†Èlj“§"³RYÀ.Èú?œ—)sn‹¬¯8T¼­ðø@TœW\kµ¨®ªß¿g5ü¶{ì› ïËhs£õýµV7ŒnåCà:qάÿ{¿Gú›¸¦³DyoYf}²0 ¶¯Ñ7°€­ü òS@„ÆØ ´u;yŒ_5RëÏÕ®F¢Ä¾Dý~­ÂÅ‘gõöÕ ¹ß“MLíI­€×œ,o¨ xõÊO÷|¢o#?z]ÙtVçCòdÚœ;m*úG!y8†¤JFÁƒß;7ŠÅva‡øÍôøˆ³¬7!Ó¼fÍÉþ~7t¶#–9±_ÏwjÂïèô‰—=ë¢Éæ¡b¿aß+Üuµ—i_/çA´¿Yí0S­,¦Â‡t}8’ ¡º?ôÚ”ó®Ó —7ÉHe\Ĺ)cçœà‹`/84Ô æMê „[É·_Îté=r]s¬ÎX¯’Ï»è'§‰Â6sl}i:ªˆ/Ê:à€•³žÝÞ…ùÅαù(ðÆ›ÅÖÚ™ Û 4C5L/ò^=CÎkîå“ÂY_vœêHݯÒã˜rPu‚™¬Ðq¡á„cNÁÕœAšê–£ŽMo©`pÊÁ1kb‰'‹S§ž¤ªr¿=#º|\™Ö-¹Ã“íÉHf³’p¬¤ëZ3veï²YZ׺4›Ð–Åp±‚}²X³ $x_ï֨ל¬7áƒ%pÍÍ÷–ÃÁ¶Â?*ÈM÷P ÐjPËÀÌ@’“‡EºéÐ(†"Ø‘t÷ÝÕÖ“ø±}‰ô“üþiyÿ*7~W¸z»[”$Íøy^iÜZV¦äüóá¡ÖÎÔ4Ä|ÔƸæ¾âÞ((ŽF$f'3‰óϧ|ü§,žÊ4ê³YËÏ_n¸•Ê }ÇëEÙ[`$P}º_渭Ð:ÍøRˆZ¬³?Í™}±NÑÀ¯'ÛŠx·¹@rg|ŸÕ:ö<‰=œÙpÙT®‚ÀðÁ1þôH•¤X£Ã›»©Óœ¾ã"‰ÏçÌçã‹›CÇÉ{rqn —سœÒÈ~Ö(GI< ‹Ï0.ιäÜá‡À˜àŒ…$š±ºY&’H=ú¾‡'ˆuœ1Ñ,–‘D >^)ÅÛ ÖóJ1Ë~VAlbÃ}¦˜ÒGú¹†0ú]µ2IG'ÜÏÊ'x+pV15²jŸµÞã/8VÖg#Éœ•å­Ø6u³›b™¦ß¦çh®op¤íZ}Īè‰Íñd†QìFB¾é©ï(x*¯¯~LÓ)>™ó$N*¬¦+Ýrø)²bcßÍø£Û,`J„‚Ñù—Qsx4qÛb*vžäLÜíx­?T7Qšù '^”¸‰á4=Jêt·¤Þp<áÎFj›?© ;N®h‘”³´\ÍÚúng¸ô¨ÔÌ]Û¨#×'ëk¹é$¹'¸Ž%ràNs½{Ÿ×-÷3wßç'—ó5Ôtoor¿¸¢ä»Œé®·¡÷úòþ:r=t£pÎ/RÞ< w•+SHq-2€<ÆË‚x±qßítËÖ8Š÷5ýæLa¿YYM0*º}ݰw*ÃÈ@ª$(ïG;©nk–B›”ï×~žÇ&iŒº¼ÌâU^r1“  %Å=åRæ¤6]ð,õù¶sdNígÉMV” jŸ/ò‰ûN¦Ú=ÀwªïèÇu¥¾ÖÂŒ‹n³äËι»Xr£IÕ1©6%®ëšìTn*Ýè¢;{Ó˜4¶q™\Á!Úô××IÀV½= w ]Óµý0X…·‡HÆe’ãFk–—s€10½ïÕE‚AɺNjâªZ¡;f4ÈXúg†V:t«dÚYôc±LEÒñw@³±Z ¢[¼üý¼¬t„Ê«¥´ÎTÏøyÝèÖvèâ >^‘=– ¯±”L·…иӧ*;€˜€<‰5·½ $ÇÁÆv…¨Á_°Ä¼Î£9.Á¨ºN$>‰èèýਠZ¹XI5HñQ6Á©ÂÑçMú þ¢3©oÁí+_q1ÁĨÊ$Þm£åX}5-eê`z_ü8Ò¬ÓºûŽ%¬ºÝ}õ±l='_5.ŒA3qá ™¯ËTÖ×’ Â•ø¶°q˜«uªÁEÊŸ •²ßà¨ÐìÏõõà«K©3j».U)™5.¹"dí¨þ#ê?V…—Ò‰Ê`<*W%žRÒÕ+ ¹ìV‡RþÙË÷‘csu–¥bH(õŽtrY>îsò1uú‡&ˆÌÓÓ/iÕ cs/‹QŸ-_ôUw辦(å©Ô¼âVž|ðË0ãÿB  –Ô8ßŠÓøãäúàñ‹ƒÃß.¶·wg‡ÿXˆƒÃçøÏã—OàÇ‹¯:xúbñýþ-aE«p•¶ó÷Ä®Ã)þ¸¨ÖQ*½˜Ø¬IÌ -Õ¹¸ù÷D€™¡Uig¥|l g³ÙKAäý¾ÑXÆ.ݸ!/‚í¯w†YXŠÚƒAÞ³âëJaTÂséM¡8ú"ïv-ÕE¬¬ õA·ìzr䓼mS&¦;?)Ç›½½ùs>Š©ï…’·§ÁÓ“5’ïT?©±Ü˜.ŸuÙ "®‘äöå”%§&4Ë/9ÎùÌrê7=ØFܲ–_‡ž7§ûÌeã}é(r£ÌMª¼ð_)„h endstream endobj 458 0 obj 4412 endobj 462 0 obj <> stream xœµ\[“·q~§]ñ_ØÊKÎIéŒw N|KqÄõC*ÊÃj×¢\"¹¤%Êá¿O7®Ý`Î,—‘J¥³sÁ`}ùúëÆ¼¿Yq³â¿ùÿ÷o^üò+wóê‡ëÍoá¿W/Þ¿ñ‚›ü¿û77¿º…‹”€#KXƒ¸¹ýöEº[Ü8yc½^„¼¹}óâ¿OþlNËY.Î9u’ñ‹óa‘«?ýæ¬à¸5æôûóE,Þ‡`NÄŸ!xN¿ÆŸZ'O·ç \ë¥Ð§ÿ:ËÓŸÒmÉ5ÿsû˜<—L Ž/«‡yÝ>乨³Á /ùÌE­‹!¤ þžž"Vuúk™óëö㢅Y¤:ÝŸ5Òº”ý®Ôë**½³Z|]¸)H8¢,xïAœzñUû›óE:‡’ôþ0gëL´ Ì‚ÆHÆü.ž¶Uí¢Ü F"ax¹¬!€TÒ•:ظôÜ…t"íéoðvx¼P°Vù‘¯ã[cÉ?ž¥Yê×G8f.È»‚-ùECÀ0ðFîUóñ5/ =úö¶Íá¶_Í3“(P~Vœ„ç2v0À†çß'p'g|hjÞ.ÈþtUÄê âü^o@ûdzwI¿À§ûDwáLè¨J”¾u± ‚ššZÞóì徑 ¾J¾z2%6ø” Þ54‚+Ãâ$Þ uþuTt šìlÑô:·ÉÁÓr¶×ÙŠ¢‹?Æö‹k¼$,Y?tÉÄÀc*ÈEÈ+Àt\­FYÎ<% dU ¿£Ð?Ÿ÷Pv–$Ù,Mëõ_ˆªÿƈϩÿÆW.¯,’‹>ç5G.OuË„ï%ÍšÐh©ú£Ÿ!}1ØSÔeúYuÁƒ,3ŽÒô’y|eRþûp%"Ü÷@ «¯½¤Z;´ˆZ K4Ž^ÙŒ¬+6„as8Em˜æG¼ø" Œ¦6´Á.Ò(ïÇi£5sÿijrßQ¨-CP–7æPIí%B4H‚º²ŸaÞ¦$,lÜY>@ rTi˜W h\kWµ|ƒdYÎÑ'u"ð¶8Q¢m¡ŒãŒ¡nŸŸŠxOt™+Àh ã¸Ñž±Æšî˜ŠšcŽ91$ëè1žÅqÑU'NVÙ«ÃmÐNZH韃fŠÌ—2×L@&–ÌsSô*n£Îu _·±"ùÑä+¥Þê"ªòÐåmt=®Ñãþ}3Kæ$ï‘àÒJdzJÛ¸ÊõlqdŽi`±›†²ñM¿`n\Jëc¾õM½í#*#ú&ÒÎn@ñúxb[SÔèf –bs'|9Ìb‰˜ºXS$`ŠXŒEÚ)zÓ‰“w!á~à.fÉ8y@ƒ§„Û.p±Rëêã_åœôenà4@jvŽ´‹ËCì‡h4àŸz(=.Ó·(}œ–»:æ„‘Å2åñ6 Q0äR"I(bvÍ ¦¢þ¾J³,,1zXÈwÑÃÞ÷^¿Aà/¦t6=·e…É;;;ÿž0ÅÅ€toVÅ|`˜ÏüF§ÚÆÅI¢j›߉>r¯ön×éS…\%zr>Ö;2ù!K$P¯¬!”à HsÂisT‰ªØ"ƒÜõæ^ÀEÆu¨ë;é(®¾ÈR“ J#vÝèæ·íü”"ª 4P<¬¶© "?:7˜–‹‚¾†ˆJÙyãb/½Þ³<–-Ç>ǹƒgTð‹ušéøÖØÇüTŇ4àÂ9ܘõÁ+Io¤óÌe («š<6 3|ÛN°ÈnÈ«l±-è!þOPi‡C"ÀÛ;½‹+rð©ÕlÑË3Íð½ =&âä_Ì‚¬ÐVi;DÒeáX*˜põƒR#ÏOß6 ôlÖ' ʳèV¡XÊ6$äFÆnÉ~â6|3 ÇøR—÷üC‹ñèËæ`Èè$V¥aÓ è5ù•áu¡¥Ö9AĹy­lå1ej †E½÷„nø00£áM„Pjÿ]ÍòIFš©ØÉy²ÁŒ«¿´G-²5’9ø»ØjçaÕû”G1&øC3†M;ÌJ)æŽg°1hfqKâI~:|‡&êløðø7WÙ°$.n1ÄÈ-°ÁY?rcAåS©ÝòëiÜH —‚Ë`’?‘bõh•›]‘‚Ká–eÊZ.:$eZ¿>Ÿc•^¬¶CõÆá´pa¥éjo2áy#>1~åÂÞ~ÂõEˆ°“”hB“çêbV^#+?†˜£åû,“ù± °ëÃÒ®5}ÓìÐI=hfN÷<—¢$Ýde±³0Ff@„[ü¹ÂÖ7¹iºáIQR!”$ ¬Ãd£lÍ &‡²è®„Ö8SuóZWa¬­KJ54mI DÔ^­ Ó¹aãä¸gj¯冎aÿu`,»x't1Âh÷¤hZ×,\íaþ‰„ŠªÚ³ µ’kÍU¥™8­bnQnb\>ßÙt"¹•T‘ŠF©§u;åZo™•r“uÒÞüQQ·˜8Uq> MM›¬5²m«1Ú¬çg‚êšeâ캭³Ð•ö$ÌZE·0!lcÿ«n#÷ B#!¨RË2Ÿ`Nà îÅ­"æéBo< UÛNؼ!+ƒ!k5á³ÕnR½¦ýõ{TsîÖížm?ĵÀ™,¤B7#æYê£)à•Æÿ:#Þˆ›¥ú©, (D3¥]EîïR¸Âüg÷Âgc@¡p[xlY¡ ¼­D°´sjØeUÛ‚<%‡ôAe€DO1êðÍ>†üÁ¬Ã@NÒ”ÄGÀ£Ý‰å9J›Øûþ$¨”ªjÃâÿ0ðª®ë½}MS& Ð=ø®)°UñŽBP“x5œY·Ïò)+=`1š€‹¤@ì'€+»êp™fIWß´sîAaÇËÁÐkqÕšÿûw¼ßÆF&ûúèmãù–(ÙŒV Ë[Æ9Ä#| ½‚°2âà@·T׬M7c²/ªã>½§4Ò s|e"BíBái…íë‡zQµH?}D«Zíµ‹Ån·“ gòw¢ÙÉà]×J#¿Ì(ÂÌpjG(ç!«Ôû ú©Î¬ÿó¶Ü-»—Ô ýH¥?¬O¶¬–¢mÛL6Ž$¥Y†¹6=-h$]¯&¡µ.÷¬׎NcdjVŽÞOS*'OE3Ñ2Áãªÿ•JíòØçÌîjag\eÁP¡šö‰ÝÅþ³Ar³)F^m¾FöºdõªòaW’Ÿ¹’BÿVe>´Å"q ‚W‰g£QÞôàª<Çô¬tVåëyD Oëóup¼½š1õ[å÷šaÒò5ìXÙf+r\³¾'(kSý$²ê65ÿ !~ù•+Û‚nqQ Lò(p ñÅ‘¼E¿½âÅ무„´¼ÇqÖÉ0 ;ØpãÌnØIb‚GÈvÆÕOê=H9³´?gIlªX§l«|v·nG;Fž7÷M·ŠO9~œ @ÚQ“+…U‰#’Îõhó!·A6Új´è”CjÍ|jMæÅ5ß§îòN‹`Ç‹pd·Ê~ˆÌïºÝËÅ‹-:vSv]¹Í2ï2±ìQmowÜàVñ¹À51þ|–ÝÆðÎŽ/Å6/+ý™†,Mê©ì's‘®ÿ¤¼š´!¢ëv①ʆ˜ ©K?ﲑ6–:þ ÐXÒ™g™—‰ƒ‰„tEpÿútk}M“ϱ¦Q§Å’Ûy3à Ik29ž S.Áb˜ñü¼ï:-©ç5“¿o3Žä‡µu4fã¡Y3éÃ.k×Çp:ž( ¡\ê0ÙüÒñŽiKbfBéC_½ U¢‘΃t)É×MMdƒÒ`¢E¡(Á)™v–4ç#›Øþõéðó\ÅZI‹p¦”ú¨Uµg¨qåßõ´@_~*bºÚ Õ‘öªì¶þÏ=v¶ë×1+ù½U·?7©‚uc‡ß·Àmz€F™áC1#(¤ÕôË,¬1@K(B"åQñv3iŒ‰%JeÁð<îs|6'µÈéÊGMJ  ó®ÎTë)¹Y»Á”ÇË«£ªÔ÷ZÖME)À©Y*ªÙ.Ö} ƒPZœ7T©ÅïZ÷eý>@×ü‹g67a¡–þ¹^ù›ôLü¢Ï»¼Ý~%»ï8üê*UA¤ZY$Õéa‘ÊÈ‹G¨ôé+Vå‰lûÁÕ ¼­O ¦Æ‚çf'qSÑ(“½’ rÛß ]²“LŠííPˆ uÛ„£ŒmßÝ8Høi6„¨xù]ÎLE×å–¸è=ª§ç`ÛCaôÓž¤°L ìä£(óÆÂ®‡¬ßo`4M×§áŠÕç‰X¹ãìÉKÅ›m3õι–†¹Xî]ZÄx#zLžó¤.„P`˜ãdŽdØmG`ã8WiV5lÿérδ&ßYJnÍÙ€œ~ʆmŽÝ°1shv¤¢Š7í;“^—å|€¾y"Òù ÅãÃêØFÉc|&d£q Oah©<ªâè#sóÈeXëÚ:§çÄPÄVG‡4¬öõ:üü(â¶ABÊnøjâjÛ?Ki3Ö›òZÞÕRIŽXçÝAü$çÌ]F&µŽ³¿ i’¥Ñ_UÓÈÏPÎåjooœŒUd[HþL,EÜ›O J6­Sþ2îZ&ùjéã[Åëİ@­HJÇcð’NmØW“¯ý<«‹ ó>ÀO˜Ìn`ÿ ×î7iÚ9R§ÌÑûóv»¯¾Ž:äë¥ÃUâµûnZ„º…#Êô!(»³Ù>,«ùv3[l «°Ã/ßý%Ó=Žd¯oϵŸqê ógÈ×%T&ÕÀrº}¸b`1¼È]¯Í™$âûVç¡l·Îäïj•vpäúHÅÂAÒŽ/)-S¼¾tès~âmKb ™÷™V0bS¯|Rõ”ïhï48Oýœ­G¹¨éäjª{mq÷ù|·ó¡Üv~0¾°l ˆ5n;éT¥÷­Áqô–³ï5Ä6¿É—A'ÛÜ©Å\ãhÀC9™oý,øÿ?rAf>O¾¤\ÏE-Èâ#ÝQhüÔ°6E 0Hë?ò5“™»/%¡!ãòÐò®õy—6 ºC¹ÒÊÉ{úö´jöÂ`u5þ§€ùJ:Õù+`­DW(Pª9ŸáÃWX—ðªtˆnxVŠšmõB½Ú­Ÿ¥Ó´H6Y€mgbÊvkâhÐg阵&aN&&Û>ºm]l[pÚå<û(ô¨²ô*¹GLž…üK‹ä‘œðaä?jn¥¹þ¯o_ü'üû œÀcendstream endobj 463 0 obj 5463 endobj 467 0 obj <> stream xœÍ\YsÇ‘Þg¬~ÄYØS|…σ; ãrÞÞ9²‡†§p—b’Ê Ÿ#Û gùö»à>^Ÿ?‘Ê·¥ž—³“± pÕ ›ï¥›f¡CÏ<Ì߯ý.‰‘'oýbÄsWÂL*+ Ç8ؤ´Ä¢ÀöHƼôExÙ\Êfö i|o4ûö8 ˜3JÊ8 ½H*¸"®[.¢tŠtYDY”64Wó†3Fàz,¨&¯‡_FÔ‚³¡óOGÄÖpWøøÅÙ™aÛ]:;$Ï>Òg/Œí] Sl­ýW ê6-ÆÎš=|1‚´ëH·ÀJA‹Ú´,ÁóQE®|QZP—7A—ÒHH[ :w  í =ÈõxŽÄ>õ9ç¬þp OËŠ“ˆôbCܶ€õ%Ñ0r™ àiä_ä©8 ¬–¦?ͤ¥ÒÜ‹Cgd°Ô¹'ÃØì¶ˆó öPk ’a"—aíP€ I{ŒÃƒ´¨ÓôH,\ÞeØ ÎýK‘³ÕO¢ÙÄ„ö/œêîyívuV(;oÍÀü4 éh]ì /âÚaC‘ -HÞËú¤ó $â³Åµ%ÿ÷ga Ó½Ó2\T^ŽÀ¼Þ-†oÿE‘Ö"ì¸\3.¬”VžoÇÂ7ÆÂÜð$ 9öú ÷cÁBêt.8òuG¡œgþCµs]Í]& wOlgˆÐŠê$BÂ1ÞfR}[š>ɬTØóš勊—Óiÿ1-™D 9Uö% à ý]’õ?`^óتË3ù Šaœ†Æ™ëBØ ? ÉL\àYT¥÷2¥Ú ØœÝD䣶$ÑþŒô¨žÛOùÅú&-6œÂøÿ[¶¬‹Ò®tÎ"Xµ' LäÝÝDùÂÓËòU†É}ˆ/Vêâ”6Ú$ŽÎæÉÜìÛXPRXÚ2\geH¦ÛŠÐÜeÕ™•½-b™%÷n9dÃF‘ «jD:ÈößI‹jÖ ø8 A™Ußñ!jü€*‹9ûrtd"8`í‚Mb˜ò/¹µS–õë#Pf Œ-.Hnâ¡V°Ù™ê~’aœƒÔ72&MXèñÆQ==„#æ~×5Ó„g/-Ÿkä»<¨«A`Yq Z™=D !}λæ© ðÝ)>¦Ôd¤ßáÁÃ3ÑbÙרÍÒ®°ï;&ñÝÕ”yÑâƒTW¾+ûH›Ö–L“Œò/AG9—åÿç@>´ne¢¢òàqÆì&÷‡×ü\Èæ‚w÷¶G”¬LˤOY#Xã"™|÷ŸË¿Ó‰Y9WT,=ˆá>r0×/ /¿§aO ŸôD"lmº™–D¸¸X+qШ…‹·l,XRò9¢û*@’B$ÄÃÙ³òþ»"¯¬ê>-Ðj-°+ÆNHù9øÏëµðÄ-£ SV5×cïÇ‘ó©±ÓêØ†5¿ZÉe²P µIi€`·j®'¡E.u’©«À¦D2ÅVÍ“Kë÷Q¾–t­G+4IÙm×äõÜÔ‰5G†U탄+KÞ‘”Á·ûç˜2²A_•$ή¦T2m0±jîÆ<Íœ î|Ÿæ¿¦Gýz¤8ˆ³ÃÃàãÎ/ÀþH=œÆ_{©0\XÅq^Ô‚q'Sà°o‹Ô»#DÃ,X<*)é¢÷Ç•Dqá9éŠÞZ*ï¨BŠRžû¹+nÁe’ ü[&îkÂHD<Ç¥8¢[Æm%~‰›¢$ªY¶l¨‡^@85meujB¾ÈÓß|oæ‡ ÈC óɈ›€ž{¾ËŠ7øÙÙÉ7'¯vJM–bÖ°·ƒÅÂ>ðo M†Á?ytrúè«Ý›×·—'§ÿ»'§_àŸ|ýøëѧ»ÿ8ùìÑî›{†ÇµGñY¦Ù…9[:m*Â1Ðüpt ðœQ¥:×bA’RØ$Œ¿áð5  jMƒ¾ wüžrY”!cîÌ­„ÕÞÓJÙB3ø¯§¨úª¥ƒàXNP Sä5äò«‘Ùa­lEÉ›Ma®³*,#$k<]õ.|b‚~ò¦&EÎêjÒ&Oó#Æ&g⢠Ž’®`æòEï}:=»—I\ÈNò×Ùö{jí`˜íä³j¼\mxº¬öïLÁgôzF‘ù‡‚§2äÒöq)hUΑÖSV®C)Ï Ú¸ æÕ›2÷Ag}-EäôAT÷ÝŠ>JÖô‚JjŠ©UÙ ’8Ã!‚¬5ÇÞëÁø.¹•« Ü»[,ê1ZÂŽ^!¨£U5DxYÍó,Aww'ÇG£÷aˆ¹€qVÙ‰§ÐtÒ[Á‘À:s>>Ï‘ÏC^1uѼ$¼˜–É#³Å¸±‡#ȃ÷Òô£’s’€’–œôç#*<éxëìp)Œ¢`!ÓÏ×öñz2]ñ˜ÎËÔW~ ãª-–Fë23ÐÛÏM’,hw´tµmQ‘+G*Ò*ùTç9´ŒL€ŠñήÕ&Ƽ¼É ›X[k¢©4ÇÃXo‚ÊLspɸ0{2•×\ÍÖ^MZãÒ ±›b!v‹úÄIn{;Lô jrqçÖºm÷*–Ëx£LÄÓøÙÂ@“MÀ+¼Ttõ †Û~8À+<æáa³à}OÖ¯77$¥6ª?ô†$z e7ŒG_vH|ÖE<§£Yç`K΢n-¦]ó„ß±qlÆòHcãÕ2æÉmH&„±\˜ïܤ_”!Ìp‡:DvÞbwÐô¤/*œ”pi)²„àQYl§ƒ6¼ T`JU£s )­£Ì_ •RDÑ1êCÂÿÄ*%¤X>UˆÅM2”íS"M¼‰-!Âi›£>_<(98{½aÐàu°ç›‰NàEÕ=”EX 5W×i(naˆ ¦N~6¤œE“¬äA¦˜„®R1‰6ó7qɧը5ùRvµ[êÐ3y­mñC BíJóôdŪïF·€€/0ÞQÁ˜*‹~>ÅÝIÚÝÊëM,R¥%ÖþÄeÈ‹ãAr‚j4tÍÝZÆÓ,ÞUÂŒ¨üÔ0è™´&DŠ<¢fʪ4¢pZ!áÎñÙL]cÈaÚ$ÓX‰Ax²rüƒY„önrÙ"q€Õ¸"ÎõDlE’«ðû0ŒÇ“÷L…Elc¢\€¸óAÓ¾fžOÈ¢©ä:V;¯S’½0ÄFTÏ’u]£ažˆiþF£U)AlžJ›VÇ׸¬hPj; %Ù_¡Ò‡Ì¦G·N¼÷ÂLWa¬¿ÚT»H¬…'nY¶"V–Šyaå¦ÌÁû:—´n %g¸N¿|È@&2ÆY0jJHˆ­3”¿‚ÇÅV¼* ¥f* Õ3qj…VRæöm/ ^Å­3Ï`nm…k@>â`!ج…¦áÛÑ€‹j¥k êŠ4±è]é“XÖæ2ÅÊÀ5q»`Šaã}?0ŽëÈŠ!„| P²±G1¡ïå‘\D(®TTo{Baì<-<©ç€•u8™ÉÙˆØH[ËÀ»ÙÇÄF±P%‚Peóa£ìÇ@O{UluÆã¨È0›Ð)·1a`ľLÆc;Nka)ªâÿX¡A%_¿‰³í*\HÆ´P¶fµ¬b¬$ƒ¹Â‰“ÅÊQ)z—JÊC±E7˜˜÷ÊUu¨†–¨ÍÖÿÓÖp°èÆ<0Óí$UTÂ7ðz/@¨ÃÊc»H ‹y±Fã¯ÖQŒó¥[qæ5žýå7± š|åæ.æªlOðÒÃyòh kˆg—ûo…všA•&ÏÍô/ѳáŒk„R×\ÐϪ€ $QƒözyS7ÒXVA\kò­ªÉbޏË:zhXC"ÌÇR³PÄÌ!7ÇéMY4rÉÇ…‡×±»¥ŽÝa r‘}øÆ#tÇ`3Š´UÒÄ"uUøˆÓ¼T•‚½H\7ü×+ög1×UYòÒïØút³¬„ªc•ïÑ”ÕÅ›÷ ÿ<&}ü”݂߫yí1d S£µý`XÍSn[ ‰¡8²²ýR¿o‘úÎÏËœÊ!ÌLšbî=dA%>ɶb…±º€­ñšÉ;[w bk]‚1ë*ªÇ% ÅÅÙ*V*2×ñ`|š²ujãý![HËBÆY9MÍÔ ¾á!ß¼"Æ-æ>lpwAòeÙç+’…ÈWÒkͯå=Ì är_Ž QœvájßäiïÉ Ðxxä(R÷¼$§ÿ?^’Ã2G`3+‚’öÀ0J4‹"ƒH¡ÀÏ•¸Í°!$ܰ|u¬Õʬ(_šÒ¬œ»l˜ê`ÖÍÊdZs'i#|,Uˆ.Õ!‚R{[g°ik1˜ÅŒm]NÒ³8u©/V`Õ÷WO–)Ûƒ3ÏOD×äËkXTƒî‹ ê0*ËððAyxšž–‡¯ó×üWzý&?œÊÃ'ùáeo ‡û<ë­èuyg×äB±…L˜U³øn/â]Qä¢üœJÓ7¹éywÔ‰f Ø!=ûGþÙ—™Ôn¹Y˜,»DP ôDZQúö²C1™Á¹6v-*­à¤ ÷ÔªH*'TIåê]#Ã6Š*s‹(4mº7üJë"–|"N\4ÈíB¨Ô£ê0ŠU1»mæ’Y”ËqÔ¿XZ¯ª eæëêÿSëtv$[¿Ìö2ÀHìu^Ú¨?ÚДÚ6jåN4NgL¬ XA¹}³*º[µvkÝ1-)ø…J棰Ü1c,{g5g´Êu”} òc@x«:žùŠë╸‚˜™ »ÞÎÌäx}—kKË~`&ƒ•V¡çÄÕ%vrÿG^ò["•ARBÈøíY(Ý%ïˆ"1¡\&ed´ù 5Èßͨ›‰¢0QõúbVñ°kOåš¡²ÄLnɩʵڔÌYêÈIJ72æMÄ0¼ yù"d— Ë†lD° ¼øm3@@hO—î“)eI‰j£qHÓÎåê»ÍÁ4mºÍ!C܈ŸEuwŠÝCz) åY;ýSe_®+ !€×sƒÇg|Ê:¿Ô¿LÜTÅÂÔ¾ ^)8ñnï»& 3·šU­ªv« ZŠx/ïQO'ì~¦çÀéÐϳun^ÅhÐ|¡pvÀcnë°„K•áK\îH“hóžV.^äéŒø˜t3;}ˆ¯ØC†:Q&½ˆ)/Íuó÷Íhîw°¬&ø-è¶ÙiÔ¶¢Û…%¼YnºÎš"› 3!WüVÒUù,Xë´ ÃUì“5ìë4¥D¿â-<±J“S­³2¡.HÐÎÂ]+p¾4™Ofo˜Ø±z´|^1˜¢ém**Û%KvÛ“ÝNi/Æ«ðÓªàVÚW⦊¦EöÌyK¯u!sr’•L‡Ekµæ¨µ‚Ý ’tjaxC„OõT÷¥ÓØÈÌGT$(À~´wÉÔÏ]žÇÂ>gj?|%<ë1uÖ,ž•Þã¿rl~…mëóWÊ­¯x㪜 _îÂ&9/ÚÕöXò´Š¯U‰•ÓVyw½œÎ·ÌZ;ÔàìCAår•‡j—þ È}E °©˜ÿ _4DÑWÌÏ}“C¨@ºcž­D'¶¿ÖQÇçïEÅmìX÷bfuZ³ùNc',TÁ«¼Šs-²yùÛ7ø8›êCÁ~¡Æ‘À™3¥Å¿9ù´òP©endstream endobj 468 0 obj 5392 endobj 472 0 obj <> stream xœÝZmo#Ç þnäG)PìÑzçmg÷ÐH‹¤/8íAE4ý`K²ìžd9²}>ÿûóFŽv$Ù×& ŠÃÉ«yåɇ³úaÒ6bÒâ¿ðw¾9;g'«û³vòGø¿:ûáL¸“ðg¾™ü~ƒ”€–fh1™]ùÙbbå¤ëu#äd¶9ûgÕצjjÙXkU%Ý—©í‡F¶}õM­ ½3¦ús=M߃©Þâã0ôz¨¾ÆG­•Õ¬žÂØ^ ]}WË꯾GwlÌ¿f¡`_&´7mrÍAS?P÷|à–hº~2UmcÅ0ø ;صڦüXÔS#†fè»ê>5ºK”±m…¨.ðë¶4X?fŽwaö ªÛ´î~\¤Ù7õT¢`‡Zc—ú·Ô¿M8R¶näyj|¤‘÷©qI´æy©q‘ž6ÔM«ïJrl3áiõðtIÝ7©ñöÓV·`iSwæ‚ÐÚJvM§# ¨ÙöðEVÓL²ðXÂÔT©¾i5@Ed[áý¦T[ØÒÉ¢¥ºVƒÙ5àSHéðÑ 1ì<ŽnÈüeø~›Ko€°6Š5ný:¸$›Î6§Æ *®¦ @Ë"B:ÝP%ÉŒ‡a2^á Чúê3j]ÇÅð„¦wK<9‡µÃ ö÷²JU×t®Ïa‡÷õ´m¤Tvèhôš@0茤àdRÉêOuŒ÷ñeG¹~§Ý‘€iM¦ÏÃ&J3QÔý;&9ÀÁº¦Ï}H3B»ö]=´Ni(Qïvš§U/¼6c~õ§ŒFý PlgaÐcÛÞêe‚xà&+Ë®wŽf†Fˆ.¶Zá¼Fº5´ˆf/H‚ËZÚÆèVUϸ†D# qðÄVôQ`ü*­ˆº€TÄ4hb*‚ºO13¢ï‘T1FðÇ’ V Hßrµ§QE`Ï n“ §Ò­u– Óµß&s eûF˜¯ÜJ"Ú4FQ„h”ÎpÆÜ1 ý¡‡,ç]pµDÑ$(ßã€@BO{{Þzc¹t&kÚ¡¯¾¯Ò‚L‡[¿v+2‘" l‘Vñ 3(ä3sEÖÌåŽâm‚; ÃGw8©ŒcŽNK¯êhÖ& AÚØd9„fêN ê~Nø¾NÛé`abÜV)l£UÙæ™Äh'— »N ÏŠk“'³vÌã¶žtLƒ®Ða`qéU´ÜÛu:k¹‡í=¼`«á¨AyÚž”›Ô=²*Î ð3ç8ìž-s¨Æ¥”;ì=eÇS Êã“DöU ÏÂàïT ­£BÿF¥âžÇ{&hXÁ¯:ÈÅà8TÃæª• Eo‚ü%Â'E߈ÛÓäjÄ42†ÐÈ(ŤFA“J%jAG#£R}›rÜ6 É.*ø¡§#²$âsë‹U¿ÆGÀ¾ìÃ:!÷(k›ÿ‘‡a„´%ÁJïÐ6ýÐÚ6$¢BãcÂ~"jO­ÇOÁƒ“ËSF <¡2M ¶1»‘cá8p}¤ï—50ÙéHG$Ž_Õ{14…dôæ /€Vb/«BE=À¸"ÀÉÿ’Ã^‘S4G€ ñjŸ‹¾;^¶\¤ŠÙ1•Äò=‡óµ‰›çjÀ”Ûö2X9õw1€¡ gîÇÇkWÎDô?§ î©HyâõHtž¬q\,C5$4+g˜oR µ+U!˱÷QúŸIbm²,í™j$§ŸˆÊ·g³/‚bRlðÒ›dõë×ûŽQèŸ^yw¥Mç¥ÒéªÔ¸ä ×ÖIñ©Q>ÜR]ÇJͫҚ˒F—\9¤‘¸Ñ])–îøÈˆ>2ª~]®hîLŽX&³=o³X› ² ƒ¬à?äüš ÇÄU?”𴦬°åz4 ’vËPÂ'òX¾¢•Š ¼é,s¦] '¼á6oÐ{& Ò“öŸK&Y—Ræ*S¾@¢Ùï…íÖ ú-ó¶ˆOÒðbv‹1FÌU)j£l¿×€£Ë—E”cà <b%d£$¯ª}µÆj;NjC­a»Q)ˆÎ/ZÊ„·ðEž¹Áb›•Šã¢à}*tq†4X¼BNwÉÖv/rX`¦¢´wÄ,ó:M+ä²C5«{¼a1*˜ÑÅ=v9’ø(qÌGZó.XE /¾! `âE\Ú— öVÐC†iºc¯AE9}bZF3•´,”›e4t!>+ጜ,» (Õp8^Kû7¯gÐ}Ç(ê5¿ ÀÑ„4Ü>ëQ%¿­±Ï¯÷*I(TÚ6»Å`“ØÞ¥»¶sgÈ:–A‡v„àam¤'ºqÀÙñž0¯=¿÷~Át¾ ÷ 0¹'øJs<_@7>+O§ÒZ.:Ú”1§—¿ T†˜ýûu ,ˆÙ«Ä8×ñ#å×ðÞá&ñýU¤×¦LÂ(u1"^$ çu!ÑHÆdiä])#ßó§ØMl‡¥ö7Y¶Œu ¸‘8ö6‡Þs¸ª/Ò“Å‘}õƒejû*in›ž¨ÖÙ”XQþBF 'êu·¡ñMI‡ÄMY².¾ä¹/é={Ï2&wŸòæ§d¡ìuÒNaÝótèÓÛ›«Òƒ”èœ÷µó;ͱ—.ß`‡ Ù*¿Ú÷µ_köΫž“‰ÉÕ\­|Lž5n“gË´çüµ ï¿Î8j\Ž˜ÚM _’®ŒŒ+1:li€È– µD†ô8©o\ë¢d©½ tìT×%Älò¡áX =7 £±Yx™gðÛ{ÿ×AÐä—}Ì"a\^¦<£Æ¢ñ> !„·“q°òêíýl×}?š]PFÃÃڔŵÿÿ„°Ê,> L,”ÒÛ̞ÿ­4@!?$¿^sy<íäë´—„—ÜFÁp«d‰Å^xy䨉æ)ViEý^Ç{ÀÓáçTPÉBv¬Öÿ©ÿ °8ÏåÑÞ&´ãùI Ï#äÀ¾ÿ›yÂBºá)oY:Ó ˜‹3üûB^ÙŒPþë"ßÿ<†î)œ`]$ #­.%~R2=dñu„¼x2OFOÉ<-aSd°Œ×žl|ÓTü ÎOtTL ÞjÿxAˆú¹¬¦­Ù»t*þ‚‰]!¿.ð…ËÁSïuoC4=DkƲx+—éý§Iü'£2Žé( Ô22‹L{Óñãò›2¤ƒÂœË©> stream xœ½\Y“·‘ÞçYþˆ>XÝêbáè—Õµ67äCÒlØÛ±q(ŽÌ™!Erdéß;3q%P¨îJ”›U(•ç—™øn3Ob3ã¿éϧ7g¾t›çoÎæÍoà¿çgß °I<½Ù||ƒ„„+S˜ƒØœsŸ'7Öë nžßœýuëwfkwæïçÿ O(ÁŸ³ž‚…‡Î/aà'»½šœ Al»S^‡íG;¹ýãn/&­“Ûó:æ³xUi¿ý®*˜–Þ5Áu)Ã$›!.3.§À‰ïùt§'ï¶üƧ0\šIÌ~û?;|ÐY·}‚÷}PJl?ßí%ŽWZNð&šý;l­qŽn*œNl¿Úí üpÂoÿ²“Ó<X%>q¾ŠIá=ûçŒäj ¼OôÚÃ^!’-îÇ‹Ym¯âô:˜íPâ-,Á{ Kø^+WÛ7»½¶j2&Јë|½üêy¥`)&/g{”õK¹ý~§`¤Wž]{ “NJé Ó¤{íæI*úÛe%ý´³Ý~›ß—Öd(—^ÂS·íNò”Âñ—ÅH ú | ¶³š†§1NØí‹Ýžƒí›°ugåöñnïfÚí´#ç½ø ä&à§eö‹¸ týš¯ó9üWŽcœŸ´ÉÛr GÁƒ~šE?ÏÅ¿±šý$}¶íHé&£¬‘v¡\°y¯ h‘œY ?®‘2pܪ•sHTšE¦Š´>}Å0›ö®s°q½wŒNû10ÝU}_ó¬µð¬Øþ+r£„í®¼uÒd8¼>ˆßT(ÒUË•T“2L7wì8+’­înÄ‘ §Žh¸&¯€«Í<ùó$Ò"Ûd3+f‡ƒh½êiæz²“æÄa‘’¾Täõr°].Á#r˜Fçâw‰{­ò! Ÿ'š;y%'š÷` ‹Ã÷1é(:¹Ÿ«qÜùài7´oñÝàëÅ8÷%M´ÎÊi5l ™’F3͇O^Všt¢ËŒZgˆ6­ ¸¬L_˜(½Þhî˜TƯ®P§Üy7®1Ûß©5¾ïÜ”¬zq,}ÑKÙ댑ӽgS>*jŒY~üͳD F…o!SxŸù&Š|E9Ø¢]e฼…)èd9²AL6zâ·>YõŸZÁhˆïv@ò°ð¶ðëKxe°"KFg{p=Ñ>¼³¡Yg%«iž¿¬Œšö B/ü¶µQÉXøÛÉÞ˜ ޼±–©ö(ËîG7<‚w³‚pPì3qZkÿ¬}o’,… ÑÇ€-É¿Áº;}‰¦?¬[ƒ¤äÄíd%ùœÂ¶·³÷ÔØ9Z]ã¦Ô·_´Çå@8¿”†ц¼"Ð0 Q< "/(éÁ™½… ÓÈWc·1JTÑW;?,Ö½ä$B¶!ÅÂdeE‰EØ1˜!ûˆ!Ò‚´(W›P¹¼µD¤GÅöoÛr¿§‰ Ã×°p㢅ªÊêkÿ¶K‹–I.!¦je¢ºWa5Zˆ„i4vzà‡+cÜñ‚ '?Ý)t-4-‚4§æþþ0ðh5B«Íß&‘ÂP*‹Ô(ú΂¾Ã)ÇÖg !÷×Urw–ÊK`UŽÍ¯‚¯,Ú@vGÅ{•6h€«…»”ãµ×Ë_Itˆ`mÈ1ŠÆ³-Jû~U‡dÕ#¸„$éSÆ"ìTfA5b 9«–"I驊½•›øpYÛðyÓš1w¥(TŸc9Œ²_®ó\ öFÅ ÿ£â1!y@LÆÜ½–4Á]¸hDyŒ{‰É øhÚs€ªñ}zyèûd4(ÎîþβŠ$ãÁ(4æÒ”K#„¤ÓÀ ù¤rû0™—x¼ÊRulb¿Σi-L¤Wkaž6ܾL¼­Á¡›h¦åW7 |æäÊ›Pl`º=š (0š·ÛÿÇͳ@~Øb±DŠ…ÉªÅ¿â8š!¦i®Ë]°Uðÿ_å1t;¤ÞÔ÷}SÖA×å׳ƒ»ÂE_¤L‘y]."*g4¥Ï–‹ì=WåâM½øltñq¹øˆÿZN$ëŇÍ:|Lûüj´Ž·åâÅèâ]½ø¦\$»þz7Lø6˜<£Œï @ vL¬©Ð|ÿPê þ ñÜ쪛z8 þ§•¤ëºL.‹±›¨YzG:wxÄõqŸâgŒš%(ILÔ 5à0,`¯hç€`,¸M KТ!¨×ÌÛ-){öµæ¤Žç©hã2ìC|‹¦°jô¨ºž:V‹*•9ª Æ8Ú+D yV!û"ÅáŸøj6äŠ0ìôU¤ŽÖ]"ˆCò•(×Å¢?„”iÿ››…:>55Ia#EûÕ©Ä´¼2FæÇî¿E Ìì[ t×s)Œ“*ætY-H[›ó%ÒÜ`ÍËmJ) Ò÷³ó³/ξÛÀT–J„@€üFza¦Ùo´šbÕÑÇOÎ=ùÝæíë»ggþ´g~‹ÿûøŸÀO>ÝüÇÙgO6_ܳIz\‰À÷Äz¤X˜£ŒJ¥6y7l‹l#¿AúAœéCÔZáþŽy›w­ª»Fò*¥iåqPà^A…Q0ÆNÁ?y“"H²“B?å ýZ‡¨ ؘš ßkEm27yB)1ßc»‹*–—\Ô]¬ø¦‘\«¼sëE,í'…¤ÖŠdŸeörè4/ÝòeV-5¨DŠçq1 ¥oÃÀ;Î(ÙÂÚ$d0&¸«î*œÎ1Ê€sÌ|ÈÌKG¢V†¦¶™´ŒÂµ0_­p¡‘ p³˜v¯/c‡DѺ8>b»åµkZБšáEÁßsH N`–¨Ú …”+q•„GÐÍõGCèX×!šXü' Þ™”‹b¢y^²WŒAj]ϱN˜0Q² χ‰Ÿ×Ì8Ùy6-Šu(æDøØÈ^pV%%aÊ [‹÷³­U«¶–ÊTÔ¢þèh Ò‹zÈØ ®…å)y¸›Ò™c··•éûAT¢ujˆILL@i2 ]œrt7r1ᬗq_´Ù• @ö¤ÒþÛXº!Êzmãa†Sէɔ±”ÎX"w÷'ë×¥ L“¸–ÆO)mµØ«jðF–Îxg@—…&4ªuŸº<‡ø¬Ú ºEš ùa”˜F+9 ô…{þQܸ•½¯ÁÝÀÐ’øŽ¼Íû£;é]÷7`D™õF*Šb€S^f‹e-AtQl”ˆ5öÌSµ•]Ê4¶èÂY»Ùü,БÔ:jj¥ÌX<† r‘ŽÇ\:zXâOUSÇa¡ Fðƒµ^$,î¹m¡ÈYG„îñ&Ý`XPþÉÁ üëU…ê¯ë# úÅ€ wº)_Ö‘—|[láTØû{¡G)õÍÀ×GÊ?HJ¿‡0¸ä“ÕŠ4îÀEûXéõ êÕ(`^G@&Äj¶Sj'óØýD¾šeŒsìßlJP9»¹iÅøˆz4À$zÎn4Æ7£Çjð³¥."fS à*çpðE¹„Õûþ¾D‹Ÿï<Å?zû—ˆ` øgõ¦ÇÍI+Ü”RqMb®ëHnAHvX~Ç^ðbGùMÌ® åÄS”0.…uìù\| D‹q²hŠö0´Ë5ŸÚul6–¸ÞDðÛV‡Xnø3¤†£ovsogu+«þÀ°¨ &ŒJéNv S å(ÿ82ÿ(p±±Õ§å¯²*9^‡œ¯Çý[V„š¤ª–ô®'t,\ÖH€Á×|çe`¶ 8`Ö×µ°œˆ)³¶†Á0IFZdJÎw‰“YÁÑ"'4¸•g‘R&V²¯ƒ£R Ô6¶Ê¬YÉÕ‹,YƒH¤æ‹…ص¨.„ùû²ÒVÀÑa €´#X3HèÈåðl‡ §èÝ@ÄK‡0Uî¾1ò»&ÖÊ+±!r¦à[…N@%bSÁV×u.%£U¨N?Ñß>¡ˆa”ÂŽô¹Ô,ER Êp£íX½*švÃ"ý¬Þ–÷2 Ë'ÑüëÊm?* Ð.Øn¾ª±"X\d®£ºU0nЋ›p5"˪cÑ)—\¾¬üRÇtYk_6Ýf5 ß.ì*B.:CxÔ†ÍÄ%T½ØZÙ[¿‡|¿êàü™J¡¥PǺHÈðîNÂl [„Áç÷è$€»åõ3’ðÙÚª0kp±¾|¬‰Ö¿Àò±æ®]þaK‘Ë0EéQàf`žaèZfà\R"Æ)"[)¾l‚êØ{¡¹wÓ0ǘ¼”€Ô}ßT†HŸVFåQîzP²·¬‰]ߌÿe8^‡9ÒlÁ2+e‡ì"Àbg•\¿¢Mö;Ì_A AªX o]Iy÷僱©E^~»Ê”‡ów°ƒ©÷8A¨Õº9®–Ó¦1Ö³(lÉ]Dw܉ImÛPípUm71vêêÚPÐfûSkÕžrJ8HŸzûŸØä§X2T–TÇå,;ý†½òÌ'PØBqXíTê`ûªP”C|W›¢g ²¾ð¤œß_'°^ƒZã}© ì©¶¿Àf´Â(”oæ,Tw±('\Ô3#G¹¾!ßÏ©‚b`gX€ŠW¢Ó¾•è;`F@ ,Š5ð’*yÐs¤&Ó ˆÔ8 R8ã÷A4ð÷‹]éuÉAå§è êLì?ècö˜ \Lý±<®Q^½<'˜öAöæ¶}fPݰ¨TOžAlÓYÖì'Št«71yðõ€ K¤†xlÔ¾–J ¨©i¦õŒA¾?Q;ñ£%”]æ\HSÂò´JqÜiîW7EyÇÞ ÇS]ÛÕZ½Â(MZ;Ù€2—Âüå+,Æ<. %uº0ÐaòTØÍfZÈŒX|„tšyŒ]Ÿ§v@×÷ïžÚ=‹ªÛƒ Ãè:UàÍšqüÝÈb-#CJa9¡´¼UnÍÌÇUuùÜücÌQÃÞb()šü3ûÙr‚÷MU5~Ato¾Mø„a瀱&¤ä2p)ýF–”µÞœt¬J<©ßŸ§$Bi¬üàkn NÇ®r"VkÀ²1Éê¹ë3kEm9!ª<—lÌã‚w*Ä}3ÛËe4óêâ ú¦PJîÊÄþ£3¶Ö*šrÑžâmeÞN˜_°J±;ùN þë]üJëþ;Ë+ädÑ '‡%d^qñ‹½œä„%ùY]¦÷xÎEb'©ÜðƒÚéÐ:[)›S5[²`æ*ÙHd­Î^ÏÅéT²ôU]©¯¨Lܰ6¿æ²pÖË]ÓV=Ê0&Æ,bÓ7Í3 ‰j­Adïv:^5Ãó+ñeËzxÊ&Õ–ÜÔ6¡^žš2G áÂ'Dêø*Pˆ$”L‚èÀ!©8WŒÎ²¼•Î^2ýaEÇήËN¼m޽„É4·GEΜ‘¸Ák[=G6êì\×tÀ±£žÞP¼žt÷ëªÄÀY*ƒ·Cw!rWY‡” ¥ÏŸh•cñ§{ÅÜMœÖ–õ†ÑÓÁ,hJ¯jº6†ÞËo‡ÔÈð&"eïáŽâTvñÀ§R?-&%>ÛÓ=Ï´l`èÎÈ«KÙXÿöЧÒK¦äZ6jÙÛÕ×vjããÆA.ý_]WQe씣&ßT#6§`—. ¯ºö@|ôø$HåFžÙPç?å¤ov6×áœscÖ»cMc¸ëCNVú CaéìðÐ¥túª£d+;õ%é“Þ½íÃùõ¤ÞƒÑ­;¥µ'°…ÕŠòN©N˽ªœ=> &{:M¿ e‹¾8û7\xÜZendstream endobj 478 0 obj 5927 endobj 482 0 obj <> stream xœÕ][Çq~'ÿ†Õ“Î1t§¯3í·X±ƒò%æ±#È’+-’»+R”DýúTUߪzºçRk  ÕîLO_ªëúUu뻋é¨.&ü'ý÷ÙëGÿ2_ܼ}4]ü ü{óè»GŠ\¤ÿ<{}ñÛKhd<9†)¨‹ËoůÕŬ/übJ_\¾~ôÕnÙ»Ýq¯ó<›¡?óŽzZv¿ÝÛ£1ÊùÝ?íõîÉþàŽÖÚàv¿Ûà9üáw¿ßøÖ;·û×ýA—%Àû/ñ×°)6t³Þý:ÁŽþŸxo½Ë/­ÿûå¿Á„aNlÂðÍqZ`Η×ižóÞņvá ÖÀzüÅÁLÇY…?x sܽÇßâðã8MJí^áŸßà£x»û¼…8ˆ2Gç' Ò—.ýÕîS|w?®rÓØÛÕ©ŽðëÇ›_ÓÛÎtëLcãS£t^±oò³ØîY™÷mžWlü¶L³~v‡?~Èsí {¼x¶žûúð1ëq_œšÙ(¯kÃ{¶3Øp¶Š-úº6¼ÚÏǰ¸©!àzÀ×¥Ÿ÷½é¾ØðX~[¬Ÿ|__sç~nʳŸKÃs4¼D^=èù¨ Óþ'HH¢]vÏ£´9‡s³ð›Òš¶JÃ÷/?|³? ˜Ú YË+—ïAÎ`x­`úIÀoc¯~ò4Sè+,q[”Åä(äµ³ñ½:΋Np»wµMâ¾ö,Þ×î¨vŸÔg¯òd¾‰Ã:·P·yqÖEîð~ö–rßʉicÓð³1u…È×ÚµÈ:ù“òú-jçf¯w/¡å´µYv_ïJG8£ÌGð°iÊ#+MG­Í"Ë.Gk&]Ú¬¿Æ<×ßäG÷Èf²G_´Ûcõë=NÝÕäë|q*t¤Ql±‰7fµp>­O‘hl¥¥‘ÍsÄFqŽÆIN*YÏŠº`Û»€Íyï´¯â½(ýÝÖAPF¦@óC.BR–5‹rSÈ‹‚±‘<‡DŸêa–H¦«Ä&s 6©úSÜ­@ÉTÉ(»Ð,f ‰ áS ·Î›Œë¼Û;.C ²Î&54ƒ]†NaŸæ†¸¡.Ä÷u¸ç=F΋2!­1 l¶`kýcÅgwÄ‚‰ >Ì*3”JÏwlIpažóŠ5±ÇHe ¡"–fó[ñV4> ÄSÙ`fF4Þ&õh€p ËBú\÷Šý-õGòõÁ¸åèæ¢D¢¬%nïHNåãòè:ÒÙê•#v’´µö ›ò×$çr4Z³Îî¢ÇsHÄ9¯i´2~²}0ÏyÁl56¶mÀ€A/„±a˜gè×õýÀËH|Œü»ZH‘õ$ö öx8þOø9Hµ÷}«¬0ƒžî1m£ qIÞI%;û¾’dXNIÌ÷ÌŽÐC´© c¥ÑŸµ“¯ÖÝÃÞêóÌUUt”pÖMÈ‚Sf5앙Ŭ]Œªl»V.È¡+í‚ÜzܪÏqZ°YʬUºÛÄ`Ÿ¿¨¢¹gösâžáEâzú¤öÄ x¬âO‹yú-IS$™§®Ub^ ky[ÙzhœØN°/³Ìûd~É_ç!®3™ÊÒÔÄÔù«úKÒ_ž}—T/'…¼ü7)‹>¼¡ÕZvpzLv˜DutV°ói‰yH³µL'œ,T7w†h3‡ w(!è0g‰9Çx·ÈFzž­íEc§ª£¸H{€žÈ„Ñq߉~VõDr'Ÿ'†Ð»Ï€²ÓŒ¿}Z¾ø¬üÆVH¹™ÁyÆX+¤“ôÁÒ†-s™†#•Û«U*»ˆËDFíÌì#À Å_ñ-RḬ̀P0"ÍV0¹Á?Ÿµò©U_Þp•}|Îg¨š'ŒÒatˆ‚ËØ=/Zp+¹³^DA]ï%xÒ$Á9ºÁ?7xi2a¸“~RãÁ6Ú6 ½Ö"=b£0"]%‰XŽË¦L•aÀK6zÃõË vŠ+ÿ5Ö—Lã fm‘HÚM1+n¢â1DuÉ(a„§P¸Öø¾†?\ ¸éˆT’†C0ŒMôj¦#ˆx‰†1Ï¢£j ¼®ôÒºo:§ó\sÓ³úìºç£! ­'>|* ‡Z"B=ð>,¾uº£4jXÃK¦Õ³‹øŠ=ÇÈÀÍ’×ïê0Å ²ÌœXY)aa²n,.øzÖ M²ž¯:%€â#â&s9·5? sj"&Ðú=§y_À :K …ÕÀ$^²‡ °çóÊKö*Ãðž…@¸ÐYä[-”‰œ°B5ì—Éãüj¬êhÅ’0X©»ède¤í¸¯²–ël”›µ’g‚™jfA 3*›v{rßóžxõÙˆvÐ`Ìúp K{p¤¶ð$´† $Œ'ÊÔ JÐà5±[è2{Þ¨ç^ ££½#Dædœ®ýFœ^ÆrÂð«8¿°,èÞho1&K®Äljö÷ðç2ëòþójùO˜•[Ü£‰öð‹º¤Ul€Â}™b0B¡Ä>,C‘|‹e1%hQ‚êÒ)îƒ-…t Ï©°ûØ>ôŒ•Лh††’H4÷#@.¿~' ´Ü}j»¡¶Ã¯þDªI+VwOøn÷uOªÉéÓå¦ FKÂdyiq7bRë’·Èxª1 ‹7Nkž‘]×@%òØØø ÑA=£v\ÇA7íU¸ê®¡`LØܰÓ0u±½GD'£(]Ö)>ïw %OâYtï ,Õ6KJrÐòÎv±6/Æ…ÂD½¬^ËuæqãF3Œ²½BGú!‘Éežtº1†ë‚/“b2Š;€L`kØ0©“òÅýOnÓ¥à<]ƒµËÐQÔìÎÁÀ !XôijüãÜy]‘ë×ñÌâÉ*2Á¡Pk$ÉM\ÕÒç£ï¿ëÌ¡ûQŽDÝ`øÀøœË$ui­£…8»'ªïòõ£@Éõ)è°‡ÎÒÝv™µ*|f”˜x•.60j;K›’A,Ò§o~Á4è,Sd)X"RIp¥•‘áóÙ úŒOÌ絎4OÓ,9Ù(b˜¶S2”2ЃéÂuôFo;zèîm Ö\c'°sLØ|€­@·KÏäŽ6Øf}ƒé“KDámÄÅ™v¸âɰ0é °”š>%‘Yf&2[~Ö's ƒínÏä®ýV”‘_UF-2ð‚ùX”ðô'BàþVÈì(ô¼°…KpŸ³ä«pã(ä?\€b³‹x”èC$ä!Æ@HL¬§ABL1MK$ØýÊŽ§¨Æ‚AâŒÔ]†óæ&Eqˆ¨ ÕNhT à]£-“Άh3N)ᕵa&B‘^pDsF"Ó)µÍŹª&Âá>2u`TÞH§¦£›[Á‰ÛŽäþ„=;òNQ!Æó@ï‹#7>Ü„÷¥‘gºbû£L<ŸT‹³„,Ë@DP›r1¬+Ž& ®d4sc\W6Jr2)ªeð… †/*¯žÁËÙ°˜H[…ºòT¶%ú߇ÂOþã,ã包™Ôß•Ù(8)¯y=Ão§Ö_¿‘yÁà‰ݲf™¬Ž…CW±§ŠÇJÃ&i³KE¤Ÿ˜\ƒÜx•¹ü=æBfÊ âe A-†n©CÂSHmHC~°GC_Þ€ ›JÛÔëáI1Ì_ïË ¥vÏ‹–À˜»ÏT Mëº3(,+™Ý„iݰbeg|¤âs‘Êô‹JgØÄjÒ«³ˆs¿ïìÝÂ/6õÓE*)zNBü‚ïbôæBp­Úö§ËFa´jµÆh1($ÂZ&s>›…† i¬tËÚ•B¡Ê)i߆Â$u†V¯(ùy‹Ñ¢àm8¡F¿¡ÝCÍ)°aQK§L‡ü#UÊîæî_•ºÓ„]»œÎ—œãÛ‡h¿Î)e ӆܼM%½ŽXPÑ[Áã9u­1Ôå~ŽÁô-Hæ1 #V£.¦Qj¤Ý {·/Ua,7€ã2}=¤7ëÀ =ì6¹lÇ_ÁÏ1ç²`ÉlV¼É €XÔ,z.V£a[vÿ]…ƒôsŠÏP÷[ª.ɺŠ^]ïÓÿBú.A[×$»Põ1ßLÉ*Xå—™h÷ Õ0G­–’‰T:Pþ´ïN±(aÍ‚”ô˜„ÓÏ\¬Ëå[V¥cÚ.2n¿L5HµœöU"¢8J¡¤JUØ…3Ü~¶âf60ø¬“1±1®;'c‚ZT¡&ü‰ªÈ­:#â¢Ù2n‰ÞÈcD5rEËŠEÕ4%úA]lSRÍ­e§¨ 5Š^0Å2s“Sì «àÀ¬;÷ÿ3èÏìN6í°0Š ü-…â“–YM®x#¥¤Íù¤ŠIOmõB餂½ae2ýÙ”¤F.Å<ðÜl(YÆ¿V+åu„ÌYbí6·ªßhsɲÆ2»ãÙ®r”ÎòÁ†5ËŠrù ‰ª¼¯³î s‰üÏ; ï"àZqI9]ýÔ¨®À ²^FÏdWÀ=ˆÎ_~›Évµ…ü¢ò’Ià† 7QC$¯ª³Jì‡ nóKVƒÿ¥Àó ÚÕšÌ( ÿ‘mŽÑÚš‹¦T¬ïŽ×(Ï„ÌÌVG?ñ†çìõzè¼Õþ³ÛÒŸ•Ô$Qä½±×k¿•»\6ujÃXø¿¾ b'dz0ä–¿H铦äõ¨¸ò¤ÜâiH´*¤Ó(>ë<ÑGkž÷ëä9®ªÏÁ ˳zYSLËÃ@\ UBJY»ï(^ù'0ŠpY«X"¦¨4Û8¦&×Dò!›PìTÜ9:°…WK]EÆ”¶ÍSæ« 5Z›åÊw.õDyÓ©’©öƒìË“:ÄB˹éíã»8&™ýÒì Yý¼ò¹zLë4z¢fÏÉçU•¡ÆÓMåÞv3ã,ÔaÎ×$/s*‹Üƒp¾5ò|ÒŽs‰>œ9· „2ýs1!u[9?lÒæü’Ør_%ñxf{ÊÛÞl_6Nlø¾ÌœtqªlAs3œ6;Ï—FDr†{P $ÆKèì„sG³¾ëŽ5µ/èµ5iDiM*ÐUù®©¨a°W­yýÇ]u·šÐ·lþu2ÖnP\U{ô<¯¢"z˶¸¿ÕNT˜'µS<ì0 ü3O Išãy™ÕÆyMJÊÐVæƒ †"P±Ððñm<6tÿXè³*3MÚ~LÂ>r(ögu°k¥:úÇu£Û>föA˜ù°ŠgXzñ4óèNy|½(%â%*VØRb$‡´]§u}æX2â°£xHwŽåê‡&eAç½}çH¿\Ä)…¹˜ƒÙwÝ0çÄ¡a<…‘ žÂ.V/U'`ƒxÇÆƒRB䔊·A™5g”â–÷Ã\!Ÿ6á¬ø?×zÌfä,Õóóª)häQªÇGýɃÊ%=gðMÖ.M„eȲt¬Ó/Z¨ãʸ@I‰cÇ(éªO¤©·dÖÆèy"üE¦=Oñ—ßï鼂Èwnf8ãtl*‚aHý¯÷ìÚ™^ï,q·mH€ÓAÇÓ¨jÎ>SÛ˜ü±¨kSSÖ}ÏjæÀla7qÞûœóâ<ÆÈ1‹£Ù5„Y¶O °ÒJ^!’ίˆ4oNÓú¥~žÅ:F•oêcD‘ÚöÁe \…¦£_ìØ ~ʾ«L™²M.¦ÑÅ<#´Ö!Þ{tJ"ê¥Zƒ®°?xÛSX„8#æðqyó):x¢l™è>NK¤ídž˜~Š’™d8½éYur ü£;È@>®Ç !£6åcÊŒƒ;Š IªùÑ×î6²°@O¬¶tHMÄÅKωŠÄyPFÍ´.Œ£r×QĘn’;+jSÕF>"¹¹!§ »§ IôÏÐ1l‘—0Ô#Õ_îòaìîoØ] d~¤ýu,©øçã0ÕÜÎåš«'•˜=!\+Þæ1+å *Kí¨VÖÆ;ÏDDk ‹h;y,Sµý¸}lºñŠ=¦Г#t’ÐFm—|GQ5Å6‹Åªâ(govWRídV º–ª¨^ŹaŒÕ|½šKP!í ×Ogžÿʬ)ìsÄ °<+–µÔ¥½“8羪ýŒÅÌÓ/°šd £™jг޳üª‘ñÍlñqÞ -!Ž:—Ïí¹¤1f —X²¦µ–($Ý{/2 “Ž S7L™“¾ 2k‰Y„š°ßÐ\§^Æ×1“”†UýHãq…÷$¶iŸ‡;äÂà–®<4‘,2ÓñüýËÎïóÅ0Y\~Ükôãç@)Ã.JÙéÝðµNÐg«œÉ.Îêq·5áù¢Aâ²II§Åª…€ sN<†ÎMb¬~ò¾£ŒçeãV½,Ø[X?(Ekœ—\ïú:šïža9mÂQ‰øÓaÈó-øÇšèTç”i»(Ú—¦ª€ <¼²v+Ÿ±¹Â)éÈ6í‚U жÛv j̼y˜p°[é~ñaéÿ•[ÜÒ¯Uk^ïží]ùŠg`ê%…äŸ q6!‘.ƒ‹+*ºÌC˜)Vׯ®²h¯  €&Y:oj 7Æ|Òj½äâRô%±’t« d ‹¯…E5OW›¥3•*YÓÕ³•‰Ø½0Mp÷jåŽâmLÝL“õ™N‡cÛÈÈm:|µp\¢S-"P|Ne¿U‚å$;øñI…¦»Yõüˆ ‹;¾*Mª@°{14Vð¯Þ»zC‹xú÷A&i§’/kO©©É¤“RêÁØ%R ²“ÿ`çq n#º'c²~܈LºXuÿ0]c{*5WxâÖ!ƒéVt—u-©|ŸuœW^æprC¡»¤Ég½Y¸Eš\êÒµE¡Ë–ŽA9/ªƒçû_»7XkÛÞ ¼ng<v º;àÔ¯;q±›ŠßíóMÎoËëûrUq½–ø¶>—,»t2#>x_[Õ»–¿)óÙäNÅ«X^og!¸ „ix1é2!'/F|›—sÞü蛽–½9²>ÙÃ7ùaFÞ}½ÿ© 185ýÿd0ÊÕºéwÂ@$•›ÑE=9t±9]š~WÚ\õ&É6ë¶<¼‰ûR¯#¿«­¶—r]·€ØÈþŸóúRòtæX…*JgŒÁäQ¨ÚTã¡6°ñb­îY4Y”&ÏÄÃGSéÑ`cÆÔo:¦2;¦ÉjÁxd†À„VC°Å6ðy,D#x±æ8T—‹±Ð•TðœeœÇ¹*ñR©R;ÚA Ž€µ<_<–Óê%N³?x7ç2VÚVSâ:4þO'hŽxO÷š£ëꬼ ŒOŒ;•±“úõû›rÞ é!ý½•“Ôx…7RH˜Ùµ)˜ÌS°Vxe™ ç€iÆŽ᳊Mf!j.Ó´nó–cb=yh¯‰Þßb"üã§ÍF^kuȆòénÚȶ.º_ ÂåûQÑÖÀmÝö_‘éˆh×”T›…¼Æøfáeas¾GòÄ5wÈ…Ös Zëþo'Ê$Õ‰ìñç ×°cT‰TÒ¶Ó}š.âw—þþù_rˆhendstream endobj 483 0 obj 5846 endobj 487 0 obj <> stream xœÍ][“\·q~gô#˜'Τ¸'wÀU~ˆd+vʉ‹©8e¹*K-E²DrW¢h“©üøt7nÛÌ,©¤b•Åá9ÐøúÞ€~x¸oâáŽÿ¤?¿}ýàïÿà>û`øðÿç~x ¨ÁÃôÇ·¯~þ O¶°ñðÉwboñÐɇÖë ^>yýàO4øÿ??ù'è¡ï!w½ žÜ@Ã/ŽWjs.qøÍQl!xÿp”‡ß¯Ä¦µqòð¤¶ùu|ª´?üž*–¾µÁs)Ã&›&,#ŽCàÀÿßùÕQoÞmù‹_Asi6±û×Gìè¬;üßû ”8üîx%±½Òrƒ/Ñ@8醯Öçè¥ÂáÄáëã•NøÃå¶ïf‰=žbRxG}ÿx”‘\-¯½®`­N„Éöêx¥µ‡Îæp Ëÿþj̦¤Ä©i£¶Þ¼„¯ÁÔÕáMœæpÚÝÖ×ß `¢ÐùÆú Öཅ9>£çÖ÷•›±¾œz•îµCýUZ=ƒžÖo†~æÏœ™Ì¨$ÆtNØ,|¤Ë[¹ ‚‡‚ ßáBùÍÁl»^0$È¡³lÝãf¾ÂÁÿm/r"´¥³sîx3™è–ßÃd‚ǘà#Ý¢ÚóbWs0&@x§i!B‹Lnå+Â4ýÍnÞ HÔ–ÔÝôöjU)F†ÍC¦=°»¾Œa3î3´ï™#OÞ,—‘ý&!dR§ŠÒzU…ªâ2»em‰‹ø)M̉À®öe³~YÕ$SµJî´RЇ¢„ܱo*î`LWR‘€c(»]ÐK40ËK©X/x{~4-—h48°¤Ñ ü¤Oσ½ãL’ºåÅ‘Hc%ÿÄ]…ùuË©‡Íœn’0Ù3•‰5"µze’ñÅ$¾lŒ8k=3uV‚„¾ÍนqÝgµ÷›V$&\*™ ¬Êçÿ« (Ë^' ‚@hjʪÌ1`Ù¾HÚËòù–‘§úM<Í4À`Ðæ0$kÕi”¹J4*$¿B[\]¨ɈÚ=|)3 )Ú6ZÜÙ5X”$ø‡Æ2‹vÐì¯Õ"ª Ô¨ÂÈ#ÆwYöXÖô66 ÞLU°73=¶B Wy€Ùv.¢22ó6ÑЊjÕF'¢™|©\ó®š`¬i#aªÉƒ¬i…™9¢‡{2š'È"w"LËtâla“å1pãÁ¢e•ü9kæîÑõT |8zíšÇYƒû,â/±>x. ç¿9‚0RB 7W?as» æv×’u’òK$2ÒÒçf’‚;¤M\ØŠŸÁW‰^€,¿žàñY}Újí,êqyàÏŠÝå}mþžh(‚’àh5Á½o-¢8G¿¶ËI'µjä:‘Õë›iXš wC\jDö¹«lÑÉÑÖØ›±ÇsÜ>I¢ŠÁ ¾§À[I&R”e‚¶±3®ô:ÎÇy”þ"ÿx3ÇΦ™õ5X¼Ö¬9BI:°pqç ¥y é~F­Güäý&uf¨7iÕjn)A¯w3+%àL‚í“üiä$ˆG 8wS[4·—²…’L•;ýi²‹Ö5—C8†‘¸ù¤?Ù(© T=çÖ†/#/E"¶z)Ó9@.õ{±~£€• ŽæðG Ȱî_bOO4Þc Ñr¥G·©±ôÐ ð–ÀuתŽÎ¯™bˆ«æ(6¥õDÒ€¼@%ˆ%Zy¢l ÓôÝ€ËV«  ÂI«Þ›Óµ ëÄQeÅw©¿‘äEÈ{ûÜ·Ùwò b܉ûFqS§ 7¶2oàw‰¢™FÎSŒspŒCIX(oz7ïe6FÒ¶ïX CŽ;ŠÔî3´~}" 0¸Ô$éý…øOko•ÉÝ`saÈk¦6+hðû£{Þ×x:‘o–*$[sžŽ"l)~ døòLç¼iá`Ú1ù^=ÊÌ:¯Ñïïˆ;FdË‚ÔÌûÎŒõQ Êkßd= ‘÷*Ë&œY¤qdçg(uÂ!þkÏÿÂ`·¨=ü¦ëΤ†ñõ.<O”M_Ö‡¯ËÃgõá›òðí¬Ïmyø¦>¼.1É‚cWðiæ–û⡟"„hÚ ß|?›ç«Úéiyÿ¡¾ÿ‰w2r‡ßŽŒˆôþÇá'†¬A ·˜ ´0Õï<ù»Ë·îDzz²u›ìY¥L»+ñpwÕÿ“ÝýŽ?»_Ï6âålÏë˜uóokË—³)ý4Û|6üóº£WQ/ Ò,úÅ&¨˜;½lVÏÚꀱ‚ð @ºJSiÍ\%íÙËOHâø‚ðô¶€êe•)‹'ñ €Lôì-ž|ú×È•€´à1Ìc‚~*nêC˜™¶Ù/êûgé}è&œßËúþ=ñêÙfogŸ©èûqŠ”’ÆU>oæ^w—¤Õf] ¤Þq.²cÀà7}èF1*^_–ÿ¶ò¤<Ä$âÐÜb<Ê>÷j¶àÇu+i¿Ÿ1á]}8•ÕSÆ®;󗆲u»²€>‡YŸúá'’{¯c=± ù+©í³JªÓ¿®moà{7äá…E»¶Óú,áÛ†r¥Û)2ñôµ›šl<ýMrØIrâÛì|cÞÇxB¯JçÈF¹îÌígvÖÕDnxî>.Ã7¾t–ž1ojÓ3 œ´t×ÓûùD&øà`•!~‰?=ï?óWGEn¡Äð‚ôŠLTVSpMÝ{£•QûEŠ'š`¢\ƒ.ÛÂv€< ×¹hÒš> R½çm*ÿ›#~B€ËjÚ/º<©ùócËs÷§.Ó£Œ²;2ß¿¶©CPª!ö‹6:pc°.æ~< rÍu4f[Ÿ@sµ¦õߥ Y:ò(£Š™÷!Ï𑉾¨¹^þ5­‡L啸”U;²h'YK•/,@ưÝ刌Jõ ’qš0jJ ¼eâ|àÐØ0)!UÊËŠÛ6WBMaHÞX=‘yÈMÒ”›m¸`?[gÓ`ç%c,&{Mßšf6ÛpVLù>%:‰ÌyLŽ[ÿ+1oÜâ¯)Ú–|QšPA¸´³§ñïyM Z‰yŠÕΡ ¸ô%+™ÆwÂN%Š8ÃÇ)¨ £:|†sÙMú„ ïªì~:͵ þÀ><+I‰p]#°VYyS4“™€?g¼‘ Š þT¡Ç?¡ÕcïFðL¢‹DÔÊF‡×ÑÊßZGg ó"¿ ÿZ^” ëR¦ÖW£E¬f29—õܱüCNá£ÔW”‰øwh jίëÄP˜&¯9+ÞšTãv¢Û8 Z´¹C4:+š§J8â9ÊgÁ‹è‡]D1ʪßYY2cþ¯Jű²Å;•̧¼'‚Œ!d+¨ç)ƒIƒˆg¼U†¨ ó¾:»´º"æ 7ù^´¶V›…¡æ'²4†[Þ-Ç•Âd¤QË;µ|l*¤™œC¨£œsšüÓ$@Ø3‡†93<·å¯S½¸gÍ;eSÀô—}ʨK‚àGßšÙlSsf"nvbómD6||uuQU'e8Ãá›kƒ11ŠÀŽPÀÖp6ÈXô¼ÕȆÑÞ[£÷rËu÷Ú€¼¿«@³‘‹ž'\ÒÏz±`îûDÛwQ¯>ÏÙYDœ>6>–ÜW ²ÂÛ²a±8¹ÃI.ê2h¾gI†î\Ýk{«zvÐdRìrÛ²ì+^^?”C­ øåZtßMšk¿ä'EÁbµ™¢êã\¥Æ¦FÁ63©µ£Ž¥¾-›`˜\•¾Ž±ÐWÑ›×,a¿\ý‰o­Å%ÌŽÅ_MERO9:³5­Í|Å~Å‚2!úr $eÓjê`ä¬QwcryjfÖ G1Úòç›VÕ$jž¨'Ël“\B\¯jÊ¢ìýük`!ôA˜KĽðLLÞ¥†QX)ãÔƒblz[ŽD%t²9›;?ó0°ñά¼azÄ­zÀ’YäªfQÒG¯mZ›cn±Tot:°3Æ›."w**¥ÐX4öšsR¦à¼µÙ„êpL£–>øDô”ùœöœFú¯pÓ¼#_§–ÕuÏnD„Ùî¨rö¨y/pãÕiEWfæø™ †‡Yý§š‡2²+¯l#¤…GÿFS耮EHeoµz#W"íV¥u×­êMÎ4KWê&ÁhöwŸ™ÁÞÙ>@ñ{ ªZ¡²ò»ö@žvÕr®^µ!îÅQµI™[+qY!tsôÐÛûFã!X;I~d8‡ˆ»² (õ5†ãˆÕÑ¿œýœ¸ #OÅ3'ÑyS#ÏsËÚ,Ó2®¦ZÄ{À(ô;'0¹°¬9+êx8öPtkEØ{z&м\”Q@±q’r¥®áíÂÄß³tXÞ‘*«¿m€>U&3uËÎV% ºcûVhÒ—HIªêÕg V4£wƒfô$â–jÂÛ΋í•ñ‹!Lˆ3 ¥çÒeRöQo¸Íɾ6ûdöîròL ß‘gýL¹ŽsäjöOÿfê²3 ‘`È(ºT=L¬f 0«Nm ‡‡Ó ùlñL©¥C  d÷Ýd­¦9þ[3³;ç‰Écw‚fÍŽå 4íŽwŽ'•˜Ä®0¬Ú¡[LÛ$‹¦°¢Ñ=fZt Î Ê*ª@ÑYhQ9*¾­¥,ßYÉU,²XcˆåXÿÿhú)ÖC6=Ô¼†OEN  y¹_â–çåKr_fÞ Æ‰ßVÌ ·g÷T;ÏM„|†u~Àéiéÿ•„lçÊ@XåJÇò#œ-Îeû€:˜ícHãçË^òþ&õߤªrtÜaþ]EÏUt&î_@>¬oŠP-4\ÄìR]EŽ¥Ûä8S¢óÀ¹ñäV“gÿ¾ž+ŒkN%VòÑÌe«½› —è7'[b#W‹¯ ¡W²œÆ7}‚eyz%}ì’L m­ò/‰câ1:B€&Ëôðíšß¦£q³»c'O_O|ç7½(ˆÇ›xq=ˆ9¬à·…‹Þ·Ý—Ýy-w§wìƒ×Ú°Êþ¤_¡¹múw8AØ}¼CjkãÃæý•r@›J0aŠñå/¼¢_¨PŸÅ–tÉ€?ÙWjÎtyöͺ]‡c£`pbUlB¡hx¿(ˆU`Dëñ‹É'zÄl`»Ê¦iîþ²Lˆ=| Šl¦<¥<¾ÆKˆ ¥B÷ Z¡¤£zè<ÔÛ#&; c-™`Ë/Õc½Ïô2ÍHœ^qò3½¡ö¼«xáQ>i“LTf>Lj·-â’`‡zõǪy¢‹Y¹;㣉oA“ݳ:±¥EŒuÖ¦nÌÇXC[rÖâq¥Ö#ßc4h~<­5™£×hÔD ’ñdzm»o‹z^§l¢øY<Ír 87Ȥ•‰Ý.ÕÇïbQ‹€0+±Do_¨¥: v’§ÿÇŠjdý%‰‘H™V;°Z¬IL§XMG¡9ÿeO4±Ôh]òxrVß sÉ9HЧ‰ñ™5½¾˜)„æ «*ö,#3¤ßñ‘²‡ÙT Û²:#|;la&ó‰Â.ž-T1¤zÏ:hô¾Œ;|‘Â1®V£|lîžjj1TÒ+ÓgÂWl!ב»Ð³†“(•²]l…KLC²míJ¹V—µD‚´¬1½„`bGÑYýpÊ—ŸèÐ ‚] ÁR‰éEð²d7;š÷ÈÏðkx\æOW@t9w«Û§ŒÝeÛ“¿é¶£‰ÑFál¯&F“æã˜¦¿£Bš•iî4»ö%R32„a¾DçÒ‘ÕáÂo dvGlô|,3ëó±{xP…¥Ê›d”~šk ¶>lžo, Óp<ÏH¬ï/J$iC07úœ]W‹¨ÞMæÒ)B—^\h4Mà]¢MfU+9—èM¾/eª~j~íÔ‰äQKÅä$Ž¿Ž_ž,Ë\ÿfv hÛ3_åXóãiF¡½Ö%oç.+¦Ï%ës ÁÎjŠr5Ù2º «PuÆuÃIPå¶“ þ÷Ò×9?~A”2ßÛµ¬Äb7š 5XaиºT8Ë’€“:Äì9ìšb#'JIyö µÍãÚëÎÁBRN&„‹ªÛ9pötëǶ:£AeÅv-wÃýó¾4u»ÈÑ^x0ƒ<³±÷H_¿ŽnL›l‹V~v/j­ Sê Ïl´)Ì&VÓy²á†Û*ǵ„@÷¾~äèˆ&Y3}éâ æeL•7gÞ§ðñU¢P›çýø›‡ÚS"ù’A¦FÊ Ñ“2/vÍ×ôžŠliØl—äèìúÞ•lÓÅ~â9Óä^9 h7®ŒÁtkÔ§9ù—Ú<¹}¾Säïç¥ËÉé‹VèMý*f<4Kc–é4lÛG²¿ðä“] 뜻¬«†Š%ãÕRÌRåú‚¬Fp&õwy9pLåciº•uEã‡d¯/†<‘`᥌lnµòpwsÓ®‹¯¡ ý"-×Nê>Îó ;bºÃŒ­uryiEŽŸ/ù;½?鹉NÉp5ú%ˆ½rS@6êÄRóöµŠJü<§¨„ ST——84¿J^xÙ¤—\i™ª.¯'FY"P«n¦ØdwuåŠÈARÚ¬«éM'OÎ0@S2oAµ¶3þ¦·‚±$TeçZÚqêá”õÅòSy ñtßçÔgý×)—>~›UŸŽ÷Ö¯°žî…Déâˆñr틘12ˆdöX,À’r]ÊzÚ«f/ªê)×nÚÑäY3’~©²=›_;¾?Ÿªêx9ò2«ªù%5'È!Áî]^—ÕÊãÔPm”AïÃ5‘Ë{WgÛNšx-§Ìú·¸Ø!±Óƾu(3Šüߤ7D ÈÞìfÈûf5ªã"FNá¤Õ‘º-Ÿ”àŠBûØ$íØÚëvtš8OœÕÞ_Ÿ©Ò2ÉêþúdÛ|Ô õ³',Ö‰¿î„ŨR5ÒÚûiö™Mìf\;ÿŸNx{“xøoó ª 9ùäm[òþtæ•°Ð?Ju‚§> stream xœí]YÇu~§ ä/Ìï x/»öj~° ÙNÄN4AX4ÒP#ËP åH¿>çÔzNuUwßáˆO†@ð²—ªêSgùÎVúöj:‹« ÿKùæÉ‹ÿrWwß?™®þîž|ûD„®Ò__¾¹úÝ5<¤\9ÏÓ,®®¿zßWN^Y¯ÏB^]¿yò׃?šÃù(ÏÎ9uÐá'ç糜üáÏÇ“:K)­=ü÷Q®ñŸÎ‹Iþr<‰³ÖÆÉrGÁ=§8âß֘ÿà3Þϳ9üþœg¯çÃ'ø(¼«æÃÀ›¿…?ÿ¯X«­ 7µ„›òð?G ãø<ñIœNi/Áûþ<{¶<²ölž5­Å{E.þÞ—ö,=¬"_+Ã[:Ðÿ6Íbr‡O'÷5|_¤Œ›g1žI˜³,ôqÖÑ'>eáð »þWØ>Ø!²}pý<¹¶ðú6mÛ|4øä)ß:©éìÄ<Ç'Èn}}”îl´³‡÷qÍÆˆÃ÷81^øÃs¸*ayR¾É¬ðÕñ¤gwÖf>üKöÞJ•O~‰÷'@ÖwÞÖÛïâO;•9ñêð’F><­×^ç·_ÂŽk-¤ÌãàË7ðo€:À Îê2+<Wå”:܇‹‡ß×Mh‰ö‹lÙ:² ÆÕ¹³Ö,Ÿ”¨ä¬<ü:]‹»£=݉äÓys¾Â™¦I–<ìôº\|Y/Šrñ\/²×Ó¯êíï{ïÜ•‹?׋ŸÊÕýK’ƒ%áO­<}ÿ‡£I1S S™ôX~÷øXh66S*n¢™æÌZØ12Â$4¨"­lÚ\/ÅR‚fÐ'ysñê§u$ò@Ù\}ø{+îóltbCö+—r°Â«“P°êIÆU)",ÿeáß{δïê3ßÁ*ÎJÙIv'<?µB©‡Ï3 ®ËŠ úûiœ*YÐAù”ïà­ŸËÏ`V3sùuÆÔ š6°·ôb£” «/+…w¤?OB«D Ü”ê×8˜?Ka·uˆžà½‚'%,OôF™uÍpzÙ¡YTO•f¸ùö~.¼ú,-–ñpÝ(-5È ¶Zϲ¬xï¼ë½ý¶rmeÊtQ:Ï¡ ’ûU|Ðj[`où8’"›7Hû8]å¹Uã.)º|üIJ° C‰ŽAˆÌì#9‘ˆ %#ã•/ÃcÕö¨Ây)].?~‚¯´€@aÝRÍou$©Îòap¿ÓCÛ§¤ ¶ï¾~ç "ôÜ"ä€9ÖYôyÄ!¶–HÂ=^5JàÊÅd’b î›EPÙƒHKaéˆuÁý74Ê# û¿ãiBMáfÛÖ¼;…H Ä4f!©S×Ñ¿Ã) ŠÍPÃDÊ‹°ï‘³á–InB¡©‚„Û,¬IÁâò`ÈÍIŒ¥Œ}W%Û‰OàþÙ:Y%cI%.®„`gfnµNè)–$sŠÆFúц)õû%Dš$(Û ™sa{p`9 •[¤úèGøJç•'׈’Ë:}Òcz:ýWÇ I öo9R“jÃj}`H$³ï2 7³¨Vµñ­þ½áÿDÝàñChüºjÐOqvDåzC^”Í.ÓM)œUkfDà'š}{†| `R%³Ð0SBmh"·¸20 3$á;TÆýWPØõÛÀ®b¿ë}‡åkE’ÊÍÂ66 ·W²ìÀ4a^˜4k¡†P2n¢$nÏ'$µÎA[$Gm÷udÔYNFéeâˆàž£­›|«›HLÔ‹Á·²ñëžY/œ2ÚÀ! +ÒÔd í9Zwá%ÂÈÄÍùËÑ["oÑP0'?Ò«‡döé­q ´32•à ÉÕû£ Ž‚¤²AJ¿+Li ¤܈r²Ð$„ážÁ©GD$  Œ“"‹>ýÅ€ö[L_‰Wm¥Á‘©…MÉœŒ[ ÐþŠ^ʪ!Ü¿P’ [† uP!\„¢@$*pVÈÉáÚ¸B äʺø'\™ ~Âʦ ÷ñv}ÏÐ[¤w|CËKøá„YG)ŨÄ4£oâž"@"9Ä6¼]Ȱ#‚fkð{X\'Ó_0E=™ƒ¹k³0Ÿ ÑÅý·cç)H¿ìë{ò5÷êïk•Àýp£Ú2Å–‘Êf¼1RsDû…/ï+ãžKáÒbŽ(ÛßWé&<Б±ŽyW–š÷ ÂLû©ŠmäýHn Æþiõ)â~É-üyò §a¤Œ˜ôátÒo ®ð[lñ`‘¬Û4†ò̰4¶çR<´å_'Õ¸É5NÚpMxÛI"$ð »p™ï…(¢ò~ÇìÏÅíØÖGZi`B7–ÍD‚§•Û_w€ýËFc#C2Y€i0¼MØ7YGgh` u ø&mê½5W#ãQ´?‡R_ô–K°ó=Å–^:M·É©¬ÒÁÆÞ¸æ›8B!5ÒÂ4 •á¬n³>"Ïg`ÀóA× ØËsK®[>Ð7fìউ7pÏÛVÃ$Y ”²baÜ‘<ÕºG'ÞKtë¼{N©ÂáÚaà^)Yêmú°kÌï90Äýªl^­Ñ«àº:WQ¿¶}AªïTµœ\ $7"§)–޾gÑ^A…Ñ›£§H8–i6‹u‘\ cP¡C dÝ:!e¦¹àB•ŒCÌÄÚtšÍœg~ž¢K,®Óðõ5è0d6ÄôÄN1¯«©‚Z(÷´'#cD‚QˆM¦Ÿ@E4æ,Ø/I`x5fÞu“–þ[Ô„ÜÒd ¯ƒäÏ€åêC"›ô ÖÌJ“Ø=âø$ è$Eß8–-ôøF£IÉë–ºém¨ªD+Û¶ py;“O›eôž„Á'؈(øÞ±]&: q> ç}À³|ï2°G3°Ñ˜HnŽƒ³®®ãaJŠ2‘´Î¢À{¹] Æîa¥màÄ­]Ux㱬l©€r‡±å(÷6MÞd€‰ä¨ïD‹ím¤WT1n¢¶áðv2‹Y2ùàXÌyM ²~9I™“!—i"«ƒéj”ã[×D&†3³&2Qª‡cšé.Áé°>䆇à+Mü€˜.‡ )C¶=ì¼Ô’‰€7‘Vº{²ë¢}‰ê^à”+ÖM‹6Ï@¼‘GSt>¬,]ìÐq7æ Ó^´ëBr¤Q©ù‘âvà‡r|´…yôh …“NÉFr¿(N~‘Ƥþ¶2êëÒˆzÕ•X0æ]×*Ô²ÞUrÝ“oØñS¶Z ?н#saö,­…sóW’:©€²0)&ÌáÓÿTÊ ÉÓÍ‹!ŠÛÈeþÂZy‹Òž]ÄZ!Øä­÷ ƒˆ¬Ï7|Y¸EÊøò­eÈÿ6yàmýH"ý¼ÙµÝÄaŸ:.Ø‘Ùk3}›Ð­Daz<­ã&Žƒñ³ÐSöziè4~*GŒ+Umè¾JØM²ÌB¢J péª22ÓbOû#+~žüÞŠo»WWÄò-!å ‚LtH7Ô„Ë“÷UgõuSª¾ èTû—kwG¦áƒݨ“ uÊ>Ô|‹~Í÷ÒA”«­dÒgÌŠ®:Âó£!’ì I^ƒƒ ˺®qIy ®æHñ²GÕÙ§æ¨vDk`Ì% íw2ÃGºÃ€ç†„ÓQ…J*™Â;nF|’•n M¦½PS ÷‚C´Ç6*ŒÔ&‰ºË‰g› ($î~â^ÇO®dI¥É;„/q´ZiÁ5ÇPª "m8–¦…§ÁcA'¸`ûè)g½š4Ä® ³ò2(²¶"T³º&1ÌÑ)&´[¡…v–Í:H!yg#Éžì M 3 PmùCNÜ,w ‡Õ7,EK48˜²ÈË<†—̸=äW©b:£›X?ÏB‹Ýužá¾Æà”¡¨émjPg¯‰¤ÛšÏ%|['¸ˆÝj’ž™%„Iµõ“ëÃo޹g*ÕFD‚päRÊèÿÆyvŒ¹¿’±DQùº ÐgåÒ´3Íò4È}ì4êa†rrz ¤·¬|z(6¬´3+–’ºÝ¬mÒáRXˆ1™E8ÿUïuõãÈý8Ò šM‰Û£'úšúšÜYʶÅÑØKöçS&zŽÑ1‹8O†ßELË=EÀQ&ƒX掛ÓJRš4cT/ÊÚjçÝæ¹€Ã®Y–ð¯M³\†GÈÈü4špl-+'(Ç©õàfÛ¸QF%JçŽÃîn‡'«ë+MðSHrí*;nQ‡>}Ç $äb®¡TMsF©hÏMįë·o$V?/,—|ÝÙ÷Ð rgÇ¡+ø“F7ÚSÔ‚àÔ'ï6Ó@Ÿó0ˆLlù”‘û´uw.ß4¦…üÛÙ’LBî^ "Î=ûòpɳúœ¿—šC´“YÄ~¶º'd’ÖÁÏP+ŽSï`‘ô"ÚŽ™õY‡c4oXX:ÁŸESHã´î5$çàbê«o¢Æ$è=4Ô&”—¥M,ÍÔr޳SÝÒèåI½irRÞFÊߊà4M"Ýð4÷žÓ¯rŸuA£ã5Ú¸ñÿ¡ ûm6Y.€Øf³yðD®©v³8úYü*÷´£¦77Jšw¸Þ'Õ:3 ˆÎ.ƒlñ”PìÞ.ÁéWä¨ãtè!UÑïÊ<Oë-„VÎóDÍM¢XñiŒÆ2Iz•(¬~:w¦ÿØõsx‰K:!4R`‡³Ÿ«³aŽiž—Ïp?"%ËQ¬,o$;®‡ϲèÐpÝ'×OþþûÜÂÏendstream endobj 493 0 obj 5343 endobj 497 0 obj <> stream xœÍ\YsÇ‘Þgb_<³&šuvøauXâ†,Q´Ö®¤ˆ/€a R¤üë™ueuWÏ$V¶&‡Ýude}yVV¿:“<ø_þûñ˃{ýáéÕ8üþzðê@RƒÃü×ã—‡ŸC#©àÉE”‡ÇÏRoyèÕ¡ f‚—Ç/~Üĭ݈­ýùø¿ ‡–¼‡fŠ:?†Ÿnôä}ŒróåVN17ÿ¹U›Û#9c½Ú·6Ÿ§§Ú„ÍCxªaØM€¹&x®TœT×ä‡:ârøk˜ç³­™B°ÆñŸAse')ÂæÏ[ìèßÜÇ÷!j-7_m¶×FM0 „Dÿ;g½§—‡“›ï¶G~x6ÿ³U“¨ÄÇ[à˜’ÁSß¶*±+J3iãrë(³ë–êeŒ‰kÇñFX¸ž„”*n,'•Ÿ¤ÁÃ$µV›§øÚ9·y¹@YðÑo.x_[^ÔÞ'ðKúüyc[£5ô=ÒA¬Àà^NéÍóÚ#õU0]nèb€eI:Zɤ©½01RK¯' ïßAK©qoÎ=Ò™Fî96 “·R¾Þ‰É:­€cµåœpel&I;ocŸ"• ¨ôЇ¶Á2‚ëˆïpn;)Ë­lL¾ðÔ%í[/°_Ú ØÃ¯ŽÿãÇÍ_f#åY‚ƒ¥) "D)¤Ó(=\ü2€±%PÇZ¾Ã÷°+Aeh:k34C„– éA À£A°wÚP/€M@ í/ÎdÇÏ˳+x”[6ë”Àw$pIe:@þ¤î ‚'¬”çOpø‡ŽÄÈ,tu‚Öå¬5Ä5KdªÉ³– *­/°±Ÿ”â#\àCË×ÖÞ]!G¬õŽ„êóãƒo^jNÒW°žp¨•‘“‡k‹ƒ üäþÁ½û9|óúíÓƒ{=”÷¾Ä?>yð)üuÿ³Ã;øüþá·7T„R;œf&©Ç¶Ê›ðv}%Ö°ƒ•Ø4u+«,änÞ6éúo°Î ì¸ü—(¸Îié[#;n7ÏpLЬ0“•4¼1Ï.dƒì_¦Áè²De´œË©‚iBCp§)ìÖúi¨u– ÚÇO1x»ù•àÓGRG ¤WGØÇÆôö#T<“±ÊÕUÂÉX ÞlÞ6.\V&?ï¹rZDϲ·¨X t vÙs8#Ï Óé!+p:dÎ80Ug#5Ähî -h%€1‹ýìôEaöóÁÖôÊ¥®¸m¬Dsÿ 5ÆÁ^ô#ÿ¸ØÂÚGªˆ!î w €ì:Ná½5f§iMAˆSÄ€¢¸9Zô@×®N€}Á(,´¾¤ô5’-×Á™»7D_¤­Qq糂á3¼tmʹtäÇOš$ÏåÁF+íŠÑA›xÖ´ýLhqJD’ d HäOF›÷ M™µ`èFøoô!FaU**’&nË”w¤\˜X «RA Ufc^¤‡È¿'#È;á„ë÷ fdUWDF•„’f£(˜AxÛ¶ºŒÖ’-ª³"yþP´¥ ´õôÏ¡©ákä ø,ªSœÛÅàHÎO›ŠÿNédn91C{ÆÌT·/?mI`Tñ®)×…3‹#°\X?\x%,o*,±A³hM×9™Ùn”U©3}FêYŒõ ÖÛqHS- ë¦\à!èTÄ)Åð‰o½y9^82ÅãPüÙ‘šèçîs)ï²´…“¾¸ê@‹—vÂušâšB£• ÍØ,­„W>§‚qj¿fl2e¦‹¾0ŽÚå–W\-eÈ&wZf‘(À苚Kù”ßòíFNN£†LiÛQ¢ÝµDûý­˜¼U2ž`O)éøµ®&3ònE¢ Mr>>*1Ëðphdþ®hºó¦6ßU’€IYdäCÔÛU‚Šâƒ YÐB>PHƒp¥õ*¹áÖ´b'UÓ °õ¬j–}8o&ç4©ÍØ¢°í’^añ‰É â'·#þŽmçß'›‰£½­dÈöµS-kåx·ݘ 1BrLÐuéêvT™B {V£.±ð¶r Ó†ŸgJ÷„Fü±(ø ¸Äå0‰QÈ#Ûtüê"G>Rô'’¨Õ—† VÕ<;ýÜÞ¼Ìý\,S!ç™Ï¦MJæ­Ù›™0in¸×Õ ‚{·³•±ä3OÜåó¦¤ÍM:ØÝ{€§enìvmþÀ÷šÀC°2‘o ¶mÁÈÉPP`Js1%ü (ì-¸ùÿx\££†Â]&¤¾WåÔîgX‡mQ¤Õéóm}‰ <© $@"½Xß?oïÛÌØ´­ <1£½´<å4–‡¯Gc¾©Ïꯗ£ÑÏ[Ÿ'Î'œ¤òþY}xÒ¾Ñ ³Cdÿ %˜2êrStEž&Ô[ªªÕ±tú;ïTž&ç<õ>ÂŒÁoã`nÀÿµËÿ6’ïׇÚß3›ƒ'ä(±5ÝfÞ7H^vïóÃÇ;óÃg£‡­Ï“¼ƒÁöÌ(}^ަ|=BÍ_ܨlÌóè–I=Y€&ËAB/ؼimÏ:úËÏ?ÎÀ”æïMïo ¦ýj‚I< :XÊô‹úð×&ýûðôl4ýëí¤o–_ŒÈk3½!óu¦‰Ò³ ™ …ÐÒi@iˆ×aÊ Výa8IàHõ§<¿18Ô._4Í7Cpœt÷K¾eÏù>[ ½ÅŠd¿ªߎ”ÉëÑŽ7Ã2uœEÕ Æ´¤ÿåä 0•õ¡h-E}x·=ÜÓöFâ1äuœ pm´"²ïÛ0ûš^Žû¾›‘É”!¸×3ä ­àèÆ†<õþ§Š×? ¬¿T'¼&b8)9FN8FŠšlu†5?üe$ˆw›êÝç îsOλIÛ†'k°y‰†²G ”¤ÜÃS'O¿ß¦;Ê£¾…Ñ„Îæ {-?ð†î^õ¯~´zKź9ÅBøAÖnV™NÏ „‡`[.ë„ n$P³D¥U0ÚÒt}MÏ|.ãSEÜìw¶³cIˆC•›Ã“VÖiX<€¶ŠŽ©Æ•uú®FÏXGå ãBPb!z^,+ÞZöç>Cª_' %⪄¶TB»µ€ø›î Þ ðè0 €(ž;•óà%…ˆõC‘OôUËTKm=¢•§ÃøÈé Ók,wžÙ”³U¤Èñ8ÌòšÍZÌ–ÖÚûöÿ·< Éé*%eYs_7ÍRm£ñ ñ¿cµ"Gø ùYÏà€gQ½Éê<õê½À· ²®ëÔ›ºemƒÂÏ }˜¶”˜ÕG³b7V%ã³öXV° À¸1T]—$AT(˜¿èÁª£Ò’Þ­Fæ¦R£„åÚÑÖê¶ÿ‡ûæ*ËáFyi ­qswÎ{ó¨?ßœUî"v\³)ƒœ÷ƒt…¦¬¸­ð«÷˲Úq­HmšÖމLW8P§]=éaÕ›³cuÜ¿ÝpÝW€e³üº‹>éלÁp„R"YyðòQ táî3Ôâ¤àgbù“›´©·óK[ùPËÛ3n¬¦z%§Þ–\2Ôv}@Þë;CÞ2ŽâŠÀ!wš/-œºÀ %aŸL\¶§ì4u5ñÌÚ”ÊtÕSaŠœ5JEšQÆî@!ï¹­oˆ;½‰é6Ö¥+iCÕ7;–ì®ÏÉ@d Mg8Kï,]BH÷`’…w¥ÝÇ{W„–þ èc½+ &ž%£VDrå±öv*ÇüöJ¤Menûî9ô‡+•ƒ­Ô'[—h§¨d«^ØÇaU)–„TcÍž^ÔÂ`æ8ò—–dpŠÏð\¦‘µF“®©Å-ÊðP”]²ÏÛÝU¨bˆLdžš{uzT$Ú¦¹Ãå¹'%ov¹­p¸·G‹—õdô²Y¡Ü¯_.JZ­H»§é$—„Vú±(‰ìëÜNz ×݈ËÅJfÝËmK³ÔõÚ ô ùN—‚‘LUwÊÎt~ìÕJ'…J¬Ù!<Øt¾Ô¥ý²Q6†Þó«ã¡Bˆ‹NìJL£UJy a•ÆÏÔ‹mÐ] /¶ Ê_g€ µÛ‹H_]6¬uÉ·g Ê˱ºÚqï `Fصv_­ìÈnõÚ±êÒL±6 mU/ë!Lçz¹xòb-Ã1¾®ô«›ÏËpJ 2ùÑPB:å:t‹ yÍ·rvdW\R Ö7ë˜E dÓ¥¨B™¬4·°¨†×MgÂ7 gVR¤,ÅÕû¾í" mµ5‚z„‡j0÷sŽáë:P¤l®ë@Ÿêyy!¡;A×v ›QñB^®v(ΣZ¶j‚fqNâfoWÞ°0§jºÕ'ëî¥ã%ýü‹#‹ …ßóD3#»$va"ù‰·e0Ž;…m;±~­àä—Y9ÖL vª‘È©¹\ò¸Î•}”s³“jÝTëê6Q¨á¦(’­žfç÷¤1]»Y‚Eå; Æ2O®Î°´rá²Rv©îzœ3ƒµVÀ9»“¸sÝË99æø¨Ð"_e.,Ížy©O5Hkµµ©¨¦Ösl3xt96㈀“äöc¨4Bs§±gو̆- îÌàÑ•§j³ÅJ‰„˜ŽEF®ÔS¢Ž´à×wQüÌÈ22‹Åê6—>ˆmÃŽ¯#–Ä-±J̯#¦Ëóî–Âv#5•Áûi5÷¥mÊùî®Ñç8Ú¬£{wmÀêo- 3‡ÁÀêý(B$¿%a){Ï[Êåô›¨æÖÆëûM#)¥{ nþñ‹Õ›ÛTæËÅ`©²ú¨ø|±¾5ÏÝÇHò1n15Vî³?]vÙ“-+æŠÌYse’Û’&ªä Wþx©5f;Õ{êtûcÇ=ò\l½0¼(+Ùð†0 4¨ÃG—>1PnÏ2ùNiu÷i•™GØ>ÓÁR›xƒÊï./Ùºš§æ…Ð™§§tÍ#ÿ£Å÷õPèÇòCBßË?~WþiKÕÚJìøM€e*ãùþ — »›=ïÙõ¸•›?e°",·õ)§¾:~m»ŠfÀc«) …ß Ü“ÂHD²9r³ül¾•gggúë!¶sßQÀܪ÷ÅýŸ†×~Õ¼Üÿ…r]û$ ,z,OÞÒ†oGŽb¾Ð#^àj§ùð]*²Lîª4ýÉE0;’'~2Z=m\¤o³¤w C¥åë…}×ÔO)•5i5"IëÚ¡»twà12ÅM»¾\Vps·|0ÉÃ*•Ý·fÒ÷Ãv|*Mð¬O˜>¦gcý¤Ÿà_XŒ™¿½×Õ ¤Á­ÕM‚‚œì$6šëœî”µŽ’‹ ¸¥u^EY´Ú”ñLZ^do;ÊE9XÖ[޳þ{´fÄûu±^’@†ˆô±¯y.@;°óÜà!fö~š•Û7ÔyM²$ËX–<­%Fi²} „$RbÇ•œ˜¾OqÛ ¡Ëu’SjÎ<¯öe—ÙVo0S¬þ@u¬ÁÀ<.ƒó5ášÁ]ÂÀˆƒ¯~!ªÃ+-²×Êëpýï­â·>né>$‹Íñ†ª“_ÉÏx³voxâX/] 7ÊÍÚqƒ?_¥»õAÕs½½¹œt [óZª•ÃŒ·=íìK×ù°@^ê®ÏfãMâ¯ë{ö ö%oré–deí_oé`LˆpßûCû”Ò .|GZtRÁqR±éóC»ÅA¹hKÖš{–…J¾A ñ?ÙRì Uýl8bÒigL_æ*¾_–ÔÔEZÇ‹¤Ú'ÃÑëh#c3*þL{ÂÊ6×0H_ÎÍNÙ÷]ûæ8D†2<%Ž_“Ó~³zço–»Jöɺ¡Œæ ùçÉhEråëH7 Q‹Še1EBqìK„Kçë“©îMÞb4IN¨Ä½4ý¥dȬ{õ…–kiÿ¦Îé›Óßü©ÚLsendstream endobj 498 0 obj 5690 endobj 502 0 obj <> stream xœÍ\ë“5’ÿîã˜oîæÜ…Þªâb7°ìÂköÌ,Á±c=æÎžf<Æþï7SÏ”*«ƒУR•¤Ì_>•Ò/'b'ÿIÿúêÞ'ýÉÅÍ=qò7ø÷âÞ/÷dèp’þ÷ôÕÉg§ÐIKh&1É“Óç÷âÛòÄ«7šAª“ÓW÷~Xk»ÖjðÞëôÇÆÓ Ä¸új½‘Ã8 +W_ëÁ9ãìêáZÛAøõ7hór2ãê‹õF5«Wß®7v0ÆL[%ü´^­>‡ƒ¥Ð«ÓøSI“¾?NÐ÷lUJ9·z´V?þ7̦HæßÄK8=‡iO0S¹¶Øq“žl´ÀéL±Ã:<‡z7-Ë\¤[}¿Vy8ŸïàO2ÓÇðÄi˜•YÁ'.ërÎá Œ„‹$ŸÀu¤×M˜{¦€nq0„ Ÿ¿^oÌ µ™Ôê¶Nƒµ#—ñž€c«üžµÞ©Õ4Ž8çÞ4ðCi³zZ~ýœYúQýVíw^ ä €0¯×¸n¯õê÷Ò%N‡\ìY@%+L³ŸÆ¸$3R*2ÀÛõF‰´ŸèÍòWoÖÈy M†DYò6òMOX?®~­ŒŠ]&kÒ÷­˜pqY]#åå–eÇÁà#y… #¤…y \ú©\æt)}q©£$ü|³¶fæ÷/ËdnÛÑ‚A¬Ì¨ƒHlÒ‚7RÃ|„Šë^†6¢ñ!ü[…úÉRÈuÛò XV¹´©%}m<¯@G¥¡Í 4þE}Ë28i;Ý•ßø=›aåa=¤7R÷RÎ9ïL\x]2" #eH;Ð5@ÄwdZ‰Zù4 ùLsÉßç$×Àg%P Š&¾MÖS¾+ÛÖpPª úáéëÊç®NV9P×¶7k ?öš òÆÃµ¥ô@ôz,ËB^iùÚœ‹øRy¼oÎÛfåiÕ›ˆ˜1.>3Hf))}aÔAt$L4,aþÙZûTŽÂ×´DÃ6­žPŒƒÝ€qPHŒ'•O*|fgø¿IÓpÞWPž®#œ’­¬h œÑy¼3ÂÃ{å'‡u‚«‹¢:|]3€‡´e¤U¡âÄ K4¨£WÌóâ\PíÐíÅWHº ÞÓ«?á<$Êò$,$ª äÉ>ƒì| Šk‡J" ì ŠÙ?V9š›¶–€,Œg†4ÑÝ” ~,íƒ °|eé“ÎDÌMr‚î£Ç ¡ÓÊË@ ˜‡CLöÓ:Tô£îB‰H…Vñ?¬Î€øXȃŒ LRàwÐ)šÔ¤@ Aî[sÙsFŒÞÌAÝ \‹fT±šnõYœˆ1AEbsON(:ü_tRü½‹V0ræ`rÜÚÖx9š Ø~³àÿ=,mñókø‚ZM¨YÆ÷`ç"üÁKr2ã¿£æëò¹-áhEDý‡õ£ZTè œ ÿK@Ó_Öˆï¦Õ?q!@ꈟ²ÅÞƒFW÷¦*<Ëéõ,€D÷gÏU»ÕÜ[ªøˆÎ2=­2–¤"§5Ô±A ƒ²Qáú 1·Ux¢CU›ÒŽå5Mzõ¯üáò4qƒ@WÐ?×1nÂN ¤‚•ÿ/üõSþÌ}×) œ585F_¼gú~§œÁ:À™×6„F‹Î<Ø[ÆëÌ*']9Á/-/Ahˆ^ÌfWΤ”ü¤, 1J SD ¸ _\¤ƒ".˜þ/‹SÜ+”*X<0J,/ɯHpazŸBKçx‡ºzE ¸Ï«§4äÌó7HƸ̿¢õÞy£×û[Œê&Ô¦=Ÿ²MC£^¥EeòÅ êÂÒ£E¿°]7Ú‰ :T‚+ñ´|sÛzáÝÛ—Œ*FÞ`dãUæoû©‘x6D{N6Ö!G€‹ “ïáÞ…p\%¸äYÚÁÈ镯$qøóvóºE-þaÜò2Œït¶¡Øz[?‚€˜B6Y„œ ±NTåJvÞMRò´‰©œ;GŸq‚šÚx0O–“Ep3g˜Šú½pÌ Óyì8¢U9bÓV7ᬚ„]¡W_¬Ÿ¢­ƒÈ¦ÅhYUùè±,ƒžaVÁ(ý^&#J^A怖þh' ó(­‡xYÑ›0gž(ø2ÜP_¨qH W=iÄqž¢HDý‹”šsT,·1òó6(qƒ™×.Þ.:E¦^ÍøÛ&vò»-w›,›äIr¡r}è Ô:4­J½\Ca(NŠ÷Ç´J¤ÌG 0Ï6ÿÇZ c¥5Íú°rALJùš õ³2É]E@¦Ú)0•dŒoëÏÈ\àS`®PÈܬ¤YØ}*QŬJ›y!ïsYÅ›ìÎMo-ˆ™ïè*xÐñufå ãÂ2>² ŠƢêg½ÇÓúIB¥Ô|[Ì*‡IÁb2[rˆ "p¼×]ŽM¬v †ã"mY† Îf¸5¾ÎLÅᧉì2NQ”D´%S±¥º‘ )!d ájPÆöª-÷ñŽjUf5¶#ʽs*‚ê0TSnK 1bí€$­rÔÌ4*ÄL8iÊ&Eg5;ìÄ´˜àA•¤ü²”ôÜñš}ôÃëœ>çýmÜ Dë®ÍèÁ«FÎ’þ³}Ž.r™±5áM8ú¢z[|4âögÀXÙJA6ÜûL‘¨Ö иzi›¢‘6›<¥H€Væù p)¬us»da 2ù1›ïc.a99kcŽ=ïJºœ±Ýéz -Æ"Í…‘ó$yÆÆ‹UÔ$ÕcçDÞ "À4*L膹Ao\¢… ‡$ qÌÌL“yoûw×eûË«, øÛz ^½Êù" Ä©˜[ð_òv ’Ë6黼s€œUÓ¢@d-ºhýe£ –ÖúA3‰pÈsškÌä€WÃÙ=y¡KêzäÆç.Þe£„Æ«Oi/—œC…Êžœ ‹|’ÚÈ)@Õ¤s¦Ç*þû3²³s³*§…>¯¾ÉѾKH¬~“ö ¨‡–œ¯:·˜âA“7ßÀ Å¢}K>à>Wq®«I:?é°ºƒó;b†D˜úœØDìSe‰ô.ÒV„rž]’º1 ­ÿŸ”) ”ÚG3›àÕˆ¡Â¯±A%ßgZ:ìæÈOi&u‚–ÈÍøz¶J¾“’&Z’´ ëå=KER[O½òP} ¦v<€É˜ã#€Ü˜#Ue(úDšHB<Î6—¹µâøšDÍQ<4Ù!Ëyw,iÐÓBjk› ß±øU Œ[yÍE­7®þ¯Š Icóº&S9DC‚Vš—]ªƒ2LI tÙ7›o\¦,©±D2^TÛ²3ExΘ8 çdÃ0¤Üj°.²$áúeÈW&)—Œ5 Sò}c0]@(ì¸O(BÉ‹\0—H¬×óTQ•Š[FxÎ’lH’pBgüZmårt6ŽC¸oúd†4~AU,ç÷Ú4WŸv…°¥ ©ãü¢yn­‹¨…–¢‰o½€P? w±µkQ5ù`'.h†Š­œh2œ!©‚+§ljèÉ ecb|Ð똑h=µÖ–¶¯Ú$GÓÉ“\OÚ¼¿ch¯&B{’e·Aö‹CKˆ>šUŽÑÑT›¬JY-É&$gdµ;Ó ycàøU­‘@U-åÞð 'Ñ:àv§ÄmþvB–‡à‡N†%,Ñ´59gQe  ÷É~zƒß*Vþ1¹Íe𦉠ìwhĤØBZëŒV¡R±ç*[l=–Öy÷Ñ9oum"±1 !†Ò9¼Æê!g‚ÂÀòÀ¬×9me¢¬B£Yf2§~‘h ¯¯ËµT5¤µ 5”&(ùekRãAR\+%—¥Æ¹ ’X—ªa+ýðRQ¡ gZn"S¬Ùã?–­íËc]U“³ â£wBÃ"=±îT³Q ”ø"Á[ÖüÌŠbs8 Üî4Z4IÓ^“ÂÆþLÉ_uгé ?xçXùØUx—hÝ)DˆˆåÍT8£1²5Ä/›dˆyš0t¢z:ša7õ!ùÛu)¥sr~ßVE1DÚªp$¼ÄZaâóEץͧ¨}['±¨h^d±n“ÓÉâØNˆj>fŽo.PT¦¢©šY†²ÝÜ^ÎPÒ¼›šæÐ]Ú$ç‚ 4ó¸wÍxN]’N'kÚ(ÜøIëg¾¾wúqS5Oi²«:‹8Ìh£w@|JÆùä1xÔôè èhd¸"ƒÐÙ'Àh;8ýÑ‚]&0sUΨˆP„>:< ;€võCé¬ñÏŸ•à} «·yƒ»‰y_´©—ñcHW@;šØ×åõuÏÐ@MáM]ž_×ççõù—åù_êóÖçÏËóm}þ’.07nKã¯).Ë/ðfÍ´ãÞÙ_q³¯ß|UϸžïN#ÚQ|ž[¯g?.u;07•J´w¥k*jO[IýíøOŠ l…Pö‡N¸Â8Ö³Êþºlèc•èŸpìyÓ:5>Hß1p·µçëÊ”[:&ËèÜx‘^ ¾ËnNÿµ!tî{ÙÃ'|³*Þ§A‡zõþ'üÂ3jÁk ¥„AµxlÀ¶mX&®8L\&H‰ýì«/½mè“ŸÕÆËÝèÙÒÑwª‰3Êè<Ï¥‘ðé¦Îó‹òüûúü´4>ªKãßkãiNÓêOE]¸’šºßtÌ?¿«x ­šáóÏokßû=vÂHï[óŠ;ª¼ò*+ã³²@ÝpäEaõ{(®3JŽ ½<»k¹¿pŸ¯Ô¾nf—Ùˆ›ÞXú+îÏè˜ÓúÒw,ç•ZÍGõ¢})¡ºq¤²b¬%^ø¯u¤fÁù%Òõynm¼¢fÖrÖ’ãù÷^©d\¡v-„V æL޽ý”[b 4n› %Ýß’MK<©¸Ì Ñ}чñh²ß~oâ¦N¼:—ÉL¦5tw.\°ð‡\–èW2n8d4zÜŒ>¨Ë?G ¯""ê ¢4¢v ö)‹xR¿‡·²m(À¸—©€ Yq"Šv2;À4 'ÔI?åX¡Žé*ãíº•Ÿ“?é½öÍX³ ?sÜ»i ’4ã>%øþ¢„úÑÁ÷9ÙËÙ-·5³ÞÆýlßq«%;!¿eW”¡¥Ð;Û÷…–³E;Ä m˜oÚ†˜Œ¾¿®ù–=Ì ªp`¶jì“Çã‰4ƒ6NaRâ1\¦¡'rm̸VƒðFొUMжÿû!ÜX#o•±ôD„ªÖ =HøáaÑáuåv”ƒƒ'DfÚ`â3ü¨ ‡u°ÎëPjƒeGÊàyr¾¶(ºÚHg¸Kq´Èä~ˆÅQ;¼!;'ýî›Ôp·O÷2‚’¤.-åŽ7U¨}GRR}:·Ý·aj³z6j\R°Êî>pû]‰þÅÚ.T„Ä çú´4éMÊõØ-—CöWB!lºtà9.M—Sd¹€Vï*IŒ…+Qͤzvvš%¯Ý® Œ"»ÛüqÀæÎËm¢;Æánç®Òß#ËaòkÍv}žfªN dhÝ=’u/{tӜ٣H{Ä„õÝŽâ“ÆpŒPŒ+v/¼hh®9k·,r])v´S9uæl8ËyňÝ„`ö6òÖªWw/ùt¾]ØžlÉ< áŽBd³¯¿í% k“ÈçÈ©<Me*¯KÛn] Y—Ñé¾ohW÷йº‰¼GnèRø¶ŽEœøÆOà6W®ÐjK?˜J`k·kû.x鮉ª[€µª«"É×8\ -EÙu”¶;- ØŠ ¹}ì²…r(G¥5ïÇŸ¶Ýuªá yŒÇH]?tW ¾{£Ø°¸Y(w‰Y@ ÝHO7?ð'n+jX›D·W,¥Ígaj¬ýp¢7ÐaYp>eXÆ•á©ÇKÙ”çjjð Us¶xé./ë©|$”ø¸ïnª’Ÿ >¿ªrC×"¹¥î(<†m ‹Ù|]R‡2SÜèm5ˆÂûST{®»?E& ÅKD<¸CÊîîT®*ïÌìü1óZ±ª‚”7…ÚPz÷rLv÷”SÀ¾ÑêxiZ+Ó|—aèý!î2Ì7ÒõwàLS8t¶X6¯6¡B™²±ÖJ6R—$Í‘ù&ÆV>"Ù蹫î<[ÞReá–$ˆ쇂Îç 8§-cÁ¡ÃÖ:ñ¸F9iRúRWð ±DÈÖ@í)/.‡0Õ¼gwîvßQŸä»í•*3q¥Øá( ø`× §I±H¾–nl+¯šûÖ–h€*¢Ð¾å¬ÑR½¯v9–Ê-úˆEˆÕƒM åþƒý8‘ì0JÅù‹±6R‘‰‹äÖ‰…•¹01Y£ssäì"Yö„yw« ê Г*Þ’™1¦=Ñš©Îr±×Æ‘WþŸHýƒìйtSöý†¸¿ "‰X³|k:§•¯4 ·ÑAü´Hþ‰¨þ¨V >jìl×á–Çî.»¹vFâuT‹‘T¸Ôµg¬æ%ùdŸ­ËU”|–S¥£,¹Š&,ÐÚìQ2ä#–³¡’2–Ì—ë¸6k.ÕP‰Û0T,E箊x™n…ä0&dd°îK ‡\_ʺ•3­>?>¸pC!ðNŽ—*œ>%W#“Óõe6ò8w.Í2Ýÿ ç÷ ö:jTÂ.$á$eÜiøt…(wšw1 bVì7;êŽ4z«dº“›p^iúsŸiLÎö‡:–'K‚Štÿ(=­…nï½ë„¥üâÜÞª©Å[æûY`Ü‘Wü¤Û7<µ›£%À*ø„3g] ½^¬É‰eâ,9Pä¹v¤%³CRE²¹¢SÍ£O`X.‹ì’ª\TSÏâ¨øU ŸZd낳 ìöÍáýÃ4j8"ŒíËMt!×¢iü¸_éõØSzÇØë‹„À/ZzR¼)[¯‰Ã‰ùxƒ÷Ý£ª>9¡ÀLwwšg(ÓÈí¿ptO|^q§† e½¼roP"XëRÝ!‘üQ¬æQn#ÅZsÃVq¥ø£vè1ƒÂ,þ'ü©J[­ëËÅ~Ò’ÆOëæœ¥_ÌlϦV0×/mBÙ &„(@=[—jèúQ[_r¥ñ-7|Û3ÖpRY@¶¡ë–.ÙÙ|YK–ªzØRdí§÷þþù7ð€!endstream endobj 503 0 obj 5729 endobj 507 0 obj <> stream xœ½\Y“G~WøGlš1ž¦îÃ<6€±—ÀØÖÃÒJὤ]]üz2ëʬîê½¼`‡Ç3ÕudåùeVõ¾Þ“ÜøoùÿÑÙ“ß|ë÷N®žˆ½?Á'O^?‘©Ã^ùßÑÙÞï÷¡“TÐ2EåÞþ‹'y´ÜójÏ3ÁÃý³'?nâÖnÔÖ>Ûÿ ŒÐ’PÂLÑÁ ýcèø‡íNOÞÇ(7_måc0qó»­Ú|³ÝÉÉëÕfŸú|™[µ ›o¡Uô›kMЮTœT×åû6ãr œøo°Î[3…`ã¾€îÊNR„Í·8Ð;¿ù3>Qk¹ùz»SØ_5ÁJi"$ú¯ÐÙ9ë}z¨q:¹ùn»³ðÅ˰ù÷VMBX GìocJŸÆ~¿U™]&pvÁ¾€À½lÕË3׎`öÍ~œãÇîN)7¯êÏÍ5~¼j]N¶;vJãrï@™“&uÏ/aoȵà6ÏṌðC³AÇôü˜žŸ·çoéùYk<ì&-oF8§ˆi‡¹á‚zÞ¼È95^á,aŠÀÛŸ6­ƒì:”Æë´`bÂ=ÿ@__å¯FU[ږ͇nÜyÇ2å*õdóøúÉþ§?fñ¼ÄÆdäÂæ]iLVÍs­±Î÷†w¯׸Hsë\#yÁí~i$Ï©qª¸“ “G]Ü)?ÉæTÎ ù:Í›wxÚ”qê\7Góc[ïSüù(Xpi?KüPøñ9W"Ÿ:"ñYÞÓ.)ãÅåHÏGwNºs?ÝHfìÇ>‡´üê…¾æÒXº¤Û<0QwÚ ³ª{§£(Fm4†GÛ6’ë¬{ßY½XïBžëªS|Ð; ³·k. ¬¡%“oÇâÏåÈ]ïï%°ÒøYñÜ ‡7Mß…¯ó‘¥|¤pw¯¨Z£¥ž®ØÒr‡Ó¿íó%…06? aŠ$:µÖê©öWÅ‘Ìü `òÙ i¶Õ¡O9¥ývË¿i1 —ó%ÎEÙôІrŒ|J¼Zn äG:1„u-§CòŠbé¬ÅJÏ, m¹å9clsë¹S%Õ³‡…L&433\~ÞÂc œÙÞWg%¯÷9åù°ç3 <%¸^äy¶›s\¯F‘êpd™ïÀËÜê¡©IþrdŽÜ»X˜c–lŠ™:`(+Aóc/bå ³87Ãäd”kðÊ{ïMznq=°,]ÏØ5=0#ª²ãÚý!6£i5”/üÊBùíÖö˜u‡? ¦ú”¥ßÏÉ ‘`aaç— Øð Ö!Æ%Bx>’ÞƒàÑC¢òMñ††^wnaàF/ÈÏžl²ÚàÉÌÖ´1ä>ÃhI’~S%M$0s÷lô†I ýHê§‹¦å¶ìá)ØÖÏ ÕîõéÓx‚g“2„äï½{"ÅPEãó8Á,ýpÄ>šðhE½‡™Õ/*I½â/;w…þ»(Ö)Þ(Ý[KúÙ°ë™j:ÐI5SÍZp«Î£¥E)}3ÕÓÑmW `Ň'Ÿ¬r˜™vP¹º©1úQÊ gEþ–Ê 7e5e0°XµÄHXŒ*­Ï¨•ÖÚ!Í$èñg·Ž©‚/  ²p<øÜ¡BuËelÌH².å&× Ó8ýé«!ÕŽ–ùQAlܺ´Ð“ÏÖetµ®‹¢ «Ötc(è,¹YA&z¹í³©µ<‰ß›0ÔáˆeIU0=LYÎF«ßÇ´ïKãT+·‹iÓLoF ŒÏ;uªB>íĉ9îÕ†"›7Íð¯ª$sŸcþ TG5§›v74õ^4·T}–|º‡ß|z³¼:[X* ôiVöw£^d±,žÄZÅBgGÉëRíé¬r—iûz(cE®,ßÃ2å ÷{PîaF{ù¿”&zP5û”L,óCÕ6“Ƭg§õ¤LMEÿµ5xiBbUZœÔà)£RÉ.m˜Œ+‡ªA ]Ž/µåø2ÄhËihz^'p¼Ãßa*c'%Q•²Ç„‰­rýr8Ò@wd«5€Š¨‚m„X4h…$냜óΤ.'ð²ÃÆ4ê —¶Ö;UPÚ€¢Öo×°‰¼fó]”u‚@>P;êŠ76Ÿ}`ÀPm¢ª+¡ˆ±«‰“–-ź%H1Ñ@í¸oˆÛ(†ƒ¼™\ÎZödÛ/Ì4°mÜ[ð ÇYa¨¬Ïžb±Â‚:€¯e[;­gÜÌ»I°™èË¡ ]èHp?™cÑš*H<Ÿ^4*Ÿƒ€løK€«š0YÇ'\‘µЯÀ)˜çy¥³LkÐlEÒ…š‚Ò‘x.É$OÞv*ªmîÉ[¹,ª£¦ÍYÍ+«žz3!‘øíÚ;XLý^é—ÉwJVáÊd1dœqºÍWíæwqóÏvOÉô6I±©4º/—͉T«[ íÇŒ£*!8kü¤”æ÷!ØLmIÆ­_ Ív¦¾Úݨ¾uÎ$åº.T²«# #i•YÆŒ=—\ß[Û1 ;줋$K·ªü•惼V}rIÖsÚ™Tºé;9–U‡é²Îç½÷Ù'SúÂjk² NˆûNd;dRÃ$Eؤ·ÌõbÌ:ÅzîOÑÚ¤êå¢_âE²”Þ’sŸ°eÊ×à My¸âÑ¢š)a¥¢ñ{Òa¦gŒrRÜ4fu¢¢¸ZªIÅù„`+>§ès3y=1xÆä:¨uM{ñª³ëúø’¾2Ÿ…*êI‰Ÿ$ýWS°V:[p f?4ìÞ>D"š{âjÅÚ œ2©eÙoÐÉœzÝzÔˆ*)SÁýuÃëBKÃ@Áƒ#¸»ò Wo ïúê>^ÃbžÛ{$À( À¬¸ól²;#³š?ÔÒ1&§ŒSwâ¯Ë_õB¼À~(ƒ££µ4i_@pÀ@XÏðµ˜?žïuˆ{ŒÀ¨ïVµ@kÑG¼•'¬ž‡‡FÞHR:i$Ñ^ OšÅ¸‘žs’+†2­VÑy“¨â‰ë2kžï\¤É@.à<žWé´º¤§|ž¼oå=§ßËæGPAeoBůŜ´ˆ‰/q %ÆVhíD@Pf~££"@´¹úYM¢Ë6JÈ‹·AûÚmí î"%ŸCûj+«‚ 㑹†¹*BÓéóÊQm)ùº¸ZJJR<Ðÿâ#4 ^)o@m6#çGQ{; xÈ~“\åàÂäXùŽmFFC›~Íú+E‘˜Ÿ£MP’£›No+ªê4ôh«=„hÆ>¦ŽÁ'š+KJF­hL¨!Å#…(fÓƒäu¬vKüɫ䘑XÖC.†^nÐgïú¬­Oä½§ˆðjáqo?rrèš®#£9õKīŠc‹òÓ6ÑÒÏÆÔm˜rW‚Ÿ|¶Ä]¯se#ìA¤ÔÆ),l@XìlÀëÐÞLMŠI0³ü•x`` JŠÉ[%JJ¤àñl |ñ ¯4Üd9¹ˆ7½AhRë´Ì8¢š<(ÄR½˜—’-ÐbXÉCS\p¢ÎZ&Ð*øTƒÄÌq¤M•m$Õÿ4}y‘˜ŠºmÎõ•E¥±£Ê†‡x8Z´@ìºw¼D(ôºp.}’uÅcÅðXî°(* Ù‹¦ä9ˆYf½4¦?; \kô•ÌéÔì ê¡~5Ãød„a[²ææ¼âiykß{=§ÃœUr¨ÏöÎ<ð]ªU•ã< ÉpXä–pe.‚H¥¦w[k&`bèÞÛ¡³«AŒÓ8æDß-á )(ïù¡ ÷sË^NhB½[nj–4gø>Å>Å‘ïæ¥žÄšù¡k=‚šùoTA ÝÒ%`Í1BMî{ Nù¬sÌH°Zα0´r’ÒÊ´Ù’]ž`É{ ºqBònFØê¤oûxµöhz`tsFÅ VQ¦‚£€²ÈI—€sg!\>|hu3,Ü’fW <˜5¨A§"ªT\V"VÓáâºáb÷) a¶lká¯u9¦ Ù†æ8¼îjJiËj§0üQØÑÃtæ®Ñ015W0sg7h.Ç&ÆñÉXñhVOªÅ=&Wc¬­ùUô!"cÄQFÚ•U’GÕq³Rk)ø"ŽÎœH_W;˜­>íiæz•·€E)<{«÷ixÝ¡ëEŠ5C—<,ñŒ˜sB•X¾ý/çíÄ´dGÞ±S*–8°Ý¬¥!õCôJ%èÕÜA–ξz "¨†‹»ÌÐù{­Ò±kÍ¢¾A6¹DáiwÍ"ÈÀ¦>'h3Ï.0:UªŒc îT¬Ü víð«B ¥ M€ÈÐõt­}¦Ý“>î4þ§õï|rªPƒôÁ::„84Q~ѮIJ×LèÚ$»þ9|e©{»þq‹á+«tW–ÝÊ~л³‡|Íz=”ÞË¡ëtËðG@Ö9™nC¿ÞÖ{ítñ4ý)d´Îï,d–Z?•·; K¯GÛï^±¼ë‹kt ù5=;š~øâÚðbõ—m•ÃðÆí½Ä8x!á¶·|ë¥è;éô¯³Nÿ {ü€_âÇ·Äq˜³¤„Ù© gzN/_Ìþ†Žˆ·Šá݈÷?ÙÛºÄüC{þ%=ï6Y¿iû$ðŸ»Ië×$‡÷0åa)}Q:_î?ùüû_ƒÄendstream endobj 508 0 obj 4394 endobj 512 0 obj <> stream xœíkÇñû…q’?°³Ëôsz,9‰-?âÈ&‰¹HH˜‹Ï8Ç6œYþ頻®î®žéÙÝ;ã(Qb™íéGuu½«z8î7ê¸Ç¿üÿ“çGw¿ŽÏ^õǟÿ³£Žu8æÿžÆaùÕ üx†o`­~ÜôÊ­à÷?àGjÜŒ£Yýa<>žã«Kü8Ã…ûè{¥°»Y}³ÂOšã›®[Û1À˰ú Œ_çc·ÖЂÇGnÜ”ÆGT€/¥ñÏr×o¡Q÷´]½Êß•ñO ü/òûgåý›Üø´4ž—EÊïO«÷ÜxU¯Äƒ x/f…tG˜Š?VƒæÓ¿jÁ㬠xÀjj²Çke6Î÷:žg§¹ñ"¯¥cŠw þžäÆË2üyn|Q¯rã«ùþð÷$·výRîš`ꇚ² çe€ô,#7Å­„+À‘ÃñÉ—G'¿(P~¾´8céeë^•mü&÷á ¸¤%Öj6þx­ ”D!ÿQö%sa°7nÀ½O~p/,rò{7„,kŸvÞ*­Ó­ÄSy‹ô:ŒcÜêvû–¿ í^œ+Ü~ë’Ãeª6e7(&QúÌ/J_XתƒòÜW›ö7D:£„ †áGÜ®¹ë,mÇ0‹©à¼ÌÈ„C_B&¶·˜k‹û‡/¦f¢4l[¬•2¥œ ¢mߘHAL¥E†ó-шQÔš„D©BƒcT„{yÒÁ©YçIÊЬ»!ZåÈÆ“Û†w‚¶æLdIKŠÙ›¤ÓX"ÁÓr¸ŒÀ-PÃS7=@“ 0Dˆ @•ž4¼ö°ìNã#êÆXqsUh±Ðs|¯ÇÌèàòôí[„¿‡ 2]4»´Û1=縄•t`ÌeDKùvQ ,Ô /ˆøµ9Âçꜚ+0î È í);â0iØrIó¦ 0}?Ž‹jÄ€íî€æ’cÆñ6á×X$3M_H-*àÓ8¿×¢î",Ð-q®¢rc=p¯Z¤ò¸5»Ê tìQ´0™‰à ¡ÙQÎ&ù©3ô„Ò‡tÈhÑðdŠG°|ìMý˜·tZál2{ ™!ctÿ®ëa2¥Lf:”x‚W@Ô‚‘íÍñ<™÷‹,Pö¢p+Ò¿Ðÿ64…šJtÂàD­ÑUk…™­…,‚à(K6ÎÆQ( jÆAÖë(>2M¥l¥Ž H œ¬’TiÞ–RAÿ¥7äÉÍTØ>ªO¾Æ¶tA>=ƒ»˜Ë^¨Í‚žmäpÜ˲ÁqdpîœÌgÔÔ|¶'5gÔHÐ5y{o™7à(kÔµÑãꟂ›Òë·B¼î4¬¤2&Ry[¤¯ N4ƒ€ `ÀêÏ`’0†¸!]i€ä§ÀÛC1-¶¨F®¸’Ô$­v½K|%pÏšØf-Wè3–³~ÓgDøH‹$‹Úä7«Ü æ5|6Ýö ,í~ŒÚ±¨†Cmî½Û&üÆnÙ(a³ 䩘­å¶J‡Ÿ'gqK«­ë™ç&£WÑËÊÂNóØÊlé0’(Õlô,."ZÎSÑWǜĠtÑø¬çU‡Æ:мRzJâb©TðÊ$Þ[quÌÝ«i”mWW=¨pKbdC€«Ÿñ£Dø0йú…cý°z¿„ßPäsÒ¼Ïá÷ü%OˆÔ›&»g0ùå£Ý¡Ãj[&Ìë.§H2œ—è¬él÷©ëÊ)²fè'A>4wìp¾èík¬¨7AvXôŠx]’3y…JªÄpá¸(jâDA*]±’põ/{© oŒeaÔ@Ðjm€b„-ô$ž“âw»‹ º)NHÀ‚ RnLvæ|shS^šÏ`„¥Þ\‘=0GABf¯w_Ü©x~j4BªæÓ“®Û¦ðM'ívnK€‚ Ð´m9K^§{|Í81á-JDhä,æßÖ ƒkò^n)º8EëSÐS’% ­Øhg--ÉÔ¬‚¡–ãÊ,‡Þ+—±1ZA›u,dÁËOn2é‹ öÆö0Øœl9³eꦥ»ÃNM´­Ä„§¬˜ŠB3!Úð2;zŸDÀ..ŒÊãã)Ê0%h£iVKn/œçë… vñÛŠ®'/íÅÊÝc!ii‚¤™Å¸K €ÝkiŒºdƒS£H]Í×ç²'4Ïö!¨¶7ØâòÅU‰ù!/£ •Áÿ]+$ã| ¾miåt5ÂÜ;Ò?i­(9åѶnOÍT|7É7IœÚ»Wj«iêÎòµÔÝr&ÅŒêIÞå´Ä¡|?6)^dç&!—â›i0äú‹˜ fVEM­sÞÀ}ÒuC/ ‰W˜½’‘ +ûÚÖ*ïZÊE( T)©u.$1FÝ%câépýŽb3ô¸@X`¨YˆP:Íï"·¶iiñÉÛq¨¹Æ À5VšÐ<ËuL)!rGé¬e±áû˜Ä‚‘åˆ3ao¥é]”m•6d Õiö™B6úP§nÄ6+7·Ì…Kƒñ2„eÝäßQ¢„ïuÜò˜i%y¬¿ –¢“W»¥œ°zÎbÌz—³CiÃù²Ïš4ÊàwkîŽf VX=€iûÞ½Ž»_†(¶ª 5WT1té7ÌhbGÔ­áë·‚î9´æ\#´–tEŠÀ6]OÌɵ%S½SÏ3»hË]Ëžç{øõ~|Ô¥²­/ðã>û–ä—‚8¡ò”÷£+ù¦8£¥…'ü¹¸£ïåÆ{¥ñ£Üø 4~‘ïKŸ¸í×REØJÿ¿¸™Œ´b \6éAð`m›cnkWÀ%ãÌÁSÅó¡L[I÷ï&ÙüY†ÝŒ1¡±Ï¢f^¿V"ž°b†VƆÒa;âÁ7XNèo)—ÞÚSÓ=ÞrˆÙnT1M¼äTA+Ž)¨‹p{~hø«ñí\-U¦H­–<Öš•‹Ë*D×hÊÃ.È\aZ0*æÙ—m‘¤ß#b¥™äR¸Œi4”wߡىÁÐb 1¶žŒ¶D"¤QøÅá˜ýQe*Écؾ(®mG>&E+ç3ÞÇ“h†&ë¨)+*›( \4(Úu1 ÚB¤­/ôS¤F2£ÑÂ/½˜6‚#³ûË1™§Ç@ÖßiŒ;¡6/b(p„S±@˜äØ`hL޲­BâÂ(3 +$ym`7ëì€â¬2’jv$;sØŒ‰J޼ìˆ[¦êkÅ-gQ÷Tb-E&´#ÝÇuoºœ©­M%)çIuÜ)dN_[ò­A0ê’¤£Œ¦\ÖÁ5+‚³¦*­+öê4ªÝY²³SÒÑγõÓÈÚЈt㬴èg¿Æå̹2>–2;ÔPÙf¢ò™²!ÛZ³î‹9rÍ¡ þëXÌò²•ŶÏ$DòðÉL%0* 35Þ˕ƹ±²Ók•®(ºKÕ¸áúzÆÌý-`8¬à(–›7Qmî¼þn,órËæ×Û֩̽‰T.µŸ@ÿî |ò+‚KÛka2¦²¸¦þnhé¾È.]?b‡ŠaÅ…¡Tš‘ãÔ2- ˜ë‰r®o,‰d¡Ïf• Ê87n¤_*çm•®´ yQ]¸XzÚ …¼ÍrýrnÅÇâ‘EÉÍòõV3 ÂÛƒÅÍ€TjœøÅUPà!íþz1FðµJ&c,èÏ«Ú18 v!9…³©SˆƒñóNê|É£ò2KPºœ‹'.‡¦Úá›ÓÊ6:¼4^¦¬#«Îj]a–¹ÕìZU`¥FÄ1–6ši&ƒFxåKÀlüÕ@ &ˆÁù²O Ê”ò(c(çpˆ3߸óòƒÃ£€*Îç–ç ‰ “U…ôj2 1¼*þOEßÖï3€¬‰Ô[2‰{ü,³ÇÛ]—“ñîE“p9ØØâH›É¢§l­õ¥¶²6Y/ÊUÁ!Â_hå‡s½¿]ŒR¦ùßðI¼ÄQ{ò)²+Ù`E²*°;ßÏj)çŠÓËE¡5™‹ÂœìLщ¨ö”Z#­Áq£ã¹!.m,‘lÜ­°2+<óÿ…‚K=[„/’ißa3˜ôƒm Ÿ±É¢˜­Œò"’³ÿ.cß›ßeÄâY±EµD½xz!¥ö·5ÅNÌBNBzOp€ Í 1˜ëpÀUl¼Á"yí@EÙ0â”ÛZZª.OâÕ¤ºŸïBbÔªQ¬_c¶k§b"— -VV!¤µiv½—dž¯0b ¬äßr¨OÁ@³b£iu}ÚlŽg½xç’m*8©*ë2T©>®oƒ1n—’×Kʉ‘í¥•'Æ[HAË¥ôr*pÂ9àMóZKu³Iœd+T-B=ÕÁÓ*ÇmÉ‘I㜩³2â‰ÉT ›=&ZªÆ²NV2ç û»0þË âæL+ ]•qޱ*»¾ÂÈãIA~â¤ò#³È·¬±b™47¿•,MõJ‚Z éË´ê²·å*“*¤È|¤ºBDg׬mÒWZ‹oÊQz-ŒÀÌ}Xº!<µ?R™‡q—îç§»'m»«¤E*I'÷èãŽZéŒeÓvÜDQ âëªá$†¹ÃDÔ‡%«.³òvÊÀ©;ó ž•­Òòé³"µ@ÅpKÙ¤†l¦uÒ‚zM-ꪉ4>c’Û¹Iáš%¹{CN¦µŽmõ#vsš«z}ŽxW¹ÒœžbFÚdØÆ›ÞŽ®½–e·»®û§X€ö²rJÄS0ôFUfÒr ë’pI/×íúéïªâF«¬ª^'V¤‹;™k[Š"ú·Oª3¬Q$Ä x€¿žcLݾâöŽjc5­NI*™ôG»qÛcv*¼jU¸ 9 XùmµÜ<àRZlL·Œ2·HËèvlj9ýNîs~ m§YvI{MJ£ŠWW¹%R‹ª·XŸƒ±|xD ¯BÎé> stream xœ½\Ys$7r~Ÿ˜ÿúiªb©p£6bì½ìõ®lKܰ’(ŽÅaHÃ¦Ž‘Æûë‰3t5ÉÙ …¤f G"/àû‹e þ“þóöÅÇŸº‹Û_,€o_|ÿB„é7o/þå  OæuYÅÅÕ7/â×âÂÉ ëõ /¯Þ¾øbZfÒóÕÕá %èrÑójᣫ×Ðð7‡K5;·®bú׃˜×Õëuú烜þóp)f­“ÓUmó»øTi?} Ot;yk†çR®³dM>/=n»ÀŽ?q~{г÷F[úâ·Ð\šY,~úý?tÖMÿ†ïýª”˜þt¸”Ø^i9ÃH¡#œôŸ¡±µÆ¹ðRawbúìpià‡~úŸƒœ—ÅÀ,ñ‹«PL ï·Ÿd$'ðe¢×%¬Õ‰udþƒÎ`fjú'fŒwz:ÂÄ´›Wo§¯ÒÍF/jú?|(g)Õô:ÎE¯fú_X8LOÊéxºéhù.¶±‹­Cü óÞÂÄ?‚Æ.v†ï{£áEýâMoÌ µq³Rö=ëô—²g?b=k¦»<û¸>حؿSŠ÷)̶~’_?ÔŸïêÏŸð#? ¡§—õiY:éó—ÊE¥ûïê˜î2Ãò¿†f~ÖFÚð±´°9ÓMXºT:P‡Ìä®”[¼> 'ÈÕÎzYRzƒw‰pb3À7µùC‡½/ðóárAr«M«\FfÑÀ*ÒÒ¾Þñ%|—[#é.3í.…‚-2’p#Ë‹I5x, ’*WZ;à„̽(+È®r¸Ù O¡àà’¼uè1î9‹zWm¦·(wÖ:«a ¥ÖÈ F«k…õ®#ë7e:°~P+«L)½Jü:.Æee•¯«¼nÚd–Dy]—Y¢¦GB»úÐ+W@ÞÎIeeõVHhuiµ,~w UÖ{¥©¤F‘D¶PRÌÈ I¢øêÜ „3Ó«<qÀ?â>/¶ ,êØ¡ ¤Y½*,üPßW¾~¸]¬J†‘¼‚m—Ó·¦ Ò,bñË휃ۖ6Ü ‹ÄT (ràé/§21"Þ8øë"AN2E‚œ˜ÕGƒp<ªâÒãAù¤‚àÄ%y-óP(·hìžÛZ ¥Åœ ÅUUÙfÜÕ‘˜ôDIÓêásOùçšÙœô—½-LÉ÷•3P 7 ìO«œaPÉ5¶2¶ÍùÝV]WÞ¬¿oe‘üòPÞ`Ñf ä÷à&çʪŒEA«]¼'óÇ•Åñ0ÔSøá¯RhϘŸ­Gå¥*Gè4n n?n)ì.(è(€“&oQÉ…¤¦/Jc…~•ŸjÇÆïñ??”vâp¹®áwè!>ü×z$«¶ü©>¶ÎO?'OåéWùWIÑufß°qߨßPè‚jM(ÍÙU€[pxQÌf2nÒ‚ì–¡{Ôï‰%Igá’ ³À³Ñ„ùv¾1a@8F`&iHªtVÆ¡{jy¤ª‡Ñ­È–±Ñ Pq # a`BŠ2DbuØè­•C¥—Qgœ-éü¼Žp ,‰°Ná‡V‡Ù´ƒEƒl 9‹»Àá Ê€™$ü{ /ÁEëõuOû#c[ð¿„š¾ü¡6@òUn2e~ø Ãi…àoË–ÅæuS#”ë®%*F§ ª:,Ð*‚«DI®÷o'[hLÖà p&¬“½Éˆçgbï‚Û•ÄF ŒÇÏðœ•ç9fçËw’`´ï‰´½ÛZaƒ©2w¬#|—ð9!0˜S%¨æfÂä[ò4ÙšÅÙ„À""C5 ÆY+1Ä>¹Ëž3AMFÕRÔeT˺q”+áöìŽx—èªHT_zâÆ ѰÇå8%AZÎü 8N5Ä]y~j‹ŒðK­+wSÕîÊk"i•ûÉd’’ÄtmÚ1DM^Éä‚DêphÕ•/^U]„ØU¸‚^#ŸvKæüè%õD2/®}• ,é¼£=$ÕV¢9Õ R ~þéÅÕ?}1y m8 Fq†ÁƒªåÙc  ,ö7à+…\r ¯BU“?y‡DT”P`vòP(RÚùÙÅ fáü¶(7Å {«ü:ý;tj´ tjm" PÒЪ€Eâ†Éé€5Õ”ô.ôä¡S úÞ £ßq~Rè4ÓE£ú–¸cÂÔhGw¥aœ§BMÜBXT0Ô0{1Æ/FÕ®n‚uw*?òà/ë7ä}¥Hœ’Ôô›¸L Rp_¾î¡#…–ÃKq; ¤è8\Ö>º£â–à©ã@«'}&íæch=$+-áT*%ÉE2†ºHÉ'*Nõù~¾p:]¸¹D¾’EÖÆ“ž*àºkätãj«EÀN)æö}mYh‡ŒHƒGÑ d12b܈š>&5Ž­³ï¹äI³YP9<1ˆ=¡&[T_V0Aâ6i* åŠrW+Õ·U1“éà&«ëMX7±™qµ;ĵ² &@Tä:24qÔ¤æõ8bºDiúñWœ§Œãµ¾ÿc8;k| ¸·°VÅ8¶‚ØÎ-¸½WŽ…èį'-¸ó%–œ@M†/òL8dêÀ‘žô„V T  h‡õžÇõúRÇ܆$“n{cJ Ï¬ÏÒƒ+Ñ]èÇÉ5r(ülÐsñ™ì/ç6DjržÏj"0Dec²oíT„µ#Ï8/s\ Ä,l °%Éhãá̳VèZj _úÒŠ6YsA ÁÒ–GjýJ>ÏêÆº´q;/)¸­|Ùƒ´m¼6·¥ÑJ,/@WåÜtHà4-ùÈ9BÀ˜R->ôœ(”Õ;N({à 1fZÊ o¹ÆžÓ-¬¢ÝÍÚbKÖeÏ>7®Ý 𜃻vÀ–÷)DëçR’Cb V•äÔµu­è1˜`¸>‰¾žìÓ¾+)Û”3UÔÖ‰!FÑW”Ù{æjaa.ËÌ6í#ž÷äÖ…P WC0to/úÙÊGrb‚õ4rìL yç)níì $ Y±Äö ²2¶427˜HÇðZ£ä)>*]AvÂ`ב`ëª6EÔΘ’ÑüÿR„>«“æó¨*•h†xIRLk»ÙBpûgi«a"]Îkæcâ_½2*· ¿2–†ÿ³·²QÎÀð$Ф³iÒ6%NqvœßÓÒ9ӌޛ§%ô«‚*QÖÕÛjÖ¼l œ€ãÆ£Um²,gœò¤\¤1æ4LÌzñþ#)³R9 `#ñ®¹åfâdÆFàp^i‡²¹k§¶#.…{iÊœ,ÈÂ%£Úšq`žŒ²¡ì¥ožî’·­æÅ ân+«ƒ'Ö ð#Ê5744¾‘™¼"n,p ’\N+èE‘À4¥YŽ$¢N…Ÿ2A82º®ÁYd¼^‘‡}m¶ÙF7u/‰~K´¿§‰E|(+:¤ÒÁƒÜKÀCg!õ½±—Mx¶‚Ò3D®ˆ%@ð…XOe¨ÃÞ º’´Ó2ª»vz'*”°Ýñ*ÒM½"òX|F )ê[Ÿ *„ÝÒ…ÙSIÉxUc”eKœò¼ ¿7þóíVÎt(‘í'âî:ðЬð£¬ö5G Q1MÝ©«=%¬¤:¾ø^‚ŽÔ6ò´&0leÐvÇÌ"õÇ7l€Mˬ#R&nhu¡î€BA –g¬ž³¥¯“¶àFI¶À Ü´“*‰qru`j*¼b¹›© kg îïœiB»hÔ‰LÓ&x£tKÒ˜ZÔ½:BQCKÅkç$„Ð µ”[±SÜ«=½J"#Í"Qœ• Ú}Oû5œ,)äaŽûVÞ+•›¥´Ð÷=©fgºRDU ·ìÊšTÓ/]<ª¸¼8cú:’naeÀYƒ²ã –J¢D ´ØzyUwmŒwb QÉqªÇlø+Õâ|(ÕU¢!¢ñÈU¬mër/Q׃’¼ÀŽanÜn5ħ+^¶Ø ¶%à½ABÚÆËDÕ‰%‡®Vx¢œ÷ÔvƒZËð— ýbáU‚^‚u›v'CÌÔuúøS!^¹êàK±êÈȇxšc?ð«Ø)ž ƒ‰?ãÂæ®6ûÅ#ȵÚtœ~.ÁÏþ€§1ân;F†e`d ö®z]kƒ·¶w«ñúV¤ç9]x| ¦¶qAµö¼£qWÔÊ x0 gÔVÛÙE<<С°FPú‘•T¨Y+ñ…¤óz8tÓ<£=4m z·!=Mª6¬ö2–&øMˆžTc#zÈ‘Î^o*2lÎæ”y"ø›4†í­í㻇Ú晴o.ƶ´kR%:êáGèµq³Õ§ÖˆLÙþ¾^CÃ&ÕPÒúÚ ý9LU{<ñg¦ÿ†o£a FذVÝ *V£hOÌ;;Üâb•r/Ü[GoGF5ÝM›çD•Y{1²T®øV¥ço»ª%6sTj ,Kþc5é”Öò¾¯«Ü¹e< 9è!â —‹S økO ÅKÎYI|'–êÛ›¨ríã¶'4ˆmrÖ×Èb½)X3ÆM šÄ…óÈoe«÷$LQ¹rƒRn ±“zhb>aôf€¹ñ¦p”#ÀOõ=…щ@ó9"ƒi×÷zYòø„Ýòß„BªE7Ç.ÀJœB[מŸí¤2Ú¸ ¨-· aOš2‘æ^WÏ#+©Ïå3¯‘VݨoÒø*f{ÿ¦¼Žy%:]4~)¦,ÆR™Â»gÛ¼«‡C ™)ЋõK4;5ï˜!ÛJt¶n–×71A€®÷ö̰ê¹'[¬Î±ðj!1Åæ¸VRë›Ú-VMÛD™`5¨*^w˜±ãüvRŒNRÞ;q›XSxq)eŒÉ<"n³¼–ÅV†Š6lAOIOè=rEs_l&øáèý‰â÷ñÉ÷lïE¬ýÛ²Qð0ŸïÀmõã[ò¡³¾Ï«R#± Þ+soPUå'4,Dzºk&ÛÃïì(Y+Ãç«l¼Ì\þÔ=ÿ–ªËâNÚv'¯É[=ÈõÝlEƒ ÑÙaûâñÆq¥Þ8$[ý-žÏ6Z’$Ú?æýO²—¯»Á{õ\Ë9;¤Bùïb‚Š*§øj|ƒ¤©ÈÉí˜\P࿦ۇÀ꽪7ìì^8ã×úœ˜Ò5$zÈ×ùÜ3©Ç n,»ê|qôp­š¥8„4²–§å»T–‘CL¤:b!¬œÈ`Õì$‘œwµ[ 3Â&¿Ô e믦€L<÷âføšD;7x¯jª IŠu?öY·dSÂìÇe"wð>©û E>Ûõ¹ÚÅÝ…#®‹ßiiü)vOa¯=Ì·ÇmNí5*%Õ*Üìè9,ä°Q7Žv~ɲ»³O ]"CoS.õR¾F¾NÙçt˜[™>ÿäC×î1uVúP73•Â<‡ ø¡Þ\¡Æ‰¢|Ê—+/‚ú'oœÆ°Uºz1e˜›pç-QʇɮÛÏÏËÅö«–K‰#æ´Gò4iTvg\¼K`|+X¦J/IT6\œt‚SëæðYœ+ÇØO¼© îa=Ðë>ëøq*¹àÓÇ(å^º±{»jfªŸÎ¹]]z~,.)ü ¬—óW4Æf<ÓNÅËæ!âä4¤<¿=º˜ë6¥ºCÓMk7g78–*•Ž…Ý:§ÀkáM†:Qy:R„—½û€ûo’y^¥&Œ•zñSpá|ñ&Ž‚±¢A;†>‡]ÛÒqHÛ³ÝP_ÿ^Ýw­4'mÄdc,btÞý•<ÇÎÃ&Ã|ƒM¾¡ ªA k,ɘxéõ;·‚…ë5\y„©>ž¡_áŽìP!ûÑqê¸ÙñþWrw»¢+=ãÁRÑ|È4Rã8'ܹ³o_å÷Ktnñ:À«> stream xœ½\Yo%Å~Ÿ å/Xâ!}·éÚ«"E YIBHŽ"< ö03ÊŒ=À°ýûœSë©íöµ=$(`·«««Nå;[}}±­ìbÃâ¯^>zïcsñôÛGÛÅŸáÿO}ýˆùñ?W//~w ƒƒ'«Û»¸üêQx›]~¡­\¿¸|ùè³ÅÔ²øjŒ ƒ_6ÿàh·måÂ,¿?Åj,ÛÄòü‘ÃC³|x8²Õ9+Ýòï_þ~«ÖR«å#Ãíº1µ¼øþÿx$ôÊ6½ü-ÌÀµ^þˆ3H© _>…Aÿ9Ÿ2}Ç||8n«uÜI™gávù| –«ÍòœÄÂÿ¬ÈêuÛŒ^.ýŠsŒ~$εXFxÍ±Íøþ׬W~r8*xA:µü³¼§ÒFrøÉÉ,aEÍC2ôýƒÛ€&°öËáûdÏ"a¿¸ü+œ!9CXͺY8ÆËk8:'¥ %w«•G±­†9|‹_PÊh¾ü„Ûdzsz¹9p³*íäòÖm­æly sý«ØìÊ™&xV(‚c^æVÆäòcè 3 „é&¾¯Äò߃ð+g‘>‚] ‡—}ðìã«Ð‰)šLà&–Ï¿1Ô ³m,ŠºSryš{eÀÀÔ˯ò³È B0ò2–M‘‡Å-2†ÒWÜLI_'¹3ò°d8íJç½Î›¼ê6éE#ÒçÈð47È9MºDÉ£dÈivù²ð@æð›ðLƒîxG¯BHçåJ8$‡k„‰L“¹±ð|”Lküž€s`†Àº7å=8JØÍ*Qa¢3Pqççi¡ ·¢6çT½‹öi‘1Ë3¢èx6Ä6ðÑ A…Y‹,]åg`M´q~‡½€²P‘É \i[‹ê?¢Ÿ¹76 e$¬‘+üŽN¬ì_”Át¼*¯¼*òDd öœr}U6Kþž—YÈ‹”ãfCiJGPŒeŠsŽ MôCa¼ç9{ûb82¾­¸öo+ç Æ‚©@ ™ðÔÈ‘‘Idœ®¿ü½;¼øRQA2à“I0ZŅÞÂg¤“~)äpfŒí·£²ÐZÁ³Ð‰pm——8‰^µÉ6•@ð½9³0þXŸå`þâG ëäV£®%„,Òr{ b©R«þh‘‹qý`„–À!pfÎ*¯Ò¹5Ç ÀÄ †AÑÂ`NZ©'ÅõëMú_‹¬*ró ~ÑxëC6VFŽd€èƒ§YnÞœÉ(öRÞÔç‹^®¾jxbêÎQz·põ‘†Õ€.èõ"è”›¨$7-WX~#û%ËŠ¼Ç+ Øá5-/ŒQ’üÆ–ø€ ˜BzÜN#áBõÚtHà θwzn #zß3ømÔü¥ðvmQÒò1~ß F“«¹…yƒhxrÕ&£°)¾@HOÏxüG‹„ÈåJ!Q°™­˜‰RDÍÏãV3ÂÆ[ÂÔ¢cw š5r— ¸Cœ™=t`(+Öè ì–ï[Š‚GcŸŸ“¹nƒ—ƒJ£Ö*3\S­>0ÉUÒd„>7µµ‰gµ9d/!N÷q y+’æË UÖz‘Ÿ!ÁȪàTU'ó%ô€CË„oQ3ÿz]„¢†ôq#GfV-“^ÿ¼fŒ;'ŽysE5ob—'?¾òv-¨à¥k½1°à¡»ŠËd? ³è)ÞÙ¹ËK#¼]%9u[¹ÒƒîyÈç<¥t+\D¦ï]^@Êß(ŒÊŽÁPî…¨±§læëÎ]4t% …]‚,WʼnŒ§\ßL† »Eï‘Ú«²$¢ópÞ›Â}Wœ]˜÷iTñ“Åa}»Plàîjêñá' ÃGÏÕï©ÖÑS½Šƒ•#¬œk8âžÆM:‡Ï‹ø¦Ïï# @§ŽßCͳI%*ŸØÑt¸>èFFÞ†n`—Éê'ð&ÚÁ€—lΘ÷¸ö¶`%è(„GZütCmd§}1Rê¢Â† fRÃMŒ@Àòà¨$V¾+>IgDØŠÈ.Z mQý›ÞTsì8ìÿÝkpUi~OšÐ_–õ³¢£ŒÈ/ÁB®ø£5º2¨0”´þAG1ÎNâr”¤‰Ç%”ñZ¦7 ¥O6Á‘F_ò!ZDq»9BÜO5)NÆjµ<$ТŒç¬ 'â³ y4ø:»þDDM­ õŪ³¨Œ"<ô™ÐÈÀ4ÀÒóB€ GΡx[ã #}d­q˘„óEB—>š\‰d©§1Ì÷{7‹Ð²2ùOÄ6DRjÄB>–ÒÊ5+O8Ïó†ˆÁ½¡†!N†<ÌÎP>Z3=WDÚÎQûqßµÞÙçJäIª©4´ù0ioGBˆ‹UeäÖaÚLƒÙ‡5œËŠ5Rö±ßÇ´6 ä:üp½É…ùf3ç°~YcpÈ ’åè8¶ f:»Ä,”×Gkº ^ŽÆþv8Hç’h,ßþ²ðW§j¶/ϧÖQd"=EH)ºY‚]Ë#hæ¶qƒŠxú Ìšl:šŽÙÇÂ{Q:Ejñ ¶Äž›”•z±ò© AFDîøª”E$#ðAæX?) &å9UýÅx8èÎO¹NíM„eQ+‹8Û’…Ðãï_å¿!àEík5òM|ø²<|’Þ”‡¯q1¾b€wÓߟ”¿ÿ”þPÞæ‡ß”‡×ùá¯ÒO^†St!Ȱ'Òø/,¸ñåná¥ËL¸ñ_Ÿ¾Q"=Ë{^üm~øzgk?ýÜDjk31űjC]vÛXþ£ÔÖç@O•YJe¡Okn/j‹Fþš¨ò&ªþçs>ØwÂD»J=з –‰fè!2Ö¥¢âþšH#YÁm£›ÂÚ•ys8: Æ‚)#§>5MØzzÓh[)‚¶êØÊ£ áG•Þ ] ˜ è_EÂoå6ÆÇ:7q‚ IÜiZ¤þ<îNÃf‡Ÿžë¸£jÄ0ÇJrØz£1õìf= 㦉Q HîclUP-–Ÿ(Skü¡dÕºº˜a¥Vú¬g—™#Eи¯ÿf@°ØS4~(zÏ@â׌µF°RQ9~\Û?bûg}õB­Ò³âÞlý;óÉ·z¨Å“.Ô®½)eŽäAãVÛµ€ýK]{ÀænÉ~ŽÍŸi¿fɵbÐ2FÉݶ)Rñë±ì}ÊR£ ¥ßV ^ï²N9^Aõ¸…/¤nê%¤uUôs;õ›“¤Ùæí&ùÍÕÌ,cá·Opœ×½ŠTÀêi;º×ŠÑœ« “Ë• ¦ °¦!¬©F&5’ « uiiÊQºŒ$/ÖÉÁ*w™61Ï‹ »åÃâ¢J¢|(S£ØYhᜦœwjš˜¿ÝR§‘p[[AHÐE—/Ÿ(¬(¨~-‚eÀùO6ñ¹¡\!qÁú 5þsӼп'ïÞÛL_$âQŠp&ºx!X»µ9CÑX·eÊœ,¸(;²÷.sJK+H° À¥“šæb\(ò'ÑÄ“0 î½v{ˆÊ¿<™S5hIb9 ìŽux#ļÚÖ÷Áj=áÔ@+¹½‚ÖĢϼ @zL2Ê ‚$úÇPSnéÃtó^ f4Û=.²:GêˆÎõݼ…Fƒ>è)Pgá2‚ûâ`,ü½}õ`§'X=ô±‘´ŒëdtUøÛ¤™-*»P-Y‚åþ«zXU§Ó]À àÕYÓˆ#¥•wP5àyæ7Š8YÑFx‚Õ6"V³!{¼¨Ñ$ Jó.Õãˆj ‘tèéVìºSnHݱʺ‹]ן˜OdµÊ烼¥D`,Ù¢`8WèŒ[V“[ ôÏ &5Éè"¡GEø®3ˆ±\— ÷aûºå)…§š2æût›&¼æhÒ0Åãrü€´7}·p­±F_¿Î (޳¾”,UÛH3òÀb|ñôOšÅz¡su²G,ÜÆÊœ‘&*ê"?TìÄšú{¶iy©Kówµ°Y‘\nSA õ{QÑ΃ûV !å¡N•3´¿Ð?ÛÀ­Êåž]‚¡YË›Šà5 Z61_£?¢!Pœ,ºÓò㸻o{¹ô±”¯T![®ž]²Ù AœÄ’f…9t>@)ø–©Î‰¤Ûî[Ò»ŠÐÔ,§ƒƒ[7‰™Ó—F¤ƒ ý¼£ló“  ×6HœGaâ} «Èá:b“-µ´7s$ÑwíŰÞXÇW´…þ†mߟO€#éQºu?ë=[Ú¥±A'‰Ëo¹ZgD€a¦´» (²]¹M¶ðä˜Ã¿È#‹eGld|·>­&ªzc­®‹sm¾ƒ4ûJbÛ¥*+4R­6ã}h“åËÆêXp#>è÷ûÌë^í&šü=…ƒûvx7³ÞØN…¬‘Õï®BâØÀ• bà}ŠêD&†yNóšÚÉ ^nà5^¼²é³¶^Y¯1È[] ‘5H!&R™³îÃJ›;Qü¤òÑ¥ø§XéÅp‹®°k–âˆ6 wr…IJ´JÙ”÷˜PÍTå;ÇW§”Úy\K ß´½ô œIÉ™=Ó¿4ÚNt|“ƨßQ±s 74ze 8t4ßA(´ì/ôeQSÁˆžÌÐîtµ4ºwèÐÍ&†…9à55ɼ°á“Ÿ‚Sð>1—nî$tH^#Ó9{°ßwóVüào=ÂPÿ¨h¶iËxVLwl#’² âUPä8@¤#‡Ó«+Ô‹¥z¦zï@ï?÷Eú›¢ø9‘X<<>Ltf—éW M[ Wâ•“ZÂiêTíN·ê¨ÕS¯•¾\C8‡ë«.“';-›Væî…ÂÃS]ö«¿{–,g‘6f­S™jª‘îÒ[m«:KBVÚÏóÇËGÿ‚þ?®7†endstream endobj 523 0 obj 5626 endobj 527 0 obj <> stream xœ½\[sW~wåG¸*Ua†Í4}îÝEåÝÂV’eÁ©Íð`lc\±±ãá߯t.-nõxlœ …™9÷#}’>©Ûùc»mÔv‹ò¿{'[^†íË­vûü=ÜúcKÅÛùŸ½“í¿ïÀ ¥¡¥éÛ^mï¼ßJ³ÕvÐÛ¾³ tîœl½^ôK·ðK÷vçŸ0Ã(>C·¶é=LÚÙ‡ÿX®LBß«ÅKÕô}gûÅ“¥^¼X®Tc­ z±Ccž¦Vc»ÅKh5°ì¢ƒ½h׺ot5ä·aÅé¸ð/°Ï÷KÛt³žw|õkTÛ-~XâÄàÃâ9öw½1jñÓr¥q¼±ºâBxèŸa°÷.„Øip9µxµ\9øT·øïR7mëà”8cg Óª qîoKÄe;.®ô7Ýö ®Tß'©½†Õ{øãN‚wìüâöÑ-¬ßÅë.ŽðÇ þ8ÀÛ·­R‹oaLÛÁ³8Çž]üqYy»\cú¦ï«¸$n’û>VÛåÆÏeã—Jh$,íT7Ýú¨ÿdh< •v¥=÷i¥ó¡—ú/«•Ú¾i•E9•þZZøÑšnqU¥|dÛ^d©ufñ‰ZÄÅŽ‡VÔ¦êL£íöJ™ÆùV'íÑÕÎh‰3~ôÒH#Ï“&ޏT¢¨à‚7 ý½$tRße5‰ö›6‚ømßE„‰‚:…z™ÒY<Êzñ±Ë7•$WE”:4ê^ á!ö5|ZcG(÷†FÒ=^Ÿ„ÆuqtŸ†BÛŸJÚ½’¦ÌÖ‘ìLPd1´®Ÿð™œVš.?ˆ:=Ÿµ×wI¥w¼ÏÄVÓ$“1ù²‹©àaÒGɯԂÏ~å@Ú~Ÿ/_T$;K’Ðû@V9 Že‹±±÷a,+ìŠóü<\ƒÙâ1aæY^#ÿا%¾Ãïß×ä0öå5vhË'Rã¯Cã+j TÎøV,p)¸Éc©ñRj¼¸‹>§þJ&µfÏÆ‘sé†7ã÷²¸‚Å®ÔxUá?ßðVbIó_pÀ«ÚÖrô?›„x´”Ó‰4k£YÊfFòb°ˆõÃ-~įOèÒ`67øC‘<ÿ†·hãÇvX€Lx¡‡ÆÇäo¾^o6¿Pãsi$M³>ÖÜh]«5c;_ëgÐ=’€Az³$!}G‚x°þPWÄëõ·ø˜>>än%ÚT:?¶©ìf±"š£œ‚i}”ú?@ωÑ}¡Gy/žÆ ù®4àÇÊC—è~= Bóìù@RG5dB£0¿ß•àxÁå¢ëô¶"IÌ9m~¥þ_¤à°SA´8¯ßEù|:Óöy% \ÚÚyøšéºž\ŽÓõnÂçÒ1LÌ[˜gs"}$)ÕàKÜ]sSgöý J‰4ÿ' ;[oäîŽ$q|,y‘’#­ˆõ ✛DLЮ«þ’¡M­µÈ.[ö”¬3Œ2ÙÝ!¿Sö*æ\gÒö—$QZ”‰á(‘BS¼t@µ±œ®¥”í\òCWÒéŽINbÔ£+I+]J­¾üÔŸœG;Å ¾Q¶"8¬‘"r½dVx…›ZðM0ùʬ ì“dWÒ¤ý2;òB@eå4¹tżbMÇ×zÐMy!Á˜¢Ä¡äHDãµ Búà‹Ó&YRãhü´ú™h¶ã”t¶Dú¨|Åpb¢7âû\H—³µo‰Jߊg䯝©‘‘úo*ªmû`u÷Kµ™&1ŠV¯Ùwn|[3Ã5$\”˜ˆÈœ‹½í›LbƒZó]0-E¢>SbÙ+³Ékr¬UË\Æa-ÿ)3¯¨sJ¶¹+ü¼yè~:ôÿFý”ðü‹_Ià94>%Zó»¤ËÏCã&dºÄ¦;¦6 ©‹1þ¹ã u„îwó¼æDÂÕ¿˜vÅÿ8Ù¹Q[×ÊEìˆÑìý”©Dýº‚Á¼]ÜlZ5ç­à0¥ÎûDºî”HUB¾·ÀVÎ$ã‹ÉñªÂÐD?~¬Ÿ\:Û”Ò’+ÿ¦òïÓä-³+ šYÈ©\(Í)¯;§¶ö9\|ÝÆOÈ,ì„;™ÈpÄî.'’+ªç’WÔ ÃâíRÌl§_žbҞůu(Nv<–u‹Þ‘Ka“°5›—’pN¤+Õ:)fvWeLÊm·ÀiU=/žã>kEèGЦfýÈ•b Ÿ( uÎøë®\ÿ>¡Gs ­ãéq%üõ.ô^^ɱ.td u¿…Žl×·Ë[ó¤Û×aêBðÑz£\”UdVENwMÚÁ Þ¥ÈQ?$}ô²ÛV¶1Öëø¢n[侃Ÿ‘wø¶N°/›¥A^£û…ÚÔr¥”qS@Tuã}4\[´Ž¥àíÂâÜ¿S^£ŠË:Çñ“Žr׳Ú:8(´y…ÚB:¤­ñlJD…±Ê[t>¦ƒ=Áú^Q+bÅ5]ë -µ_Z Æ»¼nùÍaý»Ð¯B×+v$šsš.n=;G’býBœ ÄT"•§ÿ³´øú”Mϸñõ*‡†lñÍ(ú _â‘©QØ¿EãÉu^ó) Pš±±^§qñXÄÆµ=XÙaZ]ÍÎ{ÛÞE4€Ö!Ý)³°uwé’q{©§AèÒ]t‹%Á†=è¬Ço†ÁùiAèPb˜Ó@beË5‚1qŸw´íq¹n¨]ܨχˆ×¾Q­§‹cä‚(ä¼cóNãbÑËN§û´ãE„º”¡åªåÒ Æý¬ÓÃrE+H¯Á“h•¢˜Æ ß6ÐåÍ>¦'Üóþæ¦'7*`Ä(ßhbO 0Ÿ·¼A—n‰ /É w6ɧ×AÅmÃi4¨‰m Ö‰A#¸hžæwh eíãaEÚ%‰¢Ueí£óZå»Öu‹‚ ¶ÃS¬æ­4Z÷c…úÖ¨B‚×E/Öu ï{çAë_U…½¨*0>)ÿ45æº^Ù‡&1N÷CÀÙ®A߃z¶näù:WtŽw$ÆÉF¤^Õe ÊBÆ{‘µ5Ž’T“{Íïs¢ @„Å¡ÜàqIóËob›åȨB (¯°˜>³à²ÀA²°Gm‹dH„ìž³vOÉð^»ôð!c`=%Šu@"ÞÝÀíaIñåÔ‘ BL€ÄDœ399¡@-Ÿ±@èG#Α|ÒÄPöKL†’ÄQJ¶XÝµÑÆ3^C¨ƒô'½¾9'µ ötÐetªtë¹oÜC´X€Y$4y+Bw:Ã4ÒàµÆ7F–×Áè`¸Ã©‚gëÀ‹i#ÃçUÖ‘nÌ& ×ýE—ž”âUû#z˜ëøx¶ézyÌ™‡œãnsÓ¡cÞ³’ÂØ tß7–EÝ·áAæO¤; ´ÐûâêqA¶5eâc'± ]/*¯—ˆˆ×]eü™Å ž™Þ©÷4m‘ŒÒÈŒäŠÂѰzph—oÃ$f­¦“¢ %®"—(EÚ32”¼­³éšG¢J’¢¦÷ä¨mŠ^½‰Å^ ‰"z·=&š=p"Ÿ;9HDUÌP0ÆåL«Ĥ Ž%¨L 05NTdÁÎûʪãÙׄÝëH—$OÀ0Ê" ¦?ÀÉ,‹VÁÜÙHðl·„Íd4HïU1vÑÓÄå0ôì 2a,©²ùšÉµ:2íÆ ˆ¾ó¬ñ9áËb›ñ<¶¢WǶ(Xg&"åÅß,‡ ÃÙÐZ’䦇!|СàíѨ*Ùç@ë+\xb—âÏ«LXýœîKÎQ1w|ìÞ”ŽM"…Àò¦Ó ëç9ON1DªÑC)¼¦úƒfˆ¥õþ¹Ä´Y/‡N”ÃíS“|ßwÙd<ÅäPªº»I»µíœ®–`ödú3‰@QK^ñÜ…™Á͂ބ˜7Ì> ÓΧ8iV6 ?yÒ÷á}½‘‹Õ)·ân³›Ö8tµÑÈhì4jwÁN\6 ê䨰*e·UÉ ìµÞpp‹Êp6MzZJö÷¬’š?øGð®¶m“Ó~7¹|áôĸ~_š¸§Zð”¨àïiZ‰Ý ÷b˜odzR€:LwMõÁhÀ‡_¹«­ ÜbÆ^mô¢n¦V‚®¿¬á;î‘ïûY¼Ž‘ ip¯B Kã“J¼–Œ+jÒ¾ÙÈ|Ø©Ùb\¬¬x{°|û¶|J6ÅV’£$¼2‚[Z2tž#Ûb}=|Ñâ8Wc¨}[V–{†!Ku&>Go1d¹ü›†éWƒïù¯<âÛìÑœ}ùhàœ¤ÓÂßaù¥P#§ùBÒ¼'~“\ ¨Úþ…¹”œ1å´2oÕ¨œ•2à•v=VHoLŸ’úô몠„^÷À¥&J@a`°‚ Ùþ(IagiÎÙM9KàOGõ3V ˆÒ0TÔ¬¶—$²:ÊlPÆš»/•ƒ:EØå^p®àëÓs V8ų”Ä‚T²ýù¢OŽ]ÆÛµp)¯1b¤¼›B‚ó±Ô’Iø,b½‡ë„q!˜¨Kñ^Δ^!CŽ +³ÅA>Dcê, é$êéÁNéfùe.uóÀûúžŸ‰ñÒòñÑÒ"n|h p _¿O²ª\þYG‰h IÖys$ß0 T±T“žÌˆ)Ë5P“ßÉ*ôçt¨£*k`»5”‹Ä_2c‘á1àþ)W¬’:Ø”€¨á £,Ô¥‡Ë£²¶Å0Ueb¤Ø§Íë'¸ª²w / ¹¶Qj£`œ‰EwÛ’ÏêBôEnøÕgv…%Œ^+™_Ey-#QTm*¶M¥ Y>…צ·PΖʚáОç´fÍ•â)}ÇËȉpxÖ< AO—bOPa8²fSIBªÍ%s3tæ+}ùÿ=t­ÊÚ ìße…ãó/Ù$¤§…Ób‘de?`YSm@~ª«ìÅTÌëŒBy*<ÄÔSáÒàOEOU±´ðø!à“§ê2Ƶl„ª‡$±”ЕÇx¯HOðAvÛúø–f!†+8䯦ò.pTßt¡GÊF•«b Uî sA.ìV7¨ïº¾PTQ§;[ÿ†?ÿ]·ˆendstream endobj 528 0 obj 3869 endobj 532 0 obj <> stream xœ½\{oÇ‘ÿ_ɇ`œ ÞõyÇÓcœ’8Îå|vb38v HŠB“’%ÚÒ!¸Ïžª~Vw×ì.%ÝÁ°½œééé®wýªzžŸÌ“8™ñŸôÿóï|ô•;¹zñ`>ù þ½zðüNÒÿο?ùí) R®L˼ˆ“ÓÇâÓâÄÉëõ$äÉé÷¾Ýø­ÙL[99çÔFÀ"\Øùyž¤r›¯¶JNb–zóåV.“³Ònþk»SÊNR.›?lßz;ͳߜÂÀÉy1«Í§x[kã$L¹›'¿Ìn¶ô©/¶ró< afë6_owÐpçÏõÙ4Ò~ó»0¹[‘fYÄìÒ‚º‹dèÃí2O³yqýÐ/ñª”ÒZX˜–Åëåo§rÅ9a5Ó좧@ňæ¶&ô'4Fâ¸]¸SóäIJÄñ~;OjYlc‚·(å…Ê—‹‚¿¿B©Ék ¬Ä(ëÜæï/ÒéÍ °Ñ:#Ó%áÄæ‡íN­Ð›³­ž¼󲹆-z ‚—@äôÈkxÄ(”d¸óÎl^nw 'f¶ôáWy GdŸáççN?ø–²ÿIåæ%\Õn2@áð J³ÞÜn•›Kù î[ Ï-›Ÿ×§®³Œ¾{o¥€‰4ÜRÒyžæq7õÙ+˜¸°,Š<ó ¥ 4|VÇ’©êØ(Æ€ðçŸÞ‘WÝ÷opÕ~ÒjÙœ‡ç¤B²ÕFm!áá¨P&‚Vý ü3-B/ŸÉK{Ú’À)E’眰up!Ük|Gm²B\ú÷($Ö:àó3†à—eð«4ƒò”"—[¹¨ $>éY×Óqž8†Çexÿcü^ ÓâŸÏ(•ð‘YÐá># ˆcœ}1:3—/AòË;ô¡ ãöÁ¤xæ waʃQ–´…íø§M4]ˆ~³ƒµ*Ö©´KdÚ øŸY|¤‘©$Ý “Q,$ʈ³ä:ü!,U8ú÷ µÎQ­xM$ü'4ÞRšfÈØ ’÷ãÖh4ð>¼»ðÿŽªn§y„UœÕ­ãpœ{•8Yษ ­oÒc°¤‹: òÿ _ª‚“¡Í@|çMÚcáµÉ!4HJ + óµFKÏrBDD?I–6ž¼­îõiÐ ÏÁ~²jü¼''ŽD©¿¤•HÌL¾Ñ{•-©;þu¢ŽÖp¹œNÁwþv‹û‘ÖƒÿÝO©gXœUUx“ÍSn±D‡ÊíV}`“V®©J6D Vƒø‰…®ïI$O$?“!ˆ¾e¤Æh…(öر×{á÷ÙãÀsj ¾W Ð""oÎÁPðt‚¾â°2TŒÎtíÍB.ÞÆ‹óìŠÀÂKˆ€ÒãEÕ*ÆeïBà÷Ñ:^d¬¡Òžµ"%]7ÿ9ú^m@ä€y[!é[ý ¾YKáA¶ÜZÎÁrS­‰Rï'a‹ÔýiõõѪÇDÓ¢=ˆ¸QÁº„Q«_œ Dç‡2}W幰ЗÍÍ Þ„À ž^‚¢õúº>WCÛ$èqç­ 'ûæ%‘±Î\¢ËR ”Mó¤8ã&Á¸Œ¹ÙÃ>¥Ð¼zbl6† !*¤ûÒÇ,ÒÂ61A1)Õòq‚y±bøòÅœ… Å2A¬ls ù‡í‚B§]–cå<…ôF¤%ÈXH1:±J¶F90ªÏ¬Ï—Ùç,µ‚ÔæøJ1f&ÆIÔÚ§Xq=ÂE©v¦)¡¨ òÀ'ׯ ye— Ëc8ê– á\°ÍA~€Ì²æó}^"ÆÀw@#Áh+ìÌž›hI¶a“ ?H³"îì6.*Ýü“qw­7²@Š‚z]ÙçYë3+µ&~²•Ã!(Û—øF°m¬q}²¬2Y’@—Ö¬îüÛjðêÅŽa Jû „†|)rŸÜ ½Šæä¾qË]F먌 n½& ‹»·‹îüÉ+|Òá¨ÍûùÅßæÿV“{n{MÄH­nbè⩜O£¾&‰­Âü-, ÂÈ ¤)‚B0|êÒ¯˜h—űÖ°>uå+‡J%‰ÉaFš”v^—Ö¦ª(Ѫ_f$ºÏáÒŸ¯ÖÑUå^'>*ÙfV£Ç÷QUµ;e^‘n­6uÆhÕãT#7cdŠºÄi@›ñ(!0R¥J‘ÝLn†>GªàsØð”Q¹Â3Þ·í”ÀØEÔkœâµIø¼ÐhG‰1”k$RÄàh¿êLBã€Í3€–µlzIðöýJ*#âÕÕÎ1æÓˤK’€x¬·í,FF¢“ç¼tïQ -ÞãQÒ«†<©#s¬‡3ˆ9J~µ5DsEH¨Ìéá“4\–Œ«@wA¾ºJ\±u}I£õZ,#åÆäÑ(’Dßö$È@UØè¥pG$û»MZLéG0þ[.|·Žu^–· rË#WmlÕ!(m\§`” î€)%ì¬ø]Ô -P¬¸¥ø£"J´;ЦW·ñ¥{âr.Øå¬B ø£47Y·dm‰*m”#oD^ipÛZÑ4Ä6ÞòÒ_v¾ª=I¦|)ÅKq…;H’}ÿêñG` ¡†Œ)¥öc`­œ.ìµ0o(°–äa-kkõRV""VöH®ÏÚ16¶¡‘>¥¼ïG…u¯kTŇF#M>ÀTkÅäÙˆ4³¨vïPHð=WN[LyƒhÐå’¨£Z¡Ypé‰W^ O›øš®ã6Úh Oˆâ‰½«‘ ™…¼%ÈC›P àÆEÊÙ”lYÒÄ7‰mxóœHú]µÇ·Uèœ#Šû42óÄÖv>D`Æ{…«£‘iµáf0Yß–ÙB¢} £‰F{ }°Âc@„æ( E£5<*}‡]C¶dTmu”¿U “Hce½§†‘aè4æ+•½žŽöIA”ÃÖ5dž‚L<ʼn:ž&¬ Y²ÂÓD3¢G„šÈ+£A`œw}ÓÆ7Ét@è[WQØ·Æ\“_d¢£9;Û(½ø >t•5TŠtÉÛh¥h1zXÏÈ×bÁ¬_ ‰²×Ñ6‡eï£?8‹wЛíº:Ë>£^2ÑU7È&ÉòÚ£§Q@swq*pè+€ö<#õJ<(mÉy@¡®‡…°¡’Û…¡ó¨|Á–OG&Å™ ¶ 6JØ6:Ï’?(iëjGT8¯›Ù°ªE˜°* ?|šÌ”*Ý€c¥4ßlapOi&KNÁŠ’Nœ‹¶‚y2PJ¿»:QtøB=I¡°îÑÜÃáY ¡iåR§ìYÈEDeeÜÔYdÙ¢$³RuÖ9&‹ZJ’®06[6lÚÛeûµ:Á?UŠäHQ›ÜäuV¦ë´«ôÐóبkËKDº›d+•$ÌÁ¬D.Ôíd„ѽpøkJf¹\7—TV*gc(cwûö¢Þþ°IAÍPg€i½Ëy‹Ì˜¤êÅÑ`ÒšØZÙò§²¯–A%–™:ê<‘¡ªº£5JæEõ„8„&ÕÌ.¨?÷ÈÍ>û?úHbœ[‹Ì=N,eò‘jqÁÞUJ½2&‡ÇR-=Qš°0{VŸJ!¦xÅT·®“†ByŠû”=Ú¶®ÜáJ±»ÀS:4°*«$@#±Â¨),Œ1WÜuë42Éi®1&áÒr7)Î!9 ‡²µZlpA° FÁÖ`~%Ç丩fÀÐÙáfôA8~%ã¦%h\ƒ¼/Ño'Æ:‚?{D&ç šÅåÙHÚêzØ:j bÔGÞ˜I\5²WÞjiÅ'ËøôEjŒP ;«rà‡>eüÇü²nº^,#k°­£ábº(øi³­äXò—¥þ}®ØFð üK‚Òï*)ž™C$µù=6azÛÂ@2Äa«!I}'r_õAúhè‘Dl)ƒ5ÊM.ÄHÃJ³ŸœÃ»R#}tGt:á.К߷,<Ç"wᎽ·öÄ´蟅¹TŠ#bsÓNõ!®ü·$¢Tˆ²R ÈLvòÞV;S" Æ_0ôû‡ ô¿½µ$il’W3Q§ñ!þè±¢1q>ÛêAyr>‹óÍmV@’ë¶ÐPªøRÖAP)éD‡Ã¬ç{‘ÜR"%5ŸdƲ³6qI=À„fMâIê-í q-Äé°‰iù \©2%2ÂîXkÆö㻨ZdæYÖ?q²ÏCç‰Úp oÛ‚‹½ÁÖŠ“òhnËÁTUenLj,HÇ7•(G Åäý’ ÝÊt,Âøjì,ÿ( ¾‹i0"ú¦Å´,!=ì²p5ÿ ‚1I=¦ßĵ-‹Î‡2ð$Æ Æ_Ñþ_mC+ZéQüT„a‰Ãå^'ˆ`ÖÿWÞ$ÃãSòÔ`íÊyõ -¨2ƒ¬kEëZ¤öÔtCž›÷<âáos9k½¬'Fº+x¥¥“‚WN=-²µ2B-bÛ¤6‘ #Ö»ØÔé²aæ»6UtPŒ–È#Ö=MÌj„—¦ˆ2¿µŸQ뀵Ռg™©QF¨WŒW¶„:d«}*ÆßïFÄFÎÙŒ­{yô‡É(7Ö.rÀû дeŒtŠÆ¹“ãCŠ|µ†ËŬHzÀøãFz C™`<##Úg*ˆ¿ï‹`¸­Ÿá*°&ÊRX’"7‘jæè¢‘X̯›¸f” ´ÖM·¨7$|ÄŽìcFS’:Ì‘:dk €q¹†evrÿ±Ÿ|Àİ8ªýÖ? ss8 ¬ª*U«Çù´\{‚ –‘GT ÊØvÆb³¯Nö~Ýx’¦EM²)£ßç,@ŒK ~Û‘—A!;pþH¨2ÎÀðˆûjs\+è!Ë?¦ ?‡T%q`'!¿}E9Åç©‘®ä;jfÏõÈ•œUrVôøàè¤ÄWTF¶ö–L´ m֦èOüð½®sìéàÑ¡p„E†øæM9*0¥GXoFºæ€bÓ59åRÂl»üª¦¹N`kçÅ@ â»2ýdòsÓ‰*ºiUŽiæ{mÖ½„ˆÇVj@Òh¶`B Î6Ú‘)Ñ#Ϧ@•ÄÙ5« 㱘j•ª@ßÇÍljúðX%ª‰W¾D[ÉŒþ­JJ›  ˜%ˆ0=ˆ‰µ(Ñk.†ËGH!ˆ®dûìäB‘<|œ­ž•½^ŒÁÊžÓy9f?ætQ‰|º‚=ý´O–…zc&-=Øür.v¥h‘BΜ’¥º;V1´çе%·ëÍèËU  \¾€IÇ@aÉ¿æÓMá?$ãiÓŽ´'’u¤³‡"³ä˜mäÔS:6ËvËtYkÛ#G)TžL0KÃ%Êíëɽܣ©’KNI⛞ˆ9¦_?†ÇŠÍÚotDb„R°šAåÞ a,¿>;† is«ÇÕÉF:Œàw5±KÁ¹FØFTSÿ¹X=•š°˜anÚ\TQ"åù|¥­b”–‰!<:ú¸'ÜÄËw©cCi>+xFÂ0yŽ6qÿ‰M”¥M—b<®}›L ~¿…!Ê·0Þƒ…„Õ`·bpË,‰˜ý+ŒCÀ ‰) Íhø€€ÜNåÁO‘­ˆ@Òø—rGÊ9R¿)á—˜5:¾°Œxñ¦>~[.¾¬/º,Ÿ×‘ͲóÅërñ=|»Zò†]Òu‚뵸¤©Þÿ¢þL»Cñ˜êòQü¦ü G)sÐR¾Wˆˆø¢¼÷nЧüdáèÈ‚º BVøæy¹Ê‡ÏëšN9>| Ë7δԿæˆò¢^,ë ·Óý'õþGÞÊÅËzñy¹x˜y‚¤Ä’}ëä™÷ù!æ}Ü0/' g¾úqÏÒØ\BXŠYF° d5g…=—鮆$1~3aÃb_És®³÷³ìý„cïU}èŽ)•}/9w{øâ~xe³÷«ã¹ÿÙ!îB¹p=W@="Ÿ42€õ¥.£rp[äà=D‡S”µÞa¹ùe}ÓW7ÿQ.þƒ3š„tUš.êE i‹nuèÐCSÖuI úp0‹HÐß·Alºx½ùu½úë^‡³xSTåŠÑ¡§…ˆ7‰¼||ÞP¼x›GWòÕõ§‹Ä”Y.ž2«whÔQ‘…,¥Ÿ•‹Ï8µº­_Ñ5e zGöݦ^T¯Ò¯]½íêCÛFÄ,@,åæó¼ÛñѦ)ýñ…˜ ¯F9I ‡­÷€J)âÏ}žó)zs˜‹†aìÉõ¡«eoWfj*bMï#ÍbGé/ò#ŠÅq6~¬¶¨æ,òl[NÝçË5d“×u!-Xï¥{%|6 ƒfRu\=¿TrDŽtæ ×ÂDqŸÞ6È–ȰلÖRå…<.³G´~æC~·m–¹ÚsÍÕYÆ“vˆÇîï­KôjÓ‹ÕS´1í·ÖZQ%ö|2ÖÊ3’ÖÊBÉ>xôˆædCž'ëªY&¢ä¾Œ×!Œùû6~vȾ¯6øÉ V×P¤fO“æ´·÷ B± <™—jHßx{ë¶À ô\”f”T¼9’ª©©ñ²ðz‘ÿqħ{ÀXãt@—ÿ!k3À”*¸ù¨^¬xí\!á¼ü"‰§ÈÚ”QŒÛ ˆfØÙt¥<ãVF`ÖºÉgùFüó¼ÐæeK–™v¡ ñÁ@Œ n?r_¬ìv¬¯`¥ÁÏ¡,øQ³Û7FÖ33wÃúI§bÚýfxI/îcæ'OWf¯¼VVágÜy䡸e7ÿÍ$l5©ÀÞNßÒ «\B2I‘šø%Idº3‘["áõ¾¯ô ø<>]é|Îmš –Î0‘ó&(@;YR®ÜtkÊ?IÑI÷é郿À?ÿEX_endstream endobj 533 0 obj 6013 endobj 537 0 obj <> stream xœÍ]éoGrÿ®ä`yo#ÎNß= '»ëM°Y86‘8ØÍ‰´("¼Dж”¿>U}VÍÔ¼ƒ"‚À°ü4¯§:uôó‡“qP'#þSþ{~óê—ß…“ËÇWãÉ7ðï嫯TpRþs~sòg0Hix2Lã¤NÎÞ½Êo«“ O|´|yvóêO›ië6qëþëì_à £èz´Ãäᥳ øOÛS3„0Mjóû­¦)ÚióõVo¾ÝžªÁZôæ¬ùm~jlÜ|O L‹ëlx®õ4h6ä‡6ãr œø°Îo¶vˆÑYO¿ø ×nPcÜün‹/6ÿŒßÇɵùÃöTãxcõ+¥‰pÓÿ ƒ½w!¤/ N§6ßoO|*nþs«‡qt°K|ãl Ó*†ôî[Ée#%שŠðŽ=9…³5M™l_Áô›Güã ÿ¸Åã£R›ñ¯ðmˆÎÃÙÓ˜ü ÔHèÉð?oúÓOýéžz5¦eò£}Ü›öð¶?¼¤;X®ó±}½àÔ8Ÿ“¼„­‰óÝÕi{ù3RL™Áùï¯Î~QHƒ{Ü<àç@}=ÂÚ?šÍ£\;‡i”³aqwý˜}éóöð¼?¼kÉ&7í)'¬µ'„%' “çM‡} $Ô†9}TºìLJ6_)K6zµ }Ý~¼NúÝôþؾIf"Rž}¬DWA@ô}RøRDÿ(ìD¿ì”¶Á¤Ýi÷3d§.àG-«ÅçþñõNeÇÞãŸñ{ΗÄÅ·MU®›‘ÝÚ)—ü\“¾ÊæØyu×÷Ðeøý¯ØvǨ ³Þ³Ó–‡÷ ißÒ}”O×Lè;×ó©ì>UÃyïwëògvÈÿ+¦ÌÔ0e8?‡)„ÔÀOÒì ã4S«»¢k@uÑ–‰v 3š°à#N‡ ¼(3è+º˜õ›ï¾~|ê,$\ìäfÒÇ£øÐøõÄ] !ÉEós᳞N®;úf4Õh’'IøÝVPÄnìÖ¿rÎ~)£ûyï;£9÷£?€gF™€§Çx“4²G„¿–ÿ+A÷–)ŽY"c&ºÀ<¶mÝׯ·‚Þ±æW]úö¤ÙD‘$Q1±ð¢×P’Õ¹Ø rÜõH|Gœ]<{‰²aMªNvOfí˜ëºÇr,‚¨±Æ¥NTí§« ðõ Š?ùø¸jÕNˤ‚ôvSõ–r¬0ýù“qR® p2paÈû/Dv?J´¿—ÞrÚÇMÑìuö í„‹hÅÃ÷¤øH2"%c•BÏw"&;ÌqüZÌ=/zœjøsñ§à;]KÊç"C„°O9;¹dcüh +Z'•5w!'ÊЫ­ÆZƒÙüÅv„W4¼EÞ'ºÝê08;fHYåôŽ´“j»¤0Üž.vß 7ëèƒ#=õ17[ Œ¶YŒã`®;ÒÆ&ñÔVrÙôã}ÿ¶èꬪǺ<‘Ð[hÄÄŠR'(T=W©¯ƒª ¾ ̨ ›¥–eܘìÂgð·|Öc£/®X–Ð>-®c¥~GÖ;¯‹´Õ*#ª}ªžZq›Y&qNQ:7Š႘.IJÙŽ³± °³Ç ½Vƒ‚8 JÁÑ>„¾œ2SÌëŒ-\1tKÅÀ)`$„þèÈ~ÞbUrt†È[ÿt[lr(k\ŠÀ—â†ßà ßüý6¡&=ÆCEÔQ‘$ƒöHgÞÈu¥@–`¥Nh³³Ø'ÀÉ÷‚;PnªúqK÷–ÜS¹ÿߢÜXÅÔÒÑÙÉŽ;'g3p(áZPør÷ VU,Œ}b¦¹ƒ¥ abJ$ý˜‰jPêHýð.éÔ—èÇ„›;ÄÂ… SX›ÿôƒö4‰¾ZÎTgt¨|#»'²7Pí)QŒ¸ïx]ÑfƸ.é4|Lj Ð—V-è;U§çÜQL²àã‰äE°£I÷t}²Q”è .©…†FªEQ“>‘]%1 ã ^L“¼0¥QB!MR‡ÙL¤Ð·Û„ <¸šÙ!¢±œ Ù?&Gq”°ëñK„]Oö¡‹°SˆKf¦©Øö>E—ÞŠh«¨S¢ßgÇ'"$Å€L"€.šÓ °ˆæ2ï2eP~ûªwÜ•eÙ bkˆ±‹†²¬>ë-9Cñ à€ªZñŽtÜx" ‹° L/MÙ1±ýîG cat=7}ßGãþ‰¸ªV™¸þì§-@‹P¢Aä°e Ö:Ûw:hÌ’ö¨…öà€´™µ¸‡LÔø¾¸‡ÂcMbJ—Ñ"5ZeeNR£ pNI“Úú¬á‹Hîf4N@¬csµSçùú㬠L<‰ )½|™#%ŒôIŒ1Óïc‚‹Â­Š¡~Ú:;À!"G;Osc€“ G6‰¡u(y ýˆöÃñ3¨Q9»Ë{Ë}k²‡É¢£rfÊΣø¸h4•ILßÂf)0!þÆ–Ú¶RTó$¡ÔÅr¨t¼L÷&Ê_*žUXvq›??,@-úŠO%¨•ü»T¯¼é<*Û„ë¿èÂf…Suó 5Ânðã,EQ%ì«n7 B³PLgÖ·Z2ô­nó¥ÿ¶¬b‡Ôã”D{Õód0 M˜¬›ªš7C¯bR;y%íOEü…ÄÒ.8h,ü.fwk†&"ž…Ü(–èÁ‹ã2gä¼ïRÝå¶¹µÁ=pnê[\ ½i@ÒbªžYš×g«©»L5|[)~™9J CHù¥cs2¤æ‡ë ñ|>œ eRÀu :¥¼ëuÿãL‚-B*ÅŃÂùTn¯Sèb”ü΢3bx-V kž Ö}J|Û7E³«9î€Ó60µɲG²X`‡“Ádmü¬µ]¬Û£u„¬F6NÙ#1¹sëÑNNÍaȨ$GB0lÏ8%úp÷±šaªHI¬H“(„¤j¥XÕ¥:ŽÔO9 ­™oÄÕê˜õœcR‹( ™3´Ví~úL¤²`‚É’%p ìr:åIÆ ë«ù‰œna†EöxB/øòŬބ[±ŠnååJî6Cá™M!ßÌÞi ùÜ7õ&o|Šžcº¬„ œQ(Îá…ãÈš L“ý¼Ç-eå5ºÕÛ›KiòAبx]±k\Ã,LGî;ÓýQ¦Á—¹$”¸ƒBóæ5…S ëL;Ræ'X¤nï¶&5šO(xg'!±ÜC`;dÓ‚Ö¡Å¿#hà>—êØÊ‹™“õ˜¤Bˆ…]„óÙ…µqürë–Jœü‰–Ågó!$দO³üÈ!~%§G~Rr÷M«¹åôï2ì®6 à‚ˆæ¾ŠkÝmÉø½;¼/1ý$ÌԛꫲωV×þÎu9c²Ý½ÆÀ—Xr3DÕ>‘òaê±Ãìm¾²õå‰gL> ­Zú¤ªTDÐŒGO࣠øSÆYÝoˆ@UJ1¬ §RA3±ÅúA¯dPÀcH]95Ø™2Ö¦±ÖëRêÖz] I–˜i-l¢™jXÚcdû%šFÂ#o0:t›ßNãAÀLç\ýsƒ3d5DéØ}±ÈÒ*çç˜@¶e*…‡g¶R[L9+gÄQ)Åô߯"çNz¦<­ëŠ@$y÷™öËœÜ[æQH\éœì\æÚo53ýëHÌBHŽâ¾Ö×xÚÂuÞ#Ãk3@4îKÜ7›‘L :*CŒõ¾&9®¸.¾6«aH¥ÊAµ‘ejt%ÀÂz é÷1Öc™«}ʶ¹Š5c«q®êD&w3Ý‘ˆ©tO"íÛ«8Zçè:gÌZ§éÒýäºLƒI"`û@\ËEMê!Þáàµõç©zäÌŠâ ©Ðc_qæ¹éŽjØŽk@Éy²2MgÑ­Ø_±Ù—èG©¾Í Qœæ¾-å¼FRLNê wÇ™GÃàšÖìŸ13Íø%Ñ5+?Ý2%¹›ùËE»y‰óÁsLz’W57fW˜“ ‹Í35Þ÷)gGº¼–± ôs=ÀÖ³Í .iýªu`W ³³QÙA”ácj)ÿG_QÉì‘“”Ì üZ1¾ó׿_¬ÂÍ£‚_?áÇìXºÎÒP‚ (6=¹;KKq¤lÅcd†R€¬§d‹¢Bq¾I÷£Äèh=dtïì˧­¢_»)Râ™]±:ލ“ã ò\eHj%x(z¡FôjÄL`¬£\Bm•¡«l}ƒ–ðÒxhöªiKfµšŒ¦uÉ.ÆÄÇ‘6àÎ[²ÈY¸õîáú¸†ÀØ]ý(°(z>}Œ1y>ÌoÆ|ˆ7¬W³¤¹ö\¯pêrË.Ô<¦eNº]¦ú6禯¦“m,Ùðš=]»Êäm¿ÊmÃÞôë(´4›Ž‰Ò“2æ{5ÉÞ63µÞ 1¿wƒ‰…Ó­IhrÕý‘&¢jEú;B‘I &2Õ%}Ä’iO›—JA˜7©eí ©ÎKš8+£%µ¾îB!tû K›p㻯{`ô¶{5 :ZÜÅÞ^¼e¯E·Tô‚ÅZðĺwÊÅ4°ýS38wÜçSOÛ7u4"©n• Vá8:È\b©Ä!ÞêÐqNØ=ç}tÌk7®°ùïê-µL8Z߬¹iÒ¹Y¤M®esB„ö¾OÍn®,o–aó\«kɺtÚ°ˆg*3/ :)J1"Ph–´}Ó ÝzĦ]\6(’ˆ.·µ›sV½÷Z²ò• R¹¼’‡ÞOû„¯uÞÞ”~£ˆÿ®t(Ú]žë­´€+ϾGÜ`ñhä~µvQê• ŠÍ2ƒqÞt´œÔ`þ Ì!^yh sŽƒ;Y”ÐJ/š.—е†°r•-»…YÍ3³ÒamW•¦žê;4˜¨PůÛÉ@-#ÿfË”Òêzަÿ̹ÔzÀBÉ·…èPæR ö\ì{ÓR"V¸êÆ4-õÞÃ2oΫ—tñ iRiR4­Éœ  “ñâ—ýPè/~\h&Q šÞ`Eìõƽ™XÏ.VK*Þ!‹:•¨ã<èÚUE?ïÈk7w”}Ínf! ´&ÿ¸…ÝΜKE:²îÖÞ[„I‚Äï±$`îv¨nÀ̺ê–6¡Qîu³bèoIöd¡q&iÁ t¯î¯\ó”2ç³î ¬ѽz)‡1»Zuzª ¹#äk¡ Š%1ð»*üê… V*ÞÛý{‘ˆp÷=MU•‘ßnS®;’GlÎ"ãäÌR—”®Oׂ¹Ï÷œt¾m ·;¼ÝWΖ“™‘1W 7xv&'¬SI‚Ѩ$¿×µƒØUIpþ‡% þê@íªGÂöLãÑáD›î µ §óVAH ¦_™†Ü-6MÁ¼/ ¡|Ÿ 3T2ŸQ)¾\éRæcŒóÈ›$ŽkÌÀ> stream xœµ\YGÞç?¢5~p÷Š.*Êë•elð²ÂØÆcy%{µ‚.ylþýFä‘•Õ=¬½B0EVV‘q|qä¼YƒXø'ý<9_Ýyl×/Þ®Æõ×ð÷ÅêÍJ„ëôãä|}÷:)-ƒ½X?_ůÅÚʵqzr}|¾úyã¶ÓfØÊÁZ«6þ#BÃÎã •Ý<Þ*9ˆQêÍ·[ék¤Ùü´Ý)e)ýæþVÁ§fš6¶;18çý´y¸ufG·9†ŽƒubT›{øZëÉJr7Îv4ô«G[¹ù>0²±›¶» >Ððæ»úmFi·ù2 n½i/F›Ô4’®_lý8ŒBæÅµ]¿ÅV)¥1° 1xï´ÿ÷ñ?œ@1BNXÍ0: èñ)PÑÑà/vÜ¥7;5Vx; m¤Ø¼¬ïŸ…•Á*$­ùÞÀt:.ù9v·0»§'t[å …!ëg“àÈRé°¶œYÏ´A>ú9F;z:þÕv§¥´—@ÞisRº×.u؆u”ËTVÞ\׉ŸÆG+X‡îlå`™^Àº'¸þ·-ò'ø23Hùä¬>’±jûa2Q~„¿·»ôÏ>‘™ô¸X$½0Ž9¹›4,=ð±P4µ{aäïð¥wÓæ†Œ±FCe¡ÍNÀR0£šsÜ(«§=î„‚2nõ9Ž…D±™¼x˜õñ¤°YbHkg¼žÉúU †Ö…û€Ï‘ûð¿ ‡‡#SzÔD¦ÄÏÊãOpÖ4ÓgNÈJ7.ü›}¸:þëÏTÇq6ÖR©"B>ã&3ê%nÒj=¥éêÎðPÉ'xf Ãôd‚š˜ŸƒÙæfçtlÏÅS;(é=òR÷ý/›ÒÊÔFšš„_¶8-ïç›GQ&›Ç¡Ùæç ç-RDÌ’(bÆÈ=8††Q´\TExȲ·j+Û42ƒt : ú; ¹¼MÂ’X]&n ÒÈLÜDø:’D‚âGå)P„²ºÂ׿Eî“ Š_VaÉfËk$sÒ­y¯ˆ {yä³(¡Íư5M £r[HbˆÈíp:j€æ/«í%G=†®GÍÍ·¡`P ûͺgH`€ Iù„µ 'LŒèýü13ÄFÄAÈÆ aþË8¶w¦ÄÈ=숕6\¦3ƘDk!ˆâè‹ëíºÐàÞD‚?Ñ–Í¢iP¶>Kéû¬#ÇsÃÜÛ€.9ú$Q¹Å£p›÷ÛI£O9鬰ú5åê$)­¦KÞE,µWÏ£r›À!#ˆ†Á¸³ÊkÊeÅaZe‰¨˜©À­º1@Ý1x}`±›+¡ÂÜ(SEgì5;BÆòÍl" ®I‰Ú­‡t¹mušJ!žl´u^c8,•ð?—¹ó­O;V±. -ÖäCà·ê(wY›«ÀpX“…­DÎé(^Ps¬iÙ{p6žQMÒS:  î.¯k+¡ªÑ‘јOÊ.éãÔo†Bc[<†G3 ÒÎf`>|XMx%©”T+Ñûæ´ž$;¨%?5ÙiÕ7ÕËÂ>¿–@s÷³V$2F`’þ<ª_cö” € ã- yFs–c˜…©W|ÑS„;gäjÇÌCæT M–|Š›@… B"åp6¡—1ÇB|1Ù唂Ér /š¨®jŽº3 àH}QävíêjÝ›QÆÄ¯®¼OÖyZ¿!†°qêH6ðzpDîz2w’.ʰ¦6’8Îú5wkGcq; `Ô 0&*üL1·#XT8°¼`Ê# ½L£K&`Îg’cð¶_•N(ÀL΄N±ñYm|Ñk¼*0¹–ÁNÁ^çÖWµëEi|WÑ÷K A/ipCžŽð v~TGˆBÌ"cöÄÁ݆…ð-ª°¹ø„gèc\«ö!»ê‘‘:7ŠÉÉfž×·gtðù8=9ô.wb²SC£ûµóÃÒømmüb‰p õá^Qµ‘ß`tãFÑp[Š!1ÖtïµÞ)ÓÊ3Oo3g‘Q&ªn4è}PéN¹M×ùŒÚD;šs ›»j  ×Õv°“Ú5zgBhÔ$Y…ˆqÝÙ9sÆeŒøP« ˜ëÄm`¦·éÛˆ¬¸/ÃU}>ÿ¡ïÐE6¯Š·*uW=#¿¸ÖE£–âׯ»>ë,nûèrfM¤æ€Š„#Ñ Ë~‚þ:)8Tr¤Šp U8DiԽƩ6ôsò$à|aôO¨º0NâgÙ›Ò–FQ]}”lN|ijf­ðˆAö{ZTÛ \|Y¯ëÕÜémš¬eDÈç$骾¿,€¥á°)NJãuπϟ1«A¬RTƒª™*?â\Q½óô32Ùy¥ÛÓîlW}‹qÿT­ OÀíÝuê“G9홈çûmâ³òtšÔ2xÃïK㓞á¸f{“Ñü@Þö&ºî7ƒñ›°™ XÚáœæÀtPÎt€¼©·ìDÊãgóÁü G3³Q€Aò®ø/0ëhZ({[?jú¥8#ºÎ0ý3";P^f[Ï·j”°¦£Éã!š.Æ6I’+foŒ|ŸïÈó‚@,m¸ÿÚ€øoˆæ&K¬É'î  W¨Ãâ3b×j ÿí þin#ùéÆn Zz¨¬5¬JÓ6sb‚/­ºÞGåÃI4†Àù£¸Fð¤*^_6<Õ çÌœêBÕs–SVâº;xqpÜoFIÅ‚ái<ç#¦*#5Úi‡‹à´…d%â´êvQpó—葉úè­ŠÉáPR \ÉêrRþÑwÝBî^sþ Q ÇÝW h ÖxRKu æ¶’ð°å0ÀÖ7mS­>*f¸Hü¢·ZˆÕ£ó½HÍûA‘Ùyë‰NކU¹w_—aíBZý¨DΓlTéÁ š¿oKI|v±ƒ”B_*Œ„„ú1Ÿ0„i´Wˆ>ÚbRg‚c¦$ÖÁój\â]Þ/2¸V9(´÷ÆâRȷܤ·U°û3Ü«Óo°ØŽ†×%xÙSèGfÀNî’^ûò§$¯Õ’9MØø* Ñ&DÓÅß³nŠÆ˜q8Ìo¦À²@ †¢?N*íÎÓ~¬DªÑ‹ÒøYcŒ3ÞÄà•ÎT°Kò Ø •béB…¬5©Æøí §Ô§&¤Hjt§ŠÔ<=P¾4,Z¨{(X‹U+‹åh;¶&Óàˆ³òq)>ŠGÌ^'’hMf¯ÖÂ*ki".‰ Q2˜ ø‘ÆUÆÛ±›Ë˜_Q2(ƒÊÉxâ4ùÀq}tÅD8®»SÆ"ä®UðÊœ·”sXˆ6žÕè$ÐÓ…r<à g€ñÂ%ü6Þä;qô&êÜuú#€AmÆ¢™(·ñdd0çTŽs%HÍeï•kì~ïxõýêÍZ©Á„ÚLX¥[+ v€ 0 Gv:9_Ý}°ºóà›õ»«ëg«;?­ÅêÎ?ðŸ»ß} ?|µþËêÞƒõ÷‹e Ü3Èe Ê†µbDJ¥ ¢òKs ä,?"ȼ¸G€Cz0ÿÿ=jØœÓl2ÊÕ •h7w2¤F³¥‰jS¨„Šv¨™€X ­GÍ“N0ÕO 1ZF¼jÆ\ SÍy'Ç3ÙGï–À¼®úajBîÂÑÄþ.F倰Vv1á\nXͤ&ƒ§£Q7þ2x&"²~âÉù)! €£X» åŒà³ \Q]DPkçÅ¢-±z¨™‰4#®ÏLó²H\ÿTw‹^ãrPM-Öz‰ZgF³K‰ÎM!©F^U”Œ!6“,¬V+pÖ¾R•pôÙž„ìM¶Špv'ßs«cx + 2!‡Õ½’"¸2Yé{»É‘†ÜF÷P)šGRY’晕Ž|d9XN fšþÛN¶ªÏ:oC»P¥i=,ëEãƒ$Mò~!aÓ §¥Æÿô"¡è¹ÈÞ¢›)Ù˜½¼Ó|ÌnúÌ^c}'½o0ï³'ÙÓ£îOpHpÚu]̦{¢ ÇnùLDF`Q`¶Á`ôÊŽP…Ÿ¶ÚçºÕíZßs9L'û™â™_ v’G®Ð‘³&´»Íj§xHh^L8Ë‚œF¡MfÐ6µ-åî#ìs鈿%Õ9°gÉÅJ¾òÑ[1–Bg‚¦yúÕ1ˆa$ÛÒË9ùˆ"ìä€PeõÐQ©³ÉGbXZ¡Xûœ‘§Xë7q¼F÷ãæåñÂK¢Wª³j1-ƒôy»!qNr±‚Y¬ø/•'®è(ë•o$/³º‘\š¡™”DzÛï\*¶mjcºaE5Åû#] Zˆ\—Õ-‰]®ê$]Ñ\O,Ød­9´WìTÿ,÷¬ XŽÕ?qË*‚¶}‹UV’ŒFàéUʽ{uƒ\s[!õUyy¯¾¼_ÕÆ{ªTã¤Êïo—Æ7†Á“˜¡àåk9x‰¡^·"q÷lpÈe;žFÀK%ºæ' Ò³Qá «1¦ˆsLnfu"’Ùûº(×AndÿC᳕å2ÖCJ$D™t¸E=“5Î=ì邨ÓLBþzñbZšìÆ7a8tPj¿ã£ ÎÁ/1ŒÁôwè§ý‚ ¸ÑP‹ÌnÌ$Æ €³E™ÄÃOé£m'98–y8r/OôþQbh‡S28î‰CÖÃvœÜ•æöÚmì£#<ÉEØö)ãÕ=7 ºLßCùZ¯žzé.ëP¬úG§,ÞÕ¿wVˉW¶j …$¶€2?ò* FÛìžzm}¾›l Zw|Z´WÎl íüÞ ù5¯]Ìkó‹]#K”3Îx‰„èºÿé6÷%“‚^R‹ä¤ºÞ^“éCŠXšoã×Å28 …ù íùQaO.·†ÌA/í#ü©©½÷ýaël¼¿@SÖw öž0Ðÿ|àÉûï¶ã ¼ÇˆÍ°Å{‹.”–FÑ{/¦BÁFôæ.Ò87äð½Eá–ëõæØ®˜@Ãvôd±PUýÜþ+|1)cEmë™X‰õ™i½w·á´…ä2…÷UE‰Y;v –¿’[Lä.ëÉ̪¥[­Ê šAõn®°üÑ(Átá±[fÕ‰¡Pðì¶eMÂM}Œé;ÐÂÄUÉ·+ù=oöU¼Ã’l,«ši‰<†êLÌÚóиv°‡±´ „€€ûè3YXùM#“¥EHj yʘ N2ÿæ@XJâÐ×Ó´Lä_¥L$€¸À%ÍÅëø«Cæq1NM g l@¢ô<ûÅ;µp?Þ:½ÀliCÙ1³³]E3ÏÞð÷3V$PÆ• r!ôAåÓÜ]Ÿ|QH˜.§4U_„Í¢~2²^ Þίà‘ÇÂbø–êÌãKiØéV] qRéý¦½çwdÉ-Øå‚þÞw¾ô7*?/)!®3Íh„$ñ÷«ÿïûaªendstream endobj 543 0 obj 4762 endobj 547 0 obj <> stream xœµ\[sÅ~WøâÎ&Öfî*¤ äR„$ ¢Há<È’-;±%ÛBÆÎ¯O÷\{fgÏ §(ÛÒî\zzúúu/¯ŽÙÌþ—þ=qôÛoíñåÍ;þ#ü¹|جngï„õí>é5ò–ËYbúõÑé¯Ü]#›Îñ¯ŸZ&>OüÌKäßuycëvbDCÃ*Í<ülw'åáïá¡`°¤Ú=Ü•§6.e›ëò›—ûöy85ÌD>EF=Æ¿Þ&–I®<²ìéh­¯Fûƒ®q&-Nº£?tÃÒ}Ì=\è6T‡¹©DŠ…#sA‰_VšF¯¢Åx–,˜Q÷Žã ˜`dÜIæÜ Úpí]d ˜láÁǃ¦%VhMxù«‰ÁöBJCÄ8e˜ZȶbÑ0 fyx[åàź*zU÷#ºÕ…Ç<\ÁüÕA‹—íÀÖ­\6„ï¼,µ¼kÉD‡G•œ²TZ”:•Ÿ w˜lˆàúç“Dƒè 6ð—_˜ý²î¹¸V|¿¸W|˜.Ö+B^5øÛšÉ@qyƒë‡à(ªÄ?%ll !ˆ†¨ûÞÈÆUÏ…Šd{­(ݨ'7ÈhÆŽÞ_ÜÞÈ AçYð«ù@A§Cêíâݽ®ÓG4¿™$üh¯ËÌùeÒ¶Àì–32<ƪ ‚êëH$ºæ*«ë¿zr?DŸêYóV]Z䡊w†<Úùkê7ZÔK?>+ÆPl ëK!i…ˆ0vÁã*ºA}¤§‡&v‰Â+VýM–…ýþb‘ä3 ŸÑ›k®ñ0ªüêøB×ZÓ12)¯"S¥õ†²†C ¤ ÆÈš—b.píeoBYã4ZKaä/(ü蜖Îå|°^Õ€t|8@|Q„û6 ʱDTk«â$u‰ ;) ò-‹…öÓ ÇVl7¼ânÚ.´"ƒÉ-œHpZéNÿʈÆ[ÑqÖtÆUCøƒü« Ö²NñÂ^çÁ{9r©oÉ¥"QD_éË!ÖSL…Ë.G}‚ 1ÀyYjf&n}‹Çb!Ò}ÚHN¸ä¡ô™‡öV5mpO’/J ʨx\¼c„„ôY'šP2O|øº ©.“J:·¥Z“ÞIÅeˆ …`i¿K3´ï\Ò£ºåó²~‘¢©yL ƒàæSµQUŠ˜•K³khd f5£x|ï³OP$h Ѥ^c¸á4º‰8ж²½ù<ô ±Ô½Å‘—¸•Y÷BÃÙĪ´`êé=å6B©?ÕK'G»”0Óð zQ,üŒà’„m`™ƒ7hWïa4 ¹Ós ™Pã0ë[Ñí÷ä3jÚ•´{)¦i´ðËXìñ'4$YÂbÀ.6·IŸP ''áع¬áÂïìîÓòþÓ ; 1³aŽ(ê4Žc¼Ýé[À¡ÐôFŒ*P¿ìTsyÿ¸¾UÎ ŸjŽz§S,hlpƒ9P¼™ÏIpl¦…krú`*ugJˆ°]G'ù ®Û ˆŸeí5Gj|p¤Õvä¥eÞÀV´ÜÉ“‡–¨£í–ˆÆÖº%KÓÅMîÛ!z{~·è1›ŽZðÈÉÐÐMxÉ@8Á»­b!%0ÿè“u}Œ0®fXÚw!cõ°O+œqF «¤ÂøŠ8Æ–_Åý6áu\eû¬þØ9> €½qÞ4*Í—Jã ‡çi4¥§tàôµ‚Tt¸ç-u™yê'éíÈO ѽìéïö{‰-ôxÃuŒæd”ýšòþ§ýæë •žÿãȤÇ»° íáð {=\qÔ-òÚ¬UsðÊ¢ÿ_Y¥ ~i % WËÁ"ñ ‘;±ãéBÈo÷…Ãü íKDR7B L™S'ÉÖ(þÞ ‹·])’“âPÂ’mW*c¦´AÑ´|#º7µØäÝ0ñ*·Í5Çò¬¸Cñ[.ìFP¸.‚Rnæ¼­ŠH£FvUýGÈ8üÖUoBQ&©tv±Jñó*¥fñP£ÑÁÜÓ™)bSÚ 7¦a”Ú°º ¯ëEÜ­—r1¸þ.wzîÊêäy¨=p\ óŸËV*Ëóz¬³z»Ž3ªA§’¸9U¸ÿ–yÃ4³›5Áì3”‘f±¦ð¤Ü"µ$EƒŒShR[Ö„2÷÷B”%¨Ã`Ò ùÑ® âj)þ´ªC„ <÷.@(ä*!Úµ”&ª¢æ$þµyÖ0º"†¬1±­€f;ª…Óœ½jOFïG•ÛšÓFÊÒåÓc’HêL"¢h=bÇÃçSˆA¹hL°‚$3±E…Ê)Ñùe\p\ذR»g ÜFä.Ãe{t”`±xo´/ðM¬nâ:dÎ)¼±f¶^!âNø+'Ýà¢*øÀ΀åCõ•ä6ëTÖogœ9XÉ8•Žž?ѧ¬ <€ˆ-À-PÜ· $› 8$ˆ>Áæ;kU“Œz.N1BZ‚÷¡ÞûÁHo@š¬ŽÈD#Ã’ÏVÚ"Þ´÷«•e‚¤çãµiÑÇ™U1)Ï’ÉCk¥Ò0;%4>NDòã&aàœÑÈ.(ôY%ÿ»Û2ZûµjÀÐm[fFÕ^¢«[ éºAúx b˜é}˜©èÉAÍø¦ôµº–‚«°hî¡v×­N‘À|„€Äõ³BAƒ#*šDÃ6ó¿w?,Û&^ð÷B¸´YÛ6R˽pýéÆ Cl3 Ì®ãþ&*÷šzFǽ­žQRõ‘ćÖ%c­_ ¢|Qç Öw=&Ù¶!dŸ+ùš­¥óT456†…èb-¥¡…äVG:ä¶Ò¨C ¦ ™¼ÈÝ Òå›.c:"(Ïî]`Û |Àþ¾ÏOI/݇5û½SnNš•Ag‹ŸC:ŘgäŒkðsÅÏ‹ŒÆx†œçIû¼<<«/ËÛڙùQ@rî€ÜÖŠüÉàÄF}aÝcÏ1LQÅÀ &£ŒÃÀÈg{SÕµòy‰/j\¬¥˜‹dç:#€éB ‰h3ÃÖæ=[C–¯öÚb´vü5.®wkÔÀ½¼ÛÓXab×Oñ½¿¡±JtsB¾Ój÷BåÆr$ 'CŸÅˆ‘ɦXÏ„°:w6PË µÔäG÷¨j“E×Õ48 Àð«êŸVF`~ÀxŽ—QcukåâiÍñ¬¤Gï&gczô W"[ÖįžC v"È%B ¨fÚò£ErØrè½U&q¸T´<ä£÷¤KØ[í¾Ÿœ™çXc‡×^.#êc!œQûÌ5 ñ>Ü cdîua ~MÁf aœãá=ì„Ñåó°“E—ŽÅBôøÌ8öÊ_åG7øm‚÷rhG„™9éœÿ~òlâPF±VÉûwªäj•ÑKä£ï; ;éÅ¢›^kÔ¶v4”U%òt²Ò°·s ‚ʶb¥ùg`[Ák!Ãû©Û“Þ ÃeØ¿IöÂÃl?O£ƒß‡ìµý UWsœ…E.)êó.ˆ{YúÌ›n`œˆàµÓ!]jµßcʸùU]övd[NCÔDm~©ÓÀ†2íÖÓØÎ#ˆ9&†à×ДâI,Q(N¬R°î­Ž¯6jbÔ´·¾(Bñ£FùÌYñ¢6‡u]½>‚ º}B¼¯s’2«iÆöÉîZ Ø”W¨±,„PfP£°]{|¾Ó7„s / mø¸mµ­êCcâÅ®H5ºÀ¸Öâ/뜗z)f뮲eT ÉÁØ”´HéiELžÒœ)¢/muXèuu`jÈõÌ÷Á‚n› è#àG€Op‚Ù b@i#&BÊߣÐjÅ_õs¹a¿®½ô(Ëz›Ô7E…´Y6æÉ‚‘i'ˆlŠ|üäöÂqÙ^ukÑ*ŸCÒaÛ*ŽP ŒÔôײò ÊÜÿYWð4Â@§÷J¤×“14’^Ò\ú'w‚€:~]ÀwP½Ò÷VmÕ:}ز҇\Y¿£èñH"‹!ïã0(ëïö¡Yò"+šíí¾C4—?%YÖ&ëàRÒýÕ/*—ró „\¡J–?î[ãùô£JX1µ8Ãj™jÝ¡JŠhÎH>ÁÕ‘ǃ3êVi\Hø<‡¯„ ñ ¼Dëà#–Ž%®´.&5˜fnÓ–ü}Ù8cÄYÅ|ˆ/é<œ8¦ÜnÌÁ¾žÎ J6¬,SïîyZÃ"áýZE5gÿA°¥¤ø×&a‹WXÛÀGõ}(‘aË/÷ƒ*rNÒ·’x’«|6IÄàL,ÚXÅkV†lšŽ~+µ¤’|à¶Jê—;ðKÆ„« š`SÍiµ/$«±äÿ«ZR M醌]NT¼ïõ‰_j%ýC·U,‰„Œ2u8¤"_žýþûFÛ˜Åendstream endobj 548 0 obj 4205 endobj 552 0 obj <> stream xœµ]iÇ‘ýNøG ´ ¸ÛД*謁-Ѳ$e“cz²>P^9C‰‡%ìŸwDä‘™Õ3=¤ ê®®ÊÊ#Ž/"“?Ì“:™ñ¿ôÿ'¯o}ñ œ<{k>ùþ<¿õÓ-E7œ¤ÿ=y}ò§3¸É(¸2­óªNΞ݊O«“ Oüb'¥OÎ^ßún·ìÝnÚë)„`v ¾(ºpºÌó¤MØ=Ø=©YÛÝ·{½NÁk¿ûÇþÔ?i½îþ¼7ð¨wn÷ÍþTM˲®nww¿øiž—ÝÜ8…EÍfw¶Ö MžÎÓ²Îaöü©û{½ûÐ⻇ûSXøå¯õÙÔŒ±ËîKj<¬«J­¬j©CÍEvëíý:O³Ò¹sí­ßâU­µ÷Ð!5­ëb×ïÏþ¦fŒM§ujò ÌèÙ9Ì"NÚ'o>M¿žšy j]ãM·a€?ïOí“7ÛÝË<ëï ËËâCؽˆcvNí^ïOõä}ðv÷toá¢Ò:ß©U}ø ÜçÖɹu÷:pQgí~±a²Îì^å»/á–çð‡=žÛƧ_Á# _yºó ÌÅ À’×>¤Ø5>»Œ©m^Ê~¼ÅZèa|€=ÿ4÷}IoO `7¼ñë{ å-<ÃY²ÖÏ+½•ýÒÍ>‰S‚k}î£v MÐcùµ>ñjë©Ã:Ù²Øõ×áK.ö:LΘ¨­Þý/üŠ/‰3Ì_’/̓Շk©ÝUSÃAMJ9h™æ9¨8…oQ-M˱:›.z “Šm•ƒ×뤋V–&#½Ñ¨€“ÎÛL“ªýÂÚ¼¨÷Bg`aTYO?ãª_uVœ'å‘Ú¢\Yüö ›­ö¨7Eý/Ñ4¡¶è(‰E?RÇ7Ø0:0ܶàýlrÊ£ln‡"~?‚ұߟðÇ9Xô ‰J惔À­Kœ–UAcóËL´+n ¹‡¼JUjã—†¾ƒ™¥ìDpØ`ŒÐ¯ò‰w+»G¬8¹}g]Tôuž]Vt‹MÐܯ‹b—üÀâgaÆþX ý1O_Í íOˆ#P+WÏE¸’ mpötôäìî­³?|WàØá2Ñè£ê9‹ ¯ }|ö2v ù=~†¥3YÜC÷î0ËÚÖ q & »ã—ÕE¦xõ‡Ú:“XÛ´|C}£ÐÒçu»ûÆÙJwÏ–$°ZbG„dz c4~/GÕF¤uM6vRůôÃûò oV€¤aiïá÷oð¯ûø×?wåÁG(×àË@cÿ¹‡k²Ïʯ¯ë¯ËÅ_êÅ—£;ßó‹é4—û’ï¼]?þoüˆ²ƒ½Ë—›î¥Ï¤ÉCDe¦™Á>‚¼FÉŒoþ¹üð<ÿÀgæ6~„ÝÁ¿”çXß¾®ï”ß·çÐ(¡OcíØùh׋|òñšœ¼;õãWuò¾Îî}ÖÃ]½y{vË”¾2U—5Né»"Š—Yñ1 qöö!~ÿ;þuï(±{[}wxjÎGú3ÿTpéy¹ø´>ó+PßлÑ]–Oõç8h…Ëþ°^=.ÑWÃ5|tã%úœ? h]\…gõû‡²R¯ò:–9Hk MêÑ0ÜÍŸâ­÷úŽ¥þfMØcD4¼‘­!ö |Ü<{6c¥k–­áåhaOGß׋¯ÊEød×… ø‡‘°¼=þt$kl*«r».ÊÝzõ›n‰¯¿‚-ŸpªáG´õÒè±a#ŸÃ²àÛ=Áká>cèc|êME1Ãß™#k¤_ŒDàK lAFx Aš ‰=F7%¬rb=¾o„_n„$¬g‘"ÞqE¤ˆý¸ÀÁx"r+ÎMF“Dá/mÙý¦$T½@ˇ_÷Ä ^½¢(ÉŽµÃŒÖŠòx_ã’Ô .9O³Ý,ÎÃóèC¨#°Ì_\Êà¬Lm—=Ψ„ŠŠ~­0>ÆHq60F‚çQðCeÆR#ÎFH\ãd‚U ¦ƒÄ”è%äž+t –¡{¦,‰§Õ(¡kò+É0‹aAÛeúLÓ‘¥AD…‘”R­4xY$Î~×áÜI)Š0]%‹ÌÎã˜gR§¤hz¡®]á {)RVF¾1éïÂ"©Ÿ‡XÂàiH, ‹ßNóH;.»ð)÷ŒifâÜ\ÏEK¬H|޼#¸2XŸ#É’¤`¤NàTÛo£^½àOÇΫ“fVh×’° y÷¢ÚFæEê-Πd$‰– ³âp‚ÙªâZ¶ÄœùmÖ@;¢ùT4ö¾†·Â6Q+ì2¥àN=Y~L)Ë0ú Þ “i=ûÄò 2Ý<‹+az¢ܧ‘÷LOIÏļʡùq7ÓÊHä…-ý-:SàÇÑåÌ SªþõR1rKÞs2¹ ' ØQÏ7 äÊ;Ëo*rû\Z w/[ô3 Ø2©©(Ïî™zšÅȵ÷²gòæÑ/Å)“ö›¡_blŠY|k¨sD>q ]‘ž9wY©L9}˜¬ÿm_hê{0I‹®\Y’\cC˜l;…o°,0ÙØI:èJúHÇ;,"…»|žÄÛÿb¬!ÿ²ÝYdÄSgÁV2meJx¿jæ¾\Äõ† †’5ìdÃaE®&‰ (è1+Å/“Nxòv9ÅÞ6BiÂÕ·Ë5âóSžHÆ%øbGPlÁ|§Î;ÊÃ0þç4½ø4”øòÞÂe…¶Ôða•»¿CÓbƒP£þ$d¥q³dÅ ·¹J­v] ’)Â!ô5‹CËÝ3d ƒChT(`º” ¬6±iêÛ¹™V»NÂŽçH‚“h§ÅÇüà/ŒyF9ôhµ\ïߤ+Ø¢$ 䬠êVeáÛr²‰_‡‹¡ôɬwf.ÃÁŒ? ÛL³ÃÊiÏ%Ú°žø@ãc>SN:&ÖÓ›$sŠIS$aÌ‘Ä,ŽJ Uc6)«Òª)›5Ä+U˜z±;ªñ”›ß„F«JÑñ å÷z¡øKÓ9ï¶€Òë¥ÄÍsŒ9˜Mõa…Áe‹…üΊAÓ$ô‘Ú’eÆ»@ò°ºÐ˜7ë …±ü*+É‹W #³mçi^šø¥x€¢;ô?Ñùõ1gËdB¾šWZêîÇ•¶ã$­4Àn¥gþÎè.â€%É çOš´fî¬ ˆYÁ6pª–¨zá†C“aÕB"Ò³[ÈwŸœÁþ(ÃÐâJ?²RŸ¯p(–2|7´ÜQ|¬ÝtJ–ÖèÆêm•bYñ¼¶"& €Q¬~!W„;àLØŒ|ílÁ½²”U¾ª,%K>.ŒE“Ð„Ä +¶T$ÏÖq,UZRÅ)‘:’ño„™}! —¾CÑÜÌä*$ a†‘x*¹~™”ÄMh4æXþ”a—ŠšÅº y4“Òa”5=8é#ÖJrvøøºê£éÒ&6@º áÐ ˆa^n¬TÝÐ%Ò`H×Å ‹ ñM_¤UšA ˆ«zì@i~­ç¼KlV2”láóC”8˜ZiK…™žLUrLŠpÔÉ(ô¦dk ¶Ÿ ÕHó$aJ…뮇tÍ;¼s!‰¿-ã,èsMt5jÑb!奼¥et›TÐÐñSÙ–«ö¤AŒ£nʹˆêÎdîÜY±aihƒ®Œ§RˆO„¬3µ2z]²lq¤iëË™A„K-r&‹Õm¡äÙ~±Xß¹ðúNfåÒÌT "£@.Þ™–D:¢M‰ƒ‘Õ?Ô°çû¦¸1¡… ˆ4U•?© ø±¥¬Ÿ'¾R›m_)˰™}-Šu4ZM$üÁ’‹<Ï’’‘áÍJv¹ñ¸˜¬føHì«ÈÔ¨Øê`\A.y>…²10‹}‘+º:¦…E3¶‡Lñ ˆÜÁª|Ãåá¤JqZ$XÎÒ¢KåÅLªà5™<œWI…5‡BDpŽNHõË[|˜~Šš„XûºJN;…LÿV7–_EpËâÕ&îMî&äÇ"mQˆ”çqwÄza©9´Ï@/¬‰ ¨É¤üeÙya¸‘Š ¸…P|‡‰øäØjf«‡«o¤ÿŠðç1+÷"M¸'äšJ£5ß$÷€S>ÌmcÈ!H—®eÏ÷4¤Êš*éi†ûÙ°àaµýõ÷Åëñf[juJéN‰ÿ›öÌù²ACM¹Ÿæ –ež`úOü>Ú e†LÑ].}ÿ (ŸyeûxFá"£†r]Ï7åKü:ÈM±à”ݚǹ,0ÒŒ,ß;CfA(Ÿ‰üµ(6õ¾\¯þFVõlXù¹a/«ÀŒ<ÉŠ1ªÔÇQåÔÕá$ÏNò&Obªm< à\GF:ƒ»ïÖ•C,nŒ0âÂ5Ī.U¬Bå*T2¶Áo†®`XJv •ËIþíî0Â#‡­Ù¤¿”@M°|ßwùµy¾OÁŸrr£,MŠ€IMÅGäÂÏMÏeœ* ʯ*Ïw¶Ú¢ÁtýÈfý$<<üz{ÜÇÔW…å0<+¾©Ï óAÃÚÏ&å„ pž¤ƒ`@‰QÐ #…(ÓåªPâ_r•±[[Úî| BåÊá¶b›_œ–´šãRË´¯ª[îqªÙ0xMÚõ”Ù¹›ÒèyÛ= ùOûŽŠ"0x[è*t¨¶×¨ ÈÙ—ÂØ¸W“ã•ÒuÖ®4´]äž_Ó+|L×ÅÄ”c›äs÷ÕzØžrAÌ$¡²[Ϫð¬róµ‡U-܃ç½WuÑôÚRx9+GN6@Ëò^úS¶‰Æ)¥<ºYŠùEĨB´Üa¦ôã"HUF € ÑÛoøx@À{O…[=gÏÖË@üJÚRíèØ’…|«žb²uÙ(_Ì;aùãÑ8ˆ'¬¥avïRz#\õ%nU±%ƒÆÆ'‚²@Š˜w,Å! tEÛï&W2Mod—¹±îÃôkLãrP݃ôË, bbÓè0^ +.£y ±>8І«´1‡fE>,’!‰¤—hô2$¾¨"ÞQ ,E(†õ€ðc@øçtBÀÓÿƒ»på¢:{·Ô½R*A+vT\4ÿbFBB ¯e]>†ÿ(ú¶´Ò |ɲ& ñkÒ³ÿCW•G™^ÙN}¶;"6Û‡»-¤#\ÝmJ¨Œ9ÝÞÁÞªòš{©As9á¥8AštÌPÞÆÃRŠ^` IŠyý‹Õh˜U¬šÀ6ß*ą̀ìU‚ò–„Û)Åî¨ËX2†Z›Ò&F"×Î8ºëåÝ{ß|+£WšÊìCue{fÝ Fsã¢NWD¾ýxËB_¶XVÊÃ4£•0€îé•7,ø: &Ö¬=?q­GÓdßþ0(HÈ·%Gå£Åf LµãÙòG‰))ÛÓ[]66)³ xÞK.Œ¢nÄa¡B•AAË“dšÜMŽ C]_jbCi/¬³ˆ&2ô‘)8²×H%ÇÄÀ2yîpöïlf‰ö5xéG‹d=éí=Kätx WßzBaÂc¥þsïh;~Iº±Às5,í]…f¼‰˜i^A9Ž:VöIÅYÚTŠñ±wñìE¿>"¬õ­2LÀV ·wúÿ>áÇaü6rm‘Ú¯;%›-hÏÂJ†X®½v±§ðc€¸P¹6àEΆ-9§"æZmc~Á' H÷ô¯…•0®1’YH¨ÍÖ§4ì„j«ÀYoá¡oGæÇœ¦êæ+PÕ .ô—}½n6®ëëª!bfeŽûêˆÑ!¦¤×Ê Æù’ÎpXCE g¤“M¼‘ñÆ90I¯‹Ld#¸ó&mÄATnuWÒ^Q§²%ik»Šˆ{?š4IŠ“X‘¡ÜÌ·ãùÒFÚx4*7õáX*¢\ûØfC!âN\ïrYþfM¢+÷Ì÷<-Œš6åhºëxÜ­ÙîŒÀ´9MÃøÕºËÍ=TPÓÅïMÜOš\+¯¶Ï–~ÖY¾ÙYˆA³H2Éq†¤SIE?¶Û³YcsL/Àÿ/t‘ŽuÜYŒ|ÁymGuµÅŠx±ÂKfÖk:бHe´¡ç¹ô Ü&ûi k<2ÈÆÒßÁAǨÔt ­+;ÙtJ_§B^\¦–%ÄV»@!p (D?J$â°¦¦ÉD#EU‡}J¼ôîÊ"{3î¼(Ùl‹m°º³Û"#éHœÎMܧ=›Do—ÙNýå*{,ððJf»ó‘U#ÆoçEâ3þúòú˜Þdù›Ð ¥ú÷Ì|ñ@©YüÛ00ýÕa=Û»|`}»>4—[l£6uµûVk:NòÓÔîç¸ïถ%ÖâÖ/âÿŽË˜öü‹* É÷Á´{¶µöŠ—ý~_v7÷È8ªÈ9Û=?Ëá¸:’–1¤ÈU{ÈÂ(q6*[ª„i³®»ˆvåy j Ø.åÎÙ­¿Áÿ÷ä:endstream endobj 553 0 obj 6239 endobj 557 0 obj <> stream xœµ\Y“·‘~§ù#&øân.§T¸GY–´Þ-™œ°-óäHC…ÈÒ×bìŸw&Î*Ñ=M C!©§ …#‘Ç—ðöl]ÄÙŠÿäÿ¿x}ï³Çîìêݽõìkø÷êÞÛ{"68Ëÿ{ñúìÐHHx²„5ˆ³‹說ř“gÖë^^¼¾÷ýNìÍn…åÞ<½øøJ ú•\õ,|xq ¿ØŸ«Å¹Äî¿÷b Áë°û|/wßíÏÅ¢µqrwÑÚ|™ž*íwá©‚nwÆZ๔a‘]“¿Õ·]`Çqþ¸×‹÷F[úâÐ\šE¬~÷Õ?tÖíþ„ï}PJì¾ÙŸKl¯´\`¤ØNúÏÐØZã\|©°;±{²?7ðà ¿ûû^.ëj`–øÅŨ&…wñÛ¿íe"WOäóL¯sX«!$²ýßÞèÅY¥vÏ`õ¯ [˜£Ú½OCé`v?Àº`t)wï`²Þ-ÞãÖ<‚?Œ kSýŸ¶ÿ{¾n^b7+üac7@q­Ü"¥ÊÄõbU»—©½]-Là\ºu1&ÀlUœ  ³zI Þ/@4ï¬åúýt¶ŠEÒ"ÏD (P¿½¸‰/$,NÃà­#üà§B”kìöÉææuE•lpi6®å94ö‹6[ÃÓe:M¬¶þaœWéiçÐ.ÐÁÛìp{ã|áþÖÕÕÞ¿€zQJ‰*‘æ6ÛSÚ;as'«ÈŒ‘g¤ ÇHO8&]X¹³~J8査HTkÊ»#ú()Zë_÷ç+ÎÏ»{“z“°Õܜޡ‹J? Ì( 'C6'DÚüs_ç±”æHÏóLÐs¡ ãU&ºn92‰Ä¹4:”„‡mÅG¯¡ˆ±³š<Ìé2—Y™Èä,ôçwÿnÖ­Õ~@;9²W™­TÃ9fªÙ5ƒLÿlÞxÙÀ`oÑI y0! ¦§Oë´‘_Žz"»ñ Ž æ/ ŸuóËÙÅ;X뇞E ’t&[ óožÎè:‹ÔºX]DªM5”ÉQ ^‹H»h¥‹2ouÖÖáÀ À±^€g™‚̃™ÄÎQd@Ëd^B:¢84&±½©•Ä·qçt"^'0‰0–Œð’Ô<;%­úºIyÒÀV9N³E*F923“·Û(nü•%ÞÞì;ÎÍ›åFõÍÄz\F4:`‘AFTƒÄf}#qà7=ÿ]7ósÉ™ÂKES@¬å/øB„qyš*Ôivr=ÁìF;vÕN(MÒ ?bÏi“™îÞá[¿ æ˜r!>Ú°abÿN%•þT’¨ŽŒå“Þt¾Žò£`á^‹"@Ônò\¥}XE%s^!Ãj·èAc ¢Ñ:žð=PKFj½(=ÎMFë‚HÖû&‘µ‹Ö°Îó²ö…£¨·2)É~yáž? €ÅížTQú¾¹wñð{€¶`kCp€eÐaJy!}Õ‡‚{¯Bá„w_Ãû`TšˆøbA æŸ&£@(çgÐdßHé¼… Á¾,0ÑkXÎ R¢(ÚXþ„kÊÀu$Aˆ :Xädø(FhœA8`"bT0ÀM´. ÆŽ5j5ç£Nbpgߊ1y6²fÅÏ:cP1q0~²<³& Bìû *M°é’j]ÔaÞÀà‚>å J¶¤:©åL‚—Ô$”îéj£ÎðaÑxÏðã° G2‹èv#îÎìVp:vKàá­ Aä+Mûüi«[ :´ÑÚm´g?Üõ Ý"1zËÿoA'T—M%±ÄŒ5 êA±Ï”󉽴CòД³D!Œ\·³Xc£eÙÊ êü‰öË’Ô°‘?p6cl„LÀbtú%®Í€Ë¤ÀÈš‹½iÜOÊŸšÙižàÌ *3èâA\"Ùõê¿“0/*+pB×2pM€PS@^¦Å"ÁÙqÝoZ›ÆtŸ)UÉxô1ÂjFs`&{ :ÚmÊÒ©‹9u:/ï;!ê÷¶Ã¯DR’è;áKÕ‡Q2Mz#0 £(›Â(÷GÉTû‘à'‚K¡ ¹{×…t»Ú„ßR+TÄ'yx‰Ì[\Þô#q;J…û:.T}UÏó(~×á§äÄ—·€>ÊuÜ£<òI˜ ’ ›sT%ëë]]Ý¢$Ýb×Nù?gÖ\{”`ä<ª%âÄeP.eÙϯAN8 ùýY¥å5LØ·:qmüÑ4 –è62œ>Éq‘D” ­‹àáѨšU ”¥üˆ#`C7FEÁÆJX ‹rã@&Œ|[·ÎT¦ Qº¶=vÍYHß«ºÒðI’›ö@œ­kîýe¡‚ÞRf&®d4—Œ†'QÆ6"~skÞšüƒ!oÀ‹V¢nÁ¨%Ì ÜoØe">í˨L >}¼§ÉxÔ~ô ©$*BæÂH¦ó~4X¿ &^5­ ð¨nÏÿ¹‹¬’“Í<*Ÿ=orñ¨‰bé >"œ•Ó ØÓ£ÕÈfvDcp •­qïúmC™T¨6.òöI~mFv¥8ß³Çd},¾sð Æ;½Ìøsf­4rúgÑ~€%´5¡Uð΋ºñ§Y,ÙØæ=oÜGy¿â¯g=‡wSY65ÕxœixÝž" g©cñ…MˆUîþw“ÃÈ9:G[Gɨ$¢õNÇW{!+b68f˜Ÿ4”|ò$°êÖÛ¸ä-Å_06ºa¼Óq ÕOÓ·@eäÝ©²•i¦`H#wÛN qí3˜³Q«½ˆ—]Ë/ã¥ßæ<Ö#8½Ëþrû^냘>¹Þ˜ÀÝæ®fö6w{—^ˆ{ˆö€ð2‰òéÎCO =TIŒZGEÇøwõ)™mŸsúì±ö}©ƒ³XE¨‘ˆòf­Ðüá ØD!ÒŸ¯ê[œhÜ]4ç:`èH쾇•`•¸²ð]ß[ê(Â|Œ|ן¯êûê¯ØqäTì8?Ãadr^ZË_[GoêÃå–àܲŸ?¨Ÿ´Ï/êÃÏÛÃÇõáE{øE}ømýõM{ý€és|ÈoÛÃïêÃ/ÚCò¾©éi¡¿ˆ?Ambâib~Ž~5`ŠKlŒÂ¸hâ#QJ3`JUbúJˆ2›>Á”TÉô=Øãg|Z~³P‹0ÃÇM¥ñ%¯LëhýÙF 5“¸'Vª>éë7?^¶J]å± ÐßÓ²OF¨¸è\›Õï“À€µ"ÐÂP¦Œ4ΑɄ•.DÓ{$‚LÔáüZ…¤ù_Ä N,B˜ÞºHk(z—˜ô–·—ò´ï ý*E¦-B“ Ëg96¹‰j 2—©>Ë\ß´šŠË–¦»IÁptafŸJì4oºRHÙ+ÏÛ8"óí=©ÝòFÎÖ±Q«fÊpºNJgõ|Ìu¨ì¯µ§™ÓÄ=Ö>è^ •ÔÔi¨5™«°ˆê.;c¾E+.\š3 G-EªˆSK‘óŸe ñKØ5…Ùcr0>cÒŽžO«¯¯öI“ Ž%Áþ¯)¡³x,5>*-VM¢½8"6xZÿzPÌ4¹½±&]j)ôñc’Æ#Á»tðÔٙϫ®¤51ŸÁÐøsVOÚǃ§–ñS8 6…‰2EWÜ÷Q&¦Bü²¸ƒ3£´%Ež§••ç庪óJð¨Nv­“‹..“<É…\VR Rà w éÒFGe^Î<þ¨ì”³šÏÒ¬1ãÅÅ®zÜÕºÎq^¥MÌÞždÃÙLCöQ2™zËqxÑØX™‘<¡&j{¶+ÒTV÷£ìô]î–~ï Õ]=í$DaÚcŒÌ%¬; ÑO|qeìö¤ö»Š³LŒˆpì8 Ħ¯¨è‚XDÉÌñQNdOñQžá-ðѹX‘†¥‡¤¯)Ý Ež(<É«¿îœÞ–¨§nb¬â˜Ÿ†±âÍÖ…. w9pñt™¹. ϱ7dÑ¿¯Þn‰&À®²'úš?:$ÌfV"žõ|ÂaIE,É¡Ãéççµ`wø§Á­Íù%dTâ¬o¾Æ÷WùìF0¿l±ý ö"ÐÒå‡íý“úF^>抜Ö_ºèlo7P«»þ®=ìºG›C¸ñ [èÜüÈ•fޱöÖÞl–Šh¢ˆû¸’q Å0ØO»X7ÐÌð6Š}²u9* åM>ÛQÃ4D3ÒP¡JÞDÍ¢H-ïgõaE¦©Lbõô\MðµáìÌ6kIhÀ‡Rú{(ñ@V½`ƒ+D´5ñØK4Ó¨Þù/!ÎiM»þ~&Ò=‰¥qÚº‚G µŽ|Õ˜8MÓ°YË÷Û\¤ØEKUß1)¼eÜ5ð¾Êñ4ìjçÎêNœx¯Ÿ±r0½?÷3ã/“3¯DJ†Êø×ûx¼ÀÚoòw°ØxÞ6ŸZŸ §·ÈÉw œ)Ä{VCl4Ρü-îω-e ŽÁ§(,›zhíÆ Ê¶§´Z vˆÊ̓mxyì‘rœ,‹ ž–c6(“9Â虤-6ªfËO†lâ´™šcÔ%vÛëp¾ÜÑî:à#6+¦w;Wž±GÕN"Yr÷d"+°3khåH­¡Ävý#Zù”µçûßÔÅ8CçðL-áÝm%v:ð]ÒäÔ Ð8Ä iø¹0v9 …s´ UÞ×öd0–£¯âfÌD‚9¥ÎÉË4jÑhVsŽcÊ‘ð~ˆ$·4ÀÆGk—:ľ6%$?wŠÞÞ<ã~-k‚VK ¶]N¤èhë–~'$©;pñáºM´.Ÿ×·pNÍ̧·å©îhÜ‚|¦‹xÞor© Òá8r¿Ý.ŠËȺ+jO+M)דA“DýLRæ»sØL¥@Y渘ØÖ™¹€„cg#É…!‡ï1ÀnoyÍ‘¡X2—U_o¹Ì51XÓýÑ¿àíÀa]±ä on_M À”ëÀ>ÉÑÆH›M‡$³ò j1)[ˆ97Uù~ "NݱŔü@á©õ¼xqÀ8D4‘iÒ¼SÞ3ãЛԹkÜCÕ‰Q—d!ìO/ÚP©H¶–àÔCNŠ$zLoþ&¡Ò¤%µ5TKþûC-ZŸj[nq€M'h!=©ÇÂ?¿ÚÇ[±RuÄß9Z\c5‰½¥1c¨”Ä¡ oö—û ÍkÛï ê(À²Wà´\ ?…ê0íOéG“&%-u¶ ܯÄp±ì›¨ìžDl-MCr.j_-ʼnJ>a«å´ŽmÇ'vqí¿Ã;}•õNï>zÚ:CrÄûÍ)êj2“=µÚ*#àsÉ“Mìß7…jОöñ°qP]ÎâË‹{…þÀû8îendstream endobj 558 0 obj 5793 endobj 562 0 obj <> stream xœµ]Y]Çq~'„ü†_to¢9:½wû͉Û9Ö² ëaÈ¡†‚IÎH2))¿>U½VõrïŒHA tyÎé­º–¯–n~w±oâbÇÿòÿŸ¿~òé_ÝÅíOö‹?ÀŸÛ'ß=ñƒ‹ü¿ç¯/þý >Ržlaââê›'©µ¸pòÂz½ yqõúÉW4‡í(7çœ:ø‹ˆ.ý¾oR¹Ã_Jnb—úðÙQ†ÍYi_/•²›”áðŸGM­1‡?/Åæ}æð磷۾ûÃ|¸9/vuø=¾ÖÚ8 ]^î›»Û-mõßGyø4гu‡Ï—hxó—Ö6w£´?üGìÜ… r/Aì.O¨{H>ýí1ìÛ.d™\ÿégøTJi-LHl!x¾¾ú/ 'PŒS±Y½º*"Ñvø£Ž&}ì/46Fâ·—ùãKµoN„Úøã¾©,eƒ‘”òB@Gõ¡˜½70S¡Ôæ5HnÖy¸?¬”‡ë£Þ¼Ùaÿ<^›Ýê÷±±³ù­ØÃá,Ò|Ü ½í ¿Àï‚pâp #ë}—Æ·Æwi6Èo µóÀ ¨­7£WíÃWåGš‚¶t->|¼”ÀWV”yc¡Ã¼’6ðŒäÀúâêÏO®þõ+ØF‰ó@1FÀì ŒdñÖ¹ÃËÆ:/`‚Z XŒ¬¥Ü”–‡çõ!¶{S²@@]~ú¸^ƒh©6­üá£Öå«"-y@)ºQ`UvÇõåïÞ´¶·ðZHà*E‡MÍ¥Ò¹K§]Ã|é7©©¶‡[q‘°¥eU{ô|Ò-´ÕÀ…H³õ‡gm2×@—én ±B¥]š.érؘåš_‘ô`‹Œ• */šÀˆj3¶LÐJ`õûô¶¾®LbàEÚž`t|þ ;Å|y±i#¾Z“Y7tÕFBŶ„fi?Óî좛HëùEùà&-Á‰(—‰(—"ÒÚ'ÚüØí·{&yPÆá’§â`ÏqßA€LüÄ”¦5_³¹`Û°$eu$x徸6ЯZ)këâÂrÓ]/ Ûe*UqQüŒ£‚€‘OÞ¡í‚_‚p6³¸½ê áÛKC)©d¡2c*£Dœó¦…Z›ÌT^PÝÚdN q[lÒ©=î´ Ì´(üFÙH¶ISÓÅ@iûÁTÄÏhm%Œ¢¢…÷NXÂf8ÁŸp‚`öàÅ7¸d­½JÊñ{$­¡s¤ÉËÊ„y 7€º˜¾ÇE¾l˜ áUý¤r|Ú¸°›öiè,¤êbìþÕD"k“Lki“Ür^F%±ËDUÊÍH2ït²=Ú3sÖr‡ÆJ±CêD²£bWH;¸G LÃ_qÊhó'ñã¿`RÁãW‡§õií"µÆ~° 4 3±£ôæEýõ¦½¾®_·‡íKF{Òa_å@û£ùù¹i?üv]ÚþTÞ·‡ßׇØtÂŒ/ÓÜ€5 ÞÅYÀП´É<­-~l-ž×‡?äÚ´úþŽ¢¡þ¡=}Z†Ô‡¯óÏàéÏ¿ëÇ3¼qÉ6]Ž!ªj 42@¢€ qJñJ›tàÓ#îPfǯËX…4‰Ú7³áf¹>2íý$ùM’E«¨P¬ï[OM1ŸQaÒŠ¨!îù2à5GS3ßžåv¨Œˆ¶ÚЀš¨*—J.’ÔÚëR ŸvbâÐÞoRMÛ­-©ŽN‡4É Ngô]Ü@£¾)FBjò¥vG¼iíÈ›×G%€‘I¿„–ÿÄÉzÐy \Á4e š GúÞ.6äqI¦aT¯¦hHf®³­ÿ.ó¥®Ì¼Ãð %4ÅM ì¥Uv5H¡Ý“ÖƒPà†½˜Ë ¢/`»²!ªÐ_…ûøËh8»_¤añÍTh±ËÓB›ß!Ý #©ÄRª&«ÄçÁùú ˆŒÌÚe•·m„ûÆb`«½BŒ2âü&ì*&Ð$›wJvŽ¡‘¶Î€lÎpu€kæ°†P~&žMÉàŸ‘MÂè‘6i|ÔX½sÖ3s¼´.DŇ¾-‰~¤à…G×äOˆð`¶ ¡‡Œ<×jðÖm©½+«iÀ† sŒøøÙi¡è˜âglˆŠÎîÄožMçWø­†šÖú>®Dë‡ë{ ˆu©îa–6v×ÜãÔ ¡±ÞU7ûÙÊÑ3¶É˜^'Q0±ê¨ÖÁzl™•2°Ø¶‡ä&ƒ³U(e,3í¶p{'¥3‘.•_ïfª ž7Þ'4Æ.¶ ±tZ#WïD7¿äœQ„Ü[®Ê•1ú@¸¨úæ(V‚‘­no'RóIñ¬È³úÙ¸÷lËÌÇîà'±˜àg—ö'‚¨ð[x.ÕTÓ?' žG´©ýöx©ÓLèPéhÚl¨VbØ9añ7³÷…àÖE/º þÀ)i^æ“z±¹Êé«8 F‡¹ˆ T1ñ [ñ £÷§±¦»ÿ/ÎI¢Uûë$L^*_sƒTûºN¾õ.TÁÿRh"*ƒÁIµ×e—“áR¤dŒãTßâ¾Ù2£=‰æ6)|ûv¢éJ{P®°1Øñ;˜:ÁBMCØ¢© 씳±oh|†·€¥§Á6®µsìΦ;<Šê x‡}¡Aû©•0T ±> z[qÜ0Qy3½O0¦Ü0-Ò 8È”A új¸þôRBùäp‘ˆèÜåшTd¤«¼Û¬“T"ß6æÏJLÑÌa=º 9XšÂ‰¬éàïˆÊýôÈrA)!åa_$¤Š~±+³ˆQûÍ× û[?$¨åmãw꟤`pþ³ ~nq´¥jÄF0ù?–äMiý¶>$øá`Ê ÍRY`PÊÍRp«YT“°CÈÚl÷…^ØÉ zqÕLX¡qÛ³Æ=D-d% mR”qh¤¡‘QÕ/iˆ^ ¸ÛŸ·!³x(áN)åÎAîÄ¿©³Ä è@@ÒøgØÕËć_-@AÑTð8Gú#a¸A”φÍåp†D¢ÞÞ\¡ ÆIf¥-³~vÀ¦– jÿ{”'Ã^j’‰Q›˜ uf³P‹‚ƒ£gî;rNÖ ¶:ˆE;+¹½1Ì]tÖ‰¢è1‘3»³ÄzI.r¸ÏFõ>ÏÚ?¾‰Ôj ܦwÙŠ¸ÍU'û[B§ÑJUâ1|9ϦÄ•]9¿™#YÐ'»aöÑf¢Èeá À`O^븃§|âŒdºpɸiੱeÃMÌ›{Eá…L£€^Dd†¦w;í³«ó9¨)9~³’K¹E¹#ºt›ØD- M#€÷{® Øct×°NAíѰç@ƒÏ#0lqÕ°óçy‘NŠ…ÍT‰XÈ=剾èÝ1b˜­ù %£µ‡è<ÝL¤ã£†uÞL^ß´õq? ïâuš&b>Ò{ÑBÔ0¼š9¼å:¤9ËH¤T´Š/›,‚íÃ̘‡n²ýe0˜šl©…™†µÉŸz@@ < H2Š&#štYÄýÆ Þ±ê‰ÚÏiL@=Õä¾:U9X^ì¦u"j¿È4~Sh…€ÿ6e¥M®rƒÛ#K*g@ŸX,®d1ìÄ带5^8DŠh “½#šëÓâ…¨sÙySDôs×3ì!fâNÍÇ/GF§ṟS¢Å%jÜD\ãµ›”;…-FÕ7©–(©2Ž~{G #¯÷K½Iò4³;*3s•„’³mŠº3Ô-'{Yÿ‚\ÎÓÜÇ-gÄW#0˜z¼ÄAx: ެŒK§ÎoÉSØmLÅzã¢ñ72hðK[SX£ƒ‘ñMuHJGß™{Ó…³g¤(ì`¸ë“pk7¯Ìof8ˆT_7 Ü—3dއëÿöþ³f—³Ì r5 €ÖäËÜDÈfR±00¤ëÆÊI¶Lï”ÌÊwHÔåR»èœò4¤¶>JÙà¶.Â!ê¸@§'ÒâgŠóˆÞ˜1C™E`ªw&Fewd¾…VÚŸ®¢ÒΡó°µKéãE®aPA7ãDI¢Ç%Ï¿ó±¦vçLKïÉ&ÿ;'?„Ý‚¤Uzƒ”_ÇÍêB·È èƒT¹˜TÄ}4V‘L`ÕÎx<&ôʬlâV*;¯7ªM7fv21¸t`¡¯unΘSÔœ¦Š|C×UL)ÑÁÖé/¤Òpý©âˆ‰ËPÓ$5Ö̱)I…è§y4wÊJ¤ëÙº;ãC°T™ˆìÀ‘MŒ;i1j©èUY#n8°Ôééj€¦F”¿tLORÅ¢´ŠŽû4üÜ\ÈZÐÈŠ0â afE-¡û¢etÙ™œ`l_åVÍlV˜27Õ ÜZñZê!¶#õ[oê7Û¬àŒÔ–µ"¹§íá'VÑðX‘z¶¿´÷ŸÕ‡Ÿ³F¥ íË7Bh’žÎ ÆÌæ‘jœ|ô¼C–yçç©‘¼þWmŽù´‘¼·da@(;fÙ—P2¸]ñz[MÖ9scâÂIj†UÁ ÊfP+XÛ”æ7 ¶[nÚ:KGdžæ{b–c÷\ìB\ú:¢Ô›*ÜTÿ"IØzg;¡”TèŠÈHÊgY’'ópûR‹zYÒáˆ#ãTdèìk易1Ã\ý"Kܺ¥6y îÙP “kVãœ: ‡ÓÁ2ÑŽW±@ÇΣWg„…‡Úp±™ç»â«<™g|ûYD£µ- ÏSŽN«{½ô½ˆ•4hf§oRú­Ì{Ì”üÆÌ°ÓQÓ"­}Ï\}²ƒ’‰*§*b5'+¶ù²X:¢Îœ¸/$n0KŠ%qÐ^î%îPÛ”­1‹º0ô´ÊaŽ|;/3™x¢s'69®Ru0°,½ÓþĶ¢Ñj8S ^”’òqBI¯]%£úhé Õ‰,ý£Q“Àb-¤±ºs¹JÜŒ¹Y˸Ð>bƒ÷r¬ B*5WNž>„3jIffT 3PàX§‹Îä–‘¾œÉtqð~wÄRÑVçÍ™S9@f,™Xw±V ÜNWéé::&>3&³9Ò²3Ûj‰ËS ý¬®k:æùIòPBË„¯'ÕÈdÂ9=n’-Ñ}\KKZïÓâ„A² ¨k/~>‚âvVµbC¡Ú\HèIëzÆÏÒ®räÉR´–eÆn}j¨À k4!ÇiS^5×E‡÷‡]ÖÓqò–­2NyÐsqÆ\Ã,Bqð(KŽŽ§G?h±bP1Kúž°g—N´ÐÃIÜÅÓd ¢ 9Cü•…lüLæ‰*‚¸…cß"¼ÒIC‘œï´6eØ îþgfˆ×ÑÑsŠÖ-ŽÍ§¬$‡ fg‚i' KMžI €(YˆXN –'hc)‡žyÀE_Bße ÊJÝÙ txo°ê¬VªËDÌÎÅhghÏ•]òbŒÌÇåíÇ€¿ìêƒT up¤rç=E é¢EÍ‹ú­ùÃ+ †ÀÙÈ«Dòhe–Xµ¤ ¬TT\79êñy•X8.4섪*¢×«*Ò)|@Ln€ÔеüˆÅ“Ð{‡ë †É^öb (Ë ׳yA?5ýÒŸÀ÷N³ðõÍŠ ìôö—øú®HÞ£« ½P^á…³)]~.iŠE!jˆ*e©~!Ÿúsv"ñ%× ÖGÈ>¶=§ê"u¡=¦’‘½X’DSžw5ü¬8{& ×ääº鹎xK?¦^[ð$RVjhvÙ’¯“HYjÈœªÝ¬2§AÌ3§¥É‡JfbqèÕ°Ö]®”½£_ u¾êŸót®Õ9W†ó+ÈSïv!R=F»Ãå½Ób'Ý+ÿE$/K’D’©r)•À‰áî©@M _çõf¨U_§H  €IYþh‹<¹§‹~AýÆ 6Àúï¹YRHÜ"nO``›xÖi8·JåEA7²ÁÙ¹š)œ t¬tÀãœEÞ©›eÈV÷±”º@m&…¬2`ÞbñË,&Å'Æ8éÂÙ‘ðüQ£‘îܳú¼äùð-–#|¸È©5xE¬Ÿ”õ•ËWj¡ÓGìÐO¾L„Ë"/I.nṃs&gâ’N‡‡˜WeBDÅ]:"&çû£GçÊØ™¯·Ä°:ör®zzHiî·LÎjïä€êI”‹;‘˧¢ßó’$ÂÔiŸugàíéZ޲±²¹ï§«4ÊAp³<â—3WûÉC®ÓBÐ_ï•H÷™rž!¢ÀÍg_ß›dÄì†ãÉH<Ö™Çí†ãXkÐ"Å+¤ZžJ8wŠûuŠa/“a—Bî'lŠØO˜² Á'—_,kÃs ›—c«c"çâ:9GÖs¿üÜ`»A;68 FLíÒmŠõ…Ø/†²èá«¡Å©uŒ²õåqСSþª†‡J'’ÖeùFÐŽ>º$CT‘ijË‘E,³q§î!@«3¾u*ñý•m‰{[]£q]ö8ë¨]I–Cn,znNV˜–î[?ó¾[­R5Ñßppö~†xëXw?C1*R‹ÿ¨×åKCyµ=;Ò/áÔ©S›*"+Ÿõë¨gZé=¿Ûã¬ê§ÅhxŒ\è÷œÕ†lvg™¦çi‚RÈÄ%…Õ¯+ ++w‡r 1–4E¶fjd ‡a “H§ûOàfÉý«WÙRHF°0ÊÏrÁIc ÒÕó¸Kr]šÛª”ê š$)ð^уˆßƒyŽ—Ë¢†÷µšc¼¯õ`éîÖ’ÛýÙKrH‰Q¹¨ÒÀGDý‰ïQ/tèpLöåó9yÜzvNž8?}ÊCÝ©,2üR#C}“L'ޝ&ç§M4lø„•r^-BÝcÅki•é3Y¸Éä~"^Z”ŽÀ'¹JùæÕòŽ;jÓ ŠÌZè>³V?¸£=ÏÅyþQžnòös7Põ'ã«ò!et¬ƒ  - µZ9ÿó6Ë€Ÿœ=¥‘4ëö`?8šÈu563·ÄnŒ,IΔ®QYMR3ÑvmdÏœÝç¦ T†ŽU*:sÇCº1@Ó£@ &ä›KÎõ¯d1´±`Z÷tg P1ÆRY<9'BçÏæøæ#bY©d\¬±P¾oæ¸#_þ­PÇÓ‘Î(²Ê˜±t’/¢€"?É • þ¾ŒVPÁÊõK÷7¯¡BucgEœØ‰LÐ !õè v¹³f³ïNàVE?^w×AâfÇÊ‹h© tÎW´pað¯ËÍ‚Àìè4…Z®9â–aÃw|ZØ0Vm•è·JKÞ¦|V¦?Î2äã ‘ÖT©¤ê|;×lZåTëôz\Zø®IÐñCœÀ͈“‹v#&¸r9þV¿ù¾=l7ßÞ¶‡í†Y<,Àoj‡>m_ªúPÎú·ÙCÃzÍ“S¬÷³ÖNÏà?¬À/È™]¬óBk¼,Š!¦E¬Vû<ꬋ>ÌC廋²œ:$R˜eœ¶§s¸£+ŸÄxÚ©cIÁSŸˆŒ†þ†³Ú[¢ó'‡îÂpm?ƒ• ­´t À~2.†§)[yl®”Ñ}ÐþÒµ÷9¹‡‡ô´~d´ […z~'¥¿o›¥ÝöÏt9žóˆQí?¸¼$çb㺜bNukSx´;=ГùeVÍáø7壨E<~¸€æ¼in‹ÿÜËcLKš¹á|”!rzÈÏd¦´Úg¨€A Ev÷ÈÅ#Ÿ%­/Ewò6”›å’üèVeºÂf‰ƒ- ¾H‘ÕÆwñáüž¶É%7Ó[Ì'DjŽèòïþÙ '(|xöTÂﯞüü÷ÿòz"endstream endobj 563 0 obj 6131 endobj 567 0 obj <> stream xœÕllç’«äâ[ow+I¥dI–ëå}zS÷㯻ñj€Í™‘½NêÊe{D Ðï'¾?zu4à?ñÿ§7>}:]¼z4ýü{ñèûGŠÅÿÞýæ Ržô~ðêèÙ·Âlu4ë£É=¼|vóèÏÕÙÍÿŽýë³ÿ„YFñYz{?ÁÄgg0ø³nkúyö^m~שÞ{7úÍ“No¾ì¶ªG;ëͳ2æ‹ðÔŒnóžXvãà[=<×Ú÷ºò<¯¸\þ/øÎçÝØ;glj¿ø†kÛ«Ám~ÛáÄyš7¿Ç÷Σ6è¶Ç›Q÷ð%Z7ýG×j4ðÓn^vÛ±7fôzs3 SZÇlnóÑ[Z1~ yk«±·£¥e¾…U½G³-âŒÓÎÌýh­Ý\ânFÂ>z‡ï½³zóWTýìæêóf`”AH¬~U{Ý#1°j “óü«Á>Џš' +"%èyî]⓼…„3ãz=x¶ø^œá¶vãÌ‚aCƒÂý˜ÁòÂ,oǬqÆe¡o¾øýè*/yÑñµp—· Œãæe™ëŠÈy~_3udÁi˜a¨(â· ¹á%®3ÇJ(USQUÞÕYäf£¹ø9©¥‘ ‘² Y+<XN–ãOÂþ™ôš=ë`âÒ@Q‰#ô¿ED(’=ì˜ì\÷A {ü;‘ʽpì«¥0g?Ffáã³ÌSa¶–LhÏšP¨'WKäD±üÀC‘l…l’.e­“ÎÊ‹¼ Vͺˆ' w|£/ò’+‘xŽ |,IúZïH£i0Á4(† Ëçø>ìJÃO˜Šn9 ãžÜù…2í6Ín‘¸F.f+ƒù’ë'òEmú.Ô@9ÞU¤Ü©ŸrT&šF?˜`iÊcæB~úttu\°‰a=ëu@ë}  8|m"[h÷!Ýna‹ ¬^„èÖbà¼ýçy€Bhz ÙÛMâûü½ÕYÍh#ÎnÂXÑæWyÀWUØü)?¼-«ž—Uïóû«òþ‡üð¼<µ`h{O˜MO¿/?ß„ŸH²'åéËú³`d ƒmž¦Ÿe¶›»ò³œÑm°?’ÄüÏzÔ⻼{øæ§ A‡CN÷:3\ë‚æ0åµC!iÿ™¸n¡¸hϤ÷{&­ÑÊÒ†<.rððéï¥éOV¶œ„äq!Õ'¢¼d^DMÖ‰_¿Z³Fî¢Dù9¤G9ÖÍŠ‘…àrÒ Ç¹Ìµ‹²‘F¡_Y;˜,Š+F(ªZH½[Í“$Ï;×=Nnò‹ê1mÍÌ}&¢j‚iGlšÒJ~óËP0vsR…µX¬%暌ú@-+‘è˜á’ÓŸ<Ôâsý?N+U´ ¹Eú5óß»ãb”RÖôËCa¨YKÕÏ:Å)Ø8²½ŠÇÞ–]”Ô$RÄ4㎢ o;U˜¢5û“‘,4~YÂUðyx»ÎPÜÖ‚Óg%) èÅìxh‘†iC‚qèæaª¢ÖÍo3áp !“'–Xeë`ï?"$˜FŒßðão;‹…ÚµÛ¨¢u”Ù€1Ù$~LœÍ"¦ùWñS*'ÝÌìà+q9Ì;ØŒÑ&—•€tDáh1°Gü{·m33ñŸÖG&3RŠßë’–,»Ó!SÎóJb)á¼äºx:dr3ªòã+…ßʉ@/R¿™ Ü: ØöË9*©‹¹HMEy!§“3ô^7¹J¦JÂi÷¤úk¯¦sO\}$ØŽ`«vT*±¤Ìžòµ‹ Ý…la@[i¬!¾Y¦òhgfLE›u*¤Èò"!B#ñ:º^iUí–b÷FÉ¥*k2"­a5‹SXêúÛ¥•³yÆN˜«m2*±œÐý”“.­†ä¡ûˆ¶*?&€“Ú ôÍÆX>£ô*sÞ(ˆeÕ`ä©=4ŸóYe¥ÌTH*.ÊÊS;¬š ZŠ4z âUÀÆ¿uÉ*²Š$ùäšYÉ–©SçEü‡nÔmùߨæš°-¤¥¤…—yoŒi†J§X©¶\ã‚Òø.Wª$¢çX³ºÈ¨ˆ&X˜š¬8t Í$a“ÄåAæSÅzd‡U‹§&Óš;¥« BF­‘ÞIEªŒ{îÂA1å!$6'^ںМuºò1fªXå³ø‰‘’Á&sLKE­@Àª­¢_wT Ãj9Þ,B´¨ÕD†ì*AŠùûÂ5宋ù€3@;ÛŸ˜b}øÒ ñÉ,¦`f¹x0|Á2‚lLSVpÓ FYkcn¡e æLQùì¿.i҆È)ÎÚ”IÓBmZ[¢ ãï…Ï1‹=CWÆ{¦ãÌ6…V™®Å"HT„ÖÓ_Ãày¶ŽÛþy¥Td>…샶ÌYpm%9«_H¦èN{Ñ)ÞWÇ"5|,l‰ø*ô©šU•›!¡‹öBÙ ¦9sKzƒoâ<å¢&€T滋?\ ÷ü(¡h³.|cå¿h3± 6±:£Õ^‘ú9Xx§¢ ArAAÐ$†V’z‹>Q¨ö{Ï»ð²þõ½Þm>éª*ìªÍa‰$$]¦ò‚Ÿt¹`Xj©È§ŸW u\Œé<ö‰“šSß/ô‰ÉæUÖ'ÉMàžD¡ëeqã¢B8ùI‡ÔÄZ ßs¨j9b0U!l0+•0uý$³í¢Æ÷hT9Òà¦XNUØ4ƒ\V ÆÙIn¢›i<¬»Ir¹¨®Ïh"Ä)Än%°K7»!ÚS© l—]"®èÛ^¬\M ×5N÷L%s™ªxÅÇœCÈ«0Æ)žJ] •jAGW­‘¡uÊ.Ù[ ‰åJ³¡uGVÙ ÆQE=²f³¦êG2kæJ}5KÉÖµÓ€2 @ÅzhߦdòsFuYX`Ûià¾: £#ÂB¥§bvlËöÃR97¬(16öX4±ÒR¥ñ©Šn² ïd±óˆÔw,p´3 ’¢2¡ËH Æïj'Vkj¿Ö‰×„h-즇+}|GÙÍÅy‡xcÃÛÓ,R£Ld™ÂZÇÌ¢)éó„ ©zYyX·lR1°ÈgeÍÃUXÜçž"ÞÛÂÀÑfFÕ²H=ùàP¹¸öÁP“è®pÝŽs.L3¡Mlø§JbÕòÍëXZ¯úaÎì"'-äv˜R­F4\¶—„„ź—BEÌÊ‹L²Öyµp晞b ›ÝHD;uU¬Ã€Ûæ¤?µšÈoªÎ1哚ë€>–õÏ5cÊôô¾pz|çôwlÕÍŸÑò¼‡Ði´ª>xÝoóµÌGäiïê‚cÌvƒ¡ŠX\x¤qr[JÛ µ¯MeéçPx·Ê Må^¨»Ï]P}ÜíÞ2ŽÊ$Ä­5‘™[ZˆGÐ(à1ïe—/@ª(T]>0ïTQˆ:¥gÑ@•fÜnì-oõ K f’4 ’Ä_-IcŽa96OÕN=öñ˜½Áƒ·L/íJça›ÏC„ÂzlK'LNÏæ¶·ô›„žÊ j͉}£;¼—ôìK C/ÈØÕM”a™öÝ»`@æÏ¨57UÊ„ '¬m';³¡³TñðÆLÊ4üvqøDËuX9m3Oä‰ËÌÆEs²vIs–gQe—²ŒõÁTPÛåY€‹uô iÉu¿Î©d4«É¨ßÑVRõ•UvOŽH'ãÅ ¾òd‰ÅkäôovÈ*ßœ(4oÞH¼Ä Põ!»é?ÒˆC›Ìž ž ú}‡¦]äÎÎî6J±íð{Iʬkì7¢3no1Ç4µÿJ|·£‰ŒrÈÍãìÉž¯%ÒzÛÒZb/‡\—äÞÏp÷Ë·Ûa&|í6˜Na‡:ß5úàoU¤$™6¸ ‚òpwX«Ö7`˜&ao‡P"&%1ärl‚ö˜oòB!C5?)ÍâÆ¬’ê-…)DÖìØæ–ŒØI”Æ+DÊ}|BÙTš@ä¸bb™“Ç™–Ya¼â1ç¡ä¯WÍÌõ{"æãŠO"´j•Áʱ¤7PqÕ54™ÚHr»2`˜Í>O}#[o(DßTi(K)—5·(اõm.;Ê·`;ëñ±È®Ùí yÖÛëümÚ–=ˆíâePœq’‡÷Æ©1ŸoMY)™ ©€ˆš=%4Ç¥´1GÕT»ÞZdÇ‚ÿ ÕšYμ4úÕIJõîÚèE¬úT˜¼ôœš–ýÕ +‚Onª ÞeEŒ‰`í´¤hVðRã=fôOb_¥bŒRs–l ‡6?¯…ÿÉ`ҨŻ–#^’ÏÍruµ»e¢HVPò–™`Xdøe¹}ðOè¾Ìlö¯Ãu©ÓŠõolK é>„p¼›¥5º™Ió7oÄC¯¨½ yÀØàý÷!ïeV«nÍ‹Å=åÒ¢ª„%Ý”<rOö…vl“­Þl.ª`º®Q”eg}£mBèí¯+çé ë…’ÞpÁƸó(¢ ”&•J&ŒÌ±>ý…!_»4;¼vr<§•¤Nãx G‰wýÈL×Ú&¡V7Cùòj‡ää›w­¬Ýw‘aµ7Ãî 2¼ÔóIgpƒ“æMŒ2:µSÁHÂ*]C´7“’°,NK¬ñNº¨¥ÜOúUyçà Ï߇/9×^ÆtÆw¥¹µ¼jÓë›bz5 ‚õ0ø\³^Ò“5¿ä[hÚbǾ©­~£ ¯îÓàYÌëÛJœe Te†¨ÑÍý웃[f5}˜ˆ"N­TŸ”Ï,…w¼‡$"$Û}èHªBQ•—&©ñ;—Œb_dª‚áþ¥ÙTœ¦çÁ“x÷á%ë--fëmP9j˜¼—mšÕ{î•üg~‹‡dw„J…`{“÷ÆyR®,žs¦Þ…ëR8ò.Ül¼€¨­'æ“HîY• I÷\@ÅüõTu×Ä„j•œfn"‹”Uu16²šÛÖÕáÙº`¬q“E;®{ê8ð®{R´î=^{\÷±á¥—¡G3ß–’»êL¾=a˜7énpù EJSßišÙ¶—Ï“øvôŽ Jã~Ýνl_¼ë„>¿:Ö±Òƒ¾««›J}ÎTô:óãÒ‘ Û:¼×óTÚNiƒd}êÇÒÃҀȚÀ¯*€¥NX¼¶@Í#[ç¹´»!:á`y™4ð†í7 ,+¾à+’3;ñk© õ&¯Sša±Yƒ5Úo3J€‡T¾kû§ÐZõ÷y¦«Õfã+ VìæˆëD‹êƒÒ"¨â­šwï7·~¯d¦#“ rÙ1[ÐÁú„+J^ö_rˆ è™î勯ÿV^¿Ëôq&}ç’}'ÑÇ{ù3éá·yàßò3vAÊYþàÚ% ,i;ig'ìaX0P]‘>¸Âr!P¢Ë]âï5=Ô‘ùR;uÅ}éý‚ýBÇ •И]ñ_zß0àÏý7üó['lµendstream endobj 568 0 obj 5564 endobj 572 0 obj <> stream xœÝZmoÜ6þî_±è…xU‘Ô uH‚KÒ$È5Ms‰¯×¢ k¯í]tíM½~ Šþ÷ãP"gFy´É]AdyDRäÌ33ÏŒüë$ÏÔ$‡Ýσ“¯^Õ“ãÍN>yêþïüº£ü€I÷ãàdòpÏ 2ÊI²&oÔdïh§­&µžT¶È”žììü”Ø´L²Tgu]›D¹_”LmžgÚÔÉ«ÔèLåºH¾Ku“Õ•®’¥ScªLë&y’7µ*ËäY:U™µMS&ÏS[eyn“=70«­ÊMòEYk·ä4Ïl“×yEg½HuòÔMÐnåªN^§ÓÒM(Ü“—8·[Æ6y䯛Fu«4*¯» õ„d胴ɳ\é°¹þÐï@ªµ®*·!•5-š7{wêt#ê,J•UÖitoî´JËÝÿ2-ÛÁ…¥ƒ§…¶Nu“iQdÚæªô…{Uò.k¸,áÍy®Tr ¿ž»óçÔþ K [/“™»5nõÆ$gðè.ݤnY7Ç$Çp¹ˆVéTñlåÇ´B·LálÖ8áYâÈã(\¢pM7„_!èÁ騀ãN•Éʲ±í¹÷㑯áòs×¹Ž *èN¸ —wø–éÕçô8ÝÝ.>¾ŽÂ#®$½ü; ¯P8B|Ïï¦ÖÙFY Û¼ù=ŒZ¨±×ÔÎ enÆ^ƒg ë¬éΆ¶=akx_ˆkÿÀ4 ·…±nRXˆèêoOR°¹nÜï:8ÆiœC,ñ#]Þî||ÍtÕ[Þ~W"&ÿ9÷ðî©qVL¦ºÎ”jšv W€Eô†o³”]åºE)Üøi–=D¢ý9,Eжƒa‡…­ƒß¢Ç–ªñ,š™<çî1ÄÁ;®2· 0W¶ÞHn|. ™o»8DG![÷~@u€àzH}7Ä=²óøR6Kx«m`"Ŷ6EãÒG@'?0Ù Ç”ŸÂcA‡‡ÖŠªÇx×n7˜X0ÄDµµs{ÓÚ§sÉH nï¢*\óX.˜â#ÁlAÎ0س9c^I0›KXÀ57 "þ> 1ª,[T["*n€B;n4Pq(¬Þ qnoÚg…£8àB‚Âêÿ …áQÁGøY°xYåî+ž"VpwéoSنўÕbRYNZ¡7s*Æ:]ø&©hÜÓujò¬Ôî}À›k·{gÈ'n™²¨-à&×U·JíuSdªh*íÖs²F×]ÊÖ¦rZÞ¸çÎU”ÔªÔN[Þõu•UE0öO­9÷#ߊ†%ÉäzÑ—ðû—Álk}ƒcôÔ»ðû=L¾¥`´$Â7îXÊ:¹M¦ØÅ(t-¡ƒx!îö€;ç5y΃tØ.F†±Ì3ÌèD%b™ ¼´ m<ÕðRaÀ=š0Í;V/ÀØ3æ Ê6=—ÞB:ÝYUn€Ÿ’ZèâH:á"D§Úƒ` «cº<9ßp%Œ0Œq‡¼@)9YjÇçJ – Ç™4 ´UÉ6´¼õ™–’JVˆIÍÛ-@>D>"RöÓ":f+¤†x;“€8hèlKb¼”„œm0E†ãIËcŽ9Áz‰%ø¡x TÊéºàZ·(xº:6Hõ.¨lKÀ±%l F‡Œp¥#I(’¯í dJù)«ð!šõ:71јä/‘%â*WÈ1ï÷ò†‚ß5\JôÁ~âk¶ËµLän|Ç=Ä“ŠÂ· Êå"UB»M}œ\„„¡+<¢€Wp_²2O0ÞizPÍ(¥ ¥$¼`࣠C¾j‰fK~®ÜnÉ–pºAü;އÆ3¸| —qãOC5Ò)ÒPû‚½ô˜£ˆôÏݾ‹.‹.Mê ËÃñÿÇý\üØv9 ”ïåÑØöÁý“´²‘6 •‹p¶yK6-~6¼`» õÃy1!°Cýô"Þ{~oêŠ!‰“>tím°¦º…—vûœµŽñ!ß^ù ÄørsaD¾¨ÍÆð³¨‹—AG·o:“WîKhYI#¥†âË–å@ÅVsÉlcyüÍŒÍ×pùg 44ÓõÏ_Fzó»©÷[ßËCΉà/Þ’oàB²Ô«øø ¿ÆÏe$”ÞÇ÷¢P¡ðÇmý£-=E¹#‡ŠÑÛ’ið9„Þ¾þ•Å{«íÝ.x!a=aŽq@„ú¥4ý@RQàf•?ð¼Žï|ɘBšÐÉ@Å¿%`¡”DÍaß@ Ï3Š£>8›b”‚†Àx)bJÖHœV€3÷4"VÖ'Ò–7¸»OÊoùz_Ôé>ý2H ¤Ì$Ðêièδk’çãYXþ ùýŠü•î/ÒJø…øŠsh¼9ž}9ÔÃAQ·pì7(åI ܾÀ±_3íå«ï»,Ô~l÷ù_Ç!ÎÁj«‹OÞ¢:Ð…ä+£-ë®ØÛ†bþù=Ø_¦èÃO=b7ú÷vþáþýYÓpendstream endobj 573 0 obj 2706 endobj 577 0 obj <> stream xœÅ\Ys·~WùG°œí¦¸ãÁ 8•‡øŒS¾b±*rl?¬HI”C‘²(ÚRRùïéÆÙ=ƒ.e»b•É%ƒ£ñu÷× `:q4â¿üûôù½÷¾qGO¯ïGŸÂÿOïýtOÄ Gù×éó£N ’P2„1ˆ£“'÷ÒÛâÈÉ#ëõOžßûn#¶f3Âÿvk~8ù¼¥}KŽz^<9ƒÊnwjp.±ùëV !x6ÙÊÍ×Û´6NnNZS©Ò~ó ”*hv㡯Ê¥ ƒdUÖçM`Ã_B?mõà½Ñ–>øªK3ˆÑo>Ùâ‹ÎºÍgøÜ¥ÄæóíNb}¥å=ņpÐ_@eksñ¡ÂæÄæÁvgàƒ~óíVãh`”øÆÉ¤&…wñ݇[™Ä¥=—‚ Îí`®N„ÄvŠóG!6W0œ¤·›ËZøªîká³^ÍÇõÓÙv§ƒ‚7›_zJ…ç­ðY-„&Íà³ë×„ŽŒð‡¢£{Ü>¾NµòXÁÈ1¶õ„õU>^´º­”žPƒ±#ñó{'ünó²'¦6»Oz¹èM¹‰ée{<ôäýºSˆ#Û ŽvÒ ¢.âwPuó`GdOÊŸ8˜üGç³ù~nkõ¶» G?Œb³É¡R€”ÐÁÏÑ@æqJ×ëÐEl/Ý´ç/{Í?¦!¢50äàãÏÑvÁ;ÅA MÑpÅz£òç—æ/6Ÿ¶ 'íãg9¸(fpvöh‡¸1Á§u‰¢~Í$_ǯ6×uq®ðG,;Óテ{k× „C£²Xñ6ŸÔ矵ç_Ôºì§uL±ç›ZõygYÚgåoÔ1aÒ,ÏóTéúÆ6è^n;hê¯g›Ø¾=ÔÓ¯&Ùã6º6îë;S Ÿ–Â"„|”TøñM})–½‡?Z•¯ðÇ×hôgƒ%“-u+ð;ó¯kªLsd¿ê5¿góœÃ¬ÉÓ.„®&‹†C5Ô¦¼˜¥sÚmlÎ 9$0.2}+x¼XWç¡Ç|¸$n“Ô|¯zKzLFµÆ;ÿ/–ø8š_(Æp§ãWŽ™ºÍŸsK^L]—ôÀ>§²/Åž¶_ðÐ õ„[Ú9uézÕÓÞÊ7`½bzKl>QÌE3¬!ÈôÅ ÷_j”0`4¾ÂÍðÃu ,ZÁùKÝhô¢Þô–‚â&]Ë×Zºhë÷ˆ+l ëêº'8• ›Wl‰'æâ¬·j]‚Ô4û9SR3ÔwJ€}xpuÕÃ!÷×káý¢“N2ÐöŸ41>žÁ/#¹ˆñ|&°%æS¦ôVö÷mB nþÞûÆA`¦´•˜MÙI!† vzT5ˆÓ2N^V(6¢–I ÍfDÍÙ|€½H%,Q¥fD²ÒR³ÝçhŒF‚bó:áÇa–ÇÅ ˜ÒÁˆü¶]oÇAK'4¢FFkˆØÒÛÒ¡ !íŒ0F%=75çbr¬5,5ù˜šµ.ƒVÇÁ$`žZ)Z*3øÑ ]‡·¬@ƒwÊ2ÐwÚ;äyI½Ôô&…6Ž´j<ÓÖ=¹¯”ÖIÙ<ÁL$ÇƒÖ ´ZˆnŒEU18ðòätx(W‰Ù<k\¶{øÑdÅ E„XyRßȵíhé‹ÓÇX†(Æø‘j‰Áge¤Çü":k™A)ARåSmè:#|*•ޝ-HµŠhàÀ®K+’aœÖ :k2¤öò%­$›‘40bæñÂL‚ ƒEkKƒl€e] '©,I¬º…*çô¯­Š 2¤ä줺Pcœ2èŠîùâ´‹ƒmóÎuÊ,¥0ÒÖñAßg-=›¦Œ¦Nà§A_¶wžBY ¥³&¬„ÏÛó4¿Q´›Dî´ö ü,!i}\+ô(Æ€ë–Ñj­&vYÛ!C©e¤•ì<¦È²D9ÈoØuRE'å£3†ÞáÍJcDSŒSŠà™uØÒ¯„~{Š3XV`e±aÔX‰Ë á ŽZ"DÉkÜL(ªM¼CÆcÃÔ ƒ ™å9G{©CÆ_‹ÇZi®g00 3*Z®H€ÒFų¹ 1þ7 åÝqáÜtR»žJ½I*^úe‹û&Ò¹(R¢¢gMº÷ËPV #¢û>ö­yŠË«Ž´PC"_²ÖÙúQ Ç4d®˜ ¨‘µn…x\~ NZªWWT È'»ÏHnÖwÒ™,2®4 sÚˆØi¶9ö!ÅeÇÙpJëÜÔp^“®aðàä©úTI?m6Ý0‡ùµùôâœí=ŸzìÇc,Œ'¬- –­x¶dìvàÁ£¢n`>óLåMÁÖ½ÝY+ĈѡÜbh‚RM¼›|‰ ‰t>ÁôÄM•uØ}Y÷ wÐ8O%é8ž¥ÐKxÜæÌšCzœ9`”Öl â ­“‰ u°¿Û˜é¦YF~ƒ{ßÕ.2k¬ƒ³þ+}à„å~½@k‡u!Ë€o™048MÙ)õ Å»<^°ë­÷!}È`¥ æTäf­Ùâ!ÛªÍ úÕqœªiò.HßYh›œÅyG5f4!‰Ãz:‡Ýsœ—_ž0ð{N6bÉ”—žÞ̓><77=ÕAù{3Ãç«Á)k»ÜÈIÕ’'ìÕmÜA—cçFäWF1±Æ7 ÈÄ p=Š˜Ò†I.Y—r'‡(C9â>PœZ?mHÅdÀ§‰sãßû:v!JÛhâ™õ-Ü)Ë×;½‰ ÙŒéDöa®w•ù–€R,“AQ×ð‹ãi¯÷ñ‹ÁµO{c@,p†´<ë`êãº÷•{Ÿ)'·ãH;ÀÇh+–9Žœ#¼<^êh§F „nŽøOMû‘@_dêdA‹ ‘ðy_V»Õf°ïp?NmÂP\Yb–L‹"ÓÏËêCsl =4 O”Ä„ÁR-¾ˆâP¶éïóf$Йò'˜KæOQnÜgEˆëî1ˆˆ±Éº{°‘]M¸«ûGgô&¥c€@%PXÆ2(ôHÒ òà,Åi¸®lFðž( q±¥K1 ™Ù0‰óU`ÎÁûruó6Â.ç9æ‘Æå‚)Nè¹ó¢iBƒZƒnÅ!f ªÄP©Ï”&fgßlº 0Å&ˆ(|bΓrÃ2Ý0UÄtÌ¢í<{î;føFŒð?1بȽਔɰMNiZ8תت¶S'_C^‹Á§ò]3Z? ¨´ˆ&|É!Q-F)mTÏOgÍ*,7ÞË6å”H7Ûú(në{¼(Ï®©0ؘÛ=÷ÍmiRjÇâfeÑ„_fÙbÔ$¢@% yžf–ë! ²ŠW©;ê]šÕe~—ós¿[Hžn)€^v 7Q )*nùPR]iûæ±ð¡(®C"ЬJÐ4k3ú·†·`‡‡à-ã÷©0¨>È1 ÖA2¶oÕaI‘ºÏøÐÄ•$e‡†Ä^W³ÄߥþnçãY§ò*eK²ëœ%'Q1t±: ´žl?0˜è€ÙUr ™,¤g; ‹[]1òÐÕÔÕ–yÏÖÆó6oH’!+G2¡DØxÈ@3ªÝ ÁäAˆK°(·»$Pf¡ç:¼ØÓ´«s~JGóÃ÷ƒÒŒ–s o‘ÄLÓ$…—R&ã!ÎWTÑí”øÝZ-mHŽT'q!æèa8`\Š“D+9É•c^#?^¯H)Qtt¤¡Ö;j'ž+ “©NœËØg׃eèTÊÞïØõZ–t$ kv¢°ð ’0a±ñ^Š­“Áün/žçÂì)æyÜÙ6ãH¦!Kr+y®øâqÞ!QmOåÇ6âûYŠò—å)øS:£1„å9q>ÑæT}žá Ç™¨‰Šd•‰á;d¿m²4“È$b®³(ÃÁ3ûþ%wÍ2Æ5ñ`'ÔÄ^ñ€‚K ÁJhúÂY©è̤ ˆ>{{DØê;é!éìŠïPßžðÌK€*ÖËW³TüL^g£oÙÎ]ÉvªØ¶XY¶5Jƒæ-胗 ›Š'…Ë”"U>Š´ÀEsží-P,ƒ¥•sJba ¶YÅÕ×ì:ˆö´F iˆŠZÆÂ´1~wà`bBNÃæa>ná‰+ú¡¼‚xMìã´g3ÎÓ3)„ í›ÐgMdöŽQÀ`¤)vAò¹ŸdO× ’ª7Œ¤Ô°¤­uyÅÜsÕd½¦ÛMó ?÷XK) 铺´®Ð×Èç¼z…ÏÉ 9—ų3ÞŲ9¹–^¢ävgd¹“~šº¨^4Í¡Fôðò·¤WÒøö’êî$ƒÀ¨dŸÞÁÐá`×)ƒŠ:îä:“*類Ò-Цç©â wëܵwä¢}€‰¨˜Úšjr1¥_CaÅ2ë24:£ŒuŒÄIoÑˇR_É@W>©åMϳ¼b>ˆb5‰ÞÎÝõ¶ 8Y«P¼KY&®Te ,ô`~‹¥Ï;žcÉ IMCè•íæâò²Eg1#îÀ˜É¾.Ñ«ÖÏo–ˆ””da®H @»^¼Æ“e8#mÖ"ÞÉ6Õ²{]׊”bR„Þ¦Ñ}ÈI"¯„€?Ç\ã¾} n&sã°J·rRâ-½®­wwôRDy7ûtá~—%5s8˜Æùf)»”òFöãÕ³)šP{HlB,Û©hAs)ÃqÛq^âxˆ6'ÙxÍâ«Ûö®#¨¬û·™ßèÍbêOO†«hŠW$è!£º"£rbÓ8Ùt „l£A#@üã¯^NyíIõb.`%\N®‰¡YgFä:ÙããÌz…á8‰é 4úí¼áZ~c)wÎÓxn6d^æƒËzy§<¡Èeb'N0™+½ïåjã±kã¢ÛÎy1\0­Ô¯9ËB½X‘Í~¬œ9ÍÞüÀuÊ^šUOqè™ó|«(óP¶Ò|GY±BMHêIB¤»m8Ñ΋’õð A©X²9Eÿ$ýÉ÷'®%gsõ‘Çèį=ÞȽ䫺mRwMf„A[–J'Ý¿O,éô CÀ„鸹€áV5ÿñÎB|S.«ÍxÙÛr9Âæ¿ñ; L¼&6¹—ž.Úüy[îÊ·&ß/e³[;í{1Þï]åé^ð¿¦Ká¿k!¹¥D.¶jüšîüÎL \¬n_åAît¶ÂrÇ@ðÏ»4¿Ö&k½\ ;É aÛ`1¿lŒÛ¼ŸùÕÏòë’Ò?méôù¥í ¹NKîñ’ÛYäÙµnïÎNÔOŒ{ñkpÔì (n:«Äç´Ëœ³¼CÎv½hÛì,³£&Íâ/~f´w‚²lF;ÛñŸéXG>¤K£½v‹ÅØh¬Ë±o~¬ÊgæS…rê¨Wüb9É*ârpÓŸœIŸ:wvxd8QZêuÛ$Ü òk9”z¬ÛNÏ “ ½M^öcØB¯ñp<`¯"°Ã;µB½~[gž÷#Äü.¹ÛžÑ4‘!ñ¨„éúòQMÎP/…V¡‹BŽ»¾¸wL º&BkÝ{>ÎÁ•êíÞÆÂÊÆ~œ–™¨ÇŠ>¢È.s»ñ–à„Â¥ª‘Âi5§påê\c.~q?sSÓíúœA›œ1¢?‘[4r‚œþ)‘ôʲðíNnNJ|®ÚV¬À4×òAÐ,ÓÉ¥‚Þš’‘báðC­Y5¢wg–2R®¿ï—)n’×}â7!ß…'ÑïMÓÎѺØÍ7cÊå(²{Ö€;Éšç?Úi”Û’æ™ý¡·d¢—O‡epƒ±0³ÙšX€y„šGŸœ·iŸ §ŽEúž‡¸ó~ûý®;«ŠF3ï63M©qË=~Ç]7iœàkØàÿ[$©¸/û¥Ò/)9§Œ ý}Øìýʵ€XJ¾›TÀP}G¡&RPD/’åÝÜ:‰BõÜÊíã“{‡ÿ×(=Óendstream endobj 578 0 obj 4964 endobj 582 0 obj <> stream xœåÉ’Åõ®à#æF·ƒ.*÷L"8°Û± s#£1R ÍHâëý^®/³2«ºÅ€­p@OåþòíK>?›'v6ã?ñÿ—Oï½û…9»~qo>ûþ½¾÷üóÎâÿ.Ÿž}xƒ/“›;;ÿî^ÍÎ ?ÓVNŒŸ?½÷ÍÎîÕnÚóÉ#v þàþÃq9O\î>ÜËI¦ôî¯ðq²Ö9µû|Ïý¿Í§O÷!ÌÄÜý~Nœs­w_àW܇Úý¥óåþ &)õ¬wçØßXΪ¡Ÿîá#sÒâ$ódÝl ï{69g¥ÛýÚµVÆÄ_B‰8¿c³©öd]ZNÂÊÿÄNR*ÃwŸ„ŸùÈoÂ8Çè,Þw>’®ìÝ<ÍŒÛxˆ¶+9Ïçiçßžÿ .î€\TlÒîèü î¯b†Í^açCl=$".tú¶f­†óÿ°?à=éYî^ÁÏNÌi¿…LÀ6åîeà ܥR.ì!Žâ“‚]ÆQœí•®©º¾ÐåYi&ë?Œ‘’q¾ûnà¾Ý±§t¼?è ‚Q|w™?Þ$ž¤eÉžâ Z-w7åëÛxX0»‹½?¥œí„—l4ÇÍ ‹8`ãâ\ȸ"þzœV{‹Â µâ&œ ðíÁž›IÉYdÀsAh„è‚Sô!¨H‘œ åŸq 0»ï÷Âo‹‘½¼Ú#‚f&€[BŸŸ÷ÜÁNüÍ+ sÜ9¸£xD§$^”œ|4äãaY6§ÅàÇ/¸C8 qšô$P W³óPgN«w÷wùkžiÊ£¯3¿ÞaÒÂ݉ˆgøñ£ÂÖÁ…Ÿ½ æ‰ìàrìWzæ<ïÃ*FH 2 ;ƒ+ƒ%â\²âJ_/y§é«]7vf€ _Cç<ñý}¦'<œe¸,ÞÊ€ÎBAêø¹L½€º³³ š >Žf¤"Ž’Ò éT0 ¯ÔHX“œî«ÌŒó§tJà}ùÛ×Çuû7ž…ƒ¨û™†#ûDTÖÆaî|ˆóÉñD oÇ…`†ŸË…@>!¿ÂR\Y{ö à'BW!ëÄNîšOˆl˜M°Ì+è~!­YâŠVðL›ÆLðW\î Èôn‰SùþexÀïpTÞ€ ­\ˆ˜¥+ìGìd‘¸V¤jŽ þ‘Ãá ”“,z¢‰\UXÒ\ØxÁøÌ^j8vËXûjoMhD†óÙRâ&²aX®à}¹#¿÷}‘#Çÿ¹ðßía×xLÃüí ‡.Ç\Ýóu:íáÞ«Öh/Kåzr2ç“€ò³š´L(_É'ŠÈþ(íNo îFìVQŒ&(_a´_‚õ©ªH‚G¥g¤`ÿg &éÁXÜX°$ØDéX_ÆÆ@,5÷/˜–0Ÿ­>+¤ÒUL–gxx„ψL‰ -ŒàÆ í2¹èË%¶ßî[LH³ª‘Á-©“%!”gE«ˆ'¸š”$'LÚžÕ\1ëÆ+F 0 B—]b’ê£8ü6ìÅCDT Wßh8·zÊÕÊjõˆ„ýaÕDÜF¬#jè ç£(}“ÕÄ—Ê!‚gá+&´@xJˆþZ'’¬GK½å.2¾Ô’0p^«‹fæÉ)Àò\4’RÒâTAjÁÔ^¡­ç@Gc'hTÉ@Ø¢´ëßv"¤Anèuˆ£&.4h̬•ã~””-öä=Z6*Ñ3¡ÒüÓ¹*Í?­9œ?ƒ&ãžÍùe}°¼(â¼F%¥‰L×qj\^êŽ6$¤ÆE7È-íN Í” BŤ³=Q±€N@,Z #ÝJ«´(£r… {R«§€©`Z7({S"T2>ؤ" íKA‚«>¬DÖ8#Ÿ=Ã_ãŒLxÎHPñeÑÈ~„³œ«|EÁ‡¡ Z5 òì].YiE¸.ØÐCåŸÙ+•°‡­¼×éGì4/CrŸãé®áµçëmÜ&zDЪ j›f¹Ô›h×C<ºÎ$:%£±rŒö Ö *SfòÈ2@“E½êH_ä°àézP¾v§'öMiÿµtØ'ðáŸöÀíõlC·/—Ò… jT<_è*FJ™J#eF– ¤ÉÊv÷¨‰á¢òLõPê:ˆ›y¶IjãqlwgÞÿÎfE>VªŸ˜a²ÃɈ!ŽØVû#¼)Ê:͆cÅ1H‹ôÈ4Õ˜À#3_h¬Á3ë¨&Õ5q*±­n^À¦W„ö»Î]”+WJ'áS¡¼—‚4£V3¨0ÏD–¨ô4„¿]U<-LF.ª´~iÇU “Ë2¡àö}ÆpâBxŠàÚR¯òœ5ò÷¨Š dÒì²…;tåfËyˆ Ùíq˜ÚX"@êj{ÍÜQÀŠÏÎ "¸é TUôH&eÇŠ‹?ˆ:’”KÐU0;Ò–Ì3R÷¢;bÈ} é»qŽ ‹¼ï~L¹J*5öt„ ±¨K¢H»(Î?D—'l!ZãŽA!âÔÎx¯Y$]ý<£M3&t&Jµ¦ÎDW˜Å«å¹Av;í¹qǵA@}²zS$wðEç­^3ÀÖh'×ññqÍy’K9†{š#ñ+À>„çP‰$L if¯ .C³µe”c£d3Hÿ œ¢YTk=Jp³‰Ø=ÇQ6hz¾$ê) QO4ŽÒ¹õìÏŒ¸~+™äÏ4–IÄZG°ÕräAÇR'øq³Þ|T»™Qš á­7¹¦§pò·ÆÐD‡g>*ärëµ' ûÝt¸/ñÇžâaÍnÌÒN±¢q_<JÞfâd„Ôiijƨ0i³¤;ôW÷ lÅëYp¤C¸°ñP­üÅÿÄ(-þï=lUø†ÿá01XhÀ?wßÂ>fÇ0âeîòOâp/<¹6‹rà*·?,íßååc™éIù„¥€ê5ÞÚ—ö›ÞÇÒóeõ1ÍôSoù'½AÓGu&†Ïîÿéx˜zH¾—ÿS` .%þ›$ƒ~ù!ùzàËx&ÏØˆñÀ?†ؘVzÑkÿµ³üëÃã[ÏQÝÿ þøAõ™Ô~SÚ¯ÊA¸šôµ¾üâé¯{9Cþù?@ë(×|î*ñÊÇ|/[ þý©•œ™À,ý|qÚ ù;5缓øñœÓÝ!ä‡wì­œ²înIHv.èî. ðËCiÿ¸\õãÜþ´´Ø\wÔxðû.dvƒI, ¡0ߺÚZ‚óÎð4ÍmuàúGeÊE:¾ÇÐQ‘6Ú‚õ7³7âŽz)ڇʱ3 †LLOE;-$Ÿ"Æ ð,O’Jâ‡ÄU‰)âRÒ Å’êÙº´O…&qo¦ )ëÛó3ÆÎ4¨>¶6cwEÃ=ŸdIš~“œO,ñäLårexÉüÿj93¾› {Ìv ó'ft†úŒÆû°V”<ýœoÿÞ|tt·Þü×óÏ'·!nÞ`",õž ¸•ôÁìU·HÎ=™^ž4í´8ÏðqpãǃçÆO™¦WôkòôÝ™èû îLáø„ˆr„w“ý9„K½'õ‚ÿn®Æô+­ÅL?1nY„P²^ê"„Žï±õªa·A¾¬¶¾„Ð"•ÃõŽˆ“…’Œ³!<Ãz¼˜zbÊÑtŠ…Ó±õ/õóLb©Ú@öä,T–Ö,˜®‰éú¯_–™HdºÖ"“îØ™?–¤ØìTC7³ÙØôa Õ‘à’BB¥{IlEþ¬­î0h¤mÏóžøå 95³KmÚÙ1+È'fh<Óß´®NSé†BÇg>ñ““¯} TõI}œœÓVóŠ'$O…8°þ“%Ç › D¬V ß*»’^׉±`6Á .´¼à£«ÀŠQÀz’˜]çÓÅSÖbb!ŽŠjO˜Ø [cψðÛ)r¨(¾­a™ Ðdàèú‚r »d’è]È-íì ùPÈZîgM8¦ O¥Qˆ%‹3Ò§ÏÂôÚ¬†Ú0÷÷¸Sçwò.®lŒTL˜ =qCñÐ/…ȓnj^9AYo°…2ø³¨G$!´ åã]˜Íé{)q½üåÙ,V5!_¸¯y$ORLÜ29zij³>K¾nhSMšdJW-A±(!©–›x)¬¯!ŠVI\¡jAÌVá4ôÒ¿“9ÑÔÊ`giÚ\DšÝ¾A| R=W¬ø|“Sy'´4ŇT;é7~›ñÖã± ¡}$ćÐCäÌ ¸OÌ£GT•©z…j‹ ®Ò`:ÓOLyS©PXK“Úf ÷@S$ØØE$þö™ Í”ð=ÔN +˜dH€8UˆvtãwcY¼:¦ª4C<¶öX_ç¨tñ8TÝ¡²šXK©pêF§’ ;µ™ x³Ñ~‰˜åè(ÏIõÄ‚ä†tBèo•ÉskAº’‰P:½eÌ‹r¢Æ–™·, žºVZÅuÈP½qâ hq+˜›‡»­Y¦†4räÈzBuëŠÜ² Dê×Lö§Ów]HèdîæÒô{ên_¯ && ƒ%ˆÎ :Õ^qRÿ>–¨¤"¼›{ÛÔwtt¯é ÎœÍ¿‘ U¤¹!œee«TT~¤nß @ «kRÇÂz±PÈ ÛfЬe‰ßEÂÜÇk¹A5Ü}]£ÎèZ½ wˆW½—{çðÕI© 뫇¨HîmE—8ÒAK°Ðx„·¯ŠÚâ\&‘Ô(¨ªuRµG IÚµ¦Q¯‚ú6'Ú'“µæ^Þ”6ƒ¤PbÅV¹¯=]ÐôØZá,Éh5 ƒ«òŒÇËo8ÝnÆÍ¡Ú ¸¡ÄÄŠÑqW|¤´æ^eAbÙmMY Éä~VFUe8ËäQâãòÙˆœ:~“[Pßcæº;Iï[–Q I©&‘ Z[)3‰þ|$³‚Æb†á 2,¸w6Ä-Ì£¼²ã8m©ñ?^… Ú©/ü÷• ôµfc],!©µP§]öŒî.S O ÃåÍ0îy{‰bàÆ€Qá»[o ÜA¥#ÜŽ¬mŸœ\Tž§$BºìL·tƒxЍÞÄ2ï(Wxº C…êå醅6Rúµ¬ά“Tgªâ²\8sëBsôlàŒTëèïiÙTQšG]ФXè´¡fÀ³F¥QõJÅ^A*ÞÚy;ë¸HŸÏ@æ9Òg6¸·—qQËÍe¶,¢®„VdWúj¶z <„«¿Å![»?ÑËÖô¯ûoñÅ4ÿƒÒ®AÈŽ+“óÞNBó¥éXÉȵ‘4ÂW•¬Ö,”{Öy÷d-lŒÓ`‘eÇF¡áat—Zt… $êÇ5£œ­ÔÞp,µ¥pLÔ«Þøã‚•”|®U+-cÁ€ úªÓ÷q僰 ·®îúå„£˜_.£¬ÞàÄkÅUˆ™¯ñ.eVòÈxÕâdË8.÷ß"ú1d“ ¿pœV .‘vFLiÓó4sprwv¯ÕˆÕ/pÍ=9¸_$X¼R ÄI?ô&KÝ8²·p,\*[s0`ŽQCƒ "'-³Ôè`µÎ5>äP±ø.Þ“gúæ%Æx.ÞŠ«†CléÛ,€®ŒMƶÏÌÁÊ õhc„Ã×€Ô¸ø[fj+ªXäå±ãBŠ-¤wF9†Ä)E?G’ o¢ËXU›½]²{ŸH#ÖBMñ] €YóžÅ\’FD]~‘rÅœˆÏyt©í8ž[¾rW¶'XC4I`²’ï‹(·¹¡“õØz›ö&h÷ráz^æcÔ^,rFÂûV³;¹;nEìûª\x_ÊLÖT¹Ã[.µ¢c|r~ï_ðÏM‘¯endstream endobj 583 0 obj 5202 endobj 587 0 obj <> stream xœ½ZYoÇ~'ü#øæÙ@;š>¦¬D’À‰y Hõ@ñ²$e^õëSÕWUÏôr))1’Ã>ªëøê«êYþ¾;ôbwÀ¯ôûàlçñ »{rµ3ìþß';¿ïˆ°`7ý:8ÛýË  #½¼Ø]ïÄÝb×Ê]ãt“«³×XŒÝßn1¾Yýv)ÁwÉA÷ÞÀÆÕ!,þëb©zk½Ý Ñ{ï´ïž,d÷¯ÅRôZVv+Zó,Ž*íº0ª@,žÓõ0.¥ïeµäe‘8‚ÿ ç<]èÞ¹Q>ñ–˱ƒëž/p£5¶ûÎ;¯”è~Z,%®WZöpR„Jÿ3Z&ŠÝ/‹åV¸îÕBöÃ0‚–¸cµ¯IálØûr!£»j'/“¿–`«ÞG·=_xÑ[§mwÖ_ÂaÎ÷JúîÌC¥ g '(dîÞG-Ì`º5h&©î¨,þ,(£Š<ëz¥ÆÍòÒ£³&ÌœGñÚ$þ. ©74}…nGkd:_‚a©qàKßÒÒwYÛs .vΪ¨éIÔVƒ®ÚËnŸtôÎñmà¯ÀÛãTÝ#<ÚÃ2—ŒE}öãe=""ü¹n(s—x¯²+à6’‰¹v 0 C­°8'Ùu…BÇ Ð!W3ËaçGáƒÈ>°Â$§ù±„\Z‘¤ƒgÓÌFø“&ÎÒö£Ûv”‹‚³†Á²¹£¬ hÀp[o`6 ×}C °.‡0·ïS@pÍaQ´Œ^Z ÕfÑY…UƒU Œ1ƒFM4ø]Eûò˜465ÛÀ$˜=C0 žVàÑ­ðÝÛnÏ)éÎ7OãØ 2¶÷Îðø£‹?!ªú†Õ&T•µþ`–*kgæTEŒ ª¬à;ñ…øf’î&¢‡×Ljù£DXú6ü:?¼ ¹"½ë¾s¶pý4PÇ÷ÈñRJc¸?&d‡Ža61ÂPÂ’û‚S‚yî<ú¦¬ü¶žR:ØèMÉ‘ô ™Whè¼[²þ¢Nœ%(%qp!o²ÇBæŒÞqš1Ö2òŸfñ8H¼G% ³¢G踺| ÁõÖ²<á'”x¢`v±pB«îv¡B”øÌ`!z…‚Úá1¬kJå|^E‹‹‘o f¢Ae¬•ˆMž}„ºŒ`¡®KA30*7<³Gœ F5)/¡ÇØ``Uó—Þ·+a‘¹¦‡4ÎöF‹œ4D “xŒ€4å9wbA=C%]oF]Þ"ẼSÂavµ®R %„NHާcAwI,ˆÞ’euî†Ò©®*Xc¡KF9%‹Q@y`Ö&¥ãi1w’ãêªCŦœ½yMJÜVRc8íÞZÑ"âO%1< óò¡<‹É‘yV8à%Ãk.ÏJÃðƒ¡,Àº_„°TÂ̬poÓ´ZÓê*bA#Pú ôÊý†Šéº—› Ë%ØŒ½±Å¸¡)£4% ZMòjÞ#ãã~ýFòæ‰ukû”„6ŪÑmQŸ„Ç@=Añ*‘â/-¢B6´à”$¼Ó›á¿0¿1Í…)?‚§6•–”VX«0!µ ´;/B´Ë# –‘y¡k‚¡­uZªÑ¿Ú í@RL·;»èô(fªÈçp#µóüUÚ„žêÝ6ß5K…mÈ$÷Lº¾êþÀÆóF|•—\åÉeˆ Iç“þl1r¬Ñç±û­+KK7öd=NIbz—s¤Ìÿ¶À‹6ÔMãy.Áq\ ±Ð,ÃOêÞ†Õ%i\•Ù'ókDˆÐN•‡ »l;†Û©Q 'ª(/wV”5»³¦“ƒüúš4¦A/Õåõ;¤ÌÀýj xyÈ%{Ú®Ú1à^ÅwXr·ÝgðÐûî3Á|€Áæ•èÓZ ”&þ´³úÓëò¼Ê“qqÿ˧%žÜí 7÷Ø9_hW½I’½Ç7"K%úäã× '¸as.«¡7 GÇCC~‡Wq ty#Ø‚Ù8YsWÖ¼Y,‚» ´bKX.‡Ãqn‰zN /H¨ÂY”AC+—eð- ¾+ƒ×¨w¼pÓà9­¼.ƒG4xÒ¼Lp3ØIùñ*>bgM£•X&,¯Ý§Ñ³ò˜o˜“qQ4ƒöl„¸ wÖ3’µ*ƒ/“ „¯f.8LaƒÐn‘ôŠbqP™kz¼iYÅOeÞÂÛ4ÉXØof ˜“qíyË!‰2UÄ<:l…ð¸ îWš¦Áu‹ìÛÖ¦ud•Á+BÝqËQ—är•ÓJTL%ÿ ÜWJ—ÝwÙ2šØà¤¡©ÝŠ®·œMæB뀧ÁO ÷Æ ³(ZÈAmb¯W‡5y9e®xÒW ™¯ÌJt÷þ@"BJ3FüÚðbçq vÄï«PÍí&,^¶½É‰">Ÿ¥ÑšÅr¼¬k{;mÆÿÿL9ç³Ö™WÄDZž­ùƒýˆîøidYÚe‚™->~"‘ÜïH® µ¦r脉«²›KÖÛ–S()O[%ëã¦Íƒ=1ÑŠKâLßYlÄç×ÑiVù¶ÊIqÄmu͘çz]·Ïé`J¸©›™rÛl–ÃC‚Åã.'’®ãÑ8ž!ŸR ?xÌvþL£¿Ðã¯ôø‚Ö>‹ÑùOÓ5w´îC3<—•Uimvã—Tð¾æVmÊgˆ›«Íu<ËÕ$J ÕÁ‰þHOOðÇ‹òç^Y\¯‹c?W~Nƒ{484 `}358Ï„æê’c¼n¡é¤ BËÁýí¶åïÜ ý™½G¸”Èõ n®+›˜q„[ÏÀ^MÞ×lÖi ÷œ[ï&EeÔ³ ì¶|¢0³l¡Á'UÞHr‰ÞV²¶ˆ¯¡™TÿOó‘“õ£Ùmªn¬$¤Šº äÙЛ–#ê®&Iºjù‰seæôU´aÛ&îØFø¢7”§ÊÒ”Šq ¡8ü1Ô?ú;¸2ÈŠ7y³é×=>Í,œ rv[wšE1aùG0nß2(ºÍ C}AŒô ?ï:8©ØŽßóç©J«Þ8ú8µ‰óû0ÚŠTª–dJ÷ÿF& JuáGš{BNÿÂ~ôA÷Yè&·Þg_R ÉÜþqæ«­„±ïD ¹Ú3 l¿˜æ•u3ûÀ>é²w(5Ð'fº­f4àk¥¬çöôç’Ræ|õû‹W_ï¯jÀ¾ŸÍ$ž—1D|äÕpٿ̤9}5–¼Áχð7Jßôk‹…Ž*·Ü‹‰f’ž×Õ¦9̯+p¦ÿ/"š `Þ›ëðrlÒe(WÀã&›±[M ]öö²4@[òìy‹Ï×-£É'—bæÞûÈó[Ƙüýs~{#ð™¬)NmÈûVÜZ~9n ªö[ncú\´PEz_¢ŠÏV;ÿ†¯ÿ[…zendstream endobj 588 0 obj 2663 endobj 592 0 obj <> stream xœµ\Ý“·Ïó•ÿˆ­ÊƒwvÐ÷‡Sy0˜Ä$¶‰í³)ÇÎp(˜³ãüõénI£ÖŒt»ç¢8–Ù©»Õ¿þž{½“Üü“ÿ}ôâäæ×~óäç±ùü}ròúDÒ ›üÏ£›[§pSØ(19§Üæô?'éa¹ñjc½Þœ¾8ùa{{·“uÆ·}ºÛ«I)©õöÁNLÑ 'âöU¾ÕöíNNQE·wpM[+·ov{íݶW Ú{åþ}ú÷´·™|ð÷¶v2:†Íéç'§ý°=ÝE1‰q%àJëhõöÅn/'£0°©˜L¶zŽûË dª` Œb‘¢t°Â^;?¡·…Ç´UNêí3zÌGŸÀOl¯Ÿi/£CHÄJ¢›¢ˆ‰Ú8I'T¡öþñÞ0bñÇpÑ©Ôöåno”žŒC 0-„Ç‹x§‰–Ýù+~t+ UÚÎÚí]$%„wž+ð­V¾É‹j¹ý .õä”hdw²6§ùðd4œ¦ ÛGó–p>fÒÚÀñ%:”6@§jØÕkÍ®Ÿá O IEc”uƒúÈÓz#ò,õ$¤É»– fZŸãÍtˆ¯pŽ-ç­~G‡c­w çÎéÉW'¯7ZOŽø ­ŒœDØÂäBâÖÝ“›w¿Ø¼}sñøäæý<¹ùþ¸õÏÛðÏÝO78¹swóÕ*­¬hå'íp›É$ÄT&¯"Ú1#Ö)dàwgt:ÎH_­ 7ò¡I×{U꬀«:rÿñ朖¾Þdà¼íö?¸¦­Ñ)iy+bÞ]Ȳ„wh hqåe¦2Z.äôªÒd€™'/»ûqÒPë,_øÁØ‹ÁÛíohV@;}$˵WÁ£¨öøŒE›uÒzxÑq™¹r®hjðf{Q¥ðªûqò³VÚˆÒ<˾E³bÐl¾ ²žÏ ÓX!PUtÈ’qJ¶çUnd47áÃd½ª0a±µ(Â~Ö9šÖ´Ì܃´• X¨ ¾E'sÞÚ‹üá|¼÷ Ó¸'H¸ócÇz ß[czšxÊ„zŠ: ¢†•Ö`i‡à³àV6TM¾F²åX9óãU£ÏÓÑǨ»zç³²¨‚'?˜¯-Ñ‘/ŸU$M»½÷<¸+.Gù~Zo¨ç™´Å) (¹G”OÖ6ï™6eÑ‚›ëé¥u¸RQš¸'ST qa°ê*.p¥‚@ŸÌÖS Ò—Ñ (ƒ_‘ô@ÐY['Tvf"T´Á]‹I*†Í[å?²p&)æ]ûm’„ÔƒE pÞ ãiÕÒÇ<žÃhW«pL©­'2öõ¸æ Œá%hüȵ ä‘~­K2’ª‰x„’÷E_ÓŽn 2¸P´IwGæTCŒ‚Îz¤@Åp—¢sÞ1:C+ÇGñì Ú.DõÜtÁ+!ÀQ‚ žTIÖÀó/;r I‹IŽóøßªPDñlí«ÊVåD惠p~ZÕ˜Ñ^my'PK7ÉíOŒ¶¼-Spà_Eø æžt?̽üŒL¥°¯jÉË™¤ MëKªJ&¶Q¯,è÷Ój>Û©l¶¨Ð·ˆL]t¬øŒÆnt[ç°°V6.,þÊ1+‚ЉË6ÓƒŸÎÀ As+ö n ØÒ‡cp@¯á¼Ö™óx 7ÈUå:ã¢/ ÞßûÇÈèñÝ;)!Êßâ¡«F ¸™XtzE†§µD³]ù,•":f튭B)WÕkpA’Óû¿òôãN,uÞ­)'C­Œ Ô\‡7Je˜$µ8ù º n£Šç­áW59¿¡KIx£*ŒËóä1”^œFŽŠ²·RQR]â€â7õ€nWÉÜE7¡ÖßÅ£±Ä+„--*sÔ ÌêXDVÖsM[å:Ì ¤ð8ɧIa˜™´¢ûy×ÉÕ^vcœ·³þ7F'KèÉŽÓõgÌM5çò㎣"–¢ ^VÁ,®ÀNpåýñ™°|¨ÀbUÍb5]df¿Q¸\Ú³¨·…=#ó¬ßÇ{èm?¥™= {L¹ÀSЩÀ)åðInmº dJÄ¡0ù³%#5Ñ/Ãç)ï2Z÷@á$…/¡:ÐÃrĵŸt¶84Z‰.húni^¥'míGÎ&Sfšì ˜RÒkV¸j)C>¹ 6!IGÈ ƒB•’ä#Š 7nrzv4‡‹‘ ÚPµÐ¼ÌáÐLW÷€“£Ÿe5:‰q 22Naan_HÜë8y%t¢4Â#Âaàa¬ªJ·V” ÔÍ@è#&/A¥ð½s¨#»eЃƒýĪ8PW~NŸPÁÒ2<ƒô†˜€S‚öÖõ^ì©: €ŠÿÚHgò:‚’–²KÚÙÈtB`-€ýÏ©². ¾ËDˆ” Â::FJ¦´×°¨»‚{‡ˆ"$®Áò¾I Èo<'¤³g¯p¯Eí0üþX¿$\Íiбh‘>öR“+£SKwØ…ØWÝf²}4—U`^¹Š‡æÅ(²HC°gÚšµ¬5s‡ë3K‰9;3»<³ø1•ÖŽpkx+`ÞÇ­á€Ãwtk·&Ä®îä¡=¸9Ü>™ÄòØt{|?îã{øãküñ)¬-…nûø¨S™lñÌw(4þû9þø6ßbb Ky³>}{¾ýžCŒà²¶_Ì¿¨ïÌ¿¬OËŤÁôMfÁa^ •”ž5½ê÷¯j¤Œñ%¸#)\ßIg½¡{༘}èÖÛ1>Òžû¤£L‰RÉ”¬+I9H7Ý|HafÛ)†¶øÄDÌ›4žE¦õû©`Óù?7j6Ì‘SÏ·zÍÔÿ¢"Ï-àÆ6Ô>ã4 _0žªL$Ô‹IYë(Ë JÊØ°ì±. àú(;[CNd°_b„æRU¥^ ¹ò^6¹ Ø-cC[õ ‹ZnGÕ™"ÛšöŠ&Õh@f•Ôóú!ÞSk09Nrk“Gðø< È;ÝJ(çdëÀý¦ZŽB ô¢S¦ýhé½%Kÿ`·¬F§*`\.˜ÓÀž²Î¶UŽjŠ_U6™ܳ\¶4®·e®ƒuKöW*W.m2}_·šˆŒÌyQûÌ¢ßW]4{úQ.¨€pz…ø÷í2sOmáHC;.|”Â!º¼Ó‘•—ˆHÐêïAǾÛI‰í…3QàLùg¦|Tc5Î<¶¹ÜíßÝË££Ñ f|åOpØŒ–/w‰ O6•ÞªZ³žÕŠ_Iˆ¼ê)UNìÎ[«T¡ñŒ‡U/¦+L ªÉ‚^×4räj®n„)ܺÔS¢e[ ¹‚*µ@™{±›T.ÈKjŒ5¢9];Ïù˜ˆµ©·,Ò¯º:PlmŒÍB)¡¢‚]ÔÛ1Rç*…lL|CÛ Mèñ+­¯ZçBrrÏ:~¥ÿI8ÔP2ë¾+JÊ~§<Ð=°2íö ÀcÑPÆÞ¸UÝ$áÑÝÆêYžYu‚"kÑ‹ôÖ]¨//;àhým|ŠÀ*A%wýÉܵLÞÜÏe¾àz²)ã’µ=”M•ƒ®cXœJs…0"[;B²îNhØ”6žÍ2öÒ¬!Y³E¸ÃºÖ­†¦Y/µýpë?Äýºèb>Œáû±³ÅÜfÐÐj‘çÆ£;… çæÑì–6­HŸ…äm_’3‹í jÃÔ§SÉ£JT?ø¹jǨ$ëýŸCIbrQ4†o'°ë½ø'ÛòQ†‘Ù[4¤¥¡Ðh”aÌΧ™à+™tÝ…ÎbcedÞ„ÙÎáØQ‡T“vsNÐô¡Èßµó åx››Bþ°oª9¨ßoÀ ôxÀ Ô7{yKCfêÃÙÐê`5ð"¢½Œ“–1(‚—îå8Ž»jä;÷ê=_ÓÜoýÓ´ŠT£¡@L„ÙV#0j¤,ƒòpÊÚ"³3é˜Å6ާ^Ãb7òH¨ÓC×18«V.·4Œ:Ý®¦L½r+l¬Œ!D;®†TÍ-¼’§‚Ãïq‚šÛ@)úÈÁ”£xLs0ØÃÍZcé_xOA*Ýîd™ËþÕC®ÐA"]pK];Âÿn´ˆH"i©Å j}o×!VñBÓvO¹× 2ÞËlyw‚çåÜeìØnÚÙuºîÃkí+p@®5©‹ŒE¤aØßC¹±oe½;Ë<÷>H‘WÇÔ·Š^``/ÒØËÁpˆG9´¢‚cõ@˜äº0¤E *7 µ@sÖqœhÂy6ÿÖi,ŒuæAšèˆwikK)"%”HŸ“t£Œ¥Pbuó¢«y¬fÚ ‰¥ ¬:c½ñOm!8n§;W5±ÎTÕÄ̵ÄX´쿬áãZ·¹ˆoí2gµHyé1iáy3š£B¹ÄÛ·êâ/ êÐø¹4ìâ~„~n4±N%Wœ< Ý-/ñ«õ潎i0Ú‚)Wk+m][ÏÒ'™àh¯ ª=»w¬Æ^ïOg[ˆæ”éõ¢Ùï²F7éõ=˜«4¼aõ1üòÀÏ{A&…n—#&ÇëªZáý=&hšGŸD<&GlkÁLŽeìHñd„0ñ2mÂbCÒMkßá¤ÓL›ö6a²LXÔ¼rþ\ßC¾q˾wr^CºÉ6Óê–&óž×"U«¯€"6¼ÖÀg–çht’Í\6Þ…Ed?10ÜØ-†.‡oàÌãôÃ;gª—ï÷Ô¶©öÁsì[kwï‘dà/fr™R3‹ãœ¶­ $HéÉÕ:ñáR½¥ý 9aWF o<¶™O¼7¹»ŠzÄÄižc"`µèVó™ãû Å€cŽ×1“ñ“¤×†w .+ ]”{ŽT­QÝŽ[®8õŠýÕ9-*ùý·àh Ì­¢E¢ó°"° ÷x-@äö’*Тˆuhåµ¥Á6ר_;CVzòx\˜)œf‚,–‚ÛÃÍ7µj¾–ï÷«0pá²=|Ÿ’¤&ì¾ë@ïazµÎ³ÊGvƒmï­eš(;xFÄ X„Ëßé…fRû! é¸åªy;Öø1,©°z|ZM™¨Áñ–¦Š¹ò¸ZOZ-<|¹‘9ïîØÀ*‚Ì9cµ6Ƕ¤Ò¤ˆM êûR7;¬+ª3Í5hkC†E1†8oy7¾mt¢äýzaYd…ÍÄ%õÚ-C›pVvfi‘Ž:Q‹÷ðÑ6˜lŸi c¯Û´ŒóÚy~MÒï(°ž{nÃil#`Ø J­™ y í={Å n¹âÝ tó6{m1¹0W[y/!W(â¬Ê¦¶scIæð­>¯ Í10²+¹V“•™/œtèüú`‰„#¾täÉãç¢rmu‡Šž´ËvêIÙƒ'I 4‹"/.ú጗öˆ{ÝV¼þðRðü9k¼lN™éx.ðSAám<ß8yç‚ĺ\2¬3b59O]ŒÊÚ1ƒº®x ¢¬gÉlÔË”pΩôÖÌUf¥UÛ:d/³ð‘\’Æ%Ç” ohÂ^lÁJ/f¹ÎK Ùþûó&‚äÊzPßS yž| ZqGT£…cy×%üEúüo€¿þºúÿ¬évø¢9 ÚþTãžcV÷Éêf—ûo¶vm}ëŽJ€ë,{gw:r;kì¤Ó8Ny=nz¾hÄ'¥ì%xYk8ÁAÃÕ5»›¶ñ¨ipÓ‚ŒÖ=Ú#5Ø Æ¬pm†Uf¬Ùp÷a¦·bê|8d X¼`¢ª~‚Í •‡™“-:ÚöÝûUœÔþJ€ö÷Ûì³”ZmGmþ(ÿuY‹yv€s¾X ÁßO3;TìÅ"ú…3_ücó³òendstream endobj 593 0 obj 4590 endobj 597 0 obj <> stream xœ½\Ys·~gô#XvU¼“ÒŽ÷À)?øøRdºb•Š”H•-QÖeëß§»q50˜]R¤W¨Ýœ>¾>0¿N£8œð¿øïÉÓƒ;÷ÝáÙ˃éð øÿÙÁï‚ÆNž~r„„_F?yqxôø ô‡NÚYððèéÁÏ1úÿ4˜ÿý z)Á{I/F ýŽN¡í§ÃVÎy/6_bô~Ö~óñ 7÷†­µ6NnŽJ›»å×ûð«‚Q7¦‡­só(…Š­g)4oýí Fká1÷›a+a.?5}”‚Æo>pZgÝæ+ì4{x:…Í$7? [ÃI'ÂVkmÃ^·°N'¼[Ž“‰ImÎCoíÍæŒ«çÑÀ¼'ƒr0º1üù1ìòŰգRvÒôõdÐðPH¹y+g+ “~ƒÆÒΣ‚_ârq–·dƒ=$nTmž•ùÎp=DmÞ FÐy¦YK_óŧY_â¬&|°ð\*Í>BK3ÃË[^À ¯pjì´y¤‚&FÚL8·2ëx’Ì Ä±ØÖ—S+_m~3Š÷éS†—e<í÷÷a;R*ç-ÐÙAβpzØRߩҶجÜÚKvܸ~> þ6åÓtÂæ#p:‘sÚ0j\¼7ºt[¶ròÔÎÛè´\?ž—rŸ·ØPrr|µ¸‚L”U2À5óÎ`h0XV³cZö±5F9R–€ilùV+ÜBcË[hªa<6sþ­'aL ’ÅÀó½gúÍÁÑ?~NÐ÷^`Cìgô¼°ÅØQñlqRœ¢£8q¤¨8éˆ%Ø@RˆWEÖ$λB¸ V©ÆFiÕ?ûÈ*袀·ðmßÂÑ_”6§€VpòĽLa¯1¥ô’°1;nœíO¦)K€®–u u£]HJ˜çÑΊcöŽÿpVéÜórF]qݯÀMq}Ä´Dt¡’<8Âa'ïk½Eq\Nƒ…g*Tè(¢ëÂ2¬P»¯Û@º›Æ"k-¬QœWÖÑ,Sd§Á °ÚòE”áóžÒeM#ÍÎöTFmqéaÅnaÀf`fÌ8 ½ hÅš=$@µ°€Çe€Ðþ§6ßã\Êïд‡Â=ÌéÀ•1õwC€A@G™di ¼i4á$ºpá 3Û†Ï0v†‰¤ð{`,Áœ§‹™0¦ ¦3·-Óívc‘Æ€é˜ï jPÀÀȨ-z žé{«’ŠÙ”@:¢gŒ?at\„&c³ƒ÷·! ²éZïb¹c^Ÿu¡Lk5ëš;õ¹Ø›ºÝF’(¬—ðÀZ0Òp`‰ÍÞ¢ÂÆ ½šÈâvül¢ÎÖžC°'Úœx„˜Gìí¥w}*§]âÁËšÿØ-u¤EM¨­å—çɳç¹eiÜ(j [+°u±?]Ÿ ë‰&‡¨[ÛœÚ8´‹EtU|È–Æ¡©YÎDwèòi Â~€´‚Q¿$ÏFëa |òã"¿(¬਎\¥ âqòÈG4‘•jmdZ$cò¤´$þ©¶IhyÅ鬂¨C4‡ç;×p¾ÏÀ©ã‡ ?ß¹¯ç* /À\vžD8»o`r¢)Ð þ|¾Æ?Yß<€©@NÑ,cTˆË -‰ð¼`#pÓ$ˆY¨¹?Òw’I ÍÝËí/pSÞ µÂg8ˆ'Ëü2ÿøª´|‘|²«;¨á7ùÇãÒ²Ìþºü”cã¡Å¤LKÞv E ¼±ðÉ€:b5 Í¢ŒÍò¡ØÀ]W¨‘ôH…:?„eæÝ“°¨Ø³ö´¡\#ázÝ8zZ †,kb ÐÇFŠÄ·#í”[ñ¦Š“B ¬Î‡€¯³wFQB¢¯ø²²L¬b†Cަ3Å›û4˜yvEö u€aU‡tâë#ê(Å"Àܪ¾ö»V¨;)K¤ÙÒ| NÅ 9§¦§c±n‘ï1ŒÃ=¯-±Òn f¨:!È…r^(þu-øu‘c&³@fÿƒ éf¥¹¬ßÇMÍÜe½ù,Œ‚Ö¦RA@8ªðwNÔäˆÄ­VØ&^’Ì¢ôûc»R€ä¿W»±í¹ +èh®h&n§"£Ók ð%ô`¸Ž…M™æ¯È9ƒ+ãA5#ÅQ[ /Úâú4I•|6¹ÕU¦Qÿ`ä*!wÐÁs@xIîÆ„(S²{£€r}õ×[G¤‹±*ç¿zA=F»eYRzòi餻ǚà lÈI…¥–Ö¶Ò‡¨wSfÆÈ>b¨Sr&Êi1MÜ^4#öêQ°™Œ–`å>B;ë7-E›Á‹/›ž¹_!ï5U™¼R½Y&(ã`&;aQ•ÓN&&s‚õ)@î¶èoFF劉—E"õs Ìžs]çlû’{™7è[;Ṳ́8™o ÓZÁuo§  ¸+(â*G®VȬŠ(ç(U’\é=„³šÄQüàdTµ´¹ZÕ²rº]õ:Uâ`ð’©1ªëßt™š¥=.†:ÎÀ‹ƒ‰ÉþPiwÃâÇÅYäÜȤˆ]—óà•e­¯ UßþÔ‹A0¸Rb«É>4Czö€&}_e_µ¬h¯> ”Oº¸°ù‡µ»å“pK„Jµ­rò²Z æ¢ÿå^¶ž©¾ZYM•KÝ’š³&úÏÁšÕ±ô >†¨-;¯^ؤ©1`} §É’÷Õ<–0…¿ŠzꄱzØ3&FJñÝy’踮uÓcÃ+¨IÌK0¾Šúœ1n¤YVeÀºp`Ni8€–©«&UeCÙ Ó‘L—Uú‰E§ 'd‰wÇéðlQG8P…Êvlàì°·µãs®ƒ09ž£ºF¼Ô†’ò[)£¢±S…9OHSTbG2ŒVª»ªóÊ*dçJãTr)Å(»¤8úûÿrÃJV…t[]P‚à‚M9ÆÐ­«¨ëŠsÃÖ£ì¡ ³e¬]S%¾=w‘ÐËÐÈÚ{ÊRUaT‰f¦4Ä"Ü-c¨@͇²hG*MÈ!Ò£Æ fšeãrÛqv^•`÷;ªhĵ,ï_ Œ…Í¢ræ.×"lÚT Õpz¥*h%YÛÄ”c5Çÿ¡B"G/«mRêdµ0™Õ¾Q”Uù¤ë+ô‘1AJHÒàs,6m¼ri/‚CÚã¶[Ó6ΛØyù$“ïŠ?Mœˆ¥Ý%Át¯T‚U“˜,¾­ÚCƒ%i2ËX\Œ$/ã(D ãè?Y¬®§ôkÝ›Âà ¤c£MNqY^Ϫ²kÍÝT mÀÌð¾Ƚ¢ÅÙ1îÑ U2ÍíñN› á€bCb\& N^ø©•¨Æ~(¶ä* SìPg¿²“J`ÖîH/Ì®d^{X´9ãÈÇH&ËÙì"ÍSßÕÆã¶©²RrÒÓvK¾«*µßÅ{ 'EF õöĨ+‹֑¬{æh]ÑÇÞůYM½YT1§¢È:Ã@hÙ,}s8µ¿ä¸ŠRÑk3ÝËÝxfw_£änv©  ¢×g×^u+ݽ¨¹•Ýpî|Ý5lUJ«Îd¥ËÁ1éúuÉðåÞXd¢£ê›‡.Îú3î¸p5ÓÞˆ`˜ Ô%þ(g² ùôÐCd5tƒ ol(˜ˆŒ Ý’fõ[X粆ÞxÁÒà|›IŽœ$¨CqíU÷1ðuÉ$Mš3%iF*Ÿ‹¯90Yb²;YG+*ùIp¹[Y‰Äu(i:áÒuªŒøxW}…ÿüjø/>ŽyB §‡¹àSTsÆC]“%fÇ—/àÌŒ§Š=á‹â?A,-Ž[Œ]+ÑóbZá ,ctÓ}´«Q=÷õŠ{yGÃîîjNJðM<o{.S¡†¯_tÂåìwYºcÍÉä@ë±xåQòõÜÒÈàóS>Ced°íX™è¥Ð^oìúarz×—v lkú®¼bÅÍšïŠÕ7ž>¢=*Yü{kÍJI_]&Š_Ùm´ÝáĘØ6åjMÏhœôÀ{”¤XéÒ´MºÂKÕiçÉÿ#³¼ÈްÖü„™rf¯ú`µ!= Q¿æ§pç†xÂÛM>ø¢h?T©©ÊØ(Ì*ô,“óE±v„W*×Féd,úµªuke]•sÄ7r•líÝл —b/ZÃ<(ÏZ]¯qrövV6šæ+,9î’eŒq‚K£ûwÒD~æ³%M:}yc±›ËH¨^ª+Q×Âêp±¼sU¶¾O)f€ëÁ®T"¡–—y£Ñ÷„V‹dwߕ̱y$MmcXЛäÃ"Ed:iXÄ®“¡TR™QÙö¸yÉ1‹ÊsöN¨ä°®U¹HJôVµ÷ŽÜ/ik›@¦˜ó݃øxÖßÈ=Ãáʆ®ätî(“÷ nÖ‚WFãÅ’ÆìãáRâ.ªr×U~—º$”ŠHEëFºhÿ«ï©ÉËí®“†ç«˜óâ-¥â1LAq³õÒˆDÊÚ-aËj³x‚kfót§L".uù”Ý à„ÝáÒéû]ü(üS.7~›Z¬]‹¤¦ŸénäýÜ©ÝC*ÊÆ!r¿ý+¡ñ>ÎmÛ• ~õ•Ü+Ù{}pŸá•3¾Þo^&ÌC-+·Æ5êJ†%ʘiyP¿Ý³¤Ð°fìvœµX#ìý9Ö 8ØÇZE|)„ŠƒFVW”ë´$‚ïl¹*—a„PUZ©¸D¹…2T˜b¼ò&.޳Rp4å ËØíæ“!©€×¹LKÎЫgD&|^•oUÿP驿oÔè)v©¥.®® bÓ+jø¥À ’q»Mý5*]Œ%ôÞ3Щ¨î Ü=:ø7ü÷?KKU›endstream endobj 598 0 obj 5236 endobj 602 0 obj <> stream xœµ[YoÇ~'ô#äA3wÒ÷a ¶eËìX‘éF”Š”H"¼ÄC¶òëSÕgõLÏrIØD-gú¬þê««÷Ã>›ø>ÿéÿ£‹½¿¾¶û'·{lÿ%ü;Ùû°ÇCƒýôßÑÅþ—ÐHrx2yæùþÁû½Ø›ï[±oœš¸Ø?¸Øû÷àG=L£˜¬µrá—u~Ì ãFNÖq&‡¯Ç Ÿ”ÒV ?Œr2F=¼ª¿7bøbôlÖIJha ¥3“V0Å£^69Ï,3ÃOãFÃÊk:Çkì‰møðbT“sùß;ø#óÂ+•»I冯ÂÜÖC·ƒú1öóœÙá_#Ÿ¼wÊÓ^u ÿ9ø;È DCä¦4ŸŒÑƒ¸8H(ý‹•£7J±I¸ý ,Þrïc'\Küñ þx…?P6ßafÁ†¿ÅÿB‹ïðǹÅÄç8—“6 Îìû½ƒ¿ì<"Š$žÛ6#–a¾Á?â×eîvŽ^À§ôû:õ›ËuÃAþ (3yí]Ô@Ë9cípÏDk>œetÞÂHJL>ÞŒ5Ii˜Þ>”Rá{>ií¬î+ªÎs÷4¸àa À¥—Á/qp3)ɇC|­'¸G‘Ñ:ƒÏÈá?ŦJËáYgʸ6.]û¯™gíÚ¬”¸ñ0¢l L>þR üªB˜¨¢ó3ÄM&~Ú buˆ™¬áäñ¥16FvÐp„y d"-HU£³ŒŽé>8SY϶Lh#NÃe;K®\e ›å쵎FiaRäœÎ»¾Í§ds{[î2Ø„qÃÌö¶¾9¬¿â4çe O¸TÛö÷¶I›Û5Æ=^VŒã¸w(;1ïó.a§Ud‡©‘0©‘@šV"¼(KWÓÂÂF±_!Ù~4 Øúþ¸¾ÿS1ê10ÈCèô7]$&-™U —L T#„OÜ¢%¸qÕj#‚ôJ1òsÒìe¯PÒ€T¼vNÙ4! }ƒ½5(rÒ´² ‰'DܤþR8[WyÔßJ£Ó2Ï}ˆüã(%ò¯=âÔ0zת Y”H{QlÉD1€‘Ph4ñX+FÈyœ-9­<ºŠzÀ­i‹+X“ZïÂ; OÑ…ÊŒ1Ö¨¬•Bs˜µL¸3¤¥Ù:'!îÀÇ HBާý&õU„'L“Ðñe»O¯Vº»¤žˆ?VU®IÃûVAÏQ’ôÒÿEpBsN–õ)p r?,q]Td”‰g—ØFùF“mó.²ÎðnÌÆâ,yz¯a-qŒw޲e®z–±[:KG ñ°.I1®Í: *™•ˆú†--7õõQþ€;>©–¡%ëÿåV¥_*Ðj’cK«2âœxרñ¨EÔ"•OgÇçÉêÁj{hX8íP}üPà¹éxð”êQµ¶þ°… 9ð 4l;kc©µ»®»jÆÈʧú츞}|¨´+êm14ŸPÁ|€ÿCà|Û*N\¬°ô¦j\:EkDK7·IÔdµÏŠDvÙlNCögÍ{¬Ë­û&Ðý<£²çöÙ<­ãÍT2ð¯ždùx?â Õ§çõã}ýx\Û¾«OAõ•·²ã¤~¼©ý®º_—=³äÁ å] Ïpá¨ï†8.ÊÚP¤Ÿ©%.8šî`ž|zKÖ`D–q=@ßayÄW ¬–~Ì¡˜èù6TÕ¶@뾪àª`Ãç04×;€àP3lÙÞyu ÉÔ²Õt`äÊV©œx'a\m xp ËVíˆÙ©m¦qc<¨:·4FÇÝæLÏ÷q†Q ÏéñÕ-áƒ(ÖX(ˆ ¼¹G›5q+Ø_b$AÑÀg…ÀÚ>lpƒËM,½åf>u5MHA6+£«ÐĢǨ#I*(b ²» %¾fƒh£œàêY8úUÞ£Y!¿°68ïÂðÄxñfx rÀ¿çÍLOðFmŠ€Õ0ðî6-š÷Të‘×[%ËC¯¥É’‘v»Fõñâ³"Þ-n]Zé:™á\„Ì‚ôŠøšÇí€Æ_x»*£šŸ¢ú“hœxlÅ›ËkT†ó”:ew'­[u'[ÿ¡™°:Ž,§.1Óbe±a43Qd¨6ð,ÙšEàœb²xîÑ“}¿¤¬«‚q%üx„AŠrÜêù4¨S^LH°uš+¶I„]'ƒp?7‡9pKR½nùžh ]*¯oâ$¬öAÐW€/9§Yà"Z¡À)®Óþu×Ó[rJ”hÖ i²-è%û+à Ql„¼]%ª”¿p¹fJô¬>­½z˜?¢šr‰kæ´­û†5ôlfWðÃ;6ެî3ê'o’èZDˆ6ëPÊ~;Š”ï7`üC1ÌÃv±gU7ˆí!.UÈ;€ËuÔXÂËk‘c0‘îdijxßm›¥Ÿíº^Ñ]iQí†ÓUÛ—21ÛÁI6Iýmp¡¤`’ºÞv^pã¢æE6@Óz¨\ð]3cêèoÆèÍCòÓîÜ+7¼Fÿ˜Ch@MÏÏ,y¨vGpÔÜBÿ4hâLÙ¶ì £_ÝÍ4@]}vAˆk‹ËÙ!ûóoñð@­¨‘ÍI˶¸?’ç)K.ÔJìœkˆÄŒ+Îu/-Ð]Šb˜®”€Ñ£ß^êNô„Ñä§fNJ*ëwÏR`§uvÁAÒÐ3ˆ31¨¯<•?4ÑaN»–_f¾"9ؾH~±ñÌÖÉzb¡ø ÁŠÑ}$_V$W|µñq´ˆä“:‹9M µ\XŒž/i¢Ÿ)Ř˜© “ð[bâµ$Óh¢¡¢´´r[ý¾”!˱ë‚@¬oÏŸ”¿C èÈš®Š*°’‡è¹I‡cßÕÑB³/çãÇ& ¾jýßr|5³le„s˰„¨M™ªú˜rý\ C-ëçÛŠB07Ïä ¥L[ ¶…"/ãÞ¦1\Ù—µXÔÙ‘Ôñh•¡¦äÍXà (pÆ@$¢É-¢hT?^Õ@ß*™ÆfÁXCR‡3Á„}ÙB;ÊFáK•ã6Rõ˱¾d!?«Œ ¬ý(\ZX®â2;oÖ ¦€íûñs€*çƒz¬ðn@½Æß3ê«Ãž2Ì&Ë6ÕÖ¼.¥žˆÚælžŒÚä¿dÿ3í¦õ?×ý˜ä,íè~h4;þwöMƒm£æ¡¹¶wY'*FCht Eƒ¼ð„Ž:”Ûwκn!úX˜Ñ™yÎĉW$¬±ô~ÎAÆOyOv5VM#}[П(Åø²"3w±uÌc}ÇuMÌY¢s‹7sHwž]»“‡e5%úCíyŒ›½UC)3ìOd‚ÃÑk²<äÜIä*Nθ$ ™Ï;ÐB"ë°Ã–¬ë•šE͉bˆY5w›ÄW*jÏzºAʽ|,WmÖýXT¢ëTtï|† ÞM?'N-Y3°$­Ud†èTuÊܽÒïçÍ%жf‚÷>¬·9ÒŠµLŒ„U 4BÈ(Ó}°˜šŠjÓë\[‰¥”5V›Â[DXºšõ¼mv1¦›aqªçu–H›q–ßðÝ][Æ œ•E^ÆYÞ–§—¹O}ôøö<“/•¥»caüÓÒÿ6< ÉõG šL›Œ¯p ð°,Nr”LŠpi¬Û¦Ú¦Y£óí]ØbY ,cQFñá‹Fš™0êœ÷½3]HM?B0¿Ç3œQƒœŸmCq¹ãCDOµ=µ²ºôì&q™3‘§ßç9uÀSlþºÎùcyøs}øªb+Ë´ú?T–6hB|8å‚I[==‹’­¯â`#®=O½M /+éxáE‹p]þ!ÿHQ‹@¶îWɯõ"ÞaÓþQá$œZ#B˜udvÙ:äÆ#ꄾs†‚ø?ÊpIÊ/œçg± Zðý€ü}p¸wæp'ocÝY‰S ?éRâ$¾I6!â–2òáÛä)JÖè“^&U”CŸ‘@µ¹ÉV.}ÛEfvw±©µ<«#tJ1ÑÕ;^ÖUv»/JÁGÖœ*áJ’f¡àÛÖ çeI;ÖÌR`àX/ªÕB–+öBÑTí–`›`X„Lïª?.tŒ—·fðØçê–jþ=é~{ÞŽéÜʆÍÓnßA¹lÚùÕö{¥'ÓfêS.¥ÔA7°þàˆ]¦5‚Ö|FV6ÒŽ01ötéW ÄFR*|BVVà£!ZæãMdݽòjë­ª¤=ô®gÜmܦÎ1Ló¹ÌqçNE†Kµ z[Z›/u ¹ÄÎê¥ùßä÷à–£Ý­>N÷­ý8j…—Ä|kƒæeî6÷·^Ó+†ñ›Ñs@”*§ <Ä"¨§e+9êxqÌ*§Wí=¯ÞÝœ³ºRÓžOí¥]*ÞÃîtó !.Óåì@×v袻û{”Y…ÛzÅ(/âqĤ]¸é¹V¨Éƒ.'ñÎt.&±Íø ãÃW`ž\­i^§øGrWèÌ0 gf– ]LP^E§HX*“é;. ÿ竉ê¸wCç!hÜö-yY_å¬:Aï6|ºÃDÙ2ϳJ0½µËDùû;à{t¾ÕÖ~qç)w‚ˆæ¤oô¾ÝöÐ÷?¾jla“Ú ×3‰#ßÝ$.!N!ðpa‹›$ˆlbJCR¦Y0t¯pŸ[P¶ûú`ïŸð÷ÿÅ+yJendstream endobj 603 0 obj 3894 endobj 607 0 obj <> stream xœÅÙr9rŸ;øˆ~¬Ú ‹Ò-mÄ<€1Œg¸iv˜ÀæÚÛØæŠaþ}3u¦ªÔ! 6n·UR*ï³Þ-Ç-Gü‰÷ß..Ý3Ë—§‹qy~_.Þ-˜ß°Œöß.¯¬aã°2¸Ñ±åúÅ"œfK×ÚÊ®ß.u¬Wþ—÷êÉú78%=Å4œ[ÀÞ~%cœcݯ=œ³Òu—{ÞÝéWlRޭ˞ݲzV@í\5ô+cìÀ™ˆ»-g’î¾Ù‹AkxLàÞèWîrã䌰C¹îZ×mº=•1µæÿÅúŸëÙ(ºW—҅빨  ‹ÁZm ,JxÌ8Š%­  téQEå%|Œ3KàŸîNQnJÍ)œ ã4Âñ¹“äÂø„'ÙÀE·Ÿ¯ÆõCÔ¸¸ð1Aœ ÈK¡¤@üÂ0MqÄ3¹üås†þ ÅúÄu&\Ù¯çBvÊâaëùž‡t àïðÒI˜êÑyLçøõ@ÏÇbk„YÿŠ{‚(¥­Ì™•µÜé‘-G±z[Ë[y«meGû`t+‘·Hgá‘í~z†Ý|äwÞÆ|úwØ3Z¿çQ½=CçèD¬ö'ÃâNYÌçÑúÒó¡<‡¯Š9ôIzŽD3°M¤m…FšMù ÆÅ£rö$/>OJ€Q<-¾.;ßÒiñ´rò’ `Ám[L<‰fôgYù;¬Ìù†xä=‹”×=¼?š~²M¯ÔiåA#ËÛtµXü4/¾¡OÓ²U;˜_î…ò—Èé8ÉÈbƦTȲ”ÒÔ 㒦ĔÈíŸ+70p9)éÞ‡^ø5FÖò¶‹˜w#jK¯ÃXámÔD¸fOÛhQÿ‘(Íh}¬À,Ôæô47QfjdQfläµÌ80Qq»Øx v‡ZÁTÞÀÑfÏ‚´7ê~Å*PïÕx˜p¡h2ñű,eÄ`P™Qg+@ Ū"\Œ(!º¶Ú ª´Av{ì9 îÒæýÞnœöãÔ9§··"wFÂ$¸Bô²WĪ7X4JV©ªŸ¶=øpå¼Ë&±¡l¬³F"º»ëÅÝÅ»¥^#Ç%\,T <¤]‚™ŠYlÖ]Ù[\Ú»¹<;yÿ|qé%[\ú?®ÜÙ?{W—ÿXìî-ï~cAh‘KÔHÚx…Ÿ‚“æu¦ôDÞ·HË7S椧è§SÞÆhJÚHÒ1â¼B*¸¥Ý–÷ͤ 8¨õuñ›*«¥¤÷göºÎ“¢ÓâF{§uF,Ž“Èé•R«Ô#â:´œj" •|á~tiRæóñÖãrIIð ±uÔG” ý¬„æ’&ä }1Ù…ƒÔ(ëKÉfÔí®&ùô ñ|0R”µi’¶¥n^h2'x;µ(8–Å—¡¾Î †OÜlfgæ¿£IDT™#)¡R"!ªMGUfñªtFó]dóKùsTªî#AyƒäðAQü©u.„9¥0½KÙ[Òã™E=&_e R3îRöÀ¤ ÖR¾»ªO‚T”„ù^ê6¶Xu¾ìcƒà3£ ’Ö Z¸¤“È"­)ØæH¹‰!ŸÏU9%‰£–Vå$”MÁq-‹ntÙ v/9 4Œ?ÏeCŠi•Ã{.i<Y G¾fÈ‹¹bxŸ3œ6&ƒQö§f½+ t5$50’óUÇX„k‹âWï ËÏ(×3¡×ïG/ÙÈX`%À—óÑÒº§”þÄÒ £J‚Ж}¹"Á„›×ËU_–æs#7öBÓQé8@Òé­ëͪ¦¶øØlôÚiÊg¬°} QÕ°Ý7˜}Dw2@Þ–áe“©ò@5pþºAÀc%G(ÙüÂnUÚqf/”ud’¿íí•_38oéÍÂûÊùÙw{þO3Rß”¢k”–ßþ"€ÃVŒØ¨lØÜ¯÷U3Ć3Ó¤ÞÒe¢ºîRÙ„Wá 2ÝèáIèùã+FzÝó§Ç ͳ¡Ñ|Wœ8çÉ ¥Û 9” {€ç`P:Io­ø]yÒýlW nýY3jÌÙ‘+ËC§Cô¦ #ÀšŸÇ­2ìS)Øò”½[ÑÜ’8ŒÇÞÓ¸g‹Ã!_è:ñGm `%ù\EvÕAã¸„Š¨HJÚ™à,ŸÖ!˜y1çUqÞ–ÛöÒ !'Cž2ðÎol„9k˜b§qè:²Ð›ŒúJ>½Î§ý¿«Ó—xAçm~”{9ž‰§ï§É©N8–N³49Eö£Ü<ŸÂˆ Ïù nLs–ôäE™]œ{VxØ7š¯{2”œÏݪùâ"Eš|F*q:ä ?؈94Kô¢Ú<å/ó½ÿ¼Þm£÷E‹Þ“igej]ƇŸZ¤—C_%“WdòŸFff<•à>Ö\¬æ7ì_&ðFð[ŸÞ7؉æ@ö|¹¦qºç‚ÂQ©r?MÊ]&ÝñÍŠ&íeñYC)CŠÜ?´fô!mxÿÙÎೊC³9sÃÿl~ÐO\Õ†·èð­µãì9–p’¦»ÕüxªåðM•á•SÈ+g|¢€éšŒ5>ß Õ!Sš6¼æäíÒ8aÀ¬þaˆ;(Ö‰'9…'„GéëPÌ’t\ba6'Â;µt©„ÛÆÃTA™"€î²áÊzo3!鯬0 ýæ0AÓƒál>C›¾VYµ¸«‚£P^P©j0‚cØÖhþ”ø[Âs£±[âýç$ë^ŒÍLàŠ"p ß÷"]jÚiÁqßÙøÞì%ÒX×”‰™u~”fW­9±ï¶àø°¹F©NŸëÑÌs°!B´îëwcíõÿ¹ÙSmºÇ'uӺο·ÕºLMgé@PûÜ®¡=`|0­0…Àä6›Å¦¡ýxÔ§ 5«Sß’.§§dS ¾•zwñ?ˆ~Ùendstream endobj 608 0 obj 3370 endobj 612 0 obj <> stream xœ­ZYoÇ~'ü#ȃgí¸ï#@bÇ1l(J"oVhÒ:ñ(FÖ¿OUõU=Ó+’J`^MwW×ñÕÙz»‹Ü ü/ÿÿìâä«§~÷òæD쾃?/OÞžHÚ°Ëÿ;»Ø}}€MZ—%Š(w‡'é´ÜyµsÁ,Rí'?Mq¶Ó2«Å{¯'GÙû%Âôí¼—‹1Ö«éÙ¬¦?ÀŸ?ÏzqÎ8;ýµ->ž÷ªl6núqÞ[øå„ûçáà®b|+€•Ã9\/áFü£g‹›÷yu¯ÅâeŒi“Jl奧à ì+aÂt÷š°i¦³ÙÀ•R©él\´6QM¿Ô§@á=°‚S¾ï•‹µ*‰?Áº÷ÎÚé{%„-\¶‡¯A b)íP0F ÿœä5°ýMÑd»ú ŽìØ«v™Ñ~A=¦u¯Ëq¥ÍtË qïÌt=¸§ –ŽeÁäôEÛÌ4rƒ’ÜOÁ½a‘RM—œ›rqûuÞ–oP]š4×n½J· á§×…/Fò¬ª\ß¶Õó­&€ø³Ñ ¢Y¼’+É>FYÀ¦Of¹ÄL,¸CRÙ‚!èé/xJ‘#lî0¦ßãO p²OVÀ¿žQWÊ…Šjeë@LR¥2nSm_º+j-áu'9àÛ E`/òí%¨Ô •ÄÌ(ñ«µétQZ¶A‹Ù¸3á^K³Xc§ ½¯ªS2GÉ\I+ÒV»¾ÇOPcÚ·dSꎗ¸IXÒ³Ê7Í€ 4m´þRb ¾j˜îÔ_pu:wÐþˆbG´4ƒæ§Ý1ù™äž™y†LÔ¾!»Œ¡DÏêß̘˜ E°S\ï$ðˆ¢åµ K´±»qs§EA Üf‹yh.D\Î <Ȉêc¸~1C8Õ*Ôk¬*(’k ðÅV‹q5”z‰¦ÏŒÁWL)@ÀM2Þ› ­!ó“ÚÂ1fÓ½äEä–ÖÀ쇷dûŽaH Öx°»æÁúì ®FÅ»x(Ç·ñ]d_sâ@ZŒ=„f#*ò¶úF—œ2­ÀP²qCjÔJ<÷ÔÝGm=Ë[ŽY+ÃCÇhð¬ŽñœÖ];*S3Sâó©R9dÇ€˜lÿÕçXÝÁê“˰ç3ÆÈlBr—Æ¥ó¢É’í½ó<~¶Ì[kèÅó –âm¶ÐiÀeLЪ±ö™àÝé ·ÿY)hà×-p“ó™rnz:ï!pFá±­0»l0&U€ãJ:ß¶Çk ×` ieî,nfì\axG•†h¤’¡'´Mç2}¬Xái“b Gû¯(>ø½n±Q©Ôþ.Jå© ]™ ˆ‚òS.ÙpIÊz¤☸ÞöÉHz€”V ±iñ²7“’à’VßrÈ@|O¿ý)¢­¿VBtŸJäó-?‰LϽ¯|b"DdŽÓ{RÉ_”Ä]æÄèÆ {Q¥|Wõeá„ȉÍÌÙu½îuÕ[U#é¡“÷nîþõp=­*ªf¯*ªdn«_×=™³Ê[ݛ䩢L_}¦P:ëÖj¿/‹«Ž#€3ùZ•š²<õBzúϬÉGd->OºÙõTÉÑwdQ¼1&ßßdVÈâ™cYTO¹ #45l›Z§s÷73Õ×x4` ¸—Ì| àÑHAóÚç#ÞîˆÒ*‡³Ÿ§T Ei{LIN ŽÊŽ·üžkìú¤‹èŸ«˜Œ2ö­R"”B(‹”=¤“Pû¥ýŒUÒŸ¹ƒ Ž…Æ¿­´m³„ò]éÂ"B— k©†©òM-Iâ ÖœóÞ?ç©UÊÓ"º…Ó¡½¤™¿,«Ø>nŠ¥r îjiµ;xÜtBܳ[àÓR,KÒYé2¸6j Ⱥ›—ëDÁð†c°Å‡VÒ±ž’¥þr‹=ýSŠGk×z—ÖD-‡¥WŸ æZÇQ«Ê²$§Jì—Eá¦Ôfˆ*ÖÛ"N¿i,½­¥æVÅŠR p<ƒ aÍÐi_,â_ÏŠ ü¢´jJq¿h©®!+×½úP–íÊž4HÊë[±N!? ŒRjÒˆ#æÕêQÈõ2ÑÍJh¢j˜Â ˆ=ŒÕ=G¬@ži+OpíówÚº¨w{‰W…âN)+ÞáNY¥øóQæBoçˆæxÅ_£dëmV6`’çäÍHíã ’YCÜæW$7ùˆçó×ÒŒ™#]Òh$BqgÓwÕiwÐô‚G½ð„R—ßR^r›_4,ÎTlÈ{5u¸2ù¿WÊBYRJ9YÑ®Ë}ç£Ô”ü')vOlÐÌåQ ¨13'¬äklÙï*#R)ó$Ïáñs&ƒî¦Oe³Ò÷ØŒ>„°•u¦cUÏXÇùw Ô@ÅúsÄ}LSîïÐ2V´Î¦°Ÿ¢AœCYÁ¾nlŠ"°ùïcü™hýq¦°Ûž ²>ˆ3A̾Àönœ¬2ï"…$ðõIyt誸Ï.+¨F» DrƒtPy¾R±ÆÑKLX^K]¥XÝu;ÇR©Þ"¤'1ÚW8×›Y‹/­xy]çlmÇ"ÍÞ sèðyÅ|‘ôÎã/„3ŠïǨgëÍ0¥<ô‘Ä@å…:ØŒCûŒçn»:¯o¤!×ï Ãá]cˆR` ܚȄ¾J¼¿Á›Ò˜°gŒ©¬Ç)Ê ]ÓŠƒ«jOÀ,Â*¨vݸ¹éú’ì3läÅÊŽ«T¾%¬’«“1KG¦ÄMmæÿ²“6Ͱ@ʯ2IcÇfÒ¯øS (> ÀÛúgÏ–ÙD–ÅÁõN7Ãé²áÅÃ{óUz02°ã," ŠFõæmk3v”æ]¯u>ÚÒóã‘TF?µœPübS;x+"Sš1žK0Â×pÀÀçöãùˆ4ÒgœÿÅ’qï Áâø<ë}ƒ>¬áòuN˜Ñ +˜ôo$…-V%^%Ãà¿h¸ä_“*µ§¸~÷#gy—ïÑ›ÿ©Äªb¦‡ñ°ÃGþiÊÕ±kŸ±zø~õ–U"·kÑFù£g¶6åŸaáÊ·‡“¿Áÿk™Úendstream endobj 613 0 obj 2666 endobj 617 0 obj <> stream xœ]=k1 †wÿ Ö`Õ’?dmI¿h¡M¼•N)ÍtCèÿ‡êr9Šéy^á³OH>͵¾ÇÉÝìÅŸ~]òÖ'wvtüú'7 "¶ jRòãÇ-6yaßzA[ŽÉ}‚zéõk¼˜•ik±6óÆ·±÷3ЍRxBÕ^4܇wˆ„¥Tá0®Ìî:ÝÛ4[jP;…E:2å•îLeK¿AÆÖl½É}…ÈvKÓ?'g#ª†˜ÏJ“ð> stream xœíYMS7½ï¯˜£ÆÅ*úþÈ!‡`C‘8àÀ’‹,,¡¼ Ø8ɯO·4#i@,à*IQ.@ÓÓ’^¿î~šjå ÃÝßébôÍ®mN®F¬Ù„Ÿ“ѧM÷gºh¾Ÿ€“k£ÆÓLf£8™7V4ÚÊf²½'ëí˜Qm”u†üÖŽ‚KIZF½a†yrÑY½ ×-§^xåÉq 6©5'—íXZCḒ“Ö CX7æÒü:ù!âPÔ:ˇÖTIïšÉÛÑäÕ{²{)Ç9,»ÌÃE;æÔx§u9<À…¹SÆ:ܼ…SZ‘?…ñ)9GèÜxOfÍRíUšÇ!Ì9Ä ¥UÔÃÊ0Mja¸$[!bf„'ÜÚY';”ÌhSÞßÁ¡„05Æ)YÓ>ÎóÞ)K®z%%² ¤RÊ$ðÆc$SèrݳVxª…Rsë  »fÏÀÌ„06(ÜÂD©¥0¢Ô€CEǵQœfkIjfr™"g,9oV?¤k¯"g5f2 ˱§5U^ OúO^0ÛiÖVºñüs˜ódĸóoÄøº?{¾¨†Ÿãf¯cû=Æ_Áúo…ôtàÉÅZ?Õ>%ôUÐe íýÇýW…›?$¥V;ŠÿR€±„Ò)‚UšÝâ»û\xûìVÖ€§ ¯ðú"y_‘r­%\ÆåãÊëXtÆå{òy-êëšàÕoHÊͯmBIª K¥î¿µñV‡Ÿî“ЛÉègø÷7½œ©endstream endobj 623 0 obj 1379 endobj 627 0 obj <> stream xœÕ[[S·~çWìã쩳“]F3yH•mìàSÆq`]É)çÔ)ØL™ÂÅÿ>ÝÒHjÍô^XXbìbÑjZRwëSßFü9(òrPàÿö÷d¶õÞœ\oƒŸáçdëÏ­Ò Ú_“ÙàåˆJ=yS4å`|¼åF—#U­rx8žm}ÊÊ¡¶?ÕPÿoü%K:J5yS6 ŒOúÕp$sS—…Ìv†"{?†£2WJUÙØ=¥Ê^»NmD¶½²ÈëÆØu øÉá©M.Êl8Ò8ºÑÙÇa™7M­šlw(óªÒÆ´-©¥]joX`æÿ/Lª‹ì\QQUÙhŠ ¿©Ÿè²šR—Z)°iLe²·ø¼†’2Ox"¸–Èsd”P¶KU£Ä(oaŠ*ÁZR )Ú©š²0Ùû0[Õ4MÙQY˜àͰ,¤©¤öúoUŒ)Ø0e ¼‰¼(4pùr¨r)€¦“Ô&+ª¯HH$oy„yG„ƒ* Âï>a±]R˜Ò¡FÕ5#UèÁvÝ vr`Qø8ÇS\´(Ê2»Á¯?p ‘·¸„ÌþÈRj;†¨ºªì–>¨ÕºJ'÷ aTY·SºÇÀ”E^€èW¡ó"޹å&:å–< ¸Žk¢f`ïtUÀY{·5þ×''¢•·/û=Œ²}ï£ÄÇ^ìì ?޼âõ~…ÿÉŒNdöHzÇf$ÿùœ†ÎÛØ ãuQ[}^spQ7ש’£ð©Ä¶õ.Œ²ÂîF‰ol8X `päž væ8+Ÿ…ΣؙhÌwÎ(eÛÂ…c­ÃÓiÀ ¿½Ž"/8¹.¸ý>êïwm6)­=ì{aÔ»ðà¾ÒÆ•¯¸ý&<Þ…ÎKîhÚ]®¡]oRî·^x7jÏoúãìÕÀM輋—‹kßV_’€ë‚36‘¥cΦž-Ù¸Øù7çu"&™É7'®©dí8mR6p;1ŽÐÁéÅ7ìŒW‰ì--Î3औŒÐ è¦vó†ý·à@¼ »>ñ[ßÊ<áNöÙ™û;2¡zD‰üàëó¢.J'¦õu(f<{¾ÅÛýG8¬ï¾àäùÇèHI„Â’xÀ‘ýŽÉdTE¢¢DU‘ÊT@ÕX…‰‚?@§ç7Ã7Ð~d‡ÑÍQFJç5ªŽœ%L5¶!œ­k‘D®$¬Ë*@&äSd_1Ö5MY‘>TVUäBãQÁEtMHI5KÕIƒ4­Z=9ƒXiT7¿„ç×km*‘ýc¥±Ë\Ƽ§9T»»¢T&ákíÓ­4pNä—ÞdD”Øsó"(vg¸RAQò?¦-ñ|”|£¦KÂáå>w²¸NÂY„ÛŠqõ®79kkÈ!´¦9¾Mt>]¥ ú?v©ÕÍû¥ b²Õó‹Eììúõïµ_žÍëèÝá’✳s³‡…),²Ò@ÂQDã Z9T¬¬?æax‚`}ÌÈýqrŸs3vÃ7(í«µŒ##í¦Ó§·aÔn@ç*ü0}@€#œ¿­/:äs$¥.ͼÑ6j,$ŽîÇâQq¨X­líé ãpŒ"²—«*Clç¿ ]üÙ?±çKˆéß*–È{{Ê)6¦CS;Qeªì¾¾ „sL‘_åç0tNÂ<1ç8ãt<æTqœÆq#E#òÚ'¤71!½ ¦ÕO"kLv=)QZâ›pñFwNÉ‘üLGa&„p¥!Ü’ºÌWC¸,:)áuÀÕo…PÁ!ßá·—Ur‘ð[_’/-chœ—@š=Ÿ+–, ÑËÞÛeÙØä ¢³ï,E³aÚ‡@^·aœì‘CgÖ> stream xœí[ÛrÛ6}×WèQìX(//}èLã¦n.M[W™4“d2ª,»ë’X’íü}’À.ˆ%E%2ë¦i@`÷ìÁÁ’þØ÷YÐ÷ÕOùw²è}{šô/Ö=¿"/z{A^¡_þ™,úF²RÊ–ùYÐ÷ŠÖA_„‹Ó~œr&+Œ½7ƒÀùoâ‰w£§²%OqË!÷Kyù, ²¬?:“~ò†Ñ`¤¿©ÃÏòÀ|?ŠË?Ôáí@·ê°T‡™:lÔáÈÔþ˾ñÁ†,ËÒ4Î ‹:·P —P8¦jBóµ—Ê$u­–¥ÂTëòön¯M¡lÍg~Àß{C!­‘eº¿¡F„ ·hD¦ð­§K•郈‰Ø—nyÞ}³ËƧmm¼67Ï©[Îq͉fôÁÎŒo±½tÅ¥±q+_%<Øíi]qJ™õÈ<Æ8Û+S¸5ý,©Â(.Lʼn)[açêâ~”OÃ,d© ½'1®j(³Ð,B–Ü)š+d½šBÖ;à¼Wˆ@”¹ËúÍŽ;ªfÔÃшÎh¡AÀzÿdâtˆµøhôB$º& •KÖv¸ð=§Èú 㳄¯ÛÜY*tOn  çÉ@ñòÔ@g£qfV¹R™N5â*2Æ]­8p=m«j+.x´“åóxÑ6.òÕ·GžA ì\»äo}¢Tú”P×ÖjÁ©+BÀ.šak‰{[P.òîÀ!Ìn‰Šäm&Ó¤®¯M‡cû3J^ØëZ]›H©%ìý€y¾—<ëB·FŒ´¿š¥µÝZqKát†‘à¶+„‘ž(ÚÒÄ%aÛû}z =q"猪JjöÃíj6j˜ –©\’J*eFª¼òd8$IªasE±Ïå°ó2õ„ˆÉ%IîYž0! Ÿ©Ç†a+£rÆy† ~^(ëÞxaÆÂH–®<¡ûåY˜ã,rATºJžp.M»-Nc?W«º5S½ Jå Âƹ„v0$i@в$ßÉΘ…AÎͺêXö{á徕óf‚ó——‚NÊqÁRµ’)û¥Üe³/\òX]·eމqêU…9I$±!‰Ð?lþ‹Hz›V¿ªË_öšÃÊH‹E KŠ´@O“;Kó5æöž¨ËÖùÓ¿Í Ž§<ùïLóGÓês£qšõ’GÜÙÃI|ãÄmfXý‰Ê§™ŸÎ èœqšp”HF™qeÅ0fõiðšoS­48ñf7O¦~n¼‚Ê÷´Ä"‰‹ÀM~ jŠ;Ñ'ÄóݼÇÙÍŠÃRV¦¬jÃå!·ü¿Î-[1 *™Ã}”IØŸ*Í"•Pâ%“¤¹*Pç1“ŠíAíÐ/ýs&êNíŸ Ç4etP÷­ß(ü„ˆËÖßOÄ ;Vн‚½™Ä +‘ÿæ°“*æ¯[Œq:Û¬j¦±?ÖDI4ƒð È©YzïšY‰#î#¸_˜Vj¬·2 äóe|fÍc'Í3ªpBèë»7WÖ £ñ#Ò%êýG•«û«r¡‡ÒÂB¹òñ¨÷»üù’1Òendstream endobj 633 0 obj 1998 endobj 637 0 obj <> stream xœíkSÔHðû–?b?&Wn̼3÷Á*õ|{°|°Ô²x‰» <ï×_÷$3Ó “]@X<)BÒÓÓ3ýîNÆoò`Ú¿ÓÁ½e3Ü>”çð»=ø6`aØüÙ˜Ž‰q€¶´l8þ<¨g³¡áC]ÉÇÓÁûŒåÊýV¹ú8~³£³¤-,³fŽ7ûQ>…©X)²¿rž=€ß·ùˆRJëAÎdö¸*óe€Š²¨¬që”ð[À(ç¶à,[ÉG g[•­æ¬°¶’6{•‹BkeLs'”pK-ç•ýw@T•Ù\‘s®uön¹Æ@õ„^â6­ðP)@…m£Mö Ç+ø'èæÉž®Å9î9n”`6 Y!ÇÈoiJ`-!¸à )ËJ“½êUµ¬#²@àIΠhàJ(/ÿFÄÈTa†U°7^”¥‚]>Ìe!8 9ÁAlBSyEDÂy³G  {Ds%˜÷Ú'[l–ä†ÕV#+j5#Yªá´nÐvÜ\Ô[*{Š—¸hY2Ç·púÌ>dx=ÆË^vðr„—»{·ðò/'ùˆ£(+íœƒÜ @ !µý›ì>ìöf­È¾‡ñµ8i€Ç¸E)yàFÆÕ§qx€[¸€Gô¹m±Ö•z1’¨¸I±rKGž?gHó.EÒKlnGæKád Ü﨨]{·Z'¿`«xé”Ô‹SXT΢L|n»àÖS;zùËUPóKÇ:?]ô¡/˜¾Ï¼RìõœØµ:ä§¿¡çl¦¶¶wˆ E¿à$%õ» :s_2{ľw̭̃Ëù¦Uûžµm!¾IœÙE&ÚŒQM³¯‰L™ÊêmZjùÙÌÄÝ8¡®æKqQa7 h÷UyS⛚® ø-ûi ü,¥ê/ŒsûŽÐÃE£tø/µÃÉnt_í‹î·uѯYuv[ÝT]Ôë9·uÑm]”HA·uÑUÔEKPFT•g5ÎÄ—Ô.TU(©þné2/fU}Üë2/f]¨ZÜ‹Y—*K{moÊzÏÆ,µ½ðFÏ'-Îu¢ÆS®s'ö-SlìJ5“´ªhßÁë3R;^ˆGlˆü²kîè Ûõ%SÙÛ\€½K#Ü,â?øè"¿Ö•Ѥ…¨÷a„ 02¥+9V¼ŽáŒ8r<í×?۰܉ÀdCƒD9<ˆphO ¦Oë#Œ¥,`„î=;ž[ óÞ ʺ/LgBAÖ@*œè<_lqÍðÈh_lx›è)Î} iQ.ÿ¤Oâm¥*òµöŸfêÈÂÂÞ$F$NñcÅ^jÓ”H’ßI“·&‰ºïˆ Ô'ó˜ëRѬSW_ÿG gkñÐêÅmmÒ˜YK°»-ŽŒîñ…oåg¸¹´™ÍÅü{œr¼É"?wŽoDG¿Š0Ι »ç×-x±?Å'óWšä¥„Ï3øjŒä½rš¤i´¤)U—ÒU/ ³ˆu'ïÉH+ïBfǯ‹É &ö1 àés€ÞB ŠÇ%ð(;0­4½ƒ4ˆe–¸Wz”žæÄT2'y–¤ÀÀß~Õ4`5rÿŒàçP)Ý8[­ãíz> stream xœí[YsÛ6~ׯУرXxô¡3qœx𦩫í´IŠf$E‘ØýõÅ‚° –¤dˇM&´»Àî·à×nÆÝþ-þO:?¾ËºÃóNÔÝ—ÿ‡¯Xuè.þOº»Ù)f²%,¢"îÎ:åè¸+X¦y7Íy(; &÷½8ꈃWr$ÏñÈ>D˜ón?‰Â,.ŠîàDzô“ÞûðøE>Â(ŠãÞ|ý zð¼„Ç#x\Àc'èó<ƒþ½Ÿƒ¾„‹¢ìTÒ8 úL6åyÚ»6#Ûxnw¨Æ Šm¼¤Æ|L+!NB‘FR@¯;ƒV{_ÿYzµø~»®;‘iœØF9\DyXäÙ Â:}Ha5Jè¾¾{ }¢c6£ˆ^;DwÄ¥3ÜçsjÏ)æçÔÜMerá,+”`½1 ©²ÕWÔ~”£”ŽÞÃcWk°÷ ¿Âã<öLç¾B}i^P ÚÆ¹iüb/‘†rùAÄ}f;ÎÔÊE”Ðú³r+:]6u´mÜQ3œRKÄÊ×t®(•‘qù ]pÁ-¦áGPcI.½¹rÄh <Éq«kÁ‹Î@²_ÒìƒßE^õñ¨¼ÙBåÉAÅgx©À æ,c‹1æ\AЂ5‰ü’ºÄîhÀ+ç×7·xÊGýÑL,~…M‚ç3£õÙÒ±¡ŠxS V“(4OP£ÖF+`À'„Q\ú¹¡iÄo\9Bì»Òÿskök7{l®„ÙÛüƒf¸H…Ä„Ü}­}k›½t–JØìŽí‹( Ý8VD kô•ÖKrX%çì/ÖXç8*Ð}¹…îÚ ë8 E²Ý½Zó]­ò3ƒ`¹çtÃV2HØW$@ÇÎü+¼*qëÖ`Öb«Ã2ü^ˆ6$ÃþZ"™'5¹×¾‘ÚÁÆ"ÙÆ¤9)Ÿ8steFëŽx0‚ÏpLMÜÆ\Ý©¸uxµpÓ Î˜1•qË_ØVí­jWIj.ÖëŒlãjº/½ƒÖ}‘VuM¾H›³^føìm‚î"Ö½ÕTLqœ•’¥‘R„îS&?%ÀÖB‡QtpuÉŸÙãf‰¼ký{%œóÔíÒ“ÿ?lNŒrÈr V­ï[œžŸd!éÇËÓÑ#"¤0¼?É:òwé×"AM&!³’cÓéS³2QåЪœf\¨½³ßß@7Åý=Ê2pÒj„Ë9!°S ;KbðvÞW3ÄXöÀºCÖ‰PQ|B¢Éq¦kÊÍ+€mÜhV†Uc5‚1ás÷7Ðç> ã!D^Èš7¶²~4p¼8 Õ†Žc7‡ áç˜íêl×ÚçÒ”L o«üÅyÈ+nôØ`ÆžrR@qË5‹ÆóéŒÓ~ä„2iŒ[PìgÜ›}%c94T7ÌzŽ ¶Z—L jö¤Öçi†3Š!EgLéȮƖ…j(j†¸’äYÏ9eGŽ˜+ËRîzãL­ÜÒ%vîPçÖ-07¢ò½æ’ÀDdÌŽm×s{ˆ®¦ª‡B¥5}ˆ]ˆ«"S¼Œ¯W—!æúá©è†RÇ…õú(uòÇ´;üúIí•f·_±®(Îo­ë^¬ íDiC°%ñÛš>1fh¯(Ìi¥¶%Wë2³ B_Æë­¬zɯ³(dpUO*)âRnƒ ç!‹8x# £9–ÇÂ,ËÊ-X’¤¡à¢÷˜eyÁ©¹Ð}”±Á¸4ZìèÒ4K¹Z7“¦ž‚ÕÆ’i!½âÔvU &ç¼È5©8& /&Óº9:e€ŸGôy !)¡çËÉ⇡¨SIÔŸ›QênÔï­K´‹Y\w„Ò×6O)7³ã¸V?˜ÑÚt0#~gD€Üìºn[è²öSJ´îåM+ï‡ÔÑ›­ŽÈܦQG÷®l»Ÿ+Tx™tcÙC5¦1÷¬ê‘0Ôe²qàæžuËU‰~T`WvҬãÔœ mH›&gT#•t BßLãˆbŽÔö™Ž¬Á]cÌ~¹ñ‚¹Ú¼5}UÛß[ n+îXÍÛŸûÑ ¹q›­"ÄŧÏ5n®+ÕR !>{ GfgÄ#éjå>Ãu¶†!ìÉ\è–“(…Úuk:gçL&6Ú’oyìPgˆË)|;úœ²î–ã{Mì_ÊŽq9Â?õ@ ñmQŸ¡#5ÍÐNÜ}ÆßÏ¡W"m“mi׫¬zéMmQ›£ôî·Ù¾- î‹SH9”W']*5áÁRGà¶!gF$$[Û©±‚Æ wØ€5[XÁ¶Íð’b8¶ˆufŽœw‹P‡ÜÖàn<^.¯Uw7ì€óš2›­.ùrå­í i?Ðp¡j¥JiÝ«‰Ä­âûÞ>¸`'-‚­£ƒ`Ûn;>É×× ¡½»hH}=1¿N(! ÉÍ)É´îuµ†j”îßf#Ôr›m§òàc)\×ä–8‰-wîE˜¤«îÜÕ˜Æ3Ùwfz+¾z}÷r)‰ –”ÞÓVÂÇEc[×¹Tµ8`¢Ü””Eú~„2ˆ$¬ìS³cÆzW”S–¢6@//BåæT€áS^ Š?:x0išŠýd)£Ò9¬Uº)(Žû5{8@̯fŸ/Q³o/©ËÃe½¡¿­âQ}WuA¹ªÏÄV}Ny%² þqÔ^iNMÍ÷J-~uD9 aîôk [íUçë§öˆáˆ`8\kRez»ß¥ò*B'Ù-F¾ÖxÖnoß§Ê:α¥h†Ž¦îòJZ[ÒýbÐy+ÿý|Š–endstream endobj 643 0 obj 2269 endobj 647 0 obj <> stream xœí\ëoÛFÿî¿B©Ââ‘ûà’wÀMš¸7—KÜ^m8¶de×’ø¿ï ÉÝ%‡+‘š¢‰a™Zîcvæ7O.óû$‰ÓI‚?õß³«ƒ¼2“‹õA29‚ß‹ƒßҲäþsv5yrR-q‘éädqPN'FL²\Åpóäêà×(êHÀo2ÕoN¾‡Q2¥£TiQÀÈ“sèýt:“±ÉÓDFßNEô5ü¾œÎÒX)•E'ÕM‘ªèYÕ¨ˆ^A«Lâ¼0åZ°NÃ]!ŠX¤ÑëéLãèBG?MÓ¸(rUD?NeœeÚ˜úJjY.õjš æÿ?Lª“è?¸¢"Ë¢çp)2ü]íDÇH†»”¾äº™Æd&úïçðORâ M¤®%Òì %=ëK•ãŽq¿‰I²hkI)¤¨§*ÒÄD/ÜÕª¦(ÒËÜϧi ]2ؕԖÿ5‹qCJ;2Lšm"N T>™ªX è ÓIl“å—ïHv^Óó•„•>!±^R˜´BMˆµ™Ò°5™à Â'žfÑy5\ë4ºB@2ÚTLEÈÁë©4À- é½ß.•ˆ5 »@Ý"/ÊíR„â¥ý®Z1ƒ¯¦3¨2™ŠV^€ëŠŸøyã[OaŽ øãÝ,ÖJE¾V[Th‹ŽsYä律,Õ¾š%—‘¿²T`}š–âˆþ‡¿Eøy‡+ü¸ÄdHtèz/ð+î6ïq€¢<#}V¾ñÖ5^ûÆ÷®q WZA³Œþ ;GÚ‹ŠÅU×ïzÊ5Þq“þ6µ­È(€006Ÿœœ|E9òÍß•#½lÀ«èh,” iGØpáçáŽ3 ܱ͢Hö¸ÛRÞ¯·ÜíÒ/yÉѱq‡¾qEg³×®ñý4GÛ˜„²ô;T¥Ðh4•¤4OC%9˯3ǯeݯMÒ§9މ¾ñ†àÈò‹½˜ä[" ‹ ߯BƒÚ'Ú»!jðøøQ˜ÜšÇ¤çg–dG½<Þ8?¸Û7þöœðç1*%B]pJpë:6´[%¥ò#~üìF=³BÚ›T<ãˆw¹gïÅ·¤£­TVÑÒÖ ßƒ¥ÝŸå¨\H±'p”@xéF=mlîÒm.ܦ[¸ÚkµÃ;ÎØ‘F/¿Ëßâ—X1àt» Ž;Þ,ZM¼æ:nˆÀÚ—tvÁüûy|È4ç¥g;ÎÉ`bLì‚K²¤( æu^pI ÔðÜdE¼T2oÆ^6c;ÿË5³YŠT]6£uš{Ì!‡R*5y™@Ò"U—,¿’Üïè* fŠ2ãÈ‘w’HUšãHH'3Q1LÈ`ÔãS)uIÅ7@̦+òª¹”¥€€Ð¢LJÛ91Uôý+ò íò!¼]í]Hå3£| 3Êh¡;3*/™ÑKÆýþê|pùõ‰sÓßãÇ¡Wp–}†ÅÂ×MBÛЬ8µÝt«êòǩւQ-6ñJ¿àtÐyÿ‚+FEåG·;®¨6ÚiL\鲈s«Ê÷^ùNÝ„KVgç¾ëÚu-ˆ*MÁ®¬Ò<«ˆža8Èäé 4¾phd0èáWu~Óv¯£1Æ„aȼõ·h b³vÀý± ãœV0؆ÿÇ‚, wkDÔm÷TômÏr×FcÄG°Á®K¸­Å ´Ô{«g:Ù]Œ×ÎF ÁêAöŽ*…å@ªþΉe@–Œ=õÜ‚Uĺ‡0œÑOŸ¹ˆ>?g³Ç¼éˆX¿¬ÂßËJvÅôÄZû”›-Fu†(°F[þu˜ë¶]§¶ž¡×w\q ^wè”Ï”O)œ˜,fΉè6²²öˆA!ÊD’´‚˜tƸÖIÁ¬Óe]HøÙ…¯ûâªs“JŒ ǃñI&›E‚gk`"z‘@±×Î{ ×£ã&ôZ¡À£ü;Ó5 L)€D’AÕˆ%?ðÙþ‘¯,môlkg¹Ž ‘ȱò<Ô/©ÛgêMÙ2Lˆë$ÖbW¸^p[ò½4³oÉ BhOô µC§FR`¬´J£˜zÇ‘U¦[ùkd˜^i<ƒ>pdpyÜŠ“ÓÃpì‚87Ü‚Ü>N¿åL[Ói¢ÎÑZ–³¡ƒ‡fù¨Á_뀟á- _sÓžûÆ·”.8àí±Ê 6w²ñ-«wõƒ…Tã3‰K ïËë-P_S±ƒÃ5Y]Nû¹ý¨¶ýjà,¿Bĵ$X?ñÎï€TF¸ äå„;|²÷º_ ÇT9ž®RCçñõh§DI’WBòü‘Ø’o:)Ðg ¶ÜÖx¡+¨éM}ÕfAÇÉrÆÌ‘F_2¸a2‡ S´þ{Ð2>ºÊßQöVùi4ÒÎØ€Òwô `µ+EËv¥§ ˜©XôW?Â̵ÎÞOè¨ò´Cë®rÄø¶nlæ."¯(ØýÚ ?vmÛèüãô Ú'6 ­d=Â5Øœö³è#†g`Îï8Ù7j½Múx¯×ûzL§xßZ›Uà; Eî¼RCî¼u6´+û"ý1Ò'º)÷ðx2#ƒUà±¶jWÓ·pšê‰b3ã®à4`aY”ak³ƒ12ë ™»zóa0’‰õÊô¤¬ì½ôÏ[ÇzçýfûQžrÑ4Rñ5šCǬ8:|¨pÉIû°™¢°Cç]CË•õöÆ®L2¤ˆÝÃøF¨ß~wÁ䥷Þ] yvoV_'¾¹K–3c|Z_¥è3©ŠXÈðítµÀáÌfãö‡sŸ¾»iVa¾ú€Ùt–Ñ2Ä&ôønº1Ž>£‚a–|ºÄ÷!‚ÿ?àÎ_¾óÙ>!’” °S³L’ÜY%Àÿd ÍFT tU%xvrð_øù¼.¶_endstream endobj 648 0 obj 2646 endobj 652 0 obj <> stream xœíZmoÛ6þî_áÖkIIÔ€hÓ.ÝÒYçn Ö¡ðœ41RÛ‰_Úøß¤ÄãQ:YŽó²t(Š*Ò‰<ïž{áÉWÝ(Œ»‘þWþM:߿ͺg‹NÔ=PÿÏ:WØ è–F“î³3E ó(»ƒbvÜMSÙM¥Õ€Á¤óW/’SÿÕß¿¿¨™Bâ™}%¡Ý>Â,ÎóîàDMú)èóÞ@_ôågu £(Ž{ûúñ7}yßÓו¾Lõe¬/K}Ù úBfz|ïIÐOã<ç½kà1úL‘¤L{Ÿ8tÄO@ÜsÄ5ž^Þ}v¯‡@üäˆ{@¼vD7ýîÆîõuëâ–Ø0= sɲœ^| Äi ÕM&âÞhóŠc8ÚïQ/˜Dmlæ^/‹[Á¥©íÏ#2…cfÄgV»Õsæ°øIg!¦^=O´2,íÔ3€å´NKÏj„ +ºpïßp¯·Ñ/öÑy˜¤#Q;¸)j½¸±ŠÖ§µvÄ¥wÃ"MÂ(Nµ7D½…‘Œâb I.‹-˜µµ%kø°.d4Ѐ!ÿnº¶bgˆ†b0[s“êÀðïD³|f@[RGÄÀV]ð„â³v@½FuÌëÛ…º„¡Cã†,g¡´nˆ¸¯¬Cm‚>Wse#öÿЗW úsýxä°ov Ø¿ö±¿®½ÝLÛcq Àh˜mÕOækÂÞ[!QlÀ±]pLmïÛòÁaœˆÔ‚ôí‚xJ s‡ž<÷|TÄ23V 'dlšQZhÂz-VøP¹„DÏ"¤ôKj½"¤´ÌAÄ%UB8⊚£=ÊEâ~©‡f‡úS_ŽÏЪeÒŢɡìÛoõÍ¡nçP-j%ªeÎ:TõtÒ… sfÎR8ãa–ei¦dcúN´¼Q:á"Szg¦v 3©|´w®t !Tz< „º‹SáY(¸à½‹ …Œ±4Ë´l±š.3¡¶³&Š‹Ã4•º´Ôr@¥½U™R„œ‹œ)ûzƒ–Jpµi;Á§”d¥ YÊz?(fJLåÚ$vèPñ= ³[ž†‰½T=fôIM¨sW8ÔZÌ.L™¸´Ö9 v=©-(ä)âX€˜úª3ø‹ûîQŠëËøû]Éè‚éSC*–\P~zw'Ô¾PPº ‚½§«/¯Ï©¢¾®^W JÜ Þ·ÓZ=,“[lat£0Ùª@åBP¾ñÂ*¯˜f\åµÓå:±Å†Ÿ˜Ê¦ì@%Ã)Œ™PÄ)µÿøªSÒˆR«ã2¢ ¸ À:Ù —"ãVõò|³^Ì™]{ˆ§xôd¨hmã ÞI‡2¯« N©‘§P‰¹³ª_`ˆDб‹^E/µ¼ )AˆP™†)aà2&$(cð4ÍRatÕmŠ„R—ö ®¸>5 ãiƸŒ‡ó»€Q©r8PÔ 4´ÕOÊC¦°´múÍâ§_ý¦X3ã|Cúe\TÓ/KÍÂíéW¶§_sCµœ6ŸÃ Í$RÒŠ6)ª8쪚'‘íI0¹L §G¹®gQ}‰ðéráÜâ*»&P»æ¦ZQÊ â°Ol½+‘J–Ö‘ÛZUú…©1íŽÄ¹ ?zQ®äË ÀD1‹y)ÒBd ñkXn›Yš°aØN!“ëÚi˜a¨nHsH›¤â*âç÷©^@×× ^7}Fm™öTm²“ºj±å$3dôžÌƒŽý Éé¤:¬"ÏDG9ÕËýîÊ|:øêJÉ?Œ×¢iCèx0ö=!‰>’Á"kÈœÚF¥^/ºþ:Ve©ªÈ\Iìùo™m¶Gû=z}E«ÕóÖêCPù_qý¢Ë†@'°3móu’gºQTÿ.2t\}° ìƒÑR&«f.Uyœ}pÓÝŠeÎP‡ìê”…i S@ê—!ãSß];jëz8¿E=ü ô  ›öF6甓8Ï9¡FºcüÔCnI¼¦ßĽîb›b”9¨Á¬}«|žw¡hlUSŒ>35÷:ã}¿ä9òJžãö¼º¡Q@Ff§©¦†R]åcâ@|†ý¿Þ¸'û;§ø'õ 4Å¢©#¶ ãÂVгSªTΩ zø¨3Qûo-Ra–éô;‹]@’2…ê— ¨DÜÊŒF§«û.®ßúrï;¹Gf}´]ûÆ UÌziUý˜ZʾýßX¾±Œ®±…Á• _±åó:û¶ð$[‰(–ža •wçØÛáëÖ=*øµ¯àÃÛ;XËÔV-!ÒïÌwè$D¶+Û‡2U ‘t.ÕÖî-ZÿºÍ©v-¤£‚|M¹qÌxD@GË»T ýÌ€÷08† Gbyîcy†¯Tëå˜+Gü@yô «³òà.P]C»~^Ù˜šóîTyØJiê«r«¼¾ß9µß%û×®ÊJó\½P%üp±øÍâÊjÖm^;xY¸xƦJl_î´OÔgÒèC‹ P©íþèbScj7‘î•î¶ Ô›”ÿԩ檌¿´  Þ‡ÌFå·}l%›ƒ^ó¯n›/@Ssš:!uŸÝOZüÆb½ZYÜ=QUIKÙÁí1d“‰žÙxó5˜ˆü0Bþ8ÉÓÍÙzk7¶&Ú"Ÿ¾t~Uÿþ×Jéendstream endobj 653 0 obj 2055 endobj 657 0 obj <> stream xœµUYoÔ0~ϯȣƒcï¤z€8— „(ew[*ué±­Zþ=3Nb{»‘PØ(ŽýyÎoÆÞëZpY z†ï|U=Ÿ¹úl]‰ú߳꺒Q >óU½×¡DxAÖÝiÕkËÚAm½æ¸Ù­ªïL6†AÿþèÞ –’¥–<ÈP³[ ô˦UÜy);j€íâû±i%×Z[Öõ› 5ÛïAã€ÍU‚ûà¢//Ç]€ÀA²ÏMkH;ö¥‘<¯{×(n­qn˜)£¢«YãŽö¿¡Q#ØòÖ²œ‚¥ŠŽ†ÞRiª.¼AQ Ó9ëØkÚ÷øSeðEL…ù ˜s …ä±Òž2¦|…–µèK)P0˜ R8ö>轺ä#Ê’ƒFJ±˜•2#ÿÅ”6) '=Æ\ƒQî5š+@Q4§iS¶ä+ ™1¢]Œ‘ÚA l«_„8¸'û®Ñ¾ìšV S·XuG½u©>Ñ;¤a—œ !)N\R^ì˜ÑxKÃ) ç4,i¸HÒ Z®iØ„¨ô6ªô2—¼Ià*ƒ; \gð*''f¤có„-7´µÑì€ †  '…çû^dp™ÀßSáܦÙϼ=Ÿ²ž ÙÉàzÂÐIÞÎàÝ”Îq“P*)6±/‰·U÷l«|]R;¢å«Gå‹E[ÑpµY¾“MâÒ™HbÁç|*úLòbŠº_\LÐðgªÐË´Ä‹Ùä¸}7¥C,ö(‘¸ÉÝ„ìkÒš%6{æ(Cª±Š½I‹G ù˜‹¤Y.¤‰o1õÀ› ^&ð~ªøhÓˆð{™‘¢“ÏJj·¹¡À-« ‚t·[rõüÝL%6XÒÊ“¥âŒ‘ŒÓóx*À{Ù×áæ.ÎN åê6!’ŽåýOY?н?,q÷a¬qpñßjãToÓñ´†ÜïªOøüör·ðendstream endobj 658 0 obj 720 endobj 662 0 obj <> stream xœÝ[YÛF~ò#ô¶d0bؼļ¶7qÝÍN”'':F3Z벤±3þõÛwU³‹¢†’`a˜¦›}×WU_U·> ㈠cñGÿ;[¾¹-‡÷‡A<üÿ½|0Ya¨ÿ™­‡óJÕ0‰£¢HŠáx1PÙ°L†y™ÇëÁ»àU8Š£¼ÈʪÂQ% KÓ`ÆQ]ÄE\;]Z'Á1dQÔYÜ…¼,ÍsìÃQZQ0ÑS•–eRØw–ŒRóÈ¢²*™˜GžGYZWÃñσñ×ï‚_¤Œª8.ù¨¼«2Æ'³ïYRÕYᔯÃ‹ŠºÊs> ^šf¯!fVV5+taZ穚Z%¼ç×¼4O 5uQ!©‹*øŠ¿f+2läk\äE° fe]ê^«¢De[±3¬¨kÜä '•%µZmVq9Du\«åÖ+âÄ,—/&åmùãI<á(ç2ËÉ×à÷@”¯Äc+÷üÁ¿3&f‘3ñ˜Ø*¿‡á(«Ë¨®J1”¯?޼+VGu-_eGr–cÛÝ­XT]ó¿ÙÂ70Ÿ¥-4“d™Yn ù ·¥má4ºƒF{ûý¾C£G(ÜSÃßÙÂ9ï“cvn &TYKÎì#Us¥^³´ÂC£©B!è´(¢‚kÔx>x‡›ïÝ5ÆÿO{BSŸÃP¨ÿ¼.½fºsû*æ4R“±4Ês¡cznjÕc¢Á§f–JÜ¥±|UØs ªv*—{ª¾͛ڸ£ÅòNãOˆ@ÂðO˜æŒñw"â°›Q`áöTáŒóÕFéK%ÊéN÷"ìne €§Œ¿ÁÔ>µÌ c{‚ï[P•© Y*æ'Ç-g\ÄÝ9a1ýÝ:‹2]}"º„ŽÎ ô#F ð© JôI“'æ)öF™®£ÉR£ÃÈ܃àÒBЕ§´†êmß4€Ý%‰=ØøŽÔíOªÑÊ~ ³¯lá @‚ÙšßÀ˜©ýž¸ß¹òŒì·¾%Î( c€°ÁЈ:3…BR\@ØO­;ÕÂ@ô‘ÎG×o=â†f (<´Yw½îÖB¢Ð“kl}‰.(Ùo#27kÉ{áåxYâɼ,©“&äž*Ô"«£41b×¥êkÏ„4ê»W¥-öЙk.³ fE˜…/€¹¯Å£ôqSÏi¡>ÏEg×€WÞ/=CX® =m/ž=…²4¢ÜÐÐòמ˜jò$¿ži䥊?Kœ}Ö˜2Æë*0ÑÈ4S·C!Øî©³(D¶ìhƤ·XTP€[¹tWítIñÕ=Ôœº€­ &¸(ÄÒÞŸ†þ½R¥š®^ÊÃβ6ÐsYÏG‹CRrz’5È1’çüG ÿN…ejÔÔ tÈõ—Ï”°¾ƒž"0— úÁòî]ÁT+~tÄÕK†Ær(q:ËGA%·!¥SJPÏÁªÕlÅdhiŠ–"Õ10’Á)±ú#>C¸@׺T>¶…Bö¦”Sk'ŸoðÒ±äd ý1$ôw›û ٺіè)p|Qˆ ‰Ü˜‘ã? ô-¼ŽAŽ¿’þí0`]WH×%§-Š×°Ù²Ì„x÷Öƒ7%s”+i]sR ×Ýâ6œŒ:‘þn°dŒ`IïØKŸ¯(›t©>Ðä©·ÔÌh%œ;@ÅF6/£D„®•ZY5òWw'‚À¹:pª)n)ÕNÇo e‘%†ˆ¿LDwp^vlFI}EiêêðƒáO-{ov¤+Êér;J 0ç5µ:Š‚•Æÿr6UXæ×‡‹${2DÊJ6U¶èŠÙ§gœUEBx€1{å1ÏÈ;jsA KjN7àeIòþ¬Ôd¬eýìnÙöDÖ© -Å™ú˜vkâgjà϶T\´íPO“¯ºõërýQªÅè·¦õôÚìw£”emI±Ÿ0Ö6 ¹Õ‘iãê"˜æ½7y4!«=˜ºvUºéÌê2“[g¨u³*äî<èêþnÎ=ó-ä…K[ ñVž!šx}:Ä ‘öO§‘tìP]ëéꂨàÐÞ6 Š½•Lîô“ÕÖ•~˜…¨éïqÇmÜûõic‰ ÿpNŸ ±é}'ÞƒW3.ÝB’:©B’ƒš´kÁ (’5“ˆÔ +6I'„/Ö?2! Z˜#Ûtè™Íš[ p {2€6¼ËÚ¸‚ª/Ú¡bIï™U†UhXÁDï¹ãÍ.Ü|œ†‘Ž^Ù>P4ô<>,ÁwðíÅWHáB¨ñH¹qö´m#x¯G᜞SWáàí ×sK̘rqvPß8ì)+D~öþ•\BY…‘båÆîì‡ þj@|™>ÀœTíñ`y;j#Úbø ­…Xל@öñ`´Á$Çœ¡˜‹zçÂÂ]..œtŽFŽ-úÄ«{2Á62pz@ÐÛLÐé/`=º5¡¶ï© †´9:ô&“¤ïÚRh\;ÃÓÑ…ü/©F+gx‚ÞÚ]s¼}Ùöâ‹ç&HyÅù?Ùøè À½…ù•ÝšuŠ ÍQXïÜcðã t!¥c3‘M²u¤6k6µ#z2Ò+/ë¸ï@ââê% Z|†;}´gì©8º¾âæ^è°YÔH»:öQvNDÒ ì@ÊWg£ˆGkjçag‘Ÿ_JÆÃ]ìèzľ#nëÂï 7')2i+(wlŽs‹•ï¢VÛd½µê=·¦Ö¹×zœÜÓ/ŠÀÍa­¶âT”@îu›µ>E [€ÐaÐÝ¡öÿí€ÔîÏx!>‚ ¿Ú·pšl³Ùÿ‚Š7À›Pó1¼¾Òh&3wnö^o¡Ù+§ÆyH-nˆ¡R1¿Ø•Ø1ÕÍàñø9TQ&ª)Ý4ø'ŒýÆVºm,¿yÙq¾®( µ½µ…hŸHظGC®þȨnj| ›uG‘Ák8½õo¢ªUkW•RÍôqþ!úŽR)¿îª­!‹ÔââŒÃ¿°MßaÓ7ý`‡À¼ÌíÞ|6hûsX öDpU¸q¢Ø†×@æç”À` wcîÚVN\Þ¸ ÞãÅáÁ½’ þù¾¿¶…¿yé«¢‘<IÂiËɬ$ím ­;Î5¦ßzU ‹”ë'nµ]††›7îj‡Åw. …žÈ_ð¢#Ží÷×ðÝŸq‡ч¹±YͰ®OP!ÕO’àBSÊj‘§Ù35‹îäïÉ ¤kÿAçÚè„/”§ «¨&y} Ýñ|N‚Í»ëˆ*È ¹–Ùxx¿TGƲ~ò¥õÒ"‰š÷WŽF?Ùîç_48ÿ7ÝßF{;î2!Èñ¾sòãÓÒV Y•’B’·f Ïe\×ú`;R¬³Š˜ýÙÐʘµ™iþ^ÀDeòÇä|"/ðÙX¼¨d³È £¬•¢†Ì !U÷ÏRq2$Yâ9¶Eâ‘gœßŸú±YìÀU"&:¦ ƒUDØðËÓX'3§}ÓgVuË}é;ýÁ+m¤*é‰BE·™÷K0ÊŠ4 Òp½{¤öùö_!'CÞ’v­ˆF ƒüÍ%†§Î{®™h0ë¸8ubBÖÌØ}6¼ ±µl¹œ<ŸXœåËÐÅ%|äÏÇlÊ$;×ѿ"¼âáÁ5Ã+ŸÐ§}¤…è8+Ò|»_ñ¥y”q[q†~ô¡À“`à>ól Áä›[–àßLK¢$fÃ7 *~ò0çV ç6!­ÞŒÿáþ%uJœendstream endobj 663 0 obj 2896 endobj 667 0 obj <> stream xœí\ësÛ¸ÿî¿Âß"ÝX _¢Èd<4O_“\›83ÍôúÁ‘lÙIv$Ëvî¯/û–¢^i:mïætò’Ýß>±Ô·Ã8Jcý¯ýÿpzðøÃàp¼8ˆ_«ÿÆßsáýßpzøçSuS’*JTÅUrxzqPNéaQ摺x:=øG'éö;©ú/ïöÿyú«•%tTšVQQª§#uóón/‹ƒªJ:oºITUe^užuÓÎ_»½$Êóþ íœâ=/kj–—Šš©iÍóô‘º¦'O5¸,¢~^öÕTnRu•U<ˆ ó€wÝ,*Š$ss’' Š¥öãçÝ<*ËAQ‘˯ºnȉ¦•U–%÷êõŸêŸÌÎ[¦INoúMSÓ¤LJsÿÇn¯¯Ö1HÊšmyIÙÖ³|ë©¥ ’ªªÙ7RStÎôÇ­þ8× øs®žgƒNOÍœÆß;Áå,Šã$é\é?gúc¬?~ïªq¥¶¦þ8ÑzfqÅj#ªžj—…™´&ž#ñ1o‘xÄ)“Wƒ¨RB[HcØjqÄ1Ÿèu–j¦Aç\ÿŒ×?¯&öøˆï¤Ë/€ø‰§@¼Dâ%Ÿtµt³,ŠÜ)Áo´_ó¬ÔÛpÔ…ø5Â{GH•¿>ê*ÖVYUvŽ€¨ÒK‹J¯¤—dQ¿ˆÓzAšm†#ø Ë42ÃúÃü9‚d¹zR^^úk Î  ˆðN¾fK|̸‚x ‘õ~Ã[¢Ùf‘Õ[ìW¥¯9jL?©4w¸¢ R0`[9wä´Åìs¨ K¸4çÝdçU&kYríB³D}§ZFðu^+,òéZÒ‘[š; û·§¿XÖ|ÑýqœšØÆµIÑFQ­²æ–tí¶_?ç8ÇMßw O†Ü-,çÝ:‘3$jŽçU©éš3ˆ,wÇ’yjš?Æt#]ŸSÞ\+Þp±Y°7ŠÍÊú«d<Ø÷Ò’çLmœÍ»«-Lž7Ë·ä¬Æ’­„Z;ZPZ-¯)‡ŸÆáÖzT{€A}ûÒ=ÐDVK̉…¤¨-#‰­C ÓFùkÜæDþ“ áê¸:Üû5®î ]CÊHZºÄ¶:Ñ~àBªÔ!a Z]äæÄÅ› ´wìÀç–Û ßÀ,$.üðk[u»¦ŸSÁ³a©Å‹’aLhsÉLWhu\Ô³Õ>øB–Fðý~róáÚVT)uà˜–‰‰ø‚†ƒpŸC﫾W„f=³>ÁÆ ôÒÿBè-$À )6Bpu?„.°ßjG /ò<ÜØí7‚É2„ 2î6©_"‚fPYT¶qhw›î¼û½4NÏCÑ—Ë® Ìsé ÚÁ˜°›3 ì„bŽI0¶€€;χÜ+¶r¤zÔˆœõL‚³{ìPcä¼ \æêÎ5úåerʽU~²@+±‘œ‘Bƒñ°v,H|3áG58ÄÓ”{IäìÂaUL!y,€¡ ÃI¿jÉÄæŒ»\ðºdT<Þ°?…ê‹îñ aЀYÿ­=ïÜÎ)ºB¿ Ú3¸;˜$ÅΉÄN:­*®´Û C›Ðój²I¬&‹ØCCBÄŽ±+AÉç-×låh„0û#sÎ4ÀÁ`ÎÖFTˆ!ÂÎÔ ó-é}çs0—8³¦Ö‡’ä-PEŤ¹¸IŽ8¨W—¥Ó7OW]‘e«êõ$?«PÎ[¼"B©%¼ /Øáœ벌=¡(â¨Ì„<ãkç%ù)8ké{— ›äÀkóúñy½*^ b±8Æ7­Ðîů5:}/Ði9£×0x–ÏŸ×7(b>µIý™ùÿdWŒÝˆå™î¥1m…B#Ô§¹^úÚVVž>€d'/Ò½P¿Í( Ïóº7Ö$ýj·‡ÂÀh XÙK–H “® `eMÀµqóÂK¸öw¼†Ý4ï‘ø ˆïøƒ´RÊ$6ãUd&ô–©2 cn/–Òr'(ECT ípg×ö\ iEØùÐìÎwŰÆè=žyÀ4q§Z´=“P\Ìo¶…E¢cCµµxÐ{ 7W”9‚‡S1Wü¼LàÛtE®´waÚÝH|¸5Ápt«Q˜HœJD¡Zk:^„å %ipaZ-+ùXz¨h/Xìú—Ös¬gHýˆ_Ÿ£i Ç'XÏ ëeÉNé'â‰/vÆÅÂùn\®80%‡SíÓÙ¬Qxsª5ÜÌ+¸FØŠnæ#j~{”M,3è0K1¼î9¹Aj½ðPÛ45Åm¸.%6®_=k-‰‘UBC]ÏÄÅ#œ–nã3ÜÆ&6ÅÕõc¬€Iæ%ó²—N,٢ɦ0·¡ƒzÌÄ{ý-»B^d&AØóàÚ¹÷Úî`ƈŠ9üAÖ“ÈÃIÙ‹[•ŽxÔP„ÝwÆ™ŒIW7vO6ÀîéoðÎaƒÌ'–Ú’ØÖd%Ä—å‰{Ä2”r&kdê–Bï–å Ø,wÀ¹×O¾u{·eÝñ°Ë­Ü¶Gºrwéé2´ðÓLJ¨[2©º¬¥;¹­´x+tŠ ¥©²éHJކHvÃjÙîUH²Å@º¹‡Áh`ö¸YÕľ "Ň­¿Yè "|;×ígÑL3<)¶I2å`Í6PÃê=*›X%Ú¡<¾• ŧ>“Vv‰ Å ›aœð†¨—}O¯ƒ×·9CöVƒø—\§lý±â(ÕK÷ɶî¥2ÎVÎdÜ‘††<<RãÛ–×â|xú'ÀjÐ\•è¶~¢fö= ºÒý )†›;›PèP¶“@Ô+²ƒ™ÄæÍD¿CLààüŸ"r´)Ηċ»fÿFÙÞ´ô”ÛÈnHXRïÕ™zÙ²—ªÂ; ›Gb¯áús¼þ?!ñ=Oqs?¤¢¼” BˆM9 ËnŒT›% 1z­Õc®ÕKëåÿ‡£ôõË […æDâÇxCÜ’{λÔ9᳂ì‘TÈ«Éc6YªÞ0®ÌÖV9ßäÌ*4'ÂË&Znl«ß£9¹„Kgî‘Ï%›,Ö‘Å"9÷moÐwD÷†ºrÈ=¸N4ø˜N^¬m‰G°OuGLZDqJ (ÇLœ–xÓ²dú.Rø~©œÓÉY!©ELD` ƒaúÞ§Wi–»ÓyV¢¥| ò¾‘v×°'÷í)¦º©Ä1јðn= ±…¯Íá!(9ï|×wwD˜ä)h”ÀC¨â r.ÁI|ݳ¸-pk.‘¸òf&?´ð ¯‹@bŸ˜$²¾JT§Pº<'2]ºq";oœ³éÍàÐ÷_H‘WÐeO’ÑdËPe µÔkåM«T¿ÃUhB¯c;+åcW‰-ëß{HœH3ó»+ö}›—Öå‡9³Ø8@”åռƉ'mj…/‘R,ê‰ ÿÄ j–øO%öÊ üØ‘Ö.Vö¥“¶\z™ÿ-´_UÐÞqäI m˜M6bߦ+øÏú…|Ë!í oÞ{= qEê ¾îÚ±}N:,äØpé·¸rVí mµ$4,ÈæZ,JaZ=·…Vë1Cž{WMàtMzDçØñÌð‰‘þ$…I.›ÂÉ­k”‹a¤ÚÔÕÛä±,ñ Ú³¸ë¿õ†a‹Ø\»ÍÂ;ÉËÂâuñTÀ b[¤áå„Z@7û°^3«ê¾¡´¬=×(¤Q 5Êo DðHá[i Ñbˆ} Èàï]!9X£Zg‰GÌšbšà„BV‡’žyB­Z£§ö¼ee/”|þ… ;²{6Ìµß²Õ )ƒwöÓÂzÝà× Õ߬Ân+kE¯' æXfrD,H}@âgÔçý…->læ+׫¾Ÿ÷“/YpðÚÇñAÓÔ%¸C¦MûLÂÌ 3¶¯|~e"Ú eÌÌŸÐ$yö&a$ª¢n6-O¥w i×V¤öâ¶ÅÎô•pe)ˆ¿C‚ÆÿåéÁßÔ¿ÿÏè³´endstream endobj 668 0 obj 3755 endobj 672 0 obj <> stream xœí\ëÛÆÿ~…>J©¥"©#?EÛ8M‚4NchÚÅYÒÖËÔ=û×—KÃÇQT!#aYrÉÝ™ßîÍÇÖ|ä´»Ñ8ò’‰ç]ÇÙ×lP’Ã_‡xÃÖÞd÷øþpeþ{c>òo©ùøu4‡Éå$‰/‡†pe>Öð6yqöôi>‚x§ÞÄóÃ|LAÜšyøÙ÷ž§Ùà8æÄWH\ÒŠ¾Câ—tç›ìºŸäËT‹DàM6»-ïéÎ ßkI‘hää“hæe2üábþ…ˆ&‹8ŸY/²X£ÐoàÅÀ…Ìym_œiÁ#°Œ¹Y²¹Ò¤x@⎈ $ÞñŠO‰ø——† ±!µá4è YÙä.lüvdd„¹vz…Ží‹ËasŽÜÙñq8ü†¨ßÑ×9 {Ks¹Üg‚‚{Ùb_Ñ+|¢Žék@Ã<¢zŸc»˜±j”ÄÅš>"ºžÍÇ…»žíÆ/}rì1]ÁÄ $‹È|ò$i LaRŽ>WKh"7$Ñö8ô‘h8¶PµšMýhqšLÂpÊ8úLÀx$êN,T¨T&¬„WB$ð¬ÊH¼å“£aTð¶Æÿn?fÉfµ€œþL¥„I°ZXj:ŠE÷3¥,wR¸¸Â^ÓD¯4̯Ïã)q8E±ã.¨°Ùr,O–é3¼)ºúÊ¥ÌÝL1ý¾Ä]ó'‡‘¢S¤h·Â9\k®#%–Ÿ^$…v„G‹ä€|]Ú&ääk@^xÂ-XÖ|6ƺ+N½Õ=žÙ©ö¤E…”)öc¡<‰,/½ˆ†€ø"°½éJ z­DÒ°>9)!·`¤¹ÈlØ_ˆú-}}‡V¶µÓ&×ú„È9XíÕˆ¾^îzU¨ÑOšØT]c%Î š`+xÌà⩌T9Z‘¶)]sZgÊ/BG”ÍìÑü‘V[ŸKŽkO×÷Ú›vÚ¹–AhIá÷ÂÜ~×Ü©ŸµÉ¡*ØL2 Œ®ÿ y’¤ý 58åó±ÉãN;¬­èImÀzzK–R€Ï”ɺ!úÅÒòI¥ÀÝNÔÍ [GØÆ7š›ºÁÆ1ñßæ#Æ›s?_憡9@‚˜°ªRf©/)š5®Ô&%#k,¬±€E-iã#Ó¸ri$ÕPv%– ñŠÊªµæ“ÄD]ï¥×…*®» 7¹í-©Á9¦Ã]e¤en5Sà–h‚x2E‡zC ¼Ø(lVXãqs6Ïx$£G{²JPúZRèç’¾s•Á\0³þVO¨eµæ½]øÖK˜'g“1]k@¹”9n5QPÖD$Ÿ³Ô€RT|H˜dž4 ±&µ‘Ãz®•¶†_8¬a©ÂaS_u٠ƔƗê'ÛD4“¾ASsÇmue-¹Í’±ýÒŽ© î¦ô¦ŽÙ¼"o4a eöf‰trlâÑÓ2ë|Í›ž ™âɃR¥Ôë,›9ÿþÓ³SqêG¼þ'ºþ$¾&â[$¾".Α8§;AâOD|]?œ•Ëß(ÉÑÏtùoT/l²Ífò޾þH'ëñ°QÕÍ–3ñVç_%<æ…u7o7f­ƒ]—ˆ”¯r€Cú%Sw·ÂØ_jßgèoxDÌØÑKÚKÔØÊ5íEA‘&áÂPÐ dÙ=šèUÏFGy‘c|W 2‘°–ø3ÖuÇ br÷Ä£ñlu^OddA!8êàA­3ë®J£”ÃVë¬l4Nl5F³"b'ûûŠe®aWÆRïb-%/×vÃî-{ÄbÚÒXn¥G\!êŽR|( µÏ¾[DWuÕ‰¹ƒ®f­Ú>33Í‘c¡hQ7|ƒ×e@d‰oiòU¡ rª€²œîæ·±œY›`=¢S¶K5)Ø«(‚ºÉïø@|UÄMw[@¥MEDKwKý¬^#„º­Ò 1¼=äDn\X­^T 1óß/Rp7P®W'*”‡#½†½J{ˆѪA‰/ë!¼Öœj²d$q´j?SOÛ[n§´­}| …tÌx¥ínÔË¢,ô¹‰ýMìjF©–¶I¯—Tfí"üóvÜT¦®~ð ÿŸšð«‚sµ<ñ›Òù÷(KÖÎut¦ØÑ[ÎÑíj·%c|§@HuÚ­%lÊ©V©Ô^‘RºádJÃG å’Ý4N8j¹µ[ÈáгÒöÑy¶ÐD¢F)jê/'ëŒaAÕ‘bu´2 ’@½ó^pÄy’+º¼n#6Ï#Vý¢ºc¼Ñ8†¾V¬˜v>W8¯•XniW[sOI5'DÜhÄm…±ƒ2ˆÄ¶µ•-°í8©–&Èx–»ÚÝP'Ï“!E;S}ZŽª°¬öÜN± ò¹C¡HøQØ1ži ORB\VOÖöùÑ,ÊæÒA·}o:;Ò¼µîòÎÍò1Eg)‹!ú$Ú×È"ß*Æ—Gtl·a#ÀÁÒ@ÇW`y}~â(c½ÒÀ˜Ë!@–V"½ÅW ØÂHì8Óh?®T#9…ª7Éø[¼þ5]G×åNO­˜šõUÁTyȈ©_©n+yÿÛQ».íI}ªðÑF݃åî|UÀc)—…¨a«¬| Š!úWc“±†r<0Y«=lê!9¿¢®áÚL’{ÈÙl2óÐCÊHÜ¢l…dõ$§¢ðíÎ@›Œ±ï.uûV=0  $ä`UëF¬éMÝ].·Nv\ôÂú3€çÜŠÕ0£ Ðx¯b’± ” »aŠ7)ØÉaSÙítÄÞnÑÙs ž—{ìSœNPCîªôÉñ¼å¡“GSËן´hGXî#„;ê«„îÑLKäòfª0mÎÊuÝh2ØiœÙSTAýÆêÉð¦øäÿV:¾n(bÕø‘ëíy2嬂ÐZY ÒIƒÔ³[4E-9oà]Ï òÜuÏ¥«3gî=ç¦s¤Q0·öL[®Þ…~òŽwjÛÛ5g­bÈ–Cü_6¸ÏT·¶üNRyxú‹ŽB¸¹Ë+ÚÀê”;è@]‡&ÛË$q»lK?þ¢Ú) ü©<^W¾÷èSuÅ k«Sw°%~Ø7G5âKÕ<Å9 ­6-.µç­4„°Óõ,À•/4 ?k³Tc]Þpu’‚ʵR”–û þµŠVÿ±š&ÓåÒÆêCeµÇ¸¿¦ç¾+CP)—ÃñkûA§þïFý¦fy=íA¸¢¸[Hʵ_ªu,*W'iÇÝS=R ¡:mòVvùب°ªT_J«ô(;Š&Á”†D'ØÙú'$Žé¼+¦"\Äx ÓÑÈéAL³ùP[(^?«/k¦;[†Ò½;]+ùCm „ÀÆã²ý °ÜL{ݹG%„J×ñ·‹â@øJKsº¶¸¿_"QAõÞ™HUyUmTmèm‡æMð]ªb#Ðï?eèðûl~ÊP0+xÆ(èžß)¬M¾ú¨Ý¯ZF·ùUC¸·ïŸ2Ü£¶—Ûw|Ôù'P›„ö^gã$Ê“­–8§ÅõguXȯ!þ^÷Zœ\º 잤Ü*æ"5vÓî‚ï(’g_§Ôò1ì§ŒÈ@ì¤8[ôŸ„º¸Nb=ªoôøŠˆj+Õ^0Ñi>[»ïL= §Ù?ýtß)v:¡ªí¦,6×E=ØÝ/o‡ÊO¥aÀß"¢•Ôd½l£ u{Á¯©š©¾ž_ü=ûó?!Eþrendstream endobj 673 0 obj 3073 endobj 677 0 obj <> stream xœå\ÛrÛÈ}×W(O"·L, à-?øšµc¯[©JU6µE‰Ųx1IIæ~}Ìt7æ )Xr%»e æÒ}ú:=úzÜ÷üã~öñ÷ùìèçOÃãÉú¨üWõgrôõÈÏ;ÏŽ_œªN~ Z¼´Ÿúǧ—GúkÿxÇÉÀS/OgGÿîøÝ¨¨?q7úÏé;õUèó¯‚ õâD}x:V_v{¡7¦©ßùµë{iš ÒÎónÐù{·ç{ƒA4 :§Ôçµn Iç“j Õ°ù|ÙO½Ë|õq{Ñ ‰ÔPfPÕ¿ï%iØó >tC/ŽýÐŒÉfÆÃ¢5êv¢þ óª;ð’d§ìõ›®ùämÖ–¤aèw~SèªÿÂbÜ$ð¼ÓǬ5ð?Éûîö"µŽ¡Ÿh² N¶^A·žZÊÐOSM¾•¢s‘ýXÚ§Qöc£ë§^¿?ìôÔc¶þ4ìüÞÉÞM³ó¢W¨úø¾þrbÇÈÇý½Ûí Ò¡—&Ãε}57=õ‡jˆ £pw®hÎ…}©ƒ¾×W[¿°×ô5ÎPãœó-%ùjnùºÍûs´&ZÈŠV—“ÁùÞ³јOšÆÌû€Þ¿³µLë/ê+?Í—:E£Îù3n‡ƒÐ³2±„0c³ý0£)ÛŸy\™¥fø¶­Ÿéñ¥~„I†BÓúÖ¬uÀé6¢Ç3úì­,[Oo ç‡^÷Î…Ac6‡‚`/ÇCıíqcÉt–ýÓÀMï8Öè&°«s,¯-ª¡¼IÖ‹ugô¼Fk„!báˆ#X‹FÄF_TàŽ±–Í°àŒ¾t6ÛX¡‰6üs·qŠ–4ÏEÍÇð8Ñx /°€”l× r²•€‘Áe"À 0Íú®©•I’Æ–^L®(MÊàºã€ ‹ÍýXšoD ü:«ÐŒFõ@ÎßÙÆ'ÅL}®næ4=!ôJH¸‹Pj¼b4q0tX â)DÎ_ ž’S××ß>£]­Ð´,æd _Þ¥ÿ–{&Nñi¢BvŸïªÅ©õáBëÄÉÐ¥ìÄ…Ú‹„ÆR¯-§Î-ßçóý(Žv 5“…,ƒ¡’ ]$…S„Þ+¤ÐX¬1CŸCÃ,° R}3†ø˜¿wS)5¦‡|ÃÝšA)tÝ:7G™M¦–B®X¸m_Z‚hó/Ô× ™ghí1âköã‹·EËz&7WFÅúyÝ÷fÀ„2Ò1Wr¨óW«óI,ßêbŸqÕ˜;:_ÐðÌŸf*ˆ¢‰(I3–)[ñÊh6dq¡G‚’®ëgñ¥æøšZ;¶t Â×µÕn”]˜ZÅ5²]8¾H#^Þ‡±cM„~cß³,à©müLÁÈ%ÒiÂÊ›ž0FØ Kל5D "ïÆb¶T¹eå¡Um×p•íw Â7'š}„•ƒÍŠú²娕E ‘°ˆäÍS"#ñLþT€çÜ*¸¸97ZËQS:¡q+vS"ŸöTÈæJ…Í$¿  ”|èf,.ê'"@mÈ­¹á¯k}/ç9ïI2£ÓIÉ€ —Nœ*ºZðXß:*M©=Ø;Q_ØÍû$êõÖZJÐ\Ô`®í5l Ma" &°¿PvŒÌí}t^¼Z3ƒó ŒÆiø;´idM²¤ 0®ÖÊ#ÕBÈùLúÀg£$LuÚŽânJ°m\—½0¨j5&dÊÛUCbç÷I›âLmK©ˆeÚïšÐ½’käWœl )êG»«ƒ2[Ð44Á Êcu¥ºê4ÐHu›qAæóTÅ$ïΡ3JFâŒï 3o9š¡¤$¶µø2¢”~µ{”\ÂØÆÚ¦®[QtÆlçp7GìÓÞ`’ è Ùª »àƒk« >.á"…R¦¡ð°‹ŒÐGûîo’AºÕùœ^Ø^XûN‘ψ¿$Ãl¤|×äªù.]/®œ‡Á,`×iœ4¸ PÅÎê—ÃLÅÚ"Sþ¶öD¢È÷% i+ŽQæÔWºKÆA–ª„?•G.Ò+Õ‹­’zËQ°J©?SYJ+RŽ‘‘v‰d[4àšQ¶ƒËnf¨ nÓëZ[èSB)®¦(L%pßÔ*õc1÷+êù‘ÿ ãó-œ%ÚÇbJô5›é5=~r‹™Êv(®6D+ib&ß ’_ßÇŸ@|"’éQZÎŒœŠ}ÌZ[ðj>å0;³¨[ ¸g oÖXWŠ‚è®ÀÝÌ8Å38Ý3ßýpáA›Q"Íi}:qÙ%YæÄIq鄾dúK™–Âä ÐáKqØGñýÆ*’åe úî—Ú|cnBR—sò˜ÜÍA³óqüaò°¢¦  º%Û[å&€AA[NDUõ-EŒ­¥‡*¿Ý¢Š;jì~ÂzÔè~9tâÞÙY'œhâhQ6¸ûiŒ%ài?TœÐÍ<Õµ%TI]MoNv*и°ÌꢵL’›ŒÞßh@£@ŸKõéFì,—âã~/44ÊdD‡¥÷*Beü´¾Å¥Tº³µ»qñö-¾¼§f=Èa8пáF2×tøE’ÃáÎ5šŸ*\p2ámnN¯¤ÎeY”ɺ'¡%çâ©TAxý²î<ӨϳçÏÙìÚX¦ðHõéË‘ F¼nm$XEøjŸá±þÎäÝaÏ™ÔÆ%©Þvm™»ä«:%ŒWF"ûÒŸÞÿ«áý‹†÷oÞ¿kxÿ|÷÷°VŸz¾vGJR.R¯š:¼lêðÁaìUÌ%‰ ŸdoòŽùÓ3©c«Á¯È*µ~5XÚ'¤ÁOPã3dS™Úô8±ÕÃZƒs´d˜÷% µFX`®•X½Ñ¤Ï`™ 4}©FÁ†7UiZáÑßÐPòb¦tíòá¥k÷›UƦór%v¶kïB$¸„ŽøÆv Uó …âÍ.€{jM†° Æ ýà)Î!¦ÆtTB@ÿVm@—Ð4Nùâ™GXàk#mòª•Ùƒ‚ýFUd†6ÙÉQ~UZÏðTÅ«I¶FiÐz´m°N§àm ’õ:„IVî'9]ƒAN³L! íaf†‡W!H?@UÀTÚ–°WUЬ0²”4j`;Èø¾h4öGNk2q~{HÍ<§˜"&ÎÉc£÷ÄèœC)£)ÉgÊU`ä{åÂP¡Ì ‚Ôå¾9¼þS¾Z*Á k,ÙF$P0¸E´gÍÂXºü„~MqWƒ~]UÀÁeN´àôÇwá&ÀØÖ$Y ±ÙF…j<2WÍ[3w)!–ELåü*šØU#ê¶èbRöa™Í…åk“z3œ ðý±KX(â&—鈫ô®™ß"3±Ç-ì1úT«ö(í=D¸5R®óþCÖóµñãÔórÿ ÀͤH˜ý< /ãÒ5F& Ìè^•½è¼ºr%ð%¦Tñ%yÁ&òþ——°WÀÑ­$o̸a‡îqÉJÍeŽ?ÿ±-\ úRó‡ÊÃ3hø®»qåAétS øsÇUUkKOc=*yò]j9ܰ²ÚɹÀ£KHèéN(‹x‰X²Ã¯ŽRº±’ÛÊ‘|N‹s—«±§…H<ºD‘ ¾š¥.EQÅ]ã®Bm<åÜs﮵!šNIG«¢)8 ‚¸ÿE9ü©VQ$m8 Káð›GÒÌæñÆz‡Ã45–»¾Þ!ë(=6W’ý~˜Ý·nñ×YÙ»¦¥ŒTÉk31ÿîRwÏâ,B’Œ­]ªÃüº xt ÇÍ—ýY~´6}C­¢Ã½%/Ö·Œ°²4 /¸b·&zÔ9¤Ö>|4Ö¿öò•‹;*¹h¿8Kæ”mï2M3Z¹û\wýb÷bý~£dѨ¾ ¹ùIÉ`°±! þoÕ¿~06î©ß“Ò5æiî rV]<ªó‘ råkSƒ‘¶âTÎ6¢¬í=“µÒ’á¯~X!.+hí.^èesgç¼Ú…™ú Ä8ÄH*Ü”o­¶ŒÜ)ãÊÕÞìlN¨uukIɰ[Ê0yy'¼#ÎE(¹ç¯FÄ¿Faìèˆìhc™ëPºÝ$±k©zÍæÈ¬ç²Òsã£ö—½> stream xœíWKoÛ0 ¾ûWøh°çgl÷( »lðaC»Cê$^€¼j7]ü劉%J5Ó.sW8@DQ(R”Èyg~hìÓý–këí·Ì®+°?ÑoeÝY!g°»Ÿrm¿/(SQŠOÚÅÂÒ¡F±?ÉíIžø”¡X[×Nè¦ND¿™›þ,>SÉ$×%½$ ™ˆ~b3*ôÛõbgɆîÙðËõÒ ÷ ‰N)?›Þ8Šu#Yý CgÎþVl೚ 7®ë%$óIža:„ ¦h«ˆ ¦2¤ó‰ÉQ¾<Ÿ0iH¸P‰­O±Æˆ%Í(qìÔiñdjE\q£ˆ»¡óŒÝ£Ï ŠV@œI"s[ûé$ .ýbo®³»'·“J£€ïïñé·pö=Öl¸5k¸É@ßla}¥ˆ{ ®q:Qñ æ‘éÓYê»ËåŠY!gägïñ]˜=¦6¼)§K—y4Nu)ZpÝ)’8g'× ¨éæ"Äy0n©Qî°7Ää´QS¦Þëô{ Y)ÉÅ1&jÊ#¸š)äíÕ]o; r\ñø¥:w bs‰X°?%1Ûv*åY …+:SƒCº)%±£žä”§@2Å€5‡“¡ *1EàkŒh X&C;¿[˜h‰Fóì¢Ïý ´å…ƒ†¸Ò„8‹5ªjg˜YN 67À'RvÄ‚€~r•ég”üžJw ”;…•ÃY‚r‡Aí€ySÙ2Ñ㘙)úÛoûcVVÈNݲ9K›–GÌ×'¢öÒíú âïÕÒ7uïýk0âTDzLé+ãî2ÈZÈÎ7X|gZ¿d9¯â$H¼Öý =V<þõòò ¤I»å,•Hû§Ü€´µ:Il¥³³£ å¾hÎh+ÐÌ -$@6@щ#¥wÞ¦ƒÏ¯–!0·¢UóˆV?> stream xœMP¹N1 íó)“bLì\v¹ÀrI\K:Dµ+¶šbÅÿK8sÀIJ¬<¿#ÊÅ@z-ó8š«Cµçì½öÙ\ N»Œãh¯›’ ‚¶}›Y¶’-œ@—m4Ÿ}v¤Í>µ'UEܪˆ «°”|ã‡µŠ {ð"œÄí<¹7? ¤”+¹öÏÙÏhLìŠFµòzƒîº9¡Š¹@NœÕj5U~–PC™ž}„R0®ž›¤Zê‚æ@A!¹[Ÿ€¹Ù¬ïü*yìKŒè^4`¾ê‰‹/¦-éµ£„Œ<ñ?üõ¹Û¾™w­_@•Vendstream endobj 688 0 obj 242 endobj 692 0 obj <> stream xœµZYoÜ6~ß_±R‘UDR‰<hnƒ¦µ7OIì½ltgµvìüúòÐp†÷ÊôD‡œë›!åÏÃvu©4™ï}ÀDz|ˆ.›2«ŒÌ2#&²²4ÁeV{kìyaš±i®üë{t#p+çAIŠ0,ËŠáˆ×Ž[nÌ¥U† ¾äOÓ¼@®[‡t6)¿­o6ÔÂîØñ7[¶¾oa†47 3ËÒ,wçó"ÁqÚ¡«£·ÙøÀÙÁl7ú@ só~‡ª]îñ‡cþ„Nzoüø5ޝ"‹Z3€‚8 ŠªhçÑ`ƒ«¬ÂÈ~nåÕ¶é{†µšuÙQ‹Ë=°Â‰)ïé0„·šèi‡ÁºI#Á>‰iüULãËÀL ë]Œé.Æt£ Øk-%7ÔW€jî;ç1Á·}_‘õžè^:h¨L¢tXvÚ †1Ö/Ðú‡B dããgáh0º°i'Tòä}¡¡vH¼ ·E?²Ä¡È2Ò†ž]ž'ÛÄÏÀåýnEW@åž-å×ñÖO¸ÀŽ}ç:ôÉ2Qßý”x‚)lb³È 6vôª'¬{û£ (£ð„U†ŽÕ0DRAjšÑ`w.]e†àhçD˜Õ<ƒ# JûÔs=ì d…Ç_ññSê‰Û°2Ü—vªó<ƒ4s ªÐE'=Ž´êi³R´Ôù ¾Ú¿º£H¬‚ÔtPæÐI…¬¬##‡ŽÔ~€X. §Ø Õ•Öú{Ô‹—ÁtˆÅh¥wFâ3šQˆëQNªž~Æ!ÆÇäDݬЎG-nîYåëÌy/TZÛ÷CÐÅ„›½/(äyA"±õ›§ëíÛü¤>;ÿ,a˜d˨À‘â«-˾cÇÑryªÅÂÛ \·†T} ‰ñð ù¨ráoy¯Z¶ýìßÄÂ'Zï5°8#|ŠÒl D;ñ𪇣z^{¬¡!€F+oP/º/þ°š&§„>0èé)ùt\ŠªsX,§'êÉ¥6ëµÇŽ¢è;l#:ºÄSÖ’î‚cíiváÜiˇß-½õ˜¡ÆŽG¤3Š·Ï½ƒT‰7O(QÑ ž%µ%¶4nj+Æü"t‘ ¥†ÀÇ|‡„;tôć˜€7Grä+LM«§ †‡úî†*Õ]Uagßk¿Ä6ÂÓOAïmF®œ~FŽ3rßùÕ/ˆ C‹¡By#åbÿÎ&vÜ s mÈ‘ä/óþÁ4ïÚâýàME‹£÷Þg<59¬@º kÀÖ@Û4âõÁb‹oµ>NžYþâÅ‘mþ£p×O|(yÓ ‚H¹ @ è㬼ÉëŒ1¥àé¾úæÃ¥·Ûmd]á\¡E¸{¯9«šy¨š'Ì›o“ˆœÐÚί’ºÈÓ0?îüÆïB$˜×Mpׇrvp°¡H.œë¨Ð©‰¹éÅUO&ô¥¿ðïñˆ„ç6 G€Ôe¼“ú¦¡š©ÆAPÀ1‚úÝ#"&BûúÕ÷íBEnB|5G+E Æë˜¤Ë˜¤ÓÀ#BùH"\…;ÁÒá6€.zásžJtŸuLLR-D‹£E,D¢UaÜc/yôç^¾D ÂuNí46îýÄ-@ âðCM玺« yÊ¡Bãƒï¼DÊwûe%ÐÊ–OIÝïO'}jZÆ$ŒÙÕy€eeÇoü‚ä« fÁ ó&œkðôD³Ž¿×Ö6µ°v Ì{ÒÁLâúÆm,  ÀÓ=Hq8á•„p–0®Óë Ñ·ëÒûò‘—fž«KÑx_åÙWbFíÓ×3²jÙÉ"öÚçoÓ¼Æ=žw§æÿ€(¿h¯ÏxŒ{¢ÈÃ:vbò\¡)&‡uµ< ŒêHˆâ8‡áøçÅÙ÷cðËKÆé?~p^f²Ž´uÜ?ŸCg©1¹LTZš9oƃôÏÿ,ä•Ãendstream endobj 693 0 obj 1995 endobj 697 0 obj <> stream xœå[WsÛÖ~ׯÐ[€;C•’‡Œ\ãD¶sMzÆ™ä>ÐT³X$eÅùõ÷´-X‘DYbbabqêî·í”‹ý8Jöcý×ý?žî}ÿ®Ü?]îÅû/Õ¿Ó½‹½ÄØwÿ§ûO†ªP’*JTÇu²?<Ù³µ“ý2ÝïWy¤>§{IX™ú‡Åÿ†¿¨ZYÂk¥q•}Uqx¤ ? {YT–u?‡IT×U^aüö’(Ï‹2 †Tæ¹¥fy¼SÔL5kúKÕ¿H}KÓ:J“àE¨+”ý2x¥+TêOæš©Ò$a¯PÍäuÁ ¼Õ-fQšUÐî]õGU—q_ýÎÒ(®S[6JÓ´ßÇÄØn™Tª7ÅÕW¦fSǼó÷¡j#.Ô0º¦©àø`¾Û¦“J5ò,ÌÕØ²4år¤ebÙ›Wœ½=ÇßžR™Ôµes¢Ú ý(UCq^Eq,ôû±~,õc®ûã$ .õ«ù:vEòZÕˆ«à«Œôã«L [å“c\Wø]}Jµt«¾i+ñHW¨ÔKÎÆ1¦ïc>8 .€¨‘dQÑ÷†ÿá3®hÆfÐ+|c£SýúÙ}ÈëRuàʨÑYb&?ÇB†3¬ý=Î{á7;¢±®¨ÙYõ£Z'hªš‹i¬~—Á ϩ䄷Ù.Éz?—xNã]ó$ì3ÝERdM%¹O¥žf¼y&£<ŽúUœÚSͽX?×ÙuÊzì¤,š¡V4Fè…«ýU¿þHµ7Èç;O@ÉÉ2,$”®|¶¹J¢Ô.$Ëp.5ïá]›§OR{_‘x%!ká¡À9`ˆŠºj‹&mh™b¡¸Qaû ˘$…¶OH4Rð쫳>ˆM.„Ñ5032L¸8Fž>f¡X–é;ú™¯:º’šÌ9ÿ~SÕ9“d6â’m‹{Ñ2o$”ìîB¹±žwh[zƵEè£5´r’äÇkf Õ‰ÓKâô\j“É”¾ŸP¥·4õÉØ¯Ô#Ï$õÈI7ƒ9øé/ÈzãI.9ÿ-ÖúMéM|&[G#r‰&<‘ðÆ&ŒÖDˆFh–Å}Îr –ÚÖ>—†yº„ªsÏ´„¹¦yë7©òXbí¼KO¢ð¢Á›Œ¥á‘d‘TVK7Ëk%^Èa\ó¹ÊŽ==f¨ï¹*=†®I°è,ÎQƈÑ)GÀ”žÝa¥ÿ⦠<‚¹»9àó Š‹Bÿ $;ñ¹0"ˆä;ü>¤ï/ø–ˆïøšˆ cþ >‘Å$†\m}]-» ÅäR <ÇB Úé¤=âÝ£”[ˆÏÅ^K6ÿéwu½Üûµªov×z%5Š2Ç*`ûT†' GÝ ïžÞAÉÏëg¼’vDÉöfqqrAÕ¯wF‹eSÇø`)uAò’ÏÙ˜Ò¢ˆR°¤3M‚Qý©aTMåFܾM­ÿéÝâJjóT".È2|‘ 6‘€ñ2qL~‘O—`3áV&ó’â4ðiÀúÚTk§¶ž >GÂ*õìΙ˜¿m%›m¾']ÝÔýþJ?ôò¤^ru¥ íƒá½ :75 [UÚuroôû›ˆ¦-= xyYhÇqÜ•nenÙ}Ì-s±Ã·\ðƒ¿ú×*IŽaEFQ\›‹uÄ7\Ì‚¾–¤$®Ý­$¢g7YRÁ¶ÝV;êWušÊúüó®òךj¶ ÌfAðž[.£Ì¢¸RfëÈÝæùò±Î³•Û›yvNâŒù}Ö˜<Ñ¡~}¦ƒ­%q[1],5šáppn¨èΗqE@ÝÜŒœpÉ~½"Û ‘™Uû‚Ù ¦ÌbˆLÛiXI%ÅŶDp%õyÄ'Ä3ŠÀoÅ_è‰åË,ú8@â"zÖ¾ú^“ЩUw’š©bâ9³-àooÓˆî„DGa›x»$‡ &ÀÒ„ŸrÌ0Ö€D×ñºdá'›iJnHɶ-ÔZ »k„F`³ÆŽÏE‰™a‡k ’yüŽmüæLÓ¶ZƒX€ou“APÈ »Ùèšçס,_4X<ìr6tú5 ‘Èù4xì²XžHbJb!×ôaÄ’í¶XÞ á€J}d5 oôh…‘ß«0hßlb™·ioêA…ÅB mûÚ¥N×­wF%ð˜|¸¯2vÜ;K6wÄl!96b·µ“d˶²Ä%FÑë½å%u{Hq¥<ß‘üû[I‚ÿÚ˜9 ï}¡á‚©4YÚwҢѿþ˜,ô—8¾EDNæ•Ê£0ý¥— ADþí‚@ÒΛ®f9Ü™ÀI[ú0|˜üF§ÃZ ©ÏçB«Ï6? bˆ‡¦ÆÕ©ÆHÚrš x½Jò 5vò¿‰_âFÓ±Èyq[aA¬»]šÙºÄƶŸÄ…TqeˆŽ·þn7º¦W@õTkݶ‹â+™þ©÷ æRÙõ§ñ Nú¶©šFh…ç$Ÿ+Dœ€ô¬¸dá«x“nå7'}o[ußþ·ò`ÙþÓA•Ï’J¥æO$¢çíU”â–Ö„U ¢qh–¥‘ð”i”怆[_C2ÒJLÎ;ð1 Õ|P{H³ý_mZ4ézÑgn™N´/íl:-/z»©„”‰Ô¦·ÔíÖO×—{â]k ÅÛŠ‹õó¯TÌÈ|‹V$ #Áqèb{|˜ø7¢Zr(x£VYÿtÚ1Õ×9]yèg]*¸¡ŽF?k®ŽY_‡7^‰y._ º®ÚÆí¦ºì_éq&ïÚuÄ’¹ o—v&Ò"êüæ‘/Y>_bkC”Mú¦±a.F„]õºrf Qæ³*Ë6pÙ€KYI–¨h`åa²Û‚šèä~ŠE ¦þö@ƒŽÞžÉÑ7ÈkËk‚=k_á`줻4âVî€TùÛEå†Qé}3ŠN×™8~@ŒÚâ½”"ôs.½ßcÏ*²sä·»‹@“6óõâ@²= š×ž¤!boCéYl÷ë·º8×v7ˆÚu–àÂ9Á%#&JÓ°<Ë!ë×j¢öܵ¾,ê£I¨ÈÄž¸Ÿ÷þ«þþ‡G‰¦endstream endobj 698 0 obj 2542 endobj 702 0 obj <> stream xœíZYoÉ~ׯà#¹'3œƒ3‚…ìhm%¾V¦‚ì ÒDH‰KRöÊ¿>}UWÕt g(Ê»0¦¤fõUõÕWÕÕý[/Ž’^¬ÿ¹ŸW«“¿^Œ{óíIÜ{¡þÏO~;IŒ@Ïý¸ZõžM”P2R-QWIo2;±½“^>J£¢ìe)Éêä?ýd÷Sõ_ýüuòOÕ3+iÏa–'ºË0£qRU½Éµê4 Ó~®?²Á0‰³2Š“þKý÷þ˜êkõÅq’ضÍ`˜Ç•j÷gúï…þXºóM’ÛŽ:N>ŠUŸ²¥ÿ¾ GQU•eÑ¿õ£ï°qê’äÖLDÄñ†Øxé—Ò$Øç¿ƒaV£ªÌÍBmã'©ÏFj¼ÂÆÓZÐg ÚVIåE¬ìøêdò5JŽFù‡·Ç4êt-XÁéºÝ ©ÙûaªÏªÒŒñmÕG¿ÎÓDý^0åWª~hÜÐî°Ï¾qŠ’Kßx7T ®Q›Ï۬РÚìÞ+ØX‚©ÁØiçÌaÌ£Lºö}Œõ¶t3y\ª© >Á@Ie'^ò'\÷[ßx¯]§r¬µêêÁ7~ÁF4 òµ3Z•¦K˜w·“L%Âp¾Ç#ÉÞ ¼£:üϽˆq¡¯{¬••…Ù¥V²Öoj4[Wª1OFXs*‘‚Øø€kj€*RÒS`½P))*…QUÊÜï} &µˆ²äs®?^3·4, €,ÅhÔhÀ„Ëä€1ZR¶„ó齯Qbb˜%ÌTÏלï°m¾ôÛü€Þd`a0´âˆ€@˜öÿ{Éɲož7A˰ï˜X\ -·Àí™ÞO®¶^ ó=K™ÙKà7’RwÒê6h‰kr«_ÐÆ¶áCI·¦,-­þ-´/Ú®iGe¦2“œëϰӌm”íD“iNÈ™rÇWûÉÐM:ôQXÏ"t‚¬±dØí­‰Ÿ·ï¼àa‡–ž¡¥7’Q%BÄ‘õé{‡"¨*ÿ}…`ã/¦*¥¡,­ÊÐíHòˆ)ÊŽ»ÑÄÚ}nçŸ ð¥2JùLC¤ ‰õy;7—”„Ð$pøL»ëdr&I1—üo¤™EjFÉkŽ€ÝV¾ñRòãMÝ 4]D3‡šÁ±6Dð2ÌDXöh$!…ùè‹°dB;¥SÄãSZ5ÌSR8uQôF—ˆ¢G?´pà÷É3«2¦“OŽ‹¨ôyRE3ºsüu‚¼ö1:9p¹‡õœM8~lTÝzœùdÖÁ%\†*çÖ7~6üÂCñFDïæî ˉ™xl!¸‰Cæ5šãé|GZqPÛ•K šò<šv,t~–b°0 ,rÍûå‹×=´ðJjäY ä7ÿžs¤FTÄ%À¢”¨J†š©‰Zªï3d}›âdý<VY‚Ûì^:iÚ›p’s“UQQ&€¦+,XY9†¬N˜á’“)ÈnHxã>ÞM·nßÐï›KÉÒs =hi~ú~Ôéœd9}îÚWº_)Ó”™ÒNÈt@fò­ì©@ÖÈÉà˜‚Å©þû½þx>pÅ+}Žu ±—0,9óXWzTŰ)†ayJÁ Õ^Ç&l »lø½y8†úuƒ$FݰÝ!þ²L@ØÁ¡ÒÔ•Ñc¡rɳ*¦LÉNÑ€Á·‹ëôíÁ‚‡ž?, ÉÐBä‰+‚!x‘’Ìg Z¶"· ³^ˆÂ°|~Ía†WN·aÔËIñš›ß%E#%mÑ⟤°³•΂wL}ðý¥4;b¤Ú¹\  ¾;ÔÛQýãï3w‚éè•äÀ |r’“|Ñe9G Am Cû’÷©a8 õ:ðÚ’8­½ÿIŠ+$.,ÙêêN+&榆$œ‡Ugˆ¼5Üp²@g¿öî»’”Çn{C•±›Y¢p0-~/ºçñåmt:©"=ð¼ ɪv™ºC¬½ÌïÜG—(ÓÙ$ ª?È€¿©KÖî75¢$¹-^JÓsý¸‘bt “ƒJ.á鲩Ô=ðd踇­gUÑg–\Ÿâò^ùÑϤ1á_Ì•Þc÷ç¾Q“\!‰¤‹V^JžIüqާ¸µdeÑßD6h¨U@¬ÿ»Mc1S=úêyêýqážïíë„$ìh°ƒ¿Ñ,nUº‰Î—šÞè¿ÍSs™þÑúBÿyá¿ý ?Þˆ>õ“*y¦~¢ÁæKò"SšaªYYtkƺp‰2“º£¤XÛZH³ßbM7X#{Ÿ46ñAæøÔÍ®ò©ºO½/œÝ1Úÿ› ¿ö"æ·gþOÝ—ùóÉEÕ𔙌Jê¢<ëbðƒÇ}ü;(Œ|a« Oþ¨ž&€JÌ–w(RÔs·7}ïíêÂj¨bTŒ4îÄûˆ;EÄÜÌu!:8Bš˜àžÂ–^]ÈíþÜX¼y_5¥¶žÆ`'£I¾Ø¸ Zmrd€[åQFÞªR£ëHR¿Í_wˆ×ì‘BÀÓd Ç[Ã>ÔÇÄ‹59Šñg€ý²ÿ#¶Ö¼çlrò³ú÷?eŸ-Êendstream endobj 703 0 obj 2536 endobj 707 0 obj <> stream xœíZYoÛF~÷¯Ð#UT,ÉåÙ·¤IÓ#hÒD 4EàH²­F¶lIv“ß½gfw(ɶÜ…c„¦—{Ì~óͱÇÕ KóA¦~ìïÉùÑ7ošÁéú(¼ÿO®Žr]a`MÎODzR^È’´Ëº|0>92­óAS ê¶LåÇñùÑïI>¬!ÿÃêñO²•Èq«"ëÒ¦– ÇSYù»áH¤MÓuyòÃ0O»®-»äɰH^GyZ–US$c¨óܔвMÞÈR!»Õãɱ’T~+Š.-òäû¡jÐÔMò£jÐÊÂvÓy™¼Ž*ÙMÙU¸Â+Õ£H ѺqÔèrœ,m»¬Éjù.Š4ë S7-Š¢®½ ™ï·É[9š„DŽ%älº þn(ûÈ*)æ[ÕR7°8èï¦ë¼•<–R6QX ;HÑäÞ²ÅðŽ,¾#)R“wYÈ>“Ú>ª¼“@‹äõ÷ õx­Ô¸Y–k”…ž–y¨Ò‘™µ©üÜW–½4"oÓ,ON|ár8*”2Û:¹ô…3(¼ð…ï(}?ŽÊ®‘•¨¯c¨0÷… (œùÂ)~-§™µi×6É„ë ¸€Â¥/ܨæ|oPá%7¦l^™®¹!ßÝë¹y-%«PH~$ÕêÎÕ¬UP  ¥þ2«ÓºuÖêo#ûq”‹´ª³"¤B³/^YäYÎÝI3Õ€!°¤Ð•Èå{TIÄG´ÐXKê³]O8V]s57¸Oû¶ê!ŠWyÜ7‹ ¥IWh;¬êÏ„õH“h*ªYTÝ)Q Ò[ÕµƒñË£ñWXsíš{ªþ|¢ϼ?ñ6-[´¢)•Õ~äìÃêó˜ÃñÔ^šo3sPÍÔ}ɼÆ5·Úx 6þŽktÍu¼C&øÅùg­ ƒ†.ˆ¤XYmXÚ|'G]ካyŒ%UÊ`áZm‡kŽŒµ h¾ä ShþÖž±&qM0¦(î¼é†ãËÂÎÙv¦ÒXS4i®³ ãªJ5ýL=r6ÔÌÕ(ºó€X±ršô"óÁ”Ñ32”miT”72hU·: KÿÂF€ò¦Ç`0¾Ö¿(áºßß¾O{ tÝN¸îUÍ4*lbµÂØÄNcÓ#V´tym…£1A¥WQUiáÒ‹k qP ¢Þ †ZGum×lÎٵ›¸Š:[`\ñaœì”µ· 2Øìóf{´»&C;¿B‰gó5;ô!I‡ÂË:MµZ®³JÇ5rïN;—hˆvF@Å»R¸à¼À;EC¬ ÷ðH ¼¸˜8ZšŠ73KZÏ ¯˜+UŒô¹äà'–î†[s5A¥s޳§ÐœR_|á_œH+¢ü]ï!œ¬)tù´va*Auûº­ Oç&ð•ÑÝÌó`ê µuZdC:Ž8#^r³„&œI.`­s8ýÝÉÙ€Lk6ÊõÍ“Yü’™º8%| Z8Iv¹TTgúTÖ0̈þ8S=Úû½íÝ©~0g]ù­˜‡´I ¾~ÔÝÁt7åÌÖÞ95Í@ÐKnx~ÏÍyÍXýŒšºT—r<œ/hþÅœs‡íøÈƒwBϸš+®¦YÑ2‚æö÷!l_t@)ÍOïŸX}Ç~¡}ÔãCéñp®žµÖX—Ý£.Z—÷wýQ‚.ÉÆC_ KÌõ³ž?·Ts,ûè3 t~ðÉ‘I_wqz±¢U„1‘,¬mtTí ³›S†ÄFrûpÒk^/üc†ù`eZ€ Ú”¦y|Ä£éi©äGOñÖDœLHz¤Z8M Úr9 $ ‹óXñ@ g„CqŸhùr°ý6~!gr ²äÙS)EÚIÚÉPì>õ'¨?Æxh@53/îeãA[u¡ˆ7³Nw±5dz:R€“7íN<•—ÖðÜÆ6ÐðšSd¯S”ŒžsêfÉÈ®Ê瘱8Ç[ØÂ/ÜèÛÜÁþ{ëaÌÓ¥á™(ÒÊûäàØÅ~ìÓ´¸]0†µ–¾ˆ º‡µÄ9¯yMc}F(Ø-"³·÷2ð”åí&píešÐ:MlŠ—²lí;ï>ŸhË«âÖ>óq‚aWŽÕ ¶·\\s5]Ò»ö—³qG}'U"ˆ…km/ܽ1 uĆÏTo Ý¥‡î.g·ìù{Éa}7|‚K€Ox®ò™0Eÿ€ÎnËÄ…·©ÿB¯Y¼ã‚æqÃñyZö˜ŸäŪ?vƒMHXqx §ñ&IŸkær0¸FˆcÊ;oT–ï¸Æ¸M«Çu `/8Ä`†Ô—ðGEÛÖ9P“¯ É„ÐñSLë'²ßΊAEî:ΩÍ3´D¤øY÷‰¯è³dTmÚí:§_sx‘[2Î#²‡!KYÔ=ëFÙÍÑsÜ}/5«‹›~hgÞyñ#£¬ »]f®/Ž4·¸Ó—zÇw ÚgÞF6*¶…‘| <[:«7(^Rx7”¹‘3£‹qK¸]Ô¥Wû,!Ù´ãÆäŠz§½½f¸«á(¾b2ñœ ±kÕÜë­"`ÿÿ42p§œ¸RË×¾•$½äÅ"ú'‡(»´W¤Ç¹.Zì0û»¢<Áâ´aJ,4ö‹ì‚z)Í»"n¢>?sxQîVÇK½i6@yËuO˜+ÞéHù}=ÛÖ½»g/W^ˆ™$GawJb9@âØÉÆ(ÖCt ò¢Kç&Ѿ=Çok8Çÿâk‡ äû`ê³×g”BôãlXþƒ~€¢‰b>d™W͹Ç®A˜ÍŒÿ> /Contents 5 0 R >> endobj 16 0 obj <> /Contents 17 0 R >> endobj 21 0 obj <> /Contents 22 0 R >> endobj 28 0 obj <> /Contents 29 0 R >> endobj 35 0 obj <> /Contents 36 0 R >> endobj 40 0 obj <> /Contents 41 0 R >> endobj 45 0 obj <> /Contents 46 0 R >> endobj 52 0 obj <> /Contents 53 0 R >> endobj 57 0 obj <> /Contents 58 0 R >> endobj 62 0 obj <> /Contents 63 0 R >> endobj 67 0 obj <> /Contents 68 0 R >> endobj 72 0 obj <> /Contents 73 0 R >> endobj 77 0 obj <> /Contents 78 0 R >> endobj 82 0 obj <> /Contents 83 0 R >> endobj 87 0 obj <> /Contents 88 0 R >> endobj 92 0 obj <> /Contents 93 0 R >> endobj 97 0 obj <> /Contents 98 0 R >> endobj 102 0 obj <> /Contents 103 0 R >> endobj 107 0 obj <> /Contents 108 0 R >> endobj 114 0 obj <> /Contents 115 0 R >> endobj 119 0 obj <> /Contents 120 0 R >> endobj 124 0 obj <> /Contents 125 0 R >> endobj 129 0 obj <> /Contents 130 0 R >> endobj 134 0 obj <> /Contents 135 0 R >> endobj 139 0 obj <> /Contents 140 0 R >> endobj 144 0 obj <> /Contents 145 0 R >> endobj 149 0 obj <> /Contents 150 0 R >> endobj 154 0 obj <> /Contents 155 0 R >> endobj 159 0 obj <> /Contents 160 0 R >> endobj 164 0 obj <> /Contents 165 0 R >> endobj 169 0 obj <> /Contents 170 0 R >> endobj 174 0 obj <> /Contents 175 0 R >> endobj 179 0 obj <> /Contents 180 0 R >> endobj 184 0 obj <> /Contents 185 0 R >> endobj 189 0 obj <> /Contents 190 0 R >> endobj 196 0 obj <> /Contents 197 0 R >> endobj 201 0 obj <> /Contents 202 0 R >> endobj 206 0 obj <> /Contents 207 0 R >> endobj 211 0 obj <> /Contents 212 0 R >> endobj 216 0 obj <> /Contents 217 0 R >> endobj 221 0 obj <> /Contents 222 0 R >> endobj 226 0 obj <> /Contents 227 0 R >> endobj 231 0 obj <> /Contents 232 0 R >> endobj 236 0 obj <> /Contents 237 0 R >> endobj 241 0 obj <> /Contents 242 0 R >> endobj 246 0 obj <> /Contents 247 0 R >> endobj 251 0 obj <> /Contents 252 0 R >> endobj 256 0 obj <> /Contents 257 0 R >> endobj 261 0 obj <> /Contents 262 0 R >> endobj 266 0 obj <> /Contents 267 0 R >> endobj 271 0 obj <> /Contents 272 0 R >> endobj 276 0 obj <> /Contents 277 0 R >> endobj 281 0 obj <> /Contents 282 0 R >> endobj 286 0 obj <> /Contents 287 0 R >> endobj 291 0 obj <> /Contents 292 0 R >> endobj 296 0 obj <> /Contents 297 0 R >> endobj 301 0 obj <> /Contents 302 0 R >> endobj 306 0 obj <> /Contents 307 0 R >> endobj 311 0 obj <> /Contents 312 0 R >> endobj 316 0 obj <> /Contents 317 0 R >> endobj 321 0 obj <> /Contents 322 0 R >> endobj 326 0 obj <> /Contents 327 0 R >> endobj 331 0 obj <> /Contents 332 0 R >> endobj 336 0 obj <> /Contents 337 0 R >> endobj 341 0 obj <> /Contents 342 0 R >> endobj 346 0 obj <> /Contents 347 0 R >> endobj 351 0 obj <> /Contents 352 0 R >> endobj 356 0 obj <> /Contents 357 0 R >> endobj 361 0 obj <> /Contents 362 0 R >> endobj 366 0 obj <> /Contents 367 0 R >> endobj 371 0 obj <> /Contents 372 0 R >> endobj 376 0 obj <> /Contents 377 0 R >> endobj 381 0 obj <> /Contents 382 0 R >> endobj 386 0 obj <> /Contents 387 0 R >> endobj 391 0 obj <> /Contents 392 0 R >> endobj 396 0 obj <> /Contents 397 0 R >> endobj 401 0 obj <> /Contents 402 0 R >> endobj 406 0 obj <> /Contents 407 0 R >> endobj 411 0 obj <> /Contents 412 0 R >> endobj 416 0 obj <> /Contents 417 0 R >> endobj 421 0 obj <> /Contents 422 0 R >> endobj 426 0 obj <> /Contents 427 0 R >> endobj 431 0 obj <> /Contents 432 0 R >> endobj 436 0 obj <> /Contents 437 0 R >> endobj 441 0 obj <> /Contents 442 0 R >> endobj 446 0 obj <> /Contents 447 0 R >> endobj 451 0 obj <> /Contents 452 0 R >> endobj 456 0 obj <> /Contents 457 0 R >> endobj 461 0 obj <> /Contents 462 0 R >> endobj 466 0 obj <> /Contents 467 0 R >> endobj 471 0 obj <> /Contents 472 0 R >> endobj 476 0 obj <> /Contents 477 0 R >> endobj 481 0 obj <> /Contents 482 0 R >> endobj 486 0 obj <> /Contents 487 0 R >> endobj 491 0 obj <> /Contents 492 0 R >> endobj 496 0 obj <> /Contents 497 0 R >> endobj 501 0 obj <> /Contents 502 0 R >> endobj 506 0 obj <> /Contents 507 0 R >> endobj 511 0 obj <> /Contents 512 0 R >> endobj 516 0 obj <> /Contents 517 0 R >> endobj 521 0 obj <> /Contents 522 0 R >> endobj 526 0 obj <> /Contents 527 0 R >> endobj 531 0 obj <> /Contents 532 0 R >> endobj 536 0 obj <> /Contents 537 0 R >> endobj 541 0 obj <> /Contents 542 0 R >> endobj 546 0 obj <> /Contents 547 0 R >> endobj 551 0 obj <> /Contents 552 0 R >> endobj 556 0 obj <> /Contents 557 0 R >> endobj 561 0 obj <> /Contents 562 0 R >> endobj 566 0 obj <> /Contents 567 0 R >> endobj 571 0 obj <> /Contents 572 0 R >> endobj 576 0 obj <> /Contents 577 0 R >> endobj 581 0 obj <> /Contents 582 0 R >> endobj 586 0 obj <> /Contents 587 0 R >> endobj 591 0 obj <> /Contents 592 0 R >> endobj 596 0 obj <> /Contents 597 0 R >> endobj 601 0 obj <> /Contents 602 0 R >> endobj 606 0 obj <> /Contents 607 0 R >> endobj 611 0 obj <> /Contents 612 0 R >> endobj 616 0 obj <> /Contents 617 0 R >> endobj 621 0 obj <> /Contents 622 0 R >> endobj 626 0 obj <> /Contents 627 0 R >> endobj 631 0 obj <> /Contents 632 0 R >> endobj 636 0 obj <> /Contents 637 0 R >> endobj 641 0 obj <> /Contents 642 0 R >> endobj 646 0 obj <> /Contents 647 0 R >> endobj 651 0 obj <> /Contents 652 0 R >> endobj 656 0 obj <> /Contents 657 0 R >> endobj 661 0 obj <> /Contents 662 0 R >> endobj 666 0 obj <> /Contents 667 0 R >> endobj 671 0 obj <> /Contents 672 0 R >> endobj 676 0 obj <> /Contents 677 0 R >> endobj 681 0 obj <> /Contents 682 0 R >> endobj 686 0 obj <> /Contents 687 0 R >> endobj 691 0 obj <> /Contents 692 0 R >> endobj 696 0 obj <> /Contents 697 0 R >> endobj 701 0 obj <> /Contents 702 0 R >> endobj 706 0 obj <> /Contents 707 0 R >> endobj 3 0 obj << /Type /Pages /Kids [ 4 0 R 16 0 R 21 0 R 28 0 R 35 0 R 40 0 R 45 0 R 52 0 R 57 0 R 62 0 R 67 0 R 72 0 R 77 0 R 82 0 R 87 0 R 92 0 R 97 0 R 102 0 R 107 0 R 114 0 R 119 0 R 124 0 R 129 0 R 134 0 R 139 0 R 144 0 R 149 0 R 154 0 R 159 0 R 164 0 R 169 0 R 174 0 R 179 0 R 184 0 R 189 0 R 196 0 R 201 0 R 206 0 R 211 0 R 216 0 R 221 0 R 226 0 R 231 0 R 236 0 R 241 0 R 246 0 R 251 0 R 256 0 R 261 0 R 266 0 R 271 0 R 276 0 R 281 0 R 286 0 R 291 0 R 296 0 R 301 0 R 306 0 R 311 0 R 316 0 R 321 0 R 326 0 R 331 0 R 336 0 R 341 0 R 346 0 R 351 0 R 356 0 R 361 0 R 366 0 R 371 0 R 376 0 R 381 0 R 386 0 R 391 0 R 396 0 R 401 0 R 406 0 R 411 0 R 416 0 R 421 0 R 426 0 R 431 0 R 436 0 R 441 0 R 446 0 R 451 0 R 456 0 R 461 0 R 466 0 R 471 0 R 476 0 R 481 0 R 486 0 R 491 0 R 496 0 R 501 0 R 506 0 R 511 0 R 516 0 R 521 0 R 526 0 R 531 0 R 536 0 R 541 0 R 546 0 R 551 0 R 556 0 R 561 0 R 566 0 R 571 0 R 576 0 R 581 0 R 586 0 R 591 0 R 596 0 R 601 0 R 606 0 R 611 0 R 616 0 R 621 0 R 626 0 R 631 0 R 636 0 R 641 0 R 646 0 R 651 0 R 656 0 R 661 0 R 666 0 R 671 0 R 676 0 R 681 0 R 686 0 R 691 0 R 696 0 R 701 0 R 706 0 R ] /Count 138 >> endobj 1 0 obj <> endobj 7 0 obj <>endobj 14 0 obj <> endobj 15 0 obj <> endobj 19 0 obj <> endobj 20 0 obj <> endobj 26 0 obj <> endobj 27 0 obj <> endobj 33 0 obj <> endobj 34 0 obj <> endobj 38 0 obj <> endobj 39 0 obj <> endobj 43 0 obj <> endobj 44 0 obj <> endobj 50 0 obj <> endobj 51 0 obj <> endobj 55 0 obj <> endobj 56 0 obj <> endobj 60 0 obj <> endobj 61 0 obj <> endobj 65 0 obj <> endobj 66 0 obj <> endobj 70 0 obj <> endobj 71 0 obj <> endobj 75 0 obj <> endobj 76 0 obj <> endobj 80 0 obj <> endobj 81 0 obj <> endobj 85 0 obj <> endobj 86 0 obj <> endobj 90 0 obj <> endobj 91 0 obj <> endobj 95 0 obj <> endobj 96 0 obj <> endobj 100 0 obj <> endobj 101 0 obj <> endobj 105 0 obj <> endobj 106 0 obj <> endobj 112 0 obj <> endobj 113 0 obj <> endobj 117 0 obj <> endobj 118 0 obj <> endobj 122 0 obj <> endobj 123 0 obj <> endobj 127 0 obj <> endobj 128 0 obj <> endobj 132 0 obj <> endobj 133 0 obj <> endobj 137 0 obj <> endobj 138 0 obj <> endobj 142 0 obj <> endobj 143 0 obj <> endobj 147 0 obj <> endobj 148 0 obj <> endobj 152 0 obj <> endobj 153 0 obj <> endobj 157 0 obj <> endobj 158 0 obj <> endobj 162 0 obj <> endobj 163 0 obj <> endobj 167 0 obj <> endobj 168 0 obj <> endobj 172 0 obj <> endobj 173 0 obj <> endobj 177 0 obj <> endobj 178 0 obj <> endobj 182 0 obj <> endobj 183 0 obj <> endobj 187 0 obj <> endobj 188 0 obj <> endobj 194 0 obj <> endobj 195 0 obj <> endobj 199 0 obj <> endobj 200 0 obj <> endobj 204 0 obj <> endobj 205 0 obj <> endobj 209 0 obj <> endobj 210 0 obj <> endobj 214 0 obj <> endobj 215 0 obj <> endobj 219 0 obj <> endobj 220 0 obj <> endobj 224 0 obj <> endobj 225 0 obj <> endobj 229 0 obj <> endobj 230 0 obj <> endobj 234 0 obj <> endobj 235 0 obj <> endobj 239 0 obj <> endobj 240 0 obj <> endobj 244 0 obj <> endobj 245 0 obj <> endobj 249 0 obj <> endobj 250 0 obj <> endobj 254 0 obj <> endobj 255 0 obj <> endobj 259 0 obj <> endobj 260 0 obj <> endobj 264 0 obj <> endobj 265 0 obj <> endobj 269 0 obj <> endobj 270 0 obj <> endobj 274 0 obj <> endobj 275 0 obj <> endobj 279 0 obj <> endobj 280 0 obj <> endobj 284 0 obj <> endobj 285 0 obj <> endobj 289 0 obj <> endobj 290 0 obj <> endobj 294 0 obj <> endobj 295 0 obj <> endobj 299 0 obj <> endobj 300 0 obj <> endobj 304 0 obj <> endobj 305 0 obj <> endobj 309 0 obj <> endobj 310 0 obj <> endobj 314 0 obj <> endobj 315 0 obj <> endobj 319 0 obj <> endobj 320 0 obj <> endobj 324 0 obj <> endobj 325 0 obj <> endobj 329 0 obj <> endobj 330 0 obj <> endobj 334 0 obj <> endobj 335 0 obj <> endobj 339 0 obj <> endobj 340 0 obj <> endobj 344 0 obj <> endobj 345 0 obj <> endobj 349 0 obj <> endobj 350 0 obj <> endobj 354 0 obj <> endobj 355 0 obj <> endobj 359 0 obj <> endobj 360 0 obj <> endobj 364 0 obj <> endobj 365 0 obj <> endobj 369 0 obj <> endobj 370 0 obj <> endobj 374 0 obj <> endobj 375 0 obj <> endobj 379 0 obj <> endobj 380 0 obj <> endobj 384 0 obj <> endobj 385 0 obj <> endobj 389 0 obj <> endobj 390 0 obj <> endobj 394 0 obj <> endobj 395 0 obj <> endobj 399 0 obj <> endobj 400 0 obj <> endobj 404 0 obj <> endobj 405 0 obj <> endobj 409 0 obj <> endobj 410 0 obj <> endobj 414 0 obj <> endobj 415 0 obj <> endobj 419 0 obj <> endobj 420 0 obj <> endobj 424 0 obj <> endobj 425 0 obj <> endobj 429 0 obj <> endobj 430 0 obj <> endobj 434 0 obj <> endobj 435 0 obj <> endobj 439 0 obj <> endobj 440 0 obj <> endobj 444 0 obj <> endobj 445 0 obj <> endobj 449 0 obj <> endobj 450 0 obj <> endobj 454 0 obj <> endobj 455 0 obj <> endobj 459 0 obj <> endobj 460 0 obj <> endobj 464 0 obj <> endobj 465 0 obj <> endobj 469 0 obj <> endobj 470 0 obj <> endobj 474 0 obj <> endobj 475 0 obj <> endobj 479 0 obj <> endobj 480 0 obj <> endobj 484 0 obj <> endobj 485 0 obj <> endobj 489 0 obj <> endobj 490 0 obj <> endobj 494 0 obj <> endobj 495 0 obj <> endobj 499 0 obj <> endobj 500 0 obj <> endobj 504 0 obj <> endobj 505 0 obj <> endobj 509 0 obj <> endobj 510 0 obj <> endobj 514 0 obj <> endobj 515 0 obj <> endobj 519 0 obj <> endobj 520 0 obj <> endobj 524 0 obj <> endobj 525 0 obj <> endobj 529 0 obj <> endobj 530 0 obj <> endobj 534 0 obj <> endobj 535 0 obj <> endobj 539 0 obj <> endobj 540 0 obj <> endobj 544 0 obj <> endobj 545 0 obj <> endobj 549 0 obj <> endobj 550 0 obj <> endobj 554 0 obj <> endobj 555 0 obj <> endobj 559 0 obj <> endobj 560 0 obj <> endobj 564 0 obj <> endobj 565 0 obj <> endobj 569 0 obj <> endobj 570 0 obj <> endobj 574 0 obj <> endobj 575 0 obj <> endobj 579 0 obj <> endobj 580 0 obj <> endobj 584 0 obj <> endobj 585 0 obj <> endobj 589 0 obj <> endobj 590 0 obj <> endobj 594 0 obj <> endobj 595 0 obj <> endobj 599 0 obj <> endobj 600 0 obj <> endobj 604 0 obj <> endobj 605 0 obj <> endobj 609 0 obj <> endobj 610 0 obj <> endobj 614 0 obj <> endobj 615 0 obj <> endobj 619 0 obj <> endobj 620 0 obj <> endobj 624 0 obj <> endobj 625 0 obj <> endobj 629 0 obj <> endobj 630 0 obj <> endobj 634 0 obj <> endobj 635 0 obj <> endobj 639 0 obj <> endobj 640 0 obj <> endobj 644 0 obj <> endobj 645 0 obj <> endobj 649 0 obj <> endobj 650 0 obj <> endobj 654 0 obj <> endobj 655 0 obj <> endobj 659 0 obj <> endobj 660 0 obj <> endobj 664 0 obj <> endobj 665 0 obj <> endobj 669 0 obj <> endobj 670 0 obj <> endobj 674 0 obj <> endobj 675 0 obj <> endobj 679 0 obj <> endobj 680 0 obj <> endobj 684 0 obj <> endobj 685 0 obj <> endobj 689 0 obj <> endobj 690 0 obj <> endobj 694 0 obj <> endobj 695 0 obj <> endobj 699 0 obj <> endobj 700 0 obj <> endobj 704 0 obj <> endobj 705 0 obj <> endobj 709 0 obj <> endobj 710 0 obj <> endobj 31 0 obj <> endobj 24 0 obj <> endobj 719 0 obj <> endobj 12 0 obj <> endobj 720 0 obj <> endobj 10 0 obj <> endobj 8 0 obj <> endobj 721 0 obj <> endobj 192 0 obj <> endobj 110 0 obj <> endobj 722 0 obj <> endobj 48 0 obj <> endobj 723 0 obj <> endobj 32 0 obj <> endobj 711 0 obj <>stream xœµXyXTeÛ?ãqŽGÃÝ©™²¬Ì´ LË=EÌ ÷… BA¶af?gî3ðƒ¬Ã"2 .„†¦f¦æÒ‚¶¸•fY½•••=gzæ«÷F­÷ºúÞ¾þø®¹¸.ÎóÜ¿û~~÷ýû=GBõíCI$’~‹WOð÷üú¸øDÙG|˜lû¹tRð¡Á§¯s¤ìâ0Ô<­Œü‡P´D2/øÅÀĤ¬”ØM1jß'ÇúN˜:u²o@BTJldÄßÅ꘨„5ùï»"126Jõ´o@|¼ïrÏŠTßåQ©Q)éQ½±’ÒÔQ)¾‹7F¥l¡(êñ€µsÖ†Î}aÞü ƒ‚/ Yº|ÅÊU«×<7yÊÔiãŸöóŸðÌÄIÏRÔ#ÔTêQjõ5M=N¡ž ÆR㨧¨ñÔÓ”åOM &R“¨g©ç¨ÉÔêJN)¨©‡¨AÔ`j5”F §FP2ê~j ©Õª”¤÷Ô§^D7÷Õ·[º@úóa¿¹ì06¿ÿÜþðÎ}>ë}>¨øÅ îÁó·™8äÍ!¿ }pèô¡ê¡×† ;4|Ýð÷F¤ÿ.Y¼ŠäÒ­sŠ ë$m®y´XæZ(ãj-[!ÌfýV|Âý/yZDLòൖ|^[/¼bí„:x›o±¶ÊuË ºŠÁZѬªÛÛøZU ‹€ÙŽÇ œ N)J‹žËµè:lç`ìƒnK/”Ø*…bv+|©q'‹ƒÄBÙq|QŠÓ˜^D.‰SÒ誤Åhñ~š‰^¬®ë<ð=(ìÎM–>‘°"mæd9p‚¥˜ï2ØR@“Q§Åà™ò§ÐrC9XÁª€Ê–ê}‚Ý)ßÄÂFH‚`a£Õ¢#ôlsÊ Õ±è!Ü$ÇQÂ×éÂAáÍt—Ðem‡N8É4Mˆ-‡`J+ªÐ<-Gýp^¡x°( ?%3ÌâݵÃöIt;œ¶ìå­¥B™µ”ÍfB §(§•ô{Ÿ7WQ¤âo;Ð^§D¼òƹfÉLñ•dë*‹ÂÁUñ^gÑOt;äæTN“`Êäb!Lñrñ!A’Ûß}>ãè¤Õµ_½Ÿ³ÏzRâlÜ#ëBVû¡ø(ómÕó›¦ÎõÇýUø ü™,1êm`µmSu£&)ZÌܪ~&ÒoŽWtäãJ¤]kÄOdÝ'ŽîõÔ-ž´$A,³& BGUNf®.ß SáhìÀ÷£}Æ °ƒ h9ÍJ»3† €(PÄÃb!ÚJž¿eæm±è)ü•<×ÏÉöã5\Z¦)Íqž”v^ì%Ÿs°‹#Ñ ï2¬iVMÔCU+šnï­Ú¹)TšÓ5ž¤¾£]×"Y±Ñf4s<Ç+y gâùU‹åz=X,@>‚¡(ìØòº`ñ×à,„Ø=ûQóµ7T7®”[jLœt¼Ò°5`nHÈÚåÙk€€}Ž¡…•€¦†¨žýìø×À"Ÿã˜Â´ÞBžW Úb($ì*†›]äH vŠ¿9%ÇÅŸi×£®‡dež²eFÈPº—3¡8MÚÄ8Ñãç¢Éf~Œ[ãþU¯5›@£È·C½R gÞBuÒ&?=蓲5þŒòžŒëÙ¯i4öŸp…bÐ BÔ ´Mƒc^<_æ¥û-óí7+±_¶/˜9JµaeàêÇÇüÁ{‡ÍCÕ“NÔ¾SÒîšB»‚P™,…YBWá áýzþUT+½Î¼ÓªYÁåpÙª&f?ª!ùä>™˜> ؉L'2ÙÛì…5‡2H¹#Kò Ë¢!O– 4©û$cŠ—:˜3å†tx^§zƽô™×LEãíHVüÀSá¤×'êöàG£6tQv•9ÛªY“ÅesY÷bçøg$û;™éBÅwc³ z¸)|Tdþºû¿…6ÅwØ.‚*öÁg°ÇÃÑÍÌ M±ÃNÒ®"e¢‡¼J¸‰râè;ô\ŠÂd…vûYðº—ø –MIB"¤Ã&H÷ô…“9_mHã¹,^«2'éÃ9­zÙì˜@`Çã'ÐüB@³?E÷©N]ûòÕOcØ·#}¬î'äAÑêu£FyoX,š|eðœøÎÐnPàøe¼gàùH†‡ éW/ï<¼KU–ÖYF–ÍVÅzÇþ)'Úé$ÜC»ÂÅÛ2{[AÙ%`Œ§‰g{šx#Â&›w~³õÌÛ¥†ô^¶©¢p–!Gª³;­åW@ñYD8úEýŒIÅ^8OÿŽ ¤3Áy…›P(«ö£j):̄㚰hÐï’Ø‘w¦EœL£ËâÏ$/kùU` ÄMÜL¢âLˆ¹ ±y·ìˆ ¦8£v:(RI´]Þsß ¡ƒŠI´V͊달%½Ñèþ'ïDkwí£Å8qŠ E¡YçO¢VI\ã>!¿§šžB7]~2ý6‹ & L»›Àv¦ªÍeœ¿»KnNч†¿]¬´ìZ›IŽº¯å |)(ÊA°Ûj¾Ê š‹»2ƒb,¡Ä¥Âk¼`Œ—7ôÀjðÜVÕ\÷óR/1Óš]Sš$¿ü &ߤ]âXš¢ØGâ•äGg£d@LBah- EYJ·Ò=Z6fÚçÈog߃(Õ»·>í8ì'?„à9ÓRñKýTAã¦o˜ì=}ØÓŒN+sû{µ£÷dh:ƒD#¾F}>¸ŒRáŸþê0ÿ™¯‹»îêÖ§Ìå“I3s¹XíFUú”1þ¤Ú#=¢pm$•æ p^w #Îa¢éøáájQƒ¾’ÝtÜ~¾foŒíÁ#•ø¬gØÿïX¼~DqÏü‘éðWQ?IÁOoS~°ÊÅëa+ûì…Í=×›nUØÍEz­Å á”ykbcc ç^ù¨Qh€F±’)™M1u©Åì2,!2µ­ ^(­+P”XÛˆ©f?ø0åÓVà~Òæ±=þ-¤êAE=´xíŽó1Zø|2lyzÛK{p<Ð÷|_š5bW¸ÊÝl¼’~9]~&¹`!d³3ø?õø¤Cˆ©(¨reñåùS6§ŒÅa¼ŽØWNa´™Š‹¡´XÙ}¡޿þ¢“ÜBCЀ:þpT·*aÏæâmQ¥ò {\‰ÁW¿³z.\Gôk³Fe[Êa«R úr›]°Ú”^¿Nï– ÚåO‹D^¼‰–X[ †èYÿ]Ùc’øT.™hp­Gƒ³¼×$íC~¥{Ñ$Ø Ph©çíq„z¯Ç©—›6sy£€"ÕdÝM øFè†[ð G¦­4Šynk±C€k™ÇÒ’Ò=@$yÖ§´+T¼ »×;QüzK,¨!Ț🽳 ßL%×zú“ä†áW‹äåPi«Q½#ŽýÓø»9½Ø-å² òxÄwS‹îG €dõJ¤z×(i„ëeÚI\¶£sgó¸ç²ã`¹5Õã²T&gky^Ÿ£ÂÛÜé¾"¹'YlP h;M½&{®Ã:XmU{—”«d’¹‘dظmPÖ‚¢ó¿÷¥É ðþk&ý«^¼"+o¬ßwQðÞM¢¸ÕÄ1GC°5Kð\§Ì©z¥å˜è¤Ž3˜t8Ó)^ÌæËÀF\þÎÓ°]éÕÂî"^Â=†æ”qÅ[ ôå @G¶4óq„{"YšIF˜ìÿeéY¨€¢°oÜ?Ê­9V}ùf/µ—"›h—_vƒ-S W …÷ì ‘Kkq\ýro“äêEdû„FKÑ5YÙÛÛn¼y®¥ãзÉ\Ýg®ÚÄ <Ý’ªNH­ÍqØÂÙwW4¬À£ñb< ~² @Š“‡ê_Cuætõ‡p‚}ÿÅŸ°Ï¼õ«7¨•§ñ%Ydhó—6ø±­GUÕÑùÞ¤;+mPçáÁÉ!*c~ôìЋ¦^<{¡¼N‚Ãhñ#Âô¢âÂ"¨c±ÁÄŠZU 3o Ôný¢D(·6Øö@+é€pæåuÓ¢×/ ؼ$-<ì©Ü‰ e³*Ò[^-ìt(«oî@W¾òæëÜ$9{¨ã0jÞO#3ú\G-<œõ¿¶ì[Ò¨ìwhÀ•u»“k•ÚBuµ®hO-¢Â-öÊ샓1=ÖLTUØ+ Jä»M–X¿±%³2¦)¥:ÙSç]í9¶láÊ¥›”S—˲OD4f·¤·©!”1qáÓ3VyïÃS?ëTö"ÙõåÕñ±&Ò×WQÁZœŒÞ•iCrŸyiA\hhx0ÄCDa¦Óf!îئíuí;Ô¥ÙyŒËæôd½võØo©>Aƒ Ñ88È¢QK.ÁCðpÜû/éÂ,~öà¡ÍJüp€,$iÿéö*4¬é5UyCç©÷}£õÅE[ÍÒ–ªÔKÃçz$H"#þë6J¼-ù×/4*e2ÇÖÆø¸Ä„„´ªTg{Kk«r%¾(kK©LMJHPW«[w8›w’ åyùBŽKºP z/Ã5Œv™yœ‰w×Þ-_:ù‹EÛê]Ò$©÷ÓâQ×zYqIׯ–iK´Fƒ%K«t›cÈ#ÃլДèËÊí¥%öÞ:\r‡äÒèó´Ø(®•]OBñ/‚Ff(#žSã©°ˆ ®ÄcÑøË×^Eý(¢ûJÑthfq«{­,.¨õ=׉jÚ>Rí½q¦b°ÛÏi°tÎÌ%?¯ŠÄÒ4‰½Ä$x·säkô1-Žv —YKzQVè@£œ4œ•׌4Ã!8Þ<É]+7ÅóyãïÕäëD°pýó›ÀÌÌ¿wñ!. ŸþL–ûo£—oÐb šC<#oÈÊÍ6›Í“…ƒ—¹H¢Ðsϼu¾k÷Ñ'ÏÂ,¢Ÿ92œ†‡-Œì0•µ¶6îÞžUh$—w³²ýì[»OûaûŠùsâ¦áØG…ãðz­Ö”¹ ±ÓËÄk@~8EØèÿA È~tCV-и¥&­(6³O„âccf–ŸIRî7´wÀ.¶!§1&k½vÁs¯þ)…¤?Ÿ_svR­ ÚýÚ-8Êž^t| ðìÒÌòÔöÎÚö¦}‘§¼…ÒÉhÌOÉvk¶óužWŸÝ¨,1> endobj 712 0 obj <>stream xœ•X TWÖ®¶¥ª4ŠJ["hªp7â1&qCDqCqmвƒ,‚‚tßnA6A„ÙK܈kLœ¸ŒÑ“L2F’˜Dã$¹E3™×³LæÿÿóŸ:Øp|ÕïÝ{¿ï»ß}*¦oF¥Rq –¸¬6Õü«½2B¥Œì£¼¨’ñÓk]É0@ ú6Œng…—‡à–A8u0£V©Ü<6, ßi7~Á»i³fÍ´›¿Ã?|ëŸ`»%>‘þ;|"éÛíV†lÙêû’ÝüíÛí<ÍoDØyúGø‡Gûûõî½ dGhT¤¸Ý’?ÿð`†a¦Ív YºÐ5Ü-Â=2êÍhŸߨ-~Ký—½µ< ÐsëÊU^Ûw¼<ó•Y§L6}†“3ÃŒf–1c˜åÌXf3ޱgV2Ì*f<ãŬf&2kf³€YÏ,d\™)Œ3•qg¦1o0o23˜EŒã̼Ì,a–2ÖÌpƆ±ev0–Ì`fcÅh˜¡ŒÀ c¦Ó„1“È¿ßð~ñýºûèÿó !/Ü0wà°zË—-aÐëƒ2[^8¸sHäO­Þ²úF“ ÉÕÜ:chüÐo„ á‹ai?«v{1–?«ýCÑ^V•¨»Žª•à.'!©r7ÄAìKÙK Ýß OÝ•ž2øh-[o8m¬†Sð6œLçeNçù†Œ\ƒA:ƒ-°”½Bì-&Óe_A34ÀC¨£Ë&räK%H@–T[Öòç>‰ÍÛ>í0Y!Kod­5­­² åŽ®ëé—uÇô¼ì†þª´¿S[=W$ån^Ç}ïuÊaÒjϵa¢æ2™—b¡å®eƒŸD®q4ÈéÌ»µš°H¶B´Æ 8špè`­Q°ZyAÀ"\Ä==üúÆ9–L”)~÷ Üã¿pú8‹ÝnZdº;YÍ÷„Ñ*~,¾úÉÃ'_;ß /äHÎäº@<°W³% C­÷ X Iün CÉXÑR¹Ú hLªŠÙ8T­œÂ`m§<%3É+SÇ2ø¡¾†¯ú‰äñˆù´ÎÕJÅ'›JÛ¡ šâËK·Â*ØÀ;aˆF¤qÍ10I²ò“¬ºŽŽJz»º+»kšP 9±É:ÝÞñÍåKμqØlˆ‘8’ ćø ýD#.C „\É^C\b2Ä饽Ė \j³aæ‘5Wµwß…Ïàí dÞyïÝ÷>=x޾š[F41]9ð•c¥Ô[G²ZÆQ&EÕ±¥ÁêdCË™‰C­5w1ÿ&@±ÁPPÐÐx.« øo/%Vd”ëšE Z¸°IJÊóïÓÒB.åš[ö4¿û %´™ú%;oõöØHIóU;G\)«¿ÔmøOÐl„=¥UV:e-ñHÅÔèÐ¥º;ÍE[Àá:œHƒÞ†¡d" d½Ôí¢e1½»SP:Ñž{>Žiw­[{À^¢Ú½:hÓ÷ñK~uŸd˜T'cîyó·FgYÝ€G-EÄéd ðd2Öu°_çzÏ—d¬Õ²ó“½'Š«0'³è •.…d /³Û1ÕâŸ*3œ>¦Çê²¢dPÝ/4{>ŽYÕaÎàhiMq|a˜ì„ ¸›hù­¨×ÇÆC0ï[³³ªª¦´á¼WÕ×-ë<"EM+ZpäÕßžf¦ÎÐjlƒz¸¦tóño2oP.cÙ/ÇŸ"ã‹4‚á]¯ Ýß=? %íShv@´PÖ’X~†û:ç×€Rh@ë° íÌ•Ï9DúÑ€èù/2©&eDU}“Ï-ÜMÿ1Ÿ?eá­ìEAæ¯=‚â»õÁ«2EÃ.CZ)ðG ³\ú3CuŸbüİüÀ¬-Àï 4÷Ö[JBK⤆ÀúÔ{ ¼¦Ó”z7q¹í¼)5*ìNón1­ €€ÔH‰¨¸H>œm„C¥¢ÊeÛ‚ÎA ðÕø }óκÀc’_UPÖì|3FÒÇSÆ”¢Ÿ¬ô—­Ì´™ˆ£×·[kvu:/T‡^ ˾òI¸ñC™ Lw?XAá•Ákq¬=§‘!‚ý"Ãv¥38W­¿æÝ‘x >ì[réd{Ù{'¿†ÿÌ â~OM—K r×PjêÉâ@¶ 8ŽLÁƒ'ž¯¡ÌR›É¤6àÏ2Î-Q=£”ê/«q‡2J ZMìq¥–Õ;¬?>ø9ÊÙ}uëƒÖ‹wÄóÚµœ{PDÈ ¸^.öò3Õpž*í¯:K ÊXk"•E·…ÙºfYÈÜ’½pJÒ´*T:ÿ†¤•ܬµ«]æ¤W\ñË?üOg÷QÔ7•·á~ÝDÕ8â7âVc%²2ë›>6Ògøš“ÇR"²Z®1ã ´Ñç 4š1ÆR}î³é)³¯T,«*•³j%C dìϾ´Á„ë‚õᛌÑ^ËW¥§èAŸ¶G"<É ¬´¸ ³ÛtÓôzÚ¯6}é¢ë.èžù`S¹¹¥fL± ©Ø!ã²ãèh²ªÁ~sp:™ûN´Òÿž°6þC<Í–äÁ‘òDH”–èëå<­ZçÂwÉOb¹oÆæº˜£Õ5¥MÇcŠÒⱬCðwë|æJ[)0¦“ìd2ÎvŽ}ÿC¹±©LŒÃiÂdnÒ”Äðµ[êZÁég2ÄÞˆ)#ŸÉª2势A½€ýpX~AVöÇ`Cq§[£O£Q¯3†˜£.€<]ÞÞ}© Û·o¦ãð ÈY4Èl˜ÞCA4êmtÑ-§bMâb`ØP0ž3dB\Ò•ÐFÉÅÆdfÀ}@zŒ*ìC†YøiÙJÃUã ¨VÝ ºf!÷3;J•M¸¢ã’‡Û”q¶ý¦Å~R÷c™+,.:\XÌkšS´{uŽÀ ÏzôÛñK2Îe]ðÎ)‹t¸Ÿ;Zwºªƒê»%®ZXæ'ûnL Wð»°çß›¢5)—hjëCvAF/"t;~c+ìÖïÛ£×K„£<Ò`ùòîQ‘¢6¹/›ÐR2rö—@"âÈÖ࿵²ï•{—®]Ý—'6_NÆ—ðåãÈg$ÀžX½.1M 󨳖6 СímÀa(Ô¥§çK¿&XVÔ= 6ï“ùœ–qÊYè¡£òýï“LÖpšöSëÖdmAìGÏ £Èð/&ãø«§TTKë9\œeAãÉàc}WQ¯F,Þ< *OIUMrn5\„† ²`Þò§áÏÙz^Ùw^ºœ…¤<½!š¾knWXˆÒëCÒ#Òu4|¸¹3\¤¶ Îõ6œ‹…8C¬18CO%—WJ8%­ûãÜÝ}!Ø…œrI¹ËA™Áp,ãH†Ž_!³þéžTJ}`MTp‡¡HXW•nÐCß=Á ¼ACÍ’çq_íµK)_©_ê–Êráhuêug¤·L«»Ñc:9%Cˆí·Ñ§7ÿPt8Òâtiñ©RôÏ EtÅ(=Úœ•Nô5ž24•ž¨lhÈ«ìFbm47‚͘¤¦.¶¡Ç:ÍGGuW~!àv2ŽZÃpK$2ž¼E¶ ƒ;1E‡>bw_rUX.Ç|?Øv-å<€ëoùKãÕ—i»}?¤áÍúÅûç€;¸î›îã¶ÉÅ5ÊËì T›}{ ¡Ôñöûn28ÈZóûÉ‚›–ýCǦ}ÿr2GíæÀ§,öù §"3tÙ⮤”ˆá½ëb*×”66´Îž@b!ÚÏÓÞ5;]+[ó6±½ÇéŽ$#i·¯AGóNMH9èÊRbò·©ÚôÿwòªÔíÜcm{ÛÿêÙ›©2×›•™¡ûÓ"´ ÄÛq‹aî‚…0‡L’¨©%M8ùë[&Œl´ªùÒÕ¸ÕðÐõµæÇ$<€žÂ ¸ÑÚ 7>„76m‚7fHÄrÐqVWA`lÇý›rø‰]…ÒñÂRãAƒ.M— ©|xQleeQñ‘ò¸º»´é›ÅØ<ŸÒù´žcWÍvõ-ñ­‰”BS·A4ìÚ¿¾!ˆ×t1‰é.Ѷk;æ¡]ï_¾y<å7jŕǖÁ$£í'Ͱ9;©CîþCYøkÄ‹j-[°$ÀÏ‹ #Ö·µ]y ¤çsÉ/Ĥ¢×+}=ÃÉ÷ öÛ°±v…”¨ÇGìï8ªyÜ}濌'ÿûüBk¶)‰I2…ËXmÂêÞªa2N´CÇÏÏXkâÑ„ÿ°ûsèlœ½t%¼BfI8)Z@þøÙwá=þ)éó Y.vþµ&ZH:1ÐBšz ‰Õœæ ¹€º»ê­5ÔÁ¸À›°þæÖ–¨kû¨ßþ1ÿ³Â2*]Ñú=‰z)Mµ–Aò­´&ÝÁ”÷õ™ 7WU{ša<7¬wnëÄ©V÷iÃéo­G©¬ˆ‹9—5¡Õ†vc‡³:ÍÃNó4W¹!´Ôúxz{×67™j[~1)tŒùW³Õõ¶ñýÇsZ­5w{eº@ÆUoÉYY Wmš]ûöç[ÉÈrqèž{H\ÜcªRôú=Iâ¦Í+ÚåÐÖG&/˜4zщ¥QRûúÚ½¨Šà5Ò¦]}hW¿!ÌmÌ\2¹'¤ˆúÃõÜO.êñ“9Fcö±­í½õRÁg]C‹§¨~õ£©Å’eW#…ÈýKª&÷Rv¥P#Ù5Sø§3MR-d6-r?±Àßë¾Oµì… ÊŒËô¡ÌqTîÀáÈ}-—°=ZÙlNÁ·½J‘Ϋ»¢”…ÿŸ†ä¨d©ÖY Cë·EÅ ™ó§.Ì›>Àßì˜îɱ¡ÀVáôü;ÕAâóº**ä‘Qcd×"á÷-ÞŒë:ù›å¡MWkƵYmÎzýqŠ÷éý±Ö´ÿ“ü§í×jËvÎùï“üÿ¹ {¶¶qìÔ5ë6†‰;MÉð'ðÜäÁk>úóܯÜNjÆg¦Ó8¸ò”Õi*àKqˆŽ´Öt£~%s€lisö¡#òÓUªµéå‘i±¡°ƒßZrêÔ‘Êúk>ïŒ"#É,g’)j~‚×s^kt“ç~q“J˜ôõßÐíìïQ+a®ô=yGX¡§R ãkàæqȹã+˜ç`óíÍ7I¥JÉ+Q¡5J«òHÈ=FjEˆ7 Ä!3aô~}Ž.—ײ$›‚)÷ƒüüýƃYAÝs65‰ô]@FÏ»¾ Y…ræ{b§3NgË97J/×5ò=Ñ+ÑÀxÝÅ¢»^Ì3Ù%BˆÏ )‚ZþægÙ Ÿœñu_¶us°Ø.Ü4U·À%þ»©­„%’ëë“6ö¸¿YÔtÎ|k³ç|[2™µ( ÓG±23åõÇD2×]¨‹•C;¶·„ŸŒ† üLÇxÏ žgïß?ß\WÒqs)i7áæ Œ´£Ž{¾H[„b‹…(\’—ïÚçç½É b!À¸£$/ãd´òµ‘Çüü"ÂüÝÏzÒÖ2 §}‚9´7óÈ2zü«Ä–ˆßÌÃAuröÍz‘¨}…Ép÷Û'ðá—ËWïÙ/åm£cÛVÞ#lÜLñ×û¦gò_QSl2{Z\ŒÖcÌâõÓÉaÿlÚ|ßàŽdA DþògÜ+“8²0•:L=èlˆ«é~Â}ò—ú/ªJÓËŸÔÐ8ØÂûU…™NVU4žÛ|ô!ƒÉX?ÒOt =š<3Ç|÷†.UùxI·ÐExL.M4–d”þ´²Du]ñT+Æ®åBfd/‰?˜–*vú×Ki»!ô6; “ J3óeõäÙ¤|nRµÒ~c¾cªÄÛÂc=¦T’ª'ÉÆH<¦â^#Æ}+’4" °²,ñNò9øtÀmx÷À¹¼Î›¹Gà$4Æo.z FÁ,X S÷®IxÉ#a˜E"Un¡èÝ/¨ñÇ.µP¹aI:Ø›,ÎñK›2¿S[ÂB‡ár1ß]@$-×’ñ´Óç‡Þ+;s”@apGÕ˪‹8ÝPT+.hÙôÉ‹ö&¥ÎƒxÚòXùÔ¹æÖÈ~r]†¯xäÆü•ߎK¦-?½ëHMCÙ™s>…»ö‹UGêš€Ðæ>ÏÍßÝu¡D6ŸÄÝ ƒ6±Êü^% &-NÝÆëÍPt¤p–¨$¼H?©9¢=ò{ü^x¿ôÎExÀß›{îóÂìůyW‡Ö·VÔœ¼äupŸA¬;Ör ø3oKÔë1©’¯N§OÓïÑëöPó¢éNŠÍ…Ãb ‹*˜°V ãÆ„­Ù|ƒt"§¢ùÖ êÍ>¡k§=^Fyä~çÛÏ;‚Ð'ö¤U²âZb…wpaÍúTYS…ÇòDe{T—­×ïÚ-’ïºß´Ðb#Uù¾Z®>ãóžkÖO¹fÕ<¢ïN°øŽEOàW©Ÿkú []DÛWÎã6m&`n{ý¼:=H+âpîXÚA]-Uû/Т"[wpwºö%IžQ«S½a.¬.ËI¦–?øHŠ—H+Ëòûd‹§Ú.äR'Ñ 3^“4?¹€á‘yÑG4«ŽÐàÏ{ŠØµ&yéË÷_ÆÁèôä3´-“v¹$Y9¸©”%³9¹?²/ˆýûÎ,Я!{Àd h`É0ÿ¶¦úÌ endstream endobj 13 0 obj <> endobj 713 0 obj <>stream xœ­ZXT×¶>ãÈœcW&'‚š3¶Ø–XbCXˆ UéÒa(Ô53ô^f†â€€"vQc‹¯Æco±ÝÄÄhbö!››ûö4¹ïææÞï¾÷ñ}(3çÌÙk­ýÿ¿öÕ¹%‰$óVÛMþ7Œï/âtâß{`ý/Š–$+è.†îëL ¬ùÅ}®×›‹D —mœ²ÕÇ7làˆù#ÚMŸ>u }€WÈV÷íÜÃ|½ÜÃÈþ=¶z…Ehïï?pµpGèÀÕ^¡^!;¼<Û=?0 (<Ì+d C §WÈvŠ¢6Ùo_?/pÃü  ‚? Yº(lqø’K#Ü—EnYåáíù±× ï•>«|WouܶÆÏÉmÀºÁL4múÙ3†~øþ°YÃ]FÌ9w”óèîczl3n¼Û»‰“&Ϝҭ'E ¦VPÓ©!ÔJj5”ZE}H½O­¦†QŽÔpj 5‚r¢FRk©QÔ:j4µžšG¡6Pó©±ÔFj5Žr¦>¢ÆS © Ô"ÊŽZLM¤–P“¨¥Ôdj5…ZN}@9PS©©iTÕ—²¡:Q¶T?ª3Cõ§¬¨”„¢)Žb¨­Tj Õ•Du£fRÝ©ªµšMõ¤©^ToÊžêCYSRêХ܍wE]EÝ(WR2r;ˆlDw;¹w:-vŸè¼¤³Ùª—Uš¤“$HòÎdì˜è.}»Dt9×uNWc· Ý^v/ëáÙ㻞 zÞì5£×ÕÞãzêcßÇÜçkOë+Òïø¿ó#ÛønÏwÏôÓ×dcosȆ·õï7±ßwý·÷ÿe€Û€Š÷Æ¿wœË”±²ö¸uЇƒ{vl2pHü_‡:¿o÷þ©÷›4ìÎpnøáá·‡ÿ4¢ËˆQ#-3 FÞ6h"NÖ)õJPÙBBx´›P:ýU’ߦŽüF’Pw¤ï°0$¥§œHJÑEÚc±F²»èôóy/úJyÂwb‘†®ÕeâPoÉóºÖ.Û8‹eO’Øç¥—/À—ÌÃñwð»\k'ÿrÉuÜGÖZNKòQËgs¡þü ²}ü诧_Ãâ<™¾Éâ>uf­ U •ô÷Mã/X7}¨¬'¯’›ù &QÕ]´ó®˜÷CÛXôÎð׸î3 ‹pÌþ8uA=~øI9Œ]X7Øl :²>…zØ'Ê÷Wh§¸elË,¶2åJ%$$sì½ë× ¶xž‚'a7ì>Àvèc4õ;$CLdÆËA‘¨‘%ã!§c0ãõ»P3:†Öíú‰MÀà 2]¨ €)½QÖÞ5x­1ñ¶M!fë×—QÑݾÒÛh>zÌV7©næê§“°îñÑT{/ÃÞ Yœ´``ÖtNirú ÔíÇ£¾Çg¹oIŸ_¤ñP¡®d*6ËZ}ß4Õ.í1]TB³ºî·ö›)Äî1€‚]ü¯$v^+æ÷· `3sÉc2™"Dp­k$rne–d"«·Ñ4òP;I«m+N‘ƒ’m£ÓÁÈñî’bd° ‘$cYäXì ž&þšê¨0÷€—¾×µÌaýËé7°|ÊN4qhZ‰VãþÈÏ‘áwþ6mÃ%¿»í/$çàrxó‚}+³§À,ÀâÈ>#‚V¯BÃô:û&›£Ìë]wQ!¡Û|ïOY¼èÏ’ÀŸ §½&XIŸWÅo9ÿaÌ …ßÅ}žCÌç{÷U›dzäÏâA4øE†‡ÆÇù¹3ïãGˆFÝ>¿ûå­¦Ék…jV ˆÎZPí.ðm4‹[¢\6D‚Ç…ÍÃsINl;:Íð˜~žë÷ÌŒJB$Säþ£8;”"iïiV‚ÆBåš",cÌ’@nÕzöm#ßfìK’]‘Òò–v__|ý ¯ôš{ƒEãH?ú*S§ÒD$@0hŒ5•˜ójjü«Ýæù,v‹ã¤×Q'ËÞço<½G{HWpI—ì íÕ¹õB€Ú³B€‡,è`{€kÌhˆYÌßl™É¶üç%Jêô7H¯í…'mݶùu2¤y@›ó&ô©‰ÛFsSPFGèÝ%h˜‹0GB'ñi‚)¹‰ÿ Ôº¶,ì0Š!¿úJ!O´–5)ïÄÀ|f½¯Ç¬©>§îGrª|MZ"0ñ%Ã6t4¤ä¦kµ¥¥œNº’Òýî4F‚\úà_¾8°3!O¶­Æ3Ë=‹‘^wÌ]œº_]ÅÞ¨Sº¿ŽÓ&ejaò!½Tö-@ªâ9•21I©òªÚ±¤”=½;úV†Ëj‚«_ÄŠ{ $’d@!þ}‹5a’ùÕô•Æòϳùá¹ÀdCV¡ Í£÷¤¥FxË[³F@ôèð!zTC?Ö˽eËhé!ÜK“—âum$²¡öìÏOìðp÷{A‰ôï9ʯÆéÄÂQãðDìŽÝÑd< ­¾z«âÌ.R@QÊה܌†P M3ˆ~¼Œú™ÅȞʢ!<-‘h¦ ©dÂïãj÷z–P¥êÊîTÈš8RïÅð¤˜k·ç,h—¥ ljùþ%[¯Ë½Î•[$¾*{Bó^0|IH½Žãñ1Oÿé5¿ñΗDwÃ5¨#Ð ¥g D…è.üókÚYUn o"mA¼H»‰äûßdíh44×ÊB”œyDF:Ñxøoè_HOv^4oªòÐ1Ýïxç¨&Êð(zL@cNî¯:WÍ‘,nð†Ò<£p!r}îM®Bˆj&‰Éf¶EUAßÔwD¥’Ïä‚…ß$ëÝ7ÛVLÏTµ¯˜0—ÜÈ÷³ˆJù81?=`³ËŠ÷]¼G˜z»& Ba“.ZÁMnDB’Z©”¿³lpgT£È'hÕÙV쨣: ‚ÀC@„>iŠ|4#›Œ8]j>äCZvZŽÀ—¢¯©pÓiÔ™ßaíEÑÈbô ÁŽßà¸V±NûpÇòvVÔ÷Æm¶¿²âÑË«Ÿ_Ë•i³Èóv1üJzoœ'ܬöÒ¸í^$ìzú;ˆ÷•µKj{X%‚1ý;zÄ–µä× a…“°Âa;¸ê"…°ê5¦(ò—Ô©ñp¶ÍT£ÌÓò^¹ äÛ5ëÕ¡ÛÛ£j€"uN|º"7 3r Nµƒ ©ydUio®oÏ‚Öj}„ëBž*ÏYãŸmÒãôÉBté? z›—¸!M.¼d›ú¶Ìßcж ?cåãÃ&ë¦ëÎOÑÔËWÍ}¥1rôà+6Í£Òý0ÆO nËN†8Ò«BòmÊér¡‰‘ÛãÓà¹gC‘30Óº, 0DWT•*òRk7ie•uGr‰¹9rÊs¢Ì›–•¯W}¤Z0wkÈ:ØÌÌxrþâÁÆC¥\ šÆ§ÇÌßêºqKÝÑOšî¢éyâ.g‡<~(?•E‹‘}VÖñæÛ‚· Vù‘ÂûÀjØÚîm3 b“SðE|Ì]ù?öß|1ÄÓ/ÁÆŒ¤ìxH° ð$þ@0±ÂP»ÛL,í;ÒöwH² OQ1¨%°;wï>R^a©ß[xHÀA°:@LêºV/àÀ¨ÎŠ'sKLb|ªÂa–ͬ’“—a ……Ù†¶ë5KÔ1°\´AB]?­æÐŠï1kã²Ô.«W­TïòF…΢­€jhR— 2®OɇB0U×~úEµg–|φ,y~ Á[RRl`ÃwjOêLÄìÑìl JVͼ!¹jBÞMDdQ)qhGÐ\¾‹>ïðYmÒúÌLkµY•‡ilXaÓ†/û¿ñf#¿Ç’Yn.Q12=.bÑJA›[´çä'YåpêƒË½*¶èWÃðV¯ØîºÃßk›¸‚Oyh±{z(!>ÙŠP®‡çÚ)÷¾ »mÖBþ~qâ ÚÚ¿“Þßpµ‰jùHOâ”þ°Æ|‰¤Ã4¹›Jîñá„}î‰ùI¤K+Î7k‹à-ùD‹.\¨ŽESM&±D:5aÖØ`12)sÔi¤í* ”k/Oôoäs˜Zà‹FµŠlRãã¶)âÃ×.\©dâŠ,±¤e™ ˆ©ˆ, ‹pmò9z~ï©SåÅ „ªöiƒYDlܺ§b„É ·E¥€x&¸$¢ªÂP¼óÒœ=³qŸñ˜Â½ñ;ß ÐìWƒºçä$‚Šð£BÍm·4Á˜µ“ö¡)hê¦ãÙç5>u„™ÄÙ–74°Š/¿-FŠ–‘l’IEÆàYo­ŒŠ—¡móè2ÙÕ‘v×8UÊøz-딟NPj› ú¬´\¤iéa£m½"yÓH úKmÇ_ á·FâËß4"ž% ФDáÀÖ³6푃™‡L]|1ߟÍΈÉO†(_%V| ±â/KP'âg$\ÓÚ#IjHµË$U@w‰_Aœxîºc3fHD]%¿“EÛ6$“´–^œIïOØ%4þVùjìOKÔow«p껉Y,ýn’\8°«Æ,CÆÎØ&øPË£œ]ÃÝÐV„îÞ«:El_ƒîlõ£ewí B M±×Üh²Ê¨ß }ªøéUbÛ2‘MÊÓh#ÉRgûWK Á )Ô”©´ˆdZKÿ´ÅtzªV“¦àÇ´>·ÉNÐj2)€ÌR„®„C¯(}5ÕÛ`lÔù (~.A²Ö9ô[˜Ѽ¶)7é"É8ŠaMz0~ïôœô3~(ùÝï§QÄê÷<€Ä¥9ɺÔ$µ"Y-ój‰°Ôì®@çÛF8tô•E Ë,š%AÝuûÅw#¾ÆïÉðëßí5ü©ˆ¨P1‹ÊÚºG4 mtÒÓ„ ¼¥ ­>}¯ A™uÕ±ˆkhÞµºc}¥?£4— /Ê*µ5…fYV^YU#0axXÆ/6D–œè̈,vOà^U)0Ï._¾ÞÓR&«ßUŸ^"ì€^#W¦Ê!‰ÎO(Ê)Í,+N¨ñŒØ¬Øâι׺ë÷páìÍ&/óY|lÔ6ðe¤-àŸïe‰XíçÌüï× ž¨ëÍ7êâš×Wqk«VÁÇ„Ý Eë—¶Ã5eÅIñßÙa ›Üݰ_/;#y€:çFv`¯}uÙŒz™øj‚ŒdfEû_ˆùÂLu=~½h4óO(qE£‰›_j©ËÈ®æ ÇŒÌËRdÛœ¹ò$Mr¢F¦prpÙzÁë³Y'î|P4ƒòÑÀÛOŸ£SpÖ¬«LÙ™Råm Î!ŒÊ,Ø0êö9éGÖr«N¨.hê59É z3ƒ»´Íà™Z]n&Z½¾ö¸eëŸGD³ºÜúuz±äÎTC—Rô5Ú–§Ç~ZJòò òò2FÈËõlGiפ)ËRà ?˜+L3@%Se ŒŠ^w2ðÔµsžpÒÖ–q«CË·o ݾ½<´ºº¼\Ú„Y„$~ºÙ7ˆêÍ(ëÊ2‹[ƵLg[‘$²m{«M)¬E£¡„/GmT‚ÂŒ­7˜óð—ìÕ¿„ƒäçì%Àð CÁ.AÊ Ì JÒr `KIßBá¶<¥mû¢ÃþÒÕ(¸Iôú¢`€‹X.5ƒxº´+gs²Î77錂­Ý®Š‡@âÜtq‚D•jräq ĹÂ=mø0ú;ª–°v5ì„FM£úMG½¢/|r}P“#DÙFF+#ÉUUÚ3:#1ÃÕšjá*o¯ã‚ ¼ôm7”-ÁPưxð¨Ǹà®f´šãûü›q¡!“@ôãgHRÌé ºJ×ÂA{}4Îê­à Î:Ÿ·Úû¦ ZD„JÄ$-µ,eÿExÇuf0ÅoxK²-ƒˆ[mq·ˆø;lACeõ%mÇ–±0LtlÓƒ‰¡KV)Ô ¼¬u‡ väuŠ‚¶a¹ú˜Ûv’¨œÁ­}yŸ ~Õ Å¶þb“™®Ê‡bÐ¥§;;öNÿtÀѶ³P÷ÿuÆñ= È7Ú+î¡}®ëÛ“‘kÿx2ò÷ÎbâFÚ’WòK¨ø—A$y%§öåì¼~€Ú_CækXÖž¼¿h Û ªd’¼Q­[lðd>^“¦Î 3ùÎÓPÑ–¼Em pÓmî8FÈó1}dƒe­öx /×è‰Óÿ‹«¯AZjž7rim±Ñ'éóÔ%3-MçÓmЌ֌ömÛ_fr^fDs_‹P_šk£±üölè7ߨ ààâ zCANá4V«FqJ¿”ùËd Ärª˜”tezîݯPW­}÷¿¹, ¼Š\v÷I£Ùºé1ò|ºôq_i+²A·Ùre ÞõÍåMŠ­&.Ö\ýËcME;³÷œÝ|x~÷'¶9X&ý³àóWrŸtâ·X¼È{½s‡ºákìr8«(Œ:·È¼w£æÅ㢃à`áJ¼a=gØí°ba?!áFþ³ëyZðTÌñ¯Ùla÷ÃÈ`¥÷u¾²” ‘lÃ[«é‹²ÏççefÜ€|B½yÌL, ßf‡ûoÃ2xŸI׃á@×LÃ'úO²N¤•<ØîX½¾mäc ¢¯ÅhMËX¶6¨$88(j·§ÕY«MÎÛЧk‹™=xûÏÄ+¤­¥IÙѰý¨bØÑ¾Òëh*¿‰Ý´S¹ Š™O?kºrõºù«=Wør¦Xö‹†#Çà"ótâ© Ãg؋ҹ6¹p¹ !f¢>VmŸâ8¢ß —‹BVßÜý¹^~À«‰‹4Æä,kd†»³UчûWE €û¹ë¦O™îîéš ÷µ¯¤þé½2~¨PÀ¥O‘')àϼ]aýh?dÓªh'Ý® nVu±%´0<& Ésñ‰-÷Éß“œ©2aúÒÄ5£\ݸ-®aî0—Á}¾‰:º·ét‡{Ïfc`øŸj€£pNÀ!cCåÑÝùuD5j·»æù¥-‡MÌ´­£&q휂×Ñ™F4®5ˆN¶xŠù"dË¢0IA) ‘+Ã>ò¾š#)l)N†'Kn &­NŸG&ïܤlyŒ*^®âfà“Vxå¿~+L ¥P(C><ΠϑĶ¿T C“%³p“F­J¥­<;)·HŸŸ«çn£“Vhå¾… oÙ¶µ­lû4‚˜ëÓ-¿ô}n¸ýÚúäݯ—š¿~ÚWŠQ:Ájò’{Š(Y [ˆí:)*f[ 80«kf¡~¯¿µ+¬ LôÐÒú4.`½}ôF`¦À©#Ÿæeçe>…¯éßÑì?À[hQàëvÈò=ÿù"|ã¯r4š-ˆyŠôO_î¬4XŸl^ÿôåÁÓõÍ}¥3¢tEÝC2GA(,v^<3‘ñGÍ,n¦'¥»4ÇŸKÓdiÒ€©,-­¬ÚQ¢ðPoœx|<ê“,sµ¤ʾúŒØ†»®ÍIÙû}²óé¯ÇÉt_yxs¡£R«Ö&èoŽ5ê÷i<_rwÎðßDcqâb;˜ œK¢w{îJnŽgžvƽ*”ˆó8{èÜ­¬ŽfÅNEþiì‘­b–8YËìS’£¸/n!¦Zý¥ÓVL×VËejsuY™âçhBØ&¤7=4YŸ<‡V›Ñ áw_é1y‹}‹ ›‘­ÓC#`.15%EÁmX´8h|æ5Ç"‹wú3gÁTÜ÷øbƵ«§¡ÎphÇ1ÙgÞGSëá+h¶d¤i56­N³KЇTPÛÊs’rrti¹Yœ™ÇF,ÉG3ЇŸå7ÛÆÔºùëdÒ{r~Eëð?|4î"Ñ+.ø_íØI ·ðý-¨È$jº»û<êoFg«Ä-ËQV5sÙ6Wp‚uÍ~»o¼tðæž‹ÆºG‚ÃðV;iÄNmß~qöÒW„ÅÆÜ]à`¿f{Æüº‰\Dø·?×MÁAàÄL¾³üûûgöÕ6p—Wœ‰9Lâ?J÷€iõB{Ù [ªÓ`aî5ÖÔ…!ê%3&‡sn²&—€}¥õë¼—­vH fZØó·wÕŸ8Ö1W"[L“Œ·ÌG·Ø·œÑúíoÝσײo ¦õ¯¿‘@;ŽÞHír¢³[þK›{ì‰FiWl3ïÈVDWúDÄ%*œF­Ñh€QCAZMæçÏÉòÓ3™©i©òisp×å®ûêJ*+Åþonk?îÂzã/ŽÑ÷§ÅèNa‰ñÖEã>ÈÚ­4мÝhê…úäw|ŽR¯H´[„¥+¹õ¸S_5+÷ø[Ž,Í&#MŸ)kç:AÑå'—HG<5ª{~·êt, ëçWê** ÆzhbN{\Ç#1å°héÖ²¸2á<à€;Äq–ã§ ›ˆ(‹`‘çʘ¨¨(Ù’ùáã‰t¹ÒQ ÈˇìŽžò‡D÷[t(†„ׄô,Ü£kÕ ÔkÊg„QJ¥BêÒ(Ùw#NáI€½ÏñÆ polß^1Eš2#çñ%$=Ã5£NyH ÷˜v(ÉM¨‹ ]0œþ4#ê2*¸Œ(³˜¿O¼L£ ã¢%1 Ñ*27_Wà ÌÐ1ã°5¶þfÜ«‡«›vÊrÖ‹Ü Ìׯ~Fñx²ÅSð2< OÂÎx%âðlärìBfáYEê^ELN ÄpIäCÕªúÀc\èX`ðRü.²C‹#‚ÞGÓÐ{hî„ãSì–øBs¡láA¢@·cóòõŠ`æ¯x€ÄH|æÁÕšÃ1Žõ²üH¢:Q‚mB_ù~Ñg¼•G ‹dK³Ó2!Ï6_^“¢†È`.4ÊaSHT!šmSŸ#OˆOÌÇœ.œÈûã¸\5(À6F/OK.N–¡AK°lId’2lÕ\Ë¡?ÄâÙV±ù‰ùE¹yù9ñˆS›¸£>×ÓUé*½* ˜¢ÜÂü\eVtVG»a}ã/cE¨k£ea=Û8ê—1Ïñ{¿ÆÒ하fDÑAƒˆ·jócQ4‹jÞâjP­¤J#" 2ŽÃµ¸–Ž{+êä/ID PZÀýö=-K²Ñê…o  åO…qû(ºËefÆo‘á²?›¿x1­“b4BÚª5jˆFzwEV’ï4žÛYŸfඨÃl«ˆ/-++ÚyfM“ý8Üm=qXòÛŽôtþ½ž‰Ð‹ŠX­V·,ðãÍ.2…‚<\ÙÆ6y7o"úBè^7U”—‘•óûP‘Ò o Ô‡„ùœ—’0ÿüùü¯´ÂJz[I ­Ôùl!„Ï Æ"Ç!²ÿlõÈÇÂâm$!Ͼ:øev%$UqIʘD†¨¬ØbóeïFÊ>©%‰Åïy<ÿuÌ(ôžðÍ' ­8-ÊE%bTV°§qÉ*Z€p–I¼RÌ+QkjU†Óo³ çIÒ3b’TÂ×VðÙÖ­VÈü.VIŠïbÕÑþÂÜyû•uügX{b;VS¨ÉJ€DP¥j¢=[]l¶UFUTT–Ôrš\«¶¢N߃úÞµ>ú½³E>f>'´‰Eݦ¿À”³[Œ¯‡ÖÑEmJ ‘â^Ÿ?ÉÏP¥§^S¥Ê"’6F,Ø”ébLÖ«Iiȸœ#ÃGˆ@'dêôi\nQÉÛp Ì›²¢Š¼už°‘þ¾°"Ô=ÔÓ;x̃ÕÇ£Ïè5zM.0µÅæòòhó¶8ß”MS.Bóò[$¶Ø9uVºIDèÊûⳇb~p¨C[¿2’G‡øÃCzß]Ž+7{)S¹í ŽéAÀŒÁÌ:Lýgt…¼ÿÍ)˜×,²¢ŸßiúìHU$p1ªa»R¡ ©LRÅC$0˜¦Û$kS—§µ¤Û!0ÍrþÇÿXa> endobj 714 0 obj <>stream xœuTkPSg>‡@ÎYñÒ³b—=¡·­ZQ U™vJ«®è:Š „[É… (,÷äM4E äB¸$€-ƒÐ S”†ª•í–QÇUk¥Å–m;ýû±ãž€nÿtÿ}ßÌ{yÞçyŸ—$<=’$…‘1qAÁî× ÜŸHÎ߃û³ðþ¹ÃsI^à-oÏ÷ý©{+QÊ ô¦/ \NHrÇî„H™¼H‘•‘© x)r]@PhèÖ€p‰X‘•š" ˆIQfŠ%)Jþ“°W–š%V„çäĹ3òâÄybE8m¡u¤L"ÏWŠ1²4±BJÄòp©L®Ègåì߸9(8„ ž'Þ!þJì!öûˆDCl%V¾Ä b%±Šx†XÁÏBPËH%9ï‘*ðH£ž¤§Êó?^¬—Íë{á!áìcrÇbÙcÛž¸P²‹Ûn#¹ÕsÑLÍ­©J@«QÃâùïüJŽÈrwëh)uÙ`€³à„ MK»¨½ÂÎÿL`0Ö 5~È(ÁAÆRЂf$¬”r¦ø'|wJAI­\3ƒhüO/\,ä1ˆæx œ¿DÄ8Jp{P Á©ì’ž;hÊ‚õ ÞVYHë~bÿ2/)5Q[• Â-TRDñ]Ú Ã| /Û] ý"Kýr}ôÊ•†øX—þŸÈ ]½ì19]K”7sÁ6²cuL ¸Ã(›A̺Ÿ0½_~¯ÄÏü¸ Ñ’™Gh%‹³q“Ifé ¼_÷1|=p¹³ßùáyóûp>(jOë<Ñ™“{P–xH%zqP¼ß…6Ù¸ÍäÏãÈ<)@ZÊ,"Ž ,о´«@#jv1hÕÆG˜ 9]£]£°È=ø SÕaÑ|öïŽÆfÀ ú:sGÿ µè//mÆžxéÎWÞÈ‘Ö[ EJG± œîi‹/=!üçO~ ×P 3Óûà«ZèN°•5ǪANKef›­¾½CîLÞ"ݤªfuH ÄÏþÿNÃt@;|º r!¡­ëñm*¶å6n‹…<ÛŠúè&÷ccy¥*¿¢ŠÍiÍ1½ 4öÉØµ¯ 2{2E]²÷ª*FÊê5­…–âú|ÑÉŠÄ]‰=?æ³5ÐëôÚ5 º ÔE"ìOú´Q¯·7±Æ“`h4÷†& ›Îîª8%Êè”›v‘˜"àÝiø‘¦À«¯< Ç®£Å´w#/?’[QäÂT^p«P1Ólëìߦ±†¬Å˱߿Ö#ZÚ»I}¢ºR«VkE¹[ßV¦ò‚…‹¬”ÞÊÔ¢ {'ü &üœ>ËM¸ï¼›pº­š!ù‰EpóL[C–›_ —´¨Z:-mÍ,fq,#¥®žªæÙmýÝx‰ë` Þ[ðPñœˆó¤žVóê],ùæ\³¸% òÌÛ+0ÈËÓÀù?{,:¿À>÷¼‹´ÌÅ8ÄÝdNµ6ÿZχÄkµràýaàQ×(ƒB¨mu ~g¾ÜàšÔu`Ã×he]Tž6 ¤ ƒçθfhLEŸŸ÷3–Ô Ðúã'›ž8­ [kûöV_ Ùw ÕÜ _4Ë òíîî.“XÙR1ÉoTµµ65º†Ä_áýç‡,ÇNäs‘¿CDkᅵý†¬\„|ñ ’Ñ {E[ù Ü §ºøfÄ•žÕÈšÓù)’!’TbEbÆÑTxªÇ ywF€¢™v¥]!-T*$­*G{³ÝÉ>Ai›{ÖFöM¢ZþìCŸ3p[}3còÈíÈæØÛ¥éÛdÑå1€ X2¢{û¹°ëyCp. ¹Æº¿4<‚1'ã/˜w!Ê¢BdÙ%˜„p ¾0Ütíbç‡üÑSZ_­ƒ×yÚÞ†°²XöˆVešøéu篢ìºõÍ1Œô…lžü@úZà9vð‚Ž´Ñó*CSÂæH…í†þ@Ÿ…ï¡:‡ ÑœYð¡»Ö§èßÓÈËEN£ìÛ.½Îä 5G+÷•«ªˆ oÄa»ãòÕ¶ô2 ‚ø;´ù+þÒ;_z5þ<··5v9UVY…tÖ:1<0ô¡í›¶$„Çíá$\à•Ç‘ÔS‘ï?BiA>®µPüCžl„™£ºTÐåF°°Â;=omÀ«wf&$†:þ!u©]è¦]6Y^n‰8ø~„Ûo÷Ì~þÙ†&önëèçð5=:¶þÅð؈ÔÎÊF{KcGW^C~õ¨ž‰i0}v¼xJ³Wš,’ÎÒÈuô2~ÓÃ츭ÉN qJåZ2¾”]â¹ÕæýÛ)oïq³·Aü}vË’ endstream endobj 9 0 obj <> endobj 715 0 obj <>stream xœYXçÖžuagDì³`Å^cIâµ Ø@QìXiÒE¤,}÷ì‚Kï,E\ETK¢¨‰FMŒÆò'Q£¿Ñ˜D£‰Æœ!Iþo@cn’{ÿûÜgÖç‘Ùof¾sÎ{Þó¾³2Æ¢#“ÉXG—Ù«ÇOþ;Lì/_ï$É|Ý"¬5Ѭå`mqðõ{{á=1¬;ŽïÁÈe2'gwÇà­Ñ¡~>¾ávŽÃíÆO›6ÅnV w¨ß& ;p_ï@púG€[ð&?ïðè1v³ì–IW„Ù-óóôöêx¸cpàÖˆpïP;—`/ïÐ †afÎ šì¸uÎÜP§°yáó#DFy,Úæé½Ée»×bï%›]}|—ù¹-÷_°2pÕä)S§½9Ìa¸õè1cÇŸ0qÒ]f ³„ĸ2ƒ™¥Ìf(ãÆ c–3Ì f8³’Á¬bV3³™QÌÆ‘ͬeæ0cwf.3–qbÆ1ó˜ñÌ|f3‘YÈLbÞ`œ™ÉŒ 3…YÌLeú26Œ-ÓéÏpLgÆŠ dº1Ý™LO¦Ó›yá™>2+fM/cÁÄ3_É–ÈLÆv2våËå -öZ.´Ü©°P¬U+ÚØ2îuî@çy÷w~bfõi—À.'­'X_è:¹kM7Ën»ïžÝcbøžCz†õêÖKÛëDo»ÞV쵫¼¶Ïì>q}Þí+ôïû‹M/›7lBlnØ´-è7¾_b¡ÿY±K·ßäK5 ˜qœY\X.7´Nã“K5;à 4©ÉÑD×ö“Mr h‚ÓCÓÓ ¸h•b—þ,ÔB \…J gf#À‚ó2r@¯ÏlÁ>6hTœ'ã,G«{ô öÀPMŽbÉ]1†G޲$±Šn­–`­L2”£ 7 L.îÆ3ü·žïNŽ.¾3ý-vRéI–*ö\x)Ée'[©¿»éÑñl'ôc‘¹Ñra¿1l†@jþº€¥*ß“"|ׄ•fÁîø¿øºü@ël^õ¼í‘½J\Íâ´›÷~;õ隣ÄÁ5»oÁQîÁ”d’@Vx¬ÄìSãô5s½Ig%N¾àñ]tg±s a68û½IXe·ß:MH`RÄ~&Y=Zc>ZËÅ æ±ÿØÇd<™2iéCú>ãqÊÝÇØK z²”'};ß: ï–5(+.5Ã{аµ$¸ÜV;7GxF1*‰7ãªr\hDO³ìÚ‹º&y«ºu_ ÂLG·có«f-I"cȲ™xâp25è„,vC«’ݵ´ÊD2Šð«ÆÃB˜XêvÞ·Ñÿ ß]=zúÂõ'¹Çà:`W:2GŸ˜ùÀU‚¾JIëEVšqˆIìÛ {FKf â>2’wÂåŠêˆæÐ³Àဟ¾À¡(Œ¹Gú»®Žòߤ<Á’Y¿—°-ûÏrñûµîÃ3®Ä† q\½H¥ª8@*ß0‡VN|DË6{‹¯Ó²5¾*Û4—£-çŒ$£°;qU×_úòâ#ÁÞ…Ë~ûWÕz–­Âé¼c•ï:ßõ󷌎ên€„ˆ&3“nmƒÓh&Wb%$Ã7O'³#ã°éŒâa®ç eÖy(fª=F ®XŒã8L ‹Ï5)‚PmÙö#ÝÑ{U«¥¢Ûo² ±L®Ÿ={Šœ½0‚7eáDì,Ä&$o‡hÎÓ´½ºÚTrèøªÝîoû9yÄR¤Ëdꟑ~&©nBò$ äN§GIÛ®¥ŸÛžH·mÕ:o»×±E­°Zà¼C¯"¶X{Š}˜½qvG ³“6Ž–c-RàD¨ž]HºÒ覵0)&Ñ®NÖø1Æ|,»Š3ø2ÈÚ‘¢ÄBZzBrjzpñfƒpd>±GD}ª²&Õ”’ †‚÷q¹Ú¹øQ°R®Õm.ÒÕ„e·ArQ–ŠË…]e‡}OB)؞žùh{,ÄUªôÜëgX‘»(oIã>¼F”æ†ê]\¶„>#dTJ`Ÿ%5€»YìÕþ hCáÛùÏÌŠ0øÃbX‹õœ 퇰 Á›B£âÔ°  ]®zûО–\>Üò¯qŽAì¿ï§‹ŸµRîõ/,¸|È-¦›“5µ·>kÆå²hstm’£8„ÇÁf2Ý<Zw‡tnËMRÏÚß ¿r­ùô5¡Åc» 0(` \¬”z<¸B*ða3–š; |CŠ1¬µ/ÿܬ¢1úÐÂhŒÏI)¹¥ÏÍìŸÎK½ÁÖê‚züµöxoÃ=ÏÒ¦¦u玿"a|..æ_âp5;cÃâé3ÓªO ø%N¯ªf‡] ú©êÜ4 º78Ë`if]’á€R´ P•U’—;ˆ†€»ihaVøh†=†T'‹¶GÄBÅ6èŸ@=ž@ƒZé–¶0©F‘7ËÄ$±ŸU”™}è°ñÑhÀ¶‚–Ѱ5©ÉZЦª•¤3É%<$#ë}éAš8šKOˆkß!›óÄѤ©•Ia±Ñò= m®ôþ«é&ÖÐ5gØŒ¤q™‰)¹a šôdmú ²Ô†0X&­×Ì£«ýÁÛWãè¶žYÑ™É`›GQ—]þKmž“âœéOÛ È0d•J,5ðmJô¬ÁI&Ù^Z OiFªðÿ`ö9bïF¬R§x쉮©«56–%—nÏL9UPÜLJ¼§)7±d™¸‘ÈÇ!uéÓwššË•›Aõ½p\ă c"Ä*uP •‘æGO‰ö_ëi:ò2õßí”°¸õÜ+‹~â›<&ↂ¼œì{`kf—ÐJl€@˜¡R¢* J»KÍiÙ6+rÅoÿ‡ÀÜÂ>ý½É}zf*¤Ù&¬…AÅîÑM…C|Ó>Ä·²+ m§ºë€íŸé®î#P-¶y9Ù_Hr£ò£UWA°´¡2cj2•0rÒpìjÙô²°¢}Å',Ž#ËèL›œ<lUìY½ê)ç6ÁnIÙl‹Ü™¥]V¶ò Z¢œô·ôP)ªô)/×QŽ•ÖÌ}ÑBýL¸â8¥|Ì“¦¢WëBþcïû&¶¤¬¤¬¸üøÊS 阞ߦJdÀèûd€ëºmþžÊîü¾c'J›èw=€ô^°–…mV¸¯SûÃ<Ø|,¶Bоê»?Ö¤•kŸXÉN1´Ô󳣓ÏÖ¬X«™+a3Å«¼‹ï¿è)²Î$~h–UHPJ»ó†ÂÌì îý4il,ÝQˆKOOѦKµ“¼†uRc…ÑÓ»¶7Ö]Ú†¤ÆÇ¥ÆÛFnðwš i ½®.9S˜10 ,Òo]³ÇÙ['¯5— ÝÄtÊ’T?4R4­ä¢/væó@£ÕƧ ÉÛ¶ÎKG¯=à¨ÃgtØûfѤjµZV™ž·B9½Û«GoÖ°‚8Í¥úˆ%¯;‡áøzä²(v-FÚ¿ÌÓ°£â3é9uØ›'Éâ¾D üHÊé~4/¡Õ†¤Ek¢´ÑÀ…«•úÏÚ¥Éçí¸ g¥t„eejuPÁ‰§t,V·ý´3Á .Û0äîÌúÖN6:)ÅŠý3ØKgP#A[|ôÜLüØHH„ÄHŽF b* ÅirÑYÁçä \™¶ äWE™iÙ¤0|[ÑŒràî+H}›˜@ŸŸl•储EQ‚k-=Iön¤pãDž”PƒDßO$ô‚¤7°ekhBHìÈ Ç“ÑöÔÑ2Óå*^Q¶ÈYÛ}Þcñê8:áIÀÞQIZѨ¬?}ÆP ‡ 9Ú´‘{9¡:xTL9*Gsëd^§ÕEÑëBþ‹¤šX1©íë¼x¶l«ÀP©o²P¡ÓíÊ,Õ—ëJéT–w:Å]0¼ áw•l M]UzmšN \Ûd Û²Åt£[-þ£C~'>‹«1„¯4@u]òõõG•MnK%]7yéE잎Ñ8òðó’¢£MKQ†,\éNW ÑbÿÓÊZ ý!ÝcCÙž}fJX9ÄZ·FÊó&¾±µGC» YˆöòÖJüšG_"àPJÂÈ2Œø´#ö¸•vh>i#ù…à\ïýžûÕÔo¨þý ãö¡›/_©>CUÞYUí†ýKó]èltH˜ºÆ)Ôo¹jº¤Ve«^p†Q³dù잤*%m¡0“.OÏ>*6å鵃°C¸"¹M{¢wU45òiš3ŽÈ½ ' ™¥ºF~þ[U)g’¥Û5bK‡ÎÆ£4$ªßçñ |ëë;O‘u‡LS¶ê ÅŸUöñ8¦Í[SÈX%Qb‹¢Ã‘õ{pƒë{0n¯¬þ†=7Ü’c\È 9 Ežúôòñ †ø\emqUf‰>=•úÌ8.²pÛ®]…eƪè=*ÏÈèHÁ³Ê+g5-ްüsr=›ü”Û·EûÒñ¢ªÜlŒ Kq ‡eœë‡óÑß¼}òú—KkCó÷ªE0‘zÙªSeÅ7Òñ˜­+Ê+à°‹Ÿ—ŽKwï‚Óúõà4Iyš¸óW/Ç­òõ]JˆÏéÆ ç¡HùÒ©J}ö7fuèÚ9’„ÿNñGÊÿ¿4«ó&ÞiÆý&l0÷j¯G#Ú÷í½CÜ%¬ƒé œäž ¼M\„6Ëß ò¬½ ?¾˜ªûÙÞ‡±‹â 쉯©ó£¾}>=<ûð½¥­î‡üû…%IqÛ´ÉqZeꚀÈ`XÉ“¤´$_#Œ‰Rp9O:c½ Nɘæº\;‰¼% Ý© ZÄãßã` Œr k•ó‡¶Ô{yøy{×û:`ª?$9d¥¡3p3— †Fz¡w.âHinÆ›[Ùƒ²s÷ñê}9f‰Î¼CEú(䎛ÎHz’éÓIá| E¨F›ï>£ÃÓnÄ5Ò%jLÞ$ ŒœåAèÉ´ìXÜ€»·œ8óÞæo ^ìÀ(¢U~¹ Ý$ígò9¹¦”Ö|É@†ïŒ×‡fjò4¹œ‡b ÚȺÜìË%y9†/¨#âp‚ªJû¸˜WWÂ%އµÜüã]]X•%S—Ö 8º-Î_ÿ=fñ ÷ž½!½<±àßÝuz?|Æ=ÛLdÄvÎŒ+j–\óˆåšmN°ŠJÖ'nÔÞ;ܽA-Œì£«w dþS>*/¸’îòÆOúÊ;Ç6,ðŒV-Û"ÎoðõÑŸªê¢MÛÌa”ÒÞz+ÔÑÁ­å󫇫yòÁ*´:eÂ_¥¤÷F_|M.öÅ}ü\ Îd\€Ovq¤Pk0a×°µÒ?dËösO­~J—Žùó." ‹jåÙhÝônÑ'{¢XÉ;ÀÍïÂ]”]¨\–©Ì Ô»ÀnnÔ—}Kéb·q°·‰\û4ðÚàéi 8Ð1 Z,þr®ãZ8«ýÚIÒû’˼fú· ‰IZ-¤q‰ùjCá·Ñö£-§Ü6nÝâåSís´¶´(;[èxåB2?/§ef¨Ø³"IkÖ’ÉÄ‚XÆÇ·ÇŸ;sô`Ü%ÐT±£3à|®]UàÏ'®¢µQzYˆ^”øžˆËù42ø Ký¦UîÁ¼ˆªÔqaÂm® ÛkÚ]ÙxjÃûC‰‚Œò#]…¡¯tÝ?±#þŒsÙjƒÖWI®ÿõ[q ÛMì‚sÈò±EŽâþiËþ^ϵ¼ò×R¾PuÆŸÝÊeçÄr1±u9O3F3Ï•ÆæÆmK‹MÚ¬DSC3c]¨.(ËÌ+2¼DªI|l’5S‰+½!/Ä+üCÀ’@Ô@’GŒ ˜ Ãzò8ïaQÆÐê˜bÀx¸ ²O>¾’U{àÜŽÂ)T¾ ‹$ìˆ ŒŠÚªƒMI©;ÃÜL«‹–r|ÜÊòµðf-"ré—Œmª2Å>h1,àÚ*ˆRÅ6é„£ôxÞ>ÉöÅmÐ / íq³ì4Ú¢«ÔYzô§Æ;=2Ùu‡:)y:ì ºt¬¢qÏWÿS”‡ò/>>9´²û„ªHË‹F­4館o0i 0d ´d{Ð<ÓqúJGO•’’(u"ÔѶÛÅ©ìˆ>€öÚw_kj}†ÐE’å…x›G ä¾ì ¹ c¯»ÒœSTuÜ¡ ZO  ±OV`wœöùWOÞ ý–Œ­¾¬ùà|Î]w> endobj 716 0 obj <>stream xœcd`ab`dddwöõõ441U~H3þaú!ËÜüÓëÇÖnæn–•ß'}7ünÈÿ]O€™‘ÑÍ'Ú9¿ ²(3=£DAÃYSÁÐÒÒ\Á17µ(391OÁ7±$#57±ÈÉQÎOÎL-©ÔSpÌÉQé(VJ-N-*KMØìœŸ[PZ’Z¤à›Ÿ’Z”ÇÀÀÀhÇÀ ÏÀt[øFßP¾ÿÌœÇRüX;ŸñÞïÌ?Í¿WˆN›0yB÷ôîéÍ&üÙ÷}¦DݤÎîŽnކ¦¦†¦ ­3[ä,üÝóˆk[ÚZ»›$¦4Mëëíž4CޝtáOû…¿—M›6ƒíwâ4öU\—¹å¸XÌçóp.™ÈÃÃÀƒ jS endstream endobj 111 0 obj <> endobj 717 0 obj <>stream xœcd`ab`dddwö Ž441UH3þaú!ËÜý»ï‡ÿÏ&Önæn–%? }·ünÊÿ]_€™‘ÑÍ'Ú9¿ ²(3=£DAÃYSÁÐÒÒ\Á17µ(391OÁ7±$#57±ÈÉQÎOÎL-©ÔSpÌÉQé(VJ-N-*KMX휟[PZ’Z¤à›Ÿ’Z”ÇÀÀÀ’–ÅŸÎÀÃËPÂÇÀ t(Æý OËø~tüî[ð#mñÌùŒßsÎ1_ÿã¸h÷åî…‹—Ì»hñÅþ =ýýÝ9¦5w׫E8wÊýöfïÖí®.̯­-(ðiçhiéjlœØ=µK~[ǃ²nuŽßQìÝÝ™ûÓ¶åži^ÕÍ1}r÷´©­Ý=ò6Òv4­ï˜ÖÝÛ½Žã»{÷Êî}SëÎz/M™ökm÷¥îå|ÿE3õ+è"îÍÌß&ŠÎìžW^Þ]Q+÷ÏŠ½¶»bþüîy3倎?¼àûûùŒ‡ˆ3ÿðÿÞ'úÍø‘ÒoF3#%…Ç&_¾3>xòEêÃŒ?2À|x[´ûh÷Úð +¼§dws46v7@|p«mCÜ”ô¾†îÎî Žß@ævGô6Îð<]¸©á7Wf·Kw>ÇoönçîÒâ¢ÊÊ’b×ö¶®ööîVކ©ÝSß?Ùw¹Wî;0|^vÏ^º|æÌeËNõsLšÔ3âý„>³Ýï9øJþ´_Èö[`ûf®Ür\,æóy87Ïâáa`•BþÇ endstream endobj 49 0 obj <> endobj 718 0 obj <>stream xœz \×Þö„ÀdÜ: êq·UÛº×]qkA±.(Š Š"û’krÂö%°†E뮸âÔ¶qm½ÕÛV±ÚUmí=cý~ßI„¾õ¾÷U‚ÎÌÉ9ç¿>ÏsaoGðx<Á OÏÓÍÿÄâq£í¸ð3P”àóx«×n_/ y{Å;cfÌŸÿÁ×0aОÝác1žXO, &ˆ…ÄDb#1‰ØDL&<‰·‰ÍÄ;Äb áEL%¶ˉiÄ6bñ.áM¬$Þ#¶«ˆ÷‰ÕÄtâCbñ1“p#fîÄlb 1‡XKÌ%<ˆˆuÄlû°.G¡“‹Sì[ì[yoýB‹è;Ç`G´;¯q®r†.¡.çGºü£æúuôŠÑ÷ÿñö?~cf3"æ;˜Í`ïŽñóý؉c#Ç6Œ}<Ž·b\Ƹ†q×ÇóǯÂ;ÖO8=qÉÄÏ&͘T:™æªsUÀø›šðê¹`>4qhÅ!™:„ Pø£A]zg4eRZZ2H¤ÂꀖyIVԀƦ8ÀVÿæç’Õãâ@hX ¨`_’Ú:ÐX’^(ÏeÓ²c€PhMŠ>s@ΤeIØaô4:þd‚ž¦N_ÂÜ[t3(ÛÃ,'%BAb1cY—“y‡8><ÿIC(r¨"ËÌ㣀”OJ… ,´T³+Ѥ%p’ƒ®45 ­¢ð£:PÆV“p ŠA.HëCJ¢ñºµøîoÖi¢ˆ} ·ü‚¶8ˆbþúȼ‚¨ÛúX#ô1:~g‚RÓvìÎæNÑpùM•G°_ˆÛv 7GÐ×«ŽŸÔuŸA±¤Ì¼‡ZPÎÖwÉH§W‘}Ü£"¡ÃÕÎû¦í7T²n¨˜FN02ä7Ë}¼÷®ŸÍâ…ÓŒðK#ï’ Öšø\ Å+¾÷ ²Göf!§¦A;h÷ÃБA»ÑÚÕãÞ³ïnܸuûºûô÷<–¹²½„b<Áz¼e=YVk±ZÒã¼*PÃŽCI²³ à¼d½KM•ÍæÇ5xóz¾®8 5BAï=8À6“®1»)ÉÈåy‡Mðó«|NÌݧËAmX|zrj:£ÌÊDa°a§n+Î-›0¹£5ÿ ‡CêÛÎ'û£A’B•lê; ¢ý5}Îïp |çÑïW/î\PÊf'dIÕô:³]Hh„ïáçÝY©ÁAy@-}åòùkw//Ÿ=u•ûªÅO3h’ý‘ÝÇÍ€‚¼Ÿ~€NpÈÌŸÇn÷‰ b~jP–úÿ%‡» ÿ)‡É^o^5ÁƒØŸû¸ctaЀBê@ 3蜒Ì.ˆAÌóF™ó°H€vÅ'KAHv ª• |EîÏ+hfŸ *AUP ˆcV ƒ wö‡&Xaâ_å ݽ2¶ªKCö^A?Žx ÇÀ9pö8¹°HÐuŠæd?  C;Îs õÛ€† ~?ݵ¦ïÚ“C[Nðg"üê6âˆØOœ†œÐÐï§@»ÏO¶VëYâÝ'Ö m±ö&WCHoôž?ßÕýæ“§7M_Ý;±ÄÍZ«0Æ}-áa:aÚCòÇOF:̶s޵šÞi3}5Ò œº` !ð’– ª’yÖýXâÇ Ð*·½½#hJ+ bºúÙê»±o‡‚ïšàêG#œN@!\GåG8ˆQGkãjU¥+¯×ÉÎÛº&~­'ëd:` ÙÙ2ýêX`»‚¥¶F€øÝ«›x/Mp4¶‘—B G“oÜûh ³ß°÷a6ìï’÷‰ì{6G{‘= Àñ¶Ê¡ÆN/àY˜O‹râ²…¹á9ƒO¨ºæ¦þU•ͨ²šº Ä$0×^t†,UÉøê}Çx¡h~Àû¯žÊX§gm)_%n¹o_ðô›Šî ™ôŠŒ¢(@™#ÂNH€°± \ÝZÌ´œWpáÌlþ×éß­Ée-…gáqܘM°§ÔfèOט¯ÅQl0X›À¨<6&‹µœ«eût|Þ# ĺáÖYÛgî>6Ö"}þú´ej»dBÛÕ_›f, D±BòÍ-Õ}OsV÷ ®þÑL«Cô PwÈòZ‹Ãe¬|HZòê/P„wÆyÈ"°¿™Õ‚¿( §š¢ï9RhheþðŒÛˆ>¹ÈVlè’!¢Ïõ¡>ãó®3ÎÁ{F^ Éç–ã˜4öqL?›±ñÐ=ă÷ Ñë¬F гâ ЗJP ŠöSV”É4ònuÂÕ8.SñN{\7àfÛØÃ®÷ȹóÓÅ)ÛA]8““›“ Ê©±N(Š‘†¬ýtÇóξ3ž¡‡®&È7òʹ$>·Ó¼e=ž/Äã¾JÆG[F%ÛFnCgTdF]âIù‘øk™E VRLfêÄdÄQ*Ò žuh³2-÷¾]Ù«¨3G”-= \ƒì‚ cícuiv¥&s½ZQ¿œ”â„ P ZAvyNÕûÆçFÇ‹¦]ÐÇ?–³k¦«BO«ÊÐ Ó»“s³SX*¸µùk4a×D°ó–¬üøVç7oܼ޶ÉÓ–£ÏÚa,ö÷Fî6-ß/ÍŽÔ‡}Ò ½W¿÷Á8.BMµ]™%åª:àÒXœ}ˆå4µ‚Þcûi„ª›¾ ß2ò.Þ†•·øÜ"¸‰ÖW‚VH®ù G¦NÆÌwð‹I†Î§žÔšÓ*>%SœÊÆlݬˆËÀ²3’o)õUºôΕ‹7Vk‚ T¯zi7Ázš@x™†Gc ÈyÄF¢cè¨>zÀµUõð(ƒüP>= õò3ò³à¸:ÀçE'K®4?÷@‹¢Ì³x^ið+“6'mŠŠ z£‡áš^kúéjÌ”epŸ²|мÿhd2 ö¶èªË WÉÂ%;g3[&ÛøË Ô1©þÖØðwR7E]k„"qwRâ¾±*ÍBRwž<{æú X$êûd}ø9¤m“…‘œÌþwòÇc«·lÙµz*Ž…¹ƒÄ_…®—.^…;¯:6\›yÉ'—7Üáôï$(ƒ+éÍ»O¿tüø¹ GwlÙèëëÅΤ³•‡Dm€zzçvg£¢!ÁÀê‹krJÔšÈêÔB@i«‹ªÅM›“¼UA;YIQ`åN@½»rÙÜ]Úà21너$‰"&l$,È]}À‡ ‰šój| ¾õªã›Öø3[ë™Ä¼ÝU3µŠL‰ %Ë,¶ä¥I¥*È9Y¥9…€®Ñ“—;^QÐܬckË À@uB0ÇwٮɥÄêÿÝ7"–.Ó‚JMÜÁ¤*6¥$þ@jÉñŠŠ–‚š à3p’ú{‚”4u£I·ž¤m§%pÝðGö¿ÈüŽc¬ª~[·èqÄdØÍ´Û¤ÃmE§c<ºM>=¾~»·Ï†éì z†ÐŸ¶VÁêÛ¥Q­ú¿ñà`ÒéÌ}ÌÕAsDU,ˆ»;« ц$u­æÓCÍÑ óó0›¢Ü—Nž¿òÕŒ¼A¤—õÖÖƒçŽÐÿùj¼¿g°ƒI[õݸ>Õâ€:Р> Ú–ðãH§œÒÞSQc0TU˜žÞàxî,¿áÃŒÓ+” í—ÿy? BrV'²óòJðóa°Œ:B»ƒ½mqF¥F¥Á¯gu*O©y.WÏ|ñàüG®sÜ6®°45=×jä7]ÂY={ ¹¢µA( ;J‚[´Ú¢&¶Âwárã]EV(¥Ìæ3è_dZy¼Y(1»»» +­íàù×zn¬ŽŸóá ®ƒ>ï—£Pøel ÊEïgù0j?°7ËOU‡™ôAŸu8ë‚ú†ú‚ú\ÎEpžê*þ fáN£ãq“§ùÓ|ò,ƒ]ôríçÚOÿóþ¥í^=|—³ÿ ¥¿ª?Ñ.QçÞGÐÀ-ØxrÛ?£§_—Å®Y¿lä”g³à0èøôñO÷ܯ¸ê™E¨™žçÖn2^¾öÝÓKk×­vÛ4ÏŒ·ðj°%Ž?<üùëtö© üD¬ùÓ²}K¯³Zškµ ·B­¥àF¸ëa5d~lÅÁ7yuÂÄûØ n¬£“ÑÐÅoOÅ  Ž-ÏÉÍÕ`QP¯‹Æ%„…T¬ÄlÇ·¾aÐG¦!¾iâOš‡Ó|<Ú;§=r‚Arè[>»ûèVûícQ\9[\¼s!¥J ÒAzŽ((ÏÍçY⤇ãnÂI7á8¯…óæsvðú ²¸´´9ëFVÀI§m7üÉR(Èm.”—P®’KÑ ç o¼»„”‚ÀÀPÌ~FÆ£IÞ¶Ÿ4d_š oÊn(ÎbÊá`‡_ßp Çuñ«e† <ÀpƒÃxpƇ÷9{º5¬.Ä_º¯1ªùPmSƒ®Øÿí~ç<ý#—ŠóØñòõ5ß¿î\sÝÂZOÂúÓÄc>`+Øê³cMµJh$øhüª¤g59…ù š2Dkã;ç]^©$fŸÕ›Am9sHWžýÜm¿ ‰õ&¬p¯`ÆYùÖä”t9H¤0˜ÖëkŠ[¿ô¼ú2­,B ã/@v‰k–W­Áï[JÝ´ßX¸å 8 NŸ>ÜQHYi)ìÿßí^ßeO'nöKSÒ2e©@BIË´U?^€öŸ†5ûDEEhÛ,®è€ã:`fßÁkiïhÿ¿øÜŠ×ÃèœÂ¬\ŒþRm\tªXžÎ º?We$+ÓAª‹¸\RY“WÕ;üæ7úî¾+Û¶í[ïêÚºþÌ™Ö+w™Ù+i¹¸þøñÊúââÊH__q¤œE›¹ûôý½íÛ½ý7,[üɦÓm‡.ß³Ž4?RÑXRRæç+Ž›‹­]ÏùêxíÜtóçTº(¯$TRÕâb‰"S¥1è!Ú£HKLb˜ŸT˜ ¿EþÎ¥ŠlU Ê+‹«+ñÝ<†nÖ:»c„Ã<ƒIÓþu;tÆ&~€åV“­‹¿ßôläÊà9‘[õ~×â.¼x®àc¿X¹m³Ïä]y›ôk™”” k”*q´$줖žZñŹ#͇š˜rñ±­—õiÃç§÷Ge”2*Íð'JÀ>àRQ¬oÑ,¬¥ÐZ8…–žSùÔ庺ªY)Âã¶mbâ='© .UíÍUh£÷m H—Ê'ùZýé¢âSç,mÈëæÃ›¼Cœ'Ÿó€Ïéâý¸ ÷ay„l.ªý¸¨à+4.mÅO‚q©¢?Hy0~ÒŠ¡Ó<ÁE=\ÿœ÷ùð{.þr_«_p|Tt¤NÔ˜—«YLP¤‰3W,Úɦ¤'§ãä‰×ÊJk~7AG毡و[UÆP’R”œ‡¾…þβ‚LµP±\$ÆwSYx¹!üJJµÄKT)//ÈV”š'›¯{ª«ùP}3 ÊRsâ‹ÑЯwBíÁóC…#¿+/ÊËeT~º.*íBΨ 89£es~ù½M5€ªËÕå³Ý`3:vtž|>ã«ß1(ü³Ä4œ*¿ôìlCyk8Gµ a•6ÖÛmSHT¯¯ÖŠÓ Ó5L­áTÞ'€zùIHhTŒ\œÌ¢‰ ÁL°‡Ú 7j0N¢åô›ð¨ÛŠƒ˜²½‚Whì|xfËeíÑ€¦Å¥H‹Rs3Y8ñÊÐ,g&ïC,5]Š[R)š¸Ú¸ ÷ôëaØY#lÄ¿xÇÛ¿k‡«p®NàâéÌ,3¹¡ºÏAhÀÍwÛ~< ]o(A+Ñh4@¡á`äÇ<ùúRƒ!$'d‚äd60Ä?)Kb $à8øÎ‹—¿N$¯«f× [ôŽÝWï}òâÑÇ7,Xà³q—Ù‘OôÜHlô*nAç•äáêË {4tEVúSЀùÍþà`¬W»eE1ˆ¸&+P‚Tà—/¥•àÀóÖ#b½<51 Ĺd€ðà z[¥rá. ¼?Ø_РúTYǃöénî®—d|@éJ*Ê´ò¥šj?ÜUjn{óŒ¯ÇcR,ÄyòñëA´ðº‘Á©ŠöÏ5‚PMòºõ!ÃÓ^7ÃÆíÅ7álPÜMÌ©a ÇÙ€ ƒãÉbЈIΠñhœ œà84ž”ƒÀ<¸ØŠ¯E:Þen¾õú}:½0E¨8iB|JNrv ¿þóÃÜäü„*à¢+ÓVägfjX[׿Á–ë|Ø’MK=vHäÉ™ñé ÎÒš›_^€vƽŸøî……ø7÷kòÔYyŒÍrέ‹¯ÇvË·>òeÚŸãÑ´>×nÖó^s¥×Ü´Öé|l³Íà[6ôѸ}ÛMœ»Ü Zž—2-A‘Ž»9KSR2@•ZR“£Qç3¿wü¾®T‘4À¥¦°9O«È‘ç±V ¿c0­g#Óþã>l®å|^¡óÊÕ÷G3øÄ¤JÓ0ÍüsuªD@ŠK|Y‚®*¯¬DÓ+ÆygLðœá惺uád‡ì'[¾U°î%í ýs8bˆòéÅî8oÃI¦_îÞ¹ùšŒÞvGý[6a„gÌ?=òKKc²v8;¿âÐã¬@itšœZñ«/qV«JÛ@5C€4@ ݦ*-.-:¬FUÈÖ© /3k3…@ð9~Tt1õ4 *j@SƒP­`ÑèlLz›(8Gj3x6­-Û¯®µ ,n°ñ%NÙt¼ëÝ_ž§É1 ûÏõJ+%ªX%^[X‘^VyDsè8Óµ`ºÀv¢’c+ƒéd¯w­ðzÝ›ï.ôÍo`Ѷç:a™‰ÿÙeZ‘’–d”ùS>µæU]÷)³8‚A òÊÙï;|­ýäuðNº‡£þ‹æÏÝgHÒZ{k‰");yªé" ~¹sÖ*ï nžor5n›p«a{ÝÚœ@@%`±U™å-£Äî ¦vÒž²c¢M!Ê ƒB«  ‰J‹Çñµ~Ð=(cÕp¨'ìÛ²ƒåËN«k¬¡kŒV'³Ñjd—¥lïfßYWÍ_ä9Þùq'Œ4í1ËŽÑí —ÀêîòÏ \µ}up­Lg¶§4­03›ijºeþíó3>aÒÀÈ6$J¨ PnÌN9ýj.Dæ$ùËÙ6¬Û´vúž%E§¢ØÜÜ< Ðõ~æ8ó§ ˜Âøæé³[;®¸5š½ÏÉá@Þ#ø«ùæ/èri¹$)-=-• ‹ˆ’ȰM)H,N,‰ÓH!%ÄIÃc°*””IÊ‹4¹š<¦ÑPW^ A¾¢D^’¨‹=꡼Z«+k¨ÝÂ0rýp*Ümç‚™´"(q .Hmb`."<úË}dK"HÜ·]-6i%5?ˆ‰ £Aº*1ŽB »( áKôR`um“Î1:žëÜb‚*‹>kä\è@à›êcG©¶s}Temâ¨RDÍ9¹…ùL}ó‘ L¦œ^=<±Ü}áÊ?ˆX“1{1?{±AT+ Sì÷õ*h‡ýòò_,ùõg'q°m* Q|žÀØß4€éo1°Ÿqà@ÓÀAñÿ µ¾² endstream endobj 724 0 obj <>stream 2016-06-13T15:51:40-04:00 2016-06-13T15:51:40-04:00 dvips()5.96.1 Copyright 2007 Radical Eye Software fitsio.dvi endstream endobj 2 0 obj <>endobj xref 0 725 0000000000 65535 f 0000619128 00000 n 0000676445 00000 n 0000617987 00000 n 0000594947 00000 n 0000000015 00000 n 0000000924 00000 n 0000619194 00000 n 0000633891 00000 n 0000658436 00000 n 0000633568 00000 n 0000656260 00000 n 0000632816 00000 n 0000646206 00000 n 0000619235 00000 n 0000619265 00000 n 0000595107 00000 n 0000000943 00000 n 0000001114 00000 n 0000619317 00000 n 0000619347 00000 n 0000595269 00000 n 0000001133 00000 n 0000003475 00000 n 0000632269 00000 n 0000640599 00000 n 0000619379 00000 n 0000619409 00000 n 0000595431 00000 n 0000003496 00000 n 0000006344 00000 n 0000631949 00000 n 0000635717 00000 n 0000619461 00000 n 0000619491 00000 n 0000595593 00000 n 0000006365 00000 n 0000009018 00000 n 0000619545 00000 n 0000619575 00000 n 0000595755 00000 n 0000009039 00000 n 0000010221 00000 n 0000619629 00000 n 0000619659 00000 n 0000595917 00000 n 0000010242 00000 n 0000014903 00000 n 0000635106 00000 n 0000666396 00000 n 0000619713 00000 n 0000619743 00000 n 0000596079 00000 n 0000014924 00000 n 0000017693 00000 n 0000619795 00000 n 0000619825 00000 n 0000596241 00000 n 0000017714 00000 n 0000021021 00000 n 0000619879 00000 n 0000619909 00000 n 0000596411 00000 n 0000021042 00000 n 0000025600 00000 n 0000619961 00000 n 0000619991 00000 n 0000596581 00000 n 0000025621 00000 n 0000031464 00000 n 0000620045 00000 n 0000620075 00000 n 0000596751 00000 n 0000031485 00000 n 0000035736 00000 n 0000620129 00000 n 0000620159 00000 n 0000596913 00000 n 0000035757 00000 n 0000039900 00000 n 0000620222 00000 n 0000620252 00000 n 0000597075 00000 n 0000039921 00000 n 0000043306 00000 n 0000620315 00000 n 0000620345 00000 n 0000597237 00000 n 0000043327 00000 n 0000047247 00000 n 0000620408 00000 n 0000620438 00000 n 0000597399 00000 n 0000047268 00000 n 0000053580 00000 n 0000620501 00000 n 0000620531 00000 n 0000597561 00000 n 0000053601 00000 n 0000057035 00000 n 0000620583 00000 n 0000620614 00000 n 0000597733 00000 n 0000057056 00000 n 0000057371 00000 n 0000620658 00000 n 0000620689 00000 n 0000597899 00000 n 0000057392 00000 n 0000061570 00000 n 0000634646 00000 n 0000665502 00000 n 0000620733 00000 n 0000620764 00000 n 0000598065 00000 n 0000061592 00000 n 0000066832 00000 n 0000620830 00000 n 0000620861 00000 n 0000598231 00000 n 0000066854 00000 n 0000072321 00000 n 0000620929 00000 n 0000620960 00000 n 0000598405 00000 n 0000072343 00000 n 0000077961 00000 n 0000621002 00000 n 0000621033 00000 n 0000598579 00000 n 0000077983 00000 n 0000083414 00000 n 0000621086 00000 n 0000621117 00000 n 0000598745 00000 n 0000083436 00000 n 0000088893 00000 n 0000621181 00000 n 0000621212 00000 n 0000598919 00000 n 0000088915 00000 n 0000095646 00000 n 0000621276 00000 n 0000621307 00000 n 0000599085 00000 n 0000095668 00000 n 0000102541 00000 n 0000621360 00000 n 0000621391 00000 n 0000599251 00000 n 0000102563 00000 n 0000109326 00000 n 0000621444 00000 n 0000621475 00000 n 0000599425 00000 n 0000109348 00000 n 0000115083 00000 n 0000621528 00000 n 0000621559 00000 n 0000599591 00000 n 0000115105 00000 n 0000121005 00000 n 0000621623 00000 n 0000621654 00000 n 0000599765 00000 n 0000121027 00000 n 0000127372 00000 n 0000621718 00000 n 0000621749 00000 n 0000599931 00000 n 0000127394 00000 n 0000134276 00000 n 0000621813 00000 n 0000621844 00000 n 0000600097 00000 n 0000134298 00000 n 0000141095 00000 n 0000621897 00000 n 0000621928 00000 n 0000600271 00000 n 0000141117 00000 n 0000148067 00000 n 0000621983 00000 n 0000622014 00000 n 0000600437 00000 n 0000148089 00000 n 0000152300 00000 n 0000622058 00000 n 0000622089 00000 n 0000600603 00000 n 0000152322 00000 n 0000155865 00000 n 0000634489 00000 n 0000664907 00000 n 0000622133 00000 n 0000622164 00000 n 0000600769 00000 n 0000155887 00000 n 0000160420 00000 n 0000622241 00000 n 0000622272 00000 n 0000600935 00000 n 0000160442 00000 n 0000165236 00000 n 0000622347 00000 n 0000622378 00000 n 0000601101 00000 n 0000165258 00000 n 0000170048 00000 n 0000622444 00000 n 0000622475 00000 n 0000601275 00000 n 0000170070 00000 n 0000174376 00000 n 0000622550 00000 n 0000622581 00000 n 0000601441 00000 n 0000174398 00000 n 0000176358 00000 n 0000622656 00000 n 0000622687 00000 n 0000601607 00000 n 0000176380 00000 n 0000180133 00000 n 0000622753 00000 n 0000622784 00000 n 0000601773 00000 n 0000180155 00000 n 0000184945 00000 n 0000622848 00000 n 0000622879 00000 n 0000601947 00000 n 0000184967 00000 n 0000189597 00000 n 0000622945 00000 n 0000622976 00000 n 0000602113 00000 n 0000189619 00000 n 0000193828 00000 n 0000623042 00000 n 0000623073 00000 n 0000602279 00000 n 0000193850 00000 n 0000198664 00000 n 0000623148 00000 n 0000623179 00000 n 0000602453 00000 n 0000198686 00000 n 0000204000 00000 n 0000623245 00000 n 0000623276 00000 n 0000602619 00000 n 0000204022 00000 n 0000208656 00000 n 0000623342 00000 n 0000623373 00000 n 0000602785 00000 n 0000208678 00000 n 0000213906 00000 n 0000623448 00000 n 0000623479 00000 n 0000602951 00000 n 0000213928 00000 n 0000219312 00000 n 0000623545 00000 n 0000623576 00000 n 0000603117 00000 n 0000219334 00000 n 0000223352 00000 n 0000623651 00000 n 0000623682 00000 n 0000603283 00000 n 0000223374 00000 n 0000227967 00000 n 0000623748 00000 n 0000623779 00000 n 0000603449 00000 n 0000227989 00000 n 0000232640 00000 n 0000623854 00000 n 0000623885 00000 n 0000603615 00000 n 0000232662 00000 n 0000237843 00000 n 0000623951 00000 n 0000623982 00000 n 0000603789 00000 n 0000237865 00000 n 0000242467 00000 n 0000624057 00000 n 0000624088 00000 n 0000603955 00000 n 0000242489 00000 n 0000245990 00000 n 0000624154 00000 n 0000624185 00000 n 0000604121 00000 n 0000246012 00000 n 0000250676 00000 n 0000624260 00000 n 0000624291 00000 n 0000604287 00000 n 0000250698 00000 n 0000255986 00000 n 0000624366 00000 n 0000624397 00000 n 0000604453 00000 n 0000256008 00000 n 0000261750 00000 n 0000624472 00000 n 0000624503 00000 n 0000604619 00000 n 0000261772 00000 n 0000265703 00000 n 0000624578 00000 n 0000624609 00000 n 0000604785 00000 n 0000265725 00000 n 0000269694 00000 n 0000624675 00000 n 0000624706 00000 n 0000604951 00000 n 0000269716 00000 n 0000274854 00000 n 0000624772 00000 n 0000624803 00000 n 0000605117 00000 n 0000274876 00000 n 0000281198 00000 n 0000624878 00000 n 0000624909 00000 n 0000605283 00000 n 0000281220 00000 n 0000285932 00000 n 0000624975 00000 n 0000625006 00000 n 0000605449 00000 n 0000285954 00000 n 0000291011 00000 n 0000625072 00000 n 0000625103 00000 n 0000605615 00000 n 0000291033 00000 n 0000295913 00000 n 0000625178 00000 n 0000625209 00000 n 0000605781 00000 n 0000295935 00000 n 0000301808 00000 n 0000625284 00000 n 0000625315 00000 n 0000605947 00000 n 0000301830 00000 n 0000307258 00000 n 0000625390 00000 n 0000625421 00000 n 0000606113 00000 n 0000307280 00000 n 0000312436 00000 n 0000625487 00000 n 0000625518 00000 n 0000606279 00000 n 0000312458 00000 n 0000318018 00000 n 0000625584 00000 n 0000625615 00000 n 0000606445 00000 n 0000318040 00000 n 0000323004 00000 n 0000625681 00000 n 0000625712 00000 n 0000606611 00000 n 0000323026 00000 n 0000328126 00000 n 0000625787 00000 n 0000625818 00000 n 0000606785 00000 n 0000328148 00000 n 0000334630 00000 n 0000625893 00000 n 0000625924 00000 n 0000606959 00000 n 0000334652 00000 n 0000339693 00000 n 0000625990 00000 n 0000626021 00000 n 0000607125 00000 n 0000339715 00000 n 0000344333 00000 n 0000626096 00000 n 0000626127 00000 n 0000607291 00000 n 0000344355 00000 n 0000348087 00000 n 0000626202 00000 n 0000626233 00000 n 0000607457 00000 n 0000348109 00000 n 0000352777 00000 n 0000626308 00000 n 0000626339 00000 n 0000607623 00000 n 0000352799 00000 n 0000356836 00000 n 0000626405 00000 n 0000626436 00000 n 0000607789 00000 n 0000356858 00000 n 0000360988 00000 n 0000626502 00000 n 0000626533 00000 n 0000607955 00000 n 0000361010 00000 n 0000366326 00000 n 0000626599 00000 n 0000626630 00000 n 0000608121 00000 n 0000366348 00000 n 0000370115 00000 n 0000626696 00000 n 0000626727 00000 n 0000608287 00000 n 0000370137 00000 n 0000371582 00000 n 0000626793 00000 n 0000626824 00000 n 0000608453 00000 n 0000371604 00000 n 0000371953 00000 n 0000626879 00000 n 0000626910 00000 n 0000608619 00000 n 0000371974 00000 n 0000376612 00000 n 0000626954 00000 n 0000626985 00000 n 0000608793 00000 n 0000376634 00000 n 0000378524 00000 n 0000627040 00000 n 0000627071 00000 n 0000608967 00000 n 0000378546 00000 n 0000382554 00000 n 0000627115 00000 n 0000627146 00000 n 0000609133 00000 n 0000382576 00000 n 0000388377 00000 n 0000627201 00000 n 0000627232 00000 n 0000609299 00000 n 0000388399 00000 n 0000393380 00000 n 0000627300 00000 n 0000627331 00000 n 0000609465 00000 n 0000393402 00000 n 0000397888 00000 n 0000627399 00000 n 0000627430 00000 n 0000609639 00000 n 0000397910 00000 n 0000403447 00000 n 0000627494 00000 n 0000627525 00000 n 0000609805 00000 n 0000403469 00000 n 0000408935 00000 n 0000627591 00000 n 0000627622 00000 n 0000609979 00000 n 0000408957 00000 n 0000411744 00000 n 0000627686 00000 n 0000627717 00000 n 0000610145 00000 n 0000411766 00000 n 0000417767 00000 n 0000627772 00000 n 0000627803 00000 n 0000610319 00000 n 0000417789 00000 n 0000423709 00000 n 0000627867 00000 n 0000627898 00000 n 0000610485 00000 n 0000423731 00000 n 0000429882 00000 n 0000627953 00000 n 0000627984 00000 n 0000610651 00000 n 0000429904 00000 n 0000435321 00000 n 0000628048 00000 n 0000628079 00000 n 0000610817 00000 n 0000435343 00000 n 0000441107 00000 n 0000628147 00000 n 0000628178 00000 n 0000610991 00000 n 0000441129 00000 n 0000446932 00000 n 0000628242 00000 n 0000628273 00000 n 0000611157 00000 n 0000446954 00000 n 0000451422 00000 n 0000628337 00000 n 0000628368 00000 n 0000611323 00000 n 0000451444 00000 n 0000456274 00000 n 0000628432 00000 n 0000628463 00000 n 0000611489 00000 n 0000456296 00000 n 0000462302 00000 n 0000628518 00000 n 0000628549 00000 n 0000611655 00000 n 0000462324 00000 n 0000468024 00000 n 0000628626 00000 n 0000628657 00000 n 0000611821 00000 n 0000468046 00000 n 0000471989 00000 n 0000628725 00000 n 0000628756 00000 n 0000611987 00000 n 0000472011 00000 n 0000478098 00000 n 0000628820 00000 n 0000628851 00000 n 0000612153 00000 n 0000478120 00000 n 0000484031 00000 n 0000628928 00000 n 0000628959 00000 n 0000612319 00000 n 0000484053 00000 n 0000488889 00000 n 0000629014 00000 n 0000629045 00000 n 0000612493 00000 n 0000488911 00000 n 0000493190 00000 n 0000629109 00000 n 0000629140 00000 n 0000612659 00000 n 0000493212 00000 n 0000499525 00000 n 0000629217 00000 n 0000629248 00000 n 0000612825 00000 n 0000499547 00000 n 0000505414 00000 n 0000629316 00000 n 0000629347 00000 n 0000612991 00000 n 0000505436 00000 n 0000511641 00000 n 0000629411 00000 n 0000629442 00000 n 0000613157 00000 n 0000511663 00000 n 0000517301 00000 n 0000629506 00000 n 0000629537 00000 n 0000613323 00000 n 0000517323 00000 n 0000520103 00000 n 0000629592 00000 n 0000629623 00000 n 0000613489 00000 n 0000520125 00000 n 0000525163 00000 n 0000629687 00000 n 0000629718 00000 n 0000613655 00000 n 0000525185 00000 n 0000530461 00000 n 0000629782 00000 n 0000629813 00000 n 0000613821 00000 n 0000530483 00000 n 0000533220 00000 n 0000629868 00000 n 0000629899 00000 n 0000613987 00000 n 0000533242 00000 n 0000537906 00000 n 0000629954 00000 n 0000629985 00000 n 0000614161 00000 n 0000537928 00000 n 0000543238 00000 n 0000630038 00000 n 0000630069 00000 n 0000614327 00000 n 0000543260 00000 n 0000547228 00000 n 0000630133 00000 n 0000630164 00000 n 0000614493 00000 n 0000547250 00000 n 0000550694 00000 n 0000630228 00000 n 0000630259 00000 n 0000614667 00000 n 0000550716 00000 n 0000553456 00000 n 0000630323 00000 n 0000630354 00000 n 0000614833 00000 n 0000553478 00000 n 0000553764 00000 n 0000630409 00000 n 0000630440 00000 n 0000614999 00000 n 0000553785 00000 n 0000555238 00000 n 0000630484 00000 n 0000630515 00000 n 0000615165 00000 n 0000555260 00000 n 0000557778 00000 n 0000630568 00000 n 0000630599 00000 n 0000615331 00000 n 0000557800 00000 n 0000559872 00000 n 0000630654 00000 n 0000630685 00000 n 0000615497 00000 n 0000559894 00000 n 0000561958 00000 n 0000630729 00000 n 0000630760 00000 n 0000615663 00000 n 0000561980 00000 n 0000564323 00000 n 0000630815 00000 n 0000630846 00000 n 0000615829 00000 n 0000564345 00000 n 0000567065 00000 n 0000630890 00000 n 0000630921 00000 n 0000615995 00000 n 0000567087 00000 n 0000569216 00000 n 0000630976 00000 n 0000631007 00000 n 0000616161 00000 n 0000569238 00000 n 0000570032 00000 n 0000631051 00000 n 0000631082 00000 n 0000616327 00000 n 0000570053 00000 n 0000573023 00000 n 0000631137 00000 n 0000631168 00000 n 0000616493 00000 n 0000573045 00000 n 0000576874 00000 n 0000631221 00000 n 0000631252 00000 n 0000616659 00000 n 0000576896 00000 n 0000580043 00000 n 0000631307 00000 n 0000631338 00000 n 0000616825 00000 n 0000580065 00000 n 0000583834 00000 n 0000631382 00000 n 0000631413 00000 n 0000616991 00000 n 0000583856 00000 n 0000584868 00000 n 0000631468 00000 n 0000631499 00000 n 0000617157 00000 n 0000584889 00000 n 0000585205 00000 n 0000631543 00000 n 0000631574 00000 n 0000617323 00000 n 0000585226 00000 n 0000587295 00000 n 0000631618 00000 n 0000631649 00000 n 0000617489 00000 n 0000587317 00000 n 0000589933 00000 n 0000631702 00000 n 0000631733 00000 n 0000617655 00000 n 0000589955 00000 n 0000592565 00000 n 0000631788 00000 n 0000631819 00000 n 0000617821 00000 n 0000592587 00000 n 0000594925 00000 n 0000631863 00000 n 0000631894 00000 n 0000636059 00000 n 0000640961 00000 n 0000646828 00000 n 0000656534 00000 n 0000658851 00000 n 0000665129 00000 n 0000665731 00000 n 0000667068 00000 n 0000632731 00000 n 0000633372 00000 n 0000634387 00000 n 0000634984 00000 n 0000635624 00000 n 0000675015 00000 n trailer << /Size 725 /Root 1 0 R /Info 2 0 R /ID [<6FF04A5E8744D689DA2CD93044B1C795><6FF04A5E8744D689DA2CD93044B1C795>] >> startxref 676651 %%EOF cfitsio-3.47/docs/fitsio.ps0000644000225700000360000253415113464573431015213 0ustar cagordonlhea%!PS-Adobe-2.0 %%Creator: dvips(k) 5.96.1 Copyright 2007 Radical Eye Software %%Title: fitsio.dvi %%CreationDate: Mon Jun 13 15:51:07 2016 %%Pages: 138 %%PageOrder: Ascend %%BoundingBox: 0 0 612 792 %%DocumentFonts: CMBX12 CMR12 CMR10 CMBX10 CMSL10 CMTT10 CMSY10 CMMI10 %%DocumentPaperSizes: Letter %%EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSCommandLine: dvips -o fitsio.ps fitsio.dvi %DVIPSParameters: dpi=600 %DVIPSSource: TeX output 2016.06.13:1550 %%BeginProcSet: tex.pro 0 0 %! /TeXDict 300 dict def TeXDict begin/N{def}def/B{bind def}N/S{exch}N/X{S N}B/A{dup}B/TR{translate}N/isls false N/vsize 11 72 mul N/hsize 8.5 72 mul N/landplus90{false}def/@rigin{isls{[0 landplus90{1 -1}{-1 1}ifelse 0 0 0]concat}if 72 Resolution div 72 VResolution div neg scale isls{ landplus90{VResolution 72 div vsize mul 0 exch}{Resolution -72 div hsize mul 0}ifelse TR}if Resolution VResolution vsize -72 div 1 add mul TR[ matrix currentmatrix{A A round sub abs 0.00001 lt{round}if}forall round exch round exch]setmatrix}N/@landscape{/isls true N}B/@manualfeed{ statusdict/manualfeed true put}B/@copies{/#copies X}B/FMat[1 0 0 -1 0 0] N/FBB[0 0 0 0]N/nn 0 N/IEn 0 N/ctr 0 N/df-tail{/nn 8 dict N nn begin /FontType 3 N/FontMatrix fntrx N/FontBBox FBB N string/base X array /BitMaps X/BuildChar{CharBuilder}N/Encoding IEn N end A{/foo setfont}2 array copy cvx N load 0 nn put/ctr 0 N[}B/sf 0 N/df{/sf 1 N/fntrx FMat N df-tail}B/dfs{div/sf X/fntrx[sf 0 0 sf neg 0 0]N df-tail}B/E{pop nn A definefont setfont}B/Cw{Cd A length 5 sub get}B/Ch{Cd A length 4 sub get }B/Cx{128 Cd A length 3 sub get sub}B/Cy{Cd A length 2 sub get 127 sub} B/Cdx{Cd A length 1 sub get}B/Ci{Cd A type/stringtype ne{ctr get/ctr ctr 1 add N}if}B/CharBuilder{save 3 1 roll S A/base get 2 index get S /BitMaps get S get/Cd X pop/ctr 0 N Cdx 0 Cx Cy Ch sub Cx Cw add Cy setcachedevice Cw Ch true[1 0 0 -1 -.1 Cx sub Cy .1 sub]{Ci}imagemask restore}B/D{/cc X A type/stringtype ne{]}if nn/base get cc ctr put nn /BitMaps get S ctr S sf 1 ne{A A length 1 sub A 2 index S get sf div put }if put/ctr ctr 1 add N}B/I{cc 1 add D}B/bop{userdict/bop-hook known{ bop-hook}if/SI save N @rigin 0 0 moveto/V matrix currentmatrix A 1 get A mul exch 0 get A mul add .99 lt{/QV}{/RV}ifelse load def pop pop}N/eop{ SI restore userdict/eop-hook known{eop-hook}if showpage}N/@start{ userdict/start-hook known{start-hook}if pop/VResolution X/Resolution X 1000 div/DVImag X/IEn 256 array N 2 string 0 1 255{IEn S A 360 add 36 4 index cvrs cvn put}for pop 65781.76 div/vsize X 65781.76 div/hsize X}N /p{show}N/RMat[1 0 0 -1 0 0]N/BDot 260 string N/Rx 0 N/Ry 0 N/V{}B/RV/v{ /Ry X/Rx X V}B statusdict begin/product where{pop false[(Display)(NeXT) (LaserWriter 16/600)]{A length product length le{A length product exch 0 exch getinterval eq{pop true exit}if}{pop}ifelse}forall}{false}ifelse end{{gsave TR -.1 .1 TR 1 1 scale Rx Ry false RMat{BDot}imagemask grestore}}{{gsave TR -.1 .1 TR Rx Ry scale 1 1 false RMat{BDot} imagemask grestore}}ifelse B/QV{gsave newpath transform round exch round exch itransform moveto Rx 0 rlineto 0 Ry neg rlineto Rx neg 0 rlineto fill grestore}B/a{moveto}B/delta 0 N/tail{A/delta X 0 rmoveto}B/M{S p delta add tail}B/b{S p tail}B/c{-4 M}B/d{-3 M}B/e{-2 M}B/f{-1 M}B/g{0 M} B/h{1 M}B/i{2 M}B/j{3 M}B/k{4 M}B/w{0 rmoveto}B/l{p -4 w}B/m{p -3 w}B/n{ p -2 w}B/o{p -1 w}B/q{p 1 w}B/r{p 2 w}B/s{p 3 w}B/t{p 4 w}B/x{0 S rmoveto}B/y{3 2 roll p a}B/bos{/SS save N}B/eos{SS restore}B end %%EndProcSet %%BeginProcSet: texps.pro 0 0 %! TeXDict begin/rf{findfont dup length 1 add dict begin{1 index/FID ne 2 index/UniqueID ne and{def}{pop pop}ifelse}forall[1 index 0 6 -1 roll exec 0 exch 5 -1 roll VResolution Resolution div mul neg 0 0]FontType 0 ne{/Metrics exch def dict begin Encoding{exch dup type/integertype ne{ pop pop 1 sub dup 0 le{pop}{[}ifelse}{FontMatrix 0 get div Metrics 0 get div def}ifelse}forall Metrics/Metrics currentdict end def}{{1 index type /nametype eq{exit}if exch pop}loop}ifelse[2 index currentdict end definefont 3 -1 roll makefont/setfont cvx]cvx def}def/ObliqueSlant{dup sin S cos div neg}B/SlantFont{4 index mul add}def/ExtendFont{3 -1 roll mul exch}def/ReEncodeFont{CharStrings rcheck{/Encoding false def dup[ exch{dup CharStrings exch known not{pop/.notdef/Encoding true def}if} forall Encoding{]exch pop}{cleartomark}ifelse}if/Encoding exch def}def end %%EndProcSet %%BeginFont: CMMI10 %!PS-AdobeFont-1.1: CMMI10 1.100 %%CreationDate: 1996 Jul 23 07:53:57 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.100) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMMI10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle -14.04 def /isFixedPitch false def end readonly def /FontName /CMMI10 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 62 /greater put readonly def /FontBBox{-32 -250 1048 750}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA0529731C99A784CCBE85B4993B2EEBDE 3B12D472B7CF54651EF21185116A69AB1096ED4BAD2F646635E019B6417CC77B 532F85D811C70D1429A19A5307EF63EB5C5E02C89FC6C20F6D9D89E7D91FE470 B72BEFDA23F5DF76BE05AF4CE93137A219ED8A04A9D7D6FDF37E6B7FCDE0D90B 986423E5960A5D9FBB4C956556E8DF90CBFAEC476FA36FD9A5C8175C9AF513FE D919C2DDD26BDC0D99398B9F4D03D5993DFC0930297866E1CD0A319B6B1FD958 9E394A533A081C36D456A09920001A3D2199583EB9B84B4DEE08E3D12939E321 990CD249827D9648574955F61BAAA11263A91B6C3D47A5190165B0C25ABF6D3E 6EC187E4B05182126BB0D0323D943170B795255260F9FD25F2248D04F45DFBFB DEF7FF8B19BFEF637B210018AE02572B389B3F76282BEB29CC301905D388C721 59616893E774413F48DE0B408BC66DCE3FE17CB9F84D205839D58014D6A88823 D9320AE93AF96D97A02C4D5A2BB2B8C7925C4578003959C46E3CE1A2F0EAC4BF 8B9B325E46435BDE60BC54D72BC8ACB5C0A34413AC87045DC7B84646A324B808 6FD8E34217213E131C3B1510415CE45420688ED9C1D27890EC68BD7C1235FAF9 1DAB3A369DD2FC3BE5CF9655C7B7EDA7361D7E05E5831B6B8E2EEC542A7B38EE 03BE4BAC6079D038ACB3C7C916279764547C2D51976BABA94BA9866D79F13909 95AA39B0F03103A07CBDF441B8C5669F729020AF284B7FF52A29C6255FCAACF1 74109050FBA2602E72593FBCBFC26E726EE4AEF97B7632BC4F5F353B5C67FED2 3EA752A4A57B8F7FEFF1D7341D895F0A3A0BE1D8E3391970457A967EFF84F6D8 47750B1145B8CC5BD96EE7AA99DDC9E06939E383BDA41175233D58AD263EBF19 AFC0E2F840512D321166547B306C592B8A01E1FA2564B9A26DAC14256414E4C8 42616728D918C74D13C349F4186EC7B9708B86467425A6FDB3A396562F7EE4D8 40B43621744CF8A23A6E532649B66C2A0002DD04F8F39618E4F572819DD34837 B5A08E643FDCA1505AF6A1FA3DDFD1FA758013CAED8ACDDBBB334D664DFF5B53 9560176676ABB71BBD0EE56B4CC492C0652750227CEC7B86E4740EB7B8775564 332769DD30794E501BBB0E4E5CB665F3628E10B1137CC8BC5C0A64A310B5E27E 5FD6E3B04DA3914C15987E638A72790AF4073CE9CDBF6E3C749CB4DFF9C54951 A58C386C54BC4E98B102B5E91E8567D2EEEF048F2CBD5D243701D20909290B4B A3083F632D8552D42DEE0C69A4B14D8B15AA082DECC12B2ECAE6F663E6D09F81 EE2979EF41FBF12C9D8BF23B77E0A20088EBD107C5BF9DD6F03FFC3AB65B69A7 54953327E1D4AEF5A146273392BBDB321D4CC9A8FFFCFE5C515B466E21546CC7 C6209E5A76F916B03DB98BC6CED334F33E7B373D42761696F5A876CA6F93F16E 15A07E2E102148CA4F62A99C 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMBX12 %!PS-AdobeFont-1.1: CMBX12 1.0 %%CreationDate: 1991 Aug 20 16:34:54 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.0) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMBX12) readonly def /FamilyName (Computer Modern) readonly def /Weight (Bold) readonly def /ItalicAngle 0 def /isFixedPitch false def end readonly def /FontName /CMBX12 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 11 /ff put dup 12 /fi put dup 39 /quoteright put dup 40 /parenleft put dup 41 /parenright put dup 45 /hyphen put dup 46 /period put dup 47 /slash put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 56 /eight put dup 57 /nine put dup 58 /colon put dup 65 /A put dup 66 /B put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 71 /G put dup 72 /H put dup 73 /I put dup 75 /K put dup 76 /L put dup 77 /M put dup 78 /N put dup 79 /O put dup 80 /P put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 86 /V put dup 87 /W put dup 97 /a put dup 98 /b put dup 99 /c put dup 100 /d put dup 101 /e put dup 102 /f put dup 103 /g put dup 104 /h put dup 105 /i put dup 107 /k put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 118 /v put dup 119 /w put dup 120 /x put dup 121 /y put dup 122 /z put readonly def /FontBBox{-53 -251 1139 750}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891 016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171 9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758 469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8 2BDBF16FBC7512FAA308A093FE5F0364CD5660F74BEE96790DE35AFA90CCF712 B1805DA88AE375A04D99598EADFC625BDC1F9C315B6CF28C9BD427F32C745C99 AEBE70DAAED49EA45AF94F081934AA47894A370D698ABABDA4215500B190AF26 7FCFB7DDA2BC68605A4EF61ECCA3D61C684B47FFB5887A3BEDE0B4D30E8EBABF 20980C23312618EB0EAF289B2924FF4A334B85D98FD68545FDADB47F991E7390 B10EE86A46A5AF8866C010225024D5E5862D49DEB5D8ECCB95D94283C50A363D 68A49071445610F03CE3600945118A6BC0B3AA4593104E727261C68C4A47F809 D77E4CF27B3681F6B6F3AC498E45361BF9E01FAF5527F5E3CC790D3084674B3E 26296F3E03321B5C555D2458578A89E72D3166A3C5D740B3ABB127CF420C316D F957873DA04CF0DB25A73574A4DE2E4F2D5D4E8E0B430654CF7F341A1BDB3E26 77C194764EAD58C585F49EF10843FE020F9FDFD9008D660DE50B9BD7A2A87299 BC319E66D781101BB956E30643A19B93C8967E1AE4719F300BFE5866F0D6DA5E C55E171A24D3B707EFA325D47F473764E99BC8B1108D815CF2ACADFA6C4663E8 30855D673CE98AB78F5F829F7FA226AB57F07B3E7D4E7CE30ED3B7EB0D3035C5 148DA8D9FA34483414FDA8E3DC9E6C479E3EEE9A11A0547FC9085FA4631AD19C E936E0598E3197207FA7BB6E55CFD5EF72AEC12D9A9675241C7A71316B2E148D E2A1732B3627109EA446CB320EBBE2E78281CDF0890E2E72B6711335857F1E23 337C75E729701E93D5BEC0630CDC7F4E957233EC09F917E5CA703C7E93841598 0E73843FC6619DE017C8473A6D1B2BE5142DEBA285B98FA1CC5E64D2ADB981E6 472971848451A245DDF6AA3B8225E9AC8E4630B0FF32D679EC27ACAD85C6394E A6F71023B660EE883D8B676837E9EBA4E42BA8F365433A900F1DC3A9F0E88A26 30F40A9C74C8E7773BE601C0E245E7FC10C02939848C3D28D823057B3EA23EC9 E2BFF7851FB65FB12A4318A21D2C88EF9245D4C7BF21C81C4FC4CE0149E96278 48F7BF97A5C3691E6CE038033AF54DE91D320EABF2B2E98617FD4145BFE5EBBF 1A5634DA07B00257A51966FFC009CA416D37AD30F4BEE6D72AB64CB2D62466F0 42D66D6D33EF9107272835EA9C1C8FA04562864BE684FD5F8E6DF19916FF8346 F39F3E1FA2975B5CED24EB160FEF6149954F76C359E9D15A209EDD7445BB6303 6AFF9E1373CDD50B93DB137F3896D282F5C04AF0AC84AA02D5421A73E3AFB735 80EBE676C2870822BA89F4BA85034D6431BC4A44CC264DDD10EA146913E9063B 038BD787A659C6A88C42FD5FBC51234664A8A1621A38C73ACB7199592AA5EA84 B78BB5DBA7CA43E30CA8D3957CFF478712556EEAB1990C97B9BAB47ADB75E327 B361D3039A3629B09EB84CF814773858F1D354AD8D526E85EAFD50944CBCE042 367D1153D7B4EC4DD597DB0F57379DD63304869DEA4FA008D411E30ECFD62E41 29F51841A9E07E066F06BB4829F87B7722562686FB801D6690F73233053B2EEC 473B9899F284296BB634358A22DBF361C2A57C59438C429EFB04B80BE083E238 A6749D6AAD1F17F318B880D26D230B86F80A99C27B87F7605DE40A0848543DE2 4AF7D5BF61CA6B00FA156DBB9ABE7BB0EC79CE8FD5A2FC5BE17050F2A74E8905 75A9982E12698B289E2213DAFAAE40DD22B424562D7417E8B82A5E3DDA814669 D4CC949397B0DD2B0787016CB8FDFD09318719D7C47DB72E094C12C6DF3EDE88 663D6357CE7BFE51FD4A93887F022E3A22DCBE39CA86E104CE54C05AA0B5E469 0AB9DA29D19ED5E783225ECD1122BFFF5E4E63488FF215A9F555C190ECDAF130 B34E6BFC66AB1F7D000CC09CA9872299E23EC9B0A8ED04135C982978B9D7C4E5 F9C7968B540837CC667196C7B40F579E8258C8C7AC569AB787BB112C046D0068 86AEC034183A3DE02FB82C2CD3E252746C012F2385493F59DDEFD5AA95A26C61 BA64D85CE90339A0C19F538C6E0516513B9E7661505AB81F45AEA04618CEB379 12F6BB94E2812F2B3C69BAFC9135B439D74C6A94C0317E1B2A2EA514536AA990 7B94105AF7DA13148A807CB2F679DBDEE10B09BDCC8BDC7365166C910AA450C7 4FD88CA8BB639F1BA53A4B108D2E1633C5DB38E64DF4881E0FC1118559A078E8 52A0E2A87F98461EE7B0B56DFB6C3F340430E3D5C41C12141E4332951B4DF03A 6824E8CEEA4AE8AC9F51981184287EC2710E4A51DB5E09DCFF4DFCE6B82A0B5C D2E658D38FA7B2854778650A78AF230E97A4C195865C404EC18A5FA99EA30FE8 755EE5B11397D3CCAECD81EE3F3D1EE1A1B1FD6B669270912948134ECBA3D5B3 011CD3286DD6729DBCFC9A8FC93356BC70A876AB636E5C8EFA89881D3A6E0592 D4CDDBBD21A67033AB3354BA1333206874D2F7D0E571AAD845A96057F005F730 C98EBDFB006EF8874CC386A0B611389F9CF5204C65AD951306B0E090BB287EF9 CB7DB38F2A58E2ED6813F2138922E28FA44792E5C57A70C6152B4A6E73462F8C 869886D1E5718C85F1CD5E7EC4BD73C6A4E3218A7118D42CFE42BB83A6B72729 0E096EA902F81330771203309DEA91A560B56DE63911EBB6147600BB9B6A5166 A818B7B8CE58279E22D776B2CF423897110CFF24807319C84A2063CA464C7616 8260B36124AFE08188795E334864712574CC3DE12C3F0962D51734A44289BFE2 2525F5D641EF82F25C1EAEA56C621525EC86FB6D09D99941D18094B7D77719E0 3957294DBF2D221A49807B44323098D816A21C8F1BB888BC1075E2D6FD770014 829050B6F8E297853701C467BFE76C1E52E8AFD5AF67B3FAD5A608C23E925F0A 87E7F56B0D05F4D4276CE619190A983BB19417E280B53060AF777BCEA0D1F4D1 B803687D9C2050D0B2EBF3EFCB9FE42E02AFFA5233A49D27550BF8B32B1A3A3D A8F58FC0FEC58439D12CC87CEEBED10BB6D9BE84DDDA7FE7A7283D2639212CEE 2DA539DE06298BF452F896FE103A4BF864E5399C3F220FFFD82AF1975FCFA69B 8C9782842F016682EFAE7269A34FDC5ED188E3E6E24FAA0345D9558B19521D16 9FB47306CD1D15F36C9386347FCC9906A5420F4F6E030B007DF4D311B8E102DA A653AB0BA300D9467B092165B016C6F28E8D417E1B93A6A176329A67C5E0FF79 167F9CD8E2EDD33D5B11348EC7BF4C88C3226377DBA6C4723CBE67A7118F3CBA 34EF78E08A4211C39205325D138840E3F3FAA9CCEE74569B8F59CCE7E7D35D3A 0999DB04EC83483BA245883D764A3CF556949BE4B121C6483ED26D192405EBFF 089A97C4BA9649916F1A922F48CD04B7338EABDAEADAC52F42CF48272EAB9192 C17906F59CD98D5A54443BD474385AF6B51B9C14EA8AEA27AE3473DC12DE901B 42DC378872B001B2C929C54117E6EDAC6202BF1028AD2793FEA3620935539071 9BA89FBFB98229EF30B0382D9D603BB451634BFD08901432F16B31C9245D3645 28456E44DC8B6C9C052B9446107116AFCC2EC0F39F0CC7B5E146FD9E995594A2 DDDE2BD3DDAE13B9659969623BDE57219731BD3893B63B77D5218B94FF535FAF 2595C30EB0A003B144461C8115C5EC93595B4FAC2BC0D084E326E1F2CD14AC0D D9B4C1467961E2FFC04BD2DCDC1A16E9582653B1CECD98AEB6ABF1E88086FD2F 347774D628A4E70B6803EA481996C07D6D84661D003CF3C92D32791A06405C2D BDDED14EA55744AA956D04CADD4B2F5A0FBA5D29CFC84CC54CBCA53B19FBB69B 6199174100938FC1E16E7EC73BF85B058E235E282B17116250CC9965706D80F4 EAE76E2F7E96E901CE29AFBDE9CF9E19CC2432DE75B4E67DBB7BF62C6A3A0C4A 1800F457B745F18AAAACAB8DEA973869EFED9464631EA2CBE95F78133B4DA06D 394AB1CB50B6EED8E868AEA0EABDB783EFB7F0431A450D9C48492A04BFE3A0A7 9BFDE3B9DB2235EE46EF0D3E754F95819B6FD407E974856C83228A3C2A076966 02E3F0F2F27CAE5C820FCF3AC5FF38C715B3DC3CE9AC77FB13382D2B606F469F 768D1B82CE3D66F1AB552902B3BFC8E1B3A5A45D3C3D914D304070AAB6C49393 028CD984C44C2D8DEDEB61AB45A4B2237A236C0D3088AAC5A7F89EDFF9A09639 8B1887E2CB29D9E9B5630A45879069E58DA52E5603D026339E637D7B83E6550E CBD4349FB018A01749E171C987C30F8C36651501653A4421869F04A9B8BF792F 41B8D1E9F9101B658EF726DE26BA616A20A667FE7B571F68FF3BC77B127EF315 64D1D39C07799B45A40CA2D4FD81633368EC9654282A91B8F38066B3D781E8EF 3DCF9CB050096E84E8DE000568251ADFB56AB4AECF2D29BB47110D277E5A1634 D2813F9239951645D505C53CA91481C2B0F9DB72CC4C3EBB12D2BEB7B4201C23 BE8EFE99CCC6A0D520F6282F0876E6A69CF5ED38AAA9066196A9456C5DEC58F3 341797EFFF3040BB65E2479165581DD67AD36EDF24DA29DE341106F258C5FEA2 D538201FBB6C0C3A132487E01488FAF2EE5A61E7079547278DFA812C5D822454 F5B0E67620BEBAED135E63C8A55B29F685CA3CCCCBA06E2AEEECBD92E29B985A 23B93078BF8A6F41125529C1C171D7A8C1AFD9017CC089570E45E873E74D7FEA 7193C263492D4A6E73C65531C324FEA1CF9C4EBB6E501562EAA0EC4DA6C5FF7C 49DAFA4DA93D9F35F06616002A66468D7ABF3B3CAFE293A7CE0D1034B971B063 EF162C62E480D259E5AD6383DDCCB0F2CE0059E7E04681106CA6378D59F3EEE7 0AF84F11FCB538E4155CEB05D48678FBADF22F99B9D6589629FAAA181F78BD79 9D97F53E9FC10919970EF6CECCC6464540FB4A8EAD144B5662A4B0BAD31DEFA4 9C1F280C18BBB0FB005896075E3F4C52C9F11A2C0DD60CFE581C771A72273053 796AB48AD2500600E3355CE0C91E26DBF8C135C6B12FB3B2E89B9011CCAA3D2C AF8E2F38BE8D2BD82966B0037DA0B64A955AFC5181D3F2DA0F4FAE47875B5D3B ABCF48A2C3D1ADF69F5A3BB51D456B19085363318C3D371221A7319EDA644EA0 C30EB56AF819CAE5DEA47A7495B463E388562FB76C94621CA7F0DF9FA6C080EC 9F8AFC21AAAEAE2359869EFEFC8BCC433B683EE1DBE927463CEB19CCBE08ACA5 B925E88AB69BF8EB7A0781F57FADC2111659F9A480B8B4158806CDBFD950C4A7 0D792235486658CF8A96B0FDA2EE36468788225B794AE541683D2F5568B1239B 2956E585AE96E5C0FEF1D632895B3A0E0FCC57EEDBAF40F395547F77D7F4F6D5 23066F8B08FD44B1F26E89083C70FF24CE2AA2168AA8B09BDFD763286A243BC3 0431A22C8CC88A524E2C3DB01F1B65A1540A8C2EF5CEA9303DFC3F3CDB20EA23 600F870EC83EF9992A976ABA1D086EE4018DD3F7004301A7A431694DAAB46B29 538000BA28F999C70C3F72C1DB5CD7B1A4FDE6A0A87BA98332EDD260D30CE677 7176F2FE3D12C3434985AB6CC12AB6BD4872F5376AE6E6CA9C4871007D6DEF15 6D15C96C0433ACFD3AD8DB22100ED3D696FFA7DEDDA0449A14F435E9868DC2CB 8C1306330A68C38FCC010442A51DDC47BBFC474BCBA5A404A5705A0812B1DDB6 CDE7EFD4D833C7DB0D4C91561C7369AEF96E849D23FBC55429427FDAF7E2DEFD 18E2BA193293C0BF21F7241626E30573F2BB36C0BDF9A1065B2AE02DCE822156 0AD58921ED46E65C40FE54C0F9C58AD8531536208F5A6F538836B74090AD8191 486F29CED44DF9C4A547FDE7C40F833887845BDDCC68D84F2F445CD4D871FE87 52681595A6D0DC3FE1E2B00C53AD686E866FEFC39F6C7FFCAFF8191C13F7598D 3EBDCD33CA548FE31C67AA26568BE071A4D5750F9246695A4184042DB2FB0680 C0E1FF57CF2E9E360828CCE1C7F22D5CC921A995DBAE0D2469D4C5147D607923 455D9390580E120416B814A310E5588A0D54160728CCE53712D266C090F7175D 96725CE1CF85B0E3772347D9DB0CB282F04A2CE1A1358675ADAB4F5504554189 B141B5FA5BE5D2DD4FD88C91AE99E6504365853F95620C378657DBC98D06A4F0 38DAC9CB25A11D8A9D224C9CAD1369245B4A8E19AA55523BA8402CF056FA7818 DA762A53F9A2F02F17E23C97A38C14ECC34B985B1EABF9900698E122F11EB4AA E5524C3DA713271DAB8969B693A7CBD313F28120C7A68F4B3037AC043C992D7E F5829F11930CA70B580A161635228ECF20C5BA4D3B1587FD7A1D52C2530FAF7D C2C9431C7B4521296D391A3436642230E0E5D74E6D5E94277373513DC443B09C 0BC80C1EA1F22A7F2F4CE3627E852B5A636DEC22ECE7FE76F53FFC41AAF1B490 15E8060C6448F07997AE8D012B640630D72B11D77FBFF41F65B6EE2D70345A6D E6137355349A55DEA19D1DF5551B54F1E2F57E85568954AF23B2CA6D60859F11 2BCF6FB935BC106B9BBCD8E8DD551D82C7D348E03B71BD4E052686F1A0D59091 EE647EC64FBF77F558358129B938993D0F75673B45F41D2EDE54FACD6DDEF68A A8D55C257CEFC0E0D382C60A73C49DEC67AC68E5066749A1C00AE616A2C71A4E 14A95123F58FB1D940E2A0E51EFA67C2F2BDEFF85376D211DD8F15D43F2CCE7B 47B0CE25CEF1D450EFE17476BC3CFF661C1EFFC82E80E0A69FCCB25F39E51454 E53912FF49EBFB3CD9593F6FAE81F1F0A9E167282286F8407F9F0023538D75E5 76171E5A7005F053ECA82809C7073A1A480198BAE0085BA9BD1EF107D4324B24 F96E24BB4FDD80B195546854618282F770631B5F3FEFDC035E6954AE76304038 9ED525495644EA353E32F65140DEDEF41CD343B5333954D3A4C413BC3365B0B7 3ED0DB1A27C60237A0E82407753C1F9817C4A0D7F07D328FE2216B34CB8A233D FC5A420704C8F1D42B57E69424267E5BFA8C2AE65BA324262DDA2812D893050F 7D50D4487A5BBE53D7CF041DA6EF76A659DE8EE07DE413E940AC2160C994648A 6D0D0A59860B4080977C18CF6540B5F5B3B4DB52EE9CDE105D965E9FE5999208 02CFC8639767B033A3EBC2C42066F6E7CE3B8D6E2F25030D14957F7FA8E59A7A 5685A8A8479545C373DE7778A5A65D7ED6139A2C8FADBE8AACD08D56C42D11E2 CF01E2D78D4301556A8D7AFFF7642B10A36E93546EC8B2059870C472F5CD463C DE1DBB211CFF689095891B9980D9C9438FF7EC687DA72C548502B5EA0FFDFEE8 D982B934E7A9F4D62428FC6719894C0ED4B0040BBA5D0FCBD0E3D80F2E245513 4C78489DB71F2EDF17CEF7784370D080B75122290F59D4B4CAA0484A809CAD27 94FE9EDD79994079695C3DC4440C6B2FE4AB0129F2514EFFD8615425F7E74567 D93EADD0FB68FD8C6B9E3C1275F4FD32B8CFF3D8D04B185E2D702E46289456E7 F6A2A0D83DCF29862BD08AD7AF05E3380AEE207F44E5B8C11A89E954AE0BAB81 C5A8D1449693A0E5AE02D0AC8D1BF1CD96DBA29A747CF41292027ED8C05DD325 8B92300CFA2FD33F14CEE073F8CA93E33BB952B2E58E666B1E12CB5634136777 6D155B1855064842120EF87ED8B1CB6C95D74EF97C0B85DE90E266DD14793F70 27038C774A64E5757DE6FFFDE5CCB2BFA4B771BD7D02FCF0530E0768DB74FA39 2BE1C80A37A77AAC1B4972AA0335A6E51787781D482D01CCE8CD8FC732BFB1CD 69E5BF80E44F7F484277E5D8B9611B8614ABB9C8865F26DA08108D355EA7B451 2364F41F4EA9BA074CFD14377B092F4274F18F42B30C83ACFAF87513E8CC9716 7ADFE45917E3B9D034F4ECE1455318BA74C68CD534B7DA3E3C1C94A10E7F5738 46EF5ABAA7F58C0CB25A1F78F8FCF83DC2FA4F74B7F01E3141E1886C457FD285 A44A1A57E968358BC29CAC2BC79CD14FEF92F522C9873ECFE82A01BC4191BAA4 5D5212A7AFACEF600F738F4E6C691BD5D8D6F494187F43D42B1E876E6B12A02E 8357B376CA901EF9945D7703E28549C291731B78BC185AB2D3EA810CAB3A500E 2D2DF7934A616B3B0705F0928D97A742DB11392C51901CAB772C44113F1A5873 54C74B49EA48DE55089AFFB75B288185955DFEF25610BEFF0789A40381A1ADFB 95628B44B810062EF1AE97D6101B13B020276040FD886422F69A92254B222986 500384843D82F4A706D5160CE4E35556253C2B73B539D101F166873974CB1819 26D751F2E4DDA3D93FC7128C2515A75C676ACCAF8C07E2863951ACED319EB268 87C5802B7C54317A414BF9DA26EA1B53C5A8A9536F54FBA1699E1FEC82403359 66741ED2B98756BD5DE594C8CB2E0C24BB372EB2EE6F7910940CE6EE8D2770DE 6343C52B4065B6AC1B3DE9C4575B8061DE6F05961E68FE6527BA66EC51AF4948 8CEEC967F6E376BAA1DCCC8D50DC72C76DEE3644F890D4DFAD6E4B9115F43F9F 25CB66AE9E46331F5233609A390523BFD6D642F6BEA65B7500C3F7C28D03C2D8 A3B5C7ACCEB8147C62865F8DD2F844F294E8AA932F5D9482FE0A1461EF74BA57 BF1848B7CE0CD572A583A6837F9D27B6844E62DB08DF1AC678861485877454E2 FADCD5C87B57340824621B978982092C1334625551D36494A1E0246336B4104C B823C8ECEB49EAC4F8360867BA86FA2929918ABFEBC195C559BAF28B2396DE2C 5A550C3A17CDB40C4E2A4683590B0BBE2031F525216083CA6D9DE3247D0B77A7 7348225427CBD78F4C8DD795D010D66B5D16F513066C021F54DB36BC6902190E 53470B96270C8DCE6AA8F836F926EC56E5A4C69BA37EEAAF22AB1D09860279BF 97935068A4D11319146344CA8CA2B87E81D08345C699A81F0F4BAF56E39969AF A8094449E595CFFAF5CEC0540940DBBF79273B13D1A884BB2C354509CA95E582 34284D9EE6992D5F3D2FCC09F99D1B8B31B59E651C17A174D98E2AE214332D44 9F3769402AE4D2E6707450545C6A5322637648488BDE496DFA32BEBA617BDE88 D07982B6948B94C91247FAAE6AC69A8727FD4AF3154C5F6B435379119898DC8C 3110AC36907AA6653E28D292D7AFE2C3E54B6D29800BC7176B4F0D00E09904D2 F5DF5805E4C8E4348F017ACB5C62DD8EE155F56AB87315F95BF1A7AF147B71B6 AE4952942EE6676E491E9CA622504DCE2ADC678AABB16886ED89B6309EEEEE6E 08D8133000ECFE0BE713E5D144DF17E98DDFC61C688E9A89302773835DDF9254 A4985D6567AF8DFEB4335E1CD6B9D7DE23B009A7BEEED3BE0D7F77BEFB5BF2A1 07A44B1F9CEF1EEB6D3F49804D6BC47AE26DF2F878E8ED4861FA691AF085A254 688418486DAF652BE04054A8A8CE7EB42C5B30146C3ACC47502AD1BFB1A92DEE B3D317D4D2FB276BF7C4F11678AC10CBB01C3DA178A5C101BA5B995D18136261 EE1EDCBF883B6BA4335CC33BCBB116EE70B1372E01E64DCFD534672D9C84FBDD 79C8D2BDDE8D5C55F852E41FB5C1076D91B0D5C0E13F70B66904E08243EB3287 C6257181962EF755E7A603AA23D63BCABF36F18684582182CC20CEA4F1DA0665 1A8F1A4AF7C09F0351460919B10537E19A0ECA06DD9C00368137115979D3058F 635AEB09C1C561D020B5E19358F216B8D17582A518FDEB4AD7735FFA2C746D5F 163CA092531649865A1DA92CC8FDA32490826FAF4A9BA50653C2C3667F61D880 D6523745251E5BADE8DB233EF3A62E7C92F21AA31618EB0A08D47F406FC07C54 FC04404F5BF9DF6D2D53334DC93138323AE39E95F9CB2260995970E173C997B3 414701687EFD2B2088E50ECBDF14FBCC612AEF323683D2800DC9B9EB054B8CF9 3295728A29DFA6E22A98540806D6C89C34B188C29723DF52C50BBD4EF02C887B 335A72FCC0F7C358AE98D26FF44F1632CAA1774AE6F8852EE8BC262FF77A2E24 8B8833B7C9F9C65F94C889A06095776BC75361EA184FB5C5C8BA401A8D2D9771 D0D71BEADEDFD70EF617B92FE12FEAEAFA5F6013A28DA3C666BEE78D103C8947 3901E3B368BEE322935020EEE395B9701F65615D510809D8AF431537805E0B5A 908D1B2C659582D0E54294B5BAFDF5FF482712179CE8F6820C3E72A73EE0A4C2 43F792139AE3F8AB7A8D22A6D4C222B2B63CE37F0431157AD317A63E05067704 85F00AD9B822B1506DA0551ED23099D53CF6E5127B5AB291B33EFBD26C21E9AA 4096BA233B76B87EEFBBF8721EA8C37B933C5D901C4E451C1B05A5920CDAC618 F9431CEED497EA77D36CDF497354E158B9016CC888DDE52EF00302C140B29C1E 392F5974EF8EB272C054F3906F5D0B493C2478AEB0A83E469850BF76AE766B4C 884B10B49EDB704B33AA96020522C5218D7258210572E8B274FBB05B51380F5F DD14C84263128C4D037314263E8B1ED48C816F06B39E32D5A894E114F9B1A2EA F255A824E41E768E70ABBB14964CA00C9C3EC281D14BCFB681BDC943BCF320C3 0DB0B18DB7FDE42A3A2DEBF1746BE74E18BC0A8081DFAFDBCD64050ABBBF3A66 72D0D7CA15E88ADD7F0A1E1F70D397D838AFECE3352FAF0B149D5DA940B518FA 9594FF7171A2A6B77CD9CF96143DF0B708EF569CC135A2240343B3B50633437B BFCB0416AE4AADA1A480CFC134C1DBB9472279C4966B99B473272AF27150B683 09C57E73A83E7339B022F0388640EF9561C518AF312EBF0EF120CDFFF9F193AC FD6FCCCC337922405224C8015431BA7610EDE19CE9176A6C1F552AC7413ABFCF EAE1FC65D1F56917B125E498E37D2E7AD170F0DB13DFD8D430523B774DF5B2B9 971F0F78F0931E81A848B1E2D901BA1A011957B56831AA755DE617F8A40B843B 470D96140340CA72B45C2BF0C0CB635A6D7B25A084AAD2830288ACFA119C3AF9 5ACBEE18F38B244B7FD29210A7BF1D3A5EBD17E2B268C36CF439120B1947EBC2 CF769AD003B5C178F5FBC3AB5D901682CAF6AEC1D66B3F3DF730C27F09430EF3 81F32BE8B781338BCA00F8BB26B89804E750BEB587E558F48AE34A0516B1B4F8 342A97EEE51D352EB39C2819A200790E5BEBBC50EF4FC2DB326FB61F969EC2C0 98CD4F78F741C11D2744F26B443302392316A5C80A9ED122C7D27C1C89D098E3 ED365F63F5F2DB3889A4EF86587722E0059123D95D3C471751D8D8E84941BB5A D14766DF319F648FB6FC6B39E94450BBAD6F83E43B92B72B5D4F6804031782D9 9E40AAF10A291F048E4A0B6E726B1E81942615DD0A862087048BD3B261E8F8A4 25D82D60D90E58A9F3C03CCF9593F0A8738F397E058AC523438F58B2AD206B85 98B61EB8536BDEE0219867CD40F10F622EABC2D52297B257EA0DD929B0BB7938 158C6A6BA70514C27CAD1F310C493FEFC4EBCA10CE4F77686C374E1125F69855 9869DB3887046E82DA5EDDBDECABBEF1E050B26A91A6CF23D3F06B4206D5573F EDC6CB4DA302A355CD3CF80B54B270FA1844FB5DA988D08A754D30CC5F8DB71A 5AFF8F08A67CF1DF916E3370D961EBC802E2AE36B25F0B2BD2F01DDC9D52E45E 18D579D5C4A750F27262D2364A1CB2BB36B116626A9C1B6E35E22E81FF695E1F 713B9461726F5427EBABD116AF543A84981796A6FB49F72BB7AEAB3ED5E771EC D1823DCED5EE170126069B5369BFBE2C1225EF0E5757B2ECC2360F8EB34EE3F2 5F39660B7F714A82EFF3A61B7C9D26A32FD4C6EEEFABDB9914BF7DD6FB240198 81F121394D0C2386738E343645A9CE8585145ED6957EB06466D5037B1FB3210D CF0E79E0920167C5DBD605FDF8A66F96CE741DA7DD85D629280681BFFCEF027D C9390E2EE59F24B714AE30A802F112BCA54AB3FCF419F65B4B27CB7A543B55ED 350D9BE596B15AD6F79730DC86D82DD075390869201CD6FA2D22F77FEF7619AE 6FB42C939079757BDD06BE3B8A7CE60AEA6D1B753658F858AA2584D4A4CBAF7F 0D701BBC0379973E5753B848BCB7CF56FF30E5AC9D2E83F33B4D87DA222F1306 1877A2D810123D951F5CE12B17862EFDD5A86DA3A3987D973F70541D70B0CB3D 0F214AD4B1FFFA21A29E5C7856CE49FA93528E6D53570E3D8D6B17FA27B28AB3 FD2BBCC63139FD7F86DE6A84A2204CB30FD14080D45EA14EA784A5471ADE8A70 2864A204F10AA5B2A2C870521B97AD75CE3F6C078F1BACC99BBFC0E2F2387022 6F72BF44DDB62051E1B81A1419CF2F033B77FE46C2208E7DA22F83392EC97328 9A5E3DEF8BD6323E16D1D14FCFC890BEFAAC9F879198703CC9FD0FEEAA639EC1 B787D77B325A213B71ED56F1ED09DAB41AD4F8E314FA8154BAACF480F110B939 86477401D4ADE8FB386CE8959027A8B91C56C53028C7AD7EEB61DD986D303572 86324689E1AFF282E10F789421EC2BBFC5637C18936B1F2B4D02C8C8D5039503 D425992185042BA95E50C1ADD6563F3C661AAAF32E29F9A4BD3ADBA7A55962F9 ADD1CA560CDF1D0BEF0C57E4EA11587CD17CAB65D9DD830CB738549C6F614612 FACA8E3031BBF29682324D9E12BD792F9F3A24D7250D2AB55FC984C6CDBE070F 5F6282F51C4DEAD075EFA1820E044174FDBFE9AABB68E6254F4B59E8F442DBCF D2AE8ED7ACAFDD486DD36530A71F9A0D9FF91B19FAF723B4909C9F99D5CB29F6 2CB6384D6A3544359AE23E09770F82FF7C9327BD392BD0F6B607897B6D826C50 B84B2E0722B0E27ADD479E5607B4500B8ED238B99C40B2BB47F02352BDACAD22 262DBFBD38A9D4D1BAB79053F4F172397F8F7C00CBD37164A0C89B7E31EDB3C2 25D32798F7F83582CCA56EC0F419316EDB2F3299E40BFFFE63C5C2A0ACDE3C9A 414C2BF9F341F40FD4C8A5B1950EA05A26DD6CE187E181E6AA167F26AF6A4E5D 6E4AE9430E0069749299D2B9D8ED6A3E647BF2707948B8F6D16D4DFBBC71BF61 5EBDC349EAA9EC847880990795B75B118423D9153B05D5D6BF0D20E909F8B22D 0DC9A8CD8CA5B43D92F4CB54344B375926EEFA5BF058B7BAB54B5C97BD5653FC F05BB1A5991B068C26B0420DECA3F1943D093997A3A8BB061BB25CFFC0CA1DCD D85CB203491D176C4C183BB124F22D57678841F08419028F250C30D1237A0213 E5A392E60B27D2BE5240346B99EAFF9B57F108DA66B6AB826546C6411864F7CD FE404BEE7D58F28580C448AAB599D12B00A3FDB2BB93737971A5E13FD7CFA970 656D45145A54DB1BDD0701097445ACF73861FEEB01835F35790E98EF162D5F37 E1A5617CB2BC22074305FBDC8024E741C7BB0FA0E17F123AF953742E01AF56A0 AFF35515ED55F9621AAA309D36964B0187F56FE1F02662B7DFD745F2F3BCCC43 23C8FFD86F382E99DFF681A7D22CD133153C40C3FCBDF86DBED11FD36F9B6B3F C5FDBEFB72496F3C209BD61EB9558CB2BB1672CAD20F8086DF3492147770C0F5 95444F8731D0A1F6036C3099DAC1993B2C838794554E8A3B96614090077BAB84 A5954FF123B90550E1D1A4AB2CA6E8214C473B3CF56746959C062AB6C28EC09B F22096BF7FB6321338085C726C42745088742C6C55D4EA9854CAA71E7BAFEC70 A29302F3C909A6E193ACDC6496F7929713DDD1F4B813D73E794377CC0B956B9C 2D07F5AF8C01D7D9F932F114547E4EBB953ADCED8B20E83FF41B1F4FA5A02915 0C63DC0619BD7E3B5E6FA60157A21794D7299C5774C0FF7D929FE9BC1EABB7F3 193E83584567271D2123E6B069DC23889B93CBF2ECE77CD8CCD649AE853784CE A79337DC93FB835373CAB6E183F5CFEDCE41C418E8C0C48D02BDDDC0CD3D3B4B 285195948E36529F28A6F925FDF16248F9331CBF5A08DC0ECDE2C36FB0A0AB89 2DC0EA84D93C834DDC1BF962D89153901ED7784D9E68BD06357F279CCB7C602B CCF4F389CD7CB4197D2A9271D65097AC31DC2FFEF76884D0910639237DD0C020 F0DDBBAD4C2883ED7313DFA0539D989C1FABB6A5ED54FC791B196AFE787363DE 6688123AAD777F27E4DD19C32B7FAFB9E8E0552DE8DA00570B1AC3E8CA4C7866 6CDE42B4CB89FA30F0AC964EC7F2F77D3F1980313330F26E545BC7A8F5072AA3 2FB0329361BC8BE2C2B48FD060C89CAED6DD9BF6462BEE5FBA59C569D8EEEEFD 8C1BBEA3B73A537D1256C7D6CC73A9CFA3DDB34252A3A4509536D62802A615DA 4AC07C441743B45A15D85181482717316C5B12F6E52BF9A1C287801F3677CFEA 6B60F505F9234792D6E82DCE04C72C308C0D17B80B14B291AA4B437DB7CE5E35 436CC41F868ED6162F25BE5C9FE406FE656FAAA39A72CD5DE07569F21C55198E 54678E869AB6959798013ED6CB2D9CAF568F43D2624ED5F602B7F16F9D27C12D 48EE40743E1DA97E6702FC3634CEE0AF9E6FB3C4587346219C4CDC0B6CCF7F99 E40B48B6C7F5BB21DA0656B683E71A4CC310B001A180D9E00BE05215B170D2B5 C93C2636B61BA3A840076A5F41B8DB3E0B2A38C3848DB0CCD419E5E14DCD1397 AD9811172CE82D7CC7D825B6722205E0072FC807FB647E0442333D42CF799579 C7B7406D147A69C59E03536C8D2EF372AD9C374B977CE1A0784C83073742008E 480EC148196F146C5278FF1EC8252E708B9042389C11547351F093CA8488DC3E 1D5126DF92EB568240BBBDD84B2129B6E8FD6999651566BFB632984240E14F4A E8F5BC9C04ACFB19B327E5246E5BA5B73A0A308D930A588E57174574ED2FE506 9512E3CD02D75AFDC1A36BFB585493E4164F3894679FA602BEDD8CE9E821D187 47CD38794364E336B65126F61CD3CA861F9919F24CDD410E5F03AAFC4E45E30A 486F6CB28CE7A6A2125C55CCCC11BA659E72234CE9D5F6 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMSY10 %!PS-AdobeFont-1.1: CMSY10 1.0 %%CreationDate: 1991 Aug 15 07:20:57 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.0) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMSY10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle -14.035 def /isFixedPitch false def end readonly def /FontName /CMSY10 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 15 /bullet put dup 102 /braceleft put dup 103 /braceright put dup 106 /bar put readonly def /FontBBox{-29 -960 1116 775}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052F09F9C8ADE9D907C058B87E9B6964 7D53359E51216774A4EAA1E2B58EC3176BD1184A633B951372B4198D4E8C5EF4 A213ACB58AA0A658908035BF2ED8531779838A960DFE2B27EA49C37156989C85 E21B3ABF72E39A89232CD9F4237FC80C9E64E8425AA3BEF7DED60B122A52922A 221A37D9A807DD01161779DDE7D31FF2B87F97C73D63EECDDA4C49501773468A 27D1663E0B62F461F6E40A5D6676D1D12B51E641C1D4E8E2771864FC104F8CBF 5B78EC1D88228725F1C453A678F58A7E1B7BD7CA700717D288EB8DA1F57C4F09 0ABF1D42C5DDD0C384C7E22F8F8047BE1D4C1CC8E33368FB1AC82B4E96146730 DE3302B2E6B819CB6AE455B1AF3187FFE8071AA57EF8A6616B9CB7941D44EC7A 71A7BB3DF755178D7D2E4BB69859EFA4BBC30BD6BB1531133FD4D9438FF99F09 4ECC068A324D75B5F696B8688EEB2F17E5ED34CCD6D047A4E3806D000C199D7C 515DB70A8D4F6146FE068DC1E5DE8BC57030ACE57A0A31C99BEDB251A0ECAD78 253AB321023D15FF7F55A3CE81514C1E7E76240C1FB36CD4874DDB761CC325F5 D588700B294849D690F93526EF438A42B9B5B0508584EA3766D35F5B8D51C458 ECB9FBD23A49576EAB06BACB7EA6D300985500835F4FE597D4A1110C8EABE6FC CE3E1F95CFD3A42446F25355381D476B2FFB6EF247BF58A6FFC5EC0E4CC207BE 46485F8E07350B37DCA8C1864E62614332A1D3C9DEDDD6492181949A2C3498C9 EC2A81C1F4FF989A4654E375F509D24D969B97D2A9940FAF43BBB286E08559C0 F8D9674B0A294B36D3A050F7DED8C80E1D230812F6B8387B17948FD29FF050E2 AAC5EBE5D96AFD0879534E2F4BB81613A1571750F9CF4215199F93813D815B5D 1C79E11A0FCBB627CDE569F88C741CD502627777BB058ECAC09B6ACCFACA69B9 8F8168B0B5A1A6EB13E884B348FBB2ACF9EB180F6E27D57F8503710CE037A34A F8B157201657C825E2A4B4A7696B58B7A988C05E43E66F0FF277A7694C555C54 AFB1D32F6DE102136FC810E1F3B5CEA42476EAC7AAFB390E3252B2169DCDEE6E 328507BD0E24734A85AAA263E0D2F64BE1607455BC855785BC27F8B30FE917B4 23AB3C812975355942E955501AF85A3C0CE836911AF679EA44AD6A7D042A6549 0C471FE294E8490024D93ADCADED460FAB7FBCDC29EFEBD2A9A127E11869E659 961B29206CE63944B6FA4B9315BCC528EB1E0223CE94C795A5D5231A7FC8545D 6B287B965F8EEDDB67A6774129DD01D5A21694ABE320BB2553043D4C42ACFF91 1009372CB03381035BEEEEFD05631E026A0980A72A67B3703323A4E7C94FFCEE 8D0B7407F9CCC043D3D184BEA4728385D6AB2FB0641DD8F5BA7E04035D30D628 7E97D31C1486DFD5B1D076B84B4ABA4829ED4310321F1F24B847C44E00185A69 37711A 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMTT10 %!PS-AdobeFont-1.1: CMTT10 1.00B %%CreationDate: 1992 Apr 26 10:42:42 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.00B) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMTT10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle 0 def /isFixedPitch true def end readonly def /FontName /CMTT10 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 33 /exclam put dup 34 /quotedbl put dup 35 /numbersign put dup 36 /dollar put dup 37 /percent put dup 38 /ampersand put dup 39 /quoteright put dup 40 /parenleft put dup 41 /parenright put dup 42 /asterisk put dup 43 /plus put dup 44 /comma put dup 45 /hyphen put dup 46 /period put dup 47 /slash put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 56 /eight put dup 57 /nine put dup 58 /colon put dup 59 /semicolon put dup 60 /less put dup 61 /equal put dup 62 /greater put dup 63 /question put dup 64 /at put dup 65 /A put dup 66 /B put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 71 /G put dup 72 /H put dup 73 /I put dup 74 /J put dup 75 /K put dup 76 /L put dup 77 /M put dup 78 /N put dup 79 /O put dup 80 /P put dup 81 /Q put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 86 /V put dup 87 /W put dup 88 /X put dup 89 /Y put dup 90 /Z put dup 91 /bracketleft put dup 92 /backslash put dup 93 /bracketright put dup 94 /asciicircum put dup 95 /underscore put dup 97 /a put dup 98 /b put dup 99 /c put dup 100 /d put dup 101 /e put dup 102 /f put dup 103 /g put dup 104 /h put dup 105 /i put dup 106 /j put dup 107 /k put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 113 /q put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 118 /v put dup 119 /w put dup 120 /x put dup 121 /y put dup 122 /z put dup 123 /braceleft put dup 124 /bar put dup 125 /braceright put dup 126 /asciitilde put readonly def /FontBBox{-4 -235 731 800}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891 016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171 9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758 469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8 2BDBF16FBC7512FAA308A093FE5F00F963068B8232429ED8B7CF6A3D879A2D19 38DD5C4467F9DD8C5D1A2000B3A6BF2F25629BAEC199AE8BD4BA6ED9BBF7DABF D0E153BAB1C17900D4FCE209622ACD19E7C74C2807D0397357ED07AB460D5204 EB3A45B7AC4D106B7303AD8348853032A745F417943F9B4FED652B835AA49727 A8B4117AFF1D4BCE831EB510B6851796D0BE6982B76620CB3CE0C22CACDD4593 F244C14EEC0E5A7C4AC42392F81C01BC4257FE12AF33F4BFEA9108FF11CF9714 4DD6EC70A2C4C1E4F328A1EB25E43525FB1E16C07E28CC359DF61F426B7D41EA 6A0C84DD63275395A503AAE908E1C82D389FD12A21E86999799E7F24A994472E A10EAE77096709BE0D11AAD24A30D96E15A51D720AFB3B10D2E0AC8DC1A1204B E8725E00D7E3A96F9978BC19377034D93D080C4391E579C34FF9FC2379CB119F 1E5BBEA91AE20F343C6420BE1E2BD0636B04FCCC0BEE0DC2D56D66F06DB22438 452822CBEAF03EE9EAA8398F276EC0D92A7FB978C17805DB2F4A7DFBA56FD6AF 8670EB364F01DE8FCAFBAF657D68C3A03112915736CEABAA8BA5C0AC25288369 5D49BD891FABEFE8699A0AE3ED85B48ACB22229E15623399C93DE7D935734ADA DA7A1462C111D44AD53EA35B57E5D0B5FC0B481820E43222DB8EFCD5D30E15F9 BA304FA879392EE0BCC0E1A61E74B3A1FC3A3D170218D7244580C7AA0DC65D19 741FA5FE6F8CBF60250ACC27454BBF0897CA4B909C83A56672958752ED4B5E79 E18660764F155E86F09EFA9F7685F2F5027EC85A775287B30E2069DE4E4D5712 E7D033481A53A2702BA7542C71062173039030CF28D8B9C63B5596A9B42B33E7 D922944A38713383D3648A4AF160A3B0C8F3379BA4372BE2E7EA49AABA75AEEE C5DDE1D8BF68483C3D21271280ABB91D54CC819680322EAB72E1250A760BC8DA 726405EFE420635B5B7F0B48752C06083E92BDE06401C42A2C528C8A60381227 CEBEF0C9440DC034DAD9C19FB27DB399BDAEE22053591D6538587C768C1B7B0B 7D1E222D2D8AF3A6473CC4C0D6C3E0DB49068CEB8C9BD1C5CD486A50DAA10BC7 7D6286142355E3F21DD254E27C00C442728A0BAEC9D3F17AE9CE320D365152E9 EB0D5E3874F2BCEDA98521D23FCFC30B4B69DAD2ADBE80E5964ED0ABEF6C73B6 DAD30E2C5061E3747FE536E1A5D190D028F2130AF608F5DDF9DDDF1E77DC8437 ECB3EC93B33505DF47884DDBD1DC6BBE4098DF04A29AF6FA3AE344600D0AAB53 B3820DD7ECB600A3B8001C51AF2CA7A39AE1485A087FD1752DF68F55B52B4DA7 48030F2AA7E570B3D56C4EAD367B9B73FBC0A7356253233006178B9A6BC19081 B815B5988AE76FE6FAFD7AC239072B1106A3F509381AAEE79B2F2154CAC4727B D199CDC8B4D05DF4BA006982512ABD7539E28D937B0F87FF79A3F84C29ECF943 A8DCB8BDF8EA9E7A0E7CD60BC2308C96B3E889C797D0FF28FF4847016B3DA141 E76FC6BE78A6EE9CE07E651FF86E720A1A1F075972D36E5C55162E3FE26BCE3A 814BFEB12D4C5FD24340CFFED499C7CA183E57EC4F12CFFBE3291D43F7270575 C6C3306F832EF182ADD0AA14C4D8669A17C09F632406AFA195F90C4DDC39779E EC0A77E590211592D6EE19563963225C06C2F13265EBB5A6CFB7C17D9E77650D 11958305727AF662AE73AD0E3ED5F7E7086C5A0C3548A8129575980B06C715AF DD55C8DF869BED0A7883491030B1A7E82C5EB04E5A7D952E716DD8F2EF6275EE 087614CFAB55FCE2BBECD7E8D9C90FD8359E929D5E0A416A23BD58158318B4FF 87B095EB63F7F052B3A77F136FD66EB2C52BD46CD7DB3091A4B78A607112B12C 4D171B2A00B78B0E1C44B0D90C20D9244281F5123DC1F6063F91E9E3E48DE78B C862D848BAD073A4FCB5EEC9FF54B5AB8E234CCC3C7439C62ABC4A13EF1B8897 ABBF21F900C564C9A305FC36FC7224932F766E6E72C2EBB55953DFE2AFC2E3FD 33A0C6F0FDFF086E9FD796E7242596AE85B877223532667625E371D2156E4C04 0D7FFCD3337B93DF066CB6FE1E13960719EB7CB409EE805C08ACD2C06303ED9C E34C898787A43C1B428B896551C6FEB50A831C6F8CE2073EFC662EC286CB7555 A3B42E58772E82FEE206948B8C439FEC5E4ECB9E11DC3A4CBC7611E30890E408 637A01A2118441B4F9467A98BB2A1B03BB2F5D8E3DB7D1D15C188D9E856088EC B762F07B1C06024F7EF53A2FBD60C0A1F4C0275D07164545250ECEEF8CB15B04 A2D8AC44DDE818C4E3CBD2A5FA0FE49750886CD7CFAAF8B780255F89DF7F4F5C BB594FE7C1597DA71813C2952AD3E811524459EB71D29696B450C924B6A5C843 8F36A0F1D7DFE796FB9564333666D74AE614D0D698FAFF20F83C86524C894BB0 272221C060544F3B653CB0E4E4F82B20D7530B3806E6A5830852C58070177815 E287C847F19F64E854F1463C23DDD80093D6FEB8BAA22C5F05C21F99FBA7193A EB7CD49CFDF4308C6C68CC955A45FCFB54FCADA9A3BFBDE086B057DE88BE335D 280F5338D7E66AD39FD08F9B55884F1F377FB6869FBABE3EAA4B7ACCD85BE672 724B4B8F236B0889B6E7049CBA558A89F17863E82DF145DB8C7ED1F36332DE23 3C0053B74E850FA14F9EC9EFC23AF18E153CC96FB0FFD910347370E57F0D81E9 4A83E2D189EE5635E85A2BEAB5B1CB974546BFB2FC2ABA1E15DC0EC1BB3AF1DB B2F93538B92F504CBD7AAFE36F5F3AD45EB16378F169B17869FE81464CB826CB 400D2F5441A496B6C60A4F15FD20ECCAC1F8F91015E7E1C1A10B7992A1554E52 9FBEE905A3005336E49CB04BA7223F1674C0BBDFA06ACA34F7BFDA56906E04A7 4DD79EC7E79B021A5008F3B1E04712D689366F520B0FA66A558F957011992728 561BF4B75C2BE07C4024C172085E51CCC5CFA439F570297154CDDBB3AA25CD6A 3004B936488851BA1E814260C06CD5479DCAB1A6AE21A5F4563024F973D738B4 0DDB6C6DD2E3AC21B4F6D95CF9AACA782919F5D3E613D61F3224A982AF485C8D EA0037410EB70AB7D3EC174C6D5DE5C9C5A1220EF7C2B74499ADCEEFF077D1D3 50C1124535F88C3C3F66477E42F1932665AD323E06B398D2805B9CEA632F5B1E 50FA587B102A35E2F15EC22DD66E4DF06A3F4BB717A3ED7FBBE2458EB4D896DD AF00D1BC71FE1CCA27890ECBF9F0AF01D3E65CAA29427FAF06B3BE1E640522E0 73B213D04491B93DB29113EF72211E31F4C5A7FD58451946CFC15FD805112FE2 547D1131A46710DFB75659A33695FFAF3CDD40AE5260AD6766DA81DAB0A6E96B E89D57AAEF32B5EDBBE9F7CC033BB2595CA3FEDA2ABAC8E5395EBC35BC112FE9 67EAF1F123228538091483050847F8FB5194203609502D3A09CDE811EADC18B9 F039593782C27EFA7697182D6367E88E326AD5622C5A457FE2644FEADA88615D 9DE3E483BFD9329667953CDB86F9D2F0D4F02DAB8A98FDEB1D17CAAED9B6E2E6 0C55C1FEE25AB98FF59FC235876029CE03E4A713B75B3163BE3B2DC0D4472DBC 473E10400C0F57E627AE97FD0C1CB0F78FD8E2FA831A3D2B1C2BB3F2D4E812A4 194C8732B0C525361DC8480CB27C30CD4DCFF01318D2EB4F5234B4A42EA8C23E 7B3EECA41B8E4F54D5458B37EF0FB2F49EB19F4EA8AD2B53820FA36E93DD309E 48847F5C01B1118ECE7D0186E6B8953344EB775D655AAAD7BCDA642EA2E39A15 855C027CBC0E3FA752900EEB464E2D39404D1B85072B40834748C6F9C74C5B6C 3CEDE988343FD984CFE4B856A481E60E2E65D3BB41BAF2FA80AC0BFE381071C4 573C6ED65C524FF777F34D82E9661E4A75E3878CC77BC59218244612219C5A92 E95B90EC2C38614665550026F1730D11162F19D841681C04C401E102C047541B 97B9264D86F47E25A347696AE5EF0FF3ECD9BA32C92901DEDD816F7D73ED1216 0A98771892472CD625A8F7F19DEFCF5CA2AE57F8AD3898F2C1005B187DEC6F2A A31C32720EBC934178E0E9979013B3C9AEDA4051DF63D8C903A399DC88F83DCB A73F1B2083819D1BBEA5235F8FE1D098F32A2BA6274424A99A4975FE4BFD59AD 79B40A8003CC0AA728EA79D6BDCBBD73DF45B7918BC099C5BE4A068BF64A30B1 C39442CED98AAE1BD495F6CA32D564A72E3BF753B49E4178927E4BBC0F06048F 96DE7C30AF580B0BFFDB330B3B87D7F6532A24F403680BD9F15E758CDF04EB94 E83C7E644FDE5BEE7CE73EFAC75669E41BDFB20A5B8ADE1137378DD8102A0DBE 19499A623770417CBF5211395A6BA9F4490F4707A46F1F9B3FBE642DEA0CA053 9ABC307B1E71DC2B069DDDBB4EAE378BCC75AD61DA900AF8BA6DF0E27A8D2258 DC80205305AB6ABFE3726703E60869BFAFF1874F3C0E05FAD9C05D7D89ECECA9 DD2AF5F777D7514208697E712B52448B364D3ECEFD8127043DDC9D0757B7CC37 5CDE8001D007A6E961EA24D7FFC92410F3B13A32946F12A50DFFA256249BC8D7 C1842FB84AD51B41008EC4604F6B70990510EE13E6DA34F864A572D99A13FFC7 3609EF2BB1FCDEDF37A6018248C545E086EAD1BA1143E74AC60B684E755E59E7 36557B915F92EF78FC177621D49F777A2AF39F3C2AA6EC74750AAAE08BCC21CA A71CCDC91DD45E6050D83ABA49ECE425B55EEE137C55619037F1C30530BD0A6E CD2004B6A040405064D7E87C55536680364E09248BFAA3FDF95CDA0708E55F4C F7D0A92A93DEE0C7B69638F171B28B7F854CCC6EBC6AEE14864BF5144EA36D46 A9C297225AB0325E28EF6BD06D7E40E3A724EA1E50C4C6163B195CFFD5DD291D D7BBE9AF4324A69394117EFD62F08D6BA6A8F0AC3E2353492999AF28FBA758C3 A50B6840CC72054355E6CBDBD86F683537A4115049BC1616BA35C2B0B6F5CC32 3F6831DE4E6029310738DE23D36D2C6E82F04EB675FB89789F74AFE3B8854250 51812FBEFBCF162947554324FADAB765C74B6DA89F60A734076D44BBE45263B1 3FEFEEA90EC7948F23F34D4049087AF6563692417DDBCDD5A9552A373C2528F8 0318D3C0669279F292127CBA40B0ABE08A1476BC9EBFA8BD5D622BC5CE7DBA20 C689BDAF50D5B1EAA89E296787CC53845DB2BA54FDE363DCC98A7BA256663869 E9E02E09077884DF1A2A41AA698B7EDE8DAFA621B552DDA91AD1E671D636FB36 91C62B4D2D4112F2C169E0023EB7521F570CECC54ECA5EBA462049AABBE2ADEF E3234BFD71B26DFDD9D34DFA69E5E80FD90406E6505A6798F030A4B5172A7BC2 C9B765A86ED55C0590E0432719BCD7BDE7CCC7F6B33BD467063D886276C8879D E04897A4623111C14A1EDBBF69E2FEDDFEAEB2A785C6D2F0711DF4B93AAA291E 7F4E0CF9CC3FF0D31953C594DAD014097DA02CBD5AE8828C7E7B5BDA09188B05 0D7263F164E1E78CC430ACAD1E8FA71001E9BCEFAE47C79846916A5F819CA366 5734089BCDD458CA1A9E8E17BFF357A91F9A7A8A6E1DEFB121353AA80F1906A5 AF7CD2E59EE6776FC0DA6574DA0DE522918CAC4E566F13FB9B64EFE79F3A3BC0 689E3B0676741C90FF3BF85C7A0FA9716F4ED0E329512B66BFB8AEB56C3DD6B2 24F8D6E23751A8485F7EB46719E9D22618FEE86D5E01ECCF4C6E74368A8E9B49 245D80E7484DFBC916FB2447852B36EF3F99A82B6C106F786707D7689DCD7AEC A0C51AC1A3F67034C16B74994403FAE7743BF02149BEBEF554814BEF31B79184 3FAB4D2C887E1BEE81B465D12DCDDAD03DE5ABE9E763C440B2CFD42FD16D96EB C21FE788C8C2688F79F148AA7090BE64B0EA710D376222FD1590301BA9A2E715 D33B8C1D95F2589AB0EE476F7046537E27DBBCDADEA1E7357C9D7FA92C2F93A6 7BDDF58A44966590821023380C97CDE37EF6D449E35EF32BCA6E69DC8458511E 8DC8AB63171A6018AC9A334829E5978484C4C6E917A5F1C254E6669F4037C691 36980250A80673E0F18C9E0FBA1E5CCA3BE30B8E7B7188062B25F8E1E16528A2 F217C18D6A1955482E5463FBF097ABAF7314E449C6FEE56E2695407A8AA9648C 61AC2BF3B2D9CB6317A9B16CE931D318C8BC9676CD908505568C197D90C2BB46 06431C999EB68C8216409E4CABACB2BB34A05B697B9DD1E91471A404B4969519 E25209EF4EDD420944BED17B18DB3566FCB8059699FE416789191EC2B35086AA 2E10C139E3C9FA0A535DEE9255A867A26656213E85851DE5F51F9780D3A6E572 F1F5CE64DA176CA810799DC1C60A8FD2A5ED42E613021A19928EC4572059B2C1 EE441E79CDF7DD4AF7B6E3D3230419ACAED329388044B107DCB4DE91B71EB838 904B1F969738BBDA064FFE75C6623639BE9924602DDF0C166B433B9D54ACDA5E 018680477FB8F10621FF32319E58DB672D744959A33E7314A1B3CDE0C038F7D6 0C8A195AF191E36B0325334A711CD8E25D9C1D257E46A734779E486567481108 E0281DE96907D460546578DE83A0A01A9ABF64402B48DEF739F4308E14145753 719CEF720FE5CF8DAD7845E74D502B69DC18D172C3A27411259B8042F3FF82C3 B157BE242C351830255CF0EDA96577375A70657BD9A2E9FFC54AF0AE563D73F2 E510279FEF48D79F5F7745DBB492F1D74DA738E6A4FE4364799B5BEC93B4CAF6 B06B9B8C8D164F8FA1FBBA693204064F2C1806C39910910E02ECA8D092558CB8 33338B359D56483B7B99A1D8137204EC1AE70ED3D75881FC3B00BB9349AD934C 81A9F285312FDDC77FA923B18B1873D288C2AAF2E6D0AF90BF25A982B843789D 5662D6A2DD58E065026885601ABED4B09CAAA3116DEE6B430B15BE0A121FC1BB FDEA5A501F0798CFFFFEAB5101E707F1A00C8E014A3561FD39972EA9AB108EBB 960AEA7FF60C301AD6CBFCAA7D35CBF6F8462A4D76C4FBA6F3DF6BB762DF7900 9F69529AB4EAF96C2866444B257160E8822533A7A1240C83EC18C364F577407B 4CB314678D2511735308A1660AD94B8B818CEA4A3DC00C5A1C978F8BB4E0491C 49328F6CDF95BF620AE53056364423841D84418B23C2A447B0CCF8D8633FE2E8 4A4AC1C6C74627EECDC994059F1BAE9E6B10FA80D767B3FE97BFFAD413DCB0A8 495039744B48266278194D60422D6E7C74D0DB45ACF217797D0C0678EEB60759 6231438CFEFB346553A7A447B50807EBB6E885B5A49CA9A350EC4A8C76EDFBB3 A4DA1C9E3EFA193CDF08553302998F20055C84420A4C5252F764CC4B7A4BEF6A A09170EC417B296DD9E2301CD8EABE4A087E648E0525A9FFAF26374C47FDC123 82F18C9884843864F418ACB08041E7896FDD395225532460A8194A8DB4DBD824 1C68C6665F85059E365EC0972EC6465E2D8867449907DA6692A021F026F437BD D02654BC11381BB6557663E0B0B8C4F2FF69E4776F4EABA69311BC1AF8155F7D 6D3A418BDC912CC7CF1A4BBC8A1376D8B4DEEB6585416959BCA4AA08D4520C33 EB054DE53140992D0707210593BE62B3659E3E493C4562C2E99CECA143791DAC 679896BCDA0699E405957E17DDBD243E65CDD7C9C8629F29A2078658746A7779 0F75BE24E2DDBB672B95F26366BAF036B3C23BE4132D7362E76D4183A469E0F7 29174711ECAF4FD9A923E72FE58DF2854C5537E3626317D471D1E8A922C9BBA4 CE9163A4086AC4A231C2BF35FBC39A5BBCFE41843CAC7D81A054509D31572BE1 596E0B0B563DF2BF0E57DB4943DAEE35CA26C8433FEE4FC61145C77F65DADE75 62DA18DFABC7F4194906F53884E62E77D8AB3E099776AB93B2B4D0C98FA44C71 597202A2643942795EE8CE098FE26F1AF8134F1E75FAE18D563B1FF43A511C9E EAFB9EFCF61490A1A4FD2CF354927B72C5EDD5D62B2F3F5006D6130562A13BCB 1B988A994A8D68B051A5A821CCD5D0F8D9D49FE7CD04EECCFD7A554CCDFFD77E 27AC4AB5BF9FE40F90EBD066C483796CE1A364E95C5E0CF2154834760522F128 B2DBD1F4F73347D42635B2875A23597C35A0823CC6F71E49598125411BC9B2C2 72470D36DD967C947AFB031BFCF770FE50551A134DF8C5D1AB1F09819569A57E E23D4E87C0B52CD02B0A2E3FAA7D27A94359E82AF047756BB769BC5950A75207 78ABD49D174F2F69810AFFA9336A52D6B93B004DCA5CDE58475C0210E0BA1D20 FD4FFD6838EC56A0922472D4C4EE0CC481574BC30618179E733EA40A48847E14 A75BE7717CC5DDCB5B0718074EAB6FF07CFFE794D335B3A13EB968EA8FC5B08A 13B38AD1C2C964E4B07E90B9732C458216B028E07DD593A5B767A2B415EFE7DA 951FC07800F11C7E2EF9BDD152BC6815B7F32117F49FE08BD79BEB949003512A 327F3F8FAE1767E7842348BA4373649F1A21DB2C56C081BCF9FA4EA86C8DFF00 FF45C4F1386CF8C2C4120F3F6019CEBB639F2D272D08C1763A470D4BF6330DC8 43C069A6333113C3A0C93471486EFE9BFC02B760C7CBB2E9156087D09EE8A178 5EF50B34994094C3F0015EA2ADB6C920F4302FDEF128711994875551C4E883E2 DDEFFAAE11F2234AFDD96400BB69C1B4E6EFD75734C586A10A54A98E7D790F28 DEF7C7DF61FB23BF91AA700AE585EBDE74E215DA49F4ED466F46129022722086 8884D8E026F35C4BEE7E866DF8E0846D5EC3534069B713FAB02D4B4EE3B44E1B 656F30D629D40AA1337786C1FDA08EA1217AFA4A6E2498B334DAB5461A70DFBB 5AA5686C89FFA4EE82D81CE2B28334DC5C032487CCE998616F48150BA1281911 076E626E5BFCC56A0A4CDC559F878F14C2BD7A5148C1D8CC303FF9EC473354D2 D4FB0F0F2AD0CF182A28074ED6552E179222570DE0E0D44E8FF4DB36C3AD6487 C4BA53C8548714A69FCF8E3E5202F09469D7447C6519AE902C1D611A720BAFB5 59E27A6DBA73624F44B4ABE0988BA3450F82E03521CCE8EDE8BE7EE1223B575A DF9A52650E85545525E6F121FF2D1531F156EA9D5594239AEA2CD09EE28ACB15 A445E11FD1C031188DB61881F474D49425C084489A88A47D681EA68E7FC4B1F9 DBB552063A02A0EB51125E9B2CC646B940D46FF457415F9565892DEAC030F08B E4C10DC38D825C7597394C844CB863CE6C843F67F2E1C42C4EF86AC7FB727BF0 224B5E91BAD99CC6638AB2C64469A81D8B1789981872ED037B3A34BDF3130137 80FE80FDA65EFBC11A08B98A1AE595F980B577E22D3CB7FED1D4016F5290ADF5 47D7D9BAFE39F294582F2C084003E9C83FDB9EBC87C8B477CB8BB359EDD9BBC9 9368D6605E1468A20909831BF602EFCEC0D5EBA99A2223E5A269275C8B221B3A F9226654185929F794E1979ED18B4CD36152F973433AC67BE24B9D953254FBBD B644CDF3BF0E29A2C72113DC486E46DED2CE8F8DFA8B0F8478D1F18C9AA8E054 A31C3DBE84ECEDD85DF6AF9467AC2990ECAA3384FBCA1BBE598AA0D6813C859E 1520B88BF30ADA910A6AC3068A5B8CFD76B7F0F6F4AF4C32450D628B5320C384 F23A2B5E8756895584155226A30F8B0437E028978491DCD00E79C0ED58DF261E 79B9DA17E57AEE03EE92102EAB2D63E69A88EE0B1E2087ED0C0CF6475EBDC3BE 0324D1FC8F7B90D8D807533E5436F2C2583B9629EC390403437FDAC908557894 03054A6DD6A3586043A9C8BFD0C7EDE1229DBB9F69F7A5D20F55664D061F6517 0051C6B3CD7338241FB403F2AF77DAB1A8EBE1650156D40863EC1957372BFDEA BA8D0BB1193CC5BEB5A68C8274802E14FFA3ADCEBE19070325B1BDB960CF2988 C0F5A9BFD843C515ADEC8B8AB02B2891EDD7502D9F28F4E58D8F67D1ACAFD0C3 3531E0C7D1554344CCF90AC8696E83A3F968252981CAC09653956F4343B99D3D 4F17CB8BBE4506B354439B70F2024871D16668F9DECD8EDB872BE5E6ACC406F1 1DF4E3ADF60EFED57D1C426292970199BB663405236C6A907B6891C6190E87F2 78D9142220FF295C7BF44AF61470798FB8CFBEE6973C69DA1CC24ECB058AA753 DDBFD92FBB15560EA19D5D92F0005B74F06F0EA5901D231996E0866389DCA433 E62BE48479687084C1D67BC592E592939F806FA8BF5F0D3F644B1FA6F056DE0D 51D3F212C6818CB6166317058C2A0C07AE2E324CD90D4EC83CF4819B10CC348C 6DBABA024A5FCDAE6E288F82DA060BCD16437F07DCA43BF1E5A1B402F16C78FC 075BEE900B4021A1019C4A5ADC33230047FF11FDE8FB775DDA267040A22B4E5D 6012F7E72B8BC8DD3A81369A08FB81C6C4873C2147D03D4181D6D8032DD2B610 9C44CAB50C5BD8F489EBF01C72D4198B66EEA4E976462F8874143640B82AE57C A51EDEDE75A9A55D31587C14F8DEFFE69F75EA7B95BF725CE9991FB2F07AF568 5AFEB39447B728B99BE0502BF28DE1D92B15926BE4E3DA2E7BB44A24836A97C6 EE3A2080E01DC6514180DAF9C055F4C94929D34F193920020505E62804461630 9F42C652F9D5681C91BE23DCB0C634247E739135F925EF3D5424767D5F5C5879 C46F2E32C7B3BE9E90FD6ABE693A6016AB77670129B58B8FE719FA97FE320842 6488CB85B6BCC0012975D22E75A2E086131DE676AB825A386C086FBE1B65DDDD A19F06AA4C1D3EC84751C649F4A62CFDC48A7CF88CFEC68B959C211B60DCB045 6BFF922FD7349B98E1769394E6CEA4F764AC4B6536AAE4E6BE69099A39A6A33C 97671C3AB4E7A94DCB829FBA97DFE5F71B1728FC81F826699DFDB0ACE9BC60E0 6EC15D35EC479F3F53EE4D0398BAC138FED504A84A13B78568E3F9C86BAE8B88 61830A80F8B994D0D66A8FA3FCD6C5099C29FC285ABF096EF9A3BFDBB522157C DCE9F0D6AAFB1F8D7B0A3C573D0C170357175DD56EAF37BAAEF4C92FBE17E26C 7D2BDAACB9B8F33D09651FBE0D49A8BE66B78D075485BCD38DED5056FCE48A12 D28E9670EC7CF4E9A277D6ABC2F7AB30BFF290B5452582F372FC9DE6CEA9EC0B 84328269F14FE7F47620B1042B283C54161AFCF84B46E6B1410587295E4F8958 C1800F120B59639C85D46D46A4C64309931A8C91F138EB52F779189EF75B9157 D624045F4B8846856ADF0AD735FC6FA41F7B6C002E9D1EBD92468E86C843AFB7 4D78E3D54D866029DE5DF865EE3F7313AC358EDA70A792E22F2F806EF86A6B57 64AAD565C57E64B1A6635B7394B4B5729189319FCAC8529ADE30633B9BDEE0D2 AF1F8944EFDC7C408FD8FC270822CC01E7BA355C856219B3AC5D05CA37EB0EF1 6766D62383AEDDA1F7CDAD1DF0172E766BB46C5FCCDDD61BB019D283EDEF312A B2DBA38C9BB0928FB93F50E8516AB353BE04403D132805B5AAAA17163AB9C847 F1B54946B0775FD21325C82E4EC7F2186C54B4396BC4B0B913A59E4444D11B39 8AB56F2FD5788A9BA45DA5499A50BA74D28707F62086907BF8342E0C753A31A8 DE293B592F51D74DECA52858CCF76C69BAF2224F640069BEF2604983FB478173 792D68030D7A6E3FE083AFFE9488D872897ABFC88CA8BFE484A75201D73058D4 72A8A26A50BA1F2B50CBF98D46DFED0BA057619BF370E435A0400147928D7C06 28DF2A03527E3BE925D6A664E4640E63BD22D54A038D934B3DB5B500E075B8AB 06DB5279274E65FF870F1E5106E190AB0FD8849EEE2D605FD4F0DED2C3F86831 4EECBFAAD8B2A895F08DBA692A8176F9080045519CC6C46B52F0F31DF112AD79 8E46B9899C5527A011AB63FA443ACE90F09434C295A5D9E6753AF2645407488E D29E7711546F87265C130B76B4632242E43962A5C886D4DB6316A2F3420FCAEA 3055AB5A9E1325EA870CE87F34BB2B3110E4919E1AFEE67606B00B03DD6824F0 20BA42968B81DAE198C88057438E36056D46C550E3E5E03A99BD4B07E66A2179 BBC5B3FB06D5D72022C53A3F3A1B759472D5A50D7F7A1F4E31D3F7A30EDC1D45 4B00AEB5DF680145A123CCA3BBD801CA64B2CBEEA99842720F8DCE432909AE78 5AD3F29AC69D302C62256CC4D47AC92EE11D2A3E1C666CEA24876491BB167548 9E3A990252DF8254CB5E7141F57B78FD1FEB38BE135815C6FC86EF81B5994711 E43083C3234C55DAD97CCCE4FF3F55C5A6C22ADD2C549513A465CFA3D8A9AEB6 331374DC05A4F496BE33F9263172FB6FE1CCD19EE9515C5155ABECA9492DC743 BE4142D63FB5E17D55C9FE642F07995502AECD9D555603D15B5BE420A65A6E98 4F341BA13E44DBBC1DC8CF0D561198A2B40FAF35F7ED5FEB4429BF71F5C88637 CB114F1377FD3227EDF592733EC68F4EFEAB14FE7C26DA7031075E04289FA6DC 8A79F81E4E18CAE8380CC585E7DA3DCDA3FCB53929AA8D772D53FC6D821EBB14 EB472017FB56CE9410FEEFF14EA69C188993922DAFEC805F4C8028537A9D6365 AE1A6BEF37CE8E02B995C41382984802AD3D12AA9FAA36837F9F9F8F60D16B81 474238F136F442CA9B14620F83E4046E41EB0FD02BD04DA7863DF26624B5489A B8BA35B0B3A8D128FA10E01DC9B622C26CC57CA79CCDEEB7E174698EFDCC0CBE 879AE1434B3EC5AF48E6C2EC5652DEFE0ECD7415FA46BC0C80FCC57CC808B3DE CBE4CC7B62AD3B092487F7A23C38A2D9102DEBB1CF4C1EE7FEDE1E8BBCDF7F73 54CAB1E591F9B3B3159D879A9492394B32F2CC43EE7EBA6E293AF12D7FC4ADF4 DAF8F2F48A777E927A915DE1FD9125B52D406BACB0BEA149F6F6D79D92D06413 5D68461A772D531F2E76D1947D2ED5BFFCD758E062B5435BFD180F7E3734D5DD ABD86A1C2BA643955A36C482BEBAC608F588C43E6EA7EA2AE01D0346D28F50CD BA8F9FD23674AB19A2B879E0DD19029EAC5D74D16B186CF4BE3382E74E361427 536A00347E536701808C1D31A617D1F9269110B76A0D59C7B84D98C8FE308733 C9497B807A77D244FEE03ED7FB5EB4D6ABB74A7129F23AF628BC01BEC6C43ED2 D62F4E2133006FDB94D33CD31F9FFE57C8C9E31DC6D7A81A2C6ABF1D971EE222 96A4D79F7232190EB796A43ECEB88F1C64A88A10C3AE8E98711EFDF984BF270B 55C5B9082D54DA7D32B168CE573597DC5A453D76953DBDDDBC1798F8A645AEB3 78B6B5BAF60C9AFA9D5F818740EDAA977EBEA0F68E531550E607E6FCB04F3E22 BC9D6440E1E153C8D780213DAB08CF8CFEB03018942AF980642745D711C7DB1D BEFD825627798897ED8185D80234B6C087FBB602ADB1263C2A2A0F59AFCA7B09 EA4ED3BCF936C2DAEA9C8DDAA90130C24AD1A1BA47711CC760FF72EB3F27C165 CA1FDCF1250C6CA4A788AAEEE08902AB4EB03C6EDF281CA2F5B074C859DE3963 27F7CFC53CC91C80F779ABB25F7A6601453DF5606B72EC562F615A92C1DCED58 3911BE7784B6E8B17F8993E4D5693A327F9C289701F39ADCF583BB4EFDE1F835 1A59BBC2E6B73CF422D877B0B423E4E8FD116F5C66A4BEB706A3D42E7EFBB5E5 E73CD03D7A91719337CC8E13F9D8DA255185FBE3F4FB6DBE8EA90AF036A09BE3 5047B59BC18C1C3658ACE003B6535E42043E4D7E6D79E0B48B3D0DCA36C046D1 D5ACE0B6F91CB78BCBD144F3FAA3D9D711C9D11EC30B6CCDBF43CD490E9AC229 9ED2CFAC4F53927040CC8FD26004450889A1167FA34247B7C283A46E4C0A8C20 AB43314A34EF0BC02C5558746D35F2315624FB9D4A8ED13E3D1A8B80B872798E CCB9775F985E31E8228B03949B4E35DCF7A41C834E53CE3C163EEECE81A8278C FEA3A9E3264627D33738170C12F4EB23EF8F00811723FA4FE56A0EFE8ED5EBE4 90455B690EAE1E8F1092C1AAC07FC418A6790C2DDA6DF739B9B586B68263EB63 718EAD2B11037C5D26FF31FB2E56AB82773921B00EF07DECAEE2A8FD71AB232C 86865012F1FCC80CBDC4B0E881819601CE2FC5AC36875F2FB5C088436BB11159 813020F0433EDF6D96FD162F5E3241F88BA7025F2B010208DD1DF737FFF1185B 812864C3049CE325E06610404C8DE9322187DAA7FD90FFDF2DF3C86D94E8E792 377C1C1F10FDC78E1FDEAF718A2857C4922FA300C8D3FAC136BA2957C675FBDD 21E3A9E29C797142BA6D30FABB0D5E97AABB49D113A55C4838B253AB8D7443E7 15596B3BDF01C88C17135A74AF78551CEB6B0041BD17ECAF89321E6948E1C531 B227A1F071FC3558501BFFC842A4F8B80C14D9213E0633485A66F899BCB473D7 3C72329610575B6279C781714761468C785E426DC9393564979B1D6A6D55AE9B 4954010208883EC964F35E8363129682AAFA2D40E1ED08A4A1DF27F3DB5474E2 92B917B45D9473AC94EE40662DF06AC9D004541B6F88DF5AA4A36756620CBE83 1254ED1C3C9CA39B09E0D4148DA552B00FC60FF68E7159F556998EB8A66C8EC3 3B7842ACEE888BCBD1FA183BAB95B06B245ACEA49F8CC51A2EB01053E99E9A87 A5198C2FC26E270961FFF61A093A084594E6C0298CF96B251C5F8395ACDA26FC 461E6DB774F6220F8FA04C68519E19CF69EFA73E9A1BDFFE833B228DC19571BA 34B7AC21EB2BF8B1876BD11E128F002AC9AD6A9785CBBFE2D5FBAC307BE7CE5B DDA7C12820028FBDBEF1343638CE166E43B95E6518A83828AA3C3628779FB2E4 CE32DED584715FD18C95D38FA85772DC8650EFC42F980A1ADC012ACD93B7E1E5 FA6453179ADC6F17C94FEA1F4CC2EF6A2A975C687ED81DEB7111F0897742B373 30720766409C534C5E0A42D7221337FF3C4C59BBD239518F3976DC55FDBB8C1C 8DB9CB4B05B1D9AFBAF0FA1D82B1564AD7FC92B6CB3582F7DA309403EB78916B BFDC6F918E26A39755E5AD6394D985C92F7927FB1287FAFF2F60248236F918DC 2E8557C6805B01090A037E8D5C529E2D70976A9CBF3785F4BAFAF9923DB40756 7B6CE8EE83559893E3930790E5917EC3421FEB042C0CBF6CE74F16C44FA08025 82EDA0833C0486CDA66ACB450094BB65F54C83829B47DAAAC9E4CF115FC275C8 6BE583008180F2E2C9B003712ECE32333199BBF9772A471EADE59355FF264DD7 ADFD42FECCD00892FB545DFE555AAA4B273B82BD2740CB8C9ACD144DEEA94188 D1AFEDFA1FC63557F9E527C00AE7D14762FEC2814487CB60E406F8D4A47365B1 F7B0E0A56CEF011CC11345674611EBFB5A7C587C34F786498FEE4F0F999AF42F D955CF2ECC5B64BB1C100310DE5B6C7D106A80FA4ACE0184A6E18FAC544EEDCF 307334E1C2A0CB6E488B21DA3BDDC5B593D5ABD6006D1E2BB56336EA88D56DAA 62DAFDDC379B06EF80E9F3661C6B7AA6787ADD06155F3DBCABAB6BA3A46C9047 5D295774447BC007D5423B9840E2ABACB5B811B30ABFF547A8A6E2C18A92DEF5 D30890D49388E80E6EC7626FE3236AABBF64B21E5525FFB7C802511129EBFAD3 D1E19814500A465DA92054F93FF77864698288510AB599237D0DBE1EECF81C46 F706515DF10A1D0FB06939473BC72429A42CE6E15BA2C97720756D80DDDC171E 7E8202D385C2E5B4A5A011933CE920E98A09527DDBF49FB4DAF2E736B1E42F57 354C91CAACB68BEE8FDD10F4DECF25ABA4EFFC4588DFDB9E98640737C015EA04 A33D5AAAF9AC4A7D288BC9D4A8AAB9B852516E215DF7614B10BEF003EE1D0572 E4654DBA4D71959D403B936339D41C381FC1A206BFA6505DF3082D9FF767EF67 437E8C2A14A8B6F0FB98C80DCC42A30C57C8AC3FE83570A1B4AB404374B85F45 A1056E389A7148CAF714CF6DC26A04E3DE8E2E7FD26F6CDE3E836AE65E593A9D 3FA7A24A32E3E99A152009C8713FF8960FC93A2E49B8F442B81A90F98B99E140 5F0E0253DE8ACE69F1248040510DEAEE069307FBD02B821D1DAEADE6C41111E8 37A80AB702B8D79977DD73429695C13DF81ED3B562FF4C168AE03ECD24909A41 22C579987CBB22700D1D34BB16E5D0B4BEDB4660D34EF5CF0A4FE507198EE14D 9FAF7C97CF769EA9159E1D8210B063141913DD402BAFD515CD746A7CBC061A74 CD6D6DF78AA722FF543C5379A1AF5102B75C06F73E075BD8531353892E1733D5 8143315C0C780BBB21D6954119C0AB1D4C89EA67C0AFDD4607AF07D509F481A9 9045776F08003CB429316307E66E1F9490E8547FE0336BDD8B070290558E0DCE DB08FCF371A8A9FE905E9C3BA4CBD4F12BB2F512838D395BBCAB1488C58122C0 CD6D3634C0F6E193E2F2E8C632BB9185B20D94503E02244938D4400F0DD8FB81 3AB0CBCF32E462A223F9680A14AC8876917ADEDCC9B181D584AA307CFF3B66B6 F59FC840A9E8D1BE101AA1DE41934C22A1017A8AF69D257433C2D2C5A0474F9D 362A669B4044B3990BF83E8906C5B7E2B45D688CF12CC1FF38F2EA47743676CB 55FCD3C6261C6F5AF002869128882E39E089A6FA108195A8B86CB07913FFFA6F 6D8F8D5C9E897D63C174825286953B9DCB09B8475D0675E09C1D26286107E89C C75F92D14002B1289A5E11F059F28FA27DF23FF395EEDFD5F22374FF67F0B60E 81D249898A228A6A89141B23918E977BA79C5F5E6CE84FD35F51B136D81428E4 E4D205612F6DEEC1CE6AE571B30A33DE004A8F096656A3BFAF8BAE8A2C73AA53 D7984D6777540082F3674304D2C3F17775BDF86A27563CC2BF95F190DB3E28E9 FBD0716C0F1B0D56A96E2E870882F03A3E160621FB469355859954858C9CC2AB 06EA8F87EA163B9ABC176D704D3C17A37508864381659070B071B80C79D6D60C 7858A32F5DE87B1F818E78048CE81E229FD7BD91286ECD773147F94E7A184450 D1060F0FBC5A8DB06BB4009B3F5F50EFEECEF8FE970E3FBFEB5ADEDE9EAC6A49 AECCEB5378A9CE274BC7F25D03CF477C2054D313FD988A4D913D20ED3981CE47 8674501E487FEFE5DD91CB0E5ED24BE1D2D45C88DBE1378B11F6B7076FE56BF4 8E8925E65FBF23330B9C4A943CD96EEC06A6073AED304CDF520CD2AC1CFFAC7A 6B8D8FFB7327834C9DADF578F250A51BE64D27A2B65A16DD0204635560B47075 3A054F7159EE483CA06345D3D55EFACD47AD32A9D7D7404ED0CB742A3AB8C47C 2C5CC71EA3E1405D6E114DD53D85C2350D46A8E4BDFD1667C65A8152D9F3331D 6235F40AE36EDB507325E21496725F3351C239207C0C4BBAEE2DC7D2797B8818 BEBAFCA4FEDBBBBBF3FDB633A0C21A8BBA856D4A3119394FB00AD092E314558B 99CD5B138D4A42BB7B621DFCC2A2E2AD262479E878D8F26195A643BA0D13F9C9 FCF3B6BE5774DE6F4564FB82BA3B2B9BA29A5F406F1A135D46DB10C80CA11E1C 39C9A74A18D8EEE86C85556F8B9203E00DE0B1A164134E48FCE7F37AAB98A79B EAD809EA81192ADD3D3C6B35E521AC99E190262E5454C7170B081CB8AE338D09 D489BB694D228CE9C05DA95297BF106A3B71A99A5F199F122971F5C4B0B9C53A 4344FD111B92AF456697E0B85142B71FA56802C392C886A408558A297EC3C717 FB803CA1002361034D40420699FFE3C149800137EBA3AD99AAAD74B471038675 8B073F692D278E0A088D3F51360C2C79A83FCDABE9963A4D636631310E7C6D35 EF02828CD45CEBF9892C2761D934E07AF32BE74852C13FE63BD3DFF3619CEFA1 25F5FAC01306FD99A573F0F5F29116967FFA22C9236EE8EB052488C4CC204855 EEDB80B30838AEF66DD960389684231FAAB83750575E4C9BAE860D9B0F838927 791AE22921BAF254FE561771B7A9164362D6BD462A82763F6D19737ADA1C2B92 BD72443D7521795F9D3702F83B04BCF992667CA255A3AA539CB71F25F2D0ED57 9E0B180D1C199211FBC17EE282E7CA9E078593E6340BA651AB949482A0760790 E4C3F1446653CFF964B9A3142FF4FBE8C75CFBAEFFEEE1810D38033CBDA2FE9F B42BBD97740EF0C118C7954FBE81FDDDC74608D036A3BBB75EEED4E1A4A56381 0F57C993C4651E4753A27684D170EBC495D09202AC0CDC5F10267EF26EF4E7D0 908F4524C91AD27F43737253BF0617559F2EB99EB26643D8C28B61F8968CEE7A A79A818887ED9BC3AECE4A35AB15752A368D09594F93B7A741282DB5C6E42144 EAD79AADE23733A43500563C3AD34E0421D1E3B4642EC1D70F0054E3DB6CC218 FF930B11B1CCC3E4C90BC523D4635161C89CD9FF8F2C4F6E4127ABF479914610 4D95589775902AE3993E1CE3D4868A1055BFF961CCB244AE25C76C4CE556B8AF 98129765EA10B35FFF3D24DE1CA68BA55E133084CD2562832630E302C3823EB2 5D7293D0C760EC1788BA6BC9ADB7AF6DA83C951E0A23AD98EFAD64AD387F7764 21320EAA8DD04EFC4C2BC011185DAC3DC1FEF1461F3F9ED515E2240433D855E2 0229E1D5269092D0FF790539D2946A608E82E1FCA5E3A1254B27AA134C300FFE C7C724824AE8B8436577129608078274BB69FB6A026D0CA48B97314F596EB375 390574158057D3E1C3EA4AC61BEC73F81C706A6C7A9B42EEACD6A4B5C4E69FD2 C68AB11CF02CE3D9B7148BAEC69F92FD7DAF6C9D772BE60AD4579BCE18396E4B 60EED65E6E2E62B283F135675C188F58C831B3A7ADCACACD39871EF8905B3264 567AEEE25FB31D64C6596D60597315F1AD8F74E5577E6C966F8F65B001850D1F 39F0234F0478F6DB136F17F20262CC072B25202BCC8A67EECB03A2834136EE5E 8FDF55397F3572922DF82D25376DA73083419420003E99A020198ED0ECA44A72 DCFF31392F59E14720BA027A5A5E81B3C32BE7DBEE039CEA50AFD5CF9CB9080B 3952949A3165C5AE1EF9D8C76E0C901DF5013469D55C8AFE1554A74D6C565533 FD00D77FAA0311910C9C191ECBE1A0FE30A4FCDC3909D4F6322DE2DE90865099 ABAA1A087DE9B4642DB649ECA28D40631EBA0B3902EA6D70F9260EA9DACBCE35 8EFFA26B2E8BF4567406788443950D8A71339F595C83E28111FC90181AF60EC8 9A7EDDE1989A2678B8C570F5D0BC178C4018626B9AC851604F03C98469EFDFCB BC34589B59973E918756A2C1BB7D1811BEAA17D193DEA92EB273D50AE5C0FC30 661B330B083311E5D971D70DE46E2239532FAC9A6D8FD913E6DD03F42ED6148C 4F04E6D136D41C24BD9B973109A9B63233E51176EE64D247DE1C5CBB43F568BC DBD5A6AEDFB68E5A0C8DC465E9949A96665AB78F41132F96F3680B5A9A79DC44 828FBDA04368F277C40F629961EAA9F3B253276EE252478A9F409C2FB6447C65 37AB9FC9A216970D7BF6912FAFC92BA0C000A58950291FB3E47F0DFD493EC7CC A99555CACEB7EC87F4250AB92E7136500138087A19053E9152B6F007B8D3DE8C 96224FF8D464BD3289C08AD1E05B9D063375F38FD42CE97ADAC4E5B83B8A88D2 B2634B95A0DC0AE6A407E62D153BFC434B42680FD0F62F5FCF0818182F182D1D 6B9EBD47149F8506CF38BA61D8AE460A8B660F40DEFBC9243154E5683EA8D574 8D48276FE5128F972D96E42D89E374F7D8C72E70F84F028263507BC96F6B2B92 EF4B992CA46361BA3EDB888A6E5C57688198EF10A616F7DCCA55B4E1645FFBEA C2201D5503101C400B147CA23A805AA95FF059120C677C32ADC486DCA6E775EC 23BB704624D3755E09505C395CC3AB83D68F10E2D6E1497BC179F3CA82A3DFC2 38275D10D3253264BA9C32DA47C0088660037C7A789C1DAF75D0476BA9ED5B62 CD30BA0E268DF3537F8298BDDCA16B1C970C2863B21CD839FF6B713438447A4C C58C1F0ECE39E126AAC2353E31B6FB808253501CF26AA3AC48433D4CE5A946BF 10347C814A195929213655345791FAEB7986B1DD4F2B0C9E7116B11A4F1157CB 933B48B488B7DFE700423AD4FAA7E26F003B87B6255BB607A3A639830D68D663 A3350CDD992B528E3D2176DAF79AC03F6455B1BD626ED15299042B46F03BB46B 992109329C6F67F1CD92A620FB4D806558D6CFDD75DE4F7D6C558CD5325302BF ABBF40001F90CC940511F63F32F112EB958944E37A603642C0CDFC7941D9EC65 F1F5B2805EC17A6662FABEAC3F1A7CE8A4958D64FCD57759F5CA294236B5834B 0071972DBCFAE0D89A1BA76FA1EEF2C8ACB12E45C8D8939B3EF1DA3970ECD2A3 30AE415757A89E44CED997FFF9F6378FDB532ADAFB25872A690137609D91405F 4FDA7B432D432325F1467A7C85363A9E2825F86D5B9F9523E53FC5B58D82CB28 90D43D172B2CBABDA71E5B83928A6271468C197108584BE45647AF5C9BD930E4 18E321AE20B3D28980B1CA53F8B2696043BCC4C925F218B0AFF8E8C2BC1B85A9 134BD28FC51E5F4E803761720601C5D9D87921116C342D832BB14EFA08032E5D 7C0C4F14F118883DBB1CA0313B6658E3BB5A7ABBA4970CAB64E66515031BEEA7 F0311CD7DF8CCADCB38103DBB1D60CE59FEF567B2755D0A65100C8F8EA622025 4AFEC5D179796C4F87808A76B3F420A228544CC12427AE7A5E2FB6CD76D4668D BD5A22FF8161EF3FB20EE9FE64EFC4D1E466DEF81D20A395B020BDB7358E80D0 6CCBBB8725B9AB973B060770E4CB902F429D75295D1E5ADA0BDC01D0DA7A4ED2 A21346CC735F3E6662B87BCDED41C39EB2174C5ABD9C89A4A6554B3523E08BAD F208FFE1095E6641C548DC0B7116851695AE8813E691347526DA61EC59DB43E1 03BD503968825F7EA207E22EA04656780C15E1E9D0A00CF8CEEC4D3FD48A4E93 7E82A2D0F952F5ED616618739ADDA48480DA4665526260E4269F135C89C2F28C 28B435A1A40C924B79934D6CC536A58D2F102CB46E4C3F6F5390008A7C7B5E28 4044E385A5D6FBE641B6FB074C4E15DB9D25152E503EB7DB52F45913FBD962C4 550310BC3592CF1C56A7E19A73261219812CA9A818856901E9F0FC46FA53FD67 20A7AF35375DC845C8A9BC82F46C061F46233CE3F963C6AC49CCE0936A1813CC F7904CBE756A07106AC3D9B58C28EB405FE50A12710C7FA7B4F6900E163125DC 43672E2C565C6959C412F7CC333F49E0FF5B1AE666E0770255C43E1779A67D7A BD794057140D8D1478B7B3C43C84C2C2E56DCA12A1A536F80B16BF9C5244FFB6 906F2729E0D6C3A6AE9A837CF39F81668CE7B299F4EC9825892A961935E4C81D 7A9FE5D9431283C53770E41DB77A70500A9B21D63B2F073D75D8E11579FF7C63 3D1BD1D11EA3C49A594D1D83A733ADB8D887AABCB81C32E3913FC4B2DD1DFF11 10C193CD5D5D5FDC8080F9B99C9B29A86ACFD94EAC9E052790D6A46E5A5E946F 6AB9541056CC23323C09CBA556F1B0F28BA2C30E039B3552DDBAC17B9311BF1F 648D3527E8650B3FC89CF81256E9A4A9054D9F1A9839BF7E0B875D25EAC8AFA8 2B5663DAD7CC7DED3206BF5957291DF837535DB23BA63F9F7ACA7141E1490A68 327E35FB7888C160C2D47BC4A7CD84194FF52646DF43AC83A51489481CBA4D20 1E5094E7AC3EE66A5828BF1D87A530D7786577F164AC3D5C0D624FC6CF1DDFFF C2 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMSL10 %!PS-AdobeFont-1.1: CMSL10 1.0 %%CreationDate: 1991 Aug 20 16:40:20 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.0) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMSL10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle -9.46 def /isFixedPitch false def end readonly def /FontName /CMSL10 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 45 /hyphen put dup 46 /period put dup 47 /slash put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 56 /eight put dup 57 /nine put dup 58 /colon put dup 65 /A put dup 66 /B put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 71 /G put dup 72 /H put dup 73 /I put dup 75 /K put dup 76 /L put dup 77 /M put dup 78 /N put dup 79 /O put dup 80 /P put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 86 /V put dup 87 /W put dup 88 /X put dup 89 /Y put dup 90 /Z put readonly def /FontBBox{-62 -250 1123 750}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA0529731C99A784CCBE85B4993B2EEBDE 3B12D472B7CF54651EF21185116A69AB1096ED4BAD2F646635E019B6417CC77B 532F85D811C70D1429A19A5307EF63EB5C5E02C89FC6C20F6D9D89E7D91FE470 B72BEFDA23F5DF76BE05AF4CE93137A219ED8A04A9D7D6FDF37E6B7FCDE0D90B 986423E5960A5D9FBB4C956556E8DF90CBFAEC476FA36FD9A5C8175C9AF513FE D919C2DDD26BDC0D99398B9F4D03D5993DFC0930297866E1CD0A319B6B1FD958 9429B9D40924DC059325D9D4CC0344F3F997A99E6CC0676735EBCD685AAC9142 08DAFEC78BB41AFC2F1C219910BDF41D6279284EF600B69776CA15BC8A34347C 30783C52AFA60FBE3E353E2AE354CF87B558776A22C776C7A0B5AB5CE1F941EF C2D9CAC37294BF407A671F10E4743BF842143F4F7DFEE643BA3BBD8BB9E3F24A BCCF7F0ADF8BA500620C81033EAE8C4EF2C1DEF13AC575F1B3BBB66F093D3B78 5412B82B67FFA087AF57182B2230F9F2137180CA58A7D9B2C822FF04BE6CD01D 43B2CA7058C7B953F6D9B5D6E91ECBAA5CDE1159B0E59C83DBAD96D6C8C8BAB1 374EF652D10C0F3EE7104472C98DD3572AAF2D45A70BF7061447E21EE3C3BF23 DF39C2D1B35B42CD5297BEBE6BC94F7C9DC6E61EC67E4F677256FED9064BD3E4 B51A71B1D27CA4E5AA9E1D8080E6DAB5310711EEF87C40859FA935B19524AE83 63B163FA8397BDFF443227FEDF7DB27DC35D89FB1C5E435DA0619A5C88AFC73B 89A2DF5E767C5B536BC7167A840A0C32BD57A14DE69A7D0D819AC36FF32F908A 5070F32983BB007437E3500799DF5E0AD3710A4C0000F0098D5BE99F2EB9C1C2 C444FD9552D0DCA098A94B3BF176F511CEE13DB7EFFAED7C47B5ADCF8D4700F5 7A5FD1B49560969BF5C44F3749370663A04776F749DDD7B50674D93254426C4B EFE264BEE7810EC93784B7C01A7F29EFD92547E13A2C7851A2E709FBD5B87850 4A44F08F56A542DBE072D2FBC58D9E6468E1AB858DC35240E30D31C7AC13D6C5 7D2BB634BEE96FA0E10F842B11A789F72A333DD6DDCB1BC23227EBC406E50B40 30AF0C48E6359AB0C46898CDAF1118E46BFF8B00F54EACBC2AC262AB898C42B9 2E080C10DE923C1F7BD11CA700DA95F7E94C4C77EB24EFB7D5DD39CF43896343 AD32237117AD4B4C24EF2B9AAB4228720C9F9EDA61ECC327D71641E9657DB045 3E35C6ED9AFD4B88FBBC287F2B08E20CD064866D01062364E81E3594D85A3216 396597A1DFC0BE35873C5BF3B12F115AE64354DE66EACD29A904A98FB23A530A 64D6DBD4198DF302D6EC7460A65E40609374E2031E0A3E8A3CB33C9823F1CEDA 6857069DCB4384BD963FE143AB8C46C2A6953B5EE8CA955E084517BDEB8A6EAE 7004A47347A65802F42FB1C3E2BCDFEED75859F600C521207B1F12360D8B5B5E BCDDD9A8B43BE2886777EAB5A7006AB74FE08677A20579E5E0B6B949759F8346 347F3AF2C105AF9A10341270B338AB4FDC2288B79D98A54F8457205DF24ED632 B28F3773A7D9B85113CB50A9C472C537EC2F2AEC0243B6211664D78DE60EB3C9 717285D76DD931E6BFC44864BFC7F99BFDB8A2954BF0C5712F21B490CD7E416F 12EBFE13341161A9053FF78435759B60B0F54888463C4B456CBAC7490988317F 17CCF703B1298BFF7B8F1002A86171BD2B7E9D8C4E20D426C132E7A9A1020653 B82A9B932ADB1C912AB90997600AF5D56DBCE887D79EB994466A78D9040C2034 1E537DA15822B32E17DA808628519B5D964B961125D6CE8158FD72D84EC1021C 68FB5F28CCC9FC14CA321D290B9A2F8A9196B06F787DC618E6C1957AE2DD8C3F C2D2BE2A46B8A2CB9BA13255AA74ECFAAB942328B176D6E13C3810CF28B976BA 58E89F16B00B2BE618A07955CC9C46A95F5A07FB240D95452CE799C8709D45A1 85994D7BAB6792B58694594B881C240F3C36129EFBFA4AC5B5074E390AB2E39F CE9E366EA4E95A5DFF8CA2E144E2F0050F512414FBDA7A7EA24D2804D22FAA04 C2261EE07DD605953453B94243250098753EC7FAF186A2BB5FD481DE92D3A6B1 E03DCF5C2E2EB80A30D0569ED52550B5ACB2BBF67A86D4F4E65D868B2178AC94 14C344582F4ADB60E79ED161C0B7DB7CC6FF8C391FC1B2A290B33DEAB127C200 C309335A5601E10DA4BE03730AF8297EF872B08C54110804CE0FAD959F416B9D 5E13E390C820F540C109F6D0F71AF41B0587CA7450810019F8CAEC40CFC3C617 5D0163AAAF368C1DDC966CAE0BC65A31083D01CA513CAA2A5D3FDD301A557CAD 148344C2463CD950F033DF4686BC452D6206760EDB2EB00026F5318440AC8795 D1F9C0595F392BC030B70806C8FEE3DE6C140547CA3CAE9B4B3F1663CFDB5519 6F2790055E57B004E48FDCEC080F8C8417FCB849E34D5C85CDE82D435089956A C0F3E924EB2C4328CBFDA7D115BDBC58716D98B4F49A6F2E841AD8B31F2148D1 34A68D8E23ED7AF5D891A520ADE49714ACD727EE708BCB6668939DCE322AF08E 53F071980E0077FC9BA5A10B3BF911664F61327233022B59E72F38B2A64E90AA C858FEFC4476C42C6398128D10F889CB7E0B96E4D13EFE60CD99998388CCB554 C7561FCCE0BC98152D9E4FB1D7AB69A5BBB87CE684CB2795F90A682210E75F9A 539CADFF715672E0122236E42A8F54DD833D4F99E672B390CB63849D911943E4 CB0C6C9693751380E7ED446DADB9C7CD98E042FEA6E76E473AB981D8A5CED403 9A06577BF4960204938151DACE2CB21BA653A580DC8E57500B172839CBDE3751 8A48345DD78508B4D5B35083973E026272994D3D58C6BC0F505BFCF708388ECA 514F0DB510FF93CF4673EF0A19A89B0E08F3235BABE22638A843CD1B92DC72F6 7EF613DCA9053AE8177BF3650C44CCCE8F1B7CCE6EE269F54F8857B5576BA1D7 8403538A00B1675276C38CD38CBC7B73906FAA9A34DE35A9F03CE84A0E60B499 CFBA23F6C2EB6580B07EF12D68446359FF50E039E0AC2186499E9B589B6DD483 0D432890F26241863A182314369ABE41338B2883A7CCA07439FE96465A5DE153 490D3DDFEC94DFE203CA50520AB3553F6FF5630404C2A2BCA0E65935210CFDDD 433842A96E7646942824D43D0F9F5DDA9195850737EDE2D65B769292D5427023 AEB225160606F8D821F08AB9B33E8C30D492E1C57A3259B1CFC1C56C5747EFE4 792D365BD95A08758383C496F6D2729EDD5297E8C1571C2711F65FD6D6BA0126 BCC6FCADF50C3075B9339D9194E79A4377D728EFD1E597635425407FD3BF22E1 062866AC4580ED0DCE3329BD884F5E022385FB0D020CAD3ACBB9B0F696C4C911 8C26C714194A606A95441101F427247208E296212B4FDF1E68CD054122C64CD6 C0CD1EE077F2630FC30DA75EA8C3DEB388418C004557EBE97A136308B2E8F079 2A225D5684449EC17A1A288265CDC0A0FAE05DF0F03AC4C61B13C2AF9C5AEB97 4E63BB904FC564A28601A9F79E43155F3560A67B2B49EBDB1399962A2C0F55ED 73FC547D024FE86F65FE2AB8EE5B65377F9458077B0C6D31BE033B258B87E1DE 2C9646601F49B17A69341E8064F6DF881046488C2FA69AA0F9BD635057256127 C4DC77D9D71C895D3040F9E6EF7653BE1F904978749D5F98F531C5564FE02F4D 000DB6DF12C17EB6B9C13726B0DD1D8A23F5CA8B984A350DE453F808963140E4 3248089231E94E9B298DC62B46610176ECF3B8A1C77064CA3E90480C27FB8B01 5E06A2CC70485242DE5CAD12DBE8037433E39E978DCA6D59923C557FDEBCBAFA 48B435C528845F0B7BEED2323CB3622C19816F2AAD6BC7027E36BE571A1C8FF9 F2090A806CCA9B4A869E5E15EB363C608EDFD82C88A11E6644978790A0AD0647 A786BDC3B6F0531B1D5F01AD551C3C759EFAF72E146CC7BB125ACD1DD6197DC5 2B3AAA053519F55E433569CEECBA8009C20B4AAFDE97B8EA362C8639ADB0F771 0D7AFD709E4E16C1CCAC746A2307505A462F77B1B977F4EF3BC32CD87968D463 C7B02975D3269F1E3AB3CB1565CBE061F928AB2943B43408891B9D3C6FF864B8 FD69D33E79951101FACE7C635F8B2BD3F45C27F4E2F119C969F552EC2C5D047D EC3D0C212AA56F51240DB8861DF7398C3897B8DD8F1B2400FB49197AED7803AA FC07426EF806A7CB2DD05B8978996754E72BD2A3078E578191221EC40C71F050 79257CA1E7B0EAACB2C0DEEF23C4B2BCA93AF1BB58D94BCA90BC12A50FF9FC32 253C51DC821ED1FA42318788342A8C1812EB45E1A1AA66D9CCFE0D7A107638CD EFB007C6A6BE3D58B81AA688D787F7D0553677EFE62A3E59C2874A88D5719E8F 9F1E12B507D39FF42589C1475DC5F0974B423DB8DBCBA2C04075518EF5CD747D C582F0DEFE4F674617DE189EF2030FB38194C08D3FF6D0CC1969494D86A74342 337F5A3EAB685175FCF927B27E00F69A3F0B5B65E6FCB9C310ABBD731CA8D647 F87D8B2BAC0D46E4CB24290D064B536CC0FEE46BE2E0982DC832F17A8668A78D 313F9943C5CE466123BC3B80122B69278A3B61FD4C5ACEFFA8B62EB6A1DA2AEC 7A7FB0D4B1A5D3B59235430FA156F45CA682AD86F3FF33D94C0867AD1E1D7AD8 7439A4E3ABE919C6E3DE041175E0E3A1F2A878CF7144ADD7091DC52E5BE98830 0AB8869740D57C6013C92CF23FE175EBD5C26330CA8B83F1B3EA50228085651E 64F36D1E8B1FEC84FE96CD2BC8AF45198C9CD8388301B1BAE9926BD8A014CEAC 3F8D5AA5C6DD2232A3F2FEB58E86F2835FB055ABA8567A3E53D0D7DD404E0D99 7F2D19678CF28BBC35AFDD80DA0F1F47060CBCEA4EC5358FA8B000C570169AA7 6718FF6DD3EA7622AB8725FD764C2EC14E2DCDA0548EB94981931C0A2FBFE083 37D342A73ADF7BD3282E25390EA45D5AE7052C058AD6780ED90AA5007669AD9D 839B78DBC708D312C5E109E7756AE6D7D6BB2191FE1B6EC56B0721E6A53C8CB1 6519FB1F37A8F38EC33E4A5766672E4785475A0F8431CEE6D66FDFA4680BCB28 4EFAAC29A37BC21D9B884F508738D5F0225ABCDF34CEBD4D173321E328F877E8 590DA7057B8EC485BC92A14DFAA31A63A6244D1AF09F29F0E36C6F9CFF260EED 10CC0D2730237B4C7D32BFDD509B6E3502A463284271A3991982887CF56DD662 0654E725CE1642E0816092D6EA59CB60244DE99E733C2C8E990EF76B70B20B00 734092F47103AE3ADD001D19F588546D8F9E8405290CA23BB3D3FA81F034EE89 EEC731F922E6F28BBF12798A0A4D6856DC7D1987829310C32CB81B5F85B92FA4 3DBA34BD1950E4E4ADD08B54F12F923A36195790A7D91447E91C75DB1D17F351 D2FE11A9158534ADF9D06E2CA4BC2F11E9914AE70550D52C5667DE9DCDDEEF24 E57C9F372DE435F3FFBB3BD498BD0B56B1B53534CE9F74BDF113E06268AA1050 CC6D925F17CE2F7AF499C5DA843EFE205E640079F47F5B5BA0F8FA27FB30DBBC 3D3F95DE3D72DA6E726F7D599AB903EA90506732D051B5541C5952D522F354EB F8B4E8C34660F9A53F9299DABF9C0CB5EE6F0685E522042814F58A0C5B54E0CE 58BB142FF89520E7DCD0321598AEEBB393008EFC4774E2B3BAA16C714BA68DE0 C8814BDE1B37E87B1F7D4E8177A23C793F8D3F6CBC6833848CCC0885D01F20C2 479E8F80CD07715EDB2BA7139837DB3E090F2FF71A66016E6805C6CACB18BA97 035C6F33D8CB3CEB57D55B07AB10FBD469B14933299737F2535C97643662868E 41B46920C640A039A4DCE141371BCA56E66A2A6C0FF74A4CF52A851291B7B674 8B7B676307320B1DE482A28741FE51E8FCCCB79DF636DDD2CCD73F2B46C29C2B 6B32C6C58AD847A41486323E5B75AB58BCF81FAB2E7D794191D6C66F1DD1F742 6B0D0356D9460AE3287B98D3613E576238C10B6D18D4FC4FF25ED3A7A85EEDD7 5FACEAB91FB2F0E6ABB6499AE02C3B1E6D2032BDF5E1ACC575620FD8199058DD 499B758C1B5C0B69F930F3A4C73E2E363168FD7E03352DBAA3FAEB32B29C34EB 7DB8B049FE0C20AE7B36DA2F783F8AF72CFBDFC698CEC9362FB188DE13CF08B4 830993A117A1F06996B000787DDFBEDA484266BF6956FB0B27CF5613CF11DF1C 2BB3677E8CD75742BE2DF91F646817E1EC1F60EE24AC8B116CA297F57CF6317D 0F098301800B7664C0C19D12BC6C85688F105D3C91F18C6166EB9E586980FD40 1928B4190E3DFCFB858DCFB0B8A536D14B9AF13BA62BD71969E9141ADEEDAB35 1DA0931BF97D7749C4F93577D4DFFE52B373D4E88D85BE4F9E87B858AB32C26F D4417FCA56EA2EBD9C96D3596D09781E09AFFFB1B4441293EA965FE8F78487A0 5B327A789E1104D30C62248A62660C3F5710E0DE61F6F5DF848507F1CB7DCCDA 5F4D645939ABBAE1472F2704FEBF7AE27D7075946A02E322D43DB7A48F75A467 5E081127E8CC6C1F4E674A6A8883E67BF4CD67DC016F0734DB7D2D1CA01FCEE6 DD0B05A18A0FE8D678524A936B4AC20E512606DC99F412B589DE60841A0B67D0 82F5F8202C1C561A60CD6779FB9DB36D5C210973BC6460EF7A01271CDB1F1D63 FADD31E847C3B1EB0B9D4803A59CF6101D2178B0C68660E5078DCE5079FCCEEE 1DBE1E9FB0ACC7C973CD013E06A8D0D99B73E863987676E852F08756EE0DC548 D2ACE7C12532CF8A53253722C0AC57FAA8E9B95916E30B46A8481C6607CC8979 012E32098D7BF25586677CF9349456D708D37D676AB9E72877A4AA616389EACC D4568F515BFDA5F56938455FD44F42AED19E9933930F0BE06B999D82C9A1A37E BBB23B6F155C8DF5CD9374D76DE34F099B42DD6DE794BF68684DB697EA5ACDED 49880D90DBEC3E5E2F5EC08F1EA04B29174D918F6DA252FDF531D7873BF74871 224BCB8A5AD6D87583AEEB673FB02EADFE76CFB7D08ADD021FC30DDE27E77D7F 50F3B5D09196AB64CE919D4E991D84D1D583763D5ED14EF6B106399908DBAED0 D3900D1E15205C0F4B5AFF9104926FEAF219FEB0690552827DC496C10556441F 60FB15A6D64B52B2F84C6E49DFDF59816D67553AD81ED5573B000FDD6519864D C384B3D60EEF2B1BB5C1141764AD6807DBF37BE031D670AF8632BE22A7076AA9 99555DE31320B458C792EBD69279F58EC7317B1A52D0E51E950D76FB2C254C11 CF91B8EB98EA650ACCE188585E642D17A211DA2574E509EB4E87EBFE313CBFDE 51F501C45B182D75EBFEA3EC9B95691E097E46D792BC095C6B0BD266B097BAB7 9B8ED5797C17FDDB538AA00DB25482823B875CCD6E5EE55A76FCECAFFE8631B5 3E4C3E9EC1E5408A2A2010FF96502D1CB940350524C797A89A5FF8E6AB47E4D2 80BBE24B89EC689BFB00B9C5B469620DBB2F0281B757FF3AD2E84EFD0CA3D456 A481978D788B40C8EF363A41B2C85E0AE198216E29A17D67D0FB19919879EA31 57B62FA6123AC99A36840C6432895DC4528BE0D2FB5FE4F24F5DE3DFC5CE5E57 CA4BE5EC998712BE30C680B8DD1F730CED756221598A0A8E5C448800491D8907 A80C58E0D78D4A53C7B651177453802785A39C887AD73E87908D1E6AF244C67A 9A5029E17CA9F1BAFCC5802E842C33B39275F046C809F2AC427279361B3FCA39 154E1175EFDB43DCD748DC7ABC240C8AED3F4FD78FF4C7AA684AADCEDC564AED B35CF787921E74B51F4BAF2A8EC4BB2C3A78D2CD697BBAF16A14236BF7607F81 6093A211924ECEBC1AA68511F7D9963DEC9689E801CA25DB41B89782A6471A62 92965E950E21D5E41CE5496D95553FE6B9BDD94424914A3DA9F878A28BCF77B3 BDA77E647D03250DFF74A2D17CD59BCC2763171F0EFA759C453A435F0AFC814E D64E3EDD354A334150402AC48A6F84693B2C10E91C67537B45A5308502E96460 871481EB917739EB412DC4262012D9ADED07CA03BABCACDD04A6C3A87F4938CD 6EE57009BB556DBCAA1E208D1B2C03F01E47EC0826C99C8A8DFB89212193E8A0 2B2865539F8B7888664DE8CD3E5A193E6320EE7E111EF5A3EB73DF7ED921E4E7 A26B1B1D18D92D78858086F7133DF3ECC8A80E499C576DAFFA25DA530769829D FC01632F7E18C5F481DB0006621F7DD4320ACEF939AEF57A41A11E6BF8A183DC 6B2380A390E5F3568AAA53ED30292C6B28EC7EC45C17F471229E37FB8C1E5582 B480FA1B647B69280035A0823C512F4AA0286201B2C9B7CA85D5FA65648F1479 C86882D06BAFC16E0BE7EF0F4E16FBC4ADED7F49A2DCC9E151E26F1502748B2C 0BC4FECC8B11398034491060133041AF08BF8EF5B1103852F3834F6DD659494D 4AFD896D3E85560664B0F1F031ADACC315BC6140CF38668BBDEC82C202890144 64BB345B4866F14CABC63D744F3E158AEEB004AC1A550502C2AD5F9595170EC0 BE4A0A8D1232E0DEDA7F829B0D1A599BAD2007F9111EC24F1E08022168C2C34A B1DBC6A844531D7A8D21731C042A7B380A1FB1D6B82E6EA341B123F8CC078324 95A5049CC0C46392EB9116A03FE0F1B6168D272D96D8281A1527CA80A16A7449 F31C1948E9D6A0E6550B686D985786CB6AC7B58DB428755875CFAE0572D2FD6F 7AA794CEC2AF0B7099AFC1DA5B3ABB479A7530B8EB9BCE9688BCE0276BA736BA E88737ACD9E781828D687114ED67DCAFD4E7404C7C0E924A9141CC27692BEBE9 5E8660B935A6F18F321E0AFA5B606F67A4D8CDDE5B424E504D52B2CB8E831A5D F77DCCA96FC7D75E24F2D44D897FBBC3E35C98EFC52875E149E2C583AF6C10CA BEDDD89A099F97D70AD5CA26C0CCF9E65352819C2FA1174C157E69D48AB817FC 007ED04651DDEB2FF2D8D7D405B401DAEBCE6151353441860A41731CE520F75F 6FA578EAFE5631925738B325F8AF2B0E15A5B84E9E1E203119ADF574989F3B33 84404AF0FF3EF287A226E8C9877DAAFB358E5F1A5F5420767C0B6836FFE901F7 CD1DF68CA5778B4649759E1F3F9FB5C5748E295ACD163EBF1EFB64785625ECB7 A5060407B009B0CBEF3FF5935CB10233BD332B73F9C69AF4ADF799CFA08EF25C A6CCCA840FAEBBC99C8639A75667BF652CF3FC25542FA6D873AEDC7AE369BB1E C15BEB51ACB928C61F97E45559FDC572003885B999B4B91F66459BA96082C763 A9F7A5C7C7F27B9CFAE1E80ADA4570300158A71016DA3600579434AF7F35AE65 8B267F947E13216E437A98485CCBC940389CFDB05BA3E663DACF32F21978FDB5 18528E1CB7AE189E007FA0778D62B9D05592E25559747E578C17156BB507D6DF 4B4198BED9F33ABD6E93F7D084DB0824F0C351F8D820BD9530CBC821CBDB276A 8C58D133DB076D9BB5689DCA2257FBC741C5F59AECB0BAFF81E0B899291B6F72 5CAF3CE6A729BABE19AD5E6C31A790ACE92E952E82638B6AE9C0F61FF3A30003 22F75DD843E2317CBA51FEC548525A4C8EDE18D2FEA0F6D8FC00B33E44938D2E 88663593AC4D1652680D51F1DACC46413C43902F77790B1C2E266293EBFB9C78 833A274EDBF9BC80D19212D2635532B935766D0006697A7EC775AA3657152D72 53540266F89330E3E19671E73E4BBB5F9A716EB13CD23FEC5B5358C7E004F101 6100FEBFBE124B765BE98D24BF2E89AAD4A27C75A3549CD3907BD582E577B1C9 1543C1AA7625E5AC9AFFCA8BEB637E5EA8C2BEAA30C8A7741D954422171D5086 07E87A41204D0CCBD3A22E2D5184764921F19ED5981C52B539B06EDFF7A3EC02 DF85F0132F038BE6CA49DB6A4F5A17CD5FA0AEC05478BE9605A3F7BA1159A76F 03A38668E6F2C72AA7E4DDE730641216CF7B9A61BFEA6EF937A54F2A2962A320 9498FD339342ECD80A0FB71DE820AE65B80A5B7A8E9196D2530B8DEB0A1FB8C7 15EAAD601F6836A6C8C0605BBB6A336A523A6CAF13B064D04F48F002B579266A A46A47426ADB627668386804EB7AA726E1D65249F6440447BEC02306368C6B9B 0C736C4E5BD2362B7C9F0F7540B5DEBF391141BAE24EE7995303C1967B3DA371 E0E052DB1D5259725163265BDFEAD1798D71912B4C7AE63BA1CEF08FB8A15E3A 25D67D9E3A70A040AFC254086D02FCDA5BCC1EF37450BA967EA9AA5C952AB4F2 64F3D7487617B261CB8DDA5AD34429E3474A5C12D7DABD9F7053B22935909AE7 D1D554D0C24436476ED68B1D209DD7AA80A6A547E045178D1763D596A5CA7AC6 4E38DFD247A13D54EE7F2FF5A3442EDDF7F4894CA301A05ADD6E9C5020076497 F2BF7F15BC210DFCE1A8DB7DB5ECA33EC5A7D635C089620177BD3E1F981D9CBA B1299C0CFB41F53253A367F7B05C110C3702C570EE29503EFCAB28EAE54FC81C 922A0A80EC12E1A5D7C191603CCEB1FC7F41B06F2D91DADB13716D2D1F6BBB2F 927AB0F59DEA31F198D5422989AF7AE03D5F4AEF146323F8977F79540DC4200A 89615E702B72127B7FAFEA8152B53EA8ED9BE3BE7EE935B61ABD0B9C3DFE96E5 B1A47626E4B62D96A9AEA785524FE73F68FA218DD58918D55E8338000DF0F5AC 6ECC8E6ED15AF45B45E74AED4F06C132E8076E21C79F6D313494BA23EAC84742 2F778B9948CAD5BA1D589A3EA21516EC56A5E40D4CC0A5919180C2736D6570CC FC03087BB9333C11310C8E5D814CB9AE8EC2D2973437F8B80C8CF48930E228B1 4B35BFF4A7423DFD51D881829038D15AA5E3AC6AB976D3549CCBBD59034F1E7B A539B629EB8C2FD450677510A7056C1D6184C20AE04B8BE7525526C9B19BC64B 1B3F6BFFB675B7D218D58C8D87F4EB1A28082A923D404CC58859AE55F0F8F433 3063E52630170B2CB806BC95469581FB149AC66F00C26466ED3E1BA6459309DF AE6050F36FEF2453D0CDB3DDAED0FD1E5C7B21A9469E62E9CC09 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMBX10 %!PS-AdobeFont-1.1: CMBX10 1.00B %%CreationDate: 1992 Feb 19 19:54:06 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.00B) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMBX10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Bold) readonly def /ItalicAngle 0 def /isFixedPitch false def end readonly def /FontName /CMBX10 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 12 /fi put dup 45 /hyphen put dup 47 /slash put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 56 /eight put dup 57 /nine put dup 65 /A put dup 66 /B put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 71 /G put dup 73 /I put dup 78 /N put dup 79 /O put dup 80 /P put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 97 /a put dup 98 /b put dup 99 /c put dup 100 /d put dup 101 /e put dup 102 /f put dup 103 /g put dup 104 /h put dup 105 /i put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 118 /v put dup 120 /x put dup 121 /y put readonly def /FontBBox{-301 -250 1164 946}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891 016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171 9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758 469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8 2BDBF16FBC7512FAA308A093FE5F00F963068B8B731A88D7740B0DDAED1B3F82 7DB9DFB4372D3935C286E39EE7AC9FB6A9B5CE4D2FAE1BC0E55AE02BFC464378 77B9F65C23E3BAB41EFAE344DDC9AB1B3CCBC0618290D83DC756F9D5BEFECB18 2DB0E39997F264D408BD076F65A50E7E94C9C88D849AB2E92005CFA316ACCD91 FF524AAD7262B10351C50EBAD08FB4CD55D2E369F6E836C82C591606E1E5C73F DE3FA3CAD272C67C6CBF43B66FE4B8677DAFEEA19288428D07FEB1F4001BAA68 7AAD6DDBE432714E799CFA49D8A1A128F32E8B280524BC8041F1E64ECE4053C4 9F0AEC699A75B827002E9F95826DB3F643338F858011008E338A899020962176 CF66A62E3AEF046D91C88C87DEB03CE6CCDF4FB651990F0E86D17409F121773D 6877DF0085DFB269A3C07AA6660419BD0F0EF3C53DA2318BA1860AB34E28BAC6 E82DDB1C43E5203AC9DF9277098F2E42C0F7BD03C6D90B629DE97730245B8E8E 8903B9225098079C55A37E4E59AE2A9E36B6349FA2C09BB1F5F4433E4EEFC75E 3F9830EB085E7E6FBE2666AC5A398C2DF228062ACF9FCA5656390A15837C4A99 EC3740D873CFEF2E248B44CA134693A782594DD0692B4DBF1F16C4CDECA692C4 0E44FDBEF704101118BC53575BF22731E7F7717934AD715AC33B5D3679B784C9 4046E6CD3C0AD80ED1F65626B14E33CFDA6EB2825DC444FA6209615BC08173FF 1805BDFCCA4B11F50D6BD483FD8639F9E8D0245B463D65A0F12C26C8A8EE2910 757696C3F13144D8EA5649816AAD61A949C3A723ABB585990593F20A35CD6B7E 0FA0AD8551CEE41F61924DC36A464A10A1B14C33FAFB04862E30C66C1BC55665 6D07D93B8C0D596E109EE2B1AAB479F7FAA35279ADB468A624BE26D527BFF5ED E067598E1B8B78188FA4BCFB0B51692D07B0BEBB930C6F0997B437E2C51B876B 61A563A2673932C2045833FAA35DB22ADE12102335D5DC734AE3AC5EEE6658D7 92EB62131E1DFBA441F53EFF9021D9D4C491F26BE8F54C61165CAD778CE8695C EEAF70E3B20C64D4C2B34A084B5770BAB2A974E898F62BFE90F132A37E2DCA4F 43E13DB13C94DFA8ECE2B7374827AE168634FA007F8981ADA046CED3448BF453 FCD9A4F194FA648F9FC0971734BB69CB73439CB0DD021D44A7C11BF295E81733 4DFBA460FF3D654F9FB337E99E6D66FBA87A817EB9CA1536C84833870E3626DA 55D48DE850D3E6F6B29DA0E7C9D681283586F208DB8D58042E3A7CE55BE84822 C98237911453E479EAB65AFEBA3F61A763B40E74535BE56C9D8D06DDF9441741 5C9D9D917439368736619717FAB4F06E2C329AE0BA411F3FD522D9C33AD8369B D7DCC9DF993778482F35F965973DE876FA19E109AA198A00658AB3F0D8E3DDD1 08A573F2D525202AFC57E05D141E6C0BB811E1FE280EEA002B7A45BB363AD06C 318D320D2C81AA5DCC842CEF66E7DF7670588CB39C9F42EE7763A3A17372432A 173BDEF7ECCEA297CCDD76A835C36DCE9DB8F8CB66CC71B4920CF5BF055A5260 5B41A5373BA6E4F63C85671D979EA5EC30D22163E6D206168A3827F465279870 CA80E6632872F721BBCC622EE4214BF723551C846765495FA9921E11FE1A950A 53150C3F5D8595958A47E0B16064CC3AFD65DA294FFD111153F4F233BC5468AE 69585C16CFBFCA32C4B96C161F47B56661DF84FCD8ADD3EC086CFB6BB5179BC3 A5469A1CFBC8620BC711F42D0D3139BCE4E38698D9C574450DB43B5A19FA6D54 0368BA9F7A8DBF96DCD0B8968CD194264E6DD10A958846C278B8C2BAFE7AAF8B 44C84C955F1A89A13E62A054BC76CABBBF6296DE00A79CD7C8C61C70F127618E 9975B59A880685E126F57AD80F8F4D376E1B476BDFDAC868FB6AFAD9D694B561 001623C4D9F55366D053B52F2B09EC08B81901AE0986C5350312E626006038AD AC15FE313FCEE1A2E61F8992AC00CA7BB7F997707EA377D37EA6FF35BFBC2866 A572B31491F9B80445685DBA5E62F166E80589F768FC95BBC79158C23B2F1BD1 25816F1486A64F76D99A638AC0DC101FDF390811B3C118C2D972B2E7587F6F24 7F1DB2DD922D237A7D18FF08FD665355CFBBEE799D3BFF11CD94CFFDBA3E725E DCF4CDE4307E3B199D91893A365D04F43A5305BDD2538E28A0788E061F3A621A B4A04E5063B47F0109C1693A284FA43E8F1EA9B68145FF51C005D3FA40713BA8 1879BFC3CAA881B9D885A0C1AA8BB9A8C848963020A5B15F862E7DCC78F25D7C 56437215999EB78142C128C6CB1E6E75EBCBB1E4614E8516FEB1E68400C61326 D9F9E8A41216901F77D9466455E2A0B45FF50B27B55A1E1DD4F243C92BA6B175 8F7695CFA1E91CDD8651AEBA3D258FFABA6280BF2420A98FA7CECD552D152CFD A8CCC94C032087A28D68332769DD2CB4ECECB15717C245BA305CB616CC72644D C78326E77FA602364A7B1630CA0BD0282FA781E14282982C1AD13479B6178D28 1CAA541FD3F4316F4FF81C53496DCDF5F86E0D7C870FFCD85B36C936B1E08D78 CEF3823546BE4329B97EFA4E2880AF3361C0DD67F77C8BA6F1CE3822B7FBE567 064ED0477949BDA06483F8DD04F891473C8FBF73A61F7C06B20FB8B5F0BF4B77 1429190979A4BDB29D77E94D5FB486A93B8B61DBC84AE06B4E06CBDA3A942043 9F9926F541DDE4E9B734A985F9054493508C5F7EF9ADE372C520840F15F705D2 51826A537FD158C4105443E38116307A1D4608E9C6FEC3353F57E65E150EAC0D B923BA82331D83E41C97ECAD6F8F32242DFB52EAFE2209B9F41DE483C8549B97 407186E3A04011C8301B6C9A6D36D8170F40523FEBA5E498B8E5B7BB28581B5A 08892C2894316068537336338E46F5113462AEA9DA7102ADD13EFD2EBFBC27EF 00B38C25E4E23843C50C888B22BE1C76AC3F85CE148B7EA0F47D72E56726D13C ADE5A5D539A8379887352298B7ED202D909C8BBFAA0BBE7CD378B80488333B88 E38B1C3C8DD17F32583A642A1D0A4408B0C244185C1376364E723D83803813BF 106524811B9116A47F0A3205513EB80A4F798B330C9C4560F98FC3A2FA181680 C83D6BA02AEB9E57310A60C39D31D5BC8AE28BB3171F90B69C11688521BA0845 3F7D6E4CDB496E3F8B46D080156669BE81DE017A70B3B7D5EFD202F26514335E E06DF49F24576733B1BC191480D8C4E613537A80FBB7C408E7562D31833E3405 2C16297EFEA28E55E929640DDC8D9C12D15A89A03C8637336BDD0D712AD5A2EE 34012D38FD1AC70D13C3833B0A055B545F9EE98A463A2B3B424CC138AF6CA929 A7BD80C3A804D5F80153DCA086B862A7D621B47F109EB93D67A73934B066B546 BF15F27517D10CB8C83F7B319F423C16B42AA435231B9C4A05053D7109715804 660B7052FAC3EF49E66AA763DCF07FD1AEFB5ADBC9913D3329AF36A7C5359038 963383D68357C48B254DC2508706B1D5B71B66E2589214A336ACB11EA0E4070E 3F993DACD86186718E488D4734F024DB314643A9488841654924DF275A1A2221 2FCDFDB677FC3FB49409A644CEB01B260A4210613C0AB3FA3BBA7CFD4CF2867B B261875B9C592124D8A5609FCE7B376A39F6AC86E94F40587F69BE0E8B4C2E64 DDBFADD699BCAA66A856556CDE4620A3C104EE29F9523D0ECBE6552A1B8211CF 66D12AFAA3E9611858D51B46039B5EF0F3E9A020A6370B34E80F83195A643F15 86934B5BA8B60ECCD0D3C9496F8D32E70ABE513FCBB85A77D992E73AF8B955DD 5AE1FDC1CD972E81DF6816DBBDB583FC1410D2486F7479F1A466182482EFFE44 DAC31E1F059370329DE19FE4629F33433576C1E3E6B49F122F2F7333C36AC744 BA663E209AB384C9AC13B5AF8E9D0D7182D5F4D1EA874AE24DBA41DDB6586535 8CA487EE4084602F3F2A7A46A1DEF17DE9B98728FB8113FD1BC2A62D3EAF7F83 EEB13A260689B6BC369064D027601C48AF68CF0B507BD5AA8426833B11D5F086 E0759BF00A3044F0719679D27D8D8AFA8FC303917255FBE6C1317702DAAB2C88 4669AE63FDC111F7FDF28CDBADD14E9D82CB39340F567FFDFA4716CB99CED1C5 871E005ED9EF2A8C3BD948CAD403F180EC8649FA7C4258DB0E1CA5F1ACA24DBD B59A2D1D7D920103457822D0F03F7D4CA5FA2D944B13FAFE51C031FC9416E5E3 4987815ABCD52F279B7E1A86F659576B57860004E6E22A6FF097760138E683C0 638CA1E808E4B88CE859772171D8F864F99FA82FBB5909E75603C5010D49C62F 256EF48E28DB392A15716DCDEE0993D3C8B9D7A8DEE99AF3401FA9A39521767B F04344EBC10A08F880FE13DB7E11AFE3372B8691EA9807B11BAE3C4B7536B7CC B58A3DED042A85AE55ADA24E74A0A50BC5747F9C8E816A132CBB3987FAEBF451 22FE85DD817E8E6B9DA980F189103C5E972614AE92FD7506CC61589B2284BC84 A4486A73B619585F82FDE4410A3841729C2A26E7E6FD5052FEEAEFF792EC1B58 0131564B3C5FF80F3FDB1132BC1D83FD8D0B4961AA68000BFB9A0989036BB0E2 CDDB585566EADC55623BDEA1F218DFD343324776DD201CDC9AEE023DF5B98195 AD23DE4BB8EC522DDC094D15A76FD38B85964AAAD1E2DF9513B87281F7106032 D833B6E2019EA1E9D05C7AB6CB34DA376FD9BA187E8BDA5DF7EE06134DA2F577 115F6E891601CAE2BFDB23FEB902E2B1A43F7A834632B6A7784EF9E9A659DE56 5E7E66BD19DC11ED276BC0E117C8968E955629700B639BAE108F342BF38220BC A4C110641D1F70F6843206711275F5C33A6100CD20825B2ECE39EBA78631E349 FAAB77A671146B5A712B40F644B86BB1BF3EE8F75E49ABBC757485C1A53BD9B9 34BCFF603FFF6AE40A641E9626B0F9259F79B06BA573D6A42DCFA21A7D69BF63 E1BCCFE3816EB1247C9F6DFC07A59656D89D69DB5DAB731BC84B77EFE8860EE2 AD317C5F30763FF2C1B9C00C0FD480282FC591C84D7E5AB2A795B1D2B3E50E5D 6061F96ADC97AA2DA0B04E96F8E3961CCE37109474963F05E9C15FDF55214DD5 210DD9C43391D12018AE5480429C9D0738CCB2B0178A8824968536C99CB0BE77 B649AB272EDCF07F46DE28AC2DB08DEABD47C1EADB1B2193EB614BC26FF58583 B4543394A1C8DCB80606EE803B273D8E313179922EA334B26E58EDA4C2BDFF7D 3A7D83E0EE66A4FC9C6BC9863F8F9752D66CD473F28194B9F26D624F30FF8DBC 77A700D39436E16839628F46B0F3637AA4E8BF1B6F5B95CFECD5626B13634939 C46CE51287BCD099E31DADA771D251961E311640C0623956B2AADBD1F18A5F74 8DAFFBD0C0AD49F4EF2880A60AE0DF30AD1425B79DB0CDCF9472D2EA009E9829 56EA40DF5941215E176B1AF92C6374AF78D9E6622CB915537EB9F5DD807EFE7C 9749B43CD46272AE2101C1172A5210A4F71421E75C874046540050485E27FC7E C4A5DF6E3679343F161F3BDEDE5BF274D8B052224E987F4A135D2D8FE7F84EE1 E0BF07ACF7C40DC3A9C50CEDFB0EB5EDE8FE341E696ADC8710EFA61526629305 AC390632DE1B80CBE8B55B2A9600D8B94CBB43F4E0728C08B250A8F4FE484720 E6A260E226D420DE06A87617A3264792743639A0FE4A2ED4D9627E78B0222991 A583A5A87AEA5D695EBEF083D770C5771D7304E17ED5FDA30485E82FC8C41B86 4D68C82CC51D87AF64B277E0DF3E97BD5887C7E1D913185D2FA7F29FF0BEC2BE 14A3E6D029DEA2D9DB4A08B5B3ED8157FEDA81F552EF0918ADCDE7580C48FD58 B0FC972EE053225A5B2264685C7A14AFF0706B13EA016721DAE4F8525B8C1E80 A3213A33114A3007B7EA5CD2B1AF43487F191D22A5C106D3BA83A22673131EE2 5B370CC9430E2FCA3B5E3D181FF1FE29DF3A9E6823F243708D19260EC2BF31CB BCBF8684B4E663F3B93AE10A636CC9E2F075C29F2AC4951E85DEE75B87FE2438 C389B91443C821D4183C0C35E916FF970B51856FB04B61FF8A265206898EA5AB CF60214736A9A0A9C320F462E7B6F7CB43C084589B88DF4217C69434107D8DFB A9F3D9C248D26EC0F1225F842581F27265516AFCD19B9FDB23A18ACBEDA6AE5B 0C8445E30DA6F2611E3173B7E7A6C2BE8BCEE2FC8D688AE82CA35AA85B47C48D A64FDC522636F50ABFC0B2EA41EA35D67B308CBF6C2A86B0CCB58A025DEF703B FD186ED17A94B64DE3F9830621D11F0D94F518030A232D7C5927625B2B61F414 ECEC88EC56CE35BD4AC7F7D4257BA661D2856B8043F236CE60FBAC9186E0B245 9CA6DAA942CB5E4D5A4A59A48AEDE5EB78FE118F766FA9A16ECBB6CDEB641421 7267F61338AEC49F83A9DEA6DD1F7FBC53ECF8DF0C6C2EB871518A94CD832E53 1DA38A4390638D9115136C9D7E3FF7494DD7C2033D39D21FAC65512164664997 785058E339CBD84ADC911F1FF4633667B7C172748F83235C241EF9083A29B907 AC96C96B45CB517099E62B7E1DFC89390DBF51D02F1BF2A1AFD3AE38E3026990 5E9F5A6FA9746C9E61DB1A6EB4F484C4EFCEC8F915F46E196ADBA0D2FDB82E3B 1A97DA40A76874B349BA4D480C360FEC74B1CC187C76128624D1C063D077BB8D F3E50D3CB072C7ACA0F3346BFB1D112EBED706BC035F8C8A6A23474BC914E551 1CA4FA8B354772352F7A0EEBDBCE9CBD523CC03E2C5C03084FD372DC9F7113A8 8ACEBCDA2378AD0570714AD3879C7A05F120D18DC6C0AC7C5950117B9C8D24A1 D59CBFEAAC8E439E52FE8438B59A7164CAF45C78E8396FE323FF38EA05B2107C F20D2000F220EDF53987710F0C0E2DF4230391E545C2D21CC810A8E902323A2B BA82A938A9221298D214BA068ACA55C690B7B7A508BD6595860E880F7AA9F030 27E4243410CAFFD55BA49F5CA06A8FF416F194D3E3AB7192ACF871C7478DF987 16540ABBB52520CBAEEB922BF441D940E813995D4ED3D8DD707A631707D5F553 D73223CDE27A4699C2B377C319C1A0896AA544018FE978F5E65B24B278A108B9 8F3D7FAEFB97C51F9AC0CC60BD9CC620B315C91027B83F0153BA8F7CF627934D 6D44536CE65F562ABF7A46DD66401FA9158F3B603ED6EE02C14B1919613FEC58 8243E4215173307F4EAE1FDAB515F26419DE06FF2DF62D0E0E60563BCA2A7634 4B58344AFFA0F104229A6BBAAB5CC149573A19C5903CBC58009807EB095ED97F BFC664A073337252DFCF946620B1679778D6EEA5C1015B0F73E4DBC798F90AE1 5CC47F90690314CDAAF1FA54C47C9DA655DAD56FE577468C6199C346CE0D5C14 F3190325FEE8CD9F9545625F5F00EBA1B449F55FDD4E53FAE7C5286468677ED6 2F324DB5A9C804C8A2BEA08625C37E2341E5C5A49C06C15F23BBBD08D56FA07D 2E6FDF1CCB9143BDD8EF3C48079B16324FA502C29DB5120878BDAD0A783CFF92 19AF72D3844B77A18BF1D2BCE1C41134761176794957AF3B8634D9C5A269671F 5676B9D71F99E56EF7F84374F15099EB73515268827EAE0B114A10FDA6171656 249A963A32C88761299004EC6848BD76B6D8D68379EB302D2528ABBEB85CA4DB DCB6B0C376D86530F4FE8E17B93952C50D2136CDFB1E217748CEBF8AA6B46BAB 73034165C62F02628CA60EACBEE01864323CD45EAC63832BDACEE0C39BF6952C A07095AD3D82C80E2875ED7B998F8D9F5D26D7416AA70E53760C04D2F07CF734 E9AC0CBE98C1642B93075D96E35AF27717A52EEB4898F148BCD6F792194681E5 F0A396D7E2FC5676FA380A34EFC2085A7D0A5DDBA1476D0823BB77CEF027B833 A144BC9D0DDD83A6986D4153664226DEEA70796247B400AB0C53148D61BC69C6 BA4C4A288ABD172909EDEDB5CE6494B4F86A42572D0BCBCF857A64A13503EC6E 4B495640064B9C4299C0B6AE174DEEB07DB173AB3CD0A00F03E9545386A3AE24 717387668FD6EDFB94402E3512A7A6F14ED8F079ABD4E161D42B40BE5027E3E4 22D8EFD20D83D85AEDA43557FC14973ABDA50ED56948FAC97B44BF6EBBB6DAB2 E05C768D80E843837DAAFE5F4781812CE3364155672C77AB66301A94E2A9E6DB 85EF7C07FA61CB474C2CFC6A2F7D90962B4C0D9B95F391420EA0938BFA21461F B979C547DD7144D2C73A0DB184D4E1152F82A559F09EBF4620BC1B9313E03FEC 0CA4C8D1EBDE10514F3ED772C73E76E67E3B20805A93BBC4E9646827276C758F B57CEE6AF20227134072637C357683DE58A7830FA2227FA344860C2E4B332268 22E6346071A229CA44AF26E180BA8AF72645D356C8AC2DD443F8C9E4775316D4 F832981E22EBCC3D707DF08F12114D104341F83E27734D81A56005E5C0AA55F9 DBF4FB0D4B17BDBBDDB80B3EAA35925C70B846BC4C49D0ACFDDAAB55280E838E A962BB1FB63870089E1670EA0F1E6F810830E100D00759E16688AF88C5E832A7 01EBEAB36927754AD34FBCF10F6B787B6CB1F90EE1C119A62E88B81BA82E71B2 97ED389F742FEF4B76CE6A17D0516BCFBEFE6F7185A54397B3538E190CC19E2E 4CCB233AD9126D64977FF2E89C12CBA5EB2ABF6E91289728CEB3CF67950765BD B6CB85DDBC55A6F452561F0AF5350DFEFAC063CE5F25C6F00C7D2CEF0B880324 A82CBFF49C6796AA0C943440218E59C2A98E43C2D2764CAD05C0C5C4EA10F598 F97288CCEE303179D86191444516A79AE6C4FD1E9E60615E3B547CAB7D471F32 0CD1AF2B3F69C8C047FE1A01845D1F1A6EFED268601F87F8A92211BAB650913A 0A2D98053C511FA63A8B3813E2E2B3FEDC870C5E6206101C4DD70AD1CA223A32 FB276691EDF2421D12A4B330C4BC655A1218AAF015A384B8057A71B8696FBC73 CFA6A9CCEC4AD7B0789E290F483E96E741325E6062C5F0B37C50F75A81D00344 966F1FFDB35329F1653AC58EEE4C4B9E97F89EE4A3DAC15D67B6FA4C814A0995 7460E20953FBD68438F0FCC139724701242D7C45AD30C72141A695453D003D72 AFC26291C1F4BF991BEA7404DD85C825B840301B9215060870B1E5177D0AF621 83FE4365ADF6FF293B7F9627ABA242F0A3E4A608570E46682A0CCF1284961F63 B3E68FAD31F3452B5ACE03F95505B3BC194C783DE0F8BF66CAB795BAC0544191 4D98F68ED7E13FA2A535722B667F6DA5E91E74A01D815F8F3CCFB5B4820E0797 3553604F9341EC1B735D9F96457879D61A216A449D7B8A94C928154358253459 AF775289AD8E86DA52D05A2C58387ADC92B18E1F0D1C04CFBEE4877F49953FF2 42A7654DC8812CB057B305A68B6C22C8BAAE86855EC1ADFF0B3E00D60C853807 20B98B49E7B0A9E1583E685716F6C2CC58162127FC8558AB128B53554A679763 512DC6999BE36C0110423659F580491D0071B4AC2374D5D305AB506B24E63E44 BBD84371A903BF4CC762A0E0D3142BAF794A332B629C0C8F87366F0130FB6E7B 84BF4D812759F2AC831D1E3703177215908039D66CF07D17258BA2B34EBC5D68 E86A5F0252A7FD1EDACB59639A56C710049D5612818EBEE157A773D8AF209CD4 4A6816A6BA050D5C23B85C53E6C50CD2ACE0B218C8F87A54671E271EA0A8477F 4A1DD5D223C0C644580373A57CD67EF1CCF7FADAFCD53843526AA357F666B835 4BB78097E85D4D9211DD8F506380056F03D9C9DD9EF63EE9AE3A5FF0F74C654A EDB34C3E9894E6248A583032501A0C4B3816262300859EDDEFC8B4B095130B91 A0E583759F16CB9E5B38C42CE172DE2DE760A9E994233F006CD772964A621DDD 686F4DE3DAA62A937ADCE746FADF3BEF3FC2F90C3661FCCCFAD07CD4C22A2F8C 4DF29BEC9C4ED7FB3006301DE829E18EC81C8B7F27EE3AEBE4292548C844523D A6F07705F4F16891D5C310B62BC698014846F9887925163C732666B6595A19CF 4344B5391DC011EDA337BB0D00891E6CAA8A6DC61C87C467181950BDCF13A7E7 BECB71FBD2BFCD3D93135D5A508D172C3F63394A741E1F6764735A61B90353F7 B67797C681A1AB28131E8E29CD12906A9EE1E2844451FE9DD9B0228AB93C7310 F2FC310DDABB8418B1C29DB475E42233826FD9D0800196D6A825F380165E27EB EE33F99FCEC55AB289E5D5BC4B02DE34008BA722EF503608673CAEEFC884E36B 2D2BF1B6410DE582CE243523ACDBBBDF75A886CA62C634F99A8216AAC0B762BC 4312371C42DF685CD54923B02A5C7610CFBC2F1AA39F0FB7EEE423B787308DE5 634071E08F7659C70A6EBB94826EFF8C817AD6A01B13E91F0F15F43100B0DB6D 052DB9CED475535E482A58E3528B50D66BF785454A17DA4E4280AAF58F6441FF 0D18F744E745FCD33024713DA26FD532E640E9BAB1195BCA469E9FF2476E9008 AEF4A4A68B5114A7C2A29448DB7A9E93AD6B06429D760AAD16B48FD9D5395480 36315FE778F795CD7B4F4F5081F8636FE81681E643BBE83740B8393E22293B6D 008C845E6B3B5F518B34337644792AC0169B793093D308641F4A4DD3DE51AABE 95E16160C170D0DCA01374D0EF9C0C1138AB40F2DF6E4E7E5C45C8707182F8DD DD59586336662C831FD0228595D89E5818A85E6D2C461A252BC1A2DC5895D28F C2CF0BCE8DE71A094B7BFB56A0640AF9274CDF166B0AA5F9E32C5F595ED7CECE 10F6DE434D4CE74211A93C88625E508546DD3715A18800E4829D27A0F1067F0A 31BF17B596F13E728FBCC9FC0EA5D01AA51B5CD8B76258FC9A283D7E7B8CF14C 80D2EAE16E5F6BFE3F773B6609BA7473B9431C7DF9560AD9FC6E4D64DCE17C7E 9AA26089E18C5AD0FCB8F1838E58124B0028B2C2E4D5CDE965D02195C16E968C 51714CCF9206576B6D07128DE08529C4D94A1E2986E9060CCBF3AD61C605035B F78A0F954F3E1E5227526C47631375202CE7B71F014053C68652EC5DD89001E2 780310E4BDBE74B38CDABB12B604CA278AF003A951F7361A607A3AF0E1CD8C8D 065668CB80022EB608FFD13A49FFF3DDE556B4F8BB7D8B379120AAB86D71AD8E 64CFFB848D698536EF379DF427309125FDCAF1F521A767B8722DDC88A64F50AF EA8043686A2BF63A8B447B6B588ED2985C773661881ABC98E09DE56F7F1FA305 78055AB3C1C99FB40A4FAA548BD9CA0B95C29D74E6A32F3058EBD42AC47B427B 98D24AEEBDC0F957EB5887100659B402AB542EB5EC0A4CD278ACAC36BD87798C C41B89E8888E23552B06434635D39D6E4011F9E155D648029FBB2D9F8837774D BB8A7D722A8EBAF520E0CCB55EF124E5E189BD7332E0EA5A90B10AB63FE405A1 6A40F4B356482ABADD9EFE8E7D2876F5BEE9405EAA684BEFCD179271C29AF089 097C485E4D7911EDA8997D29A67B9C225D592EE5B3B79C3F8931FD7B1A6E3960 328E1E2718E7F999714A6439F2DD59B5FA553106F3CA3F82D7247F61020C7440 F88FE379239A75D25FE3B3F20EAADEE28864FE249EE86664C792D92FB6E0EB6A 9D3F154EE8B06501A347761BEAE8929E122790A718E2389AF824728904A8D449 8DC150E294B5C9F4607019120F7255944A9A8D269ADB25FA6CF19FC52B50FE7C B86962C94561EC3386D0D54E476AE255B82A242DF5676D26242C59391D0796E8 63039DC728F0787DAD489F3DD3F7DE89561892A5E8A38A3B28B7E942CD331E9C DA010D80EE13169C73F055F2941462B954C1602E2BA63DAD5578DA5ED29F68C5 50A869EBA6FCE2683FBF6A22EC68D25B306A27B79AAF8E889E82E2986A8088DA 7934ACB4168DF49CB75BDA561940C8DD8A7800E4D0A7C1DA6A23C48AA319FFC9 3AD59846534F647DA0263EAB436564B6A501473795D2E5B5BD1E071292F958F0 909A4247E8714F06A959A5FD8407A4B5D701CAAA3D7AA7931E091EADA1821DB9 A795A21744000A01933981BC2C3382CC6C2878BE0F3C91DAD353C9182ECD3DE0 C8A7B8921F87CEF6A6124BEA3D7F77A4AE68731C0AA996A9BFD86D7E78BC99F7 E6B1BA1CB38EB0F4F36CE7537C3476E85123D3DCFE3B925BD5564705E204B101 FD0DBF5377E44978B52DBA6BCA2780DC42620ADB6EFCB026C148EFDE93DAE351 9388DCF162AD385FD4F9F3A671FB07570878A52DE86C00255E93B45D928449A0 36A0E59C8881CC43A72ABF81819AE18FBBACECB668E0F062591EE485CEEEE60D F4F218CB633F7A0260B4884CF2EECF06E5705A197D2990DA5D9A7456129FB40F C0C6B3B6B2FC22D4264BB48337A98C375DFCBF80080DF4AA0753293E91C96FA5 12A0B8136C7C4C80FB032C68EA75660EBD1FFB27491B7A6D984054D35FECA9D1 5FCCE108B2F3C4C23202CBF5B85BEE7F0F420FCD74CC5D558A016874EEE3B5D7 8E046B303D46468BEAB588ED948712DE467C5ED1F42DF22C9B402C596D24B72D 2F609E7CACDD293B5BF0C9553D22C47EA88339AFD06EB3AE466EC2333C1C85A1 00CA808A4264FFC89A485AAD982CE70C5EB9070BE28B380BC239FEE14C455994 726DD99D74920AFA174CE979BF410E72A22D151FD7BAC732B7BDD1A4142BDB99 70B521BAFCA51DED5829A9A36F7FAE6E41BFA981FF2F209C9F3DDD617890BA28 E2CDAB7E51D49C22F338ECAE92B418855FC59577F8F199F5E372AF73701CD030 273B84196E718BA54284A26D724ABF7E698A94A47CE3917467540AEC57B31E4D 3B8691B200EAEE8444AD5BA8C24A602B7EFAFDE2EF05BE950222229FE68CF9D2 7B5F40456B0C5A884385AE655B9AA57095B4A0B0199E7C787CCE1E0C1CAB4E18 506587C792DC259D0EA306972DB6170F008FC9582D4930BEC21D5DEED3670071 85EB62A3BA27A30C9245F0380F3FD20A085DD77661C3408378172F830AE09837 8380D1C07DA549314DFA349E9566259888581E212CCABA00BBAFF7FEABD4F848 6672980B30A1968293CC7E8A6D7DE4A5CFC7BA3708A76122A3D2552F69B6E79C 0D6C120A098404EC2B2B67E80DE56BE7BAC2A05FA3EE6B68596E98E3A997303A D0A072D846360D0321F3F856A8C7007F489B82BE253435DE87C8163ECD0489E7 585ECEC657A0E040A9C1FF28C94BE2B2471AE2C5966778FAA120DB1DE340E3BB 9164EB236F63D8663566C306F263A79D03FA3C26F0A3A6DA8D0AA119EF05A515 CECB66F7D06EE72C00E2AE1363D5DA802AE6FDD5DC07F994B332332FC17A7AB7 258A0328BEC8F828CD3833F6066DADB4B62C42FE93F07E35D1C8483D12D52954 42795EB0130CF2A6A2600FEDED32D288DFFEB25FBA5EB70E4B78601A0A653162 5F6A3D4DB999E0AE48E8CAB9E332048EDE4ED293CC62B7867F3159C28D6D73B1 3A951C22096D1A77A68E37C2F6CDF58FBA5CE7D6B4E5E3FA78AC2B0845F7CE15 A27B284DEEAB751B1088C9E190F4B90D3D9E068AFE56EB07ED0C8E332A49E8B4 65570124F18665724A3E52A204BDB06D68B452A4D63F4B0CA4DFA3CED2FEEA1A D86ABA5D4B3EC7943FA2DDB74F93D3D4A1CF559D2EB3CBA0B986E939137EE099 42CB3160219BB791799DDB079A10836EC5AC37E12137FC33266A7A6273987E57 C97EC1F6207AE4517CA2D4E08CA90A5DD27015C65D22DADC6D06DEBC6BA5989E F64BB70FC214E1536882F72ECCF238CB5BE51A261CE55661ABA44D00DBDAE487 ABFE21C5178A131B5CB3 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMR10 %!PS-AdobeFont-1.1: CMR10 1.00B %%CreationDate: 1992 Feb 19 19:54:52 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.00B) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMR10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle 0 def /isFixedPitch false def end readonly def /FontName /CMR10 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 11 /ff put dup 12 /fi put dup 13 /fl put dup 14 /ffi put dup 33 /exclam put dup 34 /quotedblright put dup 35 /numbersign put dup 36 /dollar put dup 37 /percent put dup 38 /ampersand put dup 39 /quoteright put dup 40 /parenleft put dup 41 /parenright put dup 42 /asterisk put dup 43 /plus put dup 44 /comma put dup 45 /hyphen put dup 46 /period put dup 47 /slash put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 56 /eight put dup 57 /nine put dup 58 /colon put dup 59 /semicolon put dup 60 /exclamdown put dup 61 /equal put dup 62 /questiondown put dup 63 /question put dup 64 /at put dup 65 /A put dup 66 /B put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 71 /G put dup 72 /H put dup 73 /I put dup 74 /J put dup 75 /K put dup 76 /L put dup 77 /M put dup 78 /N put dup 79 /O put dup 80 /P put dup 81 /Q put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 86 /V put dup 87 /W put dup 88 /X put dup 89 /Y put dup 90 /Z put dup 91 /bracketleft put dup 92 /quotedblleft put dup 93 /bracketright put dup 96 /quoteleft put dup 97 /a put dup 98 /b put dup 99 /c put dup 100 /d put dup 101 /e put dup 102 /f put dup 103 /g put dup 104 /h put dup 105 /i put dup 106 /j put dup 107 /k put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 113 /q put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 118 /v put dup 119 /w put dup 120 /x put dup 121 /y put dup 122 /z put dup 123 /endash put readonly def /FontBBox{-251 -250 1009 969}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891 016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171 9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758 469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8 2BDBF16FBC7512FAA308A093FE5CF7158F1163BC1F3352E22A1452E73FECA8A4 87100FB1FFC4C8AF409B2067537220E605DA0852CA49839E1386AF9D7A1A455F D1F017CE45884D76EF2CB9BC5821FD25365DDEA6E45F332B5F68A44AD8A530F0 92A36FAC8D27F9087AFEEA2096F839A2BC4B937F24E080EF7C0F9374A18D565C 295A05210DB96A23175AC59A9BD0147A310EF49C551A417E0A22703F94FF7B75 409A5D417DA6730A69E310FA6A4229FC7E4F620B0FC4C63C50E99E179EB51E4C 4BC45217722F1E8E40F1E1428E792EAFE05C5A50D38C52114DFCD24D54027CBF 2512DD116F0463DE4052A7AD53B641A27E81E481947884CE35661B49153FA19E 0A2A860C7B61558671303DE6AE06A80E4E450E17067676E6BBB42A9A24ACBC3E B0CA7B7A3BFEA84FED39CCFB6D545BB2BCC49E5E16976407AB9D94556CD4F008 24EF579B6800B6DC3AAF840B3FC6822872368E3B4274DD06CA36AF8F6346C11B 43C772CC242F3B212C4BD7018D71A1A74C9A94ED0093A5FB6557F4E0751047AF D72098ECA301B8AE68110F983796E581F106144951DF5B750432A230FDA3B575 5A38B5E7972AABC12306A01A99FCF8189D71B8DBF49550BAEA9CF1B97CBFC7CC 96498ECC938B1A1710B670657DE923A659DB8757147B140A48067328E7E3F9C3 7D1888B284904301450CE0BC15EEEA00E48CCD6388F3FC3BEFD8D9C400015B65 0F2F536D035626B1FF0A69D732C7A1836D635C30C06BED4327737029E5BA5830 B9E88A4024C3326AD2F34F47B54739B48825AD6699F7D117EA4C4AEC4440BF6D AA0099DEFD326235965C63647921828BF269ECC87A2B1C8CAD6C78B6E561B007 97BE2BC7CA32B4534075F6491BE959D1F635463E71679E527F4F456F774B2AF8 FEF3D8C63B2F8B99FE0F73BA44B3CF15A613471EA3C7A1CD783D3EB41F4ACEE5 20759B6A4C4466E2D80EF7C7866BAD06E5DF0434D2C607FC82C9EBD4D8902EE4 0A7617C3AEACCB7CCE00319D0677AA6DB7E0250B51908F966977BD8C8D07FDBD F4D058444E7D7D91788DEA997CBE0545902E67194B7BA3CD0BF454FCA60B9A20 3E6BB526D2D5B5321EE18DD2A0B15E53BCB8E3E01067B30ED2DD2CB9B06D3122 A737435305D42DE9C6B614926BFD44DF10D14402EBEDFF0B144B1C9BD22D7379 5262FEEAFE31C8A721C2D46AA00C10681BA9970D09F1EA4FA77428025D4059BA 2988AC2E3D7246BAAAFB89745F0E38580546045527C8779A254DB08DCC6FB9B9 0E172209FBE3857AF495A7F2B34BC895A39A30F903DC6E3202D29AC110D868F4 7184CB78407B8B9D42F6375F67FD4B828592E4A977B9E71854D143CD1A9EDCD1 767CC2929E071FBA4C3D17500E28A23F697B5D5CC68D5F56EAD14BD504E07182 3FDC12F5404E74EC1C02AF00C1A6A17F958770ED4A024F5B3644DEFB61F2578E 56013D0B4E7CA3AD255E23DD63369A921D427EEE0E098E8148B16E8A5613A8F8 A5F1099E15AD16EC554B644DF306F0CF3571055A81F1B464529DB49E919F88E7 581066BEC4765E31BBE28C245BBF0B74610DBA30C63A71A4F3B60593A6B41C6C 636C980828CFE9A3362FBC02F1967F0F770A4790F90DEF9D56E0A76B0703FC58 2841E6E8D984FB476D4FEB960FFB6B386EC6CBB9EB83704B0AF63F38C77090A8 DAA165E6C6BC86601B14F8E9F504A9D578AF05128D8C1BCEA9D21057958D5DCF 653026524A2D101334AA3DF02A3CFA410836E6001561C00FB34AB04FF97302F0 7CCD024F8C61577E82FF229A45F7FE22ACEDD95AE8052044A41EDF46B8F84346 7275F5423171DF88188EE93BCFE0A84AE5C999E9C774A32B7A2826CEA8A8560B 2F61A42F967BCBE2081DCA5547D9EC53467ACF8A6AADFC54CEDB7305DD661ECC 3FE33D8C93D2425ED57BA83F360A384F6B94023EF8938DC136ED1F66CDB618EA F40377CDEE0F17653E011F5CDE11C81A3FA5F7168681C02167B275AC0F73EF89 521A152823FCFC811C71E5D05D99094EB69E5724B34217D101BAA302B5BFDDF1 4DE66F7887BFD458C2A97A835C72E7A6EC2500577B0B057BA1B4773094EA1954 589FE5B1D1B4520FFBEFB6ECD015B606A244E605E78D39EDC316D97D99862CCE 898341583D28F141A02877B76050B07694737E9F107F153E5A5C7393CD479A09 114F07D12DE0185B971BD526301914EBAE20A38DC804C2319EFF3C8C4186630D C91141528F408EEB02C718A0A3E0D39D1C9853F71113AC07DD209828B4873031 3E7A4E45D95025D9C558CC0C313BA3333EFCEB2D95B7BDA88C062E5243DFBD99 744C678DF4AE3478C68B4F7BF5C52DFD8A81DA0BD2C95229BA43D15986717CB8 A925638049C2A15A6913B9819B3642F68A07C4FDB2552C97D29211FAE2F16E40 076342D4C5A72E0D5185CE8EFB7A8D87D7F345E776512E8B41609794052B9A08 87EE0DECF203189379B9DEFB8DEC9585DEF2B44C7F64B4DEE827C74B975BD1F0 82D7E511A5A0FEBD52702F7E68157B509F303378B191BAFFB4229495AE65C558 D72D9AC8286E61633B29CF90917E4A01030D6B82CBF263751BCA8AB219284B04 80A8F4B34D0592EEAB82D64F9A5EB6A08A6CC5A7F3D3EE2B61710DB386AEA658 7A059E9633123EFEC39FADEA37C4205112063F7BD3D2F8319A30DA796E55BA23 00DE2B3C15511F87044ABDD9DDA9247B5E785A01A05B39F1A395E36AEA4D3D4E ACACCB99E99DDB1AD1329069714FF050311B274E495FFE43D33DB3BE958098AC 61150EBC4F9DB7BFC8F6C81047DF0BABBBE67970D14524C82334B693724A0818 0007E4E848CE4AC8F07E72F02D74CC5C06DE0A67A63156F9567DEB913E874E56 B993FF1EF6774A9C582D8DABECD1EE1D1731457305A989E9BCCE8CCA4872B3C7 7635D840A0FC8FD9A40CB7B2FAAAFAE3274A2BD0CF7F681E877830103D2DD3DB 761F3D925AED45E0427BCCF205201BF0DFC16C0109A4389F37F25AC6E4E70C85 1BF6A47B91F62079EAD1D983BDD249D0EF82B21F89FE58CCF2612BA50EA48901 6757149BA3C3FE22E61F80F62CCB355082A71F1C85E8819E71E8997CAD75ABB6 070F0CEE40E3A9CDBCDE24D59F2DDEA887568EBE585EA8D40BB4D0677097E73C 1C76DE3BD95B2BD843B1522540C5CDBBE4E1E6FA4A77F93E724F4942757B50C4 40E316CA4DAD1D9D36823BDAA73E3BEC72B03F6DB2E99C89D2C3F840C15CBBAA 0EC7330D23A3EC2780813F0C1F56C891FC040B958C7861DCA654743DB8FFCE0C EF4EDF238CD820A3EC97CA497B2C2504E43B9F29707D7F92114E8053CE90C494 4C3E681028257FAE5E2C60C3E1A33E40A7C5920A8E6FBCD4686135296590D866 1359BCA5B650EF33AB7582BC61158A573F93C4ACD4BE3D0E36EF1A7683B85438 1FFA47955F8C1EBB80BEBC9427F239EFB50BA42D8C72AC0F77A511AF3832F819 FC3576C4A28B6154B8B14B9B88A84B2E9DD9AECEC59A9CD717151FAA26CACA64 FF6B2A5F561F77E9DBD2285695F0B1DD8D1D174EC5ED48DA7324EE88698105B1 E28FB0EDB30067AAAB1AE5EF6527DD1A83DA04B50E5E2B7F2A63F0E8F924B2B3 734ED216DFF4E41E2C074741FEBDBB01A103B5A68961A12C571A0A35CEDB11E7 DB6C9046AA97B45F756EF5B32CD3E1446C9616BB8A7F57308679AD7E5368648C 37F5CB0CB4C95D49C8DF2D30A8C17D8870BE3C4D9A077BAC5EDF794050C793D8 D26A5DBAB2025FBE4841308D5FFCD592C37514D1EA9F7286EE8789D41BD9E38A 905038AD5FA8405AA7568F9B34F43DD17FD575EAB5067147CAD8E9C0A454B292 74635B10585CE8D8F891A07360DEED0DAFE9836B006C3ED2B6E10674CC17CD8C 9A862C5C51EFEFB1AA02F313DB95969B90714C62F32BBE3062E2D805989EDA55 0684402A5FFD3B330B194B1EE4490D05044859619A7A6A7AFEB4909B63CBE907 34CA9F2B19D27DC59F737344E1298EF87FD4210D08FF55E143319DDDF5E94582 1FD4C58EFB00CB9C840ACF598F300B9F6BBC4C83A89E7CBDE9F37C0EBC924777 9337FD42AE2B208FC6CA3E0D9FF9AA07BF7BB68ED07EE307267BE7547020AF1B B3D65F802A95A69A2CC366B51AD5771EC679B23253F21CDF12E8584ABEA58D92 38F3B4710D434F5F967A9868BCAB5C4B57F5E1650356F9509050F03FAD247F06 607D717C4C183CE793BA995DCC37C836BC994465C1785517466DED4A2CCA2AB3 32F2D92C7DA918D720341298C650B4ECC780A457CF6CFB2120313BEE25A34AD9 3B2C2B587AA791104E38D27C117C3B4255791862E6750FEC3C32A5B965D72FB6 E333DBAA452661F88B7CFBF442A9CF467D01B1AEFE817317BE81CE3479E17E71 6C24D0A6C08978B3DB9EA09567FFD14118259E858E88648222DFEB2A655E0A0A 98F08F3D13539005E85DDFD0B1CA60E48C0DC80FE0AF9550344B07548E9B3039 E9ACAE903B7A3AB6FE24324319DD792FC5140A2A368D233140DA5690D5A8DE57 A42AB04F6E9D167CC3D0348FA7CB3EB537AEF89B99C7C93F398C9360A0B1E2CB CC7E403B1E439CE040F958BAA50E36980FB3EA7F789FDA23F4292E566BCBB731 38BCA4A234E2A205D815FE2A450DB6586D56E8C1AC62A50DCA49CB76E122D050 E1A3413CE5BA8BF96F34990DCA2668FCA06BA66D9031AD98650EFF39D881929A 28D99CFCA94FDB163F970F29F3A2617F83F4894EB997EA7AFB67A6293A08E00F 37D5A50FC0C360BC4B7F9C876A6351F9D4B3279C1083D6DC79F5A63EA48CD5F7 02FB3C581F446AA9F19603AC165BAEE2EAA7B2574268947479540B5801FFB122 AEA27CE208AE86BFE14B8D139C16ADFD5D7ECED40EB0E258B38E509A8A1E07F6 EFEED540300ED1EF27AEA5A9B1B0FCF027F626B7258F4485B8A17399188CEDB4 8CCD037D55F8EE4BA5D2E876DF7083409DCD95F644F43778567B61F3A41894B5 485A87B1381E9E98C713E2BDE4594977B85C7A4F58D542C634F9F76B9403E23A 87D1091723B30E53CBB97A1406EBB78A7E06DA949505FA40F0D5CD0675EC4B6B 207B7210210E7145ED707377A9A1534FF7ABD8395083EC23928A03E3016F636D 1697B161377879568A752DDBE939BECABDE106790248103F1C6D75D474584F85 33DD684D3E4927EAE6DA1C2020EB78B226A43708351B8844E4A491E82D018AA5 AB46821A444373FF2CF81F996193D0C6AC98E2302BD0D7909BE77D97F1A6CC58 959CDBFE69014EA8F95224F2D2EC70DFCF8A38EDFA77581CABF0921B863A6544 24740A40AC91E315E97FAAB8D490AD44AE6805A9C7471AE945A40886A2DA1F03 7B94629ACBFD5C307ECACB6DE6FDD477F439CDBAC935A94679F037F1FD6DEDA4 F4EABA6C9837CD7679DCF343E823FE70D065D0379ED0EA0C51DF0700B7F97775 4EEDBD920782FF119223FAA23689358F35C8A68566DA0D9097C6D0FBF163EE2F 656EEE4291F0DF40C5F4910DBBF3A9A33A0B349A2FF1D01811857F9335FF04B6 EDDCEDA0172528348FED69047FFA80E2EEDB6A612082134CED2E167A061EB226 CAB50190F731B40DAB9650D4BC581BFEE93A2CEB9E9BBF5860760405127A1E3E 7FBEC40343D0D2E8EB80083B354C095C483A8405B7BC144FCC23E8F25E745A4E 8C527635AC995A1065A7FCFD805C6CA7CF611C06845EEE14D07B81E3B404E727 20CCC5BD3657D1575949FF993A71F5F8C5236135963F13D8C09B1F3B08CAB6B3 58460385AE220AE727B0CB9C05020EB678240921E0735D7A28E6C17CE22AE05E 6C9DE888DC5D3E24C60BB94289910B3723F60A74A8B48ADD5E03B6886044DE90 69236204BB7411A3D9119333D328F3A7BC446AE7C2C4C529D5E3D501EB99C900 D040D670DA581CF03FE6243093192F5E91A13B79BEF60D605A2EF3BB93B569A6 9C533A1AAE2CC70151A0BB5992A5B8269472E626D299F66D3DC25952AD9CC205 25572F56F774E156EB78B0406C4DE584660E1AC7E629DADC0BC41E725BACEE76 FE217A7B0190A4CB69E9F32F4F7A184BF53EED2B1659DAC33A2EE695A88D9F07 D076E3ABCEA448A576DB7B0C5549A5A2D63710141F4E539DECF167EFAD871552 7BC24AE52DF04152173D6E4CA827DEEDEFB7E9C3E72B5934C5DF97BC1EB23749 F776539AD43E9200A04341EC0594EAB62A0C7050DCA43945E58C4890350F3ECE 5BA67C3D716D5360A5C1FCB6EAE1EC00D59B46402B16B14B821EEAB4758701D4 4CECA59735D67B099AD9CC4BFF50B846CFE14E35E4D3D1F5A3ED2641ED940775 0067986ABE6AA117DA321122636AF7FA88AF53A473BDC12A4844F46F43D94ED9 CBB72CF2CCB37469C2E63661BCA5A298D5E9C6BD3D41853FB4867DF938DF0391 2F7ADC04FD1B0D6B0D5478581D4A2E51BDA015A4FAA53378696FB50A3297DD3D 20C365B963BBEAC22789E0073AA921F0640F63DE0833764999F02B66E800991A 438223368F1AD8FADC75E2C5130F76148FBB0ABCE3B1270C6F1CAB55259B5290 A10A1CD5419F9254ACE5834A4B8A71B8068EC21E6C4AFE9E790C74EDF7411289 3AEF976BB7A42A7CC1AABE4634CC1700272E6B272BC6CA5F1549F3172537FED6 C4047BBA4FE5776BEB53E8AA82BB17AB4796C1F91264A7B7E95EC14C0F74710F 9E9CFD51DB71C3CFA152D6BAD9E60B38D688C7CC5B587F37BC2301C2938DE2E7 88E1607E5B0CE6AFD63989315A9AE3BACA1E0C0E0F6CBAFF02685282033A7532 3E5B0AFB7AF6F4E3FB5801D175D02551F9746503A2E50AE9AA8AB56DE79BDE79 74B4550F3890818AE801957A3B6A822614EB8D12FCA584EA8C41B814D30856A5 97C3ABB9F665D1B72B8D19C4D2BEA46AE1332F8BD2A6FD2C2A1183E48F62C4DF 4175B4CD65A9B145D400D1CAD7E00D0D154182126764BFD3A267F85BC623A575 92FFC5A063A9205A02C89CA4B40C4D489F17D383FAF081A3C0B2C94E21BAED8B 1D06A4495F917C37F8B04070E9A90F60AFE3A8F0073086F00C5A707A96D4E1D2 BE5A637EC1C614997446262573426452FA5872FF661B519E24A34E3C58D4A07E BBB6C294D4DED3EE01A853EF8E153D905B0598241F97301CA600C09B7D116901 77EA1F6C40CBF7CAD5991EAF92890305BC710270FBD575B626A59EBEBE2A9A21 D02700440C57557225CEAD5FC1EBA1763746A061A7F4DFF5558F6CF9160F7CD8 7C84BE7407ED508BEB2338DE3C5207A7804FF21C4E0FEED254C0DE812FC8DFF3 4B5B890B24BE5AC7C00DC1C193C88A6B33A442E184B4F5EFF79F4CACB8A56DC4 05098C620D63A0135F8FE2959A396398A421FC16F8AFF99F702C1B10F92ECFC2 2D86DB2489887879926E2AD34DB4F7A9CC460E12812C24FAB08ED0F2C3DF3FCF AB41034C07225F20ADA5B5AD6AF5349319D3F937DD64B2E0A0887B880BE636CD F814C498584F19BBB3FC146035E4EB4A3B7EB436E7713D968B24840EE00C019E D08263764CF0839260BE71F875E5408AF4A8AB1603F7F694C2DB705F6E13E1C9 4CCB224D0E2B610FDC729EE8E33366D0AFB0A014C3AAC6B915C2268C27A65624 261E38226363108AB1C12BA960649782D0A02F87404350EB7F58C6C54463C1B1 334F936DDA18C96B577D4409F18E63A79F708A816096A6FA1071B1FBBA3DD470 C00F032534140440012988D81DBFFEDD0F6B02827CF76A92F638A685BB1686E5 D0624C445A765E6527B4D2FA2B8BBF035D9B0BEAA0CA35D937FA9B4A79224387 CD974CC0A052A5C78C4CA12379413303DBFD11DC6B78507875E6643D36679EC8 3CBB213B5116E5A262300890D85018D550C69365D717BD3AD5579C906F8BA35F 1C07EE6B17F394FDEEDFF5340A86E28FDA9ABD8803D832117A74BA868326A1D3 4004DE8942437EC0123075F2C6B97B306AA3C806FBCE7CAFC83C2CBC77E25C3A 082DFAD7D69D36ACE654CD17916062449BDA3C3AF3806416B16C718128326DDB 062CC9FFDE6FEC2D0451C4994F5C681A18D7E5310917B2994756AC8FD055F7D6 92FBD23FF685754DC09F36AD98201040626C381FBC63217DDDF511ADE6D13101 0043EFEBFB8C49652EF4FED438B5322D83C6B998BB46BD5B5F31BA2DADD76B78 ECB3D44A2AD40518C22914CF53AC408E8015F2E828F6F4908FE0C85DFE30B8AF 7A1E91B6AC7E25BE17F971DEE8271DF880E440EC95E45A6C909AB0DD6259AFAE 35B3AF9B04936FCE351DA6D244D34EF22D0B8156A583845423E93A3E5C827287 EEB8E89E19E4FA0D6406506B73285484A75082DF8E0219FB5543B57AAF63C47A 0C5616682F22DEE96A8CBC70BEB556DF3E719CE0E70FEAB87448B0FBF45EA6E0 2006416E39CAAC51A4568736D8F0270144CEAA8CFF832AD16907E09E49444BC2 80306B769125A50595838E76514A7FB0F1392AFE209D8817FDBCA2DBC8CBF8C8 5948F7E471B6B94D7FAFC382B02824888D3C5860D1AF18F729678899932A1AB6 A6A7A3FAC08BFFEC6FFA3CD9543D36AECD2AED91B0D8674EBD6A9728FE8BAB6B 4D3E8E175D0941775B3F96144DEA873B48F3F6B7B6A30D2FAB960AB555AA441E 69DA76ACF6894AEFF47BE6BCC094E42D735EC1B9D65474C31F0468FDD3CEAAF4 333F60053CFEEAABF43569FD1C216FFD77EDD13C344A0024CBDBFAB9CEDEC95C 115192A65A818C166A5C4441FBC0A1379D0F3FE58922EE49BB91857A03BCA8F4 0067F324EFA67755AC0943EA80D0EED33A817BCE9D5676F9963844F6A2DDA48E C9B3D9B1E9F8CA3FF805CEE70807B028510D0AC5B13259280021D06260FAB24A 0143CFCEE0C3FDDD6D817C717DF925DF5022C37A19FF63F77D464F699F585E93 CF29D5AC1F2CD04E992E5E714C1EEA2FD56400E45A42813E4BBF87BF0849834C F54A730E4B399FF3BB4E14D9CBAAACD79CF06AF35C128CEFCA1C43C8A5ADC1BC 3AB187E52F70A2562F7A705C58396C3B9198C78AFB0BCAD890956F7D463C70FC 0DD0AD6AF96D778AEE93A3A79A514A16C0324421D5DD3F7BD1002252E0F24DDA 3EDB1856E47B979C235BCFE8D6B2FF68864FBAF0CCBC3BCA811760643E0B2E73 551BA0BCDC4037F497911B8A5CCEA5AC79B2C8229F317B690108ED2C52E7429C 01DFA8C97FD5FF794EA69BCE240C02A9640CB5194CA6AE598C605AA92086AC82 C983661FE88DB62A3B732F78F43B93E9C22A09B29FCD79E41053D4E27CE6F3EA FF365338B03B87AA0D48063D02B8E4C88075FB2354A05EC177E3FC76FE4E4DB7 7337F0AA30608A6775C928A39A515C20A285D0C4541A2A6F06E6844A6CA428B1 68D522A3EA084A2EFD17E3FE423F2F55C9F19E842D2E30CB79026C2D2DA9CAEB 8C4DE6394771D9C2D071F1B17047FC66A2ADA0FDEFECD6FAD63EA5F2196CCBEA A4DB2C62A0948DD2A8A0D30E7F6808FCB912704E647E1FCB8E54D27039F67009 4E995339D198156D3F6522EC70AEB3F22ABD6699C36386B98E0992A57FD9BED5 D9EBCD492CE373E46A35A906C17AD2C4C490A9F74039075C8AFD8EB52C9631F4 0CAFAAF50E8C6B4C565D859F6DEB844846D560318367C21967D6100DBE5D3A1B DD12DF6B8A3633BBD59EE865445D2F1E8814D8D64C3BC913183B59DF20361B66 6F3DC614B9AC2C2CA4C30E1A01C1C2A2054FB4BE7D58C6BFFEFAA4E13087C434 ADC6D8F1185F68B2003E7EA12A991128037E54D2A88EEA2E794D89BF531E107C 54278EE82F49454FC13638CD0B83C142BA3E0F5462CF92FDF0FA223EBF69D12F 3D99BA804FC467F40945B1B0AC23DF88BE1BDE21E296A82870F6322630C06823 27629EA02637E6E3E10F16747B3EB3E479AB8A347FD46D581608D453684278A4 AA58BC490F673269CBE7356CA4F9E523CDC3F5D98EA1B95CB686BCD17366B609 72BB6B2167EAA0D66E36EF6A1170EA56A8485A659E55C8D50108F6455F1C4227 6CB5DED36763E54089C6C04BE71D5B762254EA4374C136F98900F25B239652FA 71A14A43F046EC8171C490A5755F90DE4ED09F8AE5EA1A6A98EC026B612BCC35 6879F1942C6B45DF7A50F4E49B8C8013164CA04DAC46F1D799071BA6402EDCD8 F55BC6B064A2264A37D4BFE59754703B2C13BC4C2586A61EE4A9F9915F00FC13 05072451125EB001CE97BE3933239DF6501A664B45FFB5E63467CDA463A5AA14 504AFA4C8D4A976B459D8B41046615E06DD43760FFB72488397A34C4648C8B4F C56454126529C50AB1D3B328136D31F79EFA1EA011C8C6FD6AC27FF2D4218B34 3F99304558FE4B1C81BBF4807AA89ACF653EB74E9A2C85D8DEAE86F1A7B3B5F4 077D09031A32E48C069539410F68EEE2A7ACE7B200CA099BE59009268219DB52 27A2D68DE15C91ADBB30775AD1701708749754BC4F0BADF52540EFEBCEEA9FC0 E00ED70078142201E897E93EEB6B8C033B2B21617162BB54060D3A14BA41D481 9B2BCBFA81A176BF324C8425310DE6C313113A9DA8A950C6439996C957ECD22A BEC6631437954D043A5F0F83508A7EB24EBE9058841DC13E42E5A817928965A1 0566C3B7A4593733E519AB17F3995C6702E3378822FA575A537E720BF26BD14E D08755D999FA4AF6D0BBC2A54CBC279C8E75514733DF7F2C19B84F043A4C9A03 979FEF3A622C92ADC58FE94C3C6C6ED45472D1E48290173613F991036368E036 1F8A871A66BE125074CAC7887A69AD92D96F157BE10A6604CE0647E5D2F6E4B0 8E3CB6AD0E830C18B4C239094238357D1D371F643F50E81CAF234EC88E0CD6C7 BF0B0626895B812E489153B01F94C0D86769A239879CEDBCF2402894B6E79566 1AA9B48033407926F18C7399C641C3B0C898AC99AE6595E865726374CCE03954 92D48AD6A336888DC372676F0E1BB9821F638924976163976175D2A687324741 912DF146F8C7F6EA428814DF6F235728386BD3558CD588BB1699B43C1DD6B4E5 CC4E75E69FE0158E8666CD4E86BE2E79148680287615041E559DF70923831A27 63D40F0F873B3DCFCE27E0BA3F396EF61417E77DE37C0D11902FD961CF5174EE 8EB1DBC17A1B0FED2BB385C9475096D7EF37BE12B0D75F6C1883229F3A62A679 828645A2E71DC2818B037613531463FFB0F84EBC614F6A9C3BDD29807805E580 0200984E41C66B9C99A62EED7E91DF58C72EEA135B03B08292FF4532728086CB 5ADD2170758529CCFD0E652138B55D545DBFB5C1DD4FFEFFA87DB31F24DCECDC 203A0B9D242B8F0ABFA7484545FA7BC22CC5F30C28629086ABD681555FD8C060 00F4B5444B0C79EA2F1EBA2CBF0C45689B6D4B09A1292DE9F6E92A9C52A4F601 924EBAEDC0F478330826DC36A3E3AC35DE0B82145E378108A75D4DB79B78A713 4A54643465AB3D1127B69467DF7AAB30EA92ECF0B5C475FD5922EE8310F8913B 7B1AD24A93EE946C8E6DAF09C3697934E94DD0074D8DB4582D26F9807786CD8C D8CF959020822AA23D57077A73126BC5716FCFBFC6271C9F1BBEE9730198EDDC 41BF84898B24CD5A42D6D060C281B1810B323C5AC6032870041F007EFF54BD07 63F24FED3250E1F67F98E4B73678A5BEFAB99103F09E59E5E80D4BC9A2977FE4 3AE53E66D4185F52A001E6CFE374CB6A934187664F782F63E3C3359C66017383 99693E9A5AF425BE05A681BF7073A3108C77C2A31A9ABFCB24384010E36CDAB1 86219786B68AB2A6A7065167EF57C5EB79D790824A459A137E7CAE466F1EFF55 8BA7CF2E9382C1BDBBEDB381E7BFF677DF252886AF2BF19B2E2D8C44E0C35957 A0491E4723DA85E67BC6182EA0803EDF4BAFE302BFD52D84BB888A70232F7D64 3CA598EF660B77E88A6A8A4A4D63AAEBB88E400D20581F2DB42ED3B2B184DF15 6DC8E586726B5074EE71F347494C84B2365830A932A4F05F3EF70FAD933EE655 12834498F3A58AC270D74CBAEF756CB8A499D3EA9B99C37DBD8D84970B188530 82AFCAE63D692E6A72777CB1BB9523C75F9EBD4DC7F6E5D6F39862BB1D7AE93E 5BBD3E135E919421C3DE94A2EF81914B6EC5224906F83EF47292301C59C3836C 3F359945C40C61D9FC0AEA5A88A9A93DE5CB8DD195725FE145E79B7DF33B1FAA F14A457C39D12AA5881FE5607251BADC4CA3A1FD901BEB971C765D568803D1D9 832D5444A1D8332E125B7D865D5B28CD78C7043D8A86AB4DCFA769A183FB4B05 749DFD67A669B7DBF6A6283CA516B94704D74F64C3FBEEAC15CD1A2D939CCF23 3A7837791AA06E6167291EC2DB0C34846D7D158EF594C6499288ECB69EDFD50B 4AA7F1E37993781A3933174BDB9F8EA0D41BDF7896BECC4BD9E6FE17738AE1F5 FC0B9D80D6247E861AA03A36B3BC648FC8610203AB27DB18B48BD494A5798406 BD74B5D1631C2844DE39ABECFC6518C45A89E117D7C498348FAB6C512DE91210 1C07826D1D6131AFC8B138B595641D80C8753C45ABA3EA94D2B175F382508B1D B85D1133FAB93F41187C9399ECA60142A1356B1E5CFD821108C347CEA7ADBF08 0B124290E9D736E2043039D49D7D297ECF51BB2D2A9BF589761AB8C1E7249722 BB558C01661AFF993684BEEBD24DA09D0184440581B53FF4BF3C0129422E8F94 F214FD0FE66F14DE284435437600C6B9CBB80CF7CBD3CECB34757BAC210DA30A 2DE252E3DE81792D101F032EFD210853B4D37CCAF643D71C4733C81202D5212E 4E75DE6E19A3F1905A22B668DEED9A8BCABC2365A1B2C6DA539FFC709B85038F 99A65DE1C6782F0C757D402F59F11968695061FD1EB1293BD54FC33E1C2CA4BB AEA897043AA9FE619649D835D131E18DF17A9D1ED6163BBA1A9DD12B9BB42A74 F67DEBE8DAED8AEA55A7F022159138F97FF379566A42354358FD09DC88FA9EAA 5CF2ED8B4D13C1339C07D398E96D0287FFCECA5C5C32218BB43BFE08196D3D1E 23973D34833CD9BACE28436A5FFD4816542473B7CEAAE489D7FC0F5012BCE6F8 4D28102E67187E50603942FE7514770BB9157E67F1459F77B2D8FBAAE9A4C987 295D1DACC6AD96A0818C9E875FEB5354BC2A1D28E2A1F45C8628D8D5B0C58651 5083D10F070C42724CB17BD93D598ACE9762EB5060E2687FF9EFB1F58A95A5CA 1AF7B72010131F0618EF48E9BFD21C17B297812190CC427B569313B025C39843 57E25E37934EA128680771B49E7A3F1978B3A6238EA54D83CFB84EC2A296791E 3990AC7AA99A9A5EC4A560E59F27DE1680C81E5930C136A83E8E7B4ACE6AAAB5 57DFB10D605F501081A8808BBE3F6E297A90F5E09A3CDF26FC387399EF4D5C70 E7A3E9AD46B0305E86DA98263A7F44357D4E950A63D7BEEB9D2E3DF3D066A6B7 9E940CC10E8007B2CEA1C11521D2095EED15F3152F92B10E0B4E9AB74138F241 4303245DED32F590E1FA35275F2A0A26FC74F9A04F1CE9280B9A5F136644B77E 9F4A7CD818309F8FF436B07EECB4E6D4168501F32B348446AB6D693C81FBA667 80FCA9390E36759B14F7A406E66F7BFE7E91BCD495A53097E55EEAD39F8A89DC FB4CFB345F075FA37C763528DCC7D80FAD8F674B107E60FA76597DE95BAEB3C9 A3BA95633F1A44F20A2679BAC5D867A8ADE1270B3A87CF973424372BAF552056 C9C37ED61E8A791D32997F15AA52A1F259FD02267DD7F43A218224DA371093A2 2945C99A06AE36A43107BEA63FE56A9A2FC0EFDB46DF08C2752AF493035A5595 EA90BD9847126368DF8E22FE380E50A893FB21914E78BAED3AE5F9F03F7027DC D10B91264F4459B8D0136A8C4139C416C64E304128104B6EBB0F3978C69FBF5B E090B5C295B98578A79FAD2AF4233821A08C375DF4C4429C93623C43907B99D4 527E67CE7A73786E4D2F817A612AAC7B4D9E3F4A79BF382F15008DE76A9A8DF3 47C60F100B09D971EC4690B1A04173A1CB66A2269BE80708FC29D82C552151CC 385F1F179889059D5D70D252C99D0F84D12FDC13FFDFADC11A731262BC8E2AAC FD8FA176352F9D114322CAAC7278113C9B48C869D5EACE4215CD50A125EFAC99 88312CF4E12FC1DA63029140E8EB1BFE1D79A7A338BA2188B599A1C224A0FBA1 3CF40EFC11D7D3333FF371DED67318D2F6DC8B5F34A5728233AC9BB2EF214D67 B3F2D0FDAA10F2C932F7AAC4EF557E31909175A3F61B0804CA0C762C53F20A83 53A8A6FFC37E002EFC441614A8E540921635FE855CBF1338431AC8F66FB1E17E 6770C99ACCE479A366F00211F8915AEF2940F44E43FBDAB05FE2D64565BD2584 59F65129BD9695C4787C6CEF7FBA70E2E0FE4FB7051F65AA824782F9887E5F96 DF2527C15E39CD1D5BDDD48765BC0C528037F69F8C5F168810DFC2D974AA0E62 20104E3F291DB79BFE816FAAC5765BA298797EA491EF82AF07769675D60F4E4D F088426BF9CF41B0DF5D840BEA5ACFB5382015DD26ABB0851AC610B12553BBD1 788032FDFAF98C64AF5E2FD0B08FDB9582CDBCCFDA38F256930349697AF7566D F980076F5E072279EF92BE37DB65AC1D702B0E85C856482A8BA9B44CC43BF3EB BB7504F1F2696B597A0FB8085E3F6E3BF178837363F750679CF2CCF7B01027F8 747E1DA4597C8F93CE8F07D304FA72C64972CF08CD8B8F3331285EB0ECEDF8B0 64B53AD633C6D90340797802DFB81D424DB73D68BADB7811765D83C2C57E3BAB F543E327CB8B0356D4A84CA1BF0AAAD57FB9EA0E5C70090A04745C916A3EA2E9 2AEFBFC64AECCA2DDA387A3A8AE1D27C6B031A28E8FB3F871576BBBBF7217CB5 4ECD354B391D4661B278B1DAD9B3AA0F39883F31537E158075D73A5C4D37FAD0 4181846C724986DA122D84914611B7C50DC964E21B40ECBCDE2FBCCA5A30E11C 5AF792173E502843DB785CD34583FF25251C712087589EA26D73257EB7B9D484 72FCB8988317B1F886C5EB9791F4688F087DC8D2D0B82B5EC38CC026C45C406F F0BDC2C47011AAAFC765C2E520BF3C90C85E0D4AD3D59E75585FA2AD70B3C527 2383D7582779217F435224718C04EC8467BA8C9319F99F3F033B148B24CA80C8 C2A35C0B3BB874DE6AA03D3DBED072A45DBC5C8A746F83ABB578F872D535EC21 D16BE93537193CD36DFCAA9BC9FA95033EECDB3853532452385A71D1E92D12A3 9AE044E7142F0911125B2C2C881678886AA4E924B5718172A3161C790E2E6F04 9A28709CB38269D8D460A8415E68F64D6BD3C9ED9D9744DB7AE04B9F19B8DB63 EF85CEF8DA88F8442E2AC150FDD3A15BCF9740CAE7FFA1DE92E2571CF2C0E0F6 90F13F5ECB3CB88FE13D4B8963B51ABFB9040A25ACC10B08166441D7275106C7 D5F58C5A80F4F5472181D985237B431B8DED88BFBE1215B6DB506B7838A26C4E C129AADF9C36C4177C76930CF6008104E0B5E3A387A13CBBBB8109AEA38FC35B E7DF40B4734AAF9A7CB819D94DFE944E994DD21EE7E9BC4014BA7F0A1FD7C098 6F7A699E77867DA25507D723B6CF9174782B58AB59D89BAE119F145D61F83687 2C2A1653B501E71415A0978D2FF39468686E2481CE4F06B981FC398F93555A87 E93A098C9FF28BDCBAF0637CD63BEE7FA448538FACC04B11C068A16E687BAF4B 5D722363F7E1EF39B8DDCE5C947DC2A69DF4A4FCF40C397FB446A37E74502E49 571846E8951AED1102A7B67B7038EA1C7ED210A077D83222E988C0E5D2B88BF2 C71DF6C9F4400104F2E8DEA364D3A45CA1C1E6651C3972E89E5CF31881322FFE AED481E2602E19D31A735C14F3C7A8D585C46ABF0C5C64BDD64EDD35D0ACF67A 5C91C26E2D53C47EEE126FCCAC1F7E9A67A0A02DBAC2C3EDFC15F55DD73EE385 A7A32431AE18BD4F2C612FD5F5AF4380A259C0C38D22FEEE403A7B9CCC4EF62A 6CCFE803F270AA5FB5C4DF8419CCBF6AC611A721688ED51B82C1E5647F2B988E 2B84B5343C26D8495A23908A6EAB2D2376DB03F96D493A892B6548E0369988CA A2ABCECD47663BFE45F4F3F910952056A5314843DBF4A8862ECF20B9C6427E86 E90CF8132B2A03E1A0109C2C1973B5830B9AADC952F41D92EC44FA3E79C77155 AD89D10EA1E3B30126889BA190C86ADD788045D0F933226A4AC2FF91A9406F6F 976F337400FF3921D372AD11C929109E7F2D7C2A494888CD85BD790C8119681D 83B11275991898106C693C0EDF1C19B8731A84A94470D2BF52F0123E5BB89E56 39D5CCA023BF0625DA16DE7DB7611108CEA00E3CD4B8C03F31787EE00A94B542 A88B4369139836FAFCFDA51CDD5ACCD351C567663F1140357C1414E3301174F9 0FAAF917EC9C19DDA2F41C671B3175F49DA30593FA6C93A067560053822D9A9D 0A440C3DE6C4422E0EB2F7E86082F7734BA83D02C30EDA9A22354D1DCBC8D186 6A43BF3DDC5209DD661A87CEDF97BA43262C6D418DAFFD943846120FC5E1A06A 5C7D847154E41CDBE66B0538189C130DC4094D7F1709F15460AA982DC438F380 766D6937A65D1E01B70FC903E2D906FC31448FEBDB937051BD538019D849F81D 9C28FD74ADCA7996C9F319EA011A00AD195FFB5149F1B0B550ACB239D6D161A9 E45FC9F9018F471885D62869831C55EBC118920B864BE49244DAE14794EACD02 A096A5D16B4800B0A1AF3EAD075EA2476743425FE2214BDE468A20749C6FA35C 9CAC2363798D17891339B28F8BB6D0BE628DB425FAE39D65D3C034D041BBF7CF 4EF74A6AB6F656144930C034E57F02C528E054F65828BDE71083109F43FAF0FF E520EB4BF5D92932BDE44D54797E58DFAFCBF5C819474A7B9282D087F819AFA7 F13B47F2CDD0BDDA2D8ABE8D6A0886407EB8550B96844FEE859BB61C799975C7 056361974EBA586DB2D3DDC859CFA0FF493C5C8DA81B2673AE6C94CAEECE4B0B 498E9F060E9948D0CB5C47040265075BBF6B40382EC26C5822DF3632F1F24973 DE14BBECF72DD8535F05BF15276DBCD457432FDA386EA8131FE695CF61F11B37 1C917751B54637348823C481D4C2B0DD4C98671BF1EB42919C6E11554D86490B 8E2823073B9F1DB5B04EE262840352032E1B9E4B688FCFB1144E43BFE455AE25 F914AD37E6A694900C5CEA010A04631BA180B9D126989E46566101B868EF178B 6BDE396797925C90780A1840369DD3F7AFA7C6A2D46FFC8024B12C356D5FEEA7 9270B37CD936AF7AA2F041836B00D3DA2F190F4E8C97FB7E9903446F8847BE6D 32A1772991AB24ADD997BB3B97452F21A25591459AA9F15A0B5395DE1D23B038 07D3B35338E4BA1214570B83D730F9FE2F0C0695A331B8E391D1FD879FA2174D 3F83FCAE5E1441C51B7CC7AE625CE6F6EE29604FAFF1DD5C1FFA48599AA073E4 E54E56028BD64FDACB47C715566D193332542E7A45F27F87F9BD0E7CFEC8EDD0 C604549AA0831EE8CA7C68A8A4A6549B1E7C0BF2B6EEA70AFE13024C41557568 D11E69C2F8D7962F5FFB6367016D93125A92DA39E25F30D5E4B85F66D34B0528 DCD0D71BB767B7EC0A58272DBB90D0D0D0F661B783F724929CAAD9843E044752 C5D1F2F6DBA6CBC67410623EC23D7C7EF15B18484315CEA679FC1526B576F54E D1DFDD0E8ED5F2B1449A05501D0110DB989F62F815A30E84BCB0042A0FA14855 77D07A326FA8F2B85E67E20935F9DF0068B107572BA80DCFFD90F922B79A85C9 821363FF5AD881CF7C0212B2E6238B49813FEDCE319FC0FE40A42797235DFCA2 0F1B939645B97D26A23CC5D1ED56CA253AA1E5C8E88E93C74F410835E3D5C2C9 731649584619ECCBF3A50F95DD7EF36A8C1B5F63222863F0D8223CB787B88027 54835558B8E4CD6FA1BD7E4024B6C7267C1266AE9E7D7CACD4448342BEDE1EA2 717FD60DE846878BA67710AF4508F33E2D8D1827B7AD0A8C94531079BF2550BB 87B73A3848857F32B5D7AF2CC07DF0590D6090B7D820D701E669ACA06BA8F194 02672D01ECD7E2BD4E29FE18176D8317BF9523D2900B7CCACE98E9B46DEDE394 0CB3B65538418147C93E77FADEB94B66FD048E47A0F1C3BC92A51633F83E68EE D239C0F2F5EB9EC68A048EB809B5B9F2DFE41F815CD33623CC2F6AA0C06C9F53 ADF903E40B50945A7A288A016839EBA12CA78156F617ECF3BFC8AC106A0B1CD9 9E2474C0DE1B88B5B18117CC68187DF5EF78C5B1AAE36D39946EEE1D931E704A 9D0A315054F5362FDE90A0C04F159F93715B4082554A6FBBC03AC4C2BB6E3A33 8563FB20B664A350BE0CED555FF8DCF2AEF4FADEE74A09522BC31CF7E4FFA014 DCA45475437866FAD01AAC47DA6951197066B69E6E850D4076C0F8B3F04355B0 E26711458BA45DA22AB577B6D71C8697816ACCDCA0C59E1BD92FA8C730D09863 ACFA216600EEE43FC54E9BBBCB873C64D0C9FE41DDCC573AEDA8A699F780950E A63B8EA80A78E89724BC77DE5F7ED67FA860EE16D7E847FCFC198CFACF6FD4F5 7A25146DD526769E6A4080E908C16F7CEB0EBEC4778A6A888414FD67BC2593FA 6D0111E37BE74CA96748A43A7345622CEDA9D1DD5482E8119DBA73E73A35FA0D ADA16A14CDDB54D76DE1D407BB39C00AB23EA1CECAC9C4DBD64DB5AEC80AC9D7 FAB6A1A3C4CA84F630A8D3A143A3490818A7BF0C8F16F6220BBEC2B8CCD528A3 4A5F899039BB3E21B9554E3BD873E2C1DAE37F0700B43CD1939CE5D16773520E 7A915895E74BB21222996FB5623FC6F077F44AAB49FD6E8B6AE3C8A9A93DA0C3 445FCFA9EC73F98378C5B4EF3E67978B7FED5FED1EDA85BBD4D0108D3E059E63 28E11EC677315B68DD63C517853C1A65967BF1B859A9203DBC2F03C4AF6A20AA E17C7103917CDB42303D88E4A1997B34201FCC208C941249624D039D069C2977 B28AB8D215B245CC115024E3FD2ACB74184C8548DCE81F4D65D4CE268E360C03 FB719F335050EFE6B13EAB0B9580437C6067F0251660588FB519409390F94326 97C1C7A485E28C199DFB746BFD1CECE61C6F66D20946A54D9F05CC7F14BC7BE5 9F0C229CD87F1A35D1AB547EBE307B0A5CB61F8E7661DFE503FF2EB3344EF7B1 FED24165DAC30B5B6F39D1D1FA414A19E7FFEFCDF93808EDD4493AFDCA0BE31D 03EC07BBF75FFF1654E5D3AA64DAA505454A499E398C2F53DCB93BF548451764 3E4D7004D97DEA315CB51588F654CDF6FEABADA788D6DCABAC86E3DC9BB7E42B FBC1381C47277801E353B58400F9B9AA4DE2E1BF4E6433688C8569182F0F4568 6D5E7931C695A5CC181A815B3D3252AFE7F25EAFCD8B07FB7B127731A25D951F 51506723A896F8DA4027296D11DD4123FE93BCC81914409D2E6381F1F2840852 4214BDD7C2671B85AB24BF24F895E67A91DF23E21C5663797F049467329F3DB0 A74763B8C6458A5C9FF1157F9DD08C37351A6F074E1E5A05F9827AC15FFF4A68 93E1D010E02D82B63C1661BBF9113D415052C4C5070E6542E5E07223745355F7 3DD76EDECF1C5328A29473B07BDEB0D4223C5D3DAA6BF3E639C2FF860AADA0EF 05A9BBEAABD8389112937B0F282A0D6C50A7CFFB0D214523EB8618583DF0EFBB D98086ABDF5EC23F57F1101E86AFFD2CE314B4240380C6FFBE4530E6576180C2 3A3695E4D70DAC730C2057578AA0CF3E8E464500C0F2C7ADFADCB41E1DB62D83 86DAD27D800C797B01D3A701C62A3A1D0E1C18D76CEE1AC9F581CC1C697A6E50 62053E7EB21754BA9D9763654CD7FC08B53A12408A4CD4B99F4061C41FD06922 ADCD8518DFA056B825A24965B576EF1DE31E3A4E2E54AEFBAFC8BDF5E833AE8C 929405416A91A45AF0977E396ACE32C969C87FC93DEA7888A35B7C9E8ECCC350 C9388F9953925A208E63514E9BCBDB99BD47D146DE4EEF08810C81DD6DC06EBB DC1F0035A6DA0D99F32696E8B4A226435376E26C0ADC8846D28C8B875BD03663 73592B3FB5D5A0C927140F27B6CFC0FE2A8DBDC77CBEE70C0E2005EBBAFB8BD0 5B24447CEC27AD4225DB0DC1CBBBE69AE423F9622A4A8BBD9466962FB54B64AE 726060F18B3EC8D945009E8FB6C2ECA462758A78BE369F00AA4FB8534468F700 A9376FB42130ED96EF9DA17B7B9589474D1427D0D8FF5152F6306527B12D4329 3CF929105E04AF564DE552C4F06B466F16A8724945CDA9E098AB31A032CB2D05 BBC3CD225A51D818A9695D6E32DA429E702632B32FECC25722652F67165695E6 D9819D5B200EB3626FAE8FF7376DED2B1720CABD8AE2BC1A0A39B7BA427BCEFA 936F934DC88685CAAC7DE19929C9F99984CA938BE0044FB341AED41B19F97F41 2C31E2C4DB232FF90BC0D15F1991DB60E7E944D90F7FF591136E1F260D3764C8 8BA791589D455192A19ECEB8A9E80FB5506A479EE444322C4E8E8FF0DD9BCB8F 749C69C488E816625DF57EF673DB1A85BFB19D960461EA8E6718A1325D878D37 FC7BC693F15D8A85AAF4C42216490BEA3D1638BE006CA2EC9D4DDEBE3C641754 A78F6EB4B71D7517351A91A711CEE1FFC4FD57B0EF71E2959EAF82AB5494234D FAAB49B1EC4DA7A2F3657458CC1CF6229901C2AF5339E2E36F92197762A8E446 5F8F9D24A57B80850DE4264FA9F23C947C35801C2B557CFF02B15637D5B9B059 9994ACD938E826E4DAAF9581A63EE82995E793ADE573CB2B9628BD7B899A1C1F D437749137278A36B921206B70495E0DF379B7B7315FC02058EAC7F9128A3B4A 30E20BCFEEE17A99CFC9795F193E4356AEF6DB94A7CAC8880FAC9227A0BF78D8 B7BC18F6DAC8E5CBA63996CFD5E4F78461AFECE7EF62C585B5E5DD40789AEAD2 597E24874B3BA77799D67DF746E70FC9DA4CCD9BF40F9897092352B3A12682E9 4A5A92795C8B52E212FBE7323349E867ED8FE78B8B42325C6AD4BEC036BC891F 0AFDCBDA2A75DB64EDD020A39A4AF0387B68D64BFED1C5FC11C58919C6FA0C96 F617CA7860D5C10188376F31F1E323A95AB36138D4C8AEABFFF46CB6A3618ED2 88C3BEC6184BDC2522388424FCAC44EC1DCF68E6B0A19B01A223BD7193EED9C3 F5B838BE944E6C4CFEE7742EEFCCCF9F60EF632849E3306B990B2CA74B8F6AF3 465A0BF22E1E59798302338B06682323B19C4E44FEFE84C0A210031F132E015E E74264B3B0DA6E09E116572E707C45FE7010C8D291BE49657248E416B4F244F6 E557295AC3633C4B84B5638EDA1B2767D0FD770654C2667EBE9494B1DC28825E C12B1244900CF0F45EDD038BD90A98497250F897F1221A1733DBD4540D1B374F 827C8C10FA84F5A1F6A4C921426BCD3EAFB1B8C654131F15B4BA3E8D489F00EA 9BCECF58E9D15BFC1B16E4A08F0D5459D26559144278DD721DAC117E4C0F6EE3 19930DF91DEDD9664287F11ADAD823DBAB597729C554DA905BC72A6686481108 7FA7B78D41FFEDE9830955C6309749DE1ABD705BD346019D4ABC4C340C9A2A9D CA7D20D6CEB59E8B7836043C49D33C86469D27CA62851DBB00E6B8F4E28714C4 B5F277CC2CFF502F0E47352F296EE242318D73197E754E4620A9B7DBD075C93E 5225C68C47BAC50FCB58A6D33E1B55A39D131DBDD4E014C126DD320293BA9748 4712E66FBBA2BA24BC8F4B1A285AA123F7B8146F4684CD922EBD333A7B493CE4 F9C7BDE8FEC45429EC26DF8569130F0898C3D43F7CA90C210B103117911B27C1 A14E0068595867748609ED646B5E08485E7467C36A528C738C1B7CFA362CA720 C088CB808926A1D895DDFA944468AB702AA7F91D8A4BFA372E6D7640A8E24273 75C1C8466DA13AC7BC57CC6ADAEC27CDCCB29BFA5473CED983B9E2EC94132E18 6D77798D59EDAA1BA98A0618A1066374D655D55066BCF81FAB2E4511E1928ED7 C77FB148D57D8EA24EE0720AB527AA3A76285B696FD2FF3546901E849A5B3802 F21F7205C80F9A4A102DFE192C5C5A5403C6A8AE106C10746A550F7CDFC992DB E3A64BE4A2726AF22D403EAD6AC921F48D6535E9E850BEC1E5B0AC79AF04502A 1FBD5043391104C6DD0B09CAA3654A7A21A52D6164FA2E7A4FDBE9CB328C3A53 05406F4A2F45A1FD4B2CF998E94B7DAF2E3CB584A8AD83CB32844979EA560E0F 6EB5215F705141320F1BAF1504E210D3690FBC58830BACA500624F7A7ED3EEA2 789738814E197DAAF6DA815029368B28818561F044171ADDCB73B6DE459C3E9B 64196B66F8A12A1BE100124EF86CAB8B7A10822DF4951766AF568D826E0B91E5 E640EB8D3D8B188912C510D456231E46972B177019A807DA6AE89E76400E82B4 EF3EC27BCD8F879A5A7A04BB4D5E290514EF7ED3A976A5B2D5B4F9359B283DE1 1D7BFB356B3F3F02BB45FA93F0B442330A9AA29F8680260D1071BC27829EA312 0ED69BFF2730E0F550F35CF2CF16AEC7D8CFDECE336F95789FA1C76B4C6BECB4 D6400166ECB6FA2A44C587F15DD55F55A1F7FFD8F07CA99EDD2052218828B191 D52CFD56538ECE62E946AF57C39CDAED30DE6FE58491181ED84E700092A061BC 821B6A5C32A0F436DA74826E0790EBC7D55F14223DDA0234680D41A5BAC55EBD 8D657911A3C10F9537AC9D3388EBBD5856F043A544AF4E60CA7243DA6D38BB28 4646E77BF92BFA763150C7E4543E844B01097CEA61AF0CA802CD8055BEDD63C0 6D91EE700452A400496DCAB0632DBC58C5285E8722F9BEB4860842B48B1D9FAE B266B6381548CA943B5EEF047A6805D99AF761A42AA6850CC458E1C147E3ACC4 E41653EE36F6BF8C938DF808E8DF9220690A1E36BF5C7924DE8944C261955F25 A7976C3FF10C79A10D8EACBEE51C00E961588131E35B08BD2B07962EF33769D8 8A7FA9BA8EA90C38B846963030FB463511992396C25B4F83D6E6842BB7408064 B979DF1E0A1C20719C8F9430C1F46B36DAD548471A37B4328DDA480F3274900C E33879F1C6AE71A76437DA0F6712297CE10B14552768C06315EB48500514BC14 AD86EF94E5AE2390B6D9ABC097BF1A9CB666988EC3797A3464930867433F7F95 D26D8DED9791F0C49EE8AEB9017CCBA02B4B68D639B58C864EAD6067B3D1FD22 E989551D11DB9BF2A8D833391D25109F007D9E3F7ECDE5F21C64AAE0B0D4C4CC C511D9E7251286551308E976F1C69422457B9F6544A768188EC36C7964D158C5 09ED5CF20C62955EEBFB0C4A851943CB1BEDEFC216A5F11051C9074C8971A13C 59EF979D9C6C90E545E7569F16A202E0488548C6AAD14AA2D3F5C15E5807F39A 00752DDE0B2537CEF6F67A921342CD30B85CD65841BA2B92156F2ABA110F9193 1D8F5C3E7BC15D1F2A1B45FC37DA6EB07B9D77EC0C8F507F49599A3CFFA76C0F 4EE4037576BE710FD8D22424899D80D389FF23B8760FFDCB88B5BBB17345D278 42286B59AFC25036261678551AF7CB98432D66CB6C49E3ABE73B47B0568839B0 9820B34D98B0B2312CE07F438A94F7DC4C5D50066AF6FC3399BB9D58AF4E4F7B 8271B178FB44B6C9A286FF4925C920DBC35D5AF5E24B60C5637C4D1343312EE2 FA5625B6AD5ED764EA7D670761365EFDB46FB8153E23072885C3225ED394EFAE 6B319D543ABA7005821D8B857D06235F83FED9697FDB48074BE3E797D96811F0 10BC6392B1B9D4A896B3993C0A77E94B57CBBE264C12463687BCEAE30C575B1E 16DE09B2D92E58155BC5AF9339C62F48DC0C66831B7F519B236A7F1AD6E2EF6C 7216A0304F415B8C95E46AC28A0C2EED00A5E22B193338BA67F78735D8C26F7A 994D25DD5FBD72BD3B1DCA1E2B0F7151439313824FA3811C01FEDE345439CC7D 604ED31A684426939CB3F2B9DB05D509A7B0EAAB0583662991FC3ADB4C50A515 3B881A40DB960A9D6226C4B8BE7DE1CE38363BBF3537A68E269787913EF43FE0 AEFBCFA0C199AD0337F48564CCA04DBB0442A4C8BC13B0072BE782817F59C8D7 4A052705029F8986F888C498825819171C12E4CD2A33BEF7FAFC3447FB5CE42B B3BC34F3F2B61E0E43048E32522CE84FBFD8B7E36F9C83320D5C8692AED52588 A2359603E13A2F2E43B310D433B83713F94D77557C9C8EFBA9B5E5419B75BE5C 25E87490EFF8A2C54734079826AC3CC2B77B982F3D11141FEA98B417603EFE94 240F453DD6E62737EFCD0A104ED9009B009C4A62A2188A7FAAA0778F36E3CC25 D3E6D192B338E69B6C6A63ECB42EB981B08D2B65646EBF09DBCE03940135D76A E22D04BA3C8293534A9BEC2969B54A12B346AD976FACA36C07376C9A8F2A198E BF0BE85F63EE43845F761274E0D9CB7531C451516EF085BDF6A02833E38B8B87 D141D8C9F39F6F032880A6E39022707C2D318613A800E1F5A312B300115EF120 744D58CFF4C7BD46757945D541C1349225F2C0BB4ED39A2457B7D8E3DBE1C5D1 D150794D5EB2081B8F4C13F73ED220A7FCF5E2DAB5CD77926FB66CE3063A21DB 1B76BDC2C8B2AA374B9F362404AA707E3E4751848540E83B712DEA3423FE49B6 0AE4D96AAFCB9D6198918EF460E585BBC2A37B3318643CECF4D3F865E14692D9 74267716BA6CC117B13CF185717F6FA0C8602041CE79E696CCA1FECA4AA4CD31 A06916B369B7FAEA1F66AE081DF3D44236F012C557C8076772576CB116783153 C2DEAB8CD542F0B08C75E00AC57C816B372E20C2660374BF09AC498FB3AC9A3E 1BE52953FA41686599DC7213845478725D54DA531A0375CEC8BA1827C27DBAFD 6555A364CD1AEDA1A5DB57 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMR12 %!PS-AdobeFont-1.1: CMR12 1.0 %%CreationDate: 1991 Aug 20 16:38:05 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.0) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMR12) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle 0 def /isFixedPitch false def end readonly def /FontName /CMR12 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 46 /period put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 54 /six put dup 65 /A put dup 86 /V put dup 101 /e put dup 105 /i put dup 108 /l put dup 110 /n put dup 111 /o put dup 112 /p put dup 114 /r put dup 115 /s put readonly def /FontBBox{-34 -251 988 750}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891 016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171 9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758 469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8 2BDBF16FBC7512FAA308A093FE5CF4E9D2405B169CD5365D6ECED5D768D66D6C 68618B8C482B341F8CA38E9BB9BAFCFAAD9C2F3FD033B62690986ED43D9C9361 3645B82392D5CAE11A7CB49D7E2E82DCD485CBA04C77322EB2E6A79D73DC194E 59C120A2DABB9BF72E2CF256DD6EB54EECBA588101ABD933B57CE8A3A0D16B28 51D7494F73096DF53BDC66BBF896B587DF9643317D5F610CD9088F9849126F23 DDE030F7B277DD99055C8B119CAE9C99158AC4E150CDFC2C66ED92EBB4CC092A AA078CE16247A1335AD332DAA950D20395A7384C33FF72EAA31A5B89766E635F 45C4C068AD7EE867398F0381B07CB94D29FF097D59FF9961D195A948E3D87C31 821E9295A56D21875B41988F7A16A1587050C3C71B4E4355BB37F255D6B237CE 96F25467F70FA19E0F85785FF49068949CCC79F2F8AE57D5F79BB9C5CF5EED5D 9857B9967D9B96CDCF73D5D65FF75AFABB66734018BAE264597220C89FD17379 26764A9302D078B4EB0E29178C878FD61007EEA2DDB119AE88C57ECFEF4B71E4 140A34951DDC3568A84CC92371A789021A103A1A347050FDA6ECF7903F67D213 1D0C7C474A9053866E9C88E65E6932BA87A73686EAB0019389F84D159809C498 1E7A30ED942EB211B00DBFF5BCC720F4E276C3339B31B6EABBB078430E6A09BB 377D3061A20B1EB98796B8607EECBC699445EAA866C38E02DF59F5EDD378303A 0733B90E7835C0AAF32BA04F1566D8161EA89CD4D14DDB953F8B910BFC8A7F03 5020F55EF8FC2640ADADA156F6CF8F2EB6610F7EE8874A26CBE7CD154469B9F4 ED76886B3FB679FFDEB59BB6C55AF7087BA48B75EE2FB374B19BCC421A963E15 FE05ECAAF9EECDF4B2715010A320102E6F8CCAA342FA11532671CEBE01C1B982 4B1CF704E817814FF9C921A7DF86627623F382208EB0CCEC832D35D9B936CFA7 3946FA2494DBC51325D4330866D33DD3E546B774EB8ACC089E62AFEE8955A55F F2B6F74FD94C06C5C71F87938D5295A2ACF34830CD5242B56841A2B4137544A1 32D98E64AD37F790574845703C739F5BDFB05BFA53B0F4389B0FCCFF03D25AE7 09DDC79EAB0178EF14D67282335F3AB8B2AFACE2E06433376B2007DEE8B60624 AE40AA85E30531E640E128CD5F89EBA045D173D10E50C8C0522099DA01F1B00C 542D6FBFA1D372D43C55305F01D70BEC886B96806AC7BA30B76FA28E75717FC8 AB91CB77949111B50B8566C1C0242A6F73E444877F0A39CC1EA349594E7540FF AD34A14D43FC327A1517B6B034B322B09347BA663558256046DC0D66DE0099EA 1B33A960B7A3C37FEE174795CA3C975F9D16DD114308ADD38F203B7DE2E8A220 885A7E036E768FBB3B599E5A76C8E7CE0B75820B269EEE63EEC8156098D183A8 A6D20104A15BE6558EFD1C9C4F5D230827E102D33E5D96C9522AD0D46B430943 3B64D20F701A7B064FEA4EA6E28DE141C2BEF2FC6C9F3237694002B9B18789C6 D157AD81136E8E951CBD0366A5206F05F4A68C7C1017E49F254ED437707E87B6 6AAD86C83DBC17FBC5FCF9E51DE92CEAE5C6818967AC83A26B3AE2E54AE34218 0D5C577A0F56115705ADADCE83D89735A71D69E8CAF93A20A22616047C498A1A 0092BC92641DF088AC0C591572F8D719394C19585CD1F03DF4D35F627AFBC502 A2C36CB17EB20E23835F6E0CB42B1C18532DFFBF0840666FED39C99BDE7DC317 974DC1D34097CC7B71ACDBCDED56E7EB088B4E7D2AAF4F761745DEE6D371852D 4F51756C97363F7D9AE57D19341CF566C531110F8F04197B207A4BCADA5199D4 CB86798A5059690E4F1C18A9ADBF9BD3E54AC6BC7B0908DBE211F4E7964CD594 1C3AD1AA5536E4BF9A0586DDC944D99238E2A3ED0F178F49B1A45BCEB385BC68 98AEE8041EDF3243ECE88920C04B609A7373E661B0E5ACDB0FD366CC417615B8 6C35D5FEED5EB88FE43D4688A7ECAB9D1FF5A44DFB75FE133A5C243E2B9F7F77 B33F05A19C616A5ED4634EEAC2B9E6F9A344ADF85759070E7083FA255EC10296 E3DEBEC97364554F8CDF3BE4E5E2EEE9E4E45FB96E677F01FA938D0CDA3F5471 AE69BCF62A767784279F56790C0789646DF52978F125488EDCD6B73EDBB489AF F811E568EDD1F7CD8B5BF7EBC228245BF2C62A06EB195D8741C76F5DCFE74F80 FED9A7B976104C0CA2536A4412B89AF59686278B858584AAF32B674E90412EE2 1C8D0463194B58C61671161578E69FC7CC0FCC62B280055D4FC3043304E9E2CD 5F3318799C0EA5F28EED6D3504E96DFAFAFC4F543F230712C706DE7C45CC9787 A069D4DF2A2C2FBD6EAA437DF7516A3E4FD3DA89419CC9BCCD2A73AD0FA50294 CDE5E44A9165E301B5F704365678E92FBDC4510A5DB07FD9AE33D4C84C9FE155 E37BD11BE772DC9251386845B7BEC43C24C189FFF8BDB7273F62220AE14B1A60 0AFE4E34818E562F410E77821E76B484F1115BD553DCB16AA903852003EF08F2 E0F957413F700296B101646D527B5B310F1B91D0BD9E89E6A775A580201E80B8 7CF3C74957B2A3D1570A2A4916B8A0975F0A81716DBC3951ED697869EBC156E3 F0A23EEBD4FC396012828EFF16B54612A009DD4995F130D37BE4807F8B245CE2 BB5A38299450E19188E0C466A7797AB2C212116ACFAEAB012AB7107AA6A2FA37 728C28CC379BFF030365AC36905415B2DBD212248390F79B7191F2F1DA344F0E 9619C0FA65A2F476272B03C5B796D926B1790F641EB6ADD5D4442C7CA34FD39F 0F07EF7837C5C9E4DBF477CED9AADBFDED496AFF3F1C45F23D7158A56CAF97EF 92C1C497C5A01F715F7E78E0254121B30DC4524D6D5F973A4B57FBF5DB7AEBE6 9E8434BBFF5AF266ACD0AF8BBD187FCA81C2281F0C91A034F65F1D817C719C5B 0AE0A10EDB2710CC595B4573B65B1B8E98D763439902375896EE49506856F5E2 51038BBE4FA692FE726887E9A5E065BCB4DA264DF7CD16D67B7ED0996CC4396C B24053DCAD500585E333CA028CAE126BFB0377D0E8366EA01F735371E3EF5190 50F0C3BDB1D32BE74968588ECE292B2F5012586265E55AAEBECD3951AE2C9C5F 3D64EAD776C7A4DEF14290037DF2ADE3A2810143A58AB50F5AB48232FF2B1A98 982CFCFE7A9A52A774E0D9A624BAEEFEE43CF556BAB6ADFBCA7BCDD3F05778BD F0FBD6EDB44CE80341CFE098F908A099EE3010C7BAF55C5582B053EB0CF5C34E 991FA08EBA1FC5D3B893F8545CC37AABC686FECA16646D81EA85D25F2AA8EA77 5E8B2FBFF81D86B7C64925E42F9FF75655AA2DC7B5BEECF8BEC424A4C236A415 6127438B84B02A8BF4D492512634F3AD4992201D7D6C6AE703A7809A77E7767A 3511588FB5B93013A1FCD2B0380C2321B19EE90EDA17B12A0D790E5DAE925B3A 4E026D2B52866C779C83EF5F31F4F54D7A289480C2FAE03138709E503ED81204 D6287D1711497562A0E28416E75D65D3425560F1CB61104F2A733F15AA0BEF31 D7308DD1846D6B9B5921D36F994344441189785075F9FF2EE79207AA0E82B5AD 609C387B86EB0ABACD9CEA427B981C30006ECE05BAADF7592F74DED5907FE422 7D316876A7DEEA4B4053702EFDA2F861490C7034E7A929F0492535503C0837EE BC80417EAC6704D64B693819FCC0BBBEC2B9BCBD2F5FD6B5FEC468E13BF720CE EB0BA928A7A92CD4705CA1BF67B3B395148E434029714A75CAF4AED10E45D5DC 163EBCB40CF5C9066CC946B6310B505F8FE89D7F610C9EA4E542BDCC188353CE 90D7BB66398EB5B153AA09A62ECBAD0C8B40BCC4E30280E57B47418FA66A2347 0CAACE2201AB788595D5B74EFE9BADF5679C6A97E7E714DA8D1E7C50271E072C AE75962CA72981F6ED551C2C9D322C007234D5DBB570E3C1EBE06DDA2E011B20 55DD67C1D3E9B3E7AC47C1D15DFE921E8F1FBB6843BBF37D669E637D201B84F0 9D49E981C6F1A803C1B40FE4DB82C3A53D138795B3816D4B07DE20621D5A644A 57E86C30E7A8096880A02E4723AA31EDB8DB7E95E373F96CE6E41EEC9EF06020 E11CB902AD80E02892F6733FC715C0957238158AAB70D6FAEF073D0259DC24FD 4B3DC7F0DE52D04B1F479806E7714B73EB1D225E1A83B9BC4177EB0C672BFBFA CF4CD8EE1C5D8639434D7951537923AB79CB195181019DB1935B705EF6DD9A3D 3F15F7E634554208F4E8E7D775BB4A6E1E0EC05DF40B444B3B8D00A528E80B09 ED50BCB1407B90D5CB7C3FE49C4420B51FA0DF45436FF5071FDE0E17F14C650A 0785E6CBFF8E6C6A79BB002AED449A16BE91458BF2DFAE96D887DBE264B45C86 89DD114648E6626197C1D181F63141634346FBC14CF4BB310FBCED5657CDBD54 D86C098E7A52D9D8A829BF4C700992862434F2FAEFBD7104CE221E8D985A2AA0 B659BE12D8CFD0BFC998A2CF7409A90690A65D20E3C909B2073D336CAEAD 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont TeXDict begin 40258431 52099146 1000 600 600 (fitsio.dvi) @start /Fa 193[71 62[{}1 90.9091 /CMMI10 rf /Fb 133[50 59 59 81 59 62 44 44 46 1[62 56 62 93 31 59 1[31 62 56 34 51 62 50 62 54 9[116 85 86 78 62 84 1[77 84 88 106 67 88 1[42 88 88 70 74 86 81 80 85 6[31 1[56 56 56 56 56 56 56 56 1[56 31 37 32[62 12[{}58 99.6264 /CMBX12 rf /Fc 149[25 2[45 45 86[45 15[{}4 90.9091 /CMSY10 rf /Fd 133[60 71 71 97 71 75 52 53 55 1[75 67 75 112 37 71 1[37 75 67 41 61 75 60 75 65 9[139 102 103 94 75 100 1[92 101 105 128 81 105 1[50 105 106 85 88 103 97 96 102 6[37 67 67 67 67 67 67 67 67 67 67 67 37 45 3[52 52 27[75 78 11[{}63 119.552 /CMBX12 rf /Fe 129[48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 1[48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 33[{}93 90.9091 /CMTT10 rf /Ff 139[75 1[79 1[108 7[108 2[88 3[94 29[140 9[97 97 97 97 97 97 97 97 97 97 48[{}17 172.188 /CMBX12 rf /Fg 165[56 68 68 93 68 68 66 51 67 1[62 71 68 83 57 71 1[33 68 71 59 62 69 66 64 68 6[25 45 45 45 45 45 45 45 45 45 45 45 25 30 45[{}38 90.9091 /CMSL10 rf /Fh 134[55 55 1[55 58 41 41 43 1[58 52 58 87 29 2[29 58 52 32 48 58 46 58 51 11[80 73 58 78 1[71 79 82 4[40 1[82 66 69 80 76 74 79 7[52 52 52 52 52 52 52 52 52 52 52 1[35 32[58 12[{}49 90.9091 /CMBX10 rf /Fi 132[45 40 48 48 66 48 51 35 36 36 48 51 45 51 76 25 48 28 25 51 45 28 40 51 40 51 45 25 2[25 45 25 56 68 68 93 68 68 66 51 67 71 62 71 68 83 57 71 47 33 68 71 59 62 69 66 64 68 71 43 43 71 25 25 25 45 45 45 45 45 45 45 45 45 45 45 25 30 25 71 45 35 35 25 71 76 45 76 45 25 18[76 51 51 53 11[{}93 90.9091 /CMR10 rf /Fj 140[46 46 1[65 59 65 1[33 2[33 3[52 14[88 20[88 10[59 2[59 59 59 59 1[33 46[{}16 119.552 /CMR12 rf /Fk 138[90 63 64 66 2[81 90 134 45 2[45 1[81 49 74 1[72 90 78 12[112 90 2[110 6[60 2[101 4[122 65[{}21 143.462 /CMBX12 rf /Fl 134[123 123 1[123 129 90 92 95 1[129 116 129 194 65 2[65 129 116 71 106 129 103 129 113 11[179 162 129 173 1[159 175 182 4[87 1[183 146 153 178 168 165 175 17[116 1[77 5[65 26[129 12[{}40 206.559 /CMBX12 rf end %%EndProlog %%BeginSetup %%Feature: *Resolution 600dpi TeXDict begin %%BeginPaperSize: Letter letter %%EndPaperSize end %%EndSetup %%Page: 1 1 TeXDict begin 1 0 bop 861 1940 a Fl(FITSIO)76 b(User's)g(Guide)356 2399 y Fk(A)54 b(Subroutine)d(In)l(terface)i(to)g(FITS)h(F)-13 b(ormat)54 b(Files)1055 2659 y(for)g(F)-13 b(ortran)53 b(Programmers)1667 3155 y Fj(V)-10 b(ersion)38 b(3.0)1727 4058 y Fi(HEASAR)m(C)1764 4170 y(Co)s(de)30 b(662)1363 4283 y(Go)s(ddard)f(Space)i(Fligh)m(t)h(Cen)m(ter)1522 4396 y(Green)m(b)s(elt,)f(MD)h(20771)1857 4509 y(USA)1682 5298 y Fj(April)37 b(2016)p eop end %%Page: 2 2 TeXDict begin 2 1 bop 0 299 a Fi(ii)p eop end %%Page: 3 3 TeXDict begin 3 2 bop 0 1267 a Fl(Con)-6 b(ten)g(ts)0 1858 y Fh(1)84 b(In)m(tro)s(duction)3136 b(1)0 2118 y(2)119 b(Creating)34 b(FITSIO/CFITSIO)2405 b(3)136 2280 y Fi(2.1)94 b(Building)31 b(the)f(Library)58 b(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)131 b(3)136 2442 y(2.2)94 b(T)-8 b(esting)32 b(the)e(Library)j(.)46 b(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)131 b(6)136 2604 y(2.3)94 b(Linking)31 b(Programs)f(with)g(FITSIO)40 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)131 b(7)136 2766 y(2.4)94 b(Getting)32 b(Started)f(with)f(FITSIO)55 b(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)131 b(7)136 2928 y(2.5)94 b(Example)31 b(Program)86 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)131 b(8)136 3090 y(2.6)94 b(Legal)32 b(Stu\013)92 b(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)f(.)131 b(9)136 3252 y(2.7)94 b(Ac)m(kno)m(wledgmen)m(ts)30 b(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(10)0 3511 y Fh(3)119 b(A)35 b(FITS)f(Primer)2918 b(13)0 3771 y(4)84 b(FITSIO)34 b(Con)m(v)m(en)m(tions)h(and)g(Guidelines)1993 b(15)136 3933 y Fi(4.1)94 b(CFITSIO)29 b(Size)i(Limitations)42 b(.)k(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(15)136 4095 y(4.2)94 b(Multiple)32 b(Access)f(to)g(the)g(Same)f(FITS) g(File)h(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(16)136 4257 y(4.3)94 b(Curren)m(t)30 b(Header)h(Data)h(Unit)e(\(CHDU\))87 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(16)136 4419 y(4.4)94 b(Subroutine)29 b(Names)79 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(16)136 4581 y(4.5)94 b(Subroutine)29 b(F)-8 b(amilies)33 b(and)c(Datat)m(yp)s (es)44 b(.)i(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(17)136 4742 y(4.6)94 b(Implicit)31 b(Data)h(T)m(yp)s(e)e(Con)m(v)m(ersion)65 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(17)136 4904 y(4.7)94 b(Data)32 b(Scaling)89 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)f(.)85 b(18)136 5066 y(4.8)94 b(Error)30 b(Status)g(V)-8 b(alues)32 b(and)d(the)i(Error)e(Message)j(Stac)m(k)44 b(.)i(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)f(.)85 b(18)136 5228 y(4.9)94 b(V)-8 b(ariable-Length)33 b(Arra)m(y)d(F)-8 b(acilit)m(y)34 b(in)c(Binary)g(T)-8 b(ables)26 b(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(19)136 5390 y(4.10)49 b(Supp)s(ort)29 b(for)h(IEEE)g(Sp)s(ecial)g(V)-8 b(alues)68 b(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(20)136 5552 y(4.11)49 b(When)31 b(the)f(Final)h(Size)g(of)g(the)f(FITS)g(HDU)h (is)f(Unkno)m(wn)k(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(21)136 5714 y(4.12)49 b(Lo)s(cal)32 b(FITS)d(Con)m(v)m(en)m(tions)j(supp)s(orted)c(b)m(y)j (FITSIO)72 b(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(21)1912 5942 y(iii)p eop end %%Page: 4 4 TeXDict begin 4 3 bop 0 299 a Fi(iv)3311 b Fg(CONTENTS)345 555 y Fi(4.12.1)61 b(Supp)s(ort)29 b(for)h(Long)g(String)g(Keyw)m(ord)g (V)-8 b(alues.)62 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(21)345 716 y(4.12.2)61 b(Arra)m(ys)31 b(of)f(Fixed-Length)h(Strings)f(in)g(Binary)h(T)-8 b(ables)70 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)f(.)85 b(22)345 876 y(4.12.3)61 b(Keyw)m(ord)30 b(Units)h(Strings)i (.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(23)345 1037 y(4.12.4)61 b(HIERAR)m(CH)31 b(Con)m(v)m(en)m(tion)h(for) e(Extended)g(Keyw)m(ord)g(Names)83 b(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)f(.)85 b(23)136 1197 y(4.13)49 b(Optimizing)31 b(Co)s(de)f(for)g(Maxim)m(um)h(Pro)s(cessing)g(Sp)s(eed)44 b(.)i(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)f(.)85 b(24)345 1358 y(4.13.1)61 b(Bac)m(kground)31 b(Information:)41 b(Ho)m(w)31 b(CFITSIO)e(Manages)j(Data)g(I/O)91 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(24)345 1518 y(4.13.2)61 b(Optimization)32 b(Strategies)69 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(25)0 1771 y Fh(5)119 b(Basic)36 b(In)m(terface)e(Routines)2504 b(29)136 1931 y Fi(5.1)94 b(FITSIO)30 b(Error)f(Status)h(Routines)84 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(29)136 2092 y(5.2)94 b(File)32 b(I/O)e(Routines)e(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)f(.)85 b(30)136 2252 y(5.3)94 b(Keyw)m(ord)31 b(I/O)f(Routines)36 b(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f (.)85 b(32)136 2412 y(5.4)94 b(Data)32 b(I/O)f(Routines)53 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)f(.)85 b(33)0 2665 y Fh(6)119 b(Adv)-6 b(anced)36 b(In)m(terface)e(Subroutines)2159 b(35)136 2826 y Fi(6.1)94 b(FITS)30 b(File)i(Op)s(en)d(and)g(Close)i(Subroutines:)76 b(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(35)136 2986 y(6.2)94 b(HDU-Lev)m(el)33 b(Op)s(erations)108 b(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(38)136 3146 y(6.3)94 b(De\014ne)31 b(or)f(Rede\014ne)g(the)h(structure)f(of)g(the)h (CHDU)99 b(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(41)136 3307 y(6.4)94 b(FITS)30 b(Header)h(I/O)f(Subroutines)i(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)f(.)85 b(43)345 3467 y(6.4.1)106 b(Header)31 b(Space)g(and)f(P)m(osition)h(Routines)60 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)f(.)85 b(43)345 3628 y(6.4.2)106 b(Read)31 b(or)f(W)-8 b(rite)32 b(Standard)d(Header)i(Routines)67 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)f(.)85 b(43)345 3788 y(6.4.3)106 b(W)-8 b(rite)32 b(Keyw)m(ord)e(Subroutines)116 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.) 85 b(45)345 3949 y(6.4.4)106 b(Insert)30 b(Keyw)m(ord)g(Subroutines)108 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(47)345 4109 y(6.4.5)106 b(Read)31 b(Keyw)m(ord)f(Subroutines)64 b(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(47)345 4270 y(6.4.6)106 b(Mo)s(dify)30 b(Keyw)m(ord)h(Subroutines)55 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(49)345 4430 y(6.4.7)106 b(Up)s(date)31 b(Keyw)m(ord)f(Subroutines)116 b(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(50)345 4591 y(6.4.8)106 b(Delete)33 b(Keyw)m(ord)d(Subroutines)87 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(51)136 4751 y(6.5)94 b(Data)32 b(Scaling)g(and)d(Unde\014ned)g(Pixel)i(P)m (arameters)113 b(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(51)136 4912 y(6.6)94 b(FITS)30 b(Primary)g(Arra)m(y)h(or)f(IMA)m(GE)h(Extension)g(I/O)f (Subroutines)117 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f (.)85 b(52)136 5072 y(6.7)94 b(FITS)30 b(ASCI)s(I)f(and)h(Binary)g(T)-8 b(able)31 b(Data)h(I/O)e(Subroutines)d(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(55)345 5232 y(6.7.1)106 b(Column)30 b(Information)g(Subroutines)121 b(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(55)345 5393 y(6.7.2)106 b(Lo)m(w-Lev)m(el)33 b(T)-8 b(able)31 b(Access)g(Subroutines)60 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)f(.)85 b(58)345 5553 y(6.7.3)106 b(Edit)31 b(Ro)m(ws)f(or)h(Columns)106 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)f(.)85 b(59)345 5714 y(6.7.4)106 b(Read)31 b(and)f(W)-8 b(rite)31 b(Column)f(Data)i(Routines)66 b(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)f(.)85 b(60)p eop end %%Page: 5 5 TeXDict begin 5 4 bop 0 299 a Fg(CONTENTS)3334 b Fi(v)136 555 y(6.8)94 b(Ro)m(w)31 b(Selection)h(and)e(Calculator)i(Routines)95 b(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(64)136 717 y(6.9)94 b(Celestial)33 b(Co)s(ordinate)d(System)g(Subroutines)98 b(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(65)136 879 y(6.10)49 b(File)32 b(Chec)m(ksum)e(Subroutines)75 b(.)45 b(.)h(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(67)136 1041 y(6.11)80 b(Date)32 b(and)d(Time)i(Utilit)m(y)h(Routines)69 b(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(68)136 1204 y(6.12)49 b(General)32 b(Utilit)m(y)g(Subroutines)61 b(.)45 b(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(69)0 1464 y Fh(7)119 b(The)35 b(CFITSIO)e(Iterator)g(F)-9 b(unction)2154 b(77)0 1725 y(8)119 b(Extended)35 b(File)f(Name)h(Syn)m (tax)2330 b(79)136 1887 y Fi(8.1)94 b(Ov)m(erview)84 b(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(79)136 2049 y(8.2)94 b(Filet)m(yp)s(e)62 b(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(82)345 2211 y(8.2.1)106 b(Notes)32 b(ab)s(out)e(HTTP)g(pro)m(xy)g (serv)m(ers)k(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(82)345 2373 y(8.2.2)106 b(Notes)32 b(ab)s(out)e(the)h(stream)f(\014let)m(yp)s (e)h(driv)m(er)54 b(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(83)345 2536 y(8.2.3)106 b(Notes)32 b(ab)s(out)e(the)h(gsiftp)f(\014let)m(yp)s(e)83 b(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(84)345 2698 y(8.2.4)106 b(Notes)32 b(ab)s(out)e(the)h(ro)s(ot)f(\014let)m(yp)s(e)68 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(84)345 2860 y(8.2.5)106 b(Notes)32 b(ab)s(out)e(the)h(shmem)e(\014let)m(yp)s(e:)70 b(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(86)136 3022 y(8.3)94 b(Base)32 b(Filename)90 b(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(86)136 3184 y(8.4)94 b(Output)30 b(File)h(Name)g(when)f(Op)s(ening)f(an)h (Existing)h(File)81 b(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(88)136 3346 y(8.5)94 b(T)-8 b(emplate)32 b(File)g(Name)f(when)e(Creating)i(a)g(New)f(File)57 b(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)f(.)85 b(90)136 3508 y(8.6)94 b(Image)32 b(Tile-Compression)e(Sp)s(eci\014cation)91 b(.)45 b(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)f(.)85 b(90)136 3670 y(8.7)94 b(HDU)32 b(Lo)s(cation)f(Sp)s (eci\014cation)47 b(.)e(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)85 b(90)136 3832 y(8.8)94 b(Image)32 b(Section)39 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)f(.)85 b(91)136 3994 y(8.9)94 b(Image)32 b(T)-8 b(ransform)29 b(Filters)54 b(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(92)136 4156 y(8.10)49 b(Column)30 b(and)g(Keyw)m(ord)g(Filtering)h(Sp)s(eci\014cation)91 b(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)f(.)85 b(94)136 4318 y(8.11)49 b(Ro)m(w)31 b(Filtering)h(Sp)s(eci\014cation)82 b(.)45 b(.)h(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(96)345 4481 y(8.11.1)61 b(General)32 b(Syn)m(tax)44 b(.)i(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(97)345 4643 y(8.11.2)61 b(Bit)32 b(Masks)43 b(.)j(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(99)345 4805 y(8.11.3)61 b(V)-8 b(ector)32 b(Columns)92 b(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(100)345 4967 y(8.11.4)61 b(Go)s(o)s(d)30 b(Time)h(In)m(terv)-5 b(al)31 b(Filtering)62 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(102)345 5129 y(8.11.5)61 b(Spatial)31 b(Region)h(Filtering)59 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(103)345 5291 y(8.11.6)61 b(Example)31 b(Ro)m(w)g(Filters)h(.)45 b(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(105)136 5453 y(8.12)80 b(Binning)30 b(or)g(Histogramming)i(Sp)s (eci\014cation)f(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(106)0 5714 y Fh(9)84 b(T)-9 b(emplate)35 b(Files)2933 b(109)p eop end %%Page: 6 6 TeXDict begin 6 5 bop 0 299 a Fi(vi)3311 b Fg(CONTENTS)136 555 y Fi(9.1)94 b(Detailed)33 b(T)-8 b(emplate)31 b(Line)g(F)-8 b(ormat)48 b(.)e(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(109)136 715 y(9.2)94 b(Auto-indexing)31 b(of)g(Keyw)m(ords)73 b(.)45 b(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(110)136 876 y(9.3)94 b(T)-8 b(emplate)32 b(P)m(arser)f(Directiv)m(es) 87 b(.)45 b(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(111)136 1036 y(9.4)94 b(F)-8 b(ormal)32 b(T)-8 b(emplate)32 b(Syn)m(tax)i(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)f(.)40 b(112)136 1196 y(9.5)94 b(Errors)63 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(112)136 1356 y(9.6)94 b(Examples)72 b(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(112)0 1607 y Fh(10)67 b(Summary)36 b(of)f(all)f(FITSIO)g(User-In)m(terface)h (Subroutines)1215 b(115)0 1858 y(11)67 b(P)m(arameter)35 b(De\014nitions)2563 b(123)0 2109 y(12)67 b(FITSIO)33 b(Error)i(Status)g(Co)s(des)2295 b(129)p eop end %%Page: 1 7 TeXDict begin 1 6 bop 0 1225 a Ff(Chapter)65 b(1)0 1687 y Fl(In)-6 b(tro)6 b(duction)0 2180 y Fi(This)33 b(do)s(cumen)m(t)i (describ)s(es)e(the)h(F)-8 b(ortran-callable)38 b(subroutine)33 b(in)m(terface)j(that)f(is)f(pro)m(vided)g(as)g(part)g(of)h(the)0 2293 y(CFITSIO)f(library)h(\(whic)m(h)h(is)g(written)g(in)f(ANSI)g (C\).)h(This)f(is)h(a)g(companion)g(do)s(cumen)m(t)f(to)i(the)e (CFITSIO)0 2406 y(User's)k(Guide)f(whic)m(h)h(should)e(b)s(e)h (consulted)h(for)f(further)g(information)h(ab)s(out)f(the)h(underlying) e(CFITSIO)0 2518 y(library)-8 b(.)50 b(In)32 b(the)i(remainder)f(of)g (this)h(do)s(cumen)m(t,)g(the)g(terms)f(FITSIO)f(and)h(CFITSIO)f(are)i (in)m(terc)m(hangeable)0 2631 y(and)c(refer)g(to)h(the)g(same)f (library)-8 b(.)0 2791 y(FITSIO/CFITSIO)31 b(is)j(a)f(mac)m(hine-indep) s(enden)m(t)g(library)g(of)h(routines)f(for)g(reading)h(and)f(writing)g (data)h(\014les)0 2904 y(in)c(the)g(FITS)g(\(Flexible)i(Image)f(T)-8 b(ransp)s(ort)29 b(System\))h(data)h(format.)41 b(It)31 b(can)f(also)h(read)g(IRAF)f(format)h(image)0 3017 y(\014les)40 b(and)e(ra)m(w)i(binary)f(data)h(arra)m(ys)g(b)m(y)g(con)m(v)m(erting)h (them)e(on)h(the)g(\015y)f(in)m(to)h(a)g(virtual)g(FITS)f(format)h (\014le.)0 3130 y(This)32 b(library)h(w)m(as)g(written)g(to)h(pro)m (vide)f(a)h(p)s(o)m(w)m(erful)f(y)m(et)h(simple)f(in)m(terface)h(for)f (accessing)i(FITS)d(\014les)h(whic)m(h)0 3243 y(will)j(run)e(on)h(most) h(commonly)g(used)e(computers)h(and)g(w)m(orkstations.)57 b(FITSIO)34 b(supp)s(orts)g(all)i(the)g(features)0 3356 y(describ)s(ed)j(in)g(the)h(o\016cial)i(de\014nition)d(of)h(the)g(FITS) f(format)i(and)e(can)h(read)g(and)f(write)h(all)h(the)f(curren)m(tly)0 3469 y(de\014ned)g(t)m(yp)s(es)h(of)g(extensions,)j(including)d(ASCI)s (I)e(tables)j(\(T)-8 b(ABLE\),)42 b(Binary)f(tables)h(\(BINT)-8 b(ABLE\))43 b(and)0 3582 y(IMA)m(GE)36 b(extensions.)56 b(The)34 b(FITSIO)g(subroutines)g(insulate)i(the)f(programmer)g(from)g (ha)m(ving)h(to)g(deal)f(with)0 3695 y(the)25 b(complicated)h (formatting)g(details)f(in)f(the)h(FITS)f(\014le,)i(ho)m(w)m(ev)m(er,)i (it)d(is)f(assumed)g(that)h(users)f(ha)m(v)m(e)i(a)f(general)0 3808 y(kno)m(wledge)31 b(ab)s(out)f(the)h(structure)f(and)g(usage)h(of) f(FITS)g(\014les.)0 3968 y(The)20 b(CFITSIO)f(pac)m(k)-5 b(age)23 b(w)m(as)e(initially)i(dev)m(elop)s(ed)e(b)m(y)f(the)h(HEASAR) m(C)g(\(High)h(Energy)e(Astroph)m(ysics)h(Science)0 4081 y(Arc)m(hiv)m(e)35 b(Researc)m(h)g(Cen)m(ter\))f(at)h(the)f(NASA)g(Go)s (ddard)e(Space)j(Fligh)m(t)g(Cen)m(ter)f(to)h(con)m(v)m(ert)g(v)-5 b(arious)34 b(existing)0 4194 y(and)25 b(newly)h(acquired)g (astronomical)i(data)e(sets)h(in)m(to)g(FITS)e(format)h(and)f(to)i (further)e(analyze)i(data)g(already)f(in)0 4307 y(FITS)h(format.)41 b(New)28 b(features)g(con)m(tin)m(ue)h(to)g(b)s(e)e(added)h(to)g (CFITSIO)f(in)g(large)i(part)f(due)g(to)g(con)m(tributions)h(of)0 4419 y(ideas)k(or)g(actual)h(co)s(de)f(from)f(users)g(of)h(the)g(pac)m (k)-5 b(age.)49 b(The)33 b(In)m(tegral)h(Science)f(Data)h(Cen)m(ter)f (in)g(Switzerland,)0 4532 y(and)g(the)g(XMM/ESTEC)h(pro)5 b(ject)34 b(in)f(The)g(Netherlands)g(made)g(esp)s(ecially)i (signi\014can)m(t)f(con)m(tributions)g(that)0 4645 y(resulted)c(in)g (man)m(y)h(of)f(the)h(new)f(features)g(that)h(app)s(eared)f(in)g(v2.0)i (of)e(CFITSIO.)0 4805 y(The)22 b(latest)i(v)m(ersion)f(of)g(the)f (CFITSIO)f(source)i(co)s(de,)h(do)s(cumen)m(tation,)i(and)21 b(example)j(programs)e(are)h(a)m(v)-5 b(ailable)0 4918 y(on)30 b(the)h(W)-8 b(orld-Wide)32 b(W)-8 b(eb)31 b(or)f(via)h(anon)m (ymous)f(ftp)g(from:)382 5178 y Fe(http://heasarc.gsfc.nasa)o(.go)o (v/fi)o(tsio)382 5291 y(ftp://legacy.gsfc.nasa.g)o(ov/)o(soft)o(ware)o (/fi)o(tsio)o(/c)1927 5942 y Fi(1)p eop end %%Page: 2 8 TeXDict begin 2 7 bop 0 299 a Fi(2)2452 b Fg(CHAPTER)30 b(1.)71 b(INTR)m(ODUCTION)0 555 y Fi(An)m(y)28 b(questions,)g(bug)f (rep)s(orts,)h(or)f(suggested)i(enhancemen)m(ts)f(related)g(to)h(the)e (CFITSIO)f(pac)m(k)-5 b(age)30 b(should)d(b)s(e)0 668 y(sen)m(t)k(to)g(the)g(FTOOLS)e(Help)h(Desk)h(at)g(the)g(HEASAR)m(C:) 382 928 y Fe(http://heasarc.gsfc.nasa)o(.go)o(v/cg)o(i-bi)o(n/f)o(tool) o(shel)o(p)0 1188 y Fi(This)40 b(User's)i(Guide)f(assumes)g(that)h (readers)f(already)g(ha)m(v)m(e)i(a)f(general)g(understanding)d(of)j (the)f(de\014nition)0 1301 y(and)31 b(structure)g(of)h(FITS)e(format)i (\014les.)44 b(F)-8 b(urther)32 b(information)f(ab)s(out)h(FITS)f (formats)g(is)h(a)m(v)-5 b(ailable)34 b(from)d(the)0 1413 y(FITS)37 b(Supp)s(ort)f(O\016ce)i(at)h Fe (http://fits.gsfc.nasa.g)o(ov)p Fi(.)57 b(In)37 b(particular,)j(the)e ('FITS)g(Standard')f(giv)m(es)0 1526 y(the)31 b(authoritativ)m(e)j (de\014nition)d(of)g(the)h(FITS)e(data)i(format.)43 b(Other)31 b(do)s(cumen)m(ts)g(a)m(v)-5 b(ailable)34 b(at)d(that)h(W)-8 b(eb)32 b(site)0 1639 y(pro)m(vide)e(additional)i(historical)f(bac)m (kground)g(and)e(practical)j(advice)g(on)e(using)g(FITS)f(\014les.)0 1799 y(The)d(HEASAR)m(C)f(also)i(pro)m(vides)f(a)h(v)m(ery)f (sophisticated)h(FITS)e(\014le)i(analysis)f(program)g(called)h(`Fv')g (whic)m(h)f(can)0 1912 y(b)s(e)31 b(used)f(to)i(displa)m(y)f(and)g (edit)g(the)h(con)m(ten)m(ts)g(of)g(an)m(y)f(FITS)g(\014le)g(as)g(w)m (ell)h(as)g(construct)f(new)g(FITS)f(\014les)h(from)0 2025 y(scratc)m(h.)56 b(Fv)36 b(is)f(freely)h(a)m(v)-5 b(ailable)37 b(for)e(most)h(Unix)f(platforms,)i(Mac)f(PCs,)g(and)f (Windo)m(ws)g(PCs.)54 b(CFITSIO)0 2138 y(users)29 b(ma)m(y)h(also)h(b)s (e)f(in)m(terested)g(in)g(the)g(FTOOLS)f(pac)m(k)-5 b(age)31 b(of)g(programs)e(that)h(can)h(b)s(e)e(used)g(to)i(manipulate)0 2251 y(and)f(analyze)i(FITS)d(format)i(\014les.)41 b(Fv)30 b(and)g(FTOOLS)f(are)i(a)m(v)-5 b(ailable)32 b(from)e(their)h(resp)s (ectiv)m(e)g(W)-8 b(eb)31 b(sites)g(at:)382 2511 y Fe (http://fv.gsfc.nasa.gov)382 2624 y(http://heasarc.gsfc.nasa)o(.go)o (v/ft)o(ools)p eop end %%Page: 3 9 TeXDict begin 3 8 bop 0 1225 a Ff(Chapter)65 b(2)0 1687 y Fl(Creating)77 b(FITSIO/CFITSIO)0 2216 y Fd(2.1)135 b(Building)45 b(the)h(Library)0 2467 y Fi(T)-8 b(o)43 b(use)g(the)g(FITSIO)f(subroutines)f(one)j(m)m(ust)e(\014rst)g(build)g (the)h(CFITSIO)f(library)-8 b(,)46 b(whic)m(h)d(requires)f(a)h(C)0 2580 y(compiler.)73 b(gcc)43 b(is)e(ideal,)j(or)d(most)h(other)f (ANSI-C)g(compilers)g(will)h(also)g(w)m(ork.)73 b(The)40 b(CFITSIO)g(co)s(de)h(is)0 2692 y(con)m(tained)25 b(in)f(ab)s(out)f(40) i(C)f(source)g(\014les)f(\(*.c\))j(and)d(header)h(\014les)g(\(*.h\).)39 b(On)23 b(V)-10 b(AX/VMS)25 b(systems)f(2)g(assem)m(bly-)0 2805 y(co)s(de)31 b(\014les)f(\(vmsieeed.mar)h(and)f(vmsieeer.mar\))h (are)g(also)g(needed.)0 2965 y(The)45 b(F)-8 b(ortran)46 b(in)m(terface)g(subroutines)e(to)i(the)f(C)g(CFITSIO)f(routines)h(are) g(lo)s(cated)i(in)e(the)g(f77)p 3538 2965 28 4 v 33 w(wrap1.c,)0 3078 y(through)22 b(f77)p 459 3078 V 33 w(wrap4.c)h(\014les.)38 b(These)22 b(are)h(relativ)m(ely)i(simple)d('wrapp)s(ers')f(that)i (translate)h(the)f(argumen)m(ts)g(in)f(the)0 3191 y(F)-8 b(ortran)26 b(subroutine)e(in)m(to)j(the)e(appropriate)h(format)g(for)f (the)g(corresp)s(onding)g(C)g(routine.)39 b(This)24 b(translation)j(is) 0 3304 y(p)s(erformed)19 b(transparen)m(tly)i(to)g(the)g(user)f(b)m(y)g (a)h(set)h(of)e(C)h(macros)g(lo)s(cated)h(in)e(the)h(cfortran.h)f (\014le.)38 b(Unfortunately)0 3417 y(cfortran.h)28 b(do)s(es)g(not)g (supp)s(ort)f(ev)m(ery)h(com)m(bination)i(of)e(C)g(and)f(F)-8 b(ortran)29 b(compilers)g(so)f(the)h(F)-8 b(ortran)28 b(in)m(terface)0 3530 y(is)i(not)h(supp)s(orted)e(on)h(all)h (platforms.)41 b(\(see)31 b(further)e(notes)i(b)s(elo)m(w\).)0 3690 y(A)f(standard)f(com)m(bination)j(of)e(C)f(and)h(F)-8 b(ortran)30 b(compilers)h(will)f(b)s(e)f(assumed)h(b)m(y)f(default,)i (but)e(one)h(ma)m(y)h(also)0 3803 y(sp)s(ecify)f(a)h(particular)f(F)-8 b(ortran)32 b(compiler)e(b)m(y)h(doing:)48 4064 y Fe(>)95 b(setenv)46 b(CFLAGS)g(-DcompilerName=1)0 4324 y Fi(\(where)33 b('compilerName')h(is)f(the)g(name)f(of)h(the)g(compiler\))h(b)s(efore) e(running)f(the)i(con\014gure)f(command.)47 b(The)0 4437 y(curren)m(tly)30 b(recognized)i(compiler)f(names)f(are:)48 4698 y Fe(g77Fortran)48 4811 y(IBMR2Fortran)48 4924 y(CLIPPERFortran)48 5036 y(pgiFortran)48 5149 y(NAGf90Fortran)48 5262 y(f2cFortran)48 5375 y(hpuxFortran)48 5488 y(apolloFortran)48 5601 y(sunFortran)48 5714 y(CRAYFortran)1927 5942 y Fi(3)p eop end %%Page: 4 10 TeXDict begin 4 9 bop 0 299 a Fi(4)1896 b Fg(CHAPTER)30 b(2.)111 b(CREA)-8 b(TING)31 b(FITSIO/CFITSIO)48 555 y Fe(mipsFortran)48 668 y(DECFortran)48 781 y(vmsFortran)48 894 y(CONVEXFortran)48 1007 y(PowerStationFortran)48 1120 y(AbsoftUNIXFortran)48 1233 y(AbsoftProFortran)48 1346 y(SXFortran)0 1609 y Fi(Alternativ)m(ely)-8 b(,)42 b(one)c(ma)m(y)g(edit)g(the)f(CFLA)m(GS)h(line)f(in)h(the)f(Mak)m (e\014le)i(to)f(add)f(the)h('-DcompilerName')i(\015ag)0 1722 y(after)31 b(running)e(the)h('./con\014gure')h(command.)0 1882 y(The)f(CFITSIO)f(library)h(is)g(built)g(on)h(Unix)f(systems)g(b)m (y)g(t)m(yping:)48 2146 y Fe(>)95 b(./configure)45 b ([--prefix=/target/insta)o(llat)o(ion)o(/pat)o(h])764 2259 y([--enable-sse2])e([--enable-ssse3])48 2372 y(>)95 b(make)476 b(\(or)95 b('make)46 b(shared'\))48 2485 y(>)95 b(make)47 b(install)93 b(\(this)46 b(step)h(is)g(optional\))0 2749 y Fi(at)24 b(the)g(op)s(erating)g(system)g(prompt.)38 b(The)23 b(con\014gure)g(command)g(customizes)i(the)f(Mak)m(e\014le)h (for)f(the)g(particular)0 2861 y(system,)g(then)d(the)g(`mak)m(e')i (command)e(compiles)h(the)f(source)h(\014les)f(and)g(builds)f(the)h (library)-8 b(.)38 b(T)m(yp)s(e)21 b(`./con\014gure')0 2974 y(and)34 b(not)h(simply)f(`con\014gure')h(to)h(ensure)e(that)h (the)g(con\014gure)g(script)f(in)h(the)g(curren)m(t)f(directory)h(is)g (run)f(and)0 3087 y(not)29 b(some)g(other)g(system-wide)g(con\014gure)f (script.)40 b(The)29 b(optional)h('pre\014x')e(argumen)m(t)h(to)g (con\014gure)g(giv)m(es)h(the)0 3200 y(path)e(to)i(the)f(directory)g (where)f(the)h(CFITSIO)f(library)g(and)g(include)h(\014les)f(should)g (b)s(e)g(installed)i(via)f(the)g(later)0 3313 y('mak)m(e)j(install')f (command.)41 b(F)-8 b(or)31 b(example,)143 3577 y Fe(>)48 b(./configure)c(--prefix=/usr1/local)0 3841 y Fi(will)25 b(cause)h(the)f('mak)m(e)h(install')g(command)f(to)h(cop)m(y)g(the)f (CFITSIO)e(lib)s(c\014tsio)i(\014le)h(to)f(/usr1/lo)s(cal/lib)i(and)e (the)0 3953 y(necessary)33 b(include)e(\014les)i(to)f(/usr1/lo)s (cal/include)j(\(assuming)d(of)g(course)g(that)h(the)f(pro)s(cess)g (has)g(p)s(ermission)0 4066 y(to)f(write)g(to)g(these)g(directories\).) 0 4227 y(The)24 b(optional)i({enable-sse2)g(and)e({enable-ssse3)i (\015ags)e(will)h(cause)g(con\014gure)f(to)h(attempt)h(to)f(build)e (CFITSIO)0 4339 y(using)31 b(faster)h(b)m(yte-sw)m(apping)g (algorithms.)46 b(See)32 b(the)g("Optimizing)g(Programs")g(section)h (of)f(this)f(man)m(ual)h(for)0 4452 y(more)f(information)f(ab)s(out)g (these)h(options.)0 4613 y(By)37 b(default,)i(the)f(Mak)m(e\014le)g (will)g(b)s(e)e(con\014gured)g(to)i(build)e(the)h(set)h(of)f(F)-8 b(ortran-callable)40 b(wrapp)s(er)35 b(routines)0 4725 y(whose)30 b(calling)i(sequences)f(are)f(describ)s(ed)g(later)h(in)f (this)g(do)s(cumen)m(t.)0 4886 y(The)e('mak)m(e)h(shared')f(option)h (builds)e(a)i(shared)e(or)i(dynamic)f(v)m(ersion)h(of)f(the)h(CFITSIO)d (library)-8 b(.)40 b(When)28 b(using)0 4999 y(the)f(shared)f(library)h (the)g(executable)h(co)s(de)f(is)g(not)g(copied)g(in)m(to)h(y)m(our)f (program)g(at)g(link)g(time)g(and)g(instead)g(the)0 5111 y(program)g(lo)s(cates)i(the)f(necessary)g(library)f(co)s(de)h(at)g (run)e(time,)j(normally)f(through)e(LD)p 3065 5111 28 4 v 33 w(LIBRAR)-8 b(Y)p 3514 5111 V 34 w(P)g(A)g(TH)28 b(or)0 5224 y(some)j(other)f(metho)s(d.)41 b(The)29 b(adv)-5 b(an)m(tages)33 b(of)d(using)g(a)h(shared)e(library)h(are:)143 5488 y Fe(1.)95 b(Less)47 b(disk)f(space)h(if)g(you)g(build)f(more)h (than)f(1)i(program)143 5601 y(2.)95 b(Less)47 b(memory)f(if)h(more)g (than)f(one)h(copy)g(of)g(a)g(program)f(using)h(the)g(shared)334 5714 y(library)f(is)h(running)f(at)h(the)g(same)g(time)f(since)h(the)g (system)f(is)h(smart)p eop end %%Page: 5 11 TeXDict begin 5 10 bop 0 299 a Fg(2.1.)72 b(BUILDING)31 b(THE)f(LIBRAR)-8 b(Y)2507 b Fi(5)334 555 y Fe(enough)46 b(to)h(share)g(copies)f(of)h(the)g(shared)f(library)g(at)h(run)g(time.) 143 668 y(3.)95 b(Possibly)46 b(easier)g(maintenance)e(since)j(a)g(new) g(version)f(of)h(the)g(shared)334 781 y(library)f(can)h(be)g(installed) e(without)h(relinking)f(all)i(the)g(software)334 894 y(that)g(uses)f(it)i(\(as)e(long)h(as)g(the)g(subroutine)e(names)i(and) f(calling)334 1007 y(sequences)f(remain)h(unchanged\).)143 1120 y(4.)95 b(No)47 b(run-time)f(penalty.)0 1534 y Fi(The)30 b(disadv)-5 b(an)m(tages)32 b(are:)143 1949 y Fe(1.)47 b(More)g(hassle)f(at)h(runtime.)94 b(You)46 b(have)h(to)g(either)f (build)h(the)g(programs)286 2062 y(specially)f(or)h(have)f (LD_LIBRARY_PATH)e(set)j(right.)143 2175 y(2.)g(There)g(may)g(be)g(a)g (slight)f(start)h(up)g(penalty,)e(depending)h(on)h(where)f(you)h(are) 286 2288 y(reading)f(the)h(shared)f(library)g(and)h(the)g(program)f (from)g(and)h(if)g(your)g(CPU)g(is)286 2401 y(either)f(really)h(slow)f (or)h(really)f(heavily)g(loaded.)0 2815 y Fi(On)30 b(HP/UX)i(systems,)g (the)f(en)m(vironmen)m(t)h(v)-5 b(ariable)32 b(CFLA)m(GS)f(should)f(b)s (e)h(set)g(to)h(-Ae)g(b)s(efore)f(running)e(con-)0 2928 y(\014gure)h(to)h(enable)g("extended)g(ANSI")f(features.)0 3088 y(It)j(ma)m(y)g(not)g(b)s(e)f(p)s(ossible)g(to)h(statically)i (link)e(programs)f(that)h(use)g(CFITSIO)e(on)h(some)h(platforms)g (\(namely)-8 b(,)0 3201 y(on)28 b(Solaris)h(2.6\))h(due)e(to)h(the)g (net)m(w)m(ork)g(driv)m(ers)f(\(whic)m(h)h(pro)m(vide)g(FTP)f(and)g (HTTP)g(access)h(to)h(FITS)d(\014les\).)41 b(It)0 3314 y(is)33 b(p)s(ossible)f(to)i(mak)m(e)f(b)s(oth)g(a)g(dynamic)f(and)g(a) i(static)g(v)m(ersion)f(of)g(the)g(CFITSIO)e(library)-8 b(,)34 b(but)e(net)m(w)m(ork)i(\014le)0 3427 y(access)e(will)e(not)h(b) s(e)f(p)s(ossible)g(using)g(the)g(static)i(v)m(ersion.)0 3587 y(On)c(V)-10 b(AX/VMS)31 b(and)d(ALPHA/VMS)i(systems)f(the)h(mak)m (e)p 2100 3587 28 4 v 34 w(g\015oat.com)h(command)e(\014le)g(ma)m(y)h (b)s(e)f(executed)h(to)0 3700 y(build)35 b(the)i(c\014tsio.olb)g(ob)5 b(ject)37 b(library)f(using)g(the)g(default)h(G-\015oating)g(p)s(oin)m (t)g(option)f(for)g(double)g(v)-5 b(ariables.)0 3813 y(The)37 b(mak)m(e)p 405 3813 V 33 w(d\015oat.com)i(and)d(mak)m(e)p 1279 3813 V 34 w(ieee.com)j(\014les)f(ma)m(y)f(b)s(e)g(used)f(instead)i (to)g(build)e(the)h(library)g(with)g(the)0 3926 y(other)26 b(\015oating)i(p)s(oin)m(t)e(options.)39 b(Note)28 b(that)f(the)f (getcwd)h(function)f(that)h(is)f(used)f(in)h(the)h(group.c)f(mo)s(dule) f(ma)m(y)0 4039 y(require)44 b(that)i(programs)e(using)g(CFITSIO)f(b)s (e)h(link)m(ed)i(with)e(the)h(ALPHA$LIBRAR)-8 b(Y:V)e(AX)m(CR)i(TL.OLB) 0 4152 y(library)g(.)41 b(See)30 b(the)h(example)g(link)f(line)h(in)f (the)h(next)f(section)i(of)e(this)h(do)s(cumen)m(t.)0 4312 y(On)25 b(Windo)m(ws)h(IBM-PC)g(t)m(yp)s(e)g(platforms)f(the)h (situation)h(is)e(more)h(complicated)i(b)s(ecause)d(of)h(the)g(wide)g (v)-5 b(ariet)m(y)0 4425 y(of)43 b(F)-8 b(ortran)43 b(compilers)h(that) f(are)g(a)m(v)-5 b(ailable)45 b(and)d(b)s(ecause)h(of)g(the)g(inheren)m (t)g(complexities)i(of)d(calling)j(the)0 4538 y(CFITSIO)25 b(C)g(routines)h(from)g(F)-8 b(ortran.)40 b(Tw)m(o)26 b(di\013eren)m(t)h(v)m(ersions)f(of)g(the)h(CFITSIO)d(dll)i(library)g (are)g(a)m(v)-5 b(ailable,)0 4650 y(compiled)28 b(with)e(the)i(Borland) f(C++)f(compiler)i(and)e(the)i(Microsoft)g(Visual)g(C++)e(compiler,)i (resp)s(ectiv)m(ely)-8 b(,)30 b(in)0 4763 y(the)g(\014les)g(c\014tsio)s (dll)p 679 4763 V 33 w(2xxx)p 901 4763 V 34 w(b)s(orland.zip)f(and)g (c\014tsio)s(dll)p 1924 4763 V 33 w(3xxx)p 2146 4763 V 33 w(v)m(cc.zip,)j(where)e('3xxx')h(represen)m(ts)f(the)g(curren)m(t) 0 4876 y(release)44 b(n)m(um)m(b)s(er.)76 b(Both)43 b(these)g(dll)g (libraries)g(con)m(tain)h(a)f(set)g(of)f(F)-8 b(ortran)44 b(wrapp)s(er)d(routines)h(whic)m(h)g(ma)m(y)0 4989 y(b)s(e)37 b(compatible)i(with)e(some,)j(but)d(probably)g(not)g(all,)k(a)m(v)-5 b(ailable)40 b(F)-8 b(ortran)38 b(compilers.)63 b(T)-8 b(o)38 b(test)g(if)g(they)g(are)0 5102 y(compatible,)29 b(compile)f(the)f(program)g(testf77.f)h(and)f(try)f(linking)i(to)f (these)h(dll)e(libraries.)40 b(If)27 b(these)g(libraries)g(do)0 5215 y(not)22 b(w)m(ork)g(with)g(a)g(particular)g(F)-8 b(ortran)22 b(compiler,)j(then)c(it)i(ma)m(y)f(b)s(e)f(necessary)i(to)f (mo)s(dify)f(the)h(\014le)g("cfortran.h")0 5328 y(to)28 b(supp)s(ort)d(that)j(particular)f(com)m(bination)i(of)e(C)g(and)f(F)-8 b(ortran)28 b(compilers,)h(and)d(then)h(rebuild)f(the)h(CFITSIO)0 5441 y(dll)j(library)-8 b(.)41 b(This)30 b(will)g(require,)h(ho)m(w)m (ev)m(er,)h(some)e(exp)s(ertise)h(in)f(mixed)g(language)i(programming.) 0 5601 y(CFITSIO)f(should)g(b)s(e)g(compatible)j(with)d(most)i(curren)m (t)f(ANCI)g(C)f(and)h(C++)f(compilers:)44 b(Cra)m(y)33 b(sup)s(ercom-)0 5714 y(puters)d(are)g(curren)m(tly)h(not)f(supp)s (orted.)p eop end %%Page: 6 12 TeXDict begin 6 11 bop 0 299 a Fi(6)1896 b Fg(CHAPTER)30 b(2.)111 b(CREA)-8 b(TING)31 b(FITSIO/CFITSIO)0 555 y Fd(2.2)135 b(T)-11 b(esting)46 b(the)f(Library)0 805 y Fi(The)40 b(CFITSIO)e(library)i(should)f(b)s(e)g(tested)i(b)m(y)f (building)f(and)g(running)g(the)h(testprog.c)h(program)f(that)h(is)0 918 y(included)30 b(with)g(the)g(release.)42 b(On)30 b(Unix)g(systems)g(t)m(yp)s(e:)191 1156 y Fe(\045)47 b(make)g(testprog)191 1269 y(\045)g(testprog)f(>)h(testprog.lis)191 1382 y(\045)g(diff)g(testprog.lis)d(testprog.out)191 1495 y(\045)j(cmp)g(testprog.fit)e(testprog.std)0 1733 y Fi(On)30 b(VMS)g(systems,)g(\(assuming)h(cc)g(is)f(the)h(name)f(of)h (the)f(C)g(compiler)h(command\),)g(t)m(yp)s(e:)191 1970 y Fe($)47 b(cc)h(testprog.c)191 2083 y($)f(link)g(testprog,)e (cfitsio/lib,)g(alpha$library:vaxcrtl/l)o(ib)191 2196 y($)i(run)g(testprog)0 2434 y Fi(The)30 b(testprog)h(program)g(should)e (pro)s(duce)g(a)i(FITS)f(\014le)g(called)i(`testprog.\014t')g(that)f (is)f(iden)m(tical)j(to)e(the)f(`test-)0 2547 y(prog.std')25 b(FITS)f(\014le)g(included)g(with)g(this)h(release.)40 b(The)24 b(diagnostic)i(messages)g(\(whic)m(h)e(w)m(ere)h(pip)s(ed)f (to)h(the)g(\014le)0 2660 y(testprog.lis)h(in)e(the)h(Unix)f(example\)) i(should)d(b)s(e)h(iden)m(tical)j(to)e(the)g(listing)g(con)m(tained)h (in)e(the)h(\014le)f(testprog.out.)0 2773 y(The)30 b('di\013)7 b(')31 b(and)e('cmp')i(commands)f(sho)m(wn)g(ab)s(o)m(v)m(e)h(should)f (not)g(rep)s(ort)g(an)m(y)h(di\013erences)g(in)f(the)g(\014les.)41 b(\(There)0 2886 y(ma)m(y)35 b(b)s(e)e(some)h(minor)g(formatting)g (di\013erences,)i(suc)m(h)d(as)i(the)f(presence)g(or)g(absence)g(of)g (leading)h(zeros,)h(or)e(3)0 2999 y(digit)d(exp)s(onen)m(ts)f(in)g(n)m (um)m(b)s(ers,)g(whic)m(h)g(can)g(b)s(e)g(ignored\).)0 3159 y(The)f(F)-8 b(ortran)31 b(wrapp)s(ers)d(in)h(CFITSIO)f(ma)m(y)j (b)s(e)e(tested)h(with)g(the)g(testf77)h(program.)40 b(On)29 b(Unix)h(systems)g(the)0 3272 y(fortran)g(compilation)i(and)e (link)g(command)g(ma)m(y)h(b)s(e)f(called)h('f77')h(or)e('g77',)j(dep)s (ending)c(on)h(the)g(system.)143 3509 y Fe(\045)48 b(f77)f(-o)g (testf77)f(testf77.f)f(-L.)i(-lcfitsio)e(-lnsl)h(-lsocket)48 3622 y(or)143 3735 y(\045)i(f77)f(-f)g(-o)g(testf77)f(testf77.f)f(-L.)i (-lcfitsio)188 b(\(under)46 b(SUN)h(O/S\))48 3848 y(or)143 3961 y(\045)h(f77)f(-o)g(testf77)f(testf77.f)f(-Wl,-L.)h(-lcfitsio)f (-lm)i(-lnsl)f(-lsocket)g(\(HP/UX\))48 4074 y(or)143 4187 y(\045)i(g77)f(-o)g(testf77)f(-s)h(testf77.f)e(-lcfitsio)g (-lcc_dynamic)g(-lncurses)g(\(Mac)i(OS-X\))143 4413 y(\045)h(testf77)d (>)j(testf77.lis)143 4526 y(\045)g(diff)e(testf77.lis)f(testf77.out)143 4638 y(\045)j(cmp)f(testf77.fit)d(testf77.std)0 4876 y Fi(On)31 b(mac)m(hines)h(running)f(SUN)g(O/S,)h(F)-8 b(ortran)33 b(programs)e(m)m(ust)h(b)s(e)f(compiled)h(with)g(the)g('-f) 7 b(')32 b(option)h(to)f(force)0 4989 y(double)24 b(precision)g(v)-5 b(ariables)25 b(to)g(b)s(e)e(aligned)i(on)f(8-b)m(yte)i(b)s(oundaries)c (to)j(mak)m(e)g(the)g(fortran-declared)f(v)-5 b(ariables)0 5102 y(compatible)34 b(with)e(C.)g(A)h(similar)g(compiler)g(option)g (ma)m(y)g(b)s(e)f(required)g(on)g(other)h(platforms.)48 b(F)-8 b(ailing)34 b(to)f(use)0 5215 y(this)26 b(option)g(ma)m(y)g (cause)h(the)f(program)f(to)i(crash)e(on)h(FITSIO)f(routines)g(that)i (read)f(or)f(write)h(double)g(precision)0 5328 y(v)-5 b(ariables.)0 5488 y(On)27 b(Windo)m(ws)h(platforms,)g(linking)g(F)-8 b(ortran)28 b(programs)f(with)h(a)g(C)f(library)g(often)h(dep)s(ends)e (on)i(the)g(particular)0 5601 y(compilers)40 b(in)m(v)m(olv)m(ed.)71 b(Some)40 b(users)f(ha)m(v)m(e)i(found)d(the)i(follo)m(wing)i(commands) d(w)m(ork)h(when)f(using)g(the)h(In)m(tel)0 5714 y(F)-8 b(ortran)31 b(compiler:)p eop end %%Page: 7 13 TeXDict begin 7 12 bop 0 299 a Fg(2.3.)72 b(LINKING)30 b(PR)m(OGRAMS)h(WITH)f(FITSIO)2041 b Fi(7)0 555 y Fe(ifort)46 b(/libs.dll)g(cfitsio.lib)e(/MD)j(testf77.f)f(/Gm)0 781 y(or)h(possibly,)0 1007 y(ifort)f(/libs:dll)g(cfitsio.lib)e(/MD)j(/fpp) g(/extfpp:cfortran.h,fitsi)o(o.h)191 1120 y(/iface:cvf)e(testf77.f)0 1335 y Fi(Also)32 b(note)h(that)f(on)g(some)g(systems)f(the)h(output)g (listing)g(of)g(the)g(testf77)h(program)f(ma)m(y)g(di\013er)f(sligh)m (tly)i(from)0 1448 y(the)f(testf77.std)i(template)g(if)e(leading)h (zeros)g(are)g(not)g(prin)m(ted)e(b)m(y)i(default)f(b)s(efore)g(the)g (decimal)i(p)s(oin)m(t)e(when)0 1561 y(using)e(F)h(format.)0 1721 y(A)f(few)h(other)f(utilit)m(y)i(programs)e(are)h(included)e(with) h(CFITSIO:)191 1937 y Fe(speed)46 b(-)i(measures)d(the)i(maximum)f (throughput)f(\(in)i(MB)g(per)g(second\))668 2050 y(for)g(writing)f (and)h(reading)f(FITS)g(files)h(with)f(CFITSIO)191 2275 y(listhead)f(-)j(lists)e(all)h(the)g(header)f(keywords)g(in)h(any)g (FITS)f(file)191 2501 y(fitscopy)f(-)j(copies)e(any)h(FITS)g(file)f (\(especially)f(useful)h(in)h(conjunction)811 2614 y(with)g(the)g (CFITSIO's)e(extended)h(input)g(filename)g(syntax\))191 2840 y(cookbook)f(-)j(a)f(sample)f(program)g(that)h(performs)e(common)i (read)f(and)811 2953 y(write)h(operations)e(on)i(a)g(FITS)g(file.)191 3179 y(iter_a,)f(iter_b,)g(iter_c)g(-)h(examples)f(of)h(the)g(CFITSIO)f (iterator)f(routine)0 3394 y Fi(The)30 b(\014rst)f(4)i(of)g(these)g (utilit)m(y)g(programs)f(can)h(b)s(e)f(compiled)h(and)e(link)m(ed)i(b)m (y)f(t)m(yping)143 3610 y Fe(\045)95 b(make)47 b(program_name)0 3936 y Fd(2.3)135 b(Linking)45 b(Programs)h(with)f(FITSIO)0 4186 y Fi(When)31 b(linking)g(applications)i(soft)m(w)m(are)f(with)f (the)g(FITSIO)f(library)-8 b(,)32 b(sev)m(eral)h(system)e(libraries)g (usually)g(need)0 4299 y(to)26 b(b)s(e)f(sp)s(eci\014ed)g(on)g(the)h (link)g(comman)f(Unix)h(systems,)h(the)e(most)h(reliable)h(w)m(a)m(y)f (to)h(determine)e(what)h(libraries)0 4412 y(are)32 b(required)f(is)g (to)i(t)m(yp)s(e)e('mak)m(e)i(testprog')g(and)e(see)h(what)f(libraries) h(the)g(con\014gure)f(script)h(has)f(added.)43 b(The)0 4525 y(t)m(ypical)25 b(libraries)f(that)g(ma)m(y)g(need)f(to)h(b)s(e)f (added)g(are)g(-lm)h(\(the)g(math)f(library\))h(and)f(-lnsl)g(and)g (-lso)s(c)m(k)m(et)j(\(needed)0 4638 y(only)h(for)f(FTP)g(and)g(HTTP)g (\014le)h(access\).)41 b(These)26 b(latter)i(2)f(libraries)g(are)g(not) g(needed)f(on)g(VMS)h(and)f(Windo)m(ws)0 4751 y(platforms,)31 b(b)s(ecause)f(FTP)g(\014le)h(access)g(is)g(not)f(curren)m(tly)h(supp)s (orted)d(on)i(those)h(platforms.)0 4911 y(Note)i(that)g(when)e (upgrading)g(to)i(a)f(new)m(er)g(v)m(ersion)g(of)g(CFITSIO)f(it)h(is)g (usually)g(necessary)g(to)h(recompile,)h(as)0 5024 y(w)m(ell)d(as)g (relink,)g(the)f(programs)g(that)h(use)f(CFITSIO,)f(b)s(ecause)i(the)f (de\014nitions)g(in)g(\014tsio.h)h(often)f(c)m(hange.)0 5351 y Fd(2.4)135 b(Getting)46 b(Started)g(with)f(FITSIO)0 5601 y Fi(In)32 b(order)h(to)h(e\013ectiv)m(ely)i(use)d(the)g(FITSIO)f (library)h(as)h(quic)m(kly)g(as)f(p)s(ossible,)h(it)g(is)f(recommended) g(that)g(new)0 5714 y(users)d(follo)m(w)h(these)g(steps:)p eop end %%Page: 8 14 TeXDict begin 8 13 bop 0 299 a Fi(8)1896 b Fg(CHAPTER)30 b(2.)111 b(CREA)-8 b(TING)31 b(FITSIO/CFITSIO)0 555 y Fi(1.)62 b(Read)38 b(the)f(follo)m(wing)i(`FITS)e(Primer')g(c)m(hapter) h(for)g(a)f(brief)g(o)m(v)m(erview)i(of)f(the)g(structure)e(of)i(FITS)f (\014les.)0 668 y(This)25 b(is)h(esp)s(ecially)h(imp)s(ortan)m(t)g(for) e(users)h(who)f(ha)m(v)m(e)i(not)g(previously)e(dealt)i(with)f(the)g (FITS)f(table)i(and)f(image)0 781 y(extensions.)0 941 y(2.)41 b(W)-8 b(rite)32 b(a)f(simple)f(program)g(to)h(read)g(or)f (write)g(a)h(FITS)f(\014le)g(using)g(the)h(Basic)g(In)m(terface)h (routines.)0 1101 y(3.)41 b(Refer)28 b(to)i(the)f(co)s(okb)s(o)s(ok.f)g (program)f(that)i(is)f(included)f(with)g(this)h(release)h(for)e (examples)i(of)f(routines)f(that)0 1214 y(p)s(erform)h(v)-5 b(arious)30 b(common)h(FITS)f(\014le)g(op)s(erations.)0 1374 y(4.)52 b(Read)34 b(Chapters)g(4)g(and)f(5)i(to)g(b)s(ecome)f (familiar)h(with)e(the)i(con)m(v)m(en)m(tions)h(and)d(adv)-5 b(anced)34 b(features)h(of)f(the)0 1487 y(FITSIO)29 b(in)m(terface.)0 1647 y(5.)47 b(Scan)32 b(through)f(the)h(more)h(extensiv)m(e)g(set)g (of)g(routines)f(that)g(are)h(pro)m(vided)f(in)g(the)g(`Adv)-5 b(anced)32 b(In)m(terface'.)0 1760 y(These)22 b(routines)f(p)s(erform)g (more)h(sp)s(ecialized)h(functions)e(than)g(are)i(pro)m(vided)e(b)m(y)h (the)g(Basic)h(In)m(terface)g(routines.)0 2124 y Fd(2.5)135 b(Example)46 b(Program)0 2380 y Fi(The)32 b(follo)m(wing)i(listing)f (sho)m(ws)f(an)g(example)i(of)e(ho)m(w)h(to)g(use)f(the)g(FITSIO)g (routines)g(in)g(a)h(F)-8 b(ortran)33 b(program.)0 2493 y(Refer)38 b(to)h(the)g(co)s(okb)s(o)s(ok.f)f(program)g(that)h(is)f (included)f(with)h(the)h(FITSIO)e(distribution)g(for)h(examples)h(of)0 2606 y(other)31 b(FITS)e(programs.)286 2891 y Fe(program)46 b(writeimage)0 3117 y(C)238 b(Create)46 b(a)i(FITS)f(primary)e(array)i (containing)e(a)i(2-D)g(image)286 3343 y(integer)f (status,unit,blocksize,bit)o(pix,)o(nax)o(is,n)o(axes)o(\(2\))286 3456 y(integer)g(i,j,group,fpixel,nelement)o(s,ar)o(ray)o(\(300)o(,200) o(\))286 3569 y(character)g(filename*80)286 3681 y(logical)g (simple,extend)286 3907 y(status=0)0 4020 y(C)238 b(Name)47 b(of)g(the)g(FITS)g(file)f(to)i(be)f(created:)286 4133 y(filename='ATESTFILE.FITS')0 4359 y(C)238 b(Get)47 b(an)g(unused)g (Logical)e(Unit)i(Number)f(to)h(use)g(to)g(create)f(the)h(FITS)g(file) 286 4472 y(call)g(ftgiou\(unit,status\))0 4698 y(C)238 b(create)46 b(the)h(new)g(empty)g(FITS)f(file)286 4811 y(blocksize=1)286 4924 y(call)h(ftinit\(unit,filename,blo)o(cksi)o (ze,s)o(tat)o(us\))0 5149 y(C)238 b(initialize)45 b(parameters)g(about) i(the)g(FITS)f(image)h(\(300)f(x)i(200)f(16-bit)f(integers\))286 5262 y(simple=.true.)286 5375 y(bitpix=16)286 5488 y(naxis=2)286 5601 y(naxes\(1\)=300)286 5714 y(naxes\(2\)=200)p eop end %%Page: 9 15 TeXDict begin 9 14 bop 0 299 a Fg(2.6.)72 b(LEGAL)30 b(STUFF)2995 b Fi(9)286 555 y Fe(extend=.true.)0 781 y(C)238 b(write)47 b(the)g(required)e(header)h(keywords)286 894 y(call)h(ftphpr\(unit,simple,bitpi)o(x,na)o(xis,)o(nax)o(es,0)o (,1,e)o(xte)o(nd,s)o(tatu)o(s\))0 1120 y(C)238 b(initialize)45 b(the)i(values)f(in)i(the)e(image)h(with)f(a)i(linear)e(ramp)h (function)286 1233 y(do)h(j=1,naxes\(2\))477 1346 y(do)f (i=1,naxes\(1\))668 1458 y(array\(i,j\)=i+j)477 1571 y(end)g(do)286 1684 y(end)g(do)0 1910 y(C)238 b(write)47 b(the)g(array)f(to)h(the)g(FITS)g(file)286 2023 y(group=1)286 2136 y(fpixel=1)286 2249 y(nelements=naxes\(1\)*naxes\(2)o(\))286 2362 y(call)g(ftpprj\(unit,group,fpixel)o(,nel)o(emen)o(ts,)o(arra)o (y,st)o(atu)o(s\))0 2588 y(C)238 b(write)47 b(another)f(optional)f (keyword)h(to)h(the)g(header)286 2700 y(call)g (ftpkyj\(unit,'EXPOSURE',1)o(500,)o('Tot)o(al)41 b(Exposure)46 b(Time',status\))0 2926 y(C)238 b(close)47 b(the)g(file)f(and)h(free)g (the)g(unit)f(number)286 3039 y(call)h(ftclos\(unit,)d(status\))286 3152 y(call)j(ftfiou\(unit,)d(status\))286 3265 y(end)0 3623 y Fd(2.6)135 b(Legal)46 b(Stu\013)0 3878 y Fi(Cop)m(yrigh)m(t)37 b(\(Unpublished{all)g(righ)m(ts)g(reserv)m(ed)g(under)e(the)i(cop)m (yrigh)m(t)h(la)m(ws)f(of)g(the)g(United)g(States\),)j(U.S.)0 3991 y(Go)m(v)m(ernmen)m(t)30 b(as)g(represen)m(ted)e(b)m(y)h(the)g (Administrator)g(of)g(the)g(National)h(Aeronautics)g(and)e(Space)h (Adminis-)0 4104 y(tration.)42 b(No)31 b(cop)m(yrigh)m(t)g(is)g (claimed)g(in)f(the)h(United)f(States)h(under)e(Title)j(17,)f(U.S.)f (Co)s(de.)0 4264 y(P)m(ermission)g(to)g(freely)f(use,)h(cop)m(y)-8 b(,)31 b(mo)s(dify)-8 b(,)29 b(and)g(distribute)g(this)g(soft)m(w)m (are)i(and)e(its)h(do)s(cumen)m(tation)g(without)0 4377 y(fee)f(is)f(hereb)m(y)g(gran)m(ted,)i(pro)m(vided)e(that)h(this)f(cop) m(yrigh)m(t)i(notice)f(and)f(disclaimer)h(of)f(w)m(arran)m(t)m(y)i(app) s(ears)d(in)h(all)0 4490 y(copies.)0 4650 y(DISCLAIMER:)0 4811 y(THE)33 b(SOFTW)-10 b(ARE)32 b(IS)g(PR)m(O)m(VIDED)i('AS)f(IS')g (WITHOUT)f(ANY)i(W)-10 b(ARRANTY)33 b(OF)g(ANY)h(KIND,)f(EI-)0 4924 y(THER)42 b(EXPRESSED,)f(IMPLIED,)i(OR)e(ST)-8 b(A)g(TUTOR)g(Y,)43 b(INCLUDING,)f(BUT)h(NOT)e(LIMITED)h(TO,)0 5036 y(ANY)33 b(W)-10 b(ARRANTY)33 b(THA)-8 b(T)32 b(THE)g(SOFTW)-10 b(ARE)32 b(WILL)g(CONF)m(ORM)g(TO)g(SPECIFICA)-8 b(TIONS,)30 b(ANY)0 5149 y(IMPLIED)38 b(W)-10 b(ARRANTIES)37 b(OF)h(MER)m(CHANT)-8 b(ABILITY,)38 b(FITNESS)f(F)m(OR)h(A)g(P)-8 b(AR)g(TICULAR)38 b(PUR-)0 5262 y(POSE,)24 b(AND)i(FREEDOM)f(FR)m(OM)h(INFRINGEMENT,)g (AND)f(ANY)h(W)-10 b(ARRANTY)25 b(THA)-8 b(T)25 b(THE)g(DOC-)0 5375 y(UMENT)-8 b(A)g(TION)31 b(WILL)f(CONF)m(ORM)h(TO)e(THE)h(SOFTW) -10 b(ARE,)30 b(OR)g(ANY)h(W)-10 b(ARRANTY)31 b(THA)-8 b(T)30 b(THE)0 5488 y(SOFTW)-10 b(ARE)31 b(WILL)h(BE)g(ERR)m(OR)g (FREE.)g(IN)g(NO)g(EVENT)f(SHALL)g(NASA)h(BE)g(LIABLE)g(F)m(OR)g(ANY)0 5601 y(D)m(AMA)m(GES,)26 b(INCLUDING,)e(BUT)f(NOT)g(LIMITED)h(TO,)f (DIRECT,)g(INDIRECT,)g(SPECIAL)f(OR)h(CON-)0 5714 y(SEQUENTIAL)28 b(D)m(AMA)m(GES,)k(ARISING)d(OUT)g(OF,)h(RESUL)-8 b(TING)29 b(FR)m(OM,)h(OR)f(IN)h(ANY)g(W)-10 b(A)i(Y)30 b(CON-)p eop end %%Page: 10 16 TeXDict begin 10 15 bop 0 299 a Fi(10)1851 b Fg(CHAPTER)30 b(2.)111 b(CREA)-8 b(TING)31 b(FITSIO/CFITSIO)0 555 y Fi(NECTED)25 b(WITH)g(THIS)f(SOFTW)-10 b(ARE,)25 b(WHETHER)g(OR)g(NOT)g (BASED)g(UPON)g(W)-10 b(ARRANTY,)26 b(CON-)0 668 y(TRA)m(CT,)d(TOR)-8 b(T)23 b(,)g(OR)g(OTHER)-10 b(WISE,)22 b(WHETHER)i(OR)f(NOT)f(INJUR)-8 b(Y)24 b(W)-10 b(AS)23 b(SUST)-8 b(AINED)23 b(BY)h(PER-)0 781 y(SONS)h(OR)i(PR)m(OPER)-8 b(TY)26 b(OR)g(OTHER)-10 b(WISE,)26 b(AND)h(WHETHER)g(OR)f(NOT)g(LOSS)f(W)-10 b(AS)26 b(SUST)-8 b(AINED)0 894 y(FR)m(OM,)37 b(OR)e(AR)m(OSE)h(OUT)f (OF)h(THE)g(RESUL)-8 b(TS)35 b(OF,)h(OR)f(USE)h(OF,)g(THE)g(SOFTW)-10 b(ARE)35 b(OR)g(SER-)0 1007 y(VICES)29 b(PR)m(O)m(VIDED)j(HEREUNDER.")0 1451 y Fd(2.7)135 b(Ac)l(kno)l(wledgmen)l(ts)0 1723 y Fi(The)29 b(dev)m(elopmen)m(t)h(of)g(man)m(y)f(of)h(the)f(p)s(o)m(w)m (erful)g(features)g(in)g(CFITSIO)f(w)m(as)i(made)f(p)s(ossible)g (through)f(collab-)0 1836 y(orations)35 b(with)f(man)m(y)h(p)s(eople)f (or)h(organizations)h(from)e(around)f(the)i(w)m(orld.)52 b(The)34 b(follo)m(wing,)j(in)d(particular,)0 1949 y(ha)m(v)m(e)e(made) e(esp)s(ecially)i(signi\014can)m(t)f(con)m(tributions:)0 2109 y(Programmers)25 b(from)h(the)f(In)m(tegral)i(Science)g(Data)g (Cen)m(ter,)g(Switzerland)f(\(namely)-8 b(,)28 b(Jurek)c(Bork)m(o)m (wski,)29 b(Bruce)0 2222 y(O'Neel,)34 b(and)e(Don)h(Jennings\),)f (designed)g(the)h(concept)g(for)f(the)h(plug-in)f(I/O)g(driv)m(ers)g (that)h(w)m(as)g(in)m(tro)s(duced)0 2335 y(with)i(CFITSIO)e(2.0.)56 b(The)34 b(use)h(of)g(`driv)m(ers')g(greatly)h(simpli\014ed)f(the)g(lo) m(w-lev)m(el)j(I/O,)d(whic)m(h)f(in)h(turn)f(made)0 2448 y(other)40 b(new)f(features)i(in)e(CFITSIO)f(\(e.g.,)45 b(supp)s(ort)38 b(for)h(compressed)h(FITS)f(\014les)h(and)f(supp)s(ort) f(for)i(IRAF)0 2560 y(format)32 b(image)g(\014les\))g(m)m(uc)m(h)f (easier)i(to)f(implemen)m(t.)44 b(Jurek)31 b(Bork)m(o)m(wski)h(wrote)g (the)g(Shared)e(Memory)i(driv)m(er,)0 2673 y(and)23 b(Bruce)i(O'Neel)g (wrote)f(the)g(driv)m(ers)g(for)f(accessing)j(FITS)d(\014les)h(o)m(v)m (er)h(the)f(net)m(w)m(ork)h(using)e(the)i(FTP)-8 b(,)24 b(HTTP)-8 b(,)0 2786 y(and)30 b(R)m(OOT)g(proto)s(cols.)0 2946 y(The)45 b(ISDC)g(also)h(pro)m(vided)f(the)h(template)h(parsing)e (routines)g(\(written)h(b)m(y)f(Jurek)g(Bork)m(o)m(wski\))i(and)e(the)0 3059 y(hierarc)m(hical)39 b(grouping)d(routines)h(\(written)h(b)m(y)f (Don)h(Jennings\).)60 b(The)37 b(ISDC)f(D)m(AL)i(\(Data)h(Access)f(La)m (y)m(er\))0 3172 y(routines)30 b(are)h(la)m(y)m(ered)h(on)e(top)h(of)f (CFITSIO)f(and)h(mak)m(e)h(extensiv)m(e)h(use)e(of)h(these)g(features.) 0 3332 y(Uw)m(e)25 b(Lammers)e(\(XMM/ESA/ESTEC,)h(The)g(Netherlands\))g (designed)g(the)g(high-p)s(erformance)f(lexical)j(pars-)0 3445 y(ing)42 b(algorithm)h(that)f(is)g(used)f(to)i(do)e(on-the-\015y)h (\014ltering)g(of)g(FITS)f(tables.)76 b(This)41 b(algorithm)i(essen)m (tially)0 3558 y(pre-compiles)36 b(the)g(user-supplied)e(selection)k (expression)d(in)m(to)i(a)f(form)g(that)g(can)g(b)s(e)f(rapidly)g(ev)-5 b(aluated)37 b(for)0 3671 y(eac)m(h)31 b(ro)m(w.)40 b(P)m(eter)31 b(Wilson)f(\(RSTX,)f(NASA/GSF)m(C\))i(then)e(wrote)h(the)g(parsing)f (routines)g(used)g(b)m(y)g(CFITSIO)0 3784 y(based)i(on)f(Lammers')h (design,)g(com)m(bined)g(with)g(other)g(tec)m(hniques)g(suc)m(h)g(as)g (the)g(CFITSIO)f(iterator)i(routine)0 3897 y(to)g(further)e(enhance)h (the)h(data)g(pro)s(cessing)f(throughput.)42 b(This)31 b(e\013ort)h(also)g(b)s(ene\014ted)e(from)h(a)h(m)m(uc)m(h)f(earlier)0 4010 y(lexical)25 b(parsing)f(routine)f(that)h(w)m(as)g(dev)m(elop)s (ed)g(b)m(y)g(Ken)m(t)g(Blac)m(kburn)f(\(NASA/GSF)m(C\).)i(More)g (recen)m(tly)-8 b(,)27 b(Craig)0 4123 y(Markw)m(ardt)i(\(NASA/GSF)m (C\))g(implemen)m(ted)g(additional)g(functions)f(\(median,)h(a)m(v)m (erage,)j(stddev\))c(and)g(other)0 4236 y(enhancemen)m(ts)j(to)g(the)g (lexical)h(parser.)0 4396 y(The)40 b(CFITSIO)g(iterator)i(function)e (is)h(lo)s(osely)h(based)f(on)f(similar)i(ideas)f(dev)m(elop)s(ed)g (for)g(the)g(XMM)g(Data)0 4509 y(Access)31 b(La)m(y)m(er.)0 4669 y(P)m(eter)25 b(Wilson)g(\(RSTX,)f(NASA/GSF)m(C\))h(wrote)g(the)f (complete)i(set)e(of)h(F)-8 b(ortran-callable)27 b(wrapp)s(ers)22 b(for)i(all)h(the)0 4782 y(CFITSIO)k(routines,)h(whic)m(h)g(in)g(turn)g (rely)g(on)h(the)f(CF)m(OR)-8 b(TRAN)31 b(macro)g(dev)m(elop)s(ed)g(b)m (y)f(Burkhard)f(Buro)m(w.)0 4942 y(The)h(syn)m(tax)i(used)e(b)m(y)h (CFITSIO)f(for)g(\014ltering)i(or)f(binning)e(input)h(FITS)h(\014les)g (is)g(based)f(on)h(ideas)h(dev)m(elop)s(ed)0 5055 y(for)41 b(the)g(AXAF)h(Science)g(Cen)m(ter)g(Data)h(Mo)s(del)e(b)m(y)g (Jonathan)g(McDo)m(w)m(ell,)47 b(An)m(tonella)c(F)-8 b(ruscione,)45 b(Aneta)0 5168 y(Siemigino)m(wsk)-5 b(a)27 b(and)e(Bill)i(Jo)m(y)m(e.)41 b(See)26 b(h)m (ttp://heasarc.gsfc.nasa.go)m(v/do)s(cs/journal/axa)q(f7.h)m(t)q(ml)32 b(for)25 b(further)0 5281 y(description)30 b(of)h(the)g(AXAF)g(Data)h (Mo)s(del.)0 5441 y(The)j(\014le)g(decompression)g(co)s(de)g(w)m(ere)h (tak)m(en)g(directly)g(from)e(the)i(gzip)f(\(GNU)h(zip\))g(program)f (dev)m(elop)s(ed)g(b)m(y)0 5554 y(Jean-loup)30 b(Gailly)i(and)e (others.)0 5714 y(Doug)h(Mink,)g(SA)m(O,)f(pro)m(vided)g(the)h (routines)f(for)g(con)m(v)m(erting)i(IRAF)f(format)g(images)g(in)m(to)g (FITS)f(format.)p eop end %%Page: 11 17 TeXDict begin 11 16 bop 0 299 a Fg(2.7.)72 b(A)m(CKNO)m(WLEDGMENTS)2577 b Fi(11)0 555 y(Martin)33 b(Reinec)m(k)m(e)i(\(Max)f(Planc)m(k)f (Institute,)h(Garc)m(hing\)\))g(pro)m(vided)f(the)g(mo)s(di\014cations) f(to)i(cfortran.h)e(that)0 668 y(are)d(necessary)h(to)f(supp)s(ort)e (64-bit)k(in)m(teger)f(v)-5 b(alues)29 b(when)f(calling)i(C)f(routines) g(from)f(fortran)h(programs.)39 b(The)0 781 y(cfortran.h)30 b(macros)h(w)m(ere)g(originally)h(dev)m(elop)s(ed)e(b)m(y)h(Burkhard)e (Buro)m(w)h(\(CERN\).)0 941 y(Julian)f(T)-8 b(a)m(ylor)31 b(\(ESO,)e(Garc)m(hing\))i(pro)m(vided)e(the)g(fast)h(b)m(yte-sw)m (apping)g(algorithms)h(that)f(use)f(the)h(SSE2)f(and)0 1054 y(SSSE3)g(mac)m(hine)i(instructions)f(a)m(v)-5 b(ailable)33 b(on)d(x86)p 1784 1054 28 4 v 34 w(64)h(CPUs.)0 1214 y(In)c(addition,)i(man)m(y)f(other)g(p)s(eople)g(ha)m(v)m(e)h(made)f(v) -5 b(aluable)29 b(con)m(tributions)f(to)h(the)f(dev)m(elopmen)m(t)h(of) f(CFITSIO.)0 1327 y(These)i(include)g(\(with)h(ap)s(ologies)h(to)f (others)f(that)h(ma)m(y)g(ha)m(v)m(e)h(inadv)m(erten)m(tly)g(b)s(een)d (omitted\):)0 1487 y(Stev)m(e)g(Allen,)g(Carl)f(Ak)m(erlof,)h(Keith)f (Arnaud,)g(Morten)g(Krabb)s(e)e(Barfo)s(ed,)j(Ken)m(t)f(Blac)m(kburn,)h (G)f(Bo)s(dammer,)0 1600 y(Romk)m(e)h(Bon)m(tek)m(o)s(e,)i(Lucio)d (Chiapp)s(etti,)g(Keith)g(Costorf,)g(Robin)g(Corb)s(et,)g(John)e(Da)m (vis,)k(Ric)m(hard)e(Fink,)h(Ning)0 1713 y(Gan,)g(Emily)e(Greene,)i(Jo) s(e)f(Harrington,)h(Cheng)e(Ho,)i(Phil)e(Ho)s(dge,)i(Jim)f(Ingham,)g(Y) -8 b(oshitak)j(a)29 b(Ishisaki,)f(Diab)0 1826 y(Jerius,)j(Mark)h (Levine,)g(T)-8 b(o)s(dd)30 b(Karak)-5 b(askian,)32 b(Edw)m(ard)f (King,)g(Scott)i(Ko)s(c)m(h,)e(Claire)h(Larkin,)f(Rob)h(Managan,)0 1939 y(Eric)38 b(Mandel,)i(John)d(Matto)m(x,)43 b(Carsten)37 b(Mey)m(er,)42 b(Emi)37 b(Miy)m(ata,)43 b(Stefan)38 b(Mo)s(c)m(hnac)m (ki,)j(Mik)m(e)f(Noble,)g(Oliv)m(er)0 2052 y(Ob)s(erdorf,)c(Cliv)m(e)i (P)m(age,)i(Arvind)35 b(P)m(armar,)j(Je\013)f(P)m(edelt)m(y)-8 b(,)40 b(Tim)c(P)m(earson,)j(Maren)e(Purv)m(es,)h(Scott)f(Randall,)0 2165 y(Chris)d(Rogers,)j(Arnold)e(Rots,)i(Barry)f(Sc)m(hlesinger,)h (Robin)e(Stebbins,)g(Andrew)f(Szymk)m(o)m(wiak,)k(Allyn)e(T)-8 b(en-)0 2278 y(nan)m(t,)31 b(P)m(eter)g(T)-8 b(eub)s(en,)30 b(James)g(Theiler,)h(Doug)g(T)-8 b(o)s(dy)g(,)31 b(Shiro)e(Ueno,)j (Stev)m(e)f(W)-8 b(alton,)33 b(Arc)m(hie)e(W)-8 b(arno)s(c)m(k,)32 b(Alan)0 2391 y(W)-8 b(atson,)32 b(Dan)f(Whipple,)f(Wim)h(Wimmers,)g(P) m(eter)g(Y)-8 b(oung,)31 b(Jianjun)e(Xu,)h(and)g(Nelson)h(Zarate.)p eop end %%Page: 12 18 TeXDict begin 12 17 bop 0 299 a Fi(12)1851 b Fg(CHAPTER)30 b(2.)111 b(CREA)-8 b(TING)31 b(FITSIO/CFITSIO)p eop end %%Page: 13 19 TeXDict begin 13 18 bop 0 1225 a Ff(Chapter)65 b(3)0 1687 y Fl(A)78 b(FITS)f(Primer)0 2180 y Fi(This)23 b(section)j(giv)m (es)f(a)g(brief)e(o)m(v)m(erview)j(of)e(the)h(structure)e(of)i(FITS)e (\014les.)38 b(Users)24 b(should)g(refer)f(to)i(the)g(do)s(cumen-)0 2293 y(tation)33 b(a)m(v)-5 b(ailable)33 b(from)e(the)g(FITS)g(Supp)s (ort)e(O\016ce,)j(as)f(describ)s(ed)f(in)h(the)h(in)m(tro)s(duction,)f (for)g(more)h(detailed)0 2406 y(information)f(on)f(FITS)g(formats.)0 2566 y(FITS)37 b(w)m(as)g(\014rst)g(dev)m(elop)s(ed)h(in)f(the)g(late)i (1970's)g(as)f(a)f(standard)g(data)h(in)m(terc)m(hange)h(format)f(b)s (et)m(w)m(een)g(v)-5 b(ar-)0 2679 y(ious)38 b(astronomical)h(observ)-5 b(atories.)64 b(Since)37 b(then)g(FITS)g(has)h(b)s(ecome)g(the)g (defacto)g(standard)f(data)i(format)0 2791 y(supp)s(orted)29 b(b)m(y)h(most)h(astronomical)h(data)f(analysis)g(soft)m(w)m(are)g(pac) m(k)-5 b(ages.)0 2952 y(A)34 b(FITS)f(\014le)g(consists)h(of)g(one)g (or)g(more)g(Header)g(+)f(Data)i(Units)f(\(HDUs\),)i(where)d(the)h (\014rst)f(HDU)h(is)g(called)0 3065 y(the)j(`Primary)f(HDU',)i(or)f (`Primary)f(Arra)m(y'.)60 b(The)36 b(primary)g(arra)m(y)h(con)m(tains)h (an)e(N-dimensional)i(arra)m(y)f(of)0 3177 y(pixels,)32 b(suc)m(h)g(as)f(a)h(1-D)h(sp)s(ectrum,)e(a)h(2-D)h(image,)g(or)f(a)g (3-D)g(data)h(cub)s(e.)43 b(Six)31 b(di\013eren)m(t)h(primary)f(datat)m (yp)s(es)0 3290 y(are)g(supp)s(orted:)39 b(Unsigned)30 b(8-bit)h(b)m(ytes,)g(16,)g(32,)h(and)e(64-bit)h(signed)g(in)m(tegers,) h(and)d(32)j(and)d(64-bit)j(\015oating)0 3403 y(p)s(oin)m(t)d(reals.)41 b(FITS)29 b(also)i(has)e(a)h(con)m(v)m(en)m(tion)h(for)e(storing)h (unsigned)f(in)m(tegers)h(\(see)h(the)e(later)i(section)f(en)m(titled)0 3516 y(`Unsigned)h(In)m(tegers')h(for)f(more)g(details\).)43 b(The)31 b(primary)f(HDU)i(ma)m(y)f(also)h(consist)g(of)f(only)g(a)g (header)g(with)g(a)0 3629 y(n)m(ull)f(arra)m(y)h(con)m(taining)h(no)e (data)h(pixels.)0 3789 y(An)m(y)i(n)m(um)m(b)s(er)e(of)h(additional)i (HDUs)f(ma)m(y)g(follo)m(w)h(the)e(primary)g(arra)m(y;)i(these)f (additional)h(HDUs)f(are)g(called)0 3902 y(FITS)d(`extensions'.)41 b(There)30 b(are)h(curren)m(tly)f(3)h(t)m(yp)s(es)g(of)f(extensions)h (de\014ned)e(b)m(y)h(the)h(FITS)f(standard:)136 4171 y Fc(\017)46 b Fi(Image)31 b(Extension)g(-)g(a)f(N-dimensional)h(arra)m (y)g(of)g(pixels,)g(lik)m(e)g(in)f(a)h(primary)e(arra)m(y)136 4368 y Fc(\017)46 b Fi(ASCI)s(I)29 b(T)-8 b(able)31 b(Extension)g(-)f (ro)m(ws)h(and)e(columns)h(of)h(data)g(in)f(ASCI)s(I)f(c)m(haracter)j (format)136 4564 y Fc(\017)46 b Fi(Binary)31 b(T)-8 b(able)31 b(Extension)f(-)h(ro)m(ws)f(and)g(columns)g(of)h(data)g(in)f(binary)f (represen)m(tation)0 4833 y(In)k(eac)m(h)i(case)g(the)f(HDU)h(consists) g(of)f(an)g(ASCI)s(I)e(Header)i(Unit)h(follo)m(w)m(ed)g(b)m(y)f(an)g (optional)h(Data)g(Unit.)52 b(F)-8 b(or)0 4946 y(historical)37 b(reasons,)g(eac)m(h)f(Header)g(or)g(Data)h(unit)e(m)m(ust)g(b)s(e)g (an)g(exact)i(m)m(ultiple)f(of)g(2880)h(8-bit)f(b)m(ytes)g(long.)0 5059 y(An)m(y)30 b(un)m(used)g(space)g(is)h(padded)e(with)h(\014ll)g(c) m(haracters)i(\(ASCI)s(I)d(blanks)h(or)h(zeros\).)0 5219 y(Eac)m(h)i(Header)f(Unit)h(consists)g(of)f(an)m(y)g(n)m(um)m(b)s(er)f (of)i(80-c)m(haracter)i(k)m(eyw)m(ord)d(records)g(or)g(`card)h(images') g(whic)m(h)0 5332 y(ha)m(v)m(e)f(the)e(general)i(form:)95 5601 y Fe(KEYNAME)46 b(=)i(value)e(/)i(comment)d(string)95 5714 y(NULLKEY)h(=)334 b(/)48 b(comment:)d(This)i(keyword)f(has)g(no)i (value)1905 5942 y Fi(13)p eop end %%Page: 14 20 TeXDict begin 14 19 bop 0 299 a Fi(14)2398 b Fg(CHAPTER)30 b(3.)112 b(A)30 b(FITS)g(PRIMER)0 555 y Fi(The)35 b(k)m(eyw)m(ord)i (names)f(ma)m(y)g(b)s(e)g(up)f(to)h(8)h(c)m(haracters)g(long)g(and)e (can)h(only)h(con)m(tain)g(upp)s(ercase)e(letters,)k(the)0 668 y(digits)25 b(0-9,)i(the)e(h)m(yphen,)g(and)f(the)h(underscore)e(c) m(haracter.)41 b(The)24 b(k)m(eyw)m(ord)h(name)g(is)f(\(usually\))h (follo)m(w)m(ed)i(b)m(y)d(an)0 781 y(equals)29 b(sign)g(and)f(a)g (space)i(c)m(haracter)g(\(=)e(\))h(in)f(columns)h(9)g(-)f(10)i(of)f (the)f(record,)h(follo)m(w)m(ed)i(b)m(y)d(the)h(v)-5 b(alue)29 b(of)g(the)0 894 y(k)m(eyw)m(ord)34 b(whic)m(h)g(ma)m(y)g(b)s (e)f(either)h(an)g(in)m(teger,)i(a)e(\015oating)g(p)s(oin)m(t)g(n)m(um) m(b)s(er,)g(a)g(c)m(haracter)h(string)e(\(enclosed)i(in)0 1007 y(single)28 b(quotes\),)i(or)e(a)g(b)s(o)s(olean)g(v)-5 b(alue)28 b(\(the)g(letter)h(T)f(or)f(F\).)i(A)f(k)m(eyw)m(ord)g(ma)m (y)h(also)f(ha)m(v)m(e)h(a)g(n)m(ull)e(or)h(unde\014ned)0 1120 y(v)-5 b(alue)31 b(if)f(there)h(is)f(no)g(sp)s(eci\014ed)g(v)-5 b(alue)31 b(string,)g(as)f(in)g(the)h(second)f(example.)0 1280 y(The)c(last)h(k)m(eyw)m(ord)g(in)g(the)f(header)h(is)f(alw)m(a)m (ys)i(the)f(`END')g(k)m(eyw)m(ord)g(whic)m(h)g(has)f(no)g(v)-5 b(alue)27 b(or)g(commen)m(t)g(\014elds.)0 1393 y(There)k(are)g(man)m(y) g(rules)g(go)m(v)m(erning)h(the)g(exact)g(format)g(of)f(a)g(k)m(eyw)m (ord)h(record)f(\(see)h(the)f(FITS)f(Standard\))h(so)0 1506 y(it)c(is)g(b)s(etter)g(to)h(rely)f(on)g(standard)f(in)m(terface)j (soft)m(w)m(are)f(lik)m(e)g(FITSIO)e(to)i(correctly)g(construct)f(or)g (to)h(parse)f(the)0 1619 y(k)m(eyw)m(ord)k(records)f(rather)g(than)g (try)h(to)g(deal)g(directly)g(with)f(the)g(ra)m(w)h(FITS)e(formats.)0 1779 y(Eac)m(h)37 b(Header)g(Unit)f(b)s(egins)g(with)g(a)g(series)h(of) f(required)g(k)m(eyw)m(ords)g(whic)m(h)g(dep)s(end)f(on)h(the)g(t)m(yp) s(e)h(of)f(HDU.)0 1892 y(These)31 b(required)g(k)m(eyw)m(ords)h(sp)s (ecify)g(the)f(size)i(and)e(format)h(of)g(the)g(follo)m(wing)h(Data)g (Unit.)45 b(The)31 b(header)g(ma)m(y)0 2005 y(con)m(tain)h(other)f (optional)g(k)m(eyw)m(ords)g(to)h(describ)s(e)e(other)g(asp)s(ects)h (of)g(the)g(data,)g(suc)m(h)g(as)g(the)f(units)g(or)h(scaling)0 2118 y(v)-5 b(alues.)44 b(Other)31 b(COMMENT)g(or)g(HISTOR)-8 b(Y)30 b(k)m(eyw)m(ords)i(are)g(also)g(frequen)m(tly)g(added)e(to)i (further)e(do)s(cumen)m(t)0 2230 y(the)h(data)g(\014le.)0 2391 y(The)36 b(optional)h(Data)h(Unit)f(immediately)g(follo)m(ws)h (the)e(last)h(2880-b)m(yte)i(blo)s(c)m(k)e(in)f(the)g(Header)h(Unit.)59 b(Some)0 2503 y(HDUs)31 b(do)f(not)h(ha)m(v)m(e)g(a)g(Data)h(Unit)f (and)f(only)g(consist)h(of)g(the)f(Header)h(Unit.)0 2664 y(If)24 b(there)i(is)f(more)g(than)f(one)h(HDU)h(in)f(the)g(FITS)f (\014le,)i(then)f(the)g(Header)h(Unit)f(of)g(the)g(next)g(HDU)h (immediately)0 2777 y(follo)m(ws)g(the)e(last)i(2880-b)m(yte)h(blo)s(c) m(k)e(of)g(the)f(previous)g(Data)j(Unit)d(\(or)h(Header)g(Unit)g(if)f (there)h(is)g(no)f(Data)i(Unit\).)0 2937 y(The)k(main)g(required)g(k)m (eyw)m(ords)g(in)g(FITS)g(primary)g(arra)m(ys)g(or)h(image)g (extensions)g(are:)136 3172 y Fc(\017)46 b Fi(BITPIX)33 b({)h(de\014nes)e(the)i(datat)m(yp)s(e)g(of)f(the)g(arra)m(y:)47 b(8,)35 b(16,)g(32,)g(64,)g(-32,)g(-64)g(for)e(unsigned)f(8{bit)i(b)m (yte,)227 3284 y(16{bit)27 b(signed)e(in)m(teger,)i(32{bit)g(signed)e (in)m(teger,)j(64{bit)e(signed)f(in)m(teger,)j(32{bit)e(IEEE)f (\015oating)h(p)s(oin)m(t,)227 3397 y(and)k(64{bit)i(IEEE)e(double)f (precision)i(\015oating)g(p)s(oin)m(t,)g(resp)s(ectiv)m(ely)-8 b(.)136 3585 y Fc(\017)46 b Fi(NAXIS)30 b({)h(the)g(n)m(um)m(b)s(er)e (of)h(dimensions)g(in)g(the)h(arra)m(y)-8 b(,)31 b(usually)f(0,)h(1,)g (2,)g(3,)g(or)g(4.)136 3773 y Fc(\017)46 b Fi(NAXISn)30 b({)h(\(n)f(ranges)g(from)g(1)h(to)g(NAXIS\))g(de\014nes)e(the)i(size)g (of)g(eac)m(h)g(dimension.)0 4008 y(FITS)e(tables)i(start)g(with)f(the) g(k)m(eyw)m(ord)g(XTENSION)g(=)f(`T)-8 b(ABLE')31 b(\(for)f(ASCI)s(I)f (tables\))i(or)f(XTENSION)f(=)0 4120 y(`BINT)-8 b(ABLE')32 b(\(for)e(binary)g(tables\))h(and)f(ha)m(v)m(e)i(the)e(follo)m(wing)i (main)e(k)m(eyw)m(ords:)136 4355 y Fc(\017)46 b Fi(TFIELDS)30 b({)h(n)m(um)m(b)s(er)e(of)h(\014elds)g(or)h(columns)f(in)g(the)g (table)136 4543 y Fc(\017)46 b Fi(NAXIS2)31 b({)g(n)m(um)m(b)s(er)e(of) h(ro)m(ws)h(in)f(the)g(table)136 4731 y Fc(\017)46 b Fi(TTYPEn)29 b({)i(for)f(eac)m(h)i(column)e(\(n)g(ranges)h(from)f(1)g (to)h(TFIELDS\))g(giv)m(es)g(the)g(name)f(of)h(the)f(column)136 4918 y Fc(\017)46 b Fi(TF)m(ORMn)31 b({)f(the)h(datat)m(yp)s(e)g(of)g (the)f(column)136 5106 y Fc(\017)46 b Fi(TUNITn)30 b({)g(the)h(ph)m (ysical)g(units)f(of)g(the)h(column)f(\(optional\))0 5341 y(Users)k(should)f(refer)h(to)h(the)f(FITS)g(Supp)s(ort)e(O\016ce) i(at)h Fe(http://fits.gsfc.nasa.gov)27 b Fi(for)34 b(further)f(infor-)0 5454 y(mation)e(ab)s(out)f(the)h(FITS)e(format)i(and)f(related)h(soft)m (w)m(are)h(pac)m(k)-5 b(ages.)p eop end %%Page: 15 21 TeXDict begin 15 20 bop 0 1225 a Ff(Chapter)65 b(4)0 1687 y Fl(FITSIO)76 b(Con)-6 b(v)g(en)g(tions)76 b(and)h(Guidelines)0 2216 y Fd(4.1)135 b(CFITSIO)44 b(Size)h(Limitations)0 2524 y Fi(CFITSIO)31 b(places)i(few)g(restrictions)g(on)g(the)f(size)i (of)e(FITS)g(\014les)h(that)g(it)g(reads)f(or)h(writes.)47 b(There)32 b(are)h(a)g(few)0 2636 y(limits,)e(ho)m(w)m(ev)m(er,)h(whic) m(h)e(ma)m(y)h(a\013ect)h(some)f(extreme)g(cases:)0 2797 y(1.)43 b(The)31 b(maxim)m(um)g(n)m(um)m(b)s(er)f(of)h(FITS)f(\014les)h (that)h(ma)m(y)g(b)s(e)e(sim)m(ultaneously)i(op)s(ened)f(b)m(y)g (CFITSIO)e(is)i(set)h(b)m(y)0 2910 y(NMAXFILES,)e(as)f(de\014ned)f(in)h (\014tsio2.h.)41 b(The)29 b(curren)m(t)g(default)g(v)-5 b(alue)30 b(is)f(1000,)j(but)c(this)h(ma)m(y)h(b)s(e)f(increased)0 3022 y(if)40 b(necessary)-8 b(.)72 b(Note)42 b(that)f(CFITSIO)e(allo)s (cates)j(NIOBUF)f(*)g(2880)h(b)m(ytes)f(of)g(I/O)f(bu\013er)g(space)h (for)f(eac)m(h)0 3135 y(\014le)d(that)h(is)f(op)s(ened.)61 b(The)37 b(default)g(v)-5 b(alue)38 b(of)f(NIOBUF)h(is)f(40)h (\(de\014ned)f(in)f(\014tsio.h\),)k(so)e(this)f(amoun)m(ts)g(to)0 3248 y(more)31 b(than)g(115K)i(of)e(memory)g(for)g(eac)m(h)i(op)s(ened) d(\014le)i(\(or)f(115)i(MB)f(for)f(1000)i(op)s(ened)d(\014les\).)44 b(Note)33 b(that)f(the)0 3361 y(underlying)k(op)s(erating)i(system,)h (ma)m(y)e(ha)m(v)m(e)i(a)e(lo)m(w)m(er)i(limit)f(on)f(the)g(n)m(um)m(b) s(er)f(of)h(\014les)g(that)h(can)f(b)s(e)g(op)s(ened)0 3474 y(sim)m(ultaneously)-8 b(.)0 3634 y(2.)54 b(By)35 b(default,)h(CFITSIO)d(can)i(handle)g(FITS)f(\014les)g(up)g(to)h(2.1)h (GB)g(in)e(size)i(\(2**31)h(b)m(ytes\).)54 b(This)34 b(\014le)h(size)0 3747 y(limit)41 b(is)g(often)f(imp)s(osed)g(b)m(y)g (32-bit)i(op)s(erating)e(systems.)71 b(More)41 b(recen)m(tly)-8 b(,)45 b(as)c(64-bit)g(op)s(erating)g(systems)0 3860 y(b)s(ecome)33 b(more)g(common,)g(an)g(industry-wide)e(standard)h(\(at) i(least)f(on)g(Unix)f(systems\))h(has)g(b)s(een)f(dev)m(elop)s(ed)0 3973 y(to)39 b(supp)s(ort)d(larger)i(sized)h(\014les)f(\(see)g(h)m (ttp://ftp.sas.com/standards/large.\014le/\).)69 b(Starting)38 b(with)f(v)m(ersion)0 4086 y(2.1)45 b(of)e(CFITSIO,)f(larger)i(FITS)f (\014les)g(up)g(to)h(6)g(terab)m(ytes)h(in)e(size)h(ma)m(y)g(b)s(e)f (read)g(and)g(written)h(on)f(sup-)0 4199 y(p)s(orted)f(platforms.)76 b(In)42 b(order)g(to)h(supp)s(ort)e(these)h(larger)h(\014les,)j (CFITSIO)41 b(m)m(ust)h(b)s(e)g(compiled)h(with)f(the)0 4312 y('-D)p 129 4312 28 4 v 34 w(LAR)m(GEFILE)p 696 4312 V 33 w(SOUR)m(CE')g(and)g(`-D)p 1491 4312 V 34 w(FILE)p 1736 4312 V 33 w(OFFSET)p 2137 4312 V 32 w(BITS=64')h(compiler)g (\015ags.)78 b(Some)43 b(platforms)0 4425 y(ma)m(y)c(also)g(require)f (the)g(`-D)p 1002 4425 V 34 w(LAR)m(GE)p 1358 4425 V 33 w(FILES')g(compiler)h(\015ag.)64 b(This)38 b(causes)g(the)h (compiler)g(to)g(allo)s(cate)h(8-)0 4538 y(b)m(ytes)k(instead)g(of)g (4-b)m(ytes)h(for)f(the)g(`o\013)p 1473 4538 V 33 w(t')g(datat)m(yp)s (e)h(whic)m(h)f(is)f(used)g(to)i(store)f(\014le)g(o\013set)h(p)s (ositions.)81 b(It)0 4650 y(app)s(ears)31 b(that)i(in)e(most)i(cases)g (it)f(is)g(not)g(necessary)h(to)f(also)h(include)f(these)g(compiler)h (\015ags)f(when)f(compiling)0 4763 y(programs)f(that)h(link)f(to)h(the) g(CFITSIO)e(library)-8 b(.)0 4924 y(If)21 b(CFITSIO)e(is)i(compiled)h (with)f(the)g(-D)p 1386 4924 V 33 w(LAR)m(GEFILE)p 1952 4924 V 34 w(SOUR)m(CE)f(and)g(-D)p 2654 4924 V 34 w(FILE)p 2899 4924 V 33 w(OFFSET)p 3300 4924 V 32 w(BITS=64)h(\015ags)0 5036 y(on)36 b(a)g(platform)g(that)g(supp)s(orts)e(large)j(\014les,)h (then)d(it)i(can)f(read)g(and)f(write)h(FITS)f(\014les)h(that)g(con)m (tain)h(up)e(to)0 5149 y(2**31)k(2880-b)m(yte)g(FITS)d(records,)j(or)d (appro)m(ximately)i(6)f(terab)m(ytes)h(in)f(size.)60 b(It)37 b(is)g(still)h(required)d(that)j(the)0 5262 y(v)-5 b(alue)30 b(of)f(the)g(NAXISn)f(and)h(PCOUNT)f(k)m(eyw)m(ords)h(in)g (eac)m(h)h(extension)g(b)s(e)e(within)h(the)g(range)h(of)f(a)g(signed)g (4-)0 5375 y(b)m(yte)c(in)m(teger)h(\(max)f(v)-5 b(alue)26 b(=)e(2,147,483,648\).)44 b(Th)m(us,)25 b(eac)m(h)h(dimension)e(of)h (an)f(image)i(\(giv)m(en)g(b)m(y)f(the)g(NAXISn)0 5488 y(k)m(eyw)m(ords\),)32 b(the)f(total)i(width)d(of)h(a)g(table)h (\(NAXIS1)g(k)m(eyw)m(ord\),)g(the)f(n)m(um)m(b)s(er)f(of)h(ro)m(ws)g (in)f(a)h(table)h(\(NAXIS2)0 5601 y(k)m(eyw)m(ord\),)c(and)d(the)h (total)i(size)f(of)f(the)g(v)-5 b(ariable-length)28 b(arra)m(y)e(heap)g (in)g(binary)f(tables)i(\(PCOUNT)e(k)m(eyw)m(ord\))0 5714 y(m)m(ust)30 b(b)s(e)g(less)h(than)f(this)g(limit.)1905 5942 y(15)p eop end %%Page: 16 22 TeXDict begin 16 21 bop 0 299 a Fi(16)1277 b Fg(CHAPTER)29 b(4.)72 b(FITSIO)29 b(CONVENTIONS)g(AND)i(GUIDELINES)0 555 y Fi(Curren)m(tly)-8 b(,)31 b(supp)s(ort)e(for)i(large)h(\014les)f (within)f(CFITSIO)f(has)i(b)s(een)f(tested)i(on)f(the)g(Lin)m(ux,)g (Solaris,)g(and)f(IBM)0 668 y(AIX)g(op)s(erating)h(systems.)0 1133 y Fd(4.2)135 b(Multiple)46 b(Access)e(to)i(the)f(Same)g(FITS)f (File)0 1409 y Fi(CFITSIO)35 b(supp)s(orts)g(sim)m(ultaneous)i(read)f (and)g(write)h(access)g(to)h(m)m(ultiple)f(HDUs)g(in)f(the)h(same)g (FITS)f(\014le.)0 1522 y(Th)m(us,)43 b(one)e(can)h(op)s(en)e(the)h (same)h(FITS)e(\014le)h(t)m(wice)i(within)d(a)i(single)f(program)g(and) g(mo)m(v)m(e)h(to)g(2)f(di\013eren)m(t)0 1635 y(HDUs)30 b(in)f(the)h(\014le,)g(and)f(then)g(read)h(and)e(write)i(data)g(or)g(k) m(eyw)m(ords)g(to)g(the)g(2)f(extensions)i(just)d(as)i(if)g(one)f(w)m (ere)0 1748 y(accessing)f(2)f(completely)h(separate)f(FITS)f(\014les.) 39 b(Since)27 b(in)f(general)h(it)g(is)g(not)g(p)s(ossible)f(to)h(ph)m (ysically)g(op)s(en)f(the)0 1861 y(same)36 b(\014le)g(t)m(wice)h(and)e (then)g(exp)s(ect)h(to)g(b)s(e)f(able)h(to)h(sim)m(ultaneously)f(\(or)g (in)f(alternating)i(succession\))g(write)0 1974 y(to)e(2)f(di\013eren)m (t)h(lo)s(cations)h(in)d(the)i(\014le,)g(CFITSIO)e(recognizes)j(when)d (the)h(\014le)g(to)h(b)s(e)f(op)s(ened)f(\(in)h(the)h(call)g(to)0 2087 y(\014ts)p 127 2087 28 4 v 32 w(op)s(en)p 349 2087 V 33 w(\014le\))29 b(has)f(already)h(b)s(een)f(op)s(ened)g(and)g (instead)h(of)g(actually)h(op)s(ening)e(the)h(\014le)g(again,)h(just)e (logically)0 2199 y(links)i(the)h(new)f(\014le)h(to)g(the)g(old)f (\014le.)42 b(\(This)30 b(only)h(applies)f(if)h(the)g(\014le)f(is)h(op) s(ened)f(more)g(than)g(once)i(within)e(the)0 2312 y(same)e(program,)g (and)f(do)s(es)h(not)f(prev)m(en)m(t)i(the)f(same)g(\014le)f(from)g(b)s (eing)h(sim)m(ultaneously)g(op)s(ened)f(b)m(y)g(more)h(than)0 2425 y(one)h(program\).)40 b(Then)28 b(b)s(efore)g(CFITSIO)f(reads)h (or)h(writes)g(to)g(either)g(\(logical\))j(\014le,)d(it)g(mak)m(es)h (sure)d(that)j(an)m(y)0 2538 y(mo)s(di\014cations)i(made)f(to)h(the)g (other)g(\014le)f(ha)m(v)m(e)i(b)s(een)e(completely)i(\015ushed)c(from) i(the)h(in)m(ternal)g(bu\013ers)f(to)h(the)0 2651 y(\014le.)44 b(Th)m(us,)30 b(in)h(principle,)h(one)f(could)g(op)s(en)g(a)h(\014le)f (t)m(wice,)i(in)e(one)h(case)g(p)s(oin)m(ting)g(to)g(the)f(\014rst)g (extension)h(and)0 2764 y(in)i(the)h(other)g(p)s(oin)m(ting)f(to)i(the) e(2nd)g(extension)i(and)d(then)i(write)f(data)i(to)f(b)s(oth)f (extensions,)i(in)e(an)m(y)h(order,)0 2877 y(without)25 b(danger)h(of)f(corrupting)h(the)f(\014le,)i(There)e(ma)m(y)h(b)s(e)f (some)h(e\016ciency)g(p)s(enalties)g(in)f(doing)h(this)f(ho)m(w)m(ev)m (er,)0 2990 y(since)j(CFITSIO)f(has)h(to)h(\015ush)d(all)j(the)f(in)m (ternal)h(bu\013ers)e(related)i(to)g(one)f(\014le)g(b)s(efore)g(switc)m (hing)g(to)h(the)f(other,)0 3103 y(so)i(it)h(w)m(ould)f(still)h(b)s(e)f (pruden)m(t)f(to)i(minimize)g(the)f(n)m(um)m(b)s(er)f(of)i(times)f(one) h(switc)m(hes)g(bac)m(k)g(and)e(forth)h(b)s(et)m(w)m(een)0 3216 y(doing)g(I/O)h(to)g(di\013eren)m(t)g(HDUs)g(in)f(the)g(same)h (\014le.)0 3680 y Fd(4.3)135 b(Curren)l(t)46 b(Header)f(Data)h(Unit)g (\(CHDU\))0 3957 y Fi(In)32 b(general,)j(a)f(FITS)e(\014le)i(can)f(con) m(tain)h(m)m(ultiple)g(Header)g(Data)h(Units,)f(also)g(called)g (extensions.)49 b(CFITSIO)0 4070 y(only)38 b(op)s(erates)h(within)f (one)g(HDU)h(at)g(an)m(y)g(giv)m(en)g(time,)i(and)d(the)g(curren)m(tly) g(selected)i(HDU)f(is)f(called)i(the)0 4183 y(Curren)m(t)f(Header)h (Data)h(Unit)f(\(CHDU\).)h(When)f(a)g(FITS)f(\014le)h(is)f(\014rst)g (created)i(or)f(op)s(ened)f(the)h(CHDU)g(is)0 4295 y(automatically)28 b(de\014ned)23 b(to)j(b)s(e)e(the)h(\014rst)f(HDU)i(\(i.e.,)h(the)e (primary)f(arra)m(y\).)40 b(CFITSIO)23 b(routines)i(are)g(pro)m(vided)0 4408 y(to)36 b(mo)m(v)m(e)h(to)g(and)e(op)s(en)g(an)m(y)h(other)g (existing)g(HDU)h(within)e(the)h(FITS)f(\014le)g(or)h(to)g(app)s(end)e (or)i(insert)f(a)h(new)0 4521 y(HDU)31 b(in)f(the)h(FITS)e(\014le)i (whic)m(h)f(then)g(b)s(ecomes)h(the)f(CHDU.)0 4986 y Fd(4.4)135 b(Subroutine)45 b(Names)0 5262 y Fi(All)26 b(FITSIO)f(subroutine)g(names)h(b)s(egin)f(with)h(the)g(letters)h('ft') f(to)h(distinguish)e(them)h(from)f(other)h(subroutines)0 5375 y(and)34 b(are)h(5)g(or)f(6)h(c)m(haracters)h(long.)54 b(Users)34 b(should)g(not)g(name)h(their)g(o)m(wn)f(subroutines)f(b)s (eginning)h(with)g('ft')0 5488 y(to)e(a)m(v)m(oid)i(con\015icts.)45 b(\(The)32 b(SPP)f(in)m(terface)i(routines)e(all)i(b)s(egin)e(with)h ('fs'\).)45 b(Subroutines)30 b(whic)m(h)h(read)h(or)g(get)0 5601 y(information)e(from)g(the)h(FITS)e(\014le)h(ha)m(v)m(e)i(names)e (b)s(eginning)f(with)h('ftg...'.)43 b(Subroutines)28 b(whic)m(h)i(write)g(or)h(put)0 5714 y(information)g(in)m(to)g(the)g (FITS)e(\014le)i(ha)m(v)m(e)g(names)g(b)s(eginning)e(with)h('ftp...'.)p eop end %%Page: 17 23 TeXDict begin 17 22 bop 0 299 a Fg(4.5.)72 b(SUBR)m(OUTINE)30 b(F)-10 b(AMILIES)30 b(AND)h(D)m(A)-8 b(T)g(A)g(TYPES)1697 b Fi(17)0 555 y Fd(4.5)135 b(Subroutine)45 b(F)-11 b(amilies)46 b(and)f(Datat)l(yp)t(es)0 805 y Fi(Man)m(y)h(of)g(the)g(subroutines)e (come)j(in)e(families)h(whic)m(h)g(di\013er)f(only)h(in)f(the)h(datat)m (yp)s(e)g(of)g(the)f(asso)s(ciated)0 918 y(parameter\(s\))34 b(.)47 b(The)32 b(datat)m(yp)s(e)i(of)f(these)g(subroutines)e(is)i (indicated)g(b)m(y)g(the)g(last)g(letter)h(of)f(the)g(subroutine)0 1031 y(name)d(\(e.g.,)j('j')d(in)g('ftpkyj'\))h(as)f(follo)m(ws:)382 1284 y Fe(x)47 b(-)h(bit)382 1397 y(b)f(-)h(character*1)c(\(unsigned)i (byte\))382 1510 y(i)h(-)h(short)e(integer)g(\(I*2\))382 1623 y(j)h(-)h(integer)e(\(I*4,)g(32-bit)g(integer\))382 1735 y(k)h(-)h(long)e(long)h(integer)f(\(I*8,)g(64-bit)g(integer\))382 1848 y(e)h(-)h(real)e(exponential)f(floating)h(point)g(\(R*4\))382 1961 y(f)h(-)h(real)e(fixed-format)f(floating)g(point)i(\(R*4\))382 2074 y(d)g(-)h(double)e(precision)f(real)i(floating-point)d(\(R*8\))382 2187 y(g)j(-)h(double)e(precision)f(fixed-format)g(floating)g(point)h (\(R*8\))382 2300 y(c)h(-)h(complex)e(reals)g(\(pairs)g(of)h(R*4)g (values\))382 2413 y(m)g(-)h(double)e(precision)f(complex)h(\(pairs)g (of)h(R*8)g(values\))382 2526 y(l)g(-)h(logical)e(\(L*4\))382 2639 y(s)h(-)h(character)d(string)0 2891 y Fi(When)23 b(dealing)h(with)f(the)g(FITS)g(b)m(yte)g(datat)m(yp)s(e,)j(it)e(is)f (imp)s(ortan)m(t)h(to)f(remem)m(b)s(er)g(that)h(the)f(ra)m(w)g(v)-5 b(alues)24 b(\(b)s(efore)0 3004 y(an)m(y)h(scaling)g(b)m(y)f(the)h (BSCALE)e(and)h(BZER)m(O,)g(or)h(TSCALn)d(and)i(TZER)m(On)f(k)m(eyw)m (ord)i(v)-5 b(alues\))25 b(in)f(b)m(yte)h(arra)m(ys)0 3117 y(\(BITPIX)37 b(=)f(8\))h(or)f(b)m(yte)i(columns)e(\(TF)m(ORMn)h (=)f('B'\))h(are)g(in)m(terpreted)g(as)g(unsigned)e(b)m(ytes)i(with)g (v)-5 b(alues)0 3230 y(ranging)40 b(from)f(0)i(to)f(255.)71 b(Some)40 b(F)-8 b(ortran)40 b(compilers)h(supp)s(ort)d(a)i (non-standard)f(b)m(yte)h(datat)m(yp)s(e)h(suc)m(h)f(as)0 3343 y(INTEGER*1,)34 b(LOGICAL*1,)g(or)f(BYTE,)g(whic)m(h)f(can)h (sometimes)h(b)s(e)e(used)g(instead)h(of)g(CHARA)m(CTER*1)0 3456 y(v)-5 b(ariables.)39 b(Man)m(y)23 b(mac)m(hines)g(p)s(ermit)g (passing)f(a)h(n)m(umeric)g(datat)m(yp)s(e)g(\(suc)m(h)g(as)g (INTEGER*1\))h(to)f(the)g(FITSIO)0 3569 y(subroutines)41 b(whic)m(h)i(are)g(exp)s(ecting)g(a)g(CHARA)m(CTER*1)h(datat)m(yp)s(e,) j(but)42 b(this)g(tec)m(hnically)j(violates)g(the)0 3682 y(F)-8 b(ortran-77)29 b(standard)d(and)g(is)h(not)g(supp)s(orted)e(on)i (all)h(mac)m(hines)f(\(e.g.,)j(on)c(a)i(V)-10 b(AX/VMS)27 b(mac)m(hine)h(one)f(m)m(ust)0 3795 y(use)j(the)h(V)-10 b(AX-sp)s(eci\014c)31 b(\045DESCR)e(function\).)0 3955 y(One)22 b(feature)h(of)g(the)g(CFITSIO)e(routines)i(is)f(that)i(they)f (can)g(op)s(erate)g(on)f(a)h(`X')h(\(bit\))f(column)g(in)f(a)h(binary)f (table)0 4068 y(as)35 b(though)e(it)i(w)m(ere)g(a)g(`B')g(\(b)m(yte\))g (column.)53 b(F)-8 b(or)35 b(example)g(a)f(`11X')i(datat)m(yp)s(e)f (column)f(can)h(b)s(e)f(in)m(terpreted)0 4181 y(the)28 b(same)h(as)f(a)g(`2B')i(column)e(\(i.e.,)i(2)e(unsigned)f(8-bit)i(b)m (ytes\).)41 b(In)27 b(some)i(instances,)g(it)f(can)h(b)s(e)e(more)h (e\016cien)m(t)0 4294 y(to)j(read)f(and)g(write)h(whole)f(b)m(ytes)h (at)g(a)g(time,)g(rather)g(than)f(reading)g(or)h(writing)f(eac)m(h)i (individual)d(bit.)0 4454 y(The)41 b(double)h(precision)g(complex)g (datat)m(yp)s(e)h(is)f(not)g(a)g(standard)f(F)-8 b(ortran-77)43 b(datat)m(yp)s(e.)76 b(If)41 b(a)i(particular)0 4567 y(F)-8 b(ortran)35 b(compiler)g(do)s(es)f(not)h(directly)g(supp)s(ort)e (this)i(datat)m(yp)s(e,)h(then)f(one)f(ma)m(y)h(instead)g(pass)f(an)h (arra)m(y)g(of)0 4680 y(pairs)d(of)h(double)f(precision)h(v)-5 b(alues)32 b(to)i(these)f(subroutines.)45 b(The)33 b(\014rst)e(v)-5 b(alue)33 b(in)f(eac)m(h)i(pair)e(is)h(the)g(real)g(part,)0 4792 y(and)d(the)g(second)h(is)f(the)h(imaginary)g(part.)0 5125 y Fd(4.6)135 b(Implicit)46 b(Data)g(T)l(yp)t(e)f(Con)l(v)l(ersion) 0 5375 y Fi(The)22 b(FITSIO)g(routines)h(that)h(read)e(and)h(write)g(n) m(umerical)g(data)h(can)f(p)s(erform)f(implicit)i(data)f(t)m(yp)s(e)g (con)m(v)m(ersion.)0 5488 y(This)i(means)g(that)h(the)g(data)g(t)m(yp)s (e)g(of)g(the)g(v)-5 b(ariable)26 b(or)g(arra)m(y)g(in)f(the)h(program) f(do)s(es)g(not)h(need)g(to)g(b)s(e)f(the)h(same)0 5601 y(as)i(the)f(data)h(t)m(yp)s(e)g(of)f(the)h(v)-5 b(alue)28 b(in)f(the)g(FITS)g(\014le.)40 b(Data)28 b(t)m(yp)s(e)g(con)m(v)m (ersion)h(is)e(supp)s(orted)f(for)h(n)m(umerical)h(and)0 5714 y(string)33 b(data)h(t)m(yp)s(es)f(\(if)h(the)g(string)f(con)m (tains)h(a)g(v)-5 b(alid)33 b(n)m(um)m(b)s(er)f(enclosed)i(in)f (quotes\))h(when)f(reading)g(a)h(FITS)p eop end %%Page: 18 24 TeXDict begin 18 23 bop 0 299 a Fi(18)1277 b Fg(CHAPTER)29 b(4.)72 b(FITSIO)29 b(CONVENTIONS)g(AND)i(GUIDELINES)0 555 y Fi(header)g(k)m(eyw)m(ord)g(v)-5 b(alue)31 b(and)g(for)f(n)m (umeric)h(v)-5 b(alues)31 b(when)f(reading)h(or)g(writing)g(v)-5 b(alues)31 b(in)f(the)h(primary)f(arra)m(y)0 668 y(or)40 b(a)h(table)h(column.)70 b(CFITSIO)39 b(returns)h(status)g(=)h(NUM)p 2185 668 28 4 v 33 w(O)m(VERFLO)m(W)g(if)g(the)f(con)m(v)m(erted)i (data)f(v)-5 b(alue)0 781 y(exceeds)33 b(the)g(range)g(of)g(the)f (output)g(data)i(t)m(yp)s(e.)47 b(Implicit)33 b(data)g(t)m(yp)s(e)g (con)m(v)m(ersion)h(is)e(not)h(supp)s(orted)d(within)0 894 y(binary)g(tables)h(for)f(string,)g(logical,)k(complex,)d(or)f (double)g(complex)h(data)g(t)m(yp)s(es.)0 1054 y(In)g(addition,)h(an)m (y)f(table)h(column)f(ma)m(y)h(b)s(e)f(read)g(as)h(if)f(it)h(con)m (tained)g(string)f(v)-5 b(alues.)44 b(In)31 b(the)g(case)i(of)e(n)m (umeric)0 1167 y(columns)f(the)h(returned)e(string)h(will)h(b)s(e)f (formatted)h(using)e(the)i(TDISPn)e(displa)m(y)i(format)f(if)h(it)g (exists.)0 1496 y Fd(4.7)135 b(Data)46 b(Scaling)0 1746 y Fi(When)38 b(reading)f(n)m(umerical)i(data)f(v)-5 b(alues)38 b(in)f(the)h(primary)f(arra)m(y)h(or)g(a)g(table)h(column,)h(the)d(v)-5 b(alues)38 b(will)h(b)s(e)0 1859 y(scaled)f(automatically)j(b)m(y)c (the)h(BSCALE)f(and)g(BZER)m(O)h(\(or)g(TSCALn)d(and)i(TZER)m(On\))g (header)g(k)m(eyw)m(ord)0 1972 y(v)-5 b(alues)33 b(if)f(they)g(are)h (presen)m(t)g(in)f(the)g(header.)47 b(The)31 b(scaled)j(data)f(that)g (is)f(returned)f(to)i(the)g(reading)f(program)0 2085 y(will)f(ha)m(v)m(e)382 2316 y Fe(output)46 b(value)g(=)i(\(FITS)e (value\))g(*)i(BSCALE)e(+)h(BZERO)0 2546 y Fi(\(a)30 b(corresp)s(onding)e(form)m(ula)h(using)g(TSCALn)e(and)i(TZER)m(On)e (is)i(used)g(when)f(reading)h(from)g(table)h(columns\).)0 2659 y(In)h(the)i(case)g(of)f(in)m(teger)h(output)f(v)-5 b(alues)32 b(the)h(\015oating)g(p)s(oin)m(t)f(scaled)g(v)-5 b(alue)33 b(is)f(truncated)g(to)h(an)f(in)m(teger)h(\(not)0 2772 y(rounded)38 b(to)i(the)g(nearest)g(in)m(teger\).)70 b(The)39 b(ftpscl)g(and)g(fttscl)i(subroutines)d(ma)m(y)i(b)s(e)f(used) g(to)h(o)m(v)m(erride)h(the)0 2885 y(scaling)30 b(parameters)f (de\014ned)e(in)h(the)h(header)f(\(e.g.,)j(to)e(turn)f(o\013)h(the)f (scaling)i(so)f(that)g(the)g(program)f(can)h(read)0 2998 y(the)i(ra)m(w)f(unscaled)g(v)-5 b(alues)31 b(from)f(the)g(FITS)g (\014le\).)0 3158 y(When)44 b(writing)h(n)m(umerical)g(data)g(to)g(the) g(primary)f(arra)m(y)h(or)f(to)h(a)g(table)h(column)e(the)h(data)g(v)-5 b(alues)45 b(will)0 3271 y(generally)29 b(b)s(e)f(automatically)j(in)m (v)m(ersely)f(scaled)f(b)m(y)f(the)g(v)-5 b(alue)29 b(of)f(the)h (BSCALE)e(and)h(BZER)m(O)g(\(or)h(TSCALn)0 3384 y(and)h(TZER)m(On\))g (header)g(k)m(eyw)m(ord)h(v)-5 b(alues)31 b(if)g(they)g(they)g(exist)g (in)f(the)h(header.)42 b(These)30 b(k)m(eyw)m(ords)h(m)m(ust)g(ha)m(v)m (e)0 3497 y(b)s(een)f(written)h(to)h(the)g(header)e(b)s(efore)h(an)m(y) h(data)f(is)g(written)h(for)e(them)i(to)f(ha)m(v)m(e)i(an)m(y)e (e\013ect.)44 b(Otherwise,)32 b(one)0 3610 y(ma)m(y)i(use)f(the)g (ftpscl)g(and)g(fttscl)h(subroutines)d(to)j(de\014ne)f(or)g(o)m(v)m (erride)h(the)f(scaling)i(k)m(eyw)m(ords)e(in)g(the)g(header)0 3723 y(\(e.g.,)h(to)f(turn)d(o\013)j(the)f(scaling)h(so)f(that)g(the)g (program)g(can)g(write)g(the)g(ra)m(w)g(unscaled)g(v)-5 b(alues)32 b(in)m(to)h(the)f(FITS)0 3836 y(\014le\).)43 b(If)30 b(scaling)i(is)f(p)s(erformed,)e(the)i(in)m(v)m(erse)h(scaled)g (output)e(v)-5 b(alue)32 b(that)f(is)g(written)g(in)m(to)h(the)f(FITS)f (\014le)h(will)0 3949 y(ha)m(v)m(e)430 4179 y Fe(FITS)46 b(value)h(=)g(\(\(input)f(value\))g(-)h(BZERO\))f(/)i(BSCALE)0 4410 y Fi(\(a)39 b(corresp)s(onding)d(form)m(ula)i(using)g(TSCALn)e (and)h(TZER)m(On)g(is)h(used)f(when)f(writing)i(to)h(table)g (columns\).)0 4523 y(Rounding)19 b(to)i(the)g(nearest)g(in)m(teger,)i (rather)e(than)f(truncation,)j(is)d(p)s(erformed)f(when)g(writing)h(in) m(teger)i(datat)m(yp)s(es)0 4636 y(to)31 b(the)g(FITS)e(\014le.)0 4965 y Fd(4.8)135 b(Error)46 b(Status)f(V)-11 b(alues)45 b(and)g(the)g(Error)g(Message)h(Stac)l(k)0 5215 y Fi(The)33 b(last)i(parameter)f(in)g(nearly)g(ev)m(ery)g(FITSIO)f(subroutine)g(is) h(the)g(error)f(status)h(v)-5 b(alue)35 b(whic)m(h)e(is)h(b)s(oth)f(an) 0 5328 y(input)j(and)f(an)i(output)f(parameter.)60 b(A)36 b(returned)f(p)s(ositiv)m(e)j(v)-5 b(alue)37 b(for)f(this)h(parameter)g (indicates)g(an)f(error)0 5441 y(w)m(as)31 b(detected.)42 b(A)30 b(listing)h(of)g(all)g(the)g(FITSIO)e(status)i(co)s(de)f(v)-5 b(alues)31 b(is)f(giv)m(en)i(at)f(the)f(end)g(of)h(this)f(do)s(cumen)m (t.)0 5601 y(The)22 b(FITSIO)g(library)g(uses)h(an)f(`inherited)h (status')g(con)m(v)m(en)m(tion)i(for)e(the)g(status)g(parameter)g(whic) m(h)g(means)f(that)0 5714 y(if)i(a)h(subroutine)f(is)g(called)i(with)e (a)h(p)s(ositiv)m(e)g(input)f(v)-5 b(alue)25 b(of)g(the)f(status)h (parameter,)h(then)f(the)f(subroutine)g(will)p eop end %%Page: 19 25 TeXDict begin 19 24 bop 0 299 a Fg(4.9.)72 b(V)-10 b(ARIABLE-LENGTH)31 b(ARRA)-8 b(Y)31 b(F)-10 b(A)m(CILITY)30 b(IN)h(BINAR)-8 b(Y)31 b(T)-8 b(ABLES)956 b Fi(19)0 555 y(exit)26 b(immediately)f (without)g(c)m(hanging)h(the)e(v)-5 b(alue)25 b(of)g(the)g(status)g (parameter.)39 b(Th)m(us,)25 b(if)g(one)f(passes)h(the)g(status)0 668 y(v)-5 b(alue)31 b(returned)e(from)h(eac)m(h)i(FITSIO)d(routine)h (as)h(input)f(to)h(the)f(next)h(FITSIO)e(subroutine,)h(then)g(whenev)m (er)0 781 y(an)39 b(error)g(is)h(detected)g(all)h(further)d(FITSIO)g (pro)s(cessing)h(will)h(cease.)69 b(This)39 b(con)m(v)m(en)m(tion)i (can)f(simplify)f(the)0 894 y(error)30 b(c)m(hec)m(king)j(in)d (application)i(programs)f(b)s(ecause)g(it)g(is)g(not)g(necessary)g(to)g (c)m(hec)m(k)i(the)e(v)-5 b(alue)31 b(of)g(the)g(status)0 1007 y(parameter)j(after)g(ev)m(ery)g(single)h(FITSIO)d(subroutine)g (call.)52 b(If)33 b(a)h(program)f(con)m(tains)i(a)f(sequence)g(of)g (sev)m(eral)0 1120 y(FITSIO)23 b(calls,)j(one)e(can)g(just)g(c)m(hec)m (k)h(the)f(status)g(v)-5 b(alue)24 b(after)h(the)f(last)g(call.)40 b(Since)24 b(the)g(returned)e(status)j(v)-5 b(alues)0 1233 y(are)36 b(generally)h(distinctiv)m(e,)i(it)d(should)f(b)s(e)g(p)s (ossible)g(to)h(determine)g(whic)m(h)f(subroutine)g(originally)i (returned)0 1346 y(the)31 b(error)f(status.)0 1506 y(FITSIO)i(also)i (main)m(tains)f(an)g(in)m(ternal)h(stac)m(k)g(of)f(error)g(messages)h (\(80-c)m(haracter)i(maxim)m(um)d(length\))g(whic)m(h)0 1619 y(in)j(man)m(y)g(cases)h(pro)m(vide)f(a)g(more)g(detailed)i (explanation)f(of)f(the)g(cause)h(of)f(the)g(error)g(than)f(is)h(pro)m (vided)g(b)m(y)0 1732 y(the)k(error)e(status)i(n)m(um)m(b)s(er)e (alone.)69 b(It)39 b(is)h(recommended)f(that)g(the)h(error)f(message)h (stac)m(k)h(b)s(e)e(prin)m(ted)g(out)0 1844 y(whenev)m(er)31 b(a)h(program)g(detects)g(a)g(FITSIO)e(error.)44 b(T)-8 b(o)32 b(do)f(this,)h(call)h(the)f(FTGMSG)g(routine)f(rep)s(eatedly)h (to)0 1957 y(get)h(the)g(successiv)m(e)g(messages)h(on)e(the)g(stac)m (k.)48 b(When)32 b(the)h(stac)m(k)g(is)g(empt)m(y)f(FTGMSG)h(will)g (return)e(a)h(blank)0 2070 y(string.)41 b(Note)31 b(that)g(this)f(is)g (a)g(`First)h(In)e({)i(First)f(Out')g(stac)m(k,)i(so)e(the)h(oldest)g (error)e(message)j(is)e(returned)f(\014rst)0 2183 y(b)m(y)h(ftgmsg.)0 2557 y Fd(4.9)135 b(V)-11 b(ariable-Length)46 b(Arra)l(y)f(F)-11 b(acilit)l(y)46 b(in)f(Binary)g(T)-11 b(ables)0 2815 y Fi(FITSIO)38 b(pro)m(vides)i(easy-to-use)h(supp)s(ort)d(for)h (reading)g(and)g(writing)h(data)g(in)f(v)-5 b(ariable)40 b(length)g(\014elds)f(of)h(a)0 2928 y(binary)35 b(table.)56 b(The)35 b(v)-5 b(ariable)36 b(length)f(columns)g(ha)m(v)m(e)i(TF)m (ORMn)e(k)m(eyw)m(ord)h(v)-5 b(alues)35 b(of)h(the)f(form)g (`1Pt\(len\)')0 3041 y(or)30 b(`1Qt\(len\)')h(where)f(`t')g(is)g(the)g (datat)m(yp)s(e)h(co)s(de)f(\(e.g.,)i(I,)e(J,)f(E,)h(D,)h(etc.\))42 b(and)29 b(`len')h(is)g(an)g(in)m(teger)h(sp)s(ecifying)0 3154 y(the)f(maxim)m(um)g(length)g(of)g(the)g(v)m(ector)h(in)f(the)g (table.)41 b(If)30 b(the)g(v)-5 b(alue)30 b(of)g(`len')g(is)g(not)g(sp) s(eci\014ed)f(when)g(the)h(table)0 3267 y(is)j(created)g(\(e.g.,)i(if)e (the)f(TF)m(ORM)h(k)m(eyw)m(ord)g(v)-5 b(alue)33 b(is)g(simply)f(sp)s (eci\014ed)g(as)h('1PE')g(instead)g(of)f('1PE\(400\))j(\),)0 3380 y(then)28 b(FITSIO)f(will)h(automatically)k(scan)c(the)g(table)h (when)f(it)g(is)h(closed)g(to)g(determine)f(the)g(maxim)m(um)h(length)0 3493 y(of)i(the)f(v)m(ector)i(and)e(will)h(app)s(end)d(this)j(v)-5 b(alue)30 b(to)i(the)e(TF)m(ORMn)g(v)-5 b(alue.)0 3653 y(The)25 b(same)h(routines)g(whic)m(h)f(read)h(and)f(write)h(data)g(in) f(an)h(ordinary)f(\014xed)g(length)h(binary)f(table)h(extension)h(are)0 3766 y(also)k(used)e(for)h(v)-5 b(ariable)31 b(length)g(\014elds,)e(ho) m(w)m(ev)m(er,)j(the)e(subroutine)f(parameters)i(tak)m(e)h(on)e(a)g (sligh)m(tly)h(di\013eren)m(t)0 3878 y(in)m(terpretation)h(as)e (describ)s(ed)g(b)s(elo)m(w.)0 4039 y(All)37 b(the)f(data)h(in)f(a)h(v) -5 b(ariable)37 b(length)f(\014eld)g(is)g(written)h(in)m(to)g(an)f (area)h(called)h(the)e(`heap')g(whic)m(h)g(follo)m(ws)i(the)0 4152 y(main)26 b(\014xed-length)g(FITS)f(binary)h(table.)40 b(The)25 b(size)i(of)g(the)f(heap,)h(in)f(b)m(ytes,)h(is)f(sp)s (eci\014ed)g(with)f(the)i(PCOUNT)0 4264 y(k)m(eyw)m(ord)21 b(in)f(the)h(FITS)f(header.)37 b(When)20 b(creating)i(a)f(new)f(binary) g(table,)j(the)e(initial)h(v)-5 b(alue)21 b(of)f(PCOUNT)g(should)0 4377 y(usually)31 b(b)s(e)f(set)i(to)g(zero.)44 b(FITSIO)30 b(will)h(recompute)h(the)f(size)h(of)g(the)f(heap)g(as)g(the)h(data)g (is)f(written)g(and)g(will)0 4490 y(automatically)d(up)s(date)c(the)i (PCOUNT)e(k)m(eyw)m(ord)h(v)-5 b(alue)26 b(when)e(the)h(table)h(is)f (closed.)40 b(When)25 b(writing)g(v)-5 b(ariable)0 4603 y(length)34 b(data)g(to)g(a)g(table,)i(CFITSIO)c(will)h(automatically)k (extend)c(the)h(size)g(of)g(the)g(heap)f(area)h(if)g(necessary)-8 b(,)0 4716 y(so)31 b(that)g(an)m(y)f(follo)m(wing)i(HDUs)f(do)f(not)h (get)h(o)m(v)m(erwritten.)0 4876 y(By)e(default)f(the)h(heap)f(data)i (area)f(starts)g(immediately)h(after)f(the)f(last)i(ro)m(w)e(of)h(the)g (\014xed-length)f(table.)42 b(This)0 4989 y(default)27 b(starting)g(lo)s(cation)i(ma)m(y)e(b)s(e)f(o)m(v)m(erridden)h(b)m(y)g (the)g(THEAP)f(k)m(eyw)m(ord,)i(but)f(this)f(is)h(not)g(recommended.)0 5102 y(If)34 b(additional)h(ro)m(ws)f(of)g(data)h(are)g(added)e(to)i (the)f(table,)j(CFITSIO)32 b(will)j(automatically)i(shift)c(the)i(the)f (heap)0 5215 y(do)m(wn)g(to)i(mak)m(e)f(ro)s(om)g(for)f(the)h(new)f(ro) m(ws,)i(but)e(it)i(is)e(ob)m(viously)i(b)s(e)e(more)h(e\016cien)m(t)h (to)f(initially)h(create)h(the)0 5328 y(table)31 b(with)e(the)h (necessary)g(n)m(um)m(b)s(er)f(of)h(blank)f(ro)m(ws,)h(so)g(that)g(the) g(heap)g(do)s(es)f(not)h(needed)g(to)g(b)s(e)f(constan)m(tly)0 5441 y(mo)m(v)m(ed.)0 5601 y(When)40 b(writing)h(to)g(a)g(v)-5 b(ariable)41 b(length)g(\014eld,)i(the)e(en)m(tire)h(arra)m(y)f(of)f(v) -5 b(alues)41 b(for)f(a)h(giv)m(en)h(ro)m(w)f(of)f(the)h(table)0 5714 y(m)m(ust)36 b(b)s(e)g(written)g(with)g(a)g(single)h(call)h(to)f (FTPCLx.)57 b(The)36 b(total)i(length)f(of)f(the)g(arra)m(y)h(is)f (calculated)i(from)p eop end %%Page: 20 26 TeXDict begin 20 25 bop 0 299 a Fi(20)1277 b Fg(CHAPTER)29 b(4.)72 b(FITSIO)29 b(CONVENTIONS)g(AND)i(GUIDELINES)0 555 y Fi(\(NELEM+FELEM-1\).)44 b(One)30 b(cannot)i(app)s(end)d(more)i (elemen)m(ts)h(to)g(an)e(existing)i(\014eld)f(at)g(a)h(later)g(time;)g (an)m(y)0 668 y(attempt)j(to)f(do)g(so)g(will)g(simply)f(o)m(v)m (erwrite)j(all)e(the)g(data)h(whic)m(h)e(w)m(as)h(previously)g (written.)51 b(Note)35 b(also)f(that)0 781 y(the)g(new)g(data)g(will)h (b)s(e)e(written)h(to)h(a)f(new)g(area)g(of)g(the)h(heap)e(and)h(the)g (heap)g(space)g(used)f(b)m(y)h(the)g(previous)0 894 y(write)j(cannot)h (b)s(e)e(reclaimed.)62 b(F)-8 b(or)38 b(this)f(reason)g(it)h(is)f (advised)g(that)h(eac)m(h)g(ro)m(w)f(of)h(a)f(v)-5 b(ariable)38 b(length)f(\014eld)0 1007 y(only)c(b)s(e)g(written)g(once.)50 b(An)33 b(exception)h(to)g(this)f(general)h(rule)f(o)s(ccurs)g(when)f (setting)i(elemen)m(ts)h(of)e(an)g(arra)m(y)0 1120 y(as)38 b(unde\014ned.)63 b(One)37 b(m)m(ust)i(\014rst)e(write)h(a)h(dumm)m(y)e (v)-5 b(alue)39 b(in)m(to)g(the)g(arra)m(y)f(with)g(FTPCLx,)i(and)e (then)g(call)0 1233 y(FTPCLU)33 b(to)i(\015ag)f(the)f(desired)h(elemen) m(ts)h(as)e(unde\014ned.)49 b(\(Do)35 b(not)f(use)f(the)h(FTPCNx)f (family)h(of)g(routines)0 1346 y(with)28 b(v)-5 b(ariable)30 b(length)f(\014elds\).)40 b(Note)30 b(that)f(the)g(ro)m(ws)g(of)g(a)g (table,)h(whether)e(\014xed)g(or)h(v)-5 b(ariable)29 b(length,)h(do)f(not)0 1458 y(ha)m(v)m(e)j(to)f(b)s(e)e(written)i (consecutiv)m(ely)h(and)e(ma)m(y)h(b)s(e)f(written)g(in)g(an)m(y)h (order.)0 1619 y(When)40 b(writing)h(to)g(a)g(v)-5 b(ariable)41 b(length)g(ASCI)s(I)e(c)m(haracter)j(\014eld)e(\(e.g.,)45 b(TF)m(ORM)c(=)f('1P)-8 b(A'\))43 b(only)d(a)h(single)0 1732 y(c)m(haracter)33 b(string)f(written.)44 b(FTPCLS)30 b(writes)i(the)g(whole)f(length)h(of)g(the)g(input)e(string)i(\(min)m (us)f(an)m(y)h(trailing)0 1844 y(blank)37 b(c)m(haracters\),)42 b(th)m(us)37 b(the)h(NELEM)f(and)g(FELEM)h(parameters)g(are)g(ignored.) 62 b(If)37 b(the)h(input)e(string)i(is)0 1957 y(completely)28 b(blank)f(then)f(FITSIO)g(will)h(write)g(one)g(blank)f(c)m(haracter)j (to)e(the)g(FITS)f(\014le.)40 b(Similarly)-8 b(,)28 b(FTGCVS)0 2070 y(and)35 b(FTGCFS)g(read)g(the)h(en)m(tire)g(string)g(\(truncated) f(to)i(the)e(width)g(of)g(the)h(c)m(haracter)h(string)e(argumen)m(t)h (in)0 2183 y(the)31 b(subroutine)e(call\))j(and)e(also)h(ignore)g(the)f (NELEM)h(and)f(FELEM)g(parameters.)0 2343 y(The)35 b(FTPDES)h (subroutine)e(is)i(useful)f(in)g(situations)i(where)e(m)m(ultiple)i(ro) m(ws)e(of)h(a)g(v)-5 b(ariable)37 b(length)f(column)0 2456 y(ha)m(v)m(e)c(the)e(iden)m(tical)i(arra)m(y)f(of)g(v)-5 b(alues.)41 b(One)30 b(can)g(simply)g(write)h(the)f(arra)m(y)h(once)g (for)g(the)f(\014rst)g(ro)m(w,)g(and)g(then)0 2569 y(use)36 b(FTPDES)g(to)h(write)g(the)f(same)h(descriptor)g(v)-5 b(alues)36 b(in)m(to)i(the)e(other)h(ro)m(ws)f(\(use)h(the)f(FTGDES)h (routine)0 2682 y(to)f(read)f(the)h(\014rst)f(descriptor)g(v)-5 b(alue\);)39 b(all)d(the)g(ro)m(ws)f(will)h(then)f(p)s(oin)m(t)g(to)h (the)g(same)f(storage)i(lo)s(cation)g(th)m(us)0 2795 y(sa)m(ving)31 b(disk)f(space.)0 2955 y(When)35 b(reading)g(from)f(a)i (v)-5 b(ariable)35 b(length)h(arra)m(y)f(\014eld)g(one)g(can)g(only)h (read)e(as)i(man)m(y)f(elemen)m(ts)h(as)f(actually)0 3068 y(exist)i(in)e(that)i(ro)m(w)e(of)h(the)g(table;)k(reading)c(do)s (es)g(not)g(automatically)i(con)m(tin)m(ue)f(with)f(the)g(next)g(ro)m (w)g(of)g(the)0 3181 y(table)29 b(as)f(o)s(ccurs)g(when)f(reading)h(an) g(ordinary)g(\014xed)f(length)h(table)h(\014eld.)40 b(A)m(ttempts)29 b(to)g(read)f(more)g(than)g(this)0 3294 y(will)k(cause)h(an)e(error)h (status)g(to)g(b)s(e)f(returned.)44 b(One)32 b(can)g(determine)g(the)g (n)m(um)m(b)s(er)e(of)i(elemen)m(ts)h(in)f(eac)m(h)h(ro)m(w)0 3407 y(of)e(a)f(v)-5 b(ariable)31 b(column)g(with)f(the)g(FTGDES)h (subroutine.)0 3859 y Fd(4.10)136 b(Supp)t(ort)44 b(for)h(IEEE)g(Sp)t (ecial)h(V)-11 b(alues)0 4133 y Fi(The)26 b(ANSI/IEEE-754)h (\015oating-p)s(oin)m(t)h(n)m(um)m(b)s(er)d(standard)g(de\014nes)h (certain)h(sp)s(ecial)g(v)-5 b(alues)26 b(that)h(are)g(used)e(to)0 4246 y(represen)m(t)j(suc)m(h)g(quan)m(tities)h(as)f(Not-a-Num)m(b)s (er)h(\(NaN\),)h(denormalized,)f(under\015o)m(w,)e(o)m(v)m(er\015o)m (w,)j(and)d(in\014nit)m(y)-8 b(.)0 4359 y(\(See)31 b(the)g(App)s(endix) d(in)j(the)f(FITS)g(standard)f(or)i(the)g(FITS)e(User's)i(Guide)f(for)g (a)h(list)g(of)g(these)g(v)-5 b(alues\).)41 b(The)0 4472 y(FITSIO)26 b(subroutines)h(that)h(read)f(\015oating)i(p)s(oin)m(t)e (data)i(in)e(FITS)g(\014les)g(recognize)j(these)e(IEEE)e(sp)s(ecial)j (v)-5 b(alues)0 4585 y(and)27 b(b)m(y)h(default)h(in)m(terpret)f(the)h (o)m(v)m(er\015o)m(w)g(and)f(in\014nit)m(y)f(v)-5 b(alues)29 b(as)f(b)s(eing)g(equiv)-5 b(alen)m(t)29 b(to)g(a)g(NaN,)g(and)e(con)m (v)m(ert)0 4698 y(the)37 b(under\015o)m(w)e(and)i(denormalized)g(v)-5 b(alues)37 b(in)m(to)h(zeros.)60 b(In)36 b(some)i(cases)f(programmers)g (ma)m(y)g(w)m(an)m(t)h(access)0 4811 y(to)h(the)g(ra)m(w)f(IEEE)g(v)-5 b(alues,)41 b(without)e(an)m(y)f(mo)s(di\014cation)h(b)m(y)g(FITSIO.)e (This)h(can)g(b)s(e)g(done)g(b)m(y)h(calling)h(the)0 4924 y(FTGPVx)27 b(or)g(FTGCVx)h(routines)f(while)g(sp)s(ecifying)g (0.0)h(as)f(the)g(v)-5 b(alue)28 b(of)f(the)h(NULL)-10 b(V)g(AL)27 b(parameter.)40 b(This)0 5036 y(will)27 b(force)g(FITSIO)e (to)i(simply)f(pass)f(the)i(IEEE)f(v)-5 b(alues)26 b(through)g(to)h (the)f(application)i(program,)f(without)g(an)m(y)0 5149 y(mo)s(di\014cation.)63 b(This)37 b(do)s(es)g(not)h(w)m(ork)g(for)f (double)g(precision)h(v)-5 b(alues)38 b(on)g(V)-10 b(AX/VMS)38 b(mac)m(hines,)i(ho)m(w)m(ev)m(er,)0 5262 y(where)34 b(there)g(is)g(no)g(easy)h(w)m(a)m(y)g(to)g(b)m(ypass)f(the)g(default)h (in)m(terpretation)g(of)g(the)f(IEEE)f(sp)s(ecial)i(v)-5 b(alues.)53 b(This)0 5375 y(is)44 b(also)h(not)f(supp)s(orted)e(when)h (reading)h(\015oating-p)s(oin)m(t)h(images)h(that)e(ha)m(v)m(e)h(b)s (een)e(compressed)h(with)g(the)0 5488 y(FITS)33 b(tiled)h(image)g (compression)f(con)m(v)m(en)m(tion)j(that)e(is)f(discussed)g(in)g (section)h(5.6;)i(the)e(pixels)f(v)-5 b(alues)34 b(in)f(tile)0 5601 y(compressed)d(images)i(are)f(represen)m(ted)g(b)m(y)g(scaled)g (in)m(tegers,)h(and)e(a)i(reserv)m(ed)e(in)m(teger)j(v)-5 b(alue)31 b(\(not)g(a)g(NaN\))h(is)0 5714 y(used)e(to)h(represen)m(t)f (unde\014ned)e(pixels.)p eop end %%Page: 21 27 TeXDict begin 21 26 bop 0 299 a Fg(4.11.)73 b(WHEN)31 b(THE)f(FINAL)g(SIZE)f(OF)i(THE)f(FITS)f(HDU)i(IS)f(UNKNO)m(WN)978 b Fi(21)0 555 y Fd(4.11)136 b(When)44 b(the)h(Final)h(Size)f(of)g(the)g (FITS)f(HDU)h(is)g(Unkno)l(wn)0 805 y Fi(It)27 b(is)h(not)f(required)f (to)i(kno)m(w)f(the)h(total)h(size)f(of)f(a)h(FITS)e(data)i(arra)m(y)g (or)f(table)h(b)s(efore)f(b)s(eginning)f(to)i(write)g(the)0 918 y(data)k(to)f(the)g(FITS)f(\014le.)43 b(In)30 b(the)h(case)h(of)f (the)g(primary)f(arra)m(y)h(or)g(an)f(image)j(extension,)e(one)h (should)d(initially)0 1031 y(create)i(the)e(arra)m(y)h(with)e(the)i (size)g(of)f(the)g(highest)g(dimension)g(\(largest)i(NAXISn)d(k)m(eyw)m (ord\))i(set)g(to)g(a)f(dumm)m(y)0 1144 y(v)-5 b(alue,)26 b(suc)m(h)e(as)g(1.)39 b(Then)23 b(after)i(all)g(the)g(data)f(ha)m(v)m (e)i(b)s(een)d(written)h(and)g(the)g(true)g(dimensions)g(are)g(kno)m (wn,)h(then)0 1257 y(the)31 b(NAXISn)e(v)-5 b(alue)31 b(should)f(b)s(e)g(up)s(dated)f(using)h(the)h(\014ts)p 2051 1257 28 4 v 62 w(up)s(date)p 2389 1257 V 32 w(k)m(ey)h(routine)e (b)s(efore)g(mo)m(ving)i(to)f(another)0 1370 y(extension)g(or)f (closing)i(the)e(FITS)g(\014le.)0 1530 y(When)f(writing)g(to)g(FITS)g (tables,)h(CFITSIO)d(automatically)32 b(k)m(eeps)e(trac)m(k)g(of)f(the) g(highest)h(ro)m(w)f(n)m(um)m(b)s(er)e(that)0 1643 y(is)32 b(written)g(to,)h(and)e(will)h(increase)h(the)f(size)h(of)f(the)g (table)g(if)g(necessary)-8 b(.)46 b(CFITSIO)30 b(will)i(also)h (automatically)0 1756 y(insert)j(space)h(in)f(the)g(FITS)f(\014le)i(if) f(necessary)-8 b(,)39 b(to)e(ensure)e(that)i(the)f(data)h('heap',)h(if) e(it)h(exists,)h(and/or)f(an)m(y)0 1869 y(additional)29 b(HDUs)g(that)g(follo)m(w)g(the)g(table)g(do)f(not)h(get)g(o)m(v)m (erwritten)h(as)e(new)g(ro)m(ws)g(are)h(written)f(to)h(the)g(table.)0 2029 y(As)37 b(a)h(general)g(rule)f(it)h(is)f(b)s(est)g(to)h(sp)s (ecify)f(the)h(initial)g(n)m(um)m(b)s(er)e(of)i(ro)m(ws)f(=)g(0)g(when) g(the)g(table)h(is)g(created,)0 2142 y(then)g(let)h(CFITSIO)e(k)m(eep)i (trac)m(k)g(of)g(the)f(n)m(um)m(b)s(er)f(of)i(ro)m(ws)f(that)h(are)f (actually)i(written.)65 b(The)38 b(application)0 2255 y(program)e(should)f(not)i(man)m(ually)g(up)s(date)e(the)i(n)m(um)m(b)s (er)e(of)h(ro)m(ws)g(in)g(the)h(table)g(\(as)g(giv)m(en)g(b)m(y)f(the)h (NAXIS2)0 2368 y(k)m(eyw)m(ord\))j(since)f(CFITSIO)e(do)s(es)i(this)g (automatically)-8 b(.)69 b(If)38 b(a)i(table)f(is)g(initially)i (created)f(with)e(more)h(than)0 2481 y(zero)i(ro)m(ws,)j(then)c(this)h (will)f(usually)h(b)s(e)f(considered)g(as)h(the)g(minim)m(um)f(size)h (of)g(the)g(table,)j(ev)m(en)d(if)g(few)m(er)0 2594 y(ro)m(ws)30 b(are)g(actually)h(written)f(to)h(the)f(table.)41 b(Th)m(us,)30 b(if)f(a)i(table)f(is)g(initially)h(created)g(with)f(NAXIS2)g(=)g(20,)h (and)0 2706 y(CFITSIO)g(only)i(writes)f(10)i(ro)m(ws)e(of)h(data)g(b)s (efore)f(closing)i(the)f(table,)h(then)e(NAXIS2)h(will)g(remain)f (equal)h(to)0 2819 y(20.)50 b(If)33 b(ho)m(w)m(ev)m(er,)i(30)g(ro)m(ws) e(of)g(data)h(are)g(written)f(to)h(this)f(table,)i(then)e(NAXIS2)h (will)f(b)s(e)g(increased)g(from)g(20)0 2932 y(to)f(30.)44 b(The)31 b(one)g(exception)i(to)f(this)f(automatic)i(up)s(dating)d(of)h (the)h(NAXIS2)f(k)m(eyw)m(ord)h(is)f(if)g(the)h(application)0 3045 y(program)c(directly)g(mo)s(di\014es)f(the)i(v)-5 b(alue)28 b(of)g(NAXIS2)g(\(up)f(or)h(do)m(wn\))g(itself)h(just)e(b)s (efore)h(closing)h(the)f(table.)41 b(In)0 3158 y(this)28 b(case,)i(CFITSIO)d(do)s(es)h(not)h(up)s(date)e(NAXIS2)i(again,)h (since)f(it)g(assumes)f(that)h(the)f(application)i(program)0 3271 y(m)m(ust)i(ha)m(v)m(e)h(had)f(a)g(go)s(o)s(d)g(reason)h(for)f(c)m (hanging)h(the)f(v)-5 b(alue)33 b(directly)-8 b(.)47 b(This)31 b(is)h(not)h(recommended,)f(ho)m(w)m(ev)m(er,)0 3384 y(and)j(is)h(only)g(pro)m(vided)g(for)f(bac)m(kw)m(ard)h (compatibilit)m(y)i(with)e(soft)m(w)m(are)h(that)g(initially)g(creates) g(a)f(table)h(with)0 3497 y(a)d(large)h(n)m(um)m(b)s(er)e(of)h(ro)m (ws,)h(than)f(decreases)g(the)h(NAXIS2)f(v)-5 b(alue)34 b(to)h(the)f(actual)h(smaller)g(v)-5 b(alue)34 b(just)f(b)s(efore)0 3610 y(closing)e(the)g(table.)0 3941 y Fd(4.12)136 b(Lo)t(cal)45 b(FITS)e(Con)l(v)l(en)l(tions)k(supp)t(orted)d(b)l(y)h(FITSIO)0 4191 y Fi(CFITSIO)29 b(supp)s(orts)g(sev)m(eral)j(lo)s(cal)g(FITS)e (con)m(v)m(en)m(tions)i(whic)m(h)f(are)g(not)g(de\014ned)e(in)i(the)f (o\016cial)j(FITS)d(stan-)0 4304 y(dard)43 b(and)g(whic)m(h)g(are)h (not)g(necessarily)g(recognized)h(or)f(supp)s(orted)e(b)m(y)h(other)h (FITS)f(soft)m(w)m(are)i(pac)m(k)-5 b(ages.)0 4417 y(Programmers)36 b(should)f(b)s(e)g(cautious)i(ab)s(out)e(using)h(these)g(features,)i (esp)s(ecially)f(if)f(the)g(FITS)f(\014les)h(that)h(are)0 4530 y(pro)s(duced)31 b(are)i(exp)s(ected)g(to)g(b)s(e)f(pro)s(cessed)g (b)m(y)h(other)f(soft)m(w)m(are)i(systems)f(whic)m(h)f(do)h(not)f(use)h (the)f(CFITSIO)0 4642 y(in)m(terface.)0 4930 y Fb(4.12.1)113 b(Supp)s(ort)37 b(for)h(Long)g(String)f(Keyw)m(ord)h(V)-9 b(alues.)0 5149 y Fi(The)23 b(length)i(of)f(a)g(standard)f(FITS)g (string)h(k)m(eyw)m(ord)g(is)g(limited)h(to)f(68)h(c)m(haracters)g(b)s (ecause)f(it)g(m)m(ust)g(\014t)g(en)m(tirely)0 5262 y(within)35 b(a)h(single)h(FITS)e(header)h(k)m(eyw)m(ord)g(record.)57 b(In)35 b(some)h(instances)g(it)h(is)e(necessary)i(to)f(enco)s(de)g (strings)0 5375 y(longer)27 b(than)f(this)g(limit,)i(so)e(FITSIO)f (supp)s(orts)f(a)j(lo)s(cal)g(con)m(v)m(en)m(tion)h(in)e(whic)m(h)g (the)g(string)g(v)-5 b(alue)27 b(is)f(con)m(tin)m(ued)0 5488 y(o)m(v)m(er)34 b(m)m(ultiple)g(k)m(eyw)m(ords.)49 b(This)32 b(con)m(tin)m(uation)j(con)m(v)m(en)m(tion)h(uses)c(an)h(amp) s(ersand)f(c)m(haracter)i(at)g(the)f(end)g(of)0 5601 y(eac)m(h)c(substring)d(to)i(indicate)h(that)f(it)g(is)g(con)m(tin)m (ued)g(on)f(the)h(next)g(k)m(eyw)m(ord,)h(and)d(the)i(con)m(tin)m (uation)i(k)m(eyw)m(ords)0 5714 y(all)44 b(ha)m(v)m(e)h(the)f(name)f (CONTINUE)g(without)g(an)h(equal)g(sign)f(in)g(column)h(9.)80 b(The)43 b(string)h(v)-5 b(alue)43 b(ma)m(y)i(b)s(e)p eop end %%Page: 22 28 TeXDict begin 22 27 bop 0 299 a Fi(22)1277 b Fg(CHAPTER)29 b(4.)72 b(FITSIO)29 b(CONVENTIONS)g(AND)i(GUIDELINES)0 555 y Fi(con)m(tin)m(ued)e(in)f(this)h(w)m(a)m(y)g(o)m(v)m(er)h(as)e (man)m(y)h(additional)g(CONTINUE)f(k)m(eyw)m(ords)g(as)h(is)f (required.)40 b(The)27 b(follo)m(wing)0 668 y(lines)k(illustrate)g (this)f(con)m(tin)m(uation)j(con)m(v)m(en)m(tion)f(whic)m(h)e(is)h (used)e(in)h(the)h(v)-5 b(alue)31 b(of)f(the)h(STRKEY)e(k)m(eyw)m(ord:) 0 920 y Fe(LONGSTRN=)45 b('OGIP)i(1.0')524 b(/)47 b(The)g(OGIP)g(Long)f (String)g(Convention)f(may)i(be)g(used.)0 1033 y(STRKEY)94 b(=)47 b('This)g(is)g(a)g(very)g(long)g(string)f(keyword&')93 b(/)47 b(Optional)f(Comment)0 1146 y(CONTINUE)93 b(')48 b(value)e(that)h(is)g(continued)e(over)i(3)g(keywords)f(in)h(the)g(&)95 b(')0 1259 y(CONTINUE)e('FITS)47 b(header.')e(/)j(This)e(is)h(another)f (optional)g(comment.)0 1511 y Fi(It)29 b(is)g(recommended)f(that)h(the) g(LONGSTRN)f(k)m(eyw)m(ord,)i(as)f(sho)m(wn)f(here,)h(alw)m(a)m(ys)i(b) s(e)d(included)g(in)g(an)m(y)h(HDU)0 1624 y(that)f(uses)e(this)h (longstring)h(con)m(v)m(en)m(tion.)42 b(A)27 b(subroutine)f(called)i (FTPLSW)f(has)g(b)s(een)f(pro)m(vided)h(in)f(CFITSIO)0 1737 y(to)31 b(write)g(this)f(k)m(eyw)m(ord)h(if)f(it)h(do)s(es)f(not)h (already)g(exist.)0 1897 y(This)23 b(long)i(string)g(con)m(v)m(en)m (tion)h(is)e(supp)s(orted)f(b)m(y)h(the)g(follo)m(wing)i(FITSIO)d (subroutines)g(that)i(deal)g(with)f(string-)0 2010 y(v)-5 b(alued)30 b(k)m(eyw)m(ords:)286 2262 y Fe(ftgkys)46 b(-)i(read)f(a)g(string)f(keyword)286 2375 y(ftpkls)g(-)i(write)e (\(append\))g(a)h(string)f(keyword)286 2488 y(ftikls)g(-)i(insert)e(a)h (string)g(keyword)286 2601 y(ftmkls)f(-)i(modify)e(the)h(value)f(of)h (an)h(existing)d(string)h(keyword)286 2714 y(ftukls)g(-)i(update)e(an)h (existing)f(keyword,)f(or)i(write)g(a)g(new)g(keyword)286 2827 y(ftdkey)f(-)i(delete)e(a)h(keyword)0 3079 y Fi(These)41 b(routines)f(will)h(transparen)m(tly)g(read,)j(write,)g(or)d(delete)h (a)f(long)g(string)g(v)-5 b(alue)41 b(in)g(the)g(FITS)f(\014le,)k(so)0 3192 y(programmers)36 b(in)g(general)h(do)f(not)h(ha)m(v)m(e)g(to)g(b)s (e)f(concerned)g(ab)s(out)g(the)g(details)i(of)e(the)h(con)m(v)m(en)m (tion)h(that)f(is)0 3304 y(used)32 b(to)i(enco)s(de)f(the)g(long)g (string)g(in)g(the)g(FITS)f(header.)48 b(When)33 b(reading)g(a)g(long)h (string,)g(one)f(m)m(ust)g(ensure)0 3417 y(that)h(the)f(c)m(haracter)i (string)f(parameter)g(used)e(in)h(these)h(subroutine)e(calls)j(has)e(b) s(een)f(declared)i(long)g(enough)0 3530 y(to)d(hold)f(the)h(en)m(tire)g (string,)g(otherwise)f(the)h(returned)e(string)h(v)-5 b(alue)31 b(will)g(b)s(e)f(truncated.)0 3690 y(Note)d(that)e(the)h (more)f(commonly)h(used)e(FITSIO)g(subroutine)h(to)h(write)f(string)g (v)-5 b(alued)25 b(k)m(eyw)m(ords)h(\(FTPKYS\))0 3803 y(do)s(es)38 b(NOT)g(supp)s(ort)f(this)h(long)h(string)g(con)m(v)m(en)m (tion)h(and)e(only)h(supp)s(orts)d(strings)i(up)g(to)h(68)g(c)m (haracters)h(in)0 3916 y(length.)i(This)30 b(has)g(b)s(een)g(done)h (delib)s(erately)g(to)h(prev)m(en)m(t)f(programs)g(from)f(inadv)m (erten)m(tly)i(writing)f(k)m(eyw)m(ords)0 4029 y(using)38 b(this)h(non-standard)e(con)m(v)m(en)m(tion)k(without)e(the)f(explicit) i(in)m(ten)m(t)g(of)f(the)g(programmer)f(or)h(user.)64 b(The)0 4142 y(FTPKLS)28 b(subroutine)g(m)m(ust)h(b)s(e)g(called)h (instead)g(to)g(write)f(long)h(strings.)40 b(This)28 b(routine)i(can)f(also)h(b)s(e)f(used)f(to)0 4255 y(write)j(ordinary)e (string)i(v)-5 b(alues)30 b(less)h(than)f(68)h(c)m(haracters)h(in)e (length.)0 4544 y Fb(4.12.2)113 b(Arra)m(ys)37 b(of)g(Fixed-Length)j (Strings)e(in)f(Binary)h(T)-9 b(ables)0 4763 y Fi(CFITSIO)25 b(supp)s(orts)g(2)i(w)m(a)m(ys)g(to)g(sp)s(ecify)f(that)i(a)f(c)m (haracter)h(column)e(in)g(a)h(binary)f(table)i(con)m(tains)f(an)g(arra) m(y)g(of)0 4876 y(\014xed-length)32 b(strings.)46 b(The)32 b(\014rst)f(w)m(a)m(y)-8 b(,)34 b(whic)m(h)e(is)g(o\016cially)i(supp)s (orted)c(b)m(y)i(the)h(FITS)e(Standard)g(do)s(cumen)m(t,)0 4989 y(uses)38 b(the)g(TDIMn)g(k)m(eyw)m(ord.)65 b(F)-8 b(or)39 b(example,)i(if)d(TF)m(ORMn)g(=)g('60A')h(and)f(TDIMn)g(=)g ('\(12,5\)')i(then)e(that)0 5102 y(column)30 b(will)h(b)s(e)f(in)m (terpreted)g(as)h(con)m(taining)h(an)e(arra)m(y)h(of)g(5)f(strings,)h (eac)m(h)g(12)g(c)m(haracters)h(long.)0 5262 y(FITSIO)40 b(also)i(supp)s(orts)d(a)i(lo)s(cal)h(con)m(v)m(en)m(tion)h(for)e(the)g (format)h(of)f(the)g(TF)m(ORMn)g(k)m(eyw)m(ord)g(v)-5 b(alue)42 b(of)f(the)0 5375 y(form)h('rAw')g(where)g('r')g(is)h(an)f (in)m(teger)i(sp)s(ecifying)e(the)g(total)j(width)c(in)h(c)m(haracters) i(of)f(the)f(column,)k(and)0 5488 y('w')36 b(is)g(an)g(in)m(teger)h(sp) s(ecifying)f(the)g(\(\014xed\))g(length)h(of)f(an)g(individual)f(unit)h (string)f(within)h(the)g(v)m(ector.)59 b(F)-8 b(or)0 5601 y(example,)47 b(TF)m(ORM1)d(=)f('120A10')j(w)m(ould)d(indicate)h (that)f(the)h(binary)e(table)i(column)f(is)g(120)h(c)m(haracters)0 5714 y(wide)32 b(and)g(consists)h(of)g(12)g(10-c)m(haracter)i(length)e (strings.)47 b(This)31 b(con)m(v)m(en)m(tion)k(is)d(recognized)i(b)m(y) e(the)h(FITSIO)p eop end %%Page: 23 29 TeXDict begin 23 28 bop 0 299 a Fg(4.12.)73 b(LOCAL)29 b(FITS)h(CONVENTIONS)f(SUPPOR)-8 b(TED)29 b(BY)i(FITSIO)1168 b Fi(23)0 555 y(subroutines)40 b(that)h(read)g(or)g(write)g(strings)f (in)h(binary)f(tables.)73 b(The)40 b(Binary)h(T)-8 b(able)42 b(de\014nition)e(do)s(cumen)m(t)0 668 y(sp)s(eci\014es)31 b(that)i(other)e(optional)i(c)m(haracters)g(ma)m(y)g(follo)m(w)g(the)e (datat)m(yp)s(e)i(co)s(de)f(in)f(the)h(TF)m(ORM)g(k)m(eyw)m(ord,)h(so)0 781 y(this)j(lo)s(cal)i(con)m(v)m(en)m(tion)h(is)e(in)f(compliance)i (with)e(the)h(FITS)f(standard,)h(although)g(other)g(FITS)f(readers)h (are)0 894 y(not)31 b(required)e(to)i(recognize)h(this)f(con)m(v)m(en)m (tion.)0 1183 y Fb(4.12.3)113 b(Keyw)m(ord)37 b(Units)h(Strings)0 1402 y Fi(One)f(de\014ciency)h(of)g(the)g(curren)m(t)g(FITS)f(Standard) f(is)i(that)h(it)f(do)s(es)f(not)h(de\014ne)f(a)i(sp)s(eci\014c)e(con)m (v)m(en)m(tion)j(for)0 1515 y(recording)30 b(the)g(ph)m(ysical)h(units) f(of)g(a)g(k)m(eyw)m(ord)h(v)-5 b(alue.)41 b(The)30 b(TUNITn)f(k)m(eyw) m(ord)h(can)g(b)s(e)g(used)f(to)i(sp)s(ecify)f(the)0 1628 y(ph)m(ysical)36 b(units)f(of)g(the)h(v)-5 b(alues)36 b(in)f(a)g(table)i(column,)f(but)f(there)g(is)h(no)f(analogous)i(con)m (v)m(en)m(tion)g(for)e(k)m(eyw)m(ord)0 1741 y(v)-5 b(alues.)42 b(The)30 b(commen)m(t)h(\014eld)g(of)f(the)h(k)m(eyw)m(ord)g(is)g (often)g(used)f(for)g(this)g(purp)s(ose,)g(but)f(the)i(units)f(are)h (usually)0 1854 y(not)g(sp)s(eci\014ed)e(in)h(a)h(w)m(ell)g(de\014ned)f (format)g(that)h(FITS)f(readers)g(can)h(easily)g(recognize)h(and)e (extract.)0 2014 y(T)-8 b(o)28 b(solv)m(e)h(this)e(de\014ciency)-8 b(,)30 b(FITSIO)c(uses)h(a)h(lo)s(cal)h(con)m(v)m(en)m(tion)h(in)d (whic)m(h)g(the)h(k)m(eyw)m(ord)g(units)f(are)h(enclosed)g(in)0 2127 y(square)20 b(brac)m(k)m(ets)j(as)e(the)f(\014rst)g(tok)m(en)i(in) f(the)f(k)m(eyw)m(ord)i(commen)m(t)f(\014eld;)j(more)d(sp)s (eci\014cally)-8 b(,)24 b(the)d(op)s(ening)f(square)0 2240 y(brac)m(k)m(et)28 b(immediately)g(follo)m(ws)f(the)g(slash)f('/') h(commen)m(t)h(\014eld)e(delimiter)h(and)f(a)g(single)h(space)g(c)m (haracter.)41 b(The)0 2352 y(follo)m(wing)32 b(examples)f(illustrate)g (k)m(eyw)m(ords)g(that)g(use)f(this)g(con)m(v)m(en)m(tion:)0 2602 y Fe(EXPOSURE=)713 b(1800.0)47 b(/)g([s])g(elapsed)f(exposure)f (time)0 2715 y(V_HELIO)h(=)763 b(16.23)47 b(/)g([km)g(s**\(-1\)])e (heliocentric)g(velocity)0 2828 y(LAMBDA)94 b(=)763 b(5400.)47 b(/)g([angstrom])e(central)h(wavelength)0 2941 y(FLUX)190 b(=)47 b(4.9033487787637465E-30)42 b(/)47 b([J/cm**2/s])e(average)h (flux)0 3191 y Fi(In)28 b(general,)h(the)g(units)e(named)h(in)g(the)h (IA)m(U\(1988\))i(St)m(yle)e(Guide)f(are)h(recommended,)f(with)g(the)h (main)f(excep-)0 3304 y(tion)j(that)g(the)f(preferred)g(unit)f(for)i (angle)g(is)f('deg')i(for)e(degrees.)0 3464 y(The)24 b(FTPUNT)g(and)g(FTGUNT)h(subroutines)f(in)g(FITSIO)f(write)i(and)f (read,)i(resp)s(ectiv)m(ely)-8 b(,)28 b(the)c(k)m(eyw)m(ord)h(unit)0 3577 y(strings)30 b(in)g(an)h(existing)g(k)m(eyw)m(ord.)0 3866 y Fb(4.12.4)113 b(HIERAR)m(CH)34 b(Con)m(v)m(en)m(tion)k(for)f (Extended)h(Keyw)m(ord)f(Names)0 4085 y Fi(CFITSIO)k(supp)s(orts)g(the) i(HIERAR)m(CH)g(k)m(eyw)m(ord)g(con)m(v)m(en)m(tion)i(whic)m(h)e(allo)m (ws)h(k)m(eyw)m(ord)f(names)g(that)h(are)0 4198 y(longer)34 b(then)e(8)i(c)m(haracters)g(and)f(ma)m(y)h(con)m(tain)g(the)f(full)g (range)g(of)h(prin)m(table)f(ASCI)s(I)e(text)j(c)m(haracters.)51 b(This)0 4311 y(con)m(v)m(en)m(tion)39 b(w)m(as)f(dev)m(elop)s(ed)f(at) h(the)f(Europ)s(ean)f(Southern)g(Observ)-5 b(atory)37 b(\(ESO\))f(to)i(supp)s(ort)d(hierarc)m(hical)0 4424 y(FITS)30 b(k)m(eyw)m(ord)g(suc)m(h)h(as:)0 4674 y Fe(HIERARCH)46 b(ESO)g(INS)h(FOCU)g(POS)g(=)g(-0.00002500)e(/)j(Focus)e(position)0 4924 y Fi(Basically)-8 b(,)55 b(this)47 b(con)m(v)m(en)m(tion)j(uses)d (the)h(FITS)f(k)m(eyw)m(ord)h('HIERAR)m(CH')h(to)f(indicate)h(that)f (this)f(con)m(v)m(en-)0 5036 y(tion)e(is)f(b)s(eing)g(used,)j(then)d (the)g(actual)i(k)m(eyw)m(ord)e(name)h(\()p Fe('ESO)i(INS)f(FOCU)h (POS')c Fi(in)h(this)g(example\))h(b)s(e-)0 5149 y(gins)40 b(in)f(column)g(10)i(and)e(can)h(con)m(tain)g(an)m(y)g(prin)m(table)g (ASCI)s(I)e(text)j(c)m(haracters,)i(including)d(spaces.)68 b(The)0 5262 y(equals)44 b(sign)h(marks)e(the)h(end)g(of)g(the)g(k)m (eyw)m(ord)h(name)f(and)f(is)i(follo)m(w)m(ed)g(b)m(y)f(the)g(usual)g (v)-5 b(alue)45 b(and)e(com-)0 5375 y(men)m(t)31 b(\014elds)f(just)g (as)h(in)f(standard)g(FITS)g(k)m(eyw)m(ords.)41 b(F)-8 b(urther)30 b(details)i(of)f(this)f(con)m(v)m(en)m(tion)j(are)e (describ)s(ed)e(at)0 5488 y(h)m(ttp://\014ts.gsfc.nasa.go)m (v/registry/hierarc)m(h)p 1659 5488 28 4 v 38 w(k)m(eyw)m(ord.h)m(tml)f (and)f(in)g(Section)g(4.4)h(of)g(the)f(ESO)f(Data)j(In)m(ter-)0 5601 y(face)c(Con)m(trol)f(Do)s(cumen)m(t)h(that)g(is)f(link)m(ed)g(to) g(from)g(h)m(ttp://arc)m(hiv)m(e.eso.org/cms/to)s(ols-)q(do)s(cumen)m (tati)q(on/eso)q(-)0 5714 y(data-in)m(terface-con)m(trol.h)m(tml.)p eop end %%Page: 24 30 TeXDict begin 24 29 bop 0 299 a Fi(24)1277 b Fg(CHAPTER)29 b(4.)72 b(FITSIO)29 b(CONVENTIONS)g(AND)i(GUIDELINES)0 555 y Fi(This)43 b(con)m(v)m(en)m(tion)k(allo)m(ws)f(a)e(m)m(uc)m(h)h (broader)e(range)i(of)f(k)m(eyw)m(ord)h(names)f(than)h(is)f(allo)m(w)m (ed)i(b)m(y)e(the)h(FITS)0 668 y(Standard.)40 b(Here)30 b(are)h(more)g(examples)g(of)f(suc)m(h)g(k)m(eyw)m(ords:)0 941 y Fe(HIERARCH)46 b(LongKeyword)e(=)k(47.5)e(/)i(Keyword)e(has)h(>)g (8)g(characters,)e(and)i(mixed)f(case)0 1054 y(HIERARCH)g(XTE$TEMP)f(=) j(98.6)e(/)i(Keyword)d(contains)h(the)h('$')g(character)0 1167 y(HIERARCH)f(Earth)g(is)h(a)h(star)e(=)i(F)f(/)h(Keyword)d (contains)h(embedded)f(spaces)0 1440 y Fi(CFITSIO)40 b(will)i(transparen)m(tly)g(read)g(and)f(write)g(these)i(k)m(eyw)m (ords,)i(so)d(application)h(programs)e(do)g(not)h(in)0 1553 y(general)33 b(need)f(to)h(kno)m(w)f(an)m(ything)h(ab)s(out)f(the) g(sp)s(eci\014c)g(implemen)m(tation)i(details)f(of)g(the)f(HIERAR)m(CH) g(con-)0 1666 y(v)m(en)m(tion.)50 b(In)32 b(particular,)j(application)f (programs)e(do)h(not)h(need)e(to)i(sp)s(ecify)f(the)g(`HIERAR)m(CH')h (part)f(of)g(the)0 1779 y(k)m(eyw)m(ord)g(name)f(when)g(reading)g(or)g (writing)h(k)m(eyw)m(ords)f(\(although)h(it)g(ma)m(y)g(b)s(e)f (included)f(if)i(desired\).)46 b(When)0 1892 y(writing)35 b(a)g(k)m(eyw)m(ord,)h(CFITSIO)d(\014rst)h(c)m(hec)m(ks)i(to)f(see)g (if)g(the)g(k)m(eyw)m(ord)g(name)f(is)h(legal)h(as)f(a)g(standard)f (FITS)0 2005 y(k)m(eyw)m(ord)k(\(no)g(more)f(than)h(8)g(c)m(haracters)h (long)f(and)f(con)m(taining)i(only)e(letters,)k(digits,)f(or)e(a)g(min) m(us)e(sign)i(or)0 2117 y(underscore\).)68 b(If)39 b(so)h(it)g(writes)g (it)g(as)f(a)h(standard)f(FITS)g(k)m(eyw)m(ord,)k(otherwise)d(it)g (uses)f(the)h(hierarc)m(h)f(con-)0 2230 y(v)m(en)m(tion)34 b(to)f(write)g(the)f(k)m(eyw)m(ord.)48 b(The)32 b(maxim)m(um)g(k)m(eyw) m(ord)h(name)f(length)h(is)g(67)g(c)m(haracters,)i(whic)m(h)d(lea)m(v)m (es)0 2343 y(only)c(1)h(space)g(for)f(the)h(v)-5 b(alue)29 b(\014eld.)39 b(A)29 b(more)f(practical)i(limit)f(is)g(ab)s(out)f(40)h (c)m(haracters,)i(whic)m(h)d(lea)m(v)m(es)i(enough)0 2456 y(ro)s(om)e(for)h(most)f(k)m(eyw)m(ord)h(v)-5 b(alues.)41 b(CFITSIO)27 b(returns)g(an)h(error)h(if)f(there)h(is)f(not)h(enough)f (ro)s(om)h(for)f(b)s(oth)g(the)0 2569 y(k)m(eyw)m(ord)k(name)f(and)f (the)i(k)m(eyw)m(ord)f(v)-5 b(alue)32 b(on)f(the)h(80-c)m(haracter)h (card,)f(except)g(for)f(string-v)-5 b(alued)32 b(k)m(eyw)m(ords)0 2682 y(whic)m(h)h(are)g(simply)f(truncated)h(so)g(that)h(the)f(closing) h(quote)g(c)m(haracter)g(falls)f(in)g(column)g(80.)49 b(In)32 b(the)h(curren)m(t)0 2795 y(implemen)m(tation,)e(CFITSIO)c (preserv)m(es)i(the)g(case)h(of)f(the)g(letters)h(when)e(writing)h(the) g(k)m(eyw)m(ord)g(name,)g(but)f(it)0 2908 y(is)d(case-insensitiv)m(e)i (when)d(reading)h(or)g(searc)m(hing)h(for)f(a)g(k)m(eyw)m(ord.)40 b(The)24 b(curren)m(t)h(implemen)m(tation)h(allo)m(ws)h(an)m(y)0 3021 y(ASCI)s(I)i(text)j(c)m(haracter)h(\(ASCI)s(I)c(32)j(to)f(ASCI)s (I)f(126\))i(in)f(the)g(k)m(eyw)m(ord)g(name)g(except)h(for)e(the)h ('=')g(c)m(haracter.)0 3134 y(A)f(space)h(is)g(also)g(required)f(on)g (either)h(side)f(of)h(the)f(equal)h(sign.)0 3483 y Fd(4.13)136 b(Optimizing)45 b(Co)t(de)g(for)h(Maxim)l(um)f(Pro)t(cessing)g(Sp)t (eed)0 3736 y Fi(CFITSIO)22 b(has)h(b)s(een)f(carefully)i(designed)f (to)h(obtain)g(the)f(highest)h(p)s(ossible)e(sp)s(eed)h(when)f(reading) h(and)g(writing)0 3849 y(FITS)33 b(\014les.)51 b(In)33 b(order)h(to)g(ac)m(hiev)m(e)i(the)e(b)s(est)g(p)s(erformance,)g(ho)m (w)m(ev)m(er,)i(application)g(programmers)d(m)m(ust)h(b)s(e)0 3962 y(careful)24 b(to)h(call)g(the)f(CFITSIO)f(routines)g (appropriately)i(and)e(in)h(an)f(e\016cien)m(t)j(sequence;)h (inappropriate)c(usage)0 4075 y(of)31 b(CFITSIO)d(routines)j(can)f (greatly)i(slo)m(w)f(do)m(wn)f(the)h(execution)g(sp)s(eed)f(of)g(a)h (program.)0 4235 y(The)f(maxim)m(um)h(p)s(ossible)f(I/O)h(sp)s(eed)f (of)h(CFITSIO)e(dep)s(ends)g(of)i(course)g(on)f(the)h(t)m(yp)s(e)g(of)g (computer)g(system)0 4348 y(that)j(it)g(is)g(running)d(on.)50 b(T)-8 b(o)34 b(get)h(a)f(general)g(idea)g(of)g(what)f(data)i(I/O)e(sp) s(eeds)f(are)i(p)s(ossible)f(on)h(a)g(particular)0 4461 y(mac)m(hine,)j(build)e(the)g(sp)s(eed.c)g(program)g(that)h(is)g (distributed)e(with)h(CFITSIO)f(\(t)m(yp)s(e)i('mak)m(e)g(sp)s(eed')f (in)g(the)0 4574 y(CFITSIO)e(directory\).)54 b(This)33 b(diagnostic)j(program)e(measures)h(the)f(sp)s(eed)g(of)g(writing)h (and)f(reading)g(bac)m(k)i(a)0 4687 y(test)31 b(FITS)f(image,)i(a)f (binary)e(table,)j(and)d(an)i(ASCI)s(I)e(table.)0 4847 y(The)k(follo)m(wing)h(2)g(sections)g(pro)m(vide)g(some)f(bac)m (kground)g(on)h(ho)m(w)f(CFITSIO)f(in)m(ternally)i(manages)g(the)f (data)0 4960 y(I/O)g(and)g(describ)s(es)f(some)i(strategies)h(that)f (ma)m(y)g(b)s(e)e(used)h(to)h(optimize)g(the)g(pro)s(cessing)f(sp)s (eed)f(of)h(soft)m(w)m(are)0 5073 y(that)e(uses)f(CFITSIO.)0 5379 y Fb(4.13.1)113 b(Bac)m(kground)38 b(Information:)50 b(Ho)m(w)37 b(CFITSIO)h(Manages)h(Data)f(I/O)0 5601 y Fi(Man)m(y)22 b(CFITSIO)e(op)s(erations)i(in)m(v)m(olv)m(e)i (transferring)d(only)h(a)g(small)g(n)m(um)m(b)s(er)f(of)h(b)m(ytes)g (to)g(or)g(from)f(the)h(FITS)f(\014le)0 5714 y(\(e.g,)31 b(reading)e(a)g(k)m(eyw)m(ord,)h(or)f(writing)g(a)g(ro)m(w)g(in)f(a)h (table\);)i(it)f(w)m(ould)e(b)s(e)g(v)m(ery)i(ine\016cien)m(t)g(to)f (ph)m(ysically)h(read)p eop end %%Page: 25 31 TeXDict begin 25 30 bop 0 299 a Fg(4.13.)73 b(OPTIMIZING)29 b(CODE)h(F)m(OR)h(MAXIMUM)g(PR)m(OCESSING)f(SPEED)971 b Fi(25)0 555 y(or)32 b(write)h(suc)m(h)f(small)g(blo)s(c)m(ks)h(of)f (data)h(directly)g(in)f(the)g(FITS)g(\014le)g(on)g(disk,)h(therefore)f (CFITSIO)f(main)m(tains)0 668 y(a)38 b(set)g(of)g(in)m(ternal)h (Input{Output)c(\(IO\))j(bu\013ers)f(in)g(RAM)h(memory)g(that)g(eac)m (h)h(con)m(tain)g(one)f(FITS)f(blo)s(c)m(k)0 781 y(\(2880)27 b(b)m(ytes\))f(of)f(data.)40 b(Whenev)m(er)25 b(CFITSIO)f(needs)g(to)i (access)g(data)g(in)f(the)g(FITS)f(\014le,)j(it)e(\014rst)f(transfers)h (the)0 894 y(FITS)30 b(blo)s(c)m(k)h(con)m(taining)h(those)f(b)m(ytes)g (in)m(to)g(one)g(of)f(the)h(IO)f(bu\013ers)f(in)h(memory)-8 b(.)42 b(The)30 b(next)g(time)h(CFITSIO)0 1007 y(needs)36 b(to)g(access)i(b)m(ytes)e(in)g(the)g(same)h(blo)s(c)m(k)f(it)h(can)f (then)g(go)h(to)f(the)h(fast)f(IO)f(bu\013er)g(rather)h(than)g(using)g (a)0 1120 y(m)m(uc)m(h)c(slo)m(w)m(er)i(system)e(disk)g(access)h (routine.)46 b(The)32 b(n)m(um)m(b)s(er)f(of)h(a)m(v)-5 b(ailable)35 b(IO)d(bu\013ers)f(is)h(determined)g(b)m(y)g(the)0 1233 y(NIOBUF)f(parameter)g(\(in)f(\014tsio2.h\))h(and)f(is)h(curren)m (tly)f(set)h(to)g(40.)0 1393 y(Whenev)m(er)24 b(CFITSIO)f(reads)g(or)h (writes)g(data)g(it)h(\014rst)e(c)m(hec)m(ks)i(to)g(see)f(if)g(that)g (blo)s(c)m(k)h(of)f(the)g(FITS)f(\014le)g(is)h(already)0 1506 y(loaded)33 b(in)m(to)g(one)f(of)g(the)g(IO)g(bu\013ers.)44 b(If)32 b(not,)h(and)e(if)h(there)g(is)g(an)g(empt)m(y)h(IO)e(bu\013er) g(a)m(v)-5 b(ailable,)35 b(then)d(it)h(will)0 1619 y(load)g(that)h(blo) s(c)m(k)f(in)m(to)g(the)g(IO)g(bu\013er)e(\(when)h(reading)h(a)g(FITS)f (\014le\))h(or)g(will)g(initialize)i(a)e(new)f(blo)s(c)m(k)i(\(when)0 1732 y(writing)j(to)h(a)g(FITS)f(\014le\).)62 b(If)37 b(all)h(the)g(IO)e(bu\013ers)h(are)g(already)h(full,)h(it)f(m)m(ust)g (decide)f(whic)m(h)g(one)h(to)g(reuse)0 1844 y(\(generally)c(the)f(one) g(that)g(has)f(b)s(een)g(accessed)i(least)f(recen)m(tly\),)i(and)d (\015ush)f(the)i(con)m(ten)m(ts)h(bac)m(k)g(to)f(disk)f(if)g(it)0 1957 y(has)e(b)s(een)g(mo)s(di\014ed)f(b)s(efore)h(loading)h(the)g(new) f(blo)s(c)m(k.)0 2118 y(The)g(one)g(ma)5 b(jor)30 b(exception)i(to)f (the)f(ab)s(o)m(v)m(e)h(pro)s(cess)f(o)s(ccurs)g(whenev)m(er)g(a)g (large)i(con)m(tiguous)f(set)g(of)f(b)m(ytes)h(are)0 2230 y(accessed,)37 b(as)d(migh)m(t)i(o)s(ccur)e(when)f(reading)i(or)f (writing)g(a)h(FITS)f(image.)54 b(In)34 b(this)g(case)h(CFITSIO)e(b)m (ypasses)0 2343 y(the)i(in)m(ternal)h(IO)f(bu\013ers)f(and)g(simply)h (reads)g(or)g(writes)h(the)f(desired)g(b)m(ytes)g(directly)h(in)f(the)g (disk)g(\014le)g(with)0 2456 y(a)i(single)g(call)g(to)g(a)g(lo)m(w-lev) m(el)i(\014le)d(read)g(or)h(write)f(routine.)58 b(The)36 b(minim)m(um)g(threshold)f(for)h(the)h(n)m(um)m(b)s(er)e(of)0 2569 y(b)m(ytes)27 b(to)g(read)f(or)g(write)g(this)g(w)m(a)m(y)i(is)e (set)g(b)m(y)h(the)f(MINDIRECT)g(parameter)g(and)g(is)g(curren)m(tly)g (set)h(to)g(3)g(FITS)0 2682 y(blo)s(c)m(ks)36 b(=)g(8640)i(b)m(ytes.)58 b(This)35 b(is)h(the)g(most)g(e\016cien)m(t)i(w)m(a)m(y)f(to)g(read)e (or)h(write)h(large)g(c)m(h)m(unks)e(of)h(data.)59 b(Note)0 2795 y(that)34 b(this)f(fast)h(direct)g(IO)f(pro)s(cess)f(is)i(not)f (applicable)i(when)d(accessing)j(columns)e(of)h(data)g(in)f(a)g(FITS)g (table)0 2908 y(b)s(ecause)f(the)h(b)m(ytes)g(are)g(generally)g(not)g (con)m(tiguous)g(since)g(they)g(are)f(in)m(terlea)m(v)m(ed)j(b)m(y)e (the)f(other)h(columns)f(of)0 3021 y(data)i(in)e(the)h(table.)49 b(This)33 b(explains)g(wh)m(y)f(the)h(sp)s(eed)f(for)h(accessing)h (FITS)e(tables)i(is)f(generally)h(slo)m(w)m(er)g(than)0 3134 y(accessing)e(FITS)e(images.)0 3294 y(Giv)m(en)i(this)g(bac)m (kground)f(information,)h(the)g(general)g(strategy)h(for)e(e\016cien)m (tly)i(accessing)g(FITS)e(\014les)g(should)0 3407 y(no)m(w)36 b(b)s(e)g(apparen)m(t:)52 b(when)35 b(dealing)i(with)f(FITS)g(images,)j (read)d(or)g(write)g(large)i(c)m(h)m(unks)e(of)g(data)h(at)g(a)f(time)0 3520 y(so)30 b(that)h(the)f(direct)h(IO)e(mec)m(hanism)h(will)h(b)s(e)e (in)m(v)m(ok)m(ed;)j(when)d(accessing)j(FITS)d(headers)h(or)g(FITS)f (tables,)i(on)0 3633 y(the)k(other)g(hand,)g(once)g(a)g(particular)h (FITS)e(blo)s(c)m(k)h(has)f(b)s(een)g(loading)i(in)m(to)g(one)f(of)g (the)f(IO)h(bu\013ers,)g(try)f(to)0 3745 y(access)39 b(all)f(the)f(needed)g(information)h(in)f(that)h(blo)s(c)m(k)g(b)s (efore)f(it)h(gets)g(\015ushed)d(out)j(of)g(the)f(IO)g(bu\013er.)60 b(It)38 b(is)0 3858 y(imp)s(ortan)m(t)31 b(to)h(a)m(v)m(oid)g(the)f (situation)h(where)f(the)g(same)g(FITS)f(blo)s(c)m(k)i(is)f(b)s(eing)f (read)h(then)g(\015ushed)e(from)h(a)h(IO)0 3971 y(bu\013er)e(m)m (ultiple)i(times.)0 4131 y(The)f(follo)m(wing)i(section)f(giv)m(es)h (more)e(sp)s(eci\014c)h(suggestions)g(for)f(optimizing)i(the)e(use)g (of)h(CFITSIO.)0 4430 y Fb(4.13.2)113 b(Optimization)38 b(Strategies)0 4650 y Fi(1.)43 b(Because)32 b(the)f(data)g(in)g(FITS)f (\014les)h(is)g(alw)m(a)m(ys)h(stored)f(in)g("big-endian")h(b)m(yte)f (order,)g(where)f(the)h(\014rst)f(b)m(yte)0 4763 y(of)g(n)m(umeric)h(v) -5 b(alues)30 b(con)m(tains)i(the)e(most)h(signi\014can)m(t)g(bits)f (and)g(the)g(last)i(b)m(yte)e(con)m(tains)i(the)e(least)i(signi\014can) m(t)0 4876 y(bits,)e(CFITSIO)f(m)m(ust)h(sw)m(ap)g(the)g(order)f(of)h (the)h(b)m(ytes)f(when)f(reading)h(or)g(writing)g(FITS)g(\014les)g (when)f(running)0 4989 y(on)k(little-endian)i(mac)m(hines)f(\(e.g.,)i (Lin)m(ux)d(and)g(Microsoft)i(Windo)m(ws)e(op)s(erating)h(systems)g (running)d(on)j(PCs)0 5102 y(with)c(x86)h(CPUs\).)0 5262 y(On)i(fairly)h(new)f(CPUs)g(that)i(supp)s(ort)d("SSSE3")h(mac)m(hine)h (instructions)g(\(e.g.,)i(starting)f(with)e(In)m(tel)i(Core)f(2)0 5375 y(CPUs)21 b(in)h(2007,)j(and)d(in)f(AMD)i(CPUs)e(b)s(eginning)g (in)h(2011\))i(signi\014can)m(tly)f(faster)f(4-b)m(yte)h(and)e(8-b)m (yte)i(sw)m(apping)0 5488 y(algorithms)k(are)g(a)m(v)-5 b(ailable.)42 b(These)26 b(faster)h(b)m(yte)g(sw)m(apping)f(functions)g (are)h(not)g(used)e(b)m(y)i(default)f(in)g(CFITSIO)0 5601 y(\(b)s(ecause)c(of)f(the)h(p)s(oten)m(tial)g(co)s(de)g(p)s (ortablilit)m(y)g(issues\),)i(but)c(users)h(can)g(enable)h(them)f(on)h (supp)s(orted)d(platforms)0 5714 y(b)m(y)38 b(adding)f(the)h (appropriate)f(compiler)i(\015ags)e(\(-mssse3)i(with)e(gcc)i(or)f(icc)g (on)g(lin)m(ux\))g(when)e(compiling)j(the)p eop end %%Page: 26 32 TeXDict begin 26 31 bop 0 299 a Fi(26)1277 b Fg(CHAPTER)29 b(4.)72 b(FITSIO)29 b(CONVENTIONS)g(AND)i(GUIDELINES)0 555 y Fi(sw)m(appro)s(c.c)f(source)g(\014le,)g(whic)m(h)g(will)g(allo)m (w)i(the)e(compiler)g(to)h(generate)h(co)s(de)e(using)f(the)h(SSSE3)f (instruction)0 668 y(set.)41 b(A)28 b(con)m(v)m(enien)m(t)i(w)m(a)m(y)f (to)g(do)g(this)f(is)g(to)h(con\014gure)f(the)g(CFITSIO)f(library)h (with)g(the)g(follo)m(wing)i(command:)95 894 y Fe(>)96 b(./configure)44 b(--enable-ssse3)0 1121 y Fi(Note,)37 b(ho)m(w)m(ev)m(er,)h(that)d(a)g(binary)f(executable)j(\014le)e(that)g (is)g(created)h(using)e(these)h(faster)g(functions)g(will)g(only)0 1233 y(run)c(on)h(mac)m(hines)g(that)h(supp)s(ort)d(the)i(SSSE3)f(mac)m (hine)i(instructions.)45 b(It)33 b(will)f(crash)g(on)g(mac)m(hines)g (that)h(do)0 1346 y(not)e(supp)s(ort)d(them.)0 1507 y(F)-8 b(or)36 b(faster)f(2-b)m(yte)i(sw)m(aps)e(on)g(virtually)g(all)h (x86-64)h(CPUs)e(\(ev)m(en)h(those)g(that)f(do)g(not)h(supp)s(ort)d (SSSE3\),)j(a)0 1619 y(v)-5 b(arian)m(t)26 b(using)e(only)g(SSE2)g (instructions)h(exists.)39 b(SSE2)24 b(is)h(enabled)f(b)m(y)h(default)g (on)f(x86)p 3066 1619 28 4 v 34 w(64)h(CPUs)f(with)h(64-bit)0 1732 y(op)s(erating)30 b(systems)f(\(and)g(is)g(also)i(automatically)h (enabled)d(b)m(y)g(the)g({enable-ssse3)i(\015ag\).)41 b(When)30 b(running)d(on)0 1845 y(x86)p 143 1845 V 34 w(64)k(CPUs)g(with)f(32-bit)i(op)s(erating)g(systems,)f(these)g(faster) h(2-b)m(yte)g(sw)m(apping)f(algorithms)g(are)h(not)f(used)0 1958 y(b)m(y)f(default)h(in)f(CFITSIO,)f(but)h(can)g(b)s(e)g(enabled)g (explicitly)i(with:)0 2184 y Fe(./configure)45 b(--enable-sse2)0 2411 y Fi(Preliminary)f(testing)h(indicates)g(that)g(these)f(SSSE3)f (and)g(SSE2)g(based)h(b)m(yte-sw)m(apping)h(algorithms)g(can)0 2524 y(b)s(o)s(ost)31 b(the)h(CFITSIO)e(p)s(erformance)h(when)f (reading)i(or)f(writing)h(FITS)f(images)h(b)m(y)g(20\045)g(-)g(30\045)g (or)f(more.)45 b(It)0 2636 y(is)36 b(imp)s(ortan)m(t)g(to)g(note,)i(ho) m(w)m(ev)m(er,)h(that)d(compiler)g(optimization)i(m)m(ust)e(b)s(e)f (turned)f(on)i(\(e.g.,)j(b)m(y)d(using)f(the)0 2749 y(-O1)f(or)g(-O2)g (\015ags)g(in)g(gcc\))h(when)e(building)g(programs)h(that)g(use)g (these)g(fast)g(b)m(yte-sw)m(apping)h(algorithms)f(in)0 2862 y(order)d(to)h(reap)f(the)h(full)f(b)s(ene\014t)g(of)g(the)h (SSSE3)e(and)h(SSE2)g(instructions;)h(without)f(optimization,)j(the)e (co)s(de)0 2975 y(ma)m(y)f(actually)h(run)d(slo)m(w)m(er)i(than)f(when) g(using)g(more)g(traditional)i(b)m(yte-sw)m(apping)f(tec)m(hniques.)0 3135 y(2.)54 b(When)34 b(dealing)h(with)g(a)g(FITS)e(primary)h(arra)m (y)h(or)g(IMA)m(GE)g(extension,)i(it)e(is)f(more)h(e\016cien)m(t)h(to)f (read)g(or)0 3248 y(write)c(large)g(c)m(h)m(unks)f(of)g(the)h(image)g (at)h(a)e(time)h(\(at)h(least)f(3)g(FITS)f(blo)s(c)m(ks)g(=)g(8640)i(b) m(ytes\))f(so)g(that)g(the)f(direct)0 3361 y(IO)j(mec)m(hanism)h(will)f (b)s(e)g(used)g(as)g(describ)s(ed)g(in)g(the)g(previous)g(section.)51 b(Smaller)34 b(c)m(h)m(unks)f(of)g(data)h(are)g(read)0 3474 y(or)d(written)g(via)h(the)f(IO)f(bu\013ers,)g(whic)m(h)h(is)g (somewhat)g(less)g(e\016cien)m(t)i(b)s(ecause)e(of)g(the)g(extra)h(cop) m(y)f(op)s(eration)0 3587 y(and)26 b(additional)h(b)s(o)s(okk)m(eeping) g(steps)g(that)g(are)g(required.)39 b(In)26 b(principle)g(it)h(is)g (more)f(e\016cien)m(t)i(to)g(read)e(or)h(write)0 3700 y(as)i(big)g(an)g(arra)m(y)h(of)f(image)h(pixels)f(at)h(one)f(time)g (as)h(p)s(ossible,)f(ho)m(w)m(ev)m(er,)h(if)f(the)h(arra)m(y)f(b)s (ecomes)g(so)g(large)h(that)0 3813 y(the)i(op)s(erating)g(system)f (cannot)h(store)g(it)g(all)h(in)e(RAM,)h(then)f(the)h(p)s(erformance)f (ma)m(y)h(b)s(e)f(degraded)g(b)s(ecause)0 3926 y(of)g(the)f(increased)h (sw)m(apping)f(of)g(virtual)h(memory)f(to)h(disk.)0 4086 y(3.)51 b(When)33 b(dealing)i(with)e(FITS)g(tables,)j(the)e(most)g(imp) s(ortan)m(t)g(e\016ciency)g(factor)h(in)e(the)h(soft)m(w)m(are)h (design)f(is)0 4199 y(to)j(read)f(or)g(write)g(the)g(data)h(in)f(the)g (FITS)g(\014le)g(in)g(a)g(single)h(pass)f(through)f(the)h(\014le.)58 b(An)36 b(example)h(of)f(p)s(o)s(or)0 4312 y(program)g(design)h(w)m (ould)f(b)s(e)g(to)h(read)g(a)f(large,)k(3-column)d(table)g(b)m(y)g (sequen)m(tially)h(reading)f(the)f(en)m(tire)i(\014rst)0 4425 y(column,)25 b(then)f(going)h(bac)m(k)f(to)h(read)e(the)h(2nd)g (column,)h(and)e(\014nally)h(the)g(3rd)f(column;)j(this)e(ob)m(viously) g(requires)0 4538 y(3)h(passes)f(through)f(the)i(\014le)f(whic)m(h)g (could)h(triple)f(the)h(execution)g(time)g(of)g(an)f(I/O)g(limited)h (program.)38 b(F)-8 b(or)25 b(small)0 4650 y(tables)31 b(this)f(is)h(not)f(imp)s(ortan)m(t,)h(but)f(when)f(reading)h(m)m (ulti-megab)m(yte)j(sized)e(tables)g(these)g(ine\016ciencies)h(can)0 4763 y(b)s(ecome)d(signi\014can)m(t.)41 b(The)28 b(more)h(e\016cien)m (t)h(pro)s(cedure)d(in)i(this)f(case)i(is)e(to)i(read)e(or)h(write)g (only)f(as)h(man)m(y)g(ro)m(ws)0 4876 y(of)g(the)g(table)h(as)f(will)h (\014t)e(in)m(to)i(the)g(a)m(v)-5 b(ailable)31 b(in)m(ternal)f(I/O)f (bu\013ers,)f(then)h(access)h(all)g(the)f(necessary)g(columns)0 4989 y(of)i(data)h(within)e(that)i(range)f(of)g(ro)m(ws.)43 b(Then)29 b(after)j(the)f(program)g(is)g(completely)h(\014nished)e (with)g(the)i(data)f(in)0 5102 y(those)i(ro)m(ws)e(it)i(can)f(mo)m(v)m (e)i(on)e(to)g(the)h(next)f(range)g(of)g(ro)m(ws)g(that)h(will)f(\014t) g(in)g(the)g(bu\013ers,)f(con)m(tin)m(uing)i(in)f(this)0 5215 y(w)m(a)m(y)c(un)m(til)f(the)f(en)m(tire)i(\014le)f(has)f(b)s(een) g(pro)s(cessed.)39 b(By)27 b(using)f(this)h(pro)s(cedure)e(of)i (accessing)h(all)g(the)e(columns)h(of)0 5328 y(a)j(table)g(in)f (parallel)h(rather)f(than)g(sequen)m(tially)-8 b(,)32 b(eac)m(h)e(blo)s(c)m(k)g(of)g(the)f(FITS)g(\014le)g(will)g(only)h(b)s (e)e(read)i(or)f(written)0 5441 y(once.)0 5601 y(The)g(optimal)h(n)m (um)m(b)s(er)e(of)i(ro)m(ws)f(to)i(read)e(or)g(write)h(at)g(one)g(time) g(in)f(a)h(giv)m(en)g(table)h(dep)s(ends)c(on)j(the)f(width)g(of)0 5714 y(the)j(table)h(ro)m(w,)g(on)f(the)g(n)m(um)m(b)s(er)f(of)h(I/O)g (bu\013ers)f(that)i(ha)m(v)m(e)g(b)s(een)e(allo)s(cated)j(in)e(FITSIO,) f(and)h(also)h(on)f(the)p eop end %%Page: 27 33 TeXDict begin 27 32 bop 0 299 a Fg(4.13.)73 b(OPTIMIZING)29 b(CODE)h(F)m(OR)h(MAXIMUM)g(PR)m(OCESSING)f(SPEED)971 b Fi(27)0 555 y(n)m(um)m(b)s(er)27 b(of)i(other)f(FITS)g(\014les)g (that)h(are)g(op)s(en)f(at)h(the)g(same)g(time)g(\(since)g(one)g(I/O)f (bu\013er)f(is)i(alw)m(a)m(ys)h(reserv)m(ed)0 668 y(for)k(eac)m(h)h(op) s(en)f(FITS)f(\014le\).)53 b(F)-8 b(ortunately)g(,)37 b(a)e(FITSIO)e(routine)h(is)h(a)m(v)-5 b(ailable)36 b(that)f(will)f (return)g(the)g(optimal)0 781 y(n)m(um)m(b)s(er)e(of)i(ro)m(ws)g(for)g (a)g(giv)m(en)g(table:)49 b(call)35 b(ftgrsz\(unit,)g(nro)m(ws,)f (status\).)52 b(It)34 b(is)g(not)g(critical)h(to)g(use)e(exactly)0 894 y(the)f(v)-5 b(alue)32 b(of)f(nro)m(ws)g(returned)g(b)m(y)g(this)g (routine,)h(as)g(long)g(as)g(one)g(do)s(es)f(not)h(exceed)g(it.)45 b(Using)32 b(a)g(v)m(ery)f(small)0 1007 y(v)-5 b(alue)32 b(ho)m(w)m(ev)m(er)i(can)e(also)h(lead)f(to)h(p)s(o)s(or)e(p)s (erformance)g(b)s(ecause)h(of)g(the)g(o)m(v)m(erhead)h(from)f(the)g (larger)g(n)m(um)m(b)s(er)0 1120 y(of)f(subroutine)e(calls.)0 1280 y(The)36 b(optimal)h(n)m(um)m(b)s(er)f(of)g(ro)m(ws)h(returned)e (b)m(y)h(ftgrsz)h(is)g(v)-5 b(alid)37 b(only)f(as)h(long)g(as)g(the)f (application)i(program)0 1393 y(is)c(only)h(reading)g(or)f(writing)g (data)h(in)g(the)f(sp)s(eci\014ed)g(table.)54 b(An)m(y)34 b(other)h(calls)g(to)g(access)h(data)f(in)f(the)h(table)0 1506 y(header)26 b(w)m(ould)f(cause)i(additional)f(blo)s(c)m(ks)h(of)f (data)g(to)h(b)s(e)e(loaded)h(in)m(to)h(the)f(I/O)g(bu\013ers)f (displacing)h(data)g(from)0 1619 y(the)j(original)h(table,)g(and)e (should)f(b)s(e)h(a)m(v)m(oided)i(during)e(the)h(critical)h(p)s(erio)s (d)e(while)g(the)h(table)h(is)e(b)s(eing)g(read)h(or)0 1732 y(written.)0 1892 y(4.)39 b(Use)24 b(binary)f(table)h(extensions)g (rather)f(than)h(ASCI)s(I)e(table)i(extensions)g(for)f(b)s(etter)h (e\016ciency)h(when)d(dealing)0 2005 y(with)37 b(tabular)h(data.)62 b(The)37 b(I/O)g(to)h(ASCI)s(I)e(tables)i(is)g(slo)m(w)m(er)g(b)s (ecause)g(of)f(the)h(o)m(v)m(erhead)h(in)e(formatting)h(or)0 2118 y(parsing)30 b(the)h(ASCI)s(I)f(data)h(\014elds,)g(and)f(b)s (ecause)h(ASCI)s(I)e(tables)i(are)g(ab)s(out)g(t)m(wice)h(as)f(large)h (as)f(binary)f(tables)0 2230 y(with)g(the)h(same)f(information)h(con)m (ten)m(t.)0 2391 y(5.)64 b(Design)39 b(soft)m(w)m(are)g(so)g(that)f(it) h(reads)f(the)g(FITS)f(header)h(k)m(eyw)m(ords)g(in)g(the)g(same)h (order)e(in)h(whic)m(h)g(they)0 2503 y(o)s(ccur)33 b(in)g(the)g (\014le.)49 b(When)32 b(reading)i(k)m(eyw)m(ords,)g(FITSIO)e(searc)m (hes)i(forw)m(ard)e(starting)i(from)e(the)i(p)s(osition)f(of)0 2616 y(the)c(last)i(k)m(eyw)m(ord)e(that)h(w)m(as)g(read.)40 b(If)29 b(it)g(reac)m(hes)i(the)e(end)g(of)g(the)h(header)f(without)g (\014nding)f(the)h(k)m(eyw)m(ord,)h(it)0 2729 y(then)j(go)s(es)h(bac)m (k)g(to)h(the)e(start)h(of)g(the)g(header)f(and)g(con)m(tin)m(ues)h (the)g(searc)m(h)g(do)m(wn)f(to)h(the)g(p)s(osition)f(where)g(it)0 2842 y(started.)41 b(In)30 b(practice,)i(as)e(long)h(as)g(the)f(en)m (tire)i(FITS)d(header)h(can)h(\014t)f(at)h(one)g(time)g(in)f(the)g(a)m (v)-5 b(ailable)33 b(in)m(ternal)0 2955 y(I/O)g(bu\013ers,)h(then)f (the)h(header)f(k)m(eyw)m(ord)h(access)h(will)e(b)s(e)g(v)m(ery)h(fast) g(and)f(it)h(mak)m(es)g(little)h(di\013erence)f(whic)m(h)0 3068 y(order)c(they)g(are)h(accessed.)0 3228 y(6.)40 b(Av)m(oid)29 b(the)e(use)h(of)f(scaling)i(\(b)m(y)f(using)f(the)h (BSCALE)e(and)h(BZER)m(O)h(or)f(TSCAL)g(and)g(TZER)m(O)f(k)m(eyw)m (ords\))0 3341 y(in)35 b(FITS)f(\014les)g(since)i(the)f(scaling)h(op)s (erations)f(add)f(to)i(the)f(pro)s(cessing)f(time)i(needed)e(to)i(read) f(or)g(write)g(the)0 3454 y(data.)60 b(In)36 b(some)i(cases)f(it)g(ma)m (y)h(b)s(e)e(more)h(e\016cien)m(t)h(to)f(temp)s(orarily)g(turn)f(o\013) h(the)g(scaling)h(\(using)e(ftpscl)h(or)0 3567 y(fttscl\))32 b(and)d(then)h(read)h(or)f(write)h(the)f(ra)m(w)h(unscaled)f(v)-5 b(alues)31 b(in)f(the)g(FITS)g(\014le.)0 3727 y(7.)40 b(Av)m(oid)27 b(using)g(the)g('implicit)h(datat)m(yp)s(e)f(con)m(v)m (ersion')h(capabilit)m(y)h(in)d(FITSIO.)g(F)-8 b(or)28 b(instance,)g(when)e(reading)0 3840 y(a)f(FITS)e(image)j(with)e(BITPIX) g(=)g(-32)i(\(32-bit)g(\015oating)f(p)s(oin)m(t)f(pixels\),)j(read)d (the)h(data)g(in)m(to)g(a)g(single)g(precision)0 3953 y(\015oating)e(p)s(oin)m(t)e(data)i(arra)m(y)f(in)g(the)g(program.)37 b(F)-8 b(orcing)23 b(FITSIO)e(to)h(con)m(v)m(ert)i(the)e(data)g(to)h(a) f(di\013eren)m(t)g(datat)m(yp)s(e)0 4066 y(can)31 b(signi\014can)m(tly) g(slo)m(w)g(the)g(program.)0 4226 y(8.)57 b(Where)36 b(feasible,)i(design)e(FITS)f(binary)g(tables)h(using)f(v)m(ector)j (column)d(elemen)m(ts)i(so)f(that)g(the)g(data)h(are)0 4339 y(written)30 b(as)g(a)g(con)m(tiguous)h(set)f(of)g(b)m(ytes,)g (rather)g(than)f(as)h(single)g(elemen)m(ts)h(in)f(m)m(ultiple)g(ro)m (ws.)41 b(F)-8 b(or)30 b(example,)0 4452 y(it)36 b(is)g(faster)g(to)g (access)h(the)f(data)h(in)e(a)h(table)h(that)f(con)m(tains)h(a)f (single)g(ro)m(w)g(and)f(2)h(columns)f(with)h(TF)m(ORM)0 4565 y(k)m(eyw)m(ords)d(equal)h(to)g('10000E')h(and)e('10000J',)j(than) d(it)g(is)g(to)h(access)g(the)g(same)f(amoun)m(t)h(of)f(data)h(in)f(a)g (table)0 4678 y(with)40 b(10000)j(ro)m(ws)d(whic)m(h)h(has)f(columns)g (with)g(the)h(TF)m(ORM)g(k)m(eyw)m(ords)g(equal)g(to)g('1E')h(and)e ('1J'.)h(In)f(the)0 4791 y(former)27 b(case)i(the)f(10000)i(\015oating) f(p)s(oin)m(t)f(v)-5 b(alues)28 b(in)g(the)g(\014rst)f(column)h(are)g (all)h(written)f(in)f(a)h(con)m(tiguous)h(blo)s(c)m(k)0 4903 y(of)d(the)f(\014le)h(whic)m(h)f(can)h(b)s(e)f(read)g(or)g (written)h(quic)m(kly)-8 b(,)28 b(whereas)d(in)g(the)h(second)f(case)i (eac)m(h)g(\015oating)f(p)s(oin)m(t)f(v)-5 b(alue)0 5016 y(in)34 b(the)g(\014rst)f(column)g(is)h(in)m(terlea)m(v)m(ed)j(with)c (the)h(in)m(teger)i(v)-5 b(alue)34 b(in)g(the)g(second)g(column)f(of)h (the)g(same)h(ro)m(w)f(so)0 5129 y(CFITSIO)29 b(has)h(to)h(explicitly)h (mo)m(v)m(e)g(to)f(the)g(p)s(osition)f(of)h(eac)m(h)g(elemen)m(t)h(to)f (b)s(e)f(read)g(or)g(written.)0 5289 y(9.)52 b(Av)m(oid)35 b(the)g(use)e(of)i(v)-5 b(ariable)34 b(length)h(v)m(ector)h(columns)d (in)h(binary)g(tables,)i(since)e(an)m(y)h(reading)f(or)g(writing)0 5402 y(of)f(these)g(data)g(requires)f(that)h(CFITSIO)f(\014rst)f(lo)s (ok)j(up)d(or)i(compute)g(the)f(starting)i(address)e(of)g(eac)m(h)i(ro) m(w)f(of)0 5515 y(data)e(in)f(the)h(heap.)40 b(In)30 b(practice,)i(this)e(is)g(probably)g(not)h(a)f(signi\014can)m(t)i (e\016ciency)f(issue.)0 5675 y(10.)39 b(When)24 b(cop)m(ying)h(data)f (from)f(one)i(FITS)e(table)h(to)h(another,)g(it)g(is)f(faster)g(to)g (transfer)f(the)h(ra)m(w)g(b)m(ytes)h(instead)p eop end %%Page: 28 34 TeXDict begin 28 33 bop 0 299 a Fi(28)1277 b Fg(CHAPTER)29 b(4.)72 b(FITSIO)29 b(CONVENTIONS)g(AND)i(GUIDELINES)0 555 y Fi(of)26 b(reading)g(then)g(writing)g(eac)m(h)h(column)e(of)i (the)f(table.)40 b(The)25 b(FITSIO)g(subroutines)g(FTGTBS)g(and)h (FTPTBS)0 668 y(\(for)i(ASCI)s(I)f(tables\),)j(and)d(FTGTBB)i(and)e (FTPTBB)i(\(for)f(binary)f(tables\))i(will)g(p)s(erform)d(lo)m(w-lev)m (el)31 b(reads)d(or)0 781 y(writes)34 b(of)h(an)m(y)f(con)m(tiguous)i (range)f(of)f(b)m(ytes)h(in)f(a)h(table)g(extension.)53 b(These)34 b(routines)g(can)h(b)s(e)e(used)h(to)h(read)0 894 y(or)29 b(write)g(a)g(whole)g(ro)m(w)f(\(or)i(m)m(ultiple)f(ro)m (ws\))g(of)g(a)g(table)h(with)e(a)h(single)g(subroutine)f(call.)41 b(These)29 b(routines)g(are)0 1007 y(fast)38 b(b)s(ecause)f(they)h(b)m (ypass)f(all)h(the)g(usual)f(data)h(scaling,)j(error)c(c)m(hec)m(king)i (and)e(mac)m(hine)h(dep)s(enden)m(t)e(data)0 1120 y(con)m(v)m(ersion)41 b(that)g(is)e(normally)i(done)e(b)m(y)h(FITSIO,)f(and)g(they)h(allo)m (w)h(the)f(program)g(to)h(write)f(the)g(data)g(to)0 1233 y(the)34 b(output)g(\014le)g(in)g(exactly)i(the)e(same)h(b)m(yte)g (order.)51 b(F)-8 b(or)35 b(these)g(same)f(reasons,)i(use)e(of)g(these) h(routines)f(can)0 1346 y(b)s(e)f(somewhat)h(risky)f(b)s(ecause)g(no)g (v)-5 b(alidation)35 b(or)f(mac)m(hine)g(dep)s(enden)m(t)e(con)m(v)m (ersion)j(is)e(p)s(erformed)f(b)m(y)h(these)0 1458 y(routines.)40 b(In)27 b(general)h(these)h(routines)e(are)h(only)g(recommended)f(for)h (optimizing)h(critical)g(pieces)g(of)f(co)s(de)g(and)0 1571 y(should)e(only)i(b)s(e)f(used)f(b)m(y)i(programmers)e(who)h (thoroughly)h(understand)d(the)j(in)m(ternal)g(b)m(yte)g(structure)f (of)h(the)0 1684 y(FITS)i(tables)h(they)f(are)h(reading)g(or)f (writing.)0 1844 y(11.)41 b(Another)30 b(strategy)g(for)g(impro)m(ving) f(the)h(sp)s(eed)e(of)i(writing)g(a)f(FITS)g(table,)i(similar)f(to)g (the)f(previous)g(one,)0 1957 y(is)j(to)g(directly)h(construct)f(the)f (en)m(tire)i(b)m(yte)f(stream)g(for)g(a)g(whole)g(table)g(ro)m(w)g (\(or)g(m)m(ultiple)h(ro)m(ws\))f(within)f(the)0 2070 y(application)k(program)f(and)g(then)f(write)i(it)f(to)h(the)f(FITS)f (\014le)i(with)e(ftptbb.)51 b(This)33 b(a)m(v)m(oids)j(all)f(the)f(o)m (v)m(erhead)0 2183 y(normally)g(presen)m(t)g(in)f(the)h(column-orien)m (ted)h(CFITSIO)d(write)i(routines.)51 b(This)33 b(tec)m(hnique)h (should)f(only)h(b)s(e)0 2296 y(used)26 b(for)h(critical)i (applications,)g(b)s(ecause)d(it)i(mak)m(es)g(the)f(co)s(de)g(more)g (di\016cult)g(to)g(understand)e(and)i(main)m(tain,)0 2409 y(and)d(it)h(mak)m(es)h(the)f(co)s(de)g(more)f(system)h(dep)s (enden)m(t)f(\(e.g.,)k(do)c(the)h(b)m(ytes)g(need)g(to)g(b)s(e)f(sw)m (app)s(ed)g(b)s(efore)g(writing)0 2522 y(to)31 b(the)g(FITS)e (\014le?\).)0 2682 y(12.)53 b(Finally)-8 b(,)37 b(external)e(factors)h (suc)m(h)e(as)g(the)h(t)m(yp)s(e)f(of)h(magnetic)g(disk)f(con)m (troller)i(\(SCSI)d(or)i(IDE\),)g(the)f(size)0 2795 y(of)h(the)g(disk)g (cac)m(he,)j(the)d(a)m(v)m(erage)i(seek)f(sp)s(eed)e(of)h(the)g(disk,)h (the)f(amoun)m(t)h(of)f(disk)f(fragmen)m(tation,)k(and)d(the)0 2908 y(amoun)m(t)29 b(of)g(RAM)f(a)m(v)-5 b(ailable)31 b(on)e(the)f(system)h(can)g(all)g(ha)m(v)m(e)h(a)f(signi\014can)m(t)g (impact)h(on)e(o)m(v)m(erall)j(I/O)d(e\016ciency)-8 b(.)0 3021 y(F)g(or)36 b(critical)h(applications,)g(a)f(system)f (administrator)g(should)f(review)h(the)h(prop)s(osed)d(system)j(hardw)m (are)e(to)0 3134 y(iden)m(tify)d(an)m(y)g(p)s(oten)m(tial)g(I/O)g(b)s (ottlenec)m(ks.)p eop end %%Page: 29 35 TeXDict begin 29 34 bop 0 1225 a Ff(Chapter)65 b(5)0 1687 y Fl(Basic)77 b(In)-6 b(terface)77 b(Routines)0 2180 y Fi(This)27 b(section)h(de\014nes)f(a)h(basic)g(set)g(of)g (subroutines)e(that)i(can)g(b)s(e)f(used)g(to)h(p)s(erform)e(the)i (most)g(common)g(t)m(yp)s(es)0 2293 y(of)d(read)g(and)f(write)h(op)s (erations)g(on)g(FITS)f(\014les.)39 b(New)25 b(users)f(should)g(start)h (with)g(these)g(subroutines)f(and)g(then,)0 2406 y(as)33 b(needed,)h(explore)f(the)h(more)f(adv)-5 b(ance)33 b(routines)g (describ)s(ed)f(in)h(the)g(follo)m(wing)i(c)m(hapter)e(to)h(p)s(erform) e(more)0 2518 y(complex)f(or)f(sp)s(ecialized)i(op)s(erations.)0 2679 y(A)e(righ)m(t)g(arro)m(w)g(sym)m(b)s(ol)f(\()p Fa(>)p Fi(\))h(is)g(used)f(to)h(separate)h(the)e(input)g(parameters)h (from)f(the)h(output)f(parameters)h(in)0 2791 y(the)i(de\014nition)f (of)g(eac)m(h)i(routine.)44 b(This)30 b(sym)m(b)s(ol)i(is)f(not)h (actually)h(part)e(of)h(the)f(calling)i(sequence.)45 b(Note)32 b(that)0 2904 y(the)f(status)h(parameter)g(is)f(b)s(oth)g(an) g(input)f(and)h(an)g(output)g(parameter)h(and)e(m)m(ust)h(b)s(e)g (initialized)i(=)e(0)h(prior)0 3017 y(to)f(calling)h(the)f(FITSIO)e (subroutines.)0 3177 y(Refer)h(to)i(Chapter)d(9)i(for)f(the)h (de\014nition)f(of)g(all)i(the)e(parameters)h(used)e(b)m(y)i(these)g (in)m(terface)g(routines.)0 3525 y Fd(5.1)135 b(FITSIO)44 b(Error)h(Status)h(Routines)0 3773 y Fh(1)81 b Fi(Return)24 b(the)i(curren)m(t)f(v)m(ersion)h(n)m(um)m(b)s(er)e(of)i(the)f (\014tsio)h(library)-8 b(.)39 b(The)25 b(v)m(ersion)h(n)m(um)m(b)s(er)e (will)i(b)s(e)e(incremen)m(ted)227 3886 y(with)30 b(eac)m(h)i(new)e (release)h(of)g(CFITSIO.)382 4157 y Fe(FTVERS\()46 b(>)h(version\))0 4429 y Fh(2)81 b Fi(Return)45 b(the)i(descriptiv)m(e)g(text)g(string)g (corresp)s(onding)e(to)i(a)g(FITSIO)e(error)h(status)h(co)s(de.)89 b(The)46 b(30-)227 4541 y(c)m(haracter)32 b(length)f(string)f(con)m (tains)i(a)f(brief)f(description)g(of)g(the)h(cause)g(of)f(the)h (error.)382 4813 y Fe(FTGERR\(status,)44 b(>)j(errtext\))0 5084 y Fh(3)81 b Fi(Return)40 b(the)h(top)g(\(oldest\))h(80-c)m (haracter)i(error)c(message)i(from)f(the)g(in)m(ternal)g(FITSIO)f(stac) m(k)i(of)f(error)227 5197 y(messages)29 b(and)f(shift)g(an)m(y)g (remaining)g(messages)h(on)f(the)g(stac)m(k)i(up)d(one)h(lev)m(el.)42 b(An)m(y)28 b(FITSIO)f(error)h(will)227 5310 y(generate)h(one)e(or)g (more)h(messages)g(on)f(the)g(stac)m(k.)41 b(Call)28 b(this)f(routine)g(rep)s(eatedly)g(to)h(get)h(eac)m(h)f(message)227 5422 y(in)i(sequence.)41 b(The)30 b(error)g(stac)m(k)i(is)f(empt)m(y)f (when)g(a)g(blank)g(string)h(is)f(returned.)382 5694 y Fe(FTGMSG\()46 b(>)h(errmsg\))1905 5942 y Fi(29)p eop end %%Page: 30 36 TeXDict begin 30 35 bop 0 299 a Fi(30)1747 b Fg(CHAPTER)30 b(5.)111 b(BASIC)30 b(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 555 y Fh(4)81 b Fi(The)33 b(FTPMRK)h(routine)g(puts)g(an)g(in)m (visible)h(mark)m(er)f(on)g(the)h(CFITSIO)d(error)i(stac)m(k.)54 b(The)33 b(FTCMRK)227 668 y(routine)41 b(can)g(then)g(b)s(e)f(used)g (to)h(delete)h(an)m(y)f(more)g(recen)m(t)h(error)e(messages)i(on)f(the) g(stac)m(k,)k(bac)m(k)c(to)227 781 y(the)32 b(p)s(osition)f(of)g(the)g (mark)m(er.)43 b(This)31 b(preserv)m(es)g(an)m(y)g(older)h(error)e (messages)i(on)f(the)h(stac)m(k.)44 b(FTCMSG)227 894 y(simply)23 b(clears)g(the)g(en)m(tire)h(error)e(message)i(stac)m(k.)40 b(These)23 b(routines)f(are)h(called)h(without)f(an)m(y)g(argumen)m (ts.)382 1152 y Fe(FTPMRK)382 1265 y(FTCMRK)382 1378 y(FTCMSG)0 1637 y Fh(5)81 b Fi(Prin)m(t)30 b(out)h(the)g(error)f (message)i(corresp)s(onding)e(to)h(the)g(input)f(status)h(v)-5 b(alue)31 b(and)f(all)i(the)f(error)f(messages)227 1750 y(on)g(the)h(FITSIO)e(stac)m(k)i(to)g(the)g(sp)s(eci\014ed)e(\014le)i (stream)f(\(stream)h(can)g(b)s(e)e(either)i(the)f(string)g('STDOUT')227 1863 y(or)h('STDERR'\).)f(If)g(the)h(input)e(status)i(v)-5 b(alue)31 b(=)f(0)h(then)f(this)g(routine)g(do)s(es)g(nothing.)334 2121 y Fe(FTRPRT)46 b(\(stream,)g(>)h(status\))0 2380 y Fh(6)81 b Fi(W)-8 b(rite)39 b(an)f(80-c)m(haracter)j(message)e(to)g (the)f(FITSIO)f(error)h(stac)m(k.)65 b(Application)39 b(programs)f(should)f(not)227 2493 y(normally)31 b(write)f(to)i(the)e (stac)m(k,)i(but)e(there)g(ma)m(y)h(b)s(e)f(some)h(situations)g(where)f (this)g(is)h(desirable.)382 2751 y Fe(FTPMSG\(errmsg\))0 3085 y Fd(5.2)135 b(File)46 b(I/O)f(Routines)0 3325 y Fh(1)81 b Fi(Op)s(en)34 b(an)h(existing)i(FITS)d(\014le)i(with)f (readonly)h(or)f(readwrite)h(access.)58 b(This)34 b(routine)i(alw)m(a)m (ys)h(op)s(ens)e(the)227 3438 y(primary)30 b(arra)m(y)i(\(the)f (\014rst)f(HDU\))i(of)f(the)h(\014le,)f(and)f(do)s(es)h(not)g(mo)m(v)m (e)h(to)g(a)f(follo)m(wing)i(extension,)f(if)f(one)227 3551 y(w)m(as)c(sp)s(eci\014ed)f(as)g(part)h(of)f(the)h(\014lename.)39 b(Use)27 b(the)g(FTNOPN)f(routine)g(to)h(automatically)j(mo)m(v)m(e)e (to)f(the)227 3664 y(extension.)44 b(This)31 b(routine)g(will)h(also)g (op)s(en)f(IRAF)g(images)i(\(.imh)e(format)h(\014les\))g(and)e(ra)m(w)i (binary)e(data)227 3776 y(arra)m(ys)e(with)f(READONL)-8 b(Y)28 b(access)h(b)m(y)e(\014rst)g(con)m(v)m(erting)i(them)e(on)g(the) h(\015y)f(in)m(to)h(virtual)g(FITS)f(images.)227 3889 y(See)43 b(the)g(`Extended)f(File)i(Name)f(Syn)m(tax')g(c)m(hapter)g (for)f(more)h(details.)78 b(The)42 b(FTDK)m(OPN)h(routine)227 4002 y(simply)37 b(op)s(ens)g(the)h(sp)s(eci\014ed)f(\014le)h(without)f (trying)h(to)g(in)m(terpret)g(the)g(\014lename)g(using)f(the)h (extended)227 4115 y(\014lename)31 b(syn)m(tax.)382 4374 y Fe(FTOPEN\(unit,filename,rwm)o(ode)o(,)42 b(>)47 b (blocksize,status\))382 4487 y(FTDKOPN\(unit,filename,rw)o(mod)o(e,)42 b(>)47 b(blocksize,status\))0 4745 y Fh(2)81 b Fi(Op)s(en)24 b(an)i(existing)h(FITS)e(\014le)h(with)f(readonly)h(or)g(readwrite)g (access)h(and)f(mo)m(v)m(e)h(to)f(a)h(follo)m(wing)g(extension,)227 4858 y(if)38 b(one)g(w)m(as)g(sp)s(eci\014ed)g(as)g(part)f(of)h(the)h (\014lename.)63 b(\(e.g.,)42 b('\014lename.\014ts+2')c(or)g ('\014lename.\014ts[2]')i(will)227 4971 y(mo)m(v)m(e)e(to)g(the)e(3rd)g (HDU)i(in)e(the)h(\014le\).)60 b(Note)37 b(that)h(this)e(routine)h (di\013ers)f(from)g(FTOPEN)g(in)g(that)h(it)227 5084 y(do)s(es)30 b(not)h(ha)m(v)m(e)h(the)e(redundan)m(t)f(blo)s(c)m(ksize) j(argumen)m(t.)382 5342 y Fe(FTNOPN\(unit,filename,rwm)o(ode)o(,)42 b(>)47 b(status\))0 5601 y Fh(3)81 b Fi(Op)s(en)31 b(an)h(existing)h (FITS)f(\014le)g(with)g(readonly)h(or)f(readwrite)h(access)g(and)f (then)g(mo)m(v)m(e)i(to)f(the)g(\014rst)e(HDU)227 5714 y(con)m(taining)c(signi\014can)m(t)g(data,)g(if)e(a\))i(an)e(HDU)h (name)g(or)f(n)m(um)m(b)s(er)f(to)i(op)s(en)f(w)m(as)h(not)g (explicitly)h(sp)s(eci\014ed)p eop end %%Page: 31 37 TeXDict begin 31 36 bop 0 299 a Fg(5.2.)72 b(FILE)30 b(I/O)h(R)m(OUTINES)2693 b Fi(31)227 555 y(as)31 b(part)g(of)g(the)g (\014lename,)h(and)e(b\))h(if)g(the)g(FITS)f(\014le)h(con)m(tains)h(a)g (n)m(ull)e(primary)g(arra)m(y)i(\(i.e.,)h(NAXIS)d(=)227 668 y(0\).)41 b(In)26 b(this)i(case,)h(it)f(will)g(lo)s(ok)g(for)f(the) h(\014rst)e(IMA)m(GE)j(HDU)f(with)f(NAXIS)g(>)h(0,)g(or)g(the)f (\014rst)g(table)h(that)227 781 y(do)s(es)g(not)g(con)m(tain)g(the)g (strings)g(`GTI')g(\(Go)s(o)s(d)f(Time)h(In)m(terv)-5 b(al\))29 b(or)f(`OBST)-8 b(ABLE')28 b(in)f(the)h(EXTNAME)227 894 y(k)m(eyw)m(ord)37 b(v)-5 b(alue.)61 b(FTTOPN)36 b(is)g(similar,)j(except)f(it)f(will)g(mo)m(v)m(e)i(to)e(the)g(\014rst) f(signi\014can)m(t)i(table)f(HDU)227 1007 y(\(skipping)26 b(o)m(v)m(er)g(an)m(y)g(image)h(HDUs\))g(in)e(the)h(\014le)g(if)f(a)h (sp)s(eci\014c)g(HDU)g(name)g(or)g(n)m(um)m(b)s(er)e(is)i(not)f(sp)s (eci\014ed.)227 1120 y(FTIOPN)30 b(will)h(mo)m(v)m(e)h(to)f(the)f (\014rst)g(non-n)m(ull)g(image)i(HDU,)f(skipping)f(o)m(v)m(er)h(an)m(y) g(tables.)382 1376 y Fe(FTDOPN\(unit,filename,rwm)o(ode)o(,)42 b(>)47 b(status\))382 1489 y(FTTOPN\(unit,filename,rwm)o(ode)o(,)42 b(>)47 b(status\))382 1602 y(FTIOPN\(unit,filename,rwm)o(ode)o(,)42 b(>)47 b(status\))0 1858 y Fh(4)81 b Fi(Op)s(en)38 b(and)i(initialize)j (a)e(new)e(empt)m(y)i(FITS)f(\014le.)70 b(A)41 b(template)h(\014le)e (ma)m(y)h(also)g(b)s(e)f(sp)s(eci\014ed)g(to)h(de\014ne)227 1971 y(the)34 b(structure)e(of)h(the)h(new)e(\014le)h(\(see)h(section)g (4.2.4\).)51 b(The)33 b(FTDKINIT)g(routine)g(simply)f(creates)j(the)227 2084 y(sp)s(eci\014ed)30 b(\014le)g(without)h(trying)f(to)h(in)m (terpret)g(the)g(\014lename)f(using)g(the)h(extended)f(\014lename)h (syn)m(tax.)382 2340 y Fe(FTINIT\(unit,filename,blo)o(cks)o(ize,)41 b(>)48 b(status\))382 2453 y(FTDKINIT\(unit,filename,b)o(loc)o(ksiz)o (e,)42 b(>)47 b(status\))0 2709 y Fh(5)81 b Fi(Close)31 b(a)f(FITS)g(\014le)g(previously)g(op)s(ened)g(with)g(ftop)s(en)g(or)g (ftinit)382 2965 y Fe(FTCLOS\(unit,)44 b(>)k(status\))0 3221 y Fh(6)81 b Fi(Mo)m(v)m(e)32 b(to)f(a)g(sp)s(eci\014ed)f (\(absolute\))h(HDU)g(in)g(the)f(FITS)g(\014le)g(\(nhdu)f(=)h(1)h(for)f (the)g(FITS)g(primary)f(arra)m(y\))382 3478 y Fe(FTMAHD\(unit,nhdu,)43 b(>)k(hdutype,status\))0 3734 y Fh(7)81 b Fi(Create)30 b(a)f(primary)f(arra)m(y)i(\(if)g(none)f(already)g(exists\),)i(or)e (insert)g(a)h(new)f(IMA)m(GE)h(extension)g(immediately)227 3847 y(follo)m(wing)25 b(the)e(CHDU,)g(or)g(insert)g(a)g(new)g(Primary) f(Arra)m(y)h(at)h(the)f(b)s(eginning)f(of)h(the)g(\014le.)38 b(An)m(y)23 b(follo)m(wing)227 3960 y(extensions)29 b(in)g(the)g (\014le)f(will)h(b)s(e)f(shifted)h(do)m(wn)f(to)h(mak)m(e)h(ro)s(om)e (for)h(the)g(new)f(extension.)40 b(If)29 b(the)g(CHDU)227 4072 y(is)h(the)g(last)g(HDU)g(in)g(the)f(\014le)h(then)f(the)h(new)f (image)i(extension)f(will)g(simply)f(b)s(e)g(app)s(ended)f(to)i(the)g (end)227 4185 y(of)k(the)h(\014le.)52 b(One)33 b(can)h(force)h(a)g(new) e(primary)g(arra)m(y)i(to)g(b)s(e)e(inserted)h(at)h(the)f(b)s(eginning) f(of)h(the)h(FITS)227 4298 y(\014le)29 b(b)m(y)f(setting)i(status)e(=)h (-9)g(prior)e(to)j(calling)g(the)e(routine.)40 b(In)28 b(this)g(case)i(the)e(existing)i(primary)d(arra)m(y)227 4411 y(will)f(b)s(e)f(con)m(v)m(erted)i(to)g(an)e(IMA)m(GE)h (extension.)40 b(The)25 b(new)g(extension)i(\(or)f(primary)e(arra)m (y\))j(will)f(b)s(ecome)227 4524 y(the)32 b(CHDU.)f(The)g(FTI)s(IMGLL)f (routine)i(is)f(iden)m(tical)i(to)e(the)h(FTI)s(IMG)f(routine)g(except) h(that)f(the)h(4th)227 4637 y(parameter)25 b(\(the)g(length)g(of)f(eac) m(h)h(axis\))g(is)g(an)f(arra)m(y)h(of)f(64-bit)i(in)m(tegers)f(rather) f(than)g(an)g(arra)m(y)h(of)g(32-bit)227 4750 y(in)m(tegers.)382 5006 y Fe(FTIIMG\(unit,bitpix,naxis)o(,na)o(xes,)41 b(>)48 b(status\))382 5119 y(FTIIMGLL\(unit,bitpix,nax)o(is,)o(naxe)o(sll,)41 b(>)47 b(status\))0 5375 y Fh(8)81 b Fi(Insert)30 b(a)i(new)f(ASCI)s(I) f(T)-8 b(ABLE)31 b(extension)h(immediately)h(follo)m(wing)f(the)g (CHDU.)g(An)m(y)f(follo)m(wing)i(exten-)227 5488 y(sions)26 b(will)g(b)s(e)f(shifted)g(do)m(wn)g(to)h(mak)m(e)h(ro)s(om)e(for)h (the)f(new)g(extension.)40 b(If)25 b(there)h(are)g(no)g(other)f(follo)m (wing)227 5601 y(extensions)32 b(then)f(the)h(new)f(table)h(extension)g (will)g(simply)f(b)s(e)g(app)s(ended)f(to)i(the)f(end)g(of)h(the)f (\014le.)44 b(The)227 5714 y(new)33 b(extension)h(will)f(b)s(ecome)h (the)f(CHDU.)h(The)f(FTIT)-8 b(ABLL)33 b(routine)g(is)g(iden)m(tical)i (to)f(the)g(FTIT)-8 b(AB)p eop end %%Page: 32 38 TeXDict begin 32 37 bop 0 299 a Fi(32)1747 b Fg(CHAPTER)30 b(5.)111 b(BASIC)30 b(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)227 555 y Fi(routine)36 b(except)g(that)g(the)f(2nd)g(and)g(3rd)g (parameters)g(\(that)i(giv)m(e)g(the)e(size)h(of)g(the)f(table\))i(are) f(64-bit)227 668 y(in)m(tegers)43 b(rather)f(than)f(32-bit)i(in)m (tegers.)76 b(Under)41 b(normal)g(circumstances,)46 b(the)c(nro)m(ws)f (and)g(nro)m(wsll)227 781 y(paramen)m(ters)f(should)e(ha)m(v)m(e)j(a)f (v)-5 b(alue)40 b(of)f(0;)45 b(CFITSIO)38 b(will)h(automatically)k(up)s (date)38 b(the)i(n)m(um)m(b)s(er)e(of)227 894 y(ro)m(ws)31 b(as)f(data)h(is)g(written)f(to)h(the)g(table.)382 1158 y Fe(FTITAB\(unit,rowlen,nrows)o(,tf)o(ield)o(s,tt)o(ype)o(,tbc)o(ol,t) o(for)o(m,tu)o(nit,)o(ext)o(name)o(,)42 b(>)716 1271 y(status\))382 1384 y(FTITABLL\(unit,rowlenll,n)o(row)o(sll,)o(tfie)o (lds)o(,tty)o(pe,t)o(bco)o(l,tf)o(orm,)o(tun)o(it,e)o(xtna)o(me,)f(>) 716 1497 y(status\))0 1761 y Fh(9)81 b Fi(Insert)26 b(a)h(new)g(binary) f(table)h(extension)h(immediately)g(follo)m(wing)h(the)e(CHDU.)g(An)m (y)g(follo)m(wing)h(extensions)227 1874 y(will)39 b(b)s(e)f(shifted)g (do)m(wn)g(to)h(mak)m(e)g(ro)s(om)g(for)f(the)g(new)g(extension.)66 b(If)38 b(there)h(are)f(no)h(other)f(follo)m(wing)227 1987 y(extensions)f(then)g(the)f(new)g(bin)m(table)h(extension)h(will)f (simply)f(b)s(e)g(app)s(ended)e(to)k(the)e(end)g(of)h(the)g(\014le.)227 2100 y(The)23 b(new)g(extension)h(will)f(b)s(ecome)h(the)f(CHDU.)h(The) f(FTIBINLL)g(routine)g(is)g(iden)m(tical)i(to)f(the)g(FTIBIN)227 2213 y(routine)30 b(except)i(that)e(the)h(2nd)e(parameter)i(\(that)g (giv)m(es)g(the)g(length)f(of)h(the)f(table\))h(is)g(a)f(64-bit)i(in)m (teger)227 2325 y(rather)24 b(than)g(a)g(32-bit)h(in)m(teger.)40 b(Under)23 b(normal)h(circumstances,)i(the)e(nro)m(ws)f(and)h(nro)m (wsll)g(paramen)m(ters)227 2438 y(should)31 b(ha)m(v)m(e)i(a)f(v)-5 b(alue)32 b(of)f(0;)i(CFITSIO)d(will)i(automatically)j(up)s(date)30 b(the)i(n)m(um)m(b)s(er)e(of)i(ro)m(ws)g(as)g(data)g(is)227 2551 y(written)f(to)g(the)f(table.)382 2815 y Fe (FTIBIN\(unit,nrows,tfield)o(s,t)o(type)o(,tfo)o(rm,)o(tuni)o(t,ex)o (tna)o(me,v)o(arid)o(at)41 b(>)48 b(status\))382 2928 y(FTIBINLL\(unit,nrowsll,tf)o(iel)o(ds,t)o(type)o(,tf)o(orm,)o(tuni)o (t,e)o(xtna)o(me,v)o(ari)o(dat)41 b(>)48 b(status\))0 3380 y Fd(5.3)135 b(Keyw)l(ord)46 b(I/O)f(Routines)0 3624 y Fh(1)81 b Fi(Put)30 b(\(app)s(end\))f(an)h(80-c)m(haracter)j (record)e(in)m(to)g(the)g(CHU.)382 3888 y Fe(FTPREC\(unit,card,)43 b(>)k(status\))0 4152 y Fh(2)81 b Fi(Put)28 b(\(app)s(end\))g(a)h(new)g (k)m(eyw)m(ord)g(of)g(the)g(appropriate)g(datat)m(yp)s(e)h(in)m(to)g (the)f(CHU.)g(The)f(E)h(and)f(D)i(v)m(ersions)227 4265 y(of)24 b(this)f(routine)g(ha)m(v)m(e)h(the)g(added)e(feature)i(that)g (if)f(the)g('decimals')i(parameter)f(is)f(negativ)m(e,)k(then)c(the)g ('G')227 4378 y(displa)m(y)30 b(format)g(rather)f(then)g(the)h('E')f (format)h(will)g(b)s(e)f(used)f(when)h(constructing)h(the)f(k)m(eyw)m (ord)h(v)-5 b(alue,)227 4490 y(taking)27 b(the)g(absolute)g(v)-5 b(alue)26 b(of)h('decimals')g(for)f(the)h(precision.)39 b(This)26 b(will)g(suppress)e(trailing)k(zeros,)g(and)227 4603 y(will)37 b(use)g(a)g(\014xed)f(format)h(rather)g(than)f(an)h(exp) s(onen)m(tial)g(format,)i(dep)s(ending)c(on)i(the)g(magnitude)g(of)227 4716 y(the)31 b(v)-5 b(alue.)382 4980 y Fe(FTPKY[JKLS]\(unit,keyword)o (,ke)o(yval)o(,com)o(men)o(t,)42 b(>)47 b(status\))382 5093 y(FTPKY[EDFG]\(unit,keyword)o(,ke)o(yval)o(,dec)o(ima)o(ls,c)o (omme)o(nt,)41 b(>)48 b(status\))0 5357 y Fh(3)81 b Fi(Get)37 b(the)f(n)m(th)f(80-c)m(haracter)k(header)d(record)g(from)f(the)h(CHU.) h(The)e(\014rst)g(k)m(eyw)m(ord)i(in)e(the)h(header)g(is)g(at)227 5470 y(k)m(ey)p 365 5470 28 4 v 34 w(no)42 b(=)f(1;)49 b(if)42 b(k)m(ey)p 996 5470 V 34 w(no)g(=)f(0)i(then)e(this)h (subroutine)f(simple)h(mo)m(v)m(es)i(the)e(in)m(ternal)h(p)s(oin)m(ter) f(to)h(the)227 5583 y(b)s(eginning)35 b(of)h(the)g(header)f(so)h(that)g (subsequen)m(t)f(k)m(eyw)m(ord)h(op)s(erations)g(will)g(start)g(at)g (the)g(top)g(of)g(the)227 5696 y(header;)31 b(it)g(also)g(returns)e(a)i (blank)f(card)g(v)-5 b(alue)31 b(in)f(this)g(case.)p eop end %%Page: 33 39 TeXDict begin 33 38 bop 0 299 a Fg(5.4.)72 b(D)m(A)-8 b(T)g(A)32 b(I/O)f(R)m(OUTINES)2650 b Fi(33)382 555 y Fe(FTGREC\(unit,key_no,)42 b(>)48 b(card,status\))0 804 y Fh(4)81 b Fi(Get)31 b(a)g(k)m(eyw)m(ord)g(v)-5 b(alue)30 b(\(with)h(the)f(appropriate)h(datat)m(yp)s(e\))g(and)f(commen)m(t)i (from)e(the)g(CHU)382 1052 y Fe(FTGKY[EDJKLS]\(unit,keywo)o(rd,)41 b(>)48 b(keyval,comment,status\))0 1301 y Fh(5)81 b Fi(Delete)32 b(an)e(existing)i(k)m(eyw)m(ord)f(record.)382 1550 y Fe(FTDKEY\(unit,keyword,)42 b(>)48 b(status\))0 1881 y Fd(5.4)135 b(Data)46 b(I/O)g(Routines)0 2132 y Fi(The)32 b(follo)m(wing)i(routines)e(read)h(or)f(write)h(data)g(v)-5 b(alues)33 b(in)f(the)h(curren)m(t)f(HDU)i(of)e(the)h(FITS)f(\014le.)47 b(Automatic)0 2245 y(datat)m(yp)s(e)28 b(con)m(v)m(ersion)h(will)e(b)s (e)g(attempted)h(for)g(n)m(umerical)f(datat)m(yp)s(es)i(if)e(the)g(sp)s (eci\014ed)g(datat)m(yp)s(e)h(is)f(di\013eren)m(t)0 2357 y(from)j(the)g(actual)i(datat)m(yp)s(e)g(of)e(the)h(FITS)e(arra)m(y)i (or)f(table)i(column.)0 2606 y Fh(1)81 b Fi(W)-8 b(rite)31 b(elemen)m(ts)h(in)m(to)f(the)g(primary)e(data)j(arra)m(y)e(or)h(image) g(extension.)382 2855 y Fe(FTPPR[BIJKED]\(unit,group)o(,fp)o(ixel)o (,nel)o(eme)o(nts,)o(valu)o(es,)41 b(>)48 b(status\))0 3103 y Fh(2)81 b Fi(Read)30 b(elemen)m(ts)j(from)d(the)h(primary)e (data)j(arra)m(y)f(or)g(image)h(extension.)42 b(Unde\014ned)29 b(arra)m(y)j(elemen)m(ts)g(will)227 3216 y(b)s(e)f(returned)f(with)h(a) h(v)-5 b(alue)31 b(=)g(n)m(ullv)-5 b(al,)33 b(unless)d(n)m(ullv)-5 b(al)32 b(=)f(0)h(in)f(whic)m(h)g(case)h(no)f(c)m(hec)m(ks)i(for)e (unde\014ned)227 3329 y(pixels)h(will)f(b)s(e)f(p)s(erformed.)42 b(The)30 b(an)m(yf)i(parameter)f(is)g(set)h(to)g(true)f(\(=)g(.true.\)) 43 b(if)31 b(an)m(y)h(of)f(the)g(returned)227 3442 y(elemen)m(ts)h(w)m (ere)f(unde\014ned.)382 3691 y Fe(FTGPV[BIJKED]\(unit,group)o(,fp)o (ixel)o(,nel)o(eme)o(nts,)o(null)o(val)o(,)42 b(>)47 b(values,anyf,status\))0 3939 y Fh(3)81 b Fi(W)-8 b(rite)36 b(elemen)m(ts)h(in)m(to)f(an)f(ASCI)s(I)e(or)i(binary)g(table)h (column.)54 b(The)35 b(`felem')h(parameter)g(applies)f(only)g(to)227 4052 y(v)m(ector)d(columns)e(in)g(binary)g(tables)h(and)f(is)g(ignored) h(when)e(writing)i(to)g(ASCI)s(I)d(tables.)382 4301 y Fe(FTPCL[SLBIJKEDCM]\(unit,c)o(oln)o(um,f)o(row,)o(fel)o(em,n)o(elem)o (ent)o(s,va)o(lues)o(,)42 b(>)47 b(status\))0 4549 y Fh(4)81 b Fi(Read)22 b(elemen)m(ts)h(from)e(an)g(ASCI)s(I)g(or)g (binary)g(table)i(column.)38 b(Unde\014ned)20 b(arra)m(y)i(elemen)m(ts) h(will)f(b)s(e)f(returned)227 4662 y(with)32 b(a)h(v)-5 b(alue)33 b(=)f(n)m(ullv)-5 b(al,)34 b(unless)e(n)m(ullv)-5 b(al)32 b(=)h(0)f(\(or)h(=)f(')h(')f(for)g(ftgcvs\))i(in)e(whic)m(h)g (case)i(no)e(c)m(hec)m(king)i(for)227 4775 y(unde\014ned)23 b(v)-5 b(alues)25 b(will)g(b)s(e)g(p)s(erformed.)37 b(The)24 b(ANYF)i(parameter)f(is)g(set)h(to)f(true)g(if)g(an)m(y)g(of)g(the)g (returned)227 4888 y(elemen)m(ts)32 b(are)f(unde\014ned.)227 5036 y(An)m(y)d(column,)h(regardless)f(of)g(it's)h(in)m(trinsic)f (datat)m(yp)s(e,)i(ma)m(y)e(b)s(e)f(read)h(as)g(a)h(string.)40 b(It)28 b(should)e(b)s(e)i(noted)227 5149 y(ho)m(w)m(ev)m(er)k(that)f (reading)f(a)h(n)m(umeric)f(column)g(as)h(a)g(string)f(is)g(10)i(-)e (100)i(times)f(slo)m(w)m(er)g(than)f(reading)h(the)227 5262 y(same)36 b(column)f(as)h(a)g(n)m(um)m(b)s(er)e(due)g(to)j(the)e (large)i(o)m(v)m(erhead)f(in)f(constructing)h(the)g(formatted)g (strings.)227 5375 y(The)i(displa)m(y)g(format)g(of)g(the)g(returned)f (strings)g(will)h(b)s(e)g(determined)f(b)m(y)h(the)g(TDISPn)f(k)m(eyw)m (ord,)j(if)227 5488 y(it)d(exists,)h(otherwise)f(b)m(y)f(the)g(datat)m (yp)s(e)h(of)f(the)h(column.)57 b(The)36 b(length)g(of)h(the)f (returned)f(strings)h(can)227 5601 y(b)s(e)29 b(determined)f(with)h (the)g(ftgcdw)g(routine.)40 b(The)28 b(follo)m(wing)j(TDISPn)c(displa)m (y)j(formats)f(are)g(curren)m(tly)227 5714 y(supp)s(orted:)p eop end %%Page: 34 40 TeXDict begin 34 39 bop 0 299 a Fi(34)1747 b Fg(CHAPTER)30 b(5.)111 b(BASIC)30 b(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)418 555 y Fe(Iw.m)142 b(Integer)418 668 y(Ow.m)g(Octal)47 b(integer)418 781 y(Zw.m)142 b(Hexadecimal)45 b(integer)418 894 y(Fw.d)142 b(Fixed)47 b(floating)e(point)418 1007 y(Ew.d)142 b(Exponential)45 b(floating)h(point)418 1120 y(Dw.d)142 b(Exponential)45 b(floating)h(point)418 1233 y(Gw.d)142 b(General;)46 b(uses)g(Fw.d)h(if)g(significance)e(not)i (lost,)f(else)h(Ew.d)227 1483 y Fi(where)24 b(w)h(is)f(the)h(width)f (in)g(c)m(haracters)i(of)f(the)g(displa)m(y)m(ed)g(v)-5 b(alues,)27 b(m)d(is)h(the)f(minim)m(um)g(n)m(um)m(b)s(er)g(of)g (digits)227 1595 y(displa)m(y)m(ed,)31 b(and)e(d)h(is)f(the)i(n)m(um)m (b)s(er)d(of)i(digits)g(to)h(the)f(righ)m(t)h(of)f(the)g(decimal.)41 b(The)29 b(.m)h(\014eld)g(is)g(optional.)382 1855 y Fe (FTGCV[SBIJKEDCM]\(unit,co)o(lnu)o(m,fr)o(ow,f)o(ele)o(m,ne)o(leme)o (nts)o(,nul)o(lval)o(,)42 b(>)1098 1968 y(values,anyf,status\))0 2228 y Fh(5)81 b Fi(Get)42 b(the)g(table)h(column)e(n)m(um)m(b)s(er)g (and)g(full)g(name)h(of)g(the)f(column)h(whose)f(name)h(matc)m(hes)h (the)f(input)227 2341 y(template)35 b(string.)48 b(See)33 b(the)h(`Adv)-5 b(anced)33 b(In)m(terface)h(Routines')f(c)m(hapter)h (for)f(a)g(full)g(description)g(of)g(this)227 2454 y(routine.)382 2714 y Fe(FTGCNN\(unit,casesen,colt)o(emp)o(late)o(,)42 b(>)47 b(colname,colnum,status\))p eop end %%Page: 35 41 TeXDict begin 35 40 bop 0 1225 a Ff(Chapter)65 b(6)0 1687 y Fl(Adv)-13 b(anced)78 b(In)-6 b(terface)77 b(Subroutines)0 2180 y Fi(This)31 b(c)m(hapter)h(de\014nes)f(all)h(the)g(a)m(v)-5 b(ailable)34 b(subroutines)d(in)g(the)h(FITSIO)e(user)h(in)m(terface.) 46 b(F)-8 b(or)33 b(completeness,)0 2293 y(the)43 b(basic)g (subroutines)e(describ)s(ed)g(in)i(the)f(previous)h(c)m(hapter)g(are)g (also)g(rep)s(eated)g(here.)77 b(A)43 b(righ)m(t)g(arro)m(w)0 2406 y(sym)m(b)s(ol)29 b(is)f(used)g(here)h(to)g(separate)h(the)f (input)f(parameters)h(from)f(the)h(output)g(parameters)g(in)f(the)h (de\014nition)0 2518 y(of)k(eac)m(h)h(subroutine.)47 b(This)32 b(sym)m(b)s(ol)h(is)g(not)g(actually)i(part)d(of)h(the)h (calling)g(sequence.)49 b(An)32 b(alphab)s(etical)i(list)0 2631 y(and)c(de\014nition)g(of)g(all)i(the)e(parameters)h(is)f(giv)m (en)i(at)f(the)f(end)g(of)h(this)f(section.)0 2961 y Fd(6.1)135 b(FITS)44 b(File)i(Op)t(en)e(and)h(Close)h(Subroutines:)0 3197 y Fh(1)81 b Fi(Op)s(en)30 b(an)i(existing)g(FITS)g(\014le)f(with)h (readonly)g(or)g(readwrite)g(access.)46 b(The)31 b(FTDK)m(OPN)i (routine)e(simply)227 3310 y(op)s(ens)h(the)g(sp)s(eci\014ed)g(\014le)h (without)f(trying)h(to)g(in)m(terpret)g(the)f(\014lename)h(using)f(the) g(extended)h(\014lename)227 3423 y(syn)m(tax.)41 b(FTDOPN)28 b(op)s(ens)e(the)i(\014le)g(and)f(also)i(mo)m(v)m(es)g(to)g(the)f (\014rst)f(HDU)h(con)m(taining)h(signi\014can)m(t)g(data,)227 3536 y(if)35 b(no)h(sp)s(eci\014c)f(HDU)h(is)f(sp)s(eci\014ed)f(as)i (part)f(of)g(the)h(\014lename.)55 b(FTTOPN)35 b(and)f(FTIOPN)h(are)h (similar)227 3649 y(except)26 b(that)f(they)g(will)g(mo)m(v)m(e)h(to)g (the)f(\014rst)f(table)h(HDU)h(or)e(image)i(HDU,)g(resp)s(ectiv)m(ely) -8 b(,)28 b(if)c(a)h(HDU)h(name)227 3762 y(or)31 b(n)m(um)m(b)s(er)e (is)h(not)h(sp)s(eci\014ed)e(as)i(part)f(of)h(the)f(\014lename.)382 3996 y Fe(FTOPEN\(unit,filename,rwm)o(ode)o(,)42 b(>)47 b(blocksize,status\))382 4108 y(FTDKOPN\(unit,filename,rw)o(mod)o(e,)42 b(>)47 b(blocksize,status\))382 4334 y(FTDOPN\(unit,filename,rwm)o(ode) o(,)42 b(>)47 b(status\))382 4447 y(FTTOPN\(unit,filename,rwm)o(ode)o (,)42 b(>)47 b(status\))382 4560 y(FTIOPN\(unit,filename,rwm)o(ode)o(,) 42 b(>)47 b(status\))0 4794 y Fh(2)81 b Fi(Op)s(en)24 b(an)i(existing)h(FITS)e(\014le)h(with)f(readonly)h(or)g(readwrite)g (access)h(and)f(mo)m(v)m(e)h(to)f(a)h(follo)m(wing)g(extension,)227 4907 y(if)38 b(one)g(w)m(as)g(sp)s(eci\014ed)g(as)g(part)f(of)h(the)h (\014lename.)63 b(\(e.g.,)42 b('\014lename.\014ts+2')c(or)g ('\014lename.\014ts[2]')i(will)227 5020 y(mo)m(v)m(e)e(to)g(the)e(3rd)g (HDU)i(in)e(the)h(\014le\).)60 b(Note)37 b(that)h(this)e(routine)h (di\013ers)f(from)g(FTOPEN)g(in)g(that)h(it)227 5133 y(do)s(es)30 b(not)h(ha)m(v)m(e)h(the)e(redundan)m(t)f(blo)s(c)m(ksize) j(argumen)m(t.)382 5367 y Fe(FTNOPN\(unit,filename,rwm)o(ode)o(,)42 b(>)47 b(status\))0 5601 y Fh(3)81 b Fi(Reop)s(en)38 b(a)i(FITS)e(\014le)i(that)f(w)m(as)h(previously)f(op)s(ened)f(with)h (FTOPEN,)g(FTNOPN,)g(or)h(FTINIT.)e(The)227 5714 y(newunit)f(n)m(um)m (b)s(er)f(ma)m(y)j(then)e(b)s(e)g(treated)i(as)f(a)g(separate)g (\014le,)i(and)d(one)h(ma)m(y)h(sim)m(ultaneously)f(read)1905 5942 y(35)p eop end %%Page: 36 42 TeXDict begin 36 41 bop 0 299 a Fi(36)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)227 555 y Fi(or)36 b(write)g(to)g(2)g(\(or)g(more\))g (di\013eren)m(t)g(extensions)g(in)f(the)h(same)g(\014le.)56 b(The)35 b(FTOPEN)g(and)g(FTNOPN)227 668 y(routines)f(\(ab)s(o)m(v)m (e\))h(automatically)h(detects)f(cases)g(where)e(a)g(previously)h(op)s (ened)e(\014le)i(is)g(b)s(eing)f(op)s(ened)227 781 y(again,)c(and)e (then)g(in)m(ternally)h(call)g(FTREOPEN,)f(so)h(programs)e(should)h (rarely)g(need)g(to)h(explicitly)h(call)227 894 y(this)i(routine.)334 1136 y Fe(FTREOPEN\(unit,)44 b(>)j(newunit,)f(status\))0 1377 y Fh(4)81 b Fi(Op)s(en)24 b(and)g(initialize)k(a)e(new)f(empt)m(y) g(FITS)g(\014le.)39 b(The)25 b(FTDKINIT)g(routine)g(simply)g(creates)i (the)f(sp)s(eci\014ed)227 1490 y(\014le)31 b(without)f(trying)h(to)g (in)m(terpret)f(the)h(\014lename)g(using)e(the)i(extended)f(\014lename) h(syn)m(tax.)334 1732 y Fe(FTINIT\(unit,filename,bloc)o(ksi)o(ze,)41 b(>)48 b(status\))334 1845 y(FTDKINIT\(unit,filename,bl)o(ock)o(size)o (,)42 b(>)47 b(status\))0 2087 y Fh(5)81 b Fi(Create)24 b(a)g(new)f(FITS)g(\014le,)i(using)e(a)h(template)h(\014le)e(to)i (de\014ne)d(its)i(initial)h(size)g(and)e(structure.)37 b(The)24 b(template)227 2199 y(ma)m(y)39 b(b)s(e)f(another)h(FITS)e (HDU)i(or)g(an)f(ASCI)s(I)f(template)j(\014le.)64 b(If)38 b(the)h(input)e(template)j(\014le)e(name)h(is)227 2312 y(blank,)28 b(then)f(this)g(routine)g(b)s(eha)m(v)m(es)h(the)f(same)h (as)f(FTINIT.)g(The)f(curren)m(tly)i(supp)s(orted)d(format)i(of)h(the) 227 2425 y(ASCI)s(I)c(template)j(\014le)f(is)f(describ)s(ed)g(under)f (the)i(\014ts)p 2037 2425 28 4 v 32 w(parse)p 2277 2425 V 33 w(template)g(routine)g(\(in)g(the)f(general)i(Utilities)227 2538 y(section\),)32 b(but)e(this)g(ma)m(y)h(c)m(hange)h(sligh)m(tly)g (later)f(releases)g(of)g(CFITSIO.)334 2780 y Fe(FTTPLT\(unit,)45 b(filename,)g(tplfilename,)f(>)k(status\))0 3022 y Fh(6)81 b Fi(Flush)33 b(in)m(ternal)h(bu\013ers)f(of)h(data)g(to)g(the)g (output)g(FITS)f(\014le)h(previously)f(op)s(ened)g(with)g(ftop)s(en)h (or)f(ftinit.)227 3135 y(The)j(routine)h(usually)f(nev)m(er)h(needs)f (to)i(b)s(e)e(called,)j(but)d(doing)h(so)g(will)g(ensure)f(that)h(if)f (the)h(program)227 3247 y(subsequen)m(tly)30 b(ab)s(orts,)g(then)h(the) f(FITS)g(\014le)g(will)h(ha)m(v)m(e)h(at)f(least)g(b)s(een)f(closed)h (prop)s(erly)-8 b(.)382 3489 y Fe(FTFLUS\(unit,)44 b(>)k(status\))0 3731 y Fh(7)81 b Fi(Close)31 b(a)f(FITS)g(\014le)g(previously)g(op)s (ened)g(with)g(ftop)s(en)g(or)g(ftinit)382 3973 y Fe(FTCLOS\(unit,)44 b(>)k(status\))0 4214 y Fh(8)81 b Fi(Close)34 b(and)f(DELETE)g(a)h (FITS)f(\014le)h(previously)f(op)s(ened)g(with)g(ftop)s(en)g(or)h (ftinit.)51 b(This)33 b(routine)g(ma)m(y)i(b)s(e)227 4327 y(useful)29 b(in)h(cases)g(where)g(a)g(FITS)f(\014le)g(is)h (created,)h(but)e(an)h(error)f(o)s(ccurs)h(whic)m(h)f(prev)m(en)m(ts)i (the)e(complete)227 4440 y(\014le)i(from)f(b)s(eing)g(written.)382 4682 y Fe(FTDELT\(unit,)44 b(>)k(status\))0 4924 y Fh(9)81 b Fi(Get)31 b(the)g(v)-5 b(alue)31 b(of)f(an)g(un)m(used)g(I/O)g(unit)g (n)m(um)m(b)s(er)f(whic)m(h)h(ma)m(y)h(then)f(b)s(e)g(used)g(as)g (input)g(to)h(FTOPEN)f(or)227 5036 y(FTINIT.)36 b(This)f(routine)h (searc)m(hes)h(for)f(the)g(\014rst)f(un)m(used)g(unit)g(n)m(um)m(b)s (er)g(in)g(the)i(range)f(from)f(with)h(99)227 5149 y(do)m(wn)d(to)h (50.)50 b(This)32 b(routine)h(just)g(k)m(eeps)h(an)f(in)m(ternal)h (list)f(of)h(the)f(allo)s(cated)i(unit)e(n)m(um)m(b)s(ers)f(and)g(do)s (es)227 5262 y(not)26 b(ph)m(ysically)g(c)m(hec)m(k)g(that)g(the)g(F)-8 b(ortran)25 b(unit)g(is)g(a)m(v)-5 b(ailable)28 b(\(to)e(b)s(e)f (compatible)h(with)f(the)g(SPP)f(v)m(ersion)227 5375 y(of)35 b(FITSIO\).)g(Th)m(us)f(users)g(m)m(ust)h(not)g(indep)s(enden)m (tly)f(allo)s(cate)j(an)m(y)f(unit)e(n)m(um)m(b)s(ers)g(in)h(the)g (range)g(50)227 5488 y(-)42 b(99)g(if)f(this)g(routine)g(is)g(also)h (to)g(b)s(e)f(used)f(in)h(the)g(same)h(program.)73 b(This)40 b(routine)h(is)g(pro)m(vided)g(for)227 5601 y(con)m(v)m(enience)34 b(only)-8 b(,)32 b(and)e(it)i(is)f(not)h(required)e(that)i(the)f(unit)g (n)m(um)m(b)s(ers)f(used)g(b)m(y)h(FITSIO)f(b)s(e)h(allo)s(cated)227 5714 y(b)m(y)g(this)f(routine.)p eop end %%Page: 37 43 TeXDict begin 37 42 bop 0 299 a Fg(6.1.)72 b(FITS)30 b(FILE)g(OPEN)g(AND)h(CLOSE)e(SUBR)m(OUTINES:)1561 b Fi(37)382 555 y Fe(FTGIOU\()46 b(>)h(iounit,)f(status\))0 807 y Fh(10)g Fi(F)-8 b(ree)34 b(\(deallo)s(cate\))i(an)d(I/O)g(unit)f (n)m(um)m(b)s(er)g(whic)m(h)g(w)m(as)h(previously)g(allo)s(cated)i (with)e(FTGIOU.)g(All)g(pre-)227 919 y(viously)28 b(allo)s(cated)i (unit)d(n)m(um)m(b)s(ers)f(ma)m(y)i(b)s(e)f(deallo)s(cated)j(at)e(once) h(b)m(y)e(calling)i(FTFIOU)f(with)f(iounit)h(=)227 1032 y(-1.)382 1284 y Fe(FTFIOU\(iounit,)44 b(>)j(status\))0 1535 y Fh(11)f Fi(Return)30 b(the)h(F)-8 b(ortran)31 b(unit)g(n)m(um)m(b)s(er)e(that)i(corresp)s(onds)f(to)h(the)g(C)g (\014ts\014le)f(p)s(oin)m(ter)h(v)-5 b(alue,)32 b(or)e(vice)i(v)m (ersa.)227 1648 y(These)37 b(2)h(C)f(routines)g(ma)m(y)g(b)s(e)g (useful)f(in)h(mixed)g(language)i(programs)e(where)f(b)s(oth)h(C)g(and) f(F)-8 b(ortran)227 1761 y(subroutines)25 b(need)g(to)i(access)g(the)f (same)g(\014le.)40 b(F)-8 b(or)26 b(example,)i(if)e(a)g(FITS)f(\014le)h (is)g(op)s(ened)f(with)g(unit)g(12)i(b)m(y)227 1874 y(a)k(F)-8 b(ortran)31 b(subroutine,)f(then)g(a)h(C)f(routine)h(within)f(the)g (same)h(program)g(could)f(get)i(the)e(\014t\014le)h(p)s(oin)m(ter)227 1987 y(v)-5 b(alue)39 b(to)f(access)h(the)f(same)h(\014le)f(b)m(y)f (calling)j('fptr)d(=)h(CUnit2FITS\(12\)'.)64 b(These)38 b(routines)g(return)f(a)227 2100 y(v)-5 b(alue)31 b(of)g(zero)g(if)f (an)g(error)g(o)s(ccurs.)286 2351 y Fe(int)334 b(CFITS2Unit\(fitsfile) 42 b(*ptr\);)286 2464 y(fitsfile*)k(CUnit2FITS\(int)e(unit\);)0 2715 y Fh(11)i Fi(P)m(arse)32 b(the)g(input)e(\014lename)i(and)f (return)f(the)i(HDU)g(n)m(um)m(b)s(er)e(that)i(w)m(ould)f(b)s(e)g(mo)m (v)m(ed)i(to)f(if)f(the)h(\014le)f(w)m(ere)227 2828 y(op)s(ened)i(with) g(FTNOPN.)g(The)f(returned)g(HDU)i(n)m(um)m(b)s(er)e(b)s(egins)h(with)g (1)g(for)g(the)g(primary)g(arra)m(y)-8 b(,)35 b(so)227 2941 y(for)d(example,)g(if)g(the)g(input)f(\014lename)g(=)h(`m)m (y\014le.\014ts[2]')h(then)e(hdun)m(um)e(=)j(3)g(will)g(b)s(e)f (returned.)43 b(FIT-)227 3054 y(SIO)35 b(do)s(es)h(not)g(op)s(en)g(the) g(\014le)g(to)h(c)m(hec)m(k)h(if)e(the)g(extension)h(actually)h(exists) e(if)h(an)e(extension)i(n)m(um)m(b)s(er)227 3167 y(is)43 b(sp)s(eci\014ed.)75 b(If)42 b(an)g(extension)h(*name*)g(is)f(included) g(in)g(the)g(\014le)g(name)h(sp)s(eci\014cation)g(\(e.g.)77 b(`m)m(y-)227 3280 y(\014le.\014ts[EVENTS]')30 b(then)f(this)h(routine) g(will)g(ha)m(v)m(e)h(to)f(op)s(en)f(the)h(FITS)f(\014le)h(and)f(lo)s (ok)h(for)g(the)g(p)s(osition)227 3393 y(of)38 b(the)h(named)e (extension,)k(then)d(close)h(\014le)f(again.)64 b(This)38 b(is)g(not)g(p)s(ossible)f(if)h(the)g(\014le)g(is)g(b)s(eing)g(read)227 3506 y(from)e(the)g(stdin)f(stream,)j(and)d(an)h(error)f(will)h(b)s(e)g (returned)e(in)i(this)g(case.)58 b(If)35 b(the)h(\014lename)g(do)s(es)g (not)227 3619 y(sp)s(ecify)29 b(an)g(explicit)h(extension)g(\(e.g.)42 b('m)m(y\014le.\014ts'\))30 b(then)f(hdun)m(um)e(=)h(-99)j(will)e(b)s (e)g(returned,)f(whic)m(h)h(is)227 3731 y(functionally)34 b(equiv)-5 b(alen)m(t)35 b(to)g(hdun)m(um)c(=)i(1.)50 b(This)33 b(routine)g(is)h(mainly)g(used)e(for)i(bac)m(kw)m(ard)g (compati-)227 3844 y(bilit)m(y)g(in)e(the)g(fto)s(ols)h(soft)m(w)m(are) h(pac)m(k)-5 b(age)34 b(and)e(is)g(not)g(recommended)g(for)g(general)i (use.)46 b(It)32 b(is)h(generally)227 3957 y(b)s(etter)i(and)g(more)g (e\016cien)m(t)h(to)g(\014rst)e(op)s(en)g(the)h(FITS)f(\014le)h(with)g (FTNOPN,)g(then)g(use)f(FTGHDN)i(to)227 4070 y(determine)30 b(whic)m(h)g(HDU)g(in)f(the)h(\014le)g(has)g(b)s(een)f(op)s(ened,)g (rather)g(than)h(calling)h(FTEXTN)f(follo)m(w)m(ed)h(b)m(y)227 4183 y(a)g(call)h(to)f(FTNOPN.)382 4434 y Fe(FTEXTN\(filename,)43 b(>)48 b(nhdu,)e(status\))0 4686 y Fh(12)g Fi(Return)30 b(the)g(name)h(of)f(the)h(op)s(ened)e(FITS)h(\014le.)382 4937 y Fe(FTFLNM\(unit,)44 b(>)k(filename,)d(status\))0 5188 y Fh(13)h Fi(Return)30 b(the)g(I/O)g(mo)s(de)g(of)h(the)g(op)s(en) e(FITS)h(\014le)g(\(READONL)-8 b(Y)32 b(=)e(0,)h(READ)m(WRITE)g(=)f (1\).)382 5440 y Fe(FTFLMD\(unit,)44 b(>)k(iomode,)e(status\))0 5691 y Fh(14)g Fi(Return)30 b(the)g(\014le)h(t)m(yp)s(e)f(of)h(the)f (op)s(ened)g(FITS)g(\014le)g(\(e.g.)42 b('\014le://',)32 b('ftp://',)g(etc.\).)p eop end %%Page: 38 44 TeXDict begin 38 43 bop 0 299 a Fi(38)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)382 555 y Fe(FTURLT\(unit,)44 b(>)k(urltype,)d (status\))0 819 y Fh(15)h Fi(P)m(arse)27 b(the)f(input)f(\014lename)i (or)f(URL)g(in)m(to)h(its)g(comp)s(onen)m(t)f(parts:)39 b(the)26 b(\014le)g(t)m(yp)s(e)h(\(\014le://,)h(ftp://,)g(h)m(ttp://,) 227 932 y(etc\),)34 b(the)e(base)g(input)e(\014le)i(name,)g(the)g(name) g(of)g(the)g(output)f(\014le)h(that)g(the)g(input)f(\014le)g(is)h(to)g (b)s(e)f(copied)227 1045 y(to)38 b(prior)e(to)h(op)s(ening,)h(the)f (HDU)g(or)f(extension)i(sp)s(eci\014cation,)h(the)e(\014ltering)f(sp)s (eci\014er,)i(the)f(binning)227 1157 y(sp)s(eci\014er,)e(and)e(the)i (column)f(sp)s(eci\014er.)51 b(Blank)34 b(strings)g(will)h(b)s(e)e (returned)g(for)h(an)m(y)g(comp)s(onen)m(ts)g(that)227 1270 y(are)d(not)g(presen)m(t)f(in)g(the)h(input)e(\014le)i(name.)334 1534 y Fe(FTIURL\(filename,)43 b(>)48 b(filetype,)d(infile,)h(outfile,) g(extspec,)f(filter,)716 1647 y(binspec,)g(colspec,)h(status\))0 1910 y Fh(16)g Fi(P)m(arse)e(the)g(input)f(\014le)h(name)f(and)g (return)g(the)h(ro)s(ot)g(\014le)f(name.)81 b(The)43 b(ro)s(ot)h(name)g(includes)f(the)h(\014le)227 2023 y(t)m(yp)s(e)35 b(if)g(sp)s(eci\014ed,)h(\(e.g.)56 b('ftp://')37 b(or)e('h)m(ttp://'\)) i(and)d(the)h(full)g(path)g(name,)h(to)g(the)f(exten)m(t)i(that)e(it)h (is)227 2136 y(sp)s(eci\014ed)26 b(in)f(the)i(input)e(\014lename.)39 b(It)26 b(do)s(es)g(not)g(include)g(the)g(HDU)h(name)f(or)g(n)m(um)m(b) s(er,)g(or)g(an)m(y)h(\014ltering)227 2249 y(sp)s(eci\014cations.)334 2513 y Fe(FTRTNM\(filename,)43 b(>)48 b(rootname,)d(status\))0 2776 y Fh(16)h Fi(T)-8 b(est)36 b(if)g(the)g(input)f(\014le)h(or)f(a)i (compressed)e(v)m(ersion)h(of)g(the)g(\014le)g(\(with)g(a)g(.gz,)i(.Z,) e(.z,)i(or)e(.zip)g(extension\))227 2889 y(exists)j(on)f(disk.)63 b(The)37 b(returned)g(v)-5 b(alue)38 b(of)g(the)h('exists')g(parameter) f(will)g(ha)m(v)m(e)i(1)e(of)g(the)g(4)g(follo)m(wing)227 3002 y(v)-5 b(alues:)370 3257 y Fe(2:)95 b(the)47 b(file)g(does)g(not)f (exist,)h(but)f(a)i(compressed)d(version)h(does)g(exist)370 3370 y(1:)95 b(the)47 b(disk)g(file)g(does)f(exist)370 3483 y(0:)95 b(neither)46 b(the)h(file)g(nor)g(a)g(compressed)e (version)h(of)h(the)g(file)g(exist)323 3596 y(-1:)94 b(the)47 b(input)g(file)f(name)h(is)g(not)g(a)g(disk)g(file)g(\(could)f (be)h(a)g(ftp,)g(http,)561 3709 y(smem,)g(or)g(mem)g(file,)f(or)h(a)h (file)e(piped)h(in)g(on)g(the)g(STDIN)f(stream\))286 3973 y(FTEXIST\(filename,)d(>)48 b(exists,)e(status\);)0 4311 y Fd(6.2)135 b(HDU-Lev)l(el)47 b(Op)t(erations)0 4562 y Fi(When)30 b(a)h(FITS)f(\014le)g(is)h(\014rst)e(op)s(ened)h(or)g (created,)i(the)f(in)m(ternal)g(bu\013ers)e(in)h(FITSIO)f (automatically)34 b(p)s(oin)m(t)c(to)0 4675 y(the)g(\014rst)g(HDU)h(in) f(the)g(\014le.)41 b(The)29 b(follo)m(wing)j(routines)e(ma)m(y)h(b)s(e) e(used)h(to)h(mo)m(v)m(e)g(to)g(another)f(HDU)h(in)f(the)h(\014le.)0 4788 y(Note)j(that)f(the)g(HDU)g(n)m(um)m(b)s(ering)f(con)m(v)m(en)m (tion)i(used)e(in)g(FITSIO)g(denotes)h(the)f(primary)g(arra)m(y)h(as)g (the)g(\014rst)0 4901 y(HDU,)e(the)g(\014rst)f(extension)h(in)f(a)g (FITS)g(\014le)g(is)h(the)f(second)h(HDU,)g(and)f(so)h(on.)0 5164 y Fh(1)81 b Fi(Mo)m(v)m(e)32 b(to)f(a)g(sp)s(eci\014ed)f (\(absolute\))h(HDU)g(in)g(the)f(FITS)g(\014le)g(\(nhdu)f(=)h(1)h(for)f (the)g(FITS)g(primary)f(arra)m(y\))382 5428 y Fe(FTMAHD\(unit,nhdu,)43 b(>)k(hdutype,status\))0 5691 y Fh(2)81 b Fi(Mo)m(v)m(e)32 b(to)f(a)g(new)f(\(existing\))i(HDU)f(forw)m(ard)f(or)g(bac)m(kw)m (ards)h(relativ)m(e)h(to)f(the)g(CHDU)p eop end %%Page: 39 45 TeXDict begin 39 44 bop 0 299 a Fg(6.2.)72 b(HDU-LEVEL)31 b(OPERA)-8 b(TIONS)2414 b Fi(39)382 555 y Fe(FTMRHD\(unit,nmove,)43 b(>)k(hdutype,status\))0 797 y Fh(3)81 b Fi(Mo)m(v)m(e)22 b(to)f(the)f(\(\014rst\))h(HDU)g(whic)m(h)f(has)g(the)g(sp)s(eci\014ed) g(extension)h(t)m(yp)s(e)f(and)g(EXTNAME)g(\(or)h(HDUNAME\))227 910 y(and)34 b(EXTVER)g(k)m(eyw)m(ord)h(v)-5 b(alues.)53 b(The)34 b(hdut)m(yp)s(e)f(parameter)i(ma)m(y)g(ha)m(v)m(e)g(a)g(v)-5 b(alue)35 b(of)f(IMA)m(GE)p 3665 910 28 4 v 34 w(HDU)227 1023 y(\(0\),)43 b(ASCI)s(I)p 669 1023 V 31 w(TBL)c(\(1\),)j(BINAR)-8 b(Y)p 1468 1023 V 34 w(TBL)39 b(\(2\),)j(or)d(ANY)p 2234 1023 V 34 w(HDU)g(\(-1\))i(where)d(ANY)p 3173 1023 V 34 w(HDU)h(means)g(that)227 1136 y(only)30 b(the)g(extname)h(and)e (extv)m(er)i(v)-5 b(alues)30 b(will)g(b)s(e)f(used)g(to)i(lo)s(cate)g (the)f(correct)h(extension.)42 b(If)29 b(the)h(input)227 1249 y(v)-5 b(alue)27 b(of)f(extv)m(er)h(is)f(0)g(then)g(the)g(EXTVER)g (k)m(eyw)m(ord)g(is)g(ignored)g(and)g(the)g(\014rst)f(HDU)i(with)e(a)i (matc)m(hing)227 1361 y(EXTNAME)g(\(or)g(HDUNAME\))h(k)m(eyw)m(ord)f (will)g(b)s(e)f(found.)38 b(If)26 b(no)h(matc)m(hing)h(HDU)f(is)g (found)e(in)h(the)h(\014le)227 1474 y(then)i(the)g(curren)m(t)g(HDU)h (will)f(remain)g(unc)m(hanged)g(and)g(a)g(status)g(=)g(BAD)p 2884 1474 V 34 w(HDU)p 3123 1474 V 33 w(NUM)h(\(301\))h(will)f(b)s(e) 227 1587 y(returned.)382 1829 y Fe(FTMNHD\(unit,)44 b(hdutype,)i (extname,)f(extver,)h(>)i(status\))0 2071 y Fh(4)81 b Fi(Get)31 b(the)g(n)m(um)m(b)s(er)e(of)h(the)h(curren)m(t)f(HDU)h(in)f (the)h(FITS)e(\014le)i(\(primary)f(arra)m(y)g(=)g(1\))382 2312 y Fe(FTGHDN\(unit,)44 b(>)k(nhdu\))0 2554 y Fh(5)81 b Fi(Return)39 b(the)i(t)m(yp)s(e)g(of)g(the)g(curren)m(t)f(HDU)i(in)e (the)h(FITS)f(\014le.)71 b(The)41 b(p)s(ossible)f(v)-5 b(alues)41 b(for)f(hdut)m(yp)s(e)g(are)227 2667 y(IMA)m(GE)p 546 2667 V 34 w(HDU)31 b(\(0\),)h(ASCI)s(I)p 1242 2667 V 31 w(TBL)e(\(1\),)i(or)e(BINAR)-8 b(Y)p 2133 2667 V 34 w(TBL)30 b(\(2\).)382 2909 y Fe(FTGHDT\(unit,)44 b(>)k(hdutype,)d (status\))0 3150 y Fh(6)81 b Fi(Return)29 b(the)i(total)h(n)m(um)m(b)s (er)d(of)i(HDUs)f(in)h(the)f(FITS)g(\014le.)41 b(The)29 b(CHDU)i(remains)f(unc)m(hanged.)382 3392 y Fe(FTTHDU\(unit,)44 b(>)k(hdunum,)e(status\))0 3634 y Fh(7)81 b Fi(Create)34 b(\(app)s(end\))f(a)i(new)e(empt)m(y)h(HDU)h(at)g(the)f(end)f(of)h(the) h(FITS)e(\014le.)51 b(This)33 b(new)h(HDU)h(b)s(ecomes)f(the)227 3747 y(Curren)m(t)j(HDU,)i(but)e(it)h(is)g(completely)h(empt)m(y)f(and) g(con)m(tains)h(no)e(header)h(k)m(eyw)m(ords)g(or)g(data.)63 b(It)38 b(is)227 3860 y(recommended)30 b(that)h(FTI)s(IMG,)g(FTIT)-8 b(AB)30 b(or)h(FTIBIN)f(b)s(e)g(used)g(instead)g(of)h(this)f(routine.) 382 4101 y Fe(FTCRHD\(unit,)44 b(>)k(status\))0 4343 y Fh(8)81 b Fi(Create)30 b(a)f(primary)f(arra)m(y)i(\(if)g(none)f (already)g(exists\),)i(or)e(insert)g(a)h(new)f(IMA)m(GE)h(extension)g (immediately)227 4456 y(follo)m(wing)25 b(the)e(CHDU,)g(or)g(insert)g (a)g(new)g(Primary)f(Arra)m(y)h(at)h(the)f(b)s(eginning)f(of)h(the)g (\014le.)38 b(An)m(y)23 b(follo)m(wing)227 4569 y(extensions)29 b(in)g(the)g(\014le)f(will)h(b)s(e)f(shifted)h(do)m(wn)f(to)h(mak)m(e)h (ro)s(om)e(for)h(the)g(new)f(extension.)40 b(If)29 b(the)g(CHDU)227 4682 y(is)h(the)g(last)g(HDU)g(in)g(the)f(\014le)h(then)f(the)h(new)f (image)i(extension)f(will)g(simply)f(b)s(e)g(app)s(ended)f(to)i(the)g (end)227 4795 y(of)k(the)h(\014le.)52 b(One)33 b(can)h(force)h(a)g(new) e(primary)g(arra)m(y)i(to)g(b)s(e)e(inserted)h(at)h(the)f(b)s(eginning) f(of)h(the)h(FITS)227 4908 y(\014le)29 b(b)m(y)f(setting)i(status)e(=)h (-9)g(prior)e(to)j(calling)g(the)e(routine.)40 b(In)28 b(this)g(case)i(the)e(existing)i(primary)d(arra)m(y)227 5021 y(will)f(b)s(e)f(con)m(v)m(erted)i(to)g(an)e(IMA)m(GE)h (extension.)40 b(The)25 b(new)g(extension)i(\(or)f(primary)e(arra)m (y\))j(will)f(b)s(ecome)227 5133 y(the)32 b(CHDU.)f(The)g(FTI)s(IMGLL)f (routine)i(is)f(iden)m(tical)i(to)e(the)h(FTI)s(IMG)f(routine)g(except) h(that)f(the)h(4th)227 5246 y(parameter)25 b(\(the)g(length)g(of)f(eac) m(h)h(axis\))g(is)g(an)f(arra)m(y)h(of)f(64-bit)i(in)m(tegers)f(rather) f(than)g(an)g(arra)m(y)h(of)g(32-bit)227 5359 y(in)m(tegers.)382 5601 y Fe(FTIIMG\(unit,bitpix,naxis)o(,na)o(xes,)41 b(>)48 b(status\))382 5714 y(FTIIMGLL\(unit,bitpix,nax)o(is,)o(naxe)o(sll,)41 b(>)47 b(status\))p eop end %%Page: 40 46 TeXDict begin 40 45 bop 0 299 a Fi(40)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)0 555 y Fh(9)81 b Fi(Insert)30 b(a)i(new)f(ASCI)s(I)f (T)-8 b(ABLE)31 b(extension)h(immediately)h(follo)m(wing)f(the)g(CHDU.) g(An)m(y)f(follo)m(wing)i(exten-)227 668 y(sions)26 b(will)g(b)s(e)f (shifted)g(do)m(wn)g(to)h(mak)m(e)h(ro)s(om)e(for)h(the)f(new)g (extension.)40 b(If)25 b(there)h(are)g(no)g(other)f(follo)m(wing)227 781 y(extensions)32 b(then)f(the)h(new)f(table)h(extension)g(will)g (simply)f(b)s(e)g(app)s(ended)f(to)i(the)f(end)g(of)h(the)f(\014le.)44 b(The)227 894 y(new)33 b(extension)h(will)f(b)s(ecome)h(the)f(CHDU.)h (The)f(FTIT)-8 b(ABLL)33 b(routine)g(is)g(iden)m(tical)i(to)f(the)g (FTIT)-8 b(AB)227 1007 y(routine)36 b(except)g(that)g(the)f(2nd)g(and)g (3rd)g(parameters)g(\(that)i(giv)m(e)g(the)e(size)h(of)g(the)f(table\)) i(are)f(64-bit)227 1120 y(in)m(tegers)c(rather)e(than)g(32-bit)i(in)m (tegers.)382 1374 y Fe(FTITAB\(unit,rowlen,nrows)o(,tf)o(ield)o(s,tt)o (ype)o(,tbc)o(ol,t)o(for)o(m,tu)o(nit,)o(ext)o(name)o(,)42 b(>)716 1487 y(status\))382 1600 y(FTITABLL\(unit,rowlenll,n)o(row)o (sll,)o(tfie)o(lds)o(,tty)o(pe,t)o(bco)o(l,tf)o(orm,)o(tun)o(it,e)o (xtna)o(me,)f(>)716 1713 y(status\))0 1968 y Fh(10)46 b Fi(Insert)25 b(a)h(new)f(binary)f(table)j(extension)f(immediately)g (follo)m(wing)h(the)f(CHDU.)g(An)m(y)g(follo)m(wing)g(extensions)227 2081 y(will)39 b(b)s(e)f(shifted)g(do)m(wn)g(to)h(mak)m(e)g(ro)s(om)g (for)f(the)g(new)g(extension.)66 b(If)38 b(there)h(are)f(no)h(other)f (follo)m(wing)227 2194 y(extensions)f(then)g(the)f(new)g(bin)m(table)h (extension)h(will)f(simply)f(b)s(e)g(app)s(ended)e(to)k(the)e(end)g(of) h(the)g(\014le.)227 2307 y(The)23 b(new)g(extension)h(will)f(b)s(ecome) h(the)f(CHDU.)h(The)f(FTIBINLL)g(routine)g(is)g(iden)m(tical)i(to)f (the)g(FTIBIN)227 2419 y(routine)30 b(except)i(that)e(the)h(2nd)e (parameter)i(\(that)g(giv)m(es)g(the)g(length)f(of)h(the)f(table\))h (is)g(a)f(64-bit)i(in)m(teger)227 2532 y(rather)f(than)f(a)g(32-bit)i (in)m(teger.)382 2787 y Fe(FTIBIN\(unit,nrows,tfield)o(s,t)o(type)o (,tfo)o(rm,)o(tuni)o(t,ex)o(tna)o(me,v)o(arid)o(at)41 b(>)48 b(status\))382 2900 y(FTIBINLL\(unit,nrowsll,tf)o(iel)o(ds,t)o (type)o(,tf)o(orm,)o(tuni)o(t,e)o(xtna)o(me,v)o(ari)o(dat)41 b(>)48 b(status\))0 3267 y Fh(11)e Fi(Resize)26 b(an)e(image)i(b)m(y)e (mo)s(di\014ng)f(the)i(size,)i(dimensions,)e(and/or)f(datat)m(yp)s(e)h (of)g(the)g(curren)m(t)f(primary)f(arra)m(y)227 3380 y(or)29 b(image)i(extension.)40 b(If)29 b(the)g(new)g(image,)i(as)e(sp) s(eci\014ed)f(b)m(y)h(the)g(input)f(argumen)m(ts,)i(is)f(larger)h(than) f(the)227 3493 y(curren)m(t)34 b(existing)h(image)g(in)f(the)g(FITS)f (\014le)h(then)f(zero)i(\014ll)f(data)h(will)f(b)s(e)f(inserted)h(at)g (the)g(end)g(of)g(the)227 3606 y(curren)m(t)25 b(image)h(and)e(an)m(y)i (follo)m(wing)g(extensions)g(will)f(b)s(e)f(mo)m(v)m(ed)i(further)e (bac)m(k)h(in)g(the)g(\014le.)39 b(Similarly)-8 b(,)27 b(if)227 3719 y(the)h(new)e(image)j(is)e(smaller)h(than)f(the)g(curren) m(t)g(image)h(then)f(an)m(y)h(follo)m(wing)h(extensions)e(will)h(b)s(e) e(shifted)227 3832 y(up)32 b(to)m(w)m(ards)i(the)g(b)s(eginning)e(of)h (the)h(FITS)e(\014le)h(and)g(the)g(image)h(data)g(will)g(b)s(e)e (truncated)h(to)h(the)f(new)227 3945 y(size.)41 b(This)25 b(routine)h(rewrites)h(the)f(BITPIX,)h(NAXIS,)f(and)g(NAXISn)g(k)m(eyw) m(ords)g(with)g(the)h(appropriate)227 4058 y(v)-5 b(alues)37 b(for)f(new)h(image.)60 b(The)36 b(FTRSIMLL)g(routine)g(is)h(iden)m (tical)h(to)g(the)e(FTRSIM)g(routine)h(except)227 4171 y(that)30 b(the)g(4th)g(parameter)g(\(the)g(length)g(of)f(eac)m(h)i (axis\))f(is)g(an)f(arra)m(y)h(of)g(64-bit)h(in)m(tegers)f(rather)g (than)f(an)227 4284 y(arra)m(y)i(of)g(32-bit)g(in)m(tegers.)382 4538 y Fe(FTRSIM\(unit,bitpix,naxis)o(,na)o(xes,)o(stat)o(us\))382 4651 y(FTRSIMLL\(unit,bitpix,nax)o(is,)o(naxe)o(sll,)o(sta)o(tus\))0 4906 y Fh(12)46 b Fi(Delete)34 b(the)f(CHDU)g(in)f(the)g(FITS)f (\014le.)47 b(An)m(y)32 b(follo)m(wing)i(HDUs)f(will)g(b)s(e)e(shifted) h(forw)m(ard)g(in)g(the)g(\014le,)h(to)227 5019 y(\014ll)38 b(in)f(the)g(gap)h(created)g(b)m(y)g(the)f(deleted)h(HDU.)h(In)d(the)i (case)g(of)g(deleting)g(the)g(primary)e(arra)m(y)i(\(the)227 5132 y(\014rst)30 b(HDU)h(in)f(the)h(\014le\))g(then)f(the)h(curren)m (t)f(primary)f(arra)m(y)i(will)g(b)s(e)f(replace)h(b)m(y)g(a)g(n)m(ull) f(primary)f(arra)m(y)227 5245 y(con)m(taining)k(the)f(minim)m(um)e(set) i(of)g(required)e(k)m(eyw)m(ords)i(and)e(no)i(data.)44 b(If)31 b(there)g(are)h(more)f(extensions)227 5357 y(in)f(the)g(\014le) g(follo)m(wing)i(the)e(one)g(that)h(is)f(deleted,)h(then)f(the)g(the)g (CHDU)h(will)f(b)s(e)g(rede\014ned)e(to)j(p)s(oin)m(t)f(to)227 5470 y(the)d(follo)m(wing)h(extension.)41 b(If)26 b(there)h(are)g(no)g (follo)m(wing)h(extensions)f(then)g(the)g(CHDU)g(will)g(b)s(e)f (rede\014ned)227 5583 y(to)35 b(p)s(oin)m(t)f(to)h(the)f(previous)f (HDU.)i(The)e(output)h(HDUTYPE)g(parameter)h(indicates)f(the)h(t)m(yp)s (e)f(of)g(the)227 5696 y(new)c(CHDU)h(after)g(the)f(previous)g(CHDU)h (has)f(b)s(een)g(deleted.)p eop end %%Page: 41 47 TeXDict begin 41 46 bop 0 299 a Fg(6.3.)72 b(DEFINE)31 b(OR)f(REDEFINE)h(THE)f(STR)m(UCTURE)f(OF)h(THE)g(CHDU)1042 b Fi(41)382 555 y Fe(FTDHDU\(unit,)44 b(>)k(hdutype,status\))0 828 y Fh(13)e Fi(Cop)m(y)36 b(all)h(or)f(part)g(of)g(the)g(input)f (FITS)g(\014le)h(and)g(app)s(end)e(it)i(to)h(the)f(end)g(of)g(the)g (output)g(FITS)f(\014le.)57 b(If)227 941 y('previous')39 b(\(an)g(in)m(teger)h(parameter\))g(is)f(not)g(equal)g(to)h(0,)h(then)e (an)m(y)g(HDUs)g(preceding)g(the)g(curren)m(t)227 1054 y(HDU)f(in)e(the)h(input)e(\014le)i(will)g(b)s(e)f(copied)h(to)g(the)g (output)f(\014le.)60 b(Similarly)-8 b(,)39 b('curren)m(t')e(and)f ('follo)m(wing')227 1167 y(determine)j(whether)f(the)h(curren)m(t)g (HDU,)h(and/or)e(an)m(y)i(follo)m(wing)g(HDUs)f(in)g(the)g(input)f (\014le)g(will)i(b)s(e)227 1280 y(copied)32 b(to)g(the)g(output)f (\014le.)43 b(If)31 b(all)h(3)g(parameters)g(are)g(not)f(equal)h(to)g (zero,)h(then)e(the)g(en)m(tire)h(input)f(\014le)227 1393 y(will)g(b)s(e)e(copied.)41 b(On)30 b(return,)f(the)h(curren)m(t)g (HDU)h(in)f(the)g(input)f(\014le)h(will)h(b)s(e)e(unc)m(hanged,)h(and)g (the)g(last)227 1506 y(copied)h(HDU)g(will)g(b)s(e)f(the)g(curren)m(t)g (HDU)i(in)e(the)g(output)g(\014le.)382 1779 y Fe(FTCPFL\(iunit,)44 b(ounit,)i(previous,)f(current,)h(following,)f(>)i(status\))0 2052 y Fh(14)f Fi(Cop)m(y)35 b(the)f(en)m(tire)i(CHDU)f(from)f(the)g (FITS)g(\014le)h(asso)s(ciated)h(with)e(IUNIT)g(to)i(the)e(CHDU)h(of)g (the)g(FITS)227 2165 y(\014le)g(asso)s(ciated)h(with)e(OUNIT.)g(The)g (output)g(HDU)h(m)m(ust)f(b)s(e)g(empt)m(y)h(and)e(not)i(already)g(con) m(tain)h(an)m(y)227 2278 y(k)m(eyw)m(ords.)41 b(Space)29 b(will)g(b)s(e)g(reserv)m(ed)g(for)g(MOREKEYS)f(additional)h(k)m(eyw)m (ords)h(in)e(the)i(output)e(header)227 2391 y(if)j(there)f(is)h(not)f (already)h(enough)f(space.)382 2664 y Fe(FTCOPY\(iunit,ounit,morek)o (eys)o(,)42 b(>)47 b(status\))0 2937 y Fh(15)f Fi(Cop)m(y)27 b(the)h(header)f(\(and)g(not)g(the)g(data\))i(from)d(the)i(CHDU)g(asso) s(ciated)g(with)f(in)m(unit)g(to)h(the)f(CHDU)h(asso-)227 3050 y(ciated)f(with)e(outunit.)39 b(If)25 b(the)g(curren)m(t)h(output) f(HDU)h(is)f(not)h(completely)h(empt)m(y)-8 b(,)27 b(then)e(the)h(CHDU) g(will)227 3163 y(b)s(e)e(closed)i(and)e(a)i(new)e(HDU)h(will)h(b)s(e)e (app)s(ended)f(to)j(the)f(output)f(\014le.)39 b(This)24 b(routine)h(will)g(automatically)227 3276 y(transform)31 b(the)g(necessary)h(k)m(eyw)m(ords)f(when)g(cop)m(ying)h(a)f(primary)g (arra)m(y)h(to)f(and)g(image)i(extension,)f(or)227 3389 y(an)27 b(image)h(extension)f(to)g(a)h(primary)d(arra)m(y)-8 b(.)41 b(An)26 b(empt)m(y)h(output)f(data)i(unit)e(will)h(b)s(e)f (created)i(\(all)g(v)-5 b(alues)227 3501 y(=)30 b(0\).)382 3775 y Fe(FTCPHD\(inunit,)44 b(outunit,)h(>)j(status\))0 4048 y Fh(16)e Fi(Cop)m(y)d(just)g(the)g(data)h(from)f(the)g(CHDU)h (asso)s(ciated)g(with)f(IUNIT)g(to)h(the)f(CHDU)h(asso)s(ciated)g(with) 227 4161 y(OUNIT.)26 b(This)f(will)h(o)m(v)m(erwrite)h(an)m(y)f(data)g (previously)g(in)f(the)h(OUNIT)f(CHDU.)h(This)f(lo)m(w)i(lev)m(el)g (routine)227 4274 y(is)g(used)e(b)m(y)i(FTCOPY,)f(but)g(it)g(ma)m(y)i (also)f(b)s(e)f(useful)f(in)i(certain)g(application)h(programs)e(whic)m (h)g(w)m(an)m(t)h(to)227 4386 y(cop)m(y)j(the)f(data)h(from)f(one)g (FITS)f(\014le)h(to)h(another)f(but)g(also)h(w)m(an)m(t)g(to)g(mo)s (dify)e(the)h(header)g(k)m(eyw)m(ords)g(in)227 4499 y(the)j(pro)s (cess.)44 b(all)33 b(the)f(required)f(header)g(k)m(eyw)m(ords)h(m)m (ust)g(b)s(e)f(written)h(to)g(the)g(OUNIT)f(CHDU)h(b)s(efore)227 4612 y(calling)g(this)e(routine)382 4885 y Fe(FTCPDT\(iunit,ounit,)42 b(>)48 b(status\))0 5235 y Fd(6.3)135 b(De\014ne)45 b(or)g(Rede\014ne)h (the)f(structure)g(of)g(the)g(CHDU)0 5488 y Fi(It)32 b(should)f(rarely)h(b)s(e)g(necessary)g(to)h(call)g(the)f(subroutines)f (in)g(this)h(section.)47 b(FITSIO)30 b(in)m(ternally)j(calls)g(these)0 5601 y(routines)h(whenev)m(er)g(necessary)-8 b(,)36 b(so)e(an)m(y)g (calls)h(to)g(these)f(routines)g(b)m(y)g(application)h(programs)f(will) g(lik)m(ely)i(b)s(e)0 5714 y(redundan)m(t.)p eop end %%Page: 42 48 TeXDict begin 42 47 bop 0 299 a Fi(42)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)0 555 y Fh(1)81 b Fi(This)36 b(routine)h(forces)h (FITSIO)e(to)i(scan)f(the)g(curren)m(t)g(header)g(k)m(eyw)m(ords)h (that)f(de\014ne)g(the)g(structure)g(of)227 668 y(the)31 b(HDU)f(\(suc)m(h)g(as)h(the)f(NAXISn,)g(PCOUNT)f(and)g(GCOUNT)h(k)m (eyw)m(ords\))h(so)f(that)h(it)f(can)h(initialize)227 781 y(the)36 b(in)m(ternal)g(bu\013ers)e(that)i(describ)s(e)f(the)h (HDU)g(structure.)55 b(This)35 b(routine)h(ma)m(y)g(b)s(e)e(used)h (instead)h(of)227 894 y(the)j(more)g(complicated)i(calls)f(to)f(ftp)s (def,)h(ftadef)f(or)g(ftb)s(def.)65 b(This)38 b(routine)h(is)g(also)h (v)m(ery)f(useful)f(for)227 1007 y(reinitializing)e(the)e(structure)g (of)g(an)f(HDU,)i(if)f(the)g(n)m(um)m(b)s(er)e(of)i(ro)m(ws)g(in)g(a)g (table,)i(as)e(sp)s(eci\014ed)f(b)m(y)h(the)227 1120 y(NAXIS2)d(k)m(eyw)m(ord,)g(has)f(b)s(een)g(mo)s(di\014ed)f(from)h(its) h(initial)g(v)-5 b(alue.)382 1361 y Fe(FTRDEF\(unit,)44 b(>)k(status\))141 b(\(DEPRECATED\))0 1602 y Fh(2)81 b Fi(De\014ne)27 b(the)g(structure)g(of)g(the)g(primary)f(arra)m(y)i (or)f(IMA)m(GE)h(extension.)40 b(When)27 b(writing)g(GR)m(OUP)m(ed)h (FITS)227 1715 y(\014les)43 b(that)h(b)m(y)e(con)m(v)m(en)m(tion)k(set) d(the)g(NAXIS1)g(k)m(eyw)m(ord)h(equal)f(to)h(0,)i(ftp)s(def)c(m)m(ust) h(b)s(e)f(called)i(with)227 1828 y(naxes\(1\))27 b(=)e(1,)i(NOT)e(0,)i (otherwise)f(FITSIO)e(will)i(rep)s(ort)f(an)g(error)g(status=308)i (when)d(trying)i(to)g(write)227 1941 y(data)31 b(to)g(a)g(group.)40 b(Note:)i(it)31 b(is)g(usually)f(simpler)g(to)h(call)h(FTRDEF)e(rather) h(than)f(this)g(routine.)382 2182 y Fe(FTPDEF\(unit,bitpix,naxis)o(,na) o(xes,)o(pcou)o(nt,)o(gcou)o(nt,)41 b(>)48 b(status\))93 b(\(DEPRECATED\))0 2424 y Fh(3)81 b Fi(De\014ne)32 b(the)h(structure)f (of)g(an)h(ASCI)s(I)e(table)i(\(T)-8 b(ABLE\))33 b(extension.)48 b(Note:)e(it)33 b(is)f(usually)g(simpler)g(to)i(call)227 2537 y(FTRDEF)d(rather)f(than)h(this)f(routine.)382 2778 y Fe(FTADEF\(unit,rowlen,tfiel)o(ds,)o(tbco)o(l,tf)o(orm)o(,nro)o(ws)42 b(>)47 b(status\))f(\(DEPRECATED\))0 3019 y Fh(4)81 b Fi(De\014ne)35 b(the)h(structure)f(of)g(a)h(binary)f(table)h(\(BINT)-8 b(ABLE\))37 b(extension.)56 b(Note:)d(it)36 b(is)f(usually)g(simpler)g (to)227 3132 y(call)d(FTRDEF)f(rather)f(than)g(this)g(routine.)382 3373 y Fe(FTBDEF\(unit,tfields,tfor)o(m,v)o(arid)o(at,n)o(row)o(s)42 b(>)47 b(status\))f(\(DEPRECATED\))0 3615 y Fh(5)81 b Fi(De\014ne)34 b(the)g(size)h(of)f(the)g(Curren)m(t)f(Data)i(Unit,)h(o) m(v)m(erriding)e(the)g(length)h(of)f(the)g(data)h(unit)e(as)h (previously)227 3728 y(de\014ned)e(b)m(y)h(ftp)s(def,)g(ftadef,)i(or)e (ftb)s(def.)48 b(This)33 b(is)g(useful)f(if)i(one)f(do)s(es)g(not)h (kno)m(w)f(the)g(total)i(size)f(of)g(the)227 3841 y(data)f(unit)f(un)m (til)h(after)f(the)h(data)g(ha)m(v)m(e)g(b)s(een)f(written.)46 b(The)32 b(size)h(\(in)f(b)m(ytes\))h(of)g(an)f(ASCI)s(I)f(or)h(Binary) 227 3954 y(table)27 b(is)f(giv)m(en)g(b)m(y)g(NAXIS1)g(*)g(NAXIS2.)40 b(\(Note)27 b(that)f(to)h(determine)f(the)f(v)-5 b(alue)27 b(of)f(NAXIS1)f(it)i(is)f(often)227 4066 y(more)32 b(con)m(v)m(enien)m (t)h(to)f(read)f(the)g(v)-5 b(alue)32 b(of)f(the)h(NAXIS1)f(k)m(eyw)m (ord)h(from)e(the)i(output)e(\014le,)i(rather)f(than)227 4179 y(computing)f(the)g(ro)m(w)g(length)h(directly)f(from)f(all)i(the) f(TF)m(ORM)h(k)m(eyw)m(ord)f(v)-5 b(alues\).)41 b(Note:)h(it)30 b(is)g(usually)227 4292 y(simpler)g(to)h(call)h(FTRDEF)f(rather)f(than) g(this)g(routine.)382 4534 y Fe(FTDDEF\(unit,bytlen,)42 b(>)48 b(status\))e(\(DEPRECATED\))0 4775 y Fh(6)81 b Fi(De\014ne)22 b(the)g(zero)i(indexed)d(b)m(yte)i(o\013set)g(of)g(the)f ('heap')h(measured)e(from)h(the)h(start)g(of)f(the)g(binary)g(table)h (data.)227 4888 y(By)30 b(default)g(the)f(heap)h(is)f(assumed)g(to)h (start)g(immediately)h(follo)m(wing)g(the)f(regular)f(table)i(data,)f (i.e.,)h(at)227 5001 y(lo)s(cation)38 b(NAXIS1)f(x)g(NAXIS2.)59 b(This)36 b(routine)g(is)h(only)f(relev)-5 b(an)m(t)38 b(for)e(binary)g(tables)h(whic)m(h)g(con)m(tain)227 5114 y(v)-5 b(ariable)36 b(length)g(arra)m(y)f(columns)g(\(with)h(TF)m(ORMn) f(=)f('Pt'\).)57 b(This)34 b(subroutine)g(also)i(automatically)227 5227 y(writes)23 b(the)g(v)-5 b(alue)23 b(of)g(theap)g(to)h(a)f(k)m (eyw)m(ord)g(in)g(the)g(extension)g(header.)38 b(This)22 b(subroutine)g(m)m(ust)h(b)s(e)f(called)227 5339 y(after)27 b(the)f(required)f(k)m(eyw)m(ords)i(ha)m(v)m(e)g(b)s(een)e(written)h (\(with)g(ftph)m(bn\))f(and)h(after)g(the)h(table)g(structure)e(has)227 5452 y(b)s(een)30 b(de\014ned)f(\(with)h(ftb)s(def)7 b(\))30 b(but)g(b)s(efore)g(an)m(y)g(data)h(is)g(written)f(to)h(the)g (table.)382 5694 y Fe(FTPTHP\(unit,theap,)43 b(>)k(status\))p eop end %%Page: 43 49 TeXDict begin 43 48 bop 0 299 a Fg(6.4.)72 b(FITS)30 b(HEADER)h(I/O)f(SUBR)m(OUTINES)2086 b Fi(43)0 555 y Fd(6.4)135 b(FITS)44 b(Header)i(I/O)f(Subroutines)0 809 y Fb(6.4.1)112 b(Header)38 b(Space)h(and)f(P)m(osition)f(Routines)0 1019 y Fh(1)81 b Fi(Reserv)m(e)37 b(space)g(in)f(the)h(CHU)f(for)h (MOREKEYS)e(more)i(header)f(k)m(eyw)m(ords.)59 b(This)36 b(subroutine)f(ma)m(y)j(b)s(e)227 1132 y(called)e(to)g(reserv)m(e)g (space)f(for)g(k)m(eyw)m(ords)g(whic)m(h)g(are)g(to)h(b)s(e)e(written)h (at)g(a)h(later)g(time,)h(after)e(the)g(data)227 1245 y(unit)h(or)g(subsequen)m(t)f(extensions)h(ha)m(v)m(e)h(b)s(een)e (written)h(to)h(the)f(FITS)f(\014le.)58 b(If)35 b(this)h(subroutine)f (is)h(not)227 1358 y(explicitly)29 b(called,)g(then)e(the)g(initial)i (size)e(of)h(the)f(FITS)f(header)h(will)h(b)s(e)e(limited)i(to)g(the)f (space)h(a)m(v)-5 b(ailable)227 1471 y(at)24 b(the)g(time)g(that)g(the) g(\014rst)f(data)h(is)g(written)f(to)h(the)g(asso)s(ciated)h(data)f (unit.)38 b(FITSIO)22 b(has)i(the)f(abilit)m(y)i(to)227 1584 y(dynamically)g(add)e(more)h(space)h(to)g(the)f(header)g(if)g (needed,)h(ho)m(w)m(ev)m(er)g(it)g(is)f(more)g(e\016cien)m(t)h(to)g (preallo)s(cate)227 1697 y(the)31 b(required)e(space)i(if)g(the)f(size) h(is)g(kno)m(wn)f(in)g(adv)-5 b(ance.)382 1958 y Fe (FTHDEF\(unit,morekeys,)42 b(>)47 b(status\))0 2219 y Fh(2)81 b Fi(Return)23 b(the)i(n)m(um)m(b)s(er)e(of)h(existing)i(k)m (eyw)m(ords)e(in)h(the)f(CHU)g(\(NOT)h(including)f(the)g(END)h(k)m(eyw) m(ord)g(whic)m(h)f(is)227 2332 y(not)g(considered)f(a)g(real)h(k)m(eyw) m(ord\))g(and)f(the)g(remaining)h(space)f(a)m(v)-5 b(ailable)26 b(to)e(write)f(additional)i(k)m(eyw)m(ords)227 2445 y(in)39 b(the)h(CHU.)f(\(returns)f(KEYSADD)i(=)f(-1)h(if)f(the)g(header)g(has)g (not)h(y)m(et)g(b)s(een)e(closed\).)69 b(Note)40 b(that)227 2558 y(FITSIO)23 b(will)i(attempt)g(to)g(dynamically)g(add)e(space)i (for)f(more)g(k)m(eyw)m(ords)h(if)f(required)f(when)g(app)s(ending)227 2671 y(new)30 b(k)m(eyw)m(ords)h(to)g(a)g(header.)382 2932 y Fe(FTGHSP\(iunit,)44 b(>)j(keysexist,keysadd,status\))0 3194 y Fh(3)81 b Fi(Return)38 b(the)i(n)m(um)m(b)s(er)e(of)h(k)m(eyw)m (ords)h(in)f(the)g(header)g(and)g(the)g(curren)m(t)h(p)s(osition)f(in)g (the)g(header.)68 b(This)227 3307 y(returns)37 b(the)g(n)m(um)m(b)s(er) f(of)i(the)g(k)m(eyw)m(ord)g(record)f(that)h(will)g(b)s(e)f(read)g (next)h(\(or)g(one)g(greater)g(than)g(the)227 3420 y(p)s(osition)29 b(of)f(the)h(last)g(k)m(eyw)m(ord)g(that)g(w)m(as)f(read)g(or)h (written\).)40 b(A)29 b(v)-5 b(alue)28 b(of)h(1)g(is)f(returned)f(if)h (the)h(p)s(oin)m(ter)227 3533 y(is)i(p)s(ositioned)f(at)h(the)g(b)s (eginning)e(of)i(the)g(header.)382 3794 y Fe(FTGHPS\(iunit,)44 b(>)j(keysexist,key_no,status\))0 4086 y Fb(6.4.2)112 b(Read)38 b(or)f(W)-9 b(rite)37 b(Standard)i(Header)e(Routines)0 4306 y Fi(These)31 b(subroutines)e(pro)m(vide)i(a)g(simple)g(metho)s(d) f(of)h(reading)g(or)g(writing)g(most)g(of)g(the)g(k)m(eyw)m(ord)g(v)-5 b(alues)31 b(that)0 4419 y(are)d(normally)g(required)f(in)h(a)g(FITS)f (\014les.)40 b(These)27 b(subroutines)g(are)h(pro)m(vided)f(for)h(con)m (v)m(enience)h(only)f(and)g(are)0 4532 y(not)36 b(required)e(to)i(b)s (e)f(used.)55 b(If)35 b(preferred,)h(users)e(ma)m(y)i(call)h(the)f(lo)m (w)m(er-lev)m(el)i(subroutines)c(describ)s(ed)h(in)g(the)0 4644 y(previous)30 b(section)i(to)g(individually)f(read)f(or)h(write)g (the)g(required)f(k)m(eyw)m(ords.)43 b(Note)32 b(that)g(in)e(most)i (cases,)g(the)0 4757 y(required)26 b(k)m(eyw)m(ords)h(suc)m(h)g(as)g (NAXIS,)f(TFIELD,)h(TTYPEn,)g(etc,)i(whic)m(h)d(de\014ne)g(the)h (structure)f(of)h(the)g(HDU)0 4870 y(m)m(ust)j(b)s(e)g(written)g(to)i (the)e(header)g(b)s(efore)g(an)m(y)h(data)g(can)g(b)s(e)e(written)i(to) g(the)g(image)g(or)g(table.)0 5132 y Fh(1)81 b Fi(Put)37 b(the)i(primary)e(header)h(or)g(IMA)m(GE)h(extension)f(k)m(eyw)m(ords)h (in)m(to)g(the)f(CHU.)g(There)g(are)g(2)h(a)m(v)-5 b(ailable)227 5245 y(routines:)39 b(The)27 b(simpler)f(FTPHPS)h(routine)g(is)g(equiv) -5 b(alen)m(t)29 b(to)e(calling)i(ftphpr)c(with)i(the)g(default)h(v)-5 b(alues)227 5357 y(of)35 b(SIMPLE)f(=)g(true,)i(p)s(coun)m(t)e(=)g(0,)i (gcoun)m(t)g(=)e(1,)i(and)e(EXTEND)h(=)f(true.)53 b(PCOUNT,)34 b(GCOUNT)227 5470 y(and)23 b(EXTEND)h(k)m(eyw)m(ords)g(are)h(not)f (required)f(in)g(the)h(primary)f(header)g(and)h(are)g(only)g(written)g (if)f(p)s(coun)m(t)227 5583 y(is)31 b(not)g(equal)h(to)g(zero,)g(gcoun) m(t)g(is)f(not)g(equal)g(to)h(zero)g(or)f(one,)g(and)g(if)g(extend)g (is)g(TR)m(UE,)g(resp)s(ectiv)m(ely)-8 b(.)227 5696 y(When)30 b(writing)h(to)g(an)f(IMA)m(GE)i(extension,)f(the)f(SIMPLE)g(and)g (EXTEND)g(parameters)h(are)g(ignored.)p eop end %%Page: 44 50 TeXDict begin 44 49 bop 0 299 a Fi(44)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)382 555 y Fe(FTPHPS\(unit,bitpix,naxis)o(,na)o(xes,)41 b(>)48 b(status\))382 781 y(FTPHPR\(unit,simple,bitpi)o(x,n)o(axis)o (,nax)o(es,)o(pcou)o(nt,g)o(cou)o(nt,e)o(xten)o(d,)41 b(>)48 b(status\))0 1082 y Fh(2)81 b Fi(Get)44 b(primary)e(header)h(or) h(IMA)m(GE)g(extension)g(k)m(eyw)m(ords)g(from)f(the)g(CHU.)h(When)f (reading)g(from)g(an)227 1195 y(IMA)m(GE)32 b(extension)f(the)f(SIMPLE) g(and)f(EXTEND)i(parameters)g(are)f(ignored.)382 1495 y Fe(FTGHPR\(unit,maxdim,)42 b(>)48 b(simple,bitpix,naxis,naxe)o(s,p)o (coun)o(t,gc)o(oun)o(t,ex)o(tend)o(,)716 1608 y(status\))0 1909 y Fh(3)81 b Fi(Put)34 b(the)h(ASCI)s(I)f(table)i(header)f(k)m(eyw) m(ords)g(in)m(to)h(the)f(CHU.)h(The)e(optional)i(TUNITn)e(and)h (EXTNAME)227 2021 y(k)m(eyw)m(ords)c(are)g(written)f(only)h(if)f(the)h (input)e(string)h(v)-5 b(alues)31 b(are)g(not)f(blank.)382 2322 y Fe(FTPHTB\(unit,rowlen,nrows)o(,tf)o(ield)o(s,tt)o(ype)o(,tbc)o (ol,t)o(for)o(m,tu)o(nit,)o(ext)o(name)o(,)42 b(>)716 2435 y(status\))0 2736 y Fh(4)81 b Fi(Get)31 b(the)g(ASCI)s(I)d(table)k (header)e(k)m(eyw)m(ords)h(from)e(the)i(CHU)382 3036 y Fe(FTGHTB\(unit,maxdim,)42 b(>)48 b(rowlen,nrows,tfields,tty)o(pe,)o (tbco)o(l,tf)o(orm)o(,tun)o(it,)716 3149 y(extname,status\))0 3450 y Fh(5)81 b Fi(Put)34 b(the)h(binary)f(table)i(header)e(k)m(eyw)m (ords)i(in)m(to)f(the)g(CHU.)g(The)g(optional)h(TUNITn)e(and)g(EXTNAME) 227 3563 y(k)m(eyw)m(ords)i(are)g(written)f(only)g(if)h(the)f(input)f (string)i(v)-5 b(alues)35 b(are)h(not)f(blank.)55 b(The)35 b(p)s(coun)m(t)g(parameter,)227 3675 y(whic)m(h)f(sp)s(eci\014es)g(the) h(size)g(of)g(the)f(v)-5 b(ariable)35 b(length)g(arra)m(y)g(heap,)g (should)f(initially)h(=)f(0;)j(FITSIO)d(will)227 3788 y(automatically)27 b(up)s(date)c(the)h(PCOUNT)f(k)m(eyw)m(ord)h(v)-5 b(alue)24 b(if)g(an)m(y)g(v)-5 b(ariable)25 b(length)f(arra)m(y)h(data) f(is)g(written)227 3901 y(to)31 b(the)e(heap.)41 b(The)29 b(TF)m(ORM)g(k)m(eyw)m(ord)h(v)-5 b(alue)30 b(for)g(v)-5 b(ariable)30 b(length)g(v)m(ector)h(columns)e(should)g(ha)m(v)m(e)i (the)227 4014 y(form)c('Pt\(len\)')j(or)d('1Pt\(len\)')j(where)d(`t')h (is)g(the)g(data)g(t)m(yp)s(e)g(co)s(de)f(letter)i(\(A,I,J,E,D,)g (etc.\))42 b(and)27 b(`len')h(is)227 4127 y(an)g(in)m(teger)i(sp)s (ecifying)e(the)g(maxim)m(um)g(length)g(of)h(the)f(v)m(ectors)h(in)f (that)h(column)f(\(len)g(m)m(ust)g(b)s(e)g(greater)227 4240 y(than)j(or)h(equal)f(to)i(the)e(longest)i(v)m(ector)f(in)f(the)h (column\).)44 b(If)30 b(`len')i(is)g(not)f(sp)s(eci\014ed)g(when)f(the) i(table)g(is)227 4353 y(created)27 b(\(e.g.,)i(the)d(input)f(TF)m(ORMn) h(v)-5 b(alue)26 b(is)g(just)f('1Pt'\))j(then)d(FITSIO)g(will)h(scan)g (the)g(column)g(when)227 4466 y(the)k(table)g(is)f(\014rst)g(closed)h (and)f(will)g(app)s(end)f(the)h(maxim)m(um)h(length)f(to)h(the)g(TF)m (ORM)f(k)m(eyw)m(ord)h(v)-5 b(alue.)227 4579 y(Note)28 b(that)e(if)g(the)g(table)h(is)f(subsequen)m(tly)g(mo)s(di\014ed)f(to)i (increase)f(the)h(maxim)m(um)f(length)g(of)g(the)g(v)m(ectors)227 4692 y(then)k(the)h(mo)s(difying)f(program)g(is)g(resp)s(onsible)g(for) g(also)h(up)s(dating)e(the)i(TF)m(ORM)g(k)m(eyw)m(ord)g(v)-5 b(alue.)382 4992 y Fe(FTPHBN\(unit,nrows,tfield)o(s,t)o(type)o(,tfo)o (rm,)o(tuni)o(t,ex)o(tna)o(me,v)o(arid)o(at,)41 b(>)48 b(status\))0 5293 y Fh(6)81 b Fi(Get)31 b(the)g(binary)e(table)i (header)g(k)m(eyw)m(ords)f(from)g(the)h(CHU)382 5593 y Fe(FTGHBN\(unit,maxdim,)42 b(>)48 b(nrows,tfields,ttype,tfor)o(m,t)o (unit)o(,ext)o(nam)o(e,va)o(rida)o(t,)716 5706 y(status\))p eop end %%Page: 45 51 TeXDict begin 45 50 bop 0 299 a Fg(6.4.)72 b(FITS)30 b(HEADER)h(I/O)f(SUBR)m(OUTINES)2086 b Fi(45)0 555 y Fb(6.4.3)112 b(W)-9 b(rite)37 b(Keyw)m(ord)g(Subroutines)0 764 y Fh(1)81 b Fi(Put)30 b(\(app)s(end\))f(an)h(80-c)m(haracter)j (record)e(in)m(to)g(the)g(CHU.)382 1020 y Fe(FTPREC\(unit,card,)43 b(>)k(status\))0 1276 y Fh(2)81 b Fi(Put)36 b(\(app)s(end\))g(a)i (COMMENT)f(k)m(eyw)m(ord)g(in)m(to)h(the)g(CHU.)f(Multiple)h(COMMENT)f (k)m(eyw)m(ords)g(will)h(b)s(e)227 1389 y(written)31 b(if)f(the)h(input)e(commen)m(t)i(string)g(is)f(longer)h(than)f(72)i(c) m(haracters.)382 1645 y Fe(FTPCOM\(unit,comment,)42 b(>)48 b(status\))0 1901 y Fh(3)81 b Fi(Put)24 b(\(app)s(end\))g(a)h(HISTOR)-8 b(Y)25 b(k)m(eyw)m(ord)g(in)m(to)h(the)f(CHU.)g(Multiple)h(HISTOR)-8 b(Y)24 b(k)m(eyw)m(ords)h(will)h(b)s(e)e(written)227 2014 y(if)31 b(the)f(input)g(history)g(string)g(is)h(longer)g(than)f (72)h(c)m(haracters.)382 2270 y Fe(FTPHIS\(unit,history,)42 b(>)48 b(status\))0 2526 y Fh(4)81 b Fi(Put)36 b(\(app)s(end\))f(the)h (D)m(A)-8 b(TE)38 b(k)m(eyw)m(ord)f(in)m(to)g(the)f(CHU.)h(The)f(k)m (eyw)m(ord)g(v)-5 b(alue)37 b(will)g(con)m(tain)h(the)e(curren)m(t)227 2639 y(system)c(date)g(as)g(a)f(c)m(haracter)i(string)f(in)f ('dd/mm/yy')g(format.)44 b(If)31 b(a)h(D)m(A)-8 b(TE)32 b(k)m(eyw)m(ord)g(already)g(exists)227 2752 y(in)j(the)g(header,)i (then)d(this)h(subroutine)f(will)i(simply)e(up)s(date)h(the)g(k)m(eyw)m (ord)g(v)-5 b(alue)36 b(in-place)g(with)f(the)227 2865 y(curren)m(t)30 b(date.)382 3121 y Fe(FTPDAT\(unit,)44 b(>)k(status\))0 3377 y Fh(5)81 b Fi(Put)22 b(\(app)s(end\))f(a)i(new)f (k)m(eyw)m(ord)h(of)g(the)f(appropriate)h(datat)m(yp)s(e)g(in)m(to)h (the)e(CHU.)h(Note)h(that)f(FTPKYS)f(will)227 3490 y(only)33 b(write)g(string)f(v)-5 b(alues)33 b(up)e(to)j(68)f(c)m(haracters)h(in) e(length;)i(longer)f(strings)g(will)f(b)s(e)g(truncated.)47 b(The)227 3603 y(FTPKLS)27 b(routine)h(can)h(b)s(e)f(used)f(to)i(write) f(longer)h(strings,)g(using)e(a)i(non-standard)e(FITS)h(con)m(v)m(en)m (tion.)227 3716 y(The)23 b(E)h(and)f(D)h(v)m(ersions)g(of)g(this)f (routine)h(ha)m(v)m(e)h(the)f(added)f(feature)h(that)g(if)g(the)g ('decimals')h(parameter)f(is)227 3829 y(negativ)m(e,)i(then)20 b(the)i('G')g(displa)m(y)f(format)g(rather)g(then)g(the)g('E')h(format) f(will)h(b)s(e)e(used)g(when)g(constructing)227 3942 y(the)25 b(k)m(eyw)m(ord)f(v)-5 b(alue,)26 b(taking)f(the)g(absolute)g (v)-5 b(alue)24 b(of)h('decimals')g(for)f(the)g(precision.)39 b(This)23 b(will)i(suppress)227 4055 y(trailing)35 b(zeros,)h(and)d (will)i(use)e(a)i(\014xed)e(format)h(rather)g(than)f(an)h(exp)s(onen)m (tial)h(format,)h(dep)s(ending)c(on)227 4168 y(the)f(magnitude)f(of)h (the)f(v)-5 b(alue.)382 4424 y Fe(FTPKY[JKLS]\(unit,keyword)o(,ke)o (yval)o(,com)o(men)o(t,)42 b(>)47 b(status\))382 4537 y(FTPKY[EDFG]\(unit,keyword)o(,ke)o(yval)o(,dec)o(ima)o(ls,c)o(omme)o (nt,)41 b(>)48 b(status\))0 4793 y Fh(6)81 b Fi(Put)33 b(\(app)s(end\))h(a)g(string)g(v)-5 b(alued)34 b(k)m(eyw)m(ord)h(in)m (to)g(the)g(CHU)f(whic)m(h)g(ma)m(y)g(b)s(e)g(longer)h(than)e(68)i(c)m (haracters)227 4906 y(in)j(length.)64 b(This)37 b(uses)h(the)g(Long)g (String)g(Keyw)m(ord)g(con)m(v)m(en)m(tion)i(that)e(is)g(describ)s(ed)f (in)h(the)g("Usage)227 5019 y(Guidelines)33 b(and)e(Suggestions")j (section)f(of)g(this)f(do)s(cumen)m(t.)46 b(Since)33 b(this)f(uses)g(a)g(non-standard)g(FITS)227 5132 y(con)m(v)m(en)m(tion) 38 b(to)d(enco)s(de)h(the)f(long)h(k)m(eyw)m(ord)f(string,)i(programs)d (whic)m(h)h(use)g(this)g(routine)g(should)f(also)227 5245 y(call)e(the)e(FTPLSW)g(routine)h(to)g(add)e(some)i(COMMENT)f(k)m (eyw)m(ords)h(to)g(w)m(arn)f(users)f(of)i(the)f(FITS)g(\014le)227 5357 y(that)36 b(this)f(con)m(v)m(en)m(tion)j(is)d(b)s(eing)g(used.)55 b(FTPLSW)35 b(also)h(writes)g(a)f(k)m(eyw)m(ord)h(called)h(LONGSTRN)d (to)227 5470 y(record)c(the)h(v)m(ersion)f(of)h(the)f(longstring)h(con) m(v)m(en)m(tion)h(that)f(has)f(b)s(een)g(used,)f(in)h(case)h(a)g(new)f (con)m(v)m(en)m(tion)227 5583 y(is)f(adopted)g(at)g(some)g(p)s(oin)m(t) f(in)h(the)f(future.)40 b(If)28 b(the)g(LONGSTRN)g(k)m(eyw)m(ord)h(is)g (already)g(presen)m(t)f(in)h(the)227 5696 y(header,)i(then)f(FTPLSW)g (will)g(simply)g(return)g(and)f(will)i(not)g(write)f(duplicate)h(k)m (eyw)m(ords.)p eop end %%Page: 46 52 TeXDict begin 46 51 bop 0 299 a Fi(46)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)382 555 y Fe(FTPKLS\(unit,keyword,keyv)o(al,)o(comm)o (ent,)41 b(>)47 b(status\))382 668 y(FTPLSW\(unit,)d(>)k(status\))0 889 y Fh(7)81 b Fi(Put)30 b(\(app)s(end\))g(a)h(new)f(k)m(eyw)m(ord)h (with)f(an)h(unde\014ned,)e(or)h(n)m(ull,)h(v)-5 b(alue)31 b(in)m(to)h(the)f(CHU.)g(The)f(v)-5 b(alue)31 b(string)227 1002 y(of)g(the)f(k)m(eyw)m(ord)h(is)g(left)g(blank)f(in)g(this)g (case.)382 1223 y Fe(FTPKYU\(unit,keyword,comm)o(ent)o(,)42 b(>)47 b(status\))0 1445 y Fh(8)81 b Fi(Put)41 b(\(app)s(end\))g(a)i(n) m(um)m(b)s(ered)d(sequence)j(of)f(k)m(eyw)m(ords)g(in)m(to)h(the)g (CHU.)f(One)f(ma)m(y)i(app)s(end)d(the)j(same)227 1558 y(commen)m(t)37 b(to)g(ev)m(ery)g(k)m(eyw)m(ord)g(\(and)f(eliminate)h (the)g(need)f(to)h(ha)m(v)m(e)g(an)f(arra)m(y)h(of)f(iden)m(tical)i (commen)m(t)227 1670 y(strings,)g(one)e(for)g(eac)m(h)h(k)m(eyw)m (ord\))g(b)m(y)f(including)g(the)g(amp)s(ersand)e(c)m(haracter)k(as)e (the)h(last)g(non-blank)227 1783 y(c)m(haracter)g(in)e(the)h (\(\014rst\))f(COMMENTS)f(string)h(parameter.)56 b(This)35 b(same)g(string)h(will)f(then)g(b)s(e)g(used)227 1896 y(for)30 b(the)g(commen)m(t)h(\014eld)f(in)f(all)i(the)f(k)m(eyw)m (ords.)41 b(\(Note)32 b(that)e(the)g(SPP)f(v)m(ersion)i(of)f(these)g (routines)g(only)227 2009 y(supp)s(orts)f(a)i(single)g(commen)m(t)g (string\).)382 2230 y Fe(FTPKN[JKLS]\(unit,keyroot)o(,st)o(artn)o(o,no) o(_ke)o(ys,k)o(eyva)o(ls,)o(comm)o(ents)o(,)42 b(>)47 b(status\))382 2343 y(FTPKN[EDFG]\(unit,keyroot)o(,st)o(artn)o(o,no)o (_ke)o(ys,k)o(eyva)o(ls,)o(deci)o(mals)o(,co)o(mmen)o(ts,)41 b(>)907 2456 y(status\))0 2677 y Fh(9)81 b Fi(Cop)m(y)21 b(an)h(indexed)f(k)m(eyw)m(ord)i(from)e(one)h(HDU)h(to)f(another,)i(mo) s(difying)e(the)g(index)f(n)m(um)m(b)s(er)f(of)i(the)g(k)m(eyw)m(ord) 227 2790 y(name)37 b(in)f(the)g(pro)s(cess.)58 b(F)-8 b(or)37 b(example,)i(this)d(routine)h(could)f(read)g(the)h(TLMIN3)f(k)m (eyw)m(ord)h(from)f(the)227 2903 y(input)28 b(HDU)h(\(b)m(y)f(giving)h (k)m(eyro)s(ot)h(=)d("TLMIN")i(and)f(inn)m(um)f(=)h(3\))h(and)f(write)g (it)h(to)g(the)f(output)g(HDU)227 3016 y(with)36 b(the)g(k)m(eyw)m(ord) h(name)f(TLMIN4)g(\(b)m(y)g(setting)i(outn)m(um)d(=)h(4\).)58 b(If)36 b(the)g(input)f(k)m(eyw)m(ord)i(do)s(es)f(not)227 3129 y(exist,)c(then)e(this)g(routine)g(simply)g(returns)f(without)i (indicating)g(an)f(error.)382 3350 y Fe(FTCPKY\(inunit,)44 b(outunit,)h(innum,)h(outnum,)g(keyroot,)g(>)h(status\))0 3571 y Fh(10)f Fi(Put)33 b(\(app)s(end\))f(a)h('triple)h(precision')g (k)m(eyw)m(ord)f(in)m(to)h(the)g(CHU)f(in)g(F28.16)i(format.)49 b(The)33 b(\015oating)h(p)s(oin)m(t)227 3684 y(k)m(eyw)m(ord)c(v)-5 b(alue)30 b(is)f(constructed)h(b)m(y)f(concatenating)j(the)d(input)g (in)m(teger)i(v)-5 b(alue)29 b(with)g(the)h(input)e(double)227 3797 y(precision)22 b(fraction)h(v)-5 b(alue)23 b(\(whic)m(h)f(m)m(ust) g(ha)m(v)m(e)h(a)f(v)-5 b(alue)23 b(b)s(et)m(w)m(een)g(0.0)g(and)e (1.0\).)40 b(The)21 b(FTGKYT)h(routine)227 3910 y(should)35 b(b)s(e)h(used)f(to)i(read)f(this)f(k)m(eyw)m(ord)i(v)-5 b(alue,)38 b(b)s(ecause)e(the)g(other)h(k)m(eyw)m(ord)f(reading)g (subroutines)227 4023 y(will)31 b(not)g(preserv)m(e)f(the)h(full)f (precision)g(of)h(the)f(v)-5 b(alue.)382 4244 y Fe (FTPKYT\(unit,keyword,intv)o(al,)o(dblv)o(al,c)o(omm)o(ent,)41 b(>)48 b(status\))0 4466 y Fh(11)e Fi(W)-8 b(rite)36 b(k)m(eyw)m(ords)g(to)f(the)h(CHDU)f(that)h(are)f(de\014ned)f(in)g(an)h (ASCI)s(I)f(template)i(\014le.)55 b(The)34 b(format)i(of)f(the)227 4578 y(template)d(\014le)f(is)f(describ)s(ed)f(under)g(the)i(ftgthd)f (routine)g(b)s(elo)m(w.)382 4800 y Fe(FTPKTP\(unit,)44 b(filename,)i(>)h(status\))0 5021 y Fh(12)f Fi(App)s(end)28 b(the)i(ph)m(ysical)g(units)g(string)g(to)g(an)g(existing)h(k)m(eyw)m (ord.)41 b(This)29 b(routine)h(uses)f(a)h(lo)s(cal)i(con)m(v)m(en)m (tion,)227 5134 y(sho)m(wn)g(in)g(the)h(follo)m(wing)h(example,)g(in)e (whic)m(h)g(the)h(k)m(eyw)m(ord)g(units)f(are)h(enclosed)g(in)f(square) g(brac)m(k)m(ets)227 5247 y(in)e(the)h(b)s(eginning)f(of)g(the)h(k)m (eyw)m(ord)g(commen)m(t)g(\014eld.)239 5468 y Fe(VELOCITY=)809 b(12.3)46 b(/)i([km/s])e(orbital)g(speed)382 5694 y (FTPUNT\(unit,keyword,unit)o(s,)41 b(>)48 b(status\))p eop end %%Page: 47 53 TeXDict begin 47 52 bop 0 299 a Fg(6.4.)72 b(FITS)30 b(HEADER)h(I/O)f(SUBR)m(OUTINES)2086 b Fi(47)0 555 y Fb(6.4.4)112 b(Insert)38 b(Keyw)m(ord)f(Subroutines)0 762 y Fh(1)81 b Fi(Insert)26 b(a)h(new)f(k)m(eyw)m(ord)h(record)g(in)m (to)g(the)g(CHU)g(at)g(the)g(sp)s(eci\014ed)f(p)s(osition)h(\(i.e.,)i (immediately)f(preceding)227 875 y(the)34 b(\(k)m(eyno\)th)g(k)m(eyw)m (ord)g(in)f(the)h(header.\))49 b(This)33 b('insert)g(record')h (subroutine)e(is)h(somewhat)h(less)g(e\016-)227 988 y(cien)m(t)28 b(then)f(the)g('app)s(end)e(record')i(subroutine)f(\(FTPREC\))g (describ)s(ed)g(ab)s(o)m(v)m(e)i(b)s(ecause)f(the)g(remaining)227 1101 y(k)m(eyw)m(ords)k(in)f(the)h(header)f(ha)m(v)m(e)h(to)g(b)s(e)f (shifted)g(do)m(wn)g(one)h(slot.)382 1349 y Fe (FTIREC\(unit,key_no,card,)41 b(>)47 b(status\))0 1598 y Fh(2)81 b Fi(Insert)36 b(a)h(new)f(k)m(eyw)m(ord)i(in)m(to)g(the)f (CHU.)g(The)f(new)g(k)m(eyw)m(ord)i(is)f(inserted)f(immediately)i (follo)m(wing)h(the)227 1711 y(last)27 b(k)m(eyw)m(ord)g(that)f(has)g (b)s(een)g(read)g(from)f(the)h(header.)40 b(The)25 b(FTIKLS)g (subroutine)g(w)m(orks)h(the)g(same)h(as)227 1824 y(the)h(FTIKYS)e (subroutine,)h(except)i(it)f(also)g(supp)s(orts)e(long)i(string)f(v)-5 b(alues)28 b(greater)g(than)f(68)h(c)m(haracters)227 1937 y(in)36 b(length.)59 b(These)36 b('insert)g(k)m(eyw)m(ord')h (subroutines)e(are)i(somewhat)g(less)f(e\016cien)m(t)i(then)e(the)g ('app)s(end)227 2049 y(k)m(eyw)m(ord')30 b(subroutines)e(describ)s(ed)g (ab)s(o)m(v)m(e)i(b)s(ecause)f(the)g(remaining)h(k)m(eyw)m(ords)f(in)g (the)g(header)g(ha)m(v)m(e)h(to)227 2162 y(b)s(e)g(shifted)g(do)m(wn)g (one)h(slot.)382 2411 y Fe(FTIKEY\(unit,)44 b(card,)j(>)g(status\))382 2524 y(FTIKY[JKLS]\(unit,keyword)o(,ke)o(yval)o(,com)o(men)o(t,)42 b(>)47 b(status\))382 2637 y(FTIKLS\(unit,keyword,keyv)o(al,)o(comm)o (ent,)41 b(>)47 b(status\))382 2750 y(FTIKY[EDFG]\(unit,keyword)o(,ke)o (yval)o(,dec)o(ima)o(ls,c)o(omme)o(nt,)41 b(>)48 b(status\))0 2998 y Fh(3)81 b Fi(Insert)32 b(a)i(new)f(k)m(eyw)m(ord)h(with)f(an)h (unde\014ned,)e(or)h(n)m(ull,)h(v)-5 b(alue)34 b(in)m(to)h(the)e(CHU.)h (The)f(v)-5 b(alue)34 b(string)f(of)h(the)227 3111 y(k)m(eyw)m(ord)d (is)g(left)g(blank)f(in)g(this)g(case.)382 3359 y Fe (FTIKYU\(unit,keyword,comm)o(ent)o(,)42 b(>)47 b(status\))0 3648 y Fb(6.4.5)112 b(Read)38 b(Keyw)m(ord)g(Subroutines)0 3867 y Fi(These)29 b(routines)f(return)g(the)h(v)-5 b(alue)29 b(of)g(the)g(sp)s(eci\014ed)f(k)m(eyw)m(ord\(s\).)41 b(Wild)30 b(card)e(c)m(haracters)i(\(*,)h(?,)e(or)g(#\))f(ma)m(y)0 3980 y(b)s(e)f(used)h(when)f(sp)s(ecifying)h(the)g(name)g(of)g(the)g(k) m(eyw)m(ord)h(to)g(b)s(e)e(read:)39 b(a)29 b(')10 b(?')40 b(will)28 b(matc)m(h)h(an)m(y)g(single)f(c)m(haracter)0 4093 y(at)38 b(that)g(p)s(osition)f(in)g(the)h(k)m(eyw)m(ord)g(name)f (and)g(a)g('*')i(will)e(matc)m(h)h(an)m(y)g(length)g(\(including)f (zero\))h(string)g(of)0 4206 y(c)m(haracters.)65 b(The)37 b('#')h(c)m(haracter)h(will)f(matc)m(h)h(an)m(y)f(consecutiv)m(e)i (string)e(of)g(decimal)h(digits)f(\(0)h(-)f(9\).)64 b(Note)0 4319 y(that)30 b(when)f(a)g(wild)g(card)h(is)f(used)g(in)g(the)h(input) e(k)m(eyw)m(ord)i(name,)g(the)g(routine)f(will)h(only)g(searc)m(h)g (for)f(a)h(matc)m(h)0 4432 y(from)h(the)h(curren)m(t)g(header)g(p)s (osition)g(to)g(the)h(end)e(of)h(the)g(header.)45 b(It)32 b(will)g(not)g(resume)g(the)g(searc)m(h)g(from)g(the)0 4545 y(top)i(of)h(the)f(header)g(bac)m(k)h(to)g(the)f(original)h (header)f(p)s(osition)g(as)h(is)f(done)g(when)f(no)h(wildcards)f(are)i (included)0 4657 y(in)f(the)g(k)m(eyw)m(ord)h(name.)52 b(If)33 b(the)h(desired)g(k)m(eyw)m(ord)h(string)f(is)g(8-c)m (haracters)i(long)f(\(the)f(maxim)m(um)g(length)h(of)0 4770 y(a)h(k)m(eyw)m(ord)g(name\))g(then)g(a)g('*')g(ma)m(y)h(b)s(e)e (app)s(ended)f(as)h(the)h(nin)m(th)g(c)m(haracter)h(of)f(the)f(input)g (name)h(to)g(force)0 4883 y(the)31 b(k)m(eyw)m(ord)g(searc)m(h)h(to)f (stop)g(at)g(the)g(end)f(of)h(the)g(header)g(\(e.g.,)i('COMMENT)d(*')i (will)f(searc)m(h)g(for)g(the)g(next)0 4996 y(COMMENT)37 b(k)m(eyw)m(ord\).)64 b(The)37 b(\013grec)i(routine)f(ma)m(y)g(b)s(e)f (used)g(to)i(set)f(the)g(starting)g(p)s(osition)g(when)f(doing)0 5109 y(wild)30 b(card)g(searc)m(hes.)0 5357 y Fh(1)81 b Fi(Get)37 b(the)f(n)m(th)f(80-c)m(haracter)k(header)d(record)g(from)f (the)h(CHU.)h(The)e(\014rst)g(k)m(eyw)m(ord)i(in)e(the)h(header)g(is)g (at)227 5470 y(k)m(ey)p 365 5470 28 4 v 34 w(no)42 b(=)f(1;)49 b(if)42 b(k)m(ey)p 996 5470 V 34 w(no)g(=)f(0)i(then)e(this)h (subroutine)f(simple)h(mo)m(v)m(es)i(the)e(in)m(ternal)h(p)s(oin)m(ter) f(to)h(the)227 5583 y(b)s(eginning)35 b(of)h(the)g(header)f(so)h(that)g (subsequen)m(t)f(k)m(eyw)m(ord)h(op)s(erations)g(will)g(start)g(at)g (the)g(top)g(of)g(the)227 5696 y(header;)31 b(it)g(also)g(returns)e(a)i (blank)f(card)g(v)-5 b(alue)31 b(in)f(this)g(case.)p eop end %%Page: 48 54 TeXDict begin 48 53 bop 0 299 a Fi(48)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)382 555 y Fe(FTGREC\(unit,key_no,)42 b(>)48 b(card,status\))0 797 y Fh(2)81 b Fi(Get)31 b(the)g(name,)f(v)-5 b(alue)31 b(\(as)g(a)g(string\),)g(and)f(commen)m(t)i(of)e(the)h(n)m (th)f(k)m(eyw)m(ord)h(in)f(CHU.)h(This)f(routine)g(also)227 910 y(c)m(hec)m(ks)h(that)f(the)g(returned)e(k)m(eyw)m(ord)i(name)f (\(KEYW)m(ORD\))i(con)m(tains)g(only)e(legal)i(ASCI)s(I)d(c)m (haracters.)227 1023 y(Call)j(FTGREC)f(and)g(FTPSV)m(C)g(to)h(b)m (ypass)f(this)g(error)g(c)m(hec)m(k.)382 1264 y Fe (FTGKYN\(unit,key_no,)42 b(>)48 b(keyword,value,comment,st)o(atu)o(s\)) 0 1506 y Fh(3)81 b Fi(Get)31 b(the)g(80-c)m(haracter)i(header)d(record) g(for)g(the)h(named)f(k)m(eyw)m(ord)382 1748 y Fe (FTGCRD\(unit,keyword,)42 b(>)48 b(card,status\))0 1990 y Fh(4)81 b Fi(Get)26 b(the)f(next)h(k)m(eyw)m(ord)f(whose)g(name)h (matc)m(hes)g(one)f(of)h(the)f(strings)g(in)g('inclist')i(but)d(do)s (es)h(not)g(matc)m(h)i(an)m(y)227 2102 y(of)32 b(the)f(strings)g(in)g ('exclist'.)45 b(The)30 b(strings)h(in)g(inclist)h(and)f(exclist)h(ma)m (y)g(con)m(tain)h(wild)d(card)h(c)m(haracters)227 2215 y(\(*,)38 b(?,)e(and)e(#\))i(as)f(describ)s(ed)f(at)i(the)f(b)s (eginning)f(of)i(this)f(section.)56 b(This)34 b(routine)h(searc)m(hes)h (from)f(the)227 2328 y(curren)m(t)28 b(header)f(p)s(osition)h(to)g(the) g(end)f(of)h(the)g(header,)g(only)-8 b(,)29 b(and)e(do)s(es)g(not)h (con)m(tin)m(ue)h(the)f(searc)m(h)g(from)227 2441 y(the)41 b(top)g(of)g(the)g(header)g(bac)m(k)h(to)f(the)g(original)h(p)s (osition.)73 b(The)40 b(curren)m(t)h(header)f(p)s(osition)h(ma)m(y)h(b) s(e)227 2554 y(reset)33 b(with)e(the)h(ftgrec)h(routine.)44 b(Note)33 b(that)g(nexc)f(ma)m(y)g(b)s(e)f(set)h(=)g(0)g(if)f(there)h (are)g(no)g(k)m(eyw)m(ords)g(to)h(b)s(e)227 2667 y(excluded.)41 b(This)29 b(routine)i(returns)e(status)i(=)f(202)h(if)g(a)f(matc)m (hing)i(k)m(eyw)m(ord)f(is)f(not)h(found.)382 2909 y Fe(FTGNXK\(unit,inclist,ninc)o(,ex)o(clis)o(t,ne)o(xc,)41 b(>)48 b(card,status\))0 3150 y Fh(5)81 b Fi(Get)30 b(the)g(literal)i (k)m(eyw)m(ord)e(v)-5 b(alue)30 b(as)g(a)g(c)m(haracter)i(string.)40 b(Regardless)31 b(of)f(the)g(datat)m(yp)s(e)g(of)g(the)g(k)m(eyw)m (ord,)227 3263 y(this)37 b(routine)g(simply)g(returns)f(the)h(string)g (of)g(c)m(haracters)i(in)d(the)i(v)-5 b(alue)37 b(\014eld)g(of)g(the)g (k)m(eyw)m(ord)h(along)227 3376 y(with)30 b(the)h(commen)m(t)g (\014eld.)382 3618 y Fe(FTGKEY\(unit,keyword,)42 b(>)48 b(value,comment,status\))0 3860 y Fh(6)81 b Fi(Get)31 b(a)g(k)m(eyw)m(ord)g(v)-5 b(alue)30 b(\(with)h(the)f(appropriate)h (datat)m(yp)s(e\))g(and)f(commen)m(t)i(from)e(the)g(CHU)382 4101 y Fe(FTGKY[EDJKLS]\(unit,keywo)o(rd,)41 b(>)48 b (keyval,comment,status\))0 4343 y Fh(7)81 b Fi(Read)22 b(a)g(string-v)-5 b(alued)23 b(k)m(eyw)m(ord)f(and)g(return)e(the)j (string)f(length,)i(the)e(v)-5 b(alue)23 b(string,)h(and/or)e(the)g (commen)m(t)227 4456 y(\014eld.)47 b(The)32 b(\014rst)g(routine,)h (FTGKSL,)f(simply)g(returns)f(the)i(length)g(of)g(the)f(c)m(haracter)i (string)f(v)-5 b(alue)33 b(of)227 4569 y(the)c(sp)s(eci\014ed)g(k)m (eyw)m(ord.)40 b(The)29 b(second)g(routine,)h(FTGSKY,)f(also)g(returns) f(up)g(to)i(maxc)m(har)f(c)m(haracters)227 4682 y(of)i(the)f(k)m(eyw)m (ord)h(v)-5 b(alue)31 b(string,)g(starting)g(with)f(the)g(\014rstc)m (har)g(c)m(haracter,)j(and)c(the)i(k)m(eyw)m(ord)g(commen)m(t)227 4795 y(string.)49 b(The)32 b(length)i(argumen)m(t)f(returns)f(the)h (total)i(length)e(of)h(the)f(k)m(eyw)m(ord)g(v)-5 b(alue)34 b(string)f(regardless)227 4908 y(of)i(ho)m(w)f(m)m(uc)m(h)g(of)g(the)h (string)f(is)g(actually)i(returned)d(\(whic)m(h)h(dep)s(ends)e(on)j (the)f(v)-5 b(alue)35 b(of)f(the)g(\014rstc)m(har)227 5021 y(and)c(maxc)m(har)h(argumen)m(ts\).)41 b(These)30 b(routines)h(supp)s(ort)d(string)j(k)m(eyw)m(ords)f(that)h(use)f(the)h (CONTINUE)227 5133 y(con)m(v)m(en)m(tion)25 b(to)e(con)m(tin)m(ue)g (long)g(string)f(v)-5 b(alues)23 b(o)m(v)m(er)h(m)m(ultiple)f(FITS)e (header)h(records.)38 b(Normally)-8 b(,)26 b(string-)227 5246 y(v)-5 b(alued)40 b(k)m(eyw)m(ords)h(ha)m(v)m(e)g(a)g(maxim)m(um)f (length)h(of)f(68)h(c)m(haracters,)k(ho)m(w)m(ev)m(er,)f(CONTINUE'd)39 b(string)227 5359 y(k)m(eyw)m(ords)31 b(ma)m(y)g(b)s(e)f(arbitrarily)g (long.)334 5601 y Fe(FTGKSL\(unit,keyword,)42 b(>)48 b(length,status\))334 5714 y(FTGSKY\(unit,keyword,first)o(cha)o(r,ma)o (xcha)o(r,>)41 b(keyval,length,comment,sta)o(tus\))p eop end %%Page: 49 55 TeXDict begin 49 54 bop 0 299 a Fg(6.4.)72 b(FITS)30 b(HEADER)h(I/O)f(SUBR)m(OUTINES)2086 b Fi(49)0 555 y Fh(8)81 b Fi(Get)24 b(a)g(sequence)g(of)g(n)m(um)m(b)s(ered)e(k)m(eyw)m (ord)i(v)-5 b(alues.)38 b(These)24 b(routines)f(do)g(not)h(supp)s(ort)e (wild)h(card)g(c)m(haracters)227 668 y(in)30 b(the)h(ro)s(ot)g(name.) 382 929 y Fe(FTGKN[EDJKLS]\(unit,keyro)o(ot,)o(star)o(tno,)o(max)o (_key)o(s,)42 b(>)47 b(keyvals,nfound,status\))0 1189 y Fh(9)81 b Fi(Get)27 b(the)f(v)-5 b(alue)26 b(of)h(a)f(\015oating)h(p) s(oin)m(t)f(k)m(eyw)m(ord,)i(returning)d(the)h(in)m(teger)h(and)f (fractional)h(parts)f(of)g(the)g(v)-5 b(alue)227 1302 y(in)32 b(separate)g(subroutine)f(argumen)m(ts.)45 b(This)31 b(subroutine)f(ma)m(y)j(b)s(e)e(used)g(to)h(read)g(an)m(y)g(k)m(eyw)m (ord)g(but)f(is)227 1415 y(esp)s(ecially)h(useful)d(for)i(reading)f (the)h('triple)g(precision')f(k)m(eyw)m(ords)h(written)g(b)m(y)f (FTPKYT.)382 1675 y Fe(FTGKYT\(unit,keyword,)42 b(>)48 b(intval,dblval,comment,s)o(tat)o(us\))0 1936 y Fh(10)e Fi(Get)c(the)e(ph)m(ysical)i(units)e(string)g(in)h(an)f(existing)i(k)m (eyw)m(ord.)72 b(This)40 b(routine)g(uses)h(a)g(lo)s(cal)h(con)m(v)m (en)m(tion,)227 2049 y(sho)m(wn)32 b(in)g(the)h(follo)m(wing)h (example,)g(in)e(whic)m(h)g(the)h(k)m(eyw)m(ord)g(units)f(are)h (enclosed)g(in)f(square)g(brac)m(k)m(ets)227 2162 y(in)37 b(the)h(b)s(eginning)e(of)i(the)f(k)m(eyw)m(ord)h(commen)m(t)g (\014eld.)61 b(A)38 b(blank)f(string)g(is)g(returned)f(if)i(no)f(units) g(are)227 2274 y(de\014ned)29 b(for)i(the)f(k)m(eyw)m(ord.)191 2535 y Fe(VELOCITY=)809 b(12.3)46 b(/)i([km/s])e(orbital)g(speed)382 2761 y(FTGUNT\(unit,keyword,)c(>)48 b(units,status\))0 3052 y Fb(6.4.6)112 b(Mo)s(dify)39 b(Keyw)m(ord)e(Subroutines)0 3271 y Fi(Wild)32 b(card)f(c)m(haracters,)j(as)e(describ)s(ed)e(in)h (the)h(Read)g(Keyw)m(ord)f(section,)i(ab)s(o)m(v)m(e,)g(ma)m(y)g(b)s(e) d(used)h(when)g(sp)s(eci-)0 3384 y(fying)f(the)h(name)f(of)h(the)f(k)m (eyw)m(ord)h(to)g(b)s(e)f(mo)s(di\014ed.)0 3645 y Fh(1)81 b Fi(Mo)s(dify)30 b(\(o)m(v)m(erwrite\))i(the)f(n)m(th)f(80-c)m (haracter)j(header)d(record)h(in)f(the)g(CHU)382 3905 y Fe(FTMREC\(unit,key_no,card,)41 b(>)47 b(status\))0 4166 y Fh(2)81 b Fi(Mo)s(dify)37 b(\(o)m(v)m(erwrite\))j(the)e(80-c)m (haracter)j(header)c(record)h(for)f(the)h(named)f(k)m(eyw)m(ord)h(in)g (the)g(CHU.)g(This)227 4278 y(can)31 b(b)s(e)f(used)f(to)i(o)m(v)m (erwrite)h(the)f(name)f(of)h(the)f(k)m(eyw)m(ord)h(as)g(w)m(ell)g(as)g (its)g(v)-5 b(alue)30 b(and)g(commen)m(t)i(\014elds.)382 4539 y Fe(FTMCRD\(unit,keyword,card)o(,)42 b(>)47 b(status\))0 4799 y Fh(3)81 b Fi(Mo)s(dify)33 b(\(o)m(v)m(erwrite\))k(the)d(name)g (of)h(an)f(existing)h(k)m(eyw)m(ord)f(in)g(the)h(CHU)f(preserving)f (the)i(curren)m(t)e(v)-5 b(alue)227 4912 y(and)30 b(commen)m(t)h (\014elds.)382 5173 y Fe(FTMNAM\(unit,oldkey,keywo)o(rd,)41 b(>)48 b(status\))0 5433 y Fh(4)81 b Fi(Mo)s(dify)30 b(\(o)m(v)m(erwrite\))i(the)f(commen)m(t)g(\014eld)f(of)h(an)f (existing)h(k)m(eyw)m(ord)g(in)f(the)h(CHU)382 5694 y Fe(FTMCOM\(unit,keyword,comm)o(ent)o(,)42 b(>)47 b(status\))p eop end %%Page: 50 56 TeXDict begin 50 55 bop 0 299 a Fi(50)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)0 555 y Fh(5)81 b Fi(Mo)s(dify)24 b(the)h(v)-5 b(alue)25 b(and)f(commen)m(t)i(\014elds)e(of)h(an)f(existing)i(k)m(eyw) m(ord)f(in)f(the)h(CHU.)g(The)f(FTMKLS)g(subrou-)227 668 y(tine)35 b(w)m(orks)e(the)h(same)h(as)f(the)g(FTMKYS)f (subroutine,)h(except)h(it)g(also)f(supp)s(orts)e(long)j(string)f(v)-5 b(alues)227 781 y(greater)38 b(than)f(68)h(c)m(haracters)g(in)f (length.)60 b(Optionally)-8 b(,)40 b(one)d(ma)m(y)h(mo)s(dify)e(only)h (the)g(v)-5 b(alue)37 b(\014eld)g(and)227 894 y(lea)m(v)m(e)32 b(the)d(commen)m(t)i(\014eld)e(unc)m(hanged)g(b)m(y)g(setting)h(the)g (input)e(COMMENT)h(parameter)h(equal)g(to)g(the)227 1007 y(amp)s(ersand)f(c)m(haracter)k(\(&\).)42 b(The)30 b(E)g(and)g(D)h(v)m (ersions)g(of)g(this)g(routine)f(ha)m(v)m(e)i(the)f(added)f(feature)h (that)227 1120 y(if)26 b(the)h('decimals')g(parameter)g(is)f(negativ)m (e,)k(then)c(the)g('G')h(displa)m(y)f(format)h(rather)f(then)g(the)g ('E')h(format)227 1233 y(will)i(b)s(e)f(used)f(when)h(constructing)h (the)f(k)m(eyw)m(ord)h(v)-5 b(alue,)30 b(taking)f(the)g(absolute)g(v)-5 b(alue)29 b(of)f('decimals')i(for)227 1346 y(the)37 b(precision.)60 b(This)35 b(will)i(suppress)e(trailing)i(zeros,)i(and)d(will)h(use)g(a) g(\014xed)e(format)i(rather)g(than)f(an)227 1458 y(exp)s(onen)m(tial)c (format,)f(dep)s(ending)d(on)j(the)f(magnitude)h(of)f(the)h(v)-5 b(alue.)382 1687 y Fe(FTMKY[JKLS]\(unit,keyword)o(,ke)o(yval)o(,com)o (men)o(t,)42 b(>)47 b(status\))382 1800 y(FTMKLS\(unit,keyword,keyv)o (al,)o(comm)o(ent,)41 b(>)47 b(status\))382 1913 y (FTMKY[EDFG]\(unit,keyword)o(,ke)o(yval)o(,dec)o(ima)o(ls,c)o(omme)o (nt,)41 b(>)48 b(status\))0 2141 y Fh(6)81 b Fi(Mo)s(dify)22 b(the)g(v)-5 b(alue)23 b(of)f(an)g(existing)i(k)m(eyw)m(ord)e(to)h(b)s (e)f(unde\014ned,)g(or)g(n)m(ull.)38 b(The)22 b(v)-5 b(alue)22 b(string)h(of)f(the)g(k)m(eyw)m(ord)227 2254 y(is)30 b(set)h(to)g(blank.)40 b(Optionally)-8 b(,)31 b(one)f(ma)m(y)h(lea)m(v)m(e)h(the)f(commen)m(t)g(\014eld)e(unc)m (hanged)h(b)m(y)g(setting)h(the)f(input)227 2367 y(COMMENT)g(parameter) h(equal)g(to)g(the)g(amp)s(ersand)e(c)m(haracter)j(\(&\).)382 2595 y Fe(FTMKYU\(unit,keyword,comm)o(ent)o(,)42 b(>)47 b(status\))0 2881 y Fb(6.4.7)112 b(Up)s(date)39 b(Keyw)m(ord)e (Subroutines)0 3084 y Fh(1)81 b Fi(Up)s(date)36 b(an)g(80-c)m(haracter) j(record)d(in)g(the)h(CHU.)f(If)g(the)g(sp)s(eci\014ed)g(k)m(eyw)m(ord) h(already)f(exists)h(then)f(that)227 3197 y(header)j(record)f(will)h(b) s(e)f(replaced)i(with)e(the)h(input)f(CARD)g(string.)66 b(If)38 b(it)i(do)s(es)e(not)h(exist)g(then)g(the)227 3310 y(new)f(record)g(will)g(b)s(e)f(added)h(to)g(the)g(header.)64 b(The)37 b(FTUKLS)g(subroutine)g(w)m(orks)h(the)g(same)h(as)f(the)227 3423 y(FTUKYS)28 b(subroutine,)g(except)i(it)f(also)h(supp)s(orts)c (long)j(string)g(v)-5 b(alues)29 b(greater)h(than)e(68)h(c)m(haracters) h(in)227 3536 y(length.)382 3764 y Fe(FTUCRD\(unit,keyword,card)o(,)42 b(>)47 b(status\))0 3993 y Fh(2)81 b Fi(Up)s(date)44 b(the)i(v)-5 b(alue)45 b(and)g(commen)m(t)h(\014elds)e(of)h(a)h(k)m (eyw)m(ord)f(in)g(the)g(CHU.)h(The)e(sp)s(eci\014ed)g(k)m(eyw)m(ord)i (is)227 4106 y(mo)s(di\014ed)38 b(if)g(it)h(already)g(exists)g(\(b)m(y) g(calling)h(FTMKYx\))f(otherwise)f(a)h(new)f(k)m(eyw)m(ord)h(is)g (created)g(b)m(y)227 4218 y(calling)f(FTPKYx.)58 b(The)36 b(E)g(and)f(D)i(v)m(ersions)f(of)h(this)f(routine)g(ha)m(v)m(e)h(the)g (added)e(feature)i(that)g(if)f(the)227 4331 y('decimals')c(parameter)g (is)f(negativ)m(e,)i(then)d(the)h('G')h(displa)m(y)f(format)g(rather)g (then)f(the)h('E')g(format)h(will)227 4444 y(b)s(e)41 b(used)f(when)h(constructing)h(the)f(k)m(eyw)m(ord)h(v)-5 b(alue,)45 b(taking)d(the)f(absolute)h(v)-5 b(alue)42 b(of)g('decimals')g(for)227 4557 y(the)37 b(precision.)60 b(This)35 b(will)i(suppress)e(trailing)i(zeros,)i(and)d(will)h(use)g(a) g(\014xed)e(format)i(rather)g(than)f(an)227 4670 y(exp)s(onen)m(tial)c (format,)f(dep)s(ending)d(on)j(the)f(magnitude)h(of)f(the)h(v)-5 b(alue.)382 4898 y Fe(FTUKY[JKLS]\(unit,keyword)o(,ke)o(yval)o(,com)o (men)o(t,)42 b(>)47 b(status\))382 5011 y(FTUKLS\(unit,keyword,keyv)o (al,)o(comm)o(ent,)41 b(>)47 b(status\))382 5124 y (FTUKY[EDFG]\(unit,keyword)o(,ke)o(yval)o(,dec)o(ima)o(ls,c)o(omme)o (nt,)41 b(>)48 b(status\))0 5352 y Fh(3)81 b Fi(Up)s(date)23 b(the)g(v)-5 b(alue)24 b(of)g(an)f(existing)i(k)m(eyw)m(ord)f(to)g(b)s (e)f(unde\014ned,)f(or)i(n)m(ull,)h(or)e(insert)h(a)f(new)g (unde\014ned-v)-5 b(alue)227 5465 y(k)m(eyw)m(ord)30 b(if)f(it)h(do)s(esn't)f(already)h(exist.)41 b(The)29 b(v)-5 b(alue)30 b(string)f(of)g(the)h(k)m(eyw)m(ord)f(is)h(left)g (blank)f(in)f(this)i(case.)382 5694 y Fe(FTUKYU\(unit,keyword,comm)o (ent)o(,)42 b(>)47 b(status\))p eop end %%Page: 51 57 TeXDict begin 51 56 bop 0 299 a Fg(6.5.)72 b(D)m(A)-8 b(T)g(A)32 b(SCALING)e(AND)h(UNDEFINED)h(PIXEL)e(P)-8 b(ARAMETERS)1083 b Fi(51)0 555 y Fb(6.4.8)112 b(Delete)38 b(Keyw)m(ord)f(Subroutines)0 763 y Fh(1)81 b Fi(Delete)32 b(an)e(existing)h(k)m(eyw)m(ord)g(record.)40 b(The)30 b(space)h(previously)f(o)s(ccupied)g(b)m(y)g(the)g(k)m(eyw)m(ord)h(is)f (reclaimed)227 876 y(b)m(y)c(mo)m(ving)h(all)g(the)f(follo)m(wing)i (header)e(records)g(up)f(one)h(ro)m(w)h(in)e(the)i(header.)39 b(The)25 b(\014rst)h(routine)g(deletes)227 989 y(a)34 b(k)m(eyw)m(ord)f(at)h(a)g(sp)s(eci\014ed)e(p)s(osition)h(in)g(the)g (header)g(\(the)h(\014rst)e(k)m(eyw)m(ord)i(is)f(at)h(p)s(osition)f (1\),)i(whereas)227 1102 y(the)d(second)g(routine)g(deletes)h(a)f(sp)s (eci\014cally)g(named)f(k)m(eyw)m(ord.)46 b(Wild)32 b(card)f(c)m (haracters,)j(as)e(describ)s(ed)227 1215 y(in)f(the)g(Read)g(Keyw)m (ord)f(section,)i(ab)s(o)m(v)m(e,)g(ma)m(y)g(b)s(e)e(used)g(when)f(sp)s (ecifying)i(the)g(name)g(of)g(the)f(k)m(eyw)m(ord)227 1328 y(to)h(b)s(e)f(deleted)h(\(b)s(e)f(careful!\).)382 1582 y Fe(FTDREC\(unit,key_no,)42 b(>)48 b(status\))382 1695 y(FTDKEY\(unit,keyword,)42 b(>)48 b(status\))0 2028 y Fd(6.5)135 b(Data)46 b(Scaling)g(and)e(Unde\014ned)h(Pixel)h(P)l (arameters)0 2278 y Fi(These)24 b(subroutines)f(de\014ne)h(or)h(mo)s (dify)e(the)i(in)m(ternal)g(parameters)g(used)f(b)m(y)g(FITSIO)g(to)h (either)g(scale)h(the)e(data)0 2391 y(or)33 b(to)i(represen)m(t)e (unde\014ned)e(pixels.)50 b(Generally)35 b(FITSIO)d(will)i(scale)g(the) g(data)g(according)g(to)g(the)g(v)-5 b(alues)34 b(of)0 2504 y(the)e(BSCALE)g(and)f(BZER)m(O)h(\(or)h(TSCALn)d(and)i(TZER)m (On\))f(k)m(eyw)m(ords,)i(ho)m(w)m(ev)m(er)h(these)e(subroutines)f(ma)m (y)0 2617 y(b)s(e)h(used)h(to)h(o)m(v)m(erride)g(the)f(k)m(eyw)m(ord)h (v)-5 b(alues.)49 b(This)32 b(ma)m(y)i(b)s(e)f(useful)f(when)g(one)i(w) m(an)m(ts)f(to)h(read)f(or)g(write)h(the)0 2730 y(ra)m(w)c(unscaled)f (v)-5 b(alues)29 b(in)h(the)f(FITS)g(\014le.)40 b(Similarly)-8 b(,)31 b(FITSIO)d(generally)j(uses)e(the)g(v)-5 b(alue)30 b(of)g(the)f(BLANK)h(or)0 2843 y(TNULLn)35 b(k)m(eyw)m(ord)h(to)g (signify)f(an)h(unde\014ned)d(pixel,)k(but)e(these)h(routines)g(ma)m(y) g(b)s(e)e(used)h(to)h(o)m(v)m(erride)h(this)0 2956 y(v)-5 b(alue.)41 b(These)30 b(subroutines)f(do)i(not)f(create)i(or)f(mo)s (dify)e(the)i(corresp)s(onding)e(header)h(k)m(eyw)m(ord)h(v)-5 b(alues.)0 3210 y Fh(1)81 b Fi(Reset)26 b(the)g(scaling)g(factors)g(in) f(the)h(primary)f(arra)m(y)h(or)f(image)i(extension;)h(do)s(es)d(not)g (c)m(hange)i(the)f(BSCALE)227 3323 y(and)i(BZER)m(O)g(k)m(eyw)m(ord)h (v)-5 b(alues)28 b(and)g(only)g(a\013ects)i(the)e(automatic)j(scaling)e (p)s(erformed)e(when)g(the)h(data)227 3436 y(elemen)m(ts)f(are)f (written/read)g(to/from)g(the)g(FITS)f(\014le.)39 b(When)25 b(reading)h(from)f(a)h(FITS)f(\014le)g(the)h(returned)227 3549 y(data)i(v)-5 b(alue)28 b(=)f(\(the)h(v)-5 b(alue)28 b(giv)m(en)h(in)e(the)g(FITS)g(arra)m(y\))h(*)g(BSCALE)f(+)g(BZER)m(O.) g(The)g(in)m(v)m(erse)i(form)m(ula)227 3662 y(is)34 b(used)f(when)g (writing)h(data)h(v)-5 b(alues)34 b(to)g(the)g(FITS)g(\014le.)51 b(\(NOTE:)34 b(BSCALE)f(and)g(BZER)m(O)h(m)m(ust)g(b)s(e)227 3775 y(declared)d(as)g(Double)g(Precision)g(v)-5 b(ariables\).)382 4029 y Fe(FTPSCL\(unit,bscale,bzero)o(,)42 b(>)47 b(status\))0 4284 y Fh(2)81 b Fi(Reset)39 b(the)f(scaling)i(parameters)e(for)h(a)f (table)h(column;)k(do)s(es)38 b(not)g(c)m(hange)i(the)e(TSCALn)f(or)h (TZER)m(On)227 4397 y(k)m(eyw)m(ord)29 b(v)-5 b(alues)29 b(and)e(only)i(a\013ects)g(the)g(automatic)h(scaling)f(p)s(erformed)e (when)g(the)i(data)g(elemen)m(ts)h(are)227 4510 y(written/read)i (to/from)g(the)g(FITS)f(\014le.)44 b(When)31 b(reading)g(from)g(a)h (FITS)f(\014le)g(the)h(returned)e(data)i(v)-5 b(alue)227 4623 y(=)40 b(\(the)h(v)-5 b(alue)40 b(giv)m(en)h(in)f(the)g(FITS)g (arra)m(y\))g(*)h(TSCAL)e(+)g(TZER)m(O.)h(The)f(in)m(v)m(erse)i(form)m (ula)g(is)f(used)227 4736 y(when)33 b(writing)h(data)h(v)-5 b(alues)35 b(to)f(the)h(FITS)e(\014le.)52 b(\(NOTE:)34 b(TSCAL)f(and)g(TZER)m(O)g(m)m(ust)h(b)s(e)f(declared)227 4848 y(as)e(Double)g(Precision)g(v)-5 b(ariables\).)382 5103 y Fe(FTTSCL\(unit,colnum,tscal)o(,tz)o(ero,)41 b(>)48 b(status\))0 5357 y Fh(3)81 b Fi(De\014ne)36 b(the)g(in)m(teger)i(v)-5 b(alue)36 b(to)h(b)s(e)e(used)h(to)h(signify)f(unde\014ned)e(pixels)i (in)g(the)g(primary)f(arra)m(y)i(or)f(image)227 5470 y(extension.)59 b(This)35 b(is)h(only)g(used)g(if)g(BITPIX)g(=)f(8,)j (16,)h(32.)59 b(or)36 b(64)h(This)e(do)s(es)h(not)g(create)i(or)e(c)m (hange)227 5583 y(the)27 b(v)-5 b(alue)28 b(of)f(the)g(BLANK)g(k)m(eyw) m(ord)h(in)e(the)i(header.)39 b(FTPNULLL)27 b(is)g(iden)m(tical)h(to)g (FTPNUL)f(except)227 5696 y(that)k(the)g(blank)f(v)-5 b(alue)31 b(is)f(a)h(64-bit)g(in)m(teger)h(instead)f(of)f(a)h(32-bit)h (in)m(teger.)p eop end %%Page: 52 58 TeXDict begin 52 57 bop 0 299 a Fi(52)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)382 555 y Fe(FTPNUL\(unit,blank,)43 b(>)k(status\))382 668 y(FTPNULLL\(unit,blankll,)42 b(>)47 b(status\))0 919 y Fh(4)81 b Fi(De\014ne)36 b(the)g(string)g(to)g(b)s (e)f(used)g(to)i(signify)f(unde\014ned)e(pixels)i(in)f(a)h(column)g(in) g(an)f(ASCI)s(I)g(table.)58 b(This)227 1032 y(do)s(es)30 b(not)h(create)h(or)e(c)m(hange)i(the)e(v)-5 b(alue)31 b(of)g(the)f(TNULLn)g(k)m(eyw)m(ord.)382 1283 y Fe (FTSNUL\(unit,colnum,snull)41 b(>)47 b(status\))0 1534 y Fh(5)81 b Fi(De\014ne)34 b(the)h(v)-5 b(alue)34 b(to)h(b)s(e)f(used)g (to)h(signify)f(unde\014ned)e(pixels)j(in)f(an)g(in)m(teger)i(column)e (in)g(a)g(binary)g(table)227 1647 y(\(where)42 b(TF)m(ORMn)f(=)g('B',)i ('I',)f('J',)f(or)h('K'\).)g(This)f(do)s(es)g(not)h(create)h(or)e(c)m (hange)i(the)e(v)-5 b(alue)42 b(of)g(the)227 1760 y(TNULLn)d(k)m(eyw)m (ord.)71 b(FTTNULLL)39 b(is)i(iden)m(tical)h(to)e(FTTNUL)g(except)h (that)g(the)f(tn)m(ull)h(v)-5 b(alue)40 b(is)h(a)227 1872 y(64-bit)32 b(in)m(teger)g(instead)e(of)h(a)g(32-bit)g(in)m (teger.)382 2123 y Fe(FTTNUL\(unit,colnum,tnull)41 b(>)47 b(status\))382 2236 y(FTTNULLL\(unit,colnum,tnu)o(lll)o(l)42 b(>)47 b(status\))0 2569 y Fd(6.6)135 b(FITS)44 b(Primary)h(Arra)l(y)g (or)g(IMA)l(GE)g(Extension)h(I/O)f(Subroutines)0 2819 y Fi(These)26 b(subroutines)f(put)h(or)h(get)g(data)h(v)-5 b(alues)26 b(in)h(the)f(primary)g(data)h(arra)m(y)g(\(i.e.,)i(the)e (\014rst)f(HDU)h(in)f(the)h(FITS)0 2932 y(\014le\))35 b(or)g(an)f(IMA)m(GE)i(extension.)54 b(The)34 b(data)i(arra)m(y)f(is)f (represen)m(ted)h(as)g(a)g(single)g(one-dimensional)h(arra)m(y)f(of)0 3045 y(pixels)h(regardless)h(of)f(the)g(actual)h(dimensionalit)m(y)g (of)g(the)f(arra)m(y)-8 b(,)38 b(and)e(the)g(FPIXEL)g(parameter)g(giv)m (es)i(the)0 3158 y(p)s(osition)28 b(within)e(this)i(1-D)g(arra)m(y)g (of)g(the)g(\014rst)e(pixel)i(to)g(read)g(or)f(write.)40 b(Automatic)29 b(data)f(t)m(yp)s(e)g(con)m(v)m(ersion)h(is)0 3270 y(p)s(erformed)g(for)i(n)m(umeric)g(data)g(\(except)i(for)d (complex)i(data)f(t)m(yp)s(es\))h(if)f(the)g(data)g(t)m(yp)s(e)g(of)g (the)g(primary)f(arra)m(y)0 3383 y(\(de\014ned)e(b)m(y)g(the)h(BITPIX)f (k)m(eyw)m(ord\))h(di\013ers)g(from)f(the)g(data)i(t)m(yp)s(e)e(of)h (the)g(arra)m(y)g(in)f(the)h(calling)h(subroutine.)0 3496 y(The)41 b(data)i(v)-5 b(alues)42 b(are)g(also)h(scaled)f(b)m(y)g (the)g(BSCALE)f(and)g(BZER)m(O)h(header)f(v)-5 b(alues)42 b(as)g(they)g(are)g(b)s(eing)0 3609 y(written)32 b(or)g(read)g(from)g (the)g(FITS)g(arra)m(y)-8 b(.)47 b(The)31 b(ftpscl)i(subroutine)e(MUST) g(b)s(e)h(called)h(to)g(de\014ne)e(the)i(scaling)0 3722 y(parameters)h(when)e(writing)i(data)g(to)g(the)g(FITS)f(arra)m(y)h(or) f(to)h(o)m(v)m(erride)h(the)f(default)f(scaling)i(v)-5 b(alue)34 b(giv)m(en)g(in)0 3835 y(the)d(header)f(when)f(reading)i(the) f(FITS)g(arra)m(y)-8 b(.)0 3995 y(Tw)m(o)41 b(sets)f(of)h(subroutines)e (are)i(pro)m(vided)f(to)h(read)g(the)f(data)i(arra)m(y)f(whic)m(h)f (di\013er)g(in)g(the)h(w)m(a)m(y)g(unde\014ned)0 4108 y(pixels)35 b(are)h(handled.)55 b(The)35 b(\014rst)f(set)i(of)g (routines)f(\(FTGPVx\))h(simply)f(return)f(an)h(arra)m(y)h(of)g(data)g (elemen)m(ts)0 4221 y(in)c(whic)m(h)g(unde\014ned)e(pixels)i(are)h(set) f(equal)h(to)g(a)g(v)-5 b(alue)32 b(sp)s(eci\014ed)g(b)m(y)g(the)g (user)g(in)g(the)g('n)m(ullv)-5 b(al')33 b(parameter.)0 4334 y(An)h(additional)i(feature)f(of)f(these)h(subroutines)f(is)g (that)i(if)e(the)h(user)f(sets)h(n)m(ullv)-5 b(al)35 b(=)f(0,)i(then)f(no)f(c)m(hec)m(ks)i(for)0 4447 y(unde\014ned)d (pixels)j(will)g(b)s(e)e(p)s(erformed,)i(th)m(us)f(increasing)h(the)g (sp)s(eed)e(of)i(the)g(program.)55 b(The)35 b(second)h(set)g(of)0 4560 y(routines)31 b(\(FTGPFx\))i(returns)d(the)i(data)g(elemen)m(t)h (arra)m(y)f(and,)f(in)h(addition,)g(a)g(logical)i(arra)m(y)e(whic)m(h)f (de\014nes)0 4673 y(whether)40 b(the)g(corresp)s(onding)f(data)i(pixel) g(is)f(unde\014ned.)69 b(The)39 b(latter)j(set)f(of)f(subroutines)f(ma) m(y)i(b)s(e)f(more)0 4785 y(con)m(v)m(enien)m(t)33 b(to)g(use)e(in)g (some)g(circumstances,)i(ho)m(w)m(ev)m(er,)g(it)f(requires)f(an)g (additional)h(arra)m(y)g(of)g(logical)i(v)-5 b(alues)0 4898 y(whic)m(h)36 b(can)g(b)s(e)g(un)m(wieldy)f(when)h(w)m(orking)g (with)g(large)h(data)g(arra)m(ys.)58 b(Also)37 b(for)f(programmer)g (con)m(v)m(enience,)0 5011 y(sets)j(of)g(subroutines)f(to)h(directly)h (read)e(or)h(write)g(2)g(and)g(3)g(dimensional)g(arra)m(ys)g(ha)m(v)m (e)h(b)s(een)e(pro)m(vided,)j(as)0 5124 y(w)m(ell)31 b(as)f(a)g(set)g(of)g(subroutines)e(to)i(read)g(or)g(write)f(an)m(y)h (con)m(tiguous)h(rectangular)g(subset)e(of)h(pixels)g(within)f(the)0 5237 y(n-dimensional)h(arra)m(y)-8 b(.)0 5488 y Fh(1)81 b Fi(Get)39 b(the)g(data)h(t)m(yp)s(e)e(of)h(the)g(image)h(\(=)f (BITPIX)f(v)-5 b(alue\).)67 b(P)m(ossible)39 b(returned)f(v)-5 b(alues)39 b(are:)58 b(8,)41 b(16,)h(32,)227 5601 y(64,)36 b(-32,)h(or)d(-64)h(corresp)s(onding)e(to)h(unsigned)f(b)m(yte,)j (signed)e(2-b)m(yte)h(in)m(teger,)i(signed)d(4-b)m(yte)h(in)m(teger,) 227 5714 y(signed)c(8-b)m(yte)g(in)m(teger,)h(real,)g(and)d(double.)p eop end %%Page: 53 59 TeXDict begin 53 58 bop 0 299 a Fg(6.6.)72 b(FITS)30 b(PRIMAR)-8 b(Y)31 b(ARRA)-8 b(Y)31 b(OR)f(IMA)m(GE)h(EXTENSION)e(I/O)i (SUBR)m(OUTINES)589 b Fi(53)227 555 y(The)26 b(second)f(subroutine)g (is)h(similar)g(to)g(FTGIDT,)h(except)f(that)h(if)f(the)f(image)j (pixel)e(v)-5 b(alues)26 b(are)g(scaled,)227 668 y(with)h(non-default)g (v)-5 b(alues)27 b(for)g(the)h(BZER)m(O)f(and)f(BSCALE)g(k)m(eyw)m (ords,)j(then)e(this)g(routine)g(will)g(return)227 781 y(the)32 b('equiv)-5 b(alen)m(t')33 b(data)e(t)m(yp)s(e)h(that)f(is)g (needed)g(to)h(store)g(the)f(scaled)h(v)-5 b(alues.)43 b(F)-8 b(or)32 b(example,)g(if)f(BITPIX)227 894 y(=)39 b(16)g(and)g(BSCALE)f(=)g(0.1)i(then)f(the)g(equiv)-5 b(alen)m(t)40 b(data)f(t)m(yp)s(e)g(is)g(\015oating)h(p)s(oin)m(t,)h (and)d(-32)i(will)g(b)s(e)227 1007 y(returned.)65 b(There)39 b(are)g(2)g(sp)s(ecial)h(cases:)58 b(if)39 b(the)g(image)h(con)m(tains) g(unsigned)e(2-b)m(yte)i(in)m(teger)g(v)-5 b(alues,)227 1120 y(with)40 b(BITPIX)g(=)f(16,)44 b(BSCALE)39 b(=)h(1,)j(and)c(BZER) m(O)h(=)g(32768,)45 b(then)39 b(this)h(routine)g(will)h(return)e(a)227 1233 y(non-standard)26 b(v)-5 b(alue)27 b(of)g(20)h(for)f(the)g(bitpix) g(v)-5 b(alue.)40 b(Similarly)27 b(if)f(the)i(image)g(con)m(tains)g (unsigned)e(4-b)m(yte)227 1346 y(in)m(tegers,)32 b(then)e(bitpix)g (will)h(b)s(e)f(returned)f(with)h(a)h(v)-5 b(alue)31 b(of)f(40.)382 1602 y Fe(FTGIDT\(unit,)44 b(>)k(bitpix,status\))382 1715 y(FTGIET\(unit,)c(>)k(bitpix,status\))0 1971 y Fh(2)81 b Fi(Get)31 b(the)g(dimension)e(\(n)m(um)m(b)s(er)h(of)g(axes)h(=)f (NAXIS\))h(of)f(the)h(image)382 2227 y Fe(FTGIDM\(unit,)44 b(>)k(naxis,status\))0 2484 y Fh(3)81 b Fi(Get)38 b(the)f(size)h(of)f (all)h(the)f(dimensions)g(of)g(the)g(image.)62 b(The)37 b(FTGISZLL)e(routine)i(returns)f(an)h(arra)m(y)h(of)227 2597 y(64-bit)32 b(in)m(tegers)g(instead)e(of)h(32-bit)g(in)m(tegers.) 382 2853 y Fe(FTGISZ\(unit,)44 b(maxdim,)i(>)i(naxes,status\))382 2966 y(FTGISZLL\(unit,)c(maxdim,)i(>)h(naxesll,status\))0 3222 y Fh(4)81 b Fi(Get)35 b(the)f(parameters)g(that)h(de\014ne)e(the)h (t)m(yp)s(e)g(and)g(size)g(of)h(the)f(image.)53 b(This)33 b(routine)h(simply)f(com)m(bines)227 3335 y(calls)40 b(to)f(the)g(ab)s(o)m(v)m(e)h(3)f(routines.)65 b(The)38 b(FTGIPRLL)g(routine)h(returns)e(an)i(arra)m(y)g(of)g(64-bit)h(in)m (tegers)227 3448 y(instead)31 b(of)f(32-bit)i(in)m(tegers.)382 3704 y Fe(FTGIPR\(unit,)44 b(maxdim,)i(>)i(bitpix,)d(naxis,)h(naxes,)h (int)f(*status\))382 3817 y(FTGIPRLL\(unit,)e(maxdim,)i(>)h(bitpix,)f (naxis,)g(naxesll,)f(int)i(*status\))0 4073 y Fh(5)81 b Fi(Put)30 b(elemen)m(ts)h(in)m(to)h(the)e(data)h(arra)m(y)382 4330 y Fe(FTPPR[BIJKED]\(unit,group)o(,fp)o(ixel)o(,nel)o(eme)o(nts,)o (valu)o(es,)41 b(>)48 b(status\))0 4586 y Fh(6)81 b Fi(Put)30 b(elemen)m(ts)i(in)m(to)f(the)g(data)g(arra)m(y)-8 b(,)32 b(substituting)e(the)g(appropriate)h(FITS)f(n)m(ull)g(v)-5 b(alue)31 b(for)f(all)i(elemen)m(ts)227 4699 y(whic)m(h)c(are)f(equal)i (to)f(the)f(v)-5 b(alue)28 b(of)g(NULL)-10 b(V)g(AL.)28 b(F)-8 b(or)28 b(in)m(teger)h(FITS)e(arra)m(ys,)i(the)e(n)m(ull)h(v)-5 b(alue)28 b(de\014ned)e(b)m(y)227 4812 y(the)k(previous)f(call)i(to)g (FTPNUL)e(will)h(b)s(e)f(substituted;)h(for)f(\015oating)i(p)s(oin)m(t) f(FITS)f(arra)m(ys)h(\(BITPIX)f(=)227 4925 y(-32)j(or)e(-64\))i(then)e (the)h(sp)s(ecial)g(IEEE)e(NaN)i(\(Not-a-Num)m(b)s(er\))h(v)-5 b(alue)31 b(will)g(b)s(e)f(substituted.)382 5181 y Fe (FTPPN[BIJKED]\(unit,group)o(,fp)o(ixel)o(,nel)o(eme)o(nts,)o(valu)o (es,)o(null)o(val)41 b(>)48 b(status\))0 5437 y Fh(7)81 b Fi(Set)30 b(data)h(arra)m(y)g(elemen)m(ts)h(as)e(unde\014ned)382 5694 y Fe(FTPPRU\(unit,group,fpixel)o(,ne)o(leme)o(nts,)41 b(>)47 b(status\))p eop end %%Page: 54 60 TeXDict begin 54 59 bop 0 299 a Fi(54)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)0 555 y Fh(8)81 b Fi(Get)36 b(elemen)m(ts)g(from)f (the)g(data)h(arra)m(y)-8 b(.)55 b(Unde\014ned)34 b(arra)m(y)h(elemen)m (ts)i(will)e(b)s(e)g(returned)f(with)g(a)i(v)-5 b(alue)35 b(=)227 668 y(n)m(ullv)-5 b(al,)31 b(unless)f(n)m(ullv)-5 b(al)31 b(=)f(0)h(in)f(whic)m(h)g(case)h(no)g(c)m(hec)m(ks)g(for)g (unde\014ned)d(pixels)i(will)h(b)s(e)f(p)s(erformed.)382 914 y Fe(FTGPV[BIJKED]\(unit,group)o(,fp)o(ixel)o(,nel)o(eme)o(nts,)o (null)o(val)o(,)42 b(>)47 b(values,anyf,status\))0 1160 y Fh(9)81 b Fi(Get)32 b(elemen)m(ts)g(and)f(n)m(ull\015ags)g(from)g (data)h(arra)m(y)-8 b(.)44 b(An)m(y)32 b(unde\014ned)d(arra)m(y)i (elemen)m(ts)i(will)e(ha)m(v)m(e)i(the)e(corre-)227 1273 y(sp)s(onding)e(\015agv)-5 b(als)31 b(elemen)m(t)h(set)f(equal)g(to)g (.TR)m(UE.)382 1519 y Fe(FTGPF[BIJKED]\(unit,group)o(,fp)o(ixel)o(,nel) o(eme)o(nts,)41 b(>)48 b(values,flagvals,anyf,st)o(atu)o(s\))0 1765 y Fh(10)e Fi(Put)30 b(v)-5 b(alues)31 b(in)m(to)g(group)f (parameters)382 2011 y Fe(FTPGP[BIJKED]\(unit,group)o(,fp)o(arm,)o (npar)o(m,v)o(alue)o(s,)42 b(>)47 b(status\))0 2257 y Fh(11)f Fi(Get)31 b(v)-5 b(alues)31 b(from)f(group)g(parameters)382 2503 y Fe(FTGGP[BIJKED]\(unit,group)o(,fp)o(arm,)o(npar)o(m,)41 b(>)48 b(values,status\))0 2749 y Fi(The)32 b(follo)m(wing)h(4)g (subroutines)e(transfer)g(FITS)h(images)h(with)f(2)g(or)g(3)h (dimensions)e(to)i(or)f(from)g(a)h(data)f(arra)m(y)0 2862 y(whic)m(h)h(has)g(b)s(een)g(declared)g(in)g(the)h(calling)h (program.)49 b(The)33 b(dimensionalit)m(y)h(of)g(the)f(FITS)g(image)h (is)f(passed)0 2975 y(b)m(y)26 b(the)g(naxis1,)h(naxis2,)h(and)d (naxis3)i(parameters)f(and)f(the)h(declared)h(dimensions)e(of)h(the)g (program)g(arra)m(y)h(are)0 3088 y(passed)k(in)f(the)i(dim1)e(and)h (dim2)g(parameters.)43 b(Note)32 b(that)g(the)f(program)g(arra)m(y)g (do)s(es)g(not)g(ha)m(v)m(e)i(to)e(ha)m(v)m(e)i(the)0 3201 y(same)28 b(dimensions)f(as)h(the)g(FITS)e(arra)m(y)-8 b(,)30 b(but)d(m)m(ust)g(b)s(e)g(at)i(least)f(as)g(big.)40 b(F)-8 b(or)29 b(example)f(if)f(a)h(FITS)f(image)i(with)0 3314 y(NAXIS1)i(=)f(NAXIS2)h(=)f(400)i(is)e(read)h(in)m(to)g(a)g (program)f(arra)m(y)h(whic)m(h)f(is)h(dimensioned)f(as)g(512)i(x)f(512) g(pixels,)0 3427 y(then)d(the)g(image)i(will)e(just)g(\014ll)g(the)h (lo)m(w)m(er)g(left)g(corner)f(of)h(the)f(arra)m(y)h(with)f(pixels)g (in)g(the)h(range)f(1)h(-)f(400)i(in)e(the)0 3540 y(X)k(an)g(Y)h (directions.)47 b(This)31 b(has)h(the)h(e\013ect)g(of)g(taking)g(a)g (con)m(tiguous)g(set)g(of)f(pixel)h(v)-5 b(alue)33 b(in)e(the)i(FITS)e (arra)m(y)0 3653 y(and)k(writing)g(them)g(to)h(a)g(non-con)m(tiguous)g (arra)m(y)f(in)g(program)g(memory)g(\(i.e.,)j(there)e(are)f(no)m(w)h (some)f(blank)0 3766 y(pixels)c(around)e(the)h(edge)i(of)e(the)h(image) g(in)f(the)h(program)f(arra)m(y\).)0 4012 y Fh(11)46 b Fi(Put)30 b(2-D)i(image)f(in)m(to)h(the)e(data)h(arra)m(y)382 4258 y Fe(FTP2D[BIJKED]\(unit,group)o(,di)o(m1,n)o(axis)o(1,n)o(axis)o (2,im)o(age)o(,)42 b(>)47 b(status\))0 4504 y Fh(12)f Fi(Put)30 b(3-D)i(cub)s(e)d(in)m(to)j(the)e(data)h(arra)m(y)382 4750 y Fe(FTP3D[BIJKED]\(unit,group)o(,di)o(m1,d)o(im2,)o(nax)o(is1,)o (naxi)o(s2,)o(naxi)o(s3,c)o(ube)o(,)42 b(>)47 b(status\))0 4996 y Fh(13)f Fi(Get)29 b(2-D)f(image)h(from)f(the)f(data)i(arra)m(y) -8 b(.)41 b(Unde\014ned)26 b(pixels)h(in)h(the)g(arra)m(y)g(will)g(b)s (e)f(set)h(equal)g(to)h(the)e(v)-5 b(alue)227 5109 y(of)31 b('n)m(ullv)-5 b(al',)31 b(unless)f(n)m(ullv)-5 b(al=0)31 b(in)f(whic)m(h)g(case)i(no)e(testing)i(for)e(unde\014ned)e(pixels)i (will)h(b)s(e)f(p)s(erformed.)382 5355 y Fe(FTG2D[BIJKED]\(unit,group)o (,nu)o(llva)o(l,di)o(m1,)o(naxi)o(s1,n)o(axi)o(s2,)41 b(>)48 b(image,anyf,status\))0 5601 y Fh(14)e Fi(Get)31 b(3-D)h(cub)s(e)e(from)g(the)g(data)h(arra)m(y)-8 b(.)42 b(Unde\014ned)29 b(pixels)i(in)f(the)g(arra)m(y)h(will)g(b)s(e)f(set)h (equal)g(to)g(the)f(v)-5 b(alue)227 5714 y(of)31 b('n)m(ullv)-5 b(al',)31 b(unless)f(n)m(ullv)-5 b(al=0)31 b(in)f(whic)m(h)g(case)i(no) e(testing)i(for)e(unde\014ned)e(pixels)i(will)h(b)s(e)f(p)s(erformed.)p eop end %%Page: 55 61 TeXDict begin 55 60 bop 0 299 a Fg(6.7.)72 b(FITS)30 b(ASCI)s(I)f(AND)i(BINAR)-8 b(Y)31 b(T)-8 b(ABLE)31 b(D)m(A)-8 b(T)g(A)32 b(I/O)e(SUBR)m(OUTINES)979 b Fi(55)382 555 y Fe(FTG3D[BIJKED]\(unit,group)o(,nu)o(llva)o(l,di)o(m1,)o(dim2)o(,nax) o(is1)o(,nax)o(is2,)o(nax)o(is3,)41 b(>)1002 668 y(cube,anyf,status\))0 933 y Fi(The)i(follo)m(wing)h(subroutines)e(transfer)h(a)h(rectangular) g(subset)e(of)i(the)f(pixels)g(in)g(a)h(FITS)e(N-dimensional)0 1045 y(image)31 b(to)g(or)f(from)f(an)h(arra)m(y)g(whic)m(h)g(has)g(b)s (een)f(declared)h(in)g(the)g(calling)i(program.)40 b(The)29 b(fpixels)h(and)f(lpixels)0 1158 y(parameters)e(are)h(in)m(teger)g (arra)m(ys)g(whic)m(h)f(sp)s(ecify)f(the)i(starting)g(and)e(ending)h (pixels)g(in)g(eac)m(h)h(dimension)e(of)i(the)0 1271 y(FITS)36 b(image)i(that)f(are)g(to)h(b)s(e)e(read)g(or)h(written.)60 b(\(Note)38 b(that)g(these)f(are)g(the)g(starting)g(and)f(ending)h (pixels)0 1384 y(in)d(the)h(FITS)f(image,)k(not)d(in)f(the)h(declared)g (arra)m(y\).)55 b(The)34 b(arra)m(y)i(parameter)f(is)g(treated)g (simply)g(as)g(a)g(large)0 1497 y(one-dimensional)c(arra)m(y)f(of)h (the)f(appropriate)g(datat)m(yp)s(e)h(con)m(taining)h(the)e(pixel)g(v) -5 b(alues;)31 b(The)e(pixel)i(v)-5 b(alues)30 b(in)0 1610 y(the)c(FITS)f(arra)m(y)i(are)f(read/written)g(from/to)h(this)f (program)f(arra)m(y)i(in)e(strict)i(sequence)f(without)g(an)m(y)h (gaps;)g(it)0 1723 y(is)i(up)e(to)j(the)f(calling)h(routine)f(to)g (correctly)h(in)m(terpret)f(the)g(dimensionalit)m(y)h(of)f(this)g(arra) m(y)-8 b(.)41 b(The)28 b(t)m(w)m(o)i(families)0 1836 y(of)d(FITS)g(reading)g(routines)g(\(FTGSVx)g(and)g(FTGSFx)g (subroutines\))f(also)j(ha)m(v)m(e)f(an)f('incs')h(parameter)f(whic)m (h)0 1949 y(de\014nes)j(the)h(data)h(sampling)e(in)m(terv)-5 b(al)32 b(in)f(eac)m(h)h(dimension)e(of)h(the)g(FITS)f(arra)m(y)-8 b(.)43 b(F)-8 b(or)32 b(example,)g(if)f(incs\(1\)=2)0 2062 y(and)i(incs\(2\)=3)h(when)f(reading)g(a)h(2-dimensional)g(FITS)f (image,)i(then)e(only)h(ev)m(ery)g(other)f(pixel)h(in)f(the)h(\014rst)0 2175 y(dimension)e(and)h(ev)m(ery)h(3rd)e(pixel)i(in)f(the)g(second)g (dimension)f(will)i(b)s(e)e(returned)g(in)h(the)g('arra)m(y')h (parameter.)0 2287 y([Note:)39 b(the)25 b(FTGSSx)f(family)i(of)e (routines)h(whic)m(h)g(w)m(ere)g(presen)m(t)g(in)f(previous)g(v)m (ersions)h(of)g(FITSIO)f(ha)m(v)m(e)i(b)s(een)0 2400 y(sup)s(erseded)i(b)m(y)j(the)f(more)h(general)g(FTGSVx)f(family)h(of)g (routines.])0 2665 y Fh(15)46 b Fi(Put)30 b(an)g(arbitrary)g(data)h (subsection)g(in)m(to)g(the)g(data)g(arra)m(y)-8 b(.)382 2929 y Fe(FTPSS[BIJKED]\(unit,group)o(,na)o(xis,)o(naxe)o(s,f)o(pixe)o (ls,l)o(pix)o(els,)o(arra)o(y,)41 b(>)48 b(status\))0 3194 y Fh(16)e Fi(Get)30 b(an)e(arbitrary)g(data)i(subsection)e(from)g (the)h(data)g(arra)m(y)-8 b(.)42 b(Unde\014ned)27 b(pixels)h(in)h(the)f (arra)m(y)i(will)e(b)s(e)g(set)227 3306 y(equal)k(to)h(the)e(v)-5 b(alue)33 b(of)e('n)m(ullv)-5 b(al',)33 b(unless)e(n)m(ullv)-5 b(al=0)33 b(in)e(whic)m(h)g(case)i(no)e(testing)i(for)e(unde\014ned)f (pixels)227 3419 y(will)h(b)s(e)f(p)s(erformed.)382 3684 y Fe(FTGSV[BIJKED]\(unit,group)o(,na)o(xis,)o(naxe)o(s,f)o(pixe)o(ls,l) o(pix)o(els,)o(incs)o(,nu)o(llva)o(l,)42 b(>)1002 3797 y(array,anyf,status\))0 4061 y Fh(17)k Fi(Get)34 b(an)f(arbitrary)g (data)g(subsection)g(from)g(the)g(data)g(arra)m(y)-8 b(.)50 b(An)m(y)33 b(Unde\014ned)e(pixels)i(in)g(the)g(arra)m(y)h(will) 227 4174 y(ha)m(v)m(e)e(the)e(corresp)s(onding)g('\015agv)-5 b(als')31 b(elemen)m(t)h(set)f(equal)g(to)g(.TR)m(UE.)382 4438 y Fe(FTGSF[BIJKED]\(unit,group)o(,na)o(xis,)o(naxe)o(s,f)o(pixe)o (ls,l)o(pix)o(els,)o(incs)o(,)42 b(>)1002 4551 y (array,flagvals,anyf,statu)o(s\))0 4890 y Fd(6.7)135 b(FITS)44 b(ASCI)t(I)g(and)h(Binary)g(T)-11 b(able)45 b(Data)h(I/O)f(Subroutines)0 5145 y Fb(6.7.1)112 b(Column)39 b(Information)f(Subroutines)0 5357 y Fh(1)81 b Fi(Get)37 b(the)f(n)m(um)m(b)s(er)f(of)i(ro)m(ws)f(or)g(columns)g(in)g(the)h (curren)m(t)f(FITS)g(table.)59 b(The)36 b(n)m(um)m(b)s(er)f(of)h(ro)m (ws)h(is)f(giv)m(en)227 5470 y(b)m(y)f(the)h(NAXIS2)f(k)m(eyw)m(ord)h (and)f(the)g(n)m(um)m(b)s(er)f(of)h(columns)g(is)g(giv)m(en)h(b)m(y)g (the)f(TFIELDS)g(k)m(eyw)m(ord)g(in)227 5583 y(the)d(header)f(of)h(the) g(table.)45 b(The)31 b(FTGNR)-10 b(WLL)32 b(routine)g(is)f(iden)m (tical)i(to)g(FTGNR)-10 b(W)32 b(except)h(that)f(the)227 5696 y(n)m(um)m(b)s(er)d(of)i(ro)m(ws)f(is)h(returned)e(as)h(a)h (64-bit)h(in)m(teger)g(rather)e(than)g(a)h(32-bit)g(in)m(teger.)p eop end %%Page: 56 62 TeXDict begin 56 61 bop 0 299 a Fi(56)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)382 555 y Fe(FTGNRW\(unit,)44 b(>)k(nrows,)e(status\)) 382 668 y(FTGNRWLL\(unit,)e(>)j(nrowsll,)f(status\))382 781 y(FTGNCL\(unit,)e(>)k(ncols,)e(status\))0 1044 y Fh(2)81 b Fi(Get)25 b(the)f(table)i(column)e(n)m(um)m(b)s(er)f(\(and)h (name\))h(of)f(the)h(column)f(whose)g(name)g(matc)m(hes)i(an)e(input)g (template)227 1157 y(name.)38 b(The)21 b(table)i(column)e(names)h(are)g (de\014ned)e(b)m(y)i(the)g(TTYPEn)e(k)m(eyw)m(ords)i(in)f(the)h(FITS)f (header.)37 b(If)22 b(a)227 1270 y(column)i(do)s(es)g(not)g(ha)m(v)m(e) h(a)f(TTYPEn)f(k)m(eyw)m(ord,)j(then)d(these)h(routines)g(assume)g (that)g(the)h(name)e(consists)227 1383 y(of)i(all)h(blank)f(c)m (haracters.)40 b(These)25 b(2)g(subroutines)e(p)s(erform)h(the)h(same)g (function)g(except)h(that)f(FTGCNO)227 1496 y(only)j(returns)e(the)h(n) m(um)m(b)s(er)f(of)h(the)g(matc)m(hing)i(column)e(whereas)g(FTGCNN)g (also)h(returns)e(the)i(name)f(of)227 1609 y(the)k(column.)40 b(If)30 b(CASESEN)f(=)h(.true.)41 b(then)30 b(the)h(column)f(name)g (matc)m(h)i(will)e(b)s(e)g(case-sensitiv)m(e.)227 1761 y(The)41 b(input)e(column)i(name)g(template)h(\(COL)-8 b(TEMPLA)g(TE\))41 b(is)g(\(1\))g(either)h(the)f(exact)h(name)f(of)g (the)227 1874 y(column)36 b(to)i(b)s(e)d(searc)m(hed)i(for,)h(or)e (\(2\))i(it)f(ma)m(y)g(con)m(tain)g(wild)f(cards)g(c)m(haracters)i (\(*,)h(?,)f(or)e(#\),)i(or)f(\(3\))227 1987 y(it)d(ma)m(y)g(con)m (tain)g(the)f(n)m(um)m(b)s(er)f(of)h(the)g(desired)g(column)g(\(where)g (the)g(n)m(um)m(b)s(er)f(is)h(expressed)f(as)h(ASCI)s(I)227 2100 y(digits\).)41 b(The)28 b(\014rst)g(2)h(wild)f(cards)g(b)s(eha)m (v)m(e)h(similarly)g(to)g(UNIX)g(\014lename)g(matc)m(hing:)40 b(the)29 b('*')g(c)m(haracter)227 2213 y(matc)m(hes)e(an)m(y)g (sequence)f(of)h(c)m(haracters)g(\(including)f(zero)h(c)m(haracters\))h (and)d(the)i(')10 b(?')39 b(c)m(haracter)28 b(matc)m(hes)227 2325 y(an)m(y)40 b(single)h(c)m(haracter.)71 b(The)39 b(#)h(wildcard)f(will)h(matc)m(h)h(an)m(y)f(consecutiv)m(e)i(string)e (of)g(decimal)g(digits)227 2438 y(\(0-9\).)45 b(As)31 b(an)g(example,)h(the)f(template)h(strings)f('AB?DE',)h('AB*E',)h(and)d ('AB*CDE')j(will)e(all)h(matc)m(h)227 2551 y(the)26 b(string)g ('ABCDE'.)i(If)d(more)h(than)g(one)g(column)g(name)g(in)g(the)g(table)h (matc)m(hes)g(the)f(template)i(string,)227 2664 y(then)33 b(the)h(\014rst)f(matc)m(h)h(is)f(returned)g(and)f(the)i(status)g(v)-5 b(alue)34 b(will)f(b)s(e)g(set)h(to)g(237)h(as)f(a)f(w)m(arning)h(that) g(a)227 2777 y(unique)g(matc)m(h)i(w)m(as)f(not)g(found.)53 b(T)-8 b(o)35 b(\014nd)f(the)h(other)g(cases)g(that)h(matc)m(h)g(the)f (template,)i(simply)e(call)227 2890 y(the)27 b(subroutine)f(again)i (lea)m(ving)h(the)e(input)f(status)h(v)-5 b(alue)28 b(equal)f(to)h(237) g(and)f(the)g(next)g(matc)m(hing)h(name)227 3003 y(will)k(then)g(b)s(e) f(returned.)43 b(Rep)s(eat)32 b(this)g(pro)s(cess)f(un)m(til)h(a)g (status)g(=)g(219)h(\(column)e(name)h(not)g(found\))f(is)227 3116 y(returned.)40 b(If)30 b(these)h(subroutines)e(fail)i(to)g(matc)m (h)g(the)g(template)h(to)f(an)m(y)g(of)f(the)h(columns)f(in)g(the)h (table,)227 3229 y(they)i(lastly)g(c)m(hec)m(k)h(if)f(the)f(template)i (can)f(b)s(e)e(in)m(terpreted)i(as)g(a)g(simple)f(p)s(ositiv)m(e)h(in)m (teger)h(\(e.g.,)h('7',)f(or)227 3342 y('512'\))i(and)d(if)g(so,)i (they)f(return)e(that)j(column)e(n)m(um)m(b)s(er.)49 b(If)33 b(no)g(matc)m(hes)i(are)f(found)e(then)h(a)h(status)g(=)227 3455 y(219)e(error)e(is)g(returned.)227 3607 y(Note)h(that)e(the)h (FITS)e(Standard)g(recommends)g(that)i(only)f(letters,)i(digits,)f(and) f(the)g(underscore)f(c)m(har-)227 3719 y(acter)44 b(b)s(e)e(used)g(in)h (column)f(names)h(\(with)g(no)f(em)m(b)s(edded)g(spaces)h(in)g(the)g (name\).)78 b(T)-8 b(railing)43 b(blank)227 3832 y(c)m(haracters)32 b(are)f(not)f(signi\014can)m(t.)382 4096 y Fe (FTGCNO\(unit,casesen,colt)o(emp)o(late)o(,)42 b(>)47 b(colnum,status\))382 4209 y(FTGCNN\(unit,casesen,colt)o(emp)o(late)o (,)42 b(>)47 b(colname,colnum,status\))0 4472 y Fh(3)81 b Fi(Get)39 b(the)g(datat)m(yp)s(e)h(of)e(a)h(column)g(in)f(an)g(ASCI)s (I)g(or)g(binary)g(table.)66 b(This)38 b(routine)h(returns)e(an)i(in)m (teger)227 4585 y(co)s(de)34 b(v)-5 b(alue)33 b(corresp)s(onding)f(to)i (the)g(datat)m(yp)s(e)g(of)f(the)g(column.)49 b(\(See)34 b(the)f(FTBNFM)i(and)d(FT)-8 b(ASFM)227 4698 y(subroutines)27 b(in)h(the)g(Utilities)j(section)e(of)f(this)g(do)s(cumen)m(t)g(for)g (a)h(list)g(of)f(the)h(co)s(de)f(v)-5 b(alues\).)41 b(The)27 b(v)m(ector)227 4811 y(rep)s(eat)38 b(coun)m(t)g(\(whic)m(h)g(is)g(alw) m(a)m(y)h(1)f(for)g(ASCI)s(I)e(table)i(columns\))g(is)g(also)g (returned.)62 b(If)37 b(the)h(sp)s(eci\014ed)227 4924 y(column)32 b(has)f(an)g(ASCI)s(I)f(c)m(haracter)j(datat)m(yp)s(e)g (\(co)s(de)f(=)f(16\))i(then)e(the)h(width)e(of)i(a)g(unit)f(string)h (in)f(the)227 5036 y(column)i(is)g(also)h(returned.)48 b(Note)34 b(that)g(this)e(routine)h(supp)s(orts)f(the)h(lo)s(cal)h(con) m(v)m(en)m(tion)h(for)e(sp)s(ecifying)227 5149 y(arra)m(ys)f(of)f (strings)g(within)f(a)i(binary)e(table)i(c)m(haracter)g(column,)g (using)e(the)h(syn)m(tax)h(TF)m(ORM)f(=)g('rAw')227 5262 y(where)f('r')g(is)h(the)f(total)i(n)m(um)m(b)s(er)d(of)i(c)m (haracters)g(\(=)g(the)f(width)g(of)g(the)g(column\))h(and)f('w')g(is)g (the)h(width)227 5375 y(of)39 b(a)f(unit)g(string)g(within)g(the)g (column.)64 b(Th)m(us)37 b(if)h(the)g(column)g(has)g(TF)m(ORM)h(=)f ('60A12')i(then)e(this)227 5488 y(routine)29 b(will)g(return)f(dataco)s (de)i(=)e(16,)i(rep)s(eat)f(=)f(60,)j(and)d(width)g(=)g(12.)41 b(\(The)29 b(TDIMn)f(k)m(eyw)m(ord)h(ma)m(y)227 5601 y(also)35 b(b)s(e)e(used)g(to)h(sp)s(ecify)f(the)h(unit)f(string)h (length;)i(The)d(pair)g(of)h(k)m(eyw)m(ords)g(TF)m(ORMn)f(=)g('60A')j (and)227 5714 y(TDIMn)30 b(=)g('\(12,5\)')j(w)m(ould)e(ha)m(v)m(e)g (the)g(same)g(e\013ect)g(as)g(TF)m(ORMn)f(=)g('60A12'\).)p eop end %%Page: 57 63 TeXDict begin 57 62 bop 0 299 a Fg(6.7.)72 b(FITS)30 b(ASCI)s(I)f(AND)i(BINAR)-8 b(Y)31 b(T)-8 b(ABLE)31 b(D)m(A)-8 b(T)g(A)32 b(I/O)e(SUBR)m(OUTINES)979 b Fi(57)227 555 y(The)31 b(second)h(routine,)g(FTEQTY)f(is)g(similar)h(except)h(that)f (in)f(the)h(case)g(of)g(scaled)g(in)m(teger)h(columns)e(it)227 668 y(returns)23 b(the)h('equiv)-5 b(alen)m(t')25 b(data)f(t)m(yp)s(e)g (that)h(is)e(needed)h(to)g(store)g(the)g(scaled)g(v)-5 b(alues,)26 b(and)d(not)h(necessarily)227 781 y(the)38 b(ph)m(ysical)h(data)f(t)m(yp)s(e)g(of)g(the)g(unscaled)g(v)-5 b(alues)38 b(as)g(stored)g(in)g(the)g(FITS)f(table.)64 b(F)-8 b(or)38 b(example)h(if)227 894 y(a)c('1I')g(column)f(in)g(a)g (binary)g(table)h(has)f(TSCALn)f(=)g(1)i(and)f(TZER)m(On)f(=)g(32768,) 38 b(then)c(this)g(column)227 1007 y(e\013ectiv)m(ely)27 b(con)m(tains)e(unsigned)e(short)g(in)m(teger)j(v)-5 b(alues,)25 b(and)f(th)m(us)f(the)h(returned)f(v)-5 b(alue)24 b(of)g(t)m(yp)s(eco)s(de)h(will)227 1120 y(b)s(e)32 b(the)h(co)s(de)g (for)g(an)f(unsigned)g(short)g(in)m(teger,)j(not)e(a)g(signed)g(short)f (in)m(teger.)49 b(Similarly)-8 b(,)34 b(if)f(a)g(column)227 1233 y(has)d(TTYPEn)g(=)g('1I')h(and)f(TSCALn)e(=)i(0.12,)j(then)d(the) g(returned)g(t)m(yp)s(eco)s(de)g(will)h(b)s(e)f(the)h(co)s(de)f(for)h (a)227 1346 y('real')h(column.)382 1611 y Fe(FTGTCL\(unit,colnum,)42 b(>)48 b(datacode,repeat,width,st)o(atu)o(s\))382 1724 y(FTEQTY\(unit,colnum,)42 b(>)48 b(datacode,repeat,width,st)o(atu)o (s\))0 1989 y Fh(4)81 b Fi(Return)22 b(the)i(displa)m(y)g(width)f(of)g (a)h(column.)39 b(This)22 b(is)i(the)g(length)g(of)f(the)h(string)g (that)g(will)g(b)s(e)f(returned)f(when)227 2102 y(reading)33 b(the)g(column)g(as)g(a)g(formatted)g(string.)48 b(The)32 b(displa)m(y)h(width)f(is)h(determined)g(b)m(y)f(the)h(TDISPn)227 2215 y(k)m(eyw)m(ord,)e(if)g(presen)m(t,)f(otherwise)h(b)m(y)f(the)h (data)g(t)m(yp)s(e)g(of)f(the)h(column.)382 2480 y Fe(FTGCDW\(unit,)44 b(colnum,)i(>)i(dispwidth,)d(status\))0 2745 y Fh(5)81 b Fi(Get)29 b(information)f(ab)s(out)g(an)g(existing)h(ASCI)s(I)e (table)i(column.)40 b(\(NOTE:)28 b(TSCAL)f(and)g(TZER)m(O)h(m)m(ust)g (b)s(e)227 2858 y(declared)j(as)g(Double)g(Precision)g(v)-5 b(ariables\).)41 b(All)31 b(the)g(returned)e(parameters)i(are)f(scalar) i(quan)m(tities.)382 3123 y Fe(FTGACL\(unit,colnum,)42 b(>)716 3236 y(ttype,tbcol,tunit,tform,)o(tsca)o(l,t)o(zero)o(,snu)o (ll,)o(tdis)o(p,st)o(atu)o(s\))0 3501 y Fh(6)81 b Fi(Get)29 b(information)f(ab)s(out)f(an)h(existing)h(binary)e(table)i(column.)40 b(\(NOTE:)28 b(TSCAL)e(and)i(TZER)m(O)f(m)m(ust)h(b)s(e)227 3614 y(declared)j(as)f(Double)g(Precision)h(v)-5 b(ariables\).)41 b(D)m(A)-8 b(T)g(A)g(TYPE)32 b(is)e(a)g(c)m(haracter)i(string)d(whic)m (h)h(returns)f(the)227 3727 y(datat)m(yp)s(e)35 b(of)g(the)f(column)g (as)g(de\014ned)f(b)m(y)h(the)g(TF)m(ORMn)g(k)m(eyw)m(ord)h(\(e.g.,)i ('I',)e('J','E',)g('D',)g(etc.\).)54 b(In)227 3840 y(the)27 b(case)g(of)g(an)f(ASCI)s(I)f(c)m(haracter)j(column,)f(D)m(A)-8 b(T)g(A)g(TYPE)29 b(will)d(ha)m(v)m(e)i(a)f(v)-5 b(alue)27 b(of)f(the)h(form)f('An')g(where)227 3953 y('n')34 b(is)g(an)g(in)m (teger)i(expressing)e(the)g(width)f(of)h(the)h(\014eld)e(in)h(c)m (haracters.)53 b(F)-8 b(or)35 b(example,)h(if)e(TF)m(ORM)g(=)227 4066 y('160A8')39 b(then)e(FTGBCL)f(will)h(return)f(D)m(A)-8 b(T)g(A)g(TYPE='A8')39 b(and)d(REPEA)-8 b(T=20.)60 b(All)37 b(the)g(returned)227 4179 y(parameters)31 b(are)g(scalar)g(quan)m (tities.)382 4444 y Fe(FTGBCL\(unit,colnum,)42 b(>)716 4557 y(ttype,tunit,datatype,rep)o(eat,)o(tsc)o(al,t)o(zero)o(,tn)o (ull,)o(tdis)o(p,s)o(tatu)o(s\))0 4822 y Fh(7)81 b Fi(Put)31 b(\(app)s(end\))g(a)i(TDIMn)f(k)m(eyw)m(ord)g(whose)g(v)-5 b(alue)33 b(has)f(the)g(form)g('\(l,m,n...\)')47 b(where)32 b(l,)h(m,)f(n...)46 b(are)33 b(the)227 4935 y(dimensions)d(of)g(a)h(m)m (ultidimensional)g(arra)m(y)g(column)f(in)g(a)h(binary)f(table.)382 5200 y Fe(FTPTDM\(unit,colnum,naxis)o(,na)o(xes,)41 b(>)48 b(status\))0 5465 y Fh(8)81 b Fi(Return)29 b(the)h(n)m(um)m(b)s(er)e (of)i(and)g(size)g(of)g(the)g(dimensions)g(of)g(a)g(table)h(column.)40 b(Normally)31 b(this)f(information)227 5578 y(is)h(giv)m(en)h(b)m(y)f (the)g(TDIMn)f(k)m(eyw)m(ord,)i(but)e(if)h(this)g(k)m(eyw)m(ord)g(is)g (not)g(presen)m(t)g(then)g(this)f(routine)h(returns)227 5691 y(NAXIS)f(=)g(1)h(and)f(NAXES\(1\))h(equal)g(to)g(the)g(rep)s(eat) g(coun)m(t)g(in)f(the)g(TF)m(ORM)h(k)m(eyw)m(ord.)p eop end %%Page: 58 64 TeXDict begin 58 63 bop 0 299 a Fi(58)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)382 555 y Fe(FTGTDM\(unit,colnum,maxdi)o(m,)41 b(>)48 b(naxis,naxes,status\))0 808 y Fh(9)81 b Fi(Deco)s(de)33 b(the)g(input)f(TDIMn)h(k)m(eyw)m(ord)g(string)f(\(e.g.)50 b('\(100,200\)'\))37 b(and)32 b(return)g(the)h(n)m(um)m(b)s(er)e(of)i (and)f(size)227 921 y(of)c(the)g(dimensions)f(of)h(a)g(binary)f(table)h (column.)40 b(If)27 b(the)h(input)f(tdimstr)g(c)m(haracter)i(string)f (is)g(n)m(ull,)g(then)227 1034 y(this)d(routine)f(returns)f(naxis)h(=)h (1)f(and)g(naxes[0])i(equal)e(to)i(the)e(rep)s(eat)h(coun)m(t)g(in)f (the)g(TF)m(ORM)h(k)m(eyw)m(ord.)227 1147 y(This)30 b(routine)g(is)h (called)g(b)m(y)f(FTGTDM.)382 1400 y Fe(FTDTDM\(unit,tdimstr,coln)o (um,)o(maxd)o(im,)41 b(>)48 b(naxis,naxes,)c(status\))0 1654 y Fh(10)i Fi(Return)32 b(the)h(optimal)h(n)m(um)m(b)s(er)e(of)h (ro)m(ws)g(to)h(read)f(or)g(write)g(at)h(one)f(time)h(for)e(maxim)m(um) h(I/O)g(e\016ciency)-8 b(.)227 1767 y(Refer)31 b(to)g(the)g (\\Optimizing)g(Co)s(de")f(section)i(in)e(Chapter)g(5)g(for)h(more)f (discussion)g(on)g(ho)m(w)h(to)g(use)f(this)227 1879 y(routine.)382 2133 y Fe(FTGRSZ\(unit,)44 b(>)k(nrows,status\))0 2422 y Fb(6.7.2)112 b(Lo)m(w-Lev)m(el)39 b(T)-9 b(able)38 b(Access)f(Subroutines)0 2641 y Fi(The)d(follo)m(wing)h(subroutines)e (pro)m(vide)i(lo)m(w-lev)m(el)i(access)e(to)g(the)g(data)g(in)f(ASCI)s (I)e(or)i(binary)g(tables)h(and)f(are)0 2754 y(mainly)29 b(useful)f(as)i(an)f(e\016cien)m(t)h(w)m(a)m(y)g(to)g(cop)m(y)g(all)g (or)f(part)g(of)g(a)g(table)h(from)f(one)g(lo)s(cation)i(to)f(another.) 40 b(These)0 2867 y(routines)24 b(simply)g(read)g(or)h(write)f(the)h (sp)s(eci\014ed)e(n)m(um)m(b)s(er)g(of)i(consecutiv)m(e)h(b)m(ytes)f (in)f(an)g(ASCI)s(I)f(or)h(binary)g(table,)0 2980 y(without)37 b(regard)g(for)f(column)h(b)s(oundaries)e(or)i(the)g(ro)m(w)g(length)h (in)e(the)h(table.)61 b(The)37 b(\014rst)f(t)m(w)m(o)i(subroutines)0 3093 y(read)29 b(or)h(write)g(consecutiv)m(e)h(b)m(ytes)f(in)f(a)h (table)g(to)h(or)e(from)g(a)h(c)m(haracter)h(string)e(v)-5 b(ariable,)31 b(while)f(the)f(last)i(t)m(w)m(o)0 3206 y(subroutines)f(read)i(or)g(write)g(consecutiv)m(e)h(b)m(ytes)g(to)f (or)g(from)f(a)h(v)-5 b(ariable)33 b(declared)f(as)g(a)g(n)m(umeric)f (data)i(t)m(yp)s(e)0 3319 y(\(e.g.,)40 b(INTEGER,)d(INTEGER*2,)i(REAL,) d(DOUBLE)h(PRECISION\).)f(These)g(routines)h(do)f(not)h(p)s(erform)0 3432 y(an)m(y)c(mac)m(hine)g(dep)s(enden)m(t)f(data)i(con)m(v)m(ersion) g(or)e(b)m(yte)i(sw)m(apping,)f(except)h(that)f(con)m(v)m(ersion)h (to/from)f(ASCI)s(I)0 3544 y(format)d(is)g(p)s(erformed)e(b)m(y)h(the)h (FTGTBS)f(and)g(FTPTBS)g(routines)h(on)f(mac)m(hines)h(whic)m(h)g(do)f (not)h(use)f(ASCI)s(I)0 3657 y(c)m(haracter)j(co)s(des)e(in)g(the)h(in) m(ternal)g(data)g(represen)m(tations)h(\(e.g.,)g(on)e(IBM)h(mainframe)f (computers\).)0 3911 y Fh(1)81 b Fi(Read)26 b(a)h(consecutiv)m(e)h (string)f(of)f(c)m(haracters)i(from)e(an)g(ASCI)s(I)f(table)i(in)m(to)h (a)e(c)m(haracter)i(v)-5 b(ariable)28 b(\(spanning)227 4024 y(columns)k(and)g(m)m(ultiple)h(ro)m(ws)f(if)g(necessary\))h(This) f(routine)g(should)f(not)i(b)s(e)e(used)h(with)g(binary)f(tables)227 4136 y(b)s(ecause)g(of)f(complications)i(related)g(to)f(passing)f (string)g(v)-5 b(ariables)31 b(b)s(et)m(w)m(een)g(C)f(and)g(F)-8 b(ortran.)382 4390 y Fe(FTGTBS\(unit,frow,startch)o(ar,)o(ncha)o(rs,)41 b(>)48 b(string,status\))0 4643 y Fh(2)81 b Fi(W)-8 b(rite)31 b(a)g(consecutiv)m(e)h(string)e(of)h(c)m(haracters)g(to)g(an)f(ASCI)s (I)f(table)i(from)f(a)h(c)m(haracter)h(v)-5 b(ariable)31 b(\(spanning)227 4756 y(columns)h(and)g(m)m(ultiple)h(ro)m(ws)f(if)g (necessary\))h(This)f(routine)g(should)f(not)i(b)s(e)e(used)h(with)g (binary)f(tables)227 4869 y(b)s(ecause)g(of)f(complications)i(related)g (to)f(passing)f(string)g(v)-5 b(ariables)31 b(b)s(et)m(w)m(een)g(C)f (and)g(F)-8 b(ortran.)382 5122 y Fe(FTPTBS\(unit,frow,startch)o(ar,)o (ncha)o(rs,s)o(tri)o(ng,)41 b(>)48 b(status\))0 5375 y Fh(3)81 b Fi(Read)27 b(a)h(consecutiv)m(e)i(arra)m(y)e(of)g(b)m(ytes) g(from)f(an)g(ASCI)s(I)f(or)i(binary)e(table)j(in)m(to)f(a)g(n)m (umeric)g(v)-5 b(ariable)28 b(\(span-)227 5488 y(ning)k(columns)f(and)h (m)m(ultiple)g(ro)m(ws)g(if)g(necessary\).)46 b(The)32 b(arra)m(y)g(parameter)g(ma)m(y)h(b)s(e)e(declared)h(as)h(an)m(y)227 5601 y(n)m(umerical)i(datat)m(yp)s(e)g(as)g(long)g(as)g(the)f(arra)m(y) h(is)f(at)h(least)h('nc)m(hars')f(b)m(ytes)f(long,)j(e.g.,)f(if)f(nc)m (hars)f(=)g(17,)227 5714 y(then)c(declare)i(the)e(arra)m(y)h(as)g (INTEGER*4)g(ARRA)-8 b(Y\(5\).)p eop end %%Page: 59 65 TeXDict begin 59 64 bop 0 299 a Fg(6.7.)72 b(FITS)30 b(ASCI)s(I)f(AND)i(BINAR)-8 b(Y)31 b(T)-8 b(ABLE)31 b(D)m(A)-8 b(T)g(A)32 b(I/O)e(SUBR)m(OUTINES)979 b Fi(59)382 555 y Fe(FTGTBB\(unit,frow,startch)o(ar,)o(ncha)o(rs,)41 b(>)48 b(array,status\))0 813 y Fh(4)81 b Fi(W)-8 b(rite)32 b(a)f(consecutiv)m(e)i(arra)m(y)f(of)f(b)m(ytes)g(to)h(an)e(ASCI)s(I)g (or)h(binary)f(table)i(from)e(a)i(n)m(umeric)e(v)-5 b(ariable)32 b(\(span-)227 926 y(ning)j(columns)f(and)g(m)m(ultiple)h(ro)m(ws)g(if)f (necessary\))i(The)e(arra)m(y)h(parameter)g(ma)m(y)h(b)s(e)e(declared)h (as)g(an)m(y)227 1039 y(n)m(umerical)g(datat)m(yp)s(e)g(as)g(long)g(as) g(the)f(arra)m(y)h(is)f(at)h(least)h('nc)m(hars')f(b)m(ytes)f(long,)j (e.g.,)f(if)f(nc)m(hars)f(=)g(17,)227 1152 y(then)c(declare)i(the)e (arra)m(y)h(as)g(INTEGER*4)g(ARRA)-8 b(Y\(5\).)382 1410 y Fe(FTPTBB\(unit,frow,startch)o(ar,)o(ncha)o(rs,a)o(rra)o(y,)42 b(>)47 b(status\))0 1700 y Fb(6.7.3)112 b(Edit)37 b(Ro)m(ws)g(or)h (Columns)0 1909 y Fh(1)81 b Fi(Insert)26 b(blank)h(ro)m(ws)h(in)m(to)g (an)f(existing)h(ASCI)s(I)e(or)h(binary)g(table)h(\(in)g(the)f(CDU\).)h (All)g(the)g(ro)m(ws)f(F)m(OLLO)m(W-)227 2022 y(ING)35 b(ro)m(w)g(FR)m(O)m(W)g(are)g(shifted)f(do)m(wn)g(b)m(y)h(NR)m(O)m(WS)g (ro)m(ws.)53 b(If)34 b(FR)m(O)m(W)i(or)e(FR)m(O)m(WLL)i(equals)e(0)h (then)227 2134 y(the)27 b(blank)f(ro)m(ws)h(are)g(inserted)f(at)h(the)g (b)s(eginning)f(of)g(the)h(table.)41 b(These)26 b(routines)g(mo)s(dify) g(the)h(NAXIS2)227 2247 y(k)m(eyw)m(ord)35 b(to)h(re\015ect)f(the)g (new)f(n)m(um)m(b)s(er)f(of)i(ro)m(ws)g(in)f(the)h(table.)54 b(Note)36 b(that)f(it)h(is)e(*not*)i(necessary)f(to)227 2360 y(insert)c(ro)m(ws)f(in)g(a)h(table)g(b)s(efore)f(writing)g(data)i (to)f(those)g(ro)m(ws)f(\(indeed,)g(it)h(w)m(ould)g(b)s(e)e (ine\016cien)m(t)j(to)f(do)227 2473 y(so\).)54 b(Instead,)35 b(one)g(ma)m(y)g(simply)f(write)h(data)g(to)g(an)m(y)g(ro)m(w)f(of)h (the)g(table,)h(whether)e(that)h(ro)m(w)g(of)f(data)227 2586 y(already)d(exists)g(or)g(not.)382 2844 y Fe (FTIROW\(unit,frow,nrows,)41 b(>)48 b(status\))382 2957 y(FTIROWLL\(unit,frowll,nro)o(wsl)o(l,)42 b(>)47 b(status\))0 3215 y Fh(2)81 b Fi(Delete)25 b(ro)m(ws)f(from)f(an)g(existing)i(ASCI)s (I)c(or)j(binary)f(table)h(\(in)f(the)h(CDU\).)g(The)f(NR)m(O)m(WS)h (\(or)g(NR)m(O)m(WSLL\))227 3328 y(is)e(the)g(n)m(um)m(b)s(er)f(of)h (ro)m(ws)g(are)g(deleted,)i(starting)f(with)f(ro)m(w)g(FR)m(O)m(W)h (\(or)f(FR)m(O)m(WLL\),)h(and)f(an)m(y)g(remaining)227 3441 y(ro)m(ws)f(in)g(the)f(table)i(are)f(shifted)g(up)e(to)j(\014ll)f (in)f(the)h(space.)38 b(These)21 b(routines)f(mo)s(dify)g(the)h(NAXIS2) g(k)m(eyw)m(ord)227 3553 y(to)31 b(re\015ect)g(the)g(new)f(n)m(um)m(b)s (er)f(of)h(ro)m(ws)h(in)f(the)g(table.)382 3811 y Fe (FTDROW\(unit,frow,nrows,)41 b(>)48 b(status\))382 3924 y(FTDROWLL\(unit,frowll,nro)o(wsl)o(l,)42 b(>)47 b(status\))0 4182 y Fh(3)81 b Fi(Delete)26 b(a)f(list)g(of)g(ro)m(ws)f(from)g(an)h (ASCI)s(I)e(or)h(binary)g(table)h(\(in)g(the)f(CDU\).)i(In)e(the)g (\014rst)g(routine,)i('ro)m(wrange')227 4295 y(is)i(a)g(c)m(haracter)h (string)f(listing)h(the)f(ro)m(ws)f(or)h(ro)m(w)g(ranges)g(to)g(delete) h(\(e.g.,)i('2-4,)e(5,)g(8-9'\).)42 b(In)27 b(the)h(second)227 4408 y(routine,)37 b('ro)m(wlist')f(is)f(an)f(in)m(teger)j(arra)m(y)e (of)g(ro)m(w)g(n)m(um)m(b)s(ers)e(to)j(b)s(e)e(deleted)i(from)e(the)h (table.)56 b(nro)m(ws)34 b(is)227 4521 y(the)e(n)m(um)m(b)s(er)e(of)h (ro)m(w)h(n)m(um)m(b)s(ers)e(in)h(the)g(list.)45 b(The)31 b(\014rst)f(ro)m(w)i(in)f(the)g(table)i(is)e(1)h(not)f(0.)44 b(The)31 b(list)h(of)g(ro)m(w)227 4634 y(n)m(um)m(b)s(ers)d(m)m(ust)h (b)s(e)g(sorted)h(in)f(ascending)g(order.)382 4891 y Fe(FTDRRG\(unit,rowrange,)42 b(>)47 b(status\))382 5004 y(FTDRWS\(unit,rowlist,nrow)o(s,)41 b(>)48 b(status\))0 5262 y Fh(4)81 b Fi(Insert)43 b(a)i(blank)f(column)h(\(or)f(columns\))h (in)m(to)g(an)f(existing)i(ASCI)s(I)d(or)h(binary)g(table)h(\(in)g(the) f(CDU\).)227 5375 y(COLNUM)c(sp)s(eci\014es)g(the)h(column)f(n)m(um)m (b)s(er)f(that)i(the)f(\(\014rst\))g(new)g(column)g(should)f(o)s(ccup)m (y)i(in)f(the)227 5488 y(table.)58 b(NCOLS)34 b(sp)s(eci\014es)h(ho)m (w)h(man)m(y)g(columns)f(are)h(to)g(b)s(e)f(inserted.)57 b(An)m(y)35 b(existing)i(columns)e(from)227 5601 y(this)k(p)s(osition)f (and)g(higher)g(are)h(mo)m(v)m(ed)g(o)m(v)m(er)h(to)f(allo)m(w)h(ro)s (om)e(for)h(the)f(new)g(column\(s\).)65 b(The)38 b(index)227 5714 y(n)m(um)m(b)s(er)j(on)h(all)h(the)f(follo)m(wing)h(k)m(eyw)m (ords)g(will)f(b)s(e)f(incremen)m(ted)i(if)f(necessary)g(to)h (re\015ect)f(the)g(new)p eop end %%Page: 60 66 TeXDict begin 60 65 bop 0 299 a Fi(60)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)227 555 y Fi(p)s(osition)i(of)f(the)g(column\(s\))h (in)f(the)g(table:)43 b(TBCOLn,)30 b(TF)m(ORMn,)i(TTYPEn,)e(TUNITn,)h (TNULLn,)227 668 y(TSCALn,)22 b(TZER)m(On,)g(TDISPn,)g(TDIMn,)h (TLMINn,)g(TLMAXn,)f(TDMINn,)i(TDMAXn,)f(TCTYPn,)227 781 y(TCRPXn,)30 b(TCR)-10 b(VLn,)29 b(TCDL)-8 b(Tn,)30 b(TCR)m(OTn,)f(and)g(TCUNIn.)382 1035 y Fe(FTICOL\(unit,colnum,ttype)o (,tf)o(orm,)41 b(>)48 b(status\))382 1148 y(FTICLS\(unit,colnum,ncols)o (,tt)o(ype,)o(tfor)o(m,)41 b(>)48 b(status\))0 1403 y Fh(5)81 b Fi(Mo)s(dify)37 b(the)g(v)m(ector)i(length)f(of)f(a)h(binary) e(table)i(column)f(\(e.g.,)k(c)m(hange)e(a)e(column)g(from)g(TF)m(ORMn) g(=)227 1515 y('1E')31 b(to)h('20E'\).)g(The)e(v)m(ector)i(length)e(ma) m(y)h(b)s(e)f(increased)h(or)f(decreased)h(from)f(the)g(curren)m(t)h(v) -5 b(alue.)382 1770 y Fe(FTMVEC\(unit,colnum,newve)o(cle)o(n,)42 b(>)47 b(status\))0 2024 y Fh(6)81 b Fi(Delete)29 b(a)f(column)g(from)f (an)g(existing)i(ASCI)s(I)d(or)i(binary)e(table)j(\(in)f(the)f(CDU\).)i (The)e(index)g(n)m(um)m(b)s(er)f(of)i(all)227 2137 y(the)k(k)m(eyw)m (ords)h(listed)f(ab)s(o)m(v)m(e)i(\(for)e(FTICOL\))f(will)h(b)s(e)g (decremen)m(ted)g(if)g(necessary)h(to)g(re\015ect)f(the)g(new)227 2250 y(p)s(osition)26 b(of)g(the)g(column\(s\))g(in)f(the)h(table.)40 b(Those)26 b(index)f(k)m(eyw)m(ords)h(that)g(refer)f(to)i(the)f (deleted)g(column)227 2363 y(will)33 b(also)g(b)s(e)f(deleted.)47 b(Note)33 b(that)g(the)g(ph)m(ysical)g(size)g(of)f(the)h(FITS)e(\014le) i(will)f(not)h(b)s(e)e(reduced)h(b)m(y)g(this)227 2476 y(op)s(eration,)e(and)e(the)h(empt)m(y)g(FITS)f(blo)s(c)m(ks)h(if)g(an) m(y)g(at)g(the)g(end)f(of)h(the)g(\014le)g(will)g(b)s(e)f(padded)g (with)g(zeros.)382 2730 y Fe(FTDCOL\(unit,colnum,)42 b(>)48 b(status\))0 2984 y Fh(7)81 b Fi(Cop)m(y)30 b(a)g(column)g(from) g(one)g(HDU)h(to)g(another)f(\(or)h(to)g(the)f(same)h(HDU\).)g(If)f (createcol)j(=)c(TR)m(UE,)i(then)f(a)227 3097 y(new)20 b(column)g(will)h(b)s(e)f(inserted)g(in)g(the)h(output)f(table,)k(at)d (p)s(osition)f(`outcolumn',)j(otherwise)e(the)g(existing)227 3210 y(output)29 b(column)f(will)h(b)s(e)f(o)m(v)m(erwritten)i(\(in)f (whic)m(h)f(case)i(it)f(m)m(ust)f(ha)m(v)m(e)i(a)f(compatible)h(datat)m (yp)s(e\).)42 b(Note)227 3323 y(that)31 b(the)g(\014rst)e(column)i(in)f (a)g(table)i(is)e(at)h(coln)m(um)g(=)f(1.)382 3577 y Fe(FTCPCL\(inunit,outunit,in)o(col)o(num,)o(outc)o(oln)o(um,c)o(reat)o (eco)o(l,)42 b(>)47 b(status\);)0 3867 y Fb(6.7.4)112 b(Read)38 b(and)h(W)-9 b(rite)36 b(Column)j(Data)e(Routines)0 4086 y Fi(These)22 b(subroutines)f(put)h(or)g(get)i(data)f(v)-5 b(alues)22 b(in)g(the)h(curren)m(t)f(ASCI)s(I)f(or)h(Binary)g(table)i (extension.)38 b(Automatic)0 4199 y(data)21 b(t)m(yp)s(e)g(con)m(v)m (ersion)g(is)f(p)s(erformed)f(for)h(n)m(umerical)h(data)g(t)m(yp)s(es)g (\(B,I,J,E,D\))h(if)e(the)h(data)g(t)m(yp)s(e)f(of)h(the)f(column)0 4312 y(\(de\014ned)32 b(b)m(y)i(the)f(TF)m(ORM)h(k)m(eyw)m(ord\))g (di\013ers)f(from)f(the)i(data)g(t)m(yp)s(e)f(of)h(the)f(calling)i (subroutine.)48 b(The)33 b(data)0 4425 y(v)-5 b(alues)30 b(are)h(also)g(scaled)f(b)m(y)g(the)g(TSCALn)f(and)g(TZER)m(On)g (header)h(v)-5 b(alues)30 b(as)g(they)g(are)h(b)s(eing)e(written)h(to)h (or)0 4538 y(read)j(from)f(the)h(FITS)f(arra)m(y)-8 b(.)51 b(The)33 b(fttscl)i(subroutine)d(MUST)i(b)s(e)f(used)g(to)h(de\014ne)f (the)h(scaling)h(parameters)0 4650 y(when)d(writing)h(data)h(to)g(the)f (table)h(or)f(to)h(o)m(v)m(erride)g(the)g(default)f(scaling)h(v)-5 b(alues)34 b(giv)m(en)g(in)f(the)g(header)g(when)0 4763 y(reading)27 b(from)g(the)g(table.)40 b(Note)29 b(that)e(it)h(is)f (*not*)h(necessary)f(to)h(insert)f(ro)m(ws)g(in)f(a)i(table)g(b)s (efore)e(writing)h(data)0 4876 y(to)j(those)h(ro)m(ws)e(\(indeed,)h(it) g(w)m(ould)g(b)s(e)f(ine\016cien)m(t)i(to)f(do)g(so\).)41 b(Instead,)30 b(one)g(ma)m(y)g(simply)f(write)h(data)g(to)h(an)m(y)0 4989 y(ro)m(w)f(of)h(the)g(table,)g(whether)f(that)h(ro)m(w)f(of)h (data)g(already)g(exists)g(or)f(not.)0 5149 y(In)i(the)i(case)g(of)f (binary)g(tables)h(with)f(v)m(ector)h(elemen)m(ts,)i(the)d('felem')h (parameter)g(de\014nes)e(the)i(starting)g(pixel)0 5262 y(within)k(the)g(elemen)m(t)i(v)m(ector.)65 b(This)38 b(parameter)g(is)g(ignored)h(with)e(ASCI)s(I)g(tables.)65 b(Similarly)-8 b(,)41 b(in)d(the)g(case)0 5375 y(of)45 b(binary)e(tables)i(the)g('nelemen)m(ts')h(parameter)f(sp)s(eci\014es)f (the)g(total)i(n)m(um)m(b)s(er)d(of)i(v)m(ector)h(v)-5 b(alues)45 b(read)f(or)0 5488 y(written)36 b(\(con)m(tin)m(uing)h(on)f (subsequen)m(t)f(ro)m(ws)g(if)h(required\))f(and)h(not)g(the)g(n)m(um)m (b)s(er)e(of)i(table)h(elemen)m(ts.)58 b(Tw)m(o)0 5601 y(sets)36 b(of)f(subroutines)g(are)g(pro)m(vided)g(to)i(get)f(the)g (column)f(data)h(whic)m(h)f(di\013er)g(in)h(the)f(w)m(a)m(y)i (unde\014ned)c(pixels)0 5714 y(are)f(handled.)42 b(The)31 b(\014rst)g(set)h(of)f(routines)h(\(FTGCV\))g(simply)f(return)f(an)h (arra)m(y)h(of)f(data)h(elemen)m(ts)h(in)e(whic)m(h)p eop end %%Page: 61 67 TeXDict begin 61 66 bop 0 299 a Fg(6.7.)72 b(FITS)30 b(ASCI)s(I)f(AND)i(BINAR)-8 b(Y)31 b(T)-8 b(ABLE)31 b(D)m(A)-8 b(T)g(A)32 b(I/O)e(SUBR)m(OUTINES)979 b Fi(61)0 555 y(unde\014ned)41 b(pixels)j(are)g(set)g(equal)g(to)h(a)f(v)-5 b(alue)44 b(sp)s(eci\014ed)f(b)m(y)g(the)h(user)f(in)g(the)h('n)m(ullv)-5 b(al')44 b(parameter.)81 b(An)0 668 y(additional)44 b(feature)g(of)g (these)g(subroutines)e(is)i(that)g(if)f(the)h(user)e(sets)i(n)m(ullv)-5 b(al)44 b(=)f(0,)48 b(then)43 b(no)g(c)m(hec)m(ks)i(for)0 781 y(unde\014ned)33 b(pixels)j(will)g(b)s(e)e(p)s(erformed,)i(th)m(us) f(increasing)h(the)g(sp)s(eed)e(of)i(the)g(program.)55 b(The)35 b(second)h(set)g(of)0 894 y(routines)h(\(FTGCF\))h(returns)d (the)i(data)h(elemen)m(t)g(arra)m(y)g(and)e(in)h(addition)g(a)g (logical)j(arra)m(y)d(of)g(\015ags)g(whic)m(h)0 1007 y(de\014nes)29 b(whether)h(the)h(corresp)s(onding)e(data)i(pixel)g(is)f (unde\014ned.)0 1167 y(An)m(y)41 b(column,)i(regardless)e(of)g(it's)g (in)m(trinsic)g(datat)m(yp)s(e,)k(ma)m(y)c(b)s(e)f(read)h(as)g(a)g (string.)71 b(It)41 b(should)f(b)s(e)g(noted)0 1280 y(ho)m(w)m(ev)m(er) 32 b(that)f(reading)f(a)h(n)m(umeric)f(column)g(as)h(a)f(string)h(is)f (10)h(-)g(100)g(times)g(slo)m(w)m(er)h(than)e(reading)g(the)h(same)0 1393 y(column)g(as)h(a)g(n)m(um)m(b)s(er)e(due)h(to)h(the)g(large)h(o)m (v)m(erhead)f(in)g(constructing)g(the)g(formatted)g(strings.)44 b(The)31 b(displa)m(y)0 1506 y(format)26 b(of)g(the)h(returned)d (strings)i(will)g(b)s(e)g(determined)f(b)m(y)h(the)g(TDISPn)f(k)m(eyw)m (ord,)j(if)d(it)i(exists,)h(otherwise)e(b)m(y)0 1619 y(the)i(datat)m(yp)s(e)h(of)g(the)f(column.)40 b(The)28 b(length)g(of)h(the)f(returned)f(strings)h(can)g(b)s(e)g(determined)g (with)f(the)i(ftgcdw)0 1732 y(routine.)41 b(The)30 b(follo)m(wing)h (TDISPn)f(displa)m(y)g(formats)h(are)f(curren)m(tly)h(supp)s(orted:)191 1952 y Fe(Iw.m)142 b(Integer)191 2065 y(Ow.m)g(Octal)46 b(integer)191 2178 y(Zw.m)142 b(Hexadecimal)45 b(integer)191 2291 y(Fw.d)142 b(Fixed)46 b(floating)g(point)191 2404 y(Ew.d)142 b(Exponential)45 b(floating)g(point)191 2517 y(Dw.d)142 b(Exponential)45 b(floating)g(point)191 2630 y(Gw.d)142 b(General;)46 b(uses)g(Fw.d)h(if)g(significance)d(not)j (lost,)g(else)f(Ew.d)0 2850 y Fi(where)37 b(w)h(is)g(the)g(width)f(in)h (c)m(haracters)h(of)f(the)h(displa)m(y)m(ed)f(v)-5 b(alues,)41 b(m)c(is)h(the)g(minim)m(um)g(n)m(um)m(b)s(er)e(of)i(digits)0 2963 y(displa)m(y)m(ed,)31 b(and)f(d)g(is)g(the)h(n)m(um)m(b)s(er)e(of) h(digits)h(to)g(the)g(righ)m(t)g(of)g(the)f(decimal.)42 b(The)30 b(.m)g(\014eld)g(is)g(optional.)0 3184 y Fh(1)81 b Fi(Put)30 b(elemen)m(ts)i(in)m(to)g(an)e(ASCI)s(I)f(or)i(binary)f (table)i(column)e(\(in)h(the)g(CDU\).)g(\(The)g(SPP)f(FSPCLS)f(routine) 227 3297 y(has)38 b(an)f(additional)i(in)m(teger)g(argumen)m(t)f(after) h(the)f(V)-10 b(ALUES)37 b(c)m(haracter)i(string)f(whic)m(h)f(sp)s (eci\014es)h(the)227 3410 y(size)31 b(of)g(the)g(1st)g(dimension)e(of)i (this)f(2-D)i(CHAR)e(arra)m(y\).)227 3553 y(The)24 b(alternate)i(v)m (ersion)f(of)g(these)g(routines,)h(whose)e(names)g(end)g(in)g('LL')h (after)g(the)g(datat)m(yp)s(e)g(c)m(haracter,)227 3666 y(supp)s(ort)34 b(large)j(tables)f(with)g(more)f(then)h(2*31)h(ro)m (ws.)57 b(When)35 b(calling)i(these)f(routines,)h(the)f(fro)m(w)g(and) 227 3779 y(felem)31 b(parameters)g(*m)m(ust*)g(b)s(e)f(64-bit)h(in)m (teger*8)i(v)-5 b(ariables,)31 b(instead)g(of)g(normal)f(4-b)m(yte)i (in)m(tegers.)382 4000 y Fe(FTPCL[SLBIJKEDCM]\(unit,c)o(oln)o(um,f)o (row,)o(fel)o(em,n)o(elem)o(ent)o(s,va)o(lues)o(,)42 b(>)47 b(status\))382 4113 y(FTPCL[LBIJKEDCM]LL\(unit,)o(col)o(num,)o (frow)o(,fe)o(lem,)o(nele)o(men)o(ts,v)o(alue)o(s,)41 b(>)48 b(status\))0 4333 y Fh(2)81 b Fi(Put)29 b(elemen)m(ts)i(in)m(to) g(an)f(ASCI)s(I)e(or)i(binary)f(table)i(column)e(\(in)h(the)g(CDU\))g (substituting)g(the)g(appropriate)227 4446 y(FITS)c(n)m(ull)g(v)-5 b(alue)26 b(for)g(an)m(y)h(elemen)m(ts)g(that)g(are)f(equal)h(to)g (NULL)-10 b(V)g(AL.)26 b(F)-8 b(or)27 b(ASCI)s(I)e(T)-8 b(ABLE)26 b(extensions,)227 4559 y(the)31 b(n)m(ull)f(v)-5 b(alue)31 b(de\014ned)e(b)m(y)h(the)g(previous)g(call)i(to)f(FTSNUL)f (will)g(b)s(e)g(substituted;)g(F)-8 b(or)31 b(in)m(teger)h(FITS)227 4672 y(columns,)39 b(in)e(a)h(binary)f(table)h(the)f(n)m(ull)h(v)-5 b(alue)37 b(de\014ned)g(b)m(y)g(the)g(previous)g(call)i(to)f(FTTNUL)f (will)h(b)s(e)227 4785 y(substituted;)28 b(F)-8 b(or)28 b(\015oating)h(p)s(oin)m(t)e(FITS)f(columns)h(a)h(sp)s(ecial)g(IEEE)f (NaN)h(\(Not-a-Num)m(b)s(er\))h(v)-5 b(alue)28 b(will)227 4898 y(b)s(e)i(substituted.)227 5042 y(The)24 b(alternate)i(v)m(ersion) f(of)g(these)g(routines,)h(whose)e(names)g(end)g(in)g('LL')h(after)g (the)g(datat)m(yp)s(e)g(c)m(haracter,)227 5155 y(supp)s(ort)34 b(large)j(tables)f(with)g(more)f(then)h(2*31)h(ro)m(ws.)57 b(When)35 b(calling)i(these)f(routines,)h(the)f(fro)m(w)g(and)227 5267 y(felem)31 b(parameters)g(*m)m(ust*)g(b)s(e)f(64-bit)h(in)m (teger*8)i(v)-5 b(ariables,)31 b(instead)g(of)g(normal)f(4-b)m(yte)i (in)m(tegers.)382 5488 y Fe(FTPCN[SBIJKED]\(unit,coln)o(um,)o(frow)o (,fel)o(em,)o(nele)o(ment)o(s,v)o(alue)o(s,nu)o(llv)o(al)42 b(>)47 b(status\))382 5601 y(FTPCN[SBIJKED]LL\(unit,co)o(lnu)o(m,\(I)o (*8\))41 b(frow,\(I*8\))k(felem,nelements,values,)764 5714 y(nullval)g(>)j(status\))p eop end %%Page: 62 68 TeXDict begin 62 67 bop 0 299 a Fi(62)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)0 555 y Fh(3)81 b Fi(Put)37 b(bit)h(v)-5 b(alues)38 b(in)m(to)h(a)f(binary)f(b)m(yte)h(\('B'\))i(or)d(bit)h (\('X'\))h(table)g(column)f(\(in)f(the)h(CDU\).)h(LRA)-8 b(Y)38 b(is)g(an)227 668 y(arra)m(y)c(of)g(logical)h(v)-5 b(alues)34 b(corresp)s(onding)e(to)i(the)g(sequence)f(of)h(bits)f(to)h (b)s(e)f(written.)49 b(If)33 b(LRA)-8 b(Y)34 b(is)f(true)227 781 y(then)f(the)g(corresp)s(onding)f(bit)h(is)g(set)g(to)h(1,)g (otherwise)f(the)g(bit)g(is)g(set)h(to)g(0.)45 b(Note)34 b(that)e(in)g(the)g(case)h(of)227 894 y('X')g(columns,)g(FITSIO)e(will) i(write)f(to)h(all)g(8)g(bits)f(of)g(eac)m(h)i(b)m(yte)f(whether)e (they)i(are)g(formally)f(v)-5 b(alid)33 b(or)227 1007 y(not.)46 b(Th)m(us)31 b(if)h(the)g(column)g(is)f(de\014ned)g(as)h ('4X',)i(and)d(one)h(calls)h(FTPCLX)f(with)f(fbit=1)h(and)f(n)m(bit=8,) 227 1120 y(then)j(all)h(8)f(bits)g(will)g(b)s(e)f(written)h(in)m(to)h (the)f(\014rst)g(b)m(yte)g(\(as)h(opp)s(osed)e(to)i(writing)e(the)i (\014rst)e(4)h(bits)g(in)m(to)227 1233 y(the)d(\014rst)f(ro)m(w)g(and)g (then)g(the)h(next)f(4)h(bits)f(in)m(to)i(the)e(next)h(ro)m(w\),)g(ev)m (en)g(though)f(the)h(last)g(4)g(bits)f(of)h(eac)m(h)227 1346 y(b)m(yte)g(are)g(formally)g(not)g(de\014ned.)382 1604 y Fe(FTPCLX\(unit,colnum,frow,)o(fbi)o(t,nb)o(it,l)o(ray)o(,)42 b(>)47 b(status\))0 1863 y Fh(4)81 b Fi(Set)30 b(table)h(elemen)m(ts)h (in)e(a)h(column)f(as)h(unde\014ned)382 2121 y Fe (FTPCLU\(unit,colnum,frow,)o(fel)o(em,n)o(elem)o(ent)o(s,)42 b(>)47 b(status\))0 2380 y Fh(5)81 b Fi(Get)34 b(elemen)m(ts)g(from)f (an)g(ASCI)s(I)f(or)h(binary)g(table)h(column)f(\(in)g(the)g(CDU\).)i (These)e(routines)g(return)f(the)227 2493 y(v)-5 b(alues)30 b(of)g(the)g(table)h(column)f(arra)m(y)g(elemen)m(ts.)42 b(Unde\014ned)28 b(arra)m(y)j(elemen)m(ts)g(will)f(b)s(e)f(returned)g (with)h(a)227 2606 y(v)-5 b(alue)26 b(=)g(n)m(ullv)-5 b(al,)27 b(unless)e(n)m(ullv)-5 b(al)26 b(=)f(0)h(\(or)g(=)f(')h(')g (for)f(ftgcvs\))i(in)e(whic)m(h)g(case)i(no)e(c)m(hec)m(king)j(for)d (unde\014ned)227 2719 y(v)-5 b(alues)28 b(will)g(b)s(e)f(p)s(erformed.) 39 b(The)27 b(ANYF)h(parameter)g(is)g(set)g(to)g(true)g(if)g(an)m(y)f (of)h(the)g(returned)f(elemen)m(ts)227 2831 y(are)f(unde\014ned.)37 b(\(Note:)i(the)26 b(ftgcl)g(routine)f(simple)g(gets)h(an)g(arra)m(y)f (of)g(logical)j(data)e(v)-5 b(alues)25 b(without)h(an)m(y)227 2944 y(c)m(hec)m(ks)39 b(for)e(unde\014ned)e(v)-5 b(alues;)41 b(use)c(the)g(ftgc\015)h(routine)f(to)h(c)m(hec)m(k)g(for)f (unde\014ned)e(logical)40 b(elemen)m(ts\).)227 3057 y(\(The)29 b(SPP)f(FSGCVS)g(routine)g(has)h(an)f(additional)i(in)m(teger)g (argumen)m(t)f(after)g(the)g(V)-10 b(ALUES)28 b(c)m(haracter)227 3170 y(string)j(whic)m(h)f(sp)s(eci\014es)g(the)g(size)i(of)e(the)h (1st)g(dimension)e(of)i(this)f(2-D)i(CHAR)e(arra)m(y\).)227 3320 y(The)24 b(alternate)i(v)m(ersion)f(of)g(these)g(routines,)h (whose)e(names)g(end)g(in)g('LL')h(after)g(the)g(datat)m(yp)s(e)g(c)m (haracter,)227 3433 y(supp)s(ort)34 b(large)j(tables)f(with)g(more)f (then)h(2*31)h(ro)m(ws.)57 b(When)35 b(calling)i(these)f(routines,)h (the)f(fro)m(w)g(and)227 3546 y(felem)31 b(parameters)g(*m)m(ust*)g(b)s (e)f(64-bit)h(in)m(teger*8)i(v)-5 b(ariables,)31 b(instead)g(of)g (normal)f(4-b)m(yte)i(in)m(tegers.)382 3805 y Fe (FTGCL\(unit,colnum,frow,f)o(ele)o(m,ne)o(leme)o(nts)o(,)42 b(>)47 b(values,status\))382 3918 y(FTGCV[SBIJKEDCM]\(unit,co)o(lnu)o (m,fr)o(ow,f)o(ele)o(m,ne)o(leme)o(nts)o(,nul)o(lval)o(,)42 b(>)1098 4030 y(values,anyf,status\))382 4143 y (FTGCV[BIJKEDCM]LL\(unit,c)o(oln)o(um,\()o(I*8\))f(frow,)46 b(\(I*8\))h(felem,)f(nelements,)716 4256 y(nullval,)f(>)j (values,anyf,status\))0 4515 y Fh(6)81 b Fi(Get)44 b(elemen)m(ts)h(and) d(n)m(ull)i(\015ags)f(from)g(an)h(ASCI)s(I)d(or)j(binary)e(table)j (column)e(\(in)g(the)h(CHDU\).)g(These)227 4628 y(routines)29 b(return)e(the)i(v)-5 b(alues)29 b(of)g(the)g(table)h(column)e(arra)m (y)i(elemen)m(ts.)41 b(An)m(y)29 b(unde\014ned)d(arra)m(y)k(elemen)m (ts)227 4741 y(will)37 b(ha)m(v)m(e)h(the)f(corresp)s(onding)f(\015agv) -5 b(als)37 b(elemen)m(t)i(set)e(equal)g(to)h(.TR)m(UE.)f(The)f(ANYF)i (parameter)f(is)227 4854 y(set)30 b(to)g(true)g(if)f(an)m(y)h(of)f(the) h(returned)e(elemen)m(ts)j(are)f(unde\014ned.)38 b(\(The)29 b(SPP)f(FSGCFS)h(routine)h(has)f(an)227 4967 y(additional)e(in)m(teger) h(argumen)m(t)e(after)h(the)f(V)-10 b(ALUES)26 b(c)m(haracter)i(string) e(whic)m(h)f(sp)s(eci\014es)h(the)h(size)f(of)h(the)227 5079 y(1st)k(dimension)f(of)h(this)f(2-D)h(CHAR)g(arra)m(y\).)227 5229 y(The)24 b(alternate)i(v)m(ersion)f(of)g(these)g(routines,)h (whose)e(names)g(end)g(in)g('LL')h(after)g(the)g(datat)m(yp)s(e)g(c)m (haracter,)227 5342 y(supp)s(ort)34 b(large)j(tables)f(with)g(more)f (then)h(2*31)h(ro)m(ws.)57 b(When)35 b(calling)i(these)f(routines,)h (the)f(fro)m(w)g(and)227 5455 y(felem)31 b(parameters)g(*m)m(ust*)g(b)s (e)f(64-bit)h(in)m(teger*8)i(v)-5 b(ariables,)31 b(instead)g(of)g (normal)f(4-b)m(yte)i(in)m(tegers.)382 5714 y Fe (FTGCF[SLBIJKEDCM]\(unit,c)o(oln)o(um,f)o(row,)o(fel)o(em,n)o(elem)o (ent)o(s,)42 b(>)p eop end %%Page: 63 69 TeXDict begin 63 68 bop 0 299 a Fg(6.7.)72 b(FITS)30 b(ASCI)s(I)f(AND)i(BINAR)-8 b(Y)31 b(T)-8 b(ABLE)31 b(D)m(A)-8 b(T)g(A)32 b(I/O)e(SUBR)m(OUTINES)979 b Fi(63)1193 555 y Fe(values,flagvals,anyf,stat)o(us\))382 668 y (FTGCF[BIJKED]LL\(unit,col)o(num)o(,)42 b(\(I*8\))k(frow,)h(\(I*8\))f (felem,nelements,)d(>)1193 781 y(values,flagvals,anyf,stat)o(us\))0 1034 y Fh(7)81 b Fi(Get)29 b(an)f(arbitrary)g(data)h(subsection)f(from) g(an)g(N-dimensional)h(arra)m(y)g(in)f(a)g(binary)g(table)h(v)m(ector)h (column.)227 1147 y(Unde\014ned)k(pixels)h(in)g(the)h(arra)m(y)g(will)f (b)s(e)g(set)h(equal)f(to)h(the)g(v)-5 b(alue)36 b(of)f('n)m(ullv)-5 b(al',)38 b(unless)c(n)m(ullv)-5 b(al=0)36 b(in)227 1260 y(whic)m(h)d(case)i(no)e(testing)i(for)e(unde\014ned)e(pixels)j(will)f (b)s(e)g(p)s(erformed.)49 b(The)32 b(\014rst)h(and)g(last)h(ro)m(ws)g (in)f(the)227 1373 y(table)28 b(to)f(b)s(e)f(read)g(are)h(sp)s (eci\014ed)e(b)m(y)i(fpixels\(naxis+1\))g(and)f(lpixels\(naxis+1\),)j (and)d(hence)g(are)h(treated)227 1486 y(as)f(the)f(next)h(higher)f (dimension)g(of)g(the)h(FITS)e(N-dimensional)i(arra)m(y)-8 b(.)40 b(The)25 b(INCS)f(parameter)i(sp)s(eci\014es)227 1599 y(the)31 b(sampling)f(in)m(terv)-5 b(al)32 b(in)e(eac)m(h)h (dimension)f(b)s(et)m(w)m(een)h(the)g(data)g(elemen)m(ts)g(that)g(will) g(b)s(e)f(returned.)382 1852 y Fe(FTGSV[BIJKED]\(unit,colnu)o(m,n)o (axis)o(,nax)o(es,)o(fpix)o(els,)o(lpi)o(xels)o(,inc)o(s,n)o(ullv)o (al,)41 b(>)1002 1965 y(array,anyf,status\))0 2218 y Fh(8)81 b Fi(Get)29 b(an)f(arbitrary)g(data)h(subsection)f(from)g(an)g (N-dimensional)h(arra)m(y)g(in)f(a)g(binary)g(table)h(v)m(ector)h (column.)227 2331 y(An)m(y)39 b(Unde\014ned)e(pixels)i(in)g(the)g(arra) m(y)g(will)g(ha)m(v)m(e)h(the)f(corresp)s(onding)f('\015agv)-5 b(als')40 b(elemen)m(t)g(set)f(equal)227 2443 y(to)d(.TR)m(UE.)f(The)f (\014rst)g(and)g(last)i(ro)m(ws)f(in)f(the)h(table)h(to)f(b)s(e)g(read) f(are)h(sp)s(eci\014ed)f(b)m(y)h(fpixels\(naxis+1\))227 2556 y(and)k(lpixels\(naxis+1\),)k(and)38 b(hence)i(are)f(treated)i(as) e(the)g(next)h(higher)f(dimension)f(of)i(the)f(FITS)g(N-)227 2669 y(dimensional)g(arra)m(y)-8 b(.)66 b(The)38 b(INCS)g(parameter)h (sp)s(eci\014es)f(the)g(sampling)h(in)m(terv)-5 b(al)40 b(in)e(eac)m(h)i(dimension)227 2782 y(b)s(et)m(w)m(een)31 b(the)g(data)g(elemen)m(ts)h(that)f(will)f(b)s(e)g(returned.)382 3035 y Fe(FTGSF[BIJKED]\(unit,colnu)o(m,n)o(axis)o(,nax)o(es,)o(fpix)o (els,)o(lpi)o(xels)o(,inc)o(s,)41 b(>)1002 3148 y (array,flagvals,anyf,statu)o(s\))0 3401 y Fh(9)81 b Fi(Get)33 b(bit)g(v)-5 b(alues)34 b(from)e(a)h(b)m(yte)h(\('B'\))g(or)f(bit)g (\(`X`\))h(table)g(column)f(\(in)g(the)g(CDU\).)g(LRA)-8 b(Y)34 b(is)f(an)f(arra)m(y)i(of)227 3514 y(logical)41 b(v)-5 b(alues)39 b(corresp)s(onding)f(to)h(the)g(sequence)f(of)h(bits) g(to)g(b)s(e)f(read.)65 b(If)38 b(LRA)-8 b(Y)39 b(is)f(true)h(then)f (the)227 3627 y(corresp)s(onding)c(bit)g(w)m(as)g(set)h(to)g(1,)h (otherwise)f(the)f(bit)h(w)m(as)f(set)h(to)g(0.)53 b(Note)35 b(that)g(in)f(the)h(case)g(of)f('X')227 3740 y(columns,)41 b(FITSIO)d(will)h(read)f(all)i(8)f(bits)g(of)g(eac)m(h)h(b)m(yte)f (whether)f(they)h(are)g(formally)h(v)-5 b(alid)39 b(or)f(not.)227 3853 y(Th)m(us)c(if)g(the)h(column)f(is)g(de\014ned)f(as)i('4X',)h(and) d(one)i(calls)h(FTGCX)e(with)g(fbit=1)h(and)e(n)m(bit=8,)j(then)227 3966 y(all)30 b(8)g(bits)f(will)g(b)s(e)g(read)g(from)g(the)g(\014rst)f (b)m(yte)i(\(as)g(opp)s(osed)e(to)i(reading)f(the)h(\014rst)e(4)i(bits) f(from)f(the)i(\014rst)227 4079 y(ro)m(w)g(and)e(then)h(the)h(\014rst)e (4)i(bits)f(from)g(the)g(next)g(ro)m(w\),)i(ev)m(en)f(though)f(the)g (last)h(4)g(bits)f(of)g(eac)m(h)i(b)m(yte)f(are)227 4192 y(formally)h(not)g(de\014ned.)382 4445 y Fe(FTGCX\(unit,colnum,frow,f)o (bit)o(,nbi)o(t,)42 b(>)47 b(lray,status\))0 4698 y Fh(10)f Fi(Read)31 b(an)m(y)g(consecutiv)m(e)h(set)f(of)g(bits)g(from)f(an)g ('X')i(or)e('B')i(column)e(and)g(in)m(terpret)h(them)g(as)g(an)f (unsigned)227 4811 y(n-bit)k(in)m(teger.)54 b(NBIT)35 b(m)m(ust)f(b)s(e)f(less)i(than)f(or)g(equal)h(to)g(16)g(when)f (calling)h(FTGCXI,)g(and)f(less)g(than)227 4924 y(or)e(equal)g(to)g(32) g(when)e(calling)j(FTGCXJ;)f(there)f(is)h(no)f(limit)h(on)g(the)f(v)-5 b(alue)32 b(of)g(NBIT)f(for)g(FTGCXD,)227 5036 y(but)38 b(the)h(returned)e(double)i(precision)f(v)-5 b(alue)39 b(only)g(has)f(48)i(bits)e(of)h(precision)g(on)f(most)h(32-bit)h(w)m (ord)227 5149 y(mac)m(hines.)64 b(The)37 b(NBITS)g(bits)h(are)g(in)m (terpreted)g(as)g(an)g(unsigned)e(in)m(teger)k(unless)d(NBITS)g(=)g(16) i(\(in)227 5262 y(FTGCXI\))e(or)g(32)g(\(in)g(FTGCXJ\))f(in)g(whic)m(h) h(case)g(the)g(string)g(of)f(bits)h(are)g(in)m(terpreted)f(as)h(16-bit) h(or)227 5375 y(32-bit)j(2's)f(complemen)m(t)h(signed)e(in)m(tegers.)69 b(If)39 b(NR)m(O)m(WS)i(is)e(greater)i(than)e(1)h(then)f(the)h(same)g (set)g(of)227 5488 y(bits)34 b(will)g(b)s(e)f(read)h(from)f(sequen)m (tial)i(ro)m(ws)f(in)f(the)h(table)g(starting)h(with)e(ro)m(w)h(FR)m(O) m(W.)h(Note)g(that)g(the)227 5601 y(n)m(um)m(b)s(ering)27 b(con)m(v)m(en)m(tion)j(used)d(here)g(for)h(the)g(FBIT)f(parameter)i (adopts)e(1)h(for)g(the)g(\014rst)f(elemen)m(t)i(of)f(the)227 5714 y(v)m(ector)k(of)f(bits;)f(this)h(is)f(the)h(Most)g(Signi\014can)m (t)g(Bit)g(of)g(the)f(in)m(teger)i(v)-5 b(alue.)p eop end %%Page: 64 70 TeXDict begin 64 69 bop 0 299 a Fi(64)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)382 555 y Fe(FTGCX[IJD]\(unit,colnum,f)o(row)o(,nro)o (ws,f)o(bit)o(,nbi)o(t,)42 b(>)47 b(array,status\))0 788 y Fh(11)f Fi(Get)37 b(the)e(descriptor)h(for)f(a)h(v)-5 b(ariable)37 b(length)f(column)f(in)g(a)h(binary)f(table.)57 b(The)35 b(descriptor)h(consists)g(of)227 901 y(2)c(in)m(teger)g (parameters:)42 b(the)31 b(n)m(um)m(b)s(er)f(of)h(elemen)m(ts)i(in)d (the)h(arra)m(y)h(and)e(the)h(starting)h(o\013set)g(relativ)m(e)h(to) 227 1014 y(the)28 b(start)f(of)g(the)h(heap.)39 b(The)27 b(\014rst)f(routine)h(returns)f(a)h(single)h(descriptor)f(whereas)g (the)g(second)g(routine)227 1127 y(returns)i(the)i(descriptors)f(for)g (a)h(range)g(of)f(ro)m(ws)h(in)f(the)g(table.)382 1359 y Fe(FTGDES\(unit,colnum,rownu)o(m,)41 b(>)48 b (nelements,offset,status\))382 1472 y(FTGDESLL\(unit,colnum,row)o(num)o (,)42 b(>)47 b(nelementsll,offsetll,statu)o(s\))382 1698 y(FTGDESS\(unit,colnum,firs)o(tro)o(w,nr)o(ows)41 b(>)48 b(nelements,offset,)43 b(status\))382 1811 y(FTGDESSLL\(unit,colnum,fi) o(rst)o(row,)o(nrow)o(s)f(>)47 b(nelementsll,offsetll,)42 b(status\))0 2044 y Fh(12)k Fi(W)-8 b(rite)33 b(the)f(descriptor)g(for) f(a)i(v)-5 b(ariable)32 b(length)g(column)g(in)f(a)i(binary)e(table.)45 b(These)32 b(subroutines)e(can)j(b)s(e)227 2157 y(used)f(in)h (conjunction)g(with)g(FTGDES)g(to)g(enable)h(2)f(or)g(more)g(arra)m(ys) h(to)f(p)s(oin)m(t)g(to)h(the)f(same)g(storage)227 2270 y(lo)s(cation)f(to)f(sa)m(v)m(e)h(storage)g(space)f(if)f(the)h(arra)m (ys)g(are)g(iden)m(tical.)382 2503 y Fe(FTPDES\(unit,colnum,rownu)o (m,n)o(elem)o(ents)o(,of)o(fset)o(,)42 b(>)47 b(status\))382 2615 y(FTPDESLL\(unit,colnum,row)o(num)o(,nel)o(emen)o(tsl)o(l,of)o (fset)o(ll,)41 b(>)48 b(status\))0 2945 y Fd(6.8)135 b(Ro)l(w)46 b(Selection)g(and)f(Calculator)h(Routines)0 3195 y Fi(These)21 b(routines)f(all)i(parse)f(and)f(ev)-5 b(aluate)23 b(an)d(input)g(string)h(con)m(taining)i(a)e(user)f (de\014ned)g(arithmetic)i(expression.)0 3308 y(The)29 b(\014rst)f(3)i(routines)f(select)i(ro)m(ws)e(in)g(a)h(FITS)e(table,)j (based)e(on)g(whether)g(the)g(expression)g(ev)-5 b(aluates)31 b(to)f(true)0 3421 y(\(not)e(equal)f(to)h(zero\))g(or)f(false)h (\(zero\).)41 b(The)27 b(other)g(routines)g(ev)-5 b(aluate)29 b(the)e(expression)g(and)f(calculate)k(a)d(v)-5 b(alue)0 3534 y(for)35 b(eac)m(h)h(ro)m(w)g(of)f(the)h(table.)56 b(The)35 b(allo)m(w)m(ed)i(expression)e(syn)m(tax)g(is)h(describ)s(ed)e (in)h(the)g(ro)m(w)h(\014lter)f(section)h(in)0 3647 y(the)h(earlier)h (`Extended)e(File)i(Name)f(Syn)m(tax')g(c)m(hapter)h(of)f(this)f(do)s (cumen)m(t.)60 b(The)36 b(expression)h(ma)m(y)g(also)h(b)s(e)0 3760 y(written)28 b(to)i(a)e(text)i(\014le,)f(and)f(the)h(name)f(of)h (the)f(\014le,)h(prep)s(ended)e(with)h(a)h('@')f(c)m(haracter)i(ma)m(y) f(b)s(e)f(supplied)f(for)0 3873 y(the)34 b('expr')g(parameter)g(\(e.g.) 53 b('@\014lename.txt'\).)f(The)34 b(expression)f(in)h(the)g(\014le)g (can)g(b)s(e)f(arbitrarily)h(complex)0 3985 y(and)h(extend)h(o)m(v)m (er)h(m)m(ultiple)f(lines)g(of)g(the)f(\014le.)57 b(Lines)36 b(that)g(b)s(egin)f(with)g(2)h(slash)g(c)m(haracters)h(\('//'\))h(will) e(b)s(e)0 4098 y(ignored)30 b(and)g(ma)m(y)h(b)s(e)f(used)g(to)h(add)e (commen)m(ts)j(to)f(the)f(\014le.)0 4331 y Fh(1)81 b Fi(Ev)-5 b(aluate)38 b(a)f(b)s(o)s(olean)g(expression)g(o)m(v)m(er)h (the)g(indicated)f(ro)m(ws,)i(returning)d(an)h(arra)m(y)h(of)f(\015ags) g(indicating)227 4444 y(whic)m(h)30 b(ro)m(ws)h(ev)-5 b(aluated)31 b(to)g(TR)m(UE/F)-10 b(ALSE)430 4677 y Fe (FTFROW\(unit,expr,firstr)o(ow,)41 b(nrows,)46 b(>)i(n_good_rows,)c (row_status,)h(status\))0 4910 y Fh(2)81 b Fi(Find)29 b(the)i(\014rst)f(ro)m(w)g(whic)m(h)g(satis\014es)h(the)g(input)e(b)s (o)s(olean)h(expression)430 5142 y Fe(FTFFRW\(unit,)44 b(expr,)i(>)i(rownum,)e(status\))0 5375 y Fh(3)81 b Fi(Ev)-5 b(aluate)35 b(an)f(expression)h(on)f(all)h(ro)m(ws)g(of)f(a)h(table.)54 b(If)34 b(the)g(input)g(and)g(output)g(\014les)g(are)h(not)g(the)f (same,)227 5488 y(cop)m(y)i(the)g(TR)m(UE)f(ro)m(ws)g(to)h(the)f (output)g(\014le;)j(if)d(the)g(output)g(table)h(is)f(not)h(empt)m(y)-8 b(,)37 b(then)e(this)g(routine)227 5601 y(will)28 b(app)s(end)e(the)i (new)f(selected)i(ro)m(ws)e(after)h(the)g(existing)h(ro)m(ws.)39 b(If)27 b(the)h(\014les)g(are)f(the)h(same,)h(delete)g(the)227 5714 y(F)-10 b(ALSE)30 b(ro)m(ws)h(\(preserv)m(e)f(the)h(TR)m(UE)f(ro)m (ws\).)p eop end %%Page: 65 71 TeXDict begin 65 70 bop 0 299 a Fg(6.9.)72 b(CELESTIAL)29 b(COORDINA)-8 b(TE)30 b(SYSTEM)f(SUBR)m(OUTINES)1307 b Fi(65)430 555 y Fe(FTSROW\(inunit,)43 b(outunit,)j(expr,)g(>)i (status\))0 816 y Fh(4)81 b Fi(Calculate)28 b(an)f(expression)f(for)h (the)f(indicated)i(ro)m(ws)e(of)h(a)g(table,)i(returning)d(the)h (results,)g(cast)h(as)f(datat)m(yp)s(e)227 929 y(\(TSHOR)-8 b(T,)32 b(TDOUBLE,)h(etc\),)h(in)e(arra)m(y)-8 b(.)48 b(If)31 b(n)m(ulv)-5 b(al==NULL,)33 b(UNDEFs)g(will)f(b)s(e)g(zero)s (ed)g(out.)47 b(F)-8 b(or)227 1042 y(v)m(ector)37 b(results,)f(the)f(n) m(um)m(b)s(er)e(of)i(elemen)m(ts)i(returned)c(ma)m(y)j(b)s(e)e(less)h (than)g(nelemen)m(ts)g(if)g(nelemen)m(ts)h(is)227 1155 y(not)30 b(an)g(ev)m(en)h(m)m(ultiple)f(of)g(the)g(result)g(dimension.) 40 b(Call)30 b(FTTEXP)g(to)g(obtain)h(the)f(dimensions)f(of)h(the)227 1268 y(results.)430 1529 y Fe(FTCROW\(unit,datatype,ex)o(pr,)o(firs)o (trow)o(,ne)o(leme)o(nts,)o(nul)o(val,)41 b(>)620 1642 y(array,anynul,status\))0 1903 y Fh(5)81 b Fi(Ev)-5 b(aluate)33 b(an)g(expression)f(and)h(write)f(the)h(result)g(either)g(to)h(a)f (column)f(\(if)h(the)g(expression)f(is)h(a)g(function)227 2016 y(of)d(other)g(columns)g(in)f(the)h(table\))h(or)f(to)g(a)h(k)m (eyw)m(ord)f(\(if)g(the)g(expression)f(ev)-5 b(aluates)32 b(to)e(a)g(constan)m(t)i(and)227 2129 y(is)f(not)f(a)h(function)f(of)h (other)f(columns)h(in)f(the)g(table\).)42 b(In)30 b(the)h(former)e (case,)j(the)f(parName)f(parameter)227 2242 y(is)40 b(the)g(name)f(of)h (the)g(column)f(\(whic)m(h)h(ma)m(y)g(or)f(ma)m(y)h(not)g(already)g (exist\))h(in)m(to)f(whic)m(h)g(to)g(write)g(the)227 2355 y(results,)e(and)f(parInfo)e(con)m(tains)j(an)f(optional)g(TF)m (ORM)g(k)m(eyw)m(ord)g(v)-5 b(alue)38 b(if)e(a)h(new)f(column)h(is)f(b) s(eing)227 2468 y(created.)42 b(If)28 b(a)h(TF)m(ORM)h(v)-5 b(alue)29 b(is)g(not)g(sp)s(eci\014ed)g(then)f(a)i(default)f(format)g (will)h(b)s(e)e(used,)h(dep)s(ending)e(on)227 2581 y(the)35 b(expression.)54 b(If)34 b(the)h(expression)f(ev)-5 b(aluates)37 b(to)e(a)g(constan)m(t,)i(then)e(the)g(result)f(will)h(b)s(e)f(written) h(to)227 2693 y(the)28 b(k)m(eyw)m(ord)g(name)f(giv)m(en)h(b)m(y)g(the) f(parName)h(parameter,)h(and)d(the)i(parInfo)e(parameter)i(ma)m(y)g(b)s (e)f(used)227 2806 y(to)k(supply)e(an)h(optional)i(commen)m(t)f(for)f (the)g(k)m(eyw)m(ord.)42 b(If)29 b(the)i(k)m(eyw)m(ord)g(do)s(es)f(not) g(already)h(exist,)g(then)227 2919 y(the)f(name)f(of)h(the)g(k)m(eyw)m (ord)g(m)m(ust)f(b)s(e)g(preceded)g(with)g(a)h('#')f(c)m(haracter,)j (otherwise)e(the)f(result)h(will)g(b)s(e)227 3032 y(written)h(to)g(a)g (column)f(with)g(that)h(name.)430 3293 y Fe(FTCALC\(inunit,)43 b(expr,)k(outunit,)e(parName,)h(parInfo,)f(>)j(status\))0 3554 y Fh(6)81 b Fi(This)38 b(calculator)k(routine)e(is)f(similar)h(to) g(the)g(previous)f(routine,)j(except)f(that)f(the)g(expression)f(is)h (only)227 3667 y(ev)-5 b(aluated)42 b(o)m(v)m(er)f(the)f(sp)s (eci\014ed)g(ro)m(w)g(ranges.)70 b(nranges)39 b(sp)s(eci\014es)h(the)g (n)m(um)m(b)s(er)f(of)h(ro)m(w)h(ranges,)i(and)227 3780 y(\014rstro)m(w)30 b(and)g(lastro)m(w)h(giv)m(e)h(the)f(starting)g(and) f(ending)g(ro)m(w)g(n)m(um)m(b)s(er)f(of)i(eac)m(h)g(range.)430 4041 y Fe(FTCALC_RNG\(inunit,)42 b(expr,)47 b(outunit,)e(parName,)h (parInfo,)573 4154 y(nranges,)f(firstrow,)h(lastrow,)f(>)j(status\))0 4415 y Fh(7)81 b Fi(Ev)-5 b(aluate)36 b(the)f(giv)m(en)h(expression)f (and)g(return)f(dimension)g(and)h(t)m(yp)s(e)g(information)g(on)g(the)h (result.)54 b(The)227 4528 y(returned)37 b(dimensions)f(corresp)s(ond)g (to)j(a)e(single)i(ro)m(w)e(en)m(try)h(of)f(the)h(requested)f (expression,)j(and)d(are)227 4641 y(equiv)-5 b(alen)m(t)26 b(to)f(the)g(result)f(of)g(\014ts)p 1380 4641 28 4 v 33 w(read)p 1585 4641 V 32 w(tdim\(\).)40 b(Note)25 b(that)g(strings)f (are)h(considered)f(to)h(b)s(e)f(one)g(elemen)m(t)227 4754 y(regardless)31 b(of)g(string)f(length.)41 b(If)30 b(maxdim)g(==)g(0,)h(then)f(naxes)g(is)h(optional.)430 5015 y Fe(FTTEXP\(unit,)44 b(expr,)i(maxdim)g(>)i(datatype,)d(nelem,)h (naxis,)g(naxes,)g(status\))0 5350 y Fd(6.9)135 b(Celestial)48 b(Co)t(ordinate)e(System)f(Subroutines)0 5601 y Fi(The)36 b(FITS)g(comm)m(unit)m(y)h(has)f(adopted)h(a)g(set)g(of)g(k)m(eyw)m (ord)g(con)m(v)m(en)m(tions)h(that)f(de\014ne)f(the)h(transformations)0 5714 y(needed)30 b(to)i(con)m(v)m(ert)g(b)s(et)m(w)m(een)f(pixel)g(lo)s (cations)h(in)e(an)h(image)h(and)e(the)g(corresp)s(onding)g(celestial)j (co)s(ordinates)p eop end %%Page: 66 72 TeXDict begin 66 71 bop 0 299 a Fi(66)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)0 555 y Fi(on)25 b(the)h(sky)-8 b(,)27 b(or)e(more)g(generally)-8 b(,)29 b(that)d(de\014ne)e(w)m(orld)h(co)s (ordinates)i(that)e(are)h(to)g(b)s(e)f(asso)s(ciated)i(with)e(an)m(y)h (pixel)0 668 y(lo)s(cation)36 b(in)e(an)h(n-dimensional)f(FITS)g(arra)m (y)-8 b(.)54 b(CFITSIO)33 b(is)h(distributed)g(with)g(a)h(couple)f(of)h (self-con)m(tained)0 781 y(W)-8 b(orld)28 b(Co)s(ordinate)f(System)f (\(W)m(CS\))i(routines,)g(ho)m(w)m(ev)m(er,)h(these)f(routines)f(DO)g (NOT)f(supp)s(ort)f(all)j(the)f(latest)0 894 y(W)m(CS)38 b(con)m(v)m(en)m(tions,)k(so)d(it)g(is)f(STR)m(ONGL)-8 b(Y)38 b(RECOMMENDED)h(that)f(soft)m(w)m(are)i(dev)m(elop)s(ers)e(use)g (a)h(more)0 1007 y(robust)30 b(external)h(W)m(CS)f(library)-8 b(.)41 b(Sev)m(eral)31 b(recommended)f(libraries)h(are:)95 1285 y Fe(WCSLIB)47 b(-)95 b(supported)45 b(by)i(Mark)g(Calabretta)95 1398 y(WCSTools)f(-)h(supported)f(by)h(Doug)g(Mink)95 1511 y(AST)g(library)f(-)i(developed)d(by)i(the)g(U.K.)g(Starlink)e (project)0 1788 y Fi(More)30 b(information)f(ab)s(out)g(the)g(W)m(CS)g (k)m(eyw)m(ord)h(con)m(v)m(en)m(tions)h(and)d(links)h(to)h(all)g(of)f (these)g(W)m(CS)g(libraries)h(can)0 1901 y(b)s(e)g(found)f(on)h(the)h (FITS)e(Supp)s(ort)g(O\016ce)h(w)m(eb)g(site)i(at)f(h)m (ttp://\014ts.gsfc.nasa.go)m(v)j(under)29 b(the)h(W)m(CS)h(link.)0 2061 y(The)i(functions)h(pro)m(vided)g(in)f(these)i(external)f(W)m(CS)g (libraries)h(will)f(need)g(access)h(to)g(the)f(W)m(CS)g(information)0 2174 y(con)m(tained)i(in)f(the)h(FITS)e(\014le)i(headers.)55 b(One)35 b(con)m(v)m(enien)m(t)i(w)m(a)m(y)f(to)g(pass)f(this)g (information)h(to)g(the)f(external)0 2287 y(library)k(is)h(to)h(use)e (FITSIO)g(to)h(cop)m(y)h(the)f(header)f(k)m(eyw)m(ords)h(in)m(to)h(one) f(long)g(c)m(haracter)i(string,)g(and)d(then)0 2400 y(pass)29 b(this)h(string)g(to)g(an)g(in)m(terface)h(routine)f(in)g(the)g (external)g(library)g(that)g(will)g(extract)i(the)e(necessary)g(W)m(CS) 0 2513 y(information)h(\(e.g.,)h(see)f(the)f(astFitsChan)h(and)f (astPutCards)g(routines)g(in)g(the)h(Starlink)f(AST)g(library\).)0 2673 y(The)24 b(follo)m(wing)j(FITSIO)c(routines)i(DO)g(NOT)f(supp)s (ort)f(the)i(more)g(recen)m(t)h(W)m(CS)f(con)m(v)m(en)m(tions)i(that)f (ha)m(v)m(e)g(b)s(een)0 2786 y(appro)m(v)m(ed)37 b(as)h(part)f(of)g (the)h(FITS)e(standard.)61 b(Consequen)m(tly)-8 b(,)39 b(the)f(follo)m(wing)g(routines)g(ARE)f(NO)m(W)h(DEP-)0 2899 y(RECA)-8 b(TED.)29 b(It)f(is)h(STR)m(ONGL)-8 b(Y)28 b(RECOMMENDED)h(that)g(soft)m(w)m(are)h(dev)m(elop)s(ers)f(not)g(use)f (these)h(routines,)0 3012 y(and)h(instead)g(use)g(an)h(external)g(W)m (CS)f(library)-8 b(,)31 b(as)g(describ)s(ed)e(ab)s(o)m(v)m(e.)0 3172 y(These)21 b(routines)g(are)g(included)f(mainly)h(for)g(bac)m(kw)m (ard)g(compatibilit)m(y)j(with)c(existing)i(soft)m(w)m(are.)39 b(They)21 b(supp)s(ort)0 3285 y(the)30 b(follo)m(wing)i(standard)d(map) g(pro)5 b(jections:)41 b(-SIN,)30 b(-T)-8 b(AN,)31 b(-AR)m(C,)g(-NCP)-8 b(,)30 b(-GLS,)g(-MER,)h(and)e(-AIT)h(\(these)0 3398 y(are)f(the)g(legal)h(v)-5 b(alues)29 b(for)f(the)h(co)s(ordt)m(yp)s(e) f(parameter\).)41 b(These)28 b(routines)h(are)g(based)f(on)g(similar)h (functions)f(in)0 3511 y(Classic)j(AIPS.)f(All)h(the)g(angular)f(quan)m (tities)i(are)f(giv)m(en)g(in)f(units)g(of)g(degrees.)0 3789 y Fh(1)81 b Fi(Get)22 b(the)g(v)-5 b(alues)21 b(of)h(all)g(the)g (standard)f(FITS)f(celestial)k(co)s(ordinate)f(system)e(k)m(eyw)m(ords) h(from)f(the)h(header)f(of)h(a)227 3902 y(FITS)j(image)i(\(i.e.,)h(the) d(primary)g(arra)m(y)h(or)f(an)h(image)g(extension\).)40 b(These)26 b(v)-5 b(alues)25 b(ma)m(y)h(then)g(b)s(e)e(passed)227 4015 y(to)39 b(the)e(subroutines)g(that)h(p)s(erform)e(the)i(co)s (ordinate)g(transformations.)63 b(If)37 b(an)m(y)h(or)g(all)g(of)g(the) g(W)m(CS)227 4127 y(k)m(eyw)m(ords)32 b(are)f(not)g(presen)m(t,)h(then) f(default)g(v)-5 b(alues)31 b(will)h(b)s(e)e(returned.)41 b(If)31 b(the)g(\014rst)g(co)s(ordinate)g(axis)h(is)227 4240 y(the)d(declination-lik)m(e)j(co)s(ordinate,)e(then)e(this)g (routine)h(will)g(sw)m(ap)f(them)h(so)g(that)g(the)g(longitudinal-lik)m (e)227 4353 y(co)s(ordinate)i(is)g(returned)e(as)i(the)f(\014rst)g (axis.)227 4513 y(If)35 b(the)h(\014le)f(uses)g(the)g(new)m(er)h('CDj)p 1454 4513 28 4 v 32 w(i')g(W)m(CS)f(transformation)h(matrix)g(k)m(eyw)m (ords)f(instead)h(of)f(old)h(st)m(yle)227 4625 y('CDEL)-8 b(Tn')37 b(and)f('CR)m(OT)-8 b(A2')38 b(k)m(eyw)m(ords,)h(then)e(this)f (routine)h(will)g(calculate)j(and)c(return)g(the)h(v)-5 b(alues)227 4738 y(of)33 b(the)g(equiv)-5 b(alen)m(t)35 b(old-st)m(yle)f(k)m(eyw)m(ords.)49 b(Note)34 b(that)g(the)f(con)m(v)m (ersion)h(from)e(the)i(new-st)m(yle)g(k)m(eyw)m(ords)227 4851 y(to)e(the)f(old-st)m(yle)h(v)-5 b(alues)31 b(is)g(sometimes)g (only)g(an)g(appro)m(ximation,)h(so)e(if)h(the)g(appro)m(ximation)h(is) e(larger)227 4964 y(than)37 b(an)h(in)m(ternally)g(de\014ned)e (threshold)h(lev)m(el,)k(then)c(CFITSIO)f(will)i(still)g(return)e(the)i (appro)m(ximate)227 5077 y(W)m(CS)f(k)m(eyw)m(ord)g(v)-5 b(alues,)39 b(but)d(will)h(also)h(return)d(with)i(status)g(=)f(506,)k (to)e(w)m(arn)e(the)h(calling)h(program)227 5190 y(that)30 b(appro)m(ximations)f(ha)m(v)m(e)h(b)s(een)e(made.)40 b(It)29 b(is)g(then)f(up)g(to)h(the)g(calling)i(program)d(to)h(decide)h (whether)227 5303 y(the)k(appro)m(ximations)g(are)g(su\016cien)m(tly)g (accurate)i(for)d(the)h(particular)f(application,)j(or)e(whether)f (more)227 5416 y(precise)e(W)m(CS)f(transformations)h(m)m(ust)f(b)s(e)g (p)s(erformed)f(using)h(new-st)m(yle)h(W)m(CS)g(k)m(eyw)m(ords)f (directly)-8 b(.)382 5694 y Fe(FTGICS\(unit,)44 b(>)k (xrval,yrval,xrpix,yrpix)o(,xin)o(c,yi)o(nc,)o(rot,)o(coor)o(dty)o (pe,s)o(tatu)o(s\))p eop end %%Page: 67 73 TeXDict begin 67 72 bop 0 299 a Fg(6.10.)73 b(FILE)30 b(CHECKSUM)f(SUBR)m(OUTINES)2080 b Fi(67)0 555 y Fh(2)81 b Fi(Get)34 b(the)f(v)-5 b(alues)33 b(of)g(all)h(the)f(standard)f(FITS) h(celestial)i(co)s(ordinate)f(system)f(k)m(eyw)m(ords)g(from)g(the)g (header)227 668 y(of)j(a)h(FITS)e(table)h(where)g(the)g(X)g(and)f(Y)h (\(or)g(RA)g(and)g(DEC)f(co)s(ordinates)i(are)f(stored)g(in)g(2)g (separate)227 781 y(columns)c(of)g(the)g(table.)46 b(These)31 b(v)-5 b(alues)32 b(ma)m(y)h(then)e(b)s(e)h(passed)f(to)h(the)g (subroutines)f(that)h(p)s(erform)f(the)227 894 y(co)s(ordinate)g (transformations.)382 1114 y Fe(FTGTCS\(unit,xcol,ycol,)42 b(>)716 1227 y(xrval,yrval,xrpix,yrpix,)o(xinc)o(,yi)o(nc,r)o(ot,c)o (oor)o(dtyp)o(e,st)o(atu)o(s\))0 1446 y Fh(3)81 b Fi(Calculate)42 b(the)g(celestial)h(co)s(ordinate)f(corresp)s(onding)e(to)i(the)f (input)f(X)h(and)g(Y)g(pixel)g(lo)s(cation)i(in)e(the)227 1559 y(image.)382 1779 y Fe(FTWLDP\(xpix,ypix,xrval,y)o(rva)o(l,xr)o (pix,)o(yrp)o(ix,x)o(inc,)o(yin)o(c,ro)o(t,)1241 1892 y(coordtype,)k(>)i(xpos,ypos,status\))0 2112 y Fh(4)81 b Fi(Calculate)42 b(the)g(X)f(and)f(Y)h(pixel)h(lo)s(cation)g(corresp)s (onding)e(to)i(the)f(input)f(celestial)k(co)s(ordinate)e(in)f(the)227 2225 y(image.)382 2445 y Fe(FTXYPX\(xpos,ypos,xrval,y)o(rva)o(l,xr)o (pix,)o(yrp)o(ix,x)o(inc,)o(yin)o(c,ro)o(t,)1241 2557 y(coordtype,)k(>)i(xpix,ypix,status\))0 2885 y Fd(6.10)136 b(File)45 b(Chec)l(ksum)g(Subroutines)0 3135 y Fi(The)33 b(follo)m(wing)h(routines)f(either)h(compute)f(or)h(v)-5 b(alidate)34 b(the)g(c)m(hec)m(ksums)f(for)g(the)h(CHDU.)g(The)e(D)m(A) -8 b(T)g(ASUM)0 3248 y(k)m(eyw)m(ord)33 b(is)f(used)f(to)i(store)f(the) h(n)m(umerical)f(v)-5 b(alue)33 b(of)f(the)g(32-bit,)i(1's)f(complemen) m(t)g(c)m(hec)m(ksum)g(for)f(the)g(data)0 3361 y(unit)26 b(alone.)40 b(If)25 b(there)h(is)h(no)e(data)i(unit)f(then)f(the)h(v)-5 b(alue)27 b(is)f(set)g(to)h(zero.)40 b(The)26 b(n)m(umerical)g(v)-5 b(alue)27 b(is)f(stored)g(as)g(an)0 3474 y(ASCI)s(I)20 b(string)i(of)h(digits,)h(enclosed)f(in)e(quotes,)k(b)s(ecause)d(the)g (v)-5 b(alue)23 b(ma)m(y)f(b)s(e)f(to)s(o)i(large)g(to)g(represen)m(t)f (as)g(a)h(32-bit)0 3587 y(signed)28 b(in)m(teger.)41 b(The)27 b(CHECKSUM)g(k)m(eyw)m(ord)i(is)f(used)f(to)h(store)h(the)f (ASCI)s(I)e(enco)s(ded)i(COMPLEMENT)f(of)0 3700 y(the)f(c)m(hec)m(ksum) h(for)f(the)h(en)m(tire)g(HDU.)g(Storing)f(the)h(complemen)m(t,)h (rather)e(than)g(the)h(actual)g(c)m(hec)m(ksum,)h(forces)0 3812 y(the)k(c)m(hec)m(ksum)h(for)f(the)h(whole)f(HDU)h(to)g(equal)g (zero.)47 b(If)31 b(the)i(\014le)f(has)g(b)s(een)f(mo)s(di\014ed)g (since)i(the)f(c)m(hec)m(ksums)0 3925 y(w)m(ere)39 b(computed,)i(then)e (the)g(HDU)g(c)m(hec)m(ksum)h(will)f(usually)f(not)h(equal)h(zero.)66 b(These)39 b(c)m(hec)m(ksum)g(k)m(eyw)m(ord)0 4038 y(con)m(v)m(en)m (tions)34 b(are)f(based)f(on)g(a)g(pap)s(er)f(b)m(y)h(Rob)g(Seaman)g (published)f(in)h(the)g(pro)s(ceedings)g(of)g(the)h(AD)m(ASS)f(IV)0 4151 y(conference)f(in)f(Baltimore)i(in)f(No)m(v)m(em)m(b)s(er)g(1994)h (and)e(a)h(later)g(revision)g(in)f(June)f(1995.)0 4371 y Fh(1)81 b Fi(Compute)33 b(and)g(write)h(the)g(D)m(A)-8 b(T)g(ASUM)35 b(and)e(CHECKSUM)g(k)m(eyw)m(ord)h(v)-5 b(alues)34 b(for)f(the)h(CHDU)g(in)m(to)h(the)227 4484 y(curren)m(t)25 b(header.)38 b(The)24 b(D)m(A)-8 b(T)g(ASUM)27 b(v)-5 b(alue)25 b(is)f(the)h(32-bit)h(c)m(hec)m(ksum)f(for)f(the)h (data)g(unit,)h(expressed)e(as)h(a)227 4597 y(decimal)32 b(in)m(teger)f(enclosed)g(in)f(single)h(quotes.)41 b(The)30 b(CHECKSUM)g(k)m(eyw)m(ord)g(v)-5 b(alue)31 b(is)f(a)h(16-c)m(haracter) 227 4710 y(string)j(whic)m(h)f(is)h(the)f(ASCI)s(I-enco)s(ded)f(v)-5 b(alue)34 b(for)g(the)f(complemen)m(t)i(of)f(the)f(c)m(hec)m(ksum)i (for)e(the)h(whole)227 4823 y(HDU.)h(If)e(these)g(k)m(eyw)m(ords)h (already)g(exist,)h(their)e(v)-5 b(alues)34 b(will)g(b)s(e)f(up)s (dated)f(only)h(if)g(necessary)h(\(i.e.,)i(if)227 4936 y(the)31 b(\014le)f(has)g(b)s(een)g(mo)s(di\014ed)f(since)i(the)g (original)g(k)m(eyw)m(ord)g(v)-5 b(alues)31 b(w)m(ere)g(computed\).)382 5155 y Fe(FTPCKS\(unit,)44 b(>)k(status\))0 5375 y Fh(2)81 b Fi(Up)s(date)28 b(the)h(CHECKSUM)e(k)m(eyw)m(ord)i(v)-5 b(alue)29 b(in)f(the)h(CHDU,)g(assuming)f(that)h(the)f(D)m(A)-8 b(T)g(ASUM)30 b(k)m(eyw)m(ord)227 5488 y(exists)36 b(and)f(already)h (has)f(the)h(correct)g(v)-5 b(alue.)56 b(This)35 b(routine)g (calculates)j(the)e(new)f(c)m(hec)m(ksum)h(for)f(the)227 5601 y(curren)m(t)40 b(header)g(unit,)j(adds)c(it)i(to)g(the)f(data)h (unit)f(c)m(hec)m(ksum,)k(enco)s(des)c(the)g(v)-5 b(alue)41 b(in)m(to)g(an)f(ASCI)s(I)227 5714 y(string,)31 b(and)f(writes)g(the)h (string)f(to)h(the)g(CHECKSUM)e(k)m(eyw)m(ord.)p eop end %%Page: 68 74 TeXDict begin 68 73 bop 0 299 a Fi(68)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)382 555 y Fe(FTUCKS\(unit,)44 b(>)k(status\))0 807 y Fh(3)81 b Fi(V)-8 b(erify)35 b(the)f(CHDU)h(b)m(y)g(computing)f (the)h(c)m(hec)m(ksums)g(and)f(comparing)h(them)f(with)g(the)h(k)m(eyw) m(ords.)53 b(The)227 920 y(data)34 b(unit)f(is)g(v)m(eri\014ed)g (correctly)h(if)f(the)h(computed)f(c)m(hec)m(ksum)g(equals)h(the)f(v)-5 b(alue)34 b(of)f(the)g(D)m(A)-8 b(T)g(ASUM)227 1033 y(k)m(eyw)m(ord.)64 b(The)37 b(c)m(hec)m(ksum)i(for)f(the)g(en)m(tire)g(HDU)h(\(header)f (plus)f(data)i(unit\))e(is)h(correct)h(if)f(it)h(equals)227 1146 y(zero.)55 b(The)34 b(output)g(D)m(A)-8 b(T)g(A)m(OK)37 b(and)d(HDUOK)h(parameters)g(in)f(this)h(subroutine)e(are)i(in)m (tegers)h(whic)m(h)227 1259 y(will)27 b(ha)m(v)m(e)g(a)f(v)-5 b(alue)27 b(=)f(1)g(if)g(the)h(data)f(or)g(HDU)h(is)f(v)m(eri\014ed)h (correctly)-8 b(,)29 b(a)d(v)-5 b(alue)27 b(=)e(0)i(if)f(the)g(D)m(A)-8 b(T)g(ASUM)28 b(or)227 1372 y(CHECKSUM)h(k)m(eyw)m(ord)g(is)h(not)f (presen)m(t,)h(or)f(v)-5 b(alue)30 b(=)f(-1)h(if)f(the)h(computed)f(c)m (hec)m(ksum)h(is)f(not)h(correct.)382 1623 y Fe(FTVCKS\(unit,)44 b(>)k(dataok,hduok,status\))0 1875 y Fh(4)81 b Fi(Compute)25 b(and)h(return)f(the)i(c)m(hec)m(ksum)g(v)-5 b(alues)26 b(for)g(the)h(CHDU)f(\(as)h(double)f(precision)h(v)-5 b(ariables\))27 b(without)227 1988 y(creating)46 b(or)e(mo)s(difying)g (the)h(CHECKSUM)e(and)h(D)m(A)-8 b(T)g(ASUM)46 b(k)m(eyw)m(ords.)83 b(This)44 b(routine)g(is)h(used)227 2101 y(in)m(ternally)32 b(b)m(y)e(FTV)m(CKS,)g(but)g(ma)m(y)h(b)s(e)e(useful)h(in)g(other)h (situations)g(as)f(w)m(ell.)382 2353 y Fe(FTGCKS\(unit,)44 b(>)k(datasum,hdusum,status\))0 2604 y Fh(5)81 b Fi(Enco)s(de)33 b(a)h(c)m(hec)m(ksum)h(v)-5 b(alue)34 b(\(stored)g(in)g(a)g(double)g (precision)g(v)-5 b(ariable\))35 b(in)m(to)f(a)h(16-c)m(haracter)h (string.)51 b(If)227 2717 y(COMPLEMENT)30 b(=)g(.true.)41 b(then)30 b(the)g(32-bit)i(sum)d(v)-5 b(alue)31 b(will)g(b)s(e)f (complemen)m(ted)h(b)s(efore)f(enco)s(ding.)382 2969 y Fe(FTESUM\(sum,complement,)42 b(>)47 b(checksum\))0 3221 y Fh(6)81 b Fi(Deco)s(de)39 b(a)f(16)h(c)m(haracter)h(c)m(hec)m (ksum)e(string)g(in)m(to)h(a)g(double)e(precision)h(v)-5 b(alue.)65 b(If)37 b(COMPLEMENT)g(=)227 3334 y(.true.)k(then)30 b(the)h(32-bit)g(sum)f(v)-5 b(alue)31 b(will)f(b)s(e)g(complemen)m(ted) i(after)e(deco)s(ding.)382 3586 y Fe(FTDSUM\(checksum,compleme)o(nt,)41 b(>)48 b(sum\))0 3918 y Fd(6.11)180 b(Date)46 b(and)f(Time)g(Utilit)l (y)i(Routines)0 4168 y Fi(The)29 b(follo)m(wing)i(routines)f(help)f(to) i(construct)f(or)f(parse)h(the)g(FITS)f(date/time)i(strings.)41 b(Starting)30 b(in)f(the)h(y)m(ear)0 4281 y(2000,)k(the)d(FITS)g(D)m(A) -8 b(TE)32 b(k)m(eyw)m(ord)g(v)-5 b(alues)31 b(\(and)h(the)f(v)-5 b(alues)32 b(of)f(other)h(`D)m(A)-8 b(TE-')33 b(k)m(eyw)m(ords\))f(m)m (ust)f(ha)m(v)m(e)i(the)0 4394 y(form)j('YYYY-MM-DD')k(\(date)e(only\)) f(or)g('YYYY-MM-DDThh:mm:ss.ddd...')61 b(\(date)38 b(and)e(time\))h (where)0 4507 y(the)30 b(n)m(um)m(b)s(er)f(of)i(decimal)g(places)g(in)f (the)g(seconds)g(v)-5 b(alue)31 b(is)f(optional.)42 b(These)30 b(times)h(are)f(in)g(UTC.)g(The)g(older)0 4620 y('dd/mm/yy')g(date)h (format)g(ma)m(y)g(not)g(b)s(e)e(used)h(for)g(dates)h(after)g(01)g(Jan) m(uary)f(2000.)0 4872 y Fh(1)81 b Fi(Get)31 b(the)g(curren)m(t)f (system)g(date.)42 b(The)29 b(returned)h(y)m(ear)h(has)f(4)h(digits)g (\(1999,)h(2000,)h(etc.\))382 5123 y Fe(FTGSDT\()46 b(>)h(day,)g (month,)f(year,)g(status)g(\))0 5375 y Fh(2)81 b Fi(Get)34 b(the)g(curren)m(t)g(system)f(date)i(and)e(time)h(string)g (\('YYYY-MM-DDThh:mm:ss'\).)53 b(The)33 b(time)i(will)f(b)s(e)227 5488 y(in)26 b(UTC/GMT)g(if)g(a)m(v)-5 b(ailable,)29 b(as)e(indicated)f(b)m(y)g(a)g(returned)f(timeref)h(v)-5 b(alue)27 b(=)e(0.)40 b(If)26 b(the)g(returned)e(v)-5 b(alue)227 5601 y(of)31 b(timeref)g(=)g(1)g(then)f(this)h(indicates)g (that)h(it)f(w)m(as)g(not)g(p)s(ossible)f(to)h(con)m(v)m(ert)i(the)d (lo)s(cal)i(time)g(to)f(UTC,)227 5714 y(and)f(th)m(us)g(the)h(lo)s(cal) g(time)g(w)m(as)g(returned.)p eop end %%Page: 69 75 TeXDict begin 69 74 bop 0 299 a Fg(6.12.)73 b(GENERAL)30 b(UTILITY)g(SUBR)m(OUTINES)1979 b Fi(69)382 555 y Fe(FTGSTM\(>)45 b(datestr,)h(timeref,)f(status\))0 821 y Fh(3)81 b Fi(Construct)26 b(a)i(date)g(string)f(from)g(the)g(input)f(date)i(v)-5 b(alues.)40 b(If)27 b(the)g(y)m(ear)h(is)g(b)s(et)m(w)m(een)f(1900)i (and)e(1998,)j(inclu-)227 934 y(siv)m(e,)38 b(then)c(the)i(returned)d (date)j(string)f(will)g(ha)m(v)m(e)i(the)e(old)g(FITS)f(format)i (\('dd/mm/yy'\),)h(otherwise)227 1047 y(the)32 b(date)g(string)f(will)g (ha)m(v)m(e)i(the)e(new)g(FITS)g(format)g(\('YYYY-MM-DD'\).)36 b(Use)c(FTTM2S)f(instead)g(to)227 1160 y(alw)m(a)m(ys)h(return)d(a)i (date)g(string)g(using)e(the)i(new)f(FITS)g(format.)382 1426 y Fe(FTDT2S\()46 b(year,)g(month,)g(day,)h(>)g(datestr,)f (status\))0 1692 y Fh(4)81 b Fi(Construct)34 b(a)i(new-format)f(date)h (+)f(time)h(string)f(\('YYYY-MM-DDThh:mm:ss.ddd...'\).)57 b(If)34 b(the)i(y)m(ear,)227 1805 y(mon)m(th,)d(and)e(da)m(y)h(v)-5 b(alues)32 b(all)h(=)e(0)h(then)g(only)g(the)g(time)g(is)g(enco)s(ded)f (with)h(format)g('hh:mm:ss.ddd...'.)227 1918 y(The)j(decimals)h (parameter)g(sp)s(eci\014es)e(ho)m(w)i(man)m(y)f(decimal)h(places)g(of) f(fractional)i(seconds)e(to)h(include)227 2030 y(in)30 b(the)h(string.)41 b(If)29 b(`decimals')j(is)f(negativ)m(e,)h(then)f (only)f(the)h(date)g(will)f(b)s(e)g(return)f(\('YYYY-MM-DD'\).)382 2296 y Fe(FTTM2S\()46 b(year,)g(month,)g(day,)h(hour,)f(minute,)g (second,)g(decimals,)764 2409 y(>)h(datestr,)f(status\))0 2675 y Fh(5)81 b Fi(Return)44 b(the)g(date)i(as)f(read)f(from)h(the)g (input)e(string,)49 b(where)44 b(the)h(string)g(ma)m(y)g(b)s(e)f(in)h (either)g(the)g(old)227 2788 y(\('dd/mm/yy'\))31 b(or)g(new)e (\('YYYY-MM-DDThh:mm:ss')k(or)d('YYYY-MM-DD'\))k(FITS)c(format.)382 3054 y Fe(FTS2DT\(datestr,)43 b(>)48 b(year,)e(month,)g(day,)h (status\))0 3320 y Fh(6)81 b Fi(Return)30 b(the)h(date)h(and)f(time)h (as)f(read)g(from)g(the)h(input)e(string,)h(where)g(the)h(string)f(ma)m (y)h(b)s(e)e(in)h(either)h(the)227 3433 y(old)d(or)f(new)g(FITS)g (format.)40 b(The)28 b(returned)f(hours,)h(min)m(utes,)h(and)f(seconds) g(v)-5 b(alues)29 b(will)f(b)s(e)g(set)h(to)g(zero)227 3546 y(if)k(the)h(input)e(string)h(do)s(es)g(not)h(include)f(the)g (time)h(\('dd/mm/yy')f(or)h('YYYY-MM-DD'\))j(.)c(Similarly)-8 b(,)227 3659 y(the)36 b(returned)e(y)m(ear,)j(mon)m(th,)g(and)d(date)i (v)-5 b(alues)36 b(will)f(b)s(e)g(set)h(to)g(zero)g(if)f(the)g(date)h (is)f(not)h(included)e(in)227 3772 y(the)d(input)e(string)i (\('hh:mm:ss.ddd...'\).)382 4037 y Fe(FTS2TM\(datestr,)43 b(>)48 b(year,)e(month,)g(day,)h(hour,)f(minute,)g(second,)g(status\))0 4378 y Fd(6.12)136 b(General)45 b(Utilit)l(y)i(Subroutines)0 4630 y Fi(The)30 b(follo)m(wing)i(utilit)m(y)f(subroutines)f(ma)m(y)h (b)s(e)e(useful)h(for)g(certain)h(applications:)0 4896 y Fh(1)81 b Fi(Return)29 b(the)i(starting)g(b)m(yte)g(address)e(of)i (the)f(CHDU)h(and)f(the)h(next)f(HDU.)382 5162 y Fe(FTGHAD\(iunit,)44 b(>)j(curaddr,)f(nextaddr\))0 5428 y Fh(2)81 b Fi(Con)m(v)m(ert)31 b(a)g(c)m(haracter)h(string)e(to)h(upp)s(ercase)e(\(op)s(erates)j(in)e (place\).)382 5694 y Fe(FTUPCH\(string\))p eop end %%Page: 70 76 TeXDict begin 70 75 bop 0 299 a Fi(70)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)0 555 y Fh(3)81 b Fi(Compare)43 b(the)i(input)e (template)i(string)f(against)h(the)g(reference)f(string)g(to)h(see)g (if)f(they)g(matc)m(h.)82 b(The)227 668 y(template)36 b(string)f(ma)m(y)g(con)m(tain)g(wildcard)f(c)m(haracters:)51 b('*')35 b(will)g(matc)m(h)g(an)m(y)g(sequence)g(of)f(c)m(haracters)227 781 y(\(including)j(zero)h(c)m(haracters\))g(and)e(')10 b(?')60 b(will)38 b(matc)m(h)f(an)m(y)g(single)h(c)m(haracter)g(in)f (the)g(reference)g(string.)227 894 y(The)31 b('#')g(c)m(haracter)i (will)f(matc)m(h)g(an)m(y)f(consecutiv)m(e)j(string)d(of)g(decimal)h (digits)g(\(0)g(-)g(9\).)43 b(If)31 b(CASESN)f(=)227 1007 y(.true.)45 b(then)31 b(the)g(matc)m(h)i(will)f(b)s(e)f(case)h (sensitiv)m(e.)46 b(The)31 b(returned)f(MA)-8 b(TCH)32 b(parameter)g(will)g(b)s(e)f(.true.)227 1120 y(if)j(the)h(2)f(strings)g (matc)m(h,)j(and)c(EXA)m(CT)h(will)h(b)s(e)e(.true.)53 b(if)34 b(the)g(matc)m(h)h(is)g(exact)g(\(i.e.,)i(if)d(no)g(wildcard) 227 1233 y(c)m(haracters)e(w)m(ere)f(used)f(in)g(the)g(matc)m(h\).)42 b(Both)31 b(strings)f(m)m(ust)h(b)s(e)e(68)j(c)m(haracters)f(or)g(less) f(in)g(length.)382 1505 y Fe(FTCMPS\(str_template,)42 b(string,)k(casesen,)f(>)j(match,)e(exact\))0 1778 y Fh(4)81 b Fi(T)-8 b(est)31 b(that)g(the)f(k)m(eyw)m(ord)h(name)f(con)m (tains)i(only)e(legal)j(c)m(haracters:)42 b(A-Z,0-9,)32 b(h)m(yphen,)d(and)h(underscore.)382 2051 y Fe(FTTKEY\(keyword,)43 b(>)48 b(status\))0 2324 y Fh(5)81 b Fi(T)-8 b(est)31 b(that)g(the)f(k)m(eyw)m(ord)h(record)f(con)m(tains)i(only)e(legal)i (prin)m(table)f(ASCI)s(I)e(c)m(haracters)382 2597 y Fe(FTTREC\(card,)44 b(>)k(status\))0 2869 y Fh(6)81 b Fi(T)-8 b(est)25 b(whether)f(the)h (curren)m(t)f(header)h(con)m(tains)g(an)m(y)g(NULL)g(\(ASCI)s(I)e(0\))j (c)m(haracters.)40 b(These)24 b(c)m(haracters)j(are)227 2982 y(illegal)37 b(in)d(the)h(header,)g(but)f(they)g(will)h(go)g (undetected)g(b)m(y)f(most)h(of)g(the)f(CFITSIO)f(k)m(eyw)m(ord)i (header)227 3095 y(routines,)29 b(b)s(ecause)f(the)h(n)m(ull)f(is)g(in) m(terpreted)g(as)h(the)f(normal)g(end-of-string)h(terminator.)41 b(This)27 b(routine)227 3208 y(returns)h(the)g(p)s(osition)h(of)g(the)g (\014rst)f(n)m(ull)g(c)m(haracter)i(in)f(the)f(header,)h(or)g(zero)g (if)g(there)g(are)g(no)f(n)m(ulls.)40 b(F)-8 b(or)227 3321 y(example)37 b(a)f(returned)f(v)-5 b(alue)37 b(of)f(110)h(w)m (ould)f(indicate)h(that)g(the)f(\014rst)f(NULL)h(is)g(lo)s(cated)h(in)f (the)g(30th)227 3434 y(c)m(haracter)28 b(of)f(the)g(second)f(k)m(eyw)m (ord)h(in)f(the)h(header)f(\(recall)i(that)f(eac)m(h)h(header)e(record) h(is)f(80)h(c)m(haracters)227 3547 y(long\).)56 b(Note)36 b(that)g(this)f(is)g(one)g(of)g(the)g(few)g(FITSIO)f(routines)h(in)f (whic)m(h)h(the)g(returned)f(v)-5 b(alue)36 b(is)f(not)227 3660 y(necessarily)d(equal)e(to)i(the)e(status)h(v)-5 b(alue\).)382 3933 y Fe(FTNCHK\(unit,)44 b(>)k(status\))0 4205 y Fh(7)81 b Fi(P)m(arse)27 b(a)f(header)h(k)m(eyw)m(ord)g(record)f (and)g(return)f(the)i(name)f(of)h(the)f(k)m(eyw)m(ord)h(and)f(the)h (length)f(of)h(the)g(name.)227 4318 y(The)34 b(k)m(eyw)m(ord)h(name)f (normally)h(o)s(ccupies)f(the)h(\014rst)e(8)i(c)m(haracters)g(of)g(the) f(record,)i(except)f(under)e(the)227 4431 y(HIERAR)m(CH)e(con)m(v)m(en) m(tion)h(where)e(the)h(name)f(can)h(b)s(e)f(up)f(to)i(70)g(c)m (haracters)h(in)e(length.)382 4704 y Fe(FTGKNM\(card,)44 b(>)k(keyname,)d(keylength,)g(staThe)h('\\#')h(character)e(will)i (match)f(any)h(consecutive)e(string)191 4817 y(of)i(decimal)f(digits)g (\(0)h(-)h(9\).)f(tus\))0 5090 y Fh(8)81 b Fi(P)m(arse)34 b(a)h(header)f(k)m(eyw)m(ord)h(record.)52 b(This)33 b(subroutine)g (parses)h(the)g(input)g(header)g(record)g(to)h(return)e(the)227 5203 y(v)-5 b(alue)27 b(\(as)g(a)g(c)m(haracter)g(string\))g(and)f (commen)m(t)h(strings.)39 b(If)26 b(the)g(k)m(eyw)m(ord)h(has)f(no)g(v) -5 b(alue)27 b(\(columns)f(9-10)227 5316 y(not)h(equal)f(to)h('=)f ('\),)i(then)e(the)g(v)-5 b(alue)27 b(string)f(is)g(returned)f(blank)h (and)f(the)h(commen)m(t)i(string)e(is)g(set)g(equal)227 5428 y(to)31 b(column)g(9)f(-)h(80)g(of)g(the)f(input)g(string.)382 5701 y Fe(FTPSVC\(card,)44 b(>)k(value,comment,status\))p eop end %%Page: 71 77 TeXDict begin 71 76 bop 0 299 a Fg(6.12.)73 b(GENERAL)30 b(UTILITY)g(SUBR)m(OUTINES)1979 b Fi(71)0 555 y Fh(9)81 b Fi(Construct)41 b(a)h(prop)s(erly)f(formated)h(80-c)m(haracter)i (header)e(k)m(eyw)m(ord)g(record)f(from)h(the)g(input)e(k)m(eyw)m(ord) 227 668 y(name,)25 b(k)m(eyw)m(ord)f(v)-5 b(alue,)25 b(and)e(k)m(eyw)m(ord)h(commen)m(t)g(strings.)38 b(Hierarc)m(hical)26 b(k)m(eyw)m(ord)e(names)f(\(e.g.,)j("ESO)227 781 y(TELE)e(CAM"\))i(are) f(supp)s(orted.)37 b(The)25 b(v)-5 b(alue)25 b(string)g(ma)m(y)h(con)m (tain)g(an)f(in)m(teger,)i(\015oating)f(p)s(oin)m(t,)g(logical,)227 894 y(or)31 b(quoted)f(c)m(haracter)i(string)e(\(e.g.,)j("12",)f ("15.7",)h("T",)e(or)g("'NGC)g(1313'"\).)382 1153 y Fe (FTMKKY\(keyname,)43 b(value,)k(comment,)e(>)j(card,)e(status\))0 1413 y Fh(10)g Fi(Construct)35 b(a)g(sequence)g(k)m(eyw)m(ord)g(name)g (\(R)m(OOT)g(+)f(nnn\).)54 b(This)34 b(subroutine)f(app)s(ends)g(the)j (sequence)227 1526 y(n)m(um)m(b)s(er)29 b(to)i(the)g(ro)s(ot)g(string)f (to)h(create)h(a)f(k)m(eyw)m(ord)g(name)f(\(e.g.,)i('NAXIS')f(+)f(2)h (=)f('NAXIS2'\))382 1785 y Fe(FTKEYN\(keyroot,seq_no,)42 b(>)47 b(keyword,status\))0 2045 y Fh(11)f Fi(Construct)30 b(a)g(sequence)g(k)m(eyw)m(ord)h(name)f(\(n)f(+)h(R)m(OOT\).)g(This)f (subroutine)g(concatenates)j(the)f(sequence)227 2158 y(n)m(um)m(b)s(er)20 b(to)j(the)e(fron)m(t)h(of)g(the)f(ro)s(ot)h (string)g(to)g(create)h(a)f(k)m(eyw)m(ord)g(name)g(\(e.g.,)j(1)d(+)f ('CTYP')g(=)g('1CTYP'\))382 2417 y Fe(FTNKEY\(seq_no,keyroot,)42 b(>)47 b(keyword,status\))0 2677 y Fh(12)f Fi(Determine)35 b(the)f(datat)m(yp)s(e)g(of)g(a)g(k)m(eyw)m(ord)h(v)-5 b(alue)34 b(string.)50 b(This)33 b(subroutine)g(parses)g(the)h(k)m(eyw) m(ord)g(v)-5 b(alue)227 2790 y(string)31 b(\(usually)f(columns)g(11-30) j(of)d(the)h(header)f(record\))g(to)i(determine)e(its)h(datat)m(yp)s (e.)382 3049 y Fe(FTDTYP\(value,)44 b(>)j(dtype,status\))0 3309 y Fh(13)f Fi(Return)c(the)i(class)g(of)f(input)f(header)h(record.) 79 b(The)43 b(record)g(is)g(classi\014ed)g(in)m(to)h(one)g(of)f(the)g (follo)m(wing)227 3422 y(categories)36 b(\(the)e(class)f(v)-5 b(alues)34 b(are)f(de\014ned)f(in)h(\014tsio.h\).)49 b(Note)35 b(that)e(this)g(is)g(one)h(of)f(the)g(few)g(FITSIO)227 3535 y(routines)e(that)f(do)s(es)h(not)f(return)f(a)i(status)g(v)-5 b(alue.)334 3794 y Fe(Class)94 b(Value)619 b(Keywords)95 3907 y(TYP_STRUC_KEY)92 b(10)j(SIMPLE,)46 b(BITPIX,)g(NAXIS,)g(NAXISn,) g(EXTEND,)g(BLOCKED,)1002 4020 y(GROUPS,)g(PCOUNT,)g(GCOUNT,)g(END)1002 4133 y(XTENSION,)g(TFIELDS,)f(TTYPEn,)h(TBCOLn,)g(TFORMn,)g(THEAP,)1002 4246 y(and)h(the)g(first)f(4)i(COMMENT)e(keywords)f(in)i(the)g(primary) f(array)1002 4359 y(that)h(define)f(the)h(FITS)g(format.)95 4472 y(TYP_CMPRS_KEY)92 b(20)j(The)47 b(keywords)f(used)g(in)i(the)e (compressed)f(image)95 b(or)47 b(table)1002 4585 y(format,)f(including) f(ZIMAGE,)h(ZCMPTYPE,)f(ZNAMEn,)h(ZVALn,)1002 4698 y(ZTILEn,)g (ZBITPIX,)g(ZNAXISn,)f(ZSCALE,)h(ZZERO,)g(ZBLANK)95 4811 y(TYP_SCAL_KEY)140 b(30)95 b(BSCALE,)46 b(BZERO,)g(TSCALn,)g(TZEROn)95 4924 y(TYP_NULL_KEY)140 b(40)95 b(BLANK,)46 b(TNULLn)95 5036 y(TYP_DIM_KEY)188 b(50)95 b(TDIMn)95 5149 y(TYP_RANG_KEY)140 b(60)95 b(TLMINn,)46 b(TLMAXn,)g(TDMINn,)g(TDMAXn,)g(DATAMIN,)f (DATAMAX)95 5262 y(TYP_UNIT_KEY)140 b(70)95 b(BUNIT,)46 b(TUNITn)95 5375 y(TYP_DISP_KEY)140 b(80)95 b(TDISPn)95 5488 y(TYP_HDUID_KEY)d(90)j(EXTNAME,)46 b(EXTVER,)g(EXTLEVEL,)f (HDUNAME,)g(HDUVER,)h(HDULEVEL)95 5601 y(TYP_CKSUM_KEY)f(100)94 b(CHECKSUM,)46 b(DATASUM)95 5714 y(TYP_WCS_KEY)141 b(110)94 b(CTYPEn,)46 b(CUNITn,)g(CRVALn,)g(CRPIXn,)g(CROTAn,)f(CDELTn)p eop end %%Page: 72 78 TeXDict begin 72 77 bop 0 299 a Fi(72)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)1002 555 y Fe(CDj_is,)46 b(PVj_ms,)g(LONPOLEs,)f (LATPOLEs)1002 668 y(TCTYPn,)h(TCTYns,)g(TCUNIn,)g(TCUNns,)g(TCRVLn,)f (TCRVns,)h(TCRPXn,)1002 781 y(TCRPks,)g(TCDn_k,)g(TCn_ks,)g(TPVn_m,)g (TPn_ms,)f(TCDLTn,)h(TCROTn)1002 894 y(jCTYPn,)g(jCTYns,)g(jCUNIn,)g (jCUNns,)g(jCRVLn,)f(jCRVns,)h(iCRPXn,)1002 1007 y(iCRPns,)g(jiCDn,)94 b(jiCDns,)46 b(jPVn_m,)g(jPn_ms,)f(jCDLTn,)h(jCROTn)1002 1120 y(\(i,j,m,n)g(are)h(integers,)e(s)i(is)h(any)f(letter\))95 1233 y(TYP_REFSYS_KEY)d(120)j(EQUINOXs,)f(EPOCH,)g(MJD-OBSs,)f (RADECSYS,)g(RADESYSs)95 1346 y(TYP_COMM_KEY)140 b(130)47 b(COMMENT,)f(HISTORY,)f(\(blank)h(keyword\))95 1458 y(TYP_CONT_KEY)140 b(140)47 b(CONTINUE)95 1571 y(TYP_USER_KEY)140 b(150)47 b(all)g(other)g(keywords)430 1797 y(class)f(=)h(FTGKCL)f(\(char)h (*card\))0 2042 y Fh(14)f Fi(P)m(arse)f(the)g('TF)m(ORM')h(binary)e (table)i(column)e(format)h(string.)84 b(This)44 b(subroutine)g(parses)g (the)h(input)227 2155 y(TF)m(ORM)27 b(c)m(haracter)g(string)f(and)g (returns)f(the)h(in)m(teger)h(datat)m(yp)s(e)g(co)s(de,)h(the)e(rep)s (eat)g(coun)m(t)h(of)f(the)g(\014eld,)227 2268 y(and,)f(in)e(the)h (case)g(of)g(c)m(haracter)h(string)e(\014elds,)i(the)e(length)h(of)g (the)g(unit)f(string.)38 b(The)23 b(follo)m(wing)i(datat)m(yp)s(e)227 2381 y(co)s(des)e(are)h(returned)e(\(the)h(negativ)m(e)i(of)f(the)f(v) -5 b(alue)23 b(is)g(returned)f(if)h(the)g(column)g(con)m(tains)h(v)-5 b(ariable-length)227 2494 y(arra)m(ys\):)764 2739 y Fe(Datatype)761 b(DATACODE)46 b(value)764 2852 y(bit,)g(X)907 b(1)764 2965 y(byte,)46 b(B)811 b(11)764 3078 y(logical,)45 b(L)668 b(14)764 3191 y(ASCII)46 b(character,)f(A)286 b(16)764 3304 y(short)46 b(integer,)g(I)381 b(21)764 3417 y(integer,)45 b(J)668 b(41)764 3530 y(real,)46 b(E)811 b(42)764 3643 y(double)46 b(precision,)f(D)238 b(82)764 3756 y(complex)809 b(83)764 3868 y(double)46 b(complex)475 b(163)382 4094 y(FTBNFM\(tform,)44 b(>)j(datacode,repeat,width,stat)o(us\))0 4340 y Fh(15)f Fi(P)m(arse)38 b(the)f('TF)m(ORM')h(k)m(eyw)m(ord)g(v)-5 b(alue)37 b(that)h(de\014nes)e(the)h(column)g(format)h(in)e(an)h(ASCI)s (I)f(table.)62 b(This)227 4452 y(routine)31 b(parses)g(the)g(input)g (TF)m(ORM)g(c)m(haracter)i(string)e(and)f(returns)g(the)i(datat)m(yp)s (e)g(co)s(de,)f(the)h(width)227 4565 y(of)40 b(the)h(column,)h(and)e (\(if)g(it)g(is)h(a)f(\015oating)h(p)s(oin)m(t)f(column\))g(the)g(n)m (um)m(b)s(er)f(of)h(decimal)h(places)g(to)g(the)227 4678 y(righ)m(t)28 b(of)g(the)f(decimal)h(p)s(oin)m(t.)40 b(The)27 b(returned)f(datat)m(yp)s(e)i(co)s(des)f(are)h(the)g(same)f (as)h(for)f(the)g(binary)g(table,)227 4791 y(listed)41 b(ab)s(o)m(v)m(e,)j(with)c(the)g(follo)m(wing)i(additional)f(rules:)60 b(in)m(teger)42 b(columns)e(that)g(are)h(b)s(et)m(w)m(een)g(1)g(and)227 4904 y(4)36 b(c)m(haracters)i(wide)d(are)i(de\014ned)d(to)j(b)s(e)e (short)h(in)m(tegers)h(\(co)s(de)f(=)g(21\).)58 b(Wider)36 b(in)m(teger)h(columns)f(are)227 5017 y(de\014ned)j(to)i(b)s(e)e (regular)h(in)m(tegers)i(\(co)s(de)e(=)g(41\).)71 b(Similarly)-8 b(,)43 b(Fixed)d(decimal)h(p)s(oin)m(t)f(columns)g(\(with)227 5130 y(TF)m(ORM)30 b(=)g('Fw.d'\))g(are)g(de\014ned)f(to)h(b)s(e)g (single)g(precision)g(reals)g(\(co)s(de)h(=)e(42\))i(if)f(w)f(is)h(b)s (et)m(w)m(een)g(1)h(and)227 5243 y(7)i(c)m(haracters)h(wide,)f (inclusiv)m(e.)47 b(Wider)32 b('F')h(columns)f(will)h(return)e(a)i (double)f(precision)g(data)h(co)s(de)g(\(=)227 5356 y(82\).)54 b('Ew.d')34 b(format)g(columns)g(will)h(ha)m(v)m(e)g(dataco)s(de)g(=)f (42,)j(and)c('Dw.d')i(format)f(columns)g(will)h(ha)m(v)m(e)227 5469 y(dataco)s(de)d(=)e(82.)382 5714 y Fe(FTASFM\(tform,)44 b(>)j(datacode,width,decimals,st)o(atus)o(\))p eop end %%Page: 73 79 TeXDict begin 73 78 bop 0 299 a Fg(6.12.)73 b(GENERAL)30 b(UTILITY)g(SUBR)m(OUTINES)1979 b Fi(73)0 555 y Fh(16)46 b Fi(Calculate)32 b(the)f(starting)g(column)g(p)s(ositions)f(and)g (total)i(ASCI)s(I)d(table)j(width)d(based)i(on)f(the)h(input)e(arra)m (y)227 668 y(of)e(ASCI)s(I)e(table)i(TF)m(ORM)g(v)-5 b(alues.)40 b(The)26 b(SP)-8 b(A)m(CE)27 b(input)e(parameter)i (de\014nes)f(ho)m(w)h(man)m(y)f(blank)h(spaces)227 781 y(to)40 b(lea)m(v)m(e)i(b)s(et)m(w)m(een)e(eac)m(h)g(column)g(\(it)g (is)f(recommended)g(to)h(ha)m(v)m(e)h(one)e(space)h(b)s(et)m(w)m(een)g (columns)f(for)227 894 y(b)s(etter)31 b(h)m(uman)e(readabilit)m(y\).) 382 1153 y Fe(FTGABC\(tfields,tform,spa)o(ce,)41 b(>)48 b(rowlen,tbcol,status\))0 1413 y Fh(17)e Fi(P)m(arse)36 b(a)f(template)h(string)f(and)g(return)f(a)h(formatted)h(80-c)m (haracter)h(string)e(suitable)h(for)f(app)s(ending)e(to)227 1526 y(\(or)40 b(deleting)h(from\))e(a)h(FITS)f(header)h(\014le.)68 b(This)39 b(subroutine)f(is)i(useful)f(for)g(parsing)g(lines)h(from)f (an)227 1639 y(ASCI)s(I)34 b(template)j(\014le)f(and)e(reformatting)j (them)e(in)m(to)i(legal)g(FITS)d(header)i(records.)55 b(The)35 b(formatted)227 1752 y(string)c(ma)m(y)g(then)f(b)s(e)g (passed)g(to)i(the)e(FTPREC,)h(FTMCRD,)g(or)f(FTDKEY)h(subroutines)e (to)j(app)s(end)227 1865 y(or)f(mo)s(dify)e(a)i(FITS)f(header)g (record.)382 2124 y Fe(FTGTHD\(template,)43 b(>)48 b (card,hdtype,status\))0 2384 y Fi(The)23 b(input)h(TEMPLA)-8 b(TE)23 b(c)m(haracter)j(string)e(generally)h(should)e(con)m(tain)i(3)g (tok)m(ens:)38 b(\(1\))25 b(the)f(KEYNAME,)h(\(2\))0 2497 y(the)h(V)-10 b(ALUE,)26 b(and)f(\(3\))i(the)f(COMMENT)g(string.) 39 b(The)25 b(TEMPLA)-8 b(TE)26 b(string)g(m)m(ust)f(adhere)h(to)g(the) g(follo)m(wing)0 2610 y(format:)0 2869 y Fh(-)80 b Fi(The)24 b(KEYNAME)g(tok)m(en)h(m)m(ust)e(b)s(egin)h(in)f(columns)h(1-8)h(and)e (b)s(e)h(a)g(maxim)m(um)g(of)g(8)g(c)m(haracters)h(long.)39 b(If)24 b(the)227 2982 y(\014rst)32 b(8)h(c)m(haracters)h(of)e(the)h (template)h(line)e(are)h(blank)f(then)g(the)h(remainder)f(of)g(the)h (line)g(is)f(considered)227 3095 y(to)42 b(b)s(e)e(a)h(FITS)f(commen)m (t)h(\(with)g(a)g(blank)f(k)m(eyw)m(ord)h(name\).)72 b(A)41 b(legal)i(FITS)d(k)m(eyw)m(ord)h(name)f(ma)m(y)227 3208 y(only)35 b(con)m(tain)i(the)e(c)m(haracters)h(A-Z,)f(0-9,)j(and)c ('-')i(\(min)m(us)f(sign\))g(and)f(underscore.)54 b(This)34 b(subroutine)227 3321 y(will)42 b(automatically)i(con)m(v)m(ert)f(an)m (y)f(lo)m(w)m(ercase)i(c)m(haracters)e(to)h(upp)s(ercase)d(in)h(the)h (output)f(string.)73 b(If)227 3434 y(KEYNAME)33 b(=)f('COMMENT')h(or)g ('HISTOR)-8 b(Y')32 b(then)h(the)f(remainder)g(of)h(the)g(line)g(is)g (considered)f(to)227 3547 y(b)s(e)e(a)h(FITS)e(COMMENT)h(or)h(HISTOR)-8 b(Y)30 b(record,)g(resp)s(ectiv)m(ely)-8 b(.)0 3806 y Fh(-)80 b Fi(The)26 b(V)-10 b(ALUE)26 b(tok)m(en)h(m)m(ust)e(b)s(e)h (separated)g(from)f(the)i(KEYNAME)f(tok)m(en)h(b)m(y)f(one)g(or)g(more) g(spaces)g(and/or)227 3919 y(an)i('=')g(c)m(haracter.)41 b(The)27 b(datat)m(yp)s(e)i(of)f(the)g(V)-10 b(ALUE)27 b(tok)m(en)i(\(n)m(umeric,)g(logical,)i(or)d(c)m(haracter)h(string\))f (is)227 4032 y(automatically)35 b(determined)c(and)h(the)g(output)f (CARD)h(string)g(is)g(formatted)g(accordingly)-8 b(.)47 b(The)31 b(v)-5 b(alue)227 4145 y(tok)m(en)34 b(ma)m(y)f(b)s(e)f (forced)g(to)i(b)s(e)e(in)m(terpreted)g(as)h(a)g(string)g(\(e.g.)48 b(if)33 b(it)g(is)f(a)h(string)g(of)f(n)m(umeric)h(digits\))g(b)m(y)227 4258 y(enclosing)g(it)f(in)f(single)h(quotes.)45 b(If)31 b(the)h(v)-5 b(alue)32 b(tok)m(en)g(is)g(a)g(c)m(haracter)h(string)e (that)i(con)m(tains)f(1)g(or)g(more)227 4371 y(em)m(b)s(edded)39 b(blank)g(space)h(c)m(haracters)h(or)e(slash)h(\('/'\))h(c)m(haracters) g(then)e(the)g(en)m(tire)i(c)m(haracter)g(string)227 4484 y(m)m(ust)31 b(b)s(e)e(enclosed)i(in)f(single)h(quotes.)0 4743 y Fh(-)80 b Fi(The)28 b(COMMENT)g(tok)m(en)h(is)f(optional,)i(but) e(if)g(presen)m(t)g(m)m(ust)g(b)s(e)g(separated)g(from)g(the)h(V)-10 b(ALUE)28 b(tok)m(en)h(b)m(y)227 4856 y(a)i(blank)f(space)h(or)f(a)h ('/')g(c)m(haracter.)0 5116 y Fh(-)80 b Fi(One)32 b(exception)i(to)f (the)g(ab)s(o)m(v)m(e)h(rules)e(is)g(that)h(if)g(the)f(\014rst)g (non-blank)g(c)m(haracter)i(in)e(the)h(template)h(string)227 5229 y(is)h(a)g(min)m(us)f(sign)h(\('-'\))h(follo)m(w)m(ed)g(b)m(y)f(a) g(single)g(tok)m(en,)i(or)e(a)g(single)g(tok)m(en)h(follo)m(w)m(ed)g(b) m(y)f(an)f(equal)i(sign,)227 5341 y(then)29 b(it)g(is)g(in)m(terpreted) f(as)h(the)g(name)g(of)g(a)g(k)m(eyw)m(ord)g(whic)m(h)f(is)h(to)g(b)s (e)f(deleted)i(from)e(the)h(FITS)f(header.)0 5601 y Fh(-)80 b Fi(The)40 b(second)g(exception)h(is)f(that)h(if)f(the)g(template)h (string)f(starts)g(with)g(a)h(min)m(us)e(sign)h(and)f(is)h(follo)m(w)m (ed)227 5714 y(b)m(y)33 b(2)g(tok)m(ens)g(then)g(the)f(second)h(tok)m (en)h(is)e(in)m(terpreted)h(as)g(the)g(new)f(name)g(for)h(the)g(k)m (eyw)m(ord)g(sp)s(eci\014ed)p eop end %%Page: 74 80 TeXDict begin 74 79 bop 0 299 a Fi(74)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)227 555 y Fi(b)m(y)k(\014rst)e(tok)m(en.)52 b(In)33 b(this)g(case)i(the)e(old)h(k)m(eyw)m(ord)g(name)g(\(\014rst)f (tok)m(en\))i(is)e(returned)g(in)g(c)m(haracters)i(1-8)227 668 y(of)e(the)g(returned)e(CARD)i(string,)g(and)f(the)h(new)f(k)m(eyw) m(ord)h(name)g(\(the)g(second)f(tok)m(en\))i(is)f(returned)e(in)227 781 y(c)m(haracters)c(41-48)h(of)e(the)f(returned)g(CARD)g(string.)40 b(These)25 b(old)h(and)f(new)g(names)g(ma)m(y)h(then)f(b)s(e)g(passed) 227 894 y(to)31 b(the)g(FTMNAM)g(subroutine)f(whic)m(h)g(will)g(c)m (hange)i(the)e(k)m(eyw)m(ord)h(name.)0 1158 y(The)f(HDTYPE)g(output)g (parameter)h(indicates)g(ho)m(w)g(the)f(returned)g(CARD)g(string)g (should)g(b)s(e)g(in)m(terpreted:)382 1422 y Fe(hdtype)857 b(interpretation)382 1535 y(------)523 b(-------------------------)o (----)o(---)o(----)o(----)o(---)o(----)o(--)525 1648 y(-2)572 b(Modify)46 b(the)h(name)g(of)g(the)g(keyword)f(given)g(in)h (CARD\(1:8\))1193 1761 y(to)g(the)g(new)g(name)g(given)f(in)h (CARD\(41:48\))525 1986 y(-1)572 b(CARD\(1:8\))45 b(contains)h(the)h (name)g(of)g(a)g(keyword)f(to)h(be)g(deleted)1193 2099 y(from)g(the)g(FITS)f(header.)573 2325 y(0)572 b(append)46 b(the)h(CARD)g(string)f(to)h(the)g(FITS)g(header)f(if)h(the)1193 2438 y(keyword)f(does)h(not)g(already)e(exist,)h(otherwise)g(update) 1193 2551 y(the)h(value/comment)d(if)j(the)g(keyword)f(is)h(already)f (present)1193 2664 y(in)h(the)g(header.)573 2890 y(1)572 b(simply)46 b(append)g(this)h(keyword)f(to)h(the)g(FITS)g(header)f (\(CARD)1193 3003 y(is)h(either)f(a)i(HISTORY)e(or)h(COMMENT)f (keyword\).)573 3228 y(2)572 b(This)47 b(is)g(a)g(FITS)g(END)g(record;) f(it)h(should)f(not)h(be)g(written)1193 3341 y(to)g(the)g(FITS)g (header)f(because)g(FITSIO)g(automatically)1193 3454 y(appends)g(the)h(END)g(record)f(when)h(the)f(header)h(is)g(closed.)0 3718 y Fi(EXAMPLES:)30 b(The)g(follo)m(wing)i(lines)e(illustrate)i(v)-5 b(alid)31 b(input)e(template)j(strings:)286 3982 y Fe(INTVAL)46 b(7)i(This)f(is)g(an)g(integer)f(keyword)286 4095 y(RVAL)524 b(34.6)142 b(/)239 b(This)46 b(is)i(a)f(floating)f(point)g(keyword)286 4208 y(EVAL=-12.45E-03)92 b(This)46 b(is)i(a)f(floating)f(point)g (keyword)g(in)h(exponential)e(notation)286 4321 y(lval)i(F)g(This)g(is) g(a)h(boolean)e(keyword)859 4434 y(This)h(is)g(a)g(comment)f(keyword)g (with)h(a)g(blank)f(keyword)g(name)286 4547 y(SVAL1)h(=)g('Hello)f (world')142 b(/)95 b(this)47 b(is)g(a)g(string)f(keyword)286 4660 y(SVAL2)94 b('123.5')g(this)47 b(is)g(also)f(a)i(string)e(keyword) 286 4772 y(sval3)94 b(123+)h(/)g(this)47 b(is)g(also)f(a)i(string)e (keyword)g(with)g(the)h(value)g('123+)189 b(')286 4885 y(#)48 b(the)f(following)e(template)h(line)g(deletes)g(the)h(DATE)g (keyword)286 4998 y(-)h(DATE)286 5111 y(#)g(the)f(following)e(template) h(line)g(modifies)g(the)h(NAME)f(keyword)g(to)h(OBJECT)286 5224 y(-)h(NAME)e(OBJECT)0 5488 y Fh(18)g Fi(P)m(arse)35 b(the)g(input)f(string)h(con)m(taining)h(a)f(list)h(of)f(ro)m(ws)f(or)h (ro)m(w)g(ranges,)h(and)e(return)g(in)m(teger)i(arra)m(ys)f(con-)227 5601 y(taining)27 b(the)f(\014rst)f(and)g(last)i(ro)m(w)f(in)f(eac)m(h) i(range.)40 b(F)-8 b(or)26 b(example,)i(if)d(ro)m(wlist)i(=)e("3-5,)k (6,)e(8-9")h(then)d(it)i(will)227 5714 y(return)34 b(n)m(umranges)h(=)g (3,)h(rangemin)f(=)g(3,)i(6,)g(8)e(and)g(rangemax)g(=)g(5,)i(6,)g(9.)55 b(A)m(t)36 b(most,)h('maxranges')p eop end %%Page: 75 81 TeXDict begin 75 80 bop 0 299 a Fg(6.12.)73 b(GENERAL)30 b(UTILITY)g(SUBR)m(OUTINES)1979 b Fi(75)227 555 y(n)m(um)m(b)s(er)31 b(of)h(ranges)f(will)h(b)s(e)g(returned.)43 b('maxro)m(ws')32 b(is)g(the)g(maxim)m(um)g(n)m(um)m(b)s(er)e(of)i(ro)m(ws)g(in)f(the)h (table;)227 668 y(an)m(y)e(ro)m(ws)f(or)g(ranges)g(larger)h(than)f (this)g(will)g(b)s(e)g(ignored.)40 b(The)29 b(ro)m(ws)g(m)m(ust)g(b)s (e)f(sp)s(eci\014ed)h(in)f(increasing)227 781 y(order,)33 b(and)f(the)g(ranges)h(m)m(ust)f(not)g(o)m(v)m(erlap.)48 b(A)33 b(min)m(us)e(sign)i(ma)m(y)g(b)s(e)e(use)h(to)h(sp)s(ecify)f (all)h(the)g(ro)m(ws)f(to)227 894 y(the)h(upp)s(er)d(or)j(lo)m(w)m(er)h (b)s(ound,)d(so)i("50-")h(means)e(all)i(the)f(ro)m(ws)f(from)g(50)h(to) h(the)e(end)g(of)h(the)f(table,)j(and)227 1007 y("-")d(means)e(all)h (the)g(ro)m(ws)f(in)g(the)h(table,)g(from)f(1)h(-)g(maxro)m(ws.)191 1267 y Fe(FTRWRG\(rowlist,)44 b(maxrows,)h(maxranges,)g(>)525 1380 y(numranges,)g(rangemin,)g(rangemax,)h(status\))p eop end %%Page: 76 82 TeXDict begin 76 81 bop 0 299 a Fi(76)1319 b Fg(CHAPTER)29 b(6.)112 b(AD)m(V)-10 b(ANCED)32 b(INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)p eop end %%Page: 77 83 TeXDict begin 77 82 bop 0 1225 a Ff(Chapter)65 b(7)0 1687 y Fl(The)77 b(CFITSIO)f(Iterator)i(F)-19 b(unction)0 2180 y Fi(The)41 b(\014ts)p 325 2180 28 4 v 33 w(iterate)p 614 2180 V 34 w(data)i(function)e(in)h(CFITSIO)e(pro)m(vides)i(a)g (unique)e(metho)s(d)i(of)g(executing)h(an)e(arbitrary)0 2293 y(user-supplied)35 b(`w)m(ork')i(function)f(that)h(op)s(erates)g (on)g(ro)m(ws)f(of)h(data)g(in)f(FITS)g(tables)h(or)f(on)h(pixels)f(in) h(FITS)0 2406 y(images.)i(Rather)24 b(than)e(explicitly)j(reading)e (and)g(writing)g(the)g(FITS)g(images)h(or)f(columns)g(of)g(data,)i(one) f(instead)0 2518 y(calls)36 b(the)g(CFITSIO)d(iterator)k(routine,)g (passing)e(to)h(it)g(the)f(name)g(of)h(the)f(user's)g(w)m(ork)g (function)g(that)h(is)f(to)0 2631 y(b)s(e)30 b(executed)h(along)g(with) f(a)h(list)g(of)f(all)h(the)f(table)i(columns)e(or)g(image)h(arra)m(ys) g(that)g(are)f(to)h(b)s(e)f(passed)g(to)h(the)0 2744 y(w)m(ork)37 b(function.)61 b(The)37 b(CFITSIO)e(iterator)k(function)e (then)g(do)s(es)g(all)h(the)f(w)m(ork)g(of)h(allo)s(cating)h(memory)e (for)0 2857 y(the)28 b(arra)m(ys,)h(reading)f(the)g(input)e(data)j (from)e(the)h(FITS)f(\014le,)h(passing)g(them)g(to)g(the)g(w)m(ork)g (function,)g(and)f(then)0 2970 y(writing)36 b(an)m(y)h(output)f(data)h (bac)m(k)h(to)f(the)f(FITS)g(\014le)g(after)h(the)g(w)m(ork)g(function) f(exits.)59 b(Because)38 b(it)f(is)g(often)0 3083 y(more)g(e\016cien)m (t)i(to)f(pro)s(cess)f(only)g(a)h(subset)f(of)g(the)g(total)i(table)g (ro)m(ws)e(at)h(one)f(time,)j(the)e(iterator)g(function)0 3196 y(can)31 b(determine)f(the)h(optim)m(um)f(amoun)m(t)h(of)f(data)h (to)g(pass)f(in)g(eac)m(h)i(iteration)f(and)f(rep)s(eatedly)h(call)g (the)g(w)m(ork)0 3309 y(function)f(un)m(til)h(the)f(en)m(tire)i(table)f (b)s(een)e(pro)s(cessed.)0 3469 y(F)-8 b(or)37 b(man)m(y)f (applications)h(this)e(single)i(CFITSIO)d(iterator)k(function)d(can)h (e\013ectiv)m(ely)j(replace)e(all)g(the)f(other)0 3582 y(CFITSIO)g(routines)i(for)f(reading)h(or)f(writing)h(data)g(in)f(FITS) g(images)i(or)e(tables.)64 b(Using)37 b(the)h(iterator)h(has)0 3695 y(sev)m(eral)32 b(imp)s(ortan)m(t)e(adv)-5 b(an)m(tages)32 b(o)m(v)m(er)g(the)f(traditional)g(metho)s(d)f(of)h(reading)f(and)g (writing)g(FITS)g(data)h(\014les:)136 3961 y Fc(\017)46 b Fi(It)33 b(cleanly)h(separates)g(the)f(data)h(I/O)f(from)f(the)h (routine)g(that)h(op)s(erates)f(on)g(the)g(data.)49 b(This)32 b(leads)h(to)227 4074 y(a)e(more)g(mo)s(dular)e(and)h(`ob)5 b(ject)31 b(orien)m(ted')h(programming)e(st)m(yle.)136 4268 y Fc(\017)46 b Fi(It)27 b(simpli\014es)f(the)h(application)h (program)f(b)m(y)f(eliminating)i(the)f(need)g(to)g(allo)s(cate)i (memory)e(for)f(the)h(data)227 4381 y(arra)m(ys)e(and)f(eliminates)i (most)e(of)h(the)f(calls)i(to)f(the)g(CFITSIO)d(routines)j(that)g (explicitly)h(read)e(and)g(write)227 4494 y(the)31 b(data.)136 4689 y Fc(\017)46 b Fi(It)32 b(ensures)e(that)i(the)g(data)g(are)g(pro) s(cessed)f(as)h(e\016cien)m(tly)h(as)e(p)s(ossible.)44 b(This)31 b(is)g(esp)s(ecially)i(imp)s(ortan)m(t)227 4801 y(when)44 b(pro)s(cessing)g(tabular)h(data)h(since)f(the)g (iterator)h(function)e(will)h(calculate)i(the)e(most)g(e\016cien)m(t) 227 4914 y(n)m(um)m(b)s(er)36 b(of)i(ro)m(ws)g(in)f(the)h(table)g(to)g (b)s(e)f(passed)g(at)i(one)e(time)i(to)f(the)g(user's)e(w)m(ork)i (function)f(on)h(eac)m(h)227 5027 y(iteration.)136 5222 y Fc(\017)46 b Fi(Mak)m(es)39 b(it)e(p)s(ossible)g(for)g(larger)h(pro)5 b(jects)37 b(to)h(dev)m(elop)g(a)g(library)e(of)i(w)m(ork)f(functions)f (that)i(all)g(ha)m(v)m(e)h(a)227 5335 y(uniform)29 b(calling)j (sequence)f(and)f(are)h(all)g(indep)s(enden)m(t)e(of)i(the)f(details)i (of)e(the)h(FITS)e(\014le)i(format.)0 5601 y(There)f(are)h(basically)h (2)g(steps)e(in)h(using)f(the)h(CFITSIO)e(iterator)j(function.)42 b(The)30 b(\014rst)g(step)h(is)g(to)g(design)g(the)0 5714 y(w)m(ork)26 b(function)f(itself)h(whic)m(h)f(m)m(ust)h(ha)m(v)m (e)g(a)g(prescrib)s(ed)e(set)i(of)g(input)f(parameters.)39 b(One)25 b(of)h(these)g(parameters)1905 5942 y(77)p eop end %%Page: 78 84 TeXDict begin 78 83 bop 0 299 a Fi(78)1455 b Fg(CHAPTER)30 b(7.)112 b(THE)30 b(CFITSIO)e(ITERA)-8 b(TOR)30 b(FUNCTION)0 555 y Fi(is)f(a)g(structure)g(con)m(taining)i(p)s(oin)m(ters)d(to)i (the)f(arra)m(ys)h(of)f(data;)h(the)f(w)m(ork)h(function)e(can)i(p)s (erform)d(an)m(y)i(desired)0 668 y(op)s(erations)k(on)h(these)f(arra)m (ys)h(and)e(do)s(es)h(not)g(need)g(to)h(w)m(orry)f(ab)s(out)g(ho)m(w)g (the)h(input)e(data)i(w)m(ere)f(read)g(from)0 781 y(the)e(\014le)f(or)g (ho)m(w)h(the)f(output)g(data)h(get)h(written)e(bac)m(k)h(to)h(the)e (\014le.)0 941 y(The)24 b(second)h(step)g(is)f(to)i(design)e(the)h (driv)m(er)g(routine)f(that)i(op)s(ens)e(all)h(the)g(necessary)g(FITS)f (\014les)h(and)f(initializes)0 1054 y(the)41 b(input)g(parameters)g(to) h(the)g(iterator)g(function.)73 b(The)41 b(driv)m(er)g(program)g(calls) h(the)g(CFITSIO)e(iterator)0 1167 y(function)30 b(whic)m(h)g(then)g (reads)g(the)h(data)g(and)f(passes)g(it)h(to)g(the)g(user's)e(w)m(ork)i (function.)0 1327 y(F)-8 b(urther)41 b(details)i(on)f(using)f(the)h (iterator)h(function)f(can)g(b)s(e)f(found)f(in)i(the)g(companion)g (CFITSIO)e(User's)0 1440 y(Guide,)31 b(and)e(in)h(the)h(iter)p 874 1440 28 4 v 33 w(a.f,)g(iter)p 1197 1440 V 34 w(b.f)f(and)f(iter)p 1677 1440 V 34 w(c.f)h(example)h(programs.)p eop end %%Page: 79 85 TeXDict begin 79 84 bop 0 1225 a Ff(Chapter)65 b(8)0 1687 y Fl(Extended)77 b(File)g(Name)g(Syn)-6 b(tax)0 2216 y Fd(8.1)135 b(Ov)l(erview)0 2466 y Fi(CFITSIO)30 b(supp)s(orts)f(an)j(extended)f(syn)m(tax)h(when)f(sp)s(ecifying)g(the) h(name)f(of)h(the)g(data)g(\014le)f(to)h(b)s(e)f(op)s(ened)g(or)0 2579 y(created)g(that)g(includes)f(the)h(follo)m(wing)h(features:)136 2813 y Fc(\017)46 b Fi(CFITSIO)40 b(can)i(read)f(IRAF)h(format)g (images)g(whic)m(h)f(ha)m(v)m(e)i(header)e(\014le)h(names)f(that)h(end) f(with)g(the)227 2926 y('.imh')d(extension,)i(as)e(w)m(ell)g(as)g (reading)f(and)g(writing)g(FITS)g(\014les,)i(This)e(feature)h(is)f (implemen)m(ted)h(in)227 3039 y(CFITSIO)29 b(b)m(y)i(\014rst)e(con)m(v) m(erting)k(the)d(IRAF)h(image)h(in)m(to)f(a)g(temp)s(orary)f(FITS)g (format)h(\014le)f(in)g(memory)-8 b(,)227 3152 y(then)35 b(op)s(ening)f(the)h(FITS)f(\014le.)54 b(An)m(y)35 b(of)g(the)g(usual)f (CFITSIO)g(routines)g(then)h(ma)m(y)g(b)s(e)f(used)g(to)i(read)227 3265 y(the)31 b(image)g(header)f(or)h(data.)41 b(Similarly)-8 b(,)31 b(ra)m(w)f(binary)g(data)h(arra)m(ys)f(can)h(b)s(e)f(read)g(b)m (y)g(con)m(v)m(erting)i(them)227 3378 y(on)f(the)f(\015y)g(in)m(to)h (virtual)g(FITS)f(images.)136 3557 y Fc(\017)46 b Fi(FITS)37 b(\014les)g(on)g(the)g(In)m(ternet)h(can)f(b)s(e)g(read)g(\(and)g (sometimes)h(written\))f(using)g(the)g(FTP)-8 b(,)38 b(HTTP)-8 b(,)37 b(or)227 3670 y(R)m(OOT)30 b(proto)s(cols.)136 3849 y Fc(\017)46 b Fi(FITS)30 b(\014les)g(can)h(b)s(e)f(pip)s(ed)f(b)s (et)m(w)m(een)i(tasks)f(on)h(the)f(stdin)g(and)g(stdout)g(streams.)136 4028 y Fc(\017)46 b Fi(FITS)20 b(\014les)h(can)g(b)s(e)f(read)g(and)g (written)h(in)f(shared)g(memory)-8 b(.)38 b(This)20 b(can)h(p)s(oten)m (tially)h(ac)m(hiev)m(e)h(m)m(uc)m(h)e(b)s(etter)227 4141 y(data)26 b(I/O)e(p)s(erformance)g(compared)h(to)h(reading)f(and)f (writing)g(the)h(same)h(FITS)e(\014les)g(on)h(magnetic)h(disk.)136 4320 y Fc(\017)46 b Fi(Compressed)30 b(FITS)f(\014les)i(in)f(gzip)h(or) f(Unix)g(COMPRESS)f(format)h(can)h(b)s(e)f(directly)h(read.)136 4499 y Fc(\017)46 b Fi(Output)28 b(FITS)h(\014les)g(can)g(b)s(e)g (written)g(directly)h(in)e(compressed)h(gzip)h(format,)g(th)m(us)e(sa)m (ving)i(disk)f(space.)136 4678 y Fc(\017)46 b Fi(FITS)26 b(table)h(columns)f(can)h(b)s(e)f(created,)i(mo)s(di\014ed,)f(or)f (deleted)h('on-the-\015y')g(as)g(the)g(table)g(is)f(op)s(ened)g(b)m(y) 227 4791 y(CFITSIO.)32 b(This)h(creates)i(a)e(virtual)h(FITS)f(\014le)g (con)m(taining)i(the)f(mo)s(di\014cations)f(that)h(is)g(then)f(op)s (ened)227 4904 y(b)m(y)e(the)f(application)i(program.)136 5083 y Fc(\017)46 b Fi(T)-8 b(able)29 b(ro)m(ws)e(ma)m(y)i(b)s(e)e (selected,)j(or)e(\014ltered)g(out,)g(on)g(the)g(\015y)f(when)g(the)h (table)h(is)f(op)s(ened)f(b)m(y)g(CFITSIO,)227 5196 y(based)f(on)h(an)f (arbitrary)h(user-sp)s(eci\014ed)e(expression.)39 b(Only)26 b(ro)m(ws)h(for)f(whic)m(h)g(the)h(expression)f(ev)-5 b(aluates)227 5309 y(to)31 b('TR)m(UE')g(are)g(retained)g(in)f(the)g (cop)m(y)i(of)e(the)h(table)g(that)g(is)f(op)s(ened)g(b)m(y)g(the)h (application)g(program.)136 5488 y Fc(\017)46 b Fi(Histogram)28 b(images)g(ma)m(y)f(b)s(e)f(created)h(on)f(the)h(\015y)f(b)m(y)g (binning)g(the)g(v)-5 b(alues)27 b(in)f(table)i(columns,)f(resulting) 227 5601 y(in)36 b(a)g(virtual)h(N-dimensional)f(FITS)g(image.)59 b(The)35 b(application)i(program)f(then)g(only)g(sees)g(the)h(FITS)227 5714 y(image)32 b(\(in)e(the)h(primary)e(arra)m(y\))j(instead)e(of)h (the)f(original)i(FITS)d(table.)1905 5942 y(79)p eop end %%Page: 80 86 TeXDict begin 80 85 bop 0 299 a Fi(80)1618 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fi(The)43 b(latter)i(3)f(features)g(in)f(particular)h(add)f(v)m (ery)h(p)s(o)m(w)m(erful)f(data)h(pro)s(cessing)f(capabilities)j (directly)e(in)m(to)0 668 y(CFITSIO,)29 b(and)g(hence)h(in)m(to)h(ev)m (ery)f(task)h(that)f(uses)g(CFITSIO)e(to)j(read)f(or)g(write)g(FITS)f (\014les.)40 b(F)-8 b(or)31 b(example,)0 781 y(these)d(features)f (transform)f(a)i(v)m(ery)f(simple)g(program)g(that)h(just)f(copies)h (an)f(input)f(FITS)g(\014le)h(to)h(a)g(new)e(output)0 894 y(\014le)36 b(\(lik)m(e)h(the)f(`\014tscop)m(y')h(program)f(that)g (is)g(distributed)f(with)g(CFITSIO\))g(in)m(to)i(a)f(m)m(ultipurp)s (ose)f(FITS)g(\014le)0 1007 y(pro)s(cessing)24 b(to)s(ol.)40 b(By)25 b(app)s(ending)f(fairly)g(simple)h(quali\014ers)g(on)m(to)g (the)g(name)g(of)g(the)g(input)f(FITS)g(\014le,)i(the)f(user)0 1120 y(can)37 b(p)s(erform)f(quite)i(complex)g(table)g(editing)g(op)s (erations)f(\(e.g.,)k(create)e(new)d(columns,)j(or)e(\014lter)h(out)f (ro)m(ws)0 1233 y(in)g(a)g(table\))h(or)f(create)h(FITS)f(images)h(b)m (y)f(binning)e(or)i(histogramming)h(the)f(v)-5 b(alues)37 b(in)g(table)h(columns.)60 b(In)0 1346 y(addition,)33 b(these)g(functions)e(ha)m(v)m(e)j(b)s(een)d(co)s(ded)h(using)f(new)h (state-of-the)i(art)f(algorithms)g(that)g(are,)g(in)f(some)0 1458 y(cases,)g(10)f(-)f(100)i(times)f(faster)g(than)f(previous)g (widely)g(used)g(implemen)m(tations.)0 1619 y(Before)k(describing)f (the)h(complete)h(syn)m(tax)f(for)f(the)h(extended)f(FITS)g(\014le)g (names)g(in)g(the)h(next)g(section,)h(here)0 1732 y(are)c(a)g(few)f (examples)h(of)f(FITS)g(\014le)g(names)h(that)f(giv)m(e)i(a)f(quic)m(k) g(o)m(v)m(erview)h(of)f(the)f(allo)m(w)m(ed)i(syn)m(tax:)136 1960 y Fc(\017)46 b Fe('myfile.fits')p Fi(:)37 b(the)31 b(simplest)f(case)i(of)e(a)h(FITS)f(\014le)g(on)h(disk)e(in)i(the)f (curren)m(t)g(directory)-8 b(.)136 2137 y Fc(\017)46 b Fe('myfile.imh')p Fi(:)37 b(op)s(ens)28 b(an)h(IRAF)g(format)g(image) i(\014le)e(and)f(con)m(v)m(erts)i(it)g(on)f(the)g(\015y)f(in)m(to)i(a)f (temp)s(orary)227 2250 y(FITS)h(format)h(image)g(in)f(memory)h(whic)m (h)f(can)g(then)g(b)s(e)g(read)g(with)g(an)m(y)h(other)g(CFITSIO)e (routine.)136 2427 y Fc(\017)46 b Fe(rawfile.dat[i512,512])p Fi(:)35 b(op)s(ens)30 b(a)g(ra)m(w)h(binary)e(data)i(arra)m(y)g(\(a)g (512)g(x)f(512)i(short)e(in)m(teger)h(arra)m(y)g(in)227 2540 y(this)i(case\))i(and)d(con)m(v)m(erts)j(it)e(on)g(the)g(\015y)g (in)m(to)h(a)f(temp)s(orary)g(FITS)f(format)h(image)i(in)d(memory)h (whic)m(h)227 2652 y(can)e(then)f(b)s(e)g(read)g(with)g(an)m(y)h(other) f(CFITSIO)f(routine.)136 2830 y Fc(\017)46 b Fe(myfile.fits.gz)p Fi(:)d(if)33 b(this)g(is)g(the)g(name)g(of)h(a)f(new)g(output)g (\014le,)h(the)f('.gz')i(su\016x)d(will)h(cause)h(it)g(to)g(b)s(e)227 2942 y(compressed)c(in)g(gzip)h(format)g(when)e(it)i(is)g(written)f(to) h(disk.)136 3120 y Fc(\017)46 b Fe('myfile.fits.gz[events,)c(2]')p Fi(:)59 b(op)s(ens)40 b(and)f(uncompresses)g(the)i(gzipp)s(ed)e(\014le) i(m)m(y\014le.\014ts)f(then)227 3232 y(mo)m(v)m(es)34 b(to)f(the)f(extension)h(whic)m(h)f(has)f(the)i(k)m(eyw)m(ords)f (EXTNAME)g(=)g('EVENTS')g(and)g(EXTVER)f(=)227 3345 y(2.)136 3522 y Fc(\017)46 b Fe('-')p Fi(:)40 b(a)31 b(dash)f(\(min)m(us)g (sign\))h(signi\014es)f(that)h(the)g(input)f(\014le)g(is)h(to)g(b)s(e)f (read)g(from)g(the)h(stdin)f(\014le)g(stream,)227 3635 y(or)h(that)g(the)f(output)g(\014le)h(is)f(to)h(b)s(e)f(written)g(to)h (the)g(stdout)f(stream.)136 3812 y Fc(\017)46 b Fe ('ftp://legacy.gsfc.nasa.g)o(ov/t)o(est/)o(vel)o(a.fi)o(ts')p Fi(:)33 b(FITS)28 b(\014les)g(in)g(an)m(y)g(ftp)g(arc)m(hiv)m(e)i(site) f(on)f(the)227 3925 y(In)m(ternet)j(ma)m(y)g(b)s(e)f(directly)h(op)s (ened)e(with)h(read-only)h(access.)136 4102 y Fc(\017)46 b Fe('http://legacy.gsfc.nasa.)o(gov/)o(soft)o(war)o(e/te)o(st.f)o(its) o(')p Fi(:)d(an)m(y)34 b(v)-5 b(alid)35 b(URL)f(to)h(a)f(FITS)g(\014le) g(on)227 4215 y(the)d(W)-8 b(eb)31 b(ma)m(y)g(b)s(e)f(op)s(ened)f(with) h(read-only)h(access.)136 4392 y Fc(\017)46 b Fe ('root://legacy.gsfc.nasa.)o(gov/)o(test)o(/ve)o(la.f)o(its')o Fi(:)32 b(similar)24 b(to)g(ftp)f(access)i(except)g(that)f(it)g(pro-) 227 4505 y(vides)30 b(write)h(as)f(w)m(ell)h(as)g(read)f(access)h(to)g (the)f(\014les)h(across)f(the)h(net)m(w)m(ork.)41 b(This)29 b(uses)h(the)h(ro)s(ot)f(proto)s(col)227 4618 y(dev)m(elop)s(ed)h(at)g (CERN.)136 4795 y Fc(\017)46 b Fe('shmem://h2[events]')p Fi(:)35 b(op)s(ens)30 b(the)g(FITS)f(\014le)i(in)f(a)g(shared)f(memory) i(segmen)m(t)g(and)e(mo)m(v)m(es)j(to)f(the)227 4908 y(EVENTS)f(extension.)136 5085 y Fc(\017)46 b Fe('mem://')p Fi(:)52 b(creates)39 b(a)e(scratc)m(h)i(output)d(\014le)i(in)e(core)i (computer)f(memory)-8 b(.)62 b(The)37 b(resulting)g('\014le')h(will)227 5198 y(disapp)s(ear)25 b(when)f(the)i(program)f(exits,)i(so)f(this)f (is)h(mainly)f(useful)g(for)g(testing)i(purp)s(oses)c(when)i(one)g(do)s (es)227 5311 y(not)31 b(w)m(an)m(t)g(a)g(p)s(ermanen)m(t)f(cop)m(y)h (of)f(the)h(output)f(\014le.)136 5488 y Fc(\017)46 b Fe('myfile.fits[3;)e(Images\(10\)]')p Fi(:)49 b(op)s(ens)35 b(a)i(cop)m(y)g(of)f(the)g(image)i(con)m(tained)f(in)f(the)h(10th)f(ro) m(w)h(of)227 5601 y(the)26 b('Images')i(column)d(in)h(the)g(binary)g (table)g(in)g(the)g(3th)h(extension)f(of)g(the)h(FITS)e(\014le.)39 b(The)26 b(application)227 5714 y(just)k(sees)h(this)f(single)h(image)h (as)e(the)h(primary)e(arra)m(y)-8 b(.)p eop end %%Page: 81 87 TeXDict begin 81 86 bop 0 299 a Fg(8.1.)72 b(O)m(VER)-10 b(VIEW)3086 b Fi(81)136 555 y Fc(\017)46 b Fe('myfile.fits[1:512:2,)c (1:512:2]')p Fi(:)49 b(op)s(ens)35 b(a)h(section)h(of)e(the)h(input)f (image)i(ranging)f(from)f(the)227 668 y(1st)26 b(to)g(the)f(512th)h (pixel)g(in)e(X)i(and)e(Y,)i(and)e(selects)j(ev)m(ery)e(second)h(pixel) f(in)g(b)s(oth)f(dimensions,)i(resulting)227 781 y(in)k(a)h(256)h(x)e (256)i(pixel)e(image)i(in)e(this)g(case.)136 981 y Fc(\017)46 b Fe('myfile.fits[EVENTS][col)41 b(Rad)47 b(=)h(sqrt\(X**2)d(+)j (Y**2\)]')p Fi(:)38 b(creates)30 b(and)f(op)s(ens)f(a)h(temp)s(orary) 227 1094 y(\014le)f(on)f(the)g(\015y)g(\(in)g(memory)g(or)g(on)h (disk\))f(that)g(is)h(iden)m(tical)h(to)f(m)m(y\014le.\014ts)f(except)h (that)g(it)g(will)g(con)m(tain)227 1207 y(a)41 b(new)f(column)g(in)h (the)f(EVENTS)g(extension)h(called)h('Rad')f(whose)f(v)-5 b(alue)41 b(is)f(computed)h(using)f(the)227 1320 y(indicated)31 b(expression)f(whic)m(h)g(is)h(a)g(function)f(of)g(the)h(v)-5 b(alues)30 b(in)h(the)f(X)h(and)e(Y)i(columns.)136 1520 y Fc(\017)46 b Fe('myfile.fits[EVENTS][PHA)41 b(>)48 b(5]')p Fi(:)37 b(creates)27 b(and)e(op)s(ens)g(a)h(temp)s(orary)f (FITS)g(\014les)g(that)h(is)g(iden)m(ti-)227 1633 y(cal)k(to)g('m)m (y\014le.\014ts')f(except)h(that)f(the)g(EVENTS)f(table)i(will)f(only)g (con)m(tain)h(the)f(ro)m(ws)g(that)h(ha)m(v)m(e)g(v)-5 b(alues)227 1746 y(of)28 b(the)g(PHA)f(column)g(greater)i(than)e(5.)40 b(In)27 b(general,)i(an)m(y)f(arbitrary)f(b)s(o)s(olean)h(expression)f (using)g(a)h(C)f(or)227 1859 y(F)-8 b(ortran-lik)m(e)31 b(syn)m(tax,)e(whic)m(h)f(ma)m(y)h(com)m(bine)g(AND)g(and)f(OR)f(op)s (erators,)i(ma)m(y)g(b)s(e)f(used)f(to)i(select)h(ro)m(ws)227 1972 y(from)g(a)h(table.)136 2172 y Fc(\017)46 b Fe ('myfile.fits[EVENTS][bin)41 b(\(X,Y\)=1,2048,4]')p Fi(:)46 b(creates)37 b(a)e(temp)s(orary)g(FITS)f(primary)g(arra)m(y)227 2285 y(image)c(whic)m(h)f(is)g(computed)f(on)h(the)g(\015y)f(b)m(y)g (binning)g(\(i.e,)j(computing)d(the)h(2-dimensional)h(histogram\))227 2398 y(of)k(the)f(v)-5 b(alues)34 b(in)f(the)h(X)g(and)e(Y)i(columns)f (of)h(the)f(EVENTS)g(extension.)50 b(In)33 b(this)g(case)i(the)e(X)h (and)f(Y)227 2511 y(co)s(ordinates)h(range)g(from)f(1)h(to)g(2048)h (and)e(the)h(image)g(pixel)g(size)g(is)g(4)f(units)g(in)g(b)s(oth)g (dimensions,)h(so)227 2624 y(the)d(resulting)f(image)i(is)e(512)i(x)e (512)i(pixels)f(in)f(size.)136 2824 y Fc(\017)46 b Fi(The)31 b(\014nal)g(example)i(com)m(bines)f(man)m(y)f(of)h(these)g(feature)g (in)m(to)g(one)g(complex)g(expression)f(\(it)i(is)e(brok)m(en)227 2937 y(in)m(to)h(sev)m(eral)f(lines)g(for)f(clarit)m(y\):)323 3206 y Fe('ftp://legacy.gsfc.nasa)o(.gov)o(/dat)o(a/s)o(ampl)o(e.fi)o (ts.)o(gz[E)o(VENT)o(S])370 3319 y([col)47 b(phacorr)f(=)h(pha)g(*)h (1.1)f(-)g(0.3][phacorr)e(>=)i(5.0)g(&&)g(phacorr)f(<=)h(14.0])370 3432 y([bin)g(\(X,Y\)=32]')227 3701 y Fi(In)37 b(this)h(case,)j (CFITSIO)36 b(\(1\))j(copies)g(and)e(uncompresses)g(the)h(FITS)f (\014le)h(from)f(the)h(ftp)f(site)i(on)f(the)227 3814 y(legacy)g(mac)m(hine,)h(\(2\))e(mo)m(v)m(es)g(to)g(the)g('EVENTS')f (extension,)i(\(3\))f(calculates)i(a)d(new)g(column)g(called)227 3927 y('phacorr',)30 b(\(4\))f(selects)h(the)f(ro)m(ws)g(in)f(the)h (table)h(that)f(ha)m(v)m(e)h(phacorr)e(in)g(the)h(range)g(5)g(to)h(14,) g(and)e(\014nally)227 4040 y(\(5\))35 b(bins)d(the)h(remaining)g(ro)m (ws)g(on)h(the)f(X)g(and)g(Y)g(column)g(co)s(ordinates,)i(using)d(a)i (pixel)f(size)h(=)f(32)h(to)227 4153 y(create)d(a)f(2D)g(image.)42 b(All)30 b(this)f(pro)s(cessing)g(is)h(completely)h(transparen)m(t)e (to)i(the)e(application)i(program,)227 4266 y(whic)m(h)f(simply)g(sees) h(the)g(\014nal)f(2-D)h(image)h(in)e(the)g(primary)g(arra)m(y)h(of)f (the)h(op)s(ened)f(\014le.)0 4538 y(The)c(full)h(extended)g(CFITSIO)e (FITS)h(\014le)h(name)g(can)g(con)m(tain)h(sev)m(eral)g(di\013eren)m(t) g(comp)s(onen)m(ts)f(dep)s(ending)e(on)0 4651 y(the)31 b(con)m(text.)42 b(These)30 b(comp)s(onen)m(ts)h(are)g(describ)s(ed)e (in)h(the)g(follo)m(wing)i(sections:)0 4924 y Fe(When)47 b(creating)e(a)j(new)f(file:)143 5036 y(filetype://BaseFilename\(t)o (empl)o(ate)o(Name)o(\))0 5262 y(When)g(opening)e(an)j(existing)d (primary)h(array)g(or)i(image)e(HDU:)143 5375 y (filetype://BaseFilename\(o)o(utNa)o(me\))o([HDU)o(loca)o(tio)o(n][I)o (mage)o(Sec)o(tion)o(])0 5601 y(When)h(opening)e(an)j(existing)d(table) i(HDU:)143 5714 y(filetype://BaseFilename\(o)o(utNa)o(me\))o([HDU)o (loca)o(tio)o(n][c)o(olFi)o(lte)o(r][r)o(owFi)o(lte)o(r][b)o(inSp)o (ec])p eop end %%Page: 82 88 TeXDict begin 82 87 bop 0 299 a Fi(82)1618 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fi(The)41 b(\014let)m(yp)s(e,)k(BaseFilename,)i(outName,)e(HDUlo) s(cation,)i(and)41 b(ImageSection)i(comp)s(onen)m(ts,)i(if)d(presen)m (t,)0 668 y(m)m(ust)30 b(b)s(e)g(giv)m(en)i(in)e(that)h(order,)g(but)f (the)g(colFilter,)j(ro)m(wFilter,)g(and)c(binSp)s(ec)h(sp)s(eci\014ers) f(ma)m(y)j(follo)m(w)f(in)g(an)m(y)0 781 y(order.)39 b(Regardless)29 b(of)g(the)f(order,)g(ho)m(w)m(ev)m(er,)i(the)f (colFilter)h(sp)s(eci\014er,)e(if)g(presen)m(t,)h(will)g(b)s(e)e(pro)s (cessed)h(\014rst)f(b)m(y)0 894 y(CFITSIO,)i(follo)m(w)m(ed)j(b)m(y)e (the)h(ro)m(wFilter)h(sp)s(eci\014er,)e(and)f(\014nally)i(b)m(y)f(the)g (binSp)s(ec)f(sp)s(eci\014er.)0 1253 y Fd(8.2)135 b(Filet)l(yp)t(e)0 1508 y Fi(The)37 b(t)m(yp)s(e)g(of)g(\014le)g(determines)g(the)g (medium)f(on)h(whic)m(h)g(the)g(\014le)g(is)h(lo)s(cated)g(\(e.g.,)i (disk)d(or)g(net)m(w)m(ork\))h(and,)0 1621 y(hence,)f(whic)m(h)e(in)m (ternal)h(device)g(driv)m(er)f(is)g(used)f(b)m(y)h(CFITSIO)f(to)i(read) f(and/or)g(write)g(the)g(\014le.)56 b(Curren)m(tly)0 1734 y(supp)s(orted)29 b(t)m(yp)s(es)h(are)382 2015 y Fe(file://)93 b(-)48 b(file)e(on)i(local)e(magnetic)g(disk)g (\(default\))382 2128 y(ftp://)141 b(-)48 b(a)f(readonly)f(file)g (accessed)g(with)h(the)g(anonymous)e(FTP)i(protocol.)907 2241 y(It)g(also)g(supports)93 b(ftp://username:password@)o(host)o(nam) o(e/..)o(.)907 2354 y(for)47 b(accessing)e(password-protected)e(ftp)k (sites.)382 2467 y(http://)93 b(-)48 b(a)f(readonly)f(file)g(accessed)g (with)h(the)g(HTTP)f(protocol.)93 b(It)907 2579 y(supports)45 b(username:password)e(just)k(like)g(the)g(ftp)g(driver.)907 2692 y(Proxy)f(HTTP)h(servers)f(are)h(supported)e(using)h(the)h (http_proxy)907 2805 y(environment)e(variable)g(\(see)i(following)e (note\).)286 2918 y(stream://)93 b(-)48 b(special)e(driver)g(to)h(read) g(an)g(input)f(FITS)h(file)f(from)h(the)g(stdin)907 3031 y(stream,)f(and/or)g(write)g(an)h(output)f(FITS)h(file)g(to)g(the)g (stdout)143 3144 y(stream.)94 b(This)46 b(driver)g(is)i(fragile)d(and)i (has)g(limited)143 3257 y(functionality)d(\(see)j(the)g(following)e (note\).)286 3370 y(gsiftp://)93 b(-)48 b(access)e(files)g(on)h(a)h (computational)c(grid)j(using)f(the)h(gridftp)907 3483 y(protocol)e(in)j(the)e(Globus)h(toolkit)e(\(see)i(following)e(note\).) 382 3596 y(root://)93 b(-)48 b(uses)e(the)h(CERN)g(root)g(protocol)e (for)i(writing)f(as)h(well)g(as)907 3709 y(reading)f(files)g(over)h (the)g(network.)382 3821 y(shmem://)e(-)j(opens)e(or)h(creates)f(a)i (file)e(which)h(persists)e(in)i(the)g(computer's)907 3934 y(shared)f(memory.)382 4047 y(mem://)141 b(-)48 b(opens)e(a)i(temporary)d(file)i(in)g(core)f(memory.)94 b(The)47 b(file)907 4160 y(disappears)e(when)h(the)h(program)f(exits)h (so)g(this)f(is)i(mainly)907 4273 y(useful)e(for)h(test)f(purposes)g (when)h(a)g(permanent)e(output)h(file)907 4386 y(is)h(not)g(desired.)0 4667 y Fi(If)35 b(the)h(\014let)m(yp)s(e)g(is)f(not)h(sp)s(eci\014ed,)h (then)e(t)m(yp)s(e)h(\014le://)h(is)e(assumed.)56 b(The)35 b(double)g(slashes)h('//')h(are)f(optional)0 4780 y(and)30 b(ma)m(y)h(b)s(e)e(omitted)j(in)e(most)h(cases.)0 5096 y Fb(8.2.1)112 b(Notes)37 b(ab)s(out)i(HTTP)d(pro)m(xy)i(serv)m(ers)0 5320 y Fi(A)32 b(pro)m(xy)g(HTTP)f(serv)m(er)h(ma)m(y)h(b)s(e)e(used)g (b)m(y)h(de\014ning)f(the)h(address)f(\(URL\))i(and)e(p)s(ort)g(n)m(um) m(b)s(er)g(of)h(the)g(pro)m(xy)0 5433 y(serv)m(er)f(with)f(the)g(h)m (ttp)p 801 5433 28 4 v 33 w(pro)m(xy)g(en)m(vironmen)m(t)h(v)-5 b(ariable.)42 b(F)-8 b(or)31 b(example)191 5714 y Fe(setenv)46 b(http_proxy)f(http://heasarc.gsfc.nasa)o(.gov)o(:312)o(8)p eop end %%Page: 83 89 TeXDict begin 83 88 bop 0 299 a Fg(8.2.)72 b(FILETYPE)3128 b Fi(83)0 555 y(will)38 b(cause)g(CFITSIO)f(to)h(use)g(p)s(ort)f(3128)i (on)f(the)g(heasarc)g(pro)m(xy)g(serv)m(er)g(whenev)m(er)g(reading)g(a) g(FITS)f(\014le)0 668 y(with)30 b(HTTP)-8 b(.)0 987 y Fb(8.2.2)112 b(Notes)37 b(ab)s(out)i(the)e(stream)h(\014let)m(yp)s(e)g (driv)m(er)0 1212 y Fi(The)e(stream)h(driv)m(er)f(can)h(b)s(e)f(used)g (to)h(e\016cien)m(tly)i(read)d(a)h(FITS)f(\014le)h(from)f(the)h(stdin)f (\014le)g(stream)h(or)g(write)0 1324 y(a)44 b(FITS)e(to)i(the)g(stdout) f(\014le)g(stream.)80 b(Ho)m(w)m(ev)m(er,)49 b(b)s(ecause)43 b(these)h(input)e(and)h(output)g(streams)g(m)m(ust)h(b)s(e)0 1437 y(accessed)30 b(sequen)m(tially)-8 b(,)31 b(the)e(FITS)f(\014le)g (reading)h(or)f(writing)h(application)h(m)m(ust)e(also)i(read)e(and)g (write)h(the)g(\014le)0 1550 y(sequen)m(tially)-8 b(,)33 b(at)e(least)g(within)f(the)h(tolerances)h(describ)s(ed)d(b)s(elo)m(w.) 0 1710 y(CFITSIO)34 b(supp)s(orts)f(2)j(di\013eren)m(t)f(metho)s(ds)g (for)g(accessing)i(FITS)d(\014les)h(on)h(the)f(stdin)g(and)f(stdout)h (streams.)0 1823 y(The)c(original)i(metho)s(d,)f(whic)m(h)f(is)h(in)m (v)m(ok)m(ed)h(b)m(y)f(sp)s(ecifying)f(a)h(dash)f(c)m(haracter,)j("-",) g(as)d(the)h(name)g(of)g(the)g(\014le)0 1936 y(when)g(op)s(ening)g(or)h (creating)h(it,)g(w)m(orks)e(b)m(y)h(storing)g(a)g(complete)h(cop)m(y)g (of)f(the)g(en)m(tire)g(FITS)f(\014le)h(in)f(memory)-8 b(.)0 2049 y(In)35 b(this)g(case,)k(when)34 b(reading)i(from)f(stdin,)i (CFITSIO)d(will)i(cop)m(y)h(the)e(en)m(tire)i(stream)f(in)m(to)h (memory)e(b)s(efore)0 2162 y(doing)c(an)m(y)h(pro)s(cessing)f(of)h(the) f(\014le.)44 b(Similarly)-8 b(,)32 b(when)f(writing)g(to)h(stdout,)g (CFITSIO)d(will)j(create)h(a)f(cop)m(y)g(of)0 2275 y(the)h(en)m(tire)g (FITS)f(\014le)g(in)h(memory)-8 b(,)33 b(b)s(efore)f(\014nally)h (\015ushing)e(it)i(out)f(to)i(the)e(stdout)h(stream)g(when)e(the)i (FITS)0 2388 y(\014le)g(is)g(closed.)49 b(Bu\013ering)33 b(the)g(en)m(tire)h(FITS)e(\014le)h(in)g(this)f(w)m(a)m(y)i(allo)m(ws)g (the)f(application)i(to)e(randomly)g(access)0 2501 y(an)m(y)h(part)f (of)h(the)f(FITS)g(\014le,)i(in)e(an)m(y)h(order,)f(but)g(it)h(also)h (requires)e(that)h(the)f(user)g(ha)m(v)m(e)i(su\016cien)m(t)f(a)m(v)-5 b(ailable)0 2614 y(memory)30 b(\(or)g(virtual)g(memory\))g(to)h(store)f (the)g(en)m(tire)h(\014le,)f(whic)m(h)f(ma)m(y)i(not)f(b)s(e)f(p)s (ossible)g(in)h(the)g(case)h(of)f(v)m(ery)0 2727 y(large)h(\014les.)0 2887 y(The)e(new)m(er)g(stream)h(\014let)m(yp)s(e)g(pro)m(vides)f(a)h (more)f(memory-e\016cien)m(t)i(metho)s(d)e(of)h(accessing)h(FITS)d (\014les)h(on)h(the)0 3000 y(stdin)37 b(or)h(stdout)g(streams.)64 b(Instead)38 b(of)g(storing)g(a)g(cop)m(y)h(of)f(the)g(en)m(tire)h (FITS)e(\014le)h(in)g(memory)-8 b(,)40 b(CFITSIO)0 3113 y(only)32 b(uses)g(a)g(set)h(of)f(in)m(ternal)h(bu\013er)e(whic)m(h)h (b)m(y)g(default)g(can)g(store)h(40)g(FITS)e(blo)s(c)m(ks,)i(or)g(ab)s (out)e(100K)i(b)m(ytes)0 3225 y(of)f(the)f(FITS)g(\014le.)43 b(The)31 b(application)i(program)e(m)m(ust)g(pro)s(cess)g(the)h(FITS)e (\014le)i(sequen)m(tially)h(from)e(b)s(eginning)0 3338 y(to)h(end,)e(within)g(this)h(100K)h(bu\013er.)41 b(Generally)32 b(sp)s(eaking)f(the)g(application)h(program)f(m)m(ust)f(conform)h(to)h (the)0 3451 y(follo)m(wing)g(restrictions:)136 3735 y Fc(\017)46 b Fi(The)36 b(program)f(m)m(ust)h(\014nish)e(reading)i(or)g (writing)f(the)h(header)g(k)m(eyw)m(ords)g(b)s(efore)f(reading)h(or)g (writing)227 3848 y(an)m(y)31 b(data)g(in)f(the)h(HDU.)136 4060 y Fc(\017)46 b Fi(The)24 b(HDU)h(can)f(con)m(tain)i(at)e(most)h (ab)s(out)f(1400)h(header)f(k)m(eyw)m(ords.)39 b(This)24 b(is)g(the)g(maxim)m(um)g(that)h(can)f(\014t)227 4172 y(in)g(the)g(nominal)h(40)g(FITS)e(blo)s(c)m(k)i(bu\013er.)37 b(In)24 b(principle,)h(this)f(limit)h(could)f(b)s(e)g(increased)g(b)m (y)g(recompiling)227 4285 y(CFITSIO)29 b(with)h(a)h(larger)g(bu\013er)e (limit,)j(whic)m(h)e(is)g(set)h(b)m(y)f(the)h(NIOBUF)g(parameter)g(in)f (\014tsio2.h.)136 4497 y Fc(\017)46 b Fi(The)32 b(program)g(m)m(ust)f (read)h(or)g(write)h(the)f(data)g(in)g(a)g(sequen)m(tial)i(manner)d (from)h(the)g(b)s(eginning)f(to)i(the)227 4610 y(end)26 b(of)g(the)h(HDU.)g(Note)h(that)f(CFITSIO's)e(in)m(ternal)i(100K)g (bu\013er)e(allo)m(ws)j(a)e(little)j(latitude)e(in)f(meeting)227 4723 y(this)31 b(requiremen)m(t.)136 4934 y Fc(\017)46 b Fi(The)30 b(program)g(cannot)h(mo)m(v)m(e)h(bac)m(k)f(to)g(a)g (previous)f(HDU)h(in)f(the)h(FITS)e(\014le.)136 5146 y Fc(\017)46 b Fi(Reading)c(or)f(writing)f(of)h(v)-5 b(ariable)42 b(length)f(arra)m(y)h(columns)e(in)h(binary)f(tables)i(is) f(not)g(supp)s(orted)e(on)227 5259 y(streams,)29 b(b)s(ecause)f(this)g (requires)g(mo)m(ving)g(bac)m(k)h(and)f(forth)f(b)s(et)m(w)m(een)i(the) f(\014xed-length)g(p)s(ortion)g(of)g(the)227 5372 y(binary)i(table)h (and)f(the)g(follo)m(wing)i(heap)e(area)i(where)e(the)g(arra)m(ys)h (are)g(actually)h(stored.)136 5583 y Fc(\017)46 b Fi(Reading)25 b(or)g(writing)f(of)h(tile-compressed)h(images)g(is)e(not)h(supp)s (orted)e(on)h(streams,)i(b)s(ecause)f(the)g(images)227 5696 y(are)31 b(in)m(ternally)g(stored)g(using)f(v)-5 b(ariable)31 b(length)g(arra)m(ys.)p eop end %%Page: 84 90 TeXDict begin 84 89 bop 0 299 a Fi(84)1618 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fb(8.2.3)112 b(Notes)37 b(ab)s(out)i(the)e(gsiftp)h(\014let)m(yp) s(e)0 774 y Fi(DEPENDENCIES:)c(Globus)h(to)s(olkit)h(\(2.4.3)g(or)f (higher\))f(\(GT\))h(should)f(b)s(e)g(installed.)53 b(There)34 b(are)h(t)m(w)m(o)h(dif-)0 887 y(feren)m(t)31 b(w)m(a)m(ys)g(to)g (install)g(GT:)0 1047 y(1\))43 b(goto)h(the)f(globus)f(to)s(olkit)i(w)m (eb)e(page)i(www.globus.org)e(and)g(follo)m(w)h(the)g(do)m(wnload)g (and)e(compilation)0 1160 y(instructions;)0 1320 y(2\))j(goto)i(the)d (Virtual)i(Data)g(T)-8 b(o)s(olkit)45 b(w)m(eb)e(page)i(h)m (ttp://vdt.cs.wisc.edu/)g(and)e(follo)m(w)i(the)f(instructions)0 1433 y(\(STR)m(ONGL)-8 b(Y)31 b(SUGGESTED\);)0 1593 y(Once)23 b(a)h(globus)f(clien)m(t)h(has)f(b)s(een)g(installed)h(in)e(y)m(our)i (system)f(with)g(a)g(sp)s(eci\014c)g(\015a)m(v)m(our)h(it)f(is)g(p)s (ossible)g(to)h(compile)0 1706 y(and)30 b(install)h(the)g(CFITSIO)d (libraries.)41 b(Sp)s(eci\014c)30 b(con\014guration)h(\015ags)f(m)m (ust)h(b)s(e)e(used:)0 1866 y(1\))21 b({with-gsiftp[[=P)-8 b(A)g(TH]])22 b(Enable)f(Globus)f(T)-8 b(o)s(olkit)21 b(gsiftp)g(proto)s(col)g(supp)s(ort)d(P)-8 b(A)g(TH=GLOBUS)p 3532 1866 28 4 v 33 w(LOCA)g(TION)0 1979 y(i.e.)42 b(the)30 b(lo)s(cation)i(of)f(y)m(our)f(globus)g(installation)0 2139 y(2\))h({with-gsiftp-\015a)m(v)m(our[[=P)-8 b(A)g(TH])33 b(de\014nes)d(the)g(sp)s(eci\014c)g(Globus)h(\015a)m(v)m(our)f(ex.)41 b(gcc32)0 2300 y(Both)31 b(the)g(\015ags)f(m)m(ust)g(b)s(e)g(used)g (and)f(it)i(is)g(mandatory)f(to)h(set)g(b)s(oth)f(the)g(P)-8 b(A)g(TH)31 b(and)f(the)h(\015a)m(v)m(our.)0 2460 y(USA)m(GE:)g(T)-8 b(o)31 b(access)h(\014les)e(on)g(a)h(gridftp)f(serv)m(er)g(it)h(is)g (necessary)f(to)i(use)e(a)g(gsiftp)h(pre\014x:)0 2620 y(example:)41 b(gsiftp://remote)p 1003 2620 V 35 w(serv)m(er)p 1271 2620 V 34 w(fqhn/directory/\014lename)0 2780 y(The)f(gridftp)g (driv)m(er)g(uses)g(a)g(lo)s(cal)i(bu\013er)d(on)i(a)f(temp)s(orary)g (\014le)h(the)f(\014le)h(is)f(lo)s(cated)i(in)e(the)g(/tmp)h(direc-)0 2893 y(tory)-8 b(.)73 b(If)40 b(y)m(ou)h(ha)m(v)m(e)h(sp)s(ecial)g(p)s (ermissions)d(on)i(/tmp)g(or)g(y)m(ou)g(do)f(not)i(ha)m(v)m(e)g(a)f (/tmp)g(directory)-8 b(,)44 b(it)e(is)e(p)s(os-)0 3006 y(sible)d(to)h(force)g(another)g(lo)s(cation)g(setting)h(the)e(GSIFTP)p 2068 3006 V 32 w(TMPFILE)g(en)m(vironmen)m(t)h(v)-5 b(ariable)38 b(\(ex.)62 b(exp)s(ort)0 3119 y(GSIFTP)p 347 3119 V 32 w(TMPFILE=/y)m(our/lo)s(cation/y)m(ourtmp\014le\).)0 3279 y(Grid)34 b(FTP)g(supp)s(orts)f(m)m(ulti)h(c)m(hannel)h(transfer.) 52 b(By)35 b(default)f(a)h(single)g(c)m(hannel)g(transmission)f(is)g(a) m(v)-5 b(ailable.)0 3392 y(Ho)m(w)m(ev)m(er,)34 b(it)d(is)h(p)s (ossible)e(to)i(mo)s(dify)e(this)i(b)s(eha)m(vior)f(setting)h(the)f (GSIFTP)p 2691 3392 V 33 w(STREAMS)f(en)m(vironmen)m(t)h(v)-5 b(ari-)0 3505 y(able)31 b(\(ex.)41 b(exp)s(ort)30 b(GSIFTP)p 1016 3505 V 33 w(STREAMS=8\).)0 3790 y Fb(8.2.4)112 b(Notes)37 b(ab)s(out)i(the)e(ro)s(ot)g(\014let)m(yp)s(e)0 4009 y Fi(The)20 b(original)j(ro)s(otd)d(serv)m(er)h(can)h(b)s(e)e(obtained) h(from:)36 b Fe(ftp://root.cern.ch/root)o(/roo)o(td.t)o(ar.)o(gz)15 b Fi(but,)22 b(for)0 4122 y(it)33 b(to)h(w)m(ork)f(correctly)h(with)e (CFITSIO)g(one)h(has)f(to)i(use)e(a)i(mo)s(di\014ed)d(v)m(ersion)j (whic)m(h)e(supp)s(orts)f(a)i(command)0 4235 y(to)41 b(return)d(the)j(length)f(of)g(the)g(\014le.)70 b(This)39 b(mo)s(di\014ed)f(v)m(ersion)j(is)f(a)m(v)-5 b(ailable)42 b(in)e(ro)s(otd)f(sub)s(directory)g(in)h(the)0 4348 y(CFITSIO)29 b(ftp)h(area)h(at)286 4577 y Fe(ftp://legacy.gsfc.nasa.gov)o(/so)o (ftwa)o(re/f)o(its)o(io/c)o(/roo)o(t/r)o(ootd)o(.tar)o(.gz)o(.)0 4805 y Fi(This)j(small)g(serv)m(er)h(is)g(started)f(either)h(b)m(y)g (inetd)f(when)f(a)i(clien)m(t)h(requests)e(a)h(connection)h(to)f(a)f (ro)s(otd)h(serv)m(er)0 4918 y(or)30 b(b)m(y)g(hand)f(\(i.e.)42 b(from)30 b(the)g(command)g(line\).)42 b(The)29 b(ro)s(otd)h(serv)m(er) h(w)m(orks)f(with)g(the)g(R)m(OOT)g(TNetFile)i(class.)0 5031 y(It)e(allo)m(ws)g(remote)h(access)f(to)h(R)m(OOT)e(database)h (\014les)f(in)g(either)h(read)g(or)f(write)h(mo)s(de.)40 b(By)30 b(default)f(TNetFile)0 5144 y(assumes)38 b(p)s(ort)g(432)h (\(whic)m(h)f(requires)g(ro)s(otd)g(to)h(b)s(e)f(started)h(as)f(ro)s (ot\).)65 b(T)-8 b(o)39 b(run)e(ro)s(otd)h(via)h(inetd)f(add)g(the)0 5257 y(follo)m(wing)32 b(line)f(to)g(/etc/services:)95 5485 y Fe(rootd)238 b(432/tcp)0 5714 y Fi(and)30 b(to)h (/etc/inetd.conf,)i(add)d(the)g(follo)m(wing)i(line:)p eop end %%Page: 85 91 TeXDict begin 85 90 bop 0 299 a Fg(8.2.)72 b(FILETYPE)3128 b Fi(85)95 555 y Fe(rootd)47 b(stream)f(tcp)h(nowait)f(root)h (/user/rdm/root/bin/root)o(d)42 b(rootd)k(-i)0 829 y Fi(F)-8 b(orce)34 b(inetd)e(to)i(reread)e(its)h(conf)f(\014le)h(with)f ("kill)h(-HUP)g(".)47 b(Y)-8 b(ou)33 b(can)g(also)g(start) g(ro)s(otd)g(b)m(y)f(hand)0 942 y(running)j(directly)i(under)d(y)m(our) j(priv)-5 b(ate)37 b(accoun)m(t)g(\(no)g(ro)s(ot)g(system)f(privileges) h(needed\).)59 b(F)-8 b(or)37 b(example)g(to)0 1054 y(start)e(ro)s(otd) e(listening)i(on)f(p)s(ort)f(5151)j(just)d(t)m(yp)s(e:)49 b Fe(rootd)d(-p)h(5151)33 b Fi(Notice:)50 b(no)34 b(&)f(is)h(needed.)51 b(Ro)s(otd)35 b(will)0 1167 y(go)c(in)m(to)h(bac)m(kground)e(b)m(y)g (itself.)95 1441 y Fe(Rootd)47 b(arguments:)191 1554 y(-i)763 b(says)47 b(we)g(were)f(started)g(by)h(inetd)191 1667 y(-p)g(port#)476 b(specifies)45 b(a)j(different)d(port)i(to)g (listen)f(on)191 1780 y(-d)h(level)476 b(level)46 b(of)i(debug)e(info)h (written)e(to)j(syslog)1050 1893 y(0)f(=)h(no)f(debug)f(\(default\)) 1050 2005 y(1)h(=)h(minimum)1050 2118 y(2)f(=)h(medium)1050 2231 y(3)f(=)h(maximum)0 2505 y Fi(Ro)s(otd)29 b(can)f(also)h(b)s(e)f (con\014gured)g(for)g(anon)m(ymous)g(usage)h(\(lik)m(e)h(anon)m(ymous)e (ftp\).)40 b(T)-8 b(o)29 b(setup)f(ro)s(otd)g(to)h(accept)0 2618 y(anon)m(ymous)h(logins)h(do)g(the)f(follo)m(wing)i(\(while)f(b)s (eing)f(logged)i(in)e(as)g(ro)s(ot\):)143 2891 y Fe(-)48 b(Add)f(the)f(following)g(line)g(to)i(/etc/passwd:)239 3117 y(rootd:*:71:72:Anonymous)41 b(rootd:/var/spool/rootd:/b)o(in/)o (fals)o(e)239 3343 y(where)46 b(you)h(may)g(modify)f(the)h(uid,)f(gid)h (\(71,)g(72\))g(and)g(the)g(home)f(directory)239 3456 y(to)h(suite)f(your)h(system.)143 3681 y(-)h(Add)f(the)f(following)g (line)g(to)i(/etc/group:)239 3907 y(rootd:*:72:rootd)239 4133 y(where)e(the)h(gid)g(must)f(match)h(the)g(gid)g(in)g (/etc/passwd.)143 4359 y(-)h(Create)e(the)h(directories:)239 4585 y(mkdir)f(/var/spool/rootd)239 4698 y(mkdir)g (/var/spool/rootd/tmp)239 4811 y(chmod)g(777)h(/var/spool/rootd/tmp)239 5036 y(Where)f(/var/spool/rootd)d(must)k(match)f(the)h(rootd)g(home)f (directory)g(as)239 5149 y(specified)f(in)i(the)g(rootd)f(/etc/passwd)f (entry.)143 5375 y(-)j(To)f(make)f(writeable)g(directories)e(for)j (anonymous)f(do,)h(for)f(example:)239 5601 y(mkdir)g (/var/spool/rootd/pub)239 5714 y(chown)g(rootd:rootd)f (/var/spool/rootd/pub)p eop end %%Page: 86 92 TeXDict begin 86 91 bop 0 299 a Fi(86)1618 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fi(That's)42 b(all.)76 b(Sev)m(eral)43 b(additional)g(remarks:)64 b(y)m(ou)42 b(can)g(login)h(to)g(an)f(anon)m(ymous)f(serv)m(er)i (either)f(with)g(the)0 668 y(names)31 b("anon)m(ymous")h(or)f("ro)s (otd".)43 b(The)31 b(passw)m(ord)f(should)g(b)s(e)h(of)g(t)m(yp)s(e)g (user@host.do.main.)43 b(Only)30 b(the)h(@)0 781 y(is)e(enforced)f(for) h(the)f(time)i(b)s(eing.)39 b(In)28 b(anon)m(ymous)h(mo)s(de)f(the)g (top)h(of)g(the)g(\014le)f(tree)i(is)e(set)h(to)h(the)e(ro)s(otd)h (home)0 894 y(directory)-8 b(,)39 b(therefore)e(only)f(\014les)h(b)s (elo)m(w)f(the)h(home)f(directory)h(can)f(b)s(e)g(accessed.)60 b(Anon)m(ymous)36 b(mo)s(de)g(only)0 1007 y(w)m(orks)30 b(when)g(the)g(serv)m(er)h(is)f(started)h(via)g(inetd.)0 1296 y Fb(8.2.5)112 b(Notes)37 b(ab)s(out)i(the)e(shmem)i(\014let)m(yp) s(e:)0 1515 y Fi(Shared)34 b(memory)h(\014les)g(are)g(curren)m(tly)g (supp)s(orted)e(on)i(most)h(Unix)f(platforms,)h(where)f(the)g(shared)f (memory)0 1627 y(segmen)m(ts)d(are)g(managed)g(b)m(y)f(the)g(op)s (erating)h(system)g(k)m(ernel)f(and)g(`liv)m(e')i(indep)s(enden)m(tly)d (of)i(pro)s(cesses.)40 b(They)0 1740 y(are)34 b(not)g(deleted)h(\(b)m (y)f(default\))g(when)f(the)h(pro)s(cess)f(whic)m(h)h(created)h(them)f (terminates,)h(although)g(they)f(will)0 1853 y(disapp)s(ear)e(if)h(the) h(system)f(is)g(reb)s(o)s(oted.)49 b(Applications)34 b(can)g(create)h(shared)d(memory)h(\014les)g(in)g(CFITSIO)f(b)m(y)0 1966 y(calling:)143 2214 y Fe(fit_create_file\(&fitsfile)o(ptr,)41 b("shmem://h2",)j(&status\);)0 2462 y Fi(where)25 b(the)g(ro)s(ot)h (`\014le')f(names)h(are)f(curren)m(tly)g(restricted)h(to)g(b)s(e)f ('h0',)i('h1',)g('h2',)g('h3',)f(etc.,)i(up)d(to)g(a)h(maxim)m(um)0 2575 y(n)m(um)m(b)s(er)20 b(de\014ned)f(b)m(y)i(the)g(the)g(v)-5 b(alue)22 b(of)f(SHARED)p 1746 2575 28 4 v 33 w(MAXSEG)g(\(equal)h(to)f (16)h(b)m(y)f(default\).)38 b(This)20 b(is)h(a)g(protot)m(yp)s(e)0 2688 y(implemen)m(tation)30 b(of)f(the)g(shared)f(memory)g(in)m (terface)i(and)e(a)h(more)g(robust)f(in)m(terface,)j(whic)m(h)d(will)h (ha)m(v)m(e)h(few)m(er)0 2801 y(restrictions)h(on)f(the)h(n)m(um)m(b)s (er)e(of)i(\014les)f(and)g(on)g(their)g(names,)h(ma)m(y)g(b)s(e)f(dev)m (elop)s(ed)g(in)g(the)h(future.)0 2961 y(When)23 b(op)s(ening)h(an)f (already)h(existing)h(FITS)e(\014le)h(in)f(shared)g(memory)h(one)g (calls)g(the)g(usual)g(CFITSIO)e(routine:)143 3209 y Fe(fits_open_file\(&fitsfilep)o(tr,)41 b("shmem://h7",)j(mode,)j (&status\))0 3457 y Fi(The)26 b(\014le)h(mo)s(de)g(can)g(b)s(e)f(READ)m (WRITE)h(or)g(READONL)-8 b(Y)28 b(just)e(as)h(with)f(disk)h(\014les.)39 b(More)28 b(than)e(one)h(pro)s(cess)0 3570 y(can)35 b(op)s(erate)g(on)f (READONL)-8 b(Y)35 b(mo)s(de)f(\014les)h(at)g(the)f(same)h(time.)54 b(CFITSIO)33 b(supp)s(orts)f(prop)s(er)h(\014le)i(lo)s(c)m(king)0 3682 y(\(b)s(oth)27 b(in)h(READONL)-8 b(Y)29 b(and)e(READ)m(WRITE)h(mo) s(des\),)h(so)f(calls)h(to)f(\014ts)p 2572 3682 V 33 w(op)s(en)p 2795 3682 V 32 w(\014le)g(ma)m(y)g(b)s(e)f(lo)s(c)m(k)m(ed) j(out)e(un)m(til)0 3795 y(another)j(other)f(pro)s(cess)g(closes)i(the)e (\014le.)0 3956 y(When)g(an)g(application)i(is)e(\014nished)f (accessing)j(a)e(FITS)g(\014le)g(in)g(a)h(shared)e(memory)h(segmen)m (t,)i(it)f(ma)m(y)g(close)g(it)0 4068 y(\(and)j(the)g(\014le)g(will)g (remain)f(in)h(the)g(system\))g(with)g(\014ts)p 1955 4068 V 32 w(close)p 2173 4068 V 34 w(\014le,)h(or)f(delete)h(it)g(with) e(\014ts)p 3191 4068 V 33 w(delete)p 3455 4068 V 34 w(\014le.)51 b(Ph)m(ys-)0 4181 y(ical)36 b(deletion)g(is)f(p)s(ostp)s(oned)e(un)m (til)j(the)f(last)g(pro)s(cess)g(calls)h(\013clos/\013delt.)56 b(\014ts)p 2801 4181 V 32 w(delete)p 3064 4181 V 34 w(\014le)35 b(tries)h(to)f(obtain)h(a)0 4294 y(READ)m(WRITE)e(lo)s(c)m(k)g(on)f (the)g(\014le)h(to)g(b)s(e)e(deleted,)j(th)m(us)e(it)h(can)f(b)s(e)g (blo)s(c)m(k)m(ed)h(if)f(the)h(ob)5 b(ject)34 b(w)m(as)f(not)h(op)s (ened)0 4407 y(in)c(READ)m(WRITE)h(mo)s(de.)0 4567 y(A)i(shared)f (memory)h(managemen)m(t)h(utilit)m(y)g(program)f(called)h(`smem',)f(is) g(included)f(with)h(the)g(CFITSIO)e(dis-)0 4680 y(tribution.)39 b(It)27 b(can)g(b)s(e)f(built)h(b)m(y)g(t)m(yping)g(`mak)m(e)h(smem';)g (then)f(t)m(yp)s(e)g(`smem)f(-h')h(to)h(get)g(a)f(list)g(of)g(v)-5 b(alid)27 b(options.)0 4793 y(Executing)37 b(smem)f(without)g(an)m(y)h (options)g(causes)f(it)h(to)g(list)g(all)g(the)g(shared)e(memory)i (segmen)m(ts)g(curren)m(tly)0 4906 y(residing)c(in)g(the)g(system)h (and)e(managed)i(b)m(y)f(the)h(shared)e(memory)h(driv)m(er.)49 b(T)-8 b(o)34 b(get)g(a)g(list)g(of)f(all)h(the)g(shared)0 5019 y(memory)c(ob)5 b(jects,)32 b(run)d(the)h(system)h(utilit)m(y)g (program)f(`ip)s(cs)h([-a]'.)0 5351 y Fd(8.3)135 b(Base)46 b(Filename)0 5601 y Fi(The)31 b(base)g(\014lename)h(is)f(the)h(name)f (of)h(the)f(\014le)h(optionally)g(including)f(the)h(director/sub)s (directory)f(path,)h(and)0 5714 y(in)e(the)h(case)g(of)g(`ftp',)f(`h)m (ttp',)i(and)d(`ro)s(ot')j(\014let)m(yp)s(es,)e(the)h(mac)m(hine)g (iden)m(ti\014er.)41 b(Examples:)p eop end %%Page: 87 93 TeXDict begin 87 92 bop 0 299 a Fg(8.3.)72 b(BASE)30 b(FILENAME)2830 b Fi(87)191 555 y Fe(myfile.fits)191 668 y(!data.fits)191 781 y(/data/myfile.fits)191 894 y(fits.gsfc.nasa.gov/ftp/s)o(ampl)o(eda)o(ta/m)o(yfil)o(e.f)o(its.)o (gz)0 1120 y Fi(When)29 b(creating)h(a)f(new)f(output)h(\014le)g(on)g (magnetic)h(disk)e(\(of)i(t)m(yp)s(e)f(\014le://\))h(if)f(the)g(base)g (\014lename)g(b)s(egins)f(with)0 1233 y(an)34 b(exclamation)j(p)s(oin)m (t)d(\(!\))54 b(then)34 b(an)m(y)g(existing)i(\014le)e(with)g(that)h (same)g(basename)g(will)g(b)s(e)e(deleted)i(prior)f(to)0 1346 y(creating)h(the)f(new)g(FITS)f(\014le.)51 b(Otherwise)34 b(if)g(the)g(\014le)g(to)g(b)s(e)g(created)h(already)f(exists,)i(then)d (CFITSIO)g(will)0 1459 y(return)g(an)h(error)f(and)g(will)i(not)f(o)m (v)m(erwrite)h(the)f(existing)h(\014le.)52 b(Note)35 b(that)g(the)f(exclamation)i(p)s(oin)m(t,)f(')10 b(!',)36 b(is)e(a)0 1572 y(sp)s(ecial)28 b(UNIX)g(c)m(haracter,)j(so)d(if)f(it)i (is)f(used)f(on)g(the)h(command)g(line)g(rather)g(than)f(en)m(tered)h (at)h(a)f(task)h(prompt,)0 1685 y(it)j(m)m(ust)f(b)s(e)g(preceded)g(b)m (y)h(a)g(bac)m(kslash)g(to)g(force)g(the)g(UNIX)g(shell)f(to)h(pass)f (it)i(v)m(erbatim)f(to)g(the)g(application)0 1798 y(program.)0 1958 y(If)24 b(the)i(output)e(disk)h(\014le)g(name)g(ends)f(with)g(the) h(su\016x)f('.gz',)k(then)d(CFITSIO)e(will)i(compress)g(the)g(\014le)g (using)g(the)0 2071 y(gzip)g(compression)f(algorithm)h(b)s(efore)f (writing)g(it)h(to)g(disk.)38 b(This)23 b(can)i(reduce)f(the)g(amoun)m (t)h(of)f(disk)g(space)h(used)0 2184 y(b)m(y)34 b(the)h(\014le.)53 b(Note)36 b(that)f(this)g(feature)g(requires)f(that)h(the)f (uncompressed)g(\014le)g(b)s(e)g(constructed)h(in)f(memory)0 2297 y(b)s(efore)c(it)h(is)f(compressed)g(and)g(written)h(to)g(disk,)f (so)g(it)h(can)g(fail)g(if)f(there)h(is)f(insu\016cien)m(t)h(a)m(v)-5 b(ailable)33 b(memory)-8 b(.)0 2457 y(An)45 b(input)g(FITS)f(\014le)i (ma)m(y)g(b)s(e)f(compressed)g(with)h(the)f(gzip)h(or)g(Unix)f (compress)h(algorithms,)k(in)45 b(whic)m(h)0 2570 y(case)38 b(CFITSIO)e(will)i(uncompress)e(the)i(\014le)g(on)f(the)h(\015y)e(in)m (to)j(a)f(temp)s(orary)f(\014le)g(\(in)h(memory)f(or)g(on)h(disk\).)0 2683 y(Compressed)32 b(\014les)i(ma)m(y)g(only)f(b)s(e)g(op)s(ened)f (with)h(read-only)h(p)s(ermission.)49 b(When)33 b(sp)s(ecifying)g(the)h (name)f(of)h(a)0 2796 y(compressed)h(FITS)g(\014le)h(it)g(is)g(not)g (necessary)g(to)g(app)s(end)e(the)i(\014le)g(su\016x)e(\(e.g.,)39 b(`.gz')e(or)f(`.Z'\).)g(If)f(CFITSIO)0 2908 y(cannot)24 b(\014nd)e(the)h(input)f(\014le)i(name)f(without)g(the)g(su\016x,)h (then)f(it)h(will)g(automatically)i(searc)m(h)e(for)f(a)g(compressed)0 3021 y(\014le)36 b(with)f(the)h(same)g(ro)s(ot)g(name.)57 b(In)35 b(the)h(case)h(of)f(reading)g(ftp)f(and)g(h)m(ttp)h(t)m(yp)s(e) g(\014les,)h(CFITSIO)e(generally)0 3134 y(lo)s(oks)j(for)g(a)g (compressed)g(v)m(ersion)g(of)g(the)g(\014le)g(\014rst,)h(b)s(efore)e (trying)h(to)h(op)s(en)e(the)h(uncompressed)e(\014le.)64 b(By)0 3247 y(default,)37 b(CFITSIO)e(copies)h(\(and)g(uncompressed)e (if)i(necessary\))g(the)g(ftp)f(or)h(h)m(ttp)g(FITS)f(\014le)g(in)m(to) i(memory)0 3360 y(on)f(the)g(lo)s(cal)h(mac)m(hine)f(b)s(efore)g(op)s (ening)f(it.)58 b(This)35 b(will)h(fail)g(if)g(the)g(lo)s(cal)h(mac)m (hine)g(do)s(es)e(not)h(ha)m(v)m(e)h(enough)0 3473 y(memory)g(to)h (hold)f(the)g(whole)h(FITS)e(\014le,)k(so)d(in)g(this)g(case,)k(the)c (output)g(\014lename)g(sp)s(eci\014er)g(\(see)h(the)g(next)0 3586 y(section\))32 b(can)f(b)s(e)e(used)h(to)h(further)e(con)m(trol)j (ho)m(w)e(CFITSIO)f(reads)h(ftp)g(and)g(h)m(ttp)g(\014les.)0 3746 y(If)i(the)h(input)f(\014le)h(is)g(an)g(IRAF)g(image)h(\014le)f (\(*.imh)g(\014le\))h(then)e(CFITSIO)f(will)j(automatically)h(con)m(v)m (ert)g(it)e(on)0 3859 y(the)27 b(\015y)g(in)m(to)h(a)g(virtual)f(FITS)f (image)j(b)s(efore)e(it)g(is)g(op)s(ened)g(b)m(y)g(the)g(application)i (program.)39 b(IRAF)27 b(images)i(can)0 3972 y(only)h(b)s(e)g(op)s (ened)g(with)g(READONL)-8 b(Y)31 b(\014le)f(access.)0 4132 y(Similarly)-8 b(,)32 b(if)f(the)g(input)f(\014le)i(is)f(a)g(ra)m (w)g(binary)f(data)i(arra)m(y)-8 b(,)33 b(then)d(CFITSIO)g(will)h(con)m (v)m(ert)i(it)e(on)g(the)h(\015y)e(in)m(to)0 4245 y(a)38 b(virtual)g(FITS)g(image)h(with)e(the)h(basic)h(set)f(of)g(required)f (header)h(k)m(eyw)m(ords)g(b)s(efore)g(it)g(is)g(op)s(ened)f(b)m(y)h (the)0 4358 y(application)32 b(program)f(\(with)g(READONL)-8 b(Y)31 b(access\).)44 b(In)30 b(this)h(case)h(the)f(data)g(t)m(yp)s(e)g (and)g(dimensions)f(of)h(the)0 4471 y(image)d(m)m(ust)f(b)s(e)f(sp)s (eci\014ed)g(in)h(square)g(brac)m(k)m(ets)h(follo)m(wing)g(the)f (\014lename)g(\(e.g.)41 b(ra)m(w\014le.dat[ib512,512]\).)j(The)0 4584 y(\014rst)30 b(c)m(haracter)i(\(case)f(insensitiv)m(e\))h (de\014nes)e(the)g(datat)m(yp)s(e)h(of)g(the)g(arra)m(y:)239 4810 y Fe(b)429 b(8-bit)46 b(unsigned)g(byte)239 4923 y(i)381 b(16-bit)46 b(signed)g(integer)239 5036 y(u)381 b(16-bit)46 b(unsigned)g(integer)239 5149 y(j)381 b(32-bit)46 b(signed)g(integer)239 5262 y(r)h(or)g(f)143 b(32-bit)46 b(floating)g(point)239 5375 y(d)381 b(64-bit)46 b(floating)g(point)0 5601 y Fi(An)40 b(optional)h(second)f(c)m(haracter)i(sp)s(eci\014es)e (the)h(b)m(yte)f(order)g(of)g(the)h(arra)m(y)g(v)-5 b(alues:)60 b(b)40 b(or)g(B)h(indicates)g(big)0 5714 y(endian)f(\(as)h(in)f(FITS)f (\014les)i(and)f(the)g(nativ)m(e)i(format)e(of)h(SUN)f(UNIX)h(w)m (orkstations)g(and)f(Mac)i(PCs\))e(and)p eop end %%Page: 88 94 TeXDict begin 88 93 bop 0 299 a Fi(88)1618 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fi(l)41 b(or)g(L)g(indicates)g(little)i(endian)e(\(nativ)m(e)h (format)g(of)f(DEC)f(OSF)h(w)m(orkstations)h(and)e(IBM)i(PCs\).)72 b(If)40 b(this)0 668 y(c)m(haracter)32 b(is)e(omitted)i(then)e(the)g (arra)m(y)h(is)g(assumed)e(to)i(ha)m(v)m(e)h(the)f(nativ)m(e)g(b)m(yte) g(order)f(of)h(the)f(lo)s(cal)i(mac)m(hine.)0 781 y(These)d(datat)m(yp) s(e)h(c)m(haracters)h(are)e(then)g(follo)m(w)m(ed)i(b)m(y)e(a)h(series) f(of)g(one)h(or)f(more)g(in)m(teger)i(v)-5 b(alues)29 b(separated)h(b)m(y)0 894 y(commas)h(whic)m(h)g(de\014ne)e(the)i(size)h (of)e(eac)m(h)i(dimension)e(of)h(the)g(ra)m(w)f(arra)m(y)-8 b(.)43 b(Arra)m(ys)30 b(with)h(up)e(to)j(5)f(dimensions)0 1007 y(are)f(curren)m(tly)g(supp)s(orted.)38 b(Finally)-8 b(,)32 b(a)e(b)m(yte)g(o\013set)g(to)h(the)e(p)s(osition)h(of)g(the)g (\014rst)e(pixel)i(in)g(the)f(data)i(\014le)e(ma)m(y)0 1120 y(b)s(e)d(sp)s(eci\014ed)g(b)m(y)h(separating)h(it)f(with)g(a)g (':')39 b(from)27 b(the)g(last)g(dimension)g(v)-5 b(alue.)40 b(If)26 b(omitted,)j(it)e(is)g(assumed)f(that)0 1233 y(the)35 b(o\013set)h(=)f(0.)54 b(This)35 b(parameter)g(ma)m(y)h(b)s(e) e(used)g(to)i(skip)e(o)m(v)m(er)i(an)m(y)g(header)e(information)i(in)e (the)h(\014le)g(that)0 1346 y(precedes)30 b(the)h(binary)f(data.)41 b(F)-8 b(urther)30 b(examples:)95 1603 y Fe(raw.dat[b10000])521 b(1-dimensional)45 b(10000)h(pixel)g(byte)h(array)95 1715 y(raw.dat[rb400,400,12])233 b(3-dimensional)45 b(floating)g(point) h(big-endian)f(array)95 1828 y(img.fits[ib512,512:2880])89 b(reads)47 b(the)g(512)g(x)g(512)g(short)f(integer)g(array)g(in)1336 1941 y(a)i(FITS)e(file,)h(skipping)e(over)i(the)g(2880)g(byte)f(header) 0 2198 y Fi(One)25 b(sp)s(ecial)g(case)h(of)f(input)f(\014le)h(is)g (where)g(the)g(\014lename)g(=)g(`-')h(\(a)f(dash)g(or)g(min)m(us)f (sign\))h(or)g('stdin')g(or)g('stdout',)0 2311 y(whic)m(h)d (signi\014es)h(that)h(the)f(input)e(\014le)i(is)g(to)h(b)s(e)e(read)g (from)h(the)g(stdin)f(stream,)j(or)e(written)f(to)i(the)f(stdout)g (stream)0 2424 y(if)34 b(a)g(new)g(output)f(\014le)h(is)g(b)s(eing)g (created.)52 b(In)33 b(the)h(case)h(of)f(reading)h(from)e(stdin,)h (CFITSIO)f(\014rst)g(copies)i(the)0 2537 y(whole)g(stream)h(in)m(to)g (a)f(temp)s(orary)g(FITS)f(\014le)i(\(in)f(memory)g(or)g(on)g(disk\),)h (and)f(subsequen)m(t)f(reading)h(of)h(the)0 2650 y(FITS)c(\014le)h(o)s (ccurs)g(in)f(this)h(cop)m(y)-8 b(.)49 b(When)33 b(writing)g(to)g (stdout,)h(CFITSIO)d(\014rst)h(constructs)h(the)g(whole)g(\014le)g(in)0 2763 y(memory)h(\(since)i(random)d(access)j(is)e(required\),)i(then)e (\015ushes)f(it)i(out)g(to)g(the)f(stdout)h(stream)g(when)e(the)i (\014le)0 2876 y(is)30 b(closed.)42 b(In)29 b(addition,)i(if)f(the)g (output)g(\014lename)g(=)g('-.gz')i(or)e('stdout.gz')h(then)f(it)h (will)f(b)s(e)g(gzip)g(compressed)0 2989 y(b)s(efore)g(b)s(eing)g (written)g(to)h(stdout.)0 3149 y(This)25 b(abilit)m(y)j(to)e(read)g (and)f(write)h(on)g(the)g(stdin)g(and)f(stdout)h(steams)g(allo)m(ws)i (FITS)d(\014les)h(to)g(b)s(e)g(pip)s(ed)e(b)s(et)m(w)m(een)0 3262 y(tasks)42 b(in)f(memory)g(rather)g(than)h(ha)m(ving)g(to)g (create)h(temp)s(orary)e(in)m(termediate)i(FITS)d(\014les)i(on)f(disk.) 73 b(F)-8 b(or)0 3375 y(example)28 b(if)e(task1)i(creates)h(an)e (output)f(FITS)g(\014le,)i(and)f(task2)g(reads)g(an)g(input)f(FITS)g (\014le,)i(the)f(FITS)f(\014le)h(ma)m(y)0 3487 y(b)s(e)j(pip)s(ed)f(b)s (et)m(w)m(een)i(the)f(2)h(tasks)g(b)m(y)f(sp)s(ecifying)143 3744 y Fe(task1)47 b(-)g(|)g(task2)g(-)0 4001 y Fi(where)30 b(the)h(v)m(ertical)i(bar)e(is)f(the)h(Unix)g(piping)f(sym)m(b)s(ol.)42 b(This)30 b(assumes)g(that)i(the)f(2)g(tasks)g(read)g(the)g(name)g(of)0 4114 y(the)g(FITS)e(\014le)i(o\013)f(of)h(the)g(command)f(line.)0 4448 y Fd(8.4)135 b(Output)45 b(File)g(Name)h(when)f(Op)t(ening)g(an)g (Existing)h(File)0 4698 y Fi(An)36 b(optional)i(output)e(\014lename)h (ma)m(y)h(b)s(e)e(sp)s(eci\014ed)g(in)g(paren)m(theses)h(immediately)h (follo)m(wing)g(the)f(base)g(\014le)0 4811 y(name)28 b(to)h(b)s(e)f(op)s(ened.)39 b(This)28 b(is)g(mainly)g(useful)g(in)g (those)g(cases)i(where)d(CFITSIO)g(creates)j(a)e(temp)s(orary)g(cop)m (y)0 4924 y(of)i(the)f(input)g(FITS)f(\014le)i(b)s(efore)f(it)h(is)f (op)s(ened)g(and)f(passed)h(to)h(the)g(application)h(program.)40 b(This)28 b(happ)s(ens)g(b)m(y)0 5036 y(default)i(when)g(op)s(ening)g (a)g(net)m(w)m(ork)h(FTP)g(or)f(HTTP-t)m(yp)s(e)g(\014le,)h(when)e (reading)h(a)h(compressed)f(FITS)g(\014le)g(on)0 5149 y(a)36 b(lo)s(cal)h(disk,)g(when)e(reading)h(from)g(the)g(stdin)f (stream,)j(or)d(when)g(a)i(column)e(\014lter,)j(ro)m(w)e(\014lter,)h (or)f(binning)0 5262 y(sp)s(eci\014er)29 b(is)g(included)g(as)h(part)f (of)g(the)h(input)f(\014le)g(sp)s(eci\014cation.)41 b(By)30 b(default)g(this)f(temp)s(orary)g(\014le)g(is)h(created)0 5375 y(in)g(memory)-8 b(.)41 b(If)29 b(there)h(is)g(not)g(enough)g (memory)g(to)h(create)g(the)g(\014le)f(cop)m(y)-8 b(,)31 b(then)f(CFITSIO)e(will)i(exit)h(with)f(an)0 5488 y(error.)45 b(In)32 b(these)g(cases)h(one)g(can)f(force)h(a)f(p)s(ermanen)m(t)g (\014le)g(to)h(b)s(e)e(created)i(on)f(disk,)g(instead)h(of)f(a)g(temp)s (orary)0 5601 y(\014le)38 b(in)f(memory)-8 b(,)40 b(b)m(y)d(supplying)f (the)i(name)g(in)f(paren)m(theses)h(immediately)h(follo)m(wing)g(the)e (base)h(\014le)g(name.)0 5714 y(The)30 b(output)g(\014lename)g(can)h (include)f(the)h(')10 b(!')41 b(clobb)s(er)30 b(\015ag.)p eop end %%Page: 89 95 TeXDict begin 89 94 bop 0 299 a Fg(8.4.)72 b(OUTPUT)30 b(FILE)g(NAME)h(WHEN)g(OPENING)f(AN)h(EXISTING)e(FILE)967 b Fi(89)0 555 y(Th)m(us,)48 b(if)d(the)g(input)f(\014lename)h(to)g (CFITSIO)f(is:)70 b Fe(file1.fits.gz\(file2.fit)o(s\))39 b Fi(then)44 b(CFITSIO)g(will)0 668 y(uncompress)39 b (`\014le1.\014ts.gz')j(in)m(to)f(the)f(lo)s(cal)h(disk)e(\014le)h (`\014le2.\014ts')h(b)s(efore)f(op)s(ening)f(it.)70 b(CFITSIO)38 b(do)s(es)i(not)0 781 y(automatically)33 b(delete)f(the)e(output)g (\014le,)h(so)g(it)g(will)f(still)i(exist)f(after)g(the)f(application)i (program)e(exits.)0 941 y(In)35 b(some)i(cases,)h(sev)m(eral)f (di\013eren)m(t)g(temp)s(orary)e(FITS)h(\014les)g(will)g(b)s(e)f (created)i(in)f(sequence,)i(for)e(instance,)i(if)0 1054 y(one)f(op)s(ens)g(a)g(remote)h(\014le)f(using)g(FTP)-8 b(,)37 b(then)g(\014lters)g(ro)m(ws)g(in)g(a)h(binary)e(table)i (extension,)i(then)c(create)j(an)0 1167 y(image)f(b)m(y)f(binning)f(a)h (pair)g(of)g(columns.)60 b(In)36 b(this)h(case,)j(the)d(remote)h (\014le)f(will)g(b)s(e)f(copied)h(to)h(a)f(temp)s(orary)0 1280 y(lo)s(cal)j(\014le,)h(then)d(a)h(second)f(temp)s(orary)h(\014le)f (will)h(b)s(e)f(created)i(con)m(taining)g(the)e(\014ltered)h(ro)m(ws)f (of)h(the)g(table,)0 1393 y(and)c(\014nally)g(a)h(third)e(temp)s(orary) h(\014le)h(con)m(taining)g(the)g(binned)e(image)i(will)g(b)s(e)f (created.)57 b(In)34 b(cases)i(lik)m(e)h(this)0 1506 y(where)28 b(m)m(ultiple)h(\014les)f(are)h(created,)h(the)e(out\014le)h (sp)s(eci\014er)f(will)g(b)s(e)g(in)m(terpreted)h(the)f(name)g(of)h (the)f(\014nal)g(\014le)h(as)0 1619 y(describ)s(ed)g(b)s(elo)m(w,)i(in) f(descending)g(priorit)m(y:)136 1869 y Fc(\017)46 b Fi(as)29 b(the)g(name)g(of)g(the)g(\014nal)f(image)i(\014le)f(if)f(an)h(image)h (within)e(a)h(single)g(binary)f(table)i(cell)g(is)e(op)s(ened)g(or)h (if)227 1982 y(an)i(image)g(is)g(created)g(b)m(y)f(binning)g(a)g(table) i(column.)136 2167 y Fc(\017)46 b Fi(as)33 b(the)f(name)h(of)f(the)h (\014le)f(con)m(taining)i(the)e(\014ltered)g(table)i(if)e(a)h(column)f (\014lter)g(and/or)g(a)h(ro)m(w)f(\014lter)h(are)227 2280 y(sp)s(eci\014ed.)136 2464 y Fc(\017)46 b Fi(as)31 b(the)f(name)h(of)f(the)h(lo)s(cal)h(cop)m(y)f(of)f(the)h(remote)g(FTP) f(or)h(HTTP)e(\014le.)136 2649 y Fc(\017)46 b Fi(as)31 b(the)g(name)g(of)g(the)f(uncompressed)g(v)m(ersion)h(of)g(the)f(FITS)g (\014le,)h(if)g(a)g(compressed)f(FITS)g(\014le)h(on)g(lo)s(cal)227 2762 y(disk)f(has)g(b)s(een)g(op)s(ened.)136 2946 y Fc(\017)46 b Fi(otherwise,)31 b(the)g(output)f(\014lename)g(is)h(ignored.)0 3197 y(The)e(output)f(\014le)h(sp)s(eci\014er)g(is)g(useful)f(when)g (reading)h(FTP)g(or)g(HTTP-t)m(yp)s(e)g(FITS)f(\014les)h(since)g(it)h (can)f(b)s(e)g(used)0 3310 y(to)34 b(create)i(a)e(lo)s(cal)h(disk)e (cop)m(y)i(of)f(the)g(\014le)f(that)i(can)f(b)s(e)f(reused)g(in)g(the)h (future.)50 b(If)33 b(the)h(output)g(\014le)f(name)h(=)0 3423 y(`*')i(then)e(a)i(lo)s(cal)g(\014le)f(with)g(the)g(same)g(name)g (as)g(the)h(net)m(w)m(ork)f(\014le)g(will)h(b)s(e)e(created.)56 b(Note)36 b(that)f(CFITSIO)0 3535 y(will)30 b(b)s(eha)m(v)m(e)g (di\013eren)m(tly)h(dep)s(ending)d(on)i(whether)f(the)h(remote)g (\014le)g(is)g(compressed)f(or)h(not)g(as)g(sho)m(wn)f(b)m(y)h(the)0 3648 y(follo)m(wing)i(examples:)136 3876 y Fc(\017)46 b Fi(`ftp://remote.mac)m(hine/tmp/m)m(y\014le.\014ts.gz\(*\)')k(-)43 b(the)g(remote)h(compressed)f(\014le)g(is)g(copied)h(to)g(the)227 3988 y(lo)s(cal)26 b(compressed)e(\014le)g(`m)m(y\014le.\014ts.gz',)k (whic)m(h)c(is)g(then)h(uncompressed)e(in)h(lo)s(cal)h(memory)f(b)s (efore)g(b)s(eing)227 4101 y(op)s(ened)30 b(and)g(passed)g(to)h(the)f (application)i(program.)136 4286 y Fc(\017)46 b Fi(`ftp://remote.mac)m (hine/tmp/m)m(y\014le.\014ts.gz\(m)m(y\014le.\014ts\)')d(-)37 b(the)g(remote)g(compressed)f(\014le)h(is)f(copied)227 4399 y(and)h(uncompressed)g(in)m(to)h(the)g(lo)s(cal)h(\014le)f(`m)m (y\014le.\014ts'.)64 b(This)36 b(example)j(requires)e(less)h(lo)s(cal)h (memory)227 4512 y(than)30 b(the)h(previous)f(example)h(since)g(the)f (\014le)h(is)f(uncompressed)f(on)h(disk)g(instead)h(of)f(in)h(memory)-8 b(.)136 4696 y Fc(\017)46 b Fi(`ftp://remote.mac)m(hine/tmp/m)m (y\014le.\014ts\(m)m(y\014le.\014ts.gz\)')28 b(-)21 b(this)g(will)h (usually)f(pro)s(duce)f(an)h(error)g(since)227 4809 y(CFITSIO)29 b(itself)i(cannot)g(compress)f(\014les.)0 5036 y(The)36 b(exact)i(b)s(eha)m(vior)e(of)h(CFITSIO)e(in)h(the)h(latter)g(case)h (dep)s(ends)c(on)j(the)f(t)m(yp)s(e)h(of)g(ftp)f(serv)m(er)g(running)f (on)0 5149 y(the)c(remote)g(mac)m(hine)g(and)f(ho)m(w)g(it)h(is)f (con\014gured.)40 b(In)30 b(some)h(cases,)g(if)f(the)h(\014le)f(`m)m (y\014le.\014ts.gz')j(exists)e(on)f(the)0 5262 y(remote)38 b(mac)m(hine,)h(then)e(the)g(serv)m(er)g(will)h(cop)m(y)f(it)h(to)f (the)h(lo)s(cal)g(mac)m(hine.)61 b(In)36 b(other)h(cases)h(the)f(ftp)g (serv)m(er)0 5375 y(will)f(automatically)j(create)e(and)f(transmit)g(a) g(compressed)g(v)m(ersion)g(of)g(the)g(\014le)g(if)g(only)g(the)g (uncompressed)0 5488 y(v)m(ersion)27 b(exists.)41 b(This)26 b(can)h(get)h(rather)f(confusing,)h(so)f(users)f(should)g(use)h(a)g (certain)h(amoun)m(t)g(of)f(caution)h(when)0 5601 y(using)34 b(the)h(output)f(\014le)h(sp)s(eci\014er)f(with)h(FTP)f(or)h(HTTP)f (\014le)h(t)m(yp)s(es,)h(to)f(mak)m(e)h(sure)e(they)h(get)h(the)f(b)s (eha)m(vior)0 5714 y(that)c(they)g(exp)s(ect.)p eop end %%Page: 90 96 TeXDict begin 90 95 bop 0 299 a Fi(90)1618 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fd(8.5)135 b(T)-11 b(emplate)46 b(File)g(Name)f(when)g(Creating)h (a)g(New)f(File)0 808 y Fi(When)38 b(a)h(new)f(FITS)g(\014le)h(is)g (created)g(with)g(a)f(call)i(to)g(\014ts)p 2101 808 28 4 v 32 w(create)p 2369 808 V 35 w(\014le,)g(the)f(name)g(of)g(a)g (template)h(\014le)e(ma)m(y)0 921 y(b)s(e)h(supplied)g(in)h(paren)m (theses)g(immediately)h(follo)m(wing)g(the)g(name)f(of)g(the)g(new)f (\014le)h(to)h(b)s(e)e(created.)71 b(This)0 1034 y(template)27 b(is)e(used)g(to)h(de\014ne)f(the)h(structure)f(of)h(one)f(or)h(more)g (HDUs)g(in)f(the)h(new)f(\014le.)39 b(The)25 b(template)i(\014le)e(ma)m (y)0 1147 y(b)s(e)32 b(another)h(FITS)f(\014le,)i(in)f(whic)m(h)f(case) i(the)f(newly)g(created)h(\014le)f(will)g(ha)m(v)m(e)h(exactly)h(the)e (same)g(k)m(eyw)m(ords)g(in)0 1260 y(eac)m(h)25 b(HDU)g(as)g(in)f(the)g (template)i(FITS)d(\014le,)j(but)d(all)j(the)e(data)h(units)e(will)i(b) s(e)f(\014lled)g(with)f(zeros.)40 b(The)24 b(template)0 1373 y(\014le)i(ma)m(y)h(also)g(b)s(e)e(an)h(ASCI)s(I)e(text)j(\014le,) g(where)f(eac)m(h)h(line)f(\(in)g(general\))i(describ)s(es)d(one)h (FITS)f(k)m(eyw)m(ord)i(record.)0 1486 y(The)j(format)h(of)f(the)h (ASCI)s(I)e(template)i(\014le)g(is)f(describ)s(ed)f(b)s(elo)m(w.)0 1833 y Fd(8.6)135 b(Image)46 b(Tile-Compression)h(Sp)t(eci\014cation)0 2086 y Fi(When)28 b(sp)s(ecifying)g(the)h(name)g(of)f(the)h(output)f (FITS)g(\014le)g(to)h(b)s(e)f(created,)i(the)f(user)f(can)g(indicate)i (that)f(images)0 2198 y(should)d(b)s(e)h(written)g(in)g (tile-compressed)h(format)g(\(see)g(section)g(5.5,)h(\\Primary)e(Arra)m (y)h(or)f(IMA)m(GE)h(Extension)0 2311 y(I/O)f(Routines"\))i(b)m(y)e (enclosing)h(the)g(compression)f(parameters)h(in)f(square)g(brac)m(k)m (ets)i(follo)m(wing)g(the)f(ro)s(ot)f(disk)0 2424 y(\014le)j(name.)41 b(Here)31 b(are)g(some)g(examples)g(of)f(the)h(syn)m(tax)g(for)f(sp)s (ecifying)g(tile-compressed)i(output)e(images:)191 2695 y Fe(myfile.fit[compress])185 b(-)48 b(use)f(Rice)f(algorithm)g(and)h (default)e(tile)i(size)191 2921 y(myfile.fit[compress)42 b(GZIP])47 b(-)g(use)g(the)g(specified)e(compression)g(algorithm;)191 3034 y(myfile.fit[compress)d(Rice])238 b(only)46 b(the)h(first)g (letter)f(of)h(the)g(algorithm)191 3147 y(myfile.fit[compress)42 b(PLIO])238 b(name)46 b(is)i(required.)191 3373 y(myfile.fit[compress) 42 b(Rice)47 b(100,100])141 b(-)48 b(use)e(100)h(x)h(100)f(pixel)f (tile)h(size)191 3486 y(myfile.fit[compress)42 b(Rice)47 b(100,100;2])e(-)j(as)f(above,)f(and)h(use)g(noisebits)e(=)i(2)0 3833 y Fd(8.7)135 b(HDU)46 b(Lo)t(cation)f(Sp)t(eci\014cation)0 4086 y Fi(The)c(optional)h(HDU)h(lo)s(cation)g(sp)s(eci\014er)d (de\014nes)h(whic)m(h)g(HDU)h(\(Header-Data)i(Unit,)h(also)d(kno)m(wn)f (as)h(an)0 4199 y(`extension'\))36 b(within)d(the)i(FITS)e(\014le)h(to) h(initially)h(op)s(en.)51 b(It)34 b(m)m(ust)g(immediately)i(follo)m(w)f (the)f(base)h(\014le)f(name)0 4312 y(\(or)g(the)g(output)g(\014le)g (name)f(if)h(presen)m(t\).)52 b(If)33 b(it)h(is)g(not)g(sp)s(eci\014ed) g(then)f(the)h(\014rst)f(HDU)i(\(the)f(primary)f(arra)m(y\))0 4425 y(is)g(op)s(ened.)46 b(The)32 b(HDU)h(lo)s(cation)h(sp)s (eci\014er)e(is)h(required)f(if)g(the)h(colFilter,)i(ro)m(wFilter,)g (or)e(binSp)s(ec)e(sp)s(eci\014ers)0 4538 y(are)f(presen)m(t,)f(b)s (ecause)h(the)f(primary)f(arra)m(y)i(is)f(not)h(a)f(v)-5 b(alid)30 b(HDU)g(for)f(these)g(op)s(erations.)41 b(The)29 b(HDU)h(ma)m(y)g(b)s(e)0 4650 y(sp)s(eci\014ed)e(either)i(b)m(y)e (absolute)i(p)s(osition)f(n)m(um)m(b)s(er,)f(starting)i(with)e(0)i(for) e(the)h(primary)f(arra)m(y)-8 b(,)31 b(or)e(b)m(y)f(reference)0 4763 y(to)h(the)g(HDU)g(name,)g(and)f(optionally)-8 b(,)31 b(the)e(v)m(ersion)g(n)m(um)m(b)s(er)e(and)h(the)h(HDU)g(t)m(yp)s(e)g (of)f(the)h(desired)f(extension.)0 4876 y(The)k(lo)s(cation)h(of)f(an)g (image)i(within)d(a)i(single)f(cell)i(of)e(a)g(binary)g(table)h(ma)m(y) f(also)h(b)s(e)f(sp)s(eci\014ed,)g(as)g(describ)s(ed)0 4989 y(b)s(elo)m(w.)0 5149 y(The)26 b(absolute)h(p)s(osition)f(of)g (the)h(extension)g(is)f(sp)s(eci\014ed)f(either)i(b)m(y)f(enclosed)h (the)g(n)m(um)m(b)s(er)e(in)h(square)f(brac)m(k)m(ets)0 5262 y(\(e.g.,)k(`[1]')g(=)d(the)h(\014rst)f(extension)h(follo)m(wing)i (the)e(primary)e(arra)m(y\))j(or)f(b)m(y)f(preceded)h(the)g(n)m(um)m(b) s(er)e(with)i(a)g(plus)0 5375 y(sign)37 b(\(`+1'\).)63 b(T)-8 b(o)38 b(sp)s(ecify)f(the)g(HDU)h(b)m(y)g(name,)h(giv)m(e)g(the) e(name)h(of)f(the)h(desired)f(HDU)h(\(the)f(v)-5 b(alue)38 b(of)g(the)0 5488 y(EXTNAME)e(or)g(HDUNAME)h(k)m(eyw)m(ord\))g(and)f (optionally)h(the)f(extension)h(v)m(ersion)f(n)m(um)m(b)s(er)f(\(v)-5 b(alue)37 b(of)f(the)0 5601 y(EXTVER)27 b(k)m(eyw)m(ord\))i(and)e(the)h (extension)h(t)m(yp)s(e)e(\(v)-5 b(alue)29 b(of)f(the)g(XTENSION)f(k)m (eyw)m(ord:)40 b(IMA)m(GE,)29 b(ASCI)s(I)d(or)0 5714 y(T)-8 b(ABLE,)36 b(or)f(BINT)-8 b(ABLE\),)36 b(separated)f(b)m(y)g (commas)h(and)e(all)i(enclosed)g(in)f(square)g(brac)m(k)m(ets.)56 b(If)34 b(the)h(v)-5 b(alue)p eop end %%Page: 91 97 TeXDict begin 91 96 bop 0 299 a Fg(8.8.)72 b(IMA)m(GE)31 b(SECTION)2835 b Fi(91)0 555 y(of)34 b(EXTVER)f(and)f(XTENSION)h(are)h (not)f(sp)s(eci\014ed,)h(then)f(the)h(\014rst)e(extension)j(with)e(the) g(correct)i(v)-5 b(alue)34 b(of)0 668 y(EXTNAME)39 b(is)g(op)s(ened.)67 b(The)38 b(extension)i(name)f(and)f(t)m(yp)s(e)i(are)f(not)h(case)g (sensitiv)m(e,)j(and)38 b(the)h(extension)0 781 y(t)m(yp)s(e)29 b(ma)m(y)g(b)s(e)f(abbreviated)h(to)g(a)g(single)g(letter)h(\(e.g.,)h (I)d(=)g(IMA)m(GE)i(extension)f(or)f(primary)g(arra)m(y)-8 b(,)30 b(A)f(or)f(T)g(=)0 894 y(ASCI)s(I)d(table)i(extension,)h(and)e (B)h(=)f(binary)g(table)h(BINT)-8 b(ABLE)27 b(extension\).)41 b(If)26 b(the)g(HDU)h(lo)s(cation)i(sp)s(eci\014er)0 1007 y(is)h(equal)h(to)g(`[PRIMAR)-8 b(Y]')32 b(or)f(`[P]',)g(then)f (the)h(primary)e(arra)m(y)i(\(the)g(\014rst)f(HDU\))h(will)g(b)s(e)f (op)s(ened.)0 1167 y(FITS)k(images)i(are)f(most)h(commonly)f(stored)g (in)g(the)g(primary)f(arra)m(y)h(or)g(an)g(image)h(extension,)h(but)d (images)0 1280 y(can)d(also)h(b)s(e)e(stored)h(as)h(a)f(v)m(ector)h(in) f(a)g(single)h(cell)g(of)f(a)h(binary)e(table)i(\(i.e.)43 b(eac)m(h)32 b(ro)m(w)f(of)g(the)h(v)m(ector)g(column)0 1393 y(con)m(tains)d(a)g(di\013eren)m(t)f(image\).)42 b(Suc)m(h)27 b(an)h(image)i(can)e(b)s(e)g(op)s(ened)f(with)h(CFITSIO)e (b)m(y)i(sp)s(ecifying)g(the)g(desired)0 1506 y(column)k(name)g(and)f (the)h(ro)m(w)g(n)m(um)m(b)s(er)f(after)h(the)g(binary)f(table)i(HDU)g (sp)s(eci\014er)e(as)h(sho)m(wn)g(in)f(the)h(follo)m(wing)0 1619 y(examples.)71 b(The)40 b(column)g(name)h(is)f(separated)h(from)f (the)h(HDU)g(sp)s(eci\014er)f(b)m(y)g(a)h(semicolon)g(and)f(the)h(ro)m (w)0 1732 y(n)m(um)m(b)s(er)29 b(is)h(enclosed)h(in)e(paren)m(theses.) 41 b(In)30 b(this)g(case)h(CFITSIO)d(copies)j(the)f(image)i(from)d(the) i(table)g(cell)g(in)m(to)0 1844 y(a)h(temp)s(orary)e(primary)h(arra)m (y)g(b)s(efore)g(it)h(is)f(op)s(ened.)43 b(The)30 b(application)j (program)e(then)g(just)g(sees)g(the)h(image)0 1957 y(in)i(the)h (primary)e(arra)m(y)-8 b(,)37 b(without)d(an)m(y)h(extensions.)53 b(The)34 b(particular)g(ro)m(w)h(to)g(b)s(e)e(op)s(ened)h(ma)m(y)h(b)s (e)f(sp)s(eci\014ed)0 2070 y(either)28 b(b)m(y)f(giving)h(an)f (absolute)h(in)m(teger)h(ro)m(w)f(n)m(um)m(b)s(er)e(\(starting)i(with)f (1)h(for)f(the)g(\014rst)g(ro)m(w\),)i(or)e(b)m(y)g(sp)s(ecifying)0 2183 y(a)33 b(b)s(o)s(olean)f(expression)g(that)h(ev)-5 b(aluates)34 b(to)f(TR)m(UE)g(for)f(the)g(desired)g(ro)m(w.)47 b(The)32 b(\014rst)f(ro)m(w)i(that)g(satis\014es)g(the)0 2296 y(expression)28 b(will)g(b)s(e)g(used.)39 b(The)28 b(ro)m(w)g(selection)i(expression)e(has)g(the)g(same)g(syn)m(tax)h(as)f (describ)s(ed)f(in)h(the)g(Ro)m(w)0 2409 y(Filter)k(Sp)s(eci\014er)d (section,)j(b)s(elo)m(w.)0 2569 y(Examples:)143 2811 y Fe(myfile.fits[3])44 b(-)k(open)e(the)h(3rd)g(HDU)g(following)e(the)i (primary)f(array)143 2924 y(myfile.fits+3)92 b(-)48 b(same)e(as)h (above,)f(but)h(using)g(the)g(FTOOLS-style)d(notation)143 3037 y(myfile.fits[EVENTS])f(-)k(open)g(the)g(extension)e(that)i(has)g (EXTNAME)e(=)j('EVENTS')143 3150 y(myfile.fits[EVENTS,)43 b(2])95 b(-)47 b(same)g(as)g(above,)f(but)h(also)g(requires)e(EXTVER)h (=)i(2)143 3263 y(myfile.fits[events,2,b])42 b(-)47 b(same,)f(but)h (also)g(requires)f(XTENSION)f(=)j('BINTABLE')143 3376 y(myfile.fits[3;)c(images\(17\)])h(-)i(opens)g(the)g(image)f(in)h(row)g (17)g(of)g(the)g('images')1527 3489 y(column)f(in)i(the)e(3rd)h (extension)f(of)h(the)g(file.)143 3602 y(myfile.fits[3;)d (images\(exposure)g(>)j(100\)])g(-)g(as)g(above,)f(but)h(opens)g(the)f (image)907 3714 y(in)h(the)g(first)f(row)h(that)g(has)g(an)g ('exposure')e(column)h(value)907 3827 y(greater)g(than)g(100.)0 4158 y Fd(8.8)135 b(Image)46 b(Section)0 4408 y Fi(A)41 b(virtual)g(\014le)f(con)m(taining)i(a)f(rectangular)h(subsection)e(of) h(an)g(image)g(can)g(b)s(e)f(extracted)i(and)e(op)s(ened)g(b)m(y)0 4521 y(sp)s(ecifying)32 b(the)h(range)g(of)g(pixels)g(\(start:end\))g (along)h(eac)m(h)g(axis)f(to)g(b)s(e)f(extracted)i(from)e(the)h (original)g(image.)0 4634 y(One)d(can)h(also)h(sp)s(ecify)e(an)h (optional)h(pixel)f(incremen)m(t)g(\(start:end:step\))h(for)f(eac)m(h)h (axis)f(of)g(the)g(input)e(image.)0 4747 y(A)f(pixel)f(step)h(=)f(1)h (will)g(b)s(e)f(assumed)f(if)i(it)g(is)f(not)h(sp)s(eci\014ed.)39 b(If)27 b(the)h(start)g(pixel)g(is)f(larger)i(then)e(the)h(end)e (pixel,)0 4860 y(then)32 b(the)g(image)h(will)f(b)s(e)f(\015ipp)s(ed)f (\(pro)s(ducing)h(a)h(mirror)g(image\))h(along)g(that)f(dimension.)45 b(An)32 b(asterisk,)h('*',)0 4973 y(ma)m(y)39 b(b)s(e)e(used)h(to)h(sp) s(ecify)f(the)g(en)m(tire)h(range)g(of)f(an)h(axis,)i(and)c('-*')j (will)e(\015ip)g(the)g(en)m(tire)h(axis.)65 b(The)38 b(input)0 5086 y(image)31 b(can)f(b)s(e)f(in)g(the)h(primary)f(arra)m (y)-8 b(,)31 b(in)e(an)g(image)i(extension,)g(or)f(con)m(tained)g(in)g (a)g(v)m(ector)h(cell)g(of)f(a)g(binary)0 5199 y(table.)40 b(In)25 b(the)h(later)h(2)f(cases)h(the)f(extension)h(name)f(or)f(n)m (um)m(b)s(er)g(m)m(ust)h(b)s(e)f(sp)s(eci\014ed)g(b)s(efore)h(the)g (image)h(section)0 5312 y(sp)s(eci\014er.)0 5472 y(Examples:)95 5714 y Fe(myfile.fits[1:512:2,)43 b(2:512:2])i(-)95 b(open)47 b(a)h(256x256)d(pixel)i(image)p eop end %%Page: 92 98 TeXDict begin 92 97 bop 0 299 a Fi(92)1618 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)668 555 y Fe(consisting)45 b(of)i(the)g(odd)g(numbered)f(columns)g(\(1st)g (axis\))h(and)668 668 y(the)g(even)g(numbered)e(rows)i(\(2nd)g(axis\))f (of)h(the)g(image)f(in)i(the)668 781 y(primary)e(array)g(of)i(the)e (file.)95 1007 y(myfile.fits[*,)e(512:256])i(-)h(open)g(an)g(image)g (consisting)e(of)i(all)g(the)g(columns)668 1120 y(in)g(the)g(input)g (image,)f(but)h(only)f(rows)h(256)g(through)f(512.)668 1233 y(The)h(image)f(will)h(be)g(flipped)f(along)g(the)h(2nd)g(axis)g (since)668 1346 y(the)g(starting)f(pixel)g(is)h(greater)f(than)h(the)g (ending)f(pixel.)95 1571 y(myfile.fits[*:2,)e(512:256:2])h(-)i(same)g (as)g(above)f(but)h(keeping)f(only)668 1684 y(every)h(other)f(row)h (and)g(column)f(in)h(the)g(input)f(image.)95 1910 y(myfile.fits[-*,)e (*])j(-)h(copy)e(the)h(entire)f(image,)g(flipping)g(it)h(along)668 2023 y(the)g(first)f(axis.)95 2249 y(myfile.fits[3][1:256,1:256)o(])c (-)47 b(opens)g(a)g(subsection)e(of)i(the)g(image)g(that)668 2362 y(is)g(in)h(the)e(3rd)h(extension)f(of)h(the)g(file.)95 2588 y(myfile.fits[4;)d(images\(12\)][1:10,1:10])e(-)48 b(open)e(an)h(image)g(consisting)286 2700 y(of)h(the)e(first)h(10)g (pixels)f(in)h(both)g(dimensions.)e(The)i(original)286 2813 y(image)g(resides)f(in)h(the)g(12th)f(row)h(of)g(the)g('images')f (vector)286 2926 y(column)g(in)i(the)f(table)f(in)h(the)g(4th)g (extension)e(of)i(the)g(file.)0 3203 y Fi(When)23 b(CFITSIO)f(op)s(ens) h(an)g(image)h(section)h(it)f(\014rst)f(creates)h(a)g(temp)s(orary)f (\014le)h(con)m(taining)h(the)e(image)i(section)0 3315 y(plus)32 b(a)i(cop)m(y)g(of)g(an)m(y)g(other)f(HDUs)h(in)f(the)h (\014le.)50 b(This)32 b(temp)s(orary)h(\014le)h(is)f(then)g(op)s(ened)g (b)m(y)g(the)h(application)0 3428 y(program,)28 b(so)g(it)g(is)f(not)h (p)s(ossible)f(to)h(write)g(to)g(or)g(mo)s(dify)f(the)g(input)g(\014le) g(when)g(sp)s(ecifying)g(an)h(image)h(section.)0 3541 y(Note)39 b(that)f(CFITSIO)e(automatically)k(up)s(dates)d(the)g(w)m (orld)h(co)s(ordinate)g(system)g(k)m(eyw)m(ords)f(in)g(the)h(header)0 3654 y(of)33 b(the)h(image)g(section,)h(if)e(they)h(exist,)h(so)e(that) h(the)f(co)s(ordinate)h(asso)s(ciated)h(with)e(eac)m(h)h(pixel)f(in)g (the)h(image)0 3767 y(section)e(will)e(b)s(e)g(computed)g(correctly)-8 b(.)0 4120 y Fd(8.9)135 b(Image)46 b(T)-11 b(ransform)45 b(Filters)0 4374 y Fi(CFITSIO)33 b(can)h(apply)g(a)h(user-sp)s (eci\014ed)e(mathematical)j(function)e(to)h(the)g(v)-5 b(alue)34 b(of)h(ev)m(ery)g(pixel)f(in)g(a)h(FITS)0 4487 y(image,)29 b(th)m(us)e(creating)h(a)g(new)e(virtual)h(image)i(in)d (computer)h(memory)g(that)h(is)f(then)f(op)s(ened)h(and)f(read)h(b)m(y) g(the)0 4600 y(application)32 b(program.)40 b(The)30 b(original)i(FITS)d(image)j(is)e(not)h(mo)s(di\014ed)e(b)m(y)h(this)h (pro)s(cess.)0 4760 y(The)20 b(image)j(transformation)e(sp)s(eci\014er) f(is)h(app)s(ended)e(to)j(the)f(input)f(FITS)h(\014le)g(name)g(and)f (is)h(enclosed)h(in)e(square)0 4873 y(brac)m(k)m(ets.)42 b(It)29 b(b)s(egins)f(with)h(the)g(letters)i('PIX')e(to)h(distinguish)e (it)i(from)e(other)i(t)m(yp)s(es)f(of)g(FITS)f(\014le)h(\014lters)g (that)0 4986 y(are)36 b(recognized)i(b)m(y)e(CFITSIO.)e(The)i(image)h (transforming)f(function)f(ma)m(y)i(use)f(an)m(y)g(of)g(the)h (mathematical)0 5099 y(op)s(erators)44 b(listed)h(in)f(the)h(follo)m (wing)h('Ro)m(w)f(Filtering)g(Sp)s(eci\014cation')g(section)h(of)e (this)h(do)s(cumen)m(t.)82 b(Some)0 5212 y(examples)31 b(of)f(image)i(transform)e(\014lters)g(are:)48 5488 y Fe([pix)46 b(X)i(*)f(2.0])715 b(-)48 b(multiply)d(each)i(pixel)f(by)h (2.0)48 5601 y([pix)f(sqrt\(X\)])714 b(-)48 b(take)e(the)h(square)f (root)h(of)g(each)g(pixel)48 5714 y([pix)f(X)i(+)f(#ZEROPT)571 b(-)48 b(add)e(the)h(value)g(of)g(the)g(ZEROPT)f(keyword)p eop end %%Page: 93 99 TeXDict begin 93 98 bop 0 299 a Fg(8.9.)72 b(IMA)m(GE)31 b(TRANSF)m(ORM)g(FIL)-8 b(TERS)2237 b Fi(93)48 555 y Fe([pix)46 b(X>0)h(?)h(log10\(X\))d(:)j(-99.])e(-)i(if)f(the)g(pixel)f (value)g(is)i(greater)1480 668 y(than)e(0,)h(compute)f(the)h(base)g(10) g(log,)1480 781 y(else)f(set)h(the)g(pixel)f(=)i(-99.)0 1013 y Fi(Use)24 b(the)g(letter)h('X')f(in)f(the)h(expression)g(to)g (represen)m(t)g(the)g(curren)m(t)f(pixel)h(v)-5 b(alue)24 b(in)f(the)h(image.)40 b(The)23 b(expression)0 1126 y(is)38 b(ev)-5 b(aluated)39 b(indep)s(enden)m(tly)e(for)g(eac)m(h)i(pixel)f (in)g(the)g(image)h(and)e(ma)m(y)h(b)s(e)g(a)g(function)f(of)h(1\))h (the)f(original)0 1239 y(pixel)32 b(v)-5 b(alue,)32 b(2\))g(the)f(v)-5 b(alue)32 b(of)f(other)h(pixels)f(in)g(the)g(image)i(at)f(a)f(giv)m(en) i(relativ)m(e)g(o\013set)f(from)f(the)g(p)s(osition)h(of)0 1352 y(the)d(pixel)f(that)h(is)g(b)s(eing)f(ev)-5 b(aluated,)30 b(and)e(3\))h(the)g(v)-5 b(alue)29 b(of)f(an)m(y)h(header)f(k)m(eyw)m (ords.)41 b(Header)29 b(k)m(eyw)m(ord)g(v)-5 b(alues)0 1465 y(are)31 b(represen)m(ted)f(b)m(y)g(the)h(name)f(of)h(the)f(k)m (eyw)m(ord)h(preceded)f(b)m(y)h(the)f('#')h(sign.)0 1625 y(T)-8 b(o)35 b(access)h(the)f(the)g(v)-5 b(alue)35 b(of)g(adjacen)m(t) h(pixels)f(in)f(the)h(image,)i(sp)s(ecify)e(the)g(\(1-D\))h(o\013set)g (from)e(the)h(curren)m(t)0 1738 y(pixel)c(in)f(curly)g(brac)m(k)m(ets.) 42 b(F)-8 b(or)31 b(example)48 1970 y Fe([pix)94 b(\(x{-1})46 b(+)i(x)f(+)h(x{+1}\))e(/)h(3])0 2202 y Fi(will)25 b(replace)g(eac)m(h) h(pixel)f(v)-5 b(alue)25 b(with)f(the)h(running)e(mean)i(of)f(the)h(v) -5 b(alues)25 b(of)g(that)g(pixel)g(and)f(it's)h(2)g(neigh)m(b)s(oring) 0 2314 y(pixels.)40 b(Note)30 b(that)g(in)e(this)g(notation)i(the)f (image)h(is)f(treated)g(as)g(a)g(1-D)h(arra)m(y)-8 b(,)30 b(where)e(eac)m(h)i(ro)m(w)f(of)g(the)g(image)0 2427 y(\(or)c(higher)f(dimensional)g(cub)s(e\))h(is)f(app)s(ended)f(one)h (after)h(another)g(in)f(one)h(long)g(arra)m(y)g(of)f(pixels.)39 b(It)25 b(is)f(p)s(ossible)0 2540 y(to)35 b(refer)f(to)h(pixels)f(in)g (the)g(ro)m(ws)g(ab)s(o)m(v)m(e)h(or)g(b)s(elo)m(w)f(the)g(curren)m(t)g (pixel)h(b)m(y)f(using)f(the)h(v)-5 b(alue)35 b(of)f(the)h(NAXIS1)0 2653 y(header)30 b(k)m(eyw)m(ord.)41 b(F)-8 b(or)32 b(example)48 2885 y Fe([pix)46 b(\(x{-#NAXIS1})f(+)i(x)h(+)f(x{#NAXIS1}\))e(/)i(3])0 3117 y Fi(will)34 b(compute)f(the)h(mean)f(of)g(eac)m(h)i(image)f (pixel)g(and)e(the)i(pixels)f(immediately)i(ab)s(o)m(v)m(e)f(and)f(b)s (elo)m(w)g(it)h(in)f(the)0 3230 y(adjacen)m(t)27 b(ro)m(ws)f(of)g(the)f (image.)41 b(The)25 b(follo)m(wing)i(more)f(complex)h(example)f (creates)h(a)f(smo)s(othed)g(virtual)g(image)0 3343 y(where)k(eac)m(h)h (pixel)g(is)g(a)f(3)h(x)f(3)h(b)s(o)m(xcar)g(a)m(v)m(erage)i(of)d(the)h (input)e(image)j(pixels:)95 3575 y Fe([pix)47 b(\(X)g(+)h(X{-1})e(+)i (X{+1})286 3688 y(+)g(X{-#NAXIS1})d(+)i(X{-#NAXIS1)e(-)i(1})h(+)f (X{-#NAXIS1)e(+)j(1})286 3801 y(+)g(X{#NAXIS1})d(+)i(X{#NAXIS1)f(-)h (1})g(+)h(X{#NAXIS1)d(+)i(1}\))g(/)h(9.])0 4033 y Fi(If)31 b(the)h(pixel)g(o\013set)h(extends)f(b)s(ey)m(ond)f(the)h(\014rst)f(or) h(last)h(pixel)f(in)f(the)h(image,)i(the)e(function)g(will)g(ev)-5 b(aluate)33 b(to)0 4145 y(unde\014ned,)28 b(or)j(NULL.)0 4306 y(F)-8 b(or)39 b(complex)g(or)g(commonly)g(used)e(image)j (\014ltering)f(op)s(erations,)i(one)d(can)h(write)g(the)f(expression)h (in)m(to)g(an)0 4419 y(external)i(text)h(\014le)f(and)f(then)g(imp)s (ort)g(it)h(in)m(to)h(the)e(\014lter)h(using)f(the)h(syn)m(tax)g('[pix) g(@\014lename.txt]'.)72 b(The)0 4531 y(mathematical)29 b(expression)e(can)g(extend)g(o)m(v)m(er)i(m)m(ultiple)e(lines)g(of)h (text)g(in)e(the)h(\014le.)40 b(An)m(y)27 b(lines)g(in)g(the)g (external)0 4644 y(text)h(\014le)e(that)i(b)s(egin)e(with)g(2)h(slash)f (c)m(haracters)i(\('//'\))h(will)e(b)s(e)f(ignored)h(and)f(ma)m(y)h(b)s (e)f(used)g(to)h(add)f(commen)m(ts)0 4757 y(in)m(to)31 b(the)g(\014le.)0 4917 y(By)c(default,)g(the)f(datat)m(yp)s(e)i(of)e (the)g(resulting)h(image)g(will)g(b)s(e)e(the)i(same)f(as)h(the)f (original)i(image,)g(but)e(one)g(ma)m(y)0 5030 y(force)31 b(a)g(di\013eren)m(t)g(datat)m(yp)s(e)g(b)m(y)f(app)s(ended)f(a)h(co)s (de)h(letter)h(to)f(the)f('pix')h(k)m(eyw)m(ord:)286 5262 y Fe(pixb)95 b(-)g(8-bit)46 b(byte)190 b(image)46 b(with)h(BITPIX)f(=)143 b(8)286 5375 y(pixi)95 b(-)47 b(16-bit)f(integer)g(image)g(with)h(BITPIX)f(=)95 b(16)286 5488 y(pixj)g(-)47 b(32-bit)f(integer)g(image)g(with)h(BITPIX)f(=)95 b(32)286 5601 y(pixr)g(-)47 b(32-bit)f(float)142 b(image)46 b(with)h(BITPIX)f(=)i(-32)286 5714 y(pixd)95 b(-)47 b(64-bit)f(float) 142 b(image)46 b(with)h(BITPIX)f(=)i(-64)p eop end %%Page: 94 100 TeXDict begin 94 99 bop 0 299 a Fi(94)1618 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fi(Also)23 b(b)m(y)f(default,)j(an)m(y)d(other)h(HDUs)g(in)f(the) g(input)g(\014le)g(will)h(b)s(e)e(copied)i(without)g(c)m(hange)g(to)g (the)g(output)f(virtual)0 668 y(FITS)k(\014le,)h(but)f(one)g(ma)m(y)h (discard)f(the)h(other)f(HDUs)h(b)m(y)f(adding)g(the)h(n)m(um)m(b)s(er) e('1')i(to)g(the)g('pix')f(k)m(eyw)m(ord)h(\(and)0 781 y(follo)m(wing)32 b(an)m(y)f(optional)g(datat)m(yp)s(e)g(co)s(de)g (letter\).)42 b(F)-8 b(or)32 b(example:)239 1044 y Fe (myfile.fits[3][pixr1)90 b(sqrt\(X\)])0 1307 y Fi(will)23 b(create)i(a)e(virtual)g(FITS)f(\014le)h(con)m(taining)h(only)f(a)g (primary)f(arra)m(y)i(image)g(with)e(32-bit)i(\015oating)g(p)s(oin)m(t) f(pixels)0 1420 y(that)29 b(ha)m(v)m(e)h(a)f(v)-5 b(alue)30 b(equal)f(to)g(the)g(square)g(ro)s(ot)g(of)g(the)g(pixels)f(in)h(the)g (image)h(that)f(is)g(in)f(the)h(3rd)f(extension)i(of)0 1533 y(the)h('m)m(y\014le.\014ts')g(\014le.)0 1870 y Fd(8.10)136 b(Column)45 b(and)f(Keyw)l(ord)i(Filtering)g(Sp)t (eci\014cation)0 2121 y Fi(The)27 b(optional)i(column/k)m(eyw)m(ord)g (\014ltering)f(sp)s(eci\014er)f(is)h(used)f(to)i(mo)s(dify)e(the)h (column)g(structure)f(and/or)h(the)0 2234 y(header)38 b(k)m(eyw)m(ords)h(in)f(the)h(HDU)g(that)h(w)m(as)f(selected)h(with)e (the)h(previous)f(HDU)h(lo)s(cation)h(sp)s(eci\014er.)65 b(This)0 2347 y(\014ltering)42 b(sp)s(eci\014er)f(m)m(ust)h(b)s(e)f (enclosed)i(in)e(square)h(brac)m(k)m(ets)h(and)e(can)h(b)s(e)f (distinguished)g(from)h(a)g(general)0 2460 y(ro)m(w)d(\014lter)g(sp)s (eci\014er)f(\(describ)s(ed)g(b)s(elo)m(w\))h(b)m(y)g(the)g(fact)h (that)f(it)g(b)s(egins)f(with)h(the)g(string)g('col)h(')f(and)f(is)h (not)0 2573 y(immediately)30 b(follo)m(w)m(ed)g(b)m(y)e(an)g(equals)h (sign.)40 b(The)28 b(original)h(\014le)f(is)h(not)f(c)m(hanged)h(b)m(y) f(this)h(\014ltering)f(op)s(eration,)0 2686 y(and)40 b(instead)h(the)g(mo)s(di\014cations)g(are)g(made)f(on)h(a)g(cop)m(y)g (of)g(the)g(input)f(FITS)g(\014le)g(\(usually)h(in)f(memory\),)0 2799 y(whic)m(h)33 b(also)h(con)m(tains)g(a)f(cop)m(y)h(of)f(all)h(the) g(other)f(HDUs)h(in)e(the)h(\014le.)49 b(This)33 b(temp)s(orary)f (\014le)h(is)g(passed)g(to)h(the)0 2912 y(application)f(program)f(and)f (will)h(p)s(ersist)f(only)h(un)m(til)g(the)g(\014le)g(is)g(closed)h(or) f(un)m(til)g(the)g(program)f(exits,)j(unless)0 3025 y(the)d(out\014le)f (sp)s(eci\014er)g(\(see)h(ab)s(o)m(v)m(e\))h(is)f(also)g(supplied.)0 3185 y(The)g(column/k)m(eyw)m(ord)h(\014lter)f(can)g(b)s(e)g(used)f(to) i(p)s(erform)e(the)i(follo)m(wing)g(op)s(erations.)44 b(More)32 b(than)f(one)g(op)s(er-)0 3298 y(ation)g(ma)m(y)g(b)s(e)f(sp) s(eci\014ed)g(b)m(y)g(separating)h(them)f(with)h(commas)f(or)h (semi-colons.)136 3561 y Fc(\017)46 b Fi(Cop)m(y)36 b(only)g(a)g(sp)s (eci\014ed)g(list)g(of)g(columns)g(columns)f(to)i(the)f(\014ltered)g (input)f(\014le.)57 b(The)36 b(list)g(of)g(column)227 3673 y(name)41 b(should)e(b)s(e)g(separated)i(b)m(y)f(commas)h(or)f (semi-colons.)72 b(Wild)41 b(card)f(c)m(haracters)h(ma)m(y)g(b)s(e)f (used)227 3786 y(in)e(the)f(column)h(names)g(to)g(matc)m(h)g(m)m (ultiple)h(columns.)62 b(If)37 b(the)h(expression)g(con)m(tains)g(b)s (oth)f(a)h(list)h(of)227 3899 y(columns)29 b(to)h(b)s(e)f(included)g (and)g(columns)g(to)h(b)s(e)e(deleted,)j(then)e(all)h(the)g(columns)f (in)g(the)h(original)g(table)227 4012 y(except)36 b(the)e(explicitly)i (deleted)f(columns)f(will)h(app)s(ear)e(in)h(the)h(\014ltered)f(table)h (\(i.e.,)i(there)e(is)f(no)g(need)227 4125 y(to)d(explicitly)h(list)f (the)g(columns)f(to)h(b)s(e)f(included)f(if)i(an)m(y)f(columns)h(are)f (b)s(eing)g(deleted\).)136 4316 y Fc(\017)46 b Fi(Delete)32 b(a)d(column)g(or)g(k)m(eyw)m(ord)h(b)m(y)f(listing)h(the)f(name)g (preceded)g(b)m(y)g(a)g(min)m(us)g(sign)g(or)g(an)g(exclamation)227 4429 y(mark)c(\(!\),)h(e.g.,)i('-TIME')d(will)g(delete)h(the)e(TIME)h (column)f(if)g(it)i(exists,)g(otherwise)f(the)g(TIME)f(k)m(eyw)m(ord.) 227 4542 y(An)35 b(error)f(is)h(returned)e(if)i(neither)f(a)i(column)e (nor)g(k)m(eyw)m(ord)h(with)g(this)f(name)h(exists.)54 b(Note)36 b(that)g(the)227 4655 y(exclamation)27 b(p)s(oin)m(t,)g(')10 b(!',)27 b(is)e(a)g(sp)s(ecial)h(UNIX)f(c)m(haracter,)j(so)d(if)g(it)h (is)f(used)f(on)h(the)g(command)g(line)g(rather)227 4768 y(than)33 b(en)m(tered)h(at)g(a)g(task)g(prompt,)f(it)h(m)m(ust)f(b)s (e)g(preceded)g(b)m(y)g(a)h(bac)m(kslash)g(to)g(force)g(the)f(UNIX)h (shell)227 4881 y(to)d(ignore)g(it.)136 5071 y Fc(\017)46 b Fi(Rename)29 b(an)g(existing)g(column)f(or)h(k)m(eyw)m(ord)g(with)f (the)h(syn)m(tax)g('NewName)h(==)e(OldName'.)40 b(An)28 b(error)227 5184 y(is)j(returned)e(if)h(neither)h(a)f(column)g(nor)g(k) m(eyw)m(ord)h(with)f(this)h(name)f(exists.)136 5375 y Fc(\017)46 b Fi(App)s(end)37 b(a)j(new)f(column)f(or)i(k)m(eyw)m(ord)f (to)h(the)f(table.)68 b(T)-8 b(o)40 b(create)g(a)g(column,)h(giv)m(e)g (the)e(new)g(name,)227 5488 y(optionally)e(follo)m(w)m(ed)g(b)m(y)e (the)g(datat)m(yp)s(e)h(in)f(paren)m(theses,)i(follo)m(w)m(ed)g(b)m(y)e (a)h(single)g(equals)f(sign)g(and)g(an)227 5601 y(expression)g(to)h(b)s (e)e(used)g(to)i(compute)f(the)g(v)-5 b(alue)35 b(\(e.g.,)j('new)m (col\(1J\))f(=)e(0')g(will)h(create)g(a)f(new)g(32-bit)227 5714 y(in)m(teger)k(column)e(called)i('new)m(col')f(\014lled)g(with)f (zeros\).)62 b(The)37 b(datat)m(yp)s(e)h(is)g(sp)s(eci\014ed)e(using)h (the)h(same)p eop end %%Page: 95 101 TeXDict begin 95 100 bop 0 299 a Fg(8.10.)73 b(COLUMN)30 b(AND)h(KEYW)m(ORD)g(FIL)-8 b(TERING)30 b(SPECIFICA)-8 b(TION)1075 b Fi(95)227 555 y(syn)m(tax)28 b(that)h(is)e(allo)m(w)m(ed) j(for)d(the)h(v)-5 b(alue)28 b(of)g(the)g(FITS)f(TF)m(ORMn)g(k)m(eyw)m (ord)h(\(e.g.,)i('I',)f('J',)f('E',)g('D',)h(etc.)227 668 y(for)37 b(binary)f(tables,)k(and)c('I8',)k(F12.3',)h('E20.12',)g (etc.)62 b(for)37 b(ASCI)s(I)e(tables\).)62 b(If)37 b(the)g(datat)m(yp) s(e)h(is)f(not)227 781 y(sp)s(eci\014ed)24 b(then)f(an)h(appropriate)h (datat)m(yp)s(e)g(will)f(b)s(e)g(c)m(hosen)g(dep)s(ending)f(on)h(the)g (form)g(of)g(the)g(expression)227 894 y(\(ma)m(y)f(b)s(e)d(a)i(c)m (haracter)h(string,)h(logical,)h(bit,)f(long)e(in)m(teger,)j(or)c (double)g(column\).)38 b(An)21 b(appropriate)g(v)m(ector)227 1007 y(coun)m(t)31 b(\(in)g(the)f(case)i(of)e(binary)g(tables\))h(will) g(also)g(b)s(e)f(added)g(if)g(not)h(explicitly)h(sp)s(eci\014ed.)227 1154 y(When)26 b(creating)h(a)f(new)f(k)m(eyw)m(ord,)j(the)e(k)m(eyw)m (ord)g(name)g(m)m(ust)g(b)s(e)f(preceded)g(b)m(y)h(a)g(p)s(ound)e(sign) h('#',)j(and)227 1267 y(the)h(expression)f(m)m(ust)g(ev)-5 b(aluate)30 b(to)f(a)g(scalar)g(\(i.e.,)h(cannot)f(ha)m(v)m(e)h(a)f (column)f(name)g(in)g(the)h(expression\).)227 1380 y(The)j(commen)m(t)i (string)f(for)f(the)h(k)m(eyw)m(ord)h(ma)m(y)f(b)s(e)f(sp)s(eci\014ed)g (in)g(paren)m(theses)h(immediately)h(follo)m(wing)227 1493 y(the)29 b(k)m(eyw)m(ord)f(name)g(\(instead)h(of)f(supplying)f(a)h (datat)m(yp)s(e)h(as)g(in)e(the)i(case)g(of)f(creating)h(a)g(new)f (column\).)227 1606 y(If)c(the)h(k)m(eyw)m(ord)g(name)f(ends)g(with)g (a)h(p)s(ound)d(sign)i('#',)i(then)e(c\014tsio)i(will)e(substitute)h (the)f(n)m(um)m(b)s(er)f(of)i(the)227 1719 y(most)31 b(recen)m(tly)h(referenced)e(column)h(for)f(the)h(#)f(c)m(haracter)i(.) 41 b(This)29 b(is)i(esp)s(ecially)h(useful)d(when)h(writing)227 1831 y(a)c(column-related)g(k)m(eyw)m(ord)g(lik)m(e)g(TUNITn)e(for)h(a) h(newly)f(created)h(column,)g(as)g(sho)m(wn)e(in)h(the)g(follo)m(wing) 227 1944 y(examples.)227 2092 y(COMMENT)30 b(and)g(HISTOR)-8 b(Y)30 b(k)m(eyw)m(ords)g(ma)m(y)h(also)h(b)s(e)e(created)h(with)f(the) h(follo)m(wing)g(syn)m(tax:)370 2320 y Fe(#COMMENT)46 b(=)h('This)g(is)g(a)g(comment)f(keyword')370 2433 y(#HISTORY)g(=)h ('This)g(is)g(a)g(history)f(keyword')227 2661 y Fi(Note)d(that)f(the)f (equal)h(sign)f(and)f(the)i(quote)f(c)m(haracters)i(will)f(b)s(e)e (remo)m(v)m(ed,)45 b(so)d(that)f(the)h(resulting)227 2774 y(header)30 b(k)m(eyw)m(ords)h(in)f(these)h(cases)g(will)g(lo)s (ok)g(lik)m(e)h(this:)370 3002 y Fe(COMMENT)46 b(This)h(is)g(a)h (comment)d(keyword)370 3115 y(HISTORY)h(This)h(is)g(a)h(history)d (keyword)227 3343 y Fi(These)29 b(t)m(w)m(o)h(sp)s(ecial)f(k)m(eyw)m (ords)h(are)f(alw)m(a)m(ys)h(app)s(ended)d(to)j(the)f(end)f(of)h(the)g (header)g(and)f(will)h(not)g(a\013ect)227 3456 y(an)m(y)i(previously)f (existing)h(COMMENT)f(or)h(HISTOR)-8 b(Y)30 b(k)m(eyw)m(ords.)136 3637 y Fc(\017)46 b Fi(Recompute)f(\(o)m(v)m(erwrite\))i(the)d(v)-5 b(alues)44 b(in)g(an)g(existing)i(column)e(or)g(k)m(eyw)m(ord)g(b)m(y)g (giving)i(the)e(name)227 3750 y(follo)m(w)m(ed)32 b(b)m(y)f(an)f (equals)h(sign)f(and)g(an)g(arithmetic)i(expression.)0 3991 y(The)23 b(expression)g(that)i(is)e(used)g(when)g(app)s(ending)f (or)h(recomputing)h(columns)f(or)h(k)m(eyw)m(ords)g(can)g(b)s(e)f (arbitrarily)0 4104 y(complex)36 b(and)g(ma)m(y)g(b)s(e)f(a)h(function) g(of)g(other)g(header)g(k)m(eyw)m(ord)g(v)-5 b(alues)36 b(and)f(other)h(columns)g(\(in)g(the)g(same)0 4217 y(ro)m(w\).)63 b(The)37 b(full)g(syn)m(tax)i(and)e(a)m(v)-5 b(ailable)40 b(functions)d(for)g(the)h(expression)f(are)h(describ)s(ed)f(b)s(elo)m (w)h(in)f(the)h(ro)m(w)0 4330 y(\014lter)30 b(sp)s(eci\014cation)i (section.)0 4490 y(If)27 b(the)h(expression)g(con)m(tains)g(b)s(oth)f (a)h(list)h(of)f(columns)f(to)h(b)s(e)g(included)e(and)i(columns)f(to)h (b)s(e)f(deleted,)j(then)d(all)0 4603 y(the)34 b(columns)g(in)g(the)g (original)h(table)g(except)g(the)f(explicitly)i(deleted)f(columns)e (will)i(app)s(ear)e(in)h(the)g(\014ltered)0 4716 y(table.)40 b(If)26 b(no)g(columns)f(to)i(b)s(e)f(deleted)g(are)h(sp)s(eci\014ed,)f (then)g(only)g(the)h(columns)e(that)i(are)f(explicitly)i(listed)f(will) 0 4829 y(b)s(e)k(included)g(in)g(the)h(\014ltered)f(output)h(table.)45 b(T)-8 b(o)32 b(include)f(all)i(the)e(columns,)h(add)f(the)h('*')g (wildcard)g(sp)s(eci\014er)0 4942 y(at)f(the)g(end)e(of)i(the)f(list,)i (as)e(sho)m(wn)g(in)g(the)h(examples.)0 5102 y(F)-8 b(or)30 b(complex)h(or)e(commonly)h(used)f(op)s(erations,)i(one)e(can)h(also)h (place)g(the)e(op)s(erations)h(in)m(to)h(an)e(external)i(text)0 5215 y(\014le)g(and)f(imp)s(ort)g(it)h(in)m(to)h(the)f(column)g (\014lter)f(using)h(the)g(syn)m(tax)g('[col)h(@\014lename.txt]'.)43 b(The)31 b(op)s(erations)g(can)0 5328 y(extend)k(o)m(v)m(er)h(m)m (ultiple)g(lines)f(of)g(the)g(\014le,)h(but)e(m)m(ultiple)i(op)s (erations)f(m)m(ust)f(still)i(b)s(e)e(separated)i(b)m(y)e(commas)0 5441 y(or)e(semi-colons.)47 b(An)m(y)32 b(lines)h(in)f(the)g(external)h (text)g(\014le)f(that)h(b)s(egin)e(with)h(2)h(slash)e(c)m(haracters)j (\('//'\))g(will)f(b)s(e)0 5554 y(ignored)d(and)g(ma)m(y)h(b)s(e)f (used)g(to)h(add)e(commen)m(ts)j(in)m(to)f(the)g(\014le.)0 5714 y(Examples:)p eop end %%Page: 96 102 TeXDict begin 96 101 bop 0 299 a Fi(96)1618 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)143 555 y Fe([col)47 b(Time,)f(rate])667 b(-)47 b(only)g(the)g(Time)g(and)g (rate)f(columns)g(will)1670 668 y(appear)h(in)g(the)g(filtered)e(input) i(file.)143 894 y([col)g(Time,)f(*raw])667 b(-)47 b(include)f(the)h (Time)g(column)f(and)h(any)g(other)1670 1007 y(columns)f(whose)h(name)f (ends)h(with)g('raw'.)143 1233 y([col)g(-TIME;)f(Good)h(==)g(STATUS]) 141 b(-)47 b(deletes)f(the)h(TIME)g(column)f(and)1670 1346 y(renames)g(the)h(status)f(column)g(to)i('Good')143 1571 y([col)f(PI=PHA)f(*)h(1.1)g(+)h(0.2;)e(#TUNIT#\(column)e(units\))i (=)i('counts';*])1575 1684 y(-)f(creates)f(new)h(PI)g(column)f(from)h (PHA)g(values)1670 1797 y(and)g(also)g(writes)f(the)h(TUNITn)f(keyword) 1670 1910 y(for)h(the)g(new)g(column.)94 b(The)47 b(final)f('*')1670 2023 y(expression)f(means)i(preserve)e(all)i(the)1670 2136 y(columns)f(in)h(the)g(input)g(table)f(in)h(the)1670 2249 y(virtual)f(output)g(table;)94 b(without)46 b(the)h('*')1670 2362 y(the)g(output)f(table)h(would)f(only)h(contain)1670 2475 y(the)g(single)f('PI')h(column.)143 2700 y([col)g(rate)f(=)i (rate/exposure,)c(TUNIT#\(&\))h(=)j('counts/s';*])1575 2813 y(-)f(recomputes)e(the)i(rate)g(column)f(by)h(dividing)1670 2926 y(it)h(by)f(the)g(EXPOSURE)e(keyword)h(value.)g(This)1670 3039 y(also)h(modifies)f(the)h(value)f(of)h(the)g(TUNITn)1670 3152 y(keyword)f(for)h(this)g(column.)f(The)h(use)f(of)i(the)1670 3265 y('&')f(character)f(for)h(the)f(keyword)g(comment)1670 3378 y(string)h(means)f(preserve)f(the)i(existing)1670 3491 y(comment)f(string)g(for)h(that)g(keyword.)e(The)1670 3604 y(final)i('*')g(preserves)e(all)i(the)g(columns)1670 3717 y(in)h(the)f(input)f(table)g(in)h(the)g(virtual)1670 3830 y(output)g(table.)0 4400 y Fd(8.11)136 b(Ro)l(w)45 b(Filtering)h(Sp)t(eci\014cation)0 4698 y Fi(When)29 b(en)m(tering)h(the)f(name)g(of)g(a)g(FITS)f(table)i(that)g(is)e(to)i (b)s(e)e(op)s(ened)h(b)m(y)f(a)i(program,)f(an)g(optional)h(ro)m(w)f (\014lter)0 4811 y(ma)m(y)i(b)s(e)g(sp)s(eci\014ed)f(to)h(select)h(a)g (subset)e(of)h(the)g(ro)m(ws)f(in)h(the)g(table.)43 b(A)31 b(temp)s(orary)f(new)g(FITS)g(\014le)h(is)g(created)0 4924 y(on)25 b(the)h(\015y)e(whic)m(h)h(con)m(tains)h(only)g(those)g (ro)m(ws)f(for)g(whic)m(h)g(the)g(ro)m(w)g(\014lter)h(expression)f(ev) -5 b(aluates)26 b(to)g(true.)39 b(\(The)0 5036 y(primary)26 b(arra)m(y)h(and)f(an)m(y)g(other)h(extensions)g(in)f(the)h(input)f (\014le)g(are)h(also)h(copied)f(to)g(the)f(temp)s(orary)h(\014le\).)39 b(The)0 5149 y(original)30 b(FITS)f(\014le)g(is)g(closed)h(and)e(the)i (new)e(virtual)i(\014le)f(is)g(op)s(ened)f(b)m(y)h(the)h(application)g (program.)40 b(The)29 b(ro)m(w)0 5262 y(\014lter)37 b(expression)g(is)h (enclosed)g(in)f(square)g(brac)m(k)m(ets)i(follo)m(wing)g(the)e(\014le) h(name)f(and)g(extension)h(name)f(\(e.g.,)0 5375 y('\014le.\014ts[ev)m (en)m(ts][GRADE==50]')29 b(selects)d(only)f(those)h(ro)m(ws)f(where)f (the)h(GRADE)h(column)f(v)-5 b(alue)25 b(equals)g(50\).)0 5488 y(When)33 b(dealing)h(with)f(tables)g(where)g(eac)m(h)h(ro)m(w)f (has)g(an)g(asso)s(ciated)i(time)f(and/or)f(2D)g(spatial)i(p)s (osition,)f(the)0 5601 y(ro)m(w)e(\014lter)h(expression)e(can)i(also)g (b)s(e)f(used)f(to)i(select)h(ro)m(ws)e(based)g(on)g(the)g(times)h(in)f (a)g(Go)s(o)s(d)g(Time)g(In)m(terv)-5 b(als)0 5714 y(\(GTI\))31 b(extension,)g(or)f(on)h(spatial)g(p)s(osition)g(as)f(giv)m(en)i(in)e (a)g(SA)m(O-st)m(yle)i(region)f(\014le.)p eop end %%Page: 97 103 TeXDict begin 97 102 bop 0 299 a Fg(8.11.)73 b(R)m(O)m(W)31 b(FIL)-8 b(TERING)30 b(SPECIFICA)-8 b(TION)2027 b Fi(97)0 555 y Fb(8.11.1)113 b(General)38 b(Syn)m(tax)0 774 y Fi(The)32 b(ro)m(w)h(\014ltering)g(expression)g(can)g(b)s(e)f(an)h (arbitrarily)g(complex)g(series)g(of)g(op)s(erations)g(p)s(erformed)f (on)g(con-)0 887 y(stan)m(ts,)39 b(k)m(eyw)m(ord)e(v)-5 b(alues,)38 b(and)e(column)g(data)i(tak)m(en)f(from)f(the)h(sp)s (eci\014ed)e(FITS)h(T)-8 b(ABLE)37 b(extension.)59 b(The)0 1000 y(expression)37 b(m)m(ust)h(ev)-5 b(aluate)39 b(to)g(a)f(b)s(o)s (olean)g(v)-5 b(alue)38 b(for)f(eac)m(h)i(ro)m(w)f(of)g(the)f(table,)k (where)c(a)h(v)-5 b(alue)39 b(of)e(F)-10 b(ALSE)0 1113 y(means)30 b(that)h(the)g(ro)m(w)f(will)h(b)s(e)f(excluded.)0 1273 y(F)-8 b(or)34 b(complex)g(or)g(commonly)f(used)g(\014lters,)h (one)g(can)g(place)g(the)g(expression)f(in)m(to)h(a)g(text)g(\014le)g (and)f(imp)s(ort)f(it)0 1386 y(in)m(to)38 b(the)e(ro)m(w)h(\014lter)g (using)f(the)h(syn)m(tax)g('[@\014lename.txt]'.)61 b(The)36 b(expression)h(can)f(b)s(e)g(arbitrarily)h(complex)0 1499 y(and)27 b(extend)i(o)m(v)m(er)g(m)m(ultiple)g(lines)f(of)g(the)h (\014le.)40 b(An)m(y)28 b(lines)g(in)g(the)g(external)h(text)g(\014le)f (that)h(b)s(egin)f(with)g(2)g(slash)0 1612 y(c)m(haracters)k(\('//'\))g (will)f(b)s(e)f(ignored)g(and)g(ma)m(y)h(b)s(e)f(used)f(to)i(add)f (commen)m(ts)h(in)m(to)h(the)e(\014le.)0 1772 y(Keyw)m(ord)37 b(and)f(column)g(data)i(are)f(referenced)g(b)m(y)g(name.)60 b(An)m(y)37 b(string)f(of)h(c)m(haracters)i(not)e(surrounded)d(b)m(y)0 1885 y(quotes)41 b(\(ie,)j(a)d(constan)m(t)h(string\))f(or)f(follo)m(w) m(ed)i(b)m(y)f(an)f(op)s(en)g(paren)m(theses)h(\(ie,)j(a)d(function)f (name\))h(will)g(b)s(e)0 1998 y(initially)d(in)m(terpreted)e(as)h(a)g (column)f(name)g(and)g(its)h(con)m(ten)m(ts)h(for)e(the)h(curren)m(t)f (ro)m(w)g(inserted)g(in)m(to)i(the)e(ex-)0 2111 y(pression.)k(If)28 b(no)h(suc)m(h)g(column)g(exists,)h(a)g(k)m(eyw)m(ord)f(of)h(that)f (name)g(will)h(b)s(e)e(searc)m(hed)i(for)f(and)f(its)i(v)-5 b(alue)29 b(used,)0 2223 y(if)36 b(found.)55 b(T)-8 b(o)36 b(force)g(the)g(name)g(to)h(b)s(e)e(in)m(terpreted)h(as)g(a)g(k)m(eyw)m (ord)g(\(in)g(case)g(there)g(is)g(b)s(oth)f(a)h(column)g(and)0 2336 y(k)m(eyw)m(ord)41 b(with)e(the)i(same)f(name\),)j(precede)d(the)h (k)m(eyw)m(ord)f(name)g(with)g(a)h(single)f(p)s(ound)e(sign,)43 b('#',)g(as)d(in)0 2449 y('#NAXIS2'.)g(Due)27 b(to)g(the)f (generalities)j(of)d(FITS)g(column)g(and)g(k)m(eyw)m(ord)h(names,)g(if) f(the)h(column)f(or)g(k)m(eyw)m(ord)0 2562 y(name)33 b(con)m(tains)h(a)f(space)h(or)f(a)g(c)m(haracter)h(whic)m(h)f(migh)m (t)h(app)s(ear)e(as)h(an)g(arithmetic)h(term)f(then)g(enclose)h(the)0 2675 y(name)c(in)g('$')i(c)m(haracters)g(as)e(in)g($MAX)i(PHA$)f(or)f (#$MAX-PHA$.)43 b(Names)31 b(are)f(case)i(insensitiv)m(e.)0 2835 y(T)-8 b(o)32 b(access)g(a)g(table)g(en)m(try)g(in)f(a)h(ro)m(w)f (other)h(than)f(the)g(curren)m(t)g(one,)h(follo)m(w)h(the)e(column's)h (name)f(with)g(a)h(ro)m(w)0 2948 y(o\013set)37 b(within)e(curly)g (braces.)57 b(F)-8 b(or)36 b(example,)i('PHA)p Fc(f)p Fi(-3)p Fc(g)p Fi(')g(will)e(ev)-5 b(aluate)38 b(to)e(the)g(v)-5 b(alue)36 b(of)g(column)f(PHA,)i(3)0 3061 y(ro)m(ws)28 b(ab)s(o)m(v)m(e)i(the)e(ro)m(w)h(curren)m(tly)f(b)s(eing)g(pro)s (cessed.)40 b(One)28 b(cannot)h(sp)s(ecify)f(an)g(absolute)h(ro)m(w)f (n)m(um)m(b)s(er,)g(only)h(a)0 3174 y(relativ)m(e)j(o\013set.)42 b(Ro)m(ws)31 b(that)g(fall)g(outside)g(the)f(table)h(will)g(b)s(e)f (treated)h(as)g(unde\014ned,)d(or)j(NULLs.)0 3334 y(Bo)s(olean)h(op)s (erators)f(can)g(b)s(e)f(used)f(in)i(the)f(expression)h(in)f(either)h (their)g(F)-8 b(ortran)31 b(or)f(C)h(forms.)40 b(The)30 b(follo)m(wing)0 3447 y(b)s(o)s(olean)g(op)s(erators)h(are)g(a)m(v)-5 b(ailable:)191 3698 y Fe("equal")428 b(.eq.)46 b(.EQ.)h(==)95 b("not)46 b(equal")476 b(.ne.)94 b(.NE.)h(!=)191 3811 y("less)46 b(than")238 b(.lt.)46 b(.LT.)h(<)143 b("less)46 b(than/equal")188 b(.le.)94 b(.LE.)h(<=)47 b(=<)191 3923 y("greater)e(than")95 b(.gt.)46 b(.GT.)h(>)143 b("greater)45 b(than/equal")g(.ge.)94 b(.GE.)h(>=)47 b(=>)191 4036 y("or")572 b(.or.)46 b(.OR.)h(||)95 b("and")762 b(.and.)46 b(.AND.)h(&&)191 4149 y("negation")236 b(.not.)46 b(.NOT.)h(!)95 b("approx.)45 b(equal\(1e-7\)")92 b(~)0 4400 y Fi(Note)32 b(that)g(the)f(exclamation)i(p)s(oin)m(t,)e(')10 b(!',)33 b(is)e(a)g(sp)s(ecial)g(UNIX)h(c)m(haracter,)h(so)e(if)g(it)g(is)g (used)f(on)h(the)g(command)0 4513 y(line)i(rather)f(than)h(en)m(tered)g (at)g(a)g(task)g(prompt,)g(it)g(m)m(ust)f(b)s(e)g(preceded)h(b)m(y)f(a) h(bac)m(kslash)g(to)h(force)f(the)g(UNIX)0 4626 y(shell)e(to)g(ignore)g (it.)0 4786 y(The)h(expression)g(ma)m(y)i(also)f(include)f(arithmetic)i (op)s(erators)f(and)f(functions.)47 b(T)-8 b(rigonometric)34 b(functions)e(use)0 4899 y(radians,)23 b(not)g(degrees.)38 b(The)22 b(follo)m(wing)h(arithmetic)g(op)s(erators)g(and)e(functions)g (can)i(b)s(e)e(used)g(in)h(the)g(expression)0 5012 y(\(function)38 b(names)f(are)h(case)g(insensitiv)m(e\).)64 b(A)37 b(n)m(ull)h(v)-5 b(alue)38 b(will)f(b)s(e)g(returned)g(in)g(case)h(of)g(illegal)i(op)s (erations)0 5125 y(suc)m(h)30 b(as)h(divide)f(b)m(y)g(zero,)i (sqrt\(negativ)m(e\))h(log\(negativ)m(e\),)h(log10\(negativ)m(e\),)i (arccos\(.gt.)43 b(1\),)32 b(arcsin\(.gt.)42 b(1\).)191 5375 y Fe("addition")522 b(+)477 b("subtraction")d(-)191 5488 y("multiplication")234 b(*)477 b("division")618 b(/)191 5601 y("negation")522 b(-)477 b("exponentiation")330 b(**)143 b(^)191 5714 y("absolute)45 b(value")237 b(abs\(x\))g ("cosine")714 b(cos\(x\))p eop end %%Page: 98 104 TeXDict begin 98 103 bop 0 299 a Fi(98)1618 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)191 555 y Fe("sine")714 b(sin\(x\))237 b("tangent")666 b(tan\(x\))191 668 y("arc)47 b(cosine")427 b(arccos\(x\))93 b("arc)47 b(sine")619 b(arcsin\(x\))191 781 y("arc)47 b(tangent")379 b(arctan\(x\))93 b("arc)47 b(tangent")475 b(arctan2\(y,x\))191 894 y("hyperbolic)45 b(cos")237 b(cosh\(x\))189 b("hyperbolic)45 b(sin")333 b(sinh\(x\))191 1007 y("hyperbolic)45 b(tan")237 b(tanh\(x\))189 b("round)46 b(to)h(nearest)f(int")h(round\(x\))191 1120 y("round)f(down)h(to)g(int")94 b(floor\(x\))141 b("round)46 b(up)h(to)h(int")285 b(ceil\(x\))191 1233 y("exponential")378 b(exp\(x\))237 b("square)46 b(root")476 b(sqrt\(x\))191 1346 y("natural)45 b(log")381 b(log\(x\))237 b("common)46 b(log")524 b(log10\(x\))191 1458 y("modulus")570 b(x)48 b(\045)f(y)286 b("random)46 b(#)h([0.0,1.0\)")141 b(random\(\))191 1571 y("random)46 b(Gaussian")188 b(randomn\(\))93 b("random)46 b(Poisson")332 b(randomp\(x\))191 1684 y("minimum")570 b(min\(x,y\))141 b("maximum")666 b(max\(x,y\))191 1797 y("cumulative)45 b(sum")237 b(accum\(x\))93 b("sequential)45 b(difference")g(seqdiff\(x\))191 1910 y("if-then-else")330 b(b?x:y)191 2023 y("angular)45 b(separation")93 b (angsep\(ra1,dec1,ra2,de2\))41 b(\(all)47 b(in)g(degrees\))191 2136 y("substring")283 b(strmid\(s,p,n\))44 b("string)i(search")428 b(strstr\(s,r\))0 2382 y Fi(Three)30 b(di\013eren)m(t)h(random)f(n)m (um)m(b)s(er)f(functions)h(are)h(pro)m(vided:)41 b(random\(\),)30 b(with)h(no)f(argumen)m(ts,)h(pro)s(duces)f(a)0 2495 y(uniform)g(random)f(deviate)k(b)s(et)m(w)m(een)e(0)g(and)f(1;)i (randomn\(\),)e(also)i(with)e(no)h(argumen)m(ts,)g(pro)s(duces)f(a)h (normal)0 2608 y(\(Gaussian\))k(random)e(deviate)j(with)e(zero)h(mean)f (and)g(unit)f(standard)h(deviation;)j(randomp\(x\))d(pro)s(duces)f(a)0 2721 y(P)m(oisson)27 b(random)f(deviate)h(whose)f(exp)s(ected)h(n)m(um) m(b)s(er)e(of)h(coun)m(ts)h(is)g(X.)f(X)h(ma)m(y)g(b)s(e)e(an)m(y)i(p)s (ositiv)m(e)g(real)g(n)m(um)m(b)s(er)0 2833 y(of)k(exp)s(ected)f(coun)m (ts,)h(including)f(fractional)i(v)-5 b(alues,)31 b(but)f(the)g(return)g (v)-5 b(alue)31 b(is)f(an)g(in)m(teger.)0 2994 y(When)d(the)g(random)g (functions)f(are)i(used)e(in)h(a)h(v)m(ector)g(expression,)g(b)m(y)f (default)h(the)f(same)h(random)e(v)-5 b(alue)28 b(will)0 3107 y(b)s(e)g(used)f(when)h(ev)-5 b(aluating)30 b(eac)m(h)f(elemen)m (t)h(of)f(the)g(v)m(ector.)41 b(If)28 b(di\013eren)m(t)h(random)f(n)m (um)m(b)s(ers)f(are)i(desired,)f(then)0 3219 y(the)37 b(name)g(of)g(a)g(v)m(ector)i(column)e(should)e(b)s(e)i(supplied)e(as)i (the)h(single)f(argumen)m(t)g(to)h(the)f(random)f(function)0 3332 y(\(e.g.,)31 b("\015ux)c(+)h(0.1)h(*)g(random\(\015ux\)",)f(where) g("\015ux')g(is)g(the)g(name)h(of)f(a)h(v)m(ector)h(column\).)40 b(This)27 b(will)i(create)h(a)0 3445 y(v)m(ector)d(of)f(random)f(n)m (um)m(b)s(ers)f(that)i(will)g(b)s(e)f(used)f(in)i(sequence)g(when)e(ev) -5 b(aluating)27 b(eac)m(h)g(elemen)m(t)g(of)f(the)f(v)m(ector)0 3558 y(expression.)0 3718 y(An)31 b(alternate)i(syn)m(tax)f(for)f(the)g (min)g(and)g(max)g(functions)g(has)g(only)g(a)h(single)g(argumen)m(t)g (whic)m(h)f(should)f(b)s(e)h(a)0 3831 y(v)m(ector)g(v)-5 b(alue)30 b(\(see)g(b)s(elo)m(w\).)41 b(The)29 b(result)g(will)h(b)s(e) e(the)i(minim)m(um/maxim)m(um)f(elemen)m(t)h(con)m(tained)h(within)e (the)0 3944 y(v)m(ector.)0 4104 y(The)35 b(accum\(x\))i(function)f (forms)f(the)h(cum)m(ulativ)m(e)i(sum)d(of)h(x,)h(elemen)m(t)h(b)m(y)e (elemen)m(t.)58 b(V)-8 b(ector)38 b(columns)e(are)0 4217 y(supp)s(orted)h(simply)h(b)m(y)g(p)s(erforming)f(the)i(summation)g (pro)s(cess)f(through)f(all)j(the)f(v)-5 b(alues.)65 b(Null)39 b(v)-5 b(alues)39 b(are)0 4330 y(treated)30 b(as)f(0.)41 b(The)29 b(seqdi\013\(x\))h(function)e(forms)h(the)g (sequen)m(tial)i(di\013erence)e(of)h(x,)f(elemen)m(t)i(b)m(y)e(elemen)m (t.)41 b(The)0 4443 y(\014rst)36 b(v)-5 b(alue)38 b(of)f(seqdi\013)g (is)g(the)g(\014rst)g(v)-5 b(alue)37 b(of)g(x.)61 b(A)37 b(single)h(n)m(ull)f(v)-5 b(alue)38 b(in)e(x)h(causes)h(a)f(pair)g(of)g (n)m(ulls)g(in)g(the)0 4556 y(output.)55 b(The)35 b(seqdi\013)g(and)g (accum)g(functions)g(are)h(functional)f(in)m(v)m(erses,)j(i.e.,)g (seqdi\013\(accum\(x\)\))f(==)e(x)g(as)0 4669 y(long)c(as)g(no)f(n)m (ull)g(v)-5 b(alues)31 b(are)g(presen)m(t.)0 4829 y(In)36 b(the)h(if-then-else)i(expression,)f("b?x:y",)i(b)c(is)h(an)g(explicit) h(b)s(o)s(olean)f(v)-5 b(alue)37 b(or)g(expression.)61 b(There)36 b(is)h(no)0 4942 y(automatic)d(t)m(yp)s(e)e(con)m(v)m (ersion)h(from)e(n)m(umeric)h(to)g(b)s(o)s(olean)g(v)-5 b(alues,)33 b(so)f(one)g(needs)f(to)i(use)e("iV)-8 b(al!=0")35 b(instead)0 5055 y(of)30 b(merely)g("iV)-8 b(al")32 b(as)e(the)g(b)s(o) s(olean)g(argumen)m(t.)41 b(x)30 b(and)f(y)h(can)g(b)s(e)f(an)m(y)h (scalar)h(data)g(t)m(yp)s(e)f(\(including)f(string\).)0 5215 y(The)22 b(angsep)g(function)f(computes)i(the)f(angular)g (separation)h(in)e(degrees)i(b)s(et)m(w)m(een)g(2)f(celestial)j(p)s (ositions,)e(where)0 5328 y(the)36 b(\014rst)f(2)h(parameters)g(giv)m (e)h(the)f(RA-lik)m(e)i(and)d(Dec-lik)m(e)j(co)s(ordinates)f(\(in)f (decimal)g(degrees\))h(of)f(the)g(\014rst)0 5441 y(p)s(osition,)31 b(and)e(the)i(3rd)f(and)g(4th)g(parameters)h(giv)m(e)h(the)e(co)s (ordinates)i(of)e(the)h(second)f(p)s(osition.)0 5601 y(The)38 b(substring)f(function)i(strmid\(S,P)-8 b(,N\))39 b(extracts)g(a)g(substring)f(from)g(S,)g(starting)h(at)g(string)g(p)s (osition)f(P)-8 b(,)0 5714 y(with)33 b(a)h(substring)f(length)h(N.)g (The)f(\014rst)g(c)m(haracter)j(p)s(osition)d(in)h(S)f(is)h(lab)s(eled) g(as)g(1.)51 b(If)33 b(P)g(is)h(0,)h(or)f(refers)f(to)p eop end %%Page: 99 105 TeXDict begin 99 104 bop 0 299 a Fg(8.11.)73 b(R)m(O)m(W)31 b(FIL)-8 b(TERING)30 b(SPECIFICA)-8 b(TION)2027 b Fi(99)0 555 y(a)35 b(p)s(osition)g(b)s(ey)m(ond)f(the)h(end)e(of)i(S,)g(then)f (the)h(extracted)h(substring)d(will)i(b)s(e)f(NULL.)h(S,)f(P)-8 b(,)36 b(and)e(N)g(ma)m(y)i(b)s(e)0 668 y(functions)30 b(of)g(other)h(columns.)0 828 y(The)39 b(string)h(searc)m(h)h(function) e(strstr\(S,R\))h(searc)m(hes)h(for)f(the)g(\014rst)f(o)s(ccurrence)h (of)g(the)g(substring)f(R)h(in)f(S.)0 941 y(The)c(result)h(is)f(an)h (in)m(teger,)i(indicating)f(the)e(c)m(haracter)i(p)s(osition)f(of)g (the)g(\014rst)e(matc)m(h)j(\(where)e(1)h(is)g(the)g(\014rst)0 1054 y(c)m(haracter)c(p)s(osition)e(of)h(S\).)f(If)g(no)h(matc)m(h)g (is)f(found,)g(then)g(strstr\(\))g(returns)f(a)i(NULL)f(v)-5 b(alue.)0 1214 y(The)37 b(follo)m(wing)i(t)m(yp)s(e)f(casting)g(op)s (erators)g(are)g(a)m(v)-5 b(ailable,)42 b(where)37 b(the)h(enclosing)g (paren)m(theses)g(are)g(required)0 1327 y(and)30 b(tak)m(en)h(from)f (the)h(C)f(language)h(usage.)42 b(Also,)31 b(the)g(in)m(teger)g(to)h (real)f(casts)g(v)-5 b(alues)30 b(to)i(double)e(precision:)764 1593 y Fe("real)46 b(to)h(integer")189 b(\(int\))46 b(x)239 b(\(INT\))46 b(x)764 1706 y("integer)f(to)i(real")190 b(\(float\))46 b(i)143 b(\(FLOAT\))45 b(i)0 1972 y Fi(In)30 b(addition,)g(sev)m(eral)i(constan)m(ts)g(are)f(built)f(in)g(for)g(use) g(in)g(n)m(umerical)h(expressions:)382 2238 y Fe(#pi)667 b(3.1415...)284 b(#e)620 b(2.7182...)382 2351 y(#deg)f(#pi/180)380 b(#row)524 b(current)46 b(row)h(number)382 2464 y(#null)428 b(undefined)45 b(value)142 b(#snull)428 b(undefined)45 b(string)0 2730 y Fi(A)40 b(string)f(constan)m(t)i(m)m(ust)e(b)s(e)g (enclosed)h(in)g(quotes)g(as)f(in)h('Crab'.)67 b(The)39 b("n)m(ull")i(constan)m(ts)f(are)g(useful)f(for)0 2843 y(conditionally)g(setting)g(table)g(v)-5 b(alues)38 b(to)g(a)g(NULL,)g (or)g(unde\014ned,)f(v)-5 b(alue)39 b(\(eg.,)i("col1==-99)f(?)62 b(#NULL)38 b(:)0 2955 y(col1"\).)0 3116 y(There)27 b(is)g(also)i(a)e (function)g(for)h(testing)g(if)f(t)m(w)m(o)i(v)-5 b(alues)28 b(are)g(close)g(to)h(eac)m(h)f(other,)h(i.e.,)g(if)e(they)h(are)g ("near")g(eac)m(h)0 3229 y(other)c(to)h(within)e(a)h(user)g(sp)s (eci\014ed)f(tolerance.)40 b(The)24 b(argumen)m(ts,)h(v)-5 b(alue)p 2502 3229 28 4 v 34 w(1)24 b(and)f(v)-5 b(alue)p 2979 3229 V 33 w(2)25 b(can)f(b)s(e)f(in)m(teger)i(or)f(real)0 3341 y(and)32 b(represen)m(t)h(the)g(t)m(w)m(o)h(v)-5 b(alues)33 b(who's)f(pro)m(ximit)m(y)i(is)f(b)s(eing)f(tested)h(to)h(b) s(e)e(within)g(the)h(sp)s(eci\014ed)f(tolerance,)0 3454 y(also)f(an)g(in)m(teger)g(or)g(real:)955 3720 y Fe(near\(value_1,)44 b(value_2,)h(tolerance\))0 3986 y Fi(When)24 b(a)i(NULL,)e(or)h (unde\014ned,)f(v)-5 b(alue)25 b(is)g(encoun)m(tered)g(in)g(the)f(FITS) g(table,)j(the)e(expression)g(will)g(ev)-5 b(aluate)26 b(to)0 4099 y(NULL)31 b(unless)f(the)h(unde\014ned)e(v)-5 b(alue)31 b(is)g(not)g(actually)h(required)e(for)h(ev)-5 b(aluation,)33 b(e.g.)43 b("TR)m(UE)31 b(.or.)43 b(NULL")0 4212 y(ev)-5 b(aluates)32 b(to)f(TR)m(UE.)g(The)f(follo)m(wing)h(t)m(w) m(o)h(functions)e(allo)m(w)i(some)f(NULL)f(detection)i(and)e(handling:) 430 4478 y Fe("a)47 b(null)f(value?")667 b(ISNULL\(x\))430 4591 y("define)45 b(a)j(value)e(for)h(null")190 b(DEFNULL\(x,y\))0 4857 y Fi(The)36 b(former)h(returns)e(a)i(b)s(o)s(olean)g(v)-5 b(alue)37 b(of)g(TR)m(UE)g(if)g(the)g(argumen)m(t)g(x)g(is)g(NULL.)g (The)f(later)i("de\014nes")f(a)0 4970 y(v)-5 b(alue)35 b(to)g(b)s(e)e(substituted)h(for)g(NULL)g(v)-5 b(alues;)37 b(it)e(returns)e(the)h(v)-5 b(alue)35 b(of)f(x)g(if)g(x)h(is)f(not)g (NULL,)h(otherwise)f(it)0 5083 y(returns)29 b(the)i(v)-5 b(alue)31 b(of)f(y)-8 b(.)0 5381 y Fb(8.11.2)113 b(Bit)36 b(Masks)0 5601 y Fi(Bit)g(masks)f(can)h(b)s(e)f(used)f(to)i(select)h (out)e(ro)m(ws)h(from)e(bit)i(columns)f(\(TF)m(ORMn)g(=)g(#X\))h(in)f (FITS)f(\014les.)55 b(T)-8 b(o)0 5714 y(represen)m(t)30 b(the)h(mask,)g(binary)-8 b(,)30 b(o)s(ctal,)i(and)e(hex)g(formats)g (are)h(allo)m(w)m(ed:)p eop end %%Page: 100 106 TeXDict begin 100 105 bop 0 299 a Fi(100)1573 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)811 555 y Fe(binary:)142 b(b0110xx1010000101xxxx00)o(01)811 668 y(octal:)190 b(o720x1)46 b(->)h(\(b111010000xxx001\))811 781 y(hex:)286 b(h0FxD)94 b(->)47 b(\(b00001111xxxx1101\))0 1038 y Fi(In)22 b(all)i(the)f(represen)m(tations,)j(an)c(x)h(or)g(X)g (is)g(allo)m(w)m(ed)i(in)d(the)h(mask)g(as)g(a)h(wild)e(card.)38 b(Note)25 b(that)e(the)g(x)g(represen)m(ts)0 1151 y(a)k(di\013eren)m(t) h(n)m(um)m(b)s(er)e(of)h(wild)f(card)h(bits)g(in)g(eac)m(h)h(represen)m (tation.)41 b(All)27 b(represen)m(tations)h(are)g(case)g(insensitiv)m (e.)0 1311 y(T)-8 b(o)28 b(construct)g(the)g(b)s(o)s(olean)f (expression)h(using)f(the)h(mask)f(as)h(the)g(b)s(o)s(olean)f(equal)h (op)s(erator)g(describ)s(ed)f(ab)s(o)m(v)m(e)0 1424 y(on)34 b(a)h(bit)g(table)h(column.)53 b(F)-8 b(or)35 b(example,)i(if)d(y)m(ou) h(had)f(a)h(7)g(bit)g(column)f(named)g(\015ags)h(in)f(a)h(FITS)f(table) i(and)0 1537 y(w)m(an)m(ted)31 b(all)g(ro)m(ws)g(ha)m(ving)g(the)f(bit) h(pattern)f(0010011,)k(the)c(selection)j(expression)d(w)m(ould)g(b)s (e:)1336 1794 y Fe(flags)47 b(==)g(b0010011)191 1907 y(or)1336 2019 y(flags)g(.eq.)f(b10011)0 2276 y Fi(It)35 b(is)g(also)h(p)s(ossible)e(to)i(test)g(if)f(a)g(range)g(of)g(bits)g (is)g(less)g(than,)h(less)f(than)g(equal,)i(greater)f(than)e(and)h (greater)0 2389 y(than)30 b(equal)h(to)g(a)g(particular)g(b)s(o)s (olean)f(v)-5 b(alue:)1336 2646 y Fe(flags)47 b(<=)g(bxxx010xx)1336 2759 y(flags)g(.gt.)f(bxxx100xx)1336 2872 y(flags)h(.le.)f(b1xxxxxxx)0 3129 y Fi(Notice)32 b(the)f(use)f(of)h(the)f(x)g(bit)h(v)-5 b(alue)31 b(to)g(limit)g(the)f(range)h(of)g(bits)f(b)s(eing)g (compared.)0 3289 y(It)i(is)h(not)f(necessary)h(to)g(sp)s(ecify)f(the)h (leading)g(\(most)g(signi\014can)m(t\))h(zero)f(\(0\))g(bits)f(in)g (the)h(mask,)g(as)g(sho)m(wn)e(in)0 3402 y(the)g(second)f(expression)g (ab)s(o)m(v)m(e.)0 3562 y(Bit)44 b(wise)f(AND,)h(OR)e(and)g(NOT)h(op)s (erations)g(are)g(also)h(p)s(ossible)e(on)h(t)m(w)m(o)h(or)f(more)g (bit)g(\014elds)f(using)h(the)0 3675 y('&'\(AND\),)35 b(')p Fc(j)p Fi('\(OR\),)g(and)e(the)h(')10 b(!'\(NOT\))34 b(op)s(erators.)51 b(All)34 b(of)f(these)h(op)s(erators)g(result)f(in)h (a)g(bit)f(\014eld)g(whic)m(h)0 3788 y(can)e(then)f(b)s(e)f(used)h (with)g(the)h(equal)g(op)s(erator.)41 b(F)-8 b(or)31 b(example:)1241 4045 y Fe(\(!flags\))45 b(==)j(b1101100)1241 4158 y(\(flags)e(&)h(b1000001\))f(==)h(bx000001)0 4414 y Fi(Bit)35 b(\014elds)f(can)g(b)s(e)f(app)s(ended)g(as)h(w)m(ell)h (using)f(the)g('+')g(op)s(erator.)53 b(Strings)33 b(can)i(b)s(e)e (concatenated)j(this)e(w)m(a)m(y)-8 b(,)0 4527 y(to)s(o.)0 4818 y Fb(8.11.3)113 b(V)-9 b(ector)36 b(Columns)0 5036 y Fi(V)-8 b(ector)37 b(columns)e(can)h(also)g(b)s(e)f(used)f(in)h (building)g(the)g(expression.)56 b(No)36 b(sp)s(ecial)g(syn)m(tax)f(is) h(required)e(if)i(one)0 5149 y(w)m(an)m(ts)46 b(to)f(op)s(erate)h(on)f (all)h(elemen)m(ts)g(of)f(the)h(v)m(ector.)86 b(Simply)44 b(use)h(the)g(column)g(name)g(as)g(for)g(a)g(scalar)0 5262 y(column.)d(V)-8 b(ector)32 b(columns)f(can)g(b)s(e)f(freely)h(in) m(termixed)h(with)e(scalar)i(columns)e(or)h(constan)m(ts)h(in)f (virtually)g(all)0 5375 y(expressions.)40 b(The)29 b(result)g(will)g(b) s(e)g(of)g(the)g(same)h(dimension)e(as)i(the)f(v)m(ector.)42 b(Tw)m(o)29 b(v)m(ectors)i(in)e(an)g(expression,)0 5488 y(though,)f(need)e(to)i(ha)m(v)m(e)g(the)f(same)g(n)m(um)m(b)s(er)f(of) h(elemen)m(ts)h(and)e(ha)m(v)m(e)j(the)e(same)g(dimensions.)39 b(The)26 b(only)h(places)0 5601 y(a)35 b(v)m(ector)h(column)e(cannot)h (b)s(e)f(used)f(\(for)i(no)m(w,)g(an)m(yw)m(a)m(y\))h(are)f(the)g(SA)m (O)f(region)h(functions)f(and)f(the)i(NEAR)0 5714 y(b)s(o)s(olean)30 b(function.)p eop end %%Page: 101 107 TeXDict begin 101 106 bop 0 299 a Fg(8.11.)73 b(R)m(O)m(W)31 b(FIL)-8 b(TERING)30 b(SPECIFICA)-8 b(TION)1982 b Fi(101)0 555 y(Arithmetic)24 b(and)e(logical)k(op)s(erations)d(are)h(all)g(p)s (erformed)d(on)i(an)g(elemen)m(t)h(b)m(y)f(elemen)m(t)i(basis.)38 b(Comparing)23 b(t)m(w)m(o)0 668 y(v)m(ector)32 b(columns,)e(eg)h ("COL1)f(==)g(COL2",)g(th)m(us)g(results)g(in)g(another)g(v)m(ector)i (of)e(b)s(o)s(olean)h(v)-5 b(alues)30 b(indicating)0 781 y(whic)m(h)g(elemen)m(ts)i(of)e(the)h(t)m(w)m(o)h(v)m(ectors)f(are) g(equal.)0 941 y(Eigh)m(t)g(functions)f(are)h(a)m(v)-5 b(ailable)33 b(that)e(op)s(erate)g(on)f(a)h(v)m(ector)h(and)d(return)h (a)g(scalar)i(result:)191 1172 y Fe("minimum")284 b(MIN\(V\))475 b("maximum")714 b(MAX\(V\))191 1285 y("average")284 b(AVERAGE\(V\))f ("median")762 b(MEDIAN\(V\))191 1398 y("summation")188 b(SUM\(V\))475 b("standard)46 b(deviation")188 b(STDDEV\(V\))191 1511 y("#)47 b(of)g(values")94 b(NELEM\(V\))379 b("#)48 b(of)f(non-null)e(values")94 b(NVALID\(V\))0 1742 y Fi(where)40 b(V)h(represen)m(ts)g(the)g(name)g(of)h(a)f(v)m(ector)h(column)f(or)g (a)h(man)m(ually)f(constructed)g(v)m(ector)i(using)d(curly)0 1854 y(brac)m(k)m(ets)27 b(as)f(describ)s(ed)e(b)s(elo)m(w.)39 b(The)25 b(\014rst)g(6)h(of)g(these)g(functions)f(ignore)h(an)m(y)g(n)m (ull)f(v)-5 b(alues)26 b(in)f(the)h(v)m(ector)h(when)0 1967 y(computing)k(the)f(result.)41 b(The)30 b(STDDEV\(\))h(function)g (computes)f(the)h(sample)g(standard)e(deviation,)j(i.e.)42 b(it)31 b(is)0 2080 y(prop)s(ortional)f(to)h(1/SQR)-8 b(T\(N-1\))32 b(instead)f(of)g(1/SQR)-8 b(T\(N\),)31 b(where)f(N)h(is)f(NV)-10 b(ALID\(V\).)0 2240 y(The)32 b(SUM)h(function)f(literally)j(sums)c(all)j(the)f(elemen)m(ts)h(in)f (x,)g(returning)f(a)h(scalar)h(v)-5 b(alue.)48 b(If)32 b(x)h(is)g(a)g(b)s(o)s(olean)0 2353 y(v)m(ector,)40 b(SUM)c(returns)f (the)h(n)m(um)m(b)s(er)f(of)i(TR)m(UE)f(elemen)m(ts.)60 b(The)36 b(NELEM)g(function)g(returns)f(the)h(n)m(um)m(b)s(er)0 2466 y(of)i(elemen)m(ts)h(in)f(v)m(ector)h(x)f(whereas)f(NV)-10 b(ALID)39 b(return)d(the)i(n)m(um)m(b)s(er)f(of)h(non-n)m(ull)f(elemen) m(ts)j(in)d(the)h(v)m(ector.)0 2579 y(\(NELEM)28 b(also)h(op)s(erates)f (on)g(bit)f(and)g(string)h(columns,)g(returning)f(their)h(column)f (widths.\))40 b(As)27 b(an)h(example,)0 2692 y(to)42 b(test)g(whether)f(all)h(elemen)m(ts)h(of)f(t)m(w)m(o)g(v)m(ectors)h (satisfy)f(a)g(giv)m(en)g(logical)i(comparison,)g(one)e(can)g(use)f (the)0 2805 y(expression)668 3036 y Fe(SUM\()47 b(COL1)f(>)i(COL2)f(\)) g(==)g(NELEM\()f(COL1)h(\))0 3267 y Fi(whic)m(h)32 b(will)g(return)f (TR)m(UE)h(if)g(all)h(elemen)m(ts)g(of)f(COL1)g(are)g(greater)h(than)f (their)g(corresp)s(onding)f(elemen)m(ts)i(in)0 3380 y(COL2.)0 3540 y(T)-8 b(o)32 b(sp)s(ecify)f(a)i(single)f(elemen)m(t)h(of)f(a)g(v) m(ector,)i(giv)m(e)f(the)f(column)f(name)h(follo)m(w)m(ed)h(b)m(y)f(a)g (comma-separated)h(list)0 3653 y(of)c(co)s(ordinates)g(enclosed)h(in)e (square)h(brac)m(k)m(ets.)41 b(F)-8 b(or)30 b(example,)g(if)e(a)h(v)m (ector)i(column)d(named)h(PHAS)f(exists)h(in)0 3766 y(the)e(table)g(as) g(a)g(one)g(dimensional,)h(256)g(comp)s(onen)m(t)f(list)g(of)g(n)m(um)m (b)s(ers)e(from)h(whic)m(h)h(y)m(ou)g(w)m(an)m(ted)g(to)g(select)i(the) 0 3878 y(57th)j(comp)s(onen)m(t)g(for)f(use)g(in)g(the)h(expression,)f (then)h(PHAS[57])g(w)m(ould)f(do)h(the)f(tric)m(k.)45 b(Higher)32 b(dimensional)0 3991 y(arra)m(ys)41 b(of)h(data)f(ma)m(y)h (app)s(ear)f(in)f(a)i(column.)73 b(But)41 b(in)g(order)f(to)i(in)m (terpret)f(them,)j(the)e(TDIMn)e(k)m(eyw)m(ord)0 4104 y(m)m(ust)34 b(app)s(ear)g(in)g(the)g(header.)52 b(Assuming)34 b(that)h(a)f(\(4,4,4,4\))k(arra)m(y)c(is)h(pac)m(k)m(ed)g(in)m(to)g (eac)m(h)h(ro)m(w)e(of)g(a)h(column)0 4217 y(named)26 b(ARRA)-8 b(Y4D,)28 b(the)f(\(1,2,3,4\))i(comp)s(onen)m(t)e(elemen)m(t) g(of)g(eac)m(h)g(ro)m(w)g(is)f(accessed)i(b)m(y)e(ARRA)-8 b(Y4D[1,2,3,4].)0 4330 y(Arra)m(ys)33 b(up)e(to)j(dimension)e(5)h(are)f (curren)m(tly)h(supp)s(orted.)46 b(Eac)m(h)33 b(v)m(ector)h(index)e (can)h(itself)g(b)s(e)f(an)h(expression,)0 4443 y(although)39 b(it)g(m)m(ust)g(ev)-5 b(aluate)40 b(to)f(an)g(in)m(teger)h(v)-5 b(alue)39 b(within)f(the)h(b)s(ounds)d(of)j(the)g(v)m(ector.)67 b(V)-8 b(ector)40 b(columns)0 4556 y(whic)m(h)31 b(con)m(tain)h(spaces) g(or)f(arithmetic)h(op)s(erators)g(m)m(ust)f(ha)m(v)m(e)h(their)f (names)g(enclosed)h(in)f("$")h(c)m(haracters)h(as)0 4669 y(with)d($ARRA)-8 b(Y-4D$[1,2,3,4].)0 4829 y(A)45 b(more)f(C-lik)m(e)i (syn)m(tax)g(for)e(sp)s(ecifying)g(v)m(ector)j(indices)d(is)h(also)h(a) m(v)-5 b(ailable.)85 b(The)45 b(elemen)m(t)h(used)d(in)i(the)0 4942 y(preceding)28 b(example)h(alternativ)m(ely)i(could)d(b)s(e)g(sp)s (eci\014ed)g(with)f(the)i(syn)m(tax)g(ARRA)-8 b(Y4D[4][3][2][1].)45 b(Note)30 b(the)0 5055 y(rev)m(erse)40 b(order)f(of)h(indices)f(\(as)h (in)f(C\),)h(as)f(w)m(ell)i(as)e(the)h(fact)g(that)g(the)g(v)-5 b(alues)40 b(are)f(still)i(ones-based)e(\(as)h(in)0 5168 y(F)-8 b(ortran)39 b({)g(adopted)g(to)g(a)m(v)m(oid)h(am)m(biguit)m(y)g (for)f(1D)g(v)m(ectors\).)67 b(With)39 b(this)g(syn)m(tax,)i(one)e(do)s (es)f(not)h(need)f(to)0 5281 y(sp)s(ecify)30 b(all)h(of)g(the)f (indices.)41 b(T)-8 b(o)31 b(extract)h(a)f(3D)g(slice)g(of)g(this)f(4D) h(arra)m(y)-8 b(,)32 b(use)e(ARRA)-8 b(Y4D[4].)0 5441 y(V)g(ariable-length)33 b(v)m(ector)f(columns)e(are)g(not)h(supp)s (orted.)0 5601 y(V)-8 b(ectors)24 b(can)e(b)s(e)f(man)m(ually)h (constructed)h(within)e(the)h(expression)g(using)f(a)h(comma-separated) i(list)f(of)f(elemen)m(ts)0 5714 y(surrounded)35 b(b)m(y)j(curly)g (braces)h(\(')p Fc(fg)p Fi('\).)66 b(F)-8 b(or)38 b(example,)j(')p Fc(f)p Fi(1,3,6,1)p Fc(g)p Fi(')h(is)d(a)f(4-elemen)m(t)i(v)m(ector)g (con)m(taining)g(the)p eop end %%Page: 102 108 TeXDict begin 102 107 bop 0 299 a Fi(102)1573 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fi(v)j(alues)26 b(1,)h(3,)g(6,)g(and)e(1.)40 b(The)25 b(v)m(ector)i(can)f(con)m(tain)h(only)f(b)s(o)s(olean,)g(in)m(teger,)j (and)c(real)h(v)-5 b(alues)26 b(\(or)g(expressions\).)0 668 y(The)e(elemen)m(ts)h(will)g(b)s(e)f(promoted)g(to)h(the)g(highest) f(datat)m(yp)s(e)h(presen)m(t.)39 b(An)m(y)24 b(elemen)m(ts)i(whic)m(h) e(are)h(themselv)m(es)0 781 y(v)m(ectors,)40 b(will)d(b)s(e)f(expanded) g(out)h(with)g(eac)m(h)g(of)g(its)g(elemen)m(ts)i(b)s(ecoming)d(an)h (elemen)m(t)h(in)f(the)g(constructed)0 894 y(v)m(ector.)0 1247 y Fb(8.11.4)113 b(Go)s(o)s(d)38 b(Time)g(In)m(terv)-6 b(al)37 b(Filtering)0 1479 y Fi(A)44 b(common)g(\014ltering)h(metho)s (d)e(in)m(v)m(olv)m(es)j(selecting)g(ro)m(ws)e(whic)m(h)f(ha)m(v)m(e)j (a)e(time)h(v)-5 b(alue)44 b(whic)m(h)g(lies)g(within)0 1592 y(what)37 b(is)g(called)i(a)f(Go)s(o)s(d)f(Time)g(In)m(terv)-5 b(al)38 b(or)f(GTI.)g(The)g(time)h(in)m(terv)-5 b(als)38 b(are)g(de\014ned)e(in)h(a)g(separate)i(FITS)0 1705 y(table)i (extension)g(whic)m(h)e(con)m(tains)i(2)g(columns)f(giving)g(the)h (start)f(and)g(stop)g(time)g(of)g(eac)m(h)i(go)s(o)s(d)e(in)m(terv)-5 b(al.)0 1818 y(The)34 b(\014ltering)h(op)s(eration)h(accepts)g(only)e (those)i(ro)m(ws)e(of)h(the)g(input)f(table)i(whic)m(h)e(ha)m(v)m(e)i (an)f(asso)s(ciated)h(time)0 1930 y(whic)m(h)f(falls)i(within)e(one)h (of)g(the)g(time)g(in)m(terv)-5 b(als)37 b(de\014ned)e(in)g(the)h(GTI)g (extension.)57 b(A)36 b(high)g(lev)m(el)h(function,)0 2043 y(gti\014lter\(a,b,c,d\),)44 b(is)c(a)m(v)-5 b(ailable)42 b(whic)m(h)d(ev)-5 b(aluates)41 b(eac)m(h)g(ro)m(w)e(of)h(the)f(input)g (table)h(and)f(returns)f(TR)m(UE)i(or)0 2156 y(F)-10 b(ALSE)30 b(dep)s(ending)f(whether)h(the)g(ro)m(w)h(is)f(inside)g(or)g (outside)h(the)g(go)s(o)s(d)f(time)h(in)m(terv)-5 b(al.)42 b(The)30 b(syn)m(tax)h(is)286 2469 y Fe(gtifilter\()45 b([)j("gtifile")d([,)i(expr)g([,)g("STARTCOL",)e("STOPCOL")g(])j(])f(]) g(\))0 2782 y Fi(where)20 b(eac)m(h)h("[]")h(demarks)e(optional)h (parameters.)38 b(Note)21 b(that)g(the)g(quotes)f(around)g(the)g (gti\014le)i(and)d(ST)-8 b(AR)g(T/STOP)0 2895 y(column)33 b(are)h(required.)50 b(Either)34 b(single)g(or)g(double)f(quotes)h(ma)m (y)g(b)s(e)f(used.)50 b(In)33 b(cases)h(where)g(this)f(expression)0 3008 y(is)d(en)m(tered)g(on)g(the)g(Unix)g(command)g(line,)g(enclose)h (the)f(en)m(tire)h(expression)f(in)f(double)h(quotes,)g(and)g(then)f (use)0 3121 y(single)c(quotes)g(within)e(the)i(expression)f(to)h (enclose)g(the)g('gti\014le')h(and)d(other)i(terms.)38 b(It)25 b(is)f(also)h(usually)f(p)s(ossible)0 3234 y(to)38 b(do)e(the)h(rev)m(erse,)j(and)c(enclose)i(the)f(whole)g(expression)g (in)f(single)i(quotes)f(and)f(then)h(use)f(double)g(quotes)0 3347 y(within)d(the)g(expression.)50 b(The)33 b(gti\014le,)i(if)f(sp)s (eci\014ed,)f(can)h(b)s(e)f(blank)g(\(""\))i(whic)m(h)e(will)g(mean)h (to)g(use)f(the)h(\014rst)0 3460 y(extension)g(with)g(the)f(name)h ("*GTI*")h(in)f(the)f(curren)m(t)h(\014le,)h(a)f(plain)f(extension)h (sp)s(eci\014er)f(\(eg,)j("+2",)g("[2]",)0 3573 y(or)30 b("[STDGTI]"\))i(whic)m(h)e(will)h(b)s(e)f(used)f(to)j(select)g(an)e (extension)h(in)f(the)h(curren)m(t)f(\014le,)h(or)f(a)h(regular)g (\014lename)0 3686 y(with)f(or)h(without)f(an)h(extension)g(sp)s (eci\014er)f(whic)m(h)g(in)g(the)h(latter)h(case)f(will)g(mean)f(to)i (use)e(the)h(\014rst)e(extension)0 3799 y(with)37 b(an)g(extension)g (name)h("*GTI*".)62 b(Expr)36 b(can)h(b)s(e)g(an)m(y)g(arithmetic)i (expression,)f(including)f(simply)g(the)0 3911 y(time)f(column)g(name.) 57 b(A)36 b(v)m(ector)h(time)g(expression)e(will)h(pro)s(duce)f(a)h(v)m (ector)h(b)s(o)s(olean)f(result.)57 b(ST)-8 b(AR)g(TCOL)0 4024 y(and)27 b(STOPCOL)f(are)i(the)g(names)g(of)g(the)g(ST)-8 b(AR)g(T/STOP)26 b(columns)i(in)f(the)h(GTI)g(extension.)41 b(If)27 b(one)h(of)g(them)0 4137 y(is)i(sp)s(eci\014ed,)g(they)h(b)s (oth)f(m)m(ust)g(b)s(e.)0 4297 y(In)21 b(its)h(simplest)g(form,)i(no)d (parameters)h(need)g(to)h(b)s(e)e(pro)m(vided)g({)h(default)g(v)-5 b(alues)22 b(will)h(b)s(e)e(used.)37 b(The)21 b(expression)0 4410 y("gti\014lter\(\)")33 b(is)e(equiv)-5 b(alen)m(t)31 b(to)334 4723 y Fe(gtifilter\()45 b("",)i(TIME,)f("*START*",)f ("*STOP*")h(\))0 5036 y Fi(This)31 b(will)g(searc)m(h)h(the)g(curren)m (t)f(\014le)g(for)g(a)h(GTI)f(extension,)h(\014lter)g(the)f(TIME)g (column)g(in)g(the)h(curren)m(t)f(table,)0 5149 y(using)j(ST)-8 b(AR)g(T/STOP)34 b(times)i(tak)m(en)f(from)g(columns)f(in)h(the)g(GTI)g (extension)g(with)g(names)f(con)m(taining)j(the)0 5262 y(strings)32 b("ST)-8 b(AR)g(T")33 b(and)e("STOP".)46 b(The)32 b(wildcards)f(\('*'\))j(allo)m(w)g(sligh)m(t)f(v)-5 b(ariations)33 b(in)f(naming)g(con)m(v)m(en)m(tions)0 5375 y(suc)m(h)38 b(as)g("TST)-8 b(AR)g(T")39 b(or)f("ST)-8 b(AR)g(TTIME".)65 b(The)37 b(same)i(default)g(v)-5 b(alues)38 b(apply)g(for)g(unsp)s(eci\014ed)f(parame-)0 5488 y(ters)f(when)f(the)h (\014rst)f(one)i(or)f(t)m(w)m(o)h(parameters)f(are)h(sp)s(eci\014ed.)56 b(The)36 b(function)f(automatically)k(searc)m(hes)e(for)0 5601 y(TIMEZER)m(O/I/F)g(k)m(eyw)m(ords)f(in)g(the)h(curren)m(t)f(and)g (GTI)g(extensions,)i(applying)f(a)f(relativ)m(e)j(time)e(o\013set,)i (if)0 5714 y(necessary)-8 b(.)p eop end %%Page: 103 109 TeXDict begin 103 108 bop 0 299 a Fg(8.11.)73 b(R)m(O)m(W)31 b(FIL)-8 b(TERING)30 b(SPECIFICA)-8 b(TION)1982 b Fi(103)0 555 y Fb(8.11.5)113 b(Spatial)38 b(Region)g(Filtering)0 775 y Fi(Another)g(common)g(\014ltering)g(metho)s(d)f(selects)i(ro)m (ws)f(based)g(on)f(whether)h(the)g(spatial)h(p)s(osition)e(asso)s (ciated)0 887 y(with)32 b(eac)m(h)i(ro)m(w)e(is)h(lo)s(cated)h(within)e (a)h(giv)m(en)g(2-dimensional)g(region.)48 b(The)32 b(syn)m(tax)h(for)f (this)h(high-lev)m(el)h(\014lter)0 1000 y(is)334 1262 y Fe(regfilter\()45 b("regfilename")f([)k(,)f(Xexpr,)f(Yexpr)h([)g(,)h ("wcs)e(cols")h(])g(])g(\))0 1524 y Fi(where)22 b(eac)m(h)i("[]")g (demarks)e(optional)i(parameters.)38 b(The)22 b(region)h(\014le)g(name) f(is)h(required)f(and)g(m)m(ust)g(b)s(e)g(enclosed)0 1637 y(in)34 b(quotes.)51 b(The)33 b(remaining)h(parameters)h(are)f (optional.)52 b(There)33 b(are)i(2)f(supp)s(orted)e(formats)i(for)f (the)h(region)0 1750 y(\014le:)62 b(ASCI)s(I)39 b(\014le)h(or)h(FITS)f (binary)g(table.)73 b(The)40 b(region)h(\014le)g(con)m(tains)h(a)f (list)g(of)g(one)g(or)g(more)g(geometric)0 1863 y(shap)s(es)30 b(\(circle,)j(ellipse,)g(b)s(o)m(x,)e(etc.\))44 b(whic)m(h)31 b(de\014nes)f(a)i(region)g(on)f(the)g(celestial)j(sphere)c(or)h(an)g (area)h(within)f(a)0 1975 y(particular)36 b(2D)g(image.)57 b(The)35 b(region)h(\014le)f(is)g(t)m(ypically)j(generated)e(using)f (an)g(image)i(displa)m(y)e(program)g(suc)m(h)0 2088 y(as)e(fv/PO)m(W)g (\(distribute)f(b)m(y)h(the)f(HEASAR)m(C\),)h(or)g(ds9)f(\(distributed) g(b)m(y)g(the)h(Smithsonian)f(Astroph)m(ysical)0 2201 y(Observ)-5 b(atory\).)69 b(Users)39 b(should)g(refer)g(to)h(the)g(do)s (cumen)m(tation)h(pro)m(vided)e(with)g(these)h(programs)f(for)h(more)0 2314 y(details)29 b(on)f(the)g(syn)m(tax)h(used)e(in)h(the)h(region)f (\014les.)40 b(The)28 b(FITS)f(region)i(\014le)f(format)h(is)f (de\014ned)f(in)h(a)g(do)s(cumen)m(t)0 2427 y(a)m(v)-5 b(ailable)33 b(from)d(the)g(FITS)g(Supp)s(ort)e(O\016ce)j(at)g(h)m (ttp://\014ts.gsfc.nasa.go)m(v/)k(registry/)c(region.h)m(tml)0 2587 y(In)21 b(its)h(simplest)g(form,)i(\(e.g.,)h (reg\014lter\("region.reg"\))h(\))c(the)g(co)s(ordinates)g(in)g(the)g (default)g('X')h(and)e('Y')h(columns)0 2700 y(will)43 b(b)s(e)g(used)f(to)i(determine)f(if)g(eac)m(h)h(ro)m(w)f(is)g(inside)g (or)g(outside)g(the)g(area)h(sp)s(eci\014ed)e(in)h(the)g(region)h (\014le.)0 2813 y(Alternate)32 b(p)s(osition)e(column)g(names,)h(or)f (expressions,)h(ma)m(y)g(b)s(e)e(en)m(tered)i(if)g(needed,)f(as)h(in) 382 3075 y Fe(regfilter\("region.reg",)41 b(XPOS,)47 b(YPOS\))0 3337 y Fi(Region)37 b(\014ltering)f(can)g(b)s(e)f(applied)g (most)h(unam)m(biguously)f(if)h(the)g(p)s(ositions)g(in)f(the)h(region) g(\014le)g(and)f(in)h(the)0 3449 y(table)g(to)g(b)s(e)e(\014ltered)h (are)h(b)s(oth)e(giv)m(e)j(in)e(terms)g(of)g(absolute)h(celestial)i(co) s(ordinate)e(units.)54 b(In)35 b(this)g(case)h(the)0 3562 y(lo)s(cations)26 b(and)d(sizes)i(of)g(the)f(geometric)i(shap)s (es)e(in)g(the)g(region)h(\014le)f(are)h(sp)s(eci\014ed)f(in)g(angular) g(units)g(on)g(the)g(sky)0 3675 y(\(e.g.,)32 b(p)s(ositions)e(giv)m(en) i(in)e(R.A.)g(and)g(Dec.)42 b(and)30 b(sizes)h(in)f(arcseconds)g(or)h (arcmin)m(utes\).)41 b(Similarly)-8 b(,)31 b(eac)m(h)h(ro)m(w)0 3788 y(of)h(the)h(\014ltered)f(table)h(will)f(ha)m(v)m(e)i(a)e (celestial)j(co)s(ordinate)e(asso)s(ciated)g(with)f(it.)50 b(This)32 b(asso)s(ciation)j(is)e(usually)0 3901 y(implemen)m(ted)39 b(using)e(a)i(set)g(of)f(so-called)i('W)-8 b(orld)39 b(Co)s(ordinate)g(System')f(\(or)h(W)m(CS\))f(FITS)g(k)m(eyw)m(ords)g (that)0 4014 y(de\014ne)27 b(the)g(co)s(ordinate)h(transformation)g (that)g(m)m(ust)f(b)s(e)f(applied)h(to)h(the)g(v)-5 b(alues)27 b(in)g(the)h('X')g(and)e('Y')i(columns)0 4127 y(to)j(calculate)i(the)d (co)s(ordinate.)0 4287 y(Alternativ)m(ely)-8 b(,)30 b(one)d(can)g(p)s (erform)e(spatial)j(\014ltering)e(using)g(unitless)h('pixel')g(co)s (ordinates)h(for)e(the)h(regions)g(and)0 4400 y(ro)m(w)33 b(p)s(ositions.)49 b(In)33 b(this)g(case)h(the)f(user)g(m)m(ust)g(b)s (e)f(careful)h(to)h(ensure)f(that)g(the)h(p)s(ositions)f(in)g(the)g(2)g (\014les)h(are)0 4513 y(self-consisten)m(t.)54 b(A)34 b(t)m(ypical)i(problem)d(is)h(that)h(the)f(region)h(\014le)f(ma)m(y)h (b)s(e)e(generated)j(using)d(a)i(binned)d(image,)0 4626 y(but)g(the)h(un)m(binned)e(co)s(ordinates)i(are)g(giv)m(en)h(in)e(the) h(ev)m(en)m(t)i(table.)48 b(The)32 b(R)m(OSA)-8 b(T)33 b(ev)m(en)m(ts)h(\014les,)g(for)e(example,)0 4739 y(ha)m(v)m(e)f(X)f (and)f(Y)g(pixel)h(co)s(ordinates)g(that)h(range)f(from)f(1)h(-)g (15360.)42 b(These)30 b(co)s(ordinates)g(are)g(t)m(ypically)h(binned)0 4852 y(b)m(y)i(a)h(factor)g(of)f(32)h(to)g(pro)s(duce)e(a)i(480x480)i (pixel)d(image.)51 b(If)32 b(one)i(then)f(uses)g(a)g(region)h(\014le)f (generated)h(from)0 4965 y(this)c(image)i(\(in)f(image)g(pixel)g (units\))g(to)g(\014lter)f(the)h(R)m(OSA)-8 b(T)30 b(ev)m(en)m(ts)i (\014le,)f(then)f(the)h(X)g(and)f(Y)g(column)h(v)-5 b(alues)0 5077 y(m)m(ust)30 b(b)s(e)g(con)m(v)m(erted)i(to)f(corresp)s(onding)e (pixel)i(units)f(as)g(in:)382 5339 y Fe(regfilter\("rosat.reg",)42 b(X/32.+.5,)j(Y/32.+.5\))0 5601 y Fi(Note)h(that)f(this)f(binning)f (con)m(v)m(ersion)j(is)e(not)h(necessary)g(if)f(the)h(region)g(\014le)f (is)h(sp)s(eci\014ed)e(using)h(celestial)0 5714 y(co)s(ordinate)h (units)f(instead)g(of)g(pixel)h(units)f(b)s(ecause)g(CFITSIO)e(is)j (then)e(able)i(to)g(directly)g(compare)g(the)p eop end %%Page: 104 110 TeXDict begin 104 109 bop 0 299 a Fi(104)1573 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fi(celestial)30 b(co)s(ordinate)f(of)e(eac)m(h)i(ro)m(w)f(in)f (the)h(table)g(with)g(the)f(celestial)k(co)s(ordinates)d(in)f(the)h (region)g(\014le)g(without)0 668 y(ha)m(ving)j(to)g(kno)m(w)f(an)m (ything)h(ab)s(out)f(ho)m(w)h(the)f(image)i(ma)m(y)f(ha)m(v)m(e)g(b)s (een)f(binned.)0 828 y(The)f(last)h("w)m(cs)g(cols")h(parameter)f (should)e(rarely)h(b)s(e)g(needed.)40 b(If)29 b(supplied,)f(this)i (string)f(con)m(tains)i(the)e(names)0 941 y(of)37 b(the)g(2)h(columns)f (\(space)h(or)f(comma)g(separated\))h(whic)m(h)f(ha)m(v)m(e)h(the)g (asso)s(ciated)g(W)m(CS)f(k)m(eyw)m(ords.)61 b(If)37 b(not)0 1054 y(supplied,)f(the)g(\014lter)g(will)h(scan)f(the)g(X)g (and)f(Y)h(expressions)g(for)g(column)f(names.)58 b(If)35 b(only)h(one)h(is)f(found)e(in)0 1167 y(eac)m(h)e(expression,)e(those)h (columns)f(will)h(b)s(e)e(used,)h(otherwise)h(an)f(error)g(will)h(b)s (e)f(returned.)0 1327 y(These)g(region)h(shap)s(es)f(are)g(supp)s (orted)f(\(names)h(are)h(case)h(insensitiv)m(e\):)334 1591 y Fe(Point)428 b(\()48 b(X1,)f(Y1)g(\))715 b(<-)48 b(One)f(pixel)f(square)g(region)334 1704 y(Line)476 b(\()48 b(X1,)f(Y1,)g(X2,)f(Y2)i(\))333 b(<-)48 b(One)f(pixel)f(wide)h(region) 334 1817 y(Polygon)332 b(\()48 b(X1,)f(Y1,)g(X2,)f(Y2,)h(...)g(\))95 b(<-)48 b(Rest)e(are)h(interiors)e(with)334 1930 y(Rectangle)236 b(\()48 b(X1,)f(Y1,)g(X2,)f(Y2,)h(A)h(\))334 b(|)47 b(boundaries)e (considered)334 2043 y(Box)524 b(\()48 b(Xc,)f(Yc,)g(Wdth,)f(Hght,)g(A) i(\))143 b(V)47 b(within)f(the)h(region)334 2156 y(Diamond)332 b(\()48 b(Xc,)f(Yc,)g(Wdth,)f(Hght,)g(A)i(\))334 2269 y(Circle)380 b(\()48 b(Xc,)f(Yc,)g(R)g(\))334 2382 y(Annulus)332 b(\()48 b(Xc,)f(Yc,)g(Rin,)f(Rout)h(\))334 2494 y(Ellipse)332 b(\()48 b(Xc,)f(Yc,)g(Rx,)f(Ry,)h(A)h(\))334 2607 y(Elliptannulus)c(\() k(Xc,)f(Yc,)g(Rinx,)f(Riny,)g(Routx,)g(Routy,)g(Ain,)h(Aout)g(\))334 2720 y(Sector)380 b(\()48 b(Xc,)f(Yc,)g(Amin,)f(Amax)h(\))0 2984 y Fi(where)28 b(\(Xc,Yc\))j(is)d(the)h(co)s(ordinate)h(of)e(the)h (shap)s(e's)f(cen)m(ter;)j(\(X#,Y#\))e(are)g(the)g(co)s(ordinates)g(of) g(the)g(shap)s(e's)0 3097 y(edges;)36 b(Rxxx)d(are)h(the)f(shap)s(es')g (v)-5 b(arious)34 b(Radii)f(or)h(semi-ma)5 b(jor/minor)34 b(axes;)i(and)d(Axxx)g(are)h(the)f(angles)i(of)0 3210 y(rotation)e(\(or)e(b)s(ounding)f(angles)i(for)f(Sector\))h(in)f (degrees.)44 b(F)-8 b(or)32 b(rotated)h(shap)s(es,)e(the)g(rotation)i (angle)f(can)g(b)s(e)0 3323 y(left)g(o\013,)h(indicating)f(no)f (rotation.)46 b(Common)31 b(alternate)i(names)e(for)h(the)f(regions)h (can)g(also)h(b)s(e)d(used:)43 b(rotb)s(o)m(x)0 3436 y(=)29 b(b)s(o)m(x;)g(rotrectangle)i(=)e(rectangle;)i(\(rot\)rhom)m (bus)e(=)f(\(rot\)diamond;)j(and)d(pie)h(=)f(sector.)42 b(When)28 b(a)i(shap)s(e's)0 3549 y(name)e(is)g(preceded)f(b)m(y)h(a)g (min)m(us)g(sign,)g('-',)i(the)e(de\014ned)e(region)j(is)f(instead)g (the)g(area)h(*outside*)g(its)f(b)s(oundary)0 3662 y(\(ie,)36 b(the)e(region)h(is)f(in)m(v)m(erted\).)53 b(All)34 b(the)g(shap)s(es)f (within)h(a)g(single)h(region)f(\014le)h(are)f(OR'd)f(together)j(to)e (create)0 3775 y(the)29 b(region,)i(and)d(the)i(order)f(is)g (signi\014can)m(t.)41 b(The)29 b(o)m(v)m(erall)i(w)m(a)m(y)g(of)e(lo)s (oking)h(at)g(region)g(\014les)f(is)g(that)h(if)f(the)h(\014rst)0 3888 y(region)f(is)g(an)g(excluded)g(region)g(then)f(a)i(dumm)m(y)d (included)h(region)i(of)f(the)g(whole)g(detector)h(is)f(inserted)f(in)h (the)0 4000 y(fron)m(t.)40 b(Then)25 b(eac)m(h)j(region)f(sp)s (eci\014cation)h(as)f(it)g(is)g(pro)s(cessed)f(o)m(v)m(errides)h(an)m (y)g(selections)i(inside)d(of)h(that)g(region)0 4113 y(sp)s(eci\014ed)36 b(b)m(y)g(previous)g(regions.)59 b(Another)37 b(w)m(a)m(y)g(of)g(thinking)f(ab)s(out)g(this)g(is)h(that) g(if)f(a)h(previous)f(excluded)0 4226 y(region)31 b(is)f(completely)i (inside)f(of)f(a)h(subsequen)m(t)e(included)h(region)h(the)g(excluded)f (region)h(is)f(ignored.)0 4386 y(The)44 b(p)s(ositional)i(co)s (ordinates)g(ma)m(y)f(b)s(e)g(giv)m(en)h(either)f(in)g(pixel)g(units,)j (decimal)e(degrees)g(or)f(hh:mm:ss.s,)0 4499 y(dd:mm:ss.s)25 b(units.)38 b(The)26 b(shap)s(e)f(sizes)i(ma)m(y)f(b)s(e)g(giv)m(en)h (in)e(pixels,)j(degrees,)f(arcmin)m(utes,)h(or)e(arcseconds.)40 b(Lo)s(ok)0 4612 y(at)31 b(examples)g(of)f(region)h(\014le)g(pro)s (duced)d(b)m(y)i(fv/PO)m(W)h(or)g(ds9)f(for)g(further)f(details)i(of)g (the)f(region)h(\014le)f(format.)0 4772 y(There)37 b(are)g(three)g (functions)g(that)g(are)h(primarily)f(for)f(use)h(with)g(SA)m(O)g (region)g(\014les)g(and)g(the)g(FSA)m(OI)g(task,)0 4885 y(but)e(they)h(can)h(b)s(e)e(used)g(directly)-8 b(.)59 b(They)36 b(return)f(a)h(b)s(o)s(olean)g(true)g(or)g(false)g(dep)s (ending)f(on)h(whether)f(a)i(t)m(w)m(o)0 4998 y(dimensional)31 b(p)s(oin)m(t)f(is)g(in)g(the)h(region)g(or)f(not:)191 5262 y Fe("point)46 b(in)h(a)h(circular)d(region")477 5375 y(circle\(xcntr,ycntr,radius)o(,Xco)o(lumn)o(,Yc)o(olum)o(n\))191 5601 y("point)h(in)h(an)g(elliptical)e(region")430 5714 y(ellipse\(xcntr,ycntr,xhl)o(f_w)o(dth,)o(yhlf)o(_wd)o(th,r)o(otat)o (ion)o(,Xco)o(lumn)o(,Yc)o(olum)o(n\))p eop end %%Page: 105 111 TeXDict begin 105 110 bop 0 299 a Fg(8.11.)73 b(R)m(O)m(W)31 b(FIL)-8 b(TERING)30 b(SPECIFICA)-8 b(TION)1982 b Fi(105)191 668 y Fe("point)46 b(in)h(a)h(rectangular)c(region")620 781 y(box\(xcntr,ycntr,xfll_wdth,)o(yfll)o(_wd)o(th,r)o(otat)o(ion)o (,Xco)o(lumn)o(,Yc)o(olum)o(n\))191 1007 y(where)334 1120 y(\(xcntr,ycntr\))g(are)j(the)g(\(x,y\))f(position)g(of)h(the)g (center)f(of)h(the)g(region)334 1233 y(\(xhlf_wdth,yhlf_wdth\))42 b(are)47 b(the)g(\(x,y\))f(half)h(widths)f(of)h(the)g(region)334 1346 y(\(xfll_wdth,yfll_wdth\))42 b(are)47 b(the)g(\(x,y\))f(full)h (widths)f(of)h(the)g(region)334 1458 y(\(radius\))f(is)h(half)f(the)h (diameter)f(of)h(the)g(circle)334 1571 y(\(rotation\))e(is)i(the)g (angle\(degrees\))d(that)j(the)g(region)f(is)h(rotated)f(with)620 1684 y(respect)g(to)h(\(xcntr,ycntr\))334 1797 y(\(Xcoord,Ycoord\))d (are)j(the)g(\(x,y\))f(coordinates)f(to)i(test,)f(usually)g(column)620 1910 y(names)334 2023 y(NOTE:)g(each)h(parameter)e(can)i(itself)f(be)i (an)f(expression,)d(not)j(merely)f(a)620 2136 y(column)h(name)f(or)h (constant.)0 2443 y Fb(8.11.6)113 b(Example)38 b(Ro)m(w)f(Filters)191 2665 y Fe([)47 b(binary)f(&&)i(mag)f(<=)g(5.0])380 b(-)48 b(Extract)e(all)h(binary)f(stars)g(brighter)1766 2778 y(than)94 b(fifth)47 b(magnitude)e(\(note)h(that)1766 2891 y(the)h(initial)f(space)g(is)h(necessary)e(to)1766 3004 y(prevent)h(it)h(from)g(being)f(treated)g(as)h(a)1766 3117 y(binning)f(specification\))191 3343 y([#row)g(>=)h(125)g(&&)h (#row)e(<=)h(175])142 b(-)48 b(Extract)e(row)h(numbers)e(125)i(through) f(175)191 3569 y([IMAGE[4,5])f(.gt.)h(100])476 b(-)48 b(Extract)e(all)h(rows)f(that)h(have)g(the)1766 3681 y(\(4,5\))f(component)g(of)h(the)g(IMAGE)f(column)1766 3794 y(greater)g(than)g(100)191 4020 y([abs\(sin\(theta)e(*)j(#deg\)\)) f(<)i(0.5])e(-)i(Extract)e(all)h(rows)f(having)g(the)1766 4133 y(absolute)f(value)i(of)g(the)g(sine)g(of)g(theta)1766 4246 y(less)94 b(than)47 b(a)g(half)g(where)f(the)h(angles)1766 4359 y(are)g(tabulated)e(in)i(degrees)191 4585 y([SUM\()f(SPEC)h(>)g (3*BACKGRND)e(\)>=1])94 b(-)48 b(Extract)e(all)h(rows)f(containing)f(a) 1766 4698 y(spectrum,)g(held)i(in)g(vector)f(column)1766 4811 y(SPEC,)g(with)h(at)g(least)f(one)h(value)g(3)1766 4924 y(times)f(greater)g(than)h(the)g(background)1766 5036 y(level)f(held)h(in)g(a)h(keyword,)d(BACKGRND)191 5262 y([VCOL=={1,4,2}])759 b(-)48 b(Extract)e(all)h(rows)f(whose)h (vector)f(column)1766 5375 y(VCOL)h(contains)e(the)i(3-elements)e(1,)i (4,)g(and)1766 5488 y(2.)191 5714 y([@rowFilter.txt])711 b(-)48 b(Extract)e(rows)g(using)h(the)g(expression)p eop end %%Page: 106 112 TeXDict begin 106 111 bop 0 299 a Fi(106)1573 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)1766 555 y Fe(contained)45 b(within)h(the)h(text)g(file)1766 668 y(rowFilter.txt)191 894 y([gtifilter\(\)])855 b(-)48 b(Search)e(the)h(current)f(file)g(for)h(a)h(GTI)239 1007 y(extension,)92 b(filter)i(the)47 b(TIME)239 1120 y(column)f(in)h(the)g (current)f(table,)g(using)239 1233 y(START/STOP)f(times)h(taken)g(from) 239 1346 y(columns)f(in)j(the)f(GTI)94 b(extension)191 1571 y([regfilter\("pow.reg"\)])423 b(-)48 b(Extract)e(rows)g(which)h (have)f(a)i(coordinate)1766 1684 y(\(as)f(given)f(in)h(the)g(X)h(and)f (Y)g(columns\))1766 1797 y(within)f(the)h(spatial)f(region)g(specified) 1766 1910 y(in)h(the)g(pow.reg)f(region)g(file.)191 2136 y([regfilter\("pow.reg",)c(Xs,)47 b(Ys\)])f(-)i(Same)f(as)g(above,)f (except)g(that)h(the)1766 2249 y(Xs)g(and)g(Ys)g(columns)f(will)h(be)g (used)f(to)1766 2362 y(determine)f(the)i(coordinate)e(of)i(each)1766 2475 y(row)g(in)g(the)g(table.)0 2811 y Fd(8.12)180 b(Binning)45 b(or)g(Histogramming)i(Sp)t(eci\014cation)0 3062 y Fi(The)22 b(optional)i(binning)e(sp)s(eci\014er)g(is)h(enclosed)h(in)f(square)f (brac)m(k)m(ets)j(and)d(can)h(b)s(e)f(distinguished)g(from)h(a)g (general)0 3175 y(ro)m(w)32 b(\014lter)h(sp)s(eci\014cation)g(b)m(y)f (the)h(fact)g(that)g(it)g(b)s(egins)f(with)g(the)g(k)m(eyw)m(ord)h ('bin')f(not)h(immediately)g(follo)m(w)m(ed)0 3288 y(b)m(y)41 b(an)f(equals)i(sign.)72 b(When)41 b(binning)e(is)i(sp)s(eci\014ed,)i (a)e(temp)s(orary)g(N-dimensional)g(FITS)f(primary)g(arra)m(y)0 3401 y(is)j(created)h(b)m(y)f(computing)h(the)f(histogram)h(of)f(the)g (v)-5 b(alues)44 b(in)e(the)i(sp)s(eci\014ed)e(columns)h(of)g(a)h(FITS) e(table)0 3514 y(extension.)f(After)30 b(the)f(histogram)h(is)g (computed)f(the)h(input)e(FITS)h(\014le)h(con)m(taining)h(the)e(table)i (is)e(then)g(closed)0 3627 y(and)34 b(the)h(temp)s(orary)f(FITS)g (primary)g(arra)m(y)h(is)g(op)s(ened)f(and)g(passed)g(to)h(the)g (application)h(program.)54 b(Th)m(us,)0 3740 y(the)39 b(application)h(program)f(nev)m(er)g(sees)g(the)g(original)h(FITS)e (table)i(and)e(only)h(sees)h(the)f(image)h(in)e(the)h(new)0 3853 y(temp)s(orary)32 b(\014le)h(\(whic)m(h)g(has)f(no)h(additional)g (extensions\).)49 b(Ob)m(viously)-8 b(,)34 b(the)f(application)h (program)e(m)m(ust)h(b)s(e)0 3966 y(exp)s(ecting)e(to)g(op)s(en)f(a)h (FITS)e(image)j(and)e(not)g(a)h(FITS)f(table)h(in)f(this)g(case.)0 4126 y(The)g(data)h(t)m(yp)s(e)f(of)h(the)f(FITS)g(histogram)g(image)i (ma)m(y)f(b)s(e)f(sp)s(eci\014ed)f(b)m(y)h(app)s(ending)f('b')h(\(for)h (8-bit)g(b)m(yte\),)g('i')0 4239 y(\(for)g(16-bit)g(in)m(tegers\),)h ('j')f(\(for)g(32-bit)g(in)m(teger\),)i('r')d(\(for)h(32-bit)g (\015oating)h(p)s(oin)m(ts\),)e(or)h('d')f(\(for)h(64-bit)g(double)0 4351 y(precision)d(\015oating)h(p)s(oin)m(t\))g(to)f(the)h('bin')e(k)m (eyw)m(ord)i(\(e.g.)41 b('[binr)28 b(X]')g(creates)i(a)e(real)h (\015oating)g(p)s(oin)m(t)f(image\).)41 b(If)0 4464 y(the)26 b(datat)m(yp)s(e)h(is)f(not)g(explicitly)i(sp)s(eci\014ed)d(then)h(a)g (32-bit)h(in)m(teger)h(image)f(will)f(b)s(e)f(created)i(b)m(y)f (default,)i(unless)0 4577 y(the)h(w)m(eigh)m(ting)h(option)f(is)g(also) h(sp)s(eci\014ed)e(in)g(whic)m(h)h(case)g(the)g(image)h(will)f(ha)m(v)m (e)h(a)f(32-bit)h(\015oating)g(p)s(oin)m(t)e(data)0 4690 y(t)m(yp)s(e)j(b)m(y)f(default.)0 4850 y(The)24 b(histogram)g(image)i (ma)m(y)f(ha)m(v)m(e)g(from)f(1)g(to)h(4)g(dimensions)e(\(axes\),)k (dep)s(ending)c(on)h(the)g(n)m(um)m(b)s(er)f(of)h(columns)0 4963 y(that)31 b(are)g(sp)s(eci\014ed.)40 b(The)30 b(general)h(form)f (of)g(the)h(binning)e(sp)s(eci\014cation)i(is:)48 5226 y Fe([bin{bijrd})92 b(Xcol=min:max:binsize,)42 b(Ycol=)47 b(...,)f(Zcol=...,)f(Tcol=...;)h(weight])0 5488 y Fi(in)39 b(whic)m(h)g(up)f(to)i(4)g(columns,)h(eac)m(h)f(corresp)s(onding)e(to)i (an)g(axis)f(of)h(the)f(image,)k(are)d(listed.)67 b(The)39 b(column)0 5601 y(names)27 b(are)h(case)h(insensitiv)m(e,)g(and)e(the)h (column)f(n)m(um)m(b)s(er)f(ma)m(y)i(b)s(e)f(giv)m(en)h(instead)g(of)g (the)g(name,)g(preceded)f(b)m(y)0 5714 y(a)32 b(p)s(ound)e(sign)i (\(e.g.,)i([bin)d(#4=1:512]\).)47 b(If)31 b(the)h(column)g(name)g(is)f (not)h(sp)s(eci\014ed,)g(then)f(CFITSIO)g(will)h(\014rst)p eop end %%Page: 107 113 TeXDict begin 107 112 bop 0 299 a Fg(8.12.)113 b(BINNING)31 b(OR)f(HISTOGRAMMING)h(SPECIFICA)-8 b(TION)1268 b Fi(107)0 555 y(try)37 b(to)h(use)f(the)g('preferred)f(column')i(as)f(sp)s (eci\014ed)g(b)m(y)g(the)g(CPREF)g(k)m(eyw)m(ord)h(if)f(it)g(exists)h (\(e.g.,)j('CPREF)0 668 y(=)i('DETX,DETY'\),)h(otherwise)g(column)f (names)g('X',)h('Y',)g('Z',)f(and)f('T')i(will)f(b)s(e)f(assumed)h(for) g(eac)m(h)h(of)0 781 y(the)37 b(4)h(axes,)i(resp)s(ectiv)m(ely)-8 b(.)62 b(In)37 b(cases)h(where)e(the)i(column)f(name)g(could)g(b)s(e)f (confused)h(with)g(an)g(arithmetic)0 894 y(expression,)30 b(enclose)i(the)f(column)f(name)g(in)g(paren)m(theses)h(to)g(force)g (the)f(name)h(to)g(b)s(e)f(in)m(terpreted)g(literally)-8 b(.)0 1054 y(Eac)m(h)33 b(column)f(name)g(ma)m(y)h(b)s(e)f(follo)m(w)m (ed)h(b)m(y)g(an)f(equals)g(sign)h(and)e(then)h(the)g(lo)m(w)m(er)i (and)e(upp)s(er)e(range)i(of)h(the)0 1167 y(histogram,)f(and)e(the)h (size)h(of)f(the)g(histogram)h(bins,)e(separated)h(b)m(y)g(colons.)43 b(Spaces)31 b(are)g(allo)m(w)m(ed)i(b)s(efore)e(and)0 1280 y(after)e(the)g(equals)g(sign)f(but)g(not)h(within)f(the)h ('min:max:binsize')g(string.)40 b(The)29 b(min,)f(max)h(and)f(binsize)h (v)-5 b(alues)0 1393 y(ma)m(y)32 b(b)s(e)e(in)m(teger)i(or)f (\015oating)h(p)s(oin)m(t)f(n)m(um)m(b)s(ers,)f(or)h(they)g(ma)m(y)g(b) s(e)g(the)g(names)g(of)g(k)m(eyw)m(ords)g(in)g(the)g(header)g(of)0 1506 y(the)g(table.)41 b(If)30 b(the)h(latter,)h(then)e(the)g(v)-5 b(alue)31 b(of)g(that)g(k)m(eyw)m(ord)f(is)h(substituted)f(in)m(to)h (the)g(expression.)0 1666 y(Default)37 b(v)-5 b(alues)36 b(for)g(the)g(min,)h(max)f(and)g(binsize)g(quan)m(tities)h(will)f(b)s (e)f(used)h(if)f(not)i(explicitly)g(giv)m(en)g(in)f(the)0 1779 y(binning)29 b(expression)h(as)h(sho)m(wn)f(in)g(these)h (examples:)191 2033 y Fe([bin)47 b(x)g(=)g(:512:2])94 b(-)47 b(use)g(default)f(minimum)g(value)191 2146 y([bin)h(x)g(=)g (1::2])190 b(-)47 b(use)g(default)f(maximum)g(value)191 2259 y([bin)h(x)g(=)g(1:512])142 b(-)47 b(use)g(default)f(bin)h(size) 191 2372 y([bin)g(x)g(=)g(1:])286 b(-)47 b(use)g(default)f(maximum)g (value)g(and)h(bin)g(size)191 2485 y([bin)g(x)g(=)g(:512])190 b(-)47 b(use)g(default)f(minimum)g(value)g(and)h(bin)g(size)191 2598 y([bin)g(x)g(=)g(2])334 b(-)47 b(use)g(default)f(minimum)g(and)h (maximum)f(values)191 2711 y([bin)h(x])524 b(-)47 b(use)g(default)f (minimum,)g(maximum)g(and)g(bin)h(size)191 2824 y([bin)g(4])524 b(-)47 b(default)f(2-D)h(image,)f(bin)h(size)g(=)g(4)h(in)f(both)g (axes)191 2937 y([bin])619 b(-)47 b(default)f(2-D)h(image)0 3191 y Fi(CFITSIO)31 b(will)i(use)f(the)h(v)-5 b(alue)33 b(of)g(the)g(TLMINn,)f(TLMAXn,)h(and)f(TDBINn)h(k)m(eyw)m(ords,)h(if)e (they)h(exist,)h(for)0 3304 y(the)j(default)f(min,)i(max,)g(and)e (binsize,)i(resp)s(ectiv)m(ely)-8 b(.)61 b(If)36 b(they)h(do)f(not)h (exist)g(then)f(CFITSIO)f(will)i(use)f(the)0 3417 y(actual)d(minim)m (um)e(and)h(maxim)m(um)g(v)-5 b(alues)32 b(in)g(the)g(column)f(for)h (the)g(histogram)h(min)e(and)h(max)g(v)-5 b(alues.)45 b(The)0 3530 y(default)34 b(binsize)f(will)h(b)s(e)f(set)h(to)h(1,)g (or)e(\(max)h(-)g(min\))f(/)h(10.,)i(whic)m(hev)m(er)e(is)g(smaller,)h (so)e(that)i(the)e(histogram)0 3643 y(will)e(ha)m(v)m(e)g(at)g(least)h (10)f(bins)f(along)h(eac)m(h)h(axis.)0 3803 y(A)41 b(shortcut)g (notation)h(is)f(allo)m(w)m(ed)i(if)e(all)h(the)f(columns/axes)h(ha)m (v)m(e)g(the)f(same)g(binning)f(sp)s(eci\014cation.)74 b(In)0 3916 y(this)33 b(case)g(all)h(the)f(column)f(names)h(ma)m(y)g(b) s(e)f(listed)h(within)f(paren)m(theses,)i(follo)m(w)m(ed)h(b)m(y)d(the) h(\(single\))h(binning)0 4029 y(sp)s(eci\014cation,)d(as)g(in:)191 4283 y Fe([bin)47 b(\(X,Y\)=1:512:2])191 4396 y([bin)g(\(X,Y\))f(=)h (5])0 4650 y Fi(The)31 b(optional)i(w)m(eigh)m(ting)h(factor)e(is)g (the)g(last)g(item)h(in)e(the)h(binning)f(sp)s(eci\014er)g(and,)h(if)f (presen)m(t,)i(is)e(separated)0 4763 y(from)38 b(the)g(list)h(of)f (columns)g(b)m(y)g(a)h(semi-colon.)65 b(As)39 b(the)f(histogram)h(is)f (accum)m(ulated,)k(this)c(w)m(eigh)m(t)i(is)e(used)0 4876 y(to)d(incremen)m(ted)f(the)g(v)-5 b(alue)35 b(of)f(the)g (appropriated)f(bin)h(in)f(the)h(histogram.)52 b(If)34 b(the)g(w)m(eigh)m(ting)i(factor)f(is)f(not)0 4989 y(sp)s(eci\014ed,)24 b(then)f(the)g(default)g(w)m(eigh)m(t)i(=)d(1)i(is)f(assumed.)37 b(The)23 b(w)m(eigh)m(ting)i(factor)f(ma)m(y)f(b)s(e)g(a)g(constan)m(t) i(in)m(teger)f(or)0 5102 y(\015oating)30 b(p)s(oin)m(t)f(n)m(um)m(b)s (er,)f(or)h(the)g(name)g(of)g(a)g(k)m(eyw)m(ord)h(con)m(taining)g(the)g (w)m(eigh)m(ting)g(v)-5 b(alue.)41 b(Or)28 b(the)h(w)m(eigh)m(ting)0 5215 y(factor)g(ma)m(y)g(b)s(e)e(the)h(name)g(of)h(a)f(table)h(column)f (in)g(whic)m(h)f(case)j(the)e(v)-5 b(alue)28 b(in)g(that)h(column,)f (on)g(a)h(ro)m(w)f(b)m(y)g(ro)m(w)0 5328 y(basis,)i(will)h(b)s(e)f (used.)0 5488 y(In)35 b(some)h(cases,)i(the)d(column)h(or)f(k)m(eyw)m (ord)h(ma)m(y)g(giv)m(e)h(the)f(recipro)s(cal)g(of)g(the)g(actual)h(w)m (eigh)m(t)g(v)-5 b(alue)36 b(that)g(is)0 5601 y(needed.)49 b(In)32 b(this)h(case,)i(precede)e(the)h(w)m(eigh)m(t)g(k)m(eyw)m(ord)g (or)f(column)g(name)g(b)m(y)g(a)g(slash)g('/')h(to)g(tell)g(CFITSIO)0 5714 y(to)d(use)f(the)h(recipro)s(cal)g(of)f(the)h(v)-5 b(alue)31 b(when)e(constructing)i(the)g(histogram.)p eop end %%Page: 108 114 TeXDict begin 108 113 bop 0 299 a Fi(108)1573 b Fg(CHAPTER)30 b(8.)112 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fi(F)g(or)35 b(complex)f(or)g(commonly)g(used)f(histograms,)j (one)e(can)g(also)h(place)g(its)f(description)g(in)m(to)h(a)f(text)h (\014le)f(and)0 668 y(imp)s(ort)44 b(it)g(in)m(to)i(the)e(binning)f(sp) s(eci\014cation)i(using)f(the)h(syn)m(tax)f('[bin)g(@\014lename.txt]'.) 84 b(The)44 b(\014le's)g(con-)0 781 y(ten)m(ts)37 b(can)e(extend)h(o)m (v)m(er)h(m)m(ultiple)f(lines,)i(although)e(it)g(m)m(ust)f(still)i (conform)f(to)g(the)g(no-spaces)g(rule)f(for)h(the)0 894 y(min:max:binsize)h(syn)m(tax)h(and)e(eac)m(h)i(axis)g(sp)s (eci\014cation)g(m)m(ust)f(still)g(b)s(e)g(comma-separated.)62 b(An)m(y)37 b(lines)g(in)0 1007 y(the)32 b(external)h(text)g(\014le)f (that)h(b)s(egin)e(with)h(2)g(slash)g(c)m(haracters)h(\('//'\))h(will)e (b)s(e)g(ignored)g(and)f(ma)m(y)i(b)s(e)e(used)g(to)0 1120 y(add)f(commen)m(ts)h(in)m(to)g(the)g(\014le.)0 1280 y(Examples:)191 1540 y Fe([bini)46 b(detx,)h(dety])762 b(-)47 b(2-D,)g(16-bit)f(integer)g(histogram)1861 1653 y(of)i(DETX)e(and)h(DETY)g(columns,)e(using)1861 1766 y(default)h(values)g(for)h(the)g(histogram)1861 1878 y(range)g(and)g(binsize)191 2104 y([bin)g(\(detx,)f(dety\)=16;)f (/exposure])g(-)i(2-D,)g(32-bit)f(real)h(histogram)e(of)i(DETX)1861 2217 y(and)g(DETY)g(columns)f(with)g(a)i(bin)f(size)f(=)i(16)1861 2330 y(in)g(both)e(axes.)h(The)f(histogram)g(values)1861 2443 y(are)h(divided)f(by)h(the)g(EXPOSURE)f(keyword)1861 2556 y(value.)191 2782 y([bin)h(time=TSTART:TSTOP:0.1])280 b(-)47 b(1-D)g(lightcurve,)e(range)h(determined)f(by)1861 2895 y(the)i(TSTART)f(and)h(TSTOP)g(keywords,)1861 3008 y(with)g(0.1)g(unit)g(size)f(bins.)191 3233 y([bin)h(pha,)f (time=8000.:8100.:0.1])90 b(-)47 b(2-D)g(image)g(using)f(default)g (binning)1861 3346 y(of)i(the)e(PHA)h(column)f(for)h(the)g(X)h(axis,) 1861 3459 y(and)f(1000)g(bins)g(in)g(the)g(range)1861 3572 y(8000.)g(to)g(8100.)f(for)h(the)g(Y)h(axis.)191 3798 y([bin)f(@binFilter.txt])616 b(-)47 b(Use)g(the)g(contents)f(of)h (the)g(text)f(file)1861 3911 y(binFilter.txt)f(for)h(the)h(binning)1861 4024 y(specifications.)p eop end %%Page: 109 115 TeXDict begin 109 114 bop 0 1225 a Ff(Chapter)65 b(9)0 1687 y Fl(T)-19 b(emplate)76 b(Files)0 2180 y Fi(When)38 b(a)h(new)f(FITS)g(\014le)h(is)g(created)g(with)g(a)f(call)i(to)g (\014ts)p 2101 2180 28 4 v 32 w(create)p 2369 2180 V 35 w(\014le,)g(the)f(name)g(of)g(a)g(template)h(\014le)e(ma)m(y)0 2293 y(b)s(e)h(supplied)g(in)h(paren)m(theses)g(immediately)h(follo)m (wing)g(the)g(name)f(of)g(the)g(new)f(\014le)h(to)h(b)s(e)e(created.)71 b(This)0 2406 y(template)27 b(is)e(used)g(to)h(de\014ne)f(the)h (structure)f(of)h(one)f(or)h(more)g(HDUs)g(in)f(the)h(new)f(\014le.)39 b(The)25 b(template)i(\014le)e(ma)m(y)0 2518 y(b)s(e)32 b(another)h(FITS)f(\014le,)i(in)f(whic)m(h)f(case)i(the)f(newly)g (created)h(\014le)f(will)g(ha)m(v)m(e)h(exactly)h(the)e(same)g(k)m(eyw) m(ords)g(in)0 2631 y(eac)m(h)25 b(HDU)g(as)g(in)f(the)g(template)i (FITS)d(\014le,)j(but)d(all)j(the)e(data)h(units)e(will)i(b)s(e)f (\014lled)g(with)f(zeros.)40 b(The)24 b(template)0 2744 y(\014le)i(ma)m(y)h(also)g(b)s(e)e(an)h(ASCI)s(I)e(text)j(\014le,)g (where)f(eac)m(h)h(line)f(\(in)g(general\))i(describ)s(es)d(one)h(FITS) f(k)m(eyw)m(ord)i(record.)0 2857 y(The)j(format)h(of)f(the)h(ASCI)s(I)e (template)i(\014le)g(is)f(describ)s(ed)f(in)i(the)f(follo)m(wing)i (sections.)0 3188 y Fd(9.1)135 b(Detailed)47 b(T)-11 b(emplate)46 b(Line)f(F)-11 b(ormat)0 3438 y Fi(The)30 b(format)h(of)f(eac)m(h)i(ASCI)s(I)c(template)k(line)f(closely)h(follo) m(ws)f(the)g(format)g(of)f(a)h(FITS)f(k)m(eyw)m(ord)g(record:)95 3682 y Fe(KEYWORD)46 b(=)i(KEYVALUE)d(/)j(COMMENT)0 3926 y Fi(except)22 b(that)g(free)g(format)f(ma)m(y)h(b)s(e)f(used)f (\(e.g.,)25 b(the)d(equals)f(sign)h(ma)m(y)f(app)s(ear)g(at)h(an)m(y)g (p)s(osition)f(in)g(the)h(line\))g(and)0 4039 y(T)-8 b(AB)34 b(c)m(haracters)g(are)g(allo)m(w)m(ed)h(and)e(are)g(treated)h (the)g(same)f(as)h(space)f(c)m(haracters.)51 b(The)33 b(KEYV)-10 b(ALUE)33 b(and)0 4152 y(COMMENT)d(\014elds)g(are)h (optional.)43 b(The)30 b(equals)h(sign)f(c)m(haracter)j(is)d(also)i (optional,)g(but)e(it)h(is)f(recommended)0 4264 y(that)42 b(it)f(b)s(e)g(included)f(for)h(clarit)m(y)-8 b(.)75 b(An)m(y)41 b(template)i(line)e(that)h(b)s(egins)f(with)f(the)i(p)s (ound)d('#')i(c)m(haracter)i(is)0 4377 y(ignored)30 b(b)m(y)h(the)f (template)i(parser)e(and)g(ma)m(y)h(b)s(e)e(use)h(to)h(insert)g(commen) m(ts)g(in)m(to)g(the)g(template)h(\014le)e(itself.)0 4538 y(The)c(KEYW)m(ORD)g(name)g(\014eld)g(is)g(limited)h(to)g(8)f(c)m (haracters)h(in)f(length)h(and)e(only)h(the)g(letters)i(A-Z,)e(digits)h (0-9,)0 4650 y(and)h(the)g(h)m(yphen)f(and)h(underscore)g(c)m (haracters)h(ma)m(y)g(b)s(e)f(used,)g(without)h(an)m(y)f(em)m(b)s (edded)g(spaces.)40 b(Lo)m(w)m(ercase)0 4763 y(letters)22 b(in)f(the)h(template)g(k)m(eyw)m(ord)g(name)f(will)g(b)s(e)g(con)m(v)m (erted)i(to)f(upp)s(ercase.)36 b(Leading)22 b(spaces)f(in)g(the)h (template)0 4876 y(line)k(preceding)g(the)f(k)m(eyw)m(ord)h(name)g(are) g(generally)h(ignored,)g(except)f(if)g(the)g(\014rst)f(8)h(c)m (haracters)h(of)f(a)g(template)0 4989 y(line)f(are)h(all)g(blank,)g (then)f(the)g(en)m(tire)h(line)g(is)f(treated)h(as)f(a)h(FITS)e(commen) m(t)i(k)m(eyw)m(ord)g(\(with)f(a)h(blank)e(k)m(eyw)m(ord)0 5102 y(name\))31 b(and)f(is)g(copied)h(v)m(erbatim)g(in)m(to)g(the)g (FITS)e(header.)0 5262 y(The)37 b(KEYV)-10 b(ALUE)37 b(\014eld)g(ma)m(y)h(ha)m(v)m(e)g(an)m(y)g(allo)m(w)m(ed)h(FITS)e(data) h(t)m(yp)s(e:)54 b(c)m(haracter)39 b(string,)h(logical,)h(in)m(teger,)0 5375 y(real,)28 b(complex)g(in)m(teger,)h(or)d(complex)i(real.)40 b(In)m(teger)28 b(v)-5 b(alues)27 b(m)m(ust)f(b)s(e)g(within)g(the)h (allo)m(w)m(ed)i(range)e(of)g(a)g('signed)0 5488 y(long')h(v)-5 b(ariable;)29 b(some)f(C)e(compilers)i(only)f(suppp)s(ort)e(4-b)m(yte)j (long)g(in)m(tegers)g(with)f(a)g(range)h(from)e(-2147483648)0 5601 y(to)31 b(+2147483647,)k(whereas)30 b(other)h(C)f(compilers)h (supp)s(ort)e(8-b)m(yte)j(in)m(tegers)f(with)f(a)h(range)g(of)g(plus)e (or)i(min)m(us)0 5714 y(2**63.)1882 5942 y(109)p eop end %%Page: 110 116 TeXDict begin 110 115 bop 0 299 a Fi(110)2295 b Fg(CHAPTER)30 b(9.)71 b(TEMPLA)-8 b(TE)30 b(FILES)0 555 y Fi(The)23 b(c)m(haracter)h(string)f(v)-5 b(alues)24 b(need)f(not)g(b)s(e)g (enclosed)g(in)g(single)h(quote)g(c)m(haracters)g(unless)f(they)g(are)h (necessary)0 668 y(to)37 b(distinguish)e(the)i(string)f(from)f(a)i (di\013eren)m(t)g(data)f(t)m(yp)s(e)h(\(e.g.)59 b(2.0)38 b(is)e(a)g(real)h(but)f('2.0')h(is)f(a)h(string\).)58 b(The)0 781 y(k)m(eyw)m(ord)38 b(has)g(an)g(unde\014ned)d(\(n)m(ull\))k (v)-5 b(alue)38 b(if)g(the)g(template)h(record)f(only)g(con)m(tains)h (blanks)e(follo)m(wing)j(the)0 894 y("=")31 b(or)f(b)s(et)m(w)m(een)h (the)g("=")g(and)f(the)g("/")i(commen)m(t)f(\014eld)f(delimiter.)0 1054 y(String)c(k)m(eyw)m(ord)h(v)-5 b(alues)27 b(longer)g(than)f(68)h (c)m(haracters)h(\(the)f(maxim)m(um)f(length)h(that)g(will)g(\014t)f (in)g(a)h(single)g(FITS)0 1167 y(k)m(eyw)m(ord)41 b(record\))g(are)g(p) s(ermitted)f(using)g(the)h(CFITSIO)e(long)i(string)g(con)m(v)m(en)m (tion.)74 b(They)40 b(can)h(either)g(b)s(e)0 1280 y(sp)s(eci\014ed)28 b(as)i(a)f(single)h(long)f(line)h(in)e(the)i(template,)h(or)e(b)m(y)f (using)h(m)m(ultiple)h(lines)f(where)f(the)i(con)m(tin)m(uing)g(lines)0 1393 y(con)m(tain)i(the)e('CONTINUE')g(k)m(eyw)m(ord,)h(as)g(in)f(this) g(example:)95 1657 y Fe(LONGKEY)46 b(=)i('This)e(is)h(a)h(long)e (string)g(value)h(that)f(is)i(contin&')95 1770 y(CONTINUE)94 b('ued)46 b(over)h(2)g(records')f(/)h(comment)f(field)h(goes)f(here)0 2035 y Fi(The)29 b(format)h(of)g(template)h(lines)e(with)h(CONTINUE)e (k)m(eyw)m(ord)i(is)g(v)m(ery)g(strict:)41 b(3)30 b(spaces)g(m)m(ust)f (follo)m(w)i(CON-)0 2147 y(TINUE)f(and)g(the)g(rest)h(of)f(the)h(line)g (is)f(copied)h(v)m(erbatim)g(to)g(the)g(FITS)e(\014le.)0 2308 y(The)i(start)h(of)g(the)f(optional)i(COMMENT)e(\014eld)g(m)m(ust) h(b)s(e)e(preceded)i(b)m(y)f("/",)i(whic)m(h)e(is)h(used)f(to)h (separate)g(it)0 2421 y(from)e(the)g(k)m(eyw)m(ord)h(v)-5 b(alue)30 b(\014eld.)41 b(Exceptions)30 b(are)h(if)f(the)h(KEYW)m(ORD)g (name)f(\014eld)g(con)m(tains)h(COMMENT,)0 2533 y(HISTOR)-8 b(Y,)30 b(CONTINUE,)g(or)g(if)g(the)h(\014rst)f(8)g(c)m(haracters)i(of) f(the)f(template)i(line)f(are)g(blanks.)0 2694 y(More)c(than)f(one)h (Header-Data)i(Unit)e(\(HDU\))g(ma)m(y)g(b)s(e)f(de\014ned)f(in)h(the)h (template)h(\014le.)39 b(The)26 b(start)h(of)g(an)f(HDU)0 2806 y(de\014nition)k(is)g(denoted)h(with)f(a)h(SIMPLE)e(or)i(XTENSION) e(template)j(line:)0 2967 y(1\))i(SIMPLE)f(b)s(egins)g(a)h(Primary)g (HDU)g(de\014nition.)50 b(SIMPLE)33 b(ma)m(y)h(only)g(app)s(ear)f(as)h (the)g(\014rst)f(k)m(eyw)m(ord)h(in)0 3080 y(the)e(template)i(\014le.) 45 b(If)32 b(the)g(template)i(\014le)e(b)s(egins)f(with)h(XTENSION)f (instead)h(of)g(SIMPLE,)g(then)f(a)i(default)0 3192 y(empt)m(y)d (Primary)e(HDU)i(is)g(created,)h(and)d(the)i(template)h(is)e(then)g (assumed)f(to)i(de\014ne)f(the)h(k)m(eyw)m(ords)f(starting)0 3305 y(with)h(the)h(\014rst)e(extension)i(follo)m(wing)h(the)f(Primary) f(HDU.)0 3466 y(2\))35 b(XTENSION)e(marks)g(the)i(b)s(eginning)e(of)h (a)h(new)e(extension)i(HDU)f(de\014nition.)52 b(The)33 b(previous)h(HDU)h(will)0 3578 y(b)s(e)30 b(closed)h(at)g(this)f(p)s (oin)m(t)h(and)e(pro)s(cessing)i(of)f(the)h(next)f(extension)h(b)s (egins.)0 3918 y Fd(9.2)135 b(Auto-indexing)45 b(of)h(Keyw)l(ords)0 4169 y Fi(If)31 b(a)h(template)g(k)m(eyw)m(ord)g(name)f(ends)g(with)g (a)g("#")h(c)m(haracter,)i(it)e(is)f(said)g(to)h(b)s(e)f ('auto-indexed'.)44 b(Eac)m(h)32 b("#")0 4282 y(c)m(haracter)i(will)f (b)s(e)f(replaced)i(b)m(y)e(the)h(curren)m(t)g(in)m(teger)h(index)e(v) -5 b(alue,)34 b(whic)m(h)f(gets)g(reset)h(=)e(1)h(at)h(the)e(start)i (of)0 4395 y(eac)m(h)h(new)f(HDU)g(in)g(the)g(\014le)g(\(or)g(7)h(in)e (the)h(sp)s(ecial)h(case)g(of)f(a)g(GR)m(OUP)h(de\014nition\).)51 b(The)33 b(FIRST)g(indexed)0 4508 y(k)m(eyw)m(ord)c(in)f(eac)m(h)h (template)h(HDU)f(de\014nition)f(is)g(used)f(as)i(the)f('incremen)m (tor';)j(eac)m(h)e(subsequen)m(t)f(o)s(ccurrence)0 4620 y(of)k(this)f(SAME)g(k)m(eyw)m(ord)h(will)g(cause)g(the)g(index)f(v)-5 b(alue)32 b(to)g(b)s(e)f(incremen)m(ted.)44 b(This)31 b(b)s(eha)m(vior)g(can)h(b)s(e)f(rather)0 4733 y(subtle,)d(as)g (illustrated)h(in)e(the)h(follo)m(wing)h(examples)f(in)f(whic)m(h)h (the)g(TTYPE)e(k)m(eyw)m(ord)i(is)g(the)g(incremen)m(tor)g(in)0 4846 y(b)s(oth)i(cases:)95 5111 y Fe(TTYPE#)47 b(=)g(TIME)95 5224 y(TFORM#)g(=)g(1D)95 5337 y(TTYPE#)g(=)g(RATE)95 5449 y(TFORM#)g(=)g(1E)0 5714 y Fi(will)26 b(create)i(TTYPE1,)e(TF)m (ORM1,)i(TTYPE2,)f(and)e(TF)m(ORM2)i(k)m(eyw)m(ords.)40 b(But)26 b(if)g(the)g(template)h(lo)s(oks)f(lik)m(e,)p eop end %%Page: 111 117 TeXDict begin 111 116 bop 0 299 a Fg(9.3.)72 b(TEMPLA)-8 b(TE)30 b(P)-8 b(ARSER)30 b(DIRECTIVES)2028 b Fi(111)95 555 y Fe(TTYPE#)47 b(=)g(TIME)95 668 y(TTYPE#)g(=)g(RATE)95 781 y(TFORM#)g(=)g(1D)95 894 y(TFORM#)g(=)g(1E)0 1202 y Fi(this)31 b(results)f(in)h(a)g(FITS)f(\014les)h(with)f(TTYPE1,)h (TTYPE2,)g(TF)m(ORM2,)h(and)e(TF)m(ORM2,)i(whic)m(h)f(is)g(probably)0 1315 y(not)g(what)f(w)m(as)h(in)m(tended!)0 1706 y Fd(9.3)135 b(T)-11 b(emplate)46 b(P)l(arser)g(Directiv)l(es)0 1968 y Fi(In)29 b(addition)i(to)f(the)g(template)i(lines)e(whic)m(h)g (de\014ne)f(individual)h(k)m(eyw)m(ords,)g(the)g(template)i(parser)d (recognizes)0 2081 y(3)h(sp)s(ecial)h(directiv)m(es)g(whic)m(h)f(are)g (eac)m(h)h(preceded)f(b)m(y)f(the)h(bac)m(kslash)h(c)m(haracter:)90 b Fe(\\include,)45 b(\\group)p Fi(,)29 b(and)48 2194 y Fe(\\end)p Fi(.)0 2354 y(The)37 b('include')h(directiv)m(e)i(m)m(ust) d(b)s(e)h(follo)m(w)m(ed)h(b)m(y)f(a)g(\014lename.)63 b(It)38 b(forces)g(the)g(parser)f(to)i(temp)s(orarily)f(stop)0 2467 y(reading)d(the)g(curren)m(t)g(template)h(\014le)f(and)f(b)s(egin) h(reading)g(the)g(include)f(\014le.)55 b(Once)35 b(the)g(parser)f(reac) m(hes)i(the)0 2579 y(end)f(of)h(the)g(include)f(\014le)h(it)g(con)m (tin)m(ues)g(parsing)g(the)f(curren)m(t)h(template)h(\014le.)56 b(Include)35 b(\014les)h(can)g(b)s(e)f(nested,)0 2692 y(and)30 b(HDU)h(de\014nitions)f(can)g(span)g(m)m(ultiple)h(template)h (\014les.)0 2853 y(The)f(start)h(of)g(a)g(GR)m(OUP)h(de\014nition)e(is) h(denoted)g(with)f(the)h('group')g(directiv)m(e,)h(and)f(the)f(end)h (of)f(a)i(GR)m(OUP)0 2965 y(de\014nition)k(is)h(denoted)f(with)g(the)h ('end')f(directiv)m(e.)63 b(Eac)m(h)39 b(GR)m(OUP)e(con)m(tains)i(0)f (or)f(more)h(mem)m(b)s(er)f(blo)s(c)m(ks)0 3078 y(\(HDUs)44 b(or)f(GR)m(OUPs\).)79 b(Mem)m(b)s(er)42 b(blo)s(c)m(ks)i(of)f(t)m(yp)s (e)g(GR)m(OUP)g(can)g(con)m(tain)h(their)f(o)m(wn)g(mem)m(b)s(er)f(blo) s(c)m(ks.)0 3191 y(The)32 b(GR)m(OUP)g(de\014nition)g(itself)h(o)s (ccupies)g(one)f(FITS)g(\014le)g(HDU)h(of)f(sp)s(ecial)h(t)m(yp)s(e)f (\(GR)m(OUP)h(HDU\),)h(so)e(if)h(a)0 3304 y(template)f(sp)s(eci\014es)e (1)h(group)e(with)h(1)h(mem)m(b)s(er)f(HDU)h(lik)m(e:)0 3613 y Fe(\\group)0 3725 y(grpdescr)46 b(=)h('demo')0 3838 y(xtension)f(bintable)0 3951 y(#)h(this)g(bintable)f(has)h(0)g (cols,)f(0)i(rows)0 4064 y(\\end)0 4373 y Fi(then)30 b(the)h(parser)e(creates)j(a)f(FITS)f(\014le)g(with)g(3)h(HDUs)g(:)0 4681 y Fe(1\))47 b(dummy)g(PHDU)0 4794 y(2\))g(GROUP)g(HDU)f(\(has)h(1) h(member,)d(which)i(is)g(bintable)e(in)j(HDU)f(number)f(3\))0 4907 y(3\))h(bintable)f(\(member)g(of)h(GROUP)f(in)h(HDU)g(number)f (2\))0 5215 y Fi(T)-8 b(ec)m(hnically)32 b(sp)s(eaking,)e(the)f(GR)m (OUP)i(HDU)f(is)g(a)g(BINT)-8 b(ABLE)30 b(with)g(6)g(columns.)40 b(Applications)31 b(can)f(de\014ne)0 5328 y(additional)23 b(columns)f(in)f(a)i(GR)m(OUP)f(HDU)h(using)f(TF)m(ORMn)f(and)h(TTYPEn) f(\(where)g(n)h(is)g(7,)i(8,)h(....\))39 b(k)m(eyw)m(ords)0 5441 y(or)30 b(their)h(auto-indexing)g(equiv)-5 b(alen)m(ts.)0 5601 y(F)d(or)26 b(a)f(more)g(complicated)h(example)f(of)g(a)h (template)g(\014le)f(using)f(the)h(group)f(directiv)m(es,)k(lo)s(ok)d (at)g(the)g(sample.tpl)0 5714 y(\014le)30 b(that)h(is)g(included)e(in)i (the)f(CFITSIO)f(distribution.)p eop end %%Page: 112 118 TeXDict begin 112 117 bop 0 299 a Fi(112)2295 b Fg(CHAPTER)30 b(9.)71 b(TEMPLA)-8 b(TE)30 b(FILES)0 555 y Fd(9.4)135 b(F)-11 b(ormal)46 b(T)-11 b(emplate)45 b(Syn)l(tax)0 805 y Fi(The)30 b(template)i(syn)m(tax)f(can)f(formally)h(b)s(e)f (de\014ned)f(as)i(follo)m(ws:)191 1063 y Fe(TEMPLATE)45 b(=)j(BLOCK)e([)i(BLOCK)e(...)h(])334 1289 y(BLOCK)f(=)i({)f(HDU)g(|)h (GROUP)e(})334 1515 y(GROUP)g(=)i(\\GROUP)e([)h(BLOCK)g(...)g(])g (\\END)430 1741 y(HDU)f(=)i(XTENSION)d([)j(LINE)f(...)f(])i({)f (XTENSION)f(|)h(\\GROUP)f(|)i(\\END)f(|)g(EOF)g(})382 1967 y(LINE)f(=)i([)f(KEYWORD)f([)i(=)f(])h(])f([)g(VALUE)g(])g([)h(/)f (COMMENT)f(])191 2192 y(X)h(...)238 b(-)48 b(X)f(can)g(be)g(present)f (1)h(or)h(more)e(times)191 2305 y({)h(X)h(|)f(Y)h(})f(-)h(X)f(or)g(Y) 191 2418 y([)g(X)h(])238 b(-)48 b(X)f(is)g(optional)0 2676 y Fi(A)m(t)34 b(the)f(topmost)g(lev)m(el,)i(the)e(template)i (de\014nes)c(1)j(or)e(more)h(template)h(blo)s(c)m(ks.)49 b(Blo)s(c)m(ks)34 b(can)f(b)s(e)f(either)h(HDU)0 2789 y(\(Header)27 b(Data)h(Unit\))g(or)e(a)h(GR)m(OUP)-8 b(.)28 b(F)-8 b(or)27 b(eac)m(h)g(blo)s(c)m(k)g(the)g(parser)f(creates) i(1)f(\(or)g(more)f(for)h(GR)m(OUPs\))g(FITS)0 2902 y(\014le)j(HDUs.)0 3235 y Fd(9.5)135 b(Errors)0 3485 y Fi(In)24 b(general)h(the)f(\014ts)p 692 3485 28 4 v 33 w(execute)p 1019 3485 V 34 w(template\(\))i (function)e(tries)h(to)g(b)s(e)f(as)g(atomic)i(as)f(p)s(ossible,)g(so)f (either)h(ev)m(erything)0 3598 y(is)f(done)g(or)g(nothing)f(is)h(done.) 39 b(If)23 b(an)h(error)f(o)s(ccurs)h(during)f(parsing)g(of)h(the)g (template,)j(\014ts)p 3125 3598 V 33 w(execute)p 3452 3598 V 34 w(template\(\))0 3711 y(will)k(\(try)g(to\))h(delete)g(the)f (top)g(lev)m(el)h(BLOCK)e(\(with)h(all)g(its)h(c)m(hildren)e(if)h(an)m (y\))g(in)g(whic)m(h)f(the)h(error)f(o)s(ccurred,)0 3824 y(then)g(it)h(will)g(stop)f(reading)h(the)f(template)i(\014le)e(and)g (it)h(will)g(return)e(with)h(an)g(error.)0 4158 y Fd(9.6)135 b(Examples)0 4408 y Fi(1.)54 b(This)34 b(template)i(\014le)f(will)g (create)h(a)f(200)h(x)e(300)i(pixel)f(image,)j(with)c(4-b)m(yte)i(in)m (teger)g(pixel)f(v)-5 b(alues,)36 b(in)f(the)0 4521 y(primary)29 b(HDU:)95 4779 y Fe(SIMPLE)47 b(=)g(T)95 4891 y(BITPIX)g(=)g(32)95 5004 y(NAXIS)g(=)g(2)239 b(/)47 b(number)f(of)h(dimensions)95 5117 y(NAXIS1)g(=)g(100)95 b(/)47 b(length)f(of)h(first)g(axis)95 5230 y(NAXIS2)g(=)g(200)95 b(/)47 b(length)f(of)h(second)f(axis)95 5343 y(OBJECT)h(=)g(NGC)g(253)g(/)g(name)g(of)g(observed)f(object)0 5601 y Fi(The)35 b(allo)m(w)m(ed)i(v)-5 b(alues)36 b(of)f(BITPIX)g(are) h(8,)h(16,)h(32,)g(-32,)g(or)d(-64,)j(represen)m(ting,)f(resp)s(ectiv)m (ely)-8 b(,)39 b(8-bit)d(in)m(teger,)0 5714 y(16-bit)c(in)m(teger,)g (32-bit)f(in)m(teger,)h(32-bit)g(\015oating)f(p)s(oin)m(t,)g(or)f(64)h (bit)g(\015oating)g(p)s(oin)m(t)f(pixels.)p eop end %%Page: 113 119 TeXDict begin 113 118 bop 0 299 a Fg(9.6.)72 b(EXAMPLES)3039 b Fi(113)0 555 y(2.)39 b(T)-8 b(o)23 b(create)h(a)f(FITS)e(table,)26 b(the)c(template)i(\014rst)e(needs)g(to)i(include)e(XTENSION)g(=)g(T)-8 b(ABLE)23 b(or)f(BINT)-8 b(ABLE)0 668 y(to)31 b(de\014ne)e(whether)g (it)h(is)g(an)f(ASCI)s(I)g(or)g(binary)g(table,)i(and)f(NAXIS2)g(to)g (de\014ne)f(the)h(n)m(um)m(b)s(er)f(of)h(ro)m(ws)f(in)h(the)0 781 y(table.)50 b(Tw)m(o)34 b(template)g(lines)g(are)g(then)f(needed)f (to)i(de\014ne)f(the)g(name)h(\(TTYPEn\))e(and)h(FITS)g(data)h(format)0 894 y(\(TF)m(ORMn\))d(of)f(the)h(columns,)f(as)h(in)f(this)g(example:) 95 1154 y Fe(xtension)46 b(=)h(bintable)95 1267 y(naxis2)g(=)g(40)95 1380 y(ttype#)g(=)g(Name)95 1492 y(tform#)g(=)g(10a)95 1605 y(ttype#)g(=)g(Npoints)95 1718 y(tform#)g(=)g(j)95 1831 y(ttype#)g(=)g(Rate)95 1944 y(tunit#)g(=)g(counts/s)95 2057 y(tform#)g(=)g(e)0 2317 y Fi(The)26 b(ab)s(o)m(v)m(e)j(example)e (de\014nes)f(a)i(n)m(ull)f(primary)f(arra)m(y)h(follo)m(w)m(ed)i(b)m(y) e(a)g(40-ro)m(w)h(binary)e(table)i(extension)g(with)f(3)0 2430 y(columns)h(called)h('Name',)h('Np)s(oin)m(ts',)f(and)f('Rate',)i (with)e(data)h(formats)f(of)g('10A')i(\(ASCI)s(I)d(c)m(haracter)i (string\),)0 2543 y('1J')k(\(in)m(teger\))i(and)d('1E')i(\(\015oating)f (p)s(oin)m(t\),)h(resp)s(ectiv)m(ely)-8 b(.)50 b(Note)34 b(that)f(the)g(other)g(required)f(FITS)g(k)m(eyw)m(ords)0 2655 y(\(BITPIX,)37 b(NAXIS,)g(NAXIS1,)h(PCOUNT,)e(GCOUNT,)h(TFIELDS,)f (and)g(END\))h(do)g(not)g(need)f(to)h(b)s(e)f(ex-)0 2768 y(plicitly)j(de\014ned)d(in)i(the)f(template)i(b)s(ecause)f(their)g(v) -5 b(alues)38 b(can)g(b)s(e)f(inferred)f(from)i(the)f(other)h(k)m(eyw)m (ords)g(in)0 2881 y(the)d(template.)55 b(This)34 b(example)i(also)g (illustrates)f(that)h(the)f(templates)h(are)f(generally)h (case-insensitiv)m(e)h(\(the)0 2994 y(k)m(eyw)m(ord)29 b(names)g(and)g(TF)m(ORMn)f(v)-5 b(alues)30 b(are)f(con)m(v)m(erted)i (to)e(upp)s(er-case)g(in)f(the)h(FITS)g(\014le\))g(and)f(that)i(string) 0 3107 y(k)m(eyw)m(ord)h(v)-5 b(alues)31 b(generally)g(do)f(not)h(need) f(to)h(b)s(e)f(enclosed)h(in)f(quotes.)p eop end %%Page: 114 120 TeXDict begin 114 119 bop 0 299 a Fi(114)2295 b Fg(CHAPTER)30 b(9.)71 b(TEMPLA)-8 b(TE)30 b(FILES)p eop end %%Page: 115 121 TeXDict begin 115 120 bop 0 1225 a Ff(Chapter)65 b(10)0 1687 y Fl(Summary)76 b(of)i(all)f(FITSIO)0 1937 y(User-In)-6 b(terface)77 b(Subroutines)0 2429 y Fi(Error)29 b(Status)i(Routines)f (page)h(29)382 2696 y Fe(FTVERS\()46 b(>)h(version\))382 2809 y(FTGERR\(status,)d(>)j(errtext\))382 2922 y(FTGMSG\()f(>)h (errmsg\))382 3035 y(FTRPRT)f(\(stream,)f(>)j(status\))382 3147 y(FTPMSG\(errmsg\))382 3260 y(FTPMRK)382 3373 y(FTCMSG)382 3486 y(FTCMRK)0 3753 y Fi(FITS)30 b(File)h(Op)s(en)e(and)h(Close)h (Subroutines:)39 b(page)31 b(35)382 4020 y Fe (FTOPEN\(unit,filename,rwm)o(ode)o(,)42 b(>)47 b(blocksize,status\))382 4133 y(FTDKOPN\(unit,filename,rw)o(mod)o(e,)42 b(>)47 b(blocksize,status\))382 4246 y(FTNOPN\(unit,filename,rwm)o(ode)o(,)42 b(>)47 b(status\))382 4359 y(FTDOPN\(unit,filename,rwm)o(ode)o(,)42 b(>)47 b(status\))382 4472 y(FTTOPN\(unit,filename,rwm)o(ode)o(,)42 b(>)47 b(status\))382 4585 y(FTIOPN\(unit,filename,rwm)o(ode)o(,)42 b(>)47 b(status\))382 4698 y(FTREOPEN\(unit,)d(>)j(newunit,)f(status\)) 382 4811 y(FTINIT\(unit,filename,blo)o(cks)o(ize,)41 b(>)48 b(status\))382 4924 y(FTDKINIT\(unit,filename,b)o(loc)o(ksiz)o (e,)42 b(>)47 b(status\))382 5036 y(FTTPLT\(unit,)d(filename,)i (tplfilename,)e(>)j(status\))382 5149 y(FTFLUS\(unit,)d(>)k(status\)) 382 5262 y(FTCLOS\(unit,)c(>)k(status\))382 5375 y(FTDELT\(unit,)c(>)k (status\))382 5488 y(FTGIOU\()e(>)h(iounit,)f(status\))382 5601 y(FTFIOU\(iounit,)e(>)j(status\))0 5714 y(CFITS2Unit\(fitsfile)c (*ptr\))141 b(\(C)48 b(routine\))1882 5942 y Fi(115)p eop end %%Page: 116 122 TeXDict begin 116 121 bop 0 299 a Fi(116)281 b Fg(CHAPTER)30 b(10.)112 b(SUMMAR)-8 b(Y)32 b(OF)e(ALL)g(FITSIO)f(USER-INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)382 555 y Fe(CUnit2FITS\(int)44 b(unit\))380 b(\(C)47 b(routine\))382 668 y(FTEXTN\(filename,)c(>)48 b(nhdu,)e(status\))382 781 y(FTFLNM\(unit,)e(>)k(filename,)d(status\)) 382 894 y(FTFLMD\(unit,)f(>)k(iomode,)e(status\))382 1007 y(FTURLT\(unit,)e(>)k(urltype,)d(status\))382 1120 y(FTIURL\(filename,)e(>)48 b(filetype,)d(infile,)h(outfile,)f(extspec,) h(filter,)716 1233 y(binspec,)f(colspec,)h(status\))382 1346 y(FTRTNM\(filename,)d(>)48 b(rootname,)d(status\))382 1458 y(FTEXIST\(filename,)e(>)k(exist,)f(status\))0 1695 y Fi(HDU-Lev)m(el)33 b(Op)s(erations:)40 b(page)31 b(38)382 1932 y Fe(FTMAHD\(unit,nhdu,)43 b(>)k(hdutype,status\))382 2045 y(FTMRHD\(unit,nmove,)c(>)k(hdutype,status\))382 2158 y(FTGHDN\(unit,)d(>)k(nhdu\))382 2271 y(FTMNHD\(unit,)c(hdutype,)i (extname,)f(extver,)h(>)i(status\))382 2384 y(FTGHDT\(unit,)c(>)k (hdutype,)d(status\))382 2497 y(FTTHDU\(unit,)f(>)k(hdunum,)e(status\)) 382 2610 y(FTCRHD\(unit,)e(>)k(status\))382 2723 y (FTIIMG\(unit,bitpix,naxis)o(,na)o(xes,)41 b(>)48 b(status\))382 2836 y(FTITAB\(unit,rowlen,nrows)o(,tf)o(ield)o(s,tt)o(ype)o(,tbc)o (ol,t)o(for)o(m,tu)o(nit,)o(ext)o(name)o(,)42 b(>)716 2949 y(status\))382 3061 y(FTIBIN\(unit,nrows,tfield)o(s,t)o(type)o (,tfo)o(rm,)o(tuni)o(t,ex)o(tna)o(me,v)o(arid)o(at)f(>)48 b(status\))382 3174 y(FTRSIM\(unit,bitpix,naxis)o(,na)o(xes,)o(stat)o (us\))382 3287 y(FTDHDU\(unit,)c(>)k(hdutype,status\))382 3400 y(FTCPFL\(iunit,ounit,previ)o(ous)o(,)42 b(current,)j(following,)g (>)j(status\))382 3513 y(FTCOPY\(iunit,ounit,morek)o(eys)o(,)42 b(>)47 b(status\))382 3626 y(FTCPHD\(inunit,)d(outunit,)h(>)j(status\)) 382 3739 y(FTCPDT\(iunit,ounit,)42 b(>)48 b(status\))0 3976 y Fi(Subroutines)29 b(to)i(sp)s(ecify)f(or)g(mo)s(dify)g(the)g (structure)g(of)h(the)f(CHDU:)h(page)h(41)382 4213 y Fe(FTRDEF\(unit,)44 b(>)k(status\))93 b(\(DEPRECATED\))382 4326 y(FTPDEF\(unit,bitpix,naxis)o(,na)o(xes,)o(pcou)o(nt,)o(gcou)o (nt,)41 b(>)48 b(status\))93 b(\(DEPRECATED\))382 4439 y(FTADEF\(unit,rowlen,tfiel)o(ds,)o(tbco)o(l,tf)o(orm)o(,nro)o(ws)42 b(>)47 b(status\))94 b(\(DEPRECATED\))382 4551 y (FTBDEF\(unit,tfields,tfor)o(m,v)o(arid)o(at,n)o(row)o(s)42 b(>)47 b(status\))94 b(\(DEPRECATED\))382 4664 y(FTDDEF\(unit,bytlen,) 42 b(>)48 b(status\))93 b(\(DEPRECATED\))382 4777 y (FTPTHP\(unit,theap,)43 b(>)k(status\))0 5014 y Fi(Header)31 b(Space)f(and)g(P)m(osition)i(Subroutines:)39 b(page)31 b(43)382 5251 y Fe(FTHDEF\(unit,morekeys,)42 b(>)47 b(status\))382 5364 y(FTGHSP\(iunit,)d(>)j(keysexist,keysadd,status\))382 5477 y(FTGHPS\(iunit,)d(>)j(keysexist,key_no,status\))0 5714 y Fi(Read)31 b(or)f(W)-8 b(rite)32 b(Standard)d(Header)i (Subroutines:)39 b(page)31 b(43)p eop end %%Page: 117 123 TeXDict begin 117 122 bop 3764 299 a Fi(117)382 555 y Fe(FTPHPS\(unit,bitpix,naxis)o(,na)o(xes,)41 b(>)48 b(status\))382 668 y(FTPHPR\(unit,simple,bitpi)o(x,n)o(axis)o(,nax)o(es,)o(pcou)o (nt,g)o(cou)o(nt,e)o(xten)o(d,)41 b(>)48 b(status\))382 781 y(FTGHPR\(unit,maxdim,)42 b(>)48 b(simple,bitpix,naxis,naxe)o(s,p)o (coun)o(t,gc)o(oun)o(t,ex)o(tend)o(,)716 894 y(status\))382 1007 y(FTPHTB\(unit,rowlen,nrows)o(,tf)o(ield)o(s,tt)o(ype)o(,tbc)o (ol,t)o(for)o(m,tu)o(nit,)o(ext)o(name)o(,)42 b(>)716 1120 y(status\))382 1233 y(FTGHTB\(unit,maxdim,)g(>)48 b(rowlen,nrows,tfields,tty)o(pe,)o(tbco)o(l,tf)o(orm)o(,tun)o(it,)716 1346 y(extname,status\))382 1458 y(FTPHBN\(unit,nrows,tfield)o(s,t)o (type)o(,tfo)o(rm,)o(tuni)o(t,ex)o(tna)o(me,v)o(arid)o(at)41 b(>)48 b(status\))382 1571 y(FTGHBN\(unit,maxdim,)42 b(>)48 b(nrows,tfields,ttype,tfor)o(m,t)o(unit)o(,ext)o(nam)o(e,va)o (rida)o(t,)716 1684 y(status\))0 1942 y Fi(W)-8 b(rite)32 b(Keyw)m(ord)e(Subroutines:)39 b(page)31 b(45)382 2199 y Fe(FTPREC\(unit,card,)43 b(>)k(status\))382 2312 y (FTPCOM\(unit,comment,)42 b(>)48 b(status\))382 2425 y(FTPHIS\(unit,history,)42 b(>)48 b(status\))382 2538 y(FTPDAT\(unit,)c(>)k(status\))382 2651 y(FTPKY[JKLS]\(unit,keyword)o (,ke)o(yval)o(,com)o(men)o(t,)42 b(>)47 b(status\))382 2764 y(FTPKY[EDFG]\(unit,keyword)o(,ke)o(yval)o(,dec)o(ima)o(ls,c)o (omme)o(nt,)41 b(>)48 b(status\))382 2877 y(FTPKLS\(unit,keyword,keyv)o (al,)o(comm)o(ent,)41 b(>)47 b(status\))382 2990 y(FTPLSW\(unit,)d(>)k (status\))382 3103 y(FTPKYU\(unit,keyword,comm)o(ent)o(,)42 b(>)47 b(status\))382 3216 y(FTPKN[JKLS]\(unit,keyroot)o(,st)o(artn)o (o,no)o(_ke)o(ys,k)o(eyva)o(ls,)o(comm)o(ents)o(,)42 b(>)47 b(status\))382 3329 y(FTPKN[EDFG]\(unit,keyroot)o(,st)o(artn)o (o,no)o(_ke)o(ys,k)o(eyva)o(ls,)o(deci)o(mals)o(,co)o(mmen)o(ts,)41 b(>)907 3441 y(status\))382 3554 y(FTCPKYinunit,)j(outunit,)i(innum,)g (outnum,)f(keyroot,)h(>)h(status\))382 3667 y (FTPKYT\(unit,keyword,intv)o(al,)o(dblv)o(al,c)o(omm)o(ent,)41 b(>)48 b(status\))382 3780 y(FTPKTP\(unit,)c(filename,)i(>)h(status\)) 382 3893 y(FTPUNT\(unit,keyword,unit)o(s,)41 b(>)48 b(status\))0 4151 y Fi(Insert)30 b(Keyw)m(ord)g(Subroutines:)39 b(page)31 b(47)382 4408 y Fe(FTIREC\(unit,key_no,card,)41 b(>)47 b(status\))382 4521 y(FTIKY[JKLS]\(unit,keyword)o(,ke)o(yval)o(,com)o (men)o(t,)42 b(>)47 b(status\))382 4634 y(FTIKLS\(unit,keyword,keyv)o (al,)o(comm)o(ent,)41 b(>)47 b(status\))382 4747 y (FTIKY[EDFG]\(unit,keyword)o(,ke)o(yval)o(,dec)o(ima)o(ls,c)o(omme)o (nt,)41 b(>)48 b(status\))382 4860 y(FTIKYU\(unit,keyword,comm)o(ent)o (,)42 b(>)47 b(status\))0 5118 y Fi(Read)31 b(Keyw)m(ord)f (Subroutines:)39 b(page)31 b(47)382 5375 y Fe(FTGREC\(unit,key_no,)42 b(>)48 b(card,status\))382 5488 y(FTGKYN\(unit,key_no,)42 b(>)48 b(keyword,value,comment,st)o(atu)o(s\))382 5601 y(FTGCRD\(unit,keyword,)42 b(>)48 b(card,status\))382 5714 y(FTGNXK\(unit,inclist,ninc)o(,ex)o(clis)o(t,ne)o(xc,)41 b(>)48 b(card,status\))p eop end %%Page: 118 124 TeXDict begin 118 123 bop 0 299 a Fi(118)281 b Fg(CHAPTER)30 b(10.)112 b(SUMMAR)-8 b(Y)32 b(OF)e(ALL)g(FITSIO)f(USER-INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)382 555 y Fe(FTGKEY\(unit,keyword,)42 b(>)48 b(value,comment,status\))382 668 y(FTGKY[EDJKLS]\(unit,keywo)o (rd,)41 b(>)48 b(keyval,comment,status\))382 781 y (FTGKSL\(unit,keyword,)42 b(>)48 b(length,status\))382 894 y(FTGSKY\(unit,keyword,firs)o(tch)o(ar,m)o(axch)o(ar,)o(>)42 b(keyval,length,comment,st)o(atus)o(\))382 1007 y (FTGKN[EDJKLS]\(unit,keyro)o(ot,)o(star)o(tno,)o(max)o(_key)o(s,)g(>)47 b(keyvals,nfound,status\))382 1120 y(FTGKYT\(unit,keyword,)42 b(>)48 b(intval,dblval,comment,s)o(tat)o(us\))382 1233 y(FTGUNT\(unit,keyword,)42 b(>)48 b(units,status\))0 1489 y Fi(Mo)s(dify)30 b(Keyw)m(ord)g(Subroutines:)39 b(page)31 b(49)382 1745 y Fe(FTMREC\(unit,key_no,card,)41 b(>)47 b(status\))382 1858 y(FTMCRD\(unit,keyword,card)o(,)42 b(>)47 b(status\))382 1971 y(FTMNAM\(unit,oldkey,keywo)o(rd,)41 b(>)48 b(status\))382 2084 y(FTMCOM\(unit,keyword,comm)o(ent)o(,)42 b(>)47 b(status\))382 2197 y(FTMKY[JKLS]\(unit,keyword)o(,ke)o(yval)o (,com)o(men)o(t,)42 b(>)47 b(status\))382 2310 y (FTMKLS\(unit,keyword,keyv)o(al,)o(comm)o(ent,)41 b(>)47 b(status\))382 2422 y(FTMKY[EDFG]\(unit,keyword)o(,ke)o(yval)o(,dec)o (ima)o(ls,c)o(omme)o(nt,)41 b(>)48 b(status\))382 2535 y(FTMKYU\(unit,keyword,comm)o(ent)o(,)42 b(>)47 b(status\))0 2792 y Fi(Up)s(date)30 b(Keyw)m(ord)g(Subroutines:)39 b(page)32 b(50)382 3048 y Fe(FTUCRD\(unit,keyword,card)o(,)42 b(>)47 b(status\))382 3161 y(FTUKY[JKLS]\(unit,keyword)o(,ke)o(yval)o (,com)o(men)o(t,)42 b(>)47 b(status\))382 3274 y (FTUKLS\(unit,keyword,keyv)o(al,)o(comm)o(ent,)41 b(>)47 b(status\))382 3386 y(FTUKY[EDFG]\(unit,keyword)o(,ke)o(yval)o(,dec)o (ima)o(ls,c)o(omme)o(nt,)41 b(>)48 b(status\))382 3499 y(FTUKYU\(unit,keyword,comm)o(ent)o(,)42 b(>)47 b(status\))0 3756 y Fi(Delete)33 b(Keyw)m(ord)d(Subroutines:)39 b(page)31 b(51)382 4012 y Fe(FTDREC\(unit,key_no,)42 b(>)48 b(status\))382 4125 y(FTDKEY\(unit,keyword,)42 b(>)48 b(status\))0 4381 y Fi(De\014ne)31 b(Data)h(Scaling)f(P)m(arameters)g(and)f(Unde\014ned)f (Pixel)i(Flags:)42 b(page)31 b(51)382 4637 y Fe (FTPSCL\(unit,bscale,bzero)o(,)42 b(>)47 b(status\))382 4750 y(FTTSCL\(unit,colnum,tscal)o(,tz)o(ero,)41 b(>)48 b(status\))382 4863 y(FTPNUL\(unit,blank,)43 b(>)k(status\))382 4976 y(FTSNUL\(unit,colnum,snull)41 b(>)47 b(status\))382 5089 y(FTTNUL\(unit,colnum,tnull)41 b(>)47 b(status\))0 5345 y Fi(FITS)30 b(Primary)f(Arra)m(y)i(or)f(IMA)m(GE)i(Extension)e (I/O)h(Subroutines:)39 b(page)31 b(52)382 5601 y Fe(FTGIDT\(unit,)44 b(>)k(bitpix,status\))382 5714 y(FTGIET\(unit,)c(>)k(bitpix,status\))p eop end %%Page: 119 125 TeXDict begin 119 124 bop 3764 299 a Fi(119)382 555 y Fe(FTGIDM\(unit,)44 b(>)k(naxis,status\))382 668 y(FTGISZ\(unit,)c (maxdim,)i(>)i(naxes,status\))382 781 y(FTGIPR\(unit,)c(maxdim,)i(>)i (bitpix,naxis,naxes,stat)o(us\))382 894 y(FTPPR[BIJKED]\(unit,group)o (,fp)o(ixel)o(,nel)o(eme)o(nts,)o(valu)o(es,)41 b(>)48 b(status\))382 1007 y(FTPPN[BIJKED]\(unit,group)o(,fp)o(ixel)o(,nel)o (eme)o(nts,)o(valu)o(es,)o(null)o(val)41 b(>)48 b(status\))382 1120 y(FTPPRU\(unit,group,fpixel)o(,ne)o(leme)o(nts,)41 b(>)47 b(status\))382 1233 y(FTGPV[BIJKED]\(unit,group)o(,fp)o(ixel)o (,nel)o(eme)o(nts,)o(null)o(val)o(,)42 b(>)47 b(values,anyf,status\)) 382 1346 y(FTGPF[BIJKED]\(unit,group)o(,fp)o(ixel)o(,nel)o(eme)o(nts,) 41 b(>)48 b(values,flagvals,anyf,st)o(atu)o(s\))382 1458 y(FTPGP[BIJKED]\(unit,group)o(,fp)o(arm,)o(npar)o(m,v)o(alue)o(s,)42 b(>)47 b(status\))382 1571 y(FTGGP[BIJKED]\(unit,group)o(,fp)o(arm,)o (npar)o(m,)41 b(>)48 b(values,status\))382 1684 y (FTP2D[BIJKED]\(unit,group)o(,di)o(m1,n)o(axis)o(1,n)o(axis)o(2,im)o (age)o(,)42 b(>)47 b(status\))382 1797 y(FTP3D[BIJKED]\(unit,group)o (,di)o(m1,d)o(im2,)o(nax)o(is1,)o(naxi)o(s2,)o(naxi)o(s3,c)o(ube)o(,)42 b(>)47 b(status\))382 1910 y(FTG2D[BIJKED]\(unit,group)o(,nu)o(llva)o (l,di)o(m1,)o(naxi)o(s1,n)o(axi)o(s2,)41 b(>)48 b(image,anyf,status\)) 382 2023 y(FTG3D[BIJKED]\(unit,group)o(,nu)o(llva)o(l,di)o(m1,)o(dim2)o (,nax)o(is1)o(,nax)o(is2,)o(nax)o(is3,)41 b(>)1002 2136 y(cube,anyf,status\))382 2249 y(FTPSS[BIJKED]\(unit,group)o(,na)o(xis,) o(naxe)o(s,f)o(pixe)o(ls,l)o(pix)o(els,)o(arra)o(y,)g(>)48 b(status\))382 2362 y(FTGSV[BIJKED]\(unit,group)o(,na)o(xis,)o(naxe)o (s,f)o(pixe)o(ls,l)o(pix)o(els,)o(incs)o(,nu)o(llva)o(l,)42 b(>)1002 2475 y(array,anyf,status\))382 2588 y (FTGSF[BIJKED]\(unit,group)o(,na)o(xis,)o(naxe)o(s,f)o(pixe)o(ls,l)o (pix)o(els,)o(incs)o(,)g(>)1002 2700 y(array,flagvals,anyf,statu)o(s\)) 0 2974 y Fi(T)-8 b(able)31 b(Column)e(Information)i(Subroutines:)39 b(page)31 b(55)382 3247 y Fe(FTGNRW\(unit,)44 b(>)k(nrows,)e(status\)) 382 3360 y(FTGNCL\(unit,)e(>)k(ncols,)e(status\))382 3473 y(FTGCNO\(unit,casesen,colt)o(emp)o(late)o(,)c(>)47 b(colnum,status\))382 3586 y(FTGCNN\(unit,casesen,colt)o(emp)o(late)o (,)42 b(>)47 b(colnam,colnum,status\))382 3699 y(FTGTCL\(unit,colnum,) 42 b(>)48 b(datacode,repeat,width,st)o(atu)o(s\))382 3812 y(FTEQTY\(unit,colnum,)42 b(>)48 b(datacode,repeat,width,st)o(atu) o(s\))382 3925 y(FTGCDW\(unit,colnum,)42 b(>)48 b(dispwidth,status\)) 382 4038 y(FTGACL\(unit,colnum,)42 b(>)716 4151 y (ttype,tbcol,tunit,tform,)o(tsca)o(l,t)o(zero)o(,snu)o(ll,)o(tdis)o (p,st)o(atu)o(s\))382 4264 y(FTGBCL\(unit,colnum,)g(>)716 4377 y(ttype,tunit,datatype,rep)o(eat,)o(tsc)o(al,t)o(zero)o(,tn)o (ull,)o(tdis)o(p,s)o(tatu)o(s\))382 4489 y(FTPTDM\(unit,colnum,naxis)o (,na)o(xes,)f(>)48 b(status\))382 4602 y(FTGTDM\(unit,colnum,maxdi)o (m,)41 b(>)48 b(naxis,naxes,status\))382 4715 y (FTDTDM\(unit,tdimstr,coln)o(um,)o(maxd)o(im,)41 b(>)48 b(naxis,naxes,)c(status\))382 4828 y(FTGRSZ\(unit,)g(>)k (nrows,status\))0 5102 y Fi(Lo)m(w-Lev)m(el)32 b(T)-8 b(able)31 b(Access)h(Subroutines:)39 b(page)31 b(58)382 5375 y Fe(FTGTBS\(unit,frow,startch)o(ar,)o(ncha)o(rs,)41 b(>)48 b(string,status\))382 5488 y(FTPTBS\(unit,frow,startch)o(ar,)o (ncha)o(rs,s)o(tri)o(ng,)41 b(>)48 b(status\))382 5601 y(FTGTBB\(unit,frow,startch)o(ar,)o(ncha)o(rs,)41 b(>)48 b(array,status\))382 5714 y(FTPTBB\(unit,frow,startch)o(ar,)o(ncha)o (rs,a)o(rra)o(y,)42 b(>)47 b(status\))p eop end %%Page: 120 126 TeXDict begin 120 125 bop 0 299 a Fi(120)281 b Fg(CHAPTER)30 b(10.)112 b(SUMMAR)-8 b(Y)32 b(OF)e(ALL)g(FITSIO)f(USER-INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)0 555 y Fi(Edit)g(Ro)m(ws)h(or)f(Columns)g (page)h(59)382 813 y Fe(FTIROW\(unit,frow,nrows,)41 b(>)48 b(status\))382 926 y(FTDROW\(unit,frow,nrows,)41 b(>)48 b(status\))382 1039 y(FTDRRG\(unit,rowrange,)42 b(>)47 b(status\))382 1152 y(FTDRWS\(unit,rowlist,nrow)o(s,)41 b(>)48 b(status\))382 1264 y(FTICOL\(unit,colnum,ttype)o(,tf)o(orm,)41 b(>)48 b(status\))382 1377 y(FTICLS\(unit,colnum,ncols)o(,tt)o(ype,)o (tfor)o(m,)41 b(>)48 b(status\))382 1490 y(FTMVEC\(unit,colnum,newve)o (cle)o(n,)42 b(>)47 b(status\))382 1603 y(FTDCOL\(unit,colnum,)42 b(>)48 b(status\))382 1716 y(FTCPCL\(inunit,outunit,in)o(col)o(num,)o (outc)o(oln)o(um,c)o(reat)o(eco)o(l,)42 b(>)47 b(status\);)0 1974 y Fi(Read)31 b(and)e(W)-8 b(rite)32 b(Column)e(Data)i(Routines)e (page)h(60)382 2231 y Fe(FTPCL[SLBIJKEDCM]\(unit,c)o(oln)o(um,f)o(row,) o(fel)o(em,n)o(elem)o(ent)o(s,va)o(lues)o(,)42 b(>)47 b(status\))382 2344 y(FTPCN[BIJKED]\(unit,colnu)o(m,f)o(row,)o(fele)o (m,n)o(elem)o(ents)o(,va)o(lues)o(,nul)o(lva)o(l)42 b(>)47 b(status\))382 2457 y(FTPCLX\(unit,colnum,frow,)o(fbi)o(t,nb)o(it,l)o (ray)o(,)42 b(>)47 b(status\))382 2570 y(FTPCLU\(unit,colnum,frow,)o (fel)o(em,n)o(elem)o(ent)o(s,)42 b(>)47 b(status\))382 2683 y(FTGCL\(unit,colnum,frow,f)o(ele)o(m,ne)o(leme)o(nts)o(,)42 b(>)47 b(values,status\))382 2796 y(FTGCV[SBIJKEDCM]\(unit,co)o(lnu)o (m,fr)o(ow,f)o(ele)o(m,ne)o(leme)o(nts)o(,nul)o(lval)o(,)42 b(>)1098 2909 y(values,anyf,status\))382 3022 y (FTGCF[SLBIJKEDCM]\(unit,c)o(oln)o(um,f)o(row,)o(fel)o(em,n)o(elem)o (ent)o(s,)g(>)1193 3135 y(values,flagvals,anyf,stat)o(us\))382 3247 y(FTGSV[BIJKED]\(unit,colnu)o(m,n)o(axis)o(,nax)o(es,)o(fpix)o (els,)o(lpi)o(xels)o(,inc)o(s,n)o(ullv)o(al,)f(>)1002 3360 y(array,anyf,status\))382 3473 y(FTGSF[BIJKED]\(unit,colnu)o(m,n)o (axis)o(,nax)o(es,)o(fpix)o(els,)o(lpi)o(xels)o(,inc)o(s,)g(>)1002 3586 y(array,flagvals,anyf,statu)o(s\))382 3699 y (FTGCX\(unit,colnum,frow,f)o(bit)o(,nbi)o(t,)h(>)47 b(lray,status\))382 3812 y(FTGCX[IJD]\(unit,colnum,f)o(row)o(,nro)o(ws,f)o(bit)o(,nbi)o(t,) 42 b(>)47 b(array,status\))382 3925 y(FTGDES\(unit,colnum,rownu)o(m,)41 b(>)48 b(nelements,offset,status\))382 4038 y (FTPDES\(unit,colnum,rownu)o(m,n)o(elem)o(ents)o(,of)o(fset)o(,)42 b(>)47 b(status\))0 4295 y Fi(Ro)m(w)31 b(Selection)h(and)d(Calculator) j(Routines:)41 b(page)31 b(64)382 4553 y Fe(FTFROW\(unit,expr,firstro)o (w,)41 b(nrows,)47 b(>)g(n_good_rows,)d(row_status,)h(status\))382 4666 y(FTFFRW\(unit,)f(expr,)j(>)g(rownum,)f(status\))382 4779 y(FTSROW\(inunit,)e(outunit,)h(expr,)i(>)g(status)f(\))382 4892 y(FTCROW\(unit,datatype,exp)o(r,f)o(irst)o(row,)o(nel)o(emen)o (ts,n)o(ulv)o(al,)41 b(>)620 5005 y(array,anynul,status\))382 5118 y(FTCALC\(inunit,)j(expr,)i(outunit,)g(parName,)f(parInfo,)h(>)h (status\))382 5230 y(FTCALC_RNG\(inunit,)c(expr,)j(outunit,)g(parName,) f(parInfo,)573 5343 y(nranges,)g(firstrow,)h(lastrow,)f(>)j(status\)) 382 5456 y(FTTEXP\(unit,)c(expr,)j(>)g(datatype,)e(nelem,)h(naxis,)h (naxes,)f(status\))0 5714 y Fi(Celestial)32 b(Co)s(ordinate)f(System)f (Subroutines:)39 b(page)31 b(65)p eop end %%Page: 121 127 TeXDict begin 121 126 bop 3764 299 a Fi(121)382 555 y Fe(FTGICS\(unit,)44 b(>)k(xrval,yrval,xrpix,yrpix)o(,xin)o(c,yi)o(nc,)o (rot,)o(coor)o(dty)o(pe,s)o(tatu)o(s\))382 668 y (FTGTCS\(unit,xcol,ycol,)42 b(>)716 781 y(xrval,yrval,xrpix,yrpix,)o (xinc)o(,yi)o(nc,r)o(ot,c)o(oor)o(dtyp)o(e,st)o(atu)o(s\))382 894 y(FTWLDP\(xpix,ypix,xrval,y)o(rva)o(l,xr)o(pix,)o(yrp)o(ix,x)o (inc,)o(yin)o(c,ro)o(t,)1241 1007 y(coordtype,)j(>)i (xpos,ypos,status\))382 1120 y(FTXYPX\(xpos,ypos,xrval,y)o(rva)o(l,xr)o (pix,)o(yrp)o(ix,x)o(inc,)o(yin)o(c,ro)o(t,)1241 1233 y(coordtype,)e(>)i(xpix,ypix,status\))0 1490 y Fi(File)32 b(Chec)m(ksum)d(Subroutines:)40 b(page)31 b(67)382 1748 y Fe(FTPCKS\(unit,)44 b(>)k(status\))382 1861 y(FTUCKS\(unit,)c(>)k (status\))382 1974 y(FTVCKS\(unit,)c(>)k(dataok,hduok,status\))382 2087 y(FTGCKS\(unit,)c(>)k(datasum,hdusum,status\))382 2199 y(FTESUM\(sum,complement,)42 b(>)47 b(checksum\))382 2312 y(FTDSUM\(checksum,compleme)o(nt,)41 b(>)48 b(sum\))0 2683 y Fi(Time)30 b(and)g(Date)i(Utilit)m(y)h(Subroutines:)39 b(page)31 b(68)382 2940 y Fe(FTGSDT\()46 b(>)h(day,)g(month,)f(year,)g (status)g(\))382 3053 y(FTGSTM\(>)f(datestr,)h(timeref,)f(status\))382 3166 y(FTDT2S\()h(year,)g(month,)g(day,)h(>)g(datestr,)f(status\))382 3279 y(FTTM2S\()g(year,)g(month,)g(day,)h(hour,)f(minute,)g(second,)g (decimals,)764 3392 y(>)h(datestr,)f(status\))382 3505 y(FTS2DT\(datestr,)d(>)48 b(year,)e(month,)g(day,)h(status\))382 3618 y(FTS2TM\(datestr,)c(>)48 b(year,)e(month,)g(day,)h(hour,)f (minute,)g(second,)g(status\))0 3876 y Fi(General)31 b(Utilit)m(y)i(Subroutines:)39 b(page)31 b(69)382 4133 y Fe(FTGHAD\(unit,)44 b(>)k(curaddr,nextaddr\))382 4246 y(FTUPCH\(string\))382 4359 y(FTCMPS\(str_template,stri)o(ng,)o(case)o (sen,)41 b(>)47 b(match,exact\))382 4472 y(FTTKEY\(keyword,)c(>)48 b(status\))382 4585 y(FTTREC\(card,)c(>)k(status\))382 4698 y(FTNCHK\(unit,)c(>)k(status\))382 4811 y(FTGKNM\(unit,)c(>)k (keyword,)d(keylength,)g(status\))382 4924 y(FTMKKY\(keyword,)e (value,comment,)h(>)k(card,)e(status\))382 5036 y(FTPSVC\(card,)e(>)k (value,comment,status\))382 5149 y(FTKEYN\(keyroot,seq_no,)42 b(>)47 b(keyword,status\))382 5262 y(FTNKEY\(seq_no,keyroot,)42 b(>)47 b(keyword,status\))382 5375 y(FTDTYP\(value,)d(>)j (dtype,status\))382 5488 y(class)f(=)i(FTGKCL\(card\))382 5601 y(FTASFM\(tform,)c(>)j(datacode,width,decimals,st)o(atus)o(\))382 5714 y(FTBNFM\(tform,)d(>)j(datacode,repeat,width,stat)o(us\))p eop end %%Page: 122 128 TeXDict begin 122 127 bop 0 299 a Fi(122)281 b Fg(CHAPTER)30 b(10.)112 b(SUMMAR)-8 b(Y)32 b(OF)e(ALL)g(FITSIO)f(USER-INTERF)-10 b(A)m(CE)30 b(SUBR)m(OUTINES)382 555 y Fe(FTGABC\(tfields,tform,spa)o (ce,)41 b(>)48 b(rowlen,tbcol,status\))382 668 y(FTGTHD\(template,)43 b(>)48 b(card,hdtype,status\))382 781 y(FTRWRG\(rowlist,)43 b(maxrows,)j(maxranges,)f(>)i(numranges,)e(rangemin,)716 894 y(rangemax,)g(status\))p eop end %%Page: 123 129 TeXDict begin 123 128 bop 0 1225 a Ff(Chapter)65 b(11)0 1687 y Fl(P)-6 b(arameter)77 b(De\014nitions)0 2180 y Fe(anyf)47 b(-)g(\(logical\))e(set)i(to)g(TRUE)g(if)g(any)g(of)g(the)g (returned)f(data)g(values)h(are)f(undefined)0 2293 y(array)g(-)i(\(any) e(datatype)g(except)g(character\))f(array)h(of)i(bytes)e(to)h(be)g (read)g(or)g(written.)0 2406 y(bitpix)f(-)i(\(integer\))d(bits)h(per)h (pixel:)f(8,)i(16,)f(32,)f(-32,)h(or)g(-64)0 2518 y(blank)f(-)i (\(integer\))d(value)h(used)h(for)g(undefined)e(pixels)h(in)i(integer)d (primary)h(array)0 2631 y(blank)g(-)i(\(integer*8\))d(value)h(used)h (for)f(undefined)g(pixels)g(in)h(integer)f(primary)g(array)0 2744 y(blocksize)f(-)j(\(integer\))d(2880-byte)g(logical)h(record)g (blocking)g(factor)477 2857 y(\(if)h(0)h(<)f(blocksize)e(<)j(11\))f(or) g(the)g(actual)f(block)g(size)h(in)g(bytes)477 2970 y(\(if)g(10)g(<)h (blocksize)d(<)j(28800\).)93 b(As)47 b(of)g(version)f(3.3)h(of)g (FITSIO,)477 3083 y(blocksizes)e(greater)h(than)h(2880)f(are)h(no)g (longer)g(supported.)0 3196 y(bscale)f(-)i(\(double)d(precision\))g (scaling)h(factor)g(for)h(the)g(primary)f(array)0 3309 y(bytlen)g(-)i(\(integer\))d(length)h(of)h(the)g(data)g(unit,)f(in)h (bytes)0 3422 y(bzero)f(-)i(\(double)e(precision\))f(zero)h(point)h (for)g(primary)e(array)i(scaling)0 3535 y(card)g(-)g(\(character*80\))d (header)i(record)g(to)h(be)h(read)e(or)h(written)0 3648 y(casesen)f(-)h(\(logical\))f(will)g(string)g(matching)g(be)h(case)g (sensitive?)0 3760 y(checksum)f(-)h(\(character*16\))d(encoded)i (checksum)f(string)0 3873 y(colname)h(-)h(\(character\))e(ASCII)h(name) h(of)g(the)g(column)0 3986 y(colnum)f(-)i(\(integer\))d(number)h(of)h (the)g(column)f(\(first)g(column)g(=)i(1\))0 4099 y(coltemplate)d(-)i (\(character\))e(template)g(string)i(to)g(be)g(matched)f(to)h(column)f (names)0 4212 y(comment)g(-)h(\(character\))e(the)i(keyword)f(comment)g (field)0 4325 y(comments)g(-)h(\(character)e(array\))h(keyword)g (comment)g(fields)0 4438 y(compid)g(-)i(\(integer\))d(the)i(type)f(of)i (computer)d(that)i(the)g(program)e(is)j(running)d(on)0 4551 y(complement)g(-)i(\(logical\))f(should)g(the)h(checksum)e(be)i (complemented?)0 4664 y(coordtype)e(-)j(\(character\))c(type)j(of)g (coordinate)e(projection)g(\(-SIN,)h(-TAN,)h(-ARC,)477 4777 y(-NCP,)g(-GLS,)f(-MER,)g(or)i(-AIT\))0 4890 y(cube)f(-)g(3D)g (data)g(cube)g(of)g(the)g(appropriate)d(datatype)0 5002 y(curaddr)i(-)h(\(integer\))f(starting)f(address)h(\(in)h(bytes\))f(of) h(the)g(CHDU)0 5115 y(current)f(-)h(\(integer\))f(if)h(not)g(equal)f (to)h(0,)g(copy)g(the)g(current)f(HDU)0 5228 y(datacode)g(-)h (\(integer\))e(symbolic)h(code)g(of)i(the)f(binary)f(table)g(column)g (datatype)0 5341 y(dataok)g(-)i(\(integer\))d(was)i(the)g(data)f(unit)h (verification)d(successful)h(\(=1\))i(or)430 5454 y(not)f(\(=)i(-1\).) 94 b(Equals)46 b(zero)h(if)g(the)g(DATASUM)f(keyword)f(is)j(not)f (present.)0 5567 y(datasum)f(-)h(\(double)f(precision\))f(32-bit)h(1's) h(complement)e(checksum)h(for)h(the)f(data)h(unit)0 5680 y(datatype)f(-)h(\(character\))e(datatype)g(\(format\))h(of)h(the)g (binary)f(table)g(column)1882 5942 y Fi(123)p eop end %%Page: 124 130 TeXDict begin 124 129 bop 0 299 a Fi(124)1779 b Fg(CHAPTER)30 b(11.)112 b(P)-8 b(ARAMETER)30 b(DEFINITIONS)0 555 y Fe(datestr)94 b(-)47 b(\(string\))f(FITS)g(date/time)f(string:)h ('YYYY-MM-DDThh:mm:ss.ddd')o(,)525 668 y('YYYY-MM-dd',)e(or)j ('dd/mm/yy')0 781 y(day)g(-)g(\(integer\))f(current)f(day)i(of)h(the)e (month)0 894 y(dblval)g(-)i(\(double)d(precision\))g(fractional)g(part) i(of)g(the)g(keyword)f(value)0 1007 y(decimals)g(-)h(\(integer\))e (number)h(of)i(decimal)d(places)h(to)i(be)f(displayed)0 1120 y(dim1)g(-)g(\(integer\))e(actual)h(size)h(of)g(the)g(first)g (dimension)e(of)i(the)g(image)f(or)h(cube)g(array)0 1233 y(dim2)g(-)g(\(integer\))e(actual)h(size)h(of)g(the)g(second)f (dimension)g(of)h(the)g(cube)f(array)0 1346 y(dispwidth)f(-)j (\(integer\))d(-)i(the)g(display)f(width)h(\(length)e(of)j(string\))d (for)i(a)h(column)0 1458 y(dtype)e(-)i(\(character\))d(datatype)g(of)i (the)g(keyword)f(\('C',)g('L',)h('I',)94 b(or)48 b('F'\))764 1571 y(C)f(=)h(character)d(string)764 1684 y(L)i(=)h(logical)764 1797 y(I)f(=)h(integer)764 1910 y(F)f(=)h(floating)d(point)h(number)0 2023 y(errmsg)g(-)i(\(character*80\))43 b(oldest)k(error)f(message)g (on)h(the)g(internal)e(stack)0 2136 y(errtext)h(-)h(\(character*30\))d (descriptive)h(error)h(message)g(corresponding)e(to)j(error)g(number)0 2249 y(casesen)f(-)h(\(logical\))f(true)g(if)h(column)f(name)h (matching)f(is)h(case)f(sensitive)0 2362 y(exact)g(-)i(\(logical\))d (do)i(the)g(strings)f(match)g(exactly,)g(or)h(were)g(wildcards)e(used?) 0 2475 y(exclist)94 b(\(character)45 b(array\))h(list)g(of)h(names)g (to)g(be)g(excluded)f(from)g(search)0 2588 y(exists)142 b(-)47 b(flag)g(indicating)e(whether)g(the)i(file)g(or)g(compressed)e (file)i(exists)f(on)h(disk)0 2700 y(extend)f(-)i(\(logical\))d(true)h (if)i(there)e(may)h(be)g(extensions)e(following)g(the)i(primary)f(data) 0 2813 y(extname)g(-)h(\(character\))e(value)h(of)i(the)e(EXTNAME)g (keyword)g(\(if)h(not)g(blank\))0 2926 y(fbit)g(-)g(\(integer\))e (first)i(bit)g(in)g(the)g(field)f(to)h(be)g(read)g(or)g(written)0 3039 y(felem)f(-)i(\(integer\))d(first)h(pixel)h(of)g(the)g(element)f (vector)g(\(ignored)f(for)i(ASCII)g(tables\))0 3152 y(filename)f(-)h (\(character\))e(name)h(of)i(the)e(FITS)h(file)0 3265 y(flagvals)f(-)h(\(logical)f(array\))g(True)g(if)h(corresponding)e (data)h(element)g(is)h(undefined)0 3378 y(following)e(-)j(\(integer\))d (if)i(not)g(equal)f(to)i(0,)f(copy)f(all)h(following)f(HDUs)g(in)h(the) g(input)g(file)0 3491 y(fparm)f(-)i(\(integer\))d(sequence)h(number)g (of)h(the)g(first)f(group)h(parameter)e(to)i(read)g(or)g(write)0 3604 y(fpixel)f(-)i(\(integer\))d(the)i(first)f(pixel)g(position)0 3717 y(fpixels)g(-)h(\(integer)f(array\))g(the)h(first)f(included)g (pixel)g(in)h(each)g(dimension)0 3830 y(frow)g(-)g(\(integer\))e (beginning)h(row)h(number)f(\(first)g(row)h(of)g(table)f(=)i(1\))0 3942 y(frowll)e(-)i(\(integer*8\))c(beginning)i(row)g(number)h(\(first) f(row)h(of)g(table)f(=)i(1\))0 4055 y(gcount)e(-)i(\(integer\))d(value) h(of)h(the)g(GCOUNT)f(keyword)g(\(usually)g(=)h(1\))0 4168 y(group)f(-)i(\(integer\))d(sequence)h(number)g(of)h(the)g(data)f (group)h(\(=0)g(for)g(non-grouped)d(data\))0 4281 y(hdtype)i(-)i (\(integer\))d(header)h(record)g(type:)g(-1=delete;)93 b(0=append)46 b(or)h(replace;)907 4394 y(1=append;)e(2=this)h(is)h(the) g(END)g(keyword)0 4507 y(hduok)f(-)i(\(integer\))d(was)i(the)g(HDU)g (verification)d(successful)h(\(=1\))i(or)430 4620 y(not)f(\(=)i(-1\).) 94 b(Equals)46 b(zero)h(if)g(the)g(CHECKSUM)e(keyword)h(is)h(not)g (present.)0 4733 y(hdusum)f(-)i(\(double)d(precision\))g(32)j(bit)e (1's)h(complement)e(checksum)h(for)h(the)g(entire)f(CHDU)0 4846 y(hdutype)g(-)h(\(integer\))f(type)g(of)h(HDU:)g(0)g(=)h(primary)e (array)g(or)h(IMAGE,)f(1)i(=)f(ASCII)g(table,)907 4959 y(2)g(=)h(binary)e(table,)g(-1)h(=)h(any)e(HDU)h(type)g(or)g(unknown)f (type)0 5072 y(history)g(-)h(\(character\))e(the)i(HISTORY)f(keyword)g (comment)f(string)0 5185 y(hour)i(-)g(\(integer\))e(hour)i(from)g(0)g (-)h(23)0 5297 y(image)e(-)i(2D)f(image)f(of)i(the)e(appropriate)f (datatype)0 5410 y(inclist)94 b(\(character)45 b(array\))h(list)g(of)h (names)g(to)g(be)g(included)f(in)h(search)0 5523 y(incs)g(-)g (\(integer)f(array\))g(sampling)f(interval)h(for)h(pixels)f(in)h(each)g (FITS)f(dimension)0 5636 y(intval)g(-)i(\(integer\))d(integer)h(part)g (of)h(the)g(keyword)f(value)p eop end %%Page: 125 131 TeXDict begin 125 130 bop 3764 299 a Fi(125)0 555 y Fe(iounit)46 b(-)i(\(integer\))d(value)h(of)h(an)h(unused)e(I/O)h(unit)f(number)0 668 y(iunit)g(-)i(\(integer\))d(logical)h(unit)h(number)f(associated)f (with)h(the)h(input)g(FITS)f(file,)h(1-300)0 781 y(key_no)f(-)i (\(integer\))d(sequence)g(number)h(\(starting)g(with)g(1\))i(of)f(the)g (keyword)e(record)0 894 y(keylength)g(-)j(\(integer\))d(length)h(of)h (the)g(keyword)f(name)0 1007 y(keyroot)g(-)h(\(character\))e(root)i (string)f(for)h(the)g(keyword)e(name)0 1120 y(keysadd)h(-\(integer\))f (number)h(of)h(new)g(keyword)f(records)g(which)g(can)h(fit)g(in)g(the)g (CHU)0 1233 y(keysexist)e(-)j(\(integer\))d(number)h(of)h(existing)f (keyword)g(records)f(in)j(the)f(CHU)0 1346 y(keyval)f(-)i(value)e(of)h (the)g(keyword)f(in)h(the)g(appropriate)e(datatype)0 1458 y(keyvals)h(-)h(\(array\))f(value)g(of)i(the)f(keywords)e(in)i (the)g(appropriate)e(datatype)0 1571 y(keyword)h(-)h(\(character*8\))d (name)j(of)g(a)h(keyword)0 1684 y(lray)f(-)g(\(logical)f(array\))g (array)g(of)h(logical)f(values)g(corresponding)e(to)k(the)e(bit)h (array)0 1797 y(lpixels)f(-)h(\(integer)f(array\))g(the)h(last)f (included)g(pixel)g(in)i(each)e(dimension)0 1910 y(match)g(-)i (\(logical\))d(do)i(the)g(2)h(strings)d(match?)0 2023 y(maxdim)h(-)i(\(integer\))d(dimensioned)g(size)h(of)h(the)g(NAXES,)f (TTYPE,)g(TFORM)h(or)g(TUNIT)f(arrays)0 2136 y(max_keys)g(-)h (\(integer\))e(maximum)h(number)g(of)h(keywords)f(to)h(search)f(for)0 2249 y(minute)g(-)i(\(integer\))d(minute)h(of)h(an)g(hour)g(\(0)g(-)h (59\))0 2362 y(month)e(-)i(\(integer\))d(current)h(month)g(of)h(the)g (year)g(\(1)g(-)h(12\))0 2475 y(morekeys)e(-)h(\(integer\))e(will)i (leave)f(space)h(in)g(the)g(header)f(for)h(this)f(many)h(more)g (keywords)0 2588 y(naxes)f(-)i(\(integer)d(array\))h(size)h(of)g(each)g (dimension)e(in)i(the)g(FITS)g(array)0 2700 y(naxesll)f(-)h (\(integer*8)e(array\))h(size)h(of)g(each)g(dimension)e(in)i(the)g (FITS)g(array)0 2813 y(naxis)f(-)i(\(integer\))d(number)h(of)h (dimensions)e(in)j(the)e(FITS)h(array)0 2926 y(naxis1)f(-)i (\(integer\))d(length)h(of)h(the)g(X/first)f(axis)g(of)i(the)f(FITS)f (array)0 3039 y(naxis2)g(-)i(\(integer\))d(length)h(of)h(the)g (Y/second)f(axis)g(of)h(the)g(FITS)g(array)0 3152 y(naxis3)f(-)i (\(integer\))d(length)h(of)h(the)g(Z/third)f(axis)g(of)i(the)f(FITS)f (array)0 3265 y(nbit)h(-)g(\(integer\))e(number)h(of)i(bits)e(in)h(the) g(field)g(to)g(read)g(or)g(write)0 3378 y(nchars)f(-)i(\(integer\))d (number)h(of)h(characters)e(to)i(read)g(and)g(return)0 3491 y(ncols)f(-)i(\(integer\))d(number)h(of)h(columns)0 3604 y(nelements)e(-)j(\(integer\))d(number)h(of)h(data)g(elements)e (to)j(read)e(or)h(write)0 3717 y(nelementsll)e(-)i(\(integer*8\))e (number)h(of)h(data)g(elements)e(to)j(read)e(or)h(write)0 3830 y(nexc)142 b(\(integer\))93 b(number)46 b(of)h(names)g(in)g(the)g (exclusion)e(list)i(\(may)f(=)i(0\))0 3942 y(nhdu)f(-)g(\(integer\))e (absolute)h(number)g(of)h(the)g(HDU)g(\(1st)g(HDU)g(=)g(1\))0 4055 y(ninc)142 b(\(integer\))93 b(number)46 b(of)h(names)g(in)g(the)g (inclusion)e(list)0 4168 y(nmove)h(-)i(\(integer\))d(number)h(of)h (HDUs)g(to)g(move)g(\(+)g(or)g(-\),)g(relative)f(to)h(current)f (position)0 4281 y(nfound)g(-)i(\(integer\))d(number)h(of)h(keywords)f (found)g(\(highest)g(keyword)f(number\))0 4394 y(no_keys)h(-)h (\(integer\))f(number)g(of)h(keywords)e(to)j(write)e(in)h(the)g (sequence)0 4507 y(nparm)f(-)i(\(integer\))d(number)h(of)h(group)g (parameters)e(to)i(read)g(or)g(write)0 4620 y(nrows)f(-)i(\(integer\))d (number)h(of)h(rows)g(in)g(the)g(table)0 4733 y(nrowsll)f(-)h (\(integer*8\))e(number)h(of)h(rows)g(in)g(the)g(table)0 4846 y(nullval)f(-)h(value)g(to)g(represent)e(undefined)g(pixels,)h(of) h(the)g(appropriate)e(datatype)0 4959 y(nextaddr)h(-)h(\(integer\))e (starting)h(address)g(\(in)h(bytes\))f(of)h(the)g(HDU)g(following)e (the)i(CHDU)0 5072 y(offset)f(-)i(\(integer\))d(byte)h(offset)h(in)g (the)g(heap)f(to)h(the)g(first)g(element)f(of)h(the)g(array)0 5185 y(offsetll)f(-)h(\(integer*8\))e(byte)h(offset)g(in)i(the)f(heap)f (to)h(the)g(first)g(element)e(of)j(the)f(array)0 5297 y(oldkey)f(-)i(\(character\))c(old)j(name)g(of)g(keyword)f(to)h(be)g (modified)0 5410 y(ounit)f(-)i(\(integer\))d(logical)h(unit)h(number)f (associated)f(with)h(the)h(output)f(FITS)h(file)g(1-300)0 5523 y(pcount)f(-)i(\(integer\))d(value)h(of)h(the)g(PCOUNT)f(keyword)g (\(usually)g(=)h(0\))0 5636 y(previous)f(-)h(\(integer\))e(if)i(not)g (equal)g(to)g(0,)g(copy)g(all)g(previous)e(HDUs)i(in)g(the)g(input)f (file)p eop end %%Page: 126 132 TeXDict begin 126 131 bop 0 299 a Fi(126)1779 b Fg(CHAPTER)30 b(11.)112 b(P)-8 b(ARAMETER)30 b(DEFINITIONS)0 555 y Fe(repeat)46 b(-)i(\(integer\))d(length)h(of)h(element)f(vector)g (\(e.g.)g(12J\);)h(ignored)f(for)g(ASCII)h(table)0 668 y(rot)g(-)g(\(double)f(precision\))f(celestial)g(coordinate)g(rotation) h(angle)g(\(degrees\))0 781 y(rowlen)g(-)i(\(integer\))d(length)h(of)h (a)h(table)e(row,)h(in)g(characters)e(or)i(bytes)0 894 y(rowlenll)f(-)h(\(integer*8\))e(length)h(of)h(a)g(table)g(row,)f(in)i (characters)d(or)i(bytes)0 1007 y(rowlist)f(-)h(\(integer)f(array\))g (list)h(of)g(row)g(numbers)e(to)j(be)f(deleted)f(in)h(increasing)e (order)0 1120 y(rownum)h(-)i(\(integer\))d(number)h(of)h(the)g(row)g (\(first)f(row)h(=)g(1\))0 1233 y(rowrange-)e(\(string\))h(list)g(of)i (rows)e(or)h(row)g(ranges)f(to)i(be)f(deleted)0 1346 y(rwmode)f(-)i(\(integer\))d(file)h(access)h(mode:)f(0)h(=)h(readonly,) d(1)j(=)f(readwrite)0 1458 y(second)142 b(\(double\)-)45 b(second)h(within)g(minute)g(\(0)h(-)h(60.9999999999\))c(\(leap)i (second!\))0 1571 y(seq_no)g(-)i(\(integer\))d(the)i(sequence)e(number) h(to)i(append)e(to)h(the)g(keyword)f(root)g(name)0 1684 y(simple)g(-)i(\(logical\))d(does)h(the)h(FITS)g(file)g(conform)e(to)j (all)f(the)f(FITS)h(standards)0 1797 y(snull)f(-)i(\(character\))d (value)h(used)h(to)g(represent)e(undefined)g(values)h(in)i(ASCII)e (table)0 1910 y(space)g(-)i(\(integer\))d(number)h(of)h(blank)g(spaces) f(to)h(leave)f(between)g(ASCII)h(table)f(columns)0 2023 y(startchar)f(-)j(\(integer\))d(first)h(character)g(in)h(the)g(row)g (to)g(be)g(read)0 2136 y(startno)f(-)h(\(integer\))f(value)g(of)h(the)g (first)f(keyword)g(sequence)g(number)g(\(usually)f(1\))0 2249 y(status)h(-)i(\(integer\))d(returned)g(error)i(status)f(code)g (\(0)i(=)f(OK\))0 2362 y(str_template)d(\(character\))h(template)h (string)g(to)h(be)g(matched)f(to)h(reference)e(string)0 2475 y(stream)h(-)i(\(character\))c(output)i(stream)g(for)h(the)g (report:)f(either)g('STDOUT')g(or)h('STDERR')0 2588 y(string)f(-)i (\(character\))c(character)i(string)0 2700 y(sum)h(-)g(\(double)f (precision\))f(32)i(bit)g(unsigned)f(checksum)f(value)0 2813 y(tbcol)h(-)i(\(integer)d(array\))h(column)h(number)f(of)h(the)g (first)f(character)f(in)j(the)e(field\(s\))0 2926 y(tdisp)g(-)i (\(character\))d(Fortran)g(type)i(display)f(format)g(for)h(the)g(table) f(column)0 3039 y(template-\(character\))c(template)k(string)g(for)h(a) g(FITS)g(header)f(record)0 3152 y(tfields)g(-)h(\(integer\))f(number)g (of)h(fields)f(\(columns\))f(in)i(the)g(table)0 3265 y(tform)f(-)i(\(character)d(array\))h(format)g(of)h(the)g(column\(s\);) e(allowed)h(values)g(are:)430 3378 y(For)g(ASCII)h(tables:)93 b(Iw,)47 b(Aw,)g(Fww.dd,)f(Eww.dd,)g(or)h(Dww.dd)430 3491 y(For)f(binary)h(tables:)e(rL,)i(rX,)g(rB,)g(rI,)g(rJ,)g(rA,)g (rAw,)f(rE,)h(rD,)g(rC,)g(rM)430 3604 y(where)f('w'=width)f(of)i(the)g (field,)f('d'=no.)g(of)h(decimals,)f('r'=repeat)f(count)430 3717 y(Note)h(that)h(the)g('rAw')f(form)h(is)g(non-standard)d (extension)i(to)h(the)430 3830 y(TFORM)f(keyword)g(syntax)g(that)g(is)i (not)f(specifically)d(defined)i(in)h(the)430 3942 y(Binary)f(Tables)g (definition)f(document.)0 4055 y(theap)h(-)i(\(integer\))d(zero)i (indexed)f(byte)g(offset)g(of)h(starting)f(address)g(of)h(the)g(heap) 430 4168 y(relative)e(to)i(the)g(beginning)e(of)j(the)f(binary)f(table) g(data)0 4281 y(tnull)g(-)i(\(integer\))d(value)h(used)h(to)g (represent)f(undefined)f(values)h(in)h(binary)f(table)0 4394 y(tnullll)g(-)h(\(integer*8\))e(value)h(used)h(to)g(represent)e (undefined)h(values)g(in)h(binary)f(table)0 4507 y(ttype)g(-)i (\(character)d(array\))h(label)g(for)h(table)g(column\(s\))0 4620 y(tscal)f(-)i(\(double)e(precision\))f(scaling)g(factor)i(for)f (table)h(column)0 4733 y(tunit)f(-)i(\(character)d(array\))h(physical)f (unit)i(for)g(table)f(column\(s\))0 4846 y(tzero)g(-)i(\(double)e (precision\))f(scaling)g(zero)i(point)f(for)h(table)g(column)0 4959 y(unit)94 b(-)48 b(\(integer\))d(logical)h(unit)h(number)f (associated)f(with)h(the)h(FITS)g(file)f(\(1-300\))0 5072 y(units)g(-)i(\(character\))d(the)h(keyword)g(units)h(string)f (\(e.g.,)g('km/s'\))0 5185 y(value)g(-)i(\(character\))d(the)h(keyword) g(value)h(string)0 5297 y(values)f(-)i(array)e(of)h(data)g(values)f(of) h(the)g(appropriate)e(datatype)0 5410 y(varidat)h(-)h(\(integer\))f (size)g(in)h(bytes)g(of)g(the)g('variable)e(length)h(data)h(area')525 5523 y(following)e(the)i(binary)f(table)h(data)f(\(usually)g(=)h(0\))0 5636 y(version)f(-)h(\(real\))f(current)g(revision)g(number)g(of)h(the) g(library)p eop end %%Page: 127 133 TeXDict begin 127 132 bop 3764 299 a Fi(127)0 555 y Fe(width)46 b(-)i(\(integer\))d(width)h(of)i(the)f(character)e(string)h(field)0 668 y(xcol)h(-)g(\(integer\))e(number)h(of)i(the)f(column)f(containing) f(the)i(X)g(coordinate)e(values)0 781 y(xinc)i(-)g(\(double)f (precision\))f(X)i(axis)g(coordinate)e(increment)g(at)i(reference)f (pixel)g(\(deg\))0 894 y(xpix)h(-)g(\(double)f(precision\))f(X)i(axis)g (pixel)f(location)0 1007 y(xpos)h(-)g(\(double)f(precision\))f(X)i (axis)g(celestial)e(coordinate)g(\(usually)h(RA\))h(\(deg\))0 1120 y(xrpix)f(-)i(\(double)e(precision\))f(X)i(axis)g(reference)e (pixel)h(array)h(location)0 1233 y(xrval)f(-)i(\(double)e(precision\))f (X)i(axis)g(coordinate)e(value)h(at)h(the)g(reference)e(pixel)i (\(deg\))0 1346 y(ycol)g(-)g(\(integer\))e(number)h(of)i(the)f(column)f (containing)f(the)i(X)g(coordinate)e(values)0 1458 y(year)i(-)g (\(integer\))e(last)i(2)g(digits)g(of)g(the)g(year)f(\(00)h(-)h(99\))0 1571 y(yinc)f(-)g(\(double)f(precision\))f(Y)i(axis)g(coordinate)e (increment)g(at)i(reference)f(pixel)g(\(deg\))0 1684 y(ypix)h(-)g(\(double)f(precision\))f(y)i(axis)g(pixel)f(location)0 1797 y(ypos)h(-)g(\(double)f(precision\))f(y)i(axis)g(celestial)e (coordinate)g(\(usually)h(DEC\))g(\(deg\))0 1910 y(yrpix)g(-)i (\(double)e(precision\))f(Y)i(axis)g(reference)e(pixel)h(array)h (location)0 2023 y(yrval)f(-)i(\(double)e(precision\))f(Y)i(axis)g (coordinate)e(value)h(at)h(the)g(reference)e(pixel)i(\(deg\))p eop end %%Page: 128 134 TeXDict begin 128 133 bop 0 299 a Fi(128)1779 b Fg(CHAPTER)30 b(11.)112 b(P)-8 b(ARAMETER)30 b(DEFINITIONS)p eop end %%Page: 129 135 TeXDict begin 129 134 bop 0 1225 a Ff(Chapter)65 b(12)0 1687 y Fl(FITSIO)76 b(Error)h(Status)h(Co)6 b(des)0 2180 y Fe(Status)46 b(codes)g(in)i(the)f(range)f(-99)h(to)g(-999)94 b(and)47 b(1)h(to)f(999)g(are)g(reserved)e(for)i(future)0 2293 y(FITSIO)f(use.)95 2518 y(0)96 b(OK,)47 b(no)g(error)0 2631 y(101)95 b(input)46 b(and)h(output)f(files)g(are)h(the)g(same)0 2744 y(103)95 b(too)47 b(many)f(FITS)h(files)f(open)h(at)g(once;)f(all) h(internal)f(buffers)g(full)0 2857 y(104)95 b(error)46 b(opening)g(existing)f(file)0 2970 y(105)95 b(error)46 b(creating)g(new)g(FITS)h(file;)f(\(does)h(a)g(file)g(with)g(this)f (name)h(already)f(exist?\))0 3083 y(106)95 b(error)46 b(writing)g(record)g(to)h(FITS)g(file)0 3196 y(107)95 b(end-of-file)44 b(encountered)h(while)h(reading)g(record)g(from)h (FITS)g(file)0 3309 y(108)95 b(error)46 b(reading)g(record)g(from)h (file)0 3422 y(110)95 b(error)46 b(closing)g(FITS)g(file)0 3535 y(111)95 b(internal)45 b(array)i(dimensions)e(exceeded)0 3648 y(112)95 b(Cannot)46 b(modify)g(file)g(with)h(readonly)f(access)0 3760 y(113)95 b(Could)46 b(not)h(allocate)e(memory)0 3873 y(114)95 b(illegal)45 b(logical)h(unit)h(number;)f(must)g(be)i (between)d(1)j(-)f(300,)g(inclusive)0 3986 y(115)95 b(NULL)46 b(input)h(pointer)e(to)j(routine)0 4099 y(116)95 b(error)46 b(seeking)g(position)f(in)j(file)0 4325 y(121)95 b(invalid)45 b(URL)i(prefix)f(on)i(file)e(name)0 4438 y(122)95 b(tried)46 b(to)h(register)f(too)h(many)f(IO)h(drivers)0 4551 y(123)95 b(driver)46 b(initialization)e(failed)0 4664 y(124)95 b(matching)45 b(driver)h(is)h(not)g(registered)0 4777 y(125)95 b(failed)46 b(to)h(parse)f(input)h(file)f(URL)0 4890 y(126)95 b(parse)46 b(error)g(in)i(range)e(list)0 5115 y(151)95 b(bad)47 b(argument)e(in)i(shared)f(memory)g(driver)0 5228 y(152)95 b(null)46 b(pointer)g(passed)g(as)h(an)h(argument)0 5341 y(153)95 b(no)47 b(more)f(free)h(shared)f(memory)g(handles)0 5454 y(154)95 b(shared)46 b(memory)g(driver)g(is)h(not)g(initialized)0 5567 y(155)95 b(IPC)47 b(error)f(returned)f(by)j(a)f(system)f(call)0 5680 y(156)95 b(no)47 b(memory)f(in)h(shared)f(memory)g(driver)1882 5942 y Fi(129)p eop end %%Page: 130 136 TeXDict begin 130 135 bop 0 299 a Fi(130)1613 b Fg(CHAPTER)30 b(12.)112 b(FITSIO)30 b(ERR)m(OR)g(ST)-8 b(A)g(TUS)30 b(CODES)0 555 y Fe(157)95 b(resource)45 b(deadlock)h(would)g(occur)0 668 y(158)95 b(attempt)45 b(to)j(open/create)c(lock)j(file)g(failed)0 781 y(159)95 b(shared)46 b(memory)g(block)g(cannot)g(be)h(resized)f(at) h(the)g(moment)0 1120 y(201)95 b(header)46 b(not)h(empty;)f(can't)g (write)g(required)g(keywords)0 1233 y(202)95 b(specified)45 b(keyword)h(name)g(was)h(not)g(found)g(in)g(the)g(header)0 1346 y(203)95 b(specified)45 b(header)h(record)g(number)g(is)h(out)g (of)g(bounds)0 1458 y(204)95 b(keyword)45 b(value)i(field)f(is)h(blank) 0 1571 y(205)95 b(keyword)45 b(value)i(string)f(is)h(missing)f(the)h (closing)f(quote)g(character)0 1684 y(206)95 b(illegal)45 b(indexed)h(keyword)g(name)h(\(e.g.)f('TFORM1000'\))0 1797 y(207)95 b(illegal)45 b(character)h(in)h(keyword)f(name)g(or)i (header)e(record)0 1910 y(208)95 b(keyword)45 b(does)i(not)g(have)g (expected)e(name.)i(Keyword)e(out)i(of)g(sequence?)0 2023 y(209)95 b(keyword)45 b(does)i(not)g(have)g(expected)e(integer)h (value)0 2136 y(210)95 b(could)46 b(not)h(find)g(the)f(required)g(END)h (header)f(keyword)0 2249 y(211)95 b(illegal)45 b(BITPIX)i(keyword)e (value)0 2362 y(212)95 b(illegal)45 b(NAXIS)i(keyword)f(value)0 2475 y(213)95 b(illegal)45 b(NAXISn)i(keyword)e(value:)h(must)h(be)g(0) h(or)f(positive)e(integer)0 2588 y(214)95 b(illegal)45 b(PCOUNT)i(keyword)e(value)0 2700 y(215)95 b(illegal)45 b(GCOUNT)i(keyword)e(value)0 2813 y(216)95 b(illegal)45 b(TFIELDS)h(keyword)g(value)0 2926 y(217)95 b(negative)45 b(ASCII)i(or)g(binary)f(table)g(width)h(value)f(\(NAXIS1\))0 3039 y(218)95 b(negative)45 b(number)h(of)h(rows)g(in)g(ASCII)g(or)g (binary)f(table)g(\(NAXIS2\))0 3152 y(219)95 b(column)46 b(name)g(\(TTYPE)g(keyword\))g(not)h(found)0 3265 y(220)95 b(illegal)45 b(SIMPLE)i(keyword)e(value)0 3378 y(221)95 b(could)46 b(not)h(find)g(the)f(required)g(SIMPLE)g(header)g(keyword)0 3491 y(222)95 b(could)46 b(not)h(find)g(the)f(required)g(BITPIX)g (header)g(keyword)0 3604 y(223)95 b(could)46 b(not)h(find)g(the)f (required)g(NAXIS)g(header)g(keyword)0 3717 y(224)95 b(could)46 b(not)h(find)g(all)f(the)h(required)f(NAXISn)g(keywords)g (in)h(the)g(header)0 3830 y(225)95 b(could)46 b(not)h(find)g(the)f (required)g(XTENSION)g(header)g(keyword)0 3942 y(226)95 b(the)47 b(CHDU)f(is)h(not)g(an)g(ASCII)g(table)f(extension)0 4055 y(227)95 b(the)47 b(CHDU)f(is)h(not)g(a)h(binary)e(table)g (extension)0 4168 y(228)95 b(could)46 b(not)h(find)g(the)f(required)g (PCOUNT)g(header)g(keyword)0 4281 y(229)95 b(could)46 b(not)h(find)g(the)f(required)g(GCOUNT)g(header)g(keyword)0 4394 y(230)95 b(could)46 b(not)h(find)g(the)f(required)g(TFIELDS)g (header)g(keyword)0 4507 y(231)95 b(could)46 b(not)h(find)g(all)f(the)h (required)f(TBCOLn)g(keywords)g(in)h(the)g(header)0 4620 y(232)95 b(could)46 b(not)h(find)g(all)f(the)h(required)f(TFORMn)g (keywords)g(in)h(the)g(header)0 4733 y(233)95 b(the)47 b(CHDU)f(is)h(not)g(an)g(IMAGE)g(extension)0 4846 y(234)95 b(illegal)45 b(TBCOL)i(keyword)f(value;)g(out)h(of)g(range)0 4959 y(235)95 b(this)46 b(operation)g(only)g(allowed)g(for)h(ASCII)f (or)h(BINARY)g(table)f(extension)0 5072 y(236)95 b(column)46 b(is)h(too)g(wide)f(to)i(fit)f(within)f(the)h(specified)e(width)h(of)h (the)g(ASCII)g(table)0 5185 y(237)95 b(the)47 b(specified)e(column)h (name)h(template)e(matched)h(more)h(than)f(one)h(column)f(name)0 5297 y(241)95 b(binary)46 b(table)g(row)h(width)f(is)i(not)e(equal)h (to)g(the)g(sum)g(of)g(the)g(field)f(widths)0 5410 y(251)95 b(unrecognizable)44 b(type)i(of)h(FITS)g(extension)0 5523 y(252)95 b(unrecognizable)44 b(FITS)i(record)0 5636 y(253)95 b(END)47 b(keyword)e(contains)h(non-blank)f(characters)g(in)i (columns)f(9-80)p eop end %%Page: 131 137 TeXDict begin 131 136 bop 3764 299 a Fi(131)0 555 y Fe(254)95 b(Header)46 b(fill)g(area)h(contains)f(non-blank)f(characters)0 668 y(255)95 b(Data)46 b(fill)h(area)g(contains)e(non-blank)g(on)j (non-zero)d(values)0 781 y(261)95 b(unable)46 b(to)h(parse)f(the)h (TFORM)g(keyword)e(value)i(string)0 894 y(262)95 b(unrecognizable)44 b(TFORM)i(datatype)f(code)0 1007 y(263)95 b(illegal)45 b(TDIMn)i(keyword)f(value)0 1233 y(301)95 b(illegal)45 b(HDU)i(number;)f(less)h(than)f(1)i(or)f(greater)f(than)h(internal)e (buffer)h(size)0 1346 y(302)95 b(column)46 b(number)g(out)h(of)g(range) f(\(1)h(-)h(999\))0 1458 y(304)95 b(attempt)45 b(to)j(move)e(to)h (negative)f(file)h(record)f(number)0 1571 y(306)95 b(attempted)45 b(to)i(read)g(or)g(write)f(a)i(negative)d(number)h(of)i(bytes)e(in)h (the)g(FITS)g(file)0 1684 y(307)95 b(illegal)45 b(starting)h(row)h (number)f(for)h(table)f(read)h(or)g(write)f(operation)0 1797 y(308)95 b(illegal)45 b(starting)h(element)g(number)g(for)h(table) f(read)h(or)g(write)f(operation)0 1910 y(309)95 b(attempted)45 b(to)i(read)g(or)g(write)f(character)g(string)g(in)h(non-character)d (table)i(column)0 2023 y(310)95 b(attempted)45 b(to)i(read)g(or)g (write)f(logical)g(value)g(in)i(non-logical)c(table)j(column)0 2136 y(311)95 b(illegal)45 b(ASCII)i(table)f(TFORM)h(format)f(code)g (for)h(attempted)e(operation)0 2249 y(312)95 b(illegal)45 b(binary)i(table)f(TFORM)g(format)g(code)h(for)g(attempted)e(operation) 0 2362 y(314)95 b(value)46 b(for)h(undefined)e(pixels)h(has)h(not)g (been)g(defined)0 2475 y(317)95 b(attempted)45 b(to)i(read)g(or)g (write)f(descriptor)f(in)i(a)h(non-descriptor)c(field)0 2588 y(320)95 b(number)46 b(of)h(array)f(dimensions)f(out)i(of)g(range) 0 2700 y(321)95 b(first)46 b(pixel)g(number)g(is)i(greater)d(than)i (the)g(last)g(pixel)f(number)0 2813 y(322)95 b(attempt)45 b(to)j(set)f(BSCALE)f(or)h(TSCALn)f(scaling)g(parameter)f(=)i(0)0 2926 y(323)95 b(illegal)45 b(axis)i(length)f(less)h(than)f(1)0 3152 y(340)h(NOT_GROUP_TABLE)d(340)142 b(Grouping)45 b(function)h(error)0 3265 y(341)h(HDU_ALREADY_MEMBER)0 3378 y(342)g(MEMBER_NOT_FOUND)0 3491 y(343)g(GROUP_NOT_FOUND)0 3604 y(344)g(BAD_GROUP_ID)0 3717 y(345)g(TOO_MANY_HDUS_TRACKED)0 3830 y(346)g(HDU_ALREADY_TRACKED)0 3942 y(347)g(BAD_OPTION)0 4055 y(348)g(IDENTICAL_POINTERS)0 4168 y(349)g(BAD_GROUP_ATTACH)0 4281 y(350)g(BAD_GROUP_DETACH)0 4507 y(360)g(NGP_NO_MEMORY)665 b(malloc)46 b(failed)0 4620 y(361)h(NGP_READ_ERR)713 b(read)46 b(error)h(from)f(file)0 4733 y(362)h(NGP_NUL_PTR)761 b(null)46 b(pointer)g(passed)g(as)h(an)g(argument.)1575 4846 y(Passing)f(null)g(pointer)g(as)h(a)h(name)f(of)1575 4959 y(template)f(file)g(raises)g(this)h(error)0 5072 y(363)g(NGP_EMPTY_CURLINE)473 b(line)46 b(read)h(seems)f(to)h(be)h (empty)e(\(used)1575 5185 y(internally\))0 5297 y(364)h (NGP_UNREAD_QUEUE_FULL)281 b(cannot)46 b(unread)g(more)g(then)h(1)g (line)g(\(or)g(single)1575 5410 y(line)g(twice\))0 5523 y(365)g(NGP_INC_NESTING)569 b(too)46 b(deep)h(include)f(file)h(nesting) e(\(infinite)1575 5636 y(loop,)h(template)g(includes)f(itself)i(?\))p eop end %%Page: 132 138 TeXDict begin 132 137 bop 0 299 a Fi(132)1613 b Fg(CHAPTER)30 b(12.)112 b(FITSIO)30 b(ERR)m(OR)g(ST)-8 b(A)g(TUS)30 b(CODES)0 555 y Fe(366)47 b(NGP_ERR_FOPEN)665 b(fopen\(\))45 b(failed,)h(cannot)g(open)h(template)e(file)0 668 y(367)i(NGP_EOF)953 b(end)46 b(of)i(file)e(encountered)f(and)i(not)g(expected)0 781 y(368)g(NGP_BAD_ARG)761 b(bad)46 b(arguments)g(passed.)g(Usually)f (means)1575 894 y(internal)h(parser)g(error.)g(Should)g(not)h(happen)0 1007 y(369)g(NGP_TOKEN_NOT_EXPECT)329 b(token)46 b(not)h(expected)e (here)0 1233 y(401)95 b(error)46 b(attempting)f(to)i(convert)f(an)h (integer)f(to)h(a)h(formatted)d(character)g(string)0 1346 y(402)95 b(error)46 b(attempting)f(to)i(convert)f(a)h(real)g (value)f(to)i(a)f(formatted)e(character)h(string)0 1458 y(403)95 b(cannot)46 b(convert)g(a)h(quoted)f(string)g(keyword)g(to)h (an)g(integer)0 1571 y(404)95 b(attempted)45 b(to)i(read)g(a)g (non-logical)e(keyword)h(value)g(as)h(a)h(logical)e(value)0 1684 y(405)95 b(cannot)46 b(convert)g(a)h(quoted)f(string)g(keyword)g (to)h(a)h(real)e(value)0 1797 y(406)95 b(cannot)46 b(convert)g(a)h (quoted)f(string)g(keyword)g(to)h(a)h(double)e(precision)f(value)0 1910 y(407)95 b(error)46 b(attempting)f(to)i(read)g(character)e(string) h(as)h(an)h(integer)0 2023 y(408)95 b(error)46 b(attempting)f(to)i (read)g(character)e(string)h(as)h(a)h(real)e(value)0 2136 y(409)95 b(error)46 b(attempting)f(to)i(read)g(character)e(string) h(as)h(a)h(double)e(precision)f(value)0 2249 y(410)95 b(bad)47 b(keyword)e(datatype)h(code)0 2362 y(411)95 b(illegal)45 b(number)i(of)g(decimal)f(places)g(while)g(formatting)f (floating)h(point)g(value)0 2475 y(412)95 b(numerical)45 b(overflow)g(during)i(implicit)e(datatype)h(conversion)0 2588 y(413)95 b(error)46 b(compressing)f(image)0 2700 y(414)95 b(error)46 b(uncompressing)e(image)0 2813 y(420)95 b(error)46 b(in)h(date)g(or)g(time)g(conversion)0 3039 y(431)95 b(syntax)46 b(error)g(in)h(parser)f(expression)0 3152 y(432)95 b(expression)45 b(did)i(not)f(evaluate)g(to)h(desired)f (type)0 3265 y(433)95 b(vector)46 b(result)g(too)h(large)f(to)h(return) f(in)i(array)0 3378 y(434)95 b(data)46 b(parser)g(failed)g(not)h(sent)g (an)g(out)g(column)0 3491 y(435)95 b(bad)47 b(data)f(encounter)f(while) i(parsing)f(column)0 3604 y(436)95 b(parse)46 b(error:)g(output)g(file) h(not)g(of)g(proper)f(type)0 3830 y(501)95 b(celestial)45 b(angle)h(too)h(large)g(for)f(projection)0 3942 y(502)95 b(bad)47 b(celestial)e(coordinate)g(or)i(pixel)f(value)0 4055 y(503)95 b(error)46 b(in)h(celestial)e(coordinate)g(calculation)0 4168 y(504)95 b(unsupported)44 b(type)j(of)g(celestial)e(projection)0 4281 y(505)95 b(required)45 b(celestial)g(coordinate)g(keywords)h(not)h (found)0 4394 y(506)95 b(approximate)44 b(wcs)j(keyword)f(values)g (were)h(returned)p eop end %%Trailer userdict /end-hook known{end-hook}if %%EOF cfitsio-3.47/docs/fitsio.tex0000644000225700000360000123734013464573431015370 0ustar cagordonlhea\documentclass[11pt]{book} \input{html.sty} \htmladdtonavigation {\begin{rawhtml} FITSIO Home \end{rawhtml}} %\oddsidemargin=0.25in \oddsidemargin=0.00in \evensidemargin=0.00in \textwidth=6.5in %\topmargin=0.0in \textheight=8.75in \parindent=0cm \parskip=0.2cm \begin{document} \pagenumbering{roman} \begin{titlepage} \normalsize \vspace*{4.6cm} \begin{center} {\Huge \bf FITSIO User's Guide}\\ \end{center} \medskip \medskip \begin{center} {\LARGE \bf A Subroutine Interface to FITS Format Files}\\ \end{center} \begin{center} {\LARGE \bf for Fortran Programmers}\\ \end{center} \medskip \medskip \begin{center} {\Large Version 3.0\\} \end{center} \bigskip \vskip 2.5cm \begin{center} {HEASARC\\ Code 662\\ Goddard Space Flight Center\\ Greenbelt, MD 20771\\ USA} \end{center} \vfill \bigskip \begin{center} {\Large April 2016\\} \end{center} \vfill \end{titlepage} \clearpage \tableofcontents \chapter{Introduction } \pagenumbering{arabic} This document describes the Fortran-callable subroutine interface that is provided as part of the CFITSIO library (which is written in ANSI C). This is a companion document to the CFITSIO User's Guide which should be consulted for further information about the underlying CFITSIO library. In the remainder of this document, the terms FITSIO and CFITSIO are interchangeable and refer to the same library. FITSIO/CFITSIO is a machine-independent library of routines for reading and writing data files in the FITS (Flexible Image Transport System) data format. It can also read IRAF format image files and raw binary data arrays by converting them on the fly into a virtual FITS format file. This library was written to provide a powerful yet simple interface for accessing FITS files which will run on most commonly used computers and workstations. FITSIO supports all the features described in the official definition of the FITS format and can read and write all the currently defined types of extensions, including ASCII tables (TABLE), Binary tables (BINTABLE) and IMAGE extensions. The FITSIO subroutines insulate the programmer from having to deal with the complicated formatting details in the FITS file, however, it is assumed that users have a general knowledge about the structure and usage of FITS files. The CFITSIO package was initially developed by the HEASARC (High Energy Astrophysics Science Archive Research Center) at the NASA Goddard Space Flight Center to convert various existing and newly acquired astronomical data sets into FITS format and to further analyze data already in FITS format. New features continue to be added to CFITSIO in large part due to contributions of ideas or actual code from users of the package. The Integral Science Data Center in Switzerland, and the XMM/ESTEC project in The Netherlands made especially significant contributions that resulted in many of the new features that appeared in v2.0 of CFITSIO. The latest version of the CFITSIO source code, documentation, and example programs are available on the World-Wide Web or via anonymous ftp from: \begin{verbatim} http://heasarc.gsfc.nasa.gov/fitsio ftp://legacy.gsfc.nasa.gov/software/fitsio/c \end{verbatim} \newpage Any questions, bug reports, or suggested enhancements related to the CFITSIO package should be sent to the FTOOLS Help Desk at the HEASARC: \begin{verbatim} http://heasarc.gsfc.nasa.gov/cgi-bin/ftoolshelp \end{verbatim} This User's Guide assumes that readers already have a general understanding of the definition and structure of FITS format files. Further information about FITS formats is available from the FITS Support Office at {\tt http://fits.gsfc.nasa.gov}. In particular, the 'FITS Standard' gives the authoritative definition of the FITS data format. Other documents available at that Web site provide additional historical background and practical advice on using FITS files. The HEASARC also provides a very sophisticated FITS file analysis program called `Fv' which can be used to display and edit the contents of any FITS file as well as construct new FITS files from scratch. Fv is freely available for most Unix platforms, Mac PCs, and Windows PCs. CFITSIO users may also be interested in the FTOOLS package of programs that can be used to manipulate and analyze FITS format files. Fv and FTOOLS are available from their respective Web sites at: \begin{verbatim} http://fv.gsfc.nasa.gov http://heasarc.gsfc.nasa.gov/ftools \end{verbatim} \chapter{ Creating FITSIO/CFITSIO } \section{Building the Library} To use the FITSIO subroutines one must first build the CFITSIO library, which requires a C compiler. gcc is ideal, or most other ANSI-C compilers will also work. The CFITSIO code is contained in about 40 C source files (*.c) and header files (*.h). On VAX/VMS systems 2 assembly-code files (vmsieeed.mar and vmsieeer.mar) are also needed. The Fortran interface subroutines to the C CFITSIO routines are located in the f77\_wrap1.c, through f77\_wrap4.c files. These are relatively simple 'wrappers' that translate the arguments in the Fortran subroutine into the appropriate format for the corresponding C routine. This translation is performed transparently to the user by a set of C macros located in the cfortran.h file. Unfortunately cfortran.h does not support every combination of C and Fortran compilers so the Fortran interface is not supported on all platforms. (see further notes below). A standard combination of C and Fortran compilers will be assumed by default, but one may also specify a particular Fortran compiler by doing: \begin{verbatim} > setenv CFLAGS -DcompilerName=1 \end{verbatim} (where 'compilerName' is the name of the compiler) before running the configure command. The currently recognized compiler names are: \begin{verbatim} g77Fortran IBMR2Fortran CLIPPERFortran pgiFortran NAGf90Fortran f2cFortran hpuxFortran apolloFortran sunFortran CRAYFortran mipsFortran DECFortran vmsFortran CONVEXFortran PowerStationFortran AbsoftUNIXFortran AbsoftProFortran SXFortran \end{verbatim} Alternatively, one may edit the CFLAGS line in the Makefile to add the '-DcompilerName' flag after running the './configure' command. The CFITSIO library is built on Unix systems by typing: \begin{verbatim} > ./configure [--prefix=/target/installation/path] [--enable-sse2] [--enable-ssse3] > make (or 'make shared') > make install (this step is optional) \end{verbatim} at the operating system prompt. The configure command customizes the Makefile for the particular system, then the `make' command compiles the source files and builds the library. Type `./configure' and not simply `configure' to ensure that the configure script in the current directory is run and not some other system-wide configure script. The optional 'prefix' argument to configure gives the path to the directory where the CFITSIO library and include files should be installed via the later 'make install' command. For example, \begin{verbatim} > ./configure --prefix=/usr1/local \end{verbatim} will cause the 'make install' command to copy the CFITSIO libcfitsio file to /usr1/local/lib and the necessary include files to /usr1/local/include (assuming of course that the process has permission to write to these directories). The optional --enable-sse2 and --enable-ssse3 flags will cause configure to attempt to build CFITSIO using faster byte-swapping algorithms. See the "Optimizing Programs" section of this manual for more information about these options. By default, the Makefile will be configured to build the set of Fortran-callable wrapper routines whose calling sequences are described later in this document. The 'make shared' option builds a shared or dynamic version of the CFITSIO library. When using the shared library the executable code is not copied into your program at link time and instead the program locates the necessary library code at run time, normally through LD\_LIBRARY\_PATH or some other method. The advantages of using a shared library are: \begin{verbatim} 1. Less disk space if you build more than 1 program 2. Less memory if more than one copy of a program using the shared library is running at the same time since the system is smart enough to share copies of the shared library at run time. 3. Possibly easier maintenance since a new version of the shared library can be installed without relinking all the software that uses it (as long as the subroutine names and calling sequences remain unchanged). 4. No run-time penalty. \end{verbatim} The disadvantages are: \begin{verbatim} 1. More hassle at runtime. You have to either build the programs specially or have LD_LIBRARY_PATH set right. 2. There may be a slight start up penalty, depending on where you are reading the shared library and the program from and if your CPU is either really slow or really heavily loaded. \end{verbatim} On HP/UX systems, the environment variable CFLAGS should be set to -Ae before running configure to enable "extended ANSI" features. It may not be possible to statically link programs that use CFITSIO on some platforms (namely, on Solaris 2.6) due to the network drivers (which provide FTP and HTTP access to FITS files). It is possible to make both a dynamic and a static version of the CFITSIO library, but network file access will not be possible using the static version. On VAX/VMS and ALPHA/VMS systems the make\_gfloat.com command file may be executed to build the cfitsio.olb object library using the default G-floating point option for double variables. The make\_dfloat.com and make\_ieee.com files may be used instead to build the library with the other floating point options. Note that the getcwd function that is used in the group.c module may require that programs using CFITSIO be linked with the ALPHA\$LIBRARY:VAXCRTL.OLB library. See the example link line in the next section of this document. On Windows IBM-PC type platforms the situation is more complicated because of the wide variety of Fortran compilers that are available and because of the inherent complexities of calling the CFITSIO C routines from Fortran. Two different versions of the CFITSIO dll library are available, compiled with the Borland C++ compiler and the Microsoft Visual C++ compiler, respectively, in the files cfitsiodll\_2xxx\_borland.zip and cfitsiodll\_3xxx\_vcc.zip, where '3xxx' represents the current release number. Both these dll libraries contain a set of Fortran wrapper routines which may be compatible with some, but probably not all, available Fortran compilers. To test if they are compatible, compile the program testf77.f and try linking to these dll libraries. If these libraries do not work with a particular Fortran compiler, then it may be necessary to modify the file "cfortran.h" to support that particular combination of C and Fortran compilers, and then rebuild the CFITSIO dll library. This will require, however, some expertise in mixed language programming. CFITSIO should be compatible with most current ANCI C and C++ compilers: Cray supercomputers are currently not supported. \section{Testing the Library} The CFITSIO library should be tested by building and running the testprog.c program that is included with the release. On Unix systems type: \begin{verbatim} % make testprog % testprog > testprog.lis % diff testprog.lis testprog.out % cmp testprog.fit testprog.std \end{verbatim} On VMS systems, (assuming cc is the name of the C compiler command), type: \begin{verbatim} $ cc testprog.c $ link testprog, cfitsio/lib, alpha$library:vaxcrtl/lib $ run testprog \end{verbatim} The testprog program should produce a FITS file called `testprog.fit' that is identical to the `testprog.std' FITS file included with this release. The diagnostic messages (which were piped to the file testprog.lis in the Unix example) should be identical to the listing contained in the file testprog.out. The 'diff' and 'cmp' commands shown above should not report any differences in the files. (There may be some minor formatting differences, such as the presence or absence of leading zeros, or 3 digit exponents in numbers, which can be ignored). The Fortran wrappers in CFITSIO may be tested with the testf77 program. On Unix systems the fortran compilation and link command may be called 'f77' or 'g77', depending on the system. \begin{verbatim} % f77 -o testf77 testf77.f -L. -lcfitsio -lnsl -lsocket or % f77 -f -o testf77 testf77.f -L. -lcfitsio (under SUN O/S) or % f77 -o testf77 testf77.f -Wl,-L. -lcfitsio -lm -lnsl -lsocket (HP/UX) or % g77 -o testf77 -s testf77.f -lcfitsio -lcc_dynamic -lncurses (Mac OS-X) % testf77 > testf77.lis % diff testf77.lis testf77.out % cmp testf77.fit testf77.std \end{verbatim} On machines running SUN O/S, Fortran programs must be compiled with the '-f' option to force double precision variables to be aligned on 8-byte boundaries to make the fortran-declared variables compatible with C. A similar compiler option may be required on other platforms. Failing to use this option may cause the program to crash on FITSIO routines that read or write double precision variables. On Windows platforms, linking Fortran programs with a C library often depends on the particular compilers involved. Some users have found the following commands work when using the Intel Fortran compiler: \begin{verbatim} ifort /libs.dll cfitsio.lib /MD testf77.f /Gm or possibly, ifort /libs:dll cfitsio.lib /MD /fpp /extfpp:cfortran.h,fitsio.h /iface:cvf testf77.f \end{verbatim} Also note that on some systems the output listing of the testf77 program may differ slightly from the testf77.std template if leading zeros are not printed by default before the decimal point when using F format. A few other utility programs are included with CFITSIO: \begin{verbatim} speed - measures the maximum throughput (in MB per second) for writing and reading FITS files with CFITSIO listhead - lists all the header keywords in any FITS file fitscopy - copies any FITS file (especially useful in conjunction with the CFITSIO's extended input filename syntax) cookbook - a sample program that performs common read and write operations on a FITS file. iter_a, iter_b, iter_c - examples of the CFITSIO iterator routine \end{verbatim} The first 4 of these utility programs can be compiled and linked by typing \begin{verbatim} % make program_name \end{verbatim} \section{Linking Programs with FITSIO} When linking applications software with the FITSIO library, several system libraries usually need to be specified on the link comman Unix systems, the most reliable way to determine what libraries are required is to type 'make testprog' and see what libraries the configure script has added. The typical libraries that may need to be added are -lm (the math library) and -lnsl and -lsocket (needed only for FTP and HTTP file access). These latter 2 libraries are not needed on VMS and Windows platforms, because FTP file access is not currently supported on those platforms. Note that when upgrading to a newer version of CFITSIO it is usually necessary to recompile, as well as relink, the programs that use CFITSIO, because the definitions in fitsio.h often change. \section{Getting Started with FITSIO} In order to effectively use the FITSIO library as quickly as possible, it is recommended that new users follow these steps: 1. Read the following `FITS Primer' chapter for a brief overview of the structure of FITS files. This is especially important for users who have not previously dealt with the FITS table and image extensions. 2. Write a simple program to read or write a FITS file using the Basic Interface routines. 3. Refer to the cookbook.f program that is included with this release for examples of routines that perform various common FITS file operations. 4. Read Chapters 4 and 5 to become familiar with the conventions and advanced features of the FITSIO interface. 5. Scan through the more extensive set of routines that are provided in the `Advanced Interface'. These routines perform more specialized functions than are provided by the Basic Interface routines. \section{Example Program} The following listing shows an example of how to use the FITSIO routines in a Fortran program. Refer to the cookbook.f program that is included with the FITSIO distribution for examples of other FITS programs. \begin{verbatim} program writeimage C Create a FITS primary array containing a 2-D image integer status,unit,blocksize,bitpix,naxis,naxes(2) integer i,j,group,fpixel,nelements,array(300,200) character filename*80 logical simple,extend status=0 C Name of the FITS file to be created: filename='ATESTFILE.FITS' C Get an unused Logical Unit Number to use to create the FITS file call ftgiou(unit,status) C create the new empty FITS file blocksize=1 call ftinit(unit,filename,blocksize,status) C initialize parameters about the FITS image (300 x 200 16-bit integers) simple=.true. bitpix=16 naxis=2 naxes(1)=300 naxes(2)=200 extend=.true. C write the required header keywords call ftphpr(unit,simple,bitpix,naxis,naxes,0,1,extend,status) C initialize the values in the image with a linear ramp function do j=1,naxes(2) do i=1,naxes(1) array(i,j)=i+j end do end do C write the array to the FITS file group=1 fpixel=1 nelements=naxes(1)*naxes(2) call ftpprj(unit,group,fpixel,nelements,array,status) C write another optional keyword to the header call ftpkyj(unit,'EXPOSURE',1500,'Total Exposure Time',status) C close the file and free the unit number call ftclos(unit, status) call ftfiou(unit, status) end \end{verbatim} \section{Legal Stuff} Copyright (Unpublished--all rights reserved under the copyright laws of the United States), U.S. Government as represented by the Administrator of the National Aeronautics and Space Administration. No copyright is claimed in the United States under Title 17, U.S. Code. Permission to freely use, copy, modify, and distribute this software and its documentation without fee is hereby granted, provided that this copyright notice and disclaimer of warranty appears in all copies. DISCLAIMER: THE SOFTWARE IS PROVIDED 'AS IS' WITHOUT ANY WARRANTY OF ANY KIND, EITHER EXPRESSED, IMPLIED, OR STATUTORY, INCLUDING, BUT NOT LIMITED TO, ANY WARRANTY THAT THE SOFTWARE WILL CONFORM TO SPECIFICATIONS, ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND FREEDOM FROM INFRINGEMENT, AND ANY WARRANTY THAT THE DOCUMENTATION WILL CONFORM TO THE SOFTWARE, OR ANY WARRANTY THAT THE SOFTWARE WILL BE ERROR FREE. IN NO EVENT SHALL NASA BE LIABLE FOR ANY DAMAGES, INCLUDING, BUT NOT LIMITED TO, DIRECT, INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES, ARISING OUT OF, RESULTING FROM, OR IN ANY WAY CONNECTED WITH THIS SOFTWARE, WHETHER OR NOT BASED UPON WARRANTY, CONTRACT, TORT , OR OTHERWISE, WHETHER OR NOT INJURY WAS SUSTAINED BY PERSONS OR PROPERTY OR OTHERWISE, AND WHETHER OR NOT LOSS WAS SUSTAINED FROM, OR AROSE OUT OF THE RESULTS OF, OR USE OF, THE SOFTWARE OR SERVICES PROVIDED HEREUNDER." \section{Acknowledgments} The development of many of the powerful features in CFITSIO was made possible through collaborations with many people or organizations from around the world. The following, in particular, have made especially significant contributions: Programmers from the Integral Science Data Center, Switzerland (namely, Jurek Borkowski, Bruce O'Neel, and Don Jennings), designed the concept for the plug-in I/O drivers that was introduced with CFITSIO 2.0. The use of `drivers' greatly simplified the low-level I/O, which in turn made other new features in CFITSIO (e.g., support for compressed FITS files and support for IRAF format image files) much easier to implement. Jurek Borkowski wrote the Shared Memory driver, and Bruce O'Neel wrote the drivers for accessing FITS files over the network using the FTP, HTTP, and ROOT protocols. The ISDC also provided the template parsing routines (written by Jurek Borkowski) and the hierarchical grouping routines (written by Don Jennings). The ISDC DAL (Data Access Layer) routines are layered on top of CFITSIO and make extensive use of these features. Uwe Lammers (XMM/ESA/ESTEC, The Netherlands) designed the high-performance lexical parsing algorithm that is used to do on-the-fly filtering of FITS tables. This algorithm essentially pre-compiles the user-supplied selection expression into a form that can be rapidly evaluated for each row. Peter Wilson (RSTX, NASA/GSFC) then wrote the parsing routines used by CFITSIO based on Lammers' design, combined with other techniques such as the CFITSIO iterator routine to further enhance the data processing throughput. This effort also benefited from a much earlier lexical parsing routine that was developed by Kent Blackburn (NASA/GSFC). More recently, Craig Markwardt (NASA/GSFC) implemented additional functions (median, average, stddev) and other enhancements to the lexical parser. The CFITSIO iterator function is loosely based on similar ideas developed for the XMM Data Access Layer. Peter Wilson (RSTX, NASA/GSFC) wrote the complete set of Fortran-callable wrappers for all the CFITSIO routines, which in turn rely on the CFORTRAN macro developed by Burkhard Burow. The syntax used by CFITSIO for filtering or binning input FITS files is based on ideas developed for the AXAF Science Center Data Model by Jonathan McDowell, Antonella Fruscione, Aneta Siemiginowska and Bill Joye. See http://heasarc.gsfc.nasa.gov/docs/journal/axaf7.html for further description of the AXAF Data Model. The file decompression code were taken directly from the gzip (GNU zip) program developed by Jean-loup Gailly and others. Doug Mink, SAO, provided the routines for converting IRAF format images into FITS format. Martin Reinecke (Max Planck Institute, Garching)) provided the modifications to cfortran.h that are necessary to support 64-bit integer values when calling C routines from fortran programs. The cfortran.h macros were originally developed by Burkhard Burow (CERN). Julian Taylor (ESO, Garching) provided the fast byte-swapping algorithms that use the SSE2 and SSSE3 machine instructions available on x86\_64 CPUs. In addition, many other people have made valuable contributions to the development of CFITSIO. These include (with apologies to others that may have inadvertently been omitted): Steve Allen, Carl Akerlof, Keith Arnaud, Morten Krabbe Barfoed, Kent Blackburn, G Bodammer, Romke Bontekoe, Lucio Chiappetti, Keith Costorf, Robin Corbet, John Davis, Richard Fink, Ning Gan, Emily Greene, Joe Harrington, Cheng Ho, Phil Hodge, Jim Ingham, Yoshitaka Ishisaki, Diab Jerius, Mark Levine, Todd Karakaskian, Edward King, Scott Koch, Claire Larkin, Rob Managan, Eric Mandel, John Mattox, Carsten Meyer, Emi Miyata, Stefan Mochnacki, Mike Noble, Oliver Oberdorf, Clive Page, Arvind Parmar, Jeff Pedelty, Tim Pearson, Maren Purves, Scott Randall, Chris Rogers, Arnold Rots, Barry Schlesinger, Robin Stebbins, Andrew Szymkowiak, Allyn Tennant, Peter Teuben, James Theiler, Doug Tody, Shiro Ueno, Steve Walton, Archie Warnock, Alan Watson, Dan Whipple, Wim Wimmers, Peter Young, Jianjun Xu, and Nelson Zarate. \chapter{ A FITS Primer } This section gives a brief overview of the structure of FITS files. Users should refer to the documentation available from the FITS Support Office, as described in the introduction, for more detailed information on FITS formats. FITS was first developed in the late 1970's as a standard data interchange format between various astronomical observatories. Since then FITS has become the defacto standard data format supported by most astronomical data analysis software packages. A FITS file consists of one or more Header + Data Units (HDUs), where the first HDU is called the `Primary HDU', or `Primary Array'. The primary array contains an N-dimensional array of pixels, such as a 1-D spectrum, a 2-D image, or a 3-D data cube. Six different primary datatypes are supported: Unsigned 8-bit bytes, 16, 32, and 64-bit signed integers, and 32 and 64-bit floating point reals. FITS also has a convention for storing unsigned integers (see the later section entitled `Unsigned Integers' for more details). The primary HDU may also consist of only a header with a null array containing no data pixels. Any number of additional HDUs may follow the primary array; these additional HDUs are called FITS `extensions'. There are currently 3 types of extensions defined by the FITS standard: \begin{itemize} \item Image Extension - a N-dimensional array of pixels, like in a primary array \item ASCII Table Extension - rows and columns of data in ASCII character format \item Binary Table Extension - rows and columns of data in binary representation \end{itemize} In each case the HDU consists of an ASCII Header Unit followed by an optional Data Unit. For historical reasons, each Header or Data unit must be an exact multiple of 2880 8-bit bytes long. Any unused space is padded with fill characters (ASCII blanks or zeros). Each Header Unit consists of any number of 80-character keyword records or `card images' which have the general form: \begin{verbatim} KEYNAME = value / comment string NULLKEY = / comment: This keyword has no value \end{verbatim} The keyword names may be up to 8 characters long and can only contain uppercase letters, the digits 0-9, the hyphen, and the underscore character. The keyword name is (usually) followed by an equals sign and a space character (= ) in columns 9 - 10 of the record, followed by the value of the keyword which may be either an integer, a floating point number, a character string (enclosed in single quotes), or a boolean value (the letter T or F). A keyword may also have a null or undefined value if there is no specified value string, as in the second example. The last keyword in the header is always the `END' keyword which has no value or comment fields. There are many rules governing the exact format of a keyword record (see the FITS Standard) so it is better to rely on standard interface software like FITSIO to correctly construct or to parse the keyword records rather than try to deal directly with the raw FITS formats. Each Header Unit begins with a series of required keywords which depend on the type of HDU. These required keywords specify the size and format of the following Data Unit. The header may contain other optional keywords to describe other aspects of the data, such as the units or scaling values. Other COMMENT or HISTORY keywords are also frequently added to further document the data file. The optional Data Unit immediately follows the last 2880-byte block in the Header Unit. Some HDUs do not have a Data Unit and only consist of the Header Unit. If there is more than one HDU in the FITS file, then the Header Unit of the next HDU immediately follows the last 2880-byte block of the previous Data Unit (or Header Unit if there is no Data Unit). The main required keywords in FITS primary arrays or image extensions are: \begin{itemize} \item BITPIX -- defines the datatype of the array: 8, 16, 32, 64, -32, -64 for unsigned 8--bit byte, 16--bit signed integer, 32--bit signed integer, 64--bit signed integer, 32--bit IEEE floating point, and 64--bit IEEE double precision floating point, respectively. \item NAXIS -- the number of dimensions in the array, usually 0, 1, 2, 3, or 4. \item NAXISn -- (n ranges from 1 to NAXIS) defines the size of each dimension. \end{itemize} FITS tables start with the keyword XTENSION = `TABLE' (for ASCII tables) or XTENSION = `BINTABLE' (for binary tables) and have the following main keywords: \begin{itemize} \item TFIELDS -- number of fields or columns in the table \item NAXIS2 -- number of rows in the table \item TTYPEn -- for each column (n ranges from 1 to TFIELDS) gives the name of the column \item TFORMn -- the datatype of the column \item TUNITn -- the physical units of the column (optional) \end{itemize} Users should refer to the FITS Support Office at {\tt http://fits.gsfc.nasa.gov} for further information about the FITS format and related software packages. \chapter{FITSIO Conventions and Guidelines } \section{CFITSIO Size Limitations} CFITSIO places few restrictions on the size of FITS files that it reads or writes. There are a few limits, however, which may affect some extreme cases: 1. The maximum number of FITS files that may be simultaneously opened by CFITSIO is set by NMAXFILES, as defined in fitsio2.h. The current default value is 1000, but this may be increased if necessary. Note that CFITSIO allocates NIOBUF * 2880 bytes of I/O buffer space for each file that is opened. The default value of NIOBUF is 40 (defined in fitsio.h), so this amounts to more than 115K of memory for each opened file (or 115 MB for 1000 opened files). Note that the underlying operating system, may have a lower limit on the number of files that can be opened simultaneously. 2. By default, CFITSIO can handle FITS files up to 2.1 GB in size (2**31 bytes). This file size limit is often imposed by 32-bit operating systems. More recently, as 64-bit operating systems become more common, an industry-wide standard (at least on Unix systems) has been developed to support larger sized files (see http://ftp.sas.com/standards/large.file/). Starting with version 2.1 of CFITSIO, larger FITS files up to 6 terabytes in size may be read and written on supported platforms. In order to support these larger files, CFITSIO must be compiled with the '-D\_LARGEFILE\_SOURCE' and `-D\_FILE\_OFFSET\_BITS=64' compiler flags. Some platforms may also require the `-D\_LARGE\_FILES' compiler flag. This causes the compiler to allocate 8-bytes instead of 4-bytes for the `off\_t' datatype which is used to store file offset positions. It appears that in most cases it is not necessary to also include these compiler flags when compiling programs that link to the CFITSIO library. If CFITSIO is compiled with the -D\_LARGEFILE\_SOURCE and -D\_FILE\_OFFSET\_BITS=64 flags on a platform that supports large files, then it can read and write FITS files that contain up to 2**31 2880-byte FITS records, or approximately 6 terabytes in size. It is still required that the value of the NAXISn and PCOUNT keywords in each extension be within the range of a signed 4-byte integer (max value = 2,147,483,648). Thus, each dimension of an image (given by the NAXISn keywords), the total width of a table (NAXIS1 keyword), the number of rows in a table (NAXIS2 keyword), and the total size of the variable-length array heap in binary tables (PCOUNT keyword) must be less than this limit. Currently, support for large files within CFITSIO has been tested on the Linux, Solaris, and IBM AIX operating systems. \section{Multiple Access to the Same FITS File} CFITSIO supports simultaneous read and write access to multiple HDUs in the same FITS file. Thus, one can open the same FITS file twice within a single program and move to 2 different HDUs in the file, and then read and write data or keywords to the 2 extensions just as if one were accessing 2 completely separate FITS files. Since in general it is not possible to physically open the same file twice and then expect to be able to simultaneously (or in alternating succession) write to 2 different locations in the file, CFITSIO recognizes when the file to be opened (in the call to fits\_open\_file) has already been opened and instead of actually opening the file again, just logically links the new file to the old file. (This only applies if the file is opened more than once within the same program, and does not prevent the same file from being simultaneously opened by more than one program). Then before CFITSIO reads or writes to either (logical) file, it makes sure that any modifications made to the other file have been completely flushed from the internal buffers to the file. Thus, in principle, one could open a file twice, in one case pointing to the first extension and in the other pointing to the 2nd extension and then write data to both extensions, in any order, without danger of corrupting the file, There may be some efficiency penalties in doing this however, since CFITSIO has to flush all the internal buffers related to one file before switching to the other, so it would still be prudent to minimize the number of times one switches back and forth between doing I/O to different HDUs in the same file. \section{Current Header Data Unit (CHDU)} In general, a FITS file can contain multiple Header Data Units, also called extensions. CFITSIO only operates within one HDU at any given time, and the currently selected HDU is called the Current Header Data Unit (CHDU). When a FITS file is first created or opened the CHDU is automatically defined to be the first HDU (i.e., the primary array). CFITSIO routines are provided to move to and open any other existing HDU within the FITS file or to append or insert a new HDU in the FITS file which then becomes the CHDU. \section{Subroutine Names} All FITSIO subroutine names begin with the letters 'ft' to distinguish them from other subroutines and are 5 or 6 characters long. Users should not name their own subroutines beginning with 'ft' to avoid conflicts. (The SPP interface routines all begin with 'fs'). Subroutines which read or get information from the FITS file have names beginning with 'ftg...'. Subroutines which write or put information into the FITS file have names beginning with 'ftp...'. \section{Subroutine Families and Datatypes} Many of the subroutines come in families which differ only in the datatype of the associated parameter(s) . The datatype of these subroutines is indicated by the last letter of the subroutine name (e.g., 'j' in 'ftpkyj') as follows: \begin{verbatim} x - bit b - character*1 (unsigned byte) i - short integer (I*2) j - integer (I*4, 32-bit integer) k - long long integer (I*8, 64-bit integer) e - real exponential floating point (R*4) f - real fixed-format floating point (R*4) d - double precision real floating-point (R*8) g - double precision fixed-format floating point (R*8) c - complex reals (pairs of R*4 values) m - double precision complex (pairs of R*8 values) l - logical (L*4) s - character string \end{verbatim} When dealing with the FITS byte datatype, it is important to remember that the raw values (before any scaling by the BSCALE and BZERO, or TSCALn and TZEROn keyword values) in byte arrays (BITPIX = 8) or byte columns (TFORMn = 'B') are interpreted as unsigned bytes with values ranging from 0 to 255. Some Fortran compilers support a non-standard byte datatype such as INTEGER*1, LOGICAL*1, or BYTE, which can sometimes be used instead of CHARACTER*1 variables. Many machines permit passing a numeric datatype (such as INTEGER*1) to the FITSIO subroutines which are expecting a CHARACTER*1 datatype, but this technically violates the Fortran-77 standard and is not supported on all machines (e.g., on a VAX/VMS machine one must use the VAX-specific \%DESCR function). One feature of the CFITSIO routines is that they can operate on a `X' (bit) column in a binary table as though it were a `B' (byte) column. For example a `11X' datatype column can be interpreted the same as a `2B' column (i.e., 2 unsigned 8-bit bytes). In some instances, it can be more efficient to read and write whole bytes at a time, rather than reading or writing each individual bit. The double precision complex datatype is not a standard Fortran-77 datatype. If a particular Fortran compiler does not directly support this datatype, then one may instead pass an array of pairs of double precision values to these subroutines. The first value in each pair is the real part, and the second is the imaginary part. \section{Implicit Data Type Conversion} The FITSIO routines that read and write numerical data can perform implicit data type conversion. This means that the data type of the variable or array in the program does not need to be the same as the data type of the value in the FITS file. Data type conversion is supported for numerical and string data types (if the string contains a valid number enclosed in quotes) when reading a FITS header keyword value and for numeric values when reading or writing values in the primary array or a table column. CFITSIO returns status = NUM\_OVERFLOW if the converted data value exceeds the range of the output data type. Implicit data type conversion is not supported within binary tables for string, logical, complex, or double complex data types. In addition, any table column may be read as if it contained string values. In the case of numeric columns the returned string will be formatted using the TDISPn display format if it exists. \section{Data Scaling} When reading numerical data values in the primary array or a table column, the values will be scaled automatically by the BSCALE and BZERO (or TSCALn and TZEROn) header keyword values if they are present in the header. The scaled data that is returned to the reading program will have \begin{verbatim} output value = (FITS value) * BSCALE + BZERO \end{verbatim} (a corresponding formula using TSCALn and TZEROn is used when reading from table columns). In the case of integer output values the floating point scaled value is truncated to an integer (not rounded to the nearest integer). The ftpscl and fttscl subroutines may be used to override the scaling parameters defined in the header (e.g., to turn off the scaling so that the program can read the raw unscaled values from the FITS file). When writing numerical data to the primary array or to a table column the data values will generally be automatically inversely scaled by the value of the BSCALE and BZERO (or TSCALn and TZEROn) header keyword values if they they exist in the header. These keywords must have been written to the header before any data is written for them to have any effect. Otherwise, one may use the ftpscl and fttscl subroutines to define or override the scaling keywords in the header (e.g., to turn off the scaling so that the program can write the raw unscaled values into the FITS file). If scaling is performed, the inverse scaled output value that is written into the FITS file will have \begin{verbatim} FITS value = ((input value) - BZERO) / BSCALE \end{verbatim} (a corresponding formula using TSCALn and TZEROn is used when writing to table columns). Rounding to the nearest integer, rather than truncation, is performed when writing integer datatypes to the FITS file. \section{Error Status Values and the Error Message Stack} The last parameter in nearly every FITSIO subroutine is the error status value which is both an input and an output parameter. A returned positive value for this parameter indicates an error was detected. A listing of all the FITSIO status code values is given at the end of this document. The FITSIO library uses an `inherited status' convention for the status parameter which means that if a subroutine is called with a positive input value of the status parameter, then the subroutine will exit immediately without changing the value of the status parameter. Thus, if one passes the status value returned from each FITSIO routine as input to the next FITSIO subroutine, then whenever an error is detected all further FITSIO processing will cease. This convention can simplify the error checking in application programs because it is not necessary to check the value of the status parameter after every single FITSIO subroutine call. If a program contains a sequence of several FITSIO calls, one can just check the status value after the last call. Since the returned status values are generally distinctive, it should be possible to determine which subroutine originally returned the error status. FITSIO also maintains an internal stack of error messages (80-character maximum length) which in many cases provide a more detailed explanation of the cause of the error than is provided by the error status number alone. It is recommended that the error message stack be printed out whenever a program detects a FITSIO error. To do this, call the FTGMSG routine repeatedly to get the successive messages on the stack. When the stack is empty FTGMSG will return a blank string. Note that this is a `First In -- First Out' stack, so the oldest error message is returned first by ftgmsg. \section{Variable-Length Array Facility in Binary Tables} FITSIO provides easy-to-use support for reading and writing data in variable length fields of a binary table. The variable length columns have TFORMn keyword values of the form `1Pt(len)' or `1Qt(len)' where `t' is the datatype code (e.g., I, J, E, D, etc.) and `len' is an integer specifying the maximum length of the vector in the table. If the value of `len' is not specified when the table is created (e.g., if the TFORM keyword value is simply specified as '1PE' instead of '1PE(400) ), then FITSIO will automatically scan the table when it is closed to determine the maximum length of the vector and will append this value to the TFORMn value. The same routines which read and write data in an ordinary fixed length binary table extension are also used for variable length fields, however, the subroutine parameters take on a slightly different interpretation as described below. All the data in a variable length field is written into an area called the `heap' which follows the main fixed-length FITS binary table. The size of the heap, in bytes, is specified with the PCOUNT keyword in the FITS header. When creating a new binary table, the initial value of PCOUNT should usually be set to zero. FITSIO will recompute the size of the heap as the data is written and will automatically update the PCOUNT keyword value when the table is closed. When writing variable length data to a table, CFITSIO will automatically extend the size of the heap area if necessary, so that any following HDUs do not get overwritten. By default the heap data area starts immediately after the last row of the fixed-length table. This default starting location may be overridden by the THEAP keyword, but this is not recommended. If additional rows of data are added to the table, CFITSIO will automatically shift the the heap down to make room for the new rows, but it is obviously be more efficient to initially create the table with the necessary number of blank rows, so that the heap does not needed to be constantly moved. When writing to a variable length field, the entire array of values for a given row of the table must be written with a single call to FTPCLx. The total length of the array is calculated from (NELEM+FELEM-1). One cannot append more elements to an existing field at a later time; any attempt to do so will simply overwrite all the data which was previously written. Note also that the new data will be written to a new area of the heap and the heap space used by the previous write cannot be reclaimed. For this reason it is advised that each row of a variable length field only be written once. An exception to this general rule occurs when setting elements of an array as undefined. One must first write a dummy value into the array with FTPCLx, and then call FTPCLU to flag the desired elements as undefined. (Do not use the FTPCNx family of routines with variable length fields). Note that the rows of a table, whether fixed or variable length, do not have to be written consecutively and may be written in any order. When writing to a variable length ASCII character field (e.g., TFORM = '1PA') only a single character string written. FTPCLS writes the whole length of the input string (minus any trailing blank characters), thus the NELEM and FELEM parameters are ignored. If the input string is completely blank then FITSIO will write one blank character to the FITS file. Similarly, FTGCVS and FTGCFS read the entire string (truncated to the width of the character string argument in the subroutine call) and also ignore the NELEM and FELEM parameters. The FTPDES subroutine is useful in situations where multiple rows of a variable length column have the identical array of values. One can simply write the array once for the first row, and then use FTPDES to write the same descriptor values into the other rows (use the FTGDES routine to read the first descriptor value); all the rows will then point to the same storage location thus saving disk space. When reading from a variable length array field one can only read as many elements as actually exist in that row of the table; reading does not automatically continue with the next row of the table as occurs when reading an ordinary fixed length table field. Attempts to read more than this will cause an error status to be returned. One can determine the number of elements in each row of a variable column with the FTGDES subroutine. \section{Support for IEEE Special Values} The ANSI/IEEE-754 floating-point number standard defines certain special values that are used to represent such quantities as Not-a-Number (NaN), denormalized, underflow, overflow, and infinity. (See the Appendix in the FITS standard or the FITS User's Guide for a list of these values). The FITSIO subroutines that read floating point data in FITS files recognize these IEEE special values and by default interpret the overflow and infinity values as being equivalent to a NaN, and convert the underflow and denormalized values into zeros. In some cases programmers may want access to the raw IEEE values, without any modification by FITSIO. This can be done by calling the FTGPVx or FTGCVx routines while specifying 0.0 as the value of the NULLVAL parameter. This will force FITSIO to simply pass the IEEE values through to the application program, without any modification. This does not work for double precision values on VAX/VMS machines, however, where there is no easy way to bypass the default interpretation of the IEEE special values. This is also not supported when reading floating-point images that have been compressed with the FITS tiled image compression convention that is discussed in section 5.6; the pixels values in tile compressed images are represented by scaled integers, and a reserved integer value (not a NaN) is used to represent undefined pixels. \section{When the Final Size of the FITS HDU is Unknown} It is not required to know the total size of a FITS data array or table before beginning to write the data to the FITS file. In the case of the primary array or an image extension, one should initially create the array with the size of the highest dimension (largest NAXISn keyword) set to a dummy value, such as 1. Then after all the data have been written and the true dimensions are known, then the NAXISn value should be updated using the fits\_ update\_key routine before moving to another extension or closing the FITS file. When writing to FITS tables, CFITSIO automatically keeps track of the highest row number that is written to, and will increase the size of the table if necessary. CFITSIO will also automatically insert space in the FITS file if necessary, to ensure that the data 'heap', if it exists, and/or any additional HDUs that follow the table do not get overwritten as new rows are written to the table. As a general rule it is best to specify the initial number of rows = 0 when the table is created, then let CFITSIO keep track of the number of rows that are actually written. The application program should not manually update the number of rows in the table (as given by the NAXIS2 keyword) since CFITSIO does this automatically. If a table is initially created with more than zero rows, then this will usually be considered as the minimum size of the table, even if fewer rows are actually written to the table. Thus, if a table is initially created with NAXIS2 = 20, and CFITSIO only writes 10 rows of data before closing the table, then NAXIS2 will remain equal to 20. If however, 30 rows of data are written to this table, then NAXIS2 will be increased from 20 to 30. The one exception to this automatic updating of the NAXIS2 keyword is if the application program directly modifies the value of NAXIS2 (up or down) itself just before closing the table. In this case, CFITSIO does not update NAXIS2 again, since it assumes that the application program must have had a good reason for changing the value directly. This is not recommended, however, and is only provided for backward compatibility with software that initially creates a table with a large number of rows, than decreases the NAXIS2 value to the actual smaller value just before closing the table. \section{Local FITS Conventions supported by FITSIO} CFITSIO supports several local FITS conventions which are not defined in the official FITS standard and which are not necessarily recognized or supported by other FITS software packages. Programmers should be cautious about using these features, especially if the FITS files that are produced are expected to be processed by other software systems which do not use the CFITSIO interface. \subsection{Support for Long String Keyword Values.} The length of a standard FITS string keyword is limited to 68 characters because it must fit entirely within a single FITS header keyword record. In some instances it is necessary to encode strings longer than this limit, so FITSIO supports a local convention in which the string value is continued over multiple keywords. This continuation convention uses an ampersand character at the end of each substring to indicate that it is continued on the next keyword, and the continuation keywords all have the name CONTINUE without an equal sign in column 9. The string value may be continued in this way over as many additional CONTINUE keywords as is required. The following lines illustrate this continuation convention which is used in the value of the STRKEY keyword: \begin{verbatim} LONGSTRN= 'OGIP 1.0' / The OGIP Long String Convention may be used. STRKEY = 'This is a very long string keyword&' / Optional Comment CONTINUE ' value that is continued over 3 keywords in the & ' CONTINUE 'FITS header.' / This is another optional comment. \end{verbatim} It is recommended that the LONGSTRN keyword, as shown here, always be included in any HDU that uses this longstring convention. A subroutine called FTPLSW has been provided in CFITSIO to write this keyword if it does not already exist. This long string convention is supported by the following FITSIO subroutines that deal with string-valued keywords: \begin{verbatim} ftgkys - read a string keyword ftpkls - write (append) a string keyword ftikls - insert a string keyword ftmkls - modify the value of an existing string keyword ftukls - update an existing keyword, or write a new keyword ftdkey - delete a keyword \end{verbatim} These routines will transparently read, write, or delete a long string value in the FITS file, so programmers in general do not have to be concerned about the details of the convention that is used to encode the long string in the FITS header. When reading a long string, one must ensure that the character string parameter used in these subroutine calls has been declared long enough to hold the entire string, otherwise the returned string value will be truncated. Note that the more commonly used FITSIO subroutine to write string valued keywords (FTPKYS) does NOT support this long string convention and only supports strings up to 68 characters in length. This has been done deliberately to prevent programs from inadvertently writing keywords using this non-standard convention without the explicit intent of the programmer or user. The FTPKLS subroutine must be called instead to write long strings. This routine can also be used to write ordinary string values less than 68 characters in length. \subsection{Arrays of Fixed-Length Strings in Binary Tables} CFITSIO supports 2 ways to specify that a character column in a binary table contains an array of fixed-length strings. The first way, which is officially supported by the FITS Standard document, uses the TDIMn keyword. For example, if TFORMn = '60A' and TDIMn = '(12,5)' then that column will be interpreted as containing an array of 5 strings, each 12 characters long. FITSIO also supports a local convention for the format of the TFORMn keyword value of the form 'rAw' where 'r' is an integer specifying the total width in characters of the column, and 'w' is an integer specifying the (fixed) length of an individual unit string within the vector. For example, TFORM1 = '120A10' would indicate that the binary table column is 120 characters wide and consists of 12 10-character length strings. This convention is recognized by the FITSIO subroutines that read or write strings in binary tables. The Binary Table definition document specifies that other optional characters may follow the datatype code in the TFORM keyword, so this local convention is in compliance with the FITS standard, although other FITS readers are not required to recognize this convention. \subsection{Keyword Units Strings} One deficiency of the current FITS Standard is that it does not define a specific convention for recording the physical units of a keyword value. The TUNITn keyword can be used to specify the physical units of the values in a table column, but there is no analogous convention for keyword values. The comment field of the keyword is often used for this purpose, but the units are usually not specified in a well defined format that FITS readers can easily recognize and extract. To solve this deficiency, FITSIO uses a local convention in which the keyword units are enclosed in square brackets as the first token in the keyword comment field; more specifically, the opening square bracket immediately follows the slash '/' comment field delimiter and a single space character. The following examples illustrate keywords that use this convention: \begin{verbatim} EXPOSURE= 1800.0 / [s] elapsed exposure time V_HELIO = 16.23 / [km s**(-1)] heliocentric velocity LAMBDA = 5400. / [angstrom] central wavelength FLUX = 4.9033487787637465E-30 / [J/cm**2/s] average flux \end{verbatim} In general, the units named in the IAU(1988) Style Guide are recommended, with the main exception that the preferred unit for angle is 'deg' for degrees. The FTPUNT and FTGUNT subroutines in FITSIO write and read, respectively, the keyword unit strings in an existing keyword. \subsection{HIERARCH Convention for Extended Keyword Names} CFITSIO supports the HIERARCH keyword convention which allows keyword names that are longer then 8 characters and may contain the full range of printable ASCII text characters. This convention was developed at the European Southern Observatory (ESO) to support hierarchical FITS keyword such as: \begin{verbatim} HIERARCH ESO INS FOCU POS = -0.00002500 / Focus position \end{verbatim} Basically, this convention uses the FITS keyword 'HIERARCH' to indicate that this convention is being used, then the actual keyword name ({\tt'ESO INS FOCU POS'} in this example) begins in column 10 and can contain any printable ASCII text characters, including spaces. The equals sign marks the end of the keyword name and is followed by the usual value and comment fields just as in standard FITS keywords. Further details of this convention are described at http://fits.gsfc.nasa.gov/registry/hierarch\_keyword.html and in Section 4.4 of the ESO Data Interface Control Document that is linked to from http://archive.eso.org/cms/tools-documentation/eso-data-interface-control.html. This convention allows a much broader range of keyword names than is allowed by the FITS Standard. Here are more examples of such keywords: \begin{verbatim} HIERARCH LongKeyword = 47.5 / Keyword has > 8 characters, and mixed case HIERARCH XTE$TEMP = 98.6 / Keyword contains the '$' character HIERARCH Earth is a star = F / Keyword contains embedded spaces \end{verbatim} CFITSIO will transparently read and write these keywords, so application programs do not in general need to know anything about the specific implementation details of the HIERARCH convention. In particular, application programs do not need to specify the `HIERARCH' part of the keyword name when reading or writing keywords (although it may be included if desired). When writing a keyword, CFITSIO first checks to see if the keyword name is legal as a standard FITS keyword (no more than 8 characters long and containing only letters, digits, or a minus sign or underscore). If so it writes it as a standard FITS keyword, otherwise it uses the hierarch convention to write the keyword. The maximum keyword name length is 67 characters, which leaves only 1 space for the value field. A more practical limit is about 40 characters, which leaves enough room for most keyword values. CFITSIO returns an error if there is not enough room for both the keyword name and the keyword value on the 80-character card, except for string-valued keywords which are simply truncated so that the closing quote character falls in column 80. In the current implementation, CFITSIO preserves the case of the letters when writing the keyword name, but it is case-insensitive when reading or searching for a keyword. The current implementation allows any ASCII text character (ASCII 32 to ASCII 126) in the keyword name except for the '=' character. A space is also required on either side of the equal sign. \section{Optimizing Code for Maximum Processing Speed} CFITSIO has been carefully designed to obtain the highest possible speed when reading and writing FITS files. In order to achieve the best performance, however, application programmers must be careful to call the CFITSIO routines appropriately and in an efficient sequence; inappropriate usage of CFITSIO routines can greatly slow down the execution speed of a program. The maximum possible I/O speed of CFITSIO depends of course on the type of computer system that it is running on. To get a general idea of what data I/O speeds are possible on a particular machine, build the speed.c program that is distributed with CFITSIO (type 'make speed' in the CFITSIO directory). This diagnostic program measures the speed of writing and reading back a test FITS image, a binary table, and an ASCII table. The following 2 sections provide some background on how CFITSIO internally manages the data I/O and describes some strategies that may be used to optimize the processing speed of software that uses CFITSIO. \subsection{Background Information: How CFITSIO Manages Data I/O} Many CFITSIO operations involve transferring only a small number of bytes to or from the FITS file (e.g, reading a keyword, or writing a row in a table); it would be very inefficient to physically read or write such small blocks of data directly in the FITS file on disk, therefore CFITSIO maintains a set of internal Input--Output (IO) buffers in RAM memory that each contain one FITS block (2880 bytes) of data. Whenever CFITSIO needs to access data in the FITS file, it first transfers the FITS block containing those bytes into one of the IO buffers in memory. The next time CFITSIO needs to access bytes in the same block it can then go to the fast IO buffer rather than using a much slower system disk access routine. The number of available IO buffers is determined by the NIOBUF parameter (in fitsio2.h) and is currently set to 40. Whenever CFITSIO reads or writes data it first checks to see if that block of the FITS file is already loaded into one of the IO buffers. If not, and if there is an empty IO buffer available, then it will load that block into the IO buffer (when reading a FITS file) or will initialize a new block (when writing to a FITS file). If all the IO buffers are already full, it must decide which one to reuse (generally the one that has been accessed least recently), and flush the contents back to disk if it has been modified before loading the new block. The one major exception to the above process occurs whenever a large contiguous set of bytes are accessed, as might occur when reading or writing a FITS image. In this case CFITSIO bypasses the internal IO buffers and simply reads or writes the desired bytes directly in the disk file with a single call to a low-level file read or write routine. The minimum threshold for the number of bytes to read or write this way is set by the MINDIRECT parameter and is currently set to 3 FITS blocks = 8640 bytes. This is the most efficient way to read or write large chunks of data. Note that this fast direct IO process is not applicable when accessing columns of data in a FITS table because the bytes are generally not contiguous since they are interleaved by the other columns of data in the table. This explains why the speed for accessing FITS tables is generally slower than accessing FITS images. Given this background information, the general strategy for efficiently accessing FITS files should now be apparent: when dealing with FITS images, read or write large chunks of data at a time so that the direct IO mechanism will be invoked; when accessing FITS headers or FITS tables, on the other hand, once a particular FITS block has been loading into one of the IO buffers, try to access all the needed information in that block before it gets flushed out of the IO buffer. It is important to avoid the situation where the same FITS block is being read then flushed from a IO buffer multiple times. The following section gives more specific suggestions for optimizing the use of CFITSIO. \subsection{Optimization Strategies} 1. Because the data in FITS files is always stored in "big-endian" byte order, where the first byte of numeric values contains the most significant bits and the last byte contains the least significant bits, CFITSIO must swap the order of the bytes when reading or writing FITS files when running on little-endian machines (e.g., Linux and Microsoft Windows operating systems running on PCs with x86 CPUs). On fairly new CPUs that support "SSSE3" machine instructions (e.g., starting with Intel Core 2 CPUs in 2007, and in AMD CPUs beginning in 2011) significantly faster 4-byte and 8-byte swapping algorithms are available. These faster byte swapping functions are not used by default in CFITSIO (because of the potential code portablility issues), but users can enable them on supported platforms by adding the appropriate compiler flags (-mssse3 with gcc or icc on linux) when compiling the swapproc.c source file, which will allow the compiler to generate code using the SSSE3 instruction set. A convenient way to do this is to configure the CFITSIO library with the following command: \begin{verbatim} > ./configure --enable-ssse3 \end{verbatim} Note, however, that a binary executable file that is created using these faster functions will only run on machines that support the SSSE3 machine instructions. It will crash on machines that do not support them. For faster 2-byte swaps on virtually all x86-64 CPUs (even those that do not support SSSE3), a variant using only SSE2 instructions exists. SSE2 is enabled by default on x86\_64 CPUs with 64-bit operating systems (and is also automatically enabled by the --enable-ssse3 flag). When running on x86\_64 CPUs with 32-bit operating systems, these faster 2-byte swapping algorithms are not used by default in CFITSIO, but can be enabled explicitly with: \begin{verbatim} ./configure --enable-sse2 \end{verbatim} Preliminary testing indicates that these SSSE3 and SSE2 based byte-swapping algorithms can boost the CFITSIO performance when reading or writing FITS images by 20\% - 30\% or more. It is important to note, however, that compiler optimization must be turned on (e.g., by using the -O1 or -O2 flags in gcc) when building programs that use these fast byte-swapping algorithms in order to reap the full benefit of the SSSE3 and SSE2 instructions; without optimization, the code may actually run slower than when using more traditional byte-swapping techniques. 2. When dealing with a FITS primary array or IMAGE extension, it is more efficient to read or write large chunks of the image at a time (at least 3 FITS blocks = 8640 bytes) so that the direct IO mechanism will be used as described in the previous section. Smaller chunks of data are read or written via the IO buffers, which is somewhat less efficient because of the extra copy operation and additional bookkeeping steps that are required. In principle it is more efficient to read or write as big an array of image pixels at one time as possible, however, if the array becomes so large that the operating system cannot store it all in RAM, then the performance may be degraded because of the increased swapping of virtual memory to disk. 3. When dealing with FITS tables, the most important efficiency factor in the software design is to read or write the data in the FITS file in a single pass through the file. An example of poor program design would be to read a large, 3-column table by sequentially reading the entire first column, then going back to read the 2nd column, and finally the 3rd column; this obviously requires 3 passes through the file which could triple the execution time of an I/O limited program. For small tables this is not important, but when reading multi-megabyte sized tables these inefficiencies can become significant. The more efficient procedure in this case is to read or write only as many rows of the table as will fit into the available internal I/O buffers, then access all the necessary columns of data within that range of rows. Then after the program is completely finished with the data in those rows it can move on to the next range of rows that will fit in the buffers, continuing in this way until the entire file has been processed. By using this procedure of accessing all the columns of a table in parallel rather than sequentially, each block of the FITS file will only be read or written once. The optimal number of rows to read or write at one time in a given table depends on the width of the table row, on the number of I/O buffers that have been allocated in FITSIO, and also on the number of other FITS files that are open at the same time (since one I/O buffer is always reserved for each open FITS file). Fortunately, a FITSIO routine is available that will return the optimal number of rows for a given table: call ftgrsz(unit, nrows, status). It is not critical to use exactly the value of nrows returned by this routine, as long as one does not exceed it. Using a very small value however can also lead to poor performance because of the overhead from the larger number of subroutine calls. The optimal number of rows returned by ftgrsz is valid only as long as the application program is only reading or writing data in the specified table. Any other calls to access data in the table header would cause additional blocks of data to be loaded into the I/O buffers displacing data from the original table, and should be avoided during the critical period while the table is being read or written. 4. Use binary table extensions rather than ASCII table extensions for better efficiency when dealing with tabular data. The I/O to ASCII tables is slower because of the overhead in formatting or parsing the ASCII data fields, and because ASCII tables are about twice as large as binary tables with the same information content. 5. Design software so that it reads the FITS header keywords in the same order in which they occur in the file. When reading keywords, FITSIO searches forward starting from the position of the last keyword that was read. If it reaches the end of the header without finding the keyword, it then goes back to the start of the header and continues the search down to the position where it started. In practice, as long as the entire FITS header can fit at one time in the available internal I/O buffers, then the header keyword access will be very fast and it makes little difference which order they are accessed. 6. Avoid the use of scaling (by using the BSCALE and BZERO or TSCAL and TZERO keywords) in FITS files since the scaling operations add to the processing time needed to read or write the data. In some cases it may be more efficient to temporarily turn off the scaling (using ftpscl or fttscl) and then read or write the raw unscaled values in the FITS file. 7. Avoid using the 'implicit datatype conversion' capability in FITSIO. For instance, when reading a FITS image with BITPIX = -32 (32-bit floating point pixels), read the data into a single precision floating point data array in the program. Forcing FITSIO to convert the data to a different datatype can significantly slow the program. 8. Where feasible, design FITS binary tables using vector column elements so that the data are written as a contiguous set of bytes, rather than as single elements in multiple rows. For example, it is faster to access the data in a table that contains a single row and 2 columns with TFORM keywords equal to '10000E' and '10000J', than it is to access the same amount of data in a table with 10000 rows which has columns with the TFORM keywords equal to '1E' and '1J'. In the former case the 10000 floating point values in the first column are all written in a contiguous block of the file which can be read or written quickly, whereas in the second case each floating point value in the first column is interleaved with the integer value in the second column of the same row so CFITSIO has to explicitly move to the position of each element to be read or written. 9. Avoid the use of variable length vector columns in binary tables, since any reading or writing of these data requires that CFITSIO first look up or compute the starting address of each row of data in the heap. In practice, this is probably not a significant efficiency issue. 10. When copying data from one FITS table to another, it is faster to transfer the raw bytes instead of reading then writing each column of the table. The FITSIO subroutines FTGTBS and FTPTBS (for ASCII tables), and FTGTBB and FTPTBB (for binary tables) will perform low-level reads or writes of any contiguous range of bytes in a table extension. These routines can be used to read or write a whole row (or multiple rows) of a table with a single subroutine call. These routines are fast because they bypass all the usual data scaling, error checking and machine dependent data conversion that is normally done by FITSIO, and they allow the program to write the data to the output file in exactly the same byte order. For these same reasons, use of these routines can be somewhat risky because no validation or machine dependent conversion is performed by these routines. In general these routines are only recommended for optimizing critical pieces of code and should only be used by programmers who thoroughly understand the internal byte structure of the FITS tables they are reading or writing. 11. Another strategy for improving the speed of writing a FITS table, similar to the previous one, is to directly construct the entire byte stream for a whole table row (or multiple rows) within the application program and then write it to the FITS file with ftptbb. This avoids all the overhead normally present in the column-oriented CFITSIO write routines. This technique should only be used for critical applications, because it makes the code more difficult to understand and maintain, and it makes the code more system dependent (e.g., do the bytes need to be swapped before writing to the FITS file?). 12. Finally, external factors such as the type of magnetic disk controller (SCSI or IDE), the size of the disk cache, the average seek speed of the disk, the amount of disk fragmentation, and the amount of RAM available on the system can all have a significant impact on overall I/O efficiency. For critical applications, a system administrator should review the proposed system hardware to identify any potential I/O bottlenecks. \chapter{ Basic Interface Routines } This section defines a basic set of subroutines that can be used to perform the most common types of read and write operations on FITS files. New users should start with these subroutines and then, as needed, explore the more advance routines described in the following chapter to perform more complex or specialized operations. A right arrow symbol ($>$) is used to separate the input parameters from the output parameters in the definition of each routine. This symbol is not actually part of the calling sequence. Note that the status parameter is both an input and an output parameter and must be initialized = 0 prior to calling the FITSIO subroutines. Refer to Chapter 9 for the definition of all the parameters used by these interface routines. \section{FITSIO Error Status Routines \label{FTVERS}} \begin{description} \item[1 ] Return the current version number of the fitsio library. The version number will be incremented with each new release of CFITSIO. \end{description} \begin{verbatim} FTVERS( > version) \end{verbatim} \begin{description} \item[2 ] Return the descriptive text string corresponding to a FITSIO error status code. The 30-character length string contains a brief description of the cause of the error. \end{description} \begin{verbatim} FTGERR(status, > errtext) \end{verbatim} \begin{description} \item[3 ] Return the top (oldest) 80-character error message from the internal FITSIO stack of error messages and shift any remaining messages on the stack up one level. Any FITSIO error will generate one or more messages on the stack. Call this routine repeatedly to get each message in sequence. The error stack is empty when a blank string is returned. \end{description} \begin{verbatim} FTGMSG( > errmsg) \end{verbatim} \begin{description} \item[4 ]The FTPMRK routine puts an invisible marker on the CFITSIO error stack. The FTCMRK routine can then be used to delete any more recent error messages on the stack, back to the position of the marker. This preserves any older error messages on the stack. FTCMSG simply clears the entire error message stack. These routines are called without any arguments. \end{description} \begin{verbatim} FTPMRK FTCMRK FTCMSG \end{verbatim} \begin{description} \item[5 ] Print out the error message corresponding to the input status value and all the error messages on the FITSIO stack to the specified file stream (stream can be either the string 'STDOUT' or 'STDERR'). If the input status value = 0 then this routine does nothing. \end{description} \begin{verbatim} FTRPRT (stream, > status) \end{verbatim} \begin{description} \item[6 ] Write an 80-character message to the FITSIO error stack. Application programs should not normally write to the stack, but there may be some situations where this is desirable. \end{description} \begin{verbatim} FTPMSG(errmsg) \end{verbatim} \section{File I/O Routines} \begin{description} \item[1 ]Open an existing FITS file with readonly or readwrite access. This routine always opens the primary array (the first HDU) of the file, and does not move to a following extension, if one was specified as part of the filename. Use the FTNOPN routine to automatically move to the extension. This routine will also open IRAF images (.imh format files) and raw binary data arrays with READONLY access by first converting them on the fly into virtual FITS images. See the `Extended File Name Syntax' chapter for more details. The FTDKOPN routine simply opens the specified file without trying to interpret the filename using the extended filename syntax. \end{description} \begin{verbatim} FTOPEN(unit,filename,rwmode, > blocksize,status) FTDKOPN(unit,filename,rwmode, > blocksize,status) \end{verbatim} \begin{description} \item[2 ]Open an existing FITS file with readonly or readwrite access and move to a following extension, if one was specified as part of the filename. (e.g., 'filename.fits+2' or 'filename.fits[2]' will move to the 3rd HDU in the file). Note that this routine differs from FTOPEN in that it does not have the redundant blocksize argument. \end{description} \begin{verbatim} FTNOPN(unit,filename,rwmode, > status) \end{verbatim} \begin{description} \item[3 ]Open an existing FITS file with readonly or readwrite access and then move to the first HDU containing significant data, if a) an HDU name or number to open was not explicitly specified as part of the filename, and b) if the FITS file contains a null primary array (i.e., NAXIS = 0). In this case, it will look for the first IMAGE HDU with NAXIS > 0, or the first table that does not contain the strings `GTI' (Good Time Interval) or `OBSTABLE' in the EXTNAME keyword value. FTTOPN is similar, except it will move to the first significant table HDU (skipping over any image HDUs) in the file if a specific HDU name or number is not specified. FTIOPN will move to the first non-null image HDU, skipping over any tables. \end{description} \begin{verbatim} FTDOPN(unit,filename,rwmode, > status) FTTOPN(unit,filename,rwmode, > status) FTIOPN(unit,filename,rwmode, > status) \end{verbatim} \begin{description} \item[4 ]Open and initialize a new empty FITS file. A template file may also be specified to define the structure of the new file (see section 4.2.4). The FTDKINIT routine simply creates the specified file without trying to interpret the filename using the extended filename syntax. \end{description} \begin{verbatim} FTINIT(unit,filename,blocksize, > status) FTDKINIT(unit,filename,blocksize, > status) \end{verbatim} \begin{description} \item[5 ]Close a FITS file previously opened with ftopen or ftinit \end{description} \begin{verbatim} FTCLOS(unit, > status) \end{verbatim} \begin{description} \item[6 ] Move to a specified (absolute) HDU in the FITS file (nhdu = 1 for the FITS primary array) \end{description} \begin{verbatim} FTMAHD(unit,nhdu, > hdutype,status) \end{verbatim} \begin{description} \item[7 ] Create a primary array (if none already exists), or insert a new IMAGE extension immediately following the CHDU, or insert a new Primary Array at the beginning of the file. Any following extensions in the file will be shifted down to make room for the new extension. If the CHDU is the last HDU in the file then the new image extension will simply be appended to the end of the file. One can force a new primary array to be inserted at the beginning of the FITS file by setting status = -9 prior to calling the routine. In this case the existing primary array will be converted to an IMAGE extension. The new extension (or primary array) will become the CHDU. The FTIIMGLL routine is identical to the FTIIMG routine except that the 4th parameter (the length of each axis) is an array of 64-bit integers rather than an array of 32-bit integers. \end{description} \begin{verbatim} FTIIMG(unit,bitpix,naxis,naxes, > status) FTIIMGLL(unit,bitpix,naxis,naxesll, > status) \end{verbatim} \begin{description} \item[8 ] Insert a new ASCII TABLE extension immediately following the CHDU. Any following extensions will be shifted down to make room for the new extension. If there are no other following extensions then the new table extension will simply be appended to the end of the file. The new extension will become the CHDU. The FTITABLL routine is identical to the FTITAB routine except that the 2nd and 3rd parameters (that give the size of the table) are 64-bit integers rather than 32-bit integers. Under normal circumstances, the nrows and nrowsll paramenters should have a value of 0; CFITSIO will automatically update the number of rows as data is written to the table. \end{description} \begin{verbatim} FTITAB(unit,rowlen,nrows,tfields,ttype,tbcol,tform,tunit,extname, > status) FTITABLL(unit,rowlenll,nrowsll,tfields,ttype,tbcol,tform,tunit,extname, > status) \end{verbatim} \begin{description} \item[9 ] Insert a new binary table extension immediately following the CHDU. Any following extensions will be shifted down to make room for the new extension. If there are no other following extensions then the new bintable extension will simply be appended to the end of the file. The new extension will become the CHDU. The FTIBINLL routine is identical to the FTIBIN routine except that the 2nd parameter (that gives the length of the table) is a 64-bit integer rather than a 32-bit integer. Under normal circumstances, the nrows and nrowsll paramenters should have a value of 0; CFITSIO will automatically update the number of rows as data is written to the table. \end{description} \begin{verbatim} FTIBIN(unit,nrows,tfields,ttype,tform,tunit,extname,varidat > status) FTIBINLL(unit,nrowsll,tfields,ttype,tform,tunit,extname,varidat > status) \end{verbatim} \section{Keyword I/O Routines} \begin{description} \item[1 ]Put (append) an 80-character record into the CHU. \end{description} \begin{verbatim} FTPREC(unit,card, > status) \end{verbatim} \begin{description} \item[2 ] Put (append) a new keyword of the appropriate datatype into the CHU. The E and D versions of this routine have the added feature that if the 'decimals' parameter is negative, then the 'G' display format rather then the 'E' format will be used when constructing the keyword value, taking the absolute value of 'decimals' for the precision. This will suppress trailing zeros, and will use a fixed format rather than an exponential format, depending on the magnitude of the value. \end{description} \begin{verbatim} FTPKY[JKLS](unit,keyword,keyval,comment, > status) FTPKY[EDFG](unit,keyword,keyval,decimals,comment, > status) \end{verbatim} \begin{description} \item[3 ]Get the nth 80-character header record from the CHU. The first keyword in the header is at key\_no = 1; if key\_no = 0 then this subroutine simple moves the internal pointer to the beginning of the header so that subsequent keyword operations will start at the top of the header; it also returns a blank card value in this case. \end{description} \begin{verbatim} FTGREC(unit,key_no, > card,status) \end{verbatim} \begin{description} \item[4 ] Get a keyword value (with the appropriate datatype) and comment from the CHU \end{description} \begin{verbatim} FTGKY[EDJKLS](unit,keyword, > keyval,comment,status) \end{verbatim} \begin{description} \item[5 ] Delete an existing keyword record. \end{description} \begin{verbatim} FTDKEY(unit,keyword, > status) \end{verbatim} \section{Data I/O Routines} The following routines read or write data values in the current HDU of the FITS file. Automatic datatype conversion will be attempted for numerical datatypes if the specified datatype is different from the actual datatype of the FITS array or table column. \begin{description} \item[1 ]Write elements into the primary data array or image extension. \end{description} \begin{verbatim} FTPPR[BIJKED](unit,group,fpixel,nelements,values, > status) \end{verbatim} \begin{description} \item[2 ] Read elements from the primary data array or image extension. Undefined array elements will be returned with a value = nullval, unless nullval = 0 in which case no checks for undefined pixels will be performed. The anyf parameter is set to true (= .true.) if any of the returned elements were undefined. \end{description} \begin{verbatim} FTGPV[BIJKED](unit,group,fpixel,nelements,nullval, > values,anyf,status) \end{verbatim} \begin{description} \item[3 ] Write elements into an ASCII or binary table column. The `felem' parameter applies only to vector columns in binary tables and is ignored when writing to ASCII tables. \end{description} \begin{verbatim} FTPCL[SLBIJKEDCM](unit,colnum,frow,felem,nelements,values, > status) \end{verbatim} \begin{description} \item[4 ] Read elements from an ASCII or binary table column. Undefined array elements will be returned with a value = nullval, unless nullval = 0 (or = ' ' for ftgcvs) in which case no checking for undefined values will be performed. The ANYF parameter is set to true if any of the returned elements are undefined. Any column, regardless of it's intrinsic datatype, may be read as a string. It should be noted however that reading a numeric column as a string is 10 - 100 times slower than reading the same column as a number due to the large overhead in constructing the formatted strings. The display format of the returned strings will be determined by the TDISPn keyword, if it exists, otherwise by the datatype of the column. The length of the returned strings can be determined with the ftgcdw routine. The following TDISPn display formats are currently supported: \begin{verbatim} Iw.m Integer Ow.m Octal integer Zw.m Hexadecimal integer Fw.d Fixed floating point Ew.d Exponential floating point Dw.d Exponential floating point Gw.d General; uses Fw.d if significance not lost, else Ew.d \end{verbatim} where w is the width in characters of the displayed values, m is the minimum number of digits displayed, and d is the number of digits to the right of the decimal. The .m field is optional. \end{description} \begin{verbatim} FTGCV[SBIJKEDCM](unit,colnum,frow,felem,nelements,nullval, > values,anyf,status) \end{verbatim} \begin{description} \item[5 ] Get the table column number and full name of the column whose name matches the input template string. See the `Advanced Interface Routines' chapter for a full description of this routine. \end{description} \begin{verbatim} FTGCNN(unit,casesen,coltemplate, > colname,colnum,status) \end{verbatim} \chapter{ Advanced Interface Subroutines } This chapter defines all the available subroutines in the FITSIO user interface. For completeness, the basic subroutines described in the previous chapter are also repeated here. A right arrow symbol is used here to separate the input parameters from the output parameters in the definition of each subroutine. This symbol is not actually part of the calling sequence. An alphabetical list and definition of all the parameters is given at the end of this section. \section{FITS File Open and Close Subroutines: \label{FTOPEN}} \begin{description} \item[1 ]Open an existing FITS file with readonly or readwrite access. The FTDKOPN routine simply opens the specified file without trying to interpret the filename using the extended filename syntax. FTDOPN opens the file and also moves to the first HDU containing significant data, if no specific HDU is specified as part of the filename. FTTOPN and FTIOPN are similar except that they will move to the first table HDU or image HDU, respectively, if a HDU name or number is not specified as part of the filename. \end{description} \begin{verbatim} FTOPEN(unit,filename,rwmode, > blocksize,status) FTDKOPN(unit,filename,rwmode, > blocksize,status) FTDOPN(unit,filename,rwmode, > status) FTTOPN(unit,filename,rwmode, > status) FTIOPN(unit,filename,rwmode, > status) \end{verbatim} \begin{description} \item[2 ]Open an existing FITS file with readonly or readwrite access and move to a following extension, if one was specified as part of the filename. (e.g., 'filename.fits+2' or 'filename.fits[2]' will move to the 3rd HDU in the file). Note that this routine differs from FTOPEN in that it does not have the redundant blocksize argument. \end{description} \begin{verbatim} FTNOPN(unit,filename,rwmode, > status) \end{verbatim} \begin{description} \item[3 ] Reopen a FITS file that was previously opened with FTOPEN, FTNOPN, or FTINIT. The newunit number may then be treated as a separate file, and one may simultaneously read or write to 2 (or more) different extensions in the same file. The FTOPEN and FTNOPN routines (above) automatically detects cases where a previously opened file is being opened again, and then internally call FTREOPEN, so programs should rarely need to explicitly call this routine. \end{description} \begin{verbatim} FTREOPEN(unit, > newunit, status) \end{verbatim} \begin{description} \item[4 ]Open and initialize a new empty FITS file. The FTDKINIT routine simply creates the specified file without trying to interpret the filename using the extended filename syntax. \end{description} \begin{verbatim} FTINIT(unit,filename,blocksize, > status) FTDKINIT(unit,filename,blocksize, > status) \end{verbatim} \begin{description} \item[5 ] Create a new FITS file, using a template file to define its initial size and structure. The template may be another FITS HDU or an ASCII template file. If the input template file name is blank, then this routine behaves the same as FTINIT. The currently supported format of the ASCII template file is described under the fits\_parse\_template routine (in the general Utilities section), but this may change slightly later releases of CFITSIO. \end{description} \begin{verbatim} FTTPLT(unit, filename, tplfilename, > status) \end{verbatim} \begin{description} \item[6 ]Flush internal buffers of data to the output FITS file previously opened with ftopen or ftinit. The routine usually never needs to be called, but doing so will ensure that if the program subsequently aborts, then the FITS file will have at least been closed properly. \end{description} \begin{verbatim} FTFLUS(unit, > status) \end{verbatim} \begin{description} \item[7 ]Close a FITS file previously opened with ftopen or ftinit \end{description} \begin{verbatim} FTCLOS(unit, > status) \end{verbatim} \begin{description} \item[8 ] Close and DELETE a FITS file previously opened with ftopen or ftinit. This routine may be useful in cases where a FITS file is created, but an error occurs which prevents the complete file from being written. \end{description} \begin{verbatim} FTDELT(unit, > status) \end{verbatim} \begin{description} \item[9 ] Get the value of an unused I/O unit number which may then be used as input to FTOPEN or FTINIT. This routine searches for the first unused unit number in the range from with 99 down to 50. This routine just keeps an internal list of the allocated unit numbers and does not physically check that the Fortran unit is available (to be compatible with the SPP version of FITSIO). Thus users must not independently allocate any unit numbers in the range 50 - 99 if this routine is also to be used in the same program. This routine is provided for convenience only, and it is not required that the unit numbers used by FITSIO be allocated by this routine. \end{description} \begin{verbatim} FTGIOU( > iounit, status) \end{verbatim} \begin{description} \item[10] Free (deallocate) an I/O unit number which was previously allocated with FTGIOU. All previously allocated unit numbers may be deallocated at once by calling FTFIOU with iounit = -1. \end{description} \begin{verbatim} FTFIOU(iounit, > status) \end{verbatim} \begin{description} \item[11] Return the Fortran unit number that corresponds to the C fitsfile pointer value, or vice versa. These 2 C routines may be useful in mixed language programs where both C and Fortran subroutines need to access the same file. For example, if a FITS file is opened with unit 12 by a Fortran subroutine, then a C routine within the same program could get the fitfile pointer value to access the same file by calling 'fptr = CUnit2FITS(12)'. These routines return a value of zero if an error occurs. \end{description} \begin{verbatim} int CFITS2Unit(fitsfile *ptr); fitsfile* CUnit2FITS(int unit); \end{verbatim} \begin{description} \item[11] Parse the input filename and return the HDU number that would be moved to if the file were opened with FTNOPN. The returned HDU number begins with 1 for the primary array, so for example, if the input filename = `myfile.fits[2]' then hdunum = 3 will be returned. FITSIO does not open the file to check if the extension actually exists if an extension number is specified. If an extension *name* is included in the file name specification (e.g. `myfile.fits[EVENTS]' then this routine will have to open the FITS file and look for the position of the named extension, then close file again. This is not possible if the file is being read from the stdin stream, and an error will be returned in this case. If the filename does not specify an explicit extension (e.g. 'myfile.fits') then hdunum = -99 will be returned, which is functionally equivalent to hdunum = 1. This routine is mainly used for backward compatibility in the ftools software package and is not recommended for general use. It is generally better and more efficient to first open the FITS file with FTNOPN, then use FTGHDN to determine which HDU in the file has been opened, rather than calling FTEXTN followed by a call to FTNOPN. \end{description} \begin{verbatim} FTEXTN(filename, > nhdu, status) \end{verbatim} \begin{description} \item[12] Return the name of the opened FITS file. \end{description} \begin{verbatim} FTFLNM(unit, > filename, status) \end{verbatim} \begin{description} \item[13] Return the I/O mode of the open FITS file (READONLY = 0, READWRITE = 1). \end{description} \begin{verbatim} FTFLMD(unit, > iomode, status) \end{verbatim} \begin{description} \item[14] Return the file type of the opened FITS file (e.g. 'file://', 'ftp://', etc.). \end{description} \begin{verbatim} FTURLT(unit, > urltype, status) \end{verbatim} \begin{description} \item[15] Parse the input filename or URL into its component parts: the file type (file://, ftp://, http://, etc), the base input file name, the name of the output file that the input file is to be copied to prior to opening, the HDU or extension specification, the filtering specifier, the binning specifier, and the column specifier. Blank strings will be returned for any components that are not present in the input file name. \end{description} \begin{verbatim} FTIURL(filename, > filetype, infile, outfile, extspec, filter, binspec, colspec, status) \end{verbatim} \begin{description} \item[16] Parse the input file name and return the root file name. The root name includes the file type if specified, (e.g. 'ftp://' or 'http://') and the full path name, to the extent that it is specified in the input filename. It does not include the HDU name or number, or any filtering specifications. \end{description} \begin{verbatim} FTRTNM(filename, > rootname, status) \end{verbatim} \begin{description} \item[16] Test if the input file or a compressed version of the file (with a .gz, .Z, .z, or .zip extension) exists on disk. The returned value of the 'exists' parameter will have 1 of the 4 following values: \begin{verbatim} 2: the file does not exist, but a compressed version does exist 1: the disk file does exist 0: neither the file nor a compressed version of the file exist -1: the input file name is not a disk file (could be a ftp, http, smem, or mem file, or a file piped in on the STDIN stream) \end{verbatim} \end{description} \begin{verbatim} FTEXIST(filename, > exists, status); \end{verbatim} \section{HDU-Level Operations \label{FTMAHD}} When a FITS file is first opened or created, the internal buffers in FITSIO automatically point to the first HDU in the file. The following routines may be used to move to another HDU in the file. Note that the HDU numbering convention used in FITSIO denotes the primary array as the first HDU, the first extension in a FITS file is the second HDU, and so on. \begin{description} \item[1 ] Move to a specified (absolute) HDU in the FITS file (nhdu = 1 for the FITS primary array) \end{description} \begin{verbatim} FTMAHD(unit,nhdu, > hdutype,status) \end{verbatim} \begin{description} \item[2 ]Move to a new (existing) HDU forward or backwards relative to the CHDU \end{description} \begin{verbatim} FTMRHD(unit,nmove, > hdutype,status) \end{verbatim} \begin{description} \item[3 ] Move to the (first) HDU which has the specified extension type and EXTNAME (or HDUNAME) and EXTVER keyword values. The hdutype parameter may have a value of IMAGE\_HDU (0), ASCII\_TBL (1), BINARY\_TBL (2), or ANY\_HDU (-1) where ANY\_HDU means that only the extname and extver values will be used to locate the correct extension. If the input value of extver is 0 then the EXTVER keyword is ignored and the first HDU with a matching EXTNAME (or HDUNAME) keyword will be found. If no matching HDU is found in the file then the current HDU will remain unchanged and a status = BAD\_HDU\_NUM (301) will be returned. \end{description} \begin{verbatim} FTMNHD(unit, hdutype, extname, extver, > status) \end{verbatim} \begin{description} \item[4 ]Get the number of the current HDU in the FITS file (primary array = 1) \end{description} \begin{verbatim} FTGHDN(unit, > nhdu) \end{verbatim} \begin{description} \item[5 ] Return the type of the current HDU in the FITS file. The possible values for hdutype are IMAGE\_HDU (0), ASCII\_TBL (1), or BINARY\_TBL (2). \end{description} \begin{verbatim} FTGHDT(unit, > hdutype, status) \end{verbatim} \begin{description} \item[6 ] Return the total number of HDUs in the FITS file. The CHDU remains unchanged. \end{description} \begin{verbatim} FTTHDU(unit, > hdunum, status) \end{verbatim} \begin{description} \item[7 ]Create (append) a new empty HDU at the end of the FITS file. This new HDU becomes the Current HDU, but it is completely empty and contains no header keywords or data. It is recommended that FTIIMG, FTITAB or FTIBIN be used instead of this routine. \end{description} \begin{verbatim} FTCRHD(unit, > status) \end{verbatim} \begin{description} \item[8 ] Create a primary array (if none already exists), or insert a new IMAGE extension immediately following the CHDU, or insert a new Primary Array at the beginning of the file. Any following extensions in the file will be shifted down to make room for the new extension. If the CHDU is the last HDU in the file then the new image extension will simply be appended to the end of the file. One can force a new primary array to be inserted at the beginning of the FITS file by setting status = -9 prior to calling the routine. In this case the existing primary array will be converted to an IMAGE extension. The new extension (or primary array) will become the CHDU. The FTIIMGLL routine is identical to the FTIIMG routine except that the 4th parameter (the length of each axis) is an array of 64-bit integers rather than an array of 32-bit integers. \end{description} \begin{verbatim} FTIIMG(unit,bitpix,naxis,naxes, > status) FTIIMGLL(unit,bitpix,naxis,naxesll, > status) \end{verbatim} \begin{description} \item[9 ] Insert a new ASCII TABLE extension immediately following the CHDU. Any following extensions will be shifted down to make room for the new extension. If there are no other following extensions then the new table extension will simply be appended to the end of the file. The new extension will become the CHDU. The FTITABLL routine is identical to the FTITAB routine except that the 2nd and 3rd parameters (that give the size of the table) are 64-bit integers rather than 32-bit integers. \end{description} \begin{verbatim} FTITAB(unit,rowlen,nrows,tfields,ttype,tbcol,tform,tunit,extname, > status) FTITABLL(unit,rowlenll,nrowsll,tfields,ttype,tbcol,tform,tunit,extname, > status) \end{verbatim} \begin{description} \item[10] Insert a new binary table extension immediately following the CHDU. Any following extensions will be shifted down to make room for the new extension. If there are no other following extensions then the new bintable extension will simply be appended to the end of the file. The new extension will become the CHDU. The FTIBINLL routine is identical to the FTIBIN routine except that the 2nd parameter (that gives the length of the table) is a 64-bit integer rather than a 32-bit integer. \end{description} \begin{verbatim} FTIBIN(unit,nrows,tfields,ttype,tform,tunit,extname,varidat > status) FTIBINLL(unit,nrowsll,tfields,ttype,tform,tunit,extname,varidat > status) \end{verbatim} \begin{description} \item[11] Resize an image by modifing the size, dimensions, and/or datatype of the current primary array or image extension. If the new image, as specified by the input arguments, is larger than the current existing image in the FITS file then zero fill data will be inserted at the end of the current image and any following extensions will be moved further back in the file. Similarly, if the new image is smaller than the current image then any following extensions will be shifted up towards the beginning of the FITS file and the image data will be truncated to the new size. This routine rewrites the BITPIX, NAXIS, and NAXISn keywords with the appropriate values for new image. The FTRSIMLL routine is identical to the FTRSIM routine except that the 4th parameter (the length of each axis) is an array of 64-bit integers rather than an array of 32-bit integers. \end{description} \begin{verbatim} FTRSIM(unit,bitpix,naxis,naxes,status) FTRSIMLL(unit,bitpix,naxis,naxesll,status) \end{verbatim} \begin{description} \item[12] Delete the CHDU in the FITS file. Any following HDUs will be shifted forward in the file, to fill in the gap created by the deleted HDU. In the case of deleting the primary array (the first HDU in the file) then the current primary array will be replace by a null primary array containing the minimum set of required keywords and no data. If there are more extensions in the file following the one that is deleted, then the the CHDU will be redefined to point to the following extension. If there are no following extensions then the CHDU will be redefined to point to the previous HDU. The output HDUTYPE parameter indicates the type of the new CHDU after the previous CHDU has been deleted. \end{description} \begin{verbatim} FTDHDU(unit, > hdutype,status) \end{verbatim} \begin{description} \item[13] Copy all or part of the input FITS file and append it to the end of the output FITS file. If 'previous' (an integer parameter) is not equal to 0, then any HDUs preceding the current HDU in the input file will be copied to the output file. Similarly, 'current' and 'following' determine whether the current HDU, and/or any following HDUs in the input file will be copied to the output file. If all 3 parameters are not equal to zero, then the entire input file will be copied. On return, the current HDU in the input file will be unchanged, and the last copied HDU will be the current HDU in the output file. \end{description} \begin{verbatim} FTCPFL(iunit, ounit, previous, current, following, > status) \end{verbatim} \begin{description} \item[14] Copy the entire CHDU from the FITS file associated with IUNIT to the CHDU of the FITS file associated with OUNIT. The output HDU must be empty and not already contain any keywords. Space will be reserved for MOREKEYS additional keywords in the output header if there is not already enough space. \end{description} \begin{verbatim} FTCOPY(iunit,ounit,morekeys, > status) \end{verbatim} \begin{description} \item[15] Copy the header (and not the data) from the CHDU associated with inunit to the CHDU associated with outunit. If the current output HDU is not completely empty, then the CHDU will be closed and a new HDU will be appended to the output file. This routine will automatically transform the necessary keywords when copying a primary array to and image extension, or an image extension to a primary array. An empty output data unit will be created (all values = 0). \end{description} \begin{verbatim} FTCPHD(inunit, outunit, > status) \end{verbatim} \begin{description} \item[16] Copy just the data from the CHDU associated with IUNIT to the CHDU associated with OUNIT. This will overwrite any data previously in the OUNIT CHDU. This low level routine is used by FTCOPY, but it may also be useful in certain application programs which want to copy the data from one FITS file to another but also want to modify the header keywords in the process. all the required header keywords must be written to the OUNIT CHDU before calling this routine \end{description} \begin{verbatim} FTCPDT(iunit,ounit, > status) \end{verbatim} \section{Define or Redefine the structure of the CHDU \label{FTRDEF}} It should rarely be necessary to call the subroutines in this section. FITSIO internally calls these routines whenever necessary, so any calls to these routines by application programs will likely be redundant. \begin{description} \item[1 ] This routine forces FITSIO to scan the current header keywords that define the structure of the HDU (such as the NAXISn, PCOUNT and GCOUNT keywords) so that it can initialize the internal buffers that describe the HDU structure. This routine may be used instead of the more complicated calls to ftpdef, ftadef or ftbdef. This routine is also very useful for reinitializing the structure of an HDU, if the number of rows in a table, as specified by the NAXIS2 keyword, has been modified from its initial value. \end{description} \begin{verbatim} FTRDEF(unit, > status) (DEPRECATED) \end{verbatim} \begin{description} \item[2 ]Define the structure of the primary array or IMAGE extension. When writing GROUPed FITS files that by convention set the NAXIS1 keyword equal to 0, ftpdef must be called with naxes(1) = 1, NOT 0, otherwise FITSIO will report an error status=308 when trying to write data to a group. Note: it is usually simpler to call FTRDEF rather than this routine. \end{description} \begin{verbatim} FTPDEF(unit,bitpix,naxis,naxes,pcount,gcount, > status) (DEPRECATED) \end{verbatim} \begin{description} \item[3 ] Define the structure of an ASCII table (TABLE) extension. Note: it is usually simpler to call FTRDEF rather than this routine. \end{description} \begin{verbatim} FTADEF(unit,rowlen,tfields,tbcol,tform,nrows > status) (DEPRECATED) \end{verbatim} \begin{description} \item[4 ] Define the structure of a binary table (BINTABLE) extension. Note: it is usually simpler to call FTRDEF rather than this routine. \end{description} \begin{verbatim} FTBDEF(unit,tfields,tform,varidat,nrows > status) (DEPRECATED) \end{verbatim} \begin{description} \item[5 ] Define the size of the Current Data Unit, overriding the length of the data unit as previously defined by ftpdef, ftadef, or ftbdef. This is useful if one does not know the total size of the data unit until after the data have been written. The size (in bytes) of an ASCII or Binary table is given by NAXIS1 * NAXIS2. (Note that to determine the value of NAXIS1 it is often more convenient to read the value of the NAXIS1 keyword from the output file, rather than computing the row length directly from all the TFORM keyword values). Note: it is usually simpler to call FTRDEF rather than this routine. \end{description} \begin{verbatim} FTDDEF(unit,bytlen, > status) (DEPRECATED) \end{verbatim} \begin{description} \item[6 ] Define the zero indexed byte offset of the 'heap' measured from the start of the binary table data. By default the heap is assumed to start immediately following the regular table data, i.e., at location NAXIS1 x NAXIS2. This routine is only relevant for binary tables which contain variable length array columns (with TFORMn = 'Pt'). This subroutine also automatically writes the value of theap to a keyword in the extension header. This subroutine must be called after the required keywords have been written (with ftphbn) and after the table structure has been defined (with ftbdef) but before any data is written to the table. \end{description} \begin{verbatim} FTPTHP(unit,theap, > status) \end{verbatim} \section{FITS Header I/O Subroutines} \subsection{Header Space and Position Routines \label{FTHDEF}} \begin{description} \item[1 ] Reserve space in the CHU for MOREKEYS more header keywords. This subroutine may be called to reserve space for keywords which are to be written at a later time, after the data unit or subsequent extensions have been written to the FITS file. If this subroutine is not explicitly called, then the initial size of the FITS header will be limited to the space available at the time that the first data is written to the associated data unit. FITSIO has the ability to dynamically add more space to the header if needed, however it is more efficient to preallocate the required space if the size is known in advance. \end{description} \begin{verbatim} FTHDEF(unit,morekeys, > status) \end{verbatim} \begin{description} \item[2 ] Return the number of existing keywords in the CHU (NOT including the END keyword which is not considered a real keyword) and the remaining space available to write additional keywords in the CHU. (returns KEYSADD = -1 if the header has not yet been closed). Note that FITSIO will attempt to dynamically add space for more keywords if required when appending new keywords to a header. \end{description} \begin{verbatim} FTGHSP(iunit, > keysexist,keysadd,status) \end{verbatim} \begin{description} \item[3 ] Return the number of keywords in the header and the current position in the header. This returns the number of the keyword record that will be read next (or one greater than the position of the last keyword that was read or written). A value of 1 is returned if the pointer is positioned at the beginning of the header. \end{description} \begin{verbatim} FTGHPS(iunit, > keysexist,key_no,status) \end{verbatim} \subsection{Read or Write Standard Header Routines \label{FTPHPR}} These subroutines provide a simple method of reading or writing most of the keyword values that are normally required in a FITS files. These subroutines are provided for convenience only and are not required to be used. If preferred, users may call the lower-level subroutines described in the previous section to individually read or write the required keywords. Note that in most cases, the required keywords such as NAXIS, TFIELD, TTYPEn, etc, which define the structure of the HDU must be written to the header before any data can be written to the image or table. \begin{description} \item[1 ] Put the primary header or IMAGE extension keywords into the CHU. There are 2 available routines: The simpler FTPHPS routine is equivalent to calling ftphpr with the default values of SIMPLE = true, pcount = 0, gcount = 1, and EXTEND = true. PCOUNT, GCOUNT and EXTEND keywords are not required in the primary header and are only written if pcount is not equal to zero, gcount is not equal to zero or one, and if extend is TRUE, respectively. When writing to an IMAGE extension, the SIMPLE and EXTEND parameters are ignored. \end{description} \begin{verbatim} FTPHPS(unit,bitpix,naxis,naxes, > status) FTPHPR(unit,simple,bitpix,naxis,naxes,pcount,gcount,extend, > status) \end{verbatim} \begin{description} \item[2 ] Get primary header or IMAGE extension keywords from the CHU. When reading from an IMAGE extension the SIMPLE and EXTEND parameters are ignored. \end{description} \begin{verbatim} FTGHPR(unit,maxdim, > simple,bitpix,naxis,naxes,pcount,gcount,extend, status) \end{verbatim} \begin{description} \item[3 ] Put the ASCII table header keywords into the CHU. The optional TUNITn and EXTNAME keywords are written only if the input string values are not blank. \end{description} \begin{verbatim} FTPHTB(unit,rowlen,nrows,tfields,ttype,tbcol,tform,tunit,extname, > status) \end{verbatim} \begin{description} \item[4 ] Get the ASCII table header keywords from the CHU \end{description} \begin{verbatim} FTGHTB(unit,maxdim, > rowlen,nrows,tfields,ttype,tbcol,tform,tunit, extname,status) \end{verbatim} \begin{description} \item[5 ]Put the binary table header keywords into the CHU. The optional TUNITn and EXTNAME keywords are written only if the input string values are not blank. The pcount parameter, which specifies the size of the variable length array heap, should initially = 0; FITSIO will automatically update the PCOUNT keyword value if any variable length array data is written to the heap. The TFORM keyword value for variable length vector columns should have the form 'Pt(len)' or '1Pt(len)' where `t' is the data type code letter (A,I,J,E,D, etc.) and `len' is an integer specifying the maximum length of the vectors in that column (len must be greater than or equal to the longest vector in the column). If `len' is not specified when the table is created (e.g., the input TFORMn value is just '1Pt') then FITSIO will scan the column when the table is first closed and will append the maximum length to the TFORM keyword value. Note that if the table is subsequently modified to increase the maximum length of the vectors then the modifying program is responsible for also updating the TFORM keyword value. \end{description} \begin{verbatim} FTPHBN(unit,nrows,tfields,ttype,tform,tunit,extname,varidat, > status) \end{verbatim} \begin{description} \item[6 ]Get the binary table header keywords from the CHU \end{description} \begin{verbatim} FTGHBN(unit,maxdim, > nrows,tfields,ttype,tform,tunit,extname,varidat, status) \end{verbatim} \subsection{Write Keyword Subroutines \label{FTPREC}} \begin{description} \item[1 ]Put (append) an 80-character record into the CHU. \end{description} \begin{verbatim} FTPREC(unit,card, > status) \end{verbatim} \begin{description} \item[2 ] Put (append) a COMMENT keyword into the CHU. Multiple COMMENT keywords will be written if the input comment string is longer than 72 characters. \end{description} \begin{verbatim} FTPCOM(unit,comment, > status) \end{verbatim} \begin{description} \item[3 ]Put (append) a HISTORY keyword into the CHU. Multiple HISTORY keywords will be written if the input history string is longer than 72 characters. \end{description} \begin{verbatim} FTPHIS(unit,history, > status) \end{verbatim} \begin{description} \item[4 ] Put (append) the DATE keyword into the CHU. The keyword value will contain the current system date as a character string in 'dd/mm/yy' format. If a DATE keyword already exists in the header, then this subroutine will simply update the keyword value in-place with the current date. \end{description} \begin{verbatim} FTPDAT(unit, > status) \end{verbatim} \begin{description} \item[5 ] Put (append) a new keyword of the appropriate datatype into the CHU. Note that FTPKYS will only write string values up to 68 characters in length; longer strings will be truncated. The FTPKLS routine can be used to write longer strings, using a non-standard FITS convention. The E and D versions of this routine have the added feature that if the 'decimals' parameter is negative, then the 'G' display format rather then the 'E' format will be used when constructing the keyword value, taking the absolute value of 'decimals' for the precision. This will suppress trailing zeros, and will use a fixed format rather than an exponential format, depending on the magnitude of the value. \end{description} \begin{verbatim} FTPKY[JKLS](unit,keyword,keyval,comment, > status) FTPKY[EDFG](unit,keyword,keyval,decimals,comment, > status) \end{verbatim} \begin{description} \item[6 ] Put (append) a string valued keyword into the CHU which may be longer than 68 characters in length. This uses the Long String Keyword convention that is described in the "Usage Guidelines and Suggestions" section of this document. Since this uses a non-standard FITS convention to encode the long keyword string, programs which use this routine should also call the FTPLSW routine to add some COMMENT keywords to warn users of the FITS file that this convention is being used. FTPLSW also writes a keyword called LONGSTRN to record the version of the longstring convention that has been used, in case a new convention is adopted at some point in the future. If the LONGSTRN keyword is already present in the header, then FTPLSW will simply return and will not write duplicate keywords. \end{description} \begin{verbatim} FTPKLS(unit,keyword,keyval,comment, > status) FTPLSW(unit, > status) \end{verbatim} \begin{description} \item[7 ] Put (append) a new keyword with an undefined, or null, value into the CHU. The value string of the keyword is left blank in this case. \end{description} \begin{verbatim} FTPKYU(unit,keyword,comment, > status) \end{verbatim} \begin{description} \item[8 ] Put (append) a numbered sequence of keywords into the CHU. One may append the same comment to every keyword (and eliminate the need to have an array of identical comment strings, one for each keyword) by including the ampersand character as the last non-blank character in the (first) COMMENTS string parameter. This same string will then be used for the comment field in all the keywords. (Note that the SPP version of these routines only supports a single comment string). \end{description} \begin{verbatim} FTPKN[JKLS](unit,keyroot,startno,no_keys,keyvals,comments, > status) FTPKN[EDFG](unit,keyroot,startno,no_keys,keyvals,decimals,comments, > status) \end{verbatim} \begin{description} \item[9 ]Copy an indexed keyword from one HDU to another, modifying the index number of the keyword name in the process. For example, this routine could read the TLMIN3 keyword from the input HDU (by giving keyroot = "TLMIN" and innum = 3) and write it to the output HDU with the keyword name TLMIN4 (by setting outnum = 4). If the input keyword does not exist, then this routine simply returns without indicating an error. \end{description} \begin{verbatim} FTCPKY(inunit, outunit, innum, outnum, keyroot, > status) \end{verbatim} \begin{description} \item[10] Put (append) a 'triple precision' keyword into the CHU in F28.16 format. The floating point keyword value is constructed by concatenating the input integer value with the input double precision fraction value (which must have a value between 0.0 and 1.0). The FTGKYT routine should be used to read this keyword value, because the other keyword reading subroutines will not preserve the full precision of the value. \end{description} \begin{verbatim} FTPKYT(unit,keyword,intval,dblval,comment, > status) \end{verbatim} \begin{description} \item[11] Write keywords to the CHDU that are defined in an ASCII template file. The format of the template file is described under the ftgthd routine below. \end{description} \begin{verbatim} FTPKTP(unit, filename, > status) \end{verbatim} \begin{description} \item[12] Append the physical units string to an existing keyword. This routine uses a local convention, shown in the following example, in which the keyword units are enclosed in square brackets in the beginning of the keyword comment field. \end{description} \begin{verbatim} VELOCITY= 12.3 / [km/s] orbital speed FTPUNT(unit,keyword,units, > status) \end{verbatim} \subsection{Insert Keyword Subroutines \label{FTIREC}} \begin{description} \item[1 ] Insert a new keyword record into the CHU at the specified position (i.e., immediately preceding the (keyno)th keyword in the header.) This 'insert record' subroutine is somewhat less efficient then the 'append record' subroutine (FTPREC) described above because the remaining keywords in the header have to be shifted down one slot. \end{description} \begin{verbatim} FTIREC(unit,key_no,card, > status) \end{verbatim} \begin{description} \item[2 ] Insert a new keyword into the CHU. The new keyword is inserted immediately following the last keyword that has been read from the header. The FTIKLS subroutine works the same as the FTIKYS subroutine, except it also supports long string values greater than 68 characters in length. These 'insert keyword' subroutines are somewhat less efficient then the 'append keyword' subroutines described above because the remaining keywords in the header have to be shifted down one slot. \end{description} \begin{verbatim} FTIKEY(unit, card, > status) FTIKY[JKLS](unit,keyword,keyval,comment, > status) FTIKLS(unit,keyword,keyval,comment, > status) FTIKY[EDFG](unit,keyword,keyval,decimals,comment, > status) \end{verbatim} \begin{description} \item[3 ] Insert a new keyword with an undefined, or null, value into the CHU. The value string of the keyword is left blank in this case. \end{description} \begin{verbatim} FTIKYU(unit,keyword,comment, > status) \end{verbatim} \subsection{Read Keyword Subroutines \label{FTGREC}} These routines return the value of the specified keyword(s). Wild card characters (*, ?, or \#) may be used when specifying the name of the keyword to be read: a '?' will match any single character at that position in the keyword name and a '*' will match any length (including zero) string of characters. The '\#' character will match any consecutive string of decimal digits (0 - 9). Note that when a wild card is used in the input keyword name, the routine will only search for a match from the current header position to the end of the header. It will not resume the search from the top of the header back to the original header position as is done when no wildcards are included in the keyword name. If the desired keyword string is 8-characters long (the maximum length of a keyword name) then a '*' may be appended as the ninth character of the input name to force the keyword search to stop at the end of the header (e.g., 'COMMENT *' will search for the next COMMENT keyword). The ffgrec routine may be used to set the starting position when doing wild card searches. \begin{description} \item[1 ]Get the nth 80-character header record from the CHU. The first keyword in the header is at key\_no = 1; if key\_no = 0 then this subroutine simple moves the internal pointer to the beginning of the header so that subsequent keyword operations will start at the top of the header; it also returns a blank card value in this case. \end{description} \begin{verbatim} FTGREC(unit,key_no, > card,status) \end{verbatim} \begin{description} \item[2 ] Get the name, value (as a string), and comment of the nth keyword in CHU. This routine also checks that the returned keyword name (KEYWORD) contains only legal ASCII characters. Call FTGREC and FTPSVC to bypass this error check. \end{description} \begin{verbatim} FTGKYN(unit,key_no, > keyword,value,comment,status) \end{verbatim} \begin{description} \item[3 ] Get the 80-character header record for the named keyword \end{description} \begin{verbatim} FTGCRD(unit,keyword, > card,status) \end{verbatim} \begin{description} \item[4 ] Get the next keyword whose name matches one of the strings in 'inclist' but does not match any of the strings in 'exclist'. The strings in inclist and exclist may contain wild card characters (*, ?, and \#) as described at the beginning of this section. This routine searches from the current header position to the end of the header, only, and does not continue the search from the top of the header back to the original position. The current header position may be reset with the ftgrec routine. Note that nexc may be set = 0 if there are no keywords to be excluded. This routine returns status = 202 if a matching keyword is not found. \end{description} \begin{verbatim} FTGNXK(unit,inclist,ninc,exclist,nexc, > card,status) \end{verbatim} \begin{description} \item[5 ] Get the literal keyword value as a character string. Regardless of the datatype of the keyword, this routine simply returns the string of characters in the value field of the keyword along with the comment field. \end{description} \begin{verbatim} FTGKEY(unit,keyword, > value,comment,status) \end{verbatim} \begin{description} \item[6 ] Get a keyword value (with the appropriate datatype) and comment from the CHU \end{description} \begin{verbatim} FTGKY[EDJKLS](unit,keyword, > keyval,comment,status) \end{verbatim} \begin{description} \item[7 ] Read a string-valued keyword and return the string length, the value string, and/or the comment field. The first routine, FTGKSL, simply returns the length of the character string value of the specified keyword. The second routine, FTGSKY, also returns up to maxchar characters of the keyword value string, starting with the firstchar character, and the keyword comment string. The length argument returns the total length of the keyword value string regardless of how much of the string is actually returned (which depends on the value of the firstchar and maxchar arguments). These routines support string keywords that use the CONTINUE convention to continue long string values over multiple FITS header records. Normally, string-valued keywords have a maximum length of 68 characters, however, CONTINUE'd string keywords may be arbitrarily long. \end{description} \begin{verbatim} FTGKSL(unit,keyword, > length,status) FTGSKY(unit,keyword,firstchar,maxchar,> keyval,length,comment,status) \end{verbatim} \begin{description} \item[8 ] Get a sequence of numbered keyword values. These routines do not support wild card characters in the root name. \end{description} \begin{verbatim} FTGKN[EDJKLS](unit,keyroot,startno,max_keys, > keyvals,nfound,status) \end{verbatim} \begin{description} \item[9 ] Get the value of a floating point keyword, returning the integer and fractional parts of the value in separate subroutine arguments. This subroutine may be used to read any keyword but is especially useful for reading the 'triple precision' keywords written by FTPKYT. \end{description} \begin{verbatim} FTGKYT(unit,keyword, > intval,dblval,comment,status) \end{verbatim} \begin{description} \item[10] Get the physical units string in an existing keyword. This routine uses a local convention, shown in the following example, in which the keyword units are enclosed in square brackets in the beginning of the keyword comment field. A blank string is returned if no units are defined for the keyword. \end{description} \begin{verbatim} VELOCITY= 12.3 / [km/s] orbital speed FTGUNT(unit,keyword, > units,status) \end{verbatim} \subsection{Modify Keyword Subroutines \label{FTMREC}} Wild card characters, as described in the Read Keyword section, above, may be used when specifying the name of the keyword to be modified. \begin{description} \item[1 ] Modify (overwrite) the nth 80-character header record in the CHU \end{description} \begin{verbatim} FTMREC(unit,key_no,card, > status) \end{verbatim} \begin{description} \item[2 ] Modify (overwrite) the 80-character header record for the named keyword in the CHU. This can be used to overwrite the name of the keyword as well as its value and comment fields. \end{description} \begin{verbatim} FTMCRD(unit,keyword,card, > status) \end{verbatim} \begin{description} \item[3 ] Modify (overwrite) the name of an existing keyword in the CHU preserving the current value and comment fields. \end{description} \begin{verbatim} FTMNAM(unit,oldkey,keyword, > status) \end{verbatim} \begin{description} \item[4 ] Modify (overwrite) the comment field of an existing keyword in the CHU \end{description} \begin{verbatim} FTMCOM(unit,keyword,comment, > status) \end{verbatim} \begin{description} \item[5 ] Modify the value and comment fields of an existing keyword in the CHU. The FTMKLS subroutine works the same as the FTMKYS subroutine, except it also supports long string values greater than 68 characters in length. Optionally, one may modify only the value field and leave the comment field unchanged by setting the input COMMENT parameter equal to the ampersand character (\&). The E and D versions of this routine have the added feature that if the 'decimals' parameter is negative, then the 'G' display format rather then the 'E' format will be used when constructing the keyword value, taking the absolute value of 'decimals' for the precision. This will suppress trailing zeros, and will use a fixed format rather than an exponential format, depending on the magnitude of the value. \end{description} \begin{verbatim} FTMKY[JKLS](unit,keyword,keyval,comment, > status) FTMKLS(unit,keyword,keyval,comment, > status) FTMKY[EDFG](unit,keyword,keyval,decimals,comment, > status) \end{verbatim} \begin{description} \item[6 ] Modify the value of an existing keyword to be undefined, or null. The value string of the keyword is set to blank. Optionally, one may leave the comment field unchanged by setting the input COMMENT parameter equal to the ampersand character (\&). \end{description} \begin{verbatim} FTMKYU(unit,keyword,comment, > status) \end{verbatim} \subsection{Update Keyword Subroutines \label{FTUCRD}} \begin{description} \item[1 ] Update an 80-character record in the CHU. If the specified keyword already exists then that header record will be replaced with the input CARD string. If it does not exist then the new record will be added to the header. The FTUKLS subroutine works the same as the FTUKYS subroutine, except it also supports long string values greater than 68 characters in length. \end{description} \begin{verbatim} FTUCRD(unit,keyword,card, > status) \end{verbatim} \begin{description} \item[2 ] Update the value and comment fields of a keyword in the CHU. The specified keyword is modified if it already exists (by calling FTMKYx) otherwise a new keyword is created by calling FTPKYx. The E and D versions of this routine have the added feature that if the 'decimals' parameter is negative, then the 'G' display format rather then the 'E' format will be used when constructing the keyword value, taking the absolute value of 'decimals' for the precision. This will suppress trailing zeros, and will use a fixed format rather than an exponential format, depending on the magnitude of the value. \end{description} \begin{verbatim} FTUKY[JKLS](unit,keyword,keyval,comment, > status) FTUKLS(unit,keyword,keyval,comment, > status) FTUKY[EDFG](unit,keyword,keyval,decimals,comment, > status) \end{verbatim} \begin{description} \item[3 ] Update the value of an existing keyword to be undefined, or null, or insert a new undefined-value keyword if it doesn't already exist. The value string of the keyword is left blank in this case. \end{description} \begin{verbatim} FTUKYU(unit,keyword,comment, > status) \end{verbatim} \subsection{Delete Keyword Subroutines \label{FTDREC}} \begin{description} \item[1 ] Delete an existing keyword record. The space previously occupied by the keyword is reclaimed by moving all the following header records up one row in the header. The first routine deletes a keyword at a specified position in the header (the first keyword is at position 1), whereas the second routine deletes a specifically named keyword. Wild card characters, as described in the Read Keyword section, above, may be used when specifying the name of the keyword to be deleted (be careful!). \end{description} \begin{verbatim} FTDREC(unit,key_no, > status) FTDKEY(unit,keyword, > status) \end{verbatim} \section{Data Scaling and Undefined Pixel Parameters \label{FTPSCL}} These subroutines define or modify the internal parameters used by FITSIO to either scale the data or to represent undefined pixels. Generally FITSIO will scale the data according to the values of the BSCALE and BZERO (or TSCALn and TZEROn) keywords, however these subroutines may be used to override the keyword values. This may be useful when one wants to read or write the raw unscaled values in the FITS file. Similarly, FITSIO generally uses the value of the BLANK or TNULLn keyword to signify an undefined pixel, but these routines may be used to override this value. These subroutines do not create or modify the corresponding header keyword values. \begin{description} \item[1 ] Reset the scaling factors in the primary array or image extension; does not change the BSCALE and BZERO keyword values and only affects the automatic scaling performed when the data elements are written/read to/from the FITS file. When reading from a FITS file the returned data value = (the value given in the FITS array) * BSCALE + BZERO. The inverse formula is used when writing data values to the FITS file. (NOTE: BSCALE and BZERO must be declared as Double Precision variables). \end{description} \begin{verbatim} FTPSCL(unit,bscale,bzero, > status) \end{verbatim} \begin{description} \item[2 ] Reset the scaling parameters for a table column; does not change the TSCALn or TZEROn keyword values and only affects the automatic scaling performed when the data elements are written/read to/from the FITS file. When reading from a FITS file the returned data value = (the value given in the FITS array) * TSCAL + TZERO. The inverse formula is used when writing data values to the FITS file. (NOTE: TSCAL and TZERO must be declared as Double Precision variables). \end{description} \begin{verbatim} FTTSCL(unit,colnum,tscal,tzero, > status) \end{verbatim} \begin{description} \item[3 ] Define the integer value to be used to signify undefined pixels in the primary array or image extension. This is only used if BITPIX = 8, 16, 32. or 64 This does not create or change the value of the BLANK keyword in the header. FTPNULLL is identical to FTPNUL except that the blank value is a 64-bit integer instead of a 32-bit integer. \end{description} \begin{verbatim} FTPNUL(unit,blank, > status) FTPNULLL(unit,blankll, > status) \end{verbatim} \begin{description} \item[4 ] Define the string to be used to signify undefined pixels in a column in an ASCII table. This does not create or change the value of the TNULLn keyword. \end{description} \begin{verbatim} FTSNUL(unit,colnum,snull > status) \end{verbatim} \begin{description} \item[5 ] Define the value to be used to signify undefined pixels in an integer column in a binary table (where TFORMn = 'B', 'I', 'J', or 'K'). This does not create or change the value of the TNULLn keyword. FTTNULLL is identical to FTTNUL except that the tnull value is a 64-bit integer instead of a 32-bit integer. \end{description} \begin{verbatim} FTTNUL(unit,colnum,tnull > status) FTTNULLL(unit,colnum,tnullll > status) \end{verbatim} \section{FITS Primary Array or IMAGE Extension I/O Subroutines \label{FTPPR}} These subroutines put or get data values in the primary data array (i.e., the first HDU in the FITS file) or an IMAGE extension. The data array is represented as a single one-dimensional array of pixels regardless of the actual dimensionality of the array, and the FPIXEL parameter gives the position within this 1-D array of the first pixel to read or write. Automatic data type conversion is performed for numeric data (except for complex data types) if the data type of the primary array (defined by the BITPIX keyword) differs from the data type of the array in the calling subroutine. The data values are also scaled by the BSCALE and BZERO header values as they are being written or read from the FITS array. The ftpscl subroutine MUST be called to define the scaling parameters when writing data to the FITS array or to override the default scaling value given in the header when reading the FITS array. Two sets of subroutines are provided to read the data array which differ in the way undefined pixels are handled. The first set of routines (FTGPVx) simply return an array of data elements in which undefined pixels are set equal to a value specified by the user in the 'nullval' parameter. An additional feature of these subroutines is that if the user sets nullval = 0, then no checks for undefined pixels will be performed, thus increasing the speed of the program. The second set of routines (FTGPFx) returns the data element array and, in addition, a logical array which defines whether the corresponding data pixel is undefined. The latter set of subroutines may be more convenient to use in some circumstances, however, it requires an additional array of logical values which can be unwieldy when working with large data arrays. Also for programmer convenience, sets of subroutines to directly read or write 2 and 3 dimensional arrays have been provided, as well as a set of subroutines to read or write any contiguous rectangular subset of pixels within the n-dimensional array. \begin{description} \item[1 ] Get the data type of the image (= BITPIX value). Possible returned values are: 8, 16, 32, 64, -32, or -64 corresponding to unsigned byte, signed 2-byte integer, signed 4-byte integer, signed 8-byte integer, real, and double. The second subroutine is similar to FTGIDT, except that if the image pixel values are scaled, with non-default values for the BZERO and BSCALE keywords, then this routine will return the 'equivalent' data type that is needed to store the scaled values. For example, if BITPIX = 16 and BSCALE = 0.1 then the equivalent data type is floating point, and -32 will be returned. There are 2 special cases: if the image contains unsigned 2-byte integer values, with BITPIX = 16, BSCALE = 1, and BZERO = 32768, then this routine will return a non-standard value of 20 for the bitpix value. Similarly if the image contains unsigned 4-byte integers, then bitpix will be returned with a value of 40. \end{description} \begin{verbatim} FTGIDT(unit, > bitpix,status) FTGIET(unit, > bitpix,status) \end{verbatim} \begin{description} \item[2 ] Get the dimension (number of axes = NAXIS) of the image \end{description} \begin{verbatim} FTGIDM(unit, > naxis,status) \end{verbatim} \begin{description} \item[3 ] Get the size of all the dimensions of the image. The FTGISZLL routine returns an array of 64-bit integers instead of 32-bit integers. \end{description} \begin{verbatim} FTGISZ(unit, maxdim, > naxes,status) FTGISZLL(unit, maxdim, > naxesll,status) \end{verbatim} \begin{description} \item[4 ] Get the parameters that define the type and size of the image. This routine simply combines calls to the above 3 routines. The FTGIPRLL routine returns an array of 64-bit integers instead of 32-bit integers. \end{description} \begin{verbatim} FTGIPR(unit, maxdim, > bitpix, naxis, naxes, int *status) FTGIPRLL(unit, maxdim, > bitpix, naxis, naxesll, int *status) \end{verbatim} \begin{description} \item[5 ]Put elements into the data array \end{description} \begin{verbatim} FTPPR[BIJKED](unit,group,fpixel,nelements,values, > status) \end{verbatim} \begin{description} \item[6 ]Put elements into the data array, substituting the appropriate FITS null value for all elements which are equal to the value of NULLVAL. For integer FITS arrays, the null value defined by the previous call to FTPNUL will be substituted; for floating point FITS arrays (BITPIX = -32 or -64) then the special IEEE NaN (Not-a-Number) value will be substituted. \end{description} \begin{verbatim} FTPPN[BIJKED](unit,group,fpixel,nelements,values,nullval > status) \end{verbatim} \begin{description} \item[7 ]Set data array elements as undefined \end{description} \begin{verbatim} FTPPRU(unit,group,fpixel,nelements, > status) \end{verbatim} \begin{description} \item[8 ] Get elements from the data array. Undefined array elements will be returned with a value = nullval, unless nullval = 0 in which case no checks for undefined pixels will be performed. \end{description} \begin{verbatim} FTGPV[BIJKED](unit,group,fpixel,nelements,nullval, > values,anyf,status) \end{verbatim} \begin{description} \item[9 ] Get elements and nullflags from data array. Any undefined array elements will have the corresponding flagvals element set equal to .TRUE. \end{description} \begin{verbatim} FTGPF[BIJKED](unit,group,fpixel,nelements, > values,flagvals,anyf,status) \end{verbatim} \begin{description} \item[10] Put values into group parameters \end{description} \begin{verbatim} FTPGP[BIJKED](unit,group,fparm,nparm,values, > status) \end{verbatim} \begin{description} \item[11] Get values from group parameters \end{description} \begin{verbatim} FTGGP[BIJKED](unit,group,fparm,nparm, > values,status) \end{verbatim} The following 4 subroutines transfer FITS images with 2 or 3 dimensions to or from a data array which has been declared in the calling program. The dimensionality of the FITS image is passed by the naxis1, naxis2, and naxis3 parameters and the declared dimensions of the program array are passed in the dim1 and dim2 parameters. Note that the program array does not have to have the same dimensions as the FITS array, but must be at least as big. For example if a FITS image with NAXIS1 = NAXIS2 = 400 is read into a program array which is dimensioned as 512 x 512 pixels, then the image will just fill the lower left corner of the array with pixels in the range 1 - 400 in the X an Y directions. This has the effect of taking a contiguous set of pixel value in the FITS array and writing them to a non-contiguous array in program memory (i.e., there are now some blank pixels around the edge of the image in the program array). \begin{description} \item[11] Put 2-D image into the data array \end{description} \begin{verbatim} FTP2D[BIJKED](unit,group,dim1,naxis1,naxis2,image, > status) \end{verbatim} \begin{description} \item[12] Put 3-D cube into the data array \end{description} \begin{verbatim} FTP3D[BIJKED](unit,group,dim1,dim2,naxis1,naxis2,naxis3,cube, > status) \end{verbatim} \begin{description} \item[13] Get 2-D image from the data array. Undefined pixels in the array will be set equal to the value of 'nullval', unless nullval=0 in which case no testing for undefined pixels will be performed. \end{description} \begin{verbatim} FTG2D[BIJKED](unit,group,nullval,dim1,naxis1,naxis2, > image,anyf,status) \end{verbatim} \begin{description} \item[14] Get 3-D cube from the data array. Undefined pixels in the array will be set equal to the value of 'nullval', unless nullval=0 in which case no testing for undefined pixels will be performed. \end{description} \begin{verbatim} FTG3D[BIJKED](unit,group,nullval,dim1,dim2,naxis1,naxis2,naxis3, > cube,anyf,status) \end{verbatim} The following subroutines transfer a rectangular subset of the pixels in a FITS N-dimensional image to or from an array which has been declared in the calling program. The fpixels and lpixels parameters are integer arrays which specify the starting and ending pixels in each dimension of the FITS image that are to be read or written. (Note that these are the starting and ending pixels in the FITS image, not in the declared array). The array parameter is treated simply as a large one-dimensional array of the appropriate datatype containing the pixel values; The pixel values in the FITS array are read/written from/to this program array in strict sequence without any gaps; it is up to the calling routine to correctly interpret the dimensionality of this array. The two families of FITS reading routines (FTGSVx and FTGSFx subroutines) also have an 'incs' parameter which defines the data sampling interval in each dimension of the FITS array. For example, if incs(1)=2 and incs(2)=3 when reading a 2-dimensional FITS image, then only every other pixel in the first dimension and every 3rd pixel in the second dimension will be returned in the 'array' parameter. [Note: the FTGSSx family of routines which were present in previous versions of FITSIO have been superseded by the more general FTGSVx family of routines.] \begin{description} \item[15] Put an arbitrary data subsection into the data array. \end{description} \begin{verbatim} FTPSS[BIJKED](unit,group,naxis,naxes,fpixels,lpixels,array, > status) \end{verbatim} \begin{description} \item[16] Get an arbitrary data subsection from the data array. Undefined pixels in the array will be set equal to the value of 'nullval', unless nullval=0 in which case no testing for undefined pixels will be performed. \end{description} \begin{verbatim} FTGSV[BIJKED](unit,group,naxis,naxes,fpixels,lpixels,incs,nullval, > array,anyf,status) \end{verbatim} \begin{description} \item[17] Get an arbitrary data subsection from the data array. Any Undefined pixels in the array will have the corresponding 'flagvals' element set equal to .TRUE. \end{description} \begin{verbatim} FTGSF[BIJKED](unit,group,naxis,naxes,fpixels,lpixels,incs, > array,flagvals,anyf,status) \end{verbatim} \section{FITS ASCII and Binary Table Data I/O Subroutines} \subsection{Column Information Subroutines \label{FTGCNO}} \begin{description} \item[1 ] Get the number of rows or columns in the current FITS table. The number of rows is given by the NAXIS2 keyword and the number of columns is given by the TFIELDS keyword in the header of the table. The FTGNRWLL routine is identical to FTGNRW except that the number of rows is returned as a 64-bit integer rather than a 32-bit integer. \end{description} \begin{verbatim} FTGNRW(unit, > nrows, status) FTGNRWLL(unit, > nrowsll, status) FTGNCL(unit, > ncols, status) \end{verbatim} \begin{description} \item[2 ] Get the table column number (and name) of the column whose name matches an input template name. The table column names are defined by the TTYPEn keywords in the FITS header. If a column does not have a TTYPEn keyword, then these routines assume that the name consists of all blank characters. These 2 subroutines perform the same function except that FTGCNO only returns the number of the matching column whereas FTGCNN also returns the name of the column. If CASESEN = .true. then the column name match will be case-sensitive. The input column name template (COLTEMPLATE) is (1) either the exact name of the column to be searched for, or (2) it may contain wild cards characters (*, ?, or \#), or (3) it may contain the number of the desired column (where the number is expressed as ASCII digits). The first 2 wild cards behave similarly to UNIX filename matching: the '*' character matches any sequence of characters (including zero characters) and the '?' character matches any single character. The \# wildcard will match any consecutive string of decimal digits (0-9). As an example, the template strings 'AB?DE', 'AB*E', and 'AB*CDE' will all match the string 'ABCDE'. If more than one column name in the table matches the template string, then the first match is returned and the status value will be set to 237 as a warning that a unique match was not found. To find the other cases that match the template, simply call the subroutine again leaving the input status value equal to 237 and the next matching name will then be returned. Repeat this process until a status = 219 (column name not found) is returned. If these subroutines fail to match the template to any of the columns in the table, they lastly check if the template can be interpreted as a simple positive integer (e.g., '7', or '512') and if so, they return that column number. If no matches are found then a status = 219 error is returned. Note that the FITS Standard recommends that only letters, digits, and the underscore character be used in column names (with no embedded spaces in the name). Trailing blank characters are not significant. \end{description} \begin{verbatim} FTGCNO(unit,casesen,coltemplate, > colnum,status) FTGCNN(unit,casesen,coltemplate, > colname,colnum,status) \end{verbatim} \begin{description} \item[3 ] Get the datatype of a column in an ASCII or binary table. This routine returns an integer code value corresponding to the datatype of the column. (See the FTBNFM and FTASFM subroutines in the Utilities section of this document for a list of the code values). The vector repeat count (which is alway 1 for ASCII table columns) is also returned. If the specified column has an ASCII character datatype (code = 16) then the width of a unit string in the column is also returned. Note that this routine supports the local convention for specifying arrays of strings within a binary table character column, using the syntax TFORM = 'rAw' where 'r' is the total number of characters (= the width of the column) and 'w' is the width of a unit string within the column. Thus if the column has TFORM = '60A12' then this routine will return datacode = 16, repeat = 60, and width = 12. (The TDIMn keyword may also be used to specify the unit string length; The pair of keywords TFORMn = '60A' and TDIMn = '(12,5)' would have the same effect as TFORMn = '60A12'). The second routine, FTEQTY is similar except that in the case of scaled integer columns it returns the 'equivalent' data type that is needed to store the scaled values, and not necessarily the physical data type of the unscaled values as stored in the FITS table. For example if a '1I' column in a binary table has TSCALn = 1 and TZEROn = 32768, then this column effectively contains unsigned short integer values, and thus the returned value of typecode will be the code for an unsigned short integer, not a signed short integer. Similarly, if a column has TTYPEn = '1I' and TSCALn = 0.12, then the returned typecode will be the code for a 'real' column. \end{description} \begin{verbatim} FTGTCL(unit,colnum, > datacode,repeat,width,status) FTEQTY(unit,colnum, > datacode,repeat,width,status) \end{verbatim} \begin{description} \item[4 ] Return the display width of a column. This is the length of the string that will be returned when reading the column as a formatted string. The display width is determined by the TDISPn keyword, if present, otherwise by the data type of the column. \end{description} \begin{verbatim} FTGCDW(unit, colnum, > dispwidth, status) \end{verbatim} \begin{description} \item[5 ] Get information about an existing ASCII table column. (NOTE: TSCAL and TZERO must be declared as Double Precision variables). All the returned parameters are scalar quantities. \end{description} \begin{verbatim} FTGACL(unit,colnum, > ttype,tbcol,tunit,tform,tscal,tzero,snull,tdisp,status) \end{verbatim} \begin{description} \item[6 ] Get information about an existing binary table column. (NOTE: TSCAL and TZERO must be declared as Double Precision variables). DATATYPE is a character string which returns the datatype of the column as defined by the TFORMn keyword (e.g., 'I', 'J','E', 'D', etc.). In the case of an ASCII character column, DATATYPE will have a value of the form 'An' where 'n' is an integer expressing the width of the field in characters. For example, if TFORM = '160A8' then FTGBCL will return DATATYPE='A8' and REPEAT=20. All the returned parameters are scalar quantities. \end{description} \begin{verbatim} FTGBCL(unit,colnum, > ttype,tunit,datatype,repeat,tscal,tzero,tnull,tdisp,status) \end{verbatim} \begin{description} \item[7 ] Put (append) a TDIMn keyword whose value has the form '(l,m,n...)' where l, m, n... are the dimensions of a multidimensional array column in a binary table. \end{description} \begin{verbatim} FTPTDM(unit,colnum,naxis,naxes, > status) \end{verbatim} \begin{description} \item[8 ] Return the number of and size of the dimensions of a table column. Normally this information is given by the TDIMn keyword, but if this keyword is not present then this routine returns NAXIS = 1 and NAXES(1) equal to the repeat count in the TFORM keyword. \end{description} \begin{verbatim} FTGTDM(unit,colnum,maxdim, > naxis,naxes,status) \end{verbatim} \begin{description} \item[9 ] Decode the input TDIMn keyword string (e.g. '(100,200)') and return the number of and size of the dimensions of a binary table column. If the input tdimstr character string is null, then this routine returns naxis = 1 and naxes[0] equal to the repeat count in the TFORM keyword. This routine is called by FTGTDM. \end{description} \begin{verbatim} FTDTDM(unit,tdimstr,colnum,maxdim, > naxis,naxes, status) \end{verbatim} \begin{description} \item[10] Return the optimal number of rows to read or write at one time for maximum I/O efficiency. Refer to the ``Optimizing Code'' section in Chapter 5 for more discussion on how to use this routine. \end{description} \begin{verbatim} FTGRSZ(unit, > nrows,status) \end{verbatim} \subsection{Low-Level Table Access Subroutines \label{FTGTBS}} The following subroutines provide low-level access to the data in ASCII or binary tables and are mainly useful as an efficient way to copy all or part of a table from one location to another. These routines simply read or write the specified number of consecutive bytes in an ASCII or binary table, without regard for column boundaries or the row length in the table. The first two subroutines read or write consecutive bytes in a table to or from a character string variable, while the last two subroutines read or write consecutive bytes to or from a variable declared as a numeric data type (e.g., INTEGER, INTEGER*2, REAL, DOUBLE PRECISION). These routines do not perform any machine dependent data conversion or byte swapping, except that conversion to/from ASCII format is performed by the FTGTBS and FTPTBS routines on machines which do not use ASCII character codes in the internal data representations (e.g., on IBM mainframe computers). \begin{description} \item[1 ] Read a consecutive string of characters from an ASCII table into a character variable (spanning columns and multiple rows if necessary) This routine should not be used with binary tables because of complications related to passing string variables between C and Fortran. \end{description} \begin{verbatim} FTGTBS(unit,frow,startchar,nchars, > string,status) \end{verbatim} \begin{description} \item[2 ] Write a consecutive string of characters to an ASCII table from a character variable (spanning columns and multiple rows if necessary) This routine should not be used with binary tables because of complications related to passing string variables between C and Fortran. \end{description} \begin{verbatim} FTPTBS(unit,frow,startchar,nchars,string, > status) \end{verbatim} \begin{description} \item[3 ] Read a consecutive array of bytes from an ASCII or binary table into a numeric variable (spanning columns and multiple rows if necessary). The array parameter may be declared as any numerical datatype as long as the array is at least 'nchars' bytes long, e.g., if nchars = 17, then declare the array as INTEGER*4 ARRAY(5). \end{description} \begin{verbatim} FTGTBB(unit,frow,startchar,nchars, > array,status) \end{verbatim} \begin{description} \item[4 ] Write a consecutive array of bytes to an ASCII or binary table from a numeric variable (spanning columns and multiple rows if necessary) The array parameter may be declared as any numerical datatype as long as the array is at least 'nchars' bytes long, e.g., if nchars = 17, then declare the array as INTEGER*4 ARRAY(5). \end{description} \begin{verbatim} FTPTBB(unit,frow,startchar,nchars,array, > status) \end{verbatim} \subsection{Edit Rows or Columns \label{FTIROW}} \begin{description} \item[1 ] Insert blank rows into an existing ASCII or binary table (in the CDU). All the rows FOLLOWING row FROW are shifted down by NROWS rows. If FROW or FROWLL equals 0 then the blank rows are inserted at the beginning of the table. These routines modify the NAXIS2 keyword to reflect the new number of rows in the table. Note that it is *not* necessary to insert rows in a table before writing data to those rows (indeed, it would be inefficient to do so). Instead, one may simply write data to any row of the table, whether that row of data already exists or not. \end{description} \begin{verbatim} FTIROW(unit,frow,nrows, > status) FTIROWLL(unit,frowll,nrowsll, > status) \end{verbatim} \begin{description} \item[2 ] Delete rows from an existing ASCII or binary table (in the CDU). The NROWS (or NROWSLL) is the number of rows are deleted, starting with row FROW (or FROWLL), and any remaining rows in the table are shifted up to fill in the space. These routines modify the NAXIS2 keyword to reflect the new number of rows in the table. \end{description} \begin{verbatim} FTDROW(unit,frow,nrows, > status) FTDROWLL(unit,frowll,nrowsll, > status) \end{verbatim} \begin{description} \item[3 ] Delete a list of rows from an ASCII or binary table (in the CDU). In the first routine, 'rowrange' is a character string listing the rows or row ranges to delete (e.g., '2-4, 5, 8-9'). In the second routine, 'rowlist' is an integer array of row numbers to be deleted from the table. nrows is the number of row numbers in the list. The first row in the table is 1 not 0. The list of row numbers must be sorted in ascending order. \end{description} \begin{verbatim} FTDRRG(unit,rowrange, > status) FTDRWS(unit,rowlist,nrows, > status) \end{verbatim} \begin{description} \item[4 ] Insert a blank column (or columns) into an existing ASCII or binary table (in the CDU). COLNUM specifies the column number that the (first) new column should occupy in the table. NCOLS specifies how many columns are to be inserted. Any existing columns from this position and higher are moved over to allow room for the new column(s). The index number on all the following keywords will be incremented if necessary to reflect the new position of the column(s) in the table: TBCOLn, TFORMn, TTYPEn, TUNITn, TNULLn, TSCALn, TZEROn, TDISPn, TDIMn, TLMINn, TLMAXn, TDMINn, TDMAXn, TCTYPn, TCRPXn, TCRVLn, TCDLTn, TCROTn, and TCUNIn. \end{description} \begin{verbatim} FTICOL(unit,colnum,ttype,tform, > status) FTICLS(unit,colnum,ncols,ttype,tform, > status) \end{verbatim} \begin{description} \item[5 ] Modify the vector length of a binary table column (e.g., change a column from TFORMn = '1E' to '20E'). The vector length may be increased or decreased from the current value. \end{description} \begin{verbatim} FTMVEC(unit,colnum,newveclen, > status) \end{verbatim} \begin{description} \item[6 ] Delete a column from an existing ASCII or binary table (in the CDU). The index number of all the keywords listed above (for FTICOL) will be decremented if necessary to reflect the new position of the column(s) in the table. Those index keywords that refer to the deleted column will also be deleted. Note that the physical size of the FITS file will not be reduced by this operation, and the empty FITS blocks if any at the end of the file will be padded with zeros. \end{description} \begin{verbatim} FTDCOL(unit,colnum, > status) \end{verbatim} \begin{description} \item[7 ] Copy a column from one HDU to another (or to the same HDU). If createcol = TRUE, then a new column will be inserted in the output table, at position `outcolumn', otherwise the existing output column will be overwritten (in which case it must have a compatible datatype). Note that the first column in a table is at colnum = 1. \end{description} \begin{verbatim} FTCPCL(inunit,outunit,incolnum,outcolnum,createcol, > status); \end{verbatim} \subsection{Read and Write Column Data Routines \label{FTPCLS}} These subroutines put or get data values in the current ASCII or Binary table extension. Automatic data type conversion is performed for numerical data types (B,I,J,E,D) if the data type of the column (defined by the TFORM keyword) differs from the data type of the calling subroutine. The data values are also scaled by the TSCALn and TZEROn header values as they are being written to or read from the FITS array. The fttscl subroutine MUST be used to define the scaling parameters when writing data to the table or to override the default scaling values given in the header when reading from the table. Note that it is *not* necessary to insert rows in a table before writing data to those rows (indeed, it would be inefficient to do so). Instead, one may simply write data to any row of the table, whether that row of data already exists or not. In the case of binary tables with vector elements, the 'felem' parameter defines the starting pixel within the element vector. This parameter is ignored with ASCII tables. Similarly, in the case of binary tables the 'nelements' parameter specifies the total number of vector values read or written (continuing on subsequent rows if required) and not the number of table elements. Two sets of subroutines are provided to get the column data which differ in the way undefined pixels are handled. The first set of routines (FTGCV) simply return an array of data elements in which undefined pixels are set equal to a value specified by the user in the 'nullval' parameter. An additional feature of these subroutines is that if the user sets nullval = 0, then no checks for undefined pixels will be performed, thus increasing the speed of the program. The second set of routines (FTGCF) returns the data element array and in addition a logical array of flags which defines whether the corresponding data pixel is undefined. Any column, regardless of it's intrinsic datatype, may be read as a string. It should be noted however that reading a numeric column as a string is 10 - 100 times slower than reading the same column as a number due to the large overhead in constructing the formatted strings. The display format of the returned strings will be determined by the TDISPn keyword, if it exists, otherwise by the datatype of the column. The length of the returned strings can be determined with the ftgcdw routine. The following TDISPn display formats are currently supported: \begin{verbatim} Iw.m Integer Ow.m Octal integer Zw.m Hexadecimal integer Fw.d Fixed floating point Ew.d Exponential floating point Dw.d Exponential floating point Gw.d General; uses Fw.d if significance not lost, else Ew.d \end{verbatim} where w is the width in characters of the displayed values, m is the minimum number of digits displayed, and d is the number of digits to the right of the decimal. The .m field is optional. \begin{description} \item[1 ] Put elements into an ASCII or binary table column (in the CDU). (The SPP FSPCLS routine has an additional integer argument after the VALUES character string which specifies the size of the 1st dimension of this 2-D CHAR array). The alternate version of these routines, whose names end in 'LL' after the datatype character, support large tables with more then 2*31 rows. When calling these routines, the frow and felem parameters *must* be 64-bit integer*8 variables, instead of normal 4-byte integers. \end{description} \begin{verbatim} FTPCL[SLBIJKEDCM](unit,colnum,frow,felem,nelements,values, > status) FTPCL[LBIJKEDCM]LL(unit,colnum,frow,felem,nelements,values, > status) \end{verbatim} \begin{description} \item[2 ] Put elements into an ASCII or binary table column (in the CDU) substituting the appropriate FITS null value for any elements that are equal to NULLVAL. For ASCII TABLE extensions, the null value defined by the previous call to FTSNUL will be substituted; For integer FITS columns, in a binary table the null value defined by the previous call to FTTNUL will be substituted; For floating point FITS columns a special IEEE NaN (Not-a-Number) value will be substituted. The alternate version of these routines, whose names end in 'LL' after the datatype character, support large tables with more then 2*31 rows. When calling these routines, the frow and felem parameters *must* be 64-bit integer*8 variables, instead of normal 4-byte integers. \end{description} \begin{verbatim} FTPCN[SBIJKED](unit,colnum,frow,felem,nelements,values,nullval > status) FTPCN[SBIJKED]LL(unit,colnum,(I*8) frow,(I*8) felem,nelements,values, nullval > status) \end{verbatim} \begin{description} \item[3 ] Put bit values into a binary byte ('B') or bit ('X') table column (in the CDU). LRAY is an array of logical values corresponding to the sequence of bits to be written. If LRAY is true then the corresponding bit is set to 1, otherwise the bit is set to 0. Note that in the case of 'X' columns, FITSIO will write to all 8 bits of each byte whether they are formally valid or not. Thus if the column is defined as '4X', and one calls FTPCLX with fbit=1 and nbit=8, then all 8 bits will be written into the first byte (as opposed to writing the first 4 bits into the first row and then the next 4 bits into the next row), even though the last 4 bits of each byte are formally not defined. \end{description} \begin{verbatim} FTPCLX(unit,colnum,frow,fbit,nbit,lray, > status) \end{verbatim} \begin{description} \item[4 ] Set table elements in a column as undefined \end{description} \begin{verbatim} FTPCLU(unit,colnum,frow,felem,nelements, > status) \end{verbatim} \begin{description} \item[5 ] Get elements from an ASCII or binary table column (in the CDU). These routines return the values of the table column array elements. Undefined array elements will be returned with a value = nullval, unless nullval = 0 (or = ' ' for ftgcvs) in which case no checking for undefined values will be performed. The ANYF parameter is set to true if any of the returned elements are undefined. (Note: the ftgcl routine simple gets an array of logical data values without any checks for undefined values; use the ftgcfl routine to check for undefined logical elements). (The SPP FSGCVS routine has an additional integer argument after the VALUES character string which specifies the size of the 1st dimension of this 2-D CHAR array). The alternate version of these routines, whose names end in 'LL' after the datatype character, support large tables with more then 2*31 rows. When calling these routines, the frow and felem parameters *must* be 64-bit integer*8 variables, instead of normal 4-byte integers. \end{description} \begin{verbatim} FTGCL(unit,colnum,frow,felem,nelements, > values,status) FTGCV[SBIJKEDCM](unit,colnum,frow,felem,nelements,nullval, > values,anyf,status) FTGCV[BIJKEDCM]LL(unit,colnum,(I*8) frow, (I*8) felem, nelements, nullval, > values,anyf,status) \end{verbatim} \begin{description} \item[6 ] Get elements and null flags from an ASCII or binary table column (in the CHDU). These routines return the values of the table column array elements. Any undefined array elements will have the corresponding flagvals element set equal to .TRUE. The ANYF parameter is set to true if any of the returned elements are undefined. (The SPP FSGCFS routine has an additional integer argument after the VALUES character string which specifies the size of the 1st dimension of this 2-D CHAR array). The alternate version of these routines, whose names end in 'LL' after the datatype character, support large tables with more then 2*31 rows. When calling these routines, the frow and felem parameters *must* be 64-bit integer*8 variables, instead of normal 4-byte integers. \end{description} \begin{verbatim} FTGCF[SLBIJKEDCM](unit,colnum,frow,felem,nelements, > values,flagvals,anyf,status) FTGCF[BIJKED]LL(unit,colnum, (I*8) frow, (I*8) felem,nelements, > values,flagvals,anyf,status) \end{verbatim} \begin{description} \item[7 ] Get an arbitrary data subsection from an N-dimensional array in a binary table vector column. Undefined pixels in the array will be set equal to the value of 'nullval', unless nullval=0 in which case no testing for undefined pixels will be performed. The first and last rows in the table to be read are specified by fpixels(naxis+1) and lpixels(naxis+1), and hence are treated as the next higher dimension of the FITS N-dimensional array. The INCS parameter specifies the sampling interval in each dimension between the data elements that will be returned. \end{description} \begin{verbatim} FTGSV[BIJKED](unit,colnum,naxis,naxes,fpixels,lpixels,incs,nullval, > array,anyf,status) \end{verbatim} \begin{description} \item[8 ] Get an arbitrary data subsection from an N-dimensional array in a binary table vector column. Any Undefined pixels in the array will have the corresponding 'flagvals' element set equal to .TRUE. The first and last rows in the table to be read are specified by fpixels(naxis+1) and lpixels(naxis+1), and hence are treated as the next higher dimension of the FITS N-dimensional array. The INCS parameter specifies the sampling interval in each dimension between the data elements that will be returned. \end{description} \begin{verbatim} FTGSF[BIJKED](unit,colnum,naxis,naxes,fpixels,lpixels,incs, > array,flagvals,anyf,status) \end{verbatim} \begin{description} \item[9 ] Get bit values from a byte ('B') or bit (`X`) table column (in the CDU). LRAY is an array of logical values corresponding to the sequence of bits to be read. If LRAY is true then the corresponding bit was set to 1, otherwise the bit was set to 0. Note that in the case of 'X' columns, FITSIO will read all 8 bits of each byte whether they are formally valid or not. Thus if the column is defined as '4X', and one calls FTGCX with fbit=1 and nbit=8, then all 8 bits will be read from the first byte (as opposed to reading the first 4 bits from the first row and then the first 4 bits from the next row), even though the last 4 bits of each byte are formally not defined. \end{description} \begin{verbatim} FTGCX(unit,colnum,frow,fbit,nbit, > lray,status) \end{verbatim} \begin{description} \item[10] Read any consecutive set of bits from an 'X' or 'B' column and interpret them as an unsigned n-bit integer. NBIT must be less than or equal to 16 when calling FTGCXI, and less than or equal to 32 when calling FTGCXJ; there is no limit on the value of NBIT for FTGCXD, but the returned double precision value only has 48 bits of precision on most 32-bit word machines. The NBITS bits are interpreted as an unsigned integer unless NBITS = 16 (in FTGCXI) or 32 (in FTGCXJ) in which case the string of bits are interpreted as 16-bit or 32-bit 2's complement signed integers. If NROWS is greater than 1 then the same set of bits will be read from sequential rows in the table starting with row FROW. Note that the numbering convention used here for the FBIT parameter adopts 1 for the first element of the vector of bits; this is the Most Significant Bit of the integer value. \end{description} \begin{verbatim} FTGCX[IJD](unit,colnum,frow,nrows,fbit,nbit, > array,status) \end{verbatim} \begin{description} \item[11] Get the descriptor for a variable length column in a binary table. The descriptor consists of 2 integer parameters: the number of elements in the array and the starting offset relative to the start of the heap. The first routine returns a single descriptor whereas the second routine returns the descriptors for a range of rows in the table. \end{description} \begin{verbatim} FTGDES(unit,colnum,rownum, > nelements,offset,status) FTGDESLL(unit,colnum,rownum, > nelementsll,offsetll,status) FTGDESS(unit,colnum,firstrow,nrows > nelements,offset, status) FTGDESSLL(unit,colnum,firstrow,nrows > nelementsll,offsetll, status) \end{verbatim} \begin{description} \item[12] Write the descriptor for a variable length column in a binary table. These subroutines can be used in conjunction with FTGDES to enable 2 or more arrays to point to the same storage location to save storage space if the arrays are identical. \end{description} \begin{verbatim} FTPDES(unit,colnum,rownum,nelements,offset, > status) FTPDESLL(unit,colnum,rownum,nelementsll,offsetll, > status) \end{verbatim} \section{Row Selection and Calculator Routines \label{FTFROW}} These routines all parse and evaluate an input string containing a user defined arithmetic expression. The first 3 routines select rows in a FITS table, based on whether the expression evaluates to true (not equal to zero) or false (zero). The other routines evaluate the expression and calculate a value for each row of the table. The allowed expression syntax is described in the row filter section in the earlier `Extended File Name Syntax' chapter of this document. The expression may also be written to a text file, and the name of the file, prepended with a '@' character may be supplied for the 'expr' parameter (e.g. '@filename.txt'). The expression in the file can be arbitrarily complex and extend over multiple lines of the file. Lines that begin with 2 slash characters ('//') will be ignored and may be used to add comments to the file. \begin{description} \item[1 ] Evaluate a boolean expression over the indicated rows, returning an array of flags indicating which rows evaluated to TRUE/FALSE \end{description} \begin{verbatim} FTFROW(unit,expr,firstrow, nrows, > n_good_rows, row_status, status) \end{verbatim} \begin{description} \item[2 ] Find the first row which satisfies the input boolean expression \end{description} \begin{verbatim} FTFFRW(unit, expr, > rownum, status) \end{verbatim} \begin{description} \item[3 ]Evaluate an expression on all rows of a table. If the input and output files are not the same, copy the TRUE rows to the output file; if the output table is not empty, then this routine will append the new selected rows after the existing rows. If the files are the same, delete the FALSE rows (preserve the TRUE rows). \end{description} \begin{verbatim} FTSROW(inunit, outunit, expr, > status) \end{verbatim} \begin{description} \item[4 ] Calculate an expression for the indicated rows of a table, returning the results, cast as datatype (TSHORT, TDOUBLE, etc), in array. If nulval==NULL, UNDEFs will be zeroed out. For vector results, the number of elements returned may be less than nelements if nelements is not an even multiple of the result dimension. Call FTTEXP to obtain the dimensions of the results. \end{description} \begin{verbatim} FTCROW(unit,datatype,expr,firstrow,nelements,nulval, > array,anynul,status) \end{verbatim} \begin{description} \item[5 ]Evaluate an expression and write the result either to a column (if the expression is a function of other columns in the table) or to a keyword (if the expression evaluates to a constant and is not a function of other columns in the table). In the former case, the parName parameter is the name of the column (which may or may not already exist) into which to write the results, and parInfo contains an optional TFORM keyword value if a new column is being created. If a TFORM value is not specified then a default format will be used, depending on the expression. If the expression evaluates to a constant, then the result will be written to the keyword name given by the parName parameter, and the parInfo parameter may be used to supply an optional comment for the keyword. If the keyword does not already exist, then the name of the keyword must be preceded with a '\#' character, otherwise the result will be written to a column with that name. \end{description} \begin{verbatim} FTCALC(inunit, expr, outunit, parName, parInfo, > status) \end{verbatim} \begin{description} \item[6 ] This calculator routine is similar to the previous routine, except that the expression is only evaluated over the specified row ranges. nranges specifies the number of row ranges, and firstrow and lastrow give the starting and ending row number of each range. \end{description} \begin{verbatim} FTCALC_RNG(inunit, expr, outunit, parName, parInfo, nranges, firstrow, lastrow, > status) \end{verbatim} \begin{description} \item[7 ]Evaluate the given expression and return dimension and type information on the result. The returned dimensions correspond to a single row entry of the requested expression, and are equivalent to the result of fits\_read\_tdim(). Note that strings are considered to be one element regardless of string length. If maxdim == 0, then naxes is optional. \end{description} \begin{verbatim} FTTEXP(unit, expr, maxdim > datatype, nelem, naxis, naxes, status) \end{verbatim} \section{Celestial Coordinate System Subroutines \label{FTGICS}} The FITS community has adopted a set of keyword conventions that define the transformations needed to convert between pixel locations in an image and the corresponding celestial coordinates on the sky, or more generally, that define world coordinates that are to be associated with any pixel location in an n-dimensional FITS array. CFITSIO is distributed with a couple of self-contained World Coordinate System (WCS) routines, however, these routines DO NOT support all the latest WCS conventions, so it is STRONGLY RECOMMENDED that software developers use a more robust external WCS library. Several recommended libraries are: \begin{verbatim} WCSLIB - supported by Mark Calabretta WCSTools - supported by Doug Mink AST library - developed by the U.K. Starlink project \end{verbatim} More information about the WCS keyword conventions and links to all of these WCS libraries can be found on the FITS Support Office web site at http://fits.gsfc.nasa.gov under the WCS link. The functions provided in these external WCS libraries will need access to the WCS information contained in the FITS file headers. One convenient way to pass this information to the external library is to use FITSIO to copy the header keywords into one long character string, and then pass this string to an interface routine in the external library that will extract the necessary WCS information (e.g., see the astFitsChan and astPutCards routines in the Starlink AST library). The following FITSIO routines DO NOT support the more recent WCS conventions that have been approved as part of the FITS standard. Consequently, the following routines ARE NOW DEPRECATED. It is STRONGLY RECOMMENDED that software developers not use these routines, and instead use an external WCS library, as described above. These routines are included mainly for backward compatibility with existing software. They support the following standard map projections: -SIN, -TAN, -ARC, -NCP, -GLS, -MER, and -AIT (these are the legal values for the coordtype parameter). These routines are based on similar functions in Classic AIPS. All the angular quantities are given in units of degrees. \begin{description} \item[1 ] Get the values of all the standard FITS celestial coordinate system keywords from the header of a FITS image (i.e., the primary array or an image extension). These values may then be passed to the subroutines that perform the coordinate transformations. If any or all of the WCS keywords are not present, then default values will be returned. If the first coordinate axis is the declination-like coordinate, then this routine will swap them so that the longitudinal-like coordinate is returned as the first axis. If the file uses the newer 'CDj\_i' WCS transformation matrix keywords instead of old style 'CDELTn' and 'CROTA2' keywords, then this routine will calculate and return the values of the equivalent old-style keywords. Note that the conversion from the new-style keywords to the old-style values is sometimes only an approximation, so if the approximation is larger than an internally defined threshold level, then CFITSIO will still return the approximate WCS keyword values, but will also return with status = 506, to warn the calling program that approximations have been made. It is then up to the calling program to decide whether the approximations are sufficiently accurate for the particular application, or whether more precise WCS transformations must be performed using new-style WCS keywords directly. \end{description} \begin{verbatim} FTGICS(unit, > xrval,yrval,xrpix,yrpix,xinc,yinc,rot,coordtype,status) \end{verbatim} \begin{description} \item[2 ] Get the values of all the standard FITS celestial coordinate system keywords from the header of a FITS table where the X and Y (or RA and DEC coordinates are stored in 2 separate columns of the table. These values may then be passed to the subroutines that perform the coordinate transformations. \end{description} \begin{verbatim} FTGTCS(unit,xcol,ycol, > xrval,yrval,xrpix,yrpix,xinc,yinc,rot,coordtype,status) \end{verbatim} \begin{description} \item[3 ] Calculate the celestial coordinate corresponding to the input X and Y pixel location in the image. \end{description} \begin{verbatim} FTWLDP(xpix,ypix,xrval,yrval,xrpix,yrpix,xinc,yinc,rot, coordtype, > xpos,ypos,status) \end{verbatim} \begin{description} \item[4 ] Calculate the X and Y pixel location corresponding to the input celestial coordinate in the image. \end{description} \begin{verbatim} FTXYPX(xpos,ypos,xrval,yrval,xrpix,yrpix,xinc,yinc,rot, coordtype, > xpix,ypix,status) \end{verbatim} \section{File Checksum Subroutines \label{FTPCKS}} The following routines either compute or validate the checksums for the CHDU. The DATASUM keyword is used to store the numerical value of the 32-bit, 1's complement checksum for the data unit alone. If there is no data unit then the value is set to zero. The numerical value is stored as an ASCII string of digits, enclosed in quotes, because the value may be too large to represent as a 32-bit signed integer. The CHECKSUM keyword is used to store the ASCII encoded COMPLEMENT of the checksum for the entire HDU. Storing the complement, rather than the actual checksum, forces the checksum for the whole HDU to equal zero. If the file has been modified since the checksums were computed, then the HDU checksum will usually not equal zero. These checksum keyword conventions are based on a paper by Rob Seaman published in the proceedings of the ADASS IV conference in Baltimore in November 1994 and a later revision in June 1995. \begin{description} \item[1 ] Compute and write the DATASUM and CHECKSUM keyword values for the CHDU into the current header. The DATASUM value is the 32-bit checksum for the data unit, expressed as a decimal integer enclosed in single quotes. The CHECKSUM keyword value is a 16-character string which is the ASCII-encoded value for the complement of the checksum for the whole HDU. If these keywords already exist, their values will be updated only if necessary (i.e., if the file has been modified since the original keyword values were computed). \end{description} \begin{verbatim} FTPCKS(unit, > status) \end{verbatim} \begin{description} \item[2 ] Update the CHECKSUM keyword value in the CHDU, assuming that the DATASUM keyword exists and already has the correct value. This routine calculates the new checksum for the current header unit, adds it to the data unit checksum, encodes the value into an ASCII string, and writes the string to the CHECKSUM keyword. \end{description} \begin{verbatim} FTUCKS(unit, > status) \end{verbatim} \begin{description} \item[3 ] Verify the CHDU by computing the checksums and comparing them with the keywords. The data unit is verified correctly if the computed checksum equals the value of the DATASUM keyword. The checksum for the entire HDU (header plus data unit) is correct if it equals zero. The output DATAOK and HDUOK parameters in this subroutine are integers which will have a value = 1 if the data or HDU is verified correctly, a value = 0 if the DATASUM or CHECKSUM keyword is not present, or value = -1 if the computed checksum is not correct. \end{description} \begin{verbatim} FTVCKS(unit, > dataok,hduok,status) \end{verbatim} \begin{description} \item[4 ] Compute and return the checksum values for the CHDU (as double precision variables) without creating or modifying the CHECKSUM and DATASUM keywords. This routine is used internally by FTVCKS, but may be useful in other situations as well. \end{description} \begin{verbatim} FTGCKS(unit, > datasum,hdusum,status) \end{verbatim} \begin{description} \item[5 ] Encode a checksum value (stored in a double precision variable) into a 16-character string. If COMPLEMENT = .true. then the 32-bit sum value will be complemented before encoding. \end{description} \begin{verbatim} FTESUM(sum,complement, > checksum) \end{verbatim} \begin{description} \item[6 ] Decode a 16 character checksum string into a double precision value. If COMPLEMENT = .true. then the 32-bit sum value will be complemented after decoding. \end{description} \begin{verbatim} FTDSUM(checksum,complement, > sum) \end{verbatim} \section{ Date and Time Utility Routines \label{FTGSDT}} The following routines help to construct or parse the FITS date/time strings. Starting in the year 2000, the FITS DATE keyword values (and the values of other `DATE-' keywords) must have the form 'YYYY-MM-DD' (date only) or 'YYYY-MM-DDThh:mm:ss.ddd...' (date and time) where the number of decimal places in the seconds value is optional. These times are in UTC. The older 'dd/mm/yy' date format may not be used for dates after 01 January 2000. \begin{description} \item[1 ] Get the current system date. The returned year has 4 digits (1999, 2000, etc.) \end{description} \begin{verbatim} FTGSDT( > day, month, year, status ) \end{verbatim} \begin{description} \item[2 ] Get the current system date and time string ('YYYY-MM-DDThh:mm:ss'). The time will be in UTC/GMT if available, as indicated by a returned timeref value = 0. If the returned value of timeref = 1 then this indicates that it was not possible to convert the local time to UTC, and thus the local time was returned. \end{description} \begin{verbatim} FTGSTM(> datestr, timeref, status) \end{verbatim} \begin{description} \item[3 ] Construct a date string from the input date values. If the year is between 1900 and 1998, inclusive, then the returned date string will have the old FITS format ('dd/mm/yy'), otherwise the date string will have the new FITS format ('YYYY-MM-DD'). Use FTTM2S instead to always return a date string using the new FITS format. \end{description} \begin{verbatim} FTDT2S( year, month, day, > datestr, status) \end{verbatim} \begin{description} \item[4 ] Construct a new-format date + time string ('YYYY-MM-DDThh:mm:ss.ddd...'). If the year, month, and day values all = 0 then only the time is encoded with format 'hh:mm:ss.ddd...'. The decimals parameter specifies how many decimal places of fractional seconds to include in the string. If `decimals' is negative, then only the date will be return ('YYYY-MM-DD'). \end{description} \begin{verbatim} FTTM2S( year, month, day, hour, minute, second, decimals, > datestr, status) \end{verbatim} \begin{description} \item[5 ] Return the date as read from the input string, where the string may be in either the old ('dd/mm/yy') or new ('YYYY-MM-DDThh:mm:ss' or 'YYYY-MM-DD') FITS format. \end{description} \begin{verbatim} FTS2DT(datestr, > year, month, day, status) \end{verbatim} \begin{description} \item[6 ] Return the date and time as read from the input string, where the string may be in either the old or new FITS format. The returned hours, minutes, and seconds values will be set to zero if the input string does not include the time ('dd/mm/yy' or 'YYYY-MM-DD') . Similarly, the returned year, month, and date values will be set to zero if the date is not included in the input string ('hh:mm:ss.ddd...'). \end{description} \begin{verbatim} FTS2TM(datestr, > year, month, day, hour, minute, second, status) \end{verbatim} \section{General Utility Subroutines \label{FTGHAD}} The following utility subroutines may be useful for certain applications: \begin{description} \item[1 ] Return the starting byte address of the CHDU and the next HDU. \end{description} \begin{verbatim} FTGHAD(iunit, > curaddr, nextaddr) \end{verbatim} \begin{description} \item[2 ] Convert a character string to uppercase (operates in place). \end{description} \begin{verbatim} FTUPCH(string) \end{verbatim} \begin{description} \item[3 ] Compare the input template string against the reference string to see if they match. The template string may contain wildcard characters: '*' will match any sequence of characters (including zero characters) and '?' will match any single character in the reference string. The '\#' character will match any consecutive string of decimal digits (0 - 9). If CASESN = .true. then the match will be case sensitive. The returned MATCH parameter will be .true. if the 2 strings match, and EXACT will be .true. if the match is exact (i.e., if no wildcard characters were used in the match). Both strings must be 68 characters or less in length. \end{description} \begin{verbatim} FTCMPS(str_template, string, casesen, > match, exact) \end{verbatim} \begin{description} \item[4 ] Test that the keyword name contains only legal characters: A-Z,0-9, hyphen, and underscore. \end{description} \begin{verbatim} FTTKEY(keyword, > status) \end{verbatim} \begin{description} \item[5 ] Test that the keyword record contains only legal printable ASCII characters \end{description} \begin{verbatim} FTTREC(card, > status) \end{verbatim} \begin{description} \item[6 ] Test whether the current header contains any NULL (ASCII 0) characters. These characters are illegal in the header, but they will go undetected by most of the CFITSIO keyword header routines, because the null is interpreted as the normal end-of-string terminator. This routine returns the position of the first null character in the header, or zero if there are no nulls. For example a returned value of 110 would indicate that the first NULL is located in the 30th character of the second keyword in the header (recall that each header record is 80 characters long). Note that this is one of the few FITSIO routines in which the returned value is not necessarily equal to the status value). \end{description} \begin{verbatim} FTNCHK(unit, > status) \end{verbatim} \begin{description} \item[7 ] Parse a header keyword record and return the name of the keyword and the length of the name. The keyword name normally occupies the first 8 characters of the record, except under the HIERARCH convention where the name can be up to 70 characters in length. \end{description} \begin{verbatim} FTGKNM(card, > keyname, keylength, staThe '\#' character will match any consecutive string of decimal digits (0 - 9). tus) \end{verbatim} \begin{description} \item[8 ] Parse a header keyword record. This subroutine parses the input header record to return the value (as a character string) and comment strings. If the keyword has no value (columns 9-10 not equal to '= '), then the value string is returned blank and the comment string is set equal to column 9 - 80 of the input string. \end{description} \begin{verbatim} FTPSVC(card, > value,comment,status) \end{verbatim} \begin{description} \item[9 ] Construct a properly formated 80-character header keyword record from the input keyword name, keyword value, and keyword comment strings. Hierarchical keyword names (e.g., "ESO TELE CAM") are supported. The value string may contain an integer, floating point, logical, or quoted character string (e.g., "12", "15.7", "T", or "'NGC 1313'"). \end{description} \begin{verbatim} FTMKKY(keyname, value, comment, > card, status) \end{verbatim} \begin{description} \item[10] Construct a sequence keyword name (ROOT + nnn). This subroutine appends the sequence number to the root string to create a keyword name (e.g., 'NAXIS' + 2 = 'NAXIS2') \end{description} \begin{verbatim} FTKEYN(keyroot,seq_no, > keyword,status) \end{verbatim} \begin{description} \item[11] Construct a sequence keyword name (n + ROOT). This subroutine concatenates the sequence number to the front of the root string to create a keyword name (e.g., 1 + 'CTYP' = '1CTYP') \end{description} \begin{verbatim} FTNKEY(seq_no,keyroot, > keyword,status) \end{verbatim} \begin{description} \item[12] Determine the datatype of a keyword value string. This subroutine parses the keyword value string (usually columns 11-30 of the header record) to determine its datatype. \end{description} \begin{verbatim} FTDTYP(value, > dtype,status) \end{verbatim} \begin{description} \item[13] Return the class of input header record. The record is classified into one of the following categories (the class values are defined in fitsio.h). Note that this is one of the few FITSIO routines that does not return a status value. \end{description} \begin{verbatim} Class Value Keywords TYP_STRUC_KEY 10 SIMPLE, BITPIX, NAXIS, NAXISn, EXTEND, BLOCKED, GROUPS, PCOUNT, GCOUNT, END XTENSION, TFIELDS, TTYPEn, TBCOLn, TFORMn, THEAP, and the first 4 COMMENT keywords in the primary array that define the FITS format. TYP_CMPRS_KEY 20 The keywords used in the compressed image or table format, including ZIMAGE, ZCMPTYPE, ZNAMEn, ZVALn, ZTILEn, ZBITPIX, ZNAXISn, ZSCALE, ZZERO, ZBLANK TYP_SCAL_KEY 30 BSCALE, BZERO, TSCALn, TZEROn TYP_NULL_KEY 40 BLANK, TNULLn TYP_DIM_KEY 50 TDIMn TYP_RANG_KEY 60 TLMINn, TLMAXn, TDMINn, TDMAXn, DATAMIN, DATAMAX TYP_UNIT_KEY 70 BUNIT, TUNITn TYP_DISP_KEY 80 TDISPn TYP_HDUID_KEY 90 EXTNAME, EXTVER, EXTLEVEL, HDUNAME, HDUVER, HDULEVEL TYP_CKSUM_KEY 100 CHECKSUM, DATASUM TYP_WCS_KEY 110 CTYPEn, CUNITn, CRVALn, CRPIXn, CROTAn, CDELTn CDj_is, PVj_ms, LONPOLEs, LATPOLEs TCTYPn, TCTYns, TCUNIn, TCUNns, TCRVLn, TCRVns, TCRPXn, TCRPks, TCDn_k, TCn_ks, TPVn_m, TPn_ms, TCDLTn, TCROTn jCTYPn, jCTYns, jCUNIn, jCUNns, jCRVLn, jCRVns, iCRPXn, iCRPns, jiCDn, jiCDns, jPVn_m, jPn_ms, jCDLTn, jCROTn (i,j,m,n are integers, s is any letter) TYP_REFSYS_KEY 120 EQUINOXs, EPOCH, MJD-OBSs, RADECSYS, RADESYSs TYP_COMM_KEY 130 COMMENT, HISTORY, (blank keyword) TYP_CONT_KEY 140 CONTINUE TYP_USER_KEY 150 all other keywords class = FTGKCL (char *card) \end{verbatim} \begin{description} \item[14] Parse the 'TFORM' binary table column format string. This subroutine parses the input TFORM character string and returns the integer datatype code, the repeat count of the field, and, in the case of character string fields, the length of the unit string. The following datatype codes are returned (the negative of the value is returned if the column contains variable-length arrays): \end{description} \begin{verbatim} Datatype DATACODE value bit, X 1 byte, B 11 logical, L 14 ASCII character, A 16 short integer, I 21 integer, J 41 real, E 42 double precision, D 82 complex 83 double complex 163 FTBNFM(tform, > datacode,repeat,width,status) \end{verbatim} \begin{description} \item[15] Parse the 'TFORM' keyword value that defines the column format in an ASCII table. This routine parses the input TFORM character string and returns the datatype code, the width of the column, and (if it is a floating point column) the number of decimal places to the right of the decimal point. The returned datatype codes are the same as for the binary table, listed above, with the following additional rules: integer columns that are between 1 and 4 characters wide are defined to be short integers (code = 21). Wider integer columns are defined to be regular integers (code = 41). Similarly, Fixed decimal point columns (with TFORM = 'Fw.d') are defined to be single precision reals (code = 42) if w is between 1 and 7 characters wide, inclusive. Wider 'F' columns will return a double precision data code (= 82). 'Ew.d' format columns will have datacode = 42, and 'Dw.d' format columns will have datacode = 82. \end{description} \begin{verbatim} FTASFM(tform, > datacode,width,decimals,status) \end{verbatim} \begin{description} \item[16] Calculate the starting column positions and total ASCII table width based on the input array of ASCII table TFORM values. The SPACE input parameter defines how many blank spaces to leave between each column (it is recommended to have one space between columns for better human readability). \end{description} \begin{verbatim} FTGABC(tfields,tform,space, > rowlen,tbcol,status) \end{verbatim} \begin{description} \item[17] Parse a template string and return a formatted 80-character string suitable for appending to (or deleting from) a FITS header file. This subroutine is useful for parsing lines from an ASCII template file and reformatting them into legal FITS header records. The formatted string may then be passed to the FTPREC, FTMCRD, or FTDKEY subroutines to append or modify a FITS header record. \end{description} \begin{verbatim} FTGTHD(template, > card,hdtype,status) \end{verbatim} The input TEMPLATE character string generally should contain 3 tokens: (1) the KEYNAME, (2) the VALUE, and (3) the COMMENT string. The TEMPLATE string must adhere to the following format: \begin{description} \item[- ] The KEYNAME token must begin in columns 1-8 and be a maximum of 8 characters long. If the first 8 characters of the template line are blank then the remainder of the line is considered to be a FITS comment (with a blank keyword name). A legal FITS keyword name may only contain the characters A-Z, 0-9, and '-' (minus sign) and underscore. This subroutine will automatically convert any lowercase characters to uppercase in the output string. If KEYNAME = 'COMMENT' or 'HISTORY' then the remainder of the line is considered to be a FITS COMMENT or HISTORY record, respectively. \end{description} \begin{description} \item[- ] The VALUE token must be separated from the KEYNAME token by one or more spaces and/or an '=' character. The datatype of the VALUE token (numeric, logical, or character string) is automatically determined and the output CARD string is formatted accordingly. The value token may be forced to be interpreted as a string (e.g. if it is a string of numeric digits) by enclosing it in single quotes. If the value token is a character string that contains 1 or more embedded blank space characters or slash ('/') characters then the entire character string must be enclosed in single quotes. \end{description} \begin{description} \item[- ] The COMMENT token is optional, but if present must be separated from the VALUE token by a blank space or a '/' character. \end{description} \begin{description} \item[- ] One exception to the above rules is that if the first non-blank character in the template string is a minus sign ('-') followed by a single token, or a single token followed by an equal sign, then it is interpreted as the name of a keyword which is to be deleted from the FITS header. \end{description} \begin{description} \item[- ] The second exception is that if the template string starts with a minus sign and is followed by 2 tokens then the second token is interpreted as the new name for the keyword specified by first token. In this case the old keyword name (first token) is returned in characters 1-8 of the returned CARD string, and the new keyword name (the second token) is returned in characters 41-48 of the returned CARD string. These old and new names may then be passed to the FTMNAM subroutine which will change the keyword name. \end{description} The HDTYPE output parameter indicates how the returned CARD string should be interpreted: \begin{verbatim} hdtype interpretation ------ ------------------------------------------------- -2 Modify the name of the keyword given in CARD(1:8) to the new name given in CARD(41:48) -1 CARD(1:8) contains the name of a keyword to be deleted from the FITS header. 0 append the CARD string to the FITS header if the keyword does not already exist, otherwise update the value/comment if the keyword is already present in the header. 1 simply append this keyword to the FITS header (CARD is either a HISTORY or COMMENT keyword). 2 This is a FITS END record; it should not be written to the FITS header because FITSIO automatically appends the END record when the header is closed. \end{verbatim} EXAMPLES: The following lines illustrate valid input template strings: \begin{verbatim} INTVAL 7 This is an integer keyword RVAL 34.6 / This is a floating point keyword EVAL=-12.45E-03 This is a floating point keyword in exponential notation lval F This is a boolean keyword This is a comment keyword with a blank keyword name SVAL1 = 'Hello world' / this is a string keyword SVAL2 '123.5' this is also a string keyword sval3 123+ / this is also a string keyword with the value '123+ ' # the following template line deletes the DATE keyword - DATE # the following template line modifies the NAME keyword to OBJECT - NAME OBJECT \end{verbatim} \begin{description} \item[18] Parse the input string containing a list of rows or row ranges, and return integer arrays containing the first and last row in each range. For example, if rowlist = "3-5, 6, 8-9" then it will return numranges = 3, rangemin = 3, 6, 8 and rangemax = 5, 6, 9. At most, 'maxranges' number of ranges will be returned. 'maxrows' is the maximum number of rows in the table; any rows or ranges larger than this will be ignored. The rows must be specified in increasing order, and the ranges must not overlap. A minus sign may be use to specify all the rows to the upper or lower bound, so "50-" means all the rows from 50 to the end of the table, and "-" means all the rows in the table, from 1 - maxrows. \end{description} \begin{verbatim} FTRWRG(rowlist, maxrows, maxranges, > numranges, rangemin, rangemax, status) \end{verbatim} \chapter{ The CFITSIO Iterator Function } The fits\_iterate\_data function in CFITSIO provides a unique method of executing an arbitrary user-supplied `work' function that operates on rows of data in FITS tables or on pixels in FITS images. Rather than explicitly reading and writing the FITS images or columns of data, one instead calls the CFITSIO iterator routine, passing to it the name of the user's work function that is to be executed along with a list of all the table columns or image arrays that are to be passed to the work function. The CFITSIO iterator function then does all the work of allocating memory for the arrays, reading the input data from the FITS file, passing them to the work function, and then writing any output data back to the FITS file after the work function exits. Because it is often more efficient to process only a subset of the total table rows at one time, the iterator function can determine the optimum amount of data to pass in each iteration and repeatedly call the work function until the entire table been processed. For many applications this single CFITSIO iterator function can effectively replace all the other CFITSIO routines for reading or writing data in FITS images or tables. Using the iterator has several important advantages over the traditional method of reading and writing FITS data files: \begin{itemize} \item It cleanly separates the data I/O from the routine that operates on the data. This leads to a more modular and `object oriented' programming style. \item It simplifies the application program by eliminating the need to allocate memory for the data arrays and eliminates most of the calls to the CFITSIO routines that explicitly read and write the data. \item It ensures that the data are processed as efficiently as possible. This is especially important when processing tabular data since the iterator function will calculate the most efficient number of rows in the table to be passed at one time to the user's work function on each iteration. \item Makes it possible for larger projects to develop a library of work functions that all have a uniform calling sequence and are all independent of the details of the FITS file format. \end{itemize} There are basically 2 steps in using the CFITSIO iterator function. The first step is to design the work function itself which must have a prescribed set of input parameters. One of these parameters is a structure containing pointers to the arrays of data; the work function can perform any desired operations on these arrays and does not need to worry about how the input data were read from the file or how the output data get written back to the file. The second step is to design the driver routine that opens all the necessary FITS files and initializes the input parameters to the iterator function. The driver program calls the CFITSIO iterator function which then reads the data and passes it to the user's work function. Further details on using the iterator function can be found in the companion CFITSIO User's Guide, and in the iter\_a.f, iter\_b.f and iter\_c.f example programs. \chapter{ Extended File Name Syntax } \section{Overview} CFITSIO supports an extended syntax when specifying the name of the data file to be opened or created that includes the following features: \begin{itemize} \item CFITSIO can read IRAF format images which have header file names that end with the '.imh' extension, as well as reading and writing FITS files, This feature is implemented in CFITSIO by first converting the IRAF image into a temporary FITS format file in memory, then opening the FITS file. Any of the usual CFITSIO routines then may be used to read the image header or data. Similarly, raw binary data arrays can be read by converting them on the fly into virtual FITS images. \item FITS files on the Internet can be read (and sometimes written) using the FTP, HTTP, or ROOT protocols. \item FITS files can be piped between tasks on the stdin and stdout streams. \item FITS files can be read and written in shared memory. This can potentially achieve much better data I/O performance compared to reading and writing the same FITS files on magnetic disk. \item Compressed FITS files in gzip or Unix COMPRESS format can be directly read. \item Output FITS files can be written directly in compressed gzip format, thus saving disk space. \item FITS table columns can be created, modified, or deleted 'on-the-fly' as the table is opened by CFITSIO. This creates a virtual FITS file containing the modifications that is then opened by the application program. \item Table rows may be selected, or filtered out, on the fly when the table is opened by CFITSIO, based on an arbitrary user-specified expression. Only rows for which the expression evaluates to 'TRUE' are retained in the copy of the table that is opened by the application program. \item Histogram images may be created on the fly by binning the values in table columns, resulting in a virtual N-dimensional FITS image. The application program then only sees the FITS image (in the primary array) instead of the original FITS table. \end{itemize} The latter 3 features in particular add very powerful data processing capabilities directly into CFITSIO, and hence into every task that uses CFITSIO to read or write FITS files. For example, these features transform a very simple program that just copies an input FITS file to a new output file (like the `fitscopy' program that is distributed with CFITSIO) into a multipurpose FITS file processing tool. By appending fairly simple qualifiers onto the name of the input FITS file, the user can perform quite complex table editing operations (e.g., create new columns, or filter out rows in a table) or create FITS images by binning or histogramming the values in table columns. In addition, these functions have been coded using new state-of-the art algorithms that are, in some cases, 10 - 100 times faster than previous widely used implementations. Before describing the complete syntax for the extended FITS file names in the next section, here are a few examples of FITS file names that give a quick overview of the allowed syntax: \begin{itemize} \item {\tt 'myfile.fits'}: the simplest case of a FITS file on disk in the current directory. \item {\tt 'myfile.imh'}: opens an IRAF format image file and converts it on the fly into a temporary FITS format image in memory which can then be read with any other CFITSIO routine. \item {\tt rawfile.dat[i512,512]}: opens a raw binary data array (a 512 x 512 short integer array in this case) and converts it on the fly into a temporary FITS format image in memory which can then be read with any other CFITSIO routine. \item {\tt myfile.fits.gz}: if this is the name of a new output file, the '.gz' suffix will cause it to be compressed in gzip format when it is written to disk. \item {\tt 'myfile.fits.gz[events, 2]'}: opens and uncompresses the gzipped file myfile.fits then moves to the extension which has the keywords EXTNAME = 'EVENTS' and EXTVER = 2. \item {\tt '-'}: a dash (minus sign) signifies that the input file is to be read from the stdin file stream, or that the output file is to be written to the stdout stream. \item {\tt 'ftp://legacy.gsfc.nasa.gov/test/vela.fits'}: FITS files in any ftp archive site on the Internet may be directly opened with read-only access. \item {\tt 'http://legacy.gsfc.nasa.gov/software/test.fits'}: any valid URL to a FITS file on the Web may be opened with read-only access. \item {\tt 'root://legacy.gsfc.nasa.gov/test/vela.fits'}: similar to ftp access except that it provides write as well as read access to the files across the network. This uses the root protocol developed at CERN. \item {\tt 'shmem://h2[events]'}: opens the FITS file in a shared memory segment and moves to the EVENTS extension. \item {\tt 'mem://'}: creates a scratch output file in core computer memory. The resulting 'file' will disappear when the program exits, so this is mainly useful for testing purposes when one does not want a permanent copy of the output file. \item {\tt 'myfile.fits[3; Images(10)]'}: opens a copy of the image contained in the 10th row of the 'Images' column in the binary table in the 3th extension of the FITS file. The application just sees this single image as the primary array. \item {\tt 'myfile.fits[1:512:2, 1:512:2]'}: opens a section of the input image ranging from the 1st to the 512th pixel in X and Y, and selects every second pixel in both dimensions, resulting in a 256 x 256 pixel image in this case. \item {\tt 'myfile.fits[EVENTS][col Rad = sqrt(X**2 + Y**2)]'}: creates and opens a temporary file on the fly (in memory or on disk) that is identical to myfile.fits except that it will contain a new column in the EVENTS extension called 'Rad' whose value is computed using the indicated expression which is a function of the values in the X and Y columns. \item {\tt 'myfile.fits[EVENTS][PHA > 5]'}: creates and opens a temporary FITS files that is identical to 'myfile.fits' except that the EVENTS table will only contain the rows that have values of the PHA column greater than 5. In general, any arbitrary boolean expression using a C or Fortran-like syntax, which may combine AND and OR operators, may be used to select rows from a table. \item {\tt 'myfile.fits[EVENTS][bin (X,Y)=1,2048,4]'}: creates a temporary FITS primary array image which is computed on the fly by binning (i.e, computing the 2-dimensional histogram) of the values in the X and Y columns of the EVENTS extension. In this case the X and Y coordinates range from 1 to 2048 and the image pixel size is 4 units in both dimensions, so the resulting image is 512 x 512 pixels in size. \item The final example combines many of these feature into one complex expression (it is broken into several lines for clarity): \begin{verbatim} 'ftp://legacy.gsfc.nasa.gov/data/sample.fits.gz[EVENTS] [col phacorr = pha * 1.1 - 0.3][phacorr >= 5.0 && phacorr <= 14.0] [bin (X,Y)=32]' \end{verbatim} In this case, CFITSIO (1) copies and uncompresses the FITS file from the ftp site on the legacy machine, (2) moves to the 'EVENTS' extension, (3) calculates a new column called 'phacorr', (4) selects the rows in the table that have phacorr in the range 5 to 14, and finally (5) bins the remaining rows on the X and Y column coordinates, using a pixel size = 32 to create a 2D image. All this processing is completely transparent to the application program, which simply sees the final 2-D image in the primary array of the opened file. \end{itemize} The full extended CFITSIO FITS file name can contain several different components depending on the context. These components are described in the following sections: \begin{verbatim} When creating a new file: filetype://BaseFilename(templateName) When opening an existing primary array or image HDU: filetype://BaseFilename(outName)[HDUlocation][ImageSection] When opening an existing table HDU: filetype://BaseFilename(outName)[HDUlocation][colFilter][rowFilter][binSpec] \end{verbatim} The filetype, BaseFilename, outName, HDUlocation, and ImageSection components, if present, must be given in that order, but the colFilter, rowFilter, and binSpec specifiers may follow in any order. Regardless of the order, however, the colFilter specifier, if present, will be processed first by CFITSIO, followed by the rowFilter specifier, and finally by the binSpec specifier. \section{Filetype} The type of file determines the medium on which the file is located (e.g., disk or network) and, hence, which internal device driver is used by CFITSIO to read and/or write the file. Currently supported types are \begin{verbatim} file:// - file on local magnetic disk (default) ftp:// - a readonly file accessed with the anonymous FTP protocol. It also supports ftp://username:password@hostname/... for accessing password-protected ftp sites. http:// - a readonly file accessed with the HTTP protocol. It supports username:password just like the ftp driver. Proxy HTTP servers are supported using the http_proxy environment variable (see following note). stream:// - special driver to read an input FITS file from the stdin stream, and/or write an output FITS file to the stdout stream. This driver is fragile and has limited functionality (see the following note). gsiftp:// - access files on a computational grid using the gridftp protocol in the Globus toolkit (see following note). root:// - uses the CERN root protocol for writing as well as reading files over the network. shmem:// - opens or creates a file which persists in the computer's shared memory. mem:// - opens a temporary file in core memory. The file disappears when the program exits so this is mainly useful for test purposes when a permanent output file is not desired. \end{verbatim} If the filetype is not specified, then type file:// is assumed. The double slashes '//' are optional and may be omitted in most cases. \subsection{Notes about HTTP proxy servers} A proxy HTTP server may be used by defining the address (URL) and port number of the proxy server with the http\_proxy environment variable. For example \begin{verbatim} setenv http_proxy http://heasarc.gsfc.nasa.gov:3128 \end{verbatim} will cause CFITSIO to use port 3128 on the heasarc proxy server whenever reading a FITS file with HTTP. \subsection{Notes about the stream filetype driver} The stream driver can be used to efficiently read a FITS file from the stdin file stream or write a FITS to the stdout file stream. However, because these input and output streams must be accessed sequentially, the FITS file reading or writing application must also read and write the file sequentially, at least within the tolerances described below. CFITSIO supports 2 different methods for accessing FITS files on the stdin and stdout streams. The original method, which is invoked by specifying a dash character, "-", as the name of the file when opening or creating it, works by storing a complete copy of the entire FITS file in memory. In this case, when reading from stdin, CFITSIO will copy the entire stream into memory before doing any processing of the file. Similarly, when writing to stdout, CFITSIO will create a copy of the entire FITS file in memory, before finally flushing it out to the stdout stream when the FITS file is closed. Buffering the entire FITS file in this way allows the application to randomly access any part of the FITS file, in any order, but it also requires that the user have sufficient available memory (or virtual memory) to store the entire file, which may not be possible in the case of very large files. The newer stream filetype provides a more memory-efficient method of accessing FITS files on the stdin or stdout streams. Instead of storing a copy of the entire FITS file in memory, CFITSIO only uses a set of internal buffer which by default can store 40 FITS blocks, or about 100K bytes of the FITS file. The application program must process the FITS file sequentially from beginning to end, within this 100K buffer. Generally speaking the application program must conform to the following restrictions: \begin{itemize} \item The program must finish reading or writing the header keywords before reading or writing any data in the HDU. \item The HDU can contain at most about 1400 header keywords. This is the maximum that can fit in the nominal 40 FITS block buffer. In principle, this limit could be increased by recompiling CFITSIO with a larger buffer limit, which is set by the NIOBUF parameter in fitsio2.h. \item The program must read or write the data in a sequential manner from the beginning to the end of the HDU. Note that CFITSIO's internal 100K buffer allows a little latitude in meeting this requirement. \item The program cannot move back to a previous HDU in the FITS file. \item Reading or writing of variable length array columns in binary tables is not supported on streams, because this requires moving back and forth between the fixed-length portion of the binary table and the following heap area where the arrays are actually stored. \item Reading or writing of tile-compressed images is not supported on streams, because the images are internally stored using variable length arrays. \end{itemize} \subsection{Notes about the gsiftp filetype} DEPENDENCIES: Globus toolkit (2.4.3 or higher) (GT) should be installed. There are two different ways to install GT: 1) goto the globus toolkit web page www.globus.org and follow the download and compilation instructions; 2) goto the Virtual Data Toolkit web page http://vdt.cs.wisc.edu/ and follow the instructions (STRONGLY SUGGESTED); Once a globus client has been installed in your system with a specific flavour it is possible to compile and install the CFITSIO libraries. Specific configuration flags must be used: 1) --with-gsiftp[[=PATH]] Enable Globus Toolkit gsiftp protocol support PATH=GLOBUS\_LOCATION i.e. the location of your globus installation 2) --with-gsiftp-flavour[[=PATH] defines the specific Globus flavour ex. gcc32 Both the flags must be used and it is mandatory to set both the PATH and the flavour. USAGE: To access files on a gridftp server it is necessary to use a gsiftp prefix: example: gsiftp://remote\_server\_fqhn/directory/filename The gridftp driver uses a local buffer on a temporary file the file is located in the /tmp directory. If you have special permissions on /tmp or you do not have a /tmp directory, it is possible to force another location setting the GSIFTP\_TMPFILE environment variable (ex. export GSIFTP\_TMPFILE=/your/location/yourtmpfile). Grid FTP supports multi channel transfer. By default a single channel transmission is available. However, it is possible to modify this behavior setting the GSIFTP\_STREAMS environment variable (ex. export GSIFTP\_STREAMS=8). \subsection{Notes about the root filetype} The original rootd server can be obtained from: \verb-ftp://root.cern.ch/root/rootd.tar.gz- but, for it to work correctly with CFITSIO one has to use a modified version which supports a command to return the length of the file. This modified version is available in rootd subdirectory in the CFITSIO ftp area at \begin{verbatim} ftp://legacy.gsfc.nasa.gov/software/fitsio/c/root/rootd.tar.gz. \end{verbatim} This small server is started either by inetd when a client requests a connection to a rootd server or by hand (i.e. from the command line). The rootd server works with the ROOT TNetFile class. It allows remote access to ROOT database files in either read or write mode. By default TNetFile assumes port 432 (which requires rootd to be started as root). To run rootd via inetd add the following line to /etc/services: \begin{verbatim} rootd 432/tcp \end{verbatim} and to /etc/inetd.conf, add the following line: \begin{verbatim} rootd stream tcp nowait root /user/rdm/root/bin/rootd rootd -i \end{verbatim} Force inetd to reread its conf file with "kill -HUP ". You can also start rootd by hand running directly under your private account (no root system privileges needed). For example to start rootd listening on port 5151 just type: \verb+rootd -p 5151+ Notice: no \& is needed. Rootd will go into background by itself. \begin{verbatim} Rootd arguments: -i says we were started by inetd -p port# specifies a different port to listen on -d level level of debug info written to syslog 0 = no debug (default) 1 = minimum 2 = medium 3 = maximum \end{verbatim} Rootd can also be configured for anonymous usage (like anonymous ftp). To setup rootd to accept anonymous logins do the following (while being logged in as root): \begin{verbatim} - Add the following line to /etc/passwd: rootd:*:71:72:Anonymous rootd:/var/spool/rootd:/bin/false where you may modify the uid, gid (71, 72) and the home directory to suite your system. - Add the following line to /etc/group: rootd:*:72:rootd where the gid must match the gid in /etc/passwd. - Create the directories: mkdir /var/spool/rootd mkdir /var/spool/rootd/tmp chmod 777 /var/spool/rootd/tmp Where /var/spool/rootd must match the rootd home directory as specified in the rootd /etc/passwd entry. - To make writeable directories for anonymous do, for example: mkdir /var/spool/rootd/pub chown rootd:rootd /var/spool/rootd/pub \end{verbatim} That's all. Several additional remarks: you can login to an anonymous server either with the names "anonymous" or "rootd". The password should be of type user@host.do.main. Only the @ is enforced for the time being. In anonymous mode the top of the file tree is set to the rootd home directory, therefore only files below the home directory can be accessed. Anonymous mode only works when the server is started via inetd. \subsection{Notes about the shmem filetype:} Shared memory files are currently supported on most Unix platforms, where the shared memory segments are managed by the operating system kernel and `live' independently of processes. They are not deleted (by default) when the process which created them terminates, although they will disappear if the system is rebooted. Applications can create shared memory files in CFITSIO by calling: \begin{verbatim} fit_create_file(&fitsfileptr, "shmem://h2", &status); \end{verbatim} where the root `file' names are currently restricted to be 'h0', 'h1', 'h2', 'h3', etc., up to a maximum number defined by the the value of SHARED\_MAXSEG (equal to 16 by default). This is a prototype implementation of the shared memory interface and a more robust interface, which will have fewer restrictions on the number of files and on their names, may be developed in the future. When opening an already existing FITS file in shared memory one calls the usual CFITSIO routine: \begin{verbatim} fits_open_file(&fitsfileptr, "shmem://h7", mode, &status) \end{verbatim} The file mode can be READWRITE or READONLY just as with disk files. More than one process can operate on READONLY mode files at the same time. CFITSIO supports proper file locking (both in READONLY and READWRITE modes), so calls to fits\_open\_file may be locked out until another other process closes the file. When an application is finished accessing a FITS file in a shared memory segment, it may close it (and the file will remain in the system) with fits\_close\_file, or delete it with fits\_delete\_file. Physical deletion is postponed until the last process calls ffclos/ffdelt. fits\_delete\_file tries to obtain a READWRITE lock on the file to be deleted, thus it can be blocked if the object was not opened in READWRITE mode. A shared memory management utility program called `smem', is included with the CFITSIO distribution. It can be built by typing `make smem'; then type `smem -h' to get a list of valid options. Executing smem without any options causes it to list all the shared memory segments currently residing in the system and managed by the shared memory driver. To get a list of all the shared memory objects, run the system utility program `ipcs [-a]'. \section{Base Filename} The base filename is the name of the file optionally including the director/subdirectory path, and in the case of `ftp', `http', and `root' filetypes, the machine identifier. Examples: \begin{verbatim} myfile.fits !data.fits /data/myfile.fits fits.gsfc.nasa.gov/ftp/sampledata/myfile.fits.gz \end{verbatim} When creating a new output file on magnetic disk (of type file://) if the base filename begins with an exclamation point (!) then any existing file with that same basename will be deleted prior to creating the new FITS file. Otherwise if the file to be created already exists, then CFITSIO will return an error and will not overwrite the existing file. Note that the exclamation point, '!', is a special UNIX character, so if it is used on the command line rather than entered at a task prompt, it must be preceded by a backslash to force the UNIX shell to pass it verbatim to the application program. If the output disk file name ends with the suffix '.gz', then CFITSIO will compress the file using the gzip compression algorithm before writing it to disk. This can reduce the amount of disk space used by the file. Note that this feature requires that the uncompressed file be constructed in memory before it is compressed and written to disk, so it can fail if there is insufficient available memory. An input FITS file may be compressed with the gzip or Unix compress algorithms, in which case CFITSIO will uncompress the file on the fly into a temporary file (in memory or on disk). Compressed files may only be opened with read-only permission. When specifying the name of a compressed FITS file it is not necessary to append the file suffix (e.g., `.gz' or `.Z'). If CFITSIO cannot find the input file name without the suffix, then it will automatically search for a compressed file with the same root name. In the case of reading ftp and http type files, CFITSIO generally looks for a compressed version of the file first, before trying to open the uncompressed file. By default, CFITSIO copies (and uncompressed if necessary) the ftp or http FITS file into memory on the local machine before opening it. This will fail if the local machine does not have enough memory to hold the whole FITS file, so in this case, the output filename specifier (see the next section) can be used to further control how CFITSIO reads ftp and http files. If the input file is an IRAF image file (*.imh file) then CFITSIO will automatically convert it on the fly into a virtual FITS image before it is opened by the application program. IRAF images can only be opened with READONLY file access. Similarly, if the input file is a raw binary data array, then CFITSIO will convert it on the fly into a virtual FITS image with the basic set of required header keywords before it is opened by the application program (with READONLY access). In this case the data type and dimensions of the image must be specified in square brackets following the filename (e.g. rawfile.dat[ib512,512]). The first character (case insensitive) defines the datatype of the array: \begin{verbatim} b 8-bit unsigned byte i 16-bit signed integer u 16-bit unsigned integer j 32-bit signed integer r or f 32-bit floating point d 64-bit floating point \end{verbatim} An optional second character specifies the byte order of the array values: b or B indicates big endian (as in FITS files and the native format of SUN UNIX workstations and Mac PCs) and l or L indicates little endian (native format of DEC OSF workstations and IBM PCs). If this character is omitted then the array is assumed to have the native byte order of the local machine. These datatype characters are then followed by a series of one or more integer values separated by commas which define the size of each dimension of the raw array. Arrays with up to 5 dimensions are currently supported. Finally, a byte offset to the position of the first pixel in the data file may be specified by separating it with a ':' from the last dimension value. If omitted, it is assumed that the offset = 0. This parameter may be used to skip over any header information in the file that precedes the binary data. Further examples: \begin{verbatim} raw.dat[b10000] 1-dimensional 10000 pixel byte array raw.dat[rb400,400,12] 3-dimensional floating point big-endian array img.fits[ib512,512:2880] reads the 512 x 512 short integer array in a FITS file, skipping over the 2880 byte header \end{verbatim} One special case of input file is where the filename = `-' (a dash or minus sign) or 'stdin' or 'stdout', which signifies that the input file is to be read from the stdin stream, or written to the stdout stream if a new output file is being created. In the case of reading from stdin, CFITSIO first copies the whole stream into a temporary FITS file (in memory or on disk), and subsequent reading of the FITS file occurs in this copy. When writing to stdout, CFITSIO first constructs the whole file in memory (since random access is required), then flushes it out to the stdout stream when the file is closed. In addition, if the output filename = '-.gz' or 'stdout.gz' then it will be gzip compressed before being written to stdout. This ability to read and write on the stdin and stdout steams allows FITS files to be piped between tasks in memory rather than having to create temporary intermediate FITS files on disk. For example if task1 creates an output FITS file, and task2 reads an input FITS file, the FITS file may be piped between the 2 tasks by specifying \begin{verbatim} task1 - | task2 - \end{verbatim} where the vertical bar is the Unix piping symbol. This assumes that the 2 tasks read the name of the FITS file off of the command line. \section{Output File Name when Opening an Existing File} An optional output filename may be specified in parentheses immediately following the base file name to be opened. This is mainly useful in those cases where CFITSIO creates a temporary copy of the input FITS file before it is opened and passed to the application program. This happens by default when opening a network FTP or HTTP-type file, when reading a compressed FITS file on a local disk, when reading from the stdin stream, or when a column filter, row filter, or binning specifier is included as part of the input file specification. By default this temporary file is created in memory. If there is not enough memory to create the file copy, then CFITSIO will exit with an error. In these cases one can force a permanent file to be created on disk, instead of a temporary file in memory, by supplying the name in parentheses immediately following the base file name. The output filename can include the '!' clobber flag. Thus, if the input filename to CFITSIO is: \verb+file1.fits.gz(file2.fits)+ then CFITSIO will uncompress `file1.fits.gz' into the local disk file `file2.fits' before opening it. CFITSIO does not automatically delete the output file, so it will still exist after the application program exits. In some cases, several different temporary FITS files will be created in sequence, for instance, if one opens a remote file using FTP, then filters rows in a binary table extension, then create an image by binning a pair of columns. In this case, the remote file will be copied to a temporary local file, then a second temporary file will be created containing the filtered rows of the table, and finally a third temporary file containing the binned image will be created. In cases like this where multiple files are created, the outfile specifier will be interpreted the name of the final file as described below, in descending priority: \begin{itemize} \item as the name of the final image file if an image within a single binary table cell is opened or if an image is created by binning a table column. \item as the name of the file containing the filtered table if a column filter and/or a row filter are specified. \item as the name of the local copy of the remote FTP or HTTP file. \item as the name of the uncompressed version of the FITS file, if a compressed FITS file on local disk has been opened. \item otherwise, the output filename is ignored. \end{itemize} The output file specifier is useful when reading FTP or HTTP-type FITS files since it can be used to create a local disk copy of the file that can be reused in the future. If the output file name = `*' then a local file with the same name as the network file will be created. Note that CFITSIO will behave differently depending on whether the remote file is compressed or not as shown by the following examples: \begin{itemize} \item `ftp://remote.machine/tmp/myfile.fits.gz(*)' - the remote compressed file is copied to the local compressed file `myfile.fits.gz', which is then uncompressed in local memory before being opened and passed to the application program. \item `ftp://remote.machine/tmp/myfile.fits.gz(myfile.fits)' - the remote compressed file is copied and uncompressed into the local file `myfile.fits'. This example requires less local memory than the previous example since the file is uncompressed on disk instead of in memory. \item `ftp://remote.machine/tmp/myfile.fits(myfile.fits.gz)' - this will usually produce an error since CFITSIO itself cannot compress files. \end{itemize} The exact behavior of CFITSIO in the latter case depends on the type of ftp server running on the remote machine and how it is configured. In some cases, if the file `myfile.fits.gz' exists on the remote machine, then the server will copy it to the local machine. In other cases the ftp server will automatically create and transmit a compressed version of the file if only the uncompressed version exists. This can get rather confusing, so users should use a certain amount of caution when using the output file specifier with FTP or HTTP file types, to make sure they get the behavior that they expect. \section{Template File Name when Creating a New File} When a new FITS file is created with a call to fits\_create\_file, the name of a template file may be supplied in parentheses immediately following the name of the new file to be created. This template is used to define the structure of one or more HDUs in the new file. The template file may be another FITS file, in which case the newly created file will have exactly the same keywords in each HDU as in the template FITS file, but all the data units will be filled with zeros. The template file may also be an ASCII text file, where each line (in general) describes one FITS keyword record. The format of the ASCII template file is described below. \section{Image Tile-Compression Specification} When specifying the name of the output FITS file to be created, the user can indicate that images should be written in tile-compressed format (see section 5.5, ``Primary Array or IMAGE Extension I/O Routines'') by enclosing the compression parameters in square brackets following the root disk file name. Here are some examples of the syntax for specifying tile-compressed output images: \begin{verbatim} myfile.fit[compress] - use Rice algorithm and default tile size myfile.fit[compress GZIP] - use the specified compression algorithm; myfile.fit[compress Rice] only the first letter of the algorithm myfile.fit[compress PLIO] name is required. myfile.fit[compress Rice 100,100] - use 100 x 100 pixel tile size myfile.fit[compress Rice 100,100;2] - as above, and use noisebits = 2 \end{verbatim} \section{HDU Location Specification} The optional HDU location specifier defines which HDU (Header-Data Unit, also known as an `extension') within the FITS file to initially open. It must immediately follow the base file name (or the output file name if present). If it is not specified then the first HDU (the primary array) is opened. The HDU location specifier is required if the colFilter, rowFilter, or binSpec specifiers are present, because the primary array is not a valid HDU for these operations. The HDU may be specified either by absolute position number, starting with 0 for the primary array, or by reference to the HDU name, and optionally, the version number and the HDU type of the desired extension. The location of an image within a single cell of a binary table may also be specified, as described below. The absolute position of the extension is specified either by enclosed the number in square brackets (e.g., `[1]' = the first extension following the primary array) or by preceded the number with a plus sign (`+1'). To specify the HDU by name, give the name of the desired HDU (the value of the EXTNAME or HDUNAME keyword) and optionally the extension version number (value of the EXTVER keyword) and the extension type (value of the XTENSION keyword: IMAGE, ASCII or TABLE, or BINTABLE), separated by commas and all enclosed in square brackets. If the value of EXTVER and XTENSION are not specified, then the first extension with the correct value of EXTNAME is opened. The extension name and type are not case sensitive, and the extension type may be abbreviated to a single letter (e.g., I = IMAGE extension or primary array, A or T = ASCII table extension, and B = binary table BINTABLE extension). If the HDU location specifier is equal to `[PRIMARY]' or `[P]', then the primary array (the first HDU) will be opened. FITS images are most commonly stored in the primary array or an image extension, but images can also be stored as a vector in a single cell of a binary table (i.e. each row of the vector column contains a different image). Such an image can be opened with CFITSIO by specifying the desired column name and the row number after the binary table HDU specifier as shown in the following examples. The column name is separated from the HDU specifier by a semicolon and the row number is enclosed in parentheses. In this case CFITSIO copies the image from the table cell into a temporary primary array before it is opened. The application program then just sees the image in the primary array, without any extensions. The particular row to be opened may be specified either by giving an absolute integer row number (starting with 1 for the first row), or by specifying a boolean expression that evaluates to TRUE for the desired row. The first row that satisfies the expression will be used. The row selection expression has the same syntax as described in the Row Filter Specifier section, below. Examples: \begin{verbatim} myfile.fits[3] - open the 3rd HDU following the primary array myfile.fits+3 - same as above, but using the FTOOLS-style notation myfile.fits[EVENTS] - open the extension that has EXTNAME = 'EVENTS' myfile.fits[EVENTS, 2] - same as above, but also requires EXTVER = 2 myfile.fits[events,2,b] - same, but also requires XTENSION = 'BINTABLE' myfile.fits[3; images(17)] - opens the image in row 17 of the 'images' column in the 3rd extension of the file. myfile.fits[3; images(exposure > 100)] - as above, but opens the image in the first row that has an 'exposure' column value greater than 100. \end{verbatim} \section{Image Section} A virtual file containing a rectangular subsection of an image can be extracted and opened by specifying the range of pixels (start:end) along each axis to be extracted from the original image. One can also specify an optional pixel increment (start:end:step) for each axis of the input image. A pixel step = 1 will be assumed if it is not specified. If the start pixel is larger then the end pixel, then the image will be flipped (producing a mirror image) along that dimension. An asterisk, '*', may be used to specify the entire range of an axis, and '-*' will flip the entire axis. The input image can be in the primary array, in an image extension, or contained in a vector cell of a binary table. In the later 2 cases the extension name or number must be specified before the image section specifier. Examples: \begin{verbatim} myfile.fits[1:512:2, 2:512:2] - open a 256x256 pixel image consisting of the odd numbered columns (1st axis) and the even numbered rows (2nd axis) of the image in the primary array of the file. myfile.fits[*, 512:256] - open an image consisting of all the columns in the input image, but only rows 256 through 512. The image will be flipped along the 2nd axis since the starting pixel is greater than the ending pixel. myfile.fits[*:2, 512:256:2] - same as above but keeping only every other row and column in the input image. myfile.fits[-*, *] - copy the entire image, flipping it along the first axis. myfile.fits[3][1:256,1:256] - opens a subsection of the image that is in the 3rd extension of the file. myfile.fits[4; images(12)][1:10,1:10] - open an image consisting of the first 10 pixels in both dimensions. The original image resides in the 12th row of the 'images' vector column in the table in the 4th extension of the file. \end{verbatim} When CFITSIO opens an image section it first creates a temporary file containing the image section plus a copy of any other HDUs in the file. This temporary file is then opened by the application program, so it is not possible to write to or modify the input file when specifying an image section. Note that CFITSIO automatically updates the world coordinate system keywords in the header of the image section, if they exist, so that the coordinate associated with each pixel in the image section will be computed correctly. \section{Image Transform Filters} CFITSIO can apply a user-specified mathematical function to the value of every pixel in a FITS image, thus creating a new virtual image in computer memory that is then opened and read by the application program. The original FITS image is not modified by this process. The image transformation specifier is appended to the input FITS file name and is enclosed in square brackets. It begins with the letters 'PIX' to distinguish it from other types of FITS file filters that are recognized by CFITSIO. The image transforming function may use any of the mathematical operators listed in the following 'Row Filtering Specification' section of this document. Some examples of image transform filters are: \begin{verbatim} [pix X * 2.0] - multiply each pixel by 2.0 [pix sqrt(X)] - take the square root of each pixel [pix X + #ZEROPT - add the value of the ZEROPT keyword [pix X>0 ? log10(X) : -99.] - if the pixel value is greater than 0, compute the base 10 log, else set the pixel = -99. \end{verbatim} Use the letter 'X' in the expression to represent the current pixel value in the image. The expression is evaluated independently for each pixel in the image and may be a function of 1) the original pixel value, 2) the value of other pixels in the image at a given relative offset from the position of the pixel that is being evaluated, and 3) the value of any header keywords. Header keyword values are represented by the name of the keyword preceded by the '\#' sign. To access the the value of adjacent pixels in the image, specify the (1-D) offset from the current pixel in curly brackets. For example \begin{verbatim} [pix (x{-1} + x + x{+1}) / 3] \end{verbatim} will replace each pixel value with the running mean of the values of that pixel and it's 2 neighboring pixels. Note that in this notation the image is treated as a 1-D array, where each row of the image (or higher dimensional cube) is appended one after another in one long array of pixels. It is possible to refer to pixels in the rows above or below the current pixel by using the value of the NAXIS1 header keyword. For example \begin{verbatim} [pix (x{-#NAXIS1} + x + x{#NAXIS1}) / 3] \end{verbatim} will compute the mean of each image pixel and the pixels immediately above and below it in the adjacent rows of the image. The following more complex example creates a smoothed virtual image where each pixel is a 3 x 3 boxcar average of the input image pixels: \begin{verbatim} [pix (X + X{-1} + X{+1} + X{-#NAXIS1} + X{-#NAXIS1 - 1} + X{-#NAXIS1 + 1} + X{#NAXIS1} + X{#NAXIS1 - 1} + X{#NAXIS1 + 1}) / 9.] \end{verbatim} If the pixel offset extends beyond the first or last pixel in the image, the function will evaluate to undefined, or NULL. For complex or commonly used image filtering operations, one can write the expression into an external text file and then import it into the filter using the syntax '[pix @filename.txt]'. The mathematical expression can extend over multiple lines of text in the file. Any lines in the external text file that begin with 2 slash characters ('//') will be ignored and may be used to add comments into the file. By default, the datatype of the resulting image will be the same as the original image, but one may force a different datatype by appended a code letter to the 'pix' keyword: \begin{verbatim} pixb - 8-bit byte image with BITPIX = 8 pixi - 16-bit integer image with BITPIX = 16 pixj - 32-bit integer image with BITPIX = 32 pixr - 32-bit float image with BITPIX = -32 pixd - 64-bit float image with BITPIX = -64 \end{verbatim} Also by default, any other HDUs in the input file will be copied without change to the output virtual FITS file, but one may discard the other HDUs by adding the number '1' to the 'pix' keyword (and following any optional datatype code letter). For example: \begin{verbatim} myfile.fits[3][pixr1 sqrt(X)] \end{verbatim} will create a virtual FITS file containing only a primary array image with 32-bit floating point pixels that have a value equal to the square root of the pixels in the image that is in the 3rd extension of the 'myfile.fits' file. \section{Column and Keyword Filtering Specification} The optional column/keyword filtering specifier is used to modify the column structure and/or the header keywords in the HDU that was selected with the previous HDU location specifier. This filtering specifier must be enclosed in square brackets and can be distinguished from a general row filter specifier (described below) by the fact that it begins with the string 'col ' and is not immediately followed by an equals sign. The original file is not changed by this filtering operation, and instead the modifications are made on a copy of the input FITS file (usually in memory), which also contains a copy of all the other HDUs in the file. This temporary file is passed to the application program and will persist only until the file is closed or until the program exits, unless the outfile specifier (see above) is also supplied. The column/keyword filter can be used to perform the following operations. More than one operation may be specified by separating them with commas or semi-colons. \begin{itemize} \item Copy only a specified list of columns columns to the filtered input file. The list of column name should be separated by commas or semi-colons. Wild card characters may be used in the column names to match multiple columns. If the expression contains both a list of columns to be included and columns to be deleted, then all the columns in the original table except the explicitly deleted columns will appear in the filtered table (i.e., there is no need to explicitly list the columns to be included if any columns are being deleted). \item Delete a column or keyword by listing the name preceded by a minus sign or an exclamation mark (!), e.g., '-TIME' will delete the TIME column if it exists, otherwise the TIME keyword. An error is returned if neither a column nor keyword with this name exists. Note that the exclamation point, '!', is a special UNIX character, so if it is used on the command line rather than entered at a task prompt, it must be preceded by a backslash to force the UNIX shell to ignore it. \item Rename an existing column or keyword with the syntax 'NewName == OldName'. An error is returned if neither a column nor keyword with this name exists. \item Append a new column or keyword to the table. To create a column, give the new name, optionally followed by the datatype in parentheses, followed by a single equals sign and an expression to be used to compute the value (e.g., 'newcol(1J) = 0' will create a new 32-bit integer column called 'newcol' filled with zeros). The datatype is specified using the same syntax that is allowed for the value of the FITS TFORMn keyword (e.g., 'I', 'J', 'E', 'D', etc. for binary tables, and 'I8', F12.3', 'E20.12', etc. for ASCII tables). If the datatype is not specified then an appropriate datatype will be chosen depending on the form of the expression (may be a character string, logical, bit, long integer, or double column). An appropriate vector count (in the case of binary tables) will also be added if not explicitly specified. When creating a new keyword, the keyword name must be preceded by a pound sign '\#', and the expression must evaluate to a scalar (i.e., cannot have a column name in the expression). The comment string for the keyword may be specified in parentheses immediately following the keyword name (instead of supplying a datatype as in the case of creating a new column). If the keyword name ends with a pound sign '\#', then cfitsio will substitute the number of the most recently referenced column for the \# character . This is especially useful when writing a column-related keyword like TUNITn for a newly created column, as shown in the following examples. COMMENT and HISTORY keywords may also be created with the following syntax: \begin{verbatim} #COMMENT = 'This is a comment keyword' #HISTORY = 'This is a history keyword' \end{verbatim} Note that the equal sign and the quote characters will be removed, so that the resulting header keywords in these cases will look like this: \begin{verbatim} COMMENT This is a comment keyword HISTORY This is a history keyword \end{verbatim} These two special keywords are always appended to the end of the header and will not affect any previously existing COMMENT or HISTORY keywords. \item Recompute (overwrite) the values in an existing column or keyword by giving the name followed by an equals sign and an arithmetic expression. \end{itemize} The expression that is used when appending or recomputing columns or keywords can be arbitrarily complex and may be a function of other header keyword values and other columns (in the same row). The full syntax and available functions for the expression are described below in the row filter specification section. If the expression contains both a list of columns to be included and columns to be deleted, then all the columns in the original table except the explicitly deleted columns will appear in the filtered table. If no columns to be deleted are specified, then only the columns that are explicitly listed will be included in the filtered output table. To include all the columns, add the '*' wildcard specifier at the end of the list, as shown in the examples. For complex or commonly used operations, one can also place the operations into an external text file and import it into the column filter using the syntax '[col @filename.txt]'. The operations can extend over multiple lines of the file, but multiple operations must still be separated by commas or semi-colons. Any lines in the external text file that begin with 2 slash characters ('//') will be ignored and may be used to add comments into the file. Examples: \begin{verbatim} [col Time, rate] - only the Time and rate columns will appear in the filtered input file. [col Time, *raw] - include the Time column and any other columns whose name ends with 'raw'. [col -TIME; Good == STATUS] - deletes the TIME column and renames the status column to 'Good' [col PI=PHA * 1.1 + 0.2; #TUNIT#(column units) = 'counts';*] - creates new PI column from PHA values and also writes the TUNITn keyword for the new column. The final '*' expression means preserve all the columns in the input table in the virtual output table; without the '*' the output table would only contain the single 'PI' column. [col rate = rate/exposure, TUNIT#(&) = 'counts/s';*] - recomputes the rate column by dividing it by the EXPOSURE keyword value. This also modifies the value of the TUNITn keyword for this column. The use of the '&' character for the keyword comment string means preserve the existing comment string for that keyword. The final '*' preserves all the columns in the input table in the virtual output table. \end{verbatim} \section{Row Filtering Specification} When entering the name of a FITS table that is to be opened by a program, an optional row filter may be specified to select a subset of the rows in the table. A temporary new FITS file is created on the fly which contains only those rows for which the row filter expression evaluates to true. (The primary array and any other extensions in the input file are also copied to the temporary file). The original FITS file is closed and the new virtual file is opened by the application program. The row filter expression is enclosed in square brackets following the file name and extension name (e.g., 'file.fits[events][GRADE==50]' selects only those rows where the GRADE column value equals 50). When dealing with tables where each row has an associated time and/or 2D spatial position, the row filter expression can also be used to select rows based on the times in a Good Time Intervals (GTI) extension, or on spatial position as given in a SAO-style region file. \subsection{General Syntax} The row filtering expression can be an arbitrarily complex series of operations performed on constants, keyword values, and column data taken from the specified FITS TABLE extension. The expression must evaluate to a boolean value for each row of the table, where a value of FALSE means that the row will be excluded. For complex or commonly used filters, one can place the expression into a text file and import it into the row filter using the syntax '[@filename.txt]'. The expression can be arbitrarily complex and extend over multiple lines of the file. Any lines in the external text file that begin with 2 slash characters ('//') will be ignored and may be used to add comments into the file. Keyword and column data are referenced by name. Any string of characters not surrounded by quotes (ie, a constant string) or followed by an open parentheses (ie, a function name) will be initially interpreted as a column name and its contents for the current row inserted into the expression. If no such column exists, a keyword of that name will be searched for and its value used, if found. To force the name to be interpreted as a keyword (in case there is both a column and keyword with the same name), precede the keyword name with a single pound sign, '\#', as in '\#NAXIS2'. Due to the generalities of FITS column and keyword names, if the column or keyword name contains a space or a character which might appear as an arithmetic term then enclose the name in '\$' characters as in \$MAX PHA\$ or \#\$MAX-PHA\$. Names are case insensitive. To access a table entry in a row other than the current one, follow the column's name with a row offset within curly braces. For example, 'PHA\{-3\}' will evaluate to the value of column PHA, 3 rows above the row currently being processed. One cannot specify an absolute row number, only a relative offset. Rows that fall outside the table will be treated as undefined, or NULLs. Boolean operators can be used in the expression in either their Fortran or C forms. The following boolean operators are available: \begin{verbatim} "equal" .eq. .EQ. == "not equal" .ne. .NE. != "less than" .lt. .LT. < "less than/equal" .le. .LE. <= =< "greater than" .gt. .GT. > "greater than/equal" .ge. .GE. >= => "or" .or. .OR. || "and" .and. .AND. && "negation" .not. .NOT. ! "approx. equal(1e-7)" ~ \end{verbatim} Note that the exclamation point, '!', is a special UNIX character, so if it is used on the command line rather than entered at a task prompt, it must be preceded by a backslash to force the UNIX shell to ignore it. The expression may also include arithmetic operators and functions. Trigonometric functions use radians, not degrees. The following arithmetic operators and functions can be used in the expression (function names are case insensitive). A null value will be returned in case of illegal operations such as divide by zero, sqrt(negative) log(negative), log10(negative), arccos(.gt. 1), arcsin(.gt. 1). \begin{verbatim} "addition" + "subtraction" - "multiplication" * "division" / "negation" - "exponentiation" ** ^ "absolute value" abs(x) "cosine" cos(x) "sine" sin(x) "tangent" tan(x) "arc cosine" arccos(x) "arc sine" arcsin(x) "arc tangent" arctan(x) "arc tangent" arctan2(y,x) "hyperbolic cos" cosh(x) "hyperbolic sin" sinh(x) "hyperbolic tan" tanh(x) "round to nearest int" round(x) "round down to int" floor(x) "round up to int" ceil(x) "exponential" exp(x) "square root" sqrt(x) "natural log" log(x) "common log" log10(x) "modulus" x % y "random # [0.0,1.0)" random() "random Gaussian" randomn() "random Poisson" randomp(x) "minimum" min(x,y) "maximum" max(x,y) "cumulative sum" accum(x) "sequential difference" seqdiff(x) "if-then-else" b?x:y "angular separation" angsep(ra1,dec1,ra2,de2) (all in degrees) "substring" strmid(s,p,n) "string search" strstr(s,r) \end{verbatim} Three different random number functions are provided: random(), with no arguments, produces a uniform random deviate between 0 and 1; randomn(), also with no arguments, produces a normal (Gaussian) random deviate with zero mean and unit standard deviation; randomp(x) produces a Poisson random deviate whose expected number of counts is X. X may be any positive real number of expected counts, including fractional values, but the return value is an integer. When the random functions are used in a vector expression, by default the same random value will be used when evaluating each element of the vector. If different random numbers are desired, then the name of a vector column should be supplied as the single argument to the random function (e.g., "flux + 0.1 * random(flux)", where "flux' is the name of a vector column). This will create a vector of random numbers that will be used in sequence when evaluating each element of the vector expression. An alternate syntax for the min and max functions has only a single argument which should be a vector value (see below). The result will be the minimum/maximum element contained within the vector. The accum(x) function forms the cumulative sum of x, element by element. Vector columns are supported simply by performing the summation process through all the values. Null values are treated as 0. The seqdiff(x) function forms the sequential difference of x, element by element. The first value of seqdiff is the first value of x. A single null value in x causes a pair of nulls in the output. The seqdiff and accum functions are functional inverses, i.e., seqdiff(accum(x)) == x as long as no null values are present. In the if-then-else expression, "b?x:y", b is an explicit boolean value or expression. There is no automatic type conversion from numeric to boolean values, so one needs to use "iVal!=0" instead of merely "iVal" as the boolean argument. x and y can be any scalar data type (including string). The angsep function computes the angular separation in degrees between 2 celestial positions, where the first 2 parameters give the RA-like and Dec-like coordinates (in decimal degrees) of the first position, and the 3rd and 4th parameters give the coordinates of the second position. The substring function strmid(S,P,N) extracts a substring from S, starting at string position P, with a substring length N. The first character position in S is labeled as 1. If P is 0, or refers to a position beyond the end of S, then the extracted substring will be NULL. S, P, and N may be functions of other columns. The string search function strstr(S,R) searches for the first occurrence of the substring R in S. The result is an integer, indicating the character position of the first match (where 1 is the first character position of S). If no match is found, then strstr() returns a NULL value. The following type casting operators are available, where the enclosing parentheses are required and taken from the C language usage. Also, the integer to real casts values to double precision: \begin{verbatim} "real to integer" (int) x (INT) x "integer to real" (float) i (FLOAT) i \end{verbatim} In addition, several constants are built in for use in numerical expressions: \begin{verbatim} #pi 3.1415... #e 2.7182... #deg #pi/180 #row current row number #null undefined value #snull undefined string \end{verbatim} A string constant must be enclosed in quotes as in 'Crab'. The "null" constants are useful for conditionally setting table values to a NULL, or undefined, value (eg., "col1==-99 ? \#NULL : col1"). There is also a function for testing if two values are close to each other, i.e., if they are "near" each other to within a user specified tolerance. The arguments, value\_1 and value\_2 can be integer or real and represent the two values who's proximity is being tested to be within the specified tolerance, also an integer or real: \begin{verbatim} near(value_1, value_2, tolerance) \end{verbatim} When a NULL, or undefined, value is encountered in the FITS table, the expression will evaluate to NULL unless the undefined value is not actually required for evaluation, e.g. "TRUE .or. NULL" evaluates to TRUE. The following two functions allow some NULL detection and handling: \begin{verbatim} "a null value?" ISNULL(x) "define a value for null" DEFNULL(x,y) \end{verbatim} The former returns a boolean value of TRUE if the argument x is NULL. The later "defines" a value to be substituted for NULL values; it returns the value of x if x is not NULL, otherwise it returns the value of y. \subsection{Bit Masks} Bit masks can be used to select out rows from bit columns (TFORMn = \#X) in FITS files. To represent the mask, binary, octal, and hex formats are allowed: \begin{verbatim} binary: b0110xx1010000101xxxx0001 octal: o720x1 -> (b111010000xxx001) hex: h0FxD -> (b00001111xxxx1101) \end{verbatim} In all the representations, an x or X is allowed in the mask as a wild card. Note that the x represents a different number of wild card bits in each representation. All representations are case insensitive. To construct the boolean expression using the mask as the boolean equal operator described above on a bit table column. For example, if you had a 7 bit column named flags in a FITS table and wanted all rows having the bit pattern 0010011, the selection expression would be: \begin{verbatim} flags == b0010011 or flags .eq. b10011 \end{verbatim} It is also possible to test if a range of bits is less than, less than equal, greater than and greater than equal to a particular boolean value: \begin{verbatim} flags <= bxxx010xx flags .gt. bxxx100xx flags .le. b1xxxxxxx \end{verbatim} Notice the use of the x bit value to limit the range of bits being compared. It is not necessary to specify the leading (most significant) zero (0) bits in the mask, as shown in the second expression above. Bit wise AND, OR and NOT operations are also possible on two or more bit fields using the '\&'(AND), '$|$'(OR), and the '!'(NOT) operators. All of these operators result in a bit field which can then be used with the equal operator. For example: \begin{verbatim} (!flags) == b1101100 (flags & b1000001) == bx000001 \end{verbatim} Bit fields can be appended as well using the '+' operator. Strings can be concatenated this way, too. \subsection{Vector Columns} Vector columns can also be used in building the expression. No special syntax is required if one wants to operate on all elements of the vector. Simply use the column name as for a scalar column. Vector columns can be freely intermixed with scalar columns or constants in virtually all expressions. The result will be of the same dimension as the vector. Two vectors in an expression, though, need to have the same number of elements and have the same dimensions. The only places a vector column cannot be used (for now, anyway) are the SAO region functions and the NEAR boolean function. Arithmetic and logical operations are all performed on an element by element basis. Comparing two vector columns, eg "COL1 == COL2", thus results in another vector of boolean values indicating which elements of the two vectors are equal. Eight functions are available that operate on a vector and return a scalar result: \begin{verbatim} "minimum" MIN(V) "maximum" MAX(V) "average" AVERAGE(V) "median" MEDIAN(V) "summation" SUM(V) "standard deviation" STDDEV(V) "# of values" NELEM(V) "# of non-null values" NVALID(V) \end{verbatim} where V represents the name of a vector column or a manually constructed vector using curly brackets as described below. The first 6 of these functions ignore any null values in the vector when computing the result. The STDDEV() function computes the sample standard deviation, i.e. it is proportional to 1/SQRT(N-1) instead of 1/SQRT(N), where N is NVALID(V). The SUM function literally sums all the elements in x, returning a scalar value. If x is a boolean vector, SUM returns the number of TRUE elements. The NELEM function returns the number of elements in vector x whereas NVALID return the number of non-null elements in the vector. (NELEM also operates on bit and string columns, returning their column widths.) As an example, to test whether all elements of two vectors satisfy a given logical comparison, one can use the expression \begin{verbatim} SUM( COL1 > COL2 ) == NELEM( COL1 ) \end{verbatim} which will return TRUE if all elements of COL1 are greater than their corresponding elements in COL2. To specify a single element of a vector, give the column name followed by a comma-separated list of coordinates enclosed in square brackets. For example, if a vector column named PHAS exists in the table as a one dimensional, 256 component list of numbers from which you wanted to select the 57th component for use in the expression, then PHAS[57] would do the trick. Higher dimensional arrays of data may appear in a column. But in order to interpret them, the TDIMn keyword must appear in the header. Assuming that a (4,4,4,4) array is packed into each row of a column named ARRAY4D, the (1,2,3,4) component element of each row is accessed by ARRAY4D[1,2,3,4]. Arrays up to dimension 5 are currently supported. Each vector index can itself be an expression, although it must evaluate to an integer value within the bounds of the vector. Vector columns which contain spaces or arithmetic operators must have their names enclosed in "\$" characters as with \$ARRAY-4D\$[1,2,3,4]. A more C-like syntax for specifying vector indices is also available. The element used in the preceding example alternatively could be specified with the syntax ARRAY4D[4][3][2][1]. Note the reverse order of indices (as in C), as well as the fact that the values are still ones-based (as in Fortran -- adopted to avoid ambiguity for 1D vectors). With this syntax, one does not need to specify all of the indices. To extract a 3D slice of this 4D array, use ARRAY4D[4]. Variable-length vector columns are not supported. Vectors can be manually constructed within the expression using a comma-separated list of elements surrounded by curly braces ('\{\}'). For example, '\{1,3,6,1\}' is a 4-element vector containing the values 1, 3, 6, and 1. The vector can contain only boolean, integer, and real values (or expressions). The elements will be promoted to the highest datatype present. Any elements which are themselves vectors, will be expanded out with each of its elements becoming an element in the constructed vector. \subsection{Good Time Interval Filtering} A common filtering method involves selecting rows which have a time value which lies within what is called a Good Time Interval or GTI. The time intervals are defined in a separate FITS table extension which contains 2 columns giving the start and stop time of each good interval. The filtering operation accepts only those rows of the input table which have an associated time which falls within one of the time intervals defined in the GTI extension. A high level function, gtifilter(a,b,c,d), is available which evaluates each row of the input table and returns TRUE or FALSE depending whether the row is inside or outside the good time interval. The syntax is \begin{verbatim} gtifilter( [ "gtifile" [, expr [, "STARTCOL", "STOPCOL" ] ] ] ) \end{verbatim} where each "[]" demarks optional parameters. Note that the quotes around the gtifile and START/STOP column are required. Either single or double quotes may be used. In cases where this expression is entered on the Unix command line, enclose the entire expression in double quotes, and then use single quotes within the expression to enclose the 'gtifile' and other terms. It is also usually possible to do the reverse, and enclose the whole expression in single quotes and then use double quotes within the expression. The gtifile, if specified, can be blank ("") which will mean to use the first extension with the name "*GTI*" in the current file, a plain extension specifier (eg, "+2", "[2]", or "[STDGTI]") which will be used to select an extension in the current file, or a regular filename with or without an extension specifier which in the latter case will mean to use the first extension with an extension name "*GTI*". Expr can be any arithmetic expression, including simply the time column name. A vector time expression will produce a vector boolean result. STARTCOL and STOPCOL are the names of the START/STOP columns in the GTI extension. If one of them is specified, they both must be. In its simplest form, no parameters need to be provided -- default values will be used. The expression "gtifilter()" is equivalent to \begin{verbatim} gtifilter( "", TIME, "*START*", "*STOP*" ) \end{verbatim} This will search the current file for a GTI extension, filter the TIME column in the current table, using START/STOP times taken from columns in the GTI extension with names containing the strings "START" and "STOP". The wildcards ('*') allow slight variations in naming conventions such as "TSTART" or "STARTTIME". The same default values apply for unspecified parameters when the first one or two parameters are specified. The function automatically searches for TIMEZERO/I/F keywords in the current and GTI extensions, applying a relative time offset, if necessary. \subsection{Spatial Region Filtering} Another common filtering method selects rows based on whether the spatial position associated with each row is located within a given 2-dimensional region. The syntax for this high-level filter is \begin{verbatim} regfilter( "regfilename" [ , Xexpr, Yexpr [ , "wcs cols" ] ] ) \end{verbatim} where each "[]" demarks optional parameters. The region file name is required and must be enclosed in quotes. The remaining parameters are optional. There are 2 supported formats for the region file: ASCII file or FITS binary table. The region file contains a list of one or more geometric shapes (circle, ellipse, box, etc.) which defines a region on the celestial sphere or an area within a particular 2D image. The region file is typically generated using an image display program such as fv/POW (distribute by the HEASARC), or ds9 (distributed by the Smithsonian Astrophysical Observatory). Users should refer to the documentation provided with these programs for more details on the syntax used in the region files. The FITS region file format is defined in a document available from the FITS Support Office at http://fits.gsfc.nasa.gov/ registry/ region.html In its simplest form, (e.g., regfilter("region.reg") ) the coordinates in the default 'X' and 'Y' columns will be used to determine if each row is inside or outside the area specified in the region file. Alternate position column names, or expressions, may be entered if needed, as in \begin{verbatim} regfilter("region.reg", XPOS, YPOS) \end{verbatim} Region filtering can be applied most unambiguously if the positions in the region file and in the table to be filtered are both give in terms of absolute celestial coordinate units. In this case the locations and sizes of the geometric shapes in the region file are specified in angular units on the sky (e.g., positions given in R.A. and Dec. and sizes in arcseconds or arcminutes). Similarly, each row of the filtered table will have a celestial coordinate associated with it. This association is usually implemented using a set of so-called 'World Coordinate System' (or WCS) FITS keywords that define the coordinate transformation that must be applied to the values in the 'X' and 'Y' columns to calculate the coordinate. Alternatively, one can perform spatial filtering using unitless 'pixel' coordinates for the regions and row positions. In this case the user must be careful to ensure that the positions in the 2 files are self-consistent. A typical problem is that the region file may be generated using a binned image, but the unbinned coordinates are given in the event table. The ROSAT events files, for example, have X and Y pixel coordinates that range from 1 - 15360. These coordinates are typically binned by a factor of 32 to produce a 480x480 pixel image. If one then uses a region file generated from this image (in image pixel units) to filter the ROSAT events file, then the X and Y column values must be converted to corresponding pixel units as in: \begin{verbatim} regfilter("rosat.reg", X/32.+.5, Y/32.+.5) \end{verbatim} Note that this binning conversion is not necessary if the region file is specified using celestial coordinate units instead of pixel units because CFITSIO is then able to directly compare the celestial coordinate of each row in the table with the celestial coordinates in the region file without having to know anything about how the image may have been binned. The last "wcs cols" parameter should rarely be needed. If supplied, this string contains the names of the 2 columns (space or comma separated) which have the associated WCS keywords. If not supplied, the filter will scan the X and Y expressions for column names. If only one is found in each expression, those columns will be used, otherwise an error will be returned. These region shapes are supported (names are case insensitive): \begin{verbatim} Point ( X1, Y1 ) <- One pixel square region Line ( X1, Y1, X2, Y2 ) <- One pixel wide region Polygon ( X1, Y1, X2, Y2, ... ) <- Rest are interiors with Rectangle ( X1, Y1, X2, Y2, A ) | boundaries considered Box ( Xc, Yc, Wdth, Hght, A ) V within the region Diamond ( Xc, Yc, Wdth, Hght, A ) Circle ( Xc, Yc, R ) Annulus ( Xc, Yc, Rin, Rout ) Ellipse ( Xc, Yc, Rx, Ry, A ) Elliptannulus ( Xc, Yc, Rinx, Riny, Routx, Routy, Ain, Aout ) Sector ( Xc, Yc, Amin, Amax ) \end{verbatim} where (Xc,Yc) is the coordinate of the shape's center; (X\#,Y\#) are the coordinates of the shape's edges; Rxxx are the shapes' various Radii or semi-major/minor axes; and Axxx are the angles of rotation (or bounding angles for Sector) in degrees. For rotated shapes, the rotation angle can be left off, indicating no rotation. Common alternate names for the regions can also be used: rotbox = box; rotrectangle = rectangle; (rot)rhombus = (rot)diamond; and pie = sector. When a shape's name is preceded by a minus sign, '-', the defined region is instead the area *outside* its boundary (ie, the region is inverted). All the shapes within a single region file are OR'd together to create the region, and the order is significant. The overall way of looking at region files is that if the first region is an excluded region then a dummy included region of the whole detector is inserted in the front. Then each region specification as it is processed overrides any selections inside of that region specified by previous regions. Another way of thinking about this is that if a previous excluded region is completely inside of a subsequent included region the excluded region is ignored. The positional coordinates may be given either in pixel units, decimal degrees or hh:mm:ss.s, dd:mm:ss.s units. The shape sizes may be given in pixels, degrees, arcminutes, or arcseconds. Look at examples of region file produced by fv/POW or ds9 for further details of the region file format. There are three functions that are primarily for use with SAO region files and the FSAOI task, but they can be used directly. They return a boolean true or false depending on whether a two dimensional point is in the region or not: \begin{verbatim} "point in a circular region" circle(xcntr,ycntr,radius,Xcolumn,Ycolumn) "point in an elliptical region" ellipse(xcntr,ycntr,xhlf_wdth,yhlf_wdth,rotation,Xcolumn,Ycolumn) "point in a rectangular region" box(xcntr,ycntr,xfll_wdth,yfll_wdth,rotation,Xcolumn,Ycolumn) where (xcntr,ycntr) are the (x,y) position of the center of the region (xhlf_wdth,yhlf_wdth) are the (x,y) half widths of the region (xfll_wdth,yfll_wdth) are the (x,y) full widths of the region (radius) is half the diameter of the circle (rotation) is the angle(degrees) that the region is rotated with respect to (xcntr,ycntr) (Xcoord,Ycoord) are the (x,y) coordinates to test, usually column names NOTE: each parameter can itself be an expression, not merely a column name or constant. \end{verbatim} \subsection{Example Row Filters} \begin{verbatim} [ binary && mag <= 5.0] - Extract all binary stars brighter than fifth magnitude (note that the initial space is necessary to prevent it from being treated as a binning specification) [#row >= 125 && #row <= 175] - Extract row numbers 125 through 175 [IMAGE[4,5] .gt. 100] - Extract all rows that have the (4,5) component of the IMAGE column greater than 100 [abs(sin(theta * #deg)) < 0.5] - Extract all rows having the absolute value of the sine of theta less than a half where the angles are tabulated in degrees [SUM( SPEC > 3*BACKGRND )>=1] - Extract all rows containing a spectrum, held in vector column SPEC, with at least one value 3 times greater than the background level held in a keyword, BACKGRND [VCOL=={1,4,2}] - Extract all rows whose vector column VCOL contains the 3-elements 1, 4, and 2. [@rowFilter.txt] - Extract rows using the expression contained within the text file rowFilter.txt [gtifilter()] - Search the current file for a GTI extension, filter the TIME column in the current table, using START/STOP times taken from columns in the GTI extension [regfilter("pow.reg")] - Extract rows which have a coordinate (as given in the X and Y columns) within the spatial region specified in the pow.reg region file. [regfilter("pow.reg", Xs, Ys)] - Same as above, except that the Xs and Ys columns will be used to determine the coordinate of each row in the table. \end{verbatim} \section{ Binning or Histogramming Specification} The optional binning specifier is enclosed in square brackets and can be distinguished from a general row filter specification by the fact that it begins with the keyword 'bin' not immediately followed by an equals sign. When binning is specified, a temporary N-dimensional FITS primary array is created by computing the histogram of the values in the specified columns of a FITS table extension. After the histogram is computed the input FITS file containing the table is then closed and the temporary FITS primary array is opened and passed to the application program. Thus, the application program never sees the original FITS table and only sees the image in the new temporary file (which has no additional extensions). Obviously, the application program must be expecting to open a FITS image and not a FITS table in this case. The data type of the FITS histogram image may be specified by appending 'b' (for 8-bit byte), 'i' (for 16-bit integers), 'j' (for 32-bit integer), 'r' (for 32-bit floating points), or 'd' (for 64-bit double precision floating point) to the 'bin' keyword (e.g. '[binr X]' creates a real floating point image). If the datatype is not explicitly specified then a 32-bit integer image will be created by default, unless the weighting option is also specified in which case the image will have a 32-bit floating point data type by default. The histogram image may have from 1 to 4 dimensions (axes), depending on the number of columns that are specified. The general form of the binning specification is: \begin{verbatim} [bin{bijrd} Xcol=min:max:binsize, Ycol= ..., Zcol=..., Tcol=...; weight] \end{verbatim} in which up to 4 columns, each corresponding to an axis of the image, are listed. The column names are case insensitive, and the column number may be given instead of the name, preceded by a pound sign (e.g., [bin \#4=1:512]). If the column name is not specified, then CFITSIO will first try to use the 'preferred column' as specified by the CPREF keyword if it exists (e.g., 'CPREF = 'DETX,DETY'), otherwise column names 'X', 'Y', 'Z', and 'T' will be assumed for each of the 4 axes, respectively. In cases where the column name could be confused with an arithmetic expression, enclose the column name in parentheses to force the name to be interpreted literally. Each column name may be followed by an equals sign and then the lower and upper range of the histogram, and the size of the histogram bins, separated by colons. Spaces are allowed before and after the equals sign but not within the 'min:max:binsize' string. The min, max and binsize values may be integer or floating point numbers, or they may be the names of keywords in the header of the table. If the latter, then the value of that keyword is substituted into the expression. Default values for the min, max and binsize quantities will be used if not explicitly given in the binning expression as shown in these examples: \begin{verbatim} [bin x = :512:2] - use default minimum value [bin x = 1::2] - use default maximum value [bin x = 1:512] - use default bin size [bin x = 1:] - use default maximum value and bin size [bin x = :512] - use default minimum value and bin size [bin x = 2] - use default minimum and maximum values [bin x] - use default minimum, maximum and bin size [bin 4] - default 2-D image, bin size = 4 in both axes [bin] - default 2-D image \end{verbatim} CFITSIO will use the value of the TLMINn, TLMAXn, and TDBINn keywords, if they exist, for the default min, max, and binsize, respectively. If they do not exist then CFITSIO will use the actual minimum and maximum values in the column for the histogram min and max values. The default binsize will be set to 1, or (max - min) / 10., whichever is smaller, so that the histogram will have at least 10 bins along each axis. A shortcut notation is allowed if all the columns/axes have the same binning specification. In this case all the column names may be listed within parentheses, followed by the (single) binning specification, as in: \begin{verbatim} [bin (X,Y)=1:512:2] [bin (X,Y) = 5] \end{verbatim} The optional weighting factor is the last item in the binning specifier and, if present, is separated from the list of columns by a semi-colon. As the histogram is accumulated, this weight is used to incremented the value of the appropriated bin in the histogram. If the weighting factor is not specified, then the default weight = 1 is assumed. The weighting factor may be a constant integer or floating point number, or the name of a keyword containing the weighting value. Or the weighting factor may be the name of a table column in which case the value in that column, on a row by row basis, will be used. In some cases, the column or keyword may give the reciprocal of the actual weight value that is needed. In this case, precede the weight keyword or column name by a slash '/' to tell CFITSIO to use the reciprocal of the value when constructing the histogram. For complex or commonly used histograms, one can also place its description into a text file and import it into the binning specification using the syntax '[bin @filename.txt]'. The file's contents can extend over multiple lines, although it must still conform to the no-spaces rule for the min:max:binsize syntax and each axis specification must still be comma-separated. Any lines in the external text file that begin with 2 slash characters ('//') will be ignored and may be used to add comments into the file. Examples: \begin{verbatim} [bini detx, dety] - 2-D, 16-bit integer histogram of DETX and DETY columns, using default values for the histogram range and binsize [bin (detx, dety)=16; /exposure] - 2-D, 32-bit real histogram of DETX and DETY columns with a bin size = 16 in both axes. The histogram values are divided by the EXPOSURE keyword value. [bin time=TSTART:TSTOP:0.1] - 1-D lightcurve, range determined by the TSTART and TSTOP keywords, with 0.1 unit size bins. [bin pha, time=8000.:8100.:0.1] - 2-D image using default binning of the PHA column for the X axis, and 1000 bins in the range 8000. to 8100. for the Y axis. [bin @binFilter.txt] - Use the contents of the text file binFilter.txt for the binning specifications. \end{verbatim} \chapter{Template Files } When a new FITS file is created with a call to fits\_create\_file, the name of a template file may be supplied in parentheses immediately following the name of the new file to be created. This template is used to define the structure of one or more HDUs in the new file. The template file may be another FITS file, in which case the newly created file will have exactly the same keywords in each HDU as in the template FITS file, but all the data units will be filled with zeros. The template file may also be an ASCII text file, where each line (in general) describes one FITS keyword record. The format of the ASCII template file is described in the following sections. \section{Detailed Template Line Format} The format of each ASCII template line closely follows the format of a FITS keyword record: \begin{verbatim} KEYWORD = KEYVALUE / COMMENT \end{verbatim} except that free format may be used (e.g., the equals sign may appear at any position in the line) and TAB characters are allowed and are treated the same as space characters. The KEYVALUE and COMMENT fields are optional. The equals sign character is also optional, but it is recommended that it be included for clarity. Any template line that begins with the pound '\#' character is ignored by the template parser and may be use to insert comments into the template file itself. The KEYWORD name field is limited to 8 characters in length and only the letters A-Z, digits 0-9, and the hyphen and underscore characters may be used, without any embedded spaces. Lowercase letters in the template keyword name will be converted to uppercase. Leading spaces in the template line preceding the keyword name are generally ignored, except if the first 8 characters of a template line are all blank, then the entire line is treated as a FITS comment keyword (with a blank keyword name) and is copied verbatim into the FITS header. The KEYVALUE field may have any allowed FITS data type: character string, logical, integer, real, complex integer, or complex real. Integer values must be within the allowed range of a 'signed long' variable; some C compilers only suppport 4-byte long integers with a range from -2147483648 to +2147483647, whereas other C compilers support 8-byte integers with a range of plus or minus 2**63. The character string values need not be enclosed in single quote characters unless they are necessary to distinguish the string from a different data type (e.g. 2.0 is a real but '2.0' is a string). The keyword has an undefined (null) value if the template record only contains blanks following the "=" or between the "=" and the "/" comment field delimiter. String keyword values longer than 68 characters (the maximum length that will fit in a single FITS keyword record) are permitted using the CFITSIO long string convention. They can either be specified as a single long line in the template, or by using multiple lines where the continuing lines contain the 'CONTINUE' keyword, as in this example: \begin{verbatim} LONGKEY = 'This is a long string value that is contin&' CONTINUE 'ued over 2 records' / comment field goes here \end{verbatim} The format of template lines with CONTINUE keyword is very strict: 3 spaces must follow CONTINUE and the rest of the line is copied verbatim to the FITS file. The start of the optional COMMENT field must be preceded by "/", which is used to separate it from the keyword value field. Exceptions are if the KEYWORD name field contains COMMENT, HISTORY, CONTINUE, or if the first 8 characters of the template line are blanks. More than one Header-Data Unit (HDU) may be defined in the template file. The start of an HDU definition is denoted with a SIMPLE or XTENSION template line: 1) SIMPLE begins a Primary HDU definition. SIMPLE may only appear as the first keyword in the template file. If the template file begins with XTENSION instead of SIMPLE, then a default empty Primary HDU is created, and the template is then assumed to define the keywords starting with the first extension following the Primary HDU. 2) XTENSION marks the beginning of a new extension HDU definition. The previous HDU will be closed at this point and processing of the next extension begins. \section{Auto-indexing of Keywords} If a template keyword name ends with a "\#" character, it is said to be 'auto-indexed'. Each "\#" character will be replaced by the current integer index value, which gets reset = 1 at the start of each new HDU in the file (or 7 in the special case of a GROUP definition). The FIRST indexed keyword in each template HDU definition is used as the 'incrementor'; each subsequent occurrence of this SAME keyword will cause the index value to be incremented. This behavior can be rather subtle, as illustrated in the following examples in which the TTYPE keyword is the incrementor in both cases: \begin{verbatim} TTYPE# = TIME TFORM# = 1D TTYPE# = RATE TFORM# = 1E \end{verbatim} will create TTYPE1, TFORM1, TTYPE2, and TFORM2 keywords. But if the template looks like, \begin{verbatim} TTYPE# = TIME TTYPE# = RATE TFORM# = 1D TFORM# = 1E \end{verbatim} this results in a FITS files with TTYPE1, TTYPE2, TFORM2, and TFORM2, which is probably not what was intended! \section{Template Parser Directives} In addition to the template lines which define individual keywords, the template parser recognizes 3 special directives which are each preceded by the backslash character: \verb+ \include, \group+, and \verb+ \end+. The 'include' directive must be followed by a filename. It forces the parser to temporarily stop reading the current template file and begin reading the include file. Once the parser reaches the end of the include file it continues parsing the current template file. Include files can be nested, and HDU definitions can span multiple template files. The start of a GROUP definition is denoted with the 'group' directive, and the end of a GROUP definition is denoted with the 'end' directive. Each GROUP contains 0 or more member blocks (HDUs or GROUPs). Member blocks of type GROUP can contain their own member blocks. The GROUP definition itself occupies one FITS file HDU of special type (GROUP HDU), so if a template specifies 1 group with 1 member HDU like: \begin{verbatim} \group grpdescr = 'demo' xtension bintable # this bintable has 0 cols, 0 rows \end \end{verbatim} then the parser creates a FITS file with 3 HDUs : \begin{verbatim} 1) dummy PHDU 2) GROUP HDU (has 1 member, which is bintable in HDU number 3) 3) bintable (member of GROUP in HDU number 2) \end{verbatim} Technically speaking, the GROUP HDU is a BINTABLE with 6 columns. Applications can define additional columns in a GROUP HDU using TFORMn and TTYPEn (where n is 7, 8, ....) keywords or their auto-indexing equivalents. For a more complicated example of a template file using the group directives, look at the sample.tpl file that is included in the CFITSIO distribution. \section{Formal Template Syntax} The template syntax can formally be defined as follows: \begin{verbatim} TEMPLATE = BLOCK [ BLOCK ... ] BLOCK = { HDU | GROUP } GROUP = \GROUP [ BLOCK ... ] \END HDU = XTENSION [ LINE ... ] { XTENSION | \GROUP | \END | EOF } LINE = [ KEYWORD [ = ] ] [ VALUE ] [ / COMMENT ] X ... - X can be present 1 or more times { X | Y } - X or Y [ X ] - X is optional \end{verbatim} At the topmost level, the template defines 1 or more template blocks. Blocks can be either HDU (Header Data Unit) or a GROUP. For each block the parser creates 1 (or more for GROUPs) FITS file HDUs. \section{Errors} In general the fits\_execute\_template() function tries to be as atomic as possible, so either everything is done or nothing is done. If an error occurs during parsing of the template, fits\_execute\_template() will (try to) delete the top level BLOCK (with all its children if any) in which the error occurred, then it will stop reading the template file and it will return with an error. \section{Examples} 1. This template file will create a 200 x 300 pixel image, with 4-byte integer pixel values, in the primary HDU: \begin{verbatim} SIMPLE = T BITPIX = 32 NAXIS = 2 / number of dimensions NAXIS1 = 100 / length of first axis NAXIS2 = 200 / length of second axis OBJECT = NGC 253 / name of observed object \end{verbatim} The allowed values of BITPIX are 8, 16, 32, -32, or -64, representing, respectively, 8-bit integer, 16-bit integer, 32-bit integer, 32-bit floating point, or 64 bit floating point pixels. 2. To create a FITS table, the template first needs to include XTENSION = TABLE or BINTABLE to define whether it is an ASCII or binary table, and NAXIS2 to define the number of rows in the table. Two template lines are then needed to define the name (TTYPEn) and FITS data format (TFORMn) of the columns, as in this example: \begin{verbatim} xtension = bintable naxis2 = 40 ttype# = Name tform# = 10a ttype# = Npoints tform# = j ttype# = Rate tunit# = counts/s tform# = e \end{verbatim} The above example defines a null primary array followed by a 40-row binary table extension with 3 columns called 'Name', 'Npoints', and 'Rate', with data formats of '10A' (ASCII character string), '1J' (integer) and '1E' (floating point), respectively. Note that the other required FITS keywords (BITPIX, NAXIS, NAXIS1, PCOUNT, GCOUNT, TFIELDS, and END) do not need to be explicitly defined in the template because their values can be inferred from the other keywords in the template. This example also illustrates that the templates are generally case-insensitive (the keyword names and TFORMn values are converted to upper-case in the FITS file) and that string keyword values generally do not need to be enclosed in quotes. \chapter{ Summary of all FITSIO User-Interface Subroutines } Error Status Routines page~\pageref{FTVERS} \begin{verbatim} FTVERS( > version) FTGERR(status, > errtext) FTGMSG( > errmsg) FTRPRT (stream, > status) FTPMSG(errmsg) FTPMRK FTCMSG FTCMRK \end{verbatim} FITS File Open and Close Subroutines: page~\pageref{FTOPEN} \begin{verbatim} FTOPEN(unit,filename,rwmode, > blocksize,status) FTDKOPN(unit,filename,rwmode, > blocksize,status) FTNOPN(unit,filename,rwmode, > status) FTDOPN(unit,filename,rwmode, > status) FTTOPN(unit,filename,rwmode, > status) FTIOPN(unit,filename,rwmode, > status) FTREOPEN(unit, > newunit, status) FTINIT(unit,filename,blocksize, > status) FTDKINIT(unit,filename,blocksize, > status) FTTPLT(unit, filename, tplfilename, > status) FTFLUS(unit, > status) FTCLOS(unit, > status) FTDELT(unit, > status) FTGIOU( > iounit, status) FTFIOU(iounit, > status) CFITS2Unit(fitsfile *ptr) (C routine) CUnit2FITS(int unit) (C routine) FTEXTN(filename, > nhdu, status) FTFLNM(unit, > filename, status) FTFLMD(unit, > iomode, status) FTURLT(unit, > urltype, status) FTIURL(filename, > filetype, infile, outfile, extspec, filter, binspec, colspec, status) FTRTNM(filename, > rootname, status) FTEXIST(filename, > exist, status) \end{verbatim} HDU-Level Operations: page~\pageref{FTMAHD} \begin{verbatim} FTMAHD(unit,nhdu, > hdutype,status) FTMRHD(unit,nmove, > hdutype,status) FTGHDN(unit, > nhdu) FTMNHD(unit, hdutype, extname, extver, > status) FTGHDT(unit, > hdutype, status) FTTHDU(unit, > hdunum, status) FTCRHD(unit, > status) FTIIMG(unit,bitpix,naxis,naxes, > status) FTITAB(unit,rowlen,nrows,tfields,ttype,tbcol,tform,tunit,extname, > status) FTIBIN(unit,nrows,tfields,ttype,tform,tunit,extname,varidat > status) FTRSIM(unit,bitpix,naxis,naxes,status) FTDHDU(unit, > hdutype,status) FTCPFL(iunit,ounit,previous, current, following, > status) FTCOPY(iunit,ounit,morekeys, > status) FTCPHD(inunit, outunit, > status) FTCPDT(iunit,ounit, > status) \end{verbatim} Subroutines to specify or modify the structure of the CHDU: page~\pageref{FTRDEF} \begin{verbatim} FTRDEF(unit, > status) (DEPRECATED) FTPDEF(unit,bitpix,naxis,naxes,pcount,gcount, > status) (DEPRECATED) FTADEF(unit,rowlen,tfields,tbcol,tform,nrows > status) (DEPRECATED) FTBDEF(unit,tfields,tform,varidat,nrows > status) (DEPRECATED) FTDDEF(unit,bytlen, > status) (DEPRECATED) FTPTHP(unit,theap, > status) \end{verbatim} Header Space and Position Subroutines: page~\pageref{FTHDEF} \begin{verbatim} FTHDEF(unit,morekeys, > status) FTGHSP(iunit, > keysexist,keysadd,status) FTGHPS(iunit, > keysexist,key_no,status) \end{verbatim} Read or Write Standard Header Subroutines: page~\pageref{FTPHPR} \begin{verbatim} FTPHPS(unit,bitpix,naxis,naxes, > status) FTPHPR(unit,simple,bitpix,naxis,naxes,pcount,gcount,extend, > status) FTGHPR(unit,maxdim, > simple,bitpix,naxis,naxes,pcount,gcount,extend, status) FTPHTB(unit,rowlen,nrows,tfields,ttype,tbcol,tform,tunit,extname, > status) FTGHTB(unit,maxdim, > rowlen,nrows,tfields,ttype,tbcol,tform,tunit, extname,status) FTPHBN(unit,nrows,tfields,ttype,tform,tunit,extname,varidat > status) FTGHBN(unit,maxdim, > nrows,tfields,ttype,tform,tunit,extname,varidat, status) \end{verbatim} Write Keyword Subroutines: page~\pageref{FTPREC} \begin{verbatim} FTPREC(unit,card, > status) FTPCOM(unit,comment, > status) FTPHIS(unit,history, > status) FTPDAT(unit, > status) FTPKY[JKLS](unit,keyword,keyval,comment, > status) FTPKY[EDFG](unit,keyword,keyval,decimals,comment, > status) FTPKLS(unit,keyword,keyval,comment, > status) FTPLSW(unit, > status) FTPKYU(unit,keyword,comment, > status) FTPKN[JKLS](unit,keyroot,startno,no_keys,keyvals,comments, > status) FTPKN[EDFG](unit,keyroot,startno,no_keys,keyvals,decimals,comments, > status) FTCPKYinunit, outunit, innum, outnum, keyroot, > status) FTPKYT(unit,keyword,intval,dblval,comment, > status) FTPKTP(unit, filename, > status) FTPUNT(unit,keyword,units, > status) \end{verbatim} Insert Keyword Subroutines: page~\pageref{FTIREC} \begin{verbatim} FTIREC(unit,key_no,card, > status) FTIKY[JKLS](unit,keyword,keyval,comment, > status) FTIKLS(unit,keyword,keyval,comment, > status) FTIKY[EDFG](unit,keyword,keyval,decimals,comment, > status) FTIKYU(unit,keyword,comment, > status) \end{verbatim} Read Keyword Subroutines: page~\pageref{FTGREC} \begin{verbatim} FTGREC(unit,key_no, > card,status) FTGKYN(unit,key_no, > keyword,value,comment,status) FTGCRD(unit,keyword, > card,status) FTGNXK(unit,inclist,ninc,exclist,nexc, > card,status) FTGKEY(unit,keyword, > value,comment,status) FTGKY[EDJKLS](unit,keyword, > keyval,comment,status) FTGKSL(unit,keyword, > length,status) FTGSKY(unit,keyword,firstchar,maxchar,> keyval,length,comment,status) FTGKN[EDJKLS](unit,keyroot,startno,max_keys, > keyvals,nfound,status) FTGKYT(unit,keyword, > intval,dblval,comment,status) FTGUNT(unit,keyword, > units,status) \end{verbatim} Modify Keyword Subroutines: page~\pageref{FTMREC} \begin{verbatim} FTMREC(unit,key_no,card, > status) FTMCRD(unit,keyword,card, > status) FTMNAM(unit,oldkey,keyword, > status) FTMCOM(unit,keyword,comment, > status) FTMKY[JKLS](unit,keyword,keyval,comment, > status) FTMKLS(unit,keyword,keyval,comment, > status) FTMKY[EDFG](unit,keyword,keyval,decimals,comment, > status) FTMKYU(unit,keyword,comment, > status) \end{verbatim} Update Keyword Subroutines: page~\pageref{FTUCRD} \begin{verbatim} FTUCRD(unit,keyword,card, > status) FTUKY[JKLS](unit,keyword,keyval,comment, > status) FTUKLS(unit,keyword,keyval,comment, > status) FTUKY[EDFG](unit,keyword,keyval,decimals,comment, > status) FTUKYU(unit,keyword,comment, > status) \end{verbatim} Delete Keyword Subroutines: page~\pageref{FTDREC} \begin{verbatim} FTDREC(unit,key_no, > status) FTDKEY(unit,keyword, > status) \end{verbatim} Define Data Scaling Parameters and Undefined Pixel Flags: page~\pageref{FTPSCL} \begin{verbatim} FTPSCL(unit,bscale,bzero, > status) FTTSCL(unit,colnum,tscal,tzero, > status) FTPNUL(unit,blank, > status) FTSNUL(unit,colnum,snull > status) FTTNUL(unit,colnum,tnull > status) \end{verbatim} FITS Primary Array or IMAGE Extension I/O Subroutines: page~\pageref{FTPPR} \begin{verbatim} FTGIDT(unit, > bitpix,status) FTGIET(unit, > bitpix,status) FTGIDM(unit, > naxis,status) FTGISZ(unit, maxdim, > naxes,status) FTGIPR(unit, maxdim, > bitpix,naxis,naxes,status) FTPPR[BIJKED](unit,group,fpixel,nelements,values, > status) FTPPN[BIJKED](unit,group,fpixel,nelements,values,nullval > status) FTPPRU(unit,group,fpixel,nelements, > status) FTGPV[BIJKED](unit,group,fpixel,nelements,nullval, > values,anyf,status) FTGPF[BIJKED](unit,group,fpixel,nelements, > values,flagvals,anyf,status) FTPGP[BIJKED](unit,group,fparm,nparm,values, > status) FTGGP[BIJKED](unit,group,fparm,nparm, > values,status) FTP2D[BIJKED](unit,group,dim1,naxis1,naxis2,image, > status) FTP3D[BIJKED](unit,group,dim1,dim2,naxis1,naxis2,naxis3,cube, > status) FTG2D[BIJKED](unit,group,nullval,dim1,naxis1,naxis2, > image,anyf,status) FTG3D[BIJKED](unit,group,nullval,dim1,dim2,naxis1,naxis2,naxis3, > cube,anyf,status) FTPSS[BIJKED](unit,group,naxis,naxes,fpixels,lpixels,array, > status) FTGSV[BIJKED](unit,group,naxis,naxes,fpixels,lpixels,incs,nullval, > array,anyf,status) FTGSF[BIJKED](unit,group,naxis,naxes,fpixels,lpixels,incs, > array,flagvals,anyf,status) \end{verbatim} Table Column Information Subroutines: page~\pageref{FTGCNO} \begin{verbatim} FTGNRW(unit, > nrows, status) FTGNCL(unit, > ncols, status) FTGCNO(unit,casesen,coltemplate, > colnum,status) FTGCNN(unit,casesen,coltemplate, > colnam,colnum,status) FTGTCL(unit,colnum, > datacode,repeat,width,status) FTEQTY(unit,colnum, > datacode,repeat,width,status) FTGCDW(unit,colnum, > dispwidth,status) FTGACL(unit,colnum, > ttype,tbcol,tunit,tform,tscal,tzero,snull,tdisp,status) FTGBCL(unit,colnum, > ttype,tunit,datatype,repeat,tscal,tzero,tnull,tdisp,status) FTPTDM(unit,colnum,naxis,naxes, > status) FTGTDM(unit,colnum,maxdim, > naxis,naxes,status) FTDTDM(unit,tdimstr,colnum,maxdim, > naxis,naxes, status) FTGRSZ(unit, > nrows,status) \end{verbatim} Low-Level Table Access Subroutines: page~\pageref{FTGTBS} \begin{verbatim} FTGTBS(unit,frow,startchar,nchars, > string,status) FTPTBS(unit,frow,startchar,nchars,string, > status) FTGTBB(unit,frow,startchar,nchars, > array,status) FTPTBB(unit,frow,startchar,nchars,array, > status) \end{verbatim} Edit Rows or Columns page~\pageref{FTIROW} \begin{verbatim} FTIROW(unit,frow,nrows, > status) FTDROW(unit,frow,nrows, > status) FTDRRG(unit,rowrange, > status) FTDRWS(unit,rowlist,nrows, > status) FTICOL(unit,colnum,ttype,tform, > status) FTICLS(unit,colnum,ncols,ttype,tform, > status) FTMVEC(unit,colnum,newveclen, > status) FTDCOL(unit,colnum, > status) FTCPCL(inunit,outunit,incolnum,outcolnum,createcol, > status); \end{verbatim} Read and Write Column Data Routines page~\pageref{FTPCLS} \begin{verbatim} FTPCL[SLBIJKEDCM](unit,colnum,frow,felem,nelements,values, > status) FTPCN[BIJKED](unit,colnum,frow,felem,nelements,values,nullval > status) FTPCLX(unit,colnum,frow,fbit,nbit,lray, > status) FTPCLU(unit,colnum,frow,felem,nelements, > status) FTGCL(unit,colnum,frow,felem,nelements, > values,status) FTGCV[SBIJKEDCM](unit,colnum,frow,felem,nelements,nullval, > values,anyf,status) FTGCF[SLBIJKEDCM](unit,colnum,frow,felem,nelements, > values,flagvals,anyf,status) FTGSV[BIJKED](unit,colnum,naxis,naxes,fpixels,lpixels,incs,nullval, > array,anyf,status) FTGSF[BIJKED](unit,colnum,naxis,naxes,fpixels,lpixels,incs, > array,flagvals,anyf,status) FTGCX(unit,colnum,frow,fbit,nbit, > lray,status) FTGCX[IJD](unit,colnum,frow,nrows,fbit,nbit, > array,status) FTGDES(unit,colnum,rownum, > nelements,offset,status) FTPDES(unit,colnum,rownum,nelements,offset, > status) \end{verbatim} Row Selection and Calculator Routines: page~\pageref{FTFROW} \begin{verbatim} FTFROW(unit,expr,firstrow, nrows, > n_good_rows, row_status, status) FTFFRW(unit, expr, > rownum, status) FTSROW(inunit, outunit, expr, > status ) FTCROW(unit,datatype,expr,firstrow,nelements,nulval, > array,anynul,status) FTCALC(inunit, expr, outunit, parName, parInfo, > status) FTCALC_RNG(inunit, expr, outunit, parName, parInfo, nranges, firstrow, lastrow, > status) FTTEXP(unit, expr, > datatype, nelem, naxis, naxes, status) \end{verbatim} Celestial Coordinate System Subroutines: page~\pageref{FTGICS} \begin{verbatim} FTGICS(unit, > xrval,yrval,xrpix,yrpix,xinc,yinc,rot,coordtype,status) FTGTCS(unit,xcol,ycol, > xrval,yrval,xrpix,yrpix,xinc,yinc,rot,coordtype,status) FTWLDP(xpix,ypix,xrval,yrval,xrpix,yrpix,xinc,yinc,rot, coordtype, > xpos,ypos,status) FTXYPX(xpos,ypos,xrval,yrval,xrpix,yrpix,xinc,yinc,rot, coordtype, > xpix,ypix,status) \end{verbatim} File Checksum Subroutines: page~\pageref{FTPCKS} \begin{verbatim} FTPCKS(unit, > status) FTUCKS(unit, > status) FTVCKS(unit, > dataok,hduok,status) FTGCKS(unit, > datasum,hdusum,status) FTESUM(sum,complement, > checksum) FTDSUM(checksum,complement, > sum) \end{verbatim} Time and Date Utility Subroutines: page~\pageref{FTGSDT} \begin{verbatim} FTGSDT( > day, month, year, status ) FTGSTM(> datestr, timeref, status) FTDT2S( year, month, day, > datestr, status) FTTM2S( year, month, day, hour, minute, second, decimals, > datestr, status) FTS2DT(datestr, > year, month, day, status) FTS2TM(datestr, > year, month, day, hour, minute, second, status) \end{verbatim} General Utility Subroutines: page~\pageref{FTGHAD} \begin{verbatim} FTGHAD(unit, > curaddr,nextaddr) FTUPCH(string) FTCMPS(str_template,string,casesen, > match,exact) FTTKEY(keyword, > status) FTTREC(card, > status) FTNCHK(unit, > status) FTGKNM(unit, > keyword, keylength, status) FTMKKY(keyword, value,comment, > card, status) FTPSVC(card, > value,comment,status) FTKEYN(keyroot,seq_no, > keyword,status) FTNKEY(seq_no,keyroot, > keyword,status) FTDTYP(value, > dtype,status) class = FTGKCL(card) FTASFM(tform, > datacode,width,decimals,status) FTBNFM(tform, > datacode,repeat,width,status) FTGABC(tfields,tform,space, > rowlen,tbcol,status) FTGTHD(template, > card,hdtype,status) FTRWRG(rowlist, maxrows, maxranges, > numranges, rangemin, rangemax, status) \end{verbatim} \chapter{ Parameter Definitions } \begin{verbatim} anyf - (logical) set to TRUE if any of the returned data values are undefined array - (any datatype except character) array of bytes to be read or written. bitpix - (integer) bits per pixel: 8, 16, 32, -32, or -64 blank - (integer) value used for undefined pixels in integer primary array blank - (integer*8) value used for undefined pixels in integer primary array blocksize - (integer) 2880-byte logical record blocking factor (if 0 < blocksize < 11) or the actual block size in bytes (if 10 < blocksize < 28800). As of version 3.3 of FITSIO, blocksizes greater than 2880 are no longer supported. bscale - (double precision) scaling factor for the primary array bytlen - (integer) length of the data unit, in bytes bzero - (double precision) zero point for primary array scaling card - (character*80) header record to be read or written casesen - (logical) will string matching be case sensitive? checksum - (character*16) encoded checksum string colname - (character) ASCII name of the column colnum - (integer) number of the column (first column = 1) coltemplate - (character) template string to be matched to column names comment - (character) the keyword comment field comments - (character array) keyword comment fields compid - (integer) the type of computer that the program is running on complement - (logical) should the checksum be complemented? coordtype - (character) type of coordinate projection (-SIN, -TAN, -ARC, -NCP, -GLS, -MER, or -AIT) cube - 3D data cube of the appropriate datatype curaddr - (integer) starting address (in bytes) of the CHDU current - (integer) if not equal to 0, copy the current HDU datacode - (integer) symbolic code of the binary table column datatype dataok - (integer) was the data unit verification successful (=1) or not (= -1). Equals zero if the DATASUM keyword is not present. datasum - (double precision) 32-bit 1's complement checksum for the data unit datatype - (character) datatype (format) of the binary table column datestr - (string) FITS date/time string: 'YYYY-MM-DDThh:mm:ss.ddd', 'YYYY-MM-dd', or 'dd/mm/yy' day - (integer) current day of the month dblval - (double precision) fractional part of the keyword value decimals - (integer) number of decimal places to be displayed dim1 - (integer) actual size of the first dimension of the image or cube array dim2 - (integer) actual size of the second dimension of the cube array dispwidth - (integer) - the display width (length of string) for a column dtype - (character) datatype of the keyword ('C', 'L', 'I', or 'F') C = character string L = logical I = integer F = floating point number errmsg - (character*80) oldest error message on the internal stack errtext - (character*30) descriptive error message corresponding to error number casesen - (logical) true if column name matching is case sensitive exact - (logical) do the strings match exactly, or were wildcards used? exclist (character array) list of names to be excluded from search exists - flag indicating whether the file or compressed file exists on disk extend - (logical) true if there may be extensions following the primary data extname - (character) value of the EXTNAME keyword (if not blank) fbit - (integer) first bit in the field to be read or written felem - (integer) first pixel of the element vector (ignored for ASCII tables) filename - (character) name of the FITS file flagvals - (logical array) True if corresponding data element is undefined following - (integer) if not equal to 0, copy all following HDUs in the input file fparm - (integer) sequence number of the first group parameter to read or write fpixel - (integer) the first pixel position fpixels - (integer array) the first included pixel in each dimension frow - (integer) beginning row number (first row of table = 1) frowll - (integer*8) beginning row number (first row of table = 1) gcount - (integer) value of the GCOUNT keyword (usually = 1) group - (integer) sequence number of the data group (=0 for non-grouped data) hdtype - (integer) header record type: -1=delete; 0=append or replace; 1=append; 2=this is the END keyword hduok - (integer) was the HDU verification successful (=1) or not (= -1). Equals zero if the CHECKSUM keyword is not present. hdusum - (double precision) 32 bit 1's complement checksum for the entire CHDU hdutype - (integer) type of HDU: 0 = primary array or IMAGE, 1 = ASCII table, 2 = binary table, -1 = any HDU type or unknown type history - (character) the HISTORY keyword comment string hour - (integer) hour from 0 - 23 image - 2D image of the appropriate datatype inclist (character array) list of names to be included in search incs - (integer array) sampling interval for pixels in each FITS dimension intval - (integer) integer part of the keyword value iounit - (integer) value of an unused I/O unit number iunit - (integer) logical unit number associated with the input FITS file, 1-300 key_no - (integer) sequence number (starting with 1) of the keyword record keylength - (integer) length of the keyword name keyroot - (character) root string for the keyword name keysadd -(integer) number of new keyword records which can fit in the CHU keysexist - (integer) number of existing keyword records in the CHU keyval - value of the keyword in the appropriate datatype keyvals - (array) value of the keywords in the appropriate datatype keyword - (character*8) name of a keyword lray - (logical array) array of logical values corresponding to the bit array lpixels - (integer array) the last included pixel in each dimension match - (logical) do the 2 strings match? maxdim - (integer) dimensioned size of the NAXES, TTYPE, TFORM or TUNIT arrays max_keys - (integer) maximum number of keywords to search for minute - (integer) minute of an hour (0 - 59) month - (integer) current month of the year (1 - 12) morekeys - (integer) will leave space in the header for this many more keywords naxes - (integer array) size of each dimension in the FITS array naxesll - (integer*8 array) size of each dimension in the FITS array naxis - (integer) number of dimensions in the FITS array naxis1 - (integer) length of the X/first axis of the FITS array naxis2 - (integer) length of the Y/second axis of the FITS array naxis3 - (integer) length of the Z/third axis of the FITS array nbit - (integer) number of bits in the field to read or write nchars - (integer) number of characters to read and return ncols - (integer) number of columns nelements - (integer) number of data elements to read or write nelementsll - (integer*8) number of data elements to read or write nexc (integer) number of names in the exclusion list (may = 0) nhdu - (integer) absolute number of the HDU (1st HDU = 1) ninc (integer) number of names in the inclusion list nmove - (integer) number of HDUs to move (+ or -), relative to current position nfound - (integer) number of keywords found (highest keyword number) no_keys - (integer) number of keywords to write in the sequence nparm - (integer) number of group parameters to read or write nrows - (integer) number of rows in the table nrowsll - (integer*8) number of rows in the table nullval - value to represent undefined pixels, of the appropriate datatype nextaddr - (integer) starting address (in bytes) of the HDU following the CHDU offset - (integer) byte offset in the heap to the first element of the array offsetll - (integer*8) byte offset in the heap to the first element of the array oldkey - (character) old name of keyword to be modified ounit - (integer) logical unit number associated with the output FITS file 1-300 pcount - (integer) value of the PCOUNT keyword (usually = 0) previous - (integer) if not equal to 0, copy all previous HDUs in the input file repeat - (integer) length of element vector (e.g. 12J); ignored for ASCII table rot - (double precision) celestial coordinate rotation angle (degrees) rowlen - (integer) length of a table row, in characters or bytes rowlenll - (integer*8) length of a table row, in characters or bytes rowlist - (integer array) list of row numbers to be deleted in increasing order rownum - (integer) number of the row (first row = 1) rowrange- (string) list of rows or row ranges to be deleted rwmode - (integer) file access mode: 0 = readonly, 1 = readwrite second (double)- second within minute (0 - 60.9999999999) (leap second!) seq_no - (integer) the sequence number to append to the keyword root name simple - (logical) does the FITS file conform to all the FITS standards snull - (character) value used to represent undefined values in ASCII table space - (integer) number of blank spaces to leave between ASCII table columns startchar - (integer) first character in the row to be read startno - (integer) value of the first keyword sequence number (usually 1) status - (integer) returned error status code (0 = OK) str_template (character) template string to be matched to reference string stream - (character) output stream for the report: either 'STDOUT' or 'STDERR' string - (character) character string sum - (double precision) 32 bit unsigned checksum value tbcol - (integer array) column number of the first character in the field(s) tdisp - (character) Fortran type display format for the table column template-(character) template string for a FITS header record tfields - (integer) number of fields (columns) in the table tform - (character array) format of the column(s); allowed values are: For ASCII tables: Iw, Aw, Fww.dd, Eww.dd, or Dww.dd For binary tables: rL, rX, rB, rI, rJ, rA, rAw, rE, rD, rC, rM where 'w'=width of the field, 'd'=no. of decimals, 'r'=repeat count Note that the 'rAw' form is non-standard extension to the TFORM keyword syntax that is not specifically defined in the Binary Tables definition document. theap - (integer) zero indexed byte offset of starting address of the heap relative to the beginning of the binary table data tnull - (integer) value used to represent undefined values in binary table tnullll - (integer*8) value used to represent undefined values in binary table ttype - (character array) label for table column(s) tscal - (double precision) scaling factor for table column tunit - (character array) physical unit for table column(s) tzero - (double precision) scaling zero point for table column unit - (integer) logical unit number associated with the FITS file (1-300) units - (character) the keyword units string (e.g., 'km/s') value - (character) the keyword value string values - array of data values of the appropriate datatype varidat - (integer) size in bytes of the 'variable length data area' following the binary table data (usually = 0) version - (real) current revision number of the library width - (integer) width of the character string field xcol - (integer) number of the column containing the X coordinate values xinc - (double precision) X axis coordinate increment at reference pixel (deg) xpix - (double precision) X axis pixel location xpos - (double precision) X axis celestial coordinate (usually RA) (deg) xrpix - (double precision) X axis reference pixel array location xrval - (double precision) X axis coordinate value at the reference pixel (deg) ycol - (integer) number of the column containing the X coordinate values year - (integer) last 2 digits of the year (00 - 99) yinc - (double precision) Y axis coordinate increment at reference pixel (deg) ypix - (double precision) y axis pixel location ypos - (double precision) y axis celestial coordinate (usually DEC) (deg) yrpix - (double precision) Y axis reference pixel array location yrval - (double precision) Y axis coordinate value at the reference pixel (deg) \end{verbatim} \chapter{ FITSIO Error Status Codes } \begin{verbatim} Status codes in the range -99 to -999 and 1 to 999 are reserved for future FITSIO use. 0 OK, no error 101 input and output files are the same 103 too many FITS files open at once; all internal buffers full 104 error opening existing file 105 error creating new FITS file; (does a file with this name already exist?) 106 error writing record to FITS file 107 end-of-file encountered while reading record from FITS file 108 error reading record from file 110 error closing FITS file 111 internal array dimensions exceeded 112 Cannot modify file with readonly access 113 Could not allocate memory 114 illegal logical unit number; must be between 1 - 300, inclusive 115 NULL input pointer to routine 116 error seeking position in file 121 invalid URL prefix on file name 122 tried to register too many IO drivers 123 driver initialization failed 124 matching driver is not registered 125 failed to parse input file URL 126 parse error in range list 151 bad argument in shared memory driver 152 null pointer passed as an argument 153 no more free shared memory handles 154 shared memory driver is not initialized 155 IPC error returned by a system call 156 no memory in shared memory driver 157 resource deadlock would occur 158 attempt to open/create lock file failed 159 shared memory block cannot be resized at the moment 201 header not empty; can't write required keywords 202 specified keyword name was not found in the header 203 specified header record number is out of bounds 204 keyword value field is blank 205 keyword value string is missing the closing quote character 206 illegal indexed keyword name (e.g. 'TFORM1000') 207 illegal character in keyword name or header record 208 keyword does not have expected name. Keyword out of sequence? 209 keyword does not have expected integer value 210 could not find the required END header keyword 211 illegal BITPIX keyword value 212 illegal NAXIS keyword value 213 illegal NAXISn keyword value: must be 0 or positive integer 214 illegal PCOUNT keyword value 215 illegal GCOUNT keyword value 216 illegal TFIELDS keyword value 217 negative ASCII or binary table width value (NAXIS1) 218 negative number of rows in ASCII or binary table (NAXIS2) 219 column name (TTYPE keyword) not found 220 illegal SIMPLE keyword value 221 could not find the required SIMPLE header keyword 222 could not find the required BITPIX header keyword 223 could not find the required NAXIS header keyword 224 could not find all the required NAXISn keywords in the header 225 could not find the required XTENSION header keyword 226 the CHDU is not an ASCII table extension 227 the CHDU is not a binary table extension 228 could not find the required PCOUNT header keyword 229 could not find the required GCOUNT header keyword 230 could not find the required TFIELDS header keyword 231 could not find all the required TBCOLn keywords in the header 232 could not find all the required TFORMn keywords in the header 233 the CHDU is not an IMAGE extension 234 illegal TBCOL keyword value; out of range 235 this operation only allowed for ASCII or BINARY table extension 236 column is too wide to fit within the specified width of the ASCII table 237 the specified column name template matched more than one column name 241 binary table row width is not equal to the sum of the field widths 251 unrecognizable type of FITS extension 252 unrecognizable FITS record 253 END keyword contains non-blank characters in columns 9-80 254 Header fill area contains non-blank characters 255 Data fill area contains non-blank on non-zero values 261 unable to parse the TFORM keyword value string 262 unrecognizable TFORM datatype code 263 illegal TDIMn keyword value 301 illegal HDU number; less than 1 or greater than internal buffer size 302 column number out of range (1 - 999) 304 attempt to move to negative file record number 306 attempted to read or write a negative number of bytes in the FITS file 307 illegal starting row number for table read or write operation 308 illegal starting element number for table read or write operation 309 attempted to read or write character string in non-character table column 310 attempted to read or write logical value in non-logical table column 311 illegal ASCII table TFORM format code for attempted operation 312 illegal binary table TFORM format code for attempted operation 314 value for undefined pixels has not been defined 317 attempted to read or write descriptor in a non-descriptor field 320 number of array dimensions out of range 321 first pixel number is greater than the last pixel number 322 attempt to set BSCALE or TSCALn scaling parameter = 0 323 illegal axis length less than 1 340 NOT_GROUP_TABLE 340 Grouping function error 341 HDU_ALREADY_MEMBER 342 MEMBER_NOT_FOUND 343 GROUP_NOT_FOUND 344 BAD_GROUP_ID 345 TOO_MANY_HDUS_TRACKED 346 HDU_ALREADY_TRACKED 347 BAD_OPTION 348 IDENTICAL_POINTERS 349 BAD_GROUP_ATTACH 350 BAD_GROUP_DETACH 360 NGP_NO_MEMORY malloc failed 361 NGP_READ_ERR read error from file 362 NGP_NUL_PTR null pointer passed as an argument. Passing null pointer as a name of template file raises this error 363 NGP_EMPTY_CURLINE line read seems to be empty (used internally) 364 NGP_UNREAD_QUEUE_FULL cannot unread more then 1 line (or single line twice) 365 NGP_INC_NESTING too deep include file nesting (infinite loop, template includes itself ?) 366 NGP_ERR_FOPEN fopen() failed, cannot open template file 367 NGP_EOF end of file encountered and not expected 368 NGP_BAD_ARG bad arguments passed. Usually means internal parser error. Should not happen 369 NGP_TOKEN_NOT_EXPECT token not expected here 401 error attempting to convert an integer to a formatted character string 402 error attempting to convert a real value to a formatted character string 403 cannot convert a quoted string keyword to an integer 404 attempted to read a non-logical keyword value as a logical value 405 cannot convert a quoted string keyword to a real value 406 cannot convert a quoted string keyword to a double precision value 407 error attempting to read character string as an integer 408 error attempting to read character string as a real value 409 error attempting to read character string as a double precision value 410 bad keyword datatype code 411 illegal number of decimal places while formatting floating point value 412 numerical overflow during implicit datatype conversion 413 error compressing image 414 error uncompressing image 420 error in date or time conversion 431 syntax error in parser expression 432 expression did not evaluate to desired type 433 vector result too large to return in array 434 data parser failed not sent an out column 435 bad data encounter while parsing column 436 parse error: output file not of proper type 501 celestial angle too large for projection 502 bad celestial coordinate or pixel value 503 error in celestial coordinate calculation 504 unsupported type of celestial projection 505 required celestial coordinate keywords not found 506 approximate wcs keyword values were returned \end{verbatim} \end{document} cfitsio-3.47/docs/fitsio.toc0000644000225700000360000001623513464573431015352 0ustar cagordonlhea\contentsline {chapter}{\numberline {1}Introduction }{1} \contentsline {chapter}{\numberline {2} Creating FITSIO/CFITSIO }{3} \contentsline {section}{\numberline {2.1}Building the Library}{3} \contentsline {section}{\numberline {2.2}Testing the Library}{6} \contentsline {section}{\numberline {2.3}Linking Programs with FITSIO}{7} \contentsline {section}{\numberline {2.4}Getting Started with FITSIO}{7} \contentsline {section}{\numberline {2.5}Example Program}{8} \contentsline {section}{\numberline {2.6}Legal Stuff}{9} \contentsline {section}{\numberline {2.7}Acknowledgments}{10} \contentsline {chapter}{\numberline {3} A FITS Primer }{13} \contentsline {chapter}{\numberline {4}FITSIO Conventions and Guidelines }{15} \contentsline {section}{\numberline {4.1}CFITSIO Size Limitations}{15} \contentsline {section}{\numberline {4.2}Multiple Access to the Same FITS File}{16} \contentsline {section}{\numberline {4.3}Current Header Data Unit (CHDU)}{16} \contentsline {section}{\numberline {4.4}Subroutine Names}{16} \contentsline {section}{\numberline {4.5}Subroutine Families and Datatypes}{17} \contentsline {section}{\numberline {4.6}Implicit Data Type Conversion}{17} \contentsline {section}{\numberline {4.7}Data Scaling}{18} \contentsline {section}{\numberline {4.8}Error Status Values and the Error Message Stack}{18} \contentsline {section}{\numberline {4.9}Variable-Length Array Facility in Binary Tables}{19} \contentsline {section}{\numberline {4.10}Support for IEEE Special Values}{20} \contentsline {section}{\numberline {4.11}When the Final Size of the FITS HDU is Unknown}{21} \contentsline {section}{\numberline {4.12}Local FITS Conventions supported by FITSIO}{21} \contentsline {subsection}{\numberline {4.12.1}Support for Long String Keyword Values.}{21} \contentsline {subsection}{\numberline {4.12.2}Arrays of Fixed-Length Strings in Binary Tables}{22} \contentsline {subsection}{\numberline {4.12.3}Keyword Units Strings}{23} \contentsline {subsection}{\numberline {4.12.4}HIERARCH Convention for Extended Keyword Names}{23} \contentsline {section}{\numberline {4.13}Optimizing Code for Maximum Processing Speed}{24} \contentsline {subsection}{\numberline {4.13.1}Background Information: How CFITSIO Manages Data I/O}{24} \contentsline {subsection}{\numberline {4.13.2}Optimization Strategies}{25} \contentsline {chapter}{\numberline {5} Basic Interface Routines }{29} \contentsline {section}{\numberline {5.1}FITSIO Error Status Routines }{29} \contentsline {section}{\numberline {5.2}File I/O Routines}{30} \contentsline {section}{\numberline {5.3}Keyword I/O Routines}{32} \contentsline {section}{\numberline {5.4}Data I/O Routines}{33} \contentsline {chapter}{\numberline {6} Advanced Interface Subroutines }{35} \contentsline {section}{\numberline {6.1}FITS File Open and Close Subroutines: }{35} \contentsline {section}{\numberline {6.2}HDU-Level Operations }{38} \contentsline {section}{\numberline {6.3}Define or Redefine the structure of the CHDU }{41} \contentsline {section}{\numberline {6.4}FITS Header I/O Subroutines}{43} \contentsline {subsection}{\numberline {6.4.1}Header Space and Position Routines }{43} \contentsline {subsection}{\numberline {6.4.2}Read or Write Standard Header Routines }{43} \contentsline {subsection}{\numberline {6.4.3}Write Keyword Subroutines }{45} \contentsline {subsection}{\numberline {6.4.4}Insert Keyword Subroutines }{47} \contentsline {subsection}{\numberline {6.4.5}Read Keyword Subroutines }{47} \contentsline {subsection}{\numberline {6.4.6}Modify Keyword Subroutines }{49} \contentsline {subsection}{\numberline {6.4.7}Update Keyword Subroutines }{50} \contentsline {subsection}{\numberline {6.4.8}Delete Keyword Subroutines }{51} \contentsline {section}{\numberline {6.5}Data Scaling and Undefined Pixel Parameters }{51} \contentsline {section}{\numberline {6.6}FITS Primary Array or IMAGE Extension I/O Subroutines }{52} \contentsline {section}{\numberline {6.7}FITS ASCII and Binary Table Data I/O Subroutines}{55} \contentsline {subsection}{\numberline {6.7.1}Column Information Subroutines }{55} \contentsline {subsection}{\numberline {6.7.2}Low-Level Table Access Subroutines }{58} \contentsline {subsection}{\numberline {6.7.3}Edit Rows or Columns }{59} \contentsline {subsection}{\numberline {6.7.4}Read and Write Column Data Routines }{60} \contentsline {section}{\numberline {6.8}Row Selection and Calculator Routines }{64} \contentsline {section}{\numberline {6.9}Celestial Coordinate System Subroutines }{65} \contentsline {section}{\numberline {6.10}File Checksum Subroutines }{67} \contentsline {section}{\numberline {6.11} Date and Time Utility Routines }{68} \contentsline {section}{\numberline {6.12}General Utility Subroutines }{69} \contentsline {chapter}{\numberline {7} The CFITSIO Iterator Function }{77} \contentsline {chapter}{\numberline {8} Extended File Name Syntax }{79} \contentsline {section}{\numberline {8.1}Overview}{79} \contentsline {section}{\numberline {8.2}Filetype}{82} \contentsline {subsection}{\numberline {8.2.1}Notes about HTTP proxy servers}{82} \contentsline {subsection}{\numberline {8.2.2}Notes about the stream filetype driver}{83} \contentsline {subsection}{\numberline {8.2.3}Notes about the gsiftp filetype}{84} \contentsline {subsection}{\numberline {8.2.4}Notes about the root filetype}{84} \contentsline {subsection}{\numberline {8.2.5}Notes about the shmem filetype:}{86} \contentsline {section}{\numberline {8.3}Base Filename}{86} \contentsline {section}{\numberline {8.4}Output File Name when Opening an Existing File}{88} \contentsline {section}{\numberline {8.5}Template File Name when Creating a New File}{90} \contentsline {section}{\numberline {8.6}Image Tile-Compression Specification}{90} \contentsline {section}{\numberline {8.7}HDU Location Specification}{90} \contentsline {section}{\numberline {8.8}Image Section}{91} \contentsline {section}{\numberline {8.9}Image Transform Filters}{92} \contentsline {section}{\numberline {8.10}Column and Keyword Filtering Specification}{94} \contentsline {section}{\numberline {8.11}Row Filtering Specification}{96} \contentsline {subsection}{\numberline {8.11.1}General Syntax}{97} \contentsline {subsection}{\numberline {8.11.2}Bit Masks}{99} \contentsline {subsection}{\numberline {8.11.3}Vector Columns}{100} \contentsline {subsection}{\numberline {8.11.4}Good Time Interval Filtering}{102} \contentsline {subsection}{\numberline {8.11.5}Spatial Region Filtering}{103} \contentsline {subsection}{\numberline {8.11.6}Example Row Filters}{105} \contentsline {section}{\numberline {8.12} Binning or Histogramming Specification}{106} \contentsline {chapter}{\numberline {9}Template Files }{109} \contentsline {section}{\numberline {9.1}Detailed Template Line Format}{109} \contentsline {section}{\numberline {9.2}Auto-indexing of Keywords}{110} \contentsline {section}{\numberline {9.3}Template Parser Directives}{111} \contentsline {section}{\numberline {9.4}Formal Template Syntax}{112} \contentsline {section}{\numberline {9.5}Errors}{112} \contentsline {section}{\numberline {9.6}Examples}{112} \contentsline {chapter}{\numberline {10} Summary of all FITSIO User-Interface Subroutines }{115} \contentsline {chapter}{\numberline {11} Parameter Definitions }{123} \contentsline {chapter}{\numberline {12} FITSIO Error Status Codes }{129} cfitsio-3.47/docs/fpackguide.pdf0000644000225700000360000217557213464573431016157 0ustar cagordonlhea%PDF-1.4 %äüöß 2 0 obj <> stream xœÍ[Y«ìÆ~Ÿ_¡gÌջÃÀY$CÞÈCÈS;;Á΃ÿ~ºªz©^Ôšsí@¸p¥®®õ«EóML¿^~žfÿÏ 9¹UN¿üýò§¯¦…«óôË—׋pê¶LNXÿ÷ãoÓ×»˜ä<}|ÿç»¶qw³VÙW ÿoVË™.»åŸŒyÈ»SÖ<ôÝÉÇUÜ_V§üR×]á’Õþ÷¿|üá²}\¾­ˆÚÜÔäfII0î±Üåö¸ê»œá¯Ö~‹tÁÜÍ쉱ž »ûµolíæ×jáÿõ¸:ú(÷ÇUÝ=axUÐ!µ:$̪››ìâ2w"iò¡ ÒðqH„gË;ì{¬švü(èãáÎf²NßÌp_s×ožÇg¿°[ÝFj¦ •Fû{ˆ^¥×c ¤ŠÕõÉéAJ(MÀ‘ìî¬Û“Z ‰@%Õì²Ø€æY±Þ,í#'¡q%äæŸàücôêÕMû‡ÂNV{•RNûs øº=ىɬëMWôWz ‡±Ćê_-PO: Å•G»£AEf & {~ïðøøgÿw[»´1rˆ…ÖÐ%§<#‚Lщä7¼àyÖÁáÖݺð ×¢püs¼-¦cZ\–•?çÖ±çº I åòû¹Hj`›A~}ÁVØ7Ú‹C…-ˆdÄãK ݤµé÷…؇_úüi¢YìMVRáÌßãsQñ<%¿›÷úæ}Ì ·EË»:"Y.p52(Û°·¤p‘, áye«‚Ikx~”´×YböŒ¤Ú‚hónåç1ø<¹ˆn,ò›.XÒ©,Õ ³Ìëì”a™á£OW†¤+’;O³˜ø‡ûu{ú‚ …ã{%õ&¯77ZãC~a †òwÒÛf)ÐjØ1(vúÃæÛ*£¯”–¾z%™ ãòǰÙO¦Bé˜Ú~Ú_1u`ëãE;2ÞL Ö ¿+YZéPÞfõî»’7Ò¹eó­¬·ë@ƒ]"Qr“ôÜøýd*áÁ}…£’²e–LEËhí§T¥ZsB(“-’wF$“ ÙYôlL"È’à-J—\Û€É2ûÃ-î, Žwy‡5^¦`ÛZØïP­¤m #"à%ROÔ²8JÌœÇ@)žõ­”s,X|‘+è¾!ÂÛ¸‡Ù#}³Y1{!öff±ÚÀ!¥f,‹dbÑòˆºþÎpxõ‚2ØÃ_’$ž; ˧^r<Ä—Äë„X?âl¹çˆ¿léñ'›X78­QȤ•[ФøŽ7½q~䈘8þúÓeöÿýZ0ëß\æé*ü¢Ÿ&±ï¦ðËÓw­ÎIˆ²£t>²Û64Ÿi¯Pmâ\Ôšl?Íá7ooIÆ ýpg‚¢ }}¬\VÈg“`¸ù£H¹»-DJþ×ê(˜ìÅ!ã ‘BËg¢K bÀ1'èg°S¬½Í–ð…—tˆ9àÙ*+òéL1ÞN³„Nì‹îÝëxÖÞ"ö%QLPµ‘Õ‘è¥CŸ¿4V8ã$;Ì6]" ÝÇk¡|µ½C-ä·`Š.”Z ç30î¦}¨8žÎí<š¡Ix¸Õ™A ¼É¿äL‰Å8I8¹Ê¡†êàTƒU¹âѸ–rÄßèè—À¡O#åÿ.”¨@0P´BpÏDâÏM÷E…ƒ»%‹ôºPœïçwQô(\÷v¹v·l:>Þ‡R¬èÀ.…S¸¢„öÿÂm¤G3­rA(ë—Ì|Þ¤¾Õâ/¬åõ3Ë«aÕĘžò‚„.LJi“fU­ìÛŠÂ á.f̬I5ž)^) Á9^&R ˜umm'CŠVÕô*Öä­¢OÃŒ%—™:ŸüšJæËÌ-,e7|Òì#'Kb¶¨«/¼À—¸€®o‰VyTX—ÐTh9Á:—ÒÞ PÑ »2æÍ>äð41Í(•9f"…u@k³½„Lšìå½vøg…Œ“t3W§†ª$][© 5èÏìYµhÚ‚sÏ¥!¯y韛æ¹XÊ¢RDØWÅIç}0Ùî;h¡ã¤üê9”…YõL%ÅÁw'§£è_îaš’gÖœTM¬KOUX´h€ ÷çÁ°j44ÎHÛ•QΖ¨øâ¥°hÚ-9;åÒYˆ=°u—lÚˆj©Eh“jPd!/1JÕ^™£å§P·+%›Bh’.Ë$Ë:²X&Uëi‰Qº7¶*⊄P zŸbSŸ¯6ÉÊs¶Ÿ´ š›òÒU–`ω{ARCÅA`oÀkæ,8´½ ãuã0õ{?‰Ô‘v?UëÛphæÄ’u<+e4ÉG„wÌxenãèNÉ¥ÍvGòT‹k"U›MÜÐTÀq‰]Ù¥ =¨¸àŸZæQÙƒ¤cmI ¤ 7ó³RÑTõ)í68÷+ùÓœ9è¶Êƒz=ójè àìƒÆÇŸRO*»‘¸)SÖ×Ó6[shY¬R’+yÌÃÏ}hic­1µÎM/ÑˆŽ«,ƒˆ‹·ør¤bvV¦ñ?J¨<¸o•÷Õ]•¦¢–Ú{ |¿³¼ynÊ”§qWädÙ39˜™¼ï[Úµð¨P¦ßŠ6À¨õÖ§ý¨JÑÍQߢÓb( ÚÝ–oñn¾­STŒ‰R®¶[ÙËc ¢™i¦”êô£Î  ëv’&y%tßâ¹Pª,Áº^'¯ ‡ïèèÅ-®*TùõCc a€#Jp±Ž¼£žAIÊXé„[àQx®ãÃ6ØÀÎLÌõ‡Tĸ% }KC3•gødþß·£ó"jú †É‹C‘ΠÓUʵ€v3L½.öP§­k{Xu lBÓ±‰FÜ‹ƒÔò­zW‚B¦:ðt1Ñàèš×ÂSÀk°NY~åÔÓEŽnŠÁñQ®É²Y¤5_JvËe<ñè¾0²ÉSó5ª±E¥Ï#Qï¾ã?§»%'[VOªM³Áh¯,×xª7Ïe’œc-¯S .›–¦ôIדäd“ÙP2Ã<'UøU{gå9Q‚ž²ÄÈkaEé+ÆÕ^ék(4=ßš¨Ó2ƒNþ “nDvìëêB¯›äLªsò™Ÿ=dYjf™Ô")Ëþˆ›Y¶2mÃ"¡°c½%}—­‹Ræ }ïÜG±¨m°WÕ†ªá|4Ô4MÏ&ÀO¶3U¿©ôkp´ÛNN™>,5,E ½`aT5­•ÓT5ìÔ‡<*Å—©Ò™aˆ¶¹쥘"â´Hž€ÜÊY‘lE¾ßН®>¨Z‘Ǫ# ?‘|& mÆmL+zf¢å,±|À*ƒ0W„œXÜ<·Æ>aqûÚÇxRm=Y¦-o)‰LtgõvD>WˆßË Lâ{¦mböÞy×Ôæ· ŠL8c’™ —¹PÛîPg޲,ø»£&L°Ï&¾1¦çÔ£düH¸bqm$I'i° ÷zYó(ÇÎýŠ[_ÖÏ€äªÊ0>¸ó´ÎÛzò#Õ¬v+˜:RpÞcv œÃnË  ]¾Vrr®à!]ÉÀýw¬È Åèt øe9AgˆàT—¬auöÛù=@%ÛŠ‰À'^uS4CDæN*ƒ³ò1Ï‚X“4)[ë3¡…$–•”èp“à›`×RÏËàv ŠèJ,£¯|ÐY ÒŠ6†Âwb“¢YTz"<ÃD±™2Š,B·/*wYz÷ur—ì;/]’Âòé½gïsK؉ºŽÌì·±i6+æqµáûkz­ýž]ÁlªwheÏ`O‡ŒVºñòŸ˜¨Þšác¯­×Œí ¬ |že(/š¯¢ae—XÝŒ¤¬f ÒOw<ØqFM5á!jùfÔñŽÎÞLç†öEâD;™UÕÌ£êSžÇݬ²kIºXNFýÎ<ÀxØ€ÐÔsH0`©i¼[‰×ÃûÀõËÀìaZæ8> /Length 25 /Filter/FlateDecode >> stream xœ+T0P0â¢t.§.×®@.)Æ endstream endobj 5 0 obj <> endobj 7 0 obj <> stream xœÅZK#¹ ¾÷¯ð9@÷è­*À0ÐÝv-ÛdÈaS Ù;9ìßERõ¨²{.An»JФ>~¤¤^ôé÷§ßN þ‚6§¸šÓ÷¿?ýù§óSuúþËÓÛÇSt/Ë)>þvú²é“†oÿøv¶Ëe=›Ûå/|º}<}íú­f§Ÿ»^â9èpƒ9ÕåÙ£½<ësØ`¸.ÏæÝåÙžc¼8hMz<´õé§Š*¼§¯kjlЗ…{𣠆Æ!±‹YpH|}šÃ†…&†Ñj»àè‡]y¦p ŽTÐåØBäoiÞpEIó(©­KE±¢ç%Ò"œ½Ø³ }vkÉ» |ØòÛmi êIëÚèkDs£ŒI[Ð"°¸'Ï8›ŒuJP+vIú¤ahwhb­_ÖÎÄÁ&Ý€t<‡ƒ „ü¶Z §,Ž€â×õ‘éÊ*}YdzšWéÓ"³ ÂžçFQ66”â)ØØ*<úDKÏ‘ƒt%¥Çì\‚ÅÐî ù;›° ”€ÅJZf…'Ýpošæ6úô-DéK–àÒgùg ¶ºKÌ¿¹cÕ°./¡³jô0¥}ZÕ‰s—iTšRkOíàe›”5±‘›åa§#Ü) Þ_Ši)Q½ZŠ9iGØeLš>Y×mÁD*YÁú°@þñuö=hâéÍ{úHþ¼p«ãC3Þà»N²RÔÈÎôvOƨOÁ«NÕèÂ‰ß û\·A ÆÜÑtãygç&é».‰p’VëJ‹4-o=Ë–mÕcÚ,´aç‡VÝ=ÙC‹/¾vϹlx‰=ú¹¤•µFTÂVr'’~±@)ý±H¡ƒ!ðÂ Òø)_¼Òk`Y!l¾x)¬ÍÂ*ÄRÔD(‡rÊýC¥¨êUKÒ)}]/FÕ+èT½©wì´€Óª+¶æç7îúìù-vÍí7x¢Aþ嬼֗,Fj¨MZ´ËÒ¸0P³XÌ_}Rðï÷fÍúéIž50_Oz‰ðüëôó`DëãT1 ¤¶—Î oƒkûTjc.=ˆÓv\3êG‚6@gÏ»l›±»I7¨Ñ%Ã#05ñÆc8ÌaNà2nG(OÞk,¬¤CyUÅ¡`Ö ‚A°”ºÎÆ?yÿ2¹;ôì;;M/ (ÆLX†"¦fE,EÒ5sIúLK³¯Øb«Ÿn2DLÔ¶c€ï!ZòÃ_î[‚Ž ó°¡#c (—6I~£9®y^DŽk§u¯°9pÀ¼LS*Ѭ®'-‰“®ÝÇñçСt‰µÒF¡²çlÌ€º8ÞÓƒwvÛ9§OÆ$!wsˆ¥~íó Òà–`†çÅX^æsc4©!bž„êé´É|år¸÷ÁKKÑ}Ê{ÐY0¸™keú‚ã¬qaüòZœGÒJé^I¢‘€…7’ù–UK~–ãx•í1<¸éDŠfDÂÔá¡ÁoG 7X\úƲòÒh¥Çl™ßOb»’L”î{IŒJªd`«ô\xd/£¦7ŒÐ»¬cd¸^~-ô°hO’2A!£WÅ=Xt²ÀýŒÀž¼_FøÍƒ¼5KIì1€ÖKC:?¢ÅÎÈ6ïK.c‡A;« :2ú¼“0å﫺© ÚÒs o6uÓJmZÃ3ÿ Ž“¾¥öF+í Ï«ö:U‡ßµÖ³“¼‘¾ÐÔC!¯0ÅÿKPŸÒKg‡êù-™,çÅ,£“ˆÄÆ»[ÔW2ü!¨•L´æq1Îi69¯ ¬Í˜íA:‘‰Œ ÂýÛº•Ñ;~%RE‘ûÐæ•0j»©r†[< rl#K(ùáQ ¶ØRr÷–Ìøuaó슆ˤ¬¥¸àÍK¦X´î âçÁVÐ6|ã7qÑÖfÅÕŽ ƒÒ¼Ôô”vG‚ý¿¡s£û•[»XZ©/u[[ê¶%î»÷AÏ3=¬R`P¥êi%Ú°†Lr’N¨)‘Ö„«Žy€ñ}eƒÙãP ²g­JŒ×x5^0¸tÇ?3‹uÛíè„Gœ/h¤9mˆ–ç+j]¦­ Èä·uÓ¦™ÔäÊÐôÈ…ÀIÙ¹…›rÎ)òýt²Î¾ØÆLg› 6sÔðžô òócJßi‰ò˜Ã#úÝK-ét©æÆ9¡(^C;,{Maþå°¥Ìö`2©Nˆ2í¦˜gÅÄŠÐ)tHþû€H½Í>2¢ÕlˆR«a£·9Òf`Æç1<6Ç) šO§'_oÖ‚7ÒÄ» L ƒãö“Õª xÎuäéCoç×IbâÑ®¶8yÎ+xn ÁÓÐÔÒ{ØÄ‘È ‡Ü½ÝPÀ…ÐÊÑ‹ï’ÂmŒ¤Üe¡¢‹8Ëû¥; +·€,dÍÉÓý¥=ËÝ {šnÌ»pNµc‰Þ<Îu“ÕÌÇJL_ÄaóÃÇá2@5§æ.Ã];íè-9±5y8æv*)QâJeGìrTÈ2œ‘„¾l?޹ÙñŽ ¸¸!ÀTŒ®ð3I÷H»d1¥¬+£u[áݲsðûì<4;¹ÖëŽUîDûéÿ-ƒãm×ÿ%ZÏ÷"{D¢; ¤ 4ÑS¶”£Öó­ ÝòÖó¯•g•l†u'cˆy+.ë$=pÄý‰ZD®?™`ôîp¤.äàÆ™|ÄH=Fµ·Ÿ ‹0&Š xs‚oWÀz€¯ ‚$\Ž fÌ‹»CÆv*€Ÿ¢7õÄPÜ ›„ëR1»c!çĽ|õ¨ n”Ëu‰Ï¡s]‚ªTxƒÿï\HðF+õ–* õéNÜjÀŸþL…j—ºâ-6äÿsœw”?Í{ÛliÄ`‰ßƒ*}T»“I0’‘wÇ¿‹þ8Šìᛲ°˜Pkg†êFÅ¿ž~;}¹ýô3ä­¿ü÷ôåãûzºþçôõéÒÙZ endstream endobj 8 0 obj 2949 endobj 9 0 obj <> /Length 25 /Filter/FlateDecode >> stream xœ+T0P0â¢t.§.×®@.)Æ endstream endobj 10 0 obj <> endobj 12 0 obj <> stream xœÝ\K‹$¹¾÷¯¨³¡kR©”2Š‚ž®Jƒoƒ|Xöf{Á›ü÷-)ŠÐ«ªg±1f é®ÊLI_D|ñÈ™Îæô¯—_OSøçÍ|Z÷ùôý//úÝéïøétúþËË×çÏÛi—ózúøóéËaNÆœ>þúÓež®.þøùã/÷—oÅ}û|¶ò¾ï»]_ç‹_{7šÉœ—ኯËÅ×ý²ÎñIý-³é½Ë=ø°kº·Z{vMÄÕ>þÖ¼ÃÛóÜÜö²^—‹{»Î—evá+f‹¬“w׎“ij.×W{ñ{¸Æ¿§_ãsº~H÷û#Ü4T€™‚0Û °Ý[ñ,ùÞÿÜY@›&|ླྀX<®ðQa{ü>^íuÅ‹áŠôßVÏÞqåøóî×´O\aóD8¯;-žñjP²xSë–pFØÉ@謂»ðñ#…½´‘ <ðpK:¯·p´ðÄ(¸Sm^?ÞÖW²[¿ûJ…Šþ~õè$E·&‰ã€EÔt?@ïc˜E¸d:¡^?~àV/0¼+ câ¬[ŽËÖÌ(?¶ðóX£É…‹†+\Ü7ßerуNÓÙ“î ‚òƒ,LXbéÞjL6ã Wä‡Q¬ó=}¶}sòN~›Ãj-ï´öú4‡Ø%î,vøIä =`kô{óÕ^4³xö€Ù/€= ¿TßV²€Ÿ[úv"'×I$èŽÈ¿h oGOÅÏCmä3»%8ïàÊv¶ÚEܲIK$Hã/¶#ðÈaš°ÇI±ñ@^-YYÚDxì æ ‘%poåpP÷P%~«T2{0CÕþØÀ!Új¢ÓŽâ>º‘?²SC}Kµ³?…@\Zi¸!X©íZ©µs¸²% íüˆ56D”ôoŽ¿£EÞÇÀ‡°á\õs¼ 9ßPÒŒî!PŸÕR?µƒR[»Ï¾÷ÀCÖäž1&×ßÓì÷Ξ„`cÜ ~Ð¥¯·@¸уȇb^Lk«^HæÊ%EgÄŠ%ÓGväÐþ$2wŒ0Žå±É€(á"‡Òc—®aí KJ¢µo¨¡»Ÿ¶Š‡@#!Ú—kžÊì’ïÅK,ÈYÄÐC5e&¢¾\ÞùâåÈ× y!Mé‘™Á²Wf—,6cç/· ’f2¡Ŭ.*ä={urZVª0ï tèÊ¥?4½”Èï·!àÁåéÀ‘z4øÕHÅnw!ojšó¦=j‰KÁyÅ-Ìfç<ëL«µ0áccÂÿ½ aR'M‹©¶I’%QÝùTKæž7 –÷‚îJüDª`T Z’±'þá¶HBê6 Ùš×døé@ x±Üþ.-!Ól Š!**ݧHLá94Çí¢…Ù.%È\ìÌ¡¨ÖE\ºàX–yá,züý$¹ÈÒ É#ð5hÙ⸮ÜSN€ˆ$‰Bä“‹"%‰±Ÿ¬:­ŸH—¤Êž²Væ?оßøB~Ah0RÜoyòÆv3Ø¥ LìòXý”BÙ(W0†˜Dx^½±ï ¢Ê`êµ=€7³Èt‘eçôž%vLJï纬R&®%Dt°‚“ߥp7ÄÛS•±?)BBUYÍØõ³Ñ†_ßXo¥‡0Á–ÞÐPsÚÅÉ4>DþÀF¯;´~Ë(ÚÑÚ¸¬ÌZG@FYr^'ãŽÊÓÜÐMÞµ‘ôWsqŽ#cp#gÖ3€Œ ¢PÆèXæ*P?vƒ=s”}}KN„MÊýp:{ÄR Öifæaõ%óÒu›´á²¨:ž‰¾Ï Uã)r »"‡Žäà† áÏ1Ää¨ùPôs·3(ÑÛó.ïüm5˜gÊ{Oq:C§ò‚v×O3Ð NQ;Y{ø8øÃà¦Ö®÷ŠÆ9ÖEH\[ ãʾ£Ml¢¤bïýN†;ùä§t¥Òh ”FËÒÌ™¾Žê] +©Cê"ëGŽÀœÁÍÄm™¹¬6˜QIìဢ)üÐNv‚ëYšR G}U'’ É~ð·v˜-ŒªË¾´Tó¿QVÿ̯ÝÀX¦H©$–åܪÞI“zXè~‘ŵksOdH-ˆ©¼lg”Šª»yrãqÌJ#±Ôt_Õtl³¦ã¯†ƒ†s:¨†®){N’ȉÚ,;ÙO¢û%!¶Í±gYê æGäÓeñÞeŽ€Q¢9R|ŸV@Ùî®31²š«êÝ!E’㱟=`¢‹ ¦/žßd¢6tµ&=ið’I‰!(Íya‰sIQì°QBt?^skˆp¥Jî6 ö®)ñ!›ª¹%>ê;qª5‰—cêÀ!¯Ùév§~«Š¶é>nÖŠÅàØžâÕ ‡À‘¯…=ªdlº!-ã.'MW¨**©F˜*ûiÖi4¸[ÍYM©O¤¬NÅ‚þ© aŽ‚ºp¸´]‡-¾ Ê[ÚdB-1—¡Ýr.ë¯Å"9+£H/Êô*WŸ-ŽR…j,Š–ÕT›ª–‘BÔ^Óè\”z5›¸CNåbeçèb¼«>öH³¨ß±—Ð :–°ä§e ƒ ÅHC¹÷(AíÁÙVõÖ9 éÄ­ãLQŠïšÞ,•ЖSåjT3Õñb©ÍFkÊ ßN#VŒ;ž>wzœ:Ö#TMt¤~p.çè’g„µ*(^‡µ\a*wÞªÚ.{‘&+)q•f{ v2‹ˆj¨¼ÕÈvÏð¨<84b¦ÍƒÙìqyv(?â'¸\Ô¶y=™òt’VÕ¥‡¦€ì–zIéP™¦1ã%¶rYRU$\«ùPqÌçÁX—Ø 2ʪëÊÆSu".‚d‰¦âÈ–‹‹ ?Àï›àåäKÈÂ÷ ˆ:J¤,„zU2¥ÃFJö.±÷t³ÔN¦ ×ÌlY á‰@ìÛ[ª³·zú@«" „t—{ê¤jüõM³*Ý1ó~/:›91f7$œ8Ö.¤¤šã1}>Ä4®ææRLÅ€­ƒüHóVÏ8õZÀO§—Ý” –ôõt©–ßA\„lÖ ûS|+“z©>£§@Y=9ã³îÆ)CyÈúKïŒ@>sqNMJe9¡OtJn5Hd©¦“$H_%.†À›¼óe*sªsÙjð_J3â&K«sàeq ÆÔeQ ´”]# à¹&z{ˆ¡T[³ñÜ|uƒºV:eÛÈÀè»AìŠ<´—íW—躥eNj‡¸° neÈ"(Û5ÈUl]Î>QÎÌu´ä¯·ì»©7eÊ„]³²I>!m§îЩbÜ£Aunä/jðn.inËã®Æ®°šH›×ªÄŒÕ["3½üw¨Ïy®Iü‚¬‰‹ðÙ<e•ö,ŸŽ´­Ž8ÙØ+ƒÅ°õ.MX~p÷_pCúý×e³ á™f๠˜_úS¨I¦’HìÈqSøžì\ÐtëÒXP?ÅT®.WÕ g‡z¬EݽÔÇNÔúj‚é¸.’› Ú°rÓK¢Üã¸ÜÓ*‰½µ›Þ”9ÙúM¥OÛaý6 U5fUz]WQ„i§j¹úô©‘øÿž¨˜§¿›I³½É,û$¤Sñ=ý‰…9Ç׈­å׈¿~=}¹ÿþÆ~ùçéËÇw³œnÿ8}{ù7î=ð endstream endobj 13 0 obj 3569 endobj 14 0 obj <> /Length 25 /Filter/FlateDecode >> stream xœ+T0P0â¢t.§.×®@.)Æ endstream endobj 15 0 obj <> endobj 17 0 obj <> stream xœÅ[Ko$¹ ¾ûWô9€{Jï*Àh í®^`oƒÈa°·MÈ!ÁNùû‘D‘¢žÕöl°`Æî®’(>¾¤8ËYœþûôûiñ¬'·ÉÓ÷¿?ýí/§¥O—Ó÷ßž^ߟ6yV''áý×Ó—»8 ÿÓ?¾½gWkì.—‹yqúò¬^ÂñWk/ÏòžÅï—íÅŠôÄÿÞ­óÊ[xÊ-öŽûá9¿Ê³_Å/Ü–0°žS—gñÛ'ãF°«ÎXÁVIo_ý«:ì÷…¥ý¡ã Ú?ÃÅ÷ Z&ezøî–jQ/3œ<íÁ…òršô‰½§“ø=xYQ3pž ϲøó¾Ñ’Ah¹'‰Í‹Ñ$¬·Kû¿*(ÃYkø÷ tã—÷ŸŸö÷§¯] qÞ* 'åzz5E+ÞJ­öL?5ƒË¶;'»C4ã/Ò^á™ W¯=¨ô Ø¿ö‹ôæ bÈùw²÷ƒùâZ^BÐ\ž× aã%´Á.aý2Ú« ëš©Ù?&a÷ÆÂc)ôp!^I냓“½k$’Þ4 ¥$bNŽ À¥©éWsÖµé;ØDààf"¶1{ÎF®+¤$F„ÍâÏ£ (,[©®s‘Íz6…ÈÞÿÙ}Áxpb/¬QââƒéÊ|D½WxKnl™ÑÔ>’GhÛè[ã|@YìÓ ¯ÇûZï:ÜYX`*™Y#°Nv?Æ+êuäÅ! Ø*pëÜECü7Ñ‘mí_‰>,b¸Î[QHàLC¨˜h8[Ï@ë*±8r‚üBéjùa'pq¾M­G&òe¡iZFB,ÅŠ”ŠÐ 2€že$·¼ɹœ!5ÉœÀ¥”UÞd* W:ÐÔ¸V5ØÛT¿~;Wž€á<Æc.Î)Ÿ3ˆy)Êã‹èTPÊc-üï„sŽá•äݳwŽO§çݨ}ĸ’]ÃÃvJôQa[äq*²ºÎŽ9QÃ÷c››¥Eß*T‚’Øfg2©UQÖÔjñ?½r`ø"’l{ÔU`ï¤wâÉAa^Ð/0sµÛ TƃÊ2ã@Eö!(ó…I®áQa™Ë9ê¥ÜΪ.Fí©3C =ÊjrM5V¨†šAÊÿÉPIåxy¸Ëdî5"­H¡(½¿cà¡ËVijNô5K"A;)³éi oÝá{Ä^IZ¦ TÝsÁ• bÅBµJ^Š˜hë¡ÔØHÝp¯\E;å<'‚$³Y k*¢½ —¶r¯³ðA+¡T22†“™ØL0 ‘›¥Á½ƒãhžéõ8¼ñgx––#2½û1 ‰j*:X ÙÌ{€©³•f7sdn±´]Ï^¶PYÝj¤/ç~¦ˆîq»kØn[“Å¢õ»…<*k1;»¦tZ¼`ãèYrS(ŒàtY§«¦ÎÑ<žÙMo®aÔuÏ3œiž9ÑàrfIjS¢êRs iè•…°ˆüÞoq÷»mÔé&Å&æÄÓ„8¶œ†¹ÓAÿNkíÿ.;1Xº‡¦œ®z%ŸëÉ„{'¶S·1w ÖåÃl€ÊM9Êœ{u•ÂTȧ]DnÌEܽ"Ë$›Þ×õ†¬9g:Ñ¥qçðÈáåV!âAC޽P6ä"…<`z8ÉÐ6ŸIµB}«Ø‡…¢ß·îßΕ5g®¸·„:ne2Ñ)A &DÏe<ñ O8ÃrƒÆã"×V×kì§LÁMé^uÁ¨G¦üv7”©ƒ”(}jçE6ªï—˜/íB|+°ö!|½Pi\…U‘åÛŒno!|ÔéF×uu'ô®[Œ–Ð5‡?RL;ÔÕK }lA!òvR]/‡#økTH!OdÒˆ—^˜kôÚôùÐxƞדr¶ÍRë› ˆ"¡v°hèñµ%7¬Á+ðæPs£#Á¥ä’ŒŠe+‚eXçÎòw[Óse‰ÎMz$ Æ8; 1¥Õ€Ä`9%«Ö Á“w–•·&äê´gv•ëÖ>ͰÒ¡¹E £ô‡ú³e×ä>½I÷£:¼0Jö*ÿt†:.öò(³@•É3vè#šOŦVÆ-yTÕöᢛ%ÜNÞy±…½î·Ç·cÒÙ–bw¶r(œRºÑNI.4+Êo°S:[ä<MÄÄï]l¤—s|¢Ø’¨›Àê´8v.¨0t+úí§;ìSžZ¼e(e¶*Å£uu óæ¾hÙ+†çöCÆ•VµŒ{xßv´„Š)'“V”×j¦–IÛb|#‚¥ b¿ÉîJƒ§xlê¤2Â?—ús%ªr·´pËUæ³ÌršÎÂ&S6DšKAdòæ þ›š@Q5Y×@{¬ çÌ5ôåÙ¥>Ã=Ò15v¦Õ’[ΆïÏï\,^Ç eã:œ#Û{quK(›û&[²Ÿ„в"$ Ýû(ô…°xM’ï8XW•mŽ0qÈT¯òŽãÞU—`SG‘²)kûi@nO†¡Y‚¨E‰.6PËnzáÒ¼mÍrã|å?鼚0¡ oAnŸó¢;‡«ýP“ÆÄÛ¿Ñ6hCdѦ6í|üˆwŽ9Œ‰èÖ½ª°j3iVL-¹4·^dq1¡l^Qï†nlìšÁ¬Gs½XO>Æd+›Ü¢ Ò´¹nc©Þ…]Å¡Ì8¤SÓ§Ï"Ã$iȬÑWMìóÞÂÌÀb3çõ(#îÉY”¸ÜºgwíUæ°œ{hôÍ‹…b÷©ÈÉÈ£–Ó(^04ßMî•ìê³¶[=íûãô#‰~|ÕYШjƹŠ˜¢vË\MS¡@™H;œsF½“£6| =E˜PI°S˜q˜<È=¨ÆV>÷Pbg*‡<é.9ˆB¦1û@C ý‘5Ž•Øô½NÃú(G_q¶zj%½4…ø˜¥¦òÞÄü¨Ã×D¿æ]‹ñßq1ÔSwˆ÷ppÓÿϸù‡C=·…xË1U_ý–jsûÙç¯vvº”dê Ò5éb§?5'—‡[Ê˲`s¡G.ŒIRQÓØ~6¨æDØÝÿ>Rÿ8¤„+uLi ôgúéBéÿ–ódØÃ¹!˜jåiÀ|0 çî&ïü'€‚c°5\3 :óî¶‘!Õúv!+Ê0¡4@|=ý~ú²ÿôW¹œ~ûÏéËûw±nÿ>}}ú7 >n endstream endobj 18 0 obj 3095 endobj 19 0 obj <> /Length 25 /Filter/FlateDecode >> stream xœ+T0P0â¢t.§.×®@.)Æ endstream endobj 20 0 obj <> endobj 22 0 obj <> stream xœÝ[Ko举ûWô9€=")RÐhÀnKrÄ@ÁÞ’] ‡;9äï‡bñãSí™É%X`¶[–D²ž_}U=½ˆËž~¿Lö?#äeÙäåÛߟþò‡Ë?éêtùöÛÓÛÇÓ&_Ôe‘Ú>ðñ·Ë—C\„ýôë_¯F±¨Û³¸}[¯á£ÜnÏò*§›¾.Ò}4šîQö#Ìýö¬øb¸oö—ÖÛf¯Û+Ïóu™Ìæ..ábx(Ülâ;ËúÇÂCf÷wÚSù&Þ‡q/ ·KÜVx×î¥áöJ;53¿Ü¾ôÝ_fÁ݆aÙ°À;.}Ø]ëì¬ôÕ.u„W.“}a.1ûïÂûõ‡rkÉ›±ëÛ÷ðRíOúSüòñ§§ýãékS‹B¼l…ãšf¶õ:"!š…O§ãŽíW-oÂ*xwŸçw/{ÿY«›ˆŸiC»9XâÑPP–{s¦œãk5½ÛÔóMºa ÕÃJ>¥§ÓV–Â`œìgR÷nfRº}Àþd²j G±_—[|MÔ­¿>››¸ÎÞü6­xž—ki!î€M_ð¾´ÛcZy¤f³­/¦Tó¹iï,‚ ôpèzsGîÝS0IK| ðîµ’›m2° ìžöJ´Vq€OâBíóÎÖae»G5b\#«±Y›VœOù`ÓØ²‡@›³/²vÂ2Àxrœ¨¶ˆCÕ®úen{°;îãÊߊ9ßm ´[EE%øÎ\¨şáæî.^i‹¢¿Ãöî³½Ô£o¶ŽMîÊ¡´°@ãL§ýaá¤öÂoŽ™d©ÂÚkXN®aÃv£!@YóØÝõ{ ‚òÝ:‡RJªEµž©w‘UšÍ¼N¾ñ»È;gVB9EÙåÝ_%F¨ììùÂùMžR“…wÙÕ…šífµÚ½÷ÿ::Ø}Ö÷ìØìw¼Ù˜ aØì¿²_Ž"°Uz²Ã¡®ôZ'Ó|+÷†*wÅÄ·û“²E¦¸Ö€Ká$:¤ESHŽ+Ûœ­RÊ^ c_!³º| ²—««ÅËþßÌè-ئëPá-é2ä€-" ;ê¯ÐªBã)v2³®’ªÏ»“Ú©ŒÑH“¥›  ÙÏEÉì$ãœèšzãÌ/ÅGNÀcÈD³ó©ŽOüT`4ˆ[QëP%·k"Ò‡Q~ÌB„’aΨdõæ¯G€u¨{%«¬ÛñÀƒÁá`F¢ÛèEØÃ%ÃÆ­}Lâ²Õü–ÒÝa¦Q u”?‹›ÃWP£€…W&±òFÉ1‰CgÞ‹–z+ðæ]‰ë$ Q]Ä` äDŽâV’„±ºGÂZ€Øêúa àU®¨¶Òk‚â÷¡Kp”œÒž‡ªóww™\ü}©ÙJø\ÆÁ‚öé;h‘òB…MZØ@¡ TGLS7ó»Ö·™Ã];‡*t/;$OƘƒM¢ÛÜ7à ²XáBNÅO<1W!?YDµÁÎ’aÔ 3‹/:éùÙ»',\øþÎFj¥Gy¬:H0úøÅEŸ¤óƒ-«}FªÔöߪàÍâà¨<ˆÅZ/›Ø£5f)’>i'/ÒÙ ¢ íuÜö‚“kìÀ; ã§¶aý>åLÊF¿,AÊk”r@ë` êN¸zö T{ïÕB­6²Â»YƒíEÔZ ltá!H z™žýß1ÖèbÈàêá` ©.L¡X²Þæÿ¯C]ÚÞ2quªéÀ1T!®-Ù‘ÐV£C5åÇØˆÔ83 -^Ö21"Êi^#d´~`ÜËPcÁ+<œ$ÚTá䬿`è Ì&z¶U¿=})±YQNÊvNŒC¬ ‘IÂTs¯|¾d’HQõÞwP´%e†˜`h Ö™ußBþikȦ9‰8*ÔOüu·úñÀRXA×±ÎÚ$aW=]‚ŽŠm5Ç‹îï˜3süfqUϕڵ@UâbÝ”•¸ ÐC¯AnA‰”(bŒ„Y>Þ ¢h†Ê–Úþ[([Øò×5WR,²"yŠL¼ Ô¤Ò…óóL9sÏÍ  I²pŒx#+<¸lªP2ñPÉ=ê= I[Y—Ä\šÿ¼A© \Î=…?†D´dp4ê¸Óønr»TR»°¥NgÊ{ôöÈ»ÊÜײÂ5×mÞU4ë¢ÌÐËš¥îO¹5V49.ã AÔPm:­ÝžakR_¯TQª±JÆJ‹V°¨ €÷:·öðàHóó¶ŽR9ïvƒå¡=?À¦œC¤;²ð|;%Ð*+Âñ[E£îä•–šÊ! ¢kž²6àä̵CÜŠ»à‘æø|±ûVÌæe1Î-^lfC;Xu•ÄÝŽƒÉoÍ2ä!ãkùò%C_¼®©ÇÔàÖ¨GC"ï¢ð–ЮèÐ9ëPî|*™ñÑ¢K­tŠ{PžCo½r’=é¾Qû­½¡NYçêf\oóˆ²ßï*°õ»¦ªÖê»F¯Ëé–”¨4ѤÉLr¥ªln¦ €Ô©*¼Ä³œSÙ=¡dúP .Z^­&IŠœ0T¬.9,Ç`€¥úZ T8ƒØkþåöýñú 4b¦äánf]¥p¯öÇ0%Q1Vù˜†æR0W-|s•˜ك8çS´5»eMDÆ€ÚØ=¨SY“·PüÖñ,žÎ£ðPlu y¬‰Á°Ùtd’"%Ù@<ÆÕclÐ êA¾(U[&g ¾=Å-•2ÓÄ#½å}: htÄ.»¶Å\ô¢Žƒ)„¸Ø:‡Jšªu”CI~G­¢E>$Ñ`€ºÄP&2_)båv€9h–äy@÷]ÊX›d”=o#Õô’Ì#;Ë-⢖­Š^³¾É†[{¢Q@(Že“œ*u¨–«zM ž¤e5Mvâ¦ÞÐérDð}»Ÿh0Ê(ñhYÅ„¾è)hÒÏ;¤F°Xw«ÏAûë«Çx¶^ß^%\vxE– Â$Àß8¶'ÔåHir]zø?²¡ª¸m ¤Ûš3ñ\6¡dµl´üj®Ô‚.Ï d?‚Á†t tä_øúÁÚƒc±¶Ó”À膆x‡a¼-T).Ä9ƒP;lè$Ù ´àJ¹Ó¤ß¶¦†Í¥~Â]t=ˆ^„ã6½[yÃÃUaíc€zî bUJR«¾7¸SÁ“'Þ0ôáVˆúbò3Í„[:P¡ ?éßä­ß™è8eQ H=6C wø©‰üxÎ~9ARÌ[dÖÿ–¦š&‡Öý[Ÿ3°¥Ð¦*”f?__möÄs{M2kèn)L=wâE\Ÿõ€ŸÕþ|è)”é Ìž@Ox[ð)§ù)«ÔáC”fÕx{Ûƒ ¿iîX”-Ù]«1£ €à`7 )¡WŒå&¹Y]Fâû‰Üd£Í=:~ ›p>¡:ð˜}"´ìö6Gþz¤„.'ò ˜Ó›Û}ûüa¼Ò¢ø¡¥‰-R\cüüPŠ©'ûq:¨nªfüŒÅëVèÌÁ7”7²Æ¿¸W‡>“ Ãï–-Ž#ÐÔÍÒÝ´?ë¦"ýUv6=§-f^xtškr‘¶P`Ë ¤>u¹B…4Kº.Ç6Cbw?5¦çÝÝò´¡-bÓ¬Ô€[¦~Þ"ñNçÖ‘¥²pW\ÌÄ’´¨÷׫ҷ„Û¿^~¿|Ùÿøg©/¿ýûòå㛜/ïÿº|}ú/à=äZ endstream endobj 23 0 obj 3410 endobj 24 0 obj <> /Length 25 /Filter/FlateDecode >> stream xœ+T0P0â¢t.§.×®@.)Æ endstream endobj 25 0 obj <> endobj 27 0 obj <> stream xœÕZKÜ6 ¾ï¯ð¹ÀNl=m`` ;;.Ð[Ðz(zkS ‡Mýû¥HJ¢dÉÞÉ)E€$k[Ÿ?R;^¦áß§¿‡þ¸I ~Q×ߞ~únø“ŸŽÃ—ߟ^ÞžuуWæâ‡·_‡Û ¤…ýŽÍï·7¿…uíÂ5) ›ê‘ÐÂ^Ù®ðÈ‘C“oY-Kªk7óƒ¾,iivCX@gÇ€ÕáÑ&äÍ^íçþñ1zPìtÜ+'œ¿ª{ØŸNÁ•ô_ˆk%äbaàä7EĹ ½§Äµ'.™õEÕ.!}ê Ž NÓ!ðÁ‡V˜fx‘²b)¼ÚjÁßáˆ{mNãD÷UòzèWSš­ŒÀaÔª¯Æ®ŠLm¦5eňĦ$ëo žL)8ö–DÊ!Ô³»u—ypn¹,•Ù…JßÂŒ;ë`V‘wu éœ&fsªø]1 c§”ݵHi%tšaQÊŠ!aÙ»·¤]ñQ<5¹Ó1ÇI:µ( E䋊‚§ƒ S¢ÎuúFü]—ïo!lÞ…Z"”ؾã2ͤrÈ;¤ìÎ@”QkX"F!‹˜ó0Ôp‰0ûNé%‡"uÆšb ×J?tµÑ»²ù-ø·ïêœ3.yOZ­Ytë*q@ɾ>~\"RªÔè™-ÕÂäaÿ@†·œÉ+GüÓ©¼ÒäŸjé«oAú}x@øNÌŽCÔéîQ“].VžÕõ=ë>šýFš8­ÝJE€ˆ‘{,Þ«TQ’7瑪z/Q÷„è‹¢€€K3[SÛ;Õæ„ñt,éVƒñµ73‹¨#u F臦¥Õ0Az~¾j½¾ýÑúÜ™‹ËŸ[úüx×!Ę^*€4!xÉ–+˜v/ðVá6´-)öº"7sü5 IЄ¢ê†u•_€Ux+¯p -EC†§à~¬s ƒÆ%ò†¶†dä4ôØ íP•üÊ­†BËæ’c[x”ñ4!ßñx,…h]|‹ÁåB¢ô m"¦¬Ï3ÃJ´ÞéGö3P£²_Ç÷•ûÙCoíaG„’GÍa°@ä‰ÂŸðŠ2WÒóV‡HÐZÄ÷ïÏfÊ‘œ`Í„+]³ [lbZPlNÆbe <±EÓ4}¨ûÚÃUˆ®‚< þA]·†Ñ‘¼ª˜5U%Ë­ØaOj#êQ.n‘òÉóþ¸\n(—c4”¨»oÒ˜ ìZÁ݃t!ö¾ôýÏnœôÞ(‰`õ1«fpΖøðùE´'79Z}ÁÃËGrTX;±ÒŽm<Í_¸ >Ì‹q¼Lí¼8™Ñˆ•b,H<<ÚÂÇ?€ û+ìâ2¡¸{zº=Ù}ão“»óMJ‡-ÊùÎÊ|FÍl{CÙ1± ˆTå'H2A­nˆM»L0daQ&Æ[qòvÅï胎œ»ËovÌ=QÌH.aLˆgjÄ+Ä+(;Ç@“>è[ò½Ž G˜¤DÜÆ. ny˜7ÆO;¢^ƒ"›1Èçrt7'Àïh“CÐÎ=ØÒ¦‚¹#qÇ ‰±Ðˆe6:Co«D+-ï¸M ' ´«±5Káu¡÷5V~`ìÜÆ‰ßœc„ѽ&²ËÅ9ÒòÊi3НH{©62}j”°ˆcõß©ŽÇå4d5Ø—m¡/ m<|v²£Ø`_\(q·‰.S•;*ªc;ðp&´‰9mYkhSn +X޽íyç*ªÛ°óÊÝàýÜ;=ÇÆfækŠ›¨éM"ØXìŽ2¢òCï?¦œöãÁ7ø¢èZúÍ“Õî‚§õ»«Œ¤l1°ehó- ßpBXؘG»&qß飔H†;W¿=Ä(Ò³Š vEþ¤‹+s9q>¤ÅZÚbcN§_„Ûnåd­pénÊÞÉýrxc(†=¥-¢B—7Œ¶¡HvssŒºÈÝNì–Wf =R¿n)š¡õ3sãHor°³Ju5( Ú!!KÞrà÷:è]ÿeî!¥·‡úÅês7reœ5F¾çmж:^ƒÕ<)‚b¥lS@ØKå;ø¢—óì®Fa{ö©¹›‡_Ä‹$¶û b _*ãÈÀôçh¤¯3ݦ¾ó‰¾yå¿­}­•ä[mÆ'þpŽ-„ëƒA ùÝï:Áœ€ÈKj­ÈX¿õ€»9¼â±«‹Wž½¤Ö¤¾“=ó„²è8û½±òÿó{3zÔÀÚݘäV8°vi`ýiø{øpÿþG=¿ÿ3|xû¢–áõ¯áÓÓ€æ¦ endstream endobj 28 0 obj 1961 endobj 29 0 obj <> /Length 25 /Filter/FlateDecode >> stream xœ+T0P0â¢t.§.×®@.)Æ endstream endobj 30 0 obj <> endobj 32 0 obj <> stream xœí[K‹$¹¾÷¯¨³azRÏÌ„¦ U ¾·Áã›íã±ÙñÁßñ”BJeVÍì,¶Á Ô”JR(žŸ"$õôèNÿzøù4Á¿ìüi^ýéËŸ~ÿ›Óßå×éô姇—÷‡”—Ó<­ùôþ§ÓÇk:¹xzÿËžBð—óŒÿM~ŠùüÁ?ÍÓ9>e—C~ñSçü”¯ø{~;ìÄ!¾æ4‡9ä¦Ë€ ~œˆV”éwsN~Âá/0wç2“‡Ò°9œÿøþÛ‡Ëûç‘ yYAh’Áœ#€fÂÑ~WäâBKBYPª 7a™„Aö@‚ô”YôU/ù ìE!•Ï yÚ ôň_SªÃˆ,Ì‘ÑùìžâŠ ¤x†m•Q½Ðâ¿âìdHt èz¯ÒëiüòÌòì²¢Qщ'–é0ÎÉ­á/zɳÑÙó3RJJT)Â$KT&_IØô¤Ô`tV‹'„Fy–Å_4›ZW¡oÙ|NkgóFÜXŠò5X„Å<;% g+·“ºgà»^:§"ûÉJ es`6”2©Eêé‰)ãpr·ÂßËXj-î1Nñ* ®’à±ÅD`¹!„ «†²Øuάuod§ra2¡¡¬²n¸ÖÜ:Á¡ý²WÜ©ö›xq&ëx%ö3å© a:)/¬fˆ"ÎL™°¥¨&Ä]«Y¬¤Iœ1‚¦¨â5RH‹+%ÚqA”‰Q³Žq6 Ó¼Pt$ThTî QüL½-FžÌƒœP4†« _‘µæ<‹ºzÀk}°„Œtºeø>ÆÎ†C?F[Ü"'©š¾áU”âßÓ¨¼,Àª X ͨã‚Ó©XŽÃBáHÔ!KXh‚ëXï¡æ^ü¾WwÜ¡À šÄ™2+‰¾Êú¤i‹ŠîêGÙ×áÊék…jÚ£|eÖ}"äÍ^Ü맪¸å/IˆµZÔQ´«2ZôÚ=ˆê{ñ É/)˜Z©ìfLþ†«lã¡{V娻‰·ñìð\uÎÿݨî2¼>??8“´þvú±i~ðn~ô¦×¶??¤è %ìeÂÓûk!L-CXz…PéµíB¸ôá三æV%¬½L¨öÚ¶®½D4ý anUÂÚË„j¯m+áÚË„c˜+„©eK¯*½¶]—^&<£cnÂÒ+„J¯mÂ¥—‡ Çܪ„µ— Õ^ÛVµ— ÇdŒÇ-CXz…PéµíB¸ô2a¿ÀB˜Z†°ô ¡ÒkÛ…pémüØDËÆÍÀ7™‡07657f17š57Ê1·¡8F€6Úú0nC¦ÅÎïû€j·‹ŠÖ{×îܨ÷ÏÖ:7ꠧô?z`jA G—.’{ˆhñ‹ó6¦ú`í£¸Ö»k`ø ´ÁÀÔ à¥A£èH —Á…ü˜à`ˆ‰Ð-tÙžKä sŠ6›ˆ/”+l“Ì´ÄZØRdJœf…Zz¬5E0ûüqUãý‰ÏpwŽù&–ùÜd0˜öÔ¿¨™´,Zÿ®'7ÑB“Cî'¬‘¦€t§8%ú)éi>Ö¡è”b¤œˆr&'*ó”˜Ð1*ŽÔBzâ~˜É(¬6G*t˜ƒ½«n(ÑBìÏ$M+IôŒÄ¦ú|Þ`QsÁ1׳{r~8XßyT¦Ã“]rF»]-3ዺ˜ˆ$óâ\½0qL6'-wï$ëV+ŠŽ:?É×”ëe‚”x‘ÉR<¿œýŠ}`8ùù œÁ]øO\¤Ï;`‰ûÝj•y¡:C{™a&XÆøˆÜ•%U÷Ä’ö©.ElÀ Ͻ<|É”µcHÒ,+¬ÒVîIòc=§°q"VTur§˜d†5¬&æÁ?Óä·"’tòIÔÜ Œ@Ü C_ð+†.»x&¥=““GÌääùY¥>ŽÓŽò Qb,·ÑuLÓcÖ£cŠô•C¶Æª? ¨¼CxB[¨wÊUÜ™¼Ê‰ÊÙì%`ªÆç#˜®³—³s;s…k1ÎNN}‹³@?à.!z‹ ä1ÄVbb¡Œw‚”Ÿ‹~¥*Ä¢ ¨àhÂcx½eîëPÉ8ÁYŒ!£hû<é”0GáÆyü!vcŒ-½¨5Ö$ä«È*8Há—cw\'={è¼¢ÐbÏŽ3ŽÀ•Ùl ãÙYɽŠ\=¬ ©ñÒ¤bYd~«¾ Ø4` ƒ¬*­z1/9-%h -à ÎçVê[’yŠd¢e8è÷ŒG`2‚›IQš‡˜Á“+VŒ‰ÑDídù\pƒ$ïÀ-1$´L@îd,·ÅIÜjQPÇì¶\“§0“Ë9§’HÓ¤ht#È ñä˜Ñá"^?I$svôÌ©ŸFyÍ©hû£ë·À C-£0Á:v]]{”xd‡U-fˆí~Ë7›ý6BÁ.4)<—ùáíòZ=¨zúîšmv*—Æï$E°1D¾d$¸¸ï™”IìÙ7˜âs.i R»µŸÆ¸nöÓº!1dì’¨D4݈ÒvoJ”Ú‰8£m€8ƒfKE \9‹ÝkŽCÆ%¢°‚#õ¨!‡ V\ãZT[EÖØì±ÈÃLwÔ9Tƒ×;†ýPå4‰Q=L%8S œ¾_˜¾qU¤µÎu¿ßÉÅ™%w5‘.ÖÃûu$(r ÓÃÂË€¨’N¯”1±fI Y{8sÜ­–оyË…ÏqŽñ«‰ÑF5‘ÔxÆ \r˜¶¢û™ÂG’ïЖ°9ÅB'ݪ§’B†Œl‘‚ThÔ\çFÂ)*Ö,ÆäÔšð~h­1Àù]¿§—d;jæeàÓ‡è  „û¾z ’`XE½DÒ¿†wXÝþ1†VV>rö­VߟfÐY{(AQ[+8ïNAnž£|DŽò„Âe=Îq|=uhÌ¡|l.ó@“Ú”~ˆI¦^é]×5>z±˜¨n&Rͺ«l@ZñJÎI~ÍN7‹…2Ò¸GÃ#Ht sa<7@ú©· gÙäõºL;54K ¢VH°_äq|lõ¬š5zNzÐÁpÂ!bÖ¡Wœ`«àÒV²Y‹N„XÆmŽ\6Ú÷xé ÖWÍ<º·fyÙ;¡êö ‹m"°JÙÁµXÓL­¹yÈ%wßur9M¢:*׬Ï$9R›^akðf¤´[@f[ºM^Înª¤,¹£üDÚ²v ^¥>!Ñó× Þ1—ŸÁËO Yr>üßzX‘ó9èq,Å$È}a T˜Ji–TB[/êŽ@Çv¬jÞ:Ú|ÒTH5õ¸VÍá 5Ö&µmRá6ïB‡™eç•$J)ânJÇžÂþIQÖS-:´cè×#úõ$ÒÝœËcæLõ`s8êÙ¼< ™ª{û‘zȦ®D‘oÕ–û’~]myxâCñi¨<ŸMEèüSLò}PuÞQ_V££B9ߨ¯UðÚ'Lqó&"8<ýg_8ó`Ð\=aðmŸ¥½KõöÕ›“×ekûÑË“§íú½öËbî…¹Uo~µ—oBk¯më½aíeÂc°¦–!,½B¨ôÚv!\z™ðd調eOöf·öÚv!<5OÀI!–”0·*aíeBµ×¶•píe ÂÔ2„¥W•^Û.„Ko£ccÉšÌÀ¤fà†Y3pk¶oi-Ó™¼Uoo·NGz;wéý°µyçL­ázè´_ g\oàáÆnjœ`àkÆ’[‡ìc~N›—¹ßvç>¤ôýï܇Ëüwî>ÍÛùݹ#ÅyX¥RÙ™éº2·$§¤~÷_Ìß` ZÝMª»ÛWùÄEM7}I+ˆ[¼¹z5çdRD³YEÏŠf%@—d˵^ŸW®É5 Ò‚üsbÿZòcLtnêÁo“oáJ©Ôªbø’B;äÈOî{ÉpL7~Ý‚ûˆ2ìTÒÿ™ð_&% õÿÚ— ÞÝ)àÒŽi'²rˆlEo. ùG¿° Ñ*VâŸLá_òK‡E¤ ¸ptГ=†¢´›\ 6ÐN ¾AMÏX×àÎ_ñی߮XàÈà|ÅÁîЕø†¯4Žß©5—Üt½ú£Á?ø'súRïÓ¿¨Å™§í‹µÜàïE7l=y EéD =ÑÜïï*%äñ´@ÂÞNº ·à`.86SwÐ<“âuwkÎ"õd¶=Œ¼çŠØ¥í£F=6¦ý%àÝŠ¬Ïr4Ï'šÃ*³y6‡Q)á—zsÿ•ý žŠêø <¹ÔlLEkqçÚàøR<îÆ£v<ë9x‚E×*~÷ÞI€£­×¿žÐ{Fl¨'hSÍ9ÃôµÖ¹àù•ß(4G¡£dÆk˜Daœìè–ZÞl™‡|XZïY:£}UÑ&eƒwL%=üEY^g endstream endobj 33 0 obj 3514 endobj 34 0 obj <> /Length 25 /Filter/FlateDecode >> stream xœ+T0P0â¢t.§.×®@.)Æ endstream endobj 35 0 obj <> endobj 37 0 obj <> stream xœµ[K#Ç ¾Ï¯Ð9€Æ]ïn@°3£6ÛÆä`䔇 NàÍÁ?,²d=ZšÝ –G­î*‹«—guúýé·Óÿ¼Ò§°éÓ—¿?ýù§§«ËéË/O/ïOÎ?¯§°lÏÛéýo§v}RöôþŸ/Æê›^®á¢g¯g}ñ«wWñ{Ðñ+ ¹xåoñ’…{–«¹Ð/pÕë·«ºxãܶ{¯»Á`þ-ÝâpÁšxÛN×ã¥A\0ÁÐ ;Ìò—÷?>ÝÞŸ>Ä÷ë Ÿ(¾:Áj£ø ³‰"oQ,GÔ ýV>ÞïÀ)Îq­a –èé²Å›óó^{•Ÿõ/>àÎß¼¥gé™›÷QG°"ø¢hš³­ó >à3$ Ýõì.ü«F“~ã—2>ʦZéãØ(Q|2+;]/2D}Ó±ã¸;i"Ú9¸¼h¾¡‰¤Ø¶¶“žÐœTz8*þ3åþ¸ZXàkf2+”Z¸¤ýõiù],èO?>-§³zÖ§_OÊlp3~ù×駉…ît*YX\árì²ÞA¾=Mf¤¢UÒÊq8ˆäð'}’|*[xhx· ØÒ=]Þ£}‘÷®fK«††a2  Ms;U¸9>M²FÑÑvázÜ.\Ëw·D?Qëÿߺe¨–¨à_0ÛØ«œØ¡ßçv¨–ÁŠ£~ßÿ9ŒË2ŒÂ ôD€Pï#ÂH– ¿ÁïÈ¡ìx[ˆ69ñ N.l G$1'Çѯ˜…âÎì¤jø ù’Ã/t.Åüróš¤O™ÄÓí4B¼?™ì%šYÄ–â+àKè¯Éì0[ÑŒt3é”yzËÎ2}t‹KÉГñT‡Iî¹"LC{KkeëMâ¤>…\3“ƒ¹Ó ·'Å–ÙÐèùÐ}EÐUƒ)æ"@jsÕQêuÞ?ûÖmôí(%"¸¤€¤Û¢±¼ê¸bÚ2!œØZx%ª­±„¼ZÜ(GɈ¶:É”¬*=è£Í(œ.žÜŸÞoÚ0JìkžF¸¡×œM’ÑñØIÑlËßpay«› JšÊƒÅýê™›K7[8 ¹é­N+Š‹Re‡I×´ Š›î³Ý3%¶V—h‡·¡™ ‡E^ënyØ Z¾ãx+‹bëƒZF³Q³— urø¦‹ÅY²oŸÀ*†žwD6z]œ§¬”ûŸ9g§åI h/:*»•Wôáx‘ Íêé÷Y@¢ rhv,80 )iòpµyÂ×’ÒDEI/xÚ^«†Öö“¡Tg®ÕìP6nôûÈmòoÅTÅ“ ”K‹ÒL¸¤|Áu)¸jei‘ Š+^S×=ôææ\VgkîæºÑøËåÁ/-¯"Öé©î_K|`xöÐ(´ï’kUìÖš @7ŠøìyÂ;ÿ̹OîÂʇ¡WˆÊÒ5ö-=²Ï»®¤@'R÷C— GLZÙª‹sÏWùFá^¥9\Š,y8†v¨<…;ip› Ã!>N‚©6ºÝÙhe:„™ÎËð*¸R% µ»Às@Ì5þW·ç`ã hM®ÏK±ãÄ9iv³$YUóÈ4Íwz†¸”ä±8£z#Àÿê oÈ”ÇËÅßêK+îw‘Ýê¡ &ÖØ–ç;NX ö ˜oªˆa—©,^J5@¼&ã áK©5³Àó‡FaÔshŒ¢­þ‚©©äÇ6OÎ,¡&ƪá»tRFÁ²BøT»³L’õc ºyЍ\GNHa3~RƦaur\¼Y}5‰\ÆÂ—X^ú¾^ O¼×4SS§ÃŒdÆû}<Ó\e9Ç¢Öžøæ¤ïˆ\âZÈÈм#>ì^Z¡Ía¤C© bo<¿‰å2aÍ*ÉuÏígçÁÄ£{f}U5ªÞ\% f ¡Šã-ĈÏ1Õð°›Xi³Ð……‘n’êáÄÜýúÁ.îY·›ÍhÄ€Jñ"”‚J߸,ªÖg’ß”¡vnŽŒ9ðœ 8àYˆwmÈeÅIŠ6ØÞçƒO2ߣÄ÷#¤ŽT¤©™î]-EEat´fu]ªÿ0Prš:í }8¦QØJ‘mŽ*3¤±/qí|k¼ïóÖ8:¾\…ÈÄT£c­IHVóéooµJãu>ËÀœ}ê¹`äÁ9™Yiej9Vªý˜à&qUϲ™‚&K½ßmòò£ÿW+Q•B@W:yìj5${³ §¯Fhâ^IkœéSÒ#QJFn‰toAKÎ9lô”s&ô,¥i¨uÔõä|ÙÄÎR“ÕpÔ-ÌÍšÁÚŽmLr±{Ì’ÚŠlÜõ¦þE÷d?ì‡]¬Íݧk³½Ž:.ºø_”¿¶’MÃ.ƒ–ôœèµ¥i•Í –bæ G Y»K¢Y†Jù4n%HêL;±èP¢Jß®i£iÆMDJv–ñ ³m3á¨d#Æu)õ^{W"ëõÛ|ëpǵïÈLѶÀAˆ·Ç×åãïпF¤[Úgóî¾YB—ùZ}˜j'^¿­ìSØY“1^²ó=ㆊa8­Í«]_¥ºdÜ ž"ÔÀÊr7…ÿî8¬ ¯l÷#'Hr«àu+E¥]SÞü¾Y¸ÞGoD÷Æñžzí5,‘ЬÁg/q kÏ®Ò%*B™LÈn-n²ÙÙ„rݦιU©n ß| ¨;Œƒë÷8f> Áo„ò#¨Ö%c_ʃÌñ2ãÁa’baÇV³ª>V><‰á+ü+©¦£©Ñù:¾ÛB,bÊ©"ו3|UÊ¿ÔãH6[ ç“΅韞jBI»;&cG©|CXe;›7èi eŸÈ »v«sµY«†þ”RmhÞk ¼Î’j‚̘?ÖÔ>ôÉ2í[=äÔ…tb%DiÞòxÉ¡áК±†"3|¥Íf‘5I®:½íœ´Íž¬£Ù0¡ˆôc¯…Ó­¼ϵyËqB6­èöÇÜgrzé«#!«Ö oq¸éÎNjåÚóŸÐI¶#CBq6ç0¤4,ñ¡N+ £™1“yÜîn›‹5Ã3÷ü´³×ª2† #™cLVË+ÍP#Äñq•Æ ÊNTøv P³‡‡Æ`U&âX¹B™¼üÔM2ÒÉúQ±¯&%VvýBVðàçkV¨ýãId(޵^sˆÌvøPººƒíª=Ž”°8MåèkÕ ðÃÐo©(ʼ8?Æ)Û)£ AIëЖ09±¬Ó[3¯QA!žPé 2¾S:È\ÞáQ<¾´"ž·%Dÿ>#K.ôz–3¤xj¯YÁÌGe‘Zû#ND>$e½ÀS1!Ìaœ)‘¬ÐRܶXµP‹—@fÕ‚.¥¿«)İۧٮÁJÖDj?l¸±qΙ‹PU‰|älíŽC«ògádŸLž,*öä.ýÍç\  ÷‡£qP¶÷¹8¬ò(GŒ»79§´E˜cd24ë&ºÛ2ŒûVxi,Ô#܃Âõ[»ôÕqy-.¡ËJýiÛolR)ߟhJÉ[ áÎÌeGOæ!c¾ß¤]† g‚NkJ©úuÚ(œÎ]~›¯ytKr¤  –×bÞb‹K{¬W˜zÅ„S:ïljĦ.OÒœ¸·û¶?Ù4è ÔY-b°†V³RdJ»·h¨ká†Üº»•£Ä±“Î&¥<ç!Ž@4t;Æm¥R)A×3ÿ–ƒFAÝY0ÕW¿#ßûé_}(]5Öšë»ç‡;ïl5ž!DzoEbãó„ëãÑ|EçÌi-¿ãÅ냾F~U×FÙÞËëzLò…±ÂÖÕí‰PHÙ.¶ q>¦\ÂËDß÷$”ìIÝ:£çO;Aˆ“9´LÖŬSÒ«_Ñ -r-¯2C˜éÜU– ™Ùn aj:tEõ©o2LvèR~3|ðˆnÆ‘EìºìóUÞ‹˜½²\êV»d=U¤ù] eÝKαVŽ­ c9g•ãÎg×£ÍPƧD(»ñ)Ê ºx“í7‹‰o·.âÍû‹YË9ÓϧßN?Ü~üÉ.§_þ{úáý‹ÙNoÿ9}~ú”~G endstream endobj 38 0 obj 3645 endobj 39 0 obj <> /Length 25 /Filter/FlateDecode >> stream xœ+T0P0â¢t.§.×®@.)Æ endstream endobj 40 0 obj <> endobj 42 0 obj <> stream xœµ\K‹$¹¾÷¯¨³¡zRïL( zª+|ï€Æ7Û Æc³ãƒÿ¾¥)¡GVõØË@Ó™JI¡xêY^Õé?/¿ž–øÏ+} ›>}ÿëËwúg~»œ¾ÿòòùë‹ó¯ë)h'|ýËéÓ®N*þö·?]üvuöz6ï|ðîº^‚¾žõE/׳Í_¼Ã¸*ãæzVbüŽyõºÅÅò+s i&¬KŸç1o½JËá,Å'¸øÒ]Ìç4‚ïãOGÀ îbÍÕ\\ç®öBT¸DWúò¶› ljÔ¿æ^à„¼K|†äÇò>¼!ålÇàéäðrç«ßÅÊ!D¢Óiüýz^ó3µùwÄÉkŽ§ÏŸxù篿¹}ù2¿R¯[+~U"múêË1 £õ}¶rÔˆS$ðÕÒÂv6‘¦®‘O:®ŸtëzŽ -FéÈz½Xã÷¸vR‰ ã ¥*?# qÊž¤ä€ÖK„Yü ϰȅÄZF/Þ§ó¤ ×-‹!é“Ý@ç,}­Ö ×߉úPh#àñÿðÓKp‘«Þ›Ó·í«†ßÿqú™=}{1ËBïËïñ­_Ù÷õéÛ‹’)ïËïñíj_½Ç­Š?ikxb›çQØ’Æê‘PÇØs&ƒÆê‘BcHŒ^^}%ž1y¶§±úDÄÔ1öœ‰¡±úDÄÐã¶-êc!Ÿ*1e4m_ÇêS!†±g$¦ŽÕ§BLCbBšLÄÀ#&Âö4VŸˆ˜:Æž314VŸˆ:CšÛ }Öñ“}Ø}Ø+áÐ:¤Æ4ê+EØêSÃS!D¡øÜî¸ ƒà !µSH§Q‡ÆŒ¤%K­nLLªY«óÜ…¢ ãä>‚Û‰0Z®´Ò‚„Õ]˜q·^‡ÛZï¸ò÷vɵ±7R´ñ½·ëkÀ ²RPÑ56$W]ó$,™ÅÅGkØ•fÇø.:Ŧâè½ðöͺÁW )y³["ÐMã°U[œ:'k/-¡çVŒçÔ!ò³YÐ@òÁލ/ó0‹ÙQæoÌfòÀlWUwQÿb´¾Çp«®_ÿ>dž6éô“YëlV؆{Å<Â8c&³¬]’ gùÉäåâ_ÍXï U€\¦p(åz˜Öô¥¥B5Ü^Rža²l•JÙ+d-…õïsÝÖA%†,)§ë·L™ïó³û§Ì_õd/wÀÈÌüÉ^‡ìw+a”°?¸”¸‚Ib¦ø$ óqA$Šý‡1še’ b¶×v(ˆÑ¬å`VˆÁ6±‚UW+_†) ÓŒ¹¡+p-ù 0t6 •±ÇV¸¢¾Íp_|J‹XÉâ>Ñ&(`gDM¶å=ËAܺŠD㑼å_@ă9ð©n=ÝqÜgýBÒ"Mik\pVé°dFŽ„¶Ò ÜíOïÄ÷÷îÑbœ‡ðÐËPƒ‡\FE<ñ°{Z9—‹HúV{S:`´HåPå6IݽEc¥¸§ø,ZÀ `j¦Xã™ Ñ3zçš!¸EÆ’ŒœÐQ `ÜVù"C,•åÑQ¡Óòd´i’±\X[£‹¼fqã{÷E.n5±=a3‰%ôA«¾Z´“*~ÌÎp7T!·òE_Á`ãŒ%L„…æmnµðüŠ ¨V‡Fr9(P%yWªaeB⩯G.ªÏ+kä‚Íp}VÕ0oÕçÉO‹Uw” -$}ÓT½ çy+»¶ t¨ KèkG ƒ6vÀi°ð¾¥lˆb!Gz ܯJ¥Xf …_Íj1ònY M V¾‰†M(I`¯)¤†sÏØz;21ò·Õ‡á–œç yh GLѱ‰Ù¡XЀf"£Ó‘&ØÍv™×,x–Rr[FŸ õÂ<¦1ËPùÅ(îë5;Ü¡Xv5(âÙoÜ!¥[LI(éHDënAÌ`v©‹ŠvòWñœÉ#¿sNÐY6ê¶ŒŒd#­ÁÓ)Jþ—¿U³ ñxÜÑ©&ϺÀT󡘵ön ÅçR:t¬&«ê³‰À¢ÔÌGŠRJúˆ‰dúw!±t킊ĕü71v*¹b¾õ^槈óä´G¾Ÿš$«¸cc£ ¬ƒ™Wæco½îBx“7åf ìÄ]ä]²)"Òaûl]ä+­o5†l‰^Ù¹vPÑ$Š\gŸ@Ï¡»~HÉVX?„̬ Åò’ªÑÂËï7Âà3 œg yìŠíÚepOŠ"©»0T1L¹?^„ß;NÖ› vGcYóï ¡æ¬ _-Ì]ïÎu¬$èK‚¡*.s˜Ôíä€ÌhN3YÙ†ó6¿Fų̂âkî9ä–ðÁã"XºKåWA\¿I/¥o\ˆW†Þ¬ÁV#Ò;‡,„šD0­˜æOiñÂ#G:Ì|Zìþ°ýYÜ Ù}x›2¸w¿«Çíöæqٕ±:oérŒý„_ã ïÒ§€Àz|z(a­ÇˆüQÃV†u1ZÍ¡œ(éqT©ÂñYïi"°õ‘ÀLk ÎгÝÉ1³t;¿ˆi§Ñ~dØé0fdÿÕLç áÿ®ìÅ3oœFÝŽ/¬ÔÙ‚uza¸ƒ³ ‡ê°l= ÏÀIÔ$\Þ¡ÖÚâ1°vE7=D)JõÙ%·yeƒ¢Ï`ïQê{pÝ:`D5åKâ~gA“Õ÷ÊE–ö —>œÍu·7ñÍž6ïQé/“¢ÕAØ*LYzøP”æHÒfs}`çØ&-ÌaòqÉJsÙ!Ƕâ2[KàepÅFÚì‡ó´È¯ÜP ä—yHÎ WàÕFX/À7C,³ªg9BWɆ«GÈ)Èò×ZÛ,5·ÏÙ[@‰¥Ë J¯ìzP—äÊÓüÈŸC]Xu_‰¿]5³¼°r& O-•³”ŽrëÊèZÿ(Eô4òÃð–ß$ÆÙ÷Ä8k)@<ˆ*Ùâ¹jWFg–œ?ǪĘ>ÈëUÕ#›¾@ Ò?C…§Ÿßbºyö’Q‘Y á.ѱøüÖÅðt#©¦*š efYms`߸&°Åý¹C­à ëì³÷èX´Ã[kHÙ~+„öÁk·ô¸8å7}Úßvic˜QË^QV#òuÄÿšú >ߣü5&b–¬DŸ÷z”Q×#êb2éÉrå‚aÛhG~kGMaoÿeY> µ¢shyÆO®;Vçˆy¢í.Ê6/MWncü@ˆ§:Ÿ¦´}ý-/,’oprÒ p̃I¨—PLj,ŽšŠ‘ ç}[eÒ•+rÔrJ('!r,pó*”Z‡UÖi­Íw‚©¶y«Øcjí¨ )}R°“4Ýñ:j¢4i°2g•72(e$p·ô†oñ*‚£L'zǬ²¶×ö)jnFG%YÆa€®Öwt½ªr-¥ôðõì†Ûº ¨þ­´˜(:”µXcª³×–”½ÈßX×±¤ž<Ê%ü»Œîw¨KvNPñÔnkK[%‰Ew*³ñ¡k^±C<[ƒ³å=$˜HÞ™´€ÁíqÁ×<³²c€½ \=ª%#Kl)^h}à'Óu»µ¯#©àY>©§h©®”/˜w¤ŽÑ©::nÞñ1>š Šï°ÁßY»ôD!>ê[¤ÌÇŹb—hÔÄ«ÑÝŠ²÷Ò DqÓ‹0Y‚w¦:<ëQƒ$íQ[¡ \låÎIðÌvS™æ©²ƒvƒ†»¶âtÍ(i±ž¡Ó Ëyíd€LJv~l™ Z)ºNp_iàöQ?Ì78|[®Ý¤ Ò‘tÃÊËŽWæêv‹S°¢ä„wÓŒëa;õPȶ¹& %³5•÷+éâJŠ,Q>Ì`}­é¹Ù1Mžó®­ë ˜ØD©˜–Á„Ï9OËû”˜ðÐÆ`87>VpV ’–ÎiâÝÙtpèX¥Ÿ1IkÕC¯}éÑasÅ@OCÜÅiüTŽãÜh)†7Çe|ã†;î6në’{豤ÜA÷\êTQYr'/NˆŸŸÀ°Ar·lBÒ¼ªvUÔáøkSÓ˜wþy ºCàPâÆ‚(çspžË.µy,qe»¬Ê¢ª+þ†7À¶œÎ!ð8 LŒá"0Š!{õ?VEi@æ¸ WJ‚·|Ь{Š‹ÊäûÆõÞcÛ,Dã+u¿Á¥ó6æ£GVëÚùåÃòÛ'N¯äfkm PúÚ’ÉëŒü*._Öf "Š7賤×þ®ʃnÇ”q(]$°Èòòê,ûNБR`17Z}Ç<_C+-·8ÃeÇ#õV^uê]Φ¥UÝdI ZígT#S¬Œòð'¶]º8t£Ï×8«_œhõNá£Ô²xŒÔJ/u™B¾e&þ›•ï„3Yëö++” †zxæ({»ŽÚgÛª,g••͔޴À&&–¬^ú8‘éCqãš’ÕäÝì†ù“7–J㜞Í>*#Î"]k:²¯7¥ó $²¡Î¥Bý¡xë]¦©â¥?À®Nr#EƒPÒ7í°4&^åìG`¬AU$šÄrGð€  !l¨@93=0ÜÜ­è h̲c ÈàÇ {Ѭä—rŽþ沸aªHQ±Ø¥7*/íéþ!«tn¤ž ®rEëk7ô<¸Üý7ªd:ý# nTßEg2»O¹­d'i¹™®ìÏrqÁA–cæz‰Ù ôþmÉzþÇ’Ùƒ¿%iey¨ ËÚ—¼l[ü6A@–6žç‡Psò¶ÿYá!û?.–-‡Y'ÕÍ…èrÞiÒQ{kݺøÖÞúœã¶#!’/ȽÎþ¹äKü§¢Wß?¼·íe{BtZ>”SK3Î*T\KMÀÀ«¦,¥©q"te ÉEßåt#×'ª^õbf1Ñù¥ùC¾úG|_N¿ž>ÝúÙºÓ/ÿ>}úúÝÚÓû¿N_^þ Lm C endstream endobj 43 0 obj 3796 endobj 44 0 obj <> /Length 25 /Filter/FlateDecode >> stream xœ+T0P0â¢t.§.×®@.)Æ endstream endobj 45 0 obj <> endobj 47 0 obj <> stream xœÍ\K$· ¾Ï¯ès€™-½«€F=ÓÝrÛx€¹Å6`Ä ¼9äïGEŠÔ£ºg7 ;]/•D~"?>ÊË‹:üëé÷ÃÿóJ¦_zúó/g—Ã×_ž^ߟœYA»øÀû_Ÿnê â¯Ÿ¿½ KXNÛ1èÓ³>ú[XývrG9=›tÕæ¿N/ñd9XËa¼YŸü1ޟΆò÷êÕi=ú·to{¶GïÓ]ù„¿å!Ý‘npOXü-ÎOÛà¥Þ+x88ïâÐÁœžÕÑœéŽòë7é:¬ÄÅ7™SèÞäÌI­9™£U'{´qh´î¤îf}º¦Òmùgãi{Ëé®Ví¼2lJpu$)¸רò Û)y £ä‡Bˆ³Š£;-¯Ëò‚¡þòþǧëûÓç¡z•zÙõç¨ü5)¦”_Îiqåýoé .JÚIãzª¢†@mù¤:‚‡gó‚ô…0 õÕI»t:)˜¿:Nœî!q0ZPèÊZL}Ë çR†ß`ö¨L6ü7¢=[ļâ«÷¬¯›;öÛúâ Û5ÁåVP“T˜§©ßÊ  »¼:/!c¦qã‚Í+ q‰°T_W¿'&¶$•8Äð}“”ðæ^äÇ+3¨Gx¨@(­µµ4Ùt öM½†-ÍŒE¹Cщ …Á5*Ú¦lP¾ûá¥7Ü×y_ 0aAY¶Ñè" “"œZÒÛ.V÷bÛž°¢ÄýжENrwŠïÊÊõÅpš¼Š~YU–¸ýœ°×q/ù"S—+®»­À‡›ç[«5Ň Ö0<ÓeåNŸو3Óñ6°ÒÌmŒ›Þˆ^¦‚ýŒi@Ò+Jn‰L!ʆK(Úþ‘áßÕÐ#—NÜÁXájªÉdº`V«®ˆ-_(¨˜A¹e’.ª"˜'ÿøàÄ)Úí7Þ d'ÛéÄ{Iáìǽ£Ž2KO¼ÿ:|`ë!·ÐŠÔ [*g¶…wIr]£0\Ý3rÇy܆̡8pFšÂ™™¡F;$¶[rfÉ©uš.€D¯Ìšf”@Å£[qìØºó™o~c½ž‡–ä1o ô‚½ÚëjºlrÅXwfà9ÞöbÖθ>lïh×G·†–îŠîŒo*7akd%mnUŽ‹MÌùmæJÔš7 7$j`™v{è¦eO|-ã‡æµ!î#‹_¦ÂÄŽ#!å;[®Àì®Úcp¤[›Š !电‹è³Ì€ ¤ÅZ˜PñÇñÙÓóʼáUúã‘J£’’ƒ{½kŠ߆óÈ ÏQ€ä;‰JrÒÆ¤’ûì|ðù\Ì2ˆƒaßpcå‰JÓÀQgœ­Ò¡o) 4ÛÂ2Ù p\ixõ¬„âaû@ÄQ©(–Ìpñý|³h80‡Ž‡B‡k–¹4¦-u­B*§f‘!® É…&f'j˜/‘ÃâÓÑü ×k2]€f†d5B‚%r‘զ贈\+ð[Ès{4®ÁážÂ] —BkÉ['Æ ÆRÈ\™,(‰1eRSÑ| ˺•t ÂÂJçÌü¯[»s{€v]µ´Ýn}RãWªqñAâŠV fõJË­™6Ì­ö­™š…º³‡5±ayam°«áA  V3“W ǧ'Ãþl‹!Twgé}çZZtÃO»œ&aHÚ‹ dUÜ"P½I“Ë()º)þ oB±¬œrÔpéa›6\H×®MbÆíÙQÊM³ŒÛs(§KÆ-¥ã¯v:=±çÝ%{rŒZ¡ÿ.‡sCLàäÀñ:QîH·8s!û8pºs@­Ìþ¾ Åx$×&9¹ýMÖÁ <Ž!¸]®á÷² ˜Åq823f4<«u¦ƒÒš³Xa‡Æ6Ë2l-Z¥Ó5與‰½ÿxvòNÎhWÙfëœÏÇSƒÕ²"¼ùîÏ›°&î« ¹Œöï ¸µ6:p7¤Ø¹•¯8 F#­éýp¨Çö3aÅ8õ$ó^<5wPUáó¬cu »j×¾÷HÓ$#§+u~wF#ö?‘;ͼØ7&®؈)qÐè»ìUÔ!DzšsmÔ*mʬÀ°ú¾‹S¦óãÉÖ¦±Ï…šðIàóĈȺ8é]Gyí ü„+bešÚ /5ª¢= 6KùeYÌHËȺ‘¡6–¡g/1ПÙís@>´¹úiïòUœ>3\)ÄfBšRá=UÛmë]5¯‹Ö’,Æà-3(˜¨Š± kš]‰×ÖŽƒM¼p<É<ëØ“?^TüŽ4Ü^½å±tî^ô yÈ«¼c’]M®¾{¿Ç|ÛP2àKóâìsføºÊÏÊÉÅ`u‰Õ¶(:ŽˆsµšrxErl*aK)rYäà5 Ó’Ú‰ Î:ä0_ Ox *‚]µŒû¹žì:FÎ0,®Q;T>æ¼î¡%˜Þ}w)ƒjl(|9iÌنٻ”N©(ËË8™6ü|4zR“P¹yc4?½¦Bé­š9 ©CSlŽ f3º¯—PØ @"M ŒÃÊ2°Ñ¹¾‘á¨â›3‘}ôø0… ;ÃâÌ"}CçB£¦Ú M€]nx¹ƒC•ÅÆG4òvÙÈq#R}•‰ë[úiì=úeD2ÈB]Ʊ¹Ò¯YG{´v¿ÇÛâÄÿÁvSZ°€óqúôý´øz$qVâçšJ`Á^ ÔDrOÅÖ÷äâ#Þrâ–F{QFŸ‡=3Õa.ð;ZÅ¢ñ e·‰ÄV†?ÿ“î³½¤P4ø|Na²‹czz¢úù<œ5†Hã'2¯\>U fæê;XÛ.=âýBcÇö…ƒ6ïÛuPnà8ÚœìàœÑûeƒš xÆœ:OŽëš tŒì^èµ3²ÛÆdT е,äF«ËÏ,wá¡—žàšg‡˜mm4ªÑÛC(Að†ùÓÎè5h$/ˆë¾¡ •%(Hĸé©ÒU$lßSÚ(W˜¢ç]µKö÷³ÄAeä7î–Ù˜ ó¶T.¦jø&Ó@ 4µ°M H@/lÿ®UCÍ1kºr¢¤¿–‘1Sî©v]…^x2¥LfJP¹¬K©*¥K=9h\«Ž™»w¦òº”Bñ)éÑ42e…/Ô;(zß B¸þ¾ìÇ× àD©§6kpdWëàKÿ®#7Ìõ£z¶y¥.`íq“ˆJ7y‹GÚ^võìCïÚw[躬v×£: Õd—j%íN'm  á•ñŒ4­M–ÙœgÆÏ”–e"¾äÚEáræ×}éÿmÚ=õ¬áS/*=£¶3t™»d3×­k›óݾUÝåØ ÿ²¢€wF)è!ûp$‹ýÓOZÙè8ŒZ^Ôá·'muùý·Ãìè·§$ Ï®ñãxu ñ/{2á(E~ã¨xF©×ø1ŽÊž„Q]À1ã/1Ÿ-Ï—óõˆÆÂ'`$³FJTÆÊ¿i´r¥Œ@×ø1YŸ„Qã=GÍ¿iÔr¥ŒB×ø1ZŸ„Q—%ÞSFÍ¿iÔr¥ŒB×ø1ZŸ”b(è$ÍîÈŽîH€Ý9X »·ÅEC¦u‰$®CŽ®©[.ÉV—-ÚÆZÌJÄHJ½·h’ú«3bèïwXÅs¿O8.[ästõæ(鑨ØHí^ÜAoíê 62º‰™Uuiöý_’É´Ådê”B‹FRO¾ ™Yyí×4øªã¤äàNŸlIG‘ϼ͆1z´¦8Ã+ÌpPù@Æ« °áìpúgS=j7“œNºÕ^z£èg÷ÛÝýåh¶šÞ™šJ0ì._Ó˜iˆ[&imgÎ#\ðFO¬“'Œs‘ ž˜Šf¥ÛÆÀTØ^w”€D|v¾.>¾ÔÇuk_Š‹o¾ì›Ë$Ï·»ÿKš$½ÐÜ™ïèq6ßÅLKW!>Tϓ洚V«ží”V¯Jþ)1¨7°&ÀED›Oô=y¬pJ<@ºœ³Šj':Ï1ˆe¶ÅGƒdæýVª¤‰b§íTÓv„²ŒqX‘¦+Ô:ÁMkî±jåÖyÄÂ?m“}’»ß¥ìÓÔ B·µq¦¾åÂ9ó¤ÝmØ´JQJSÀ˜|PÒâ«y Š_á • u¼Ï–×ÞqŽâû3üâk7 JûÔ¬/­¾°bÆò“"ƒ4z{—Œí È{²êÛãÂÑr@9¦ ñYá¥f«tÍ—¯u)å³eûŠ|ÿ0A/¾Ýå¦ðüÙyŠ^ûPí„§Ï(äûàÇ]ðÿ)ȪÌ*´ZÍÿÎ|wog~7Nwa{—bsPb ªÖQg”Ùé~ì³›L¬;§¶rÊrbS½÷Ùu™cMèÚ„ø›¹[©9±Úiž°zI: ¸å+à`G3oަ;4sŒPp(¨N²o{Ý»ÊhŸ<ºgÙ•î|:ïZ ¢ÜJã_v€qÃübýÌ`÷[ð¶è[3¹ñšg‘Y)@ñ6Ú&»w¿ÂoóJ[U4,†Ú3Sõu>#ƒ¡ÂšÐ·Ñt˜î*I´åõ<*áÌ¿¯Û+À¥lvy9-a‡Ð­u´ÝÍIn]MÁÉîya`„↘ü¯’žQY¯•²ûNbZ çý–TN­ŸþÙ¦,õaÓÒ—§Êõaóî£Á—*Tè{¡g¼I±¸_dJÔ(SS¢Ÿ¿>]øÑ-‡_þyøôþÕn‡Ë?ŸŸþ lø‰¬ endstream endobj 48 0 obj 3718 endobj 49 0 obj <> /Length 25 /Filter/FlateDecode >> stream xœ+T0P0â¢t.§.×®@.)Æ endstream endobj 50 0 obj <> endobj 52 0 obj <> stream xœ­[K䶾ϯÐ9ÀôŠo h4°;Ó2ÛÆä䔇 ›À›ƒÿ~HVYERR·mïhEªXϯ¾âÎ5ýòòó4Çÿ¼ÒSXõôý/þÃô|:Oßzùòñâüe™‚vqÁÇß§O›šTüÓ?ÿr *8¯üý¶^ƒ½½š«_ÓÏðù¶\½âüæïz¾9zÏ¥7Œ_ü—¤ÒC}¿½Úk|~:ü£›oêôÍÇ¥þ ÷uWÿÎ>q÷*n_zÕ×x˜¼.~.¾å‚¹½*øþ {ܽÅ ì€"ò:?ÄÏM¯é÷ôYŒ†7|\Å…£’Øz½dÃͦˆœwJŸ’ßŧ:¬$W9+'Rá’0£jÐö~>íí“ä %Åó-Qî´É_?þørÿxù:ô¥.këy¿—ö÷ùT>msÞâ÷á½­SfUr²Ž*bᇺG/Ø’’¡ÓëÙ$ñI =…ìªø ˆ‡†Ï+l´§ñ-z‰É³¡¾Ø0}·{+ÎŒM’òƒù |¡((}|dÓè«.,\Ê£“š£‡z‚b•ûДåGnã×åâ·ñ<•#¡U€Ë’:¡ëAŒÀZõø"HÿΜlms‚óäwÂL S^€íàÀ`*‡A  ¨£øµ!g±Ï7}µkÚ1'4 8t‚î›ÝŠ,zEwËzκ¢ÓR i7ocTgË:q6£–Qjä^œ—lgg—„93üâ.¶5®Àа·,Êk8·qÒm©¤ áá–S —j¡îUŠ¢šû æ4]ÊÌ[Þ°„B(u­{DðãÙdâI'˜þãß°*…ç¹Ï küFœ@™¤(w[³r Š%wô#A¬ÂÅ5¶Žßñ£ÇŒ›ŠV4j¡¿ øÞZ¹“'PÕ Ã+Û‚u3kq¦lJ~¡„MY–Š¿XŸ@Ï ›ÙäõðÃÖS¤:;kWÝɃŽàãRÍÎQ±8Íxë ˆjh‘®Þh«O¤Ž[¼6T ÚØ1?ª[.ä-Mn,)êÌô³½˜6x ‹¢Uÿ/±ã*Ìa³ÆŽ|Dk(Dž‡„J%>Å[ã:@>â1Ùš¦…×V¥ÇÝzÐçt†Úe”ê¤:_i‘‰¡Ë íˆ!@À…|+0¯é«bLr•2I‹óñNç½1°TâïÈøníZ?ìÅBGQ˶À†%–Lº•þ K‡©q®0ša¹²‹\Òj¤«='¦øw»]LÇVÊPlŽÓ*¿sð.»pè¾•Š–u®X  âF¾Åœ=æû‡âڅЕï¦qùEÓ »~·)·<òväR=ð5ƒo9I'´&Èœ›0Tˆ7%´ŽFuˆ´„ü–l@ Öõeq?Ù$!|zÚ ó<¯6•\@5½—ö¦g"˜ÝŠƒ—BA!Ãi’LkâV ¿Ëö'Úú®Õ$OXK~˜spÅ‹©‡9X¨:kuãV×1ôŽyÒ™©þÝû×'ÛžÐ#¼Œe§Ç:ŽÆ5@¥‰ZàÒ±q)ÛçÄs§†>Éc€3¡"Z·  0'´¾”n »ó§YèC#«¥/‡3c–«Ã3ª8°cɸ#ÊŽ% ûº (\0¦Š¸ù•Ñ‚Çá·ŒOÓëÂ'«¬q5ÙÙ\4©ûÛKT÷ ú¾Îóíã_õ=¥bõäï‘YúΨ% U§®CÄÄU‹´Öh´wè4³ë* )Yʶ%‹*fãÔòŸw6´ÖEbArÕd¯1ÅÚŠŠ†dU™)qCT>µ‚}˜°0£×iUCTUT7²3<µ¶ÉVüN1¥gî¯_XׂŠ*¨@•€b9Y 0á 9oUÇkðó9z·—Œz¹Ãwk‡Ihf–xNÉw´%䱨ã)r­'wçõžógˆÕ7jùçÓÚ7^Nš*ÄqLéFD†Ü‹ä¼išÏÒ•hM¹{1RxŠ—A’ALzªÚDG_š”< :'Þ¬õ²HÎ,dô~t˜Nk0ŽS¬§*ñk¾Ø@e˜)–_<¦Q"5J÷ïwQ3LÊ{¦¶)’ã~`§/s0šŽò8è{É L3ÒÊÙ†à"0jk=þ0c82ääÙj—Á0•‡aL_ï› R¼MdFNQË},”ñ~×ØØ™±Iæ¡v|®Tß[G%DÑñpïÜ~Ù©ùå@® ¢¢Q·ÓÖÂX9ŸIrj{ôž¼pèz²P!WM¢©mÁ ÷³ƒh rúdD„},é>80åC"ž: âÎ3Ã6<1KT>©¦­†ùÃc³@ñ•¼h Ã0 4.¼¶øš©õh­ÁÓg]Ρ̾ àowCsŠÑ蠹σíS\S§6œ¡øíI^l×êìø~T?_ íTcVµ RF7F%oÓ‘÷²9¦ë”ìÜ-…wC£ÊF¤nÛT¨/jÖIj0fé¯j²úMLÅÖö¥‡S‘Ò:Âñ ÜiÚèÚ­l7«Õ£„jÑ;€™e4›ÏiÇ-ûÝÆ–Ò…2FÆp(xÇàÃ;›²eóÓËiˆ [ótœ€Ü^ãEXÍhã'؉ñâ'ûÛ·—tKê¡€?ýð2O¯*ä·I¹ôZþåßÓU1g´¤×vPêS]*$×Ì(¼Ð‚°‚ÐÕ²pP±*Ú *‰CW»Kͧ‹Ó²4µ7b~šÓùNU©a;Õ‹(&L¼ÄS.¤ó¾Wò1QaAŒ_±~–*Ýdº7Þ¹ôDõÓ-àáM}Ò™¦:ÑF{›s7iÙ‘B~Ò j+†é­ï|ÝR1~¸¥±ÔÑQÚ°CV‘é7Û^Þ‘Ê ÷ààÁ€LAê÷öñ˜4‡š^MòE…”Üä;$„qcxvChºÉWÇÊ{Ž*îÚXÞô5Ží>;ßšHÑÀ ›k ®v¢Žn5”éQTƒ2äÔ”ÙEÔƒ_³„àÄyðé`º2ÐϘӈ»"®,òt W GÕ~·[e´M¥l9 ¿¢*\œþN­ê…œuf,O°>TÇùýØÿùÊXËB¹M@íáˆÑf ñ€ÿû‘âÃÉÉa¸ú¹«ŒÂo±67Õ ˆ9BÚgZÜX¦ ™¢[ ,ßÓ7[î;m7ºDYIiÞKò7Lq°ñÌ͉Äò¿p |5/c ´5bL¯ïND-oCÿo)òeî‘,'¸1<ïSÌM Fˆ·@(:s3Ö£kÕø„.;óþš‚ =`T¯û+“,Æ»‚—JÉQ‚úUI³Þ•tè9Í£íjt;Á£#%L>º'q„Ð4ìˆbæù¢&_)GþF•FþyÁ×éçéÓý‡›~úßôé㻳Óû§¯/ÿ%òŸx endstream endobj 53 0 obj 3174 endobj 54 0 obj <> /Length 25 /Filter/FlateDecode >> stream xœ+T0P0â¢t.§.×®@.)Æ endstream endobj 55 0 obj <> endobj 57 0 obj <> stream xœÝZɎ丽×WäÙ@e‹¤HJ@B@U§r€¹5\€†o³>x0=ÿ¾cá\ÄÌœ©“Ñ€Z)®ñ"âEYÓYþûòûi‚Né“_õéûÏ/ÿøÛé?áëtúþëËûÇ‹uçåä§õ¼ž>~:}¹é“šO¿üó2«Í\üä'gݾ¹‹›Ýº©‹_ô4¯æMOð¿Å.‹Sjèì¾Bgõän8ÂéÉÏn¡nóØA9ãÞa, °ó6_¨õÆÏð¦áüàñð g·}üø²¼|ëmÝyv¼u¥Nj¢½ëiÓâ1;xÀîáñv{õó›Ùh}1ØÑp³ÅWl6©ÅÞðMQ3ŽÑ;ŽN“ÓÞŒ·ëìýíâÒ~áa-þ¨ñËX\ÆNéç’ûÌIÎ+Ë ›}Ú.wÄ7oh&X¸OØEœ’»_Ó¼{§YôQ¼ó¶¹îh¹7®½×}à£5iEŸÄQåÚ$„»%ôMœtSöѵ†:Ò©ˆ¹ÕcZs¶w(1åG£¢-I—Ô’¸gý•Í/ÎcÖ4zí`,Öº&åÙ²1›rmZ‡›ÓäÆçɯ©Í¡·Þ³+¤ÉÈÊhFö3ý~´¶Ø¹M‚ÑèžѲÜìÊf±¬âµ† Ôëy~\ämžŒgŠV;‰ÕÉ‚²Þ†^ G'[÷obl^¢y’÷ëµ3:?ˆÜ{9Ú&¯ –‹S `ª’~‚ƒ&zÌÍL4ÏœYÅÄÉhîy¯üLŒ<*šËÑÐ<Ô¢òÏh‘y ÔwÙFPÓÿC33Äߨ±sŒ©›UélÝf3n¾ã‹“=›'|1Å@2–¹ç‹™f#•›¬YSGUÙ$1_/ÜQ>ÀcÖ퀬j@È¢}¿cйgÌ®[p_ tóêæ¹\»ÛlÇÍc-ÚÕ<£ÅyI ÄàMüfÑâ¡«~†õáäªì¨Žµ˜{æxöˆÕ£jW9‚¯ãÑÇÍŽEjqQgý„qE‹‹³ÐC⨘Ï×bÎ|éõä)f³ø¢*{¦ ûÕvĨ*ÍØeÔܼŒ›ÇqѺõ)-âäì†ôv̨y+kijŸ¡ÅjÌ#Œ:²¥’QSü8£ê­`„n³:lVåÖÂæP‹³†'kñz J´$Ü,_)=å¾A-úJÙÅ3Ȩ¨Œ4< ë=Ã=ÜN£`ÈU×0–?ÀgÅŸ«y*Ëé5͇c=L¿ ›Z±-ØrMèAgæ7|KËÚ0mªv…äòKÞ¨¯BÎ Ý–‹yÏÛªÖ>ÆÛÌËyÀ}„Ûùü$…ŒÁÑÕÇÙ#.U#zﳤ©nÞãá†)}s‚¬v Ú&p-j§³¬-ZƼI²jˆÞª"W  ©íwÅû³ô_ÜÎó‡ÝÜÎ=voƒ¦5)‡w6$r±`He7XPº7“àâîj³yÜÛ õÎPjåRæ’¤Ö›)ÌnÊf¸$ï# àGÇH£ùƒí ½iHKôêW–3ÎàÖïa7™³ª±›³‰7'¯—¬M(ö²Y²Z5«3Øñml^ÖÆ'!º¶6Ø=…÷Ee¢ÑâòÉn4%SÁ¦Ü [sHŒÑ%ÑÞ²V¥Á“7d_Ž®›ÙNí¨@É.È'ˆdlcŒŠw­ƒ_…çî•@£Gó] µÕ¾y•4—7?ì ?Yé~9ÀÁDEÙ‚*‡TQÕgZïgH, ßKÛ`fMßÀÅþZ¡ÖJáu¥^E¢€2Fòbf¥sZ}­8­`ÿ¯± 4âUê#D28ǧ b\Ÿ`¹5s³ÀŠ…Î•4rZN b̹ŸÆPq/½·5céÝšïJ(gˆŽy§HÊbþˆ1yÉhGÏy‰6-qx:ˆ5ÿU:- zU U-r™,MÅT]‹áï*“±`y ©^fÍvâñõLö?þݲœmÏA(+kÍ‘ö=Æl$€^½YktÖÅ´¤Ë‡Š±€N-f.l-B¥‡É L¤1iê䨋 ÃB“)ñ¼¥È^¤€:»m´eÃ|À3Mq¸H;F¯qCþqy6` 6ÞÁÍé}"2Yþž  hÐ Ñ(ÓöÀåö ÌTɶrOÓ€pÚiË6e[·G(ÜðÛ^—2—¨v1T8.ê/™|NÙ:C´®¿4þ–K¼;¤RŸÞŒŠ³÷FÏÇ%ãŸÈŒñ›t›ða ŽÇ})«cJ­qƒ&uÈ2óê v/¹&×ð<ñ‰ãåÎl´¶ ˆâ Ó²œ93àгÆÌ¤Ñ•8ƒ·.m9žJ'ªQR–a¹•’½¬ ·öÓÁ«<äMÎ&‚îqx†D)²è£…ºwTÙ7šXÇšHàžÈþ˜JBý¢Ê‚&®{ âPÞå\gMETy}>“ºáà‡È^ûîi0‹iÞ›ÃAQ€\S>•2~IC™¶R•Â![¦?Qœ>ÏE‘qEr±³æŠ¤>*2Ì\ J©ö’^T²Ö!ÌN7Á¡™¬ŸŠ]ˆ¾}:¯ FÐØ~?bNµï›Ӻ]îДG,Cˆçµ?¢-›òp(N–y]à:)]½Iˆ¦%U8‡ç›K+n #¿E¶P2h‰„ôº1TÆ5ü][c…ÖsùݨNŒHÕ)â¨uR,jŠ=üð,X즵qÝ;±¬ØÐ½SÞLöM&…nS3qP+“¶‰ù¿Ãö.p[tŒGÊ^µºÖÿè\¢(ÛBàm“àæ€à-Ñ´¾>O6NY[ã QŸêvãîd²‘­ºùt/ÅLÕâS”j1mùJõv<áªP Nds‘€«’§Ê(z³>WœKŽöñê­¼ ½Ž…õSm8xÌ%wQQGØ*êtu˜&íT4¾0¿¿,°Gòqãñï‹^u ÔOR¤óþ-¸Å¤ÓmMØŽ·•‰!ù€–W¦ ïùòrïãz|],¹–Ùý~}_CuÙh-5LI+ß¹íU³9 , .°Ôt\°ßö6e©°Í\xWõÝ1P*s{¨£kNYÜíPCGv"³lŽ+Uj.ݰ˳uæÅ\Øt2EÌöÒfS — Ùž*s¶~ K¥=xš2S؈!ü§ÎRoýûØ`¹¬Ûÿ´f L—‰NÓEŒW1ßN¿Ÿ¾ì?ü:ýúÇéËÇw»ž®¿¾½ü˜ôq¯ endstream endobj 58 0 obj 2727 endobj 59 0 obj <> /Length 25 /Filter/FlateDecode >> stream xœ+T0P0â¢t.§.×®@.)Æ endstream endobj 60 0 obj <> endobj 69 0 obj <> stream xœåykX[×µàÞûIètéÀH€ÌÓ€ ÉÂØA¼°@âáÂHرó0uâØÆÏ&¹ÎËMrÓ4mœ¤vÒàÄqÜ&w&½I“ÜÛd¾ù¦ÉØms3&Ä™¶éÌdb1k ¿®›oæ~óoŽ8笵öÚk¯½ÖÚk¯Í‰NN… M# C[==í>„лá´¡íQþµA]À—"õÃ#[‹¿ù!6!™ddËÎáíï½þBJàIût4¾²M°#dLU£@8qå¤pð‚Ñ­Ñ;þ>e ð mß œ¬zªð€/Û¸câ(ó3ðçÇ[CÏí™ü+ïŸ&‘h7²Æ²¾EÛ'&C—ÿøØý€ :m†½TJ)NV"•¥ÈJUªZÃiÓÒ3t™YzôÿË%yWò.º[âA:4 >o¸Ø:”v ´ðÅ®=ã·ÿ¿Õ"%ñz ½ŽN¢§ÐÛíM6íG÷ ¡ 7°¿~‰žG‡Ð9ô8:übÏ‚œ»Dè!´ño³áŸ 0º=ãÞ ò^Cð fЊ¢ï¡9ÛÏβoÆW¡Ïñiô&–£;±Žÿ  Ÿ Íð|žSùz€4¢qò#ƃÀ È* ¿ c߆žÁëÐXac hôYVf%Ú‡îhêúÉâDÊ…¿€ÆÐQÐd mCëPg²ù4U‚3&˜ÍOÑË"íàb_ésÌ9GR®<о¿Õð ¢ þzý$>?ÇìAÇâEYh—ÄCV#Õ—’GÈA4ŽV¡AäE@n‰VðôõötwuvøÛo[½ªme«o…×ãnin\ õËëjkª«*ËËöÒ’â"ka%ßlÒgh9:U©§È¤–!•x,Þ>fˆ±V‹ÏWJqKë1HÞybü€ÈÆßÈ)çðMœB‚S¸Ê‰9¾Õ—–ð û•ÛÂÏáµ½v[úøØ¼¯aÖ*"©€˜ÍЃ÷èGÝ| ðž˜wûèŒgÀ òf•ŠKKHQZ‚fJ•ÅŠ-³¸¸‹)öÔÍ”’J‡1…ž@0æïèõ¸ fs_iIkLmq‹M¨E“¶Äd¢H~ŒªŽò³%fÍqhpÀ¦ Z‚õ½1&}gÏÌ̾˜Ö[bqÇ–ìúT3ÅJ,nOÌF¥¶u^§íÚ8&)ä,üÌצc™ÿâFJ I‘r_# zÁ¼33^ ï˜ Ì-LZxÎ23«RÍLxÀÂÈß ½æ^=hˆyõŸQ\—œ¬·³-–Þ±®7F ½üh(ð粘k fmß"ÿo5#0˜lj6Ó‰œÐ ±éŽÞΣAÃi$8l}12@[.,¶èzhËôbËÕîðf[WïLŒ-l Z<`ãƒØô ÄÓ&ê SÿÕ`¶Ì¤iùZGŸÈ˃V­Á1>&±‚Y ×õ Rh—NDÔM¼æ 0€U›Æ×Z@ •ã±x’ÛGõ €/-‰ùl ×w÷Æ7B é#Ïl™zÀEcnÑ}1‡e"–ai¾êOª–g¬«Wì’ìËh‰¡¡d¯˜Ãã¦#óž™wB*ËÒÑ{9.Í.ã gœhêsSæÌˆ+«g¦783 ‚°Ò†ù^ƒ9&ôƒû,½¡>h`¡%—`8³8bŒ´t÷¶uYÚ:ÖöÖ$I4Pql¡ç&1–^CB „\,¥0…ï%¦9 ð^,ÍõðŒÉ SàæÀà"•†js=ß‹ h‘Ôˆ-á=!w’â7•Ðpjñ-J“Rä´ø æ>sâ*-!ÐÌ'†)Ô¨¾Å&¦2ЈIÔ–zó|¯%d鳌ò1ÁßKçFÍ#Z9i ÑæI_u߀]g,02Có"BóÚ ×7¶Bᢾ›š[›ù™K[× nI D yk Ñj´qõÓõlñ`Ê×ó̬ е^€‰Jz¾yÞÍþŠ&P<ÆÞΞDR´ãe)îÄÏáTCÒ $ÅHÂâN†HC‰Å¬$ƒ•0,‘¦°q ”TB£a1‹]PZì¦%|šªw‡­¿ÂÑï¬mp8Xïè‹{¯‚ûù>ÖÆañù–øÖÛöÙÞ*/«®”ãJ¬‹2k¿}–ùýcâ0,¾áWbá„ö,|ÁÖ°·¡Bô¡3˜‰ƒÞi<`$ÁìÖuëH›v–L¥ìM!Ê Eî —¡ÝpÔð¤á”Aò¾á¢aÁÀ °ÁP”¾‚J›0`dà † ôá‚Aj˜[¸ äŒ>ƒAï7gªý“r·ò¨’Q @T*%r9a6ܼkž¾·aGÿ|Z­£¿Û|…c¾¼ õÓ ÷÷§/k$Î #É’Ù±%_MtFÀ«ª³ÔŒ%ßNö¬9üÒÆÁÇÂÞÔ Üôö5S+L¦S=[ŽhÏËÝ“O¼±£Šø§++nßîV¯«{<|r¼nÓVUË]j×<ü+ÐÎìz¨¦åÈ)䤤HXV‚1ò>%Á‰B)óC‘ËúrÍW¸æµi¸ÖAµÔ: qyY¡Yg®„0¨4“Kø®o—âgãñGGŽacG¶ž[÷|5¹3×â1¼3–‘ìep3ÌlgÍ-|õ íÀdÃaÇå£ÔTô÷Ã(5Îþþò²,ìÄ“LåéoßÏ\ú†etkƒú¿=zþ ¤§j}Vc•‘,Õ´diíR¢¹B¶RëKåèCUP[²~)²s!¦ìFÚšªÐ¢UFÃz”Ëå’\ðÞ™âR} r½Ñ—+Õéò (¦Rk}©©Kó˜\”†\.g­ÃiÓ:µNì°Ùúç+l ­Í9¯­Õ:6[yY¿­ßfÖ.«ª®ª–ÊÔXÆX;Sd-ÊÌ2bÖ¢u¦qVfVUu#®Nwj™ç0!X«U›ÕÏxV »”´t ×SógåYô¨§RêågË›JœåÕ•¥Ak|%þ™f‰£\_]_¶¬tÌùí ‰'ž•µÚZRî°Þ–ÿøÍkâZl[© :ž)²—]Ü G&²¦³HFVAV0‹Ù­9ª!M³YÃ,Sâe ¼œÁh-J}*•¤¦fg¬ERNJ¤éeLÆF)ØBx1z¯®¼D-½²evbÃZgEò?òÉ¡ø\ýÄŸŸí¹P3ùÂÔΧ?|Ä~_øiŸÄ³úéo^Øwagíÿú3VPÿΈþ}™Ð†³Hžª’«|yØK\4:¥ÄhÔ:ˆ‹„ÉnrŠQèCõDË›³ü*¹y †àu9Ãjp Ä/øÈk°Ôí,4†+×›ÎÎÐõ–‡Í:â~)þ ––ŸœÌóûWèÒ|í¾ôæAÁ„?g^ø¶›yáHvè躥 ä¯ï3R “Qµ¡Mq$‘_ÏÄog›Y?*Fõ($¸ƒË±wùšåd³ ·ÚúlDjÍ´n·Þoe—™ñò¼“9À´b` ^²¤ÑiÔzQÚtI³ûœ^£5Ôø’LHó.:jöŠŠ› 3Ô„¦†"‹‘¡¦/rèldœIW\K$„m.^|¼:¸¦%KBíe€§0,G6Ûå6Ž__üª~y uùèêÒBß&wëàòl’çÇ{2J¼Äd¯Ë‹÷I˜â•Ë—Ê™Âeõ9ËV•gù|ïîà‰Í5…öE~XZ;þtÂÓ öCÞ­@MèG‚k¦ï2ÎÉXÃΆ LaUeIçÁÅRX$O^*o3’R])A èTæ5¨Úk6Öš]‹uEÑÜÂÿJ/á¢"× ¤ÃºÚƒÁY¢±š¬Äa=j]°2V«Ù_Â9ýi¨C&S¥Qã9ó‰¼Û¿M ÆÍHÍ<Åú&Žþ„=mÔž…muÉ¢IiÖµÒqáʤ!eEÔ°™:mFf!سËÔŒ.#“]­1ªó[¬ÎV»ž‘æº{'W>ñTûô»¿0Tw×TtÔJÏ)ªƒo~û—K¯ü§®]Åç«Ã}5}a–™HI1TwT-ë^οp|óÛL˜]Þ²¡Î )jqj…Í·Ù^›ÛýR×@´²Åš²u«:ƒ°V¾×÷»H‰N %òí²ûeLP•ß'gîÄ1iÅ}y™Ö”¾²NæÓŠúQÌAÞ,†Ôˆ)rÎ-ï–¹=©<¥|CÉ %§$p+SeŒÁžL“£©Ð'¾3 â[ÐBªe‰Le8E#A,ÒÑÜ読]ÌŒ45‚«éï§K®ÆY[[^F­‹è&‡úÍXFs¡;å˜y þÀ}/½„óëx+~ÿy0–¼ûm€¤ÆW¦9ôlƒý$GP1Çiš@°e=Bb{¢ëÁLÅ}õ9¶Å?¢ g!îLlì÷¡dwþÑ|r§ù ™(Ì9æ¥f¦6g«½Jeö¢‚éR-õ›23t*¤'2ïL¦¸ygr¥amrýTÂ8fYìL¥%±)Wjñ֬ʗ0ÒZ$.§“˜0„ÉiìÜä]»§»ˆ­»ÒÙ¾©ÉPÚsw‰|ûb~[K™LRR»<ñª2¯dý÷ƒäŸ¨Îç¾bþ§¤P¯PµI¿K?£gôÅrµO*MK˓Ƚ9ÇèŠ%9BZ¡/GPª}(ç¨üY™)È«E‚5b¸s4ñÁl¶d¾ƒ‰84éõ§W:a×¢—Î"]Œpíù“uwàXÜß(îi÷è3½·W=ý4¤:œÿìÈ•hû*™B%9 åÔŠ‘'ŵ}4r”Š!_&£•„r¥JuµšPk]J…溊⺚jŸ]VU:uä¿&K‹Ÿã?¿ý6ŒñÈ?_¸¨/~ ¾-`ÛP Ú+ônÑãY²È–,¼© GÊï-'+Êo/'ÕxiV09Pwò:ž·!ŸNgªS¶*2 ˜&LÓ&ÖäÐIJýù|ñ±bR\œÏq~ l4q€!]¢ÓjkICL×Wl7fàj##†MÁ˪’•˜˜¦ß,#Ã,Ÿøá؆‡'W§=©ªl¬­ò-qöî\!Ü3Ôðá/Ûg¶´ªŸ–Ù[ºí_ÛnÛÒÔt`[+®\µ«ÇnhYeªnÊWj—4•U4,5¦k‹›‚«|6Ï5äÉ(­1«¶×Z Zn©w+õ ­w[!ïjõ Á|ìÍ_“O‚¹Ø›»&—lÖãV}ŸžlNíi}i°â0â8n€c8®0gR`…ΟʙüÔ×íùÛnµ÷Tri°×37o5­-÷¼<¹uön÷•?üåË×m«7 Mãí¥Žö±Ú¦°¿”üúÇ}è×GqÎŽÿ1þÙ=Ï -zæÎ{~4X\4ø¬¸ŸÂ<š!Æx8ñ„æ]d†·³Ût2m–u–ͦN‚+s±Ä¤3M™öšXØMÍØl®²I3¼(}:¤[ý9F.¥êÊüRæ»wSÌÁ¬E˜–ÌÒȈk]*“ÊœøVók~çõèÉ28»0ø§tÝ¿D—'[öÜÔ›o½jtmlnÞÔZ\Ü:ÖäÌ$?þiü³5ƒ9Õv3+·ÕûŠØùx_^mfNÖØÆøçñßNüýHyéÈswíxbc‘}ø‡çg`}e‹g–Á:‘?OXs†9j¾ÏÌz*ÊVyQê4”i4{qéšÔdNd/:µÄÌÌÚEÅÿuy Ó2AórÙò‘Õ%/]Ë]ú¦žMÍ]Ó·—’Wü# zš¹®fºnÎ\ÇBW‰}~/øÉ ºòÈ†Ž ¡`2¸uIß’±%LkA_™ÊÛ›GväîË%w¨÷«É®Ô™Tâ&Ý$H˜"8Å([ßW\T,(¤à F¡(µ"Øã/éˆù­V‰ÙŸÃIüÜEÅe™†àTpâíÏT‹ÛºèÎþ(¦ašpØâ)j±èËØnèf;ƒ›­«¶­¬î_Y¡z‚6=2ùÙ=-í÷Ÿ¸÷åIg¼ÐZ³œ!¾”e«ñï9:R›]ÒPPZº®Õá;òÑáî©é~øÃi=þ缕»7ܳ*qVùøO61!¯`»Cº_JØœŒÂfgd“Éœ)÷*8Τ+v+Ž*XE&Ó™Ëq9­]>tÞåÐ'Òwb:8y&¼æÆ,Ñ™Y¬Î1ÒØ}ÿúò—T\šôy™F­ ’ÜÆžhgÍ–¥Ìñ¥{êDoœ%¯×DG:õúÆw^cÐkUÈÄ<ïeOË‘w•Í”‘aö¨zT!ÓV·®nsSiÆ’<]u#«ÈÊÉÚ•5“Å:¼ù~5>¦~JMÔêœR¯äÕ…¯J„bÎ'‘Ô¯ˆå`”óAÉ)ÖTûóM\“_£ÓÉýˆ—–Á±B ›«‚æXº,áÓ Gädu¶ ʳë\™H²Ø)Ö]–ë™™å„wµj1X²é7­T2²öÀPCêœvÛúÚuM’¾¼kÜ7|l½Í¶ñ‘ñm?.eèæù< ÿÍeí¡Ê–AÁhtš+‡ýåñ^ëŠÁúì¶Žü¶;Öü¢xU¥ùþÜwﻇW޲«‹XÌ­Eßþ»ßÿ óþ¶'†JJ‡~°mêĆ"ÛÀãˆ}P‡pè!¡y ‹[Õ}j8n­Ó¹2= œÄb<Š Â¹¦CeO'#gÚ«0Cäd‚›æG‹/£Bíã¸4B ¢!š9vËñRy”qˆž|œpzîwÑ:LKÿÙVË¡Ÿï“Ðÿ’ìÓs‰–à¤EÍ8cC52ÕØIÞù(ÞþX•’–¡•JÓ3t)8ã—P¼™.·K§s5»2É/ ^¦â·3nÈÉÙ(ª«â©ô½éDÜhõz….ge^òÒâ\g4)rº (˯×À¦j·º‘ˆž¥‹T»Ù’Å´2¹ƒ.ÖŒ{Åök–t®jÒgÖûÚ‹k¾%ñ1ÒööÛ¹[Þ¸T¦ÒÈIT YnÃÆæÄ~7Åã™…Ò¾šú¯‘)ñÍî½w\û*§´ý0úA,~\£ß›®cײQö=‰U2(ù‹´Wúd%²Ÿ¥(RæäùòIqôl°dB?ä€c9bJ™,¨„ik.^sUG᪾ö|! $CíIªg´ÈÏÏD– Ú„¥H §„,C»Ð£I8eàô$,Gj\”„• CåÕ/ÕvÜ‘„SÑn¼(S gí8Õ˜•6M–$aŒŒä¹$Lšüû$Ì eä£$Ì"##O¤gŠ’°å2®$,CaÖ%áT̶'a9Êew$a%ªaLÂ*´ž}' §¢¸dQ¦­‘ºÇFÆ¢c»BA>ˆøçøŠ²²j¾)2†&ù–ðäDx2 Ûù¦-[øÉ±‘Ñh„Ÿ EB“ÛCAûª±ÁP¢_w†F¦¶&¯ö/åob¸ ]šŒP¸Ü^Vq­é&Ʊ࣓`hk`r3æ;A__ Z·ŽÙA™‘±H44 ıq¾ÇÞeçýhh<Êƃ|÷ÕŽíÃÃcC!‘8šŒ€9-7MMŽE‚cCt´ˆýV“¶‡øÕh4 F£uÇŽ;ì$óðÚ‡Â[ßÕÝ9 †"c#ã0mûhtë–žHˆÎ': s¼nÆÃaP>ŽîL†èü#Sƒ›BCQ>Þ¿æ1]#“¡ÐV:Ó)Qã£cC£üÎð MDÁ"”ýoI¶—²[®v5En4†FàŽÂ½ …PJŸ è9¸+PüªjB4<ãÀ‚´Á£†÷„ø ˆ2ÂÐjy·À:•? m Á›öÝ.ŽeG« }P¤\ëÏ£Õâ;Œ:¡eRÏh¼Åø¥p·„ïn]#¶D®ÒËA£2˜ñ­z}·Ä1q~ÔfQ±…j¸UÔz3ÐÂhžIûúÄž%µBß!Ñ^“âL©”¨(;Á9&ÊîŽ.‘Ë/ö¤ˆŠ£‹\Ý·±F†þÔ^×8‡DÙÔ· Éa€G“¶Üvž5Šýç‘ÿO=ß%j·]sµHЧm£"6ê`p âÏ<7JJʵ‹ÐVàü·ö‹¢€‡Äöˆ…ãIoÛE™[!ªzÄh\ôµE·öñ°ø¦–ˆ=¢ I@ôÕ¢ÿ#`ÃA°dH´•NÊ¥<[’þOŽhoê·EŸN]gã¢>Cðäa.ah£}†D¢eƒ×Iÿ¿ÕÙþo¶ì–[Œtͦâ¨N,𷏄 œa¯à¯ýŦ?y‹MÿÍ»Ôô•·ÒtðËÇ¿|þKfó僗Ék—ñ3—±áòºË›/3ìî/ˆâsï‚é¿|j5}öiƒé_>5š~ÿ;¯Iù;,üΛiúí%¯éµKï\úÍ%F¸ä¬ò^òêMçpjÄi¨§ ª¦çbÃ'=ÿ¹áãž×šä8¶ínxá& pæU¦—ŸÃ™§¡|=DŽ6`ÝéLsX+ 1 &îþáÿ'ÓŸÄ>‘òû?žþ8ö1«ù sš6¾~{÷ÛÌÆ7Ãoî~“yãøç~«iâ<æÏ—¿pž™8?}žhΙÎÇ9×¹ð¹Sç.ž“œ}ÑjâçÊæüssÓsñÛÛ\ú/÷ æ_ñ¿2ýJìvúåØËDsÆuæòñ££í¤Ï4;#±Ø…Ø1ÆqÊuŠ<õbìEráÅ^$Ž\/'ŸÇN~p’4i°U`5D9‚'7÷ÜP8aNÐaÿ‰'˜G[Mx­¦²‡…‡ ýéñÌ\/ÕgéqµÖûw†“æ¡S½ñ#<”WîÊ4ÀC¥ñjt<èzp÷ƒ—”h^Å*Æ*'¶š¾ßµ`ºx —æcŽc$|l÷18 qGù£ •ËÕçzù#eGHûá‡Ã‡™²CXsÈtÈqˆqé^î ¬e•¨ n¤<Å{ÏR@ðsÞƒ{¬¦+ëMû÷5˜öÝWoºå‚éɽ˜»¿¯ì>¦ì^¼{öÈUÞ¸! ±5wÖ÷d;õ=2'Ó#‡@ÛF¸Ï.\²Ó&«WSz®wÃZŸi½·Ü´Þká^‘Ö#ÁL[ÁôÌá”— õ& ƒÏâl¬?]iæà•Uìà ¡vú ¦Ë D訬ñ …ÅÞ÷ýøâ*¼Ê›gjóúLþ9lÖâ•`òVPÌ÷ ¸OyñEïe/™öâÌ ]kz¸ MÁÛL—f£f·†ÕhšvMXsTsQ³ ‘¹€vYĆù©L,ÁsøØlw—ÍÖ6'[èl‹Éýëbx¬°‹>…޵1éþêY»®wã#}{FÍym±Š®ÞØ@^_[,€@i¸¼ÙLÔ܉F¢S6zá$A6[4 o[àF¶Å SÛ"Ñh$I€EmSâÓ‰ˆ±ØÁ :etˆÚ"8‚è zС'†\}€7²1"Ž,Žï qX †h$¡HD¿qBÿcDÁ endstream endobj 70 0 obj 7505 endobj 71 0 obj <> endobj 72 0 obj <> stream xœ]’Mnƒ0F÷œÂËt FBH ‹þ¨´ ö"c²àöõÌÐVêôl3zò8,ësmú9|u£j`]o´ƒi¼;â ·Þ2ºW󺢿Z„¾¶Y¦†Útcžá›?›f·ˆÍQWx§Áõæ&6eã×ÍÝÚ/ÀÌ" ŠBhè|Ÿ§Ö>·„Tµ­µ?îçeëKþï‹ÓZ²Š5L¶UàZsƒ ¢BäUU`ô¿³8á’k§>[ç£ÒG£hw)<ÇÄq„¼#NwÈ s‰¼çL…œ'gäŒ9A~ä|Š| Ψç‘÷%ò‰ù„\rOr8s~|a¦žçžeÄûè&Ù?EÉþiŒ¼úcO¹úcOÉþeØ?ÍÙ?Cg¹úéכ«ÄYÿŒH¨»s~<ô h.8‘ÞÀï›±£Å*ú¾¤£y endstream endobj 73 0 obj <> endobj 74 0 obj <> stream xœí; xTÕ™çÞÿÞÉäæÁÌ$!ÉMb !IPf’LÂ@Hb2€Øâf22ÌŒ3"" ÖDm±U㣊¬õ‰¬E¤š(X­ÔÇ"ÝZ¥ßvµµ*.ë6¥l—v-ÂeÿsîÌ$DÀÇ~»3Ì̹çüçÿÿùÏoŒ†{¼$•¬#@¬înWÈZri!ä B8“{UT®žÐù3ÿ?Š/´¼»··ÂCà3yby×j߉§¾½áVBRnêôº<‹á‰K1dâúÌNœ¨PIøÜˆÏuvG¯½*yb>‡ð¹¥+èv‘ÉŸÏ/âóÔn×µ¡ßñ>á³pu{{ö„çbL%dÎû¡`$z¹á$! ÐõPØò~CH“±ç8|ÓÂs:ú̃ ê’ôÉRJjZú8ƒÑ”AþO½¸d€ìÃ÷Kd¹{Ÿ|8} Îlåw’õ¤g^æöq›øé8÷9BÞBÈdl7ŸTâ,!¿yr”s’]ˆ£ŠË䪒tš„]B«0 ö“YBDØ/´ ®‹à§ ~ΛÈë$ pï‘y>†JØ-Ô éä=ØÛÈGHí46“‡Èä%“ ’>~ ߊ3¯Šûɽøâú~n ÷r÷w#9@îŸG¶pP®}ä¯äFpò}è—•¼ùqíÇý÷’ˆ@ÄœD~Î!÷H«ƒ}çÀtñ{!}HÙIÒ è2“ ‘ ÕØ#ÜËÜîv²•¼ß‚kàn½P(<&Ì#›U @;ÙŒ¸ï¥{t>n5ÊNßk(v¾Whç¶‘…ö¤Äýs*ÒÜÅ·¢D>²?½:Ê4›[›SºšCö'ÍÊp?bHZ‹R„dŽÖ'ÉN2úÉfÄÄäÕÍÿŠ;ïÞG™7sßåÿJöC)!>á0êš`öòl’N€çˆE6ìà‹žÖ+®”_[š?Ý2êQ6$É;HËŽ´ÕòÀÉ“-W ÙâÒâäP¤ß!¾ºÅ÷§[´\)ï8a¯Ó°ÚÛëp®íJÒ'œÆy{[£DwˆEøÏѾCvwÊ7n.¬¾Ùà­žŽj#>¥_ð‰a6J"“¬©Â§D÷)§ûx”í}{èÄðöÐÛCåÆ|cQ¾1ß'ãÈ>þ‘ÒŸ”þɟúŒÿç0yt™$ƒ\bÉÒ9ÝÆtã@ê]ÇëISZ²>¥>Óp|¨â(",›3ttïÑ4¾ª|g»™ã–qÆBã%èÌ8¨4^ÎUVd žë¯¿sûà`ÍÓ=/½Â?tâ[ü–¶¼ðЉºÌ[¼ž?ÑÌ3 ø³¸é^j˜.êÇÁãÄÈíÖo”RôÉ(€Þ`J§tçìÅUUH{è蜽CÆ*¤ýc•v¾9ߘ™5›3\<ÃX8£ÒÈõrk”õ "{öxpãFq‹ò³Í'¶njº÷_ñ훹Ëióä9e±ðúžL&—[³' ’ôÌAQ?~+·vçM) 㑾>‡ÊÍ7ÔU&É&!ëEÄÌ%oÐß$šçÄÁTîù ƒ¦Ô['g›y½YOð¦qöɨ´£C{&JâàÑ¡ƒ†Ãø>z'Ê­%ssB9[s~™s$GœKærsù¹æ¹Ù¢%©L_–l‘‚$Èù 9˜¼ì´°9?U;s–9+”QÃõœTÊ¡†“„¾ã;S÷?»âÕ÷/W*G•W¹’ãpIüÃ7Ý;˜Î_}Õ ¯^rÉ“S-Ü¥œÄepµÊo÷ÞµëÉ-T¦5(Ót”I"Ed·µxb^ÊøätòøxÝ`ºQÞ÷ÜäÁÂã­ãSÉx˜@ý?ô™ö‹Q¬7ÞFw02gÜ{ðèñ£C†WP6c•±ŠÊ(Ï)Ï-Ï+—ËóË æ[s¬¹Ö<«lÍ·´ä´ä¶äµÈ-ù--Å¡âõ9s7æm”7æ¯/¸­xkñ‘âÜØÖØ¦Ø†öÜö¼v¹=?”Ê É¡üu¹ëòÖÉëò',CýÄ<í2nº?* ãà’™•ù3˜&Í`ñÈ¿ðÞö‚÷  ÌÝ}Óö}'>åøGïjÆé}áªÿ:ÂWúÖtD~³«¤ñÄ Û|®—Üó¢©ï–ÒÒmÅÅÇ©/O~¯¢®ŠÉ!뜴T>=¥-/#4IjËËË­‘Rró3ÙÀm27˜7M4 ƒE¨¼)¹RJ^viÍÖ§'é3 ìS Ç÷b2:ˆ^PU¥y†AùËaÃ_ÓlÂü0ýÆñUIì{iÁNRŒ1níž,MN™œZŠÎaI±¤ÎNž-ÍN™š"™»ˆŸ"MI™šQ–Yfžš5%wJ^‰\’QñiCÊ†Ô i& <¯“t) iãÀadÃd!'¹¸¬dnÉß•ô•¬+¹­dkÉ‘’ ˺™9*6ËåÌ™:Tjñ 懨Ö2®”£*®È‚[š»jÓ¦Ž;æî}ø¿ÿ媗»|¯¸¾s«÷ ëwÿþ¾]ÂÜ'§Lq:­Žüô©÷lºï™ÂÂfÌXzÅ‚–¢qÝù-ÛsYÁAó/ÌGýI¹5S—’DŒ)°1} yw’¤Ó}½‰êÆ;êkïÛoÐ ÚÕ’ñ@ÖWùÎ@Yãa~žÃrߣ˜už[ŸQ:v™Œû^8±ShÒçEFã!½‰d®5ív“¾!í&‰Úm<ÚmR’)ÌË´O2?X13ÓQj¦rkʸlCöºìÛ²·f‹48czŠEhÐ|ÔÌ¡¦û[ž~å•§[îoZøð²ʯ¹éœnуŒíÓ¦}¸ÿ‡Ó¦m»è"îr.3qÕ…Œ¯wðëI¢`Î2>‹ÉŽ›H&q4ѱ4÷Mp4aî¾ ùO!SÈ|káÄÔœdÓ†Œ¬Áq0xqá@ñîäÁq{&å\<‘èSt&“l/¡ <ŠqË‚vˆeqåÍFUåÏ´O]7uëT@aÒöxŸ?lòË8*o4˜¨‚g`¹öðw<üðw>< (Ç\Û¯¸bKëOvUí¼þÇÿâúUüe¯½ûîk¯¾ûî””srŸ¶LÝóÓoº;¸j8«îpo£ò–a"ú„»K­“E—ª\Çm$w¥ëvK|FIJõiãRñ\°Cr^9ˆ[/]º`G:Ÿ|ñÒ¥ìhÜkbéè`Åñ!Ãá *÷ŒÕÜbÞj†eô\Ôåpô”,¤§#õ[þ“î…\™òæàŽOîÑeÞÓÒéÞ|¼ ÞÜÜôü±zõ›Afެv]ŒÕ»ÚÍÿlæGWæÏ¨Ð5iA ž3=Ì®ãÑ®ºAL0Ý:!Ù4î 0™íر¢y$:cá܉kÈ]_RŸ¾/¹OêKY“Ú—Ö—Þ7®ÏÐg\cÚ:ñÈDcB†ÄÐ-¦g4Q½”ܱý‰;oß¾ýö#œI9|ä?•?qFxïÐë¯ú÷×^ýø>å5eHù#*Uxvdr—2½ uÓ'´ùÔZ FAx#Ç‹ôxÑqFBt5<ŸŠ:ËHQ I†·5óÕ|™Î;ÌÎoÒ jýãYeSQ?‰õÚ‡ÈÖïÍãW`ßÇoà×ñßçâõ”P2$cÖ5s“`’p1¹˜+AÖÏ 3¸j¨Êõõ¤žs€C¨çé¬úÅd1·– -zñq~ð ËÅN]»¾‡D¹5°Fè¯Ó­'ë¹M°IØ$nÐõ“~î.þ^¸[¸[¼K÷˜ø¨n‡þEý{ú“úË1AfT&ÓBá²—¹«¹«_V¾uLh?î„íŸneõúµ0ýÚŒ¦ÕjÌ®'ãõYã2½²$]ã$ZÑUPÇ5(sКV“ ?ÃÆô /d=•~W2Ù-resþ­â°B‹†Ã˜tNbº¹ ÓŽ%tª¸7ÏÖ<œÃ!ÌT’ЩÿñéAêáÚ?Ý oª¾ýì©£s;?¦<¾„Æ\<ÒújÖW/O‘ÝX_éR?\_<>„Ä ÉÖä–äöäP2Ϩd.]øÒ¾(v]æÇ¬Þ"¼óºwìßÝþwãæü…äéÙ]ò;HüfI+N½çëã—M¼·t+9‰×ÏQ×ÑL¼)úDÞ É,1“<‡wÐ#ø!¹F8DÖÓðÎ3Ÿ<'øÈ5ü-䄹†“”Ñ=ÂG³›\&J¤Œ¯"/á:}«ñÆ4Ä¥rÜ}|ÿž†>¸~'L|€8_¼OÜ+îÕ¸ÉÄOÔJÐ@î¡Ü f> é=tÔ1žïæŸÃ¾[ó÷#m 8ÿ¨6p¼S‹$•ìÑÆ:¬É^ׯz<ßÒÆ)xß;¨ÓL÷s±ÎE:¹$c‹66”Œ_ic#2~‹9!*Ïx_s$ËlÔÆ<Ñ›‹µ1à|™6plׯ"™`þ¦6Ö‘LsDëIy£6N!ÕæÇµqZQµùCmœN:gçhcÉš½^‰~ökƒ¡ÕaÿòΨ<Å]"W”—WÊ«å4 {]ÝÙp—ʶ®.¹•BEäVoÄ^åõ”J§lI·:]«ºWËåWçi6ÖyW¸÷à5ÒXîÈ®°WöäPOG—ß-{‚Ý. Óæ Dj‚Á• ÃÅÞpÄ È¥••êt€/@ªQ¢3 U—•yp~UOi$Øv{}ÁðroiÀ­g`”*Űàò”ˆ×+wx»‚½%¥òYp\*7t­uFdw(Žz=²/ì–maï*• ¦¡UC‰d$)N%sÉ*kÃj–¦Ÿñ%j³¶¥<в?"¹ähØåñv»Â+å o4Ijñ†»ý¦~Dîô†½HkyØ@Ñ-(;Š…ÛPc¨g‹ Ê®Àj9„à ÁŽ(jÌ*pÉndZBÈh§7¦'·;ØBp íDì¨eo ‚Ú+`*)(AdÙ‰Ý~Ò“i ÅÈ6ÈmA_´Õ_PÂ8 {Cá §Çíeh<~ÌßÑõR¤,hfwW‡rÒëv{¢ÈL·_#D)„UU"ÚžÂSq,r·—J-1‰tZhX(Ͳ`XŽxÑíGV5ñG‘¦Ì!ÚUtTRUÇõv¢c²šÁ× A/Ûè Ê‘ EŽôt¬ðº£t†Êç v¡³QÜÁ€ÇOåˆTK’ѹ:‚«¼LÕ‹ÃNFÑ u–Z%÷uMŽtººº¤¯¦5d£Ä5BÎ`ý",wÃÞ1Å–£«C^Ÿ •ªL\ív­ÆhÁí¿ÏOÍÕE×Ã"uyÚjçR‹Tïp6!Nd®U¶É-¶V§£vQ£­UnYÔÚÒÜfGuˆ¶ÉÑTߊTì í("ªmnYÚêh˜ç´à&'NZ$g«­Î¾ÐÖºÀ"#²f¹Uf ¥È%âí‹éæ¶y¶ÆF¹Æáls¶Úm ),ÕNCSóB»Tß¼¨©Îæt47É5vÅVÓhWyCQjmŽ…¹Î¶ÐÖ@ʼn¡`ª8quHtCƒ½ÉÞjk´Èm-öZ ­öZ'ƒDÝ£&»µÍMmö+áÂÅHX¤%óìŒ `õŒ3&~ŠKñ8›[ì,q´Ù-²­ÕÑF-RßÚŒìR{6×3X„ú¤ÆkÒø¥6¢s§zBÑÝš€uv[#"l£là„4½Ë~­ÛŠRßÖ‚[M,ª¹Ó¼VMè  \uŽ ñXÂÈb§ŽšÝâ6=Ž-jêeé½O"5õzVy1Fh* †¥ M&½þ‹t<»ƒê™'G\]H wÑ(bP˜+]]¸-2Ìæˆ€’b‡a(ìÇ-½a“‰ìêÁÙ°ÿ:íkÇ“@ŽK@©Ä“ƒÊØ á)å_åíZ]аaz–1Nü¬Õº5Ñ™úÜÑêX©•—3äž`TŠ®T–$Vqwét¶µì…©ƒ$µ’Ï¥’âu|Žutj¤%y7Éc¨ñ‚E:ŸZIŽÕJÒ×£V’T;|aµ’¤ìyÕJÒ¬•¤x­$Ÿc­$¨ ΡV’NW+Ég_+I µRbøŽ(—ð<Ç$q¡Ê%I+—äó*—¤ì²{ã….™¤@P>ï’Iº %“¤•Lò¹—LÒè’I>—’I³d’?OÉ$9m‹Îo¦lÛæSu$Å%?ŸêHŠUGòùTGRbu$ŸSu$YÉçSQg(Ã…tÚÂGþ…tæÂG>‹ÂGb…ÏÈÚá³ šh ÞÊŠ©JÏØ¹*ëõ¯ô—ù1ƒ\[ê •iilTçŒÔ’ ‘Õ$Lüd9é$Q"“)ÄMJð·‚”ã»G!“„‰’~ÂÄK\¤›XpÖA_Š#é·LZ‡qEØ“½¸g~{R: ª3‡©:‘Ò*¤Eÿd&€Ð”îù|ëp´÷-&=áFXÃæe;\L"±ð;„0ˆ×p2î"u[§a‰ GA|¯<ÍêØ³‹‡ÄdT+ÏJ|'BÁÇv¨²F5KPÙ£Èy5)÷Gƒ_…ð¥Äß0Jãe{ÃLîRÄáÅ=õ ØbzˆÙâT‹Ó5ª[/³µ$½K­qatL15àÊj„éd;ý¸b|G™=©ÂlõŠuÕ(­Œ–#îC=#|ètÒHøKvÕf.%jíTo–ÈôóxKg!>.Ƕw\f?®Hle3Ô˺™®Wâ\-ðY¼PÉZ¾n†-îý~ÆS'[ójr-gTšÕ-šÝUk©ÔTSýÙÂø 2ëØþa*… bj>æ×¼ÀÅp¨š–4œQÆÅhr38ê‡*ö ­ò®ú²—Å«ê{ ^RÀ,G÷zØo„ñåÆ=.M>‰E=´›a‰²•˜~|8êÒ"iÊ0q 4¯Pþ£è¿ª÷SŠqЙ‹Rp³Ý1nÓq¡U¨J¯ w9YìÐ}”•S'ÎÇ©ŽäÊÁ(Æ8[ˆO­ˆž¶jC܆òoaõ7i|ªškeØ©Ž(fг9jdOtvþ¶ \ӧɬrÛÄd¨ÇuU;ã@µ„ÊQ-þ¶ m Ñ€|9™(%§iav¤òÔ±ý”ê¥rÖ¬Y™ŽãXJ5]ª|Pý/¦ÜÆäoÄ·ÌäwâŒ“ÙÆ†øcxc¾ÓÀ0P¾%¦EL>ÓC3£PÃ਩>‡=®5Á*µL_Ôn”ó:FÉÆ4Ò6¦$1l‰ÖË;¤a L>;ÓT#ƒnC=ÚÞ1<£ú£ƒÉZ«éZÅ©ú½ê Ú­e2RË^TíšOÙ˜îFJAí´„ñ—Bµ€Mû®MÐYÜúMšucü8eçZYÂbÑΠlÌÖmÃ1RÏâw¡Æù¢a‹ç€Eš6s6R¿±8ŠÁMîPqÅh´`ó§Föam¨Òðª¹ËŽçš›Ýs¢Ãy{äÉX5Æ«ÑĺӒk+5 70ØîQpñYõ¶¤žYñ»Nbí6Ö ;v;VkùXÕ¯>ÔÜ­Þ‰«^«ÏÕ02\•Y®LzÙjüLi½“àˆ{¥ìbg¿e˜Vì,ŠãRëJ«(µÈÚ<ý %r3 ±ó^¥ÒËÆQ­2¡òõh°tþºQ·áXÿçTÈcÚ &ËX•C¢þÃÌÞ!í.åg¦õd©†7Lb÷²¸N¨Ô¾Z÷(«Ç½b«&£» TË8÷0]KDíÑQšËW±×WßuºÐ}Ù¯S?HÑ]y}qý iÌ~ü%÷ƒ¤³ê¬äÝ <Å{1ȳ렎Õa‘¾²¾’|J_Iúÿ¾RB_)ÞaøßÙW’Fœ°_]_Iã¶öuè+Icö•â}9}%é ý‚/§¯$‘ÏÛWŠÿW§ ÙWŠÇÛȾÒéNßÓw—Ôû¹ZI|ݺKÙ]»»ñåt—¤3hWNÐà×»Ë$1;µšùò»LÒ׸Ë$ê2Åïº_f—IúÌ.“ü¥u™¤ÏÑe’¿°.“Ät°±Îgܪڶáú—×;’Æ´ùWÕ;’NéÉ_YïH:mï(Þúâ{GÒçè ïÛ;ŠeÖÓŸ(§v|¤sèø$vi.dÇG:¯ŽÏ©w¶sëøH Ÿ3õ.D‡&z ~+‰w$F‡>•žÇß\•1½¬ÄOãÍê¦RV¿†pnd5væ¿9cÿÏ2{ü6¹ŠŒñà×YO~ªÀ±Lø[|RÿÝM‡¿(pTÿ*‚?§ÃöÑ"øÓÍ6ñO î‡?öÃÐ1øÃ1ø>®†¯C ü[|t°Mü¨"àÁ6øðƒ2ñÃcðA¼¯Àïx¯~— ¿í‡wxÇÿº~ó<ü‹¿Fð_¯…o7ˆÖÂÛ ðÖ¯²Å·øU6¼©À/øg~¡Àþ~xc_®ø†ûráŸ*àu^Yo_™ ?Ï‚½ ¼¬ÀÏxIø©/(°GÝ <¯ÀsFÜP$*0ðìóâ€Ï>³L|öyxvðÌOŠÄg–YOÂ3Vá'E°K§ûa§O)°C+ð¤þ1¶?Q$n÷ÀÛLâE°Í#ÓƒÇxTGxØ)ð£ÓÅUÀƒéðØŠ [ûá¶ÜŸ*nQàþT¸ï‡Åû<ðÃ{ â'½¸G‚»¸«?M¼Kþ4¸7ÝÙwÜž.Þ1nO‡ƒïßö¼ø}nÛ¼L¼íy¸m°ù{Eâæe°Ù*|¯¾«À­·”Š·*pK)ÜŒbÞlƒM7¥ˆ›2á¦؈=°5µ¡Öáï¸ñ;FñF¾c„X§@ŸÖ“ß^»Vü¶k×ÂõXã4‹kŠà:V+pm:ô¦Â* zˆƒÈ1ƒkŽAH ºòa¥+Œ5âŠ6ð+й–ãƒO¯Ü t(આöcpu*,Sà› \¥ÀÒ+%qé1¸R‚%YÅ%°XEHyQ 8ÍÐÆĶ К WÌϯP %šhZh›Xh€FàÊæ; âü p䤉ÌKƒêûÁÞu ÔòÓÅÚcPó<Ø€U¹ \~™I¼<.›3N¼Ìsf§‰s¬'ÇÁì4¨V JKgeŠ—ƒY3 â¬L˜9#Eœi€)pI.T¦AÅ7RÄ ¾‘åe)by”¥@éôd±ÔÓ“ÁRÓ¦‰Ó<0µÄ$N-‚L).§Ø ¸..J/E)p‘… Œƒ|”3ß²òŽA.Šëœ4˜Œœ¬@ö1˜Tña¢<055^,Ü”5Ì d*¡€ L QVc ÖÂ8¤+–š%¦)ŠÐ©Y¢€d€dô¦W )tpQ@0΂<>óÓ3Q€à<ë¿ËMûßð"_5g|åüK/A endstream endobj 75 0 obj 8294 endobj 76 0 obj <> endobj 77 0 obj <> stream xœ]‘ÏnÂ0 ÆïyŠÙ5)P@ª*1 Rû£u{€’¸,ÒšFi8ôíÇl“vHõsìÏ?gÇæÔX²W?ªïÕ¦ñæð \e2çÚ¨pÒW cYÔ¶ó`hl?–%ËÞbn ~拃/ðÀ²¯Á{å‹cãöæÜ `¬ª¸†>öyêÜs7@–TËFÇ´ ó2Jþ Þg> endobj 79 0 obj <> stream xœí| \TUþø9÷Ü;èE03õ âsÑÔ,y 2Š 0¾z2Ì 0 3³3Hf¶kjf>*Ãõ‘š«è¢™µ†V®µYi™ÕÖÚÚV[jf®®µýÓ-dŽ¿ï9÷ÎD3µÇ~>®Ãœ{Î÷|ßßïùž¯–×]iCíÐýˆ ‘– ³kAéÄ „Ð[áhK•Wv]Ù+0þ >´ÄUZQ]bEˆÀ;Ú\Z^SÒ6ß;!ña„¢×—ÙÌÖnâ÷iuëƒËØu„Á{¼÷,«ðN¿·Çâpxx|]¹ÓbÞ¹²þq„®[ë‹*ÌÓ]ûÐ,¡Îƒà]q˜+lן=ÙÞM°¹œïmè·çš¸‹­»Ü6WÉ×â‡ðþ1B£áa?í`¨cï%]X›¶rx»ö"£¢;ÆÄÆuº®óõ]nèÚ­»Ò#>¡gb¯Þ}úö믔<ðÆ”ÔAiƒ‡Ü4tØð›GÜrëÈôŒÌ,úþÁih'ÚÏ_P=Z…ëà­¦3k…gÑT 3{ð~<_suèkô>@ÎCûI½ˆðh” ³}( è[lBÛÇPƒ‡†éD$æ‰ÛÅq§x\<€†ˆñ€X$zp*Y'M”êà3”¼&D£7Pw´Š<èr‚¤’]b–>%H=:TÀÞ@c1Zf/1؉f 3„˜Ù+@+àqÂú¼¿ܽ€g£ƒè÷DrÐj|äÚ΢ÙÄ$Ì¿LJ€ÿ½€ëì_<"’bQ¡?Ì÷@«˜ÿîJHùó5š”Mh½n§.&,¨0Õá=ø”î1´½Oî ¿!á9b‚¸IÌA‹U "´p¯`{t%¸dgÏ †]¨‹p=:!…îטD@s»P• ]ð©ÖE‚LÃñ28e«]ѰÑb2ì a3Aj„œ$ M…Ñ ´=‹Z´0qyuC¤³°s•xd^Œ gÑ’…ú¢ñ4èÅ T‹ÐŽ0$#½¹MH4Z·?YÙ7¥Ç}‹W%2LÙ†Æmk_£ì<~Üd±‹4e›tÃ6’Øf›˜˜pøb‹‡èÇŒ›¬ló²4¬†¢,˜+œ CöÓ0oÈâkŒè6)þ‹¶)–2å¡È‡†=i6Ô†n§µä¬´²dŽQ=¢{Dõ¸ƒ,oz[xË7ˆÖ†E|÷[×—96X‘¤ƒ¨-@öˆ8ø$ è¤2Žžk5í’6¬gë¥çŠ<®+B‰Q=ÒzDEàEE¢)qb“pB¼š2X4Ò¿ãOìt }>-xøì[mGgžýæeñ#u¾Y…ðr\xyNößï.¢oÓ¿Ò÷èÛ‰Œ #epÔ ÈjH££"…Þ*5þ[øàõ'^ýË/_Ç]pÝJÁó.”réN}Awâ|=¬å¬§·ÓÕt ½¯ÇÅðl`4@Vñ-µ#ºhtÃ:&$ÜG%D4±1:‚¤ ê•@R†;nzþÕ-3Ë_oÀ+Ž©ôíûü¹svÅ-¹–áYµÅ¾ùÒÁ-|AÈ÷ž7{öž¼Ð3¤^/½\:è;Á¬êOS×@× Ï5€Éû«û˜ž×ƒüá%T­CbC.þáŽw+¿8sæ‹Êwï¸ûƒ*Pà:|N™þT|ðî»è^zˆ~H÷Þu÷û99x .ÅexÍ(•®Ø 膇ø³4ï³ ÷ûî¶4­fΗ]ï;ZðùÓ´+ÙB·pÀïÈ–¦ ºeñbÎç›à/'xÙQRZ"wšc¸/Ý…3pߦÆzÑ“³3‡»À¯¦ß7ë¢Q{v¾ ±1Ñz iƒ¢‡7×TVM_òàܹꢿ ·?N‡;‰_ÿìSüê)Ä}Úvþ(9©‹A‘Ü^Q ²´ˆ€fâpLœf­x1ÔÕ ZãÚqìØ×Šjg?°lÙ³kIƒp×÷§6YÍ8 ·'ËLc÷?¾>~±ä¿Ô…KÚ ûÏþÆ,¡ Ûùtáϯ/úÓä)/}Cãð£ûÿ]',½gÁÆvÂ]·íÞ;hÐÖ~z|–qGœI?yuÙö­«U»öB[@†ŽŒàêŠyÔƒ(©iƒ§ [VßfÀQô«º5kVÕëb–+³,nJ&]œ÷âfÆ£t°x”Q"‹ ],—z¢)£`ŽU-„¥ÝÄ ÓßXéµ>TWWwÓg¬l8zäËÚ'®Ï½}óø ©%3Š=nï›ëûm}‰ù/ëþürô¬IIõ½{7q¯z'€^G–Ž;‚ÎU-”ß ?±Á圷²®îæ5SŸÚŽ×â„:ŸyÍšÝë…çÖn)±|M6ÜO·&[óõ­6èb¾?¥êäF ´QZÍuÂ1&n8SN¯4¦–(\€'ÐÍ™¥›7¿ôhM´š¾²Ø·v~ÞŠ5ï E‹ñ-*ŽÇÀ¯nTýªcj\tlŒ–08:m°tɼ¹sç-©®ªÒEŸ¢7úvò~íøqüŠ?tÿm£R×<(Q– ð´Ïg-X0‹–àGŽ?òyƒ”ì{çÑys­;úÑ'G|L¶yŸ@¬‚W&²Ä< ¹¥¹ W˜NÀÅÂ=M›KqIÒ$CmÍ„Ý厗òÿúÝ-þS___V±ÌX]›‘ùÖ)_¾rÇWWz’ËvþT)Ìæºü·ác´‹0{=·ÏFðÙ$Ðk8 NSu ̳„ z웕J~ aP[ aà;0hsç±c;kmÜ($k! XÍtýž]fë&@ ´Ó‰E¨Ô§Óõ­§¶Å©Âøì9®ÌY¹IÝhÙÓP ßV¶ïž9sMb^ÓRRÎy·€ÿ”‚ÿôöç1Æ^wH¶ ÆY2PV2NÂ,RâÈÀìeãgÜ;eÎMÏ,ýç+ã·™ïxvRå}·¯ºbþ›Ïß±N¼ukŸ>&ÓHcˆ~Ëç¯jHHØ–6eü˜q‰z>þ»Õ[ºqºA9gn¼¨d!ÈRc¹5: goÈè½°vãÆA›ª£úu&Û££öïö=+m-±H’?ùV‹SØ©*–¡ˆâ(È·u.çÜ•7rêSÖûîV¯Y½{½ož.Æ·ÚfýJ‹uÝhÀÑKõ0ìLDï=‚¡ß"üãðÞUõø@=4%›§:ÔŸ úô)³@"øþ”4ßÉA‰±05Ê@`i6ˆEçÖêbNøåâñÜB®Ø ”ÃÅÒò$ÚÙ¬9ذ·æp,# ƒæ¬\1wΊsý÷¿‡>V-¼r]Kþ{ë꘹ü–Ýñ4;ð³'ß/u,žâáEM-¡V¼Àœ»oÝR¹zóÆ’©÷×Ö•N›õøÆCWW8Vù÷V9ÂŒûä*f\aõº•/ý¹´ø^žW î“€?kµ„Ò,ÑäAùó >ïO2›|[ur}HFÁ'G­Vƒ4h5” ìÂq˜PýuâJ<WÐGè º@J>W¯¹ô¸S]Fï§÷ÑZ µt²ðEqýõHÄ‚míŽ'ž~zÕÚDÏÓ&Ðhå×ï¿ÿ5YÐtý˜~€ûážœßó _9à€lC´T&‰.šÐ@ |l<(iµìðÙ£šíØÁÑ–]FÚâ„;¡8¿þ-¨Ï¯ßIŸfµûáÏA+ÑâiöF6~ÍöÙ—ÁÄ÷wÁìNÇ cëÞy{Ï;o×Ñïö|ø=bQS-™Ê><µMSUÚ‹ÎGãZDÙ}fHj,Ièxh÷Rïhº…¾ŒG²õ4! pƒ¶Sœ?ò-} ÏÚC?¢ÿ؃¤Ë_Åá8\,ò}êû ÞIs„ÑBý ^Ìñ%ß‚l]µZš ŠAÍüŠ{…7}÷Éïs‡ÑoÎNxú®ñO­jhXe|d «µíОþ×èEÙãÀ†U«zöbvg¾Û¥Õ{Ph®ýð¢E/„Ÿ#§O4Ž oÁç¨*©k©‡Î¥ó¨/Ä5ø¼Ý±èwÚ«ksÜ]pBïÀ5ƒý7­¡_}´·[÷ê= ,÷®]^·ß¡Ÿ|%x6³Ë¿|5ÑE /ÿ½T‡PÕ„¾ó»q=Þüg°ÒÁsÄþ;Ð`€eµ‡Nóœ0D-3èÜÃ`mÙrn-ÓÑ\$e“uÚ¹V`Ïñwçîc²nÓ×õ<†n|IüN U"ä’ÊHæ¶iÂó4 ïx쥗žó=)%6%šR7ѵ¸hz÷à~$& ͬ R½i7ó'1ú>Ô|*ôÌa5Yȵ¤Å)Ãòÿj" ÜWÕÕj2ßÖËŠµþû³L/ùo5 —f½€í{Tp4ý]pú6‰E›š>zlIôß9´sᵇz x¹¼y°Ú™·àá9B ½Åéþ«îåg毋Qöÿ~ß?Tž¥ÎÀsÏ÷¤Gh ¦’:¯n^-=ᯤB.Q~aüu”–£?SﯙGò$Ý Üþ/¸ ¿ù•o;Šæ Õ¾œ¦£Â;¾Õ3Xì¼5ß³q#>ý7ß aÀ!Š6êbšìø¨ï[ß!Á÷ øÄ Àˆ5Â$Jÿé˜lߊ/¼(t/ ‹À±¸hÇŽg¶¤ŽŸšTeõää [ï¨{#}|~ÿ„0IG)~d…íw§¤ÝuãGv殡7½²&wþĉÉico¤ÆÏkðk6ä>Âs_Âk»wSŠxY0ÝÓ¿nhÿ»;Ü|uoÃû¬=Xâõ÷\Ù_w$TP›`#¡° Ú5´5Û¢U›- ÛÅžh»xˆ§P„ç–´•JõðAh;nDÏÝa. •Š£ídùùÓâRô¦`–ÞA«ÅG‘Mt ›ð ê'Ú‘C\‚V =%¼‡n„õÇÄI€{)š',G·ìF1 &/#‹pÆK@ëgQ?ÏÆb)²‘3€áœú…˜ƒ=ÒT´]7ð<Šj¤bƺMZ<ÐZÑvþ\X74B:ŠÆO‹Ð[Ÿ&— hêÚ =0w›Pk€ŸìEùŒ†ø5à=ß;á»?ÚHÞC°ŠCz”…Š ­G@4Çážp¯Š§ã%ðlÅÿ"…B™ð°°BØ%I?r)#’WÉç¢N¼E'ºÅUâ>I' ”¬ÒRi‹ô¦N§ë¦ÓëLº*ÝCºzÝ>Ý!Ýwa}Â&†- « {!ìí°Sm„6)mF·q´YßæP›oÚ¶k›Ý¶@³\6êË<ƒg·H´œYZ„ ߬Ÿ}=\¬ýöý}ÀÖrÈïµ±pOicóÏhcƯkc Îì´±îǵ1Ë ÚN®ÛG?ûhã4¨ãkÚ8…wü^G¡¶1"PÄ"ä?<0¦½6†œ;B ¨Ml©6&0ïÔÆ"Œ—kc ]»GëP¯Ø´q‡µq8— Û'‹»SG ²áË´q$Š~^G¡è›c3®·½´Ì«ô±ôURLUŠk” »×ãuÛÌzÅè°$)éååJƒò(6Í]e³&Él̶šÌUSŽR%Ã\v‘Y¶©æ‰•Š¥Ìì(µy³Û¦ØŠ«²¸ÜnQ¬Î ³Ýá‡)4; #ß :K¼Õ þø¾œ·ÍåvZ+-6ŽÆjÁìÅ•^ãAn¶Af¶”WZ'Õvo™³Ò ÌTØ5BŒ‚[U% ­ô<G¯TؘÔ2wO™>„†žÑLvº ìÐv`U¿iÆ u1E{eUuœPu8Ö˜J*Ý hã­NÅãÔ+žÊâ©6‹—Í0ùJœåàlL ŒÉá&Ë&@g.vVÙ¸ªqNàpzÁ u–YÅôuMñ”™ËËåb›¦5`¢ÄÜLN§ü­T8ݶVÅV¼5.[‰%©L5_­0×@´Àv«½ÄÎÍ\î׃ 5[­\rUu,@Ín૲Üì–!«Íc/up6JÕX…MÌCÍ@âa;üüxZRb(e Àf.o¶ÇÏG°ç(¯Qì!n.3qÜ6ö—ó– ˆ\ p$àp(†‰lsaNzn®’a4š éc,ÓΨ¼ü±9;B^VºÉ˜Ÿ§d@”ôŒ\ƒÊˆ’™›n«W²ÒǦbâø‰00Uœ :d¶a”!ÏPž«W Ç2lz42MtšÈåìfæçÆO€ €ó“ÐË“r œ29g\ü<—á1嘬L2ôJz±Y$» ØeöÌÏæ0ôÉŒ—§ñËlÄæ.ô€b»5³ é¹€°±r3Xð.Ãt‹Íåe¾­·šyUs§ž{­šÀ…G9 pÕ9>„c "‹Ÿ:jv Øì8Ö«©—§ðn8‰ÔÔk­²Aô°TâtËN–LªíépV8Õ3Oñ˜ËìbQÄ¡ WšËa›'Àf³€’ý‡¡Ëm‡-Õn»’‰b®„Y·ýívkÇ—@ JÀ¨“ƒÊ¿ÛæqÁ)e¯²•×$¬›eœ»jµ Mt®>‹w˜¿Tð*¥¹Õé•¡¢KRd™W\W]:]nÉ{mê Y­ƒ”+©ƒä`¤\a$_XiIÞÂ1yügF+j°`‘¯¦VRüµ’ü먕dÕ?Y­$«{Uµ’| k%9X+)WX+ÉÍê‚+¨•ä‹ÕJÊå×JrH­¾ÍÊ%8Ï!I\«rIÖÊ%åªÊ%¹»üÞx­K&ÙáT®ºd’¯iÉ$k%“rå%“ܲdR®¤d’[-™”S2ɦô‰cGç3¶Ós®¨:’ƒ’_Mu$û«#åjª#9´:R®¨:’[­Ž”«©Ž˜³6 ”@á#_´ðQ~Dá#_ºðQ.£ð‘yáÓ¼vøá‚Æë‡É‹9 ¾’.Ù¹J®¶O³'Û!ƒLOr•¹’µ4Ò2 ´ÄP&r"ªAndG¥¨ y‘‚ú ê ß)h <©0*eŒyàãF6dFH³Fäø$¥£rxTÀåáo6ø¶Áž*ømHù2¨P5¥* Åþ™® fØóã(fÁh*웈*°fŽÍÆw˜¹D `qÀoÀ^;À)°ß ÔÍ|­%žBŽ…aÈäÜYaÕÁi[K'<Ó~ϡœÈ¥óONÎq Ș O(ÿþ¢SÂ×UÍy5»2MzAÃP2Ê[·wPf;¬È|äå3ÌË*¸®§Áœ,ðC¼0ÉÆq|[0윧2¾fÓä*åTšÕõšÝUk©ÔTSýYÏùrrë;ø~—s*'`õj>f×¼ÀÌq¨š–5œ^ÎEK²p8æ‡*v?­ò®ú²?f™µâC¼$ž[ÎÌãš}{8_ØcÖä“yXÀC+8/_ñë§FåZ$õ ð¤À²ãß þ«z?£Ô ›qñ¨± ßíçÆÊ%ðr_+†U/_UiÈ—  ×¢ÙœUr,ªNª¹”ñ¬ãÕ4SÁçB%òËànæ•*·•\‡úë°q·§jk9$ƒx`·þ"rèr&ó ¢pÌj<¨¸íšV›[ÿÒRû5§rë x´—óôº DÕ\—EÁ %Íé´ÔGk¼é5{—ó}ö‹ds9`7ϳfžW‚xý3ž€Gúã¥åéaÓòœKá§TÍ¥²òýñ­œ‡ñ¹[îaÍÚÆ‡x™3¹-ΗbïÎ^+µ8ðûI¬Ú[ј Mçzvh‘ì‚G=½Ì<£Ú;Bí®ò쟑[”2žáþíÑx´qOº˜Ÿøs]k¹ÛÊOµÕWkZ•C4jÃ+UÏšþ³:mþHb•Cy öpk;šctqž¿K5‹©ç!ó*9UÊLuq©ŠµñjçaI@S9ÈÀé䣚Àq©8 à7Ã=fn…¿³·1Ÿ¸Ø^šÌi[!p–c†{,ÌæÂ·Aƒc;2af¼³ñ(ĪP•^ì2ñØaû/*§&˜RmΕ‘Sôs6Þ ޶š¸ã_Ïë#6ÎÓøT5WÀ±31Ì g&p”Ëߨìøp…\Ÿé\f•Û<.C6¬«²8ª%TŽ2á{Ðf£€/×£dÒ õÜŽLž,¾ŸQáTÎò5+³qK’¦K•¦ÿ‰Ê…\þ\x.¿ fLÜ6é€ß×ï;£8Ʒ̵1Ë—ÎõÏ)dp8¦E¦Ï܀DŽX%“ë‹ÙqžÅ)¥s¶*‰[¨uZó9@a—ÏÀ5•Ë¡ A€7fT4rY35]«8U¿W}"7D»™\FfÙñ@Õ ùT:×]s)˜&qþƒR¨H×~g†è,hý<ͺ~~Lœ²©­Lâ±hàPéÜÖ…Éæñ;Vã|BÀÂ9`‚æŸùΚë×G~¸ËÉ*.?íæÌâþ”«qXІ !_¯š» p®Yø=ÇÈÛÍOîЪ1X†Öú\Z ¨Yx‡­hœUoK꙼ë„Ön­Ý°ý·cµ–÷W½ÁêCÍÝ•Z/(XõZy}®Ö€ž@Uâäu 3P™TóÕà™îÒz'Îf÷šü˜þc#ÙDÉFJê(ÙMÖSò‡uÒRȺò¤•¬µµd %«Ÿh'­¦ä‰vdÕÊÎÒ*+Y¹"RZÙ™¬ˆ$Ëeò{J–Õ¶—–QRÛž<›¯%K‹–ö!EGÉ#K^”¡dÉâ;¥%/’%÷‹‹%J‹ï$‹GŠ‹ÉBJ^$=LÉ‚$òˆùP:™ÿ`¸4?†<NæÁÄ<+™ šš›HæD‘(™ý»(i6%¿‹"¿¥ä~JfQ2òü}3gJ÷Q2s&¹×Jf˜b¥‰äJj(™AªÛ‘*™TRâm$žFân$¿i$.Jœ”8()ïA¦Q25*CšZHì””Í$¥ðRB‰+%JŠ)1#Eä®väNJn§ä6J¦L–¥)d²L&Åu–&¥‰”LÊ2ˆ)–âH©ð:RCÆî(§d\8ɧ$ol¤”GÉØH’KÉXCÉhc¤4º#1vm/#IN{2Š’ìZb¨%Y”d ¤ÌF’ñ"ICFRr+%·Œˆ–n‰!#nî ˆ&7o/Ý<ò|2¼=FÉPJn#ÝÔH† Ž”†ÄÁiáÒàH’Nu#©íIÊáR %7†“ÉáÒÀö$9œ$ h+%E’m‰>…ôï—(õ·’~}£¥~‰¤o4éÓ;Qê“Nz'’^‰áR¯$1œô¤$’ø¤ÈÙ#š(VÒ½‘tºYI×öäÐà ”ti$×gÎðÒ™’묤hª%q°)®3‰¥$†’Ž”D@4%Q kT‰œI:XI%íÛÅIí)iÐíâH8%r$iKIkCIX ÑY‰‹"x@,YB‰ï‚# ¢ïÄÖ9 qÿÿ…ôK3pÉŸ®ÿ9\b endstream endobj 80 0 obj 9574 endobj 81 0 obj <> endobj 82 0 obj <> stream xœ]”Í®›0…÷<ËÛÅøs#EHir#eÑ5ípR¤CyûúÌq›ª б™¾ãa(¶‡Ýa–âk˜º£_òó0öÁߦ{è|~ò—aÌ”Îû¡[ÒJîݵ³"æ·Å_ãyZ¯³â[|v[Â#ÙôÓÉÈŠ/¡÷a/ùËí1®÷yþå¯~\ò2kš¼÷çXçS;n¯¾¬×CËã5¦<¾?fŸkY+¢tSïosÛùÐŽŸ­Ë²É×û}“ù±ÿï™[1åtî~¶!†ªZ–Ö5QkÑÕÚp_A[ê-tE]C;ê=tÍ\ ý&ZKÌŠ1+è µþH]Ao™+uv¢¼÷uJè=õ[Ôªí,4ùê(ò;xQäw¨£È_K ù¼(ò×R‡üœŠüÞ«ÈoàK‘_ï ÉïdŸüµä’¿†GEþZbÈïÀ¯¿KXtò:ùx‡N>p6š>jëäg¬Ý³žäÓ‹§¦—^tê…0¤^H ½TR—^¬¼^t©dŸ^,ÎJÓK…ó4ôRaßÐC&CµhzÐðiR/À`èÁHz0à4é[BïLêzjÈ_‹&¿¿!¿òÇ­¨S/¤Nê¾m³ž˜,=Xôɪzƒ5}XÔ³©¢éà/–>âaàÒdaôðoø3Òyw!޳ü@dŽ1ÁÃèÿþcæiF–\¿]q endstream endobj 83 0 obj <> endobj 84 0 obj <> stream xœå8kx[Õ‘3÷¡·-ù?bë*ЉlÉ‘óŽÝÄ–bc‚í8²ƒ±dKŽlËXrBÔæÕ€Iš”†ð%l „¦¹KqhHÒ–å£-ö£Ï…BJëÅ$´¤íG‰¼s®d“°i·Ûoÿí½:G3sæÌÌ™™3çH±¡á0˜`x»úƒƒò¼"7¼€é][cÒxÿrÁ§¸@÷àæþÒÊ×>d­¸¹o{÷§esÀX `x®' ýôúf'@¶‰d,î!ÂCi¯!|nOì†eÚI†÷>¿/ÒÔ;aáû/íÞ0ø%~œ'ü8áÒ@°?ÜùìO¿@øë¤ïü`${ Šã…?eãƒCáÁ6»ðɦLj†ô²‡ô£†á/ˆ­No0šRRÍ–´tøÿõˆ/B!Ü,z! ®RûKa9dÂ6€©öY¿zêÏÿ—VèÔs±>‚7ƒ×Q€oÁ9ø |ëðòÅÜX‚VD8Glƒ(fÂkÄ}óáaÊþaááhÃ3ø!Ƹ€ÛÏ `*¼ÅÝr©¬ø¦>$Iâ^êßÇû™åâ-|.(Ü*ØÉ}“k“Ín7×Sð".'ý›`îK ˆÂÍŸ3¯î€¾”N±2që¦þßSð#øO¸vÁ~x„»«œú˜ôŸ% €ËÅ,4$§œ˜ž«yœäŽsº À—é]GoBø ü¥x?Yw î…W`;¦`—0Ž¥h‡7É?ýð5èƒ{à)8¿Ä ´„}XƒÞ©28ØVÈÃ;⿈·Òþzz¡FL“½­þ– Íë›®Zweýuµk}Þšê5«eϪ•U+–/[ºdñ¢.gyYiIqÑ\û›5'3ÍbNM1ô:­Fx¡Ìk÷$¥8 ÅöÚÚr†ÛƒD^D(‘|—ò(R@e“.唉³ûsœr‚SžáD‹TUåe’×.)/ÕØ¥ lkò¼»ÆÞ*)“*¼N……bI!Äf£’7§§FR0 yßÖž1o †ä Õöê°¡¼ Æ F)¥öAòò*T®Ô»|œ] S«ðEÞ`Hilò{kòm¶Öò²:%Õ^£Aµ*RÑT+ZU¤ÔËL‡»¥ñ²Sc»&,Ðp˜BöPð¿ÂiîïÛ©¤9”yöeÞŽ39´ò°Rf¯ñ*&µ~ýŒžúÏT¢"YìÒØy åØ'?¸”LR4E–óÀ@¹wlÌg—|c±àÄÔh§]²ØÇÆM¦±A/yý4kbê™»óß®VÅèÁåÉÅúÖ×+M›ü Wä“z‚D¡Çn[šoKkæiü[Ã@Ž wOm6¶ð»'dè$Dmò'p :ó‚ìr´*\€œšÉja#£Ó#3ÓvŠf}³LŠêBv/ùøî 2ÚIù´……ÂnQRÿ”o³¥§IË\­*¯DVÕ…z%E,&·Ð¬‹'P¦°)cIýSâk2Ÿ§¥KËì$†ÉñÚ½ägkO ÊË”ZG"ôüŠ\C€LÆÈ;^á¢Á…¨·F Ÿâ²*™ö53ñdfy{›ýê”ä4%³Z@Wr–âòÖ0Í’w,P“0ɲ7ùAåÔéñ…Rþ“•°Zksv5åU±wÌêV¬üí´nÉŸoSäV p«Ýne‰FšwšÔÙT W½Á_ßl¯ojó/M’`â„"ïçÄØýù 1”rŠ®H'ù¹|¾•-D|Ø×TQ¯h‹tÔ,äp•ÊRuM•ä§ú=ÍMf(ó$o¸&ÉÇðK„Š,ªk§¥iJrªkóm­¶ÄS^ÆÑ°”TL3tÌ©µÓC|U¢q$F%1_æ°œ—üö°½ÕÞ#)r£Ÿ­¹GõrҪϓ±Úp v‘³ÈM`£ái„9Sñ9ò/v®²VÅgÐÚÏ ×MKc:{}ónO ¤Sª¨N–ÂòÒ´|u÷³ýl÷iÓŽV÷óظ,³½Üö혽.4foöW©ÜTAnÎßÁt¥C=ÖoXS^FÅl͸ïl—ñÎæ6ÿ1 ]ÍîÜà?Ê!WXÓ:>—ÆüÇ$Y¥rŒÊˆ ‘Â$­'D§òç“FÕQA%¨xׂJÓMÓº&¸Í2Mãˆ&$h²JcE)§‡|LõÛ+…X|njí ´²‡lò}PAû*òŽ}Õ8r“b°‡×(FûF÷0º'A×0º–2³±¼lǘÅk?ŸSÎŽFèŽË…ĺIkÁ9Žàª:ªœ“îqøzÕQž#èrKd‘‘j5®O«Ž"£W¦ÙÒŠli¶NŠÏÅûã=bË'OÔ/±#†éžÖ)þòáŠc`˜:-—èMµyy`¶˜9³¹ }œ¨è%g4š„Æ\ÑŒYàñTNº=“èjo¯¬tY&ÝéË\í•®à@Òh[d[´pWéΞ•åDûœT®mYÜîø{S¤Ö~í7néþf•gOíò+ü.Ó§·ó7h^uSÈ“n˜Ðó\Õó—H¬}Wüj¡Oh »ÌR¨“³{r𺠥b(-k,X^¢±ùæLL’ÓÉö9Åf[~^YcV¶¸°Ñh3Òíñ Ë1éf6N’…íô`!ŸU¹Š¯trY™©œ}Ž“+±gfgfg‘õ ‹K0³¬_Å-ZX̬LJ8À ùk×·9;öTtÞ.okªÎáãïj8,(YuÅ\gý¢‚Þ€½ÞS*,×Î_¸8kq½+kÃþ—¶ßø“ý2ËëJÜ‹sã× n¸qÎ…7®ÛÝ£µf¤fO _Sã³×ΚUµÖ"Jb…È‹‹™2-µ‹ÙôzÒšf[Š<å 7sDú2: ,/9(j“•®É45f“• —`»HN`QóࢅNŽ-[[Ä\D>Q½±$+•·Ï).±§òÚT>+3[õ>}Õòàþ7³Š—̱.,Î㯙Vö-ò£_h3ì³¥ÂÜÒÒòÂ-aƒföê¦Ðù/–_µÌ¶rÅâ + 3Í;® ÜÖT„Â’ î¬TûŠòÔµÃ]ÏŸŠßP\5/Ks¿Æ zÂî†%œžC£½zÙºzg}g%ËßòW ùK‚+ä²ÞBìÍCK~¾yöì9Ù3^Éh4tXÐb1XäüÆ|.??§‘9„Ðî¡fa9LžqQ'<1í–³D–½š,K¥{ñ1•çoùÞ¨ì»ý{7ö~}k]jümSÀ}ϯûR0ϰvû·2ïy馯~ùÊ¥ÁÛ¯Lmîzf<>¥ÔßÕëaö¦ýöúÝd„;dW·~‰àz¸ÒhÈ4 ×éЀëuZ]½Þ©7¼i@ƒQ§Ó£^ÄxÒÈYp zs­Ñ˜¢å}C3(ãƒ9A¯3‹`xúæq»)á+g-Ss>­Òå }Ù^™¶¬}§c§ã9lß™cq8,ϱµÚPË6kÚôÈâon¿K¿|nEgüv|·!¾E|ñÓoã©xÛ…>²‡ãWó/“ýZX hµ{¨*pzñ£Ø©8Ñ …óây*(žÉDu˜œ. T²HWsmqãWk‡O|¢;Éò¾–âx‡ØF~™r´ %S…éo2妷5jPcîÐ Y|Æ´dUðõ´ŸÑ6 ÒÔÙvÕ¨™¹X¸#þ^üzÙšHæÄ¶cûöoܾ}÷hüÑøÃØ‰­ô¶Åÿ5þèûo½ýÎ;““‰šs'Åi+ýNJ%{–Ê©Ð&™+XEÌÍÔ¶é˜çÍúÔZ¦#3S›Ñ¡çµéT™=“ªÏ™aÌ.ª+‰bH‰$.,&˜Yµuå¾Ç¿Ç…§w>«'þ‹Ûn»ÿ‘Ûwð6}}ÇÚø\Ñ»bàážþöxG?ys%Ù±—ìЂ,Ïפ¢È¥6ˆâAñˆxVœ¢ÒŒmî,7ÅñWAÇ"ª5nÕùϵ;0DzîŒê~V•³¸O⿊oš…à_ Á3gÔs૤gé1B³¼d‚. ÔÖ ,D4‹q„t ¢(´EôgõSz^ÒWè9½ ëЦóÆ ¢ØªzÝšJÊ=êTd$OÚÓl_å÷ňK>íÃ%ñŠÞ3ŸÞvæ 3³a'ÙàSÿG¸]® ›p½ ½&t›P4e™ŠL¼q ീWV–ÝÏ0°&ë3¯I#x:ã\w032f™PÅÊD±2d ‘O1@:ÛžÊÊ™ó ,¬L Ø~ñcÃìYtF0¯aq‰Ä}ÕixQàâSØ„wé4¢‘ÿCíšÙUË*3/ ŠÞ¿þ±zͲ›ÝÜ#Ÿ|—ÖTLy½›òzŒÊÝK±{Ö•¶–ö–òÝFn­‹79aSšºæÚ´´ÎMúM#º=:N§+`ô|CjmAšSœ×9G.Æââ9‚)(Ž²Ê ÒnPkX¢§úN #p’Á´Ä4õÀS׃ê)7·¤¨çxNqú‡tÕùY…¢°»fì•]¿ÿr>̺g¤ª£f®'¸u‰ks§MIË—&B§?-Š¿•=ô4Wf¹›z/ì Ô:p§ÿ¾UÏ?[tmziuÅboy9ÅZ¶býuÞÎ=íåãÏlº&×±¤°Â3¿ 5ÅV¾rà ù(N5ů֔%r÷Ѩv¯–ÓjA/£4:@*,"àg……µ´äFËX¤¦vZœŠŠBÅåê“â_NüånªW?§Íüg\@¹9_Nã÷Ó=‘67Œ‚ç@`²Ÿ6’h<ÀòBÊê‰ZŽ6\™,x”òr=å¥ÖžÌI1Ôò¼F§3¢Ø¦aÚ¨k„Fp÷à!w󵮃¶ü”ˆ¢¨:×'•$+îLS¯UgbƒS»‹áBºð÷#Z@üø™øI¨‰…‡·4þ¶Ã\u¬‰ÿí~|ÇÜmývµð ÝF©ú°0Aržæñ \ü—Ûçþã⸀Ýg‡alvÆâ0ÔR _Ium'Ýã”’ïRùËà ð1îÂ3\ ½ƒÜ÷)_Áñ¯ ÂC !N÷†NUKx“vp`JÀ;ùY”Mlt6nœ±Ež± Á r¦r I˜+4'a2a( ‹`‚/&a i¼' ka|3 ë ­IX©X™„dÃꙥ؞„S`ïN©àà ÌbAOØ(·( #rO%atÜ«I˜‡UÜkIX€R>7 ‹Ã¯NÂ(æ[“°>æG’°J…hÖÃlá@6ÂRáé$l‚k„³I8âb}N…šºšÞͽ±Þá Æ‚Òã’»¢b‰´:Ú…‡¤êÈÐ`d(ë 8¥Õ}}ÒPïæžXT GÃC[Ã!畽áĸ´.2Yé ÍL.—>7*±áËÑ6†‡¢Œ°ÀYáþlœ —nJoT J±¡`(ܺNŠtKëÉöÚ`¬Lªèr’a›{£±ð{¤g³Sj ÆÂ1)8’6ÌLlèîîí «Ä®ðP,HÌ‘X½ex¨7êíbÚ¢ÎË9¢9Þ–Öc±p42Ћ .w¹¶mÛæ &™»ˆ×Ùéwý½±ØöÁp(íÝ<@kwöÄúûZ¢a¶žX­ñ¢wGÈøh¤;¶-8fëwn wŤX„xÃR­c€¦7…Ãýl¥ÃªÅÛzz»z¤í‘a)ØÕŒ‘Gûß’ìü{ÆöÍLR-¥ŸJ½°™ZŒÚCˆ~„ Hx Ç©¹¡‚Þ%­†(tÏq„iJP úTû *#B£N•·^‰èL~EU,LßlîVU—®¤ñN•òÙ| Ö©ßXC­øþ»ærj®43ûåÛ¨òDg8}´þËÍŸž]þ?héU×Í|SG˜ýýô=×-ÝÔ¯Oú½VYFPÍíRýÈ<¶Y•Se'8{UÙ-ÄѬr5ª3™bª¶•kÃe46ÆnšÏ¼ùg—*›Ååp•õÛÔŸ>|î° O`áQK†ïØÔ),³Lf߇høPàÐéCç »k!3K`µƒÔŽ`‰&<òP©µñ`à ÷ð«ôPãCÜè½Îà+V§â\R;©ñdžÜ>¢öGÐ. åÁÑ÷>Èï}￯Ô¸#û_Þÿæ~~ï~]bl ~„*~Rí©ß«R_Qqs’ëZälÞ|¯ç^μÍû\û<ûFöÜwvŸfÓå‚]%Ö¯ÜSbÝKßgw£y—uÇ:×®ƒ»óqL#§Çîúcæt_ÃN츕B•'gl+³n–Z‡£¹ÖµhcºõYÌÅlª»VÌÁì£eÖ‘“„î¡vOëÎ:š;›¢Ÿ)WøÊ¬ƒ>·5Bm€’4sZr+sZ´•|‹†²§³c®5H-@­£1×:ø ` Oq×úæZ&0CÎÅk|¹ÖMmnk›/ÏšáNo‘oÜ|Ëêd[¾d5óØLV­§ÖÔXh½ÊWh½Òç´ŽÔc=ÍœÀÔ'}¥V µI¾Î˜ê»Â7Ûz¶nªŽk¬Ã:ŸÑê©m¨åj}ÙÖµ¾ «Ù7â;ë›ò ³Cù-Ù44·XÜæ¡ÝÐb5{Ìæ³`6»Ì æˆyùMó”Yë!ÚY3¤;øh6Šä¼½ãšŽú íÔúzE߸IÁ;•¢fÖËMmŠæNZÚ6ùÇ¿ÔzÇîݰ¦ ^q7û•@Ak½"@fÀ(–‚ñlXÓEcÃõÁ˜ÃsD©w€#¦’¢*€§quh4JÃ$‡cÑh4FF`È0D0q2Ñ >jQ¤!‡J¦éTZ˜d`U2ÃØˆC•Äæ«º ʸ¢9ÿš aí endstream endobj 85 0 obj 5878 endobj 86 0 obj <> endobj 87 0 obj <> stream xœ]‘Moƒ0 †ïüŠ»CE ôKBH--‡}ht?€&¦C! é¿Øî6iÐcû}ÇŽËúT›ÞÇonT xÑõF;˜Æ»S ®pëM”¤B÷Ê?"ú«¡µQ¼Í[¤IJ¹ÙSâ­D^q>AΘWÈkæ#ò†8%ý–xMùqV!ï9Ošs†|d͹d>#ŸXCw™OÈß…šD²{N¸ÿ¬Dæþ³5=üñBîèg´BÝ c¥EÒ> endobj 89 0 obj <> stream xœœ»c.]³-Ú¶íÕ¶mÛ¶mÛ¶mÛ¶mÛXmÛÝ÷ý6ï¾gŸ?7žˆ§jæÈÌ™9jÔŒŠ¨Y$òJ4Æv†&¢v¶Î4 ´ôœø²6†.NŠv6²vÒ4Š&f.øÿØY¡HH”-œ­Mþ7(UG' ;[Îÿtr41pþÇ làüO„²¹ ¾€‹>>#>'3'3>#==Û:Ú9râ›:ÚB‘ÙÙ{8Z˜™;sâÿ×)>¹Š¢õ[888ð =þÁ6q²0³Å'ý þ±ºšXÛÙÛ˜Ø:sá ýc¶¶¶0Â7³ö°7wÂ70661þWUk+|Q k {{;W|r!Šÿ™åŸBhþùc"Á3±5qü§¥ üe¢vŽf&ÿÖ =#>¹¹³³='é?é¿ Z'SZ[gºr’ˆØ ÙÙü«'(¨ [8šýÓ¼Ýÿ¹•­›­×ÿ†˜ZØÿk|c{:[  áÿðÿÇõß63g|zFz&||w#sºM¬ìaoòoà¿™ l}¼ìíìñM ¬L|,LMþ9@y9¸šà;;º˜øxý¿ÿ9‚b`À7¶0rÆ741³°…úïìÿ˜MLÿ},càìhᎯEOû“øôÿúý×™Î?—ߨÎÖÚã¿Ýe lLðÿ·¾ÿËCPÐÎß‹†•Ÿ†‘ŸþŸþ8™ñ}þg¶ÿâá?9ø7«¼ÅÔHÿß)%lMíð9þ½•8üvðé\ÿ]×øäÿÒ5þÿÈÿO‘vÎF&ÿHæ¿„©MÏBÿ&ÿ90ü¯‚ýøÉöÿŸRÿ•Kè_™þ[¢ÿG…¢.ÖÖÿF(ù¿Šÿ£¶øÿŠ/ÿ/V­ ÿÏ  kÿ[Øÿá®fòïwéÿ-„³Á?ÝØšYÿ'åøtN¢î&ÆòÎFæÿ®»ÿTlM­-lMäíœ,þµ‚àÓ0ÐÓÿAes #+['§.í¿a&¶ÆÿsZ:[#;c [3|%çnàhü_†ÁF.ŽŽÿýo×ûŸØÿ›ZüS£‰‰»‰”3_0ò£‘u¹fÞϧ|s=¥†Ê6Ñþ#‡ÀøW æ±u¢¼BvótAØq©ë*6:»˜7Ëþñ¿òÎGù² ¦’à€É … HÐå¡|ægÆÌ}k˜šÞ +ìJ¾“–#ª-Ýéïî¿*K6ENÇ2.<×·gÀ‹'íŠ]² X<<ÏdÉî£v/4¶Ûò3Œ•ÄQìóÂÄ;”|-LÂúQ~ž6Š“à…Mzhaüg`ò/8 îZ§¿s"5ØVêA7~=ç}Wª÷&wÉGz¤³…uð‰¹¢Òu ùFå94ðq’¨Á ¿âªr>J«PY»ï~µF’ÝÅÀ[e„¹ŠRý=4R¤‹¯IȲ…”—k> ì¶?r ‚-±NÛ?cÉZ×è Nº¨”±ë«}Z‡ õmé|Æ<§;–U!lÂxæíùÒ岎¯=\)˜Ù¾“ ƒQ켦ñ'ÿ£ógÀf5­bí <áž8š„2Éð+· Óï6®i‰4Óú´Y4;ë–2Í|«tQ¦âg}ƒ ðH×’ínø$½|—¼ˆ!^y’gT§÷Ä„{”9¶¨Ë[‚Æø6•aN=¼ŠÑõ¶¼¹ˆh¸ ï@F)”³I~)!qˆó½÷îtæTéTLnâˆúV ißE TL+nÖc‘Â*?Ðo7||Ov=êTpm°=5—Ht™Ç*W‹T·°®c"º¬„=ð"4/lÔRÑZ4È*/YÏÉB´þ¨¸-áÅeFŸÂí° V¨Ðo¸µ¡n¬¾S¼®Tóé‹T­fç/sB`&y—3Ì4^ã_aSÞO§‹Ã ‚:àô‚ /ŽKî+ê–²$S—äîb3àX'R(ÒLª3Ûíƒ1Ý-†Ð]ç/iw“Ä‹sLß Ï1*a%Jb@‰yKç)ñvâ[{½sÎßE+•G쉹Z.ëØm\Tåoñ teFç'ðŸù×"ªñ³Ù/Σ¨Ì''Á†ÚÜ™ìß%ŒÀ˜f]ÐoŠóo3/#kÀNŠ#vœVßàæ°‹:! —÷!êW¼­V±j{»Ò ­bXPVcN›À›¦Eð98?¯Î;æ;•–0WÚ¦®¿ëTUG˜ÛûJïán6mCkÆåHß Øód—;ÚÕ[Èj‹loø®d|ãÑÝuéá*Ÿ|!Hî >V‚¿Áf¡ ù—^ª&¬ø¨¦”U—R=å·Ž›)òEqàn+Hší I¥$ Åê) êsëéWÒ?üëyþ¨Ëèá C³Ô[ è˜vgÜuÔk¢;Tn¢Ò>½ô©¶¬ÃHÆãã€Õÿ¸q>?—Œô£ußš¤9ÈúšÑŽ…nPƦ1Tu†Wˆ¤F“®j;Â0áÚa*²yW`4KÄß¶7 !¼‘z{ µ´ ®Y–«é#ÕêЏ.} »Ó!qg.¥æ°‘9 ü€o¶˜_µS¾ò@OFˆâpïa£šOÒ¥É5\0º¤Ûü'„Á¬î 8û}§'ÏÍC›2=Ômr‡’ÏQ½×25(µèö£HÛF‘ŽºÐW»‘Ÿ›ü>Z§½)Gƒ¾‡A™\VÈk6ÃcW“ÄnÒ¾Ò¶QÂkj¬ é¢/U; ²›æãÕ®äã ¬q›Pƒ~Qñ$iW¦µôŒ‡„`»,Ññ€ ³ˆW®YÁá¯tÆÚ€®êÜN'ÕË»nº³fÎôn#¶b2^Ž2´µÑ¦¾1Ü£ià“Joÿö?jxðkª±Aù¸8¨Zˆ*éÙ ^’ ÿŒå }×óÊs«18fo/y¨5\î•ÜkÙ‚ô¼:Û7üjÁÀ®¬Ï¶¹Ÿ:is4ª÷†ÔéÄAS½µ ÓjúÁßßûY(Ðõèeé¶µ ÊÓ4£œp”D¯±—Ÿi¹ÐÄŸQ{ê-nB‡÷¡ÌÈò{¿»¶»ö2K+Ëãu}~×m$3߈¥²… ~‘À›†oïÄrךú‹ä€Üã3‹"‰€Z×­ÐãØÑ{¦~,+ìrŽ·tIdŒ—±zÏ&b‡³Ü6Ä¡gÈ4̶ cÐõWß1d®L` ¾,¹ãrn’«ƒËˆG~cÝ©š;ñû0«=dŒ¶× 6p ×ɕ‰$ýƒùV²ËØHÔÒNÆUL¸ÈÞã´¶À‘¶Èr–ûÃKig-B£‡C.,q6f)à'NÖàx9v“ ø¤@D~ÂT>ÿô‘ce~4éSÒxŸ³$¸o¸õ¢ÙÁ¨nⱤía€!£²Uב7¨—?'0:4ÈR|:Ç#)þlf>XHÎïC”! ˜ œ@Bü¥ÞÆtôÆÏÊÒ4¡¥ý.±¯o妛s˜Ða¨]«ú‹H½¹ÈR%«ª¡:’ë-"Í<4@ 1Xvì¶D ª x99‰šb­›]$Ž6@2µwï,nxWœK`Øž=óþ‰ ½u/8 ; øé†>¨Ù®O~äý-”ÝDb±ÈŒŽÙìµ}»¦ÂL-R˜2¿<&2Á,ˆ4 [ÖZm6Û/ç!e£X øâ]qò³jÒ9Á·êà¡¥ÿo ü"C¿î ÈbF…dÄ’ƒcaÜkÊ‘¬;+Îcë´~EÓËßÎ6ˆó¬ÞúÆ/GV”ŠÖœ9 ÆÅ ‰­uó^É|ì¸Ò"~¼;Ýç\}éfØ™©rÉ\Ñun¦ ›÷\A‰ hGD);ýeZþÈSz ±lZ_oÝ‚Ÿsuíëi³w¶™-Å©fô.¢ÑÅÁˆ/Ï4ÇK½ðPÖ6t4 Ž”†×¾[Þà5¿¥-¦ûs[òw²O ¢Ãy O\[²­æˆÎ_¬L!óFX6ø#°(Áh#Ž:€‚›IΟrìB ­9Œ°Ž'9òP]!îÁº¬„îáq¨‰Ÿ8l$éú‚Sàó÷$è½Ô®<Ó]C!†ð+ð ÄgšÛaÓgÈx¨×ûO0ür{~N¾)ëgu~ÁÍÃwÂW+$0މšˆè“¬8?È!í .þn‡×ý}ÃAði||ªÑ ,:‘ ?U™\Ü¡Öz¡¹îs8`u"ÈËžE=/+RZåë4p°aŠU4ù‹6&òBoÚÐ)´Ê…ŠãÎëÇeå2%òºÌ9ÈÏnx ¦bÐ;ˆ—à2å6d¸¥=nÇI*uÉŸ«ÂÄtíóM?QÆÞ°W¸D*²ÞÑW¾®$º©6E¡ q]篓êEÀ¨rÝoè%…ˆ•OÚcLw>jTÀ×ð*Çp'Ø}ƒ„$ý§Ž¬æ/s@›GÇ#¢òØÏ(ÿ¼Éͦsõ?‘0Á«ÆÙ`>˜û>%Ö‰Iž˜÷é] «žTQeÚ@G®ëˆæ€jadÊ}>žï_Ï RÛG"u@žÂ2XMZ€a¦“µ!ü–ƒ‡ó¶e‚3Ã)Æ%Næû!­‘F.tæaÛú œt| „~²f…-Ʊ •Ó–´JN¤5÷äùò©!㢋÷·¶xNÏl#tÙf •’ZÂà#¨cZÙ=*dŸmÁÐÆÏè¼y, $ÖH-ßÅ!FüÙ2!ÍY•¸S“e’æW?ûÞb;ë%X0VE9egRŒ҄S¡tzÍ­5 ­ÈŸd‹,½²,—‰/¦\;¡éê6o %,¾è{{ïV£°åfhÖß|éÕJ£Š•«nøÞ5S“O’Ùó¨ö!ÜÍ“(ÒâÓ§ „¥ ºð.‚Ûxûx8iûÊs¨ Q¤Ý4Ü*— ô“ý5CjYäîï„ B´¥×ªû×ïBÊù~ Œ@íeØ®t ÕŽÚJÝ8é?€0.‡]Iìu–AëYC¥š†êÃAkf1Å­‰x‡Š•Ý»Hˆ»£‚Á¸bÉàÀ…å²ÀÞM§bƒ†{ |Uí†Ëí=ÈóWgS¡`)} Â]_mqAÀLüÈÄ4>+QE?Oïs@~M—ª¼¢u”Y†±#ß¼´×;¢9!˜xýU"ÐeEà{(Íð{Ty-¹Mä¹QC”#À…Ë÷ÏtXÑlYÃö‹À1ðµVòòØ b¡&ûeÙÏÂê %-äÌ€»ô–ûÅ‹£ÝÅ=˨¦¼’‚ä•_/ßiIDÅüOöÒ4ÛÂ0Bç´t%UJd¬ù'@‡MZ–ƒ²‹Ž¼k¬.ã²wÛû´M« ¡•»W>bRÕ¥XhîQÁˆ´ú²ÍçiØaŸ¿| Õ]"Å=r3%û8X­ÿj´¾Ÿ71cû¥Ê¶2õ”Hªt‰! sØÔ6éÓ¶©Æ×…×Ý@ÓÚUJPðå ¥Åëx\IŸÇ¿Ò‘Ü«Z;G`©"mz„B¯J «ò{”—8gº1‹%®ÎÏc–¦¾¼F@VSÍ™ýx_iT}GSä f™¶g°7Äñ2g¿MJ¥®lªö[”|(¿˜úT×õ|×ç”ÙƒKèP>z­ '@x~„±Ô_‚f£_Y^"hâ,5W—±DAÚ-wþ©¦:5$- k_Ÿp$úEÙGØ—µ±WiA­pR¤)#:áâ£U˜©û1Sé$†ID6þC*ÙÍáaMã® ¨cÒÖ®^ÖÒ‘Kf³Èiî Ì"‡ ÈÝÑÕ¾igáÅìæù2éÄÉç+JoÿªÝó+ÝÊ\.îm“yNAoüæó2=ôýpnLNÆn¼æ7MŠfx‹³XH~½¾pj‡æ-¢ö•%g³P ‘œáΩusì¾€ùšŽÍÞ3R2tνõ 7KZ0Î ´;^² dÿÓÚî¥ ·òõl sì#fkXPÇ‹I¨Q8’‡e”éÈ{}m|øÍ}®ãϨîŽ>äÔ0$šÁwòF̵öNá°By!ÅP0îy³5Œ/)‚*¡2ŒHÇ8im¤Í¡ßœ.‚}¾·1¯­I²ƒÔ+0bêï½)–3 ­Œó¾æUiÍVø¡¹dÎŽHfúD UƒYJÜ(Z€¥ÜnÐŽËgNû^'d-Õ.ÄÓiÌ#`c‹»Awq°*×JíÒ¯5^°gPF*[(éKù¨á †|Æ%(.§Ñ~†N¢ëøæå¦}ªn¾LJœŽ59Ô¸¢¢Í{‰;]¿WàÁ+‘U$X׃ÃPª³3ò%d°UÐàŒ/yA2Evª ‹Êçeë"#A4µšD‘臑ýæú žE¤‰‡`ˆ%â"~Úpvºø&txôèÚ5ÅÚó^ÄiSnÏ›Ú7q~¨j9pfkP¢¾°µ  ¹ËJk?kêEñA¢ï”.i°cî¼Õ­7ÊCÌßûT†vß~SÁ´â7rvóûÌfØ„šÑów'ð‘ÅI q¬û;]Û²ƒª§/ƒÍØLñoN—„9nŽ}ý³••[·3幎}Äèž ÍZ¡@x®ŒV¼=ö®ÌŠÐx¯gF·%ÿ½)Û b½ÛFXpE_md&8)Ld‰ª)­œÖgÊŠqVó:…áq%†œ!ÃcDÉ0ÔºŽ¾ Í38•a©N÷\‘ø` ›ÎWƒä í/Šêå'e¾ßë§¹µÞÙ [*óî9û0 „S’gm­Íð¢j6ÍYuù‹¢Ìapw;Ÿ `#_xîYÓB·À=ŽnZ-µ8m„0ô9Ž@¾»«ßÒ/á;„³ Š«6h+AªÎwaÄñÓÝZmÉàZs¹®Gó‹EB§–;qóU„¾ '°¸µañ¶Ý«8Õh.w–ˆÆÌ½ÚÈxÝRLAlCÏvƒíƒ°Ð/&Ì ï®uÃV÷§¼É½bï:d ³ÑJûMU¤ŸÜ¨fý/T_ÞØEx©™c/aùŠnF~äð:ÑpMÝi“¶M:CÕ‡¾P³Y+O Zô¡¹wG#—Ý(/eHÌ4\‘@9‚Кy¬êÐwÏJ¿l4–/6j¸ª©)Ñ U; Oae¢£Ra%õ¥_ät%¾™X0¼rLð ÏYèÀê÷PY¿qP™lô—X øóÃ$ÔÓª‰/hSŸÏm¨wÜiÏõ±ˆ!&MZ¹B®ôÔÊRÖ5òêÃ|.4ìóf[aþCÃV-öx’Ý0 Ÿz™½’&Ӕ˼à0Ãù6 ³d è²5u¥y ó¢ZèìQŠ[vX>^ôÔã {CEƒŸðÊVá¡O$8×!‡÷M Â'æ@oÝNúD¾ µäz)Léu,X™ÒNSgË,sRd‘> ´®?KsxÊaÙöÊ%+ Êf^YiÆžK>¿Æø-‹©‘ßÖ‘ãÑÔ+ ºþ²dÇ×wÍ¥Ê|ÀžPo Ê/˜5ò,÷*Í0 ¶Ö4n`‘¡2^A¾ÒʘûmÊЂC JÈd)gÑU@üîBç*DrUÜðº3e”ðt]’¦ÝX½ê¯ 9—lpUP·;œ6|ÇßëÔ}ß{” TS÷¾a[o±ðgXbE3±Ð×\&½Žœè´µQ“o¸};ó­J]r˜ŒEš)o11·˜u¸½£a!aÀˆÎÓlÅœ?þ¡óZ€vàh§¬Æ˜…É,,òÞÑ×T5Ð k1£j)L>Ky#ÁôÞ›a9 9ú›¡OàòÑË•üÁò@øGõJ{¿JܦºàÏ¡ ë·”õ¹|okJ@„þG zǤw£”ÜfP»LÅå3rë©þï*r’Ûq•âN ;cؾ<bÙÅ® ºüñ3su$Ç—Dt9dšõ”ºB\l~2G¥±KSöÎn–CVBßwhç$¡{±ô|,ˆ–‹+‰öŽw£I>·pržÓðæP¦{= x[ŽmɘC g2áÔ€Ï~¼Úeps-£Ô‚íõMBx¤:ìÝ” ´Ñä8üÅÜ”\½iOÌ0ÜÇCpÒ} ¯0¯f€Ánø¥d$—ˆÙ„_†yÛ£U°5ƒÅ3Òqˆµ–`FOOm ð Ù»ÌòíNŽW÷¢H.ö{0ŠõˆÄ,«Üýö&"¦{°SH½õ^·ÉÑ,«EÙi{u¹°’5k0í"ãÜ0Dâ +L¾nçšmì"3™>þ#9$wñ#^‹bÙL¾›³yM@¹<[×:¤¹c$ž¨ûšGÕwºIæÛ—fÂëv%y=•8Ó9Ô…ZJÆt«,_Ø9ˆ|nLJa}]7µœ4ÕKv°Û²—þl¾H'(jãö“ UaøŠî8¡7v©Y3x>öy åqÊÀûdWv ],ÕÎÝ1hoŽ‹}»ò+ìí$ÞÃ{ñû·ˆÓ•ò|W„¾‘ŽáE¬@]VWv–ýôøueæ|#€¬Tº€G ¯6ô2ïÉ`åÆÂ®½B²“š& ZRñõ!m}—ÏêÎm÷ásáH‘ÛçnBŸ ÜS•‡¨õ%¬’ƒg€:W#b°ùþÉ݈C&›¯y·*º@œ¸™Ôƒ|­~ hQ›@Z|µ ´Ã¼å)Gê…],9q§§ä÷œÌË3ÝMwÊbŽ?¯ƒå½ôÞ¶#½wn¼«ë<ôOdµôêŽ \¿,µ*VöéM5XUR%S*áÁÎZË*¥˜B‚Zw¥øÅb…®AjxkˆÛ½ÑS8±wm[Ño‹½Oÿ“hŠŰÿ¬ôƒ+ÜRÃ?wà~ÓÂ\ñŽ—.ú©ÚEŸžov =›Ð=­õV‰Àí¼ >H¥xB cäOù„o¨4¸©ˆÆêIN·Ê£Êgñ‘§…Œ·1ÓÊ-mîK<a_¿Mòp$ãr^·ÁÆR&yAYÖ\„:š€,…[Ú  (GLôfF Ö¾zú½)ØØüêZ[csj]á³k;EŠíLñŠ˜Ä~;PDœš®ìaÐHv%ï¢ uïô]„Ê‹rú@} Æ_5ó‰p~ðvÙ/z1 íÛf©\úo|LÚ2ŸW1¿¯Êaª ð¼q .A¸g׉JÓNCë Ò+`Ç3‹sƃã1Cÿ‘P×-"Ä”Á‹øj»mÅ @žøüAžm$•Ïç¨,+›Fî(Íäß3E£[phÆqâ¡á ~Õ{½"_7Ë›»F–(FéÀzhò1Nï•XÀ.šè «ÓŒ®cYÖŒEñ?w«ˆ#Û:×Ê";æü ŠÝÍ%²ñr¾ÎTmt˜¼ÍCÈf;À¡ì[;ÙKt—Ðæ~ U45 »V-i,$VõG^hï%(·-ù„Ø:ã#µdð ÅkÒ2†½9ÚA²lóIžó=©¨mz±ÔÜV«Âjα°“~ÝIÀóГ„­üÑ~õ6ŸU)c¹Nû>IvCA8›—eÞŠåÛ¤ë‹ ŒFpø³= e­ j÷QïqN×iÆr•ÚF'R–è]/U–Òó-'È&˜uAZxôltØn‘¼NÌ nÕ¤Dx }µåùÈõ3D ¬S~ N:æDJl]Ñž f}N€.Çžébê"#‰Ò{“»Tû?P{,¾lº€ @(œk %ó,xŽ“7ÖsEˆ[!yHë'Îì–¶Yd¹’{ãåH9ÂBxuè2!ÝXø¬dõо Á‚šò™·ä3Ì€•P†ùÓLÀìJ4[Ù®âªõ›YÖeù&ƒÁäù¯€ÐEâªZÂb²Ýcrüìö.}þ䟋*ÚèR/±Ñ•Ûƒx´¶HðV €Ö‡ñÈ&4Á?md}ª*s Y<+g $¾1_ÍÅ 4î¹H9pšŸ2íe°,\Pq2¤›ŠGt,çw(Ewù[•=AÜËoƒX®…CжmÛâê<°bÏÆO«ƒK½·xñ·«hýÊñX2Ù™lt„}"~MRwÿŠ)‚¾ÿå»óùƒ´mfàyw^_ÒöËîò†7M¾¥R’Ié”DâÕÃÝc†åš8ˆ{îÂD¬=*]Jp+¼œ-Ä‚nYö œOšý$§Ÿ¥}|,¨%š¯êÏŒ]Ï¡£7ùpˆh{$¬¨À4W  ^ ¦v‰¯yËZÎ_ÜÊ(]­[›¿½Ñ™Æ½9:85Ö÷Øÿ"‰JôÔä§Ä¸Š„çûîвñÃ;+0Âÿí‚’¡Ç Ëó Êþµ ·L€ œŒÍÊé._©T’å›ð2ûÜVïØ²^¬ÿó´«êßf3Ãï)†näÝ¡AÁSûV¡±¹ê=F¹žÖŸF€èYaÒÄ6¼ÕöeHÅ«n˜ó×WñÈ4³ÓX»À 7H"¦w4Ÿ·Íºr´vI\ÍåoU:ü±cj}Í=®Nê§–xq™ŠÂ?GƒÉƉ¨ñó¡ÆD½%-Ÿ,¾gÒqˆ>¯¨–7—:6àŠHMDxë|äºz¯ +¶”ëÈS×Ö`A‹§uI§àާ©;±TËîm³:.xPK'?KöÁqrËvpABmßÑÝÜe|ãT+݆ìárÁ†bùûn](ÜÜä ‡WÚLäÓä'Þ*,c±Œ‹$‚=[Q.—nSﶘ@UfÖíÂ;28õæTvì±’Õ¢ù£÷MèÅüÌÁ.M<5µH%ž£<=7º¯óïÝ|”;òÑkÕÙcô ŽbµÎðLqs3[̶šsSÇ‘ýëÔOïDîý¶6³È6¡ÓGy7l_æ0W÷`'¦¼ÚÍ-ÆiHžDÆl) žÈ¡šÝËh„¿´µ=†Ê¢ì¯Ã”B…PÄ}ÍêX!”í×¾Ê`ô™óvН Ìm9ƒ“Ú,ƒßw]1€ŠnCöð»¡<Œ†KŠª.JG1l,w²ì³ƒz7GÔgÑiåúóÂFFÏ•£¹‰s‰AA.Ä7?¸Ž9 ç<S‚|{çøw”÷’ÜÉ!O× lCîTѾR¢ 'ñv’ÿªDVÈSŽOy„ã'Ð9%}kd«j×Å\BéƒF‡™ fc|Ÿ s¶ÿ‚p [³óÒ&ò“ÎŽ¼.œ™êïRJ¹h(Á -{Ö´§å=•G› ž™¯}­’x€‘R‡Çnž>Dù¨aøõA^ˆGJÅâšï?,Åþ¦DøF;|€jñ¶¬1#…þ±h¤·ÒîÅûs`40Ã`Ù¹×”¤FZmŠ i±š¸{°ÙKjΆkrIT(àUu)=ùª*R}Ž®YôãÆYÏã+½p—ÜŠ>¥¥…X"÷`nÓþC%ìÏ©ê&†±Î¨7„Õu'«<ÀQÀ:G{'+DÑn`ý9žG¯w‘G_EòHÞh•OÝÚ)¾ÕêÏGçÁ;[Í ;¯ºy™ˆiœkzã_ÎIX btõ+wbð­¥ÔÝbï]Ãìq˜ò I‹ºåÝ»àÚ;†[D™Ú¿wó…¢–æøsŸRŃûà>ìÞD¶¯ESnJ™ˆiâ½£€š.aÊÝßñh¯Ÿ£×4ÈÓ’'eB’è”(ß6vóA¼žoøUŽßÛoŠi…o»h:˜¿—´_·‹°˜ß£KÒPÌõÕ²·Èò ˆ (ר`Å’vV«ÒCfVÖ\Å÷ 7Z=˜qªxJ­úãû·Ow]÷3!¬/Ç’òÉòEñÚ ³ó­G= «1䟅Œž……Q™È}iã4ù™ƒýØÐOªÎè.±‰~”[„3Í/>š›óÎ,¶žv@Ô¹Ç#Éiú# ö™÷쯽Qmb#RÿÍ71p]C£FYCNz{SÿI¹põü‰„£Æ+ÙBF}T¼™Fy `Q™âç @Nu &3©ì0[œÎ° J²2uÑÍ ™eàfTa2rB@¼i/SÜNðç^6cbsxréÊ­0˜‰„h«– þq¯¥ñxŒ§A‘eLÙ”±%S$!ǃ7ø6Ø„ñóç‘ ,h¹‡pU}\.Õ_ÑM‘ knµ-ím•¡ó²ýGÃ]¨gS fN¨ë*PWÀwPPn¸NfÍ*¿Å{`/D4ŽY(JÉ#MFô$6Ú}é–HfÎéX² t³/¸’ÞÃ䇮5ø’ƒ-óÊóE«_éÏZ ÿ5=Žè¦A ½ÃyhÙ—n°¤"â•>üå1vEÐ ¡¼·0Ì!AÁ”Z‹Ð¼`ÚÆ?xdnÒƒ°°ÈÊ[¸«ué©«D޼?Â®Þ nŒæ®¨Ëiqz˜¯%)¢ÃåsoŒ³”1@Ž=i76e¾ßÚöa¸éëH+V|ަŒ÷n†28ô„c ÞñàHe×ÛÔögÄ*°hS2Æ—vÛõ-YÂ\el¿FLìæË‘§Ø}Ôq¿åûY—ŽÝ3N„ç{ÊÔ¢„ê+Ì †â÷ NúáA:ÝÕ›º#u#H†vªaºõ«|ÈÓn¯7’î}äÆîãµ·€´GM…¬'8V¥8„)7<,FÑQŒ˜Ò_d_ТÍ|›¯]Ž3©7Õ ;1妫ü%¤ß±¥È¦Ç‚ИºY¯²½z~Ç Øî_P’6MÚ’4^ÇU]ü[íf饫í0I)_Šñ$¿ÏP jV¯˜íãKÛm]X6wTÓN2š¡¸ËÿdÄAâ¼X—ݾë$Á³º Ž ëè/ÛhñQlàk{ÓQÛÕ(•-HŠXŸ@4«J­ ë‰ÔÛÂýh«]ݼ–[*¸ûôFK#¼¼Ö#!úV ê½œ’¸Ôífœx½ßZ&¿¸´¿aËëåóö7Ô9S`=«à¬Ã6ò~°^ ~›ð(½IwJ³N õ{ÆS|õìþ©„rpoZkWÏôUð;H4[Dr}+â°UV;ÃÛšõÚŸŽoæ¢9GªˆØ¯\*,kžd±ä!áqa!DùH§ö†Î eÑ+—D§h¦$Á»C°¬ãdHcùÆ-"o|ÏkJBØ–C¯(²€èëÆˆo9Ý·¡+:jˆÐìl• ©¼NÇ~˜aö`ÜhríÔ윷٪٧ŃÉÿ«æôËT\ÂÌ MT¡¹6™­ëÞ5AÙŒ´ÿD‘Íjëƒù&õ‘<ç6™Æ*WrÍ\á6Û¸Ô õä¦F'~‰g% Q•2Ý?ð®„}´þ E‹Yµq×EÈØI’7-ÕÔ1ŠªW[äÑÑ=TÝx%hôÛY1=9â,éN‚ëEË&Dy4X;±¬÷¬Áý•–;‚½aßêoùôà mßKç‹ä’vl»§W#2?X`ÈÉÛ*H•Œhb݃½M÷¾‚½…ŠñõeB<*1g‘LM2Ñ€I-ç¬ò b< Ì”©z‘>@»™SÅ 0(Mï#SôŽ>mj|vüùÒB+ÎQH±17ª!u±’ AL–ÞÐ6D¹£u` 9Ä‘ƒQÖo›=ÃrEè¤.zAž|…ßßî¢×-Ø+ª²2Ý$-EL¬;c¿Ì;Oö˜N ¨dP^R7uSúê韫bOô©¶¤Ü¹÷O³tw×üpÖJÀ†U£f–©¾æŠû×'»¸b7EG¶q^;Î]†SgêÎàcJ‚»C81E?­…W6Žü(f²ÿÈÆTñˆZX-V•g2yë×ùYÂZpÙÂë×ÝÖÀ‰Û¦®V<¨w–è¹íS,T`T"IŒôŠs_X”Ô[Ç‚Aœ¬Ï<ÊÓ¾ÔüÒç“>ë"§»<ò6CgYÚ€Týy‰¡„Цޘ™’ÙúãÖ­¢Ô?GÜ Ú¤VÆXL;3Tϧ¨;>’G‹dkzÆ Òv=Ñæ6ÞÏ&çMeÁÍη6ö/©z“q kW”ÃPB€qNÿÈcÇIWS"´ÎC§¬‰-šy®Åî” C6œôµ§)>Œ.ƒñ£Mz5²'%®ž+>ˆ¯ pµK\£e6^b¨Ú)y à Š¥1<µUDâBùèO‰Q6œ|†vy·S¿Êüµ&Á‹å<Û xÆ,ÀÐ xô·_üŒ×`èú¤ §äµ›B$ˆŸ½`¸+Ý ¨í$2ž¶Rþc º£2ÙmšhÉÕ¡ÎëEr¥:ƒQM¬ž¦Ë×z‡è' äØEK$¦â— ä£0ešWßÖ9ˆ·Ú)…óc_}ëŒlË›ê2½î±ð‡fL)(o“¾¹vö!à 4ìc®É½MÏ—ëŠ'ÉŠˆÙŽcpØí¬@iå®E"ÏÿIT…^ÚÓú)À؃ì`³Î2Ñcsöã‘ý‹1Ëž[îcj~¢¡ß}–RÆ ˜u¬=#í<?Üdú‹Ø0CBΕªk¾¿\KÊ!Ë…ñ©°;w´ÃD–U¾ÄG[±ùhâÊ;Üʵ¨ûÜâÑ÷8OÍPãäÆý27ÔL Äœì¥wÿðÉ|V#^ø·S;¦m5B³7%7Çhùµ *4øüصH0"Ž:Ü߉é³È.#…Ó¾Jäb xú:œàÃ#ÆzU’.c³†ã>8P¥•²¢BVÿÔ‹œý«´Ï‘)èpÚ„Ï¢ø|³VØá8™χH½a¹6í:¬Óÿ8¡`ÊvÕ œ¯greß#… å±õ/|–­¥r_à?å¢u-""JˆBÚ!§0Ï“;¡K§“|…?¸¥Eü•i÷uŠE¿‹?\öÁ6÷Óæm:^é¥Í8G¼¢~Ve8ô&NùAJ„ÄsŸ¶Óù9jor䦢Ö<¶]©±’HÍy— Èú|¬/‘··á›í X‹ÎÜŠ:VÐÏØ8àÔtÂßÚÉü1N‹T3ç³8ü}@†"Ѿ·0kÀ±«€¡D”5ýM ö.•O!CÄwXK´ž„ÔÍÔ• Õí¨ÀVŤ.;adÚ ·à#À6ÆÚ/”zs15¦* ¨4Â>ìç6…âÐü ½tr!÷¬ö2ˆŠLÔQ@¡['4³ØQNÆF²ñCnøàغ@á¼wà\—ŸÚb‚a•ea˜p*Ëœ+é-.½Ps@í€[pGÑŸ9—Fë•á[RУ}”ŽL7a^a“çÄ£/éÕò/ÀŠ,r>ó€tA?ƒR€ú±VÑe‡ìõp&µy•ÎêŒÈÝÖ"{>ä¡H«”Öí°H„”˺9”¹°»×jëxÇhäsÂC,H’nA%®þˆb¾lp-–lÓ’~¯+6n!¡£à…¹¾5Dž>-šUŒ\Z¢ºŸñÚ4¥x„¿LZyÆWa+‹·Q¿Ú]2…!Q¢¤C¬€î”ó\H'ð`Qþ5Ë ¼BϱXfmtÖƒB›Æ¢©öµÂÕÿC:BM2‚TY#€FQþUtëw FB kòøT!œCÅGêà:™êR{âú»üIJ¥8{€ööôø'iy¥”Û²“yÁT&ïåì–Ë09®î•ùᨠ¾Y‹ùf5XìE‘{/¡þûæ3.aܲd·=d)mœ?†í\ÿ -ð̲¹8Œ«Õì,½¡.uú"޵ÚB|õWŠå$p‚QØqùLð¯× `ïÏ=>\}{h JÀQЦîÒ+Õy4nÍ`“ЮBWÙÄEñ0‡$Ò·/ùÇvl µLgüÃjÕ8äô…]þ¦¼[“À΋F£wÒ¸J”’IÕ ÷јuà‘I&͘ ›·’ĉM¾2º{Ÿ‘š”Ýœ>>|j¿G–€w@:<Ͳþ0jÿ8=f8öÿÇE ’!Ù×’Kõ²AþF3¼>Â!ß9"ÃòÐO¦€ÏÛ4ÃaÊ¿æÐ¦Ð hΘ‰™þÞæº™‹ÅPþƒvtm€7kEÍR6î0NsNl`€Þ¥T0APŠùgcÛ%ŽqÖéÔ,ˆ?G«‘°¡U±ƒ½ uðNt*ۚ监{…ݘZº,1]fΕ<µy‰+#ÊYz‘*4*›v$4É?@Ë‹´0édh -TöIk!O¼$uœÝ\ßà?` øÂ2g†Ó'‹B9ýŽ[`ŸS–VȾ#@š‰›¨À´æ= ŒLï–(•§>o¥tjrâçößRNú£ÉïoŽ_}gÕÓÓ‰eòJ=pŒL„ï2-¸]T©iE ³^¶"»zkð9ÀZu±çûgíÐÔîDeX—límssd_%/*w­ÕË?Âtîž‘~yG$Iã.ί.ÛQ©â…–L5,g‡¢¹cžÕ@9zz,E}r vô*R6CXmÜp8§ÖÓ]‰frá½ÝÌE» <#ä ‡R_  F3Bh2‡é ø·ffÄ5çM—#H³3€µ~‡]‘î[§\>@«BF1Aët;ãì´$”ºÌâ{÷‰)Fº3]—¢2DE¤^EM‹Ôn*Ó.à×´ŸÁaí²q/ái¾È; LØV,X½ù'w0øTŽ]§'o4ÿìn,«‚„â·Éjs0>dæwtJGÃùµ&6@øšÑÍ Ÿ ¹=QªŽÔ:€/ÒÔ3€Kgø×´ýæÖöÅø'Eœ¦`gö9]ÅèÏ<¯(7L™T—´´T¬« ÍM¾ùÍ>E¬ÕQÇÒB©­„%è€Ú뱻╫Ç>ýë $—Wªn¬gï_ȬÛW‰ê,ïM9æNqÀ°›þŸ¶@Ó51¬²™’,±ftDH2 §>ƒ–ªä|{Ò¡žRdß,;Êá”V7¢±¯Å\çO¡Y§õwœ4·–f?ÂôáÿöŠCU\iÿY@Vhc1·»k[x»0A8¯~Úâ½n=ÚãIæz0iì‹ëM¢Ãë3¾nÃñ‰+ƒ§åÕœ„è˜ßo¨_îÒQëÑ}q ³M¬þ%´Qs6žZ•{ºI½z?ó?+±uÕ§Ì" ×¾S–=ý›%#'EJm#Ð.»JØ×‚´õÏ?»1ûÁ ûç¾"g‹öϧ¡¯¸ÇU8œB=Ï̆ç&¨ò#o¬1?«ï>Ž(ȼ^U;ƒÒûŽÃÒ­àþwë¨˜Š¹#úËc1däáM¾9óÍÁ0Dî|íÓh†*{iòËRW6öTšúÁ8Áõ÷¤zW››NlTôóy2+ûÞ£Û}9Í$—ÆÃâœÚoI—›Ú9-Wÿ'¨* :dØÂ ¶5²bò.½œ`b£uÒMë´Ÿ›ƒ#aØvÀA ÝF[ÇÃ)‘¤’ÈÊ­Ø@*!Wò£×®ÆHzýO4)Š©©(ªÕQÙÄAÂ’(ek7]^ ûÒ6Ãý;Zh@l¡åm›‹‹´èw‘‰x¸JYH"äµÀYq–¢ ØäߘV´æÚ÷Ò{ …ÍßL¸³׈.ï$ma{2ç\ã+Šüþ†LyH–ŠŠâM=ØÍZúl5v?’ÏQáz9 ijT«éÔ²ÍJL^ŠóL7uámÒÌxbÖ×(9雵n9œÐî£éñŽ¥hy×Pª_r´{©%h©žÅ¯ÁÈ•ÿD0XCŒÅ.ž!%ƽŸà:Ö7–ç­÷ÕŒa'CùwÐ\†MRóëí¡»'d(þº˜³¯ ÛæiC/ »a”c,y}¼æô"µ €«g;{ :ä‡dI ˜¥ÌAf3ž8.¥÷†ñŸ”5x¹_9ž„1ÁéÀ-Ohh;aŽn}îõÒSEŠ;Çâ'“ÉýØõk)¾ÑÛIVíVº5¦×d]è;€I OÁVJ°=–ë3dµí®Xd´“\>·¿£]à¦B™]/Žuò”*4w…½ó9å)ðºEL8ÿêÛ‰-Ž´O ®þŒ¢Y&‚4ïU$*(4G!ÿƒŠŸL_ÍÛäÏ*jp?yù±}~Ô´ô4r­“16až´Äñ>­“é>ŸsƒŠè=庯S1b4호ŸN=Ñv«3S‡ƒÂÇ4_Ï|EBd^œMÊÅ«áœh;&pòØ}ä.†žÅ÷s„xü³Ãvƒ=8£UÕ¿a~·Ó n눑;ˆ„/›ºó²ÔªT`Sç R·ä)L‹&泫3#°Z{îUôwÄœY,ÇuÕ/Õn¨aå ¼”ã0·e'}59bòš>]XÀ nÃ:9 Ù`þXO¼qÄRTmiÞ•ÿUÏ„+… þŽîY×}¾IëÁ‘×,ùÈS‹vP¨kf¤^$=5E üZ lìŒâ+Z,娂ڣ1:´¤áÛmú/MŠ- ú€â`é–Oq¡Q—¡órl ¦x€Ùªs(µ©ÔîÈ|ž@ |dÍ‘7ê÷/â<†¯ƒ·»ãñ´F¾ïNð áOO` #u}@šáÕAn¯ÄÍÓ:ªÙÖ펙Ú÷5yD &™˜RcáSÀzµbÏñã¶TZâÆJyª7NŸ’•[ÄVjJV¡»ô‚ãräP†“2vË‡Ž«åš.¤AjÊßË«ÉßÃÀ(ÚIçAVÊöŽÙòjN®;ãô㔵 H˜À¸á¥,T‚¥ÍéÞÚêùj=Ö¬Méé‘!“[¦ðÈ?0S¦K›Šp½ç–Ɔ©kr“Cñîø6b lªn™ ¬5©€R1lQBYÐ&,kß{S™~ [нM‘0útX[‚ÍùÕ{öŒGÈŽKÒÂô÷ÒÐ粕í/,°ÂøF­gHœ&û–‚ B:DßrǬñ}©òºâpTûò2<Ïxö@2îÔ®~€2i£–hm+¡ØÄ°´ä!µiŸ™`ÀW>xÈ`¿ALÌZçøúOüj©\.cSuE÷ZgծЋ檤¼àûÖ€±Ü†K[€ì©¿¶Ít ‘ÀMÛk½'"/A~û§ŒuäœA»ø SLÿz,®­:—ªg9ɘ_T¼‚hK¨äü¨G˜Cÿ<[Aê]ç¯öb¶Å™@YšF\G{@ÌkRƒÍ¶ DЃ€×Hhg÷÷ãœ*@HB~‹=ýx…4èö/ÊüæŠÌb0ëŽ(y¦è ;ÏÛ“hÓL¶ •'¨àë­_£!kºÁÞ9/u×À¶ ÀÑÉt¿^µÛXØæRˆ‘ÙòÏsªT.á#z¼¼)•ç_oDU8+cί|îÆª,`ÿ=¾(áIo–Ê?~‹<²ÆUSS"Ôr–®‹F›?ÜÈ`u &þó-˜DQÑSŠi x…¯L ¼TÕ ~©GÆœXUkûÏE¹Ø¤¥d³¥Á@—Íò Ãê y^Fþ~˨ÓŸÒÚ‘¼zîi½SìUw÷qòØ¥ à„[9áŸÌTÒÜzH[úOî$2ÎÔ¼–$´I@Qž$àGœÈË‚8âzÎIÑ¡Uë}ö,æh5? eo™YÔÓ£«0î`7‹ê5«a_×øÕþøè§áÎ Àw-M î#Ví(ÅÄàüà‡¦àk€æ•Zù;œµø.Pjcžä­äô<èà‘ÁXË[`|5{ãSl_‚ÖÏýo JÄá€â·÷P©¾É†r}óæåâ­`;ËœlÐ ÇÃSgÆh®“ï%LoÏS®yÕí“Ü?~¬œòmÌ ÍQ­Š‹è½|(‚‚·žTŒwl¹ ñœFyµãmAçÌ®YyóÊ·Ç¥7kxšßÛŽÅÉ(ÖÅQÂÛ ï ðG· ¿óp¹é’\QUŠ»+lÅÖ¼m^¼îTù7P¬Ì­£õ I¿pr bÔ¥ÒEd²ÃH%°‚rî“y@K [;Ïüj—ÐI‘"§€çÇœ_|b.*»õ¢ JSm¡.Ùj fpH—8ìÚ÷òò%ÍçƒLzvyµ¬ ˆ+B˜øÜÈóˆyep?_… üú¶˜5‰÷iL^È3U?± ~5ç|W1‹b€Ð±Ø½O§Tª£{ʦ•Õ6t¢1 @F›ÎÐç‰{+¦£yÑ4íÛ¶MîË‚ï‘E°T "b ooľ–t¤1‘®;MBu% “ÿtœQ‰Ãá쇶ñ§öHT” ~›A.URNêMÍÖO·ÄМÙ/{d°Ð›)GDmRÖ&½w×£IÛõw¡Ÿî±Ùë.{ ãÛ- ²îê¾àç¹F¼¦—ñ/)î ®ˆ0«úG@gÚ|½`±Ñ•lpÇlŽT=Wñ,°Xu]Wb1G6"Ã<Œý«ópoÁÞƒ‰k]w1!D6‡€$ÑÝ(©(?¾ìFñ"4âùv6†÷§X÷3¢†3Õ3›ŽÃé_ÙaH6Žô)ŠhÂÍ9ÒÍ‘"bMBFÍŠãóQ@G쇼¡Ÿll–Ýj‘a6^¬ÕA:ý×hzfÊh׿Šx/¼P7àÁ,çÍó.!±M3GϨ>Ñ3íj¨8Ú& »S•ó‰ù[=Я?üиÝJÓºe#Jy¼ ’Ä[`}ŒÚ4ò"¹=¹ÿã-'7«ª_dò#!ü  m[. @ áq¾ï.Zñ]a]l„ZpŠ$í‚ ¶xD?ìœ6ô<;Sòã(/h¼ö¤B£1pá~<ÍîËÈ„§ÿµ 'a‡Í½ =üÄ&Ê/‰ xo°;0'íÇø°IŠß7Ë´Ù² -O—XŸë5˜Å`MŒÂùãdUWfXQ4j³8$ô£$FÒ1>hk®ÊÈ ùÒ¢Ò;dÚ\÷ŠN9Ìè0^Ë^„d:s¯¢’ÿ5ëNõ­ "¹‘Ýr hòæŸãâøMQ|­<<è[ÌÁ(E±Àó£~Tüç­I_T@p;OÇ ‘Ø+‘‡lÊû”­ "¸{qœÎM羚Ì[¯ ÖæAˆ (æ±#T?qimD5ñJœÅ䔯&D}°Ì™óͶ~Ï<¥“ßh‡Mo_NÙûybhP¿E<ºúÁËñçæzÏü«Þi|$ÛáB¢œÃ«&Á>£„?½éª'r9Úý!ÝëgWNN­Äò—‹zO#:¨`(MÞ&ßÚÿfè^î3(~›|W §ŠíIÙxØs^dUù3ë”7©Ká¿“ªòÖåÆN}RËËÞÛPýŒ< ‘óãÁ7ôYâÊD†ƒ 1¸C¾)`®¦ S‰22ÜɤÀwA{‡Ìhû÷ú­Ÿš¾ßï«öîj"“èÓñBÄì7:Ï=r©v·Q«‰x[ MÕcÃzâFF{KtŽû´ûÉ5NHü®)]ÑÙWœñ|yÃ|O ŃWV”¹ %OŒƒ½ˆ92ÖD!~nÖÑéÕè>(hÃV°R×âÚ†fÁX¹µd¬Š .£ Á“`•“þ-XrÖŠ®1Ê!U3[56>Oz;¶#Ý+´~ÛŒPÿS } Éß௲ !Ò¸¾NïÅë 6%@I’›V|ù3= ¸—þrÃHM@ÉžS ë«8á ›õ,.‡ZQRÖ Ldà$¿7¦'\7y{«÷DI¹|ýðêoÆ;^3gx¾´mÇY< ˆ¸ðIG KÎYQ‹– ]ø×pQÙÞë3Ô1ÂÏuŸ4…C(ÒÊý¨Ÿ‘ð\`Æ_°É•JnRT(ÎÙA±m’…T9¢OGëŠ@o5½•œØT¦À%ÒÛkÅ)'{ë²ü“Wt‹¶…¢ÅAèòrÈJ$ö@ VÆ‹”W¶Q;ƒÛZ’Ÿº“4§°e¾GE;°œÕ6AÍÊ– (Åzªõ¯÷-h]°J]Øß œ¶÷îSÀOYú…y±C-‰ÿzF8" 6&Ÿ¶-ï®] éW*߯D >é?Ÿ­F¯S/(f‚YžŒ©Ô’ô'›IÍŠD›­¨ÛwSL—¹Ã{+?×»4gc´Ô’Òi´YiüÀó"«ÐhUDZбoÆ(¹˜µ@{ËKMüüÃî†CF‚¥à =BñRS›P+ësö±CýÛé€Â'™…<~»gà¯oëñDg±"àÄ…˜è# ÐìAú²6ùŒ*RîLŠž9Tª‰öJŠßŠäc ÿüœÙì †jýÁ¨5¸2ZÉ›˜Kb¬…â_Èè3Ô]س¯š\0¶4Åw˜,͉:bZãÏ\¸:Æ ßŽ)7& ‚ÀcyJZ·¥ŠÔT‰iˆ5îè¯~ÇŽÍ£.N 3L“Ú[ÕˬÌAR–º z8½L®«À¸Ÿ89›(¤Nf¿!ú$•+?u7J1Õô…c Ò×2}|g3G[2tç›”@QŠåO{vÕ¼ÂWd”Ὂ9µÒº¯9â¯ÔeL ¶PAÓeâþHaíÄ7&ž Æ-ù;,À¦j-”ˆ¥íôÃܾo:gùrÆ gº±eŽƒ¹ý:=¢’ôú"r…·«h£¨w,&‚˜°Ëd²:p¯¹Du±nz©½rçÄ6—ÒCŠ‹G£x¦(oœ$©Ï»—,^šØ0€ÅQb®âg~C&$ŸêGÏZ†ÿ1eŽ T„\™ÙzQî/À[{àáaÿ $ë8[k?u9 ßu±g¿7ñGg‰úƒSÂsyW ó;žú~Ì©|ª×B8¡¬ùO.,Îლàz#­c1ªƒ‰˜ÀAw8>8¸H™qã›n7>IJW²SRcZ™3c$ক°"E“ÿ¬H–uÚ¹ßû”nÅŠØSj¶où÷Ȇ \ˆuFa©ÿWF;˜ôC›ds!îçÉßÃ&mõ‘5¦¹ÖLmÔ]F¾ü ?|r­.Jh7U¿±ÕQ~3rÀ‚ÉE•%ÚA›CùöÆ Œ°Ô…ßc®DÀf„¿B‰¢Àœpí~G’²_݆í;w©Æ)ïú[Ç›„‹¬<£duóíN#›­’ð<€VÐ9e`[ô 5ÇÏJT´˜†umÞ>6Úµ¤†WB>«5ЇGé)Z[PKßWÏßÈÖYiŒ /µ®”㾆«KºHÚõÔÚÔCÊ·²Ø¢NÅ ¶þÞoÆQFGÍ[îÒD…Ù:‘t÷Q ùéÁÃ^H8uJ5w²1ÅÒ$¢¬¤Æ1 ÷‰¯EõýÖY§ x³:Ž¢òp(e¡ fLHî¿ï…†¨Ç@ú:Ë@ÔGCÖW #Mÿ8¢iÕK ¡'Ñп¾J%c»Ñ=S¯U]La¦ôtùl–U›pÔ'í§È9†„ÜܺiÚÒóZèÖò[«öò0›Ê³‡HÌü燈œÐóE¨2ðÙoXG´~ðËY{H“LX΂Asš}ö¸Ë ŒágîÛYEcãU˜Ç=¸=)Ú”…ðûT¹/):¨Òø†Ÿ²¤ê 3|æ‹ß/û*Û¦…Æ|ï(e¢û—<§<«®jq,cwH.©åñ¼ò­íßCó̼|£@Óq@‡€SvèA†%Ù¼¥%ÒÕºVoÅg!Ž5üÇP?c”µHEè²Ü¨×ÆÊÝM ¢É{¸Xï/läz]U­>¹’ZyédêÕö!8˜tú_·¬Nò'M`ª5wªx€žÏݓͽíýGc[ä7$À ÿ6àÛ®¾ŽÕ yE.?<ý¢Ûi(”˜g±Š›n™µwÏz.ìõüaSQŸ†-ù…'«µ',bP§8aɬ 9UÃÈ_¾<¿žxFëÌ¢R/ªv"ù­¹VƒY‡nÍËYçÒ««RC˜ÓÒaÐä›ÕX[ÿ…õŒÄ_5+¯é9ådÀâ…\ª*²z•qßlÂ\6uÛ…8®>‘¡O‹è¾Ü ^®½ÀE#>=þ•P,®à¯  tg>ð9×`§¸e3°]èÖKy¦%j7¢ý†*@\ý:‰ÆÜz{O¢H» xg.#<ò A¬z°¶ù&¸Xóâ¡+ðŸc“àÉ¿ð> ÍvÿÏâ0”þqÁû#ÇHæ2þÑ ­MÁð”Ùp01Ë^pí®õb;Ó7MjÔ×=箕8o(KyÌã ÎEú¡¬³Â,Óz°#Ÿµ!(çPçË›j™fÒG]\—>þìFcó&)%”ުà ÷²Wðå°ÙZÒR8‘dË)ÓêØ-×÷¾"Œ´yο)o7)>™¨Q¨ÞÁœµY"VµMÿÒMàÊ*‚µ¢~¸¦Y¤‡ªþ6Ä\f(ƒWôá}‚¯¡NÁÆeI jYxŽgÄóí?éÖ}I6îYº&^¯¶v’9›hŠ}v´‚7͈ÆQÝb§kŠ4[Z©š²73ú®÷àö³¶å‰ÿTP#§;%s"ÑëQg¡%ôÚD‘U-ƒ„þ«»´Ô§§LÓM*m€¾¦X*Ìûò«ƒ…©Í+Tmà@a’ãt¹á{-v“S ’úf«¢%ŽZi¼ ÉŒÖ Ï„ôK'¶-’Î)iãoŽR:¤K»XdfïssNó&ýœêçí`-ãw °!1l+ô÷Ý«–ŸH~]Zfî+¿Tã¯ú3gI3¦š 2¿˜Ï‘¨’Å#]€ÓÎv²²yk\O§Ñ`6§>¿H>yL@›æŠ¯¾!²ú•ùÕžJy–hùGuµ|ólôÆ&Þ!ÀêØÁC€èô6’Ä®`@¤úÛZSˆ¾‚*œºk-ú_ܸªa³º{!•`]zêi“¡]½Z¦…Ù±D凃¨?•<"ÎdkuŸqž£€ÞÇN6a¶A–x.Ä0Ü?“&•RªzÎqölzLæ a i+W°Áý½þñmSw™‡1É—rñy'Ä}–ö·ýŸÑëßœµ Oëb³Ê/8ïÛsº ?zµ„èEÇnªáˆÔp1 ÇLµå\柼éÞð©…ÅNÙ²\ÉBïLUNýÚoW…¡Î°MÕI°ÑWtCŠ@CÂk îÄà‰ ·òåLr'2*æbÝÑìp½$eª9Æ©eËÔ ’Ðá›DW(P¢ÃZHîGÌCl7A±Ì¢Ù¥”íôé)•|ÖYà÷v×óù™'ÅÁÉó¹äN dª{VÑž%#”€GVè-.Ä/ëûpÆK{1=ÂÇK¬M ƒæZÕù&‹ƒµU9k÷ß 1JIXGW’T}!'Ðôƒø…»C­¢»W2:¼•åÜ+‘ÙQ<øæïMÉ_vAE»û6.P ª4 }EqoUL^ñxçv²h]é¡­'ìcÿ\ÝZz!‡9æôü­Ñ·ï@St¡@ %¶‚BXÏ‹6™«O)”P¹™ýÃjÇÌfÍ–Íi™%ÍCIK½¬¿GÛzWJX ,¨•àí¶åÇJŸbõ×Ùvlδȕ@íußCÙÅdtVI>és5V¬_¤¶EbðH@Ȩ‘CÈ1Œ zY†î9!sœ5‰¿F C&Ì4\sK_ïWî…j­‘LJ­˜Ï³¶ã¤2rÈzA/`jBÛÍ@­ÑX"C†íZ/ìsL÷.^aÙd|M¬)áÃ@%vHÿoY"Ò¾!;ãiÖî}ƒÄL©€a—þŽ/|uLJ¶v[%ÍnGO\ò`!ŵÄFÀq·L»‚™lH›ºü­åîò£QKãKö’j76¹’ŠW@‘bÕY›õ×öü4ÚÆÄêVâ£-€Õ³TH{\M+ªk±ÛÖ'èî(Fi­¨sèÊ"BðÁÂ@>«$±NΘT3±XG^8Q$&•ÈB©ò¸ÛézÃe]ýUÖ‡aJŽý»¡À-¬Ð«èn™q2«¯Cr níÛúÂț’Óû‚…ésÆ´Ðu4ç}þÕ'6ó3”ÎgÝ·É—W’Ê^¡X}ŸzÙõ”æíþLRwÛpÑøÚÇbTÜz3‘pÑU4»_áÖ–I ­¦Ü¸ûiñúbµôI@4¡BîÎdWÝsÒÒ¢pðš‰~Ù“Ók´I PHIx"/Hö¸”ûÅ”)*¬Ôµþ,gèܦd]*=Õ,ÜökµÌ$ûJå‚^UÞ¤®ž„|!›H<ì]ý@Œ‹ÚõÐÏICª£.øaÛÆI¾:qÁ§“ÛAÑE0þÈ#"àøg?Ñ#™Ta}’5 ßOuM§½Qh]3-bA÷ÅP›ÿR´øÇÓߦ A6b>˜½€Lİp`íÚ-–\Î$¶Û¹Éˆ#QßC5ÃâSŸ+†ÒÁg7&ÊÔJ}¿ç Ü^2°u““Pí±”‰<…Íe*エ·®Á1ì8Ý-äD¾ˆB7ÃÎB·]°:ïm³ÆwÇ8Ÿ‹?j´­´0O-º!)Yâ{Jw½U×1É[{ðËZ% ý2?œÀL‹&Æ€åKÉWNã(mpLÞ9®I8pËÔµ,Ä(˜ªâêÖÒºT|OU}€Sˆ*Gïuó?íòÌíP C’0n«r2jàž IŽi)ë4Z†%a8³±ýgˆí+I¡`•—R}GñP€‚¬@÷ÛM1ºB½:‡o]©œà­¯×ÌÃ+† ª'šfR€VˆºÔùL,Z>€eÂuþòó¨9j¡óŽKLO•ß]ô¡rÙž¿®ç;¶·|èE{™cñî,mOÞ¬-N¸®Ì6,ì†iÚžÏKoÚ]Ù¯£Õ嵟ƒRd;û9äGÐöjt4úh·FK¯lXßnÔ[—Fu]X4azM¬ËÞk'v§{M2Á¬HÅot YÈ|ËéBÕ0’ýØ®êõ¡Ÿ•ÃLw|ú¼"íZ˜ »…bkè6ãß)øÔ:ΣËäXõ‚s˜ô^Ë2Œ±TÙ?>ôn tï¨ØÍ©õRëÂÎi• q’unêYxþ>‘HÎ…»”‘Å]M(øüRzV³Ý¼Tîþ[÷, nB'JÒ}äŽMÊî ÿà=10[}8è*SUpÁ+0ç3ÐÖà1zYuÄñ§,]“ƒ<'‡°6Gÿp,вßT´¼Ëµ}ˆ©u†‘ ñ˜´)H®½{˜€®Q ÏuÀrb…GQË Ñ9}¹£(ãeaùˆÚôâqI/ GñôC—Ë+ã‚uÞâú:jËJFÑŽ– [¾ïeÉmã¶^’)¿Ùg™Øì'>¢/é‡ @ ÑóÆæh4âO-¡U'z @Ï|±gMÍår9™X‘÷ßè8DO½Ë2QV€OYoX»Á}ò Ôâ7XEðmY3ràù—…+½è–º&<î¿ùp¡»ˆ/§œ=·É±£* {ÜFË]uQ²è!^•–è>ÅÓTZõ]ˆtȃwf,ùÃmmNÊÃ$Ní/±<éu?/èGh ª ò lAñXâ+vÐXýÀåPãñhåžì÷QaO«õ÷\9bÝÀÉ\Tö®ÊZ•diÑh… ¦t¤ Vû¡‘ÛJñ&©þ¯Ÿ<Ò2”3²ÝJþȧø SéanT)ð+¤1$ SúTñ6uß,x@B.0r`ÃV…ï©(D_ož½ni0ÿ6¤{bÈ„/2ÑKíìÐö„H°†ŠÞa °Œ¶ò{@Æ£&>Àm&3óigÙéo©¹@ø)Ðe.2Íáw bÅøeËû®_=üòkýþyvQ–ÎÔ@Ü‹íb@ù3 Ò«âîßL>« Iôý}£” æ:Ai¥ýÜê|y£©+-½‰ì ÏoC  ÈDx«lñûñç¹úìÚé—ʨÓ7Ç!+“vhÎvëg?’¯ Ñæ@äÌlb­9¦_@’'PF ‹”àô!]Åö7ZÍ÷à˜Ðd%ta}­"Ého.¸Nîz‰¯6X¶rÏe£4–}”OiE^’"Q~žçæÉ4dž{zå¿9ò‰+ñ¹Áz,Ô®L‚¤Ê‚/ñ"Ö«HQjwóÝfÜ®·…³b.¶6Uh¿®yXNä–'sE ù5ÞßeBǰ~fï‹Ë9¼z{8?óÞÔ°|0íI`w¿g³ûÆ8ú[r<FÒ@¦†^·c5Y´¶Jvôÿºw=XùÙØ×K$ÿ0þÝgÛŠàÀ­ópCc4:êeôaRÅ̦Ô:4ÖEúBÑè}•UÀ8½«ÆsÄÎøö-Zߦ|y©F¼€%³Ú~‹ˆ [†ŽÎ~H‹X_+)®q±„fw°…¤ÂÖ` :#Ë ­)Ç@a¢2¤mÒ2µna«ËžPP\¶C2H.tÛûMñ"ú)#ÙV*è—Í´€a±U\±ÞkßC›ÖÏæA0ÜvŽ](Ü?û«_æÐä(œ· iÒÔOéW¬œT.dtkï~dçUŠo¯ÛA§ÎE¦foß@Â#2 ó³?Zôr=íRg!몚Øøa¯›“'ˆûƒ ]ÞBöpfÚFŸµAÑÖ3#“"ÀÀ`éÏþã—XÉ^ýÄû2ë¢&«{Q•qÐf)½ÛTLÄë»UÒÙX/²1P"³ßÝé  4„:w>VQ5wë í%¶ì¨ ƒd¦ä¯¸˜¤§Ë\!º¤ßpvŽ«„ R¾ (EŒäÁïï½;8hL]Vx™c­ÍYO« ¹,ºÈHޤ¹201-yú¹¹ç17Þ”¸Cá4M^‰?y—ÊN‡4uîŒ ì ÀFGHX ˜q/½&öº©ÐiW÷-}\Èß6å±+X´º;Ñ0Aß|Õ܇ßÜâAwä§Áµp }ÎisÎ%ì—+9q¤£õTÎÚuuTJ©véGeïì îÅôˆÀX”÷Êe|ÄM#È9 e#”pÓ%îµa^>‰Þ¢»e. J >ÂŒ3Gj1q7;ÛœLXº0xž×¹Œ›(N+—Hàv#~Ìx"l:‡ÎX†iHEÑüc†ã8±è0ó“¶«?‡Ò÷„r¤È®|!»Ò¯§Äz±[Rg.‡”š¶,´PªKgàˆS0­M¹üýg¾ør矗o˜Ó4Ó ÷¹³€‘fOA .dH §¦×èõsž¯ï‰…Ãû;î*jðà\Bý&Ÿ9”=èÓ†ÃQœ›*¨Ö ÚÁàÁ¥Xrõ:Ñd$ò8quÀ­#|cVë}n€Êw{…8Æ Lr ñ)ŒHü|²^ÿß/T5¦{¹æì]ïmiSJE6©ì""‘"j–p§BÞš Ú¨êfa›íÀ|ŠT"_ƒµxŒW¡.–üͳéñÁ[•}Ô¿K€ü'¿Í•*÷séê$Z†Œ˜r£4^mí ¿¾ŽÚ ›¯G®¾›(%³è¡2tA㙞”°—{Ó’;ÛÆÝ>%ñ±¬áâ=Ú÷? µ2ŽÅÊˆØ ¡µšÏCg:kvŒ:qnnsÊ~(hêÎhmæèYÄAËu9MDZúŠY¡Å>ˆó§½ØkÖ¥—EîAæ×*ï É "+-¬#k$Ì­q¶#] w>xù%Ý(YX¥Yu¬ïçyKìÒ|±”Šäh¨/°cõ¸õ”«M%Úxòœúý íP®Ð˜lvS)NjÜbˆV»“¶¾½i‹UyŸù¥mÙ”3èòÕ¬ ~ÎGµªêÜîtåºÎœlS!¢mÞ ¹Q²ÍÊ9¢ç!•bHýÐÔ&}6º3I•Êp¾€} ñ ¯Í|d^U4n¦ÂP S錻ʂ¨ÇùzA={åõëJQHJ†*ê‚»üI x\“C^Xm¥çéÜhìÊÛÈÖèäåkˆÙøãH8“l]‰‰›jÛ˪•7[-¥\Ù0DЉk®BǰÑt¼ZU¨×Š?…ÏÌÆ³È^vVå~sÁ‚ÀYH'Û¦˜@·í®7 Y‰¤¨;ƒ€jÝ)䃻XÉÉk5cÔ³ã¨è›“ú.Ý¥¢Ö?6•¥ëÉïh’šPÝæÁ€’eýÁ=W×/C¼cI­“­SÀÚ ôH£x¦ÈzœÑúÎvÌeJ/>R³doáYt)6ªÛiÕN¥¤ì§™Hö¾4èC€k£ÈŸf5`Ĥ àº/ÌüN'O¿‚Èx˜¨ÄxÆ%ǮѪÊkìµÏËKHÙ&®ƒã"¢³wÅn½ŽƒjÙX‚üžÙy_®Ö4V$"?‡£:Õ è:'^©H‘*•Îuå/é'!Øý_†¾‰M%“)ƈ}°m7hάñ@×¹Ñ~ôüHjg¾¨°ð $øsÉñð€U°x«µöó®N}´Qôwe °xÙÆ„|玒†;w×/qã­y¥÷/7VÑpê‚ÜTƒºPÈ„ó8žÅs‡h¤D=Er𯓞¢7a¶Ê¨ ÕÃÎÜ&´§ (7â>‰‘¦Ùôa£f÷bQñ™­¿sBaÖ.`AíüZ£È.joâ¾«Š˜ç@öeq»uÝûƒk‰ˆ?j"¨Ck!Ê£ÙS¹ö­F^8”[VK? ›¥Cw~m*ýNçŒÍgÙSp0©´Oþ¼ÃøÅ¡¢R¢/­;[¥eKX¤„¼ÔxeÄjK°Q‡ð; «Ê)m›yCû-zragsËãj!ì¡Õ£ìK¾žŽ»WÀS¬I™¼}ºÊ’©îq³‚»§Ò§/Õ)"$™ø][$ô=h l\Á.|̨Ø" €Q™za*âA ó[š¬œð)+ùau%špP!ù»„eðÄ9D›Ž3½Û'b×7„šÙzÇ~’¸­E# ‡t›y†¶}8j’¶í¤JsØÙ9/•AÀÞ̸6TéÞ⯋Dá¾ÊÙ;Dõ1HòBÊxIßsTU­+›Þ¯Éf«‚ÈÄNl"¥yÚüsiuÁÞŠ¯ƒÃXOÓž’X”üë–år±;u2²éÝ$ò~ƒÐò×7`´]ØxOŽº4øEˆ ÉU…¯‹·‘¸jØ»-¯ ßW­“¹9ÎrŒÓÏ Å$?Š…\•GgƉ˜ò•Ë'öÖS††Væ ]L¯°þêÂ|³)q»Mì8¡«(Ûˆ#¨;ë ";3éšÖ0‚اD'§½ßøUWIØv³Y´ŽîŒy’ÈÁ}{AkÕ…<™š;VÅìaÑç°Î;œx‰Ü‘nüøí±Zlÿƒ¤?|urëm4îXç*£õVÎáSd`Füj4>ü÷PÒŸ§OÄ_#PœSx¸ï+AøZ!°ÔÎbEn˜¯ÜŠÔù¸ƒŠ¡Q¡ |1.×… ¼)îYt¯X¼¼1‘opSôñŽL¡þ_»›æ¿® I¿9!êÆ£æ¿–€Ëâ×á6q“/&½úȯ׻Þ9þ„‘ùÂTÏK«ô”{•‘ðÅù§J ¼g§äõ…ðã—?¢Ø’gr¨·¨]q HßÄ¢bì2;جt‡êøZ)Îñ'ó;…]ÊŠvŽV¯ÌŒÁaÇö1Ë•·Éð‡ƒSrç² aÔ†á IÝ…|>Ûf0ÄP»àñq@›>˜JVO@(ÃäYór#Ïch:Œ¨ ç•€Záµï3ó–ZƒW¡C}Hã"Õøµ@}œ=¿ÊAOĦ1eÄWŒ275JŠBÎpkGð€_ï³ûÅéx3¤V Ë«e5?r—Ü;|íaM=ÞR¥ám.Ʋqæp©ãï¸Wâÿá­íö¡FÂ~z'|¬W8}‚ã$s6;ÜAŠÒˆ`#{}=J%Œœ*¶Ã¦G©©ÚÕÿRÒ¾áÆ\#Ë¢8—]¬×”at(¼ü§Úöùé"9Ð?Ññ™¹ D^“^•«ÎI̺›ãŒ' 䂸ˆ£ÿL g4Z7.ú¨puÍß­×b˜š`?Õ=I|Öð XìÞÑF±¼Ûûnm†ª¿í•¾% j륻q»˜P ŽÌ¹VüÊé%LþMàð°\³#È£â©+îÚïV¤¦1R)¹|LW‰ÌçA²® +=düñ¡P¥â‚9ÊýQ°@¹]d„˜PÙ¥è ê„9å‹9 a ø‘£ßNtƒ) ™]ÞuÒ ‚²´»ð[â” éZöÚ¯S9y2>dJ6 @"ÞÄ\¼pv˧ ™ˆ>R*}OÑça)Ïñ?¾ìù¦5o¾j À&^l ¯±ˆ]öé+ì9ÍÖwnSö·Èó=¡Z$üPÚ±Ôîþ–fâòÇ•GÅFÚv}QšŽû¾CX'ÙÒó »~áÉà MÞ ´²,îÊ"#®Ä×$Oä-ye_ÿ½4†nð!Æ–x~ÌÑ#?åGuÔä4XÊ6¼»O=TýÀâZÒê¦-xð·j*W[$ñ{&NbÞòoØœâQÝ™§ïáÿkù$¶(Îü€Q–A£ÌµêƒÖR_Ïl’0À_¾î+Tã«íím™*Îlí2‡f‹ Ü¢¥XèÙ«rSѹÝoU4q ‹`‡ (| K’+¡#•×®–wÈk‹êx­[ Æ=u 6ü«ØœYûIr±¡¹‘ÖÌ;ÝsC2?$¶ÏE é#GƒEdvL‰ ¿C{ÔB*”¿ËkÈÝüÒ€«[–em ×)…ƒ%=õg*öœúª^ÎuvÒtÍ;ç¿°ÐNú4ðcjóÕ­ñ^}0àpßÃ$cŬa1ïL×°6:1íêÛwd¥ê|·&¨Á,7ol¹h”ò^r·Ž®#o/GÛ[­Kå3>Q”ë«âz ’Ú¼uO'Ç´nÓŠ‰:‰‡ñ}™ëòËU©QlžÔ‡•l›M™exV>Eñ²¬YRŽâ„l/ÐZ­¯Ÿo–¤T6'ÏW CÃ!IÚuì¼›T´#ú©o“áJ"«w¦SÑq®ƒUÜN»^Yêáø´yåuìÐÏ|_ ‹¬æÿ,MÒC.#îôQùÇú’?–‘ÔFÃïJ쨂+ÍÐÚ¾Á”9åa¸-£34ñ¨S›ï6³‚Q¯2l.éíeô¡nìé÷.í”o‡;>ò‘ïoGÄR>u†þäù}ÎLzŠöbäÐÄNsêÇ¥Q%ùuñfh]»v«“˜F>ß”ßmD¨Ð/µ’4‡[6MñÖŠÕühuË3 f”¼ªŸ5ÚÿÖ7Á¹˜ºq•mQЇó©ÑÉ.þ´¡‹Î¯‘ “¥S½†E;äõûP­ØôB/ ÜI§^È“¿ØdOâèG5ò»l ÏÛZ %]ó¼p< Ä9ˆÉéµ28?È©&òA»° aˆº¤ _ca¿u‰äû8í@ôüMIcØÉÖ8ñ(ù<ÐîÝ 3m>êI^ÚªVS§}yn‹ÎªEk\’ rÝF‡×R¥êyOgH°4ž h䌮£Ù§ô­îãÙ¤Íyë$}õl‘Ù4X‹:–ìmsÉL»>ý<àX]e %åáû»wÏÿ­sv ¦¶öåíHoÞ݈#€‰çTSzæeÐGÎ)9à^#:üC%õ/ª:>Çl—]«ÉÉO̲QÂVžîÊP0h­]#HãvïWàÈšB•„NBÏ›9œÇËÔézúm°•¶Õã·oº\|¯æÂ*b8±Y¼âL”ü2S±ôáºý¾Ç AŸ€’“ÃLhjD±xFc§ðH>–˜/p¼U˜6±ûh¤’×–a¬Uœgqu»»"¥Ü ÑúZæ­]Ý­ëäÜòÇz“òú5¨à¤ÿqÙ f[“zr‰ÍªŽÂOY 5¢œ|±¼êöß°SfÛ¬ý ckÀÊ/°ªÕtââ’BSSÞã ¯xóÌÊCì‰É¨÷mSM¶†nò˨mQ±d- Õà²,W©8]lmœckŠ rê¸x²txo2Sv‚(2ë)•éE¹ÉïöRq8¢à®Ý`ò¦)‹/eàgä¤ "…PDÒK~Ap}K„K-Ì3rµªONé< Q".á+P)ò5éÈtŸ²ÅQ JÔ2Ó©Mö^ô¿öÌBŸ× ‘}w© jŒZ}`Hùfe³Þé¦JÅÃ+ö z vn xö¹óîŸø&Jy­ (Œ7ÔÐ i°è!Ñ8!¶­ñ)‘¢|]ßZ(ò‰í•Îò=u¯¨|÷2¥"Ö݃]Ýð)ÝÒ§×øÉªT•’V3Ta7q6wc©óYR;c˜½ì¡hz¦máãþg‹Ìn*áuà •ñsv‡äÁơۺ³M¥äͱmU?ÓÎgú.sˆ%²æÔ^dç†^Ïß&ù °‹¼ápÕŒ¿]®f)µhÄËØ£ n´H}XXÝþ Ы†êÒ÷Vs#2L©b˜–§LC<[/&eÆNûÑ\ž³¦°3Ñx·-rÔ=‡0û³ŒæÝ’öL<õ1¶qå²Xì¿Ú 78 Û@šK0Àëƒ6:Xe˜±ºq,—“G4°'^=fXVRn‡pùfýuîn©ÓõvZ£t êP+•oPRËÜj|$mGÓ{B‹=ñêi›À`ýþ©¿z.Ó¡ß,+z=F»#ÞÚ7U3Ì,ŸÙJëh,-Dc݇þ…“ñ}O1úf«“¤Ò Që}D@xëíDÒ°C¡.¶j˜æg˜-ÒŽmDñÌÎ…Ô‰ì$ª0!‹»ì1r¼&`y?¯R™=ü•Qca£[rzŽê£$Àmð¨]tØtíïè|Úë|…{  ½ŠÕ$\\ (ŒZw@©næ—:aç䌥ó`.X oµpQþ`úЇ¢ñ#òðÁ±uëwb¹ô^$3›ÁA&u®niç®7aOoGÇiîm ¶É°ÐbŠQúO9Ç:À¬û^éê¸:÷ §Š'.ÍìWNæsÝ¥X»éÅÃFO¼xšÖˆ5Ìëg„QH‰ Æ{ Q¤’ ¸—  U§(ŠE_ñï‘&jh«ZÇ£ùü«/ßBᄼÂN@õ~úÍ8Í(tÝòÚ‡HÙ’,¿¶Þýâ~JsëðÍ|Q†sµØ]uÇÖ²ÿOEY–@Øš„é&qΨ¢A,õ®¿“p.J.õ_zÖ¢ÿ¥þ7?Ñ÷Q¹…r5ƒÂò80ðG2–ÅÓwÊt×> aVuÊF4žÓM{ÅH¿ (0F:[ò\hñyË:mó¬:‡ Ú#‚WŒ©9‘ÒD%ô  Óš5ʳ#u´¦Uɵ¶½ç®Ó=u¿ù— ?÷âÑÄÅšXéSމCñ½LaŽ˜„¬‚jùþak´Ÿ)i€µ»‹@¯MeMkïoy%üQc7üëN!®Ê£"{Jè…:ãþïZ<šd4ޥЎ]±Å}^Զ׈Ùõ6·¨s–T„"ÎóÚíw,kÄfU0‚@`„ˆ%Ç/ïR÷‰Xy°À…·oñÎýÀÚ„èÏÝX‡kçk“æAàpáx‰2w¼¼°Œ=Be¢,×¾>œ1T0W×°æGÄ_ª¦4!ÙŽ 8œuH¬ÿcÔ5w[>*y3Íu'¶Ý ÝÊæOÆéuߘèऱ½ú·êUz•]C£ÈÇG[ò3„Öa£v°¡ÓÍ”°4GÁö‘†ÎGlÊXáÉ¢EB2å\°…=|úÁúÒa‰´ ¯«ZT]ª›Çdüj¨³]š?›’¼Ìe  –íBG3uQ’²3¸FÉm0£·$ˆn¡j6F¾8i]i¹Aú?Dv´Îßùg›.•)¯¹ûÈFd•üº{³  :å êEÙäËȬ¼•›­u ØÌ@sþÎ×ö¿£:9(–¥åŸˆâÖe™Së¢ÜuP}ƒ&«uìgǯ¦?È£†í¤ôÅšE£íwëéGÇ2Fï€2ÎB»¯Ìf¶°>g—“H½¦zÚÖhôޤbéÈ­äTŽ˜ªeF®Õ ¿--cåŸÄ%Ûç\\!ô"©ˆ§YX ›Ê bÎÓ<à®—a•ÝZ› F8XÔVPg¦BñÈ0{—Œ˜ÊKИÒ}F_}÷u›6éÞʲ—/y_â{@:“þþrõøÆ¯S'~«×M6¬³¯úI ž¡’©™¶THr3ä~ðvj1åg‘›ú°Ò`è} @ñ¤š­Áué·¨Vt±e€¿s­ '¯PבÿIµQY=›Žp »w öFK×À4I?ÜôNÚä5·|´nÏ5 #Üs‡Do­eHÐòô{y5·ËÂtá,ЂääO6ÀzÒ\»!ã£@lîzó݉nOW{:Ä3ð°Å¨¶ƒ•Hè›onXåÕ‡y±Šë³²þ¿J‹³o_u _2r÷‹‹›8¤ gÙuÄýÃ;}¡U}½d2šÞ~»Vbngw͆‡pì¨wà|3y´¢M‡yÐ]ÛÒÊxxú’IV†ãˆ<™B”óî©r„ÌUóo†Õ­œÄ„°wÔx4RÙi¾ëå a¸FÛ;¬ÓäeД¶Luý[ kM:± ÈÉáóAÃàF¥ðàžÏ¶Bõzê†á™©hÃãÅè™ÆºŠð 5Ää¦åDN^—ÿñãí%ÖÔg…á2=V=÷ÅPdžS¯_áÇ¡òÊH,PõÄ_zVt㙂nÌk›Zþg¢Üʙۡý+P²"»€³mçój¬ý¾&ˆ.Î! ÉŠ„ü:Í)V¿†$™Pÿ<,=ÙÇM)Û%ô%Ý šýŽÈœX3ÒsTaÐN ÛúïPf_Æ-~¦‹¢£ˆãÄC{6W·÷ûƒ30*½û(´@ÔÏTë„U]­ï0}-ô£±ˆ¸4ÈG/\¢ÙP¥EH ÌDKZ)d¹YyÛè.a^ñ‹öplÊä1扮YIÙÊ8üó÷\?‘Úì[?]ȶ6iŠxi÷A[m*¿–!­õj¹3Ž¥ýñ8²DdDÜÕ=·×>®7<]»ç¥»_¦ÄûC©Öx¯‰,h¶$‰pÄ·«á°x£LHÈþí¼w¡Øé6ËÈ£S.Ò‘.³ï=pžÚé5»››mŽ™¨ÞX×Í*ý¼ÛÍGŸ‰acÐëT2Iã¼¼x‹¸¯ÄæTê¯ò\0joâ–»ÑT÷u/¾ YåU– ûrWh©wÇfaÒ[ ˆ 8€€Èi0ßõ Ï­…Üüv>vÛ&@ÉKŽ”&x÷›oTˆ}”Ã3Þ;{¯HàÌ2µcœ©ù RϤ=ÔòëîVg»53e6ƒN$ÇS¹9©Óû©¬<={Å9 v>d$ûk ,³DBb¤9£ê9w¯@ê_®éÖ:‰‹²¥R7w›Yai%¬µÜsÄèŽ÷ÍDù$Û_F·Åv)½Ã5á±>AtòZÁ·C”ºõ«Žc^WT¯¦‹æÞŠiëu@ׯÈÅÿwdRKR‘D³”¤T|O'efR7C'ëjÉÿð >ç àÕ^xì÷逌Õtƒ)ìâĈˆ3PëM0Šò†Ë"$CÝ2Û Â€ÎÜs çB‚@Ý>$âÙ×nt¯4L”òJ!×5Äáøv_Ñ;•¦œR’9šÀ×¹AÁŸþ1×ÀŸ›wbè¨PBøL( ž?h®Ð»jÔN4☆FuŒnšO Bê‚<ºOr€@Ò ˜¬—Mf¹Ý'gT÷óŒß·^‰û·g²yH–Þ;qמÃMYÀúST^ŠÏ6Ä-›)xŽ8ÛSÝ|L¼½Õ™ñXà>ÔÃMš+¼’ÝæÏ2^\ È^Søì,´h|vg—Ý™»[Q¾ø„Fò1¹¥Íd• ÈõŸƒ ‡ R°À5ºÑÙ†­FœØådPMAw; (m ³®b͖θPAõÞc¸ÒDA6û¯ÙTܾ‚SIå–7øÄ*'cÐÉ’&@åúëIb¾]Ò­Ç[ÛZõè"õm´†PGSŠƒšIîEÈèÁ¿ëk\ȹCt¾'Ÿç;†‚ò™Ô€Õ õ”%——ª'¦±òRwÿ„'R5eï@šyΔœí¶[‹ÿ~I¯‚©½ÔzÏwe]Øjõ^Îqz»%]ùDCQ‹$ÿ 4ý—Z}l—Rç„ÊPýÊ!Ô±¤l×½”ÔméÐ#PÆAQ+§ÉPå“M+ÇNS¡½ý$t4+ pœå‚ä­ÈÞ]ù4ߺŽ:‘ÐsB!»èݦJO{±-nÁŠœRÆhØáú%&˜·½â®è»Ý«… 3Nì#o\ÿ,ó·"ö±sj!˜ †ÿ”Z58~2Ï${H=ÍÏß–´Šáº.K*a’•3ž,šï5¿ßäHÏr2_à8 ‚ìÿï93‘™4±ôŠ>#üKM{ÂNå˜çLÄ8\Ç9¤Þf k¿fž§pßSݱKDÛ1!_¾Á¸ß 4Ë›Æa_e•+}¤úÜ~Ø”Ñ Ê6éÇõæ«Û&ûu†üš“ wº¨:ð¶á³ )ÙC­ õ±d‡Šˆ¤Áá"†8ß*ºáän±ƒ­¥® ÷ÝDÔŽ4YÅó¤oCaNºò½×6þ’€˜¾‚žA»©&Ìr?Ê\~ÊËgŠ®¤z,P±,ÑKo¯t£(Óîñ¹¸?<ÖNqIŒ/ƒ”Æòzºó<¶ fט¬:ËBr†|l4ã¿w—¤ìôýÇîEºîr ¹U‹©þr¤éðæ=j#†nwX…%*$ú³I©…gƒJTù`#€ø9ÅŠiÉÑd`§¡ßßÀS¨5&pKŒ2ƒ´ß꣺µÉVCÂU°1¯íËzÅ¡ ‹Áù+¥SbB‡ª_b>›òÎ$N?0,n€¾ !ø’—}pdÜ-­„_EÚ>ü¸j¹ŽlîÕÍ/Ó€‘ÔþL+%*&¯0[ß–·eMc…½ZÐÛó*ù1íŽdÈ¥˜Õj›ŒèûcÀ»”ÙIÓú¾ÓãV§š8D|ÌIÖ™øbOŽ9jÏZ}àw|¤¸y=´ÜƒÚ¢yŠ3ÊŽêÑ:¯°ŽÄd¿TýU|˜Ñ1£%4Y ñ»YQÕãghx™4ÙÙB‹ÿ§)¨œÂr±œÁýƒ¦Öt·¢Ò«5À½¯# vCØIù8¯všêÖ™ÄVª¢È±Uéw–)” ÁŽÕÊ:åkOïIfN€{Ë8עРn#¥4Uõ8¬2ýZ ƒÖ%•o ÓзåèépÞ:2óRžÉü”0–n6Ÿ“çƒ| ‰žèîr²®ú‘-”“m㥣ž ÞÞìjŒÞ±µCXž@Yù‚ýK…9ìØAO°¬Š$»á¬î$@$#Öº'.iý^ì Æ ³ŠOÚŸªÁS‡vÚÄô*\“ÛãÜx¥1aË{̓´Q!¨ hÉ3y|e~Õ¦_ xÂ_º-µ¯пîèl5·-–• ûDRÔiÀ¸j6ôf>%Dó eMÅÀ|NâþeI÷ó…— (HÉ)Ø7b‡ê"mô£ßËñªÕjR¥ßkÄÏ4c |Ç[cÍN·äXAz°§Ÿˆã–“[D¡CÛΟ æóÞÆÉÞWÊ2[ЍXúhl<ÿÑ.ƒ&]è줆¤ Ìtõ¢Ej‡‰™ýÉ!7!y¦Y<­÷0ùÚo·Áª‹¸‰ ô~£ûèB5è&Ÿ·QýmïyÉ}Z}O†Í`…¦vøné^ºÛ ™›óǯô©Ž$¥7<0µæYè‰ðý€×àtÂQ"ûõÿ•GJÙÉ…ÕÝ™ŠüåX}b iFHn„‚Öj€Ñ ;µÈªó3;ë…»˜Æq?!¶‡– –O’Û7=’Ù|+æÓ:?ìÄôeõíÓ¼ÃçîRì•·é×îS⬠k¸:w!}'œ¯l·°b±Ó²…×îH*f‘WÎo¯]‚0Äå4ŠJŸ]\òg$Ä ¶tèRz2îðÊ»†)¯É‘ß:Ä;ñy`œÿ¹F­›¿™¬¸(+ØmÐÀ1 ¿·8ìÊ»9ö!¯ïQЮÖV3»ÎB-x~ýYA¥—šÖã)ªµ{5 hÌ‚ ª‚ Æ)áEnŒ[aƒŸÀy+²®{zÑÏ'?aøŸŒõáÆ(ïx,åõ\Oh0$ØÚ $‡íc0ÍÅOŸ°j]¦.ã¦? ÷¼ÁÆ¿ç=cwŸ”x zä)˜0DÒñv,ö­¼¯³ÊHN/Wɪy8Œ¿j˜ 54^¥pÁ>„¥ŽÏcÿ)ðð"‚CÐo8…Ÿ›·ñŒsfú­ò²Ÿå¶"]”¬èxãn×­œ ûÅj}ÀŽA<Ÿ—fé.“~tG2ãü*ØmD‹þk¡[Ô Oû’Š‹°µùËÖ)ªýQF%é?y’‹¢9õñ‰ÓÈž ®ç‘ÊDšmüüÏ÷ºö뎗HÑ©Bð½ïó °ñ¤ac“ E”׈«iºvƒõ7Õ¡ ª‰~’ïÏ_eY]qPó¹ç·¸ v½ñ.,Jóûøp$*T¸!·~³€§1©1̧§çãE<Ìô#â¼åÀš Ä ÚèøÞð2û× 2­ F¸Ù·å½ø²|*ªøÇ&Y[¨œTY–·2fõò‹¸2¡C–VVvj· ]ΨñèÔß<8m‰îãPd=ƒ’2ÿÞú¦›.1[GS±y5X’ñ=ú41›†7ÀÇfZÅ÷1×–C˳põ¹œ§8Úù¢èn»8‚Ésò?…J|èÖGû“eÈÈ;¹ä)mVËm¬ÓT—õ}0<–¡Óê$,,Æ¿Í6Rfq9œŠ¹ãC÷<-ñ À՜˿@S*fmP¬Ë=‹ CÁì-P1›ûfgf¶ZûO—á)—m¼ãc¨|n:)ݶb_xÆ—¥^x*ªb‹% &]ÎB¡8à ^ã°¸%M6IŸ²ÁváöÚÒG›üذc.jÊôy­cM7 Bw*ó%Óß5<Ê %û¡ ™íÞžÎU€; Ò y«n0¹[ÇÞ)ài}zŽßÕ{»{VegI±r‹øio%"0M–e tÓý+ ŒoKëÍ®\Š»zúÓh]2%#¸ûºï"Þ`ÝÓ‹\Á|*(«Àgˆ[\ìc#'¦ò´l0£®j¢3°E¡Cöä+â݇‰¶ðÛœ&”^ƒ~ip©,V ë4¨µQÃÈ&¹Œ=è&š[YÙyé[]]Ra}B”™LC«(áÎÍ\Ÿ''8üèk ~‘¶?&·¤‡¤Hg‡xš¶7=®Aä„öDï<^žZ5ÕC©v8›šŽ2QGl%ìKoçSY<Öb¼¢h‡K¯eÀÔpç´ïÁ†‚£S*t³ ýíQœ1€Ïj7ó”DÌð*? V/3Ö®Ëð2SN’C@,Ò:S'‹‚y¥&ìÓ– ÀŠ-ŠÎ7–<Û &ê=Û’vô…Çñ4 Ó‚})É/µÂn„H-"¥e‹ÛºHl‚*˜ õZû探¹±§³ˆ®Üa¾šzŠÅ¨-TùD#,ÍªÒø‰¯ut[x|®©Î©qN>ÃIqv@–ÂX‰± X4&‰V .^¯›çlâø,‘g‹iºG ¹ƒBø0Â^ѬæéêĺȊF£7êSà‡#0ïw¢i¤éEy“c\^_Åt§ªåœ„-SŠ™ï²á÷²S?'õŸï1~t+A}ç‡cÂþñîL’*Ó–K?M¦$P f®hVu(bôU)]Â=q„LêíªR£uʘ6ò­'îà žf¯5 RC=cm CXé9æp{–ÅŶ¥8“3©žÂñc1Vƒá,6εOR÷,3‰þ:ŽR„{4ãÁe "ò†©çäZb`ãKãÿpI ˆŒëòÐ÷û¬Ú|Ó r¥‚Y‰AúR õ÷ð ý°ô¢ÈŽ‘YèTmÂò¬^G:¯ÔÙð!Ó6ÞV3|<\:^) .~ÙþÛdt=~z‡ü =ÙíÂøÚs%ÿRþy‚XuwÓj îi¶ÌE*ÿ<Ȇâÿl½—ö==”g ,¬˜Ý .¦´(³j“´v§r‘Þ‘†è3¼Z ÄР¸ï_±ÜéÖç¸ÔšR8u‹ žW µ ºßqzÓÒ²aw»øtmÈðïÇW+xw~v „ çB¶}†hqÚ• ý&”RËµŽ®!¼ÁȤÎH+‡ªÙ{M@͹š­~G(Žä—^¨ˆ`|ú ˆùø×8Uãú’ ö  CØÝqá  ) x±ã•ÛW &1÷['hó êØÃV¨ÈÚÒõbÁ%­h7#"Ÿ4~‡Ľž@Zÿã:¦ä.¦£aÿ™´Ñ‡’Ëb¹®Äy’¢5†ŽÀœdòàΠÀ@¿#÷J%X÷÷?>Èv,*Éò¾]c>IæÑ pÛ¾¯<ÊkÁºîپе.·b”XR(ºYò —Î'¿ ÜUgº8oëô渘‚–î{­èq$d΋t™X;G,ï£cp¨¼ïó̵? ÂîØðÄÚKKÿ‡»·G+QÂþ¤eo€ˆÐs³Øx"›ãGg€¥¬æ´É4 1R-ÑéÙ—o¶‚tÀgTŽ·‚¶>ï^Ýß:«kl\Šˆç!@‚QÝ =¶WŒ_&`UœXÐŽm–LÌ·q˪.vxzg7ø^§ÎYÓYgl\°óiÒTïŽRÍF×§¡3ãhûö/Ô¦õHp h~L­á’ª^yªyêÂÅW(”?ïý¡ÄM"Íè |c¤T-5ÀÒOWÒÈUìP[ å°‰I†šòpû±/ÐF‹Usžñ=÷Åï²…CøY䄯âL`Ç]À(ƒ·ß¾Pì•SëÞ!à’—cöa"çÍ’«Â1<©ßƒ‹.û%¬º §d<ïx¶7áͰÐ?_Áý ‘°"müþ¼w•¤¡¼¦w8\4 Ñ]ãL™4ÜqÔ2i é»\ÂógßœSg¥C´v¾RŒ™Ûþ˜nªþ²*8«ð oAš®pÛjg‡Áj‚ÃHÅÁçŠÊ™,€ùàëä²…rŸôo1¿%djüxFì dáâŠõ( WÈ]át^=Œ±•ame¹£|õÝ´¯C±<¶s$é½ÿ$Ô@"Y7ÿPp5Öк^ƒ »CÎ Ùú«7XýÓQg·Ž?•£«KÁn=¢ÿå×ã bÓ¥åõ¡EÝ(FnüÌi©ü“ŸœAPæ$Q`ؘ0Ln®öz¾Lí¦±í¸CÒxRÊe©­ád°&ë~…Cç@ fPò3øÂrRãxõ,ƒk˜\Ç€tû*Z Œb)”Ø1ÿ²Ìà<ßló]™wÃ.‘Åï>IFH¿]98|âoôÊKâz=ÕI¸jHÚ ‡ â;º7… *ä Ò%EcÁ-Õø­>‡Õ‘—^–ûdˆÍù]ÈB¤ñ³uÞÀà 1¯iC„Ifgc™M‚ºá6½0™þšYÀ†—ÄOþæ‘òèD—ØG}®m˜NrO±ŒwH®Uºº³Eô_Î$&Üês=ä]Sªÿ?nßìf"á¼—zœQ%F\W žPÑÇ; òÇ…¨o”=”°N…øÛôƒØš#îÍ#àÊJgmýiÛYef‘ŸdQN/Ú.GªÜ³-Tµi£&Yôñ‚Cj²ÿ§Eë…o¨ÿozÓèŸ"á5]Ì«zñ„j­Ì›óæÁáÇÜŒ#—‚§>c¾šºßPóB {£‰Éô:£ n¼JPy<ÄC) Z”oò…àCì9Æ.(Š%1~´ZP¼©65O†(Ù¶ ôXÁ'ª™Åk¾¾Sì×þ÷­ð;eàž_µv·ÁÙ õíç`»ê!wÎ+ ¬¥„æÐOl:xO±Cíè]j÷«ß›Y(à õIÑëËî‰`é€U^Ð7G™ÛyÆ{.Î)3Bouî «Âá/ß2*HáÜX"ÐÂô¿Ø%ÖmQ#±R¼n§ñÀPˆÖeeò~8Þ“ö)ÜæÞT:dºƒ^بxs[p~ŽE¯²Á¶êÑï:€ ;‡&?K¼‚¡s°CñhÀ½6øI›ö-”8™ŸÅàÓüÂú…0˱]ŸXÆ>IŽfM¨VOzµ!_”‡RVéqüþí¸fº«;¹‹`Š›INº|@B€“}ÜšÙG˜ÿ|ændVp,–ØÏÉNõ ö¶1ô-ž<Ù¢j<ò*(ïÞ$ÕÞ’„ =ò„†c}£%;ç?î†ã‘è!veÔ%kû{<(O$3% ¹iâJ§?,i75³?{/~æ&üÁ›³?“&¦9é²ì€·~ýGKïR¬Ã¯øûi #û!Ä·/å›/´©Q½9®5<¿ÂªL›';И% ªÈQÀ¥Q¯<‚ì O½«Êç\S»í¿nÁÐ8g}sÛ®-¨¦Jÿ~b/‘ N ôi·cÊÀO5º±Žä>BÃ\C­ƒ†‹…•²ìšÐãæš)‚{$ô’àÔOªÜÆ8×èåäx üÆœ;ÜÈŽG¥¯ 7å ,™ö̾r„s Œ‡=ü ‚_Jƒ|.ÅÇ Ô&˜Õ ´ÆÏð¿{ LâÅmž#ù/ZiRµ€ÎT†Äí¶•« ®@$›’°ò †ïó„±cÊš¦üSNiMëhÅ >ÝÎI}[ô_0LVLeLÿ>¯N\4.µi€ÁözTÔ%l[‚²ómÕØ¼ g—ÝﯹÀ"›V+Èe6«‘T p"š9Ucl´ïÈeë,ÿÓ:öŒ›­øAÏÞº?!r˜Z+/xt²@ÇrªÇQœwÎw ø[Øï=‹ù_½¨þ…v•ÿôtу¬‹|–j–¡/.¡yÀ,¤f´óñ„.ÛFõ­álîì¯×EŠáŽÌÂÕàYél]__f¦Kóh a§¸óenÝ6€|çh‰å;Îg¤ª #sù—¬“ö¬­kœeè09v Ëm_ãúº@¤ÛÐ2`Á/ 仵UI 6ïZæ/9³\T¿–ØïZÍUÖ}é„ik _û¼‡Î¼Tx˜¿é ç,ñÐ%sßàE­¿9„–¼Â,#éò4¯<qa›J‡ØÔ+Qš¢L½;:)ÔžÊ2µ6N¬ k나ro´c4é†=/å#¥p„ƒRÍ‘j«0ØÑÉ‘$Âd*L‰gÄ| ›4-[ÈÝ>™C_õu†Õ 1Æ­š îXX”TmGQ3è†G:¤ø¬ØÍuEHûDœ°ÚeLPàìc¤=ý­¯dô#5˜oåK9ÑdD6 ïcDOÃןK:+ËhÊ ROvlœ“»ŒUÙZ¥[þ+3Ô`{Ôv¤r¿,c+Q“ߙΚ² ,»)ÀOE«®„[$30n÷¦Vw.¦À†‰‹²Z".êùz+Ä¿ÿU:SDºiœvBÉ)½ÈV(/"J§aQTSKÅׯ%"Zuw8öu—uò=ߨi([€ò—u$ اé@7¼ó- ¯{‰ÁÀa^€0òçúQ1à?OòU8qçýÞYØ(DOÖÙä'å¨BPK•]„Wc³’hìÇÄàÉä#?vnøEŒÔП¦’ú¾ä4e÷˜ï"Ý:®1îØ‡Pûº8Î5 ÑoQ§½³ƒ¢¾} ƒv»çW£‚ÎÅ÷ÑèffýŽ ÜÐæ¨Õ”`‰‹ ã ÁŠbÚ'AßVµ»VìæRIÊN¬ÙFCÐj\ËX$!¶lƒ¦©=¡67YxØ«‹T®èikzáÏÜÄ¿BBsœGIÝÈÔÀ:ÍËõ„äó4‰_àå*èâ ߸½SÁÓBÔÄ !ì$4Þñæ£gX§â2pÜ`äJ¡àr‡u¬)…«¤ïNÙZ1,½iS{ä±*ÞOêk%iIC2ÛLš×Ô@…–ÌŸ™Ùõy(“ín‹ÁV,çÒhmü"kôBÉÌ[°^™)²GýjíIóÛó}=bW± äÛ}-?üÂßÌŠ~©Gùï®c€<átI¹Ë ¸±…\¥ÑM^OLÀòTM~}㵎Í´\;Õ¬cɉ¡¯G‘³HÆÉÂsD·«ÖO 6†ØåNÅìâqþ¤9¨ Šr=ˆ$ÓõaC  ú=ÎU䙤¢XþDóÇ*²yÅuXß“!-XüTBëÑ›(Äþ¹$€ž©$ ‚šZÉnPJÇ$h%JNõˆœ„Ï*ÿ߇d ÷(kº­cn‡«K°è÷gk^žÅ©]†æk½¬h§­L¬¾Å¹ƒ¤H:F›Eàò¢Omè÷%HPÁŠi=»W2;“Ó1(†ïH BÀð(*JYå}¤&Ëp]§Ää¼÷«¸ˆâq#ÐmÌè Þl•¸_ó¤8e ©šÃ°“øðmüøôq%ÌÇÊ{õêH⇟<„_X•y|i‹ìiÌê¹8Ü»˜èeï,{ZÁ}Ó}-ëJNÉ´¦ÓÞŠñä½öé¶ðGçvC}'í™GÉv¢)K†7f¢A@¦cR?"1ud+4[0¹©ß+ˆ«}å çn¸/¿ cå~`á‹‚38{h/'ý4ݵ ŠÙÜ¢™µÉÔ×ò‰mfQ0ÝÀÖ¿†v½60Ñ¢'v_ºå…s;éÕ§ ¬ü°œ›/ǹ>ÛÜ/iº1Ïw˜üÛ éµ—Ç)ñ‡çŠ:ïV+R „†Š2V—òe‰Â³ß  Fƒw(!ƒüUEn °?2~máOß«¼}ö–ÙŠÑòÑÐjô*ÕI¨óR|?Û³yÓ­9µ¦tC¨‰F=Œ>PQ:uTU}É”ŒU9hY’ÂÖö/_Ê‚µGêÑ@q‡åy»y£"½Ë÷ˆÔÓE,T {޽øn™,™/ :‹,sŸœ¨ãä™–¦Kÿ‡‰=.³¿Î±Ee^ô[‡(·ü]À‘a@½ûD×Í£‚°B[PŠÜE?çG^Ê6À¿»³c×¥¯öümUx1@3 Œ&Â-erv嫎t?õËo΃_ô ;˜1ÙU‡2wéÝqHÒõ 8+…·ÕB÷>›Ó ®ü#{r s…#-]¾ÛúÒq ‰Î~éW0ipÃW|2˜G3WK¿F«' ͉¬˜^4ZuTlfíšËø ¹qeeú=ôÛ‚÷nX/SüÂ´ì€ ïŽíìag[]?84VѲáÙ{ã½JçÞšj  ‰Þ­+ºëy¾æUW íÕû9 ú´;x Þ¹‚z²aÛ¡­M<…X¨§áÕŸbµÓ…J >ˆ¶²ÓܸVO k·Å¹t/³ÕÿåËvŠÑúޤ-Y¯©O²ø`AÜH¬Þ)±Ú¿|œp¬5–Hè,×8*áL%$$i[òR.¾#Ï:V.ó»`Z³†Vó˜ Š÷ºÊ:/©%¶l€©k}öR{B¹§;”(O¥ŠŒn ¡÷MœYŽ|à¹DÄÍ–q¦$ÿ ­lÆÜH¿šßä$!êÉý_qŒXJ•¨Wñ ç¨Eí»¿ 6C9u’¿É ï-ó=GÁÕr_ -ì?’EÀŒ'  0.l™z=f}²[]þ˜LËEwnv‰"Úø’û2zê)WM¤P¤ÍòlνÉmh+â·KÌèÝϨ¥ÄPÒ*Óg,jïB°èóÈ_öÀ¬MÛZ·O˳Œ;PØÑe¸Ìöl‹@Iã@H@•¥«þ§È=7Öž&¼Ñ/¡ˆIæïkº÷‰ñ,_Š7IÙÚp9#†sÖÑŽöù·Ë@WýiÁaн1ÈšøÁÜ]?ŠÀs˜­ºèØü騾˜“ è·F§z1ùLÉ_¬>?C¯¸?í\sFG·ë_¡TΪî-อ!_Â8U=¾Ó)–¾å$/°ä=­©¡á‘Ìa‘@ýy|XiaB/¡Ôõ\ÂR^º)ª‡È¢„~i‚þ½'‡­GMrLšâ¶¶áS „ë?-Ò|+ÝúÅIŽï*/l[`×°wîð¶Ê²ceàW™gÄ”¥+èêÐõÈ4à¨JÓÛ¢NSÊ«Êí¹W牲•HÞ«tˆœÇÆqq«¥¯ôø…|M¥CŸ¯Ëõö.–Pž0šM?‘å¶?Ý#ÖøâzE&¹¹ßÏ2–äÊO µõtñB¿L©[¼ƒ@¼—DÅEy!v5M`ð ly¤5EÆ€”ä*[¢¶ƒQ$~°”î†.C$:àåÏy8¶ÈM5eјҒHÞw Å'|…Ó¨ìâ·‹9+­–ÙH¨¸sÆqðŠÚÍnº e&|k–½ñÓÀºëØ6·U^ܾ»ŒsSj|ãkU ®êpN îîOI8ôÇp/-­áЮ`]/ÿF„Mï–2¤SU£[£ª¨äXíÏ#µ)c}2@Ñíb•)p ú}—œÌ„œÜ›4CWÄñ*cS¡)³7ËÐêu$»¸æ‰¤Ë|õShÙNQ,ìZɰþ?þû‹ÆlkNQ©‹yŠñð7)Êçš W$ÏEÎj [º=èqOpÏsu(`³åWUŒ¸†’Š‘בã%éL6.¬n”)0c’Aå²]ÝÒ¦‹+ûg[auØ0‰—:GÁYm¿Åêü<0SÓqÚì%£÷92î}HÈbÈù“¿åA˜òG+µ7 ®š\«àm¥Ô;H7ð¡òáÍÿ¿ÿ3ÛŽk¸Ùj#FÀð†¸½ù#ôuÍIFprÐVûeZª° dú&^ ­ñ‘Ímãð¹›87 uÿ°_òH¡·,o48Ÿ"üãdWÇÑéÏóßW¦?Ñ|‡¤o/Љ[ ßÊžP“5i?^ªÚz`M 9ÕK¼ZDgðV.pÓ’BàíH:,¢ƒ¿vvX«n>/ŠqY}nqö»GëÍÅb@Ê…/:´‚+ô"Îþ³XÖ¿r¡”úÈkïR¾ ŒÛœÖWÿ¿ì–yº{mc‘¨sjûvw ö­|àþQÅRWtKyÚõ3†ßç'Æs)Ýfx¥@z,l¯B÷õUù/A›ÿƒ’[o ¤„ÞÒT %Y«cOéØcêóÑ(À¿ؘ}茉¹›FW2µ +Önd4Ù®Rƒ¶'dÔ@†[W Ñ×ÃM5˜¸ïIŠb¤vT{ O^}Q¿THõ¯ËØ×”˜â&±öü g½Yv@‰ Þ¾ÕHÊHéhL¶¥¿0`ºþ5RÕFнççp1çvÄŸÑ[^•o„ü\øæ—çè_\6bŸ¹µ}ŠD—[zƒGï»è'lýîLo5^ïðÏ2ìù½ ˜TÓ'ÇkNS™Þ"öKlhÎqûÞ˜01ªS"p¿ß…”Æò<±(Å£ïÄZ“Ë–UF½ÎC?nFç!Íùœ,‰0 ùNÁ! SJÃ:…rÍ-×ýˆË%‹Æ£Dûê§âÊ\hµ®ýB =)$:ïY\35_YŸíQùsc¾C½ï…T]íB4 bq‘4›oY³p|ì¢×3>í-lš°Þ\,±4žµhR$‚ë°ðEoþ¼¹1M|ÂÛñöæ•öã;8»pe´Òõd‹ïý–ÇåQ.:‹[ÿ0d¦$ujp9w¾‡×{¨pÞSD¸ üµ Ûw7|wx&Ü5—XadB­JRk™ ó3Tô„¶­þÁqJÌüPsðÊaO§ÅïÊå/S] \Ôæî+Q ‘v¬á[dAÆÜ®¼P]€“Û¦ÜZÇŒxZ+ŸªœðïÇüœC¶ø ™”ÅúYß2|) JˆÞ–TœÞ~\Ú:¤ïøJ‰á›Ïh\ÑÕ·š û²9‹K¾2 ?nâêOÍQ—DKÿœšÐõJÖüuX5,ý›úˆÊÇÔæ|á­9ÃWœZ Çã!pæŠð $Ô”ÒîÇëMÃHΠFæGééy˜žÚà9Ÿ¬î€tï5)+à œU‚|•¨ËÅsd}ÄóÚ<͆aAàâÀ\Tœ i] ×ë‚~…t,Ù$N†L}&ÈçGyZ1¸3W¶8¶µWúù¢@@m' èoÄCq¹Æžª¬è Íî"8Œ¯0„xŒß»íP—(›â R‘Ÿq|#Æ8Š©ü8›ø·g-g§Öo]êè÷ê8ò'©«‡¼A뷤ϣ„"¦D^ïvx:rÀŠSÔnPßÐäLHœÞ¯Vô‹¤ d›Ñ ÆÓ«&ÂÅÖÒß|Õ†ËCLMÖ•ðøå—Õã%= êêÊLûU†áe5œjèË.ußV“q®›s*r3]c~k¬êiV†¨Çh™|„'!F8;ÅSÈôLJ›X§QÄTIß œ‡D\ ôx« +·É6§^ùð­žÉòè¼âŒÓµÿÁ«~FÕ{m£jÊOöýy9”-³"f=Õ5N•̰TÎ)éðû~+Ђ¨‘¡,U J¿²Íû„ýôhé5šj<žÝǯ›é- .‘eì_¾˜\<„AŠÁà$/—¡gž¦ŒŒÄ-¸×ÓèöÀÒR,Ñ™b&ÿŒ•m? 7õh¦sŠB#²¦Ø|Z[¾uî 纵µi—üG÷žLê;G“Àp:õ>Ð*œÌÚèè`Ç¢ÛH]Oh¢‘K®||aKPÔåW¯ ’ y0•Êsšò/ýüU ‰öªŠF¬W4‘<”¼ä|Õ U¦ñfi¶À0åçRD[œÑèö>µýyÒ'ŸéFšEöW`(n–‡>"Ó‹¯Ø)——HóÉﺋ+­Ú tôÔëöÊÌ‹Ô!îš"û)bMºC%$ñTt‡ÌznUŸâ¤C”é,¿GDëŒ`ïin‘=/×Óe€°ÁÀÁ¶yU4Jd«*ܪ|‘#þ¶\+¸§JXYx"@B‘…Ë£–]é|Ì#x·Ý½7Ó–#æ uÊ(ÄÕ ¢?[Øô =À×ûÆ‘xõÍÀMGåv­~OG‘JÑ!†"CVÔ´Ie3NWAs= EÖA·(§Æ]_s?Q'ž¨ºö£ “œ$E×Ô_G3åù`  VY•Ú§ŒuW’~AB¡Ó_ì•§‡?gŠDþ“{l'¨|è—=ÜÁû¸‚H…ÕF=p¢©ÿ‰ô3l.vùÙ?å¾M·bI$Bä9bÃß*À‹ÊJ¥î:ú’˜Ô™Å½´Ï£__HhÍ·G²?Ü~–ök¯¯YmM»l`Áõìj£}÷[êiÚngX€|?ºçûÿÚ|¦ 6#?£èºN÷/ +ãîQk|ÌO SB®€m¶(´J<ˆ»GP‚WF_Ú' ›×oÖW.¨"äÞëp*¡£î q,×5y¨‘†xÈž(òºLÉUísH «¦_”ÿ’ƒù$:µ'xeg¹Ü°3s§®¹>'v„ôÊ6ð®úÝ«„biW–EófðÒ‰-ªÀ'w­(ók«ŽŒÍÃìNV`•ÇÌe#v‰f9+°cí ‰¢&‚¥Zvä'þ %1ò8z—²ö=ܽ&é¸ÒI××!3ˆSY#ÛÉhhµúh~±`$êžmÜ€±Sy€hŽTå¶[Î8>¶Q\\2gªñ¥èvâî`è—ä¿ço·¾/ožOPu5lDÙ ‚D Fý±ÿØŸŽ(iø5™Bf"É—©ƒõ5("A¦±롈hCƒWìMFZÜ"9EB~Û‹¿Ïº‘ÞW:î¤{7/Zó–ƒg¼Ï}«ËL”Õð³zYÌ”_˜€¶‘È{ª–âXÄ·ö¦¤jYM'›á_É&Cm+&}ÝpÓ™øÎnXGñpÛõ–EäÆÎÑAô*Ä90 lQYz!¥`âÙ¢ì‡æ%<‹SµÂ%D Œ”:Ù‘Ž™4ÆP·eQ·IÊ•ò ñP¢# ÅiegcBTÑÛšcúuÁ¯ÅRåqgüôNìðñ$©Ïã>2ÂkX–„$@lÐv£®Î›E˜YâP›ãØ3 t I0ïõ8\ì{­1‘™TL1û;Ý ²œS©ÐåÜÜ¿é’Õ&Ó \­?¿Höï ïcŒ_Ø9\¦53⬛T³v­úÏ}ÙÙÙs“‡†¨Õà{eð¬Dø® ÃT¦¼¤)E.Âgø¼;k]Áq„Y¢ýÅš;µ­Ød?§Ò·UýNöC»€~¾'Dÿè$Ýñ‘r &VÛ† øIë4E;'B:À Ê‹¼¾ø¾Ém‚âH|E.¬ÖTŠ9÷$=r¾%+ÅÍ¿¿;ÈaØy¶Õé©cÃÿúBÖ \öøªgQýÌßÍñŸ¡˜´e»š=šàcpZe“önGB„aºš«ÑE[V§ V Î}OåQ”±¿Q;‰„n¼yarƒX˜6r æÖ@Û1G;=Úîæ"Ú²²²hëVqÙiM…¯ P/€c¢Ú)J^½@X\6%s1¿=$^i†ýäÐîè!±-<Û_?œÖf¬cbù‚4ØìûœÊ-îÉ¿À¯¢H›áoÆzüã.ì}÷}”™H`µ—ÅÀ;èe¡–ÏÖ\K‹ã¦áê–‹ýÄÞ;“‚ú.U¸×Iƺֺ—I¼œgàš¯²žÓWüq>|ßx»­ãΪÞÚܤÏíùXY+:âÅxYôeÁé ¤Ã¥œ ~ùìõ@4з|^–%ÇnAD•¸Ùrý‚óÔ©Š½­²|ÀaÉðî˜'ç0…kkmù`8£z 0¸@Fš"»?4£Vy?`uÔ·ß ßæÑë¦5ƒ4}”Á@è7äÆðkò4X"îÜÍËü\‘®c¶¬jǦºÁÅUíÞ=§-æ­K"æÎãÔqÓ!AIåãÄìªÜU­1{idSeÐC í÷ Èj>ÚÜÕYL$%‰`L>®º ”í«Uö)š¬X-ïî@\@ÙSNÄ ×ìJôÈÌÂÒÞkøŠ|[gl »ä˜7è´Ž’lÖS¢j‘vR\âUÕË5è÷÷°ÅE \‚~Ëç¢$âë×Ëz2ÆØì3m¹{£“rf‘©Xš3ÒÀø„þmå•FîY¡?dVgñÁK…ý/~tó;6TgÕꬸʼXKÛ~¾oÉVgá# Ñ6†rºäZAnƒp½ÝJ»DÎ¬Ý üôÔüM[LÌfs9 ŒìÈ2´@ú<°)Ö‚Mó,ÏÕ¿UkÁ¤HÌ.›ûeúÕ2˜IgX Œi)û™¼a¿+`IÐS |çì[^½ù«*«×zÆu&âÿÈãFº*Èõ¿/D9Ì-\ZEßò è‘è~âtïÎ%ÐA^j ÎÁßëôTÑílÞrµµÅ6ö_)ÚÔ,U) cÀ£­¨‰TXi gû‚ ;\h»¨ˆü ø1´©û(OO¦o’%b•,jt¥£ €œk|²1á\Z¸6X<Úõ7–mœ;|t ÇH#üÛ€’íóÇJ ™N}Ô£œcTÇA—à§M¥å‡Ž‹ˆ¤‘à+êÎZ·V¬y¥pgÃã$[ÖíÝæŽLYªÇ <ñhûМ†PJäþ¡'¾ª“Çu¹ EÝ>¹ðÑQ꟟ë*µÅ:[4îRLŽŒP;æJ$Ä5àF¶eÖÆ–ž8šž¾*ý˜æ6eD°…C¿»rHMI»¤{ %óÌøK ʾÛ/KÎ_þèÖD–`le}å…ô‚5Þ_¿è*}8…GÓ¨ZsôòðƒÀpÅÑиá þ.¯‹\/,Ž¡Yÿù[»F ³ú“þ¦ÿ¾p®†YZÁyÉ\'úïU¾¿rpx.É@ÅÈ6´Ò‹%œ^.iü"$öÚûÌ'Y3škÿCÛäÈ{5;a¦E¦>åiSmKjÜÍ¿–9GáŽÀåüÒÊ\Û-á?oœ~ï­Ìöu`-¹¿éÜ+jx¼Pˆ‘Ün Û”Ò~0Ïïó`ª—$³#®ÿ ôôš˜Âèž@)8½¦dú´Û¿*‡\D¯Îð!º5JôÛƒsüe¸™÷™Á4[üœXsüšzqà T.Ÿ‰˜ZKœcÝ’AáA­g™^Aðºêõ^Ê:ŠZ~ PÃ’” °n3JrûŒ<‘ý 2·„½.ôïN+{ }¤¡]EÆÛ.R*9©®­˜bÿÉÔ/ÖÊW´ë]—Þ1lÓØ,¯¯}!Ë#ae¿Žõ¬>ak«i/S\OáähöT_±¡Žu[ðÚPi]9Eì(îÅü´,`‚Y¾S!_´4HCõ[«"C V#læê‹ç§Ðw¹¸CtÙÅË:pBd„ ìâG9á~ˆÊÒW×7à ûžKg6…(ý÷]HQð¦ Jû3ÿ‰1¨þÙ3„i èÝĪáïáqü*¶Àz' ðÀÌ6Œ‹]ÃÍ Ó`Vxºt®×Öÿ|í[ëJ £+qлvÚìò£ò™Óºt‹gZ¸ã.ÍÛ?7B. Ÿ&&Õ~ÆW䰼܉(†r¬Â­m°HÐU”n˰àÐSÍïHê ]Õ–¸šŽ¦T“‰ÕÈ ZáýšŒüâ~«N~´%õÂ)ÜÏEö„NŒÒ±w9="ëCÜäN\ÙµÃ/¸i¡'é`6mŒ£’äû#e!Ý òMûò“ZÍ ¿î“Z)¿1{&Ì}uÅ;á ¸ ¡Pj&Æ-ãT\ÕYb"Ó˜¼†¶†¹ÞR³8ÈÎÒçµ÷f-²9šãÌtzlàªæžvÊ=[)~b#U dÓûÓ¦‰4.ÀÎÇ:²D3zËØÓùTï x¸¤i}¾ª¶œæ…`àÐ;à|,6`ÊìQBäûÝ+\í¬)¹* —"¥X¤œ`G^Ô‚^ÖîãæUG¦7QèT†ôH|£4§¦Ù‚¨!ÔÜê1fÿ@©(»9oúpVMÇ‹tr=} ‘Cä)б@r‘A_ùAáXH,þáêéÚeíaÕý˜mðÓK.a¨¦|^€ŒtäѺ¦ìpKk©Ni¬+”úQOç•/š|åÆ2n^3â?Vï’²] #Kp¯\x„;+›B±Û™84›íÙˆÊ&(_Ø/XQ•§î¼²é| ÷)ÖWƒz*›G[Ù¼á +P£žB‰ohìÆa#_h¹Œù}ªn¶ª£RÔ…ô cýÐÙ… ë·Sã±Âî ôêÄþûu}`mFH³xsŽ”kÞä@||+‘(B€@˜ ѧk‚-îJK %¾j³8í·¯ÞÂ%ª^¦Mž$Ö.Iúõ”ÞÔÏò[N`‡}ýÌVœo•µ§œL$œê“ÚöÊœŽã 8Mòn)?¸í/©Ä´·Î{ÄG­]+‹öãY šÝ¶ ÏØ¦b#U¦©éoɲúuEȶ‰ÀËvlWbÉ•@E ¸†ùκ}ëB0ÜÛñ2¶zz¼ˆµ…sœFMÜF ãÀBÁ’Å®„'ì̱ªè¨qŠ¥ˆ‡¬˜Èü·¾èÊ©s8‹ßë·ü‡ýRçÍÓÕ>àŸW”"–f‰Ü—¯ <éJï„e@rC/g=£ºõ¹?–¯_@+pÅÑ0(ÔmvN’B2Û°GŸÝ.uú$ë2²‘óå´6Óù44õ›ÉØý÷æ©áà«\’ã›3ÞGóAú®ü“WÅÈÆöx’êz#&ˆ©x3D/j×+ 5°>àå¹{Ì„n=Tò0õ þ¾mëT¸©àKwuùoÈDŽGɾÏBœlœêIˆCÄÉо“ù+é7~yÆx"ª™¿ÏJù7‡$/vÑ'áöÃ’×ù3ÿdö…Zá˜Ø$ì®—Ž#dèìkÃ9‹‹âÁe® e s'±^÷a+çÛÙyåK2ĸå\7o:÷ïG&m»b…? ‚Eæ¿…Ó*Ш@›ÉrBæýe”v½|OœKfko|iÜÒ`HîOm7®IrnuþB…$²¼| ÷˜Õp·øèé3*[_jØh¯¦.’ŸR‡Ù.†Ð²%8³áÛtP{¶ÌgVKèÐøƒpÀ›Úwû%btLË ”ó¶Ž«jdó¼P ­:mgTÆ<œFÿ†Q¦IL@±ÛL^‡djw³d‹—¢°’$Ùm_umý(\Ù·½YÉÅš·c„G„;2¸µlç'£ªæ ¹ÌÐâ.ì ù€–®,DÁcÓÞe韚„0°‹}|­fTôûG¯=qø¿¼:ˆP¨‰ít5í´Ð÷ #2aóóüŸÐ°' °4 ^ÇÚw¾µ ï[‡j¢'+EŸo`¥N¦&Þ©>¼ Ó¿mØíû¨ ËxêU9ýQƒ¼TÔ(?n?δæÒÒÁÄ“®`™‚cäEô6µœ…ɉ$á\mPŸÝkª¨àºØÜßµwÀb43÷ΘéŸÞh‰¥èqÐŽT¶äŒsZ0.¥_m.Î)¬ÁD[%=wŒ1!(sÙ=Ž€gR[Éw ݗߺ8¼lž{ˆ½I4f;°Ò_)–Xæxc"O0‡˜,k=ôîäç½YŽYôåg°¿µ$ â¢T¬·œ^”Þg'<¢×¬ãw8YžÑ¶V÷Óï1ë᥈ÙuÔüiøfOÏ!ð–öR”ót]¿GåŽù™Èý`44(GrêZÁû`Z[*߯œJ³pÀ:)·M³Nã!aâbLÉc¤oˆN€Cª–›t0 \†û´„ô|E ›š#«‘˜Ð™N¥ðÕ2øk¹½¾ã€hֆȹOb² êIOb[\b0\“އrk\AuN?n$u¹z|t?Ý÷Vé¯÷~‚íåéÄé§4èT‡ÑßA1\, m¤ƒÌÓ™ÉÓl@Nž‹ëÓrÛ ¦ñ6ØÀªÒ 3»;Ï ˜¨¦f oß’ñy¹ £R2—JéÙ˺ÁñPߪ'$pn 9N@“ä¢ëóí³&þ,(<”Fèø}µ"ŒÒ›>žžRPÝÍôºÿ¢Æ¤éoßåzÍðÚ.>_ìnPĦq»7¶(|Iƒqºüü¬eÈ”ElÝ„'³¨Ùù-^â|Û]MKj6 }ØMRö?ΙâÏ€#ñDó8ÓS3²!¥CgBî $06çÉG@…6˨ÖQèMyŠ ™XŒã‘( ¬ç›>ªM=níÇb=ièäk1–sèÖë^ï×â{«ÄO=•¯Ušü+p ùÄ=ã>¿,õ¹fûÆê ‰–t\ËÀ³_D ™|çìøSçfñdÛÀîm¤›£qrG:µ›m¦~ߦC4ãéhë" ë„÷ÛåÜ\¢g~ÂŽP +"ì‰Huºp×Ãðÿâù‚ÜìuT þ„PQÏÛÆ-ý¨'›kYûxÚR¾¯×aÃK’¬AÃ:c½ñXÂùž¢þ÷ÐX«ÂØ]_1ÁzN:txT a&¶M}ÿ‡m™’&A‹(K—3«GÔ¿×ó®ê¥§ßdòÉ-×òÔ5þ¨¾°@rôª!J-eÕP¥m"õ!^´Ÿ÷é´ç|XXŠÙ¢Ó`MìšÛâúä>ÞíŸÌv]|ÒÌ I-Ãl²«—ZÍÛ^dÑ(#äÊïÿG¸Ž8õŠ u÷8œ-íò:¿ZN´f‡$̨QbL‚‚R»\’¨ÖÔÞ£¾)c_u2¬=D›¯lBW¼‰”Ê‹8HN¯Þ-¿9*¶SL¡Ç؃ZöœN«$„P‹}6î›U†^Z<°A…ÒJycØ€î12äÌú¥ƒj30“¨W ŠÔRfS\ ]鑳ïg®ŒÝj:Ð¥ÞVÍNš ºÂ1eVÑÎPZ52iœº²Qñ¢DØ(“Þ=—EÍŠö‰Áa–%2/Nÿ²r¢ jûF|¬ ^ßÍ’[˜Ì+pü×n€80³¢دñ‡Œk¾Ùú¿úýÓÿ¦t•¢…˜RnëW†;ÚEÌk&i‚ùKÕ¯ÚöuÜàNOž^‡O;ê•2êdPöͶ^.é0%<Æq’‘ý«tSy)û¬í—xîÅð5²®U'ÿÄ 7PmA[%ë%uSI$DݡȚBJ¿^èÚ·!Ö§j¸+‚êóVAàvÛköC,i]`·).±1tݪJsÆI•eã߯àÍçþç³óó8pd™‡ÁdÚ"ý½Fæ õÑ:ÞÒPü¸j<6Á&³Õ9SÕÑPˆÈ â§ÛÔ° ¬÷P²|“àðFÒŒHb¾[ÛI^w_Ôör¦²» …ÿÍD²U˜@«6.±L†æöðr¡šõêå’Ê)éeŠˆNŒôŸÍ“A?â½Ò™·AÔ/˜Ëz¢Q_*ÄÎÞœ¬Ó0å?]]3ó%CÄ䟖w¬ÙìüÙŒ õòÚ-’·:èÄ{!•vµE]Þý9 ÝøåF®ø·- 0=uZdËŠ¡E™|^°CLëø2éš<’Í@¬?|)q“§³Jø¤V_ýàΜ* ëÄ®~0Žàp1 #Àw­|"‘)û¤eZB-k[¨Dñ_†:  z–p°Hn÷Ñ~ÜaÝ4åºJ)©4Pjš[›`çO!†ô<‰è¸½˜™Øæ, ÎÎ¥LE…ôÿ—å7éÐߢl†ŽsÛ"¶xÝ·¸PÐ!Áܯ0°2 v;Ð#Þi:(OùÌpA¾à¨<•º>ª¢“ô´êqdï¬ÊТŒõßÿ©ò‡¤PØfc˜mUæ4áÛÂê² !†ŒTÎê*H´D§U2ù Rº¬™§‘Ó†î1ìü9`ùô}×ðBé} DßÉõý¤ç&R‰á3 QF6h¶¥±_=ë’øRîiDç4èó!©Iô^ïqæÛîVí»©¥‚õ{ùT¾|ˆ $)ö ÝÔ4%]B ÌÑ8:ØßpˆK:s²câeÌÒÒ*K%„D#…Á«\?{GFØ-û7É€–:¬y6EJÛ6]ÛŠUs*ྔ©˜nÌùêbé¸a:~㕇“pg~:€ÿóe.—G÷íš©f¥Ÿr¦\g”{7 4± tˆs•ËÐÃà3WSÿÒVGÂÌ«ÎDm3…²jŽkŒÖ6ef¦ÕÚ¹­á¼8–¥´Ëf®%O¥Œêl|®²˜. .y™˜¾!„ïr|òÑ@{÷¤ %º ±8Ú–øÚ••٢ǞÿÒ«x(ßo+;>h.᜸,m£dïCtN‹v­³Gœža¸e}Z2³k ѹòç3/´²ÔêÔ! ÐzLÈÿp}ÑDÆ]ûȇj­Yînˆõ—>ÁSÙÈ×ç9ê`vFn|Ó¢æøŸî¦r$½„âtÂAsùedF¾>õžSä€D«Sa·î¨1RxÓtt8ш(ö¶8Ú°éÑíê#Œn&Ì ÌªÏƒº€e¹B‰‹°éÊ^_Á“ó,>DSHq܇ ‰ ±Ø!9eµdJi'=0 o%Þ(ríìØû¦ÝÌ^¦ÿÙ½f1]')~΋ÈìåéŠ7b.72ŸkÅÝÐyn¿4ƒR˜‡`yY¸1¦¿nøI <æ]Y†5Ø©;ÝtCÐÏPú-ÚDä§°Ú˜™•ÂOÒåvmÿ¼°1¿7?[!G¸—ö›ñ,k&ퟠ6ßo›Ü^ýNxbA„ô÷6i{ƸqÖ~Ñ>ssÃ¥²÷¥T hûŸ©{ì8Æ“Îç!(D7 iV`iKL =öãJyË73²Sô}¦Nü0«Á_K“zø-‡uÇ1cϵ˅ÅkxÛ;BQFÅ:`ý¡y‚æÞÛÄ^CÕü¸‚(«˜wøŠ˜•ˆé –{´5ºíÀŠš÷ÏËê‡]¸|‰ ‹I—%K´[™~¿:uç‘£Ýd•$FÁ{A ypw·ÑH‡ê ï=F¾;=EÉ?~ ò­‰½²æM¯Âöûûé?ÅAžˆÀÅIœ‡ß£Ç¿Ú¦_#‡-B”ƒŠÄÆg'×X~9ïjhãí³|]äñ ÈJ.ºK´'Bãòj=iv×®!Ï¡¬ -Gâ€âP;Á‡úN'€C¢±>ª|ÁRt6Suò´¹€ÿí Æë,=È¥„+J¸FŒ%ÉPÞ*Ír'·ÈzÃP'ãë<ü€©~`#XH‚/G‚œpþªÞ†¢‰À%ÑC$ªkÖnª9§ýhs¦º·f,…w,ß=$ZßnF¿=Ö麙 ©@êô±ˆî”µö©mL,»sDcÀÿa“a³~$ü>ßIAˆ"›º{xŸ_´òÇ}Cƒ¥ä¶¥‡Œ,È<š*V«dL У×ÔÔ,Óµe.H½wv=®^th†p=}gZØì'$‹l:0×Þ2¤OÀ,XQQŠ O'ÎuŽþ…‘þè ­w1¥ ªHÄÒE˜u±²ŸmZ|æ—å‡D‡Jh{  Aï\$‡~ÞDЬŠ¿3Š‚²P›«I' °dîX†óÓOZiæÀd#厉ƒñ¯2˜Ý~ &Ç÷BVÆm¢ÂÆþh‡íã“‚:×sWÍš qÝ.¤k|ŽeÒƒ[Þ )ÃÚâ€V0NÁwe$ݳcm5÷T¶–]·ûݰr£:à8tDÊ õ,®&£ô'pï‡l2YÛ-g+ ]HÃ[/3…&`ÔˆîªR¶„8'¦ðçà&¢É8V=gkûc&|÷Ó2šÉJ–íì?œF,ÞÇ6­Ó¬µ¯e‹ØKâºô¶!¹ñOá Z7½ÞE•¶~ bÃ1þÈ¡èâBü_Ýa73éòVÊýk")£Uÿ³ªøaXL^“\‹ NÌ£Lûèéâ87ÚåËùD¨.7üÑ‚(ŠslÌûL\éLPµüМ˜Ö øÓ%Œì¾8ûÈ}ÍÅÉö–xBØÇüžo–4þx$zaø8Ã¥1”|OUD¦XˆÁ&›!†ÃzmO,r ÛÛê†u3Bäÿ—ãj®XY<¸”ɼ2uƒa»KízÚËTüÌ‹­ãX:ˆqúkp/õF©rã³]Ø(j Ï—ó\ChÙÇtJñßtËM¥>_9†©Úy]ì2>Æe Wg§@!•šP “Ø÷Ðц¸a0Ú`U¼a Î×$A‹yÉþ]1ë 8¥ 6µÓ0¬=¥1UÏ0º¯´I¡é±•$«¿qlYÖ«¤­K²¬Õ mÉÕdƒ@2m:jZÇZÐûÆ`KL?ýë­Îy³Vv·C¦*ée7i~Kí'>n$—|š² óS®ÄÈïñÃû‹ÎvŒŠÝšzzø¢ðæA õ7i©CÛÁq–çgaýÖULíQys˜ö¯C7­ÒzŠß¸[PÓeT3YÈ^ÁÐ1(j®ü’ÅX³ï†Ö¸Û¬³¦l\ð†Ï"“:¥t`‰Ü²ŒÚínKÑš$cuT0B?­ZÄ¿3¦¹j-e¿ºáVáýM–åÛ@e|Ü…M>o;òÁ÷œ¦8³Ë™sâ$êo*÷@Î*£•Xâ*ÂðXÜBΫ7îð®&תÿegª•›ŸPÍÎÜÑ´~æ™|–XÿÝL¿¡Êr81ĉøÐ²á»¶GÒ,ÐF8‚o1ñ3,¼3læ3â=G|æö*@éâüÝÖˆUN‡‘*R€äÔ ž!j³*2y?Í€CøH ‡xÌôsckm—ç%G¼­°¶vGš?虌åºÑ3€s *ˆ«#P3âB(å˜;ëáüv¹1m¡³"‘oŸ7"§,ÐM]ìþhÊMä# Âë ð0Pé|—CSV˜á>T6SXUXñì ¢aqkæâÐ>´ ‹¼e4õù8Ö³I}±TK2îvÓа” Ô3H¢5-îCŽWªÔz•ïéî9Æè›ÙºñJ÷Ú)öÂìO$;¨[²,…¤š¥d¿è{xU$ÁeÓJ¤P[Ýa’ U7° n¨éá=Ceb˜~‘¢~ûZŠE…[ëÖ‰1©¦ ”ÝY!.wƒ<\ÆÔh"Km¥‰Š —+c0,Z Ë>Æ©ÝæeæƯJ€ÅóHMá뵈h=Ôûå©GCžeŒ4xØì7î®áªúâñuÚYŒt㯃’éÎBËþ=;)9Pç6({pÕÏ=ñޝ[¼òäï)ÃúÑé †žŽ¨>8“!çÁ”ä‚c·˜èÿ iÆ=X¢+3q<¥ í£fº¶vä¨ü,÷{‡™+ê7úغå~?¬“Å#fOÉZÉ£O‹5ñs­¿Mägh“û3~bzŒfø®RÂ( ÔÜÐ$Æͤ  ”Ü=¼O¬ãìÝ>‘üD¨,£ü™»ÃOÒJÅÓÚÅ{žéèQÈVùËX_Ú8ñ má(î `— Ì ä!cn¥_6BÞßâÔØ¾L&4øÁç&œ%ºûÈÆ°»¡UPøiŒäõà¨ûkOË>gäR¥cÝ ÉÛª°9¤4éB‚%À„?> ý Y¨Ä;_,}¹Œgãÿë8ëåm0Žï LÊÈ·›1üHœT.ŠÚŒÂñs‹wqBSÚý ‚þ ïÌõ(—øCõ_%`Ê&Ù™£*dB™´Åèl°c9#µûV°ö‰ñ¶o1I½8ìß­Œ>`u1Ðt²$™¨yèmD‰ZÕªKÎ_¥Ø‚ Æ ÉLgãWÿo›>M7µ¾û ›öhéÁëåß~ˆF“‹E"y,ÄSçYÃŒ[µ è®óé¬kÔ©A×gµ}õ·š=e¨Î áöü¸ºÙJí•éRTÉB­®ÇLëܽ}JÖjyr~ÅÝë¶hãî 7÷êcýùþѶ÷³4é$Ú½®§ˆ¿›—TVnJNñ“ú­ ›ïÖ^?ÍNb›¯NÀ"ª>£ê7Ï;¶¸Y·ƒüÜnRû"6dØÝ»²„-Ž s¼;Òþ´áZ-·ðéͬ¸Ûûžú€:îq½Î=±†Ë_ô\µž8ù¹”­ÞZF9q_—žš&ózÁ®‘úV6cäɶóÌï±Y»SËå%×3ÑÓe"$ö[ÎêþI[qšƒ#Ÿ 4Yõ¢‰Å÷šyÚd˜f¡z„lçNB8'k³_¤s5].Ir]ïòDv@D7Ú4tÆ/Ãf{:åè ®Z¥À•<ÒÈ®&h½›œ å*Ì؈%éq­ÚѰZˆFf¡ÛŒ3^9‹×›AŽ‹fOYÛ¶ÈâaÅQo&Ì,?°r݈4ˆÓSQ7äæDiƒÁœVÖ™Ï2ÄŸÜL&ˆvaJ-ˆi·¼¬˜ 2(¦¾0Pë¡®JD焬Üi†ÊïdÂò5¹#îÞ‹°;¸Âޱ$€4~pk(íCÖ¬)ˆXð|^ó6Óªà­Ê޲P»G©fFƒ–]=hð¿ìÓ­¥\mÀY;D®ž7õ‘ÀÉ<¶x©_o°Â)­ŸGªå_¤5Q¶» ,7üfE.ßäàˆX·Šú3½jJ¢h`ãd)Û¦a/19† ô÷ºw¸®Þ>v>«Ñ¥œ½õ3°„ï•­xÙ×ÛþÒô±’ÏA†¥Ÿ=ùa⸠ ¾¥?ÿß_uŒ>»ö¼ iô£Ã(R(ƒ%7ÆŒªdA9½„¸3÷ÀmÇÏ&‚&i¹Ü•‚:Æ'»n-ïÛ ¦ É—ÒL¸àLº7º1<>UÉ â 8’Íî°îsÚQo¬Ôi}õkj×GçB¦0{ìúÍ5¢àñ‚GŸ+neÅë(ðqP&Kò¯&Âò¿ã¯–ÿZs3/ÊÀ]…ñðÓzxæ—(W¡ñìzkDðæ˜•>¸äèºøeáµø¬ I‹p°ýoñH®dEMh ð>îÑp4Yiays鑲dž˜*µ²L8}3Ó¬àŽŠ¦)@‘GLéȳAJ•„Š<´°9Vù˜BJ…íhÒàå†V³ÜæÁ·ŽñO»â¶pt ÑëÐuB(_[ý¾-Ý>¢tzIÉFÌ\ªB†ä}Œºù÷4ó&7æ¥Ýê9XAÚíÑ”ñ"AstÙçØÑüã:5(„k³¾ 3ÉJª§ýƒnér¦’ü àïÖÇÔ¨mû»²ÚÑôÃK +ò=&Ñf· pb©9A¢ ^ÑÈ¥sPvw³ÎŒàf×6Ô"]BEWHƒ@›jATMHa‘åRt]`¯bÔqï"p —õ2òAÇñ¡‚‘µ'ÕʵV WÜ€Ä@ù*tSÌÍtýÁåQr¸†zÐx¬ÍwÖŒ’&‰µ[ܻӶ[ÒÙàe-èš=wWúÕ’Û¯«yºñ oé`‰Æ Õk²Í¶\Ðu辶ì#AÛÔ½n€ôÚì×µ®–"niœ*Å n'ic/ã~ÉáÖª S±‹Ð1)Ø&HœŒÖ½a ÷WеÚ4Ñ/£Ž£è웣ÁÀOHúœw£ío‡j-®|è„þZQçõ¢|A’­6‹èh<7‘9Mí¨½’](ÀŽd¸XR ™K„Jˆ=…²8ͺy{̾À.í*A_c*ÙuôFã«j‡Tå{®GÜomãHá¯N[³øý½-n$ÅÅ\D@RhOšx›ŽúõÇGÆ c/àøô£éMaxmýÁ¢—GH’Z{‘¡%²Q‘°K¸Óz§iN "±À—åyI|^I@ÊÅÜ€I¦V`¯Tqõ·™¤: ð\êe…£tÅ60_Ÿ ;¡kgÚ‡çbÛB‡54B:­Ô⓪€(¼ïyYt¸et dwŸ®ŽØm]*VWù6‚J”´~Q.ÁI”—ËJôu3Ú•hzÊ5ÎÂjë­&ë‘+3ÓjàãaÖZ†Û0óâx»"_5b%/¬Þãƒ4ó‡´„d€IÓe­F¢‡ÀÕSðPþFU(:È.½zø8¢†…ì¤ò©tÀÑv¯ü¹µ-sòËÁ'$ ~·LÚÐåNûi7JO7ž1ñ“oÝjîq¡hÓt÷¢c~êGu¨ƒ´¦°¢;‚`†ÖOT¸¬aUÊ?I Ë+ôÀ˜cVÌ 'ê`‘5?‘Ú¬) )ÄÈl–ä¡ÑZ8 -ý™y©aqªUƒØ®[ȤsŽ"û%Gz7Yª›uE*w~¡Sˆ dà¬!xŦÂÞNx°Â4}<$•m9D} 2íQ úÒ¨oû%Öñ-Ó°K/n£.M˜ Ð…€‡G_³”ħ§œØ_I” Î»"v9v©'\Öðè+àû”©‡¢àÁMÊäÖSm*TI y©Ê²¢üAtQN îCîÖÔ›fíTÉŽÓÉ·5q«–œY%vÃì‰ fœõ„òî„!·t6Ärloé²C~`f×ùþœIjá8ó¦Õ¤v|‹„½0V«ƨùó?Hgä10Œr¿iÐè£åÅ¢%²w¾²Ðº5N„ÏO C• ŸNu¯7Ãum†}k7³ ßR›°uŸë•p6‘Xñåï»ÞK ½Ýé ¸ì‹†“GKsYh6J½ÑŠÅƒ²ò´A3ý=a5ë5X{–h†È]é— ŠsÊ *_)±v4% ¦k÷«íoYû0ͼ… +*‘ìI¡·SàÈÖ(Ø—Ü žAû…Äc‹dà?1È •†BxI» Ì·ùµö4‡zDœ·óƒGv½øé-Š÷ε|CYHgºì WÝ@œë-_÷Àõ Àï‚ô"óBzi¦Œþ>™š~avjç÷+RÑ¢YY …õÙµ4<òIvKhÁ[ù´øyh*IíI m˜JL¸V,ʃLJAUïv ‡ËÿŒß,3Fç,«Õ”³#ž 8ªzíN>ÛXŽ÷.:íÛ8Yåºÿÿ7òÿˆO2v¸#3>|€H)}ldÂxêA¢¬ÍœõG4'竆q|!> "öO2Cî`¶z¹ßÆ Bul·ëâ)”ýcÌCǸ\ 3`¸²Uè4zî¦?- tOÙ#¯ «yDGÓ¡ÎV7»²gHÂ+ý¦ÿÁ¶ÐL #‚åžÙAØÅ©ÃZLK—Wã¤g‰`1¤›”9@¥dBozX`xƒý¤•s¨œèØÈP [ËìœÄ„â8Y;ã›íC±¢LRrVè]üžGèdp¬ ¡á¼r¥þXô—NŒ–d'%ùzx…”µ#X¸¦µ`¥ð²ÕüKù¥h³™Š=»U$Ü€¥A(  "x bµ~v×ÿù#Úª¦_˜ËݲJ :äÛ;º¶G¾÷ˆqë¨~È(ýo$~qèE)Îõ¶Ó›Ü‰ÛÒ—Ô”ÓG^Fµ…»žŽô”yKñ3ÖãªXÒŽÁvóPŸê‡6•@i¾p~¬êÖÙG;Ã˲*¦ÃA°Aèqš§œ3ª~Òâº](V†güÆ)+ô9™ß;ÎKEö›ççÄ]Ý_ô¢Ypl€gããˆé¿e|ž†»½è«ºc=\& •Ðoop/æJOn‡IüQÊ-Òü–¢¬d×òú¶B‹‘É"¢œCžÁÅšòE+—˜_ßՈ뷖ªˆ¶ãÚp˜¢>äÇ=7fÄŽLØp~ó·m¼Ãƒœp¹\Ì[5ç ¶³¨ÁÇT'V úÁƒGÕ>sèeŽZá6ÈØ ¨©¹AM£`˜—0Zí"„Z!ÅIxÞý ¦>…÷^]àÉÉ«šn”QÜ[à@½(iÒ&d®ê¢ç õ6wß´ZÑöê§Pøh|^à¬L/­vB lŽ*‹©ñ¢$ÛPx ?N{ÉÃmå¿~4rEün- éqiã)qtmùJ3và¹õ¿^àG¸¾™Ù&‡¸þ#-^ÙÒñpž£&ÂvüÆLa£<’zÝyž­2%¥_ì3wÕ-!J1}–”AÍ¿ ÎgF$µ=ÑJÄ8—æOXÕºìVÂ6ZÍ{*pC1`ì7"¢­,9ïï‘pÏÿE[£kU °ÎXM ÓCtt ØŠ@E¡êiRLÆ…1Ó¤¸OŸÞk;DS{çÔi\`zò»]ãÖ¦/y: y@?Âéôq‰‹·ùNJ-õˆº‘7YÅs@ë»ÌŸσ:’)qp«ÁÓ/þL`,'øñÅÄ4Ù‹°˜ñpQÏÃó‰“ù>~ƒ(¯VÄíý‹õ.ñ‘ÇïvB ,³…œû¢lôûhaØom…#ÁÆÍTŸÌ~$…¸65“ïiaÒË/Êq „$Ùû.LJÀ);Ô,Â`úHºôjå¦ÃA‚ïJT„Däò4p'ŒÉö‚î]õ¦éÅ2QÚXAŸî.RZÅÖÐßdw’“BÄßÑ• ¾å 'A4‘ÃG‡y+•9Â’Ó.¥Œ¡( ßçÐkïfRº g"§…¡jÎ©Š )ûrÔ-®§ëø]BÕ÷_±èi†U—?`Ú÷–):ߡ鈣bçk«–ŒÛ®KÄ ú=zÒöá…–4ßO_Þ¯Vhó{ì¶ÅZÔ÷B«ã+šoÓU“6#µÂ¦úY þ¸:E6Ï{ªÃgOe¦±w€Í¸uÝ®÷º,K«8àî!Ÿ+ý+ô.ñ’·/™Óuš¼ÁÕ?ÿ]®)§×àü4”Í?Æ Î™>Þ¯@«q)Ú,‚㺂;K™ô¦,Q§&Eº¾xö„€ÐÐeúzí aããSdrÔqÄ€÷ʨ/·Å bÆÒžõ‰_µ-–Ã&ø× ­æBêv9G%ŸétmJ¬ºÊ×ù«›U¯FYD”_™Z7¿ªí׌Ù{7·ìºG^ ¤ñ‚ K0†(:ÿ}èF!R’’œé—p ï£+Ï—ÛìNi¨(wFØ׳5嵸 g\ü¾Hªÿâb ?ÃÞ»0ÖBL°3º…ƒØGLìÂþ«¿A>XiËÜÓô’Iâ9€N¸:wX©1ß×@–7y\lš…3kxxdïـ܌ 9§BGdÙdtñ|ç:Äi(¹“#‘ÄTë¹¢ªB ØJWÁö JrÌÉѺû{Œ öÇ1ð±ÕÁÒ)§u]:z¹²€5s‚c–¯×un l¯ßœéç"/ðí°ºIÉ|ÜÏè ›ç²BãeKÇ[Œ*Ú5³Ñdš’@§}Üjæ*}2ŸðwW]¥ÝÝähj7•b‰5«M€ÛÜ “J‚ÇUJÿzb{ ¼·!ÝmÚî”ÞàqÔWîÝäçe Ž¢Oü·iö!NkäöK¾"i ½rÔ²uÉ${¥c¼H3'|_AkÛ¼':@ò gòT¯œ9ÖLNhåú¦ÑÌX-<¨ÊàQâʇ²®#ÉMÓj»Ÿ-ijù44‹U$«òlÂGåzæf6› Øã•ÑôPÎùÑìü³Éëî™NL- !6t`UM˜Ê© œïKÚŸÐÌ{à_‚w¼vÞeméÃc5' ¹±åì MK{… GôÂzll —V_ 喎Ĺ ‹¥6&( tµªâY ËödQø7;+·÷+ÙÍU™ä6‹‡±ÓZ"`ž€“ô%ûäœD„*°`Ýjƒ9i3sÞÿ å6©HЇçŒð›ÓMD”Ux^Ñ £[`«0ƒ¯‘iÃäó2ü9ÏàÜ5T‚AýIÔ›Ï@’†cï½!ã¹MYœAª­ Ëö°§ºs ljȷ:¼‘úþÇ:‡"¿©qèz’!X Ìà|ÀšJx×¼-FÝë @¦¦´À>EŸEtfÁ¡Öï8ž¢²T$89ÃA©¬îA‹õü ~ù• £g¶ß¾ž}½íB•àkPïElÿIKð[ÖÊÁÅSÊ?+{ȇ­Æ»Ö ¤JÆÆôšòövÅ4v"öºRõ9&±|úN³}†¼kû'°ÿ8È) 5­±§ž4Fñ¸ŽºB—Y“æ»ðüýRI Òãç°¾·œ©íï¸ô£šÌ·O¥PM{þ|óZ߯PŽÕd +S‡ J“¦t>ý(#µ®¯‰ÒG\Ü*ß×ugÅ}ØI0x^Ô¨õ„¤ó6"2¾‰ù¶_â#K$ ±„àêÕq²‹ÁFºXý‰SpOtÄ‹…Cè¥ð¢åýŒNZKùj@€á16ßÄ´^„6]>“'ñ€¯ç‡CÉ}óãp‡†•†¾|ÅÛ™£À°òQkxHàùÊ Ž¸ªõðóXùŠ dO‘ù[¦*|iÒ B9Œç¾L‚ôbØd¦ê4mRýUoD}‚6ô[šFÍõjçC8Fã\œÐ øƒÓq¯JN‰:<ÑôB—¶Ã1烙R4îGSáh¾=d~|zö®µ¿H >ÜÛzÿ†ûaøÃDr^3Ÿ Cað¡BŽY‰X/2äÉþ)ÖmÓ òÎW7ì3½èY3Ç6 5„û€™HÙK»^Ä«·“=ÃÃûÆ×±¥´dt&Þýèм4ødZrìþà™7Vtw(ñ®*ÈàØæ4ÈZk ó½xïÔtáçy¹J$ÅhÞåÒ<`)ä5ÇpÀÔ‰ý¯¹Æ5ÿEÂI~ÔžHÞà*žˆØRvËÜÞH"û=›ÊD.%àš÷€¶;û“FýÅt?¾ƒ¬ÅTì?Ó(ô0@H¦MAî³û—PÆŸ xe`u¬íä °ûìe݃ÛS ü„U%~©4ß{ku[Ùaë3úþ¦¬á4u5ð>¨ÈÈí |Cƒší÷>î ñ“8ï.Qäe¥.GÒéšFr_?ïÞv\Gt< ÏDs}1­NëEñÅ™JjÆÜø°Eä§·’`1Î$ê~Û¿w4½ÕÙ.‡½™¾ÇÍ€Œ«÷ÍÉ•Üàѱß‘ •öÒ¾æÔšúsî°Þ×®áetÕ²|tNðØ?UÒÃ*:Ê/Û8ø¾!2-G×&:›žŠp(g7‹ø9Ä3R?výäÔ¸YÑz ÑRçµlˆ©ôÎûôoLìN‘7h,Y~~ê Î.¹üMÐŒ‚U@¯#ú와s͆‹…ÆõdAØt¶BtV–WÌ;¦Æ©·Ã;=c‚zS7•(‰–¡«Ùv–TNMEÿÂK%3Æ/£eõ (‰pÒû¯ê¾™oŒšæÚV²ÀñNYÁLËÔUJG§µ¤‹ö{çÎ!Ëa+ ¤çÈ=¸B§gƒG®íÒÇwó/Øó+ ^˜zb5¹jj›âî?:ÉR«¡çKšØº×»‘Fɦ›]¶Ê!ÜÂа6õÙ±>ˆ[êѱƠkòµº/N®³À© ¡;“øõ-Á#­"JÆ ­Yk»H’&cʆ8Ty &Dh¤­â×¼!#HVðý‡ß¡‘lr赉 3ºÏ4Áɳ¨Q!Jm©ÜÛÄ3+(™¾Lõj~çéFK~3æ­,)›Ç»Ê8LœÓp¼ùá—[‡±ºšƒ0/°ðz†OÈÄRš·#?„(wraˆØxšWÒÒz2šª’÷0Sm­ª )YQà]æw‰[ÆŽ]Ü`‰²·OáS1±÷Ì3Qéq½ÍUw¸òï˜pKÿ”÷ÕIs—\ªŒ¼u;J¹äTXà™{ÑLƒ}z áó@òÆŸ±"Cïñ€ZPjo›Ç=Åø ¦9"´á¡±iLuÊð$â’—ãx$"X8cœp²Gk˜“9ªþEœi!7Ü×ûÓ€ ÝùáŠBÅ$ã{®åæËz¬õMèëé$Ãш¥ØÌè‰rd3r‡{ãû0{,›Î_•…‡:yKââ]:Rž•ýƒPø‰D3SÜá½ñ÷hº€Y@úÚêÓÊI~MHdê®xeM|q|Œç‡ó’óÛ펶â Á<°7’Èv'íqɬ÷çéR2sžNÊ\ŽpÞŸ×"ƒz4|•j‰½Ë^‚Y$Ù°ÿÑ£>%åQôWŸå¼Ù*’[¡Û›õ¬“dR}Î@@æiOŸvl°ÎÒe{4ü­­?£X ðãêZt·¯Þt+¦ƒ¹¬z†zåÙï_@G^`9‹v’ 'õsÔA6i]3®òÎÌý$A5vÜèåuø]¢J½«ðŸßaCêuž?{v´÷·–ÇÁ‰Rõm°ˆºÍrqŽ,ÿ²‹¦B6Q\ý²ÛO©SgP<ä×p]Lð(¥¬PöÌ$2I¦^7K„±…Bè¨j¥©3Ž´7#¦Ö”?UdÛZÞ'yËv€p’!HMúÐD +笘ܼB0ÙÿWK£P[Dö­t`jî•îC ·™8ûÚ?އzèÅi§2ô¢êŸ·sfJf+Þ`"=•¼”v韽°º¶ZÞ Å¨ÚÉ6(˜¡¢YÆKq£Vpãi]…¡o}gåûýŠûóñý7Rg¬"6ƒ (™5û¨Fµóú6ÞÎ~ùŒóðÝ å'¬ºÔ±6f†[C€šq¢>’l™Ü2|52Üh»ÿHÖ‡Bef¯ÿÓNí&ÍL"_fÂ=8¾ð-OJÌZÏ«$î çÚ¶Äû’Bý ;€ýÐÓÈkí‰?½Þäòxfu §?}3•+÷Ê>íWfŽiר°gYÀ4ù[BŸF&ï¢à1±÷4hÈxåLooI—ík·°’/(^|Q†$x`~^ ÁŸ x0v¡œ2ñ•W)1Nµˆ w+gKÙ£U :Ì9¤FEñmmÙ€ôƒõyrZ©,¯o·ØtþFxìa[d›#>ÈnDAi`‚%dÂðç7‘‹úíÊÔWiž‰ÚøR³÷ÎÖµŒBTd]ÜJ/¨6ƒóžý ÊØNýž³ïS‚WÉNî#î<¬˜ÑÕãtÞ+ò×¼Ó Ff¥Í™¯0J‹™ß“~jÐÕÓ,RŠbm]¼[`0Ϥ^¬Ù òšbsbê3£Pbß$xÍC è.%Л¢1qU~—¬«íNÐTÃ޵ײZ0vûÔÿ‡àF¿vk¦TªA[:]ÆO› ƒ~*t«…Á/zÑ %^;‹>ì-®<—!zùùÊò§£TÃëC"1½ÛkÙÿ|xÈôñ†zV/”E%§ðµÑ:§& ãAzÌvCp8wrÏ–yó•Ãü¾Ä™ /¾RêQ¿£ Ô#„y‚¦ÒÑ:56&pI \²Àe6?ì’¾ÉRÖÌxÐã\Yõ#ép-,ÀnÂö}é?Ô_©×j2nn³hŸyÁáM£$Œð¨ãU?v]€58º­ kB? Ìf€b®ô×Í•õ†gd†dRà°á¹œjêfùcâFÞ¨0ŽYÔDÐÉð7kVIC¼NJQpöÒ©ÑÌ-­ÆXù€74Z$¨±Õ™Ôäpÿ)ëÌ\»ãrÜõÄ›ŸŸÇkÊ™½»Üã·þ™µ'NŸ$ã€Eª¢]ì5ÄanSÑ/~EI¤[?ͪ_a¹’ïZ ƒÛb]*Ø Ëm»év)>o¸†²qwð D¨>xÃȦòŽM·–mh£áköøÅÓ¦œŸçMе脌±í±tÞ]ËÆÑ̽f÷Å4͘[ÝÌÅþh\Ú9Iëy_©^Ç {ÀÀÕÈzÁM*Öd%Ðë6à :U õ»¸„…¢ TŠôϾòoÒX‘?%ç(œdäå?Äɯâ—Íík/µÄ³^2Í Æû­IäɱùCYØ´h *•Büé4ñÛ ÓPÐoQø,æ,¯è“^§Jß$ÅèÝ»¨’ì õ)75À†éÙ„Bí.KFK‘‹µÈ~¥Êë ~(ŠÀ;™ ?Qàƒ—_¢+ˆi¹jG´yh¸®ÖÚV[›ós·p!ö²FP ÷þ”)Q× †$™>é‰Íµ’W^ŸYët‰.¹C6曹qÕVé ahÓ ¸0N£ßâ“õªs`¨ŽñôcD÷ìWd±} ("RÇØäÆvÿ@âÍàš]Kžªtä1dY]õ¯–qÏn º.Š0<Ü Á·oFbë* Á\¡Y »F£ZtZYE½AâávÁm—vΤ¥”È Ç‡õ[³ö Ô Îp`ºù(p.QîÂÍÃþ˜¨ŠÍ+->¼©Ï/ÃK”gî<°M³*o\<ÊŽ¹†ËXóVËÞu´xÄáßnÃ70T7´¶ÉÞ&ÑÈQ& ¹7Û r½ýuýmòx©^‹ýŠÃ€¤·Xtïô›0ŒË63*HPÊÝÑ¥ûymvŒ°ð{PGñ‚NƒSyÚ?ä&K»‡•Ð0´>!8xò-—¨*È2„Þ󵄼b¼b†]†;Šuè; (F»µÇ!Ü<¼(7áŒLi4ÑûH±…ʯ±!Âi Jó3ðÚ‰µëí5?œŒŽµe »A=űë:ŽûÒB2šx©õu^DtiÉYÞ‚çt2òü‡%a•F‘ùˆn>¯ÜŠÏ³¥¢’%DÎ|ÙehÜÏh)ºt©Ø)d%ÀÀÈ¿#¾Æ„¡”å˵r&ØqÙõ‚Ž$`kß.Çá#¥ûQDÈ ÜÄ;øˆA#%kmÝí~`׶б*§ªˆøaK‡¸¥5¬$ ê`ô—Lp·Ô¼_ˆNÎ^grB5rk¾%û‘öD—· †Q+¢âpâ¯ë‰&ËîÑ‚(Ðî:@(õ¦ _½>zʈ%§âèüÙ"Õí°ÈÖàÔ¨mBÿ¥7°}+ôø6ÌÀÛ«þ ÷WªË$aÐÀ  w+ gÄÝ)ºœE«±àY Päöm'Šk0w:û‹×P<ãÇ!F©z0Ý Ëû¶“FK~gh1ç¼pð×UNÌk××%ÏZcßöîúw`ÓߦÝ× "ÒÒ'õ/ä¨` & ã ;A `[ì ‡f½}ì`5ãBYÊ^ËÈ×wqhÏŸðd‘D_ì™ø«lºó`§Qgiç—œoó¯ Ü÷à¾rWUÑCÑ"‹œˆ‚ Æ@IÚTÃ|£²Ò&Ίdúõ¬ý@ÓçCe%ý»$ŠqNÅA¸ªóèÕƒPßt¯tÕèÆð—ƒyÓžnjê9K–ÙkßÏû@ö8Þ0=Ö1,Dzy™-Ê¡!q²±3Ö‰\ewuC$±ɃÍ(>°°Ò TF”"¨ÿOpÙ„¼pÂ]­§ V\?@ÌÌÔÔ\óì>Û?VH{XùO¡/ÍJü~¿uÎïyŽ sxΤv4Í¥¨½ë‚aói3ŸÜ芬…5D§Áòž7V–\ëpQ9 çÙÂ[[õ3÷ÀßÏq5Ê‚.Á<éù_¾«¼ì …rƒcÌ6Tlo5ÀXX 7Yû[àÖî_½§’Qg¸„hæÓÉi˜A(øl\ITÊHFQO\VœäùYÊ)¿.”áÈÊìÚËw;3€&¸owðØØê% þr¹{Àê‰õÂÛRµÇÕ½+€°HSÁŠ˜Nè‰×ʽå3õê» \N9ðå²&”ö—³ž¾•¹½¢µ I1ËïC5 '+½ÁŸŠà™¼Uò,п•cÇ YÿÞ :Sèyè¢@s9“‚Ê´ÜIÈ|©©µ\’I|–P«oŸã¹ÇC¡y!idãÅúO36E9À.RËjo;Ú^"/ò '7ÝÎyxmž=Äw€Ù†6- äîO ãon e™Þ ëè]¢ÄG›ßVl¤OO€ ‚g³÷ÎÁÅÚákŠŒ¡giæíÚ´úïИ7–ôyy m[,þ ̹àÐéÑý3åÙ7äV³ É‘_Ç,¹>Åð9u—NI¬4¨êÁþü“—¬‰°‘f¿«¼"!x)ªž;왘Ülü<ëi6ŸGÉC˜#6ƒFñÀê»Ó!  é©žü&Ç v¢feuuânðS }ïòÚåV8FŽ´ìëf;“U~»£™qí|Œˆ£ÖiòÈ9è?1(ìûs¤ÄÏM¼\`F-æ¾|9µ]P¨oaPùëõsËê±B =˜lî‹Ó±FGöŒäh+<¤ðé˜÷¨;_x6ƒA«>‹éÓ-§êvr#QÍ꣑]˜SF‹uîã<Ô7éËéQv›Ú®8–ŸÅ‚4 R̆„7”IÃý™%È{¦jàÆ­¸²•¶U[ý¥ÆþèǽæÀž»ôÓuY= uS™©ùž¶¥tO\kÍ­ƒ„ŸÂHÛćÀ­¸r´ú¤¯Í3hHþŸyÞ4õIÛýË$ÿi¨ËÔc7‚AÞ¦ÐË-™\)Ë*/ªœ¶þ¼‚a¢› cA <Ý=°£ÿ©©ï‰Á"±|gVB(ÆžŸÝE’Øä-Uâ ¹¤…]ÏÇ ݹqMU\¬Þæ‘Z¾o(Ý…â†Q>°ø°±¼$ªûÝD ÃG˜¼öНx×ÃQÈ6¼>y4ú‰y3Ÿ)o[z•,W¢^Â+Š÷-AñU¹~þ00Ö'ìùž¨g–2,_Âý܇–(ãy+¼[sžÅŽwͤ "‚Ùû^t{™³)s¼µÖ·NR‘Åeû5K]ú»7³—¹ TtÒPƒ›o;*^)¿ÓeÀ ¹` åàQ ™/8.>öÒ{HÂò»ÞKÆ#D\ñ‡MAø"Mu‹®U½”š‘cçFV©gOŸQTjHÎ3PàÍèó@ꎈ —Œã©Áòœmª;Üýü2Èf–ÕÕ‹LÊzOaY¿(š9wÜ„¨ÅÏàé{€Ðàç<¬íéxwZ6/‘c<¦ÇŽOZ¨ç½"]òh²cOt W5Õ™q;à‘‘þm9• TéùTaŸ RFZ²ÊPØ 87yp7„`q¨«¯’àlùøZ9+há#ºEéñ(» ‘¯¼h˜®èœu´Fâô¢Ò£Ê¢*Ì$“¹'w@(ÒÇ©ô<Á£·E^,¦„Ü‹£¿ÍÇåÂ+-Ÿ&#æHºEþÏîA]PZer%1Ìn¬%õ7冠bºp ““}µ¯ùAþ¦Çò¸5W;ƒåGAd;'.Øoö[øÞ,®Ñ°:yçÞÝV Õ\šm¿N)â'ŽYÇ}pÐ$<ØÜ…!ä?sÆ™Å_‰­¤xÍ9Jø¥]ÔÞ¼-øÐS:õÕ“w»ŠàŸ6PñŽýZRù(¹¤ÎÜÆY@ЧÀÅî Cz(øVfHïé]~¢+úñ粎3úOñfR2rv›6ºi¤[ov0\róyMpòø®6¸y¯¨…}³ÍÀÝRO•µÖõÈvL¼†&°€›ÊŸ*:’&¹Beg2fýótQærv£¿äêcY£†ð‰›bËiõxa¨—ï’¾¹•+=óÉ…‡•à3Sv —*°ˆßM%ð“¥Ô€›¸T¼ì•=¶p,-;_fåå¡cè‚låªK:7êÂ_ôÅB@”6š^Õ>—2·ær.ŸK|~pKÖîGàBòœ×KQHÞ¬líC/‚ì.wÜCSűG@RFf»}Q?Y ¦ ÀeÜešbg®®RÅ'U…w‡¾7Uœ…G4“âçq  pºá&:ô|ͬNÀ_IÈ nîF^3Ï^¾:C ô2Û&º(ù.á.!G8PiʹÒlUúßUL:Ո蓰81K7ˆ,­않?ۙʷ¦ñ‡o6í^ ¢Àºg«3ñ‘öFƒ6€¶EŸ ¤±·åô¸e¸8íÇJÖY^0‡) "HÀÞèuåëóÿ™Ì°Z¹²§¼ý£Úùýß…:Ÿá Åçfwž!JZëêoShëŸý‘mOïÄwdrnà–-züÀÛr¬Ø?ôFÉú rç‹{ñ§z7¬ ¯¤=ïgNZtÔ°_,þ"å#í5µÛÞ Ã|¥å‘ŽþŸÞ‹éütÐÎ ®¸22@˜"ðt<Ò…Ê6ü5pôEOîi± ö SŠÙ+[ô›:Õ’êvul/Ùgk½Xâ>ÞM¥šÅálçeˆ“0j”¸MÕgp“pð…Ñ¥ç]1Ìw#±ýhæ¥P¸·¸(ͯÃÏTèx«¦:¢4²gDíTñóª, åÑùtë Tÿš¶ÿL€uD„o°PÄÙå"©¨cÿ}B/›O·]‰^ÒŒ †WÖØƒD~Žßý‹Êd¤õr à'âF‘³ª÷ݹÀ :lÿÝÀî<â§nJ\±f¯òyŸü¬>kß ±½îìd'3ðTô¼wwV§!n³(ëØšgƉGæX] qf ›õ1ÿ½øt—Ýû4%'¨2Epœg¬~ߣx!1þ(oÁÅüL7Ù‚Dš74 î¨NpØ|—Ó ç5*ÃP«E„ K¨ƒÿãytÝ+JêyåNð>^½chІú÷®’=ÐÛˆÖ¼&©2þF§’SËÁ¶•Èn€TýÀñeâzsÉ BÞ9ƒò“œsctáÁæqM™ê0_›É;Šš½'ÄÌÝmßБ”õ5ë”\Rxüwm[3¬Œ?« ²QÉ ‚ç ܬ¹ú¤S-Õ_„É4È%°ù7逆 åÿÐV¥xA ü·æàÿ&o‘d^ÇÌT[O¢³‘Y+=~Ìå°†0ŒAv[¦ÚÛÂ%Þð bŽPá.õžÊ÷Bµ§YTÆJÄL2£=¿8@ík+ÎJ(ŸÒŒÀ,ˆºa µÀˆ>¥JùÉÙQ-v~E ö î-‘hºíl nÙÝËU“ˆM¶y,òÊàì ±\ð£Q6só[ˆQ‹V›a/½««„{þ<èZ„};g,4Z´Ö†÷8ŠÀçŠkÚ“ˆtBU“ã}Ûi%úØT•sår¶#é2HCÄ!{Ž|Ü´¥NxµAÐDs8j-§5Ñâ6zÚ÷ÛøEõ«[bõÏæƒ’xgÌ$mf±j=T>µ"!^Ãt˜k»déôÜ£Ëa¿ôú&f~ØÃo)*À¬þr°0‰›•Io _ç<¹ @õßagKã;TG×dGµÊ&DÈ›ÒQ€ÂŒFr;{ÂõÅš]¡xLÂÔÕ/_RQü« ØÀÑÎ]Æ›„–PÊêcª;”Ú’«ôª±ªq²Ú5?¼„– êw«,ªGŸ£¼ùŸ¦NMhŽû/VG?kœ‡Y½Ðõ,ðˆÔtRWåÓU>§°MrÓ[äàK”݉`Ž•Z°½Ü]3žÛŸ$4j Ž\Køµ‘rg!Ä®\êM¼«˜P‹âNâÔ[@àa/åêTÙ>¦{y›ñØghip³£“4+ºÊ´á†CPmR÷ ‚õ‡¶•²_3„Qgl”ûÆÎÌFAU]Ê%Á ÄÐuK"X·MtÉ¥i˲ØÜ’Sc£G„#Ï<5* á÷KÉD‡Q`&&ÌC©ÅÁG9:ß86ö“¤@.‘IØOÁæ\jë›DãwšX®Ò Ž]Þ0ê¶1Ñ÷˜‰t&ϸujþ÷˜ã@§àöÝ`È´ìiôšÃÍ .+QØ“@Ñ™#ü‘Pj'ÇãFnܽlËÏ—ýª>zdÔâ3EÔ[#Íp4@%yèΨԥ“Ì6nXÀh,Ólڈƨ`£Fã}f¢bŒ”âZÂ[ÔÙ /,„f …Gô ?$tøí¬Û ëç¦Ðfíṫ‘¯ÿ¨wÛ‡KÀ’Õs€?Z’©aÈ{4°)ßBUˆþþpÓË2déaÖ ùqò¢ »@ þåö4\;œÅ^I-{Ø b€C–¿yoUñƒÀb±¡HFbkS$#"2Ùi¡•RuJX=y _H€0ÎN4 –tE¤ƒÝ£€Ž$ãÕƒ†J¸ó¦†^9`ªÔþ­À$I ]lý/$ÜÈ¢C àð!ÕϬlIÖ`‹:Á+ Mÿº;• tþûŽ_X¬ Ý ©bË ¶ó«é7/OWÓYWw’²Ä€¡ƒ¡‡dën¶Îw}nShö~åiWGöÒ±|•ÏÉ®Kq¢ˆØ}¯»}â€j Åï™$&^AsË»6s‹¹ CCu’yÎ9Ú,²àÄ 0åTœõ5û)iƒÜízó©œØ7[X2önû³¸=Ö¢&Þï’1KÊ4®­ Áñ†³k.B_âP;¡:§¤¸.”ú_°J¿Ãç"Û4Ÿü-ƒzå|…vØG*Ô:Ì©Ïx4¦Zc§L¼žV~¿ÒnþÄAÝS{é-¥ÚÝDA´Â(®UYùVÊõ{eŸ9¡ ® Gù2ÏYÑî2[v¸Û1ˆ|æ¨X8á¥Å0Obdç4H¯žÝÊÅ>›”Sse:úQìÞ?+ŽZSDèŒÇâ. lûVYlÎ3åuÕ@ÃüäÉx¿Lqô¯Ì}ã˜$9ýK𯾎®-ÓÓ‚Dx&C§óž†É?® Ýý"Ôà€WEo {ŠÇv*Qöym£…€ÚÉNßÃÆQïù‘=Î= ÒŒòP D¥“韼.ŸËDT–XÐxÅs^¬SRëE>ÍÒ£36ø2%„EÅDòÒ:g  %h‚ÏøÙæ—é?M(À¥â]e+‰|ÙÞÿi™l©#nËL¥õl§ºå´¿òã0ÜåŸ;tÃ^¶­z—Vq@ ù‘ºÒ &®vÂÞt2ÃkŒ‰íó[<ÇåîÈ×½d<k׆¥ó–†ºZíŸ Î$âZ¬ÿžRõTЄf¯C5l+ŒÑÑ}_ýg‚H llB×ݺ/â-öÙ1ª Â¢ÉϯC:h ŠœÊØG ƒâœšŒ-öË]‰5øÞ€ëw;¾ƒ•¤‡„ޝE£ØˆN޳6ïÅS침{\p©íz:ï’×Õ’¯í¶• yîIåU&cñž2ù+¾1_Ë rÜaó¥™&S{89µ¯/:j¢g˜€$Sº\5eå\h' ÓC2±þ’ý´6–h«O¥Oo˜ ‰u Èz²i³ô•Í—alÔÀï 4ñ÷ä—/ð¹;‹I;@À±õÇ[ŒFªê DtŽq¼á fOÿkÊ ª1´?Æõß,TõÖ‹BwÞŽ÷‘Ð[gÿ¨Ý ²ãÈÀQ<8b!¹¸- hsc¼IÚ{xÎú4ž¼eÈ‹%OÊŽJDÚÞàs¼é6¯voø”?³£RÓ€Š[µ˜Â§&Ù½¼mì„4^^¶[úéä¨00‚ ¾Ñ¬»j•=šÔDrÖîŽ Ò E+vT¼ÄÖ]¨5Ýxv<ÆÀ-_1?_³Ú{}£æ]ÑÎþH^‡ÊY1¿EU×Jy ÓEÀ'#P]ÀŸ‚û$°"g”ß²9ì*¼ädÒÄUŸ¹tãÐÌ݆RÃòMû·ìúœØ± –fÌÅiJjëØŠË=§·…¨.‰ÿcä o’vómããîö|®-â43ÌŒ$£¹ä!ŒÐmÜ^R"h‹äMBþb|w–$¶byçîE EÅs89Ù¼eKñV(t}¤{··$‰ðÕÔ=ša_Î>hÍŸçw uVw—¬í½ 2Q¦<+ÓsaÑ-è`•Îvs=Rýp.¡>®ê ÙÎŽZ”¾—¸¼$Izm¿%4³÷õôP%ÚÈžÃ%3ÕÛЗFP䨖•œA¶€4%ÎìTg6š­Î‘ãõ(W{Їi$åÜ“Zªšæ¿ v¥gšSv$ g346+ÐêbAwàrÿµªRÅ?ÃXÇrÝâi V™q4ÕÔZ|í~­Æ@éE7½VCŸįÜ÷0?u ~ªhÿâFÚcíÁTo»ìøÜ\:¤&„¤H“Î÷TÌwG œ‚QþKßÐÃà£| Ù$¡Ø;{Ťޗ¹è3p¥4?¨òVà çw'å›éŠü­¨…¿ÒÏ®p "EÓ »q„—4{9æ¼-vmú[:n'˜*A=ÂŽä;Ü<Ð{#Q[¥^wI›4š¶”ñ¸õÅ!Çló¬ƒÐþUŠ>à´Vó){µ]Ü ÍŠÜ’€!h£”7)x×б«3ÂXî¼c2ñ4+·Á#Äà ;¾>Â{bšNˆ‹Põ´­hG;ÊMMÒÓ};3íº'xô W¹«Æ.Ì„Ac”´ð§ié4B†µzGÂÙ\ Ó9äÙyð˜1’'º1;Åû¡âÄÕȈقdgÈ¥àP51ØOM$¹ÌóNI,ö®5hMsÙÂ6¯ÚB‡•`‘Â{¸¾Ê¶ãWQ€ï•½ÃÿèÛêKáÐa;9úøÙ@lÚFabï BÙ=2î>þ ê–•ÀÚíÊ­ŽÚªÛv|ôÂßÌ®ñ‹Ê-bû…‹. Q#sç'¼Àc?SÍüå<³€HÙÕ•·HXŰüQ;)6¬þi޹cé’aPW•¶£@émˆèDm‡¹"ð®r äVçñŸ]v)”4{£Ø8ÞÌJ¢Ië“¢ø‡=v3orjôÖ¨ñKØ0«Œy7'ŒØÝEhŸíä5¨iU~]άdTí—@ÑŽG[¾nùj†4îW*r«Yá#:ÈÏ×~ Q¼#$öÛÊH”“ 17‘å×ÒÍ&iôž‰ìüõ:ÜgÆÛàO*(­ ¬‡üN뜅Nõ®½X¸*u=5_uOÈØ¼ì|»#H‘Œm_q»ÀõØOMåëx[sZÐÑö Ù  #ޤ?Æ3©©ïJ4hE°xßU¨Èö¶SDˆŠ?ÏõûO!›jyõ¯ ä£ëxBô«ÀU\ZÙ÷iv¾q…¦5Ã’t}‘TG8'„;ÿ¡‹™TÎ;®ÕƒRe§¦qY«k½Àަiøj‹”p”Yè¯x!&‹ÞúŽ©YÒ8•Zç˜f…`Íà ­cŒ±W—@j²žŽ4¼©¡;.Šü„ Ò:Y¡L'ÛöÖŽá\^ÈD èóc}q9âË·y®Õ»®»‚´ _1±gç%A„/mytZA®I¶BŸvVÝ3WtúD©BlHD•®ÄwjÑreNX¸Ô®mÝ_ ý£õ°â§Ñ/ŒFC¤“˜V ´Ÿ x ÕÔ¤k~j€ÞR¸It*©þêôà€…E¼±¿°ùðË´ý/£çA&©åõZmIf³Ì´áøGd”/ ë&içâ{\âO%k?Ì:È*ŽÄø½Íøºàãð<‹„¤ˆ²N–~'ÉA"߬aÕ­¦n‹T²jZ— HnçÂ…7ò‹Øg²3½Øt¶ÓŽÚ3wPÜ ”œ[¿éžPW1›®ÿHáøy »Ië%c§Qk˺–Úµw¶“ÎŹÑû6\Þs´rÊ€öpï‚Ò‡ò.ô„ª9z{¼Ë×óu~êÐÌA kD¦v©Öc”¦{iST³“ ’pß듇v¬=;2½ydFyN/Á/‹½îŠÝwF†î%Ú´E ¿]ë?ª*"õŠéEŸÜÁÙQH‘¬à*©ÅXȲaÉ‹6T®–øyœÍŽ?y€Þ‚VA‰¨kE¥8ïöü]Ù²e?‰érÛ$îl'¼“H+¶Ò¬ …À:Y\,#¢]“×÷O´ f%T"ˆ’¥:ÿ´ cܹܔ9»ÔË6ï°xˆ+én»3SÓo”håÏjÍ o˜U·Õaõ¥ß”b¦Úc•‡·²¨ Ÿ2Ckö²Z™ÔÜqõª–*Ò„” ÊZôñÑrQ)kñÝ‚WëY, è<ˇKïHÛŽÄJ•Ñ´x2gìP¼ xØ&DœÖÒÎoû7ïÓ9Îu¾˜-'åX²(Õ9 -Jð$P`%â‹!Týa¨‰ a î¸7qäöÞ6©è¶•ûƒƒ·Ðº"«Ú¤»sd™àðÁZu+úq°ÌqÛ4¢›%M…é¡ò›Q[dð€w -¢|£4pÈ$Ù;,htpXº9`µ«¤mû:“=ì³ÖK‘3BîNöp•¡õú6ÉœÃÛ2%TÃ*7Ò|œµÁþæ!¾ïÃ"L‚ÚzþÄCAÖÇ­[4„²f®1'4 dŸþ+ý"EöÝʱ•]ˆ&ûK€e`¯Z['õ%¥–»¼"` ÍO &oâäÔzóM?´‡dJ&Ñ·žó;ž?ŽÀƒí/n[TȸP,Eèõb¨õƒU”P¾Îmj±îz{ò£l5?nÄ)Õ_:.äßP`}„pÀ’æÏÀs>Ö$-ÚÁÏkµ„ÄîV˵ûý GE+=r^JÕll‘Ýx1}côŒóÂâ æ[Eÿªß€|øÛÅúWIç&—2­†¯Èïµr86¤˜™v òR`xþ²l©¼uØ”×Ø|ÎüX yF›ÖLüua²É̘Ê*OÔ@_Åc(sæ½:ÍÂñÔ¥þ¬‡ú™~T†Ñ7é×<^ UÄt4=ÀÏYIQ4D1T‚Î¥¿}PwÒWåVT•2Ж"΀œD@­ý0p¢Åå )‡ù, ØP~µ5œ%lfj®ß†›œ ´¸+/ñÌ•IÒA¡Ã¢òÿEäâ²SÕG£2bâ†vûMî†!ù=û­ÀS; 5Ö‹eaÞË—Èe-ïŸËt‘øç3 ù<-Æ4ñü3š² Šù˜IJ˜ Û¡£4tþR}—´úá'†í±³y‰OMêÒÀ\¹sƒ­,ÐÊñUƒ(DÜ‹ÿ;ûèfãhLúÞ½õÝ‹¥O²ÞpîÛ»÷ÆïY±Yœ…ZaS×”s0mâúC–YM¥ëã¢7üëE7ßjŽéÌ$¹Kù!#O›Ókˆñ*<…îŒBà X ËìšËÕIr”CMú¶Ï‰,Eÿ–wY„Ï?t"AWXlÝoµ=¾¼#÷Ìi` 7ù‰ \ÄÛPϜܭ·X*ˆn*–m÷Äì™a#Ò!‘ö^e‚Åjs#í«ù'ß0‘®FÜóÖ@ eî%D#ÉMŸ Äa«êª²[Y¡àE±¼$€vQ»:Dxe« ¤¸v¶ ~׎ÐâÏSG¯ùvÎTÞõ(¢Œ %·=%ãm°ÎV$×#¼ˆ‚|÷™}V;ež«ÃÍzl2ÑæA&GšéhE=î ¼>ý­ñæ"»°iVï=Ÿ;e—Á'[„¥÷32Ë÷×›ÃÂl+‰ìæC‚kðhËà¢ÅuþEᎅeRg#ê>M`.á±zmص¤¹Jö"§Ìb}?_§¦Äü0©XžØØ{(œ´î.&Û¿;6íGZ&$>Ý·_í…Qt÷ÛÔ°wùBU¿Òõ}¿g¼ mÃvêÿä‡ì(† ɶlzå"”ü¦9&Îxhý»‡còp?ùùnp$ÄÍ7Øó*,±)]?™ß"4JÈ}»tžÝdÂߦ»Ì¼7ÅÑI† ^ÉG?;ÖÆQñÐ ~+‰Ó qºÖôEvÑb–§ë5bœ¢¸$"3uK~ï8xÿJ¾](_ÐÊ\˜(|OL4JŸ$ÌFX¡ÒÈ¢~Þãu)˜8ëkîjÞ°`#·Â ”'v—D¯ÿ2دí^)(ò°~Y81$eeà€v«ëc¹œÚ2ïÅ<‹ì¼nC‡{Õ{·¨a,F[œ)ŸÑ÷dúQöõ¨‘o÷ÝQ4¾éÊO÷{®ŠþÙ°X§<ß«l-þ!ÄYíI:Öô®íé¡Wíà; %ö„Þ¼#‡Žº ´¿€N-רL«äkí£7j‹®ÇlΪpWþ&U>éy>Ïç4%Š­J§­Ñ “öœªÄ™íi“²yNj‹Cò0ج6zXã¡»km(Šä{D5ŽO(¶QŒœ×ŽÔ(u ~BHD«V»Zš û@úµ6•,b8¤¨õš%ù&ý”RþH^KŠä?7¾ôâ“„ Œü|er{êá·¸ž7€Ú^…Em)?ÿ‚ Ésüî›°'·ÐŸ¾,‘‡a²*ò} Â@ È]§›H ß>Ò¤<9—2"mqÑilsàÅ=6u¥ŸÃ~_ž 4ñ¨Ûßyh*Yíé’€ˆ äTÊû¾¡Ô"XO&à9:ê\×áÜïÓ³3DxܼéÊ<¸SôùkKÎzéeçXc!õŽ- WÏ·ìß™iƒÇruq²VâoÈ¥ly×çÒ‘¡Äöâ­[šI¨7BˆÇ[9—Å·4˜öᙈFØ9Ná6D Bt”[›_רÞL8kQÑp´FÑ2’înò_Ê…ð¾3:iSR>Ri”&;{¥”Òÿ‚q5K{Ž&–|j2ÆhqöÑŸh‹ìwŽyªÔÞ!ƒSa5=C†G?Fë(ö­ë=ä·½¿–É’ƒpò±ÊâÍ•q³ODà˜dœ‰.Æ5˜’¾Ÿ@G(zÄ-õëC¯‹3?Œ”Igš¶{\ÜûcpsR¯«Ä–ðh‚cæ{Âh<„ÎÍ0}˜W s¤¸!}®¾M¬´Èp—\™§”Ýøßã?,ê ¨5­¨«¡’L`{Ø‹?FÞ&ƒPL $hÁ—o’·"ÜÒr”“K°l©ËËÞî°}iΊÎî+å (—ßE¡0~=ÜÏi©÷©‚Wó;7²ðþ6/*èml \#?ïq¶¡%|¢ÌbA$¦0­õ=èØãÚÛOS8Ø/á}¢Ž9N.õæÓ‘s®AR»Ñ¨º¾Çs5·%H]áV©Ko±f{n¼Þ¹^æëš”?m^§†T:üÞn­ZqèÎt*¶`…Ï žiq¢.¯Jšh7¶Ì¼vušø/r‰vH„“uùyëeìqÇ/+Soå“X\ò^w‹â“·b$¦»Z7ßÁ]}*ÒˆÍZ}µ²yóÌ/ÄÈLs””ÁÖk)Þ7a’GÅ`Š´Çbc‡hþ(Ç”T_å‘“o.í¦zdƼø¹x¯Êª‚48u_;Bõ6X]ñ±¬¯ÖD\°ËÖ/ÝÞY¬%ÑütiéÀP8t]Àެi(qÉ6;¼ÿûéù‚¨æj…‡ZŸQ:æ»jý¼ü%[4WöÉ•„X&sì4kÒ²êè‰ä åš·p¥\Ô¡¨¯;»Šqáó.zWŠ«i"†2··íì‘¢÷JÇÔ0.ö/KË(Çùô­=a:‡§l¥ŸÔ«jxÐ:2¿êÇrÖBˆ Qk#HCW=ÌÕ`òü»h¿³Aleëx{õ®¦Æèõelßfr ¼¾…±6Ö.ç1]ÁôÝíÁ%ìfü qg7xÙ°¯vTºLö&–UŸÝ‰\ŒÒk.ÀÙu\hXZã¢Ût\öPö®—Ì“}E¹YçŽK°­ãûx¬ˆã6'kH”Úûwì[§›’)?÷–ÆBZjm”èîY¶û·Èïl|¥®ê½ÿ•nùá›ÏÝC[ÓF0ORAÖJ i‹ ÅP#„ÀÆuçSlb®Ì¾‡rˆ¾Æ4…”u«C{>äþwÀ[ª]ž,fêrrå„í.‚³ûpŸx?Hê™AˆõWÍzcŸ¹·™ O+—‹–¸» ®<ûu ^ñŽbåvHA·Tý/8› ¨b3›P-Î2Ô~¥‰EH>ÅÍ1Ì,½2GBkàËME’v1¦1¹~Â5Ü„õcr–°­c¥IªY5GyÔúšéhè’×v,†2íë“×±œ¶–Aÿlõ¦=²! Uñ‚ý6Õ|¬‰‹ë”¿1U–ü"s£ (À PSsÛ£åäÏÝ{: P=`ŒéRt ¦]=À2rÙ§wâN1 ¨"íW‚OdïîËþ{´p„ƒTã¦y¥/ñ-ˇhJ¼™M “TBPÒþmtÈQ‡¾«¥é O™WE®G¡ìý¶fƒµ»GRiÜO.«`¸œä¹Ë‰ `÷ ô¦-¥³œ}=SäÕÌ„Køõ¨âJµF‰ÄA«L}wÿ¬^Õ‰ƒð-ÊÁÇŠ¡Ëñ‘£†Ð—‡‚zÓË©š5V²zéÀ²ê`…±êûî.ò ¦%eÈvÚ«£­†‰œ1°¹óå @aüzã±ÁFš¥@XGÀC‰¶2®”Åàaž“9ˆñ'EÃ=׿ôaç—M'ˆ]šD¾3üKºŽÇSGéªÌ•àà"q•RXý–ÚÀh—¿ýº å5çcpzÜspC”ÈaRÞ.4ý} CÖåŠß~î¶½m¡rU¥S¢ £LÚ;Ž½ÎƒHT¦–ò9˜Ï'Ζ“•3ü«–bUÙèú½4ˆÅs‡ˆåG?)êó?hÁÝ]~ñÕÍfy‘ÃðŠß&ÅP¿T¯Ëp¹>:iÅu¼¤ÍóxVskŽó5Á} ×J ¢u 2öd4þtÖ­ÊRÒ°Cµû3¢ê,t½’õ*Vå¢ëú`SýîçÜHï'E,âK.eTwZÖNûT ÄðζETEvóFVVD\'ak†åfÀ#ÉêL#Q7Õ‡~tk°ÖåZ[}ƒóõ°,¬¡Ä?0ì$èW´Ø->SÜéh—]rEäõcb[q¨^Œ„ÏÃùšŠþä< wcÝçyYûㆠc€,é€\ë‚ô üh­7yu¬‘]¥Õö^A^¶4éùÖ€½!¾ÕÌÑöÍ@*u? d¥íªÕ†%ÀA…+гvÅžÃÁåÆ=xôÇÕŽ§ù&Q%˜[á¯0ÚhFª3UFÓ‡+Wá”›ÕÁCKöƒÒÁÑJñr^.Mƒ£…âê^ƒd•Õ}¬Ñ‹N´—•6&Ðʇãî,Då#rM]]æV/ž,Á¬âRåÁÆ‘©{âØ?Î *GéñÛ/Rê?:û…ž'ÃþÌý"“`ÿª–QŠ“Û'”߉ ¨ªyòÏg­ö¦.ÿhs ®¡.ÍøàÞ²âècR8 ú}¬†àŠ­ûĺ}IÊqnJè!H·ÒÆÐ”ƒ€x6JE%˜ºØe8«¸„k޽¼—'4º×ZH/7hrÒïøáñµÊÛgážýFAña1ªµ¬‚Õ.ˆýå­¹#¤­2ùPüsçÁãdE ®¢¥5Ó‡`Ý=õ¥B«¡3‰!gâûšTÙ´\\iZÞSm\O\H¨uw]kû4¤ÕÀÌw ¼â¶^ ‚cB«P<¶ &L¾Ú¥ã½›)õD)ØP¥ÔQ¨ÒÍמ•-ò2J§sVmHbL@ ÂD‚$¦Q_˜CàÊŽK(# œ7,ô‹MU[ð5¦åþw¨KÁ¯‹øEÛ¹U¶$-&™xíŽ{›4kÔã¯+ ˆªÊ\œ¥eqˆ-PÜ*NÂÃ:2Æ;T‹œb½4ŒµÍDíK:žóÍf[Κzùòâ æÞžõþi®¤t‰;x¾©KnÃ%;úªñ»¸Ì ênMMƒq£Ýü©®¨¶»iÉ´L¹DG)y¤:žbôþ}-…‘#ߌ³ÙÝ‹IMøä¸¶8T (¾ßiÍéÕúd aq€1ƒJ <ª¦îI†= Íö!q·n}ÍÄó÷ €Ê|›®Vʬ{§­Rà-Ìv'QÈ6“BG#« 1rùeh[—e•àL­¿:Š‹”5YdTR- úeHû" ¼Z曦Ý1ùÓ<õºB]¸[âí¯nÙ¿7¸V÷ë‘wèN&ì'ÑŸÖ™WÆk¯ÁYáúÎþæ`ÃÑ!þº«qM夻ÆÁ[PšÊ¤ÞìYžj@‘O'q~T̨v¤¸ŠÙ¦†àºJ{/Óî?WÛÔÌÄV"ç/Þ ¹hiv&ƒàjæmœ}Õþ7Pž {g¥ƒFªëüàWZç±è¦*èð5­þºáµ¯K:´nÔð¦òä0› ÔÿlÕƒ@ˆ†öøSãØLd„@7kµÆ¾pÞZ‡”Rt(´<é³ZœJ°ÖÑp+úêr{HP0:ì)hÚ¾§÷“e,8®ìyK¡Oig™»ðFÝ®ý·,kÕ‚6gŽçÇàƒ!ü{•“NÖÂVª´ ;!âϨ²†ª.gj¢Ñ|—ð Þ!Ú~'€a ”2¹P&ÇÕª².Ú*s´tp©=L{B‚J8×»ø3ùÿ Å’AÒVgðâ7x£{i®¬Íµ‹ø¿•TãS$­ñf0 äLi’!4ç†ÄŒ¨q$µŽÍwE=©±ÑÂ[ oNtšßÛg²UGïoÍVöEË>‚áçÖa­ä¹Xïo|C—áÖ÷I'Y “>yað™®ÕžÙ‘dúªWõ¸1…°bEA+”aÔQÑ0nH¨o=‚æîzTô4(_À%°×¡Òìoueydo#Ç5U:”ô+£{±/•»ô”t« ªqG'Ö«µÀEOìeìÝΘ³àI7[À°Ô×P@P⯦õÇÀ欯<ÓæÛfÉêåæD¶ÆkâÚcq}Í„¸ê2ºswwqÝb1@/ª¹†al‚¿ä’N¬ i7ØG"6’; ÆOHâõ±O%tÅÒÃŽ˜?-ÐĖ٠ѽŠf3 ™åÒH¢B)5Ù+ÜÉܵÁ†JêcÊÆýP» ʼn=ÛÝ5y‰w’˜kÈîR«KÇõoFÉ¢§Q¡(Ÿg»ÂÌ`W¡–i'KBÛvÿ¶ø£U.6Zɹ-Kå„EØÁtKí· 2´êé@£»³=¶‘™ú¶‚ÈQ&¾Ú>§Ù¬ÝGA–O³Ì^ŠäýìNٲܢHgn­ \¯‹^*c…ãIc—äNb¡Md\±­ZŸÇ³ªÉHˆÛí4l®’”‰à=>{XtYK4Gń̵21šŽsí¿pÛ¹š(Ôs¦vå»|FÚ!D‹'\Ú¢jã'îø:NrôÚe,³æ6f÷°³·Þæ‡\úRœª†M6ë^K­íÌË0:…ä%<ƒæTðÚòãÕ Rò£@•q¸aœz^~Ep‹G|uäɈ*m“L´ïÞA išã†ÚˆŠ<£:2‡Ün‡®BÜœ˜§µÊºº»›M§ðÛØÙ‹jK Ûméò`BRJ”Úî/ImåùB<û¦B÷Ì¢T øÜ’è§–?–ùxþecŸãU4õ†ô­€>¡UòDX{^Ö 6«N¬ÍSØ3˜{¾0Xùbg²³;0I{Ÿ¤›?å‡Ç^£²À*Ò¿ê §ÿÊv+µ¼–ʨ[ßT—ó}KÞ²øwM2–Ôp¬*dœ~CŸÑ_Zìd#š¿#erûÿ8‚ V é Uì g¶”SïRõÁ! ×0| @ô“œÕlr±•'Œ%ž‡‡,ãPµ1wó/œ â?!ÚÆxxö¤kxþï2³KV¾ã0TálC½ñ¶'š]ÎñK&E\ä´Em<ßFŸÉ uÞÈ!9—Y¢ìé²ÁòÌí’oS$‹­þ¬Ïw4dX_Ïo× [L]¹&UøÊ m{"â¡»ÜÂÈQb, 21kEš|ioÿ¹¯°Fž°ä‰È㳺³“¯ͳͮåÚòwjsÁ˜þ™)þGÆÛwoì#³´b·Qh'è9Mχò¦á¨mã¥KRùpÉ5—¾Ȥ 7²ÎÃd¯‡Â6FØEq€k\F7Õd|¿™¬` {¸¹.ªïBä¦úGº"…ò=¼øº´SEVâ®âL(\¹|OÍÑÉ7/C€ëšŸuG ÒWƵê5‡ÿäÞ+ãX³ 3íÄô¤ù8ïÔ?Ìi…mÝ|Û1Õµ*p‘Üzñ½ÜÎ ¸GðXú©eµ‚Ýf¶’–,p„ OÂÀ CÝÆíÊ<Ì”?Ûœñ”þä ~^æT«€ñ¸¸Å=²ÈÙO×G¨<Nßÿ_Üf 2›Î£ÎK}_·ïFÒÙ@BòrµE÷pÙ¥¢ïÆ,€ÐÙýtŸÈý¨8ò—gîŠbÌà3ÅèËD ^_âˆSÔ%›Îš/ÏòášN9“{ÃJ6æóx À^úü &`ôƒvØ\š oç± Wxš>j½˜tD‘ù7Æ~ æ‰~eO*ÐÃyCd$À¹Ù ‚ÍIg­Fm+zµO¯cóDJÆ>a(F1#ðºˆfÍñ«mÚ’2~5%ÈøÊ­6öŽJ†?ÊP¿˜;qŽD({è°uZñÖüø“ÑÙÆ%Æ Ü¿Z9xQ¿œ²™<e邏4‰ªp4 úâ2‡ÂOøA® ²»Ó›Þé®-—ߪ͟¦H=\ŠîÕvÊÝUE$4ËE9ðúAXÇàx– ¡ ”5q±‰³£;.\Sʼn^gFýxmÕÆxI\Ɇ§3ú¬Ž~IÔgÉ_ñ ­r¸ª§>‚Ù±~|t辶Ð$Oê'ÒWlè)>e¶}Ìb+ÇöuãÈ<ï¾k7(úαäÖ}Çß—Ÿ²0TŠmÒ,æg½ âÌŒp+ó’nˆ—%O²ÌxŒDó£ì=å´cTÞIáê-‡ÂøÕfc 8µúàe€ˆÄµä£gzKš5¬"SÐ_(®VA¡%¢y~òàའ7õîk„2.è=3¸`ñÎfªg­»q²G"NÔZŒæ@Ò~qŠp”yåõ¾T†Ðñ°ssôOa4£­-1häIçŒ^YVÕX3b…«Á‰ô;äU Z}¥Jý?‚ÕÀ£UÓ¼–Þ¿@eï­Ê›`1mž¶ù…°S²Ð$!yY„®œõd@L˜Âè'"o'ò±h9YiɉðzP­]0´ªÇjóÒóœ”)œ„ØjªÆ„•mLl’ ja5’l§óV,ŸÑb;;¾ÖT±ßÐ(n'JâKƒ_òóôþ’ иQ:ûÂÐÌ4zаjæQ¨_ðoµ5Ú%êk­¹À9$½Æ˜ Â8Ú8WÕÜÁñOOȱ£ùã˜ù‚ÅD@¼A¢¿ ¿Ìóì‹2™rÍLßúÝI`¹„?ÂúxÕÀù÷‚³&»Ëé°‹Ts0}-hÕÁà4¼‡ÅÑÑØ©áïÞ,Ëýß ÙLŽ4š™4jÆÄúœIȵ¯vÍÒòŸÑâ úA"hD2rñµ˜ŸjGh%ådçM°¹¾JäñW]ÑÊ'ûO!R>¬hocFuáYªx@S-)ñÌî3„Ì&ÈÅKb†Ë‘ýûÅn °9~EîÒ ½Üÿu5 ÷“q·‰mµyq ,á¤óe‹•"OÞ,yÁjäËvx.áñ[-¾6W\w„Jê!A,Gms`XÃÉ+¾„ÿ\Y³sK UOún/DEî7‘/A¿FDíZ³ðÊo×8G¸4ëkÚWZ—å©Gâ¦ÓØ µtJLnìœ[Û_Çzî/s­dTÓ…ì†[ó`øÃÞ¯ÿÌ6”'ÚG|€oy~‰ÁÆ <VÃQ©_Â1=‹œ²ñûðUÿ³¦d²´^c«Užà7ÇV7rÄiŒÿv\8Ü0ˆx53 .¸D;úš—öñC‚ßI¼)ºxT—ÊlyêõGï(¸"Ö@—¢õJOÖ÷ú31ê° ¹Ìi©¢€_…&_üÍ#ó~"–P;b8ñ¡&ЛśˆÔÐ_Ë5lü±ØÌ9¡B”÷TâòžÍõB™ø ÌUó‡½àÇê4 Nÿ]}ðE° ùßHÞˆ×6#sgù¡îýgˆÓ.…]ï C»±|hRÔ/’ªŸ3™BÿÊg´Yáå5.“þµ[}m?GìÑ/`¡̨?ºJ€ù·1¬…/H&~§>èÁ»c8ßRœ»i£|Žâ÷L¶•âóJX”ïDzi›%O6ÎP0o¯0­#«º®!½06{4¤¯ù4מ¼…È£˜¤3Ee½yß%)Ë_¾È˜‡€.€ÌÌŠhʵ"u÷(„<¾ê{ñ!ƒ¦Õå\+ÿ0CiR–ÎØ·0¸Jst¥ŸS0âŒY­Ÿ@ˆõÉŸ>z‹­U$´¶¶~ÏuWÞ–{ö‚©@r/ÐÊ9ç ã®vS|cZAÈ%tAzPmCé=)­—7Ãgÿ¡Ž×§ïÃ8@,…;š©s±€€¦c5ByÖ)Ýr¢¦P.Ë/é©™…o¶Z[A×-Ê—:2eúUÛM]k&çñ’Ü¿‘ß¡tëûkœ8%®#£æ²(¤µZ,%ô $ z0Ðjð³ìl.-DÓ§÷!a?mï%˜(®]×|ae¶Æ0&¶Õº² £Q×Ñ/šôå+û¬áEâ¨aºY[.™\Š/?>&ç XÜ¥]m£Ë¤ãMq‡T&tr‡`Ž!“)EÈ pçѼü ·¸JIã3y‡5à'å t]È7D‡J òœ˜eƒÊh$€¿„ÁU\0O8À±(2"©{J3":òt]ÆÂµ¡Œ´ oǽs9¡.ªeŒ®çcrŸ6¯ò}YØ „Ñ@éè}ö˜ÀÜò‘‰2y+¦M‰âÅ«W…q/8§pÿîMZŽÍPkh{aÙ1y&tüžÙòÕMoó¬²<ñ/ÇÖa?ˆüʯu݇Ójû–,¨Üå@/GwŸMa-èGkD}¤ð©ƒƒŸfZbYÑ‹l‰t/ ±Øj¦èôRŸ”hCå1âÆñ±S@ÖòÁ~e} kÎ º]Ýd^T‹’´WÀç®<ƒ²±›ÐK¥ÑÀiT̘‡ˆw!u@Âp2„÷AÒf޵ò„ÜtFIZ^iÿ—à£ùÖ5ÐsDiërÿ$›Ø0b6Ëü~xŽÏ·._Ï–Òõ…Ür²`wYù;›ç¤²å»äˆ‡E3óùž²ëšvÇ»Ó'Ÿãµ~?— •Fh{‰tëß– Úö >NÀ^²‹Jà-Û[æb3ÂàÉ'é[fÚcBl¹†H(y’;=9ÿ—¥¸Iód¯ökˆ‰'R6"œdÞqît¿œý,‘Žß¢]MöV>»Ñ@Þw†M0®èçã^F`çFÕ²æL((¬±’S¢ÅïÂy§púÓ­Ë’5›íy1‘pÆ{”uxëÈOþ…Ž'¾7+Öº!íƒ c´Žè ~E€×þO¢‹aöb]Á3LQ`ÉB徿Ýh ¸xdce 7¼#ª,C!A¢¿F&Uì ÍÎ à=¡¤Òôõ"+Øèµ7¼¹zÕ½¤ ¹}D²6 ù?×bÍáCfúþVžä¬oJË™ÿ€ø›-ŸEÚÃ4Æulò¿ËûYO˜R•´²vTNè~õúÁÎóg/âïžÇ¿¢-;g”Õ,W¤MܶÞ|JÍ€çØ¼ÔKýF¾)—$N\&§^» ¥C1sà ÓTÆÄåò¿2,õºU'ë\Ï鬘ÒíÄ;?áó^²ÒÙ-|¼ˆÉ$˜L\|¡Ý¿õzŒ”%aí=xÏ9Ú®‚Z†7¼ã(Ìå±"ªÅ/t^ aå³KÁ;ï"7Åßn.E%gì¢i@ß@¹Ÿ†˜¿´:¿)[ÒÐ…¥ Ê.Ç3âu?C¸¹‚ä)tOsÒóŒÊJºþy>±Vq/Ǔۅ9‚[Š$q·QI‚f¯<£>@²2Ô>[ì ïe©,ÝŠßiÝÅh'Ü|Iª$’¡Ù+šûcIäE”tÒiÒt6›ä¸ßE3;Ý´6Õ¯qIk›®Í#®Z<ª:ÄÞé× Jâ`d¬*»ö¬(a+‘Zê mºf'hß®gú[ŠœÓÖ—kÑÅÞxñ`1ã×–7÷`´å£ò<Ë ôcƒ´$(Œ­‹c.æ”=…AfÐX£ª—.~qîôÛ³‡A8zi5ëµkµ‰RvŽÜ%Þ¯ ¼×s—4_ ˆ;<µ$â!wÉužÇÆ&ʼfDÚõŒü²”ªÚfK>¶°ÐPVoN’"Öõá‘§•6{ ,"›W&ð°Æ§´û&RTaÈc\} Åta°Àj)›HèÔyÓW,ªZ{E¯žOµpk.]3?5Ík]¬‚‡Aål³¤!Bd+Š‚y–׬NÃD4¶2мyÒå㙘ÓóXŸLI9Åã0ƈˆÂŒCè–¤;ÇÖvœù½?vîûÆ[_àçºÞ"¬<¸ù‚Ç86<ä\µfòjq;íâé ‚ÂPåC}BùâêUÀÒµN£5«Èm]¯ëô«–’´òÚPËuÁ|Ý‚Õh® ¬Pt„xq_ÈEìNºUK‹¡ïä FåTùk“.¾± ¾KiÙ T‹OÝî-ØEÄâzÂ@§$€¹c€ïÊxЫ/î§6‰Ìp@ÿÆVbc¡ô‚RMgµeaFb½Ç1­V&CÍ¡ˆ_©Š>¼/Âå†y1ó•›ßcºØ„=Kûÿªß2Å=±R"oŒ‡!3'öƒCxHœÈe ¬ñfÞ÷ÕÍÀ(î¥u<¯ZóƒZ\ë…Sb Mêi «úå•è(7g-üs%å³lßÐ1:O,'ˆ¡cT™Z®²Gö™&>ã0ãC4”ayösS°x–ÍýUâ )š š$Ö<Ò:¤¿ ·FDQ+ÓB$sh×äî úÈãó,ºG5Ô Ê¿†`Íþ}”út³ÃWc^NÜÅáá0 î*ßk)}“#­¸ämnKJ´ÝÄNEƒ¨ó vS5ú äÇ/²±^b7i’›tº(>ŸHM‡ ßìæüä‘Åû$ƒW[¦s#8#!Àç8zË2“Õ©úâLÖkÚ¸@ÒK,E Mƒò’\’ýŸn.ÀÀµµ€žÇ/’eîI­ aá³âNÃÛ|¼ç…ö]%ʧ/Y2™·÷›Œ¤(j°ß¨º>*ÊÀ=â;uÌçÒ~y»mAu¯zØÂ[£–#™ÇŸ¹úlŽ@ÛÞÃõìéxâcÝ–<¼t"©âO¶ö¦IJ&%d]*h%U†U¾â¯Üª&îB SÔgÈC\S·âFÿƒ‚T£kZ[8<,”8þÓª ƒ`ž¾¶‰¦R;Ÿö˜b½d>•Ð-l†›¯ô.âá,Ä[k¡–C žnk¾pî5RÝ=\>åÞå^ƒbHê4ýÍ秉3'®¼K2AÀä:6Q?Ý}SÏ„ú1r>kf«d'}Ä#˜]žÇÅ>âàÆŠ~·üòÏe¥nxªfZÑÂoX§OÌsmrT¾SVš=ï{A·£7*ÖsÂpqA•íiÜÒÑŒG¶4n$uÿÇRNåv šºÿ®Ä*ªh]^ü¢¦t*OT²R6¶žÓ@9L‚¿ñ’—>aÒëù6j–f£ƒ·ª;˜ƒ%ù«¡‡¸ á)‚ÇÌ McÓÝø¦nÞPþCÚÃÃWzÔïQ“i$¯Ü¼A¡ סÉÅ<5æi²$ë0>Ô; ]/G#ò+V²RPk•©IY¸Hªp³U¶qîþv»9¿ª×š¸³n¹OV«Q­ã‘%ËM¨…µsßUUKm–ŠLäÅü‘q£—Ò¬+ U_zÅ,ælöõkI’aM¢>ÃÓ9DH’+_qMˆý :åÃ+;þ £iB‰ÛƒŠ¬¯ý¯¢b_eʲä—ÔGT™uþÃ:þiNVÓp´¦[¯±MëëÏÉúÕnÃ(óBm8¼³aIê±EHÑÒ òÖ‘º^}ÈIlGÄ›rõDϼZÄtŒýR×G)•¸±‰9¦hÝýF2uËçîê½: êxÁ'2jU“ÕXíÄÑLÏ}øÏmMŒ°rþÑdÖ.‚Ù°Ï[dÜ€†q$û…­.M,þü0Ê(ÃС=ÏM¸}(C÷œÈµ¡S‚Ùþ |bD¡K¿6AåDŒ{u—&pøñXg¾ð¡Ñi}Û!q[œ…IÝFåb¦èOÊþ9͸Àpæ÷Z¶º¦Î¬„Ãþ~Þ¦?a•¢'žœ![aö¡³jÜPfqíö­±pê%Âúwôô¶œÅ rUÍÆì,5¢S{ׯÌ/Tª’Õ |BCÕÉŒÕ^(úM;ÿÀCÜÎk¿êseD  drâ^Ú(FsêVí3ŸÖ(N‚¤pôlELáªPE/*!pÅëÍ"F<¤€Éˆ“üY#ˆÙß§:w—¼ªÖn’DQ-¶¡Uvæëö w§s ®ˆc!º‰_³üð)Ï"[ìZw:ápWV_À® ;tOTqº5¾îWÐ_%ï+;n6»Y虼:D‹±'Ú FPÂÛ>ÀBù_?<®J:Õ•Id;0‚¬!–ì¤ãàÒr-cÞ{d ò<òÊ Aò{ ›0c\%§¥p9鯪ŸÅ8 û;®(`ádAN†yæ¯ð*‡0!»ƒZàâãíue¼è~xÑr„ô(؉Œ*õ¦äËy“€8MˆÑ$ætÇÓ¢ô#šÂ¬ðe »øÎâ%Õ {‚§ÝïFùXœ€ãÙ¸ð›Óò¯QF‹r‘V¾{yËó‰ZMúg &ôóî.ÕÞÎMM¨×¾ Ëz+¹=×;–L]-Ùó¤Òyìî²<gFľ7t+½iiÙ€gnÿTäWòb•ü<ÆÏ¶»F«£j SYžÅƒÀ 8±c©Hî™ 90ª×ä4°œ²R°˜é]_­‡äqEp¨œU&ÉØò<¡/=~øXâtšÙVû¦×Óó_dŠ6Ô÷nHD6t"ßkX(Ö¡ß{žÓ¸Œ2™©UªÇd_ø¡ï@u) xW0AŸR~Kô×HS5RêùãIõ&!²ã‡µò8½ì'VJÖ$Ô7Qʃ™‹3™¢•ÐòOÃj³Üô:M5¢{- æú°Q¤ äÃ{4¬ Þý0ÙxE™ZB°ŠT²±sÜÂr~¹ß, ëÃBìÒÿOdîíÕšZX(p)в(*"™ùùp­,B•²ÃÏ#+º¨°,» [Ò#¥*„»?ÇqתÞ÷Øå…7ó¶P¥w°£&„›ÂB ¨—ÙNU.$ïT¨¶«#¬0~V;Íâîc²QíGx“²' NAÜãÍÉdÄ\ v_ŒÆCÂ*ô®pþà4Î ª ß™`Çͤñ紪ݤ؜óó†ËÀu#¶N€€Ü:D¬c£ÆÊLääF3 …“|a¡H|S,³[w€Žo&ŸSL#ì%üVþw•]ú5…p*3[Ò„ùÕ˜#qŸ*ߊºîéQ7zp w-J¯§óS±–üÉ«_¢¸Äš’8+›"] e¶˜G‚噘1/Nã`#ì= ÊGö)D¥ Å h·ÒÂ,ÑÅÛÁLÎ0­ŒÕy­t†#¯ÚZ…|团ôÛ~«Æ fM²JŸKŸÁNÿ6 ì©ìÞ¾bT KÈŸ]¹ÞÜ„Y)ÚwÒ?[4ò©Ió¦>G)žJ&d}ýíÜŒÅÓò~Ø0 $´N냿´Èc®pVqí+ëCppG¾ùˆóßeõœõœ6GÌ,öfú8z”Ô7»S[¢S50c­›Ôq/”_9¹jó¿·Ü%×­tQS…“ßîLðbkÂÒxâe¤í3SðXG¸T¤J@ð«H´+†ÆW™íç´upèó`•I]± >W*ìÕ´$FZlEfg sôë¥*|zº7>ù!žI©Åÿ«; ¸ao Á¥e5MB+ Mø¡FËB6ð|fíbî š}ÍÌ­š^§A¾’•Ëâ¦}VnŽØ†ô.¹¼j*À¥-;Ù&ú)Ñó‰A¡Z7*8é±51Ÿ{‡Ïo:g7Ï.Lå7û.éñ²¯ƒE‘c‰Ð‹}tIÙØ*I ø¤¾ ñOWËíÅ'as\Ølð\ÍL¡6þÒF)pm­Ø,€•º·¢ÀPæá¸EW0d¤q]&ÿdV6ß.cùÂ~L´óðCß(¨îMëb#òEnÑ»PÅV½!Àȑѵ Ç jFÇé¨J$ǵÀcu?„4·[ö&å‡:1“&OÓö(øyD~EÜžù·ÐSF¢–ç=RËÉd£YÐûfG¸¤Í§³‹À;\ŸÝuJï,J„?‡NÞ"¥‹ñ±{ÀôÎ%µ øvN1ëÈôDü•÷Lݶ§ÖwŸ£º7ý:Íî•+†•ô$)Dx U¯"q ï×û4úS+a:ÇÞK ÿ÷QöŒ*y ç–5!ýÃ< ïþ¨è|ƒý‹6\ U+ᬮ[®eVéüvíÜ{ÈL+]¬)–ùxþecŸä溰ÿoö“?,‡Ä›X‘:¯Oò9T:1G4qÞ.ÌtÉÑ‚‚ëEæ‡áHԟ׋¬¡ª nÍPÑU7/˜ÄñcªXâ§nc]¾¨XŒPœ‹ayÚGºxª.wÈç¤}¬ÓÏÇž\r—f`¤„ñ@zJnî´a'¾¨s‡Š­NŸÔAëG½PLˆ6ºIQkí úº+äÿ¥ ÒKëÈíTžDø.yžÕ¿}‡ÀÄœiÃõ„äóä1íJ$ŽðdÍ=² óv–¡t5!(«:Ö+Ovl<¦ih^ý þj,QüYº‘îîÞâÄ?a塺Á7ÝëÜÇbÖ¼GÈ P˜MåoÑéïToãw¿dyçëÀã·œó6ês\Ô…‹R;ÕXÚ»ûÿõåöÁ¡\Ðs·~=ðÈTDŽÝCCijÚ`¹ÎŸÔ¬\·‹ðñ™_“ÿü§™¯$Âõ9j®Û¢_]L“ù’¦8áÌæh²»BJÖÛn¼ûXÏjY—”8Ò6騋í©YóZtÛt´Ìn„íUè¨PGØÊzAý+ÚT¦M1¥e¬åx£4AŠ\ˆÚ‡2;¡W³Rø}×!ÔÉ0àehyXÍbKÏÔlwæ l_%L;8ê8jßQüg-í× X¬ŒA•JòdÔ×Ã~Pl¥+4øð7ç©0òhذáÐQ@s<ëÍÚ¶}Z‹P€åñ µ˜‚Èc×?ׇÎXªN{Ò¾oçÀù;ËÙÍ@ê[våÊ)÷3šuEzØì>BÔ?t_Ñ ¼9™G´H|®Ö²ñjóèOHgäì,Û[$¤BCæ °õJ³öëOP_GçUV'žuƒÇÙ/{#KÑé¹™˜qÈ~|Hë8àäpz2Þ8«H8*M‰œû’wÇÞºå Eª”pÇ !}¡1{¹Œ_ZšlÈë¡ÁŠ;u§·+ú,fo ä-AÏ[HM¥×ÌÝåìtò*9¼Â^’щ§a–‹Û`B>/Cö0Þ÷ðišNË­þÊ âÄCHŽ´–/9fV.ŠÎÉó”6!œvóÑ@ƒ ðÉ!w±y;¯m$i¾äµH+·]YA|åÀD!j{‘øEÙ×ZQ5»¶'vgêæ¿ux”y–#Ú^Ž´¹Q« 1ªAä˜ØÿPâ'4R‰ÅU]¥‡xý'¬¡Â>¹æ’îtê€3Yêy.·¬4ÖçæÍÕO“߀®†×ñh’¶˜ap(AXž|§©Î±¿[‚ÎP§k vá}¬WŒ(átù?þB¾æ ÓÜõ'åqMä±ýE½ŽQéæ.Eö“g¤«¾V _‹ ”hÅ:DB¼ªO^ÛðÍÌkUü°õÒ| ¬u ýÅxTõtWw!BQE–NZ˜ª9Pvíîs³¹AÅ$vÉ®?·-~¡ò:ŠL34ú±ì0=§§ PøCV9´IØ{ã=Ž·ÓB´K yѲTp»~Ëp çévÛD5í¬ð2Ia‹¡EÛfåÀŽ„îŽ9’-v‹òIÇëmÄ»R vDo’ÌÎÏ÷ëí8t7}²³U@èpܸEHÕŽý[ï´’´ÈÎx·¬®#7 >æ &2Þ÷VõŸœ6ÊnæÀ­NÖÚþÿñú°‚Û…6[þŒõTo¾¤tœ®ã¥VøŽ![ ²]w¼­ ?r$T]µÖn°ïìÄ9?Æ´OõQÚOçU­§Y34WóíoxÊ2î½JÂ@Þ ·–݇_ýÚÎOeüõKŠÂåýÒÕ¶~~Y‡ö’*Ó}+«r†l¥‚z«° :¬Î­>2yá®GmÀúÀ„ ¿”À)Ûäý±,ƒ¬RŽ~––• ¿9e(Œ tÍà3ÎWZŸ«IDÊ$hDpãëYGÃÑÂÆ*ëq¾þîæÔn7T¾ÅQAT—FZ³+žÔu\7`äpß$ûòðSdSÅKôB™Ke$<Ìßšfœ¼”“p‚騸ag#au.ÁÄè6Ý ˆ?áÌcQùí!;äùãÀdõôèiÔõà !S½øIAúiù7ÞÃ]×K¸¾1|bi”e¦9»:…2)\)1§ã¨š†46?g¨Zgš›r¨'â 6'BT̰?©Õ_ÉD[2-8?± %_í/ê¾1%Þ2÷ÃÉ;ÌÆä`¢Q ÇI ý´‰#Ç€µFB P ˆÒõUwŽYdù>-µeˆ‘ÌÄ@Îå³uãšß€ý^T®®ÿÅN ôÅ&Å\lð6Ý\PPÔâfÎåzg˜Ú>B¯Áà!‹/P>8Ýí#PëV¡׫»‚K˜éù×DÜÛ›ñ#¶Š_ÊBQÂîZlJh ª„—mOþ'Ò5ↇ{°1”W(ø® —= æ¤&ïZ³NtÉÁ÷œ±á#Š»2©Da=B(œõxing‘:öÄžö5¡Ãջͯª—=¦èa:ô+j9…Q=\]<·ÂÑÞX, ÌÊU àbïIE8Ò¾ž*}»Rr–º.uR“H#ì&ƒR= —Cð¡z¡µ[“u°êßÄùŽßë"¹Ü,—YN~_U'o[g¦´ÏKÕWSÎ’5³ðL51œ¥ýÂ7Ùðy¶wúCÛúKŽ:XãC —$z…¾ýØàÒ²Rªí{Ì=.Õ줪Kš"²ñÞ^Ð <å½G í¯è”;0yøq Æ—¶ ¸Ðb9ð}ªÌc…ë rŸGµÔfôCçU棖0e²ø1MÛŸƒáï ³¿igÂêFõ/™¤‹yˆËåÝ~¶‰]\š<š^”‚ëÁ¬‚úC¯ŠI¿(T¼U<´ÆÐy¡•ãjÖ>V»HYeÛ+3¯‚áLã^Š_‹]c–vR –‰ãÒ‘ ÔòlÞÿ{!‘}²æ¯5âeœ8rÿNç&°³:|®Ûr·”½¹>U»Ýáaªp/÷SÔ$ µ´o>rP$Çî²UoicÕÃÏßëYéŒò“e»ê‡}ޱÈi1ñ24¦O­.Å>“ú¦µ9é%I9ÄùZX<‚QË  €on- šE3–?­-ƒbmïO!͘ØP;o3:]©u’¶eõ:#ß\ßh±_`ÊDLYF»"úQýHÍWÙ¯° H3'–¬í@·Ø£ƒ9©W²\hAºª{FñÁQ¹›57ò)°k½« ú^Ÿõ#°§Ç‰Õ:èM¥|åH0)ÜÍd8& 7tɘÕFÛ@ä¸QÆÜuX¦q>ÏÏ…ì«Yš}W ZÇ ™(9ö£¨ü|Z*íØÃôzK£âißh°oÛ²¾åH¨ÉH6í-/>N©Ç=û¸`0-hxõ“²–-#¹ßBWN¾ÁðÚ‘Þ±ŠŠ/úĉz¨~IÓ{‰nÅ]ê4õuµSظ~xª´£ÿÑ¡‰Ú5–:‡I âšÑRSÎ CKÐÙÖXâ ¨¤çi!c‹z2v#É+×XÌá°§×þlÿˆÁ+’b*¡ç#½@8(E$IÍÀ8 8ï=­ _|( 6,vzTïÊé›2yabÎ3Þ¯<å»XˉÅh¥â­ž¸gÔØÝœD'Cí Ž2å¿Üv3 ¿Úé÷71á¶9*Ìã<Ú£Òÿ|Ì`9¢A„;’£4ô­™irÄ|œa¹[^1–pÔ¥ž :¸[쇋q€šu ÉšâÄÆQ—4“aUžðáß¡O5WlInò]ãj|XÏ]ƒ/77Š%‘¶‘gç׊pJ¿”€î‘º§:AÜ«6!4ÿ¥ t#9ªÍÃßlç/mÛ ‚m§¥'Ìú­ÅŠU«(9Ý̯‰;­ ›AI¦€V†m¡Rµ[æÃVG Š#Ëè¾ÂŠÛWoa±ÜW)šõ¿uÎûñó`á…}s_ŒíÕù?ŒÀñÖæ>›\/L-s$’ž%"Í3æœr›£±9ö(ò¤<æjŽrÆmHOåˆyr<-dzƊÍ1­¤ÑRèq>ßÿáûÛ÷õýüï_?’«¦†gôÊY AOäxåõõÕË_?ЗIf­Gâ(ß\=é3ßí ÀýÓëöûcÎ=ÉÐÎTa’üÍ‚8™]ö¹mg:=Rú*@H1S¢ùჽ~Ì8u_4,›`¬7ï Êûc0£jÜÖã­ _Ž)‹è›íÄJR'šØ÷=~Ý £Öü™ŸVAûÇamÏ·Â× SïÒFҽϊ·ºƒ®Ën.Z×´”\£ÁEH@®2ÊçC¢‹n’½¡hÑâ>º´¢YÚX– )dS/),÷È´:ÞõH:CÉ 7ÉVy0|–ŒôÉÏjx[ÙÁ‘nne€™êŽ)wã+ zv uV-R²f˜*éŠ`æ\„í ^„÷ ÿ`r1ž|yÅ-Y Kx‘åòëÑq¸çÎÇÈI#5¨çû,'µ™‹ ŠUÚëˆÎCDøõe²Ñú$Á½é½O„—cø»Éßs! À‹õE²©)8½îœv¿<Üî|è¶»BÿYw¹·ÌÞÆ¶â†ôIÇ.š>¾H¡n¬Éüׯ*m«¶£L–‚£#7È?¾‡sÊNoXµ·à‘MÚ éûEü{42zq;u®}¨p©?Vƒã ?ó´ZìâþÌ%6çùä½ÿ$qÀÊcOºùdewæƒn–årÖB½df‘ÕŠ;­t4Êe3#ÄúÀ£çP=¨Q̘ÕþºÑ\U¼Fµ»â¯/!NZ=>½éú©,EÉŸ|ªQafu,5Ý%Xw%seàØÇ™ÇTª BZëCaßî;zÙ"Bma¤ y=ÞwÁű~ÿõåEyV/ƒÒ%q¥Ì^Ç 2U¸âQ³1—y(¾&—¨òYùÆ–«}ˆüx#Á˜®úÅÿƉðö„.i8 Žçc^z Eý¨_{tÂp¥™ñT`mÒvEZ%¤ðì(#&v€sðy‡àÔóÀ§:?äIIö 6²¬QªMÚŒIµÈTã+¤–i—1âN¾8ɽNww²Îf—¹ˆ¿kVr‡²ù½ļ 4²¹ÖâßV±ŽÝ£hyH”§^b aö6–ŠK“ì»â2ŽóÎ娨|üËàÇ’Òˆ.—j§·¸[ãæš¿ï`¡÷¥””‰¾ 4ºê|B‹cĪÐýC~¢6A¬»hå?5µÎ šü›­¼¶ÙOÒÎ{°m-°õ‰1 îºû:h*µVØŸK°F8ñ‚ªGÔÎl„~V3ŸÄÞ–!ŸbÊcÞDœGë¯×YlŸ(.ãâÝå`£=cüЧýÔb£ÄèM–u Íëve«‚XîÝ£„#"VØ–‰‰gáKÔ?öþ§®êϺÝ‘¡ê[3u˜×©²„Nµq÷Úߟób¸l“6=?'« ^äFÖÑ4ää•û5þµ)Çå*y 7í?NýÍ‘'^õŒ(*œ™C4€f;3ûûn³i|nIï­0uo>#n³yµ¹5§*É»&Gtê;œc.lïI*g¤c·Ä³Bõõ|û&µÑ;qÿ»²\ øÕ&Рã!ýð”È\iŠ^ôò\å]5ƒ¬Êú8#•èsÃÑ)ZÎu´øõr_‰öÞ7Ú¨æÂÔóÏÁøªZB{íºñèg3˜vå·4‹_®V£ç2Y™SÍ‘ÚEbØùÁ»Ññ…Ó N»³Š˜º5ž(§…éðÜ}zÔ2Ÿ2T`¦E'ýX®WÈô»&Â>9=ay$àÊGWdwÂ!f·¹…eMvÖ=EÞߢ¯ò^¢n`ZÜöQ!Yß§µŠã Œg 9îî~ýŽÚK°ÓÑ*ȃTt÷ ØLŠ Kû„'Üdš§éËpôKÜ~¯” ÒÔ «u¨¶yvù`RTJ:ÚóY‹~º¶è’!ý›1ðºP!y%µRÕ֑ׄbðó°~®_˜ñA=—ùjÒÜW!þy0Æ¢]ìMºõ$ÊÍD96)éàjM[îÍÙù»Š‘@y»;«!BÌaÓ;²ŽÀ ÏÞî¨ZÚ8‰Ýà ŠìÏ?å²@ÙÏû¬”–W$O9²ö–ßÄé«¶Âv(r·?,޽ø‚?u«–¬§ýéøZÍñÉÆSêÒfæ„ÿ ÕÀb8ÇxØÝ¯¹ÅAœý„öµiº\É™I$À}•0@bâŽÚÕqŒ9s'XݬƒhÆFÔôç±I4 ü¿ìÿÀÿpBHŠ !ÄÉ„°Ä¤xBXzT8ð_ãûê endstream endobj 90 0 obj 100443 endobj 91 0 obj <> endobj 92 0 obj <> stream xœ]ÖÍnÛ8ཟBËvQXïO HY²˜é iÀ±™Ô@#гÈÛW‡GÎt‘øˆ’®>R4éuw¿¿Ï·õ?ÓåøoÕÓy¼¿ÞòËýøtÙnWë/ó¹×Ûô^}ˆ§Ëcþ¸ZžNy:ÏÕ‡oÝÃ|üðv½þÈ/y¼Uõj·«Nùi®ó×áú÷á%¯Ë]ŸîOóéóíýÓ|Ëï ¾¾_sՖ㆔ãå”_¯‡cžãs^mëzWm‡a·ÊãésM]óžÇ§ã÷ôڶ¸¶®c½›sSòü1ç–¹EÌY˜Y™Ù˜ ÙçÜÖÍùŽíwÈæÒ™#rbNÈs‡¼§mܳ½G˜çnýþ@€?Ðàôøýþ@€?ÐàÎìÈôøýþ@€?Ðàôøýþ@€?Ðàú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_á·šsõ~ƒßè7ø~ƒßè7ø~ƒßè7ø~ƒßè·RŸ~ƒßè7ø~ƒßè7ø~ƒßè7ø~ƒß9þŽñwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßátF8#ÎHg„3ÂÙ¶ l‘Îù+Ú²rÉæÿ Y,h6¥;ÑÈDt8. Pi|ñ€Fv ¢±+íåK÷ÌèdD†TôÀŒg¥†u€NmÉ-^F ̸>-AÍÄNèÄ…²,²éŽuð¬´aÆ`¥Å‰ALt&8eÁM‹³<—“#artË„F{ÇN‡® tÛáÞ®Lˆvqè”ípvÆv¼øÎ™Kû2ž¥=²æn±•ö=Ûaîzf˜»õ1þûå‹OOgñôË$@;<«) bÏwW<}ynS—~y.®X§G¡ô¥)›Á°ÔÁõë ¨3,uðîÖÙÿdØ@±ÃÿÚ˜«ãÛ4Í›rùPvcìÃç1ÿûKáz¹â®ò÷pר endstream endobj 93 0 obj <> endobj 94 0 obj <> endobj 95 0 obj <> stream xœ]Ánà Dï|ÅÓCÉÙ²Ô$²äCÒ*n?ÃÚAŠ´Æÿ}1q)†™³Èc}ªÉEùÍÞ4¡sdG?±Ah±w$v{°ÎÄUåÝ :™Øf#5u¾(„¼&oŒ<ÃæÓú?„üb‹ì¨‡Íï±Iº™B¸ã€A‰²‹]ºç¬ÃE(3µ­m²]œ· y~怰Ïz÷¨b¼Å1hƒ¬©GQ(UBQU¥@²oÞJ´¹i^“JN9»ž.Ô2Ö0sj’gÏ–Çáó{‚ •ׇ£m˜ endstream endobj 96 0 obj <> endobj 97 0 obj <> stream xœœûc.]³жmÛ¶mÛÝ«mÛ¶mÛÆjÛ¶mÛöy¿Í»ïÞçÏ‰Š¨ª9FfÎÌ1³*æñ)¡‚2­ ±¡‰˜­3-#œ…¡‹“’œ§ ­¬‰±Á?8)©Š…³µÉÿeEªfâèdagËõŸ¦ÂŽ&Îÿ"Îÿx¨˜»º˜002s1²r±°010°ÿ§¡#©£!©°½‡£…™¹3ÁÝP¨*ý¡¤¦¦ùo„‘“““ÀÐã?' 3[²ÿàÔÕÄÚÎÞÆÄÖ™›@øØÚÚˆÀÌÚÃÞ܉ÀÀØØÄø_1Ô ¬M¬Ä,¬-ìíí\ („)ÿg”e¤ýçÄ EJ nbkâøOIÿæø/ÉÄìÍLþ­v&f sgg{.zzÓ(ÓQtN¦t¶&ÎôÿÄ$µ5¶³ùW6NPPÿr±p41ú§xúÿCs+[;7[¯ÿ‹1µ°5þׯ.öôª¶.&’"ÿaÿõߘ™‰3+'33‰‰»‘9ý¿&Vñ°7ù7’ñ_°­±—½=©µ“‰…©É?(/'WgG¯ÿ_⎠ Œ-Œœ MÌ,l¡þ;ú?°‰é¿e œ-Ü ´èþQ’€á_ÇÝéü³üÆv¶Öÿm.g`cBðÕý_BBvî^´Œl´Ì,ŒŒÿHÀÉÆ@àó?£ý—ÿ©Á¿¡ ÿ‘#Ç”´5µ#àü÷RþÑð?Ê! wý÷¾& øW_Süøÿ$içladòOËüWcj3°2üÓ“ÿ\ÿφýüµíÿ·NýW,áEúïý_йX[ÿ› ÿ.(Á?ŠØü#* Á¿Tu±ùß>6Öÿo^ÿËüÉ¿?¤BvÖÆÿ‹”t6ø§A[3ëÿ”›€ÞÂIÌÂÝÄXÁÂÙÈüß{î?U[cGk [;'‹½=hþÿIs #+['§–õß8[ãÿ9-½¨­‘±…­²ó?Ímàhü_À¿h#GÇ„þ·µþÇ÷?Ǧÿähbânbe± (Â2΋ä„`ü­l- ‹¾+Õ¾2RÇï‡Wþdä÷æ§¿9(:|¦‚d3kÝWõr57õ£Ë½Ø­P'|}ý… J¨º~ì˜CqøÃùw†Ö¤yéû¬®çf§6ó9˃NEÿ‹$jºÁ_'¯µôÐeU)“P@ä"š‘+–¯Þ‚Y+‚>$G5 ím¯Ìì<õÇ G¬ð«k™i²§’lÕ—Œ‘]yqd3i#pCNå#ÁˆãsƒóVïüҎrÔ뎿³wÒ¼òíp$L{ŸË-KÅ®WÒ|è Hql0¬ë pþŎdÖ]Â`Q‰JÝô=ÐŒ)lÉð3M”h¯}†®Ë-ïÁTB«#þ3æÇÝÖz"´”1è‡t¨ð‚ ƒŸ¡qaqXÚAG.‹ v€Â€–8BÒ“ç·ZÔ™'R49î”УlkÀq\&Š’bÃ"¶ÉYOOô˜ _Ä%Zy²c˾Î+¿ì#Gæ$Œ)õs㯠ž/ x[-ìàÇÿ^^9L¡—yãÄõÆ‘…÷¨ zR?l¶c4(MÕËæ ”ÈøVõ õÒn‡$¶ôà½eà9î(ú¡"ýì¸Çi¥ˆÀgûಧWd©DUé%j½r•m~2.zYv™z£Õ•"} G»¾œ9—OÛ„û&¤©Ìì*8K¼&¨r—ñ,CLA–û)ˆáh?½ÏßoM&íч#õlÐmÉÒûùV_„NJEç">ñá8l«*ÇͬK¸~?8Ǿ'2c {(‡o¼ö‘[m¨˜jY†Šóš<Öõ4J—øÓñO‡t¦Ú=n°@#ò…×°Œá„ æ8߲̋z¬å[X…‡Å–·X ;\œ%ßnÖŸù*Ö¶Uº3y-«±†áT 9ª[ ò 3¬i¸yݹ{‚ßý¶¡«uÀ5ÿ'в0§)¸t<çvHØ8LËáYæS»{„U kô«]ÜO5[‰ÓLóˆ³ð-ZâM s2ñTï·`=c§mÏèÓüáCÈû°-V~™U~ž×D_û¦š]mÊN{ÐË5Èô³˜gü0¾;úÌ~SˆŒ=92Â_&ævÍ3( „W%€|´³¾25è¶»¸\Zp‰ë¿ZÛ0I‹ÆÐ¥…agC·BO´ª*$-üøe´™ØC#5¦^¡7¤>3±”_Ìcoæ˜áüªÔOá.A×ËþgiDQ’–S7º͵ÒämÆÐVÔÌÜÀU¡ÞYM‹O`€ÉFËgo}QëLœl™o¾»ãC7„D|ôáó8½˜!t8dš¶ ½Ux" æF¥¡AŽL/2h’ò`WA /®V_×"柆³ã¨C ýWètõ&çÑ8ŸbÀïCc¼›«qá)&º)Qû gðÙ÷¦Ô<À–5åp3ß(²#À‰2¯ Ã/ º3°2ü[‘óp¿ný)›$/“Žˆ¯ó0¡‰«¾=§ˆ¸ƒEFͳœìªÛÁbôN-£ä0 pöÅßx‰_úÊÀq>¤ËDƒq‘b¾Gžá…¢û˜ x|•0¸—É+ø¬] ^ËR¬1éè©*í¤ZÞÙÅ‘2Á;{Ž{;šBµê‰%ýþšÁšÅwxâ«–aÞ®XÍ+Þkd¸ÃfÁqO ‡|Ö˜©x#A «#>À „ºD âõíRŠ;\Œ%W™´àÃeøÈ‹€Iµ\ Û¶d³–Œ«•bÁXò;Ðû¬f™U8©ÑNþd+ÇïF±ížžÉižã¯¥ÜT¸sǺhÃ_lq#7¾}ײç×2Á/¦Ä>†Çœ0$yìæ˜¤j Ƶz×[ZD­Ý8ÆPÓ|w{waË—hÉpì@MûŒ…1^‹ñhägøoD”¿Zº`ÕO†ƒáÜ9÷¢8ï’¡>4…0g5¦E@è‚ Ì¤tî•{¦õðJ·á`5D¹Ê€|>Ï…Œûœ+ D8û\b»Îòý“nC ç|Ú(”Y$¬ÑÝaY‚ª± ?Äì0.LЈ4ñÎp #”çÑ \Joë¾c¶¬É’¯NõŽ+Ã\ä]0(Yn ”¢Saš«8W=ô+÷¨vÊWõ{bè¼¼m‚æ²CÏ< è¬nË=ö#¼™´†2¸aðj ³3tÊitÇáEo;ƿ׶¸á,2óE±íµmbë¨h;É;ŽÆíÅ»5Éa@€ë‡˜„¿\͆d`lÔ0ô!耩4<Ò:Ø€‚ǃ³ Uv0¾“Jèø°³{âx×­Ê2xÁw|Pk…/Köúì`/påGÆ SÜá=^¬ý[I5Æ,¨Å<|þTØxÒ|î6 ŇÌÃóÜÐÓù’óQºŠÝš’"C¢ÝqWÏi]¸0 cèݬíÚ¬Cû]Yï—L“3¢OÔz¨œñÆ~IPÍß^,w-Œ,Š^–oû:êÌhç0xæäËâ—ë¶m(Ó{t@?PÄšv{$ßé8»¶æP¾Ý@á *þèÏúîr.ÐÊÞËY7óIÜþè]5ö»7Ôp¯ à ÊÿÉnÚ%9Æ÷|èÿñÕ<ÒϽ­žçÁ¶¥ŸG¸PÙxQm½c€½R$•zÃÍ%еS ÅmÃq¡;”~p>0ÊDy;ÅhWrÃîàfá2l+5Ñä“‹ºkTfŽ$î R·ÔøX±½7o<=úp:+qê3WLŒ •5>{ˆ6w;¢L=&XуjöoêËaŽ—¸°µ OÈikÎX#L€ôG+ñî‘Ò ‘€,)ùÅíùä*v «é®% sn!μ, ÓBÉýªˆUǾ¾¿â¦4.GRú//DKl—ìõ/Ðù[ü¹-ì”ÝÿÐ-9ͼY+h¨•6á’½mua¦' ‰Ø)­)³n\T0›gþEÑ(BO—n-J±¢½‰ÿé~ÒÊo˜Ît|Ï,/¿”࿱ÙgëV¶ˆÄëTðùæpÒn’jÈÏ¥ñ*“x©÷k3† Òê?!±‡AEf·$P5!JQ(â£ÛàÀñèeø¸ÿÓú_o…éöó +øÈ‘ë”»„xfc dS²V¡ll€så[àOà<ï… ˜’º—{ì1’R+²Ø¤Õ[º0¯Q¥îúVÁ¬¸ãÂùâU;½x¾ý2ò>_9—½"ÀÇôÞ®,¬fP"¤|‰¼_–¹Á0„t™ÉÄYt˜V%—9ÞÄÈ5îªæg@,è^/·È:ùÚŸçCji®rhòW¿)¡RQѪ J>é§=ëE;sòÄM1á÷›–Ò%mv¬v #8`èñá'om0 ¯æ ¬„‹«f…<M2ä ë&•ÅñP dÈqü6æ ¹¤D=qvì亠®æ'U»Ÿú+ºOË¥âl '‡ñbåødªUA2 ̦ P˜þ‹|ûfB&ôDVïXK&­6ŸEáx‚"?ëUþM¬= ”Ø]*„75Do#Ù«ìJ¹ ùŸ×{ØÓs[&Y k¢øœ3¯ŠaÛÑ——jvß»÷È>³5Yfï[ßz!¸W> ‚XQÅΊ†¹»Uiçñùì 餯SxN4‘DÐâúEÊhQžd#b$ÁöcIüÈ k7©¦Ž Å’ 5Š·…t‰¶“”’gL®‘Ñ@3h”¦Iôe±›»L¼¢; —Õ[Š—i/ª‹sü=ãº8S$î“ÎS|}ÅT­°T*ûÞéb)—`D‡LºSò‚ö_÷ 6#Ï1´?ùUèCé 9ÔAé[ÜN…[™„ÑhX·( ù1ãPÝSõXwš*†Ø˜”²ÅÍÌe÷Kw½tF^ϧÄÊ•Ãîꔜá~ìm÷2Þó&gê¾å®ã6öøbÂA’°»JŸH;†üîvÈë]˽í˶üÍ'ƒ"Éü6m8H¿¡J¨*ˆ¼X×™rZû§DšYéKéPç@囼÷U:,Câ¶GG44¿ßسë9Uœ‰‹3ø¡B_¯7¼êÏh7q¶aÍ”²c½´Où­Eþ³žÔWOÚ{ß*R‹N09<ÆþôbPÝ"ZùýDÝŒ~Ú]O„¦ê0©rÔâS§ˆåNs_ñºT“j³óIibýˆh"´­ûÞwuqI@š€ÛûãpX޼ë…Á^~[«ZBÈ/õ›TÁ”Ð>qnU»øÈîe C’ ”õ}ñÿ¥]D,0¢Ó2[›¶'èsî=4?Có—kæG›4«ZÏó_ÑNÇ"<ûÃ-W–«ý½ÌŒCsé­®Ž5?xãñkÞÍ¡.ÌÉWª·µ ±ç–¬…­qã*¢©¾/Ts8¥èì•¶Ç8­xãmÛ¼ê˜5ÛWWn©:T©ëŸsBÕ­‡ew|üjÖ 3$“ªëKçï–%W4sùúF²Ñ!VÔ ðsº6kÞ\¤†òf,ÎCR¡‡<Ú=p‡ÑÜÍÈF¹×«©Ë:W$ÐÁªüÓ ë)¼óå× ‘Q’Úéi |¶¸¨·ƒØLxFÁ×Åäçg#êû‡œ]µÂw@zJ†y×ñ…<þ”iˆ >Æ‹C燈A0 Ͼ®l×'huOŠÞÄ»t@Êè½I[ڭБ%«ãÈ0ŸzÖ»kN²áÂD´ŸGš¢ß•v©”iZ°Ó¦“ \Ë7 â‚ÑД"'P±ôõ[O\õ´wŠ«æö¶ð!†whjb?ÎEðcqÿ))î$ï·¤ôH$o‚Äñ;{n ¿ ˜Žmˆk&%Ú¥ÁúæˆÉSùÁãCr—㸨gD®×Õmjí ;Úä‹LxKÁø2Ò´Ì IÚþaËî„€áBc6—)(•Ñ-½\ê)÷Ü"v¸1É4»áŽÚBbǧ©žm€GšöRÒ?vk¹¨% kj·'îzC!™>†ÎåêŠíɳÜÄ îkçäÄ"Á¾¥U Xí3òãÄ¡ÿzAáßÖ/û%R°F®_ûE’‘_ôHŽÍ_;êrÔ/jGö®y&µøÕv¤Aè>‹€òÀ¥ºüóϾ:ýC7EÍG@úu°œ¡%Ï–†‹ì! á5Ôq]xYÅïàïa|‚«{%sñð À²Yî”$ºMÞФ«C{6Ó‚<#‰åÕò¼]Ä,öå:SÖ`>ù­Î!ä§R`|ÍMR¿]»¹),“/÷{!ŸëÏþ/÷'[~¦³ñÔß“* QŽFGä•¶È ñóœUÞÌ%¶,¡ØqäÉV½‡žõõatÀ…9ÕT&eXCFuKS?.eø‡"ßâé~誼½CäE÷qfä¨Û“9£œCyÑ’ÉçM[Š2 ±0oÕíð¼¶í’>bdí½v6ŽŽŒøÒLw2YF™WÙVô?7¡;Wƒ lš?«ýLéÈ@Ò\[¬&1.BèÍõ7V¯uˆøý=m'AZ‡Z St«—HñÙ9g9»llW¿²PV(!OCmêÑö17@¡åü£^¹Y1Ç2«ñöÆ»ëC:<jµ.À’¼zÒ‡‹÷¦yÐâD èˆcÃQ‰ôÍ¥‰ŒÒ=‰N° ¬©RÞ{z >&¹wÒ•×ì´áѦÓ»ƒØïfÙF‚Ñc%¶ bÞˆßØ¯«%‘i÷èψÍÝù÷PqLC¥…­5*i²å'IHÂÕJØDå³Iùa_…“}lgÀ %?@úŽÝ·™–¥*ê G£äjxd¬„_ìñ{¶¨ÑF¹ê‰l£ï‡j]Ë|Š^=P0ø÷‰…_;<Ž HfGØ™¡¸à'Âu€ºoãhȺÁ²Þÿt«Bb'¶!@Ï×1Ócßê¾<åÝ€ì¾QßK2¶-¤ ÆÚ”šÒPÈ&QèšDºAÉð²à0È*‰¥æì-A><ØèKDTÉÆºS7L´Â‰Ì÷\á–½ Zè<4Tëô\Ô|ØcõüƸÈóf‰¦+Þ½UÑ^¥[›™F£•DÈ:ù£d óÚñåº\e42¼[/3n¯j{?úÚ€7NØ_ÍŸYî5HeHÄŸéiüåÇ첊ÛHStRv¤¾«7J‡u£þºÖ".ø¬w²h¤ lD fEBDGžO*ꪄºÕ¤mÀoH6øÂÿ€ld‘ð¿±QI'ê»ÖTúŽ}´àäÄݾ ‡°EL”œ/ûŽÎ—55Õ'”}ˆ©3E¤„Kªè8]Mžà¸>/{`ß<úöaTbT®rǘ™;÷;Ú$ =‡š+W–áÑh(hç56eýy—¾²Rl"Íú˦z¶™2ð4ËcÜË~®ûêÀa·^ÈžÇ@ÚÇE«§¯Ë\ÿ÷à^„ô—ûš%ö4{-ûÊÌÀoÑï3lù¨ 1t °ŠT¤¡krü˜†v,À$$ô(JÅÂ-Óã#4 ÍÌÉ¢wwæÜxÕ³*T3 ýqqhöõPHƱõžš_n6g’^bzÉ)¼s§œIx1„¯÷]n­èOÃ:+‘'ëÑ:ša{wå3tN>_1R±¶„ÆÅŽb/ïX9ÝIô$OL¡¹‘'6N2ÙžX2í¼â™ü¨.HÅtÜ™ò~“ští¸F£î“N§DõAM‚ü¶ßÄí²)‚$v¤{_¿I¾•½Zžž€-Î>»-ù°7oŒåù¬ßduYI¶´@Ç·Ú†Ý.Á«#‘Ôã¹V)E^@i<ˆ7&î›(¶ÑÐõ ì‘­¬hÖ÷á_Á•8êÏC¡Ò`l^%1käH•Þ1Ð;̈:ŸE ßq2»¾v'B]RŒ’Å&µ¦ì§»o™Ä+EâHa®"É‚5'ª7Áî˪ð9)Za2$ÀBF8¢¿7 *ïÔ¹?ÇЊ- $Ë"ìþ0Ý· (øüJã*u“±jÐÆûn£Ò3F{ÿ0œ™Ù>4¡Õ£ "z ¬ çÆ(cpËœá•a޽^œýyͰð,}‹ÂFÕ`d–7ÜšžL3 ?nPºHø›B4±7/¢àýÕU<p0fï…Å$öÐ7±IÍU:˜p'ðSøJøùަQÜøqFÒà}¯LßñÀT”q°}•ÈMCÔÖ(¡¾ðáõ¶LY€dÎEÀ'õ9W–q}äÞ¿B­Ÿ#VM9Á׫¼¶àÆrx¦ 4yŸ7ªÙ’!{­ßØ'39=ŠîK8°mE‹×ø9å…ÁTÑOƒr™ˆ·m„¬ ϯ²“zƒRÞRžé‘/ž·4¡sŠduof™¦ ý12™h_ÃáSÇùØëNA®Ü@•ÿÄ9z&\ùˆó;ÀyD”ST4/ ÎMoE4–6Ï6-\z„¬î].•½l¥ 6Ïy› >áwwEEç’ë(Wåk.J“šÁÇg‘ä„ÜMÌ®SŽmoá —Ž€þîcT)lŠñÛ¢•Z¯“A‹½Þÿº`¶ÑÑy°zi••ÞýˆšUó62oÕ{„ Y†DDQµÌ£_Ço ‚Ð㯞WDo,|Ÿp¡œaÉ?ƒ¯G¼Ò®Jž#I®ÒÒÊY~²8ü¹Ì]E0ÿæùP+ð,˜ƒóØÚ¼‘:çK³Úñ×kŽ_za,Vókãô¼Å¦!Hqk7Ô`.¹Ý&Ç®Nyn‚†ås*è¸Á/C„ÕŸH-íÑÉÂ{ãvNÖWñï"Gk¾ÝG÷1üÍçsJqïÏSA Ë”àr§l^ã[þ µ"3S„ ‹ ¸j[&»px(h×\?ÿöÏ2 |÷êp•N?c–½×Ú8Ê{ž3ãïœÅ#HŠø¯Ð—RÉòçnhl·C"d²[oÞÂö²ß«ÐÄ ¨‚‘s€ÿJR‹ÔÔn%‚9òžOðNPŸõâÇ;B™fIH÷ŒÕcÅeP0ßʦS“~4D?'¸lÕ„|º}ÚST~røR?àyŽîý*ùfÍf‚· yŸ™àÝÓ‹®6³V\¨€¯|õ-°ðC6(sViÔ˜}^ÏÉUÄö9æw»R¯%á€yñ_`øV¸ å'?Í"M:ÿæs¥þRÚmÖ·¸„^d{—•)ñŸÖDIäIŒ©„/{nìê_`Ç“p÷Fm˜Òƒ.n¹¾´ïNFËèU$™¸uFµ7óæOU‹™Z›ÚˆÙÈH•n78ÔJÀ‚¼¶¾¦«ß:Çdð’FPxÅt#˜Ç­Qu½Q/Ð eŠ–’‹dãÀØÎ£ÉÁìKãÈžqÿ“Oï®É}Ÿù¼€$-¼·6[öùm\Mkoˆ5¡GHsMˆåf-Ç¿ýÉáDMy1©¾(q¸bÝœ 3|w8Ç£=±?HKò}þËløþPè¸Ö +‘ò5,O_+:XµC ¢ïTÀÞkf4nyÔËç­‹n5ÁæuVnž¿L« LÒ4Ä\zØ„bX „&Ð@„_òî/ˆž´vŒ ‹òºä¾=ÄK+–6Ø2ïJæ3RPÍA ¥f$àtX¨ÔÊaŒ>áâ]è!ë€ÑéLŸH±®”²]ksMÿl-YÎ4ð âð@ó£½o~cY©èwš!w7PºƒŸ¿tðb@šÖ(ÓÀ²ÖW!šŠpb £ö8I+Ï B5>–€'­àq%Áû`J€çlS UYB›¨•µ@ÝûuÌÔ.[W¶¥Ñ­ºç¾Gd–ëÀ{-ü¡»·jÿ)Èx°=؃6ÿó¨þ9D1~u÷Õ]v´ö "nœí—`Ì@„àV›AÝó]­=9¼v=ø;Ð3¾NÜ*OJf<âžjW„í!›³&¥.9D§9ñ£¹ŸÏr–—ã^µO‘Ö –°sjX+ÓAdzbUÞPâDÅØçÙCAôXÄBíߣrÈ_,é\UŒ¼@ÿÛñ@(©úáž{ N©W®’Ë1Ã4û¾Äî>_V`ðJ¦â¿ÏÃ[¬IRÍ)™“ÒGšì÷}t6.ÔÕaÑ}9HjX1¢štî·âênl©ÞX‡ŸõÔí­±/y;â¡õõIª uux•}Ðc ¢xªïBz€jdßüP¹Ù¦™(ŧíå‡7Q›¹K÷¤Olf2ô1íÜÃÆH P-*…´J}#Úºä0Õqò4VeúGð.â…Õ.ÆÖvd^ÜrúÑÑ4+àóŒ¡Sï}1G6`§-|Ou ÏYÿj¦³Kùx<¿5Ý_‰êhk‘ìgJ¢°&j œDl´3?†ÌÆ„"ï ²÷òzâƒX»wÎl?¡Ò9køp]ÛÂk$Í—Š™„®¸²O7ózðÇzü`ýŒ§&Ç­°—ÜÃŽF†ˆ€´û ñ;ÿ# ìöð•÷‘Á›YB“pM:V†Ü‰/‘åaå3Ëó+g˜ÿT†'m”é1Gö_ªÊS æ„©ëôDÅL¾ìUÊ÷~?º˜Ig1úó,8‹9z2KóUºóO†?‰jMl@\¯jx>Ÿ0ægIY˜÷Ç=´ a]•áp¢ÔSFlWBdˆDs«0¸”yħ‚²ó#!|j˨Üe¥¶ïÑ`¢\hU? /·h®ISè‰ѧ¡"*ôe¿*Ç7º÷*BŠÑ»i÷›úâ€Êyv½Â¿Zƒ…ÌÐۥ猔‰Ïy7ât> r4ñýçBdž•2™¯ßÕ¯!V’D·#[¥ßîoÑ8pÒ*P.°fäpjW^ãàù§É¸h£{Ù ±Qôù- rõU‹Æ¸•ÍØª,Ñ2ËÝ·³óò÷. Òš„LAœtaé$H} ƼÝ }}4ÞwqëÀÑÙ3 åÕCZ5'ˆôÓUWï*ÅUífµ ¸ÛPvp:IzÞɯ{¿oø ßi7Þq„žîÕ ¿ P æ¢<à@ÊSÉ1as—ç¬A¶cÎ%öŒUŽgúÔ;'?ÇmÖw³Ô»ÁNÐv?Ï2c ¿’¹Šhé´¶¯¶oi??Ü—§~RAÞU?0Rš­› órwIN¿ä§¹3qÕÇJ—éÍñ'û5™ùñ¤*ÜɰÞÚ,þFaòøŒ¬#i¤Xtè× úJG:H‘…Þ@«MÿÑ“üai5½P‰.ajH¶íÐÜê•hÀ߇T£u×…$Y<Ø*é3äºAIÖgôì™’UÝCe®7Ñ#Uê»åt ]í~Í VÏ5o$B#©û õ Ó˜œ×Ý×fN Z _¼©S»ñ œÆ˜ã’¨â{°(d¡’M;ˆì€]EX¯€¯1Ê„íXR¿)c"GéÊ£EÒ—æbº@>–¡6:™»ç³^x=É G7HÄ}£<Š„'ñ:A¾i~{ ·D4˜àQ}q¬•_‚˜ªjŸW ÁÙc_x¥Èöޝû ü“ÒWVè1müÊ_[­8Û¬$ª‡.;ŽÑ·äxŽ%¡‹ëߦW¸¥Š+Ÿ§‘3tc<³¥™‚ðÛ!öô:ûûEƒ±T‰ÀYÚªÝ<‰ÃÄéMîDgfÍ|뤇Ç7ÝѶä|½O4Ë©åä¢aQßS’öoì®Mƒ%uüØ´ü˜¯[зª‰,‚w_J>W„qt¼1grïZBÍD´)DðhÖdë;г•¸§¦H†_+Mm‡ó×GË-¸EhJ÷É˯P4&a*.b<=Ï2öÙxçlŒ¸XÝ»1EMüY Ĉhï[úy™iŒhtîW‚tJ:‚ˆ~Š™q+“<ñJ_C[¿fõéåEèÛŸ†Ozî³¢¢€Šá3Û¨þãAZ³¢x'â¢Ëñ¬$e¾å">ÏEWd€’½`¡”÷9Õ‡šBáfa««½ ïaµç`/Cpw<ŒÙ5›µ7936£MŸDݯ„DzտÉÀZ›ý7T¬VôÑ’á¥@Êæ6Pd\? E$ÌJöË2Ÿ·Îeâ[ Q¸ùóàNZC~¶ø§›vQŒv —Ý$Äà:ìcõ( »^…Sêݽpü¥W_ôbšÙù&ªv£œmdÇ%ýhô¶õž ¹UTßèeÕX¤Ñw°YçwÇã<=eVìÄc©Î«b¸á1+¹ +[Çs6w¬öV«$ÄVÕI„BK…VCð\ɬP£‹YÿRm}ÙÁ»ÑúM¿¬0E=L-.eÌúÍý¥‘×¼hk»eIî锸£8 F‡N"!‚ÙÛ\0g–4Ô•‘Çôåû¼w@ýfmQ_¢?ò›ü}sXŸD ƒê¤ ÆXê)·‘·¢Þ%Á\y-cÕ$ô4GÔ7Nc¨ 9!7j—k'4ÚpŒ*t](^h¤‘”xĉÆ'ø“®¤Æµ³f§É>º|ŽÞJ.T¬Ñ™nÙæÕ½—‘ ´ÿ¤ gÇŠ&§ ú4Y¤ˆå9´ª~õÜÃG¾s#0Îá´[‚À O-1í¯ëúƒ¸¶3ÊkÁ‡P¸•nSðG ë1B¶Ð4 :â\­DU¾¿Adêrÿû`ˆèÂU8” †Õ‘r?‚H#Í`—¦êxƒ1£_ø§qœQ^#¥˜ †ŸF?à2¶ONØO(ß‘<|ëiun£¨ÂA)¦ÙÇPãÀgTøÙ÷ü:eæŒÉÂ;BÝ"d88ôYítÑŽ5µ,LÙZîÂïáÚ\ïÄ*õ)ûWµûn¡˜6•®üLѽ‰ q˜­ÑÙaOCRm1cìŒXR¾×"00‘UE#W–=½ÖÚî[s Öøã¨P–²TAhúÈ«çædTÇ[ôá8U’AœÎþÌスOyýVwØËò)ÚÈÝT¤<vêñmáÔ!Éæ2ksZ8‰;yœán}Ž’$  çÛ/4yOt¦3G¶ÕNdâIÊ  õt,Á•ò}\×Í’Tt¤-5¨vBù|E£‰§üŠ4xå¶lTØÏêÜMyh‰;%WÛ$)V=ûM|ªÿ‘cËÅôRžQ‘ÓÖœâØûd]{ª´[èÕÙ–,Lô °TÑô =ãð‰¨”Ìù‹“!3eY„p»ß´u§{–ÿÖÛü\»a0§¯¹¦}íGwl~…!±¤eôö 3Õ½Ì ¦µˆ;h¾Çi*rð‰ñãñ-óÜÒÞIXÄêq_ ¯ä)­ƒÓÀn¸ÂŽáFóеÕÓ`³bêëEYqAì}ú4ä‰oø>-!È=Vý$‡ù)l˜¤›÷!ü2mhVÀWh¦ýfšb·ó4%2ݤȪù½S'žÌ @¹àâ¶ÜýEØ’Ÿx8ìøÊ?äöt¥ò…ï¶~ IÑ©^úbQ™¡ý×èJÀì©8¢PÔ¦ÛÛñFDy6-ɼ̊±=ÜíĬ+ϸòã£Ë÷¾ DÌÛñ8‹sÝîË”ñêo@Ðûýé:8t@uü_Jª÷UÎ%†ãÆ]æ%‰ö?Å%mŠ‚Î›¨‚â¿•½ ¾MÓA3?s‡á¬üÞ“~³Hô Èš­"x×Püˆ4*˜tGº§ sãDt@®ªct9×´3´i‰;4;m¸®”ª³2SíÉb¦â)¨ ïêÒ¨Žê»Ô^Ç*žÙTbÈÇ}Ò•ÃB¿a£ã_æ•}Õ诿Ÿ'v,b®Û’bw““Â¥Jo@ËDS·~c-W"b„PeÅ>…}¦ø+¹$âúΔÛmÜw‚ÒÀýÝGôµt*=5 >]óøž>z­QÊăôT æà+õì±Í }ŸR˜ÄœÏk®¸ó¯rŒ¦^­±„K°Ò†ÝH‰0±XBÞÝo3x^ÀG(¨6¥6ØNSʊŤJ²´BÓ¹…á7·ë8ýà°ÎÑD}BM!®ß¶ ^/€SCÖz²/:hð“o‚kª²NœO.êº(g§Sb}м·$ë)ølU|~ëJî}/5y,?ˆcAϹ¤zæRxÎ|E4î°ãW–¤LC! ^Ýéeœ']–$ÆÝ TÀ|îÌ4é[êàÚB;rŒ@¬ñ•Ãï'hu›ük ¥¯\XÍP1ÎÏ`Êb°¾!AJ;_3Ô9œÎÌHó3«šÂ›"Åuì®-Á4%ÿ"¡Ù=Q‰8ƒUK$€¢ÞD±Ê{oÉZäÃÔ܆$ÐòB5:šœqº· [»ì5„ÊäÓÓÕ0ØIUÂȳÆú"ÄmÚ»Ó.­Ž‹ɱ ~CÙãÏ­Ç>B^9Ps8ȼ=:Ѫ•ä1× pÍ5ö¢÷–ëêT‚Ų\á ˈvÐß,&M±óˆODÒîi)-¤óÊ&}‡úC¶!šÀІ ö¾¶ë½m:ia]KmË x¡T~–ßO6-´Ò*bßê7æaH6¹ø”zÁu¾ï)¤<'I5dñÓëK^ ý΋ ’Ç$;ÌMÈŽV25.κL-R:+KÅ\[ê%*˜Ài á·nûòì@“µ¹ ¡APúätqI%©FC$›«1¨í)2zã6”¾@+(:lž˜Œ®u‡ûb·^ÁU‚‚º¤ÄœP(ñ¶@Øå¸4åî{›É~B”¤xÍ,AW¾ùŒù©DAË¿Üňº]¤ù"ºÝw:½ªÇQ¯y´ "ÍóêœKæœ1 Õ–€k­ÍV „‚U®ð-PC,¨-ì@u?$‰ÿMÀĬLœþ»©ùñõȶñùö±®añíE¼“i…`÷kݼxÏš]f îaÅW…­¥Ý.GR˜hŠˆ6I˜Çׯit¬œžè4Š¡Ø=Á@ QÚwÅ<Í …™Þð\Ní›fqéÂŠÜø×û¹½F¨ú @qÆ4ìzœ–sUÀ±c¬MÆüä‡ÍÃV œ9ļŸ—»‚u¬Ï8Ó 2B¬A'ãs ãþÕþ"O)„‘‘ÿ“œŠ°u<6–úüÁ¸Ùé&:º>Æšäc%€˜Ÿ­ÄÏB 762Ã]žh™'ÖÁDòHÒ&Ðê^æfBŸÂ^ð¤®ôÀ‘ TUJŒ«W‘dqf›¼uޏea‡>=NGxn¡hÜœk‰ 4ïúj],N¸¸DËÆé‡v•¾KšžÇ%æ.”hë+vÙË ý¶š!ÅörìòJH*Ð÷Pñ¡ ¶èOaà…$Í•ñža9åÂÍ% qîœÑ É{ä$/³ˆnèÍ"ïGÞ_–A]ËÚl3)Aiᇦ(ÆæÀ³R' ‚îTD6ö¸“„¾ëÉ“$Ã#‚ïKJ q¤Ò dng¿×ÑëZÙÂp箌~3‘RÊi+Á“¡Zs@Œb“Àà䘴®¯ma“…ýÒtÑa=ytl<[<àäk2þËp7=-«¢‰ËzJ"žZºÏÚïìíöpÀ0‚aý„—‚õLECQ*ÇÔ™å?o%÷¿­XÅjtESÒT?쟕IÔyÅATƒŽ¾NúcÈ2G¦NwÂÛqv,#-j¬³G¯|0'¿3› ü]&X˜ökÁÊ‹¢)üfÞ£,ïù[Ô=K‡[)Þ]Ý ðÍ-q•>W b8Ü…W> ⌺ZËŸg1_´~cÃ|õ4? TN?üÖ§•z8Î[\$Ç}@ÔP¼|À ‹Œt%½¬Ng³þ ù1|,`øi³„³ùµªúã©ì½D¸? X³½Zб R¡xÊ»#I1½5:NÞ;i"Ô#±™H/v ¢h5#ffÛÚ‰æY˜%›ý“Ÿ³äüG!²]1졤9gDÎû7Ʉۤ°õ‚Çšû3uß.Ý[$×4¨µœbA¡àÈþï1äuFÔ¬m^+=á KØTˆÛJ'/Ôe h©€cÀ$wð`?6TI!'oo©ÞÚû±_<…M…xǪ{p†õwa!­>˜ß­çOæ¼??1ÿ°9¯¢wzÊ SmÀ2Xµ_ÊÊB>]ùý¤Z'*Xúг ;j3b`DÍj»FC5rá:Ëb­2ñgq%Ö fþó„쪰àÔÑæ¿uu³í”{Ã3ñ±ÂwŒƒ¤Âé3{` ¹9Ò#~|¹ÑxÃXÚ®Äc6vâÀ»8ðA¹îÕ{ê™hþMl»ºó†´"}eVÛN`°Qö¥ÛwˆþÒúd†ñ#‰ÏÓ|\©k}7¹L;tŸWö5'µ½-ƬÜ50f†f~UļLk÷®iÀ$¿k•f¥+<²ñ÷<öy¹Pãÿ=oþñâ{Ê+&)dKô Ñ%%çÈô•Ë Ã‚ *$æk½6&*aëlÙåk‡d^ äÏ¿hDÂáNvqT£+–ݶaÍ`Ü%Õ2Æ48_uTé¸2Ö¿S6FÉw–¶„ç{„hó w=epÁF™ðÜßh#¿#Ç}‚¶1šbþ07¬°¸Ý~öÕUa=.½S†bÐãâS"%E;8p~õ‰XßdGˆx†f˜¾Ãða‹h2ÿ¸ðditOç“ð"S´2K/èë-à""`Ú0jÑž`˜$b!AÒ-å÷|HGägÓ˜k¶‡‘'5‡k_U&lRÿ#žz«’·5x ã~ß>IÃö¨ÚÊdjp— SS¬‚ЍNsßö=Óµ#Èþ\`—×bÐ{] ˆµW™Ps¤¤Ò„êÃM‹Eü†:4šÐ?Ì wÕYcá:èÝ3hzƒ!hã<ñ¼"7÷-1´ró(ñE7²–x3ƽL½äê5]qʦ³‡æƒ Õ8ÕrÕ9§×Fª5—î0»y“]mCìk´¦Ue&mß( "&¥ŒµúÀ¦Æ|-ÐÃ4/µ¤i«eäõ=žQA¼WIº¸ŸÆ· $¯ðš“Ê& Æ’…SÿäGÛ¤m.§tÇ…†¦ …Û³ÇЕ²¤@âgsñn;K,8âŽyÉY  OÚë…%šæ%¥ ¹ðAÙ´Ôc#É@Ë %(Arº¸Ø-o ÉgR·PXBS0,ò½TªnÐ/Õ)‡:‚‹ûqÉò$ÈslôTêÂFlÿ®”Ý1Ú(~_ËSßµ-H°ÀSl×G ""6x¤!ášç†ëâøC†,t+K?d¶è¨mg‹‹ x} ¢Jum)¶Ö§üL¤€Ýd)§tñ^RÊy™Ï”»#üË«/gâ'òUòš‰%É·ú§>£ oB- Ó‚)ŽôAÓÉʉn,Í&¡ä pS4™ƒ¸ðöŠ‘Ã¦£DAT|½_"*×s{¡±©Î¿º‰É,ÕÎD<†l`jÿëd`ýŸÍ¾ÎquÏ×fö÷=§[MC“'1u/œ˜œ6¥Š8¸ÑLæaÒàc‚|öݦPöb\‡`“íA6Ýо9b™Ib ©ÂŸânIh¹)Er¼ÐCôIÄäØÖdhó9à´ítçRTâÆ”R8ºõÞ놫U²b:<Ó6EÞ‡kæÇŘž’ÞëÙ¥ŽØ¿üüÙøSæýñ\W³ßAÒHÙ@ô‚äöAÏ#e2Q˜œöB¦^©‰[±ª$´ˆÉ^3^ñ à¶F‰÷Ix}ƒl†dÊDÆÚçÙŠýµ¦™Øë¿4 ä¥ß¤Öƒn¡Pðûi…×Ë xL‘˜mÆÄp‰†hl@ê²pÌQÇ­j|{µ·É„Èfsz œqª.f±( ŒÏù]²:[°l§§þ¿ <–§RûÀU¢ÖtR© ªhW;^¤=²þˆç ÖÏï :’+ür¸àxð„56áU!qÔsTT)´ Þ›PÛHzÜS6ôT¿–¯X ƒ»41ÚU‹©õ…V…´|%¡ö7Ê‘AWzúŽ u=Õ­˜t²û¥ tÙòv/uÏ:Ù}Uú]Áw*ÊfXaÂez$9>ØÑlÃó¡¸/ 9u±Z2Õý}õ:¥}·_uÍþuÎhܰ.þY"’ï¥FŠê#§’ÞÌøŸŸ(ÂÀã¼ÝWçL.E[ÝVísÁÃìÄ!Cx<ÏçRD®á°>{»hG¬‘ÞD#ÓÛ“Iu—Á,X>Ôv‰W{Ùw 0ë&S ´<ñÍRÝ`v0xÎæ< •z*³Z›´—1Á}ŽÐ¬M¹éÛ×QbÞHÃú*:\¹ÁÄMwÉÚ§*ñŒ`–Ö¼°žµSçN°£¹V%Ðq™Sðm©›o­àH©sIœ²tÑÔsãl!%O &¨[f ¡#[Ëe–ÊñúîTÃF‘߈1ÎÃñ!HÔ€ ²æjš)J–L¢IBįå¿Çé9ÛgÞý¤µÖC/ŽÄ%ßô4Ó‚9Köäfƨ¥¾Ðwl.*ÕYÛÍ`Óú Óå¿3¼‚–ZTõ¥å¥êWò~,[â [¦íÐÔMÊÒb½²¦ÔÁQF´Ðáû’ëX!´v{ók?Ç‚„q½AEÈþt‡6ë„iVós$QþàÖ‹0$¶bT¦ìFОS;bƒU q¾©+ÂÂw¿ÎqÑ|û®ò¶yæ‘•T3êqˆrÀÓL¯¢0» ¯µ¬|6ax»‘‹š'å=²­gk­Ïq/N¯/wþ y{bYmÿ!S<@¶²Mò 5;½»]6I £íÛ’RöíN4½)7\ßeVUl;ã O‡§Únß&I8±o6³ã~뢩7ÚmXrÙ2€nÖ5;fÛ"edG\Å6¤êñ|JÐ^´{Ú`¼î‚éyCßÚïÊ•ÃT¦â¿ªQÉ©¯jæ^oTΠ?˜¢ñÊÒüàÇvæzÖ¾©ü¥D J È\¾9|N§ó=fØ›i‚/—0UkÉ¥žê¡§ŽagF„Ë’n1§ L¨¼¥Äu¢ö¡ñô¤d侾à äæÿrÄY%òY÷„CÉèOý8ÕBë 7ôÙH&F ‘À‡³ý ú¯K He[`,ǼŠ"ÓQ#i¿Îïò¨ÔG=ŒB•²#;„ vÇÿWÇ"NTÇ3°È)³夡9ªš¸…¾=w¨õ^ÙÖÈ™çÕ†… f‹‹×-Ò1a:-í|Wÿ‹…<²¬’gÈß>©…cU¹n¿ ³äáPÝLñ‘«°Žâ-¤Ùö÷*º÷ÑÙß%Š›Î3̬çPÍŸ¯ì^°Ué'/d¼¤öéâËqšN²½¾„Íqe%êBß4k¦F‡¡Q„Fg›ÄAXTˆRë#eÓ±ì°dÛ¯Â_…N(H•=ºd*È·Ö(‡6•NYû%º{E{¯Þ Ž¥o¤-áBý'B¸‘Zf!0¶¹#/* Т–æÉÆð†ê1h“†Åë:“,ÆiñG‡:xÃgÇ‚‚aær{w_«HÏ[ŠÐ?övlS¬Švå6 …l¤´k×g…x÷¯ŒÀ¼¤Ré¢PdÖ¯°'f¢­³åI3ZK¬Ÿx\ðñÐ1ô¨œˆioª†¤b]X|£T"ª\¹h¼qü½³i¿½K¹CSéí™B4pÇŸ~8ËYóµ”9ºoF·{›)»‚ò&‹V;÷ÃdqÞÀ”gx|ƒ¼D}]ïÁ›¨Ò”"V©u`®ûÓ:·Á¬߯ƒoð–Ü%ÿ#×ðgbŠ*¼!-Wñ×hy`ä5þο}?dG9¤º“ZÔ{œ§¡†w9*t9CýÛVæ[¾§+Ýéa$ìÛK»Qµñš¯@J®Co‚µÒ+MA¡g ‰jÛ×ÚZö^žºŸ k«üÊ¢ xtççe²:wi1päíì]­T!+eáWí¯÷VJ&W‹&£‡_¬ØèC¯²¬E"Úò3 K4³EÝùàzƒê…Ê/¡9&´£Œø½/Їó ²â"¾.(°È1àz​"ÒØ}›µFõ¢V«)Ç_#‰¤Ä®ígu»ö¦áÿÀ!ë$};#Ñ÷ 6ù-8 Oí­òñ&#‡Yµ!teŸŠ Ñ|Ú‚ž(I¤“_0Æ‘\¾0ÌöæÈÇ’)‹TÄQM›¾£Âm‰³dÕ<XG‘ÁȉÎ~V ?Ãk+êh–A4è!êÞ¸9íC ˆùÂܵÊSÒöÂsç@gà˜›ô+ýÅ€Új¯P*ãˆá×:ÁÁe€'Ç0:– èO]­¸V@ü®‰>Òs÷lx›{æáÓh›øå7*‘!y‰”ž#6Z’@íxÖœ÷ú›‡5%V"å£\êBÔÃù™¡n½|¹_ü‰ÀŽ©«=·K½fkÇ86·FD‹®ç ŠÁŽ™ßÉ|³DAQÙgØþ±Ð‡‹4Xv0 JïIgÌ/´†ßc¤,‰(zº[úc¬ÿ « BäFà†¹Ð¤íq`$®éÕ ·†…7¶ŽW1|OiÜ!kÓtsª‡Q!SÕ"ÛÒ9ÔÛŸ7…~ @è«L@wTÿ­¹ó[1“Îè4"~>aÿH™ßºsåF™,L”áS a¿_B6Ý||HºŒò®CŽð0g`Îþ=Z¬Š*‡ 4aôЇæ&4× ‡Œ}ÿ˜ 4qÖKƒ‚hŒÑ¹¾AaÐeàÒá3wùN8kdPrè·1›=!/Ñ}|*Ÿª–ÿc"rnFíDÛÆ ëÅmóÕ³%7ž­ùBÚYù©Ô+L†I¨ xaáT9ÜKÐQ-–¥˜¢¥’$òÝ| D3›iì!|R¯÷¹¼*4Ø%Ô½Ó6æ_xâŠs Å‘ZRKr œ´ XI  @#8V<^ªÒá4 éAÊŸj´T%s3é2¶MÉû‹Àª§¸ö•0„T¨ÖÛX?70|>ï%銑2týÒi4ˆš [ã=7[†OÕ[ÏušxGD¤ÑÑäÕpìwØjÂæl6ȇ®z¼±‡í¼,Â!|_ºRoßáˆ!¨õô¤8ÄN‚«p‹}o>»$WHÖf»ó6Ñr BVÏ2wÇB×¥úˆiˆðÉᘻùSìºm’:ïSÙ]3{ªÙ"pÐLòÔH!à( ²$dA K<ëö¡µ=JÝímÝrcølÊÒî é ‡RIv–\›‘IèôÀ˜kh(H‰¿=t!…¸¾Œj]K ¢bd׸$Þ‘ã8wP³øŽÁœ¶Ä@…)Fʇ(,‰Êdjs±ŒÌà=-ðxå€X)L£,ˆnE0,ü+4ØCŠ ¶M¤–æN¬>°Äû4[³!Ü×c%WRY·ÏšU‹h¿iýNÃG½DöÄ"CÜdƒ!qŒq,P<Ô*ô )ÝIæcÉ:ËÔ/ó€Ò(¬yytɇ'áirÃTÝŒç%é)Œè뻑¾ DÑÔel髎R1’PYà©ìÒ>ªZòQ`Ø(;=ŒóŸ{ªN©¯{Îß¼];:N$[,ÁÌ ƒ?¾çÊÄl8²,xKî–s-q˜MË y”Ý‹"“ øŠ¥ŒÚ*‚_¢ã`}'<ß¾s—†âÒäÁ â¿KëmÔ¿ƒŒÌŒšD Mñ—pnWutLU&®"s+è}«ûú6÷=ÂÞ’wJ*A°“™¶;8öŽW Û ´1švti49DT8;;oá¿w˜i•R2þVY',.nª¾Èæóíмi0Ë|<ý°mö”~¯í~AâVÎÇ׆Îå$IÝö`ݨ€Ð³+ÌßÉæ ?­}‰ŽºªÐ憮ÍUïÀÖIc¡ˆ^i«S-S¬7 ?ï?au£·F8çGs©È%SDý•O¬DqªK%øYØvǰ٠«‹¦Wq”‡„Ãù°jƒfk‘á_»•‹t>ÂïNBÄy74É^§u¬ ù Kûèܾ¯† ¾m7Vêˆe`(Ùº¥D1i¾³„³º_ÔèÒ^ ì º8LÓM' +µæêo+ÊâÉ€«r`Å á섽ï[Ì¡]ÖîRØrÂÈä\)`Û,€¡æ]¸pì1F–g§šár5?,ã;-’¿-ÑvíyšèîIHÒ¨ÐÛšœOïýZt£U·1âìTI‹rƒ)=—A£X¦æmd.;¿Š­º¯*OS°`'eø–-ù„¤K½-ÛÿuÑ÷ÞK0ÌçV3Åaü!÷]ñ¿xáñë𤡷¦Èh2γ\?w/G€ÞåçÀ†œ.s0{Xª&½ô±ŒGE(-¹}=æ Ÿ|ï(·èzpžzå8²KŒ¹lümPµ3óN£Àè3ß<ü땸»Ð6䯀Þ5ß³ì€7 y8ÉÈhøã¬8ŸœBeæeÿK¿Üçhâ6ƒJíÉ~Í1² ˜37kÍÑ&ˆ ¦ZwñŠX„ȺŒô竜L-úaoX€iù9ü_«Š5ƒJÑú\5u³PX4“NS<í¿c‰J´Þ3’_–ïRÝ·ðRðY.ÍEÝ%7Œáƈ‰£‘´=FQÖ¨™2B7/ÿ—õhh•ÏMÐi54zz•·7•¦©Šóà®ZA¥NöQj‚{TúX°[·&Ñf†I0”+Yš(cUOuO ;;• çÞ× eTönYŒ?©Iœg·‰pNUnωäu Ó ˜0e …sÒ)ëâ)çµ#) ±ô¸÷~ZH}û­&rO0Î{d‰W˜Eþ4ÈÑžoé‚(Y‚uüè¡lOËh¨[C™;PÒĹÈb(?1%Ž<æØì“ýìŽAÔÝCP¤‹n§Bœ3_é’ÍñçÜõ|mŒe>®-u•‹vôùrbaÝ"I+OÁÀÌ47–;«'0–£é^Y霖¨UqTª1õOÍúØ‘?M‹|¶¢“Õ&Ÿ'zG#9ã§àKžÜÚ$,8´½4\®2áEš;¼V½ŠÚ$½DIÙ˜·Ã }Ôhe” d©Kk&húzDõ—:±jÄÓ2˜õ&¡°Fkܯ»Öé°‚é‡xà.VJ£³”°ø²=_‚ë¢8Ï C$¯¡@í÷‘Ò” ¤Bj3q¨2 Ú¡Y(÷Bþb4h ª ¼€ÌÞ¸ŸˆÊE¼Ño‡äš¦Ï id‹§Ì±lçUÚ€–Yÿ…öSE(ˆÁ º ǰòD^çÈæ,A)¸ÏûÑ‘íçcÌOäÖíÐ yoX’4äâšy§Îs̘U™?úuÈä|}Pª ±îBßt’T_”š-ù”aˆïBãmàÂÆN¯.“–é‘ð΃tT~ÀçÂoboS^[t¤æ7N=‡[¤Ji|³_Š<å‹äÂÉ™ÕÀÀY£¢ìJúÔ‚]Áyû5dÕ—¯à’Ùz›ï ™©]Ã6þl)†£UÜaÚ‘Y{ù” 5a²ã<¨Þé/¥ê\žl(óLÑ.:g;. €ðv‘Æ®.ËœR¾•ø9b3 _0e7 'pÆf÷x‘úH/›è¸E¥÷ìíýó;Òd´Täo´‚õÌL1ï[e€db´dèÏ JWpú'[¬ÉeƒDû¨7' ïµÕ¯ÒɸV{áá"j¼)L  9MnÏZ™"ºØ@WEîjŽetäs·0‚”i¢¼ç¸ÆI)¶M ÒY»ý¸þ9”+ö*ü>˜ý#4ºùµLÑi¸‡ŠØ~Ö…ßéË=9Åe¦‡¬é RžŽÍì§Àq©¨ß ÷ÍÖ1 : Ïô=Ù`xÇpÈË«÷@PK"ð+õø ã•1ñGÊ’’'LÊMÑñO»oj¾¢¾ãictbíg6Y?§&FaìÊ0öÎ,™‹62ÉoÝî@ïÍö®Ö›¡1¥ŠJý±;Úða 6¨)H/é×)Ý7G:Tô±‹ ³èØ1A€ïb|–VÅ mÜdßí='_š•{ò(ïbæ°aì¿?|Q¿i÷-@rìb2³ÒvVª;czÿìÌ.š&ZÝ!zŸ:|Ô¿M[Ä“‡ÉØÕ†aЧ ÊQ]Þ~Ð ÞxüÜË|B¯ö’þ°Þ7¸r2BÔ-]“¬çb­1ÿö|â("™2âÕ±_âÿáÜô%zWþ4ÎmA{g…«®¬lÿ¨JäƒATÇþ`Sm+ÿúx“xÀ¸÷ÅÃMæt[‘y’’ˆDìùšœCºø»âÎùî)ÝVVhþÙ¼üg„ 9"daNþ^¥gŽ|¼Öžåä¥x&¢-”^ØïO£,³ywÎEDa³“ ùÞÊ¢ËïØ-ö•¢Ü›/¿×­…5Ýb…äR–ÁDC üÁŽô]âñþ¹ð”ë¾Òlß[Ô½Eô³EUòW5>T©„—>ý6u#^®ï²Æ/ ˆêµ¢ÐH·x`Ï‹#ùyb¦,:×,÷_¿4™,F8· ²“íkŒIÁGVïmËoy½ñ ׿«„Ð,ÂúK›Ïظk+³b7!zµ‚jmÒöhà³Kõw1ıM§ •îÍT-—ÐÚ°÷,ƒÖìbrãAžèt°U±‚bÁ‹¢†m›&LSšÄ¥ÊŠOލu¿mÿ®ê•Põa¼Ï”ÇIÃȦÑÄÓ c•Vç…ŠŒeˆº«è­W9Gè'ØþJpž&ËÝúRA çÅ2ýÇ¡¨éƒÔ¬3 ’¯þµ ‘e¯ýÐD9‹Ó œ›9¡¶þtIZ˜u~…-†~+þ°»§$ _Ÿ›£Üt:ÿq‰^¯¤þ,(<)X,äkÐ8Ú*Ó°NQCúüŒ6À×þ×:cŸˆæ·o!  Ksö‰­oÒC¾Fpbch¸çQ•W¾£ÃÑÁÂÄòâ¸^*¢êÍùBã¥jÁ‚UxˆÒfØ4ÖkLÀ&'+ØÇ§˜óe1€H^Tþˆ_,J:q•J4õFb¦Þ4+6 Üö&ÍýL µ¨p'¤‹_… Á@Ë‹ôNµ¾šQ8/i`â›NE´µ‡e{?N{õ™b¹DÑ›Éz§l•>Å”0PÌ!Ÿð|žq„îÖ¾¦ØgB·/ßæñµÙ-ሸ¸C[¸oÁÄ&¯âZJVéápAT¿ó uÓ˜¡Äk«¹ŸœÆ_Ùb+Ö vÂ>´?WÖøð†f+óÝOS,¹ëz¦õ¶÷²ì»ö)j‚æ+pÍœºñèU?Ìy|&FNÜÞÆU¶l·q›ˆŒep‰R÷hrª ã~X»ÅÄøÔ¦¸Yß]ÚUHÝÖLŽ}zí¶çacVüM¯ÓLj <öà‰>]<6®÷+*ÏÍHF{àþ?IpwùU TÊö¼u¥øùm²hP 7Èø€]|.B´+€ûIº~RÕþ:ÿÅu`)´Ÿ³q¯Pë:<ËŠ›ÚzhMÄK“ƒR”3Û2í²ê‹FJöÕšƒ%‚®»9Éü«GÏ j±zHäm–úžÅÁ’?2Gï=AqäZSË+é·õ‡×Õå+âh æi¢†ž‰ÑÊGå÷2XùŸ ××V•ã*<[¢›ÃCOS›qwÖ©=K[Í"”/0Çš´¶ˆ7ɦ³Ð=¬©²>/o-\²°‚Ú¨³V{ÈŘÛô§Ëmé+¸Î$–Þ©t_rª©¯c¥ˆ/›ù‰É ½,š¸Ì²ï.¿„Œmá4Ç3¿BqƒN£Ü´\öcl$àCræÕqù”Z«¦Pž¿ŽüÍm3«¡­îs*ä *nxBº[›²šŒN ë~qç#žTêw*4›í ªƒàhJ_Z4 S ­¢¿ÏË~°z `pú{îufµÎ)Ðãú£¼|z¶Pµ„žË‘ÃXÊõPkné»#®ÜÔ%jÕóþþŸÞàº9¡ux:º' ´fv¦0T¥ç‹jRjYÂö×ùüÍ);(޳£éÉs{Éc[Ï7ÿƒÄ-<›3ÿ©Ÿ®*'eüc9Äý6&ó³(‹â¦ýŽ)Îùæ¬G)õÉ"ÿÕГiɨ¥,9pµ jôÅ6¶–·Ã¸ùÜ{n"UÒðȉ³Æ:Õt3‘RjMá‰C¿óR£,B÷WÏ<ë¦ …ŠøÕ/`]çÎ=bSÏAZ®d %qz1¦¦ä79ÅU°X˜$L µƒ¼Wc0öÑrU× ˆQÅpÆåÓ%p§-¡´ß^„Z‘!fÙ W>÷ì\>G &ÆíÌ8ŒhÀmXââò§÷ŸŽ,8B‰ ×ÜsiçLì_0ýº™€—.’z/u½pYaä³b¼ïÈi:RLj9ßš4”Éõþà˜·ž&ÚhxÓÈ3¸¿ÍȼùÑjÍtÀ!:S㨎è&Idm÷ZÇʈyA®ªº%'%_92dïn4.’8…ÓÏ̘í€PÑûÏ,™ÐÏ—¤;Tüðš1 /̸YPHé<3InbL¥ñàðÎáC䯹X¹¼{Åú²ÏŒ9óìàNáo·e0®%™FÍÆYL¤-—‘²²â+Œæ•ÇÃLÓ‚õµä òOø´ÉÅZ­íÈ$T®îëkåC³Èe¨ŽŒ=Yai½§ývá¥ó¤Ýu­­“µ[´ôê¿agü÷Þ£å^÷mç|Ÿ¢½e·)å@ œ ºŸwIy_ºÆpì)bsþbø¦5a€tà"G’qÍ„Ùö‘YwðpþÛ…u/ƒ]XÕ€;‰ô%ܶæÔ Êj£MÇ`ìØžFÑî÷ëYkNÍ>y1„Tÿeðƒ*Ÿ6?ÑÑûÄ\ +dòBäÐm‹ê“k¨OY{—’ Bú ³šT޼£ÃL»h䃗Z¼Ìâ3}€zdµ9Õ¿››º‡R¼©Ìt÷+r"T¯\Ç…–m1ˆè!“ÆLwIVÔ½ÛtšežõúŠ›Ô&@Ùƒy~_é>ÅNdˆu'"TŸÑ½”W,F©F—¿Ì”W7OS{5a6'm ÊFc[*sœ½!²(:ò+¡p Ôb  /O‰[TõZxbçÞ@õ!Ž|[€Sy½ ˽-{¸L_ôTQ÷9ýò½Œq–LjwÛ6²É—´ÎÆ ²æ©õz!õM¥ô»Ü\¢þ‰<¥˜:kœO¹Ìx<­Oy=vll`ÃïœF  #4Ùªc¤”ƒVlÜkzÚå&Åe¨îØK5rcö Â剄 Áê‚ãàS÷‘r¸ZiÉZ*Ê:3 õúl€w“Þ¿X«UÙY(¸°G&Å_¤°æ‰ŸpÚú‹ò<ÛÔP+öKb5—&î*Jês1Ì sˆ¹”7£+É]쨞?ÞVlðHMç9î=Ý/¡f¤›¡¬¸"JûH÷<;ïØ_Xê¿ír4.¹ƒsÛ];T‹dÇ9-ÛA8Y.SñÚk%9ÃÔãýQjÑÊãPr³m ìîÉ&+©8¥ BÓ”ÎcAíLë®”FJï]·ÎSØ =DÆ":V/¨,ãqŒÝ •ÎîB™Ð§ ¸ßÞ:t×P&Åä§›„!Æâ—¦&/W¸$Û±ÚŸ³#÷–œ<–9ÛæžÐP¾ºƒÖ[{JKðœÝ«ÞKå 0kàºÚϧõUD;n®´:ùW1†@Ÿs¨ÐS ~@céÏš-ßæZ¼'úâ˜ôjzÕ^Ußë­d¼ ùLf>xVŸ€„)´hÂÇCX‰þVÜ­bkä¸Âq0 ãv+Ä™ßjB¿n$ùöc"½• CR8ð©)¸å+Œ7¹’ôŸ¨YšÒÃyìÕPßݘy£Hú^Þ=øP§ß!JÜ87Gº¼·ø³ºY¼œª:‡"¶Îójj 9 k®e)ëÉ!RÓ‹j3i‡ŸvYá}Á•wX…,ö .ÖöÔ%Î#~¦)pkB¾µ¾rËým™©;¿¨'² -¸ß"׺$¸Ìð~ዽô-·aÚÁÞžƒçLijl¸¹ ³L½Àž1ŠËÌ“$£Œ€P(¸SVê*ýÙ¬­·´¦ŽÏ†£‰âmµN¡¤º3@$V‡úŠ(äsâÛ%Ë%Gg¾ÆvÓú¢óÜȸ/a‡•æ@:ŒÒ ™?ƒ-ó(:³Ütjð|rŸœ:D£gê8ß²éL¿C¬ΕĘîŸülKø(™¶OùÛ¿ckyþ44äTBItù­‚ˆìî—fÑp¦ò~»ú°Aö¥Ål8Ù¤‚š·FÞZt¡à1ÆßÖÅ)ä8qT­ü&¦d£`~Ð cÀ·Æó#U»5:€àAÑ¡ï}›š¦¬z°;ÔËOÅRamj‡ón±ê¡ðh,]=Và°:é‹\€¨ª§U œÃLø¬ØžûW‚ò‚EfXt¹eäYªØ, áøŠw wQ­DT´@,I­ÇÝT £:îÿ`i8N|í Æ—u÷å•ôžÙÚ¾$R¬£X²#à6„¬—ãHÈ>¦ÓXçÃÒiÁ EÍÈPNð"î@ö'QQ¤þj¬‚æ¯ñ-7½ˆþµAmë¾r£ÙÝ›\Ajšu—‡]¢ûidîD~NQ(Ù×ã‹Vz } Åj3>I5°ù~•„öÖ­a âê¢oÎÿ\ÌçÂî‚0åÄÚ±.×nÕb÷[› ƒ¸¤c+ˆž,æ€ È5x‹êL­«ƒ„›tÙÚóôÓ›¦:nÏž²‘9º~ΦMF‡+žáU±gózKÊ={n=0…¡.->Ü© Ùòè¯ ÄYìš1—8p{~ Æ¢É¨˜_åœø9ºæ?$¾n M×Ó HOkh€»Û­Ø|âÒ4™1…@§`¼Î>ØF¬ sË ð§ã¢ÇèÞÚÞü¸a­àÖåàhà™–¨Þ«÷CQ˜V«äg{*oññ†-’:ö]*øô ìñÙyžŠ0˜ì&ß÷ÿ,uû „eÅÑå‚!ì×ÓÜg‘_ÏEt*ÚokkJ@ç[™UT@‰¼¾û½ÿé€pv¬—“ ³¼pd¡RÏ€Í3š“Þ¸B«ÐH¤$‚î?ï—ØŒËï=C­0Ä9W ǹµëV¹0ë“Ø3°6“)I…o1˜´VydÊ÷›~ Súˆ…˜ÐÉBÔnHíú[±ÉµÚºÌv!¨ ùÔîI{Y$urêí®Ë^Œ‡&{åܲÞécÕ¯z¿É3H㨠SÜf”²èƒ˜ŸE¦™ß¸gñ©JM"I¸U£ Œ2",]={¹1 ¸¨"½qµâ4Ú¨ý°~÷”XüíÖ|P"³‰Z–oS’ùÛ%h5<@âA!ïS›<,Ö|YRr¾*¹a¢Orûç=w6š½Ë84Ê¡½ŽŸÚåà¦_7Pj–¨R[î=cPû%¿p(y<ƒ(-ÎdP—èñÏÝÊ#öHÆà>f^?4ÌôâË›ãù5žXÜTóYN—/ù¤ã$Æ¡5úΤ4ï¸Cr¼œ]›ÜeÕë.¿@Êó¡Tø¦YŒëWgOÁßTÁßÏéŽ4ëR7cþÎú Ki!?Ùf„¤]ìlSãÄ)h=1¥ ÷ëï@âžD)ˆ/z@„e‰6 ÞÎ8»ì€ƒ)ñ?û$“ÉMÏN·Þ+HÁW¸¢[h‡˜öA#Rxô / ¤eܦ“® ïĽ}¬Tÿĉòµê]±Pç ÕUêšÓ)Ž$æñ?Vç<žÂÞð;>ßÒè~„Úgë?+0ÒÞÙqZˆVêèª#¿‰:*”n'­LÚ] žuïHWù%´x¬5ݾV†*watšŒÕ´l>'«Èפ‚®øÜƧ.øðš/‘L0(Oc\Ðh„pÐâ®Ë«¬sùû{jîKÒºól8[•Ô–Tìû›°{úüvö05Å+ Ôbz__ˆ4çô—<¸[•:ÅKv§©ß‡ä—jUë4Çžùo™Ÿã² Ò¯Y—°Ýúy0?ÜYjÍa¥ßÒ'ö²G‚ Ñ9mqÞVäÑ#þê_ªÉ1á^¡*$êE‘¥ ØþÓ~jc]Éñ-×—n62MÄs;a5ÙLjñÖ<²ÒG/In8 Ïb˜ÞV.r¯“%á'¸”Q[•µ©ñøÖM§MÎÍ~ñàç©bÒ9ÝD¼ß MÅ=×äkȉ™wkiƒÐðMèžÃnöiç6xC1zTÊ Ç1ùhµòp|"ܘlÊ Ð¥Õã@Ã÷ò4k5©›<ëV÷X.wŒÎ—¤—–Ø  Pw‡9hÒ¥Í ÎOAí‘WAïçƒéÜÛè9«¯ksÿúªKªoŽ@ÁALžáϧ?-Ú"p핪1P-×)÷!hL¶‰DÅšHÕdè‡n»;z¥l æ›JõèO`¤”hauéRQûÄÉêužc]¡ñ m§ÇbŽ:¨PóÃÍdR7H3ÃØ”¶ ¼cÃÜ3/±6è‰ ‡•éc;š+FpãšW~mU«‚¹´Ž(#¢4/ÕOƒÿâ_ß9¯H =Ž…ü1lf÷(ãìÌÎN–Ò|Â$Ê".•´‘öí8C9v¬·>Ñ<(xŽNÙä5à ½':û‚±Ë*E5`ÓqyT+ÁuPí±Ù¿ÈNË¡¨á1OÞCÎh=eáÞIÃNÇ4ÛgW¶IsHåžØÈ7W½þºÓ…=›B ¡2“äÈ(S×q¯|/7tb³‡d6WAÕ}.¾ÌvœcÊüÐÏI4ßwááUÇóÙ”€ Á»P·£g³ÜP?ÝR'xi8ƒãÆËˆCWx¯ã®Æìƒ«}¹ŒX¥D.‹È5iêÅ›8NÉÕ2à”Ôîù<™ƒ¼a¬—'Ì­¤[—fVÙ±~¬^)འf¯XÒƒcÒ»º1¨ þ5aȹ<L ÜÓç±HOƒ£i]F "ëßQjŒÜqIž§Gs)5°|g}xAõ¸Ñ<—›Räî¨é䘨\³e^Ky)-‘8«D¹+ª“Í kU¶pè¼êè—A*onÆg‰ò)2%&{–W³-7éX§g½ æþÀ³P<@ å³(:fˆ½<Øý¨3ŽËcJóν›s m‚èÞ¿w3 ëzZqtµ`/¼ëÔ Ëq¸™­z²¸Ò¾q ´ "´¤"%@´iý™DOW‚'Qxmq‘?MM”–{¥9WgÐñÝ:/0;çCxdÇ@!Þ‡ö¡V¨H9tº¸omGXüû'¤ìY@'sòJñÒ"*Ãú $‹EÍ"{»ÒM·I^aŠË”@ùD¿ j²=H?òH ~Ž(ÏþuõŒ[ü¢³ õe(0^K^VßÓybÝs\;èÖs`¨ª ãF fð}H[€û«1éÆq8úôIÚæbȃ˖÷‡-1~›7ÝãBç}[¹uÔ8hËçò©¬`ä€u¤9ñ±jЯándlÙÜwá^Õ?@nþ¯Ô]ð©ŠÒ¦væðãþèz ž¥šßÕ}ûy“U¦eákeëP‰itÛ½^·®½âvE‘yü‰¾í‰|wYÁ2S®¸÷ñâ”Õs¼µÒ¹–ÃPûËê“OPfîK «FºÂ~|IÞQçöFÍ€HsD$ÍBñ-ª©—Nê2Ã×ÎO±Kí¯öuƒ¢Û‘i˜>Ñ£0 !n}•¶ƒÌêæÙ¼„Ù3µž 2üâPËe|iåiZ ‚üõÊ.ê9̓ ipjî½ 4³´föê󟮞œ\2p(„¡ì†YjWöL *a‘y‚ × 9…òÑq{+"˜ë£?TH“d<½4ï×µÄàp@ìÍ®{`Ç6#`wCv‰¦…Y5¯ùF¹»'Nd–0­°°Ý“÷ÿø(À;-¬Á ËÆº:Ùµi\äf>ßÀÜÈ=yr4äOW©D3Â ÉÆ5¡¥qyÔ¦0!M¨<â[­ÕÛäTº˜Þ÷,‰7ÔóÈx¨Ý“–Yxõ®¾Cs®°ã\ÙÓÊOna6Þö¤bË|)¼Ô!G½0Þ¨óô¿”4è;‚N÷ãl¼:m]Ü0[úPX¨§bÂKøÎ¸6,I ל‚ØÝǰ™4c6VþÐý¾‚â¾91ÄÏþ"hµè÷”Á_O<m ~ÚÂX«â”Ðoñ¢YR×v­,RÝ /4YÅÁgõÂG"ÓQô—ð¨:§Ø˜­­&‹Gy}v­ÓÑþ‰¼5Üóç×¢sy´œtÇr| t8¶8+BÔJþå7Ö)ûÌL­nÖ\ÐÂî.f²cks4ØÛk7¨(KV›X­Ý¥ŠÝv^§r.@H!TQ*9Ú­5L~<ц?„°×Ei©|uL¤çž“‚ûCc] ²ÍóüÑ{l"£áHš›{aAÎtÒ÷Rú×b<Ô˶ƒ>BŸ'»Iu¯—­Xýv\Œ{‡7Ÿö³8ϸ;Ÿð¡>ëÜh×™¾b}U"a ¥$ÔøLöú Ú]m)†z¿&À…ý<8Ã.®Ml¢!¢ê‡îZãh¤²Ê0ì«/TZ@7èÌ ÂöywYùÛ¢Lõæ…HÏ^Éù•Jx©‰šs¿aVP›€ÒÚý67˜õñy凞±K¨m5,û»ZB£®˜ÆL¬XmF2fŒ!ÅçŸÇ† EZ–½@Ò¾.-°ò$J-»¡ù×뮽t‡ó™ØºŽVmig«4g3Ã÷²ÊW/@°ˆ{5 µÞ=o¯‹«! Åršÿ‹2θc’¿g4.«ñ§9KXK$ø*âîë^kµÉå¤ÅçЇ%(u<¶SªÀÏðè9a’’.ƒãRØTp=XÐæ—”cQáMÄÿ¯ züõüðkûÙGû˜›²‹V®<àÔv3õÒe‹ûÁh úq±npÆZv§ÙÕ¶ßvßv:Î/;èÚPexæä~΂#\TcmÍs0Æà…B›(®d²Õ…PXmö´*8ò)¼>j’êùQxEC¤ê§ä''LOŒÌ/´Í˜Êd/û’¸à¬Z6óR¤ô-[b¨¥K~@'3V¾841úòt‡¡²{Ä,‘sì Ì8{fúŒ» z;Q“UχHê·°R«‡­ž¿sØ$'ô¾Ï3_äûŽîÜà…@¾¦6R 4O«ýxmĄ̂‚FDs–jTކv› ªZ²yFö ~)Ma&퀗M/™ÀÜYk?" HìI›PÓÜã6ý`B¼ðlaüÜÓï•À’µ1põLŒUåIp  dxÀß¹å(ј¥û§M¶% ÷hˆ8#ÞuíüÍûÑ'× ö=kÊhS*\Yßæëix5m hWÝW%‰­üäñk0Í®:ø¤1`¢Ï¯l®NtLy’Ô/)žáÛÍ£Påž7\ZN72y¡WŸ¾sß|Ð Kñ.kž$À,Ýô‰×z¡Îuv„O~ç^(À_ýß,} mÞç´HRfn¼ ãîò!»yp¯±sØ)D$h|™ŠE«-,>IâiÞDr\"þà‰ñ6ÐØ~q/kÕˆL‡ÞÏqbE8£Â ßøE•ÕS”ØÆEݹP‹û€ÃÓ÷0Ä3ŽhÌbkž°7ßÚóZa3/qÀ©+Λä%žËÏÙpWûŸZà]ê}CØ=óýÉ]“X¬ˆ5· ª˜1§×bW·à_)`tøû³'EÝë$프òr}l`7ÝÌQŸÚ9x*¤Tƒåy{öÒY ¿¶<78iò3UçI9ŒßaDØémù—• Ó¡üs-)rU{Ý%*ˆd†úò ú#'©³Šj>¸Sz Lû;ä?"h›ËëºVø«’Pd;/Jþ¢_c‡ËE…5çe^M`òÕ=¯ƒ zŸ›¹0î…“6PI5q’™­7Fq=ÆÿFŠ_1?û"«ª©‘Ðæ(KDìä’×¥Ð4û ‹e§q”ñ€=´tÏ<9OZ`JY…ÈY$½äÀ2;úÔ*“Hl¡ßb={!õP½f üL†‰Ë{†Þ‡ƒ`“dtPйn:N†MΫÂJ_GرÝTÅ‚¼z_¨6w…‘cë\Ý;bç$/¡eÁZFA nbŒ,AtªIx,i¢Ø-nÀŽm‹¹ñ@&G¢xt´x!Rî(k¯±'<¿;`ŽdìÔ¥kQêÍg‹™®ë)N$–Þ¢¥HÞWW?.€3ÔmÁz‘‚EQƒÜÝfº—Éeò#ŒËЩ!ÏŒ©s…f_7•ƒ*Ø£Þ>3<™ÎH^«KðYƒÙ5÷ru‘v—“u˽jR1òg î^ð‰Ë†MÜü,‡dþò‡œ<È#Ñ®$`Ú'Ó¯VÏRt â"@e4Vž~ß,sm[ ¤b->Óh»i}äyŸ·?pqòZÉô³‚à&làƒ™,u.KFK™·2 ”&¼'M)k~[j}¡ˆÿ±óÿzà4Öôm6&xïÿà#9Uá’Š@¡—2üå§ÇÆ€=õs-!@&ºÐþîÊa7d˜÷êPÚ¿% 8ò†j¼~ìÆPöXl;IÞjßÒKÍG×€¶½¨ü£LßçfᎃaF×ÞBòk*?§¾Ù~‘î×›ÞÀ±&Š$§eUVµaßw+câë ƒMø>"nt²Í9çŒ|Ý@jœ+Øñ}%¼51¾#kÛ“7¬!še‹ÛþŒžîYô‰µJûÇ«½«Û3Òá– Û ÿ×ÀRä'sÈ­SE¶6î¡2в#§ÊÒmù¼NUn>‘8­®¯—ØuÅW¼'©ŸN‘sMƒ@sµez@KÚwζwøçuæÙ…¼åGÅkö7.«´¡@ºª•–ÁNð¾¶Ç°å4XÂ=üá÷@‰EtWGLè HœŒ ×f;»$h°EÑXZ­4´òþõŒS“#s¯;ÖE7^¹à}t‚ׇGü»îbë@ ˜„VehðrØ&“jÔ#냉È7wZe–n Ë¥Ô*‚øºÑ’÷wƒ>+2L&ÎÂ?šäï|=^Ò ül(ÕW, 9£›i=f€¶ÈŠŽ"Îö¯7ã-˜™L.( ”5ÈßòÞoãkÅF‹·*týúÙ4U_þF ­lâîÓ ÷û‚ÖŒžðù7ûÓ,¨p1`ˆR ¿rˆ÷[´´,6˯û)¹cå:…Ý_¦7!1¬û–ÕDèv¯>9J-ÛeKðÜo \ÈÇ{}#ðFh ¤ªdÀ…Ð1´½8p8,n©%A©zö‹Ÿùèõ•ŽT°ÉÛö£Ø7M±@€½1ó‚ Œ>'uýr†ýj7 `Tµ·vØé°åWrcb£ZoŽäQØlpZA÷©r§ÿ ,f ôÙ¯'o{-DmLpÛ«ær·²5ƒ1»»’‚4¢.…¨ % ´¢Â,k­÷¢™GµÇz£gÒ&BZù=¼Œ4©ôK KdÍ(,﫞þÕG)åÖÎ=¿¢äÔ†L X޼|Á«bQºOý%†Ñ˜A„4ÍíR§gmI‚ÊÓJŒdlCÚÝÖÔMVê…ØËæ=6׎qps%ú=°*"ŽP|X¥ ,>3õ{ûUF#¨äæ:ÈÛƒÀ‘¸Ìø³ö‹£†µ¯H‘f÷æžSÔ„ Yl)}Ó8”OhM“¬Ùo(S˜ú ´XøUîY놑Lëá„‚¨‹ .ªOjì’y5N‡ 3öá’ø®wä4|eEøTãÜo5(–ÂkF5š¥ã¿¯ÇD|1<ë¢èT‘ÍdËHš0¹°èš ³’%¦‘iƒQ§\@zÁ3œéÃþžßG¢±eaë‹0Ê“0‡†X3N¸J%±< LçH¥Øº§‡‹àë×sLµ†5ÁñŽ™-‘þ+Zˆ(Ñ)Iùn9Ì‹|øép+€¿ñÈN ´Ô ~3[ƒ¸ÀÕƒWÙ1TÎcëù â_³£_!+|€ygžø4Y¥h—¬kOôÃ^®neçSKçô‹ÌÏw„5 ¼1…(É} .®¾p†ĸb\‘©’¦ÔõÌ燀Th…W~ó‚Úd c¨‹æ"3ƨԪó™X´´ËŒÕ>ÃÀ”Ðoy»–“‰6% s&TL°nËPªGÑD§SJ¼« PàN9V¾½-??ÅG«?ÀùM6bÓ ƒfZ Ç‘2lÛªTÿÆã·ŠÑõµYŠHSã×ÔwóúšO¢Y‡oðÄ^MVj9¦!k+û‡{Ú5,ƒIÆÏè4 ºvâð$ë žuœê/_MèåMºÄÄ­Á¶u‹1YQá|Öê_}ÌÎÚ£«÷” k†;YË â}»å¡µïX›ÿ>€ÁCÚlG°!c&º…ŽXþ_l`žüÁI–ˆ Yu,¬½PKXàx˜ë’Ñl¥yÖ†öÚ@Å­ÔXï€A‹o“øå°—fË}žE4¬/šZê*:[ÊÓE*;+›ÊM¦‚~å“.ˆ[ÊA5 Ã&iEÙv°:G]BPÒ\j¦ÜI›àÈh>QsL9ùƒ3Ï5smt±¢MI0®fðîD 8ÜÕXÀƈÄAµgR¿¡a€é áåžµ kÿÿ‰hˆ Þw5º|fÃ/'cš2ÿ;êAg ªÝÉ{¦©¡1”¬€­~œR0üç;\YýG À0?cE?lfÉY£• {T`O÷zSq¶0zn$*ÌŒXI@½éø«.Þ"|.¿uS*BÌ1­6‡«g-Ð CC¬½n[Æa:ę́#xÇHA¸k­Ägä¿^¦ëPÇÿ²Ò: jEûp¦øÄØY±þ¤qÂKè=cÜ×'K¸Š¸.Ï<¿o{¬Õ.ÄÔ1r‘3ü½Ù5ó|ÿ±û?æ´+O¾‚*0ž#ØÓej6A†¿ˆð8±ž-å»Rp“Œ©ÐJ)±qX<º˜‘›ÜiÐ Î}Ó`-[qr>TÜ#˜¥YêÛ>‹@¡²ì‹'ûâë¹\¾šþÜ$æO¤¬Èøs„ ëž©´ãc$¢Uo¾Õ·´F‹iéþCª“FnQÒT}ÓŸàŒg”+¦H&Hª¹›ÁŒ³™Il4~:—+åk»Ÿ#ÿ@öñ^¦u?d!ƒ@ÏÓâµ#Er¨Q{¸ÖXAk5u;hÔœü i7Í =mèÉÔŽí)b’räYê·,ψu‡Â^hJËê¸~¢ßÓ°îÿÕY Rü‹#1vô§°‘@uT±—›ª:„|Þ(É8k§£xcêÈr¼khŽE„Eû¯_ £ÁI,ÃçLJêåpgXõÏ6w¶ü:!lkyßµIL5@=†& XqtDë~Kû`ñÈmÞxÁthîZ ÀåÚí½¤þ´$¹J-ïº!KeØ"s‰€7 Äþl!&# 3̦81p‘¹Ô›Àè)Æ:"ijȷ2™É\-PŠ9Ôú¦º0¼"˜žŒ‡aPueAÕ²úÖ'áÆZ,3'J¬¾Í´Gæ¡ <¦”Âi`ÊœT¢ò2Ë,2Ì;À 㓸ãR/‹ú¿ ¤ÄIô}Çíâx7ýe@[Ôò}@4bòÁ\/騾'ÆþýóŸt›ÕÈÒ’;Ê]QPr`_ò§ŸN‰œôŠø_ÄšÆj¾Â˧J‘¼^£ç—gmÞ%ÉܽVæ-·iÐd´˜ªZýë[¤ÜÛʈánf¾{n—šGT0\:„ï•…¨v™&ŽÄÃé]À¨óÀkåô‡ÂÅk›ÍÏ$d(OXY˜)‰qêz"JNMÙô¾öÚè™Åwo o:6Ø@1ý.…Ætâåò~\™<2~_ï[†?7ØÆ“7¡¿bÕ>ËD£ÿ­^8ÔâÉÚ‚¿fò7/35 0i—Ö®)ìþK²Èù0¢ÖØ¡»Û0Y_«<‚$ ©¤Ã-â&•ø\j!"åµ[,ãÙq.¨7ˆ|®Zƨ½^Áîv¦ r™ÿz¶ç)²Ð#±iMÍq’Ö…»/æS+»ÕmàiI(ËÃ2$eÀ.ñ7+‡^x&€7Í íñ,\Ÿ2F l-Ü^~ZÐQ&õa êýlÐ+Fíbeªu-ˆZ\=Ê9ä¥ÿÍÑBH£{a$™de‰ªÇ7wDã¾ü/ZzkÌœCtêk,Í+MïˆÒ›tñÚ¯œRÁ €íE‚ï ¡ûMù°u‡ƒï5êy œjÏü›ª:@]d“„]3=8mRa?ÒÂ[˜ýRTt¸¿M»Œ:tK–»“us}LíY*ðø§èy¥n±uÜõ(Ks%Ubï¨ “š§'w"y#@ïqÇË|{.I‘I"%§ò«ÿ[V¦¤'ÌcmˆGþ»ìv±W¹%9-ÓI+|‰{ÉËÉ\öö¡+¢I~'˜Õµ2ÿKä{–#å¿¿ÚA^ËñSh¬P)âÍÚ°Êb½¢œZ}†÷q"+Àþt)oΆ³†w¹¥œ­74üìì?úðA¾\Ä §õ³]nç /Räò¼bw‰ãºlG 4; Qì'Í_ïüŸ„¢$W,›Ìµ¸\pÊk“›Kèµ¶ ý<ó0¬cöMÙù8æL㟲X9l³„þ¾Å3Ñ´‡†eíÞö˜ƒKiLèoù¥(ÏHGZ6¬¸N±…ÐtN[1S Žë=t­0ödÑÖJ¼‚`÷ÿ›T1Ü¿“z:ÈÜfÎ\XÛ(Œö%±—ZNÊ£?¨{å´N– œlíhâ!,É›3{€žÎãõÛ~ÒPù=€Q‹Ï¢Ï 6á"µ½‰9…èn÷¯jžã‡X±ã;+‘,ž-ìŸE7åÀíô¦ ,Ôu70VSý§`á™Íp"GýYÔ÷JS¾#×ÓÝbgƒy˜•@ï¡„úá QOLçn|€ÊÇWÓ©vb¥:Ø^`/ DM»¶×é-ã¡»ãl‡ Cö)Lsè+PŠp‹/Þ$亂1Û±1¶PþúFê–“\a3 ö´^å*9ëEY\"ŽÙô»}”@gÖ2-}–Ïxf'£7²²7SHä³²GÄ"böWó[Âaµ´3C,ÒÓ !=ïuÐj¢þ0¢†½kNW--nM‰õV52 Õî ³¶ô¡¨+ȉRœÉm¼í©¸€À\°@Õa/Šæ’ìÞ¤DIö i„lØ?ð=ÎʆAõ 6„|Æ­HÇcD¨A˜ôWÝ^ÝÎ㈧X«ÿ¯Hv‡¤¨@ÃìHz-áNÎ<ðœ#2lpé&}"õ–ÓÃ’ˆHpAï áÑL)[!ð£3õ@&œ®òmnÁ–ÞNa`²„=þ:]ŽêÙþ JÅZ4òUH Šî*ýª ™A2ÖrÃaŽù¬“ÿŽ„îpÊ_M]ê°›i­ÒH¤Ð ¥¿Å|û €(É1$\ìºøwµH·¬§ž KjoÃãñ…Ïký\ˆ¾½©%ß -¤Ž‘1νýÁúDè²N\£­xű4Ýnº,jµâÛêûİÄ`¬ }ïò²m­^¯=0JªEòvã­ äìñý¯èŠc¸ùS~W°*\ë„Ëj˜lò«e,þºQÿÂLõTGùr ¶BÈZ¨žéæj£Ühÿå¹g5®Ó¶’XRäõQ”ÑãæeÑÌ¡t/œéä Ž\T+ÛQu¾ú&³R6ê+ï^¶myÈ,쉡- ÓYÍÍéá4,Ï °äº4á¨TئÕ¬ ¨?Î3ó&Àá~rïä“ î@†sß›ž$ õÀŠW¡»ä¸õñþéiƒ[c ”GÆ(Žáô§¨ÔDÇÒSÀbÃŽnŒ0:ÉOøàg –ÛºæÀ¨ç·Ûö!ÿX ÓMøã‹ã$ÞNS?‡N’¦ >"À}éÇåÂTmg$_#ƒHÝQdÌ3ŸpÊÿ–§En1YМLºìÉe’ìè•ÃÇ&+•cÚÒŽ7;‰¹•ç:Áò’«Vš']pSbÏSÈ,Å\Ïüm¦+ۯׂÖ”»¢sVn¹Ïn´£´ÃÈþ,…Øú6»ÚüPh\CMNñ³•‡`)òÜIº~ åBžnãŸ%×ob‚ŸÍûòŒÛ¥ÍAD«‡¾ZBó+kÅäJFucD;9Ù…‹ª—Ðóäç }‡Âôè‚ÏFLÿ¨^ïðC‰CVÞ æM#óÕÛÓQ5£Æø‚uL+äM¹*i.SŸ·¸iyÐ^€dŠuÏO€­cþ‰ˆf‚n~Ë-¸˜ÃŽøÞå%oäÏ÷ˆ†ý¬êDÈJ/ýXº0ÖÚþ\ŸÓüQuÚò C<çG/~¸¿ß [ìøhæ²”‹"æÌ”ñfNä…ðê(˜ç±8²1x•V Ä ô ã˜Dn(Öš¿üÇ`N :èîÒFQxå¤Zíáøæéq4cø¸Åûí Б£)`j²¼›F3O2Oû~Òªô€¾œsÆê›ïNMCfâÊ›%+á(ÿÇ™4æ&]ºYŽ£'4²˜ÂÏJ i95—ýõ2åѪ¤à5ÖÿSÊö3'ÄfbÎÉ¡ª]ÆK„½ÿg¡‚¬T¸·ãbSÝ7$ ¨P¶g·âVDÒïcÍhR›ÈfCmT Ðhu3n@GRd‰}DM˜N(žðköƒå$ý ]~xYÖø¢º%<ö­¢´Õ"r ³›vïy/|ËNmý™¸=íkHÖ㻂ÅKFå,ÿðÏh±zx/™G<|‰´ˆæ#£ø×ùÄè,µ—Œ:‘Æ“úæ C²¹E…w~K݃_©ªzƒãË WuÚjÙ¢+½ÈÌ}‡¶>›ð¸‹° ñ†Ö^õõG¥4dß›@m¦~~"$0Ë™épÅ-ÅQ¸ŠÃ»üò]Œ1e)# !²h¼ 1yíàJ©ÚâR!ÓŽ.kEêþ":m&¸JŸê•ÇPêÜW­Í*&p]Ì‘¹0n}›™ÖëpŒ|A·l¦œ· ,©æé“è SÉÇ;ä‰ÔÈë“7öܤ-àÆr]ðÙ` ÌšÖ‡£)t© Q%ñ[f5÷(4gè½G¡­Ý}C1‹ œñÉf0^@pŸx•: GÅ?(,Ë5»öpà#C@3#'4y…wc^%v´ â[Gp…–=ÐÍ€r}Õ0ƒ2·¢!ž½À‰(¿¿².?Çš†(Ì÷$¿P0°a8"VJäM¬.£8ø±ºˆ™9 8%Ðl`{qÐÌ––®7Ö3?ÅÆ‹W†o P±þ®kà›QUÆú8ï›G̦Ù²ºdÇàó¥a¢zDí¨‡Bo¯ê–› ×4ÊÅ!ÜBÓÑL¬?¤¦þ“tà k‡À‹_öçí«ïØ‘ Z\0ûtŽxÌoÕ5tŸàyŠ<–7¼Ö1mùy±•Jbê‚èŠ(bõÁ)µñï]–ãwòŒ}P‹Ï¼eV(@4÷8伬,š"–ügL."‹»$ñ EÈ€Ôh)¥eÔïvLiâEÇOpþ€÷»i¨•Á®ío«­÷ éU1²¸ÿãmbQˆçbIæ¶Ø ÞŸ¦Kl“‹{[—¿”PÇB€"[ú~O:U`QVšFcô®­Ò¼ùôñ9g†Ê¾&…-S”gó!*tÀÛ¿?’>‘Ò\9¡ßºb¼`ƒ'øýcïÆš×;ÖïeStKŠÏ4Ï›¥×ªíÄÊ ‹²°‚q„sôuHÄLÝk7 ÚxÕsÈrœ°mµ"W‹‘hàÔMƒ¶¿b±W†•A«°{¹'ùr ©»#ÊÊnŠº‚‚vÏ&Ý€•G8†º_`xk@A€;µ3WßbÀ‚ÂÉû ËãÅÊpà·ôc1ƒiÔ‹ÒûŒæo Œ×ÐK7ôü‘þD£ôy@J5ÉK(ç’;žBPb¢n–!žú«=|Ÿï6ùïn(„3©õbr&Ó¯ ÈiÝŃ?ðå¯Å}-—=’žˆ¯»{ªj}¤Ì+X©Œ\îÄ“EøÏ8-Š'õ«9c¿©W* 0D “)†¸Øn«åâ8™C®6à´EÊ©¡i[,4m4BÅ5?©W×¶¨š‘ç”Ij…ª¢‹ýmú}hŒTOO•i8m DÈ›‡üâßû\êFYWcËà uÈOIRùd…È•c¼ÿ®&†¹f\6ùÒê.’f΄rÀö¬-§(OŽäTrXß+ë•Öjð¬xp,$a²b¯âä‰( D×#×è÷¥hŽ90\ÒãC½z~:îùQ3a’;ÝZ}îŽXÇæO¥âžqWB¥1^^W<·«Ô5}Ý[¾ýó½M¾ó/÷kÀ”¦>ê[-Ÿž-™øÖÆ'LŠuCÞ¿,EöÉ•œ–t\’¤¢ƒ¦g»Aõ10ælþxe‚vBÅõíC¦?ÿf¡¨yr*¸§Æ#°HÐ*(NÉçë ‘«Ð0d\N‹¡¶Y®çK¶Õ!èÃdúëÔå&S Š©%F ¶a«¨~èEv¨ 2Ù1[-g)gÜÛL&?›¶ô&U/ 㬠~Ãòa|°*nzñ"kóÇ>€na"úˆ%bs1 ï¡ðÞÉ8EÿSÍp\ÔèA´µÄð wàqœWÅóaa Q¬&dÇ'h†q7¶{™»‘uˆ/Û/Áûå%õ#VùjôŒ| 䕆ú'KoeöFɬ2zI¸Dþ-V!p`” Ýòú#,¿Š¼rÜ’[,üÌÛ ¤Ã»ÍÇìUNY¥Ù«&ξ©%Ý?OÀß׫‰Ðf¬™ „û³BKççº]2ÐÜ)%—†è}[éO$ì½WX¡µ‹È';¬p ƒ1Æ ›794£ÂçB¤5£‚*…î‰`Ìæ<àì­ÙÌØ(2¤E#öIdÏo]°‚û<sL¸~*ô NÈæJ¨ä; ㋞qøF™€L…hpøAºS–6lV¾H"ÛÓ¥Ú}ßúd]#VÉ÷‡Ûn+y®9¿-*º…ŃðÒ´(1o¿võ$ëd1šÐò½nìÀ¦K éðxÑI”F¼9é9¹Þ ëè¥Ú5ˆO_ß3ô¹X2‰Ì%> Ö°o2E’Ì%ʽæ£à¯°y*¹Ã«i†£Ž¼IÉoN®·ŽåNãþÇÃ<µKò’ÖBkZ„h#L1d·+¢ÒIA%ëáïez3`ãøŸ€oÜq`”é}áÝd¡o³@¡%Œ„'Ó0ÂÞàt2d¹öc3ÝÛe,¯û}½Ð&Õ á¦%p‹'…Ø:W{w@/-jbÔ×$ÒÎ=Z´S|SV~|lºÂ®¹‹`à«#{P±õ-#xoó„mú ÝqƒñOÛ>Ä¥÷XÛ¼rjœ²vŸK&*¶%$”2Üt¹ßúcA‰ñ5 À¨ÉŒ¾œ$ŠÂ.'K•,}ye{Oï^…µ;ƒõ›êì'µ+H!Jö—€• R»Cm3‘¿¶­âE&–~BÊ¢åÃU€V[ö$Ó&1}íe8¼ýŠçk€1úôŸ2/­FhÒî£>œD.U+yBŒMÛÙÿC÷QÑîäVv‡ Ã" wÒã³hÕo~p—È• ‚©'•ó.ˆa դʟ—™×ôFdÀ n×2Vp§õÜ‹áAæÙ‚|ÿ£‰uˆ7u1¯äôÈù®ƒóø¯Ê¯ƒüúìÖŸñìt{ÊÉ~H•´õ™   ü„6Dœ£l¸Άœ·´“(Š«½ñs Áœ¼ 3·ª Fó£ÿÚÁðaî~‡"¦ 0NW˜X¥¾'±ù6xV† ¡OdêœZö%·ŠªûVûtŒ\º;sšª LÔÔÎ^zWÕSwH[,‘¹$1B÷Ü-ØS¨2x§Âsž/Ïyl,òŒŸŽ ÑH`©+ïû„áö:t>*€Ã¨^¹Êž™iÌ ¤Œ]y±˜U\>@öôfrT­¾Zð!WàxNåö(¦ƒuèã“Jr˜†Õ¥Fá¬Í‘ÝïÖ÷®8~˜uÂ$¡GþNyš~è³iYŸË—%KCw: W_Ž}ÓÉê‚l—KMÏ1 ›^¡{ÀXTA$ ãPîx#-è4ü“NÙ$žÎŸèüÅi¡ù¨7ư`‘M”Af¬åp’svÅÅýãÛ÷6FŒ}éCU›hpÙ¡ k(Åpß-ÚuÄ—ÓK”…b>œwü|ÚØ1БoÍ~+e‚ûøñ+x}çW×rÏg,fú7Í“pŸryŸ¯VPå¡9û¸ºrãGuNºÜÀÖi§"2½µš¯}†~€Ñ Bei*Ï]Ï%’ET÷9m¼7)""‚)î£øØ0 ²U~Q¬¦ˆÓì¢Öó±‚4ˆE}œ£,É.ظ—;ûÝût¡€æ'y¾BVjÿPå®ñ¹U ¦”¬¼(¢n¢<ÚË&ò2ëcûÏxr^“ìHŸC{¢¯0 2ÝÊÛ¹¤ïŠTømeƒ·MÒIKiPqˆ ÁÀÀú¦b·ç$&s7öòµ­KLÙÿJKh±1B{I{Ôtïc+¹o~Á-wk*Î3½Àâ¥ÈÈSFd;)$Õ>>±»z7°îvÿI“(@ƒhåž?Ý@8ÐÔæg¨fÚ`Ù~ú8®§õîö=ý 4ÚG+»DÁKF Ï:ž@Ε¸©¿_çÀ" „Oã'^”͵å!]'lœüo¢7ËmRZ春¸ ®±ZcÕë*\õi2활?.Øk ‡Å†}„i(ñTÁñÃ|}èü‘ Øçè/t —CíÑ=yÖU‡%¦'HË•W",¢:l|íƒf¯"¤ä¹_á@'ÄërK§-pÛ¬˜qÃÐæª^ÅT+S^&Ÿ¤lÁ1ÖÜù$ ±ìí>í8iж*Þ…óIÄfÊéŒò‡ûIÿÆ‹ † y¯Ϫ ê¹v$B\»mQ…?tŽ(`[öXµáp\¯vц\ ¾š.ÖcáÒO˜Pœ|Ì}ý:Ú}¥š¼½í÷Dr-IÒ!oYh5%óX]T»øR'ôNmÌÿ€20ÅUáillŠ Œ”GÈÀ°&©U™²h½ØRæÎ8Që²s㈤Յ{ÂRt^뎗èè3¸T˜> fÿá†pÄIÝm˜Â„r)…ÎYİaÏþ)@}¿FWi#è€Ôl 2 åoõÜò¾™‚B  îH ³í… Š ÔÌ Ð^,°¿úCl¸«žÜïaÙ¬”åÁ˜!)úþ&È`ðBb×D·“RÙæÖöe3l%#ˆod’, !$G;ÜUa•ÓØ‚Á‡«y.E¼Ï¿—4ÿç?—еAŸ.ÿ‡è+¥ jÄÀæ¨j)’ нÆ$¡Ñüô5bI~•’JŒ´$8ˉ)QA“'öÑÛ¥à˜wït&*n=(øã³«ÔÿæxÏ…E†¤ŸØæz5ý--µç¬ÑlÁ²E Îö‘–t§¨…ÛÝD’ù-ÈD†U+u8+E ˆoî ÄÖ7}ÒÉE=˺%~ìFÌM Þ±Ò¥¦@Ühqë{­.ò/Þô=\m91Z ¸Œ?ÊC± éæzÒ?)7»C2ÌÊú¨˜’6Þ˜F.Ž·6}HìJ¢Å¹@?†¤ˆ¬PëÂë̇!ÕÛÝ YT°!I6àèö.H±6×¹–Qqÿ"óïÄ~Ûær„6‚#hôÐ}qK'q^ AŠ[Ýh§óÂ{š‡g¤ÅZ ÊDòã†ÿlWuй¦Í³ Æ¥ú¸¾s!æ™k2-Në ÅsG¦]2œû dˆO(ôó7H/€‹-Ö‹c‘:†rÑxC},°øý;uWЍ¶kvß`!YîžÁl×r%ß‘à\“MÍóŒ }½9­ËÊ­Z‘-Ìð a71jÿmûrY¢oúŸ‡P #± ´ˆ" ºéqF's½TÆÙn‡šîÚåZÞë¾Ï‡Müƒ¼ ç\Ë#O%.¯_^sæËÁc=1%=­Å¸ÿ~ö R—ïâ›F‹ _œs…ÝðýN¶‘Scß{”ÝÏg(':ŵ:¥dL‹ˆ0XŠÑ=T'¡f¡+[ß °2 àȧ€=}]u5Zaƒ…ˆÅE¡w¬9;­¤mÂ/Z~÷*->®¸L£\6žvPW?½÷¤g_“êá%#j§ó¤åS©‡MùÑ•Â<·2êC³9 [Bó¶Y£jšåÂô.$¥m>¡áåiCd‡<ãYJÓ?²€ˆ¦—TKXyÛþþ­Þ-¥m íA#*YäPÐ .ãjS³þ׸!<¿ˆ@2]ó0?ü`E‡0 ’Î7Þ6HÒÖò]ãöÿYiðÓNá–P£ªŠ°ü÷cÙÁªxôÞ[‚)#+ˆQ—Åj5ÁGá`pr|ŠAêÌì¢Vöè;x1±cu¡•ó0؃¤±ôÂ:”™z3Gbyó\½'ÙZt’úGåÎ%åê¸èÕÛ$öá]£Á©¥ÓÐSÊWޝïÔ`C“‰¢×X§Œ@ðÔ¡òd,!/%çý‰.©«C=4YG~. µ;W/ÎêõgnN-LAí,‹,Õž5ï"¢üHèŸJ‚A=’Òeí°úù}?œZ1c0 °„M!·þ£ëUd½‘î%öÔЪޮtx}”3«S>àR—~«ò¥e÷ëÁ%ÝT´ýÕÓŸß&VTÇ1ª/˜™‹‹È_²—Ѝòmíƒ?Oº&±|Ehçb𠚉8޼*™5M¯7ÁŸiá–ÚŠ€UI¥@Í84^jZp Œ=Í G%¥é›ê¶»ˆ©³ÏÍ‹• ðšr2!Q/çÖ°ÿ#2Y+—ÙtÜ£ù"Ÿ ñ«FY¸“4ºþÉ~KMxD¶Î½À“d»'˜¨€5{ò«#È+GØuË@úZï7J줛úTЧ#…Uú¦ ?*àó6™ÇÏãß¿€Gº”@TA ádì×—i;ìa d'OºdlàуÖrgÍf¸uyN¢ÒˆâG¶›jÒ…±B¾Ð JƒƒŸã-° XìEÇÿ;Øs‘ÅÐ퇾!:Á½bè+—‡² FD9È`hi}*‘lÏyvaó=³t’•´Îƒ„—;'ÁèKÎW·ÁÀ T¢ 󨹅ÌÎJ–}ЩðßyÂ\(qÛ:+äÜ|ýLš½8²mGHd3KË@–Ò /¦\'o…•Vâ `¸î.«À›°–ߤ€Z¶ÓTô“RÖ~Ê«z#ËŒ(«IeÏ”'™_.r‚CEàjMŒ?+H…þ¨Ž!Øô†•zWì ·f£¿g°Ò5-‹<¼¥ãAæãv¦>GºæyD¥‹ckõ5Ót?º–)"†ß”¤/€ù?þ¼sAdš‘)Ç_Åuå' þ”êÌ´4'OuI×.ê?|¿—^æ5FsÔ‡(•m./-â'ycš08\WÿHY!'ÙIÈÄÓ:1:Ç «”ŠõÛà|¹µØÞ^ ˜‹ÌúÐdÑÒ‡Å¶Ž¸ä!¬É`fNl{i0ºz…’ÁvyâÈ$T<žÓÜÑõx%ó繓±B 1œä«+ì l#ùwæøò jµöVTJHÖØ€*ȉ½ÙÈØ~\k¡ÿ|° œ”ܶì5n°¯Ÿ¬¦^¶tl6¤9˜ÿXó.ÊðR²úµ.¢±\K@xd€Åc0Ýò]“Jag°¢Ü'ªÃߣë·w0°´xÀØS‹:?Á~c M.¦þ\I€Ùµg2tÉ$³/†xˆÆD€3ú—ío•ÄM‹fD€ö>::óù¹T98z¯ A ¶|ìÇ—v@ÆÙ %pªí=kw|nõ¿tʃ•N^êYê u?#÷Õ˜¦jÒœ:Jþޏ^_FP;@e8ùLØ»zËQg°Oþ´ÀùÇQYêIE\ßòr…jÕ¼.µÕ4¬Æ¥,•8×b(T‘N#.Å2¶Rëá½ù‘˜ãr§'+¨ „ÖMñS¾VWû‰\Œ© ~àjÞ'ß ‡…jo:3Ü¥?µ¤[ýÿ¿1¾ñ̦¤Zð «“Hð ¨P™¹ÆÄç—25"aÙ·µÞÂêw8R„¿œ2“†ä+?w=V؃ò*µÓ&¬D }î39²QÎŽ„¿À¡ÞŠ4©§yç¾GîhŸd±åØöýÍTJqÄÝãåýúÙO”4åxP\$tM)DƒÝ†@t 1©H«wwñV´€Ýÿßâ<þ˜c4o~$ô&CǤ‚T‘ôQ=˜Gã ½“dNL$>\LG;ªñõÔòNétLÌh´?ŒL?²¦ï9Þ$¤ÑªÏ¯›;FÁ ­lÃ. ÕÝV£øíÆŒWɸ@´ÒÞb”*åõI™«8ÝSê¥SÕ¥u¨;/œ=’dÏqNç®k[vï9ig§¥¥@ýub€[¿—&ä‚2ÿèâ&Ç^d)g]ºy–¸Š7§þU™­7zò8sFÆêïV±(Æà3ô, ºE€Ä`l6â‚¡áÅ‹Ïõ”^µñBå€ÐÞè»ÖJâø(lŸT_ðå{¬èÊI¡N™´‘Ë2Ùž êNÇc×4±OбóaÌdÌjPŒ'Î÷~jñmNt¡±‹åoK UáÓÇÜÿ*Î@ˆXp#ý”¿³ÛT¿jåÒ¼Âó}[§ÊjvªÕT‹û…¿hˆ¿Qì.;䔩텭O4± G +Çyå³dTQƒs$‚¡mÄ•‰¼ëÅ Ê©GÁ”OÏ;¢[à#{N«“é k=ÂØò$´&¤ÞÑÈvDwö2‹c|Œó×Á9®XÔȯÄ_Ç³ÖÆÏφp㎩mÕyÇê^ñ%jm„à XC›¨Ôážë¸íÁ^Æ$,Aš¤j¯‰jãþ­)Ø?÷·„"1÷û8ÃŒc/ÏÎrÆÙ*‹19]IÊî?áz1H–°TˆÅ"G÷žL3ô-û¹9. ú¼Ï?KaG<Ñ8°Uø”¡“.IOUCm¯óEe†®òõûN­lm‘ äø^$oZïÔÆÿ’­¬à5d°êÀëØ3õ)ü(J_¯ +8ܬµ$¾Šdãd×M5Ž‹q)(3acv\Ù®‰¦<€ÅR„c°›LÖ4ÏÕ#B0ÏaËT¸y†GWÉœÇ0":Cs—?IwGå¹Añxú•,ä?æBí¾ ÈÛ‰ Ò™¡q½Ð'IŽfOV7ýß„ªméÌyÜ¥äüâ­êÇ‘ î•mHÚ°A`T Ng>o~&p%º9î;„ƒ#;€Ùe4ôA¢Ç³†É¹ì7ªÜ tä‰=û{sÙTãÍa¹åëå#CŸÍ0¾3ÇߟñìÂâ^äC¦ÿÄÂ,®AYÌ©)ìÍ*‹«ß(ˆ¦âCkR}&o–âp ìÎLªWíg,‚þ¾Dû#*•ÇZ¬7𯟰'I†ÃšªáŠÛùmluµ8×Uª…> =ŒArfÐU¬}é \0íµ•-ûH~÷Êÿ¸rØ­»Ã^!p*k]y¬¾…ýY¢rϲ‚¾+„¬\_ð¢ÖŸ åzœþož"¬a3ÿ«{^Z0ÉVYÑUÏýæÎýD'­ :¢bž‡F7™],eHRm±Á|Ã:—‘IÞò3†ÃD]+Õ xg™h[¨£Œ¡7=c xz[LËöBhý3.&Â7#¡¸zä”R¿GŸb§Ô ‚‡µu3ûÃ2å*´·•$nGpÄ+ÖŒw¿tõD“ûœAÏ„8ñɼuÕíÊø_™&†<†Fã@C®•A™§+b°m½ÉÚþ·CîÓó0™¶;mÀs¦ó ͬTÑÁ&e¦ÜƒtH! .¯9záÿ (Q{Ù# :p†ª5GÝ#ÁŒK7IærñýV° pŒ3v¸È…×c¼]Ãw…DZÂÿÑž~ÇB]í¹æ8!ç+hS_­(ì« ‹²•éë¼-¿ÕîJøÖ—;töö™Ì(—R6ýØi³ÑÁÑ£êÇ%•PýŸèÖô¿í \7ílxü©;Pµ—‡žùòsP¨“‰àsÒlå0¬œ-LkƒêY ñ—1Gy)̱äbLrŒä u$oô°!Ëñ×+7¡l“á£)k0¼ì=ëV¥ÙZ÷å0 ¯Ò%³òœˆ‹â¢¥îŒ:¹M쉜«ÙéV¾8)‚]½{žzï oxýEƃæC.šsYøa™üüfño+“ó“yãAkþ¡ñY><˜c÷ÏÆ0ž¼@‹Bc*ka[¿™7qýAÜ=‰h±Ú¹uçïüÂa¡_io¢y³O“PÌøÖ6ƒ[Š›ã@+.µ„bí/¦³8`¼•.ëñe¨W„Ðw¹OO‚J° MýIÏz%, :ÿQÐ2¡ópiƒToÐQX[…† D'äÜ(TÓPÑY³,HÒ[ÏÝ¢‚ ²Á½T´c÷hFÜIÜ* s¿N·ÈWeæÔÚÆ` þ 9Ö]3GþÉ«G3réÌL ‡è›ª¸zÜá²Ï/aŒ;Ónö6«¨‡ó]Äq|JÓ§‹ËǤ:4!6¢†4×–Ó5>ÇŽCÚ»G VÈ,ËÓ»t{}-ÛÑè¦çdïAFÜNÜLùs°âÌ%±éœ¯A}Ëé«;x9‘HÒ[?‘³Ý‘SC™“p™zΟè ã72¦a% ªÂ4Æ–îAðj¢RÿEõÊßkæP-Q°{ÿãd9ET„ZÈ`UÓD\Ró“˜÷œ¨ (Wi"4øCZ¶ðyðö`ó³Ç‘N†®GhŠ0`+ส^`B0I-çv©ÝIê5ìɾ4Ò5b¹˜k«O;õ?ð¡:¤‹\q17íBŠà¿hÅj{0éÉ,ÜÏîFÒ*è s"ô\œ7©°ÿJ|Èîñ>Aþ`¢õF³'»híÔÍOEéi¥ Ú|@ò¦"ñ¶^WmœD¡¹øbئ: ¹†Û›r<•r£ÇG.»| {OÄÛªƅ)-β’³= èÛ0Q¶a˜b†àâÅÙéÝ‹~Ùª^«ý&ù¶Ec9uÏ @•±©å—PóuR½è³.¨Ÿ¤~_àƒB"`ðîü]úW½`›Nº¢ÚrYSºµ•ÂÂq$³ýCgÖÅM¸C.i©†¨»‚H(w¼?^ª8¼¯y’ˆ£D 🌣VOb>|pc6(¶oVgØp0[mSì…íçZò‰üAü*hãÀ©zºÞO¥›S¨¬ÆÏgܶµ°Qb/§!#!{÷ÜK.•¸ž§{JZ&pžzGò'=ùjzßRöv4³JÒófÈm-ëÊœzSÊOGô>ªEÅÒ~rhþ.º×‚þL ¡áš#ÿºiÿÄkÔ‹9Öîí„ßï?ôf¦‹ U-Ršh­]¢Œ¹‹¯Ì»êÍ™=Ë?ò]L\1Nå\—\Ä"‡ÿ½`´W}˜ V÷°ÿÈJÐOËáâ¿GS­•)fNCÉÑ0Þdž`¼3nWoÁ(+*ê5Þrvƒ²à"¶Wb_'yîe¬ëíDec„]y“ê6l&ÜÅžä¶Ä¶ }oe`²7§Fªþ¹bë±AðªÓ'«¡M;ú«(MI£ÂKDP5e¹©uoŸ3ÏׯÇJßî2š…8;9o'ªÅ6‚µlÐŒïo& `$ggqÀ,`~\Û‚¨iñ4ËÏ=3‡ˆ5ØÖ¾ ·"Ÿ2Сx ÒÛÜ@ÏÚÒ¦Påñ,`i§)§>õªÝ&±:a!^¡Æõît?¡¨ªœih½ÔYdãötßñkL•ïÚ'Š è!T‚t㪳zD'uoÏrŸz'±í23yo‚‹$-ïª:„èxšÌÖt&>œ Šö(–î§´IÀ·Ç^É S5rÞH %½Ö¦þ^ïÚZÛðÝ]³èüàÅcÈ‘=Tø’ Y WûŸªÜ1ßEZhiî(Ý|æ®ÑÚ¤©ïÑS«ü¸>«[YÙŠý¥g¶ªë<`lÒCûÙƒoP»_Þ˜6EL\Ûµ”å>K‚»Ô0òàÐå4Ȩ Œ …d”Ìa®pœ‹P?œ` _¿“õé½L*ùê+Ι%@3y7\µ,´D•–¼«QPЛƒg›Ä¡¨âñ„øßy}4Œ»¯é!¿i²S¢šï÷;cƱ;¡li\ÆâEð0ƒí3†ª„ÕYDVlrŒÝ!8_*r##…–Í>ƒöލ}ͯþü´óJl‚ÝŒ,q_³^8މ¯Êø,‡y‹cσsw_BÞǪF§=ϧÊöVƒZ…s°#FÞü/†Ô¾6Yëª[cõ4þ‚z…}¡[¥¤¦qºÊzÃÈù®–—~ΗyE½íôÅ¥^ÏÿÿØBp °¾\ìûËú{RqÚ—¼=å¹Â„bu"Îѳ3;YR…›+‚’n¿ Íøç}-2<¨™€=¼GYÜîhú¼~Ÿz‰vB“ræë…¤øÖŒ*ŠV;OÎ/׺˜‹ˆ uyÎAšlÆ—]ÉQ>iüÇç®­DYNß´ÑÙòvÚq`]s·ù’YGM’gѾӸÚlõƒò®«Ad.Öu3ÈœX¨VóaäzU¦Ž [¶_”TÇ¢·1û³drÊHN~vì¯>í%©Q` ÷]9´ÊxÛq …(0Máí¹åÀÇ›¸´.;lˆÖaL­Ã–-«¨Me‘J„QTZ.«âá†r'ayž`~Òx=~3qJÖÈ{†×†?›b+¨Ç\Õ›ö~*œ–®µno}vÞok D0àh9ñîÀ%64iô_æÛÝÌÍWPf c0ÕÐU@ÈêŸÛЗ+H„ߘб¥½æ1óå¾³Á¾ÀyUþƒãš ä§‹MØœ4›D}Ó‡õ=´Ž­f‹ë¥<+lƒ6Xÿê×XKº–"Û®Päå¯Nà1$ˆØØìˆ65½qè–õš\ƒ-llZl#ÝXyÖnÁXUèÖCgu½"Ba|j{ÊÝt—33%¾®¦öú±Y.ؘqXócŽŠüÝ ùÄíoþÏ•þ‘ׄøý Å=c×([¸.tÝñê_z‚`Q—ÂN¤bMߨ YêÎÙdíš=yÌ×™àFÃ×7O00¬&þcÌï®C\N æÌÃ\rPÁ-¯Òåçüòïÿ±ÈúÂààxQ|èA®#U4L2çò%¼ €É¼~¥íäzoþŽk`Îä§™\wx¼m@ôÛ»[$üÎÐêØ1"5G]ÛîOè­:|›ÛË»RÆŒ,«¹2‹ÀÚ«…B)•ãÊö®- Rà§Ã²3°\ôàéÔ±‰ˆ램'z¼÷º¬mÚžA7¢PÛpÃhµò~ ó Y8‚©oøÓÏ0«&¦«yð€Dç>kñ»Ýø'M+&7M3‡ZKOßâœ&å¸QiuÍ€Àu<9×OãˆÇŒ 7»§ƒY°æ)_÷M¸Èp”K| ZâubƳµå+&‚nMIG(›ñ9ÉY3$³T6l&×0ú¥$-«™ Õ[Gì­+ˆ†ÃÞ±­Fö$ÆÈaÜôz¼0TDÁ}e‚ò‚8«=Rÿ›ô3™È'éjGh£·3ý̽RŠÐ îæ(Ï®”_¼ºŒ+²úáéô<[à)ïjSl1Ø@éÔ|-) (^FH¹>å°0_}e`h LÔâUIZs,ä»5ßÇo4Ò9Ü*Kºh#Î\D¥(_‚ ¡vÊmp„ ¾v’!Ï7è˜úÃKÕv{<³óÝwݲì/ͨ§ªŸ¬ÕrƒÒœÇÃÓ§âG‘îfNÆM]ó%Õ“o±*öo¿+§ël¯ÁY±+‡‰¹ñǬZHž¦Ty å9«°Žßaú]pbÐ O´Û¸á3s„õõ9ü Ñ+TQ¤£®œoÉ›Bîæ$íDNÛ@™vvˆ"ص›Bi>Äe•k/;—Gˆu«0Ö·ìlÚ ýêÍJî××§í¾<^CEAìq,¶Ž*ʘ6*šÓÁå¸ðc$z_EÓ(:}´Qê JË[Ü’¤AO¼T´þïï­öMûÁ,ÁÅ(#3ÆñãÂ!Íó7„GKõµ×ò3¡*•c¬XREÂò‰[†*Tµ(l„pÕÈQÚŒº¨†Úiš-þ£tÁ›”lÕq­-¦)n£öfk/F²µ­,þÂÅÖ Â"ª½;1¤núb νkLjÅÍ5p*ðúײÂ*„B`Ì’ÿÜ×}¡Üž kÇ:¢©“+yö¾ãw—°rQ°ø0û3?ë£T-©•¥2•Ðæ?áæ¡ïä ÄzzÞ·h7Êäsp±%Æ{J£Òu£þX`,;iF‚£·a›ìü>‡Þ嶇û]“‰½õÃÜ@DSü•—f-öŠâ‹e0)V3Çòê&ñÇž¿;«QP&2ªi= Ÿ•܆Üêo¦%)¢-¤šãzdÉ”¿ðµ¤œ†ÍøðÙ7®}˜jD±×6üúñes8@A܈ÛeO=ÈÍwºI0;Ü]òagNi&``¤ÎWnX¦oþçªÐw#w6GRÄbÏ`Ó>Ð~³ËR§@¨ŒÆ¤p‡I/ èý‡¡ç» WqU¸^MD k×(ÆžC~cÇU)…) ¼P6œÃ•ÕFY(}s˜œt.#—% ͉Ièwì²inÏÑʴ SZŸ½èj²~:G„·y ùU85ãjÇ?HI†°' Öaqh$vŒ ²Ò@àž&TË °G],>ú·#Á7ä§(›§÷ÄøøE÷Nß'ÿÛP7ñùƒ{\ØÒžâÓª©åW–‘9r5ˆ£w…y¯§”i•ÿréï'K •)LûÃAþó¿ júàÒ`±$WÈ2ê–6ü¦Zߟàv¥æ'¦Æqi q ¾•#Z¢‡1 $'Å\¬çt-t¶›²¥§•Ûh”WÌâ–4•´›¢;éWn%?'ÿnCO(ØPǤ ‘ûwå:ð*XᤱÚQ)P©<(Œ®X<ò ìõ#Õ›Ssš1j¦üÎ !2Óº 埃~Ý&‰¨…8ªUK?¯Oúe®´µðá Ö¾ ìU{&ŽDÑJ°0N °„-pÝ×·fJ)ˆÎ¶B¤i„`£ ¿Í¬Ú𷲇ê$šÖa‡ºý*Ø×n˜³è“âs‡J©2qõÏ5’V›„áÿÚû@Ìf43ô‚0œÄsÍ ª¡Þe šê%’_É4œ6 ºf¿ä8¤ ›ïɽÁÙ¯tŠ[tU›á»'ùMba¾=.”QM¸k­`¶:ºÒpmhKæWuhòxÏtî&?˜Åäññì™P±EÅÆ9tôû×é¼3+!ï=µñSð‹­HµÈiÜiÔB+Áprê%ñ:£É#q¶#V"ü§J1ky×¾Js6~?FŒÿµê]—I¸{C_þ +œå Yûm‘šxÔ*Û+_(Æÿ©hx‡d»fm©îuû»Z­¢Ã=¸Òv9` º–ÕíßžO«ßu¡í„a¢¿ã»¥šó™_ATƒ-ê¶Êù 1JUŒ(8^ö\ë]f­OÛ“œK”þ]U9Îëv)ô_Ãö7º%N˜´NÐjë´ô=WºíÚŸÃÑ6ƒÆ· ŸÉX~ZÒ½Þ!áCý™žçJðê1R+½L™[fs‰7„ÈÌø.ZÓ„6 ?y™|>c¡Ãö7 F@›a;†ŸÀ²o·×÷6!SDZŠu˜L—6|@Ê_Ã,¥@ZPº7tz÷Š·Jƒ•óPB×OÐf);,]IÅ-'GU÷8%1ów×eP¹ŠñÞàÿ»‰,2eÌÿ—ð‘ ­‰FuOŸ¸ Š*K¥ŽÅò®œ·ÆÑ6P沬È[ì1É8|è jßà’ÂÍö¦ -1é“á4ëÔÜl˜ FÝ×7Vn'ý‰ª9%¡¢¸»9Øií´/qÎØe[É6É‚ï4c!LRoé&jö»5„#5,m¾Îß"¬,ªz]§~6QJ±;@࢘CÍf«Z¶+gÐEð§„nCwnœf>¶·GN>Â%ˆ »ô/ù¶‰™&€¾vÁáñ]áJ«§h ÜÔ ÍCõÆû·Œ',Ù4*Ðý%I³:ÄÒ$öØ’?|«Tˆµ&“pÖb‹¶,A˶ÁB"K>gMÿ™it„´PŒO?ÿsù¥h .Gxì[×û¤ê2{Àa…-¹u00‡÷Âè/“õ¸ªÔèÞŒ¨ôbª+d…¨o HéX3¦¹_f )n¿ç=él€%D~þò˜W”×û—ñ½0aY(ð('ÿÞ[¼6SÇbÞ X {?–LKS¶¤à ¾JêZ‡ÛËvš‰j–^mt­¯¦ü›ÞâbÀm&ù™ì~¡àùuí>‚š!†û8-zkÊZ¸Yº~ÿ­|àþÅo^2f ˆÁ™²‡žÜÿŒŒUy|áyÀª<Ø‹Ä?Ô—E½jæ2Ôár‰[YÐÓÀ*¥ýêJ=A/íT“,¦Z Zõ'|×7ÈZ­å¯è5z~§¹¹A1%®MtŽUAº½ù !É£“f%†H;=*™ Ä&RßÕ†GìîÄûÊs—  0¢t½Ro"Aã<åÕyþ%bñv+õEj³Ž²(Â(£ÝMŸí_èáÜ.•´Ž>c!P>¦@ä–£÷›Ì&ÔõÁc“³Ú–àG´HM®ÉüþàÉ›1@´eML>²íãkÙLˆÆ²”’µ¡/‹w¦fl ý¦›¤Êè!É]õL܉á"IlŽ Åkbn˜j©⛕ dŸüȵÑ[Œã÷JufÂhÀÕ¸®–šl¢µ=éÜt³©8 e:Îó* Ðá=ÃyÆäöú;xoðùn +n5DÂë–Âs™¶2"¥ê ¯–2d(…æZãï6]Héƒð ÚžÃ**÷ÄJÍܳ´Ïá$¼CÑeœU*ξBMëáMó‚k’›¦|«Ån{ÒZª½Ú´‚zu&õvT€¦ýáHÁð3ý%-™úoE#> >’¤‚XþERDó8¤DUpZ# "– †?“‹Æ~ó/þ‘‰9øyL™†IýùC¤±‰!ÏHPTZ!§â7rV*/ó©eVƒ`ô˜'¶ð› En4|©¶KÀãu|ð.¡ZÜÌ5Z®Y*Á;^5á—³¿}8u,‘êÌÓD!ÀÄúÃ( ¡°³™V©%è¨Í8E ß³zñbÕ Å gO3óZÈýóxc¬ªð‘ןuOh*?.Ø÷锯1˜F E ¦ì*-ð…°‰sq§Nï¡®'ÆpAÞ?qeS†ÎE÷¿¤öWne3wûMXyˆÛÎI3õCÜíømÃQ¶‹Õ¤‹®£Z_Ñ•R7µ¿š9ÚÜoDÎ;è‘=ÒÀpŒpìñí¶ùåÜÚ× Þ@ãxR‹GI¡ŸZ‡¿ïõ'ÜÐÎÿcî#!†˜¡ý×3„Úò‰»lÁ*©(þh‰/˜nq˜¼¯ö¶gÀõw“Bª/lcÞç¶v,¨ Ÿ,¡ÇmDTú\H<·è™y‹c|{Yï_D5%k5©‰^5ªíÄ›T­ ß(fi×øš"ÚMGÉeŒÙÿU]Ó‰‰oÖ¯µ@‹—Þ-exQNÙ]»4þAùBq·j¬ì#>p·ES¨õ}qŒ‹fv¹‰68QÄ´ÀcÔ$~c]… qPý^–ùC!©à ®+€‡CN Ítùsf<~ËeD»DU‘•œIxÂ)Ïeq@J½^×¹wZûºz¿ÏîT·£)‘hV"ôÝYØX–#§ƒ1šÎ~&fˆI…è‰SÇ­Bšž³ä}TnVt­x@Ö¦¶0iÀþ¹Ÿl&Å¢–t{OÍXÝ÷¹ç|_š[3GF"³ÝÇ7)¯YžéG*õç%áÂÚÔTþž,~@:Þ(… GŸ +ÈHTd„J*9=#ô‰’7R½Á©ã@…ÂiÈâÅÍÄ:Ÿõ7öL¤ÍS—U:/èŠ&ÅtSïÿ¹¤™#úÑ ü¼jïø'w=÷bÁÉû†eÒ{FÄœt$¶Ý0ôÄuwBÚ¾¯uÉì~ÓQˆdÛnÚ Ð(/¯‚òg²Ü¼M“ë[ÿ¼˜¼‘n¸hsLÁ⛵zÃ,¨èZä×À-Ë/=È@¹õ¹ó\CÍ´?Я.ŽÙƒú¦µd=›~‡-¾d%sæËľÙqúó9 c ¹rÂJdSœ‚'Mº¸¬”[d)Ó‰ÿe;5ó·%~üþ U¤ßÜAÈ£‹y ‹Ôvž†˜‹øxl‘œŒ1mˆ"›Ýbƒ„0Ý3À}§ë$Çðöký‹½“«þ>ÐSC]zb?0˜»:¦F¢ÆÜK¢dª&cVû¤tÄõ0iÀa)T’mÕ)Çxç&äÌ}¯üáG+ì.ï*PˈÑF£ØFîç–P`ñ§ã©M®:¬‚®+°é“Cù‹…7w3ÔÈLŸÑüµCÝðÙÅ)ïUW5¸Ã¦ª '?3¼µÉá—ÆS§­ÿ^Ëiló¿6»–ÿÞݵß× &‘y•†‹z b¥Âxki¨ªzö‡3QÒo.Á«©†Bx߸*¾/¡0g!>Ý5š¬X Jj+@mV53ëf«c÷Cæ–Q9;\1¨dù‘…ðÁ”Ôk:¢’9ùµšÈB¬«þÍgsØE¿±×–«oú¹%z—!ßF{Z­J8 Z´LáÀò¢1bFÎ]W(‡>ñÁe  {jÓº$½þOñí‰![Æmõ¤3逯9'T«!K9[ü2ç ¾CaÞ-Ô!FuPÀs)b]ë[— e'q%š±Ä3ô ô«ž|¹fbÉ›¸8óöWAy¶±ëLÐÄÓºðñ˜†sí3@Km†„+M¤0WG|óÜã³mÝš{G”s)sêÂ6Õ{KX‡ø–ëñ[â’è>ôÌ©Ÿýnž§l® $h– âv©d,ÄÀ”×$^ÇEÏ>PÛ,£’TQbnh* ýb€”ACB–ÞÞdÓ´Oø(ýUêŒ9zÍzÍÛÁ:ø£‘QI;--йÎÁ Âè»e}Ý¢¹1\¹²xWFÀf^lñ>Ÿ%Xöa…¤äŹh=ý¬PB!{þ-y‡

¨ÔËòó ò~¥Û¨u!zå‡êw¡^ï²ý6®y½Àeì1Ÿü±'•Á¨žDœ«° [óKèâ¼ù Ï·$˜›&}\Ö"äA­mŽá]~ó০JLš)áζ±AX¥ÏiR|Ø~ô㪮¸! œ2×ý2ûÑWl$`ò®µÊ{ UÈFÚ­_ÒÛ9t"—<Û3Õî‹Bè+u5nš ŽÚý繋9§ùҙϾÿŸšn‰J æEQ÷L_`þÅ Ì*‹INáQOþKGÖÕ<»a±—Ö#рͲ—FRïËøž4{H·ÑãT2MË’(SÜ•…Sb±`toÒ–gµ‡¡„ÐŒÿåxŒ—ÌB:à‹ØDZ^Î@ÇõPKXÁÇ !»§ºµ£ô{t‡q:ü8\”ç9†6µÙ¶žzµ»Ù: ûIT–fÙoUúS/†­×þnéãJ&ζBÛ×,¹ÈÖ=¢ëÇ¿IöWF¼¿Y°æ'ǃÍUl4þEt9JzxKñÌ’]ïÁ^êóGî ´$mr·wà¿¡SدnGýšÙD1 a÷¿@R%‡S×quSÓXM+E”HxÀ#û€É/ž_ Ø8D´†jVÑÒÚ-œ;ØÙÍô–èA}­Ç-…^1-rÃ¥}éÏÅ”x¬bÞ€‚© 6&²“ÍO–ïÀÍþaå_ ‘ê šh…âfÙÆ$Ôa%iƒdã9~Ÿp¨7˜­¨°“릇ƒR+´ò÷ûC+"ÿ¼&5¥ÛÙdúyoòá#\¯¢J«ä!òS@ž—Ÿ@šÿ×[Ñ…ƒÄk |F#̽½µFÄr!Â-ˆM‡MBˆï_¼î·)ov•©|²¡Çò –Šœ(âÑNgÜËŸû¢G¹ ž«KÍ^'\Wƒ*®ŽÄú’ûÊù[`àB<¬ÔZ¹ÆM®—Ìà ÚgU(aÖ1”Ä+…OV™+ÌD.íñÍzÀ•ëIuÊ,ù~ ª—:ŽVëÞ²áZé­éÜEÇ9‡;Ø_U|öµé3½¦ÓL­à%hâªpƒ ª Æo(ÈafÍû{!œÔ'ET™iÛ¶ Kó±Ý{Ѓ›¬<>^êþÒXT‚ê0ì}Ó6ˆ ;é§1œßgp@“æmfå½üZXäš'<$ƒŽ”£UÕ ì4r†æ5vJ1ÛLG‹Y† s]*ªs^‡Ò–lj¡Ú >ÙYPqë*Ÿ˜^A›\/(.¹ ´6»4}¾CZií7ä¥ÙHè†r-k†ŠrïºÏ{;-²õTÝ"u¾ ’‘‹u÷,ŒEid!íÚÍ7X™O÷’Ý¢‡4£”Šqåõã<Ž)êhùts¥ÜjR.rËÁÖ’À•IŸhþÍe7ÙEÕ*¿*ìúÌ’˜ƒMr'íFOï[$ilwÛ„ ûCuæ¤ñ,÷0ÝZÑóTßb+¤bù ÚW»ùm«¼1¤»Ã ÐB­— T£œBUÕÐì‡fùÁ+¿i:îÅdÿÊÏ0·¨Bê"fÈW+ˆSm† ÐÅ|ÇDÆ•žœ«œÿK×~üõ yz Ø;Ïoâ™Ö…¤éʘFÑÒ»f¶Q~r l%^,¹ØjZ¥ðq>qî·Th×l¿â6ŒÉ''cA»ÅC盵`)ŠÀˆʪ}ýÜC43‚r¹³<æ ½öq0¬Mª/û »Gn™'ÚI”«åŒ<öÙ»L~¶•'Í57D‚l1Õíü={£Ð-%|ôékº O-/ AŒÕèøKó6-™ªÞ, ÊÆ—XG¦Ú–u!‘j^¥ï/n_càL#áW–UÊîgdâútEïÜk`…më0äw] ÍÝJ@’»+ôóoÓ çw"€íy»÷ÔZ¿°$L‰¼]Z”0”‚ÍÚ£rVy6γ ¢ ˜¹ÚH܃²E¢¢5ú_íè€ÕñV烾Ÿ2É:±ÿŠé~º2µ¢ÍêIkt½]–âoñ¼·1C} ŽfYU§-ïm¡ïîÀÞâlŸEů† °Ã‘†:¥î]­Zd¨–‘òåýÑ/È,ª1¨µ ŽŸ·¨y µy;D컋$~¸—‡j™w‘ÑÏ¢ËÂôpž“ ÞÚZKâ,7PLjX©ï:(íð&ôia¹jäŰuaw lõžhá†t€°£^ón/–‚úLàXú¢ŒÞ,àn Ýë@¦\Þ—7]¥æ†@>Ã#d€Ù¦£‹ÜDpvvIµâ tKžÿ‚Mfo½P¸¬Íî+ çQtelP£4žü7<¢¯)›ä+õ{Í(MóQ("˜ŒdþTÃÐwtd,ÇǾ¨ ‰z;bò~`Eâ KÄ.¸:m—ÓÚo›R´Ã”uu`?€NÔÁ¸1sÎÙ&Ô$”Z%E¬ƒ#«¼×TÛK‚]ÀÓÌ'"¸ˆ¢Ã/Û^pêß’‹Wî)<ßgÊ3tšáÇèQe ð#¢{×0bÈ¥ó»A¯ÈÕI;@çbmúƒ }f„W}Ã*Ò‘`Ýz°Á_pÂÓç23×Ò4s¦OWŒ¦8}ƒŸ´n"Zàs\z.š_E+çÙ±)2ROÒ‹‰C&|Çߊ'uçVê\‰Ÿƒq (§2Íj’$v¦Xk%Žœ2Ž”fªgL‰ÑÖŠÕ¡á’£Zoû”„c²Y¦ Åc`ë6úOsB¨µâ$6*Κ%cÙötº7š´|O H*z°7‘Ëþ5†ò¡±ÿχ5…4%lœñqgTïՉ拯\ çðGëuUý«;¥ûRÞ” ¤ŸS£èR×o¯rª°˜0§82¨óÓßÐ Œqž?¿PȺÐí®é/§ïè@B§‘oµ:òÚRó“®óÖæïz])ø¡Ù± i–³Ùœ:–çXôJöâW“¦¾µ”\ZúT”Þ›ãUS.tHÅÜTXÄñ*çMÝ®£Q¯¦\󉱒œ[âK‹ªNøsí»±rs×Á4™Z覙w`¬Æ_-qà0v™ñ,­;iÅ/²¹6'íØ}]«j…™û·½a%rtÅ t2|[û¹òÒ¾/¶£¬uQÌÄ“ÀUƒ`úÙgzÃ: ÏÙñÇ}‰=õˇØƒ†K-oE^ê‹P8¤™y)‘cnÄúÀD2óT¡Ê;8™ßNÅbé*Ò·°zš¨¢¶›ˆXÈk2qYBÏkïôêw$O˜J@&££w…y› BR°;`€ðhO¶¤aF/`žJXF‘9%6–Ž/ä²¥FžMÍåãyëO÷Ã|ljEo`œ'X¹AeÇUÕ}2\^JÞñLóMëk7í~GV—øÈaŸHˆb‡ÓëþÜÞa®R1®Ï5z¿q¡ü\øyLË6–º/“³Tfòò£6¿st€ƒ!•_V;ãI¤Q¶‰ùï Ó”d(˜Jv†Æé)Ҏ輟0ú}:!Sï²÷°”¯:r2œ Ê Æ[§ð¦\î2!=ùCƒŒ/Êìýÿ÷d» ^×}§‘s÷ñº€UÇ» $õ|ºfEš(‡©›Ò~d•5RŒÇÀ+Ha½Ä«¤ÌéðèàGù;ÜqįŽCCfn=ò®(hLDl&A…ƒÕI=™½Cðññ˜A/f"\42c(zaÙ£°—î:rAVj{á:ËEà”¨Èèžò•uú²Æ*Ûð²ìÌ«1Ãv<ÙGØý4±Ö0s«È'=ánd×(úí Âh‡(5¦ßüœ&=8ª4.qÔþõná$´<ãq¹¯?¾ç^#‚—Ë7µßHʷϧI[×:Nš××ÞÛ¾½Í þqñ›]œA´ÅÞ„÷e>©DŒR.. Ês"o¤Ÿ‰… ‹Vé‘ÞuY² ‹€ú2y¦)„=Ú>Ó<ŽiG{ÜÏ—[É}ćü$i¹Ù„ÿI]ÿ.."*¶Òçab Dú„ÕhüdÀ™×Xzß«@àëa¢R—Ùò2v¹¸üŸ:ß‹–qò74=ê²¾ós=Åè!ËymŸYÿ†+t&6»'ù³k%t¾yÀê/aZß'Ål«Ó¦ ÅOu MM~-;ÉØÕ€AŠ‚úÇ9 ÇÁ„CˆÑa#·³^wN]´ÛÊ<ÑŽ“姉Ò‰ EýA¦½ü2ï~[«¯{[!Æa_9U d ìòp|¢oZ/`lΙö†|¤£´ô<²ªöËxòÑÂÞbâ£fâ~v„? b0u­:+OPÛ]¯C¥²^ ð>Qv: ÿ.'’l«ÇÈŸ\´' J¤ öÅg¾0—Ú—ÝçÕ €T—h5ö !‹Á˜W+¯Ã„Ö¨n!ÜϪqÑR#BI‡òBU1ø&áß­ ðï-nfåôÔˆ -ÓXbæp_7nš]Öå0$ 3UciŽ^´Qî#¶Ûj EÍí?ÀàÜ4ÿ„œYqº(; H\/[¹l†·wóéOà« ‡µ:Ø †ÒØ-K?ùʼng…y§2µ¨OV»/C|†ÆãɼJÏYOÖ1˰ÏâÍ’ãÒ³`æá‹0Øj9Òdä\¤µ²pSbûÞUW¤k¡Õíüôq,d¯êî/)µ/ ¶†ð`èxˆþX©ßhg ñ׿nX`Íkü>rozM94Öîõ´¬îµIs¹%«Òúì¿ÕxÄ"bp_—p*V–Þo´Fs&Ìr®Tñƒà§u¿¤F=2ü‹ÕynáGSŸE]ËrjÚ­Áê@ΗÜ`{iW‡ûˈ)B˜3‚gÊDNf/Ö—;)œüæñª_tðÒ1ÛL™vÆW#œ\‘‹Æ7µ$Žch&ªNƒ7*$©‰ãcáCî®âS¢¡Øt,á–<-éÿ=ñPVL²‰{ôã%)ûCE*ÍÄëþ)…B£QѺUC ߎ0Í‹{pÊÑ«l$£_dAÄTšnó\Eä¶G¾ú:誾Z‚ü+E-…¿Ó™­[œZõ®çÍi¿é"µc½Ä'à‡˜J\ƒù£§ÊZ[§¬®áMžÄÈsãc܈z\#ÞäØrdåøÁe@XgÙw')1iy Êš)­ÚÁ0Æ'm‘°r ×XIq—¼QÅoÿ&\ äy— ÇNÍÿß±í”0&ø³A þ6è 3_^·­zDw,O¬hHÈâ{'s¡E®_e­«Êæ¸Cõ³«ðÊùƒ'e´lªÊ÷À*i ]Íiý®iáÚ ¾R–·Å­ï[& å?TÁã6ÿˆm²_²KŒ¼•,‰ 7âè‰nÒgŸqd˜d•)çâÙPzø2oŠQG>£ß‹†fíJ‚}—w \M…+de}ñG>zË'W„š!ë3ù˜fDR‹aIάt"ãȹxß“ñÄ…­™ÓÀÅëa.‡s…ãm+^EªDXÝâ ›M>‚ÙXå­‰T%P±oÙ?pÏúûwv®;{ìÀخൺ!â¾lc^(bïþÀñÊPóy]l}ÙÝï·ó(d7™Ä>Iô£‰³òÎó2æÚù4"â8ã!ÐÍÑßÞPV;TUÇtÙ{nHmøoÄÃÀlCñFÅ„âS(ßFz¥ígêÌP‚ôïÑÒú5€-)hP7ÀRµ•¿j÷Á¨Ÿˆ±j–FC2ªß(‘Ö13µÉjA++Ú݉†d[[ Ï©«¸õv‡rvq$ÓÊx9Êw»÷çZ×+WÆÿszD•w<¸ÀðÐqjlcŠ#±Ö“Ɖæ%=ç}ØC²_H;È©¸}êhÙꥺä‡X3Ñ¡jÛû~·Š¼8îq ÄëLÉ¥ßA.åaæ ã¡Yl ‡Iä¬ÐhH]”¶VDÇ„‹¤S¡Çœ†NÀu4aíÂôÛ$÷̹B·“Ìv¯I¬çny¹v·ø«>Ë8܉q…˜rS&ÆÁ(©\9¢gM£·žZ>¯t>ê ͨùÙŽ¿ƒ”:V· þ!n€&#ûÅg^Ãô$#éâãZÞÊynhÅ8‚–óÏ(:²N1šÌÔ­>]Fëq8FœåRþ`,mõÁäÕ({/¤aB¹è+mNÃÊ.i{¹6÷ˆ¿QúOdMÇFkp)½ò3ÀÍâoÙ¯ä‹Ì`àkÐí ü~ÜŸ ¯ÑôE^ Æè÷vð=JÐ6ÁsÁP7!ü:+í>ê¹Êpý¡DÖ®Âs¹xJc¾tçµ–WK„ * ÷.æíø ûª°FT© {WÛ¸ƒÎuì­ì[þ¦jÙè›Â?³ô'ÑŠuW>xÖràHyÃm¸l¹i$ï2Xnâb8+^逭x‹PzòFWêÆòCL\K…¯GXtþÛ©þ³E_ÌŠâ6xƒænõ]A¥ý0S²Í8Ù(å˜÷GëSü¬­÷ÊëN‡΃;ðTÅŽäJCTà‡>ªQý9>F¨ÁäÙì7aϦÇ^´S†lÍËÛšÕuÃzÛ‹Ÿ]¦*þ(¹|Æ»ÈG‡ñ]àAIÒÄyj·6H+À© ’™ [:‚‡ã2¿Þ/]a¼Ú’N²·ýt®Ö སjîËU¤|;ó¸BîLK«Qß\ÛŸÎ °'NJµ­ç3Fò2ŒXÀÖ&±“¦¹=ÎôÛvw Ó9§â"¶‘)öÿ>…¬‹V7÷w72S(JÙõ“óäm[s!zx9ö÷ú›zª‡êåG=lõ/‡AHq/„…pnÎÈÏj%j‘j¹Aí‹´ì±.Õ‰ÞíCG}v .ã¹cve=s&¤Ü¨;£¨­ó]:0\,ôY¹†0k0TÒ…”Ü}ÖÑÝŸH+)Çßœ[w„Ðé%)ÀFôµÇ”­7Á4H¤àŽ}5ƒ*¹ ~Š”MSø-Pßþû“é÷e¬¾SU‚‰cB JýK~¶Õ?7vôÛĆ~îOŸ£³,ü®Ö@v8¬TpÏóH OŽ™¬ÏyÐ?í©âiZ.NÊ>ËÞíÈÒ™ª¾žÑ†‡EÛRÐÿu7ÖÌÕ gF5£ÇuÖ¡Í›£Þ–e4ráÚÂNAB׿{ìƒ×+>Ã-Œª­;éÔ-Ý#Û}ðÑ¡`¢è{F‡{_.þ[ž4’{W°Èxr–i0qÏêç+ÉGœ€(g>bñ*!ªfL{­.  Vx<ÔMaÁ,Дk„_?}ß @ôQ5Þ«%§\ížÖ¨N˜IÞ×ïëFѹø4Œýã®ÝX·ï^æ”ÜojW0Ât\¿CæWé?˜P­tRA‚©—VD`Røz‰ͨC¢]µ¨Ö)ó½±¹»/Îuƒs¤!ˆøÇ³cÄÜl ¤€ ‡—±ÁJ­¬ÎwA‹€Î^é»69åó„窤íëÎY´ìù$§_7Ô¢ö¶ä›*\°n„!™U¤Eܼ)}P'á)¦*ºÐ¥@k%º†2¹ó>úÖþ;ö6tÏÑr]Ÿ7žø™B}ÿÜD”-,Iï è”waàê#ï1’4 NŠlД˜>w¹Ö’éÜ  ¦4¼Ï‰*º å'åE¼æ›ce¥ÊÂã%DóÿÝäy=€þ®WK¯Œ1ƒR5A\7”ëj^ÛŽ¹+n.ÌÚJÕ™Ié5Sø±®q3_ùê>•™û}ŠçhaØ”…ÆÔ±ø‹B5>mcŠCû&:ewr%övØQ^“ùÇjÏv½+v•i.'TÜùV¢O±¼Úñ“ ÜŠgÐsÔ‘OT G¨ë[ Zªi“o²¡êT³sâ‘îþÃÕÖ¸¯G8'²N–Pú{N¤1ãó–¹âm¥åãÕeÑ9ÞšÛ†cã ôÄ2¥{!¯}a±YõÝZx'棔­‡Å/{ý©£Å×*ôް#Â&7¨P¸š“2Û# nSw|<ˆ=~à H®}€cñP&cš.Dpñ)· šÈTç 7?eÞvTt€€¹=Öc.äŸG¸ÄADéI˜n“¸#Ù_q[):–<7êe.ðÖÅ‹¾‚¹1a±­öa7/5ØäiïˆÈΞ'R¦UˆIOÇ¥W=}‹hjIh¿öpbM|ãÄ6z œØ x|ÂIï6£¡Â¨enÆi¢r°>ºÖµôXÉGañ3I¶m*û—Çõ9a¦ßâàZ¬%=[ïÛ#vÙäQßÿµƒ}(óOÒò3ƒhú«ßî· ˆVXÀúo>b"i ±ú²ê¯NÓj „ÆÔD]óáÆ°¿OЧž%E·[džÐQÐ p¨¢%%ﳬ“†QžUºG¼Ã+ßʶoB[ ðLÖ;Y]¯„ìc¡¶âÔø;Ö=§Ë¥,Y¬2³Uס³®ãéJú9«`÷`ù'ÈÎË ÀË7è*9ßlMµâ7p Ò›pËñÿI‘èà“›Õc6 lYS¾ÇËœv±jX3G)ÌØ†Ï«Â°‡ÜHœÑ70‹— ” ­³³šoªØ>S”-MsÉ™+ÍŒž£ãµ­Ìcý]&6Œ½ ­ø -X- ú0ÆÈö½ (5×ð©âe›ë ò8è>æQ#Eõü$tÔ$Á¬êÒ€ôÕ8ñ‚Àÿd ›‰x2!ƒÈ ç%ÇÃ]%¤Ø"C)¥ž<žÌ¾VÍ+½k¥¾•~êF WU¬&qhËš~vdGµkóÀ:ÜQÌöå±Ù¹Ä£}™…y–®VJÂÀ/§ÐuAo™Û,®1Ž÷Þlפޜ3¦d·ê]—(•)PæËÜÜs!xÝ5÷«ˆo Žƒ½H³_/á1lwí¸rÚ%5°J(–# rµ±ÌϾ ¼´ñ¶‡Vá`ç´¬ªuÈd7Ž[sHkbÜí+Ô-aÃùƒ¡Ò+Wì#þ Až¦X0‰-ž+×\¶]EH(èuqh£Øhx/ú˜¿ÃÆ¿ñæ{…ÒwÎ{tÍå´ðFpˆûNË?„^ Ç;x–8÷' ÆnäI+ë¯Ã¥¾eèÈaŒzx8p°Ä¢B§ê0™!èÀnºÁ]ÌfÏaž5‘ÝL\VB-yãc|îCd1_CRŠlˆS ’Ë߸÷4Уö¸@î(XÞËŠVÔ«ªïQ„;y›—vWI—¥Ÿ3#¥¢QåäÙw[1/üZÑe±»6³K8Í5}¡ƒ @«x|È^Ÿ‘GGp “”܃ÓÝDúCÕ¤£ŠÃÍo c%Ðs5‡g0YÁZë~eàå†w6d;hB¢âÕ…‹&R;È!«ÜkKÚ†Ÿ•Ç”Tœ•©¸–Ön˜$Áû!/žùäרРDp”b6š?FǃùÒìß«ˆ{šã‘$6À(ÌòŒt–£O‘”)ŸÇ}mKƒ… ]žì#.4OšBŽÀoâÕEsb˜Ù³³>e¥< "åù§‰âR®6K3—WD¬J&d°±‚Õ]@6Os°£ÈÇîC%  sÀÕÉøQå?8üº ([ÜÌv÷ôÒ€(¿Y!+AZà€9ñMf`;knŸ#mk.Áû½í%‘©ìâjò ¨Y÷…|5ɲpQ]yeGßÉÓ3ˆÃ“þÚxOí¢"™”-_t3ôÝv|tgOm,ÈѰÐê(È☠ñÞÆS{!¢üZjÛá9,‰ïÀúŽFY-\£9Ž-÷ü >µ—Ý-½ÀÞG¼ÝMé@]C²0œš/å‚ÍÇØÂQB™žM½×S€ ìÊ9«ïÿc1 ¸Ã ±¹‡ë†‘¨–(Yt£I Á囄ƒ˜ØÔNq߀*ÁPâƒî®6*W´"-§>øjŸH›v‚UDRwÈ6A]¾„^7mÊ…¯ÒÔZõž'­~wóÀ S,Y(¯-ÐÌÞ쀾­*†S18û˜Þî Þ}4ÕÑ3¼Žq,çíàL³Ý?Ó†‹R—Óžoeêö5g¤ùWH*È4+Jˆ’ÿ‹¼ñKÈ»ʧTˆ$ü'ùs„©DwôS)èå#= Ž*ì‡ßàKëà™ú|¶.úkÓã䜶“ž]D2Î5ç…>1¡jȦÞrt†×!$Å–¤FŒVÍâÈJæãý¥ÛR‡á`ÀÌùyÒËž›7—ãg´¯\snÈ»²ÐFJwE&ek@òÆÙœgɸ剧EP6ˆÆôšõ|{t+» ý‰£­Ç£‡Xü1]r[T;âd"l7ãç] ÈNĹÔº|0ƒÜ´Ä,© Èîƒ{¤;c»‡Ë"s|Œ³vR UÐýþ“G’r¨ :‡4›¼?† &®eÿb+þK.k¬1ƒþ¯wßÈïŒüâíbTž)P†ù7]gKDT¹Èx»¬Tã°dÒcw亜ë·$‡LYRÌúd×ò-µ·N.„t\Ø.·¦Ý¥ºÖ~Šø-á¨exQÅ(þ=QlÅK¨ç…†©¾éÁ¹¬º…8·žx´M‡x!ªµ&:V„rã—k*#–ÜÌ$¹]]Úx•¥±e5Cç>zYÓH¶¼^áw>|ç¶%‰½ícТÆhy%T)ËfœÉ…ë…±÷öìbs ­ÌîÎg<ÙÙZÙ¶Óxö’ÂÁ Ì!!ñc¸U|.Q5nך6¬æèÁJ½|Ç:¾â‹ðå÷lâd;9º…h„™3ƒÌÒ­û½f)œèÛmßù ®å5+t®ª ÐÉ® µ!þ«Öà­´ˆ´Š3ÛEº Jmo¬¿ƒCœVo°Îj 3¥d›÷QüÏÑ¢GhP´éÆ}¥Ìš7eŠÏógˆ€GX¢èÈÛõØncXe4ƒ¬Öá}yþmÜxCAr•bY\:LÍ)§¼®g?T¯%‚Ô(ÐRzý%äþWp­Ý8m­ïéKìEQ©gôÿ×1#qrWÒàYä`ª÷”µ¾>1Ú)þLýYvØ­°,ÍœêNâìSÇFhÜ3LÔ¯KËσD¶óÓpn“`%$‹úJ¹§dìf48ö$9=‡[­Pâiâ5ä(~PA¨^š ÷]¤ÿ°xr¸¨÷ÜÇ2¶’jêFw4Gš§Ähb¤20`ÙI²öÈ‚¯Ñæ!s7ÀÈò–’uöz/Í·0 FõÔÒC¬±ãü>Dn¿’HõÞ•S<zçູ±…D'~¾q¯¥º¼…8ä… „îm%^ê:Òéøõ\ ˜vzùrzæ«ÄuŠç¨.nã¬þÇ QÅB0&ŸmU\šq_‹D9ìž0ŸßÍdݲA\©X£O7º.qÄýì¡X-€¯ ^s½üÈ–Î9i_,²^Sš¥P³Ì9¥ß?û—Ì}ýbtìR²§ vÓ_ nÑ^ú$!ùI.ú†îišàºèí°"cg•›Ï𢅵Y·dïQH{qí F:öRñ~î|5vÓhV ÛÁÏUK±ÛŠ _Îq»qÐ;xN^T°Ä°WMg†Ô—özóR¸Øág€_Ö¥²ËЂãX}d”¿WÀÛó¸çœdîÈÿ¿pð ßÛDÚû¦¿¬››âŠÈV ëG‰]€7SA¸—CŒáX¬eH€à<°ÿqÝ¢”z^Žƒ¨‹tP›«óŸ³»\Uæ ÞØÙ³ÖXöÑ2JãÆe. ð¶}j ¿Ž€všâ¡ŸÂÍi!ú£ÏÒAµeGG†ïj0ÁYêñ¡œÌ‹¯æ ºnañúëö« ÖÝñÑGsÐß…&8qî¹ì÷zf{)OJ0¯Ôÿ9)Fª çxlFŒ¨ó¥ÅDië*ÑÊè0ßX¡ ‡ïo'îâX9ÇcwwnwâÕq:µÌJžã ª„¤úÇ#ú9b8 § YízRÁzhZ s o¨_Ñ-}v¹[Ù—lÀ‘UMYÁ®‘,ó‡ÀCv˾ÇX¾pNB›À­K9ʶñ½°­=¢Ã×btN,.'~'MÁë²ùpI¾¯Zj´´糤bÓÈÚkÓN”™j{ ÀFríÙAd©wë ÿômeRøjôPu‘Nå6Ëcœ(J¹ßZªI +xÈ5{öšW—6uúöÊE¿žÍØgìP{“$°äÀ0‹Ž7‘A›\þé2/ÇŸ¢v±øuþ 8½º]_?Ë-UY£(3rã9;–fèPQ~OÆÜ¸ÙúDic¶ø©B¸Pð&da  ÌÍ)Òó|ö÷g+ °û‘ôE€¥@!çn™®Né¬UDÞÞâ= ˜ö/%·‚òÁ® Ï#ÚY¯Á\tYå•á4t)”$öÅK{ð\\^!¨$=!ºg,Ãbyâ8»žÅŠë× )Ö½lŸq× uà'H r>Ç]Õ  ÆvÈëñÖØ;û®q'U€m5D°5šAdË>.a_ŠÇ I+œëÉÀ\ß×±ž;bk[U„9ÛçÆÆ< Õ&²û•P°W¼½þ­Dñ.›EÅþåj—δOB÷~‘ÎpÅó q^ËLvú‡ðä_à Wa¯lñTðiì }y¯!Ç5Œ<ß§?¢€9rXèßå‚1WÕ—7#h.p”9üž8Óºã¿/êéuº_9×–ÐH%†·ËaX›ÒrÞâ3z\õ¤Ö¬ßâõ^³B®·d¹×LOٖdžÏõEÇÑAY19=Bª“ }4æÏ—mNý^×IÁߥ׻¸Üˆ³”T§Çkh©¶Ò[­HÞ¶ÞÏ#3#ʽM à¾$]SõT¼?ÿ h?¨(ÅŒßþ잘˜ -ñò³á´­%h¨{8öoÆOZ6œ ³‡ËD%¢D¨ã?>nmX+©:‹ÎJŽ´òÇF•ÕtS q¾sÀ‰6‚f/\Á7óiÝãÃ&Û‰«M‹¥–Õ›17ÇÇÿiGý“út—,Y‡Qkd›Ô‹»ŒÆw?T¤¯/äP÷ ÆÝx*bž„Ëà æ}oÉáa2¸·±}!H¡TzwT…n’&À©”Šåç±8œÒA FÚªäUÛ]"Ö\Uõb‰¸@*@pùÎf©§âÖ)¯NÔ,NÂ¥"(4Ø«Å_Ä/6ÆnCJƒUå‹‘FžG»Ëþ*&ìNBwZüÙE§ª !šÝ´µ î™»¦ e'°(|mHàz›½šJ BTríÓ—Y§îT#Ÿ%¯ÙÈ&ú»p¯ÚBsK_Jàœ“q_ÛûU?cÿVÉÜŒ’)·¥š6]ëÖYŒ†|ŠÃù4-Mˆ1Ñ={¥ÛEA/Ϩí‚Þ«”Ññô+roÍ,künfÆ–#«=Œê£Íÿ™.z¯9q–téh£G[Š•öÔ0_i"«{ ÇúªÚ §ÑâÔ¶Öô~Á‡†*³Ï1‚Ó½gP{w'?d3ÖLïž+K¡N£ú~päøsy´¢ôŶÈ:¬,bYçÚ #ÂâÉ*@‡Xâ3úfï A%x€ë¼½z´½Zoí—¤ƒþ¡!C<œÇ©ÿ¾®Iù%ôŽË…à&¯q/o‰G0w{2™³‚ú#ÕÔ¡myÙA†BÏÅëÁR"MÌeeV­«G½:Ñä½¼À37§܈¹üj8 „@¤÷W|Š0BµÇ£Ô%†LÒ•,|x®|ÁzXѨ”%âÒ³Ò‘TÁúµ`ë„#¼í¸®\µgC®$ðùCÚæèŠÿàЙ-œEM{‘¼ÍœØ€FÙ__kÚ½°(ÅöÎxÙ¡/©suSZÓţX;2ê¤l¬Îó,‰aí]Ò¥‚µ¯5E¤Nº üÓ„†` ½è$Ò1ÙA‰Öä³å))U!ï½¢øŒ,ð¸L“Жš<¥“Ó/Oª2j”« Z[“@{þ½d&œd®#‰_3úÌœYáÝ®C¸#ã3ŽfJÝˉ¯ÂúÂT/M‹HÁ8¸Ü’¼öfþÍG­„˜6éù—tµ°„¾p3’¯|PÈ%ˆq;7Š…j£ò¢ãü:y*©Àª`kî/¬Â<_Lm~ÇŸÇT7m±±6í ¹ÉÕÛ_C)¢#Šíš=òu±q4¶ÔdÀzöÈ€-Jš “Ý1ØŸë6[‹ƒ¿¾l0v¥³îk™Øh­LCz±¹º[u´TsoÛ7¬½ÊTö¢ ²Öó‰æÌ¥}|ÁÒoï<Œ<S])l/#H[ñI¬lÆÓBB^ýžÒ|”z<°¸‘m‘¯‘Z@§‰af—?F.›û!ã–qM1›tu²X,·Ì1÷cï IÔŠ8ú‡2s|"`©<ÝBc ÜÛNNpÊË/Þ.øÈ[‚r ä„J  ì¶ßP½b¸Ýð5«,¡9ÁÌÚÝcÛÞtpF(VŸk, ÛÂe(ÊT£fšºJLì9o`Øp[ÑÇ÷+æ„–KU¯u{ dfmdÞ{C0º|t–-¸àdñ<‹»‹­Õ0ðïßBóZ’äoí•3¿åDŒ ûœS"4…dÿ¨Ý ÁêO†Ê†`ö•q»Xl]¦FuÞ$K“{Ûo­Ôõ¸Oy\!\ƒ‹&1’5ð¯×²n’-®‹>ÏòÇ_=t²Ÿ›Ò÷MœL¹>aM{ôYÝéØšìÊÛK68üÖySèðô£§ˆÕWg‡±=u•'2®– 8µÿõ"IÿÞ¢–¯9ƒ_¨‚@fòg’‹¸p/•ËT=& §om¨ý¨l –«<+E‚GêÙàù85í¹ž±9Üu)?÷¬íQ}æÆêÝ$™É£W0’/|ìÕ!ÛÝjàΑeqºA3쇡º"~ôèwQ|Àzö‚Æið_¨TnV?RÎÈsP.Ã-”á1:Œª;<¨H˜›$bE‰IŸÿS:Ñ׊ž$áÞU¦¢WÙÌô‹ šÂ›KóxwÁ·:Ö÷n“*ó NÐ!Î-Ù-„ÊÆ:–ë“ø±· áZô[ŒY‘RÁ¦ƒÁr@!M±!úJ‚`¢®Ta„´Àdë¶¾Ÿ5q²õrF›e…á·]Фë(ëø¹¥ òuôM *Š4#䮘¤¸E|é" q‘ë“ á)"¦…¤sfqzI¿î7NßRT ý.[2}ïÞŸT®/MƒágXÞ$Œ¦G+ã€á§z·®ç¢ã„î¨Qû@4Í”…Ææ•®<–)ñ…œ(ý¡&TA>Ê{ÛÖjxøô|Övv±'ø¶n®S®Ïšxµ Åíßã7×Â\åT€­0AÓ½ÉÜ$v?¼‘mYC|„ô½±†. &Å\²AhZPç787Qî^‹%¯ËÏ>£á>%'6Ag_ÂYƒó ¶Úk(Pžp NcOœâ¹ž.¸©Å~Ëœ ms§Aª†ï…ô¬ÂÓëI&ïëW›8^þ¨û80þà¯*÷i«ùópBúTDøƒ¢®¥‡ ²`ayw—rL?5‚~ѳåo?¯yÚ¡ 2š8»TÉM'¬n”?ÊKk‘Ý=to5ž¾Ämó¿t?oäœ¾ÎøgëÇ¿QÎèΗ]Ë­¤¦DÖÎÿ¨/pl]’RâAß-Äå/gPw¤,ž3jDÎ;•TMù ÞÝ;O ñêÜ›S›ËŠ È“vè+ÃI¯tŒÐª û™™Îˆ¾ pû¡Óq[Ùa¾H„Ûëá®ëF¦ fºäÍÜoPÆ™zK¡ÂxSwK¹¿# q9f·¬8O¢¿P×¥ÐÓ{KŽ|Æê`Ôg_èèËz K«‘©o¸œ´ÿ¾´n[#ƃÌ7óG…ÌbÍž– ¨pçQìÝd ظžõ¸Ï†0.^|²Ì—8Rwö`W7«7À.ýû†²×Úˆ}ïœnÈ‘% ¥Ê£ƒ´èC¼]EÊPÌÍŠQ×ZïÁÄF1¶ª•jq‡¾¾ÒÂöÏ;Ý©–W§6+›b65÷QÛZéT8]:‹¸þwFb“p^y™Ü©‰oådQ¶4B›”Àti:ix«©o…D©†Ž22Ÿ·ElÝà$@ak¢fØÞZd„ÐYµ0Zí"„v4A„ãçîAÈü ³ë ½ˆþIw¡¤s‰“¨Q¥´r"÷¤Yë•bE·‰¬R¸—2r“èìºëµ¸>Té§XG­M YÇ@(ˆ@},Ráöà·½ SHYBï„*W£©úYdᘀ4" ÕH¹Í{ëq>iá«9`Ì-3RØÒ i.¯¯-âëÅ1•ŸP ¶÷ÜLçöþ°ªŸy”† Q´–¥ômgO=ÈÆ¤Ý~$ŽêÔ6qÞè8,Õg3ÁÝ¢ìfòµNÛ®Ÿ±š~Ðw¦ˆàñþÜ¢ ïwùŽ>j“ÐðÖ„W€õ;N¬ö/`I È@~|·Ãöç®O¤65葬mÙù=¶£°ƒ­W=|À)à"$[06`¨üRLjVùÇ-JLÕ\ÍÛ¬NL¦¨ÇB5NæštîRæ?•~X“È#\]Gosù†›÷߸ë~9;®ã­8¿ÝÙ–Ý7.­é)ÔlÁ’žÏô×@(UkÊÙÖ¹âgÞNôúñe}RªMqšØ"¶?$Ó–ûóå‚Á<¢ ÕÓAJDõž%ŠìéCIDHmbUÄ ŸýdŽAÂ_(ºö˜,ü¥cY!ˬž#š©Q"»Ú¼ÕŒûâ6pJ–«K†ÏC,•¼ýE “|wÇ88uL'¶»X4æ5éÊÒÉ!sjÈçA æØÑ Htà7W j_Œ;M‚Pk`åÞ}ª5Ç7‚h”)„7¯ÀÌÚéQX-9ÇR°*iH0;)CE uµ ­Ö›1è¹XØ-nŽ ÅX7mä3îÚCpÆâÓÍåd;þ zN_Ëu †Øã9¿š¹ŽgÕ‘€¿NðÃÝT¢Fã®ùeâóå& „Cî17Iä½%þCØK‘ñÂñýÛ\£…Ï_ºS1˜óR²©ÄÖJÿT!44 ÊNÔÏ>Ô+ã5[›ñ‘†¥@/Èð3À,SÈ›\RØæ%‰çô‡«=¢N ڟᘪa0ý¼ëøAm¹’ƒÆR‚4@ûä_×å¿ÝâÞôÄà§—pÓŠ£&‹VŒ}uƺ ¢J·:¯fÃâr!SüÆ>¹¸­¹ØnCMÍzeC7!ê¬$=Ÿ„ä¡.x¤¾OhJï§è²dß²á݆F}-Ôº>:ý’¾¾«hO¾ù?bKc`í› #‰6×¥FæÐB\ÊŸòÏÕþÇõé$4ZÏšë§ 0PÝ£_å*‹VLÀmžÈçÞ:qôpcûJÝV/Ú@zÛ"z5‹ŠwìòŠÊ «‡ ÔÓ €:UÇ]'â–±k‚øIštEŠþŸý½Šž ’" 7dèibµX¼l¶A+Ó¶FÀ`›Ã ÑpG¼¡ƒeçò 7›€9q—@Ò¹6=ÓI™ž4’ŸPDüÇIdR_,æAŸp˜äîú¥6Þß›ZœeêÁ®T3Ì^( ¦9îh´î©ž¥[Ä€-D°vI&t‘ÉÃeÓÿc B„v«¦¿žEP &\ÒäEžKiˆ¾gñkÿ©A†KöC,悯3aÀÝôÌÝT¸I4ã¾9X€Q}à–+ xGm?±¨Ó1x­ž*ð*D› e,„&H¬ùóVzTN½¨áNIS|ÆY¬±½dæÚ§Üù^Å#àÛ„V*¨ÉV¢3À”ff+4×.ºXÔ©‰’Kª¡>Ÿ¯/ÞfòBÐÙ"6ˆZP1èYEÕÏhZ©–OxÔÍBœ>­<»7ü÷妋u8®šB*‹õލ<Ói^¦æGÚcêcPŒ&u;^gð%j²Bã—ÏBìáI#h9õsY;SŸ?è•-ÑyÊÑþ8ëKv›Ôø8”@ZnËü[•ñömæGTƒÒ“ç¾+ßFŸþžÿÆïJëÀâP©FG’â!Ë‘X?‚?8ín':ß÷˜SÇÆµÌ‘„#fA]_žÇ{±iRAn.¥Þ—ì,Z÷“ÐÖŽ– ²Ã÷©fnìºå>Ç×åØBÖpæÙï»èæ±FÎAS1É¢ª}ôuÔh2ÀâNäœÔ¤ÐPQVE®ÁÁW¥ø‹œ3Зƒ ®ëžÈÅZTmÿ8±¸¬Î‹ É/÷âvH ΃ûÂe %1Î;%ê•ÑÎc+My¤…~Òñ:ƒáÚÌx=ªød¬y¡á«U98>[t)•ÎöÊ(¼à«æ~«QƒÓ2ãúìQJÏu"s`Ú½­ÿ°ÂÏð¬N•©À9Q.ê³2o°óÚˆÍÒ‹= F|ú®RüC“™h¨¶±7 z8°}Ù½;Í™cgóh!šPÔ—6ë=%·mŸ‰ †2ròkVÿ°Ê”`»2¢ /…_‰ž XðÆÏ„䕸ìQj qèr•mr‡´JÀÅù‹ù€'‹ÞlÜ;΃]ª9á]²ƒ˜ÇTP]Ò\('Ê‚€V Zž[ew¸Š¤ì>ÚrߺõxçÇDLž,\D„ ÔT.ºwï7Ä‹ëS„láŠ?»%7X˜œ ¢&rZ‡ƒœ±náa7X‚ä No€6yx]I¨Â5Ë7»*ûÌøÊÿqoç‹{Ó„}Q½êØgÿƒ[LdN¥uíAÏS|àõ¯o–B÷2‰­ŽàutgÏá‰f+¬ÄiÐÓSˆV4ìbà”Ä¡8 DÈÌ£Øà–°[MIo%‘)š“ˆý|ÂWR¥,&±¥Ñ ôvVXеj ¿”ï_þ-mjê\à@?lõÉ,ê:¦÷/7hwÙ®£Òa<}9¢òЦ¬-åi>*~\¡9Ò%ÃÍ0žZIŠ<#î3úð×î`TzÝW%êb(ŒYðªï°Û=ëÓ‚ìqwwé³ ›Xÿ‘cazk ´â¦ðj­|•Y»ÅܹXÃ9vÀþ;À*‰7IÜ#ÉžG9úDsí¶.o¶j#xççL¦ïððÉŒXê(ŒÂø-&Pmì§mâöÞÑ& G}~ŒûiкLźr~“éîIÌ[¬«)û£ƒ`‹² €îó®p¢=ޤæ Îó¨iVAiéåún‡èMÔÐh‘;v1u*A·yÄn BQÍà/sjGñ;WJjåýR*ôG–ñíz<ྠlÏ”’š§™ñ’ÅÔ¹ôh {[U8npàG®C'ya§èDq# ü醬›‡{…} ç–;€A5†Ü÷é&µþ.Í!hvž3ÅŨÕ$¾ï¿»dÏ‚¢îWÚÿ›{Å—­1ÍðR|ßÜÝæ–T¦7£9XyþÆÏAæšÈ yjj-&|ç}´9SP+¶FµIˆ ’¡£`˜z7y¨qÃÖgv[…uGÿ–©¬®¬ÊR]ÉRFUìù£¨Y½ƒÎ VþÖ 1·)OÁzôñœû²Fj½¹r ºmaþ_ áÚa"”[ÒšJG`ƒ~èSÆ}f$cy”-Q*AÈJKÝzv9DZtÙCëX0@h!w³8‘/E ¾¡ÑPïÝâp?üƒ Ñ{+ÛÿÀ^Bø¿¤ŽÉCÚ Ç¾­zþcéþŒé<à?ÉnØ|…fØyJ,œÛøPo»}1à7ïüc̈±hÄ‹ÁÿÒ¢Ïn/ÁZ}<0ÛdDü!²ÁÆ,Š @4cJâÿÝÓ !Ž»Î0Y‰“¥Ê(Nù™µ~J£æ€H©x=EÍŽ­ª µ¼KW|ê­Èä^.µŒ˜ùCxü>§zêGÿŠ‚B+º”Ë¥_™¤@ˆaÆÉ͹VÈ4ñúBK\Ò¾úÄ4 ð@) wÇ §;Ãa°nžž;Bzÿx£ìàêNÛ–¥ˆ´½}—ctÜ´#)C±°¬hëÙòË{/ì„Àg ŸJ•/Ú4’,1ª]çÓÇÙÎYÓû‘cɘ0þ“É(?÷R.[Ô¾ ³,wƒñü@~0¨2)•.o³5Ý©¢wìzØÈíײ6Û†03ØÌ&›mþ0$»å°Ájˆ1 Pw÷›¬ûBÜ3£tfšns¼|×vˆQxã§/·Ž»æ?5EóASC8sW¡ÌÚš Ñ öoï5"r¶næŠÄäL±YÓ~ÂyúÑX¡ÏÊë7Ч›_†•l0ÿ/>è¤ Ø)aØkX‰zå‹Oy w2ÛêÌ·È7z+ew€jIúLïþf»þÙÝeƒjºÝH4§WÖ´ì/ÙqÎ ä\³× ¥uT4ã–¬ÉB72Á²>mv!W³ÀùA 2:¤;õ͆Ïü ‹±§sA7°¨bXOô ~ÝHDØŽ×wŸ’ÅL¹x!n.!k£3[nõ¿i ñß åv*ŽúôMrœnvÛ„Ñ_;ßuRÓ{…¿ž–ÇXïÐöˆÃ6ŒûZº»8RTDÃwÑq<˜7©8›-J€d¦D?Ü‹í"–¾D“ã“ò™“ad2•²Ý`šÆR¤z\àõñé¤íIájkãemÛÓímd§s€б€ÔM4¢I~"9ÏZ,å_¸-Ûxó2õV{~þ餜8£óòÎ4xïUêÓž³Ò=­AšªAe4óW à1jÞ<¿Íˆ{­[Áçægéá¶Ý?¿¯¶1©š}¿fvž <Áœ&º°aíéž´`ƒñ¥0;ÛÙ?GéJw·8'9+Qm¥ 9±ƒ÷ª¢‡~¢Nï ÒÐU«³FH”œy–ÍÞ0˜—3$Èõ°/霔)ÅC³Ç™•Ú'ƒA%…]µCy6£ {ÕÙºÿo:*°É‡jÂ)[脼L‰|Ë…~Ƶš_¬Õ¨×vßÐõ?F¶¢ü‘Š´UÂgü„N“™?ÈØ®1™=m—2Öí»Ë¡z›þ!Ö1†×8m·{n¼Â-í æG«Jò@^¢#R0ƒBC!é[­#êS½Jè~ð¡ùÕ¶Ô]Φût4N?ÔÖô»Ÿ²íË~ñ“qx*$_¥ì^¡¿!¯È* §ëuïú¹\xˆ ]sû~7aQQ‡‰§ÛÒUåoËXFÚîМ®ØÜaÂÕ1¤+çÊb—iØŒ锌 1ÇR/¾$µê|•-.†MôÒªbâõ1Bu:¡íÅd‘Æñ%Ò¶µXâ#l”Q‚šQsÄ\ ¢vžÅ^S,(ê¡Í?1Αv¦†öKÄ„¦DT»CÒº}þ‹É{áw§Ê©ÄW\ÄÆÀ4pïÛcr?Ðö–Xáå픃íj›1áL-à©ý1æTð£[@@;}žSÝV ëÍOáË*UòhÖ,m¿p š–vP¿Wûá4{¤ >Z"ÊÒ„½…µÂÇžaøîQ´tySÝËÚ!E\FÚß”Q~FÜO¨ ÝSsƒYGŒ¿¦8ÂlòŠø*°<u°JËnû‰%Cca5 Å›í !dImð>è¸3»Ÿ!bï6Æa9ü¤UxQKU¿p«’S@y;ÁªBšƒä0m‹¾)¢º£¡½Ùµ@XE8ùjKz눧sxV6Óz8ð‘¥éD<æKóìdÌó%0ËwÖ*œz+]žñ¼Ü„fÕpŠŒ#&ÿGÚNÕè†[Ì\Ìö=HÀƒë-cEŸ~ZÌk‘hxŸZ)*{#œå!Ýóïá ª”©Õ7I²©ˆKÇœ>Q,æÜ}±f4¶©… ÿÅÂýÔU´+¹÷ØG@ih­VĈ‰¸ÓoŠíˆíÙ-‘÷‹mèµyÂ|zma,±Ç¥TR úßûØ$'¿µãÞæŽÌ.“±´"€Ó«^kJÿ4"wWH2ÇR°Äh^‡!!ÔX¤åå¦Òs°£¡!íq}rŸÛ+Á½ .W‰Àœü`Eëfβ²è`ïì§xXÃ{¢Ì¯ñ­P*µ  F9z|´¢¡åÿZ¸ñGj R‹H$ö×4°‰$ü.´ý…4 t((tóT¼á2@†|3‰KÆîtɳñFÞåå‹màË`¹õ­øËçK¥©JPiMðêÀÒ^è»9'4R«3ž˃ƒj]yN%LØ&~\Jÿ\Ÿ8îP]$öܿƄ5öWàÈ: ’Ë!.…Q¬LŒT é¯îÛrŸþ´¾6¾£ À¤½ßÛÑW;+ßÍq P]ÁYôøÇÎC±<2LºØõmF“ÔÏ\HõD°›a’wæ[twçS}ŸghѺe‚v®¦VåUŸ®¡ð5òè4^Û%DÅÔC­š¢Ÿí Áz oêÜŸªÒ×îh!¤w$¡\«ž-\òõyÂ)ד¥ü~¥,&„ü»ö”pØk€$2¥9s#Q“£F9óÍùÏ\°ÏûKÃq×Z0¯ ZÔ(8RÄ/R÷fH5šC|Ñ |æÙPB±FSÙ«yþ‰ç3(zÞ¾ƒwÊÚÆÚZGä[ÜWòø†”‘Т ]…˜ïÒ£WšOô?AE_­ò¼cߟàLÆŽ‚îÆkÂÃbH1ŒóÌ‘ MÔWØÈœJÒ]¬æñNÇ0W·)£ÀTXQ µùAh)ÜY÷ÓØùÆm…Þ ~ܘ§Že?rrŽr 8LG¢cÇŒt˜EªœwCX¾ù¤Ÿ‹&8C/]À0fš{g8 §+ú6Q;-µ@<’YÁ]$ÿ—©ïqj=‰¿|Ï1Ÿ•øJftú™(›Çº…¾¤I¨7¥…Fbú¡. ²âPœI Òú\#”¼~)„ä&ðC’|è’ âš€¡,«™ m¶1ú©â& EE²|Æaåáí¨£xž¶ò I‡I€dŸl†pzS.¤]®Q:afÚuŸÿ×ügnçç/¤¨lõ^ö/h—ýÝã¾c“ß®ÈuLßT¤TzÊD ­V1ÕKQö†‡rjbÑŒ1YéT- gÂ.öÉ£>è¾þpVœ…¥ã(¼ëü¾˜÷i}7m¼R…ÓA¡Êf¶Ö–I½Šç•–EmDÎyFiÉ«a¦SW’WØ¿j«Qe÷¤´è53¢‰îÞ4»ð/ñÈÑ^ÐypÛ¾¯=ÂMsÁ`óšÉ–MÅ©Ùà˜¾å£F©Ùgf<À]¹Q\œœõ`W/Äv?uÌk‹BpDD ì‚øß\) 4OpɦD¾ŸåúQTÅÆÝ£?@üàb $^Äx%Š’Úœ1œµÌaÉ›ø=ÏWîåWùI—EwC#ž3›ýQFvÐ~*Á€— ÉHâ~Nn7?ó-&I£ K^ ']|ËxêOon‚ʵÅma^±_OE-˜Y/Ö)äÔ`HWe²“—¢³‹ ȯú{óìœO¿‘aúB=#a¢g°Ô‚5µK~U“Ž"ŠB»%ÞzH¥Ý…‘MD¾x|"MÃW˜‡Ó“MËŸóí&sù¤ûRÉT†äâ$䔄s¶!÷.¬™2¹z4¶’7(0"8ìðØ$3ÏÀùJ  n¢†rHÉù¸Ú5\,N¿Ü=RéÉÿêü’oª@îÈ2$®ó—Ú½?sÍ‘Y«¶­DYçŒþ4²@§Ô]5÷¬¬ëK{ªAït$TPµEÝbXÌ& qdºA%É;%hM²ç¹%Go3 +èÁY¤…ÔÖ)lz‰«Ð‚ä] Ùœ„Ðp«Z$§ÿÿsìjDïF»Å.–䑺9—^ò§` Súl°AL‡(÷”`Çýry—¦t«aû7ùgÉ^hè¦>¢÷˘øYI‘ã4I tmôz”o”Öµp³¬pK³NÓ‹½$SY$5ê´½˜i¨±æ³yð¢(ÇÂõê© ­¾Gù=H®"E…ƒÁZ^iÈ*VÌøéRÔ¥sÆuCçÞb…ã'¯ñ‡²#@èCW“bà:ƒ%/áÀÈ%uñÒC.—èpÆ¿ÿ¶î‘ÔMøŒD"¢ñXiÃûÓÉ×§Ÿ|o/E/"!Ïþ68y‘¨:„®F €D>}bóu ‘£aæ8"…m#ÿF®4b%j(’BYÎ/¹ˆ–÷ÉÜœyGëyGD:ÔÖ£ô“WÉò§!´NR©h7éq û*γLH1j;ˆó4ôlÔ[_ã}Åô +‚ž'= µB*T-¨ý÷ÒÚðSQ ܈Pmûa£è{.Þ9Ð¥, “«LsÈMÙµ‘`A´«+ûÏí‡A÷…žYÛYí-­ÝRUåpß8d¢ÜSîâÁk…waÓcF\öÖg(vw10@ZƒÙJéG8¨õòPèB/7vÒleˆÞ;G—@eõݦ‡°Dñrý™‚}RäkÑ/`¡ô~$Ûþ@”«Ò8J±DoL§y„q‚içô`xÅq,CeY£¯Ê%ákY—nh)>XáÛeÎI[‡ýë!Ô=£ç:•ø’²™ amˆáÄ ‚¬hìpºmšz…»°¼bÚ¯´'÷B{âKÏSÊO¦ÛMû<Wà“„ ‹2îҷɘÄw„¦÷g^Þ¦W0VuÍ>À‡…;Þ’ Ú°äãJ9¥>¤¬>WĶNyù’ðXÇ^®ÂCýßhýf;¿S,\mËÞ^„W:PñrEõKþÜ# ÔŒ™yÑ–ÒÅ:$—اOÁÊÀð‚_pãF¤bF‘õqõ ãIÅ‘î2*'ßü¡œˆuã»"…+Äù-”û bLÖGî žb¨!qÚFeá×ÛÒ£ú½ò÷/1ƒ\ôŒgñ´°%U\Ó}‹^pö€êÚLi´–Іᆀëtóå™tm—õÓ´OåíuاÃãéu|ãæÂÜãÛÈ›dk£*YGí¤GT¾T§Úa&ÿsõd²/àómá1ÔuC™aCo.pÞûM4‡¢_¶ºïŠÖ5㻜w°B/Slz“ó³qÁ(?>ôT\)M¬×0Û”;±è¨ ÝxÁáÙËØ„Q7›qFkô2ÆA^{ÆI`7kºÜ¶œ³&lŒ +::œ’r£ä;ô:ùGñÜ ÛV#]쉵[Ÿ…9ÞWàØ¶k+óaF(ñßP5°÷é4Dµ”Eš¿ß5ê.3L‰Ú¸Ð{%çR—a¿ýz€‰¸ ¹+¬ëi*Ý”÷ßXZùߨŸxÎ Ÿ˜­á¥°š •q©­ ² V*ÀåKùs»Â=Á CÃé„ãEAFÖ}è4çã0" ™ÖŠùxEg›aOü×Åþ—ñGZUxþR“°ï?}Í›ªÝž‰/’á8/ z)bîŠl’ûa´!²Ø¢egQÕ=T/g|Uë‹ ¨[¼o3¿Õ¦$¨5 cë¼›’Æÿ„wøvÖêéµFq7)Ç%$[¦XÀ–YíèxùeÒèæ;Ux\‹÷ؼQÍÌz(/'‡Æ[ÖÏÚ uÕP‘ñ¬˜`„“Un ó1mÅ´eÅhŽÛ°Â‘Œÿ"ÉKÄ×É~iè9ƒJ-²ß{>xG7§½ØÁ*Eö‘tñÝ ¶n¥ÐÄy_bß1?/íYåhZõ„ÓÏ#ÑâôD–س®õ€‰¤ß£ :$8ßæVÎk›uËû0Æh(¼oÕË•#ínåC œ…‹q{ª»oeÓx¯àg]8'.ðò39{FYPÀ&PUíÝ¥ôXÃÝÀ<î.àÇ+rñÏ›L¼‚B±;ðgd n²ÆŒ]ƒox|ò¬­7Hz©Ðg9îŽÁ@ªFÄî„æÚN„Œ† \aðô/L/¡¼ øvº/ «Ù#Å‘«4»ê:Ks6—Õ¶ÔAa5S®W<…ØøNX‚v|°Ÿw“jJTè3cïŒ ­äh$¿~‘Np®y¶¢„ øÓºK7g¶ƒoïAǧã¸+25ò媙f#æuÊ|M;<Š'VÓ46-)ã(+¹Œ–æiß­] ¢c5ŒSâê†)a»èrƒFãìÃzîATŽN2IHÀA•È”<#V†üå‚äŸÙ¡C|­æ`çz'|?5œµ¾Vžì¸ÇÓmÜÌÁñ-幜Ì8 lü”‹‚áŒìYº*îe€Œ›S§`ÅñJæMëvŒ»t„…㤞÷J›æŠ4›§h:Xʉ¿­†hGÖw©(þ­ §©ÂÝõxÙZB‡‘3ëÆkG|ÿý£ÝÍ€ji­îÝÍ¿š's8Ò~š¹'®rHŒx⇀`ül˜ÎJឥ|pæ#3d ¹Mœ,E[dYÇ¿F‰äc=/€xP!áä•Z´^qLIAÖRº|^±(‘ý…ÜÖø8á?Ïò7¡ʊγâUò¦YwÔï—ËÍø.ÉX>0ûaÛLšΗ6쪨ø„b¬W…Ÿq•É•–ˆ¼&Æ}.fjg‘þS¹~AŒl©ü‚\WãY=î[Ò‰¯&6× Kª_ä¦wÍÕ0ßW!‘Êožãb­ym^æÈdš#™¦ 7S9—–8¥fµö,NÈœÞuèKÎ…¦ïCIír ý6œÇŠb˜ÎúÚéòɵ$_‘A·àWú;­Ìä¤g†SD¥/X²¬l´C "ã~tÖ Uƒé@uòªŒÇ6 Bd¤KßFÉ&Pªö>©«V0pù“J ¾qìÖð›+§¯Â+–Ø G‰×¶Ý`Ò*ð–6§™¯d ÉQ9J³ÃOpô¦ì¿ ĔӘ+5Zœ¸ #¸0:Ú븋’„Ív²U=G×Jä_»¶½CjØ‘UÒç×¹¾ÈøJù'! xŒ6þ{·ÔÕKšyŒ“",9z[äz[Sf¹Ûª&fŠ5õyo=Lú æ2âaÞµk?s ªã„æ_ß*•àdÚo¼ÌÖ”ŒjmŸ ƒùEï¿!¼` ]“,m«a7!»çÅ’ p ›ŸÈý°üð™td˜–Jj"oÆÁîh`•J“cf¶f".i§6š ZÚ wÒöÞñ÷¦ZÝ)±ë‹züe+úAyòqž¸4Í4ÀŒSO±[ ·õˆŸÖ\]¦•)–Ld%M‰ûC¦¼ÎÞib.ãÁܪ}UHÜvÍe=¨8²ÌŽõ¬CÓüÜ©§I¦-¸§¾Õ$¤KPÎ9þŒùzô9N}¾ªábá¢[OG˜ö Ø iÑ¿KÐkÞ .ì†æò×<_®rÂ}*Ôm°’ä1&‚äŸø}=ïŒK\Ñß?CUÜð—9wlí2Çræ'§ä“h•ʹ,ô4‘\Í€íh2­sÈ\ZÿIÒ?}ô­ñUUwSäcÌðr0 ÷‘ zNbƒ¥ßÌG3g&ùmÍhA>O6ò¡b™äEšJå⎮f8Û“ëS€ûÿ-~rñßnG+1¢?²¶cFÁ4¿ˆqî£DG 4\UDv3 ¶èÙœpÀP€†(õ¾è˜ù™¡ØD–@åGÓWÛ¾ çÁ‡ZdïžÞ¢5œ³Ôy.A¢˜Y!@z C55ØŸ@ÆÃ’EFiE³ÈÆ´¡†›t :ÞçEM'ðfKýc‘f±;Øï‹ªúõ¹…e´ùQžê˜"Ê¡‘dWáº$ÚN ™ãŽäb%aÖˆÆzÒU\k[hœ8}­.a$½×.л×ú£“ŽëM\C´×Àp}Ý–]l6óC€—÷‰Y°È±Œ,Éÿøü³FóÉ3^jÿçÆ.¿£Ë²“«|«‡Ráx‘ÿš|Ù=/]sþƒt¤–»¿æYã­ù·5¥”0 H0AÙtU0²½ÈüâùaÅ¡Þäûµ ‹{ä‡Â«1 ¬‰AL5]ÌBb2j¶¶¶Yâ=‘£îYfç©ï•´Q¶¶®ÞnCmâ;ÊS•áEï’ ö8Ô3–?¬Yqç»H ­8ó/Ók(*Lì’ñuÜärâÎ…-.Aá½=Ë¢ÏTÜä¾Xmÿ<ù9n”/Ä.÷pÚ¿I×Ù”(]=I߈±Ì9iâqÄL76‡'. ¹kU2­' Çé R@=·Ü ´Þ t¨·Àíè×$ŠÌ"ו¼u6_Âw®âŽ®+òzj—™Uú”ªöùà?쯵>ôµwÀC݃siš"’6? ø;–*=™­$"ò;OLgw’"¡ôdZ•ÜÖr28ÚÙð‡4åƒõ-U°±ÆüD܇iÔVx…ÄÒÅìvÁÈ…Æy=UýòïJ¡Ïn…99òníö"ãÖô³ åÍÀîÙ*3(,Ɉ- “gv²M<š“¡tt‚.™þiŽÀZb›ž£"î³Ïæ¼xúwø`ºió¢Òu™ËÊ&ÅR}9›€(¼•ˆ{f¥À« ÞÝ}€3™ü÷ˆÄVѕϖÔQ/UJes#z¸ŒÝ”±C‹Ü³¯Ë‹Ž%6w=vNíÐÆ…ù+[ù¶F*ëýžx¤ÿÿ£4!yOÕôH€AŽ>òÏh]û^Yó¢xï%£]q½…î\Â4ÅįõpÔrׄõûZ>^Ì=FL¦~7É–9øi>‡×Rd Ð>È\ ³ýî÷+««vúG¿.†­ êõ… Úô—«9‘뿸áá‘nø考¸äò ³? Æúèã [ìs®µ ’¬528”¢^ùLhñ´¡³|LY&Ÿ°¿‡ÝÖ’ýk>îÊé.î“Ï¥jÂF0F­P«€ÂÐÙT2í· B9 œÞÛ Ä­e/ºÙ,$-ÝmíÙLIIQR¤õ™Ù MN0º¡é9nRÃ…ætTÕ>ßmÂà7$©Öœ™¼ÀÅjˆŠ¬9/“@ÞcÐïmZÏZñèê†Q×Ê8ÊV¨ŽÒÜE-[QÍ 8¤0ÉEíȇbуú‰°;ð4ÂëܵácË«ˆœ³§B¶ä§ËgÍ€›º“^ÅÉ=±æôN kº*¨ºž¥þ(õ\šl|¦Q—ÊA5õ{d¤9ØÔ]ºœŒ†Ñ7£~Œû…lÎUþQ±c†ÁR­ 31m°y»1~UÝSó¾hS~½LCsü;ÔÊ©a›wœšó—!¤mBkŠó&÷Xb·8­û»0l­ —üúAËÊtWÝ`€°ÎõVñ±R •ºNHÚù2Óûvƒý“æÏ‘´]«ÚÄt¡190mo/4éà@¬`øÕ7Ò¥Œº¹Å–Ò‚›Ÿ _#{ô\JfWªq!1MFòì+·@AéʽËaÉ’Þe£ö-¯ h;ÜÌ #/òÄQ7ñâ÷:·‹¡È(ÁR/Ù.fïß»Æ*‘öŸšÓé1ÙàBûSœ@ ùĊ矔†QB²žÇàmyZÙþw®p¦F(^E$éõY¥YÒ™Ãä{eNUD²ßVž-%}KJ\¿ïàÐóŸå•åÚïŸ>ëbBNåI£ì[a0qÛößÂŒü˜1} n ŒêŸYZÈw#ÿw^Æ@¡ˆÑÑd*‡½´ýÚ¹Jùe’P¿j|˜ äZê—ºù"ày±‘îò aË×?2Ûò ?§,Šðr!.0ísÿS L‚¢Nl’„€‡g” Qëï„ôôHû™ÐìÈÁŽ6‚È%ʹbi#ÆL¥+k.ÓjM&øVÙ¿˜zA1}`ÐúÇ -Ë|ã³ëJ5ºpé<ô'¶o˜†ƒ:çÐO¤…Wg»“§þ°`K1ùvcˆå«>½bþòm©—òv´qäI<Œv=M3&5eBfpû¤xÒ«ÚV19µU V–ÎÎf‘Þþ”%î©qgÀAOU“!BÓ÷)ÿ„¡–9ô8BÑŒ¦É*ˆü:‡7ö¨þµº+;×ìÉvösÉNÓ®ª.ñ“7PCŸé¢tÙ0i`Òv~n=R‹¦ó­ïk:Ó0r¢ºu*—“É•YDY£2=}È ôf ‚Fg¥dÔ!£/x9j bÜ5ÎIŠ%q*•¶±3‘„âü‰T†Ó5”ß«¾ Ç“iÉLÇ äGæBÿò½x èƒdï’.;9ÅG®AGÜ«¯¬àgíÍÊOô÷Ó§’øÉU$ ±h³¥TÁ|)ÓÙº,)¢›…§ÕP ;Ó¤p¼>§õ†>cn0«Ð2èVâ :ú(ÏÐ^ì¡g^3ÕlÉCµs åÎ,6b1QB8áœl ‚ƒùA D ’(”ËÚóêÛ¢V…Ø\%ÍÎÏGµÂð;œµ[ÀxŠ ˜® #>oþw{È¢®ˆqf’çùänð)e-.¢%HâƒcG°x•èø¾(r pf Ã2t&J”FçE·ííš‘nå^8 j$)… ñ·cE@EÚÒþÕ#õŽ‹Z|£èJ¶ ¯äñÿð(À¤B„—jûÕòéó{°3¹œzÂ"®À¸SÄtÈÖŒ>§ô['œ´ h<>?ñ^ËHÔ¼n•ó”u–xWjâ€""mçÜq;¹Ç9Eêx&ˆ/Îýè°|Ë\BDz•n$ IÙÌ$©j†ô0þ-\Ý÷voëñØV½~enù='²ã­Ç˜âçÀ±i-Íäs<}‘¨íð_ö¶1F½'=G/„ 19!g]‘&ZV÷hxmäéÅM¹©KDÒ¢Ž¥"ˆ‰”÷Rçq¢Jåˆ%Û.o‹^ü¿Í%*•@‹Ô¹1¬*Ðø£²°.ÏØÜŽîà€~ÊÏPÛ®ÏÅ*wõOÇ¿+ŸOÖ/‡ºmÓž&là¥YNƒOúWä+#Brùˆ‹ò»Úö‚;eXYJrif• ÿ0å6pfçêåí#Ô‰V?/xqí¶Ï÷ ¨œæÛ~÷ äØ}Îí$`¿º»Æ^f¬\FéI¤ubéƒ ö´J¥­;í@e<¿tŠæW¤Y&ñêûSc¥|ÛÍY å}P6cH>½Ðqô›™Å¶jŽ@Úúm,uz6F*°Àÿ§{PÑS'=@zÐ5Ïb"}ÒdcT‚¼.,|:ÞÒfo—ÁóD‚D¾×†t—&nrÉ™4Ãý1!tç ´f$N>0<)âJŒî{Õ°ó¿SÕõtpNªto˜øó!.¤Ç\ª9Sc¤joêãÈA×âUOîí:Ô†>‡¿ ž•çO Ù3X¿Êà4‡$;6ñ,Ī’.Q½4QyEBe·[!Dè=‘££AO(‰¹pàÄA è*ÛŠy×–,~™}fÐ>Ê[T£ÅZà¤óÉÜs%7t©´rPÿ÷h¹@ˆ>+ÓeÎiÅ%dŽhù´B¤ƒáJ]²þ?ÏôKÙ¦ÿšžN°Ç†¤/—ú@‡ ãˆ$»t’BGß^‡Â°dû9Å–GÿFûÕ=ÿ©´µ„ u˜ÄV5Ú.ÏÚŠ\ gÙ™ ÛS÷ J8ú*Gró/½KªjÄ%åfžd’mò1ç$™~n*+Pv,Cû¥Âü€©©e0XwŒïwlú¶µºÖFI®dŒ`0O{ÞPÈßþ7Žgvƒ ÆâÕ®ÿ Þ,ò£ÊJ£Á*A“Òvº–§pœà,Œ”B¨ÔIP ã·¼æ³oDSÐë&D5õL,•AÁæ=[ÔýÉyÏf§m$Fheï5݆Ä@CT;è¡hئ~6+‰‹n¶Aï„RaÛš™Âs"!½!ºÒÃTÁ.‘åXÂ0ä.`ÉŠm|%k‡›‘ M ê’CÅ“’÷Áå6OÏ4 ë¡·ýæÞ¿tò9.ü{X?'ú£-â1}š¢òšH4ÓþSžôQ‘w‡ÿ¦u|Pæ[9Þg£¥û˜“«/ã¤ÿQ!‡‘H°¬?|,[7(Ö~•Ô^žiµF<WºðÈy—0+î_·ê…ÆÈ¿ÌOfRf*Ãv\<‡•Z/ü„3¶dlHÖ•]cC¬ÇÇÔí£ñÔvEMe(^µ¿­Ò¬c¡ÀoÌÆ 3—äTÍ¢H9”zw#¯Qê wœOJÌ °Ø}ÉìË¡ëÁÙ¡ùó/91`°Ðß.˜³oT,«ýYä&ÍVe´‚ë’M¶¨‹•pZá†O†¹!0~ÍK©SJöÍv«#êÕò—;°/'w…›<¾<*)ŒJdic§a‰ÑRWÓ§¿òõІÒâ›õeš÷3Ÿ†>Ï  þÒ^(\Þ*N÷H­ØT¸ æ9ÞH£íG 6~¾,V ÞãrÚÉy)G´ŽRÍS …B öö=¤y¨ÃI;f Œ¶w"è¨îÑ–½“dôb0Ö'5âÁXË@oùˆÕŸ¦´’'B M°Ôy‹ÞÎ0l`&xÜ‘=)Oægh¯"lÁâ3h—8Ê9Æ‘5óµ-X˜Ä.eÿÆæºuÒßÖ@É7·À ü,[€L?4Gä@¥éÓ8½‹Àÿ€}Aµ¦õ›V>µ€KŽ}T IoYÍØÝ?”¥`RÞóçi'¨©ö•üíwÜ >º¥ø=î1r9X&[¦C,Åøn ~›/Ô Z--)kLëf*-“ýsDP’Ñ襤Ùïû\ÀBô•è/dŒèh4_T“H^Ûž®Þf¹ôW>AÖv®ã»¶y”ˆ(%¿Hâ8ÃÐÉuލÚç;H7c}¸ŽHBËL; ÁK†$M!EO³7õ ë–`²Ûñ|û¬Üâ2Æ[ƒÙ[ƒ¶€Óï­µ­Ñw¸f°&‘ŒÀ46 Â`ö@]?$]óðl…u5ðÆÃÑ_§=à$\å{B}z-E$7òè€Þ$jO‡XAý™•X§‰iv¶ s2°AwKSw§ÿnÕ‘÷¶kt{Ò@#κŽëT(³Æ»2iBwJÙÐS*ªaE×Ãñø[±}F/'u×ß - ®Üó&;Ì^± çó?¥|—ÿÕŽ~!Š´ˆ‚|V‡Ð!±24¡I°#Î)ü¤rý„0VVªôؾ[1î÷ÅÄ¥#™ {ª2« ÝåñI­}b˜raµ¨F¥¯CuÍ£óSöÁ̇û²ÅÈÍ Îè\€n·˜ 7i—ãö¬,sÕ¦ËY‚Û½ƒ}󚘌Ùr«ÿ ÆÌ²d})¥ùêE°9HW{gÅË“á2t2Û;«±[T7€Ä{*¦ Þ¢‹SŠÜ؉²Û yh$Ï×òŽžû ] c“øëšéW%¬’ß$ùf/Åö1èK ì"…¼“áïsŽõ•‹lï> ú?ü3°Jõx–H+éªoï<3 íÈ`5áĉKƒ½ž}\^_nrÁ`œïš€ó?I ÊÈ£GÑ7i<«gÍç>fjA×VŒé‹œøZ£ßÄŸÉ™uqò-5µIKK1x×7*W Ýos7Wãañb-h±ê3‘@ÓuxýÎ}4YOÇ´„ºZe¨ì¥Ý˜ŽZ5uL…†%ȲSÝ)âíd>»ô§ÁËÌâ @s³)*óÿùdƒ©LœvÎÿï?ì¢m`i%“ViÓ)Ö}[˜2}p •FÔXÄH)å0Çöyu‹ÚíW¾(§§(w§Ú†8·;çÓn“OyÜ«ö› .{¶Œ´yåoòبö07™›œ%ÖïR§(+²ÛÁhâödmüp(3UbjÌYUEªTÌ%aÂ^H%Zã›ÅzA lÄ/e›å‰b4úÛ~þji;»,*'5Íñþ_2$Î. 9–’9áÂH1¡ _²Rí­Ó†˜R™þ;D”$‡ñIm¯od “»¶ß >Ržº%‰–²¦L¼rjÈ{¡½MšO •A˜wÐ3€šð/F2íãóÛ >QvÎG-³‰ÌcìöÃù½ÁyŽºfv^?¾×‰¢(u“¡Zr^Ç çV˜ø`ªI÷Âqoq„¨yÎ…8U(ˆaÑ¿0Ç>ùí/Ù»’XÿLä/ç°% £ÞOuk¶Ï0x£VÎ ‘Íxr"æpa2M5œý8V=æpê@üOzZÎ\+Õo%B*ý.£dJƒ.„Âê>å§ÚЍvS<ÎtA©¼—íMÈʉþƒîÓ ßò&,,ñ’Ž(<\<óf}éÞ’Šk&µ€¶¦ ÝpÝT³8(osÅG¯›)s¼©’Àꎰ?ûìE¦I,ì~ý0[E $2ØŸ¦BÆ«;:ªÌ:@e~òWæ<=‰Ëç¦d¨å¯Ã{¤â>EfäeÙH:°'í0Rì¨þuŠËÇÒ’ëÝDE¼}®FÜz*NÐY™% +µ/t(Iø(-l†…Š%þùÜ|©Â­8+ܸœKçBòäÜÔ@/ªø•y 5—Ð!’ oî݋鮒·j(­èg=ÍÂ$Ò‡8“mtWï &˜)Þ˜Íú£Atž•håoC¶ü º¤<£Y®píÆw“‰H”‹áÙå?ß8WUþ®þ>Úýë¹´`åH 7Äjá”y_æÝáí•æØÙ† qH4LåQÃâ\^û킉Z¤ÕS¬3„ÂjŸ*d¤ž1—GxkÄÁN‚ÚÎŸÖØÐ ^È#bTÇP]ùTÔv.£•°Æ?­ÌcéèR ÷´Èè ¶œÐü€“ÁEãibnF1(ÈVímM òVê´çÞ¼$é ðŽÔï/õ®Æ¾n˚Êãàcãw4Yr«ôpTeI+ûH@ ì›Öžyÿ0“”&AÐi× ѳ÷WXE*E®+*y{`$Mzã¹ðjHsªè°s?YÑ,ú3Öh ¶˜~S«é2óèãUŽÛà Ÿ*2Rju@„$§ø‘1o´Ð×û€Y¼œþUê8¿ ¾•…«Æ©DæÇ‚XüŽ_ü>J”ÿ°¬0*¤dØg[ù3¯©Š¯FŸ¡'ìvž‰z#skø'š 7ò?›s=¤xŸÊ|®§E Ûã#„pÛd†$Ë?ln}oåØi‡Ÿ>¹Ã¾ Å…/¯Ýæço Ž`ÿÔiæ87˜Þ ?Xé“ícßµÜlk6ôç¤è(µ‰±¿º„¨7álPêPeDºœùÑI†m¹†ºø"Iñ0ómá¸yóxHr$l r†4.Óëtå"·fö–ƒÀ«8ëApªÝ0j4' ÀO²QjÈwîqë¢$²œ*ˆ·iÆP¥B—šíb‚=éÓ…€?}0Û&NOo&>ªýÕ›öh€·¸†K0õ ‘†gÕú’ÍüÐíAx,„ή„ -°åªb aCÈœ¹m/twµǾòÀ’²m]AŒf`°}—OBÓù‚ûFý£7*‡ Õ' óÊMî ýöí(@§¤>Wa¨1·ñTäeüwÃ8æ¡Ì•BA­Ÿ«"b¨5ï›ãÚ‹‡HE&O?G,…Q(¤ÿ®› Â¥³kw„ÐX6(³nfbì¬M“:v+z®çɪ+“\þùcV ¾7>=ÜÊÓv¬nÎhˆr_¸è–Ú ©ã* €Ù†äU\" \Šœ:9Ì>.FåêÐW0ÂBóÝn‡œ¯*iôYiUq‚$y'ºWÆ+:¥e™DÎÞ'QŽ»–ÚW)"§Â9à0QrïmÂl'(QL+ÎÃÁð +–,Pœ¹Â&ƆaiP.$\í§üV”løúÃ1Až3t®@ä[VÁ9É÷%A_WÌÃóÕ¹’îØX8©(ݹM£Xç)å«Û±¾¾‘.NÒ‰@þO€¹¬'üZ­””¾äûgæ××¼pdi¡ÃÎU΄ÈáÀ§‘ë5]Bm`{V˜mÎÊ;ê˹ÃÏ+¨|j?ò"X0v”¦J•–žóç0„ÉehSgëάåÜ;Hß ÏLæ¿ Ýé•ió Â追E¦}»âÆSFÇÖÍø}»(´-\•ƒšÏ§ƒdͱ¸Ñ¨Ieñ}8S<–7n~ŽÃôû)_¦ Kú›ßžéf®µ€7 ³…Öd&#G&kîž‚76ÄSÞÊ¥ k˜ö”Î& –þ.;ZD¡= U &ôrè·µñί½ö?MŸçÅÇÈýèb—xJ| ö ˆÜÇÄ›.+Uϲ"£ú[¾nó6'õD”ù¯9ᦂN‰—~LëugD–N~G2‘™B-¢ã÷½ØbAô`müƒe: fÜð#p·ÜbТjjÇ[YZ2.fëìjß´¦û|T`TÝ¿•î=ä{2æ†áì…0½!´ÚäÕ ‰ƒàÛˤümÙû\ÛBÈ{ÚÐñ ?‹€!_ÓõxÍó-\Xè8Ì^“Ìô°v¤¥ÏšÍ«Dpô»Dñj†©žGþâšøxµ-ìÙ³'×Ö1Ì\\Ø ‡ñCGìV·F ®Áø‰á“=rçƒe-–±2ÎÖPAnÄ^Ðîô9fu˦ò{Y!xÜ»s¡³î««3¯+Ô3ýö “™™ô~V.Á0Ó¢#êû6÷ç¹aÇÅøLic"¨Ì†Y8ˆO£õç$Çk=ÎCë4gƒG¨z¼gr~i¢Î ¹nhìñŒc擨)/òÉNðʨ›æ[m`À÷n¿r·=‘9 ¢ÿ«²þºË1úñe Ò†/>=%_äûÂJÚv´á‰K`—È¡}“rϾE°ŒŽ­]äùªkæúg%ºÝe‚Û™/¬}á­T¥LüùB©5¼Q @!„~ÿ4kZæúo vM‡¸Ù©a»= ¤ôó³£)g÷™I¡(ùîÞ``v$ßi¿›XÌ2^Kàì ºX¼2AÓ6£‰ïÌSÙCÏÎY²ÀùT+˜½5`)ïðlæ„í¾Û=7lþMû@µIçè(ˆ7……åÜsò–¯õîÌx§>:¥!@}6FxvkíèüÜ1>Â`Êi¸›Ïø»8È#Ý×hÀ¶Ÿ}˜í{¬ïßq;I=ƒÿÇŠŠ“i(uâ†C9Üç]©…4×Ô>ŒqQØÈÍPª>Aa§…q©®Œ²Õ1õ ¦”}ŒèÅ[ÿ@Ú«k¯‰«3"¼Q:»î†[¤8}§Ò€ˆóÂ¥P ±›a´§*ÿÏ–Çô‘~§Ü8ö¯l&ZJPX·âXè‘q˜ÿóOf7¶€#áß[0õŽf‡°¢žšLbêÛ1²£ ðÝnMO:¢(DU˜ ™ª°¢uë‰,‡·)…eŒ+‰XAŒ '>¶‹¶4S,³¥yZ-gK~÷ƒð©-qFÑ: m­+Í?´ûB/-ÓÐR‘¥µ‰-VWÏÒ§™£.EPtgòM¤‡¢M«Ë¶ùéäáEªéKž½ò(þЈBl5…IxÚèæÆÿôUá¶c*Q`çÌTí""`["-Uã vqûrg> ˜ÿ[ÆÔ’8‚ܱ¯ÖfqG¾Æ±•²º¿h'Å:ù*‡†è€_2£WJýy¦=`ÐË3×GRÄÂŽ²ò9¸6ô(—›ÿzáõ[cßÕЇ[Y¡Öiƒ6_7 ÓW’J$"¬MŠsò§ëøâe ÙÞŸêµñ8O¶»—Ú™”vbe¤öÐf­ß4xC_®4/ê{üÅ]J “ÆÌ)ðvXmGº˜3”¼]Yêµî3_ïkt—ÅÞ³ëÊŃ ôükßYþÁÚ¨-0E£cȘVv;tX¿¥„ ȤJowmüU‰××vCîsµ™¡›k÷¿F?d-Ó!ˆ©ÉµÃ5I¿bÑUXsf‰¢_בÊ+ÞÒ–b/€jåƒýT’?›!e|¢ âš¶´ÈÁ<¹ç ô‹‰9²²úêU¢|“þú#"£ìoð©à ÚªN'ÛEº~àå¶§1Ù‘ÎMŽÔ9ÔàDŸ© º<©a{ú£]† ©<=D¼Š•&Ä((¾‹ëÃØEë~)íßÖ²Àobz—£h­`ï·j°Ýšpr]/)¢c#( °ø(Ÿ6ÈŸ ½¯AàÅL=Bg†^G™ ”Zý!²Té´#¤ŒÁŠÊÌü˜¨î!è9ꊲ0@ca‰%­‘™2ûSÒ º“¼šr©,ž~­>ôjÜAԛ聆ËHEŒÁû¯Œg\õ—8¯6ˆq¹<ŽÎX·¾Ú'ÐàH43­ z5>Œœï=§³b;9„Ð Fß›¯;„ëãï¤j³Bx:â&e}`ßíZqúñŽ›5lê7=Gl-Uü¹Ÿ+óq…uà éõ®2Ñ ²>¸¯äŸaÔ·¾vG6seú “¿jؾ%WPíD°«Øk%­`ħøLùŒŠo–‹é%_òÎïAúq\ƸâS$ÉAâ'OlEãÝ|ôO©~,•¶ûTIGéÍ2©™üµˆPÑlE=ÑW|ĪˆŽÐSe€ºÀSPõ½eÁ)ÃQè`Å÷T¹ÿlþL±‡Üö 7’kµ,¬S!@Gv=zÌIÅ ñ‰ƒ%`¾8pàw%p!4®ª|çA8ëßÂîRTÑ7yHÚX?v”ÕGèB^ù•»Ó¨àhY~ceI"ˆÐƒÓž[áèôº#¯âùB(]“I£1æÿáÌŸtù³3ó<_˜}ʰ'?¿ü¨ 'sŒMì~ð\HY£óiĘz¬—2Èv­BiÃøŽ»‰k+¦]«û“Ñ´ MßÓV&LÇj’þlƒjpÊ‚¿!¸;g gý%ó….ÑŸ[rVÜSCyÿп!%p†ú\ìþ¥””}(xZŤŸ M–¼”.25xX\º% Eu4Ím™Ÿ$hLÄ€F²h2M7žNj„Oz\vž’GÔã…›Ÿ8?>ô¿8C&t PuÒÜœ`°dáä6½­ *ÔĶŵiï½ûã¨S_wZÏI„í/õºËh±F6]ë&ÏSZúÃkÝÖÂ[ 7ÛØ6±ß¯î@¹¸ÜÏp ¸¤DqÐ1‡ÿ¶—}B‹ùd@9\Á±8fª¥€ 6‡Ðð>[×Ñgè3)ÁÑy+vÁœ¿Ë®1*Ëà;OqƦ;Pá¼OvªQëF ˆ- EßûÃOÛöëãõל|gÖxzð±~èÒkb8U·¼{œ°DLLQ¤#æý¦š‘µx0q<€æ$« ÷mW›ó î»_œRºˆ¢ÌJìŸÉÝÈ ñôeõJÜ8¦ÈÒ{—ÀðŠH&ï¹s“RlUpÍû˜àÌFÏ5¼¦S`Ir€Ý<œù~mÝA”†í`9@ ýRNÀï48 òûìCH¹ïß5ÙÆb$"7LvÏ™D9_1Í_[¿„¥cC¼‡,¿Ÿâ×!­n2ðÇ =جå4ΓäÎêÀG/I–,L©¤!Q¹<&I¢´øz' ä»5Íò+)Hå5tPC…g ÝMÔ4Q·”ÊyÝS,–j Ý껭íGë£f^N¨ßÐØ>tŠ ÐTì7`ãéüé´y@²Ãß^Sß+ÁŽ ³!@£Ã;¡ìªïqö7ÿd|.¢ ”ðÓ.IEÔª»!T|‰I[”)½p½“Ù˜êÞº,³ˆ/žG‘Ÿ„Þ,jÏߎŠÝ?Aéº÷ñ³nlÒêêšY+ Yt¯ O-л٢ÿˆ0å/yYõLÏV0Y|DüSDœàéé‚ÁÓ¼D\À>©ÍB5צRÉ æ‡ŽÎÙè¼è¼´Oª#-ø²&é¼À‡âýßÛ‰NçýÇ ÒŠêIÄåL?én`R¤ÕA}¿'áGwn3'dNÖR£µ&¨¹ø•ºF »·ˆAæ¾C_3¡ ‚'É¿ÔÒ¶ŽW3lž0HÔF㣘óZã ÈØ­þ$ù¤#Oý Líé?§å9ü²ìQ÷—hG¾C=&óZÓ¯ü $Œ)&íiÃm† ³³+í‘X¦@Š=ÐU¯àÈ`ÒWþvcFÄ6©,9憉ñE­üç‹ñY_£º'$=Ú%k‚]àóf¼nLJÉ~(ΈñE!UQ˜Fµ8!ƒ*š EŠïö[궃Üé Ḱàäß«>g§4Ä¡CôÖĈ–ÄÎŽ«±g°ÆSѺq:„’*¨`ty)…ᜃ^1Èæ' Ã>~íîÿ ¡Ö4X]žü_Ää’3EëA¸7ºµ¹>y÷OœÇñÓ(Ž/‡ƒ=•R’ÑPü¡oŸÕBépatŠÅ]é='×À±¿Ö¡ еIî —äa¡ø>¤\ ùÉJQý_ †|)Òì¶&”þqúÖ#í_ˆÍÏ¢Ðú<øQȺ›³v9Z¢qþ4-×¹œ÷tzÍ›$Öý?Á eZ}¯‹ƒhÇ€ìB¡Ÿn„$̰|Oæ·Æ:g9¹Dn$Dн•ö°œú7íáúËùc^YngôÜeÚ0²h’Ñl5¢¼0î‰ðæR~µŽ[W¯\3L¾aÏ;#^Ô•P‚­ô[t©e2‘cmF1ïÂäd $À(ÓB˜§Ý ]§JƒƒûO.’7pîOÌ=¿GÐì©C”!ÿ6ç¥-6ïT”Ͱ擬ªöšçïG¤Û³W>-ºÌ¨ûŽƒ»1µ|“{Ì¢ñ"šu M[´OX°·Á)gØ®qîUªˆoò^X¿%'-J6<Ø6‰ë0ã‹SÀé„dá³V~q¸vÉvT XèVxH>ضrØ¡¸ª_ùçûÅñ•&¢Kßyöeª¡´—pê`¥h/þý†I(­Ö£é/°.û¼NôÀp‘“=tŠÑ yGGÆÍ$Äÿ¦ØŸ_EXÝÏPHEÄxÓ›Óä ô”1L ¼ÍêX·Ñ¨WŸÈ·x¤²Î áÄŽ¥Ub{៉Ÿ5£ˆçܳ@Ñx  ¬…:oïo<_-›–Ðp$*¿¾*Ö ½OŸÉù±H‹–›ˆéè7­öÄ´çå߉ыå¨q¤ÿ3ãñ‡GOvËLqvÈÿ©L™Ma2UnM+&rP½P<l…²Ž©°‘7“•ž˜._©nDÓÌá´Fx8~a{Ÿ pAeørøÃH ÌZˬ&ôÕ8³¡œ:˜¥à|–Ïý`sÄe¯QéÑ“ò€Ô»ôãrøB.H~ÍÍð5W#’âSk6ÚÕ€õ¢· ÝhvÆ« €þF^¶¾ëùÕ›z’Åç]vëWž™&ÍL´C)OI*[ ;`¸¦’-Œ% <ƳôÅ”$©ë¿¬ ¯“J‘§Y,éÖK$³SAõ£Î_,O^nk£W;6l@K™X¬žA@Ï›ãS×8M’#¹þ¥ÂàTÃlWÚÒtL#„É©ñ´ŸG\Ì»ñ1õ?½xòe\òf¥x›.eˆåïÝê$šÛé–„î\_Ï|M<écû#ßÏA~ÏHœç”¢·± _ ¾[3“‡„>/Їˆ˜‘ºšÒ©gnx×/*ó9fdYóÈ%gò( gúw}âÉŠÁÐ=û¼ßœêuýÖí|-¼×]áyš¿,6X,عrQ5ÙÓ¹f"–ŽÿÏô üÊÀ„ØÏšh[tfšÈQPÂôX­÷V—{jâºPô˜ÐÉ.­ö[¨ï½p‹Šõ›¶Þ’½u«¢¡ÝUÚøFRdzÏÔ#æé´é“äoó|ËòÀCkæ4,ü Î ¯ ˆã8Wq3÷Ìà°ù¸ÄMìØß±’gõ( Pȉֵ®=íS˜yBȹŽcRÅþdB“úðè=”>Åñ9a« 4ˤ”uí)nKÑ_TìCÉû\×zÛÓ hj±£%ºõưq­}FWƒC”¸è°bÄ\±ü NЃ—ØËFriw„M¢dYüno»¡ÒUí!ÝZ7¤Ð¶c ɺ;rFKͽԇ.žž’1Hü}àDÂéLÂ7õÓy€€ôðñž¶ÇBm‹ [,Ýûã 3S™¢ff _€£ò9ðfP2‹©Ž(=u—º©ûôøD¿àÞ(Ç hIb+ò€ýÛs×^ù BP¡[ÅÕ ù”±5§/)rDJ1¼6ÿ –KÅe÷<ÿr7µ/©uO*ǘý!tEc½ô$$ÚÜkׂ`º›ËöŒ•#^—x x¼KÇMBÅ4{”v'¬¶5Ü»óÁûÁhÌ–=†y_ ˆtçð|+Nœ|Vö¼‘óÕú¬ÕþCéyÝ„ö‚%¬Ž”Ç6Ÿ¯ BÌÜ Xþy—ú‰s@‘¶%`g0žæÕÀÚvÉ„*Bà…Ãzî¤Ø)ª1ÍwVý]€=ò¨p0y«¶q‡ óF¬¬j»˜:twZ-lÄ ëwÜ¡ †¾½Ÿ„M{ÐJõ2›áQÜ7"^rlÌú˜öQ‰—¥§š¦L%Dc5HI= xÜ3¡-#¶°m½*„#vj5)çMY{ O§ƒ.t$)­!›™wêë¥ñûEN–YPÑ/LoÍ­º«ú0.w†lRÏÔƒÅð5m‰Lå5ÿÀßNò7ò8Ûw–_ø%…‰vúàÛî¤xóSÜb>†/à 98±ô8ÊrµÛá£à.÷ñÛìaÚ’ÒêîRp½TÒóĵ5&½À$…”)Ü—ê·ú^ݾ‰à@ÓŸF¥~‡??þÑ¥þ8Av°.qFpîö­–¢~†ÐŠ‘ï[ás~úã%çÉø ‚‰?äCig³ÞØ9 uDJ)ÒÂg£þë‚õ7À–kG¦þâÀ-à•ü+©çªôå!^,C6b9¤Õ#Ç ƒë÷”ðã¦55ò•àF:Mi§0þ<óuò^ˆ])Ö}šÃþŽýTí.ôÈ­/U#‚e‘*Â5¢ W ‘3>~«b.6Yî¥ééQñµAö¼LéÛ9ö§)x^Û%ÑW†þòš5‹ §¼dµwò5ò]'²^¶(©Óì_Ìü¦þ¼¼J*\ÞÆƒcÒ;ˆwàA_}á°ñ#h' ”þM/ÜÁ±ì;÷løaËÝ ˜[ÂÆsƾK‰AÄq_~:(ä/˜zDî˜  ­7AU¥‚÷ dâ ð%Â-gŒŒxÍG‡¶—}Ž 'I²¿?Ô8ÅÅ”‚DŸ‚ˆCà¸vì‡~Ì)ÙU•ÒÈ•b ‹ ¶7f^}ÍÎrgQ+ÏØÄ®ØYeïÜûúº@ª€¬Õ„ö%º ƒ¹ÛáÉC´é¨©P(Ó¦ +ׇN[ôôý*ZLún­ÞÌ$k®|e Q`P¿taÀKÝDÇQ»-˜gäÛíþ[2^_›ºV°nl ·ùŽRõÓÁùý>Ÿ™‘ü¶ žLs¬ÓF*]“JowH}–Åžÿ1M½=õ=÷¸Å— ‚§"¿´ ùŸ¬-#òyãÕÍìcUçÓ=2•yˆ„i°Qé0E]Š’N·†jÞD/Uà‘cPéÅøÆÕ ¶šEˆ5É»0ÎЬ˖ç3 jQ{æye’Ó*å£ô[Gz–‚=«½­ú#sÛ!ýN¤× JÍM±ÃJŸá xù—¨”gwäŠT„‚#)•(æÖ-‰ƒï—°/„ÃxMúvŠk»ÄÖeWQâî5ÆÎz‡£”g¬/Ô›÷ÿÒe£“3{ˆjx¶3Rùdþ‰ßYåðÆKÜi?\VgtÓ|ª)ÙiÙšÓæíÐum2s³bav¾P²¥’„@Y ʦg–SÇ ÕT‡R}1^²o C65X™˜äñàùɵm’õýæÇñ-¿Òu8Yqÿ%ôÙôþ  ãR²cÿ´Ní^‡ûyRÛ¨¤@e°Ô§ÄEÐ@4âô˜ÿJìë'v+ÿhÇ$·áÜ‹!C±á†!óÑÒû@í’¯¶×2í„P––UtðÒò‹ZX}ÎÜnÔê›NW_v+CÚ±3ÈXÕ–»ÊŠjaLÒá¶?c@î»øÒ „jÇÒNìmm£´Ì„J¼¬;0¦°îŽô1 ³Jd§R{^².™lõ'[ƒo;Tѳz~DîT$JX\¨áZ8$³!N´ó@ЗD64ï÷V« ¥ÔÕ>ZŒkp›ºûóF×Ê£[ ñÊ–ü" dÓ^ÄQK³hà°ªvaßêÿ2Áp‘¸ŽÁxyàßð”#¤©ä¡ªÍ…fËkwYÊcKì܃§e™m¸]’ä„úœlÎmÿÞ•;c-ÕÒ“=ZEœÂ`y%¤ŠÒ™f7žgG™·ÂÈŸd·XÓd³ÏhëŠ&ÄëVUj¸úf¦Ü$éç*¹žª.={ ó8½1§y›¨–?„>©&cÀ¢®y´ Ìvmô; ×uUE }H̨¯Â…6ò]êǼ+K¬Îž‰Ër šÚ’chQIžÀB ýN6bè¯Çøù`“Ñõײ9åJ ;ñ•¦d¹b¿ò‚– ¢CÛvç¶%ð]N˜ÌŽSJç1Í õ£ý·p¿|·,…Nƒ<3—Þƒ÷+ÜYºyc·Çâǧî(øî+ âq¶:W,“Î&J¿#Á°]hho‘Æ^±X~¢¢t‘¢ÇV: - ¥<Æw»È*@œ‘…†âi6š0#ʪ¯)cèÈ”cÖzRÖ¿M¸#íBMLð… ›cêt»ç˜(¾-ºÊñSnQB/žSò½fÊÇS|u›å¤BÁ4•±2_©âÆêÅÐü%ÖN æ@)3 œÖç ŠÄOüÞH„IöÒó„=’ß…«/ù³9íßÂð­P £"ÄåˆJcJ‰\jm WïE8êSÕðGC– $R;¹_ÅGÓJ%~k/6nSñf ¾>‘$`Î¾Ž "VžZ2jFx¢–;HÉAÚ­;O#§r4… ›èÃiãü CèúXB±Ãn ΰäé§Ð=m[ýéMáZƒüÁ'0—¨¸’¯£ÎA±¯¿¥póm´,¶_ï0eÓá€_& šXò í´~ÌÝ“#µÜ›o©²ß3S 6 ô¢ÈïÆ*'*¿(ÝÛ{˜Ø6mÐYó÷¬8´1œ«-ÇÉ(¶6¢@œIçqåëøWëóy»C×K“ÑrÉ^AÒôˆi˜áQ 9Csi¯2Êá‡Kz£›’Z…¤Í¥Ïeù–d ;ÆÈÜRw&ð9ü¼põ¾ ‹û„«u‡b¡´±4’V'5arr¸!1¢Höh¹lÓ3bM|ÝÙÍ2:ì Á¼ ð›ó”É£‰lLéUнJÙ…cħÈìª߯“ú²0†´Â§*‹¹&Χ}Û7ÊMf´ÂÖ\mÃÛjÍ×» Žb…×ÏØÐÞ”eà§NäÛÖwÈ üÂ8gǛ׫ÍöE42ce—â5}PvÞè.ˆ‘½#û5*[jpM’à ȳ{¾²ãíÜŒ3U"¡Î7’Ãå(îømj”zXé8º¦Ì(UÚ¯ mç9 ~Lý*pÓù©0qóÜŽ•|ò‡<¡ÚÃ껚ü`ÌQ‰j«ÂKK©ÿØ>Sã„–wÊYC×·1Þ9þ¦.¤nË8¦Õ&«FÄø˜¯š(oÞi¨¹£n·M}P¨ÌZ˜ƒAb¹ò…O°ÕÆJÇŽ%c$[4µíÖç?Àq)¡£ˆQœ¤A´æ©š=AŠC«*vIÍ»48®ªF4FíqÕqmR+­ÙâÆÞÊÙ+±såžÿáy÷|žßð}ýÓ0^'óþÖk%ïÖ[v~æWZjõIK=AT3™Ã{žF¨žÝ8ÊÈñi„ø£¥Â´žáÈóÇJ7ˆ+L#±ýÈ9‡{/Fxÿ¾ÑœN»Í¦kz ÔíٮѥMêTZzCûšÍ§yØ)…m4Î(ó‹›ÿí æjÁ?v.ó'‹{K߯ò#xÍ3 îk’­}E” ³(U]þmw™²:C5X!à¼0á͆.­ªå–ü¹£™MPSùþ ·°U²ÈMU1ƒIçèó¿`VKì‡IR ËaŽáFÉj㽈€ÊaVÐ|›:×ÜêÑ ’ˆƒâäžSÚ˜Yf%ÇÅöñmÏÜXÈ­:gípdéWþAó•…ª»'¿üY›µËFV(Ož>Û¶±n;=¶€Né`ĵßa-íñgÏ»Mzx4à“eTô½ò—fŠàƃÅt'W‰”ÅÒŽ×BeŽ?åm_å^–pï/ºEDíݹèJä&¸]m†ÝÌNS*…QäÝð•–°¾UX9­‘ 0h9nuiz›Èê«ä‰VÏÑ¿! ÿ±^!)¾y «*iÍk‹T¨1Ýöº)ôBóïïºZ½ÏÚ¿è;õhZV´°*S É+IÖÄ(j}“küÛ¡ww2¥Ã=5°­¸K_ÔüÛT·(l…=Q£rt7s‡JÇ8$¼nZxÇMÂרòQ¡õ2J·±íà¾ã½7)ôs›Zÿ½)ŠÒPF—œLÎÕMÍHÝjT'8±Åñˆ Ey“Ð!e`´vÔ<۟ǽœÓ}*XH¡[T¢0º$øîƒ`‘ÄÊ{™¹óo›cwB´zEF è*CÕkrƒj•‡2D#Q8u ùý’¶‹Tä3²lˆ €è%§kB±1ifÊ¥¿7拞tÝHÍ ö¶·HBJÓÞ¥¾¸y±¾cI¥ï¶BL F¥—ÊÌœŸ‚ŠL—r 7<ϳlUߟG»tR.]*ÃßE~+Žåáí» ~VY²×…ã1AìÁeJÆm¢âFJI©<½Ó#8CÎ ‰É>ë¸Lcœa„|8=íú¹R}÷-Ò¥Éê—.Q+â‹5Y’=’]Oô a?HKðFôÁ·A–Ž;ðÁ‰3ë‘Õ‘˜ãƆ0ý%º5n13`á~Vn–㚸TõŸžž×HWÌ'¶õO åÇhzWëõj>±“ÂŒ®ÆªAlÌ~/®wt¼ŠlÜ0{Ò >×H¨Ê#©C¨„;uúW]Q¹]²¾{éÖêG¤\&ä2Lx @Ñ fæhïæ=qPÿ-鳎ô›Ã/ÄBÜ—ápâšõÒ¤pâtþq© ïïX2%Žî¶vRË’RßewÅ”ì]2ìÌ ;G9S•CwÚÔt3€å'L©FÕßEâÏœ vZ­æ‚ËqVjµÆöö5´îË7|:êlß•Õ7a"^.¹“Dá¾´öÁ8 &l@FøO6ð]$€çÊ7NýoiR:­ñ±”¥ö«qÈFï{*•C²ÌW~²bÆøÐó¥Ãü™µ¼¶ãD{#°,¾ªò]µbÛÎM1­MâPž@ìJ«ÿzkOM÷à<ôqäº9ü›aÙ0çI”êgo`$n°« "Jy¦ùoá¹aß+­3òT‘¼!߬k÷ÙÒo$Ô¯«„ZÂ,ÄJåÖ‡?¥ÛŠÙ;kBANÉ×mõìrPpL;büqK·'ÓpÃôùHÑ’ÎK†Ì©RË<¡¿âm*úª²Ñ„Ó“i3HŠbI× y;{Ç,KSߨ ìÖ¹¿#üŒnq2 +îw¯]Š›ÉãÉ«ÀÌNú} Vxx·RŠÿë(%üL”ë!Ì<ë‚ ˜VƒÇ²^3'Ï(Yðƒ‰Å–pË ø¥'y:OWþúÎ%)@DÑÓªShæ?¹{Wùu–¶yæí“Œ·rU6õpäõúv¡Q”Á©$ÎÁí@g~ßJÉyÆ9jv ãæUÿ/û?ð¿xx{àÃpxÞ¼whïýÔׇ÷__j£P endstream endobj 98 0 obj 100462 endobj 99 0 obj <> endobj 100 0 obj <> stream xœ]ÖÍnÛ8ཟBËvQXïO HY²˜é iÀ±™Ô@#гÈÛW‡GÎt‘øˆ’®>R4éuw¿¿Ï·õ?ÓåøoÕÓy¼¿ÞòËýøtÙnWë/ó¹×Ûô^}ˆ§Ëcþ¸ZžNy:ÏÕ‡oÝÃ|üðv½þÈ/y¼Uõj·«Nùi®ó×áú÷á%¯Ë]ŸîOóéóíýÓ|Ëï ¾¾_sՖ㆔ãå”_¯‡cžãs^mëzWm‡a·ÊãésM]óžÇ§ã÷ôڶ¸¶®c½›sSòü1ç–¹EÌY˜Y™Ù˜ ÙçÜÖÍùŽíwÈæÒ™#rbNÈs‡¼§mܳ½G˜çnýþ@€?Ðàôøýþ@€?ÐàÎìÈôøýþ@€?Ðàôøýþ@€?Ðàú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_á·šsõ~ƒßè7ø~ƒßè7ø~ƒßè7ø~ƒßè·RŸ~ƒßè7ø~ƒßè7ø~ƒßè7ø~ƒß9þŽñwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßátF8#ÎHg„3ÂÙ¶ l‘Îù+Ú²rÉæÿ Y,h6¥;ÑÈDt8. Pi|ñ€Fv ¢±+íåK÷ÌèdD†TôÀŒg¥†u€NmÉ-^F ̸>-AÍÄNèÄ…²,²éŽuð¬´aÆ`¥Å‰ALt&8eÁM‹³<—“#artË„F{ÇN‡® tÛáÞ®Lˆvqè”ípvÆv¼øÎ™Kû2ž¥=²æn±•ö=Ûaîzf˜»õ1þûå‹OOgñôË$@;<«) bÏwW<}ynS—~y.®X§G¡ô¥)›Á°ÔÁõë ¨3,uðîÖÙÿdØ@±ÃÿÚ˜«ãÛ4Í›rùPvcìÃç1ÿûKáz¹â®ò÷pר endstream endobj 101 0 obj <> endobj 102 0 obj <> stream xœœüc°-[”- /Û¶mÛ¶mÛ¶míåµ—mÛ¶mÛöwNÝ[U¯^½__̈™9Zë£gï-[fÌ1b’*(Ó šØ™ŠÙÛ¹Ð2Ò1pÈYÚ¹:ËÚÛÉÐ ÙÛ˜ü²A‘’ªXºØ˜þ/ŠTÍÔÉÙÒÞŽë?ã„L ]þD ]þ W±p%t5' `"`dâbaäba#`b``ÿÏ@{'.3'{#(Ra{O'Ks .‚ÿ:% PUR§¤¦¦ùo„‘“““ÀÈó?SgKs;²ÿ‘àÔÍÔÆÞÁÖÔÎ…›@øØÆÆÒ˜ÀÜÆÓÁ™ÀÐÄÄÔäßj†6¦Öb–6–ön”ÿ3Ë?…2ÒþóÅ EJ njgêôOKÿ1ñ_±ÄìÌMÿ£v&f .zz³(³):g3:;Súr’ŠÚ™ÛÛþ[3Ô¿“E,LÿiÞ“þÿ­¶µ½»÷ÿ‚Í,íLþMM`âê@¯jgéèj*)òƒÿ þ37u!`e`bàüGiSGSc ú/©âé`ú$ã¿°¡‰¯·ƒ½™¡³©¯¥™é?(ogC7S'WS_ïÿ'ñ?GPŒŒ&–Æ.F¦æ–vPÿýØÔìÿŒe ]œ,=´èþÑ€áßÏéþsãMìíl<ÿ;\ÎÐÖ”à5ý_´½7--;#;#ïÿLô_ügûÿ*Zþßòþ;¡¤™=#Ãÿiãýþo+ônÿÇÍÿº™’à\àŸí],Mÿ1ÊÙQ‡•á'þs`üÿ´éÿàÿˬÿÿùóß\Âÿfúocþ¯ Å\mlþCLŠÿ#&Á?jÚÈü«çÿ6´µ´ñüÿÿ_‘ê¦ÿçqüÿN£üÿ—€^ÒÅðŸfíÌmþ³t³ô05Q°t1¶øý_\ÕÎÄÔÉÆÒÎTÁÞÙòß·-#Ãÿ›T±°4¶¶3uvþçÎþgjgò?‹ µ3¶7±´3'PvùÇÚ†N&ÿüK»:9ý#õÜíæþçØÌòŸMM=L¡Lù·ár…v’úÕÅ» £‰Ù€ªî¢#ëgû‘—DI(6?kCfçGb#’¯7ÉÝm×;NèŸÝpä‰ÛK`›ð3ܪ˜™ŒÇ!¶n§»eB€® í\Âe!r—´ž £ÔŠi¸¡k?.½ïvr?½B zŵÌ1êFyÔ%KŠÓõ³Â»öU¿û^¯î*Qâ_JÛ(? ÅL梡VB˜J¦ñƒznº¸Ôx)ß×~„ªEgŒ ™tüŸ·¾äÇÐ*@¬¸ÃIÓ‚ÿz\\ž\¯Hç¡‚PÆÙ4ÿ䃌«=klÇŸK ô|?›&éöõ4€k¯£bg Ï™f3‚O¡±7¡ÊýHCAØŽ©Ž®Õ%?ÀiqÙå«;;§á Dð=°Ð/_1Ð_¢ƒÅ«Þ©xé3üž¬ÁHÍã¯@óìGŒlo“]ò)ÆPmýßhÈDœ£Š~Q=mœyKUB jóÛí’e3÷škx­!jß®ÙØCöNÞ\ê(_\ÉY]Rd0а«}áÃÌ8;ÃÃZeµž‹|ãke…w_cYÕ¨¸œóƒºˆxÏå+ØèYcé•SI4‚Œ0ùÐêÁ°N:Ž„91C¯Jü')ha@vçs9|9[ûV~–âÝñq½Þ»Ó™´ |Ô’^YŽ`Üíšìç^»s18gkÜcÅ)ó?æ’–Øn´£½\¤1^Å~ÈK~Èe=Ö—g­‚ν‘?U;`Ä|L îZìYjºÐï¥:ž÷Î Q­ ©ß–É|¼‚oÎI«ŠºnoÑ|£íMz£ñ`÷íjFµåó:Aþ;e1·h­‹Þê ye”¤ zåµÏ¨4 ‡¼à6àŸ¦6\½3²ù¾Æ«~ÜQ êG jNpÏ]«kªÎºêº„+Àœ:˰ßò/ŸvENœz†ôÑoñÏm¡x‡çƒ #~D¨ilnEEIð%?Ó¹¹ Þ ôp“;‰BÃSÌpÓì#&Qf·ëH¹”¨Íéx´zäzbHæ ½t˜ÐëÃVEædïݼï%Š)©§ï“ïFÙǸþhåä²l›Þ€%6åç×ËNÜå†qêâÆ¤R‹ä4‚*r@ýÍ·ñnð‚š I¶GH¯ ä`€ëÑ”ÓÒWk3,žÂ°JðP æ:D‰VTÃJìL¡ÀH>a€Ô—-œÈ±uÛöKË»lBÂz^ÿj.l7HÉÇ7w–¼ph‰Õ"g‡Ì¯Fâvç>tŒ‡:â4úͳɳ¶joòºp!g)°Á2r×¢0*?I™]€^Þ‡Ò?•3IÅUÖ|­°‹³Œn€Â ”7¶hÊšÉÜ̘nyÌuÀK+ö€£ñŒSqßꪅyâÐQ칌»à™™v‡U‘l(®˜n¹U5êÕ?ê)ppÔÖÛÌd$ÑßÕ Ë(Öµ[ŠüÓ[ã©®°V^å(Ã;–ã‘¤Ê èÈ8ªçy+!fÎ`_. Á‚ˆX¹s¬~b+ÉP&!µ`~l„9!ÏáÔl;zzΙ ^gFbÏ¥ÃÉA øÀî70ô{Á3.ŽoWvˆÄ„åå÷`Ò5˨ªkÁyÎÁ*ÿ:ÊAçKÊm:UæÐÂ$pC¯u÷ h¿” ¾Ñ~ý—žZ  m]Îs¶Šëí•0J9©S7ù¾´“Ãyc$LnƘQî.T!üª9¸éø —KÉæQÍ(y@_æ¸\w!.R¹ô•§PïODu™«­ >Öó nNÉVE+‘#)N˜[ÏCØÊ=XHˆ¦Ð¸g ]Í5Ì›JÂñÐ5n˜`ÛŸþ6M:'‚úýµûD¯ >†G½–ƒôÆ5ÿ ²” sHåhUœŒìÛ=”ȶ¶†w‹i¼~üS|åð„çb÷M^Ï<´ºï3  ®C~rÊš)»‡ÂÀ²9ažbU¹ù$¸Hý¥„ÖT ’Di}è3£Nƒ 3K3+:LņúÆX_…‘/9öG$âòšÐ%4äÒ-Á¶ŒË{J¾4 騘Ãþ%;Àb- ™ÅQ‘’ÚS6|úñœ(Éê'®¡˜²0lèš«Pv/*¯àïyÞ¢© [‘sôîXX2îcx)ãY¥ß³yxvwœUçØ÷ H/•˜ß/`[iç¢üdpr|ðàœäÀÎR¾™ /¸TEµËÝét¯ã•__ÛDVÂw äPü1¡f +`žÜVÜ.SMåÈp)ëç²MÕ,ºXó<…Ù¿Èÿ¼}«&´fTý%d>ìy%ygôƒðeMj‡ æÈ– ®ª(‹| àŸy²,üjh¨~­^ Þž6E-5S‘ ¥K«¿’心oKˆ¹)ó‹J$I3e‹Ùgøèk‘ nBnQ¸Â|hH )»ßM¼%â/‰…èºs&Öº åJéi;o…Ü$Iî9+"èCum"àÏ ¾\LB.dt5¢«/˜#L³ITÝ´cÉœÂ#â¸}Ä“ŸU„û¾qàˆ^‹CðßY˜ µ#»;=Þ—Z(N†IÏÄ„¡ä‘dxɑډ[¨‡~Súc¹*‹Uy£~I\ëèøp?Œ5<ĵ‘—H…OâN±Ý )L 8&Xõƒ^ŽxVúÈ,íëË?´]Ô5p {wlÀ~µD:ŸoM¤¸¨X–„¹ÿpÀI[ô|°³Ý8çhIx(äÁ–»]}ën’¥Dfj£,1–»:^%·ÏpCÂëÏ364k—‰¤mYýàiÉã‘ùyü¨^r›#û#åßת<ÔL5%°y€µl- Mð®x½pÛ"„Þp\øÑ¯ñõø.,†Ó¨³ÃäÏ1UŽ€≠PeÖ 4<;š6ú ö åÿDÒ„ŠüÑ|êÄŒŒÑËßóñ3nr“‘õõí…PwáÞ;Ïý…¥'o_¼hŽÑr”ò;yBµÜ¸${Vj¢—ÎÄÅ2ò4JÿZ¶Ñ(ƒãæ2T$ ÷g‚ÔÇ^dw›qã%®Wërú[9Õ£„\”ôüÔÈÓl”²,ìzæ©KÚ¢G<Ùô÷hcn2]‚цdPX%ZÒ&ŒQlÔ®BÂWEéiÓ¥[~0Z»·Ó“Vv!œ˜ËdžŸE­Óä}MZC>p‡3KÞlT·z·þÆtccUg¡k7`qó+ Æ£!ª+® Z72à½ç “d÷ØH‘þ™½dSö˜–›×œY@ÛVõ•C–yUPÒjj$£b3+‘Xß§ 2ð4Û2¾¨@†,E dŒSÐ[Á;Jo\šž+òª}(‡â†ãÜYne0E—ïâ*ƒŽ™:ª"@;Ní³–$üH¶ØãïDõDÒãÚò3ü6ÕÕQÜ ZŒ¹_“ÒÅÕÆ—õÓ&R¤wý üóxÒM¦/'hšÝ¥!¶g `¤ÞÉÅœKp:,IRr7JG••ý®ò5Xà°¥z’òÊêëÍßóÖ´mÔû9½z+w !_u(¨ö:¬>Ä¡NˆŽ‘ ü°ëÉ%ø÷JcCtÈ?™=Ùç¼7Zï'õÁêÖ ÍLë ¥$ X8ðú÷fudÍO=pM)å5ª9 «HATÇ[çQUgÀ/ÐçÂ^G¤èmhµ|Û›†m‚⣢YX{Òi­Ž¡3oË/¯wr™’&¶tÉ’øçñ¾Øx¢¡>AçãP<«›³ ¯98}©ú¤ª,ÂÕF¼ÄjPNМœ2…«ìs}>'–)‚HÔò¾{[ŠE‰¿$z;p”ªy&Î_8®¹Ý¶Rev A…DêÌ d¬ŽRÛAcó·¨ó ¶ •g4'ÕläN.Þd|ñíôùïrÍqÓ¡”„"2¸\¬_ÉRÉ µ¡NZà™‘~‡÷Xyrhº `„N¾ CýwÛÿü„äzq Þ¸}DpÓ.n1›ôÈ $[ îZ¾ ³®ýìÀe1|¥¾‹gSFꮽåLhcµRвÃ{­å´ø³÷î÷~kÇv_Žq{Áb¾ÎµÌÙþÍ‹–`ƒ"Þï–Ÿ<ݲ¶U][‘UpœøÓ·¼êgÐ¥¸¼­½þ“˜¥jÔ¾\Ò\„‡ASææ-–3Pb£y 2…vÓLäL ^‚¦ÈÙAˆ²ã¹°6{Mò¬PP<ØTëæâb÷Çý¤«M8R©ª}ÿöJOJòÔ ÁºÛ»TDp Ëà~àùˆËk7sŽ ûÖ4HiE`˜-Yö­-[#ÌŠ¨"ˆè:Ø‘@ª‚±“Ž&¢`£æþÚ¿r¶3$§¬F† $gan£:¬€?Êkä2/;ÁrЦx¦YÓÉ‹÷¹¯†=ZéÞ‚sÚ“ÃÑÖwyÑÁü“Cgp\µN¼þ&&kùl÷§.ßz7Éâ‡Æ¹Œ’’zps"`åͪÒS(* qº¯”ž»]6¦p&÷z³ug ‹Û¶s˜àÑh¾‹¯¥ÃEØä\o¢SYy[ ‚dË9à}Èj?ÞçœCê©Ã ŽXLl°R/=½Sö=-  iQ!1f WÂÎÀKœw§ ÉðŽ­Ž> êZ€.ç @ô¾Ì/jžÜ]ùqñÙý¦V9]#¯ÀzJK{k!%.òݦ‘’¼Ðþ¹Ï ðCÀQ9lA­ÙnT;û²2Ь¤vŸOÅsÑ«¦p‘Gs¼­—È5~%¯<~Ô2ª©)-¾Õ£äƒV^ü/…ï>7 ÊéÜ TÍ0Õ:×ü«zâ¬M•‹¥Ý i¶Å¸ébïUæ‰uÂ’hÕÊMõja* $Ö“ÈBÚYì~Ïßܽ q—ïÕŒ­âž¬þ"ŽúÅ ™'0ÂìXí‚|"¨™ühUoÙÊp;qêøQÐM\4Á`Õ&o€þ[ŸØšú*Š(²üƒYW¨O€n3‚Nܰî|k‘¾z›à@¤D4iRhS«*HÓùUéßÙýMxE©×Ô®íÐìwÖÙYo›|6¿f›£t²Lð‡|ì0„úË °ƒeû%ؘۢ'sþPñŲBÇà['ðòÅňöÇÓ<”˜/ñ´9Æø+ضùUïdÑ#~DG=c»+6øÎ¾ñ7ÏrÖC µ„³i»GÒ­êL“  æb|j Ë6ÚwA‹Îg·Áä·ã@¥¹rkõýcJ#éWpQéB¦î,¯Š¯¥ã–fÜ#–¯ÓUÔ¥3^ü+.¥¡rˆõ¡Çk@¦x65³™k Çûps ÷ÖWÁœ¬Òñ4ñcz>„Î46N+ ÆvJm¿ª ¨›“žh`÷ÊUË>ˆûÓºÚe¸ ”á¸v50„í .FÙî[œN6 Q”5ĵ©¶*-Ú9®wyksÒÏ Ó—zHAÝ;¾6ŸæÒúú‰äòÂRŒu÷w˜ (G¨,íéa¸ST3Æ–ÝbÄúf•`O±Ê?/¤Åýr ëu=+æd‚XÀMiG Äx|{®U?yYáYľ†,ñ£ ÕtrÈÞXyjè‘=‹º7 ½„Óû[_‚û&> «ÑøäÊ“¢² ¸ØØ§àe5 uü€›pé•E>1 eo£Ì‚m#;É\î.ŒÈT&Š`™©ÔTuj¬eý*¢êPDÓ½D´X’Ö6®ãyíê芇õÏ©Ç^üSvßVðâzá%XÓ_]¸”P†è#‡ò[ƒVœÖ~{è‹ïlï÷ëŠ>Æ÷‚™LV 8è³®0Mÿ¢Y±›$E@TºhšgÁÛ`,:|&[ÈØeñ-¸¹ªH]NÏeè„NV¶^W<Ä1°&X÷³Ï¢¢ƒgâT§µìÃñ‡²ƒÿ "Ô±Y;°®Þë>m±ŽJ¶8$²ðJMNæb?¿çþ`°5šÌ½îÛšÏÂp‡¡ÛµpY–Fê¤]ç¡ü®§}Ø…$¢“‹˜œcÚ˜6á„!ÝA®ÒŠÌ®û%ïƒZºŠ—fœW½Æ¾O©†ûà3*b%'ÅçIR‡¥±TŽã§wnW‹¨}DÖ;¯£`Í ØJZc D`ïÜo6Œ27Jõ èJW™t:Èøñ* b×4U`Y£=¢ÌNÑ+¹ÞâÓ”åX¾§Æ QºJw&JÇ ªö~á;+V¤ƒå|ÄF‹ÄLßW Oÿ .Ã~‚Ðe†e—¢ëK¨>„äÌÅ¿Ñ q÷—½I“ZP•ZÃG©‹j±ò-ÊGk5Öo]ui+ÞZuœJÆom•7iÞocÈÛ÷¶fL˜—¢ô剮åï[àÄšz\þ;Â1‡ªã©™ÞžD´ÿ3Š XyÄSZ U‘1 »îÐgjùUú›×è¶oe Õ\ŸZ* Ó«ï¾û—Tb{S^r M^bâr'ðž1²e²W}¾Ë½×%ÔJ”ˆP]°¸=Ë-Û¾)ÁUÎ1uà¶àh5 ÷º.@–Œì÷3^£;ðF4Cûr¥ƒ¹Ä›õ‘¼ï+‚9m‰ ›¬‹v9ò±#7¼I'³ñzJŸ–ºÄ(>¢æd,m{з"ˆc ŒÚË£Åv•Åh˶½§]Ý‹2ÃÅw:*‹WyZÚ)Îv+ÛEl':ÒVX·Œ«3]¹Çì*¿Ìnò 5bA¢j•?íémjÞÁÔÄõf Ò¶ dûÔ¹Ë.[Æe8PßÿãA éñT‡ hõ[òÙãAô´ò¬»Û§êö3p§®¢mn›ýŒ~´—`L¹l)b^£op_£z*O)mmÐù®/µö®e¾«»„¨¶cŸ­›!ã)›£C8ù°>—å˜%ŸÛí„ÙuÍÀ¦yêWÖ7ôšRX†— íðæ SJÖÕì†Õ2#¾Åc‡ÐùsõñaqÒ8aí^¡éXþp8Þ®·6JFsŸ'|bó1˜Z“¦’JËm<(OÊŽÔ¡ÀŽk™¼¨˜‰®zŸþ ~\Eyéë>õŒÿ¯DÔˆe&;·¬´—¼²0 Ê;]±v'Úù7ŠÍÓÏD^$}U,2­ë¹9Æ_©¤=)lä”Ù¶nŽc]OÅü\]t]qÂóOô«[ñm¬ªÙGª*{šèàk®Øw>u-ÛË ó™£gY-1=uƒa™BÐI¸8Cõ=M8¹ÚuN^ùŠý^Ïå6×VY2¬Bcåí¯V¸?…”‡I-FxOí'Úú~èr>K¥‹ÁwŸ­c†‘a×|‡¯ø^z(¾’«VH­÷ª ®éH$-D0$yø€|..x§z&,LŸ¼Vq£îrU>¥ƒu² WÔÓ[mý€ë¸“ÇŒB%Ã%Q"+]žq„¦$;¨3ìÏ­ëȸ†­M ooÛR‡“ßô—†éè-î-—H¼K¿NèYœºpðª^¹°Ì{û¸¼JP>rV|©ØÏØlbƒÅ“äDY˜:™©x˜}Ü”$ÞŒ;µ4Ñ}Ñ4Ét![c_º<ˆ{Å:¹íL¨Ž©˜Y‡À?lß'Ðw;¹”Ù9Žg•ü³Ù6&›²$'uuLI¤m»z%žeR²Aݧ5g ;/ñ-£O–n ¬ÅŽ£™9)¡Ô.é©÷©ÛÝ1&”4€_«‘!ÇÕOsfnÕ"uìóhV¿vXoŠOXº»éºè¤XÑ£m7—ƒ«ü €ÎwΦÅbÝ‚«—dý).wÒÛ\©„]îóÎ4þþÑ%Ô¶;ã_ô\R}°æ%[}n9=©EJ^4ÜP}ðÖêgžÚT’yP·mõÜP0¬£h? Êíá.`Ï?4YÞûõ†¶òÐå\.²çÉ(ƒs›å¨Ð¼¦žû”¦ëÐ {J:˜47¦‰tdkp©Â™soР$îÇ.>?ìe× ¡uWvžz<,wW½¨|éÉ&@.Ã>•saÜü†ƒUâÚ9ð2ª÷3še^–~â—È(`ó¹•[B‹²éʳ€ù&;Ùâ¿=¤Kkk€T>ÿ”>oap)ɪ;W|Œ"lœš Ö}Åm5¢e÷"Õ78>–¤G7Ôv—öGȆ« €QüÕÈH®X<a¶×6È@Ü…—µï¶¯rÏŠ­âJÆL*7_–ˆÝƒÖ²² ŒMÄ5©}¯ðwä ä ÆÙßzÝœK†¸s÷€ ĸ5I,Ô?ø½Ôz 5†ñK5á>H…/ÕÈf©À ‚z§˜cyg½S/«X’­¼™lÿ Ðg¾åõïRº¹óÒ5!JJŒ\J L”aÞGy¯.X%É)t»{ L3µU䥫 ƒËœ0Ï4Sþ0ú@ðÑa ßf¸@#¡¡éT.¸†H{Æ¿r@+²™Q€Æœ!‘ˆW„KÈLÏçà î§Î–',–¾ÕÛ–ÉçÇ9É Q1˜}Ʀ ÿÐÈù}$!&qªÅ„ûî‹áƒ2Üi¶áE Wc|zÍZ5<—&1šþèÉ÷Þ˜-ø©zú ˜/8vj#â]÷`8¡hÅu®Õ ÿtùÒxSQGMÃÀ²\3ç7kYã ÄÍo¦gv,KM޳}ÿáÑÉw‘Z’Éþm”]î‚ù©Ò9?¾pT$ˆNS‹r^Ï®XJú²þà§¾GÇ3öÊRëמä2¥m¨·Æëwn b¶5™ GôPî{Å î €Ü×Ó¥Ò>» égóí7µ>Rùi‡;}„—ž%Ke°!·9æ%má7÷èÓx²aíÿ®-¡ð#–€´ PÝóÊ[èúPR/žNZQ–| 7¦C&5p½úÕø¬8(ÛZÎUðÚϸ±ÞîCD)ÂàÌÕê ñ GAð¨+>mí¹ÚÓ£ÍMU&cý»×“ ÑȆ»{Ì™tý±ÉÛ6> o²a£73Ã6D™Λ ò­@¨Ma´º÷S@ô²Ó˜áFÐI—±ž¸\ð¬ò8Ê!UãfâbNfB¼`>SsÊÅI.”Kœ“ž]ÚUøÂskãʉeà%G-`YQ¬­‡=ÎâàÃmÓ•j°÷šõ5m™Ú®dÎÝñY†e?uÛåSƒèÎŒT$°C952âõïÂ(—OFû «[ÊÕWÈdØ;( ÜÍ£óÄ/£ºt©g+óz昬ðèG:¾M‹Ìö°–I+‰ëö/y:0û0gMFlÀþW`nâ%>êj a8%äfÌŠô– %6Äò‘ìÍÅ÷$›$BLâýÏmë–‚&µ @ŽŸìª‰%óŸÖÒÓvénþãÓ-Œ•ƒªj—NñOºÕ<lH´f¨rMÿæPû:î×åÀC¸îA„ËeÉ6œ¤‘#cû«%jÆ};Ò†{·‡mP™à&ðmǘ.ïËiî "#º`„汉L‰h±$ï©»Ê ã¸ aZ&¼Ósñʼnó_…q’—ˆ1«v•¸Ä Pn;Îâ>ª×öMâ–¥_FqÇ5XT ¸ohç8á·ñiEïGD«¨–!¡˜nÚ«Ñm¯.RÞåÞŠ§+!’wíà‡`XÈÄØš÷Ê(¤.ãzuÕXצ5a"ù@ŽîFèb.An½ ñ‹–DA*#žÀýDé_ L;Íð4~^œj^¦Šù),¦¥™ ›»PÚœìmý¬çˆâhú'èIU?Œû³UB~êIÓ]AûÂ&yv\Ø\PãBïÀ&:FL˜^š­ýR¢h±š³¬Xdú;×#M¦_)´ùdmôÛ¬ÄH5€õ›Ž* ×vÜZlŠ(âaI5œ.o´Ò#Øa ä¾–pm|,H¶#”ix›HdÍÆ» wv–;ª5²Gý y¸êÑöÛ&ê ;H„¶ø8ñWgC»äùõ"žMîá˜$3OƒR)Oâ‰SÖdf}sˆ¶ú3KÀ¥Ñ)l„"åÕ`óÇ-’â§·ÿt,]«Èzžo'¿!#AÄò ê* ½Y…‰q„ÈwÑ_ªI@d^´(4FÀ?Æ^aÅÏ„èir‡–à½În2.ÎàËÏNShfj‘}t¼y`ÆQÊ6,A *·±]Š×ñO€~àá(äh ªRGÖГ¥œ¿úN×ËwæxTåÐàœNj“Ïýx1\¶n ‹\6~4¤gÊq¢ð©¹MäÚX)ñ¸jO¼T¾Ô’Gú1/¿'–r%¡m¥YcÓ#¡P¢Ð,”‹kâ„ jÁ]ð:<—ì úÁå3Lº€n£ï®é¡ý)XsžíJ6“ÿ>>:$Zîfþ›SòmùÐ%ß`æœô&xd–€¬ãÚì÷þÕ uÿ2ƒä ”E¹¨™Lì_½ˆ`úœüÃsÏó 0üz ñC¡„Õ®,ÄiÝáãó¨¿îq6˪{;ÂÂpÐoÄô%Ï©ô0KþØÀÝØ‡I 4.6|¾Ñgߨ §\©ÒÏ6ñïãçªÉ˜œI=jè‹BÐIÛ’¨òŠ5*¤. ¹U4û^Ø€^ªï¤Ç¢\¦Íà©:jå]ˆB½D 0¹‘³ \¦8ƒÙaŸÚ2Ç4tÞ-8J²Wã¼=ÐδÖÂp8R¹QYü<°'Å›£ÎW aöÏïÖP·°%ü6Wü ªîÏ©ð†sAÝ¡ÃM{Ÿ)ß¡àóñ­z™ÅNV¹w´¦¥*ÐÁTž†‰Ü¸+Ú€/óB°yƒŸJ‹VL|˜–ÍŽø,“Š«£5ÂŒÞ ½ ÂÑtOƒšJ7|y8- K†¢©Ñ¨wžÌ<;›õ…V°¨©4gNžÒO9WDñH\ÓJlÖ²&y±8·%eý­ý}™ö[­œk¤ (nŽìÏ1ë& ²é? Ô™N$ã¾`XHtë÷G…DÈ…}Ã]jî,4L;Ó캄ŸËÀ§¨êôª4àK©¯uEáýÆ.—W¤¯d5Ö˜þCQ””p"H¶ç,H•ät¦-tÏ ȈÆd¢rÔÆs„dH‡n¿¡µ|;á[w6Œô ’1£6]ü̦ŽÔ#m;ÉhÒˆ±*6ˆôomyÖu‚eÅZÿ” °½«L¦‰w¼¾MîfýÂãm#¤™YÖQÝñ%Ø®ãíF_>«Ýå ED.ƒLõ˜ë¢6-JÀÔ ìçæp‡Ñ®¸MLò¹(Ö ÀK^¦KWêëÜ\.y¬ ;œ(Ì–©ÚÎ&ýð„x£®ÎR¹ïúÁ¥î—™!{ Çϵ(Od‹>Ýio¨ÁHÌSÖ"o^3²ˆ*]+B&e4ÅÐ<ÝVßF>®ï˪-bòz¦(ð¨al‹ëØ;Ïô¢GþHL#ñ‘ä[HJ⦥üm¸ñOíäãL’lòiÏHv7?~^GjåÁÒ¾BÍŠæû;lµLÝ·¤ËÀk#଑ŸGn§BŽ„ÈDaǃI&m‚3Iôz£­©þ–¨šç%ù"%áÂÕK6ßy5ð—œ0›D[\P•®ôO è"%Ü ºžÇvÞØ ˦e…*@®VcÝ]@Yº«0닱waÎ0–ðYf}LÔo+|z¢‰0íš½è²ÛìçM™Û@2¸QªúëUƒG“GÁ·ì×’kg;AÀçƒ3_[Eù™/A¶ÎGâÿj¯™O¨Gž÷Š{›È©—¼:óyË–:Žc4³öû•àøÎéâÞQT^¼ÒzÅ“NY ÍWà Á­˜ÔR𷋪£aßmªª•Ç÷•æÂÆú ŠðfºA¦ƒ‡Ñr=Áï8BRîÝ—ÕA½žŸìmÍ:rþ¥hæôH-'0/ÀôO±¸f«¢9>ô:ž7]»(²È¬{g—òEê¦_Š?ÛÐÐÃØY¡ÿÂÖë×!©§5‰ö£è—JŸ†×'+ô P½fÄÀuݹ±(##,3'f–ÉU TØ[ô‚+6ϘQ‰kµ¶(©—e J­a#ÚEJIò5܉5t²=$#§ÃÄo6B:Ë„¹6WhÍ_æk¢ :CHø¨´}?‚C7¡ ‡â›KŒ±¹º!p>³öœ¢:wÃÓ¨™4–2AÕ9=œœÖ£ÚÙá,.¨E®8¾~; ³Éƒº°J”§áwuk(4o×þØ™(ÿ†=#†në³iˆ®˜+:InsèÊ»EZŽ<™ƒC×”d) N#ÍnÁvë®áà¨ÏÖ7jj+oSÅ‹©4ažwSœ‘b÷a ûEê(,»Ç‘*ëpó}Ðé»û< pÈ}¡@”jÚf%}ÄãB•í%Aÿ}é)F¥ÄèC¿—ò„bƒ“FË)g#o겞™Ã»‰8A>ò6ë}v(ßÞ„#œ$eÃ6ïÆ]c‹ŽËtÉLÀúésȱá8 ÎÖƒ³A¤‡Q]ôz¨b©òÁL[eñcGç=©yWžòUsRÓë ØƒÂ3ÌÙ¿]ì‚÷–¦™VЇÑÑ‹¨qÌ ýVÅ´^öcäJ­r` ",%­‡(nTí}Bƒ/¯LK Åg›l4ä;ÿÂeèfáx0*o¢&fhˆBÊÓ!À_½I¤<‚‡ C¸%¼ílºÀ%.̓ÿ²à‚‡pÌ>gà AbÏOWP‘NK¦IVHž.p´râ©P.ñ„—`t-÷LõJ$™ÿ$á7ÝnèFR®µh È~Pba73c~ºß1¦Ç˜åÉTç˜qôVa™ywåœ>° ãFˆ^˜MTTÙ,š4“æ¯!c‡©Ô6ÎÞ¤¬ßÒоô‡¥ØjøÅ4G¦âa lîµJöÂvÔÒÞœBÆ”4¶ Ì0ÎÕx-,gTÄÑÔ›!lì˽š…Yì¦0—NæÁÈ IDȸ éÅ.òºÓç4ºt–à:ØùT(Çg*Æé´§ñ'{jr¾vhr€.ÛÝ üfø[k5²nïâ[Å%Å?BbŽÂõÞžç+x_ÌóúIðÓ_Ï1·ùm9ªß!EXá{(Ñ<í%¥ÀH®iC$ ²œ4îcö ó›:Œæ‰„d› ˜ÑrÑöMèž|ƒ—7®>ÑG"h P¤Ð ßäA”Ù­÷Nk~ö‹Î¥~Á'["¿T>ÞXNþdçnMÀÛ8-wÓV{ûZLàác+ 櫌+ÉטÉ1n$‚)äP5 ö¼Ä†ÉêÅ×Þ?4 -—-»wÌ}ÁAµDÔú<ûGØš¨~dÅ–¾üÄÍ{uw6æxç‚„Î]â!FÏäPÌ›½Îì°ëó­$¾Žå£³G$Þ+wÇÁÇÅojºŒ¬1ålM9Ø‘×.+“¨QHzZ°8e­›v=ÅkoŠTôÒ€,èLZþb+$¥­Ón×+׎žkðfƒ¦§Ô®î¤JùÏ®=ç‚èÅdŒÌnŠR‹|Q×q¨+ÆÏôƒGq°ùJmœ 3ù+(é ÎK<²Þ÷»†Éå&>l0\j‘9%à]z~o=ÊÇA Þ¤>Ö. 6¼þ¼»Øì›wª¸þtçTUËqw<“>¾&™ðt;&ŽÊ¤}ઓÝd2ê+Þ÷ël^íËGdè¬U¤Ó×t}ÜÚñ«· á M$3nƒMXeGg>¡þ`µ ɶDò;OhÚs_gÝœEôsêˆ:|â ZeX,HåçÄö{}i0ܤƇ9›hMG'^%t1Â’ÂO 5Û*æ¯õ4Ý/Ì@Qî\Ù{ÅòKÍ0Ï)µóvKÉòË¡®_ߟË3+žö²‰èNQ'>­Ž®÷AèX»½Õ3ßE"]`§ºäÊÍÚ?ù³3¡ßd­í™éTxòÃÓ9j@lw:Ûàîß6?U­Œ|Ý[óГŭ $tÆ3¢…#æ¬V¦KL”˜ Y‘ôºÜö9³Üã–<*Þµ²[ÓÕÜCþKmZ¾J£`i÷mW–"•"Ï?Á«4öèU5ÙüòV̯â­Ra1½¥ V‰wÃð†JovŠ ¸yKf óK))Ø&ÓY%75‰Ì3ü)¶;\ꓪ •UÞ{×Ã0cÒ~o€2Oy(G|þ`ˆ?ËÈݲ66’þ··{†èû³†'—„þ5@nXlM˜yž÷NV©7?ó©MxàÛMú¾ëù³»½‰…@¥ã¨+#Î|µèø˜iýoˆ;—ØÞX纓‰õ:²ñßqvÆ­M˜J_Öún`h¥4á’‰À¶á†%î9è¶£®˜Göª¸é °t¼àr³<0i«n):ólÔ¡{ŽuGj)Ðí¾.j:•lÕÓËr +çü„Ifðâ±ÙÎ??«Äzø wÞ%g5 ˜IsX+Þkf]Kþ`ûq@ßt¯ežzž7$'&F64ÿ°uéÂõ §Ó[(ä 1û³‰WpKœhü5è.Õ‹ÿs¢˜ÐcÑLÏ`/Ó|bíË&€óÒ%øù—‡RAÍ ¿;~ƒ!(r6÷õ!Y×¶œ7YVGc—óZ÷ÝŠ˜Ë(| /öÚá üäè£ cLľçz·$'Kº¬Ð*=»É)¹ ¾ö÷´‘DÊ©Îé‚FÏsï)åN(UÈJÿ<7uCÛÒÃXß,R"§¼s~gžÁÝ£Qn†Š@4:A¡ŒøÖ~‰ =Ú ÕÎ`™úœ÷À;„©›²®-y¤˜!”»Ûô¶’-:¡Ñè@mÚU +ÆÛG"|!kˆô›1–ìZ€º¦ ]:«R>BõÕsê¸  J’Ò°«µ×V¥^l™–ºË P´0ïÃáÀ´ɘ‚uXì ˆ}…/íîâ±+h¤˜d¬鹘vÍDõ¯ †×\Á@™Ú;óöV$^¶€UщƒÆ̆þà–m6 'ÓžrR c»’MÀ› v ócÃnïAO6†y>’QQ(B“Ï”.`’RÞô¢óbØÉ®éDÈ1öO?æp['ŒKðõx„?3L 1-,,L´`¿I#¼²@z‹À{ÃýøÀA1ñp¿Ê±‹¼˜Ü‹W?ŒLõ™$ë~ç™BX \*§°oŽ(ÛÔÂÏs³.†Nèõ–±¸w…»+‹ïÓDâ ˆ5–Y‘^w³gæÇ?C¶uµ_vå9<%J&\-Iý„*ì.î^¡Ðû<:+tÃp3± ºõÜEéAåý^@yÛŒNm—Ƶ­ížúG¼°9â|hL»ðø¬GÃõ`Ü(’V ä:¬2ÙZ „CŒƒÆÌIý(ŒÕåDz“Õðn9ó ŸÒOþòÕi#‘=]«²µ^-Ñ{‚[d@œ¯™ôðnwNL»Ê6 Èyvõ1ì¨wò¶üÉú"ÿ±ü£˜:O5½ž+—@8ëo#7´à!û×ȃzA” ¾áˆ­¸ÃWÀ Z Ý}§‘R±¿ïo¹ÖLÞ>žç ‘$þư ‘“ƒ9zwC¾FØJéDÒ·8û–š3à¨Ü²92e/„(V«?¬i²Ç¯T;f ó0f‹OŠ˜§;A»ìèOÔ)?RGQ –›¬µÐf1éë~YX¿ó¤×sß®Q ÿkz"ÿ™ØÆ(J»ôø0¤oŽ?[äñ¸3amçǼä‘û‚Ùr·³ãq¾Þsšü Œ…FëYVi5OcoäÓºŽÂê±=î :Çþwf£iÞMÁ(€Ö€BáÙþi³Xc}¥ÀÂÕ&ú¾>…áóÉ®úçÓ:³ ²é_¸d§ã~.֥Ϛ°ƒðý1*¼–n#»tÍð)Øc>¶¹Ëï*1vM‡†ݯ`=ÈÒƒæ\“JÙL®ëa:L¢ «x |@àêsHr·2é±·r½R¦…ؽTŸRN–šp8 †Ú¢“ 4¸œAöÝAsÖ¼ÎðמRÓU°hÇ©ôpÍÚ[¡&o54Õ»nýTMô²Ìˆ¼–^5"‚ÉR2æ'— J< ‹¶Gg¥-—H}z6ز²Å£Þû¯8†õ52xÜO¹´r€ >eÅ\2©Èìà Z gÇ©Ç%`™¯“2õ‰F#‡v—ÎjÊ•{ûÃÏc‚QK µuR'ë Tj9e÷*Õ‘Sø0e¼“o§Nñ èX|ž ªÜ?•>„—ÒY‹îƉÝBÀ£âÎS~„lÑ~ä`_úÞÔcÙ]Fådê?á¼üû:.j L¾`íª1ñžež:/øg’S½¬éÝ5=/»‰µ•`*(v•#–ܘ~ÁH;µe»Þ-øzÐUŽ ìq>žëä㳨L÷t˜¯gÇ¢#™úJ@Wårê˜ûéuÒ·'¢Ö4ÍxAû0€èhß«ùmx@¦.³gÙ'D0sƒbŸÎ3”ºMx·Å.äú[%ôÊ÷mw5Z&ñS =ÒÃõÒXr«œ)Îb¸phÀ+ Ò|u@L.#¬ÄÿÔ1¾+³ü-ÌnœÁÆ!œQl™?@.SÓóÔñðFŸ¼t= ZO”cÂÁ.'‡U² îµ`‰ëT»bRG¦—.ÚHhaB°Ö”¢Ê¼Vìß (½ØG1ùØ#ïë ÛÒ^B,#¥âYcvVOÝMjÞ£ü¬ÚtXnX-zÆtû—…KöÛÝûCȲmgâò©DzK™úl­ß:KHÆs#‹…ßwic†O½6f¹EüŸû$oç4Q€[^ûnó‡%"—Ž~xÔ›ÞEΊ©¯t¯Ï›‰*ëÝG ü% 7º¨/ à6¹3é·Â]d>ÿRÍ*ûÛèš ð¿M'Õâ*/ÉFRZž¦9……ó¥®ÜŒ©ÜY® ºƒ£Äý è*q¯C‡Û†p8ó%´HŒWþŽoŸ£†/²EÞ/ÄŠô}r–›ÊE[{~ 䬞ª?Kbd¨èËÄmpŨç"8# — ܬ´s¿† ç‘É ì&D4Ü5bâ<)¡äܤÿÒÅÇ#dxLíf¥˜jEàÙ†½Ñ@÷žLÞÛådzŽöºt•\´Çý¨× _~ïxâTöoÍõ2±µVTQf“½¨È´Z™it“ÍI‚Óg\vóêøä¤Z’Ü“˜Ý^ ´Ž`Fp|HÏ€z´tš‰ŠÑtŠa¶‹äžü)ï²×ŽCóoè‚ÑçðsôåÜ”D7í\hk¨ƒí¨w£A 7QºžÿÙò~1Ê’OÛÈ")#J±ÖR>?U”²#1«¹’²û€ôwžÛB)êýÐÃGp¨¢_ÀnºT&¨HÊûU9ñ¹w³¡À½â-°¨ù“À䯡/»`ÑÕÝå?læßD®~„úd0+nTätÿL÷5jøÌT3@õ¥=8³|% ë”&!*u]Äž*“[Áø†Í¥<‘Þ)FèäµÍv»V¥Óˆ[ù _‡È¯uœŠYy–¤/hDñuîy×Û$vÏÏxGßzG§|™"Ï ¢cz£¨4ß ´8@s—¶ç £_*.j¨«Ú_{Ïr<šHI{ ²:‰m6麲Kmž<Ž»)ÐtŒueV“[2I#uâ¬ÊŽQùQ…ÓÆ¾ûšòe©êΠʥIÇ6—'næßq=¨yr‰iÂ8ÙYAÙ­±2„ô€çXm›}&M›ÿ<…9®ŠD ÝŒ ½"Õ2Já"ްb5}U,m6ÜO(èȲ®FyHtÃ6¨÷J×âÍF!ü·Ü£¯š¾  m]ÿV г¥šÛ©ú”C‚­û¬ÄzW½5^[Æ«ZŒ;DšöX¤)/ ŽÌ6€F)Ç´˜z¬Ø²FÖ“é$û8ÿŠxºb:ÛZäh7‡b½Ôb™ˆŸwÀå´Î Ñ\âín 9k Ùë!ÞóÔë% ‡ÉF)zY´\Q}Ç ×U=zMú(ÿoQÖW{H#­­Ûê¬Ù#-ÍŒÈÅ»ïãB†®}¬,Œ©ƒÝ¨÷'…x¿ðÌL[êDÀ‚NAÛoiMéÒˆëz£T…ÎQmÖ[‘½n“`eºÐ(‰UÖz×l7ÿï“\ºáU`{3•â‡ÒqÕKžeÌÞax)á~™$a³ø×Kz«7&´zµ¾lü ŽpQ“|ù¥_aÅU{-ÌDÏèFÕ=³e;  ²EœyŽ\†]I˸ZþqAg]&³oÃJ^¥}©‚ìœìWÆn†ÑÑ…kô!)ÄÚ6‚„WJ[®óI¤:3CuBS]³ôf0öÑûýŠÆiÃìŒh×—¿™h±z#ù&üαà @iü"w {çâUîCÒ†æÃì–ß"7Ù¿Óøj—ñ™G»½Ï*pÈe‹H“ŠJú$x:UÚ×þFl¨-x»v£v!ÍÅ|/°ˆJÜôžCy «·ÍÒÊǶæ…Éy¸„èJ#²e;é)曣c7ªõvy}E´EФÞ7öy;½~bŸ [¹æKÔQuËMš šA­-ÊN=ù+ˆµÀI³8yöåSòÛ†Ç_”‡ GÆíÊ*5#[ãwØ”Cº~Bd1{.E²|r¿a fãfNÛÒÏXsî®7í&5Iž“äŽHBð»Á®œÊS¦)X8~a«ùºØ›šØðæ‚~ oþÓ«Alª® ÉKçòo`-ÃÉ=WtãÔ3) Ýq±D.ð»Ühð“[‹Ôãíþ³ ¿þ a›ÌvÈüO9a¿­5àMÕÂírÏÔl?m·²cLFžIÞ÷¢I"J|àoˆ=6Âôø'7ç¥èH9%†y7üñM˽6¯‘\8éËœa4AMŽ%½aئÚvËc“PáßܽŠ+Ð]·é:üt)áü7«µ— #Š?P×ꆃ}ñ¤.`óMœŠáîêGx•}¬†Ó¹lý”ðí[b…cÆn ›0‰c<Ê›¡|ö;ZLêW$å…FÝÖ%hÂÑ›£Š6{‘õÌ=,lÖóRæl³öýÔÖ˰a3Ôsœ|«ñR}USâb¥KüÃl²%B}•ç›}ϯ"\¯3Œ·ôA3޹.j8œê³Jø ”¬+ã5¬ÆÔÏ¥޶?²6o¾°#K+qiB33ŽÓmcdN Qsy˜Š7Š=,Ì6me(Áì#ÚÚ¸ŠQÆà(*"je^vVR¹éÝàuf7±,·¥Ë^"ÙTUì”?E½O~¿éÀEŽ$9ârÕ Æ ‰ÿˆ¼^¾jãôà0£ëÙ“‘‘ÁMG=nc#C¹'¢&­\u.˜âÛ:ûöäx÷ºÛ ”žÔ5ié¾ÀûÖÕK$%{ÃäºI–!ñ ®GÖ)TmÉš#M)¥s¹åµ|/A– lÐfº°œ„´ÚÌk0b¢Q¡åœ`¢—72³¤gÎæ¦W垉–“ÀÓsc§kwe§²Q¯”¼²»uP<êö¹J­:Á`dßå™ze^ò¯Ñ²n—½yËÉö…¥Â—/ÀÕ£´ñs)J·÷pR88 xQ{ãóú_ã ö È‹oܶBuôÛ•¼“5ËĵϽœï¥õ‚$r îô¦Jç½D¦Ö2”*Mù!ÀðÊäHG¸àµq¶`Èi%Äñ¹ß{,Ùn$–Úãû†aó®¯gÑY~Œk V£ò|Ÿ†ê\qwÇ´ÔÛç‘^LÑzZ»3ê…\£0Ó^ÃÈnloVöåéÆ8˜PÐå>ŽšL²¯¬c¡r"K‘¨Â[ÇfEÚ°ê&Yí>,b­°“£ö¯”IÀJßzck!“Þ†²?¶(xBˆˆ´MÓöà¡€ í£ãpo üÎ$w…X¾™¿Ô£]Íç@Y v®%g²…ÑG×gûÉtR² ­ %%(¶ž:çóUîuBO!úb‰ îLiŸó§æ²Ga¡Õvi;®a?]rÁáñä/ïÝ<`b>0<¬ózªøSIG×jïÀ2ßyòÖ…àlÌ€ú²"„ u“`«d]À,é½PƒÓÅ^šYha¤¥+u9Ÿ(ÌLCnLÅÜ\ØÇI¶;àc+;†*iuÀØüM4BŽg4«æ4|Fëx%Š®mö6kºÌ}¬ýÒ±£ÝÚfù¸«`R´uZÙ¼%ˆÞèC¢=€P}…ª Mد4‚N.­R<Œà¿iböMÊ3ë£]ˆú M£î¢8¬˜ >pïž…Gvë¸fæ\ŸÃv° þ¦T<ñƒÍž•<‘ÐJÚ@mˆÓ%`s¿"ÅZÔ9FzfF¤=ÿ‹RÚ ‚uÛ·ëÉÀ˰ÚJm@ªkõ5£¼í¿NÝÚ3H}ù,5ìÚjUÆýnð3–ö†Aª;|Q:Sµ3€óP ˜­Èf¸GXÖŽ˜” ‘ø¡°DL’öñïéNG©íà ð¥mï²¼ W«JÁ+o‚’l Ïþêy| IÑ×WÈ sÓ ^?â~Kn°vS[lYñÑÀ\*пäf&`¶Z;—4€¦8yXà pÌ?5wÅnÝ0ÄÏK†OÔ‹¶«—|óPpÉ#­fŸ¸{JG4cvŸÑ ít•à꺗íýéöÊgbú¡Ì:Úµx¹ÃÔ@&êDd ‚ˆ×“ÅŽnÎW=⃽.F{ä•ZæûR)ÀӗбŠü¹@Õ“ùmÄÌÆ_Ì‘nÝLv‡øB¦cÛXÐþzòrµí&âÝGÒÜCé¾pAæ5IÑÛKr!%qŒ”Uá,ÛLq¨ÿ§ªOK»YÚ£½Ø:ñGºN5ç«…ªˆÍú"²Ø YQXðæÌÆíC l• Vy2]ÿNÊ R"à=3&J–Í:;?ú ÌŸ‹¹Æar»õ(—öèÍY= WU*ª·8†6° Èòxx¤Ì‹ž¿µ Ë*æFÜ…ˆ{(*ú …FÔ‰¦?yrÃDë¾ÃªXÿ;Ç݃mLNÅ;çg;Çc‚mþmJ©²´Ð4[À›äžW/÷#°åwDa"„Òmpß¾#ã©ä#tÖ×®ÔêÔ-D$þÖd‰¾ÂKÕ½‘ñÅAÏè_¯f%^Ñî5³Q´AZbš€µPa(vùMÙçŽJ1ªùþ¦Ñü„¶NTŠy»æœ + †¯ ´ÊWgÀS­O÷á6öoäp`yÚÔZ˜yÕûîQˆ ÒÄtÛZ,Yìü×Xˆ_{‹Z¤pF!­-ßE®€XkD^1,|ë~[×] K&TÚ&Ù¢í‹rÑ.–Ÿ(…übî!]­«zÜÿ⯠œÛi‹¿ve/«dùSeV£¶/c¾v®.,ÊFéBÄöä—d6,é©Î³[’ìÄ^|aw»¢žž²µ1}~| ø"Nõäâ) ÃÛ£à°B€­<ÓAÝ…Pð$ß|$ýjÜ,a¸¨îÙPÜjI÷ÓS¬{²@Uos€*(4¿lË¥f5ö·—áöA—ý±›ÉÕQ#pdÃ…&bóe¦©&š‹DÀ—ˆk³£¯CôêF©Ñ¡ÕçÂ+ùõ%gYCvÔü’@%¬%}Uî=Èh‡öŽ<‡ÉbÛzÊxt7ŽH½vhu<èÈ~äŽÛí’]$ y##R‡D×ñ½JƒÆÇ.[G”bkEèÜÜÌjŒ¥þÓœ1oüÜŽ‘]á/Z¶3Œ¯ÔŠƒ¹vÜ“ßqó$´[1nÏ …—Ó˜­šJ3…'ÉÓE£ÒýMAâÕ&YÛo´ã…Xj€ÂÊñ„þü²Dq¾4ÚññµÀJÍó™þü)ÈRž½gVVÜúœÑ¿š™pLsI¶+ÍZœEk¹{z÷Ãÿò«•Âs¾xÇw¶.š×ØŠ‘Ê•g,ºsò‹ —]4t\ @Òª CZhÔ†5‘5†Æ;€l½_­²ÐBM,G‚üs˜É Ê'@¬©E#ÂÙÁ¾ î-™ä|+Ìé ȆW¡HEÙyL¢DÑšÕ]@ûþ7™M‚´Ÿõów§ÍïúgìÅ …æ-û0ðáž42©×ûš ¿,PÂ}Dyš‚ä§Ù´’oÔ&XzÑ$b½ß•æÇžAXUÍ: Ód®èüy#‹¶q†Ðïç@ÁWR0_^8.ÆóÉÛ=š‹³á™‘c”síЀ"­¼rV¯¤èìÂTB‹ÌkFoXž<îˆdïjì ó¹µx{ û]G»8ä‡{!h€!ã±@ ùMýÏy´©¼mgK vÕG^£¹ëººf–B•ËýGøÝ·[#ªuf°JîÃñ…ØÞ+pÑë9©ÄÎvÀGˆßîÍÇÕhm[c¡äM왵ۦD§'ç÷+]«®¬kÀ åS,GVyì® -!‹hlž-¾Þ¶½¢ÒQÇ,©múµŒA. ÝÞŒÿ*ózìA£3ŒíRÙ¹:+ÇhMB!ÿÝ D- 8³Õ r_7†v,î©p3áx‹„é#=ôû*Æ”¬L@ÑsF aFJ»R52y£Š³sV,Y;0Ó²ÐýBý5pÁ”¶é\ïî FE›í¦Œo"ËäßAŠ×¬ŽúËXI™ð@ÅNo´ÊÙV”"Åa»°0M´t¯õymJÔ$ÝaoŠá)^bÏ|´´ó®&ʵYˆJ¹|I}Ϻ•0zåã+«øª %!jü§Ó}yÝW–+¹3v¨Æl¨xÀžDñ>T½÷_çOR°Wà HK1tq¦7á~$7øÆïK/@>”$¬Cj.Ù¸Ÿ0î„“Ï÷¿çSô<®´›`õ”NX)ÂÄId©ÇDÞ`‰˜ø^ô›“ƒ+§Í킽Uãùþ‹ÐIÎ[û¿Û I…ô®*0´wf”õßÐNÞ2¸F9p4kû±†âÕN BTXÿ|2žÝ%G2ª}&%ñàÅm£mÞM8â24\d’¾ƒsAHvâ\O.ŠtOë]¿}¸u>Uº áÌ〠œ{ öÇ=¯'Èr‡ ÎSõ{>I2pÿÑWl¹•ªJýQð„Íue'ò¥a¾9³=jwþ¾óòNü˜»3ÄM®Ú!ÖK]ìäe•½xe]ÀOÇ¥~7WMúð/q3F€Jíve¬. %Dž,[_¿žs…“F1…ÜõëoëÊhKïû«¾²ðèT¬p·ÈÀ–Ñe0K¡ýgß|d¶½€Èšûæ±Ê:}綦šm+ <–í±€ø1ªDÜÓ\ÒŽRG]ÒwØþ1ñ¼uËÔî€,·'àö«šˆY¿üŽzîЪß.9ÃX 5 _~›å¯t ¯Ó½»y»så¾Ák@iª€±A´àÃÇêZ³ã›—cjÈa:› »Ùa0sU)®º–!¢ðåÃPfÚ>Áu"ÇÓOM=vVzT ³bXsËí„MÁ¨\n­!Pª@N-)éCuäÔšæØ>‘¬ÇVéa„ýZ|ñ»ààðÒõ“¤E§ºÇÉá^®ÿǽ‰ýi dÉJçWHc&–ÑŒ~lWf9lÿÇW´ø!Úœ s„U)>!ò€Åð²æ£bÔóá9µ¦]›A»gšÉßH\¼—fÉü‹æßæ?å&ºü¬ë²¸|q^©}˜';•œM”…wk• A(ö_¡=‚K)Ljn„eB; ½‡z“ÍdqZxìü•… ؘ¢¢Ws»u†\N¬ëí4B€œ×MRèSqÆÁrEíFW¥Syw± +¸£š¹¶q&œ—LÐãí˜H?»/Û0ì•ë¹….Ì~ˆÑDvÑÜûU/êZï °i nÜ_²Úc™Z i³%ƒKÛ&‡ë¯i›5£4ªBÞúÂÑ%”8ßêí:SóJ -שêZ0þÝíWƒ'>÷ gïQz$˜µS)µ³ *þl$²eÁâã6 æf^¬ô:†,”[îm2‚¯ +k‘ [? \ñ Eµ5 2ôóÇít¿¦£ì#åbƒÂE¶]â÷JõaŸ_ûˆm®)Mœ5bnNŽmE#- {9¥©[$ÛÑX¹!Q5?†h>Û}™ÚæïÑœE|¥7a?ËK%ôuµ©?+år*>DŽTí¼d£cS¦úØÎ¯$Z ®3†$ö·"Ȳ·à†C<òÛðQ03_´^*ÈÊëôhItM¯¦î‘Ä\œ€l´²–èrÅEX‚–r ï~TŒ5b/zëÀ Ü@Çl¹›JiÚjû“»)· -Zý…½¾8ÊX3ÈFP1ç~™$2?LÏÇ7ŠÅÙÌ. òÒ¹8ëd9D×[q?7:Ö–dÆAp AªÝˆ @Ìâô<|°ún°­ßÊ\ ~Nš(ÔisLÕñäb É]­Óã|_xü–@õî4jêuÅ=­Øú FŠgšoÑ/0ƒH,sÁãÇ­-ÄÀÝ!KvŠO¦¿àHü7 x:üza°jX¦NU¤Ÿ˜=LDàJó H°¼IjÕp8é³Ü š㬑êl  Ÿ 8)‡„`y•?>L‡ŠØnÌOØ®·‡âH ìZÎÝhcª‡âw@¤THK®(^jcQD<£º)ÄfÊs@Eû÷‘ËÁ‘²Àn ‘…ä´Þ¯1uÌ JéLLŸïKc†ÊtŒÚÚ¿:±P¤xö&‰Ø}4ó]æÜxÑýzW¸¹´Æ2ÁK'Ý8F?ÔÈ\,iÒÖê܈ՅˆZSx€³W%3MÅÆ<¬è}¨ÖÎqŒP„_-Úæ‡`[¾ÜÄÂòÝí(ɺW[q,‹a¹6‹)%Æoo²LÓ&¡Øeù”í@vZ 0ïØÁpj¼ÿ2æ(gûÈRÏíÇÖ·T›aÇ4øÕ‡²éDº¾‰Ü+E€û\SØçô)c®jý >)øÕHÄXW懟SÊÆ¹Ë–§&ÒxbÙH«'æ’y¢©EÊìé¶þJÞl«±Œ/Þ·Ú[ª%²wj¶*k0Ó©Ô1l– Ób‡?]£”XL¿—ÿZ²¶ôÀ=H#Xy·«±mwy¡4€“ wµ>9Iû,Ðu,+pˆ©ÝÅ/5eŠ6à×IyJ™7‡. :˜M‚¿m›vßoñ!àÙ÷˜ZÕüuÝŽ2øC›\=}5F¢—p¨ËøÓ½%"ï“XŽÆïÀå ÎRí"yù…_˜Óäåœ@«N™K§c4žAD›£àoó<õZ¿Ú±ù:W:œ$>Bx¤÷Q0¬be™cgË•/Y!==!j¨‰¶m’u4¤6BÈ†í¦—4®¬JE7æ­xzªí»ï„м5»U]CÎܰ¬z’+Žè¸ jÚb#× —D³—j«»rkåÎkœo=í×ë¹Ö¡ÉÓ^Q£,4V¿¼í]÷¸³k@“°©|§°ÆÙY»)ºÞ’²TÅRz4àmÔ©sÜþÚÁ1:‚ÿü~Ê÷Æg»¥ê!¡mõ õš–aëRb¹fq¸g`L Zåé'¯Ÿ3¦/€˜„™]p'hšRÒJ[ÅòXô`×A§éÓDÚà÷<ÝKšèPø3¶šéⓟ ‚Ÿ›¯[ÅÌ%›°ëˆÊ)_$ÚË ¡]0ᾞø.¹¼ÊØÕ}öé:°Þ´TbŽÒeN.Àµ‰@"SÅN?Ã6ÐdENí‹L7@ÄŸ¼2€i퓽F @P+ *[-lÒžÀý@ïgv&þpbCÎ"dóøÉ.ŠH/xšÙöZ‰@Åám»åîñ.åì¸c™ˆ÷Ë®Æ9’l2‰¯ÜžoÈ\½‘k4rãjadE‘DëÂU„_J¢C™†æ 8qD¸eñ4N³Ú‘XT³¦w!b®"D©eá)d©<ÛãÄÉ*èêI @w8리•sà‘ -: :¥I²}œ¥êëhW¿pW l]Š,÷m^@-Ó~* j@ñ…ÝuzßâkÅsß·öh;£Ñ…æõŠâhÏ>ÜgÌC#ípüt~n*ÐêSXj\™™2¡Gð»=3Kø<Ÿ ³õ¢e` ÁÁ%\¢¼Cj_öôÅUî97\É•z!pg®’ËcS~vòPûÊÓmßâˆc®|ΩÉÕÉ¿q]ÃÞR÷hbIÀhø±;¾šÊ­3)×Q˜çCÎÕ›¸hÔâeKF>ª‚wŽ•e5TqW' ŽŠ³L+Jž‚',øðÏuëIx¨ßÿe/¿§Êœ.h_((=sÑäsp×Ȉ=GM!Y@¬\ÖjéŒ$S«gLr÷-Ö°fv³¨`öH$¾‰Pº?N.ØýW‘.³›Œå±É ôšù‚ÔvúÀgö PéO8GÐtÏØfRÆ_HF{ŠïÝhUpöVZÃØáº~ àé“ Iq:Z)UU{CËÇ2ÚÈqHÔȵ{t3ß ¢Þ­Có—`3Z×ï5¬„RÇùJµ€šL cï ¿U¼?j^Z:ú „w‰@ÊѧªKã×0lh÷w¹ÛrõÀ-!‘Їv¯¯Ká7ÞIF!˜JM´›td1– ±%Št˜jªÎò ûÙme!FµyÅb(Ùöu‰«ùß®¾‹}ð4Öìí‘òØ#«‹¤ôa—†˜ÕùµÏ°sW[:ò3Z}p ðDmÛç¨b‰¸Ž¹|ÓBM–Uã,?8rí‹î±â Ó-="6 ká;QuMˆÄ}œ4#±à\ÝÌÄá Æ¤\¾_2Y°B¶bÇu6x`haIÚed=°ò’ŽÃ£SLäyh†,·ÊÈäëöL êÙ²Nþû界ÉR-O+ˆÓ9Ei‹ÃÛ¥žùŒ¡v€YÕ~`©ÓdzÉd¼éùme ßã¶4Q¿OvbyüÜ1ª» š±Ýß¿ZŽi t3èò«÷%=ðœkÆ™›°G.â1ð  "a>±©Xlj³oN£úðQgûaºÞbþ¾W§Çaˆ)ƃ´Jë7£›7_R3#X?8ï7–ê§¡¦× •+ù Zè29+„ƒÐH 1Ì2 ?™a±Có7𱂠!Ks«%Ø`+Ì‘%Fë<.WpK™ 6*ì[E€ùÛ5?†ÚZ–ŠU<¿Dmnv‰ d›'ÜÁéÖùО5]m¾Ýµ6až½Ž6úß’÷ ‹Ïî¹]9‡K©ã¾ç«.´—$”7‹BmIsË>šÏƒ¼ÒÏ„Gy¸ºÙjÃ9ä´~Ô ðMÖtÆ~¹“OC~w¹eitÖ'Ä)æt%0Ýqìï™Ú>ʵ©cæk Fz}â<ñÂß„ÉùÏf¨––œÉÞdÕ#<åÚTé"m¼i6^3‹!ï1ä͘~5c–ê˜Ê§VËrs^ýr„æDà:oMîŸ?(à΢žå-Ü×?½*XY&ñ‚›!,ªuj¥÷$¡z’a‚/³æX-Kªø­'~ßþo[¹-nÈØçµ^~‚B”¹Y­ƒ(ýhv23 Aë¿ç') ¨¡ZÑ:µÁïº×¢ùŠVlx…1&pˆ™§ÁZcLM‰?­v•ãÕ˜.N\ˆ/4t‡ó 8[Ëh“='ô!{M.†Äõ‡“s öUä„‹}_$A‚¤À©»“]“ZÀât´è=ô¦Øé¹D€J<’/®‘Ÿ±ÿèò}w: °º·ŠFWû#îŸgw«ÉÀ¶ç]œæ™Û¾ál^ pÂÌXAyS˜‡W9–}="ôÁãTþ‚†¹—”¹ü*Ìð¬ x±Tr?€©Y*G°æ«Yn€©sõ3xš²çÂÀø´µžÖ7‡¨†1/Z"ÇXè)Æ€,×`BŽt¹T ”«u· ëŽ~·gPasª© «l°Å ëèòÖ©×M>~§]™úçúZ²¿å:óË£Z\<ƒÌé•£'Pu´š% é‡×gÙ¢údézÇNJ*oÅ¿Sžüg$O0¼ÁD }œ…CÄËá7"âKîA¹ÔòE{ŒÂ~—…™vÀt€ö¬œ‹*‘ðÝú[ä ØÆh` y î¥2áÓÿ3 7Œ]’…+µ,\•¶€ACXÙ.ØsŒþè\:ö£áöÝGr‘ÑI7iEλÒE*çÌÆdL7¬“C°‹¹T”Ò¯ù•gK˜……à·ÿ&ëÔ$ºL&íÆ+&÷i¿íÝÇOT¼@혤ÜêÏwÊ9¶µïjåPG: á¸/]ý™ô>d%TßÈà˜Ú ÜÔ0T’rKð×ÑÕV¡oo£Š/y÷,^mƒ³=ˆRQÇ“N KŽð%Î:hCLKfM¹¸eçå%°ÞA´;OmÂtåÌ ¨ä{r¢j‰¦hIØA»…Œ"ÊÜPYD»6ñ’ÀpÒ]sY4Ò *ÛÒÓOÃy«—‚znÐߨv%érñTÇ,ƒXoQüU±ð¹ON…œJ;YÕ:¤J8'fhIZ|žËZ6n­sÍÏháhóÊTµ.ÜÍœÁt²]Ný˜Ï=¨×èGÖ5‘oN~5ë×wQ  š & §4ŒÍüy`œqߟ™âËEûu¸šË•€¤®¨êÅö #­ôlXƒ›íDXæ.’Ïo1?ÛdG®A«ê]ëç\W C]»[l#VÙ·x1*ÕåÇl •½‡@]Z–Æ?ØYAjÚ;ãbf®ŸGË/½EôÔåÔ t“"®¿Æ„´Êzºà<¥4O@)§eÛ=¢)þ–ØEésÅýév¨¸›©(làDl×171ƒƒÐ\3ïa×M)„† Çå,öhÝ@-IæÑö* Oë ØãðRT:´©(C"“Öë‡I-ww €€ŠÚ$“;8‚HäˆñvW0ÄÕ0í„ÍX 7=œJßï_¸z]?‚è( êS1£iì°î°-ö„¾ û,zeÇ€HÞô `x+,hsó´Çd'2+÷,þgÑì&±cÛ‰{çÂÈ‚€auT¬ÖRCñûùòÅÓ‘&JëɶţLÎnÐÅÿäÛš'`ºDéÍ…¶ýõ“‰ ¯ɤG(þÇd7‘6™ –çÚøUÌtÙko ¡„vçð´ ˆ9{om,§+¤ÄØôÐþ­vi¯U*kì–»|Ü™Ô~H§Ð óÍiõÝ€ª›‚"ó¯røûê0éäh>9)ºe>k¬ÊZý<%œÐ+w_8Žv*5 /7µiN“Ù„ÉM80ÄóíTñÞÎÚÒ²þÓñ8ÏuÑ:䀪÷èÄ×oE^}Uf¬d¨brQû¤ĸLHý3ZãvS?qãÛ>)~QÈêO i9ø…Ïf6"¯B…ôø;Ý'î£[2ƒf‹¯nÚ`b‰p<ÿj4jƒžWMWÍ÷™0³Õv¡Nmyº \æ)Ô(R2õ·çª+ÅÂ,Ø…çþÉ\'¡Rå×íp½è©Ž×Ø©§(¯! c>Ä"Гóâ~ÿއ’·ÑÝsnŒDŸDˆ„=î6/‚äçþ€žØD –…ä6?sÆÄ…I—uFˆ|³øÀj(xï1PåR¦Ay‰ùNk ¦žD×Ãl¢v"¿.¬:þ—Íx³—yßÔÙÂbÜ’+|ƒ‚2𼑼Äã3Z|í êXnÓ¢s«¶·ÌÃìP§H¾vÁô}9BÎ}äJS¯¶iö‹ö ÂO)ú†H»‡ÀrFÁPÔ¾.ÔËv1.#õ^;8LS“ãY¡ZâÜÐCš]özÚõk^|G’ïïœŠëø°åCnq5sÛùüç%!ë3ÂñC-ºx”e*–¦JUߘ]èwç"©fš6L wãèo…£`õr–qß™¶¯}b;á´Ü€¯OìÒ˜º‚ÍñNg·0æ$žU4øŒãà)tJ¦Þû†Õa·{~§yE4Ëñç×=±ò@Õ~T) ÷ÎÉCAçLŠáê› äg֤ˤWý9:¼HgÁ0¸ð¤ÆÍLz÷§§IÝ©6‘e£8ó=ìþföŠ6„ BÔx¡•!çZ'×W‡w¿/yS ‚¼[¡–nÍ_Ÿ_»±3*)ûB˛׸¶"i”¿š+Ó?P °Zõ GÕׯV$]xY`‰ºm/]üÞ/È<'MEM÷ò+›l¢•Í yÚÕÞv“,Yj#’q¸]1»saÓÿf5ýùëŒñ;8ê}‘#Ó½ú]ïº ¶“ŽÁ(L n¶ïï¾ ®{ÎsÕ¹iyá–ô´ºü²DXo¼-›ÚËFÏ—g•óûiçïh¿oW©Ò¡¸Ü'.vp-G32ψOmÀv'fæ/ŸÔíøwt,ܬ¸œ©^U¢­ðô<ÖT¼ñûëðvŒ³ NG¨u.¡^³2ý ]eFÕWRù'¦ÐüÑßÝöšO$r¯£åŒ{#îÚs{ê§ ´•(I jâ*H¡6¾[ Å-ER:ËNXÒ¯¶Ô%Õ=Q\v’0(wŠ4iBeš7«£âiÑ'È&3ºúbéÙçVpÿ ÑÀ ˜¬Ÿ _MV› ×$ÏÃg´§÷ËãÄžHœ‚ pßàr`ø)c]Ù@c mâu¥×¡ì¯ú^ˆ§D%ѹH6æÂ³'y k‚lœzŽý¼É ‘R-ÛY¢ϧ–¤\·¥Q>}Òªä‚ÅûÃñ7Òæn+›˜nÊcÐmã¬lôép^2 +¾Â¿3¿¼|Þ߆Ûõ ‚ s9yGËäÏe_WŽyŽ‚»ËäÐzÎôºZ@® M$‹¾{6 Ûž;‘ƒ–käT‚ê9µBÃû)+…b\ú|,êxXæÉ'¯oHŠßÇfâ›®bm{¶åˆçÂp¾0`¾œA©1P¶Éø¼%’Ó t ³³* áݯ€^í´$â`:%«Ë&{S÷|¯ ¼ÅÏ_ÂimA"ièš²¸ÓóF=Ù ‰ù'žu>hŸ9áž|–p×JÞ $H>ØÕÔVDÇé¿‘JOØsZ[mAq¾s®ßÀMžŒÆ BL$(ùšðõ¿5ÄÅà¢A§qýÊ>Î~¤?hò AyL’·G<Õ, ø´bo(0™à‘¨Ñ+È‚°.Åê»Å9ßaØŠUÝ?¦$oiè+§þØTHiã$Êô‡§zÚº sfÇÄÔíÊ  èƒ$u{m¸ðïþd¬èÂÅh«fH(ÂZ\ò²Ëï¿;Óe£Îür±;%ÔµƒË[–ð?Õ)×Å(¾Ä«¶"÷Øê•µ_š; ½”qˆýz{ü]mšWLù%>€ÎíãÍë„$cTu•önã›~dµJ×#DU/"U\\‘ì“×ÌÚ@‰Ÿ·J¥T÷õ…Bj{…ñ_Å‘ßÇy¬NògŽÙœaÌ(<Î-ÄÄi(¿ê—ujö~Á³?ÙPŠ*Kïÿð4vCª{+±ëغQàÜ7rRÇÜJgF¨}œZ]犔 Á,vWÚˆ·Ž.îØ{…ÑFI¾6¡\“ÂåLÈQJ}¾-SلКÓ!o… éok®i‰ÛF°1©QÚ´ !ÊÁa¼ëÎ2O&Ž\Ñ®h'í‡Ljy˜Si]ÅrG[Ÿ®YµÄ^5{ò}j&=5u• ßkj«vÎÔªG+îP¾ÈïÎCS+(CÀ^*)E»­#'Ö 7¢‹[(ÕáÐÐ{ð÷I@Ì@ï‡#ig!Çšyh*á²™uZ±\Z×ÀøE1T`Æ*a°ÍÅüK›æºë¬TdûÒÖ¢Ø –AtF\‰…Ì Š™®¨@´Œ”»…çBþâøYÑ>ׯÁdðS0C ÷0 Ç–nè(V¢”#Û¢xOKµ—„U˜o‘žˆƒñ¥ŠNß,ûj¤Ët k”MøHa“ü˜±ö:J«qëÐÑŽ½xãêfŠïúðîXÿµIñ”Ô¸Óï컄â^Öõ:såùMô#ùÓg”¤…8¡9Ó"$‹±ÝîÀE¾ê·¶ÊÕÔm²K¾–²œ.«éÒÛ}Ñö¬‘¯Ò¬ëh»³æ¦ªPPh4Æ7VFSNÏ\®cç0ê‘ÔÔóÄ”¿5cçp+9ëCŸéóW¿ªve[CUË## –bŸlª »Ç"Aw¶Ôl€)ùÚF…±bÁ)¦”¼H;ÆsTývø~ŠyH°S;RÿSñÚw «q,é-̳ÒþÀŠñãÊu£Å+Åjûóo_¤µGO>Ðmù°ü¼°ã–GdàßêE\¢”žñùâ=þXÉþŠRVÌìý¨ôhæT5hÌÅl võ4s½@©›U_¸˜¢û¾ßq3yÛ?律ËANÏOA]«rlS°œ«tžúIòX÷†%ít.Úr®ñ!ìoÓ ·dØ[Kv´˜ˆ_yÀíq¯ƒ{äá–òi”§8Ï—'‘ˆÞŨÆ9Ñ(HÑŽŸRâ¨93P_µä®ï®ß—„Ú)¶Âô]P“—…¬.ñÝ­‚ rß -gpÌ WZ€QJé5¨Äúa;2~¶¯äÍ:Râ×éÌï?ŒæZªqôÎIö|r€ò­—J»5ÐÏÇbNŽ .{v²Ó®ŠÙR ê§šÔ—dÄ_1>™‰=ûl² ˜¡B_»ðãí(-bQ„ß&Íœ¿^žVçü0}Àr™uÏ\#™¸"ŽúÁltÀðǵж|ãM]{ñÁ(µ zÈñ1»u)k*irߌì¢(&ú«©Cê,T% {lKG¶ìk¥¼Î6F×¼H¡.„‡»Ýˆ¬hÇŸÍ¢}®zxæc×îlÇe1%Ô˜Rm%yÆõ©€æqkTC?RÔ¼ø]@]¸ùB)tNÍN@Z¾@_:…>#  VenßYt·5Æ _"sƒ‰iÞ%"vXû1aYï8T‚‹ºŠ'Å›ì³Û.|(¥¥ÕM tZí¡j\´ J¡¸Üx·Í2¢@<®ÒñxÓs‹5’o0ະ–è‚3-×&IÒ":¨ïk°vTH§Û ˆpûÓðK@ö•»¿©C™BSjGÜ’µ’9s°GIM•Aá] ¬ën¤õ›ÛêϸŒNwXØ÷ðg”‡5HG˜ëØ5rCŒãÍë©7›z]ÕA4÷s8ЇíÙ¥;2Øn›¨|ŒD‡3…!`3~nñø\2Ÿ­¡×¹Ä0R$ÉÄ4Ž&ݬçá¢â;§kÏÐn_ç'p>'áFÛ\mà†y7Àç ¶ËÀõœàvˆFîy‚žNK}kæNÍI8ׇT/»_] 1fÖ,ˆ€Õ‘»ºN2ÜT_çÓÊ^ssWÂèÓ‹ ÷É^ÝWàÿ^Êh^`Tl·¼¸‚Ç¡·*õþʼvÑ”}ƃvÄæÕÊ™^Š Í½ ” 3j9&³¬1Ê[lJ>ζF{ œéÉH³ˆùB_{¼û]Jÿ‘²–­Zúå2HëûÔ"±G{ÖÊjñ—C™žNhzÙs#”ÚïZ¶ ælY—F’¢þݼOXP2iŽ‚£rM90….A±Í†´cL‘ïbRK|³ÎŽô¹ÝΜ6œ6‰èEc¡Fâ‘1‡©¢ôì¨ɵæÀë)w«²AݺÁd*jè4•Å5ÅíÙ¿“žõ ?âfxuI5êù›˜Mp£ÎËã(ZÇTÖªØj”Rœ•ÃøÒSRFŸçáD¯„\‘úŸøÔCÓ§Ó$Ô”’]Â?DKh ⿞ùS‘E³‘‘¢WëÝx¸Ñ¼8Vú}Qéõ Ú ²¾ì0‡"aW˜•ɶ@s”j“rßÞ®ÚSPö»_–—çöm×û¶C  Qž­8ͪû•ËhÌÊ@Ôñ©ÏúxQš\Ä2…åÂÅä®Aq+©ãª› O{Ê-+î «_Yì‡OÀgW›ƒÈ±7¹ŽÕlá™’§bì°tÀéP>2¦è0ãÚo¯¥ÖêŠôßBüùãm\V'­)]ÿ|W¸Íp˜rI€uSøLL2UÏÏæ_ß>_CÆ~µýѲe®EFžØ¹*•L;&@=:+½èRÁ–nàš¨C4/–MÌÖ[ú±iÄQ³å™~ÄÒ>HxáŸòhæñ@óònkqÄF“³&~™,ó‰À­7•¤7zJ7––`™§,I'%ƒ'qküæq⇮c‹X¸ÐäT— ŸÅ,‡4™çZÝÑ3Bôfâ«únN‘y#·>K¤dô?<‘ô–ž-ÏW,iÙz,4õš‰4 §¯ŽŠD¥OŒiξ—?‡Âc¶SsȪ¯VI}´ÚD [Û»š¸þ>ì-'sÖõãpšÝjÌS®ÜyøX[4Ì̵µ}Ù ‡r\„¼çUWœØêÙhm½‰E.D †0õ ä4 kkýû ™ϰI·‘ü 'îï$—‰Ó¡§˜¬‘“*3ƒq¯ Ø‹6Ÿø—öYéévK Sè ?ȇk'©6r±ð€ ¡‰`°¯"CeÖo9éNŸo¬ú‘aÞröb>â ¹-MÚšý›â¼Lœa&Jb8îÃë.’½“²ãZ¨Äæ;íºŸN=õR–uÕ?ÿaXLG¨{~ú4ÒÇ1oãt<$‹$=rU“«J†+#µ?Q¹ç¾pÃ_9<™í¯Â¿ËÏf§Jc&’• Ëö÷%™ÏÙNÀ¦ße4äZ¶¶7ø 8yw#{5Ɖ{C–) T}C—²ÚxÄ=Y–Z% ’ÙDX–*1KûÚœ+ÿË—©‰¿C7(º<@/4Yå¢4Tw9.ñž..L/l#i¢YIWí·ÆizJ½o¸wìCW6Š­s)6ðBt¬É K%¥ÁÔ£§¬4O 9Ö\ ½.ŽÆ¦¤WÄ`aSÉý”¥Šr@KjÑVæ ·Êz7ÆMY'+µ9ìP3jÈÕ8y‚§[1ÑD‚‹é•ªÌv×wQ‡еèkL—ŸÉUb1jb»Èû—Õâ…®?áÄÉL;Ÿn q÷Õœ"kúæòOÃ$h­fUfö<'[+'ã¶œ;Æ¢'ã€àÚÆ(æ;FB:›òJXW¬’”´ñÚo ÁU¿ÊH6ñMWð.ÇÜ`A>_/-;û_Hͳç:‡_t•_h¹¾nO€}~¢ÀûD™¶ãÍSEG gÓ>´^vƒ›SØÈ¥_W03¯0ƒ1v" õ±Dø?[ËiÙSSni(8%ÙFûÛØLlœ±±OÍ$`ÙÙ-ìîBÝ#€àîDIƒ2¦*i„¹z¥ws½­bºF*y påq_³/ГК,jÚVãLö/!ýÆ£?r®½”î“Óº˜0"’ÊðwbÏ¡œÙ?azßmK©Ih‡Ï©û£E.˜µ3/±ÐAñNvïÓП•ÜæEVg»f7©ÝQ{ @“n~„–­ðCüšúyL¼$?Å|j·MF|²»b-ðuá{ªÉïÊn2{…ô”GCSñ¼Ë¹6¾dÔ3òPÀú—›„N‚_ʶ /2•q p];­½“Bhòx[L °îÒÑfn¦ŠE°3䲉W/eßà¼îµ€«mµå7á]êõq:‹ ŠZU¥âÅ¿©fòeSœ5ÚUêÕv:cÈ.JSÑJ‚`ùb¤ÎT•´ì µƒ‹lF2ª–hRÀñáFàx]M ]J½YI®s?…TŽþ0óÓpÊ*–l­øš)~=H¥HIˆ9RQ×ý]ˆ½,›âˆ+¨@FŽª±ukh àÚ6Ýêã7df±2P39èáx€LˆuOšî1àuÌâø3†âM7^,þGWµéÖu«ÞÖAÇ¡uþ«ÞÇ[Àƒ%»±ôjZ>è܈•ñx‰l¯ w#u²!DØ,õÐò¨N®|¥½ ~ *ÓP§¯)\ÎR 1úQÑ¿îò#«§âËøõ“N“:­\E}Ãx´×b7ºv|³ Á3 ‹Zè²wÆZ  Þìˆç€ú•‡ÝÂåz_\-Œ““—ÛÈ›ÎëÂ%=¨fŽÒA{„$vÀ@©'*ST‡c}uñ·Èã2(áäµWÚ#éëdkùÃ[]¢è‰úœ 4iÂSçÔkø¦(ýâ†*¥I¸ð0ÖØ~M¢îNÔ$l ^«k˜»!@ZÙÌ^§¶þõŽÈæg m_9²ÜVȰÃ#|K÷­fšf­›šo^&ª¶ô} 'Ø^!:FvP7î’Þ¸8ȯ‚úÞ=@rŸ‹ kÉCˆ½ÕÄöcCG˜³|gÜg¶`7åÉ`Bx|61é2ôVcj›UÒˆ%_ùsÅŽÅ‘öHXã^jžOª”öáX€K'æR0Äeªàâ ñÊi °†H–t¿qñlä‚fa\ôÊõÊ‚ch§ùÜÉú›Ëë&2¡…Åå“•€†?ô’êT¾Û-âVþòV•L ÚÂýhPVg ß4‘Õâ}Í88Ò&Þiö†Â4«ˆŽ0p ,„hÂ;FîÛɼÏ?­Ìã.R›¾l°%Méy†Yð®î„Ö’ûKúŽ.O¹&ü'B¦n¯È'™qk'üè“¡K†l@zÓ¶‹¸dp³õRDœRWÁТ3|5•vÊsºpBM Ãzr.óíZ·ÊÞÉU¼úb)ì÷@\lhîNÑñ]<óq8ÏÒYšèõ(à Õ!$E}\Ân0ÙÜÊQb÷¦,ñ•›(@óò)·y<øÀåNDøT²8øÁ¤‰M…ñøXTï#è!G[áP+Ù†Š`Úb"ö¶Fñsùs§VæÓÆÉ^mXu±©\²Rqòˆt8Á¡šƒþš “¶êV2¹LkyØ 5yŒ}fÏ»¿`µ„ÀW¾†a·…õññ;˜,ö,r…C ²Lì ] ZŠp¶¶Iʹþ¤WIÔ8ÓFÁÊ™ŠÖSV+â’o<Ðç5SÆ“¬‡DN¿j`‰°…ñK†TEA$ñ’Ù¨Z"Ñg†ÌéÒúdn­œéZŽ@ý[©T;¯ñ˜M§¾ma-Lóq ‘ìÉ\¶ªõ€ÅY’j”güÄ8lcmlµâe,¤lU-ó“lߢ)zV?÷!ã„F Ñ­jˆÊk ÛB7)­ÿvgº*¡ÞÔIEdÀ‘÷ƒ¬‡ökkßØË¶òn©„èKޤSöMJït*¾xâ½û=8ðÛ´®òD!éR¨Ÿ¬o‘R„;]ÓYzü!âxÃ-ÓoÇØp(7ÄÒåHað(aTùI¾à`ôLyÞÜc Ö#ž‹+ÍÑ"ÒhP4„Ù¼¤Î êwƒÓ²8$„ ÇØ,Y¿Çá=p[Äï#àÖ¶LöÈŠ€ˆ`Ðù8ñ¨äycqsR™ÿ·æªÛÞBíþ ÉŸ"\ã%Sù={½ª„8œkÚGí]ÄÆ¥ãRÒ{Üš¹V¬Y%LjV·k/.ž¤+y î5¡‚:Î/izÆaáiÐz«F†x½–‹†@lQB¿¸ Ü%×çSÂóýÐ^LRZX¦ÇÝ;1œz {cÀØøëÜ\x¾ ãG_¼h wóðr;<í‹ 6Ç‚áT¼Àª¸_ÍòœÁòÆÉÀa¼·"­»?ÎÍô!è¯Ó`o`¹Š“6+æ\Á|ÿ»Ú»i½+ë(“Âì@Ð7›­xª£½Q[;:Ü9¾¥NxJâTáp6VgëVÓŠ‹/ƒÄŠþvŠÔtg Á×)+ŒBsä%’«MRqo§ß庆6üšó$od;’µ§²Æ˜þ÷w%*.mBÐ7í£´•¢*@óTŸ÷Íg³iSŠ?°à†ŽjºÞêá¾Õ›$“¨—…çtyþQþt¤ödNðÌ‹v¯3kÞå¸;ÍÕ±«e¼äa•BÊMèà¤x⯣2ª%Ñêñ¼…‹cji`æ U#7x !)³ÙC¤Œy×ÅI¿7ï†[ˆÖ–½å*ÐoxLx®Ké L3«Ée‹*1dÉ“™¬G8ÿÈS®”ïÿÇr%Y±2q·÷­Zm7C‘Öl·ö%yï\j¸8V²vÐßJ9ˉk¦DBz‘«œìÿLÿvàV¸ÊJþ(×SA× ²Úßwñõ§”6ó_©q—ªp/vF:ZZd|S§»û2kï3®ýyLM—Àc^ØÆ ù] `Ê}ŸeÊõ\ Ú8à\Q,åv½gàÈ1q@R°OŸP*\F>Y7Ibzø]+ºHžî}ÈÜN½×‰4¥°” ¬þ· ú1 -5âòÂaMóÐ=¼çãÁL³ž%Ä_ÿ‘ìZ¦ Æölx+I‚$‡a¶k¹µkŸ"Œ‚žHyÕ(rx»œo¶%žh,ŽŒ0 p2øCÊÜè¢þ#äÅ|EMø0gÆ c‘pO%é½jPH9gÈ}¤i4]L ¤Þk}Œ' ÊÀæ6‚Q¢–Å]†„ö‘zƒf¹àS…Ld;á?¤Z$¬lêAfŸÝþOéZ’ɯ XçÜ–§²èr£·«—ƒqkª™…¼m“l"k6` 儎€RåMu8H¬ú{GwcB<˜À‘@(dÝŽ’:­3ÙY€aÜ Üy+QRÊM+ë‚™~u‚ä¡X-ÐäÔÖ¡ T;…)gx¢†âeÅÿ$T¸J퉂oÖûmñ Ç %hœhùl«[lÉ·ŽtqÍìß±a“;„‹8-"SÏeôX•,'“¾„9—o9¼øý°ÍîÅs—¤s+×ò‡ÜˆÅH²Ž¢}¹¨ˆ_’K˜«ëgþf΀²é%Bxý dz¦‰J’Yž¤A¼ÛÃV±Ád|ð7úÃ]{z£øëy(Âl‘Ù§ƒ&ùjJS›ò‹ê_éüzžŠwÑ‘G—çÑ_£ßú¼2¿MÙG “ŒÎ–4Boõy¬”bÀDþn@Hò¢|×iÄ_ñû{.ÖT#ÖKSÅÓÔ$Q³ëËÛÞ{¾ ”™¹Oœ`ºº9HþsOdí©ÕjÑ4Ý ›a ‡ÌšŠ¿|ŸœîkáK_ò9« /èv…Sh;©€à³©dˆ2$E†îÔsÁùa$ùnŽÍ$t¼HÞZ 3‘^V¨oí¾šÙb”mòŽN.>räòž5«†ÛÑÖ@MM_¦0Ôgy-'Ø[;¡Ì=cÚšùóŠÏUI~5ÊHσCÜAÖ¹±/çO¤нÅû›Ì~Òß”»^¥kz~æ-»-‡_"UôWÑCõ‡?ÆÉ—#$°D‹ýbMl=©ë*=ßúÝD¾ºEe¤ô2Ö34*WLR™3Ó¨¿pT2锉zrwÊV²ó¨7íc ÝÛÌݵ+Õúyµ•ö÷ÞŠnèá"EåÑM{Ò•y8…1Œç?O-þDFs&^$}$ÜNIŒžQýЧ©Š‰5Å;šK¨Ø@ «‹ò [½‚ܲE³$z'§ZuÕÂ[4ÅÔØ‹ô‰õ_`?LqË“æ/½ó6þ>™GØ1— ïÂ)l{䋹!_Ô ZÓ«\ΖÁfcccþ‰„•x½œÞÔÁ|2)ˆþàà°é÷Ô›ÙÒ*HJ¿jÍ^³Åû Ûžaä^± êÐ=FÅI»·„DFgÑHVòÍÄ0+Š^xê œz3Š’¿{㢹þi݈ ŽÐýõÙÚª®£ÅŽ)ƒzœŽÜ–w…ec̾þ4\ÍE] ÞÃRG]5(àQó«Ê×U¤”`×ßùͤf‚«!Ø<½Ú5¾N²èåi+ÀmùªíDï6:28T,1p4Öäéßæ>¯£a§=¸¼¤”ÍE\,ÓFQriìàGÇv~ÁÁJðµ½ØÌ­O‹]Ö^ÄÏs9xhd·{›:# ÓøS5–0¼ª]%ÊP3Ç/6–.ÚDX•܆[û0¥ZÓ‚£í²|õãdãg ‡Ñ e°$¬6‹W‰âð.à©»ç4ó^‹•§Êzcêè´ø‡qv}± è?טŠIUF n)0GèîßëTDý©¢:±qmãnØõ]š†± §Ôo?S¬‘“àâ»üÀð¢Z›uvµ^ƒÉ.-2®å­Ù(ídÙþ®‰Àrwe®E +!(5÷"³½%bYÖÍ›¶$„Ð2d%ËŽoFãdî×A.”©CsÚÊ…6X Q) ®ÍlóòÓ6‹°"\ǰ6ÝÜ‚¼r¨c1Ú;|ŒØ «8.PH€]HÌ]}BÕ²`‹ûq‹3r¤Õ»qòìÐohéÔx ×¶•cO=`ÿYß4µÑ ö/Ydò5Sæô IÁÅjíƒCù°D,vþ™‹ÉMÐÚß ûg ÚLcKÜ‚,D~b²W<›¾ÔÃ6b-Vïp6ýtiqGJ2p@÷í6…ÆT@w[ç{“z+¤›ÖžiÛÜžS$ö·)¿ßY6-%Ÿ*éKãNOÅŸ3ñjmîâ/À”pÍ÷‹,>eh#v nL[_`%åÍOÚ QCbmͽ£$Фsï®ê]¨ço`(…Ë>ÚÈØÄÃùÀh𫣂Ů<7ªí_&Ѹ¶®Nõ¥¹®¸Yᛩ!W(Xø„Jv·3¿Éq㋦ÝÛ¬lm¢«“¡ Š'ðBÚMö6üNçÂü»qZygqs}~ÞáTö¢]˰„­é³…OÅËk¹²±A…éQ‘×û•'*ØQQÌQ(6W’\‹Ñ}ºš9öœòÊÃ…™æ…ÝKÈÞßT.µX²hŒÓm=…¯LîŽJÄG“êâ[”µ ãÐ.EgÄÌ®’Ö›+cŸµ´†€Òq\¹±çŒL÷†~6™;ƒ^œ¡U»ØðÅhí0ø^«x–¾×áPŽ6W,¼æ(#‹¦Nqôp¼øE’Ÿ°!ºû¾¥I[èaÍ`ò+ŽØp%Õïøú¼$"Óåq/Âë …'º²„æÝfµ1ø{Öçœ!ÜkÊkîùVʱäÆÕHìû(ÂæŠá_ÿ:önÜs€¡VozŒÑÓž‹ÓìÞ0×R!fƒ·qéßD5DšlÑ= ~ë5'æÙV¯…ú.QÂÇ ÔèdX-ôI ù¯T[q˜¹Œ«1³ç+’ð¬¸B!"ìoÂÀÒÌPƒBŸŽ»¸¹Þ‹Î…‘<þ8‰¦l¡‰Ò¡Fg¡Tš¿Ž©I-¿»™Ðe>XùàVô/!“9PX›Œ£Ë³õd\°ÇÊdÛNKsÏÞkíVŸ#4¤ ÆþnÀßæ\¦P rõ¯ÇòÕH¢±·p—Q[,ëÌAzßVœí™ªöo,õÜúÕñ„À®½Ì«]O’eÔÅQ[ ¶{g«üŽºÈâÆîÀ 77 ÙNŽUÊa!H C……IÕI㽜9Í&}n‡)C×÷MõövzW#«âž§|gõØÌ|7ÝÌÙ ÒÆ/VÀ ÅÁ[ÄÐ$EÄ—mÙGé§lQ³\ÙUhåiæ“ÚÁÞÄ üÐãd$”ý§†1,#¢ VÔ7ÚvÑZs=óýüÓi¼Lš“È FØ#a%³“ˆŽg‚–7ž«é`ÍåkŒê·°´ ›?q)›îvî 8Ôû/z+d´ÊˆwŸCr"VãŸô‰e•sâ`Fb?]À€p®¿â2XÁuÐ0\4b­Üøã™ù:%f, œ‚ÝÜ•ÜAM£[Ô–]¢§Nqv¤?ÏÕ‘eô<Æ4#W PXìê.ضUJÕõ¿ÔËé៛uì!>’ÕjÇÁêÊ*Rï} ¡ý*‹ãä.ôЇ¶p ÚšèÅøň_”î(-)„Ö<Ùo%¢Ùö†ù¼nß;ò° üsÐNlXUGˆ²rp– U¯9¦ž¦Fε ×ù1hÕýlÆ™ À‹3´™hÔ?ѵȹ|–ÊÞh•ýGQíoôTâÞÁh(iÕPu”âØ;éÒùí^(|OšØåÙ5»¿ e½¢}Ù3‡Âe5æ)ú!nG䨖¾”å8œÎEé]Îñt„Ɇ (c ô©\¤«Ã_½U°Ý["Ífz‚y˜JÍL—ÛùdóÙ7fôÏê«.ôºÜøa-Òv}<&¡wîïSâÀ^Ö-Õ&’Ðà3~l#?ë‹Å<ÓÑBî°+ Ÿ‰Iw¨X¼‡¹«Ì?(<þŽh¢aÕêX%½ïûÚŒÛÔj†þw _S#EK-ažå˜ÎiŠž'Iúw?UÍK1£¼iYº}k3dö@Ö`$fÒ&*;N Újúü? T¢µ àÀØEe)ªì¤ªãµ¯¨kgS¸ŸÚx÷©ÖK#!ɦi|<®¡xé3ssɈ¡k‘"î„QòâÚqÅ‚úXâ!nÍYo]À«aqýþäI5èÊÕ:4Žx:¨~~ˆ¡«M^å Ñ÷=ék¨“©Z’Ú²/­2*¯ÁËbì“d#pQ&¦IaÎ'êöüƒÂÓ=Z9 !;W›"Ó ‡}McÑF×wkÆJЖ‚Q:”¾I,¯½˜ríó®h\äôô._a¿Aćß+LêÓú%8Ãï ë{CÇjLËŠËA:Y“˜Ÿ ¢Q!§aCrŸ/þ9°wã>¶2ï?ø'6…WïÕÖOâÿÒôe²ñþ“x¤•¼”Sˆ t*þù±–a¥²!hEDì-Íÿ̧íriÝW2 MgYr® V~Fso“@¤˜‰ÿb]k¦² hwÇ^„[ªwýª"68—ëSB‘ïtÿÀìC £uÕÐÃõ1PNš ®2ò9hEM§{úÛÑ»·y8l¬ÊÂ)»stÅZý¡+|¤€³êŠe¬‘û®ø‘dw¾;ßë@FI É­5‰<[/®_aú.±FpµØÆ ×Åæ¯na«öt',v­gó¼m˜5²3LHÁ5Yw÷›= £ïz‹B)cVæ~À2 wÁTÉ5v}æ Ï€í[²zù{8V >l³—·Ã`­†¾Æ<׺‹ãå?æ•m¿Y³¨¶­0Kßuïß•ðå59~¿$×B8CØò¶nµ¹Ûucÿ03¬©é-UÞòvýˆv€<\<ìï‚!Š HŽ"º‹; ô«>¸¯áÆô´¤^cA©ÿ·²7¨ã 5XšôÎßÃâ/§ýà'þû%½R"JÐ0u5Ðu¼s!6TœÙ©¶9=€"³\Ëú"œ)‘·Ì¯˜ÿÉóf$Û|<ŠÑR³¾Ìñ™SáÄÖÓ(þ‘‰~õ|Ìåò´|šÔ .Ã~ŃÈmÌo|zYOàµfïªÆˆ.¡·;‚ò˜xh½»7úÉYòôe+ðî·MŸ1¯=aëë踊ûlpjxëèD‘i¢5šbc¿M!Yã­ÌÁÔ—›xªÓåé[ª|—4Šèv%<ŽK`.Ò#„4­æoX1Þ€™9;ž<]++àdÄš)ïÅCð§9øÕ:4ø7ÙŽÄÓáû%£–ji¯}’"¥F$í¡•8¹–ÓvàÍ¿ÚSºÀ°¹‰l„ÛÀózë²!n/eªùÿ )ŽèŠ?YïEjØZ¥´^hv"‰c`Bq5<°§ZáÂOoÿ–ó^¼×’;žT}Æ2—°'­­¿ñÿ Ø6‘µ(/Ÿ >ÔÄ&°æV´m@¢Õ1`ÃMŒWP÷`î¹Jd-B}Ìäƒ7üRd¯Œõ„4 Òá‚PÉøôò~Ø9áaçªúØõ4p¨>­!Îògo =ímnH…4ejR(’íÃN¸-ÏØW㈠†! ¾©Ð{}w©õ5sñÀõÝÜZ¤ò0~¶ •im>`éZ[tïæþáµ3«íÜÒ$«^ÈèÑV Ð’ç=`¨Y÷yµ§ÿÜòÄýÕßø@YJ"jŠÜä…Óú: Ù*ÛÁÍ×ÏÁ èµ=X ¸½1)+)­ýàå µ ᛳ )¯Ù¶Çxyã˜Ë>¨Ô+,òhãöe¶.7yoBÑF¤¶…ˆOÔ=ߢ¯è£:Jz° sŒ,‡JçÏ^¥ä´;bâ{Y ùÂìý!`Øç {ªUÌ%BÓ¾†ïb¿"ÂÃÇ\Y‰‹Í¦Äˆ,Ý¥hƒ]g:y_Èíò¼hCVÓÂÝJàœªT©˜¸PÒÕý—ÐQ|{ãI1iùï ˜cªZù$«nßæi ðS?—™}fÐöù ý(ÕöœN- G~Ðé Á2I”7¶îÞ‚|‹•Ôï ¯h€Lß^Äw›„R‘yçÔ‰/• ]žäy&A–ê÷µYèK à†¯sAÚEøEq2¥†RYc™ ¤;áåH«CEò«£&£qÙä´%HtÌ4—m¸t^cycxÆ/¼àu|<]w!6F…·^*8®‚Ïñ×9é&A×xR¾S¢,NpðûâÕ©"ü„ŽÉ(DÓm†7þã65ŠA©,?{ÿqȺç&T9â1D„SÞô2¡c±Ã£Ÿm:AÑb·?¥óŸæÁ¹MÎÓÜC3¦R¤¨×ÓÚW‘ ±Vý‚¯ §»Šå Ã4°:gÝ#Ýïs\BHh–&ÎVK»Heá3­%4Q‰(œ$ÔÜH3('L?- ÜT§ŽÆIR%-?yMû£žî’¥-$úçWã9Eœº+Px|­ X€ë㻌qæ%Í ‚WØ5ñô¯~ìžê¿jË0xȵ—oš#Ú±l$§`_íð’Ž7t"—n’‚²ÅSžŒÑ"Öξ~åÙ«u}2_TùLÅ“[q-‡›‹E0%êŽÚúã"©€id^î°<>iÙGÏzèJQî)’ Öþ¡Ý¼aæ÷ÿ'ˆÆqˆQa!`ü’ÃIØ¢ƒn0. §Ûtx6A6L+‰`ðÜjF§îYE ª#0ER¸åÓOµAW¦¨.¢š¹Ý:`ÞC¨°‡Yk\Óõ!>Ò9c¿ç­Úí+ª·ž§ÚµR°ë飞¬ÿU1¿'õœ-/Ûq‡ # v*sáY£ÿÂW(tRMˆM«ÅP(@'’0ÄïÉÆÄï3UuâÆØUNîèQ5-Õb–‹[çkŸiŽâtß{¨È: z¡=-œéI®IXÉ3î›~“žl#ÅÁ‘Rɵ¶ôµvü¢}6<´½¯"0ÖÙºjÓ¼#•k O°îk!ϳäÃt·â°–V=›‹õB]!'D†šý¯‹]Z“QõÞñõÙ^½¸€î*–quƒY¨»Cºè•ûÅÕúE˜[‡gΕËvÅóöçëœ$6]”楗´ò¡v»Ø¢3žïBq•Ý¥¢ô”ªëš”eŠ–œrŒP É[‹”—_)}¾+DF@Y9ü ÝÜ–¹Ü ¡KÙPÊ€|1.4½¤Î'þÜ!ÐÎm!”n…Ê»Ù!2¼GcêLx…`f‹p\­(ÂÄm8ô6»l.‘®@D¸¥EôÄŠ!>¡26hù㨱àªRÓ`ºD¶';-ƒ¹ãž3eÓ¬–´‡Š"r†R诀ÛPzI)ÏèËøÆ¾_«,B¸èLÞ¬t]60Ül”Â5來)ÐS»ø6_(RÂXÐøì!€““n4ýÏ£¥åz˜`EþÛmîþh3ÔŸ;Ì’È_ÓßG4,Âm•ýÏWO÷³v‰_2œe‰§¦ Is<ÊIè«$’‡ÆÁÔ µñ œÔÃÿÌ2_‚9Vg£Ç\"¯Ð0<ÿ0!̃uAo´ëÞO(©/¢]¶PyCL¸÷ÆŠjçVþV³ÇSWìI¶bg} :Õ7©äèûñ¦¼ýûåÿÑúOD纔Ñ=]$WV¼.À ÷÷æœfÉ6Ï:eæŽÄgÇÕgUuŒ4v]Ð:óE¢jÚ† f`t¸6()ν¤Fàßß ïа?ׇNs]Ü`bJ´Gódó¹,š¹ ÷¹Á¢ãò‡ æ(}–Ô•]ô ‚6Ö‰hZ^Q/:H?ÞÎcÊœ׃P=ŠÙkLŸ³Ãëü\•ÚÒuÉ}僠Ú¬~šXÒD+Ëi«ÁõËu³¼B(÷ÐgÊ}ÞÝ9Å.!Xɨc*ÿHUÏa½^ð7lW3öT”ðÒ—„&_uß^7Æh¨-Ue­[\¾:…öt—6ܨí£p[Ò`©Z„$çp©¦[E6àa¼F%òmºâGáiáË}aBXÀà‘0×Ê!jô…ô•D‘ ï#µIn\;Æú¢¦N\7†ÁQ™n€šú墬‰ýšÊÃÏʺ†Œ ÿ¢•©MkNœz›â½[-× 9oˆèŽ$>tž3IŒçGw¯Ñfål(=|o ušÿƒŠžnÑ{&õ—_ìL m¾×<`Àë]]µ>òw:#޵~Ù úØ7«ó:™EÂ…_ªã ÊÕúÓ–‡Øž­À&Áp5ãÔ~ÈFýÏâåzD¹J:~ö=èv°çk'¨Öª¹fDVF!fx¼.WH/ÔÕ3‘9¾ƒ>0̽ÆÂrˆý°;tòË(g(g`-Æš `ïF„וqåeßNP£>“ž­¯ Ž?^W ¶üÃ, s^Ÿó¦^½Á\¼JГ èÄEj.8yí’ÓÇÝÄœBßűBñÄ™ùGé/›ÝÙ{Mm¥´1´±ÙC`yDýRÖ‘¡¦Õlõ!K÷Õ H˜¯Ç­D*8?cÈi˜eGPÚ³Cy¾ŽgÁR€ì(kÛ‚ÞËh÷K8©ÍmÿÜAâ Za~¿gý{ëJ÷@» ß´ ò¢´>ÒR^Ù±ÀWk®ŠÞ“,ãUØ=Í<@¬%ø~áš ”ø„E÷¸Y*ãs ãÈÏ’U ÕÃÝ!ATl+)iOÐÇܱe ±Ó}ëZ‡6¥B´6º¥4.?ùùê™ähs#¼j:Q¨ýA{h-7çóѳ{¯¼@¬úËзC OpzíGOO«Ï‘ÍQKèž”d¿à5ošð&„'4a Pã†éÊõÄÏ˃<äÕwýD}òP]]ñÈèÎŒêÎuÂB[è$”â¾{Z‹CßeZlºBKW/³ˆ•û~0„6_z{‚$Yt‹Ê ·gî]ñЊ˜õ{9Ž”õt‚¢>°ô$ÐZ±›Já*I –*ƒv+Cp¶ýòk}㋩ʎ⇒a®È‘£ÃSK?ŒØRF²úBÑí£tŒøB©ÿ­Âä&€?­A+?¡#íSu›€lÄ“ŒáÝj7GgX ÃÊãQPÉÔ8Xhùïµå]-V¸‚Q¡ AšUxeÃrÝ|"\Ò©Œ¼@xq(ÄKT•òýE¥@q¦.Á<¹³´Px ÂlHá ù±‰%…sNk3/ê‘+¡ÈWÌH‰p_å^N=0éOÐ9ª¯1ªW4e§~áçÝÉóý¬ƒêþesáÂLE=ˆ630X-v!FO>4köIŸ|Fö¤Œô…¥Ñ«Jík¨¬5 â驵6YÚµeß²uLx¡mûvM?7MÈJ¸f­6ådúÓø„ϯÑû&ŸÀü~NxüWNKWÐmÛbQ à.—§{ž< †U Ǡ¹jzpÙØ+GZ~`¯ ù„kI’»Ò1]WÎ<—šÏÍ,ۦnjbQÔvë(y,=ùaEsÎW&OÝ ªIðKV©à:§4u,Ùž¾ÈŒWÀ`*²rM°æ~ûùÒó+í› J¡áÈÒ UË4å†>!¥0Ž1Æ!ËZÃô8ÊÔôuRË3,T¢Ú«ýymµ–-RäâèâHZMoyÝÖ9L‘Ц)ä.±*Åè£sºÜL/•¢¾‰üÉмî*»^2‰oÉïC¡¥Ú"½.2ânÚØš†²¨ÑQë'fË©¿•h-6Ö+xs÷ÉæY™–ïPªìX6®‚…CËã¸qá!.Ñ= ~0|i³E#¸³Eñ°# )|R¿NK;Ôá\üÌ+»A„Q¾ÕªÜvö4®ú"³`«L]l7ÒÅ#.‡/¦H<òÌŶ]jþöv70XžH°Q,‹á—Ã뚌4QTdáð¡60ášôr—z{² §‚Ì¿X¦OоàŽA´xx®sËNþÕïYªÂtÎLf½Œç,{Îlr¢WÒŸünõQ·.1ü{cú\8-±Psgqš?¶ yáÁ—²Nì7~äÐÞ?¸R`ÁF‚ÚzýDÂFÂVy¥×ɪAèj0£ôiM äµ§˜Ö/ +€·%÷Ÿò˜›|jÝgצ\DÛº mÊS¢•Ñäì⥆ڤ_Ë¿ãXÀë%UÅè)ý Ò¤Òaª+ÁZKˆo˜-Ö ë¶Âü$ $Ÿ(~‚Ål þéRNMÍݑХ¾ Ò¯À’—@‹ÂL•…?캻ü±!e %£'³¨Kò,˜\Äõt/‚¶äSó!ñÙ¬ªÂ±rN¥ßÖ€ÂI2´ß6ýŠ¡œB=ÓYÓrJ˜Ñ`é€ãWï`ëÔ`ÅFP·kr4×–új1On' ¶»ÆqØñ£^ l/íõ–¢ ‰rN"½±xLÎßšHN"%ÎtC§û±º?JÿÕD­«Ë(áD•Sð¥û›ÉhlIRnŒžFhÕ­·©"4¹­8îQ &ðšÞ´$V2’â¬G8$¦šKáÅ|ïkùV h,-ê-Ý9Šëųp?q·:ã)›çV²³ÂÚg<¸ çñ¹°G"³ƒíVšr3_V^¨´Ø94ìŒv]—u¥&–>ë–Oì+“ð}MÔ"ÕíÀÐ1ˆ D`IÑ}¡~Ù<ÐÖ™Ú£ø˜#÷4÷[O¾-‰ÔŒ'·ëlUŠ!¬À ÐòK’u|& 9VöÔuLzù³Ê×}'»×é­²‡E÷݆rçh.·Rýæókj`?xš:4öµF[ÞÓ.ØJ²Uu-ÊʨOMrüxËàGx  w½¡c*u—ÌZX¨äûÌ·Ñ Ù›1ÇJµÜäqw?8Þ£”çì(O¥Éßö—Jv•JˆïM`0âÞ|Uç|8ˆÕ–ò[ê±ËÓÅ‚žüŒwùÀmÓǹþ³&ùyEä@}éêSLš'¾Yâ ‚ßcÞ9qc0Ÿ‰ì¯Ôn'œîhF‡=ôèùö^êžpàŠVu®º¢=ã™®Çˤ'â{XÒ´4.±xÓ%#fÏš=à AŸx\\š‰+Û’nȽ&{Á ’óy\ DÒ¡9ËEd{葚ǘ[¡u ¸1Ž¡c‘ÅRF÷Uvï }ˆ­ŒZJÁ/Y N¡­™v}hë¯ÎË…<5SS>‰¼bÕªn/‰ØÂQ—Fô¨Å%:áˆCEhbÙÔk|‡áê^†÷c rLùN¶Öf£>ç¡)Pç­à”PŔӵpUûóŒî]7ÒõÏSe²€¥™ü—Å Ü×å3ŠÂ8a_¹í†ÓÚ†ºéÕZuL¿dƒ…z“üýB†¦x“2µf0éöùp}ùõlWÑÒ1Ÿ·ÐÞæ÷5…õ½$ü¾¬&ráfó¿^l¯j㥭ŒeßËd”w4ßtî·¾3Msòª¢­ÍfÚ¼SE!ñìå5ÌùùhÀM*xó¬ ž´A!¼F•@U¦Ýž &ç>‰Ú÷ä´¦]~^ƒ —‹Œß )ò¤ÚÙ+]–é¾÷ÞûœI¨Ó‡¨'f3Aj{«»›'Þ$¶ ¥³Oö¿-ë¢G ñÍÆ |±dB$ì(HÉ‚»åU·þëœæÜ7øÉŒáÑÇ-›žx³ÂŸ ïôƒŽ_ÓÕ<À³'oâMüB²@÷òƒ¹æ¤l6[bú=Àî£ç`¹Ê–eõ)ûuÓ¹£Ó;wNMWùï…Æ«£Yý¢c3qùþ‘䵚¾µhD€ôç 1Èbí’àB¹§5¢Š*uÁ¦ÿž-ãc&JäfqšŠ•yKb€ ®Á†Pë³?2  éÈìWT†M};>7çÞ³^ŠŒ÷Ö6BSÁÝé”ï+ÇÑ24„›€û°^†6oA2Ò^ÍéR)èwž+ùÂC²çJ鸄:œÑVþMŒ}jcâ=½" ôÒœ%}ߨ«˜(Ź ‚íi©­–½Ù‹S6=éDÄqhFxÓâŠ0ŲŢAkuÛÆ|â2k¹÷Œ·;::6Ucn^)˜™ˆ 0¥llîYg‰‰ÒTy ±syEœGÄÅÑ Ö ò b88?·y™j=<à.jµ‹‹È«Ç|Ô+Å»åtˆì&ÕãkOô^B‘í æ}ææÃ`ˆ·ÀÈl¤10'z("®?v.õC€h~ÎÍ^hÓŠ³lzX‹ðc 4‡–Ó—‘ž-h­ŽJ"’ÊdÜãÕa¡Ã= Â'-óèë‚Û”Bµ¹ÃRû¯ôð÷´ìý¸û£fš4òîYëíB ÒtC\Xdv‹È$"}Âf2~l‰u•@Hu4O²üagtѶ\gnQ ÆüúòÐlï«6â³j5›ÐL•—Þþ~3É’M¬Î*Œñ޹˴êIJoɽL ƒ‡}#E®dä>7®?Á!¼oÄ¥ˆ%TAщ¥Áƒ#Š–Yû%uij¨°h´|µ_¾vãÔéÔ×´µ‘ÔÃÎzKèðÇa2‚ÑñOªŽ$!7_RB5 ®›Ï»˜;»nºðøåOÝÜýi…§† ŒJôҬ…ï~IdG1œø¢]F¸¬aE©©©kø*¶Ä&uºs)†xDZõœ¦z­þ½û1Ýs'ãÝ?N]ž®þ~$?HÎ€Š¹Ëhæn–jµá ²üEvmöÃzý˜¨á5ßêþ‘à3Ø(ÚYÚHù—3–b PgZÖry¦S€"§6 þ­úKÚ{Á_Ë4…©ã3®˜†ò×;”€êø/Õ—&j:Ó§ƒ.t$=• D£:ÆŒeÌ;‚Õq±BÖ„èª19 7iåzŽ ¤¢õÈÜì˜Áºæ¿vŸQˆ–ìÇÆò‘'€-¦:¥o]È 3U ¯ÜZ!xècÚú ’vLŽ¡¬ëËÇkž+õe`ÀSߨœ–±¯Ä´0uÌ:,ð“«¹p÷y®+™O‹W˜èÄSÅ­ÕszûéɪKZ[&DŸ€.BüÆ8 q«m6¹£¯Ú®?~hJOd@l ˜÷Ü,X’àsJÝä÷qE¨€R-ef{ ÓfÙ¥áGõŠûmÝxX—ðò@º(@,z+EŸ™gK0Çä^¨X®ÞÿPC“¯qNj„FdÖª`^¶¾%^·¹Ý ,m ó,$­ÌŸ«„»4f!ºg×e »µÅÖƒe9´èNò¾: C¨å©BüúK;q§z· ,™›,ܳë…ÿ¤ZwTÖ HB¡4Ã7ÎcñVß8†‚êZª¼Î+Ã÷ônÜN\)e‚ô½˜ú’ž®ˆ LKÊLTˆŒòbM¼²Á]µÞ׋ßÙu”N}“u¢¯Öú@`hÍ—Šu›ÑTY„Ö0Ÿëå!HÜTÝÀ÷N«²LX£E×§S=b™ý&rí=ݜ㓠¾hýÆ Òµu{SÑ +xs|p1t…ÿtâ- Ç_lÆ}÷æ¸O:k€L‚¡x”KpdLN K?‘jùœ®ÙíDÇ£ Ckäö¶ÉvƬ®É—¦j«ìSÛ?Ìr@Ǥ§jQlÈVBë†>×ì‹höÎØàV'£$þ­I­6ªbìñ2·})á‘Ö¥AMÈ,6P¼í߀Í)ëãý¹Zÿá=,á˜Þ±ü1µÇ ¾d²mšpJŸ¢ærá„uÍÙ©—\6Ú÷ø5 _ª©WâýS%"Ÿ=Àë›>MqihÀ4`rJ.Á{ehS.è?à˜¶«DµÓuW'Eþ¤ÔcŒ¸àê„_‰!ã†_gL3^U¬Íã¹aÃR¦-â/•æ•ÞZÌâHàv¸¨fÃK›_,Vi” ßëï´J«»”u—æuLl[2kc½?näslŸ2¾Å%Ò·Œkc:š¹aò<Ãê’ÓÝi€Ñús’%se=šb‡€îŒ¯[-Ûl2jž“¸) {š¤Ÿ§î¥FŒuGòzß‚©¢s=’åÀá…VÝ?šôRcáÍvo[ê[×­4Ob«L¬çðÜ{ð¿ý"Œ­JD±Zʵ<ãwX:ašE{`hMSUd:³õs‡6Ÿ¤×.C\ªúßDûx(eú¬_éEŒ?ö?á™\Õźm¼=³°{eÉ„aëéLÖš”wbE4IQ&š¹JIÂ#ÿø—9¦3Ê"…4Ô¶Ñ̼äz>x’«¸‹†ÄpîbÛk”}SNÒ"¬;Õ¨;ÎÉxÄFѽQ«9n;Æâ0™7n4üèì³i¾Ñr¶ÚNB8"(}ô纺YYxuuAu@¼B¥é¹P2£~Pi‘BúÝ-À «²`¯žÞc›Ýó•T’>F`ƒ²¯ìH1XÞŠœB<£Iá¾ãwÖ{êŒsJÞ€ Š•Fº7@âd3¾å”¿}Ý‘…ÄÒ¤éó@HŽîdŽÍÓ¦ø,Å€¶B»<ýáAÏØ÷8fù’‘$¡½!A1šð’!V9ðFj/õe÷±Œõ¼µ²'²`åËe#·òš¯Í‰ƒîIxðôhX>çLÃÛ 8:$àœãÇœî• æ~‹•>bî®^u<Àµ~ÕGÌ"È|€,-ÂHq‰Ÿ-„t³ E¹´žÀÍoÞ§nŽÖü䨶ÁV£jj7è•2e)B.ŒÜ¥áâ~Ù.;”ù­¤ÜàaŒ{ùAlSH_§\&ø|æƒ:"а/úÐÈzíOtû“oŸLº7¤®ô'ðÊ ¦ŽÑ'u/Û>–'Àjö ì2V¨ÂƒâLÓZ±Ž‘ÿ@?Ò­¿Œ’µ;Y“¯”ÎõÕâ_ªkªèETiëéEB8GªðÝn÷­ÕÙ:üÔ%5 kâ,’̬©N6ßÒ<µ8Fª÷oÊ]àp‡H,´EKˆº?ä·¸ô-x673Q‰yÙÈþ·ä‘Ây¾ót¦äüä×4Êl®ç†ÏÎb†¾šüswk[þ6Í–ÊãfvE!ªÍ;j™QœÉ¦˜o)Ô.ŠâÿЋ+Hà ”›ÿÄÃÙg‘íï1P¹ñ¿Qt=ÐÕZ¼wS“þ-D‚¹èmåqaê7Ÿ„‚¶nŒ°ti ¹–Cyò¸Aê äôÔËÈe¸5}Ø¦ÛæïÈAP°ß#ÖÜçühþ€'HF':6ª/f¹ÿƒL×MäÉí Â\n7X:™ã½H,²˜ù™‡ªôGcA¶¡¬$*:Q0ü¥º¿é .x±Æ™³lô; ETYX* ó¨õ3HhcÿìçFj™äºxÁϸ¢S²£¹BŸ0ÛR{†x`…Á[&o½!ì[°+ýÜ Ô%–#àÛ>O9…p,}؈Ý-ëñS0Io¨ÉpÌÞüµbn”{KiV÷ˆ<4Óú½1‘…Æ[zMÂÁ‹žbóÏ6猺}q ‚8±•¿Kl‰Ú+ɵ?¨o\+Ñ? ý<]béïÜe0T¨˜f3b‰##Ï$´ üü+Ü%úK4XžgB}Ë|çpglÊ-ÕY¿æ@=-±g޻Ц=áá,ÖõWÙ­J4÷¯/äc@ƒ½!M‡Ÿ$ôÙvB@[X»ð(nîS˜áŽêo6àÚy¾2$a¬àfÄ ö³¿RE*a@jTÆÐA”Z!”nJ% EnÍå6¦L%ðhlL˜/»ÝˆàSÇgC”ƒß¥€ùì*ß)¡dމ…fÅEl¼&6vl«\k6Rô9Xoæ¥t„íí“ëqÍBly*6³ œ9û%€Î>HüíÍä)€Íî¾Ec£ëø¢<ôÏ8Æuy,m7ôBWÙí­'ÃÝOÿûÛS“¡»mâ‡ÿÝYg?W>Ü5Õ@ë¿Ð4=4XFµä‰ÈqÙÁf÷È™[g‡ÏX„}M5Ç:îõàAdghµÔ! -Tþñ§°]A]&±*¼CÊÆöwû/ÖC§¼L·{1ޱm)G0˜4÷Xz¼þ‡ —GZÌÉü鱿øE…ùÚÞÉ:žMïÖH úONZéçoÉ ke©äÒ:ò,•i°ÃÛ"Hè:1c7!½ÈŸ"&xdð°/üˆO3¯Wž…ÿ«¶|u‡nZ fÔLÙ‘Ï"£n?Ðh4מ‚_HáÖ]€ 1í“w[à¨Yç94ŸŠÓ÷‰¦ì¼8‰Øœg^©Ü0RjëúçøD¹“i³¨.ÞÂfø" ÀÖe l9·÷ÌiýgªÌâœßS>Írº†>é ¢r¤± a o±º)vmw"îí¶¹ÒD6®ÌïJбOÃxéÙŽ ”XAŸ¾²÷¤#»évÁc¸‰&¹ù¡Ä®N²ëÇÐ} _§% Ç ½¿Eǻ۔ñ§ù%\þ••?g…5¨!]PLm“ïH$%õî¯ØÍÛu` =Ú3+`ZƒoáíŸ0Z&ïJ÷ ÏúØ£ óÏ4¬Ùª¼Ì%x~Ä9M¸ºÙõLë$¥¾9¢‹³ÿƒ¶ð-.%°ÅÐü_/5¬¾ñWƒ´_ïž2!k7*]§é‚n?ø>¾=©‚ jö,2³¥´ÿ§hÛg ¶9ëÆËÁ‡Û_ü½w_Ž¿ø—{”£J´ J#˜­Ý®;í‰îÄýÞÝÖihø“í°pÕJû1ùçòjËŽñ)ÓýUOiáÞksmXq®_Œ‚‚O¾[h˜æÄTK=ºõWVýÑV!*±?îApüÓä bɆÜ;í †¥mÚb´É‚É»pÂ’”({“VwQ!Lˆœ\Å‘7AP¢š³3¿o û…. ëHXL0±)DoeŽMÏo‚cè§Sa YçNH¡ù(1ç³zs㢡ÀË•qµ|Ë•Š|]åöûÆ|dIs×{mð¹½€y@êö2z@¼‘á.eýŽ-rÅÔUœ; Î¨ž-UM¼Š‰å·Ò¢ y6_÷cÏÄ8îÁDëIëúØ„[Í"ÿÁ"æA|U=¢à£$¬(eáy”¢E§¬,Lc¯LÀ8»ÿœ³½D˜oå¶ìÑÓóÊ/mO]ØÔ®£%ªYiüÜ¿oÄ©¶´ëB¤zÕ6¶j]×WßÕú°+‡õø’>áÉ}df79à ËhÕð^†–rybº°¡ß‹¢Á \#6°{ëbÞ…Û—.m䙾q‚DZ”rLÍGfXVÀýU<4óáÉ|ËÚbŒùºOޏ‹:~,eÊLjwZg_›2Êz`×\ ì½ãó†ôa0ƒŽ|è £VG ùÎ}!Ôw<§,×SGZO©0cÌH“U·M«÷û{‚ŒÀ^VÏ“hH5ÍÛyuÎc€ ç–‚úhYÌ#PÄE’Iâñ¯AÎÒe!ÓlYkT$õ¡¡G —wË—V\¸ l7û'*#ùÀ,>_ì7 ZABRá|ýdÛ­ ?sï¶Ç#6%qP+Õ7ލÌbJRg¸&Qª~I•­mÃÊâm‚5-VW n(iƒI˜ÜÁžäRC·õ}E6,à c 1m_sc(Q×ÚÃ껚ý´dôZ)¬uÎRAYZt½¦MfÎh Õ°¬8`©…'&â nSjN†¨™û Ǫœg«˜L¬Ô)p+à×gœÊM`нlN£I(0ˆñô_¾MP%…º”ï)½ä³K”Ä*« yÊ7ý ÍnëŽgÔË–Ï!yÒ5O¦(TrV[}DX»/M:ë¬}#˜kõ4ìK}»ØÂ“±ÿ RÑg|ŠÙ£Ë$gÍ$ź¿hËJUõ(…÷¾#±&=;¬¶¬âôfÐ@¿ [ʯä—»›ej–¦tÔ‘¹ßè¯oë“!ç ÓS•º/è¢QIÒ4‡Sr89bË&öPšŽTðng‘žƒmHNo@Ô3Éð ¦è‘èç8çðÍœï|×`,MfF¤úrƒÞdÜP’ÛÌ`‚þ춪XêÙòÙ*ÿV‘ÅS“¾Æc¾BŠ·„ uøøÌ¹§A ¥Ž¤O3>)§.Àa? Êrúú†W’2Í5i'ð‰·û®Ñ\PÊ ÛkUå(†Ó|ôß1›‘>ÂÓÇzPã`ää›/‡ÑFŬ¨•`sΔ( h¹Vi&¡²Ññèø‹‚zBb`Ö†­Þg)¢© ¶©fÝ#LLi…„ÏeˆW…>‡>Qê0†›Ñ/…¦»ã_˜L³)š #êÃ’×L~7û¡vüï°ß-ô•Žþ’ϵKF…|]â‡ñâ eÔ¹4;˜ƒmcæª/)uÊýÂíx>fÀÝã//}Žh¸Õ€ñŒ0V°Ë)ÙIJA=š}v¦õ,ò-.Z7åc)mYqÖp! %ÖÞbô#Zä²vï5¾$Õ-%ÇÐþepØ­9QTˆx§ÇhÒv ÝQñ]=52ƒ‹í7{¢ÿ3Ãây›%ã~÷Áèþܛȗ“®''ýÁ­ÀûF»fvVg1Ôë†M_Õ›Ó—×êá^MÐÈkgLæ¯ï•V5kTÇÖVÀ¥åïíD¤jL£ç,žÍô–uo­ ñô™c0=¬ !úΉyÅ%zù¤')bp—Ê7Và„£uÊp‰©7·œW+*="2Äêÿ;úÚˆ›¹½‹D¯½ÆÈèpvò…ÄÓÌÿŽY~·Á§5+ÃØ—OêÇtY¡¸äV<‘—|×L­Wkh–ß'·‡iº{8"-»F³Ç‰ã³ì'x"¡Ïë ·œBÍ3{J%cr!¼æ/qíGŸ—Å÷Døk‚^åˆM/Öø³éðïs‹Òã–\pI¹5ŠÍk¿l2¶PHžðf¤Yƒj¬@åÂõHºÃ õÌ+s|ríUFˆpÝÉn°ÏÂlßÉ]˜ŸEbßBŠÇ¸® f—²”8äý.á*ÉNž1;N0†r\ÞX—]âÉpË­Ögµ0†êJÈ »ÿp›òúÓSv¸ï—¼HÉ“­íG ¨?™½þ¾nØi˜BõxG-_‡ ÷NíÈaæ"$ãïmN05yK¬¬¾¶NêzÒö_(Rdñ:aduÎt¾®¯¾ö¸¥.$³V4ÓôqCÊÅÈ;án$Ýèø·=Šõ¢½¿ÍÀ†V7Âï{° ¡DîXÞ±¾Ôê-7ýù‘Òãmq:6ø[ÜžÕŒḢ³ 1‚Z€´H)2¦-G8Kœw ¤:¶÷d"-;qRùVM‚ÈXíR?´aˆvEú±øãqï¥Â‹&¢^jõÄl8²î¸qì7ÁÉ/ëX™ÌðÓ–T±‘6PšäƒÇE¤4E(±ÐÕ‡Á߀{ )7Å£2V$5¡ºzïSuù3µnó}Fˆ9(½IØYWhÒܔӮÿfnSÇäp¹³.Ôâmçdã™÷×:ÕJ–yé¿N"°ß$¿'^ç5.ó/{a œäŽXö&âv}æ>•Z]6´J¥üôí»÷Áx ³ëê·Zt¯wók÷_5ÀV¼ÿwjsÙ>œoÚ%€µ¿Üø»·¡éè누<Š90sTtý {ƒWè§8[H8*…¿.×ì—­ûÎoá0] ”8åK°°År?¶‚lÅI"ê.ü= ú„I¢âLÜúæÙ"É-çÿÀµHÜuØóhn"üè ¨þKÙƒF%‘¡¼dÌgBý“uÂ¯ÏÆî#°Åý "ÒâJv˜1xk1ѯƒ‹­ !*T‹éxYþíbÛ‡²’T(¬ÀËl»“] è2ôx°˜çç÷¨¸½l¤O§l|i‘ˆ“ˆL¢Ññù¼Eÿ¤Eg€£*TÇѶÿ23d;¾SÝÛÞÕÔ*5Ó„¢0c¬¶†öFA¹u);~ÆMÚzCCsð®ççä1*ÿ)5nCpT‡pÛ`Ü[»'VøD¾äVº½“'wTËÐWÎgbŽâÆÂø:@yõ!)÷»-'âõî?`go·œä[ Šs¼åYÄ}H(èRØgGo‰dCŸoj¬DsÝ{”üSá‡@ïý ÇÜØ…Œ7ytê?ê)é^SìMJ÷ÞãÔô[¶½Q×&gD!=>QëÞÂò¬ 3bÕAòG"9 TÐt³ ù”îiÁÍÌé×_»‹OÛO…'þ(kíí/ÿY$÷”Žl\fžÚªrîÕÛ𯾦—oIÅÙÑ|Ī˜(jå)+lÍâN_8Ê>›)o5y-y Øãá41ÞªmèígÚ÷°].}X07x è6éð-|E0‚šœ‰(ÝËô1bsÿBC”9æ•P¸w‚¹ ¸¡2àŸ¦ç xo”d»=Ûý}x ýÏîæv:w—|þø$¯€_£ü‡îÿ±ÇkLœ”:’ *b`-7ÊçêµU¦L5êßN“5YdC6—‚cš­ì)Èþ,ÿ°]xËïž,ïYyËÂȉÑު悌ÝoÁÚ=ʹ_±8&{+%/ÿ$$üzV%S·>¨2OëåFkÿÞ3«=E®[…Èàƒ2ã‡Þ¨ô—¯ nq²|êRG/C+k¸ì>Ž0 tfb2R‘LG¾“‚‘·%Èòes}6YÛ®ËvëŒ$põ§½^8©÷%ܘ`·töÔ°±†NÀ±‘<;çj£†œ=ü“ Å À_z2ãe ™„ø!¯5JFБ¢J@Öj0â¸ß–©?±Ê6sQröðÕŽ-ÛNÀò!t—¬½Ë€Øn³@±ƒ"É òouð•%ƒýF‚õrP^ð8Îó|Î×)c˜Ðý]„çøp~ #ÀRk1Œ¸‡^Õpð¬bnâºÀ«êS ¤FO/¤Š™ °NvMïÛôêôîÔHû†°ÀäCÎtŽ$3„+;g¿@O§T³ÀÌ@´.öÊ{°£;0¤×€S†³ó!¦–úB5ª/ 2Øk¸’Š’ƒÕø<1½KGƒ ¾€ý^üæõ›w°çèË“ìú9Ÿ4•8ýkLçƒ#ƒH*zºõ)é+ý»p,™K+8p¶¶Þ 2`#ÃyQ|{ÚÈ ðì0ý®IŽlå*#]¥óŒUNcÉqe A_….ËX½uµ•*téõ÷ÉœùmÝ£_¸m¼^F»}Ò¬ãscWó‚®Q.9Ù´»­ Äí¾¿†þÓr¾&#æéÚÃÁÎŒ#¡X­ô±¾¸ ¬z¾‹)‘ÑGn÷xŽ¿µÔo•Ñ÷ña,Œ ,š‰ã:뜳 e‘îV€ñ¯j/¯¹Ìè‹ïÄÆâc/QTÑǧ‰÷Sšõ‡Ý!½!Ë»ŽÇ3E“Ìnžó›X¤ÀLTÅJÇ›BOrôÓ©tmÍÖ5¤¨m€“Ý㉄R¯˜·°Ût 4—1*|Š>]›¯$ðŸúC’°v¤§9jîŒznr®~Í‘hFŸ†…Ö4Òq²âmôæÝ˜>NYM†›BG%¯÷ó‡33lÃÀbd+¨vi ú|á½Ñ§ÛwOkzsþ ð?~2õ 'Z%Åú)Ä(——Û:¶2É–ð:–?ù:ž[fL­(™Y†{²ƒK׹Ų?XM‚ ¹ã<ÉMÜ0/ ;nT*šEÕ¹…p½Mâ(‘£ÈHÓ(óšºcHZÓ8’B&? 'Ð<ǬÚFS¹Ûèg”òm…°kv>órbŸÉ|CÊ—[ ÜË\¦ÿ¿âX£÷…âuïI‡H• n@HýÆÖþiL]e½ŒÛ7³àª¿Êµÿ[ÔÃfÖ!<<Ƹì‹^ÇG³Uhõ+°²#QÂ}¯IÁ…I¤Ò3@ˆÿÏ 6 ê¼ÕlFE™Ìœ/~Dä8÷;’"‰¢FTÑqª*¨éz«GìŽ×—ûĄ̃²ÂPütÃÿ5aÚm¬E¶§J,t²ë“„-ðØCx^EŸ×Â}|ß$—>¦T #š^á)Êrï¨Wm~hS,¼4I'•§ýôå öȃ¡Ø¡SÈ I.Vwƒ±ƒ-ûa¬\€‡5³î–"á7}'T·qªZí”ãéKæŽÙW_že»»èíŒÚ²kÃWNr>Û[BìRÑNç7ŽË,“Å#ˆv„ ©ï¹#Õ¼˜0m|¯¹‚Ѭ¦L Å›ì;¯'û¾ÄžYdQþ‰zRyô¸FÂ*GbI·TaÓì·%Ãù/DMáSFÃ'oË;¤Ð^?"ÀŒ­ÿð>‡™Y»N­ü.­ù2äó¼ 1ܹf~ÀÖûÿƒ²ý£õh»"'Yô²VHáªW°€çßx,¶¸"é^“s¾¢W …#o]æŠy¾ŒÜ ð*#ü,´ívByí"½X\øa¿Â00¾Êž¿……êµÕ¼“!Ûí?}iV…íE©óFb)Á;>¥•òíüg:% ŸÅbÇ? »”…ÎÄ©Y è!6ø¸ð¯A+ùx¾“lÒ¢5Ón‡›æÌ¿móVJ•pæ˜D…Úa±„×uyW ·Jï•ì/ú¤ólæx¬g¿$qÆÒŽ-¯ð}Àbá«O?’PyûÍG˜$ßù×p† =õí'eóiµ“Œü|îv9œÇˆÑ`1«Iy»‰ÆJ]B$ ™kˆ"L³8R-5ãhN]JSe˜*¯âÐ2T(Ê«¢ˆ@(±wªõoÈFaŒmIç? «†]AØ\>Mý—œµIŽGúõ qˆžÕO8NSÅä¤ì°§Ÿ?¼ÿ½{üÖ“8ìÇ]Â.Á¾¨œ´ë¸ÎpX¥¼Ñ€ir¶8ùP#ÌçYA‰“êÁ¿šîŸŠŒ²¶îv¡ŠÚwiqÄ{Œ² t‡ ŸVµ¸Tÿ8ø°öØmuÿöù>_Ãá%³ ”-y+üà«ï_ÝȈõÛ5ý€ÏúŽQBeò¼»ÿUàä®ôpJñЙªgk†<SM–#ÄadYú“ÖaAûxÏþ$á£ó0Ýê”RZõâàl¯ŠH ÍÈ)b~a6ºâÕïÛ=ºwŠÈ*c',¹õª„EÏu‡~aa}ö:|õV¶fª˜Œ'¹¡¤qAÛi_†!§ýR”)Wð.v>PÞnzSBî3K’}/$‹ ‹Ëe·éœ˜Ù–hð8è˜!Ä} 儲Ǧî%8@ÀŒj&6L¾¿#V‹¤‹Àओhþ¶?þ¤yÓ÷æãûvË: )õÄ…=à¶ô RÄ[Õ'þ,†~¿oÐæö_­ý–çÇBv'ªÉà É2©(D¬Ðbu؋ѯpس­‹ÞÜŽ²EßK_?Œð®e2hÇ‚Þ}»Þ–`ÏÇHp¼w†À „¿Þ‘B¿KÛ4@ÎŽ7¾}¤­JŠ\rGóÈN RFÚ|Åñõ±CmHãh¥š4^ÇÛï¡{{´ÏéÍgô*ÃC(¤¹Ó`$„#ÓcKȵ™úK3HgU¸=9”7¶òá÷ÃܲÞ0ñ»Lw!Ñ.f3ì›F†ínpxà&ß™…@ú²·ÆdÄèûé• U{]AªX@Ðßæš—C1Kº¢Œ,a© ¤-¥VSô¿„éZCa&•ﯡrš€Ý_$ªÀ^nƒì}i¢!±/+ qã ²"í‚—h»HGç‰ú)5ƒíɰƒÂƒ16æodP@M´ÿRŸÂ¸7?eó÷m&])ð5„…O&Óˆ'e8Ò?3þKÃ4)'ºµx™ÖE¬¦Ú8;;!ÚÖô}4Z5ÙÅ\x+V¢m϶"BaoÑ´‡Rh•®ƃ÷+K5ÐÉÞˆôýà,•À/MǶÂê1‡_V—ƒ Ï®#—!{üXªÿòTµ~2–¸±B$%šCÂñkæwRO–ÑçIE¤„Œ+!J÷éñ;­3Þw÷†ë”1 `5dÉéî pUõ•’4m‰fQ4 ÌB-ðSÈEâ[ÓB2›6Cè?Ý|„Cè['þï£F{`NÅôÙ2-í (HÆÃð ¾)ÂêhŽi Jè ˜I4Diª‡_ÿ¸Ûs3_V—(½5€§ó5jí a0v‘H‚ÉŸN¾‘bq^òý ‡(œþ^O’ðâ¶uQâs›D(ú(òI- ´ßÉUe9TeQgKl¡•Êy÷‚ÈšˆÂÑÇ1ø[ƒUØräñ×·å ö6î,¡¿ *‰ºû¨ ÖÈŒ4QY% ?69KÌ÷#îŸãH„íœxÂË/?Ðî;~­G\ålЩý¨Ñ®ñdÒè/4x‰3ƒ>(Ŭ &?ÈDáÞ¦ÃtÒî6’Ýœ®Áj® P#™%üÙÂ!^x;h^SªÆÌ»ïEMÝÛ ä­Ð¯õD @|ÆýQÓnH~wG¨öi4ãh}gJî}æláÒr¥”n”Oq‰À´£|É/Ézè÷“M£³u#f6c ”X•1OÏݹèLSXG°°ñä£(B&‘Ô»©`0¨µŠfÊH‹‚Ù¢|9W¡ëâ”Â+•ŸËÁÏ,šXKÕ+ç/å RM¶QÜ÷´wǹºÌÅø‡º%$³´µQÖéèR³ÁÛâÉ0sr²¬÷®'lK¿º+"² %sxFŽôXíÓä÷è¿Í¡^ó@¿Ô{úHÁ*ðŠ¢ÅÉþ5F%¹Ûßå2ð <È0puO€ç{ K:‰6ÞÞ‰NÑ5hIÂŽJ/¬V÷‡£ËÎéa€º¼Áø§½—&Vèú¥Ç•q®{—|'ÿ>í@oM*Tìg™u}¼O+_¦ï ÄÚÂv!L*Y+âæCÒêQÉ I{‰Œ~#neï( ž…Ê4™¿DÁëcñDÂ8%e\G$™Á×Ë·F|”DJ[ zìàðÔ&bç5™¬ß<³ævV­ë`‘,qû ß“0ñ8f›žèƒY¨TaŽgmJ²¯ó,=-¤w=,+Ÿ/ùaX9ÐèŒþ£¯b­DO º¼å*PÎé¯ÌHÜõ¡¹Œ±ÎhO(£W¼À7uÇfÁU·!$òœ™Ev75É- ŸµØ7NlîÍ ÕQ»O>)æ|¥æ6ÞGh|w€)ÀjeZ}”Ï%åÚÄEè‹î,ò{´ào’ è¡'å¨c‹ù-sHŽgcÇA‹±óWŸ·|òÏ7åW&(F ¸=Fÿ«)¡æG¿'Àݺ Û C!JT{¾¥$[€ÍŽÁ»ÿc™û\ö¶A9•”{º6œñ˜è®.t UÏ1/YúˆQtaq©é`/ôRÿ“f]Ÿ€Õ'õ&ƒ#j òG¼ÿÐUMÏ÷,Îû»¹ƒ)˜Ê(¨@ÕÌ®eã¸. ÀX£Y‘`) ±f?ö×ȧÚÜ^ š|,{ì¿~ýͦõÏA Bpš}S½2á Øpד«eœÎ^VÂHê(7¶êc¿W#ý›ßÆ{qšÉõr#¨OTª±]¸òKHðß\ÏíÛŽ4BéQ¹ê ]GšÕu, LŽŠøË0]ß–=¼·ÿ=jÓ›·‘J+ÖuãéÜ ^²—:EZ̬½°ÔÈ•$¹­'„þ?}C~*tãÝv^…È ešw´K>CÈh@ TˆÀ´•fÛ`*gÚP²pÊv` ¨tõGzéf‡åFƬ¿™*  ‘šÒtƒC¬Ío÷ñ[]4Gäðn ½a×}èö?R{ûEÁTظÓ„4Ž¡æp¸;80œ·{ Z@Ëì}ïÆWVLóâ þÕlM¼: !O üëòLüE³c¢a#W³½,äÐ:o¬ø49òlsj¯jÑw£„Êqƒ;G ];T€n ¿ÃWWÆ´¢Îñc~‰š:ü¶“¤Ö‘¥;¼ƒ†1;Ò—?µq†Äíúˆ² ê=› ©SQJÿ¼ä§LX,NÍÁ㵫 /£ˆ;kpa'²3îu^F;4ãáº]l5H˜Ö„%‹Ä³ G!±«ô`/;t}é#n,µË¶0Ë}\€·w·’Ý7uê”*Iey˜Û0DÑ+hÝð[ÅïÓž¨Ð6}Æ„›#z©eç¯QÖî“ö7-Áž1³4ˆ… Ǩ¶ †t/]ýYí[¤[¶Gc4àJ÷xt‡î¿ ŒYx6í~;ÓR¸¹]ÊY76ˆ* t­¿Ñ¤Ø… šœ‹ŸU˜…xÞ­&¿<­î݃u¥$£a !P“¾Èô.e›O£‹%ú„¸o/ÚÌ[Ù @ú3±QªÍpw¿ .‡nª1¬!cPj‰ 1ze†² ‰¼qyâ¾Ú…A8ÒƒrÐlñÚ$v,á›,¸ÜÀ+ûŒÒ ;¥\èsIô¯äÜ©E»šŠž¶¯M Á1…Å%åü%-rU´;ëа¢Pd[T.5\TJ;UD8ík-ÃWÚ1¤ü¨öŒ_c RÙ•o¥üëümEjÎmÇYLFuAвî»Ô芘øghvèa=bTBø¥5Ž&ySüI·»©Þì»=r ŒÊÆ/ÓWw9¾è9í‘•\Ýyczåú˜X0a1Û¾*M¡“%Ë“Ž¸\IgË3á«GK±œGÝ ÙËQµš†Áû*k™û"ü™œÂ·çKúÞɘM&Õ2|Á&gÌþdGÖÕ ÔQÄ&O=KqÛkKšfý-vIÍ,q;ÂYHw>€Š²±Þ‘SšÜ’ÛâÊYü„ÅÑÏ8;¬©>+×aÀrªxã¢ÒÁåµ§¡P},Eå;©øÙ\zfÖÈÄÓCy—™ +O_Ëk˜ÚÚù*F;X6Ú8œ‚öS ´O…îÑü#Ù¨Qxߊ^øÆÎ¤>Ûà ¸­&þí… ÿžÎTn}‘ù©Ñj:—nÓ¯šÍnEKp³ÛâÃ×h#ÿijy›,3ÛÈ-/•DætÛõ"»yÝÔ`ÝÓ3;@T)šs‹Ù¹dóB}Eæ4ÇšxN‹t¡øoº„|MÚÌP¸Z w¨ï€IÔB§¡ÆÆ(6RðÁM¤g& ܟ׮èÿåz礂AºžrÓ~D<2»Iád(_©ÖïÝ‹v£M¼Ü*`Q› ¦;Ôc¹NMÇ‹o±º°?d·Ñ_Pî…áÁŸXd«(UhEŠ€°–棨„’)·í»>VŸŠSy†=ߪ×ßòBêçbܼDî?9ĵ\•p)àô~ÛÁ^ ËDHá 0é|îù—è²`¨¢gši,§örɰQ`qR+/TCJŸ¦dzcQ÷% ùO”ïã9- ÒØ—ÅÅŒ%À;ùy ›Xµ‰±ß›Ê0UÐ;l8$µìGÝÓ5I6»Z'Ž3 v9øØRãºl163îáC€’\?¦gòÏ; ¿‘£%|U”È÷Ä—ëï8<ÍÞÁê”ñu:¨R½ªåÛ9ãÛ dŽåL›@ú)÷ÚCz‘³Œ-íšY7„¸î Þ¢V,$‚y••WÒåÒV®‰ä¨kÐÐQ½(‘Àûð‡âÆäàCþrYé+Ý%oÆ2«ô´_e7öÞÓÏT ZÏ/.Z"eHÎÈÐX@Ý2Š|KÒ=Õ(«¬¨5ß`~ÆŽ&„ ìæà1Æ OurIðËÎú—'nVzˆØÐo­ƒ¦ d÷Ñþ²d²phìÎÜ<wÚHyíé°²VÁWK0)ù7K,M)›—­srDE•Šx:NÜöfLeÌ$¹• \býÆ–Ä»÷ˆ–D°í&<á Ðb‚>ç3öÉD, θΎˆ¡W&ðëÏŸÇvý.TW›'?½ÅŸVc¡BÉ’•›ò§M¬_¯»à‘Ìî<<¨†— Õh”i)ñŽÓˆ¥öÀpÆ&¯ÒWƒ™ê‡À¦u¶DaÖþj`ݲ1‹ìbEúþ7œzÏÊ™49ÚÂÈFµ¯%笋$_XpG£x†(^A·äu<‚ï™ã0X÷N«8°~ÍÕL˜¾iT²NºÚÖwúæžâ†Õý`ª ‚iÌq±à‹ÐNÀj]i‰½¦š óû§õTòσwú)¬šÍ÷5¹¿>g/ÝZŠ8ÀXXøÜ4…ç¶Cò÷‹M©]iœûý DéΛKˆ½U|)û'˜µŸŸoæ2„KæÁ²/Ç€þT BuÑB$u9Âí±Öîckÿ(š¿Ž3¸Ì¦À 7s§x}%Á¦\1Bû „~À„eOàëºÝ2/åÊ’tõ4/TܹùB]í]^íwýèÔì*ŽÒ¤t–áNwý@1 hö^m'X.vÔŽì¦Æk(ѦMí3v˜q¸9UñvôxØœŸãÞÝßhCÝgNØ…Q!™ŸáUÅ&€2p, ›7¬?nKW~ëãxfqR@lvöåÚbäEIž¾V¨c6&‡¸ä­/DuP»«Ô䛥¨?÷soŠÁßãÒ©œL7Q°†ì‚_Úƒç z7Òbùü'èŠRæÆŸ MÏõ‚u_!wá®õ`ÒÐ4žf1šu3Oµ’[yu{1X èPeºq„éû<÷='Ha T¢ bÀ¾ä®¹iÿ Dv¤D–À® µ®Ì1 ·®2®19ÝÿÙyžBßP¼IÖÝÖ!Î¦Ñæe¶\(ÈGÿƒeß";‚1èÁÊÔç·ºØUîfc»e¢˜®Êºkfµ¥\vþ·Ô,bXè2ð”i‘Á¬èäÊy=ó°æí9u”qþ1¿bŸwÃîl«l¼µxH]¼ýRüàÀ½ç*ïå³A¿ê¤vú=Åó¿þ"|ºmñŒrn“ -ØÐ 5 ɇå¨-æUFÁß›M¡·,o‘óÁôo•øqýôEÁnvþ‹Ý8IŒWw’ýC)ÕåùHˆ©¼JYbË0·ãÕî # Å6ÅT¬\ŠÑ…š ÏhùjæK[ëkIj|—5 açÐR3zÃþM¸±£‹œK”®:ãQHÁˆ6‹ b¬â¿ì¡ÆÇ¡²=sœä)øè{A#²Ïì¦Âç—8ˆç øŒÏ³]qéXÒP²_™‹‰ßÛÑÔ<ª%žï)}³oAèôy’=Öù½uE7^“¼-¦ÄwSnÃ'.‹²8Käf„ìØ3äT)¢FH¹ó¿À¿£ÑüÙ‚„±þ^|3¼ºœ**Þ‚<ÓØ|wƒÂd(€V–½†. 1&óÀ¼>O@j6¦¸a³ð4«hvâaÝgc=å×]ª NáÞo³3ó<_ˆHP)~@g>¸:{ŠX#Õ®z°èínÞIâÿÆf>ÂgV〹\‘Æö쉩crÉR¼6õ>º%Zîÿ2®‘þª\}°urV~„4+ãÞìa$O°Z Љ¨e•¢óüÎ(‹V^7gæ`ͳ¤ À$¤¨-Ý`¿àîËê G› ®Ioˆ]8ä@BÙybö{f/·’+¨úàú‡=á+8,0Mî³t©'¼<ª*フ¼9?oö¤ì+½0^é®çßöë;ëõ°|~/yÚ’Ìg¸› t»ôíÖeÇvìž(GŸuGÑ—$ÿTº0>àd-ü€Sâƒ9^£j\íSÖ€~}ŠÉ‹ò…2¦*¥)}*'w¾úW6¨º'Y?lÂ{öåhµ‰/iaí ‰.ê¡IÔÏy/û±£]Ýü«© ûq¾`ÈàÊÎ]¢¹ÕVùa7'ûçS ?Òbþ$“'«¹,mʯ&’§Lø•nügnW°%¾Y=„¯ƒÌçÎ7‡…~ äň¤“[, q?ÄXu;q‰“Ï(‡Ï UjùÏ¿I2@Y·»#ëí_íŽËù´˜Êë–ͳ?´k¬é¶‚´(ÔCÇlÔÒ½~»9ƒåЗõÿÐ'cd,\KÜ*~üó²BgX2†Ã4;vO¥ª½ÿ©1äR^= Ût$à c36r) z £ ^ ê%^Ç÷PÆÎ~cÊîxîw­ÑQ—ê G}äE¸ òšÐ#ÁïÛžOø…Sýˆ'TŽ!k¢Ÿ?#´û8XŒ ¥Fv%àÉé}Mõ5æc½/òK+ËUhEÏú6Oêà+^f jô>u’\²‡C § )þ Í¥ïmõU¶õdœ>¤KoåñeÝ4!‹¯k}P¼‹º×] .ýJû‡ŲÀ•ii;NzHV?5ªpç.ÒÁûiè` É^FðèôoûJŸ ûY‚,#|¥:¾À «ÈàQ¦lž˜©ô \˜ TÝ-™¯ÛijǰáŽå3©}­*>(íÅÙ4vNí,Ý£¬ÔæK‰Êv¬«ÅÚ\wÅÓu kÇÀ(`EI„‹AwÞåÌlЃ 3&¢çÇt€d7lúÛÁ±”ÊGWF2¨˜»lçª @8F¹hùzå-n@&Ù€äb‡ ã!3a‘Ô%ý½{éý7ÂB;|¤X]ßßêïN®°R!€èψ\Š<¶ûw¿xúúH·¶šöÛ²’‹Ô6Ýß½C°qÇ-ßh}ÃN><¤J|jmì“<€©4ß^ÿ¾o™‚ní¼v€©KÞkç’ñ0YúØM¶`0”P4:igc28®î«§Š=Á`Ô3°ÜȳX ?{51R..1¼°uŠ2íN{~>ýúþxsø/®`Ž¢ée'€ÕâÛ/SÏö£óUURuú6óHÎYqhÏ£*IÝ’§ŸzÞrF˧dEó¤w¯î{î¹ßc ’ブÿòþ¤Æ9^^2_.Ek¡¾béÄ*{^­N–E*' ]í~ßÚävòg©.êÇg­z­®¼?f1¸¶ET=½¾¿.¡KT®2?ÒÓ%“¥ú˜·Ù]·jË@¼zNÜjôó”ž.†0ÅL6CÈuö¨â™ôX½ð€!_í6~ó}dÔLÍonÿº!/¹ÝhŒ°»ùþS®ìã¼|*²Å7æal¾·ns{à(vÉ}ñ“9N¬š3ëh0kÔgÚÆ‘Fª(¢&Ö"‡¼ñ1­UL;­åÑ€Fé¶-Eï5èx¾µ‰ºþÌ&ÍŒ¬ó¹êåâ\a£´ÍÕŒQKÛaØbR¶·x/$Á”'o%»ÐQCŠçy/K0&`wª>k›‘ÜTSgBm ”µ±\« fãX‚êŠÊr♋†>aBè“~ ablTâ,m¦'˜ÆÛ/|)®ÞS.#¢a€Ê›j¤ «ë}¿r”gúê\h™Ÿ¿NbÔ…€°9)¥zbÞbkáKzqœïŸ>iZ4 Çb߇[ÛyçWQMä›ßU‹lÞÚq?¯–;‘ø_ˆÞº P„ ãŒM€&Ê=[$ýÞô ³wd:‘?픾P:-‘â^:T^SM{wùu ûzíP8ì½Y%AÔ®¢ÝÒ3Àã¡‚ÝÄ3¯ Ô% ¬:D£¹H0ìç3¢ãaƒ»Ò$Ó óê?.èëQÔ‰¶=5 Êš%ë¸ö/ΰÂ=µž•¼Å³`t€•/3”ÂQ M•Û¯+¢ç.™¢£}vAÞm•Z-™t˜x®ÚJ¤±Ú߯‘.…|ŒG f¨’U\„˜ÑZiKùm/p5Ù6l™·»bÅ%%ÇD¤%+ÊáúêíÏ3Šoh”Û¤ÒH¼êëŠ` Ÿ«ú‹‚Í4\f6›ó•]@€4ð¶øä@wá¾dæ#SH19ü"‚& ¸ªvƒöEäÓ«}]S™ÀÀºÏyOQe0„jk”õt˜xêB“z… î|s‹­¿“jÀ:z¨d ›D›P” ·ŒëÚïÑ‘g›’}J¨~Ž*§î9æÍ??/Æ„Lóë Ø6½¤]AR} m…êF-âÉ\–t<ɺäØB0¡Y²‘Ôœ+ÌXF]=a–hS¼Ññzói–ÚU@€_oPÔ°)È“TBà–€tø$ìšÐÌöžïª£÷Ø÷œ¹^1ñp›ªtþêݸü¸N¤™N#A/e\~ +<â; bOó6dÚ Ú7(>ûðzLÃhòеøR¨Qi½¦cQȸµo%"RÞ, Á3Xw€~ÜAIx1öª“:õ3­†£Ž3¨)Œ&ßn¬yz/@ Éçã%.GÂo«×ðFÖÀÒú¦¦hŒÜ±êü`PÃ*䧺tÛqZ#äõ“¿Ãž –0âpü9pcYìÏæAš-¨Eã²"OÈ2*¹ 1:†§dæ$»[ðw¡ KŽ>¼ØÑѱž©m[Šìž¥m´N`eé8О¸ñ k: ·9Jð—ŒdG\›ãÆ:P!ÔÈU–ÔID†–íí†üçÊš,£›µ2³8 Ç´åLYÖ%¹âƒ™'µøi/1ß(@„˜ŒÜ¨rɨ c£#~åf×[àšú,ñè“iPExð–[ŽÙלÚœÁ1ÌÏÚÒf좑qã­yn+¬ÓÄ:´d†xÁŸ„…pZw:/ß§iÑ ûðÌljñ³~1ÛÕøÎ?Ë׸t?ˆ]CãKø+–ñ'D1KbB;s°ÎÇ~8uU'öâ+&7B&šÇ˜¿œÂÂ]¤-qQÇDÙxçÝGKäuO®×ú²-JåÀ ¯Od¶›kâðëÝ¥ôX¡â¯uÚФW‘iå½Ù„xÏݲÊ<‰ûá§¶ÅNŸËä üð0`w$Rè­ÂdŠ)<½DÁ©O赚±›º“éès£üìNPÍ«µŸÖ&•§ëoø´þ«ÜT@Û iEZÔúH2(kÒµxõÏÞ'hØ2HߥªÁÀ(Ó®/yt¦áCDËC`4ß4݆ß3¦BZÒ¾ýÎO!ϵó¢Õ+×ÜÕæ?XÜHPb¯éãY›î‰×ØœS#<}i÷ž8vÛÄûº"È4ÝHØQîÝŒ‹[ç9èˆxYÌ*K¥€ëvÝ8hÌÕÌcRÃþû7ÀVÇ‚)L¢™€×Tô‹#È€b[|ƒˆ{ç§Þ%k!:Ý‘¡ì¿è1áþ­3 FKW#Í\´;¦B£¤¶ ­½"-n» ·YÇ!<0óGðrbòröЮÁ7ej¬ÆßdcCƒ?B¼ýß!.Í-ê–'##øN}Ô•HÚ:£²¤‚‘|u]›¤”ò€èÞ2õ)UH«Õ+kQ¶ÿe­J¾ý¡S1`–@ÏBfºS =Îb𥠅zWB¾Tà Ä¯;ÙeT©­v놓¸²2é²5©Y#«rè+îÌGëíñf=€$¦C§æGW‰ bï,y)@Lþ¯æGFÑ> ¬ ‡}Î@¯š1ÑX×À¨i(2ñf”ƒÈBM° ™å¶¹7–0®ìáAß3ß¿Çmòõ4Þ"djá%¦‘ɵ¾ÞrC\‘ty{þ‹¢2eB±|gúWµøçŠrŒ¡Í.46'±µu¤V“r–Âu‘ðJfhÜ;&\V™ÂD]b¸ZEóóˆ—ÐW>ÌË^½%ÏàÀ‚œñ–Î40cûßÑð0^G´n¿ÑësÒÃùö•G“ÉÌíäœNΊҾª¸4Èx2ùQ†()€dÖ©¢>Du×ä3˜È—KK˜Ú–±Ò[‹Ï›AðÒ£ÞHú¹-Îô02°0ÃùNz°Î´ê°úÀ÷Tâ¬Ü"eŸMú7§"Ô Éå«A_®Ø×<"!/·$n͉ ;Ý=:‹lbC)Y‡ïmFÊ¥oÍÚË~fd  ÖŸýy›NÇ4¬PMÛಹ×ÒÆv3ˆÉhÜ ±]Žêj¾õ©¹z`ésôÙ ý±gt G½jì²É÷Jwð4~WrlwÁ=‚*ÕÉåƒ(¡G¹7§½ýÁ¿ØLr±©fáŽjr{ö…©e×m-w2 È=2™ç'‰ãŒ ¯Å¯ÈQIaDeÉâ#³¡ÔSÿ^ÉnBaý¨ÊÊTHžkçî˜ v$ä›#Y¯_¹S³RSq³w$gК…cšYAHçr4[yØÑ^õEåžêTaÛ±O¥íù—E¢"Œ©. >ÏŽ&î|ÞDXe¶´¥.æÏÞò0áO›¥‹šº¸ÄÌVËÅÊ¿q¾|?lê34Hø*´#‚Sçü`™·\­8Gdªç *Í@“çÄ®• CCÙ†=ØØ<¤æ¶ög…y¹tB½l­–ê'lX˜¿ëidVM9å)Tü‚i6™$e‡ Ÿ.³ù ¢h›@ÁÒ¼»MÊ5¾VO¡WÒÿÓ4ó9õ«Ôk@ʗɾŠ<ÎKT^ši\ŠÝ“`ê©þ|Ë{ BçK§¦ÂÄ3SÛ G ý¸46 I˜÷ã,$‹.‘|–e›ee Z–C*©Ó’Å ª MÈ €õŽ4ѪS‰@6—dÄvš„J&û¬Œ*A›¦ï8žT¬X.tÔXÏ•„JT« ݯ˜–Ö&FM.õéMB,{¼&Ä—6©9þRÕâ³ô<ˆn´s±ûìˆý÷åå·ß¢…Z¼Û­Ï.{d tu;é–kC?eâšÇt&\O-tUE¥SÔ<1ÙÀ[<öE»j˜Û ݦf®{U|n¸B)ôR/SA€)ÌÿîOsÐî\ô‹Ôè*ÀÍ­ÓÑxþƒ¦ï‰}köM³Otõb -óÆ]ÑBÔ;¬X“†ï!)½£gÐ0mBˆ5ÇŽ£¸rÅ–¹LÚ”æãi‚ˆ!E7x~³É[Y“×ÙÞ‘ ÈÞú—î1uò W¢84úò¾—hÆ{vœ@«ÙÂ,smuJ´ñmËÑzô쟟¤7g»g¿°¿‘Ýfç2ΡúnU£A_¿4q Bâóý銡[¿BÏ›n3¿À(yÏ0[æ¦y²5}ÕúPŸ4†ÚŒ[…z;»~GRz¸ÝcuÂ4š–ÁH^î͉–¶’Ãh: (ã·ÓzçtçI†^¼¥R?^¶™Iê8Ș.fÌ5hž+ÅÈíI WãÄ2(êX,8´îõÚðKÞ?<17¡©/BùÏwÒ MW}ó<•ÜYx}‡Cû¶cAãR(|^ð$ðAä8GP+õuªƒøhSÀ¶ÕéèÂWÃójœ( ‘ D J£ˆš[;oÝ'À*Œy-ܘqaÌW‰¤ÆÜ]`&ÝÆ ’ž&e¦L8<€¥2c5¶´aDz÷‡úÞn2üØ*ôÒÂf2–êʿɮ.×wlæe$4P\O ÏqRïxÅmÌA ½å ÌEùj"4 Mhy­(QŠÀ²-ämøÌ3~öd«ÓáwU£?ücia_^0Ñ‘Aê°bÿhòPѤÓSHjëÖcÉüGgó¹k@ù'º¸Q4œ÷•2NŠ(©ü„™Vn¹kM[­ŠÇ¦éÅ û>ßè³e3†Òi ŽøHwˆBaçBC;ÁÅESV¨ |Ëóañ`9‚Mú>Bƒ9©ôJ†ëE¦9CYÕ)]G}TWëtfœ‚H×±oVÉÕŒsl¿†Û ­Ô$4 ÄÎ ÿ™*&G$›g¾ØksšÑ£ š|äÑéÝo&}ÕÔ+z‘¦à5~¯ Ò*v·¹¬~T6ç2ïcà ›/IŠb‚¤ï½[Ð:™ƒ‚²ÞÜߥ/ø*W¢`˜r¹N%êÆÜÿ^Ôšú_y±÷‰÷”ñ׳Â×*ÍT;à®åÁ-Á|Oor^µx1É\à¤û|›ÀF+ÕZŠImxŠƒ«Y#‰p„^Þ{}×Ê>}Goi9m’ò¾‹—Ô¡˜¬ÄOX®é+a¿Ù “YÂüôˆ¹3FoҨ뻢x @{qrö·¼JLVɲe 2ÔÉkÀ¼OqDvú«b@‹À1ϱ”Øû¸ ça‹zò&‰’ÞI! Wë2ɽ|7àQÓT3¨ÑdK ^uÚ¥™Ì„ j²}ŠÏ).4SÎN¡~uõqOÇì8¾÷Iý3éššÈ$Žb  §Ž‹°‚CÏ>–JŸ÷@Ë}XMD<h˜Ä•.~…»µù;f¢rÏ'ãÈØ>à'c¬ãï)k@:»‰Ç½6–èU.uØdïÅãNEŽ\©æ“Dm6?{/wv0ë*¼bFíë›w“¥ëÄ8ˆ¼Ôói£ìñ)™ FýÍ›\Óp–#Í,Ðowz1Æ\£s©#…5ߌæW{t¬ú¬_5€fpSM¨trzÀ˜æÅ2ï>Í,w6‰ÕȆÐ(¶í%uÉ>™åh·D)ø")'yžÓ¯hO¼‰#aó Pýpð.a _Ô"ï¡'£¼ïÆ›^ï ŸU²;‚’™ÜtÐæ Wø"vK~.ÈDC<“oÆr¦1Êô²å½ã&ˆ¸ˆÂ;Q)yÂý± Ùúg섳ÌÏ–=:ΖëLt„­ìDŸ‘;oò¥9ùÀ;S1z¨å@òT¥¢¥§É·¬GÉ71¹8y¯×ÒòHÙPì/»hü,xó­Ñ½ Ψæ¤ÖD9x¾†3ýìœ<¬}‡0„I¢Þ³$®YúN"kW¨À˜t9NM……S ´³DJ(d•ïãm‚ÃÍ»‰‡Ño½íŸ=P«Í9ø8#dÁ×||WÇNaõ‡Ã;:m…JTà!®ýµZ0—­sÒ€±ÀˆEYwþå"6À/³\··.À*а0b"úz ½ì/SM%à þœ/¡”—OV”ÝØ¦W]íÀ+6 ^œ±ÒØMfÕ…qÚ¸a“K—53_OgЍ2@­fŸëñ«¾HÒvüÏÍJýûä°=påQ×øèáÀ¥âiäu?ºE"-žºì6™Iq-èw*…ùÉT¸èÃ/Œt´Õv0‘¤8eÈÔ¸ ¹á<ß´N¥ëÐø+‚ •¡Tƒ·wɹþe‹5Gû­y¢ì¹¢)Ò›!`âšTñf£±-×È*K×lºîŒ¶øÛ<¥†Ê¨ñê P”´Ž™äsJ Ü9{ôK‰:¥j„šßÜœZ‘Ù¢q¿ƒ#Æç£¤ !õÒgMûÏÌ«Õ þUf¥)ž¯«·I6PvÛ/´ÞÿºžêŽBcg@T3fg ÿϬƲ_ÞÀSn¿õo¤úŠûø‘q]bÒn˜]f4î5ù7«ìÞä;´Å‡&o-¡U[‡hþbq…ΰµIJÍZ³Ë®ÙÅÞÙÉW5œ1ãŽq®›ïmwST§rÞ®4«¥(W,·ÎêÉ™k—_C— O ¶G:—O&ÖÍrÃ0zÉú¦…šbM¶øá£ýæPžÖk} 3t–«ÏA-mç°Âðò‚µ"·´‡F‡h±r`¥Óÿ1ž*Q™ìó¿âŠÌÀÕa«™m]ºÔËîg–z‘-"àX+ç?jÿ¤K~éiÞ‹\œµ Þš¾Àº­D‚æT”ç,Z¤ hOݪÓœJ ®IÀå×¼M¤k°êŒï×OfB†zg“Á¹®Œ´†6XÕ»…g°+¢ŒQK·>H\ãB‡3(•õÛ§b˜·ôÜÚ‘&'¨·ÖÏ„Ôè‚•Aw1TiS±ë›öwùâ Õt«gŽ_ØÒ?ºÑ’X^ts8n^üz¤^ÞHçݾ÷b —œFG-Ê5í«­¢~/ÃgæUSÆo¹Q=鯩#ÅÝ,çï9‘Ž®§Ô¼ŒÕ Í3m"/ eãD?3*@ô£ä ° w> SÛ]Þå?Cu¤—‘Sn³àó7­µ ¿'I.ôéÆÌ$¾|­ˆVt&ÐÇ”mÇøMÔäH[R- îÂ]¹¡¤°åM¼ño¤’µÂ7aSðÆÆ_ÐN“Þ ÁpÀ™Ñ %‡ô ÿ6¦w½ätÉ)Ú5íYãËb³¥ðyá(šæììWà±=´þs“&ëóØÍÊëY$E.§9ËÔÓ4{µEüȦ¼L&Õ7=ŒGÉð]JKeÙaOO戙µgw‡ykÚ$7s˜/¯ÚêH ºCPzÞû-zV¯-E±ýYz#»&°‚Ø1몞Þô«2¼°bóú ’&”õ?H„‘è×¥$o2…€Ø#‰SP_rá6˜§ð¥D²{7Ÿ•Ùù¢9|¾ûrœ‡þS† îbvë#–¶Gôöz|Ñ+\uõ)— tz}ýŽÛ.gJ|†üÐéÌî‡qL]C”U@&„}˜£4 ¦é Œ¨bÍ/™³.¦¬hµ"n ±vÈšÀíÒý)Ô„ÃRtà FôçŠ1Ve4¦u˜òÉšž‚„ä¶ò+]“cÚd@l%ÅLÈáçBˆW¡G‰»šüœb‘ªdsxÊYž‰%–ƒºbö àŠ¡Wó¯<3™fTWz›¸fõwø , KÿáéóI}O"t¢¦™SðRÉðv­ü•¬9ž©º…'ý”ñï•U €â²§T®û>Õºˆƒ+ÍFoÈ ‚SÍ¡²ú¬@ôµ,°Ëg¬t±Î˜ÞÁ[.ÈÝ}[}ÖäUuF& Ks¸m’v6@^~ 1"²-eõc')ôœ|%õµ+Ç:Û¿É,c¸YŽ`£[GyxSœúówµo²Ô“NˆK '¶‰ìJþt•åzú*æ{iH¡ã„Y•X8¿ð¸y©¢qÂc\ð£Œ.’ü¦çù,ôe\^_¯h ¼!XgpLöê'å6½òbã6 ¯Ã@.>=YCSŽf±uÐißX³‘håA"}$вU•÷üfnzÒØ¹Dß[µEG¸V]óH÷ péYÃú°2[«¡ê;ÁÖÌÓpØZ{Þ pÀ‰Â¿1RË&BÜÚûy&SÀìgIë™$§dXªFèiï6CôA`Q¢DvœX,DïÖ¨è[>«Ê5¸™dI ]±ƒ t¼‹£ç÷sS°x3luåx8ãé ­æØ"¤˜5;‰èB®¤^̒ǔ﹆$ØpÈR9í?p #»sà¸WVa@nªö¿|ßm­t…ë™Ò“M …¾q0lþÂ?Â~–¤¸$œ3°YR¶¶¶åð7šˆ¤^ð‹‰\‚ÝKu#Ð_=ýÉXÓD­tÌxP;Õ1¤ž›ãXÛ»uÎÎÜMµFǦ=¹PÚízƒÒ3‡“Ñ «Ò-ÓöeôÇîóÞF^?gø!¼.:Ü«}ê,y‚kÉn*r 7+ltãL¤~íj…Xø ”%OB ºoŽÁì¸÷ýéAÕ‚—Eõæ ¼0XLoX2beÖQ+û4<ÒéÞŽ,jé:,T6cXH„y­U3ÁOqÊÝ_Ÿ}}Z9Oɾ>¢÷¼ö†;A#hL·/0Ö¤Ÿ«ðááÌì[¥eávÂUx»•z*ú¯Ÿ¸{0¾ (42õHD·FY¾aª~ Xnÿ|Íò|ñxPUÔ4Îmº[~áy2¡¿_žކ5ä½ÙÃ5ÐБµ@f.û•¬ïúšüùGOÈ‹Ïom ª)¤…Ø»˜è9„=¶E|ïŽHÏPÝãè?M8@ê1i3 EW›¶ÐEü¥_³‚4•SøN ”Ϻ (îHl8_2paÎf0qÚ Ÿ¦Ò«D4fƒšÜCþÛÛÛš•ªeÈØ–¾ÐQ2¤Òå{x” ?U‚ k‡¤Þ.òÔîùwŒ$œ®YO¨Œ-nZ‘¶_õå+p—÷9û5!g9c¦OJ5©çjÔÄÒΰ-–ÂÑ æ’îÆOà¾hPàµë% \¦a™î:ÎÛHìb¤&ü/E!5¨: RmaŠæôˆÞyÙŠàn¢„ùÒ€Ùp]ìtÂhyQÜe}Mt]ú&gã²°Ô:7Á™eM{ñ¯M âÛ)õ¹jwÿQåµO©)’8ð›ØamŽÚ²]yöÝŽpŸù€A4‚×6ïµ62$„‘òX0ÞИxƒÛÛoöb•˜%t‡_$ä`Cúû0&×bŸ9[ÀFòÙ `þù\d¶éX¯Pà™ ó„ŠUƒ7koëÜCÄå#†™v5xNUNj.þŒ( ´Þã*C¦vÖŒÃu©0ÆñkçþgdX†Ëà`MÝ \+îØô€<Ô9mL|Ì]ÚD6p޹Ž8RïŽaÛ¦{[˜Y²§x½¦ ’ÿ̉é4ŒÁ]þ\wÅöaÖ¤á`­ 8óÑa änÛaõ™®~$”©ãÖÀ®M‹Å„²b¸ñÈ.„2ö0>}³ 9^nT{W½ŒmJy]/Ä@ÂF6¦Ì6”B~Å;ܽîÞM» FK–ù?¶#áP-ltP©UdO†Á[ö¶Zº©e¬/Ô7fˆ/™eÞÚà ®á“-oýð5³_wˇt²Sîu`t' à-£â»‹<Ä™UÁ'¿´µŒõ1yTÂ’ôªgÚ²uÂLUOäëxÕÞǘ¸S²èQ*Þì'”x(§%+zCb¢ ý§J³ÜÓR‘YZî¥Úâ}«F«¨k'mAÉ,2¡XˆÍV†å]îüÊè:lï¥L}ÎMþÎ|Ý4 G;åMk;vTvj2ì°Qå¶”f¢&îñ;3cœB»6U~Ó¿ZåràÚHæl¹ÈZ°LѹDâNW3tBæéÔé‚uQAæÍ¡ÝŽcKýª~)8X’-ÙÆ´æ‰ä6¼³Šå A-;Ë=2­F}Þ1ûÖ‰24ÒÈaf Ç&/„±ßĬ¢çÎ(ýyì¸_Ϻ@ƒËÍæÄs¨Ã¶Ë©´ #äø;ßÒ¹ÑË-®ã·Quåš"ú©‰K«oäÅO³}»JçSÌ BuBJVÚêU/*öq;4õJ_ì2à8h‰»Ìæµõ.;=ÆT§ ãYùvG­‹•»ÛÝÝMظ€ï {Ôð“æ_c.üÆTØADÙ·]IÒ±Ù@U­ 5 ISj™cŒŸ#ï%ú@ü¼„¯˜ñ¿­×gŒnD¡¿ß@Q×K¦;îOÞ4óµ~°.Ù›DùèEM¯ªbá¦m­*â;€âèw®TÁÙ4ŸKq ;Mܼ¥Ò@C²:dþSÀ±ÔC=Ì:ÎÕS>WxÖÐ.EbØ©À'}Èî-Ñ œÛ|?hÐÏk!¨ ÷¶¹x¯BºÃáŠgÐ{%±Uÿê ôilÐhŒÖžè?ÚxW[°ÏÑd{ÄÄ…ªÿí¿…E@8I—Køášz-¶c6NöK«Ûc%;ÍÒŒâäÜ6²r¦a«eb¬ ï<°¤ÿ+^óÓç³ÚÿnÿÄ×K›uQ¥/Öç¬'ªø+œ6‘¿ƒ<Ž…)¥]é”D˜Hbfp ­:È‚ËR‰Ñ%Kôegµ0õ ûªêíY?ó‘t}¢Œô®HÌ$.H…06¶®X‡›w‘ΪáÌäªPX²¦IP¡¿Øt¸?„^Z\~Ø]=ÁÔ ¾žMI»¾âc²Ót§ï†œš¦1a»ÛÕ Â@õ§)ï”´}ÑÒƒyäuÖ+¤JÎOR«kÀ×qxÚ[¨7ÉéÑwv4¬`P2i·Cy6Æäྲྀ;wå·ÇÕda:tõÓóÖßЋúuÌp¤®Ùáá¹ÑŠÈ‹_Ûú¯ÙuæÅËÚ”"µg‚ ؘ&ÞØÓ²C6BŽ|A‹Sú”ƪS}¨n/ƯŒä ÕRÕO0@VmŸ •Ñÿ1?TÊÛ¾¢ª8ßÌ׌äîiCÖ..?[ÝÙ§VÜñ‘ó­mŸÌ(nûΘ?Z‰ÐkåÏFe–Ó¿od䉿iHêëWá´½õ³d=Ðõ5°®Ñk–N^¤¼1bz©±æ#Õ.¸ÏŽ?ÐãÝ“i¯H6ú?<Ú÷Û—kiŠJà‚û"¸“mó›|õÆ1‰û´Û¨ÍF;4«ñra’qY¿ã£7ÒKÄþˆ¬Å_Áj¾Ê|'5‹b5ußeq̨¼4 tËžÖðÔ»­n‰l Jǵ\ßm«"šŒáç`üe¼¢3‡rjú®·)š“Î.G®i¿O!C6ˆÆôyIU¦$~uæ[‹æÔ;»ìç7F—/ °õPgyXõbã(€4Aœ/ (kA¦+Ûö8Áß™q–/ŸaÂøü‡¦]¼ä5ã†Vñy+Z„x‰ùGšQÀ&Ñ—ðñÑŠ&žÊ é]F0p6î.÷i6þ…4(Ùñ”úº)þL¾Ú…ħHD$/Îàæ£Ìur`csÀÍ'[<«…Âá 6ôà˜Çù®iŽã(ÙL¸·¢Ùvg©YzZ \.¸9óF²Èa0ɱëQÚ‘2š[ÜFÛÓéW›9ž¯D"=IêùN•Ê>Âû\,÷[S™N~%û’Î,ÚLçøCV*´åK̃=[¼GÓÞB;­3meœ·ú0=c…ñä3Ë¿”Ħ0Ngt¡U"ö|¦DN(ƒyÄÀV\ÿW»TIç"Iƒ…‰ç‡¬Þç³™—†¥sî8ìkVؘ«>+M“Ça×M``N’EyÔ¢ÎÈõÑøu$\}x>Ûò±uõ¦ä<(9·;Ý+ÎPÈÝ´Ý^€ä?æŸ[pÏ;íAWq кžO¶D¯k¬›(A ÛÔ9«¨,áyÖŽ-¼Î‰ö\5•W†êê†ú1¯¢Ÿ³±2ªÍ»Ñ0²+E³ûØ–CJ?;³S|´Ö‚ÿÖï°xݪ²N­3Î,eGË£…IcR‚,|íkWѦQ ³x5å­ÆÛþÒ?B¨gò™»ƒè¶ „B!,_7;þ9" PÏéév‘ú%¤û¢{¨Oj¤"e-M(©¤´žÇÀtõ.;0ÀmŠá§òc‡Þy¬¨ŽâǘYè³+bÒ/6â?ù¢‘^ôÌlhù¬˜Ùü¡1(–Û§ó5ŽoÏAÕd8eárÕO§«W¨ÚòšûL˃§jÜR¢€Omø„0D9'Ûê# é€'5ͪë]Náµ¢zú¦KÅÛîϦŠ•ß{Tè@Äêð°CsƒÀf´Å?­ÒÖLx»­.ñ“Ò[5øeØ`úÂC܇»ïn’¹žÉfMt@Ëw°˜Bjï-¨¥âSœêÚc”Ã,Øæb¡Äç£Ù.о£ºu¹ýCûhúÍ€ñm©õ§†ü®]3-Ó®,ͧ1û+>–p4Ñ-ó9—oÙ£ £Ý6¢fg÷k½Ïè"¼ÝÞ[®3{ ïv‘„‚þyy’Ör†OÑQ;fØ%-GP®€âFꔤR6ƒïy•MеT€½¬cÀ8|ŸAVB*×Î…å ÄoÙ8qLmH Š$‰/çӑ˱P¶EHc,ˆSÀe¯.Å*+^æÌ(óf ²]éÐòk‚3o?VnC Œ³¥%EA£þÙT$ÛxÇo„ý¾Þig ñc0qê¦D ÒRþ”ZOsô‰üèWð|¼ý:¤²wy$dc¤ ›‹­e:ÌÓóEÑ|72cÞŽõ½¤-Ôð÷†³õGàŒWõJœã˜ô©¬VͦlÁ—%ühzÍñ˜?òÛøÙ¡|Ý/æÔ|>Hë/6ãaÛÑP¼Ö!ôš–—ù%<ùeOÂkèâN¤øx0ê°sˆ·ÚM5 ‚°IT§Ú ò¿¶0Vòôän7‡fùï„Ýeã\“àìØ«:̽ºþ`+¡<¼7b“²œiÇ€¼#2Äè»´ëÉy ‰Û·ðäŒd¨Üã‚\õïIÛó ””ñ2ÅÅac2ç*L.‚—ÍÈG®-Õ|ø€•”hxI VÏîp­¸Î#:€ÀqœÜû¾ÿˆp7 —Y¨ æ,°,ÚsÆ´^­ý[ÒVJ³Úh4‘i‡*C­œÃ§¸\÷FÏ®i‚¾cyšyiÍ%%Ý?µx>dÿ9£¶’[5 ¼õ¥óI2x=~Xåé »‘3fÀð6…ÎK²rµK¡Ú)[…?| <»7 è–&wÜg¯ ಫÖ#»@`…¶…«á&²¢˜4çÐØw±³~dö|ź¼âð ÑöÄ’G¼ÍÖìZ«ˆq+Â=Uý.‰ßŒöV{Ž0Kïzá!]kð:tªˆoîÎädhv§fK/=ø Ž#õ™4I^~n‹*³K¡ÓÎô>¾úðÚ§euÝ^– РŸEÌ`‘èQ8¬ÌuwÛÃî…¾âf#¿?—ÙÍÔ Ã!¥íz|Õ- jçÒDžô¶ ÆñãC5y‘þ"Sòt-jÌ©%&ÏÛ@¡=“Ý>æ7 $R:3‡I´æ‘Ùhªò.ã8¦ULi™p µ>‰Û <*ðÉâÊc—K! Pž&‚q2 €á„I˜*Æ5¤²«ä¨ÀšÊ¡?·wÛ÷MjÿT˜ƒÚDue|ùýËW¦<éÝÀI:ìÖ:ÿ>3èsÝŽy åÒØò|¼›™YëWWíÁrsš9’>óE냲¿_òwå0É¡Eb$e8~p‘º X÷?¾qVŸÁr‰_åéÕ„Mæ)„+L" Ÿ¼~¦p ý7ëòŒ¿¢5¨ç)¦À@ý]qм)!0žº‚à”îÌ·ñÌBïÎz%Là»´ã;…ø!‰¦/s·!ËœïjÄh)çQØŒs» -DÁlŸÏð†ºfs¢hh•¡xV#æ_¹Õq~ ‹D Æ’`ðcr3mÏì~*²å º{ŽIk2–v¹×0¾ƒ‹WGš”EÑxÒC<¿kú‹¢òØH{?1äëDl~{a1”Қ̄¦ÚH ËH gÇþºçy*‚xè‹]%yfÃ\KO{ÏÛêrsY¢˜†›läÚ¸¹"¥=—4šÄËŒ“…¸Ú3·|æ¾âO|µÀLJ«7‡ù“|ßþQÊÚžjåQˆ‹½ÔÊ<ë¯&ÌvïË2Üâ-%ŽP¡OpÐL‚Q ^‚fþº?x5ËêØ+‘|ß\ëß%½Û3F¢Õ*†–’nÑŸt·Ÿ¶Èõ ‘)®ÅÍ>Û®Û^ªõ4¬"ýZÖ¶ª7HóN Ícò¢‹Ê“.ÚÛ±ö±êËÆ–t‘ðò„tÜu¬'œÝÒzåAÚÎ")k†ü¦Ýz¯t›Vn›ß@"LÕñº‡ø‡¬«#yF$rVèwð7~ý' ݯnwC ŒC¾u±&ЍyÞOtÚ BrûÑXÉF8¹G.g^áu~Y®uƒ“0éàS¢2zÿˆqMдíÀ÷v‹ŠšSŠïyí4ö•2m¡µ@-XÃHwL¿$À±á ÉÐ#UˆJа(è“ßÙ¸i” hÒ!Ó¥½Ì®?±òe¾ãfi¦Ú¯ÆŒ7ºâéÕ$†ç*>äÔ.ß`¼÷·Ò5>ñ,( ë 3Wz¦°^(´¥ Ž!¨5×2g”­ÏN/RßáÒ@ˆò#Â!G°"ü áĈ¡nêÄ<’¨¹Êp¿Çõò¨T©®Û=礞r¿®•Ü‚ážnZåÛ.ŸYÜJ$]ŒÞ£9+ãÀêLKxuÙ”{ÌÕòDü#ïÚ‚Lê•,“óœí-v{1ö£ã,Dkm¯†hÉðFëÕàö+ÚaËÑjb±óv_IXë0ÓpKœãˆüFvÆ,uÀÕUŠ–§k#¿Þ úBop"Šœºc63 ´—8 Ý«µ°N%¨ïŒœwåBr ¨j2ÉcL‰picÝmݬå³lF>ô©?7Æ£bb<¹Ýö~äÀz€M€•UþÛàÁÿÑÚ¡ß{8U•Ðh¦m;-Wg5xNŠ€ @K½ fgA»QKig”ÆåÎhÒ?’›qËÐ…ë$^7$ ÑÑÚ›–î'Ûí`Ÿ§Ú48›r0a…V¼}l?{ÇVâËÄðÅ:Ø‹j_Í|šqää*îÖË&+FøÅèÎ?ØÎðó€âFÏí Ý Ì†!TB< s¡=âò¶9ô÷·zeMwÐk}7¤›÷íèÇü»SÙD»ˆä.ÑNzkžø.j-Œa׈١ZÔ ³¨çiœtJý¾®Ílé|uÄ>"<:v -`D9¨—áÏZ ©X½ÿeè#þ·éœfM0®_=;P:RØ I‚ ÇÉÈ f0Ø"½sùie‹–7 fàý‰=ÉXîGuÿê-Õ% ˜üx<ÅxæYÃܰº‚†tM…¦´íþÞ¢vÇþù…jã=þU¸¸ÖÚËœÙÒQ¾d ËãMPpDd¾ZŠRqgˆ•TV Z ñÏ"RdxØ¢ëe êƒRu.N};ü‘b•íXh_:ü9„ »wùsÐ!»×l¥6PÓ‰j¶"åb’wåùƦŽr ­2x¿³ŸP1i0w)å†.‰ÆÇÆ\‡”KÕ%Ùå­¶Ú•žzëÚð¼ iýn>Ð?táWZ| œw’ ð-©à¾GsíUÄûI¯) :q9Î&iúñ†¢»J«Q82qA!~Õ®×ŽÆ :¾\ª­0c&ðN•úõÆQ±5ë`-ÄÓhÂPôÓ«_ cŽÖ[ÍÕüÕ<ú6Æöj¤¿ûV϶I½—7ÛÎåa˜^§.£©(¤Èä~óÿ1ÿ ÜÌI°è¬9m_ –Ÿ9Waô¬Qê$»BË?Ó+¡ôkž«[zçñ$èj}=Œ­N' lñŒ¦v†—0î$€pÆç' ³©<­a1_Rz¡Vné î‡Ùþý§Ši³Ö‚U„–I¨/ÕÙ¤ÑÊ›l?FOKŸæÙ†ºÃ©Þ2C9qÖß·štWLq4÷ÎñHp¹ìFm¡$ä ˆöÂÆü@»ÒŒ1òSOÏa¹R&oëå/$8ºÆ·Û5¿"Ýå\h’(mZ˜›Î§Ðé/Ã_ihì º» Ÿ ¤gWT µP@á™-ÓM>9Ãq2K¬A£cß>Ëj8ÌmÒøoû@pØé!à0'Øfú õ<õ$Ð>k±‡]z}I÷çH™+Ùtq’!¡¿LÄŠºŒ—3½€TäuØÔìÄ+Ö¼\_LŒÁW¶3¯¥ý·á ƒ£e"íé õb“‚'|áu40HÀ–ùÜí3[ÎÕää˜×‘ܪL4?%ä~ÓÙÍì2¥6aÄ’3}7[t¯ V‰+ oK]÷¯f¼1ßÌIZ&NÔS4sGÌF ±Ò¼=F+êĪå÷mÎP{ T+M€6"pjd˜ƒÊ$†Äÿ1’†ú"ZQ}»/öдR]<×\|—kmD"U zÞÿ >öckðyö~5ž÷+—`%…ï'é(R I/(k!¾žÚpémb{1Ç—ËóðɶõVÐÇÿ|©P¹ï®ÂwPD`0ÌÜoÇ€z ÌSç\SÑòÈ%’êÓŒ/KéZÙVÆkoÀïhNèè³ ¤o[_8öt»üZ”‹ÏtGLP»ÿQDþ}]2ãWœ\Npæ&øññþãDX<ü¹¾õ¨‡þ44ºÀÐÑa‚wÓ‚þ|‹q&L4Šp“Á$1y¯U‰YÎŒšÒ*´/ù`¥TËÙj‹à¯ïš½^÷2eô-E/ávÎU¯9«;õít” …Z=VJ‹N˜Ðöµ²ÜÓ¢møÔ„Ûk ¼.ºüÓ°UÄ>xùöìžg¯6þ]9,tÓ/Ó`6 ›æ¼Äz°F­Lü…ÌÍò1b.D«ªÜ6`†¨Aá%?:?@ù-š‘Á­Æ„žèŽ¥m¸ñêâ…Vïû Ÿ8A¯ë 0®±$F9ìS“±qit2Ò·yGnÛëé†p>ÄYÎûxfÎÊEÎáðí/pÝ9å‘}’,P@úÈ<À$vZ§U#÷Ägl0ýÎõñÃ@%×Y$bE#ð3³TÍŒA¼{ #!Ó)üL™8î<g®nZ戭òÝ,Â’Š¦#âwvÅ"s>†Zöo­Øk™(Úsò5ŸDò zÑgÃm©¬ÂÕ{”üqÝŒ³Ë¨¸’úäé¾#0œ*¤Þ<ë`ÎÕØB:æ„sx2œuóõÙ‹¢uw@hÑ•é+]ZÓÚ½Ú-å&RyÅ‘•µfùPè¾\0§íw‹‡Ò>cË?eÚkÂE'“GöXÀÂ÷­LXˆ»±ˆ°@^ mýIÚš÷Å&ò÷wwð’Ã>?\G«‹Ž*Ã*Gœ’ãŸz@û4¥]K{ç÷WˆDäé~P{®ãÜ¿_md¢W5Çø @ rÚÆoêDïr¯³Äf2Dý;\Òáð„‹Ø¬Û‹‹iÛÛ«‡ìþÒFÔ^ÌÈ]XeÊ7Â7‰ ÿ±ÛÇ\ ¬a¶¢Ñ£K’H‚,¡óáßÊ`LŽ­°ö¤-[LvtŠ+Ïy.¨Ô'8¤¨ˆ &`kHµÌ¦é$<Ù°çöŽryu®9M‰T[3;kq¨“VÒѶ›*†œë"gÖÐÄ*&EóžL£2'm¢úhAï7Ľ·úR$JT¼ŠµîÌ5kPX@¢ü ;Ò¦‡œX= eï”Ò´åXqVŽœ·®ŠÀûhÞç_½š´M_bŸQ`áŠO›;5j¶–ç{j‡ï°JêdüN­×Kyk‹!U\.ZuÐNŒ³´qJ+ƒµ2ï=ã¦ÆÏI&²!ÇÛÍñÉ‚:&¼ FYŸ™FË Ñ4ÜH2[°›ïʱä¬Ô\¬x)F§ÏüTJx]Qãe`ÅC¨z³ºÉh›b}ýÅ­at×X° úmP¡Ön¯ûÀ™CAb•„òö,*u~Þh0•hÐø1‚;Á=¬?9TÓ¥šÅL0H¸•1Gê5,¾™/ìÿetî·kÃmøÉ‘˨Œì·ýgHÂGœ» ”‰šé^&ö1ÃXPnÒÈâ1@Êï¡Ó9£í’§õ„, ßûB'G³® ÉLØÏ-IƒÃ^Ý T52aqo¤] €K©¸Í[×=¸üt`‘ž»kÎ(SëùSSâÈ Ç)IÂ%¡ü¾/‹þŒÇnÒNÃ¥‚p™”H†Í ]¤t@óŽ-hM—VWQîðiüÚÈÂh™!êHÛ6lÈÞ/ßí±µdÿ1u2ØD§FgUJŸ¹?}êðPRl´!¢a¤è‰³È#bñÄ‹‰ª¾ekeê–c¡R+Æ)]VH$‡.Ò½jÚ9Ôð»ÿ×O#p} ë‰ùÐxh–×Ic‚÷‚¨d–@Öù—±4‘£™äKNÒÛ-ÄDmWå-­ÖÙ1Õ,ì)@‹g«g×P{nUíIyV‘OYFT«_ˆ¶“SBÁ¬å± N¹fælkʲ$rÚH»ÜÔ'+Ý €¤5ˆå¥A/ÄÎ~#‰Ãk€ ww¾?ûêNfÐg1ƒá…5¯ŒJÌCµX=—6ðFäÖ5vŠ<Pƒž§Ç¥‘´ ‡Ðb¢£Š¹‡ÚBùƒîÕÌvlL´ã´¨©0  ³b§°´û÷—<ºÅ§ÿ€”Ú΄Zå´â´Q3á4Ê-aÁ«Ü¤mÞ2iJöëp™i¸DWw j8)êÑБ(-£¾n6~’gý[ê.±Êa:®&LýgÔI(f¤ÖbÓJþ/ü›ÉsG éÛQü”3¡2é# ~·ÐµÏ|`èÎ!ÕaI4e&c7UMmôT róáHé{iGL•3 LÒ+®ä4ßåÅÕŽÖ¼9CPBuƒa ,G,Ñòu˜îר‰›‰ÑF@úzœMñä L¯@›Ø7¹yçñÏ!!Ùá;àëý¹ׂõÕ&©]»`â]sW©ôŒ‚ÒœG¥z̯Ù{_á' ºHP ~ë0Ý’ç@d’•üõd™1Ðu3ËÏ›GÔÊD/`’‰Éœ"mÛéˆ5€I £ôK¡W ò'½âà!꿾î.–ËQºCÙei›¬<ýÊC8D4Tòª>`ÜÃ>oãK-õZ•Ť{V”Ó¤£:÷`°õHˆH‰A­<ŠÀ'ê;5@«—”¶€¶œjö×'¶m\øªãÉËM¤­Âiç…¦h ‘ˆ Sþ¬ho B+Ýʱð»—aˆ£3í[ÍØLšÝ…ðVë"›l@i«\{‰‡x®Çò\¬¯ºP¥öónLz:X¢ScQÿcpã­ô{Í 8Ó~HeÕªI¤Ó²-6»¤hóYb»ÊP© °º7;1tÅZBçâj_º)„<–S< q!ïà e6œm¶j© uœrƒ?ÆYƒóê¾¥+ ÁäT?·]@£ºAHîÛ³–ÒÑéŽ!½%i‚™úöÑX#ÍåèÚÕé ‹ÍØ…ãÛ vW4p,˜ÛO—ø¶ª‚8Á$‚ß… „Åü@«d ­¾Mjÿ¾éú‰ö¥U—§Oÿ«&VlÅæbO¥Ö]–µŠj17Üüþ 8@ó}¿xJCªy5¹JØMÅ‘O,Û˪ð›h&Ðc¥\#ºÅ·/EÇIÛàÊ»½ë¡Õ_©çä©¿²¢YœZl[­“„ožUÚ©2ä› KŸ¯þq±³¡v¿J|ÆGKMË”šî6XÈÝ^zn®w›iÚn=á /ŒE$8œŽÂ?‡ÿsïP.׺óè¤áœmKÒþ…y>É`F4ê^ïrzS9CŽO$&ÒÍpdS`e|jâG*0WŠÂ9„>„ܳЯ¬1‚_¼ü,Wï}Q»ŽøuµÀæüä°ŸËÊKh>ðïœr?¾ýpÍ1ÔÄ[IöËn=/ã1{)? Êbá½ÓõÛ²êáÄM»o}ùÿ­A]L©J¤Ð‚ÉUËG­ºÃ ï.GÇ ðÆÌ%YuÓ£eNò!$ÂÞCÿ€ø|®¹"ž’UQð™^ýÝ>Í’ˆ©†ïàdë¥5‘ Ú5]‹d‚ùÙ|ûœ—Ïï <˜ÍÊÎêŽ=+l$h-ɼUòÐ}FÍi¨ ƒB??ñ©‚Š“rö÷fÈñ^‹»ñ\Y*®I/¹ RµR‰çQãÀ¿2²°ÉOCss0GG‹¯\9;!§dØoJªŒÜ­£=Ų ø¶[æSüÕ€ÒhŠ6îXzÐÓYz膔ϸb±¢6q"Õü5E¥Þ¥÷ Î…âE›Í¡²¡×?—G"LØÆvä~M—Àx°®î´·”(¢vò´±McE\ÎOן­ëº;y"ÅûŸK;4fÚjÇ@øèÆÔÀþY(ÉeÇôA8 ÞÓÂ47ZFI‚àlÊé-š°ĦÀ³ÄØ€Ú Òq²™OnŠi#»œ(6oͬû0™±ƒI¸ÊÉЃBÕ(Ü øüKY%a¥y•(gIɂޭçƒD •é±ömŒ|!3/Ãïa_¤ñwå#>µþ0û¦ìCÍlæBª´Ž|GÚƒŒÇ„–·Ï8ámD˜ZZ¡©î†qÑæ—Úú ä3ÂRÊ›adåZp˜†¢¸ô*5U)*Þá"èpVh7ºJ_®Å§âß³.7äÆÿõ×Üᓲd`ÊÑ9ø!‹¢Qp†Hõ—UC†x®àÛxýꢡ¦C%€ÄëÖ"5íkûÏ}Ç55186´;€¾dǼ€çýq”èù¨ò¹Fø†M$"ÔGuy›£¯²`+¤¶/†4àQ÷™G0â™ÇŸPÒ¬ÏÊ14U¤ ©ÀN.È„žb<\˜Aº£-’&E~ ¼f…uFE¤³9TZ.ÒÒRŒ»ámÊY{NHZ›òÌvé1‡ç¥Nâ~‘v\ Â}À8Ӽй×ÑFvVŸæ 0=qdà’ØÚŒü¿gLßÌ·ÔµÞ¤A Ü!+ÔƒÊãz8?M' oU´™0Å}XÔf°Ú„ù”Cñ>  ,ƒÏݹôN¯ú>¦Œã*ï× c« Ë®­z‹«·‡b7Í;«dy‚+Üñ Ј³vŸE+H%_¿OÌt{`Ía…-f%{í]–ëƒú‰ Úò÷J?å!.mÞNÈ c_4CÉ(|’7žØv¾™k$²áêe#ŒðCˆá›î²þã¦áað/è’¸رvø¦æqéÎÎÍ­!ƒ²·I°)æï ÁP³§!&¤u¦u’øu¦xúµžï&8quÚ`NÖ¤øœ–øè±¾Üd!\VZµ'­¦ÙŸÍ^˜|îwÎ6³Ì¿,ÉUhð ñ;C†:A0ñÓvníÁŸ§ÃÔXn]G¹(ȸ¤"äv_£Am§£“®˜s%Ÿß`|@)¦8Ëà †Û^5×Õüýæ¬Tͬ+2ëq™Lç•Í:¯½ÛW˜v*Jñ^=mý܃ƒ-).Í„3XÝrKööré6ö*äÕ^A¯„!èÉoAàölË^[¬d'9T]Gžœ-–$ ¢~°(ãÝfˉkÔ†^°B%P&«È 8ŠãÌÍZÛK5 %äb߀LÆöíë~i8vªcLAŠÌ»cHRÕzr…WM œÖ oÜ ${R9S*v¤º·¾W5¼˜AÙDЙyÂw²}4²À£¹¾ŒþXXþ Ä™aYˆk»´àÑÞÚÿ˜¤sS‚ú¤j­Ú©ñ#•”T ÉD„´åg£ù£Œ=*;ÆË¨!ƒ]@îÃÜV'ÌÜÕÐFiHU Âf騧0†IxMÏ"Ö2ÐU¼nÉ—l1ÜÓO!kŽúYg^}QY†¼ÈÎÝ6ÜNå÷'IRÓY܉ù["[Ø‚kRª@šAÙ3²,[3°„ë™Ñ)¸MuT¶ðê)ÐoPXm @t¦œ/{u§Z_ôQ/ô휷.ÒwþtýâÆÌ’N¼à8Òæì¥¶¨D8ù­(Õ®¡üt×Òßǽ~—¸‰à9d±SuüÆ›òDyK›‹*î¨KK, mI·¡J“ÀÞ_B âû¿wDx÷©¼­¤( ¿‰U~î(ÔϺ#²´Tï½ï¨hF&Su² ØÏ¯RáFãxÔ0J¹¢h©ð6÷ÚÒª†ópXhsZ‡R·†ô“¬ÄS›:çHì&áDŽD¾9Žd´á‹»©ÚFQÎ&Ï ž ½Ç¦1/Ñ‘Ý?ÿˆ61·0Òi@¯‰EPÈñÇOVÏM ©IŒ@Í6à;ù‚.ÃÝѬB‡®Ž:‹“¸#¸ù³k}3ø< ô8€¢¹ …)ã` ¢{ÓHW…ZÍø¿ð\ÜûO ¨9ŸNã^êˆ ˆ])ƒ_f&ÜÈ©¨¯ Ú’ù†0Æx%ãîGi.È©Oóíd Q«n`´usƒYÎg"Æ•æ>€‰îc-Þ ÝXÔ…ETWN8cH%_³öwߘ¾`Ú>aÍÃÇºÃø‰Ë¾¬}+”X÷ ƒ¥Ñü`s’ZÜi%`ç˰ñëémHï%›ÎNö˜OcÇé6 _Å,Õ çÞšlÐ¥lîs=!ƒ<[Þ)ü¸Œº® Qœ?yä ±á9¡Ž DÎ]É´Ûšh¥!0#ˆkb¹?IJ“B”+â A£Epœ ±ð rô]PI ÈѲt 9í©3äDbð`(StR7y&YÃ& ÄÀlc=ÉxªË®žâ¼9§%èa†MþÆü­+ljÁhäd5$ŠÌþ55SÓoØK=ð¦Õî…Þ·HÏ Ù×Õ£WRG„ƒv àõHÓ{¹´ñ‰Ö¥@â×ÖñÕ¼ÞqÎô߇ ùwYšÈüq)§&(v'']ð 9"Öù6³Aü£<Ôç´ÿúȃ>n›×ÿŽº¼Ç“GÕ‡º ?Á7[ÙéøÏÃf#f!Ûqª¡&O¸eE¦öUSi£wÖ4­ýëæµas²‘’ßxøU!ÛŠ#’>‘ˆØD€-¦æÙ)€ƒ Zþ޲—¥ ‹¬Z ÍÏNÉúò¨“¸ƒ#º+nòV¹„ (s_ñç@ŽÛ“ûÖÜê4ö#CæªSÎçf£_œT[%Ó¦ÜkÏÖåì–¢áÝ}LO'õú„ÎâD0óÅkE¹LÆ™muéH×t<¬Æ/¾ÿ6ŠzÄ×ýuåT%4ÕðZÌF4”%D9ÿvÿWã0™fO ž¥ABá Ì$ÌÑ9d é£!üÉ›« "ö ª´èà´ð.øAŸïSŒ&|ò¢y§eA-ÏÔ̦ժx7 Ñ8ßjØc茒Xãá ª¨‚ÚÁñ첸¨øúÉ–]Zn]8û£IÁ.OÍû?ûØ$ÿÈa.Ógéä›g eÙmw|”WvÈ&û;–‘ü1 HªãÙ÷jª—˜ò°àÁ†WnK?®Bª4Í‚CÜcú¿Ôþ»ÈdNkåþ?ß³]‡Š{œ÷¬Á’HðQtqÚi&c½ Xµc·…Þ¢íË|øŽL½ÛÏÛzËEb‚ÅS ©º21;ÍZ.ÂÚ~Nž!ˆŽXŒÏ©ò቗ý=²¨%Dq½ôuµ×2aW£Lä‚[ ê~B¦|4 *€fuíÆÕ`fez,[‘ÎÊ©J¡“xn ƒïë’0Íx¡Uè(½wU’Â52/ Cjpªi]§O—¯J}‚rÓI#-û£y‘ÙÞ0‡.ÌëÚ^¾ìH—Þ§8 »ÁaB…®PµBúz7:;ÇkYDÌú\93²^hæp¦„8´_m8Ë´¼†2½¹ =¿Ö¾ã6Ÿ1ëóR‘¸âÝú›ÿRÈéèã¾hÌÒ³à_]Ô}ÐÆ{œ´Þ¬‰¦‚^œô™ÍÛh²ÉlÌ¡’Ðà›&@D{In)°\è]Ú+*$ê6ïì¥3e ·b]V=Ó…àÿ!¶ ¿…WÊà 2B&¤ fdOÀzôšFûôe_i8QöÁBOx‹áF¡KÛט`ToCÑâ“?4<-Æz%"ΨM’ "²>¦³k9:T;N6GÊ`×#“hñ_ãÅ?G~·›«¥ï©Tî~“V£Æ: Ì€×0õ¦o\41"ØÚÝ­Nåw6Ùea"ï¦ÿvŸ±ä䈶ÀSA-Yõn±~A{+‚ÛôaÐåX‘¥67‚î2¶5cîeBµ\öim)—¸¯àëSÆMD›S£ñ"wÁ@ï8ꀉmV2÷lõR¢$‚QvŒ6£ðcÖ6õ(£)PÅ_™¼ë¬ií(!Ua\»˜ÝN߈$躅˜ñÇã[)€z'5CLâµ qÞóúªe˜Uðk·så“GÁ_µH¡ ôÝê<Òë‘Á×›CA™‹Ø4>ïØÁw> VqºjyÆsžÙ»~("¦VÑ~šÉý–`>fÝ[e´Áäá–ø\ º.u—¦±²j€4”çôGC<’§®Qù@c-NÕk‘gžï¢ð‰Oë À È¦ê­xlf…zȘaY>A¶Hù3èPž£9ZmÑåuˆã„ ÑS#±«ÌÂÑ€¤v£4}œÄˆg¹=±´.ü­‰ˆ'|g¹-"ÜÊ( âÊýÂØÍª®ŠÃ“vP]N´(vû•glïú_Dõ«Ÿl>ãµ7§†\ð˨jÉëý,âÐ3Ì=­Æáµ½!à]5èytuZÆþ0– í#]à?3{ÝÜø …*¥ô‚q•QçSÛ«üÿ'.šÃé0²às_êf»þDÊš{3\2"Ûæëi1~¿N¹ˆ¸ß°¬TurYò0ß%4ßÅ„½m°ÖæQV‘öă(À.„NáñнHODQJlÿ‘ê8–ÛËf…Vß»['ªt#Ö«êRi«±þFBùßÂÄ·êß/a"Õ’tæ)¹ÎÆq¨1"”«kØÕfUÙk6ÚÒøeM%öà˜±íqÓE…@ŒÆ‘zT_@óÕ†VY¬|¨šaáO‡˜o褘ËÔVñ5ÜÒCË ˆŒ[K¿ÇT!Êžb@Žbžh“Ðy¢ÖÂ׊‡;”¼ý‹—!¶ë~„y¹µ“ÄEcq)TÔ<|a xð=‹Sáä’¿þÔ±WæO 3Ÿy›.˜àééŸ &a£9æ«X¿=4eš–VØ$Û¯Þ¹¡ß…ã|z|Ö´ ¦M­|‘•´±­F‚·È))”™‰€1}œY{  &ú{l_8:¦+i1‰£C‹‹êhÖn6¬Ñžr ö€9ˆaÅ|]qK4Ÿ-»Ê¤z·<–A¿T½º´ý]Bn‘œ…ئ‡‚{žâ°Wl¥’-IkôxŽá^š;–01{ÕW)ã•*Sö¯7…ò’#¤um–Ÿ'éú»ü ìïíÒÈ7è¿ü½¿¯¸Ìë9ôXV,^6:YHUjôŒN(ùXa±Ê/ó«"vØTü"ÛšÂØ¿_ýVMØ/ÜW¿Èªårä+ÐÞ[Ê"Õ¸º Úà˵ÙÁAÍöæ-÷ §¾Q>$¢ZA`Â|-P¿ò̧ALDO“«5áñþm&r*¼ÊcWÒz÷ç±²×G‹â5˜E·‰í‹—# S\丠úã.\€œr_NÑáLî—îDY Fš;m;@÷;Ây͈”Ý3œÿunþý†Rì_•+œjß„À}¶H…t7f| ÊšWŸ@ìÅo,"ŽÞ$èá3øR5<ŒÑ',D®Yù CmäÞÚ-ƒCíÍ\(ýt|˜OOܸâ÷ìk"6/†my@í„/ šƒd‘Åé:F¾|PëëU=¿óa2T!²êXSx½[#Ɉ&¯&W%t˜Ý,SÉðZ—ÏjA&\Íæe½B5©ß‰4Xu¯Ãi¡áÍV'¾SøIfÄ)kâÄ! ûF­r#âGÏ"7o¹®®‡Àzt“dÉÓ…ŠœŸÊ€ÝøÓ‰G4*†¾þöî;õË gy¡ŸÃéÛJÎì›9Ô•xϲtå‡è §cŸ†1°C᮹iB‘.¨=Ö©œñ»: Õ—&²~kºP'šhFfpý¡"ˆIUÖÀ„`I–`XÌÿëÊÊ’ýž\ž¡ðn„o£K0 +þäß©²tÔÎ WÛ41^zôº¥Ã÷äå±1 Li%ñ'1:s¹ÕŸ#"„áÌ@ífe¹e+fŽ8 Œzsµj àF‘°aq^òp¸FÈÊiÑþî ¿ÒË”‹vÒ Õ€+èí¨¯ûYdÖ4œ‹ÅÐ:éXFcÇt_é9Äô¸µ2®.¯¼›¿Pm,ÞçCüõ‚üã æ“-ÙÀa“1ë/T‹Ê,Ò¯Ê)×T–€k;ÊH~½Dð1w‹O¦Œžj‘ÜH.þ´e‡çŸ±–™[C˹ž¶ÌQ7õêìvhаyeyü’ÿ¢CºžÚ¹Žk28Þµgh÷éé'dˆ 4«ï×¼êéå2²›n¶“1ùNãCå¨tðÕ=/a8朴ãàévA(÷Õó˜Á·b ¸f3%öêì TÐÙ‚sǙĒl—N$nŒdŽ'åiF“·&D†È[îM5Æ2Û™Ág5©Û³Ùû«´çoWT†C9jÕ€bï¿“1¤å÷(DsãÂú YGŽØ`ݺO‰•q€û8õQ%%ÞÃwØ'ûÚ}™¯Óá¸:—T´}3nîC$˜>™þJ}7ýÒ¹˜è‘ÿ}‘ 3§Ì½ž4ÆPž®…-©U«œæ­§zÚfoà”õPgx.™ë3:†ÿ¢,-±ŸzÃANÃùî±,£ÍEUí3búÂxk‰Âå?•x‡[kçt¡—aÍÛdL5Ò®¨ÅP°@¿Øÿ¼Ëã¾Õ+(¤‡½RÑeNwŠIÛU),mÛÞéºlî|t½šŽôjwÿÒßá+鬽è†×,LþºR­÷ô²*p¹BY-3Ö·/ƒrÏvª¨–—eñŒ=º^ä5]ê8±ç +ÒS‚óÖ}Iö@é&$…ñHD¯Qè[ß¡V¬ØxdY1L¹â#F2Щ Ç»Sa€³½–ÄÁoƒS-fdÅ.UÈóüÞ€4ð´QrKú'úuœSa5JfäT£³ ¼ÿ:¥LÛŸ+¥/¤ïmMÛØuås26íCLX ¢Pò3ùáâËU-3(9aAÊÔë5¬Blž$và6E Çê…N¹4Ö²’èBl€âÂ2˜QåÖélT¼xáV&‹~¥å; á·èÇ(ê¥ÌG)‡âcq§ò–ULº¦Ò˜¡µ*U2¥',dQy߬=ã1å,ˆÜ…Ž“6ÇÛkQc„ŠgÆ‚L@õbÏ‹ÇÇþX+# ¾jRžú< ^ÚÄdÝ@N!ac7j.rƒA\¸‡»Å²YÜp?δ‘ÊÕlI2w±ËªÄ ˆµy/½ÅÄ´¥M ‡ªÎ½oÁ¸ûî•^üò¸0¡ÆgRt¼N2ìñ£ô³¡‰’«õÛ˜J¡jÀÔ©0ºd|Ó=¾ùrí¢ßâB™ÍÖ`Å™ Ç>°©Ãy@ÿÙæd\§EƳé¯$à°‹gÝ‹w2ÒìЭo}ÚøŠæˆ}SF“Žñ·Àžû“¡ g޲ʌ¯;fel Mæ²Úð8™„³ŸæhÀi-C¨·OöBÒ`ž²:QçF©ú-*°&$i??)›)¼è ü°û†wþÔàÑ}îGLÇÝY•öXÊíuuñÌ×ñ¸èò¤G¥6äÙ•[lÙØ ä¡×£h¾ó×ExrFA絊í…Õrâ>g즧Á5=³¸5zj”/…];TFd(~uK|ä|"M}ùMoD>b”Ú÷S,uãä²RÌÉÖuàdš;"™@՜Ϙ‘†¯rõ‡C4wXOßœJwCw4Ó˜§~eÂp'7·Ò„ñºm"ÉW‡x1"ÅBœÞáËÓ,^80ZþŸðÓ\žýU…p¹ÁövþŸ1ènD¨o9€ÌØ‹ÿø4¬‰y5"!Rñ‘¡Êí Æä—á~cOD«Nð}(ÿýwN\×wcÈæÌíÝòºvÿ3Ëα2¾UÉ3ŠÌ€¤·CyÂxŸö½INfy\¬d1Ú²ñ'›ÒÈ×p‘¹Ú¦ ”¹Ê›¼K¶ÕË_" ÓVo‚9í^ñlÁìæË¿U¢ªŠ‘:ꃬ¨âžô/štŽ:{zúï¹¾½¡`ýp·´ä‰ãzbb! ä% É:þŽ^ª÷¯õ@^ÐL]ܵMª[¡a³ûíB&#GW0yöÏS‚íÇ´. vóKeM*›ë$Ÿ_WÁF¢f¯½‹iCwõëäõÀ¸º€kCI¸Þ¿Û¼·N.›Sâ©blÃ]e4 :E¥]¹ƒI¸ëÝÕËÁŽ¡S»ÌBÜwÎPר¿¯œj² ¼²¨/‡EÃ2™å†z®qxÄuMí;ŸMº8©`äDöœ=©oJŽà½s%ƒëá×ÂV&œ÷¤šY¹OâºÛ*¸CA:Rd†rèÓã¤=ƒ\ݯ¡¸vlj/ZiÒ‚‡-×ChÂÓ¦KÞp·ë[CØŽk¨€(ä*é[Æv?ÙðÈs%•áCܬV—t2ÏÁ«`ÁX¬ƒ€…/A{…O‚ÇoµC8¤&çÜ‘E— –(ÉÝ:j'»ƒÔªŸ³p3%Ì ½Áà%«&¤ϳû¤¯G—@ü¤ ¸/¸æ³¯» Ts…í"P{âr+წŠJ}xTg,àÉÒÓܦ‘BȘøàÚ„…^ó]'×Å`¦)IpÛåŒ*¤âtÕÇ’#³‡ú÷Ô:°|¯µuDVŠý7I×z³î~"¯ÂÁ±h ôÓsÇjõ³CIÄIÕÆÀdäLÝN- n¿ ~¯š³›TeòƒJµÊ~éuHMXÓ±qÄ'‹Ÿùšß3ÒãûòPóH§þÒ€—Õdf;D\ȯ ºÅ¢~ç±S€`±&@ݹêümÛ€T,ý`&µ*“ªntphtM3˜øL÷˜:FmÝmzÍf[§áæטß5ÍWcº •#‹o‹ ö\¥ Ñ¨“]ÛñÊ›lÜÉÂ>ºE×F~r ã ÛæËoôƒyÄ¿é66Œ3_㯠»QF/‹WãÄìÙ€sïÐÍ·šY%W…'昊Úàô ÖT~¶ êÔM×ß ò½M*q©j$o"õ°‚9jˆÍª¥3iÕf/Çeq°ö¢Œú§T"jÖç ]fÆRÊI<´š7© ÉSJy­ƒ´~¤öûÚk¢¸§è½¡bg)eN^ŠÎ×HôÃbÍ-ùõ€cØml7™="'~únYóÿ…Åç’‹[á!¬}®Ÿ®€p’—ÿ÷Ø_Ä5\£™Çq;+ vUµT0$æ€e9H˜ðŒÈP¯q3Dãö¦kŠh%Õoßèa—ÞãPø×&›cXN¼±_óÄLy…Ï?2-HÞWéñ@ï[™q{á;YRF.ÍdΤ£&=y6cÊ`Fmˆ,œ‰g.øàÝ(r>cE§R´¢Ï˜Àÿ’¨|17زñ8YŒ­oÜm‚>:á*é/·š÷Šj¯­VŸÉÐ’´µV‹UÖN–…¥Ç€çáW§,D£ÈjÌ™¢‰F9úóå?d„úˆöRÒé ²âŽ`^QõîMís•Ý33§KðùriÔþS¼Í^è0ê”^Û#ö0 ˜úƉ¡†—þ¤XÒí5$³±c›ù¨í\Ñ'ܺ-? í™ìÍ'W‚w‹,Oœ^ ÷ƒ|F¯ÊÔ­äý‘Mó1TIJÉû’†l§ÈzóÂ4*§­ÞݦØb†ÿg™~4|÷:æq#@Ò`M"Æci ë¿y%yü¡¨tÛ3øûíÈÖä0[s}Q‡{®×ú ÓÄÊA€w|äA¨ŒÇ·”òšu¾l!¸×h£Ze­«tx}õ±ã)û4¯‹ìOmô;†çŸEÝ{^MªÃŸû;xšúÑ࿽[èûd¬/¢ŠRíY,”à0å½cü݆$К3#0.ei×¶¯%JŠù\ÕT'-§o›`>ºnctÞCd#¶ÈV@cB—~%ÅÖÙLñ?„A´PGcÃÙ¼Þ—£#O•âd9”Ä{µYÍßÊ2×TnÀ*W¯Ï‚>îz–i»ßæ¦D ÚS"Ù¹4ÛéÄN‡JÝú씞ä§,ѹœ0JεToé@ŽSœP+^ò¨´AB`jì`ûa»1~ØzÔgGƶK–hà€â^à^™¹Í'êç$_+'¤çª…µŠrKlóH¸@uÃyL ˜_Ne”9ô ppAHØ$y¯qe ŸOéÙ˜ã”Ý‚Ïj]ÏÀ<,P=~•Kg"¨ê½ï ÷#ØuóèÙ Ï+À$ÓdË®­gT.æqña=c: è!Žï¿ã†o¾ß“D=J†´= ?* €½ÞµŽ×ECnÉpbï]Ûw#¹åže‡–S©•2ph®;ãêb¦-m†!Ÿ,'WŽl¢D?oÊX®xF‘z‘y¾ ¾½)q·rf¤£8»¢*²€£Œ®¾|¥ýŸH(ɆÅö$ íÆe‘ÙY)-°ûl^wf{ ±\Òþvÿ¨MáÓ2á=ZO(š&ÀiÉò±*Áìlÿzãß®©ïÐ6+¢†U¹Æ‘Ú"V<~ľ ½~íî±É™± TõŠÕPóÕ¼Í^øÓx1#ÞÁßSÿÚÞñÀ/ÕeC3öxÁÓß=ù 2¯QLŸ÷"]‘ÁQªR{ÆL¸ÊÚÑ ŽûÁ‡UãþÕ¶‡¤ó7Ü¢Pgà‹3(f³h@bÁkçד´üZÁñ ë ø¶ú¢NèÊGÑ_O5<øòΟBZ²)¼üÚ}miªE#Ÿo6Vë¤È³&SÊí°<ŒŒØ8íˆÀöàL²JbxQqOo1P׋hd:JmÚΦ î‰ám´zþs°(??qä¯s}’ÄtT)Þÿ8éž…¼].ÓqðÃ} J a•¨ã‡*DyMÐrIïxkŽn(®aøå/„½è÷$f­¿Ñ#Ý줭\ ‹ü²Ì¼gúýs¹b\¼.)×[:ÅòxLøa³-P9ªœÆqUL¤âŒXo”ÛÇ:YH!è€s^­ežª>…oàDg_1Ú“«÷B¥\l¬¦XË!\^¬À±ö0&mšQ\õU®Áå¬BgWÆÕùƶõn×óö±¯Eã Ö1Žá B+S †’ÑÊ|¸™ºj;-;}5în¤Áë`šèö>@øvÐ×úG<é…¯LÌãÀh^øÁdm£H ¤j/l4Ÿ ˆ8WŠŽP¯Gj²ÞÏŠ5Â@9D+”¶3\˜©c†²ŸÈA»éžÒÙêf»±;ƳævŽ#ý•¬ ãCÄ5›ÞÚgδș±ÅŠ 0ÒÃ´í¦‰êRŠ÷¶` ,™ãÒòä_¶Ñ›Š“ñ¥×?ÂRF;¥À#d$H˜çÏ®œœ ´€ûþA_R5ü¦Ü²e$¢ch%Ê)%¶uDÂ…›j4'ô}MK‹Öz zÏúþD~JÉën9‰&ÚžƒåžÙAGÁÙc{Ø¢ŽÝ°=LfSõ~å¸sj)ÖŸ îJ‹ž·ßxÁl—¬e¿¯’uCå7r‹ý³¬Û=§m´åì´ÃŠu…W@:Ï¿Q¹º*·?¾o…Ø4Ô$ÙÍ·©Ê-ºÁÁˆOL8³wPqöxÇh¢£³œ *Ù´ ';Pʧw—¸£ò¯¨§|4YäÁ«¦Ùpâ¯ð:– »®åÁöŠ#YKí¡™!„錚uF¦%Ä/`‡!ªsš©Ëh¯!’Í2¢.éù“ó¹ù‹ˆÈo€¨ºÎ OQÏQ1Å”b1¸­»ôá¡Gc Ç$øF ΑDZ¾R I¾¼Öñ|ˆ°¥›¿¦Hp¤Hè¯U!œËPä^åUÜãC¼ÓZÖ£ —ùchÓz¯»UJ!®h'Ò¹3Eãõ 'UÓ:+€èi¹³ŸlC‚~Ü`DOr‡…’¢Ï¨ëmŒõö»~ɼɕûšZˆÇàý_ua)˜àãu×Ûɬö²Q±ñ{Ôðt8 ’9^¿«"Ž?IŸgÇWûÐܬ6¡–‹Íy¹ÑDq~1{Kêq¿ýq8©¶öæˆÊ¢7ÓŸŒÝ=ÐómüvF)d3…oW*­¼Vèc¿ó,¼+Î^ µŠÎwmäêB‘8J«X}ίCö…«­‚"þë‹Äª{*ˆ/Ö*±G x,#zÊ£2¼c7% ®<<‰?ôM‘¸ýjî-³‡ç# «mV»6Q÷îµ!â½c[(}Št*ã—aùÏǵ–ùKÇ‚èÄ^à<§U7t·žtJŒâ­:ðІ·4ÜSÒµ ºÚ)£îÁŠuiÁ&|þÔBlÿPàTh½3Àæó'÷E¬¿wÃùøÃ4<вÙ|S‘Ù¼;Ë|‡&¿AW¸Kã¼´3ÿ°p}¦¶eî9ÐN© ߣ?¼óÌaô• z¦7yq½™Èí–iCò‘a± t%ƒïFcSí*nŒðÖHÀÙšG[YÌÎV#D ³3+ͯG"åüB|¦™øìöÔUWT+æ“®1”ê~ Ò¶Ž¦Wπɓ^îV¿ ÌöÏȺŽÈ GîüÂÊ~Çú,·ý²ÓÞ2ÓCõ>¤†L‹…l}x­ÊI3JÚ‘—Ï¥°Ïo!ËžÄÐ.*àÊéÌT)¼º/+Ct/‚ý¬¿k¨¨Tx]ö‡eÄ“$^ ª\4ÃdÈÂ8»E`xœ7vˆŒmA Æ$A‰Š_R=Ój{£SÏáó"y:©Ù÷ÿ™i¤*ø¥hOÂJN¤O;!°ýsŸ€ŸìN B5[ÉáÀ„ÄkÑ¥K{†fOÅRáöÇ^úÀX®ÝÙ|ÃŽA)ÍBÙ¦uýÈã`eˆËÌd6å»§ÝØOVë;’…Ãm&hëÒ ¢½~¸’óìG#xð„OZ¦ü¡Hjæ rä‚€8ºEý‚È(ã£ø%| oÂ\Åä·:"#c×5dŽ5¿o¯šäª_I+Š?ë¿5fPy)0Ð$‰OëxÃáyN^Ίȹ¹ÿ®Ú7ûç´–wUçÔûÂʽz‘ë[ênË+_‰º¶õ_Uœ×”;ÝDJ1„¡o_õ–©j¶/ÆŽ:íJØþŒEf`§ îm‰¥J{3.³EŽB3Ù_5j¼)×ÂD5ªP?YOµß¿Ýà<;ó.ã’à„¶[ôšÁfã?_“•,ÖüÝÔæ ø_°96ƪÙIÝì°æ½ßK‹Ãp¢;'–oµÎs,xêä¡QRêšdžù7c”Š æ¼Lš`g%„lPI°©Kï †­µ݃7òÓŸè%¦›kxýsoJÐ÷7Ü’$ÕMbä~¦0© ?ö ù1ÏUFOMqßZ’@Gq¢Aª0á#¹dÔY`þ­íow.Yœ›LxôA>¹ "̪.S ¥“Ò'h¼ÖÕ†žç¾¦Î"7üصscÁ¹Ù¡2ž-5îò¹ò( ¦¨•®ÁäÏÊe@\‰•_§-}|ãô¨: O©ŸT˜ÀîXÔ€Bˆçf[¢îðüE›03ZctôQ=vM"þ—¾•~ïÔ9%•#â{Ê‘çÂ¥è1ÞˆŽI…©öÃÙD¹K—t‘U¢ãàfÜxAv *ó0´éz®4VsòºkG4KµR&ìã~Ó@½u|ö·3ȼӶøpEÒ´hL†Éâ×Â8<´: ôk›uéž¼|‚)´2 {¡.`[˰»…³Ï7~:Þ­[¡Oý˜“Á*^w®¹ÝM$9ŽR`ú²&ß 5ᯮÿÐÆR0ÊÞOÙi†)ªÒæRDÂt;Ò•Ñê{Ìs0Ë@cV¤€[D7ϘF2ß`ö(¡£™©c£àqìSà/;Ö˜vÛà†îË\,Ó:ÝлôT MkJM'p¥[}¢±.÷ŒE?%fpÂ…%ìa2Øúä;‘{ÂÈ"8ŠDwþ錚Ô±Âüïø¯î®`Oç¼OCsùÄïßî´bxqÿP÷ÐéÞ£wá‚—±;0ÕÙ=i¿Áüc~k×\™¾‹màËykܧ¨Æ:*Sg üá;|#ÏV…2ÅikMþ/–Õq€’d0°1ÓjãczŒ>í‡5í–f6…X3²¤8%}îý¦hß$Ôþ†¸­°ØAøÞû[Gzp›†Uýg‹™Y=‰Ô ¢&CžÖ{C½À7;«ïC½ ø)rxÇx—DÊpÜ Ç3‰²¿~‡¨SšÏ»Ì¦üd)]ụË+yfJˆM%𓵱¤!ñ¿NÁâÞƒ31pÄíŸÜê*SB¹Í!¿’"õ &]i¹Jè—¢Ë}0n BÖ ­ÑðÔMü.D* Û ^CB³¨&:Å¥ÉÍã§L´ø²ñU~éæ·¡»\÷JÕo%Ð!P2pV§÷c¿¸½ÝsÛ¼ÜMjàœ%‘ ½^eíÜ/+à¥ãÉ{{ ¬Z$‰øÒçŽd½‚«Ó½Õç‹dædªÃ#͸‡ ‰&ʰ驼[zˆ|½ö#ç¿â%<œ‰MQtL 0'šã}ì#•±ÖµO…Ë\ +ûï?ÌÐB'‹IœZ«r@l"ì[}ƒ–ÌŽ¥WúïBï×õElò8›^¾òK ?ò0ˆ)&Â8A\Þïî2ŠÀfΧ•›ö"PL¹ÿŽó,Ùó¥ß’ìŠÇ6x†ŽÉÖÂJªçáÕÿ†ˆ³©u‘˜~H: ÷E‰òh¬œž¥šcg‰ J4tpG¼ £M2Cî`*ãj‹,µzžæ;ÐÜê*bXR<¢§›—ßYî=|žh%æk¶\jnÅœ—7´ª”§ÞkI+é¾þÙ¡ºÝ›^µÛ|{æ‡'Wu)Šlùr".ÓUÊA6oH¶?`ÐôíŠÚQÒW-šŒ{(髱«ž%œw‹ÿ6¸'to˜=³mS…Mƒœ±d»njÒ§Êç.lúˆ5cA¯W!¹ýpžc<… .­ÆöSMjí&SÏBÖÜŽî b¸øw¾üÁ«Ëº]†JE3žZàÝ=¶aûX²»y1Xp¾÷LéÍ8%Tµ²1Î4nÍ—µ1²NÑRë†L$¨\ÉGWødÀØ3›ä$( •´ûNX|ú;\UЬ­Ó˜<Ÿü·Y|ÀædO{®€8 Ë‹%÷5Ýw†x”CáñJ±[’jÅû@ýëÅÖ\±Ò 9GÂ'TfI>ª·«lOæÂÿ¹Àp@€ˆ@ÍXßQ: g憱P¹PÕp*ÿ€Žë¬J탱ÝëЈ³)4"Ç> _vuÈ«Ò+æÇ‰þúT°À#Ç]»£¸kÃßìÿî: °[Å)Êä½û-ƒBjÎ8èc(ô2`v…àÇêÊÉIrêOýìvvH1[R²Óþâ­Gо¨dÍýª9~À;p,ë„}Îä=§€ºW€m~$«aõ’uß+ó'êß6«à§?tGe $² ÀP™l¿e¨Wf÷~®¹A ºžD‰¥åcY£&*êCöÄXï|_°PÖJ %4v«Ôfâ­SBü;<úƵÂþÏáéOñ“Ui´QfˆùHÚŽí3Ëõç½ /: yqã£aÞªõEñÒ3U%’mþw?‹Mù•–»Ö½Þi‚èsÉ7@:¨£øDÕÈ@ƒ¼„rºE×¶Ú´žâdO8ˆCýEÕÍò~púÇ£ž ÆÎZ‹aƒá³ôüÙjÜú3»7IÃb¥áI—\uÙKºck;Š,¸k<ÂÖëi,ê¯Và®u{ …hFQÏåÓÔ&GÆe¦óÌÕŸ‚¤áx½NùN±?ŸâM‰NñcrlÂÐÚë0W°HëöqkøÆö,Ói ]¨‰PÄTòËý`.3\ `Gñ ‚ŸN2‚8c¡‹µ¦Ó’°Ü!â±:W]JžÅë¸*é¥ßé 59 { —/+qžý†ñ-z’Ë÷RrØvé„s;4ÈHŠè1ˆ¶:,ïÀ>^Î$/f– ž“’«:,zkÊZ¸Gyn!½H÷× ÐIS7i ºQÙÄñ“, ÉMn@¹˜tz0ƒKë LSPúJWÎî©Ó½„GPg@¥Û9»ÁžÉäö_`>ÿ2Áwùÿ ÐwˆýYo6š‘ï© üé¸>¯g4ÒÍ&|@({Ni-pNèNdŸ»ót ÙùÕïäâ<צ`SY­PÔq«É„ÌkQ:[û÷t,½ÜÒ?öàLÒ¾€wÄ3ôý{Æ÷õaU‹´­@­;¶E4¾¤É ժ퀹 ô€aHÔŸµÑbŸ†þéʯÐ{ Œñ–¹ŒÜ…|õ†cɾœi|]£îKSÑl6ê?Œ¸8Gê‹DbF-·»¼9U|/¦uöÑÖšÿ?0ª¾€ßT}¤^TYŠÄ buOEŽ‘¦Å6GAŽÑ&ö2ðdŽ©øF¤ ꕲ7Š/žƒ’¥VWeËhÁµ$ëC75“ì~»”…`Z †ùB"‰,"$½UV§~kqSmª š>ó7TÔ/g§Å´;ØÔÈu>Î ÅÅd% ¯ØÞ‘‡¬ž3­¡»V¬ñøþ>—ĩǡBýî=%ªyHv§ †U!Òäò‰¶7‰®šLñÙ4¦•½ÚdU_a\}é(,ž[œ€Â=þæ4È„¼µ¥%cœiúì‹jgpOüª×‰Ðû¨ÆxNh°Øü`¦äG‹w¡Oô€ß…ؼZ¶%¥ªsî€Aª…öíü|p²roé774àO! Üꟸ ]±å€ðRIƨí´ÐF$µy«}äÞL(E½ÛDØÜ\­¾H%ñ GÖÄÄâEÅÖ#ôºÀ¥Y­m›pƒ^œ¼Òט"îcž‰£ØD×ã¼7/Û_é ËX+†Ý˜‹èèH¹©–ìÈ›!¾v„œ?Gb§ÃÌç™ìµ«að7ßrqϧrSµ5Üñm—q»-qñö”ÖR6]ÎìÅã-xi®„ŒÂì©Û•G1ùo°¡±6Ò)LI·ÛÏ•Z›ûàÎàFØ„àU@„»ý4ûk=?tí÷/$5üO¢"–9õf޽É{Õ»SxMÕLŸ‡<”Ò|þìïnDe´9û ÇIkS,©tý€E9­N Ï»¿Õì.îU£.³º‹¤î/ÚŒÜËÎñZôt\wï¯ù™¸ 9µ«Ú°Z7’fÓ” M¢ÔsøÁn°î´?Hÿ ÍuÄÛ*ÓOÞûÕëa=×¹ŒRiÔ ¶ëJ]Aª¨Ü E†¢É›ôT›‹ŸFŒb¾wv„.¾‰à=x\jç’ö pÑê+7ê=wŠ­¾ßè͘&À¦+ÈC´g=Gœ,Ÿƒ ôÚ‰0 ‘¨¥óXXœæ…# ¿ ³¯ Ô ª4-~4F«ê3˜¥Ž­†7z;H/þ,‚ÅQUÌ;¦X" ÜÚ–š|G‚`P1 Ò';âQšƒaò4èNNÝquÀïyë壡j{ß‚…ΟMM¨ã Ÿ‡br“„ùêt—¼÷˜oÐÖ-ÔAÖéƒc½^wõTWšë{ô{²;÷t1]õí[V“á‘!ÿ_Ò Áå%ØÆ6D@ýy1‘éoù>¸ßÆ‘ÏZ‡UnÈËÜ—s³¼×F1Ä5Á6ýƒæÔ G^3ß]Á.ýnÀXBžëO²Q¤Ûl‚G5Xh5ëë´Ë£•F%‡@ð,‘X‰ƒŽíGRË—¼ÕÔ˜ƒ-£â{|NLm…çÚ.Î`įcL'ýÝP0#0é’U‹„Ú„‹Ž’…Z6™an)<\ãÈv«ÀŸ±hr¯;‰,TìűMßÕ LkDÑ´Ô^ݘ²(¹Áó_Ä~1®û¡Ã's]Dšè»VšónùÉÖƒuÇíSZޱ—†Ÿ9cAÝâóÏHõÛrcàæSž"nò…´jÔ,B]Þ*æw™o‘B‘ .‚ ‡’$»&Ù°J(Þù–FiÒõl¼³b!VCÇ›èÞÂC¼9G’¶ò/‰ºñòL>FȬཀྵ ¹P +}×sŒ˜Jœ˜Ä°…t‹}á#VMVøáos˜9o޵°8p Ç„X"°Ñùm±lüm±ÒqÍ{g4ÆQ¸ùÄÎøe£üvÈ_ç ´–ò™úËcºʾ6œœ]~|±!ÜžÝíƒmŇ{AÆ~ò3Z`Ý,íD„oܘÖÑ®ð|káŸt3¤ä^`®Î=Æ¡eÈ"½ð–ÏpÇRë–†ÓÙwo6ô¦fV¬Ú_pX‘•N°GE½ÕÇ+èâÝ­À+z%Iy™°Óf7Ãé‚0f£¡` &f8oMÙåIùùç–ó÷¦ýl¥”DgnÍiFýltƒtËÑíOžÜ¯•Ãi¾ï)Bÿ]s l“ÍÅ—§Ì‹ $¿O$·L¡£o#Ȭ. Ì aCúël><Ä$„½] XÖ{í•.FN¼z‡Ò;KÞ(Š]¥“› /ÿùÆ8”lÌzCÈ(ö’a¸ E Ô€4 êæë¶­Ø7û£"îᙾú¦)ÈMF _„f%²²?Þ;âj#sé–<„íÖŸ–¥˜Z~˜ŠQᘵ8é{x÷8øR§“²d·Z2,ÜN—*+íœù?€ÉM(r,æz#Ê×Õ—˜›\sl„+·C1aŽ–)Ì1Ö ÅŒäXΨ”+ÆBŽ åM 9—c޾ïû7¼¿½Ÿ÷ùžŸŸŸžby>Ï¿v?("ÿnM!œ¯¼éÛ¾a$˳ZLîñé´Ü…d šÕ&§&d)Ž%jg’qËt½á•Ôõ{C%#ïnŒZâ]LIŽ7,•ÂQ¤£¶üÂïÆÅ” OPDîòõŽºŽ)±GVô¡EÍÓÐyyæq…±´4­J^jçšЀ¯Å¦g`Íçiü÷¹l+²¯99សkøøHÉt¦õ5ãkækƒBžwW\ã/àÍ~cÓ>  ºÏI_ÒÂRíÇšÏHƒ~((&ïî°:ßÛ¨ èè±è·Sƒ¤r9.‚·ìðùßXÞ|÷{q=!í¤Ù¸kJo™ý#üˆÏà·%´ê¹·O+î‡ ÏK.쳸^ßsš*ÙÇŠ….¶Ð"ßGß&¦a‘¿FZufÃÙ3™Þ`¤Áœmöà ¦Ÿ7´µyö®È\ ± õ•b‰Ãl˜Ìý=,{Éž6æ¤N'Õ¸Ô¾v°kºGø^ç†3P9¨,u‰Azz¢§;Ý‹\3=âp‰7}vŒç'Œ’üí MP>ÉݹKQ5´æ‰ËA±t¬AjöÓºpI›[›[vJ(žùÆc…_ƒb’E<$Â:“AoVæ9Z'í‘Ͷ³Ñ €«³¶T•>D ¦te»?h~ªgJáïh„Ôfs Ü·p›åm|cÊ(5«—u}­˜€TáU †/U€åß`Ñy6{»¶«™Øâçò§…üi…Od Ê”MjIGtVðŽŸi[v˜æ¦a_Ô•S‹6Ü7ºÄ-"dáñ9<Š~)(KW"r¡,ž¢`ß/ §Û¨ÌOá¿ÞP4yá%ÞáêOP™ŸBÛƒJÞ.MK_;ªèQ“#;–M\íDÊ“ nÜÂÎá²à Dãp‰Ø f”†¶¹’÷.Œ•ÌåÆ(Ï·ÐI8°Þ:BTœ-¯œ§dàãÚN»Ö‘÷™+pB|½@ÖXªÝ9‡¡×”â¥i¸=§ÝØÇ¿ð{§Ä£¬ðæèC*/6·íÀhB²—uÒ;ù&>6F!2º¾Ksœ$ÝÒè<«@<FE‡qÅøÅAËÅG2¢õ%sÉWÛ24"ÔAåe‚=iK³èd]Á")w-ü´%@ö=•Ìκù®Mè;*ƒ -Ó•RœnZK Ç4ô¸U™^‡sÔ­éóòžØ©Mfo>õË/8Òì%q¯UðÛÈ·çÈ}Mîö·kÉU~=)Ó¢Á~z´íO‹•êçÕ ¸ õ±í­Sjn-Q‘' \n¹’qÇš‹í—‡®,YÌ5†è›ß3Úÿ9I?_[ ¿×ˆ!á fäÓFŸüž?T!á‹lÚg8åÿ’ObQZÏh­1GcN«€¥ˆ–¬\ª¶…a{®"XØ…£õ®ïr™Ö‡Ü5‡5‹ùôü“ñü×$’i›"ݲšÕ³Ë ûÅòœåÇŠI¯f”xÞi˜ŠBÕf×ïà™l¯‚¡¯Æ,QÔ+†”‚"— 'ßW+ ¡RX-˜+dïÕP|P'ðJó¦«ËtÄ ¡ç-}Gw ÙëÑ;®ú•3,Â×_ß=bßĉÉϬ7rŠñM- OWÖè3bµà{Õ´Y{¶Ñ–BªLCsÇDúùØ¢Ç~U¢åT»çhûpÐÛ$¯ŽÂnǽ ¡ò‡‡tþ*<]´$ºè,Î1Ä7v„‡Yä¶AÄTvýìƒ%XÌkAwØ —±!kýpî„«éî^ –E.H×ñcŠ8¨MÒ?üÍš–¾¼Š•Ü2{‰íÖ{³¨½kTºŸq‰m²}L_ûºûu~£‰©nrmš1,ª;2œp7Ýa:»„*EZ±å¥SlZëÕ Ê= r7ЉS#³E¬N¡Î} (C1ð{µyä!xwhù Uƒ?+†Ž(©-]AfôwœY¹¼ScWNÓ};™´ŠûÝÖ,ØVÎt~¯tß0-Ñ»‰íùÅû®›ÏÔ½Ôó<¼ß3²š*×c…xÄ$gâ•€&L†#¥Â·¶Ô\‰5a÷trìÜ:NÍ‹?ýP0Q?ã§SXT4±Ã½·ðu‹pOhÓ•7¸9Çéòb–hëêOW„+ÿgD‚œ[ÿ„Èþ[˜_ã¿äÿ‚ÿ <À'æÊ…ˆˆ H äÿ¹{Z endstream endobj 103 0 obj 100681 endobj 104 0 obj <> endobj 105 0 obj <> stream xœ]ÖÍnÛ8ཟBËvQXïO HY²˜é iÀ±™Ô@#гÈÛW‡GÎt‘øˆ’®>R4éuw¿¿Ï·õ?ÓåøoÕÓy¼¿ÞòËýøtÙnWë/ó¹×Ûô^}ˆ§Ëcþ¸ZžNy:ÏÕ‡oÝÃ|üðv½þÈ/y¼Uõj·«Nùi®ó×áú÷á%¯Ë]ŸîOóéóíýÓ|Ëï ¾¾_sՖ㆔ãå”_¯‡cžãs^mëzWm‡a·ÊãésM]óžÇ§ã÷ôڶ¸¶®c½›sSòü1ç–¹EÌY˜Y™Ù˜ ÙçÜÖÍùŽíwÈæÒ™#rbNÈs‡¼§mܳ½G˜çnýþ@€?Ðàôøýþ@€?ÐàÎìÈôøýþ@€?Ðàôøýþ@€?Ðàú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_á·šsõ~ƒßè7ø~ƒßè7ø~ƒßè7ø~ƒßè·RŸ~ƒßè7ø~ƒßè7ø~ƒßè7ø~ƒß9þŽñwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßátF8#ÎHg„3ÂÙ¶ l‘Îù+Ú²rÉæÿ Y,h6¥;ÑÈDt8. Pi|ñ€Fv ¢±+íåK÷ÌèdD†TôÀŒg¥†u€NmÉ-^F ̸>-AÍÄNèÄ…²,²éŽuð¬´aÆ`¥Å‰ALt&8eÁM‹³<—“#artË„F{ÇN‡® tÛáÞ®Lˆvqè”ípvÆv¼øÎ™Kû2ž¥=²æn±•ö=Ûaîzf˜»õ1þûå‹OOgñôË$@;<«) bÏwW<}ynS—~y.®X§G¡ô¥)›Á°ÔÁõë ¨3,uðîÖÙÿdØ@±ÃÿÚ˜«ãÛ4Í›rùPvcìÃç1ÿûKáz¹â®ò÷pר endstream endobj 106 0 obj <> endobj 107 0 obj <> stream xœœúc°,Ð&Û¶ymÛ¶mÛ¶mÛ¶í{lÛ¶ç¾WUÝÓUýcb"#3vîµÖ÷-îÌ™¤„òJ4Æv†&¢v¶Î4 ´ô°¤¤BŽ&Îv¶ÂÎ&œJ.¶²v®Ì œ lœŒLÿÿ -œœÿ)Û({Ø›0ü„@ÞÑÎÌÑÀæŸ\ÈÎÞÃÑÂÌÜù¿N¶.¶ö.†ÖNæ&ÆnvŽV†ÿ_@¶F´ÔB6†ŽÆf&Ô2´ÿ¬­ þ‹äDàhâdâèjbLû_[S c[g ëØÆöŽvöŽ&ÎŽÎvÿî?Z%Z19UEYYeE%eE !eaE 1qe¥:ÊæNNv¦ÎnŽ&Îÿ"3502ù´±‹‘3Á?á¿¥ë?Úþ[8›ÿŸ´*N&ÔÿŒ]ì­-Œþ›K;Gc '#k;'—¨ÿbv67!³s5q´µùÀ`\ -Mþ1üsü_ÎŽFÿ±túô/sN&ΦvŽÿø,lÿkûÙÄÖÉ„ÀÀÌÑÄä¿ÿIÀ?¡¨€" #-## …%ã¿§Œõ¿:°³QþÇ57s[ûÿúghý/Ïÿüûêÿ½õ?¢túv¦ÿ Ë ÿÝÉåŸÖ9ÿ!1þO.6z¦ÿ„`lñ?¬( þ±2°ü{øWëÿ’³Sþ‡èÿÔb£ü‡ôÿУ%øOu Œœíél l]þUÁù_îÿ“ªÿ­aþã ¨…£“3Ò?‰óÿÖDôŒ ÌŒ´ÿ¦ý‡cð/ÓfNÎ&ŽÿªùÌØÄÆà_Kþ‹÷k†åûWÃê¶°tÿit [S;Žÿ±ý¯ÒÿSD@@÷¯¦ÿ#4FZúÿŒå?c;[kcÓÿhÈÚ9ÿ«ÅÿŸBðÿ:ÿq ý?YE]¬­e lþËëòoJ è ä-œÌÿ_t l,¬=þÕV3ùo²vŽ6Öÿ§\ÂÙà_W Øšýk+úÿµiá$jánbü_ȹw1ù_[cGk [y;'‹ÿ Ûÿ!ü7¦FV¶&NNì ÿšükÿÿñ«ôßèþg ôÿeT¦Q´û×RÿCKÞÀÂÖù¿ýÿmö?´ÿ뽌Á¿yt'Т§¥§gø§øïñ¿V:ÿ«ˆ­‘±…­Ù¿Fü7‘ŽÆÿׯÿ…&(hçNàEÃÌL@ÃÈÁAÀÊÊDÀÎÂîó¿©ØZ8¸˜H0°°0Ñ3ÿæÿl¹8:þ+ñÛî_Èÿ뽩ſܚ˜¸›Á¦`ðE 0eW,ÐRe<´â¸z¯¸@@U5ÊbÎ ³:eµJ$˜±ABK_%N$ëÝ9ë¾þŽb×WµKœž‡ñ[Ck¾†©d¦X6á1͆(-kCÃÄ>_Y=^ Ó:ùO&âÖâ6Å­t?`ué`©¢Ú'ÏøÄÉV§&9.«7û°»ªÄö¹xâwkãl¿Pq«õ9úÞ‡% æωþLÚKûèåä txÐâªö@²wĸʤ7ês Ù£‰FP¯Ûh⊠3ot„k"É-u÷³m'^ÜReP–‘~"É¿ãÊHdk`÷ÂOÍÐ|pžd&”Χe×%ÝÏ™ZMß¡EòÞ«ê4 qoŠ<ÈÒ6¼ü:K·¶ág´]RÀ´ÅxwÊÁ‹4•÷ šGè:OŸGÏp7DÔ|j!n’$ã$Z¨õ<à (£RŠÖn°SWø8s£ö¦–¨¹…'ï¥G“Ó"ð ãn»ûfWšæ9âÕÊó^Í–ôŒ§­AÔM­/Óƒ#º½Ê_l>Ì€#‰ WÍ+¨Ö 3IÄ1/Lð·ä^Ù1Tþè·lõ(¿ VÖ PöÌf ñVâÈû¾¢Mv1¿s~>p¬2öîZ:™cáB¼JôÏrQ²!z"gó×–lêîY$õPï˜mU³D= s=&ƒ9.9œZ™+4û_ ¶ÍIñϼÿ·/îDâ§j ­"yGãr>æŽ09‚F•…؇3Œ_Æ×drÏIG\PzÓ7á:,ó vúÞû½'§ö£&Ù½í§:ß'/ˆuÍ ß3ån²‰_ÆÉ4°¶ŒÐGƒ.d¯€‰³œÑaáÞLCï öWÛ1¤Íí—Uå|HoU^¡ÀÕèó¢$ÅKã±´‚5:WTôCwý3©–É£247E6¿3(²b;ãÜT{©6:M=H{& 㯘ëºýÜNÔ²±ÕÆ\âcˆ‹Jt´YÕR8Ìdv°Ãló-/ùúÛ3Íò8=n`ï¾Õ|ì “ëp@ÿD¢âµ4÷L£›©O³ z\eçÌ?`/¾)xæ*:ÀûZ1âÉÂøŠF<æàTºæ¸xÐ=¶cíuį5ŠufÛm§¢y§" ¸Õ` úýî¾z¹±—¯EË“î8—e}œ ®” èè× V“Hx&7¾>èšžàÂ#%ä#sI¤½zÌ­~·ÙÝP>KŽÒ m ­"®|3.ø[ OÍîš-pžE ÀT^»Å ¡(½—¢ vžZÊL+î÷ío-•W!ÿŽ‘“§…/"³0â÷tÓzuÜ[‰+aºBdfny*|ä^õ‘¡©¶MŸ±G0!ò•¼µX)Iþá¾õ"=<Š«yür@ÂÆfïâlËž#¥Õ"ø G;Nõ 馂Õ"ßév¹™XOjšà=×’Ù¿w1ž:1¦ƒ€ºE؈Ml9È„£ÿÖ¥kJ.Û[í ƒmýC¹å¥ÖºÚm]ð‡:×u»Uu'XÆO£Öޝ^<Î/Ø¢}6c{›ª—ì–=³Bv8¥‘7!Ç wXŒ ÇS•wU–-5QîÚNO­Ž]¾®h9Oÿςј…a&s˜@l³Ä4M¾¿SJ«9£ŽpYw§TWCÅjòyÌ´˜‘Êwã÷ùœíîQuåP¶pÐ⦩=ì“I.Óp4¶©¯©Up·úÏðpÌçý_LkIâÃ%Ò®àˆ»ZF-¥%¦›«‚ǃ98M?–ÛFE¬  ‹=êŽX°ápg‚9ïíoVÿ¤æ ´!áéÁUŸ"ÉzA¢~|èr"$à]vîÓN,6Ò5ÑnR–0Φ0ÿM>„œg‘ž?´—T•]Á DuMÚº8V.ÁЈœoµÄ»ßó!‡›XžrYy? èŸãYé•Üþ…L×ä{%ƒKÐØÒžçp1a o׎“ C/IrˆÅ ›JõûŒÛ“݇rU0ïùIõÑvh›*5| döëo:;‚ôÙzk/ˆRn¨ßBÖD"?B]ãHÎÛü´°‚a¶Ý£’\æk…^Z(–|¡ËÂ&|Õžž¤xð'á”ýÝ—úûµ¶'XÓe™Œ^ îˆ.Ž=½ ~£â6cÉBñÚÎ5—í6ú×ocrá‚g®¬s*–¢ÈÈÀ$ÎAt7ÎÐZlŠž'¡†œ~ö¶v|ۙߴ›†ïW­¦Éo9V!’âè%KgK€÷lJ4~@Ÿà BvcÀœH­s+¹ˆ@'¼í1F2ÒVM‚…yK•}Ä0|ÂãúåÓEŠBœ¯¯e§º2In’'ÓOÃÇÍmujòe¡¼’¦ êg*M*æWÊÚH—kD--¡‚¦ÙeCLë¯d¡ê‘bïÃ=këúÀÞ€í¾øºÑ¡üL<ð¨-ÿú·ëF«YkÞð¹ ÙáúmkæìQëU.ß—‘lœÌ‘ã󼂯“¢·LÞLå2ßLUô¢ö©>”óô¤ó  øœµ·c*‰qóQþ¢Ø€ðøîµ–Kî™EÞ6ó±x¢x­Ný Íb{NoWSSØÄ]©KO]¹6C+4¹DC×  Á<æ«}$hqŸ×³rÅWÇ#qî—º¿·DÙõóÂíWA°‘B¸Ô–‹Ÿÿnúe ‡çCñÔ8|† ïá 'Da?ÀMP•mûÒ «xâ½ÚUoÀ \1oæ^€îWÀ·¹åâg½÷—¾-Õ´r°ƒGfh àèoãîe¿'/²çˆæ,¾äò4NA1(dÞ¹ÕÎ`ê< þ›rJ ”< 'Z€óìY3Dgôž¸ˆHÈߌ¿~ò=Sü!ñ9´Rœùþu0A«Ps©ä¾z”>—“"dçf‘¸: ’{[ÖRYårЕ¡Qô ¨5J©Ghv ´¶04çLÄmÝ7´D4+£M6#x¥!>ÙÉ 166bö:k–Æ{©w¬VügÂó°n|+"ÊdðU1öÌð2ó‹åbÑ#öGSÁŸbæÆ¥>Þ=Óè—äò•KIÈ£#°¼“d6*èêL _Ä;Á’R\X(9r8 cå)ˆ¤m}_×,è.AP ã&4îØž¾Œ€ÔïçU†Ö„OôÖ£eRZÜ4ß7žÁüP»…Lql¦v)çÈq]4£pÎýOD­ÚFlõâÃEóþ_Wt’fnOÐGYb? î°6OJŒÊaÕCª7M€I‰uýsÙÝÇšï~$ÚzD;0 %–­ìÃðÖÛÛ}}Y£Á¢Û{ݽÅ*êca„ôMœìè5‚‹ÉàE»æd9Ì-ÿ_ãñ·}—…<“«,,.qD"Tªi¥|]@z"œ‘Y[ž× ñ·8gé›é/B€Kr]Õ É´`ú]¾¿4#:îÒb=}u¾—áq“.†3ìÊWn<ÏñƼ”ø ªd$Ã6µ„`÷é^oK`š‰Ñ}0Z`0¨À 2ÄÅÖÄõ©\e|ÃC˜–g”Ó ¤eM‚2}}©Å?¢œŽ0Þ&9™"i^+£<È:àÑ·=[èµ2û™=»:GÑòi ¾6 èýJjp¤›Ý™8Ÿiy8¬T§“·j…ÛèsXRÆÊ)zªžcT ¥¹ÀUœæ¾¿lyÊç{b„äÕÏÆMæsS€ã€-ö ‰'Žu3zBE+…ÏÔ¨ŒÀO2{ Y¼¯ØpÌer¹h§™Šr¸‡Ù»Ðƒ·¤fT¢€y#Пh‚uWX>¿9”=”8hÏàhä,°¦bm1“ɲl­„YÏWý0ûvýõ8éÅw» ?¹8”†G ‚Sì}Ð¥âï@Qž„XAà<ËI+†œÄ[Õ ï´û Ó!Fqg„Ì-’?bj=s†â]:z&ÈÕ)ôêõÎpyk%vÔ„ÀA=ø™µ‘,íû/(,$ñÑ!3H –AÝ¢âNı-yˆöeaÁ±RÐ <fÈéçjk?mñ‚Û‚Z$ü³Ã„ɲ뷘«Ë%qÚÍ@”£Eãg¼d˜‚â¡Y3%qÒ5®–#ð–FÀßR7¡…ëðl©ïêjÚÀ#M†-µ2EPÎ#7  <»Ø»tc›890μ‹Qj6„‡õŽ!zˆ.ì?3•‘£>¨ÿ2ŽÀžLYÕÙh¶f@;(‚ã¯*U¿KîóA?пä{©¯1­X ±ﲺ:Ý×y)|_Ý3åO‡†‚ãç.sˆ<’|ŸƒUÖj7™”ƒè=¯ÿ‘J„¤<ª²ºã’8íº—ÝŸ¬˽¯ui•äÔú5ifYż¦V;=¸ö_ŸH=ü"frî™Àƒ‘#5$JCìaôUdÚ›ÎAd·‹ÝøýFÎŽ1 ¸·«ò˜WV*ø±÷“b«·/Å K Œ®k…‚c6èCoç‚ *÷cÄÛÀÓèL“N x©ôÕ”a•PG¼J.§]}ÙÕ^Ù>ÇYý4–Á NIšEzËå¼OÞÕ§Ð^Ðp+u¾oÉšR˪s¶?à{`‹ =o@Gq©D‘=P¹‹$d6Üöǃ:8¯ö©¶¢`$¿cH·5thqD¤âÒ‡I´èºhƒ5Ö— ¬€=ñì4Üiëo‰F•é‘’`ªwÑ{àÆ¦V^P¨ Ød6࿳½O|ž“ÙÔð¶åÝmä_³_H™æÃ6gÔæaeö™ƒ×û™`É)Õ˜¦—wÌæY92Hgþiû ¸qÒx°×ÖœÁ;ÑO¡A×úó`3òNfmv)°‡9Žqþï«°‡Þ"}Zí¨[°‘ÃÛË7gnjO$e­wt¨Ì0§uªìdÿˆÁº=•&ŒÞ Ù>ð­×ű™4ibá$T »íîM]ÓØqînˆ°µ(Égüè™™£º›9Q“µ­Ô›Û+5ï×Q͇÷§mƒ}™¬–šX<‚Ĩ…ÜwwMC1#uì,m˜e¿tìò–ðÎå9MáI/qçê~B…H:Á§|(KúÕH“r³ÀCš§=‡5KæýÌ—fõ5ÝátewŽ…˜ÇE¤‹í’‘R"Ó˶àE7ôK}¡'ÁdòIö;ŒSàô5×盫löÛ–ª’&>É Á%¨(|*Oø…iG=4,¥Hµ»SWjØ>äS¬ª³,ß³VÜ!PkøôĪjØ&“»VzŸYe.%°ù1YˆE€ XØof " Z(œ“mÕ¤Ëk1ŠQ^F0À%Xl¿]Î1µÊ_eíu\€sü]%8Q£²É¸sH´²Ó.ø¿Ãæ jYÖ£ˆI§Kߌ§ÏcÂMÌ칡n/êÙg(žóÈøL:4Aј=•bu©õ!MYÞKùÊøÊ7:*Iç~+îGuºe»o;1U´á¨Óðßq˜‘¶Uˆ6‘F¢ošÀ'2]hXæšMßkì/0ˆ eþªî„òn@RøÒð„@b¦ËÜtG- Ð1yÜÁC2ޤ(ºLIJTø=™jù‚qeöÜgÜU“²Ÿ$¹}sFþ•JÔÐuyž¾4,`³à´íê{{º£|tøä³T<(1dVßâ6‰a)z¥¹è¤ä=ê““™é‚̸íZ<”0‡áKÞ`»#ÑØß7;AG÷å@Ô'bîI/®”¥ãô4¤Ç-zŽó‡-Ξ5c–1™¿¸gŠ©ÈébïÁ™Rþ:6÷tqeO8ü‘Ô™m},š›G;îòÌÐ4’j7.Ü›=Âyò‡ç¢i %ËÁtÎÇlwá Ýÿ@Åîêúâ«M”æ:ñcÚ©³˜‘íÆná¤ç>ZwíÌü…à0Om&dJtb…‘m9K“§®îg»Qý£t7gFI bý¢ ×ÀUÕ{D†½øXªèW¿Ü2Õ’ £ú-/GöŽž’ë¿-;&ÍŒÆC^ã îºéIG3¶BZöê¼7'ÊåîLŸãE;?7Þn3sV,§M[ë^¸ÓÊ;h½JL^~¸÷ » iV=²¿LI^’¥Ï¬°_~O&€üµ’‘©À¸pØ/tÔ2©¿È}Ç[O°Ùzd6AJÄ÷#§T¹ûÓéÌ+߃]=²áëji*EQXñTè+:…Eþ\NKŒM.º ·¥½nùL"pÖIŒ ™–Ho³Ù| @žAàô"âÂ2:žs$Ïl •íKä.äj×Q å7óEHwJ+TŸ Ð%‰ÔÐW άÔ(Žºž¨@ƒF­TûY(2]ÍŠº6‘Òþ#Ÿš¦ê€—"¹-Ïsxú ¼ý¢,ÄßO³²˜›{Ÿ¡ÑVºê/†Þ4ão»J—Ôýp{P dÐ $5Ub W] y4rVÈ\· Çp¼·h¾„ŽXs¹Y{-_LÙŠb½57È„Q.½¤êUyó"û›Z#™sä£å‚ˆŸÛýUØ”¥ÀA”‹Lx<æÞ‹¢üÈ Šôu~êPFÁ9ªAª¡Ñ&a§Z8”Û±Ñòï}狲Þ!#ÙøÈ€Zò )Mdy"†˜‚Œ¨ÖËzIƒ X:LFúbF9W?—E·ÿóz“©S*æÏ  ½·ËYBä¥Ôäkb0 CŸXÊ5uÐáë`+Uv—¶”,“õ`ƒ •Ã%Ãw:4h(—ÈûNC«áÄh/Ã…é!§ÍIÖâ›F%ç0|¹ôÞªVzâv—9RÕÖ™ØØÉ æA VÁç™NòµS{=Õa±ˆ¨2ÚªÑÅ}î´µ¼·A{úÓ±@< €-•å¡.+kÇae[sÓµRü(DË|OŽÔ(ß©7%h$s#ë‡}Šš“ú<Û­ü§ºí€Dp´ÇÚüLÖ¾“ÉkÞF¤~É| ¿ÕÁ7 ’ÏÁtA¬_íãb*)%àÈ8‚|ÉûÄÈ¡›(Û¸‘NØÈ0d ¡,¬¤0v‡êªeßýü×Ùµµc§õÖM7€äà¼â@C]÷ˆ˜þÍŸM€!+Ú¼z–äÝÄÞF¾~7%4(ëe¤ÿ…·­õ QVáâ5jN8æ*é}}&χüZPOŽ—Ÿ¡“-÷Æ­:}”?ÂÁ²f¿2äÙ¥Ï3ÈÖ—»:LOa,–«ªä&$ ßéN¬ÞÎ=7U£Ð».?¦Ï¦ ”ñjL9ìòvâz4ÆÄ¤°’Rb†d®¨òòÉ=¿Mo –êZ®„á}’bvÔ2Öu\ÏùxYV½N W±ú¤I1¿ mgônÞhÁ• òÏìD¡/‘êk 8¢TO†ÌåRÜH£È .F¿¢/‰´@wh€¶`ÇkXÔžæ¾*£ìþ(tu[<~~$8YÀy×\ü@?–˜*Þµ9È%«?JÉ-3*Ò°o’ÿ}õøï— °ÙÚõ)˘3?·Îß/ŠßÝà¡Õ{ŸÔ?­—ޱ¿,Û–ŠeÙf¨’ÕÖÈ¢uÇáôU~íÈà†çTí­È.”-,%Âæj­•~’-2™1sùýCî¦.Q·GM‰¤ñ„'ky$òO€ð±êy¸FŸ½kWD…8¥Ñ´[Šq]éÕÝ1æ6[#çJ¡rí4é’Cñ…wýDÿúUÆ'C™ƒQÍjÑ1ÐL‚.n*&GÌ2W)‘Ê-`×N0âõël»—êZ·ØüuÃå€1МË]æÌ3w5¬i«~v!{îp¸ŒD·5 ÖšsôZi²Ga«;äÒéåün0K¿¡´O^`qÊ0ÑŠ0ž_C1,zÎYÉõг_ºIŠu£0X7„7l'‚Idöt¶9õ¬ÏM–Zž¶‚ÓÔ–ož8%]t§8n !WAÉz Nn-¬+ŸÌ|P. Ç¹î1®úøæ‘1 ¨›(¦ù{VZî’tHÿ–ÜΑ‰÷;`ÿ)»ï,¦‚5 _é¡å:=¶tê­w&“ #é„lÀ¤¼b¶|¢-I—°¥©\Dw|–÷õÒ†qõóÊ•?ØAN&ãø;VjŠ(ÈèçùJáåîwÈÈEÌ÷"÷·¼Ô¢Ü˜U}mº™X„æYV­" @ç¾{C›×Ð žáô o”tÆÝfÓ ­ºß–E?è=D–äÄÞØ‹Ñ;ºX›‹!·wØæÏ,x¦,žmgãÅB(IØdïh†¨ïsQa$ˆVKG§F‘ÖL ùM6ËgY_úˆ–i,m‡Î‘^-™ü°Hkô„ é’ÔÛd@*‡’iÿf(\‡Éì}Û_;»O¯¾hX;½E}*IÜœÍ)«±àÅȼèPø:rSˆØlV\ˆp€(œ(P¤ ˜Æ‚G Kî æFƒôÆÚJAÂ`ÆAX±”ÙS^óÝRÊ ®‘2­Ê÷´Æo*)DËÁ$é¬|ÀÙ÷Ýec—IÈÙf(¼ÁÎKЙX®¥tvÕ[rµŽx!Îçv÷ƒ:ây¯MÍLÌåØ(Ž6F3ÉÛ^áÄÎô‹ƒeëúeØó|ÚÈçPV¦àÆAA Œ.yàXSKz$ÔtÍ'C¾0dóZ~íF•G0¾Ré¦zù´®t’Ï^z»‹ç5Û´´›48<‰ø\P11 ÝA‹Wb_°y[—Y^,Sì6·',¡nmÞ…âÖòG ­*‹®GðFé•j5ßÀöä·%ø\Òd‹1~’€‘'(LAÜt « Å-ßéöî­6’Án’EFOµµ+¥kpji:ú¨Q…'F?}¾¯hV§cƒ`1F*,£¦¬SOÃë^e .ý–8JoQI£ÿ ®šR4rx˜ÚRx{•5¥*eŸ6çÑ1ç÷ºCÞC:‡ÔéF'iJ÷¤*µýäs{òÁ½wØG ÝsÌ7 ÞêÇÊmÐdJº93© e q31)R8Hoƒˆß{½—&Q1à™”³Oi$–¾Iepêm…$Ù•ÌðYu•]&÷C(2é_‡~ ½*—[™¿Z(ŠcÎJúAö†ú¼ÚˆCé/,ÄïgPQ’±9 õ×ùè—'[¹ïi£¹ÑÈtš¬×žÌ•r€œ¼­®ÒØ•ýiBbCþMîFØ õ?å‰DZa㣥ÄÛÌûV;?òè|‹·ÍåOCO2í3°ñyC Ÿ3*÷LÔ³Xך[Ð+ ×;„úE ¡ýËÊÐSBéLÛSê–è/RSHKG>AEA|ãêºV5HþEö7ÕÝú‹]lºý‡„×Ùá,S_g”3Ç£%ìÜùßi­tàd'@Ö×µJœ„Ù!¯,ι"›ãð†lJŠFH Áì&ƒZN×tK y3Ä¡í}È¿ºÇõH€ûGBœ¾w¯JÜ¢Â?öø%ûÀëVlxSî,f³…=ëù{)U¸2â~R ó=°NÃ7™Ý€rù£Û({/vœg¸ržª÷ ö‹m Mãu8á9 =öþU07ôÞ[Í*%ìëòý7Gë:“7äûã‰TÜ»fSÒ4¡Ìµê¬Íúk]:âÓò-¶Û¬¯[M¾f¨©d&kŸT­ˆ½ËÝQÄ·J³8_Š 6íÈÖþ´"©¿~°ÓN<î¹ÓLpx4‡ö¹VMH3wÞ«¡Ár˜p*ÁX@r´©¹`%MŽšÝ&&²Ûµ1‹,µl>Û5»íW9²šFgæÒfˆxAé‰p%¸.¸|–µnsµ¸ÐàB¸‹ßXiœY>»ð&g +ûíúBÃ,W…?½ƒ{+­ A‰²Q˜ÍøäN¹º:FÆ—-°Jå«Çâ0zÊÝh3›É},û†íJ¹ƒ(àÁHÈ’>ýg[0x!R½'¨Æ'þˆéFû…ƒg™¢¤Ý2Ð\_ýåÞFˆÄ%Ü 02¥<~jn{÷ÐjFÅг¡Í?¶Iσ"éLK$_Ð}ó̵¢ YѾÍX6$ÿó]ó¥¸I|“ÑŸõ/»t D•9/=ß%FÉa]ª¾SÆfLpú)æ\îZϺux€oâ{d=$u³£ï5ÿågI˜ÚùY‰UììÑ¢ÁXz"^–Ñè¸7U‹ ;àGªŸ*÷A´ˆmó¹b ÃגË%ùÔ”¦Ü¤÷‘´‘¡Ÿ0íuƒ7U¾ÙEqøBÓ8§o”8^áxø­;–¹ƒ^&Ü®‚+z‹¸«§û7¸ýwPy5†ðˆPSó÷¥¨’[”ýÎlWÜ®²*·t‡¬äıŒKópœ„jmôy"xV§p A%ªDe«9À´ÈHÙ*8»^ïöŠM1G™•0WÝá˜,ÅI.]»1.rVŒ~ MRöj°­ÎR,©™.F=J+÷Žÿm¼¼ø­ÝÍ›¬Oé0vrŒõGÒV 3IìÔXtƒ$ÿ<)’P´owK=l”˜ çÑ8HÜN³}/NΑ,ad|¾ÚÓ ‡#£{ÑOÑGL)®7Z¢5†Û­†Æ2F¿W|ª*Fç.´Pi›c˜…yó¦ÅŸ'zÉJÉW->„ôq…ðâ Ïg«©á‡ZÑYú(Q/Wüu‘³Î“ !²Èh#WÍg`¡Ó1ÉõÅ*òÎŽF‘J=·ôãa2rö©ì…çU²C6§Ú&,9@ÒÇÏ—QF<èùLÞs㵫/f’@¿ŒAõa²“åO»y ØN–^„â·À?EvfÏv“RRt¸Ý¯.+>Ù”ôPƒÒ#Jíþ©eÇÇ“…£@˜ÀוÖÃNôéƒ6N áužµ#‡½L~–jíÍfÙbŸ£ +¡š!ăÖzDÌO0]Ój·KjSÁIõ;a ÁfQ¹˜¦úÃ? T²mSP´ÏõÿÄ¡EY¯õ€6p|8XøHïà•ÚÈÏð#9y–ü½<ÙÏû’?A!Ð@¹Ë¿%°¿àe¹-;ì¦E¬´°¾ ŽÇTïU2Û(/½‹òðƒÅwDØ# â8CKÐ;£nói P_¼YD®´Òu¨Û:¥ŽŠ=‡ÕX‘zo 8ânµ'ÜS3ÀÁ`™.$«yùd4šhE·÷×ûâñbø£# µÞF03cÚ0¯ •³ük§OQe nÛqÓIíc{BÿH· º,žZNCœžß]˜8iUãÓÿ’ÏíJj˜øÆ¼«–eLbñÊSY•ð-g'Ù©6TpCö¼ò«ž‹ mmÄF[6-8Yº(ÞË=V¬ƒ wTW›d‚u)‚”Ù<ïË•wqvŸx$œÝæ@‹ë9²(! mª‘F9(¹è$MÌIÜDÂ}Ÿyß#Bópµ^‹ß‚~^Ú2jHè‡G°¼©Í% úüKØ.‹;ëòÕkŠg4ð˜¦#´ÐÖˆzäõGðÏ™±Cª|Ö‹N対*®YT&ÈPëDùí^-…c™ð³ë°‘[$†ˆ¾ðóTv#9nÌ(I+¾þÓÍ%ÛÑÚòÀö€¢4šÜkÁ¼–ÌVmzP¶£—7[ð7Å2\YÝÀ¤ZÒM»piº²“õúNXè÷«L• üø=†‚6S¬ŒÃÉžjG“¡èAn0Å/ ,7i5`cÍ òØïe–«~c‰BÃMâ%,ꃆ-nJ#±¡ç¤s€`/KþBþ7pŒdÂÂï¬a$«Ûµ„ ¹ÔL¬Ç˜ÐVä^7rä¿1ƒŸ6¡˜¥D˜Q÷íy¼¯Öo芢wgÚaˆ²‰ÆM@¿d_»ä×@RÒï¤å@;‹t÷Óšblê3¯‰:§°h¦zóÃ3ïUH2o#wòTÒË9¹GÝ4ѽ’x®"ý²Û¦j|Ÿn,¯ÁF:ï”…ÛPxÐvwô/äŽdyì~I´›¼C–©3#?$jJÛ ¤úQ”Æ"$êg·Œ×hºµFhBÝ+NpŠuT|åc<•.·c5ŒÀÍ4è»d]ã—Æ»³š-©°›ªu<Á„ hhXrÿ<å] ®ôŒ2u†°{«$Ë1YE/ÕÌkÖ ºÖ>ÌhVGÙŒâ@D biŠ}¾CÔ‚‡idÑÖ„œü‘Š7t*‡ç˜‡q7UY9éÚóôWi ®1H1)q2*R±B„O3qÁÇvHâÒ7Áò‡½ÜÏæz¥õÉL-k'd"ÊïªÏ-sWÜÃPöÝqòCš'PÒš5ê)’$î=à6ƒIJ@ÅoþØÆQÛO×0ô@%û%ž–Õ,‚QÔuBk0)¡s,â‡ÞÈ5.ÉZ‚øcaësc¥÷8£Ykjâìw‡Æ‚ŠªÎ“­rXÒóÓdþ)±ÃïU¿—Ö4QTÁfný½6T‡F÷Ðl—†3ß ²6ûk+ó¶ÑýOÃCX•P“].Mx!¡„Y1‚×=H·¦«)Â6bm)Ï+À m¶ßKÈßyXŒÇÆ2; )ûgÂt“ġЉ—‘ØðLM¼:˜Ú¾²î—˜Z« Qû\q‡õúSG·ƒƒB°@¾—8Ð¥Evà,Zš³[K÷ã¤Uu‚*Ã@‚¢âÙÃcà‘íE”–Õð)ž”ò¿Ïì!¾·èéúzd ­FåHϵû[Ìâ.c-`þLT¤Ð1›9²æ1³¸f [ÊLHÍIOj”2>]Ã¥Ê*˜‘¦î‰g!^‡¹Ü<–<6PufW©½ÀØPo-Îê-qf¯­·$¸FXÛ7™ÜgÎüWïùs«'w“;tpeởÃ˽„TÙâŽ'Ë]b›gñÞ¿}°jÐúut6ž!>T8F¯A)O@ŽafÙÈÄõµâé÷¹„GGê%gSx£GÔTÖP]Xa›Œ.7È'6¸µÄÿ”µÇí¶!9"~o4ž}’ÊL¹ô4£ŒÊÚ Y>W§~:×€ÃGÍ„Ü/óŒÌܽ%¼£C*y Ñç³ÔÍó$Îøöõ*`_]û.¡yyÞØ„ÂÒæ”í˜1Iõ¦‘Á­ÏThmŽÝ…e¥7Ã<º¾U2Ý8m§ÛÖCë™ÓÑP¥Ð̾ÿ‚7K©ëbžˆïU¢æ)Ñ7r󟻎L—é[íÕs.j…~b ™ëó˜û¼i_ªcÛ¥¸yñ‹rÖÓn‘mÂÖ—j¹ýŽ›:# ­àŽ6~'¸+6`6SaÞ_5Ï·jCä™ï·ñf2eÝ";hæŸ[æ”q5Id­ŸŒXŸȇÀ„dåra5âW1¼Âå¶ù§ÑïS[Jµ®}nŸ¯ÓBÀ•¨lry™fíÖ‹ DÓêà óÄ µÕ‹&¬Ñzv”©)éݲZòž¾õð ²ÂÊØ˜5Ì.%7£Kfx™æÌߟ>¸nZ9²@hcs‚¯Û¤5u•¿Ý>¸ ¸ÑÈ`mE‚{Òxxÿe”˜mºöðÓò70ÌdÙ4ÈÎЋ¡ËU¬pz­ùl­$}`[¬ëH„) ÂeâpL÷ÅuKòØt*]‘#\ ûX¾ø&‘â˜ÅH±,šùçÑ)_å5NªG×- ¹(§Ì¥ôèûÐÎEx›0Û² V]=+‰).Ÿf£;ü Ÿ5`ÒòyBÍ}_Þ /ªâZÜA/KŒfôÅÆ·A¬C<á§Ì‚áYF‘µ´ÃÆôAtö­´a&§™+ö4PˆÚ±ä Q6 ü<Ÿýï­Õа|Pô½E¨{\Ö. š¦ûn$ÛìÏ3@LÅŽG/“nP‚äyˆ]-oÍþNl©™ñÝ6Q鎻ܤ=ÀD§¾‡<É2ªE[èfTGÓ˪»´¯Ú¿“¸¿Ü&U¤Ep­~­6ì^Qj¸Å;‹>ûLÚÒMáÖõ#znÍ­¬ãÜõThû÷ò¼„eæ¢.ò“§`É:÷ÄjÀ6>W.«!ÉôJðÍân Zÿ[>¶n´ÛKÛù‹±´÷DÓ½_„Q"ÌÎéN|ÎS@£UíÁZz²>á6[1l†ÎüV"h$1äÀ'hƒÍ$ýBÉ}q¿˜©‘§Ý]“*Ke¹vL®–.,Ýmþ×Å’å‘f0ÒƒÃôû–?À¿YžÆt+å=Ϲ¿¨þ˜cæo¾8£ë8Üý2Ö̇؅#78ø~¬:P‹zæÀRÆ»å]ãŸp]ÀÏ$«6`›±=ág°¦,‹Þ\¿b™¤ýJG˜}ýPÌ¢Ec¯ÙAC82gÚ*üØJ›l¶42îGÚFAìÇàc”çäXæodn‘õ]c§q)ƒ„šÔëvÄ-à`íGäº@U€}…»&rUÚYÖ·ýü¦»ñP$†S½žÚÎø6©Êýº°5ªÐ´K¶Èµ &u^ØdåHᧃçtïÜó¤³~ó›¨+|\óM‰Ø€åyâ€Y,ÆÄXEx]•½_7b[ö97?ì)£ˆíˆ Ã\ïš(¡ò”¢Ê4¸‰~*Œ‹ 5šs*3„ŒÛè$Å–¤ »åXÚÊætÎëÍEL(¦×Ö€wk¾“y¨^ey‚â©êç…•é$wÆ@V.h¸]a‹íl‘FþìOöfZ€ð?“ÑõÍΜUœ¨©š"ÿP—x¹ 3G«oOjYÀ=ÜA ôÄÈd“›õ7ÓÌæ0h¯B.¨‘”·TyJ–„Ôwˆ¾’¶ÈtN`…Òl?SMfˆ“‡6ÚÙbT’MbØË>óœš>ûë¶X Óg;욦þOdÆëub‚?À-²t¨IP_ÅOt!\kíIhé„þ>'Ž®{O`Ũ’­<çm¡ ÝØ‡<çßú¸c9í¯Ôo~\Vt¨Ù‡µïµ“ŒÏÙ€õÆI3……!û±«ßp¿99EzÛ‹| Ï¥D¦^Óba–ÇC‹ò|Κ&QÆ“kåo% ÂкŽKÏrï±A3` =Ѓ MWZˆNwðBÐz²%~ÑgÒÉtqî7û(d ©†6Ïw"‡Âüò†DnÊГÏbÿ"Úoww«‡ãë–B¿l~~؉µ^ª ïŽi µêð@Jw¬ÚÖ‡·¿nñçΪ›&™Qe% œaÃÇ€½][~æû³Z¹{ð™âÅ1¥Ÿ- ß7úŠÖJ½ £°IﻺЙ8oü"©G씇÷mBÑ1N¨ÿºjш‹;qi‡ç#z?õLˆp~Ž‚‹vhÅ«Œç÷ôõo…†O÷P&V¥:½¯ÀX/Oßnéú ÚñL‹ zI{pM"êRúïY†àu—òFjD5ÐýÑfmoþR–ËcÉ™ÌÎ)¿aÌíQàîWqÛ „:º‡y#R5ÔªyôÞì¸èöžU‘³1gÃT&ØC-³_³ÙíBþx.J€9Õ/ý e áã7¿ø)î£@ÚD*x;iXÜTxðôê‰]ñ´*îȳ¯Cfåºqª¸T¯7[Ú=É3â4¦èT ¬¶éFFèÌÿZԻ݅“æ÷‡LªŠ*/nË€±åk;nóÑbçºkrËÖ¯¼í„ŽO>H5B«£-qù¶¾eLª¡^áÉ”z‚4¾DY€f5±äm”5ðµo9U¹ž¬dÕÖ²†pGÈ I0 âf5‡{©yÀtpë´—#gÿÒ“s× 4ë·O‹ôÚ Ø’3Ÿ­,šÎøÞû¶Œ[)Ý»?;sg%eYËô ‘vùÓ~,–ýÅE¤±ƒ³p>eXyq—0^€Õ+Ì·&zƒ¡ãP…ÌiÒó¢ÔuÐl'Îó÷1ˆ2Éå8#_œxe²¿ö}UõDî­—öÛ—½vo¾”]ç8tEoÊ,ycm,9õ/ ¨ØcªÞ¥#+AèRåÔ(Ãú_kV÷®ê½ð £ÁÑ‚ùhkÛõªY®ã]ž6Þ®JÄèoçY¶5+÷¥’ïÊapÆ:?¶Ž¶n)‹mù´\t¢ß úk2ÀŠ vû8²Ûº[VüXùÈfN?5!9Ò'½(bísøøjmõ LõOFÁó¢)ˆ¹Âɸ?àâtÔÈž¾_o…³Qãß>¶`õ¾‘ߣÇÓÆœ‚Ú_Öç넵 *"#˜K§œóÉÕ·€ÒeÃδjx?X×Â:D¹vnz’ª$ôiL‹iâTç•ojAxë÷x|®¤9ôÖ.¥¾ØµGªCâµÈ$‘©œ¡slÓ©| 2e¡÷¢ µ»meqŒ:¸/'$6g4ýˆ£ëNû“jP@!áñÀ 3*ÝéÍiw\]s»¬ ¼ŒK ñˆÑ‘7¥é`J^ € ±Ã;f¯6˜l £­ÕЇ,°{í„ÉnuÙd ¼œÖwM¿Ø‰>3»‹Ü·ßP®We›ÎÀK/±.kmj«ÏPYÀ½!l_iùiY°×Øì—Ž©½í”â¢3×ÀlžEM«uÇF×cM™z#›Øèþ$4T¸tOb½†ý n­Ù3SdµÛãµô2ûi{Ö+Aª#%Øz®">:åÔÇIyGucÌ^&–+°8ÀŽïÁsøH‰Å÷K¿èòØÀá…µ\ØV'¹ž¤‹UÁólþÄ8Pu¤“”å{¯$ø)Å7©œÐÊeì²t ~|¢¬7ÁC ¥Ä’b9© ò,îì¿Mc;÷ë—”‘¤®v½ï§öGœ—j0€ÕË3êªý ÜaZ~ç<\ãÉuÛkF•í+L·$­×"º¥22p¼S „ª»\ÙL ]£f;f˜gZOa‰û®NÇ>}{]ü÷·‹ò'L<âŒÝZ>yëž1» L;ÆkŠÊI‹I[¹)Ž“+EF–‹¦¿fœÃ^4¸¦RªgYêždqë½…tµ˜‹Ý{Í‘ÁÁ娤§P›ðÔ ~NȈ½3Ðò$Ù ›m¡Ð´•–ïo UI~S¼< $‹‘ýàau}äÂ2KpB[Á‡» £€ù ç^ ¥5 m ·×zæ(d Õ²(8¶^8þ‹Í +"ËôvÙâcm\óPƒuóÕQ~K†¢È%q6©]p¶‹äq ãš7–aŽÑ,wEšï¨AÔûÅ»ðv›Ð[‚"©­°/ ~põ ¢f±¹£xÔ•XîàDxi~×#‰¢ì”A”«˜×ˆ5u³²oB³¤Upø'YA°‚{Çé•Ó£Ƶ}F*ä™~'_ªW…ËEƒn6åÐ"þ8‚èæñtrU#Öîù«ýä  MŠ‚¾ùr÷5b@¥ìdWq¯Ù ,\]ÝsKð7²pÍ¡:>EÊæ—¨Ô¢*w®›¿Ä$à}P£oìo…êúˆ«Jg1& ð&)UÖKg(!§4’1çø¸b]í+h=‡Iž©ŒË}+З*×ÈŠX=ÖyDâ‚Õ  qÕ/Yzg­ ¹Gån:ä3:ŒØ`ÁÌf„îí¾ü=MÕ€F“XÅÔ4O;-:´>ó™TeèŸÅ-Nž™å¼TJ›!”C6A–>Ì g,· Ç¢D1s¤bÂÆ]ò(Z™´²{ÃïN–YìéèÝó]§_M$Ò>qÝI‘*¾¨Xe²áVûª¹¶Ù'xyr‚Ây‡èáÂÐâP9­—ßtGW®Þ®ïV³¿`Ç¡ïdÈÎâ„ »yô|$ꮽB_…óQî¶ )òk¬+ïŠê2´ì Ð*–zdË«½sD¹¢o]³À©;(kWYŠ%èm¶Kˆrò4¹œMsï*R®Ú!¡óS PÙ=|h4t`q/ƒ©=Â}7´ƒX/¦+ _©‰û—f©ÌnÈà^Š1“I1Lsâ:5wéFgó–þx‘$`l¤Öÿ|÷ ðý,bßíd\Ÿ<ý”ïp®«vÏË•ùŸ÷ÐË£-صï†;Œ‡ ßøk½þ%¹ˆL œh…ÛBoÏ“”[s¿„Ðûw³ý=ØÒé Q€Xh)°·•¿˜“kB%ê23¼Q Wçû:Áen^1Þ V£û:Qjõ­÷âè{òŒÏ)‡P$Ы ÉÐí<ü–²iÚw ùê†dõ) wµ¦ø9‚§2€.ºõº£@°ë°xðÌ?»|ˬ @½EŒaš–eˈn+€Ø™TT»~Õn×bæ_@ŒIIÊýo»ÅýŽ&*F¶þ¾-ùËé€XM ¨%ÙPÃôgV7†Îà ÍN»IŽØVÞEXIf@ãžÄúVéd£jÙý¥÷HÐ!¤ÝÜÉØ½£› £%;Íu)VÎä\² óKc‚h·œ¯ÜCf3!¼pa>ã Sô´vÖ/ÙnýÆ{e ±-OóÀ:AãiZ1]‰€%R^¹g][1n °o*´HÕG‹Ô¯îø™×UT4Ï)*{=S>;áöŠçI÷daÎUx´}õ¤1ü+†![K”Q¶‘…P»Œ»v¹k"ùW}Êjˆyª|A%;D`ÊSŸNú›¥QÅqG´r“+X‡­â¤–5e"~p¡ ÃÛ/è0¢z¢·bëPÏê+rHÖ6TÃÛìÒ3ÍX£P!+û+hÓ¯B}È5=k®B/úˆæÚÊ DÞ&(nâõj9 IÚ±¥¸$†»f*Ôéþ¾•úÛ?6¤P¬6ü2 ×ÙÍRl˜\‘òÇv°Ý6Õ‡iÙ®ÿ ¬Õ¦pû\búªŠLÂV;@RÍCÄço2Qné#NаQòá1BÂõxÅpCSʸCl¥è9øì$çìM6X“ŽVÆ*ðZ²ñuj½·+ºi%¤÷—¯Êê~"?6B?ÔÅà¾r"Ž=¼Â€3Bîqz>PWžVËL°—¢—©×K¦ÅÁ@<–ªÃ$íê  ¿’C“É=eG£t) è³œFå¶Žk6°úa È|—`èó^²úˆ³C" %k)­/PÌÊ“º¿bˆMLå±Y&zúêséH}ýe˜¨7s†Þ„üÎDÕL– Іc 2!ɬq^5@éÆŸ©@¸YYôÜ _ žèƒé?Fªõœ$ÙnsâDJ7VÛJFEžóæýÒ8šVØú2–) ÉÂ{+nÈü»eGàwE] L§Å/'þb‹fU4*àë„hKÉØø ç‘ì"±¬G‚OÊ‘¤\]WMr5š¶¤¢Î‰`ÿ‰é5cGó˜Ã«ÔFQ%ý¸CÑ]Îǯàÿ†#Œ›6ä¤ðmFó,þàÃjqðLGÄ5½Åkµe ]/ó! \ëÔe:È—Î??@ß mû&åÒ` ÿk$1p“ùøLdj”Á§«°‘ãs¸ý•]*ëÝÅên߇ˆtè/ÞBÖç-bƨ¥p#ƒæ3u¦x£™d)?a-Q…y±ñÑzäX±i³_>Q[W!]Ã8·ÜÙ ññôòHcޝò&¬»MÓ±óîaÅ„ñ lç!#'–«ÉØàä×.ñ«=˜ácòÌ‚¨5`?–ÇM¶ˆ‡&UM¹~¡@Ì·Š¿e×\ßÊüµ¶ù\ÓˆNîž –uOé¨\‰3z•e»‚€ê<°¯Úp `î‡ýRšžâ÷œTÈÉ!6ȶšÙÊ4dDâZ‰š×îÛ|{6rCxÙÈ,ÖeâøÛB~^’B‡Ï+ [‹½¤\†³•yÌâ>†¹ó[ éáËM­n‰–¬õxõ…ÚG^éÃLúàºÁDj‹)"á«êõ–±E¢)zÁ<œ©;cl KJ½ýZ˱Ðî4-‚"o¾ÚZÓP(œÓ¶yñgYünVôǹ[y¼*ÊäåR¿¶Á†ÚuË(¿‹-Ì“ÉÆ=ì.³–sS­U±ê€KÜX|ÇçEôéy…LõiVˆ0m|i ˜![Í ‚XÚÄ­LUmøÈÑÞ «zjÿÊÍ*œÄ‹ò©Ã?‘ä…˜U•GÕ˜J&zy¥¥ÙÇp’Ç™ðw ŽòÅ®áä8¸¾û-8ÕeIÉ({΢Ù³x,ÂÐî‘“†9ä“ .ñG'NïÈ¢¨a—¡½eÝ@Y|.R U¡÷SÇëøæ-d ïó Ò9z"<¢ åÆœ©9A¹ãÞlŽ+Ë+Âú@ãt’æpm;®¯ìâK%)œÙî µ6ÇàÚ‡]N7¶x?[uì™èp êÎö±-]í÷¼¡4æ$â+š n“ëoÁ²ZO^ `ÆEƒÜ˜»*™zã¬óÛ‚Ÿ’_Î×<ë&a „R‰0¾µoCŽ2}5Gω~ÈŒh郸!Y¡ÒsŽùDfÂ2f«ӀεR1ûnL­ éø¸T¦§¦ÞÌwîàÂÙn¿…±ÿÐrënÚ¼_†‰ NW6YKD/Q¶å[mµ7M‚8‹¼ßKEðV²ßr¡Þ¸ÇD¯†úµM£ª1¡ÊŠéá|™‘u³Xþ^t{$ék£h˜´€ÿm@´Úùͤ%"_F@ŠS8óúÜó)³ ž-Þ—ÝmÓ{‰˜ÔMé€/çïRË„£ªéGr‡øè·Rÿñ¢ö{qìnVQGЋºH'&UíÒ@AÀðdÔ…¿Q¤›†Õñ¦9²÷øm\ÑcÆ\ŠkFõ~x.êzÜô‰ Á¥3åj½Ñ< Ã}Š@:ȇX¾¢AÒ pÛ!Ù(½£æqGØR”¼¨îõg$·ÕëjÀöô’u®Kp¤MKîÑÇ^á¾ëI¿7[€Žšóû*F…Y¾Áü÷r Søõx#(Üv(Ñ©$~u3ÛF/­wÏÜ¿ÛgÐö¾!,>ì×±F™4Þ 'ð ³tEuz_®C‚o»GÂÚÖð‘™Qø÷ä×#DÁ`”YÜ¾È Ø QN*cçÝy‚µ+´õŶ¾Gª´Ôj8*F÷ìÏ…'n|šðÆØº£ï !üÅìç¡â¹CöIí|Z>]ÉÂh6!^‘¯G~Ô-CºžcÜ¢¢¤A9궨 ÉW¶xÕ,Ýñ÷úÄÀô‹*Çel‹ÚL\dFÈÚxà>Â’2PÙÛ\iâbh;!‹Üoã&ÍßôÃ׊ùvïÊ?|`áÕe$ ‡žVþîÙsb »£8˜U M«ÃÆŠ#Nó zÛö…Ù¢’HUÒ–b3ú]¥ë‰#ÕðÞˆ+|1†±‰ê2¦iÚ{.ÄŸ4 ¾ÉŽÍy@„Ä^¾®ÃÔà:Eçpññ¥™ºæ Ý^OÐi©äªW5Xkå)]~iÝÐ<¯€N»n¾Z¿s˜ß?O¬„j·ö3B, ÛÖ(ÏÏMvªNIû-•šAÂ5hâz9œTK²‚PØ\¦«Ù ÇÃZô½Ô\>Y;a¦”¬¢_”[<ë(­ÑgnR>BÐãÊU(ÁȉÍ}çpsb8`da€Ÿ3Žis…¯·¸ ˆ–LZÆ\“[¸Ý}hÞx·ÔWhÈ © õ” ›ñ6ûgÖÇÁL´*æCF‡¬27þQfÓyBu§àF$µž€¹æýa~ý×EªFuÉäXïG7® ˜3 ŸÅòu«eÀ2E?µ£R˜hÈÉUY3­Ý([¢ŠëYÏ,rq2Â]vP¤pŠÒÖsãyÉz_]Á¤…Óǹð“¯!›*rËa¨³6¨~@{=©ªÖ”L^φüF²K…%º’)Õ~`»hÇ9Í/(¬}2 äÀC ön„Οvú1~¼œûòy,–§“çêˆü,à}› ç_“³ã¢;n ¤#kzã*b\(LÞ¼3êtóüäŸW+¡[©0še „vÀä“«×Þ0âb–»óôZ†uº@Z›ý5›ðjœŠ˜‰üÂð7ùу5£Vëº>“Ǽc¢õiŒ´.[ñ+,¾ÑŽ©ëvÁEÖB˳3€cp+Ò[Ü.¶óu–¼ƒ¹CåØô.&3N)=¥¨Sè²ÍnµúÃôå¯Î+5 h&˜ÜéÿÕרIÆUEY15Z ,êÊ#-V…wÙ<Í:ç=akÛ4Šžëþ)ð”íZȳ –©‚æA4~G®ÚÁZå7Ÿ¾•ÚƒÒåvßñÄôå]ïT?éI.K£ú|]WÔ|„Ø r€“’ýµ¢B›CmK{Ñs—0»<ÿz–k+ÑDæ™T$h¦˜ÎëÐ3žO.ÄÇѳIJ_‹0äIÓÜ%[ àž¿úö2ÄKÕQ¡g‰€þÂ>ÐJ>ðÞ0t|›Â@b¡íÏ¢uˆ­ÿ­Lì[£ÍÊgÂB?Ž`ÎÂu gµSdz¶:§Š«2‘=ÛAdø«ûq$Îäˆ2 YÚu]üHÿ«C82˜°u|07n5’>ã ‹‚ŽCÄ|–$þ$wÜÞÚÍXlÎ_{2N‘;FȧZM^"'~ù3í`»/Ìèeê}FNÈTq¼Îg`JÒòX)¥+™É_ER¬aó¹¡þ~ôgÊ|´gæ‘Ã`úê5‡o—z"èEŽ{ÊýŒqlm›ö ùã׳©O§ ‹\ÌÛ`Dìhæî åñög´Å#<Ñ4vÖ.”æ…´Yc™xND %°ñ¼“`3nR«ëˆ“Üÿ•-Þ½º½QÅã/}¾n°Ê$…P¨Cñ¹‰2ù^m[hÖ§þD_ ÖL™¸x•…/­ôÅÑ@ý_øÏPÞêúx#(tçf:íqª5sÐL›ë¥P·Yf÷á[èÝf‚ƒtžI±\†Ô´6CÁ¶)°ªˆØbëGdÉÛK4³h#m{æ"Ç0}ºå²ØÜ®6ç¬jlõÙ/ ´'õˆdrnðí#Ã]\½w3½:iLâ>…î$åSÒvU½ÿº¯: sNû –{ÈícGë„Eö\¯œ#‡^Î, o¨Ï*ŠÀ&šàwÍØu¢äÅù»'wá+dô*hë8^¯€êq„ep¥œ$ŒçÏÞýù2l˜Ó¥•s©‘ëä!ÃNoôõàjëPiU¥}íɆãhrv•lDè¼ ~°Í!™ËÀG‡#¹à‹Bm‹­ëm¡ý€€| ~² µÈÞDri½1HÖô§ÈŠ-ƒ”ýCÑœÿ5f³€8vPÞõ )“¿P0$¥S®xÕg]ñ@yWý¾zoÝzøŽtûLÍÌOd/`sR!µÂ†ÓÊ$ÑæŒ ¥{á˜:¤/0J ©¼ªã óK‹²#OË?qÿ§\o‡+”;[õw &žáQ­pÓð±g*³:IRãPoÝNÙ1 ®ÌÚZKÊAK¥-6µ¦W#ü5 ÃÞÝ[ŒÝØ2KQ豇²P  ÖM (JA~¢-\Ϙ<%ð!Ë®ßÏ»z’‚8Ðq`òÈSSöñQËz:¦a]ôhü `MGZýÁ`µþ­i€†Ê•&‘ÏÑ ñA«¬/@ÂwŒZA¿¯J·Oá=ž×õŒ1g”ŸH©øƒM]Ïg¸4å2eÎ`§Èòñ–¬{%þOý&ù1娑£¼íU2®FÓM B¿ç#Ê•FezAÞY8i"*)†~4n†ñ'O+X´é¢èíbc>näu9Pâã»Ä¡ÜCÌ!XSb±EX¹ Y‡©)Û0üá–2Þd"Ó˜th×ÇÜU?Dz¼W ¢#Âþñú¬ÉrÅÒ=¬?à¯&q² Ä Ã…?ú—&„`%‹µ®˜[ ê¢=ÀGì› zÁšÃ>þ=ù 8ù‚¹\°hGGºŸLġԅg”ì’cˆ>ÈàAuN'u62'M~2^0>˜¯žLê´{ÌŽË‘÷žr}VŠÈOz9ƒáÏíꈔÿAû: 4ò2c¹©Ái± ”¬·Ì[_ë$ígÀ.­ÍìÓôÏ0eN”¶f\›¬rQÑPSc©„è~}âö·¶R°¹ãßó³ÐÆ©> HhA¹Qå:T àIKYÛ"o'bÓÖŒl5ÿÁwæ<Сٌic€D"™ýJG¢N퀊pE­F2~åî®Tv­Ô~‹79ÃÕ<.8ÕKA(7lÖ9Õçl°ôU¤¹³ƒ<ÈQ0M Á¿Ù…Yx¶éNHC›÷…Ÿt— ©Ñ$`¾×¶ÄFˆ²¸¯k%}"«AN‡@»Cß䚈ôÀÔzë¹äƉ~ìVïO‰xaʉqK³)±@98¡“f­þ]Z‰ñÜÈ:ˆ‚Ê´-výFÂ9*lù…_ï<Ûýzƒ{ŽŽ—D¸Ñqε”È2zš‹‹ßÚä©`E‡~°ï'º¹K,3ëjÎujÃhz»:¡_ÉëÐÄ è9¢ßûwÃHó?‡0úÏwf> zðïrZ¢#î(±lqòíŒJZ|-Ä*ƒx¸G2ºi—Roç ˜‰ŽO[s —xu£|§9vgy3ö Á<ÅvX>L¼WB&Hñ"Ku3êáŽý¯ K{ÈFÀÎ/ÁÔpL9Ôó'&Я¸èž‡òà07ÞcQÄ;9@^—ts±†Có ø£v|+ƒœ¿À <ù tTä¹ÚõN‘àÓ‘¼•!É ì^(lVØj³($™Ëèj7[aÐÞ÷<ªѨôæ®ã-g—ºæ×[âu® üGéáù¢ÇàòF_%aã÷Rt¬*'¶öœšùI×dH DïßþÄà@J%iâÚól¢ÿ(¾ˆƒé"}Ú5A –¦•¯Œz#Ä¡È ”ŽÑ™M‚Û®´”BÜ#3PæowÉТ¿ÕS¶µ¨í/ö¶}A_Z 5 <ô+~O/cºâ\Iø¶c"Búªs»9ZÉt‘zùvqrö½ž:^>c6ÅÄpÕH¶}‰„”'ócP'\ðlUK­³F߀H@7ꆇšjçÄéÚöÑûÝößP£’¨Ô¨ö.íò¥œ|,,›ëšõífjˆLþ­ ëá¾ý ¦ßx ˜8Ô«Ì`YšíIHƒ¤@#¢=ͬs˜žªL(oÃεèÀÔÇTã¹F j§ôJžìýsMÐçÛ¦+âÙ?EáÞ‹<àÊ¥@keæk$ó¬ dä€\ ÎÝcAÞÇËa„ê<»sÑ5QÜ꫺ͳ™( Fÿ¢ ˯“¯”IÁ“üø´MTñ‚9^± „B`•JŠRBÝ“Aò›Ù¿Ÿ™îJ§È',tއøt.;W‚ P“V2}½¬ʈoøEä;r®h§ÉX¸yô9C D+ìFbÃX€à^8â-GƇXïy³%åõ¨|]0v8ë7É0–Ç5|Z§m¦µŠÅ‘¿É3)ª©CÕ¹di:ÓŽ‡£?z¶¤à_¾ëNœ]jwÄ#ÆÌDÚh­\MB<Ö ‚:ÉÆ” $kB."BsÈ™_6ÓòSƒt6—>³ ö6W%…MéüõY·Ÿ<2eÃ_šôË¢]ˆ/­å›“ñŒ?ÑK€Þ“ãXB†EsV®w¼$9Ô¥áD‹’»e¨ÊpZ1Ï›± 3‹ WÛ‰¦'¶®SQ¥ñÃ’æäѹ&‚ ¦~*ì~‰Nüž&¥–7Oo@¦tËÙéö=|Œ“Ü_qÎmS°~œä$ΣºO-»7²v‹y›?Š@èÂï?~T€¦PRMEŒô°n‘õtìPeå"”ûjûxå•F±ºÏmÑêÏD.ăòF-žÃ8!ué4)Ó$\úŸÂíÄ2 ’÷0Ŭöô­ÖmùÃmØÓºð§å$¥ù÷Æ §¦"‰E¨îОîUPÍšuwc]=ÎïÌj`[ó]} ³»ÂWÓêêañ‰FE47ö`u…ÔÓK$…®õaZn 1pžfËÉ£ëFÍÇÜ»^ kù@“•‘‡CÀ…¹öø‹GÜ÷C_KÓž6uäAо”µýðº?( $ǰr¬N}§ÉÀ ¢!ï >œŒ2DŸYg73ñaû$©êÔ´5ª[Ê¥ðô^%ºÃúuœ,Pq‘7¨*øÑ:é–Ÿ^% :-¬_å/N9è)ëÅ;âû½q~úϺ„¤f4?2q~¥·EÀÕe–¼eJb6Í3GÀ)!•céÔœ &ö_ú«H'åÊ(DcÊWˆj·°ÞLÔq%J;°ÞÊ"¸‚ƒî}¿oÖ –à¤܃Zdê[ê4ŠY,ëE³jÙ9½v 3·±Í0–âÝß1=Eß8Eææ³De@–ð‹•›AKlM—´›?½Å÷5=k€[¾_Y¦ëŒ«ÿq–O-V©6›dh¶9{Wwü•’ÇàÄf”áó£J¿¾Ôd6kA¾k#Ýî Ø"Äe"æ §Ž'c €c¢Ù±Kö­wuVyrÉúõsôÛG Èô‚ #‹xh8;,¡¼ ñŽQÂïш…”Cêí.ÜÂS$Xù°ç(¸ÓVvï¹îZz†8ÉܹpXÑnöƒÂã­z{ÁÔ+0o>ºO©W¯D%m8P¦ûÂÝûzìT% oÂcÊÀry©Š)«.aÐè…‡EtD“׌I‰ï‘ásÓmÛçŠRm\btryðu;Ÿå{eèÒy –Ds{㑉¤ibÏ]}µ~`=lêèºÙÐ;ˆŒ­ãh—× ©s©âÓàõt¼Ž²Æj=n¸ôC8ärS‘tOÐbu]uá Ì«F“ñ8ˆ K ‹µb‹ä!²·G^˜|O€Ñ®/+V>iFbÈ3-sGS+Ø^4WG0熓H‹BfŸåã_ædCþÒ¾®áœmºŸ¯¦íH³ÈëPœ”–j­UéÐß”òz‹„f[@vœ{ÜR)hÔ‰×-…fÑ4§µ¿˜OWKSãvÐLJÖyRÎnˆêqJ É–ó£;Lðb½ÙÒÏÈÆŒÃCÂ3}ÙtÕùÕª‰ðž…ãBè@àFyŸõ¹óO~IÅêiݨRí)óÁÒ¡ŽñÝSÅ=6Ï—^šÀ©–´2‰515µ9Mm|¨Õ»©bôÖÏÜqO®Åe0Ê5ãfJÈÀ\B€ü>Ҥ꧒A¬%Ž…F$¦RÇ ·ZDš‰VýÁÏ÷Uëâ ´Ç<PÎGÆ)Õ€§×L>ZÂÊK*"sx±Z½!3{$z½%ј/“‘9Ð3 Ã_õÀV{˜ƒºkÈÐdáš;Ã[wÁÔã.›d’X•×@Ü·ÍÓNúÄ&@§}íó‘B9ÛŠ?©R‘ c¢`Æ[¢ÎóÖË ‘I“…M뉲ΗàÀtÅÂnÿ»Õ»êx¼9€¬<“¡KiQ›è˜U6V³ÿÎf ;Ÿ¥ÂtÜëfgSzø‹ËH„å3•‚™v‚æÏY2b’ñ“ÖOäðPS4¢æÕ¾"fW s¿NH¯C_8ôv:XâE NWË{ Û¯#JÑU%ƒýó¡VM"@Ï3Ñ]éM)Œ™~‚¥XL³÷Ê–ã–Ïžÿ }­X %³ÜÀvUƒæV]6}ãÜ\Èõ0MÆ{d ѼMGÓ\åÍÔÝ™Ív”ÿìz“—•¼Ë<¿ˆ@T,_p ×Âæyƒ©Á˜ŽÁ0i³A[´Ö£~U&Ÿ(¨þTìEÐI5ÍŽÒ~ƒg–ܬÕœ¸ÃÚs@šG ÒX6ˆÝ¦Ù&îe~ðûÔb‰PÔ!ý³C)$%¿dÒõc¤õï´M¾ß¯5üDÑmäˆq|yë²ZG[½éOXA×'©w_ás«–y;Ø™êy 8ßù=EÌÒPcw|Ìc&L{cäî7|ÄÒt ÉF¢‡5Ýfymy3ŒMŸ‰§|üëˆûœ.fqØÿuÒÏ~jÑ£äD¶åmn•-üÒ£oK§? Og.ÁuÇ,Õ #Y*Ÿ~>á‡Ó›eb ñÚi-ök÷7ú_h”M PXe Íçß(Ë.Ù>›Gi~d*H5lªÇÏÅ€Ûë+îÎüaùs ^O!©ŸÁ&®þÉDqªïWÈiù™Ú<Ÿ&1"O…ijš·èæNØA:+Gu;~øÁÍ…S¤‰D ª(H èpÑwÿQóÁbB8žÆ…I¹îjÚz̈́آYWZº[œ ç è9œÚ9‚fœ`’–Ì¥Û ‚2Ô}¬.ØtéÞŽˆ¡÷:–øÒ¯ëêOàîˆ'ܺ뱇Io$FDÉEÅÖgEuR…°ôA£vŒ2Ÿ±FÄóéç5†ÔI4¿m‰=0ÄrÇzÈð“RãfõŸÆˆj;Nùþ?H#Û‹bvõÄ ·MÕ§C‹0£mÎø¦¥ªH‘@XNÞ׿˦¤ÙU¿8BRüOšBÔ¬,R£"ªàq=WGDÁßœŒÆÙ RÖ¸#ÄAÛÕ7ƒèÃph$EZSN1SÊp(쩬Dªñ_¶ _äO- n0Îp¨£ê8[=N“ÑKOD±P¬“Àâ^©çnÚƒ––j–ÏÓå•ÈêÀ"-÷Š×y˜Ân›×{vß±í!pbæá¢5š]1ß2Ò×Ö _«oe)N×¹9„a"ø™bñº28 õ”e¤¦sä7ÎdÇ}è@˜Óø/4á ð*nËÉMZ³· Ì¿—NÁÉ}2ÄØ¸D‹ŸÊOV“õ!%‹}TQøv‹ŒÛBhܶ4§#óÀ^?óðš òVËÆ¸RYp,2> Z5ncÁßãžšÞ–Cïòjíšj,G.Ìþ8æ>ˆ>ÎI„Í­‡g}À× î!©‡f/rg¥Æ‚÷èÆ4ƒIyt¬&NqÎ9<°ÉÚQý)’¹ßöèôœðÿD¤T´Ü÷ q½·7ÓªËmºnƒ90œÝ¼³8Ò0|·É¢ #ú IÁú²§ÞÜ1Z+Tä©§Ú,(¶¦¸Ï»â’ÞÌÉZt´Úaß6ôV.“S¸·Í‡H¥ŠCÖ U´ kÚP‰zÄRÆptªs##Ó/ß lì4"´ú¾¿Ðh'ÈÚ4¢Û¥¨Ö ÛÓxriÔ´I%ßUsE?<é0Ø®:ÊØ‘”Ûÿ»Q%£ú.#ó'Éù’ÒbàUFma|Q6ùlŠíÿÄzÉÀ; š|„™½&ôuì«ÜJŸ„¢1a„Ý +NÔôœi|ô 8ÎCžûü~j?5‰^üÞ©aO@“|8±_àÐB§s«á. ÂZ¶L[u‹Â¥Nj`¡ö î÷ÙЬa…£K«­ˆn¹&Hø×i@_ýšÞ¼~Œ«Xü9u7ûQv`;Ä“cÎ Ö"œÍÍ—ìsŽ h4a°¼²Ç5Ú­¡<ÓŠrYËñ8‹ô¬hëEÙêÓåk1`bKËiþGkj{Ë2ôrR〺ûºït’3Ç»ó°%í´­Õqp{ãè­4Wœ@‹#Á#¢9•˜ÌIúåÁ Mñ‹E¨`i;í¹­–y?™HÌIYpÚ’Þ_Xó7§i«;ó3išìôùă=oÅÜcv=·‰H©ÍP<ÞèPí7÷´¯lmÙý€Nõ+õ÷òŽ£‚{–bÂýUÖYÏt¦šðö/“ØçåÏFSuÊîyúï_Þ¬"‡Äó°ÈøÓQlKQÃJ–uVg¥\c,‹žýCæ™cæ#6ò²¹Rípò˜Š×¢ö*ý[qû¢zôËҖ߉MÒzŸÛ)*H@q5 C„{ n2+ej®p¬§­Ú¶ÇøZwÌj·Êü–"SZ³¬¸YÆ›ò½Ðݸg‘”™²¹ºLíéñ)ó3æ E,üë7ª ð¹A¸âF©I/òOå“” ã0¸Ù)È6íüEÆõWU (ìå]`~À¿,ÈÌÂ[ò/g®äìXLY5Jm*ÞöX7ÒŒŸm÷ ,HޔͧŸóD­¡aÃß\ Àâ{@´$†¼Ó@M^ˆem¥r#ù¯š"dbfbûÎü¨Ö‚„ù"u”vëW(€KayÍïµçó˜  »¾P͇\®^yü0ú|ý®_p–k?j-Z¥—Í„eAeŒî" ·÷MB=Øý‚qÕ1ÈÒí}nÛ˜Å# U„ ¬·"RSæÖ>²õ!ã¡)¨\KŸ‹k{³F ÃSÒÁRºu=íä&"̧xá‘b“‰,'ID¨Ã³…eæã±Å—Ed‹ãŽ'ãçj€}³u2TÃOt5+|ÆJ1r3ÿÆ4qÉ5»³ÎMÊ)P¢“5gÏÚº·Úr…ÿéÍPîö=‹ÐS’!íë»Ò4þÈÊ?µúµ:ÉJ`DÔNˆTÝÞlDö¸”²K§²1vgÂâdh¸ !IÄì!S¤@ˆDNÇ›*/d™ò±¥+M‘{n6ÿä,£*ì0 E1i6$«‘¯æ‚†hÛõ=)ê×®Øð¨îøëÍ*] …ø|(y–›6Cˆ°Œ‚õ46‚¬†Pßà»È»êŒñâô0"Õ‹/$›¦‘oÒüò«yȨ·§mÿþݵîD\^¤^¸®9òFÇC»ƒâÀ2eMídóJŸ”KÏ#s²ázÒM× #%{¢#ävó‡ jtô9ôV¥ \!d­Íæú!þX~‘ø<¡¤Ú²ùðý„¤ ¿Ò“N¡5&ò,8ð°ùJVQVKïv¾bJ˜Wu{áw» AA•¯K’aC‹„&I7–kϼ/^/Ц»Å8…`8šd¶\ ¤¹‹£»jXÿKÑ]¶7†Ûº4ZYγ¹ºNe‰K§hߣ¼ðš Á€jH‹ªµ¸'¿ÆjÈ**[¬/U5%=èײ:yñmÖâ÷øJ7>Mi½kº¢aØQæÜ@ëF‹eQxÖG­ƒ.G \êz}‰¹„ <L܈kÚ"•+s³Þt¬AÖ&Ë`†ÑÝ¿§Š¸½œJ¤§m¹oGÒPÅÌ7Ór”Í’/&Òg9('ªÎí´'×Àݶ7´›ö·²ïVa©ÎH\qüãäsœ²¤x™ÞÂ趨NãŽÿ ÏóAÎ~€°Ž©'Þ:øƒ|ã…ìýý.é[U•Þn[¤ŽœÆSö‚ˆ'³•ìäH·ód;ŸÍå Rê|\çÃý{;CÇe“ÖŸÀôÈ~¹)²A’ PUƒÐ3$ävìïät2üKÝè½|w-õ^½Üv˜Îy‡EñÌtû%uÞcý¼—î”<~WYݤl€|PPÞ½Š ä‚®6{M¡O‰î u¥_ $øÚò?5zаt)§oj·“5ðí‹Ùê,vÂ{³õ`*R³Ðú‹£èÝÕŸC0“Ű˜•ôÙ¯ý9ß6Ò3’ÕÊÎÊ$ƒxÓ¤Ì¾à’³œ«ŸÃôJq Ö\f ¹Ðñµ3MIÔ­C§Õ臄áÝ­X_6žó óqY©vBï{3ADhÁã^"?"e–þ [ ŒX©T êCQ¯ÁuÒ$/ÒѾ(¯¯¨wIƒzMEM¯ž+v¢àÞ1Æ4“\dF IeÔ¶š :õÁ©{øÄ#ïm†Û€@ñ…U§¯³$ȼn_2¿<ëOÑJ¬,eU&_\”ÝÞ?ú×OP°)_ÆA$êqð­ÛM:q9DBÔò›K9Wûäl¶b24úÒ¯ÌÛHÇ:³¸R…AƒÎ;ø8Çã:ÉhüíPDv³þCõÔ>ˆb>µ»:æû´ ¾Íu¾T! Ž«qUnÈ…<¹Â0\~½!p[¾Œ41ž¬ðàÚÑ-Ee†²æ¢ÒûjÌ}‘-Ý#+ m—{ÛØ$''Áàû&›m°!Z0µØ»çÈ¿‡¯ÌY¨ÜœÖ3ã\›tÄ-ò• vv DÞ$ šùÛFù¨¦Eašáõeĺí#†þ‚éÊˆäÆ¿ê­º^Í?òÜÚ»[KM=õúÅ‚Y³K¹:/ÜŠúê‚ÂíJMÏ Z õ®"˜œ¶ËTPJWWf·º=®ÇÁ6›N˜¹”Â’ÏéIdì ²¾x³Q¶>4on›|Bm2ç1É› V. Ý~7'·=à^_à ™Â…(š5¡Œ|ƒ*°à‘AE$¿ê¬?ÍαGÞtž2ie¾5ðn "æñrt…:ŽÞ{V†:áÐHà@’(Ý ˆ &ËÖ’ ŸKÙ¯À/*Ö§¿…ñs¥SŸÖßýônÎ!JÊ‹46¿W`>lwS… ¶Û·C?Íu;›<œ4tYev°¯ëÖ3É”,üIUe íj»†²nî 2f®Š³¹Õ•¢å禭í‚ ÐÚNÌÒ#Ò.™.jYG[ÉÞþ½¿V¼qÍø$vqEØCª?=øFKZ˜W &å—»‰–ÖR˜³ú¶¯]]ä¢â»¡Ò$e¢»Xü¯6¨3·b?‘° ÷W)»¶åM+ÜÁúÝÜ`‰ëc’˜8èRïÉ ÝÂãŸlöKÏíçÑÏh;o)Š#Ëð^,’h[ÿíÖbYš Q|¨‰9=VóíÚàKÞp¨ý¾òi§ 酪ŒœAê"§³‘†ùL ‚VÒÏ÷µ >wJi™(>oßU_3y ÁeÃnÁÚÉŸwÒpW€j¤ø!Ö¸g N;—_¾Üw…œfNÛÞœ²ðWÊ´¡»œ=ÛøÿäTõ×öž_~··:›ñMBí»õÙ&ù°¹Ã15­‹UA@šsq:S‡IgÙ‡ V>ë®CGVGU dD1ë╚-ÒÞd••þÑ€C뻞5á cUÜùCž>Âà+BpâSUüëÐ~€¸•ZP&Ëý¼Ïæ»zœÂy tØ™w¨ý-ó¶÷e'(ÄáPs‚ؘ:ÖÈhÅ+ŽØ€-ÍñTe´oóðÞ³8š@6ßsÁÉK+ÓP«"gh“8൥S e«Ï¡)))VÒ³jA"£ôx)1·´ÔO#h6•ÊʃA¯ôy€“…úW] Ó<ϰÑÒJUzðÅúu€Äñ˜‚&OƶK²±g^h â!’Ó9 ‡N+§²’‹Èq¡9oB:JJEAºY¯\DY‘«K><¢Ñcë÷ ðr#=¸$Þøí¹ñÀY‚Ï¢¯pñém•>ïb÷¶s)bCË–=%™üig_¸ž¿§÷Á×ÞUýb[B¿Õq÷Ë©í@¸ ¼[…7¢+¦eÿÃoïbè‡Á¦ð|–Ù(n§¨±€Ä‹¾|ªPv­MK'åÙѦ†Åý÷ö:JÖ)9tá§‚CÔ)HêT.±Ë·Sƒ~páYg=AVû“œ…Á¼¯â}Ú–ý×ïVE’ß ^Í„ò:c±¬»€JdrDƒ<|‘¶s™Ì×P΄PÛ‡ÈÐ9)êüÙ83oÿöM|ŠÃ £ærcr˜¯yB·O°á×ïµ_‹ƒ&yä@“ö†rø©ç,M%…)ògªy/ÁÔ#TÔ’Àž‹ë„·¹v¶ß'B>Î.™c¥½¥)4’Ã­è ­ê.‘Vö‚F±D× X±«Î3WÁ*…½øتm4*ó3ŠîМr¸çˆ•@£RŸ3Ý›)ªÌ»@¤G#ª[å“Á¼ˆZcH~Uο{IäØäèP°xkúñsi¿$Ü^ùÖÆªÿßýZº„úMu§Zmi| í©îÐ?!qk¡•‚T}6 Sn:p¤ÁŠÃ¥8:Pçý»ƒ¯`35JXTu§²sEvg(<î4T‘¥^™¹Êuk’G¥ÁàV´ªßdðxþ9t€J\6éY†4Ô@óÀ’öZ¬ÍÂMF)xçanÙŸ.ÐP†SèÃçy=“Ý"¼cgöˆ7&{ÖsÆ„ió{A\~V"¸(ð~Üý\í••0×1S-¤ÚL{WÃöÄ{ õ¼*q´Ç½#:íscãêÐÇo ×i…ìY’!&N¤œF =ÇÁ¿hCï|°œ5ߺćÈüzïíi¸©øRÎ.6š`ÄEýi.·©@Ñ4Rë®%X†¯LAîüÉìƒË.‘*t…‘TÑõJ¯'H ~+\ûâáI3äÄ#ëÊ€Œ Q—”îÐ$S¶ÑÐKè$ˆ ú /ÙFhlsž$ïnÃÉoh0Ö€MHý$@ô„=à-d^)^$‚3†Ôd Tn4MöÁÏßJØZîNíÛ&¯x\Ýþ0ÇÔÙÞè$‚›ýÈ3´ñYc¢I+—}ʱÐHÑA×K Í}Xô‰ ¥3ΖëpãîÒ8ÏñOË´\£  {«§­Üz=uµA2y‰Bü äΈäè­#„Ä_m4\çÙíƒÊŒ+h†¿Ðù(ÁÈ&sJ6üN¬uâJ“*7¨ êøÏ=—zjøZVL¬ k ?{’©!+7ÊHH-æö±|@KÇ•‰60ýþ3F›³ã(HšwŽE ;sƒDe1T§ÎôÃI,aÎUžÖ%èáø,غï’üƒ|@ÉgöùÕ …ÓÕy¢sïÜ tb\ùH/#C¯¬ú{VÕœ‰yßOÇ¢@øùê$¢’|3—øÃ(NÄ…Rá|¿›4­Uâ­w‰È/åÊÉÕ>vHK¥Fĉ"ÖåátɆ½Âá>IÉÙêÐ|vø›’߆¨ IÊîìjଇÑCÊW¤«Τ¨ÛWÛöRðù¦Á}›·Š·’À¤Îiïfû[ `«[ Äöú|¸æ‚j­3¾<”\ïV¾¾„?\¤¥÷îu1þ°k~‡><Èq> G—þ²/ã÷½GPVVHíþ¿y®ùº¥Øq´…¯Qò”ê‚dDq»Øgjp£;p‚ÉRà ­\kèžsælõ¥g]nz–1¥Á±†±µäüp^ìò®q9ƒRj Ó„ƒ®V>¶fC ×ÐëË7Y£;(´Ê̵â›DÖïȦQÝÀçÖ ˆu œWT¤ÛÊŠyð<ÑÅ¿åÎíKŠõ­í"°—b˜§´pÏ ʘ2…Gh+’ÞX D(‘xd¢ÑÚµ èHNE>#ڑŇ€ñ ­gIDn¢v½™PñÞUV¿úòYýêfëý°×¨pðOCgµ Ïº ¥A0áòc~NcžØÄ÷Á\)ßlwPPðC¶šcSszŽï8D˜ü ©œ6êYÌU%w ”ý[Hú©¿2–ñ Ê–TTÓ£ŒPbëH³æÔRШ ~bž9—)BøÂåÖt›´É€õ°¤™{Ã9]äŠ øÉ àäeïrjfFo‹üZtn`…ê»e³ýæa‚š×‰h”¬Jì€Ñ6´PFà†¤Kò?Ðåý»·ÔJ£Ê7»vÙ-;Œ&òîc÷•ݤYúû櫎)õz»¹$}úfµ•µG¨2ý{¦æþj Üà€‡¹Wµ„kצJ±Øo%B¿ÖjJû0þ:wLv<\q<›¹º%f¼O¦àN(h*);- T[½®áë; ›Îr)ó…"ç À»àDÞ¢Ìt•ÅŠÆ@):™NV^}œÕSTUÝz(‚å¦ðìg?IED¯L~zÜ{"u¤¸Ë¸ô9¿K@Qµw¹½*E×@¾$4”Tx f`[FËó•ßýé¿xc¼j«0ÀÔŽ²$Úq—³Kû*ÄŠ@ Š%öAµ;hÜãßZ !V_1·hCQ~@ÚÔ;­ú*ËUBPô$ü+C®•ýÑò©œ‡:ˆLµCáÂj_*L%”5¯ÆX¤½È`žÜ/Y'M³Ã<¶× ßÌ9yN>¾ÚÓTBþ vsÕ-oÎ& þ«¹Ø¯„îÚhU{èöú{ÖØ‹C»•2lÊ·®P[LtÍÐúZ¸p‹â/ŸGQ}’—#n<îþù÷yË)ÆoÜC"a•ª¨¦‹Ëåøƒm¬G¡tÞ÷X…œ±8Ó›RKì‘7V:ÜÄ„tÚ¬hß΋$ý$ѣ܇*ùhSIOg†øæŽ}¶šÈ𩸢€mŒÐ}w¿«¡1÷.ëI!š}+æqþ›úë92¢÷ßE }³gœMÑÜŸ1¢ÅÁ¬é¸H$ÔÍÇâYöÞa³{ÅçðK'! Q7ÍÄÂKÃLÆ,z­ «¥PUN›€.Å Ô_„»j‚ÑçN9ã2e5T8IäúÜ]eþãéoH#/È] ßÑ`_Sø>àg&Ïôw¦xnøÜ(á›Ðø( `®AŒÿÖ.KiŽ F (W.–­Gú¶BnxEö Úº÷‹g‰ù¦†lm¹Ã®PÛæó‡ Òä–¶œŒ*´ªêS€hÙŽ ‚*îõªáuìÃè°‰f¦úå å×T8j¹i‘#¾¦ƒT»`úgw›ÌÜfL%Û¾Wå)ÁÎÍŒöKƒe-Ѝ„åÚ$vœ;3pm[ÓÛãJë#LÒôúMC`ö.hs¡ê}}Ð}ËÈæCÍ ž „ l¶¿-RöG#‡Ê=0**Û‚çϨ@2Äúމψç*©&YW®vcçÕe LÔDÝØ{IÀ2é%Ø)(n=€ÆŽËèV-ÏœÓäää íû] ¿sˆí^LÐͪ©?;Ö¤xP³uL鏨å5¿n˜gùþðóX=øžå@EÐ4ù"ͳ¶»€b; /’¶ ¨h##[5y ág fdv02­]…û”¶èS ê1bƒ<…~ÍU-׿—ñý ±ðM‚–é%®òKôÑE¹0ª -ˆÍS«ó2^§IžŽSqþ|´=J0=ÃMÔ£ íØ@-¿XVL&‰}e:TrŠ¡7ûÜËs5Ϻf».O«W3‘’óoÖ–ò 7l&&»'ÞðD,,Nå^°›J…”6ýIH‚¢ØÕŒt¾¡’ …ý³€ìv×§ÛYC)ý#c‹ÍV­ìçÊífMûŸ%¥v€ìe¡ãn¶#~À¹Œ‰Ÿ+YÍxz=Øåàä’fØÇ×óïæf¾+¯£ ²ZIò&ï¬CÇhÇ"×Ð0)mÐ,‹øî­$„ÄŠ<¢dØ%!½-’Km4ƒ¼t˜š¶7ð¾s‹Ü£±Þ¬ öï“‘BJð“ddöfþl+ë „&Œt¤QÚ0v÷`’rPC ö¶{Œkk2øúoSÜ—29ps þ£A±dŸÇ‚ÿ™%ÅvÛ³q:ÉH†â¥}[6YÅò½ažŸ¡r…XÌã•é«pJ:MÀ—[s_ÂÛ…¶*ºM(Íîï•&~4¿6aÖG8÷áéƒcWÀ’y&µÅ§£#•”d3ðC|ù¶5“>9â°×”`5aÉðóv¼U§Æ+Aû"4ÓÆ˜ûú1îÓnع©luËHêa~[¥ÍY¿2—Tø"ø^ô"ì}’¡Íøêáb*€ÓfÛ^IU.Û:ÀªQâ,³)NF>ÜŽ 5ÿÔÐtÄ™¹$É,øÚfùyý§Ë(Tâ󃡺nåpP÷šŸxÓf±ÛBþÊR}¸Öá³)²ôèeÂŒ1ö’r£ß¶‡~OšCdþ\NðÈ 0+§¿*“­ö@·~<&¾3ùßÁ–ìËñõǯû•{!éÈ¥ör‡óWr¬„® X@q‘™L+ºmý-Îlî1/¢Pú3½•6-˜è=¡îœ·§Pg¨¾¾èÇ/Œ~·È{Yü¥ÑT=ñ•ü²%†×`¥o>]¸=pŸéÁñu9÷¿¬:ÈÎÖÀð#z´$ófž ÏlWÜI¡‡u÷ï*J^")ª¹-ìbÊäô» ûRüįF¹z<^?®ÅXM…Õóo‚[pWž?¢f/”ÇÏí$<ïnÃ,{>-‚/›´©©q2ýv‰ã-®?¹ïâþ\J)Ò"’ W Z†f K Ç–?ÁÊÇ^·ÐLj¡Ö¿½ÔA¤Þn×­LB+¼Vy‘,Ê:%¿R?ólòÁ,íú­ÖÇk÷"6½@¨µÌý¡êTZ•`8© 1Ù"TúP” D1ð„*(•Ϧ'Œ4º™ÙdžMD=¹›{4ëkœcñÿo¸"G“|öè·£1qG´x¥ÇŸU‰Z™ð0a0÷~žÙůOáÚtP¤Š/FÎî#ñNâʾá§O“óý•Tóˆ$Öoÿ’‚Öß» ƒrœÌFyCÛËÉôâÈg’Á1/ãKJµdıCÛ‡ö_X"w˜—š]OGõ¸î™ØÔ°ísŽ#U©çœßÇéNý#¦××Cn/)¨uTŠJªÈMA s«ÔÜLw« ž(­-«é6n„&5~½z+0¦8²¤æïGy‰ƒŽ8úåA›IUgêÖ⟵§#•l,¹Fùœ{–^bWúÀ»·OaWò~‰ßfö}Íâ'þÎÙ’%-\·1Ü2#1ì « W«~BGúȬ]““Ù?ÝžW˜ÖSsߣÕgzÅZü~ƒ˜ˆzd¿(}O¿-"«•¡{å}{b>\Xç *Ì|±W^ËTÍe„–ïÖƒ‚Q9+žœ²p`oº¹_â$Ô’ààç‚e‹Ê· BÆ›>ì•N.'¯cáZá?Vz‡€‡‰Ï(ÁŠZ—7”«ÛqSw–>hpÕé£`Áhêiòvbâc²îiL³ßÈŽ›Æ‰H£ÓœlÜßÑ&2póo rý7òT¿†Ý)Ø9wFˆþ‚cˆ¹Í5k†ÃòhÒ‡×æÏë¤Í©#±Cs J¦¡ËE$JUü¨a\|êÝûYÌâ¦!¹;…›¡Z~ž°WU«§lþ]Œ…ó áE«'”ŽTÔ¨ÿw<ÍdØXèË4Y–‡"ßEÄ•sÊÃZ§€ü«‡¯ ­þ,ä‡#þtÎ.áøI|v<œzªÅjØilN˜N­J ]?y†—Ò üï“<¾D‘z×R*dCpþaüd9Sˆ7‚²Wá8æ¤Rƒ‘ö­G¹ùü¯ÕÖÂ$ñŽ€(l›u\ý;`š#““Ø1N*Tå9ûwɳIødHn$Ä^Y¹%D ×÷WƒQÿdë=¬Y"Tå9WVY¹`’Í1|pÏ5ÿ[ßäì\Ë=/°qxKB#r&ƾ< KSÙ#P¿çãþٶlè/“€,YÁü%Ìæ zf˜"¦[IrÐÁA&rdÆ ÄiùÄδ;eHê<œw'@\èb͵Z[„ %cA–­î2_ëÒGÌ0)AMkZ²ÒGT³Fß’„ŸÆŽNèI_Éa.k6Ò”OkŸ~§º«#Ÿ˜¡9ªÒ8ަÏoǤÉÕp}R1I$5KX¦Tâ„y¶¯üK6—xK«¤]žµÍƒ*sŸ„™æòЮ0èLdh]ɘÕÀG~O,0Õ[Ý‹rà.2e[@ôE$î*ü"jï×>Ò þ¤¬4ìÝ|“‡¥´ýìÙ4Iv=} íÃNLw”÷uM0“¯@óOþ¢9yÙ 2wc ”µ& ¸Î£M|닜õö!<@ØTðaŒjP FzH×X]ý§Å°Âî½% ž7òb¶™bºÃpD[uñ}>üÚ‡¹‚-Gw!ÎÚÎ!Éé;oÍÛë¼LƒOЍA¥—û½x»,×÷¹/•´þ*¯°¡Tñ£y©+vŒLŠºŠ˜á#¼":½™SÖ0G¬ ò²dCmõ ºW|9€¼­ïs ̵|»]]K¡àg!gPk8ÇmdÝÿ&¹ƒÎm ÌÒ,^1„Ö1œ®¨kV…ãÝ6Ò‹ìWdŽÂ ú|ºpd°=¹â›4ºèj¬7«2ýñýYÏØk& ü(°MHXhÒü­o‹_jz¯æ²øÍÉ^Tþñ¶:\\6jwƒ×Èc%TwüÈ”j´ó"òyŠ™@Gv„…=¶UzG«„àß?bÁ…!ZOO5JÍí©åŽÕ*>ÌpÉ0´ÍµÀäõ2'däŽ ¥éž†¤õÔ[xLs)ð¿¿Âá%‹§§RC¾©ÙéO}ÿmmâvh€ÇÞ™U»O¤hë8éñ&Ÿÿ2¹ޝ/`Dž¯¤&^‰Ïµžz='~T~«Mx}è$à,ýy¶"úÛ¿xjLÌ ˆò]½`y&@í'“ZÓ@I Õ/¦ae9À TÿdÆüi›¢×ÇWvtwܘÖogöõ¨hŽñ²¬kªå@š¦ª ×6Ý{ç7Gñ­ÕA:vœsAb¿¨Ë·yïA™‹ëÕI«~2KÜÉôÊfÌ¶Ãø…)Óo M¥Pqzøã%•ÿb2 ÆläN=Êc\ˆ÷À%áü 6æXß}R\Eƒ0Tcuó¦(õ“Ë+ÓŸ‹’cs~ù·E ®Xòùš» Ïu¿Î ,:ý= I‚|`™s.º”Ã(`~° ÓÒm¢é³gdÂDGË9lñŠ$Þ@ÓçݪC‡~gr Ê·z?bçJ.¦ÎB&WG*õ?…3vÅ VÉd#áÍçC„±Ö§’qQR/×WýÓ¾"±™0ÖöôtÒÆMüî´Êæ:ÇÊzQqåXnïa©ät‰£ÉñI.?•.h~È+cº˜ÅJ u˜Q G • Ûˆ ×ΠJ»»ä…4èK-<òãéE îC]l®ñ7? ûêÅ©½£± ¬ì” ŸÈQUœ@¾½kÆC@qàØ©q؇æEªµH- "/†{™=U³#Båêd1A¢]ÏP”#Þ;û8d:„¦pàèOÔ —й¥(Dõíx~v†cÿošõ¯u‡°òI-CåŸ'@˜·MCK¶=äž íkßbf$÷ W %P-¬BZD‰ÇjvÕ¥ šÿ¬7Mmü=væ_wuZ›“FFˆìÄ9¬ÍßçBÆ'§ÈTºÑês ?XœõÀU.l’'Ù=ª7ò¥ã<­äqÃñ®ï:*ªÊB 67ÑõδÞBm3§we`e)è¼§‘YˆÁD×|•ö>'Ag~~º':Ç-ÄŸ®É1­þÊzÐwñæÕFY¹v1¹jØ_VyÒ¹°Š¿¸N˜šüÀŒwË9”åPsd“ ”ÏL :9²™§Îr™¶Lþ-Îtè$ü5| âÀòTTÜO¹PöÃZñ.tEØŽR­/º2w{¿Ÿ@­áרKýB Yr°¤¿nO˜0-T¶k ¢%¯«+%c @ººrœ /\ቜõù°§(Õ¿Zm$*aí–™ØYøâ£îbŽEìm £Äþ)]grTUü‡éØzÒ~v.¼Éå|¼œ§ç¾4n¤JTAŽ›âÎ!sÃSŸçŸt&3‡o=oŸ»º‰þ{nrBàªQ¶ŠNæ˜#ÇN„Bc½üØÒÍjLÌÂÁzïvøêÄëŒÚ•ƒ¡C^SájÊ…J&ωdwi¼Ý_­“è_Ö<ºg™YBnlÔ©úÍf_챚Ìé^iÊ­H#K€Ð#5 %w;Lb ø0¤’«5T´Š¤S`¥'TñÙ D2,nÎ÷êêöùñÿaì‘A¹ó<<‚FdZÕ²ìadÎÐå¿uÏl™÷l…õR¶e!Paƒ³{½dØm·1»;Å[ír¥êꄆA¦ï¼b­pÆ’QG¢¶LF(r^ë´ÎöðC‚ÈÑ'ç>›êkJï]¨LÝ"[)£aE?zè~×8"H=®GœX{Ù½®‘´PUÜ·ãÔm²¯4} ¨CãØÝyÍ $ì‹^w.-ëÆ ­Ñ¹üjÑÏ>.“Hs)U·?Wh‘§/‹—~£€«¡²¥b,žóÑòGèâ±NK´¥*=U­H»IÓ†—÷]™_]ÑSw"[&{ο²7šŒµØóø÷§A“ÕúÃøƒkõá+0Ai_F™EŽøÄšYéóÍPjÌGõt–¯È]Ö1Ô›>ê÷C1Š“píÙy²B9ZùÏùFrºn¾ Ýþ†¿d÷,¯í$ä>§€\º6ƒ}®ŽWS0iŒf]2®O¥æ…A2x\©\lù=µœàIˆ½)ZüÛxÄp¯‡Ýy=‘D¿0ÁÌPË»1AåìÜ3gzÞWºÏ6%ûü4.ˆ;Ï@KŒ³qŽ$;á)Òg§þGÉÊÓ]Ÿ’÷¸LÌF&Ì¿óE û ]`uÿ ›;ÕYVÔ‰~tU= Á?\ÆÞkj‘à®ÿ` ^ûW’’R Ç]NlÝ#ÂN¦Tô±gyïBI9žüt‘i&CŒÀ±P{ZVûß½%#)¿ À¢NþL†ƒ¾$)]‡ú ?‘o*)WÝoõ»a¹¤¥ƒïm5¨É3·ÅÉ[ÓK cñ‚²Ã:Lm¡Ú—À5Á*Ϻ”л­ÑÁPw|~v@ïtº‚/Ù9òeÛúÇ]5¨å.Þœ÷³ºaV¯t:€äýjXѬ&5ûð3‚ËŽw7KÎ sÔíä*£‰Ý ߸ –EgöP›So_JçÄt·4­<æ™?Ùº›÷#s%JZ7pRÜ p¤tȆ¼Vð‡%ü($´¾H¨R/Òp¸„×»²¶óSŽq/AIiâïÄúÏý1w+‡A@;Ñ´)ߨ‹ó\ôC…>ç+EhL;ö ¤…? Å.æ3jÿ·‹nÆþø§gÈ4~Mžá|n <{32œbá‘‹(+&ˆùI³ÛFP€ëR%*ë‡Ã®Éz‘+d(NóªFDQìHq÷J› ³æêgøD,Á:£8Pö} ®í–³ëÕßÁC•b\‚ÇÊæZ‡zJˆÎƒ/§3¡ ,I bÛ\d"hÓúý «¬¢™Yðr `ŸgòpÇô Vœ¢F³Ý6†â–C[УŽg´“˜Z¤SÓö„•¿L‰Œ¼ogvv"é*²…çËX9V¡ëNý0ý‹´…rzÝ q…/øow¼ò{sS¡ß+|5e©ë"0ó@ñ®+ŠM¡ÿ}p¤Û4ç. \Ù>§ÍKð*ÔÅõSH“U¶1B;ý7ù ϵÙoª!.º€A5ªh­†au+Ãz®,$1•m§›–74 dØ@©2HæÀ¯5ÿpCÛNŠè+³”Ð%ªœ)Ár¨­Ïw±°Ãh,k¢e0“¥cïâ™äC ¹Ln‡ë©‡–ÞŽ¼àª³zzÒ•Ï9 ŸíJ2%%n¾-ÃÊ€}hMô?à;óiÙo$'¯a Áä&¥ŸH»¦L wi°cÓíÄ6$$p£ØI,dö§âÜo:óóq ÜÅÐŽ?\æz‹Þ·º°w§GørU"ÖöVhÀ[#%Mø]Ò}v+8¼GoƒEЀ úmȳê•°ëªÝ`ꯑ¡«¦<«É…iŽpÚM|bKÉÝ¢ÍÆrœS²FZ/ôP9=Èö "ùVÛiLÔ†»½ˆ®]ùÞ ÷£Š/¡.M>UÖÐ  §wÓ$¯É19ç|>«s´RÈ_ü,š~º“^=©-MªÞì©—JÄŽûe]‰f9]…XÓ”‡Î@[õ;z’7r5”×\.„8Ì(’ü›ÃÐÑï–Ï$34Ebë—uމ±3Âʦj'§¥³{'¡R@s(”Ÿžˆ1l…]¤!: ý0%t¸,ˆM 5z\=%½R(\2µRNÁW4'‹²•¿®lã€àÜŽ}ìCÒ&ö•”¦”h›Y¦»ÊÆ éýb˜LÔîø)K(Í,†©Q@*í@†­hÎ=ÓÙC•Ég¤¿Ý*lI†\8ßVr‹rR/|~î*qy¾€‡|#k?¬¥\‹UAkå‚h€µçîÈøhùTµu•XeIYHô²â¦¯úºðãû`Cö›ê±ôÆà¬9ÜqGÇHƒ %¹Tû¼=Ì„ tÛpí·Kœ‚j»$]×GŽJ7â¸1nŠ¿—›‡ZJìúµy6 ¸Î]µ@Ò#èŸí¥ðktVãªp‚ƒË Xa \“B|½R+Ìb ˆÚ,9¶?Ú1_7 eØÆGƒ&Ni`ž¸ZðnØ~18¤Ã6€ôcˆ:|È+›%`Þ8/aùm©yÂÿ=Ë”‚zsÉ—¢Å^4ÌaV ls—ØcN‰Ž xäò×T¯|–7FEu1Ÿ\§IkîúeP½ÔzTN¥À¿fÿ|&r¡œT|·µ*²ÇXÓFä©vñ0èËr¿jÄ‹ë¹+XÖÅŒ«sÿ” NªGµj”gÌ¡µ=ÉÉáh¥mKø#%ÎU}Äcµ ýÖº ­C£%2­ú-Aˆ÷#¿¦ÉÐçà½7졉¾m+Þ¾í|ç¸)`n+RŸ~©Š<7T‡BÉúëÙÌÓ^â¨fÿ“—}XÞ¯zDÞûcÈMÙîÈÏ(½å[ò‹ª> endobj 110 0 obj <> stream xœ]ÖÍnÛ8ཟBËvQXïO HY²˜é iÀ±™Ô@#гÈÛW‡GÎt‘øˆ’®>R4éuw¿¿Ï·õ?ÓåøoÕÓy¼¿ÞòËýøtÙnWë/ó¹×Ûô^}ˆ§Ëcþ¸ZžNy:ÏÕ‡oÝÃ|üðv½þÈ/y¼Uõj·«Nùi®ó×áú÷á%¯Ë]ŸîOóéóíýÓ|Ëï ¾¾_sՖ㆔ãå”_¯‡cžãs^mëzWm‡a·ÊãésM]óžÇ§ã÷ôڶ¸¶®c½›sSòü1ç–¹EÌY˜Y™Ù˜ ÙçÜÖÍùŽíwÈæÒ™#rbNÈs‡¼§mܳ½G˜çnýþ@€?Ðàôøýþ@€?ÐàÎìÈôøýþ@€?Ðàôøýþ@€?Ðàú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_á·šsõ~ƒßè7ø~ƒßè7ø~ƒßè7ø~ƒßè·RŸ~ƒßè7ø~ƒßè7ø~ƒßè7ø~ƒß9þŽñwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßátF8#ÎHg„3ÂÙ¶ l‘Îù+Ú²rÉæÿ Y,h6¥;ÑÈDt8. Pi|ñ€Fv ¢±+íåK÷ÌèdD†TôÀŒg¥†u€NmÉ-^F ̸>-AÍÄNèÄ…²,²éŽuð¬´aÆ`¥Å‰ALt&8eÁM‹³<—“#artË„F{ÇN‡® tÛáÞ®Lˆvqè”ípvÆv¼øÎ™Kû2ž¥=²æn±•ö=Ûaîzf˜»õ1þûå‹OOgñôË$@;<«) bÏwW<}ynS—~y.®X§G¡ô¥)›Á°ÔÁõë ¨3,uðîÖÙÿdØ@±ÃÿÚ˜«ãÛ4Í›rùPvcìÃç1ÿûKáz¹â®ò÷pר endstream endobj 111 0 obj <> endobj 112 0 obj <> stream xœœ¼c4 ·,:¶mÛ¶mÛ¶güŒmÛ¶mÛ¶mÏÜ÷Û<ûìóëFGtUe®ÊZ++«»+¢¢I ”iMìLÅìí\hé¸ä,m\• ídh…ìmLþÙ HIU,]lLÿ EªfêälioÇõŸuÂN¦†.ÿ"†.ÿ”«X¸ºš00²p1³q1q010°ÿg¡½™“½©°½ƒ§“¥¹… Á­P¨*©SRSÓü7ÂÈÉÉI`äùŸ ˆ©³¥¹Ùÿøu3µ±w°5µsá&þ¶±±4&0·ñt°p&04115ù—†š¡©5˜¥¥ƒƒ½…0åÿTù§QFÚÞX¡H ÄMíLþéßvü—YböNæ¦ÿ6 ;3……‹‹=½Ù?”Ù¿(:g3:;Sú4IEíL„ímÿÕ3Ô¿v±t25þgxOúÿÛmk;{w;ïÿ›YÚ™üKšÀÄÕ^ÕÎÒÑÕTRä?Šÿ þ37u!`e`bàd`!0u$0õ0¶ ÿ×!U<Lÿdülhgâãí`ï@`fhãlêcifúÏÊÛÙÐÍ”ÀÅÉÕÔÇûÿ$þç##‰¥± ‘©¹¥Ô«ÿ›šýû¶¬¡‹“¥6Ý?0üëõ_kºÿœx{;Ïÿ.—3´5%ø_Cÿ-$dïAàMËÈÎL@ËÌÀNÀÈÀÉNÀÉÎIàó?¥þË„ÿ4àßPCËÿhá¿%%íÌìÿÑù÷Aþqð?†! wû÷<Pü+Ï”ÿãÿ´hïbilúOTþ+: ¬ ÿdñŸãÿ3¨ÿƒÿ¯¸þÿKè¿´„ÿ¥ôßÑü_Š¹ÚØü›ÿn'Á?~:ÈüËÑÿ]lhkiãùÿ(ÿ_•ê¦ÿ~Aþ¿e”ÿ{ è%] ÿFÐÎÜæ¿1Kg1KSKc‹Ýªv&¦N6–v¦ öΖÿúà  edeý¿I Kck;Sgg6ÎãLíLþgô¢vÆö&–væÊ.ÿ¤ÛÐÉä¿€ÑÆ®NNÿxýo§ûŸ}ÿsÛÌòŸMM=L¡,×EXÆy‘œL¾•m„áaѦ™]EÉܦ ¬´„ú!Á‹»ÝÞ©«µ1$JqœêÎcG6?él|4žU¶ñB¼¿¤ÁËXK(÷j$¾±jpÖsÊ»­`¨t>Ü}1õ’íƒÕ$µá˜q?šÚô|ç}IÊ"·%¯ñ¬Ò÷/”»Õ6!æÛ™FÞáå¸8„3;!€>šCVkçÿ¸Œ™o'Ÿ>¯Çfðhá±Ysǧ &d ÉëŸ,äqòïtã¢Ü¶|ìd£6{só‘`;H)oÃGãí‚Ö-;±Y€j[B‰½â¼§fd@€Å'3ŽQóuÏl†ÍUJΧ<…K—§ûQ[¬Ó“1+…{A%JŒ˜ÁbkºÏÂþ~ßW›V*U¡ ?še…¿Ò‡rÀp@D&jƒJŒßxBÝFæÇ•O(„;ë j†˜fÍ{C’å™#û>Bzmxnœ?ó®ú |‘:·„ÈdÌëyŒö¼‚D9Õ nÁÎìšF¯¹ÀBÈ)°º.¤§üÂ…²F†H[î^N‡¨½}ÒÒj&ïßA' ©~˜ßä‰õ›u#“Oļ7Ý —ÆZ”"ÎgQRpò¤·¬´ž§“ô#ŸjêêзU¹³œÏ—€PUˆÆû H3•ôˤù½º¤e.Öƃ{­âëËd, ©Ø]ÿ"|Á˜QN«´¿cæß{ý}T!Búî¾'¿Vç›jô´ÃâäøGÀÍŽk€ÎU«p ¨‚ç¤h úšE¤ HHÁeœÊÉ‹—W“:ÛöXµŠ_“.‘ü Úê€{À¸%SŒ4²ùäõÐ0›²*)5bb1SHøP?hßEË J•î²hÒ_Ô¼Šp >PgP ÒåÐÄå Nò^‰N*€>¶TLÜg/=–n²jßâ³èÚGµhÛ‹ü“ š‰±_B|êï~«Ž¢Ãx³'>bÔ}Ï@]ѲÕKçÙtfFÚKÔÕÔRz¯ósˆKªë#êºZÈ@¥()…-@ÖcšÉ(G½»y âÀ6¸™¬ »– åNíªÝ˜”}$îgj¤Hhg@óÍãUèpá¾Ô°Æµõæûª‰KRmÙDMÐ黑;û–R½ø-Ô´=%Ýš û ÿÇE"kgX/ˆyÇÏ)›&#[Ï/ÍôY{ÆÆ¾u WHÐhª"qAáÊ'©z5wk&Éf/û-òä"-鎨Ãô®ÇBz„¼¾GÖ @»+ë É0æÃ/R—.ÑX‘íÔŠ§÷¬¦ÄÜ`á>:fi/~j ]}d¼{Jç åþô4•Bšwn–-¾¼îxÁ/ö4(V·—áYù\Ëî·…îµt‘4Ôž/^˜âTå  ªŒÄˆ4ïŒÓ0qï=ï(¼,C˜ ·Í1„êïÀ =é×[io†mKJÞ˜luD#1á’:è®§ãæ…:õ˜(Ž=·"@nºò†ñÎÉû´+Éïõ ³t\ûå¨u:–Q°xˆ'‹•¡5õÁjx!Åg“¡þu˜™Dœv a†—Ô[&+x¤ ì” ôîÜv¸'¹Ü†kéêc9?›kÿH*2aÒ_½3>+íŸèÂØDvÓ¿ÖhП»TJ³«W!•Ó–ZÊÝãï¯dSâ^ÐŽZŸkæ=mþŠËÞsËy{—ʧàÅñ‡6ñš¢S\Ä ˆe:z ëëiÓø<•â š_ŒÙ„¬P,­8}©uËE”¢âÓÙú"w5á:žZ4¼#ß‹¶Jt&Üõ.`sÈ©e¥ØQnE|tÏk§³ Ä†^âv·½#õòˆÇŸI_“×™<¯N]ûŸ Ð%OÜ^¯@]Tx½2¿ó¦Ÿ.áb3xIø;Íö­0`¹…ntlŠväÞàla’•üH×0Óáªÿl©æmi½ÖËï¿óØXµ‚±•õªd,ÛŸ"f°ÞÕº—úîÐzz—’`ŽT"@«iÖQ¿PäÐ"3­Ù–²Z»• úü`Ä3”_7fí|ÞÉÅI+há ¬N5“d0¢“ƒ µoËmPX4ïãµg˜m<×#6%©Sñn(‘‰‰ª¨bSM9Œc‡ZÉâ·‘j÷ùƒ®6>Ø‹W](‰çYxì%©œ¤ôÑ[_Øùçt3ë*Ct!±yžÈ6ã¹sº ã]”`QhÖvhjÉ 3¿ˆÑíoú-¤½`u“ªÚ ‘A˜"ÍêAþÙQvíÓy?IΟA\2Q±×OÖ`Þ%ûâž``±\2IÚi¥tìnáÉçœéÝN`H7=óág$å­®N7N«¿> ^í*ævz}“š¶D%ÏL©¾ÑâûŽè-öáYÛ±XÚû‘H׿ŠOÇb,Â0*9ÅÏtÉq+К‡õº š w8¯4^I¼z ýäÖ]ù… 65l/v¯z=]«Míí³IRéeÑ~+èÌŒ>Äex¿ÌíhøÙbÂqC9•Ùôý³º]gçBa×aÕ/w°Y=¶ÖN¦¿6‡câa Š w …`i{ó·¬44/êÒÂudvÅ­IR?ùEé,uVdu¡mŠ tž{¡¼¬!•lÊÝÔi°|üÙɋǿs²º%Ó±|IÐ[“„3c~”#™)¯¾ê®×yËqý)9ÕEÓÄŽ”ÍýÓ;åãü„<2,Z²#…˵‚Ÿ ¾²W=äˬmm8üø]Xù{ù´+ømʶ.&ê«ÉÁ¢¹45ò¾ãÚ c:4ð„ˆr’ßȧP Ída`§@ú4!ÙUu±®›r;°ÉD>7"JE9¯"YÈÍ›Xc¼Ö'U‘€ç—ŠI…š‰ ñïHß]çðûd•³ç«õNÅØ[ $p¼|,]IgB“…Øt¨¬Ùç*œ\Å x¬&0‹W²„aü¹°±Ý>O‘úQêæ\Á6¨û¯–=ÕÔ2ù „Mƒq‹b„EÔ–úcèÛKKÊnDÇ)N"âbÉz¬ãÍÝßáêèÂßœóúÔ”×N@5@ÚY3Š„Õ?T¿S‘?•™¤Þ±’K´£{ÉË—WSò?(Á9so„@¡°Ç²oûªsž¹8Ϧ}1â·Oëfu Pü‘<ɉEZ=(D½„"ÕÔ¾-9OlJ=ÂÐÿ’€ßüÁ%G×Þ]/L”ÅeÅ1K”aÝìŒæ5øL[̆@{<ÍNñ´yÔÎéa6Ðc^Ï6.MÙ@ËDoqWèH¬¯ŸÈ“ò´ÓújA¿då‚Ã]Ùã~Û^Ó8¦Ú§øµ&Úó3èµõ÷¸PÃðD)앹}uô†‡#Œy…v²™)Ë+ɾÝlœú ɱ:¿xó>c1¶)%jȨJRÃV9ùAönô5v † ØâØ!Õ„&2á–`M ZtÂãå%Åî  ·?Ѐk¬¬e~¼aÒCŸ/ƒê ¿,ƸŒ—ag ÇE6“‹=xäs…Ç\õýô¦°Eظéçû(™ˆ¬Ü¿¡ ªþi¬Oú‹è𮹶šÞ˜0%œ±Œ“§9Q:eOÃŽ9¹Æ#êüþ@¿¼ZYô-”Í=ÛqwÉ%ˆ>ßÔòcîzΚyN”¦Ãñ”qnô9÷g’LwÇûd#ìË}:²WBºïyBÔw]ÐìäBB”wþÑ› „'5îòÔPŽžÙe@]§º-ÈKXçWSÁ+^ôúöÎÚó7Ú§jÃ*U;þ]ä³ãßV›æÅÕsgEI6vHYÜ8ð®]’_ 'Gª6bYŽP5ƒÑæ4Ä­M± ksÞQTŒŒf¶Ø+X›»9gJx ¨@ñB Õ‚.c!’5g¬®Š6ÛÄ‹àZ] -wí°¿° hn|'_ ˜±”ž’»ÂSÛ\-eìü÷Îß¾DMê“LJâb¼K¶½£ÞwÙêdµt/%HᤲÄöiÏ]wõ§ßŸ{6h¤~£Ðc} ’8#Q‰(Œ¯órLÎJuqÖ+÷ ÞdbéP*ïO Å>,saF—éªj;kÂKß“e0Dú¢ÁŽ`ôÝßD~߯ÆBûc nêZž”€uŪF¿,p é%¾"ÉÇ>l' ;àu’bë]^l¢Áã]©[´9âŒd5ôärõÄ÷EEº³­•£¥}[Ûby£ä_Ñü`²c–Í׺"ªÝ/„ùÆ¢{‰¾ÜuŸÂF±½ðÓ¥ÐA‘:öýOfoŸXwƒÐƒpUEèÐÄcQXÖ]5¿$ÐÓŽ9ÂbcÉçb”½pw“¦C1›%X'ËaØÞiô³ŽÝ„ž¨€é>YlÉГI…H7w@ÛÈEãBò`¯‰+%)ÍsîçtÕñÖÍ/½xöÁ۴󃌌N=¼>O·—6û.Þ’ ¥(2,´d !¤é!|ê+¢T!1ÄðÂù½èÚÿ„rZÞæIkÛþI)Ã¥W,µ³ý hþ ´>ð#¡ ùc†®G¡œJˆÚcƒÀˆVtyXgX{,% ‰ãqêåêÙXƒ^ÇKˆ”©qhc´¤ …HXJHVŒ±ç7ûͬv}Ÿ¼G¢­b‡j#¶ –08d£?Ý„È=W sÙôÄ êœC‹š¹rfá,$þõ€Øý{'¯x!?‹Öð…Üã¨7#Áf€ë<ð4"ñ aèuƒÖfJ†QÜ&@>ÝÐ+x’¹Rä¼#k+·èp[D™OK¹!27Ž}ÖçAΉ¨ ,PЊ=ñÏ…C†C­ØéxMr€ˆ²m^fx\^Íݲ~êz 3_nÅȸ¯åŒ™:˜“> ÆÚÜèy¡|Ãåþ«4ýHü¥ ô„:U d߸¬)ÖEñ)Žû…‘Åж_C¶>°Q=l%@ô„†šiÌðÌ¡Çå`ÔV#~ü¾çïLÐ'Z†H#[ÙîÒÔ ÅS·Å˜3Ä"Äåû­ËY·jeQ+¥Í2’ékAá¥oý¤e†Fí½6?]ÝD¡UÂ& ¸¯÷»oï±¹ZÎ<8zÚÄÄã oƒž"ÐÖ?Èyò~¤˜òž‹…Ùw5#bgTT½°Ý8®’àÒŸ!<»Ì¦Îbª" $3³¤»–n~ZL¨þ Þ`âèÅABcMn|ª_µÙ y(í«Q÷cõêNÚ÷NPWVB"wê*#’‚há%áÈ<¤‡„û©…Ìó… ºé—?Ý^\Ö3ÌÁc‹íc»ïo¢‚ ¯RÍIÀoŒN˜äš|EGªL´1oéT‡V3Ì©¥<=žY>C[à0Ì»æî@?HeÆ»ªbâ|1ÄŠn·Y˜†‚²ê[6‹ûݹ:¾¹ðÝb¥.ÎqY–Ÿ‡Êã9‰CÓõ·XÕ49Ý}è5Š` ^û,?`¢())ýH•·íâ©H2†Ã“âpè£/GßTà#+J·òé„ÖVTK.–[ÿ="n¸UP}Ì!)±+‡ þöÚŠ™¦Ÿ°?Ǥg ¡I+üVuÜ}<ò è(mݼm*b’! EG|+”ð\ž‚Žä®7z[ÞEãø—u‰ÙH„øèØ! Ø3þž›‡‘à‡Q›[z*«C6É£¹««{q;¼¿5Ö¼s¿¡SºYfåsüƒC_ ÁÁ±Ù_K,H<<‹Ü"¯+Ïv‘›cA m$»)ËÜA˜›(s{>fo€¥k¯]EËc”}[E¯3¶¤ÒìÇz´ÔI ‹ÛV/”Ç@ÚtöMQpsSqÌž”ú‰b%û8DoW1CÎ-‰¨P¯×pÐÏ/®¢zÈvëüjr@Z ÔÞžòzfwµ`p R…¨j]ž‚Ëû=¬Õt÷íf[íl0µåéƒ[Táêoâ]—ïÀ%ŸïX°. Ôsâ0°àûõãð4_ôî„¡³r9G–MiÓUˆï+ 2]4kຈˆ¹ì4ΆA( OÿF6€$k]­˜¯4‚©ŸaÔjÁóÇaÍ´ë”H?SHdµÐæ„i_Gk(5ÈàJŒOÎúGiø²&­÷|ø5‚ØqiVŠÔf¿ì9 µé'ì6Âau?¯žäÅïÌ^¶ôþÏÕÞ< ƒôë“HÅ´ ø~uÁ †õù6¯èQÜ• ¡±à0ˆd©Õ9‡ Ûþõኢ¾å2ºúûé™g·µ¦Pܧ[¤¤LÈ­Ö°Í&n(9½$æ1·M‚¢÷ÅZE‰dë’ªé#9Äï—:c]Þäj˜¢„ñmY®[mMy qê¶¥£|l`üà,©yS£¬ŽîÀ=V¸‚÷¶iײ3#ÙåÊCÞ8¥2ò"ÜÄMk„ì ¸Èž¶ÔßÌÊ_G!3ÁÑô',­¿-Sà l÷>®šHÄÂö=|“£u–/Ù1;FÔ{!â~uð»£ÙÚ¹W„îZ}¬'ú˜e<>ÿ–37’ZÄ­FŠä¥ Ôn ^ÍNRì÷L:~ÆÜÂÄn3Þuðõ‚ž¬î»w]ap ÿÍ'·OÜT“æC§pna úÅxõi ³=3pì+K”ö#5O:3ä—Qê¹âDÙ_ÝáNš±0ÕDåøjû}Ýû0GõÎN.£‚l 3Pi_î4I~:ÙYc¼Ót6ôÎ2ÞÜ#Åøz§ Í Õcßk‹æËPíÊM@"#gà,€asU‘h¥yµ¿d\Öä$nàÆ?²u¨é»¼+uŸØhQ]IŸT?}ÊÂM`²Ïï±cÎ)·Ú¬áÍNmÇçUÈî1(÷¢Y{ãÅß‹<ÞZbëp >²|šB•f²øìK|þ"Dáœ@ÓÍà¯,ÎÌ`Ã4Yýð¦B-šË§j  2%XÄ™ðm@[ð Ð%üVÀÿlE‡ã†ã·r®gHœÚ¢€½ê¤mëq÷H´v;³úÍ,€aÀ2:žê–^£Ýul uçúfá%!ú¸7ByÙßãðÆÆŠ&LÈÙ¯-Óþ„päæùÔ³ò÷ÎÑÆÚ«\µïì¼"Ô èÎ/?LŽÖ²CÍlQVÀlØân‚ÖÀáÙÀÑoX3k‡õc©³õijì!m—gÀ”­÷çã óÔ¤«Bab¬BáðUÌY~5ûÏßÄzYéȲÇù[ê;J{,6;â±LO'“B `4Ýå¦*ÅKœfìB&%LDÙ¡b㟔P“< fS°m˜¯Çig„±(²P€Å´©û~›¬§W}-F0PÛbEÉzû ÓY”z]¬Å¾HpWsßÖ0.r¾xÊÀm ò÷Ý2˜¡§S(t¢ÿªæš„Ø]“‘ç9U¼Z¾Kì4#®¼ež•áñ¡È£¹ ÁDÕÑ!Í~QÝw#;K"sÌsÔ©zzH°fê«fßÞ½õ &£mJgSׇ@Sªº3šH.K1Ü~íîpîÇf-š*;©ï“T§ü‘'EDH¬‰Õ*Œ5Í |H¢x>Ôxf€ëBŒÉxõpâ÷¢©ôÇüÃϨcße[Î5?)xZ³…²„BÁóÈD\¯Ð<˜Yàúa}zŒœŒé €î2vupzp”K—,%&J 8ä(Qœ Š8ê6]ÎŒ™ˆ¡"vUº¾˜¥‘Ó(¬U$¨e:?üÜ£8­fø.ÃÅíýÆ,èɘGÚÌ*·Â¤à KÓVwH­ÈrñõÃ(Ú‚ €øtwÓU¦:œµ–JH ”fÆròäV,bC¬­\Íhßg J‡°.Øô¶¨©žñËÙ8¢•2,Q³2LJɦeÚä2a?„×…y«To٠†ëªûë'ÉÝ,@¦ Ðİìqç8Ä`ÚˆŽìYò€=ÈE­{똚,¹h«wù8S:’ã>ß9ÁÕöö)Á–¡[ðò ¢Þ~àêv£ `©%áöµ“Ò,ÓæÄPb[¸*®ê’ÎÖØÎÎöVç/XÐýb³Akä):¾À–äqL`¨XÌÆeüòƒuêCëC)’µ 0hX…•Á5SF­Áý£¾’#QGÍý k‡»€‚„·_Ræ¨Èó±Hù÷j¬©5þ ªYšÝTOÆ=ùe§¯l‹”óœî.ËÜ’ ¤Ÿç^ë ) ŽË“íg½©º¾±e0¡vM%ðü»"¢o,I n.]¤[Á#‰åÓH廇H>˜;5äYÂý½(/×${âþmò0ºÓ‘i8lYŸ±!—*dº5Ñ€­C+)q>€î#|ýsÜ>/R“¬E­;I§ã< fãÂMD7iy_з0¡M³^k VtïývÕº°1>Á† ¥‰»Ý”g—RÖ¾ãJI‚ÛJ¶Ðq’¹lPŸ¾þÄ^°}g^rR=›m0åî¾ö-Ž~Àg ÐVæ¬btùW=¢­’”AÊ„¡n<ŠÊÜÜEuѺ¨žLàéš½ }£Ç–#L”œæ¯Z¯‰'¡ø­DeÁMTå{+©Ô1WZ!Œþ·³2˜ÿ+~…?¿Á!³¾ÉðûòᲞè5çØýø'Ïÿ‡ UÈ"ªºWfFe]ZKM¤$8®ŸäÑc$vÈä€GhŠ6ЉK{¸Ã½<½A=-€»ž¾~¬Ï¯; )î,¹²IHS`Ò;ýºÆF]ÇxaÉÒ5RÀ LÊÁï(T‰O®åŒãËF.6/r·§TŽ–aP¨^ jM]Ó_ÈZé<L-Ú‡ùz@û2'á6ðÊŽ©Oî©þ…jm·ÒùÜ»äRì 7ÓCr¿+%2å‘T9mKYþI.,¸'%Ú/wµËãíI3Ä»øh}!¥]v#è·lÞ'ö<^oˆÖÂ,2‚ñæ;}‰w˜¾0HF)ø#h‚?˜_¡§ö\Šdعš”ÇíYS€&’”$æë鯳ÞÈ•xݾèÜFÏ®¦„Հ齆{zYÉ?h!}¯¡ Ú-ùÍU¿©[ýhò»Ÿ ¥`´—€6ڌǵ-ýB85ȵóù^`<Ž‘ªÖI ]ÎÍ\ÈN|ƒe•Ûô¸{ìèßÁÕÜGÊ#(›TUjây‰hxýánLY~v~ÛPöóöÚ£Á˜Êë¦óÓ ˆ}E=V§ü¯9ÿhìf×{3"<8’)ÃÃlõ"H#Ù9 Býiøøw_÷Y…T^’@u-k¿ãòP^òÿ#¸é,>o%¤pƒy‚N¦IßÓoÄ…i…Gùf¬ÙZBÇ9Zò¦µÍ60w|»zv¬”Iˆ ×MUåÒïêsQ.ámÒÎì[¶m©ÚrmMˆ †9é¿¡RØ•‡¬×É„èÔ 弯lp&yå1tˆ¯1¸¦u© «(ütÏih€îïßÏyhˆbèÖÏøÓ2J‚ûüýÄŹ+/)È b”EŸuç#/ïЭ·îô-îí'-šÆVL’¢É]à}u`ù¦ÚÓט0zŒÃ!Fµü;_Ë=`fëËÈ4CuÙ¢+½’J^ÐÉÇJ&‰yVr óÕdÊ Y~â(d!5éF(ÃPwn—YÃAož‚êOïÜ‹1BÝ@[ð—¶11f3NròT&°\à!Xï¨ØöVEf]ºãœ¾æ²i‚MŸ–„þ-릋ÏYr³Í8LßÊÎ;èwáÖô®ÿévÒ–>ÿñ6Á1äF{,œYùÁNÍÎ ëXºX°§¯&É¿×ïTúFñ[îEø™SJeD¿éÀ ¿I:$¶}Œô`›S¡°‘$oäŒæüÎo¥àW ô´P‰¼•¡Û>zUúG¤R²ÌcFŒ‹:D3œU’QÁøÆYÀeô$A¼æàV²HJQ65 I•§/Š:Ô±uŒé\ •r”#ûnB–™ýèǼw{¬ÚÒë—è#,}Æ£uhßöÖø£ÁÒœìŽgt@âZ=óø¯Îö„ÑB_Ú/ñÛæ€µI‡[L[ø\_é2Õ²ªñ\¢­S‚¶}™LvÒU» Åp0=Z­yPYZBë B#l{Èw3ÓÄãûªîàèmô>6øzÝà`Ã/^$ñ´sFöàç`PJ¦f ãþ Y}>vF/#wó²¼³Ka„ ö«ô×< €yý”|dëq|÷I#ÒÈ£o¼üŽ¢n«DG íV‡UóeKJS\_1>c$Õ]·R€ôÞlvṳ̈`îFNª†ûà‚o+÷j†Àä, “oÄ?¨§iG¹Ù×ál_’5Ý¢[·T~¬|&Õ•mYgB—Ôù»™Ù2#P&ÓAÜâ£~;ía‹Îàaý(1”ì)ߌ§µ¨˜[H–«P0Ûm9B­úË´f|¨;MY&}®Ï§û?+rájÒðª^L4hXVŸk»¨,:¾)±®[ó»…|Ëß'õxX2 Æ,‘ðˆ—²Ÿ9pmH1Q7± $³Óër£Ó*Â:±ã4µÅNïvøìH†á¶?¿U0šÒeu7›€zÍåøŽÁ1GP˜U ÓW³»«É ÇäÕ¥?K.¢eŽì‰¯«Œ“JÃŒUâÒ@sñ©0KF™r½t7>O?¨üðÚ’â_糓·Mt³ý@Wg¯š5XðeD"JžÊQƒÆúŒoÎ<Æ+´u&ùáp$†\ÃR!ë´ ²„Á‚êlçP-[½õ%fÒ°ÝÄulä½ïÈXc°5|Cgí}‚A$æb×Å­ ïFc²MYM¦@á$6?8\ሲ„¢¯ KÅùŸøtKìŠh—=ˆ8&þäÉ$ÖüR”V·džYÙd+õöòqß”OxFÔÀ¶ ÛÇä[ïç—6=ö•…¢ôPpch¶Õî‹È=~Ð’ˆìø 6ç·ÙLR? »ƒOGH@ÌXý€„5Ig(¡.›íFdíä>ˆ[C-—Í`®{öWˆ¥èª£ä‰Âå ›$ÐÑ•@%¶Ä‘]FÞâ´¹¸= ãÞ‹ù‚ãÓ<ÁÒ8—3<òLñ]©¤(ýå¯$´Ó—§úið_¬óûÓÖ¢0·& †ÔG0ÍW&ýv€]º…à ÍýFMð#f‰ ê“`¦“ rO †J2¸qä‹äåý|®?š}wÑe9…+·¶`[xÄI•Æ¢ŸÆ±ÿàeç/‹ÓÛjá-‘ñâ "2 ¥~™f9z"6¤§ääíg†X7AãÂwr8H{÷p;çD+ˆïÁ.–-´å"có¿”áîkr.‡–lƃýfmÄ@öé[;³ƒÀÞ@H¢¢ÄQq«K:Àö¿ì1PàŇ”fºdοÁ™Ó/q;¾4šÔ™OËñâKÅ(|‰K|€‰-QL%ÖœÑСâr+H·ý ¥::ÅpH߯Š*f h¦"iw 9e./0OFj¸X@2rý Ää%§ªÑÎÌ¢ý0F9+ºzü\qGGÓFbV0!7æX2R45¡ñ¾•'ü+å<]¿rÏÖ>ÛÓ$LM ËEÖj=Óx]ͱÌã•_tag1Nn>S— ˜õø\ÇÂ:°„ó˜ÔÊŽ&8±bæýÛ„ýu§›6öt†í¯F|ÙG PÚ˜}ƒ32nótÖñ/°*Ć˂ÉL£Ž.Iêg`x=\!ééÙÐô®Ï·ØÄ·ÒeA§634ê$Åà`©6W'_únÍg„EýÍ£_äŸ;¦—6j›dS »‚ ‹”¬g ¸`ãWCi¼ºjE±Žo õÔ˜çŠ)!j*?k*ÊùÀ³øÍ2>u1Ü¡‹¹¹õÒEtYxò¼GÃW!ɧɗè['%Õ2À¢¿jG>¯,~Jß^üÁè8¦=ÕZÅxiÃ/¿è=þ6~n$vûƒM«Pán$Öi}&:¶»u=Ñ}1ƽ‰{¬…]Ñ=93È…p˯·,Ù“f»ýVµ…=‘ö\Å­ŠhD þ|ò :Cë¥õ«/K,Ùóh-¥‘v`×–q¾‰9ÿÄ7ºW1u|À³s:y>äaS×ð’éñšÞ_öãyŸ¡3ã9oX—H“z’ö´~Biר<+蚢Ù>C0|áJàÆ9 Ÿ¡}T*¢n-¸·‚ Peó¹Ížß|@î_ïLBVºXó]'#S™TÉ~ -1ðzî5‚·™q5(^殨ܺ  ê«¶ýÍsQ˜þB’Cz æk| ú㥑ÙŪÁÏlc¡¡ÕüœÇÒ4©ë¬}]XŠrÉ—hÏ#ŽÙ—÷‹E#Ljp°‹´.¾ëýŠBR…´Þl>Ë™c4D9@;+ Ó>n JÆŽ¬ÚË”¿ßbØ™ÐÝâ&S5Gzþ,³•ƒ¹n¶T'!.àûú¾ÈŽÊ)×sï±ÒK‰pÛº ÞNgà0¯‰žÅ͛ˬ~6Õ¾j\(å‰L²"¡{ƒq×ÂFvÇ1”ir—€$‹n-¯]Ià“‰ó7 ­ –4ÊJf” Ÿte[ˆU ëYÉ Hu]Ý#­–ãÜ»sàxÕæÖû'.éšÑ:Ø×÷QÑ ttW-Øõã&zÙHT&ˆeV—q‹Åþáàˆä©C!9Ñ¢¡Žµ9Û«° ,•a“ Vƒ=ó.é¡ôg~š®m ‘±½•©K7Ýà„t¾fhr]Ð/EäôŽèÉÈhu^Äð«Õ±ìE˜eü¦V“ÄÐpE…,ãršÝ}²œí9˜VhÖÀæó”ß™m9Ì`Ài K-vÙŽ’ñb-J‹$Õ,!Fq&ôJö©k2¤ý:ܾÇÈÚßœØLh¼ãFôã¯Q¤8Õ(òüÔTÓâÞ„îbãùásé*n£ÞÕ:ðíŠQöm"f¸w×™f#3q>,!Cš IW©²MòÒ}ÜÌõþÆ_……š(„œëœ«@‹:o§mÁš*óYÝb<q{$NyßËHL4áNÄ&•ÏI£!Âékãë½yª¸#«`äJŠíh•l1cé1þ°D¬]ÍAöbÿÈ%ø°Â¨`e°»C§¬šµ¶‹TůjL_i·ŒÖ € Ií»Øñ´‘²…:v¯3 ,3Ä:n×S;Cwç Ó“Së`ÜFË(•˜Mž¼YoùNòà\Ý^—™¶ù ¶e«QÏYë…σ~¸ôøÚº ¶Õ)œ¬ØéÒ¢2]#°Øø_þf06ý;eÁ[uo^Ff8X¿k׎ö#4­Uk7ŠEÓktš…ßðäòBAAÊ,AÉMr#¶±¾Ì£Ç¾Œt©ÄǕߎÁU[¢3_Á‘iù‹¼8_ŠD̯Òöj‘²ßnÉ•V‚¿Ðy¿ À„b¥ëê8ZŸô¾ŠÇ‚…«mµžÔj|0÷ý¢Å?ÖÌ|ó×hÓk± ó*¼V' dköByñȇ@>uÔuþ 6 }ZÚt…•ÈÆ˜/”4«ƒM¡.fÌŠ™è-¬tyÚÜKû,º)Ÿ%o]žu¥O;Èa´ íwxƒ`»Ëç‚§Rº¦ü$,Ç»YNÈ^˜ “î¥í¿¿þuð;aßA·}ƒâòÈTµê£» 7¢G!†¹jÈÅ+¶·`K¥.8%]ŒT‚á ¿.÷ÇêjVüb¡ÉÜèüõ˜iü„ǶOõ£¦` Óæ‰eëšø4—‹jxs;«!°®à¥cÞôñ§ò„ØJ(8JTáq§Jr`c®âŒ¡v¾C?ÓÈ( Hﲆ¾$ ápiÇàXhºE£/ˆz L¯tÞ¥”eåG Ýu3Aƒ>Va.ï*¥‘‘CcǬmÝuNmN“<Qå¥j¯C;ºKˆê@Q{¥­ÔQz%—Rè™F?/Ç=.N¢;çÞÊÊn9Ãø_hs€+¹ì-ÛdV¹ƒ/r~êò5{Õ¾CU@Üc&†œ ‰¥Ã_SÃÄççÔä/4ŽHŠs“#ŽÆô4›Qx'ªO)*ôÆmV*F™´r ÛúýaÀldÐÕ™Bý‡zˆ¶A ¯ð}ÔN*œSÖuâ£=µ|y‡µÄ¶ey2%ÈòlÀ22¢]ŽÍª‚ë7Ò'óÏÜD “‹XEÿô–æË²sþ™_0VâFN ß=Ñ%­Nx’Cce,V¯QTæ±ÌÊ6€i_Ô©»§¿r—ÉäFm'‰¨¯FÜEM$Ü×–ˆ‡Ÿd†ñ‰ÝnIh7ü޹,d•ĬæòÃ<UС.æpü“ƒ#a›ªÁ %Ì}zqŽ‚¬Ç0Îh‘¦¾`v2Úýće*¨„"?cܬê´Êìw‚J•sõ:ŒâNõzDžβPòðÞ¨~¼>n€®_–%UŸ¹¼ŸÐ€¡ZVI÷N—ô[>ùH—̓ÛÊ(Aø©žv|Çàø}úX»ùê-U ý¨%ë}i‰¦çÐ9µ}€ïßµWù ’E«°u ¼¾¸^)›X?zÖè£<$ÏyØ>äzŸ)›5DÇ8мùxK§®ŠÏ¬H¿,°¿-–k%Ž÷u†™i/z§Tk÷Qáë=,ïB­o޴ɱÍÀ@£ôicÙ°%½”8'‡t× bMgHrã¶eÀõ6c•K‡L@#›CSäÈÏSBÊ. p½*ÆØŠ†-sá,È8›ƒ#–ívãÎ7Na°á)2á@ªä´ÕŠ;êð-}¨¤ÉdŇñ§èÉ»¿6ouŸ¦FTú)ù U²&ÎÙ¾UÆA¿²ôF…xm›#vá…. ĨRÑ®è|ž^ûI“FN<bŽÅEã×b˜$ueP½¾±øý*Pý¢´à“Ÿ`§–·…XH`“Û–ÙIVz|ÐyòjÅìÒ5D>Ȩ¸ù"ŸßR„Sç¼éj/bÿ £¿­KÖ4s?<–íÞè¤d ³}1†0åÂ,%îÙ„ ï: çŸo†6¨{V˜5§…˜nŸ­ Â6šlB6ÂÙ=žß ƒH5˜(·"䟵G‘/ðyäXÉ¡·eFJÓ@ye(ÛOYE¸þK–dÄæ›¨¥òR 1¦‹ ¿Ç¶už«P\v›ô;Œ–»¥dˆ58Mµ eù÷º®åÒ°´†»„ì=}²»ÆG[™p·ºÚÊ“ÜMøƒC}½qÓ¶^„“ÐR}%[c܇ «ôÓµ¸_ä¿Ø»S:g¯§Tt*GN$ éNgâA— ”5§)DR¶˜êš+¿wžq1»jE7QÅ$Sk›Ð}¬¶›hH% û·„úÔ>ͰŒHêZh²§ U{"¼ßAMÍV—éeÐýC—)I#ÉŒs¿Ð¦,Tº~i.Îe§V»ßv ¡KRí‘gÖ©Øðgè¼-+ƒÿh’µÃø[æž N¨ÜÅ ?³s– C\PŒ •9%#dÄ?‰oÂYàÍ]H•eØ;qiÉþÝé×”çLu$"ºWø])R-`Ö.ΜÊIÞ>”²p%ÙÃôÔ÷oâXwy}MØ$ï­–ƒ nžÏ2ä É:>Sà ¹V]>ô™TûéŸ&–‹K\ 4‰®ØšùÔ‘¾‘ZUÿ;ew¬ Š7S§¼Ó<÷û˜‰KS ¹çÚÞ_td¯é.Ú ØÜ7×Ï?ŽÖ§YÅœ?èpÄ›%í¤ÀQ1’L'è<æQÜ`ø34+\Á'¨­ƒG ÁíbYð@Ò7¬;áÎTËžo‡³âmŒð€{ã.‘ÞàS¦w©L“f¬ý~üîkp˜pC1W4€°+¡õ2Çð£Û„Úx¬’×sF5êÞ³3åÜ€×7yš!™O¥Ö‘˜)úôW)¬ª˜X î»kUìêJ:¾ß¦¼k¿i¬È^ñ›§”B6»gÉÝ· ¨™˜¦V|¼€T¬£5y‰Hþ~rÖ‰ÔflÉ‘sÎpETúDþ±T…Ñ púÞîÞfð "¯øj +%9PìIkŸ#0檂‹¼™Æ>½ ‹66Ò:§€ìfU¶~˜@ôIËž —â™è̯¶Ù™ð{€-T!¹ 1S–B,Yþ³f5÷¨JI,âmóéP¾g†š/‘ßK‘ϰ¢ÆfA·|Î+Â…ÀU½Û˜Y_– ° ¦è:ÍŸkܲWߊ¨JÆ?;õ´ (- ùû[/ë+—²îŒ üX×Épã°Ùd#µºŒÅêΆO«Æ Ï”¦v>ìÄ)oŽýÚæìYã¬gOBr~—†¹e¬ò;vTiK eÜzŽðÒGp¬&y“7ŽY:­àUÅŒ(_ÏR$ŠÉôÊ1¾7ëæ¶£Âçùß y cÒX _0êŸ¦Žœ…ñçbà²çd qn+š“™EU(ÿÖ8u’DÒÍ<ÜìX§ÕOS[£ /1x˜z–A©­f7I![¸C…šF3^“ׂ¥'aW<n§¾.ÙŠ}ÕÞœYëxY²)³U ù_&žÓ\ªp:Ãå!˜ûÐÐsÐÀæ`+LXݲFýëÁOÿyÒ³ºþñ®Çî€Á½#ýø» h´â%WÚW½Õ¸§é·,^t––rK[Û«ˆ¿ó;D=5ŒÛè'$P°:•¤ ò’-ܤè@©î| –VªÕŒöô^sÈ<}Ê8CSj2ŸHv?4¢pb,•âÈFù¡oàJáãzè V®ýy‹ü>Ž4ý“Í«§ª…l@Y>ëðþåç1©@þ>ótg”Ä`Óüêh/½ Ð£íI=£²B»%k½„ܹ³Zp¦ÇäL;%‡jâÁXGƒï©”E"Ÿ“·[gÈ6?ƒõPE¤¬Ø#à^|:ÉÝl±¢ÿ@Vo~vt¢©|A] Ú`GÜ ãƒü!]néUäQŒô*ÄL4Xd|@¡¨}É.be¶Çšâ…WØîæ‡z„ƒ/BÞæ,SÒ•túHòs03Q`(® ®”¾ …‡~B^'•&ÃTûÙxf%œÛ[AEtKª}§‚ØÉ¦¶‰˜^€¶Dr·•Šª4oï$–ôŽÓ¯N£§w“ÔÖ4gfƒª<¥ÀëéÇc#à-Äuïs룼ÌnC¹šàbé_ J)š›_XÅPÿ~öîÁª(ØÌLóØæ)¦í£(2B¦1Y98Ôž”Ä­o}Šß7嬋–Ê5ã¿ë¿Œ±Ju­Z¨!†NXw°doFúäËÓW&ÇCÃCj.A¤Ì¯E<úöÃs—"±ll1ÌÝrTõ¡ÓñÁ³—N6Ãð“’Tç0Á PÕ-nCŽŠó³ª_ŸG^ŠÏ¦ÛE1Ù/à.JVÒOpÙ²ÈdѺ„ &…Ô(¡ºÖZµI"Ó?÷“;±ô,¸Åv,nƒ Ò¾Ñ4,¯æ ÖäÂfWnýÞ¡/2Z•7 5Ç»+å&/®É– ä›NNŸ¨n­”b"\ «]-]¼€ð9ç¦tL¨×Ü3ÅÐL÷˜Tn©•.”@~eTó¬$s!,,Z?Žša Ç>ØÓüŽÙ_À$ë¢Ì`Œí 2€êi˜Vâ~¬÷¿2Ó`ÚnBù!u€ï„TäÇËçÖZËӼέŠaȆsí‰ÏJ†x†øÓM€zµ¯õe Ú$ß8tIJÅq³~•Þ¢Å'h¿a‚‰àИìõöð"}‚áS+ ;&¨ h¢,ÖÒÒ¿»¶QÉ8g{è.1ÓMÉL)Öâãvcm¾ªNPèl(n"¿Òl8‡Þîú:àóùàÇêF´_þ³ÕÚšü׋Ùã ºÿ,2²*ÿw8ecÒYÙi™ â-úÌ×0O´Ãñy×EY±\*åvy< kѰùnïŽvg/X3ktÑþµ[ʇÿÉ |IÀnNŸ Ù[*6®.±7Ž åQ=a«Í½<®Üí*º´’/È^Ø?9ñ'´Š8'oœXÜ`6ÜêþV¶Ã×ÁŒ„Íåe…l«­\HËnîW§*Fø3±jšf÷5‚ýtë)’´\uÁ'Ä`WžOp%) šBX×ú÷ªøI|˜?EèM)eçLŽ<æV±¡›69ü&*ˆå°7v—ÛÖ?(­¨cæUÆèVðb_èK{|¤ ²34KE¡yÄÀºî‘:…Ü:•z>Å·,DÎaν…¿Ï­Øaì¯f¬MuÉÉ“]›Ïz\KcÛ´R~{Žë›ï»Ÿì`xÌhVSÅke¡²-Nîæ76(W˜Ù]Jâ™eâØñ7©d " ¯V3I¸|§5xz¤%̓Æ[É\÷cXïìžuÓŒ-Ó‘~8FV½’¿Jz›WÙ Ë(p”Cý¥8…óÂàˆ¯ØnqCì5@ïi*Ü 5üeø”vBøP<ã²!X™þ§ãÙ½?=ÞÓÍ$‡ŒvÈœ·Ä ¿Û'rDx‘]ìëß"G6°¢n6ÒŠóJELÚüˆ\6oÞ_ô2-þòí“;HÀË9ûR»O T!–£QSÆë^W®HÕÊ·ßÚßï¦^zÙóØD•xU[¨Ž¥7°Ín€•ÏwzÂRÌz†Ö>ܘÙV–N÷~<Iúki»ºŽr³íÞÅa°7rNÖŒ7¢ j‹n‘Û y­èµkÇwó6uHP?z3z†±YïýîMû— p/rôæT¼%z{¨Mèžk¤îÏÅÑIꈣ-ìá<“éÿ ©LS>ú[PÜÔˆ`ßJVˆûY¸ãÐèêÒpöá*ÐR¬y[ï™AŸDRa¼­ŒO¯eW°kÐ xÃ/«:ë„`…2ÕIEí¯ÆYüBÙ{°q£gôê«éýí‰#qúàgjÚµkǶ«šÃÊ‘>øLTÕ©q9-º8EHRQ‡P•ÏG )JQƒ€¨ÏÒh”m\eWhôé¯âàÄ2yYoB‹W¤¶•Õ’É;/ÍOÚåÁ.úiid§ìøˆ öe/ñú.˜û‹Døržq`½Ä+SÕY VÒÏÐUùN’Ÿ¿–îjíÞ,g!1„½*)gY§É-]Ýj!÷afÕôƒ•ŒïßÙ3zoÅ-%ó>#º¿u1ÏÕ'î–Ñ“ÉW¹{ -'€­Â—’2Ì-õpDÛùžuój|¾Ì¹Rš—ãng¾ªUAF,©Ñ4olÏ’…Èé•àÐÚÍh±¦¦­£´40W PáðŠváßÄwŒöO;NœrÙ0ô&A÷þÚéc KŒê EgÀYøRütD¡ArÞË­ØáÎ..@~§5$Ôo¡B1”çÈO Þ² ô±š ŒTâ NÕ÷ømí_§õC£AÕ>¸²JÝ^4ÌdÐà NÝÉ÷$òžiÐñõý9ûY¦CAk­h’Ð}ÙBÎ7±{]×v>3½¸ã­ªà'ÊÚ)+ªpx‚ªQsKY@°¬“FÅ•`³âÞ*‡òC°GÙAŽC#¡Ã̧lSöˆJ=W×ÐŒ²ñÏv«çQÈŽs£™¤…ÿFV»ýÜ“h_KjOx€þÔÊ4™ûE• l°3¼¥J²½ãÖ_ A½}xÕ¦éÎ|¡MÃÀ²†,ñóK2K3˜ÜÉØ›t*`| "CÖ°Ü®µ¢wÉî*ÕTä_ƒD2˜]†ThŠ/DЦyˆí5­ÃF ²ÒD=> !r„zƒáFetù&cos¡Ánî&ªÚ—Zè?;3Αwåø¢f‚«ÖU;Ae`®,rÇ;ÖDX% Ò…÷¥’+ ¥ˆ·ôÉ7ÈÄfˆ¨ôtù*½Å»¢ÓcôÚ—Ó|F+k$ÜÁ`LïvÚÄ~[°_Kï輿½ãw!ä‘íËèÅÊù޵ñÜ|2æ¦eGôµŸVí(Xê Ð뢺 ÓI4ѼÍuHo‹Â)r*®O°u< I ø™à…„@?éšFm"»–ø}%Úqκã6¸÷äælJ¾4ð¬\¯Òmù.ÐÜo§Ÿ<ö«]e`ïM(€T§ÁoÃ+¦äù;]‹ZÁCÿl;áÒËyñ$À ù·âçµH®pdK¥pG¾ùŒOè\ècZ9|~9ãÜx^$a9*>î‘êsoæ©–M èOˆ+¾A!(™,]÷Ö$GEu')V9£VLv!]%™¦À­Ñè†ßžzr¾wñ©ë1·ø½nú•@ÑËŒóU Cԯ &0‰òz×ÏåiŸËl°OâY9Î)z8©Äp—tªXýµÉ™Euî~©ÏáÉ›eõÂc‡\E‚™ ³-µ‡â›COŽØÙŒ«¨û&¨]ø° ®’}*ŸÐm¼¦Ãz[OÙZGdˆYY™9¢O|c.ª‹Y¹¼YÜšÒk§C…sü ¶é'|mmé™5éyr´_Ž|LS!˜°Ù½“¦mâY¢U0lb®X\Æ\ØD\Þ:”O¯@l*Á_ÔŸb•©kYˆ++Ü>:"|”?Ú ­‡ã7±9ÆE$c‘Sóv­4»&Œ ÎþÛí„ôS¦/­Üq’!Ô¼”}m#25ŽLn^ýâo;¥¬-–1þ ¾Râ¢T³žkî›þ#‡LÁ$……µ¾ßãR×BH[æÝË2Fò€<ú0è‹mÛnŽ"l”Y/=´Nˆ©í7Â%mãùËYI‡/ ÎÎê6ý¿€ª-˜+q„«uõ" v…³L€Á@L4,<#eí–5½Ôû1¢ŠÁŒÜ܍ޕXº¨u ¹/ëÔP$GR%…ø²jV2H¿¨$ޏE{¯nl‹!" yP÷Éþ qb¡IÆ‹Lžó%C>ü—éZí¹¬ÇÕ{OÈW—²ÿIdFâË!šâøDf±À â,-,-FûÙ£n‰˜€)*éåÓ”r™öÏ__°ôœšm7N<V-ü’1ï×ø×]Ö:”ÕQmHÞš¥Kü±È:œ6LÁŦ¿žÆí0®-0Ù¢uö¬êl Y¯úš1ΪF?dŸÚÐB¼Û| ­$ÜpùDKÔBª)pÄ£Ñິgk0ÈúW%§…Ör%í¦Õ¼éRÙú¹Å¤Õ‹u•CÄø]µ[+É#;¢óFù)žò÷Ì$#ߵ൙“·íù„îõvuòz 1_ª&@Ñë¶â;qþªr8u’VE;Éð2ú±ìzA,åîÊ,iƒÃyåÇýµ’Î鋿lµ,•¬ØaÒJÄ!ä7€°ÿ˜n†ÌÔqïêø]ÿà÷Åxž"1D¢]¼ž5g›3ÍköšÇÁG+À”R–x·©ÉïÇ i_çæ¶Ó¦b«† +‡hŽOIÍuxˆ€¸nÜÌ 4Ôƒ¼‘¸òã;‚XBÃÛOÞº…8Õ Ç÷ÎW}Ù‹…ˆ–@Sñ9ÛH3+¬iÉ}o¹¥ÐeGÃ)äýÚ­—a"’ô0ÇAB¨Þ/í6oE~¥ÈbçN{±“à NΓդiâÍ)"â3na ñ®†úg[Âøô ¬‰ŸtÎξv‰ùcæcE"VÌÊ ]ê.>NïîªLüâÄâoÂ÷—7GÄh»‘˜ Ÿ 3#×Mþ€TÞ_‚pJ{1lŽ˜Ø¶G  â½!˜Øâå 7ëÌ)‡ù|Ýì(ä´aº±?„€c‡ö€ Œü 6îÆ´LÖ#'‚v€nær]/Á’Íp@Å’;IE±sI©¿æu¹Òë"z OènßP¯¿: ·àe1¥ ÓÒæ°µ’În¯ŒZ©D”-•4ËØˆÖÛß &p=Kb7è‘S•_Øõ…ÏJ—÷1ÚÅ=š³qñÜç…ö OÝÀÅ„i›áöx\sø¤èC§á›&±¢ÜÀßåTí{û]“ûŽ”z!ùØJ(¹^‚!6Þ„qmRß úî&ä•”>àQ.óeàBÖ.˪÷E6¯S/û ö È`2øfgô¨7ãl„½æ®.©2C•7ôM)M¬QõËðB†½™ëÛ<™9¯^õʪ0x MöÃUg`#¥“šŽWüw;E¥™>òŸøÂŽ';‹,-Xú™jj]ÿ>YOúy}Yéa™ ÎPÈGs’,?²ê»Ù9:cñÊp™6nötg…nü“Db–ŸÃorB Þ4ëy™T­‰I¯-Ñ4Ò€pøFé xÖvÆ›.5Äü>Lp‹Ö}Îܧ,?:j“§Ýt*òx¤×ý#]&Ex¹I ‹JË“GRÑV¥²´ /&3À‘Pø^Ô#öÌ›þÌ•æLoRI¬`¡èß>n´.q±×TÜP&ó2š¨‹oPyffîVK¯º\½wP¸“Ÿ$SA0í¿ÖùX# 0¢¡½9.‹D»±:tMc uä»RÞŒ(Ï·yC‚íhre B²ñ£ “3¶‘œÿMr°ÈØ\}(V•'À眓‘º÷%·BXŒ4º[¾ˆ Ýn&ñ.>äÉŽvœèUT¨b«\=í}·‰ÜÏ®íôgæ_"4». ’>N¶ÁÌaÎôMB/Êw½hRñƒM8jTØ\6ß”Kô‡𤖠› +8Ñ[fç?®Æ÷ɶ:©R£m£Vúày9 ÿΠò|úȉ›B|Lp@“”_…_VY®ë‰äíwÑJW­=ID™_ÚóôÒžÕÐpy…sgpì0‰çÄ“F>ZSµx5 1ÌlV†ÇNk/ÍÎüÁLÕ lJijœ:€‰“Çq¹#2f2ùc©!’¼fš¿×$F;å¾%·E¾·`‘¤eÙB`“IÈݹgEdÈ~|ˆ„Áë nõ¶²È,©ÄpC"Œ×¿@;Jr/Ëf›<á7.]ŠÝ6Ol?tÔ| Æšï]r¦·¾ËƒkßjÍÜ-çb¼?å;½Ýä›R[]Ϊ³>iFòil)õ•§qƃxQ£ä$³Õ’‰áºpe [Vp£–ÞxÁ;)KÛ®¡;?5XfH;3¶áÅ $ø÷»ñwŒß´j¯+‹wðP²úØ1ÞÇðµÀ¿B§¹ ›DûĉÆ¢S3?ñ"‰&§’º6ÍÛôx† `D«¥!"êoô`ÈWÚCúõîÞñU@ܘºÿ Ñçœ*ú;R"¥©ÉT]ŒöêÍg|Ãs% 4Û—C!Q|8µ.:kWn÷´C3‘‚áz¯k™ ‘ï_½Ê.¿á0I› ÄÓõ]6øoƒG¾Ë_É<þt'£P%£%2<®á-Ç«´D(Dz¨uù€J›µ ±5 ‘F»:W|6–PÇטγÐ'«"39ûζ+æS³è ž¾¯Sm.œ5@ÊS¾h µNÇ D†ÿª â%0ŸÛ¿­¦gT½¢–ýZù¸fÞZiÓ@¡wÉ|JËà N¡`M ¿Y6X=šLŸ&Uì"R^ABûK{0Vÿp14:ú]<5ÚXš¿%U¸öÝd‹`´’Õòü Êeñ¼A@â²ÈÖI°–EVŒI£SåÞ"þ d'>C?££Pp MóGÆå‘aGC?ç6­[VdªÂÌê%2g>£»æ”ƒ|/—ÃèƒqrõrßF)lœCÔ›±6®š=Áz;ä#Ñ*§¥ü~8e«…¸3–Út×£©J4‹ö²} 4Ø¡€³«Ñ7‘ÕCߟñÇ·ìÐ2D­eVò»y'zõ¹o‹L<]Øï7_ÈÆšT £¥B‡–@¨;í€ÙÅ•\zÍà&ß‚wãΓÐçÓ©ÊEU· >÷ýÄžW‡e|yK ê&ñÄSzä-Ô¯úˆiûr Ε9wüÛúÐÍI®‹$mç(õžÚ@޲›%úlY&Òí¼K ¯©ÌE™&G÷ÂÀz]Yµds6MÜÇl³žÍ²®;7ê{lµ¢ý2 #;è­M:P:Úuœû[TòØIÍk™¼fàÏý4•Š9´x¸W©E|o‰‹ÇDeŒEÖæC~s‡—SŒÝfºßk-Ò“;FÀŽo€” ¼å Ÿ€¬ªûH‘o®è¬ ¢…qÑòYð;œ*û²€¸ô€µؼEðv¨b9’t»mj;ø*íiÙÆ]Lƒ‘š~[ iN¡1“sbz^¼ÆDY0ù:-0ë:Ä}[&ßÚ~Ä%÷y&0¦?JH ÁÇ3&¹¢jë>ï‰Í\õUZ£VvŒÌŸõƒ‹Õöí-°¹.mBØ"L ­qB¶šÀ{ëÓ],WyÒÇKŸTiR÷ç¶ñ$죠³s4ÿh\ »jï–ràèCfgëh'µ÷ TéÜp84(Ö _ ¼fã¹›`adÒ}Ô?@²–rG+à ïñîÎLúßj+ÇË­Ëk©N¨@°Dú+CÐ;’ð¹iœ¸\ªNÖµÍX¦µ™®-}ŒÞ…æ´k®ó¬·q,’þ¥V;A÷S&±}4ζ*ê ?¿žUͲÆ&MV¾[b°„¹çúŒN—B}çoB2LøQ-²{£¸=LŠ-vV_gš£ÒcÖÓf¡»|¦lä©yĘ#àªÛ g‚{eÎH¯ýûûü!NH¬) p€ÖÁŸÁBÌÝÔY}ìón]G øŽ{îÒ¶í ©ò¹Êì­`,J×дwxøhoàÏBŠNã¼BòŸÏ7¾´å 7úzf¨·AÕ©äàLUÑI4r‡ ò+ˆ*i°²y 5ðèåMßé}‘­p¿°A§u U¯õÌø£åG8 úïL»Û£òE`T†sÒ4;DÂq5ûV*_ë­]ƒ¦-öíUO,lLVjÆ4Cš8¹ã–=)ÁJщ~Y«`×+[¨î;íPhàá9ù OSedïæî›‚à^ÌÇ”Öä @Ñ>(‰‘ñÄEùµ–?}¿`ÍzºytÌ)Õ_¹’Ì¥°‹€ X€|ᵤ[¬¾ËlÅïW?ß5®÷gWAe48æÌš,ÁÐ#|_Ì!öŠuÐBƒÜ„‡ )Á[i¥‹éfbŽeh@¬/Á{™»g3òPÚµ§ð¶q¹³ä˜€‘ÿØd}m=ñGº,û8x¶YDû$! ̹ý3¦t,Ò§HÒoÅ·€Á–älñD#×þ<…øM/Þ#äa§§Ê!%™[kˆ 8ïÿ!^³eŽŠâ¨XÁüªp,Çh†U@Ñj}ˆ`6ûýÕÏá¿»Tů²-÷Ó¢ÿÕ9¸Àhé05cÌ'lÄ^AóD›ÖñŽ>/€eqÆåí[–}‹ÛåM;<àçÞ }¢ãÃWíq¡®S¹v—>ÌýÞ‡¯,ų"í§¨Äý û{±ÉXF G¹D64K;F9¾ó%÷ÚP>áqŒ:•Uk\65™bd¼W˜WÛj¬ Òâ_ø)Œiç}% |˜ ÷ŸJC¢›8ŸŽ–«‹gR¿›GÉÍci«¦ëEОçö@?®·1+M  öZ,Q™þ×¥æ¾í_ÆðE¯¹%©ÈhŠbžáŽp|[j£Šéã$¢Z‚(†bú Þý5ËÏó_­Åݲ1ZR…Ïpä—$ê´”ÄGt#HÓZ >îß $0Üa÷#¢öƒï“¿úaMl£#hB+B´ðTrýâÐh“S´(ÑC†éÕ9†™(‚!]uá:AIyIo,ó´ j×òVºÀ*†û»~«øýâÍ E¬þ§.ljh¼5¢ÚDx|¼® õóíÌeK*ÏÐhkÞ‰‡DÄ«yù+RGŸ³k|±­Kèeô&ÙRtºloÛ¦÷¾HqD]ÎI\¼‘AÚ ‘$9Ñ΃Q@1 ¸ÑׇF(ÄéÃrÍU‘€»A-w Çœ3êtÓi‰}EûIËÓ¿>ë‘QÖ+„øáb¡muÍ¡p ®¥D{Üì`‰GI¸Ž\ñ¦iìAUkãH_µxªêÃzN8žºœ{ñZ†½h%5‘Ãê lN°³ðò*m“—¤$¾-£’$q£4]ÜÒZøb=HˆO ^97ãðú³/JÕ×pfÞ3 ùØ4öðÆV1ÍHÛg ·!ŸYc**b<‹u!s4×п`ûj)ä™ÜÊ'nã1÷|‘Ðë>YæP±?ÜW@ æöª`Žè×cz;¼ ò)|…WÜŒ~¥ìI-M°ªª™÷<Êü®÷XŠIí¼í«¤áG7¨$j×ëËo© >‚zEÏ[i§­]MAÖ#§MXÃ'Fû…ÑŒ`Ì Ð´’‡õB‰&ŠŠ²–]á~-”ðÉBË š¤„•¼d‘ÕÏKr .îX~{BÑr±õø(QHþZæNáóò.ÍÝ–ÚK=âû\™˜à~h2©þ`Kž÷iå¨^˜2UŽ“j~ÑnºîÁ[; ©oΫ*R`j…20 imõpçƒÖËŒ°Lä³Ï_ÎÑ2:õ':¦ þü ÿÈÄ6‰T#ÖŒ,{‚=™ofx÷d‚ãqÌZf•IGR¹A»3ÑïÃ-P¨®ÛÓ¢u» y B£ó’€‚÷N-àˆ\ŒŒ^&oGíÝ=r h¥ÖyÁ"µ)œÍI¡W°è£âÈÕñ[ ‡,y2ê¹ ¼ž•dÒ³¥HÂàÅ›ïté©nè°tÕ•bÇ”µXxçuÓÍÓ3›œŸàùs©Ž¶îÍË€ÖÅr¶±Qðeˆl±C¿ÃÍÞþ¤U­•`ŸÄ½YlEј3¦*qî+ \Ûæc:›>Üžcò‡$ê!'‰(`†Òg 2ÿ³dGÿB'áj n²ÈÝÄŸ­h¸}œæÄã&$â¬ÜŒf }-2¦¢Gœ-r§´iž÷¢ÛêBxÐLžˆ£/Bê:ÁÀä€t¶šËâø¤Îôûj> Vþדl"Xû—ËÜæYsnn,uT^"øpߨéÐñ‚óm8•!Ò¡äÏ2 QÏž„Ê”q·ºA°I¯b*H&ŽRY°®’áoÍ ûÊÚ«†Öqhz b˰'?eE#åçR¨ö¸ /×è£Û ›ÂVòG•㑈¨ð½˜Põ¶mduÊjì™~ë“»Â`½yRP9žà=®QWY˜CfÈ5"82¬}1FpmxA¹Áí¨àR_~dˆ^ ñÐÃñ-©r¡M¯Õ¦âRGm„ø~©¬v4_n”¤ÕUËxyëei¶ÔJ'æ G¹*ú€5ˆ¯2*f?Ç´EíÆYi=áXzö ‘ÊÆ•íƒ2pçù˜<¹0Òv{|k9àb‘zטtòIœÔ{.£u^æ ÂñŸv œ¾¶à7é>AáEÄk€ßÔum}YÑŒœߘ¨Å‡ãùùÝ9Ðí¬ðB}–àb»ôU`¦íšbõbŽçãx ·r—á9Øþsáß±%$½bènPKC ;ǃ·u­õ*3„k<•à`!Ù’„¹ý£Ð˜ºk5 æ-%äâæFz„Ù!9ï ¸¾©ú-Íã@!óœ1îÄ”£Myå²fF·ƒ«å|“)ìä´ŠôZFúX¦‡äpb€ìÝ¥‡V÷éºw]§ëɬ,!Ù¤u9¨Oã¢ê|±;C\PàÒÞ_ZÁðÓùŠ4 ¯æÍo§ÿJÅ#Ù Ë1oÑYÖGQ™ìY«§ŸDV;u.Ši·0>48Nú W÷Ïß©àÅÚÂÃ?­¶ C\°µÓ(uO+6†ÁötE'×íÛO£çÉst”B×# ßP.>z¨G:SÃ&ÉöÚöCÏ©Æä_ú­ôc†vþ×É×q£pÔßAãìÊõCI\ÞÅU5,áƒ[ ¢RdŽßVͱþ«Ö»í…yña¬¡zµí/ÿá‹¥¹{]Ó ä”È@zDI>)PPöÙ]û¬rÇ}µug¥Ë\W>b ¢LÞ4/^dM%…Ÿ+~‰u8Yj ¢¶V§áˆ Ü Ž«V»Öo®Q0ÐÄ9ŠÕȦ(,$ÙåÅ«ô3«öÀí6œï·iç•:þHS(¤Æ*}÷§yRú^ðPîäâªCPgiv_¹Áû¯RTÏEþÌD0)¸ŸÓ$†¿†ùCîµçµ5vWÜE»h3Â\35ÿ(ðS„ ö/$ʰ¬ò÷tÁòÆutZÉÌL§Ý׬ï¸ÉheE_ТT´µÀòÈvq+–™ÎMŒ|§(陊uQlb3”" mbÔà\øÃÿe+Uªyq3´¶ãg¼mQòŠ‚Q—SlV%6p< J¢‡_=_Æ;‚7§¿Ù©Ü‹¦ˆ^à¢Fiu’ËuMûÝ;ÁÔÝèÇå ýÍ´™P¿¯¸>,¿ÐûáLH¼5eHø+2IFh¯ì¦bÕÖO¾êÚz±;×v=)PjÃA^–ÛyÍÐ—è Š5©{¡â"ÿx*»Rq~à+‘+s>¹I¶X.¹ä>jDüwãõà›Çò‡i†Ñõ…8lÕé=¯ ’À ëôæÉê¯T2Ô–? §ñ$Eó¢Q ¢…Õß﹄=Ádè,F +¸»ƒKØ?‰è~é%RÄHQïù—(F Cä Svº4NNØ÷bDƒH¡j èE!Ž˜Ï'ÈW\¶2`ï<DѲẠeˆý Ç²¯'¸]f9ñ0 ‹r¯ák‘rõW¶õÈÅ^ž½xôA8£¡¸ú×v9MaEóðùfJô•Ç)_Ó=,Ä7œ·»¿—cÝís.±;]u@ÃøSû¾ü|hCãJE>2Vµ¥¿c㳡ÑßgKnWõ±:MÀuØ­qª×"¢ZjÂvå0Óû÷\ì»ÚXA>é“vŸRž¹…@bOHâZ|ù£Ü%ò$ TFhÙÌåÅ•—Rfü à„^Æm1åäõìW:xŠ‚Æ[ywÝ£2IÑÃ7‘ÏÄDñ¬‡GG9¶,Š >9_öQø|Ñ/*d%þdÁ+¨b‘N¯¢%©1™¿Ûyèðjl'Ø^—ßäšÙ,p˜aÀJ1sGFú#_Š)4Ð65¨Oc†²Æo”Ð`8jI‚SÎdtŒ¸<\×Íf¡=ë¾;K™×…7C–ÊíC±Ô€r• ¹—Z a3OÁ§Fî§0T³bAëÛ—ÌCÑÍaø®ù4ORƺëH°ñVh=U„Ã…—]zÖ®+-Z^é[ hqDF ÊíCwáE’éŸtrÙˆ5d©¯¥°¤bl PMçÛè-RØå>OjÓ3Òš¯ñ Ùлâ„ì`fÎ: u³Ac³k¸~«KŠé—‹°›%BÒBçæIR´ (%ñKê2Åxu§Å 4ñùn½$f<ï‹rÙ)¿ÕË4ððã#—Ãú½¼z|!tæÔwPíøßY%AxϨ‘ñpXÂ}1Èyùôƒ’t+0 ¸äv[ z\¸ü=Á¾µÛw‰$Œz80çè–M"Í" +»×5®7—?=Ÿs•ò††%ïô†G©XìA8q³|S…O2Ú°ê¤«í§ŽÆ@½®Ô‘^¤jöœ ³ºTïùÄkßÓÅ8ÈpÄô.±“‹ô´NÝ6ܘ]í€è§ÏÛ>»ÿoHîìÇJˆÖ­Ö¯õujx'h¶‡µ›‚à+Ê jCt.X’- ˆ©Yƒû³ùE`”Ã[@´ åTh óZ[Õ”î:®ùú=1žGß²¯<í¼z‹-0þ9/=­±ŽrÏ•SÊw¬#Gü@½PÍ‚KaÑK2ÏŒ—¨?H²EV~\¢Ù “4ê)Øß« Œ`6vP|ÝîJà:Ö‚Œ\)™XEE§®ÕÅàø²ÚÅU3ß”«‘ˆ¾eõˆÖ¼?Kä(W(Â¥×v <^‹-¶*Ðn±2aKº±®·H£4 Sü©Ò“=´+”Ÿ¡T¾Ó…¹™£A%²æ<à’@5I5Óø5åîoô6i9)<’`2¨ }%š¦Jêÿ '½WZ=-‰—L½·šy ÔÛÿÙÉË‹™3à_oŸÉÉΧ³½àOcaˆBikGèݰ½ùÒW,ãLp‚»ãRQENdÚùšIfËé·ƒÏì!óÜ—¯Îïv‡â*C–àÙÝÎÄ“#–Õà‚@ú=õë2ßõ;©Çe­‚?r÷£C‰'ʫ深\Z?zës-½´tžòòë£ÓªÍõEÂF;N—'IVº\_@YÀÁß8›NWšáË´¾‹èo»L-¨4Häç"®ï›àEý ³#p;,åG?gÌúBBb¬ÿ òuqØ]”šPúÜl&Yð~FîPþÒùÔÇïýYºC¶ý# iuœÐpÛ3ÀõthìhH·^nÌ_üziïÜ߃zVÉ÷Ø®?K¼Ë{,]ð’ è{Äœµ6JTb+›oj’…²HÕƒéߨœZ¸ÿVˆÖÛSÒªD±û³”¢‚oìs”hqVw³sœ'ÄEK<ÉNîñöÞ÷â>£`Ҥ΅ 4>æÈF\÷l$`çO†Rß±èöYw ô;0¼5y¯˜I¥jbÀ1~QÖMWÍc¶+̪C­ˆXXr”=Tl«H;Ü{?I?d$„š{œL9 yÒ¸ œFž[÷é Y^AL`˜–OdÂDÒw^F§ùñøeyì÷Ûº„è ˆËõ”ŠV¥ 4çö9•cáòW P©'èx‘ÈÙ+hrR½= ;nÒ<ì `Y ˆIÒÕ'w&›YÜ!^zrÆãГ)P±¸¾|‘_;î‘T$²nÆŸ‹ .YRJ¸ôbraùˆäJyIÆaŽSÖuÏLM–+r`8áöî † Ì¢>pË æÎÐ;'4y®à»ÙôÆ %  xÆmC`tã æîH€;7HÐÃ:+J‡ÈµG ¶ƒŸOyÖá"/n0,‰bDz=³Ã9ÉÑ‹TÕY„ÐÎ󊸙öTˆö¡4ÇÆU§¦“IBü¤e×D*¿uâ A_1ùl*˜z5^`v¤OjEyª‡YÂl6'Ôcl“½SΖ «RF€p†®³±{Äj}Äh\†/èoæ{q}žBòE8-HBYâݱ¶Ú–¿4¼øîŽ~àæU¹ú¬%ÒùcRE¿„žž¾1OÞ<_îÆ²O»E ÍãÓ\Ø£¦ð |ø$Þy<¾ÇeQô&ꮮ駱´ ë5ÀÂâËïÂ82qW>Ѻ½¿6Èåh(B÷þ0Uo‹Î"\”š¡È~`h<(æ§¶«Äl{¨@<åO§Bû‘ðF« ˆ/ÄfyÀÿ–§™64Ï Tóܸ3 !´æ+mœ¡™MDšZ¶øÉ\[úRÿŠ6ˆwâ'Ž¿}d‚:5z¸G‹ïéàLÎîè4TïB‹àrÅ2Ûpyqª¿ b¹ÂÙd§õN³˜…Mñ.Øãù€>úÀ,m€‹çÊï¦Ç ÐuXÊ»su(‰ N œw\mà8‹Læ½°´–í duüÆÕÇ»M›öjÓâHœîn¬È•ÊÁipô>¸ØB‚:Æa$/Y¤p¹Iv@ŠìÁÝâ‹a¾ü„ui¥¬êYJX¡.çuºÒ37©Ej±dΜë1Á»0u5—•^}Q»‘'7Í22jZ9·jýä#…däYÔö°|×ø“ˆìñ2.RFß0VƒÜç ö v(TüluHþ]³_ãø‹¦ÓŠ¡îd,l™eQ‘,AQ´“«Ô¡?)A×Ã[ˆàðÝÛÕUÎéjí¦=2LþGX€ìÊ0Ýš<Åè<Õ|z*G1³»;v}tþ÷¸ CM#5^¸Tk,ÙÌq¤Áiý p]_5¦Áo`üxµ–þÅÓt©“7‹fÆVdÜ;>VòwpàlXÒšÑßqNuîžøJô¡mzNdmO è} LeY A#rñM2Üœ–ûÑQ 5ú`ûµMô±\oÌ¢`IE D)«ÌŸlÑ©©z¨jú˜˜é„ ÕâIGweÃH;•j¿2¤èÕÜä7ªÞRR©$›‡‹ÉB³øõ ô)ìàJ¡ØÓñÀ0xƒ3•H|ú5Tè¯÷8瓪ñ·~€Ixéu\®²â…ÀÇB;Ãõ;¸½ôlˆÉ°nŸ1AÍQ€bcˆ¿Wùgã°5Vœ(Yí3zÑäoQŽùïI– Ò[{Ä/[Sïëm}ŽÛbžPÓÛip*`5pnP¬Ä“'w„[HœšÖ–Œý"T“Ä‘¨œ¾ñ(–h͈àêÔ–úˆ_…à›}ÙaÝB‘ÔïkM‚]‘MZvi ðŠëj—V*dA' ª8Ãæiã¬*¸ R`Œ¸I¹$'}HÂØx³à_¾šV¥Aý\‘`‹ ÙšeÒ<¾‘ðœµ×Åj¶šmª#çu±¾ ›Tq\xµ¬åÒöù¶Ñ¦áóÊ7µ\±ù9c…>ðBJ˜ÑP8š'n ñ´çÈ$ò¤Ñ7 ,rÁ2¾r9C;òî ‚¯½®Â{RtØ×6踿zø””ÉåÇŠÝÙ$³Ìát•úŸ¼ÖÊ9 þŒV°§ •ÃïsÀn?ÌšVuk•Çkêk^°ý:×E&Ìv§é#u«`u‘OY¿ E/€öÃ"kæá8ŽÐú+mAuUkGÿÜ¢aBÚ"ÓžuK· ¨8úå*xÿ¹>BÜÊŒ wB:fÚVˆö°ú¡Ñ=ýqRueuù1xU# u­4 cýòÚFµ¯z«¦ $L¼MNcsT½Ÿ(U¨Ã¾¾=Þ7ì^¿l3GN¬ÙáéXjàjö\­ö  —(»§>`Ùd¤¸ž³V/tèá¯YÈfxh0 ñ‡ •;QûœKiÊ!JQ |}í ˆÉrY¯—À¢8ÐÇ!­ckÔY ê\'zRà2Q&]g%>ã)v¢ÖÝøKÖúX>·nv·À¸_õ¨TÀ<Òü’ ¢£|‹^/ó¶ð§ 8?P=pV¯×Ž›±åæJŽ–uì –“O¤u@Àt£ÙSÎNÈ^u ÷tÊ‹uŽõo{y¥9$F^–ÖÏ¡€–$Z0CÜŒç>7‹᥼‹ ¨uZ¨²­ÙR«M:`܇å3Ì€vÆÖ$¤EÍ'WðS.ö œÙu?¿|ãf1qœ~«=»·SLßE¤ÒüT•rÛ)²;ëz‚õMnˆ+û’®h#ÇjíC%i` êÂ$+ñmÈ\€Ÿ•2)¯0î„LÿÑ"}¹.'‚;ƒ]yÊ_«D(ù¼ÙʦÐßiàî…ãnLÆ42‘5™N 5ì°T‹U&x ±¯®ÁØ…ßæ÷HÈûµmxŠCÀòµœ¾Š}‹s‘`f•-p%¤¢4“[Ùù]úrgK°×ã`hƒÊ·Q†,ƒ[j2ë!›ÍIKh0Ö…1ëó ^ýy°Å€†ŸA”ÊßBPž³Ã $d³Cå߃É]€<Æ"Ù$øÙ‹J#p%y¾Rjb¨_âÇ LÌðµ"Rà¬m„š‡f3h¢00Cc!.ƒ¦©¡ÿ’ YmÇE nŸA{_YíS¸1‡·‰K\”K:ÆÑÆk¸ìvFf7äCZÆ+6sA#BêÿÌkN)ªª¶Žš„²O¤™­Y#U`÷$„ÕÞñÑa ß<Ã+{Ù*HqBût'ò´pöƒaç“$cì ÖÛM$ŽKÀÐ:À­OŒCŽa‚ölƒô"‹lq¶²ì¨Ǿ±tÌúj÷ãØûùÙyI%}0j² ´vvÌG[5íÐäIÂÿ NÎÐô~s[ã¼IÐo(ù®'Q‡yTAy+÷€V¸“QÖNñ»uÆ;«¦('²œ3*!ÕZ;Šy‘iÉlÛƒ&÷$Tøþyžý›´çn‰ô¨…ßÕ¦Æwn£²‘·3»Œ¢pº<ñ!‡?nÏ€±¦ÒÀ­kô:hJ¥´­„Eî¹ì:‘:ÈUÏ Õ <:”  ÿ¦y» Þ¬5ˆäjøÅÎïæ Ý—m?‹µALÐê¡l$JÛöÁðq<ñ9­U¤£6\N^àmì%,--û~Vúáaš`MÆÏ¡ÇzËSï|»·qŸ—³Aº“RJcQ [ùF¹¶¬îGÚ¿kòš#›ŠòÈç^Rz¢“"P‹Rk ü–?Èàw ÙÈý§ˆƒ €—¼™vÿt`‡ ~´ÒýÍm…œ=ÊâPšêÄog—礶I@Ê}OurßF¡–Û¡Õmf&hWõpðËz× oM;,'|DIPÎÈ߯Û5aÂPî%~k?‹çÌ=Í##Ëýdq›ª=|>/–3”à¯Z£{ÇŠãb…Ïü¢*{Ja–‚9@'ܽ1ùC[,Ÿn:£Ë»+401c™ÚÅ éÝ&¬’³6=v®è`W³ÊÁÑ`çL~*Fºiïþy?‡*£if³l·ÝeÀVÆeM†¶rˆ;]‰xéÞpÈ‘çŠzÄŸ9Ü’._×”1øƒõ°C?U°à¬ã¥Á©’€Ñ‡ øNrϼédŒÄx'Bî³4ÕO­œ{S ñom Nþ`kÖëöyåd|À|P³öšEÿÁï=äF®Þht'É«c7K™º)§uú˸üå¿MJîãukbež&’6‹•ÒõìÔ÷;ò =Y·ïäi Ñ\¿RŽÉeÇ(P£•¿Ð¨Æ,¹9î%‚Íúb½ºìhÄÒŸ¹$ß\Ó•S]èSÝà(ùßß6ù9lޤOrµŒ­’°)xÎ=I¤ÌX-êÍmƒ®§¤~(ªÆ)âüs‚Ó „.PÅ#ÓZµ' ü=­¤]–¥Ë1Ú/G Y¹1ç%’¾—âÿÒ­´¹ ×EIW%ÎâbéXr=ÒíºQ‚S?ÏxMÛVg§-››¹ìmAíŸq_ò—Ò4 Ñ’9lÑ0üôp=£“‘YmMii«q+N(æP­RvAèâSž×:îFˆÙÄ[†ægl ¼ók‰fi¬G–u… O`ðó­ÝÑŽùLEI£ŠQ¨U£)æÍ_ÖªnO¼\ò ïm”ЕËè:­{½ü”DDœ¼ÚWòl<ðÝUÄ zó„âœïÂw‡5rׯÀ’2ÓzÞ´=vQGBïÀ YUÖN‡<0ñºtæËÜg´#‘]T®"XqÈN,°˜ž~[ääDš–¾ß\>5‹䨠¿ÌýÑÓ‹9ž´ <;›há§*7="ºÔÈjzÒö%ØÚ5gÄ©ïð±SB6ݤëÅG/„ÀI‰‡º·¾ <*uD’Ç8IlG-Sù÷Åì§(^KdŽkN&9¨&t‰•îÂ&Xò~ÐÝ4§b*¡7Ép”øoŒ SŽ\}u¬ßÇÜ$¤Á° Búyò÷È®ã{®$Ž)Kh $B‹<–»m:‘¦85H ~ "þ:bJ¿ÓO¼ZÈ“’‡€^¥À”®Ä ,¥2Õº¬ÚÎ 1ë„1ôÅxé]Ö¤¿³#ÏÙýÈ(ºRÓÚzw­Ûã8ƪæ¨~×:á˜]!›ÄL¾F²¬f)Ð' ¯:·J囤(¤-m…+ÌTÚkæHëº{ü[ï*ŒÒn[FM¡çVPI“7G»kx¼°­MY§<ëéê·Ž!m§éNíjV5øeT,NßÝãÉ„ÞòÆIñ}a8p°1âÕ5ž€QR[®OÀfö"N쀄t›&´Bϱ=øÿ–ÿÜ»Íû‚|¯ö&‡ Þèà Š³šƒ^ ñ½x]<«"v_î‚#¥5ðQ¸›è«!å{|¸ŽŒõGY„M:¦SCZ5Â`ÊxtØö½Lxî[É·-%çan¢Ü†ßø"Ÿ½šòÎ.| m­v0ž°KŠÆïº6ÔUŒ]Ax§²‘1‘PÇ¿W+××|ªQ¼Â8"¨ÕV4m|µÒš‰VTˆÁqÓ'5ýã ž­¶œ„ ™ WùX(™Cß…œÌf9”ö‡aä9)ºCÄCäP@ºÂΛNŒF¼t;H´nD¥\ìþئ*ßPé°K/—™å'ãTŽj#”OÕÁMÿ­Z&äNì4;PØNP/j0á­‚ ~óCÂvG’]~pº¼_θü‹t±25B§#‰¸†‡SÀYÉÊ ç©PLÂX«0iÞÙŽ\Åq;Ö>™ß=DrŽË`W<ýÉW|§4Þ#eô0Mw£ì?~ps±vò¬‹^s¨Í0œ*€ øZGú$aúÉI—q—þÚ× ¹m../¨w·¾ºW•Yÿù­3¬X-wab ò [ng$7VÇRì?Ž}ñ7‰“¤æÊýGkë'éõĪ'yk;Šþ¥øó*̹S<à·IÔÑ¥CØÓÿÙ×/rÉÂüg4€hÚVãl‰5T¼ ð$ÿ*‡" cÆñ¨Õ òqŸíΚ›¯¼á:†‡;\§4AÜöí!oeĢޛ¶#*øÀ¯3gÁ›Çx_t«HÎ8j£ÅÁ=ý$bX¸æI›ÂLîaîÊWz¶­œ^ÞUÎÖÏ©}pnD~–:µe¶'J§ 9òŒÉcïYÓ¡øüξf¯×³Î¨è|$óDµÊ7ÎHô:–RC )ŽùI.pWgUÞ" {„39KÚü»~¨Øµ§–R<¶(x ã…PKצoÿU¨Ù¤ AôÙŒû;Òd`}4cí¡¹AZ>ýÊiÈ~Úý%‘w´µBû`f‘Jè¡…h_d['.؇«…Oº;Øû+« ÕA×(S‡¤½c\W"ë‹,&fÄ¡¤Bˆ¦ÒÉù9Ðn¸0ÒËJ¾Xâqg¼XlWL¾åÿ/ALæË}Í>=i!¯ªœV;!y> PØB±~và”ÙÖÍKh¯ ˜‚k py¾ì¶ gÇ}5òœótÛñ.ŸùK˜ iæcÉwd{,¯ç¿ôåñvèÝI<þ}>üuèCxí¹›:rÏ´– ysbÄoþÍ^4ú%ªËÎý¸§–ï='Ýê“ ){reàé–`àP½ÜGÑÈöå¤éËtœ1"2¡«kü¯ÁaÖÄ5ÛEóϸFŒ3N6›:ž„Ê2D–l¹æ†Ÿð3€²™ŽSíÈZ>¥û:qtÁ´/¬–ðÛÅö.…kÊöÕ9/¾Ôà3l̘»¨Q•J#¢N3Ó“UDÙQ¥·¯ÄnÆÝÛœ„œc§þ»«(.o1D‹xpfK‡Š¡ Ù+/÷çàŠöªnq–ëòZ žÍ*(e½™çö›ņ›¡Ou—Á£rXÞ¦iA4¯”œóïbÍIª‡Ôj |~z§ÿe¡­—› ðkˆâÍÖlDpK© 3ù?˜"u7âæobûUŒxµÎr=©À¥ªD-“æ]GWÇÒi5Ý9~ÑYx\0x >‹ÒÛŠ%ÖŽzÄyPÑØË!ú³ùSNæ°å-‹ Ýñž~sX¼äÎôÞÌß7ÆÐbˆÍ"…,ff…¨lõ* ° ¶´ òvUœklâÔð©`+eoY\ÄšÍöÅ`Ûi¶}¬B8šO¥nK*ýü¹2ó•θ œ|$ãýEü+O«±©ò„†\Žýq^r …×-ôÀ77äÏ·y¦—ž‘ífh‰h®c^œ8ÞOÊzÿë°8 èÕ¼‡TYÓ²–.0:êkR0†“¾?L˥—?+`qû‹ôÛž/eàh”ã¶eóIüÞ9]xv4ÌÔ×±šÉ€Ô·ó}õÕzTvO’ (É•å˜M3K»mëA{Ùy£ÄYCB‚JŽwñVÔOLTía1aÑ€Å`„Ž˜G‘NÕNéú_.‹˜Ç~5­àÿÈå‚î¢ñDV´d»žŒ}#(´7·Ô—¸_cœaupÃȾ|?æ©Ê²JR­|ÄpJ¶ä„#’èñÂeñ‹šÆ[,a  ï9æÛ¹`Ï«˜ÂzðËÏÚ±2‚×z ÿš>÷à(ÌB‡[V‡›Gä!ˆSy@„]Áo†#½ nRoïåw.›’r,9©í¸]ô£UÍP‚2ºÄ3Õu@ï]ߛ˨’èè@æên¼ ˆÑ0¿WµÑZ7{1¶Ú)ϪÁ¦³˜ ®JzÀ1ŒÏœƒõÇ©,mQXÉŠ“o}G]Åv´òìPF­•32×묢eW³I)Ïš^J´j7à’*ÇÇsjM•=€'UÛ.R¶¾UVÊáÀN'’ LñÚ G¨ê\e\©ÌžŒídÌ/…5Ò;:ºs[îjïÔ6´ÂË)÷ðu"ºŽŸfkeM¶•ßÏSl족xE&TI"š+å"·DÒtKÌkãP«b&S•‡yT§Xà 2ûÔ”ÝþsØÔ‘¥$Œ$ÿŠ;Þ&ƒÇÃÑÈ ž¹(¿\–w<]½úvYÍ«¡[h]·Ì]±ȸ¤¸ É;Ó€Þ´ü¶ã¦ù±†Î©×ú ­e¿ÿîðŽZqÝ×Ôe:!ùTõ%˜ÕЩXJ¬ØÅ÷^5ú&ò¿Ä©ÕÅù$qvQ1†šŽËu/IOþƱUÆs0º¤¶Ë‚³Â2úh¼ñ|=ÆT´úDš@rÒw&u‰i`Ÿß^ù-ðÂûøëI5ø‚o·±qSúf¼®[ψuÈ)PuÉVSC«(Í M¦Š­$qCå!ª}a¬qºIæ¿¡Ó²sVâ5F«:ÉxÅöÜܘ´81z‡´püÌÙípÕõGóî‰!ÒAMø m*Õ—såÞö©Ú·(ßj_¹LTë‰eƒ‘m è0£?hzÝDþ+¼0¹.UkoeÑæ ÿ™ˆ­ ü£ðæÑs¦s•¨Øûb³F q5Ói`d—P]{þ…Gí> N˜q1ïɬ¨Xئ"¹êaŸ:1²Äã¸#Ö9ÊmèÊââtRQ±Ÿ®%OƒÂÅ?‡¹ç¯¸ÙÖÉPúù'Ø%2lTxnŒŠÇâÚÍYÍ>€j–ëú§Iú {¡ ÷ÝT¹À5<{ð™ø’ñPhÿÖÑ(ÞÊ£bêFî¯þQͬ‹|ú„㘯ՉÛåbÂi,ú3r H;YQš°¾ÃcJuÿ[CÑÏøˆcÌàó4¹¸J²áG”ÇýjNÄ~› `¾ž­ yÈ ¡¸JIäBg”çPw^@y£ØrEýy6hǾÁ¢ÂqÞTàŒù˜€Þ8j-鬆¤7…h®èãOÓ‚y°¥R÷ÊãµÅr&½s}矙â—Ì9„8‚C:ÓŸŽÚbä5oWy&²]E5B¨Y¢ÒÜ€{?*r<&˜íƒ£>rPõ¸DŒôH$°B"(atíË$ˆË§a+Yç²èä^¤É?™YÎTá-•G.5!ÇymÊvªí rÕ€8¡îx%‹¸nOåÔ+›WjÐßøeJ|½áè»!Áï iÕA»<ã¹–?9H2Cc澄)Ú)ž„ùT>Ò¦Tºîò÷ðxñJÃÓI={|2ƒ¸û §²·KCz`ã7ÙÉ#è¿ããš3µ[ nãŬ„>ïvÃxŠè3˜$ÄVfè÷Ì]°v¹I¹å‚°˜¶ýнÇù„޾èÛC‡×AüŒ¯¹cJ¥q{J›ÂAãÿ¿}6JýÛ ŠâPºbà 7tUæ{œV‡33˜¸™3å”FŸÈN¡Ô2ôs¡‡µ4mW¢,³)Û»íhÞ+ÜŠa[v}ˆ¶³¨êjÎ6çõºž`ENÌŒö€%ྟˉö¡Ä¾¥½í‰ 4Sñ×8Óª\‡ÄMN\ϲ§ «{5&âRøñnûGälCÉ|4_:{-<–'[C¤Ëï·ñRÊ©"^“~ÚŽç —.fv®ª©ÚÆ@Å»ÊVG¸XQ¡½E»^~(Pÿ'¨h¬ÇV 0ÛpßÓæï&Ô/0Yõõô”\ývZÉb}7…¥ŠÕM´4½—oA&OºÓ˜wùÍyåU]”É–ÿ•ô61j_ÀÍ-=rk0Ü¿¨?a‡ L_ëLä¼’ Î ö_ âJui÷­b ªÅÏ+ëø3²ØµCa‚ôT®T¦çàðÚ)×£:n*J^5ÅÍoñ;YWĊ㟺…oKx*÷$õž|ñɦ̓VóÁÙopИ‰‹ÓT^/ß¡ˆ”‰°œŠ§ ;*ƃÒUn±8™aÃÚüHBôöS_ܤL !GQú#€D~ÓqÃm¤Õ°VfãCÿÏŠZq—@ÞǾÏñ¸­Õ´T‘ÒK/ÜyÎþ „±·kªYßM=/× æ™.ÞáGkâipÓîc¸þ¶V_B‚QBœØeßÐÏÌ©?l8Èu¶EÐÖ™Kð{þw«„I¨ Ûk²{DgYiXZ³êÐtsÕAwtС¬ç¹Âõ¨a;-sõáùJ£*ó¾ê RYí¹gÁv¨ôΓKúµJ?éô|áí[d+ÄÁú§"¤F‚–CÓŽ–kÁv•]ëëPrU½ã8 íA%a}ÖÅ.²î˜ëE‹¨ ü­4û‰¡0ð*_#±Ê’8W¶²ûcÐŽ…ÖŠú¬‘šÔõ³Ù-e„ÃD¡€‰w΄ÿg\¢S§ @CÂ'¼ª䥩;|ý×½]Èÿðf¿}˜§Šm•¸}ÎYš*cÿ‡»(S¬íL—B†;?I(8‹›uÑXêds™Ù×… ò½ ù[IzÜ|ûÝ’¡L~?-…ªF6WÆ®^ä¶›ctù¬7*~¸ iŠ•íÊg0Dþ‘“#ˆþ #x&/3Š’¯ìàHsf[MíÚÎ ˜ÑZtë“æ^!I*o­l&ÚKÍR,Ý¢²€¼}H)‘êé—èÒ'‘3ÜÃÕÜ9¹ ã ž©¦^Gh/Ð~lyH7$"åo=‚àRÿå³ ‹D÷H„0ÇlÙi(oÝ$ÔÕÒȈo¹óБÉt'MÅ[Æî7jÐRòa#\v™xQµ-¿Õ*D«Œvb"×ðz;2¯—2«çÌðé6ÏU™¢¿•”go›Ç?Þªæ‹ÊYN¤ÀÖt þPµå¨Ê@¦ëXš`BÕp|!Ï•Ë$œchWØš+wÙ½4lØ'T-g¦ð7DiZ© )oFÓ~¹þ9>Ô˜š‹çE¦üùIg­g>@-*XK˱¢w1éŒïz•˜—i»tÅy‡&9ƒ«?­/¼}¡j•òLúxÿ«)ÖÏΙS‰oþaœæ)ý]<)à’jrªœÌ­´ˆç;„Ÿ—gÚù§†!AÊæfš (×­Ð<òïñùó˯©+G ‘?,ʃ ÌÕŒ%°ÁcšÕi( áÕñy™!, qÑ—^Aå÷ú£ú‡ÉÃÝS®ÙÀõÜ*H¨I«Óu<sLuÛX‡IøWkYéÚ…€ÄhxŽô¹ÚÜ-d{ <é¸U²’~$Í£íÃÚ¸8ðv¹F Z Díû[‘bJÔPòüÍ4㨂h¾œpô#uN.î°¡kÈç—´cC$?#ÞÀªw~=~³5TĶRuó qÀ´¨!pÇøÀÖŽ½=Ûß ÉfWÎ3s—ÃÞí™j£}ùìÀ§wPGv£ûZCºÆ ùÇcpÑ$ÁĽ_<ÈþÒßÇ Ñâ3u(ZŽ)~ à‚îöÿ{óO¬Åó¼îá^²M€ÝI8Kæ/5É–”æ9¯ªI’®¼#aL¡Sfi.5Û,ø5"ö^ßÞ¢ùÖ¨WÛž´‚õUvqÑÈ;½o|i;áÒ,aËuž,O‘$C¶¤-3â¦Ø/”€cà×TVÐ1bÂæý“»ÆQ'ÖC2ƒ£aQ8Ÿ;V%‚-Áfù‰_èÞÊ2df”;á{ëF÷Ø—ÎLœTY(Ý|ñ¬hz|uó4š.—wŒß+ÁvóÒï=‰V2Fún±û)—/Q¢ê"–8¦]{¼½«+6ߊìù×…Œë o⋘EoW¯êœ í„H²ÄŸb2(ªÈÀ³†€d>—Ëkˆõ2ë §JÒ8Êû{0¦åïUMÊxIn1uw[~©ïêÄÇÁÿgcšø;vw¢í—0€Âä˜î³ÇU‘Ö¾ª]§#@¼{4=æ!dŹjÖV.Ù</Àü±m‘ œ6êT¾N!0€Ob †Q¨¹ôPÎL ‘\þŠN†¸` pžÍ¥Pç‘‘)-Å×›K>!2Lðÿ0¸d“8]ºWFüçòûÈÏ•0Ï'¯“s¨¹¢3€òÆØºÿ œöa6c¶‡ÌŸgœãgÔ¢!Tƒ!whöBZƒÕßQE·-V‹ Í÷¦¬QBö˜pN¯Q®°ð&É×ùìá÷Ÿ X»î˜Î$àÛPþ|å˜[¼á ùÅÿÕRsÝÍè!EW¿pþŸ8µkÜl8fJ|üÊ  Y«Í;ãÍžAϳ{|ÿœ?ˆ'Â[›ÖåÕá$¸sõÉkEÇÜÅÝqó"Ú*¼ eܑǸ `ô1Ög´¨Ä2XéêDV”™wœ¥„˜ŠRþH8v.¯»k4§›¾n¤(*« 6ÜçSj…KkÉù¡±¥.8Ñ?KÉÈÎÀ¼–_,%d]Õ6Cð½üºGûŠxÞ9 h„KBÁÂ'é ""óÿuSQI(F»ëàm¸J=o/A%4ÂF^ÚªÁ¤fɬd ¥{ú­Ë†k#ë/Uõ?Ÿ1w“1ŽÎ€ÜRq_6õ¼ÿn¿åŒTâË20>äÒ$ò¬àh'ól¼Dˆˆ)¤°~šBÿµ{•âtÃúí%Ók}¬%v^ðùÍ3Á2nÎè?pv1/çy%phÞ!ùg“gÂaÂîx°<`™®þv60ñ}­ßë9 s²´—ÜÂ%Ø;Î?c©‚"‡vjß3ðÉò©¼ä»kÅ\O0’ÔY1fQ:;òÒhOô@ ϨTUÁ\ùðh1ª8Í ˆ¼ÊuñôZ/~t&# lápš9òÞ/ÉÞ pï$ZÁÑ´‹V·ãú†¶ÙGqV¼`.cQçö" kàuO‚µÍÉKv]4Y´míJú¨&ÆB{Jm¨èýiu$Jh~p½»dîW"ELjeNÖ ZJO4Ë(:‘îÜ99f-c.ZÈË} É›ÕB$¹1XÊ\ú¹Nµ…ºv¶Òäyßq'$"ûÃ!~É9º2mgqPaœ ÕÙÆš'ÄFdL½þGÝ`– ³–hiúºôúëkLå.ßµgÂzSs”ÙRù|(¬Ìà¤;9Žx‰Y õüþ0eLŒ?ržH¨êÃðmm'8€ár‹˜ÀÔ’'¢U¡P³L‚+æ’yPf)csüIw¸@²‹JlDzE oÕâÿ™ÀÉém²´³ä3¨øÏWµD‡œV3¬¹gZTŠ9ë¬(76(‹7T‹fôë×ñ÷‹ß˜,qìåÎ¥°¯í‚›ü'¾°`ÀòÅóht gÏ~tÂn¨ukU¾š-œëÉgZêoÍô xó¨­9 õËÿaðùñ€Þ»$°çÍèµ`{&úK“á.9ãü%¿~ …><Fê$}Yx@xaVt2¬%Bvàe¤sqº÷o9‰ˆÐTU’L÷¨ mÕ(\ØÀ3fQÎØñvïÊÝTè† ±P[ÅCièÎj$–êRSré߸IÞð³Í2G¿óLª!™øËôGã¤OÈl­D«üS­‚¹ ]á;‹+¬Þµ›:º®4Œ‘F PUQ•¦ X£Ûh^ÉPu²ª¯d9JÌ,ØúƒïÖ|…(O3¥LLÓÆcí’/çàÏì” ~8ÉbÅÁ¼’Ss©íÿô»ùÒ¹Ä?fä`¦E°RµÕz±‰³gQÅ»zõ–æ¶O÷^ ÂuIkfÞgÇ<Ë9gSDeÍcceâ& d£!“ ³ø›«•Ép ãWí»†cnŠ«²m¦›Ž1@Ü")²»ÍÞïù·‰&&ÖMD¼,oÔ{Rß`,C"”i+ý ¤à”²ÏÜ›Ö%=\ˆèï*2ê9;L®î½ó.øÁ )‰øÚM}0‹YhåT°™µC$½wº¤íŽœ™--úàoT9;Ù702stz?ÕjŸX¦ÊÌyÂþ=Íxø<µgÝH¨©Í|[ˆeúè.€ÛçeÑÅfê¸Ê„6ýÃ!2êè¿ÜEÃ*å‰ 4f×Ðãïбü¯Í£·QÓ®È)ÝAÈ/FžÑ†ÔRËöž‚ ,Öèq{ûA|&¹? ¦¿½þÜa¢íú¢VÅD=¥”-Ÿ°ŽŽ(X<Ÿ–™¦°i»|DòZ¹N\*;hWŸ[±W…ÙI ó"†¾V4tþ£Dæ?)7Ìë4ó 4þJ§9²ãÚ^ ¯wÛ;ÎÉÑ;4Ñ“‹ÜMûJ›Œ‹/ÊTƒ&Þ:x²åuOŠ‹Ylu8ªC—Y¡^%uFÝ…Q±¾Ádº—~µÚ ”þ‚ÈééÑ)’7ˆ¾›dWbɤg7å"ΪïŸ~€ÕjBôÔÌ’ÿQ,”2îÇw™&M#ï}ê7 '÷5ÜKú‰{ã*üé_†’¿ÈÝh–ìÜxþ~˯¾öCÐÕ¶Ž6È$ë|/`e#¤&ì •G=ÉPüï»JÂ¥9£„Ð>t^Y]š€öK²Ûvˆ„nd¸dGQß1Bû O¶Á£IiéíÊ-‰Z‹[£kKÝÄ~] ‘?}Ò¯;Ÿ»–Ú¦08àhõwibE  µ_Ë×8Î@ò~R¨zLëjÓ÷\~Y}‚£dÚjzzÿ”Ç-Í\ œ RØîûùÖt u¼U¸#Øh£ËhZ¤µWˆ«ëfkÜÚ_ôd³…c]n´ôTm"¾©ÈiüØyz±âgugoíëƒÐª¥þ³€ÏV+Ƴĩ½rÆvå-¬^õ¯RðÐX_¢ZEôxÓUà<зõG Œf Ÿ{Ì 2Èž:æï'.ªöŠ%QŠªmù¿xj0v•(ìz¸KœqîÍÞœ[æq˜`hG¨XbJøA'"xÓAïê±óyƒÇË¢¦1Š(ûƒk£Rt¢èÒÂïdmx/¸ËÍA*äL(2#›¸â ¹»c8¨všUJ<9ä·[}Ñ9Ž#Ež…@Q?9øãã7{w¾E6ï(èÂä,ù¦k§J•ëù˜"]Û> þRYåÂÏ7 î%¬QŒ dˆ×w+û“ë4†(ÿZ…×äCi0“!Ž5MÔµãHµÿìïFñø8}Øy?âÅõpžç¦¨ýTnæ–áx2%s+Ý»* xMã®5c)ÿ‡êÍÛIÕï£#F æîÕŽüŸrÎ}ýr猡ºÙ}ûKwGqx tÞ]*ùsu¨8‰#|A¨7óÐ`im²Gm½2Ëp_/;Ú³Äitàì_Èto4ÐñÏjm‡smÚkbvŽp‚y2šºÌ›M…½™^Fx’&Ñ“¦ú—ôˆ¤oŒÝÔTP Q—.u#*qÞ܃¸É•[ºr ç–ÃÒ¼{–‚7©ÖÒØÅç:°ô)•Åt|× åTÝè#‘ N&jßaÄ´KO1ºrô„åÏ’Dp±<û LFé,É@ÅcÖŠ:ê`ÌøÑ”Ù “úÈé«çÚP.ml6¢Ù!‡|¯øAMÀ{‰ïgw:à—Û {ñÃþ4¢g…ípÓº¿‹P¾5ƒ+>hàaxòÙ²Œáb6¹Ü3Mè»=ÓU‹¼2·¡4å(V9w=‰—ˆÙsS¶õZ†ó1v±çÀýºâ²W'+Ve* Ì*è}mË[…ãUø/\bñ›w4âEµµø«4±˜ŠyiÉì2jù¯<ˆÒÊ«õS½âÄý|¥ lÞêJi¢øM6²Ü²%Fr|»¸î:âóåk¼ËʳÄç‡Bã ½k·Á¯´+g;žØËàø§kôûÖõ8>Á¤¸°m­>‘UÇBþf¬ì°Y˜67ö¤¿ßT+ÆÚøŽoËàÈŠdåÂò¯uçÆ‘ We(Nxx–],þ}…z“ë6no{ 2îR9cJ˜XfZi˜ùBkaó t׺†ŠOç% áäóùÎþ¢O0ù„ÓÖ.þýtl®Z!O¦F³}é=ê¨Ü½ò8èσJ~áho[ž_ð©±C?3¾Ì²õQõ*©sqÍKëe¤3i·xÌ<Ã’QÊ’»O•IEß-ÓìPJàú—ñ{›—±JªGT¡uZ¾3`œd„[•h Gß}€ñQá0ÇEáo"«š>ØŽŒ í€ l“;ø"«ÓXõ«y`Ù aÑ¤ÞØ°GánRßžìˆ VîÑ”«¦…ÖÿÊéðxFD™J¶•m¶ŒP,ºó»j#È-!LíTg’Q|`¶×;̓ۄ 5íSuš1«-ëÓ¹‘ܽôâv ºÛØ\KÄ>í·dÒ7 gÔ^ÀPüvþ‹\Xø²•çŒUR“_ bÅ:ÅkC„y´‹»Lµ„CfÌ…ù`‚÷h×ÔÎ0ÙÒVY°_§K¤›È6œ/¼M¶´ 4ô8–ÿå{Bù NXwx¸ZK•a° aü×#âÛ·ƒ U$Þ í$P ÓgŒrs 4­:‚ø,àÓÃFçb'JÁ@ÿB¬?Úî+†ÅF÷©UÈ€Oœª-:í ,»”M·Öð4ÀCÄLþO›x)¨ÜûŸŠµŠj4FÏó¥)¢¤(;æ<7~^ìzv*ͳ`h©æÝ[¦€7õ‚å0†ÑÓ÷?á iæì*Œ%‹Xz‘qWÊÍÊ/CÚ'“84’8mÁ£Ýg,ã繚%ñ­ã ÜibF̘y¼?Œ“Ö%h\öV€$Ôë:onS˜ÐAºâ‡P‹KŽäÏášÁzÒÄŠÓ9¿‰@âЬÕ˾Á˜¯Z&›vjsAöÑ[óNÑ,‚ÌL×üZÊÊáLÑt¢[%ukÜ¥–}ÛQÖcxÒöpî Ø¨þKï;½l%Ià5J{ëû¨‚JÁßÌœ—Ê]WÍ%ìB,M‘©¼£Ï{ANAtdÏmóªÓPÜ(#c}@Õ Î«eêcƒûÌË ÅýÎ7ŸúXƒóš’ 6¬°'8Ù„kØ‚—\wLDÝ&NAtrö‡4>2ÓR7éÁ3 …o;?ÃBé‡ûÒÖ÷£‰ÓO¡j °û¼e±Zv‹à±O\xì¾Á=̲:ò?Ù\®Äêð?5Ï”¤¹³ñxHÇBg=E©7ç< ýièÜì‚®!_R—ô‰«eö¶….{Kcª*:ð0ìž°(KæI<Œ‘tÎ ’eF¯%ÅÚ·…º}•ë!Ê£ròæ,%O° "\ñ+^½{e“ø2Ðͳ§áÌ# ìì¯WÙºØúH¾GûÌg~%>?ß2&ñ7Ñ®sA^nqÈJ‰p´>£˜©[®]ù|~?Zzò£À‰óÿÔ,CCzÞöw\t`±ŒxóÍ Öüæó.èdOË„»Yž-9ŽâÒí«=ÈjjµJim¨žª]ê…÷èK×?q¿ÍÛ†­4Í߉A²<¢I¼·Â¶‡ÒFg©Ö.ƒ…ÇK œñ"¥s;q0¥o^)eË BYZÙ0U‡—ÞÔFó~׸0 € Óû}å‹Ï¦¤ùÀ—¢ aC@ËR²R8Á!  ì¡‡¢Itg K%Ul:´ÓmŒ¤úºÏú”è# ]sg-aÀËEö¬ý–›-GsñØvßMØnø:œ¦˜:}¤0Þ³EDêNYº[—ìÐ{f¶ð‡Œ’G§LfUí<7dNVu4[ö¼+âÁ£Â'·v8Yƒ«ìô^üΛPhÔ]ÿ«~†Ø`4¨ñCÂ`Ð"þÎDåiWíÆvJXsÁŸã*áa¼@I—#ø²÷Ô"Èz)tRºÆj°÷¦/@I¥l¤$ýL¼òãMLcL‰RbÆd¡PÖÖ”KìçG"¬'“ûÇê—\¸™S”fx$çü¶¡Éž ®IÓ“–Du֨زqQ/‚ð5²F‹Äª>%¬Ö@a9† }„ãÅe•é_6T¯Î‡@ X ‹”¡Øì¢‹n’YÁ}P³‡u ¡ý»÷ËãÎ[ݧ±êé®îpż’ÔF´ý‰ËȨb×öŒÁñ´½[9ž´±Ob=Ôö¹:2À,©•B6£Ñhe(;¿$Í0ÓŠcsçܵò’‰ü‰C’q Sº<ŽÔ¨ÙªÎ8›1°>?sÌ?ÜŽý_k=Ÿ¿Ð¡8O2Á|9ÛÀ9çhóÚÊ(†it¹4ߟ¢ÎÍò`}bSÞÚp‘èG(¤¹jº¬ HÀ• ™À·~`cZNzìq2¯‰˜mðÙGÿæõˆ+A„ÔTЧO¾]úM¬i¶#Bnnç5_Ò-ñ«7S÷³+½-~orCÞ™ÖBJœ©¬îÒe€–++Þ´&Ã]KŒÅ£×ä‰G@u <¸D¨öœsq~]óFú WîA´Y{þéH2Tå,åŸÙ«®;¨^»e}}» «MÏ€Û´ÉS«ºòV]DEI`›Ð_twìÚaÅ6 «¯À@½¥º±˜&΢»ùQ[£ Óˆ¬ý—åUö’= 樌è¹éKajya6N"Ã#gVh‡xf´Ã'.†P¿¡—Jä ¯ñþB–]1èXú$ê’@˜@µK'–“¿×™Î û†¨}0MÞK”¼lЇmYã?€e¯º!Ìý¤-lwÁ'Ü™Ú:¦RÜ‘¨ ¼fm–=Eš’^óê ”¶Öj¨Ë‚©®Ÿ¶Þ‚òá Dc‰cøâ|jžfºíxYtßôo2?Rº__*Ú|°bS-/”FeH}4µ6Œ SEêRfiD ;ñ¥ËS¾¥‘t=—Öð·mÂõº}ýÖ¬×Ò}K•aW®Pß¡úËÐzáZŽf—±0ï}µæø'ã(B]T¸Wʱ“ûI ÖN¢6ý­n¶"É%üD‰x¾cDšèÄŸDX‘÷EIÀp<¹Ü|¸eF­p{80wd3z,æ¶ýà ˆnfÐÎêÞOãç¿©Q޵ŸÛJn.ySî(ðÄÇAy}GlÜÈÌÞ½<1QU[ÇÆ_]¶ð<0Y…†ˆ§j&ÍU>Y™ÑdM¯e,MtÆ!‰Üv$Ðh˜\º¢P–S"A„ìZ®à¡ôã.#—)m¥˜˜ÖV'Ud‚«ÝèÞ“TR®dBþp%wƒ“3g~'{Ú$mÔ;/m5Pk~]‹q"­‡3£¸:PóØnÙ‡¥h¦BîÞë6¼Q‚gøëY» Zš_”p‰eQÀ§ûå”—5= ÖÜXY٠Ű ¼„€÷¢lãÚc•;pô¼Û×Ï#Ir7þ€»¤ªônÏŒ8êIßid+Õ_©HW®lqâ¿8z3›r1£¸}Ó•HSñ!šbV\âÓvâ  s \7™]¦HŠðN 3éU4ø}o ¶@í4“JÉå®K¡TT·3ð±üàïn]YÃGìÐ|yƒ/e=m?Ì”ëöŽUB¹”Ç5;aD†³sòR.ê¸á1)HiaÂ`]·œAàð&àcÊ2fÿÓä³§€QhŠóµîÁÇ2SÀEAvHBNIðƒ8w&U¢CvóÍùS,Ô_Bá¢Ù›À‹(«@níî@ÌHUÃÙçoÍÈ¥ï³'\á½óH!ÞÊ;\Øyܤ]ïH*1â&ÇÈ¬ÎØ¯jüÜ"é)£Å=;÷ò0ç€9$ÂÕ(YÎÌ>QJÆ“âæ{4ÇðNTý:…?|e=7€éý™Ï· Æò”Ó·ödÀê/z€MCbO¤ò¶`"¤RØŠ52õŽbÆ2CÆåuÌæ ñ%å°: (žÝ@VîÆ <¢ØŒ‹ÏÙó©rõ|*gÜoí´„üú8ÓdCqvh¨ÿjE‡ì­7ï{…6=F’ÔHjôæå‰€T£ŸñÈšàÚÖÆî€ãó4õÏç ýëõÚûœV±Â¶—3¸¶A1e—±õ?L/^yˆí¢ èò]/!ÚÃ? u!’BYÎ(üS§Jb`«îØÈ6qcÊÓÇŽ(ZÁvYÁÌ@£2±c¯€ëãôµÚ\¿…ÎöF\²K%û¾µ§ð6{\3<` ©;4¿§ 1ˆ(¹t|¼î\D.æÓëßd'5x»…¢äÎç ™ø5’¯ƒV|,¥Ã(®áÛÖÛR…y¼çl3] þj MŠúƒŽ àÑ”+¿÷L5ä'xÍ€±;'6®Æ<Í—¡Ov&ëªÆã‘H(ê}´_BoÝœ8$í†rýVsqDÅÖEV·ISMÔ \r k;Î0TÂãìÃØ|Ë&è8†<¤t¬nW¼k3ƒ7$)&;²_)7íoŠ;N¹h¥i.Llúâ觬՜¹ÜSE–äÅê#¹?ÿ;9$ÁÓ\ð”4]IÈŸ‹˜Ô‹K»Xâ3Ó§ÿÁ.€lÈöN<,ënq…Ôdêè:nÅSõ-‰¬:pð^é”á: “E]‰ÎFÎØ˜Ï5Z;xÊObÇlÇy IIL‚œü»B飱c&ø1Ïápí{NÒáBºÖ¸ÀD©þƒÃÖnº*òˆdâ¹Ø'‡r¾jZ'’ÀßÌs[™ž<ØuX0ÇQù3}ìraŸ*Ý)XU@ ‹5õ¶Ì¼{wuZj•×åU} ví<]úG-”ÞмÜJù”[Nf_…àÐ"ÊÕ ™Ÿ‘º)5þ·¶ÍÈFúVÅáòÁ>««ÍæV”áÕžµ÷ÑÞ¼Kâ+S+”®±½æÐwì+Ë· ›-)dÀ¬8{ÛM¡ÓÞ}º±00KZ’ÚÉ«J&]å®7i %W¶mß=›QîZðMíÀ[´kè}ôŸMîP…°°Ïh˜ÿÔñ#Vbi¼…5Ï ðj°îà;[¤’?t‰f«VÓ‘ílQbÎÊSÞ,8:ïL’QH[ê$J¶óßÐfäοJõ±§„A·hÂÙèY#Ž1Æ?¯ë ¦¡SŽêgÒrÉxûJt„‘tô“ìªÃó’ì;Õ.€‰†Ç9åœÎšRìÝAŠs ®¦å¡Sqú™x+ÿf&mWå®wìåË;!eêÌ,H8¿—je‰ (4ßí­OõEàÆÒˆUäÑ{'ØÍ¥Ù4E·Š:,±9ŽâÖ­”p¾EÃâ|©0 ÀIBSœ‰Y°çÚ – láuÉ´F­¢Wø o3£¹„Ô>ÅubÐb X5­ä4§PøíÕ”::Îg x•哸ÍN>%t H„[ªÉ̹€!3bR4öîl…Ò»Ûri_5f•ÿ4è%(îG›‚}š©öß×¾âÖôbeÒ×KžY©guŸXœ?÷6)½¢´ ⊅Íþ,X§O°f¡RQ+[ m¡ìư(îñ!‹¹š™}jR”R_^|zqdÖ²HgV˜J#_ "#àƒï÷s.žÍO;,”F1@Ö+¦Ý}„çô¦-ã2ïñj8–ýzC€7 «v– ¹ûÆBPMï÷B®éHÀà%þð‡˜°xâFÕbŒQ²„§“’³³z]í"yüõ4ÏdŸãºÐºS…0ý Mä>3¥K8ÿ–×2‰¢¨‘ÍSíÚ`d³‚(ˆ¯?!š.cò€* ¿¼‹Û„ñbâßX—êŒÒ ½×ÊF–n_eéî»qï1 n!Uwo¼ÂêÊècšˆ $ùrl¼|d®$>™?¶åA\¦WcÕáÐÊÄÝ–5ÉC/7 ÈŒó§pÂ͇—ñzìte)+Çiò„è©Jç߸ø¨=Ô°k@ŸÊ—©‘“Ld"¤¦ÈkIyµêà³~”D 4;\’úÆ;.-7“Ì^9h:GœØ.ÀK¬÷‹g‚^ù€œÃðe@«-G¡ë&Z”jt7¬—A}«´xi»"æ× ¯i}±cœTDr@BÓÃÓ,)íœyäš>™=£¿:¢,çt- ™S7Ú!Ñy(:œnc#äú?J/_‹¶&•YÔœŠÞtàÚê® ” ¯eKoÛã$Ÿ¯‡"öÑ÷Æþ¡ìH¿Õoâ«8dx꤀™ÂcÎbM5€g ƒd”çŸJ¬é>ݳÿz[+ši·Í•Ç.kÀ4Þ¶„nÚpb„w]‚Cb*°î«„³—‰Äòè°méURQóõ¬ézÂú­³/ˆ;”Ÿ]‹¶%5YL*åûï1:ád¾’ôª´BŽ3T<ù­L%Ü(,zl[ú܉ñÎ$‰ìiUr–^p¿w”ªpzóò^“5@Dì’MŸEI–Û;Ý«šFVÿœtôN°Ç,&…åN¤Èjƒ™U¯ ÕßV•éAÉñNÇèàRèA4‰= ú` âÓK¬±^TŒ‰_Æ•½¥ðKiš•ˆ ç5äkÖQãâ W\Šü[nÛ>‘qNÀ»å­Úò¨ÙS‚h¢G¢.^™Èui‡v¾ç@øá¬Z1R >¨C§¬òãJíP¡]·GýN¨ w䕹#¸™jÐ*eÜ òqbˆSýµÿÇ$™4ˆ‰K2W3·Ù%éÈ¿û-†òTã¡p°²eb 3+;ÀwI$¾»U¨Ì4Ž~N2hj;+4È&mlW—Eµ_ƒ•rÕ ³¶ ƒÏ-‰Ð.ÄX—Ãþ«k- ÏkÞ@¿ ±q^Ëz~w-ëå&ËYö?ÝùÉÖšgnÁº2VçJn´wé市œYì°ôѺéÐòßWž^8‰/}™x^SFŒ+”ÛçlAÕéÛ$É‹ZéâPízÕx^IB yF¸…úr9„5‘}_ºãí W²±–0z‹Ž›”é5%.©6¥ùâ§ù ºÈC]y\i¯¼Ã£å—Œ2\­õÁ%o—_ô+…¢D`p’@%†Ôò™µ'{t9Ç Æ¶°*0IÂ%Û…]ØÊ8 ´øýeCŒf©Öor6CE h«ÑX ÂQëŽy;©¤èKy$œ¶ë# íßUò¥O“ Ø+úóF‘ݘmiïN’Düú‹®8}C—U+\ÍËr2# ƒG9™÷\91ñßÔ2߉\Ðå÷ë¸Hþ‹‰þ"Žö}o 3Ìs”®Ó+8s>©Æw°Ì«1– DÁ¬DBY›UB^pÔöfƒü+˜K¡2·½—ݹÈag™ZÖ7ÕŽ¹1õZ3àcµEw`§¢)8[EÀ\Ó`Úááó÷#&†Ê#ˆ7UyC¹nQHì2l*ÀZ½áy‡Ä›Ðz¹þ‡¾3a…KTïÝr®!¢JXóÇÓ‰`, T´É³*oGŒÜŒÁ†ðwÕ’…–é¤Úkå›bPâXÜÚ-ØvÃ2ürÏV¢\Œå朥„Ò(5ãXÉ!×ñdüÂ4B–ÇUaž÷³¾‰ëD¬0?*ó5œýѤr4€q1[×l:I ûJ4Ò8 ÍrÒJ-\¡¹ÕÖ¤»$^Ø&Yký£è§÷ß›¼h:çöþ°ªÔè,ýE/'\Ã'X… ìÍБ6 ³ÆÇ©êGu±Q¢ }4žp¸—íºêÐ5Œ hG^þ‰A"%0ÏçÀ*5°¼jÐHã ÔÎ\eÔ‰¾Gx¿ÛXÁ•%f´€ÐbÂxË]Y9Ú *šóÏ%‹)eJɘ–® sÀ€èÔw3¸nh»ßMQºEêc A¤[uÛja™BCÍ™~½ ¿rq]"ò‘1Ÿ…_$Z…ApQÐs‚ aY+Ên©&+4|ÙÒxV.…8n6ýbÏE]Úd—þuvÜEWë<—·ÔàÞ‹5j4Èû¢ðÁBItÉkk#âpŠ|/úØP¾;:ü#<Ð?»?‡*}¢hmÜrzJg‚N ƒÖ–ZFŸ²ûƒÕ£8Aä"o¡[ï‹’¬ÓU”Éw÷Å4ÑæhzB`;¤û'ò¯Ü³`/TGP¡ï¾aCàPM´H}¿WÀ0˜ Pñ3ÿ'Øaê`7§omê'¤ RðÍÇ2¢`W1‡ãsOØ0n¼?”Q]¸“äúùØÚä°§¼ef©r–\žÎöEMD9`ehL* O_‹+›·?Ï_tiÑâS9šúú“ë}vAšˆ `c%¾ÌmЊÇ%Ïãò¼,–µ/Èå&ïFÂÒ¦`Xè6¾Ìê„V^Nü§‘µ°}Ç,×òEÒÚ£=~ΛX­Ù¦Qœ ³s¦g CæE /»ª‚Ū¤²3;4ÝñQ0/Îõº±G¤ÖfÚKÊFm< O!¨G¢bÔ±£D€È—M?m)‡0`˜蜽߷÷ņü¦G@GDEád%–õ¸LÁu­ò&9F" ïi1 %D¹LŸÇó™¹D³BÉÐÉÒ×GÈAŽÅF¸âƒRa€«Ê.¹>uzÐ%òMÆ›‘‚¶½@-¨Âé¢9\Ñ÷EK² åi:óÈKí5†ü-ÿ=áþ̲˜˜ãDRµ•šÒ±Gc‚@@…B–ž×tóiWšCO®„šóË~rx¬ð(ÉVy™açfÁ|"‚1Êõ‚JR›dÕ6nNJn’Í!ïjê[XJ©È+Ùa¾O§·µa´zù©cØ››5ÇóoKH¸6oÜüŵC´€Ì‘Bxg륣öWÄN€º”1ú#û5!]`yƒ@R*ŸÈ' AÖà}D¸RÃ:2è8¢ Ðs+E]õ®æïÈþ÷‘õÃÜyù#&.!m/’Ííèúè<2Ëå$D¨QÑ"¾Ö+i’ÀvŽ{køšˆ"y—§q[ ~sF=u𵉑*Vƒ§á·‹h ;lè~8}›4lNTùÇ D»zš9hú'®Lfº¤Æ¡ *£Lÿ+=;Õ>«×ÄY°FïˆeÝD5›”™Cnœ§YÍÍw%ëšóéxlâêüÏ#*"ô’/ÁáQ)ú_ÛÖ½?tyùÈ¡+"ÙÏÆ}·XÙÈË8ç2›KšÆ¤4„ºäã&jq‰ÎŽÙ¢¥ŒR¯‡lõ˜:Ý9>Âë0ª»*ª‘_ç(ì&•™bÈБB mMïõñ‹Ôz‡ŒàžEúÇzû‡ Æ”×7Oò¢Ÿ|'˜ÌÆ}Šˆ'ÊÊMÅô0! ­dP¶s§[^Ñm'‰[, –föuùßh&1ÞÇDø”³¥ùçg¦ÄŸ«Ï»ÈÏÕWþËkÀÕDÁvîƒ wèã„×ÜÜ@K®Kb’†Ûˆ³L‡G5Ý›þÞZ†°[9‹°iâ{JNßITK ‚M3<½{ù½eo¿&¸*ƒÆÓ#çG ËÙ2¤R‘Ô)Y]p[š€{\P¦ðJšè*¶¹CdJIºé¿£¦°ç˜ x’]ÄÚݧòåÙj xï­- ©Ü4xmËïÓ­—5ßA@‰ÉAÁi·¿:ïˆ-‘$aÄR¢%UdZl¶i8U…n’;&'­²Jêײ…~³vÙº~^óK—[.,-÷H_ :4ùB*dB€Ö¯1£zv-\ç‘èqIHÂüµŸ‘'q%¾!ˆsU¬™®j¢ÎÍGf€ìu†È‚XªÍyI;ÏÒTöGi’äO±fƒ©å‡Ýf¶¹ð]íݲ€™îÿ’ð‹•|^ó<ÞJBÎÓçE~3ü /Ç=ŽHI-†Géœvjg: L|úÁzÒ#ã²sóAºS­®Pä^•Ú‰«Ûé`Ex%ûÖŠ³¨HŽ(cäcÇI@väÙ{wtÌ..ȯl€=¯™\Ó ä×8ügÓåð<\µ¢©°ßLfY׉–«µßT„ij C2gû_ƒdœdU-úcª/¦ëE/ß©9L¬ÃÏo!*:ô†0Ã_ïDšŠ&UB§w æÍ3 -÷öÆóq5ÇØ’ÖðÜÂ’¡†ËwEQŽ/6±X…  ÕƒùKðãëgˆ¶µ½¡çÚt-õÊiÝN‡bÖ)>)S§£æâ-öy¸RQåÙ·ë²RûÐ3Í?ø¼¤ËJwô„ªÉ–# Š’»Ÿ. ø—HŸ”ünù, jž¥a4yÝmŠIœ†+Ä??f–ÍÞ¯4è„•½|íHÒ­NìÛxÉ: U+_éY&÷-¬•ñtí_ÆNø$¯4#ˆÐ &° -çq ùI`𽕣ÍÜnš× ˜A½ö"ì4›Ùž%ñ#Éüšo÷æÏYå Ðû‚µòëð2—Ý1´°0¬ Œ”óeÌΖ‚ó’%Ò3†g…y¡˜=Ž£ƒÄa"z CKì9?òÏN…ù$ú@ÃÌ‘:àû<êËÒvä¯:a_A*Ô©4Q>ü­òÂ\óQ©vNŠxÍëÙ(Úó_†~Ë?(ÜÅ´èöf.éçÔÛºÖcÄ/ߨOöf çîo 3+¢Óg`ž¬ëåñOü½Z¼ æ¬@½(±“®‹q0ÐÕç?ÒÃxà˜:£€¹‡ª›–®•Ê£¤ ”çL­GS¼¾B/;hÀÆf"‡EåMƒÅv±‡¼Åx€p›NICjžëˆéKÀ=«øYaZÒ‰ksØ@LãË‚ž+#8æîK«a)Ãô,; ¹(€{üL³EÂŽˆ&ñ`? H$A»‡Ëùqû6<„}7'ßDzÞ’ßÍÆÔ,…Àô3—…?µ¥l±øQ¬ž8FUS+5y·*Ì"3y$”•)Û¾CP ŒÔ“Nˆip9µ¬uá¸þGNnZ2n—k±¨9UòPj¢Kòãÿ¾›™Oñ€@ÈÈþ¶è¬ˆF¶.5u—á!9ÕU«8FMH|$…1’\Fñe_›–¶ás=]ç$iÎKE¿­ù0‚àSB@û‡¨íÑúÚ¦ÝM‹Juñ‘p#âmÿ,Ç6•±]¼k+¯Ã°I`BÝÉæ†z`¡t:>¨óKq3´ðz¬TÁÊJÅã­6ó¿”™¨¹‡³}»P+]I÷•ÒÊ8€ÍØ`‰ƒL˜-˜°NÄá™>°zqöN9æl/Nc° ñ”'1/U,>˜ýÖNVe;ñ8 ä¿×»X :«*-_²ë¢É÷̘r–„[Mr-P†ŒDy %üä—~ýc°ZƒT1ÓjlRjšDw¢mÓ¼œÀRFŠ~ͪØm FC”p'7HºåÀ]5ñ‡ …ƒM5ÞoÍ‘]Ýà;Féƒ.7" Þ¶‰†T„Ê/ä=”^Îþ…â/Í„ÚIP'ëŸuÔ„„S§PxÀê6ƒÏ·Ä9}_Øòf =e ±!:lði(’G°È­£Ü¦…vákh²Pxa~‘õ\ßÄñÎïwQs~¦l¡ög47ÔöLò‹”ø¬å|)$ýÐÅd„ /´|}ŒÉÙo‚P gäÁ)±Õê¢Í9²sÃ$Q¢ë}ï~¸RíÚ÷0­íÀUÿý@Ù¬èÿ$ñ(N¥ÓsåÍ> ;Ÿg¢Æ÷”ZxÁZ~c£ev•Ÿ£5é$4ZÏ‚Sª¾† ͇ä‚ð˜ë¨Ðë|ŸÃ<ø£An¯‘_ú[DÎ+ËPtc-wðÝÉûçïBˆ Në‡ä«ÅÇì<ò¼[†·µi—üE; hÊ{_…t³¢õª–:åÐÉüþ—Á²nævÆê.+˜>Ú‹3~xTrñwÃ#Y[ÅS{ÿ‰óf(@K‹ 0i£ð!ðDJ©1³- î‘¢‹Ø›©[û¬¸ŸˆÒµÙß>èC¼èVƒ¦š‚jZM‘ù©ÎeùRy›_~¡õ:Õú ‘O¿îì$_rT¥Y[äü¡BÇÖðMVÇc ê%Ä›ìQÂ[¾(«Å9[¨ªú)r?‹PÕ¥p`ç…Î èúày-¾Ñš‹oþœßŽ4„¥æ†ÚÖñsü[ÌÔx@çúóšíbö曜Dç¯Ku1­¿Ï6§€‹Ní¥dd¼8l©!"üÌ-  7ÊWNºåD¨pNÕaÆ>HÓú®eS{?Þ0"ÿÕ7O H~éÈÜÿ m~r´]'Á ý“$¿¸Däa*&FŒ;8± „>±K/î°ìû…<+ÒvñÕë@õóé@§ÙÖÎJe6C*¿ÓÇÆ(E‚;÷Ñ^ÍÌ`±ýî3~¢È¡zw«´àëp<#†_[ù±múIbYl(éW,B*éΙß<>ØFŽ\q©|ALа5í†A=àO,Qœ>²Áo6‹Ô •{ÚÐYƒ*~ÛÉk¢cA)©¾œHz´{šWA#{˜· ‚û •zC÷u­æç)%o+QZªxF5Ãq1ôÍyEÿì6¤Ü¼” _®;ô+N‚6Ê’=—<æõÉ6fÝËw,~S¯1R[ åÏs½À|U`ÍËJ@ Æí—[2·¢î¥J˜<ÉtJ*üÌÐv$GwÁ‚Àm,¯n¾ÄKÈâèÆ7ÏóD‰l€ñùCt¯`Ü ˆÂßafÕw­É;^ýÞ×üÚ¸«L0Ÿêù1:¡æk’ñ•üâ&€ýÈ ;bÇððxŽ„q_Ps—6ˆ=¹£ƒã¼p»8z3u[8œÐ(ˆüÒTµ˜<Ã/“Êø¾£“ľ¤å×ï/‹_êï—†™´á$—à‚…ˆõ°^\½›W{ëé([jªdL‡Æ< F hê;úÁûî×q†¬ÉçmìÖ}Ô‡)™B ÙÜÑC¤¿š–G5«¸8´²½ÝÓŠ²¤Á–¦®d^Œn¦BWóÆb%_L¹=2I›ÚŠK-^bOcíeAq)Ýî8©Þ9˜ß©…<’5ŒÛÈíÚ²CïÒbó;r…×ãáQ »ݯ{¾ÚÌÁDëIëþ‰þä‡,¤4„‚Ñ‘¡6Ð($ÂYìÝv?D¦žgéú).óó,@{Û …Ælã‘÷Oák¸=³8m– ×fî"éünËZ¤ }ÇÅŸ‘]þó6úu\Àû±œ±KaZfÓ|U1IaÅò¼s_ÕjO¤‚GÛû6Äuø-‚o¤ PñŸuœ—[oðIÇÝ1ø « µÔüTSeùÓÐ.­yëëñîð>ý$*\ÿñìa¹Ä"²gçv^¤ˆ½'Éõ<Ä×JC kÆçÿ5ACviJ:™œX1× ëgv:ï¨`L÷þ«u9ùÞ–CGk›ë¼áèô>ÞК×Ú¡šŽx•¹h„žØ gr\^ÞÕ9#Œ”]2NÃC: WˆÑIhÍ©_)–ÙQ"A–4Ñ>³ÊÛ=¹&Uñ³…]œß* ‹€~ºõô"™ˆ¼ s Õ••ê°Bw½1RÆ’%0bN j±J—Q5A®òÍ#¡!é†ãïê±§4øa5‚ÿr&ØWH‡t“»Ïí—„Ðx€e„Çk¸a`£óýåÌ·¥Õ –ûjo£Ç’*A•5+F!ÓKKFNoè‰pA ;H$ØÊŒÚÂa3ðeìRϹN=ôD(/¾Á’îPëý›Ûõm ç":ûR†Ä;ázˆEp*ÝÌwÚ÷NÃW~ªK(¸2ÿàÌe+? A¾&Ò° ¯©iÒOiê¢ù±!§ñ±x?-ú¨ægÒŠr.ý܈ÔÎÖ¯”òüæÁ Ôo“CeÛ˜îýÄŸ©YYå¢ñ]m€ä> Ç"@-ýÀñ@мå³Cqé[S¥ˆPr+6›œî}%àÌúœ Û‰@ÒĂחR]·¦Â—Òæœ/ô4 ×_ÒxæÝ`Í0%šP1û~„™'ú5Ø%å2Nôèi.©ÒL³tÚ@MzZU­¤…OLòï¹½"H¬¢V·j»(°8ù%@Þ»^âGd1½*çø3$aÌ=â’«£®]¶,Dz¾Ópý7•2=Ä«îW¯Aœy vGkƒ œV¸—SŒ»QQ°XkN0#˜<é!*HŸµw{Î3¤ö•ÊßRYw|ãõ~*¦C'p‰¤±ôï–!ŒÞÁúüÍb†¥^sgîÓO>Ä‚}ço0ú'{ÒÍ·R„q&-S«RÁM¦¾r¾ªoÖÜl_r½B®"¸u•KAS±Wê_ë )² …nº¶y‘‡×X§«âÛŠvE!!³¡ÚI5ùÕ¤²î°dT %|°í ʽ³q‡NV¹²üÏJLÿrÊFt.¤š­p«\‡“MìHž„°zGzœ@[ôvMÁ´í!@qU®i*SòbPA™Lµpcü6B…”ÒA}ij­BW¦1¼ÿ“¾ï Ä\óßE†ù-šyÉQ†Û´ü—À^±ä–ìöÁ"ñ‚kllfuZŸ&½°†íkkŠUER£·#°ïiCáâ F»õÍ2¤š;¼7Ú… ½…·¦ã÷ˈ©½(ŽÁê¦un&••꿞5¾ÅÆû½¶Á ø²`‚Ħ §°›E9Vc&s«§Jøò,7´º¢ÅŒ/ž±Ú]G*ß2rYò_½dÌ‹¤E… ¨c½0˜© ˆv¤öë·Èh„nÙFÂ(²!¾4ŸTIÿò3WEøxâ …#º\&Ÿòz¦ !*ŸÌ´j× Ò—Ç9.T¿ù‡GAôÌ|©DÖŸMÿ‡ù=û„(›@aa\†ŽØ:AÜ=Êß·/²J§~íñýÐshÿ0J4 ›”È%²`IÜ®ŠuÃu ¬ÿ@š)ƒ!´Èi]¸•èz(®®Ë¬‹èÛ¹k>g Š>·Äà<[~ `tNâ=k™ôº[â­êú aʋƎD‘l\ašlÒéwÊT ÇÛüB|¨Î,©.Ü?õ-!ÍåÂ>`ƒ6èÏãÍ&*mE£¿Ð*Ú°ZZZï z¯n>˹yèÄ‹2ƒssºH£CÈ£p 6<4.ø²„êÌSN´®!cÂ4‘ž¹hÆÖÚÐSh½Ïc6÷‰Åˆ¶;ó^•5ûçêÃ@)ÝvT(?’yìÐB[k¾Âê“þ÷| ’È@Ñ|4Jà0éŸÖGùŽ#Ü${6Üo`sÊ+¤¦;€‰”›‘$eibóQÀ.wœ`Më\¤Ó­YÁUe£'³®l‡ ÒÒ…iá"íBzª3Óëùý÷¥È‘ãb“×~/XÑŽW`’pµZ]úd‰²WÔz—'#MOt1f¶YºÝ ‰ÚKËYA½€CD½œúlèð†·Kh‰L5‰\¨‰ý¾õ¢8 èT ¡!ŽŽžsõó蛬¿ù@ËÒ‚Jº—ë?È÷DŠÿ ÈnÇ:-Ù>B¯Á@‰96iÀ5™q Ü÷›a§®Â©´œéè‚Æˆ½½g‰Épªw'à_tiÙšÂî%<þ߆èãWyL*âü¦»ßyð³2Çí¿hÄñ9rúyÈHöaA$<å`õŸ’á”–%ÙŽ€’éíÛÔAé^Å,ø,Ê>ëøt*ñ½ò=R&Õš L… kd-yÎöá³Å~îyê@”åç5¾V [sºñhµ°½Õ‹ ×=EÖ©ïÅžÏY0Apv­$ÞÊ ·õ·¥!Vˆ è…~U6xçìô'‘—Ø‹ÞFUÇ´z÷¯rTD|3p×n_œ±\è(Pt¹‚é^ÕÏ_Yá%¦ù]#B«/ Ñï7Êóhsq+ן¶f§K¥1úºöpcPáÈe4»ÝÒžwÜ(ý àdNš#Îc~ù8ä¼x@)ô* ÿÿý%!2?~C·ÏQ«@±™à%¦¸kÕö'¾ÄEUGÉ‚C⡆ê•ï‚ÍÓì¸ÌA‹ÙĪ[ª7ñ£ 6ŠëÁ1Ê}ðwmG|9^ÕˆbÕ#ø·žÝH&EÆ;Lp­°@æ>æÏ„ŸÑËWø§Ó|mç>è/úàBd%(Ù†E±XYÛl¨™KF¢  ÝíÎ7^®±høÚ/̇ áQ"p¢~[R•³Ž­ã¯MÕñÍ|ì3>/-8yþ \™pÑÓ3kÒÐ@q¹’;€XÙð$'Zþ`úÇò%DÖׯ.“/Ù¦HùòõlÓ˜ëH+rø}ÇóS£3Wƒ˜Ø›tý½¥Lp±dìË6 þžKðh_4q°¢Íü”IÏè^ÅÃÏB˜m&nÒ¬N2q2ŠÞ#»ÁdønïùÁ·âk³â:ߺvÝÈÏÒü Œ´ ™£ýÜÖ‰»l±Q±”¹¿Â/¬yÓðo%——Èg¸%C‹9(‡0嘻g†›ßÛ_w"eÐÃ…mƒ]úh·®+¾zØ6™ÿKCÉXǺTIœþB×¾­ö2•õPœº%¸Ñ½­ö²…arºÐ§³mƒ'Dí@Wþeò³é(³…[ãÔq„·¤€ ó¾û172ij¯!åNø;½íœG^ä_SÇq5ê4l'ã’ˆÝN¬yC;R½à yºígxÕîÞЪ!•û…òr–¯ª¼[K®`¦ÉRì0@}é¡&• ìÁØs®‘N:*Ù¶R¥³r5i"G¶¨kî|a·ör×|tzð#ç@±Tµ’Ê/) b„p&åþ^N߸ÈoµFï„_€Úqèfߵ铪…òønJ$¤Ô#l¿yp´âú ^1¯Î‹<  ¼í¡7u3·žíYùÓî0ýõ¤ÛÉŠk™ÓlðºÓ‘-BÒŒ:|çp¢#Íð9U1{Ó’÷U„7.¬#Ó«¢T†$Ýð'P[p HñD\µA+·ÐYùޱ*O7ÊA>‡ TšÖ¥½È–Œ|¹´ØpÏÞ>N·ðÑQ†ÎU|d,²A‹fÂÒ=øjÇŽóLuÔ‘eÄHýo¤í=½ÙGˤº’S­pôñ?erÂ`c‰áµ†H‹ƒ¢°^¼um@ÒžÊ 0í±îK„#HW \;öäØã„JÄ…Ø8)æ9=£5²üïKÚšTÝ# ꦾ+±Z:’"`g—9q[…>ÅòGÔµ(þ!Ò1BîgO_…x š‹äñ@J{¿zB¤+¬ˆ ލ"Å6Ù±„›Hß)ðUµ’¤y‡ÕV;ÌÍzFûnÖ¡ˆóÈa>À>­†Å›8ÿ`º,´+”fp1 ílþ×/ícž Ðì+¶Dy‹Óÿ‹Ïc“þæ4&¨û„]µ…_Œ¨8 „±§mP€“Ú¥>Šœâ¦¬”e³ä;k_c}Mé¿Eçw±ÓSBlUÑþ’³Mü§ê^VðÏ £Ç›}srÏÑ$)vâÓLP+ÐÐ]¥-ޤnt/’èºÕ¶Iö°«gŒô*Ù«W1[r+`‹‡Ípgñ\jM¶iBÙÍPèûØ’9¦•¥˜>÷…Áú::ÖÆhúVYÛuœ0´ü0cÏQÙÑïò||ضî¿4à»áK·§SJ ö4§‚!s®Áy@¡wK,V!-x&ã¾mG²IÈ)—¾¯Q“ž&ÚP°eโhN‹…[z Xy÷«'|ÝÀÊ*8ä¼µqøN`¶pxýD|7?-Åw®áë;;w©ÿ§b†ÇGFFhOBSþ¥ênf2QcÊ0³uH!Á½ÞŶ0bd8ÑÕ^ËPiUS½)Å·(´÷H¨ú\ç#LýCΠ1p“Üh‚°î?ú4 3, wþ ˆ2×RɈ 9x"‚ÇI¹ŠÙø~Æ Hz¨@•{¿ñÐÒQô¬òÖºò‡®Ä-k6Z ¯O;§ê÷ ¦â×ÍN{ÿÞ±/Q¤AôhÑ"¨ òwDŠ 0ÐÄ.Àp·˜¬-‚zöàQL%²g俯ýÞ]ÿ)/©#Èu6A y²¢>+Á_Ä×]dƼї<´§·Ê«?Iáê=(¹<5'å-™¦ã¯Ÿ`b(Ë‘–iœ/œð}NÓI…Ç(±ê"w7Ý2·ŸzQÞûöäî4r;©1ù`”ÊÜIÀ’ÚàÓΫsÿü¬7=(ŒamDº~Kr[miW:¡f6«mÅ–qӂû õB!§)‚Ù7$Œ?*/r2æþüµÑ«AO#sšÿåéÛÒC‡ó·s¿ù¦!° ÞÐxªS9[æíÞòÏ5$q<¼`bD~ÕTIÎüþ{’sû­AõDvñuë+w ÿäþRGk, à£Ã†».L<*˜ÛGªÕ(Úõâ(n2Jmº¸£@?=&OýzsƒLWU6°ì¾T‰ê\²ò Q§uìR³~Fö{0µÓ÷—ej_SŸyQ]™Fj‚ÌWß@ÆNÇÇŠ¶¿ó?˜å|ðH‚OÕ“]îÞ{4\ÔßÎR°CƵ©<._·G'gò›b,FÄŠÃَˈåëøTDzÄÿß`Áa7 uO(t~ÈžIÞ”–>+ ׿Ñ<%¢,fû½±ZKèû¸ÚµÄO>i_wÌr¿å±…œÕ߯B¢#ô(‹Ð°¦EóNh±­ §á×U8̽0·¯_Ó¦ Á4±m&‰yQ¡ M­È¹“FÃÔ¹>ëéaqXÆS­O¹ž}´U Ðæ••ñÆó•×My³•È”¡ë„aù‘Í·n&e9©+ð˜Ûšt§jè ùþ”½ ‹»y$'MkOKR‘ú@Nú¢=L„c£Ä“¬-—vxmÂúݺ ”íõå8bÆïóï=ÓŸ:)#'™X\UílÔ¸‰®6 vnýyQîIc-ë…‹ô L²ûu&_ »[4‘Ú×)TïìÎzðÄ0x'\S ¬ÝÑ67a¾39…a”GD„IˆúÖÊpÚd|¢>/àÁèB˜;‚9‘¡È=DíþZFgaÉìkU5²DR‹ç6ÜÏM{Åûá)HųêÍ+¢½R½.ÄÃú»›šß&”Ô( ]I­¾è5ÈmQ™avÚQÔŠYIÒS¥r®¹w$×£xG¿À3eÛh¸ü3`º‹‚9îË„KH8˼&À•œbHÝiîꨓ¸ñIHôQxÐo >ÈtäÉ´J+E ëäɸ–µœày_@' ’jçÌÀÈ?Û+©r€ga: ®€ÿOÈík ,µ€Ø|䣒Ι̽eAXåÑ~J:/U Æî×lÍÆy…«uý¹Vß$.så3™†Ù†î/%ðpc¸}vÃzêÍ.s1·³µâ¾Ò鶸h=.ÈÉ9·ì@Rr«ÿüã“$Ùü×%Ó[Æ„‚G<Ú‡úÇÇ$sN /‚r C©ÑïlH³ñ+ˆ°¸¡Âµì£~ì]˜ W¬¼GR{[Ù÷’tïd>HèÉy,o’¬oÉŽÈ@IUŸ_ô|´Z!œÔBŸG"²G?Û)Ž…|›Ý¢÷\\~ʃ›ë©XEbtÂÎ#0ŽO¹ãå3XœŠ"‹vfµÈI/däÛ_$ <€@Ô62s6v9D·…¨I1ªð¹b0AvºÁé\O„0ºý˜Å,ˆûócÇÓexóó hÓÔÞj˜J0E³zŒ@':ynˆÒ°Qó½Yš3, 韠ý³5¥ùæ½éb0hWÕië?AÉWÈž;ñ—ßü™'B¤ Ðî¿Dù“†ªŠ?µiÆ£å œ¢7SÅÏó+ƒÙ× Z/i›Ó ›}B€3øð¬HÄæ ÛÞù³ˆÞ¼Ÿ:Õ±ì[Ô¯ƒ:t`¤dƒD:›þßó„4ǰ'Û6ºÿ "|m–‡ŽŒÄtiJ©“ æ{äýº"¹Ø_u`ß’Xþ?:R,Ë:ʽ,‘O'†aËPfqØ+¼òU™7۷ѰxÃ!Æï1bß²ùØ Ò„ì"FŸæI½!Ž% ß2½Ôò<=I›§X䌉WU¶E‘¥ñÃx ‚iÂûÎÖÎJ6¤¥R@ÕKæ 4²}Ù“;/i‰Ïýp]yêŠuJÎ:,˜†Ž rFÿV¯b³Hxe?GYß"½à¤àÅcÁ°{¯os´”7.a۾̹ޟÿ‰+S\ûÂiºûÁ§£ãŽ!U¬ nç}àSl5tæ.‹#h:oâq9×)ÙU…£ƒË7Bï‹{ú#6jüÐÚ  ób úçK 1J2\N¤gºl©üh (kÌQâ´­0–ýÐ?ž€÷¨aXš³ ÃBN ª"|–‹¼oïo3¢s'a"–îìܽoKl¯½Ù” )zÈÃàs>=£±j.þOÏñÔ¥§’'>Þ9ß+ŠmõÎFÀ¢)…Q‰RÅۅꌑÜ7š¾¤zè·C £qn"‘9Uäòvé4Þq¹&@€Íñ'©ßYÙ›òÇ£Z! ¥µVÜšj8ÌÉj•´o‰i¾[:'3©ë`§UnÅßS´eÑŒ­|XÖ!¥»ç—VbfTÍâ“yG¯~ÚéÇü\ÌÇî=¤s ˆiG Û3²ùõ<¹=7°-›¼#g ‰XÞËþµÄÓyQX”›žÌYPìTRœ\âä<Ü!Îú^ŽhxÂ;¡Wn){%g6¬-bÞñéb”^£Ø§¹‰:Và]¡ÐIR¾F U0 8Î¥Š¦ê~ÝÁAœL*6q >8¸FÈÄ=v Ï`´¿ZŠW.wÌ—YbÛ>–*—ÔóÇhrN‰þÊ&°ªy}ü¶Ü‰ÒY`Ú”×^`¶1oxl×W5u¦H B} ¸бÞôV/{V¾aØßuc¹ØÎõPÖ’aÌõ¶îN¶"Ú`íÞOH»åÓ”1‰äZŠÛ½Ò½¨SHÙ˜$ùyèt2À!ÞYdòº½!‘Šgå ôf=z^z±×ƽ¹þd\ëèn$Jè8Ê2ƒIw2Ë yBS‹üßGÅHÇ]÷®;ƒ£ÿÒÚdXJW±¤(%ÚPΞ<îeí{*ˆ}α+P«¯Þà5ùGdYQ¼\¡e6o_a"»ž’ø ]êûK£ß¿í¾x° `¯€¢vðén³ú[8›oøªH«å”¥Eކ°bPyÝ?Æ]ÀhfÓ£ü$-‹sT›®uU³Ó,g"ýþE‹ädM}8fZã‡ÿëÄX_w– WQ¨”· ùŠ‚Ölx25.Yµ¬Š T›=”Þ^ZÒ•`Tb#-¶É^kã¢$eè1ët¦"ŠÏ—Õä+MGôR÷߯l^ñO”žxtùνC1ˆ=àrè¸ryM1Ežd³å4±ù…zë;£cC·P’% ³V ,ÓúI,ôF.;œX@ 24QÍ„æ±6 Þñur­ ²`L‡…Bn1ny¹j dN€»å0Äh¾’YLªÑøÑC^ñ<>?#9\¤uØLxéJÉRØhèQ•ÞòV©36“´u kгöÝÎsù„óIrßÓbÀ1´€xÒ'v M{¬Ê“ b¥†¢„´u^ĶåwÔÅ^–7¿Çòχw¶Å»R»y8]`«˜9¿Œ ªis²d6\‚¶P‘æhQ8xLÀ’öü^9¯Ë Q#¯^–š_/Ëc~|îŽËå%¼ `’ÕŠ;Ø—KöpÊÈ"Saì>m=.±”í'w.4‘ÙŸý[—(fgaTfÕ¼úJµ«™ ­öü˜6ŒÀhCjͱÍwßÌFReÙ]Ò–³n÷ƒÿ­Ð66‘ë(š5Ȥ¸·¸(Í»=¿lWÙ…%™pí,$PÒ¦_fÊw]Æ+=î½60˜Ù^9ÞiñqúÀçõù‡9Y#_Û!§Œ„(]Y¤ÂÇ`IQö‹·­‘€JåhËAÖ«;\îoâfÖ/Ôx:tÜlÛkJÝKcŠôé}åùýe/ö)b1zÃV?¬ÑܧbÜ7@pU¨þ~!>B×ñî/v+sŒN~´ENøÍ’mÈ6¦~¾§Ý²Mr"¨¡\¯˜ì¡`6\†Í¤\y,«‰wœ•”M­Úu?ÏçÒÅ$éaöàãè^ÕAðn]CÏhþï9S}DUºWÆ‚røÿ £$¢⯳Êqï.¾ ¬fµhrwh7Œ8è‚õGn)ƒáêûá×Bôõ´<¤_nìÝå€1ÂV鸄á»Ò€ñ±aÄÚ€hHÝa4~:¿qù/tÎF=…Ùke3rãz~!Å6 M>ÈÕž¢`܈ª(8¿0Ö½]‚ãêCûuÊXKq«@ w´™IÚG2]jsß©•hÀçIk)÷ì ëÀ¯¹Ýói„%õDÉu×5«ßFém"RjtÑ/ƒ®iœ@ÉØfÍN6ì>u.àƒ¸ã7ÃË$®¢y¦¯ºv܈ë«Øšþßž¶€íÄ^ ¥"žãq ¼?%XÛ-<ü ÑAx=J y¡qeïÈAÕ4~n—MXSãÌK9 æÎq¾@x+ÙÌÚçÉ1Ô büJ‹3T w)ï°wã³]ös´|Úà×½½+]%kðFŠ”ë#þ¤kãUEI3ÃÜ,¿{t–(£©¿…iÞ)–~åÞ¤xç ~ôÉÌkS¿ŽrìØnM²-ÃX ÓŒ|ªU[nøË¶ãêøHB.ÑâÕÊŠöõW}ºéa³:9¶fÀnÈ–Þàp ê^‘wä |Ö3V§ïoí/|9`ÉÃd  ¶â+>oñ¼W€KBjðÎnVÄ!U<“¾Q3Xò„ Æ¢ô(”¼’´>œ7Š5‹uìwF¢RwêBøÏ°0¥•š_ÛŽƒŠtq)>E^xEˆz©p åL€‹ð(0hf\Ürvï?Ø×kàú.q®Á 9kfÓòÛOvÔÐÜè¹r…rY´h-œcJ}§þ±ªTQËB!/ñ@Æ’ž•ºz!éq)u^e„ I íiu˪a§ÑI-p$TîÞÉj@Œ¸°‘üþ»„RÈA H‹Ø CíÞ€”‚S8Ù«ØÏï‡ð@pS:¤»–xnè'‹üGÌôq¬gø¬“§WD:Ó›æ/ådÒ©²¿ºI»…¡ƒÎ`_ŒÃë…¾¨Â4öíW÷û ËMž)Rœ‰VÜ1ìÙuôÏVÂÏ_P¦•K\V`X›—Êñæv"•þ5VòEå‘«‘·RõPîv‡dÊGÛKøM·½)žd@׆ýÌ0Û¢}8w ’CŸ›m·U$J™lžÉŽƒ¦^¥ž=¨Çÿ£2ûØC'ÔmÒySýµB³$þ'¢ê18Ü= E >êth’¢"À9fÍD¥´,6ùŒë%4ÓBtï°*ÄôwÐ4l=®Qáöþ&\BÇ€wKß’PIXa˜*´Gþ!4{»>Íý'¨ßªX–ýF¨î¤“¡M¡ÝvÙXû¶/ è¦Í®Ë¢¤~'ììí… $08Æzò¦ƒ¿_’ ÓL± ~‚Ϥ¢2 -!¨ß3cÇÀ5áúGVø¼*XÅô@þ°—i†gVÿG‹—Ê ¯掠¡Ü;#[µ·~@Y9õ8%ïÓ;Õf&W3g çW²ðh-Z{¯{M c3ép•!êø–Šø|plrJ5ÒZJRo¨PíË¢…¢€¬Õ¶ƒ$6ƒÃ@•‹PàÎ`Ù&÷ ² \Eù l`x±5Ŧi3<ŽÎ›³YŒSïîè£æ^Íq{–ÍEßUÞå•Eà;‘´øÞ{Olßú?²q6 U™ÔœS Dæ‘¡J^Ÿ¶„÷’ÂçuNB ŽÑK¥0tw-*t xláx“Å:±2Õ5‚ý€‰h{q±×G¡fÚk â pµa~Œ?Õp`¡¤Ôú£˜È¥U?™ºæ“|ÖmD ”Åø¬ ¤²)e®*¿­¥uKl¼·v ¢³@ÁõVŸ IZ§Ú1MåPT²+~Õä}­¤,DäʱúÍ”z0ø3Ó~¼IªÛ^Â:`ÀÊ 2–‡è¯õ†½·ñ’=î¤k¿BÝMPñqmÜ…È6ÊN@Ðh·sÅ5¬üÐðè—c(Ë9¥âî0‰åý,×¢õyõïb[¥˜ìné†våEUq’ö©4¸ê¿-gpµ‘V…-ßuμúŸg[‹åe]þÖúJîªÎnHïì Ò@m<åb ØŽ’Dh¨6H䌂x'>TîbɽUõçmØi!Ç\‹¸tll58ç)Ö—DX"ù-Å:–ó”Òœð•³B=ŸRíw^f%R·O z[ õ—×Ù`¬Óö ´ŽÝæúxŒiGmÞú¼sm€ÊþŸÈd2ƒðR‰™pâüÞA6½ÛÐ÷!ƒÐbjänuËÑkãÃí`¨ekJg‰7“³>òÁÆêtDŽäo­:(ëäPð)^MùZíg;Œ£‡ÔQ»FÔªMì­ª´6¡Fmb7öVE#ö5c¶F‰]ĬÚ{‹ZEðÔjyÿsÎW8ïÎuîp¿¾ßü®_˜G×wSmæ0Ôqk>yš—œÏÄm‘ðéÔ"ãþ¾zÞl‹S|Í“qÅæŒ}SõÏÂ{¡Z â’Y×½A*c.+#SoÅð ¡ž(ß×C°îF_wcÜN”¬–=ÕSvÅ%ŠG뇈ЋƒÓÊR¾(ã§çEhÆÞóAÔÑgálä߆G² Ö1ý°°ð3"n®¸±\×å%áÞ÷ÏZ}LˆÔÁY³è]œÝúgFÒ…3d*nŽ©º›¾{¼ó%t±:{°¼½¶©Gs"ûå(M¸E¤Piò®T½ï5bYÖ­ïÑúº˜´‘b=—mâ¾lÓinió#ñŸ‰Æìü.@›©¶ÎÃ,]´O'^™Ajq—<ÆBÔmÒUNdBoŠ{üÂ,{L©D‡Pn_.Ë¿¤.= $V'¤{gˆ•VÕ”˜ 8íxÀùÞxÄÆzb[ã¯YðÝ÷¨*4VGÛyã†Xûö4Ë„7,°•ës¦"éÀ[ NºòŠgË=L ï&E¤Ö8v¬žº qioB¬¯›+aK7/ßžßv«©DBÿrôf5‹RÒB›4žcM *A÷Ó¤˜ÚÕ=j-ã“6 ÈÑNô1$¶ P€ÐÀ=Ïz»*¾é蚬ï*Í¿å_À£:÷î¼ù=Óñ¿½ô›‡÷²6`puðáØ ×"¦P „“Eg÷k§fnVظ¦,» obk‡÷› C°@Æd"JÆÇLKãXWT4°®ýe‡qËÄœo²—ŽÞÉ ØÿSMzú3‚,ø÷¸ýÈGä# áØ…¶³Õë©S÷}˜FE)xkcRÑŠS°TÂá“Û);tÉWsÞ@b²j3JÿÜ!ƒºSØ%ËÍóµ ]ó-^8OíM¡Ä\?IýRª™ÿHéˆL?Cì­WÌÔŹ5`·ù]o‡_šõqç*`ÈâÙ>à !Ì®ÇAV¶mœm¤"!¹ø ³°ÅÅ×Ѱ…Pi®¹ˆ‘Æqùh$Ñö‹÷«Â_8¡ìj8´‡Ã°{wËóåÆÖ!0Ø£<‚ȽØç?ÝÖ»ý0ÖlÀù£š˜Çª:fá5íΔõVBB·óV, IÏŸiUö©ŒZ".eï¬ÕïˆóÈmÛwa,ÅÌQB|k+A3·bŒk/Ò^ÝèFõfú}£5',û“àÜ|Ô€/®QžN!ÞQÀŽ-¯cÿÁÀhèI-sÛy¾wÓd¼y·ØÕíçÊ8®ÑNc9®Sn-uâ älyFÇQ{ÑðæÞŸñ{Ü—Vhñ½‚¿œbÕg~ÎèçMŽt°,¶è_°QÌíâ ÄÞ¶Ù˜º¸f&îDÍÆrÿq{ÜH-î#Ç.»ž2åmŠá~aw33@AÐd†ø@²Â“·nM£¥, êþŒ#µñ*b6¹0dÒ^²CàÁr«è©Jdìò¬Iý­÷íKI^–ñ’t‚->:7ªBËø‚¾°NÈãóo0×±‚G}â­ðhµc¤³½‡·ð®èTÊI\'Ù`‰ä#Û$Sv*ùCxƒ2%úv-‚n¬È¾‘ɬ¾/ 6þãâÅ7à(lÏÉü3æ-AÚV¦zbæûÑ ŽÁÆÍŽÏ„ø¨ðèõí‘ ˜s’ÇZk é3‡.Ðw’Ne£*¶É[á±Üß©¿Kˆ‹fÈiqhJm¡µElc6͵q±3èz¯±Ù;×LR¢ç"«*XÏ<­ HN¾7Õ‚S•%h+tzш²-³KQ„î)0 V:D=Ëû•á:Õa!’GJùU›{mN8˜É{ÙJ½˜ÚÊ>ù àã]nN<&ÌŽç‚á˜jT{~#îUäµŸÝæpÆú]Ž(Õ,çÊøšˆ¨„n[ÞS|iÊÁJ³Çéñ¥œY)fi›&S¥Rk‰=|—[ÐCkÌŒøeÿ ×sEß8 ‘+ÈOÇÌŠ¯Nâˆ%g”¥ÌA,!;:ˆœÉp8höå9 T3pHÖ_m¸2šˆ²]o9=S¤[Z´{W5pŒ– ÏWg0Ȭ—é»K/Ÿþ>ÉyåqöOFãÜxiVðº ~Rèl2ð‚9n±F‰óäÓ ÆÐ^N}õÆ¥kNí^ßÌzåÔ—R¿o8~ˆJ{Éqð‰­Û$ó÷ÔjŒ”ËR4¶#Y€ävÃâ¤xí ÕP¸E¯Ía>>Eã¨lš¥v%ÖŽ:‰\_è?ˆ¡†òï% FzQÙ§¡†¼óŽ$¾˜Ú€FÕª#ŸÜ7&õÐ˰ï¥U—){¦²¡Ëšœ„Š~šÑ놞µY§Qm+tVmyØk䆰ñ je½Åð›!ƒÄ扒C¬Škr!'sÄðí©ïævd¢YÙ¥ íê­jP óËÄpˆa¼¯ÅIõ+íS,QU…Îß&%È .HÒ-ãÿŸÿ¨¿Rp‹¾¨*ŠÙï­HÐxd]ðá¤]?ZPt;¿T²(d»ÚNÏÿRWdÍÉ;EEÓ]/A«IœkÝgÏ áßn¹<¾'¢˜1T¤ëÝ«‹æ£e³Bnk^b2îîlEŒ­jRCÖŽ„Üa<3—AKäZßÛÒ³¾lµqª¿g¾› v¯µâhì´¤›öe›xò­¶¯¨ÉÉ­Ý“ÑÈ ˆ’?ðm™•‡øl`âÆö¯"F« 3Ý^EU[äê7œfùÕyìçõ2 x³;|ˆ”‰•˜óà _þ^"NòDL¢ämãtÇ6°ëw>œÍ¢nZŃHh ŸüÕÉÉ»’0Bƒ¯@ÛÔq`H¶)ê-Egw˺‚.Â,+U®^KÇÊÿ8D*NéÙßOöòŸ0QÁo×-¥Ü·^£žpù!Ò©]^+@ügYœ?Û>ï Ÿ3hoRËŒxîZNÑ`:T ÍLàê|™ô¸2¸ŸŽ_¬–=^@š“àÑ®&ÞKNrƒi«ââ²§*Åm›]m –â|æ’Kw·˜AÌåTH½3Û+ è×Ý4Ee ßâpÉ~~‹§Úrx­àæ©Õšáoß0/™>5¹÷<ûÿŒî9déXĸH©JŸ!•‚* „-šÝæ½eãL†ülõ—V§î_"&wŸÔ°yÞ—÷¿¼Ç”¸x&ÊQ»Ä_¦3”ðþq¼d)fcÜ—È_Û€ÒA%L¹ð[,¨…¸ÁÓèøá"uüò퉮dfá ¨¦PË©ò£~KäWY¦´=jžË¶A”˜ç$¤/Ÿòm0kX™Æ”—…2kÙšGcÕ¸KöÏ»§¯•3‡;?O¦â"*Á.×öL¿@¦<±/@‰Ñy9õun—a |-N¿ò°Gl·5oµ·Kàîý¹Áøf• üX_2°àȾ~ŽKúñ44ßênØêopî„3ïªóºnñµDÓµ}»÷Øñ½]î©+Ï@>ßÓñª¥%+œûªÿÛWYÓù¿? Ê”ÓÐúí²»úƒÞ;›cð·kV¢³ÞŸ¤Ò|§œiø ì@l§·×.3[Ûô8çAvÚ=4 G‘Û¡ž`•¨iDÈá :ýyù!'*bÓøM¦#Íu_÷U­³û4‰ÇéåŒ\ìã·cŠŒ%³”O0=$Ç[+\“ŸÖŠ‹xk&¹zWèó¿U]wöÖãw2™«)†‰”ZqúFÆX@w™Ø'ÀÉé«B†ëëîœ0æg©FO_Ÿ Ð1±…IjõlÁ«ƒP{ú_ä½H[9+Qs^ØøHs;†Waýr âB°à"–3o…§·J“æu¸™yÄŸ”Yqtòj¦¢Ÿ…ÞH±&%¦4Öýœ=5ܢ܃=‘ùã2ƒ¨\ŽÂm@!¶óñÈ<£-°cŸ®ñ˜x§5ÎýMº@Á@ìªû7¼†í»½ŸðCQM;I¿|Tev¡› ЇÁ=ϼ%TèÍhüù³[…ïììô–òª”èÓÖM¡õ@™òÊŸ=ÿÁ¤Íx,öµhu–çªgøÅ.ª1ʸ'f²lÕù€ãénfT aȃ(Oû…äø˜\„{¢ðÒ•ü[n‡°–r y7³¤U*1bžr ÉP’/++JÔU*piŠÌƒgT9˃D²‘ƒ«-bž—&À0«©¦žPñ©)Ò“)\%=#‚uü}ÿ–œäÀQOZûm`Ô¯tŸ#:_–³Ëúý]jr›]'âÝ7j'Ùá¢1’\w2®©þ04`Ö9ô9ˆ38±Hðò!êQ°óç#|‘ŒöþÁz¸É0!,÷‡võæõQ71ä ¯…Óy4Z'WG5˲k¾n÷ëµ1{Cåy¼þœ]ý.Ï€^0)Î I’$6xEjß¡¡¥å[®¼ëŒVKõö„½~¼Ï¾‘ñÜWW“–3ýO|·›}ïVöÀI”gzþë˜C¢š÷5 u­i 9¬kÓ]›î›%Kr žT-y¹ßA!þ¿äÿÿ7ŽžNö~Þ^ö~¡~NþÞ~NánÎÿýŸÕt endstream endobj 113 0 obj 69802 endobj 114 0 obj <> endobj 115 0 obj <> stream xœ]ÖÍnÛ8ཟBËvQXïO HY²˜é iÀ±™Ô@#гÈÛW‡GÎt‘øˆ’®>R4éuw¿¿Ï·õ?ÓåøoÕÓy¼¿ÞòËýøtÙnWë/ó¹×Ûô^}ˆ§Ëcþ¸ZžNy:ÏÕ‡oÝÃ|üðv½þÈ/y¼Uõj·«Nùi®ó×áú÷á%¯Ë]ŸîOóéóíýÓ|Ëï ¾¾_sՖ㆔ãå”_¯‡cžãs^mëzWm‡a·ÊãésM]óžÇ§ã÷ôڶ¸¶®c½›sSòü1ç–¹EÌY˜Y™Ù˜ ÙçÜÖÍùŽíwÈæÒ™#rbNÈs‡¼§mܳ½G˜çnýþ@€?Ðàôøýþ@€?ÐàÎìÈôøýþ@€?Ðàôøýþ@€?Ðàú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_á·šsõ~ƒßè7ø~ƒßè7ø~ƒßè7ø~ƒßè·RŸ~ƒßè7ø~ƒßè7ø~ƒßè7ø~ƒß9þŽñwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßátF8#ÎHg„3ÂÙ¶ l‘Îù+Ú²rÉæÿ Y,h6¥;ÑÈDt8. Pi|ñ€Fv ¢±+íåK÷ÌèdD†TôÀŒg¥†u€NmÉ-^F ̸>-AÍÄNèÄ…²,²éŽuð¬´aÆ`¥Å‰ALt&8eÁM‹³<—“#artË„F{ÇN‡® tÛáÞ®Lˆvqè”ípvÆv¼øÎ™Kû2ž¥=²æn±•ö=Ûaîzf˜»õ1þûå‹OOgñôË$@;<«) bÏwW<}ynS—~y.®X§G¡ô¥)›Á°ÔÁõë ¨3,uðîÖÙÿdØ@±ÃÿÚ˜«ãÛ4Í›rùPvcìÃç1ÿûKáz¹â®ò÷pר endstream endobj 116 0 obj <> endobj 117 0 obj <> stream xœœ½c°-]—5xlûÛ¶mÛ¶mÛ¶mÛ¶mëÛ>ý¼Uß[ÕÕÕý§cGìÌc®‘sŽ533VFìØ$òJ4Æv†&¢v¶Î4 ´ôœø²6†.NJ¶Ò4Š&f.øÿ€¬P$$ÊÎÖ&ÿ‹…"Q5qt²°³åüwœ£‰ó?€°ó?áÊæ.ø.føøŒø ÌœL,œ,ìøŒôôlÿ´säÄ7u´3„"²³÷p´03wæÄÿ¯]|rE5 **êÿF888ð =þÍà ›8Y˜Ùâ“þPWk;{[g.|¡`kk #|3k{s'|ccãi¨X›Xá‹ZX[ØÛ۹ⓠQüO•e ù狊_ÌÄÖÄñŸ’þcà¿Ìµs43ùZèÙ™ðÉÍí9éèLÿ¡LÿEÑ:™ÒÚš8Óý£I"bk,dgó¯lœ  þ5XØÂÑÄèŸâ=èþŸn[ÙÚ¹Ùzý/ØÔÂÖø_ÒøÆ.öt*¶.&Âÿ'øê¿13g|zFzzF||w#sºRÙÃÞä?H†Á¶Æ>^övöø¦ÖN&>¦&ÿl ¼œ \Mð]L|¼þïÄÿ<‚b`À7¶0rÆ741³°…úoõ`Óÿ<–1pv´pÇ×¢§ýÇC|ú}þkO矉7¶³µöøïpYüÿUôÑ‚‚vîø^4 lÌø4Œì,ø ôŒŒø,Lø>ÿSê¿Lø·ÿÊXüŸéÿ[RÂÖÔŸã?ëøÇÀÿS >ë¶3>ù¿Ú™ÿèÿ“¡³…‘É?ò_ý¨MÏBÿO+þ³aøíÓÿÁÿW·þÿkÐi ýKé¿;óe(êbmýn’ÿ§›øÿØé„/ÿ/C­ ÿw¼…µÇÿˈÿ©fòŸ—äÿ—’„³Á?5ØšYÿÛh|: 'Q wcy g#óÿlµÿC¨Ø›8Z[ØšÈÛ9YüëvOÃÀÂðÿ$•Í-Œ¬lMœœþ™ÐÿàLlÿçiéDlìŒ-lÍð•œÿéiGãÿþE¹8:þcñÌò?cÿ}ljñOŽ&&î&FPÎ|ÁÈFÖåšy?ŸòÍ]dô”*ÛDûNã_%þZÇS7µ¢?”)EÙ š”Íá¯ð6Ù²1ñƒÈ. P0¤B,XÏœ…§:̬]#+†JJõ§ú4"ÒL„„˜ŒÎïÌG©µ}]ò·ÛJÅ1óâ ûæ‰ö6AóC¼Ÿá[ ƒÊúOJx;7÷ù1l½(ÖÃòPrÛ2zÍ9D I`¤G\z£¸)&ã`M•Ô7EÏÊ0ÏÀETŒÖÓ©ƒüy©7ŠÜ ¾y•†h~…Õ‹Wˆ`WO {—Éß®J«+ˆã޽ªÜàÇ"J´=¢5°™žæ(EômOç+¢!¸š†ïi1 õñWî Üz:ù—Ö–cèsýÎZÌxõW™0ÆçðDϧÆÖ}ê:÷Æ—ªN‡÷+é«ö·™®6tΙqÑ<$ÖHjgFÀQÓcgÄ.çìnûi&ô UZ°;z§pÌÛiއÛ+£ sÜ‚‹‘Ko¨ÐÃè[¬ D”6Žî.Úu8€µ"n̹Yª±-ÀÍŠp‚t]¹×?ê±5öiËE€ð[Íé'°QÀµ …fƒþ1@v&¢2vL»sÌÑÓÈ“.߯< E\®O½Hâdb0<¥µ¥R¡õ§w‡ ï¤éBû9Œ1¤œ•Ä×!ˆ˜-ºír»”Π»â9q"‰é ·M°bö“T:ÖN¢JÓ•áW[Üë;Zį.j:‘§ÿKAºBšÐíf‰¦ÿÍÂZ(;ºˆ&lCË áMº¸km^¦έ*¶àiãÐôÌÊÀ|/]™‰ )%FùHd›ï·®CÏ(2µÇ}`HäCø‰E†¾Ð‹rBÙ}w]\"lÉŠÇ¡"îa…˜‚»ö<^°ÚºYN‘çvœ;×ä¯3?©‰¸Õ |¶^6¸z/q~0öøGeÏäMŒc½ir,á3´ÄôJÔÞ͹¼*'Æ8MÈÜ,zì ×UÄ™ (¥·÷pü D<˜VDTⲓÿ™\ŠZé:_ŠÍâ$M/²-U¢ž³y®·£O€Ð÷Y&W„#"Ý+e¤Zõô’j,šœùêßÅ7bËÕa™$’ÐÜxåÆñ·uü\]·júé8NVy ÀùÍÁæ[^Çî÷˜>k"Í ËÖ¼­‚##S ãë•;€Œbãq.}8'±Î¹‹7ÃËs3[`Æ'‘—ÛÔlç6}kp" !G+5·´SGÂäÙò7Ž¿”"Z—=}dùK*KyGí×ë)Áøf·ÚÖ/Ê;ɽäÑrö€£ºö ÖÒW¬\\÷ A9]k‘üðZv€(Èx ¶bÌȰܹbÝ‚As`ð´D;x5=êãÉ€¦ßÃÏ$ έ©lêÏŸøùàñó?bW$é^^ªÆmÈzàP’oC½;ý^z #ì]IXó±ßŠ4ÞM‚ô‚$*®{”€â؇@Xâ ƒÐBYDà}t·Áp^Õó·m+ãn‚uHÏÔÁµ})¼;ΗYoèoSd÷Û›̧Lƒæ}í–¤Îö7ù¡RÚmÝj“Ee¦.ÕñHAbÆU‘Þ O¥¼ÉŸW‡²µŒ‹1L)“rØ–lfÐ(õÉ%ú[ l¨Ì\šsÖTáC:ã[¥.ú½lp!ɪ†BM¨V'í]4ôÐ{ êìÛ›NÀ#cò˜žÊ5Köæ]tÿ–Õú{Kd¬ð¡Ã¬ÍãµþÁÕÆþUd¨j{%åÒ2O!#m;Ðû£Å!Bl½jˆ[¹ê ÷N™Ùs¼“ÊŒ1Ü‚gs-J*h*†’ºìWbrÎ’reï»»‰Ó©cˆ=V⽃,N—øÝ|—u9¯§?¿/]­z¨–¹¾0M#§.d O¦~qÛPçXZ­¨©œö½Òš³W§»Lµ(OOEÚÅó–†=Mu=IOw[ùÜ^I ­Œ² 1ýìGB7¥‰$¸Ã­öéïÒJQ|7Øp9På×ë3”ß-Á ðô¼ÂådÛOCdŠÍ«(œZ5¸,…£þãK 8ÓpËáòѲ’Ø»´¾‡þ¨`ú7¥KW½QØÚ)hýûÕqѽ•𦂋ª^gC[Ïo£3rv?~ ¢Ñ:?|³ðZ_€$ê¾ÎÝ÷eR–!YrÉG¸(QÈÃ{æf®£¡*ìeu8ÓmCÌ@t× ºcmŒH’H-Ù{§CÇ?¹ˆtX}Ýãʆ@°J¼wðó.¢° wÛ}`Zž0v,àØ¹î4§HÔ÷h²ŒHŒ:ŠÜt„a]ïìóÃA‰ÇÉ’†‡²æÄÈ©8™ÖÖŒ‚;‹r6 ÙÚ÷qE‰… ÜTÄ,K—” ƒ9x>°B™&\‰öJÒœÚ× ú ‡$ç{Ã:µZßá+¼8‘ˆS®øô-¯×TÕÏ"nÐo¢Êyýâ{vx`-V’¨àü9Ÿ­MÇ|g 8‰¸áªó$\& -td˜f'*uÜ_¤HL_r¦ZQt X‚ëjß½ç$‡*Ú§Õ˜‰˜ÕÖ?í]&´»Ùð•QˆŒæÚw7;7Þ&6g#hÄ2¦Uk–b—õÔPE,Û(¬0ÒeUºŸa¨àOj×2x¬ÈÃŽNåæ?Ã|”’ªàª¡ˆŽ6Κ¨Ôæ û€_áæª½¿éO~VÈ0¹û DiËÁÒm¥dÄšxö&IìÛ'|¢²W×eá¬ÁägjTR­”\ÜlûÜ©˜•GgÝ›¯™|Ó»)…ÍÒUGrßD̲ò¨jƒ§S‰vŒàaáš Z—ýÃâ%2õp£ãʃèg¿¹¦›h½àE¿7NÅÈD9ÁpN(ÜeT‡i\fƒ,È3–®ªMI£ëú‚8”f &øzA§" øKDvhÃ0{r5ñeŽ(<\þK5åÁû]‘‰•޲9êÕ—aÈ@!z*yz:Ú†:{™±Dñ[ üñÅxdr ~Üý)‰qÊrÒ2ωÁuŒàpözB¬1WZÃE^ f?k¤Î&GД¤.‡U@ËTçË/K1?ñs«v@!ИscÀ U笑¤–ÖGè[ö”U¾ uÅ™Lf€Š{m†IJÿê^æJjâäblÐÄ×7o8¯­5KPuŠ”f6ùV_ße_ÖÔ×q«°…£6ˆmv¬ü=è[ßx¶@EN§gjÖ+oeà nÚÏŽµm¡§4 B,c}n¸BY~CͼËÛ½‚W^dä,–¹µ‹¢ 2ç¡b!Ý•ùf¼Eë™^HÑ>ö7•;‹|ü:Goz|K~é5œ†û;f€¶þÿ¸ Q»QA$°\¾9I¹†”8úÁN«¸ê˜ÐkŒFCï!u¢r îée"˜`ødìÅwVø·2â}*Ñ„ .âd<õ:$Œê'¬Wbü$ÌGJ»•_SõþwJî&Ä-(•ð\ÂÛgJ™Ã¯Z×á̰yЖ½‡V¢<Š¡¤Þ¬wŸ‚`ÊQë7%†i¿„'òÍI-æñ„¢ÏïéØÉÜŠYÊ\ŒÚÒ—Ààpo™Œ%Òṵ̂MDþ,ôÁ°mà9F~KÜs^]‰›ÖXQ=ôzOï÷VNàHÜ!S™¾¥”ò®ò ®ZU~ˆŸñ’Ø›"Øäèú ]÷‘4êý\Áñ9‡9r|2 úæðÂÀªÏ8ø)0â ©vha2"ˆ…K„­ë¥é{ùø4ê¾A5H³_ZÈçæsÁ8˜`„#u­6Öû€¼·›ô´Ÿ±ïî“lbŒYct܈áf€,aV‡I÷v‹ÂZEèã´Ý…¸70鳌qç5/¿J¿W¯³ï(A3ß“tBÏM8×¥°Ãý\TݲzTǦ’z•쎘*cMÞ¥±]ŠcXáß jÃ:5|aݨ|I°Imõ•C͉„T} ˆ÷i• ± ”çFó#» FXeêo’£ ÀÙGêºÚþN³¤ôKf3thúƒœØÀ9ñä´“f ïi A &JµF\Éø6´¯ÜÉ>ðgeÜRnœ2Å)jC¶÷ú+»:ùÏ.ã5^¾­ûj¢°7M Æû°¿lç¬n˜xÒw,K2Ð`‡q$vP¹©Oˆ6^xve_ú ™ŽÊŽ<˜Ù`È¥ÉävQõ×–‹Xø”30ñbáqÓØizhD¼/ž?bv^*úL¤þ\<ˆHŽ}±K-l¡ŠC¢­°‹qYí%/v²÷]ÓÔ3£Ï („—O»-H3‚~œK©’ÓéÐMáÙ^_ þ”ÃÒÎÞÅ0'‡0?äZizêû›¢•4{6ë\Cƒ”ˆÊ)ÕÄø¢o•ˆ 9Oí'ï¿e”-gÃŒÚäÃÈ ?ò#xá)±Ôè銵„*¹augSxa õ)¡vÒuY±¯Ä†"3s!­d,ÕLà´Z½2d† ì(VV€¨ wd¬Âßôïà@çìs×õ·©«e¬‘âÍ6ȺŒ¯ô¢ŠØQª‘8ZÌÒµÓMëýR;æ0…¶néIS¸ÔC9ISÎ ¬s÷îzœæüÅ-˜…ÏV’wŽ5ðÃ…‹]PLÁX-´0ƽª.ØŠ1›ûñ¦/òáÓ@cEWù†–•7£@ªXn3 ‹±×G{Øpš¨,{›+:Ì&Òd’³-Ìù­±Y3‹ÁÆåÅÑri“~;ªf1•i1ûC0äj@At–#yeÓEJ&W³|Á–AÀXu”ÊÃ'„ºu2Q\óµPKÙ‘¶)¤Ã×_íi]*Bßi¹4ôû,ÿûc@?nrK.G¿HÀS*›Z„·Ef,Òá\û´Pþàñ*w³o£n!˜B'¸Ê=`$ÔIÂ…c}¬DD>ðÌŒŠ‹:i Y'V Ù­pXve2Ü&=fÿ&¢7e™å€Dèt\Ëí0Z÷…9€Ð+6dÛmSš§?õ¥ïÛ:7Øxsi×w…UÛ+0#Œ²±±p•ánRjÉÕÞ#.v¾rØ€ø‡¯Ù pÓhha# [`øA¦ÓiÜgä†rMƒº$¾?Ðu_Ævúaeþq¤­#áÝ<½V˜z• ÍI¼±L ü wÊ˦<*züiùw)õt"˜Ñ”–“ÈíhC‘ù€çàyí2Àì®äoìï¡8äߨK';ÁZ+3Z¼7Ê+ÀÌ 8Ú Äú¾™“†èEtÃhzY&gÆY¸!ý±cA®÷AæþŽ0§Oä—ȸ¯eËFÆŸb]ö»ÉSކ~Á'€4Ì-ÁXÝ:ÿÞphöùÕ?WGõ¶•¥[Ä5%Öy~b>ÿ®@½‰\|ËâÐÂgõ¹H×eãjw*;Z2F5D¿Q_ø|s±¯þR«¿¯ Ó´ –Ó½{‡k©kß(ó&ðod‚,ÕÕ:®Þ““ÛrÍàÈlwâ%tâ ßZ”—kÐØ*z–Cã\wòÚ{á–¶_í…¾—íìæQAa¶¯:5 žÅú]G šÑyô@0lù./‡ú³°w :)ü©¬mFcˆ ˆdÞB‹Ímêõ¯rc„O0~ú ó¸ÛÍTäVå¾p¸›ø L·:w©–±„Ñ«…ñè:ŸÂeþô¡¿š}C’¿‰¤Þñï7œQ¨Qðw‘£úUÚ²ß *4çÍäé’Æ¨–Áx†ö(2–KäBúš3[ä8ܺ£W6c]‹‰,ƯÊÅUèwüK×G¦012ÞΣŒE¹nzÆ3'P%Ÿ¢ˆ÷)g¼~#ï›Íqþ1ìÆßJxÉÃ! Ωb.Zß Ç¥?ßÌJÍe ÷Ç¢€ðîj’´Œ£µÉÍ<Gj®Cf}¢™fSº»Úãrp\ôIu„s¦º&i9udHßt­ 0Ù¨ÊWS¥ú¤–Gˆ› \lº(°€îhm]–CQÉ«CÀ[çEƒ¦²î=1Vy\¹ÊÍØã'@MÙx½µmL“ÒU3wõ½.éÁ/?:Ô@æ%…L gIKÕ°ÿñ€#v…˜©÷Üj¡ŽABÂce5¿Ã'´-­ÔðÙ‡!‡¢@­ÁÚí½åÛK¶q™yçÖ˜Ãw(÷²Ìc²SÓºrF–î^‚†*Zùž@Aõ‡ ô1:º'BØ¥!º z}·ä %š_>9ü±&à17r Š”à£ª;+ìã1} ¿;M·Lé¼–=þqvv¹‘!y4òD˜eÿ›õ'tÚ €ÝQ, ´£‘0GFc›ÞqÇVµî‰2õÞ¤–­r^µy2ÑK„dýw%Ð׺ánÝ ]B½ìWç-Vóù¶úÇ;r§û±3*‡Š*vPãæeHT^ûóÀËå¡ï9êÍ\ wu7ˆµTðnäÒqw½ ðªYJÙu7 à…TÎkìÆ“ˆsiEXÚ¿ß ð7ªqaYzãd€" ¹“\°yΚ# ªä´ÈŸš³Žß­©!™–? t•e%i4R/ä/n±Pð§ ïy.[Íò-N‰.e¿§[™Õ´sþÀ/ ߺ «¤à@¢–­F‘ª°ß˜º7ÜI¹Áò»B…Ië ÀÜhÖ“ ,¹:xÂ/XFVÉÐãf¦GœIJälW‹]ÿÐe‚wL0yÇ0)p%´g.”-;eïõ¦¹b ËXidý©åïÑÌ_ø©4a¥Mé—úø)sH,ñœ/q0<>¼?Ÿ1`™ o±Š£dµÓ¶Eµé—HûœÁÑ]‰&'èp÷¯JÆLÐ÷ÑŠ6}æ: º"åO˜¾6a*fìÓðµD¬rˆ.;i»‡t÷•Tnàj.ßjŒ@ þ¼y®i!PÙž6¹’pÂ]8†£¼R°jò6¾Ø}¬´pUùSús|J{iMÙn ·þ•Ñ7([ºº®ç‚e΀÷”lð›ïŠB>sÄ$aÉ›»¹üd{¯„7ŽÜdv›ê…¸›UcÉÝ#þê䫳Æõ¦ÇÏ%½†zk¼"·³U6àaR÷À¶k¹,0V¥Ï‰úÕ­f”˜ñʬåMÑ l·Ò¦+ ˜ËQÏ— ‡tx‰W( Â,zügÅÌHKƒ‰" c51xm7¦ñ® d¥&Þ¿$Ó°ç½®{-µ^/D0ø ¹â&ÙÚ¨ »aZâ$"m2U —¸M{t2·y_»n¦~ÄpjøØÞÁý^38»ò–O› ûÄ3ÂrH†ž¡` ôâ›ËuŸ˜8øgo&Ÿ¹Äß#’:RR%þ2øfŸàíÞ‚vØŽ½®|xÚWG´áå~•åÝ& Ö¼Y½ÐÓ†HBL¤lD·Ý:PIÃ2E»ÞÓÞõ·RSy›¥ ±ƒë—òŠoÅÄ€änÉ-€ /š«“í„ÒCÈbHØ~¼!È€%y6Ť¦ëXçSüj•ºK|kòƒR«{¤|˜a}­}kúªSøÒñE ™‹ôswÕT~¨Kò,ª‡Eŵê­uüá;¹"Žúªæ¼·(ÿü¶’©Ìmb>qv6çú¢7Üb…×ÿ¸¨òÄÏÍÙÆ g¾C[Û‰:;¼¦V¿ôÍ‹ jú…Ê=fÐO= !×aª›P.8Ž`wÌûƒnÓïÖÇçÙÎíõ‰ KýÉšeà»®lĘaxŒã™^n½åàÁ8¸.HtfÏ[>ŒPÅðIô|$|p_ª¾z\ñ*L… t7m¸?áí=¤.\àÙ@×¾b“ˆ )1H¶ÛŒ¨ö¾xx£½úÅ&èS~Ué€Ùn_l¨P~M¾Ã”Xs6)Ä‹žòŠ51åÂ~Œ·”4'W˜ ûûàúÁõ üÈ­šÎyH•&’§D%lžÝ)b“gÐ pÉ$·›žËÓdž³rš½>®1²”MkŠhj¼þ2KQ,¢×ü'¢D_û×’ñžyàW=âqÇÕlŠ«WkëYF‘`÷Qž1ÂmÝnÒˆõ}7òZv5øU·nÍRèB'd£¡ä-h1æš­Í|c-º†‰3Ú!}Râ—ײ–üˆð¨»Y¨ƒ¿}‡Îz··tUá0ò‹×4_]QEëZ?¥ja~Ü ÷´äÁŽˆÔ\s~CP—(Ž$8uŒ >ÒŽtq9U¥ßÞG~{sô௨zÃTAm³†0”öÙÂwˆË;æ>ʌʆÏBæü¯«¼Ðz&Î7».]¨ã)¦ÝøUíNÔ"&=ô`œUÁ²ÄcJW)d£êr+[\Ã^Ÿrá*á k—;­nŸ³„UÇæ^}Z-€©sã^9hñ*-óbŸ@s^f Ô©ŸGMÃñ&0å^î«S»sÿ`MtiBYלA·¨¦ñR-QrR0M÷‰+Ò!ÚFHæšHË:$І ‘’-‘ù%º%ìû¼8ËU(¹S¥ïÙ გˆ˜ýRôÿÊ#·æÜxêÝEï,sâƒzCÎÍ—Žëà­Cø\?ï†rxk‘P5p=M «ý©=’óù,hvTCêl›YmRè†Y}òz2 ;âÞ˜W] ?8…ÕdÛ¶6dÓéÐâóxgé:H%WŒ»ÎÜ~tÆÌVTÆ8Í„ÕfØy/•R%c-ÑÜKC£ŠÖ>«¾ì/¾ó kKÈ ÞRÆQ eÙŒîµrµ¯×b ž.½~[?Ùí}ôaþÓ#íEì´¾Œª®·ç]ZhïèâÈb‡Y–À{„p m‹–þÖ @6ØCϨaVÝËÕÕÛXg\ðå$–\ƒÑÈ!ÌŸ7¡äÞm”Q”íŒÁ±9C²=5ÓÐÀëK§úf²Ãî­|tꎥ;ÊKùH|3ÐwÁ×Dë«(åüB¼¨Mâ øñžÛúbß©·õ9:“VúNðœÃAèSˆ£ópG@‡¬Ìe1 ¶¦/¢Øغ½h8<ÉS´êùzApœâàáMvÄNøy#— u–Uú=·'âŽSæãfƒ1ÑTEÓ=ºJãÍØô³svº­AeeJ_¬É»^ûä.·»Ütý~„ ]>™JW³i°ç]ÏL0òdFhA•\£…½ |íÖ{†+úPÌEœ™ã·3‹ªy `/´Æùøê“°\ld¾&3<ÞdV˜3Q U©£¡ÍG Õ¬CŸã`âO,Èb3znGènµÛ]h7¤h²Ü!uç?/'záÁ©k@ËÄoЫ'zGŽ¥©·X›Í·ƒM4©;UâJ@ÏZÔþ-øÔ?x“>Lj µÛ%%¥3™V4O†´KBÃäé¶ Å5fn›#a:ñ>Àºfv¹CÌÅžX$î”]{+;ÖĵÒãNIè#{îÌíÇ𖲈·®1ºPgP·,²! ‚W?ÚnÌ-;àÝŠÓ4ƒõ íÓC²A줫ôÞXù1ü#Ñv,Vƒâ(¢&àf¯´<“wÓ.¸ÃŸãSøYs©‹™ Æåð+w$ˆ¶©…2Ÿ|lÝÉ&å“¢BßèàoŠ©!pý£š~ñ¼€6+¯Åq7Àb~\=i¹#i |[÷½¤)Úòݯ–¹Q‡¹c‡&¾wê™#Ÿ©R¨i4¨ž¼€¡£ƒç˜_qÏ2_6ci{ž¸½Ýô¬?ÂcçmI¶ã”È,Lfj‘Eà<$ÞeÁKØÊL 5óRLþ“À: ³î€RQ¼\†nÉÕ{P'Ïô4‰mhw&”óðšíx ƒuÎeX-a|¹tµÞ†ÞO ñ ’^#PVÓãfß¼D[DX˜¡c÷lžL7ÄK˜ŠCPÎ×A`:üݳÑF$Ÿê‘ìoYYùæI»ñn¥-[ÿuõê‰F‰8‡â+?r¬ˆÒ4ÜÁ½€˜•“‘Òê ]”sÕß&ºJ}zåõÛBHó}bsDŸ‰-XáÞ|‡iRŠ;¥¥ÔFÎŒ\Œ\ñ{²&Lœxš p>¬kXQºLhðf–Ð,T“Ž»”ÝñûäÖá>)ù’§¿+ÀûSjÑ–TÝönÑ éf•VqëlïLª½{^Þóñ—¥E?Ã4ÍœÞSΔåŒY#E›‰iƈQ]c¶-ÎK8 ½ŠóÖÜ ,Ê…jºŒMµ1÷÷v<ÄÙˆø ”îÛ8Î7ÁÁ 'Ù3%ÊÙÈ’õß§Â4‡M¦îØ ‹ú¸‰Æ¥î#EtÚ“Ôj–ý† ¯ûòŽä©ó´[A0J=%»ÔŽéÝ $HXnÒÛ‚+¸g-Çví !ÚyœzѸý÷ýx-d Ë[:\Ãm?݉ƣ/K*ÇF¾8àªüëw #$¾hAÓòÏJlx;ÓŽ±Í³äìX‘¢’4á3½é=¥vç5ãA2ôf½2QOì£ÈHGñYÓø 0ËÌšjhÕÑ­V¶šHØ6ÚèQLì’ûóái®ì6ío ñ™lâSÆŸ¥uÕ6HöÅ™Òçºwäº=W_ú'ìsUûKû¡æÇHa˜R&Åï©Äª„9Œ°Šþ˜D sÞÁxA(@ V3Ù„™1Æ4£’õ2Yſކ¸‹*ïLþ¤ü_¯Â·±Ãê8¾¦æ'ƒ£¹¿ƒ‚_%0±-’l–·jÆ~Êo².yÃWucýó|®hæzì=‡ñOG…JE)À t9r^*d˜6ÊÓ?Ï:ô'ØõÖ:/½R´«ÂõèÏk}pOñ+Þóâ+x_“-¯—þÚ Ÿ}4ý6ÊZY ¶ËCÔ¥‚ÛrN²oȳ78OäÔ§Í‹õR©TôíCF+ªÇÌç`Öy­zš‚Õ7ÛÓ¢'8ñv—P§’Ÿ®¦ýíIx%ÝµÔØ#©!6•N½Ô™£ÐÌd/… Æn­=w©ø¨µöx¸èI@nf ¦ä7fGF™OÁ§oFÏäw°l/ô:åé†pKÛêµ$wIx]MÒU5ÂØ De´Õã­êÝìö†à çxkÃMvGH0ö÷~ˆˆ7â:j¸T=¦p:£’ôÛOL5Aƒ#&.H•ïq•ÖVü‘JdBº#ž£›y.(ÂÝÏ­ :ƒ=‹Oò MDÊkR7¡§Œ’ì$¦ÖºBGTâ ¼­‰Z'Ök O>lê EýÒ$–@´ÎnÁœ6 8Õ4æóÅ-¿YïÏ€ËLå\.=›‡"‘NšÆr¹½ {ot®.ˆ¨ pËý 1Êþ®©j4MÛ-e2QÙÄl´Þ¦§·¢™@š“–$[£ã;:C7FlOŽ#¤ìÙúÓ4W çbàüµ™AmüzDͱì/øÐètíïäé…±¼‰­7ÅIýkõ×·°ÑÀYºu€–ÕL«Q Äêþ<½N6XÞ‹‚Ãe6Ðö·É]ã龤Ô¦æ£åÚrÁž 5øÖ( 6ða(/kh˜vV0[ ¹ÔÃv޼»{ßíÚyç’ ÌŒ;aÆs>ì íű›Êòä*‡€å/Πi-©ò¡GB@šBÐNG•Åümãø•‡Z+ØÛ¨Mä.ˆ9àDP³ž|"Ò›Z|c‹•x ¬±qLÿæÌM֟ܬ/wË3##Ï—©|ä †¡¶F{ ¨1Ÿ@ QF¶Ò·â_‰É­²WïHRk -Áo ª0²NØûz¿yáaÉ0k—Û®3ƒÉÖM‰Ü?l¥·­®§=hk˜a™â‹RøîÌÕ?uÞ b¥T4ê2‰­˜ý®Pj*ç‹Îµ!íë-ˆNH±KGàÍìÕûu ‹¹.Ò?þ:o{ú¶N²e­Âj$AÎ ¶,Ñ"E ~úCæ k£XŠÂ ÜáÆ¾ >LÛ·;ºG~lßù‡‰qJwÀ[?dzÊ,“å}f·²5½QL¶`àâãÅo±ÖǦê]û¨êØ3ûkwî3 Çrõùð!jª.ê8nS½@±”✔LÔ^{Evx³/ØdIki5ÜVÑèNéÅèý?7¨= (ˆ’ žr¨zvX…Vü鈥;øs¼¸.ž÷,ÍE¨¬<Äð†‘L¢@µú\Ü^ä„/©›ðS /ðc.fè„уó¥ŒFQQ¤›W€‹~þûÑlÁv¨À2š<‹I <%Ešj‚ðkÎäÒt¨çéo¾õ®W_»HöôX Öï>攳Ҿ¦ b¢&©1q©âüK… ¸«Ã]”õe•ƒ**.„q± Ç‚ÏÛUÇ(¿¯lý!F< 5ËÔF¤•“GZp­Sí6¡Ÿ—¥f#üþy¯8W›Çzh^šòYîÕîÖµáøÂC•÷p¤SÍ<ùm¨þçrÏ"®!Ïc  Ai_<×«ä´ ú SÓE3öÝß’¨µY}îèËtþölŸ;OD]mÉžxB}¹F`kn`/…œ(T¹Q^ÙSßaÍTô/[†¯­ „6U™u>LóãßÝ‚&§GY*e<3zvÒ¯û¢zË^Í *pi Ž»v€úÚéۻǗÍl×ú˜IA=£¹Ãûüìx뀀ŸZ~Càbê„_¹@GAFã®{½‰¾k¡ãÊËê0Œ{:â°'73*ŽÅù$´Ð•>ª1 –ÌÐÇ (q§!ÈÛ…¯àö |¨ã ,ІËŽlž›@Žã?µoìMâìÈÈÝu§àíüi­c{Ùób†"¾h9·‚fÎu§qŠ!lpO„%FÅ4‡åK'2fmuØœBô±s»óʼn-¥<©Ñ5}ÇŒs)T¨:¹þÎNŠT Øè¹7NjLFÖÚU®­ù¤™x€,ἤŸkÝk$õù$œ…å“€²Iõå˜÷­å |–°Üwû<½û`Cåt+©éĽ­Wp^ \:O&!CòÌЄ1®7¼ï!°ðìôpç%[?ô© ³ú½ºÀáUvÑ´êB„´‰-CQw³8F“‚:ü÷ïo¸c³ZD"˜ÏÏc`Tîä$Ü‚÷…A—-³»Å ¿bAHµ7²ž(¾ª»ÒVžùz)ëhœõŸa¼e#Ýmtä| ÿ~ ìWéU*÷à ­.#âh àRï¶ øsÇ”æLÞvJÅšïÓsôÌ\Ιo˜ã@çÓŒ#Ђ¸Rc!‹}"Áù½í¯Yi:Ùî’Rûsö.»Ëu0 Q^ƒµÛN«?Íòvoî¿üºzÍqCO€,@°ê:uí7y ±w«óü1U³Î7¶õ©)Û:ãi´Ó°AóxÞt³ÕW¶lBóýOj”¤5]&9©ýzk¨Pº»öÇAs9šÀ]z´„9¨Éuyø« ôà$¥ã'ÎõÖ¨Óÿ Á%ýšÐç¨"ƒõ#SP÷9Æcª*/àA;gÁ9Ðîägæí}Ži×B!=·mVw'5¥ä­a&{6¤&×-©|½‚|$ –ß,Iä’Þyyþº°qJc¯_Ñ[;tëepO±¤×)ûvG‰B”ò«BìÙΉá¸jØB$ü,œJgstbxH€:è"/¨¿ÛÜÝcŽƒ®ÇÁˆÝ±“2S^Š*qù¼§W&ÁÐÌ=¤FCê A#5å¼—«å"¾eÛ=¯'/3Xƒ¦M—B¬}ê¶›&ÍnýÁ0‚{©Ma„'–»”aÂsÞ¥9¡°6Æ× Að±8ÑúlÛÁGWüi*ƒD^½V“SE笫Ú.ô½uS\ØÕ¼1g}íßi+ë—œˆɪ?Ÿ?‹ãOTxÛ‡ÏÈíÉ ¸6ÞnAlÕ+&§ô /‘}ƒª)pmþ@·ùĵ³¶°6æu/Óír±Y¿©ZeH¿,J¨Û”г¥ÆŽ]SXÄh¼ë‘ŒÙ‚Ê÷ò$!)?"‚ù¬MófJ3Ø›(O¼ ­«2*Á¾zÔÝ™ ïßµÊ[öë°šEw¤Ô‡ÿãÝiâ™ÞDè\ÿ&n'FbyI5ÒaÄMŠrdæûÙ9ÒÜ·BA± ~ÿLÿœpx`@é%¢óÎhkÛ3vîÆ‘’)O¶€sÀ왋kÝXŒGN‘ɹMùA9’.Ñ…(“})wƒµ•~[I&ë a˜Ä"DÁ²ù¯¾Ëö9ªÂæ¸Ð1Åx!&ܹ¤ÞÆ ÝÓ]}װσü´w‘‘2®Ø![ѳ¯n¬ÁFriD{eЬ6­‰CŒtwŸ™˜ÕðïàÍnáG˜c.^+WL’7öP[Á úYÈ´“ȇ:̬4Ç£GHÝÑÚ“Áf/]XÔæÚõæÒׯ'¦†Cd<¶+¼PRú¶²ˆ—&*Nš;™§ÝvðƒW3¹°¢ ÔĽŽ'ªˆœSv´õ6!Îàò÷›FÓâž”Ú`šNïd´¡ÄSÉNürnW}EÙ@8GYAw¡æuçþŸ+µçÍÔ9øfˆ%ùW5‡eK?ù܀Š9ùäÉÌ”tOòòËOš¶5[ŸU”98ð@—ãqíöéâ|õa(¶njJFíûÁW¢·â|ÎÃÆ¾p§‘sÙèÁ…U_&í Šð7+”ÂzM²} >¼—²¿.½œ§!Ù;^HËÑ»;È[øpšI& ½ ø[‰`Ð×óƒ«ÆmlÆîµ½ 4ƒë¾Ôpó7ýu=øh‚ø0b®¹(á`(|o§ûø¥pP\…ASŒÃJZœÃYM¥ˆNKû _Ì6׃(Ižã£›¥rO¬lÄ ½‘“]°øJ¾S6¤Ç 'm-FÍpÓTãÜ#ÄhÆ¢¾®Ç†€"¶Ã.åÍëè8Œ-*Oe—vªÍ.mÀáNqǘ’ïð‡\$ˆíÒæ‰M‘}$/XûÃM`ÙÝ%çÿ\h·86"™x“mù{õnC&÷Mk…; BÊâ·(Ùl•ËNrÇÒ ´rAõöUW¦\¹/û[kßÚíèÅ"íÿUÙ7Z 74%©Še¥ cX±X¾ƒ|Ž{Õ“È&2r?÷tí€sû¹ WË,_`»-ë ¸¢¦¿§¬Óà Lº­;Ëàa÷Û`[ÉŸÔ¯/àZœ•¾¯"Au‘É ”V@òØ3›-g1³Ð³û®¢£‹Z `à%!mVÌ©wXðI°ƒÎÁøÑJWMTü½×’fØ CŽz4<1 ¨6!1$phjŸá\Ň[U =†S‹‘ÙM¶7aò÷ˆ˜:×[Ò¡jœÙíLŠÖl—ƒ7í‘hS ýÔù”Ö‚þuŒÿÕ2Ñë¯TQÜZé³;á¦ÁOÿÓ}®.ÆRV= N¨a6i‘¯ú vמ*$zû¤ õsý±ÞünßRƒ™”SvDë΢ì`=Ü@\µGœ.ô£*©ÎpûÆ9çh€ñ@g„Ï‘$ë»ûWdÔÚJ3šR„À-ÕX¯2«=€]ífþê&ËI.ï¦te›sÌïbz‚ºMš–µ7‹ø !Ô> gUÏÔrðX‡Fc^2ÛQ»s?x5ŒG³€w*+/Ä(@´®A(%´÷'øR®,χõ/±@îõRƒBÊÉ,¼•"„å]° ¾ ö¿Í÷K×è|Ѳןܖg´9)•~Ÿ3‚ðÖLÝ>XT`è qφ24†=ÎÊkÃñÐòë2Ró#Ç­ÎaÖlÑw¸CE·ö^Þ_¶ »ÿ[qÍê0˜¬YäΚ šwV! ·—t嬢Y¡£ˆ|ľ!›Ôð).#·”S‘³Çïc Õ#°l¨*ËÇ)Ð}ÓWSMF²­ž©Ôæ¤Ãr¤ÐÑý:TÌ<ÝÙs´¾¯Ð%t 縂ÞI) kȺ,ãÐSØM·x×£lÁµõhÖ¾OžÁ˜ˆ]’¡§b®(m’nl|kX-à¼o“-xÄ”°D€sÇCŒ6¿ ¸ñŸ¨‚v72¦—yU™3o‚Üi¸]£ÉÀH ¨üª1µjιÚ^Dc aÁLF¦½dœWßÃ0vã÷…]O·3ÃG]ÿªá+d‚Y…¡5ÇÉyÏ Ž×o#d¹Ê{< Ýnà{ŸXeãœ=ÝÍŠ±¯Gþ˜;ÿ ¾–¤ˆN —OÛ§L‡_rÜ<±¹=mì[Ä+G­ÇXผϟ°KÁNÏnHkLÃ(E剉<4£'uì`Nö<`)$>êXZ¶Fàï}L¢x‘þá94Eþ®±ØñË­ð^ I¢³Ï¨ýÕkÜ!ºzoVâ‹ú…ÞÅ>¿ÇÃOk¹³ôù-6XD+éôs—Ç„(mK(A#ºœ™ª]AÔe2PÜ ­$ùÑ–á|ï²±>èÿÝÑÌðØýÚQQŠD}Í.6ï°#¦J+}J9›Çî]èIïOB¾Ûº)øG ´øµÕTO¾N\çlûlõ©n‚*g²ïéj&K # ›è']¬ÂËÌãÕh"!¥ÔØ ™õÅd=TbÕé¯û,ç9ÈoÙDà Ýê1÷XŸ 0±¥}°#8hç§ûƒ±¡Õå¹3²„K%EÂ"¸ÊNúMéà…k™ÃX¾p¬D)nš×\y@Å øp¨Ÿ•*Ë•¿gÙ{e/ÑEÕë®ÀÉ>ÏÄÑîv{éí™ö¼k9qê•¿1¼%ÇЈË•‹P¬&åúNü¶¹d±ç"é Xü˜`ÌgìnóÑN-;s³¦ Zu7ê(l‡¦éÖ«®y½v §Ò9â¢b°ö`žZEºm¢GR¤IšN°»Ft›u©†d¬C”L¸UsÏøÈꂛɓ ;’óÎM˜½%Sý{¬8X&¸Å¢Šã™O?kÔÄi ©ÈfäclówÚ„ãEâû„ÀNO>f‡³¤'Š_ìuÉ!ZõûlàšíÃ7§ çû³ј‚XWÊ-x|x8ÛA¹gôʧocÆLÙ‡˜ÂAõ.°4°mMe¡MêOº‚­^\hæú)½8ÍCö÷Kß^œ8˜<ØšŠ~)ÝŠ">¹ºÚtRÛz s¢©ôoý;W_ºÑµ`º4—sT»¥Õ6d‘j…ÏÄDÕR¬‰Z ’XâD9_ÿ¬ xɨ}›Ýâ@Âó+ú¬xT»†D¿Fl:*¬:.:RÜ»ƒ’õ/+ÎYuÈ|fƒr;‹‡ˆhÓÊx¶ˆˆrnFÉ;ÃLÒôNL =Rl£ ”¯ËÄ¡§Î ¯cæŸË<÷B%žé/bªÄjtýýc WìÓ©FþôY!QeúÂJ¼}ôJ¦QdMÅ RËá”`~[–Ñà Q§D¹Aä á[>bäjÝäxR¤m#Ây[ÆL‚½äN!¶»[4‘:F`*ôÆpO5ÌVü§û¢ŽHRyÑ{>£ ï!æ ø¸öÔT®% Ýò%ÔäfGhÊÓ.X5§N¾ƒX4ûmk@î#$ÔüÝê®Ô0æ=á¶S½ÅnÆå?º«!f»žO*AÊ´×öB%K®[D®¶cÞÄA¹Yaõ”Nîf-ª3ÅIgëņ¿W9Ícò—X¾pÚ™å6ð°šûç-ûÉ©r$!"°>r+˜L5‰)Õ5Àt ß4‚Ó! ‰¯öⵎŒL±÷_›iX Ï_•Ë"âÊëOÓ;¹ŽÅ·xµ2ß©ÔÒðþ¼¯,¦]^ïÅJßû¿ó“?s*¼ìû1fYúoQq°Iè‘lõn?U/ËDUö!¨ŽS%(£wG€gçEäžY}¾ê—Ï*ýú>ÂÔ'n½àE´nÔQý&¶H]ì$ä3¨•]nMÂuÅ{º<Šè×ãšH¯p¤Âoäå8f{*ÉVÓ7-$hâK Øœv4Ei-*Öœ¹Ëœ‹NYÕ—"ËÍ{ƒÛL1ø]Vú¤å a ä~2$åk wÌ5±îܳ'Õ5«€¼c)çÛ¨MÊoó‘/oþÝK± ¯È· ÈñIxšæžóÀ6Õø*^<}“Æ%lÜÀ ‹#Ûþêr‹3ì°ÌÅ”œù’ m ‡÷€^àvsÎ?£ÿJ®Óà–5K¹"¿(ñ>A¦Pé‚ ”Íá®;Ÿêà¾%µ£e¼gi "ÂÂØS0XSÄ39H~þ?ÿR™Æ¡ €ÂÇÔR¸VŶ‰€³Ôhw¶Ý;׌ݹC,H}œ{„H.|~Gý g{µá{j8’5¿™o ^Ež ½ŸeåÇK­sV(»1&_ΦêNî¢t“#Éð¼ÖÛ[Ú[”{¦1Õ5[ßX®¾˜ªå —‚%ôÍöí4<ßo°ø\–1ˆý{</D›ŒRÌõ—Ÿf„SWuDnm·ß‡ 쮾íÁãq.„Ÿ¨\j,"“X>¥.p«å –YYï˜ýGàÊæ€C‹?XdË£ŸDÛÿáBF|j ÝÆ¨‰â 4°`ÁÒÂÌ"†úxÞ òÃÈšHé¢i,«òvQ(+õk«ZbñĺKªÝ[AØpÈfrð¢Ü•|‡<57«ïÚ÷Û¼È&9ø}öÑ_=ÄRl²%‘ç䑜âãÌgàÈéëܓ󹗈?FP¼A3­IêÎÄý¼Ám¿ÂjØ­ÃOxnÈ—C”·™!:дwË-Aî–÷dÏ"®Zþ ÙEÏêõÉðå(Ê’âí<“}QœZtV‘ì Ÿ†D¯Þ;A±®ø–~Rë¹ ª#ÿ‹€Íyn\ˆžèÆPÆJ}yYÈgQSGÕQÛ¹ ¯íÔ¿R!ûjÅ—H°rø/´ã7Þ™ú©ü³Bå³ÑtTAbgÓ]¦¯O†Ž¬ž/¼›ª¼®†_à6j=0E äíÂz9È }ß1Ö…*´Š"^­vñŸâ-hãñG›©¦ô¢Æy7vÉp*íÆÜ„”=Äa±¢é}ì`<›Ç³Êrÿ0>ënœ²ô·ûÌhó,’¡>•¼”V<‚ͦU›ký?JÀ¸š23Ê}凒Ã;ˆÝ€iY½ÊÛÓÈRæ/nz¦fЈ»Wœ–|ø;YÈaµ+¨^w8³ø.¨b4üû–%"í2É’4=¢®¶èíRùÚÝÄâéë2’˜ñ½ŸlÊPTs šv :’ªþ&!‡q7ÔÈÌ ÁÇ#™À'ÌmŠ0¹Ÿtw¢•” äÐ×:ŒoŽõ’ àè·:M'€„§ :#\­dáÛ:)9ûðŒ*4/Ö‚é@-þ€Ï”Wüê”Øú«¨ö’›.€ådy´Ó(`ÑÚŠ¼h: Rv”¸¸Ö"óCœyÞ‹´ô-¬áÔ°“›LóI°µ¦ãnAjf8Mð7DX …^JÌcU$›ã»D£‰$‚¹òdb{ºÄ3QÒ\LËíTÓ¢MqM¡Sk ì|ß<}éú”,ðèÇT'`/WH Q«sóÅxÖäͲ`|ÃJ1üÚ'~²F`@´º=—XvæÙ9±|©pÇ=—þòÇèt#Á)û¼IÞuÏ}«2îÍUÇHîîc´Z˜N§YºOxu˜—_FÞçé‡NYy¸¤E*$˜ªÑ@¿×ÕÒø+Î)c³îV¨ †Ò: ¨ÌaSµPÖb¯·x!šÂ†ÙUõO˜gvÇrªQ™ãN'ùë JöhHÔ:±‹^¹Ó¢‘u7ŠK,-9k+“µí ƒ3Óf‘tmzî°»Ô¥âüø—ïMR£Í—øùœA•éùt«†Q>‚x°àÉÛ:űbÌ0±gÕïî\æÁöÖî|f†Ô½LR|(ÜhH„ÊÁÀº3!©³ÇÙºè[N£Û[cÜäG‡9{;îÀýýËË;­’ªu õõ쀀>§ã¥dÉñÙNü0’6βܫMyÇBu6®9¢ßí³È!=Õr‘h¥e‡#ÅîÂèµ,‹¤›kpi£±Ë[Ä8ÚH^Ï·[0ºî‹Ë 4É"ãî·œ¨ü† Û 8Vo/ˆØ{é;`qEd-_‘2?ÙY:P–*YKœ7IX­—°›©è6> ×5Ò~ ª#ãì ÇXAçümG—c÷1Ðð”ˆÑ%Ù?\±¾ŠÄ\mBN@Üc^#¸ÕÁúÖN—SȺڊ~ú}ñÌ:iñÇEyÖ×"7WI%kSó~Eë£Â]îï÷Q©aié}È w¥kŽHÚ©PM¯GiÚäðõõ S¨]æ!Íͧ#a(ÉQ!Ë\egdê’1îd]¥ %ãaítfÅrÚQ™czAŸ$”„jÑT¶ºÅóv†¤dò|v–gå|$oõPÕòóy•³º4EÉzÆm¼sGsÕôð»x¸Æñ?l€:$Q k:ÒGw‚€{&¾Ø¯I%’¿óøañ8+mÆy¥n’CSý!&„ª\;$32À^V±Ð°¿XÍ@¤Ü~Ÿó3¿>3g`uÃ& º çž 4øhF&0eJ¹‡¦ª¦¬üPýÐ&:yÉ•ÞïqBº3¸tÎjX‡÷FÔ:ÐJsïâ7XÜMüåöNœe§³j]°:ŽÁ™ w4þ¨g‚¨¸èèÒ~ó7ŠÕ$¦[0ô4 ¥-ÏZ5w©5aÔGY/ÛY â4M—Ó%²¢Kèm™Ë-ýB\ ßy+]7Ð}ªOy‡aïzЊÿˆJNPq +mn×UÇêb•ç²%ë.]Ô—;íP® äùxK\k *Ñi­ºo3N u÷J¬*òí¬ÓênqÚhêû„™8¤`E^¨k¥¨ï8¹ ½Ƙç}+)T¹j^åPÂ"Z…7Š™¶þÔô!®s¦¦7sÙ*~4·O¸ãj7õj>”ÞÆžEk"º§Ñ~ýÆv¸íaV êœ{÷GÊ·QňµÂ”õŽÒ³©¡h6m2QÌñp—¿8Í5b§¬7²‹%:h>û´Œ>\/fß„´r&">ªj ùÇ™`‹ºoûwZT3ÃìßTS9Rof…h»¯ú>>2îæ>Ìm ·÷×ǵwüR÷u }qŸmÑà¦O÷¦¾ ªÊ@ÚËþÝ·çQFëy.zcr“#¡b^¾†A.1„æm2¡ÜSº§ÎÄùÔÞ°†DÔ¨uÖHeЯ{ÕìOKåÕòdE¿€ØVyÓáÒ¶*c8KQL¬çÆÎãÓ±¹ön1±f…¶ƒ _8C-^Ή×þÜ-“tKÁHF·sa Z¤}[Îr‚|@CïðñNp?*S²ÄBÇ®Å3¬@ÂÀµA>J3&)ç¢)r1¤ÊË/¤®B‰ûNcÖÀ•ÔãâO`ß/d¥!6y’Ðß깓TKewS·˜À&ÝÒç©Ö¶ß² g†hµÈ ©ìk²Û ˜÷U²0I=…¬ÆåwaÈ)dVI׸D‚3‹×ù'h.NžÿvW„£>÷›‡"žÝrvÃ%IÓ†ÍÁ¼Ô¸‡éÅÌ¥dgKÎlÙn;¶µ?š«òr>˜'­£"Ÿ·kDâÜqàØgÖ–ýÈy‰dI¼gw¿§º,ç¿* rZš™» q;qá÷2œ§ÒÌëèa|sªEŽi¼èýÎì½?~Í>“ìMô^o%¾¡Ú¿~ )™åH”ÆØA2zPl°a‚"¢.¼èëi[¬¥kôÕl½9:@ÉPÄ*qc.§Sue¦ÆöCht§NÍU«¨S=²M´8Òß¶iÚ¾CšYÏ–nM—ì°?„ô ~U—áÒ ¯Y¸^‡ÑZ éIÉ{Kœ XéY¬-Yò¬É¼y¹ê!݇ÕY(¯f«¬0g¬/Å/µèÝ 9×8YôpH© C„‘Ÿ'd=²¯qÞj8—:R3Åd¢^;9ÓΟ$tç럱ôõÍ`çÁ5òÞS×xyÞzv‰L4eÛÄßÍ|;¾¹§b1DÚfO¤SäU‘²yUÌŠ-ÑŽ »‚]ºþà 6TMB‰±[~Â칦×y¸6=έ•XýÌQ,³Ü^pä‘Hiä–£:—ÙÜ %¯B(Øùp¿G{H¾e\&â—MÎa¢ºñv mþ%彊‡x¥ÕXÞ‘• U)UdaZ˜É”—A´’ß¼¦±Ó o¾ ޥǔ§r`î…ž4¿w‡K@mÔšåˆ.ß8oƒÛÛ=íô. ߨ›|E1œŸz%wÜ fä§.ùømVÛà g_o°¼3²!’9PÑïØ½sr£cŽ3Œ-z 3 ª›±ŒNé*׌³‡ØÆ½hXîc QýEÐÔ<BŽ'÷Zþ…¿ºÎv i'Å[YmçžÊìIÜ%¢Òï‰)À©¥»4)œÕ™ægê°Ó…à‰ ªªué!v ÚÐ ñ¢s¬m¨L…•†Ï,Rðeû »zrÈnicUâ~¥ÂÖ°T\ªS,n;ªhÛw;ìÄ‚!÷»Ò'®0“¥­w¡–ˆ’F{¨?ôë'8^k7„i,æ®uGsZÖÞþ1€N݆Ðú¾­w­ßBíҙؕœßòyl%&ˆ²&éùHãiî­æüÞ•5®Çô‘¬ð Ž4üh® —zÕÉ+­´ƒçOœÐ$Én(xNÞ¥,”tú)*ôjp2Gu|ÏÛ‡&¯XòÓ¦Ë<àPÉÛÌž¶ p^|£ßºéÍËTíÕí—¦ñÙˆ»'µ­?4~Z:ól4ïvM¼ò½¼µ» ©( •9ÒB…+*¼ÔþkT*í!{Gm53:PÎhx7E»Û=x_‚õ'2÷óYzuÀ[-ÊŸFÿ¥zßyƒ¦»V¹J2œÝ½¾xÄ ç™Ñ1®¢¦‰ÉÀóì[²Møn•sÀTp5U7°)ÚAÿ‘‘P>uç‰Òõè%~êçñdÔ¸jÄ5[4ïXÚÒÖ ô }fn;•½§v1ÛU1_å³ÑV,‰ñZò“ž³m_@/ŽôCh(µWñ ÔÎCªl0ßOøÔýeöÈq™×·Íµ\h•¥¨\ ó«ûÌÜ…ND7X„l¥SÈnü#+'>—¹Õ"UÝj?­ÒÏ€Yíví~JØc3ÇÕÐqQ×_ry¨¨Ê uå˜H³.Ý›yÒ»M%8Àaiãs‚ /¿ô œsvÎÆáÐÆµ$¥Ì·ª~¶— "ir4‚Ù¿„‰×1WWÁâ9fߨui(¯Òwc¤‹·í?¬\#§nkÀ ô6øõÚÂß…†Õì†]ïƒ2!nóÒ$ìz,BsPÓÆî~ŒPr £ôðnu—‚ÙÏd,=ECÁí™ó +3—’ @‚Ýúþ‘©+|ŸñvɆB5º³R?øГ·ñÉäm%q‡F›224ëyVÕ‡óÅfç7’{âq‹§Ä×ð)i¯¸Å tiF„í‡k¤—Ûྮ…›É¡nüw,¸ºC…E`èD»ãj84¸>±Yµ%æ'ª˜Žˆhüaa†\ÍF©ø€õ¯Z§T~˜I¼Í®ÆÖ'¨JŸ”˜€“€¯u§k4i]In#݇oåšXl0*v=¬Ff=A꿽¬¸¥æ½#¥Ï2]|Ù=_1êòM)J+©Pƒâa¯ ´ïŽbt«&|F^g¹Љ)8jÚ·7Zgœº8ärØQ³ƒÝêQÍ-Œ šÞ#~ -=õçN)ãÓi»(¥¹;<”­õ×à©8‚ý>•’9TÁ™M~ŽžÚØŽüÎö`D?c¯Â¦^Oz ê:9´÷Þ!H¯JÊ ¸~^³ZdݱүU×Iyj« t&]½šONݹW¡Õ[ïúˆˆ”WÙ{κnOï¾èÇ‚§3ï]C•©WÏ(­¼%öÚF/ϰè ½—gD´†õ8ÚMÁÀßþŠÍ]o»ËtÕGa=<µ‘–÷Ñ)ÎŽmyÕ&!áz®hÍ+ï«/ãð_C.1úÈ5hÁòŠküåó“þ|;©oX/CP:L Á,؆üç2’Oº0%þ6½ý9º J®ÞK0À_Ãö‡E¤¶Kòßþiÿæëµì_ðXG‚ÏCš“W/æ-ðW;_µOS…ž¨z­Hø½I©ãUÔ¶€W€´Œ <ÊF³K5OâxØ\êŸ)u÷1Ÿ†+‚y”ÖÉ?p O­ ¼/a:6’¼gµÀ45ÊV¸¥””–I©û(¹8{©'j;·àë~5‚‹N=ŠT½£®t¡ó⟰£.he`Û $…7kÍ$É”9ù*!;;53~(Òúp‹Å‚‚½9íï·Ñ|Nÿä$Ÿ¶yr\WO³ëÑI"jö±IºOb=?6-*EþV¬¾T8â§Àä„jËÊgþ…*Ð¥sÎu¶srÀÞºðÕN°À»­€âY@xœb—…Lœ#BˆKf0Ôc^_ [Ò`úÁ^íÞ¹Ãüf¤Ÿr™¥F(é—H¬…,@à>˜ù0±È ãYJy;—+·’ƒr«ì…¸$ïÈ¢•ol ƒ:µŠ(Oa€à/ Z¸F³í¤ $×çÎÀ ò+¦:žç´‚ÿÀu–ê¥o†^L¨Ó@ºy˜ò¡ÖD<ˆ «‹’¶¢½Ø™u&šóbtƒ?t­9b|¿…´Ê½,9|ÜÐÒífµƒÐ%ŸQ–å¼iwõ|c$ÞÜ fææ*¥ †,}µ^Å<ôöˆSp¸‚¡B,Ç›uóú&Ó³tºK?c¸œêa¹G@éÑG°‘­È” «êöu‚x,j§ ² ±»°.¶×1žº'K’™K/·ðfŒëk ’˜F hkò,cDò‚ž•¯Sœ@víl¬v×"¤Õ9èmBªUSºŠaz¼ú©KlRÝÉŸpâ!×j‘Ë†Ž¾#“-»–sÝü´š åcÜovÍ:}ÊZU´ÊÂÁÖ*º‰í¤áZâ©âå;õ°fpšÔ¯JÝD⸿˜P=aPŠÞ„È÷×~œÆ€ªA~eX¾ö]ôës (ÄÞÒåú[€iÌ Í¡P4´$ùÅìò¬»à!²õ†°Õ˜ Ý“h·CDLÑ«ø"G"Òùj«e(²¯óÙÿP9ÙÈ‚ª„)²þSÞ³ž»·Š@ô&Q ¹‰ûŽt ±Í”ßWêóÜš( j €=l^N³¼OAL8àgírAx8PÈQÌ÷×1Ÿ‘+4ö%Líb½ù©OAk;×Û›çÛâ s¼ó-âÿ-äùѨ$©N½Ã{¤˜¾½zÀƒïÐþ{Wu"áz&VŽÞ¸ªßí鈢ßR©ü$ GPr¤â”×rÅÒe;ð‰èÀ®l£6ÛÀîsz»Å•ÿh ÃçFÇ¥¤ü~,ÎÃ~­ÍÚ‹@c^~&Ú®¯ÉÐÒÆÈ•2 åAßü [‰€"¦Gà#6{mnɶÙû¸àܹ`µVŸ}sŠtíþx—ÐhÊ0ßa#æKÃÞ s~(ñ/Œ¾œ×MÜadnÃSËd@#[éæÑ‹ºš'ÉÈ“ƒÆt;˜Â(ÃêKv¡áò112ëå¤'èÎëQýšÝCÁéL‹c£š¹Ù&,;½Üi¯"éxœbÍ@ öõ-«Öò]ëȲŽT‘ÝÛáåÎÕpXt! Ó/$…§ OGgMäÎTX_3po„£ é¹åJ&ú¡|L’u{”'^§ÌB‡ú¯ û”ܱ$ýF°7«ß ° îÞ«(É_QŽ êÌÙ,’·¿íØÚG½¡s½US7®r{‚ɇâ½ï/þ†û¡Òù;„Í‚ý/Žšî üH<¤s\9Læ”eç– ©·º˜ܵF0v·)Öt* ù€[Äî— f+ÎU– ƒ3wê?†²; ÀÝ-›8-°UÜí°%Í.¿ù»¶Þ1v8~•û¼%Ü-KnÖf4KÔðZ°)}AªOûPPˆ{áSVæJ Moòé R^!ô]i§·Å]Õ?ñr~¯È&T œ±%5ÑDÖtž ù©É0‡bþÙ$ djòikXj>ÉÞøÊž¶Ž(‡{ŸçÅ×IÀ”Ô…¿Ê$>‰Œ%Пvë@L¯Þ)ÆT™Qb t*Ì`Ú¼3„„"ÎÛÑLw¢~µpˆ×´«Tuîj_ozDË÷›~‡ýJ9–ÿ¨Å²AKnA’^„.´eüªÒÊOñÂ%&ß|êæZZÔs'¢ÔÓûÊá0Á\p‹ôO;î1M ½HáÂã˜Î&›éU¯žÜ¤ ö‹I¾ïE¸–Š.R5@ï‚ØÄQ#êš Â–m“ÔåK.S4ÍZ<8;>x%~H1r•Øs˜oœžË¯å”CpN²è…vº¥L†«7æ2qn¢¤vJo]Ú¢õμàó!t!YéRN¦!ýsçò‰4Qx­‡.MªÊp^rá™I¹t#>œˆºîl^Üj|äLÝý¡G¢2ÅÞº5Ö›@·få°‘vó¤ŠÙ`”+ÆrC¬ë÷!ãó†Ìe¥0ËVê^ Â[ÁÆkqüJ‡‰Oñà¢) ªQ[Ú™ÇËü`ÈXîì!%-qFéFê@47ƒõGH ¯Ææ6'=U‹,»F(ö(z¼¼æìvþÍÀy5øŠˆÛj C½ó¬_L‘ÆL3°!Ãlf*tî/¸Ö˜:"™Ïí_þCË Âðå3BGà¸Éï>EªŽ¬'žE&xÚ¿5þR²ÝiÓQè˜d „)œÅ|os $cp176Z)ïΩð™+™‹¹ÃOz¡Î ~à< G‡†8yÁe¶¥ÿzû¬d¼‡¿§ä§'Û ÀwäIE,ÌɨîgÄEëÜdD®#ê¡åY@Ž>‘,…" Ua¯’k1¼Xª\M馯ý€ÁâãçËú±A> ¦™âÖ¤…gc@v¨–Žô£¼íÌüÚdgÿËÀà*©^âê ïF‹goÞ¬5/ˆGlü‹>ÛfLãb™Äå…ÏÑ (É?'ÐÈ£m˜6b ^‰â£³*ýo6]„5 ´ £ÒgbÀ«Êù!½c-è·Œ+¬’heÚmâ€ßÔ„çA=±È1e˜‘š<$8Úš¹ó§¯Ýt/ˤÁ0ç6æeøËc1däáÙcbkL#ÉUTq»21uA®á𵆠ë\S¬À<¨ÞÝXd™™ºü †N4Ùú€†Ç;BïfS.»4û#_ •GÊ¡1aå¡m ~•îOÞ}œJÄ-*×òï÷óá¡'Š+²þ]GJ…Søeö+®Gæ97”é¶Šêè³j-ÝñÇo7—€"j¦XÇÅk¬|¥cˆ÷†j)ÀÙóÁ3é:¾w>¼Û§{;/xÜs¹V€¬Eî*Ú¥ýžüå¶ù9 þnNÝ?©¤Ì+á3¸1žŒÉšã{4)´õRr¯¾)[û@^‹BëãT~jF˜ç®/;]Í?3ÕncÏš*@K=C‚öƒ¨(ke‡_hº¬À&diŸÓÆþ½tBDw¹»F`=eÌè%rÉfÜJ$l@H4`7ì/žsîÝ“t+› íÇÇ®šÙ¤æ|ã‚é%C™ —ó|Ô®aJÁ6dÜ7ìe]8ñwa·ÌVŠL‹n ‘ôî¥úZ•«a-Ρõe fðï?Ð6K1M»?%BkWÈå˜ 2‚ Nö“;êƒÑn–¯¹£­¼“ÈT”V`Y¼àõerO¤˜iA% qzKy?Žhq/¼Î®»–òD]ß~ØQEk‹¨î%æø(Î)5^D­&ŒbI i¦þ.t&ÚÞ˜E¾—i¼…݇ö ¸$l ¥™¹' ŒSÕÊ¿·ÐQ$œLLÕ'â!œeÓÚ0+y&k¡ifŠv»8ü¡ñ;÷TÒuƒ—o7Æœo£ƒå×ÛÝŽ8õÒ„¦¸áh5d–$ižGÆì]U2Ìdæ™W6Ø÷qtgÇôYDÐ=ʹþTé_éÒ×E¦R{DÂpòpIF¨û#ç0ËàË i™(T/tJ<3öÿa€ö™…AåÂ:æu@ ¯î´í:—áÊ×#ä%2ëÀ¦$ deÊŒ-Ð ý–z¯ßæ)ßmÊÆñgñ ¯™[¦QW½¤@°©ø«Ë{z¤5BCªÔ ¹eâ=gd6é-ÛyÌöþ§@è¬IáÄe‘X¼”*<í»ó»¦\ø«×K³'ƘâDÀ«‡žôŸöf²~✙ÁÉå.Õ½"”5þÑ•ÿõ¬n$BM´ÿá{HñN¶4äXƒûFZË,Þ5Sä/GpñÝ1ÓŸÄ+ ÁŒ½ÊQ´E1cw™@›z¬’&0±¾sÖ®â7Ÿ:°e\ˆh¥_æKR–Ò É‡Ùù¢ÛÝ4¨|ò@µöÅ÷vNözäôÒx¥DBµLˆ0vl (ÍÉ’*/´Ì•dð/31¡êá'VݯÇñÅëN´ÓÖcibïvºÕädqô Ý”"*$}ب‚œ:œ¡·8#T›k…W€0ЊKÛ»–ƒƒ˜(e„5ð#¾ƒ ^NåZi³2.Ÿ50÷{¹N´˜Ð#ŸK…~–z ”·»;`½½ÔžIŽÑ†õ´¶ì༟-`Na´«#Sº¨vfGØ\; 1ã±3`J©íÙ£V&¦b ./Ýùû·U]5ÔUÊV—]ƒÇ õOSøÀ* åžâš"íI²::F*î:Ð"Z®Ĉ…€Bì *1g»RW¨ºq¨T:™&o}íý;Uéâ–~Œ’Ìy3.“c~DÚÔÇÒé_+¼‹ªNàÚ"– 1*Ðp³Ån…ï©–2 Ô7wÇb›"„{o\ûZH‰8ë’Àø¸pº §¯ç-H£×]QÖ¥àºii¡"^S6ô°µf¬‰0äà{îMh# Q\uu\ÆÝu8!Ü"¿‘«¬LS¥á‡îLëØ‹Š÷Ÿž*î/L[ uÉ´Ô%àW èz¤1áµjÙúÄÈÒêøÉnm†Þþä#l±ë/§5 ¿e]>´¨[,}b$˜狼ÂÒjcÊö9MÐKÀØÍH–UASps 0Ý|B³¿+ÙÔ.öL2P›bÏ&3s€†ÁY¹=¦³[Æ‚Šyg¹–ÉÕïþ5³€ÝŸÏ|äK5ІF’°™ɱ ±a”¿a-mbìAq/Ù‰ºÑŸ}}i0Ø•êCZFÛFŽ/?Ãê§QE}Û]œ£jI’íÍ;åÛèf-u–v,¾M&Ò3Ôï`£± 炎­wçüûþ>x”TfD:[7Yb ù× ¯ñKÍŒ$+^ëÆ†9ÞÔ½ oÝõH}ùêmùÊ8û( Øt“xÆ©PÆáðÍt6­Ìî±ûïÖsšKŠü®èÛP§“ƒ´eW|õƒse=—ýŸy“˜ï÷ùfÔV±¬tû<Ï'‚ËÑd˜Ç}Lðé^ä¾»Eþò¿&à“]c4ƒäÿü̳¹ÂbÌôŠ>BDÀfglûÈRÌq“/|Ý8M=!wºî]ƒ¬XÍ×|V‚ÎBköãd WQólð)ÓÞª™™<Ήj1¥áÙÀúñAû­› zÔ‘8ÖÔš¿ÑKkô1°¼sM–º³µ|b” •ä Ä3(‘Ti%:8-žî®úT(º9öÄ{è7–¸T½2~ ¼y꣥M ½;wUÝ?‡lÀ«I±2 “õèÄá·=a,7-˜yžÚ¹ñLÂÞ‘6&#Þ{?‡ÚUòð”¦4Ls‘Á½4¹~š¸LÓy—ŒÅ@[Cš1Kwgúœ°S ÓŒMÃ;g­”ËRÿ𔪊a>ó1ÇDbÄ/grO((åÔËp°Î%@fXè®Ú/?-ø D£–ýÉ¡oÐR#_à¢Óœž½;Ü”¦œó;Ç+Þaбó™/JÎzGFæ^S‘Ø­ˆuƒ0g¿Ð- Wù‰P3mƒ­¦ÔQ´Rvþ¹LV h4÷ Õ¢|ˆTd8¡ÏªAÕº6´ Î^_léŒýÙõFæëîÅ©ê XÛ‘ù8‰~lcÿÊšûF¿¢)ÿêë r!ËÜæiÜÙºëZÔé¥Oa'zKäôöXi}t ÕøÊD„Ó¼Ñî(à1Çi(å9•NXü£ÜtFÿj³¬ÞÛ_ýq­îKB»¨²1«€©!† £TC…÷ÕkÂA3{É÷& ïtdܵöã J†–ÈÍ2ã¼C)«‘h? DP~¸6*(_þ0ÿMÐǼÍñ¯Åvt†Ô)zCóx쇊I »VvKŽtµsªéA¦ý¨L)LSH:$ÙÙÅLT¹PH{S@-½Ý£¯'míã÷ §UеÃomž2ˆ*¸¬é©D³QG<Çôà3>kHI©­¶ÒƺÕÎ^ã¬:%Qºã°ÜýèHE¬U óbCòhÛ¦‡8Ì8ì;¯—³×Ä]Ù€ºÂCç0°Ù_4À¶Ðh5nWØ2èŸîØÑù¥|æ#|&«Ç\M-õ åEœ»…5>›,AqX±g<ܼÝ./ï2¡4ßß!ç"óŒiÓ\d›ê´Xá^qø#6púÜ?[»~=åínÆå˜wf­=]'ôÕ W’ëôJì_®¨µåÒKèqÈŽPÙËgwò«ñµ‹ ÑWÃ;{IH¦‘÷»ð{÷öù´‰ÔÖÍ·‡Á~ýz)Y‘È`bÝ¥ÃôÛ,òË5Y”[˜W¯S©©¸O¡}ø7Aí_‚‡¯tI??”¡s¹áe¾¥;Ž)dÑÃ‹ç‘ Ø`t³ˆÌ¾3¡{äÚk£hÑÕKZÇm…— ¢:2ão­½‘ÆtO– ?ÙÁË«fÔh°ýý”ß?À"¬Soñ"€æê¸³U£ò®Ç!–ªàÐö)‹©2]ÿ`±:_¦:Hø°`Wv”à¹B]a …"+´¶Öæ((ÝZ¯Oï¸ÉmÂJÂû+M´$È ™—¼ÇõWEó{s›’¹™¦|eÅ;Œ¢?r?•¯Æe}–9Å{¯3“oùî68UCè )V¹™NG§ø ¶Z!øÊúRk…ÍågïOyqõÙYÃJ~„ÝÅ@;¤>@_³;`³ Fƒ ÃP?‘’]àwvÉÉŒ7Šy¶!µ:ËE‘)¸¶yh 器0ÄbÊ/„³H¨… : ‰é˜ºŸk賉^_?dÃ`ë=*¨üÎv³dbÑQp ©5ÐnáÝ VnçŽF½îϹ l˜@‘Çë7 1FnÉþ>UjQë_-å×,Ŝ鸛Ï0gÄqâƒ}yä•€x3“ŽžóÕUƒÅºÄä¬O¯WÔ6 H·ù÷vøøF´~yñäàÄÕ#û…ÝöjßZödzêb‹—ñ»-v¡MëOùYVÁ)çìEüûG†1¶%«Ó<5æÜW©¼1$& rS×û Æ€ë 7´PÜùSiõɤn˜äh* Nй*‘÷W¦ë’~óÑxÓ-1¿Ñ; ƒÖ.B±(ØH¥ î%zÃ@W} †µ3#;$ݔիU~ æ·‚º½86@Î ïëYvjÏ8€XyÂà°ñÛ*"ŽÎ<ÉÁè]åUý?tîv _ÇSù&í(>·ÞIPùæLÆàë&nä<±6¤KHÙwë7?ý0¼oJðšÚõτ#ÞjÕ|ŠT:n|}Ÿ£ÉáfrùÿìØÁ¢N¯DŒ³“ó=v.­;¿(ðõ(lÛH9é ÌZûBî ü¼ÔK TǹÓî°‰6ò:ýp¦uDð¥hùШ !7`˜¿ Ñ(ÆÕç@×™!Óa®1µ® uu˜àÀ?dIvœ¹í*ÌdÉ „©bLS…F]8rÒ,É;õÓL´hu_~áN¿2gVÙAP+ôè-`„ô£ʆ²Bmi3~‚"€4Žd¤#WzX£Ó³°± òôðg%:£ŸìÞäÒ`€¹(Çãà‰qÜ$4›Ø²ª™ôVtcñ¾:;S%9#Ö –¡ J!ÔaÚA°ºòÒ¶2Ìe:Ë^f¡¬¬ñÜY’º-÷Iã˜/Ú¯Âwwß"«Zqùã_V)ýúPÂÜ®Ô&qµ¹x»Î[DvAÒ&§Fk#èÝ)Çqs$Üùe›9¯FÎÕ´þWn€ú»™ÁcÚðÔ³Qå°lÖhàÁ‰ß59¨ý’óõ*æ=³N’ßcjq°2±5•\Rkï§9_äÒ°f%aÃÒ-䱯=£DXЇ0¨Q¢ÞE,àE@E³bQÓþ$Hâ‡é·  ¥‹,¡ÿ‹ž¯˜îKÑ=J„¤¾fmq`ûLE2¶ˆsQ—^m˜ÁdŠe½µuXÜz$4¨DycaÉUÜr TjŽØQ~€ù—©>³…Ùõ»~ ä}±Ôõù•NT-´ô‹±ú”pº‹Çâኈ¿e¶M“džãÂt´îy»VqaƒË¥Æj@*Â4c—ŸäwòšaŽÈ§+Ó¥Ðì8”8ö¤?ÿ ^2äÖ†ø¦Ê…¥ª+½Ù³8p°ëx+,¨Gncúž YÞ~gçíðÃÌÞ=–ŠÔÁKH‹Ÿ¬¶ý´¬ËÍk€™îÏ5ì™ÔxSÉ8\LÇiØã_¯É€ÕƢʒϚ*)Ÿrl= ÓU ÖýwùØÄZD[FãuäÎ\‹`¢æW äaUBɬ\ó;\óÚoåºS‡á¶JÈŽÝ^˜Ì㫊õ·Õ 4D Ì~»&ªTñ©Ö@%íµûô—¥©ïPÝ&³D]—UàÓÐ&IŠÃ8M¦×®»uÔQV`Ú'×mÖ®_ÄGp2Š´ÊMs¼;ŒÛÁz •>à²ãR60ºlpæPÜVßZ",F‰c¶ç  T¡+ô‹ö(Z–¾?÷îè!õØ DÊ’±óÆÀ6â#ˆÈ™hõ¡NW3î@!¼&¶çM‹‹Êsý†g‘)Ñ}D˜F~)BNUo&(?…Z1”jô©áYXêùƒ3 Ýì§ù<;ýý˜èÓÉ‚F6Œº÷Ñ7ô„zÄØb«ÓZGONa Ô…VxŠ(d bˆp¿ð7ž.R™¾¥qœ-våŽÓã‹ý mÔ 9XÜ#8+ýh¢ž–OÅñ%ÃV†Á/Jo]çóôZ}a:öa#& ¶ ßÕ¤}fuðl~ýÄÖÕ&e%Í×£ñ[àî$µ·=Q” .àû3Oì½ìÓÙ“À˜U›ùÇ·0ðhÚ¾z•òv‰ü¤àdB=êÝJ "§‚š6RA‡Ç| ¨5s¾ªÉI¹Qߔ׆lå.èÐÒ£Ó¸C¤ÏË;6°y¸Éoê[0”VdƒŸ¦ªKà~Ä‘ ¸z2¼Áíë,pÉÙö×!—ÔŽÎÕù»òýÀã8üjè(v‡ 7*öd–ÞºnŸGiÓ_ÚgÈ”þœœ$rn‚õÆ£Çj‘d}Ü57a ¾Ý²á.­e½ C‘~Lx€ÿ·ÜNqTNr¡Èm§@-ˆg>%Çé «žü Â:m¶`m—t¥¥±UÆŸlçÒdÅÐÔSF µˆÔ³nÄ3Ò\ÔÌ‹î•#Ú}ÉÁ"¤0ͨóÝÙ®Ž@Ço=Ê”½2€xÜU½˜ú¥)©9Dá jÓ $"“Bù‰—D½ÄVüü»çFHÝûˆú±ßi¼O4^CWüÌNí2ú¬ì,sJK›¥!骴sMïՇĚÈjSêÊöÑóÇä°ÉÎÎêo:(fÇ êl‹µ¦U‚$‚–³'Žï¡5Qß«±žêi+4ˆEÃíË ‡ù+b–û\qArœ¥MÁ!‘AÝF1GsŽb¼3ò‚ÃWœCT½ªG_E9BRQ”êY8¢-´42öU(®–¥‹—êRÊoÉ’!3µp$—ÉÜÞóï<äçhtT²8ÿU³TÈ,±¦plBYôF€}'×B­åþ kúü4Å¥—ÔµŽ®û¦fÞÿAí„ñýY'öü8{~ ~&¾ÝBW )ü!¯†ÿn@ôKS@¶1ÉeòØ3o{™çÆxE ûûy<ñCw H¶Mª†¤¾„ „͉²ƒ¸${þã7L>Ñ…0Ô¯ñÃdH‡O)%¤£ÐÚµ5(ÔF(f”Òh#Ì«¡œçi‰h›E ÷`*÷ƒ°æ„Ê îWÚŸ{’V†z ê¦ö;øèa¼±>fAxõòXÍÛcų|eíÖeOR}ì½7¨âL×8=Xfï 'Œ€µ™8B\hÓ â³ôMÜ%z'÷äÁ$ÜÖ‹z}’5óràšX“v'±Ó,àú¿‡1 #¹¾•}\ ¨EéVkûhMð͸U{õçnÑ_pˆ“lÀézÑU)–Îj’FTªé1Q^Uì'¼÷ÀŠ™18õìS®Sñú#¿Kvu˜§-‹‹¿Kâzí±ÕÀ¢÷qJC8¤×NàÅæ¡?Roî P#k`¬\•\ߪÐ÷)ˆ?-ù5ü¦®»<‚÷ õcºÝ?TI#‰È éU“R ëgò-ð¡Qd æq%†¸Gm4ê´þ™JЙ™i’Ì|RÁv¤è…Ô\஼%nŸì’9Ë.·N «iáä¢'^bT³‰»À‘I½“ßfAÃ1”Í…T,v½\ ®üÈO‰Ð>F â] ÑÓú@`™V`•o†²ï¨Nyò·>)$Y€O$o"‘“àÓ@2yå¼Ý‡|Š2C`M‡@fH*\öFq™JRfX—h¸}Êïf¢ÂŽ%°ùØA¹Ðˆ²»P[µ«»èˆùîKhLLÀK³„#½–Kþ¤´?r8/Í4UöT\ñA`Ú OKó+8Kï—:jkؤ¬ÿbÅ»/ë–}ˆ”J‚öq|q)“»P3ïn¶Î»kr›Ä_ýìp/1‘zJÄÅi©×Œ^á¨Zo8­“IJÇ]®FB>JMW}b†ØŒ¹ûŽŒ“j"u ùª‡bZð \¥L¼7³S-þdy51ö0ïv äÓÍ釗 Ô‰µ²Ý”H¾féÇY­|–^kZû5ÂðmòÀo Ñã¡1Q…×Ö¼3dêâÜŽ{ËZ>Ì⃹&¾Ë¯•x̦¶¸7Þ#^cä«WE âp¤]•…á?LpÙ$rµaô¾åáIÜn†kKå9ËÖ¿õi:£ØSÍÙ"®ŽZûzéÓ}á·+£V“¶‘’NZ.!žëgÚŸ‚‹‹-(2µ“¿Öz׿M‰?ãUÓ…ñFgÅÀi‡ÕfTÔ¼ïQNÀ"ç­(´lïë#ïþ°ßí£õ¥… ƒxã‡èPÑÒÑ:Ìi-j2›Âc›¹æî ji¿ï….® ½¬±ªÎV4eì䟰©?tòš¾g½˜à{U^gîa V(#® ž¥ÎD?²ðçUÏË7@IŽ‚Þc_s&,¨°@ wV §K¨\ÒÐ31«O¢þØaý‡¾ÅðŒ†f{i8Å‘%9>k¹ùê„ ¤µ´I‘žÛ<.¤6Ö†•ŠkS MQ ÇéšÆ™%¼R4>˜óþÊ ‰/rN•9çp6 ¢CÑÌ}¤YÇÚA ÷Ð$`xÖ•oÖÝ×Fò½ºϽÇYüмXÕAcYžz™Ö‚Uµðlåß3ƒñ[–/µ‘1GIÜ–:XÌ*FÖïP–rUE™pÝ|/σ4%˜1åæÁ,(62ùÏñóhv>RdÍ×óVNZ‰ó¾±ÏŸPLû3™Ï;4 g6÷$(,P(<ÝÑÆNÝ?Ú ³x`àû"ŸèL‘☣:MœV4)PSÖïðêçÁˆi~¹Cw@ôy&¼i ¯g<ãceî?dpZ É gÔŠ•äÎJ¢ŒЇ"ûõÆD¢ÿI7ì: +õ$VòW-žR‘b*ËnO¼q‰(KˇM“ƒ ¼’¢,1.à+RÔqj7— £Al0îä¦ð¢+=»Â-GÓ­x]ÛÕ!†hWÌ›¶ã×<©«Ðà4ö‰“Yì$`|ºiº «œø–È£‚ÚÄ ¬§Î6/uÅÍÁ‡™xvÉj‡rh2dÂ×Ûféx<â“pþˆ î† Ð:ß¹K¨dŠÎ¶dÞméN{¶üïeÖ CÑ FNtüÄõË.&Ýðn\¶pí`E@åv%ýÁžÇÜçs7!7ØÎ íù¸„à0ŒãoðV{gª7»\êskïã‘ÖŠ€ëv$8› · ø‡¡[â5ñãMÆ3ž–¼ã³^^'‘<;Æ9""£8ïåÜœˆï®3ð~ív‹¹;lñ?6YHà@èfÎû|Rb´Ýz!“Äc¾&JôAíŒÆ™_×o‡ÚPE“²2»-’YÛÕzÕo¶Ó¦{2*FÃê¯K[s\nH‡ù÷¢>áê21;’±ŸN÷ü°Y"Å‘Íõ½dÜ´í _^&Û`Úï÷nO%Äð|šþ·ûÊé€÷ÖC¿gˆñL̯ÑÍþHtY©(zÉ|¦³¦™Wþ¸Ü)¬'¯”ÝžK:ž/¸]õ TrµrÓyôr†j“¬Ã rì‚«øXí+¢°½3Ÿ¦ÃzQ±ØoÇ únΗ3çžÐm"/JH=Dh·„poõ©³~T¦Ïm…5|Ì)1qu«qÊqâxVrõÍ™*k;Þ">ÆÈ¾!“³%CÖh ö=Ö¡Yf~ð·«4€XÝ©¤N=Ü\…ôTÊÄåÞÖ­ççGG‚ƒE*àê› †Lî%$]óàÐ$ #”§²î'áñ9i¤3ª[zZê¿Iõ¢‡Ë§‡¥Ü/.~;•¦ZÓö‹#zZ•@‡v§G§Usæ0³z wpÚ…,$%PÅ/™’“H†¢ÝHW=§ƒ!wò$«¿,KW+Ò'ˆ¦+{±&‰æŠ°rhh * ËÝ /à©#Ô×Ênï5u`@eáªô®¤íæDí|žh~½Óº+åëõÓšÅЫ ˆ“ò1|½^uú¼rö÷Ä*fTw‘*°ÓÔR¤‰IÕŸ q”–«ê0)Ïšç–úÏ­CòôcÍE%½”çÑá¯Þ0Z¾Á {-G¸ø8e ]qUÔ­CÑ`C”&ʰ"ÿ¡¥ž‰¾ü0}êL“ã¬ËN/€/5 ¦>-z¸#‡­$¯§A=ÌuE_6NªªNÃW*‰Å™oX’k‰˜FXk‘mχ4øC 4¾•ÉÙ+s#‘å|=ì¤'X m°u kì†lÂ\¾š§2FC ”£yÒFו(EØÊŽ~5>û!Þ­*‘d8¨ÊüDðÎñHÒ`òËCããÆå0ìåvA 4ç í_ã&Eho¨OÔ>\ ôî¼²Š–¦ £ÅGEM¼î¤i³ø H±…¾Ø ƒ#lì1᤭¿ªÛ0îës¹Î’¾:|寡˜´XfŒ‚ÛdÚ Í[×c˜Ë4kí¹<øhÌInR½ý½ûN)åL°v•0c¦G©€…XA*¸X~7õçÔ)¤(̆œš­80§UûÆÌÛnûjö÷ùРŶÍfW²9蕺Ö~-¹³Ð|›±œž(nv ³‡âᇤk™R]\‘íËОoiÈs”õS‡EœªsÉÑo!¥©EZ|'mVÉôÉõœc® Ö¶Ò¸„ø—t€Œ2/yÅéXˆ† —Ž¿­”J8»P¶JyÍ.š“svAÛšCp’::›9ß¶ƒÃ|47ËÍ)ͼ³º…X{hJBºã•GE^7?ëÉNŠŒ™RìðôÌu¤EVJ:Ü¥eçShš` >šß@ÌËŒær|ÄLSm:¢íºþReï÷½Z~—û¾h’µ,•ÍsÍ¢ÎP(±©å|Ç ¼+| ’öÚç/`‡ñ÷-Ëw¸4À#Œq`ÖÔ¤·€AyHü¿ &µØ8Ï„v£Iqr |;„B3÷•ΚƒúÙ e]˜†Î µ_x.â ©ªšX`ønVżëÎë®(9_QåVT•²þšwÑn}Ü~‡,‹V»Xê±vé½ùŽƒÅB4˜G§ð –"ˆÔ$ȸְ¿ýhE´i“51Ýi}È ˆ“³Ï û—ÔÉ£¹éº¯kÙܦ;Ê>‹XÌEÙÖ½S#—n«²¯ùoð„æÒ¬S[,Ó)ÝÎÅ7a˜ÿ§Œ$£k)c«”c;tMSm꫉·j¬%›„Î9¡F—¯wü]"a©O™g/ÕH}×®½8‹RM‹b»í™hzÓºü†üúY!™~þPpýM*¾ü9Mm¿Ãû0M²»c¶¶?_¬ñ½ñ–4Db¿×˜2—JSkÇš%„zxú³i|ÙpBJaJj¦“}¡š–´›:g¨°yÆ­b¼³Í Ù’:ÂOS-Á£b(У\ß0Ù1‹ylµNÓ1üÃ=gH‡ã*êýoñâ+þÝQÀÙ`eÅÄÛYeÛ¥ð <´ùÍÎUT/φFºó[Ÿp8rGV°yÔD/QHo ö#QaÀ°· ź:¿%H^rMu‹]¦ýþ0f?ÿ¸dvéfM\5…‹"’LFžª¤Äd+‰ ³—sÇÆ(Šç8vG”7mV8X'?sR±GŒJR“zZH­× Ë­kÚ›ÐqEé1ÍÃ:w½ƒ¶´9Hõh™]Cç~÷èÓS@ñÎýßP{ªðžE?§Ó€C•I/4ÊQþðîij®Û-w©¹°ž„î~Î-”ç!B¸ë}>%¡cCÙM‰äÛ=ÝÀV‹óüt²bi$ØMtƒAím#qˆWŒéÓ±FGöŠÆ¨zÃÞW?®y7U\ÜÝp^p£é_é5z-®þK¬gaô[Ý©íãb°L ºï¨)`Ê™¯“[ë§æ/¸I²CÞÿØ’{w^Wã Tb!P>Õx•—è.-¾þŸÅ= o ]sqBã+öy‹uF#ÿÒ2¥B~3ú­ÎZL„14^#ßxtbõfÓûGAAjÈ@!‚²ìØ“†ô¯D¹Ócà„˜¹SèM ¦e'äUÅ^‡Ÿ:lx¡÷½¾Ù†1Z·æþQ‡l’t`£Ö¥8æ·R:Ñt•À¬¾ («Ï[õÈ*+ñû’Bßñ1˜F&“ÃD·Ã²!ÔìS³æÓ$*ñì+˹õàØ3.ð¹t1}O±Y•$YxÔ"¸?J‡Æ¨ ¿±hq¿ÿ®;Ns„lf‰é=ÄïX^‡@•œW¼¹ús új®Åyc»~wUXjv¬¼ÁâxÒGO^—GÊ aþYªÛÑã mÄö²I€Vuú›L …óôqü¯ácédÃKœnN+Ñݬð#Lqò.ÊÁóRKºµÉ—ß’{£¢P1“ K_`ÃPD`ùYÑP"±óö$"$WH†@0ãÁ·èø{Œƒ½âe÷…¥ë;¾¾Är~F£Ð¬M äà~B¥2Y«&ñBÑOïH`EÎ)ë¬Á ˜øò&t@YaVŽˆÅ¸æJÖ‰F>öXÒð+$U¢À¹¯Šˆ;ÈÏHžNJŒ"H`hìGñä¢1MeS32¹cƒg™Á¹´À!¦ÑÙÍÓWÎü´“æ6ÚÝ*Sv˜]##T5Ô£Y"2ž¿|!z µˆÖ G‚‡õ.n\‹ÃA£fByŸ#mk2d«%çp¦ÚT.À-¿Ú×q,’齞 *4øpúTŒ½K•¶ Ž+öjrMfBž¸lÃdÒ¢ey`nÕ¶ã®BZ¥ä!GE ‚%„øÆFϱ>k*Äâ%o]IjWr«@¯jyÃK¦5ç8j4ÂYçp‚}9¦èºt´Ãªôl%aF¥÷¡ ÚqYÃ`z ,©c’ÌPžCχg9ÂOºqDå½DšeÀo„ì+sÀI~{ä 1Ö\…ìþ‚úÐãƒÓÈR±tÿ‘(—ét_dr-¥~¹A™ù•c$"عê=4‚AâU}ß1joDð¯4lò:Ë4«þ5θÔõI{k±§ûNù‰â&L– %³Í: „"éûƒvGÓQ~]I)’Y€ã"’/‹Þ+ D3k |5—ý?è±ÛîT¡û¶‹MCPÒÕ-³L€þáæª¸ðA»OŽè,œx¡°c:. ˜VŽ>Ñ‚á;vå#ÙyÛˆ»¤™ptÇÔ4¨Çm|ÛjÅç:ùp~¦G6±óâò8Z>ÂÓ•ŒyH¢“ÄÔ<­8.ŠÉp}>z¤WQ{}ÿhCLý"ø4_Ã׈Ç*q¯Š"‡„Pn„7qýuTæyT9öÍ£¿ÝºùkË;žŒâŠN¤šÕgÔä„}w Üƒ-Ò€µ¿å_¶uw¡±C1OrÜ傞ѯ0á´OdzΖºª«CöŠ2 ö̰HŠq¸#/ŠúøŒÍD+¢‚:×§G÷ŠHj C’FnÙ£Û¤ÃXÚƒfRªRNÕÆò‰¨ C*}¬³•Qëñí`g}ºiü¡rss)¦.¢ËG¬Ú`+KYQÏÿ‚+»KÅÿ‰ÃÖfe£R:ÔÖ†¦Y¯˜÷¦ƃ+ÜÎï…<ÙGBTǤ‘bXi¸®Ìü2A*|OKܧ=IÉ%ä&Iê”~â@d5#¸Ãæšœ;GÀ¾Ïšg§ºŸV}>#à ðìk‚ç”PcøbÇMî€Ùò‰x=ÖÐ}Ñ=°!É@-„pôI¸`g˜Øú÷£R ´$,øŸö ôÖZ8¥jç§ó4Iu¼J9ëíŠN°¯,Þùɯâϲ·f*.ºgâô±ªaQˆQJzñ„âá -+:'ÉJèÕÛ2…¸)Ä p%zU¡wù¦ÁÀÉ©·ººº®…)eÊ[ JHäêþéXäoÎ×ï¤4<2âÞ›Mãd÷§®Yÿå-;Ûw”¼ ÂaBr§ðÞB_çUQv›Ë¾C>£=ecÿ²~ÿXŸSERâ=õdáµBkþãˆgWP 8’jüJœw“»?vž‡ž¶)aö^vLÖÎz¿1DaZ›ÙNiîÛ21 f_ID—“ÈIJ1ϬvtÜ$ðÀÞ'‡§Ôázªë°üoûëß\wP›0¤`àHR ‘nô Ybw¤ôb>:FªGýÖ|Bd¿ÿô B3¤Ñ²ã7KEŽ.boÐ"ü;Ï?ã{ºQU‚ loÌÜ5Ù<äe A•3ñŽî+€‰98gº‹&’­ >ÎZ!ÃA¶Õ@Z°2ë6o_‘¿©äÉ’³†äMÈÏÿæ >tgD‡ƒÛ¯‚ÆËcì_Ô¡>šùÕXQŽJŸEÛa¬ T_3Á… fõy‰µ\åŸîqN2ué_ƒÉÓiêÞÕVÞ4›jš³4RzbÈO9_=”_E;¤ñæ7\à,ª§“”€GJº*SÊvÿQvt¼àüÒi91Wf™j•½¦“°:ù™ék‚¹h­ ¼ú)m,^IåbSéSõ¡¤èGÎŦöd,ÆKƒ•ʇ’õ´èí”^ì–I Û‡±øÕAùL¿³n"|ìJÊî¡?Çiä•3É;!‹{ÏkÝ¥HKÅ^vw’âÔÃuo+y‹ª›Âõ¶“P˜Æ¦Øæ\]ô/ÎŒ>Ë"&b ëÇÉQÍK=|œÆïx¸˜^F G7Ù,áŒ[ýñ´ÛÂõ¤F È z÷Y;Ð,ZAìÉ·‡ˆ_g:„©ž¶\Žþ]l‚E±¶¯É™)ã ­¶Boc8:s?ÍÂf)ÏZâk!ó7¨0_²&øÇu’D:÷–{"uwXÀÏ]é‚Cùõt}ÒRÝ3ZÇqçXGSˆrzË–¹>]Þ赆oª×Ÿ[ ™J„bfhQ(‘n·Cz^gÛ`¦v%Fé‹&{Ö°ÝŸzdÌíô§OW`:øÃVAIÊN˜$ÿu×9HwÖ͵&^5íçÕùǵԂz†r·ë™ír¸2Ⱥm+n†`ùEzŸó+†Ð>“Û2Y¥é€é*òþ-k޼jçÖ“mIKÑkÇÞÍÝøeùpõ]¿¯ QõfUÜFãÏ9Ý‚šêFp|¨·pcrÄy7[º| ZOé7mnÑñ²ì©´s éDÕkFêg–dD)„òî­œ³X/€«.eíÊ´RW¢ìq¾áy²Â¸ñá>«å7 ¦ZçQŠð»KÚW3.Iše'‰—ÒŠ‰ésaû¦5Ý0œ¢”!1à÷_zÇúLsê«ÜVÓ)¥ÒéjéN¤ºë:_U™`öåñ :Kþµ1¡7ïé즣cr¶±Uçç¨Øžå”·ÍÝ;xyœtú‡ûƒ*FYÚ¼…â¾ñ8±ñY^߯õ–9ø4ý a(Ê‚»² ïB‘w®D4ß›› _1Ãði[þ³4džfßhÃÞYŽ w槦½HóÛ¬ÞˆÏ"ãþ‘„îÝjKT`üŽm3©üdɪ(&ékoƒ¦z+‘ Ž T ‹U±Z:P,«:OÁ‹"uÔ™Ôit°bÔ¹œ¿èŽ~'Aòa06H§€&…ÐÄäF`Ëôáκ»·¬)ˆç_µoË3 H/^„¤M;¼‰?*þHéìÏuê¬>åú}®§ ü회þQÕpÕ¶_ÇycVc È×%B·Öïþ3­PA'f¶I“b<¬6„@1ãAˆòU …5ÑIm²ï¬äëšñWYUm¶z¦ñ@dð7a‚ü¥ÚäB” F.ÛºVºb æ.ª[ìÿÁ :Œé•cA<‡Â‰¸‹Å‚c;…­®Î-¾õ7ÆÉ® ,Š5ŠŒaY‡« `ÍC…\‚¹þøþ]÷h¼¿â+E:¹ê£¬‘yð€.«“—}€RòåîccÊÜ&B®è×ì„•PF7DbvŠôtl‘0ŒÎV‡¬£¿|k3ò§ û`×ͪH?TdP @}½á“îmv[ÂIš±UGZ°8¬‡Œ{Þv’q•,$Z¹7RW?¨*DÝCÕÒÖý€”åOçK‡ýìV’=§’Èdëj‚ÝÝPÿù1(àÕ>æa2=ãÇÿÑ:=oë(§ú‘R2>ä;©‡t£þƒæn‡¶Ü܈â"dÒÛë)È3ôG-+jÚöZÜW.Z Ï©øx¢É[°á3Ô&'NG›üш+ŠÑÉoÏÿ G•x*>É©ÛÚ°±~ !Q¯ÑˤºiûÆNî$‰/=%ØNn³e!¹²Ü)VÌÎ=Jœ¼Ð]ÆBj9nÐåmsU°ÄZm4ÁÛÉ~VØsPk½¤§Rªç«óÈ_(Ç&çÖýåpø5}`Ÿ7¶ð6aD÷-¥V#Ôa™´‰†^¼Â÷ G™Z›²¤U‹ž˜;k@*ŒžÑB¨FÆŒG4ìhšÌíþaH chTbEÊÀŠ´¿5[€Õ*-) ê—4|¥¡pU^uƒÍœ—ˆ¤Ùäèýa<9œ!ÂnBa‚@¾P¥%åG5k“Ç{ ÞìË…Ùá5ת.+fXÓü=ÃÃ(ìÙÛ¥èj¸´)vñ-…º§OÝ]³Ã«'¢Ã4# Þ•cw3¸ØîP¾áçoÆÎ£â7²2—…ÔK[{ó‰-«frÒ.PdªødUÛÀÛG••¢rÄ,Oñ?•÷'Cë÷h×Y õFÚµ÷ölž\&š»’ÙXÂÐ!Áܯ6Ç‘4"?¡š6?˜Wu·û阫¹‡·ÕÔƒIw2â2Ú/ßȸ¯¶Õmwv˜hÍ@Jå×íî{<è1~KE v¤¸hCí³­û~rÐÜR ŠŒ0PDhLYº‡ú°RîV6—MÌøgí¸qˆ8kÝfe¬ º¶piùÛ3Eµñ$6f}ÈyJê£ñ­¯$tQÏÇÈVó&Y%ÒÐXËtjõtÅ]ž¶\5‡‹m.{²sšP­s-Æ5¿ìäI¶{Þ! vµ!ydzø(|¦ï|ï8Í3>éùß (NJtáU0øß·xB6EK;Í®`Tï½§½wGKª2-®sÊ¡•¯~Y7(Ñ à·bï¼o¢žJ4•ò²x¿J¾-Q…ÃBúÜÌ’¯U·Ash^"vPtF‰ècÆÄà ÆIý–*4ÌôF¬iBY–@é!ÒVÛJ>Oj+±y+—eìIBü±* Ð\#l”çâ¡·cuúU­FÈâG"ý¸N¢‹ÍòËaPÍ[%™íß¾+Øü2Û=æiγ(å4ô Yî]é‚?ÊÂZž0¶™±fÁ?ÈwNQzÖ €Á°»¢|mËç57Î`ˆ„÷QˆÍd×7%Ü{Í“°8ÃÚc †…^¥«„•n¸9¥b™ç^ilG¸¿Š¶ ž‘Iºæ q*ƒ‘Â*Ž­œX'UƒE–nCYÞ¨vÞb@)G ; B¿GÖˆ9 òq§ö%Zç†7ÎÁ© ½«’Ïð¯SE<¸l?y”›Š@´B»+ ÝKŸ0OaVË/Éì½Å#ÄÄ×’Zg `#Ë-íXtó'H—µ ß{ ,¹ÑãÙÅõÌ܇Ñaíê²]Ì€ëWB$+íû>¼ƒb¼çøgîãÛó,F‘Ƙ¾ÐTMy6áòÄÊþvP-ŽË ‹¶é—1òü®•KÚy#(øFhüxÊYøkÂõqW·ìg÷Š‘‘£—¸¶ah¸Ðd´žù`vÏ-ÑCH¥åö‘Ÿ<:óéÑ™ŠºM0&^<‹¦­ŒÛ!(;ÿÖÄæ *bö›Ô91à*{„,Z-`)]- A4ca­¡S„BÛ‰§ÿ¤—Bþ·Oò ³ aý…:‘Å›^!ùý|&žïÄf0œMS}ª“Kr¬µŠç%QkcáüsW E¾‰7”k$q4ŽqòO*gǬ¬ àØªa}¿Fp~±¸bÚd±µj9Ò3 ÉÞÒ OP¶e×vSLRÒ%ôÏ*JÊ®Õ-t5DùÆï‰§#Ðò"Ѿ»9W¯<ª©´Aì›fÀ“”‡!œ P×”Œø~Rãã±Í}·Šô!ÜŒ Ã׎×a!• ¥@çpÚ/ä,­rz~y†Nßs˜eÍô`תéx–Œ‚Ù—"!Êèœq—ÑŽ”&º†`(Ó¾áô¨æÆ«ô¸\þƒwÚrÇ«h#¶Ñ†{Îöc0ô“•­J@†u~"©pÞø¿Ft9X³jCÖ[/™DóÃÎÛ¤sˆm¶Ú|ó²DÈC´}¸¼‚˜EÖE4ü>{ÞQ¯GÔÚ)õ·×9Ãc·"a’Î3füG7 t[n@²ˆðük|7Î2H‡3Þˆ © O‹rÌ*Qìôt÷míØpMëû}ÆeÆšnbú£œ™äpF·|+Ú(X–×O–"¿"+KÈh~ʾŽwOÇ'.îãÒ|ߨXÁ(¬¡ßÕAPà³á9úf-ŒÒR ¸­§ô`) 4V‹N ƒÖ>\É9Ú­nÛ:[ÏL8Xð  µ§§Ù3"žÊ"o'U4F‘Ëv{_aWX.j6!%hîp¡Ê€0S‘´îí¯FD›mÄâ½…¶vY¯]°ðÅdõµ6µ+þ%eÜF-ŠóñÆ Àlê o d,øH%éXÐ?Hجt`ìç:Sž ) Å1÷ èz(êÖº±èLPÊÏ2‹ÆI¼<­ÇÁŸª”• ÑçO6˜·*a´¿ü†ÃiÂÀ‡òO%Å)XH!\ÇïçÖ½˜¹pÒxš\Ú!>ŒIÃZÀ¯¬@Σª:êÎóY«$¢¹d¿·^]RK-AS˼šIaúyky0aïpg2íNL*¸–vˆÚõÔc¯œU‚ÜwJ}ŒÞÌVä³bÁü>ˆ'wMq”S»ÕEÆÊv¬¬¨e§­ßØVÔ»20e”éFD§˜«VÚ9In¾ûÌ)QvÕf'7[ßË Çè6ê#‹´àÎÿõàmJ¢héAç.o\Ÿ÷Ï9€ÈJiŽm²Í}%ûѱ³ [–‹¥3Õ_–â94ë•Ý.“&†^u‹ ‡Åò´[³ÉˆÝÎé{ uãŪ¦+¤³ëV3Ómì%›4£VYŸÍÄ)ŒN1Èì²bšð“ÊÍÔÌЖf(¦_¶üµš0 ÅzÉ®fS’ç&à \ýïy¥Óέ½,èêm¥(:H‚çï™Øª²V3Y©F°+ÞGàCM:6\Â÷ÓÝØŠý¦ø…PÃ?s|0 dÔâdeVÆ<îCü@Öy aºÆŸÛ,¤E¬˜§J2É..Âhæ4“‡©×]çÞý†¾m’{ÖØ£Ø¯¤9sV”£¯ÀJA£¹^ >ýžµzD”êEéM‡z;ä™}É[ËÉž#¡ÜAPr¹@fëw%¨þ^s¤œœž–‰Ü&!»ðö˜k†NÅLÌ$΃Լ¼ú(ï*¸÷±BÂ׎IΣ˜Ôµk‘o`N¾ÐïnpM`Ê $M¥¢å Û1‘2¥¦^ìNâ[ ¦8GG&‡NÔ Á ÀÌψ¾˜vÒu€ù–ƒáÉÈqÕy”é~ÁÚÞ‰-ç³øÌiùwDÏ%’ ÐÒxJ¶eénD– O ebf60‡_‘„cü¡È›7%#Ǽ”ˆe@Ú•ÞàbV«ÇN3N,³¾+_þ%òìÏÎAúr8Bü“KB …œŠÍeÉaÜ„ñ:Ìüܾ3ÑcÀ8HA6á͹Õòr>3m«{ܽrKqE*ê¹Ì²J>§t4& |n˜n¦¯ÓéJd—-”E³)Ýîõ$>Q±UÂIáyM¼žó@F°á9ûG¶z,ðxJùžø´Ž–½ÃFÖ]™¢?KþœAд_Çdo Lä.릓ˆK2¶.(:މå¨ÀŒ9 “wxpËiúÜ­Y»7XÍjžz4ï¢èMΖ°EØ/ú1º `FEåvk-Ç'su¦:M§œ/ñ÷Ópþ­æä'°?%؇±Ö}Ç ©fÓKK楒ô™'.àý€ 3rΆ¦N¬ŽC‚×dÛWìÖZ"åá ·n„¤_„¥´®ô Ó“—Ó0Óq>•ãCAã÷5uG­Ùõ‡½•휀UÙû´(Aþ)wÏüÀ‹ä y­†ñÀê›±“ì—šh?ˆ›/Æ(k!âÉØëç¬Ùé´´Ùªxr ¾§ÊMÙ¨‘ñžú£RJ@J¢G®Š>ñZfZ D\´À(øV/ä@׳X¹=e ñ¸\Wy¯4uýoeH\SËRËŶè=VO®þµ¹Xø[rÒÓ¬Øùg3p¡± ïQ8 ^ì2uæ NAƒw !Xå°Ö…I¡Å0iß4u «æýþD¨”\Crì‘nkU0¿õ"JÀã4i"\½UbgÎÏ~Ôi:,ÛËqd(ñÌ9W•ë‹ Ý(¤0¸YGWGÑ"ä8SêÛðá©[²ï¾}’êã™ü½²Æï·VzÊ`b¼“´h§ágXÞ$ŽûCǽqO¢$=é €GµGß¶>!’~¡u{5ÔéÚñÒò ¶â[Sú—3“©Dht€«{êd…¹ò&"’ÛÇkLÖÇq¢ý³TÒÍ'(×msѯXH˜äëE”f=Ǽ„—õrê O5Ž~óŽÂñ¨×ŽæQ9( Zd†t¡% ëO5%¨v…S¹»% Ñ¢½8FÍ “`êÿ‘þùìï0øqyÒ ÆhÑ:72è½»àÏ´–øZÁã»ç hÄ# ü‰§bìqÓ‡´Z)xaZš£‘Ö ÷„°¼wévŠŽŠÃ¥³ý¯}Ë·‘+F·Ic“°,ïIWjJGg¿à)§ãÉ)dMb85í4^¹à2Q¹ìæ Ú«dOË96ÛŒ¬EjòÞRLf¦€EƒµWÛ—‰^«×Nh..s)´ÝÄeš£ž¡ãeÝWhÄi…¹Ãe‡Å4¶—pœdjÃð ÍÁ»ÈªIÆ—,ìcèçj¾¦à“›ÍÐ:ÀÃJwÓÃu\®Ô^"X–>EB…F‹ÝÜÂý½‹iµÿ¬ÏÛròï#c[Ô¼ý)ÕP²q½ŒlàÙOº±QZLÎçÁóßÿñxV©6:@Ðæò«UBÎ?”ÂZ™VBT€¼ËÐ%é½C­]·t êSÕd.zO”¡ÄžÇt@QÇ—VºwRzí˜Ïq©wë†/z™3н¿ÈvIyË Ø‹üäžg½oScü–¹ŸÕ"_—Þ(GQ)Ç»ìE›R~ù¤®þ ÍPß„c8ÛªÔ{yú‰Ôlå+}YÉ^“ã‹H(Ѽ(ö~¹µpLF¾h¿Ì]‚'Åe4|„­˜»’_­»§/ÀðŒZD&-.Aàüÿ ²CJd¦s ºTOÙãÜ“–eõBo(L‹&d¾·=5O°ïŒÊéÊ,—°Ç·oøà…)xJí”G5z?ö_5¾îõø$§õê™Ð-VêÉçòC ¬0o»Ñæ¥{°q…òôÃe_¿Wñ*”OÄkA×ÄØrÎ]Ìl`ꙉŹÅ8KKŽ—óaiÊð®Ûz´7º6®œe˜²+ê¼ï”4Ãy àÕ({îRÅ”\ŸßPʼ\¹·O”ƒ¡ÀS޶6DPÑQ󩿍oÔ}$!Xßî†-[g!D\äÐô™¦OF•™þv‘Ð4®¬¥L¢(7@„ƒÙ˜IA,¾áF™üiÆâÍ$¼¨“ÈDùS§Å닊ôè}®79ªÇFçéVÇÎ#bwFž‚¶I5é__FÔSè«Ð–ì¶í™?ÜÁ}åÚ?­+ÿÈœ_³ƒ&„ãÒõè“!<¿4xÉb =èF;ïè²Cª£'×ÙÌíÊU±‚s'! 2²1й£»mcX”}é€E‰‹žËÜRï~ÇÏý3ž8S\ª§Žmê_*cžãĽË,}L-Hkf] ˆÑçVz8öèÀN-Í@&Ÿ3Gç‘ï@}ÁlU;«´ ëy ÉØéê’Óu˜ý¦ߎg•>ÆÚ{Õ¸2ö—{OTôs؃Œ§ô’q¤u +³öî½4ƒvÄÚøizZXI0‹®™y=ŠD,ê¨fR( è°ymÞZ³OYhI0ý úÌáSMÕxX«¿GaËɆÙÖö.ñÔÒšw§˜jÓ=EL®¹y}ã`þ×=Žú‹faUU/&ò·ðýÜ„™Ãçj·nNpu[ m>á¨ÔñBe=TJ|§š˜ù,a7ˆhïCÄ ß©y3àƒ>Zð‰“[“Ù5À/;;st½¤"1ÀRÒ­ Ž+|üûQ-‰ÉûLDÄ©í=†Ç×€b‚}×X¬'_ôÃe iе3Òpí¼D£÷@m¿Šrßò‹k¼p’ƒ87M[Â4ÑŠÒÓù¸URzÂÑ%¶ÿoÉ‚ø;œKê˜øìÉP64 ÝlVãBÑÁ#ÕQÒ»12 Y+ùé;_®í” ¤šm ¾šA*d§)'’%X¨%…F'd>WÎ<µßÍ:ôèõ¬V¦3øq±ÁçÎ:ëh¼g1mz ¿Í×ðá‚”ÝEÜü |µ¯ϳMn-gþ-ˆhOva“÷“ïnpÏ>â]÷W¢ÖÇyØSÃtÖSÆßù –9·7[ÃÎï§eæ>á Í„N ^qýÀá‰ýÐ9<1­Ø MP€¬§¡¬’ÜŠr C$->Û‰Ó¹£rŸ˜oÔ@­ˆ®ò].µËp»aþÄz¡‚{Ö RrT6þ"±ŸØøŠ¢ßóC10YËG5=ÙËÕeo[ò®—ïMðžÈǹb8ǹ|qÁáš¶ë!ú!iF^Íå™wž¢«I^,búj4q¸ Ä@2†Uu›fÁ(Ìî†}³4©_RV‘34Ý}‡ n£’¦ÔÔ=ƒÀ [û·ðdRú® W<Ú¸Hõ;÷ðÐ j€/ï¶Í y•ßjIïÄîìê…ožbl¯ ôCƒÇ_CòrÚä>Ýi´€PÔÐ ~ý(µM,‡#›Ãgªx§ÃäNîË —úŠÕ Ì䇎©ÞKON¦<½Cvè²x¸›Ô–%’J˜ mޝ¥³¸‹¸×ßt g{Æ&kÊ]ûTg˜×ÃÐñÙvU¼£ »¸[­£üW /Žæu x†t§Fm³¡²¶§nêÎÍ…ãž(´€6UoëÚcˆ8ÞûZ³X±Ò”©Žü±½%Ì™¹Æì3xͦyÌžÕèR#yI±«d±¢^7+còÂå­©âÙä‹¿9ÍÙéH…é‰×Eص-²Û —PcFf\ Xï®Ü6m":bµYP2AÛRtÂÇñ±‹Ö¼wÎÒJÛlòyt%‘uuŒ´Eú Ù÷"Ký/~GµÝ±bVƒ“ù°% ìq®Cc~@s ,ôTw¼Å@þÿd'ëkïå8ÞŒÊò˜ÛÕE‡£÷‡©èCqyͶãÜKO¥8è{gkl²Òì^…E¨¨Q{HVÛx‘˜\DýûÔ sÆS²8 e7î¤0tÖWñ˜y¢äÖþRÖöî|úg-’Û¦–Ì#YJù3·ëádYƒC“Z|¬ÜNMÀ§m ´7{PgÖ–Â9~{qÃ~Ï]öœgq)'Z­œq3É£ýøåÁ;óþ.ÿX̹Êpö[hƒÐÇ´d‚ôaY›_µ0ê_.j•ÒR¥Ð¦ýԦܑiâo| s½îVTñÄGÊ¢j9‡ò+U PEôp{åØÑ+gÉ8Iº³¯@7Õ÷( ެ¥¾‹YÄ×·wÀœôŽ0âûô'¨³_f)5¤Û4s D*Uf&"mD•diDÝ~ á6 1\Z… =@Á®€ «8~θA:Žs]ý¬ú±D ¿+puã™Uœ¯¦öÑÍÀËâèÅ 3#•õ³d^C –ð¥•x|D–訰¹âŽ•U–±âyWP¦àbØ\ÔýàZýÆB‚—Êú™ÏB÷ îÞóƒ£̉Ó’›P@×Qç†'ïÄ©ûßÔ¤Hd'žO gg`ô/(’ìMЩ H‘•)ÄqS~±jNz™Í´ËcqÃŽòlmbE±Á€\id úZÍZfkz=œÇä`Ç4&ȃZ€v§ËJ)A©‘sü\+ÅEòä3:ÿ XÇ žMÚ°Lüe±ñ”Œ‰¯ÜŒÑ—Øç©In3Ùm%=i®WýK¥¤ ïá×x¡Œ/¹×–kkwD㦒•VU æãt+_M«ÃçqÆÿø^YúÝcWQ‡)wñU¦YØÂÞs_…BwùèE¦è0×î|!€ÜNuÁÑA ØlÇ‘U€g±zÛ³^Ñè ^èád Æ T tE|°¸Š€šÜŽƒØë¿âpƒ0;p“KÌÿ«$wW£ÙÑàç?¤ŠûÃmç l{6 ½ÅDů›´púcûU§9õ˜¾½CÄ&툰œU>ªËè̹#·ŠŽ7ÐÿœrUîȱES\ì3OD·ã^›6F~L+t"~ =EÄè÷äøú‚"ó„×ø8#¥gª¬¹m%þ }·Í¼UyBeØ,àOW'áä¡°Ç׎zöÉ›dKÜÞmÏØA!½ñC?þ ªó²° À‚ |öÿbaBÅ‘GŒC*ì!Y9’_®å»Ñj×Cìï)H²Žëñîr‘ˆ;•škÁ@ Uц#C]<=ÿ±­'ù{K‘ðF}ìú¿Ÿ"º=…Æ“HÈB¾ú(²‡EÄ+ê×õüZ¦I4P,—.ÍkÁcèmàysòNyšu…ù‚Ït® Ó¹ä|—–ÒÙe5_Ú/#.jÞ¨0#k ˆ†t—3Œ³Bq½[šcþ3ô¨Œ»!R­²†Îùä>±*å4éjMÔDAçypp*ÒŒNåPz_”uATÆÛv:"ÂtÓnä—úa›h¯/ø4$­+·0aŸÉâóÝKAt„_¢Ff XwŠš…>H ÃEY© H áÛ© (o&ö;ÕÞe0Š´*òÁft§Jå°°2–¿aì% qTú+¬P'VdÏRT• ’’„"Z®™'Ü{gÝKkè¯XYà~ U]w(§;St‘®ÆnJÑæ¶6|&â9ŸeñmÛìéß¡Ôq…3{4¯ÚoMóyɪ‰kc]¬¤•_*êD5ƒ¼Ó¬†§ qRPñ jÄVKõV9(ÁèLõˆÍ…Â[„†À½¾Wÿñá¹i ‰ÈǰÙ2øÝoMщ*¡êW³ïrÞ…í¶ç—ªpØUS)êØçÅÖì–”A͹ð¡{ =AG,~Lq êÏ´hÅ1hãÄ(úÁi ÛH!7™eÿà±ßÝÁ¦„“Uf…m‚MŽ´qžûìʯßâi󄆸¦©#»5…,ªgþLz«¶þeè~®:.>¿ãj;!œέÛê­_»¹Øzðž³gFOÌcƒ÷[ ¦áý¿§C†”ò-&PlkÆm—oñÃ=(¡9 g¼Oí=YÛ¬ŠµŸ|ñ¼ÕáaÐuĉ|n±tû¸…ˆ&‹‹©d¬^¨Ô{’/Œæ#ÿTä4…“~çé¿H*=s‹á<¤Ý[¶ ’ q²$Yo÷ÔdŸü.¢U0☡JoßôÖIc5U¿íDOtÉmù ½©ùI  ÿƒh\SÀÚæž4[~sV•+3´ÞŠ54©.Er*î×?z 2Ç 3FD¶&ó µ¯fdGf× ŸØi¤žÜw²Š¹n{”±/íz Œ`¡,¯L°gQƧí—á»ðU¢O×9!RSÀgƒßÁ ñ¼FË£§ÝxÇwý+„ŠU~aÍYn'ðÞª½3» ~mª,™€Ô LÓßøÖiU6}êFŠPEz„®½‚§¨6!w1Aµá¯Š®ïçÅïµ8“нJíÄFi@¿¥Ð6ù›1m¢„=wo¥-s²ÞÈNc3ÈÇ !cGL”¼êêùÈ UЯ’•üµ>_|÷7Ö…ÌrÜUÙ'\9H/ìtj¶Hã~ñ3½Žä’öm¹0Ì—íaû|Ê ²¹Ü¤PÔaòêðr¶3±«üÔ㤵±›B¹ÔUrn2õFæÅ-SÍov? ÉÏtÖ6n@€.&ºD_ÖT“÷PI²iCêæŸ+6†ðKƒ錼š ?Ê3Ø¡`¸î~Jm|Üä¸rÇ{ iÜÌÿ‘Ì­ ¥vûGëÌÉNyî±J' %é‰rStúIƉ~&’«ú|2ÏKGõÈ›iá{’<´Ä¯FPúÞnÞÚ3ðÌÅ–*—µ78²ŠÝ‰hï"­ #³õ'h1û¬6pÙ­ðæh=éê ѼKtÊeŸ5b¨ÄiË@[ø[suüÃi)YΘﮘ!–ÖnY$¯ÎÃ"ijG(u­ä ä6K¢;­ôØÍc­¿ÿaÖT(±óªÄ£«±õ/ üö1)µ$&3ĤÃ9@‚€¯¤ôDö•Ül”³šÅ–ÿ|ýL4k"÷ôÂTs÷ImD$}  ŽË–]ÇûV‚ˆÂ  2 È­âlöBÝ'9©És:O›xýAF0ñ‹¹ÐH¤©$ûø7Bua+1C´´žÑ x«Ì⵩¹‡6¯ÅÁNO"Ré›qüïÂÊÖT‚Äá”ô€w’R•œYgHõ}-öC'ë,u‘-M1üc! $j}ÇK“}–öÖú_¼è§nÍÑ»h›Ë÷Ïè¨È”Œ ZT8ïÛs9é¨ßfO™i“pßv÷ÇÏCpÉŸy$dÙ/yé°i8:š}ÔAóâ©ÅêÏlߊÐh‹ÈõFÂnSñ¶ï¡E郬P¯±Ã¶¢¥Þ¬Ç1\šÛÝJ5¼à@ø…€Ü=0šÆ1šw¶|ýnyÉZS¢)KÑòý¥;éóA‘Z°¶çÍ_ù@¤”¡h FæàAÊÀmk<âŠCR9ÒÀ]—5äMêþöý¿;?Zñ׿|ÞŸIg˜Ä2å/]~F%Ÿþ‘Àï¬ÿø-ûRªÄÇ SÉòfؽ”~ BaÇŠQÔåDqh>D`ãÄY®é#P8¸“þAÒäsûñR‡Ãb¤°­wY3abÿGÔá‚3‹^²Ð„S@UÂe>/símtA°å #! .È27{~ñÔº„þ$ÞZcåªÏÖú#,þ\í‹ÍKÖ ¥æÄ¹ó‹óQ›@'c¥Šp€>*cêi6¼¬"ܺ ôºÓÇ|_<ÄÛ`:¢™j  ]"ºÞûÞ„çà-Q9{DõŸŒ›gÅfÿ@‚8p¼9ÞLßËæMEåµ{Y’Ÿ\?Ô$ÑÙøCÓJºKß^׺2ïoòo±Ñ„^¼#5ë{…¶üÛêšS4 § (™BkŸ õ¶U:YÛÅ„ÆãÃ…¨ÚêiøÄ¾ç0§mNžÜiü}í–¤Aæ¸<£%J¡Õv £‡¶j(¶£&Ôã vJÇReŽsÂ\‹^ÃkŠ â͆%§E¯¯jQ‘ÖÊK ó(KlÔ×]¶áàÓ…ÌÞ8œ%ÊÉìF ¶Óƒ¦P|VT¼${v·©Ö‹œ¼OÞÜLleN^lS‘_MgÈ#yíê3žá;#Žxt›$©üëTpáIØÁ8RÅl­ÊŸXùÂ.ç2é})Ë5—°G²|þ’Ýó‹s=<Óhuê=¢UžÂßKßË3.æ^GÖe}+×T( ¤¤ß¬›¡¤êczÆøYY†³Ä¤ö´*'r=\,¡]d ³‰?P-T‘FŸå†|HàùÊgörVœ‚°)}$¾Ýé,âïSóiT¤Ñ—Os#lèšôSƒýÀ¨œ‘,Y}ÖÇâ”IJ½Xžšs›UvdÏå8¬ú]~“ðê Ñ@’ÆÆ*O¼]‚åH‡ûþ¢C¯p»óç›w¯¼“n:"– “@)5pLh>'?7û0q ™-Î8wjåbÉ{®¥¦p;ÿIr² ø1‘zWoÏ·/Y¥Ã<>,~­ˆ¤:Fì4\¬ª •ã¿[ÝïüO5:ÅÑŠò̤åg‘ êOG¢Üæ% éòæ\{ýÊQu,hÔ•À <ç-Òî|ô ~m_ “«ÈªEöÓZ#%¦'Lõ $iàK‚WhtÀ-fOˆÄ®½õMpˆ¼ƒ¹Ì%\´Ú•AvJÁˆ`-ì.—j0uwéÁYìþžT'S‰ñ± :™ŽŸé ”£Â`¢dä&™‘Šÿ²íV`³+–ú­S› «‘Ïõ๵½þ Ëݲ¬ ÞŽÈðê#= ±›Æ7”—$—4*Ã3ýÛ"Šö´ÏI™€nË5iüÁû-Q.3$’¨ëê¹N*«&’qJot$,¢ì"6f©h¥VÁ…üæANWÙ Ayñ/%»™ ž»s¢Áe–§wg|hìÚhs¾(' 8˨ëDœâ‚ÉOõÈj¯>qnqÛ þ’ŒñàŸ'Ù’zØšô4uòëØŸ¯`Ô”ßT]X(bM½É•$ ü†cÜ}bnÜ™¨G¾gÿïSØØòWàU)) Õ !œ×ÿ®Àà ҤŒÙ}U/zѱ`ÈCì. ÖZº¥Õ˜ ÂŽMtjÓV{7EQ¹T¸… X*¡[Íè™H0‰ñøQ‘½Ò0±d´TLAðÎD›Ö3¶dúܼÄ[ÃúM¯Ñ ãz½­Ä²þ«¥˜KÜ΄džìàÊÕŒ4Ä6¯}¥ÌÀýlævª99ÎÌø(Ü“˜~ ¾ÚqcÒ£ ©kyøäRÙì@š9Ÿ¿ÐÐduÎ eåé”_’1ýêXú' ¯Jè˜_&Y•Œ.þ\WlqÞöŸ!?ÿÕxލ„ÇRGµÓ ¶I¼²Í)D„· îbÑã©V^ŸìZ™UÎŽºÜ@;ç ûRëAá´QgÐgÉì¥L)ñQܸ,8ÌD%ÈPæƒãŸ^yì6å¾¢Ó/0­àèLKxOOM,@fžâ=î+(~LÿÕí¢qÍ7lÍ(•ÁœÃ–(6¬Q=ýfñÏPKÒ>ˆ2²c!¨?üÒŽ ¼"¾šp¦ß«¡¼¾öÐ_+œïtŽiZPÑ‘óc $° ÿébúæÈÎzã³ø¡´Ì×4è lcõ ‡6®¹k ¾ '®¼씜–¥É£cùˆªs‰÷]Bú¨ùƒ%þ¹A8liXÚК[K¯+‰u·÷ݬ۹Á‡*A§RdÓO•Y”+ƒp_±Û’ý‹¶[é,c ?ê”EúK€lR™%weÂc)›¾zq]&’‰sû\Tó†éÊ©Ïó"B#Èw•š0¯­-¼Q2ÿ`¼@5ÉqE V3‰0ºÍ”Ъ—ô¾2ðô’œ´§o"Y\qŠž(}ùP­D€ñ?X _ºCÓ<‡û©ãQµéóÐʨôï&ø·v€ŸpKtâ0“ ÿ§«öo¹WwÍÿw…Z¯by©n7$Ï|_ž˜ù#´ìÓxÉÏ«ˆ´qõh$‡ä#’킜ÄË·½g¨zø ÍÆøyº‰¦˜mû_¤eÝU³ |Kñæ…®±ðŸu¢{–WÒÈYpîñ…þq,ùœ¸˜ËÖì=yà \ öriÆvÇ"Újé”l#ˆØLj¦À™Ê#þ~ÔÛ 8k;z ƱØó¿OLd ‘žƒmHH^¼eó£³å %‘ûtøC«H`ÇÅÝÀLš§bãš~£”ò‚;··†¾äϘÙgæº=ŠÑÙ¥-\è±Ûš¢i±á Õyœ¤ïN…QÜHÎ顚>GÁ K—»,™ØÖt‹_¶]Z¥v––Œ@a7Çæù‰zŠß‹þÅSKæ‘ÛÙ!ÍlúéÁ‘·fÌê#:=Îâv,,Œrq,³# bß;#[µ>‹zà”|ÄÈ-5ûÑñu “T¨ëûhÀ|²Xz^þ…ù< qÜæ‹A’xfNòd'G0ŽžËêV‰ï:¿_uZ‚•M&sÿS€V–OÜ‘’0£¯&˜N¶ ì Èê­ÁöCɶ1­ Æ~ÓT‘¿Â˜ïÈõÍÒ 0h IK‡½×Ò¸÷–{· Mýô u·÷Z¸²6ëÄÚ)ª=ç½míC켓ý“åC‰$3ÐÅú¯qÙ¦ú÷n6JòŽ©=6 íÙkû»×C³[$§Û<<è“#®0=DQ þ¨¥“Ua4 _¥ÁØ("> ä_qWbsU¥D‹¿§œÇóØ.¹.}–äti¦Hz²¬µÄ¾ ‚ìÆ¤“#TÑÌŽ{æ]{ļž®YaÂê—lÙÖ÷žÿï8@b =NK`CC#òB@~QÙ‡îdÔz»G¬ÐØE^³ kÔÍôß¿AqÀ—Z$.ìË0‡—±’0ðëæ” 5d@¤8e¨@C5»X¼4ˆ¹5©<ϱpDı4,¢—GÀ-îÀþô>ôóMë?¢WèuDØ×Âsº {Óÿ‡eáG-ìÜ þÓÝ8èÆfðº®ÛšÆ!þj™MrÊņ¿ßÚµ‹ü6!‡ÃâG³º@|gêGnédH`"UÀ;R¯¾-å~ÙËC;ÂfÞ9c„–‘õ•U}lˆ–‡[ÏŽå›´~_WM4QîÀ$‹pbuˆéÙ&’E:¡ñÇBé®û[/¡{¿»‹xy4 ÷ qëWæ°>¤VîÙ léáË•;ÚTwQ±Vœ¼ ^e*1ö­:‹3½<y]=[AÔAÃta®Ãÿ±U»?‰qµÝeÇ@ø„N>à 7`Ì©ž£8|Õ‚xÀ Ÿðñ!Çn´dà ºUô²mxì"`væb1Jˆ}e 8¢OúxÃÂøڼĠ8…ž²î_Ï-­^CàÖ½9.Ü7¾[hl‚kÈaݹگ‘Ø_ì3ïƒgTÆÏi§p¼áëú°ïê¦7ã3oúÈK1»?ÙLK;ì!jõÿ¿Žäº…Ê—tïSBÀþÝЪ«´|)ëMrê–?\ 4˼T¯nmĹY€J㿘BZvÒ½[h91ÆÀùýæŽÄG¹väb§œÅxo»ýÎfƒgxÍþ{Ö—ª¬ñWpÍ’_ðAÀ*Ç©qQÅsX. ÕMóŽi3—‰=KÑdÉ më²"Êwr®Ц÷Sëý)J•|NåX(Ðd„r§ÌT¬/9(7ìx‘?j:¢R‡°§µ¨;»ÑÖBâ7¦¼Ìäˆ ¶é+”‹qßuHsì|ƒÉ+CR—-ø¼ž–FŸp뮀vZ;[OaëŠj ‡1Íd,Œ HÈÁ<%wnk]Düc¥Ö$ËÉ¥£·ÅmåöÅLÜÎ3E§ë#›º YÕÙ÷R+/®·[xÛçÉïÒËŽð€GP Ü¢m8$,¼nÝÝ36¿&ÖukXÅœf!o†sÖÞß½r}«aWó'›ÝÙ5R^vˆ?Ýy|‚¸•÷ì¥ãu–¥Þø‹˜6S fíuKø€B»÷)DÔ:ÖÊbàíèýg+{¹ ¿”ÜC÷>³ïVš üŠÚôU!Vúѧë\#Ö _LÀ(“£ÍÙÄÃQ/Qúe§qt׬Âöº˜$a]X‘΀„6•¨@€5ƒï}èÍ÷£(‡Ë£6©‹ ©Cœç¬ùCœÙ>(‚Y"€R\Evö¼6½~dpc*\½º§i ›ÿÃÒ¨1½½æhD–ä°ÖWâJcœY”•z´7¼}A¾Óœ ̼V˜%:HÍ K8BUåµ9$xÁ‚ÐÓ… †\ÛkÄ>  f4¯ñÔˆ?+Ñ­$~4 íÌš6Õï“èsÚžf\ÊJÚ¸Ìì¬3³ië—:}g[[t—Ä‘ZKY†¦µ3Á·¤Hÿ‰N}OEüG–›ñmØú³6æÊCå_Ð[; ®¢}æ=° p>Þ?ÈÉ䫬`âùÑF¶‘á¦W}ÂïºåZ=r=¶ (FÐr`ÓM„šhyy3¯Ü4×+Æg øë~£ ß’¹gèJBrPZ$ƒªt­¦/¢<(ÕvŒJA¤]JUÑ™e?©ßÏ1jÅ)¤tÐ>‡Í4ЉƩ9óÏ~ó»ËDwiñ)µ¬ŠKïÒ ªÓlÊÒûÿ75d:±*ª„N5SÂç•ú”o{)Ï'·b¢Â}•žtˆ~î)møÛÀ6 *t¤&`*xÿwÂ`0ê5ÐaÂ\ÊÑ:(âÃ6'sišç2äœøgH¯/¸³ÎRðœAaÇ{ð%¢jóÏ4H€l.(bqØþÑ8ž­3k B©£‹J{A?ú€!á¯Ù‚Ù·ô·ËV^nÙˆüÇ´ÅÆÂ }(Æ ó¡Ü†ˆqóÁâ7ì“6¬¯€a$ÕQ¹=ƒÙ¨*P¥Ïbßø#0i#ªþ$䙇©™Ðú{ˆ>ÿ(ÔÖÓýµk?›ÙyúªÌª[‘ø/Cé5ïl ~ux™Ðì«Z8<صyû± €Er½Úë…—Éî$›¬¡æ¬-߸D©fãuO—¹¨ÆíSíEëiE0È"(LÿH–ÅhW}[—íÉîØM‡“%® «=@õžFóÆL¥\´8SðÌßb›bFWlWpC¦ÞðàŒ†žk½¥Ñµñ8¬Qeæ´ÎNÄ’®aønµ™þA5Í2K‰=Q6ü0‰)|M»ux<gìrÃÀŽAcgúzE_kwV'Ä›VŸšRÞ9R>Sε¶¢5$±T|B€#d1 E³°£?-^Øú’…!¬ÅÁ)ô÷}üÕ üW[â !&zû•fйæ}—êÃÇÿ?!¾”ˆ‘ž|É¢…²Zé°gVÉ¡¼•¨òC­6/á;rƒ¯ƒ2=ù€Œs*]âݬ;á‰DWé½q TÏE*JÚ¬N~•`ÇlyÞ"ž(Sßm0”zî­aßx¸õ{¡ãGÓ ½'{ABó²Ð!Y4ž“?ã8×€W’˜ïqôƒ¹ÌÞóHyˆÄ.JÎF^ÀîM$æg~{œÏ_Y2ì+[#‘ŸÃ ªJ.bíûZ qÝÕ¥õ=ÕmKyžÓø??ª^s4ÈeyÁ.È2ÿ \ìg¢fô‘Ö—„ŽˆÊ½¸'`‰…ÏÇQìQh–<ˆsÈùŸw‰ =`H<îíSlûÒ8i<7€à0¿£êÍôï®ÉZŒ1<É1åyc<ïZÏ¢.ø 2ÆP-Êy|´«³y5ü“\κÍ=.£Ç÷¯ÙŽ/D—¼‚Å4ûè&”M'lqñ|7!üšÅçô[é±.’”«}p9çJ+Ëìyïì ©ˆ¿+p±ü‡mrVÅVRög+ŸÍKSˆð£zïJJš…OÝÎŒB D+yÉ›ÔÒLÿiÊ433*¹pW¢tOî µ–µ?ÊXcþà²x‰+‰²>#4'í)” ·â whK—$jQÏKNɯ˜)uªåm£žœ¤½/»^”ñÉmðåoó¿ËHG\`4*Ó®2p"Ä'ÜâŽì\9o½ŠÐ½Y¨‰f…-áaB§GÿªL2¬Êf !h˜ìK@æH?ë šC•DñÅÝÔ}Œc–}ÇYeÆ+0ªG™s^¤Â‹ÿ.?µ˜lòNÁ¾â¨§ˆ°£p§½ÂZí}É:²Sbì±C¡ÃHK@d–^<.Ùlw¡:oʼ¤H==åò·„•³ÎtY‚í|>‘ så1#Ó»ñ6r-vÄšcŒÆR“8ñÑ]k} MóÃÀÚ.'q1¹ÈB“}}APäéÿýì#ýÁºiÕ;l)‰áY3ô=ß°ñ8“5ï]‡^Š–šŠj± Üÿl‘Ýx1}côŒóÂã8À¾y2ڊ̇p¬ÁºÔY¹äÐ ~'Üé%Øo\u™7éç—fï‰Ò`C³ñY—tP’+–DyöÒÐ'ÒÔC•–‰Ò6Ðù#e»D7dæ¸4ÔÉŸxÞ”,†œZ´{щ½LŸÿ^rÊ4ƃ=z™\.í`qãC‘´­¸‚H0ºÆ²nvAŽÛøKeÃHBÕ¤•¬‹ÝO¯eäc3o·sJèmÈE=J-[Ѱô§üƒ“FÌXòø%w<~|5 šé1U[G) ±7=£(éP‹RnYP*–‰ªMO-P!7l6Áûæ ]΃0-7 m…yÍôˆÈç.i˜5æZ“À”õwšqµ©Á]Žæil˜¯ç1F»ê]"!öJó¤©Wû)¢”Ò øâÚÒ";èdú ¤¡N7ÿ%%ªÀ“Šzì#ÛC» j{—T°?£kËÄkÁ_SîžéVx>ÔT´"`‡—w†ƒa´ “V2Эˉó €Àîö±«N«›GHGüb“ÀêÎÏq~@Ú׈GVXm$ÀÎQÓ°nPa1ü+˜™ U©]Êä¥É› :o÷÷ Xx- ÌØp|éž–†±9õ ZÛP;à#=^5¡àóR6•„X¶»Ÿ¢˜èäu>Ëä¡¡²°Ss„O'Žß¼ öü‰ß«B*ÁpôFÎJªÞká†**©K±Þf ³”î’•²S³î~ÎÈ9 V?•ré4q~6¬h ê[Y>”57™ØeõVŽ×Ò€SBèÇ+O8rú+ùµ_“Y¥Öî"¸ëåÞn!§’E|ku?=Q°ÒmûŽ [æʘŸ@rÿ1!-Ùûkrõ‡uè$amÜ )Œ,ÂÊ1y2€¾¶šFÝIQÛå±kƒ>Ð)D㵦²%ÄŸ•Ýzá]J^4ðÿ¿=Ü"MK2bëákç´y~FtªŽDá)g¥ÏUhð ö”YŸ-ŒmæÔç"›ųŠ~0ÛS#´bò¥²–¼Ã¿Ó±-u¥µZX¡ŸÑiÂ~™è6±–ܓՊfbK°ÿ—²<… ÔZÚVv’Ìö޹5h2-‘pf;#Nl"ŠÛ-¢6âPÔ©àÔ:Ã¡Ï Yr]b}Dk§»K¬`jáÖ¯(×€ô®•ÌÝ羂…'oÑ10¢«ržT íÅ™Lñ˜bIL·¦uÆa/uMŠ˜.sUI[>u(\²c [šÎcwÜqžËdÝçî!&’Ç>O”«‹]9õü§n¸Ùø°sdòAJ æIJŸ'£7‚™ÊàÞ©/ÙÛJt= ižo%buÕšq£ýg;7XWÓg¿zÜ3ú䢭钸ßÿ;ü}NÞv„ƒòÃWfz½\Xhûໆ¬Š{¤O3 hK®&Ž$Gª:s rVöQöbc8%Uå. Ðég9F=¢À †ñÝ¡'|[\üÿcVpgƒöÀI‘]†Þuq¡šZá¢nhmžÈ± FÖLÿ§âBý¥ ›ùF€n‰Ÿÿlmœ@ÜÜ8ŒÈ§8\°=¼ÕKÇvN˜ÕÿÈ’ÚÓˆJhæ%u¢7(Úãò·&ÈYŸúŠ“í'³rãÒy'àbšì!ï+¼473i¡Ô’oBнÃÛjçÒ»¤3чz™ÁVW`ÍHÂuäoÌƼîþY S4+T«B)Kë)'—wþäE¬óZ„AÅÖ\M+NiòCû‡0Úûƒyå|+¤b¬ç/h#Ð’Q½£Úa’³çÚC„ƒÕ9ÓOl(@yd‚÷/Zšoƒ‰ÿm@9™ÃÄ_Ò‚ˆ´CǼK0¾CîsxÎU*nª~¡N)²™9GéÐ7Øz«Û &…‡‰ø£^:ØÑC˜­,"ëî` G‹=]5Žúsq-èïD?Ƚë¶‹®„-¼7¡Igˆ ‘ǠǯBK"5”@Å»úz&´#{Ï×þté”?~“sIÃ=6‰èc¨êÂÉÝ ÿzzíŠsÇKßÒ´Ü qÞói}Îé47x„¢‚zÏݶ¹ | »6%‹=”™ùñdií0«Çc1í}03îDn4 f\'g ?e´XÐByéõƒóý`à•™54NO¥J‹ k“¾¢I8F³¦Ð¥ÎÈ4°JošÌÑ6šOê0dË…ûµ‘úχIð! ŽÁêØuê-:Ÿü ÆÕ{¯‰ß—‰ ñ¦­ÿñRñ¸‡!£ …åž %õ Š  pô¹+j¥=¤¯Z«Tš.=q&\OHö &ª¡¹¢Kžddö§»V¹¸Þ£(v£\¸RïL²žÚ€Ã}[œq%‹A¯ûK´3œ]²†g{=S©wÊ÷œ„è -~~g3mÏ€M[«¹ã„oièòý€ƒ º\>/¡D3Ĉ-Ä"ã&‡Db×0A×l&˶àW¾é™ƒ·þ&˜Öº4 ªÞùqŽ7éŸ&•nÝ#xš,‡Uû]µÅ2œf êâÆûCâЖˆ`°Š/æÔjÎ@D!›Þ¸<~ÔÆÙ×\%a;™ûš_Àeêóä¦5–¥Ê›ù "H—ȰüoBÅýë‰íEÀ”#âé¿}×3p"“ø4#ÊUn# žSqúí0eƲ۠¹jéoñ¦%«ÆÆó³6Þ[6CËWÓà!¤¯äéXFõÇ£6$2DŽô‹m¢vâÙ äpûùS:ÏeƒÂšÑ¯ûü*/îÉb$ÊͶ&×TaR=“?öÉ®<Àè «u§Œ—:7OvÁó2¾EÝà«“òÌ ªôK"{€2M`]3и„I¾ªa¨)*çXŽŽ…¼BxíÝ`æéÔÄàº}…úu G bc€¢gøYâºW¼K;Øüì E*‡CŠaUФ[?Ás›G}ã}# kÓ¾\2yýÖ=èÖ¨¿©>8w6ÒôY‡mô @s56ú"R*S×µ †8eÃ>6¢»kÔ?ÊPY_CÁ#ïß»\—a„˜±‘Gø˜L[JšÆ'ó®c7gÎZ1(Rsúï(•ÏØUëDœÒUãÓÃõÊl´¹—Þ;f„ªK&:„lô)bœ–ÅÑÐÜ$}~vΘ]oòŒÞxᆤšß1ÔYÞß Ç•Øä´õ´ÿ½2„iP!èíî)rG´Äˆ?E¶²˜JÃ\êÊjÀŽmô©¥˜eeû_9¼maDÏ”ÎÎÞ€Þ÷Ü3íš~Y‘6ž,r6±Ò ›œµj·œÙ®Qò÷Ð=!R+c®:Ä Ë)§¤(|ºFº÷ämš)bŸ‚Æ‘½cÌ¢·µÊÈÍd€jG`Ú=.Ú"„=8u QÒ7´¼ÑŸXÝYú‘\á¾¼ úQ䀂ht:ª¹¢EÃ$ÉÊádæS;\úù Yl›Ÿ‹Gˆ Öãžâð—äµ5 Tþyø0©a1áňø‡ð: õoK{îÎíÐÿârÞ ©‰b¥Ë߃àkÖãRL=¡÷ò»f²«ZÜôbnS[:ôé³?Ë•{Ô€b­v@ÔjIJ¬ÝL÷]Š}ËŽÔR7øÿoªÚ\öhÛtê`~_«²ðÚO¹CGñ3ôè¤bCØ«K DkáÆmž²P£¾6?3x;tÓwÛ­t‚á¿2Xrê¸ëIi˜X6_²'·ˆ¦ç’]<Žˆ^Gèuâ9Ä´@e`  ¢S)€ÖTìC8Ú}fÁÓÓá<À4IJÂÞÃÛò6c^–1xÏWœ÷‡Lãü3—ÒhQÀeÄAÚZË|bT¬÷˜ë zaÖi);µ²ò×½¹¨kaX8YF·Æ' ©ñÈ禱4Göu0½s4vý›WQ½¹pbëžH8a›ž$ÓŠ%¹™ßT¿aî7ôÜ·œv¾äm>ŒT á–BCtüŠ)PÁñϳ¤EL-y>Ç4ÕìÆ®Š˜ãRéî{™ZH=¦ëAGÌRë(‰öF8â!5Dc8Ö²Œ¤éÉÖ/Ž-žžÝ¾éŸuÀf+dñ¥2›¤;¢‰´šú¯vŸ‰j«blèq<ƒzöØ„‰3Òaý ­±¬cË[`› )ijw×a¦71uÁ™Õ’Ц@¾æBqzM³ v½f™¤µe#½†,‡÷Ù…[€P~z´¢Æ‹8k?j%ËÎàaS¿){Ÿêé N–x÷;Ébf€_ÁZc ­;©p@v¨tº­™ βËDŽó×:Ç÷«]ïI.@ÉJÀÆà-AæK@Ë=¡ß\…Ö]®‡ )D6+ËŽM¹Í@ðÆo{ 4Dd %DŸ8cò‰5ìèâ3"Ÿ”iNƒ+ ÂCpp準z<Ñ*¡%å3©"¼öåôT°§T¡ ÙjîžNt4û–TDWÍn›šè¿ˆup›:(É¥—ñ*÷zW£ëèÑÌ@(3Ü%§§ÆD VøÇ͵ë"ÕB8·.-÷˜8‡”ZZh1>'úUw–w‘—€ÅÆÚ‡ÒÑXo7¡±Ñk¨îû$¥“<`×MèdÁ {[qEUcãuÏ›ÄXõQHÄ]wšçPÒ3g·îÅÒÑ M)‰JÅdKòjhžhÕd̮ŗgÊMôìËP,IìæoU‹g,vÜ]ìh«‰aÎÝgl_àÙÌOu?²Âcj€F ›xaŽSo´r+h²(<‘[B¯¥$}àÛó;¤ãùb­¾lòºß’e ¤Œ¨Íª"Tv&öî*ž3&²¹RâFòÑ9Ô£‰Sb3C@gµa秬ÙA`éï3àoœ¸°ÄZHQIüÒ¸g(¾Bõ£ y'Š­}1·®CEý3Å…ñ7y¶¨—]21_^—^N´~BÏ„¶Ã7í³ãQóðíŠX²hT zƒ P­É=s¼œ«Î†/¼­…—E¹'b¶ ÂÁà ‰º“\+X׃D˜uï’©Ã âT8z½ÉwÁWîdb¦½}°EC^Piš-³‹ Õ¿­±¼ºÃl£öhPu,´RE"Çqû ɯ›œÌ”“àf ênв–& Aú1¨: æ—ˆ7`£ƒ“`TPáaÚAN;N_ÕB¸Ã±hȘw,Iø`F¤­Ó¡†î[\;MAxÎ>N/uØgè¼PÑ-®ëpR…`9ðžH˜õXÞÔt½Š´Œ™éÛ ûÕö7€|wó‡‚ìïæcÑqÈ M¦ŠÌ“±d È=‹X…ÿzrû.C+ãf¿Ð}]qöasÞ†¿‡ÞáÕ°yš¡Ë _Æù2å,ÊȘ¨¢/µf¯FtŽ€¶½ˆvû7²Ë¶éó6àËíá{0Ü3—Ø*óWgçnˆÛJÂ[îí¥Bý^ÆÚ(b|ñ¯¥XÛ^ƒË|ú€_œ2y¥¢šoS’ƒÊ}á­Çƒ–Ó°A|dîx±G±$O7ˆàî‹¥¨•·üÌH¨ÙçÊ+‚Jp¸ìÆCý,˜–Iµ$fî/³t±Ú¢«¹ŸP&ÆCSµÏj …1~Jçÿ)˜×NÏ»NTªX'W2Sc‚¡É€ó+E¨OÒ}¤hék àÔW#ÃÁÿîáTU…ªáÍž3Ë=)¦KúÐØqøÇºÐá(/qQ-º uëÆºŸMÊtŠÉÌþ¯«„‚íðÒob}oåÆp0¾û®ŸâJi~RGøòûÁ7V&UÞ+³]è«<ŽJ‡+uäd`aBÈ&^wÒ“½~‹z† †.Žmø *K²ƒË“e¡µ´kìpO [q¦3X\[2 l<5HÓ¥|uã8Æu ½FŽ)ÈœæIß¾áMöù´Qªú‹›Å¬ÀUúˆ:¦n£#@TÍ»,6ÝúßàßhCÖ9ÁÔ1S@/=$ðD\”¼í<>®¡qðFÉÛÎú÷‚lcÒ“" ºÔ¯mÁÓdý”Æ>3_輂 ü.ÚÛ•¯ÙÐ*¸Ö“ÂÐõS‰Çe€3i¸­Qõ|5òÙ®Û}®ÿÞ¦Õ†MñÃ’#‰ÖÈ•ua15‚§äÅCRÙM‚ –çf²c‰ $®SG@,`çÔëfõVH’v@W'P=lŽ dn“ÕyS8€^‰o¾ ÀÁkÞ†òÄvRý§o‹³6O‘©ØÐÝì\ô×2w[EÊaµ2ÞfR3ÔÐ0]à¥Z㽡k)·ú® ÷æ YPüßJ·ŽJ†S0‰ v*Û˜ä³ÑP[@@ÓòuølxNµÆ×sÁ]ôü*1“×ûp[[;J,kW6ž‚û½¿fÛ9djf¢7 ܜ_}8õHÑ«;žøÁß±Rªõd[¥ü]ªsšóRÕñÜÉAéÐÚ§ÊÑ9óÖX§¤N0çN]ŽvW.l8QQ(Ã7õ‚c†ëÚóñ&X¸²’]€ø ¼€}‚Ï1Lû@³¨2šìˆÌöâ”"V(TØ£r-ó–)©é˜ÅF¾`>׆À%1ÐïS.¼_U'~ÕFÏ¥²‡Þ¤1·_z¦TH[ú»Ow;öSÑþ4ˆ6šÍˉ‘¢»ÍŒ¨•–õ4s–¢€G5¹á?½Íì£ó‹Û掺-;zÈŸQémd¡ÒIßÐ!D‚‘`<ŒÎÁMù ­T %Yè$O›È’K0Mª[§ ×¬wR’ÝÉ% âã½ñB# #—TcÓ <–Hz}×9¯¥¡îTlB«ˆûðEN|üá ljê¶J“Ñ^Ž^Ø%£I½@ÚÞ.X𜙇þ«é@LN¨È]e¹¢k¬G0³HóðyåÆX÷¨ð´[K±<ƒJ´Æƒz‚ùÀ$p¾Ê|EN²T‰¨è„-.×9#vq-ΧÎbx4Œ Ò\nÚ!£y­º§Ž  MÓHà?§«k6cYÄ>É´Ó9×@o†¹püæ²6[lŠÆ¿³éj-mªÃËcšIbëNwžéࣂÚv3«“ë=is:ˆà‘Ÿxƒž<8˜­ ’ 4HFÞe-OTøã²'0/üõ¡íä΀œÐÓ} ×™§¬Eæ‡v G‹é¦ ôÙÏKe!i¦.Ø¢£ 8a=|ÇPõ«JŸ¢I/˜’.]úê]ˆ5â¬ic›ú¿¿œ·ú‚ÔP°¯ªÐ¬>ô:›îÊæñÑR,ññ޹ú¡ýÖ×Öªí=KìÉ#‘H¶X³1!½´' ®£¤@É7ô¼Kõ£kÄ îÂÒþRp¢æ2à JÃ#½¢ÎŒfKɬ­af¹–ZÜsH'–#ˆ'iÓ¶Èß XúyÈ®¢ ‚¡n~Ã/»ã5B"äT¸ÀâëÉ‘†|Áe¡ÂºGLaLDBm´Q#¶éRv³ƒÂû1–‘L0à%º.šdZÕxüÃ÷;;ÒŒ…KÕä©kZZ¬eýK©vÝËà¦A.sû Ï=a¾çT&~îeúêF“à\Ü›Ÿ˜Ã‰—ššÍ¢Ÿ¥%Šg]Eßs°y ”¾Uu‡PŒYVŽbèÈà>u¯pl¼Ç–‰~éÉš:7Smูù”8¢ˆšø›`zgm ½}ixQßF²a” ‚ôàµFU‚{‚¨óQè¢ÜZc]PÇNÌýX´m(1š)’H™xb£{“qá úé¬DdxlÿAç /R¼Úi]µ&–í!n äú^4HºI¾°õå¸übòr££E®ï\ØeÕ |Ú@†€¿8Ó_ÉBÎ —Å$Ö'vX—äM›OLúßN‘êå­TDÀ D[¶JDõõX¥DÎ ù;û&ÞÙø$#L–ÀÝ;fÛás2æè2Æ,–pe ê Ø`,£ )ÿ šiD›ÛhÖˆ.¨¿­"Py`A´žãአu­JNå¸rK5Pj› '¿/wS±ÓþÏ¢¨g•œA÷)¯Ùð¾ ùäêgGóuúÞG=&šýãâJ_•Ë—Æ 5Ïø{v rü Ç„÷1b}ÝõO÷¢ÙEegA€ç¤ËGë‡ÏбÖïþ&›ø=—ç^®8høq”±äwÂSÑ„ér8wã¡M³æÙ)ðb’›¾ñr™­— ‘©'W@ÞF¥Óï/èõ+‡¦œ¨âltîZ ƒËÜŽ÷ó8¦]}¦æ‚ì”ß“V·bHü[ hS'ƒÇÖ—òÒ°®žõZ­Š†LÀLd»M\¢8ĵˆ,gq)`(öEŽhõÿs¸70,gÃXN¢~Ÿëz•LªŠHÒ+QÂVÃ%×¼¶îËcÂÚ…YŸB,u«Èú©*EFÖí[¾L¦Ï–邵òOXeÔà®”¨‘é.AÞÚŠ è¯ÖwV/Bùœø HÖ±›Äü¡‘¼GºÉÒ· s„¨Ð †Îö¥Ý`è'JjR³B»¾–À 5¬È^mpo˜¡ÿÔi\¹—E^ÿsÙŒ™^–oy”5 $ä°‚-¾‘ßhšÇ¾§•mv†f½;@þRÚbÖÅÀ¹µ/M< /›÷®ebÈ|ì°ˆ)0TsÉ‹éÙÍ3ø7k“oeúCªÁÌ q›âH»›À:P¬ÎKÛà¹ôêuãW'+ïS8‡•+/€b7àóö¿ûX`JMë'_ÌËt«ï,BêçÌPYAKfddÒ«¯)£Q2TbõÀ2Í÷# ᇺŸœÓò0A—[1ϾÄg rË gäJ‹Åg©’’0#)8P«:+ñOzœ×‚³ã“QŸÐe0šÞÿ!÷ÕØ¾¸ÊÈêqôÁ "eÆš2G0Äh‹tÕYez±h<;+åÜßD$°t›«úš$I¡S²k …rpl9MTùi>¯ø7(.cÎE)¼[É4~B wF]$5^¦¹\CXןõ°J±rv m,?ï¹g¼ °ÊýGkÆ@/©‘üÇ@òqÕ7S—Ôe¢éDš¦oàXb£A©ÔÄÖ°3ÓD'=aÉ)MˆÔêh°nT/˜haºÜÇsZÝõ¯?îÙß•ÛVvkÓƒ}£óz*ñ›~ÕÝGÉ®ì¼@šö‹.SÒKìB%E„ó´DÇ ¯-#\Ý¢ÃàÙÌnQ}L;êìçuçv˜g.ÅÉM%ÏH¤ k¿9ƒ(§â†-|TÊt§tÝ*³ €U =2 c<[Å»÷P=ªZ·co'ðU¹˹^y¥ƒõ·lÝËR1C¡%¿³å=P,¬.Ž& rªEŸ™–ÌÐk‡–Þ)æ“2ªó²€sÀWÀu \Ó1<»ª2N 5Qþ;–=mBþ,®Ë"ð»“5±Œ–›÷“Âÿ_2“h{/6¦™}`¬.ÊÜ81Iêè‰^¤ÅŸ¼VšÜrj\"3ÿÍ\‘¸³ýALwé‹"ŠIÝw•Ë>É~)®:l®=qK}9\4çQ»ô]PRã²²ÉFóvÁRLë)tBg©ÿÛ.ªNfé^×=kÕßðÅ5šŒ5÷Ç@&½…25L·×0\5!­6áÝjÃÅ.;×ÎF3ygËè¥?l(¯'-f¸$PþÑ)f-âĵN¹Ø_r†ÇÜ– }Š"ö>·Ó5 UsØpUA†ðævj½Åƒ¯¡[á™ßõ>uùåÐÆxiÝ(MY ùøMeÊ*F G¶ìwO3M¸ù*0<%j1ý6b0ð*èÆM¡@ÍQ‘’:<Éü×½ON =S)ãEcœ…By™œÜ1Eíõ=ž,z f¨8òéÃn_Ž ‰È`Çœ¹>“ 9/Ì19(>&¾ßd×.˜–­8ÉZ|5ºÎ6ðȇâpG°.§¢8{Á2";õ‡Ëö\pmÄ$´áÂÙÌöÆO`3xíF¹ý>õA{‡€SćbyõóÛm¦8•៊9•qž›Å"SÜ¿ö| üPꜤrᾩ³÷•âèîÝ "ùãã"ˆãÏA¼œ@Žo¨ØæÆv[íœÓv% €¬cìØìØØ±í¤cÛ¶m۶ݱ“ŽmÛ¶ÝÑüë¼Â¹›5õuYUßM)¾J¸Å°=ìío[º~à;Ót˜~:o£»²í^ûv¬qdH Ë/=inú®`@²kdÉlÖ°§;!Õ9ˆ²¦é——Rƒxþ1¦!F›RBÖb+iÔ=«à‚¡(æÕŽVtãŽNI7Éã{`ÌŸ1L“‘ ÛÌ‘ûü&ˆ5KKêùU•–´•ey kùn…«çBæ˜4Û›yÛ6Ú[ìñ0νX~ÌÙ?”‘1˜Gfˆe,»yì®;&gw·µCFJír´ICø´·Jû!]Ïà+qì(GYCi`¢ôI§‘ó”ÎÛdc«T¹aŸ~?Rá2U'ÎO®ñ¡zÞ5dTøõ!„˜oˆ|´¥°êw`2Æ\çÈ” }ºã½0¾;¯A_ÀyÕ¼?ɺHÛoØð0ˆ(P¨eKå#”–ÁKJ‰g“™ëæf…íÂqF¨PNÿ(‹Ž®ÒÒM‘ ÞºaU‚ЀÙe:Õ¹Z™-ÿfàF¡(¶>/r ³¸ FáK$´ÃÆ9Åê×+naiÎ*‹Ò×€ A(|{¢ªM¾üH-¾1¸Ä ­peíiK—áñ¿¢)üodo=BG FÞulg…¸•~•¿¾™¼87$sš‘þ3žqLÎU„1éGÏo(QªsîküØÓ½zzl2œj‚Š)ÎÉÓ†!Œ“2ç`z³û¡«Î mA¼­k—,fœbÚºËzÝÈ/®tbvEÆ ˜–‘î>ø SÁÃÏßf†ÃŒ[ûêo®¬¢Å<ÉQU¨/…¶c“™+M.õKk*n¢4­8zªÄôw8lØè=“üi©ëouQü<_ÝÁ ã•MtÑ ›;œ))“‚pûþ½ÏßO½¦{íFǸòÒãv08ÿo^Ô|l»‹’@°õü^~èqÏís¿oÜõA̾$h3ž:hô˜‰‡Aó+p—ï|Ä%œû¡&V·9üdÑj¥3¸1rüÑéÑ&×n!£\°·'“;¼É7¡9ðG(" Õª-Y8£Åö½e»FÍ€uÀXÍCR}PÿÍ»qä¼úC–š<èTME’Úoß/ø®¯ÙpÀ=òÜ!æòýè,Õ’ÕMµÖò©¹3¹`™4ÊÀN¶jio;žÈTž‹LÃ2CWê¢éDÀiÉóÖÀ¸†sÚ8榔Hk›ÈRUò¡¿Tì×§&L2ˆI+ÚcqÝyðÖ½g(Fò×ÌÝi8e%ü¨Wƒ¾C{Vžm»ýEóõí)‹]ÆM:ÿ­²™Ic _0ìââ«wTÙÄ‹”~Ñœ¸Àâ»#3ɑזvô W«ZIà­ò¢{ÀFå®h½C7,ì’ ß)ãd¿–ÎG1E¿CʰZs!i ¨í“QÆ‹è„Êíyã2¬}¬u¯R’!Ãbý¸¯fD*íìk£#wäX×üòѹXòèr–ŸƒÐUöiÐa²Ì8“Q¢-8”'>%ÇŠ£ô}»¶Ã¢q ‘ÓÆò6êBÐÄ®†?þ•6 ªä 'ŒN̬Â3[y<<õ÷Ý)äÈ//¡aмî”}—‘ÜÁgžWڑĨ®£|þUvÆî6ýÛºŽï¿ÚFæº,r~àuÆÒùç8Î.úo}{D>UÒ‘ˆi4„±¡2U¬…5dTÏBÒX_Æ…×·Äik ÖEÁËâµG¿XÓ -Zë·o°ðÇ~µáüü¿käOêïÜ™\}.A ´æÀÊctfNÑ®†ï—² 9í@ØØ§†½©À*Ë$Ÿ$ïéje&FºV‰´ý¹¾WOH[–÷ºžÊ"‘¼‰‡èvâúë4²¼s¥+1(5¥føeshćýÌó¼Å‚y$;Õ£ëg~Ò0›œA›‹‘.Ç›™òŸÌ:åtÒ=1Ÿ¢ 7ô`;2U½úšíDM½6І:C­Â?PÇG‡ï'+šò[!•ª}”ë²ýr¦=¼Vmàpä{xXhS‡ÉäüØ47\pCí2š©$áXÊíñN=ü PövœÞB¤µØ@±í z½ãf…½¤á_R?™:QÎG(»¦_ÕÉ ŠVÆTHlJæÉ8¦´«Q}*‡Ì,©_‘Æc¶BB¡#]Ÿâ*ðd¯Œ 7?…Ø;+fò#’pïa¤=ÑDû8²H ëêÛI–õÏxÌw2:#h‰BM¯l M™Î3…­Tj UaˆxÀ{ár„¼BÆ® ^…à»Eæ|VØ£–å=è&3kÍ*ѶJK´bžV¯§:^-'¼¸ôßàT*@Í! /œ °ˆÃ»$ÔŒÅy=§ýì½Í:tZV†fºÁ‘[_ȉu¤ÃºûœLq…›N^°Né:Õ?rÐ|ýTÕ{F»ˆ8÷#Ô#˜e–Ÿ›çNô!²7¦ Ä^ÿ~°{¤$QïŸEZÕ8YBg‡ •B‡õ_K:ß) íö†é°¹‡·-qæŽ*uâÜð¬(dNÙG½áFb2ˆnh<Ç4Þ‘ÌaNÎ¥ià™Ì'Ây|Þ…/ݾA”KoÎm²&O³ª˜•lglêñEòUDÇB2#ڮɻ<áÈ“`y“k²q¼5‡N*v>\Ö)£—ŒVÇë¡ñmyç¿®2_y<²Ï'Ò1×Çxþ\h35çâw¾ð鉀ŸAäBåÃ/è´Rì)Þæ¯~¢Þ­wî)Èoè8aqµŸÉ•@›sÜv[·7x ƒf.à8¨XÙ\aظ3llî;§¸èÜÙßeXɸl.~—õ¨ø|Êy§¶±h?cºË—í¢%"ïM] "]ëdÞÆè¿…Ú%¶R1PÜÆô÷¦ {ÌŠP 5áá¬Ù¶-RO=JÓ!à§Ê‘’µ±a©]zˆ¯/ù§„çiHÀ•¹(ž%êe™½M<‹ Ž9ðÕ½™ª‘#Ô2«¢ÎUKÊÉEÎZ–¯D‡p¸ ÷S9fDÕA ¥hE–„‰>ÅSKâUéàœlŠ\no_‹Šžö-çzs0o?Z”03åÚI*Êü _cTòJŠu‰”èÆÏ©À½¦5˜›úë¡ÀRˆËsU^2³5‡æŽ 'bÔæf´šÞéÚ´Fdz·†˜E÷𹲤>…7úÃ'ÓÙñ .Pò4²¿ªÎ̵3–æâ‹;ddSÖW!„Ë|ãä³¢ÙaŒ uÕVÚLsn+mœLò%¦ûùÔ¯°’°Ü‘ ú°Ln±÷žå$RxÜ—v©ƒSV¥çå–Gñ]Ü+Ù.Ýsú‡Hyþ¡ArcÐ]–í‘ÐÎx±ßèÝ)hXÛ‰£È}—Ϊ»tÚ¹¡Ý±¶©ËÆ"Ó½G…sûhèt©Š‚'Z\nR·—2AUïߌ2V÷F:aüÔÎÑ•œ7ªþÀ'ü0bºûÓ´eP£)/7q7ðŠêsLê×Óߦޱå|¿Ôzów„' IPš~ÿ{4ï©^CäëujÊm!Âç&C¥4Œƒ¿;X÷/$r LE›í ¬@Ùæù&–ÄŽ­ƒ‡VÒ°ùTŠÆ«»ßZil1ê¼ TIY{^UÖ¶é1ŽÆä+'$5pæL(ÿEnÒ>?ãB0ëgZ¬J5CíÍMíX<‹6Ý*ý*²”.…Ln‹jÆæ   ’ž”:jÝèôÆ=³¬ â1±µeê±@­ÇOn ]/{£âW—NÃny¬ABËêpê蟲4ud õk ê“è>– ækóñší¯£¯òf7mžT¢ º]™’)Òp ܵuÃuòÙúåÁñ›·F¶3q7i¥Héê7B^0Û! ‘|tîsÈŽQÇå Î_mcÛÅ'ÁO³÷ÿ ÿÝ?{àN™„õ‘¾rµWWöpÈ@ô8É™Ä Íüä ÜKs8hÚÙøŠÚ©‚A$ Ì5¢Í­D&9nà X¦É›æˆÒdPÁ$bþ#ÒdüõóHäÂV28[O¸Ã0ÒA™bhUáq|I°un1"1ëÖRn~… ȼÔùûH9X­À /_‚Þ‚w”c`0AøÁ•öêŸä€9´-ã$'7âJˆ%ÅMú-nų7çö¥Œ²¨ÚUâÁ! _èf†pÃkÖIápìíÍj ‘Xã®ß¦fy-ÝînÉRþ+ðþºè@vÞ ÉïjGžÒ›F¶øXJ´xmd%ÅdwPþ~õZØÿÄL8Ó–+û×Ù“Clø±Ñ³Í²ÖìjÁ«®Xr«¨Ý™Ò­2tƒS»ãJ€åòýlYÜ䲪'>ûÈdëñÇŠˆûô·òèÚVà|þ$ wâ1—Oæå¯³ØT 1ØšO#0†1ä" –âõíéÕÆ qõÝ/Y0¡Î€-4tÂ.xýa—ĥŕlkU)¨à²n’Â…Ksêý܈’H¼î1¶2EI_,\,Ø0HûœååW>´÷͹ºP¦Å\}°Äú«·¼á¶†µ|îšÕíß lOD¸ð>¸68‘3©È +C:3&exWá3ÌZ|塯jù¨©uôñ³±¹†\ÐL ÒJ°†BþjäaÆ/êÒ%Ñà§? #âƒsÔ½ð{1¨r?:à†ï—"ÂrŸb„°„'9û«£ˆùéQÐqÍyNR1X+¢dsÅkkcvvt’!ù…vTNÁ1%:VµB"jÞî*Ë®äùUˆèªÿ`Ü "“?kOoÊB‹ëB–§órá Ý(.J¡ÚCÉÆ€¦üóAÛ?[í7e]‚›B˰_ì>;¥´™­°"ûÅ¥öTêºzÛ´F´áO¾w½Ö‰m-ºÌ{T"¤YIû0Å0¶RQ\­Ö»…TüoÉ÷·*•8¸ù\¼f.›úN0}¤:àSöùq e±ID²g’0}Oî°Æ×ÜÀpý¾4 Æ1¡¤/i†(EþCóõÇÝQš: šŸ×AöçNŒÂb|ô©÷110y0Æý•€‰îÅé;ÇU³´æ"£'?Z†é–oÈÝÐ ,ìq °’:߿ܵ©ªØ¶g^«õÊØ²Zîݰ¥ú' ¿y%²yö2MÙîàdÅ%_?¯®¾H2'Ô_d?7*-Òæ‡Š&Ì­KÁ¨ˆÉÂÇŸÑ_I)JoA†[ÿ`ÍZìœjs­|Ì^<÷T-Îà³æµÀò3§yË̓,Žtw|ÃÁätŠè{.›&‰p,„eÔ4×gK&Óø 81þU’³>›ÑltwñÖ^¼¾Ô5… L‘ÅÁ¡6ï<¿ ‚ÈS€°»±kH¢À3|+Ë›ËÃ_aót*´ÇÕßÝÚd¥CÆŠ)|bÃ¥Ø ³ý»Í&È&ÖF®¬¥LIé›-0,Ø_áçj×ô<óÕºuÛÊi\”yÞSÒ7âã›ô¯ §Òµ·™žÒÎÖ2jÜúV¥ ˜º[¿êŽEÎóFµ7ëªäZŽ“üŽ©÷tœÕ#IÔ¼4’íŽKýN!ePKÀ²Ðds€GƵœÂNÃ0‚@˜Î‘ÃD‰)˜:-U‡ZC‘e/g4²u‰£g¸J_Pì/ ¼¯*5 –:ÇÇ62Ñ•l,÷T¶ÔZ{‹Ó)Ä6ÏbyLÈ›fL*6©Ó¥='Í–.šì£Owõ°x• ³·™o/„%ÕÔiL»Àà±ôd+Qd.H0=‰ü-L ¨âã—c‰“ÜÊÈDd¾Lð? TqÇ0åÁ|p²8’o4;9 Ç3¤Ñ;@ýM+£¢7¿’Œ- “_ÝÉlß\5‰žnzL›¶ìÓJøF"ÆnŽŸŠk}ºôTÒ?÷ Êžp,VŠêU1zc¶þŽÄÏÑ£R53•\ÅWKÙHq[_›ºY=p<>NîB[+;××Xw°¥8è$￯v­rzýÛ3”Ò“æ<…ޤ &J¡Mw&¼Þ»%ÿ5½À”Ͻ×à—ë&³(x×6UÛt‚9lêü7çÊÞ^¨ä»KU”:Æa¸BPPDʘòý¥€ªm0k¨|ýtS`úªÁþ¥l.B‚AÇÖ ÉÛÅ/l½ÚVéA AÝI“Y¼ygø^hÎbß;Dˆx÷¤çiR®}Áß æk ÖÄ]zŠúZc99æm^ìϲe7}]‚Cbþ‡¨¢rÏɵ^ê~™ë—k¦1Kä¶·bmêrŒWïˆ]QûÜ©üƒöŠ™ 67 5b8^(ÒOOßn KYyŒ'.MˆÛM„ûSÂ"Ôgí8a‰€Y»‘”¦¬ =DÇïåAÄ~“¾ */ú£„O2Mw6‚݆È;0ŒAÇþïˆ?öë1¹6yqë™C¯Nœæ\@1ñý`RÞz¾ßC;R•Mÿ›\渘mGZÜ%gÜÓË ÒÅSÛ—ñ’rúZƃ\“ΫNh׫ÃîØŸhExÞ¿úŸ ß„ì–ÉTu´{ŒHÜy=˜ô0” U ¾wˆQ°´ü¡*nt]ÒÞ4œÖ%ÍôåôµžÒ’¨a65÷ª=BùéŽÀ÷“êÑ.N–DBvX ½¤ƒäj¢;»4I¥?ˆ«‰ìƒÔÓIWàâ$^]OÅÃ6D#, 9‚ ?cšX?PIXðG¶MË:‘¥S•"}”¤AIµW“=©šÌÚ†WyUڵ˽Ðñ$O¡Õo•_˜ªCWÊðJÊe®Å°£DKºOçcFor´fƒtÖß–ý£Î|aîÐϘ$gƒ'…F#S1Ì[vEF:å‹ÄØÕ„>šYbmI'(Íȯ³ÁÂ=ë[]{„Ð5æ‹h\Úí¤ùæ´ˆsÆí;Ëèiem.…tnÅy´G™¯¯Œ`jEOÃôMïV죛0p^PAñ•±W¶¶‹íåðʘÒü&¯µb‰±p?Ȇþ{&ÔËÝ·q\¢<i’[a•0ªÒÀFNë»Ú_‘æµL/ëÖŠæ‡x¹Ô¶ú!ˆN‚¼Q‡ì?ŽirR„ŽÙVÁë³½}&šÀÜW³ZvwVÀœ騾–~ õ½ËCuÒ­Äë²\7È{1zݔš†›k<0m›+"Ólô?Û4óÚ\•ZyɯK×}(k¶Q´5•‰õÄòfƒ·T˜ÓH︽ y5y䔿ãRÖ! =GëÔEûw9UøÓm8ö|­çµýÍÛqnÂJÌü@…mQ¥YsŽ…Æœü~ZtJ®ëñÀnXˆv<ð}ç—¼Ük*zŸ:#UA6ÏbóÒj= Ãàq’?“§¡"ÄÆÞk s9lªO£3Ùi™ÀÉ4ØBùt?TD¨v¶Þ4á?Ûâ1·Ž^Xmó¡©½¡<«›$ÔíLrn™\uù¼f: gH¥Ó<3]­ß‹5ðR6«·Dj)€}õeãoõxËrBœeRý‰!#ÊÐÿX[4(2ˤ.Y|â viíA°~_âל©o!Q>¢·n‘쟮o âh˜©“˜%HóVo¸QÿY©+&~\±eR™¸î!HºŽjêtÖ.™gw¨kØ”ªþ᧪!-/pIC.IzRN0t_]Îô‡Ø8å p –#Pe!¬”¢‚úd”‘™‡oÒÎAVWyn~N­®#÷“u§®„äœî0ú J&nˆX Gèã5 ¶J¦˜`6M{î;¼¾6’¬ íÇKKÎ+ޤ©ƒM5¼ŸvÃñ^„ÕºÙØWëÜž§à1Ž)W™ùqåú'Àd“älÆ'ñ3½brwN^U:ë4UASš|õz¬GFè¿ð¯Uuz¯Ýо* ßÔîQûØ—RúûŒb.ps’E!˜6J]ì­Å´ÿd`½’i~BÅkˆŸŸ3ŰF1QÀŽy*†lFó³iB11t¬F»ÝuöÄÁ«ÄÍ6¡“£ò7áËáçÝ7‡?‰˜µú&y¬*þ~Ö_w9GùyÓq¶^BzP÷R©Î¨1D¶ú¦À†ú:ؘ–¥€pŽÚÊ왎ö@öK^šž~œøÒV2ˆM]=7aP4É£“ X×±þ€h54BjÊ`ñBy‰hEø¤ØK)D†‡îB/GѪÅèˆÇnŒ§ƒgôñšÅP.®.;f@¾þ½%’€ céž â´Ý 4Í»kâIê,°“Ä”kiyòOö9cnAÆHÀ£"ÚúœÝ>_2{ÆØöµý9Bpœ½ddе×8ÄüžÀk“™õÈêªÆÝìÿ ¨Àή܅Ÿæð÷ïŽÌÊSÐÜc„9A¬ÂÁ¦We <ûS {…ÛïáÍSRß* BLÜ€‡«ýk×=Z»Y‡mò«C”ÄÙj2RúÐâÁÖ›f}ÐÏ€Æõ·ÕAÐN-m<»Q1-ªÕTÒa¢ìЖk‘^Ø»àŒÑ Ûظ!p,ñÜc«÷R‚Éëóóå?$Q=uýaøƒé¶±RsV¨³ñÇ»P·Ì í+ÛtçéÀ.èÈß`L ¥JþÛ%8£öj/»Õþ‘‘¢UÓ ¿OmDát%}Y> ßy°#èý=”ɪÌûð1HֈϢ³Jþ£ê²ƒ8PWõtZ™i£ÇÛ05¾¶€VH°—©îc+9þø`—kP!à$íwO²Þؤ™´ÜÓê?„n)[´âk!Éñ ·ÀV©]6¥p¢§®ûåEŸØQ¾¯ˆnbi~/…¡wiþÓ„+wÿÖO;„nò¥/BÆ=¬ÂVݽü Åìí„=JürI‹¸Dùçñ„0ÁW/Ñà’I¿B].µŠ&“ÏlT;îþÄÐú,gÑ»¼Õàãf–8œ7õ&L†ö'x­½¶„¡àŸ¶ÔMf™ì?&U¬ö3JÄ^£¤bíñ?¸¸Z¤Ÿi‹-a¤çówVyNÔÑ Àh„Š¢ÞÔ—áÁ½Ç—“4f5ÁSÀg‚ 4;Ý72¿¯g_5PN¥Íq_!—{Â[P=.$™€"˜W°Ú l£ÄPº5Ùö ô¦#g·ÿ–æÆ(–¬Y<±"ÄÿëOä!B íDû8…-ÂkEçF²€¦„¦2<½ße‘˜¦à+x¡ÁŸIšÖÈÚ ‹6™ÊL¸°Ô Àh=ÄO¼iQAdi¯½HFá+l¼ßÍo ôœ¼æô•£ÿìƒWûŽ=œ"ô KÞ–»IðÏ‘~ÐÆ¸È¬÷œ‹Ü¨õúÙ7[šÄ–L‰ L“ Â«qîè€çéÆ£Æ ¿§ <Õ$€G?•|eOg74®.§±,3Ì{l¹®‹ŸÉ3Þ©E2«•Ìá½7à’XÇϼø’Êr¬ßÆ<…T¶*€žH·Ø‹¼ÎÙ(|2­.u\ÅýJ ëãJéS”TUkáìï-3Y§ ™Ü…”М–wY~oõ.›…ªc/wFæ ª”b v>8_Æ^Á Åù;ñ}Ŭža“ôepæfGÿ†L¼OžÝ Ö[™Š®T²¼7˜o"Ô“‡’fštL©'™ô´p,Ýܲúo>ãöó%êK5•›s«“6û²94œFJŠðé Ò[AkÅG7Zùå‰úÑÓÇ"åW›}¬Ö…–: gÊi"yÝÜ©Ì#ò¹* A~A,k V£`ry§#1òɸ[Ø=¸—(P‘j3¥°ÒJ©±ñï%ËãÁè‚GÉë–ñ¿TŠ6§Zý˜‰ -ídV¿œµ8ù‘ïîÆáðv¹ Y™V> ~rñ“)#R×*®ÚFecËí5jRŸŸUf,^­`êÕˆ>¨bO)×¥¡¡têöºâØ3‘ÏOÄø©.•$>ÖF]Ë]e´Y6©j#{óiTF¸Ëåu:¶žòj°°ÿèôøÈZ¬v&:±3¥RMÕ<Ô»çx‡1­ýc¬Fn¶ šìȹã†ÔS·Ê°N}TyÐÖ¶#ÝŽ®ñ‚á.®fýKŸÐè 9úhO´,çÍÛ5K¶-aéŒÄý6 …û¦Ë|·8Q¾PRjÙdšã²®çÓp¤¹«Ÿ-÷ÍNê°Ëœ´\–hõ£Gñ{mèàŽŽ“ŸKá©NŠêE'ŽN·ãU« èBÜ¥9©Yöc¥ÙtÉâ/OJx8æoe) ²M¡o·B›¼ó®jšÏÇ 0Õ«ÅššôäŒéL¾ê¨iï0I0f½§l3üÍÐPç ‚†Ó?ͬ²µ´˜ÂI<ö'vkªDKõ…ŽšY kß 3iÓ:WeÑ«Ã_܈Ö;úÞ8¿fts¥]Œ*dDÐÆ‘·2ñ.ˆÏô;£5ÑLFhr¸bp#²ÀІÔí*7gÀÏR—(êÌ8b¡ƒB1½»*àͧRq^ Úô)ª«ù~ûX½³85ü—YD§xÛ^gbfŽŸ% à*†>Q”ÌÍ+‰2¬¢ 0ü!LžµûðD€º=5 V/:q†ÆÇõ]Ìå±ëŽ /A*Ø)r¡w1¼ÂÁÞz Ï£ñlN#Òƒ T~ƒSL¾Vò›ãqO3qW=1ÐI¯ž% ‹ð¤ƒÜëów…i¹Õ¨ ¬Ñ*;ƦãAÄ(VÃ|s–®MÃ^P#w+Yôc`áä©€Z”Ñ£!:Éެ¾x$ïÎk׋%Ã}T™ð|ÅPQ ´ÓÏrç€þµŠÝ×»­ÉÛØŠÍ&Z/»ÀÔ÷f£(Lg"´¦Lá¨ðo_Ž^ ª_DË)k{ 2õŸcìe>K1!LÒ_Ì~w8Ä`².Ù÷9²žëÕõòé±Rû™yÆMpo¡xœãtæsÀ«Ü‡MhÈÙ(ü—Üý*IÏï,Y#j±ü¨«@ÇO¿=ó[ß;e' d8A‘­`T 2Ja+Vê£-¢þC>>_ƒŒ-û“­Y’%wrL2<åuýà~fŽàÝrú¶1Ú(ßðVêõ?ã,Õ’QHr#•üx$2Y_½+¡æ^©™\]·¯˜$:ñ#f&Ö)´†¥ÔôÃ<à"Htd”À{¯¾:µ°”Ž\ø \ò;r‰ŒkV®Ec{ë¶çÚþþ§]â|‹BEž’oeåG-´ÚO ´ùå×ñ&ò˱£;é¦ëûŸ‘«fÓãÒ›û“óÇŸÏϺqs}F´€Ak[ À…%÷ñ%^zj6רÖùÇèš3hár9]‚÷!äwƒÕ 3ˆ,‹l•Ý„WÁ¶‚í÷À?Œ@U†ŽV¥:ܪ#„¤+¤êé«*´ äå'ÍÍyá9e™Â6(¤­ûÖ®‰uÊûB+L¡éJ'lí-u ¤E*_Dxûª™øÂõo7q‰WÔrLÑÊì£$ÇB×°ÀÕ¸ -IÈVbÙ,tø‡[öŽ›Ö*Ço¾Å¢š r¹«éÞJzåëy¯¶Z^wJÔ4e’"ÕŒG/òæ¥m?›µJ§? Ì'¹ø÷­ê¡ëR°§ä"¿Ï?Sxô틞*T7 V¡=ÎRûäf¸U\t/Dî@¼/’ÅGÞV´éWƒ¿¹Egl›šTµ¤© o1'°¸Ì¸ ¬™~p˜:$ÿž¯ Z[È>©ë¼RÚ"³"›®yˆÌP*>Q:;6cSöÆJŽ.\¶ñ-ÓS?l_|Ðrõ½Ï^M}ð°ä%³ý±vˆñB!«ZÄhg¦øøFÓ…ø<×;÷©hþØ $^tÿU | º·Újj†¥ÉØë_8FÛžÜf!wQã#ÃÀ$v% )ôˆfï€62‰®k¨?Ñ"„¿qû˜çsGE]£ž®.ðÆOûø]j›¾êFc$]¥9ÐC‘Ò‹#0’tcéòw¸Â˜É?Æ{‰» øKßÞÚåõœºO¦¹&Ù×Ðd휋¸‚Ù²`+½½5ÏX0ÓœHûGîPAØ7¶?5oû-HçýÅ*Œ•²U]ýèp[§Ë%‰Ñ ÏŸÆÓOȧQ ÷3‹&{g ö„rò0x"ÓÆ;CàÕ¨}ÔØàjøkfø½âr•új;Áƒ,³ãŒŒ²~Ê>åXƒàøûD\݉¬Éèó̳=O ÉH™Vÿ†›°§üaùª¨¾¯zÏ:UÏ!|¿K÷=köÚZ]öç/Y½µë¦³ÏSJW]™å  €•ð S¨;AR³E÷H¶(á‘5b LNW¯1UÁ²ô ì]?Ÿ!½9­  ü#ùmî¾ZW#A…æ|±Ýa¸§Ñ¸‚Ãòú…7ϯl«êf^´Ý.…úøû2=DRS$ ê˜:-áÏfý“oT‘|–ŠÕ^Ñž=‰ÐOë–|¡@¢8  y€(ƒÃ¸w“váS4]ËÚ_å;Ó l`¡…ÿnÒlS, &®™T»*ÂÝ#ZÑÖ°$Œõ‹ª´ÅMAyZÍO+ZvªhóE÷3æqñÒ>âÊ“î9è%Mo¯,,Èô†Æ¼Ï1­Þ­l·1â Øžµ$Réç ãJÿ“¾ï.§}œk“‚©ÀTä RŠëòþºu'ÍíJõQj!ËNäÐg’Ÿ·†¢§Ì œ5…°3J8`\`0»úòÑÄœ$Uýî÷“Ûpz¬Œ¡E%Näw˜`4XøE¡4ÍpE„:LÝG9q Ü…¯§×—JÕ¢ 2¨DNÖÕ£ 7J Ö[ïyÕ¿jÃ…€òµe¾ùr¤+ûà Âö#5f ÇZ˜ªÅÜ5RØ, ,ô†ˆzö3-•×^ðV7)ÈýYwc:”÷z¸ÒœUßD¿1W›C|ÿÕ“<Ø5aÂóõE¤ŠÞ~qW?iø¨€åŒ/ÿý®êmFuÓ:£®n½AlÁ¬Æ]•ýÈÌ…ÅéSXŒ9®y=šüʽþ&Oæià/"kÒR_&Má(%ÃzÕD#¨ƒD]F㯸?70ÔŸÄ„‰TI“ÙCƼã¢ËÑy"(Çh3HL’ãìêl¨"rb™ÑwѼõ=ŒõOÛW<³5`N&mvòq¦;JŸŽžBšPG!"1²¯õs´çÈæü JâNzßN~+2²Q»stU],lr[:qPˆ®{eËõø&;S ú±‹-¯ ?XÕ«[;*ª´mYÛå¿©fzùèF~…h&®úƒø+üº¿ÿß›§ÉÛ‘ /X6ûHè8Áœx("CXb` 5¶eýìF°Í> endobj 120 0 obj <> stream xœ]ÖÍnÛ8ཟBËvQXïO HY²˜é iÀ±™Ô@#гÈÛW‡GÎt‘øˆ’®>R4éuw¿¿Ï·õ?ÓåøoÕÓy¼¿ÞòËýøtÙnWë/ó¹×Ûô^}ˆ§Ëcþ¸ZžNy:ÏÕ‡oÝÃ|üðv½þÈ/y¼Uõj·«Nùi®ó×áú÷á%¯Ë]ŸîOóéóíýÓ|Ëï ¾¾_sՖ㆔ãå”_¯‡cžãs^mëzWm‡a·ÊãésM]óžÇ§ã÷ôڶ¸¶®c½›sSòü1ç–¹EÌY˜Y™Ù˜ ÙçÜÖÍùŽíwÈæÒ™#rbNÈs‡¼§mܳ½G˜çnýþ@€?Ðàôøýþ@€?ÐàÎìÈôøýþ@€?Ðàôøýþ@€?Ðàú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àú~¡_àWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_áWú~¥_á·šsõ~ƒßè7ø~ƒßè7ø~ƒßè7ø~ƒßè·RŸ~ƒßè7ø~ƒßè7ø~ƒßè7ø~ƒß9þŽñwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßáwú~§ßátF8#ÎHg„3ÂÙ¶ l‘Îù+Ú²rÉæÿ Y,h6¥;ÑÈDt8. Pi|ñ€Fv ¢±+íåK÷ÌèdD†TôÀŒg¥†u€NmÉ-^F ̸>-AÍÄNèÄ…²,²éŽuð¬´aÆ`¥Å‰ALt&8eÁM‹³<—“#artË„F{ÇN‡® tÛáÞ®Lˆvqè”ípvÆv¼øÎ™Kû2ž¥=²æn±•ö=Ûaîzf˜»õ1þûå‹OOgñôË$@;<«) bÏwW<}ynS—~y.®X§G¡ô¥)›Á°ÔÁõë ¨3,uðîÖÙÿdØ@±ÃÿÚ˜«ãÛ4Í›rùPvcìÃç1ÿûKáz¹â®ò÷pר endstream endobj 121 0 obj <> endobj 122 0 obj <> endobj 123 0 obj <> /ExtGState<> /ProcSet[/PDF/Text/ImageC/ImageI/ImageB] >> endobj 1 0 obj <>/Contents 2 0 R>> endobj 6 0 obj <>/Contents 7 0 R>> endobj 11 0 obj <>/Contents 12 0 R>> endobj 16 0 obj <>/Contents 17 0 R>> endobj 21 0 obj <>/Contents 22 0 R>> endobj 26 0 obj <>/Contents 27 0 R>> endobj 31 0 obj <>/Contents 32 0 R>> endobj 36 0 obj <>/Contents 37 0 R>> endobj 41 0 obj <>/Contents 42 0 R>> endobj 46 0 obj <>/Contents 47 0 R>> endobj 51 0 obj <>/Contents 52 0 R>> endobj 56 0 obj <>/Contents 57 0 R>> endobj 68 0 obj <> endobj 61 0 obj <> >> endobj 62 0 obj <> >> endobj 63 0 obj <> >> endobj 64 0 obj <> >> endobj 65 0 obj <> >> endobj 66 0 obj <> >> endobj 67 0 obj <> endobj 124 0 obj <> endobj 125 0 obj < /Creator /Producer /CreationDate(D:20180530170311-04'00')>> endobj xref 0 126 0000000000 65535 f 0000582501 00000 n 0000000019 00000 n 0000003656 00000 n 0000003677 00000 n 0000003873 00000 n 0000582678 00000 n 0000003913 00000 n 0000006933 00000 n 0000006954 00000 n 0000007150 00000 n 0000582841 00000 n 0000007191 00000 n 0000010833 00000 n 0000010855 00000 n 0000011052 00000 n 0000582988 00000 n 0000011093 00000 n 0000014261 00000 n 0000014283 00000 n 0000014480 00000 n 0000583135 00000 n 0000014521 00000 n 0000018004 00000 n 0000018026 00000 n 0000018223 00000 n 0000583282 00000 n 0000018264 00000 n 0000020298 00000 n 0000020320 00000 n 0000020517 00000 n 0000583429 00000 n 0000020558 00000 n 0000024145 00000 n 0000024167 00000 n 0000024364 00000 n 0000583576 00000 n 0000024405 00000 n 0000028123 00000 n 0000028145 00000 n 0000028342 00000 n 0000583748 00000 n 0000028383 00000 n 0000032252 00000 n 0000032274 00000 n 0000032471 00000 n 0000583895 00000 n 0000032512 00000 n 0000036303 00000 n 0000036325 00000 n 0000036522 00000 n 0000584042 00000 n 0000036563 00000 n 0000039810 00000 n 0000039832 00000 n 0000040029 00000 n 0000584207 00000 n 0000040070 00000 n 0000042870 00000 n 0000042892 00000 n 0000043089 00000 n 0000584532 00000 n 0000584697 00000 n 0000584855 00000 n 0000585006 00000 n 0000585158 00000 n 0000585314 00000 n 0000585477 00000 n 0000584354 00000 n 0000043130 00000 n 0000050722 00000 n 0000050744 00000 n 0000050938 00000 n 0000051341 00000 n 0000051599 00000 n 0000059980 00000 n 0000060002 00000 n 0000060197 00000 n 0000060577 00000 n 0000060811 00000 n 0000070472 00000 n 0000070494 00000 n 0000070697 00000 n 0000071302 00000 n 0000071745 00000 n 0000077709 00000 n 0000077731 00000 n 0000077930 00000 n 0000078305 00000 n 0000078544 00000 n 0000179101 00000 n 0000179125 00000 n 0000179317 00000 n 0000180262 00000 n 0000181227 00000 n 0000181289 00000 n 0000181578 00000 n 0000181750 00000 n 0000282326 00000 n 0000282350 00000 n 0000282542 00000 n 0000283488 00000 n 0000284459 00000 n 0000385256 00000 n 0000385281 00000 n 0000385470 00000 n 0000386416 00000 n 0000387378 00000 n 0000427318 00000 n 0000427342 00000 n 0000427538 00000 n 0000428484 00000 n 0000429453 00000 n 0000499371 00000 n 0000499395 00000 n 0000499586 00000 n 0000500532 00000 n 0000501499 00000 n 0000579828 00000 n 0000579852 00000 n 0000580043 00000 n 0000580989 00000 n 0000581957 00000 n 0000582099 00000 n 0000585596 00000 n 0000585695 00000 n trailer < ] /DocChecksum /20FD337C87F853B1D8ED2BE184996526 >> startxref 585937 %%EOF cfitsio-3.47/docs/quick.pdf0000644000225700000360000070665613464573431015172 0ustar cagordonlhea%PDF-1.4 %Çì¢ 5 0 obj <> stream xœí[Ér7ßú+êX51 bIlGKÖB{ƶD:|pø`“4gbDj¡dË?/Q¨ª»z!Mi"Ã!5¼|™H ^7R¨FòùïÉÅâà¹oί²y‚ç‹× •*4ùÏÉEóà•B£¼ÐÊRsüÛ¢o¬-}ã¤Ö5Ç‹ŸÚ‡ÝR ë] íãN §)Æöð¸ä!W*«û]·4’DÐí³N‰àUtí»±ø?ÜFG‡äI§£ˆ.˜ö¿ÜiisGÆûö-×4.FÓþÂI2¡}SòP¬# elûã#µ^Ç;ÕžŽ™gœ *ÐÏÇ_cêX ¥D´VóÜl z—øyŠIÿˆÚÚ‡¾¤ˆ^KëÚ))¥¢œL¹UˆŠVN»Ø^`V:#Cû}gŒ uÖ¬ª¢Ð^v<¶Ô„…òúRcuP7ž‡SŠôAhCC¨³_t$tÐÆÍMiéMªÛ,!Gè|a•¶X¬JÔËÎ`eœ²XA4§0)ŪKáÈëÛ?yRNïZ]jȵ¤tÔš17 G‚ðäzáT°r.ÅóJâ=dñÐ;µ/y³<‘c马ƦkaI“M+% ¥ª ¯°¤}ŒÃª8 ðŠi5 É.ŽÿþS«ºeÔ(¦19"Iân‘zhFøÐÃë 1D€t )¾$×4±zcò¤³BɨmÝ…HÀû%O;‹‘†6,,aX „i54¦ciË\¶'ÐW™äŠV°W ’4*úH>á8ËÔ'WKZõuŽkÕ=TN¹ zøÈôX,q­O§Mê2ò,5³Œdvõ1CÇ€l=«cN¦E;ÛçbÚ︹Ғh}!ÍÆ…ôÑUÆ…|Ä}YcÚ÷¬&‚<ú iY³™p” í«2õjñÎx,šÏ0Ж2x¬qiï1oSgUËYz·n}B´iB…¿¨L(¯¬öaXY–meeó¢¦ÉTEÌç.`aUû[j%N3¨À>ñ gL!Qki¶ÎÊÕ³‚Þ†Zo—¤œð®Y*&É2KÛ 4óÞÖe,v@yï¡×Ì_Xˆ1&1<¦`ù'ò9sƒ„!J/yÿˆ·ùŠw2™ž\}èèmgÕyð˴Ȩ3¨Áz<ȶD}¡U$­4llW’;+\§î'6ÚZÝ’iV’»ÊwTe̘ªO(WºÎ&Uj$ÙÁìLP¤ Šc›½wÖ–m~‘tRs‚“ÃÄJ4¨+C†l¨p”±AѶêa¯/:¹¹_ØUò¨àRõkH”ÔÐäZïúÎ0‹ C¢êå‹–†±¸¸@âžad«Ã=žÖ’ :Þ çcùVk€Êí¶Ð’)€zÚéö+ì ¸ù¿–ØBc´Ñ 7¿³c†|ýZ©´ãƒŽ?õX¬VÜ#”;šÜv+õ¬» šëùK/9·ºÕ!x~CRäÆz D£Âx|z2€©ñ탎GÖ.Ìp‹Á]1Ž9†dÍîå©ûU‚ÚX¥‚s5•Ë ²£^ÿ_ȸ›†mÕV’¡æ>€¹bU–Ÿ¤¹»æ*Ì™«yæY»ì^gž9õcWzª~‰j²jW©"qká<649œg<ŽÊ9œG´%œ·ÍÁ.F«ô_õ²À¬Ÿ;Z2n-•šÆ×ŒgDGrç¯G> stream xœµ]Y]Çq~'Œü†A^r¯¡9<½w ȃì8¶’ŽÍŒÀ !) ‘j¡læ×§ªz«Þî½C1DΜ­·Z¾úªºõýÕ¾‰«ÿM?ûèñŸÝÕÝö«ßÃw¾$è«ô×ó·W¿¹‡„¾zSÚÊ«›—âÛâÊÛM_Y#6©¯nÞ>úëA¯…nêðõqßœ‘Âëû£›B~:ÊÍh©Íá‡ãõ¾+µ²‡ûã5< ‚V‡Çk ÍHêÏá³›wÊšô¥¯jÛ¡±¯ËmwZ[h(¿òß7ÿ†½ö0Ž-ìA`¯% Àuón~ý×à ´º9/vuxu¼6›Ö:ø¬Üœsêð#ÜvÛÂNåÛÐUé·}w:¥á¢{šï¿ÅXëáþ·åþ»#L‰1ÚCïá£;ÎÅØñõZ|CC×~‚azoáþ½Ò^êšÝs{Ri¼¨\Ø´’éuó…“ìw>Ôú›Üîûüf8|<*º(àMƒCTa‡þð=®œ”ðœå#/}~T®…pøŽ=Yšøˆý0›G.`ÜÎò~ÞI8`­”’fÌ‹m‡ÏýÌ… ø¥Ýú 6¥{wð²õ[ðîðÛ#J‡Ú-ŠÈñÍ Ü÷õQöqú]í–ú—VY WVφÔ³‡<×ì­8×» ×Ëúį¥^:áù8Z/…Îß‘6KH0šµ–¿£ºÎú :µË8º=âÌ9ë@-Q•ÂnW€'Ð…–רïêD”5«¢ÃÕÁ‚hj¾öi!½Ó«¹× <»ÐLœA¤ûÆHX›Ò§¡Ïbw©Ï$Oêâð:ü¾åÝ&A‚K÷KŸžM¹“¸GxßYèìv¼›D¢ÊºðöíY6¨A÷Gåq€êðsÑ›ª_ìë0UFxX˶ ³ šà$eÎj’ÃF[¨ ¨elìiÔbß‹rOc#y—fS2‹{•ž(dn¢º™]nb÷y)P‡¥P*‹]}R%˜=€Káì&Á61MHÖŸ—0Iµ#U´™B½©£bGCRN6½Ê:—'Ô˜¨pyÉvÛ/6Š(|ƒ l•÷úÓ`iÓEíQ_“ì{ç¼ FòXÓ/qÁðƒ!­R¹K©­Þ¬—gdÀï4&hÚ‚—ƒÉýÈ,nj_í’IbÖ_ÍúKüˆ¥þã¯C—;ás9˜ÙûjÄ’5Ð=§ÉwhŽà×^ŽHcoªœ=ÁÕÀ>·V(Š¯Þ¼*æz"¨®>¾‡†`¹WefẂëÝt2ÃZA'­Þã”´j•¥öM‘ÕÒ‘•=Nýníqo%q=’<èàxßìÞ‚º–cˆ<ÏÖ2Êø³º”Lãp>Qp@{ÄÚ3cŸÍ:N¹qŠ»¬„@ ÿ$Bx§Ý7xÝ“ñ\:­L‘ÄÅ3\ ¨¼Fª¥5 5,+6üº6œ~HÓ0ñfð-°wNö®¾™¥Shâ[’I NKØ,’(öæ ¤›¿'ÇŒæ-N«ÖL¤ª!|VŸd¢zÛ’ø&ú}}~"¡·­)Kj¦@%‰#`µz ŸÓôdv Izš tÀ§Lò·&£{ú:58}kŠO0ÛPIV˜=ðG„Mèôýá›c'·ËûOzGù3ZNÀE®AÒÌFO b½È„£¢‚M‹Ïtp¤Öl÷“!ãÓø™_Íà]@3ŠÊq…Ð"€:ÐA\S&üo¸Ñ’ ÑõrÑ@ˆFÞzàÃPÜFÔÃfííȶ¦H I¦±6ß±98)gË2 ÎÞå+¡)¦cTHg¢˜ÇÁuÞц£òt!d+f!bñjgkЇžÂq҇ǺS&±Ž1¸ëÌ$z¡Ù7ªÅJ8¯v¹ÐM·bþø-áa¡aa(©&BúÜ U"ßÃÃýqe+Ç>2˜dxGoȨßl€dÒ°õˆÚ'°^üôºóÄÌÈT„?º^øÀïœÅˆoÃC V ƒN5€}³cºaanÁƒ†¶'}žÒŽlþší,Ó–ì8h.£%—ák °Èg'&\Mè³Ä ¹àgS«‹í³á–™~˜™QAQ~á;E~/@ØMÀ,+±Yšìý79SCRßUZöÔCf˱yÉå–-ç;³å»)‚¥Á?˜:ÇÄ¢¸;ºÿŠi)¸lº¹Êð|Ó}¥läÐDqïjˆÂm¢t,s¸†Àb(ÉÕaÖ÷itË,öŠÌJç,s/å/Õ %)¤\že#mò~ÒEî¶&I¬’’é´+Ê7D#zô©H§ì|.pæñÁ3ÜuN9Ÿ—VR›s‚É#NÑÒ\h¾ŒŒèy= x!0&2 ½5äÝl¯Ò3hk&„'÷bÊÄþ¢,;³[*|A{Ú/d²FƵ4ÆR±²A³Ñ/?oP⻤¢Fµ%Í=Ím“Ðu,§'KK*Åúì; óRáç@†Æ Õáéa ·Ñ!áŒ{‰ïÃ'Sb“Q’y€,'Tß-‚R%™éËÒ €Ò T °•u˜iŸÒ–wÙëÜÁ\Â!¥=H€‰©30°U”ŸKϲhIÏ‘t4ç=;íúÁ8Q é¾&æ§%Kž–D"¬A^WíäÒ’D[{­¥&eœ‚Šú̼PàY¿x?6‡Ñ‰>Ï£•TÛÀ–o–jdŒóŒ%¼[ES¹þŸ½‚–ö^+†ã>‰¹a–Y*r{ÓåÈÈ0›“ ¢}øêHÞF‚ §s&9“ Í]ì¨wŠh" 30ø-Æ3<û=ð…•/ ¯ß,oÄŒ&þw’šl²”qBàxbûò”~tÉ–-8{5rG¯ÝZD©É">ˆ¯ÆðèÎn·ÉŠ8 e¡a¤ÒMè&wr òé4Ÿ?})‡GšÓo4Ñ’çFochˆV¡:“€âMB#bSVpºM«D£Å•sž„$¬ïÁB!zUü˜ o²FU­È[;Q"Ñ úWµ‰w6”9s ˆÌã÷'ñ3}"a“8-8yÑgñs¤™~ÃÑC¹±Î]Ñ ÆåÈIŒD ¦­Àü/¡ ’ Ïi ’¦i¨/¸Ä®IÕanƶåÁÇLPT6GXö—FZ§$½` úŸM”±pë´–Qi‘WSßB‚ ˆÄîE°±£ÂR>é(€]´±§4‘X)4ÆzñAEC×eHûîy¼ÇÓ9yLO¨÷qÕ[·°â€qòñã¬(âþhšÇÛJ ¢ëlʈø<>üÕFZ•TÈ•¦R©®ÛšA‹Ãüë«^X(Ï 踱àö¡3ˆey¾+†„Šç´»”» XÚ€ú‰“. %x*×{Ì ›¢u¡0(“™ïÛeb6qRÔ4›†…`Ýw+Ñ'D ±oɺ g'õ¬©Ìà•Z¾âϢ߂tQÆ2m0VNƒ«Båžé„~ä<ïV²_á×y5^¤20h™1ß}Ñ3­hºÅ $“è™6w2Ä ¦ËÜó˜+›æXÃÏ}uJàüϪ”†„AÇaÔ&&\G“!ªiV×”ÛÊùmEð–{ÝØš×’{λc—GKëû ý6„™¡U¦e¤G'\s7­ûÌê8ÚN˜´¤ÕŸ@•1®1—ñÚhÅ#,sŸ2 µcÜXó·jºÀf–â‡.Ç.¸œÍÒBvTïg¹h#ˆ|G»R‹4c¦g­¯?E#!‚J¦†Ý"‰%ÇTÆå£å«XîÜ¢­¾(ðÒVQßsµ±‹ÜÔG[×qÒ§!NGØ™˜øÂWG,¼<}üÛŠY¾Æ)Þ0·õ5ÖÉ͇YDE¥É ³êÝÔ± Û ¼ÖdUkpŠ\$|—µ=ÖS2£kcJÉåÏ™9¾iJ˜I°¨XòØW$`Áº˜]3€ØâI}éåy3e✈£BqÓ ŸÆ·%Ú¼®:v¼µÊ«jÓXÌ·p©™©Šã µ@¢•ï=næhJ~ÁcèêæšC6§ä RQþ¦TÔ/HXÙ G ±*K“‘Ž›Sx‹´6ó) Ëåµ&[|bb (Ë¢Ž›NúsÕ…&ùý^!Ó>YЄehQë”K@}/®"÷dwHž-MJ¯M¹›¢w+ŸÒçÿ ´~ ë_ žþp”ñL^·ƒ—~ ú9& dS¿96iðîL|8—ÙT.¢AÌÒþ¡„rµoʵíXªsV5¢‰‹\eƤæLr%;jÚ¢Í6 Ú…˜êKj:í¸—éE¢Ž/aN]Ü Ü' °eÅ'Y6‚yƒ³"˜÷Š 3!oö–ÇùjxÀt ÚõU-GöeQ4cßÚmŸµ^#%;ÿÎØ”ÁÂg—„\tÖ€ŽòK% ³Zˆ¾ºOrŒé¶Ù†Õ®öý?«U×ÑZv x÷” ®<È’L{'E †½žb\éø×;31+ˆYÆÀ¹ÚjR—q£é\e™vÛr¹*f™IåýËòÿ4ëLèÙ>&Æ.rÆ›*l$ù†Ôü@.6¢4Ü÷“žòo1©ãí¿¡  •6àO_bÌusœBNåjr7úð?c¬Ê•èÌÑ9”¬1å+{†I Ó–…Ñ€ù9 LÕlj ®˜ÂeƒKÖâ5zÉuÁÖ s… X o g_W^oíX€œ° ¶™Ê?Å"ᤈ DQë¬Á-ßpÃòð¼6[jªò4• z>×SôÑÕP>|éOqw‘’ A¾›D<üŠ;¥ö¤¾H´žž(lU/NT¬°u¬ðžŠ½îU)žÿ»8ß}wîÄîOXG^òÞñù5ZÄJd` ¬¬Ús¢ÉõÛ?X\‡²ÁŽ*hY[0ùžC›kŒi³Å -PYÔ™•êŠV0®(àh¥îª)^ätÝaµ0K?/›mµ™ÑÛTÛ²]qÕî?…nË»_gûï#Î*§ºý;4„©ÿU7¡ÿå˜w¦ã xփ‚p³{šµ†厛TÓ|tótäY| ÏdyÁGÇGi;>:&ªŒO½­í}[.²ýø?åÛ)ÏŽøá8Ù>ÿ®\¬»ôg;éKÄÛ‘KÍÙxÄ]ä`¯%(D§½6¢ðñ¬^RGc&F!2öбM‰1t'Æ6-ÅY±qßDP¿\_z%ML¼5Å7øeŒ }ý1)Ÿu åËô×,C¼ª‹Å™á”òAóœÕë öµt1þËÉ8Mç…¨ˆÎ齨Y¶Q2"ź´—fÛŠË‘"ìbü3 É Àì˜YSµÝ™òßì”c»ðÄÄv^Þ­ Ρ"`x#WŠæÍ¥-a°2l»š‰vÝ¢ÂP ÞZjЉÄØ_]haˆ†Ñ25zwl*í¹¡m´ã’Lg)AfŽò´ï€ÔL?}•[hw²‹MÅD“Ô{Ÿ çœ.çÌÅ©²ž\K_Âè.ýÇ>µÚÀ‡9€}g@ƒÝ.Móó%:eF¢‡!]zožª‹zñkÉ™œ³øžñ­LÏô£«ÆCO¤âؼ&ùÒŽ */W‹ƒÃBnk‡KJÂÌ¥üî¸Dç92 „É©–2™¦Å™FuIÏœ±ñ®ð¹,'2EÏçE]m,Éý.…cjZ;|)Àï§‹o½¸¯º5œ6ÕÒ=ïlq[G÷Œçw²SX±éö‰lùÅi¤LRÄ):—&ŒåÊçèA˜;¯ u®½£cr–[b‰…N: ‰­¼=n78yDŒ p^]?Q‡\ù̉66–zÙ;ŠÍʾR©¥ØÒníOteTN-}?×Ñ<å SÍãÇÖÈ$á/„Qg:º2‹ØlkCm9ý&Ïý%Aiþb®uá‰ðv K)&Õ=¤™Ñãs9©0ºw×ÝÙ0-§ÖŸOÀ²Kñ6±næÁöò"²?yºÝ·Þ¥8îKçÏÃ4}r;vL« Œ½ s¾f°y]MÓ,C8!ŒïŸÊlüÞå]Þ"ßhó-CðŸFëwò¬Ï¨ 1#ÔÒDÇ…Šm†m³0(Ú6Û­šó`'a}2Ý4ÒÖtg;,g'äôÑ%»òîpaÖ"mãA¿Ÿå¸I,äìS9:@”'ŽÓž–ÛÕºŠš…dô8¿wDh¶ƒíÏ’œÁ G1a¥l%¸ÀE9‘Rò(GYÊOY’–©€ÿ3Ùr:úßMN[¢ƒ´¯ÈS¯ZsÞZûž¼®¥üm9˰ gñç d›–RŸ*.FÓ›TbÜg†„ ۴̸ۇ€)1±Ê·åé©4t.j'élO‡ËûÙ»sŸØÆ©^Mršýö­”Ѩ‡üu±ËYb爛[܈YÜ&êÿQ íª§6®(V‹Ô&Là"õÀÄ:¹«\ªOtõïný þý?5·2‰endstream endobj 28 0 obj 5961 endobj 34 0 obj <> stream xœ­[YoÇ~'ô#ø¦À;ìû0à‰ã$±hm )S„$.mŠ’üïSÕguOÏîZ¤ Ë«žž>êüê˜_NÙÌOþ›þñîäì;{zuwÂNÿÿ]ürÂÄÓô¿‹w§>‡I\r5KeÄéùÏ'ñm~ê̬Næ³P§çïN~؈i˹°3—›o'6[-¸S››i+à]¡üæF•°Þ›ÍûIÌõæÅ$gnç›·ð‹qÁUúÅ…ß\—_d«i+˜-ãämòüž[7[e7ßãû’9“6w¯ËFé%nTXÔÂ-¥Ü|=q¸„ƒ•þ ƒ³ãZ:z¥ó0jŒ’›çu2áŸð“9nœ?ÿ)耦³gž#l£½;=vrþ‡`9[k Là/¹ùuÚâQ Spî-Ÿµ¶FÑ`[gß|'0lróÛ$Ã;|³›ôæƵ•¡¯½ž¶zVÊ0“çà_•×@ç´RL¨?óãÝ$íìá›xcë8“H²¼Zy–ãN?tX ¡L:±š¾®Ë¾‚çÊÎÚ  4® Á ¾Å£K™”ŽÏŸ×âøG¥áà!èñš?#gðœOa`AàçÇIøY0š¨¬¼gÒnÖF‡'7u3¼2ó—!x5)x.¤‚—๛A/àT( Œ37¨Dç— 4?ãÆ8Y“—>M[`®4óïbŒävs·¶Ü%ò{­Êé­Z’QJžÈèP⟧ë(•—ŠWÓÌ'ÄEëòu,RÒ r„ç†)QTx°…e¥dÌáÅ·ùæ[.ÐLD\UF ¸“ë:Ät:ð%1TyKçïâ|ØÞðDE: ¬YTfbó2‘EXXt±.‰ëÀýµŠB’X˼ƒÍÀîiÅ$’úë¶å˼ê,€ÿ5ÇÌüÇÕÉQˆ¬Z ÷E™7çծЦ×@k3Á$ü¼BDœl‡ïá_+ƒ5pÁln>ñÄ;< ‚-,Àd¹®·Ñt¶Øjp+‚9ªæ¶)•Höþs4Y¦å1½jéÛ­‹"(áåü­rÔ_DŸÈ[HD *\@¥•±¶W„JD"Â¯× 4ç ãTv8¨€}8À=¥As«àûG¬å®UHT.ð]Æ¢X£’‘ Boƒ-Ýlî¦æòs ¬7¨¤ˆ6Å3lJan:°dÔ˜"+˜Ö ™x)xP\üëâŽø ¹cKÑF‰2à‚%Ïf¡gìMkp@iÅ©2)„ä`j²>_YD9o¤ùŠäTi»©Ï¦01{ŸgØzÕ£Ïëd:OàšƒQPFáA¹¦7J¢&,¯Ç&LŠV=ܲµé/ZBáeø<êV!Eã±QT)6IUDb‰h`ÌV8¸ ó¨ØS¸‰äCwK¦’³Ìþ‚¸gáêB¸ãÍ„*‚¸lèõD0;”eUÆ{Pšè¢¢}Ñø‹%é"‰¤×žÞ ÆT€$ׄfðTlPÞï&|ïˆÁ_õ^×­ä'¥”p³¤ÈƒX«:ˆk½)÷Uœ¢A¢ Ñ/²hF#=1±JÙX€SŠ*<*D‘ÎæêNŠh°ã%·A±—; *q²Ft#<Ñ' êe ˆS”‚ b-¸àkÊ hE€’ÍÍ8J‹ÌžðW¥ÐwfÈj²Æ-Õ¸tÈ¥—BªýïFÑU´òÄÆc€‚£džJiERI@E#ï §-ÝœT)ÖÄQQ¸ýÌTîû†ìRˆù "‚_«ÍÌÐŽ"ŽûjI Ò NnW”Æ £^"+} ܂٭T}Yì|bi–ñl„Uð^’úpûÖª/ ¦VnÝ`¶ó*Æõ:FOØzaDQ§>Æ@Ïš‘ݯ!6°j›Œ›FpK­(ÓPÞ´®‡ÈVgÛK|Ò¸÷‹ÃåñBQ#”ÊÐÅAq¹÷ž<ŸœŠAήZÉ—u…ûê—öç½G_³Î¨äÌ¿®ˆÑ%8÷¾ |þ¼nI&Ö!šØ¿—C_ÙÅí¿áiA'¤/h Ý»Ù|?qpΘùXŒOùµ#ŒÚãæ­}¥j |Aký¿¼"±5׺;=MXLÚ5cYÖ]²Uzö¢¤H’§³7ÅS¾Â-D0ÔÄ{#‹æìrèÉh…D‹ô”®ò[Ö™/ë‘d'ƒL}2ìâ±³S}fØ5ôÏ9Ç%×äšbÄ0‘úôx túuô¢üz÷ìý÷éRŠê²ÝQŒLrl€–>Ö@yÍÈÂ~lˆ-}4‰BBÌ«]³O$‹[Ë`ÁÕÐI7ɶ%„­Kî<:Dâí2µ³“~™vÀËhÔ¡<º =$¹ñÑÇéYxјÃz–™E*ø&4‰. ljr[%c64%»öD“]N+f]¶J{@8˜¦‘tuoOêsêÿžâQl@8t¹jÄ×Ðn´ã7s¦óƒ:Hwoï˺O¨ËÓ]t–p&X¨í»ÿ¤HbQA„Uœ5ß\Ä¿mÉÚLǃ#lÞæ}J ò™UÕ:™¼Çi‘¤uqÅ©Ð4JC…ßí<Ä$H] {Ò•¨ná)øvzí;𵈠HÞôØØ VöŽ rƼšI»žŒ„‹e”w?õ ‰–þDDh—t ™–eÙ˜Ç_/ˆbm3€©¦1<þg0´„”õ„¸‘ÁL„oŠ;×5" %]Ì:¯èGÄb-2Þ}ŽˆfÅš}²H(å<¹¿dÆS‰s˜Æ!õÚm¥]–Ïo“‡K˜Œ "=¸ÓeÕ™bµmº~‹ÿuòX–Q¶I8 Z¤¦µKÛÝŠíõÅ/H& GŠèQ*ãc<!¶àÀ·Wi…%HûT~}EqT¼a8D8…€ÕË.ýñÅŠ?>Ò “]Ë .ƒ€Ž“ð) Ü%æt†çJW×<ÖÜ(gpTÌ3Ȉ>/Z(dºÝÂàÒy7iy¡DÈù¬¹ZÁu(‹=Fwˆà"d‡FN$Ú,1“UÏL z5'ÃÚÜ.2›+‰ŠÄ\Õ8éB§³*6#™§n·Í¶h9Éà´æ®¿ÈÃÀf©+ÃÏVtVk:ñlOêóõÜmÕ‘adÜé]8U!ÝO«õž æ%Å8ñ€à€{jo‰¦&¡ÆÛwÌê”­eVj™8£z—9¦DW¹+3ÎVR¿‘¨ÀGaÕ~rÒ”3tØ¢ÖÕ7P‰Æ¯¥˜1rUÍY°¾õ¤dA‚[›GaÉjQã&C¡r5-äN­6wl…£Ù˜¦¨ÎQ }x$K‹eI‘/ÏdÙvo[éd¢¥ÖÊŠqkLîŽÐTávS)Ô]º&-4­<Ë“ì-Æu…d}Øcf÷ÅaÒ‰ás~ïpÕã_øpÉŠåi-±;«Ý‚Æ…‘ºRÉ$»E0ÙñŸX¹}ý&¡½È…‚%Q¡V³¬âñÜ#†£ 'ÃzADô ÇÂɳxÆR í!bœ‘k¼(UÔ“V3›k“·$ˆ[Î¥0ûrhÎKKf-æø-@ àrDZH ø9%9„O}2àÅMí[2›ÍáѾCƒ“çhŒWWå­ax*c0 :ã“MˆHû`EP€=y=ÐBÒ›»ð´©4¥Yˆ©‡B*]­4çâ­-Rš6 ,2.X÷ï0ºqžY8Ô7•èš‘ºHK’ó©\íA¬O+©ÑR¾€€+ë‚Å{x8o#´œ®g‡ÓÄ×ß¼ôQMf9ßTKØ &\'Ù]óÀ¨q˜-j«˜XbìqZÆñϵàu\ÏšN™¢pÁ¶—†$ŠJ›G‹i²$þgò¥î["Á#Øù™U÷Qô 2©,@yL›)’Gh¹s‡ôÐPG2ÂÁ èz÷VÎù>†±W2ÆBï& ††[³²-ž |=ó>»$$‚ñrP·Ì»Ÿ‡þ;§4êòWJ¨PR^ú¢$4æ%‰*4<˜dÕB˜²±Â7ƒAÏàöNÕ¾µHãâP¨Æãîy¢Ò¤vÝÝ‹þJÛw /Û%lø?šZv†6¿&çF;èIÐ| ,«¶žÇìæÊå9]·âÐ#‹Üð |¶e<äV[Ê䬣¯-¨!ŠÀŨñ.v÷Ô_h5Ï_-OÄH\’à’¨zäž4^.MälÛ  Y„E®QùROø0fZkˆWÌÏF»aÕ:Bˆ‹ÊØ8gšCì´UTϸéLsîͳ«Ò©õ"MœØM‘>þÿ^¿ýXûø§íΫD–G¹êË¢èEV£=Ø'¤|¨Ì,{³¢bþç ¥òg*››$8žÎw=bw“ŠIÃC] Ç%ã7Q sPKÁ&UW‘3 ò· Å)`^ËòßîGV¥{·i’L»¡H¥‡‹ðbØ-ÎzVŸÍSéÞ¨Ïß6ï¦Áa!…t6ÔJÉ5==ìN¯þîÀî7eð®¾J‹Åð¥;ºýòmJ½GmÙÛ¡²†üwò,{€€nLkIò·PˆÝ™ (€˜’]„ÛbNÇ«l7 0µ[=‡¼0æÝëÆ‚h¿éÊ20?‡Ëy ïHî #—±bX3*c_ ­4ª÷ÓÁ©‰j‘²P÷ªÕ~}ž””tëÇtæ¶Þ º.êÅž&7 ê–>V’(‰ ˜ûò™o­¦¾`Ž SÆfù(~MÌ?ùTËÇJòÄáú’/?¿^®ŸB_àL_&&ŸœÍþ‘±sãÔñ}­CŸW¶KY#£ŽÏ™r,Àž¶<§}ïCÆÏú:¨–"]Œ)Ià¶ ÷¹Çq>´¨(\‹ûrÇÍ0ý Õ÷ _º¬m@ùƒoE*-75€Ý+;ÈH„TÆAÿ>$(x…Æ/ØpH(?W}²Ü ö;L—ïç½Úÿ…&ãÖÕtÿí`FiÌÞá m$ˆ'uþ…Æ‚®[°8bâƒqÙ‘Cq~ÖèPØ¢¼™Qfjø~ÃO0í^Ù•"&MUvãg[#ÙÍ ô£¿¨z ß¢ÍB˜7¼Ä%Gö…/¦ýÀ‰¨@µÞ£ºÖm“›c ‹šd|P̰£\Äîåm£‡`Q†"Ø—Œ¹Œàþ›ó“ÿÿhø³hendstream endobj 35 0 obj 4366 endobj 39 0 obj <> stream xœí[ioÇÍç…ÄBAŒYY;š¾g,Ç€u$V ù &)’)R<¤0Fþ{ªúªê™¢äƒc„ší髪_½ªî®y·ìZ±ìð¿øïÖáâþn¹{ºè–…ÿï.Þ-„¯°Œÿl.n@%¡—B·J[¹Üx½­Å²·­^Z#Z©—‡‹—Z­…®ªy²’P¿sCóÏÕTÊôC³¹R­pý šÃU×ZÛ»Á5Ç«5Ö•zhà}] ÍÎj­zѺN7ßA¯m'µvÍ öe¬ÔÊ6G0BçŒÍ®ÒÚ¦÷Jön<ô4 Í)žóbMY²,ÊZNë]` Hµš.kAÏÛILšÜ‘üæ¶Œ‰¦@®†T¬÷]âøµžhÌ=‚q5Œ~L¶; ÈÌ׳tå#ùƒLé§™½r”4™âWË­]g þû¾+oA†÷£|É)À–{êóü0RŽÁÙé¸&g i'⯠+ï/h}wj¢ æÊÜ|X3ƒÓššix¶ÅÝá5ÙÎr†ùê;H³ Áº‘Õsm×y9••Ù׫š€'\UUýT[5ßíz÷ÈÒ 5'«ëmÖ Ïk Qb—‚ºrI]¡$yØêÔ@=®}ñgŽ*’w˜9‰úý ˜*þ~\>Þü x|ô–Îø3átåP¿Å-®K€£¾ù±’¢µ}¸ÞFf*îþð–š]á0àµñ’iîÞW íß³»¦Ø«6=»}¡ë¤,Ä'µ[$*©1j›Üûëᨠü„‡D>Àã=±ËªxA&Ò©½sޮ᫼”ÚÎ…QÚ¸y"N i‘!湸©O%³×̲÷ikG{tø-–&Ùü˜e?á®"›Ÿñ=›+*ŒvÛå˜Et$™fÜOÖ3ðn±$Ï`z´ig)±ƒ…PÈÍT`Ÿ ”}ÕB õ\Ȥ¯gÍrÿ¿V=­/ÙÚ™€š¹mH|]ûHã:Á‹Ò½^f=ç8ü¼M&Re~êÄüØlÊòY<¸ë ŠÓ&;§ÀÌk'Z H&ñ}œ€(‘¤¬öÛf ³9¢È©PûŠ~ö*'0“¥º”‡£p%Šç–Ðï¥*‰ÒF0´ð siÅ#…îר¨r ðÕJ^aâ†&z#üʃG˜£ï¿0ÂÔþë¢kîrâÁ_ýÃ-·"{ö¶#GƒÜ§EŒëß0à?j`ûÉ[ÜÔê»î²+]½ûÑø}£.D4bÃ1´äŸKÑWé“*|u–Ï ÙmxÐr&“ôFä÷;…#:ˆð‚rãRŒ77ϧJÚDxÈþ¥/8'ãÈ'Þbt|Q;kIŸäØÑÉê\zÙF×c–¹=ŒEZØ$ʬòâ››èʤ/Ê€;$S^þEû<‹õWˆ¥Ïñä9IÅÒclåÏþ‹(ƒðưœqIhgá}úÞNÍ7+É£}ô%£hŸw•ž0¬ƒìªÑT¹K(ÉxH4@Tq8~T!/½$å¿–ú~ñO1¿2endstream endobj 40 0 obj 3707 endobj 44 0 obj <> stream xœÅ\YsÇ‘Þg¬Þ4³ÁtÝUáK–-:VÞ•{7BVÄ‚* (êð¯ßÌ:³ª²g ò†Cf£§»Î<¾ü2«¿;]öâtÁÿå/ßœœ}éN¯ß,§„ÿ®O¾;ñÓüÏå›ÓÏá!ááÎ>,Aœžs’Þ§B¨½Õ§Öˆ½Ô§çoN¾Úüv»“Úì¥r›ek6ÏàO ¿ªÍüõv»3{­u0›+øAÙ½¶ðC¼ Þnî¶;å÷ÚH»¹…ÇßmwboŒ³róíVîsjóýVí½·R´[?l\yå7¯°s¿7p“¼›^q*¡ýõ¾æ¾¨àù­½‡×||ú¦tBÆ^”ƒ^Ȱú™•ËúóåVÃ-©ô0„Wõ>Ž:6F–•’Úáò´Gî·;½WJI/q¡îqDf¯´Š~ƒ/ã[Ýâ/oà—½µÎê: kLJî·_ŸÿéDzhaÁ>¿‚}mcÞCßvXêÍ9쬼zó:ÍZ:ÑZö¹e+—0pÕ–ÿzß^,»`Ű yºNؼ¤Á¤•|Ù^¾©?þßlÕ²W"øÒ~ ÎxW¦¼Q|šy'?neØËEã.¨.–üçínåÖ9l[YØF­qlE˜aDJš(^œÄî®÷z÷Q(„”Y<ðê »†AfÚfÝÂM”ëUX‘ŠO:˜‘éG^E¡ÂÆaËnÛ–à›8;P`XÑA¥Ê*·Fžá£Ìç;éõd­µÔ]opð [{¼â+-£|›ÄÞ¡äT±/¿Ã~^³Æ¡.bçzû·ÃáÃä××M ³–+Ð[-CÞEt ¡¯{“ôûmÚT­Q‡·­é»¦DìYÏóŒ²nIµð5µwEİc ¨°öäN åü“dÄ¢6€G³ÆlžãÞxàÑóöû‹Ô€],}à?±-ð°jƒµ#Û×ö”ӫκ*¹€ÌhÐ`ìØ…@”ì¦]@§”Y±Î‡˜Ï»¶°õm0jé–aYå`@²Í¸¼°Z±ƒlo“ŸÖZ0{A>­Îuê-T¶(úÁímü·[ ¢—jÞ” v–d”1VQ[ÐS€;– ¶¼§hoâ-Ö[oþ·Þdîͬ*íF'¯ê»Iâ„{k?™ñ¦âø×û&¯äéàî¢édK©ƒ#ªÃ6Aöß.š< vÒ€“E¢žL*I,8N´O;XCMeû½Ü‚;ÔÆºØ(ZŽOšˆ%uð{Ò¿ —w,þþ¢uœÔ{… ª½ƒ1þÝé°ô¦œü|lÂã^c7ïpT&j:«0¥K#ú­N à÷¾(À!”¢úSvÚ«ŠÈ$€Ž ´4J—õ¼õ'à –„4Reö¢~mÂd™{H“'‚‚ MdÓÎï 1ƒ:&#š…Rûd‘‰!Äuú;Aàåi\&“<'1a`ÜÅ‹ÈÈÛé2­¶¤'  3è"jm .zý3v· u€4!¢^-&AK?Kgaz;meô «2þ§úhô×ÐǃŽÒËÅÖPZlrÚ®~n“o÷8¯4OÂÜØ> Íx)Èhä †7²Ç õ°»‰à¤ß5ᚃÀËp1‡„«.úAŠ£-0QD$.¶-t‚çÙX®]‘x¥ðfh/‹Q£vÌDKšëhdЬYïø’£QÁOSL‡o±Aë@æþ{ -ª¨_¥Ñ l»Ývx®3¹y¡ÀfEÓºÇÆÕŒUÇ[BEmV¡u™ð£éÇütµÔb´Ô‚iÑ`f§‡¹Jw•2ɘŒ‰Œf•ÑMè#óÎ…œLÕš\$NR0ŠSÜÄŠâ€<ï³p*.R ">“’¬—N4@ŒŒEG½E7 z <¿0TsTHúøK¬D„0p¹j%2J㧬—d+VÒ’$î7Œc!?¿íMM¯[ñ!;°·8ìELlr@·èŽó½, v•WܨnqõâãØ®)O4Êbn4bK£²Ä}W2Ð4Af5c?väî¯ð@}ëfŸU>Á(+]„Q 5bÅ’äFW”>5E)0ˆTg´ ²ò¥w–IR)ˆÒqÆ3ü@î(ñß6E˜q(g_Ê@gÎ`üÚjí¢ÕU‘ŒC›¯p4ÔËnD½ùu½™ZíÓq)DË­þmKs5Æ'tK¨4 àáôÀ¯|"'Vä9Í–òõ· /£ãä–Œh5Ù &³€Ñ+dNáÐqȈøøæ³­Àµ‚8â÷0*$Þfö‰âzË9Š‘!îîYÉ’Ù9´Kãõ=Újï&s û+ýà}HøUâCcÑ&â43RÈHô»£M˰Š0KŽÓ‰¯ñG{ׯ;1žLу‹R/H΄peÃ$Àqd§{¬#+‚'ö| ¬‹¼A=æKJwÇURŽ}÷Ï邞lÇœ$(ó:JÉw>"!,ÑxùŽá;º†¦qA¥ ŠH8” •žI½%öG‚¬A€TSÈÍ­\Y2‘QŸme·o…‚™[‡å͘.Œ½èg…­€`ŸlíKÖ•7Æxí¨M^ *÷7ä7çÐôv JÀ%f†mì¹,~}›ÝEµO½–Èó6AFé%x>s/Äep-åïܾOþûd³y“^„s62eÀþ°…=tÞT“)ÃÅ‹#²°‚Yµ~V%Üœ0K|a¿g4˜½f„ c|Ó<ä·íò&]ê\’ïîÛ%yíûöì»v—xÞ¥]v½¶*&kzšß`Xz!ó2šøcA_¹ åL†+¢õ~étôÌ«€Ç!D½AöEcÑC'ýRŸÅ‰ÛM£°šlfÆ8ý^æ›ýVæ›ýNæ›ï8%ˆ ¬möh‚ úÈm\6¡ÅÍ1g?ë…‚b &–(qЉÅï@ä›ÄDÃÄ;4RZ—á©ñ[ˆf²šú"P]x‹¥c=R_·P% µèè ç5ÌP†“;†ßYó»´§qí’¤ œ‘_Q¨H}Zü+wóÏíæy½ùâb ,WâQIô2êóAÉXóÐ?Æ ±Xˆ=·“¯ô[ˆt•!pIJ¯‰.Ö„€]T £>mkþ?Ýò#O6åwíòónÿ „Áâÿßb꺂Eÿ¨{ \þµµKîþyê/_´g?:¸óHi ž€C.´Ô,•¢ÉL{~•µÒv¥×IÆÁD2HÎÉ¢’`¸ ÈJµ‡B%(€þv(wÌÉ„ñ\&ÌP.Š(u#gD8Û¼¿Ô^¹ÚºŸðÁ%º±>j™€â=ólôq& gûò<ÞdâsDE„×Êa[lä@8Kx%¸—R¡"—ÂÕé‘Ý<0a,z½‡ÜÔêœHØÀ¥xÊtár%ؘå—o,¡á#“xÌÅ^¬¶ ‘3*j\WŨ  Geý``PÖêÑìL)0v¬¬ÕϹfôhy²Ÿ¬!–½´5¬‘òXUYØD²‚dh„_ÌA $ÝÕJ3¦ªhFS—"4‡ž?_|”‘Ÿ¨Ñ6lddê³_·gkí@cÈÁàŸÿÇÉù¿}>Hv~¼TÕä@N»Ã–:y=Q‰%lú“§)±Ô.UT :vI;ùU6÷”ÝN|¦±]Ø'Ú y›©—¬kÆ”µ’nxï†l½ñ"ºÂÈìŒÁ-· úXq*IfŒÁÓXè'p øêƒ‹œƒ©3ð¥¢;}^«4§¥ö h-à$õ“ÕD+躤|_sPrë~¹¬±`¡†·„EíÆ@’_®¼Ž]'ߊ]eyË9VnÉú„ˆ[Ò¢4?\=žœ,á¡­?ºŽò’·²¸¨=©G¨ó=èõ#¤3!ŠÓùÖƒ\-¦‹a¹Ò…¬LfF–ØÊLþ¯OàŸç¿?ý—“OŸŸ~±z o¨Ë>½`uâ*éÓ¾78BÔy¬DVÑÐ'*ãeúú¨I¬_}Ô.VjÐQ¿ÆÁ¡Šqƒ/¤\ O%Á%KH£=þ ‡Ù1“$ògWJjóOY)<™ºéö7ó¶ þ‡zó¾ÝlÙÍfäÑýfäíÞO[Ÿ†yÕÆþžª# Žäϟ渑BC⎅¾ÜÑ7¦—„Ē?•«jòo þÈ)3—å-nïõP”cú¢¾J¯â6N`"Îô ð8{f‚Œ‚ˆG¼ü¯h¬ŒBÒÉ$÷…íX,Z¶*éiüë£Î¥æ~ÝQK0Ktȯ8m¼çôöþ˜G‰| 1¯9̵±˜D9»’JÔY‘ÎÆF/bû«äÅJeÒ„Æ&´KŠd€õ ¾œã¥Lä/Z“ñ¸fªìòçthÞ»1*õã ¨Ž”Jg0ë/$Žë“ëæ‰dF{lc{ë2'w­í‰ R‰,k¶XžÝ³ýË’8̨ˆgáZ JÎ÷DúÅÚ8Ò£ûÙÄHb–| ©´ˆŒ¬r|8rQ„Y‰âò¸ü[¶`¬{ñ`ö.gçQB.kýˆ8‘H~_:Ϩ§ÒÉv`ëw8—Ñíä0RCª,­Õž™:ü%E’é·<È'aìö¢ÐáòˆÝ˜ƒx<¶‹uQµ¶þC+P‹£5‘XJÇ2³Ý4¼¯Þyˆ1>†¤Ldé›´íÈßÄ2¤@¬IÄŸ¤v¤¥«™´º¼ÜÖü,›Ã¥Ñv¥:V)×S:tw½qx=ÐÉ(díŠlè¿—U<ƒ†ñ¿Õ Ssï¦â…VØVaÏuŸé ûÒts?¸/÷‹ítd¶™«€o“ÌÈþüåYO¢eÈ–ã’z²ÒöÙvúGwZ䄤óEÌ'°Ñ3ì4x+º ãîÔ+›ˆ=‹túÓXø•]­b¿/áG—™¬ÙV¬ ö ®ãk†# Ò£uÁ¥b£µO‰Ì¾È¡á¡¾˜ª]c¦mGè °©-ûp°+6AÉλWõ»NIé]^Çž•Ê‹EÆ`´?bÉpM>·**àcŠ3ñ,k+¿pÜ!ÙòŽÖl²´l¡Í­“¨ù‡@ “ÄÛôÒ"V¨¯k–÷öõt~iŒ¼=ÇïqilÏ1Õ:;Ž¿#º‰~Ô Éh—ãÙ÷ólËC#U_àÄSQõaRµúuj%ë»"tðÖ Ïõ*þ«ŸúÔmšboùgŸþrúRˆÙ aE™•¦~A–ês¤µ Fc摲]ê)JÜ›DýÈ7JˆŒ—ÏA™ð§>̈grÓsìÂ¤Ä ˜ôõwYŠÊ2rGz§ã¥(ïø -‡8é”Û¯«B u›¿{0´]¦¬>åmË.Ò¬—t–`>Ìö#þna³ÍFÀ€–´µÒbÞµn§Áˆ‚°bOµ&}Ë÷ò@ÐõdsZš$†ûœÙË£…ymÖÏìÖ¡‹mkÖ¬D/x•-i#AÄ·{u?\3´@CV3Ťj(ma&æÖ¿òTá­X«à3¯¹€âØ—¡HÇ݉Zn¹š=[õ_#{FúO…­ÂÈÄO­0õÈ)ˆ±Àúh95™ë¾8+·ùЇÅ-–úõXs)ߪ{|ÓÕXijßf¹0IþV)ÙÎÅiâ½ðˆ2~¼Ì¹Ñ¨õ\@üˆ3îÓçó cZô Dp®ûaN'ÓH–w¿6“?rr¬X3ÖÆ-œ'ªG¨ù £¡ß?I_­ˆAmœ3St'; žv•€+\æ\¦Ê²°}u§¤ì-êT a˜®µ-“–†¢— (]¬Ñ1@§É·m¢<\ÂEQéÌCŽê9”ýPÌŽ­ð H«zâ j]J5ÿé§ +§Ã½QâMW3uOÃoè  &¦ÈXaÞH)´žóš‚Û|H§¸ÄÞ8Ü%Æöª-Æ.±bÖ²ÏÚ±,\­d8hÅcõV˜TÂ5ÛöÃa\>¥¯dÄGÍtß±ÝÖYùþEfM¹ïªa¢Åƒï†øå+q,ôìì]æ!Y›ÙÈá4î.EÚdÙ]´÷„_VøÈ «•åyÝ«y^ÝaèDoò£e\:G>Öó’3‚ã„¶|xUJ¾^èfÆî£Ÿ‚A æÃbjˤ.v®Í&ß8–¬j$›¬-~ËHõæÐ¦­Ú«dš’‘ù}¬Y¾cfK0MíJP#G‡ÍNd,*Ð|Å_9 ¯BðÐ’Z'Ö`—2Ÿð'‘é‡|ÂjJQ 2&/©ž O¾ LçÐ~Õ%Ž,_JVç§m-3=°Ÿ„aHçÀ«nýîgB¸¸ÇKz×dÞWN‰ÉKœm@> stream xœí\YoÇÎ3á±ðÓ¬áMßÓ>d[_ à š”)#"%Q¢Ÿª>«{jvI“²Ä ,­æè®î®ã«k^n¦Ql&üúûôâèÁWnsþêhÚ| ÿ½<áMúëôbóþ1<$ôFèQi+7Ç?Å·Åf¶£ÞX#F©7ÇGß z»BºQ¨áƒ­€¿œÕÃGÛga¥m§Ñ5)3‡«Öj5|½ÝI[jŸbÖÃçð€u£7zøj+Gk''‡çðkrZÛá:¾$`‚×pÑÀëføi«ÆIH¡‡Ëzû ^´Ö¯`p-ÐæßÇÇEͰÌÑO^à¢$¬ÏøysüéÑñ;ßEúÜ,&5<Ýį̂µö8s ÆÚéi™‡Ó­r£6ÆÐO¶fxÿi' $Âbg+P£ášr¸‚!$)çᬾXïÃ'p¦ /Ji/+-?©ó¨ìzóv 6­Nþ”Î÷e¸{e-ž’]ƽD®NwÃy/à8ñ—³ œ½˜\Ú­pÿë:G|þ§Âiz?J©éžÃt×õùH¨Sª¡¡Ý©tÝ|I^é6ÿ5<,+dÚ<|¯çE™²oFZYBÁ FkŸ3ÂÒQ8+“À3ƒ»‰0“‡ÁEäA§_GO拉;a‡qÓµV³ »@î\àVÍ#È8­Î‰9œÌa¬¡'‡ƒ2Ë›¸®]ZØ.¼6ɸ¾ÊTø.*ýœ w`Ç@ðq%8ª™ÌðÛv7ÁiJë\^é‚ÿ”BjDäGD…AžGÑh7§ãíx‚™m 7$rȱ„9ê@¨Z2iàÁ$Ò¨€I¼6~x«Ž÷,ÏÓ°ZÞÒ1ÝMÊ4¢íd‚F”~´ª* šØÝéÞ°¦YˆAåk†…4]á^Ke…¦?ŸÇ÷¥rxU95Z‰j^›”D&„A½p7ô­Æ /éi’ ’ÒPÈM(£ÐÞ¢Â@R,Ü¿D… zv8/ïÄUIß¨Ä vnyU?)Èá(ž0¾÷p:AuÁsÓ4‡3Æ[ ' *$a‚•ÿÄ… ïªpøqœ«òð÷åá'åÆUz.OuUžy<Ô«•«êÅOËEÜk£F?»árñU}òu¹xU/>)OêÅ‹rñ]X3ÈäOåÂe3žþA7àu½Â]¼æ({¼ÍWñlPt‰yºÛYœ—³(›ßí{¡&=r’~í§x(W U—tÅù,î¸7áæ0Òi¹ÿ”é*ï =ÿ'S‘óÿž#¤2ůÜíö¸ðŒÂ<똸YcXpÊíOëçæÈÈiý”cÁ™ät~¬WŸ•‹kDjkÀ Y²}?s›B¶¯ÒOØ ¡)Ëñ¶Üç ™c#¼ßì$hè ^Ñn-‘",‡,œ,°|%ÀƒÀÙ,¸-ç…N</,]Ån°SÆ×ˆ4£'ýCeìz‘pö9.Zõ;[èæªnðñë:~#v…¡’/ gT€²!ôɱ.Éy·ñD%Ì(~‡€ªØï&~@Hš¨+!䛉¼’&X†2Aç@%¥~§ÈqØ>k—ÂÙZ12äªp*9uŽOwR¸#ˆÈ,Ež°x ‘FoQ‘•.¬ZÚ¾—B‰ÉI_7™V20ÔuÊ„Þ>þº 3.”çóY˜‰ïÜHp±…é€òf.]”ÆÚô)â€UžôÀÈ™ÙL±,™â`£í,RòÖaÂ&gqñ€BOÆÁ® ,¬.'„a/R–X:]ó½jŽø„"F!x–'9äWXjj fdÁ¢MÀ^)­‚Ù+^çáÉfgÓÜ þ„ž2öJÖÙ‘LgHh]&PS«ò@Â,äE_” ÙeÉš•×âÃÏÊ#˜Ó³+©ÓEöª"_Ø'kB 5dØ5wö÷ú‹ùè;¦;Iº¯Yüq]rc^Ð’ââÄzÌÕE,¬1­±m’hL°O«¹;ô¬»„×ÿ¾ŒÌÎ@±Ó¤¶ò 3P˜õÎVö´0Åó|·2O«Šþh+KÎñÇ•5ÞúnbƒÉ,x=P`{Â]¼æ$¡­¥¼[Y`—¤K¹ÕPAoÁ½[ÄqúF‹TèÎV¶“¦ƒíà Ó è³ èóÀZÅ(ÎIm.Ø_´>nwÖO˜i&á¦÷ÃZ¦V’N°ä¤„–øÔɲyŸìº~ôfª¶‰Ï倛ej9JN3ͧµ·>‰c)+˜ttè1| !!C¾µø£¯İ­ê{8*‹åP˜ãK30h† ÔT:ºÚ¥y3ŒÆ+»,H´ÆÜ¶ QMSHÝÞC…Å¢p#¦&r¸«ºy‚<×ð°Ùe2›«&ë"aC.áÁ‡_K Òþ~&¬N$§µI¢ë†ÁXL¤”!g?cW¥›kv"ÅJMKIÐ2°)éç-k—ú±Œ7O‚p>)¯Å ¿})mÛÜ”w¢uA’vˆz³ÐÅ·Í ¥²F®žáò‰Êb­gH‚Ê8,ecmF*¶[¦Á0^¤L¨E8h´ñØ4|»õS&1÷G‘3&|Ö­£ ›g5+T¥Z:5w2¥ h¬¦Î¨$›™ä$†¤5#Û»šùfÁ>K+µ¥T«d®5 -`„3«ê§"&jœYÖq+-и²Y¶½}}ËýEш“Æ©#&Çe÷€´jJi}È8³zêÌXtÉŒâ;¤Ì‚°Á)# K=f'*J¹¨Øï3xÉZm©}éúɘ¼ž-îî²Ù!¤]µçuär‘óSÖ¡÷Ãòsv…eÔum ™SÅúÀ˜¼&n)¹AëG;cG\‚¨F@Vš «)¹bå‚¥5LT³§&*syóìJkèJïE_æ·pØÑ÷|u«Ÿ9pVAÍ»(ù¨S™ꬕ|’ú_ùZ¿:E3Y$™”’®Öbã£Å"¯gyK‘Òøš%ù&~ a×<üjæ}O}Y㥭ԗIJÎôYv—W}4ÁÈ ÷_RÎjËB™ë¡úynqXœ ÿÖ^ŽõðøèË£—àï9|a‡?¤!%l„sáïÓ‹£÷=xôÙæõÕõ“£ßlÄуOð÷¿øþzôáæoGm¾\ýöCWÖ•¾ý ­‹$@pAðÂÇju‰Aqñ uÚgn×@;Ö×6´×ŽÎ_+íÜÅF“НVFøN+¡W›´nù5„XUl†Å§”`>u)m)j'>r,ÕªCúÉ*r ‰s’+Îb«-ÌUdô«ºùëÏ÷j¤îÃzõóúóõç§õÙo÷ÚNyµ€T-¹AUãW¨…âïáŽùÿî>Â?ŽóslPÃ45‹m·’d´.ê¡ó·%‰¥Liµ„+™†ôA@§$Ü@kÌžDÑNf\%÷|7¡ŒÜ–üÕ_k-NÁµjÚê8xUöp›`uŒ7´\Ÿ×±†ÐTh¿l%ùɨ5W<+òA ,5â§×†^Í.Mø€N±pXl¤Á‘ïÌŠ¢ªä¦ýîª \â> BšZóŽ×+i1 ŽUÆ}j¯³G°±y«y6zŠf?Äa9%Ç ø†àj¾ôÁãfbe­Žf‡>W ,¬Ü`æC¯E¹ +P•úÍE¶41L;R-z—“=@«³ ­ó„"Cie²pûáLýaIe£á½IÚÄî¹UÄn£s´¦[ÓmÆýÀ`’Q»!»ï³:΄u"t5Àº²·õ«¨'sÓƒõ'ôªÃ¨ÌÔ6Ú=Ø«y•Ê=}•ÀÖØ˜Ú:܈¬ßPZ„¢N;ßòµÑ¤I`¥ûRji¹KÚZÒvÄô_zß'ŒœwÑ¿–hÛ›@Š2-Ò¨}ßËãÎN;á§ÜÊdhЯšù²À·8ÈŠƒoSQù• .,Òr(SØkh$¬\'ûxÒ>r›©#aNƒùk4tÝv™öT÷gòû*%Ø1eº JèÜ _¢Ã¡¸4¾‰ ´”Xd܆4 mg÷á3fMÍå^K~ûð³dy ’åy'“ñõv6Eÿky¢)ämY‹!ö¬2]>¬–ã|ÿï³³°DÈ%Ž6DÍÚó1üI ÌühÜ–P’1aWÓw\?#ÐOŽ ùŒq9AàñÛÉëœÊ—ofÕ6G7´[¡Ö<[jîûng¦r6"4ÒhêA"1z\Ç“BuÀRë…§<‹'ô+ùêÞãm¹Õ~™®…LØóDúön?1&âîA]ÍoÑÍèkxÑ=?oE ­oœb)Ì‚â³B'[ër²=Fr$^¹Ðô(O ¾Ÿd»`H—ëÂ¥~èª)šŽW[wxÓÉyùM?^p)ñ={½|=ƒ#Ò~Û¯á{ëž?~ç#·ÐNºÍ0…r¦Ù¨ˆ+îà ØÑ}=Ý ¦é X%yÄ& #0 Ÿlåð!ì¬×úáŸÛà"îDRÕ„ö¥ËÏÐô_g]ä¾Â<5>XëÏ1Àù–Ç£Ä$Wzj¼ÀŠxD`>Ð"õ‡W»÷Ck’ŸmÄÔìBì(ߥýI1AtBtÎû5 ”òõãŸh›åc’w¡ðí¡´â _wçDæ>ŸÁ€c“HÁ³˜ZƨHçéómÙÄÚ>‰F”ˆ9â?{¢°mbÏÛ ±÷ö‚°ZéIgd Åe¶.Òz!–j? ¡ï×áé>ÌĦv0ЇqûÉÓZ¥L°ö/5ÌÃÆ1ÿ.ÕRÑt9µrÏ-_íõ¶tôxoP›—È5&Æ„»ˆðÞVa=ÃLjȄ×áÛ³˜mE º"zÒ¢Úà?fÓœ]¸Š"ßU÷¯e9©8úº&ÏÛòˆ¦"ŽÇˆñ«o+UyÙ¹ DéÐ¤Žžï ,)ªçk)óÚçî‹ }8@ÈÂoàâBll¡°ãË£ÿ²œ¿:endstream endobj 50 0 obj 5066 endobj 54 0 obj <> stream xœí]ûoÇ‘¾Ÿyù#ÿâÝÀ»š~L?¸,[±t°³E;,æD†4LRÔƒ:;}ªúYÕÓ3»’(Á‚ «ålO?««¾úªºýìpØŠÃÿ—þ}rypçk{xöâ`8ü þvðì@„‡éŸ'—‡w pðdë/þ~߇Îlõ¡ÅVêã˃ïWXoÆ­Öã(VÏ×½UjÔnõb½ÛqtV¯^®7JŒ[_ÔÖ9#Åêx=®Ç÷´Wk¹µÖªÕ)•#¼'IáóZßÃê”…êNêó§ëtÛa°ªÐðPH‰]PrÀN¬®hÑX…4[1ØÕ“P\*~¸ZK»õ RóV©ÐæÏ¹ƒP‘Ò0J¤ƒe"Ï€5’M3¤½duâëV¸ÕÙz„Q§Jçaþ~Ê?ƒj¬ð0»Gð+<ó^¬`3ÎãX>ÄwìVJµz´"ýÇ.‘—Éd¥¯B+œMX9«½tòrýÃÑÿ¨An¥98:•ÇÁ KzçÐH›†=>-ÊP$Ä ³zµ5Ô-l˜á lÞm¥Pµð¯ëÍ€£±ÞôêJó&mžk#áçØc?æ-sûhWÝ„Ÿžc‹ÐéÒ ã;Á¡K)YÝ]cO¥q« ´­Ô08œ‚MšƒP0rïâT<¬›àhí4ŒC®>^ËT‰Íêsì¢÷NûÕ=ü …­Ä%ÓW–ÉÈïV›þ8ÅWd RÑwÐX\7'@|¿\Çö¿€ŒQ£Â²Zx¬cõËZ…¦DšK”þßÈ\ÿÿZzønmž§,²'©gP]\=“W/õý†ö3×½]oŒõaD´Î;Eq‚ï|-=U7ÃŒPˆN¯Ks Nq¦€<=¯Ú§nn«%¸é|3ôeù“Zk¢› Uôû¾ä$îC¬S率)z8Œhʼ¯”ß‹¦-+Îü(œ}Ø×ãì—ɾ‚NØ,ü‰–CŸÅÞ§•q¥é,4÷Ø^&w g©ïn`eVcú ¹8%‹o/Àq‚¤LÆJŸD•zª`êzÑt–ù¶Ù L݉B‡ÃMf2œózè2Äí&D?~"Û?hÙl‚ên¨Æ(¡¦y€‡[`R'î»E€7þ¢FÚšr[?OæÏ+$M›…hK`¸Yi>Ñ1²å¼‰ÚEzk”wÔ©#°áuͺ,®Ð"ûÚYlð±¸BƒÂ5ÐŒÙZIÜ'ØÃçö3žÍ÷ÚÅpØ;ïµSHmÓ^×ΈmJÈê€;¨Õ¿‘ïr¯Ý°ºuï}ªkAõ´V1½À_ð\õO$û´³>§©1Ð(¢Ú%ú€E#… ÛVÈÖ™çÄŸŽ&8«7­Ð¬©Y?EËh‘æ«Ü/æøàK¨Í¹—ŠZ]! ¡Š®ÆŒE˜k$ª!¾„oQÅßÖ~È x5Ђ\]Õªòí±±d²‘¢ïS5ƒÂ£oÛÚãY sú9ÿ}^¬ðæ8†ˆ„¥Z¼ 'ÈJ§~ IšžX@ã®Ä2…l?ZÂ*ÆqGš·LÁO hŒ[§Jâùí×Â(—èì ‘ðcŽ%"3AÌ,iB´9¯#J<[çY—ß ÁåG|Iw…ãµ$¸ÅÍ`•å§|"I¬ã!A>ö ô_¯¥¤K“‡ƒ% ¤“s4˜Òå å‘ÓÿIú=¨Ä ;ó˜Ke cù…H²1Y̱OBåˆQ må™»±Ñ®Qƒ}ê fþ©¥Gª©úcyÊ£îKá÷ùëb¬¿~XÂÆ=h<Ëx´.„ƒ‹˜‘`ôÁ0K¤ ìüæH|Øld$ý¾;2·Î8"‚ÛDç˵äÖUEê'Lj£¿)¨¿ÙÑñç‹ðS{Øuvu…šrõß&ˆh`xu—×:§ôÓϽ®³s •4»](+÷vŠ[f·) ët]ÃLËŒª£(XbYx=òŒ^éÍJH؃ žPáל'*Å›œª¾Æèxõ™_Uâu…<ùÎLÈcŒLC‰ õòê:F®Gb?*%ÔK(.ª”½èîû“š.Bòanzeû™#ÃØ˜+2ÉàpvÝ5UÃaà>ÙàÇó›e¤ºgEÏ ÓD*Æ,{Û†é¢ÜÑ‚g§`ˆqly”&àAyÅKH…ÄZ9›ÆJHÑLÕìÚ Ýô,N61û½ ,ôu‹Ûβ¨[®;H¢ø?I¤1éÓ´Q4:ŸLSvöYê.áHkQâJyj,Ý7éDü•Žj–ù!4"©Àik’ÿ$ VÞsŸøõ‰ÚÅú¢[ãXVJ#¬ˆ|Ì|åÑRá/ÄcÉÑ¿|ʲl¸äwÅ9S{Êp7EúHfQ[ÖÑ3މtÀ›Ý+#¶ò öŠt2ìWÂÇ1¯< „sÛ® RëŠÈ6pû'h…f•ǺFAPI“'ôŠzã]‰‘õöe£˜Í- ”úèæ¶ñÄÆíã1 y>5ñ”m¥“ŽÊéS³¨+¤äô_'ÐFÒ,Ÿ‰2íÔ˜þg5{J ’SÇ.¹><¤Ä·®Ò"ì©e‰*¬ë’ f+j `aPa™’o…gëÊÒ••½ãhl(P`ýAiqS[ü`©EaY‹”r†¢ú\{Îo@2œœoé#à¯è58»Þ[íàm$4¯`²…„é_ÝÇÖ5|ŠÓ€p<~ wÃFŒP#ò’Gv¾yi1Ä®¢ 9¬ùÑEä çV_ãä *8þ¡¨±o` Ƈ~Ú؃U[œ~ü„‘TøbRXU‚2ñ.18ï.cÁ·è”iÝ ÓM-ô:™Áè&›±ÃPL˜1Î@ÉÓ@fÿ5ÉS´óÙ´ærXR㯟 Cöu®*uú~ ¥ó0ßÉŒ%ÍõÇó1RåŒÐQ›¦MÉcµ‚Tf×ú¡—ðW_γ5Rö«Í?•Ô&e|‹IÓ,îœGJYw%µÚ·Õ €B"<· ?¢‘?²‚ø±h öóüǾ…y9Ò\¯eäíGaù‹s­o]0,ù ~× Fq”5Mâ­[î¯B5¬¦iÑ”(.'y !Ò…2ŒJlCà'梌Q"ÿsZ~ý±Ôpƒ—¼0:œA«Å_kU°ë(…·ßé+V2Ë‹Ši3† —?•‡„¼îûçåáG0ƒÑžÊ?^±ÅR¤úólè&_‘‡—´Mí]@÷û·ù"Æ ¤!D 9œtÌ^ï`ݵ,*5*#©R®|nIH¸,Â\z‚h,QÂ/ÙH–Éã,$Q4ÞT,.šðïO,‚­™Ç~Úè¨&†L¯„{ú,!Ë—¬`½Zõ_?®_{aåÿÄ œ²¤"Ξ;¤wÛÅìŸaœõ µOÒC<Ã]÷Þ¥ Òü­ !žó¦Ñ/+!ÕxI™P­›ŽýÔúYÎ ¨Q/§º¥>¤#vèðµþiÈšKGEñéÃZ)æ —É¥‘ÇkT| lƒ Ê‚HrEñëâE,³è£ òÕ?vX^¬'þ³ã:ΰw)xG¹ TÔÆ~lï\—Bßø·º:ŽŽÔèrMéQ“ Çã‡Æ¿a°3± Í|3‚Åb"’KÙ^jˆ÷¶Õàd!Eö!v|žð½ƒ'½[+øÑW£ÂÁÛîÐùìf€ÄgL¤éXlakÈfGÜj–c § ú·;TùÛ¯>&ÌGóß›÷ÆÛ¢ÄN0—ž•»ÍOFõu2=”í-É:Û÷¬têâ6/²>¤Ü4‡ I sGƒùvÀS/ d¨æ:Yl‡¸Ñ¸`Χ,<ÊZbᛲðñÀвŽÜÍ”Ãï8½p=Ešµ]8E¬ª¦¥÷Iôtž% Œ«îœÀkKöa{’6Ze+÷Ì”LÛ^åÒ-àüo¬O‡ó‚3„xrà !ré¸9Ñrœ<>fWÆŽŠPã±LcÚ‘uҨʜêÂÍÌl ãÜÞöÇ=.£{Ïä+R êbvB¦Ó“WI±»pÁ ¹¾ÖÄSîo(ãz„ßE Nº©)ae,=ÛÝž(¦S%³M֚߇¹É£è&¼Ç.É™#FF³”Úd¬ÇI29 ŒÓDÐ)U¸’ 7qÓÝfTÓ —ƒ"ÓĦ^èoñ.žÖ{“ëiñaCb$·âÒv/ðR•pnÅ7øgr?Ö™€ 1ÊwÑIÕÓäò­iô7ÝÀSé®®KÊ~7 Ó=GŽù"áú{c½(PcvÖpm/ÁîÓ ›+ªØ³(mËÄ*Ü5²×9<0eÄ.ÞæØ9!¹p†qÀÛÄÜiƺ¢ÏÈ”Nn„Iw6øËÈ 8&Gßš«wä×7^{ÊÔ$Oé’G« ;²Í@ ñyR‡øU(ù¶%;©„“ÎCŒše '’'ìº7¥ –¸™ ­ù¿–®†{‡r•DÞè_Ô¯Wé³úôcf®ýõÓ= —ïìê…ÏÂIhôÜî^¸_{úiýúMJÀiQ’•êM‘0òtYÖ'µŽE/â·ù{'Äî9À¬›w>>‰‡¤ät|±›wë²|¾d™3Ü›-NÆê÷b/uÌ&Ê}oõrÞŒ;óͯ˜AÊùÒ ÑpvùŠz'꘺ð¡ƒTð›uñnºäû4&·|êìç»70LvY€Þ-í3|àJ #u±ÎéKé¾™Kª‹GÐl“M$¨ª[Ì&Jtð^¾Df}“/AO¯b×9ràsÑä÷ËNLX¢Lëâý“)·¤¹^º¾Ro˜3Ê‘pÛ}Ògá¼Qçøfòzßðнè’‚ž'IX…wÛkÒ\þ¯ˆì>²J#ðO6Ÿ§ØE×M¤‰ß 3I*›þ‡G’ÓÆÙf5^'â­äuŽzêu6§(ÑÄŽÈä³WRGuFjöv†‚L¤bø)H-É}Æ“Ý^ï’øF±ße}Ä Mzøe}øšûüð/´dWšTô]}ç¨W{µ¸_túÑ5e{jÎyçLÕÅL q ùZ÷Ü6GH·ÑK=°3i! Í£Ašºék×yÅ|ÔÚåûmž"–!H¯ss -´ñØM;Ü¡©ùÞP¯üJ ¶_ÏÙ+ŒÓªèоÖ=¸©ªhÏDü¯£à9½0ƒat6{ €î«ƒ•7¬endstream endobj 55 0 obj 5895 endobj 59 0 obj <> stream xœíZmܶîçE~„>’áÕ‰ïd‹ÈÅ®}EÔñEÅåÞløÎ{ö½åþ}fHQJÔîÚ¾ú!1¢ÓR9>œyfF«®eU‡ÿú¿G‹½ŸLuvµèªðÿÙâã‚ùUÿçè¢Ú_A'f¡¥ucÕêtÞf•Õ­¬´b-—ÕêbñK}Û(Ù-D}بú¼á­1FÔ7ÍRµRJ§ê“f)´k•rõºœ6Kÿ®þ ópGç‘0²íp¶Õ1ŒŽïÖ¿áå/·pi»Ž±ðà\ ¹°Âfƒü Ð-uó?…_–·œã˜¢µVsV¿¥âJ¸ãBÖð= ?tßÓÀ*ßæ S¶UZ`Â/œ‘×A:Ù !¯¯š%ÍëwQC¨ œÁ¸V ·Ü´Jv™ê.ѵ‚KQÿŠR·RqÏ ¤‚¬¾CÍãK3œ§˜†ù%gãÀÛ8§H¯œ¡âü(#YFšù8 NfžÕ¢2^‹A §$ ¼ä¶í˜ zxß,;Ï8ÝË‚zA8hõ,`¨c:âÇÂÔ½xBÐà± ˜j­Œ[µ6Zzx†mT«2q££Ð†Ù¹©Ž»Zª%ˆd†Ùðú¬@¤lý3üj{M–°ÍqÈŽW«ï«'¿ÔÿCÇ oƒQüï€ðìñüe×Îy?2]ifØšN1“¿8×ÑHöÕMë`[Äÿõ„¸¥ÜñÖFp}õÌå]À[)l>Ò¶®±ÕC5H™Cõîü‡Þ’*æ ;dz$Âo^¯rœà¡ †öz€Ò[¼àéG3E;û.÷x¹Œ¯…§oê$òéÐú.5^WåžçÔúK­Ð~ÔO†ÆÓôöåÐx? àX§Ñ9¿øÐø!“(hHáߦçÇCãMi÷%ANèì`¼ð³³ƒ…zÌø¦#⮲^q÷'­xKD»J}ß4TÆžs‰æ\û´£4Ú*œö˜MÜ´½Ygœû™Àc±9' O5øos5Œß)Ô Zy®ñŠ?$˜‡ ‡Y)?]Ôüо;#¥!>“ø«þÖ0ù#t´š¿¦[2¼l*EºÞœíÀœÃ,ê-ùGÜ&4ã É9JÖ-ë ÒŒÑ¦>@ïoá?Q¯¼³´öþ5ÎBÁ²¿I >; ü—M.E°V(ñq0à釴ûß/RãóØˆ£>_-^->VBzÛÖUK¼Z¢Ô•2Bá_`Žû‹½ƒªëO7'‹½Wl±÷/ûÿúþ<«þ´x~P½še”¹è‘Q¢÷–Âá<-ãT¾D~–Dþ9;A¼CãH÷:õü.Ý”ng×,¹žøøk–€+kò5¯’¤ûéöûtt‰ÝXgVÍë4°_\öi„oSëOéö?ÛõóÚV?¾^óúøµ”¬3ÿo#­+ %œ;oîƒvðë³?ˆÙó]»Ž‰Ûà|¿€¸áe=p±û){Ø‹ðüLŒÜHdžÆÓ„0‘ž¾Œ¤I‡Ú³_HËrjˆ!½)‰“Æ»,Í<’Ö#föÄ Œ²ˆ[\Z¢ÓК[ôŸ“Ôú>Ý’ÖûÔ—háé({¨wˆ(Û½*-÷°Ô˜óÌHúÊ/€mÃÇöðZè|>D.#tO68M@™ D´.•„fñ G<>$¾ã™yŒO+ €ñË ° „··™Þ çáæa1~TBî'º\"d1:Ë7oS wZÚ„óºÖCã] ‡ \g™ Ân³úï0Ÿèüúvhw8ã_LZ®ð¸/‡Ì×q`tMˆ‘“îtÊ3õœî$Í¡¢´¦kõ0t¼IåБÆnã”4„§)†Ä.SŸwÓH y §ó a¿Û‹/}ihêWÈç"Sá„Lûl¨°”qCèVµUØBUŸí U!–ïüÖa’•l¹]²³AI]Ü#L¼æYÚ“Ø9‹ë|Ü}—äJ¯¥WÞö=¹›¦s1ÇÛ+LØa³±5½óÉ’{YÈ›ÇCN8äƒ1ã¯Gç0aÕÑg9à}’9!8\kï‘g)uá{ J HZ%¦£ÔçÅy<û’µ¤ˆº´DWеZÂR =dßQéaI§·ÀjÆa·{÷5áa‹Õl#N%>‘Q¿éý߈;l26z™Nk¡ùtC5è!ÖR8QÆãäóRbç4¾¼%“Üg§Sš¥X¹ÿìÌ]—5ø:œ¬ÙÎþœ\ÌnùÖú¯›s2Ã¥z×]JÈ”¿ÃÏåØ4UBÙ–óß×ͤ>=°¹`¿¥ñ|47öÊðÀ¯¿@b´»"nâ‘ò+VöG!0…Y¸÷ž$ˆ\SqžXbϜߕÅ3ýêÄ–¬x­7}.&Ö!|E;Õ!¢í%!ê M„ô©µDCÖ~È9^2Äô„ýæ•-}“ÚΧ?··ýbr{ûkâ;£Ø zwÎå¿Î:³ó€d£!ãÏ‚$ltÚ¾m’{…^NŽHþ f"ØY6döcFlÄOºÀ­¦ð£¾_y€ &ßôqMl£_Lâç8NWKÁlkúíµáûKÿ]«Åïäµqendstream endobj 60 0 obj 2615 endobj 64 0 obj <> stream xœí\Y“ܶÎó”~Ä<’. …DRy°lÙ^—­øXWœ²S®ñîj¥Ê^ÒîJ¶}ºhàÌì!ùŒ+#.`ãëF÷‡_.YÇ— ÿþ=8]<úÊ./lù1üÿxñrÁ}…åðÏÁéòñ>TâjÉyç´Ëýg‹ð4_ö¦SK£y'Ôrÿtñ]£ZÖIç¬ê›®å”=çP¸â\È®oöÚ•è´SZ6§­êÖ5k¸ê5g®9O i›£v%{Ö1éèC ‚bLè¾ùT°®3V6_µ+hK Ñœç®[7µh®ð.WΈæ…’5Í™¿)¹†~ È «šK(cÎIþßýOñ…{Aç˜ãøÂ‚uš;·Üÿl±ÿÞwÍ>tÞÙž3ÙýL[*b·HÝf‘’(ocö6æáÃ4ßàOv§>‹+Sm2˜å”§“Q‚¶2wEõs2&a°9 ÓýjÃB\oœ÷ܶlSßDþÜ:9¬K¯ ï˜Þǽ՘"¹`$¢ŽÏ@ðw?{»àßh«Êíx?·3 ¢‡x- f6"ëã67+Z N¨P’:¡Å¾°Ô¦“:`ì6Šñ°""kUÃñaÎ\¯ÇÜƒŠ™ê‰‰%è’6¶t¸ý,ªÙx4½ë–gŸªA">6Rb,0ˆW˜°c~^ÛØâàÉfµâùQDð4.$<#1zzÕhçíÒq¨†¨§aôªi=ª¡Z ¡BÜVÉ4>\Ñáx7§ ¨øNxüLóûKBy¦¹‘U¢÷È#up!(D ` n¸iyÏÀ ¯†<]ý æÆê}FjÌm"yð‚Ò>ÓÓ4Õïçùÿ6’èþëšoNbŒ§¹´l*e[Ä1ØÀ €r¤¡"[ÜËNx:fÂ!¥ 1‰ÌܘŒo§ÐÄSdĈb_ERh:ëÆ›õ,§ï+•ãÜøÉyI+¥{ÐÓÉ”_gm©0§ge/È:SÕƒ¢½õ}|¨ 61+-‰ ‡ö™[ï)L€?·¢€.ù‘Ì2´Úz†–@¬ ¤ÕƒÊ:4áUN.BŠNK¯ËÛú~0YÎPæDUqR¤I1èÒb/è{óØTBŸØÔ Kð„(­%­zX/‰¤2=ÏÐL`2õF/rÕë\š¦fœBÇ'v²OTn.E.w—âåéF^)¦GÔìEIÍrEšhÝê©I-“ÿrÙ+9ƒ QªE4×›*²ÜAï$“žõ=Uy]¡2Ñ«ÀÄHÝÏ;K,Ðÿ#·á'bÁˆNG¯p¨V‘ÆÝÖáŽyqÞßJr­Ù:,ñs`+*(V¯ŠzÎG„z$_1 $ÁMùVÁ5Pæ®;ét½˜,)©ë–51­ù‘\ô°X@”+HÞ xžÕƒä@n˜4íY-¦sR,1—R(¯%ѹVÔtN­¡íš ጓ}¿¯ï7ß«ZÚL¯ú˜¸ÃÌx΀¨mÙáe˜}Ç]±¼gö¿ê s)»¹™c½¿27sÅ?uææ8Sß!½wLBêÉQR†«ôgR™À˜›{Í©S ˜·‘2Ç# …eRÈ4câÉ™Rªæ¾¼ v&faš"œ ³ ®Ã$n‡”a¯æ7š2î™5ñÓœgÌoi"?È á¡òjS&v$—ÈÅXÞ¯™¦êFPR„+ÿÐ'­’ xJH•2ãÅ]lj 1ÈÎ.YRW›y°ãà"°äL=²À.ˆ:;ö’,=וµ¹úPt"`á½ ïè@ír:ƒìrsR$ÄxFäøAö‚Ê$/íš9*,Ê­H/‰U ÃE”ƒ]]3âÙEÇ!1gçFCEC\ðI>âÈ›£"sˆÎÀw÷QòLf¶yÙŸ.úo®äBM×EÕ1ξ&Í…Y¼®:t›K”-U<ÑÆr»‘`«mf´UçJ3¥Ör¿u±Ù­KÙ3±Q±iÕ[ï­ÞÞ~‡•âM¶HÆßbÈ–’…D—u´ëÓ¾r8g’üÁÙLRÕÒjŸ§?r DzÂ÷OÂ8¡ló[û“7óé#á¸Pqº"Œ¬øsq^؆š›E­Ö›ÌÔ>IüøÓ 0– ËêZ÷«2h«§kÝç0c4XÂ÷[ *à '¸žà3Î{†¹!º›X#vÛ<òçµtùVŠ…¼u[0UÒ dGêdcþ4Käy²3-EΗçp(f°Q:76·ÎÇ£Y÷wj›Ü‰² ¯S®±†ãýBš>§4²cNU¤ºÐ×Ï«Ì8"œpÚ¬-ÝPTU#³Žüµýö×ö[m¢›ZûpÊ}~-µ4ìÔå*i“®L;ûÙd“nûañ Ñ29-ÅòmïÏnvȪ…sñݨw¾Ó!êÉŽYñšÓÏ¥LÏŽ#Y„ÈxSO¥Ô¼äà}TБŽu÷d˜ÕrRxZ+<£STÝâ iMiï‡5!­kÓNüìum²~ÝmÅæålô:žÊ³ïPG}û×ø“§’(Þï÷Ó¿Š"õdä£n¥J“t„ç€êyU† ÐÓlÿ¤º¼CŸ›¾Tq]ÃìëÚèN(2Èǯˆ˜ÆÀì…ÁÜƥðF>[1²'ãx›Kî38„ Ì¢Gˆ ç¡=±ðåâÿ]ž:endstream endobj 65 0 obj 4174 endobj 69 0 obj <> stream xœÍ\[o·~Wó#ô–s k³¼“R iœ4…‘´¶‚¶H‚À¶dÙ­,9¶åÄÿ¾3$‡îrWçHR9^q¹¼ ç›+É_ÇAŽø_þ÷Ù«ƒO¹Ã³·ãá×ðÿÙÁ/"V8Ìÿ<{uøÅ1T’J†0qxüü }-½ô¡Un°þðøÕÁ›—Û#µ¹ÀŸwÛ##‚Ü<Ç¿_æBµy ?Ã8 ±ùÿ|ƒ?§øóNð'¾xMŸ¥Ê¿áŸ?nð·m0½†V%ô潯SáËZx^ ¡/mÍ0 »¹W Ÿ×š¯Ká»Zø¦Þ‡‰žÜE­ ‰H2Š8—ôþIó~­ðCo §³Þ…f3º¬ß\”³ZsišôørûÓñß”’ƒô¸´Ç'°”¿Õ÷§ ñQ+CÉ¥øõ‘”a£8<j0v”©$ŽOMF&ÇHÁ >ÅîRQá«^á_ª9#ÀuðX¼yß#V]¿“±Ø¢^•ÂóZø¾·’ç“¥Ú¥çLŒ{½ö*㽩…ìý‡fºympApL\><8¾×E¦ê÷xÑãÅZxµ2×%@à»{½º ¬¯*5~ÜÒ#Nó“GÂsÑt2I ûI3hM|øh{4>ŒnDvÖðFH šRã ÀÀ™Hom%ÅæWìÇy@3–êA);j˜£œsHG5ÀÈd‚§²ƒq*¶xN5>Qá§Møpt:˜øEn^ƒ°ÄÉk?)â7(Ë´´‘¹?§ÔæEýšºÖzó¼‡n­Û|"ªz¯6Çiû16eñ»:‡WH`kÕqg[“©#•Þ 0*/)©‚h;§ªyNØ2¢Ü$›¾ÑÈ$7+™Èƒ'µ½2¬?mGøhàæ}¤–°pD6‹’KÀ$HnáíDZ½`4-%’!7#­ÏýáûD[dÓÒôÇyñ¤§Õr‚òr”A±áà‚+ßHN\ǫԄt‚õU»¨=”ÆÞâ*ã¬Ü|J£¤U iL‚6"§}\™µe Ä€j›j)ãfÖ j;˜°IÄJ§¬âåÜ[xe…Qðʰ!¢D•l4=™†I_Û¹¨¯Ùx®ê#›Ï„Ùã“-¨j`ë'`5€5𤴨¬¥÷´úR¹`‹jЄ¬a°½L³@Q¿„ešåX–ÆÃèø²žG0Èõ5¡¡E³´«hN¼b‰õ¬äxxFH‹ÊÎ'8ÕC‘ŒŸËüySõuæ%%+à'!Š—=Ô ÃSä¸*{Qù¼6ô %¢ñE¥Ë‹ÚcxÞ ¶ŠÓ©ÀIIÔiµË“ª¯ó")uý"IÆÅ¿¤Å—ˆ3V7µ‘µ&3™w­çéÂd ´x÷ŠU‹:3H߇²ì=sl+ëÇâô€IÄôËå Ùäêò‰ôCè×yÉ:±±e›ÿd–ZÅ3“à+à@͹ÒÓt¹±.öJ-²Eèd¸eS™ÞœtEKÓ2É>Æ»Ek˜%Ä”õ9“6øþœ) ¨é4bH% à™Žì‰üþŠ*¿±Ä´èè“‹ªE.3+€-é>¡1Bв›üË•;Š„½¯4„w¨§½Aо³À€Vì=î°'㺗UÊ3-ÁŸ™‚ÞÁ4@@¡>êèýz ¶hÑ„>CMø¯gž%â``'ÉÞ#FœðŽþ4Ñ_êh¹)–ì+”÷Ä;Ì”bôc:å;œ¨7ÁwÏèAnö2r3³™˜ßð´²ã̲h½‰ZÆX˜»80$°3­[F`d2±4²‰Ó¢+†cÑ‹¤]p¥žr…I £§@„HZ„V´q™TÖý Ÿ=µµ¸®ÑâfY‰3P^ÌÄb¥‹á£ZxÑc}´ ‚7w5’x572‰v†FµvaâÌ4š¨€à¹%Ü[J@CÔ5‘¦÷Ý(Ø9eÍæ3xT#út›ok…ïëãÃÂ|¸j8=X  P˜ÙÖq'Jïe˜¡miTõ]ä¯+ùû„šŸXd–‰c@ã,õaŒ™ YZz nîæ¿Ì#+À4!¯¹¼'; Æ÷EF¥lÕ×aÊB'Õ¯¡J`”t Íù;CŠH|CHi SÚIkáò+y+­æä8úkm°©*R£cŽÌÄ{AjäÜéž|D+€›5Ô¦MR¼FPç&Ëc©]`f€bÚ¦dubB§¦7–Å´oPØ·’1ÂÔµ’‘ë§N5G 2ºVjfƒaa%:Ö-Ž„7Æ~'>vŠ¢æzÐÚãÞFÍÜxÁEèL¬š£Z*Ø–›²ré&K'gL=ìâ@èÑÃìWŒùÜ?S-ŠzN²å1Ÿ˜×»#­ñ ²g°;Ìy§\Èf ©5f–² ß¦Rö¤JÙž¢lL˜Nا|“cf1PfT 0zÏ"û˜§wÝÚqXµ¢¨ç‘jéUŒT·J7N„{„_•o3` ‰^ºj¤g/ÊT;îù±Œ¢÷ó`• ÌÝЮü­6ú¹aq¹ÆžäÓY³ØG´t–ô˜œÉ ‰D·ŒÇ/ŽÏQ2Gº~ò«-XA X¬]ϼþ¸Jàná*3:L‚í•ì`Ñ©l¸$$%µ´e½LænHÉÍ–§xRn”+8Ú0î›”£‡ü²Ç"à™›ŠÛòó¤¬ô‡%í$ß]ààWÃ*Ò‹"Ò÷«d›Z‚Ÿmê†A˜!B.Å®¹Ð1rO5A]Ôñu°½”/T£°g¥ð²ñµj OŠš¨Tc`@šktHqöIáEX 3s~SäH1_¥!¢Å·-| ÏwИPjšbIEÿ̹Ýhßãöß·4%3ÕJ’»oñãgÊñe¼äÁ©òÝÅrx+&}õNá-n ¡ Tæ‡6Çdohø–"º1/?Ë&²¾wñ0çp4zóÏlïfÅ/º˜ºW5<6±ÙÖådXAS® ^N%¡…w¦FÖÛ-(“Çd}vö tE$Èqj5)%<‡NkÈ`Ü\¨½Rhè99Q83œ )[pp;ú|ÆûÌL}Öè¦ÔN0¹šüÍ¥ðhò·À\– ]˜NÜü„¬q+ZC æÅÉ.ãüÄlO …d‘”-ö.7×®fº møEw<$q¿Ä`H&*—™ê"\+Iˆ»zVêhG2g™k&{/r(¦x¿ËžrðX­aÇ6¨ÔähYÑ:?Ù_äØ!­½ê®‹6·vcw]Ïf,M]%äoÝ5øUÌb,$ÖZ™™k®‰e ©Eç÷s](X¾” ,v)îP ÿqŠi’Ÿ7Óœ®û®ÂL·Š´Ý$×e†!„ØYÂá( ±H\^mÒ%eóý!샙³Ž½&5cý,3)sB.“ž2žUˆx›BídÈXÃbLsÉxËXŠÌ§Ž µkz&„Sð·Õ‚ó4-¹Ð ²W\⥬žãN"£bLé«-¬ˆóÕK#øÔ8M"t½mdmÊóaRµŠɃût÷B¨ñe %Ml˜»¥©7Yç€ãS·G—ð ­~™þ’sïZÄ•¦'ú»­?ÛÙëQ6ɫΦîbª­nåÆÇjݱ–þ´-›¢?k÷z+gÑy˜hœFaP#µÝ©ÀŸŸp‡v4îjÞ&½ZHȦ ‡ôÃBv´Ý°k&fËàn%k¹Œ1ÿ”ß}^?ýW)ü¦>.…b[ŽÜ«¹IKrUö °¨Ba!„4`…7&¬c¸Ð@Ë0`H£ZÕ«Y÷þ'¥{¼’\87ÆOLpÕ@ýr6Z@Óãvj&C¡1ÎÈa@!á@lUá BLÛÅ®¸´z¨ik¶VNÓÀÍð:ESº;2Šàï1§A ¾OÎ$¡i\GSÝ¥g „fgdZ‘QÛ0‰1?úðç×üTz7ýÞÇu~ÄM ÙFšwØ+à«DcÐÜAÅ'™@N´Ø$‰Ú‚“Å:5F¶½ÀéCˆ‘Þu·¥K7Œ.8j뤛>×uëÙñ§öTÕ=]C41¢ÐL¯«7¼ kíœÀi=nûWí¶§×ÉéÇqÏð)ðý¨g QDÕ-ïBW£Š¶‹ç´{eó_vðNZÚß<45ÊÒ“ÓØíb¸8‡1뾤¾šÍ Ìžªç‰ÚÎò‰šnˆ±z{í—7!Ÿ-îr„AEí>š•½c ;+Ò¨zÎwy(ÙÁëåÍz¸£|“,ÎFÛEE³eŠÍG 7Q. PyHÚ’¹Â„1ÚhúLˆÕ‚ `© Šj³ksÐh9Ž›¶!Xcn{ШêXí3ÍÙøl×5ÆSZ!'à‰šÎb&¢ô}[(wöÒö4%'šãNOˆÄˆüêÞƒxâ)$Ü_*ɧçE‚*1®Xú¸2+«€¦žBcÏí²91&Ô’s?Ír‹l¯JTˆL)†…€U ®¯°{\LŒ ‚0u ›tTŒÞã~ìfcE®·š‡DjÛ~Úäö©mä^b6`ñT-œ5è…¬U#,—¶!±Æ&îι;ÅèµmD`Ó!Ë&uÒxl;Db|ÖôÈ—š@–˜È(ןÐ49 Ä8¢Ý“ZŸ)Úøë6žJ.¾~þÙÿ^}¾¼J/{"¹çý÷Åê¹3Aº?ª»É ¾ƒ ž)êwÛ&;ÿüP\…Óÿ8ydÍ}º’?‚eÍÇhåä”áæ üù7þ—<ÀýÃsi#ntªß’ßRÎ}+æmŸÐélù(ÕyÑØ§3󇊧™ã87ƒIUã Ìj<Ü“ëTzgþû…CØ¿÷¿âÏw¥ê£L”½{;éý²gº/¤Ç÷Í`ÒG8¢2aâm7Y—zèúfcû¾%N:ìE:²¾ÃüKG… nÁK§ØkçecäÃ:Ž‡Ä l_×qìk¡‡<íÝtÝ ·WïT Û¹ç…`«·€%Ç7¿ß­_w+Äf93Ðò€ßPìÜœ1ÆêŽþÿý³%£endstream endobj 70 0 obj 4438 endobj 74 0 obj <> stream xœÝXÉ’ÜD嬯ÐQ"PMíËÆšÃØc†îÙ"f³ÇË8þÌZTUju3 ¶xÂÝj©*ëUf¾—YzÕRÂZŠñ{uÕ<3íÙ]CÛïáÿYóªa~@¿VWí£% bîGk—§M˜Íà– ‚·Z1Âe»¼jŽºgý@‰uÔPÝô’HÉ8ïŽ{Õ­ûAI¸!Xw?_ãO˜.T÷¾1¬á] ÷4•ÝEω1FtozA¬ÕœÁAqA”r`qPBJMš#/V\Waº£¸†yð@:ÕÁÏ·ùçeZï8¢ShÕtwýÀ`I£“y.d4WÙüø&®£Ð´ò?Oq·Ìo>O8Ï‹§iÕ}ÏÁŒ6ÝW¶ðOtËà"Îd÷w.ÀT^ðª8ÑÚhéÁãÆ2TV¨–¡hÅ8ÇÒÚܰ8”²¸SÍ©óxÀ½ à÷/—?6–Ôôå‚=n˜*Û½ë…ÇSX,~ÀŽpˆw±NØ‚S2íA0Sܼ¯Ž‹”ƒªÀxñ<ã®LÑA(JoæóÅàtÛ€IË9y…p$chçɲ9l^µ°%ë“|À Æ(ÄζZXÿ ¼y´h?·o^¿=i~kYsð~<úõ[øZ"œŠgÄ0çR.MH¹—šê¹¨Â\§)OsOgs7v«{8 ²ç“»‡3 p+÷¼.˜ðx¼¹~xIÍçˆ-¦¹ÍØœü}Éž™X¢‘ékçÂ8]i~~›Óâ*¹"ŒëyÝÄìÁ1LÂИ¤@7AÛ¡©K Ç=X”e;«æ£¤žâ1*úœ‹-Np ÝU )d.CŒ{3Ì2œàY:/qŠ"œÚâ®n eR¤šÔuå<›½Îk?%ÍLˆï^tãÝüüzŠßàÇEú|NJþ*qí†}40|;˜ºu*\\1#¦³ãZÇò~‡\Úç•I~ÁÑÈ8]öc˜À@¬Å™Ï{ ÈÖêT—{v*B†#@aük:d[èôözb¬²5”{ ©ODÞ2jö ªµu¢êOQiÌ‘‡šÛ‘°¶0÷#c¹·OI§Ý݇ƒÂ%è„o'|0È0Þ û·h‡ÍߣáBÑendstream endobj 75 0 obj 1699 endobj 79 0 obj <> stream xœí\Ys·Îó–+¿awUÚÎTDYJèÈIl3‰S’+ÅK$+â!¢ôïÓ³1ƒY.M)rªl—W# ŽFŸ_70~7gŸ3ü7þ¹:{ò½™]ÍØüðßÑìÝŒûóøÇþé|k:q5ç¼sZ‹ùΛYÍç¶ïÔ¼×¼j¾s:{µPKÖI猲‹nÉ;)-ç ½\q.dg;Kë:Ëìbw©:«3‹½¥èzÓ ±xëôÚ.—+iYÇD¿Ø^®D§ÒrñæVŒ èðWè`Œ“‹ï—+Õ1 ãÏÃÚBšÅŸT‹Å5¾åÊõbqâ§7ýâÌ¿”\Ã:Ðä„Q‹+hcÎIþÓÎ7¸[ ûïsw+X§¹só—³G¯`+ÙË™\/WºSJ9 Ó‹Î è ^KÞi#ð4ì–RБ™ûùéz <±½àeðùR}+©€±=p$6ÓÉÓŒe4®¨€Kð¾4Ò²ï´Ò‹SdgüV~©jº•=2¡¬Fz_ H`>`>¼D¾J©\¢ÃH BEâ…•ŒŸOšŽ3½xæfœã‹K|2½AÁòÎ:*°SÞÿP¨àéÅ-D'¤£ #7¥¡#ÓFy€\Reù ·eá–$÷—¨ ÂÉNXP÷Pðc =eàCd‹M-+D ï=Kaš¹"•çñHLŠ&¸B¾ø®Zépò½@·á6j‹Ó*’Â8•o—Þ Žjø*nr%4tw6ìõß°hþs Yþïc`ÖÕëéŸM;×ýÈr­•-ÜÁKðôýX€8A”º@²nʰi©ã 3Òç~gYov„‘IÃôƒÅ`•fÇ|òŸ•4Aùˆ r¿ÍÝZyÈãî6 ¶ã|w ©ï©I²FôíÑ )pLÉ(’,ÕÊ_œQí =½C¯Jèá.h”U<)7™,ªzgt¨ÀLÎIj‹±_‡Ükʦ…mîuR÷¡~†½˜ÄklD P SËÒHL¤4 (m¸é²@yBž÷àÆdRdƽ¡×Ùy²ÈFHÐØTÍžIÀΑ£5Š)WoO4Vè;kú\#ÞWu‘Õ­|zç0:@Ï„" *X¨é” .ÎtÐ O_Ók†/Äü€1ÒM)Â:T¿KÇ‚ÕdïK’ ß—+ß„ÐKpxÅu‘d"2ú±ÚÆ:Jîr€o¤û•…œÅº"8«7üžÄ  DûÉß/AC!~Z¢o¦r2u©‹_š§ýÏJ×’)šXGO³(æYyÜn=â´ÏwfßÍÞÍ¥òi,›¯ðA¡­1;×Bƒõ[¬[nmÏžl;¿¾¼9œ=ùçœÏžü ¶þö þØþzþ›Ùóíùw“õÌšöTÏTð\Ëà*¾¢¹SÝ*/ ´«aµÇž°ë­æVÿR@ÜÓÒú}yü×ݼÐLÈÿ/4…ÙqS-妖e]•¡V cøš­%úpÁEŒ ¢: ƒÎÑn„>©ÕÛ>â[]!_{Fs´¤Ž¢é=th¹oÒ:À[B¨‰P]Ì­Ø×¸˜8ˆÈUH”½õ!± µé}í2ˆ™WÅi˜Ãy;ŸðvúÝÈÛú€î5æªS*¨òì(ÊÜ¿-ã Ñ'µìB:à‘‘ 5kË!°kê31Ò"W …>î³Ç,঄ɋҗ8pB/‚#œŒŒ Ÿ_ö! :ªûä:,õÆæØUô6–¦üæk(;Т*õ(åû˜ê`T¿®´#¸ö|—§hmú\m†qµ9Õ†c9ÏÐÀ#ØÄ$.ñÐ ‚ ¦Þ¤ å‹Ü\G—¡-ó“Ãp”èê n‡Àƒdo9 =u¹; NÏoj73…ê#K›!Žw–à³\<ÇŸ[ZÜkâÚ=ñ…M¯–´€˜Qñ74C'>H@N êèÕ%[ÌûFÚˆÕÙi‰!¬5Ì›qËù®K˜ƒÿƒé•Ï&šùËéR¡Bɶ¯Â€/}ÉxÃúN¤Ïõ( êÑCUGE ‘¬yaz’âv0šƒûÇrè sA¶ô“ ÝÃZ¦, }7¸; n±çîŽ\:+&0é‹ÀÊ슂dÕdJɺϡÐï« ú†J;ðH%£ŽËal §ÂÉ+ÍeSÅüÍqe‰V×ÊO$\ATR½ˆ™ÊÈr¸Gç®Âs08_aâ‚ÀkaҚȞJ¶"aË=pˆ8¼ÊkFÅúRð¬Ë̱±®2‡Æ‰ÄG¢G[ëHBæÞp$Bªfv®Œá!ù§ñ#Nø÷#G€jµcGb&¦¡èÑ’pXÜ3u\t»šÙïVrCñ@ÒXíêÌÜk£äSæEjP×1¤˜ 1;4•@šU!PÇ•_/²÷èøiIéy¤t? èZcEgñ,Q„ •ƒ9Ò¯—y•ª³â¸ã‘:ß÷È£¦¦5œ·Ž}N×)>DK"(ž¿ô<ÁÑ:gŽÍ8Þƒ21Þ©·—#©ÖùÝDtÿ<\T•Öo0¤3ëËl6”šÉ~e)¡“ªrå¤ä¨Ü¤â§é7‚J@,÷ëDŸÝUY'Ò›Ôî{ÅÖ#±µY wÁœ¢hžcnò#þ` ÀT5–èßâÏó©úª ßâLÃs(T}j€ñJëñ9T¶°::AfJNXÆÑ)ˆTjx?Ê_ «ïGy›SŠæ–ëi +¢¾}ìA2Þ‰³¼Ú¢‰n’ƒ–ЯÊÕ RyYk éŽ+,=œ×¤S¬˜ñÞymͺ&cJ‚Ê#Z€h]‹7)á¦>eþÁ\e‘¸qeÆ3¸:œ]XÚëƒE@[Œ7ÅÚ"•çÈyF‡ºlR±jUÉk=Ì Ko-VëK.è3\F©Éz­î1ïèª|<¦‹÷ /iªuvˆðµkžôUŠëçÕ²Îéü§ÕÀh¹éÛéÿÁ„4½.2Õ¹ìÓ[ÛÈ)X ãEïI)0AcX–ܸL9"Wõ©ž?!êM³î×:“C5â*ËúжÖòëxÈïyƒx=^¸Å ¼ƒ´Ú­?²½ëvðÏ­'¶õ ;¯ÝšúŽEº»±îr'–H¤7>WSá ¶6ÁtR7F‚U¥kâòF>Qãw›Çhδï~²ÞTÞu&«üWÍâÑñ7_c 3£W3¸ãQêÒµ±l.ꓜ֕ËÉ{©œñr¦V¸üp¾Õ¸-Ó k’8ß¡7;ýÁŽþÂÆ¸j|VºæPW ëËõ àõ‹ ˜˜^]÷øÈó1ð3Â0v©€WïíÄQõµl ःâÂuX‹¹ûþbq¿ïÇJ0‚Åi* ka‘m¬Ÿ¦k¨2–P’dZV¾Ñ'‚J×œä ž.E‚~è^Ÿl˜Ž´$®>8XGã»uèAbTƱ}<øh9¼½¶_HZÝ8æbk'~¯‘ß­¹Ž¡t8×X A"ÏðÃÏLÏÆ8lcYÇz÷âS ±5ßàÈåÍp@ÞQ o –ž¤æ’K?ž±rô¢5¼yµd±×exsõƒV¶ª¸fßü¬pwõOßx±¶sZ¬žaýë‡5¦O%&:¦ÛþOŽÜA–„kî·éʃÆz$<†KÊçIȽ_”®,t*ge'-©ãqn$Õă0 ®(ÃaM)×1w~)3¾Áž'T`¿EVÑÊÝJýå_§Èü·-]ÜoUF¯Â®)ÕŠœTÚ™®Ž\Td4..,}w…ÁÀ`ràñžFIrÀC@ ;ñ5]9o^´^»ÙkÊ`rY=^™¾j û²ÅÿꋲoEÝžÞDúö£IZjáE\P¢ž…›²þsM—N_˜Œ¯ŸVŠª"×õ‰hÏ[x}'¯P÷/Zv1õ!HÙ*îïù&ûóŸ)òbs½³Ö¦Ï¨Œw²K¡œŸ”;~Nf¡¯åЭ²³ —o]ºÞµ*9ø’ÅWµ’“_‹-"þø¿Ä¿Š<~Ç·ò& ‹Ë²x¿LßEù¨TÏÔ¿V“u!„Œ'ñíq‰ëMAû"¦T0ÎÛjz¯¥ÖPœÂs×"³· Ïœ)$Êû•„±Æ‚}ÙxŒ¢Kô`¿+ŒD§ïß$™¶-)6ÛÃ$ÃÏvØ"¤úÀ,}KV“‘ÚÏÔµä>2®¸÷r$m£½Žµ¶»ßÚÄ[:w.Ÿ¿,Ëü8Zf/;æëÁà’Á[£Á7Ù¡_µh,„“hQ¸"§§ 4|\Ö*†ý0"æ*ïd£u»ðÿ¡¸kíñg…Úm‚Чè[þ“|¢[}Ey×Ǿ?øæýýóÈý‹o59ê;EûÍ'­Ìâ#Ú|Ñ~ñ­n,Ú?Ñö¹Q}iÑŽ¾ÄPX)œ¯¤w¨<ÀàK ’Ñùk“ïfÿkï,­endstream endobj 80 0 obj 4154 endobj 84 0 obj <> stream xœíkoTǵŸ·ù+õCw{¹óž©TU „Š@§­ÔT‰±mÅ^¶ô×÷œyž¹wîú…ÓP¡(뻳sgΜ÷kx3ï;6ïñ¿øwçxvï¹™ïŸÎúù7ðÿþìÍŒù óøgçxþÕLâF:×;6ßz5 o³9Sªcz®븜oÏþµx»\‰ÅÃåŠõÒtÎ-VË•âýBà0Ç]ß3¶x¹\q˜b­^æÁ3˜ß;x6‹Wyð¨Ì<ɃÛeð,–ÁuÜ÷k.^ç“ÖÎëÆzÿÞú댉N)gç[g[w⌨qX~’̧ºÿQȶӂâ8¾.ƒGyp¯ ¾Ç•lç¬!çÙníù6V§øî£ÐætŠ•ì»Þöl¾âf¾µ uá¾ãÒõL-¶ðû~ÀvŠ9xW,^à÷»eÒ÷áàÛ8Œl²Ø-sÿ¢÷¯Z‡|›Ëàö¥q´ÛBÇiD‡“d¥rrz”ukѳò{y§%ç-˜ ÌMjí·HtT`Þ*£_—ǧáQ »x^F¿«4@m¿T`‘-Ò çÈ BëÎpP³ž NËÏ]~É3Œ®Sz¾B5¥{¦ßGšðc+ŸïE{š8ÔSG ¥Bø¯™Ö„a›ÈÏÜ˃°´ÚoQÞ9hRý´Eõã­ÞµV²'yµÉÙ{‘!˜¼– dìPÖÙ„ é,lÉ)1÷ÆàÇ; ¿*p7’ÑoØ[ý 3¼F8‹ŠÄá"i<§Äl*­tFázHÖO¯¿žØsÓFkŠ\é@»[E€#¦í´E¥ýÖÌúÀ4›Må@a4(ø¶ˆ3AþÉh!¦=Ü׃H޹—´vÔ[/3ÁÏý3ºDÒ qá{Ï™¥îÚŠƒœ3çæ+¡;†^Ix­`,ë=o¨NJÝãy$<1ÎÃJµãÇy°NQ+eűNçÈD-Hëlzy{©¼†„ݤSþ¬„æÆ}gP»Åw=vÞgl´mW2<¢t &):8‰K¿. !„@2Ù P²Üõ‹jm´ŒˆâB ¢³ÖAÆâ{†Ž**Ç+"ï8î9_ÈÖeÉÃ%ïŒ1ÂÏX×À¡FêUǹl`Sô¼“JP·—ÂKGNâ Eœoa&×鵿×h^~ã&ˆRƒj§^ÜŸ,9¸|ñæù L8ƒSÒ«3ç`9ºBä>ÃlÜ«g@&)Òiëò"b'¯è #¾ c|C)V<í 6»H è(T° àˆ‚‹æ^’­MjB¢RCÙAÏôÆ1ñg“$Lu\˜ %—~·B7Ü‚4oQ³« sFXï¡R`âLX—.N% œVzO__qŠ/½C0jò.®ô²Ì>*`âBíå’X¼ôøÀ EdJ,nœ.g&àì‡uƒõj2cÀ¥²0ê}2ÊX²¢…"³"à‘K¸aeñ%@½y;.¥Üš=›½™£ÔûôÄ xÏu§í\jíÿîϾz4»÷è»ùÙÛó½Ù½ÌÙìÞ·øñÕßîßGæ¿›=|4vÅL5ì8nÓñiú•ÅõùPYì6ìÜý:° >€ý åóWq·åC½Ýè‚€zêQGF:¬jQ-e^$ F(֞ř$‰¨ƒ`##Ëå‡ U€ìбss *-¤õ9JêùFë½nظ.™Å篘•>°ã*æŸq?"Û§D„3ªŸ§?.;¹žG¶kíŒÞ®ÅR½85ÑHvã‰Þöâ7½!R½•Ìù7Þ¹M…wT+§z+à©mÄavâsª…OjÛÀû9=ËL³ÎÁq=Ù‡¥')^%Ký°¨bÝqèVâ¯ÓöÌÄwUfGjå=Ò;yðUK “H½„ªw[Ù"¢Ä‡y×ÁFëÖšäõw­Ý-ù©(4…äwÈûÁ)w‹“,ñB?N$ÑtZæþ°¬y$.úë2ÉNf’£O‰I¦Z”6k4݃£ÈäwÏ%`ä9‰½¯Í£ä‚`ªÁN•0è°€†9i‰÷‰MÑ£kBH‘ž{—q}xbU—¢_ZBÖ´<ÒÆX0ÈÊ›ãW¸Fšª6Ô)| ^©q.¤Púª!ÈÆé}ïc¡:²ÈDT͈;‘VT®ò„ë;Dé„¿Ïɶd'rŠ*NSÎ4©8Ë:Æ0Œ‡4Ú`Ò—Á¦ÖŠ”øÁØúnÊp‡KÅai¯n¹Òåaú€,võ‘¦AÓ1õ˜ªè EªZ;¦jp„uø{"*°Ì©2‘¨@½+À¢–ôCˆu4)!Q½ ã¥ý%ñ÷~Y ÿd§!%M`­*ZtœM„ùójð¢ é­'¨þ¾Ä.c¾ž¤ï±7ács’œû9BN31"æÎón Ñ,çJe¦Üµ'\+«¤ŒÏ*M±°PP©®,ÁÉÏWº+,´òòr1ÔàEËcZµ Í*‘º ¡'RXÍ4¦’D ·ËJŠê}XF—ÇåñEU e6et "dÙr†$òpÆIp+™ 4Ε$CL*5'Qsc-/„ö4iIÍ¥TéèJ—ÙC`†sÚš¤}.“­(š­døÆÔ‹Z"t|ŽÅ>Çb¿áX¬ö¦K­¸ÞÞ¯×ô¨N+z0 àzзäR'G·ªºŽ+{ ®{’õšEå·­8¯ªòޱãêÜYdùÄ)uÁ˜8þ«0†iººÜ0‰(8T•tJ”ö¢£>Hp&1|^÷dÆ‘”8ƒŽ…Rû¬_øJàmžÚ@F´è^VŠØs™1ÙÈAÂLÿd¯ ÑÙ›Ø ¼ÜTT5}ôŠ zCUu(&ñk«|e¤njV¼LÎŒ‡æ–VÙX TB8j¾ ÚQ· !ÚaäiX\&¦&Œ´¿Ä¾fE•Yq«°)¹Ö‡©å‰¬N¨Ù®ÁXZrQw7$\À°i’ÑÜÉžùiò̳×u$êD“í¥N¨9¨MæyÃØì`{D˰SÎâ*—l” íTªuHbHy?ŸêË*ÏIJ°¤…ŸLÌýÜBb%YBô£5ëBc`ÂF¥áäŽf©sÆzuÕnëàPå5je>.Íò÷ :j6òª/Ê#}²9¯J˜©êƒäŽù~GÒìE¾v’’ºU£Åkì†X•Ü·2Ž:S³mj-í+[^kiÙìrt}agLn’÷O–¹¬&hPeŽø@ƒÞÃB߬H¼ýsmU˜×7ªå3ø=mÍjØ,Úkª zÅEФ-g8d#×ð3¡Ë)ñä.îe(ÿQVryJ“çDk\¬îÇ}HûþŒWA0ºÓÊ;SÌãÊð £y’ÌÉ¡D ‘ÒWV&×”¡’4êÉ8xöfUÕ7xè+]Õ;àÀöèœo¼/ÿ‹jõåå• õ¡â’÷³ (ÞÙyiíÜ­œ9W@‰¤c[…WV"]¨yŸAÿô œƒErm‡5РP;Ôj†xˆøugè%V! a@B°?aç®õÖ`ÛkŒÅO‰w`É?âX0WÓ^e_Ò¤ˆGkw £e×V:oH=ì¼ÅwS±Š`ÁëT¦"! 8–ƒÈbõ&ïD4ú“ÁŠ$ûÐRQeIÂéžuŒíŒN¬Ó ÝjGÔØÈy¡I€Ð#äý©¥†<Ä–S÷ŒXÀFg3¥ÔË<Xñrÿ”Ùÿ/H?v×Jä# p œè+¦ âÆÁù ˆ«eÄ_€Iß”ÞÒP•Y4¸»ÞóëHðseÁà4QÚ†Õ|iC? à ¦à¡ »nìãoAé¶&<ÕZylõkmvÆLúšyáTlt§å"#t¬íúìãec}ú6µ9ã…|·Á:™µ‹ Y¬xwGõ!C(Ó‹YÆo…e N£ÀQÌð‡ ô.äûÒÝrå°ý‹Ç& *„ø¨±é[ûF)Œ«ÜØÞë¦;-ŠÅ+HÊæ<òê™[\q2{ZÕ“€/êig#Þ(ºÔe¼î„žÉ ÄÂ_ÛäPà¹AJ ‰¼ŠýCô¦°tj]è.†l3^8c|sÔRˆÏ¦&æ#~QF‰} «q²K*rÁB’pºï+üã&¿ªÌ®woè\®lWç|¤WnL.ÚÀR¾{‚Nº iÎ_–ð¯Ñ`-SyÛ¬5tMÈŒãvôÍÍDä†ôÒ½o?¼0ùÁñæ ç>ž–Xüqœ¼(#zãÛª˜ü6/ÊÓ¸ *\”yÒxëb€¹Õa¥[´>`—ü}+gTIÏÊ`™Yò"Í®CS’!1Ö÷Œ¨•¯ªP¦Íe½ÅÖ%`iFKûA”œ›Ð81K›ŽlIzL››4|}u~5·1æGyg‡õ¢xvi~„ Ñt£`gð2gð0†yIâBV÷R³“·µ´w ¹íií©~Ù§¥7àB»!˜EÈßì%ÀùЛ»DÞ7šN” S{™ûy¡Â颣^Û܆æÖéùðn(šLü¼*"/1ûQœ‘õå€Å+3æ{W•¥ñáäð²FS ÒieÀ/ZõíÊÕ\×,NU[ÊAßdHóá?&Ñõ.=Æ“WítW_#m׈®’zó÷ØÕ­&ª`TV—²š0Od Òíü¡^h™EwÁÝÐrǬ7„½a¼Å£»õòfìF¦‰`TodÁ´G0ùŒ¡¬’¼r¥ÆZÊsdëzÓÓädlަ[IÝ *—¾ŽúºéGcU¢*;T¹ 3aiÊfú`½²»‡Dgm¸ºÊxf亟hs3WÝPÜÔâÏu_jJ•’øõ¿wô?WÓ›,Çz‰š;¡ðÏmqp4¦‹°„åÿÉ•$$έ˜×oCÈÑ4ß>„0\÷užˆôƒ‰*„¿TVª#¶TlÜòQ笈2ÞUõlêŸáÝ›62ÔSë iŸ›õ?7ëbÍúþש:øÿӈܼðº®ì@$]Á׺K`þ_“[ŠƒNd.æ’ŽÛÄõ?yÑî9õº2†AÜ|€.r vlŠàzÅÿlö_¦ Ùendstream endobj 85 0 obj 4437 endobj 89 0 obj <> stream xœí]IsGröÖÀxB³k¯¶c¢VNˆ”DAaÙCÇ$ˆK Rœñ¯wfÖ–Ù]ýû PzèW]k®_f%^ƒ:ñ¿üÿŸ=ºÿ$?ÿÛÑxü%ü{~ôúHQƒãü¿Ÿ=~pôO†iœÔñÙ³£ô¶:Ö£¼=öN ÚŸýzôç“ËÍ©ÆQ©“ëÍ©¦)FrU>ßœ:=Âçpò‡úðMkùK}øª÷ð¼=|[~¼9µS„ÏñF£¿o-_Ö‡½^´‡0¦ã0ÅÀ^º/95Á/†ô·^§rIåã»ö1¿eMüõ–tñvƒ§i´œ¾¢SüG;uÉ åãÏíãuk{Ñmû±$d[O•œ›bðwÆýç1îý'*ryzªF3 Œlà`F•NäÉætâ4†wÒÖ*­a,3@7ZáPÚÉáAØÁ œ~…lâk&ÖôEkJl,îUyz¾q¬yþÍ1(‹¤bFk1Z„ΕaS¢=…™+wòÛÆè!„ ò×ÚX Ôò)ŒSN“a0Vóù·÷òXÖEö0M –t3EÖ7öÈväjBÑÙÀÆ$rÓ°C½\µÆyÏã°ÛPaSÝÆBŽXMN°R £Zb! HŠKR%– @ŠŽ‘ÚƒÖòá6úlÿ¥ÿì½ôùvFzØZ>î½nêCÝ£ùµy&y¡Ø@ŸöøèQ{øíV>:ù‘&Ï ëãÆ‰Oã31ábn³Þå”ÊÇG­í·âèÚ¤ŠKªUöãV=í å¨xüÝ*È/Zù•U0†&þv>ŽZŸ'ì<ÎïƒÏ†±QLµMó5ÓW+ØARnÑï…w¿KÆçm5b„‰scÇÄ÷–Âÿ5)l$f úAñ>cÓ¦=$âè÷ª¯Ò5°É¾ÎµQ–¦¾Mˆ™ýU¡Dõ /XpË(1€fI‘ØI§‰„Ô ê¯ ÝK„;Fü{ǵcÝ|µ.8òá°îª˜:߸žw6*–€?iøe»!oõ:4Ôf½…tá°ï»ª¶îòϨø-ŒMv‚#¸CØ1>;‚ë|^ÀeÍuEYã,µ‘?¢CëB›?ÎKÅŠf H ]M‡?ÐÎõB‡á¦ Œ15rSQvey»úd:ùE'9¹÷ …¹n„Á ý—ì””å8(¯¸¸gùI¨h=¯Si^S• t8Œv‰XLèÚì3u, Üñltµ“©˜·@êUFÖ >c Š ·N,LdùpeKÏ,WųsŽ#ù*_lÔ÷ …œ§ÉqkÁ0™aU¢¾Á^f> ›é‰/6ð! `˜×`â4Í#Ü@œQð«î0• „§‚>Q:}@@ÕjS8)z­5Hz? £lÓq6ecînö9í+ßšžýsžÃz¨.3Ó¥…ïÍžÈWµàá^Éod^xÔE¸ZK¦ò?âû8ؼlê kr‰m™³~‘ÉÅ "ú/\î¼CÈCá> ˜ žå8AKLÐêðu@-8OÚØÀhŸøçá_„èh€þDé²"ʘŸ˜Îlê·\7­íOmÔÝŒp J:B½pà Âð†¿ ´Á䛓Z¦Ö3cðHzt‡ë‹ vÑBÖ ÄãL ºÔŽžWµµ—H„#€W†ùt V°ZÔM=£"C”ÅEe},<ö¼â%^;#l"L-Dj'¤ÆÈhUø’VòýÇ"Êæ‹Œr/ͺÿzOH å'ÌkQ  ¬¶(à%-¯ƒ\Yùö"Ç,p—,7= A&èÇæXEzû‡÷û¾ ôU}ÈäÈ“ (.ìu4íLzÖ’£Âáü :«2“š_¨œ£ì ²CÇð¦Ì¼þ8›FšÓ3f’×¢N³–uѺó ÌÍŲ¥,%t”HiÚb03a$Y‰\»½Ð³dܤ¸Ça.Å~Ö$»lÝäV&’ÒwàLfc§ÏGD®#e z-¦÷‚¥\äáhÄU:6¡ËÂe»£ÑDVzSp20<$Šý#ó¾"žFjJ>Ä0Ó5ކËZÅR?Û`,Úƒ cÄúpG 6*—"Œ¼‘€`G´‰RX"\dÞ¤ ž/³p)ÙטN8jбæÐmÐ6X2ƒû=‡êXšäaÐý¨F§ßaXe>|¥î*ó ,Z¨C_iA>NÝ6Ü?,ý7Ϫ:…fÔ;zvF;󌛆 3.£¤Å]W ØE‡ ».¯6Œ™ÐûÁ‚Þ]¥>0ÏC.(ÖoB°íNgŠø×ÅJÒmr<ŠWúÍ6‹BQÜKžŽ`T‚s·eùqƒÙ†diÏ.}ÔŽ-Å$ÕdZn7»}ѱF¶å#r¶ì‚ßÝ o^‰³Ë-H`“k …êÊõ'Ì+‚§œ&£Æ¦«T‡Û+˜>9N{Ú+t½3lB$|°dÓ5ºY`pRb»~Ù§t¬NuW5ë¡Ý™’ªíïÙôÓfO·›îG>J@;:)hEY Šf½0ÎøŽ£ÓŠKö{9Z1 ÒI×–ðMa.Ý‘î 1ŸM‘c[¤¼ÀëŒ"n¤ßI¹ð—ú¡ä›Ð:âÁWÝÐìGJÒ¹mްfJuîÖÖB‹g$žÕ£ÀÃ3†’!waÅYؘ íÕÞ°qâPn*Oñº/!²t*ɱƒ¯Ö¸4 U5£¡a""©x”¬ËêÝœŠ|d½¤™HtÝ'±ˆx~?…¨õ<ó7ÓªïBȓй•p_CÛtúÐ+¥eñC¾Vl¢¨3¶9 Šç‹Y"eÇ%T}—H½©lŸ1lafÆtûVÖ±YFæòýVã±ÚÛ½øÎÖÀ¦ 3»¦ÉÜû· 0—·Ý¿È(ñ.! ‚îD—‹„¬Í©Š¯Ú_KÛe[>R‰ó 3¹qØ7’ô;Y—Ï7"í­Vu·DihÖùm&veè-ôYq,MKzc1_Ñ”Œw Q3L¶c€ìŸÍRÞ*²Æ®˜êEôSä¤d‹c¨~Æ4+‘ šMV$ÊDÏÀ–ï9/„"ãy+èWƒÇ>‰ŽR3â ØÊ„¿\·ƒË$*q°ä"[ðuÍ lï÷ ‚T-gf"<«Ú›q~5©ºCá+¬'ÐÊRéáû•ªK ð"6ßWLÄì˜Bþ+ùUv™aÜP*:"v<ù„’áoFLéÊ„ö{tŽß( ØÕÒhìA·–óóMÛf×ò Û‘vùJÀ®Y(6<òùZÍÈÌÖÇ%×Êå=æIÜŒçºw Ê ˆ1Êä,ÁŒ%Ó{œñ‹ã—׿Q Æs|ôdúD±s+›•‰]•ú-: /Q·“à]cÆjW+,B¤×­È…IÚû{hkVH²Üø¾I¦ÌéµÀ6£KkR†Ñfë–7×nhUMïÞ½ìm0f´â_Ah²0ŒjئLm²šy¿’ƒv‰õK#BTé߀‚}Aå›yºp`¹VCA0¿˜+ücús®/pÕrIº]¿j“`q$‰›k«jMÛæ_鉱¼Ëà[/YÍ?º¾å>ç”ò\ö`&ª—Z!% ãÖ_Ä»Ó"º8‹˜Š›ÇTNˆvV8NŠtÄÕ߈¸¸¥²Õr{w£vÊ6I,¼ñçÓ µ ™$®EóeÃë¼j<Ðȱ» nnsxä?¨nH)4sðê¿hT›•¼nž¿¡ÓwïÔwî4,ì™×г"/䋺iúr©W@þ7–LÃ"Õ¥àrË;'Xê…è-RìáÀ×Í?ìÙmp­ÇXYb :.R¡¶u»Ð¥¿ä²‡sš·aþ÷ŸVd»T¥šn09ÛEß¹=^" tœ¦ùæÐI Ì*ûõ(ü¢]Äžz&YîX¯Äò™¥…Ä„Ì,oä/ ™mz¹èm|ÿ´äK’;+÷tja‡YVéAÙmœçPxyÌLN>;H¿‘'†^-Ùà„Õôó\o¯ÒdÕY§;·‡æ"|a¬*ÕÊ >nv'ûó ?6¼‹ýY„ïÛG½î²£«J£9+=5QÊ+Jç:ä”kJIÇ:§Ûw‹Æ<}Ã3ÒÊÓ–EYÊÁè-µ×òU’.‰ ´'PÉ«ý¹¤ùkˆm÷ñõšìI—7Ìj‰ÃzÕá0W»%hÌK:³Þ.{ !›*>RQëïŽþ†/Y¹endstream endobj 90 0 obj 6091 endobj 94 0 obj <> stream xœíÛn·±Ï§ýˆóÃZ/oK²E_’‹hyhŠ@¾%Dzìº_ß^‡ÜÙs“åÔ…ähÍåò2÷Îð—õ8ˆõˆÿ¥¿_­ü`×ϯWãúÏðÿóÕ/+:¬ÓŸÇ¯Ö_ŸA'é¡eð£ë³g«øµX»iÐëɈAêõÙ«Õ?O~Þœªò#ï›Â¿‡q¢}½ü³oç¶™Ž›ÙÁƒ¶ýp©£ÕâÖíàÕÿô„ÿ:ûËJz98@çÙ“ˆÀÛÍÌcµríH·íгzsÜH¸ñÓ¸óS¡c¼‹x‰Ôt‰?o7§Fxè.Ožá¿_¦FurÝÒ^ý_œ<ÅŸ7¥sÙcüçþ\àÏO'øû¬¼~Yÿ¶4^×F¶çEi„iµÑÃ(¦“{¥ñYíùº4¾­oJã}ØíèNa?±ñ²YR„† ûˆï¯¸…nJã«Úfr€;KFzQߟ—FX‘cXÓ=nõL%+9 “Τüºv|ÚÌ®=PŽÇÉsc;{¦›vz2)ÁHî{ÕÀ4?¶»N}#é 9Œ:ÒÞ4ÊJ{,àGOpÍàœk¼©•dÚäǰ!ô0ýjNØ5Ó%…`~E6>§ÿën"Ü’Ù걯Дêç €} ü>4ðíûÞïdÒÖ™þ÷8ÂÆÁ¨åËŠlí‘hÜNÜžÀ~:•vÂû£YðIa¼‹òô¶<}QCÇ3ß!˜ŸóaK™?<øA8jaŸ*€‚•@zp* 懛S18çÁê•`i £ Þv’} BJ©”Ò@6h+€¸4@Ê>°Þ$DÃxõË‹¬µŠ4½Ý(˜v’½ÒÁl%I~£–¯nê˜ÚÓd'—‹­;Ú¸§o쓇÷&ÓìqV«4š“Gu„n…Ré“!5EXvÞÊdaœŒŽÛ‘ ‡+e(J<‡Å–½Û¨ð$ÈZÎ 5Ùâ Š Ðu[Ü œ ¦Ë uˆÒ„]/#¤øOä@k‘`ÒhS¤9­p¯:áu­ÞèŒWìœðª@ÏfÌ)Iƽª8|T7·•ñŽƒ^ÖAgT<ŠLÄVÐU—·‰z¶£F‘rÊw6U¢xe 4Eñ¹ ¬Å½zšùý{¤ëÄXpˆ<É2" b2O¿E|xoüÉïjk`u†8[Aü?ˆ13"RÖ~Œ7!3](`F­Ä"-Æ%¹½Ø„+*-¢’š4 Ä„ÏpÙe‘ºmgDˆ(pG 6ã3‚lÍßm• ªáÛ·œfúP%6ëO°ò`MÆ=ßJç-Õök’¬ñº ÎÓH 1ÕæžÆÂŠ,rÄLB!Rñ·(#"ãnƒ¿ƒò¾óöÖ ÎN ÚwBÔ‚‹tB{t Ò$v|’>‘v¨*ŠÓúVdXŸåDfUÒ?’m&(4µ¤0‰ó­÷gn$Ò wµÈeq“.ÌV6pQ©XLr“J?ÈÑPå‡0‘‰Ø¬HBÚF~€àŽó4‚25`¦:â\h5´t[M{©Ê£R[dóIÂy‘®<«) ™*"2zÕÊÌ4JÀ®Q{qÚS«1ÒÎqkUŠ'éä`„Çœh/òéu…[•ñ½ô2ãè6I` Hhã—”BšŽQ²äàwßž­¾_ý²кº=Å9J˜Ä­Í¨=þ}üjõõÃÕƒ‡[¿}sótõàǵX=ø¾þû7ðçáŸÖ¿Y}ûpýýQb Ö!Ì‚“„0qµÁÞ4Bu›+ÕÊ\~CfŸ>Á†4 ]6;b½GÄ?Ÿo“ÔjðDPCR¹éi«ÑŒ—œ 6§^¡]äNÎÄß ?9—¯.jÙ¯òÜd3í“}q©ÞX(_ÁbËŽì ”"áZÖLÌë-‹9ÖŒD æÑ ± A”)á5r«ðâVôº.¸vld‹ðèªu²åPýÈÀø>T ¶`9™ž[¤8ÖTƒ%„Ú(Añ~Õ‚ya0r1æØÅÜö[4. ï/7=¢±ƒâEêÎ 4¦´¢˜²“ æÄ¡1sX°¦ ¾Š«Ä€ØñäŸLhÌYÆ”I¬ê5˜o»ÌÔÔxˆ•J‘v¨•ªÝ(îÄPíMçÖ´ÈôÒ½IrBJax_x ð‰WÆH¢âæœú£ŸLDÍI[3qÆ8bxŸƒRÁ:ìÜÒ;S:çc–EbTÑ%§S)iœ5ÖSÔŸGª<ß,ë6/ P!Bû×ÕÙ½/'¼´ã—Þý[oÝõcžÖVņ$g÷¢˜l48^<&">™."NzÖ£ƒÂäùØâcFîÛƒF½á–SÇ{ÍÍÜ­6PÌœ}ɪј »ó„òããJ>mø–é{SûÎbË9”Õƒ—ÌAlGV‰fn Y5qät–rYº´F\‰Ž4Žñ‹º3ž-An\’›ÌÓÎ%ÝÁ©×ɶ}H7x´LÚ³oª±‹úôuT£60°«J…“BPއÙÙJOAç§ð P+ÕôW1$¥Ð:™|q≫a-Vžì"USÐËßmAû“?Ájá3ú8–‡R­ª#¶:»ñj³hYw–(†‰ý¡îgdÕóØ'/æž'9Ô~þ^â‚O%3ÜTü½™QÅ…#´ó¦%ƪhj Þg#Žqâ>޽q¥ÃÈÃüGÄ8rì)ÿ½"D›t§ÄéÚi)Ý]Éöü¼\ ‰6D¯#éþ¸ñ!ÚìØõ¦œ/dÓYʬ”æsGÃyžbYÒ×·VP‘X<=ôK§ö5žópiÑÐešÃ¨ƒƒþá;åM(M{æ“5ꪻ+#ÔQö”(€‹Ä#þ˜…d@Æ"Ïç/´ÛÒ9”´*£)•ˆèmŽ3¯BR¥³†|ÎÖ#ø&1ôHé}Íö%p~¿fjª¶f¶žj)\q+úoMÙÀ\|ôØàøP=Âf_Ó”±‘ÒÄB $5šX@(I[S¬W²ž¹ÖÊ–4O…”Z^–˜[÷­ÞKÃ6¼3~¨s ,mÏçY;3ñšÔÅWeMÜ™Á¶áׄ<Ú³Lm)öÈ9}©ìmòA²$Q“Å\ÿ›[›óJ°èh¥.æ•RdHÁÂÎ ')±2ïimBË[éEÖèj±^p'뀇鉔þ¢„ j2猇`WÅ%S£>“ØÈkDeTH(;ïI%K ž€’~ާû¢0$:ÄÊ0çÒŒUPÏ¥ÛäržÞ2vŸÏÞ© º‹ SHœÏ¾)EÐ/Éh*DZÊ:ùັʪ”úÊ×ɉš}¡vi=šYO‘?ÉV‰òõ†^êÐ+›šCBòsÇ‘†œˆ×#¦qèV¨û@›|ÚTÍ•š—1ZMŠŽÊ>lœ°øíòKÇQW-›µØ›lA÷¾(_ðÆJP¿ýz„‹bÎËhxö åó8 ú|Æ,&X&s뛑‡:ØÇ¦ÐD6˜j|MpÙÛãM¸,B‡ å)ê^\LêbÀq¶3#ãySíÝ–ÊéS½–ï„È€æRŽ:¥@ù/àÏÒE\¥:}ä·Â‰3áškË%ꎞMHU‚юsj¸ºÂ!˜Q9‚H¥‡haú1T‘q)Z4QHz²_´º¼tAÑ;JR{> stream xœÍio·ñ»¡oy/ðÛ,%w hÒMa$­-£(š"¥X"ë)–ÕÄýõ^Cîì;"·h‚(ûvy ‡sÏ?Ÿö:íñßøÿ‹7'Ÿ>ó§W÷'ýé×ðßÕÉÏ'ŠœÆÿ]¼9ýü ©ÞtS?©Ó³W'¡·:]gOÝ :mOÏÞœücu·Þ µÃ Vçëaõv½±1ƒéç›õFwÎygW?®-´SZ¯Þ­M7ŽN+öûÓ™auݮ׺óÞ›Õ¿Ö†žxÓ{lÚwÃ0²‘^0ì4@ËÕ¾OÂeù]ïœvÒqdm,ެ°ß8Ð$ýØ Ö¬¶0È+œSuð_œÓÓΩL7¸au»ÖúõfõP¾ß¤Ý`áÓ&!¿æåþºÞôÖÆOŽ…}´ƒ>ð1ØÎ;°›G}à¤nO ›;ÝOSþŽ«y‡@ØNéåÅG˜ïŸg>1=‚C8»„-_ž:#!¬hlœa v€ìUÛ†ýÜ¿Î}:x«M§•Y­7¦ó£V6Áª‰,✊Í¿{52@âŽk7"%!%¬~)£²ø fDÈ&adƒsÁÄÄ\o Í 5…Pó^ßVˆ3=¤ ‹ s-§´O#9ÇGR3#2éȽÈO¤Z2¯—8$ k0ŒZ^ äó«@:œ~ó×ôj&ðeäÏæÁõjÎëør&é{pÐz{e÷óé‰ïŽa¡ÙÞù¹Õ·kÕMÓh'öùâ=©Îî`’e»†Î Mt$3?MÕ2â+wÞÌÚ!®qíò{K x(´^hu[D¯QžÚ•eª‹Ä†€jXkï¹ØÄq/9»Åå3ñCÂñƒëu@E$QïiËÌ4Ëtklg•]DgÒ}…ïJ§½D¬+ ưy$®#ô ì|Ç÷ ‘Ûí‚e$Ò<v^74'ïÉe}鯹¡Õ[øˆÔc5ÁôR‚ç}V˜q^6†¡nÍ´(ô‚YàhŒ)ØBã£W®7ñ‚õSâ…w8©ë”2\eÔü;÷f³Guk¬µ ²TO;3p©ÏÈÛ>ÊDÛ¥Wf= ÿ4ö~ìmœ$ £Öy@£ž›ø±š’´¿‚~‰.ëF]EoD“—l$Ôð“¡6®þXÌWk|òί¾Aœ“–>+ߟ—BøÇ¬¾Ck4­©„Õu‘ŸÌ€ñ= R¶£ R¶¬ÀåÕLOF@,‘¶h¤àw¯’è„k´LŠy‰¤í°È˜Ïô‚›íGR}/³vy_øû~úLOÜPös`ë7ôÆèžôxÁÚòÛóYx sÔÆ¸™Ü2Ç+l ¦ž ôƒté\œðq»9¸¶ÓcÚÖ&¡ýP zYbgöÂm¡ùÊtÐcƒ±—5€¯D/¡±¸õㆊ±È-üót皀ú´Ÿ|ñ dp'Š (Äì1æbp{ÉÑÿ:’ ¸ƒ• U¹8ÑÏû"ü‡Œ!ݨž0üJïuáAn°ãgíÝê§ÀÈ-+ä‰Á*d†(· Þ`cL¢½þ£èF‰%åÌ,M¤ì}ut «èý’ël\ú •—·­XAŽ@SEÒpœ±žL#øÎ4ØL‹GÛ*C‚ÇïMÜ`A‹#Rú~\¶§¢‰²(M‚o g’ÅJ»HL=t®1¼ƒÄ÷d1 @?ßã´f H‰m,0Ÿš²÷¡\IÜ!ÏÍ6ÁHwÁ5bدíêøËu£úe*-¥Æà6&srôÌ9ö*Î[ì(Qâ `m%’Ðú¶ˆ¦·’l{Ÿ^ŠrvÜLyÔJ³aHÄ{¡f±¤Êý æNã£0C}5%GÉ>ã‚QtÛrw_{ˆ¾q$"U§ú™_;Œä×.Øü,þ¢b¡‘Ÿ‘LÇèWVE0Kb¦$oc1‚h³˜Q¥ Cl+"PnJ.ÏE„HñÑ$žìã PfîˆéEsùXãÆŽv›/‘Þí †ÚàÌ`sÑPy'v—‚±n¡]â–n½•Büìtâ]k'ó@KzÚ®ÍBXæ¶ yEÞWöaÔdЖ5=(DX1£ízºy&Øaaµ$¯]C¦±×“@¨€¯ g4¼æAú ó¢šÒµ†ÍˆtRQ©ê ìËÝÝË" –Mƒ}úñ ÿ­ Pô¶ŸD!=¢ŸäR’Çïv¿|_^Þå—?î’á@îýØgòw;¶rhÇotX>Ô‰¹!ñêYžöüù-þùvÌÉŽlÍ ¯âŸs9ÑSˆ’"¦˜§WJžØèµä¼•^^HØù‘÷!M!Œ{nbÌuáuyY—«Ø½÷ ÍÛÒòZr(*8æÝó]ÊÚáéÉÙ'ǟ㟿'D‡N_ÂHÀ&ˆYôWD‰p•?àú)…0dþŒX)ÃA{ý'üó]nú,‚"cÚ„2{ÙÒ}Ô;•¶õGM†ãELèô]"Al’hî7`æ^Â̰Ú?#?e: )×ñóëÏ…‘ÎE»É¶šüiÚ6ù×eòƒ—ŠÎ眊Ç$ê[˜¸ý€ï‡‡3âïMæ¥$W+6æ;vÃ_í”ó ÎË ÒÚ£ý†].¡–cðþ•Ìg ×£·’w´uÞ¢X á:&Ö¾Èûö"·ÿ—_HñœóÖ’bú*rz˜F”ÝWÛ)˜ªm¨y"c±€™Ûól ÏÈP†;—ˆà!÷éqöÜÚ=\‡—`Ü'»ƒ~#8´Åpy¬OÂj̨É,ÏnC7}æWÉU-'¢ŽeܶUؾuÆx~žÄ€ó`yjöuÞ÷)(žíVfcF‹UœSúvRdßo)xÆìOp$¢3Z ÷쌊°/ø‘uL¤H¤+£'•åQÓ2lðÄÎEÒÆÌf\†!ùkLO…$U–MÏC‰šØAñ¥”e }â"½Ó—KuÊá³u ÷; €÷X1RÒýàÄØègÏTúbæ,ŽƒaP„-‘t)ú› …Aj"Wª) 2[§W¬fi‘°ÃŽˆsúŽ*¢@”÷!™×èêuP83à‘+؆’-Æ2mƒô6UÜŒ`…¹Ð‰ËÄý’ä í½å$ÝóòxVÒÏÊÛoÊ#Ë&|Û.h_ibky@ŠQPCIÈb)ʘàíO0Îr«”N°Š:9=P™ ˆÁt1‚9€×U_9ÛRX›Í{'ðÁ9EÐv±MpôÓf3f $·Ñ^Qö?IMïiË—t¢ƒÀ³˜0f’{)— AîÛº´ê †Ã=ì¢ G,( OîËSŠiÆ´®É¤s`¼¢TLì«Ã@ÁóÐT ’¦…SîµÉ]kEÄX[ôc§´È_Ìx 9ñå_* yw Ò²PøOMõg¯*áRÚWtˆ”À –žT%fýÓ&Kx ‘žBÀÉòé±T’ç;~eù·–‰ yÅÀ[â,4q1Pm7‹e&L3IY½ªJ0ä-YN˜•œF7O×#I”°¯«X=/×óÖ2›§L!ë³—3&KÖGÃSP3EWÊ IcÖu0òúf¹©å2ªëÀy@Ó½eu–ÜC®D?/•oÅ„ä¢äŠE—µ~¨«“Ê[ÅÚ¾d )äáÅ*¨4mV/ÿ9´qÝŽM'ÍŒñÂÄnÕq©¡·êÑ ÉMëÍÿõ„Á+Ô]¶õ=³¼ É­FzlSœ(¶¼‹5ð¸œZy¦i¸PÓ¦C€÷:©=–%ù!ëÃs ˜ž.rょ·9ûKîê%}~%åÑXnî~wË›L¶T;;°€¢˜ËcƒÜIÓ• Ý“C%Yâý÷奨²!‡À`d1ù œ2ÞŸ9kËNsp¸‰ÞxZ´ŽÃ&zÓ® 4Kø•§*~-mï*$¥Ç'5m©i˜y-r®$™a¸¸—p+æ½$ò@Õ[Ò*ð=s`Ž$ó‹lÞäŸùgS±Fdþ6Sø% ±Wîƒ8ãþX}ÊÂÁa2§Ðv¢°ß† "uR¢‰Ôo*JüIJ¶M;ÒnÍQ ? Æ Ä­{‡ÑÁ¶öxô]Tð–¼Ö|7ù¿áØy}…Ów š­´o*¤¤úçÊÛͶEæN»B†õr@fXphfÍ«U¤(#³Y|‚¢z±ô®.= î«]é¹H‘‰W> Eý)¬ü¾íz¨ƒ0 ;+­ê\LSÎ4,DÚ˜GUJb¹ký,ñ‹|Ø“e4hB¬½â Seù¾PÃqלobÜÞ—¢‡{žÏ—“ìóû5¹oÆç““ÙåEyò\¬Í Úä`Nóƪó’´9:á†|nÀ§I¸Á· (Ö€ÒóZñ|£Q>GF²Ö{†1ˆqê}¡}_¹âb^¯:K–X§$ºRÅaŠÂ`ôÃŽi¹Õ‰²ËÚ¿›wdyp6 ¼?:oÖïˆ2Ö¹h]Ý<ñÝNJñ2œ åK cMcƒ/3‡Cþ£eNŒ‡Sã±y15P…J¤z:ñ=˜cù6%À²·uP¢I Æ3ëØHß³‹é3Æ‚³ØY¯x„m!Ã9I]:Ã+Õ`£©5…"ãêxÊmÄ‚›Ÿe­T‰Šð0~Z/ò6¨î€™Vuó¬ížÈËcò3”RrÉVk–@jj°Ï×Õ94FkG¤¬–š…œ†q›?[èðÀF¤–³çëåÀ7ÍâT;éyýSÒ7Œ]+Z GQ^£QË×ùXJ1 EU4;µ×ËzðÒÎí~­ãß;"kœIfõ¡d» À©£Î1Ôh‹!Á8Y¼æAÏK² AÆ`š1‹Á´¤œÒßË»>U\•hD6^ºkÀ‚ ‡¨M ýžc$¯3946·qC¸aIÊ…qëÃ@r‰Ú® ä•š…¯0«²Ý{~¹Y(‘×nbh Ij.òyLºD%m›RxM•йã©WÛ{ªˆª<íš8Ý&ñíM½~ÑBª7ð Ãð1d–YËo"AìšrH¨±û™'Þ²ô•è{X¾ï!\Û©œçtæ Ì…Š œÏ¬„ÁL•­±/þ½dB`‰Šmùd»¦«rúÚÜ~† ˜àÓêE¾5äËPábÅ“@‡ÇQ5“ªJÓE>x*Xñ~?3ÙÚ¬‹Ý$ƒ]=?+ÁVïfŒAœ¼¹¦$’VŠGýåkz¤k€*ža'm.Ë>Ú*ŠÖ[ ôù… U±$¿‘EGǼ!ãB¼ 5O+.=ã®Pq+ZúÒµ”ñž‚B­‹Záe(>DŽ>J–Æ<êŒ#­U-kƒE‡êÚ2 DïøuVûõ\¯IÏq¯N %4䧦 µ)K(ÑÕíXŒ¶ïJ{f&iÎëDê¿JÎãš—’“Õ‰óÿlŽ7pI¹PqØâ ¶È–ŠF ¿/bV²£ [`‰´üá1¶ˆà!>I‘åCÈäø{Ϊž­“<}=[,]f7»ñÏX„[‰-6rÂ.ø¹Rè1w« å’ ÔªŠ;mèy»·Uïúr¥`¨Vc7,YD!µE56{ s^Í-øŠéu“زZù…‡É%Ð*ž.UÞ-ToÍ`X(†I!¦¹¾DƤîx%‹êˆ}. bN¢Èç¹È’)ù(ÙV·P ý=r'?Öt‘Ý/MÆ1ë5?NZ&/ .ÀÐé0û£v7†ž¹°O’Ïa¸@g<‘[¦Z°IUœº,ÜÄFG€Qă˕òIÚæ¼¨òsË?PÌd¼+/£›€¨¨köÅËJš¢úR½ëÚÏ(Ȱ>ÒNä -UÇÚ—æÒ:E\X¸” M©ªæºVøx5H<Íî[ûocNç/öýñÜ0Ù¯>^‡ýêËF…SâmŒïrå~[}cäUîÎÎKªO§N¦¶$ÓF¢¬¡Ò„ؤ¨}~¿¾-óWîK]éæ1Íåºú1Ä8fQ´™Lfýö\‹ËÏvPòcไǙb’Mªj—øNOŠš²]\y¨:ƒ(‘sfLîJLJD`ŒÊ‰ÀqÌÌX]e–€:ÖI‹¡ =Íú“pÏÑUçá¢TU›âu>OHo¼Æ®±ß™Õ_ÝôOV´ÆûC>FMs¸‘tŒTÑnó92æ0ç›”¦Ú©‹5‚{ÊÜ™{À.™zD•¯`hð»@3¢"ƒ ,¹lãºà%}yvòWø÷?¬=XBendstream endobj 100 0 obj 5192 endobj 104 0 obj <> stream xœÍ\{sG±ço‘¡">‡Xë÷,Eî… G¦È-®"ɲ‰Ž,¿ øîLϳ{¶÷œ#•ÊñjwvýüuOÏ~·?b„ÿò¿Ç{÷ºý³ç{ãþgáÿ³½ïöDl°Ÿÿ9¾Øÿä04’S¸3Lã$ö亮ž·ƒÞ·F Rï^ìýyõp} VWðój}`Ä4L“\}ŸÂÏy¹ÆQˆÕ1üy?Oë{—ë=¹aònuþ~ ?Ïà纾ûzždÃ{»H¯ÚÍËzµüI¹ù‡¿Þnv”ûB ÆL~ÿð$¬ã¸ÎçEžTîæ&jÆ)Üp«ÿ —*fR«qú°:½2ôß4rŒoZoþ¾µüC½ù»vó°Þüª ~Ì-ù¼Þ|Ñn^Ô›—åu³zÙž‘÷áR+;8­—‘hV@´ÃßîþøÏ‰ßE¥Á¾^e)=<‚G?®?2ÏC˜ÕG†š5*=­¡½òôÓHÀ•¨Ç6Ïa}`å¤Ã_·`ãÔá&Ryá¤Èqœ\™ç­(„ñÝH\Ò…U^@$&H ÐF%êåUünü½½0ëá§­‡ƒº"Ñ&1vL&êÕêÝ•®tê;ÝÄáÚ®>®7?nMi¯ÂXnoãáIãáŽ#ÍdÜi-·±¹õtÄ’“vóN“I4è³뀡×,ÇoÚåÛöy¯wZ7½;£öóqãÓjloªíª™˜)¬Æ©{e.Ç7ѯ›º"f%³÷3ŽW„gYf¹Ñ/Ș…i+:òÍN ×Ëå\Ï íùú&è{]‰wv+úþ~šÉ}S·¾ŠÃ›Ë×À‰/ZÝY½ùªˆn 2ïÈRVãž®•9+¶=ªÐ¥ù¢n:iïÌâc¶í9ÇåbV±@E$4„1Ô«×ù*i;çf"Nˆ¨”õ6ʽ&zßÈÉúÔ$´èÉÃmLëñ€ M›ŽŠÝî™\._·×nÚk·¤ù˜ÉD²aåj^òEU˜£Ê‡«¬e­»Á½+ÞÝEÄ“ý°*d…ªÑÌøÕ´ˆxN†"MFL:áœ=‹žg/á±½|Ü<_ƒKO¨éËþèšþU{~É zÑø÷ + ×3MÚŠyÕêü|X•­1ë s"wP,ž÷~\ý’xмrJŽì>þ“˜Øu.¿G~)-wµË/¹Ñ¬¿" (—[ÛûEúýê[–KoZÛW¬ñ¼&“Ìm GO*§Ž›¸ xçá‘iÈï“ô7Ax^}Zµ†¨Ã(Ô:¼õ!g3›ùCn ¢Ñ ?I/ƒ®g¶Ê1…_ÍxÞp7 8™[öóLû ‡ïÝœ#۔Ɣ˜É[AÊ‹Yƒ~€ÏÊÚÁëGËFc…HeVcÞV½ydU¨-äanÑÈí}àtðFdû–Þç…µ40íònÓLÔÃàeGVœÞHÉ Çq0½KKXŽZÅ*OÙ‡ý ~ JJ.ãðóQy­‰a³¨éµÒdŽŽ_p2ø÷·zó£z%Ö¼¾ÓqüFùòνzW­NG”)ŒÀù’S¬fßvÁ±’ÄZË¿•<æd¸L¸{9Ó È"‹f¼}Ä]ÀéSB 4o›'³²-råÝiÙûò’£<]9ò¸éênSùcޝכ‡¤î3iðVßxÉ’°ƒYæp6ÚҖFfDE+ /*¢|Ýyª˜ö¸ÛüúEEŽ—]ËG]Ë–5)?Øo!õ²^pXlq³™þ—„yF½¬Í¨¤Î;_«ÁZmM˜¬õŠà꜕0´VvRÒ»j#HA…#ôeǤîáRO&>ømPJOžh!­dŠ>¬uVÇF­³'­£ÓµWa¢|k§@_åàœ*m¡ 7í©D\ pÙÚHÜ'šíóŠNPR`’Ñ/VË‘o³‰%0ë˜T. PÛ6?fòW´_1­1¾'à)Œ¨ãÄ 4â³è×ä4…!Š_Ë«W£ÄKsÂæ©±ÊdEažt@ÂH‰{ƒùI©(Ý:hm4z=3Í §X; bdN*7E+ ™Ô¦iYV†NÑ ¥&£1©ÂhÑî+ðm‡Ì*is[cDfHñy|êu%]'¶§µ%h}:ŒSsM-mƒp‰\Ë"ë]²'ø™¤ìƒÞÞLÑfÙ•¹Šœçx‹”ü’šTõ&YOè\À¡¹)ˆÀÄ·©«PaôHî³ͧc*Ç´YÀ&‰nëD}"Ÿ 4½\KRá¢7ðbBá—®œ öÑU8÷ æäç ѫᚋm™a{$ø¦µ9¯R­§ œZÇa  %MJÏÑU˜(ÑýoµBi4ë  $ð½>VYOK¤'OAŒÍ‹w,Xnng4µË½FA‹³Ävð®‹Ú‰:¡³1Ö¹b P¾#ŠÌ¬A³›I¶%ùSÔ ¬äx (þ˜7y¥‰Š¸Xfr:ðÊÁ‰Àý| PÎë©V#~=†.„nÎÀdï³ÄNÄÇ€UåîÿDfè¯IªƒÇlR–RúN£h㋆¸”‹›ä Fiš—ç Ò‹ã"dG”p §±eÎ%€‚&¨µ³¦`õšù—l»å\ž¿‰kÑAœa_$øÞà9Xùë-z“ßΠ/ oÀ?¶, ox¦½±Y*eçl†Ù‰E°»ÙÐØwgC•‰b¹ÍFÖ. }¤.vªkÙ$_iµúv­â‹‚ˆg‘IðuZF£v´6Ò´6>)m`˜e“Ÿ—¸èÚ"Vñaêã"=¬Xp­Ð¨Œ¢m|KPÀ…ÅõIƒI ¦ ‹Èn—‘ä„„±ƒb¼²âYY7x–$ú)FM«¥`en…pýJŸ5Á®$8¥ˆäxÕcW¿5‚©µ¨éd_­å´KÊôBÖm”Ñ(í"ÍÈ^ƒ‡¢~¾XèÏvÆEN pjƒvCÜ 3¸ !ò ~9žêUzQNG°>¸°vŠuk5Fe ËO=ž*ôŸŒ·u°je€@…·HüY"É4™eà“×ß›‡Qa‰„HÂ"ëÈ*,« ’_%\§iý‹0¦R/[f—¼v,n05 Qóÿ—†6MêŒÑ±fùqFƒÕ¢-Á |Åa§JË??F`• †¾Ò¾V2RÄ'¬dÖnV!©‡äCÌÕZÞ_+I´Q H:õ[úÌYpË4HïìC!KÀ@œ›E„ŸÍ-!Ýy˜ºIy€ñFUª‰€Þ–ÃO÷~Æ © 7Oš"&% ážÇPºLZ<+‡ÉFýÃd7qëZ.ùc‚ËÓTˆNd¬:ÿpicE¢AÁ|ƳÒ_;Êé— %Q©þ%‰˜¨ B朞4 ó¤½Ãa—Y«À“4‡ÃLìã Ü––ïƒßFp¿m`£ò¦ÏëÍû}Ò¤g,›vs2ôÙëBöн2§ƒÐ;ÙA(ÂFW•27s]ðé*ªv•ˆ€Ä‚1:’tañ™S–ŒÎÏ'©Ä0°“Ÿ¬á5i=XL ˆB,€9d: _d>ÎkºGÙ"ÝmŽw³K—Š»&k…¯F”Á¼ª9A;$Œyµ>gn¡û=¨ì€6ß"P…JãÁ± Äð­¦}”í†;…ÐI|àÄa“ÎÄH¸ï@@Í1Ÿ†iL’F( ŒôNó°– {àUåçAu„üŽáyPKüfzzMESafòÑô,ü4¤d£ „¸‘„ÁvŒKiÆÖ)²%Ý„ŠÈyß!Çá‚Iswªgè1zé!°Ï«ÐÝdÜäѶõò¬*°¯²›¸V²+°&¸1‰óUP ÛGy&¨˜é°]þ¼íK=äpž+Äð¯͈&fÞs †hÛŒ~ßfôÅæ2œ±‘bVýR”dKª’ÿT¤w›ÎS¶ÄgP$“tŒÝŸø ½|9—2k—µ0kP—+"ù1ƒ51coÀìÛ’«­CÄþaÏ4 Éü£ºT|o땊Н3 èRJ5ù– HR0±I‹oA®9.6áÏ ùWšü¥Z8;wrcŽGàF+<ΜÎÝUòs웟ޕ„®Fѹ¡[—À³a‰FUqX¢ÇdÜ;ñ¼Ú¼k ÊDbèR¶³@†ò²d´01ÿü/ dâî÷R|Ák~…•@Æq³@ûÉÛ6îJ&«dh4%mù!tçÜ@6_ÊLÑ]í6¯»D32•–Bì'-¼®rÊù`WpêéÑ‚+˜†ÉŽÂ2ð¥ýƒ¡ç“'€¤ëÚmˆwÀsÊÛ¨ d·!o.o+µ¸U4¢Ü8ˆb‘Z™0¯*#óö•¡\ÍŸäåiZ0oB .Q‚—h?!ÍjCyHžko£*wÙ+mÑÎøâ^_ÌG/ Ý·*,Š÷Â#Mÿˆ5µŽ—î»ØšÿMšOšRQgÇ'eÓ½d§BH<íP>‘‹°X,¨J5=H*¶¾ÙÄÿÀ" Sy;P^k‡jnòæ5ߨ躖”s3Òy®ÔbcÑ¥PX¿¹!W ¶@Žs$‘3)[ö›ˆ°Ö}Yé;81“Þ™ÅÇÕÚÐì@õ‘˜TVÜ6›­ÉûÍSg‡rêcÛn.B³Ê‚œèì“‹¥›¹Ë¢tR:2­t&GÇÏÖPCwÒÐn]%ª ›±×Ž™J¨qú}s†úrsæb'û/7êGðéÖ㺛\OðV%¸¸÷åÞwûà¥ã·|àBŽPnÿÚàÉ<|è“{÷|¾sýâtïÞ÷ÅÞ½_ÁÏ'_|þyð‹ýïíݰÿå-?úOØ` Ò‡ƒÚ zŒoÓé¦àË+‚PJÿV¤ýÚ‚–NmÏΞ°{»Š$Ì  \¦=¯*•¥0Íl¨ú&{¶»†"`‚1ËÙõ-›å%.ñ«]¢›V§Q6ë;p„6•·m:o6)@ë7ã#\:¸½øOx(M›§b&Jæ…l â6—Ÿ‚†Ä¡»¡Xn4úyÞ4Ûb}ÇBø,BcÈöo+«{—ÔåR)Õ{-ÕËÅ=\z Õ”"3¾ ‘gißZ:|La3Fµ’:N¡ÅεÃÉÅ`¬ßp¶!ób'™e»nfjØ1+…¤³Hb)b&Ÿ³…éHåê;w )ñöDÛ I)(WÏ=´‚¨…TÕoÖl£ZÚÎG–b'œgæ*®(n†ÊA ­J¯ ÈhN~ ÿ5œÝ[VERf³«¿…Y®žd TmÒ¶©.X´o à ïL8BUÉ’üíbЧ0²Õûl:Þ•nª·1H³tçýWƒ‚ y•qq·m¢¾+\ä:Z5?ò¼M-6£ÑÙï¦9vn¯’ÁniæˆE~éý£†TŸÑB^a‡IL}fn)âÍx`Þl6*AÁ5ß6Í¥A³‡WØôz¸5Fö5õ2?ìý|` çÖÆ:á<¾|ŸÀx„Ú&aÀ1$dÜ<{¼}è¡}ã}Уo æ>ùÇáêT˲ô‘v‰­ë“6´¹MÅ; É]Õ!‹\ÐÉ0ð·¥WµPåÜ;\Tê ž޵ k èÉ^etnL&EâÖ“>·e¶>.¹[…49bPÊb½‡ÏØN1ôM¤ ^jÑÅç ƒÛºšTÄ!Ž—°ÇÌК;?i¯A.šrDÊKbk]}ÛÔZyýl:„l a©ÕÙM¶ã®–[C´Gçz,7¥’l 8ÃÖ%Ì3Ý}BÚb‚¯Ö4Õñ@¢ÉoßTB@†”Õ/–ÝgÞî˜emA¤ 0°‡ÝRf«)­³÷eGýïÅÒ¾8ÌmY|ÄØ,>Ýb¢\èY™Îý rðÎÀÃZqF‹µURum¸Jåÿ`ãÞ¢¤ …P|/‚é‘Ëù›8QKäõä¿ìà´ä¨ úät¤LÍ·—χl¨(ŸYRb U^ÐØjá8KR?Ø–ó¾ltýzU% léèŒTi© ¯-H†“cã!Ô¨’‡J‘ÉV%£:éÏ·(CÁs§å§Cbú,Î9aNýÆê}»ÛöTC\Ëcm3_²[á™F8µ™¾¬u~Ú'¶ã‡·ê'´ÑçˆógáZKôý©_×›w6ÐQCC_¯«Lp á|T‹ßʨªÏñ«} ÝG²†r³~o¡ï‡~ óqb¿«EXËÕoÃøã]þ¤Ô6oZ ñŽÒ%Äé·8‰ÖÅS‹Pg€êÏhùå®#%QíÉ—x0bÔ}ÖÁ^êîŸVéëÝd·Ð¦_S©bu5Ö3v§zñûaÉ[šÜÞð9Šœ+á±Õ<ùM·wK~·Z‰–)™‰94jߘÿ èkù)ý—*æäñòÏ®i;472X,yq©!|ôò]ƨTÿÕ¦ªl'lÞydž Å›‘žÞµ)ŒijÝcÝb°f‚ÜhTZ¤òíÒqº˜îúrïŸÎÉLendstream endobj 105 0 obj 5755 endobj 109 0 obj <> stream xœíXKoE¾¯"~Ãg"ïdúÝ}à 8 V‰ Èöú±Â»v'Æÿ>Uý¬žé]"Kä€b3®®úꫪy·¶ñ¿øïùnñêµY^½_ŒËàÿ«Å»óËøÏùnù털ƒ•ÁŽ-×—‹ð6[Z=È¥Vlàr¹Þ-þè¶ýJt{üyèWйÁ9Þ]âßÛ¸(º÷ð3Œ#cÝ[üó.ðç6øó6 Ÿeá›ôg÷”w/ò.(åp˜µº{ÓåÕ˲ºÍ‹eñ=‘´ð ˜!‚7E’Jv/[šïZšïóâ 8btðlüÂâm‘ÜçÅ+䣗¼Ì‹Û–NrÛ‡¼x_oóâ#µC:38«*;þ\ÿ´pªÑÑõb¸/zj‹ˆ+‰Iø(…Ø”ÏËãu‘=iÀÇ“üˆF­ø8Š/WL J9Œû|–ÅÚ†¸xú~õa³à.Ó}Èûût¶•¿æ’¤ âÌ¢MqñºHžÒX¦{¼@>œzä!œÏà‹ÇLEä¢" ì©¢Aa÷¢²YjËî¹ÔѼ¡'ùüg_‚>âAÿ}$í7‘44¤'K¬q;‚ ¶é‹ˆ¸eÿ3ȃA^½f–6!+6ŠA@àj21ʯ`,ì¡_pGèA OŒsÔÏ FsïV 5ƈŽûGt…„@B·½B³’‚‡^ `Ç`ñÁãi w¥Sµza”×yWö£^=JÐ+ ;Áºý ‘ ãtQº¡Jƒy3.nÃÛ³)Ð ¬9ǺØ&¼Èƒ¸pŠ€5 î,k’©ކx(@RÚ(OE˜8 /-^.øÃáÉ\WPåY¹FÃ&¢…‰#±û3nÂùä źçî4˜ùŧ¡á†Åã4oX,ÜšËXÃl4pŒì,¥I$­. ¶á% ÿU*_B¸qÙÑ ç+Ô£µÑɳc‚Ú“Åö=gà%ƒ1= à-;a¯Çž»3)A.&GƒP"0½ÅEI©ãÙˆNõ]8m¬Þ«€/|—È#Ä|*‘ˆ¡¬/@C„NË9åðÃajxò±†ª;ɺ]P®µÿk_'„ƒ`IÙ½h+OÛ:“y¨¡ò"w=MfÄ)1lèWZx`@X—Ìk¾…v2IËÔ‚o#¶¹·–tã €0)ÊÅÃ47díî{GñK3²‡C‰f¦‹ztÔ&øM*ëÍE1hÇg œå;qmÉáÃYas¸UÝþEÄ“<‰éNJÇG’œØ&Y”°„m ²sê¿h±2Ò DOŠœl€i‚]/ðr2ôŠØ´f`­äȱ*£HU‚û aN°:£•š^„?Þ!p¶fÒûBYŸ0瘗RiCQ7!ɚ͋æ&¤E’{Aß›DÏ(=äúÔRE®ˆ•ZH;°±&áàt_õñÊhòäm Îv„»WŒT`„9)|á(•Ë3‚îºP?É3Ä?¶ºÐ³2ÞFýU_¹A`£«’óAH…Ž,ÌŽë%ÇÈÁ$K6‡5¸¡¦xÁ SìK?²9ˆmí=ÒóX#‘LJ"&ºï{`&c%K‚f~4kþà˜Ÿ§˜S9»+–´£¥$-H‘‰Pb *ëé¥È:(ƒyšŒb”u|Ô[w¥ø„yœTЧáˆY©Ó"Ñ÷êb€}°@b7nJUÄF9VÅtÙic(Šx¦ø›yK=H >ïVmÂôÛVCuHÊŸ9vÕÓ`’}ôã\÷ušÕmÇN_BËÁñ á—Ñþ¾jùË,ü`ãǬðAð>}·2þ\¼ çŠÖP`䦹tû“ºÓ­;͈à–!>0= R„‰]ÇÇ¿4­cÎûß”—~Ï‹?–Å_ó";:ûÂ:uL]áñ–¤â»Ü’ÊÔ¢52›8ðjÚ?gös*Hð”kß F&'Ü ðOšˆÔáHíÏ)¡4Ãhû¼ÛüÑg­ÞvVB/•¯ù±Wª-·"M'Òñv±„/[,ù¼Î&Rk rÌúÞRÄ ÂEx  F"0"á…ƒ\ÌÀ€´žˆv6§¢&y÷×Ä͸ýDÊAC¸R¹;Œq%u J4£Ÿ·~%P¨m˜]RûFáheˆ/¶pül|9úî•ôŸ?“žÄ¥fhœÿл•Æ—“û/<¥Åf¨BIeè?™Ñ´Ú“þ yò[—ªùK9D³Â;gÖÊŽuÒŸ³äÚjÂÈMMI‡Io”E7QSœƒR'ÈZu-Ω¢-dÐÁûÓâæg¯0­ÈŽ‘¤Ø¬ÕõÐ.SlýUÇ·Ê–~ŠQS"ìª9ø¶`‘Ä­4ŠáƒOMñqš†šÉQ^ú0kgïg_©ð%<”Kß©T(KªZ-Dý]µ¯r“yèYÓÃ@Rrl¹’ÆEâÄà Û+Üþn½øþûq"¤endstream endobj 110 0 obj 1916 endobj 114 0 obj <> stream xœíko·±Ÿ…üˆú¡wo½|“Š¢vÜÄmš6©‚¶h‹B‘c[°-;¶•Fÿ¾3Ã×p—{:ÝÉiPAΫ%—ç=C~·±ñ¿ôïù«“û_¹Õ³w'ãêSøÿÙÉw'‚:¬Ò?ç¯VN¡“Ð+!†`Œ\>=‰_‹•·ƒ^Y#©W§¯Nþ¾Ö›qP!8í×ÃF Jy!Öv³BªÁ¯?ÛlÕ`Ýèôú[lžÎ6zðfÝúÉFB«‘¬ñ-|áá+׿ßlå`„öµ_ÓQÖ‰õ¿72 Æ µ~ @èq”ÆãçrÊ ƒo•õL¾~L#eÄú>쥰ë?B¹þj³Õè””|°« Þ{l:P´Jg×—Ô¨„aÀ½ƒwcJüóôwˆCXÂâPް˜V§ŸŸœ~ü÷õ)¢Æy1ªõóÍÖ Zë€cm•4ƒÑzýÆ·`2ë—0¶sNÕ‡×å e˜‹Üpdz£]?ƒfíDö[\„R:Hïªvz¿½òVŠÙ$ OPóS€~kø`±]*ÜXCXWð©ô'‡µD ]‚T&ð8¥ÊÆM4™qÞ€d¤``ØñEã Ö|½ÙŽƒ”°ý6Ò‘”.¢™ÁÃÎ+w-–•¶´ž p%R nð˜çô °ËyàªvdS¦GÔYJs€té•´ƒ¢ûl#ן #ygÃúkøk À‚Ñ‘ødàÄ·Mpl‘¸LðœÁxåG!Ðß@0ÀÇMóòϾÛ~lºÞÌŒpí‡KGwtC¡¤~ÒF‚’ƒÏôtôÌý]ÀG Â¥鮺â"¶q[¡€°Gs”\…t¢ºK”‚*¶ ñ#2:BñFB"¶Ò»çøƒÂ†„@쌟­ßàÏþœçÏbë?ÖΧåíE}ùžÔ뙩õey£kk†ÑÇååÓúõ›òò}}Y¾Éí‹òò²(bH±á_Ôöº¸ëúò‡.¿ü/x¾Ê÷$ ú?ÀKn§Ýæl&ʶ<Ыúøº’ÍÛäüøböû¶+É÷Ê#–A™SÖ~(ì®ü¬÷òª‡×lòcÏØ iIk•%ðW¨ˆ|ݘ%¾pž)侚€UèQà0¬ëÄŠ ®´IÊC·³¡^mXAR«õ7hn ÚHËô<Ù`:xR‰Oq¶mÜøiТ0«qV2•س)žÅÚë;QÏzô¨Ø—óÄl>ü¸Q ôhUÃÌÂ~ [nðÁÔfIõS»Ë’ÈÞZgu²‡ˆ_¡ð [ÈÙ&ÜÏ,-Ñ¿ ¬Û°~„ˆ† ¾ C€æ -¦èÅÍØDs#!]$âˆ)Åm8'<ëEÌ–ÖAÌVŒŠD‘0Eˆ1$p”дC8$ÃÊÄ;`´¯ÆŽÎT¨¤ s«R!çMcÏÚÁ;`lD:¬Ó&ë À »zÅh‚ÙàGÛk™8ŠÑŽÔ‘#"X„Z¿1(µ€ß93Kß~S(ï³y\½[ÉF@NqÝXîe¡·áÂh…ØÁªIx‘-†ãt«•CÏ,;>öõy%ºL­=ãU£™;Š<Ù\“$Ý™ÅNM‚×µï»F}L%¶)ˆ>[šùM儳–7'D]x¯2syU¿Š<@&[•Æò©„ìµÈÿ\ï‰ÔŽ{ŒÅ(¼rr ˜¢x1T|(<Ðwø¦Ã«’ßSú¦ =×ìLè+-‰ŠZ:.dzÕj¦D±æ"›DÉ…Ž—WŸºN {9¤Ézä…è#ÄGÇüÿNÑÿ¢Í)ÂYœ;Ž·rdîùR&2˜?eV‡ü.)óE+%¯;Dysh©¼ìĖ쇅Oz¤uC`äºÈá3dÊ´%Ô~Ù 9‰BM¼„I |U‘õ}ÑqiOz~ß[ˈ8çêåH¥ÑòÞ\'½êÍyÉÉd¾;>h–§Œ)Fèæ ¸Ñ‚2f2fm½ló²eÌÊ…c™¾ÿiG‡¡&U»›\Ç|Ùëù®.T¬÷Ž_6£O4ÁD¥ìæ=Dž0\4ñpÑc¢KN¹½†ä[D­¨ZçùBωr.3!u™ÿ²éÃåG [igj¸*“tÍÆ›,v˜ÿ‹Æå\œ5«`uˆƒÉ‚‹.!MÅ‚ŸÒ~2©¡sþ½›ó;òDLÑÛj(¥s'…:X*ä8kKKà½Ä˜ïÎíåžÎ°ûxûÊ íý ¤ìÏÑæfÚÀrœX6«£wzG"&Œf Ž/½Ð~„\¶¸ù:4õùÝ€ì¨)LèŽ|  W`¾m)0þG5°Ì‚Êqû-æ pz(ÃÃeÛ1ôl¾Èµ i(–]d5L]hP¼ÕÊâ+…b;PéG]Úd‰$!c˜§ún“9ÕÆºÍÜf „³”+Õ xÁxSñÃ0‘ÔI \ÔÚ4Êæ=ð'ÈLžÀ$Î:€m!TÉáJÀ”ìQtOèW“iÁjš {y‰@V£5Í@¼€£ 9 ¯žâ|Ýæ‚r*ÇÙŒ•Y/'eà ÕÞiFùh¿PÀ¢)ýëj$ôQ’p즆¾c´rÕ#áÊ™ž(¶’”pÝ¥Aò\ Éu ÝúÝ÷Zg”io¯S"6C ½3j‰[st,Á†ýU`L*!Aº…œµõJr¹ŸI3€3 c<+yâ ±_ö¸ˆµìÊ5/4 ì<Úae†nÖ¿-2Ü&$´:a±°UúXA)gu¡4+Po§b4·¨Ù¾É P‚݉1$½£ ê.’Mó- pZ\›Áìæ„S^2®Ë%ɹZÄÚB•n]ÁÜBázY¿¯1Y Xü ýNêG*Å 4¯hyÞH匳w•@-zF.ôcºÆËy~˜ÔÌ<©¢«ô4º¾M ±^­Gئå¶ÿÛ'Ó^ùòˆ%ÓÛfíð›TOK}©ÂF‘M+ØBÁsQé£W›Ýˆ’\;ƒÕÒ‚Ñ‹•öbðíÔ.á"α¢ *"L(nžŸm&úв™Xê1u:©Î†geìÏ-,(AÉ®áò¬­nºH’]ÅYeöX !×°NI¶R¥$F£g¨®=ÏHôÏâjÇÑ炬~Ĉ»¿¨8HXÕšSq§J¥pÊri B]Ñ•$="eêZ3I•ý¼rqRŽHEfNgØ5MkG½`Ôüä±NŠ˜Òà³±½©-›l&²L-¹‹&Å#ˆE^<",ºAa" þŸ9çù 7gIMñL>ëD$$M—öÄÆóV•0,Õ}Œ%>yÙ=‰P7´Ì}ù†¸‡-†Œµ_£àB¥­m”r‡jùy-¶ótò¥-wŒ…K$ñøœU.I‡¾¹ï½ÕRm¦»Ñíº¬]ÛŠ?œVßµ yÉS®¢K¢\ |}ªŒŠÐÎ|„-wÙ²e”Še $âl©·•‘t³æ<¾Ú3eB%:;-{×:NV0Ö¯<›Ù™ÄŸTæCb‘)Gß}g¦ôŒ\¡t,ïOÇnZvjuF®2[²×rû>·ÑážÔòÖ¡#t<<6É’oCDZüq–_:GÕ+¡;ÔækÝ5Žøè”(sat¨†" wxcÚ­Áƒðû:_Š×¿ÏO5SÃ8orT§¶1c3Ü›’4m«Ñ¢‹±Öá´–·dËG=q…a#É-Z éH©cг–oGKˆé/¬~–¶!§%h¢˜l@ãE•ò~«‡1ÔÂ1´Å‹|KøOU°®-jJјÑ1v6eÞûj;]µ!!DkT\§ÂËê½^ õäUŒ4;k?º€že Â*:°yKŒwTFDª¹Í)QÒš b —€!FØ|b<Î5@3!Õq-€Û6îÂ&ìºÕ¬NΉ¡8Û^^ã§<ð/w•üú0Œ¾DˆO‹|ùsMíÔ—_Õ—ËË/êËOk–*6ÖÆÏëãk¿O›!óãÃúø›Ú·ŽÐu©X¢ P# ¿BPÁˆšúU̳Ásãu´Ñ=ü†ÅhïíÖµÒlÆœ¹Lºc«ôØœ&¸åÔq.F-_”—»§f1åx†ã _ßÀ¥çqû»°è–‡º x³ß¼öÏùžÏ÷áÓûpåÅ~{,¿Ù“&Ž‚%OöIW´1t=èŠÁG¥ïÞL² †–A{ØíõíŸnmý×ݬl›#?8Ì?˜ÝöÄLŽjŸV‹‰A’æ“$Lçûý0‹;\Â¥(j%‹€wŸUƒb[Ž1;í)QóØÖxfM¢Åóûä­Q°$(‡8Ñ1ÌF¥P%™mÍLëg5sC§ Ëfx#ÚŠ®Ó/€[<2hëÉy³™äQ&ÌÐå–¥(~4@UïK,qÐa)¹ÝŽ™¶UGŸ'èMß šYµÉ€F¯ÂÇ„òE‰×ëJ®hòãU.J-Fbe‚¿Á^èÍ ~VÁÀÅCëNÀªÄăüí÷ÙY—ʣܭDlÈSÿ‡á‘Fw…áñ~½o^O:s¾°ÎÎåLŠv”‰öoç8°ž@¾ÙSP6rÓbƒÀiLéYÂ)v2áh‡1)V·È1<݈ëZÝ LPØÕ£,I ±óµ´Œ•/×*³¶ˆk—Q1N{Ç'7p¼’0§#ɨ,–þØi˜L#ãXÎ ói"7^žªƒYÊžòKWížbq1̉âï°£ž}X¹èpÆXŸ<&Ù„Äx²‰ ÀBæ&ê¥bÑJ‡Ó`[0"}‡G›ØÿÑ®­”ñæ"Ý(UÌy=•ºÞ_³À j½&’ ŠÎ"AX†ê.³à@JL‚²Íݵá©%‘{”±#å¢ó™vl6‘ê&#£«x‡ ‡M2 X"iŬ2QšXW²˜W1 sGJ6LS³ƒË°09@/cĬ“QžÚqñ"Á®„=ìkåT˜%UT!Ýh4~ÒD£¥ñd¢¼nÍÒ6½-l•:…®'—.Ü$ú…ÞE Hw?ðAnºÃ¡¹û ÷Y¹’k./†žú¯XÉÎ'fÕÀ ʇ{W‹Ð(l2µ%K;NÀï—}Èù”Y®<ß:ÑÝÖŽy!ÍT°vÌ ÚVÝÓ•ó]EZoÙÏÊ®v J Û~ê`dǾÚcl_³_×nìÎà {¸§»/]Ó˜dšÞRNt ¯Á€íeÎæœœÓt±š‰K…°tâé¶s¶Iw-ãu.Kr!·ß¶¼7ûBB Ê”…äÑð6+3§´¦¶ršßµ ZYò‚.–ˆõøûмRÉþ(âG7Ù¯>½,D$8½üȼ„Aa(ˆÒ+ñš§ÜT`Ú³S×R%È4ô0rQt½ñ.6¶ÕÊ©Ùu±Ð¯;íz€‡ƒÚvW¡GÖp(êœ!‹+E푉r]Fˆg&uÊK²:ÅÅZ°I]†r˜ÇU‹uÊGonâ°$ßsº r¡§å³n÷‘ ÞÜ 73óUGþycm*?î«8C1Q4‰€U):I.Ù,Ø£³®ªû–À ðnçbN$zã0°’_VKìÀÃ{Þ¨Îÿ²Vz”]œèùt™\WÖ7%ŠoëÚªx>1k¦ó\gS&oÈcó Ìô‚ØáØ"‰Ì»»â3~œPu*~{‚…Ù41»,îÀØ,¼™ÎÃ㆗@~“<˜FÍô|Ý@ÂïÝÅ=··»l– Ç-0¾+Î÷¨ØEú(À±Ìa@¥DÁ—Ýq+[²"ýr„ɧ„˜Và³C•MÚ͹je:Öá]Ôôë•fÅdý} Ýÿ-…îž|yòÝ ˜ÕÓÅÛ[|ÔÀçÁìЯò~ðøäþã?¬Þ¿½úöäþ_VâäþgøóàOáŸÇŸ¬~vòèñêËÅ+¾'æIºâ[ò’€QÈþ£[¾¿È ‡eà,,Û~xà¬C[¿®$=(3I¡á’ëg€%fúDµÄæ÷-0u'iÀn¨^*L8uàZiŠÈíu1ßíDB·¢©ØÂ{ûö `e¯ÝLX¸}ÔIÔ8vïˆB[Ñʆ\–ÄXÝêä²$N®ì]TÜí—) ¼5e­—±]áÅEàõð½é[y%h" *ÄïQu½€ëK«/ à’\º¦ÐÄ#xâ©{è¨ â²<Çy$ŒÌ»s Žà%eD–i“¸:–9ûÉU?‹•&®íž<­¯Z’¾¬„º¤—aòàK×¾ñö£ò[šNy¶ ÙƒBöÝâÅÆóI ÒTbçOÎçŸLÎ’¶>‚m&Wí§¸ûfáüâL Ǩ¢[6ųËTYׯrî˜ê EW#œûŒàã[ÌjK‡²„Åã¯acŠöüòä?¿%Ÿendstream endobj 115 0 obj 5170 endobj 119 0 obj <> stream xœí\Ys$Å~—ý#ôÆ ±jºînÞ° Ž0+Âá0BH{Å®¤eA‹÷ß;³ÎÌ®ª94»8‚¡Õ]]GÖ—wVÿx:âtÄãÿ/¯O>úÆ>ùéd<ýü÷ääÇáœÆÿ]^ŸþéÉî ó8‹ÓóÇ'ámq:ÙAŸZ#©OϯOþ½ú~}¦òæyš¬ÿ{G!øãþÏ®y;2\kä .ŒpüÅ^C§ÅÁ Ý0OfTïô€ÿ9ÿû‰œå0Ávž_… µÑp[­>l½ô²Õý«|ó¬qœ‘P¤û›Ò2Ó@­®òó ö|ÓÍ7­‰<ªFzu™o>-ï\䛯J˲Ìç” ¸¡JÚÁÈ02ø ë3]^´<*w,02ƒ ±£ ]¿Æ»Í;~•fgüìÂcœ<îTœì]F…_õ8¶»¬ZŽ~wʪ/KËÛ|óš­ªš À P_ÏžŸ¶î}ý§÷þ®çïÖéÒW›aRóXÐS÷eÜ‹H{·2ªÉ‡áñ³ÖBÈ’›-_P‚{fö÷ÉŒ ÷åó>* vtfÔú=3¾£Ì¸Y¾¢$Qžêa÷^%ö³[má»­šì0ΠÖ,ÔȽô>úê²Ó2ݼj tO4ÔÌÈq‘.90"2(ߪΤ„˜ç{#ã:oöUn÷8Kãï)¥b»ëüó¨CˆûÀ%!cWyþ[À¥!Q©•W ñ"F.:§%Ù0ÆÁÙ >£>¥Ô€Ë»Ô– <2é…ÈǶ„RKáîô0Ë…¥ÕYÀ¼‡VÙ݆h ø§^ÀÕ²mSçÇ·õ‹}R6¬ Ë÷þ-|×D%§òݤïо {€¥3Ì(iAôÂB`ÿ¹Õ9ç§¥4öÙÚßñÔs•rÚ Æi`Sã78@Éh›Xë¬ö ì}d¯y XTz6¥7¼ç<޵$ —¢Œ_äóµòMq8 -…”Ør¤Tn¶À*r†kçÒÒ„Qök;h[»‰·”ˆ«pJᶦYá‚è ­ù]W* Ó2tåAZºV~È.ŒG#·Žs™û¸+ÏÉ*⥖ w³i¬t~§¨ËѬ>[ D‘žW†0¦Wßæ{N 5N«sĉ›¤È«”žºñ!5'Èÿ1z‘„p$½/°2AX*6kŽ€÷<(–¬ˆHØU+hõ«ç%Wc‘¢=uYç ºr~WS›ÿ’ÉåQ´ ÉM4H¼¦Â2:œÒ`Ô_ÞÇiÙ|YŽŠfN¢¨qθvo‚°ý! ×H"€ŸR+4—œLòý½H†a·,Áh…î`œ„êB?mûú(vÀM©ø¢5ÕSE è¨Å@EåñE-sŒ2)ªÀðIâ|31ž¡o^P€BcM_Dc«ÒS¸û(™¬Ù$bŽÔñ€f­VzõU6"8qFv†}éX9´u0?yÖMÂz§œ©yÝ2ÓY0­²ò[6-,Ý I{}²&Ææ¥H¤»CÁ:õ5n»5”ÏæG¥íFAùÇÁÄdBøm覮Äï$ñÙ4›VRt/௅2 Š l±7*ÇyîCÑ+çöÌœ¢LEpÛp!*åÎTq†( FÑ~cÞ'äŸüz iBŽ Çi·P¦¶·;ã /9W–»àJ¶à’òu3@yq%QÉne¢WZ9¡_ /[»è÷»'WކpQá“§¿ì09PTæÄYªQæ>µåÎ’éójkýQl—kÈ“Y@ïo< pzãIb®€meTŽÆûZ€Ù 3aâ1=ÍT¡Ba4Ç1кңñh\Ü8gK ÌçéêXJ~Æ»q(Aì72sÃÍÆJy‰ 4¢žiOO˜¬Ùkt¥i6]2äe˳ÈþZÚòN%!L¥p¿!=ÈÌÄ /PÆ6õÑ*¨JšÈ$”ôÃÜìZ1=H ££à—ËÍ%œ1o×Êë¬Z™¢ä)í"ݬ>ÁUõöÕZ®¾…ÿ¾æÀ˜nŸQ°øFqÃvN{,# È9Y[éÅòjÅFfÂÖÚ÷ì˜Ì”bávÖÎáÑ9RŽºÇS ÉK'ÎyÞŸ›¨Ëú”ÂÌ\(Ý"À/q#´’Ø.½}IaJ mb”wöH´ø†.q®\à­†¸ÙÞjвüRìŽLçå"„F€ »ÁkŸ©À½)VË"PêÅU3PÚTß8»âÊX4 „}žXiL`Ë×à ‰³MýæwþÍs²[Clƒ["lŒ³-é™g°ºÑS¢©±ž-z•År²ÔÃŽ·:mr>¶H™œœ‡.#¿ár#¼È•K+ûëpiàÎ٭ξ‡Úw=£c\š,˜éåH8[$Í»†VªC—MÒè\?„ÏJ¢Šµ])è T›`Ö#üwÊí¦iP–ËcÝÒ$Œf¹BC`ñViÚ²åAŽJ7»2`«ÎãUIº\±ôÊÒP—ãÝYÇ·tž*†°ãYë&zu¸…%ª[ÉE™]ieË‚ÓI +y;tÑGêc¸ès„ p64DOYÀ›ýFô=¼{®ÑŸ"'O6ª¯¦&#Í? s‘ÁèlêíÚÕQ³X†}[ìòCCºÔfmpW&ï­(‚m,a$µgÈ&STe¢2£ƒKB¼žsœÃL_„É4ãý¤'â¬p‘…újMè]¬ ²à쇙÷d…ugMˆùµšÌRϤ”5ÆX…«sõ%‹C(Æ|›¤‹…í£;Æ/þºF9iÁ÷$C4ØÃ¸0 ]Al JcÑ1D$êô®¯ùK[ L>öqD­v®·´¤ùÕýØGY¹Ü -vLˆ,»&„6AC-ö¢N¢Œb{ïM%1$üà`¿ìžÜî…\|\|ƒ¢õ#9y»agù®íµ·l‚…·i¸ÔÖ¡çí•DÌû¤7ZÄ}’½m0Žàn''Ç–(évUEý"ÌÔw_â&”ÑÂZä@üWE£‡ä|hÝP¯ƒôÖ¬ÆH&A iÇjäY04€áéHذΫ»´zs”'lê,ù>Ù5Xµ³ÄøŠK;?/y_¤+;ùŠŸ†°D¢é‰ƒ?goô@Žžh,]LÞƒ`3Æc@ó6[MXé•Ý+ùˆ›ÆÂŸ7­XTa’Lq½4ë™i›(Ñͽlqžûµg~U4rR¶Ñ‘ߦë«d&vÇòC7ìP1ô6L†ß]‹/:1ì½Ø#F"Ð èöóÔVM­¨GÓ½¬_¹õÂ10ÁLªæx°«¯ ç0Ëâ IÌŠ™ºܲ©úC3-ÜÌÒj°Ãtú»u¾;ÐàèÒ =‹«<“àN£È§ÍÞ|\ð¾Ç8YøëU—’ÜF©LNs÷+IJF#EÀ:ôf÷7…² ã…Vzýˆ%ðu½É"lÐR>²Ù žÊ§".I†ç‚£´‹B ª[Z;ÛXñ6äÃb¢„/÷‡¾Tƒ$2õ³âÏËåÂýó&sp‘¹ ûz°$óyHu“/~£ÅÝËã8gKG%Â_äq¤þ«Ðݤå.ø™oµ þ½peg Pºš`âõÒX¢4+¬,¬úŒ„K¨ Ö“7µâFÒ#žD Q›ÊؤÁ°­ÝÎ(mb?Oà„N>³Ž\.fŒT*U.©“ÆÄšÄÞ4üôdcìvm…O«YÒLW)ߺf R)AbCt„‘@ž”w“ʺNy·ÔÊGž7e[¥Æ<Ì®‡&r…¶[žZh/Ù™xÝìê#)Y'¿wÐ Ðk±:e¦£ôvb7‡䙵)ÞîžkšF“€…#jœŸ ßp”¿#éÙlG "”ãµ—QLvâ;”@ù2Û=ævß¼ÞÈŠƒšulÞvÎYÔ±Í8Þ2½Ï«0—µ§éi£¸šê~Mi´+¥ôYëëµÑÄžh‡/9Š2‡—…‰KCÎmÆÖ5I:Â!TKm:陸è¡GÍRž€5KŒV}N»D-dPBRÁu¦¼U ä;_µ•óþÛ µRIO‘Â[*mÓ!#yR€eM6dÿ·n8ß@¢|ˆnzpÑëüt_áqÍ fÐ>g|½5¼d^͡Ұ¶KøÖ«(ÀY©<‘¿{W[Ô½µ·ì[¶¤M]¦è{·-+…ú¹‡ Äú}*HšCaU¨Õq6U·ÍÀ"ÔÌ~§ÅÏ R¶Ï]…]}1Øî“÷E¶êìGÄ]¯r¿Q¾È²±¬¾~V ­Ž•ñ·kžr“´•›rž“èç<þ\H‘u¼!5žc‹…]-™ÝŠ…t°"€a’Â8‚Om²þ^›5xâ/ošþÊiN±Uó‡5h %¤pm¡Õ>QÈ+5×…Chq8;X×õCnÉ–àÒ.ôIÉä Ëm:–%©µ¸ >@zRIÜph2rÜ¢.醖Š÷êè@jN Ä9ļ”­Î’©’²S¨ Xû’ô ö(„M.U¦K•t7*/t2(ìNšAèïHÑy"‰QƒsŸÏB€ïâ?žrÏÏB—€ŸòÚXžž*ÂáÆ„åÉÖÊÀ/¾x ¹{Ì+¾ƒSÁk6d±ÁE½ÿýÏ2†#ºÀ“Õ÷Mv;¬5í_)z¬£ñ±qkºlKù÷ƒúßö9Â÷¤dÈþRÞØr í"­k:!!Þš:ƒ•O—2—_œœø¾´ê}iÕÛ*­:¤8Æ€ÔW,¼ÈW­/F¿Ê÷ø—jÃÓr„í.ŽÙVùÀ¾ZY…<éKwù&‰æ†‹¾T[à}{Ðõåÿ±Ê_B§—¿ìŠßËÅßö÷;« ©·‘ê[›B„$(˜–S®È‘á(-¾ðéùÉ?àßÿl XÖendstream endobj 120 0 obj 4636 endobj 124 0 obj <> stream xœÍXYo7~ú#ô¸[T 9¼_{ iß(OIQ8r õ¡XvƒþûÎð¦v×j (‚È»ÃÙáðã7ùyÍ™Xsú—þînV¯ÞØõ§ÓНÆÿŸVŸW"(¬ÓŸÝÍúû-* ‡æ¹ëíÕ*~-P$™„µÑ‚ZooVï†GÅœ3Ú ñI)0\À¬µ2‰@ªáa”¤e©ÓJø(5ó^Ž2|#3ÎÀX;|Áã³ÖÃݨ‡ûq£˜”ÊÃpIæ,SZ¶ÒjdWž¦jQ^ ¥šÌ«a‹æÐïŰ¯ ä3hôY ßTicì4nÓÚ;+E]ØV&¬ŸF8¬”Ã!cuÛO' ÓÆ´^V0ñ%ƒUv"hd0óÒ¤™–Ö›Œ4b¾ŒôÅøûöוäœhÀ×ÛK$­[Z&xÜWe˜w&c€ûáˆR‡J“fæ"í>D¼.[áªÚet_A±¢^ò¯±_MD0t'#åÛè—B²¾ŠNÕÞO§¦un¤Àu™õFȰÇq½ÉO­EI+—‰à,y±/™êeìÆY•2•('²‹dŽ|ã ùææ±ÑÖ@ý¸ÆaedÒ<_¿£Wàcå]œ,¬ ìÀñõýXhW?ù²B™liyV˜Fˆ+aœ –'¹ù¡’ºEð–ß,°ZÚ•§´°üaÆRú'“v¼ o2µb4¸¡ýWÅ(’¸ò¬ˆh­Àqh…ˆEpYIi×opzf 2³aÏ ‡£ÏÆ8mHZ à‡,‡òê ø¶ l2B }¨?Ѓò˜njátE?¼üóµÊ½^3ÝÜÌ4¢Õ}¸¤h•x±¢Åü§¹ü_O¹Ìe¦¿xæù] G%]o饪4+†Üs–B‹ìøˆC‰²šÕa¸¢÷CÆdÔÐlG?wôC©–B*ÑqO?‹2ÀŽAF&©âäá«ê硪ðô´æu!3ZW˜¾-C‡ª;gä87Ý}bWžŒ»ÄÄæCžªpVóºÑGÊjÕÇ»ªõ8çNµwlg‡ÐMÇÑù-8˜³å7^‡íuÁ‹äF!Óîb"M~ž}FºXý²8æÈ¾iU»eJ‘ÚäùC¨Ž;é{#X¬u–¸.ÔOJï¥z\S™Q pGjé>«†N„j9)¶Ôe±”Ô 7ÍÀ=æL*xQG˜gÌM –Ã@7šnRg©hY‹eË=[Úkœm¸g›ˆÛ¦Áæ„öÎ ì½äðz´Gʧ£Š5~xQõ΀š>¢y$žºÆ‘ÒÄ®kÚo_¦® sáhl†5ÛŸîiNMq3Ü”ú„¥tÄ”"­ßÓ.ZO@4Br˳žï*z˜±;x¬Ã Z0nŠ2j¶ 'ã©IƦí¼I~=BsB|K Ša\¨Ø©mna'¢ÎÀ‘Y!÷u:·ž!¸f:Þ}ÄE™åÓXÃÝãÜxÃ@:4â9cdø…¼w^p xÎøÿ‚âÂykq9ͺñr0y&8æÎ“A$=º ¥a®þ¦>Õ•¡Þ=4ÌYÊzÎÆÔ“Ïà–H[øwQÇdˆ~;£ù…òÌzÙð0­0óp6>¯§O‘âi•ã%£¨§.ªöƧ·náχß?œLs41ÛàW²MþÔ~`⦣üREŽÎ —¤¾È i9íÇÌU_#êDüåÛò@©ÁÌèÁ/%Òko{Ä<ÔJYK¦ÄÀa–B°Nçɰ¿ehhaø«)Œ87e¨Îd`>8d˜¯ÌOè·W—³4…ã|î¶¢äåØ l§ »NéŠ@NØMßMÏ5»ä’HÛCš"r>­oÎ._ö*aïë5H¾¶RjöÄ|¬?ÛrìêĤT@H 4´‘&t!3éª{?›ù;F!„àüv l—Ͷ­ûáÆHŠ>ïÅÛ4×ÝÏõm½±d&³îàšZaꈀ*bÔ4úÓvõþû¼¸—Ìendstream endobj 125 0 obj 1527 endobj 129 0 obj <> stream xœíÙnÇ1ÏŒ?bß½<úø;·zôêhX}ÿ½8aÂ*ý:½\}z “„^ ÑÆÈÕñ/Gñi±ò¶×+kD/õêøòèÇN¯‡^£Ó¾ë×¢WÊ Ñ¹õF©zß}cÆu×ëiÎváƒ5¾]¯¥Á=M÷f½Qvì½ÖÝwøì ¤ì®âfR¹îf-{ëŒL+ëÑʺ̳üå9ŽŒƒ»W04Œ£ÿ8þ3žÎÃyûqžN½ã¸:þêèø£»cØ»w^ ª{¼Þ˜^k=X]öÎ9Km”½q?Âã,n¥a¢(O˧ë5àÀ[)êÃWkàm”D" Ò0]<¯XŸÆµ„$ #D¶7Út—ë œÝ:@4nÅ–Û(i u72û9|ía=¸|ð%¢U)=f8œRÝI^:Ø)\) »ƒé> sã(º?­ñ“³®{€[ûQ .!4|ÿ°B'ÀªûÂ&{©ÆîÑÚ$\J¥UõyÀ†] ö@ez…ºœ–`©@1{ êã3 c˜9iå€E*ºâdËê£)°:ᬃ øïóÄHr¤¸‰Àl€ü}„éŸIù!ûq„‹÷Ã\ƾ^þ±ïd>l×ÚÙÃ#pi¢Óâà‰®½Ôÿô†¨FY‰êàÛ·€5P;[é ©ù&‚¾ª7vñOP^!»ƒŒ„é²ûÿ~’£<$Äó+þxɧœJ;-“ãŸOóÈ\A¥oê€÷(€ó—2ú¤]_ÕÁæÌ‹2`èá»Êà/uæó2x]_–Á{€‚aD<†£ÅÁg ¤ˆ"E–Õù¤5xS+JZçxGån¢¢ºÅí¼.×Q¯(<ñ†Ë¼§ÖÅo/+¨xQsL>iaò™™HxQ'â=@}owtV¿?i-_¯êàÓÉž{ì‡Wˆ:lª$!×™g•[ %ð óǰ£æP”Ð'Ûâ„Ñâ1É y·“Ù(~¼™=†s‘‰Ì˜R¸·Ai•ÕØÜœ²ƒ%ö3¢À‚¡ÓÖ½ødêš™ i]ZÕXCL2\‹[=yÙ´ƒt‚hwP²Š”{%=0’Ñ=Àì“ 25äÎ*H8/9ÂÁ²­ƒc.}ºK0¦·ì øµt4´XÜh):‰ÁBΜñ¾ÂãìxZ.ƒ†Ø0"a¡ ›¼L*h@g O÷è„­VѳŠjò5Š+Ž ÜÒ—kÙ}³°Ý¿_£õXQ½*Ó“:Æ åÅ[Ö•GwìûÒç•´?©+•“чõã÷õã×en› à UZ¬¹§kHÃ}ïM „¿®%<%Á÷™ØßgÅ]˜¹ FPô§›÷N“-ði (Aç Ÿ7A*5tñ/ŠÿÑ ‹`¹Šì jøfV<Þ|9W¥*à”¥^Uó^,ñÜM<j6­€…¶tš®`º„˜§”T²û¹áûÕUîáÒpaà‹ xìÃäR€¨/ÂÜR=X[!_O¢0Ê qCư•ÄóYRèÂÌ ÙWPàC—eàãgéà•,ÒAi"Pé5¶‹ÆdÄ·&“LD„T™h#P¹^ä³*˜ ò7Ò‚€,¿ÿäSÏ5 '—ÂîRB-©!†¡·Å–Gäü¸?>«Âà/Eïsa‘¿¦ÜTThß{T”—‚ðÉreIFÆæ2B‚dÜ2!WŽ¡!$jÈ÷ÀÇGM(ü*®Ùñ{Ây¸Ã°Ý¯åï?Y D“i8€ öx€€Å³ ÒÜi&ñ,Ú”:Sã< á€6íÔ†€:<Ìü@¶´Ë7xTÀ£“ÝWðÞ6üm™¦@þý:篠›ªB ¤/@,˜)égidt¸¤]aœÄÏ  fš?†˜CƒXH -‘‹ˆüçÂwµ^f†Öc¡¥ Êøex4ȧò³€oDX89ćQ›çë¦:=¡f®FAJ¨a‘ÌZ6ߣˆ8ôëÅ|‚e— ÆéE°ÔS75X’㞨…tšh ©A÷ƒ™Ã¹-8»ÜA”[Ѫ-fOH±ðÚL—ãôÂ%uò _ð"k3u+U•&à?0@>2·©3#ö²0ð£jÐi¾ýjÈ3;_z8¬‘‹d,½xl%½=Ù²¢¥+Z-Þt‚G‡XI’ydÂÕšÑ`œíÔ¤-Ú–Ü•Z_û"çH·0(øw™ßŒ·"hD«’/"Á9\”:²P‡)æ79ÿM¦+_O¨ž(´Ÿ×!Zm$ñ*¨{•¡ãá𖆨áÛæ¾DUÙKµrç!_|æt Fb…xt® ªáó¸ZDEúë»&Sâ÷©LwhG š²ÑDvE´ÝsÆ=šqqf\dlßK¶¼\´Ç‰ŽG¥º-Ë–û[ <½»c':ÚÆŒsçù”¦2rHÛòbÒ7°ÐñP/fKbxNxÂPóç*h“à`^§Ðmƒ×‘Fi¶¤ð:åâ“EN')‹1C2NÄú’a¯GkNWóÌ ì™Msþ¬Lm™ëÖ2SýÞ¸‹aP‹AÍ–=˜È"'ܳ¨1R`Ë“ÐÞ<¼x³ÞIlBª%/ùœ‹íI¬i£´’ÜrÎ,šÝDS­Œƒ ¹ Žyõ[¢å¡#ÊSa?Ç=I¿?â6CϺ,Q…nqêͲñ“–:ã ¤NϰyÍ,a)f¡§pp@UÑÞw!Ú9‘ñ¯áR‰«yÀ´b¢H½°£¸&wÎ4Û’ÏDˆ€äFa‹ 1¸ Zjh¿kÙ?\“@’B!¼$ b<ÀvIßô¼ÁOt–„ëÏðhÝ|ða䱺-þ·Šê¡ziÃMÐ`-?ˆ;~Yw¼_ï*JÊú.B18ò8âÞ*(džV3^È,tð‹´š´³ w°‹š!ªÌqHqÂd¥¾@ ‚I-ªC6»á,Èβ &OJZ‚A¨§YËÛ Dš(U͸‡¾wÞ Z?¸çd4dŒ:Ȭ1»`‰°ËDY®YÙD¾LiCàŒû¿siRÕt4Žæz¤Oû5U`ÎûÄüäo ¿0üÿ0߱绩ę“ßžWˆàÙ÷êO‹à9)ŠT uõH»/$°·A<^œ´]òÖû c—剂ŠYáÎùm±)ÇJsÑË™^´Öd°3Ù…jM*N÷×·)RzÊΞ¹à {>䜛ç6tÈ_`ÇR%pÜÃ!—(çÞ?>úöèÅ s’¡~ƒf3­_)iµKë?}pôñƒ¯W×/oÎ>þa%Ž>þ|úÍgðëÁç«ßݰúv±ä~âi¦’{¡†^IÜLñXtßà“Ê˃Zêå{Ø¢Ì~].ö¸õ’ÄÍ^|÷¨º-9Òm·”X¥Q+¸ÚÔô¢óÁÀ*Eš!æF„nògË»bQ:e]}ÍÀ5®pÖú"×iq»`ÆsÍ‘ñt”dKÚÝШ@+Ôïš+\§zZbA"Õä’ciÖÚ£Ö:·Ýe)XÞ6³ÒR"58,„½¤Œ!P$ÙÉÏ9)pÄc¦&ÅXü°˜÷1H+Šš‘BAó«Ä£}Œ¤A Û[²ê±¹+ˆNéz‘ÍCâ2xý[Rë[’çF…2&‰q÷Ñ&‘˜£f•ƒïDJs(2¥a²RJ€Ú- ˆxßú ’oQ´ò˜RÐ@MŒºEòñí8ì<"–!L‰dÏø²ù\º %Xįâ=Õ²¸A;2‘'‚$Ǹo#àÎ8%ö$¦5O?ëA‡`4+Q„ƒ„úÿó­cìK+á¤e h3?‚¦àD.V)’ä"®­£á4ÆLy³r‘f@Œ@1ûEÉS ïí(ö’<°7ºv2kV‹;• gñäXŒY:fê—4I¡%4Í𙃲¥P™ÐÝœó‘Ú&ÁáÄø€î^ð(râD±,IþЧ”˜‰ˆ²Í°tY9Ùá¬\ÌéKsçôU›âôš#ÍXÀï@#2€tSl6‹ûÐ Âç´ ØßᜅaPJ=Ñç°~ðLO°Jß´m¡ ÝÆC"µÛE¼™ÒÆ.î&!ÐÐZ Õ[¹ ¹nŶä a D¹êOƒ.5é'®…ŸÉS*”æi R5‡i{‡³¶/ è|C? yl8Ò™ö°,:3óö^=F‹ÿ$à‹(„Vís¾mlfX8“Y` Ý6t´J]?–´ó^ýäFÑB†"TK_+úzÌTÓê×&U"¬³5?-çÌüöVm²QÃQ¹šÚÑ£4wz2Á¤sB†|ëb‡¡Ž¬Ó$ýA.Î;E0¥<éÈne…‘ð^Ê­^[Ùèñì®õ¤–¢õÎ…,Œ®"‰×r˜ü…–Ìæ•|ð?¬7Ðp,pQ”t’4iR&e‡¥˜ô3²äñ½Äàå•ó¸Ffð;"ëtÌisßL‰¥ñIQ-“B;¸:êøÅŒ2¼ãøCh$Ôv§W·¥>'d†åáúüÞ RâE5ÎkÁ’CêÒ`³aÉb6JT*n”鲚ûù O}íÝjø–½¼Ìê`ï Á.:Ù6pˆà_H‡4ÖÌ=¥É}éMkÛÝm©¡Ž½>ŒEP`ÑÔÎ úÞŽLcäm)P­»/Ja±O#œÒÈÖ;ÌŒ†™¼„U±òHE„uñEf­|5ÓÍ£ ÔßîBÆð¼ÜAÄõñEt2æƒsüíÑEËŠendstream endobj 130 0 obj 5042 endobj 134 0 obj <> stream xœµ\YsÇ‘ö3Báý ã'Îl­®³«üfÉ²Í {weÂaGXŠ0ð ’D‰KÉ¿~3ë̪Îê€T8d û¨3óË/êïwó$v3þ/ý½z{öÅ_—Ý‹ÎæÝá¿gߟ‰ðÀ.ý¹z»ûòz'ô¤´•»‹çgñm±svÒ;kÄ$õîâíÙ?÷æp.„\&¡ö_üY¬Þÿáp®&'¬TûLJyZŒš•Ù_„«Öjµr8—жÔ>= …Óûÿì2yÓ´ðê ¦úðû7á—zÿ n/jRÊïÿzUÚ±¿„Ûbq^ìßB›v™µ÷ð$¼c­Ýÿ¯8˜’äÁ›8c¾Æ&Ý´è%wn”Kc—±óYëý9­…©¿;œÏ“±Jº:š'-¡Íwÿ•RÀ¤LXH©§Ex¿»øóÙÅâòÍ“ò~Ñn?áD”b/šÂ`I±]µÌN`r’jú…G½\4LEOÎÌó£:דÐÞJ4¶´X˜ž„u0rÿ'/¦9¬LgѤ™8y$ìâ E£§j3oòøÂl=LRNbʦ9:ŸÉÏ^„9Âê+ïòÿ-. NñåáÜLZÃnAS~ )q »IÛýU¹ö'£`[%yðò``–°,ÎJ£“تÂ÷±Q;[œ&6å=.̹¶vLçÚ^?à£vZœÜßB»ïë3±‹E©ý]½ØÜ?ׯMZþ¬^}“‡ó,vl¬ çÙR h-*NåE¼ÛM*MPæx­ø¥å4¿Rnƒl‹É˜öþ5vr2û°©pß{²Xµíºq ¥o¶Ðd;Pù‹kPòçØÒ J Á¼‡-ÀuH(±©¯/ξ9û~§@0hœãå Êí`—Ô¤âЗϾxü—ÝïÞ?;ûâï;qöÅŸðÿ¾ü߯àÏãßï~uöõãÝ7C|jÇ›ñIy‹ÍÛÙÀ4#B]•q¾«ƒV^6SZ?0œ“Vb‰ý²sÒÊ4z^GI¶ãMü©´Ú±¯´´ÂÍ"ïm”ò’$bŽ qèMk§¢¢D9Gˆ®¿nÐi”6‡PùªÜIò hˆâŽ£œ±“u»s¡ ùY“A—¡¾ Lè`gMžF|טË ‚œ+i@?$U”÷6ˆžß!PN°³*Ì–´RGRû¼®mLIÃÒŠ+Û줂þ¹„YdÄIÿÇÁpûƒ?ñá´?h')%X™ÿ;€2;22B²äj§útâÄ>‡`öR–ÉCµý£üÆW±1«ŠxøìÓÚÒÓ´„^LãÔõþ·i Èu¡ÈnÅþkÜ5­XŸÐ ÂoYøc°³éºÐ“whã»Ô „§aãö„új°c_Îy5Ã{4\ui w´„Üì1€YŠpâÄLä&Œl&«fTón¥Õ`â¢_•_õÚ5Ur¼¶,pŸ6¶ÀhØÞŸqvK†¼ ²hÇjct7jgeŠÝlª>7û“¬¤R8®¢FÚp‡lc¢´H÷nÿí¾´÷›üà·X Œt6¬¹#ã¿Ió6d8ϸëíÈ&DÆÙÀûÀºdÞa¼QqqØ$-Ëê´[‘Êá`fž¸®pù3®·¾'ê#káÇÆVÒÍR²Ð'ËíÄqŠˆÃÐxÂáU½×jñ‡dƒD<­›”'ÙR“*ÝŒÀ U`ƒkDúF^šf$¥–lñ-ŽOOH†¯8à©û>Ä)`eId()÷€ÃáB뇥$H“°Ã·¾¨Xý$ ¡Z6pÛœ`* 4¤†…#"NDãƒDxž%Á7“Ì‚_E &­G|!‰hêNZW—H´ÂÑkáQå~R¾"8–U Z;JJ€Ó dÄd»Ì)Aƒððò&껹' ]ð£ÎÁ<‚v62·ÿ¼‡`—ÁÛ„5ÑÉþ†=ìåÊ ˜ñE½ÿ¤¶L%g!R¼Ð(;€,Zc2ÄÛz ð38×HüÐÅR‰š,ËÀæ“®ˆ@2^ OPXµ±ÞáÊi=0C#à[y¯@^P(Pq ö7hž»¾¬®ÊÖulAKϳ`ʙӪò6 Jöûj ȃ¨. 0ã»!DfÆÝk–(TÍ`*dày«ECéfy8²Tf‰^©"®; °LBÁÚ‚bº7Eû$WDa_/Ùô‚NÁû´ !¾È©;¯D–°°,î²âYþÔ,²3ŽÐ½Š`í–i±Å•‹$#i·ÿÛAÂKªýÿÀnqî°%¹#4¾ñŸWkÁì‘Ųø yaã6›PÇÚ‘!-Isj1™.œô.p*⦅s‹n)………­É{þ©Ä¹#[Ó47"ÑIA‘J¡‹8q`C(!QÈVÒFv\Æ(=÷K2C»§·ŠaÕ¯MvtŒ²¶YÓ2ݾŒxGi>Ó ‚ß ìÀ?é–ô.bîì8¾ý96¦¡1ÓÈK˜1Ыft­]äÄâ£kÊêð‘âÃ×ê’„¼(@¹²òŸê5ëˆÃa.-7~U öÁÍEœ£¾sT:TN Kó:•´ËB%< ˜Ó’.=Þx™¼(@¥*á·±aéÔKŒ¸k7H/ tØ’¡»"L ÿˆ^¼w š±"½r,DÏæa2h–ïÚ"íf5MœF`ƒe8ÂJžö&e…õoq ©Nu#“fO‰paì"Ëp :EûIä쮚öJ ªt‘«Cj©.õ—[ó|›Ì¥‰uSbI+hXã —0bU¥ø´ˆ‰]GÞ»°H1¼,ËcBÄ à‚z@„‘T±Æîk'€È0b,ˆ))Bìbè­ñ|¦Œ§Ð‰¨ÕFÔWëuŽŒRYo·Üôh¬5pÄÚf­;šcÈ–ä ¬#³øÀ¯ãø¼ ‘?V $»D#sÐ5ˆú¿Ë¨ËýLLÄQ7ù¦†¶\,’wQ Ö\´ýIUBò$Êè Ht‚_ÐWý_ÙIÎ#(6¨E¤åÖo;ëÅXͺc[£¼–Œb̯oËKÃZ7r£u QÓKcwÌ‹6­*~i†qÐ4HïÛÑz­tPâªK‚ÕÙËÍ\ : £ay,ÉÛÙ÷íâZà.hŸ˃Ž7×|il¢V6yK1̃Mdñ½ÅÛ†r6ðòš¸OàÆ-Ð Ê6‰e½¬BÚ´ ÂEgÜnêÖrM‚¡„Ü­Y ã„é´œk(q๽@ΈÑ8íÂâ…xr¤NÏ1ÿ«‚[q•a„h¥:Ï®¥{„~…¡A#k «†0Qô°t`ÿfºSãØIœú(qMÀ/EÝpѵYÆqšä8àºa ˆ}†.¬f˜8Qg<j"#‰ë„%¼+L¸='Tß^I*TUVÐ  Öm+ÐÎusãˆ[i%[NBCO”’¯¨T²,• €§ä퓚´ŽàD°×-ß°òZw ØJ—Û’‡VÆMŒ±P˜ËÁFJ;u&»™•C˜‡à²Š^Qƒ§)Å´’b­Z*"¼+j|•^Öœç ÅÆ¼ëXd¸ÓÆ"‰gÀÄ]¸ðÎMZ}£ÈÝÛœÃO£nYÃq4,Þìç)×+›8mvùœm½9Á·êB—&¾í% Á½Iô¯Éî‡#¨§%NrŠÀÜð”t™3Âk:‹›óë* 4”·àh{lH>¥é#¤Ö`»Ñ4íúé’8æS^©H-Ÿî­=!*§ÐmD @ˆx`°rÖ2ûec!Tðºýµeã((¶VÛ¥Ûšµã+ åœ?ǼmÍXüè«¶f©–èåŸÌÙ8¬Ë‹£¨Xâr˜XÂ6ôžL­4»_ ›ÒM [Ÿ"«.N‰."4ôܶ¾:0Lk¶$ˆG©öûHG‡CÆ&'’æ0´µÇ ãÅ(Ô0h¬]÷Q™aÆà"ñXYy›!éË|šXÙí¡)‘hÌ¥´>x0ÿÚpºw~ÀJZ©ä/íaå&AË,¥%ålüLÖ˜†gÑ5M"p¤È«¢J´wÄ„®˜6ÁŒ{÷¯rïŸëàݧéïJ³¸`V„¤5Æ F~е¿Ç(g\ŽÖ^ó± .?=ž9ŠÖ0Â2£æ”8•·…U)ÅJ*{RÌWÏ1íè)WÁ*I·¹±ôçZ2É–µ¾)IèT.ž\ R‘/^Õ‹·åbÑ]½ýŽëü®õïòE6 Fû·‡²”0 àÙ¹ý_‘Ž9?/ó€·Thž'%E+~XQC;L é3]_UDÔÎóÕq --èÔ\94m:òQ»@eŠJ„ÖËά×1˜-HecÖ¬³FãqÆÂkGƒ E†¯[-Âw¬e’5¡S(­rÕ¼!û7÷ËxÛÌ.iÒ»£˜}™ôkE 5S Ÿ+¨,=ÆÅ §%àé î=€c>ÿ6º«&ž»°¨%GS/ËÉR,L´cƒÑä¼ÚeýyqpËR¨d¯— E·ñ2h%_‘x6‡G¢ê'”ä‘ÖÈ k0ªçKüI…vã7þÁÕ¿5µõ²õyˆ¿Ž~àÚ Ñ”ŠÇ‹ÜcûÕ+Kê¾ ok¶Úµ²öä¢ÄÄÞG†ÚúÚt²–9Äœ¥·:¸,­”ØHd:OÁ8¢Ø'Vs¶u X-NU£Š ÓÓFÒåâúíj¥c¨¸‹+ÑgHnÖ¼‹z@ ¤n0ùçï@wŸÔ‰Ñ|Œ2ŽØ¡ˆQL‘Ä8 ¶Š—«¯½·2'[²]ºNйî™]ÏŽó‘Yè%­Þ×{q²Àû2ÌôiýÙpú%kÙ6æÜŒ;êlŒóª­3J—†uqúÙÎyIëÚµÍ!j’û/3ÐíÚª!•Ëmnð·‚(‹ê„ÚÛ4ðA¡W•6~]vƒp¥\'[È+ág-â6îô¨x,”ùšÖáužÊõI—RiœŽY´å¢$®Íѧ¹üãóôƒuˆIøÐ£âTÜ4‡ÞÒÅ÷ñ’Ò¯éÈ;¬—“ËW<0Îë&ÕÞ/¹æ[Ç9Ü÷Ó!„t¼£ñÜHþý¨¦cIøâ‚ºW©¨DŽÔ§Ærð'q‰w]Žs!Uî]›£§9TLòÝëÜm‰:ZJÍâ$0CìaKOa6ã S“Ç+JRÐ&ñÀè¦\Ötì~ɨ5kκ¤’Â4Í2Žã¼:r„m#1åôl®ÙýèBjƒÃC|Ú€_¨\ ™¦±âðÅ›Eoé)ce^›šjÏ~‘Xt‚b-¢ÈM¥-Cm¬ØÃr²¥«”“ºÁ¨«©1PÉ×+o•57Í”«µÒ]-Ø!Âñ``™{¥;“–+š·à_Ghab|«yU<±)8ÕWÊ¥½÷=Ú£ñÃ[F¬«¬SeûÑèDÒ¤âfõ5ª$ À}™¡u–æºTGRùÜꌶ€'jQöC£è°§liœ4¨²Ët“‡­|­å9Ðý„S 6üÌ÷ù)ŽðKçÃçî™ÄgB”]p”Î6/ºfÆíÊ媢8®’Û°8Ux} _íËÆ¼Ëâ¤jšuh™)f-5«bu®˜-À"a64F§Ô¼wSþ xµ¨Mù)“Q±ìú“0Ìü1Ìt@‘È9õ}h*­Åù©9BÎ}&;g§C*[?ø![à¾ý5À’é¶î•éÎ階2ŽŒšƒ>á´hx¼;žïŃÜ/¥„y;!]¢† …KÑåWf (·«aã ˆw.ä%á¬kñÄaS×."mœŒ®blðãpRR²@#ØÓ.5ÓáÙ{*Éà éî¸ 1ù÷ÌêÌ|[v;ÒÁ“e%0-åò±I@íM Õ{ +¶êù…Ll2B9XŽúÀŽ©†šŽ¢4_ô‹Í|õL¥*1ˆOBNÍ%4£‰ïR$ÊéSÞ²‘hÝ=Æñú,¶V›ß‹ˆD½¤* œñßP2ÆxT)*9Âìt›-ïüÇS=acè¬IJbXyé´mª$½ýGœ®´®¬u“V%…=òR4%]«Ïy¾-©»ýoËÕ‡“¤îBÐZ|šÔRás)G7ñ )Йî8ù}“wù¼íðt俲 7¶±DXìCNdÍK8¨±…]ÝGÌrܬ?%âvŽ}Ó*Ô(>ó¶;ôùŠHŸÀÂ÷áDšÁ ³¶=ÙÜj±^­F·q|3Ôæo¦à7a‹Ÿæ"Î\DrŒöMƒ²Ü‰ âï+ôݬùèÒxyô-ï s„&qY¤:ñeJÎ91X45S‰Ðý6× @ÃÑÀý=Ý`=ܱx/%A%ØJŸk$›$1‚'™»qüˆ¦]_ÈÉ}àN0æ6ÇRxs?ý«;Û•¾½Fd•DIÉÁ(â2viUæøb÷u*Oª3ßm ±QÛH—•9Ob=kf»»ˆ £5QÄ¡5ÑgOŽù}øFÖ[K·íå5‡ÕÓ7Úæ†¸“ÌÿT<Ü> stream xœÅ\[“·qÎóFUù §òÂsR:ÃÁð[äHSNÉ’Öå*›yXr)’%r—"¹¢È_ŸîÆ­1ƒ™3G$-»,­ç` ðu÷×àçÝ8ˆÝˆÿMÿ~üòâþ÷n÷ôÍŸûüïéÅÏ‚ìÒ¿¿Ü}u „Þ 1cäîòÇ‹ø¶Øy;è5bzwùòâ{s‚Ó~?Ä ”b/G!¤üþ[xæŒnÿêp”nÐZËýl¤Óû›ƒ¬3rÿœÞu¶>yz8ª †Ñ¸ýׇ£”Q^í…vF9§êoà1%öo±0£Õé×`óJêщý7=í<ëâEþ#Îl´z£Pöÿ.ÿWÃÃú a WCŽƒ!ì.ÿ|qùÿØÿ zt—àÙáhðƒ®4ü%¤„5,†¶ûÛƒÁuP~ÐFÚ¶I~ï9 ìðÓ3;Zœ¹á+G·¿ÂÎ4ýùE}éE~é ü,Ô`¬Ý¿ƒçŨjŸo°)ÞJÁf?PþBzh;~y {ü#ö4ް±Ïa‡  \ìôðMyˆ]}}yñÝÅÏ;¥O˜9âu~g` :~õàâþƒÿݽ}}÷äâþßvââþã?¾úËá_þk÷/_?Ø}·ÏÉ|<¥–q˜qp2ô¶ÌóUü“òðfÃä­ýçLÞ†éä»+ÿ¢<|ÒL~†Rh¥BÙÅ/9vjÿGB† …ÿrÖí€Ì>Öeýý‡Š±Øþ£@ªe°& Ö ÃRi@¦)P7jÿš„Vé Îs›ëÔäá*¢uzÿËÁ€Yé©MzÙ ›°ŒNÝŒ(çÊÞ½‡v&¢ÉÖØõpœ·žu𯨫”±AÕ¾ØHå¨ *bT¤QèX77µïWñO jå®>RfÆ€»r”£‚ÜQ, lmF’]cD#» >ÌÀôÄÅeßÅÖò%þb­w–ª 4H¡ôãÛi'òÆ]ã/õOѬ1kxKÂ$Ü úû÷1` ìSÙ)5ß, Â¢¶«ÝàŒ ضúómœfðQOÞt´Û{l¶G®ÃkI•â³§q‘ÇÑϰOÐŽØ÷ ùCZ·ºv ûá¬Nû{.ƒ›²äõ5[SÚ x˜†ñJæ!¤õ4âKl¤` é€OëR! ¹ŒD 2à>ÆNÙÐgW>Øîþt8ޏÎ.X°ëGíPÈ _góA#ÜÓ·Þí(‹ á€.ËPþ¸=(ß5Y­Äù£í#ÆÑ &p¦Ò:—m«ŠÙV\_…ß%²ŽÀ•ÔD:æøxU‡»«OQ*„©Ø¼•W-LP¶¥¡I\µßo€Ú8²Õ¿›Í')úºQNA¸ c¹?¤Ñ’‘P¶±>vPÈeŽ8½²_ÿv0=“‚bãì(AÖãBÁn"J2d–Žï‘ÖIsàÄûŒv¶33áO}äõKo&J'SpFnBp OP#«Õ=ýª<›kÀ !bŸ–‡jËçrÒ[wc™‡l÷¾?EøÊjø—AnëÈ/{´èu‡YÐÞ¢ÿêMìœ@ÞrÉÄ1H ÌÌÄ=Г7œ5ø¥À#©H™<¦2’I[F¼߉~ª­è¢€HõˆbÝ€,‰£6ž¬Ú½¬/xG Œ 0Ñ&/°xô}Pûˆ¯dû8ó#°Û›Ô­j€MŸ?†>î¹*Ò£&.…ëÙh¿:‡"’èÓU‹§@„Qnr’=ªZ׿ÁIP€J°‡ˆS´0ŽøÎÌ‘Ùg2ËÁˆ¤N—LËóEÕ™/f쑌Tšnk£N:LÚ‹ê9Q„… ¾ÁÈU]/Oî%ÐUKö©°ôµ£ËpÍ«Í zÕêBìÈ8róÕF­ÁÒ ÐÅhO+»ôYW‡¾¾ó°àyc‡¢ žVñ¡Qwc >?|”ºƒån‹«]óIX ?Šùtÿ¾:^¶éµ*O¿2Ô3²ŒyÅ]·²a\ŒÈ"a>Î#ØUv·Àê‘×bPeKö&n pÄ€Á™ÇÜÄÞ°Ò|wµíãƒrÔ?î¶Ž60m÷Q:5‘ƒOh½ÓìwTzB.+½Ü·Ø–T­#Gì<%Öã™Eµ´®+ß^ ±k¸RyÔ™2“ܸÄœ ¦­²O 2ËÞ p›=døFgê}êHÙŽG—¬Ç]× Õ/›í )k˜²EJz.0ÃZ}o™1B§âYE³Ž Š·üÎ}èêbç>ok4 ;PÝ¥ìZçi}ëÙ2#¦˜žç÷˜4´_­uÏXÇq«LÔ.‡P kyV_Dª Ä€úx5cõ ˜:¾s‹Ëçv´Û(RkÖYcU¢sÈe#b-hI}R¤W`1ˆ‘+`œó˜@•a“qóW­}ëºô7É¡]¬P¦áquŸ¢LT›>¾GX:K÷ ³µóÎkWw-Tq„wçA6Ôúm !iêäAÓǶJy•&¶¡â² áÏ–ï0gØG`3ºÞ7 uULBEìÏÖ£‰nqª“þ™Ù] K²ýˆ#⨨àטt—µç9ŸdU¹á½üë Þ‰_W;}›¸´œ(l䦧TcÔC°é÷ÊÃj7Ù;9¨(KÂZ÷Ôþd>ï*Fâ9IÉØ/=”þÏŽŸÒ ~ΰLÁO3Ñ·=ÍÛ'ÃZ˜ã˜CG‰ÄïçHÍ!‰%§"/ ðÖr¶„”¬‹àúΗØ7úÑž“¶²Óè‚ òi¯ºžøÁΓFo;‘‘…¬šgä}SœƒÓög½ßnt9ÀÖ×_Ûê°ÿ%͇ÑAÿ3®N|\ÍXÔÙÂMÅàÇ (3ˆ°äIYL¦{$Íæ°”ë(X;"l€gR¶óø,Ý_7à‘Úx–À%MÀoàáí»Î¤Ð’©@ö`q]¤‰‚‹¦ÓDò¼K¡YY³îÞR#2…F΢Õr|&÷¹ ZòÏÝ×#Ë‚6ü ØEïE£rW9ûÆ)F£’ñ©b95Œ EKQ«ÅeÆà 1a"©pøù›ØvLS'Aàð+ÍŒwNÙ¦dûrDŸéè©Pó—s±ˆ3 }ÁþE¬îãÿ¥`,›TÅ:ÑwR{$+åWÔ„wQNó6ùáMyxÕ‹G²‡M`¢D;QR„Ãä"›í¼ŸÛ9qZô•Ö;6`nØ”ÞÇaÓÕéŒyîç9›ë'?|\ÞïÍìIðMïç‡~X´|U¯¥ÝÓfñO´Hu’¬ËëU%zŒ#œ«õüõµâˆLi­d¢Á£ËŒtÏ3ÛʡϺæµÉ¦¨²Û”HÄ0r{´w®ŸòhM‰1Ï!o oð tÊÖg6Ò¬ó’Ë×¼Í6%ü¢)µ˜à,FŸ¸äç?߯¢ áUãÌÍŒ0à¶õ]º^Žý…ÊVœHlòpHGÆ×§€?MSŽp–ÀÈdpCþ{âÎMÁàóÝq‹;“.»3üÊwËu/ñPXÚU¿@3¿ Í´œò9·ûÕEùÝý‚• ¤5ƒeé½7Å2ã~2‹r³.MX)u&ÛÖ“agçºgÎî:-»3rÍâž@ÃZ)Ê”IYÀÐìEa¡Cá~ÚÒY0êtŸË¦œòcÙÚÜgá²>±ùŠ­ !¹Ž¾¥w>Y„ÃbV³-b 6ÏùÁ–ÐÜ=ž,žŸJº8­¯÷ð¡õùˆõó‰7'Ò€ÒÁÃ}Y﫸Þ+¾r¬42m<ÂÀòÌMò˜r7ÏÒêûHù­§pˆ© ±)øéÕ¶=<$±\Ÿ:#%i:õ­…û$IüȤ‡1¢ÕM8MÊ O%ïW f ÷‚'qô—1‡cM¿L„wÒUKóôM'îÛ”3d<?/Nšçz1º'¤øíJ©–è‚‹ÿC>½L‘IÃ̳üæ“ïáKŠ.ÏÇ(¥Âüë n.¦˜ÒúÞÖÒ„¦ÔrS)fšÿ¦Èº¶ž(Õªf§F&lÕ•v‰1Ø{Å.æ»OE¡‡™]ÕXæݨ›`ÛùêQ¸FSê?æ Nç‹´uDŠ…ÉE·º5æt&˜ê&v‘^eÀ^fÒ!¿ yí<Ëyåü¥õËùKöaÌŸ¨M™–˜$ø'zÿ:­`*ÈùÍâ ´Ô´2y¦B °d«}™*Ä€‹ßÄ4=z5ðѱ¾„k¾ëj:Õ6Ó\g~ £ÖAQ¹Pi2£Ts@EJ%ørµ…MËš0t*CµȤ¡yzw]E€I`œO§ê1‡®Þ8Q¸so•˜ÖÆ>ñ¿@¼8“¯½síÂBM휘úYð€ýIRC(T¶É^Áæ D†'ºzV #›ü%X©F™ðH€¦²ÐÖ´ üPä¥ àUš6ŸµÖ†¨¤Qó)#f—+Ú³ó o.UÕce¶0­W3nÝ#è]~3 8tå•“ÂZ ~¸…éˆ&¨f5ù_ÝrY˜)K}.TpszÄ´=–Ý¢ÿnD[yS!1qã°`¿ú¤r¯6>Šr¢¢°àdò±„@W®`U,ãG´Fás:Ø‘€&¿;(b¦SõÏüÿ–]·Gr¬ÅL0„oK.»Œƒý O nˆ“-"1«iý+JæyÀڼ̤wl¥ÿA›%.B¨G„è| ÙҜÒ¾ÖÌK´z®%K;q8Îá6a19˜ ²¾¡@FIèÚ„-µ½ñ+ZM|Û~ïò!šX·•á:%$^KÊT!]sÆbjÞQÿÄ2´g'¨ß?Ù M]ñãaõµ_{yhVå•_rK\»)dJáð³ë&™«I±eQŠHŽ¥Ÿ]¼ñy¤|É*l™ G@)ˆˆ[¾Lá Õ8óŒdÏSUAž"Š— 3u?M¶Ù&¢Ónb @ÿœR*1Ö±¢\i2eI3Sq2x=‹ˆ©’²QÙÓ’‰\÷®â1ªë)0YtNËi¶àg¦_ï–¥¶‰å-W^2o$ù˜¼j §Zë)¡»º$æ!íï ?ƺ\e ú‹Rʧ2m„0÷ùK™Q^´æ\%§ÇÉèËL`kyÔR ÊDètaVÎs±ë¥ãõeóîbŒ5ÝÉÍÂy"g°ZDÅΟ²Á{i¦îÉ;Ü®Fy™ãè?öŽÇNA–;˜Z\©íî»°Ý"1…®?À­‘­È.³í«J–Ž06eꈯ|ðØø îî  Sö‹—dáÑË/ŠV¨kEÁv$Ê´Vk€mS>¹VÈ ¥/•QÕwhð»=ÿ@¬k–§¹gâ71\ îlÂb5yùm9×To®™4Eƒ[ æ¹fεØWôsï y0¾ª{LèjhÅN}þ!7å–Êëë‰EÔ4+<•ž²Ð9kðí²(Yd×+À§gr& ‰»jæ;f¼u˜b%œXÿùɘ&v°–~¶ƒgy1* {^‚ØÍÑþuc¼¤CŽFùŒ×iŒ»‡aP)|ª»@”øçLéB;ùzb—•ÔÔ‡¬–®¦V_t>³›Z…V,1±¡LrVŠŸË$[”†"Iýã†`K?óÈU>Êþ¬=…§Æ/XB¦g&'é;Õ=¤À¨0Mq©~RŤ¦tëÏ¿?|x0ŸD‰`vÅ' !¬šÚýõ° dÊã[®|¯ä­/±ðL·§ÙåE¨Œ8',TîOøÁ"hßeÞ×ÓÕEºðï‡rKÇäÃi¹`4ùm Z·ÑsÒÕ°¶oàó12Ëwà?x`ˆ\f¬Í?ã&˜èf®ë9å0G÷² VÛðqW#?ª)‡ç=}õìT9>¯qZâõéJ³ì.uè;ÀØäá!÷åTR`—|ŠŠ-cölî`cÛÖÉÏלt/I×iÖÝîÓWå ß8 Ë/‡j±šO|ƒmïAƒ3îÊ¡w„èûú]Ä‚]!Ä>*ó[רúxÜ^õᦫ€ÙS\pbFÁ¯:¨RÏÁr,[ ³ó¿˜N1‡¯ëãr1‚aDµlÖ”; f¨-ÁÁQR”íôä ¡ŒÉÔÆÛé\÷Ú‘ÃÁ±T¢ýdÅäU}޳´*V7ž}–VÎÂÕ=]ó@+tâ^4¦wðh3²v™èàX¼{±—c›—°b壎¬ªÑæ¶„ä 8®w'Gh&ðíámú’Ö[_áç;î:ÊUìõ}U*±Ô²á ¹"¿oNAqøn˜9Š·•üZ´&Hî )ºÆ¹§Ä!5>ê©£2Äë;tË¢[›ÓLKù+?r[‚xú>A—Ò™ÿøh ÏWÉæó²µU66áõ/Ù—¾SÜpLó[½Ð¬ÐÒõJÅYÅKïfº¶Gé·ÇOgÇš~ý&3®d4ã-GîÝ~Ñ}¾<3`ꛕ Ãô.¶dWåð$¿5.aubÙ§Féç|-n‰Æ +›‹AzÛz5U;`3ÝSpQbÔ“JGÕIaưºåŸgÝ|nÈj°sÚ';zu(‡—–Q Øöç/£4±l-$áPçKÆâ—‡xï…X,'f6B@{>Å…ªRºPõä­fŒ—ŸÅ4æušÊ¬eÚÛ¦íK›ëK|hÇ!×#åO4j9Êa¢“1¡®´9Å]¹ñ%ã\G”¾¨¥ݳÎ]¿‡yLù‹E[˜°Ôn.ÑýÓñøÅCËiíµî9¦åDt7~–7N”|Q>1Ýå›§Ò¡Ý—®Ó ™˜Ø6»@!¼°ÿ©ãŠñÓ`ï"¬rŒ~×­7ä÷S ¦±çq½º¼îPÎÆ»>ø[^MÊlÓñí&@k%ZW5h "Œ’ÊÑÑq.)W £è( þîâÿ²ÚÒÀendstream endobj 142 0 obj 5222 endobj 146 0 obj <> stream xœÕZ[o·~Wý#Î[v Ÿ ï}HÚ¸H&m¢?È>²¬Z7K–ëô×g†×á.÷ÈŠÕ¢±`{Åå’Î7ß\È·6ñ ßôÿËóƒÏ°›“›¶ù+ü=9x{ÀC‡MúïåùæËCèÄ´Lžy¾9|u¿æÎådÔÆh> µ9ìjk»Åyg°Ñ€N¸~· V.­7¸ ÒMJ²:_㢹É`‘ÒÓ‰Š,iW¬Q0D–åb|~øÍð~’Þƒúw n"\üÚk•Õ‚ÃZîÂÎ6i^¼B}IØÐ,”f>ïö&{PG$ :Šê¤{y>J6IîÝpÛÌšWVæA¶Y‚-€Wkï¢ /â®iapdáE™ ’¶Ui—öqYZöîUg~»Ã!ù¤Lí‡Àb›È$o‰o[àæZËžA>#ûå`V°ÕÛQ†99QfÅj‡yÐNPÆèƒ¦ŠAžU{“nø7|€jñ¼&/ã^ÃÎz¿Žñ¼x²Ue Š·Fþ“°dTž~ÊõË)†8É¿ î?ÿAxÊcÂ:ø8cù–àhc$¶Aióã«úxZÏêãq|T2InÝÕG2î»úø¬~FÆ}Qu}äõQÔÏߣïóÒwdÆìÂLVäùy,:e[ 6¤˜žL´ ÃDì|pá8+êFVÏæ Æô¨KÏB_3qáz5Äë®à—åÙĪ{¨f‡Õºë.Tä¯wK6†Ö»ØúaÌPË`»9ƒ`O²y½÷Ùýû)®EGŸâ¬ØëS”…"DÀ3^ÛAH¥ý:·'Î&º´àÀÒ£0ÞÀŽ»øfO(þæv¼FLRl€ ›++8 3¸bÕÛÆ¸Rãic’š{ð¬¹7½¿¨ïozôz—FØkå<;2ç/Íœ©ñ¸±K°,pÎà›¾=8üã3œPq¯&ÆÑªå`êÛ2‹†ŸR# %Øo];èž-ïbÿÚɘ¤±0k-’FíöSEûoèê!åE!ÿU…”(¤øë幎«ºDY𘷠ìŸc ñÛd|UˆO½ì9åw½Ý¸('U‘W¥ñ²7so7²Œ»ª3ƒò¨ß± ®‚ËÃÜ\ò,iÇôðe\¤iÒF’2¦–&[WJ°‚”ƱÚt­bP1xƒé‡›çN§5cØ ËHÿ6i΀-ýS^-ŒR¦t§L©¿p6Ä;4þŽ! ‡§#&R° ðGæ0·ïÇ40„SûS%œÇbžï:‰~\›_ÏÆ\¬Z\¬……eéïCë¤+Ÿ-rFæYÎŽ åçÆÂ…„ÅÌÿ4bÌæ”¾Ã…óFþ`,0 ,…‡ï€¯È®ý‡C®Ö± à ¦%]âýM0Fî¥Hp5‚Ñ@µJ¿uËȬTkéf·¨ Í+n!ú7˜Áet¢1 $Xåï¸&€ óÏ5•"†ÙX›°,թ礶Bv$l‹Í!*1|‹ýL¨Wj«X=–EJ´:”õ–Å»úA}"Ðb7L|Çz’ÈAN€3Éüï‰Ü<ó} +µ‡¼Ô6:¸É¿$hšÉ›ŒÌ¯‚5‹j´v”ï{Ô¨˜ w„ÒÓ¨PâüP›¾MØ Knk`KP#Æ U24qaå·{ð±î£ ›yq·ŽDÌÓa_á\˜ó|D™8#̃… Ê`À´“˜˜Œ_¶¥§½ð®ƒâÖŠÒ+´K@œÇAþ&wÞˆÖHIÜ·Âj¼$H(Òèä”fÃÒý²ŒK¼{’[r[ý.­WY‚ºËˆ¬I“l?®ÊÁ´ïIé#Š£Ì°R!ˆóDÆ5¶üÙ5ö&2m==ü2&ÆÚ&BØJ®—õƒ²XÌ¢•%ÆCe)S„×H «AެCŠ©…3®æT‹ Î êpÆCðàé»–Ñ- á¡F`—‹P·í"1aÀ;] ¬P+B±þHcñ* UâÕ¹ñ"^  MæC»(-‘½ß ¹à\°î±Pr N R G[:#üjᙵ©„£R7HÁkqN¿!2ô^öÓ'Rú¿K4MЦ!³æ‰Câ¸Bx[BGëÁq˜>ËŸä‡Ïò%IÓ{²ÎìнŸÌzv¶ŒÖg7ypáLÁšsC ùÊ}¤|s‰zs)ç$šçƒZç1Ëx^dµˆ¡ ðý|‰l ál©~œ6Å·Ùg¼_bÉXß+é ûbx?èiL3=ÉÚFØ«Cж¿“bã=ƒY?ü ƒ_bá¢I‰úW!hy!Ô µ_‰`g·ÓZ­w9IÐõ’mÀw ]sŠ.3¶a±ÌqÛÇšˆ9Ø_Cž—ÕÉGo!‘¯*²/Kô¾s#%‘*T•b9ªCM½ä ;|¦À„[X*§|¸§BÝS‡ÄÒéyð°(vëm°*]  o§‰ ×âvZøHënƒëþ@¹YÙw._øÊýÈÞù\ssmy­\6Y™•Üóè²\¬‚>ãT¨ý•´5íC‘û陜uºáF2ä‚áënS¼)ŠvSÌì𪫄Y %ƒ­ß;ÒЂÉzúŠ«Ž-¸A¯žá§¨E¼*&ƒÇ»,ÿ;ç_óðóp _„î‹[0»±sì|^É€zݽˆPµÉôÑHŽ¿„Áèù9]lîÉV5Ø;]õæüÐ[çY¾Â£èÉ|{ß&_„;N×#¸¢Gñ׋Gì{ÔŒ\†øxå] ªŽòÈE>µ§HϺ§¢Ñ= Ì¡îåÿ‰îò>„Naqï.DVZ{"‚IÌnlk/ù³mtàšj²ÝŽÙÍÎÙÅÍ£¦¯òXPðŸ±mZJ³ã ¯WÐá.Ç·t7y§yºt,BPó¸¼ÑwàëI¯±Þµs³„@:˜ÄsÏëÊ*bÈ}ٛʯëûãdî~&¹öšßÀ[Jlד.§©½n!•¨æ´‹Ž–jf@#×…#"æ`§DÍ7ï…˜Œïv1ÀÿSk\Rx¯ÉÎÿž1¿®c–ÆÓh)µXØçYO­«ëÖ¾iL05^ÕÆ.ßw¯CUͼoöµª+/™Ü·îÈùŒg¸Ý¬vßòº«ð£Úw·‚ª°ùý­Àx} /¾úD "=jìÿÕáÁ?àçW÷endstream endobj 147 0 obj 3253 endobj 151 0 obj <> stream xœ½\YoÇ~ü#øæ]Ã;éû0_ ˆ[¤(SŠI.ÍC’ÿ}ªú¬îéÙƒbÃör¦Ïêª¯Ž®šßOØÄOþ“þÿúúÅŸþeO.ï_°“¿Â¿—/~ÁCƒ“ô¿××'ßœB#®N8Ÿ¼Öâäô×±7?qfR'FóI¨“Óë?¯ôšMÒ{«ÜjZóIJÇùJ®7œ 9¹Õ똴WZ®®×jb\X¿:ƒ_NsæW—±·võf½‘ŽMLúÕ_à½VÆñÕ»0¤5««ðÃh·zXoÔÄ•7ºÀCÏ-_Ýá4B®j—›µ˜ŒÕ"L¢Ú½:ýîÌÀ^'Ï<Ç 6iîýÉéß_œ~û‘°è ˜³vÒüÉqcZÀ>VßÃzá±–rõ¦ô°‹““uZÊØd˜–ÆÂv7ðÞzeW¯×z‚} [*é`Åeüøéœ• IôØYѽ•«{Ü3|õZ!Wçá—Z¥·Â*¤$l{·wº-ôñ†‚‰7ÒCcåÄœâ¯8µžŒPi ŽiZ:8AºDOëÍ-/ËèeEé\wFz—àßpøÖ"?½]o4L ¼†üâBàôpΓ6¹Ç©´¶À ·¸(< Gš¾.¿ÞÁJ`L‰[aH»ú×$„0°üòþ&N TFúÃK8i$ž ôæí’`!vÒ@ð›úôl­0‰1Ö„£ÀA4 ½…78½®Ñ"4,{áu¤36¹\Ç™”›´É+±‡ }=P÷üö LH$êxí—a'ea±_· r"u쫼µ7k<~É€ÉéÀGê‡÷ÈWgukw(ì Í<ïïuþ‰¡™ÏËÀ-Xíe\-þi¹K ð:.¡B™I§Çå#<ÖÞçµçl?ãéß• ¶„ª9üvRàæ7i÷.ab&"#&þÒš<䀃ÚïcŽÜ¬²é6>dÌvÌ!™ ÌX…ä#ƒ:@¢»ò‘Q«$Õ&u`)òéA /áŽ(iŽçG¤ªóµ)SL¢ÄJœÉ<‘ƒV"ÃþL\Çm}C~n,Dm¹¹Ž\¤C {ô%ƒ2mÓyÜ&ÞM ¿2—T<…²QBøÕiÄeŠëmeÁ²Nw‚y[U¶®üW˜³neÈ Ý^pä´ª¤î¥HÙä6°rÞcàe¾ƒ— |K>ì:äˆÔ&ø— "¨‚ žˆ ïGÐM΢2écÅsÜÁŽäöÊ”BhcF‹Ä…6.)Ì†é ‡!¿*°”屨8³tÇìÕP¦€AùvËLhƒ"ŒYFJâ-­7#HÆÑ5Ÿ’«­÷DÑ#[C“¹š.73Ôâ= äf-GØ^9ö³Ê¢¥YFáÿwžû£°:±vˆ‡FÄ;r¸JÖ(`¹IpýéŽ44ù¢#ï4G÷^£Ùazu@Ø3‹Kˆg†ú„¦æ9ùxå—Ua&BˆVdfR/¾ªÇ@Ë\Ô³ýeTåç>áC ùu—¸C2ÜY‡º­š2€éJ›€|°½¢éŽéK«aŸ” ·‘’½LûĸtÌÚŸ`xUÛ ›7"„k†¯&J¯®ãQ'Èoçe!R£UÛzF†©ºýËÜQ”†½ y J«±î¨ÂÑ+‘´Ö„ jIÌQM6ò;!üc«/âÚ„"q>4âñ ÃHÀÞߊ¡]YìaÄüFs»z¹ö,Ûåaí’Ï ó¼†¹ÉxÛHC¶k"£»¹ÁÞCŽÞ@È‘,`W·‚mkÇì^Äð† í\»D1à^pÏ} *bCèE*³—Îï–žEum„­«N ï:äOˆ…v a³jµÒPa·C¬Ž“‰wöÕ@aŒlr‚¼r`k€©â©vÈ’É®†t­¬©Á|‹Mxà®]X¦˜Ë^gØ`â-Z>Út#ƒ‡¬œÈ×Cj±2w‚¤`=P~_ã|è § “ LÔèžhþv¸Mt2«?ãRÿÀjæ8 ›¼ÏæU0ô+W^‘_q>àŠù $¦Yqt«Þâ¼Ç8%óâyœC“‡Hb/&Ψ€Õ9“½Ã;–¿¡ÆN<'®A¡Ê§/Ÿ">U; ü àåÝ9ï#ÃqœÅEC&¹È3;›¥²ñ;Sà=’›¸ °ÝÌoµ s§EZ޾C\ƒWbÑÊ&ÆNv»%GŸbÉBÊÞ÷xÙøan.e3hÇŠèå»Þ™™QÖ[9sÁ"HZ÷qc€¢žÅ‰Zýr7R7ÄûN, HÖÈZêS "U„’Ù "*â¶ŠN:t­\ì9 ùćˆLo¥ºà!‡¨1£4êýdäô.| fl`°Ã06˜ÏÌï7ŸÝ?fvy1๙^îX6 ¶w¤O·  `ŠBø5ì½S1šÌ`O ¶ó3Ì#ru‚™xñŒ‹(À‘c¿DŠ´Ÿç>_ÀTŸ9 `ç µAÊè`S9èx.p7ˆ9»‘-0bÞzI3ï’‡áŠwIA:ß–T¦FO1”[ûZ8´!fFuÁ×t–µv"¡JáX卑q%ÂYK‚X·1œÒ¸œëvÖ%)wÀ´ F‘–«ú#¶ƒÓÈÔÂmi Ûã†[lŸœv’Uí4öª7XߢCâ3ïGÅì9³¼Æï´óZ‰±¥HR!{»/bëMäNH[oè*·aLêSÔ‰JG"ùäSÔá)–XD«b¦M0:Þ› ßÜ›Éxo–莾zÀŠ`y6éu]€ D@ò6@n0CF·rÆL¦õùP>GÑËlB-E/1¾h¢JƒGCkÿŠúècŠ•_gh%ßOÀßÅà(çê`¯!¶Ñ{cÝäàA¿ nŸ@÷ÕÏ¥1îvÅð?è3€›ÿåOVÚ¡²°ñVR”‡·oZyyøU}X[šú°Žù Æô.Í(-£ZØ–÷·µÓ›òð¦>„­hpÿ¼AúÜ¿®fÒ‚Ášƒ¿?ÇïnËÃwuìåá›ú(«¹6ø}}úXžÇŸñ¶»<½®?cüN*0äËUäeíDæšÊÏx»€ cÐÐ?' |âùâu?ÐR—ã‰%æçINÞÒóD¿‰´>îYÏb_]šñföÐ,Jm>îášL\I%Hsùáe³®¼„×åý¶¾¿)ÉÁ¿k¶> y€l÷2ñ@P¦™ È\¿v'÷êýÍ-n"žòU¥J8Ü·éèóCÜN8‹Øü‘’$Æ‹–œO‡òðíœb^¶òû*U m²Äu6„;·ö„ën¹MÿH»#ántÎè9ç–¢¾où>3SÑ«1™¤Å]¦Y± ~IP¹,zMÄÌr¦À O×´#Ò?•»ëßès†§^©ŒÝ%‡ß7kK"sI¿¥Ýóà D|›{>Òðô.ëê÷qâËüÓ…dŽŠåȦØ:3<´û“A,^7+0c»/Ðz–E 8+P|q„=ô³‘î³ê¢ûfDþ‹ªù~ízK': ÿo–Q'# ŸÝ]ØàŸÕg°¸áïWU ˆ?÷¬€67N³‚‰÷Øø£‘†ŠkxÀ—Ô‡VNg²/2ó‹¢’³Daˆ¹zÖ,”h`"^E]¢Çø ¦XJ;Aô8 HfÞS}VSXvâáFìýH**ó=¯ :â§™!@ðc‘È{*òÃÚ†ÛIu±¢îÒ³¤v]Z¦ì«îV\àÄKRµ7Ò*’›Ó€w¤É'$åj–ÐI¶rO3 ¸˜¤êX/ªu¾ÑÄûñ’Û¸?ë-–h”{úó!³“¬71KzkòW”À*°ù§7ÛVVò¬!9†(^ïg—Y³»#J4pãVh$Ž˜ßáäùðôG0ƒÛÎÌÈíZî½æì¥‘¹|Sè5_ îgF×\€z4ôV©ø($2º+xÕúŒéá°OUÁ$p[M\âé¿* 8¿þ‚Úʨ`_Ô‡¯uÞkj¬T´å )±BXiîGi~å ‹–c_kÊàoø2#â¾”˜Ï†¢F®(sNÖøJtL„‚ ³”!=-'ÓÛ±£TÚEc'@Ó°®iïçºBN|ØC 9E-äü6̨…u´h3–, \SÀIê(ßD5ëƒ-QÔòȰ©óŠ©Tɵ£-›òHÌððççk8)Zt˜@ˆñ VÎ*#š’Ë›ZúySêAã{ [#Cú fàéÚ㕪ÈKušç¥åU>ïNdúpcH½èU¨V£Ö*Ð:y,KU•~Ò”fàüÀ/#ì)©JÂÆBJ36‰.oî;“á< Í…9#ÎMCùi_[]4Åws3*TBØè”êU®“û CÉœfNÊ䔈erDnço–_#š ÿ fÞG-á[žýýZ+ðsDÎ4–°GHH°ú8·8CÞ°d ò (IŒç³F­#5Adó²± 2°ÔÄ¥šP‚ÆYdÛ•—¢9·ÑÚy*™3£‘«¿¬1¯Çè&;5Uøq8™ÓÖ̪͜8b^"n©ƒi¬B¥íz§áóÖTLý°¼k˜(/^ÌŒ•”òfV°Š_7à 5"5“4)zŠ˜“QÓ¢¾‹mx­}•Dµ¹x]ib6‡®ã±kû£Yä\µçûÈ«¢©ÕrKöŠÏv>%…§‘[>?13O5åRX©÷á.;øñJ6X-URÐÁÚ eœßI Ýc«à1‘]‹vJghÙX.M­ |  &y?Î8µ-8Ï¥M²so°;h”ŸJògeņd(Ø vé1k{95´Ë í"Ñ “ÖÒN’ý·(«ÄŸÂàêå¬)5Ëåt´èÁ™IY?7lG.ñ¸D,Œ­‘f"Q+…ðIÔ©|[©E°šÔ4W˜Ò)0‘ÏÄÐÌiZÅIH±Çc‹ís345£·-ÐËÀÈqFæTg% Ý3Õ ’ˆ9C££Í¥#±¼‹žh¸ƒ~€xêgëRçu–HºÇ9I«ËL½úšã±î!U4þY®T?˜oÑ9QM¼*×ÅñRÍlÀ䆿SýÚª¶«”o ]ŠqÑ”\cý (‹Þ[[y}̆ú ¥;·,Ñ~Ÿ[Ö~‚ÄCh¦iq›Â}Z§0ËJm‹ fIЉ0­(ü´£FOŸÕ´õ¹Ý›ð}˜~ʱsq›_6Ň™jÔG-‰$Àv´EE±\Ö¬ð#V<­Œ9lÀåd\þ 4§U1Tc Öîo ÄÂ=K–ò~P+JSrCæÝP÷Eª’(<É7 ´)¨1ÇÖó”cÕ'vÿbº- W'Fa9—oJëKeB_©Ù|¦ýÂ9UÂÅ9:WtÚô&QïY9ÑÄdXÌ[&v á²T-œƒŽbÌiT'àÇ2p´C Êê11»ÆÀ›»ýO`í"¼DuXÖ×B¾ŒïGl»puá‘ÑJf¨Sб£Ï œhxçtFc5ˆˆ§•ìyÛ|.è6®Eöm©ÇAcl²íÂÏÖt –úè¿a -z qS¡LeLOŽœrcû…„ÔžÉÁseZXIuç;ЇÃáX¯ïMáÏ8©ä2N΢§ÇïyÈô©1=øÒX®JLŸ5:Äd*Ÿ8ùä  Ú1s&/K‘ô‚x-¢¨0Ïn»Žú’JfÉ/×¥ÖþÛj7öv¥—pÞÉħ?ÖAIƒà.ðÆRâMåM€@‚¼Q“Áƒ˜/g* ÔéB]áoö`øa‘Ôåí7NFºhy¯#œ¤¤(n“ímåÖ'­w»ŠÇâò& ‹a•$yHöŸæV̆oÇ̾ZÔ’4﹩Ñ_*œ>4š˜4øX‡Æ8¦ßÕjtüÉ*…AæcÀ?—¯ÂËú€æ¾x÷]yro¤…÷á·g,¡ÏÖ-îïÐÆÎšNÓ`p?­ èúBÉl¸ªÞu­ž<¦gJ¶§ºãOææ6²„îø®]¥ÍDQË¥ÁLÍ>š5ú5±Ã%®ß…¿_Oà½u1ÓŠšxc_Ä—ýÔáS–J-‘1“j_^ (\“€U-´@÷ÁÄÎ÷§/þ ÿü‹‡\§endstream endobj 152 0 obj 5227 endobj 156 0 obj <> stream xœ½[ÙnÇ}'üD^xà÷¾ȃ/°a+ŽÌ$?P¤,)±HÙÚ¬|}ªz­î鹋($FìËYz©®:uj™ßOÙÌOþ“þ{õòäóöôÙëvú üÿÙÉï'<¯‰ŒU“âÃéfÆ8Œ”´Ü„Iµœ…X,§Y¨´³÷Ü—5²NöFƒlãÓ~µ0IB**Ù§Ó/ß/g¦@.®áÔ‰´×Ï!íÔò°z ñ§ÁUÅ)//Êt>nÞâ5B°äâó:ìÓxwrw’蘭ÂfEôZ% ௫<+¾V‡®ÜÖ]Áp(€m’À–KTeñª*|’¿VQ¬Ï–ºC”l†;€&œIØš°³Vvó¶ 4‰ÍYµ9‡÷=*ܺŠ{1kx’H蘭†™jc½0ðÔ«4¬”Ua’0$ì\I¿¢Á;öì=ìZ´:•§|7I˜ÅIG®Á’ñY@o×_¯ñÁxþuÙ#‰ˆÞ”ËÞpÉ/¢†;xÍñ¬âdµ¸ßp* v§2vÏñ]¢ZQ?«R>Åe@ÂËFé‚Eà8ÉNoFo£}{;ã´#£*?Ðæ=…¿…%Å£¦'IU7LDôåâ£qo¨yå)T ãH·ª­R ù=¾"5îS¶”,œáguÊb¸"iÀþÔæñ¦¨Óûp°Д®¾ló ¡VIô.oøy«;¨¦’‡ÉVoQ `ZþsÚâ¥õ†¨ô—‰mô–:xäñTF›ÓÓxÖÜÌà&|‡j $è@ùpðÙ€uõDˆ^/„™Ž÷É@l7uØ›õÛxíÚ‡˜½3t;äÌ«p*•>a⋳­S g¤ùXÚuìÝ,Ÿ¸Nš`xkhÞù÷ÛViˆÞÁ;*ËNÏ«"þ'@ªµt'U—ÈFEÂC@O!PÌ®8ù²Q²cPnbýy¡»}­ˆq½ê³£bpJkÐÓ;pôÉõ¾Áë ý³1h&\#w6Ï«[âjz'ùu(,†L`w­pAQ+Ù¯À7G°µ4NGA3{Z4[òÞe൦LžÞA– KáàÀ!Àt‰B½œ÷@ÿ$neÉö²AH= sÔøøÍè>—VK o¤/·Î¬¹ð¬.#½þ@ èý$<üÉwnà:IÔlÎòž}— 6”Õ}´òü9.Óõ2 ¢kÊ£ˆŠÝËq–ÏOc©mœ¶…Ü3X—^4 Tb€’ÛÊÀA‚@>Êp7Þ@s kŠ?*Ͻ+¿nÏý‚>ªÓ=©?_”‡àE‘#¯˜¯þ\=/Ö‹ànÈ,ùêY¾ÅÒ…˜ ÐåÓ€ nñhËò¢X ¡V¶41Ž’ï´ôvØH¬­“­òHiÄ+6Šzdа‡ñ~ôv"^ñmU‘dÌ’[ª8yÝZ´Š¢ÇUîVVw¶DÈwÕÐÌQÇ#ìñ £*´*s%Ì1aK—èȹ%{4:&–5ð’G3Ž&µtãˆ_¥¨GQ6v—€ÄíŠBh]È8ž"ürÔõ\Z%Ûyx "!ü…ÃOŒ­g©„±ØâIHU¦F!#²€ÖÀàǬ4"*5b¤W­&ú¶1€¼Nrõ²¾Ù„?’û ¹^3D}Ë¥tNÂ8*Ûˆ j/Y5àö“b:ÄóÕO;oQ½*ùóJ!ŠÎœ`žEËa•‰o¾Çý€ÿú¶ êý ê#(Y;é›chÁ*YÂh‚Í|}_P°sž ò¼7¸l×+ô\€}­QÙC]>A’©þ¨X.à¹ä-á`󉺫.CD•_èYË1ˆ!Iƒ)â ‘³qrÍåh׃DDYî%õ!qpelïƒpt»naHùÁù+™dÍ´l #äìàÚ«hþœ“,a,©¼üåH[%à/ÓçÞM@=¬‘’¬Ï6̶8œ³â1DÅ ÷æIaÅ)KÀqF;EbßãàØX0¥¯'Ï!€Ö…ãö¤k\9QU©;í+ ÕaÍš V¹!¤x[¤-øûJÌ~(¿­ïS ò°…Ÿ‚mø.&g8(,ã»á~áGÌŒ¼»gµ_Ô‹?¯­ô]µª²úÓÇŸH'L¹:Ú“u ¢%‰;)š4Jºº´>@JÉ>ß6Fw9ÌŠrÞÄŠ@O»†¾§Éw8“´`Ø*n…h|±t€ D‡„­^L0l%@1 †ax Éaz‡¢á44ƒFù£€0Ñó'ÞÕØtOà2ð4_ ð“æÎª»À ÉÇ‚ÉnVצ:Ÿ×1ôT$r¹"º7$í¶Õ0ƒ+dM„RXâ"6ÍÇÖfO.{M[PŒðŸ¥¦õB q”z´ðÂ9ÂŒA úÄáÊ?W˜´&jˆkk+] %nªåH ²ÚsiÌ ¹‰?Ô¸ Þ=$*oÃ)jNñ2ÉÕ. mT‚¤"®›ÊìÒ17Ö«MÅvcÚŸð‘šw!HÚÇ0ð ÚJP¥q"!a¯í:ÁW1¤Üg4&ºÜ}ñEYb5YfAù…»”Æw9NŒ“\"$)ûµeíBI‚èoÖiª¦}­GFвÍa”ð,Š Õ´å…b]ìù¬z eþèE½zÓø%°J6 J!59ùy}õañ‰˜ÑÌì$NÝx€Õ˜ Ú™Ÿ±àßt *Þ×A9p’1†ˆÉ“—2IdzYÃéæ…×vT ²u…J>Þ”Fìƒ_œŽ.Ù?n>ª4Ê€ŽDµVXÝ 7°è-¤z#`á:yÍ$_ô«Xƒî& Ï 6wHá£\Di qbÿ÷®@N/*Q+tn)2¤»ßDoòH­ZJÁæ&4o\AWYUÓë‹«Õµb«©jì}Ô5gwI dŸÔä  †ÀÍ(£éxHÙ]4A"?Q8B?ÈH6úÅÄ9”H²Ÿ*´%rÉZm–xV9< ¤÷+àEGÚÐ)SVêÁú€­r–ÛF±Õü(<"fÎ(¿º­4´FÇ43ÌS Úg;"4‹d ª14Ù+àÁ"ä+v–êÉÛy‹ÜçˆYôýÛÁ;ã g{½ÍÒ³Yzm<ÃSKR¹ïNÛ|óõà=2v½£ÄQ1mŠÌu<;JµdÛ¹»‡sÆÈôX¥8ëëÁ C 8±ÀÕ‡ PÇz†®-ò1à[†ìh±ÞÈn6:ŒÜǬ·Iq"9 õ•HNxà)ƒ ‡<%?{¯þTu°eH?Íâ5|–8oi&|ìÝ*\—ìV”X–Â; ÿå ±º—ž&<+>|¶’;µ01É€Ì)~åf÷¬ –%´\Ú^¾1 «Ð½˜ÜV­ôSµÍ­GҬǩ±‰(m[I@a¯’„® ”º¸ÐgrF|æú¼G–ghÿFªúì‹~J[I©¹lIŒô  ]”ÓíÚþ„Õ(R {d&P=Īªü儹k|zI³œÇ–ÿóD¯û~8ÑöÞDLt—šÀ>î¦ðÚ‰2lE$$º¤Qe¯5êP}“<ÖfBA ÞÛñ¤+´‡–®f‹õÍ\ŸhóUì-×’ÇbqMšýE8,d±Î§§6וXû.Õæë“þc ¥ÛïmêGj½…0wÙŠZ¥«~}§ËëÜ[S‡Õ³o˜ ë{„îO‚*GìÑi«ƒ,%Úíø‰Q‹ÑÝ?3>d¹>å'`¡(4h‰R ´sä û¢æz’Ä)‘òð2|n)6£ŽvQqW/£¡5FS˜òABýeŒ“yà¯1»G_÷jĵö~5@]øE‡O®¢u¦ƒîǬ2Ò[¯Þ ]Ú…üO}N-*±š_Að`òríF×¢’p±óÆûBÈü²QD°º†°Ö7Ô6é’òÛÆ„&qg`Ѝ‘@?9oóLyè]ÉÿÔSÕEËcp+c¯}⚈|§®©3i¿­æ„8iZ©4Ä®˜ð†`›ýÈ5\Ã3x>WÛ²Œ …&Â.kYŽuºYz²ÔJ‰6ƒ$žPIé¦oR–39ë¸÷eCI3¾ˆþE=ƒþûɽ"¦E®5åŠ|·9(·†j‡¿3šëðå (&?VîÙuStŸla°R>êäc &JÓb½ ™ÚNO…Þëx?†|а ;ãA ÿ*ԤÌÒÎu ¸½3jàéÓ]JH FÍÏ{Vfó î‘kÆi¾|¥U!½ý—ø6ãrÐ>-…˜$ÔÒ÷¸A-æ_÷œU¾ýHwÉêP^J”dɇµ+N¸'mT rY|°’:-ü¢Õ¦ú§Qg¨¢mBðç}tƒR<ˆ=fqºÖÔäšžô«‹“Â?ÿ‘ž:óendstream endobj 157 0 obj 4366 endobj 161 0 obj <> stream xœ½\[s]µ~Ï0Ó¿àN؇֛­»T†™RJ ´\ fÚð`ìÄÉÛ!‰Còï»ÖÒmioéØNLËÎÑ‘´¥¥o}ë¦í_–Y,øOúïÉù½÷¿qgÏï-‡ÿŸÝûåž é?'ç=‚NB1cäÁÑÃ{q´8ðvÖÖˆYꃣó{ßOf·Ì*§ý4ïĬ”bÒ»C!¤šýt´óaö‹ŸŽwzöfYÜôÓNÎÖY)§'4À?=Ø*¿Ì‹´Ó}èh´õbzL?;Ëú½ØêYè`% Æ œ˜žíå,•º¹ ‡9Áúô²Hã<ú·ea£sX‚ÀmÉe6"„ƒ£Þ;z7£`0@/Þ9ØFóU஌œ1}¼;4³6Òùé:=©®à£÷Né0Ób¤ƒÅÀî`ݰÀc˜c.hl-=Oc‡%„é»Ãe¶°&èü?)å§×0Y¹é×t³yà£çe(³h ‡¦ðØû(¬7 —²@¶V¦š×Ê7гYí-—ëád@¦rÁ{›DêW"µ*ø,Ò£ø ±¨é Më`輜³Ó œ·Öàp¹3°:9;çȱt>Ç}XëéX•„þJPïgøUÍôóNÑHsç _㦤”Ö‘Ô|6&Ô0LIS†¦|§>³¬ãÈOI¥y¥Ò|ôãÜ=ÃU€‰žãqhŸžâÁ@B{žé¤|*½Ã¥ÄžH•¡v|Žm€_˜ ‹=±?Íb“l?—´Ì,]g5¶HˆAŸÖËbO­íP²jñ([6as¾ µ(ÐËÄqt TQ7{ÍIãZ.ê’ã–¬„çÆ‡ø”Î@Ú²{'|z(hí˜~•‘(pŒƒƒÉ´TÒäÓÃ)Nkÿ÷w¦YÙ-Îû¨yžŠ{>Ì›> ¦_dÜ{ꀯøÄ'§Ç¾±ð – Ôð6¸Î#R´„Õ˜¯ö>íÉJ±ÖPe‰Íô)RO𰘿!‰ƒ†é;üÙC³î·†ô¢±Z\åbý×£u®=Eé)$âÛ8 dOB¾qÀŸu¯Í ³²p›v­Q_s+“j}æËxÊ[Ÿ„gp•°oÁxìã–• ‰÷ŠS¥ÍSÔQhUqåš1ø˜õ%“,טL;ʘÖÙêøw¶hæ*6ÃG8J æç3œÛ¥˜’%àÇð Z€ªôí¸DmIþ?Å…É”Ñv˜Ì;Í ŸÙÚÛËØˆÒ{Êgeê”ÏqÓ°È=J ´3×Bc5Ië“ P«WVæ[(ˆíÅkª´µpÔ1ÕÁG?ÄI$‰¿nv¿²V=¸¹µ]2§.ÉЫÆyvVè<J™™îw;Ós ð#vNúðÑNr K Çs¨ÇÆ–„ÇÂÍqüˆ‡}±6•8 ÅÂŒ¼±k‘ €ž8¤±‘ØÀbÏ­¿£@êx p““èî‚»¦ÁÿyŸQq—IZ¤Ð"ÂÐØÂÊ"·ÜÖÄæ_´ÌÍ:6øôÖ)2Ô2aôùˆHP-ùÀ/ªY=.KÞõÊG€Sº“4Ì+~tmï¤cÙ®”užâ,Y°‘|–p¤*XWKSCh<ñÒéÚ´åî雽º±ÌYÁAÙ@58²õÓv¹ ½åF`±5¨©1@$Ç1ùMi¬q¶·. ?Ó YYð}„-To=¡«ü…AýªÝöî×ZMºÃ6SävÆæÖ–{o™(’'ð‚ (ƒÇMd6^[:ÝFìèVoÜ=ÄoO;z:p’N]›ÚïUKð]Ï4ueF|#fòÓv×y³­ïÙJiÖ¦VÓ’ÄÐô¼­Ç˜fl™– ˆa›ÍÏ}¸húµsŠhÒèDà[¸\õ´ý T²;ªfx5ïBÐWíLîIµåÓLÁ.°™ÝU˜…¯{.R‹‹‹äÂw›a‡# "˜"f;f ”pµ“æ¢\DP2‘”u\pŽWè¥@§Â^«§7Nmò%iõ-G7òuQæÇC⊎sb/-W@&g¢Ø\ ô¬CºÖ ÜQý/®š³ûCDG÷wˆXg³³ ÿS9‘"ÁÊ|›èOqpßG¤:0_aÚ ;}ƒgムà|“Zkœã칎.jè)ºt®—5A  ÂôÃÔ‰ÈfN×å Ÿ€&ÂLï¼²€âÝ]Y¹ŒÝb±ø Ïq“B`ª¢6æž ¢Úø NZæ¤íirfjc ÇÚŽ^BÇÐãúHßÀ9ÓÕÚu©ATvÜ[ËÐÌ…\;€¿¯¼4´F2uÊ~HßͰg¤^¶/÷ØÏwóé€@ؓߙڞg±zH~æj=$‰³´¥RÚÓÀ…γm&X[Õ§n •\|'æSBé É¡ø·UWú £­µï³wùàA†®Ñ­ã3Xyg?ì ŒòZL˜2 aÇh+Æœ­ùI§.½¹ CæqšYäXƒŽA“»Ü0uÚ}‹ç}V¡XÝ…±ÕãѾò1‹sÏãš 8íuep8Þ5n Kú‚·À/ê¼<#ÝOL1Ëtä;¯œ³ä[œìj%(ÛþånïÍiÓþÞuEZñQN]7á’m逬CȦÊoï'ºÙ  âµR2'ãfé‹ÈTÕ`)¤6³[›Ì§!ßdœ½0¦}œwSƹB€¬¦ÞÒ¨'Ç  ëÐÚ¼AÖ-Iu9ÇþÎ],øº ÎYÌ^/»Û ­öTÈ´û|ö§Ï5é@fS¹¾äر³Ýe¥œ¥H2ñÙôégéÐ=z´Æ–‡‹ÙüC7¥Ò ZÞÊ ÞŸ XûÒR»M¶E*˜XeçBªè÷Þ: ªæ¾4MÝËHLJ*¹^ÂÊ•ê—:¹²ž³QŸàüŽô»öëðÚ°–À6ØÛ+#Yõ،ĭc#4Juò‰}!* öíE/ˆ««nï¾H¨G$ðFÖê úq­6£ö±Ê[C݇iׇ”}ÈD½-,GB„Þ‚ò¤¯Ú¬Üê(ZæÞ…wz“*—!æMBŽÑBÛ‘.CÌó¶ÆœV†(§ñ˜Tf'ÈÔ€!¹W÷ê.&UÄqÂ3s—»!ó2£!!V¦ÿ336ýqàÖ¼w/’¤8Œ¥£_ÛɈ_¹©FQjS,Ffùº‚ Sy}•¦j²© O¹Âv!Ül]n-š§aŠnœEŸ"žÌŠ¢·øB’e .”/{›Ê0x’H›#øjCôÝ¢W+s×)-IÈåþClóÿŸ¬8ì­ÍÊo1Ѳ?3þõ¨ÛÀ SÇÎ"¥`4§8jvîšGÁô\ˆn¬ë±,~HÌ1úˆ¹ä06ɹ¾ÿ…wv*:÷V³‹Mþ¸½]9‘å¼^Ò&½âñ&çØÈN;_n¬‰1n•™fšRÚ6S<&ºú¢ù¸W=w›ÁºcÖÅæßúN´º%u‚÷R`§oÅût±'¬\e(­³'ÈÈõœ ;UÅ|ëªaæUìIÁ´àÔn24åÇ{7—®KìöÌÇèFÝ’WÇ»5MCYžÈÀŽ_íéJÜmƒ`Æ_qìE)‚<›È.¶õîÎ&½VšnÚ¬t†Keÿq×¹§36s-·vóV§¹ä32so„ݲ(ëç¶©ôuj mˆ…Õ1#ÉÚÜ#ºÁË é.ð5/ƒÜ*8IeÄÖH×WVÞÀmC00*X4ªMŸtk±Ó î§Wïf/b#fnŠ©ì9Mc‰cQDÏÂÖHŒ†É©¿\„Ú_ƈ‘‡]‡˜9I¡T·bXÌOUt]„eI—.âJ[mšŠu‘¦U¦„?'Y)§»08Íïó4©Ðmw~¤ >‹k^ÙŒ»LèKw-ü‘»«r†Éí[gRÅë.3 ñìîì¥&¾„d ›—aòÅ7M©ÔRuû²Xõº¶¼/w2YT17K_“ß%hþ°æ»ð£Rt=ŠeÁª:°ªJ|{µ^yjk/x-Á¤KþUyÆÅaØEô›9•ë•o`d‹Å«Ulý¶¯àI±}J”š“ìþPyxgã4)Mk>b³Éºï)ž6– †܇ڄ$èê8ÌÏÓM'X_ã¸æÚ% _5­·*Ž  eLˆv=¸Æ›¢'Èq†/ïø Ë4 4üNá ¾© Ö‰Ö%žxóRÛÑ]£‡t“H÷ßôY¥¹÷›´<;{1ð¦ïi¥ûH×½iÔÏ •UúIáÈž]…éˆ\|ýcC¯ö¸déÀ16º&ŠÂÃ4œ ½\˜ÓÒµ0Ï,Jw雬©ø,#Ì­®7­J n¡úÒýÆÎ«æªã¸ðÉn\ÕqO‹N@¬KB%ƒÊò½÷ýú%VäûU~†—Éèqm5|ø2B wîFV¹¼*¤ð]$,‘efL÷uR˜×¦†˜Æ0”ìOœgƒ>ʦ3ÇãÖ¾Tºþw‹Ô)…´ëÌpråŽKÕR®Rží4Ü5ǰZ{Ê_³·K;(˲^4·)é]츑am³Ôê£Âɰ ?ªî%Q›Æ´Ä¤Ã²¯N“6ÝRz¯H%…pÃȯÐÌø5ë}ÔõåJ€V„ýáœDÓrã: Ïh_Ö _KTï4ð¤ø]wI?ÅÅsþKõnß͈ wŸ|åùaShÖP«ù\n*)t?ž:î²ïÊÐw®"ý¹IÚÈІþ†‰\½‡û=¬…êl¤Ç˜þ2Š£yù¿ã…vŠèkü3"Ÿâ×0ËRïÁG_yøÓŒÿ‚Oð8jü#Í9-e‚·Fd’¥ñGJú:hW&<)¿?«ƒ”ÆãÚø¢4>¨Ïq•ž²)½ß¥]°½}†äÜÕG_ÖOJãUmïIõ?° ±,ÿ¶Îo’K>mžÊª¹ñeoúg œ¶)õž®þ9ú=·>jž”a𬠃èZbÖÚX–Èà:Ù oŒóú±@™’ë¹õuùHVOX;¯/'œ–]>®ã^ö»=+¨Î²d<“\G0 د¸Znð¼êêHÕÙL·‘Pd=>Ï$y²ÙdDåü¤¬ä?uD¥§¯jã·¥ñ»ÚøMiü¤ ïçì^—Æ_|lñ{ZÕãeO§º”XÕc^!ÆCøbÁeRÚo„ŽŠúÿUÅóAZþð—²Øýô_üLá”^VLqÙƒDÝÀëª5×!îI»•Ç^ôDqz=â®1.ÊbÇ÷x^Tï"MÇOíéæcúû^‚yÖa>A*kg¥ÌW™‰ó:>ìÉðÉ~vþ´‚ýš94[Ù¤ÍCL­ƒG Îü"âÞðÍBóìŸÝûüó?±ÕÅ>endstream endobj 162 0 obj 4604 endobj 166 0 obj <> stream xœµ\é·‘ÿ®ø ¹ßgÞ.îlSvÙÜÙåË{Î.Ôù5þ¹Å?/F®ËººóKüýÿ¼Ä?á´ qþüù;üóÿ\áŸ÷øç‡Ã…uz[Vq~ý(ÞÇ.â‹7‡ MÎmaÄØø¢6¾-j#ŒkV·xgÏ*÷Ÿ5÷}˜m¼÷¼Þ{YçuY2ôm}òEi|;zý& ×—›ï“õÀ„ð0K?yàçúö§z™–¤•ÃÉæÖ×åò‡Ëÿ¼'œZÔvv!Ôb¶Už]>‚üÈõäÆ7•¾ïGô½-oúMñ»J÷¯ŽþñhøG´û@c¡q"ùþóŽXH¡gµ×ÏFÄÊsÁgIgäÙ…ö"SVÚHÔ¹X\àï ßàŸ¿•ù…?ÿÅžÿ¥¼þ<ª]|¿¿H¿a¹ß•>.ë¿5þ³4~WAì„1 ~Q±{D· g‹ÇŒ®}ã›»ŠÝ7õ£É¿[ìÒ6·âa¼‹;ùz´ºãL{G:|äqîF²€L¢Cn3O ä¾ÜúîÅâÏ3X„ðþ˜ü±»“¦û¤X l 4CYKWòU|8w“›l F5\ãôzbº#¨i¡§'#£PçúÓ¨{¢D˜åJWOëèõõW£Ž8?5—¸ÏÙ’MÖ`°=öóûOMÂ1ºa¹'#;]»_F´ü@µÛ@x&J†=™ÅlÓzëˆëÿý}á(й ŽF6„ AMY'VLÇ¢õ¶ÆMÇÇ´:Ü0½(¥½„‘åb­U°Ý¦þ¸©¯^A;LûE*qþI¼£=¶¦§±wµA龜7øŠ #ÞÔWpp¤À²öúúÚl6ÏŸÁÉ+8¯Ç ¿¤ÒA×îÒF?<€ ýLúV‹sV)Úa7'¸-£¾\ÇQŠM.¬õ. EÂÁää6îâ*,?R:¼å+þ;u°/àÎKà,@±kÜaò$RCÁ%ºÙYáp½ìƒÝdõwœØ*Âd9ëÏjeguTÉÛf7DÉ¡Fû‘Ÿ3ðИˆ+­€&£Õ!ê³dí|ÊAW«U-­™»ª ¼­Q7yÑN1-Žò¿[ ÿ£ºYE ÛU¸“¦¶I‘è#¤¤Ý¥ÕƵòÓÌYÑo‹¥y]8 ²åV|$î;ê‡BàÇÌK–7bÀWõòm½D³àHÿt ¯€€}ƒ„uðÊ*B&<æW䨩`§Á¿?/³#{[7h‚jÍ©ÚS¹ÀÕ;²l=aÀð/Ã+`/4͉ã ˦Qð2Ù+‚Ó±.R*ë·óï…Ï@”´€Ñ@ ß×U?«üY1ê"%ñnžM½KX´°ô‹r÷míðžô`ËÔiuÈÖp_f¶¾M,ÈuaÁŽs4`YYGoø¤IJºÐzm J©²5g)m K«“>>“§€DÞ¶EiuþõA 9Ò •FfØ<€¼ÜöAµ\Uâ¢PÐfܧ2V¯Sî/BάQ–;°ÙNˆ@¯ÈóÖûŽ þLÒÁ§šÅl¥ÐÙîÙŒl öZ K³ dšÊTyrEò±±ÙŒø™m“TÕ?·PÉj]q¸GiƒŒ›€ØEbÜ8:uœVj ÿWƒ)Ä©Œ}ůµ„ xÖN;#:zÚkatj¨kƶ‡½aªKÃ9Oo2}8bA½‰]‹ñK¶Zü1£ì›xÜ(xäƒóó×{—¿{pn軬¸ÕÎÚsÍJ`)a‚órz7`ùqª|„±hM=ØPÐÊ[Ú½¼ÿ"\Âp [gÂ2`:R® g_Ãtº±×nàWºåéA 0îtWÑcßD/° Ý [T÷Þ‘1j"`ßÙhŽ Ðá…m`àR ÎfÒYM^G_^Û ¸k華 u7\ù }’ ¾AJib\¦·Î8¥‡C€ø˜õ’#V“ÙQÌáŒqÞ¸îy³æEiv"8^ˆÍ<+ˆ1Ž·9–’HR‡FQ8äû•½YÜ*²Ž}Èöp½¸ÆöMê'lÎF)ù°*“~‘ño‹Õúš@ÝÚKiþ@ Ê« ˆiCÐádÊSмäAKgp5ý% ©ù5q®^mÀ7#Ô€»îý‚kt‘OÔÓDT¿Kêh5Á :¸üÜ‘`Ãõ¾öåÛtø4;BâvMaÊ*Ãxß¿®ÍɃâþáq «òDÅÉ‘ªKaŽnR„À¸ºÈAa ÀÃÞ §9Øé–mXEW15ÀwMxÔ†-W!Š^e¨—Ñ}Û6@#^±OÒ¶%â±£–"PÑËIjIûâ`À{û¾ïl ú•ÙBép7úäsô&fä|b %æNAŠ0Í"ÕØ8P7Gq)!|Úé‚ʤ¼Pß{w‹:åZw4e¤¹‰¦ Þ¾ ¤! ¯SøÃaà/±òÛž”Ü=-Ó^æ(ÄX0¢µn”sxJn`þˆ>þ‘Ð’øz942 ¥'"pyÿ—û(…ãouIŽ›b>:L†ÆY¸h$žÆ1ÚU’4 xÒš Ëš;Dë_.õàÍáãÞ–ÇyLJº5hÖ+¦!ðWâ=KYŒ Ô˜¥GLu3Ô¼³0¢gƒóGU­ôb×_•î#¢1°yœM \<ÞñÑìDV‹€x ’uÞÆ§Wa:G£ …ÊÛÒ’™xc8{ÌsD€BmmƬUn®p‡°3o8uÞ‚@ Žuæ~RsÛZlsr \àOB4 àš€YTmº…¦WPÎuù‰më°«Š §;S/r°ªpØ3š¡u…¹¡¨Ý3fƒ:c;ZdF#²ÐU„&%ˆoÔ8 ° ªñ©Ä×D“Xœ‰{> §)“0Þ!¿ò0ÅUw ‹§XxXð)ú~!É›FcÀÕ>Ç#÷„(Ò³MÑ ²ƒù‰3ÍU=6&U/ä£@õÙÑËNî°ûèD MÈ]å°í?¹ÑWH"ä±âØ->ïf…œÿ{PaL ÿª¸"^wõ]ƒû,‹µ K‹Ï›ê¨÷>Ë ªc¦v"-dãÌ÷‰P^ÅPá97ˆ^fÛ5t³¶é¦ æÜUÀ­.Y^Y#_Ä£) ‹)’‰;K㎠&}]I00cë´(Æfùå„ù¹}UE± ዟ³ˆ_S'á^Ñ—Ÿœ¯¹ÿZHÄ3×}^üMi|0êèݨñf¿£jãƒÒHJ?î—Æ/k㟨–¤õ¡d)Þþ¢Þþ¢4šæ3-lÊ:±Pk„ÖììÇÄî2“âj­Y²7;sÕ¦ÀˆÚ±Äu* ø£sßôµ54@\2æ¾>Ÿ@êx„1­¥²ù ç Fý×A–Ÿ ð‡Ÿ hJ¹ìj%æÁ¾Rq0vÌyþªªÕà/2C4rÍ‘³ SáÁ–ÞGatÔƒÖ’)õe€"_ÅrLÝrÀ=r„‰ ßÔ¤ûqšÌiT[QjDz¼HR6ÎvòQ <³VWïNñÁ …&k€s|€ŠÈsw|mþÌ­2¬ãTøPc­w~ÔN¶( ìPŽB€f$BòÛòÛº³ó„µŸsÄèÇIãäŸWÃMÒêkÜb΋½í˜d‹°BIÅd&Ó9ã‹íyN<²ƒpÃÈ’Í’èQÏáxãÃh¹sîNÛc&Ä£œiýÏ.–º–ä= ‘·™4¸8çR˜€çêû"®ÏbDazm'ÇÈŒ+{X‡ƒüLûýAz¸6¦õ»2,ÚNÒ/9øüàTbÝiƒ Çu^Dj*¹^žkÐ!§{Fø¶¢ëýT`Zc38T@næ›øµ#³]Xÿ“ÞV2©®Ç+%šœüèåÁÑ1¹Š†æO‡ù+<‚ÖÃUø ¬‹K>éfza|RŤÏQïð×rå†È;¹ZŒ§y$L±¬+òÞÖhê0áàžÎHÁUšDU„=ÔFñÜH6ºB‡”âUbã=ò­…·Ì²z{,p2¥XH>Á,¡—»á“q"«‹˜ŠÒ oŠ ×`jðwd=]v94Ûq7¶d•ûBÒgã<5h5à”pJåϪíY6¿Ï檮NM¬ »ŸÑ×gy±Ò<Jt8±­¥F´|S#Ëâò¦s(¦¥)9õ!uΉ‡ì—zøCOrÓ˦{O’øz,¤6¼ž¯!UFžä¬»oü0jü¡\ÕS0#ÇÍcÔ:|säR ¬šPÚ-B”# sîó¨j-!’XÞ4U(`šfȰ%`¢û”«ÙÄØxëXnûjh,U‰¡¬TÚ‰í  ‰¼¥Üa+â–Z¬ÁuaKu¬pN$sJRöYŸ˜É$á û¦šó¡vAž +·p…Ä’z;'eçë Í“y„EüÈøþjÈ,$ì#É¡Z>ê˜TBE¤" e±q¿äÝý¼)ÙSí‘ffd ãë~„¼ T¹N‚Þ­¬ ‹¾ ©…é}¹R ¦1®Ì".AËj?G¤a„]I™¹Q_5` Þ“XW£ 1³qYUŸÆ°;¾]Wãn¼7sFLu«ˆËk‘æ ¨š²ÝÿNŸú¨ÓôÙÝñ ô>DjÙa´R01®”åE]+)»ƒ4$iìÙ=x¯ŒßiTHlÑ(¿q¡•~)@d±˜-Ÿ#Óµ(ãÓ\-ƒvb×üF˜ óˆU„»©»¸ù‚f*¿ W)äÔj×èŸ3DÄ*m‰˜ÑjÅQH†Æö2-¸  êÿ¬[ÔбÞÜÂò½,šó8îÄ?M3ò”ºñ|?›Õ•(JÜ5­IŽB?ÌOj›NÊä Ôm˜YÛá ø>D¼§Õ&[,ýÜ7 á!Z|•&ÑX\ãÚ3C'[ÈX;b¹5r°o*SÀÃF-’-%0¨`)·X)ÞÊä*¦"ÉŒtî\mc@uS¡"+ˆEŠ]‡%r<4,œfZHgTŒÃêá›#dIQ^U»pWÇ6†ÒÜHèRhê.š¯uij¢•60æ=µ~ЍéG'*žâè’ü[Ö÷âxñîØíl.+‘J“9_û%<ÐÛ¶or5ÇÐ$°ÉÅ-ªÈÕqEüää4ÈY¬TÇÃ@¯8÷:#ÚeIÌ bƒäéZ#A½ßÖ.må1[‰éNîEà06X"p¿-ñ®¿×pXý"ÇÿÔÆoJ#ù¨Š<ì7èuQä$.¢+q†äÁc†äÕmÐ[oM¤{| ö&6YÑþáà€=ÏN¢iÖåpS>kwÊQiô­5©Þã€ö'üN²ý}õR¼ã~‰ÄQP#,zÁárÔ}iüÀÚ¨,ÚÜY×Ǭ`q¸$Ø8ðI~‘‚O¹Ï] ¦[N¤ÖØR#êq®Vrùà¶•Ä¥g½‰À0°”‡Ï«ökˆ$‘ަŸÆHç{Ö¢×÷ƒÿ1ö ,ÕÝÁç 7!\}õY¤–—Ápr«ÔÁæúïµÇ­¶ ŠI७så¡°&š=€à$)9døA8æ:áJ#‡þ0O¬‡.ž/e‚jÈC§”˜¦Ií|B[Z@9ÖÉè±êÔ*,véSxí³‚ÝaÁ¦õÄÌSV¾6gžb üŽê”žjÁz‘ÜͧŰý™À| 60ËèÛÚúu÷,¢ÎOw“Fc¾«¢1§ªÇ¶:²q5ÖyÌ:Pž5Ïg//êå·õÙ~¼ßálÍlð³˜{Ø\C¦ÈG¯N©Í‘;Û •|üë´ßWÚ0ɤ ö@»hrVžz:^Üeªð«w‘ŠYÒ˜µÂaÖhHr'Õ@ÆC©|Ù½ãG0ÂñRÁ5ýŽögV½§V÷Ó\ÏÞ.½®=™‘òØÇÏÝV%C DJ;ñ<ÆŠùÞt¨}ˆ,óÇbTŸÑ‰ÞÔJ–Ó¯nÄBy-±°{§|!}Jç®ð1·~VEqò¶M!vŽ !¬lÃ]£|‹ÄÔtHhëV¦Œ¡bY'.ê7‡Crˆ8ºäQ´¾ÐF¼Ç)—¡güª4)¾›3;V-â'µöTôŽ4™>¦¡¥ Eq©†ßÔÏÆh<~K Åh”w\Ã?©ÃÜ«áÇÏÔRóZyÁmZWŸÌ€â_ǰJ{͑ϡ…‰æ'.JÏj¿gðÑ ñŸíy¿¼ž{ ÇÃÈ1üO¢Ä£l#p¼îôq, ¨Èt$R«yìÅcðmã‚ §û’gþº«.¿CaHok±ý׊ ?O%|ïT\Ð §ãµZK²ŽEþTúÆ;â­ÅÂ’©q(”ê¿ÿb…Ÿ‡gJ •°prWÑÉ«Ëag'1¸ð)cjcr^,Z˜ƒ#±«Mˆ­üãP H5[á²æü 1äiVPÂ>)2òÉJ‡U¨H64SNÊfÀÄÂa½Ãö°F2FK•.#¦NWñÄ¦Ü 8UkÅ;LúÓZõûÜxrùS‹«oaËÇcÙ‹ØhMÊ0[Þ™|ç1Љ‹_ö ©ŽÍ{)ððóä“<õ\Æ…:0I:˜²Ú5'‹ž6ŸÛ鿱Ðgñb} Å<í×äb¹ LaÒè´m ä ¦,˲Y‰QôDÍNJÝ8rÞ7P„|´ˆÌO7 1âÚÕn¨˜Á©£rõ­y˜¤Qú;Ó0s<ødøè4 ÐÏ–€rÂCVÿ„ÿB yøÃM…¹ê I¿¨…S—ЗÖû«Ë{ÿ ÿþ?äAýendstream endobj 167 0 obj 5562 endobj 171 0 obj <> stream xœ½\{oÇïßD>k£ 醧Û÷]¸ˆ'uá:uª¢Ò%YVCJÖˉ Ÿ½3ûœ½›#¥Ä.‚ÈÔroóžßÌébÞ6bÞâñßÃÍlï;7?¹šµóoàÿ“ÙÅLø óøÏáfþh&‰Fš¾íÅ|ÿÕ,<-`H5JέÔóýÍìûÅ£¥n”Æ.Η+éš¾³ >šÅz)çœZà ­…”‹>[®”q¶~Òø­k´‘–L»\®pM݇'®—ªé:+…"~i[½¸‚‡µlŒ5‹ÃÑÚ6Z‰ÅKºÁ žkŒYÜ,W¦ëÞà†œ•ñRéÅ΄V,NÓ-Îâ˜êâœR‹×e¡´ºÖd¡Ÿ–«¶‘R¹ÞâUÓ\rÁ2—œ„|ÌûŸ“{Åž«¬•¿8jšw‰Ì°Ò“3ÿµÿ§™ìUc$Àþ0<¯kÓ(³øzÙ‹ÆuŠ2È ×4mŸ¥í*™üˆ_ Xü¯£\ÿÈœ£S’®‹KlðkMT³öh`‚é W؇Uà@RètéD¼w+ðN+â­õ|%àn¦ïÂÝâ–ºwµ¯ €Î?†ÕA*6à6¶µ‹¼kÚÖQéCíèšVèÚ¹ù«Ô¿Ìêaý¼J責À…©Þ.n@ä‡NGWÇÑ—E4@iú,!}÷¾“=µ R6½èûù í’úœÁdq?n¦m+ì³Â]áLÑN8ò6~}Œ,ê{¸±0 Â× ex2óI™ù¢š)[Ïœ/ò |-°¬ïý±ÂàYyü<^—ŽóàE™Y]# ®óà=Ü]õõÈFñrÈþÏLê½`§ ÏËÇ'ƒ¹áü¿-¾È‘!(ç¶•óýg³ý‘üë̃«|š+¼aÏ¡IXyk OÎè5$\}uÙùz;cž•™ûc>‡ëgjv¬+*•æÁ|nM¶]¾?àè½·]¬vsS¶®,bϹ›Ïvqó󊛞>A\Óèç3cÑy«Jhåyx9Žæ Õo»­|†“täv'·fò7;˜üc2Yþ’cMaâ5'ƒ;ýŸdÀoYÝýä2ðÍ.xHe¹¬\—|1‘„‡•$¬pÒ*ë|6¸çY0àW+{Sëð9G–½ß–™ßqìý9þÌWBË"nGefvªÓµjÕ%R‘§šd$¥ð—#ó‰}U?&zˆ\õâã2úqEP ¥V&óy–•é„ѲÓLï³Ho qFºÑ¤{Ý…R˜ÿoóà>s‡ŽuùË’ýM|Ã1HÂO”¿I¿~‰÷û碌 ªuñÓª|íÊCËJ*D+@fåâ¿w†ùÊÊ–@ãù2Ä%NÂmá$Qoˆª@… mšŸƒk˜ÎW%2‹á¾´Î‘Œ¤Š HèZ‚7ŒºG~ñižÓ¸ìl É–Ñ-Ü?ÅCCj¦Ÿ ¥¦ ñ‰OÒ‡2-¯†þßjŸJê “<$CšfŽŽÛ @å[ ä’î=žâz]'[üçXAA.h¬Ò¿ rCÑiNBÊÎåö)¼§^²)ÍÎóÚ6ѳ7ceñd ¥R !{2˜iåR"éD7N$[oÐ|®“]äªí|ÖS2£×e‰A~"«6¼Õy-KñcçlJ#1ÓÀäeAf-žL0^—$§JG|©¶hSJú M8 ®RÓqŽ|)¨mVRÏç¥Ö?\VÃ9„/?àÓ @u>'DËB'Õ:¦!ˆfÙù›¥j%œp*Xe!GЄFb(ØÔûxé™IÜGÄhE”…VTâ6¥Â~LF½ßá ôÖÐíey TSÂM~ (¹Ê:kD¡³W¯×œœm£\‡›mM¼ ÈS4=ã7ý´IöY­³#‰Áézø އ§*v°MÒ~X±ó†ŒfÙ>EÇ) ÀI­sç|ºM5¯TC²f MÈ’+­hâ ÕyW²—[<ÐXÆ‘žeîpêœù!Ù ÏÉÊq)OHé ‚)l4üŤ¥‘\­ò1gv {óÃ7•ñ"Üõ×îüÃv°‹œû˜qùáÃpNc$¼ lRí¼ÇÈ‹„8)µ¶Æž 6I¼Õ¸ ®CÅHÏ’h:Z`¼kÒ6ˆí/!”–­QÔ5‡†ÒKÖA¨là^²9a½²Q€kt–¢w7e]rÔl¿V°¦R Á>ô0w‰ÚBÍ]<šXI È0cxQ®û!ŠNUaÌkÀÑþƒšJð§GÓÞjoÚ+¹Múv2´ Ű10²Ô ÷ úïú~dîâ…ˆ,í„-ý2œ&b#µÏ>˜‚¡lhÌ ½ƒl% ý/Ò´ÀvIY†â…Ž“6­ï ŠE¼‹L5Ìë6˜ÝüX q¤ö!{íØ½ÕÒö±büÚ«A$Lí%§‹Ó®ðCú†T$Ä.‚8r¢‡/!l99»n­`œAŠ*£”ðÎuå.&t¦ÀËIV'Øêon%ÉCo— ?µôÜצywÇÍ=Êp”~„Dùt ò`œöXÊï 1-A®¸ìý%‡ò]r8Ú!]œr(B…*)\ÓÒŒ ¢Þ,cq€àå’oÒá×ÃL›ëš,ÆyîÁˆGÜÞrƒW·ˈ³u­ÇÊ÷x°ö®0Rbæjt~`ІÀ;ìéà6fpRq:±zá5¤\ oÿ Ì|à±_»ø7Oy4¢¤,qž9}“IsŒp”óëm~.Ï)èR¨Wˆ–È-‘ð²ŧ ý<…O:r—fE‚¥3,ä:ã ^‰)Á”ƒ3¥«Hw•EælDØÓËýǼ³»S ¬Ÿ,¹¬dŒÐCI_«×dÐÞ;ÒËÄe´ ›î‚™8¯ÈUä6“K»Ë-änÄÞZðÀq´¦¦h¥å¡ÙKºxÔwpØ[!ãÙÉ¢äð‰œµÐ莟&OÓÛZËÍ’þ:sV¼ã0ãVXŽlÆ´ßIðAðqš¿¸ÉŸÁ7tâmc‘ÚªQ“n _/lÚpl"ŠyÊͼ¡ƒãeÃR’Jãm-ñ6JzªaA ƒ|šõ¼®Íï*ÿºNâ\Ç||{:¿Ìßü£èg EwÕU'Qi<<ò¾šé ]nB;6O`Ñî]d Ø¢DÈЙy°‰vÕUõ—Qv^c`°Â{€Á:gXª%ü}¡õýµÞxiÝùÒù¦z>œ˜e0¼ ´kD†ãj@){H· @[W°ÙÁ/ÈcžÜ(x2R©øDÐ包z¡É؉ê)‹®e†hº| -º¶àQ»êÆdQ…¨€.Ú[½øZYSÊ—ƒº€í±Å„Àb8ç‡åîU\ívºˆŽ‘c&ô¼­uvÁ¶˜0¸Öæqª%¬%®Ò‹ªi¿Å!²_í,“ô%Xx÷eî àëFÆÍ«÷rú&€þ[û"Êö'±—@"›9ÔYö­ïC¦ª—dK°±Ù}±‚ƒI9´H+“ÎúóÖ*_Ôæ†èô­§úc‘šïyaâÛ¤œ[–¯¤=’¡.µDE4&÷QÝá+–õ”áÚTyfÄÙ‹²Ä™»‰ï^—þ®2Ÿ§ÆHÍã.×Ô)nÅ&.©Ã—mçÓO’?²! ÿ—¥g ]¿U(àt…§eòó<¸?¹BqÄudS/î^ã4”m‹$dÛÑjI¢uOpÅäJ¯Ê·lÀ¶læ{vXÑË dÙ¯Ëägy4~9E>öš0‹ djÈ|º¿r%»ÜwŠ*À ÀKc?ˆ¢-_ãâd*¡ÔÖ=º4MË8©m_k&vHU pÞg]Š+p¢MÛ÷ ®x4(¢ (ØMËÉWd`9ãÏÆ-Wl/yœ­ÚŒêÐ9f‹EämG:0yø}¼UжXE7Àó ûE¶/ŸûÒ²Ý_¦ºÄ)f ªGÁVYZI_jiÔÜ á2½ú“>¾Oõ×vÒGü’ÛÒ±)v7‚”â¦in3% Ëý”aç†í„¨ÏEjÅFïq·&gi1fëd½Éd Hñc 0H!×ÔЪ]'ˤ{¥?¦Ûž>FvÛ”Ý^²»]ò4<ËYr1¤ëò LILY¤¬ÿj»Ç*Žá(PŒ/ ŒàÍ5GÌc´×V×l¹â6ºáV 7òÀàÔõê+bŒãj…t««Š¯Œ8ð ÷IÅ ‘ïÝ & Îlè8ÍDsNÂò©ŒÓüZ×»c÷aw›îCm¸îCðøbä¨È=Ñ¢5HîªMí:ŸÇÐÛjëßø¼ †›ð¼J¥+Û­­ò]‘1¤ö¿jõqíÜÝü¸ä¿WMœfž ö &¶BN½4èû1%,Tú1ïegWGÚåBµ6tçaºm«Dø„ËU΋tp¡ÿxk.«E#»a£åM ï“h ÝTmiqXiH1Èa:5Á>)ÙMË0×`5Ýü‘¦V …ùÃ;ăzÏ/V‹íFz<®4ìæq–Œ~py[ݳX˯èIÞÓI\ ãîƒòñyÎ…±uß Ãi Ña<ù)ÍMêìMƒ Ô¸upÔŒýû•Á3*çu#Žå}o—®f"Å~ ÖÑ«Á l_æíh0Gš|ÀˆQLhœÁÂáâ–Eš¬ri2g–©ü;öM†ø×BîöñGÈ <~šÞ«ñ^ó8`ü(yʳ"XDVê/aÉÔÆ$ÅšÆ_p!㤃ˆöà ô~ ­e²šô&€©S|9Šò¶F_ÛÓ×Gƽ`¸çȳìès=Eºhª†_É)ÏqkÀ7yhü:½šërõ¡ÕiM¨(uí] A žàR:LÄmÜ,îì—¡ö$½£D«4òcΆÕ|­(¾]¾F%,–Ÿ —­#8n3VÉ2”Þ»Š> stream xœ½\kGý¾øG,A"÷¢ÜÉô»'$¢Ød‚0)Fh½ï’Ø»~`cóë©êgUOÏÌ]‡@d¼ÛÓÓêzœ:]ã—§ã NGü/ý}ñüäÓGîôêõÉxú{øsuòòD„§é¯‹ç§_œA'á¡e˜ÆIœž==‰o‹So}j¤>={~òíîb¯­…”»ó½ÙÝìZaƒÙ=Ù”´‘v÷´J=kwÿÜËÁ9§ §tƒÑ£Úýk¯ï­Ð/ucÕß^ÁûZJúÝ-<À_•”Š?Âz’¤;.äNi)U^—§z2»Ë´D5Íß–Jï^Ԯ鹖<½?ˆÁgéKq7vÒ°˜Ø B¦}9¥v×uÈ, ãñ¹ùÂàÿÞËi£Q°=XœÙ½Ý=À >í%Éì ‡¬G«F0ÎAAÏitJÙÇyˆÜh¾QÄí^¹F˜vïö?ûã‰ý`5œýÙ%œv9¾çûƒ¬uV§¶Éè¸#?f÷Ol¤räqžÛrÝÀŒ‚ôK‡å„=q)XOâ4ãT_‰Ga%´už–ƒ¶äipg¸ÙCÚíA(èä㦣X½]-ûOJë•4Qîh'Œ?íæZ @IŒ‘T^ÄEiЪÌÕ¾Êè÷Z5À§—iJ%È”·T{¸=¥ãnŒã¢¨UU°O`d ú #3m$+¿Å.n…ÉƵøe{G»¨sT{Çß`}ÊØA™lî°Ö`ý]ƒe‹ú,ý€§ùé#91&ô`O OÒ"ž-.uGÎ4Í[17¾ªw¥õm¯ë³òÓ›úø»ÒøÚ(J#ˆVû(··¥ñ¼ö<~LÉÆœ<üŒ&“o{c’¿êÍ^esÑ{çñ>·Faó€q˜Ü`QÌ\ÞƒcsΚ›CÖ̬9:J~œ&µûj/w_߇0yü?ÔIÐ'tïYE´ÔGr§Ÿ]Jœ ì^m¼éyÖËÚˆólà(× · ëºjÿklÁIӠѱ;ÜÛš?Ú3›®= 'ЦíÜ)¿•¢?»{ !κÝо=üOí΢”Bïþš]›$^Eñ$† 1GÎáâYñéÅ+£$ÁËÉQ“÷¯éñé•wÞí#žµ›lŽZÒ‰yxæ!ø§[n‰{²9b†Õ>Ïæ?ÅàëÒ>@)8TÝMš¡Ô¢f`;E;m}@EÔc4¸¾ ì«ÕzmUhŸk¸mÏÍ`èÕ(· K (š“ÿcÊhð(³ÉK fƒ»Æ¶hfaÄ™¢òUû©Ûk_æ,? HqàœÆ F=–ƒ/°ç%QÀ7U«ÊôTñ2% ê)zM­½’ÀƒóÕÞ=áÈoªŒ«ú ÍÌt:¯ ,ÌŒ°-EÖ2”Îi®Öq«óØQÆÝÎ*îy´WràÚƒFÞÇ‚XcÈÂÌûJRö¯¢lçÞû£ªä3óYѺîQK|ô^õñm´®,û¬Ââ´7ÁŠÆ1=ánŒ¤´ÇUfƒU{úRc'à[ ,,©  ²§^€¤=…äÔçñß: Ñ‹é@Ú™®o¡­ D º  []&Ú‚J•MÌÚFñžýRa w£pÔÑâˆ)PÂC¶~~ôɆõpL¨e×Ó¾hŸJ"ÚìÞa~mz©_ÆÈ×\­ˆ#%Q¿eÿèÌ:Ú„TÍŠÁˆ© ChÆP_`õum|Xváç»òB°Ô—P,øáÉÙ¯¾Ý}‰“ݯC<(ï}U¿îMVWÀ§ÍÏ?)ïǃ`obš¢@Üä¢@ˆ¹®gC#äOIïõäZ“TÎ;êEð¹sƒÒ²Ï TyS§#=ÉgËИbÀ¨ìÍÑÌAu2ŒN¢•S“›h⨎ÇA˜éò)þqÛ¶C¨ 1òöbÐO“sÑ^qJ’ýå1FÊÃNƒÈÀ2tpû4ï^„Ð<& ëõ‚¬§hóº†5âVªkâ!±„»Ž£ÃÁ`+;nætpc÷ªbÌPM«> lBȵÎgnÂ;ÆÈöµ´DêÆ€,ç óá¹C=膪hQ/Ž¸Ö·Ì¸iŒæYå6Õ¡õ®ÄU^õ¯1g•Dm²aN;¡úiNw[‡Ý$ú ÓЬvhÒ˜ ¸;—’(ô£ðXZc…Ì`Fás R…ýâó㧆CŒnÏ·TÃG¶Äµ¹Ÿ"c¢%,cÆC5”šsîb¤gÌ­cgBGŸtw¯ÏŠz]%‘$4Ë©jÊ§Rà:‘–{¿÷»W¨M1ŠA“/ö¸Na,ß°ö°aK#.#IÊ;½û!f ñ n W2cÌC¶˜„[LÈÚ#cót?e³ ýfò¤ËWwbÅà1ÑŸ·dD:fLºfŒ±FÀnÞ/Êì­Wð< †goÆXT2çGzGMŽ¡Ñ&ó^@2I:=´&½œÌ~â¬à›ßü¹4>ªbt™ç‚nðóúã/j‡oXk@ º—–ÐT°)Ï©ñLä´DÍ] jHžÞadˆ‚4‰!@0gGs¶ñ]{ªc]£ÑXÝ8J À€*|<}‰þ_/ù®dÛæH$œaOÛˆÖ4h(ú +4÷©üõÈæ‘2ƒ>ú^F"ãeÔÌ-ã€õµkî„d„óöë"ëØl‰8ƆÁ“—8`YÆšþåÄ´K’®eC1ìà_ÇŠà JJ=W>š$ŸÁ¹B\FÞŒÏǯ.jãØË_ÞÑžk½ºu'ï6²ÑѱB²Äç!NÓ<´ÃÀГé_€èlÀ/j¦F×»>¤è#ä?‡Òø[h„HäÉŸlœÇ¶Àý¶׿i2g”ã5J #Œ‚"S¬v ^g>ÖƒÞürn»êøM3‘® ÷x}Û°Ò¸‘àûqèÐx…0E¦J‰È6§xå­«ÒŸ&Êä999ß2J Ãár-;X-›$jyÑF£I=V’¢µfå~̧Š"¾ A¢m¹HÈ[6Å6²G&¥;+¼ŽhÀéJT¼ñ)w§€Jh`̃ý$¢˜Z4«Ìús¾gC¾è.É%f€Þ¿(­ó¾H-QjYTÍ=$¹¡$Bt©$AÃooÍ$kÖ)°§ ¬*®†¿&w¶ùð8÷L$/vkeC¦¿âݯRdñšu¦¢ƒ¸î‚qÏÓöé-k M"Èm!Ò[nBËl¹HBYªi”‚ ØÍ>­dMº”Æ:ÑÄs²"NO´•°©L¦Ø@öu}ñ%¹è™~Æc #¹¼:tR ‰¦vj**í¹òô~àMÔ‡• e|x—‚ŠÿO„øÍz„Ø"ž7ÂFïLÐÿH×Ož×#º®k÷C?áÈKß­ïAlìa»±»‡£¢§l5S“R\¿v¡Äaë~w©"ÒÀ¤¸#e[[ ùVu9=M9Ô*LºÕóÒÙ—s¼Òa«èe;‚öe²AUÉæ,0É@"=:Qês©Ã~YÖ9ÏžsüZ¨—¯ô?­Cȳq Ø@(,XÿVhþé@,oýú>ª¢ —jGBü¬N¦;º 4&–p¯}êÇ+p(ŠÊ—þeôÑn ðœ×jÇ¥ª¶Æ›”È »UL'ø¿±œHÔÑ;<ÓŒ;‘?^ùËEœï\Ä¥“#oââíˆáœ_à2ÌKùÃd'&üç¦èÇÂ[*^\`ûg'ÿþ É endstream endobj 177 0 obj 4229 endobj 181 0 obj <> stream xœÅ\[“5’~ïåGôúa8‡q¥»ô0 c6˜µ{_xhÜÐ8h» 3ÌØ±~2S·”J:ç´iÇT×Qé’ÊË—é—óuç+þ“þÿüåÙÇOÝùÍßÏÖóÏáß›³_Î58Oÿ{þòüÏ—ÐHx³„5ˆóËÏâ×â\*³(ynX¤>¿|yöÍîÛÝþB-ë*Äî?÷r Á{»û±¼¼­/¯ÊË›úòïåå·ûý…þð»?•·ðd”€g»û¾¼õ{Q^®£—¬åÊ[Ƨï.ÿëL¨Å˜àÏ/¿<»ü¨YÏõÛÛòòª¾¼)/af ðìv€G¹ŽçºŽæzä¥hèC£ÝÑG®ô²ŽùæÆDú|üTxÎ 8àBêEˆÎ/¯þ¼×‹RÂØÝ‹½\œsj÷è"Hh£vÀ ­u0» ¡ÖBJ hjxµkdg£Õîyixµ7»WøC€†Öèm¤…Î.” ‹±–½®Ã¼Ž´ñiD©4v’¿îg„¿_cwð• ÔNÆ[` ±û×^†E®F±ÖeþÈ^.RªÝoµ[øZÀ·ÎÊJ’4'+èt¥Á?ÌŸÿ7EJ Ëý0)ìîn_–i’'ø+lŠ‘„uü‚ý¸À¨0””z÷¬N 6gM_ì‘Ôª Ú€v¾Y“);ètÚÁU” +ÐÖ7ÐÕÖw±uî´é%N D -^§¦ÒM[\—ÎpòJŠEÿ¢ÔÛUÆUÄϬsyðeßpQ ŒÖ™4ÒVB§vo÷ÞaC±{ 5þîst!SK\Û’zM’e¹dA;®‰Ì^Aó—áajºýS‡ #¡çÝçÐ'Ÿt4X@¶’ø¨Vbê``Å»Kx‚5•ï_îl+|C¼fp»/Å|Ð+J‹"$É‹ó¸wÐf+å Ï¿BW ´Ç?÷Ö-Aà ¯íƒ_M ¹pФó3Ô1*Xàv6Ûúx|öÝ+xôÞk‹,—t×HOR´w8Ró$aŠwã%ÎÌZgu~ôÎfT«$•Ãô×mUoy«JK’bz½Ìã·hó@ˆØõÓÚSÄ9´ƒ8Ë;•ØqU@y%#ïáœËìê몋%ªÏ•Ó@¡ÕWÏËSU“•)§­s·W.²â¿h{]d(%ˆ‹Ø[¶èÒÿsü\+Mz1Q€µ»*½óÅ"H€AЬ¡t¬Šìã`ÍnàþÀÔ°K£ '¥)ŒÎ Ó±[cMZˆ—0ÂOU½(_¥•HüU‚õYÛ•…[µF½Èú® «–Ž÷ªÕx™è YRÇbU-UQ‡^hÖ]7*„hÓZfföÁßsaÿH„®°Ï¸ ŸÃäÚg͸’Ä%‰_IB‘ÊJ2Ù0oÒ0_ Gû V—„•aÝî¡UL›œV}‹ÃÚEVû(@?6]66Ü‚- |çxƒÖ”çYå? ¨ t é÷\LÙ7²ØÂ/ŽKDNÖ"rò5çïÄŒT{5ø·K€pÂú¤—–o|Ô:Vrãüº5ßlVckMxZNkÃ?Ãrd&íÎ 6ü²rù34Α&Ó¶8Ê÷õŽÒm-//ëËOË˯ÊÓ—õçG|H"Õñ!¿ª/¿nÊ©ÆïÛ¡2¾Ë{!è|0h$·ÔR‘[Lrêƒ èŸHEbKÊBN¬5¨‰YGC+¯íq‡—E¿#(E½±D‹iáà?³RN/jÝâ­»:C^)^©‚óüÛnÀ«6Å1Rñ†P€‰;F Ø %þV,Ø]‡=¢jÜØ ¤ 2º£ks£bŽí—’e¬‰áž~lœ~ í(à6ÜÁ.”ÈtÅD½ŒyeæÊ=ͪBÜVw0s§“ÇÞ:¼™c`QÃÇU¶HæYE1—{´wïÀSP–ëë¡ÿgUg³_Hüc¾øëh^Ñkoó_‚~È¿èOQJÜ÷œÅ ï_!3ý¬ë»pôð#&N˜•^#{?AfÔàmû¾rIgˆbþCyøˆŠ0Þ„‚ŒÅÀuË}l=‡¼€:*Ü¥¨<&:·‘Ÿü½V-d¯–Bsi= …­bä ¶b³óL+ÔˆÍ[$›"®ËÒc|A[Ž 69Ä&ÕžÒÜ )bOK¥OÑÚ[БÁªJpùD¯²j_æ•–/в‹X}À¦½Ôøù ¬4,_aU+8¢°OÝV­ˆ˜Éêȉ Ý0âž.vý3¶ö$Ì5FÄÿ¢±& *›{¥SÓ´Fa¨¦°×%ÕØ†ä%¦h/05œßJFVNo£§y³§V!%Y™žeÌßÄó‹?ùÀ±›ìÏÅ]õ AËSf%)«d§ø™ûº±Ü€x¢jÂ}ÿh¿MLÒ¼bêˇÛT‘nm4Ÿ4ž¶~Xq‡±–±2S\,Ìß$«;Zs¯ÐSkåÈk ÝÀcùÔUéë‰dlV¢ùðÛínÎ2m·´±Òìªh³sU‘Œ‘4Ɇ"ãŸ@¥"µå E¼ÀkŒ:wš}ɽA8î£øº1”Šü­TÅ¿rË€®Ä&h:ºÿòYeUý ÌÎ{ã`¸ ”hG…™jÄ„IH¡NZxëÐÞ'š¹—}3T\Ò b©Vïo»Q¦åN©¾Ž dic÷šbÆÞD¬  ÒÑW-‡½/ÎËûV¿Jóau¾[yG”v‚¼ÛëÌN÷»$ `)x>Ô:ŒC%#87´"C°xÓ"±FMd—a†ÏÇåƒÆEÒœ¤÷‰ðj#_§ï\ÀK¥Ö5eÄ"MZãÀ§¡,54‹UæªTZôà ±öê¡Ò|.Üâû@–¼º†·ýJü>åíTÎÕðFm¢ðy =‘Ï)]àû@ s‡Y@ô~(Ìð`+óg9_7jW IˆáyÏ.y–GxQòUS„þœÄû~8é|$dÄ´ÄÆÇ¦ìõД4¹ªÌËY‹NC¨u>“Ô£ò¯¾)ßTn"¯2/u“®Âßo’ûRâ`['ê(`¶×#ã’©.§Ëî“ ˆôhEàÞÁ v)qÅs³†úü0ê¡Q~y”3Î5”ëJÙ—ã…é°ÃòQ'ß´øãJ׊ødÕƒ|4زRN’¦|Ú@µD…–4ݣů<2, Ñë²úUtTKÓ¦â¬V¼OƒÉT;ªÆ‘_¦ÑQêÚ,›=œjÉÅæ'¦ZªÏC؇E^3ŽC¯%QÏ4,ÏoKG>J:4;ٗ¨ÊÃŬ¹KŸ¯{” Ót‹=ó±ŠÀ2,¥B~|ˆï¯ð¹µ–÷$®T³óëw3{Âù\W9¥›«Ñù¹ƒA íL‹õÎÂt#÷­?æXR,qå³óí¬À5f\—ל¥© O4Nò$³>ÎmXöï._ÑN³ÃYóHsÀ´çA–\QþóÀÇ…¬ÑSf2Ò@j¼ëåïq hRµi›éá±Ê,Öˆ´ +2Á&¬f/¾Ô¹P‰:Çc¸È˜g~C¹(*]Œˆ(λuÚצâ5•›Ž8²‡ÜuõÀ:÷‡R-oçÌä¦GO¹ÕbqþïàÍ?Š1Þàíè#EŶïÞåïÂ!9­ù¹¿ÁIåŒ4ÆÈ|oÃÓLbð-­)aù0a|‹·q$fÅ`y¹î„Œ~2l-¤¿eì™nà„Hg8#NÙÇC4ÄH¡zªÀ­Átný¶=”<Œ4$QŠG0œÊO+oõô¼dVÒ¯ÝTFF±Ú‘Í,2;4¼¢8Î(ç›sL¬pB¾c̶ïN‘Zaºª¼w”¯@/5!&¬çRƒJ£©qOÛõ±^2,BV_´§ ’RLöGù,˜y½tÒšßÓë̓ØuIÝ&‘-GÒÏq-ÇnC$tâB5nSÁÛ(—Û²‰“¢\YŽã+¨¤‡ñ•6Q±)Ïu’H)=«ªk C>–yìL;[S”‰ ñP|,æ“¶Åîˆ';׃n§zò%Uw‘ź:ªß{ŠÊZkVÆ—‰4ˆ¥7çøIç ¦b ¶àÞa=uEAþ,ç'A¬’¢ˆcñw¼’“òïAÙì,zœt6`›¯hê22Ôf÷ å³¥{ì:<ŽŠM‰û; [±Aj$)«ApÓ äêûhÈÿÅ‘1L«xZ;žºIû ÒgÝ៟!"ÁÐiÂr~Ò(r·t›Hìuc°hq¶½~fÊJ¹ðZÇc¼*Ög‹áEǼ1ZŠmé?MV;;|ŒÓÇÈ{Ê€0zÜÕg‹¬åÙÌF _¢çoYrzæPSÀê*¡Ú099(ÑiÄ$‚/‹åèzÔn|œéðûï(”Â↑ì¡å)ß”§4Ï0ä>º‚bx Ѭ§2NÆHé¹U»κàN»N×ûážÑiHÛXÙ]mìþ5vÑZlà‚vñ’CMžÑSXøƒtb½ªífß\.À> stream xœ½]Y“·‘~gèGLðEݱœRá,`ß´kï®÷aeKtÈ ÛC…xŒ$Ò"ýë7gHTwóp0HöTW¡päñå— ÌÏWë"®Vü“þüòÞWßnWÏ~½·^ý7ü}vïç{"Üp•þ{üòê?ÂMÒÕů^\=|z/>-®„´‹vWÖˆE꫇/ïýõðËñZžà?ÏðŸ§ðϲ®B~Ä_à?oÊ-áæ¿Ž×Ú;¼ëp¿\}R„väâ½s¶m-_|Q.Ög^Õ¯oÊÅ—õb½ިݶ¬Âþz¼6 éÕá|”ëá/´éüì»rñ®^ü¥\ÄGWŸ·Ã—zG?þíXnþûÃÿŽÊÀµ^—Õ­âêZÊeÝüvõðÖÿ7ì×æÄªÏ¡­Ekí Œ_Ã'!%ŽT/Ji/Ã"¬j1F’ïoކ¡¶Ec° ¥ èúýcX!%·EJ•˶mqv„ó}˽0¬ºµn³¡mòþŸŽ×+´%í¶áÄ(¹B_ÌœÁ¥É-½9ªÅ¹M)¹ôJ¼ãU½›}‘z¶zúl÷Bü1ug³:õQ*MÞQ¯¥ç6a±sº¶YyXઊ3ð0Ìôæ½hg:L¤™êÜì3èC?%á[å_Ôf^ä[žqñ¥ßo<(}Xänð͘Òëuz‹‡Oyr-TìèüÏa„Wòð6¶» Gžæž¹Å×(ìBèÀ«úùæåH eÒ.™K´CÂ,Öì|t r²¾‡}Ç} M»Ê8ü*\éÅ8ÛËÅ8wNË0¿é…nÓä¹Û$ׯ×ÅÈ ¡Mš’(™oë\csQT¬¤5ò ”í`:M’ª‰vµ'僬å ²äý5œÖgI Á}ùW*Œ°o±ŒÆ}¨Ú¦ï–(æÎ¡#KRþ± †Â›5 [ Ã{Qî!ƒàtæ†4vðë£<|›‘›8üg\e ÿø¨aÐFáG .Õy™&ñ^0ÒRç«H?Η–òn„-vs`ÖEM|Ñóª2µŸI6ËC‡ƒ¤É j`¼‹st[Õ š^â2_qè#›.kÕ6ˆë`8ðVÖ3BõGxÕ§ªIg˜4èѦ‰z=Ù[ØFGs™aÍ&Ü 73['n4ÝÙ@+”Ê-kŽÒæV³–†4öÜØMôߪA.½¬Î{¨ð£èô*B¿ÓÏLGU‘· LJÝWÆÂඃ„;.˜V‰ëÜkµA†!’ ê"ûîNpódn†E¬çIÏ&4ƒC<ϸ‡›lcOƒÝµÁµÂ<®«9¼'8厙þ*‡³-Þ£eYƒe©3Ap:Ø5·„n#˜¥‹D$w]àYtd–IXå 2ånvÕ’¡v4ìàÜÏçóoÐòxŒ÷p¤ï#¢ ¯ÓG ¥ XÓ ðmëÆûjÝ© †±êˆ*pMÕÆðGVlá?ˆõý îú#¶^ñ›#ôtsðéû("ä/y4Ç·~¬ ÞIä·Þù¨Š:AìÀD¹ÜðÖ Þ×îÈŽcowÓçÔŒ'‹©ÿ¨ê÷u dájàß•\„°>C.<àl²>ÀÆ`Uµth Ô}2k`ˆ»>!Jv`ç'ˆ?®o«ámfRi0ö£Zf«™¢û69 Ã;ÓîÆãd§gaÒjˆö»35ä.¡»ØUdÁǶQ!ÍADɈf¯‡K .ç\k´p–JglÂ6ˆ(õGZd4ˆ·ÄN¡üìˆ ÷¾¾IŽð¦éœðÎß’ÅO5€=IÀ%Ž¿µñDìÈ‚`o8W†6$`ÏoDò‚º½Õ°ýUšŽÀ212i\­u'ž!‰[ ëuW¾+†nD #OÈ11bÊ=.M 5ÏÇùØ pŒ0,é[œ`Løž£úÞ윉òk‹hjÏ1BA—©5 ”}zÇôîǶ›„Ê ›G¯©³œi¿õ!4y{«,ä¨S¬3‡æ°üð€LÆ©4¸X_YzBÈ?+ŸÖ‹?–‹/êÅ7L¦á—ú5&2jVaÌ °ï¬/"Œý«rq9»!òJ ãUޏ€ÞW—§$Ü‹k´š¹Ûw‘¯!P²Ñ¬wNí–‹³ Ún=b±hV”¦y,®r3Ãß‹ ºœJ"§\ 󤬖¨§¿6”–V“¾ÌröpÇ_B›V´~Ó¢èÔѨ—'~hŸhY¯¢C£oC]h9/©UXB¶Õ#qU|¶†Ð¾ïŒ=5,Œ¡Xb”\kãùË ò–¨7ºV °{Ú…î•áÊ™HwR" d†l€ñÒz„ë£Ûv E˜*³•×F$-™a ËS‹1vB¡ÉêÁ{üØcS\¦o¨ßÏF.,æ¼'ÁÈ©¤‡ïmé7Ñÿ vÅ̧‰*ÔŠÜY°níÊŒúTMNqU˜Ô ­²ã¥Ó(ÁJàrÌœ¢t¨ª Ë3sŠt{×)âƒKâAæ1J{1:86÷øª2Õ-LÄŽÂHQï(7ÉÓsx™gƒÚÌ]GœEžÛK±1€àv<§,`MnÆJ•Òª<„LÉ>gU #y 7],G¢<ì’‹Lß Ýy$]Fcµ…´G‘Ã>;`˜¨«OÑiò)hR64m®5>éFê‡køÀƒÜ`òa¦Z‘˜°Á31–†*Ú,Õ ³é²¢•ËK)T-¢øÃDo3ñŠNü±~ÿM¹ø]óP®|øáì‡öÎ5ËZ™ð-Š¿óë¶fY›c O¤kyvì “œ_yEïlGˆª±UÈr©œìÉ Às*ƒ•îc8&)&>{°:˜A$ÑÈÖs|Ù@È US À”0Ìæb…™:‡TÍÐ÷qÎ#ǨšF²Ï{i…{¬ývÖæ5Ý{‚C±Ò]ò3óñd¯IÃçàEÜ^6ÅøXj –,V3YéÚ"η½øärg·40:í]˜ O¨—4Õš¡5ê¤BÎK¸ÆvM¸2Ï]š‚¡ñC¨Ý¦EEdâj»ÍÄœ.n„ ~¬ª¶ðŸåß©1Ë´†³»‰„)<Ÿ$0ð^a}/ƒá¡ÑO`aÄéAû@;ó¡ÆW$åÎUòÞÕRGf Iö»R~\NBáÔ×ÑÊDO“ï òÐKòœv¥òN@¢ ÙN¶¼gÕf1¢Òh·óI’)™zB÷–rȉ‹Å½ Ù|ɛﴫŒŒk®!žúùŠSµ*¸jJ¢+ùÚm¦èkaþ’uÉ iCœûËÉO“yÖ„³iì{t7Âò¾‚d³94@0B[gzhý.äÀ±! ›ÖH¥e奣vÐ!yhÉqš’ÖI4Îß:RêÊàŒàíAâ­±Îh¿ä£„¢ìvP냎2Óxbñc„¤>®#ûUùûõÈ$ØþúöUùPTvÓ”zð¡>ƒÙD·f©m§˜gpH„‹a#(Cœo'¤S–¹m]„(>Ã9Ю j±ž&LÏØžbÈé^Ù˜fE%yî÷tG³£m»ãŠ«!úw&+ £tv o+LÏñ§p3§Žì‰›ZiÇ%܉D²û£n½8a;Úýfø@®Ð‰“•$™…7Ø7Ц ¤ñ=Oó*ïºØ»a²!#?G$I ŒÁÇ|øhABý‘qçä ¢KDö›‚8K“(ó©+‚Õ¿¤+~‚žÁ«•IÂÒözR}IþN7ÆŽè´Åi’n{!{Í¿>ú5.Cm*ù‘U ú€*gy\¹Æíù&´ßI)É Ã”˜+»…-)õÉwdÇbWWwÇdÔ]É)žÆ²,v°y`¢° Ê®I·˜hYÊžÒMœÕ§U{”a®ìóêIXm¢ÿñ¹˜Ìɱ¤ÎžnUl¬ñù‚"qbwSN:ø&'¢²¢×Ñóàê ¸ÉÀ_-ü]C*1yX5ö&ÁÕìàJ9ª0ŽßS`pb†Μá!QÜ-[ù’‘Ñ'Ýp«œé-þ%Æ9ìT ¶n´q+(ᯠŠI°±®àuaî‹ªÊžÎÆÕ%À°ÅÖéU3øƒ¹ˆÛÁ¯áǾÌYçjjª4­áõ. UÄz=׎EuÏÞnT4á¤F'ÉÀvHÈvñjÚ¥3Íîë¸kÞŸÜ Õ²%Ú¹ø|ÞÜ òÄæðŽ:™Y³ls•§ÒÙ!f´;*¤Ïw{ª“ß'ž+)…à6“j%Åͼȉ´¾"mg 3j´BJ#ÄÏtoßëc9OEê|±v8ýAïìçI£ü`(’&áS@‘íC²í{àöZeç‘pw„ *<6Ä65˜õbn;Ÿ†q.©ŸQ@’ôs˜키œbZÚƒ8|M4sO»ÍJ1äoE[[³ŠžIl¨–äòµUööù,øb·ÐjéE•”)eÇ}醄ÿ§kÿÚ dëÁ¯åb=¯ñMýz)É~KöˆÈzX"æ ¬ lyÝŽðU½S•‹’{Ñ¿qMӺ؟ì[ød­Ÿ<{‘îpÀCòüßQgÄEÍÛ&ô[fsð¼Ù.ýÆã­1d=Ÿž˜å1g·".²;;‘â~í–©‹G;:Ú‡×täŠÇ\åÑXø 7”%ç;(5šnwPb»C> nB˜E¾ õ{àÎ:Î1ž¹iÍ8A–1~Xæš`äsßS›¹ÆcxÊ{˜\g¨çõ^M63NZ‹ >ChW5½¤þË~ë€[·/u·€ß'Ù¦\9è#ùt¥°š—œLfÉÅž»¸!b(ch5ˆìÀR:qÇ¥ÍeC¡¢0ÖÎ`š‹ä¢È‰Œ¤€3×8оo°?1…Õìúõ.åœòþÆg«+µçÓìBfMjAñ·É°g!qˆ£H{m¦Š;n’ôÙ=žPÌÈ[!D س,ž‘ØŒ³2c>˜$ÊÀÇÕdH“ql’áÛçQ9¬GOMìCªBÜ\0M²nDl1øÔp§LÇYE´ùL…“'ÅäòñSoý2Ù¬ £+a×ì,ŽñCòò¡f¼Û‡×¦ ™H1MàÙñNä•:UèÅÉ*[ ,šêtp®6äž'¼qeôfXIu;ñ2ÍB°n  ¤¹¦ íT,pÓÀ«÷à °;'(6]1…Íîöã1cím&†ª—B©ß9iLÙ6X™"é¶1¯©ç™ÁØëxBÆ£?JIðÕ¸I<ƒ,Ýd_©GUàRŒDSÚ‚+ô¿¶?d~޳qíÞ´®Ø¢¤iu8<=–®Z LhŽÉá$¤½ûQ‡ºDÅGžñœy_~ÙÎe:x?4õàC!ˆ‰ Ê%ÅóEdj%VÛ –Lg·gú’aÝúNšxuî„]&]¨¨u²{¹>M*(XM`Ê«›­ÅêÜAÎã`lùKâ.¶ápÒ O]veÛÕËž›Ä}ÞÀ¬vÕ°üžO?" wöÉ=c ix9îC:PÔ<)%¤N¼l°Ì~V©p GK¡‘÷6F0lzÄSØâ)^·ÂÉ‘ì„sˡ¸S0/ž‚·´çªh8›®Eã—ä¿Ý¼3±³'_™ncÊ'Øx} 1üƒ %›*e7v½E ?1T3Ý—JúÙ¿]uÞ¶†4ÙMð4¦+°£ ¹¤=cs°åËŽ•Hå%ù6´4é÷pœrà”¾†ÜÀéme¡Î®]Þ6Ìì‰öyç Ñîö‰ötOííô(hÈ)Ü£Žf'é$ó˜«Ï™zUœ*¥[ë[ý¡]’QPb£ôËÉM¿R C»ücêT‚.*—Ö*(2$rÀ´³Å§Šë®ž;bÎÕ¤u5<ÅBN·mâ·x®,¦ß5“"¼3šç¯oÖ!L‹Ó®¤—à½ÙÏ`"pRǰgý©4#74NÞ­Ïä;hK‰É„ èƒàß —~VtÉ”5‹ÜÕU˜äš•å_C÷ÈÅÞK†å*ivœ‚Ö°eáÒ¼eÅiVÙ—eûôÉŸ³x!kHzàÒ£JG¼žwyä´™k߃ sÐÙ×2ÇEBº„ÜùÁÄ„ìÅCÆá\µXÔ0üÊ(vμÆ}‡Ímñ_Ξu9Köh$¨´Ò!¤]ïøÍí]ã>"ØÃ•Ä‘ŠuTxÇïÞûüùÓ\Mendstream endobj 187 0 obj 6078 endobj 191 0 obj <> stream xœÕ\mo·þ®æGÐÜÒ†¯K®“uÒ¤E ©"4)’|-Yv{’ü"ù¥èï _‡ÜÙ;)±AΧÝ%—œyfæásÏ÷Å ÷þ—þ}t±÷ñ‘Û?¹'öÿÿŸï=ß“áýôÏ£‹ýÏŽá!5Á•a“Ü?~¼[Ë}©ÆÁøýÑÊA™ý㋽V߬õê ?žâÇ%| BH¹º^'å äêÇÕúÐjènÒ«ïËr}¨à’÷ãêîË)Üÿ'½o•€öfõãz}èüè±³OˇØ+¼@Œ«¯ËÅËÚëYíõY¹ÿ´ÞS.žÕ‹h$<ü¡V/ëÕçõëMüj´_Ô«/Ú׊ :¶ÝÕüõ¼ö@FsU¿Ö9ütü·=©k'¿üÕÞñ½V_5²oSzúEbfî×öª½/&ÒVU  Šô8ZxôWTÑëz•´:­>K îÝ(5P!¿Á·eŒçåªf´ö7Ó Óv(÷‡z¨÷QR˜e;âtñ’Ú{€=˜ëI¹ø‚UõSNºØÑcXsýà³/šÁ˜É “· À ¯x2SëQ2'½z„×e'ÅØÎ‹Òq„vúíÌŽiû #£Ñÿ,`õ°´&ؾálò”N¼SCg&gsÙÃm³#ìá%«œÓY¿zϸg“‡4F¨ì!?+fîúÑ-kéÑ-ñ÷¿+÷Ol¥‹O:Õ¡«2«¿R7‘ï?¡æÃ4êt*­ öQ§¯9—ÉŽã)UtŽN×Í8z;õÓ{ _.á+˜Õ…e²²Ó]ÎóÿLkñÙìf>/x‘}Mì+û#½~×s?Š€™æA‘zø¸iGƒÿÔQÃIÒŃNŽÖ[]×u ñóù}Q<ö&Ë=¶z–§\þ{ß›™+¯÷ÞÞÊ•ßaJ×Å´Z­V…ƇÑ_{ôŒö×Ôj/Šh/;½ÝÑh s™AP¹}ó·\ól#1î ¢òë%É:¢EpÖó·K|ä*9÷á(”û у÷wóF'Té¼~|$=]fxÊ ¹Ü*EôSXb†0ç¼=/Þ1“Éø&• ¢´6°@qYG¡TôQ„¢`ºùñƒµœs( z9 mR‚0=€î®µ¨¢ÜY3„CíEx[íUŒ$Ú ±tp§µeyÅe½v²¶é5N'¯4 ÖØÐÍc|•ŒÈ3ÝPðqØ•„/nTô섌žd’žÒfõíh;Ú4¼[Ÿ»\+úd¾K¦ù |fPÚeà£ß¯%ÃL«##°SCUxP@ Ç}µN ªñrʇy¤—99ÒyÇa¡{MÓvÒÓûqRB.h{KR.ƒ`²&«{«*ÂלåQr~ɹ¢+àÞFë¥1Åv8åÃ8çÃÂ’pêIƒÞ™% zª@e §È]ºó5µò’OP :h Ü¢ü$œ~S J©Ñ¹þ»²ø8UF²> H;Ž‹ö‹¦ŸRòøGЉžÂ`_­­àšïRÌ ÕqSûG A4X:Ql}ZõSU®Ý¼¥ËHQÖ Ú(: :Ê‹ Ù2‚t \"zD‹ù,ÐÞ¿"Þ4ÂËŒøÎ]| r=—A¥M˜GR”vÓØ4u=uÊ(mndÅ]Œ‡®šŽâw9iU”¯,cŠQûö6°OSÀ³§'#²VÀnò´ä*ð…6éÌM9‡M¨ô®Š©"Oš¿x`H›ä`F1²`ÝÝÙ°xLZ5öˆ"ÊØâÞqúçQ¼˜œ ÓÌvÙM3a>O§WGh7²oû€ˆ-«û®®ººTåUp©t´ œ%Jò”ë÷¼7÷%œ1á08Ð ÐH;°Y¿úr ÂvÞ–©I ZI^w8ò§{šôVœÉ¨*ÞЃ³Î¤Cxú©Ì‹ÁC9ˆï#…ùU3œvpÕs\UÃX"ä“xZ_¿òI À~‘ÀwÄ,Afa#g4 Bfr!3/ô eæïÖ ­´œÎH –>²î†CxÅZË_¸öçq>@ÿZ'¼ H oƒ¦ï«Öf#¸BÔìç3ºiжLü(qÈpãã2 Æ`lœF‘ߪӰ7T²bp*[@ÃæLT{ÏøÒp4„˜†O-°£ÏjóZ "8ûEºFai=sêѵ„Ѱ"è¿e¥Jmˆ0NSœ;î á!™Y n~ß!UyÂpœs3–¾Ü‡ñ©1hwÑϧ— S¸ZëDò0d8!–­þ€ožBO'– ‘RK|Ÿ[Æ%ë 9÷»ÝåËL úXù"¹yG]ççq6*Úa勃øPŸ‰\E ^OÚOZr±ÖˆJ ‡ëŽxa,fX¦hó@lÕèÜÁ¦àW–Ÿ´ÖÝaš°º¬ÎÄ;â“"É3ŽvÄ%Ê¡Å?ÑÛŒ"Œ«û¾î9N{&ÄH OØÅwð´s^~½‹Î SÞqæ% C¨ÇÄlw®&Ö ¼cB¡¢½ÂÊµ×¬ÅØÞ³ÚphëµSê³ð"J¿Ý (/61û^ C™-Ï‹C×ãnŠ+" Òä¼5ƒxWÐ!è £#‘ÙArõã0 9÷õݪ\è ¤Ù„Á»~PzÉÜθ¼‹3À0†Ü(Šrüš–È…aYíÒ(€8ñ–Ç$\ƒxRÙ G³¥bå3%üß[Ûž_Ws!á¡èoÆR±Ã{eÔ‡š.B\ »£ïÖ:ˆÊWAŠzÓ§s·›•vËivk;UÉ•î€^ÐøSLÓê èÕZ‡k’§0Ã!óNùHåm:’,…é\&æœN 8˜ežP0Lžª#(wfí!Ç ‡”T’Â|F‡fIœ@ðFY7i:„™m`ûK™8`»@|ycÕŸ7ª)ŽDûG97d åçÙ•|'œ¥ÀlÌØä1>"vé¬îâMMµbg2JlÚf‰ƒ .Eí,•—1jÙÂÄäím€ºlÄ›ö=:­rÞõÖYž6úwxcÉF6RÑÎÃ’Uµ˜ÀÉBê¼e%õÆÕ2:Îæ;*Gp†'Âbõ¸{IuBh{ë’º±“ßå[róaþ-Æ_¯²gƒÒί@_èL`–MöSVPwדdâÂ:g"dNŠCbŠÁGkcÀàÑ,˜I±„”·õ­.SœÅ ‘$>ÿqØFâ~Îö =™P p˜ Âþ J©noyÆÜîE2 =úàjGoʪu*P¯¶]$vÃÆDJTr×·'*a¸ãÒ265̓6ñP‘ ¢\ê¦â¿YããrÄ6ÞÖ]Y½N}¾½Ç ú„ÊØ7Å}ßTbÍ2”„F3Þ§fÄç³á€±Ö-f·IÙàÿù±«~Q‰OÃçò¸¸¿%o¨íÕ-º´ î“3a6?NÀ±@;‚øìÔt©õ« B‘4IÚ-k/‡µƒŸóõ¼ðos\³FlD¼L#ÔjÕ0äGk‰süqP©–w0lЦ1B)mK€Ø>n›‘Œ™§rP¹FµŒ2ù$1u.&=7_" ŽŸØÒlû ²”ø‰rQ[¢Y·ûK^¼¼DH\Ò¢ ±6¯5Ä-¾Lá,f‰ª”`£vY ?x0„1¬d³³0:ˆgk”Â(¢ºdRÎÕëâòYÏd]ðèd\•Ö³"`qÙ ´d5u«û(q’yIƒU#iýŠ$æZLß4KÙGw‡8D²ŸÙø††%I¡‘@xM7ÈH°h“$ÿÒÀT+öl2‰R‰Š‚ÈÚU’p×.ôøÁW݆TÉHÍ—¿X®"±aaÕX¾­û'!a+&Ó æ”ßIL…âQ‘]Y¥9"ØýÞ™@›Ÿ RÓô„B“{Va:_rY›úTÆ•Üý©÷™\U:«„ÒÆ‹Î„€Lû%¬éá‚€Fòœ¨æ¦—yL}†u‘Œ@RcØÄâÐÞÓ·Jb·²7ÔŽ]Hëo¡o»¨ÉÀ·L´3æºë¹ ½”¤/%~Ȇ›"R'"ÀÖ}G¯gl5ºÆC \™;PÄEÂåÍ{šêÞ@ŸÊ‡lÀdaëC9ÅñTL*ƒ¿ÂÍ#Öå?ãÄMLHÆi¶qàƒ8T³\£IönìŽN¿-nWˆaHûÀφ±¬ðX§J´XnQ+C0°”Z­P/ø=þ ±`=x’T…Ëî\[UµxR$WµÛÒ'©ÈåâOpÁ¥‹P…›Ks¿X3µ4µ6„”ìÕŒGÍ“qÌŽÜßÔû›:ÜZÊVÈô9Y×},Ø«åãí²\tµ¹¥h—°8JhÏåLïí/84¿®³­åf7õþ‡ö3îõ¥üÙÐÊnÕÌ4—Õòu·¤Âz^%Fên3ÆÂ¼4¼-KWrU­tS—1ÔÀC€“à¡‚C«uüXM–*#ë¯LÄ‹¡¶ðIr}¯¡p³aö÷‚Æ XN9É‘¹Ô’°ð5»O+ªK“÷^³ËO.!«ZæáÕºaâ^ͼ\[C"È®Šm¢æ¹—;áPü’õ†3‚*4<È1ùà ^qSa›ŸUXÅãêXLŠÐù •–ä'>ÈTÊzçÌ„‰y|âk×›87äË.v–<ä“h/,463yAƒ× òbÂêY «;kýO–°—ûÝÌÞ–fOä…BÚõã×ÜLrÈÙpO6h¬.&ÿîÇÓ™Œãy¹Þˆ âç`>ËìH‚îŸø «‘Á&gº)nô¬<\˜%ÜxSù ôH™_=$ÎWS6¾µ*ø¼ZûNÈ“©<[‚òrD/·û)Š™k|ĉ ù «¹0ÙuŒ¿è÷9ÜvÏ-‰ϛƯe¯ñ˜õ¢›Æ‹v†¼_r£ßpód ÓÀ ù s‘+WƒòO.h?À uT¦†¯Y[lðÅñÞßá¿ÿË=­endstream endobj 192 0 obj 4479 endobj 196 0 obj <> stream xœ¥VKoÛ0 ¾ûW=ÉC­H–Òq‚ Ã†m©²27M‚åÕ$]ûó'ÊÖ«Ö’`EÆ¡(Šü>’òcL0 |ºßf ÆU5¯ŒõÎ ö kÃ^ôö€+«ô§o^å«é;<ŽÃ°ÉM°cö.PzýÙ¯ºv8Zå"„³ã~¡fåš:µú'8}áÚx%úê¶9Þü&’YÅq–ËRq;õp&[” ØâlEo¯å¶œ-K/Í“-éM–v8æg'öw[SÏ«ƒ‡¾®~èmüˆ:× 3z×A¿k õé`#â9@0?ë ßngõkûr?õòt ¾Ï<ð§“[‘2±î˜Ùõœ‡Æ‹F?ö_Dºúï²õ¿ dwº£qèŠõ‘èφàÀ: Ô%¯^Z‹½äcÊÝ×Ü g\^%±¼c2Ìó¶)YR ")À~XGßäç/Çùe endstream endobj 197 0 obj 767 endobj 201 0 obj <> stream xœÝ\iÇ‘ýÎå؀٥U—ò>°ò¯DÛ2¼¶VÛ\ÐvxhH›3C‘"%þñ‘gdVVu÷ˆv‚¤šìª¬<âxñ"²¾9c3?cøOúÿ“«;Ÿ|eÏ.ßÜag¿/ï|s‡‡ÎÒÿž\ýû9ÜÄÕç³×Zœ}'>ÍÏœ™Õ™Ñ|êìüêÎÞØ,½·Êíæ‰ÏR:ΡqϹ³Û}6íÙ¬¥eŽïnâ­BÚÝÕ$ÕÌ¥S»Ç“˜Õb÷"øº“0¥ð.´ Ë“ûxR®¾`Çœ¼íë:öe˜)}Y[Rœ{ /ˆÝ ©òÈ-7µßǸ곒,oÄ]ø‡†U×°¸éæ—øV7 è ÑÊÅ‚ ¬¼àºþLFZ~N '­'ƒ"7’õ‹C-1yö®~ }¼Í'¯–æa¿žP$„c ;”éü)¨ÏÝú¢2ß:Égý"*Y¢ Á2 —ü-¾ÚÎÌ{[c¬Qð ´yüþ£UL[¡…)’glè$IŸå._ ËÓ0½Viáð*Ž“ñ°…î4º4¸‹œ¨ÂóôàÔPw{•kÞôÝ$ü,˜–aõ‡Õ×´Wòþ›°}ž{xhÆ L‘ï‰8âî‘}µºYL­³ù.$ ïÎû @IÄ-,•–DÑoÂ[A¬$“øxÐÁu«´ŽÍvö.h‹d00‘•e¨Y?-ûù´ÊV•ÏAÏ#µñ²Š*1K¥ ¼‚…!1D Üç:‹öXe¿ sß¡0® ˆ*ÚhÁƒ@ƒŠ>É—^æüŠ iþA! qÖÜÆÀ çUn¤ÿ{â5Æ’‚¶~ 68-¨€ í%˜ÇÞñà0œUt³W,xÚØè4…§N“#T0Y¾ÆÉ3ÆQ£`ØÞƒz…Žojã“ÒxS_•ÆòÕÈQk63 (½té‡Qòp//'Ý ãNÖθº›öÅ‹™Öª¤Õ¹,²«µÛß:´K§‚ÖÚúàp£æ;Á©Yo,v0X¯™ñ¸Á0öÏjO¿žÐšXp'ÑÊzp‡IzCëŸjä†?Fã†,ê;è}©FÁW”†;5÷:“úgš‡µ´±±Þeù’68k†v3{Nnˆ™¿©Þ²Ù³Vu4ÈŒ}KÁ0bh-‰^¾­®˜Ìdìï .ª»=´÷rLÂAUí€d½}ÝûnŽ&‹ÝœšFÊ.={o2BFmGE9ëð›¢Ã¨âaFA¯qoP._—V¼ô-ߎ#Dß/Û~•¨(>òvdUæÚ¸mF¶€£Gп‡¹­ZpÓY‘@bezÛâÿìÁuˆâŸne÷÷‹ÞC÷zBž®2ê‰ð¨Å¦E z÷IÂ=NºƒïB`q‘ð#‡à¼>–ü55´¬ä»(‚ïñÊ«âñó€…LhþŒ¶qMOÂêØFa#Âw3D›ßÑ*‹p ë¢"øb²ÖÑSds[ŒE$ظ^ÎÕ§a6ñÙ®ÅïÞ7‡,Y†œ­Ç;Ó{·Âö.ÄAA\`:ŒpG&=í–帵¹¸‡×­Íˆ·_¤ŽF6Cîâž•›ßÕÖÆkjz–ãyTÒAæÆ›Òâ X;X©ó‘º*Ïjã¿•Æ£ÆÿÚÇÏkãë’qRW0pú|"ú^neõV6j|TïE¨1­-0¼¨µÈx©¤ëLr¾|1ºwd”AVAÕa£œ£2ÍÇþMóÒ;gˆ¨Õ7À$:ACÜ?jÝH%P’Àdé–¨YÀ pHºuwŸ€Ûy þFF¾*êÇ îCŸ&ŽË­|htgËœð/!VkŽ"ç`×!PhÍp/Y?òîvÎ<ºŒCˆÕWª´0QÀôÌ\±ËÕFâ9°\·ÄƶáŒÉ ·-›îá½ñ_|¸5ò™…!¹ZýhIU`ƒãì,5”7$Þ0nZ&Q»——ù>¾l2¸…¿L‚þùø“hŸj?÷RÍM'šWäÛGÖqLQŒâ‘å67ˆ#É8þÀœ$/sWÚï X=²Š[aìv'¬Ç¯Š41qÒ‡Õ‘¥º n>ˆ(DZrp!cìü,…Úýöêsä§!Xñ»?O$B—ÄǶé°|7 È¿4«ÔãÂëåiµ¼ÞÅÔ±Ú%ð8%°BUW¡bÊEŒ³lݦˆ¸Ò•ö¢E= ,FPÞ°[RqD°Ä0¦¸˜A°:â È[8<ÀË9¤1Çø Òþ—¡®/kã “\؆é¬-üò°6>3\UæxûÛn„ÉžŽÐ[>?®³xæoƵ2Ùý2΢B3“ü¡!Üê£ ­î…ûQª:ˆ™//ê½—ÍäË%8Ã{—à .WÀ™ŸÍisÎKUÛAæj.ªð£’·üŒJåó0ê,DÇÉŒPÔEâ QZ• #~ܨxÍÊl±ç×ë?£Ƥ&WaóeÌ*‚FØ)‘Äùc…%ÂHâ`¸$ܯ£¾èýÀ±³ÐÒªInéÔòV[€D¦@¬û¶d‘ [ø.ÖÖ½GÝØK‰âZ°‘à-‡FYŠ>þ® ñ‹e ü£l ÌE¼ôÎ åqª¿Ä‡T€#ƒҺ!<1ÐÞ Ë(àÄIrZ°hP\4ä sá=wÂáO"÷½’‘]A~7 ߬E,Âa®u…>'ŒFÃÅP­u¼™Gƒ^OÉl…m¼åìs÷TxB9«»DÀñe„ÒR!§SXda™Âº© ÐJµXJ ;2fÌX ’îFsàÐtpeIȋ鰲ÂoÅk³tŒ.>ñ?aª-Ì«ŽŽ^G—ÔǼ£¤Ñú$–˜J$hª yßÉÛdå·3MÃãŸ%(ÛqcnC—£eãp›: í¼†8“imkoÑp [Œ¥ð¢õ™`¡Ûëú3AÞë~QZ‘P/W„ï$˜ö²4¶|ãh$äñÍ‘ü,é ]FC¶u®_O=úî0ùÏÈk§&v!`?D;˜úÀœ+zƒùcH×T·^ ÕøƒÙƒ€x‘y'ĕڥ\QádùPô±ŠM¶™Ü\Ù6Ä4‹@f•6;ª²'{7¨Æh‹l•’mÖe)Iüx9ÒøïIg†%:’¬áG Ø52ëë.0Z˜VE.Êj6iX»6B_9Àa†º"âvž-ß=¨ vGÈüìÅr‡JƒHÅÃ@gHéÀû"NDen!ØïBMnLÈÂÚ¼›Àt‚¹¶èmƒ‰"~lU1etÛX<oŒæž×å_ÅõŒÍ¶S—œ6>šo[ I™Þ|d*8€D~ƒ/Ü+G™¹¶x%-ÃÁlK‚1y#ÝF€b„Í|qÈ™ñ6¸hkÛâvYnÉv¡Ä—¥ÓÊš»Ux¯??M±„¢ˆ«îñj(Þ,“fM5P-J1tœ[M¼oÌ•YžuS½Îw™z¢.ù&5vFëSªWsþ ä#ý'|o•“Œ4sãÎ|`ï jBÍ ©ÞŸ{ˆtUËSÿ¤åöþ¡vy sÅcP–ªË±D»Vˆ„žGáÎbÔI‘c‰µ×`B}ç6.¦FIò%OfŒøŠ¦Êh„ÃPµE#°AwE•Ê¢:ôZ‡[0µ#ùºGP苯ž7mHAŽ‹§ÉÙUD¦=Ò²ÃΉl]´A¬‰•ôî®–ô*JDM䮳¶Ç8áªÆ¡* +xJyEcî¡ÞbŠáVº×˜Õbvb‚"8;I‹7©ã!á÷{bxé ‚8Ë5Ÿ‘É»ÖO, .`Šû®o=Õ» %¸8.|ƒQ‹åeu>ŒáÈ<ÞöP±yѰ8gϘ-ZàA´ÿjøEäÄ{bÄŽýN@™_C¬å[Ÿnæø›ãžÝ“DeŠt¦­=^šæÞbÀñ™ì  Ý!¸Dúa¹Nù¤ò÷Ì).Cæú¢^Š…ÐÅHSîF”ôðtq'·Õ0?‹¯ÉÔ_#Šæ?¸‡@Êåä;ò”V¹ .Š£â·ïqUñ¬âî¿Ê¥ix?ÉüßÛ;Ûà.ß„ØG¯wp‹#£LË›)$lÙ’ËÂ_(¨Si‚Ä0h |yEG :ôiȦª1“ÝwIn‘Ø_VýƒÆCæFk ÃÚ,ÁÚšíŠ}}à„Í!b6Ù¹¡b÷ì) ?³ÂÄÅÁ(9ƒHlTäöj¶ æ4OŠ8·N‘©ø} º¹Œ~¡£¬ÄƒÌë]Œã>ÐʼnS~tñ&jwp;³.–™õ%ïqN)â;îLT’µÓΪ¤‡Þ÷Y•ÿ±÷êaX€¾(Y_•Æ_Õ;?/¿÷›!LNN솥Z$Ý—FrFöAiü¬\ݯ?ÿ¡öOê°>*­ÕFQÿu8’zd?…šI@Ñ?§¿æg>K ªHÀr E НŽ(Wѵ#ê«ÈbÐûzØ,éà˜ÈÓrë§õwN™|­×ÝÊ¡àñgÿS©áyÂ?Ö`™ÿ¨OìÄ8 ÜÙ2 E/Ô¸xž»Û ϗǼÚO-¤¢ø‹mŽ“6Xph쌟Ü;õ¨n$@ú#gädäÂeª<×W¸rÎ3Ëè±ÊÏc\ŒŸc:©’ßIJšx±rqü£æH‘¡p®Mö¬èÃM-\y>32þæSÜucÚ°ÕZ1+áUó°òl9¹’Ö{•QhÎ¥ˆÙu‘˃Iì>Îkƒ¶Ü%’J¦ò¦¥£ŸtHRŸ»‰Å É‹¡7à1`ØJþ§°~™¿¥[×~³+%ÙȈmG ¹Ö‚ û©¯ é5¯LýÖÙÓP¦ÖU$°Í/"fË_ƒô“ÔéãLAyš3ßÐ8T6„j!)¨@4D~+.â㚥§±¢H¤O»4'«èW£ ké‚b¨±]¤9´™ÉDÇb“Uì¤ã©˜á‡ÒH`«ŽO€Àö!ô]«U\Hw*_>&³†©MáŸv~SO´Øþúk:Uåå£ ÌT!s®Hª2HЦ‘¬WúThyT…;¶<˜…j³è§;ÜÔVâzD6RŸr(αr/Éñ¾—ÉŠñ†P½½qylÖJLDÀ˜8¤¸ G°H„aHD!Š%qnÁ>w4ÉbÆ…¸é?}ñ“}Þﶉ}ÁÇÁB¸ðùÜd9…Âøóýó;ÿ ÿüW£žÜendstream endobj 202 0 obj 5132 endobj 206 0 obj <> stream xœ¥VKo7 ¾/ú#æÖ™"#KÔ;@m‘¾P ˆ»‡ŽÛ»6?oçß—”F¢f;뢈ՒE‘?ÎûN ÕIúŸ¾/nW'§¾Û=®d÷~v«÷+• ºéëâ¶û~FQ"¢Œª[oWy·ê‚¦sV 0ÝúvuÖo‡Q÷7ôØ#ˆCpý#þR*Õ_æžôø<ŒVÆþkZo§MY•Í_ÒÏ“ú¸¦Ç=6ôx,«lü¼¨BQW»¥x¶Göá]nÚí^Ä>6‡7{vIme¾hVdõIpÀ…7ª1|dCv¾¯†b)ò›zྪÏX}ÕDQü°ìn8_ÿº‚„uXÒõ%qß„Svœ/¹~[O¾™åÌ8+ÈôMÏâ?yù"/ý_,}3ðú[^*6v,=ç%¢ÇDŒ#Æ6ŠÛ¶ ÕCS¦Yër_m)-'§*´°!(áL7‚FÇÓµ¦Ôø dB(jŒ“ä„÷>Á¬ÖRÚ j@ÿ4ŒR€ó ms¸ÎygþÅÇ»âãŠ|D,å<©M´|Äo¡ÓŒÆÓÞE ¼¨í!O†ŠmSEœÂºÂ]Òq<¦YÌ@ÔØ!=hƒxµÛß¼¯¹Eã­$ÀØ´‘o)%B¯õa„tW¼Áõ÷ÉÄ”/í£Kü€Ái Éß'%VV×tñE6é") è¼?4%ô¿SM©>®ÿƒ½~—šE" 4Ëš¶{¬ÿU6ô*LɉִùÞ¤`ÑÙ!#þ»æùÏô¯†Q¡ÆzÀ³¡„^¥Ÿ9\e|ÿC† (CŽÓtìF…Hpr¤ ñt_ à£djtjP¦Ý;àT1†ˆ2´KUdá}ÞÍè ‹!¡µ‰Ð~3ØgKëÍQ”–Ã¨Ä ÄØü…3=ÞÞa‚_¢%…±Z|ˆÉ*÷û|Ìa›[KmþÛjýÍ— ·uh}š¦¹KMÜ:ý´ôPÕfì9 m])VC6y¶d)—„/ëpSË{ ãÏÂhȺŽî29\•ÉOB¢od©Lºx6ìÍc°™àWÃÂàÝV!;ÚK<®œˆ*ÆÿÍã$bRë ª¦_îù¦ûHMÆí´h:ŠéŒâ1€=¤ò¨V&ñ¨Å~€Ûõ‰´Q"tAû°0dž æöy7$¶ˆm”›A'œ@Â;Ñã3ƒ‹d”½ÆÃç)>0)6‡Ÿo©5hXtU¿-Yy¹‰B5/7%WùR5„ Ók¤6VhP“bñE™(Ê4L~Ÿê›0‹_?¢ãp¾ÿ…¨5D­UAR5ѹF†F@9¤LéˆY½Ûôzq9q¹>×R5\ Ž6ŒJºœÃEcùµ?Ô<•Ô5±„œÛ,“¦¡î·œ„ç©;'Þú2Ñœœï>÷!Bw†#Dµ C3.½í¢Ô±jy‘ùN¢C àŸ>BÂÐÞ<½k ãà §äzÏÀ* XFû(îF Fx—·h4÷ƒ%ý«õê5þÿíùendstream endobj 207 0 obj 1157 endobj 211 0 obj <> stream xœÍ\YsÜ6~Wí˜GÎÖCÉGÙ²­K±FÞd“-—¬ÑUÖŒäÉŽòëÓ tƒlÎey¸"“@ãú¾¾Pþ4ÈR1ÈìŸæï³éÎo‹Áåb'¼‚ÿ/w>í'0hþ:›žAH¨P©T&Œ/vêÖbPšT Œi®ãéÎo‰Ž„È‹TÈäùPÀ_…QÉËáH¦¥0¹Lö‡YZh™IŒ]©1J&ÇÃQ}çªjrQªäL‘VZ%/†¶>+ªd>e©6¹’Æ? ]šä$²"/\)ŒšV¦òý ˜Ã=Ôk¥„NN‡2EY‰¦,W:y@Á…m®¡¹iVP¬n¡P¤²2É%Ï¡£Ì€Üæ¬òB(ý¿ñ¿-V% —VY%,V9À¦«r0>Øÿó·zÙE)2™\ G:UJUú‚µV©Ö"¹°#ØÒ†ÕÉ L²( ‰·CY&_°›k_1«û3™I.í*ª´*5¬`.M.`å:ù€c†íà% ©s, ª ““ž,HÀ=ê:%s„ò<ÍéZ¸ü2KxTP˜Ke ˆ¤ªrúh×î¨,S™çÝiØžíØøö€ã4$j ö,Œ$æeš P¸ ’¯'‹Š»ò£èÄ®£L•¬PPw­€‡G;¨Jó¬ͱšW25²KOÀ6^ÂL%S€’CŸ YѨCQ:ã µü' 9èYjGÍ`€29²Jé"`Vã0»¬q³E¹)DS«QÆXS$õj2A¥n…kHºî0 }+D™Œ`mRfYi×=ò  ö™åõúk&D^sK n†1Y­Mv,Ԩֵ㒡ª,”›.hM[µQo…¢?Z‡Ê[€¡O‡2³þ®°&#a:7±A9k2¾3NÇšúª,m_i–‰RRIŸT-r½ÿžeg5øXÈŽn±TÆ9 ©‹T™~‹µk3šö¹Žn5ö´p† 3“–JxC¸FO¦A©›—+Dá÷¡í¶J­Ds×`c<øÝH•¥6V—º‚¶cÛƒ_°¼ Y’?ó}£ðCÜa „)§û~­N÷ß–< î¢ÑË¢h¦o Uß¾ùÕhÞ #öí¿ÕWVc>µJ¡Yû釶vˆÚÅB †f²eiÂaEô(ù]ÇŠk?êóP:yá•àXu¿ŠÉÚïÿZkgNԽŮ;ñ1”ÀhÆ.Ãyf]‡%«rv@ˆ±Á9t&ä‡]Y*”¶TÐxâœ<(a‚n³véu¼NòЦ£¼€©d 0¹mè%ƒ:¢X´¥óAÖ[Ô„¸8 “9ߣ*ð„žÛwWmUÜÑY7¹¾2 ð->µäU•…å&H<`!°‘› R‡*ù)ÔŸcýi(œaá5Wxé í²ƒ5ÔYÐÈN%þQ·g*V ç„ÅŒ¼73ˆ$I!dM…—çê·)üûuÄZMÑ¢XO°P½*lj™Y°·îM îÑ>*YÆ]¶ê7­S .Hµ2Œ dD¦,µ‡aÞ¯±qŠÊ9³5(g.—8…sl4§’B7[#U¶\¾³à]ûÃÚla|7ïí«ÝÙ4O&M­*2§Ä¾g8”¨­×V±fvÇY1˜¼ÎJ‹'o°Dâ¶§}Sx‡…Ô£@ ´$9gZ^sž…xŽE3fY9 ÏqN8üU\Ñwù"ÿ8Eõ94Å﹜FÔ?Þ‡Þ ½±?~õµ-zjaË ÛR6Þ¦M”D¢î¹õ]s L(lDTò–#âœRê$ˆ¨¹—¼EL§¡žÀ†fðˆ=½ …û(9…Ç ù0»>òi0i³¯èø÷~¥Ñ¬‰¢ž-ãµkDÔÄÞÂÇW÷z ¿ñ¯É„ ™C®BrÏ8 Ñ6nXrg\£{Î ×çùеÇót…î­mÅÛCïÒ“·±ðn øgµÿn㯿1þØéœÃ?VYDÅ{Á§%¥ñ’“òŸñ¾–¸®÷ç·áÇ¡2Š…Ý ìGû—åŽð~u éz* Þ;®á©«ÙKˆãJb²ú"¨ô^>C¨è‰é}°ß"TL9.>GÚÚ€)ÑÆh¿à%Ï9VØäá'²)ÖuWcDíöb¿Ò£½J¬Ó.¿R{ç ˜»LÖ×Þ nxoú”Á÷©}ö¯3è —§‘ýßÜõ ‡'ÉÏÑŸ.Ë*7s7VÅÝ ŠI$“v&Ï<µð+èW—%!ÉûÙt•“ñ#B8áVĆœ‡Û5e «Û î@Më(oë„’ ¬éÜsÍçœd|ža©¼‰Ál®£qZ¼ö: Ã`$Î VîúxÍ‘×ç…3n•ÈÙz­\ÏûB‡ðl6pt¬2 <âqÔÆ¶Éõzœ·1Þ»ƒà™’˜Rî‡Ú7vwm ¾ê°!96žÐQrío¸Fh1K’MÞ€ÙÈ?§¤´ ~é7Éh˜Qo—ÆÞÓÑŒ†àHöG¬AæV‡8\wÁíK€â­V+›WË;«-|‡Òy„“H%IPÝNã(Èax= ÂÞèlÀK¶?oB£¬Ça0•Øê¸èëñYš±³)Wt°´tÌó6ü˜¸¯cø×É Ê_»ÛYpˆ`O×ÏY°{ÖHa䥭ۈÆÛ*O·G¼¢ª|žÞëANÚ‘ž“À¥¸2ùÅÅʆr„Ô5y” m”­:×rB£ ±"ï·ï8þ‘Ê ŽÊ?04ßn‡··Üµ ünUájóÃν@&¦ïbó9v©¾èå(GŽžnCËf%—ˆñ]W‡­ymOwBŠ8ât'‘Oh¥ Ê݈ҹ1²‹ Ë\™Å,9‚B®ÙT´BN8jøÝP‹Q~ÏæHÚÙ˰D†'ËþÜOAXZq&ÔgÙÍÓŸ\ÖÊvŸ2«ÒÀ‹&–yÊ5ºáV4‰Œ0¤¸ÕÃëSÌI݆úǘ¦W1C Ï⥠)dˆÕdTÿ3,¼âÌ uþ§mYÏ3"µ@sY•9?¥õ3f×¥‰\uGÁf¼/”܉*Ù¬øD#ÏtÕë35òµ¥þuOŸ‰÷dùæ” æˆd«”qý¸Öu1§s7É™ôNï8ØËn ³÷YôXÓ‘–pû”EGÉ…Où>p€M¸­ÜœSH‚ÍŠS–{4ª8/kvã¨Ï䜪ïÊ´« [n}ó¯cLìZ—ÆÖf*ìp«‹®Âº»©U7.+. >Ö¦òeùtøË <¥:ãºæì•¹²ßÜ.Ö¹1#Tk|vwÏfg¨Žw‘äÒÓéÕ_aùÂ8è"Eé†ýûŽ"ÀkÑ»îÇv$3b¼Éáùd£»'Þœ[<æ=Ž“ÿ6Ñ'„åêï’q`Ôa¿- |DSboïָʗøN—œ}.Í×É+]·;W÷•¶1©ñi“/‰%1¯•ÝJÜF€ú¹t7q–TÿbŒ~îì,~ ÊÒºloirߦàç+.Ìâ-坸anßùo©¯8%a0›W²÷ºë_£?¢#b¿‰ º=±gu Œ.¹‰<†Â/œ6Î#Õiiq ¯gá¡î uüéD~ žþØóÓÄÛ65dÿõ³÷Ø®Jô/¸zŒš³n§•â3ª-Õi]l¬­Ûãgïo#µð^ƒ·ßÛµ¡–ßjV÷YÝžST¼=±§6è³?l³Íëû͆%/F#Å:áÝlM;yÜÚçˆø¶÷o5eár”ìÎØÓÛ„ªoAèŠkÕøWÆ–#c|“×±Q˜ý]–°äž{˜ŸC£“8Œ¼°¬çeN²Mf7”sn‘ÑÉRµœrÍÙÃÂõ¿‰æ¿:_ÿ+ÉU#}ê˜1ø4±u;Ýùç G¥¤ªÌDÈ¡†,ßýó /Æ;?ß¿¸óÔ•endstream endobj 212 0 obj 3207 endobj 216 0 obj <> stream xœÝ\ësÚ8ÿÎ_Á·ÂÍ@-?ÀžëÝL4I›4inÚ›NJÍ4Hs¹¿þ,[ÒîÚk zÓ©kV²-ýö½’úXµš¢jÉ?êßÁ°òú´]½™T¬ê^ø÷¦òXQ‡ªúg0¬n÷ÃNvRšˆjÿº?-ªÝ-Ë®¶<Ñ´ÝjXùTÛ®7œÚ–¼ìÊË—ðÒ´,!jïåÏŽ¼ü%/;ò²o:Ÿ†—–ë6-Q³åo«Þ°›Aàû­Z;¼µG6Ýš·ÝAû!^ñÆ/HOÏò›ß® Lû7h¿0Ä1GqŠ¿ ϸA;|»‡Æ9 ?i[áØÝÚwnœ/†ø Ä{n—0ø7¹a|ë:¾|ôQ«-_¥;ŒõPÈL.Hý†KCý»ÿ®"œ¦ç~µXéÿ–ÃâcÍɸ¡£~ºmËâëcÇ6†øÄ[`Â¥d‚ÞûKÀ['ùõz"‚à‰ üá ök`zÁ«¯ú1Q".aîJ¸"HûæÓÐÓ µyéêΚàËÆš–ÆêJ=¸ˆ‹À Äúž8|¿çXÑí×ubˆ·œ¦"â<{-/¨}DžGj…Ì šUZÒ<ü¢5"þnWiIËöU^e«Ü\Ÿ8Kr…&ðʧ0×kÀÿ ²î¹ LY––);㺡?)²3ÛFâ#Í81?ÏÃжÍ*VáE¶Mû´÷±¢jâ!žGÖ$ÂvMJHŸÉ°wMùÁº—0ìk{XwMû´Ÿs èY;ÂóÀÚ)€ÕY;¬(¨ÙÎ8² ;ÆŸa'™e(ÜU |bÚw ýØÏ€üèÿ*(ï•@Ù[Ê{ÿg”#W÷Ö˜ßÈXš~R9qÔ‡ n­jpro9'×â¡!î¦M´¿ Ô£¬+4ö  Þ5îQÔ?Àwë:ÞØÏ6Ñ(WÍ ëì!ê”{ü+ÇÔ+¡…Cn…âÇgˆàذù_fô…`ðQɤgÛ~ $µ 8Ž ñ+—6ƹ1ŸÂeá‡i@„›HûÞ·æãYi0ª‡Lä@sÃØ6P zçù>'¯(#dÓ V{†dšÊx>sü¹ƒŒ‚Ói=Â3«Î<×ï,J¯¹ö'<¤ìDj¤k'S R†ê41—£™æ½g ÍQ]ç4‡JшµÙ$qy–½T>Ï*Œ(Š<2D”è,Ósv ’q2<vläì(•<á¾ ¼YI÷|ØÙö1Ç‹€þ{ÂP¥tnÿŠ*ˆú<8iÁ˜§ðù,×·Hé{$J@ µ†Jƒ¾í1q›2‘©d0å¨=NÐXsH+$K‹¬XÉrB0QaI€IrÁD®žˆ2RkÕ™ /5=/‚®DšËHfÀ«“‡Ê-wò=ÒŠ«z܇î.ÖG_-ç,Um (ã‘5LwÙwBœá «oÔÕ –ïcMÃ)âÊV÷IX¥ÚÏ™ 5Éé0ŒÀ‚ì-D˜i"¾ãžhÉ%ú”dlá2È–¡miOP1¡\¸HÄAA÷¡}×ϸ°aÿ ‹H/TÄ´eˆÈ_îpðËçK ÕCˆ=ÿ¤|wb±™$¾·Ð÷žë[È¿íükoÿdÆ8³&—®®*â Â_†w_t`,«Ú—l¡Œ½«Yk¯ÃBhÁà»Wߢ4þ§á»ö l.¾¤h™YG%¶Ç·oÌ’ì&Õ^gÄ;2ñ1‚XlÄÛœ#>æ ^êªØÃ7&¸Ïà›·IZ$Ñž+:§–%så¦oÀž'eH"D‹ƒå¯ ®×°;ð¦Ü;ﶺ@v3¦yîáõ¬Ÿ@°³Ûf³˜+ѥРԎxñ‹SÄÛj±‚‹²Ò!‡à8!vòDX€~/ÈôÔÔ7‡\Oò€˜†´œ€å›rüÁ»•ÈLlf[¸–X„æ ¼‚´xiÔecÑIÀ¹;W±ž ª6å0á8Í[¸?@¦æªåbt¨ªö¼×wÆÉ*t C¢¬ë\óW]=–ìR-»iœ…ý?ž†6;Ì`ç]¿þð¢Ð;…HVtiñH f”¶H^àöëÌB¬:5üÚÉf•]Àªï¦óL ЖcvþBOXõ­ýo®QÕ<ø‰kPå×@c­ö2Nsœcù“3ƒöô ŒôP]„çØœ¢ÌgŸÃ Œô„î‚Rþƒ Õî0é¥Dö@ÎXª‚%uv•‹-(¨9,Ï€ØH…‹|ˆ!…òOã"QN¤Xaüç»Z±Ðóhê“„ÞÄP½É‰]Ó¹lî22w>L/HP*uPg$·ÔΠK®}Êqzvé½záÞÉ„”a^ü¹–ïN¦ð~n#>èv]yã:ŸèDBâ;Mß×Bò¹ž‡¸µarè\y€M¿¤ÈG2è1­x«oVÍN³ˆÝpnšÝ5óÚ îØÜÜe¤4˜JÙAtHõD™dboÞEaÏz#ÔRŒ+Vò4‘Æ$™Ä6”²’O¥¥|^î£H ߈A+92¸¢U¶Æ:\7ûpA"91Zqb|‘T\•B(³GfŒø–&»Ù¬j"T²Q‘—l)Õ l­ Ð8ö€);9ÖYI¸‰]˜r+tñ%púîp Ñsé f±ß šž­ý{BUy ¨_Ãn7…‚´ohgF(ºæ§4Ÿ*%täotØù¢¢=Sewì+gñ&®Ö¢2Yf™<ì Kl¹#«žŒÌÕ$¦â8^Ekteª|¥áT8ŠÙV@®9e¹â&qIÔ‚š©Ì&4 Ž»€™ŠPï™J"ŒÌÔÏ(wÄh·*[Óf ¾ä\JnI|™`¤»-ާuŒŽ¼ ùsº«@J<¦‚`ùuþÄÄ5*JmŸhbÀ¯O…ÿß‘†#›¶-ª GýÏ#Ñ«œºW êž|¢Ó¯|ÿüÓ ?(endstream endobj 217 0 obj 2457 endobj 221 0 obj <> stream xœÕ[kS7ýî_áv§¸û~Ì´ÓB)-–˜¶iÚÉ8€©1Cþ}¥]I÷ÞÝ£µƒ!ÓN&›µVÒjï9÷)å}?…ý@ÿ1ÿž\õ¾9Êûç‹^ÐßUÏ{ï{aÕ¡oþ9¹êoU§¨T-£2(ÃþxÚ«G‡ý2…Yõ³4EI|Õ{38nă}ÙÕ—·ê2 ‚0l韯õe캼n$yŒ‚pëßÁp#•eQdƒLÝe¬ݹ9néù¥k<£ÆÓáFêGÂ]«ÆH¿#ÑãÛƒ&®ñÔô r=ˆÞi‡ì^È5ªéÓ°•E>˜£wž»Æ 5Ò’/©ñž”…º/ôœöù=Ý^Õ·I\ Þ‰¥Ø[ý)A©fHõ÷ÙÖ©ýÀ{ë²ó²ÉÿÇ?õÂx”¦eÑï÷Æ_½©AÞÔ—ý#ýóP_~·jªëËKuÉ’ñ '¤gô|¶²xg† “Âl‚Ð…˜¤ç„É-'œíùÑð ŒÙ ™i”ˆ1îU€åìãçDH¹z{ûŽðš!hÜ:ÁªtsßiéKba˜!ÄŠÿ bghuÔx…çâEvuka›6j•ñÔá—I‚Qîvhñ=p:7–ønÛ¶õeÏ]Þº¶C×Yñ J‹!]"}Lã‚,k»Q™x-l”g2ìßt¯hжkÜ£Æ=ò H·K9cÕð-”ѧmŽÍTL÷”ÍLå6Íô´ïì:„¶ÎîËÎ5ý LãÈÒ:‚/ ˜êÊtu;GÒ&ÁbpÚí1a#óa7Èž@𑆭ˆæJpÓ!\ÝmIÞ®sä‘3¾vl’+‹”-\CÂõQJåøÎcm`ãS….K8'Mº@ï\ƒ`°uÍgb|²2Ekº%@Š’1«ºÆ­gD1"·º ÒD|±ÝÊöóð4²ûOái86õ¸¸¥€¶}  `ê÷;äÔ%ÍÓ ÙË„.~ÆEjíå$(G&üeÒ[fo Ü31'e¹OQÏi7ßdŠÕЯÿúÍ‘þHF¤0z,#™ìYàÿe|Ä F¼CW°–8ÎAEÛc]ˆHc}çÔiË^8T^r@DFÁàáéâú5³"²SÂûavÕÆ Z§…B”“5ÉLëð°:X¿8°þÖ 'Ð 6@-¿E2¸#Ëtƒ}BÒœ¡¢Ç£`=çíž0ØkÖ9j~AÓ!³ cgâ9C›¥[ÖÌܶ0¡Ø¾R* ŒÿtÚæª"õj*P)/£0_uNÂâ‰C¤™«&>4“ÌfÚ¹ÞY ¬€‡œ¬wap¾{¾¬N!ãS–cÙÖ‘¬ˆõƒ œöÞTH¬öP„çÃî2Ä3#äq‹©&-š$“W°¦BnšÝp!d«nÐûRl6û4Í ëÍwÙMÂÅ”±eÝAmpYȪ.íò±‘Ф–×"“ ;@q×¶µÌÎV–ƒ¼¯ÒÜcXc23$åy·”—jY žpÇ{±ä$¨7§q¨î=3‘Â0å~°ÓGƒ¿Ô|/Š) wÇ«¬¹Fî³t±Ý“ä7Uþúiäã¥%^_ü«ì¼ã\‘ÜjbtÛ5”väΈ–ÑàÎëÉæšCi•ôõ\1*PÃɡԘÓZ¹ÅahºÍg`4æ‚Xvgáuµ{gÁ¨HúA ¤ Iʆ[Ó²*‹÷üÍF˜ç£¬atVPy³\’ÅG± *ÛZ°dÀ¶ý¨XöÊÚÂfg=•L© S"á¢ÁuíoàŽ}× Úþa\$~Ës­Úílj¸ÓëãÌ;á.> stream xœíšÛrÛ6†ïõº«Ô1O"/“Øñ$ulÇVNÓédÉvÝʲ"˧·/@Ø]ò§(ÙIÚf2™Ð¸A|{‚_º¾§º¾ùWþ_tž»gW¿»£ÿŸu¾tT.Ð-ÿŒ/ºÏFZ(Èt‹—ù™êŽN;Åݪ›žJü ›ÄÊ ¢îè¢ó{ïYöžšÃ–9|ÒÏ÷•ê½4?÷Ìad¿™Ã¶9|ì"5 <_õ"óÛï/ËÒ4é…úÔÏBsiì::¦ë3×ø 5.ûƒØOõ¨wî®ÏÄõ²ñ„®qŽOÜYÞ{¦GõþFÝ»Æ[j¼t jœè÷Άù8oÐËM]ã55ê'Å*ó²tÈE¯tkà{Fö\Ì{gs…)ë™è—½u)ûÇèUG…^giw´Ûýºï®ù¹o;æÓ~î„w-òBØrüÄGÜ£ŸÜ7å>O­6Ü™bŒéô¸o ‡Iâ mÓ£‰6á©P€Ayq`4ÁX{.Ó¨/î}'R7øP©‚ßü©è ¢ü±˜‰òÔ]iÏ[á[sxæ°n ˜…°1å8MÑä'ÑM‰N )_ÑÏù‰€«­5ŠŒµ¶øíÜG¥Ëއ14Ë!AüŒÞsR¾Ru,¯_" Üõ0 lyfg9Í,Õï¡ÞÏ‘^•¸ý!ëýÒNw³†Ù7£7b¢7«¢h‰8aØÙ&—Ƚh&—þÈähÄÒóÕ_sI67^…À0úÚ<ׄ¸Õ 1û‘!NЈ¯]£ôu48Ûç ç–ÌyèÌä<½5yö£èA>q&§4m˜–âÁÀ“P­ït}¹ºñžçü™Q¦c¼Ÿb—8x ]g£°X4®7Éyò¼o—¯õà†¾fU­o=34° ¤‹d ÒEr=§H¿4šÀsô LrŽt‚ÌxŒFwE£#ã×LÂ(?»Ÿ ê´ÖZYDNjÖ±ç²Æ×\žN¾sôËØÅ× ï›­# Ž4Ñ7 HØðW…ˆ[Òé b¿†o üïgb³µßûN ø®¢ÛOÎÔöÔ0Gy䄜IæÂ{Vy!§Ï”ÑÌ,ËAŒv¨¯ûQ¾¤€/¸@ó³ uœ?²°¦%›?² È‘‰D†Ù3€l½¹¯8<@¡v()89;$ŠÃÜÑ@ Ñ#PHg¹ó)š:¯•”üô¡”‚¡§T–µfå’ÛÆCiáÌê4›bÑR5Ðå°°,V³öö%šÃ tûã=hÕÚʚǛÔCém¶{É5þ£SvJ¿>H[¢Èc<ïG.Ô„0e ±Þ£W]"º£ ûà†JŸó(qŒzºj˜óú@îPäY ÛÛìkÕ–ÖÀì‰çBØfÏ¢hÌ Ȥÿ²P? g¢˜Å±i 奰H{ƒ‰å,׿°mëàšVY`„³„”ØD4ÔOÈ‹ÆÃÀìú”Ec™ÏÔóÄ¢”\Ü2p%sçÚ±ë®î¸6—GÂÏÆì·7ÛTºáóWIK¡êu›jÉX9å}Âå0{UŽ)BNÏ”‘ÊúI¿ôp K4Ð…Pób¤q%¦Ú:¥•ÝFH¬BÐ6¼¯(D~‡ÜZXCöçOîì­Uæ-l›ŠÃ©ÛgjÏámð{¤#>E·Ãå¾(ÁØÛÛ<ÊB=«©Ÿv äfX Q/8óþÓ¬¡ÞB[FrålýD˜(«³~Í%˜«ëŠ.=.„µÛÛŒ<Ûhj+ ¬¡匞ð]™âÂdßÔû­kü³]q¬;X_YaüŒœþfà›^Û~ fgï…pîõ¥½7¸~¶EZrÌ«%²âs1õ\¹Í`aÑæ*—htÐÇ´—“ÊÊæ©s°;6ôV™P˜Ý—œ^:á2½Ø\aÕl–\Áp•VžIeEÊd«ÕÂÁ1ÆSn4e?Û0 —6Uä-¹Æ­˜˜±«¿`:6ʲ8‘°ZÛKÖØ|ï<é‘£ûÎ }H¢e x›Oý¶à¡ËmÚÀ­›ñ ô¾lú—ÑsÔç„8µjUòÿÕîUÚ¯ ˜1£=t›ÛZy!Ë¿^YâÛÀ¶añ»Á·b×5v›‘•ïm¶Êx#ƒ=È_õ]Y½ŠœåÀ0+ëÒñyäé¤tÖÖLÛ#•å ãä·U­ïæšÝ® ÅÓ÷n@²ðÃÉ*TøÕÿÚÕ>þKJyM,ŸAl¡s ØW83Ñ»Lr£’ܧÎ+åúöAÁfŽœ}2Y%ÎR[šJ¦À-å"7$ë5'±6 }²ñþ_úÎJ Ï3ã[q½bÝeÅÊf¬—:ë'•ÛMÿRUžª”Y=Pqꩤ;’@gkE÷Q?ÖIslä·G7úß?ÛàŠéendstream endobj 227 0 obj 1819 endobj 4 0 obj <> /Contents 5 0 R >> endobj 26 0 obj <> /Contents 27 0 R >> endobj 33 0 obj <> /Contents 34 0 R >> endobj 38 0 obj <> /Contents 39 0 R >> endobj 43 0 obj <> /Contents 44 0 R >> endobj 48 0 obj <> /Contents 49 0 R >> endobj 53 0 obj <> /Contents 54 0 R >> endobj 58 0 obj <> /Contents 59 0 R >> endobj 63 0 obj <> /Contents 64 0 R >> endobj 68 0 obj <> /Contents 69 0 R >> endobj 73 0 obj <> /Contents 74 0 R >> endobj 78 0 obj <> /Contents 79 0 R >> endobj 83 0 obj <> /Contents 84 0 R >> endobj 88 0 obj <> /Contents 89 0 R >> endobj 93 0 obj <> /Contents 94 0 R >> endobj 98 0 obj <> /Contents 99 0 R >> endobj 103 0 obj <> /Contents 104 0 R >> endobj 108 0 obj <> /Contents 109 0 R >> endobj 113 0 obj <> /Contents 114 0 R >> endobj 118 0 obj <> /Contents 119 0 R >> endobj 123 0 obj <> /Contents 124 0 R >> endobj 128 0 obj <> /Contents 129 0 R >> endobj 133 0 obj <> /Contents 134 0 R >> endobj 140 0 obj <> /Contents 141 0 R >> endobj 145 0 obj <> /Contents 146 0 R >> endobj 150 0 obj <> /Contents 151 0 R >> endobj 155 0 obj <> /Contents 156 0 R >> endobj 160 0 obj <> /Contents 161 0 R >> endobj 165 0 obj <> /Contents 166 0 R >> endobj 170 0 obj <> /Contents 171 0 R >> endobj 175 0 obj <> /Contents 176 0 R >> endobj 180 0 obj <> /Contents 181 0 R >> endobj 185 0 obj <> /Contents 186 0 R >> endobj 190 0 obj <> /Contents 191 0 R >> endobj 195 0 obj <> /Contents 196 0 R >> endobj 200 0 obj <> /Contents 201 0 R >> endobj 205 0 obj <> /Contents 206 0 R >> endobj 210 0 obj <> /Contents 211 0 R >> endobj 215 0 obj <> /Contents 216 0 R >> endobj 220 0 obj <> /Contents 221 0 R >> endobj 225 0 obj <> /Contents 226 0 R >> endobj 3 0 obj << /Type /Pages /Kids [ 4 0 R 26 0 R 33 0 R 38 0 R 43 0 R 48 0 R 53 0 R 58 0 R 63 0 R 68 0 R 73 0 R 78 0 R 83 0 R 88 0 R 93 0 R 98 0 R 103 0 R 108 0 R 113 0 R 118 0 R 123 0 R 128 0 R 133 0 R 140 0 R 145 0 R 150 0 R 155 0 R 160 0 R 165 0 R 170 0 R 175 0 R 180 0 R 185 0 R 190 0 R 195 0 R 200 0 R 205 0 R 210 0 R 215 0 R 220 0 R 225 0 R ] /Count 41 >> endobj 1 0 obj <> endobj 7 0 obj <>endobj 24 0 obj <> endobj 25 0 obj <> endobj 31 0 obj <> endobj 32 0 obj <> endobj 36 0 obj <> endobj 37 0 obj <> endobj 41 0 obj <> endobj 42 0 obj <> endobj 46 0 obj <> endobj 47 0 obj <> endobj 51 0 obj <> endobj 52 0 obj <> endobj 56 0 obj <> endobj 57 0 obj <> endobj 61 0 obj <> endobj 62 0 obj <> endobj 66 0 obj <> endobj 67 0 obj <> endobj 71 0 obj <> endobj 72 0 obj <> endobj 76 0 obj <> endobj 77 0 obj <> endobj 81 0 obj <> endobj 82 0 obj <> endobj 86 0 obj <> endobj 87 0 obj <> endobj 91 0 obj <> endobj 92 0 obj <> endobj 96 0 obj <> endobj 97 0 obj <> endobj 101 0 obj <> endobj 102 0 obj <> endobj 106 0 obj <> endobj 107 0 obj <> endobj 111 0 obj <> endobj 112 0 obj <> endobj 116 0 obj <> endobj 117 0 obj <> endobj 121 0 obj <> endobj 122 0 obj <> endobj 126 0 obj <> endobj 127 0 obj <> endobj 131 0 obj <> endobj 132 0 obj <> endobj 138 0 obj <> endobj 139 0 obj <> endobj 143 0 obj <> endobj 144 0 obj <> endobj 148 0 obj <> endobj 149 0 obj <> endobj 153 0 obj <> endobj 154 0 obj <> endobj 158 0 obj <> endobj 159 0 obj <> endobj 163 0 obj <> endobj 164 0 obj <> endobj 168 0 obj <> endobj 169 0 obj <> endobj 173 0 obj <> endobj 174 0 obj <> endobj 178 0 obj <> endobj 179 0 obj <> endobj 183 0 obj <> endobj 184 0 obj <> endobj 188 0 obj <> endobj 189 0 obj <> endobj 193 0 obj <> endobj 194 0 obj <> endobj 198 0 obj <> endobj 199 0 obj <> endobj 203 0 obj <> endobj 204 0 obj <> endobj 208 0 obj <> endobj 209 0 obj <> endobj 213 0 obj <> endobj 214 0 obj <> endobj 218 0 obj <> endobj 219 0 obj <> endobj 223 0 obj <> endobj 224 0 obj <> endobj 228 0 obj <> endobj 229 0 obj <> endobj 20 0 obj <> endobj 240 0 obj <> endobj 18 0 obj <> endobj 241 0 obj <> endobj 16 0 obj <> endobj 14 0 obj <> endobj 12 0 obj <> endobj 242 0 obj <> endobj 10 0 obj <> endobj 8 0 obj <> endobj 136 0 obj <> endobj 243 0 obj <> endobj 29 0 obj <> endobj 244 0 obj <> endobj 22 0 obj <> endobj 21 0 obj <> endobj 230 0 obj <>stream xœcd`ab`dddsö Ž4±T~H3þaú!ËÜÝýcåTÖnæn–¹ß_ }·ünÃÿÝR€…‘ÑÍ;*Í9¿ ²(3=£DAÃYSÁÐÒÒ\Á17µ(391OÁ7±$#57±ÈÉQÎOÎL-©ÔSpÌÉQé(VJ-N-*KMÛ윟[PZ’Z¤à›Ÿ’Z”—X dggõg0000230v10122-ãûÏT÷˜aí‚Ró¤~WÖ2§ar7ÇŒyÓ.¨›Ð8A>bAÄüðùß5KÌž8}R÷|Ž…ÓëZ:»šëå~«Îü®Ú;ƒuN͌ʪ꺪ŽÞ†îv¹™¿~«<­ŸÜÙÓÒ-YWQ_Z6½mV«üw-ÿßšþÕ­õ-Ýå’¥óêgLêí™<]î»ÊÓ®ÚöŒ®zÉF-ÖªÙusæÎš1§§éi×¹®ií»fpð/þi¿„í·è4öý\/¸÷Oááa`ðv( endstream endobj 19 0 obj <> endobj 231 0 obj <>stream xœ­zTT×öþGæ^»2¹Ôܱw½$EÝXEª€té0”aÊžz/3Cq@@ *v_Œ1Æn4¶—˜¢‰9—^ò?ÐøÖËË{ëýþkÖæ¶svû¾oêÚ…‰D’…«ÖMž$ü5’(âuáß»cý¯ŠÖD+è)†ž]kM(´æçôCê>hb_J,-^±ea@`dðvoŸÐÁ£Ž¤Þ¥S“¨%Ôdj)µŒšJ-§¦Q+¨éÔJjµŠšI}D͢©þ” Õ…²¥P]©”5ˆ¢)Žb¨íT7j0ÕBõ æP=)ªµ“ú€êMP}¨¾”Õ²¦¤Ô[K½-ê.êAm!a"7ƒÈFt·‹[—3âUâ]—u5[õ±J•t‘JÐÌd&ª[ÿnáÝÎwŸ×ÝØcsç=K{yôú®÷¢Þ7û¼×çj߉}›ûÙõ3÷ûÕÚÃúŠôà[óÞúÝò¶õÛo×_g#±YdsÐ6nÀìͬø|Pô;=ß¹Ëõç®É¦ ¦¯œ3¤ÿ°!/‡®6zØáa·‡~u;¢aÄç#¾I2rËȲQ²Q>£¾2úò˜¸±óǽÿ»h•Õ»5,h³…_fU·Ú‰ù¡­+Ù”+¹|¾`¼{¿Íµuñ+“\×ɽeme´ôgoµü.Ä$A¶þýÁìkXœ+[…o²¸ŸÄIQ#Cåh ý}ÓÄ¥‹6Î.ëÍ«äf~’ITyí¾+æ}ѽ5ê%î…ûÅ"ܳ?CÝP¯¿CRa'Ö¶€¡àDÙŠCÍÆF8ûÃÊ]Ë]a-ñ£78„m sÙºs30¯ƒ…îÝó¿ð÷ØúϦVñžŸÚ]Hœ¾V¤%~ÚW.WÄ)2<ñ2t89tfk4§ä,´7‰‘¸³ÖĨ˜þ2å…AÈ cƒ7Ò¶KêôWȾàJ{„BéTÙ 2ä@w_™E…YZ'XD§^ð»Å­Zç²E!W*!>‰ÛlçU·éè8°Å«ñt<»bw4OF¡™ß!b²!#NŠ, <‹€ùoÚƒZÐ1´qÏÇHôpiébA•L!貎ªÁ,h¼‰·m 6[¿¼Œ ïö—ÞF Ñ#¶ªåHU 0W?žŠ­p¯gÚ¹{öÊb ³¾kZt“×À ?}‡X$û=î:×mkX¸Lúì‡ õp%C±UÖæóª¨öhéÊ¡ZÔµ”ßÁv÷Aìá#¶óZ1 u›‘C–É` ε­—Èq˜•Y’¬vßF³È¢“%m¶m8YH²J#Ç»IŠÁ*X’„eð*`ð,ð×Tg„¹û¼ôqmë<Ö¯Œ~•–¯’²‹ÍAÖ ux šŒçÉð[ÿ̶ç%¿·#Ûœ‡Ëa-‹ö¯Éšs‹#V{o \·v$ÓçÜ+oŽ5‡¬÷ÜE…„nó}?fñ’¿r:Œöœd%}V·íÂû13t,~÷{61ŸíÛ_e’é‘‹‡ÐàëèÌ‚"õøìî·š¦m¢Y%` :gA5{DhÐC´Å,nŒrØ`I0žºÏ'>±í¬4Ã#úYŽï ™K¦ËýÆr“Q²¤£¦Y šë ±Œ1KP˜UÛ¹×…l|í±/ˆwEJËkØ}yéåýþÒƒhþ M$UüðË htœJAL€1ÆTlέ®ö«r]à½Ô5–“^G]h,{ œàtƒ¶YW Ð ¤JvÑvêœ:Á@í9ÁÀf :Ôaàz3fó7[ç°m‡þu‹’Zý Rkûàq{µí ÇC^­ iîÓßf¿2}fÂŽqÜt”ÞizO  fûBÌÓ‰}š Jnâg”X×”†FÑäGéCä6°&åhXÈlòqŸ;ÓûôWœ*O“šL$Gʰ É9iZmI §Ó®¸ä€ÛA‘d.}èoŸ÷ߟ+ÛQí‘é–ÉH¯Ûç,Í;3 ¶|ß}Ô%m²ŸŽÓ&fhaò ­Dö#-€@Šâã8•2!Q©ò¬Ü1$”½=—ÚûT„ɪƒ*ŸÇ’÷=H@$Ñ€‚-ü‹5A’}«ûKcøGؼ°F÷`² ³@†Ð ©iŸÜòÒ¬Wû>šÞ„ªéGz¹—l-mÆ]±41`9ÞRÛ"›kÎýòx2eàÞÄ”@¿‰Q¾Õ'FŒúÏÀS°vCÓðT´îê­ò³{HEÉ_Sr3e@4Ë úé2`#;~8‹†Yð0´2X¢™í?xŒ’ û WѸÏÓøº+•W.r§ƒ×ÓD}z-…ÇE\‡ä8oA{,íip졘o埳uºœë\™E⣲#0ï óÁ‡˜ÔYë8Cqô_^óÔù‚Ðâ^¸µ$uBè„Dè.øëk:PUn k"eA´H‡‰àÞd'ÓhxŽ•…þ0)㈌T ¢ñ¨?²1=ÍqÉ‚™ÊæcúªóÌ PM‘á±ô\˜„ÆŸ:Py¾Š#^Ü>è¤ z(Fa‚åúœ›\¹`Õb“Ìi·ªœ¾©ï´J%ŸÃ ;¾IöÛ7ÛwDÏQuì˜ —ÜȰˆJøX1? Ýg³J‹ö_´G¨z§&BÀY%Ð`½&'" Q­TÊGàLÜU+òH¶êlË ˜$”¿Æ^ à®õ'DH_€TEžŽ‘Mz¬.%ò 5+5[ÀKÑ×T˜é êÊﲈö¡®hÌ}1:‰F³ïn¶ß Xg¼¹c¹»Ëë aÛc·Ú]YýðùÕÏ®åÈ´™d½= ¿†Þ—È’[Õž'½SÁ“˜]Gq>²Jí0«X¦¿£‡lñQK^­`V1+ v‚‹.B0«NcŠ$ß N‰›„³lF£je®F ÷Š0%vj6©CÀvvXU…êì¸4EŽFÄtœb3RrÉ®R_]ßá%lÐz ×…\U®/²Æ¿Ø¤Åê“/èÒÓòDu6Ïq}ª\8d›úvÏÝcв _cÅ£Ã&ë¦ëŽOÐÌËWÍý¥ÑrtÿK6ս­ãÇù·e§‚íéµÁ ùåÁ49ÑDÈ5x×{4l.tföb§eþ†¨òÊbCynJ³VVQ{$‡ˆ›#§=¦È¼héQù&Õ‡ª•þó·o„­Ì{Ï‚/\:ÔØ\Â%£Yì(züÂí.[¶Õ=ÙtÍN'™'îvîÌã‡ó3Y´Ùefo¹-hÛ •/ ¼7¬ƒíÚ6=!:!!)_ÂÇlЕÿcý-¤C4ý2lLOÌŠƒx[¢+4 µ°·]ÄÒ°+Õÿ@'% üdåaQ<»{ïÞ#eå–º}ÍB©ý5A$®tqBÕ™q¤o‰NˆKQ¬šk3÷ÇDAä¥ÛBAA–¡ýzÍ2u4ì'm ×Ï@«i^ý=fmœVƒÚiãÚ5ê]@N”ë,Úr¨‚&u™@óaúä<(SUÍÇŸWydÊ6gÊó¢I¾%&Æ 2|·ö”ÎDdAƒfw‡‘ºÐ*æ˜È üpòj"$‹JˆB;‚æó½XôY§Îj¶§fZ«Í̯hf¤1¡M›¿øJ›ùKæº:EFËô¸EÛh(mNaé“™epê‚Ê<Ë·é×Á6ðR¯Þé²ËÏs‡¸€wYH=‘{z(&:ÙŠ@®»ç: ÷+vÛ¥…|D,Qâ‹H¶u( ~7½ò¿áj,oÕ$òH¢”þ4Æ|±¤S4¹™Šïña}î‰ù©¤JË/´h á5øD‚“.LˆŽESE:±:%~$ÖØ`12)³Õ©¤ìÊë¡„ëOÔàs˜šïƒÆ¶‰lRâbw(âÂÖ,^)¤ãŠ(¶¤fš )( ‹ówiò>zaßéÓeÄ ˆªæI½YDdÜÆ'b„I#·M¥ð‡8&¨8¼²ÜP´ûÓy à~ïb ÷Åo}?𤿀jÔ3;;TjnçÄåñ^Àl˜ºMG3ï4Ϻ ñ®%È$β¼*¤Á•|Ùm1R´ŽaM*²1Ï}-eTt 8 oïGήŽt¨ÆáÐ\!ãë´4Rü£KZ\ÉRÛÐg¦æ Mk/mÛÉ«Bª×ÚÞqü êÿ($¾ìU!â¹’ Mr$h;gÓa9˜ù·H×ÅwóølVŽlL^Drø*‘âÓ‰O^Rº=#‘àê¶^‰rPCŠml‰ºK”øj¢Äq÷][1C,ê.yƒmÛ3™¸µä’ Lúžd—ÑhÔkbäz3«±-=R·ÓµÜa î>t f±ô»ÑHrñàžj³ »b7šä‡Zåïèæ*$myÈÞ }ªÓDöÕëÎU4ZöÖœ ÐÐcqɉ"»Œ|£éTÉÏ®£˜Ö)lb®FA¶ú_•¤ šM©J«¦­ä/ƒPD§¥h5© ~|Û3›¬x­&˜|È(‘ñGè h~A’ÒG³E½vÀÅ/À)PÖ6~fþF´ ½ËM¼D<Ž¢Y“Œß;<#uż;œüðóX"õ{Dâ’ì$]J¢Z‘¤–ù Ÿ °Üw‡Öû†KPÇhl:sϼ˜Ùx ‡¬²ÃÊ[g™…¶rë q«'zÂ"W<ŽtËñ<OÃÛˆN›ˆ'¡Åh9‡¦"…¿fÇá_£|”‹F~z÷¶gábüÎÌw!7¹cÜbAÓîešD¨ë¥'Äh± ã$Ü 1’¯> /€ä.^ÁLhaxEU¡¬Þ«fÇ36 á0=Çï&¾þŸ4GS³·]hoáÐÑbŽ.³h®õDÔí¾ý5~G†_¾1køKQ¡"•v4t%h* Ù⤆§ ¼­­;s¯A©uå±ðkhÁµÚcý¥¿ `4Ÿ?”Vh« ̲ÌÜÒÊF`À¨Ð@oL°,)>4À˜Ñ™lCÀ>U 0O/_¾^]\*«ÛS—V,L @¯‘+SäÏDåÅf—d”ÅW{„oUlsãÜjÜôaÀL\¼øƒ­&Oó.Y\Läða¤­à—çi _åë îÌÂï×£Þ¨ûO-7jc[6Ur*×ÂG]!Y뛺ËÕ ¥EIñïìÈÅ-Çí­? —•ÜG]aºÃ¢Ícd¯‡eíu(êP¨bÞ¥±o·fÂÖÕÑÞŒý(y“dŠþÍÒÈ6¾Dô îq:f±‚«AVó^|[Þ_…BÑKåÒP ¹&}¶® Àä?bñ`Á_Ÿd)|™^y¡Z{BWFp¨¶Ã Ë”i 2é©ü^¶:Øàh ²TšÕ\G„Â,­“*­O•]DŸ^Ü@|r=çmXü–eUÇ 8cûÙ‰o ÷Mx–K:§U€"§³cDÎí=Y²FŸÌù¬ó¯Ú¶o éÉÄ3§™u|Á@Y޲%þ³(Fú´"ywr¥—1(› ³hó™;ç¥ÙÀ­=¡º¨©Ód'êU?ëÔÞÏfhu9hõúšã–í½üïvë;Ôå‡ewf:q°yá×|H»WÜŸûy9ñ˯ÈKðËxÁ/׳„<L»$N_‘ yA\Aª!*˜òHC@@dxÐÆS§¯¿ø˜“¶µNìZR¶sgHÈÎe!UUeeB$èzâøÙFdW/ª3£Ì‡(Ó,nØ:›mC’ˆöQQ>š^PƒÆA1I¼lµQ reHbl‡Ø¡œ»ŸdŸþ9"Ÿ°$†;=ò÷´HÒ,¿85‡$l Û väãéí£€N)IW¡ &ÑËK‚˜,d5º”t¢R¯œËμÐÒ¤3 q§*ˆ ^¥‹à¾D“-‡8'*xîmÇÒZQ5«`74jÕ¯*ê}ñäõ!Möi¥Œ WUjÏêŒDXViª„«¼ < ”Fò¥‡8kµâ,šÅCǾ?Þ w7£ußï?Hï^4‚L€èGO‘¤ˆÓ t•®ƒykÕÛÁuÞ¯yìU´Š”ˆ‰[>l]ÎþóŽëÌ`&ìYÿ0„m[‡å×ê(nñwØüúŠªOµãWA˜wŽ_iŒAD%©j^ѶËÛó:E~{ãYuÌíØÅÄ*GpíØÞ'‚öóD1m¿ÚdD¤©ò tiiù”ÄÎá_^´wéµÿ¿Þü_ß,àåûÀ.Çåõ[†kÿü–á÷®bÂìíÎ+þ5Düëâ¼âÓû³Ýì¯öÓ^Vt8ïoÃÒ´+TIÄycÛ¶Ùài|œ&UNúÛÝg ¼ÝyKÚ“ÂU·M¸ã4!×Ûô¡ –µÙáé¼\£'ÂFÿo®¾©)¹^È©­ÕFŸ¨OÈ—ŒÔ<4›O³Aïµ¥w´í8*ô·¼Ìˆæ¿¡þ&4ß$Føû칃®>‘AAEu†üìt‚i:­V Œb•¾É W®’ÅÇù¦b’Ó”i9w¿DÝ9´áíÿå6²°J~héÝÇfë¦GÈãÉòGý¥mÈÝfËh”ŽúÖµ”5)¶›¸wpñ+‹1îÎj8·õð,üH$hLú+6 fÑS$þæïä>é”o±x‰×&ÇpõÀר•àNQÙ ·Hït£ú‡G…‡`•…+ö‚M„Has”·ÿjg‚~‚3ÂŒü'×s "´è‰˜ä_²YÂ$ÁÈ`¥÷už²„ –ìÀÛªé ³.äåf¤ß€<½îyô, Û1Üe0‚I—C‡à`6×BÃIýÉÌ©¥ù÷œEV/oùƒèþK1Zß:­ , ŒÜÁ5´9jc´I¹`› ú4mÓ€'±ÿ ¼‚ÛZû— =€Ê„í/½Žfòάónå(b>þ¤éÊÕ‹®óp\íÙbØÏëƒKÌ“)§'zÏnb¤Î¥É‰Ë‰¯6öy¸vçtûц<_ú3²úæî/uòƒžM\„1:{E#3Ê­Œjö?ìWÑì1vó7Ξ¾ðüÝ3Õ¿jîØIÝ“{¥üp!€ËŸ À_x1ºÂúÒ8n˜óÚ(Ýž@î@fU‘%¤ ,Ú?Ñcé‰m_‘f¸78_?dÂô§SÖo‰tqå¶¹„ºÁ|÷ûz êúñ¾¦3¥îû Îàw!²ŽÂ8ÍÆúŠ£{ój kÔl/rÉõM] Î̬íc§r˜‚7ÑÙF4±3ˆNµzˆùBdË¢PI~  #ÃÞrÞ Í“tŠ•ái’¨I«Óç’.6'1K­Š“«¸÷ð)+¼æßŸ •ÄF@xx È·ÄO´Âó$1‡òehšd.nÒ¨Uñ ´•g%æêórôÜmtÊ ­ùÓSxú–mßÛšö§½Êð²#_øÞÿšøÆŸÐ3¯²7š-ˆy‚ôOžï®0XŸjÙôä¾åþ“M-ý¥ÿ0¢bt‘E=ƒ3ÆB,u\:'ñC-,n¡§¦9µÄOÕdjR©()©¨ÜU¬pWo™rü]Ô/Iæb9Dÿœuõ)áì».-‰Yî¼³séoljœÿJyxk½R«Ö&àgŽ1ê÷k<[vwM—ôs¦±8aéd˜‹ë‹£özìIj‰cžtÅ}Ê•÷ íŸk>+³³R°ƒ€Oi{D›˜%4?w…]rÒøòù-ÄT©¿pxIi:Ðj¹ mŽ.3ƒéìÆ,ü@ *4‰šîî½€šÑ¹JqëJÔ‹UÍY±Ã`c‹ïÞCÇ?=t³á’±ö¡@†^j‚H˜™S§Cæˆà„”dJ¶~¬Ë× q„·ßÙŠèç>ý’ܡ軋VÙ­â–¾°v ¶ÍÕß×Å9(˜iwV~ÿÕÙý5õÜåÕg£×pá´î>Óæ‰ö±·TgÀÂÜk¬®=ÃÔËÞ›Ĺ¾Ïšœ ü÷¯* ¨ÛXïµbݪä`f…>;q{O݉c-&²òž$ýqëBt‹}Þmßþ‘¨ü7xûºÚþþG¾vxý+¬$”°í¤\¸—ÈŽÀéør1óölyT…wxl‚BÁiÔ5ä§Vg|~á¼,W[=“‘’š"Ÿ5w_]沿¶¸¢\ —ÿå¶Ž·XoüÕÞ úþŒÝÃÉ,шº¨"ÜYû¢µ€&Z°-@}P¿¼Îç(õŠ„ÉK°t · w‰Çb"ææà^'±Õ9Üçþòl`ÒSõ‚£®Ïjrtùñ§&ëSOŒ/—›ŸÝí/Å(éX@ÖϮԖWŒuÐÄœq¿ŽÇ`jÕ’åÛKcK…1ðA7ˆå,ÇÏ4þÁ5Ñ‘‘‘²e ÃÞ%(ëBG‚"7²Š9é?ñô?á€7­CÑļ&¤gá†õZ¬V£>Ó?!õ§P**P—Dʾ}Oì xž^„ûb븎ˆ)R•éÙ>EÒ³\ ê’‹Äp¯³>ä&ÔÍ„..¿E§ÌˆºŒò/#Ê,æ¿"\SªÑ†rQ’hÐhÎ6æ{3|üDl­¿™øâÄ᪦ݲìÇ"öóuþ‹_Pž‡lñt¼ÅS±#^ƒ8ür:v1£à¢¬<õ¬…B&;¢¹DòP5¤¨f¸O ™ ^ŽßF“Ñd†¡hzÍÃ]°âÝäÉË| ¥@¶ø ‘ ŒÝµuå&E80 WßGb$>{ÿjõáhû:Y^éŸ"†GŸùÑ'¼•ŽÉ.•d¥f@®mž¼ :Y A\Hä*çàÈôMA\v\´<>.!sº0ÂDbsÔ ÛhyLœ<5©(I††,òe‰Êdˆ·UCP ‡ÿƒ?°ŠÉKÈ+ÌÉÍËŽCœÚÄõ¾fŸ¦JSéU™Àæäå(3£2;Ë ëß(BÝÅ(ëÙÆ±¿ŽÖˆßù-†îˆÄ,#:؈D¼U£˜Ÿ€¢XTýŠËqU£I>”„‡CD,‡kp ûšÈ7I,D P’Ïýñï9–$¢Ö /‹ÑÊ'BgxÝ凳‡2â¶Épé_µ ¼˜ÆÖ‰Ñ¡mÕ5Ä#½‹»#+É÷÷Ïï®K5pÛÔŠˆfv”Ç•”–î>»¾Én"î± ‹8,ù§iÓŸ­€®Óo¢¿-#豤Õj5±+>Úê$S(ÈâÊv´É½yÑCö¹¿¨ÂÜôÌì7MEJƒ¼ÝPobæ3^JÌüëõùßho…•ô¶’¤¶R盿>3‹ì‡Éþ»Ý#o ‹w‡<ýòÐYXÉ%*£ "3cŠÌ?‡½ ûÔÖD¿ãþì·ñcÝÑ; ïUZ}F”ƒŠÅ¨ ­fÏà⵴™&ðJ1¯D™¬©MF¿RyüOõb'Pœâû‹ùå­NlZž€„Œ eb• *ÿý·)q¤NÔíZ$?5;[Ïu²AŒnøƒpA'šZmL¢†»(ó®˜wEWY¸•rËç çogºÁjX´m¢ï┹ð>ÌO¼oÞþ÷®† ZïKãoª/§Ý€› öÆWYXcŽüV~žÀY¸—2O” ײÌP—"KFgÛÃ> endobj 232 0 obj <>stream xœ•X T×¶­¶¥«TD¥­ jºpBQ‰8c⢉â„"(BQQp@î>ÝL‚‚Ì“(S‡Jœˆš§otÅ FML4/ÆsŠ\ÞÏ¿ 1/yïýõ×_µ nõ¹÷œ½÷Ù§dLÿ~ŒL&cW8yNw0ýh+’I£ûI¯ËxÿúN÷j30—ƒyÿÆÑüCKl†ÞCÐa(#—É–¸z9‡íˆ‹ в™älg3}ΜÙ6‹¶Doñ µYá°Ý7Šþ²ÍfmØ–à€¨¸7lmÛfãfz"ÒÆ- 2 "&À¿/¶sØöÑQ6+Âü"B†™êæ¼Ã%bIäÒ¨è÷bvú.õ‹Ûâ¿2`Õû«݂׮sß¶ýÍ·Þ˜>cæ,G†YÅŒcV3ã™5Œ-³–™È¬c&1îÌzf2ãÁx2NÌTfãÌld3.Ì4f ãÀ,e¦3ï23™eÌ,Æ‘y“YÁ¬d¬kfcÉ(™á ϼÆL¥éaX&šù»l…ì“~^ýÚå#åqýÇ÷¿f6Ü,ÎLTŠÓìrö)—2Àl@Ò€'ƒ1ƒ¶ ºoîl^38ÑbšÅÁ!ŽCR†²Cç ý|Øöa?Y·T[~¢ S^ø›lŸ;cñ[¿ø‡ ˆø¼3Ðh‰ zù ÂJÙÖ&òj¶RÉP pQ[©ãÄ%À¢ìAÇ•Úâ˜*Rºäßavo˜8e½›g¸Jy–,L4S³]™à/.Öâ7ù sS´6#æ‹–8­ðŽ%,N´RJX% â1—±Ï æzÏ÷Z1Y@Å.™Â.Á]îÛYŸGUÏ52=ÊŸ £–üøö—xêx ÊÉUž¸b®Wµ>5¾°¸}@†“ñ* éVR£¤4ʪq8fâp¹Ô€¡<ŽœöœÌ&o9L ÖdèÉøÎýú9Q‘CÄ•'J@æë68_+~Ð\ÜÍм»$¨8Ö7 C”*z®ùz&A”~eWÑ^ÒtÈ»3»§ó…w@«=˜¨zoõŠSï,kb öÄŽø_¤w4à*4Ã!ÈÔïŠ?»tÂA2’ ^i ó`v™Çeõù}wà1|˜ŠÌ•?úøëÃgè†àû%D™«×–W¡7T}u$ëEc”d[-_"CZÎtn¥¼ƒ;ðs õúÜÜÆ¦3%À]ûp%±$c\<–íUùMBBè¡»NsH ¹’m jÝßNþé1 híð¿pý¶¸(Aù}K\~/k€Ð£ÿWнü=ÕTå:³ÏÊh•Ç¢£(ïÄc¼ZMTa3È àÈT¬ëT<ÍöY$ˆX«V,:à3Yµ³qª¡Â) æDÅ6L2û‡ÌTó/hÁ»-¿Éîå™>=Ç­ë4ó%ZXQ°{Mœ…Îìr´øQ¥ÓÅí†PίzçñãÕÅgÝ{¸lÙà¥R¶¡KÞþ*éöëôm†v¨‡«`Ô˜¶ë¨)@©ˆ%¿ošˆ¯ÓŒèžË÷üôj3ŠúÔçÐ €2hÕp"…¥§Ø§Y(‘h– é@¥ó’ô@tÿò˜$£4ªÚ²¾Ù÷&î£ßLûD‘?sÙa¹®'Px§>t]ºJ¿GŸ\ \¤— Ÿ±&<¥h!Ö_ž”±¸íä V[Švíƒê“îî唌IwâW\8 ¢Ç„ßnÙ§JÎM†½ÀEBR”@dl,(È4ÀÑb•JަÚCÎ@pUø mËκ JÁÿxHƼš ¹f…u`1ú‹Ò@ÑÒ„íÉ8vc‡•rO÷˜³|ÕŽKá™ÀåBÎQ½?Ù Í,ð‡5ð¸§rjoË*Eˆ…Pÿ¨ð=!I!àŽÇ7vùtÆß„oû]ø £ñÔÝžÂ/ÿi aÿ̧ ÎÙ”?:2L$[ˆN ÓðpÍ C×) Ù™ÙLR#þ&â‚"Ù Šû¢·Kcx´‰-®U+t7Nš¤á?'ÇX›¯£o~Úvþ¶ê¬Ú“]¶®–ªúH”d #7-ó*p"¡ ÕE@l2Äè95[x\“¨]ò~p$•(±Â율ت®ÓA]äG]eѹÇüHDä€u>d§fs}ŠÖ¤¼»XÞMƒ¤ç¤ºh ¥Ý®‹„ 6D›‚duè4š$FK²ˆkÌ>!:ívð_Ãnºæ"[¼´ ƒÓº¹d݈±xØ´ÌOë§óƒm°ÙÜ» í{fîJÛ_Öå–™ÿŒxIŽüåo&ŽN3£•Ú.âªho´¬ÆóqÎ2õ®ià]~xÿ]uRQtÊJã!^X©§§+å(¨-þˆØ¹‹”™›ëbUU7ŸˆÍ×T•Õú#ÀÝ©ó] SÜ.ÖÌdÂÈ)84îúgbSs‰jNç§²S¦ÅGxn©kEgäžJ5©’ïŸ+*ÅIsx<ˆê’‚f8As**¶hÜ ÀimÙʸòä¼”}ú,M‚tÀÛȈlE€½ì À„Úç¨Ì°õ-ôúêM`ð}öÇ/Д¥'65É:.q'g‚ÊchƒF¸Ð…¡ìzФíËãúCí…(+‘.Éño¨ãq¾–“›‘ùXSÚj=tÉ4 a¦zæÂ푃)ôÓSRfÛ°CÖ¬QT„ë\µ!BA³•.ºÉ¢q%Vdâ®Ø@ðkª¢†3út(‡ Ú"jظØô =è3 ÏP†ýÈkfþjE…þ²¡ª¡M[C×,f_Qn{±ôº×tþµmí­ÒÛÿÙoü…žg"›W˜_WÈ)[u¸?…v/z{”ýwd‚ӆБBéä1=Vwòx'ía@»¨a]¸¿êç.ànÿÑß3CÔFéM ²}\ÊÌMíãR$…ùŸ¸dhƒ}º”ý:@X*CJ,ý\ZÕ3&Ê+Ú+déb°Þ Z}bjVZi.Ôq5‘eÁa¡±þž¢ß¥»ºÎ3iÁo£©lICeõÔ”8á09öHSø¸ÝÚ8À½èÂe¬!KѸ±þn*¾ož@.3w/ìÓiã“Uá®^±ž´§ €Û?| ùº|&Gø#Á¢$ïM°)Nú+UÛ%ý ò½j&ýüç$VÙѰÁ#cë(b;v&CF|;']>YV^%ldqy†YŽ/y’ÊÆÇù­[@#[¾qÎU4Ç›Åì*8!%¡œÅ¯#^Q㬔rVŽçºù„#:} }(ÎòK ˆÖéÂ4‘-Í#aj¬ç©™h†3½šÁÆÁ.}œ!4UG;'±RrÏÙûôº<°>Y¥‚t‡…½¾2µ,Õ•À•‹ŠJ8*?½bZÎ@¾®@{\£×A4×cgÞᦎáZƒo÷YÂÄïå’u„%Ùp¬*éö†SÂûÆõKè6gÍO†‘‘?NFGœÑò2¿ ’wi“w' 1^n!ËèŠ1:´>-Ôô74蛋k*b¥2‰éæLBs·¢±×.B{yw#~Ëã62ÚßG2‰¼O¶  ‡;qªpúªzú“ËüjpªôûtkWâMxWS¿jý¤éòµò‹Ô­\k|¯~yÚ|X .)3|—lrr‰vO¶Ù¯ð¸ƒºú?M@æ±R>Ã"¿D­ø‹á¡¶é²"K-õàç ì÷iVyz:h3U{c!–ó©‹­8Q]ÜÔØ6ÏŽ0¾ÄLe»P}Çäæ-GšÂjÂŽ^7?šŒ¦f©íM‘š‘rÐEA‰ÉÝ¢jÓoÒWäm¡Çñ•¬)þUÖh|Z„žŒÄ¥ÀɰÀy1Ì'Sj܉·§>½iĨ&Ëêï\PŽ‹Q]X)IÀCèÆÏ„kmmpíáCxwÓ&xw¦@,öóí‘§µåTÆwÞ»!FÔìÉNäëµÉÚÄEäÇUTä–•îªóÞ£ÖmVÅñ-^Dë9~Ý<¿"¿ê(!,(i+ÄÀž´!œ²›‰×8ŸŽôì\ˆjt¹wñƉÄ+ïÖªÖV®‚)N»w²~sfB=@vÚÑŒC\q§Z«¨B3XèïN^#æÛÛ/]\JMù¦&Á!b•«ú2ˆp² ÚsÊJ¹ø«p ‹Ž†y+×Â[dŽ€SbxäNœþ>æž“~_’Õªž¡$ÕH“J'šTc_¯¨b•§hü\jT«‚«ƒ¨s‚÷`ãàÖè®êïÉyœWBe$F·?^'$«C£·Ã*8p3¹Y{8ñº.}ïuU>¦"[Þ7'>BË{Tüšä FIëyâdRŽ‹øé*}‡ÁÔùNkTåW°ÊçÙÒ5¾5°Ö×'(Èǧ.¨¥ÙXÛú»ß¢cÓ·X^m÷~†×ŸÍo³RÞ–l¥<™Pµ%km-\¶n©ìúñ³çÁdt©*-´¯ì0.ïõ‡‰:ÝþÕ¦ÍkÚ—eÑ6D¦:O»¬Æ»8ZèØX{e‘œòÉCÚàKbŽî)§â¼Â—Œ[@¦¡]¢JWéѯ¬ñ²^kœe0dRµ·¼ñIRXãœ.4{Žò·ï; ÝMTËî]5‹´½ÅD:DuÏæÿᨈ!ItÏB³ìû8¸»=÷ˆ½Zq.•¢ô"½è휩 öÒ½OYÙïdEï4 j1¥àÇ>ï gM^ëþÿ§gƒY*²DFœµhõ¡JšõíÄT–XÓþ*Ã-èöåäÕ«ºJ:eÈ!#ǨîeüŸÛí)ZÏjýIƒ‰ªíÚZÓ˜obþi÷¿¾5ðíû²Rvü¯o¾îèª-Ù9ÿ?¿9ø?a_x6wðØà®ÚùdZjÌ·M!®œòþ¿¿gn%´à ãIZÑ`y’ŠéJfƒ£­”=èŠßó…, ¢¸%óh™xÎx™rµVS˜·¶sÁ¥a eõ]¾WÆÑdŽ#IW)…¹Yï4-|yƒÊ‰ðôs‰6¶·Éàèµ°ÀWø™\á=`GCbÞîj¸ ;'v~ 'ÚÂ"[Uï~¤ût+Üï`þ÷¦ÏKŠäwg…åC-wãqfã—§ü–n Þªjào«Zá÷“CQÁeî”Í®÷6«”f¿¿ÙmÑH2OäqÖý‡Ø™ÙâÆJY°”¯‹wtnkø ¼¸Ùö»ÝìÜNß»w¶¥®èU¥ÑAvä¸ÿßTçóŠ-uu-¦mR$$‰­E2܇ƒäøK·œ/ìð-< šï6ž !·S]¤ÈƒNýÅB®'—j¶5õ%‚;àeßlcJ?P3~ÇÔ‹²ó8— J.åbÿ5;,ß{0!i!ì¦2;Q!6œii«AÅ—WEøžCvÜQ³1Ø~ÅôÕ'÷”U7–œ:ã›·'Mu¼¬þ°¸íK. Xê²X ÞÄ7~)vZÇI‹ú*Nš5ÜÂ×ëME·§Ihé_§wÚ¨þŒ?ó׋oŸ‡ÜÝ]4ΠyËßñ©ÚQßV^ýÁ÷Ã)zU]eë¡*à¾H]¾5^G¬Æ% ~Z­.Y·_§ÝO†²'!. T­ :óÛyªa¸p´^BMVy94qm!U›}ƒvxN¶ŠVgéí¿é }@•¬/µ(%—"Kêõ‡Ñ)‰rå¹´øgâdiŽâ˜6=,F§Û³OE~êyÏLM”ÍýMîÿʼFøêhv'³Ê'ôYž€¯˜õü2íãq¨åyùÖYÜŠci_¤÷æ‘û„L ]¯ Q«p[™|X[Klû-š•gjïÓБ,Ap‹^Ÿä `}axÖj³4Àí…„Ýi£Þ+¾$Çv(SÕÐ~.›vŒG0óAù«L$æ‘®éç}UFÃñ2zø³>G#÷xXùæ½7q(Îúá1Z¨,w;&Y¸©XA¼3Yq *©öŸ]d> 1ÓÜ•æƒõæ ó?³ËÊ÷ endstream endobj 15 0 obj <> endobj 233 0 obj <>stream xœW TTW¶}eA½'"âð¢Äø œg$ÒIˆQGEEÅ¡@I™•y¬:U ó<#–"…¢QŒCkÔh'Q£Ë!f šNBÎ#—tÿûMV:ý^·X‹ªºõî¹ûì³Ï>2Æh#“ÉX{ÇE›lÞ–þ(Ž–‰o ÇȤþ:¡;ÎLå`jÔøÖˆýðe(n‚³Ì¹Læ°ÊÕ>pOD—wˆådû)–6óçϵ\èïä³Ó-ÀÒÑ-ÄÛÓß-„¾ñ³tÜéã1Ór¡ŸŸå:éÁ–ë<ƒ=ƒÂ<=úζôßâdéèáÀ0Ìô€@û=‹—9‡, ]¶Ïme¸{ÄNÕžkœ¼Öù8¯ßàç?gÖ6o϶ýìaœ˜ñÌZf3‘qf&1ë™ Ìf#3•qa61‹˜éÌfÆžÙÂ,f–0ÖŒ3‹±a–1³™Œ-ó7fãȬfF2£3fcÎ c†3#žyƒ™AbŒ_æcÙJÙÙ#ìpU>A~ÙhˆQ¼ÑçÆoPŒQ²6lgÍ55Pm2ÖDgòÛ S+Óóƒn4“™Eš²zÈ'æ‹Ì]Ì÷›Ì<ÌtضaÝâ ³nc0ˆ&zÊQ†ÛQ&`ÿ­ûY2ÀÞÑûAƒÄ.ÞXÅ^Î%¹é b+t·á]ŸB…š38 ‹Ì½ö«'Ê‚¤ú?7°fÿðv “X/¾©—Õ¡)梩\¬Æ@G[¿ 6d®í8òù|ÚàÜÇ/p˜@td-OÞø þ§¤^YÞxªØBýž¢ÀR/pWnŽð‚Ù¿åÓc˜hº”âŠ2t7È.£•¨m–wÇvÛò*|`ï|fYåB° ñd&™@vwœB¦ E34)JÔŒ…2ŽL'¼‹ ¬€ÙÅÎW¼|/ ð}Á§­¯Þ}™}îv«%‹uqY \è*•F²Ñ€ôâÈzÙOÉtzA1 ãƒÀ{„mZUØ($–j´û ƒ”%aÙpH(ÈÐAa©p¸ä”÷y(‹ 84-ÎìÕï+VºóIß½2gMœá®=…2”§/ Ò Ú¨L‰}eZAÉ kî­.Ö€ Jeÿ¤üÜ,G/qã d<:»)4“]'ONávß'u¬ÕƒÛwZ.ÞÚÝ\Øåþ~kàz…TF冧 XlèÃðŽ’wwä» Šµ%xÑe :NÕEŠÉ=,î2°ú\¢[£ûêéúj(ÒVx ï‘Sÿù9Kë†B˵ý.?Ø%®æ_¥z»`ûj»’«.øK~'A,;ézÀ/•wà¾Aо£À…éÆÖ1N*E#ÊYyUãèð½^êIàF×$𢱢QO'1R±õº—ÐL×K¨—x!=`ÀÚv&©Lä 21^4ã3 Ò2¯g`½Ôjp‡= †uôluyR‚4I±J2d_0(BÔKè–X {é¦+,.î–®Kª‹BÈÔe•r}’Õw@·‡8˜Ï(JÍøH: @E±t‡¨ÞÙ¬³EHŽUŽ%y„Åã Š`µ}þ&Äfº§ƒM?•—š˜ I NIФ, kGK¤Ý!ê¥t·/¸‚ïnœÑ34#"-¡,r(…2K»°xT)Ì •ÞZ”CjzF±$cQÞ£{5ÚêeÇh‚Ü¥î ÂsüóE—‰•31Išëv4¢º¶¦¬¡$¡xŽ Ïª„àn4yÎWîdÉÛdö"Ÿ…ܾO>;ÛÜRªÜª„6EY&”—ÅA¤r• ¡‚#²‹üŒ¹¾[Üõ§¿B¦îûC÷\þ]ÞFÉEñãp{^NVæS°0°kh&¶ƒ?ØAT9TjÇr¶Ç„Ü6Ƈÿ%1w³?>AOrT—’–É1[ TP±Gu_CÔÂ7½ík»’Åæs}´ ò+êZääee~)äLò¡YWA PIYR‚š¾ÔJÛ)“q°qó«LøÃ†Þ·XœEÖѶ7):2!aX¨ØK:ÔQYk†#ô\6<ìP†´™Ê—hŒr2ÚØM¥¨Ô]§ÒWKeLÚ³¤¿„ÞÔã†6ªª˜#5îü;ËÍlQIQIaiÛÆ 1´ ]qŽ™ñŒŒqÚîë®<äÊ?s®¸™~gdøòí°.x—ÒÏuk¬/,…]g"ËûoO¶êÅkY¹Ä…xqŸžŸ–yU"®:ù•¡m…¨””DMŠT‡È¬•*#˜"H1rê­Œ«,:öLHŠŽ HжÛîë°’!bÒuÚÚ\hàôÁeþ~Áa>[[Ü.=8§¥T0S¨ÌÑÛ@MÄR4‘‹Þ8ÏØMt’¾g™5mOV€ÓOuhq$ŽÌèP'i4µF™’u‚8·cû«ÊòZ6}qXB=KÞúÖ'¡Mr•ÎI—dé¥Ô[ûÅg;Z²£Æž3vâlbIƽ˜ƒZKô'•.,:ü.E"Kd=Ïx·Õ›¢hs æ€ÃÿNÝLyƒ²îbGz4AK„~÷JyûØÞ*&¶ÊÑÐ=‡ÍÑh÷Ñßí¥ä½®€Pfor„zŸ&¸•¢B÷y¯Uø¢—¤!¬}pj@šF 在gÅøž¯s¢µš<°¨„ô ¥xŸ…r­öpZ±®T[L‹DH;šŽ@xBh:*ØjÐAeJM²V¡\ÏIe«icAç|¿Ï¹Å=—‹›p/_‘Uµ w·µ*ÝšóÖJ–`Î2ŒXþ8 §á´S]E!ñ€&%*Q¹wÅò0Wºc‚G_TÖéš´'ËêKŽ/7ÐBÌ"¦ÚÍ«ž3Ñ Ýæõ½ömZÉ»+ðk½‰€I &cÈ$âE¼Ð’Xáº,Ñ ½ÒC®ó+`U燮Ÿ&}C­ÓÇ©›n´Ü¼]ÕA Â%UÍöks©æOŽ™·Ù!Èg½ÊN2:r&Aªå‚lïóPØJϤýÿ#ßWà»_?ú™éÈ|eÏô>õPü¹}á›b'Ö0ér˜K¬•D‰íŠ>¯K¶Å·Ÿß=ŠQÇdu0¸+ýßÀü™½¡@*Á ŸÝl ¨ÎVÖV¦éR’R’!Š Ë?|8¿¤¬2⨛Ê=,"Lp¯ôÈÚDÑÖ¿¿Ä/Û½ÙG¹?<›ꚪbWÙàDÇXÇ9][†«ð‡çï>Y[”+¸V®„Ù; I«Êˆn ºœ©-ÈÉãpP:o Ÿœ> Ÿ<~ Û¶ƒ­ò"qå?½åâí½–ºÌQ^®^Éd.˜h}˜Oè±Þ0¬¥´9ü xXÊÍèzým8Ͻû8 =Ưaú©¦ŸûEö;üR4ÂÑèò½µ> Ëèroó9çý@SÜ?sŸåŧF…k¢4ʤÍ~a°®Ç?OlO¸C=-èRž Äzúœ›:ßi½Æ–¼+ùžy1RŶp¼ ’cp·œoÚ]çáîçãéYçÓtR_×$Åd9­ÞŽ?øÇO šÖÎÕ^ÿè(N“d4ÚÐÍ6Ê.?ÃOŸÉ1C\ÅO.O¹ ù\›¾£³óñV2²LH MI¿ëB'Vr )šØ8Aµ%¨lóÉ©tÀ·À†È–ÕoÍTžs9’øSÈËÐ\uyX^TM lâTaï£ÙDY‹ãM1¤î{åúœ V›•-äädåUU}´íA”46Ìú{W×7ŽÏˆ¬Jʈ™—¤OÎÉðsÉœytÏ盤ØGb›Y(Ë|„ã»ßó„LS)îé~„cð1üîIÆfšøäK¿Îœ›Eôz[¹*›N¢Ø×eű§éÅnþÿÒ »¿Ô‰¡,7q-1!öÉøæG‚8ï/z¯ K¨Ç€ÛÐñ!¸† ¯r'v¶õ%ÎÿO=ë£Þ4Ý¢iª†[¯ÇHym ó‡uGߟ¼ûZŸ{œ#F·.õ= x´´`%LÇ0W`e÷Ï]9Qj÷—ìÿ»¡ÄnD¢?&Gêe­È£—ã"üO5éò‘óåÍm'¯ÑR¬O© òL>{8¯ê£‡õE-—v~<– %vv$ŒÅQßNÎrê2hßJ˜³S@¹Ä¯„ óÉ™‘z¸Yi?×ñÞ4Þ'ôGP&æ£In© ¥þ¨¿ã³²i¾hy)€L9­ JS稳97Ån”6ÚìÌ›E9Yé_R;ÆáríˆVQüœœg[¸emY•Ÿ—‘!äR‹Ø8#®ÜåÌÄA¸ø¹,Ûåx óÏI»5ÛŸYZq¼Ão÷Ö£Çn?ww½ßÉÞzì—ÈÔ²_Ke—Åår1®{=(Ò@ÇGfG…'GG& =¦ÿ²MЦž@m‘›W’–SÞÿ[ÊTC ½d$ËñE7ËרÁWX¸’È©¼páªÅqhOoÌãzʉRÅ6ë~†Vºº Yª„1ýé4Á«hÑf]D tÂrQ‡¾tÒM Kp:Ÿ`©ôZ+Ž~õ‚”y£ ¾ãÐÄòJã©+§o4¬¨«/;ÝìWæ—&4žnO+îyËövíÝUJâOöÅÆÑÎa±_œ÷š$'QÀaÇâˆæzÙç8¥Î“éã\·ƒa–§sU² ê –k ¨qw p³~¹Îôó¿øêåÙ o‰uµð¤úãËðw×þ Q£ùNïl>yàpÍñ’ӱǶfÍM7 ¸§ààú¼½>{ÕžêhÍ>M²:1 ™ÛŸ¥¯QE…A\AaýLòwKІï4L*ª4iAj8-Ξ5Æ*X Âõ¦º’s§è pr£5jHжØã ëÀ5gkQ‚.E—\4ÄîW’ª’1¥Ù:JY!7¿¾åf¼gãÈ]«ò?ôQ¶ç5–×ï­Þå¿;b«ísqÎì|Šæh6ï1³Ó5ÞW¥4‹Îí^”K2²pG©‚lË` &($˜Í-5x,ËÔe¦ƒµ¦f ó¿*Ø£ endstream endobj 13 0 obj <> endobj 234 0 obj <>stream xœcd`ab`dddsö Ž´±T~H3þaú!ËÜÝý#ñG*k7s7ËÜï÷„¾Û ~·áÿn)ÀÀÂÈèæ•æœ_PY”™žQ¢ á¬©`hii®à˜›Z”™œ˜§à›X’‘š›Xää(ç'g¦–Tê)8æä(t+¥§•¥¦€mvÎÏ-(-I-RðÍOI-ÊK,²3‹³ú3™»˜™fñýgv`X»à‡Ô|Æï G™¿¯ù^"º´òtü’Ê¥•½Ý“»9æNŸ=knýÄÆ~ù† ÅÓ~3íþ®rZbjÿŒ‰Ýó8&v.Éû­ª1ë»vEùÝ’•ݵ5}µì³~ëü}Z7¥µ»(Z_]S1£uj»üwŸß*Þíu­Ý’­½Eë侫¾«ùmÀÚÆÞÞ2¥dq÷²îþ…s8øŠÿ´_Àö[h2ûN®'Ü;gñð00¸‰F endstream endobj 11 0 obj <> endobj 235 0 obj <>stream xœµ”{PTçÆÏÙ{Ž Ù£ÙƒÍL5blKÄA Bb©\.ÊnË å¾ìîËeeÑpÝ–…]H@.‰PAŠ¢!˜š –ã¨525ޱ¾ƒ{Öë´ÓþÓ™þwÎÌ÷¼ßó¾ßû{HÂAD$)ö s÷°½Ä¯$ùU"þ9 pÌÔyGp¢ÀÉ¡{“ó4’-C›ŸBk—InÙéŸ’šž”¨tyÅßÕÅÝÛÛËÅW!OOŠ“q.!2e¢\!S ?É.á)qIreöZßäd—0»"Ã%Lž!OWÉwÝ»Ú?E‘š©”§»„¤ì’§sA,åÒ3ƒdÙqòíIÉŠ^óx Þ!‰÷‰5„I[w"ˆ!B‰ Ä2b9ñ ±Lè…  ñ#ù>Ù-Z/§^ J¨Û[ÔŽ~bR\$þ‰.»Kn‰%–ܱóXùU&(n‚âßEe¸Ê.®oçþ$pù†â½Œî¶¯*päès†’H›é¨’r´¥b:À #`Ñ2Vz[>aQ(ýÓ—£gÎÔí•âüÿrò·:³ä.™{ú…œ›¦Ð›(Or£ÿÚC誤ÅeûJ!•áZ L¦Úv[jGŒ'·.«TªC”?ûuTœ´ÃyhîÙKûiö°÷;-4ñ+ûvŠþÈûIªiϨ€ÍÞêφ¥è;¯¶×‹ÝhÛnsÚ@þqh„.øØjmmè`ÜiÄp´ÒÅÕC,âé%<¨Lã·ù|+yü&Z3MñKù9I_•~Rj¥ÓµþÀÁnxR+®“¾Z™ŸÀ.DÓ;·G¨¶ÆR›ÚÖ=Œy_[’2-/>`"äòw×O#‘T˜Ñ¬A0rŒm3§Mäáó(vbª…âLažýÑ}‰]QuÑÀxGqƼVsc£y rÙÖO›ú9zJîÎÆÑø÷/x‹Ùô}úøGúÒª ŸÓì©lˆN8ÆÔ4ÅXIã·ïŠ.KÚ'?+7‚ð¢œ6ö€´.tHÒÖ(!Š´ê²Â±ÞS¨­´öCù K7˜„‘¤i#!ä‚ Ì.ƒº6¹.ˆœ£Wƒ¶¬8G‘*&9« Xè®ê6gÕfç¨ 9ù¡øáÑ¡³áYÉþ_…-È:3ÒBvO¡¨‹ú™Kòã!6£1ÇÜj¬³N¾=¸/Zû<~?ówW䈜mÈ©¦¦4E:M¾†Í ˆPDºq½Š6^8Ö{2wWëãÚ©Fäo"mS¨ø Å/G¹’– 0ÞŠ˜Å‹±øõðRìü£¢Ð“GѼ_]UZ¬U«µlš×V¥ ÙKÈ—5ÒåF‰¹_iê€9ØW—' ›/ª÷6}bFV=7N^§‡ÎKÐoÄhÑÜô­nWðJÿ3‰¿ª,Œg:èxM¡¿t/'6WÌ,Ù`Ì÷¶Ü_sà«EF j£?ª¨>,#OÀŽ12Àbìeïæ©;gL?Z~ƒDäY ùñ ‹ª5%-S•ª0g™;›,-R,Å¡Ÿ×” X´=†jP¸î ŒÁÇvxƒÊô},ï@?¬:ïØ¿äæù fQ¹Ðü¸ÀàÖÇ ãQN,¹K­›û—ø±s9/û·Ú²wöíÊ»ÑüK£ÿ!·¨›"BÕ<ÿ++Ùx'šº³ŒŸ‘4 ZMÇÊ…C1Z-DCD@†}³ÇuM{`/¨5ÅÚüêçŒ=yÐUj P¹Â6 f… ­¯„Bš]1 ušƒÙÕ¨N®MÀÏ/„9ã7xµº*ìŠã`J­@Ï#ÅáC9Š\øÙYŸ[UVÐWêëÑF¾Á½¹Ð ÏÕk °¢ªªôõÌýHQ™æŸ5‘SÈ0Eñ%pQýׄ©Ø‹þ-‘ð.pñR‚ CàVí×ÐçóeÆ ¸ ÇNXÇz¾­øÆƒ¿‘ì ¦,Dœ†)ø“°’ß4œjœ<Þù)ô˜Ҹ¾6 6A lŸ‚Ð,, ÎJ„à<º3‹­äÐ,Ú}‘âƒÑ&I¦X“Sü^á¾’¢0PƒCÄí­ãŸ[Ìœ.£'à&ƒè×.`3¯¬ßq*›-õ]YÆ”"-è4R㹑£À\:°Î3Ò7l‹£°Ê1ƒ'é-·_ý½hF‹¯MšÉs×й`„%9º21…zh’_ê}{ þe`bäï¼[¿àØ.µÕžÌV•)%#-OîqÕÏÎû•k·¾÷ýjM£ôrÛè×ðgfÚ{ÌíeßP¿¸Îâúfs½­+£.³ôž©Þs³ 棉\×,M8Ã*¢“4©:f‰°?>ÍØRRˆ±ì m}bâIé^&§E¦'§‰§ÅñO (J endstream endobj 9 0 obj <> endobj 236 0 obj <>stream xœ}•yPwÇ»˜î4šd<*Ú=)oÄ”.¢o¢Þ`"È1ƒ09GaúÍ7à ×r(µHD<’h(³P¨åjÅd£ëf7[Ñ*êÍø£Öýa6ÆÚ­Úê?ºûß{¿÷ý¼÷},ãìİ,+ Zâ=þ5×þkŸádŸ)²Ó±Ú±ÅÜdàæ|jímŒšŒ«ÞBÏIŒŒe×nÚ IÔ%ÇìÖ*ç,P.ñññV®ŠW'ÇDª”*m´:^¥¥?qÊ`MdŒZ«óT®Š‹SŸHQ©SÔÉÕQ/ShâSµêde &JœÀ0Ìä€äµë´©T‘Qê-Ûb‚Cbf6ÌÌcæ3Û™ÌBf5³†ù˜YËx10™¥Ì2f3ó6-‡á˜ æ;v3ûƒÓ'Éé®,Aö•ó ç:çç.rùn7ø‚õø 3ñ…“¥‚ɰ9Üml÷{Êq™ƒu,WX%ã‘|IÊÒ aÞ{¾ÞrÚ¦²˜¸“…‹ÉBü=~Â÷+ƒ¢Ü<(È•Ä<¢œ·Œ0ÀÏ!ÞÃX‰Uèû§ ËƒD¬MY`(¾LVqâ 6Bɀͮ´°ÿìCî– b¶âïçÝ6›¥³©ú¤”ÚœêŠzss[ìñÿ«¢sD Y9á³]’¸ë¥GöФ•SçÝ$$q¦n°A ôÁ oã²àÍá´g Í6¼ÜÌâÔA ±Êìç+c9IòoË!T;Í…fÃZ¡ÅtZá<ôÀy!•ó7”±ô÷¤ô€·hÅJÜ;÷€§°«å¦âs*äè5Ud:o•Ód·¨ˆø¹Í¾à¥ŽRq¯âLañׂK1l‡DÐÀJ£ÚÈ'ä¾7eï7pĉLÉ›MVQ±^—Kx].Ìáþ."¸æþ½–«­bMD³¦øb£ñ7™ó¬vÁ†>ÇÙŸûQ°ÊÐÝ>_JQb Nn˜½ä>ãÒÁ¥qFþzǵáª.˜[›ø©*!òøc†ù×}&ÏbŸÙÉþÒQý2üÂî¯øÂFÎ;tõ*ýÅK>àÈ„q>çà#yÂÁz·i*3›’†á!´—ÔñFO9º–¸Ø¸­¹ÇzD|ÎÑë,•ÃÕ6ÎI†»ívÅ… ¦ÂÅvA }vA¬‰Oâ†+ƱáB³ €bk3õA}ú í5ðì +½.fXŽß³°ç¾Âˆþû´ð1¬PÀ œRý¬=¼,øA>;i8VÙPÒÜ”^~(ÿ¨$ˆu7.[Oß;æ-†q[ kò‚ã7Gëvƒš÷{”Ú?Ð×zµ^0…5Gv_×_uO¼¢ â>IÌËŒ€K]ÂŽFÅÒÀ°ÝQÝ'+û¯µ ='ŠÚL<½UyeõC#V¶ý&ª†eøŸ)Ò5­iÈ«4·žZwÙïý% È»dúß¼žâ¤VäÊ‹¤B½^’2óÅ$ß ´pà7ù]Çù¸hdàúÙké!õâ+<XPÓ9ÚÒ'à Žß erùÅ7}é\Î÷"ÓÈÔ'‹~Ø5h.Ws8áûsnÇØâu‰Ú´˜ø˜£éÀ'̪Æ`Ü…|…­»3iƒXy @÷{5©Õ¸ÆÂž¸‰ú~™}2f)ŠŠÀeüÓí?ùûÞsÉ[dÊOî£èÜ5Zg>½dÈÊR×…Äì„poLìŠëƒëðo¬V˜qöݶsp º7‰3Íátk„ɰ:–[ÇJsGæX†O¨"óГø?2›x‘0†siû/Gœ…^¸O ƒä±‚ÈÉ$”cf㌿þ2ŠÓ‘Ãäy‡œ“økd²óÎ3+¾c±·Óø#èkÁÞ™=¾T®}÷q àBþríCúF¿†¶ÂÊ3B ™X¾ú{àG‹Ñ«¹ Ìú£’Þ êÝ·§ÅÂV8ØŸ~›'ËŠYí>(ü„Ç\œú tÆw•$“¬\ï±>\ø¼/åËÀïMT©µ¥éå™"ΪVDŒ5>4ó|}k]û™›– }%ôÖŒ£iÜ4];qæö)…¼Ø>¦¨×ÕjSÓuÚTkzC}­µA omý•’ÿ²È?B4R‹kŸ”­†c§E»œûµy¨û{4²Ý=x»Gfßø÷?bÈÏÍâ7¨¶5m†és||çÄ™Ã:Tbç§§òþ|ðd^ofYþÕ”“[ ˜Øå·T9ïKTêÉ"õÀçIRšHB9Q:f6·V ÆB0ÕžéÝðÝáà‘½ûxôRú¹l«¨ºZ±·B_h€àªíUZsò MkN´ñß\z8:ø™\-Ò0fàK¡°FüuaQ·à[X¼LmÖɱB16"?D’\¬òJô­jAO°ÒuP"Õ@hù±³Üþ‚ìM’¼ÇØk¼¡Wê‘x›†û° œ q–ƒz¨°•[èIô€ê„JâûÒØÙ/¾´¦Nº©dÔ£k’éè1 Å }SZrµçt±ÍH¥½ ’´Gš¦¡}8nUURYæÓÒÒ%ú´àbÏäˆë«í5öš.Ц º qͦü¢³":qßÞèØÝ±§}×ô ]ÙaÈäuº‚¬W ­Ð)Õи}]ßÅO̰8ü-¤¾5%r^ÊÙÞìwÞtÖiÜÞ°”¹¹õWºM`˜¼n:€ endstream endobj 137 0 obj <> endobj 237 0 obj <>stream xœcd`ab`dddwö Ž441UH3þaú!ËÜý»ï‡ÿÏ&Önæn–%? }·ünÊÿ]_€™‘ÑÍ'Ú9¿ ²(3=£DAÃYSÁÐÒÒ\Á17µ(391OÁ7±$#57±ÈÉQÎOÎL-©ÔSpÌÉQé(VJ-N-*KMX휟[PZ’Z¤à›Ÿ’Z”ÇÀÀÀ’–ÅŸÎÀÃËPÂÇÀ t(Æý OËø~tüî[ð#mñÌùŒßsÎ1_ÿã¸h÷åî…‹—Ì»hñÅþ =ýýÝ9¦5w׫E8wÊýöfïÖí®.̯­-(ðiçhiéjlœØ=µK~[ǃ²nuŽßQìÝÝ™ûÓ¶åži^ÕÍ1}r÷´©­Ý=ò6Òv4­ï˜ÖÝÛ½Žã»{÷Êî}SëÎz/M™ökm÷¥îå|ÿE3õ+è"îÍÌß&ŠÎìžW^Þ]Q+÷ÏŠ½¶»bþüîy3倎?¼àûûùŒ‡ˆ3ÿðÿÞ'úÍø‘ÒoF3#%…Ç&_¾3>xòEêÃŒ?2À|x[´ûh÷Úð +¼§dws46v7@|p«mCÜ”ô¾†îÎî Žß@ævGô6Îð<]¸©á7Wf·Kw>ÇoönçîÒâ¢ÊÊ’b×ö¶®ööîVކ©ÝSß?Ùw¹Wî;0|^vÏ^º|æÌeËNõsLšÔ3âý„>³Ýï9øJþ´_Èö[`ûf®Ür\,æóy87Ïâáa`•BþÇ endstream endobj 30 0 obj <> endobj 238 0 obj <>stream xœz\SWßÿ ›ëVèUPŸ{ݶj[w'®ë@QTPÙ+HB Ìä„ö$Ì0±nʼn#¨­q¶¶Z[Åj§ÚÚçÄúÿüO øÖç}Þ Ú{ïÉ9ç7¿ßï¹áöv‡Ãá-õðôœ6Õü¿L#8¦‘v¦qÓQœißë• ?ô·oùžÑÑä1æ ‚S\gÅê­K#"ãøA‚Qï.}oÔ´¹s?åæÏÚµ3|”ÇNA ØN¾µ!bW¿ îƒQn¡¡£Ö›?=j½´??Ö·uí¥a‘1þ(ˆÝþüp‚ |ÜÂ7/‰Ø²4Ò{YÔrþŠèŸÄ¸Ç®î\%ò[·Ë#~÷ÿO÷¬ X¸>hC°gÈÆÐMa^³?=gÌܱ®ãæŸ?aÁÄ…ï.zoñ¤­“·MÙþ¾Ï¾î˜*ž&™.‘0sAŒ!>%æc‰µ„+1ŽXGÌ#Æë‰ Äb"áI¼Kl$Þ#6“/b2±™XBL!¶K‰÷ obñ±•XN|H¬ ¦ÓˆOˆé„;1ƒXIÌ$V³ˆÕÄlƒøˆXCÌ!†΄áBp‰á„=1‚p F$ñ/‚G0E°DbÑ—Mô#æý‰Äb!1XD "ƒ 7b±p$¶N„ñáKÐÄPÂÇ O&$žsb8¿ÙM³ÓpûpeÜöÓìË\dÏÉT^_^ïWÊ›ªîc×gCŸûF÷ý«Ÿ¼ß/ýô7 ø×€3Ù9ƒ8ƒ¼³¾p9étìù§Ï–D|Ê ánže\yÜû½ÇIÈ›ÌÿÄ'H$b,뚤Γ…_ÓÐ *ÉRóø( aÇ’> ­Uì24a!œà ­ |ë£(ü¨”²U$ìb Ò8Äâh¼n ¾û‡ušh `ŸÂM¿¡M‚˜7™WtYk€>ÇŒPbÜŠ`‚3M'h8„ü®Ò#Ø/Ä};Ž„#è«•GÏ€vêöšˆË XRjÞC (cë:¥¤Ó«È^îQ’ÐárÇ=ãÖk®¬;*¢‘Œ… ù]ÃïÝkg²xáTüÊÀ¹`„5F®)†â?ø Ù#ûÞECÓOS ´ûégèÈ híæq÷Ù׮ݼuuåÔ<»±=„"<ÁZ¼eYZc±ZÜí¼JPÍŽA‰ÒÓ®pN’Î¥ºÒæ@óãj¼y ßE—Ð*>¯çìg›‰W™Ý”h0å8ðúe®IdºG—š°¸´¤”4F‘ ü`ývífœ[46a8Z‰VAü/ ©ï;žì‰rW°)ï¹Fûjê¬?á$øÞ£?;.ŸßîZÂfÅgŠÕ tZ³]ˆo€àõ®¬Tã Ü‡®PC_ºxöÊ‹KfN^¾rù‚ÀÇ'4ÁþÐÎ#ò&@AÎ/?A'8hú¯£·úÄ…±N¿Ô+JüßÈáNýÊa²Ç›—p?öçÓº ¨Aµ/ˆôˆ NNf—ðD fŸy£ÌYXÈC:ã’$ $¹U‚ ¾"÷ææ7±Oy 2(Ä ™¥HÏë™ý–¹—MîÚG)[Ù)!{®  ‡=†£à,8sœ„\XÄë‚o"i8Çæ?4çÙ“esgZÇÜÝ£ ròõ€Ûwîé(ºÀ`el<£ôXŸ$ÔBp¦†íÕñ9Œ0[èŽ[gM¯¹{ÙXƒ|P ôyóiÊÔtJù¶«7›f, D±|òí-Õ}OsVw£®þÕD«Bt P·É²‹Ã¥¬|@Zòê (€;ÍU2ìmb`ïŸ#òÉÉÆèÛ‡è[˜7€ž2cÑ+÷ØŠ RDôº>ÐkaÞuúx×À©6ErMKpLz9¦ÍX=‰8è.âÀ»ú7Fô8«„<ô¬(H tÀ¥T½”e2 œ›pŽËd¼Ó†nWà ¸Û6ö óröÜ4QòVPÎdçdç€2ªZ¤å b$!«?ßö¼ãþ¹̆§ë ›r œ2S"״ݼež/Äá¾JÆE[FÛJnA§”dzmÂqÙ¡¸+… VbLFÊ.Ĥ )%éO;´Z™–ˆz>® ìeÔ‘-È’.AV~¹¡æ±ª$«’R‘9^-¨OvrQ|9(- «,»’êŽý4ÃsƒãyãŽèãk²k¢+CO*JßÓ;“r²’YÊ»¹ñ!·cÛÆ :Ú¸°þEÃ)ÐÓa¿ÙA‘8÷f˜ýmåq(U8ÀŠJ^i7bN´ÃL,Ösõœì]Èg°…²zÈÒ]ësÌXEvºZ™Iu7xÌyƒ¸ð äÓs‡ƒdI]wîõé¦3u¬Û„E/j»‰ êcÛäAöEï¢Áh–Ã.Û]ØÇš± ”ýê@ƒ"º¹ ~ֳƮ®¢ÔAh€=¼C‚Ù°3 Wþ³Æ:Õ¤Äâ–¥­aœZwÂ,dÄ?HÚb›÷Öb«Hަâ¢\S½­—½³m•ÒÒ)Ýc»2õïY\9¸ý c1ȦšùLû œ#þKe.EA {RãRB]”dZ…\—RñLq®y{™6’p z@éü¹ üpÏ…D T9y ˜ª‰+çGÆÇEíÜ·«õù1è\˜Íô0ÛÛF݉äÐúp*NRS˜ÔÑ67@Í^z㇓zȃ#tŸ9« ¬VªZ§©¿=ø ÅŸ¢‘3PÿÇCGÈîûUÓÕµÇaƒs£ Öà|=br eòðÔp\›I'fÀ"…:©š¤€Ú`µWšØN)/$¶Ë˜݉š¢T¼ÂíW‘gvBž Ø?'E\”RŠAI^^I–ú;¨.:K©:£È·~XÊkÒuåßLÒ¥ò([·á! l¾¦uZUÐtñÇgVþ¸ÝÆka&]C­±Beˆ·òGÓ ²R ´ ”ºh£Qþ¨’×Ý5®[’swrþuŠÒƒLoÈ0©ßÓI§Öú`¿²#g²…>™ôgÛáºz= Cì—ñ6øÌY¸ìÓ›?߸vãjëO[Ž>kƒ±ØßëM·hÙ^IV$ >îfì¹ú³Æ™"T$\Ý™QX¦¬. EYX“º†×3bto Pv1¢‘—á;Îù[°â&×4n u ’«~ECQ¿É1óøb¤¡ó‰'5æ´ŠKÎ¥°1›7Ê#Àb°ø”ø{Ju™.¹}éü €Õ?Õ£^ÚŒ°‡&^¤ááX=ò@±‘è:¬‹„pue<Ì ?”GÏ|ì”ì4x΃vp½ðxñ¥Æ¢à.h–—zmÃ+­`YâÆÄ Q±ÓAOôá\Ó«¿<âBµ™² ìUVO÷¾ LzþîfmU™þò< ž·pûLfÓDyÚ'ôÂßjþN袨« C$îN Ü7\¡Â,T!uûɳgnOE‚^ܹSÚ‹ŸCÚ6Yi’ÚÿIþ|dŦM;VLƱ0w¸ËÐíÂùËpûeÇú‹"3/ùìâº[Üþ¥p½q牳Ž=sîð¶Më}}½Øit–†POoßêh×ÇëY]Quv±JY•R(MUQ}•¨qc¢·2h;+. ¬Ø¨÷—-ž½C\*b‘(–Ç„ %ü|™›ø$R³^­ïÀw^µ×wjs“»³r –“É $gšÅ–¬$±D©™ ;³$»€‚ýÐzââ#GË󛚴lMY>¸ ¨èfù.Þ1Ñ¢”XÝ¿{çÀ<ÄÒ¥P¡îO¬d“‹ãö¥-/oο¯>¾Ç©&HqP2ꄳ3Óód…  ÓØwà::„œ„ú¤sòÓà:8ÚÀW'‹ÏWjŸ‚ /\™¿›µ ¡4F²õ‘³¼T©*‘”ÆQš*#+­«½YJ›cáƒ\Ó"xœ¶–À5oÁéÿr ó8ޱªú-]¢Ç“awãN£·1œŠñèùôèÚ­Þ>릲KIèBÞRa‡¨ï=@}´üÿƃƒI§S÷0WoM•± ì+AXEˆ&L/Þ¨+ÕŸhЉ˜Ÿ‡)ÙdÅžøpüì'¯bdõ´°§¶î?w„þÏWàý=ƒí¦á´UßéU-¨ è•ð'm ?†tzaRØëc*#"bb""*côúÊJ=ÓÝÏ\ƒe×ü¯™'o…u´>õ[!˜IyíX;?Â;»n³³.ý°²\©Q–‡tI)älÑR•ê’¦|æ`˜A|k)êÖ㎫‡eŬßÁÈÜå”Ó ×òEþÍà„ËéÖ“7aßÒ÷CÕLVLaª¶[9[õ\Z|X2ã×¼±È'wñüÙŸwÿ6šÍVþ"(É z»ádfqÄ+“}#¦“=Mí|ŸñÀ?*0Ò?³¿p Ë”db0ʹ”^ ‰Äć/ú‚ã÷ÃþW'“é÷·úÆŠµFèb„ÎÝâÁù-ªwÄ[NG\:¥^½ÎÜþ‡üµ6Ì~¸aÚµ™i_ AžCs/ÉñA/D¢ÙhŠ|e]p¥ tZ;¥Þ½tV/•í}ŸüænZOC-®ék›>”ìQw0Ñ ÚÿCqнz)ú‘åîåµiå™3ðÇ3~Û¨ßH4èчϟ?z ýCy}ñf¬,…;K.º×õƒ^1Ô¼Ãd™×•›$ÖýYè¹yÝñÖeu ™]ˆ.%l-JÙaætÍéyË$“‹só?FîÇÉÖ©)ð/õÀ¥T€ü–žòò48žmƒýÌ?æÓ6Ži<­h‚8@…Ø>ŽÚy±]Íä±Õ“± €…óœZ;8TU¿’ARž¨»ãÜ}cÐ’†i-$§‡ù%ìŽ`$û"ʃA“FÇPGÀF¸ÊÀ)4)¹¦ì‹ÂnÂ<¿W3"}Ñ÷ÉkR¼”Ø©W·Ao¥Z^%r¬è„ +ºmh[šf GY‘rÎË4ª7ýo•zϪÈ[ÚœÀj¬Ý\ò1)+Ðf垃 Ù±²Ëö9‡âTŠ\~-ÈÅÏ«AN³•hÀ–v8ûòk(íð²œ&†?Ð%pôƒ} ,1' ÿ— â¨èramVÓÐpnŽÿ @>ŒÓ+”í—ü9¿>„ý!9£ÙyyÅûù0XF¢W‚Ý­BƒB­TãßlgU¾2W¡¹.í—O}yÿì'n³Ü×/µ45©ÅÀ9j¼€³zörC«ƒP$@v”7k4…õLlïÃ%†KÚòÌLPB™ÍgзdjYœY(»³« +¬íàùCi´–Ÿsá5S;}Ö/[.÷Kß”ƒ>ÌôaT~`w¦Ÿ*ª3éý +/ó`æ9Õ5Õ9Õ™ìóà,ÕYô0Ì4ÀíÇ£FOó1¦ù8äX ;é%ÇÚδüúÞ…­^ë=|—°_‡ÒßÔk¨³ï¡~¨ÿGó]×ßòuãôûâØUkŸôlŸ>þåîÊKn:f>j¢ç¸· ¯üðôÂê5+Ü7Ì1ã-¼¯ƒjl‰ãO~âÂpÓU:ëDP^Öüá‰Y¾ÅÈ×Y%ÉŠÕƒS®ÒPp=Üñ¿°2·¶àà½:`Â=l†i¬¥“ÐàïNÆ  Š-ËÎÉQcQP§â ãÃBÊ—a¶ãŒ[ßè£S×8q'ÌÁé@>žíΜÑ:Æ qÙ´ë¦/î<ºÙvëˆ^ ,ckƒ‹6c.¤P*@HË9å¹qýKœtpÌ 8á£å4›¼¹&;øý%YÔ š›Œu'Ëᇓ¶þd äå´DH€K(HWÊ$h€ó¸·Þ]HÊA``3(b¿ ãÐoÛÏH1Ò’Š+‰×5fÕe2ep Ãïo¹†âºøÝ2Ã8 `¸Ã!¸ áÂ{&{º%¬6ÄŸº§!ªé@Mc#ƒ.ÙÿãþäÝ%ƒ)ç±ãÅ««:¾3<ìXuÕÂZÃzúó„#>`3Øì³mU"µŠi$áù¨ý*%§ÕÙy ŠÒGk„ò€ôís..„T"³ÇŒê  ¦Œ9Àƒ+Nn€ÖˆßÐø: V¸›·7ý”´lsRrš $PLëtÕE-_yÞB} ˜ –‡¾˜ñç!»„U‹€ˆVãÏÍ¥nد/Ø´œ'Ol/ ¬´öýïv¯í´§6ú‹$É©Ò ¦$¥ñšÊŸÏAûÏÚü¢"‚"4­W´Ã1í0£Žmç4·µ·ý‰¹¦¥¯‡ÐÙ™9ýË%atŠH–Æ Ú¿—§')Ò@Š‹¨L\Q[ŽÕ;üîúΞK[¶ìYëæÖ²öÔ©–Kw˜™Ëh™¨îèÑŠº¢¢ŠH__Q¤ŒEM÷è{»Û¶zû¯[¼à³ '[\¼k©?z¨¼¡¸¸<ÌÏW!3[›Îä«å´™¦šßS‰éÂÜâ­y svÉÝ Õ€ªÍÑæ±]`ÿ08¶w>í›?1(ü³ÄTœ(»ðìt}YK=8Cµða•6ÚÛ}CHµD§«Òè‹Ò ÒÔLþDîg€zùYHhTŒL”Ä¢ñóÀt°‹Ú 6¨÷1N %ôÛð¨ËŠý˜²½‚—hûmxjÓíÅmр⧠“%…)9,œƒ8¥h–3÷ ˜*Á-H¨dµ°¦îÀ==ßzvÚð_œ£m?´Áå8WÇ™âèŒL3¹¡æ­œ…P¿®wZ> Ý®(FËÐH4 CŸ á@äG=yx¡^’â3@R⟄%1 p |ïÅËßõÇ’ÖT±«ÐMzÛÎË÷?øØÑu®®>ëw˜ùDgŽí‘\ÆÀDÐE¹Å¹¸ú²Aý. ^šY«úÔc~³78ËÃUî™Q "®Hó ¸â$¢ÂÔbxÎZD¬•¥$¤¡K:?ÈÀÁ·QJwî"Á{÷‚½ùõÊϵŒ!höÆÎ:q&È”¶¸¼T#ËW¨X¾æã½Q%æ¶7Çðz,&Å|œ'Ÿ¾@Û¯;œ"aÿ^Å U'íc {/2<åõX3L`Ü^p.Ä o`N «i8Ædh Kæ@ŒH2Ecx=àÇ ±¤ 6ãÁEVÜx-Ðr.š¦pá;¯?¤Ó ’51€Jâã’³“²RYøðïs’òâ+‹¶TSž—^¡fm]››¯ras-ñØ&–¥'eÄ¥¡¥57½<í »?óÝ% ñ¯çïUçª2s›åRœ[ç_î’î½äË”¿Ç¢)½®Ý­ç½æJ¯¾a­Ó¹Øf›Á7mè‹™Bt­7pîš^вÜTa!ò44ÐÝY’œœâ©”‚êlµ*·ˆù³ýÏ5%òL .ÕM¹y¶,—µq7µÿ‹ð€)Ý™ò÷as­Éçõ :·Lp4ƒOLŠ$!ÓÌ¿W¤ˆ•$»Ä•Æk+sK‹Õæ©MÔs¸Çv•ÁL0]é:aUXJš(˜t¯®Èºõõq6/§Àüº§<¾D=zr\زçÐÞòÚê1Ï9e„ŸáÜ 7ô­‡!;d?Ñò­„5/Ñ0híŸÃáË@”G/X‰ƒù.œ`üíÎíèÝ•¨ï‹xÊüÓ-ß44&{³òÊ<Îl”Z«®Æ©·qfijÊT°DPÓx HÄ’-J R…©ÑaÕʶV 9™)äÊaÀçLøaÁù”“€*¯õ|•œE#³0in¤à,¨É8äÙp¸¦t¯ªÆ*ÐL /±[Òð>®v}ùB”*Ã(î?Û+Q¤+cxm~yZiÅ!õ£L§ëTžíD&ÛVFSÉžèX èõº§^þ^Äë]À¢ÏtÀR#÷‹‹´<95 H)ó[>µæem×)µ(‚AròÒéŸï9x¥íøUð ûO¸‹¢¾óçÎÞ£OÔX{s±<—)=~¢ñ< |µ}Ærïuîžos5n»zpÌ«~kíêì@@Åc±U‘Žå1£Àî ¦vÒ®Ò#‚ !Šm B+x  ñ ‹Çñ5~ÒÞ/eUjp è©'<ìÛÒýeûKOªª­¡kˆV%±Ñ*d—©hëbï™—Í_:ÚñiŒ4î2Ë>¢Ûöë/€sÔ%_ ê¿|ëŠà©ÖlOIjAFÓØxÓüîú©Ÿ0I`d ÅW(Ö§K§œ~72sœüíô'ëÖlX=u×ÂÂQlNN®h{ÞYNÿe–þ{úìæ¶Kî –RÁþœGðwó ê/é2I™815-5… ‹ˆK±–MÎO(J(ê‚@$ˆ â…’ð¬*Å¥â²BuŽ:—iÐ×–•€'/–'hc÷: /«ÒhKë+Ay—ð' ¦>8î´qÀ Zž¸‡ç§420½Žõ>±%‘$îÙ®˜¿ô’’ÄDÑ M™ ¤Ð¼NІ|øÒ½äY]Ûh€³ Žg:6¡Ò¢ïL.t ðMñ‹1‹«Û{TiTÁ‹‚¦ò윂<¦®éP9&cN¯[²rÞ²O?ŠX•w>{1/{±^P+ “ïžóp9´‡C~{¹/þŠú2 M°mÈ'Q\.ÏÐרékÑ¿¡cÿñÿ½Xâ6 endstream endobj 23 0 obj <> endobj 239 0 obj <>stream xœ­V{P×Þ5’]¡Š{µ½u7Ó Š¯j­Zl‹PTåÚB±ˆ•‡ `È#$ù%ˆ¼‚ $° U…ÖŠ·z¯Öޭ޽ÚÑÚw­Ö³™ÃLïFlëÌmû×Ìd’™³{Î÷ý¾Ç!‰ñã’$]CB}?¼…¿“³ã„À[%Žp“€ÛøÎgÝfMAªÉh•š÷!!ÉÕÁ›•©ÙéI ‰*Ùì@Ù"_ße²€òô¤¸ØYH¬*Q¾#V%þQÈ”qIrUöY€B! u>±S*ß)Oß%ßæÜ9P¹#5C%O—…(·ÉÓS‚˜¢ L]•¾:Hµ&6nÛ?ä ‰¡IaŠyñ±xƒ˜I¼IxaÄ,b6Nø¯+‰UÄ Äjb ±–XL/!Ä$bº éAfwÇ%»!ñ—t_9^ï2Ç¥G:UZEyR»èUô?'”MøÒµÆõ“‰ž¿«÷_$ãÀ£Í¼ÔH óëMv䀮¸8'Þ™ž¿]•è§§Ô»¥Vè†NhÒéhž 5ìæ¡*eƲ>ÄLGÕÒÓxî¾½-hžÞi¬‚ê-=Ç¡JᆖæwS! ®Ük£±]¨g+¾æ‚ÕR÷_Æ-Çâ!„¿YH4þ Š¿"¶£ n@›²Se“×l‚³:WIë¿•b/µ‹‚ºXYÉáFj‹ÖŠÛô ýÐ5úAçÉÖªá8‡‚©Ÿ?95òAMäçüÉÊH=O‹G oj›0ÇB¶ÝD]7%BJbдçïcìé-ÃSñäû³‘òüñGäÁâLÁl‚X‹ê½´ý ±†-GÚOž¨ë‚a8’ܘÔkˆ€Xˆ‡7Ó£•[¶dÆ‚s—;«‰ Þ1Ÿ'‡ï «Äáïx…©‡Êü"­¶ ˜ðOæC‡¼ái¼¿Œ—à(¼-Ç/¢·ÐòŸÐ 4áTææAQž+Äó°[ÀL —ⵃèê@Áƒ7¾à—¶pÆ<ƒ¦h”™¹1nñFͳ3mäÃ+¨é¦UáeÌI¾Tkš}ûG@£‰hÜ7hšâóv ß”±UÎPx¶“ìKåÅ1ÜhâRè'Xûûg{€þôì"q+iÐâåQòÖÎ\^#¡Á‰º?Æ©±³<:d'‘ì6жI‹P£”¦ãÒñ  ±LúŽ®ÂΡ†»ÔwÕŠ%œ TJ—ä+|بPj7Vô±è)Z¶p–Ñ6©e¸Œ^V4K¯ÕñÜh¯Sû±*…ð©»à-ÊÉ¥‡|xéá´e3GªÐ,$eõ”NŸ“;éTóîfss]{ÇŽö¨ ±±!*V_ŠŸûm k 'á0´èGDÅdR¯k«º¼6\v‚êãÑñ1P‘6‰ðãUfôýÿ=“´·ôœ(’Ãp:E$S Kª»9¤»M}[•¼t ëRuòv*{ŒuŠÍK˜ ³"VѧÞÙ¢rP/Ì|$ž Û¢xP$sx_Ù–§‚µjØÛ` $–ÒŠêni~<·žÂîxäùâ7P÷“aŸÔÊ£þJ‚1h~ E|u¹kÀÆÕ§v%º *M"ä¾n§i$A“QcÉá÷úëË?PÚój¹Ã]}P m¡²iuEVs­é€¹!—K‰R'$²©MÛjÅZ™ôjD{‚i§Ó)E$™¬Ù9qñð½òûP4y<¼z$ëX| Öù&̃LH†BcJy–Uœ†©¬®²†¾W¼ß5Yöú®®ÑZgú6ÌQ©`Î"î8öc:‡~y¨_Ô|Ÿ€¾3¦Ýäž(n§`þ¬»×@d¢"ŒÖ£o¤c}òHL£¦ÿcy?ñIÌ“t’Ÿ‚ž»…î}gæ™'D¢/™¯­Ÿ~ŸÒßãI×ñ,ÿÞ¿ÇC_é p¾Yü~"J)Ï>ä&½ ò}%íñ°VŠh¢ûå}ñg¡ èÏënµ”CµØÉ…zN³^±S!«n,¬/h*¸XÜ[x®à–tÒ˜¬c0H¡ÕXÙ°¯ÒØf o"OÀ>K¢×ãgY:#—xTZÈ $r­·AeÚw¶ìP¨ÒSRšÓùö––vÏÂ!¢!ÏW‹†4ÿÊL¯Ñl8&ÑNâù©à’²÷8ABMH¼q,´‘ÃçÑõóâ½ÆáË4Âþü"½>¿ˆÍË>P³ýíÝoŸ˜/úk²…^¯õm.Óp½Ñ5h¢òzV¥îP’Ao‡7è Hÿ…~XÌßBV_åy@çBa&‡Ã©L(¬®0ª+Øšƒ{ó:·á³½âÂýú‡wÛÙÎÅœ‰ª ®[lžþJcÚy8F_8}þsÄœšë]Ë–f4Õ@×B…ù7dÏëÁÌŸªæ8ôA½~à7ÕŒ=ÃÍÈßÉa°E‚‚M lß%(=­)/ª¨º~¹þ+­{[bVjjjCj§¥®ÎÀºg49V4ak=J©’â­Õïze"ë:~Y£ÛK¹›Û“Û$‚ø/ØyßQ endstream endobj 245 0 obj <>stream 2014-05-12T15:50:46-04:00 2014-05-12T15:50:46-04:00 dvips\(k\) 5.96.1 Copyright 2007 Radical Eye Software quick.dvi endstream endobj 2 0 obj <>endobj xref 0 246 0000000000 65535 f 0000180856 00000 n 0000227596 00000 n 0000180491 00000 n 0000173605 00000 n 0000000015 00000 n 0000002628 00000 n 0000180922 00000 n 0000186676 00000 n 0000211291 00000 n 0000186344 00000 n 0000209096 00000 n 0000186106 00000 n 0000208453 00000 n 0000185712 00000 n 0000203699 00000 n 0000185322 00000 n 0000198600 00000 n 0000184608 00000 n 0000189046 00000 n 0000184370 00000 n 0000188389 00000 n 0000188047 00000 n 0000223225 00000 n 0000180963 00000 n 0000180993 00000 n 0000173773 00000 n 0000002648 00000 n 0000008681 00000 n 0000187421 00000 n 0000214535 00000 n 0000181100 00000 n 0000181130 00000 n 0000173935 00000 n 0000008702 00000 n 0000013140 00000 n 0000181184 00000 n 0000181214 00000 n 0000174097 00000 n 0000013161 00000 n 0000016940 00000 n 0000181268 00000 n 0000181298 00000 n 0000174267 00000 n 0000016961 00000 n 0000022617 00000 n 0000181352 00000 n 0000181382 00000 n 0000174437 00000 n 0000022638 00000 n 0000027776 00000 n 0000181425 00000 n 0000181455 00000 n 0000174607 00000 n 0000027797 00000 n 0000033764 00000 n 0000181509 00000 n 0000181539 00000 n 0000174777 00000 n 0000033785 00000 n 0000036472 00000 n 0000181593 00000 n 0000181623 00000 n 0000174947 00000 n 0000036493 00000 n 0000040739 00000 n 0000181666 00000 n 0000181696 00000 n 0000175117 00000 n 0000040760 00000 n 0000045270 00000 n 0000181750 00000 n 0000181780 00000 n 0000175279 00000 n 0000045291 00000 n 0000047062 00000 n 0000181823 00000 n 0000181853 00000 n 0000175449 00000 n 0000047083 00000 n 0000051309 00000 n 0000181896 00000 n 0000181926 00000 n 0000175619 00000 n 0000051330 00000 n 0000055839 00000 n 0000181980 00000 n 0000182010 00000 n 0000175789 00000 n 0000055860 00000 n 0000062023 00000 n 0000182053 00000 n 0000182083 00000 n 0000175959 00000 n 0000062044 00000 n 0000066472 00000 n 0000182126 00000 n 0000182156 00000 n 0000176129 00000 n 0000066493 00000 n 0000071758 00000 n 0000182199 00000 n 0000182230 00000 n 0000176293 00000 n 0000071780 00000 n 0000077609 00000 n 0000182274 00000 n 0000182305 00000 n 0000176467 00000 n 0000077631 00000 n 0000079621 00000 n 0000182349 00000 n 0000182380 00000 n 0000176633 00000 n 0000079643 00000 n 0000084887 00000 n 0000182424 00000 n 0000182455 00000 n 0000176807 00000 n 0000084909 00000 n 0000089619 00000 n 0000182510 00000 n 0000182541 00000 n 0000176973 00000 n 0000089641 00000 n 0000091242 00000 n 0000182585 00000 n 0000182616 00000 n 0000177139 00000 n 0000091264 00000 n 0000096380 00000 n 0000182660 00000 n 0000182691 00000 n 0000177313 00000 n 0000096402 00000 n 0000102104 00000 n 0000186961 00000 n 0000213641 00000 n 0000182746 00000 n 0000182777 00000 n 0000177487 00000 n 0000102126 00000 n 0000107422 00000 n 0000182845 00000 n 0000182876 00000 n 0000177661 00000 n 0000107444 00000 n 0000110771 00000 n 0000182944 00000 n 0000182975 00000 n 0000177827 00000 n 0000110793 00000 n 0000116094 00000 n 0000183019 00000 n 0000183050 00000 n 0000177993 00000 n 0000116116 00000 n 0000120556 00000 n 0000183116 00000 n 0000183147 00000 n 0000178159 00000 n 0000120578 00000 n 0000125256 00000 n 0000183191 00000 n 0000183222 00000 n 0000178325 00000 n 0000125278 00000 n 0000130914 00000 n 0000183301 00000 n 0000183332 00000 n 0000178491 00000 n 0000130936 00000 n 0000135344 00000 n 0000183400 00000 n 0000183431 00000 n 0000178665 00000 n 0000135366 00000 n 0000139669 00000 n 0000183475 00000 n 0000183506 00000 n 0000178831 00000 n 0000139691 00000 n 0000145193 00000 n 0000183563 00000 n 0000183594 00000 n 0000178997 00000 n 0000145215 00000 n 0000151367 00000 n 0000183649 00000 n 0000183680 00000 n 0000179163 00000 n 0000151389 00000 n 0000155942 00000 n 0000183724 00000 n 0000183755 00000 n 0000179329 00000 n 0000155964 00000 n 0000156805 00000 n 0000183810 00000 n 0000183841 00000 n 0000179495 00000 n 0000156826 00000 n 0000162032 00000 n 0000183885 00000 n 0000183916 00000 n 0000179661 00000 n 0000162054 00000 n 0000163285 00000 n 0000183984 00000 n 0000184015 00000 n 0000179827 00000 n 0000163307 00000 n 0000166588 00000 n 0000184059 00000 n 0000184090 00000 n 0000179993 00000 n 0000166610 00000 n 0000169141 00000 n 0000184145 00000 n 0000184176 00000 n 0000180159 00000 n 0000169163 00000 n 0000171668 00000 n 0000184220 00000 n 0000184251 00000 n 0000180325 00000 n 0000171690 00000 n 0000173583 00000 n 0000184295 00000 n 0000184326 00000 n 0000188591 00000 n 0000189648 00000 n 0000198936 00000 n 0000204046 00000 n 0000208655 00000 n 0000209361 00000 n 0000211552 00000 n 0000213870 00000 n 0000215218 00000 n 0000223498 00000 n 0000184514 00000 n 0000185156 00000 n 0000186250 00000 n 0000187299 00000 n 0000187941 00000 n 0000226163 00000 n trailer << /Size 246 /Root 1 0 R /Info 2 0 R /ID [<87F918090A2088B2D86167079CAFF9CC><87F918090A2088B2D86167079CAFF9CC>] >> startxref 227801 %%EOF cfitsio-3.47/docs/quick.ps0000644000225700000360000114204513464573431015026 0ustar cagordonlhea%!PS-Adobe-2.0 %%Creator: dvips(k) 5.96.1 Copyright 2007 Radical Eye Software %%Title: quick.dvi %%CreationDate: Mon May 12 15:50:42 2014 %%Pages: 41 %%PageOrder: Ascend %%BoundingBox: 0 0 612 792 %%DocumentFonts: CMR17 CMR12 CMSY8 CMBX12 CMBX10 CMR10 CMSY6 CMR9 CMTT10 %%+ CMSY10 %%DocumentPaperSizes: Letter %%EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSCommandLine: dvips -o quick.ps quick.dvi %DVIPSParameters: dpi=600 %DVIPSSource: TeX output 2014.05.12:1550 %%BeginProcSet: tex.pro 0 0 %! /TeXDict 300 dict def TeXDict begin/N{def}def/B{bind def}N/S{exch}N/X{S N}B/A{dup}B/TR{translate}N/isls false N/vsize 11 72 mul N/hsize 8.5 72 mul N/landplus90{false}def/@rigin{isls{[0 landplus90{1 -1}{-1 1}ifelse 0 0 0]concat}if 72 Resolution div 72 VResolution div neg scale isls{ landplus90{VResolution 72 div vsize mul 0 exch}{Resolution -72 div hsize mul 0}ifelse TR}if Resolution VResolution vsize -72 div 1 add mul TR[ matrix currentmatrix{A A round sub abs 0.00001 lt{round}if}forall round exch round exch]setmatrix}N/@landscape{/isls true N}B/@manualfeed{ statusdict/manualfeed true put}B/@copies{/#copies X}B/FMat[1 0 0 -1 0 0] N/FBB[0 0 0 0]N/nn 0 N/IEn 0 N/ctr 0 N/df-tail{/nn 8 dict N nn begin /FontType 3 N/FontMatrix fntrx N/FontBBox FBB N string/base X array /BitMaps X/BuildChar{CharBuilder}N/Encoding IEn N end A{/foo setfont}2 array copy cvx N load 0 nn put/ctr 0 N[}B/sf 0 N/df{/sf 1 N/fntrx FMat N df-tail}B/dfs{div/sf X/fntrx[sf 0 0 sf neg 0 0]N df-tail}B/E{pop nn A definefont setfont}B/Cw{Cd A length 5 sub get}B/Ch{Cd A length 4 sub get }B/Cx{128 Cd A length 3 sub get sub}B/Cy{Cd A length 2 sub get 127 sub} B/Cdx{Cd A length 1 sub get}B/Ci{Cd A type/stringtype ne{ctr get/ctr ctr 1 add N}if}B/CharBuilder{save 3 1 roll S A/base get 2 index get S /BitMaps get S get/Cd X pop/ctr 0 N Cdx 0 Cx Cy Ch sub Cx Cw add Cy setcachedevice Cw Ch true[1 0 0 -1 -.1 Cx sub Cy .1 sub]{Ci}imagemask restore}B/D{/cc X A type/stringtype ne{]}if nn/base get cc ctr put nn /BitMaps get S ctr S sf 1 ne{A A length 1 sub A 2 index S get sf div put }if put/ctr ctr 1 add N}B/I{cc 1 add D}B/bop{userdict/bop-hook known{ bop-hook}if/SI save N @rigin 0 0 moveto/V matrix currentmatrix A 1 get A mul exch 0 get A mul add .99 lt{/QV}{/RV}ifelse load def pop pop}N/eop{ SI restore userdict/eop-hook known{eop-hook}if showpage}N/@start{ userdict/start-hook known{start-hook}if pop/VResolution X/Resolution X 1000 div/DVImag X/IEn 256 array N 2 string 0 1 255{IEn S A 360 add 36 4 index cvrs cvn put}for pop 65781.76 div/vsize X 65781.76 div/hsize X}N /p{show}N/RMat[1 0 0 -1 0 0]N/BDot 260 string N/Rx 0 N/Ry 0 N/V{}B/RV/v{ /Ry X/Rx X V}B statusdict begin/product where{pop false[(Display)(NeXT) (LaserWriter 16/600)]{A length product length le{A length product exch 0 exch getinterval eq{pop true exit}if}{pop}ifelse}forall}{false}ifelse end{{gsave TR -.1 .1 TR 1 1 scale Rx Ry false RMat{BDot}imagemask grestore}}{{gsave TR -.1 .1 TR Rx Ry scale 1 1 false RMat{BDot} imagemask grestore}}ifelse B/QV{gsave newpath transform round exch round exch itransform moveto Rx 0 rlineto 0 Ry neg rlineto Rx neg 0 rlineto fill grestore}B/a{moveto}B/delta 0 N/tail{A/delta X 0 rmoveto}B/M{S p delta add tail}B/b{S p tail}B/c{-4 M}B/d{-3 M}B/e{-2 M}B/f{-1 M}B/g{0 M} B/h{1 M}B/i{2 M}B/j{3 M}B/k{4 M}B/w{0 rmoveto}B/l{p -4 w}B/m{p -3 w}B/n{ p -2 w}B/o{p -1 w}B/q{p 1 w}B/r{p 2 w}B/s{p 3 w}B/t{p 4 w}B/x{0 S rmoveto}B/y{3 2 roll p a}B/bos{/SS save N}B/eos{SS restore}B end %%EndProcSet %%BeginProcSet: texps.pro 0 0 %! TeXDict begin/rf{findfont dup length 1 add dict begin{1 index/FID ne 2 index/UniqueID ne and{def}{pop pop}ifelse}forall[1 index 0 6 -1 roll exec 0 exch 5 -1 roll VResolution Resolution div mul neg 0 0]FontType 0 ne{/Metrics exch def dict begin Encoding{exch dup type/integertype ne{ pop pop 1 sub dup 0 le{pop}{[}ifelse}{FontMatrix 0 get div Metrics 0 get div def}ifelse}forall Metrics/Metrics currentdict end def}{{1 index type /nametype eq{exit}if exch pop}loop}ifelse[2 index currentdict end definefont 3 -1 roll makefont/setfont cvx]cvx def}def/ObliqueSlant{dup sin S cos div neg}B/SlantFont{4 index mul add}def/ExtendFont{3 -1 roll mul exch}def/ReEncodeFont{CharStrings rcheck{/Encoding false def dup[ exch{dup CharStrings exch known not{pop/.notdef/Encoding true def}if} forall Encoding{]exch pop}{cleartomark}ifelse}if/Encoding exch def}def end %%EndProcSet %%BeginFont: CMSY10 %!PS-AdobeFont-1.1: CMSY10 1.0 %%CreationDate: 1991 Aug 15 07:20:57 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.0) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMSY10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle -14.035 def /isFixedPitch false def end readonly def /FontName /CMSY10 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 15 /bullet put dup 102 /braceleft put dup 103 /braceright put dup 106 /bar put readonly def /FontBBox{-29 -960 1116 775}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052F09F9C8ADE9D907C058B87E9B6964 7D53359E51216774A4EAA1E2B58EC3176BD1184A633B951372B4198D4E8C5EF4 A213ACB58AA0A658908035BF2ED8531779838A960DFE2B27EA49C37156989C85 E21B3ABF72E39A89232CD9F4237FC80C9E64E8425AA3BEF7DED60B122A52922A 221A37D9A807DD01161779DDE7D31FF2B87F97C73D63EECDDA4C49501773468A 27D1663E0B62F461F6E40A5D6676D1D12B51E641C1D4E8E2771864FC104F8CBF 5B78EC1D88228725F1C453A678F58A7E1B7BD7CA700717D288EB8DA1F57C4F09 0ABF1D42C5DDD0C384C7E22F8F8047BE1D4C1CC8E33368FB1AC82B4E96146730 DE3302B2E6B819CB6AE455B1AF3187FFE8071AA57EF8A6616B9CB7941D44EC7A 71A7BB3DF755178D7D2E4BB69859EFA4BBC30BD6BB1531133FD4D9438FF99F09 4ECC068A324D75B5F696B8688EEB2F17E5ED34CCD6D047A4E3806D000C199D7C 515DB70A8D4F6146FE068DC1E5DE8BC57030ACE57A0A31C99BEDB251A0ECAD78 253AB321023D15FF7F55A3CE81514C1E7E76240C1FB36CD4874DDB761CC325F5 D588700B294849D690F93526EF438A42B9B5B0508584EA3766D35F5B8D51C458 ECB9FBD23A49576EAB06BACB7EA6D300985500835F4FE597D4A1110C8EABE6FC CE3E1F95CFD3A42446F25355381D476B2FFB6EF247BF58A6FFC5EC0E4CC207BE 46485F8E07350B37DCA8C1864E62614332A1D3C9DEDDD6492181949A2C3498C9 EC2A81C1F4FF989A4654E375F509D24D969B97D2A9940FAF43BBB286E08559C0 F8D9674B0A294B36D3A050F7DED8C80E1D230812F6B8387B17948FD29FF050E2 AAC5EBE5D96AFD0879534E2F4BB81613A1571750F9CF4215199F93813D815B5D 1C79E11A0FCBB627CDE569F88C741CD502627777BB058ECAC09B6ACCFACA69B9 8F8168B0B5A1A6EB13E884B348FBB2ACF9EB180F6E27D57F8503710CE037A34A F8B157201657C825E2A4B4A7696B58B7A988C05E43E66F0FF277A7694C555C54 AFB1D32F6DE102136FC810E1F3B5CEA42476EAC7AAFB390E3252B2169DCDEE6E 328507BD0E24734A85AAA263E0D2F64BE1607455BC855785BC27F8B30FE917B4 23AB3C812975355942E955501AF85A3C0CE836911AF679EA44AD6A7D042A6549 0C471FE294E8490024D93ADCADED460FAB7FBCDC29EFEBD2A9A127E11869E659 961B29206CE63944B6FA4B9315BCC528EB1E0223CE94C795A5D5231A7FC8545D 6B287B965F8EEDDB67A6774129DD01D5A21694ABE320BB2553043D4C42ACFF91 1009372CB03381035BEEEEFD05631E026A0980A72A67B3703323A4E7C94FFCEE 8D0B7407F9CCC043D3D184BEA4728385D6AB2FB0641DD8F5BA7E04035D30D628 7E97D31C1486DFD5B1D076B84B4ABA4829ED4310321F1F24B847C44E00185A69 37711A 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMBX12 %!PS-AdobeFont-1.1: CMBX12 1.0 %%CreationDate: 1991 Aug 20 16:34:54 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.0) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMBX12) readonly def /FamilyName (Computer Modern) readonly def /Weight (Bold) readonly def /ItalicAngle 0 def /isFixedPitch false def end readonly def /FontName /CMBX12 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 45 /hyphen put dup 46 /period put dup 47 /slash put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 72 /H put dup 73 /I put dup 75 /K put dup 78 /N put dup 79 /O put dup 80 /P put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 97 /a put dup 98 /b put dup 99 /c put dup 100 /d put dup 101 /e put dup 103 /g put dup 105 /i put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 118 /v put dup 119 /w put dup 120 /x put dup 121 /y put readonly def /FontBBox{-53 -251 1139 750}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891 016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171 9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758 469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8 2BDBF16FBC7512FAA308A093FE5F0364CD5660F74BEE96790DE35AFA90CCF712 B1805DA88AE375A04D99598EADFC625BDC1F9C315B6CF28C9BD427F32C745C99 AEBE70DAAED49EA45AF94F081934AA47894A370D698ABABDA4215500B190AF26 7FCFB7DDA2BC68605A4EF61ECCA3D61C684B47FFB5887A3BEDE0B4D30E8EBABF 20980C23312618EB0EAF289B2924FF4A334B85D98FD68545FDADB47F991E7390 B10EE86A46A5AF8866C010225024D5E5862D49DEB5D8ECCB95D94283C50A363D 68A49071445610F03CE3600945118A6BC0B3AA4593104E727261C68C4A47F809 D77E4CF27B3681F6B6F3AC498E45361BF9E01FAF5527F5E3CC790D3084674B3E 26296F3E03321B5C555D2458578A89E72D3166A3C5D740B3ABB127CF420C316D F957873DA04CF0DB25A73574A4DE2E4F2D5D4E8E0B430654CF7F341A1BDB3E26 77C194764EAD58C585F49EF10843FE020F9FDFD9008D660DE50B9BD7A2A87299 BC319E66D781101BB956E30643A19B93C8967E1AE4719F300BFE5866F0D6DA5E C55E171A24D3B707EFA325D47F473764E99BC8B1108D815CF2ACADFA6C4663E8 30855D673CE98AB78F5F829F7FA226AB57F07B3E7D4E7CE30ED3B7EB0D3035C5 148DA8D9FA34483414FDA8E3DC9E6C479E3EEE9A11A0547FC9085FA4631AD19C E936E0598E3197207FA7BB6E55CFD5EF72AEC12D9A9675241C7A71316B2E148D E2A1732B3627109EA446CB320EBBE2E78281CDF0890E2E72B6711335857F1E23 337C75E729701E93D5BEC0630CDC7F4E957233EC09F917E5CA703C7E93841598 0E73843FC6619DE017C8473A6D1B2BE5142DEBA285B98FA1CC5E64D2ADB981E6 472971848451A245DDF6AA3B8225E9AC8E4630B0FF32D679EC27ACAD85C6394E A6F71023B660EE883D8B676837E9EBA4E42BA8F365433A900F1DC3A9F0E88A26 326BC603CD28B9A6E511975D39BF5957AC2D66D48E75D233CC1B78B0BDE71C21 DF00ADE87769BAF3FF3896F1FE5A8786C78F798741CB0F38300E98711F994F13 37994AF499D5BEF056FCC6F2BEBE3923EE7AC09AC246F5C63106DB4C92DB5DA2 47D1016490CE3A3D571211DA35CA7A7E6FA4CE92074E44590F0E4B4C90834406 EE27172A83A5F1C53F8E474448B21598395590F38D23697E65441DC75FB7294B B560D82E1DDE2EC994ECDCB7F362E60E108B09EEBB71078B84C9070FEAD4F1C4 2332D28EF482E89F064A5F32D95FA80AA2D84CAA27F7B61D457B0DBC7102D70B 3D6274006BA0C4D4731E03CD99E792A76E888922B1DBBB7AFAB73EB3B8306423 25C6856218DA59FA5EB6EFE9FED08048D04842E4D18C13D6DF5F3D92CD3B0706 ABC2024946EA8DDE0ADFFBDD693C08FED862012C73CF7491E1677ADBBDEB1C78 C4791859D9FCF9B153A2A5C3B4B3436254BAF92984DE37309E384D8827978CE7 2B9EF2E4034DDB15418C9C765FECE6FE63BE00659B226092C926F8D652E510C5 B2632A691B7FF8C1ED57C720423CA5BF6F27DAF0C0B90A1C7A568E1C3C21FB0E EB2336F01B06D047EB9E17BFEC91E7994A40165D4DBD085E47C310C0DC0D69C1 FEF02C68B548FD04A31571B0A0ECDF246FB628C9C470B615DC5946D081938DBA 62C43AB08053AE7E3886C50426C64DFA698D9016F6E4421433B2F057FFC237F1 1260F9CA7240208CF50B00AFDA29ABB70231B0886D657F143AF25529AD866823 64D025895B10D19A63C9F07D2730661490DA4E3C3871F38268F5134DD8B67F9A 24A34E18C062E606B06D6287FA2E0336960A11F6B181752772323659BDB9ED0E 96453ED61C7A3CEE10778226B944B46459F36029D48D7A83799979F2162BAF61 83178AB7DEDD28DB42F4CCB6C5F065F4D6F0F97C75D48C2CD500BCC746F45F97 00BB3B543D368B5604B994005587E8158B43CFEB22A43515EF9EDBE9AAC13EB1 6119EB67621D3BD51DDED406D7C7219953BD21F3E8312182CE62BB9F6AEF9199 B64CDBA4C22760D9BE412AFC6E179EBB295A627871A82E88D92FAE94C00BE7EA 581712D8D85FFDA4C8A4EA7421DB198356DCD58F5F2C7058D87959B16199672B 897D985FCBBBCF691A97F9631DD8F5F51134144D3F0BFF482F24C397F3CA59C6 FE739D2D3139574B068E0E7C96B7E1159B79BC024BDE17B54AE59BBD2B0E37A0 F5442F6375D4ADC1D795202B1DA5EE38D0EBE98EE62866718830446C29CB1DCE E31C449C0EC11E936D9F2BC2E38964803852C6550C6E591D3111763BD79B7D14 BECB90421A01B6E242B3D08F90C63815689A90CB904C07BA1D224F790950997A 0AEAE5AC6AE2F213C8E7A418B3F6EADD3BC67596654692F4A61895DAF6D4FA61 459E7E24F2A0E027A5501632188B9348EE4E0D9FCE65FEA80F4281697053210E 73664CDD8A7E2825A308EC570CF22034A51026E13BB004B9F563E3E3F45ACD4A BD3A60D29C82869474E8B523461BA062D2D6A9C98B99B081EEF2DC2739A2860E 769323E29266E24452B9C96FA2B5B6D14FFC5CB45CE9BED68D5DFB5FE278B85C 0E2E0B454A3E657608170E1E0830FA07D09B454F2B1A7792F4BB96E6FE43ED14 4977BBBF88C912DCDFD3D4DEB06B6D1EEA1BB019D19BDC57840A4A3F92AA29D4 AC8A0840A73BB3F118F668D9D4E4C136DFA73CEF0344C2E32C02CEB865FDBEBF 3DBD44B9B6F63EF01C2691F9C7F43309C9EE45DBB423E50505CC6A7165B47ED5 A0311E24203E4CE075F50B36DD2A7DDC85077BC599CC3E00A29C483F1DEB4218 32262EE6B07E54EBA32BE65240B3A47E2B5606674FBC33EB8372B7D39CB2D8FF 6495F31BB367301FC5BAEBE1ED5B854571D4544595D18628C0C789B4AA86CAA7 42C26E3C9CFFF98D224E05E94F5DD426203199FC1DD7B9347B044ED1116D7378 496D80454518EF2A7DC3D2BFBF77EA8227C91E2A8C41B3118E7BCA38B5E8C38A 52587793FA7D5A7B2DBBD8AEB61ADF5F75115DBE4741EEBC0EDE1D74975DF021 49C5E3C4000FA4E4D9E8E6644F21572AB30F6E8CD1886B020198DB7F94F8C722 EC0123D49783351D36BF1AFBB12717E3DFC23063B77388C409A4157C89D552F7 E5B3A2F825A1C8A8524936C2C7872A87C158AAF6AC142D529F0A66CD5495DFA1 BACE93058E8B9D6FD1C62AD19DABEFC18BD047256DFD19B29D88C63ADE376DB2 DC51939606E3EBA52798D23831BBC8E5DC8E6A0DD40D1F434B70CD292EA5E1FE DE034CBC40C250758A3E5300B99CC4342167A4D44784471216C8028E7DC9BA9F E6F540EAE0E87FEFC5BCB5E19650C68FD642F82F3292710AC357F6FCEA4EFD88 6F1049CAE4CCEFFAF6CCC82DDD484D4F7C8F8A825436A6CE713B0A697832BF9B 9BC9BB3A674C608E2913CB52C9471B4F3027124EDB6AAA9A975424A0DB8D63C1 2FEFE0B08D3493A79D685006BEF07C8DD1F2F635309F463025666F2EBCDECC42 B9FFC43D93AD2D4B7F2C0AD302336E8FD7E670E4378BF2052D9B70D25E9D2301 C97C2B9AE8FA1009F7DE7D5AD311F4672CA62775AE5D045E010A031EAC6B266E 7EA68D21B569770452D665DE101075E10E6CEEAF15A6961872A797F9A2E702D7 8FCC9CC526B9764E264FF987591E96482527CE200A0B2D7603BD25547AD258C9 6D8459BAB17C74DDA7101CD13EB38C8DF5A2C9BF87A8D22545B6E8EE6C5D5BB8 F958F433DC59B75F5318882634A85A9FDD941BCD026B75FCC64F068090BC5972 F25E08155D46288E4AD897D72BD07234E04CABEFF5ED56D036786CC07016D92E A638B3BBC6CF15BB6001943D18AB42292A2A8B72FAE9157D2427D375673520D1 850AD7C2A24748951566C61D6B2CFC1818ED0A67F44D07CF80DB914D283E19B7 0A1E167D19FB0BBDDBF65C79BD171B17545CA156096032A60EE45160F77C88A6 9DABD8E12857C244BA0B43394CF491D17C07813B9174EF9D89C9748EABB0F938 157758BAE4E2A4A69C9E460B9E4AD99F23048D258B0D321108EE9B96F843F864 DBD079685328F02EEA46F946A7EF927A1D49DE6DD5D9766420E74C7930895AAD C95C60AC4A1D2FCA0F85072FAE3675EB4DBEC07255C1C0891F87C3DFAF219EF5 1A64166BFA2E77D1ABCCF87DFB1A3BE7F83FCA5FD0F73586D6B0E66B6415EF63 2A7B085D9D61DEEE88BF1A180968C784B175B3D9856A3F9479FDFA071343E654 202EF4CB01815987E628973BC140EEF476CA4CF3E4FB62E657D10E3EBB76CCC6 EB03E73DB444C674EC7737301D62AE46F26A22E049B7AE657194AF8EE17E47BB 2E16CA163719EF4AB0BA827185E862BDEB8E22845FEB1ACE2960E94256D7FBCF 05F2EA5541B861BE2B0D97576E2440555C388B2B3A906DED36206ED6578D1563 8BCD8FFDAE85CF16918B2747CFB5D61DBE55F0E5154910E00CAA6DDF27F8016C 25311A7379F820566CE9D9B27FAA27AA37901EE2A4E72CB77F74879E00140927 89A71148CB996F35E4D2DA6DE9E4B419F1D2387279135677502E169048171730 59ABF7B6EC751302663320C108861037834E28E4457410A2E7BCD9EBA553E4C9 A1927FB48707FF104678AF51681ABB7B728478BBE37726E26A3C545F267FFE88 8E4F2A0EFE2902510D6739A4B201BB1EC21E8CC1E693C7D14819CBD3512A8BEA 3A936897E9EBA3FCDCF0F13A9525F80B182EF1423C5E5A3C82850BE2F7520CE3 0834D1E448235C68F246CBE9420E853F5F22F1404C7A3DE38B8C3D288F7FE595 2D09071B6D22988D80D46D3666E2AEB88872B37B5D5B535D07F61DCF0A29A059 F4E533BC39A06FDB2B45ADDB0190BBB9CA8100EAC30FCC212BE0A475CA57248F E2DF1BAA0729A4A97A479DDBC64573E00DD22FBEABF86F15C60227BC2D074B32 E6F73778F13FA9959FB62F1EA5B2B687F870A7BCA4670C038200D4674E168F9F 684FD2D8C626EDF0465CA01B27978D141722C3FEBF42D86FEF470541590CC184 B487E5816400FD06FFB8C30FED82BACA4671315A7610496DFEB5867A6883DB99 BF42E232663A17F27BDB01C4E2072A7725C02E631B3F85518A00B6E4BFAAD763 8C9E89D64B35F754DAAF4549D4E528941403FF224ACF62E172126CFFCCC4FB6B 68FF632DC25971C19AD4AE284075A7A2DBCC894B5515B5CB914185F388AB124E A1E8BA75BFA9B601724A84A8BBC0CA23716CD9F5B37D0F1DADABF475F23EC122 162BF687970F2E9720B4CF355C5829E395F526FE538CC265C43C916AC1323BDB 543E0DFD699AF2D3AF09BA03B9B7F458FC9073DD02378AA9B70D90A6CCBB2D40 DBF2F4E111C65F8F561BD2004E0DC6BB4DA203D79D11848DB7E224CAF034FACB AF3446FF041FD26C403F31A00DAFDB13BE1CE58B9CE9CE7056C8C2E0C9221987 8E13BD744FC4502135270FF93F8B476A53066B2BD1F7CA457F39B0544C993470 9475861C6B0324C3F9687C0BE4CED83AD7D7B2C2F6D28F4C11F9D61592E6C599 42C152B7204B81F5A64FAF76D0E0CE099F597FED59F4D5EF4947D7994340CA9F D5B0ECBC1B73207A06248B774140E38846BA0B5E6A7A8F88BE3DD277C768FD3A E0D289A8C87CD2F61150EB0F9F30C0745978D3EAF105FA555485877050AC1FC6 A879987588713AE7C38E3639A020382DBFD279AB3236401A954EE71003B9BDD4 95A51D4797188EDFD0144009E3381D7A6A63CCB6E2020F9FD86AB2853407D8EC ADA5D3E7B58066AA797F88FBA287F2C323D340F5E687BA4A08FEA9154ED4F784 5AE1650DC0FDBBA07F733DD26BECD42003F40058DA772D696C4556BE0B9369F6 3E9226DD203FF16C1B38DC8FD4ABDF248EF005295BC9E560598352D2645CEA9B 71A510701EBF4594B2EB118F65426DC4270798402797DB94124CD4079686DF91 9971CCE83DB9DC53A84ECB899FC619D275E7B4F458E80AA3234CF5CAFE573334 D00DC2F92631670510535D8AE7AE12AF46A6208F851ADE39B425E18B65C18072 DFC2816EBC7FBF5D9FAC1C787822B072B739AB88F7FD8DEE48114B45D0E30F71 63A174D8EBAB7C7FE646A6038F7F16A4AB483DD983E57C7DE881F7DBC406AA0A 0BD9B02F1ABF43F390CC750FDED74EB3AE170ECE0468D7DD525543C8DC07AC43 D568BD8749005E1558A811A1A67E2ABC3B8A2680A6EA5E930AA53757897CBACD DC223939F3E07B0BCBD73702A69DC8EFB34896ED2F80523AFCF9E02C37E997F1 9438363D34ED456DBECBC021C4F88CCC95D30F576C026EF40E8886D0F3E11E11 1D28CF7A48786FDC4B2B51B34F19C1D85D118ED41E89F184DD98CE91A33DC5E6 DFB4C390661562E03E83430AB585F4B1247207D22AEF9EAB794E8E2A41C8604B F905C3EC9857FF9D597836999560EF1940A7C64B8FBA9D6B81F4D847E2696F79 B71E7C5CF4AA19F65F9C2CD290ECEE979F7B373F74434D821545F78D295A4536 7045828EC0135DEC4BDC7E7D0E25F90BB531CDD88BB04D16B7DB32231A86B253 AED0F6E049E3601D8CF82B86E55711B1D0DEA05E40ABC9FE0F55F2366B0C2919 051DDB4963B2063FDF8C95AE22AD9CC6F64C78AE0927738CD56492731E54EAB6 C1FE7535949CB688B6D36F1C5D09077C6848631E7CCAEF6BA8B6D09E449DF25C A2E1CB85F5EEEABBB0D892830556D609B1940CDE70ED6C073E1F914D975EF7D4 B7E66E6B6998648AEBC849340619360D69FF7648320E583200740798B2FF1767 E8B46453E37612E7CCDB90E87FA3E1607228AA669263649808BD322EBF924C53 17F38ABFD0740A8A69D86CFEF9EABD0A01A4443B27CF8ACA8A29BAE0EFCBB3F5 A85FE3D3CEEC5962EE8E7368D0140A3E15DE2EC239449F64D7074D2F24215BF2 C71E142773DB4293FC234820E52F1B9E068E86D80DF6F08691A2B4B8694B584D D575CCBFA92640B644697BF687644DFB0E150FF04AE0FB6AA6FF6240A050107D C5F6E4316BEFF51948803156F7C4ADC3D40841982526F125F589D398FA95DCEB 80ADC11560465096F0D5C1C74902CFB4A04C7127BBEEDD068939AD1D345F06E2 D4F7D7AF180E8811716D6F69506FCE9DBFF3EE7FCCD96E745181B24847DC9BE4 F62B1907B0B7612A611578FB82916EBA3717F8F2912D608C4052D2B2B5DCC04F 50524A820AD3D2AC158CAB7E67FA96729A5C22945D5176AB5C276E883FD48294 EF2E1E97EB49FA82D566650259CD9686ADF6D285C4A40F5048BCEEA56EF3EDA3 9F541300644FBCE3CD5F2DD631C1908D2BBAEF439CFD86A577EEDE2EA6AE420C 450A6CF28DE4BCADE38BD15A4C5FCFEC295A2C14A7C99F78D75A7151CC6B5FC1 A95441D26FADF69B58B589B13D3294D6B4167C0A0D39B74FAC3DF4F78ACD895D 5B5B7F4D7925ED66323A408C417DDECFBE5E35527509682E74A9E81F208261F6 443716499B5131978288E6ECCD744F621A0341E400E99B4C4CDBFC764C0209B0 F602296E6F6AAC228282DB7CBD51AFF102A6C7B31EAAC95108DCAD3C97FCC0EF 52CB3B343B5B2F4DDFC39B9BB1D2B2C47955218094DC1374594448205B04F702 6B16F57344D3FABEBEC4387A79D4F135B92F5CCC4D713B1B3EE3F9614F9B9C3E 0E8CC8A1BF6981BCA87E341741224F10FA7A1F74B80D679497C47BDDF3F6F21C 8863E66172417B347E4E19F53998EA8202582B16CDC53906537181BC0640F535 BAB91426DECF471FA5DF51755B0875910C894768C252199554ABD01051380599 4C522244F32179A7104442577AC317ACC38287EADBDCD530C20159431C4BF2CF 1E2AECD88D0521C338B3BC44BAF8233A7E175E6B9DBEB9250309FB3ED820EF83 07F6FEE0A61FFB1E988DF80D11E3F0F62AD3551E0F41CD758BB904C88F816A0D 03D109B3DFBBB87536011EBEBFE0AEBD8EC4FA50EF20C2F256EDC1D7F0A3AF6F 8D10C2F7BE71F206CA45D00A6A34D2786EBDBDB8188BBCB727775AFDB3A49524 CCCFA7AABAED170E1E7EC4D28AADC153A5759830311FB7F25631A90426226517 4FFDD1EA98363A59CC089311D9601B398FC70503669FCCCB1B0D03AA4FA5BF9E 7C176E1CE75A2F1C7D9CFFBD77F8031E4E96C4EECA264B8892801193F1F701D1 573575F9751FCD28BF995E77AF7A72394C442329DE642413F1B647671F573E97 8F4BFB6FF576BEE0C8FB6F0C69A0F4E63719BC5D9568FA1D4F312048BE5604CB FE837ADE17F9D3AC9B443DCC48277D7BC9A8A2E61CF50420DDB4E902791D4753 720D284FFC5A720F0C4278E8FEE55192A28DD49B48A34E4DD203995026B34D2C 0175EBD90BE3F4231A3E28CA35702B6BC05CC6945D804B097D3587A1343935AE 063541A6B114486C87A6EDC4CC6D3C4A82729D3280CF29384F0884AA68954B83 237088C86D58AA5E443CE266681C94D1264207A10FF5E0D274C95F9190EFD560 F0D2D14090D2EF11AED9BB5B64A4FD4BE18DD7EE118DB3014E8F78E8298CAAA7 59C56D8DD2EDCCB625B528DF2C3F52D9092B8C16BF77CF463569F32BECC3FBB7 6D813A2A2E1BC4C4B087BA4C22588349E8DFE84FDC6C94924972C147757AF4D3 6A8CF31BAEC00D5A2F7C7D5CB6062EE8A5B25343843B7F09C001FF5CA1CD3798 03968680DFF00740CB879F36F2536BC35C67DA1ED7FD799F4A71771CC9465B4A FEBAF71098146848359D2FD208B9788F60DBF0E0BDEE9616DFEA61238D49290E C721F0D4253352B1C56387EC8D4DE1E70EE1E30E90F78402261895A74166D150 A82277535A5331CCC170467B469A8D36BC6860A525EF9269CC7A9059D7D29C62 73099824E6B3A08410BAD07601B75DAA79A58D295849BE35BE56F26846D62A7C B523578CB4210E31C61FC784B7F4BE773E78AA4CA142D1A010153F81AC1CAA88 E59E094516F4B8E1D3E183ED5AF7AE7970C2389A78362490379DCA0BD16B9C2D 6CB15F823DDEE982F453C151DB9A4335EDF95DB8EFBA8926CB1751831DC17BF9 9D44041777B5744D4877B57F7EC8D9B1C667F20B6536316801524451089EA76B EFF2691B26676E5B01F86B5FA1FA302FE1529DE451EA1518F4C74EE8215E50AD 386D7E916B1D6C46210228B0CEBD8BBDD8BB90D766DBCC40E31279E7FF519A1C 1B393AD1FAD738BE72E47D40743622A3EAA68B28BB62C816B11903F854FE9ED1 717FB82AFCB6C5AB7EFA6B57B687B2928790F99FEBED5C6153C4EBE542474433 4BCC7DCE4285D3109594339D98E1627C43D1CA82D66F24C0F1AE779D5A84929B 644F23AB2490202E9153756D806A983F4BD669130D7E3E1E112B80EB1F9A2E61 0A57EEBF0D421234DDB6801DA9263E5B7AEF9055F6DD2CA80A4DCB018D1BE7EA 4944FFFDF62F83295CB02931F2AAA43C70D153AC573842833521F7092F390F67 01ACB0D063567FF45192F96D62D95CF756756E1CC4E94AB7D316A831CCC87173 2C0B7DCAB227F4FC95D8F3FA706431B5E0C3361882544F21D5797E65928D1954 64E011ED2FBDA05CEAF274A6BC5F5B0DEF498423C060B386F010FE87CB44587E CDC0D322CA0C0CC9C7E153A463DCBC231C16AA8FBA2D9B893AD442F954391BA4 3C580FB9A98335AB9E28394775D5113DCF63D5A2531E17BDF5554EAA1D4562D0 855779D1DBBF4D065FEA1BB746B2D211A03F7EEF809EC999A7D32A8732505E70 9810C8A4249F87F455A3BAF29A3AAA820E4374E29736A960AEDCF962CB14AD04 06D9AA7722A79EE2894C690F8895F274A9BA733F0C1B7A6AEC56FF1238EADD0C BFA6B7A283D0CD175DFB6153DB8C3B8590421AEF02F8A549C62A9494A06763B4 0D9E865736B91F9022F7047F58498670C533F98E961872339A298A0ABC7CD422 97F0C48DA54EA126B45538584B14599634C6B883602EC1093166A010A740A62A 528150DF94584717C23C1B346D078189320538CB31AF029DB8ACD77DE35921AD A02E3C69497575CD8BCF5B94CFCB84F91CBBFEC7D01E5F1CCA520CBFCA1B85C8 8F4567A6D9569BCDCD573DDE6E78FD88851DB77C61E07C0236F433C69D64AD68 9A31B2FFC998689264B5C8EFA7AB4B41287799DDFC544838A58458B9A39DAD9D 9B30B1E5344F95DEFE5B32D163DF5A671333D6491B5DE96E9E2DB5DC475FA62B 0833525DAC164392A442D0A4ACC95BCEC20994B4FE363C32C34828BE8DBD7F06 EBB3B9E79AED47AEB5C7291EF28BEAFC7457B85C077F6FD1BE613365BC191477 607D6847424C8A25FC6D1F1D5C1E7255309102E1821EFAF81E6AEB3B9DB9D2AB 60490EA74D6E251028BC9C7C8F593319A00D8C1D25D296EBD536352653770268 6F575ADA2CCC98D3C393B046BAE30C833A6BFD12251BB3B5DA36B63EB502A369 3C94C87B26BA40DADDE1162DC60FFF11DE6FF88E1ADE26300B6EAFA3B4E884CB FD5745951839A3ED75436B022326888EF1546263EDD8FF7CACC4D569 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMTT10 %!PS-AdobeFont-1.1: CMTT10 1.00B %%CreationDate: 1992 Apr 26 10:42:42 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.00B) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMTT10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle 0 def /isFixedPitch true def end readonly def /FontName /CMTT10 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 33 /exclam put dup 34 /quotedbl put dup 35 /numbersign put dup 36 /dollar put dup 37 /percent put dup 38 /ampersand put dup 39 /quoteright put dup 40 /parenleft put dup 41 /parenright put dup 42 /asterisk put dup 43 /plus put dup 44 /comma put dup 45 /hyphen put dup 46 /period put dup 47 /slash put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 56 /eight put dup 57 /nine put dup 58 /colon put dup 59 /semicolon put dup 60 /less put dup 61 /equal put dup 62 /greater put dup 63 /question put dup 64 /at put dup 65 /A put dup 66 /B put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 71 /G put dup 72 /H put dup 73 /I put dup 74 /J put dup 75 /K put dup 76 /L put dup 77 /M put dup 78 /N put dup 79 /O put dup 80 /P put dup 81 /Q put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 86 /V put dup 87 /W put dup 88 /X put dup 89 /Y put dup 90 /Z put dup 91 /bracketleft put dup 92 /backslash put dup 93 /bracketright put dup 94 /asciicircum put dup 95 /underscore put dup 96 /quoteleft put dup 97 /a put dup 98 /b put dup 99 /c put dup 100 /d put dup 101 /e put dup 102 /f put dup 103 /g put dup 104 /h put dup 105 /i put dup 106 /j put dup 107 /k put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 113 /q put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 118 /v put dup 119 /w put dup 120 /x put dup 121 /y put dup 122 /z put dup 123 /braceleft put dup 124 /bar put dup 125 /braceright put dup 126 /asciitilde put readonly def /FontBBox{-4 -235 731 800}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891 016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171 9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758 469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8 2BDBF16FBC7512FAA308A093FE5F00F963068B8232429ED8B7CF6A3D879A2D19 38DD5C4467F9DD8C5D1A2000B3A6BF2F25629BAEC199AE8BD4BA6ED9BBF7DABF D0E153BAB1C17900D4FCE209622ACD19E7C74C2807D0397357ED07AB460D5204 EB3A45B7AC4D106B7303AD8348853032A745F417943F9B4FED652B835AA49727 A8B4117AFF1D4BCE831EB510B6851796D0BE6982B76620CB3CE0C22CACDD4593 F244C14EEC0E5A7C4AC42392F81C01BC4257FE12AF33F4BFEA9108FF11CF9714 4DD6EC70A2C4C1E4F328A1EB25E43525FB1E16C07E28CC359DF61F426B7D41EA 6A0C84DD63275395A503AAE908E1C82D389FD12A21E86999799E7F24A994472E A10EAE77096709BE0D11AAD24A30D96E15A51D720AFB3B10D2E0AC8DC1A1204B E8725E00D7E3A96F9978BC19377034D93D080C4391E579C34FF9FC2379CB119F 1E5BBEA91AE20F343C6420BE1E2BD0636B04FCCC0BEE0DC2D56D66F06DB22438 452822CBEAF03EE9EAA8398F276EC0D92A7FB978C17805DB2F4A7DFBA56FD6AF 8670EB364F01DE8FCAFBAF657D68C3A03112915736CEABAA8BA5C0AC25288369 5D49BD891FABEFE8699A0AE3ED85B48ACB22229E15623399C93DE7D935734ADA DA7A1462C111D44AD53EA35B57E5D0B5FC0B481820E43222DB8EFCD5D30E15F9 BA304FA879392EE0BCC0E1A61E74B3A1FC3A3D170218D7244580C7AA0DC65D19 741FA5FE6F8CBF60250ACC27454BBF0897CA4B909C83A56672958752ED4B5E79 E18660764F155E86F09EFA9F7685F2F5027EC85A775287B30E2069DE4E4D5712 E7D033481A53A2702BA7542C71062173039030CF28D8B9C63B5596A9B42B33E7 D922944A38713383D3648A4AF160A3B0C8F3379BA4372BE2E7EA49AABA75AEEE C5DDE1D8BF68483C3D21271280ABB91D54CC819680322EAB72E1250A760BC8DA 726405EFE420635B5B7F0B48752C06083E92BDE06401C42A2C528C8A60381227 CEBEF0C9440DC034DAD9C19FB27DB399BDAEE22053591D6538587C768C1B7B0B 7D1E222D2D8AF3A6473CC4C0D6C3E0DB49068CEB8C9BD1C5CD486A50DAA10BC7 7D6286142355E3F21DD254E27C00C442728A0BAEC9D3F17AE9CE320D365152E9 EB0D5E3874F2BCEDA98521D23FCFC30B4B69DAD2ADBE80E5964ED0ABEF6C73B6 DAD30E2C5061E3747FE536E1A5D190D028F2130AF608F5DDF9DDDF1E77DC8437 ECB3EC93B33505DF47884DDBD1DC6BBE4098DF04A29AF6FA3AE344600D0AAB53 B3820DD7ECB600A3B8001C51AF2CA7A39AE1485A087FD1752DF68F55B52B4DA7 48030F2AA7E570B3D56C4EAD367B9B73FBC0A7356253233006178B9A6BC19081 B815B5988AE76FE6FAFD7AC239072B1106A3F509381AAEE79B2F2154CAC4727B D199CDC8B4D05DF4BA006982512ABD7539E28D937B0F87FF79A3F84C29ECF943 A8DCB8BDF8EA9E7A0E7CD60BC2308C96B3E889C797D0FF28FF4847016B3DA141 E76FC6BE78A6EE9CE07E651FF86E720A1A1F075972D36E5C55162E3FE26BCE3A 814BFEB12D4C5FD24340CFFED499C7CA183E57EC4F12CFFBE3291D43F7270575 C6C3306F832EF182ADD0AA14C4D8669A17C09F632406AFA195F90C4DDC39779E EC0A77E590211592D6EE19563963225C06C2F13265EBB5A6CFB7C17D9E77650D 11958305727AF662AE73AD0E3ED5F7E7086C5A0C3548A8129575980B06C715AF DD55C8DF869BED0A7883491030B1A7E82C5EB04E5A7D952E716DD8F2EF6275EE 087614CFAB55FCE2BBECD7E8D9C90FD8359E929D5E0A416A23BD58158318B4FF 87B095EB63F7F052B3A77F136FD66EB2C52BD46CD7DB3091A4B78A607112B12C 4D171B2A00B78B0E1C44B0D90C20D9244281F5123DC1F6063F91E9E3E48DE78B C862D848BAD073A4FCB5EEC9FF54B5AB8E234CCC3C7439C62ABC4A13EF1B8897 ABBF21F900C564C9A305FC36FC7224932F766E6E72C2EBB55953DFE2AFC2E3FD 33A0C6F0FDFF086E9FD796E7242596AE85B877223532667625E371D2156E4C04 0D7FFCD3337B93DF066CB6FE1E13960719EB7CB409EE805C08ACD2C06303ED9C E34C898787A43C1B428B896551C6FEB50A831C6F8CE2073EFC662EC286CB7555 A3B42E58772E82FEE206948B8C439FEC5E4ECB9E11DC3A4CBC7611E30890E408 637A01A2118441B4F9467A98BB2A1B03BB2F5D8E3DB7D1D15C188D9E856088EC B762F07B1C06024F7EF53A2FBD60C0A1F4C0275D07164545250ECEEF8CB15B04 A2D8AC44DDE818C4E23DFF5B846F412C1D28C52DA1EC7F6B68D2E63E6586EA41 0B01DFF80C744F65C069047200AFBD969234842863A2CF78DD48BC0BA686C91F 3B1382C42DC044F539B7089E055DDDE9E76F7EC4A120B4D8D3E14FEAD686B0F5 3EB80AD386901D788C51B61A9C04955BE06E75B24FB77F501D9937DC244B7446 60E9453930286D8112EDA6EB6291C0BDB909AA3B3EA0578815A4CE3AFC9C699C 54C86466BA0F2FC9BF260DB773E29B2D4AF20562C31E83E45950A3A777E06C18 0F29343F91938126514FB2B4A81C98E9CC420F54C8CCD614FC7AA290B7D42FF0 429259B32D92836F4B71D517C130240B63949875D2423339FDEB14B1F1FEC58D 49BC8B826DFD0C2DF5E94A4B4088A7E4029EF2B97B970A53A43F0D280CCDB41F 8F9F3573F522404F634212E534EF3B2FA648D9BF218BAFA1135F6800478D711B 9E3FC435C0D12C845F0B3E77DDA804A75EA9BE82DCB9435BF16A2B94CF7684E6 748B2BB7C5EB08C5728DE734125E6E48B895FF3483E07558714F68F2FDC0F4F3 D195335C8216499611CF9355764266CFB43B77B30E90BA64BC8EB301B5E2D060 B1C053E8071EE600A76C8309801C7927F77D1FF4CBBDB83573EAF13DB5588412 23B6F8EF8C388136CA0BD33DA6043043163E34E1B647A549136C33DCF3A816B4 BFF8424CBC2C9EA6FBFFD26B7789815EE0D3576FB50A3D0D2101D4C43C0F67BF 16984BAF98F16F7652BD26329516CF3979539C902F5BB43BFA0B1DE623E26CA0 521BE8F6908E249743D1F7E62350986EF4385E7E617B1EC50F7408CB18A0352A 9CF70E0FC30958BD6335211756B872801AA86C2F43801FDD42BE49F16DD74849 40E5F5FE77FF2948CBCC494E3D9259938F26C916EF34919924CEBEA9315B603C 5D618FEA13211BD46B019852FE26E305A4EF2362536C9FEA7475769262D3C2EB E4E5C2334FC9E57F57BA7CFB29AD573D3FC5CB5781419899DED8B473385280A0 B375271DC9550455D9AFE5171CA247F90902D62F65F84D05B5F65B8BC80376EF A0DA23DEE61AEE96577629DA3835F2D50C36D181D714E5CEA92198F4EDBC4A3F 17995EBCA8A6B3C86EFF6EBEA1991D3A3BC2EF33833103F462CDA92BCA15974C 49B3F1E7D585E056666A2CB937B7B49572A12E9953438F334B727200C9D7A86F F995C454EFA2D0A5B6043E85A5D282F6C6CEBF5781A59AC4DEA90A6E4F2BCC54 B77584E08B6FB01CD73D5BAE1AFB220EF723C9F99F0F8ED7EA821FF9BFC9D57B 1F84B91A3CDE5B158D3DB7D1369D51CD9A2822D4CCF0DB935B56CF3A52866394 0899E7A965B08BB808186D885D12335BDF0095C476462297D3AC3BE208B1CA01 54CF223348B87BF3472AA2966C208D7BCC2AA07BE712AB448824D7DE9968C6F5 7B6C957577BEBF7EDCFC01EE0D276501830548E6604D50E4C534CE727BADF7D3 BBEC9CE7E326DCEFF2B5908BCF60495C7CD9E47448434353363A82096FA9E1F2 1F8C780C4917DE4EC79CF95A42CD2D15E3D51BBDB9CD624F9C358390748A9A95 5AB4DFEB92EFEF7FB8907751FA44DA024FA91C6C064B5E61069B2796590202F1 2DFF657471BADB7A62F2ABCB770815750378DDF973CD4E11EFC3D19C27C02171 4AD74C3CC0B96793A7E0EB9A0AA40C7A6D426100FF3FECF3E3CB60ADA80DCDCE 870F74D04ED5B167D965F8AD2677298548FBD803C716488925CCBC9A3C515D3D 86C03CDC708D2F95F403008963361C8E7EE7C5C62C15DBE6B22C2CDB249C4445 21C8AD0C014BBE4B28827A5C84D714327904518E36EFBF4356DE0750B52035E9 2E06426EA0395C4852AD2ED3129F4D43E3BB75B546F092C1E7CDFCFEC2F00331 D9D0BBA5D76287C4CA7088332D5BCCBDBFD20B7A07DC6619A4AD3894C699B01B 045D803FC5E36061648DD13B6BCD95844E171F4380CA89F7A7F948715630A623 DD5E011B419FAAB28B814DAFBD3DA2EBC7B6CA635D62145E87679FC56843AC49 FF421EFC70F30062D749120D1C492EF1070EAA096E283CECD8411964DEA10390 147718F191A0A786C3A9862EDEE74767762BCB27D5621A5562EE1D22BE784FB4 0BEACE3F8A806ED5257A038C8DD59D3D52CDB4EBC501C13CC9DC9BD89A51CF86 B6C3F769C470912FFDA75C99C2EF55D78874558397C923C330CCAC3C149BA314 C6CBCA464B176721E9C04D0C08ADA8BDEFEA62E3231FCA6A646F837115D0F479 E51C7E509BB81045FE2F3DCD4A761E956BAF0561BCE5A0D20C0F1C45F40306B5 B6A834974281675F2A33F258B6BF7F7AB717FB72A96C0D50DA6B6E4D3EDF9416 6640E77C36BC882A09024789FA969E730CAC7948640EC203B610D8B02B0E8897 6E0395D5C45E7D414331145412115E3DDD7D137716192A10F8D1F6E134210034 0AC5572B33F6FD9D2B95D7D62D12919B23F7CBF114A5E1FF5C3C310CB947B914 E7729E00E22E2F5E4614CE226310306FEFA46DC9ACD671478C026A15FD6668D3 3562902F13842676E2A15F813364FBF3751A6BCA132596BB02DC0BCB18463F0F 28C1A0E1DD23BBAB471ED0A91788353A27BDB2D3DF7F547A2E401DD536417F74 5CF1285AACD4D96642200201BAB9EB201272A1D102FA7B4C293787CA1DB59847 482B209F980BA3107F7538C5FA1CDC5DB36C5F0A7917FB0BF90F185CFDEDCDA7 3B1D584F43CE6CFC46EEA3907B6E81BABC903DA628077D83A1F18C291729A92F 77607547D61D0CE06750F927EA4F37AA39C1FFA07EDABD3147228D161F0D0FDA 771EF1F476174134A27076EF9AE92D3F6DA91C9568C0E27BB954E27CA09345FD 2AFB9150ADB7AEE906AEE84C5375F25C2210D3F5A3C57298BE1B6AE3CD38DEB2 97904795D70A9F2082DAA0C6071AB9E8FF71508AC77052A242DF4D01C9139805 C2F5BDEFD7BFA42D3B3335332B37983D213B6F7DDEA6217186A93B911DCC0FE6 42957686973CA3E07AD6EA4895AAAD5D5CD878AD776FB9975EDC7EE3934EB131 37EE8F063BC1EBC11D807BEE136A31A70EF2A46B36D99B98B8B1B933F032FB54 B9EAFB5CFED5D813488D6A28250605034BBF2BEF55108CA0D6FF94BCB1650F91 99071E1A1B3B2F1E8E7C89A5E4DA1F77DBF6AA289D331C35C2C2BFDE4A391C6E FB679CA42BCB2AF018303A3F55EBD657AAD46815B45DD067823B4BC3FE3B4245 C9940627467C5F9AE0EAE53CB7CC118984272BCC5E1B8548494E812676FBCA78 A70C417C270EB6E435A6A75CAB4AE742B1194E3F9811A7B581D9C552A3EE5B1B 98E997DE7F74B3D85B46825B620B19357E4A7D82AE97C3B85609335B1B41A532 FB2F53C79A4064C88C84FCE693FA6EDB086732B6F76D31F8A6FF27DD850DD1CE B9C29258680CE73A371B3613F17A3533C5EF5D4E3F833E563E976FD58B381643 F097AD8D3BBD1E4F0C22A79F464FB1168E6B12E503DEE9D1D563B6F9B5A8D6DB D1FD6BF4A90DA086275F7F7AB784F8F945569601AE0499EFCBC5F5585A759D09 6829A9649317B8C53F66C083170EAD52494006623FFED560D382CE663A1B4BC0 D68B544A2D3F4AF0C1A6E50A4603CD433329F379B960A2E6822A381D91DADA65 E5D973E67820C6AFDFB917126A4C4C7CCE0C00EA9762059E3BA7C3BA56F739CA 2F89F58A2F058A78FA9F0F040A8B04B77F300343CEFEBF9357243118D9B62B83 2EC312A4AEBD8BEEDE4DBF3CBA2F574BF9AD66B43C19615961A00D70ECE67C17 6C93C248AAB0D3F9580ABDC833D52A5BE4A5C7F06C12E934BCB99C8D484A0CB3 BC75FE276F26C6AC861A17CCE8EAE60AD5E4573D4DC2FCE59477702AEA956B2A 0DB471C240961BF1402F6ADC61C3D7B72C78145B5FEB9853485C862FC428BE26 F2FCA109EC1D6F77284C5ABA95359FDB4507D921934DAF4EDE1A1071F7157982 3A9799E17F5377F27700EE7CB253ADB2371B228647FD11DC38F4FCD9D75ACC96 D6B5508773BF71AD6B9D49829D6872CE8271A17C6FC89994159850529D5A8A32 206A8BD5E688D5AEEDBE8E0195DFDD5ED07D11DC54131B7E22958959CD35E529 F9DB957C31AEA4F25811C7E0B9ADCBFCD7AE1BB84D65C7EB2BE322E245F50CE9 D611E6D52493244E89003784149E23DCE1624930D53B937405064775D2CF8103 66D2FE6F360D5AFF017C7CD773F0303CA4F8C9FD08B91E414546CECECC770884 87FA3D4EDA2E7D8474D5C30EBF966C9F40F4707E939C22779BC757DB50E9BACA 80E0AD329BABE0AABBCD5C1C59E80CF55E63F84F49FB24D5F8F953D028568083 015973AD8921C03794814AF609FEE8A5466BB982A15644C00BEDD08D351F661A AB6DE4FD2715935A73399ED21B074120B214C8E6BBDD346CE84E704A8DF4EB4A 73C5ACF8E106D56287BF82A4C04C8AD092B9643CC1512154D04AA5213EC06B2E 6B8A5452428EF353C92B18855E9C7BE2BFE82B568AA0A4B620EAE77EA0D60755 E78C6FF41E2503A3868195127619E97805A628A0348CC7C92C3EBE700EF008A5 86B6B5736A275BEB0431FD754D9866829C9B8218552737AE357B6DEB6DE5B17D 5D86DFE33C9A4C93CAE5DC1777EA1DD2D810FC772C8855B4055A1B520BB0EF02 9B1C32FFFEA106BDE7EEFD7C05FEBEA882C2FE39993EA2BB7CB9DDF009C08642 B3B12A2752F8F6BDFDFDF83B0F8648C309248AC9274C823CEC96A0766C58488B EF98089D39CFFC48DB5076BC1DF598C450E76E32EAC21E2A63ED2F4CD9BFD34A 23731B4BCE26D3500339CE43CCA5FB9FD2CE1BF78DE258A270490158921A8430 BA9F37EA3BAE30895A57D8BE8A3DEA3DA9E35E3AFB9E650815E81F9252427FBD 4B27B5C81F4F6D98CC7B7E289231FDEA58E629C4A414C5635B69B7ED30BD3583 2C0CE0A350FA686F91C11AC4EF37F651FF61BB9D087E42A7ECABB2073D930C03 E206ADC510961C03634984D380EE3604635695DB7B240CC9D60E31E684867FB0 C7AF5D477F96C24D377970A9B0431780F0EADC1FCF162245EEBB2C99946C28D8 E85A85CE650089EDDE2C11C224B3BBC65835D33D25DCDE8C9ECF38FC58D24972 EB715C666E5598E6F6ED4268BBAC9F99D725B95F81B3A93EDEAEA3B33EC2025B C944E72BDEBEB532A01D263064123E1514EA9778E34DAD260C3EFB820E9B7B2C 005FB6B60E44782CBB9AAAD0D84E2A7FB9B9A003B2E9C4BE6528537B909FA590 F2AE7CA038C6912DD59455C76BFA330BD5801BB94B2869F9F4011DC70BD31FEC A18F3944CEE997E9D984425D95C28DD02D8E0E0DED0D1FAF045C6BA250868E80 730180003EEE66D87118E677DB28B9F54AEF115FC1F1BDE48DC42BADB2F70A05 0112E3E69AE8F24E90D2C020131BCB703D4BE761B59237786AA2565B1FBE6F13 66F74844A3B2BD29F9BC483BF9931838BD701F8FE96B0751A3C2E93E326FF14A 037BED6C2D42D93E06082DEF985E39557D9A0A607D5DA570E084CE011B3F96B6 2F3633344FB5DEF35A48F468C019A9A881C036F095A4516AF9289085217C2556 62808AEB100B2D3D049629C688392CC8A62BBC7494881B5F64F71F6A280F86DC 288C82510A59277BBC18751679448EFDDB168F3BD63947E6C96897DDFF56A60E 747AF59AE10C996931ED47E0567A0FB1EB9C2A7F062E04CB75174E05D9571D1C FA2EFBA213E13CA73D9FF1CC4661E04E4D1267CF8E792F6AC270F03C38B7DDFB 9155F17C13DC7EFBEDD541AA9FD866F3214FB78FC78DFD68A4B8819144D9A28C DA70DF8489B06196672EAAA63953DC4987FE1BC025CFC38CAA8DD29A19E0B007 F99DF8D4D56FF048A53A5A4919256A3918ED9C87A681B168120E65E24EBA3060 EBB79FE24DBFCA590B47A732B5A84F68392E5CCD7F0AAF8AE46E8B2F7B9B629D 984BE10229CE058AEBF5A5625F3EDAFC37D75C087BBA244FCDA5C6CA4D02EA1F 3F64D397F84FE2AC9ED7D8F03BB56BB25DAFE7E691DC2F7F42B82B79EDA8111F B98941BF10B58EAF2D86FECA8239774A6AE2AF22F8A4103D0CAA22ED11E639EA 899DC81867C0E3C42F6FEB53370D06AF2975843410C8114F5C1057D53F078FB5 96E572702A18C71E09DD607BD6CCCB2CE9D3C84E9D626CE715805C0697204A81 DBB43CD0B952BCD9EADA1FE80EE1E24B1C328FE08783FE66C8A1F615EAF8CFAA DD5A57695ED5BF8866603CFCB4EDF22FB010CE429278CCCD13B39C7AF2135FE1 DEFED11CD2275ED4C51DAE380DF3CBD87A5502AB213D816FF6ADF4BDFC53F18B 1BA97CCC685B11BB417FEFB94140FCE2733949AC3E2E1D25BEB6E6D2E5D83144 463283C90090E110280FC2C220DA957E4F74568CADA115E02BA45417C09CC34B EE51F2452A50D20A5B8D532C283E46E6AFBBA38DECEB61836673F76E8B20FC0E 238CE894EA5EA7C7D0AD342F87831DBDB01586AF952CA32796A6276B2AFE3269 0A26B0D6473A5FBB2A7FDD47EB4CB0AECFE2EB581146A37B403EDF0E53C2F969 450DD44BB534B0D1F8161CB2B04FBD5FB691FFBFF6AEA8664FD8F776A2C328A7 30E745E7F8D46289C8CB4FCDAF7A42371604E47AA073B7200173E1D0075A7895 747C48506669C5FB8EA2EDAC1BA526BF2A3629C7457CECEC6D8F0296C2107BB4 AB5E3895B2DA8C0B2DD14E756EAE39CC14480AC37EF83226903389C6AE3A4109 C93577F97BC888773C24DD888767B11C9628204AA55DFF463AE17936E6BCDD15 F93C818EB1DF9F2664B1BC06BEEFD54A913448E69BDCBC969B7653B868D54B81 8934B0E26F35BA405917D207E2C02266F89261C2566261D204DF7BE4E4FD30F8 E5914FC6956A02F641A478DCF80C02A2B42BA2A326D2202673C65647475460EC 99999A568C1B4C259E3B7A16B741004FF2901AF4F186D02F44B0C6D3F53A6F5F B4066C137C8687ACDD32F7062884391D6861FF0543A377F06B4F85490F096A1C 6213247A6F0C7DFD5EF4940ACB1562927FC7EC5FFCB07A393CBF6FC21C94BF73 453B75ABAD9FBEDC164EBAA111108CCA28F219C0003C488A54BB9B2BF0858419 538058DEBA6C22CB17B7786C34D3F569B42D7065ED309A5AE6F8D457B9655ABC BF4AB6BA6BA1EB95AFE3CD45B37BCAAD8A715629142D9D1138CD3314CF2E777D BC790A63DD1B724741F23B4D3B39C2D3BED0023BD240C19E129B6CF5741A6ACC D6C0310DF5A560D7CA26AB6AF212131073CDA02C770A275F7DDED8C52D673019 AC4A4D4F036F94FBAA1448A0BE735C2CA1193B0B3795B3B4AB693C5B97EE0DE0 CA05AD896B47D71CE613090AB4B0F5FAFFAC48A7F52EC247ACC0CCB10A9DF052 6D19E742A514CCFD71ED7EC2C7D86118990C93748459293FD21BFBBA03C57C59 18572EAED78F8E0A39A03A7C8C1ACE30AB791FB6C477A4B74F21DBEC1DE8F611 B1C849F0A01F93C4E1D76F5E0AF2537624C2A263EE163734F71701E05D77C1B6 AD220682785BDE886373582908664529C9D081667C7354AB745600E3A610F672 53AF7D1DFBF502594B2B50194406F831251EFE156C063B458BD4F42E7DA02833 23CF0005BE43376DECD1A306F75261D6248A6DEDF5F56AFDC8CD410BE0213C4C BB9304DD363D0D60AB2B2D645A8ADAFAC099847344A7C010CD16E61236DBC4F6 D9EA4FB7563A01E3F799123FAB7977699D1134E49A5E079A69D8E9296A062F30 2F163064A215845D0D65B815FE0082852CABE0481120CFAA3B687B32EECA8F62 CC327D1D7BD071F9945AB8B9539AE8E8C5A717FDA594DEFE8511BBBAAD08D7A2 4072A4E4ECA0F3EA8FAB76883439ACB4727A36DF72DE574418B13CAEB099E9FB 466DED499B8E01942E2D6F72035222BC90E6BBE16ED4FB2DBEFC64CD371A6FE5 97D70A6E6319DAF2AF90064B7A240A6B11493984E63B84DD3D59B4243DE9160F D2657C215AADB68343D6ADA3268E20CD294301ED7C46F137DC50B152A2718BBF 8EBF5880626E9DCA1DFABF1AF6828E8D5AA9150BDAF9701F288F864D8C91E976 9E9BE865B6DEB2796C6C3FFA603A947B9F43790A98058936B3109610B502B2C2 320E75318B535D194D764C0AC7A322B5DD0D4520F96036908CBB808212A7B27E CE14671E77725B8EC619C68EB5657863D3663208D21318F7F9415B93B1E72BB7 83612E137E85645CC4A1327859818781CB1DF455AD4BFC77E49A90F893179F5D ECF976993082E64B63ED0533008AE77515453DA9B07AB2F1F0B1CE816E6E1D4E D0D7A445F75F126538FE849BE9A9CA6BF221DDF53BD7E9A45017D919A46B9287 1D1D98703C6622F41A997BCE4F77456A23418E6BB7C0F9FA957FE88A449DBD23 D713F39CFB2D4A639AB99409DC6DDA631A53CF8F5F617159E03BCBC89C688A22 971129FD158E8AD10D39AD3D2E6A8A469BB27AB8F929B28A3459928FBBD0C33C 4DE82E1E1DBC8DDB977706FC4B5C14087456D9634A65BF0C97D5C49593350CFD 826633734D9B96E850FBD5F3F319ABBA61397724E8D21B14FE56B6367ECEBBE8 2D7D0CCE1C2FBBE5817C3D60CF93CAEDF9886632B27DA37F7C1A0342911D160B E520A5D20B4013983021365E2BA6792766B0541F3262A83C4E863A94FAE921E0 57EB7E291DBE76944B7CF7F0D7363681586B405EEDD879BB508FA7E4203C8854 44027B509D69E1CAF1BAA5C1A239999E190C7B91D315AA81B289FE88E5C43D0B 251FAB17BBF7D49A71F75364C6DCECAC2C22ABD8D215AFD535C9EFD9629F178A A75E11332FF6B05A4B1569306E3F3616EE35D8338F65B6601D3535B2C6EF7EAC C71EF79C4EE2A862A75531E4131866D6836F7569B1659A734F35C78FDA7F3DEF 39397290CF54AA9C263E7AEF736798672CFD722612716938391A1053B727C7B1 BEA9DA04AD5B47C42E7B8A53F98AF379F3353F0FD438D215B517A69DB1CA5F27 B567D55144197A840F0BCF876AF832CF3F620A1E2EB286E45794ACF216062F88 D70270FA4453AE510543FB2E62CAB84A3BD7E2F5881B20B5BFE7FAC1125F075A 84070D639DDF28A73E73478FD27FFDDFC0246B3AAE90143AAA71DEC5E440C660 857432CAB7E1E0DE1F6ECBA47F0E0448E21EA69126434DE576DD22996B9C4671 1B5B07B923B59A56A39F22396B2BE68B14283BC384F7EC76C90DC17BF57AE82E AB5BC5D2F39C916F68167A22824BBDAEF18501224005E4E63D8A357F85CDAC2E 1F7FA28FC65DC65FF10059A658F64A06E98152D580385B2DAA906ADC3840245C 7AAA12C0945F8E14BDD097A4BA5F2BE5F6C1704C256FDE77DE6671FC25B05400 61EB206F67B7C752E406CE88205485A27E626161E3FFEE0153BCA76E4F474E22 57DECDFB9294B874FC26D354787AE7D53389C77AFDF711FA5D7552FE3FCFA9B7 DAC7564C749913F4020389E4C7F4DC4FE13ED85AC8F57D0477D752BE1722B02E E2B54C21DA7A976EAF928B142D2E0A5591DCF14420BABDC027E06CE3CE027336 C20703A85CD2D290AD1DC4D347A05FE5E3BB87889B74B7E0CC251A58B2F999B2 F04EA13EF3C6CE11D6FFDE47712BE6C84428E7D95E26DE1BC6142876868B6929 A8F88012693A34E2740818DE3FA7458EE6160364795A3DF3CE46A3BAEDB5E361 B1BF48DCC0B9B9045F65A4E9D61BDB537FD76AB51C39CC123DDB09534FB63C1E A5F85BA1DF0EC2736D029EBBFA7D935A20B087832EE66475FC2AF6E938363F3F 708949FCCCD04CB56E8A00628106F12D7D6B31D08D8A047C5B9E39F4C8F1A7E9 8A06D46ACF7ABE91EF88322FC5C8346310953F9C61CAAB6B8AF4C489447D6A08 125F9E06EA30D6B07DB76E305626581D69929EA0B06E104674747A436637D015 34A880E798BB653C9AE9E8BD619FFA875FDE8F488CD798DCDB0C63532D0D1A7C C866EB30FAE071B43C02EE5C01198E81CADFF0686839C2D44FED8257A2BE9E88 32A38671E067BE2A49D3BC5C0E7893E12A04355315FB0B46EB033DFB8C101EDD 84749263790C308966FE76F6789F21CBDF83A280C6D6FE8BDB669E2F30795E46 C6EDD896F762C9F3E647BB51E43A7BB4A949F51D5599C25DB872F75D72E9BBA1 616BEA9E026069F0262868FAAA16B44DFD016F80A6DE44A4A69B5AA6AB8C0424 C2932BB816DF4F7F74145AE2A0CCEBB71DDF61B2208823E42D3AEB663E3206F2 340F7369C6645397100FE513FDBA478C5DE5C9A0839B5DD2430725529939B414 89BA91759A62625E40B92E834A9EFB3C68005876010F9CAA8BABEEDB06B6A554 21609C50731E2435361AB8F53BF71B878591F8E0BDECC464736D96271F8872AE ADBE8BE4A26B8145480F7EA4AFBA97EA46F6EFE3A52A20711ACF947EF3F8B580 500DC99468972BB657E57245D4FC01F8665C939D385BEC9126193E1DB54E1078 042F0B0984E812A44726C4B369EE9CE54083A417BC8ABB50A6F2B185E3B8BCBD 53A75936812779305A859E533617E5192DA6C3531189CD57DB856B29807F383B 530DE0218926F7A6FFAA401D3864931FDA344BDA891E32359EC567739B25CEC1 A4C8169F251ADF4594215549F7F225DD1F20F1269CEBFC88CBA7CFF4B7214B3A C111FE9B511A8703810E222406D86F41996815618661ABB2C69F663AB97797B3 81D7BA0172D90246E5B076662ADAA4D2BC8FA1BDA20F13F9CB5A70465667B32F EE2A1FE5DBB8BF41ADA4B7D3970DCE1972508929AB078E35391BD8D8C0FA2FC9 A0C63973A0236E7582D4EF32D3213BEC05DF0ABF760767CC5020B609E8225CAD E64A95D1E7D032833DD90ACCE8B5E40A3D57D6D5F0B36617644E83AD6BB70DF0 DCD7D9410B7F47763F7FE5533806A1DE39BE6241C07B2BEBCE630CF7550B1595 81EE53E4C92D15FE69B8591DDA933337F7F789B3BBDCC5526B10BB959E76225B 2569292E55B90B4465A44624AA45A4327E23650D4C9A941E8D86A2D619CDA196 EEA705015C6EA8330D3C04F293512955F38C4170C12D709C55A2832C58930C13 D9B37FB7D4C8B0FDCAB5BA07FFBFCD805FA6089DC09D2CEBF1DC3C894CFD93C9 9BC945C25591C38596062BCF218F28DE9B4EE244182FDA170A07A7A6CFFFDD8F B08F7AD8857066E582F48C596F3C3B3AF67294D1C45C5E5E6C2B7BF67C8AE472 79835988AAB90BFF38E234EB1F49E67200F77BA40CFE10463DF43FEF5FB13F1A 7CBEDA0B168FB8DF78C793CE54D309AD9212A1EB5883C5FF17CB637390D2DBD6 07F05E04CE60D3211C1A32304D1DF076EFEAEE3ABA07DB78D9C13F58FB5B3DF8 1A92DBEDB9EA5C55E3752855AC1225A2345D3B9E37F4068272AA3E465C74D122 782864FEC675506304AFE1EBF79D0972A652D452FA8F70F9C6BB5F7B521E534B 1EC7CC493DE8D55C2F0007B2204D1E59383FD1380519DC4E699BF7AF8D81DA1F 8B0E9626F17C2F620117230E9BF7C4A58F42F8CC037182D73D7DD884A04E0C38 C9B7B80589278B76C2C858C9735A5816A0CEA72F099E038895151004E1DC8CBC B8D53BDA668D8F985BF4FECA6E8646042DBEAEF1AD6579B60FACA93175F3DA04 40F034036E621E1C7F31A376B3765B285B7E4CA83CB8CC1014658C2004D777E2 2D08F4B307A0E63DBB23B21D2A49101BB7CEACD2B40A686DD7C66F4FBC5B6163 24F3A4F48706C45D54FE0056B5C4E748FF43EE41D34563867E41D8160500122A 2115AB57213917F5B1BEFFDA531DEE363AE61D480B05F7F2F440B851B6CE6265 2FFA0A0FCDACA7C1FB9948A63967B3E4E106A7D2194844E368623FA61D327321 C0949D6495FD37433D8157365435FC316539671407676D347F7841CAF39E315D 00B2F5878D64D0BD920D3E418CBEBE3EF5717D509F0AD20C2B9BF8B481F8D7ED B1ABF3595255DBF1DA8AE4FEB4EF00FCA5E681AC5C80F71ED707CE5B6D0DD8B3 800B87042E1CA1C3FE1AC461FB47E7A8AF5977DEDEBD2B1FAE57780342CAD7B6 205770B6D14E8C4387DF27056D3E3AD60FE0811A1F9D2D7DFB6D1D52CA8F8E6C 3EDF8F78AE862AF1D75546E4C0C624CC57A18FD61968CF742FEA4B45C758CD53 78DA3A32960328BD4079C7280F19AC3FB66D24DA8C9235AE7ECEBA537F09A958 F5FD63C4E3A0C49F44F8CB0A828D2A7DE24949138C7206354D6BE8CDB99BA5D7 C60CB286AE290268214AC0A0C3F775BC92DD5326A100CF4842EDC00AEC236CDC E4F8F8448596B7E59BCB5EFFCB7D8C90837FA5BA690B9FB4D4F24BE0EF5EE864 717394793E045BA233A7B146AFECA0664577795ECACF06E811E1A0147A38A3B9 2941416AFB19B4C82A73921AA970B08D68818AB2F159E527EB7C48B64C43AA2D D5DD0DAD15AD0161667D273BFD59BA13D7AFD709F43DA9E1E5B3B5CCFE7EB38F 08DDDD02CC0CA2A60CEDB070D54AFD8F8EEF0B460E839A2904A8DE16CE73F632 3CBA9A65DDC7DFF06E5FD2B074A6312D01F8D75491B87EDBDAF045FD2093AE79 0C2CDF2CD7677D4639E412812A7E95224C3995631589DCFB5363C82E7D1F66D8 3224A7172E5F0DBB88275EA86428DF0D223AD4079C9D233CCF7C83D3D488EA8E 0D1A5710DB03D00B4729E51803322DB1C649D2C0FD6D3ECDD66DF8EF0FA80B1C C447EBBAFFFE5BCA6262F252CAA42FDB90837425645E57637A4FE5DE5CDF423F 85E41136A2DB6EEF9FF48965C73E07A1FA4C9C0DB88E5FDD963E55528C8986E1 030CD62EF13B3DCD4936080F90EDD2CFBBC294E666E0D78D448CA04113EFF2D9 C467D9E7616C426F93C1AA8C3D31D26B2F14C4B1ED42390E613B4881D137F79C 07A1E8874FB91F8C3F561945FD8903D4BE99F18212E8DB95BE4220E57876DA3F 5D502316602D0CD1B1121FC930F08BCAC9D6E5B9ADF80B3C1CA1215756F11ECC 7D2DA3D97ED094920C38CC4A68D7BFB6F75E8431A3840D5845CA8752F14AAF8D F5A80ACF8E703D88EDCBE251C10238BBAAA923DC490049E76DACCD2FD320C349 7FF97E3E2A9EC49C5EBA951F0EEA06D48727CCEC45DFE86D667725454B700F97 06B1A6521B25A0B5034BB64EFD4C7AD11E83F24BF7ED607789A1AE805881E4FA A5A8610DB42BC7341F81D63CE70A7E37715449BD850A4CA83A0C0EB1A33A29D3 82630F9F62CAA98AF0AEAE3E0F450B925E24A82907A642366EF798CC064FF67A D3BC3D3CF3BD23641A91F2DB09680BBED2586A8869FC8015134901F7F4684B70 73E4D6A466F013F76619BE61A4B9F66BF167EA7FF7DCCFDBDDE96DE78EBBC0C4 A4DAC9DE8D709078F4C134FC1BBF53315977ED4C9C41CC4A02026E4C3443653F 39B23880391A2320170337F211CD83794118E5A014922CFBD8482D88F5622059 3DE77CCE12C636241FAE4F5B91EFEBEFF1EA36C91465BB15A49EE3202451B862 BECD7D819A56F7D7E46F981BD96FF1FC2587943D90F4B0F7B4C6ED4B76D6050B 01C551C265BCFADE1E2D72A0FD4C8AE9559C7F2723769B1E3254E33B7725321A 1E57D149D9A3091EC5714180DD68B89D7BE2AEFEADCA9585069CEF9D5FBC51F6 B526E00E168E72F5CC9A70349DE30D46C50D30536821A4D988488C72AA9A8E87 52DF5FD0ACDBC377A37AB3140D89EE5803A70886696176D2CB7D226443866046 174AF7D525A28D851AE35BC42A2FC7EE4777EFD0E1650F7BCBEF9DF1AB64870B CA1E15C7D67B3FC527B86723054D6C1EF1A869A9FCD5244D0BCE4182BAFF60BA C7DC0ABB04C31C92741C14627D5ABE692403C6624B6CA64544E905B11C6D8FD7 1F28055E4BAA5CB25996FE88F502742F42E11D087F61117F9730652F493329A2 453D9508DE874DD92BE4185F6A7BF99E562EB614DF01385B86F6F271F355FF1E ED5A84D534446E834B5435D483DC20A729E81CEB96EDAEE53D2E431BD905046D 712133BB30F33DAF2FC62BDB3A171BAC8E33297C08360CF255050DDAD58DC96D 280AEE9F9B66D2D8806E2CD32F8A08434FE91B7451AC5948A1DAAFD2D28CCA24 8184E20D0F00EA9F2C663E7C4ECA2F9AF6EEA56F282AF32DBD960D40D4CF055F F33D5C25602C2D6040BDAFBED1926120464F183124F48D34BB54A06A6724DCBD DB2CD715999302DA068272B4E5742DD8D017E604C4114B1DB529A841F633160F CFE80EA9B3B52B940AC0F685DA509ECA4B420A996E8488933EAA721B562450B6 554302451C9AD6A56A84B85EAC18F03535099C8363599D4397454E19C0AB2A34 9EE7A3C94165E396B9EFB97067315FC4762F2BB4EFD7FC635FFF0593528D9079 69A5556D34927059A46525E6445A881CFF4B5B790ECF680068973A47EB6849A0 52B9F18FB039050940EA4F9B51A3B9A099F33147569AE9254322ED47A6C7612C 46EA207F0A0FCB785E1DAEB571BB99C97D296CA1DE3838CAAD06A98FF8146056 ED014E14180D505B17AFAE35F58696C16D8C46F13290F1600075A363489C9D63 6CB4DB7FDCCF49E15B6825CBC4E04A2D6BA136289D198E2C851D794A9A3E8E45 7790862DDC9EC0D12DF50176A194F39C7C13C88150D2DD1208F386BBA3B0FC1A 77F94819F12D78D5C59139A1DE0F2DFB3A7FFEC4FC38067455003968A57F73B3 6C15268401F75B5C843D46EC956AA677A8DB075B61E547DEC35A63124769324D BD64C1B1D38777BE93F60BF4D92C85CB8C9ED2C8A77EEE0A4EBFF3A44F237305 EC57E50E3120CFB0DF8D573A96A740E1260A26C3174AD869CF2EEB226ECD812C 480D45502C3A4BE2B4EF9A8EAC7DB836F0C843971067F690B653D9C722655066 D113AAFB04FBDC5BCEE0FF67A38C1808943882E4CE60A6969939BEFE16C09B59 CE50B529C3BE6377368C3E827E9441D96BB174BAAC8B518671E3A9B95D4F1722 A26F4FFF48348CEDACCC4FD98F71147D0B760B320705C1C13C9815E2CE82C5F9 D6CF04C81F1BCB9F12A188F9828498C220C6DF1738CA9F236B6D6A01D747BB6D F322F38D0D60A2E07E0BF1E259214C3F3EF0A72074C261ED09B05DB3915D0835 B2BB52B6ECCB04E712B6BFE1A0DA7437DDD8C4C05CA45B1D5CA17EA99BCE6428 7E635AAB8F2BA639F28C52CD0800BC348990D0E3832B0303A272D6C99D8A6044 C5093A422D646898EF85ADB647544B2CE33DB5DC66717506CC90ACB01CF58830 D50F4CF7BACAFA2311819C3F50A9F91249C624EEE17EF5752C6AF77D6B852703 81F95A42593045A69334D6DC1280384CDFA0D8088D97332FDB06A02E5DE9F962 1B41C68A0139BC5F03FF841D8E93FAD2DC08E645F476034919C218693989244F DBAFFDB4FC0436DA9D43C8A2D55CF8DDB0E7ACDF9D564BCBE38073E74D65C8AB 0E89D87275D680F0FBC2389D1AABA196474E26BB4BA01527A72E554C29EDD3FE 7B17BEF3AB22F2C7C0EFA69C708C36CDDA24C38A845EBA9E9A3E6052B54C188D 2743EF1487B6DF0E6E622A697BBE91D5627DB3F32A57C0AC98368FE53BD09844 A326B096D01FA3547FAF440D44E079EC0EFC2A482B05052B2D57DA79B8B811E6 DD9D0E46E838F1402F32EC5FB127DF771049F7B79BCF62C14E3FB4D6D7BBDB80 975272E6DEE0109857F51D57E304B74DE4AE99ECFCD0A40E57C5E51283D8F270 291665EE714A6596DBBB5285FDDC4B6328BA6745998EAEF40EE717C63AEF8A59 E87D8E3AC8161B6638FB5D0963F8795587949FFD6F58C5FD18741BA3483B7FD3 FC31F188B096FEC566BA23ABC2B34B79DC293909C9E8393AC9A26E6538672756 3FE2EEF3E04ABA6D344F2DF359AE718C7D0EB5CDA5AB3D09C62C990BD5BD7E73 3F1F8AF93ED0FF3222D7411CB9AD3C3AE9EDA04DD1AFD21A4653AE6A890E6C07 1607F1668E4B62730DA65DF88C3C63FD7816C32F26D21A87522C2097BB925D92 CBB694A7F77E91F3FAB14D0A493384DF902DE5D5F4FEAB5F5BDF567878AC8B4F 98FBFE8FD16D07A58E2211B87983D40D5CE6349A207FF195B7F09B914CB6D688 B103A5206380A90713D3C872EF8C026D2E302BEA473BAB705DE58D802A47C249 9C40EE6F20398E591A3878D4A9DE9F6EC097521DDB694503AA8FE3BBCF24A5FB 3DD6CCF1247B5D9724508C63A3E107DE56F0802CB083399BFC3A9DA62E7575E2 58AA589E85ABFF222717335997260A7F56965DE4DE551885BA8A1DAA5C97AC34 ECDB36FEBE3D8428A4681871FEF7CBF2B5DCFE747550D296B419140C39EB3AD9 D65B6146705DC3FEF0131533283A100D9DBCAEDB8A10CAE4C431136FD94089D7 64402322603B7049D4D10F97FD54D03D81B7B134293004BFB852D50DE5C6C5A8 29F3FC4855C34AE134EF939755B88270B114106573415FB185E395F6FB0A4698 B105964A9F374AF011972D67BBE0B3CDBBD0D9918A0E0D2653726C630FC8A63D 7C5BE82A965EDC1E0A57652688375FA60463EDEF222D4A6D726B768D8EA06584 BE7D23F6FE42CF8541F4BCAE1B01C73D6500207B211720DF98B72D016CC513FF 9109B59C4DBE5108CAE19687C1682A36F39AA8AD09C5AB7D69A13EB0BF2F50A4 0766AC191B105EE28BF0A87862C377E47EDAA69F99B7793F5F76114940848E50 CE05005B4E2C91103DB7BA7BCE79755E4324C0D0305EE203294CC82451EF3780 106156CC6C6BD07296CA7B927B869F8A9755CF9173F22D30EBD3217A98616E3C 8525AC8ACDB07F9311558AB53805673411836886A919BBB916416DC1C2061CF7 448ADED96B2933FD25C207BD374AB495DF564F25554274A3D2129CF7E6562F56 E3D7234B8660A536DF464418BD08E3DB7CC2A2A8B80A0CEA897505ED6367A460 3B6C0CE70E7C5F482C6B3FCFDD8C8266E023C421481CDBD041469219AFAFF611 97F1A2D6B13A90A76AF1FB2520D973DB1CA53BBB11A81115605A9ECEB0AA60CB 972E5FC2C431F1A5EB305D09C8B4C6D5CE1E397CE7FE9DA819F132192B2B91D1 2832F636D75DFC3A82143BDEE17461D536B13D21CDDC295EB617AFD850D59356 7172AD007B843AA74DB797099AB440C40BE561612B4506A8E26D1C4C5A8DD4D6 2B8DA07722FA903A6ADD179E0214071F1AA8A21022283E7380AF0B2656DAF629 50E8EB7C686EDCBAB6E56C5198041DEB47AE8BCDB4C30D318D2CF076491894E9 C9BBA0C6D9DC4B5962350AEF5B9DC1EFFB0C9B8F562660D677F376B2279089D0 294FD57B5ED589C1D28C6E9F02C821134A221334E1B4AFCD618FD86BAEBB31CC 28FF741E785DA99568AC909B091BDDEA56D6E3B75F4307E3A989C1BE6C92546C F518EE6BFA37355BF3A752C26A014FFD48B98F7C1B11B625A43E677DD04B16B5 B1B5F666AA67EBD602583D810578ADF8FBCE669C3913DDFECB2F64745EFDF7DA 13E21B44417230EA477D2E13452EE0E048FFBC3B3F3E32687948361AE63B2F3A C2393837699C356E580C995217D2BCADFDCCE3A6276B86DDA6DF06884B153369 327D3461E0493B6CDAC5102E62040437522DBA5DB6B6A4B30BE8AF1E9AD4DA47 AA79B1AC528F44184C40B9FC2E402F602FA679EFBF9F374BEE06E6332B112399 D18B8822C21B3B1DA3A84B31023D39508C1F0C97CFB05298E67DDF6EE891E261 67C5A17051C6DAEC3924E7E9FC00C98225CCDF01D885724122CBFD1354A59CC2 35EF7E987F633164341E2074B26689C6797F81618EC137BA7AE502904A211920 D7FA213A6F0BE82D49F7237690413AD381F5D2A3BB67D027C48455F48E717DCB E1D0ED373D62E180BF0AE16B91605EBB768E97242CA8DB982AC0C2DCFD4B5EE8 95BDC8910A12F20439946D3CA70A5F67A62B82BEC253FF1C68B1DB9BE887923C 1B4F803DEDBC42CB12082ED81E92F657D30E8652E76C6D93B1C7196BB77C0DBD C2DCB9E8734272157E4BD32B57FAD22278DF0B98DA7ACCE25626F453E8A7387E F75FB71ABECBCE09E6D35C7CDCD550EC6907A8832D6831B8F16C6FF757E3733A 3D028A0456B64C686A35EFFED2BEC9A9A1D93E98745DD6036FD954AAC48ECCC5 470FE468CC4AEEEC6D6E650378E5561990EF37879B517DA5D550B5DABF216D27 26941BDBE7286F95F3DB4673BEA513C8AE8FAABD78ACF6AB6918308627EE223A BFCD0B05C18134AB378AA07512D71E7AF987C925AD05686B6891EA8573FD13E2 790918687BD4DA3C12A9E0F33FCB6AA2BE3E3397B970E80338E5338F0F603B86 A42FA5A6285CDEF0739EBEB1B9133E86BAEE66E1AC48F83BECD4FA2CA3F1D5EE 8EA02DA4925191191A953FE68C13398E2D80796714C07FE16CAE171AC6BB0870 0AA402B06C310DC99F0A07669C57B5292530FB8DF265DB909A86B8D076468B4A B24AA398EE42F29BB41E7A640883F9D6021F4CC7E949670DACA3233FFCBD64F6 AAE2DFBB7B1E69F24A6C0A8D86081B2B09270D561B20EAD4D6B1D40B7F333A0A F1B2E915DA6709BA159E81455907510390AE7C870A4F38BC8DD19149558B9687 37B0777DC5D7964E3B50F4CEF6EF43F38BE9F01A68B60FBAC4BEE09E197C2554 C413B003ED8D8A095BEDCB291ACC0FB3AEC024D779BA9D69FD3D0F5D105F95E0 EA00C1483DC52F2A37BDD09F1F416BF99C1299784AA46D36515387FBD61C1C27 A2B6E55C6B086E87B32921BD7441F10E49DD10D7D82E81AED5FE4C5AC09F617B 9BEED75211D3FED854D9414ADC9B6AA0529863DD90FD48A3F82DF1F7C634D83A 261AB18F257A389AE958DC7315251E670296B0F415AB99D1FFB56AC1E7E61BBE 0DD2A5C6DCB7E270957BAC7584BFA9A6E21CFB293F0F51C58199D2EB431037D2 C44DB61F55B46B3F034CE7127628B7A3549AA2CA1FF18DD7AECFC4EE7B3AEC3D D0A1EBF2F7E045BCF177FFEC6A32B8BD47EDF924EDE5FAE04FFAE9904F4229AA DF5B82485C624F0B7319B147CAB299A6FC7EE302DB985DACE5B13F8FA8E73504 96E522B8D32869418AFE99B2EE70F52CCFE638419454432B9688E631272806CA FDC72B2F2971931F3D32AEE7B8979EF969E122CFB6D7AE0C314C3CF64859DADA 99AF547DF83E7B74AC852752D25B6EE4A29B6CBA28CB35FDCE44C0CF816E1420 9456518D9DC7A31DDA813F7ECE178F6C80A53010BF2272F50E93F5EC18E91D6A BA5DD888E1E9FBAB51276F78875DC0E6EBF759FD1C92A7D9E86D57B9632E5D3B 823FCB477610DEBF376FF0DAAF01A47E0CCBC52F0052C93C35EDAC9BD26C0CC6 5D62756F5476CD1BD7581567F55A6F04352AFB226DC7087F9D5B254E454126DA 1C12C7ECD608698A0B2E3595CAF63B8BB3C1DC9AC379FDB7F99F255C8AC29A46 AA322BD508021592969A16DCBA6959C5B92D0510AC400844405C810D6E34D41F DC8867E6A9 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMR9 %!PS-AdobeFont-1.1: CMR9 1.0 %%CreationDate: 1991 Aug 20 16:39:59 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.0) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMR9) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle 0 def /isFixedPitch false def end readonly def /FontName /CMR9 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 44 /comma put dup 65 /A put dup 67 /C put dup 69 /E put dup 70 /F put dup 71 /G put dup 72 /H put dup 78 /N put dup 82 /R put dup 83 /S put dup 97 /a put dup 99 /c put dup 100 /d put dup 101 /e put dup 103 /g put dup 104 /h put dup 105 /i put dup 108 /l put dup 110 /n put dup 111 /o put dup 112 /p put dup 114 /r put dup 116 /t put readonly def /FontBBox{-39 -250 1036 750}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891 016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171 9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758 469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8 2BDBF16FBC7512FAA308A093FE5CF7158F1163BC1F3352E22A1452E73FECA8A4 87100FB1FFC4C8AF409B2067537220E605DA0852CA49839E1386AF9D7A1A455F D1F017CE45884D76EF2CB9BC5821FD25365DDEA6E45F332B5F68A44AD8A530F0 92A36FADB679CF58BAFDD3E51DFDD314B91A605515D729EE20C42505FD4E0835 3C9D365B14C003BC6DD352F0228A8C161F172D2551CD1C67CD0B1B21DED53203 046FAFF9B1129167921DD82C5964F9DDDFE0D2686875BD075FC81831A941F20E C5CD90040A092E559F6D1D3B0E9BB71733595AE0EA6093F986377A96060BF12A A1B525CD9FA741FE051DD54A32BECD55A868DD63119A4370F8322CCBEC889BC2 A723CB4015FC4AA90AE873EA14DE13382CA9CF0D8DFB65F0ABEDFD9A64BB3F4D 731E2E1C9A1789228FF44116230A70C339C9819676022AB31B5C9C589AE9094B 09882051AD4637C1710D93E8DD117B4E7B478493B91EA6306FDB3FA6D738AAB1 49FBB21A00AC2A999C21445DE3177F21D8B6AAB33869C882613EA6B5EC56476B 5634181ECBF03BFEDB57F079EACE3B334F6F384BDF9D70AEBD592C8ECF21378B 54A8B5DBF7CB9282E16AA517E14843909339B5E7C55B038BF3BB493F3B884A1C C25F9E8FB912CBE23199AD9D2C3E573727701BA301526C66C3617B9514D6F11F 11930B1D97C17816C85B1BFD9B973A191B33CC3B391815AC46268691C741B2D4 48A840F1128D9B2F9CF07D0709FE796B23A836417BF7B5B12D67F74453C82F5F 25F7B30701D6F6D4F4DC623C0C27D6A6FBECC7312A3CD10932FC7C10851C3C52 24B75DEA8A648B7F34F5711DB0E843C914E25663C510185BC37BDB7593C1C259 21D8DDAD33982C336BF272BAB2F48E68217403FE9F54877B243614A87E64784D 2796EE4179FBF96123D1BEE3EF89D682B427BA4F12A1318A57F18BE5DD903815 2613667F0F25922C8476E353296B5FC2300FB8AE7CE38FF3CE3217A905E88E03 E2B4A68A22673EF30CEB2393FDF6387D8AF7EE943A23A81393BEB6D7033E6D90 A1D645FD1BC4965E6441C6336D5389E0C8EB790F1C97033C7470D8809199A090 63C898472D46F75F3990E561489CACE837690C938A7879B21FBF83AC6E268CFB 03AFBAD3FC5281BC608A9D7B613DBBE356BC7532175E2F8598E647D7F4947DCF 1D9EB823F13E4AFEB0BF3258692EBB2D2F11DF1396852DAD24650A51F63FBA4B 0F74B5294F62BFDDBB56BCD47A4428CD4F2EE44190651208DCB3C6E437971971 8979A4EC9F636B164FE1389FDC539ED9283B76E84266BF0E3EFB8A3C54F52174 E5BE4FF05E7190E4B3655DFAD9FC974681FB61502D974A70BA8949CE6B6D1659 DD840F16AB744D39C53B0753C4EAAB13EE3818898A0DE422FC8A6924CCDE45D7 161678E8F9F7C8BAC0246476A83B413ABDDC8033B5D1BD7C35E8701F0DC63CD1 BDEEE0FEE322C2CB2DDF84D10F97A24FC79E8EFCC492807B07B0E9A887B976E6 820010C4293F27C8B075DC9D1AE3CEDA7BC8B9EC9BB7C4388FD3A78D48FB8556 E49D309C8A1DDD38A1A149E6D39F7F4CC7EC293329B22F88598229196F1587F4 12D9BD35E5FEBC0D2A5813944E6651B7C4E5150C4D7C8AEEE4410F818B70D8C6 CBEFCDDB9B8F47B81B0C15A3054923057AC6D244EF133BBBFAD4EF41D6F41596 28195A27563D3AB6A62FEEE584F9AF0CD0253B7D7BB5E599081EA6657101E980 A558B9531CDC5DADA0D47F1CBB6DE4AC107A5D3AC24D69D0EC9609CC1762A583 121D6D0A48167E60C447D47AF8693A0E7B2796B839500CCE022FCEC5D2C1CA0D 8E8286CD2F31A756E0F3AA641C38ADF5E4926B3C41DB21B320F2EA5BE5D16E71 491B6CD80858B1F44A780DD7F6B77060FCC070FE625A196BD6DDCA6E40015DBD 378FCE94246918B68EDADA6F54B169F0535EF084923DB99FFDCDB9CBA30EFA21 EAE1F01B9AB170E6A1D92859BB2AA023E78D50601D9F33944D50104394EA45E9 EABD98646890231B2B7A5563A099212D51391746B21DE612301614B18E4493E6 BC78BB2D62EDED4D1384D85E7DF873E3A3F8C16FEB39B0EDCDB2CEBEC619E718 DA6EDE026FDCBBEBE75D47EFE7361C91C0B28118EBABE2C2B6078F4F82D925CB 4FE56054E9039C69AE61A0F1E5355E8B590405D36E3D2A2A2A51EF95777D433A 1EA1AFBBB14E0C68E8B751E7BBD06731573197AD614CC21DE871692FBA52BA34 D50E59B29207BCFA4556641ED3E868CB706C373073DA93FF91B2E6242D8A5E80 0F4DC93D6E7E6286D8E66D9126157EB7718B5C57496F3184192A0C61988D0946 2D4335FB6673F2EC4190CEC8C0E501517D1BC92693A73B02A6F6CE64BF7AB782 CFAB7E0BCA8DA23B10DC337CA184CF59C391A3F6399518C76AA0D9199A8614BB 5F0045C05233CC68A0B3DBA0F9D7F9DB81586954D5724B79F765F6BB51A4D330 53B753D84A14E2E4AC83262019E3018AB2EFAE580ED2F6093C0A1787756B33C8 9190925D0CF343543AB8011463206786871B4DFA4BB0CBC408C98DF27C4B70FF C04DA33A6E06259B0226B2DD479D2AD9A9AD51961AB9D861309E73662E78CF01 0979D545153EBC51FF9812BA01F652508505F4A82132331F3E3C74E00E52942C D8FCD78212A74A37247DF714338962F6585B8DB09E1BD63FDC2FC1C5FDFAE77F D12489A28366289F912890BFE5CDADAC498E10F9BCE6D05E1AC790171A484868 1CF5BD642B29E4355E18E3D48D6D5A9D63DC763D50E03C38C98BB908C05BD1C4 5D495B84C6AC10081C83B50B2B5BAAC285210D7D3D79C2151157B8A69839C5E1 691ABE5790C282037A98CA60D2C5E7627640607C35C285E39F3F4AE64533D4BF 65CCB9A11A79260B87F567C7AE128AC2C63C6A1F10C56E82AC562ED2C3A13B6B D7A5A06481890A93B8B2912E5AD052779D909EC758443A79C92535518B61D9AD 0ED1451E969C8E19BD78D3E51AD4B8C72EFD7FEFE8FD3ADE5157AF86CA3DA2D6 1E2B8D5154BF6BFBD8B45A52A095EF38480354F644A41F863119F882C07E48CD 2B64EF986CBBC000706F5B2ADC79D2411E1776F3067DD0CDB73F2B097A09D413 3C2659698D66F86082708B23D87DC0274DCB16EAB89170AEF3C6189DEA0ABC28 3691DA6C145EA5D191073041FA338AF636C4B817E5709D4B367F66A5CA9DCB1A 291F4231B3BECA853D6622E3500FD1842C8999D6412BB35985712C173B1D0684 EE50F6D36DAE6839A625EB242818A7F7D7E88CF3D20D000CC3789912E3FBF566 88F200B29B9422011CBF2EA1EACACADF2E0A44BF84DC296F6D4A7420F44A10AF FE9323E87BC10CC10752266E5EBB9F8DFB805930B77CA360B513A02E6F8D6826 C38F625C95606B5EA05B475DE83149DF464CA3D83C7095427784F6C10B353FD6 5885CA83C893FA30A28D45C69BBBB3F0498CA3B585DF4FCC18D5F55754553D7B B2CA38472D4A2BDB58C811C840FA82BF1A585AE685E848D222B3437D874E0A4C 6BC67DE7EC0F3E34A5A204AC7C4AA41A99503DF5CDD4E8B442212DD94A650A8D 706A0DA0379804FBB248FBC03FBEDD55705654C1962DC7124B4BABE0060EE47E 66F7FE127A645D9D05A88EF0FB573E4F86313C25B78081F2892012E3D429C7C2 322A20B4C11E6F4F54A8888F32C9ACF5A29F996C30BF35A10E15E4DE7E36D64F 530C3B766C110BD64AB6EDA4E7F3AEDB1E2DAA8EC41DA74E57C28284B98833F9 C0FEA33453C4A6BD3E62F488C46141BC8EECB66E291BE50F5017E822AFBB333A 30FD1B0F9F9E66CAC5F58A9B7BD6A4EFA43E74CA4CCEF7920F1128E51ECCCBF2 BB44236C4E4C047C87330822DACAE4F8FEB14C8CC0EF0D7F525CD1A08D07192A AFE999A4B565231B500D0BFC33114E0F6446F7E651D61489BB72EF88FEB7A436 3E04E8B69BEC231DFB97CD6EEBBE7D5E47F39E2121104BD3D6FA169AC8E86DEF A8AFF077E12F7CE025AB3C309D7F81D3196B4D14F3C7F8E2AF906C94CEC37D11 6B4D466A02B4BE6B0B7C9B4BA7A0399950E4D101CAC2C205385DC432ACCC8B76 59C0F9C82DB43C9A9B847997540698FB74107DFF24D1415C7EC8CD9A852AE85B 6EE981A4AECCC1C5123B486770FE6290CF1B3FC5F9B01526F9E9DB2C92C49259 3B9FF825A3C241EC51C85A2273E683B8B8E3ACDAC09D15C2BC69AE4DAC0ABD14 96BA077EAB7DFBE745718B859C711FAE6E3F47FD31E61E31BB7FFD0F467F14D6 6CE8AD12181EAF72449F8E57B2C102C8140F15B7B192DC31A12874BCE4A7AB86 0C4FBCA801F871CD67C92900C720582A59310A3E1A448404CBD62C0C1041A151 9E308E98F470051A07D0832139A4785D5CB07616D16E207E6838EC4A21F85327 F9432A7228EE66B1E989C7DB3B6F9B33AD1F5F0B4393EF820A2AF2517661F287 2BE4466C15E205E5557A0B70736E55F524B8645372AB001F540A3A0AB00CF7DE 1640B3C0CA275E6C75EFCF7A1AD7AEBE7F5CE88DEA735D8313281BF3B6BB0AEC 63F291F499321E58E390E11F7565081506DD5DE9FA7978A76221618185FE1E04 39D9DAC487CFB00EB6DD6E689FDB53C0219FE237F6EEA9C1F042843D3123C144 95CAF35CA462B0D8488D04B656EE64AECCD89AC054801E2463EF52FEE08B730B 58BF9F8600A8E0459D4284D99C009B05733A0302B67234E93735D5D02F1C88B6 65F48C5A80F4D566A4308ADD39C52D53EB6F016483AFA997A4EFF397F64732E6 1702B6D91C73D4FD49D438B9D7B3B770ED5DF0C3ED2891E29B26F5E5AA54B8A4 095CC7A7258E64D14CE7631591FC8C4657532E4431774890ED7C21B5232F4F7D E476260C734FFC1161D8EDB81766B7A85F4982B0007148BA232A5497AF5ECFBF 0C5C52ABAE562097A6170446FFA7DA4C816513A46CD44C1BC551A9153207D132 F77F4EC4FB69723148F9391026B8D694C922947368F5C3EAA437C75722971F1F F250848701DEA51D0E0BCC2003B2968586B2F5186B22B071A3323C92688E7314 6330B2EFC89CD6EE8DA5187C5B9E87C9DCAA7B295D80EFC26BA1CFA8CD89BD45 812C87F043E9CBF8BF047E1D800595C1ECADF24103FEAE5FCE32A9945C2297F5 A431B252800EB9CC44896BF15CF7754A54844DE09701EB22011DE9091C10B55D 9E6737C59654F68369A577C6C3D200DDEBA8BD4FF09915A5A015745809B20E45 04B6B0CE900472B2540CB1D18E60FF8ABA079A81D532395FFDA2FB03AE01999D FF7F199EDEAE47BA5BE4668E1D9B994C565890D4CE2FD7E9646CD3626AAB94CF CB1355CC2D54482F6C5B5745007AEF876C836E7B18D9B5C58448ED7F7ABF1BF2 8EDECB1A18D7DF20ECB502E15B5D471CAEA64EB2182F00F5B5B7BB72E358DA99 CDFF5BD7E274496774EF1155A6F09FDFA539E26BEDA3913D3B6405C9321C9D1B E5A0CE080F57BFE2CF3C80BCF2FF7A7C4924F96B627CFD45E5889996EDFD4E3A 9351034F1277B2D54C0D37783C9B8B07D2976ECE08DAD78FF7DE849DC077BE48 BA4FF934C2749765D4E27D679F94539611F98FE1CA92C52246AD2778652A6BA5 DEE57AAF3854424A78A23B36DB9E6F3364918BE5EE6CEEA1D6D40F8F00A9C116 3E6FDC117CF5B47B5BE09290686EE57D5A9C989F42C0946147B52C10B6996920 6AACAACC50E256B641D12ABF9F6F8546BBE525D57DD449F819A9A678746213FE AD49897C02A4DADE4721B1E1B11EEE9320240B05E9A74B02577DE56780EBAE18 4D810C4142026B75E4545DEF0FFB267DC1F44CE328749B121FA989760108BEF0 C21CB7CD0860B5E215133F66F88E0CB19109D36F47115298ABE66672708CB761 CD0C45CE5A12C237758F3D435F7D310DBF952F149090E9FD8A902AB674CE6A7D 08290FCF67CFA594F322360305C16A060D263D2F0CB6FA9E52CDD10A54F185FF A9AF4F97F64869515EE1DF31C64031DEE3627F46FF45ACB91F0BF272D7DF4D19 693BD2BD45F5308D5C9F71D78BDA39F7D2D0468E9E0548E16A2552C715F1DA8E 849AF2604E4CEF5021D4EA480E255087CE350A139F995BD23FC035EDA3DCC5EB 11FAE15DAD4CE711E12507A630445632FEC5BD2C35CA0F6894A168366207846D 570ADC67DB3BF684C15FFC064E9309F2D2CD794716995E7CB9F804F1955903E6 77D461A24BDEF84D03B167AAF05B8F86DB050D9EC43FB79C7A97AC86E32E0E82 FDC7B0EA5B8E13F09969DB412CB8CD5BC9C61205661EC3565139315DC3E67004 A4AD81E1140EAF34A51DAA72051247A64CD8A321283B05985AACAC914517CE14 AD6324E598C38FF0ECFE3B8DB05D9F6EB6B3C0471C34AC1CF8D9A6380B9D23E4 5A372AD76BEAE61C808DA495B7312F322BAE0C52A312485E4569DF0B8C0D365B 2E9C813851C10F0AAB4ADFF3A6A2B2 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMSY6 %!PS-AdobeFont-1.1: CMSY6 1.0 %%CreationDate: 1991 Aug 15 07:21:34 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.0) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMSY6) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle -14.035 def /isFixedPitch false def end readonly def /FontName /CMSY6 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 3 /asteriskmath put readonly def /FontBBox{-4 -948 1329 786}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052F09F9C8ADE9D907C058B87E9B6964 7D53359E51216774A4EAA1E2B58EC3176BD1184A633B951372B4198D4E8C5EF4 A213ACB58AA0A658908035BF2ED8531779838A960DFE2B27EA49C37156989C85 E21B3ABF72E39A89232CD9F4237FC80C9E64E8425AA3BEF7DED60B122A52922A 221A37D9A807DD01161779DDE7D5FC1B2109839E5B52DFB7605D7BA557CC35D6 49F6EB651B83771034BA0C39DB8D426A24543EF4529E2D939125B5157482688E 9045C2242F4AFA4C489D975C029177CD6497EACD181FF151A45F521A4C4043C2 1F3E76EF5B3291A941583E27DFC68B9211105827590393ABFB8AA4D1623D1761 6AC0DF1D3154B0277BE821712BE7B33385E7A4105E8F3370F981B8FE9E3CF3E0 007B8C9F2D934F24D591C330487DDF179CECEC5258C47E4B32538F948AB00673 F9D549C971B0822056B339600FC1E3A5E51844CC8A75B857F15E7276260ED115 C5FD550F53CE5583743B50B0F9B7C4F836DEF7499F439A6EBE9BF559D2EE0571 CE54AEC463244B0F8EAB9E96CB18BD39259CC1FEC10F47FB56A38588CE634209 8F77258607212EE1DCA4F0667B152875B2CF5AC44B930B888ACD9D4B55662542 71239286D82E14CAABE7276AB199E2429C4C3BC32713106A10F5F16C8045A580 86EE21E7783B70FAE03D8D47B5AA13A881D478232DD65DBCD1EB9811C440E362 527EF73FC86FE664ACED80DCD6806CFD932BDEE102B89C22F423992249FC2273 F39C59AEF75B2088527AA973C71A6B134D26EF1ABAB75721971A0E4E52639DA9 2E1C3B2A6FB552CA834F6443E0628DD9CE69E92DA0B9B8ACAF3641FA0A7F1126 8DF8803E683ACCCCDE88C9F6C1838BCE7E8B56A0BC8C5F0300D81479A5087FFD B8B66527B87F7977C31A54E0506C6D33EBC902841AB7B8D75BC8ADE5397905EF BCB96AE4B57D308DCF0F74A93177F2DDF3486642A43834DB5B123CFA402E4BA1 6EB4C27AF21C96932E05B79CF951354FF66668C6503CA6FD2089A91A8D 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMR10 %!PS-AdobeFont-1.1: CMR10 1.00B %%CreationDate: 1992 Feb 19 19:54:52 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.00B) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMR10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle 0 def /isFixedPitch false def end readonly def /FontName /CMR10 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 11 /ff put dup 12 /fi put dup 13 /fl put dup 14 /ffi put dup 33 /exclam put dup 34 /quotedblright put dup 35 /numbersign put dup 36 /dollar put dup 38 /ampersand put dup 39 /quoteright put dup 40 /parenleft put dup 41 /parenright put dup 42 /asterisk put dup 43 /plus put dup 44 /comma put dup 45 /hyphen put dup 46 /period put dup 47 /slash put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 56 /eight put dup 57 /nine put dup 58 /colon put dup 59 /semicolon put dup 61 /equal put dup 63 /question put dup 64 /at put dup 65 /A put dup 66 /B put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 71 /G put dup 72 /H put dup 73 /I put dup 74 /J put dup 75 /K put dup 76 /L put dup 77 /M put dup 78 /N put dup 79 /O put dup 80 /P put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 86 /V put dup 87 /W put dup 88 /X put dup 89 /Y put dup 90 /Z put dup 91 /bracketleft put dup 92 /quotedblleft put dup 93 /bracketright put dup 96 /quoteleft put dup 97 /a put dup 98 /b put dup 99 /c put dup 100 /d put dup 101 /e put dup 102 /f put dup 103 /g put dup 104 /h put dup 105 /i put dup 106 /j put dup 107 /k put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 113 /q put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 118 /v put dup 119 /w put dup 120 /x put dup 121 /y put dup 122 /z put dup 123 /endash put readonly def /FontBBox{-251 -250 1009 969}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891 016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171 9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758 469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8 2BDBF16FBC7512FAA308A093FE5CF7158F1163BC1F3352E22A1452E73FECA8A4 87100FB1FFC4C8AF409B2067537220E605DA0852CA49839E1386AF9D7A1A455F D1F017CE45884D76EF2CB9BC5821FD25365DDEA6E45F332B5F68A44AD8A530F0 92A36FAC8D27F9087AFEEA2096F839A2BC4B937F24E080EF7C0F9374A18D565C 295A05210DB96A23175AC59A9BD0147A310EF49C551A417E0A22703F94FF7B75 409A5D417DA6730A69E310FA6A4229FC7E4F620B0FC4C63C50E99E179EB51E4C 4BC45217722F1E8E40F1E1428E792EAFE05C5A50D38C52114DFCD24D54027CBF 2512DD116F0463DE4052A7AD53B641A27E81E481947884CE35661B49153FA19E 0A2A860C7B61558671303DE6AE06A80E4E450E17067676E6BBB42A9A24ACBC3E B0CA7B7A3BFEA84FED39CCFB6D545BB2BCC49E5E16976407AB9D94556CD4F008 24EF579B6800B6DC3AAF840B3FC6822872368E3B4274DD06CA36AF8F6346C11B 43C772CC242F3B212C4BD7018D71A1A74C9A94ED0093A5FB6557F4E0751047AF D72098ECA301B8AE68110F983796E581F106144951DF5B750432A230FDA3B575 5A38B5E7972AABC12306A01A99FCF8189D71B8DBF49550BAEA9CF1B97CBFC7CC 96498ECC938B1A1710B670657DE923A659DB8757147B140A48067328E7E3F9C3 7D1888B284904301450CE0BC15EEEA00E48CCD6388F3FC3BEFD8D9C400015B65 0F2F536D035626B1FF0A69D732C7A1836D635C30C06BED4327737029E5BA5830 B9E88A4024C3326AD2F34F47B54739B48825AD6699F7D117EA4C4AEC4440BF6D AA0099DEFD326235965C63647921828BF269ECC87A2B1C8CAD6C78B6E561B007 97BE2BC7CA32B4534075F6491BE959D1F635463E71679E527F4F456F774B2AF8 FEF3D8C63B2F8B99FE0F73BA44B3CF15A613471EA3C7A1CD783D3EB41F4ACEE5 20759B6A4C4466E2D80EF7C7866BAD06E5DF0434D2C607FC82C9EBD4D8902EE4 0A7617C3AEACCB7CCE00319D0677AA6DB7E0250B51908F966977BD8C8D07FDBD F4D058444E7D7D91788DEA997CBE0545902E67194B7BA3CD0BF454FCA60B9A20 3E6BB526D2D5B5321EE18DD2A0B15E53BCB8E3E01067B30ED2DD2CB9B06D3122 A737435305D42DE9C6B614926BFD44DF10D14402EBEDFF0B144B1C9BD22D7379 5262FEEAFE31C8A721C2D46AA00C10681BA9970D09F1EA4FA77428025D4059BA 2988AC2E3D7246BAAAFB89745F0E38580546045527C8779A254DB08DCC6FB9B9 0E172209FBE3857AF495A7F2B34BC893D942C145C2204CFCD6A5C69FEFC25B60 E412CB2BEAE7F7FAD03AF46344F6A7D483BBB1E896BF16B0F4C363799DF23CE2 E8127996DE841B6F9D8A9E56BD799B6A938582988AF87151BB8D3AEA85C49857 DD862B5E10D9F33D57795D656FB616BC9B8397B3612131A2B0F472656700958F 739A548F7C3A348698AF9F6F9821D7A9FD4131781ACBF7EAB885A3AC254DBF94 02FA697941A0F97F048861788BEACC20DE829764413CA58F9D045A6B38BCD6E6 E4827247EDF1171F64E3B041A69B244308DC07F66643FCD7D5FD37F36EC4CB5F 957D4ADAF91850A3B1A765E0E580EDC77556593D1B2E1C22685268469298688A 45C474C9D0472D019CE1E83F25182D084AD85A49C502E8D679C227DA8E32045F 8055D1622C478F8FDA342685F858DE3F53F1CEA0D70BF54A4B35884FD75D8B36 E54B9393BDC9E020D16B0C20E943CF4E22C0380840DC7628B70C3CE570EE2060 34708F5531EA5E286384292A5BD0E04ABD1165CDDF8C0ED8899A82F64D2C2DD9 90C50E0FD6180D25ED5EF2746914E41E859EDE14FE652EBC40BA85F56F625947 805E6854520522135276AA0AB3956E65553012A51DBA92C0BE18D9A974109FCC 24F2F7EADBEADF14359BB85A0516BF482639761B7C4134B68E863A71DC8C76A8 F7DA8AD952F9428B6B492FD55D800C3FF266774D9807C268FE482333BC9B70FB C55DE4418DC3AB396B4150C4774E01A035DC2EF956FC2A0BD0BFCFDADDCFA8E8 299D6610014F4A73D5641A82528DD45935EAF72CFBB6C95CE320FD5EBE8A9F7A 2BFF5C3A5EEDBAE186F86B95AC394FEA62EC3A756E5DA7AFF8145444A7D632BF F8F6B211BD2D7E4A5A56B235C3912249F53683F9A12AC5E8AEE324000781157E 739C254AD437934D7B83ACDC2D5D7E6779EB15BECAA10B662A8B8A1CC0D6CA60 FEC9AE92613561A80ECB2AEEA335B5BDE2EE3FFFDA3D144DE40B82F93664F07A 7265281680C3153A10DC16C13A3715BAAEE70345F509661D04FE872F66420B6A FD94B36FB9565C4BEF9EDC71B0CFF58437FC06ECA3B15B875AC3690F0D2E596A 55C05FBA3B348B097C1453F27CD6AFD2CA38D3A6002A0ABC3655AC52EC9207D5 6B74AF8B9931BEC0C18E2F1BFD273293AB3593D553A0194D694C4E7036D98DD4 CF5A800D9E729515FF910E63CB3E1060D7F7562F79FE18D45CA52FCE85DA9039 5C414211F00A20DEA60B26994B05D9F5DF57D97EF5086824B4A074C78BF7F845 9C92908BA9F903BEB71D0F70249D69B1A75759225143C842566C031A2D15FF07 2EAB20883AFF604886616903D8B95293F48C1A821C5F2096E88C7CC13EDFFEE6 B0992152E4D6625C612511EE6254D9154E1B7EEB4C64CA40BC6C5BBB3584D7AB 06A2D217BC95F8514FF2FFF8F1D31069E6DD6C215ED4AEA0FBB275161353D2BB 9148067B9C1C0DAEF86F43E907E2BFDBA15788EB4851AFA5900FDBEAC07EF37C F5117A1EDDD3F2C318B7AD11E4813F28E202202AB4B6041138EB93B973E2630F 9FB42C8AE50B8E22CD0A649BD154E965D6F0C378C721FDA4336DFF873BA9EFD9 70D180CACD57A935D5A2053CB80CD378046DCA9C33326BBA1565665D666894DB AC59A68F5A8779738BF5905482D37C304618365B90D8F2425101151993C08F26 B3FBD83D88FE9F5B599CE1D81D10A8E7329409771993331C65FEB8F8C9318B2B 06734219028EC64B67DA6C9EE1EE60DA0E98B762E788D9A670CEC85B1B3111D7 0491C6170259A4644A5B6B31F3C0DC0FFFED687B4D662BE20EDF460636729D16 DCADF1E56B9C92CF29A1BACFB5BF3399A7D8D26C459FED717712065843163C55 516DDEFDFE83E65794C4978393950E703FA69A86987DB4985C4358A52C1654F5 0C8157DD644FB4933CEF46D76F7CD1FC00261C538DDB6650782C98EF66AE0C7B 5DD6CBFC9B1D928F789BAEDE464A3D24548FCE78E1E9C0623B265D8387D2AF84 B95633228DF728614C79AC5C4E311759EAAF4963AE31009BB3543057FB921994 C6E3398260E44A36093277A0926A2A896AD272745C95CADB395EB062B597BCDC E9DEC016EB1BD5DDFA1BA1D1AE892E1FD36E2621716AB74976AD19C95343AC17 7E3B43388419EE16356F1F27FAB39B8B61E0CD78EC781C0A4FFE5376B3DC2728 66B51B26F2E598AE017DB1D3BFCAE34D526FF09DBBB0290C579AE1634EE91A1B 9080E9FC10CC70A925F9AFDC45CE2F14B682AEF58D40319B3FCA0C11D5FD51BF 14C2444E41A92312861C35A4046FF806F01819466244DA99A92C40268E4F0ECE 55981D227074FE1FA9970C21DDF336E901B67DB28CCD3B39F1A7B9F96FCF3379 3336D67B9054C7A8B70F54EFE987915AE2EB57A91126FA770C600EF56B3921B5 14A2754A01319C568882C984D2C383E60FFF9173C172761469BFD19808890843 451E381498EF49EA8B16E5475C932E0311202224194D14DD30A243FEEF7345D4 BF288C6E2B81F4E69224275F2422337BE9A1F794C9BD5A6518EAA88D8524F631 99CD511EA841A35E2EEE8AA366C8A83E2C97CF4A7D71C4CF6BB5F0A60A27FD32 38C860BBD86CEC4250BC156FB8C21B6DB40E627CD537602484E52259DA98E315 605BB00E57E58EFD5C73FB9B2A6410CA3F0E04D3CADA88BD06EB548151DB4956 081E3FBA9551DF06C51273CC8C54E3578C0A345309C2D45F7B6F6DECC9437169 14CDFB887CFF01A102BE870E653961F95483184DF4F23BB6A5E248B18DB2647D 60B3651467CA2BF2A4A2D0AFF286E23A90439FC6CF8FD2C8753EDB90EFF684FA 41FA29F8B2E0B3A27AD75C2001F32FECD8A10973919F3D0C1BC0C9E5EC63D862 5CA28C834B502D01B4CC0731E2043E759A23BEAAB499A032AF9E6804EDF54064 843BCB48501F7EA6C7FA3560A125DA0D737AFD1B95B1DA2F3B750D3051A4F4A0 E53997F0AD82FA4B6B9D74C89DABA8E58C6C00D0439CC48C948EB359A08819D0 48C7D4CD5E25E9E12F6AB3B29FDB31DB521DD21405CA3DF6383F3E056B4FBEDF E12CECB2E3F2107E834A7D97345B55069A9ADBA55A33501F16C426D6ECD3DC89 CF6506A13DB053F87FBA8C4EE8ED91B41879B0422FC897DB3BDEA8CB43DA0358 048997B7A29E967EECF2CC9B72D5F17C5233787DC1D8C622F758DD294D329533 D429D8BC22D8FB3D70AF1A9B56CEA7A99C9425E769AE254B14F243808BA07166 FD066C320202B682AD3E355E351E3A85F1F7CCB4206DED1E073D275A3AE42DF3 282E4556F4D9699BF08243AEA49E49B46C4F6DD498BD95051B5ECACFD7F9E24F C68D7F1129B32A9A8A6105B90D0A13525610780A306D3D08FEA04006EB0D25A0 A0221A02FA7CCD653FFC8A4681E61E119DFBE38F586465DB76E4E448831B4909 C159F6FAACD08EE361DBA21F0562D64FFEF7119343F756DDA0BFDF02D0D522CB 3AAB2050B1AE27D54AA650AA491476766FD9629FBBF8289D43C3EE1EEAF95274 1F211E8BA70CE9E05625BDDA24D9E223D6C61EFEB1630DB948759EB7A4C47DBE 510253CF41BBDD251E3313428C15F8CFA4D91C1B3F3DC222B4A1F59FE1DB20B4 00CFC1130449B672D9BEE105B668BBAD1ABC7DB1D178B3452398F3D5F744E610 5CABB91FC124609C46223554694C982FBB3DF11E7EC223D49796ED707DB63D8D 0EB76516EF6337BBE1C0DF28165736D101433C1AEC5CC5E0506D10B526CA9895 DA3212C6CA69C4E22F3C4EEA3A8BEF8784F4AE2834DD1B0CCEC94E9F558AFE07 3C55181A3DD4B59D66E74077F08A936482664A9788573B4F52D1F83B4B9569BB 1F4CD6047483AD6CC99997D934C437C8F331513C2954368BEEB76F0B9813ED45 6F99BBEE05502EE9CFF20194E5C80DDF2D54AE35400DC46B8EB305B2B1FAA969 0D50193138997801200C9CB2C01DA51131219686AFC5061FD07D65A0A48B679C B53999377CC8D41E5B01166137D0089F7528BA27D956BAE5E2287C5BA4B0A0D1 624CC04BC099FB64C7488BE0A59AEA1897896424A178943EC2DBE462F06273E1 A7D820E895B2139C33A508DBEB9D5DA3DB0B9F386871CA37C2ECD3968FD273DD 3D4D2E44549C2C5A071599627685D416A58EE6F3451E0062123131FCEDF49477 94B0D48AE7272952CB3FE673B1894BA6A3DF9D5513577E4F45C339E68EF964F8 CCA0678E74DA23FFA685812BF4DA30FDBFDA2934CA99292CFCF7EC8823834D1D 57105CF20BC4F51BC677C204038E35AE858B95C8F18613B610DAD20D58F5A7F7 32A339FBF48E60ABE863B5DC39F18CF214CB3B9394D02B5F0E0116EF923F4386 CDBC71A65E88B340B961D78EDBD2188F7378441C1595A9372B3E4A9F3987B1C0 09118E50F4507807077B0712C75C07AD8D79A4E1F372FA47E1D2C16D52BDE1E9 6D5DC79007B6EC2B54CF2DCB26C391A49355050DA57C1FFD90930D63811D78FE 4106E9D8EF7F019AC306B021BC73ECEE85813DBC2E5142C11C414087C11D044F 642920B7102ECFF2D43C0E2965CBAF13104C293B106C2721190372BD666CDD17 5A506CF6C991A9912C213D2FB1321C186FEA1F62DB678B80C948ACB252D364F3 92FD93099D65209786CAFFD0380BB432D9023122ABFE579B71224BD99E5C6929 44164CB829C4796774FED8C762B19C327AFF66606620D7651D32224FD5BEAAA1 40711364D630C023C94AF8D959692A5E973A69E7074A0BA92B52D2BCDDD9A8B4 311601A7407695F370F55E951D4873B8B7864DEB94C591A682393A519676D415 C9D48CF9BB5919CDE4FFEDE5EBE1E31C19B963FB3E4514C97227E772868B7E78 2DD1F64B8A1A59F5270035D286EA7A8A2E9819C5D2EA09F4710F662B32F56125 5A74841A8BC247977AB2DA5A870A24936CA3584CE542E281F0914CD9F58E141A BE8E434304666063BB6521C944B1AE674B623A7155A813FC624359E229E4F24E A7A8C08255B220A300A52ADB791F8A44D1BC46D3983677D60CC5B2A8419AEE66 7ADCD92EFFB7C3BC90410947CA4F9E8292FF2B72ED99D220AD00E2DBB8CBEA25 C000E01C497F94746C68C3C0CD040FB12D59AD7E9CAEB9B63510C56732312C39 AEC21A76E6A16BA4A7A3BA0C1DCDC25ACE7FAE968AB6FF1749D3B0D32BAA78C1 AE9997EF7ADDAF34A9FE3BE747EB44CCC1975F004A053B686BE11889A802CDC1 D2176AAAB3CD0BE0AA56235524D691978A4D4D4080F1F66819DF8324DECB0EFC 264E10E60690E31AFE1E41DFCDFF8533E8ECA0CDE4A399354B055BBCA4032B19 C607B196BC1A1E5A337D4E7FBD723AF1D6A288277EC83A7FF297727DA311FD4F 667ECE9C649A43A6C3863035EF823E71DDBE22DDC00416B3B1857D4C54ED15FC 664ABBD089B1ED429710815DB71927311E2CB28F2DD32AC556C4774FAC84FBBC 8B02D9D5362AAF3D2BA23E9A407763386F94B19C5AC87EDE226D8FF2FD44527D 4C930CF193CFD628D4A611E178F66DD1548B4EDAC700618259406D0D5083484B 41CA554BB87DA00D1764A502807D3C489E56CED505518F73099C9B5E5FA9537C 13F20C4A83931C9A3143E90ADD4E72DBC5006017ABCA949F2EE79138BA6782AD 2A5ECEC5746402681EE1977BB077BB1BC68A8A63E677C602197530EC172EBAA0 FA8131A5FC6F10E6994D7E623D77F4EA5A61E3CB66613A212E2947F63E49E94D 1E612EC3A99FF6A604F3AE1218C5ABFF453026269307061E5FC9CF1250CD45D3 636965F97AE53FF8F8330C6FB1D7721EB3A071E145A2154D31409CACF1C560C4 F898358C4AA08E456178C3E7CF59A83EA098657D8253E64819E5F6E5BE5851B3 AD9109EEC894F8DEFE366C4C9C16781DE0E14B1D51424B6ED025C91DB0FEAD34 930E47F9C11D6B50814AB6109019F20A6D030ADABF57E8EF567F718CFDD9AB3C EC02AE3EA1D1E84BA84CE1A505AD35BFD762F2E12E24CDDF4DC9A0C49AE2B91D 149A89B8279DB8474CE8E1B24C257EE32DC5CF94580131A57B80167E901A057C F1236233EE28368B160196FFF63AE7D42737EA6DCD90C9158D7AC59F399654DE 7034546051E2E5F9AD18B292FABE9556BDC152DD842922CC182F09B65F6D464E 9C50218E2ED2F1FFEE92B14963D06CEBA5AFD9A0A75441B09AA87AF2B4D253F6 340E831087DD7552A5322A3375D0BF870A773D36082AC8D0A0AE309D4E8DF387 26B7767EC42002A9D4EC80A5FCDEB57EBB86A4AD383C1BF85E873DCB73A7DCDE 077745D63CABC0B737550828F7C789470B358586C04395740DE69EBBA502CC2C A79EE29EA969D1986C9C55878E70320ABC50E46DF6362DCD9FAC8A4CE9CD95F4 9041D407809C25F4FDF04EB59BC9F008B34364EBF30BFAB3D2B965A892B9594F CBDDBB718C2D403BF678F998ABD78DAC10AC02D71AE1755DE8DD47CD8B06C0E1 0062A6C1FB2322BE6A26F86CB3A9C9EC950E37BC711D4F32BC878F2801485309 94FFFB772AD0167EC95AABDF0B82CC96FAC9CF45580638CAE52FF27A5853F6DF 13939DF00240882C9AF2DA83D08ECF7A6A40BBBCAB4D9E81700ADC65361E1736 DC0B4D69B52B9BB481061E06FD261EF05D22A1CCFDF59DC63779B4FCE6FBF25D 1243D54B3337D1EFB8F6C68C7CA33EA2392B5C034F514378BCA88CE84AB0C586 F6940D0DCFD14249733A8D4EEC25D494B41EB76F8944B6591A1D69F42A9064A4 4BA19CA154EF1850A4AE3E7F52E6CBC2B6A948740154E159FBB036A21069D105 03C2BD76B5D4930FF4B55593A282071015A7B9C739CB7FD6465AB557DDEF6763 F120F93EA6FAFD06FC2CDD1445A77C43C1F4B765538BF0440CC4C57A97FAF64D 1FADC38AD58E260EF5677ABA6D56A1F0D05639EA526EC7CE1F427CAB2B95AE97 9AB54683F08D3EAA25A9077A9E20162E62E0A32EA3BB577E77DEFDCD7117B53A E891E4A63DB284C45571E82AAE871580CE240E76FF8E0984B31BF119660CF391 41B6DC288A6A171F5270D2E3B0F64373DF64F472B02B7231F0DFD334B1355919 C1C489E2DBC11A2663A173713A6D220A5B25D34F15788640AFE26A9704AF2CFB F839E74BCDB0EF554049319B271BDCB736D775491FAF0D9FABD77E1250DF0AE2 084693EFC96A234331EF04EB85B976DD77AE513507B6669F6FD4BF5FA64E22A1 45A9894ED778FCDF3FE72AFDABE83F7D7E648FB8EC7FF219823088ABCE39211F 8DDB2FFF4793DF5FCDB25183D800ED0357AF5EEA5823CEFA7BC8A99248F91C71 EF0B218ACC2FF17E59C41DBBBF24312A92793829DE450A962033F5EC81F75E6B 9CE808EA804882618F4BB84D241C3E69FBAA333B540132B0466EBFA4B15D8ECA 445B2C013268E00AF58A33B05D6A8FC6931EBA68A5D1EB19BDEB8D6A13D75FC9 8F80ADD36DDAAF016C6E7F60B6726FDD9A9EE8BD042AB26C9E7BFB513FB16198 54566D34BED609703AF75C92D68081B40EDDD8F150CFB6E0A7EFA3A04502A04C C07ECF2136F294A0F9066A2F84C739F1A821FC202E3CBC6D8BFDD4D98C51753F 6400E1A38E91A628710BF3016933910A65913FCCB32E80A422F1432E0DC07145 D519A159053719183BA4AD772F708F86B4074DBE9E2A7DBB7EDA7A707CDDDF16 A4ED69D6A90DF8DB09E06917BE7BF1FAFA8148B2D4DF39C418F81166A0EF337D 78891C561FA087193CFA1D31C2DC7393F6A10786E09A7EDC0018D370071C3EDB BFB42B40AF7199F5CB901CDEFBCAF011ECEC8E390D372CE5D4EA30DDA53CB86B E69B1EC8DE69E84F5F3BABE2632576E7912831836E36DF7AFD3C7794009903E9 D6C0DE85044C3A69AFD7488F586C47B064DC3CEB8BB395FCCC3CF217F4C92CED 3014B8F8ED0D2B38FE1555CE4F026AEE85E4A31E657D8818034E5ABFBED828D8 7FE0E372F506E4EB3A539E738AF1FA5EDC1183C80170023E86AB36B7FFCA23B9 6CB86A39E4F57A3B9E4CC725F13C2C54B8A3E640328B8C0CEA0F95DA5288B615 F068DA3668272764C0CD9347DC0DD834D0D9259AEAB049E7BE906878FDA12C29 47F00E7825BE00DE8CFD5678EA7AE1726F5D665C8F5AE7318A4B65BACB0E8599 6E91BD9406898E88C2C524253A61AB8025DC8A873C53340F3D531718ACFF3218 DB61F8C4D321A343EF919657ACC0CF23AA411799D9DA0BBED27FBCA58B5EC49B 2D00F6B179C72141ECC41626BE0EBB55771546553FC052A858FC06987F5C3E7F 7076838EB3E284D00A5D394083C61CED195B0B7C9B8007C8A6A347EE98261AA9 644CABD5693D277241F3F6FE0ED9B661226F191E8DAADF48E15C63A2BD64B33F A0B5A8BD0AEDD3608ACE5E3F7038DAF3F9BAB659DD2EA4CD13CADAC984DCB03C 0B8D848666D54D21C788F95B400CF6EC834594C8275F51C941A1F5687D5A427E 5E9A93EAAD048F5D141778BFA3792EED2B0B3C37D06605BFA91FE8271CEDC1DD 1E8F3C374AA4BA92F2C9521D87AE6DA5D7791F38ADA438ACFCE4365229930215 894690C75D27BAD65579C588C2872FD26D49FFA96F7937E6FEB5A3820C1AB38B 574C86F272FF25EB6E70BD944635B186DE2AD84A74AE8FF76BCF22B01FB11343 CFB142CA4C3B0068F7215BA640766B2716BF3DF57D830D7AD9B00B39C998ADAE 436FC8B9730151A9C5D080EF2E41171EEB56E9F35A2EEEDD5481349D9AAA1E91 1C10F45F5E5BAC3592326EC5BB841DC70706455954F9827D987158AB480FF3AC 34C0410A9D1CAEC8C6B62A79AC582A75078E63A164387D23E076C54F4471BD88 0248CBD81A2FFAB7926F415E2B237694167BACADA7A71D9017D3200D2874D22D A2129B24F936F750ED529DA69A1A8F6F057338DB2209F221D03F22B383ED29B1 DD71FC1C5036997C0C879E78B542F3918003A7B55370288216F15DB91FE7578E 8C8CFA8E6BFF32C57ED566ADFEF0197826F073D45AF8580BF6B4DCC3F5856F44 2428C6450D2B471F6E1A67C511DD94DAB9273A506D7109DCB33888B76D2F2257 DC6DF167457BDD003DDAB6F3FC1C1121E4E59550A950FD4F713A2AA7CBE97941 5D78F7F17EB30A5CA883D17642E2334D7194A80961F0E2C26091360B805B4CC1 6CD14A722C1A144BBF7FC4061E417148C1E9B750CA0E18EE05485FFF19545794 311472B0EF215EABF1E7A8681CA71FD43FB0301A859CEAC0361B3E0C41736C53 7A9F938B39070AA29F9EA5A7C9219EDBDFA2E9132BF0E49B670057FB23B86B9B B3CC7C0FD12EB309DCF8D1D5967C235CFBCF541B5C191DA128D1DA4BEB088BDC B6ED683BDE7EE18598B9B2B1D233F26693A66B3FC2285444721107C7313F7FB3 201905B38DE3BFED9BA661AD4A3D940C6BFF8A74807F4A6D8348A6246D2CB9F1 D3E4DDE6D7460EDA0026E919EBD0E7305F66FA37D2C7EAFA415E67BE00399C5F 4BFF7851DC10B44A696B2F0952007736416CA5F02D8DF73B60BA764D2C1E978D 3F4DEE50CB7764FF586D1B719E726734625984657FE810FEA022CBFD09F16487 E6033B38A1E111F73B8566E60145A6E6D76E98CBD3F2F70692266012C9204A73 309578178217A109DCAFE3747AE4DDF549737B4DC9647A56D9D3A399663BC417 D83D252E7407E60270D2F592127B5DF30603482F1C17E20F2BFDB2B29E17E55B 100DF6F1E76963B086FF0729AEFEEE7B1283516C6254F0B54B3AE11E456ABF79 9E09F2D983E2F7CD3D056926DDF26E5A6B7E003029536DCB2FDB0BEBB6878448 444EE80334344CA7E42B5371E7C632EF9BFEE36AE2E22E713E7EA69BB2C8B4C3 B5E204981EC1DA73A72E0B0A26406E904DB16DE7303606D4D5F3538E095F5BC2 06917400DD909F3D880F5E6A07B0ADF0E61352872D4A52FC3C8D18293A4B2F94 5D32030E7B925B951F5FE050335123BC96BB5C8D6B6B9C7DBE7C049516854637 82AED9C2D708A8A8137F59F099A7BAF3254E4ADFC81CEFBA89D6C0D11C9A7B10 2F19ED50BCD3521AAB052185BC45EF2F2BDA547C57688219D038D1E5458B2877 7B20CEA17D4EFC5EBEFA32B99AA1BE19FD7AD6255F7E12450DA48C3A7947E5CA 95CADBCF440B38212FF36A840AD4BEF61438F4C08611C2919C1DEBE0B916887F CCF3918EEA989BF0F15FBA52906DA77BD57BA0CCCDE6CFCDAC76A75503040BF9 9728DAEAE729F7DAF8E7511C5F92C10DB4764421F8D968612FE1E01AEB35B067 2CC2D5D1386C0666885750E9F04E1A0407157F60FFE84E585A36714C844A6386 09EC06111CBDA2F6C561694D409D93933EF5A0E25FD7D2BF5A1E5267BD9267B0 151FF2A06D7B7085B8016DD4943AEF5A3274F0828E22CC6C9E68BF182CE6D474 3274F74E64565BF8E64FE4AFD4C98F05487C31A249D5C90F94F9CAC398B2F496 15CC249D62F0C9B9B9F71AD29479E69D5B449D2564802D6576C7584368381F36 E3C22F01AAAFC85D22617D6F6A4E598FA8DF1FACD4C7F205E88026D12F7C509E 38D29C65141EB2D397797FCDA3D2F54651F70FC52E8F4E12C5AA200495825FEB 54855AE33A8ABB57E61394902CAABFD06D42BD1ACA57DD9B81614CD44C822A55 88EBFD1DD771EFD92876B60131D4B86D3617863A1399A8CC1F2FE9EB1AC4C614 1989A0E2960CD5F830D33CE422D5BC52BD7DEE31D2C668E65ADE9220206136D5 7696FA00C4857CBBCE675A0B163AA73EC04A75598D18D82422A54FCA9A27CEE1 B922A0F52968D27616667F660EA1B5BD3BF25519E391FF9958D4A491A9308854 967312DB3174EA973FB5052ED4274F449F3D579EE90B54188F910AC3C69655A1 FBE9E3D09FB0233E3C7A80EEFE4FEDE817A7AFAFFC84E1D48F6E70C41D0226AC 31F46F7B29E99B562E9C4AEC9CF4558321DA229C3A7738B0CAF03C93EE489A2D 72458368E300FE0BCDEF04E7EDA685BEDCCE622C59EA429DDD81356BDB22E830 F65C8904824135F82A1A524C317153B103A0BC804FD186FEBED4AFCE8706EB4F 32DBD3BF2F40C5DF5B85E324D8C140D47F4D2E2DF2304424C327C6D12EE63E15 27BD4EDF53E355AE9A58A4AE77525B70DAA373CE7968CE286967B43F685C267E 7972594FD36DE1E0989111A30F43AF8B63EDAE180502A0D5873029770764B933 F7E43DF0B70A0DEC500AD685A57399DB8433BC975A90B0707C8BCD466D7C657B EC0D58E7CA755BF41D684CBF75D1941DCC4BACCDB5D0E1C0855E8C4C368E535B 327290B67D8CF7E12A2460E6294943BDD6E9BF9CF5A6AF70AD1B96BB33C70195 56AEAE0B1DABB09485C282D79C30517BC34583D16FD2B268F024E0D9654AAF3B 3D8AB3496E7D0622D0455BF82C2BFDE912500E6D5DBBD9546D54362922C9A46C B6D7A01363AF3699466875A416CCA72F97DD327264B3EA16BBBF7E088B47216F 626FEF9AD1034AB0CA82099509C9AF9B70599929CE3D21F612CD40577E9CB7AB A4A79A15A0B03A8B90A424B64E7414196B72ECC9D2632B4D7586700D495DDC0D 367F415737612CB6BA03D726004F8D49B2C5E155464B826349470D9499B60DF7 84764156762F2E38B9440CCE89A9555DB43328B59ED6AE0E53B015492D2455D5 C66E4DB65871164547C34E5D41FC3B9D5440E8D6B7B6E09FCF916BE674A43E36 6FA7A912481905177D896EC126DA80E125ABD27B9BD6D81B474F909DC8590571 6A815BB1F27853BC47EDE4718950C3702A9D27C28D3A0FE73381445B60BB1887 DE62F57BE2E473B1263877A11D766945ACD5310C4B9D2EDBDB5D3DA070814969 7F086E8EF24920F37A23FD09CFDE87F854808DA8FE7E5F2E54BC13CB936D498A 5CE1A7202EABF663BBA01BDBB0B479264BDE90A30543B7CFB8887B52D0F28BD7 8DB8A8438418D50BA775EA58624DE3055B394A9B7D31E268B45E4BE6304C3B3D CB9DDFBF78ACEB72082F2895B99AF925421472DDDCD0C2846E945797284FB405 74A05BE373C99648D46F0911A984AF9F726F28BE6534E2D1838FA129E508F81F B4490FC684E446659151B446B13331D0542223D0F7609A8925808F16E9992FCE 42983CDFDA4C8F3BA175E47F630534B706A3BC38CB3AD3D4AE304EFB9C00BEB2 A830A35B2FFC25F6BA978C28AC71B875C25A7808EC8A5BF619673CF8B8518368 852BC0AB7ADF6CC29D7CF4C31F0D606267DA15469DBFF23DEF654384E6074A55 A5AD235991F25EFB4973E03CC19305EDCF3B46314F1584B7216366C324D1D182 8CB2F48B836CBA52042005C67951904FE2889BEE51B90973202E6280FE134F80 C0EE88917639F293EA1840DE5D654665D5B38FD57B89B3807714FCD9A2510B03 4CFFB3DC6BDB2E5427FC725A91551F2615A5A9C1FD625FAD049CDF42AAF1F98D 9B6E9C29A1C35B51D14608DDECD76BDE9AD08F4D14B3BAAFB4ADE2B2D24E833D 9B520976E1345FDCAEB2FC5A6A7A47DB0EEDC35B0AC9B143C7066DAC1A9F1A3A 6759FCA1AFF0C9C14D7134EDC9AB838DB1A854C10309E456F8571B9DC87EE342 C1B703FFF292EEE81C043C6ABC32F31802981E734B15FA87A6BAA95FD4D4D9E0 7896ED06ED4A60DE13A62CB6C7190AA73D9520AFA10A6827E45BC35F4AE730C5 AD837CEE455989A3EF8B5920A4278082C7CA8582594231614029D6D084474864 3D96D86A4F31E258A49C4771262A64F7445B20E159C024D7A40B623D565A5CCD E4AC3E832F95BB8BA3B9FBBADA1A9DC928035B9FD5D81681362FC7F5E9004050 6538F992ECC8CC0F9A468621546153BB29ABE17CFB7FF412EB4FF42A4E6438A4 01F4D4C6264B4B815572E90327646FE756DAC90C9AB78402F791CB2669AC60F8 39F7902B6A95BD4EF3041C631D37E939518EE97E9B2E52BAB3BA8F2A26C8A9FB EBCE5C7306A617104C0D0C74A4FE03B94390A393498C1619932CC3EE1650404F AB16E40CD3B4870C9F687D11DDAE5C15B0AD50C727B34DED6C37925F1798FA5D 8AA565ABF2D368242F2985EDC4E299E5F93DB82656BBFDA364E2FAEA9893AC3C DDA311C7D6ABC7CA6C759C5DD2DEF44C675F7538EF35AAA5503BC12F311A1058 8DB47F91E9B56CDA671EFDDBFF09AE3D75E30272CA099A7DDEF518DF908687F4 BBBACDF9486E3FAB7B909199A258B6CA6E3B64F30EB8F6F907E7239F0BB4339B 519E733BE3239221256C20854881C6D0F9B974E1C4AE67C5E84BBC72152D7579 40036923F671F9B5C6D7BBA52C145664BC3F10B294A4BD345E019E95A7D7D93C C1DD7AF0929280D01A1AFC83D4FB0AD268502B1811F874AA648F40F5AEBCCB85 5C4C485F5B1031F3FE4B038581E9C0912CC3A877672F3889C32F72219A9A071F 7268F19AAE2F8F6FA3A02287D64E64FAB91252A1534DFD7338AFB26D3ADAA770 F89A63D3FBED4B0914D3A1D64D21864C561CF681D38ECA5AB013BC8E4A3D8E63 4FACA1387B57055E12AEB6E28330B7E679B211D108D6237215D34E8E8475FDC5 D291E6B3A00C1080923642062D15E1DC258D018F9E9138BEC0D1FFF34BEB39A9 573AB74F63651E0CBC8F12D965E255085DBBB4E8BCECCF0B4B5D58EA07C3C69B 97EBC9904E9A4E6F361635FDD544C88120AE84CCF5416E9EE6E9D534780ABF32 8A6EFCFFF3EC1F46E969E97C0F79AC02E2A0CFB7662EE288498182456452E0E3 62B24F03B95E0E70406033353FA3B0DFBB1741024E131710E3355FF2EF1848EC 26AE602D8806E44E38019F7D9865F7EE35A56082403BE5B4D3FFF0D485E5C718 389F5283C688EC02574ECE4C757CEDB01CC8596C6462E19261C6B32867ED7553 0EE2E171CA3ACD4C092AACD751F698E9B18C56FA5A9BC0A8DE405F08C9AF304D D4D481D2A1E93BEE9725025935D71408AABD74F3BAB3AAB21004155FFE19F551 E0E1B682C2F54C92F6B9ED91A38442CFACE98368AEEDA68BD8A28E91B1FAE708 6672771D26AADA36F30EB709FD01683A11B817FF646ED2C3A6FB1101913CB8CC 64C68E37148FEFDDC74F2FBDD70CD8000733D3BC44B6C787D1C7E49AC1D2E2C6 C2ECC696A9722F473EDF681863575E1FB1A54735F5C8136516AFB9A6D4E9A7AA 310A6118B3EF9349D1E96E6EB384D206DBC45B188BA8445738729DE24D48A159 80DABB850435C0A03359291C332C78C1656BE622FF734144AC17BE19D38F9F54 59CFF8FADB2D0164AFC718268AA4B94EE7CCCA7B479A0DC70D9B838D916833D3 6923D4B22126BAA2237DBC3515EEE6111F6F078C904EA4FC5EF00364455976FA E00E5D79C5B57DB1ACC73640A9E37C200A530430E0D7F899AC67F7EFB2F906D2 24722B0A9A35E7DA6571373E2BCB5DC0D5E5D1398B9BE20A2F2A5EBE0464E101 30BE52CF8C12D85B09F5DB9DEBD3ACF320DF140EC32ACACD0DA56642F44BB965 BB769C0AAA298E671A0371DD2CB06ACE542DBB79031312A482B86BE124801EF9 52D425F8F2F3B31598B93C2330E8B08BD1F6A4DB245A19B803EA947A2119DA5D 52A83D5637F85B4ACAA1373930A4674C354EA46BF19B439C764FFEB82F249514 ABE74189D9BFBDA3A8F81CA4A8DB1BF63E10AC6B5B5E0D6FF8CA45ECE9536571 A9E32433CBD5F04D2EFC1BC92D18CEC88D700121BD4923CBA73051595261307A 7B00D14A2300CF78C93EC96326C0D10E58E91A86FCAD94E1A47E34FCFC5C65BC BB7316ECBAA3E35C7D3C0814BF6A2AE8B18121BD68722CB277712D118F1CA88D 31D5EDBFD64D74318E5DA451D12F5CDD0F97258ED25157B1A0ED1994706EDED5 FF6293C9E4F20EDD1315FBE90446A5ED621B4898E4EB9F23927F9D33DFDC62B1 A38C8E7B247BE8511ABA17A2CC52D4AE3A6D7A87220FE1745620A4B3A56F3520 D718E0015A0606E4D187856647CB189D0DFCD96968890561843A9FA21DC5D508 C74D9E33F21EA57B90DFD7637128ED958AC4EE480901F96ADF4FA833143BD85A C7D0B1D132D5C000E1223CCCFCB5AC84A42052FC10113B6AA88189502B56431C 7CAD3A8DBB8D096569314ADC4236129F00A65E1C0B5EF666268AF208006F6A75 136970EAC3A2904C7426A018B751861BB6C46D4D74FDF9A162BB85546F22CF80 B7BBE9C846E8910289EEA599BCD5FF4075C30AA88F93450654EF831645D7383C CC7FEBBA9C0DDF8109581C4A85224F7C9223581FBB201951169DCA18FEE81B48 F2E916BE7E275CF75990102FFFC1DBEB859237F9AA511D4C884419E421DEA2EB 418C6A9318D45D858468323DD803918FA6497A4CE6E7FBF188A67297040712F8 FA68387D28D239AFEC749ACF53A5F72B21AF2C8DE24EDCE7230934E324AC2C89 F35E2F349E92D3927A367C942A9A685A4C28F364D7E61D2DA2604FA80C31BF40 5AC6DD6EFDD8799471B3D8890D93D451306E481CDB71C471D670369CBAB789FE EAFAAB9D94ECECD08F6C8F82BB4DF09BCB02F3E06A126E4E468F059089255F37 7488E957B2B5521A36FF62E26838E06E38719ED72D2A0C7FC560A5ADB530CF22 518CC4B715D7B6DA08217328C4A09C53AE70A7339514B56D13A2F7ECE09220D8 E2EE66CEF5E5D07B1B30BF15C3BEDE12CB52C974198C8F097C3DFC69A3AC2545 41A3913094A42F4A2BBF2CE0CEE9AD7E5A6CD79814CD5DC55C8F3A99FBA341FF 7D844AC9CB0E5BB3FED72ECDD97A8B22183EA6B9D13CDF6EC3DDA3D42515E94A CD45D8FB4CCA4DAB7138E8FC837C89C3E78C2541550F229A4AA9A836A449CA47 B2D77BAB5A7B4D53B3D2F35530523338AD7FFE86A0BD3B0842DA686A4B9B732F 4E81E47D2DA475BE2FBA41F05B9595BAC506F2D8F9C2EB22398342C77E79AFEF 763BDF8269B7688CF98F7823E5096AE4D644D5249F7EA1266ACFE9949AC8A288 D57AB37F51FAF7937F47E41CA2F51EB249A525E91040CC5F4E9322475FE14E87 2444BFE2BCB136FCDC23BDBC4981632CF1FEFBB494F1A3BA16F50DD9BA26DBD3 0CA3C7113A364D0EEFE600C47BD90DF257CECA68B3D173211380487FC90503BC C9FFC27435BDC41EEEF08A8BB309CB2B0C8BC86DA1AA3514B07E97582F3FE4A2 32BF7BAB02CDBA5930DFF4BAEE6F00A21916C9D1D0EE21AEA51AF561EB0113D5 3A0A251D173A77C1795BCC56863200338933817AA0AD96FDD6CE740213CA207C 864A97762A9FCD3EC94FC518E0B9CF871854BE2CCDE4C21C1AB11F6BE66A44F6 7D6751471D4BD779C949CBEF803B4E7672D5D399525FAA9252FF78BF7E7E81AE 10FE4DCFD6BD3CC4C99B2CE818B2B8B45B6C4B131ABF2FC61B71EB3E2BE21D84 F3A5F90B39D76D1618063E8EEC04992AA29CA3216217CAEE3E27B3916E5310DC 5C4E2B489822FE4D6AE8A12FB1589A3790F9FBD105F451637F396E04A13FE1CB 7E1E936F3EE1F37C9B4AEA80994EF8A217DEF96C747B8EDAF048EE8EACBE4757 3A6BA4B9297A4229CECB2719A9346B0D34FCFB9AB7575335EB477F0EA9AE54C8 063F5B3C4E40D158D44CCCA4BC7C7B55687FB89BE7DB9279E34F144247737AAB D3EFFD448FDD211DD3EFDF6750D9232C4AED40C8DCAC19A19CAD81FDC6A02470 7B0F5B743465E0910F67C559A5B25EF09C80BAA80486F04107559D253A9A62ED 7A25BAF326D8569E2DDC14688723C245CD694FBAF14B8BFDFC35038CE3A1BF0E 5D8FA4FD381BDFE34F68C81FA1E87D3A760F48998A443F70D6E38910354E23A6 4449FE903E50D30DF066972927585A61EE674F89B28B7AA90FDB1B94A6A5F1E1 9D6D7313A5389D5BE005CFC1CD4F35A0458B06D62EAAA5DEE8117FDE9BAEB25E A38E0886FEE01E0170C5B6351736816FBEF0351E5471697428F25239953E7FBE B16F4D7E00E81BEA0CA12AF27DC98B3BA32A2A504C8C4B523740FFAF29EA504D D747111DD946EC2034AD209B6645A6F3CB5CF0149A2C9635AA41E88A0938EB87 BB442A48D4B942A08212D1EA498E0C7106C458C857E003E5DD7635B0CC6344D1 C1D4C05A8263414C0340AF765282CAC8367B89FCB66D9D4B958FC981E9CC7785 E993DD791F9CD6B3557FD2F0B87023B6D60BE63DBDABA57C975EE37F44E5DD4F DA1159378A67B6E3D5ADA8E40D59816A584A456AA4D61B3373BF048C3BE6B806 8549DBE89116FCD001D507B7CF32F87B0887705BA11F8DFAABBFDCAA721D38BF 94C61F70A58891E577D7030491D60132C93DA3A80A856111549E02B317CE1035 DA5D9AA8EDC8A63F065EB93032B48869CAE47E94A805F395CFEB064905674633 4D0CED3373E67B52F127A58DD7C2770BF9FAA294C62B9F76F6D47BCA510E11EF 3DC37F5C317442821B2D056993E67646D9B1E5CA929FF709ABA27A27404EC2CB 6EBA02B7A2839955F8E2BB7F59449C1CF39449EF1E94759E6957F1BBB1E4516F 9C07F7578CD268C9D90111648AA654526A5E8351CE12FD3B5FA2DBBAEF8ABCD3 5882795FD9FADEBC8F3B7F9505CD9938D465360157D6DFD90E13D21DAEECE587 43E13F92BE4EB0980319CEB35C11C19B32A5D57B6CA259D4D8921BED9576CB01 4F2AD03704644F1E3C6E50477916D193EC3AE2E82FB86880765CB7E4F69A0F66 D39189F5E7E76136D7CC5E33102572FFC5BC1E2849243C43902F77462C36D42D 8E51F67A343A4070FC2F192E4C2A19C97526C01152A745FC60D4149B3566820B 4F45492B4D3304154F917081A0C7BD0838BEFC96ECD5BF1ADDC743D190FCAB15 77A24B3E0CB72C16F698F8ABDF2A653C8AF374582B3631035A61572421BD9B9F E630BBBF2C4D31C15C608950E5EB054F08C4BFD8C55E9346A023B5A6E384CE5A D45D147AD6A0D83E507D6E7CB4DB9D79BCDBD4DBAC53E4F2F54BC43E6604FF41 694998160DFE2ECE261A4258E6181962B3DF7511FCCBC1AA4BDA31FACB8352B6 00A20481D66FDF1D570C015AC07240E94A41D827BA17D9CEF845715EF094955C 63CD05D6C8F3D68AC0C0C46CFFB463C5E2EE902D6B866D374F01C7C33C42EB6B AEC6044F93F94DFF85ADE2626DEEF3EC73563C6EB2762D3A8E565A4E6FCA4026 9F33EB916C4CEBAC10ACF046C3C2F78397622EBCA2C19002B0BA6C6D74EB8235 AF5ADC77907D394ABF82C7C720D00A71F8C3BD25167F68939C3A61BDE015F57C 15DE3C8E3C211B8C68E6889879062A07E0B6B894D46BB2E0DF34BAD3775FE4C9 4DA40F0218232F7441D78D12611F2438580F4CB4C1E75AEA59898E6056FACFBC 5451492F6E3570287BA00F4EC9DB9A5C2491229324AF55AA7D30AE5420461B9F CEC74BE8C9B9131659625749C7DB4AC76BCD602EC1F8E598C53CCA21826BB99D B448D11D4F03537A14A97D50DE9478DCAE1FEA581EFA9B0E89C7539C09D231DB 748C8329C68B5E9DFBD7319ADE1AD03DB62C8D515F62C37CD84A3155FB80FCA6 474FA2DA6E10139EEFE6D979E8EABE053EA6CE44F447F098485588C92DD71169 F859DA274DE1385BA200EB34E3E612E12B433EE3D8A865B688C38664A0BF64B5 86E0ED0988031BBEEE9817433A39A2EEEB31BF3BA541E52A834F0C227E8AF023 1CEDFAE842A8DFE5CF5300792DC580079B337FA6EC58E12772B08294E75B8332 C827647CBF35832E687FC840EC24825AA13323DA00B2BCD7747C258FE67A5D47 4F26738DDB11A1B0A747EBE8440FD0CE69AF5156FD001136FA1629A048AA1F11 C1C043BB4A938B8D110EE8295571BBE468743D4CD63B8A9FCD8CD5EAF7AE5A6D 92F571A8953AF7C9A94E7B3A2B5D475760F8DA457D8E971BEB4217B626982D43 921EB2495D43846EDC899656D68F10353250F6FD091653FB9DC28192AA6A3D67 257C05AE25B98B1AA908330EC7236D87D9C52CA25B57B5BD5E9268CE92079712 F78911193C69210E5D533CE127B18D98EBFD6A1B27EBF418E9625BB14B478B47 4880A9B11180CCD6C72DEBFB26CD814BA5A70BCDDB7DC75232F1C67BCAC346AE 48608E977D3EA87289F49D51E2EF9BB68803911AF5B377F50B9120A9C825CE10 467FE5351241C8D382BE8D72D4330CAF4A9B39CF1848A1858118CEBF10AA5548 945638D4512D33F0E5CFBFAC4449CEBD93F1F8FC9EAD36F1899A5113920BB91B F7D1EBBC5B1D4BAE4B8766DA0A19644BD7576D4F3E202E157B4C27116A4939AF E8603DD5C3F6D83DE489C04B358AD6B099A1C4D84296CDA43A30FC1DDF90862E 8BE3B80E3A369C8BB4E92A88D6064900D62E95DA803CECDD5290C2B17BB198DD 741E52F6F018CA007FC8641E5233E9C5BFA590E4934B43D375E7B81C4F825F5D DCEB827E5A275F0ACE7AD79CF960F83258A709EE0F43364F5D3BD9DAD16A0881 85B4A339A1FF47A4B99D0367B523C1E290C336E823494A182B221E1D98E29647 43BF0A6438047179D7C8349D99C5317E455666BACECEFE59EEBFA802BE644BAC E8BB4E75C45634D873E6AB3ECDAE27AA3A5E3EA9F940A0E9CA41FDEB43C0ADDF BDE41162E016804DD7565E7E1AE954366E047F3EEB7DB01AE9841D2A56210956 F98D6260643B184E4AD42D6624C42B9001B197685773786B161C2D6054DA48C1 3C15F17B3D2E4A7398385D3AE8D4EE186257848AD0CADBE2F75B4AFE76B688C6 D8EA280780ED1CB990BE38267F3B735066E943A915FA42F29BBEE5E6FC1B4C4D 6F2A674564C5821F57F486B1E9018CD8D17D1E1876ED97F1EA76CDB98F05D9E8 65035F0EDA2CC69C97C8155BF0ADA6A1B2918E185F5FF3A06EF5D1FD4EEDF7A5 9150A04092CBD78E06101F9A47780D6B8BE95BEF38387523BCA92E1DCD2AA0C7 9A264081FFE7590A1402B9AF14522519FF03E6E685E66547F2EE341D99FB971C 826CB8E08AAB90139D1B8D5C9099AFCDD6972FDBE96D3E61F8E05A8AA04CF0F0 92C51CB4E2DF5AEB638EAC13304F09221FC53D95FF5EB888F3148AE6E466E75F 028DCF215DB6CEA0FA674048C5718A5B76137613F0662D5307887B3B4E38674E DFEEB1280F8C8F27E3493D6A7F207F46B4BCE140BF755DD97C183692EA46034A BEB413D09EDD53D247D61BA648EDE7F9EDB327632AB44AAFA8B296E5E70B7876 8CD9F8430A40F33220E92B036D1288B3E014F3BB824FCA9E94B82717F8390EEB 33E9325ABC989C7B8F4EFADE04B06EA3B62DA015E0CA00529FB6FA0D99B01106 5BF61B53ECA3416342C78184F24FA7B6C3587FED766C5E0CD8F9A8F74636095F C500B8883073FC260BF19739373B2C7C7601BC40708931FE8431904683FDDBA4 8656D76F8657DE79F9D6FB1089EFD8CD2EF801DF4576AC25E6B139DD4B376904 A5F0F08AAE17025F7D253A312FB988EEF658F71BA27AC2A5B87B8F8AB72294F9 C4A70110C08EF78F5C32DBFA317C22A91205C75481DDC96CA8BC08C40CE6D3DC 93584F6F75F14110BCD5AF322749B8010522BCBF6BFBA4AE147F116C1402A8D9 1E508ED3D65743BC6EE2C8D4C88545E97286C01CDB0A6953D85348EB082E4069 CAED3F907312DCF53C921C46371B054086CBA983E7CE06C1CF00DC2E4DD80F27 6FE999834EDFF088FE277193B813E231160B5EFD05B456AE9B20F993B2A67D71 9A5C954785FE6A1EC900F764F208553E79192DCE9A8D547D13FB277D28F4E2C5 9C62401D3EE1DC2EAF220F1AAF84C79D6EED2B8DF7E31E53669270C7DB9BCF9F BE74329F292817D2EE2777096BACEC1D52D4098A935B262A2BAE58169730BF90 478D83E60CEFE7E249A39A6CF370B721CA1476246665775213B547D9E9F89BFA 1B58EE8B5F475A7FE4FF94B1646FF075198930700660C0FE16546637E1D80F87 C39381E4DE2379DB83C7A6A5908D523B3D7B9264B8973F78770297C0D31F4B77 BBE4380FF20B0C4909A0CA6141ECF11A2ED1DACBCCBA0E72DBEF51CD8E2D8384 7DC963394F52840C1D70B7ED99E2931CCC36C5AB5451B1529215943C934894AD C1883A86B8C7684ABB0C115625F2ED431252EC74BD4396567344AEADCDBE47D9 389C4F6BD94FD2A8A0374F84C636549974C3B99626AA7CE2A19D5C69117EE444 0811B2CDB5D684E181D1899E33DCF7508BEA8D28EF90659AFE8EA18B5BBE9FC4 2F30348FDA1DD26C216AF5B2B35BD658F6B2F8C42569D2708C69F89B154111E1 F0C98EDDE70C937CC306493FDE8517C1245B2DA6D1583ABE196029CD4CBC54F8 F474FB10937C9121E33CC960DBC1C04E94BD0609BBB0F1216893C7B188223AD6 E9CD2FFA0257B35FA98F9A557865D99E4EA3ECE43461FCEA49277BB4A1BAE648 3E7C022D064240DC00B48AEBF69BC9074E29AF869CB37F4790DC8C4628AEA7C0 D5B96F78A60639863B0C37ABE636A2C2612DF83E47FC5808AAFD014C281A464B CD0F6CCE1941B8D847D488E6D425A7563E1BEA0EA77EF9ED2A1A1080B8E4FE12 0B34DFAFD4F9C324DE3A6E61753F524AACF5352FF05B8D3B2845883286F8AF57 C1E2E0CCD66B06945EC60DEFFBAEACC7FEC78F3165C38785DC2BCD874FB1668C AC46BCD6E09EDC69DDBBDE37FC061014A6252B5D1D52CFF5C8BD65CC3F854686 5724BB70C371E235CB710E18BE356D019DA9B6B70E0A4560A54F0B7A3CA934F0 040A901E078BE86CA8F02E898D99CC62BF056A9CBA3BF3004C885D6419AC5C21 43CF5C84C67EFBA1BE3F645E21FB1BAA00B67464372F04AFA2D88AFB0CE82CE1 A158B26B35C5FA3CEA597C73DD5204AC2F4F2E37A7788B80EC14E9CEB2D3BBE3 178376E87BB14F7C9A75EAD1BE571C01804BC18B1BE136D11E66CDE40FEC9A03 ADF328B9A0A3CCA9421052EF6281E7B7C0DE1DBEC4BC4E64D5EF2226318A54AF 61F4EDEFE8448783E5E32C86DF12AE1B79F7125EBB1C99049C8E8638982FDF77 93E5B8AC73665AC45819B7FC6CFD9A57811C33D018C9AE779281AB249A149CE1 45A4DD65254D1F6ABD1F28123E86D3EEAFEBEB4F9560F0F7256CB1911EF9D1B6 410B48FFADC02E2C7CAC032579E75C369854435051555F99252F757C64A2EFC4 55A09A67342CB362C91BD3E0315B584568873E5377C84272C3995A8D5B1ADF70 A9C4F91972C1E5BB289D407D24FA7744D33FC6D92BDE47E04322DC7EB83B6BAA 442E93178F13036E40BAC6E20E8CF2920F8A1610FBEF3F865D5D177C21422B11 4F160DBF271595289089478E31F9991C85D651A4F2BFBE09933C63DFDCF84D27 34812C6952B2E33F650EACFB44713D635225F83A2C3E8421B2FA9D85C4E31952 FC9594239D48C2F73C3FF5596EFA852B68030AA7BA5577FCEB 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMBX10 %!PS-AdobeFont-1.1: CMBX10 1.00B %%CreationDate: 1992 Feb 19 19:54:06 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.00B) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMBX10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Bold) readonly def /ItalicAngle 0 def /isFixedPitch false def end readonly def /FontName /CMBX10 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 46 /period put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 56 /eight put dup 66 /B put dup 67 /C put dup 69 /E put dup 70 /F put dup 71 /G put dup 73 /I put dup 75 /K put dup 78 /N put dup 79 /O put dup 80 /P put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 97 /a put dup 98 /b put dup 99 /c put dup 100 /d put dup 101 /e put dup 102 /f put dup 103 /g put dup 105 /i put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 118 /v put dup 119 /w put dup 120 /x put dup 121 /y put readonly def /FontBBox{-301 -250 1164 946}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891 016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171 9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758 469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8 2BDBF16FBC7512FAA308A093FE5F00F963068B8B731A88D7740B0DDAED1B3F82 7DB9DFB4372D3935C286E39EE7AC9FB6A9B5CE4D2FAE1BC0E55AE02BFC464378 77B9F65C23E3BAB41EFAE344DDC9AB1B3CCBC0618290D83DC756F9D5BEFECB18 2DB0E39997F264D408BD076F65A50E7E94C9C88D849AB2E92005CFA316ACCD91 FF524AAD7262B10351C50EBAD08FB4CD55D2E369F6E836C82C591606E1E5C73F DE3FA3CAD272C67C6CBF43B66FE4B8677DAFEEA19288428D07FEB1F4001BAA68 7AAD6DDBE432714E799CFA49D8A1A128F32E8B280524BC8041F1E64ECE4053C4 9F0AEC699A75B827002E9F95826DB3F643338F858011008E338A899020962176 CF66A62E3AEF046D91C88C87DEB03CE6CCDF4FB651990F0E86D17409F121773D 6877DF0085DFB269A3C07AA6660419BD0F0EF3C53DA2318BA1860AB34E28BAC6 E82DDB1C43E5203AC9DF9277098F2E42C0F7BD03C6D90B629DE97730245B8E8E 8903B9225098079C55A37E4E59AE2A9E36B6349FA2C09BB1F5F4433E4EEFC75E 3F9830EB085E7E6FBE2666AC5A398C2DF228062ACF9FCA5656390A15837C4A99 EC3740D873CFEF2E248B44CA134693A782594DD0692B4DBF1F16C4CDECA692C4 0E44FDBEF704101118BC53575BF22731E7F7717934AD715AC33B5D3679B784C9 4046E6CD3C0AD80ED1F65626B14E33CFDA6EB2825DC444FA6209615BC08173FF 1805BDFCCA4B11F50D6BD483FD8639F9E8D0245B463D65A0F12C26C8A8EE2910 757696C3F13144D8EA5649816AAD61A949C3A723ABB585990593F20A35CD6B7E 0FA0AD8551CEE41F61924DC36A464A10A1B14C33FAFB04862E30C66C1BC55665 6D07D93B8C0D596E109EE2B1AAB479F7FAA35279ADB468A624BE26D527BFF5ED E067598E1B8B781EB59569E3D0D54D8EFAE0F3EDE26279776ABA15341E42E636 6E02817082BE6FE0B04249A4840C11F95F8ADEFF72173E9A5F2AB2F62C427E5B DC010E18641EAC906A5EF0F9BC2108062134A7F10956219C5847C0D82F0E8663 12D963E012DF0DD899911EC5D8096F80B49CA3444CF1294FBFAB57DFACC9D01C 46F3BA2F3D1C14EC30CBF83E5729F1C074D4F1665405C9AAFADB8BE41EEE43AA 16966E2C0CCC853C4C09F245ABFD4603C4AA55EADC0A59AA6E9F5895FAF3D3FA 83EDC6E2540417530AE7DDA8EF33DEB81444316FB3F93EF944D9FB06745BACE4 848398BEB747E58310BBA39C64E341185C82CB77E9D4439EC15BEFF1335F22F8 F036517C436225F4125ED67ACA7A84230D4E2B6CA713FD6B3CA54BEB540D4604 D58A8335BC20052440C4903786FE3E335E331CCE36A13F05F71126F680077AAD ECAE10CB7C057C2D55F384723D58EF3AAE83E9E0B39D6A522667CC5B3257DAFA AC1C3C981B9415967F7F4DECD492A52D35BA7B396815CECCA18146C96709CFF8 62E8552A78B12788A80F068ACBB0C15C55B19DCE5100BF525A59D34EBA5D3A13 73692ED7E2A03532244FA23261C8E5702629C7BE1F33A09F93AFBF3AC607A7F6 FD3D8B19098655B4DED97B03E39E463CAA9DD92C9048EBA53AA76B0BC5C48741 AE3010D21B329E9E6C77CDE3E7C23AAE0B2F5FDD647F031623497C468C4ADA7C A6ECEFC0828FF8214FC6C2605626514112B610FCDE6E3174912BD93E116537F1 5A51218896CB80229A42DC94734B633C98207B81F871FCAE1DA58E4E9F7F0AE6 318F68EC0C22047DF931BFE6838CF1325D3CDE7E16708C02FDA7F4B85C04B987 7C51C13CB4DB516EF9E98538208CFEA698F392BCFF13D221B7497195A0D094FC 9E72EDF09FCBAE6C6FDDEC0518E1CB8D826BDCD34C59FC1E82231670879CE2B9 3E7D5243FABF7CABD16B39C45BB7C243DC390DCF64F899F9537B14005EDDB0D7 F98E90BD5D778E3EFE2616E93D67F52670BB3F476E21ADBB8FCE74076B7457E0 4BBA0B06CEA5BB324B30C5F22BB65FA337951FF7F4345A961FDF86CB5FDB3B5C 19EC0187D603393B63186C84C83A82E55C33BD018456156C0CC12AE262F04F34 8BDFAB8210BA22E314EA054E364844F0BF03BE50426089EC7071143F51776C3D F19EE3CA885FBAE5E0D4A5334D0E957CFD25095B28726D663375530A635E4B8E 7C4743B67C00FB8A600F088414D8992ECDA0ACC39AB210921930855FBCC2E72B 7679DCDC16C306CBAC3C0663A120E5B34F7EE20EA7A172A1EE0D13C2960C12C8 1DB42ADEE49AB99BC309CFD51B5644CEB809BCEB184AF69E06BE34187EBF6F45 6E03911CF01F71E6355631E5A8D5CD2F3B6BF8B78FE5A3E69465E58CF73E5607 B0B18E8749626DD295BF9A8EEF2D106D587DD28F85833BC375462A944F0C5D6E 2B4C9795FF0B0F87E0ECE86CFC8D7D71D73F8FAB6D0BDCA8250D0E561CB64E84 8E1A67E3FF6F3C662158EFC73CBE917A024FF406B6FBE6739CB663D0C9922640 E5FAEF847679EA07ADCF51C43C25FBFF1EC5A742CC0303AD21E70FDFC7D47E8E 426BA2387436930557ED1A11712C9DDC1233AB4ACE7135CF296FD17A81EB3DBE 8F4087D8253365227A41364D01903377F2F0278BE0D7DF9943DED57976E6159B 58DDA467640451D54B35E682993A36718B141979811679C11D5F274542802CD6 CA4C437B6D4C239EE3692F55D3C3CC2B675E18668A8015EA23B6EDF8679114DD 89955A03E23849A40D2D6F29D27F9F7CBC12FC1AA470E554B9089ED64CFC75FB F4A1A3D8337A9D4F313854A2D9C050FF5E3072C65B15FDF82C202F68FB700C14 94CB0BEAC49177A2EC2371EA7AA515534385265044118C801A159351F7A1D71D 0EB50570DF4093E459D3B067823AA3F43F9E72BFB2F77AE2BDFBD917782C5406 03673D21EA2563994CC49D8A2A947808AEADDC87F23E92CF0C0F7B4AAE346C78 536FB8F4A91DCCA4817AB4EAC3EF585A8287A6A6A628E5F0A53C78140EB9FC5A EFB93F761D6ABF9EA3065590CD95903801BE9372B76F1ED79B75D71B9124E643 BA7B5F6BEC678D080058C0489943440360D8F100890F26196F82F88E61BFBF6B CC6907531DE5D5CA4B91E4F9D634A9DD0CD8DE6402E94C756F5904A5BC37A179 A9CC8CC6061ED3BCD51B08C746DBF5D8385AF7389AF4ECC4981D33ED4BC37ACF BD70E1474BAEFC098AA9BF862F153237B0D2EE97E604F8B41741BC38A0B2403C 92B238FE8A3C1456473B6AF6D8F9FD32421B61440B9209B1484F3276BFDABF24 570BAA113D0E06C146B8771F399FCD6906310B8ECEBABDBECD1BCF21EC03D053 60E500F91B4FBB5005D6F4DB331D1B534C15D5C5C04DE155F2808BA11A547E2D F4B6DC0A2A938EAC4612427490F92ECAF7103F55DFCECAD39E76B1355C8EC989 124A09FC9090192F78EDC8E54ECEA741BDBDB8EE8CAB4BA00CBFF9BF98818A65 37CFD9F4302BEC0A7D4E5D770546D77A95D6EE406BDEDC3CDAB1D229A6957474 DD11AFF676C19E4E328C133455152719E95026D4CE07C8DE5E939A69CB8C5D2B CC72BA63102A44B92235A1EBCC109CB8ECA42D9AEF2D7B95EABFD64F3EB225EF E4EBC3FB687CB00513E4014CE228FA3352DEE01A567014F375B77EA45B029451 D8A8E85CD7E3BC527A5E8C44707EDF2E1DE4D476682C609ECDACEE5B5D9284FE 2FCE66AC8900FA34510A458B2EF57CD2E87527CF4C88AD298083D44FCBAF9B98 882614B8B91639DDD9E3D1EDDDB2C137C85455992DC331D6117366B3CEDA8466 071842D5633D709467FD6E44F48C0FDB5528B0AAD26B3958D626569E14EFAA58 B592DBE04142D9B40377F8DF83920C7D979E78F5B63B54B8A478F4A73B5B5905 A06C80E750152AE7C89DC2BCC3A8A7EF592C43FD4624D295A761ED5AE94ABB29 C8B308E10EDB40ADFEABC931078D5C888A85C72451BFD587E73E0491EFBD80BE B0F1E6D9FA7F3DD52561A1D59133EC64BCF2212C82BE4AEE81CF3A20180D032A 267EFDE0D9237B58A48D0E70C92C0C0CC3C46801689118DB38938E7C88C71CFA 91935C2CD9DCC7ABE8F55C74BE28D669F2B51F31838C80ED20BF83291DE67F32 0BD507BD5F27A4C92CD5C2E2ACAC4545B4B62B6040C75F99021E62ACCADD7621 5334B605570F0EBAC7AC6E5E8E7968A8DF189DD604D1CA7D3020551B9189DBEE 079A6D1EE22FBBE1E43BF8D42BB8FB91DD3C1C63E10E99B53CF3135C4553D977 0A7456BE3ED2E2251AD5482F4F51083C8CE3DD2F9348FB6B78233EBB14550E61 E6C598AFED884A6DB3B8D7DF288BE2044CEA11F418EF3B2E6294D9C346564B1B 068C623B971047F0612ECB7157655A06958DACACAFACC0C14CD990FDBFE98C33 024F9D19F939E8A4B7CAE47E0C6F3BD57A2C798243EEDC60195F72DB7C6C13A5 E7968D7436E5962BE4413BC173A4310DB1D012AE618F4C446D40CC395365B7AA 6480A6764396B5093A02C88DB727823721B19CBEECAE261A6F150CDDF3CFEB40 4BBF329CB53724772B35F73DF6B0565A305F2C0BF144750E76624A0EA80786DD A7460E442086D9E463DF4781165AF8D64F5693039903BA8793E8947890823FDE A641E42C221FDCF6832F3744AA1A03717DB22776B34DD116B9AC17A841A3FB3E D627822C0BC41544EE864FA8BACED0FA8C1CB1D1576428269DD2226AEDE06CB9 E2EE674E00B5C43C60D6354340392A8A3A99DCBAE08C2A860AB4AB61C1B5FA27 37987CC398084B20C56C0F7A46305CB266A4128C800F12E5930201D5E7568453 B02D947517639E438DF3306F60F35CBEC1F74335F3F39E803BCE81ED306553C6 6FB6E25837CD62F7B3C573A9547D14998398DEE75CE4ECF0D59AA711AA7C0FA8 2D9F4F7157054C69EAFCAD5C2BD34DECE8411AE76F6140187B34F7159AEA9EAF BFF54D43B9569BF69DEE57D2B72B2FFD226DE355C83E4A2255EC3BF88A36CE9B 26674E8A200B2E8BFC959F8436E01B31483D142D318E221E5A40E637D4760E9A CA70407F57097E56465DD18464CFAE5FA02945D3EC6C45DB6472A2848EC98A66 301C63A761A9F68A23A84A9B01BCA1999AB48318D5556DE86B286127C2FFBFF8 EF6ADE0D8535FEDD63676CA4F2F50FAC64B620DBE16FA0A7BC9F964669ED7E35 B6A9B87C893D96B275FC589770AFE82CA0FC9A5968CD514B778C21F99DEB59C2 1B3F75AA347B576BAA32CF97C0EE9B422CAA852F900212166F0B9CF715F820DC FE222F55980C61F3E6ADB2D6E6268DCBDC2B74A011B41C260EFFE4BFA189D94C 6ABEDC2FC79B8F0807F123D1D928F85775DD2B281C50263E87880A0E60A015D7 3D39C6851D7BEF1E7E0626F4F2579DE80238B932AD5F578D5BFDD585AC3C5BA1 4D013A681B9131C473ED99A248A0B08283A4048B9E5B1A9495389F05E35B9C64 525884AAB12E5A8E058D2E5CF549B11BEB5D084A38CF6C10D393F6BE73D6AFB9 7B2BDDE416711F63A2A06F5ED3D3D065CC139F5392737F59801DC1A2F6B3E712 9EBDE49DD68F804EC60000F3A858182E92DE46DFC5CD036C85613FAEC9694DCF 96A2D8EA8FD5A497406713319809A919BC6185B82FB2BA05BE0D69B7FF2EAA8D 7448E5456C5F241D43517059117587BEF12511472050019422E6CBD2013DC2BE 5B0A099545DA84C8CE959718ACB689AE0DC3C9E96497A108732218BF8AE2BD56 5391BFF57D1F2831B9418AA5FE63608D31EE37361272BA669A7534213EBB09A3 0065C49E4A8EA4FF40181205D3109ACEBBDD8DC9D46F4560BB3250E43320E567 C76836DD711AEABA26BEF38A4244673D1ECD3F13A10C2C3404C823F45ADBEA56 3373BB5C4BCF08FB8F20A8D6E05561381D6ACA2178EC37DF744FFAF9E8E1C2FB A039F33BA035EAF2EB4D4F928274947A0D296454B3905B931C1A3822302A93FE D5131A8FB03BDAE23A1B5F0212F57292C4593480C139C56235696CDA7673B14F 465C951D2369E361E1A39DDC3492D9C5C663268FC6EFE6D6CD7E7CD68FDD996C CA3BC0E32FC249A57C095076A7142B57B48C4BD5C5D056083FE81080E8ECFC2B 87635AD52F0D6A52FDC4AA0029BB9662781E7B0271C9DCD0F1F88436C30E5C1A 3919F6BEC574E5B905E36665CE0EEC42CA0DC0ADED2D3A4707EFF4051F584CF3 321A4DCA23FE91484079FDA322C3421E1F1C9BB5C04338F4C6081426D479F29E 7E819C6C039F2C2FDD140DC5FB836BA352418600AB78ADE5BED20099698C821A D95DB2D024D995F3794021879225B8595E694ACAA2E889B205CDDCAAB4BD95C0 0BC24BC520C5DAD90EA6BBF4AB76310B98DFF30694AD15ABB7E0867D526636B7 EB1F8635A09D3F559EF332201EA72C2C0E752B64DE4CB063DA0E9CB1EA1CCC4A D6C5919D2D86F3870C852B39A61D290D6E64FF77AE711F9D5631553ED0EE0CF8 C430BDA64264EC7085DCAAEACBD2D5BD8CF74157793A1AD75D3DA2912B58BDB9 D47FA8355AE7893F2E316504AFF0787342BA28B5412C5B2C92FA1E1011D2227F 52700351C0660CD64240E6A380ED7E532FB9DAF37DDD353DAB7AA31F005DD9F8 3339C1EE6D184833619538C5FC0EB09CF161E8E0F7BDEF34ACDC2A7AA7DB91B6 6D70DD3C73BFF9CEE0BEF6D6EA61ACF225E8E3768368C638D2C38B81E234A24F 2822E61F61D2BAB5D42222AD8BDC75CE1C19459B4AAA49D8FB785CCA4C1779EE 33D7AB8159C41192AB4E5F6B9217171746BA9A3147D40231B32C6D8C8857ED2C A5E5653B2748E64AFAE309794DFCF61CE1BF97A7DA067E6EB443A41C68CFB47F 1FB598AC5B411F2145769D0EC1CFBEE2C4BD4036E8CE214C5B9A91BE8231B920 7CBA80DEB3029701E61C53DF812A8D4CE9ED206E044B38D0F0651BA2B0D57A65 4D5894C0E934634242420E015F34F24F91275F3B55C4CC76CA06CE07BD0C014D 771070FD248C2F836AE35E2F5BFA2B6EA04983C5B0804ECE338147BEE6BAF694 3CFE3E50410A29D4261FF9B3506B7BE83292D631232438B231BC45EAAF35AF60 CA264092C9A1F30E72EA7AC1A47BDEE830F2318A4F450B6FDCB610BEEB2B2415 4054F4B96962744C23A99EEC2946DD3C27C52268A8992061C746ADF78E34464C D0709A4EC946CA29557F2651B62D4DB764EB51AC8D5F6A9251C67C7358660B64 AEF35020BD35731EA2A3A221E678F222A7A18B35960BB11146AD42A3B7755432 4B8E399C9C73190D55DD532A42C806E61F0376D139733BF8C95AF47894F96C55 C13371B4C23DCE32A9D669F42F1EC62F5B7EDADE0E43E52AD35E64FC2B63419D 6962C4EFAE49EE0171469486A071E124FC152281D42907863987B3298CDAC70F 40227B7EB91B3D2500B5B52C67B0E1C00C00B0FD1C32A31A637488C196A45A68 0796214B5C292308A510AC9F9835829AFFF1D4F0F5070C76BB4D62C43C787EC9 64973716583C3E56CC26D9375AE76BA815E179527D41B08AD9A4799FF43ECFF8 504FF729101081E8297B63FD3E2E4A8A60C2187D56E80AD9BDF773C9DBE12022 D7EED3406C5461A0079837A953A5BD6D856E10CDA9DDCEA668E1A9EF548EAA7F 6323A2581C6F2C3CEFF7AA95990FBAF5CF3C470DB2103A8F613182C40EC2C25E 83FA8BC39B49E89FE2E0F88D1004EF1793D5F1D5FBD7D13CBB8E8314FD2271F5 172B4F0663471BB39112E022156BF755AFCE5539EEA584B38CE90110F5AF981D E38F3C9E0DB13471A69F190F01623CE560631E543D8DD4CD8BF7E8067E2B024D 7844BCB9367B9E9CDF6AB1E051AE7C6AF8BBF0279AB76F91E3096A9B596CD481 ABC06548BBF56D87D68CE8F73CFE1658015612D08B09F9D8A8A94224F3F32306 3A488EF579B9B01F5A20DEDB30461F036C56909A76FA24584B58D1E791DCAB19 A2B879D6CD08433F7B143C34E12E5E6A017FE5A3CED564851F500A2FEA591A73 1402ABA57032E377E88E7D5F7B7667356873639B6576A91EC449679D8A2CFF11 5F06B9EE2AE1F2BA2F2EBE3C679375FE9B552B3387B840DE370E5BCD403AA781 95747DC5B54070B274F63E4CC7CBEBEDECC026F1BA45E0815EA806168B4FCF4A 561B540AFEBF5F20E7900077D3B8B98E2B30542DDCCEF75D31523F6DBDC925DF A219AAEF9050643026C49FF555FA2D545ABCF0C0B583DE9096EF351817993010 A6775D37D4326001B6A514581E2CADF0E90A49D0FC594E77491EFE76166023AF F60B0EEEA9BB4FE37C94C79E4AC5089579CCD9401601BB88842A46B8A889A53C 5AF0DDFAA07309D3709E9B04808E52B65A85C85D4327A70981E43AEAAF8510E4 56633D257C343457094A59410F99ED970EF0650530C9ECF94F54847686F21E79 5E02D132E45F1F430CFC5D5DAD19D075BFAA38699EED9C73276EA7C381A03B1A 4162806EF6E13969EEA1FBC89966B0745BDE1114CE32DBED470F4751DEC36D38 BB1BE46E7E162660DDABA0A9B1EC983DCC7C914AFFE334D658FFF5064A01F6E7 E23D4955DB4AFD2EA0E371F003E68957915893DA2626780FD111EB90CEDB2BF5 CF596382A55F28C43A525E461C8AA9744DB5820AB314B0183B48D1F801509825 FE331F9736D366BB658CBDDF6A4564DA618DECF9CEE7EBFCF1544B1EA1746C51 2E5F7B3A2B2EFCE6C9DB26011523FDD6FA32FC3615CEF4B0739F659D03AB26C3 21728BED1BD965BCF894B654D352B12254F6B204B27611BDD82A2E2DE60CABD9 6EE36EB6D6642D7AB158F8AAE1697CA540C2889BDD9A245BA34440DB21EFF755 15F766B02FB5E6D80AA19982AB19D7F8DA443919848859B103F4EBA3496769AD 496B7E78B3ABD7A95C516854AA97A8F574788729BDD7E04E1D34B640F3080EEC 8F0D6EBD83C496015575FCF9B002BE9AA6BFB7CA9E7CB1B1753B0C95FC9D561B E47D7A5D5A537DA5970C8792488733A277A1AB68F849553BE06E053567E27E75 3AD0FF5A5E249AD9208BB26E948FC9BF854F36CFDE63C2C6EAF3AE98D7A09BCA 93A1E1BDB84617D011DA89F90B350F133F387E734E4B8B70D3F9A6959BCD0679 1914693A5493F7C764507DD95BB903FED1A13289E61AA7CF12DA6D015BCB1E9C 188A823B9B01BDB31F7BDA8000FD5F80FCF92D5A3C199319B6D6863C81C9E0FC A10BA14F42652CAED0F1F7D7642D2EFD4D92B3E781AC03BA7696A87A4553152A 3520C9ED887A3A2535AA2D1F0CEB1D1DAE0708CA0238DE36AC55C535AFABFCAD E30CA91A3A09ADDE7D26281310DB8466E18CA33B43DFBD0FADD4B83016680851 BA9C3CE282ED28F7A200F3FD675D0561FDA731D6AF89045EB5E1F8F9E6C4FE94 2F0FCC80D9BC10A1B6C884F36DE8ABA0BF508F5BD45893B25FDFA559106B067C DF54EB9A3063A15F4769C513B146C382A0AE5429D7C7A912F4A075FC69F58149 B463A4C05CA69B0BF543DE43A11FA9D0B198AF6CAD0743013FA5685EB29C51FB 1CDF0F25D849864B676348D46B843E5AA5F32B5DDC8FD1F583FA666384918A39 50B7643B713C2CF845999B33993CB0928193BDDA2CBCE235C6AE3568EC3B49F6 7A85264646A237758E16CEF056BA5582600D0E269A6F7325DFC3AB3E9D3093C1 352D2D38CF7D20E38297F391D0484B378AD4E52396261EC2DAC5FE88CD47FE05 1A5ACEA9251468753B2889AD6AD61B70821121DA16A547EA99BECA292D8B1EF8 0C3F7AEF8B881E2246F7BF6D1A90E9CA285E7B06423A7012EBD1B224DBA27FDA 2F8E96798705CBDFB1DB849C9376689F6BDE02B9121BA1D2BEB3D1C30B03597D BDC559122BF28348FD4CCB1F0B9761D38C210B8A216937FE2EABBE2E0AD84AC8 E8A18BB49DE6FCB61DC3F92D56A2E932F6F085A9C40F52F734FF3A19F783DF0E 230D2101AA11F06CF5FA6E6A6B7791A6C8B2610B3CB66355C468A7C9C3EAB192 6F8BEBABC4BAE93DC632638DB829DAB434D9E6AF218FCD4BE65BE2DF86AAAF31 E481F80359AFBE9126388BFAED6989F931483CD14FB2500E3233D5539BDE3736 BCBAA1900D8163F501B178C0C2548434C3F68388B19D376F89766123BB78A08C 70BE85F8EB6955C114C9A7C11CFEF270B8BAD791AF4F9B6AF09AD577C28D5758 7ABCB4583129FBEC5E8942BD62A39989731469A762EF902C14AD17E47364658F 6E8DD5726F160024D231440727F1C36448FF44C27BDCA082798AD41456B66957 6FABACD1FAF8311092DC73285C0C6FDD11E974087BF0A987CF8F33A7766C4A76 6A9EEBD28D7E36FCA5A7C97EDBC62360A960220C495709A4BBC799AE67EEAB44 D770D0F38D24E8186A96FBFDBACCFFC67BD72DEBF1A055ADB21CEA9098540C8A D3A2B200963F54BC889CBD250C38065E61588516A25D5E1C502C1835FCD32559 08B04FD75BC68C7A7F90F1EDBA6FBBD166EDEAECF4756CB716A583D2E1438D9A 679EAC8073EF23B44127922BB92227A57B61AD03E8C128EA41E8E91DD30EE885 CF46A93741DCA7F351C98F7EBD4934675F4753798615579B28D7367C65CF012A A960AA3F1D3A9C903EF47A38ACC2434C47E2006F189C10BF5978D7E4978F18AF 382D0A5FB3708A0392A8A87B2FD8C20171DE23BA0C14BE83EB472DF4CC58988F B0D8959109D88C5EA5DF0BF962109263197A51738A00D1A709F3770C691D5E6C F66EDF8F2FA2629F59788B7D811083A8071E6E4D7185117661B366EF5964AC8A AED0F515A063728089FAD3D7586DFB85F0ADBA08517F3C434409300F74DB672E 6DF6BE832D1564C06988DC1469219A24F0233F38C84D721990353B90B2C0EDE7 9F0C3A540D14FA1B7F1CB74936A7B88321CC841CAB20A1E7A92273596A82496E D2401D7456AF4234BB36F7819232C4AB06DBE3F97542CEC05B38B6546269B791 ED2AF1DCB4061D7791F694EE1CCF051590C7F26EE59355DB084E5F609B928A58 B954BCA3E7463BFE064BB7B3DB09773DF3F0ABAEA53AD56F98D7F7BA263304CB AF3390CEF90555746B797084CC0C4996B4F30F54563298A69FBB4013184A1F35 969FF96AE7B3BB247709CB2320A0AD5D619A3E31F49F4CBD03B69C56098A83B3 E4D837861386A976DDFB2DA2A9472F1559943B9794B761898E7375FB2C55E3B5 E605C02952C46F537B2BBFA0B3B357340704448363FC4F20F0245A746E9A18F2 08425531F826E8FCA78866F0402F6D755B39574F57BFFDBB321D435502E0FB60 FBA64BF650EDF8033A246D8544E31C373DB2F250AE2BC5233B85A1290511E588 512035A383C14A2B27363E7C0B2E4DEB8E780FA2A4440CB653CEDF4BDA90945A 4AE0D6343D1B646934DA14505B99E522EE55E02E700B018483E6D10B3E8A6F2D 1001021FB17BDEA02A213BE8A3E33D6200213FDA458D25E8713C18B4EC7E4C6F 98DD981863188AB4EF4846717B770FA9D732C0388C411A0C393713CB4B1549AD 1494D73C958F4DE348C25AF9F845535F111AB37A31874926BAD2ABAF1C9FA2D8 EF4E1EC33232225457B465ECDB466F89BC9DD2A9E82EA7CD2E9BD90403258147 F3F094D3B7F63B576DCFF5E324C82C6801235D0DF850CC6FF7A070EC92456321 BBF4175403ADE97D1F62FD6B1358B7DE7473FF03959C0DD8731D7367D173DA56 170A2F3677A3CBBF9F4D351500860FA504F55FBA655ED5F79AE0E404FC5EA41D BE1334B65CD93468D3B365EF3406777B6CDEB5454945798E6B1FFDA470B089F7 3222BFD4002B7F1E8711E4D1865529C2045B7FD98069CD0674AC9DBC7F31C277 EB88F8BDA01AB9D67611B078D3A72083B6D92F8E96105C15844139424361A983 4B5CD4BE172478E1320D008E73CEB0B5D7DD07C65EAA231B884F822E613ED7C0 A3E24E90BCB4DD0E324A38D133A45704E818ECAFE0C59E420FF122CC71D6E96A A5D5EDD9DBE33296CE6AF62D797F558B884960250F13D11F6DB57BB264A12D89 88856C6B73202A54E9FDFFB7E3FA7E81B21C734B42B44BF2BBA5E8046FDD40FD 923A00084CC2111107D1B8186CD8287FFE1F26993F7D650D73D3A06C93B4B22C 4C64709E8D803BB9A8A3500791260AA785DCF3300E7BE08CAFCBE64A85711461 77543E4117B15B1215DBBAFB64CD4D90B606E42DE9EEA813884CDF19A9AE563D 4D506725A2CEB6D65452E8862D0EAF37AE2D799B7C959D00AFA2AE8C0DC184F5 56780C5EBC3E8AD7D720DA703529CD555CD25491ACA3FE8D9578B07E75FD0F44 98E43F871FCAD2A3F3EDA423A9A2C41B8C388234C9BB7A7D78AF6E5C74B56A42 3D8D31EAAFC3CC1BEB1967859EB33DCE2A51B88A9B5F5B85D13C619BEC3F6CC9 05F02C7C850A341B4B9B4DF952AA66DAB17308CD46913DAC7496CF31A30BB235 997E8D718C6CC2EBD503E131CE11664F4EBF5A0AC3AC0C3BFB2EA6C221AFC902 ABE0DCA95B14F26C7CA969199EE72FB6D2DFF8635703C8EF31C1A934D6BB9164 27C198F43AE7A54E6869E939DE2DBB183766D9F90C7C270EEE0854C72D296A3B 10174961017318135CA16F54C2BB2C422DDA5F 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMSY8 %!PS-AdobeFont-1.1: CMSY8 1.0 %%CreationDate: 1991 Aug 15 07:22:10 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.0) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMSY8) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle -14.035 def /isFixedPitch false def end readonly def /FontName /CMSY8 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 3 /asteriskmath put readonly def /FontBBox{-30 -955 1185 779}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052F09F9C8ADE9D907C058B87E9B6964 7D53359E51216774A4EAA1E2B58EC3176BD1184A633B951372B4198D4E8C5EF4 A213ACB58AA0A658908035BF2ED8531779838A960DFE2B27EA49C37156989C85 E21B3ABF72E39A89232CD9F4237FC80C9E64E8425AA3BEF7DED60B122A52922A 221A37D9A807DD01161779DDE7D5FC1B2109839E5B52DFBB2A7C1B5D8E7E8AA0 5B10EA43D6A8ED61AF5B23D49920D8F79DAB6A59062134D84AC0100187A6CD1F 80F5DDD9D222ACB1C23326A7656A635C4A241CCD32CBFDF8363206B8AA36E107 1477F5496111E055C7491002AFF272E46ECC46422F0380D093284870022523FB DA1716CC4F2E2CCAD5F173FCBE6EDDB874AD255CD5E5C0F86214393FCB5F5C20 9C3C2BB5886E36FC3CCC21483C3AC193485A46E9D22BD7201894E4D45ADD9BF1 CC5CF6A5010B5654AC0BE0DA903DB563B13840BA3015F72E51E3BC80156388BA F83C7D393392BCBC227771CDCB976E93302531886DDA73EBC9178917EFD0C20B 133F1E59AA9B568B69ECCFC0900517036FE3D4C09BBFD937BC5A9C0B89894A8F 63BCCA3746BA056D1B408B16E976D7BAA7D0F7693814ECF52D90BDB3398CF007 CAD14DF246B4D1886070D41A28110F88C9D3EB1F30B1823E0EAA1A35733AD321 E6338D62C26AB6FCD4BBB703248CD7C5CEE83E0167A63F89ACC9D09117C4D017 E773665CB7FA79D22231C8F858735B554E2ED612A436D299491FD31F810F202C C865B87083F980C8DF6A3DD43D437617A69D3E58FFE85F106F7E7F6E50D4D25E 328F7A76B73078B3604C51CCDEAEFA74ADFB9A6C3A5A0EBDCFB578CCBC3553F8 44D4B2853DC7C8415AE3174A4C2209F4107C23000ECC343882C5E2ECA42D8B33 F4846EB85076770BD7E5AF795E1EEEFDC5F0229761DE6BA728FA78549D6E31AC 55ECFE0C64351DCC357F619E3771692B7DF8FFD7FAF48B4299C702F866374FDC 696E83BF09BDB1C40B 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMR12 %!PS-AdobeFont-1.1: CMR12 1.0 %%CreationDate: 1991 Aug 20 16:38:05 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.0) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMR12) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle 0 def /isFixedPitch false def end readonly def /FontName /CMR12 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 48 /zero put dup 50 /two put dup 51 /three put dup 74 /J put dup 80 /P put dup 87 /W put dup 97 /a put dup 99 /c put dup 101 /e put dup 105 /i put dup 108 /l put dup 109 /m put dup 110 /n put dup 114 /r put dup 117 /u put dup 121 /y put readonly def /FontBBox{-34 -251 988 750}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891 016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171 9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758 469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8 2BDBF16FBC7512FAA308A093FE5CF4E9D2405B169CD5365D6ECED5D768D66D6C 68618B8C482B341F8CA38E9BB9BAFCFAAD9C2F3FD033B62690986ED43D9C9361 3645B82392D5CAE11A7CB49D7E2E82DCD485CBA04C77322EB2E6A79D73DC194E 59C120A2DABB9BF72E2CF256DD6EB54EECBA588101ABD933B57CE8A3A0D16B28 51D7494F73096DF53BDC66BBF896B587DF9643317D5F610CD9088F9849126F23 DDE030F7B277DD99055C8B119CAE9C99158AC4E150CDFC2C66ED92EBB4CC092A AA078CE16247A1335AD332DAA950D20395A7384C33FF72EAA31A5B89766E635F 45C4C068AD7EE867398F0381B07CB94D29FF097D59FF9961D195A948E3D87C31 821E9295A56D21875B41988F7A16A1587050C3C71B4E4355BB37F255D6B237CE 96F25467F70FA19E0F85785FF49068949CCC79F2F8AE57D5F79BB9C5CF5EED5D 9857B9967D9B96CDCF73D5D65FF75AFABB66734018BAE264597220C89FD17379 26764A9302D078B4EB0E29178C878FD61007EEA2DDB119AE88C57ECFEF4B71E4 140A34951DDC3568A84CC92371A789021A103A1A347050FDA6ECF7903F67D213 1D0C7C474A9053866E9C88E65E6932BA87A73686EAB0019389F84D159809C498 1E7A30ED942EB211B00DBFF5BCC720F4E276C3339B31B6EABBB078430E6A09BB 377D3061A20B1EB98796B8607EECBC699445EAA866C38E02DF59F5EDD378303A 0733B90E7835C0AAF32BA04F1566D8161EA89CD4D14DDB953F8B910BFC8A7F03 5020F55EF8FC2640ADADA156F6CF8F2EB6610F7EE8874A26CBE7CD154469B9F4 ED76886B3FB679FFDEB59BB6C55AF7087BA48B75EE2FB374B19BCC421A963E15 FE05ECAAF9EECDF4B2715010A320102E6F8CCAA342FA11532671CEBE01C1B982 4B1CF704E817814FF9C921A7DF8CB8898733795DC5382F10417D349D3A7D24B7 E093F2E23BA2C1EE337477E6D51957FEE9206BF92BA12FE5ED4056C4FAB42BCB B9E96E640C88DB1810A0BEC0F3E9F4BF00E642ACEBEF5781F8E57F9B9AF15B57 53572D8E00BEB804C5B7587FF816874FCEE012EE5CCF317AE25E9B3A801A805C 5EA4B24EFB92E54CF85F048BE9DF31C77AB6132EBAC1C124EF5C0DA0719EE902 BFB550602C5A8EA7E31F72207161530AE5DE53624E60A6383DE04E085E20E328 2D3B8009E90861D7309BCAD915694CC31FEABA2FB3DFE8E2C61DC65AB2FEDE93 02327D5B24B0537DA1B1299C9F8D03D6A10055CE522CE067381FFCD4D1E3E173 21CC73B94423D2D44E035E1CDB53846964AD93EB1EB99E6BF51167EFF6A4E33E 71277273918B7F4FCCE3796ACC9725B293CDBF517885C38D66DDDF8FE9D5C98F 771EB2DE9C0993E84AC0486F9361270031C246BBCC721E2D872E45230BFE7B8A 1817A8FAB0C82C2A5B002C9208FD316333C451D59243D312193F38FE79731FA2 BD4FE2DD6A3E4B4FFAABE064F8D2D97628C9FB2428BAAEC5E2AEA4BB1D609B85 2394287D1AA46D8E4B4018A4877F03F6A9E40277EA94C462404537694208AE33 45D7AB349A1916683BFD35479190FDB8E8E1E5F4E5C61774A1D966928E7AE59C 301D1C7D41DB96A94C23F41A650257297F87E726155BE35E84BE5554D97137E6 C0DB7D48CC0B5D6A78428A63A3E594ED30A6F33D6FACD6CD77F69EB2AEDD6767 403F5069AFB93BA02E40A13E9A5899EB68B5FBFB655610CE2FFFD76F0C7C6595 0D8F7BAF05232E793BA4C8C0A8AAA682DFE3E4F4189F9F9EF5785CCFDEE5CA8D E5685C89B52AC73837BC5C6712E4B8480D7EBAD4F54755F8BF549F0B6DEB32BF 7B8A98295BD62F14921F80D98C79BFDBBC84C6EBCDD598B54BD790925C72B0EF 1AE6086B1ACCAE8F9BF52C0AF6DD5FC38190A1457CEEE48DC5193DD6EA1A526F 3EE4CFB5E5EF88A803563D69A720ABFD9FB3AA77CEC8E29F49A9BFADEBA19588 01D88B45D250106F673D7A3F42F0F2539B28D0E6C57DA35B38335DD112CFE6BA D78289AD0B51D642BA212114C64432B8CD80D899FB60BEC1B2887E8AB5E48C58 91D0D4D559ED781196599006B2E3846D836D80DE176660DD8C9ACCD72883B2B4 77D9B991777561D77975456E8D4A7E2ED85FCC0884EB9553A7CD37AB92CE1AA8 009895B4AC7B00DF43FFBA9D96EC702914FFEF294C865B63B2498A54C97F1144 7CBD4DC79C8BD47984A4562F8A6AC40D8DE955EFEFCF78BC66CA604C96161251 420096A2264D7E22B8A3869839FBE8C8CA10082B0253E205500E7F47A03F027A C352CC0FB38F71AAE11F452A3560C63C844018619594C9DB2238162C23083DA6 22A2D92896B83272BE70340A93A08E15834C338077D933AF074372E4B2156190 992182D6AF62272AF7A9C80573D40E5BCD630AECA44FF51531F0028D8F38C91C 0421996D04B5B8FF3FC6435698633A37A84D2C39DF003CB018596F81639B3E86 93CD0F84B1934BAB24DCD0BBB3917E0B44FD109DFC2E437B0B79D37EC708BE69 09DA3B6B9F007B793000AD17A7D351417B6F26E02AD4A6F8BFE1A8C4317F8318 910C5024C8E2C03AAB963055C22D17764C9CEC7DA42FCFBC586DF4F27CB97EDF 91E4533A3151FBCABBF65E59D990719D9282F3CA8AA92D63E3ADDE7A50490CE6 FB007A2A55050A249D0F8A9072F46C99E07FAD9D5F4FC3C8C8B22F6303A1F66A 2F6F1309A9634760C3FE022D0F409D8CA59708FF8E1B719D93385CF45DBF0163 07A656241714503F4B36710123A458BA644307D21FB127E6E5C58BF02B61EDAF EB501080C38A3A8FF84F44B89FF04D247A332B271641B51A7E144437C3061D27 7696FAC42105CB57EF8A9CF333C47A421DC932A6B43D9CCEF85A3411ED5864F9 B298D46E912BBD32B6786E022BAF2ADC7AB7F8BB0C6620CC3214F537D5566B56 3B231615570AF593EE0549761DE550811271E1119CC8D243CD0471A77E7E0EED D8EF19FAE8BF32CAA225305222253C92C38DF2DDDD7AAE446D5458149A190122 A0191DF1015F768D48F3D2178E0C23E1F10317E80302466303A45615A3407436 DA93795EFAA90933030021B6AF5E51D192A3DEB83BBA00736D34F285018980E7 7ED75E6A08CD036B7E5C23C26A2E830B3C80D6CC389D9CD1B2771A87DE65F364 724E7D38003ED421540C5913F7B9011A60FAAF2B8A1A5F23ED9C52B1E109FC76 5C7B5C32328DF9F5568559B6ABFA3027735330B018A1608420FC7ED24A2E15CE 1FFD450A6F30A96B2DFFB53BD7ED444082A11B56291BB7D4314F341BA50E7D3D F9B3EE0EA5644811868C03108E15A6C7205DE872E64E2EE1236B93FC2F67FC40 3BD90F9D5F701AC1341DC7B4CA23551EAE479E1E157198A9F9D769CA701C2F81 0F6DEA36D65978BAD6982DDD54064D3CA2EAC8A92D91C67CFEF3031133D30516 544A4C047D0FAEB451C84DE160382877F7CED5BAE8B0E35B11CBD630999CF4C3 DD0563183FE38F2184BB79A1ED8D8CC73F69840672CCA0691EEFEBFBFD7FE954 ED86CC20598988A79B18766DC512F900775F2822268948701F4CFEF2E401F59C 7F256EFCBE807B84ABE4897D2AF421A1414DDE91124C371DC0A3353B0101F4F7 B1C420A1E72FD9264C626749838A3B708280E7920272DEEF0AA8DA45E0770540 7E86D3C94486AFE3AF466912059792DF482CD577F5C3787262E3ACE8DC9DFE54 96B92F4B030C162FB06E5F27B1CF0AED009EEADCA116694B39AB4EE9524ABFD9 617E98ED071E7E73E7F44005CA35363BD0241BAF45DFC2E4F667A21F9E9BF405 B8E36DEAC34CAF7FA7A6CF3C8BB6AB36F95486824D732818BFAAD9BBA4D455DF E36539DB08E528CA3888C1C59A2A85E0A2BA4CD7BF5C3543B65512BDB08FC111 A2F6A057955C6F707EA439C2AC6C4FB384FFBA470D94EB2487E9801A6AD0B852 557344D11B32B75400EA521DAE97403E8944C3F53E8200CCA04025633B999B82 443115C1FEC7B23A88C01B6CDDF535D284641D2907E108EDD2DF8219B08FCE78 13BBAC3F7AF36ED59F7749B402731F5B5C45517794349397506D893133AC20FA 9638418357ED6BCFBB08D8397661A3B6769A2B3F9A3884977197EACAA0B79F69 7FA986A578B631B64D33AC14946654E88165BD3650CBA76DAF505353AA5903E0 25D21068E4B22A9225A22DD8B1C543E24E3C899F8A23326BA8E47725F0566DE4 F8339574973D0E332853E558CEDB98EDB1E5974070BA39F770A206753178048A 63FD85278038789231B253D8AA40DFBF9F9BD4C6B7AD7004411947DD57ED4136 27746F0D7FC2EDEA705DAD77A20B7DA96312CEA8FDA0F0BB2372E6F3C40B6A21 0877D53D9CBF2EE9655C72D71F98268DF6F5DAF50992E161B2AE95BC12C395BF 2514307964F9A0E0F2F9506E9CDDE5EC3E99B73C3BAC69A0B57FA2A326D3BDEB 3781BE127BEF9D3F5884F21B91491762C545823F756301D0969E74390361D073 C370C66841F77D1D24E00B582DF2AEBD4E100252248C164DEBFAD4BDEEEF8DC0 188C3ED0AE0F97BD176527B68E7D2A7955AA0675A639A42BF5881C282A03B5D9 BEE37474797FFE8B4A1DF9623D7EBFBC7DEEA4AD3F1166547B3F32AF680B9500 1C86D08B4626E26E5C77B1AC7B0CEAC99BF6EED52519BEB561FEE2CB0FE9576C B194B32896B832B4388841C92A80685DB51D72274938 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont %%BeginFont: CMR17 %!PS-AdobeFont-1.1: CMR17 1.0 %%CreationDate: 1991 Aug 20 16:38:24 % Copyright (C) 1997 American Mathematical Society. All Rights Reserved. 11 dict begin /FontInfo 7 dict dup begin /version (1.0) readonly def /Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def /FullName (CMR17) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle 0 def /isFixedPitch false def end readonly def /FontName /CMR17 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 67 /C put dup 70 /F put dup 71 /G put dup 73 /I put dup 79 /O put dup 81 /Q put dup 83 /S put dup 84 /T put dup 97 /a put dup 99 /c put dup 100 /d put dup 101 /e put dup 105 /i put dup 107 /k put dup 114 /r put dup 116 /t put dup 117 /u put readonly def /FontBBox{-33 -250 945 749}readonly def currentdict end currentfile eexec D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891 016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171 9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758 469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8 2BDBF16FBC7512FAA308A093FE5F075EA0A10A15B0ED05D5039DA41B32B16E95 A3CE9725A429B35BAD796912FC328E3A28F96FCADA20A598E247755E7E7FF801 BDB00E9B9B086BDBE6EDCF841A3EAFC6F5284FED3C634085BA4EE0FC6A026E96 96D55575481B007BF93CA452EE3F71D83FAAB3D9DEDD2A8F96C5840EAE5BE5DC 9322E81DFF5E250DEB386E12A49FC9FBF9B4C25C3283F3CEA74B8278A1B09DA7 E9AE4FBAAF23EDF5A3E07D39385D521547C3AAAB8EB70549756EBA8EF445AF4A 497CA924ACCC3DD5456F8E2C7E36946A5BF14E2E959895F7C94F49137256BE46 4A238684D52792234869EAE1A6D8ADF4E138B79472D2A90A6CA99E2394CC20CD 3841733046175B20CEBE372327BF13428EED6A3E2FDF84C2DBA4B0AD584EE9DF B51828D3B8F385846158C29C9AC3496CB9692DD10219697B2ED4D425C3957FD8 C4600D76E045C561216EF05D38177243C314877A69A1C22E3BEC611A2EE5A216 9B7C264CF6D1839DBBD78A40610F2C0D7C2FE09FFA9822FF55035AD52546970F 83EED2D30EABB1F303091EBC11A5379B12BB3F405E371519A53EA9D66174ED25 A2E55463EC71A97BE4C04B39E68112956117C8252DB6FB14AB64534B4BCD568B 246DB833982B38CDE7268BBF74B6B0C18091E1B1F87D32D66F4DD023D1F10D2A 7736A960F72AC01F733A11023832CD68FB6288A5977743F781214D8FA9C0C3F7 80001321D4397771F728FD9EE57CFE7D9192B887EC883EB1505068261DC40089 7B7D2820F06515CD74513521F6397FEAB3AD3572D9A8269430E407E357422461 1785FC2782047F4C0339D79B16862D939F3A37F78E4E2174E4FBF132539CB760 207999FF86F6A3EBE48EB0A1CA635450FDEEF79EB16D853F3BF4B4156F735FAF A48459456EC1B4D72FF323BEC9D55791F10081E94A83ECDDEE2A3911BE6690D1 2BEDC34E7FB692B36A078DF52E761DA5BCDFFE8C6A64B6E6C633D4656CDB0CEC 198EC18DDD3031695D98888F72AEECD5CFE83260790707C3B471C17575127E2B 4BBAB487E96CEB7AA9346CB3B0C577D55226E44493EA8325E60BA821D9A6A9EE 0F81F3B3B43F30717553D92FE2F68BDEAF47C2C333F2889BA57F977A25424887 F947351DA7609E7D8D22C4F82415A63B83984B040C4C5944C6E36BD9898B0B18 F901B49A3FC5DA8D8DDC72210897B71E4D7DF418A7880B9B174B2A4F328DA7C8 FAD975E5657AF208A8381491BB159576CA96B54D235E6DB1FB320202DE6FE50D 7222DF9D4B745AAA1DC99D233ACEA2308CA87B7672F3057D3AAA3B8EA845F953 404C98E0985BA0BC8B6821F0089F6DB6BADD771406884672C9CEEE3E3136A32A A9DB459E705E041D98756ECB474D11BE8BD55ACCAB3C167B1EA11B7ED5AE6694 91197E9FB37E6AF997D1FF15B186505830789C19821DE5DA62FA888CC2C5AFD3 C0A243E39C48B98F837C87730BBB9A03E8BBDFE260DEB47822BBEA03C0F21FEA B644B1CDD2AEF52E5F2494676DEDEACD9ED89E2FB5FB5FFD14661A8701680FDE F27E716E1FB901227058A4C5C7CCCF9132D643409B46D6AC86828DF63FD40B8A 5D22F0D9B6F00216E3BA318C5B9EFDAD04FD6B1677A5C2A3AB503A436F6A2F55 EE37E9643259976A0A8425ABF863D4C66257E086B6F7811195FC8B20103C40C5 0329309E5C45253372762CA78ADF69AA56B3D642B2D5EAA092369865A2BCBB34 00E9924E31833320B636719A514B977F00261C4F782F63E3CED4B7AB7F58A685 6E529975417F43F801C3205449D4B95B2B1FEFBF1442F33B8A570E30350DB2D2 71CD7E333032367CF335B789D81202E1FE3CEA11382E5BCE751C51396A99FF9F 085D4FBF967AC8452EE633CF741011609A2DF3EB88A35DC3D8B47D1FBDAA8FAA 01EB756739B6AF9462DA13B3CD4DF3DDEE6E682B6500F2BDB6540E7EF295BE67 99D2F86B5A1EC89F20D88DF00962606E0BA15A6BFC772C72E50D4D67DC4B71EF A94FF2339E9377AF27A92BB8B9011338410D30CBCA33C5C90D22BC6C64153708 8EECF6CD2AB2143C6E19F865B11B561B28E5BD2A9271CEB846A588BC34784074 90757581B8DC08CC8D75184991532E9F0D3EA2A142213F0EB8DE2BFEA732B77C 4D854AF02B92AB046123EA0F96544A241BDAFB02B2A9095C342945468C50903D 8E6E8EAE6E72B8F4946DE02DAB91864B53359AE741F095A9D118C42DAD62BC01 DFBB386111F9BFD37B0E8BF85708EEB1B39CE3935288197A5658D74AF4B0E5BA AB39E1B33C8C7021680647E6298B5976C5E7E5A41C478A07A6DF0227630FD1B1 FB3E5E671177D2654598F3EB5393202CE28559AEABD64E343A18AB1664472080 6626EA9B789FC0BB90FA1977514D3C3848163C7CFBCFEBDE0F62C184F83955E4 9306CBE4715809D6789D0A65522229E6D08A139624932EA705229EF99E243DED E125C95EB549BBB9D91B68CD1438EB23BAD1C41762973DC781F324672C3AF537 706A63CBA3090575530CBE5ADA9658C8AB664E475D3F4E83308E82E256A7AD95 E323BB6A94CC0ED154304EAE95EC4175AA24E44C2257B471F14CA9CB6F57BB4D 445E256BA592017F89D45221D3B33A2617C680F5E5292AD80B62DF74195F0FD5 751BCAA8C8D62E0F81AAEE4FCB75A2E12C9C396BB5AD47207ED46FD39C2F03C0 7BE1A50F88BAAA4F639A5DB9807524DED9AEB5FDD9853308CAE5CCCA1D686F7B 65F742D0AD1784A1BF7464373ED630D9DFFD90DE75D664087BED3FB64002FC09 D608A8FB8BEFB9826A20616FA062B878DD536A6698A16107C2BAEAD4DC4A1F9A 762C8BED80715A1CB9280B59C8A239F93817DBAFB78877AB8EBE6D0E06CD47D5 40DA9F1586B227F8F0ABDBDCD2CC96EB61021726CA1C64F06FE173FDE1BFEF53 FE922E4EF539F2F608C745DCFEF232F9E31E4422CC7D234B4199570EEE1A851A 48CB3C0548E5EC973642C70F2341CE45CE1CEDFF5C9CF52E6CE5AE642F20FC76 42FF3636B821A9D200D4917E649C851B79BB6DB61B7BC1FA5DF3574AFAEDB447 F67057131C96B7453F879D0FE8AF4D5291FA4037C4C76CA7BD6C0D9181EE09AA 5C60C008E8A7C4D15748CA6F6FD2B7C6A55CBD816409299616FD4153EF63E121 BDE077D2AF5D2FAEE8B6D6004EB569B398A3ADEE957B2003F524BA8DC248ACC3 9A813584955514610F5ED6CE54ECB06FEAE5638EE92AEDF446D23CB3F7F3F580 B11145C03146D73FA56920AC873813CA164089B9A6C19BAE482B8C94726EAE04 2805019DFF8E8F648FAA35EC7DB1AE3DDAC526ACE937F1DEB3E165699BA5879C 3703AF8BB30CE970E961B253024F82E73356B778BA2B52EF8ED83840E58F35E9 2C3864F74BB81FA96462393371827A3A495F7863B511080A6BEF0F358FC74C3A B69FE66AB8883E2146B42F2B3830F81A320C95CA68A39D7F477E44DBD8E2479B 56D0F614BBE4CC4601C878C8062902FE58978C9C5AD39A6D1F994ED4D0924522 25B011B5FBB553DAAD10CF3A6E26D8DD05F4844028D27DA0838BF0B2BF1B911B 7767E654A897D1C8CA4CAF8350986E853539561E927BC1A080AC4B469B78ED39 A69B5DC9B0D574BDF455EFC6BFA57C51052EBE883EBA245C8CCC570937436480 68BCD6219DB49CD850B41F40829C6F371A8E30249339229560425E452648DC34 FB7F26F92B75C9041F39F535B6755C957008118C634EE6D9109724F0AB20394C 15EDDE5EBA22D8C2FB8ECD7DF64213489A9BE1C7D7349A7564698908F31D40FD 801744BB39011DD455DB7E8D5DC9132FBF394307B6CEF020126C27D09C3B8A94 A48F670A18629AF96288C661284F0255A738E5878D18C0935E5C8979AF0DB055 E40A1E1B43C54743CD0C580CC8816FA290F5607580701433E7D3E478790E601E 3C9FD14BBE364AF5B74709EE37917F2B951A8CE286168981D1C7F47373E2F890 48EE22E3DD583A4FCCF20C5EDF82913664C528AC123F605600505D2A5081EBEB CD70C429F653753449900BD5CFDC00DCDAFFD97DE63002E1501799B7DBD221AE D0CD6AD33125FF1FAF59CF8B4D5E198BCA1C979440C2F9DE7D6C6AD842CA772E 2D8F9F65B1DC63CC3C491ED6AB32E9A215B0A769B44EA1CAC6CFA0E1510DE47E C212486745C14DF4E25EF7BBF691399099B7784329906133CC5196E775FB118E 7B7B0874E7ED63D09BDF212AC3539D13AF2502D417C91D8B32BD547E1D9A6A83 DCFEB61AB6685EF508C4C2501C2595E34ABA0591E6EBBA8CC280EFF9A8E98B41 11B7719DAF2D47900127DDFE0C8E53175F7A47189AFD3D2EB44A7999D7121F44 14A52FDEEC074C08CAF1DAE24CC9409E49E14D5FEE182733A7034293193BEBF7 DD577E6BF8849F541785363CA81DADDCC5F647FB2F9439E6A235E191D56D267C 75BD4FB3A4DB698C89D01E0F2FC151C5CE77C78ABF166532E506AFDF95991554 9E0A103B5059038358CB5E6CAC08201D62B319E2CE16EE236163679DDA3588FB 2BA260BE394C947BE83F2E6355A05A2AE2BB83D857535A75483F247028033D64 EF8657CB9C0ADB35721ABF0120E94750DA098EB448506BABADAC2E57658F7B35 991A4876C41924F45B24D28B9999EC06AFB581A49E2246F19B15CE492F318AE3 364C07D85229D41B91C9156639022FB0845E8E7EA20C1D3E48824842010550B6 4A60DC177B7D081F9FDF00E739C9EEA814A0B7A9F94C67896889367B21D4B8B1 E4916222E5FFD7B01001201F5B820597A872BD8C273EF291D10E1CB3C1EA2078 698B93975D06D3CFDCA014E72059873320E6B3601261A976125F67 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndFont TeXDict begin 40258431 52099146 1000 600 600 (quick.dvi) @start /Fa 149[25 2[45 45 86[45 15[{}4 90.9091 /CMSY10 rf /Fb 134[59 59 81 59 62 44 44 46 1[62 56 62 93 31 2[31 1[56 1[51 62 1[62 54 11[86 78 1[84 2[84 88 2[88 1[42 88 1[70 74 86 81 11[56 56 56 56 56 56 56 1[56 31 37 45[{}41 99.6264 /CMBX12 rf /Fc 129[48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 33[{}94 90.9091 /CMTT10 rf /Fd 139[30 1[30 1[43 38 43 1[21 2[21 43 38 1[34 43 34 1[38 13[43 57 3[58 5[58 60 50 52 1[55 1[58 20[21 44[{}23 74.7198 /CMR9 rf /Fe 252[32 3[{}1 49.8132 /CMSY6 rf /Ff 132[45 40 48 48 66 48 51 35 36 36 48 51 45 51 76 25 48 28 25 51 45 28 40 51 40 51 45 25 2[25 45 25 56 68 68 93 68 68 66 51 67 1[62 71 68 83 57 71 47 33 68 71 59 62 69 66 64 68 71 43 1[71 1[25 25 45 45 45 45 45 45 45 45 45 45 45 25 30 25 71 45 35 35 25 71 1[45 76 45 25 18[76 51 51 53 11[{}89 90.9091 /CMR10 rf /Fg 134[55 55 76 55 58 41 41 43 1[58 52 58 87 29 2[29 1[52 32 48 58 46 58 51 11[80 73 58 78 1[71 79 82 2[82 1[40 1[82 66 69 1[76 74 9[52 1[52 52 52 52 52 52 2[29 46[{}43 90.9091 /CMBX10 rf /Fh 135[71 2[75 52 53 55 1[75 67 75 112 37 2[37 1[67 1[61 75 60 1[65 11[103 94 75 100 1[92 101 105 4[50 2[85 88 1[97 12[67 67 67 67 67 67 49[{}33 119.552 /CMBX12 rf /Fi 252[35 3[{}1 66.4176 /CMSY8 rf /Fj 134[51 3[54 2[38 3[54 81 27 2[27 3[43 1[43 1[49 9[100 6[66 5[50 22[49 49 1[49 48[{}16 99.6264 /CMR12 rf /Fk 138[73 51 1[51 6[70 1[36 3[58 73 58 1[66 12[96 73 1[103 1[103 5[47 1[104 86 2[96 67[{}17 143.462 /CMR17 rf end %%EndProlog %%BeginSetup %%Feature: *Resolution 600dpi TeXDict begin %%BeginPaperSize: Letter letter %%EndPaperSize end %%EndSetup %%Page: 1 1 TeXDict begin 1 0 bop 1125 937 a Fk(CFITSIO)44 b(Quic)l(k)g(Start)e (Guide)1625 1190 y Fj(William)33 b(P)m(ence)2277 1154 y Fi(\003)1666 1394 y Fj(Jan)m(uary)g(2003)120 1916 y Fh(Con)l(ten)l(ts)120 2120 y Fg(1)84 b(In)m(tro)s(duction)2897 b(2)120 2324 y(2)84 b(Installing)35 b(and)g(Using)h(CFITSIO)2080 b(3)120 2528 y(3)84 b(Example)35 b(Programs)2601 b(4)120 2731 y(4)84 b(CFITSIO)33 b(Routines)2603 b(6)256 2844 y Ff(4.1)94 b(Error)30 b(Rep)s(orting)25 b(.)45 b(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)174 b(6)256 2957 y(4.2)94 b(File)32 b(Op)s(en/Close)e(Routines)58 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)174 b(6)256 3070 y(4.3)94 b(HDU-lev)m(el)34 b(Routines)86 b(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)174 b(7)256 3183 y(4.4)94 b(Image)32 b(I/O)e(Routines)80 b(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)174 b(9)256 3296 y(4.5)94 b(T)-8 b(able)31 b(I/O)g(Routines)e(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)129 b(12)256 3409 y(4.6)94 b(Header)31 b(Keyw)m(ord)f(I/O)h(Routines)79 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)129 b(19)256 3522 y(4.7)94 b(Utilit)m(y)33 b(Routines)27 b(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)129 b(22)120 3726 y Fg(5)84 b(CFITSIO)33 b(File)i(Names)g(and)f(Filters)1907 b(23)256 3839 y Ff(5.1)94 b(Creating)31 b(New)g(Files)45 b(.)h(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)129 b(23)256 3951 y(5.2)94 b(Op)s(ening)30 b(Existing)g(Files)41 b(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)129 b(24)256 4064 y(5.3)94 b(Image)32 b(Filtering)56 b(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)129 b(26)465 4177 y(5.3.1)106 b(Extracting)32 b(a)f(subsection)f(of)h(an)f (image)77 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)129 b(26)465 4290 y(5.3.2)106 b(Create)32 b(an)e(Image)h(b)m(y)f(Binning)g(T)-8 b(able)31 b(Columns)i(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)129 b(26)256 4403 y(5.4)94 b(T)-8 b(able)31 b(Filtering)77 b(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)129 b(28)465 4516 y(5.4.1)106 b(Column)30 b(and)g(Keyw)m(ord)g (Filtering)50 b(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)129 b(28)465 4629 y(5.4.2)106 b(Ro)m(w)31 b(Filtering)42 b(.)j(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)129 b(29)465 4742 y(5.4.3)106 b(Go)s(o)s(d)30 b(Time)h(In)m(terv)-5 b(al)31 b(Filtering)62 b(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)129 b(32)465 4855 y(5.4.4)106 b(Spatial)31 b(Region)h(Filtering)59 b(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)129 b(32)465 4968 y(5.4.5)106 b(Example)31 b(Ro)m(w)g(Filters)h(.) 45 b(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)129 b(34)256 5081 y(5.5)94 b(Com)m(bined)30 b(Filtering)i(Examples)45 b(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)129 b(36)120 5284 y Fg(6)84 b(CFITSIO)33 b(Error)i(Status)f(Co)s(des)2069 b(38)p 120 5346 1465 4 v 222 5400 a Fe(\003)258 5431 y Fd(HEASAR)n(C,)25 b(NASA)f(Go)r(ddard)i(Space)f(Fligh)n(t)h(Cen)n (ter)1928 5809 y Ff(1)p eop end %%Page: 2 2 TeXDict begin 2 1 bop 120 573 a Fh(1)135 b(In)l(tro)t(duction)120 776 y Ff(This)34 b(do)s(cumen)m(t)g(is)g(in)m(tended)g(to)h(help)f(y)m (ou)h(quic)m(kly)g(start)g(writing)f(C)g(programs)g(to)h(read)f(and)g (write)120 889 y(FITS)45 b(\014les)g(using)g(the)g(CFITSIO)f(library)-8 b(.)86 b(It)45 b(co)m(v)m(ers)i(the)f(most)f(imp)s(ortan)m(t)h(CFITSIO) d(routines)120 1002 y(that)i(are)f(needed)g(to)h(p)s(erform)d(most)i(t) m(yp)s(es)h(of)f(op)s(erations)g(on)g(FITS)f(\014les.)82 b(F)-8 b(or)45 b(more)f(complete)120 1115 y(information)d(ab)s(out)e (these)i(and)f(all)h(the)f(other)h(a)m(v)-5 b(ailable)42 b(routines)e(in)g(the)h(library)f(please)h(refer)f(to)120 1227 y(the)c(\\CFITSIO)e(User's)i(Reference)g(Guide",)i(whic)m(h)d(is)g (a)m(v)-5 b(ailable)38 b(from)d(the)h(CFITSIO)e(W)-8 b(eb)36 b(site)h(at)120 1340 y Fc(http://heasarc.gsfc.nasa)o(.gov)o (/fit)o(sio)o Ff(.)261 1453 y(F)-8 b(or)41 b(more)f(general)g (information)g(ab)s(out)g(the)g(FITS)f(data)h(format,)j(refer)d(to)g (the)g(follo)m(wing)h(w)m(eb)120 1566 y(page:)g(h)m (ttp://heasarc.gsfc.nasa.go)m(v/do)s(cs/heasa)q(rc/\014ts.h)m(t)q(ml) 261 1679 y(FITS)27 b(stands)h(for)g(Flexible)h(Image)g(T)-8 b(ransp)s(ort)27 b(System)h(and)f(is)h(the)h(standard)e(\014le)h (format)g(used)g(to)120 1792 y(store)j(most)g(astronomical)h(data)g (\014les.)41 b(There)30 b(are)h(2)g(basic)g(t)m(yp)s(es)f(of)h(FITS)f (\014les:)41 b(images)31 b(and)f(tables.)120 1905 y(FITS)j(images)i (often)f(con)m(tain)h(a)f(2-dimensional)g(arra)m(y)h(of)e(pixels)h (represen)m(ting)g(an)g(image)h(of)e(a)h(piece)120 2018 y(of)f(the)f(sky)-8 b(,)34 b(but)e(FITS)g(images)h(can)g(also)h(con)m (tain)g(1-D)f(arra)m(ys)g(\(i.e,)i(a)e(sp)s(ectrum)e(or)i(ligh)m(t)g (curv)m(e\),)h(or)120 2131 y(3-D)40 b(arra)m(ys)f(\(a)g(data)g(cub)s (e\),)i(or)d(ev)m(en)i(higher)e(dimensional)h(arra)m(ys)f(of)h(data.)66 b(An)38 b(image)i(ma)m(y)f(also)120 2244 y(ha)m(v)m(e)30 b(zero)g(dimensions,)e(in)h(whic)m(h)f(case)i(it)f(is)g(referred)f(to)i (as)f(a)g(n)m(ull)g(or)g(empt)m(y)g(arra)m(y)-8 b(.)41 b(The)28 b(supp)s(orted)120 2357 y(datat)m(yp)s(es)f(for)f(the)h(image) h(arra)m(ys)e(are)h(8,)h(16,)g(and)e(32-bit)i(in)m(tegers,)h(and)c(32)j (and)d(64-bit)j(\015oating)f(p)s(oin)m(t)120 2469 y(real)k(n)m(um)m(b)s (ers.)39 b(Both)31 b(signed)g(and)e(unsigned)h(in)m(tegers)h(are)g (supp)s(orted.)261 2582 y(FITS)j(tables)h(con)m(tain)g(ro)m(ws)f(and)g (columns)g(of)g(data,)i(similar)f(to)g(a)g(spreadsheet.)52 b(All)35 b(the)f(v)-5 b(alues)120 2695 y(in)31 b(a)g(particular)g (column)g(m)m(ust)f(ha)m(v)m(e)j(the)e(same)g(datat)m(yp)s(e.)43 b(A)31 b(cell)h(of)f(a)g(column)g(is)g(not)g(restricted)h(to)120 2808 y(a)g(single)f(n)m(um)m(b)s(er,)g(and)f(instead)i(can)f(con)m (tain)i(an)e(arra)m(y)g(or)h(v)m(ector)g(of)g(n)m(um)m(b)s(ers.)41 b(There)31 b(are)h(actually)120 2921 y(2)43 b(subt)m(yp)s(es)f(of)h (FITS)f(tables:)66 b(ASCI)s(I)41 b(and)i(binary)-8 b(.)77 b(As)43 b(the)g(names)g(imply)-8 b(,)46 b(ASCI)s(I)41 b(tables)j(store)120 3034 y(the)37 b(data)h(v)-5 b(alues)37 b(in)g(an)f(ASCI)s(I)g(represen)m(tation)i(whereas)e(binary)h(tables)g (store)h(the)f(data)g(v)-5 b(alues)38 b(in)120 3147 y(a)33 b(more)f(e\016cien)m(t)i(mac)m(hine-readable)f(binary)f(format.)46 b(Binary)33 b(tables)g(are)f(generally)i(more)e(compact)120 3260 y(and)25 b(supp)s(ort)e(more)j(features)f(\(e.g.,)j(a)e(wider)f (range)g(of)h(datat)m(yp)s(es,)h(and)e(v)m(ector)i(columns\))e(than)g (ASCI)s(I)120 3373 y(tables.)261 3486 y(A)31 b(single)g(FITS)f(\014le)h (man)m(y)g(con)m(tain)h(m)m(ultiple)f(images)h(or)f(tables.)42 b(Eac)m(h)31 b(table)h(or)e(image)i(is)f(called)120 3599 y(a)j(Header-Data)j(Unit,)e(or)f(HDU.)h(The)f(\014rst)f(HDU)i(in)e(a)i (FITS)e(\014le)h(m)m(ust)g(b)s(e)f(an)h(image)i(\(but)d(it)i(ma)m(y)120 3711 y(ha)m(v)m(e)30 b(zero)f(axes\))h(and)e(is)h(called)h(the)f (Primary)f(Arra)m(y)-8 b(.)41 b(An)m(y)28 b(additional)i(HDUs)f(in)g (the)f(\014le)h(\(whic)m(h)g(are)120 3824 y(also)i(referred)f(to)h(as)g (`extensions'\))g(ma)m(y)g(con)m(tain)h(either)f(an)f(image)i(or)e(a)h (table.)261 3937 y(Ev)m(ery)38 b(HDU)g(con)m(tains)h(a)f(header)g(con)m (taining)h(k)m(eyw)m(ord)f(records.)62 b(Eac)m(h)38 b(k)m(eyw)m(ord)g (record)g(is)g(80)120 4050 y(ASCI)s(I)29 b(c)m(haracters)j(long)f(and)e (has)i(the)f(follo)m(wing)i(format:)120 4263 y Fc(KEYWORD)46 b(=)h(value)g(/)g(comment)f(string)261 4475 y Ff(The)23 b(k)m(eyw)m(ord)i(name)f(can)g(b)s(e)f(up)g(to)h(8)g(c)m(haracters)i (long)e(\(all)h(upp)s(ercase\).)38 b(The)23 b(v)-5 b(alue)25 b(can)f(b)s(e)f(either)120 4588 y(an)k(in)m(teger)h(or)e(\015oating)i (p)s(oin)m(t)e(n)m(um)m(b)s(er,)h(a)g(logical)i(v)-5 b(alue)27 b(\(T)g(or)f(F\),)i(or)e(a)h(c)m(haracter)i(string)d (enclosed)i(in)120 4701 y(single)e(quotes.)40 b(Eac)m(h)26 b(header)f(b)s(egins)g(with)g(a)h(series)g(of)g(required)f(k)m(eyw)m (ords)g(to)i(describ)s(e)e(the)g(datat)m(yp)s(e)120 4814 y(and)35 b(format)h(of)f(the)h(follo)m(wing)h(data)f(unit,)g(if)f(an)m (y)-8 b(.)57 b(An)m(y)35 b(n)m(um)m(b)s(er)g(of)g(other)h(optional)g(k) m(eyw)m(ords)g(can)120 4927 y(b)s(e)d(included)g(in)g(the)g(header)h (to)g(pro)m(vide)f(other)h(descriptiv)m(e)h(information)e(ab)s(out)h (the)f(data.)51 b(F)-8 b(or)34 b(the)120 5040 y(most)g(part,)g(the)g (CFITSIO)d(routines)j(automatically)i(write)d(the)h(required)f(FITS)f (k)m(eyw)m(ords)i(for)f(eac)m(h)120 5153 y(HDU,)e(so)g(y)m(ou,)g(the)g (programmer,)f(usually)g(do)g(not)h(need)f(to)h(w)m(orry)f(ab)s(out)g (them.)1928 5809 y(2)p eop end %%Page: 3 3 TeXDict begin 3 2 bop 120 573 a Fh(2)135 b(Installing)46 b(and)f(Using)g(CFITSIO)120 776 y Ff(First,)33 b(y)m(ou)f(should)e(do)m (wnload)i(the)g(CFITSIO)e(soft)m(w)m(are)j(and)e(the)h(set)g(of)g (example)h(FITS)e(utilit)m(y)i(pro-)120 889 y(grams)e(from)f(the)g(w)m (eb)h(site)g(at)h(h)m(ttp://heasarc.gsfc.nasa.go)m(v/\014tsio.)47 b(The)30 b(example)h(programs)f(illus-)120 1002 y(trate)g(ho)m(w)e(to)h (p)s(erform)f(man)m(y)g(common)h(t)m(yp)s(es)f(of)h(op)s(erations)g(on) f(FITS)g(\014les)h(using)f(CFITSIO.)f(They)120 1115 y(are)h(also)h (useful)d(when)h(writing)h(a)g(new)f(program)g(b)s(ecause)h(it)g(is)g (often)g(easier)g(to)h(tak)m(e)g(a)f(cop)m(y)g(of)g(one)g(of)120 1227 y(these)k(utilit)m(y)h(programs)e(as)g(a)h(template)h(and)e(then)g (mo)s(dify)f(it)i(for)f(y)m(our)h(o)m(wn)f(purp)s(oses,)f(rather)i (than)120 1340 y(writing)e(the)h(new)f(program)g(completely)i(from)e (scratc)m(h.)261 1453 y(T)-8 b(o)28 b(build)e(the)i(CFITSIO)d(library)i (on)g(Unix)g(platforms,)i(`un)m(tar')e(the)h(source)f(co)s(de)h (distribution)e(\014le)120 1566 y(and)k(then)g(execute)i(the)e(follo)m (wing)i(commands)e(in)g(the)h(directory)f(con)m(taining)i(the)f(source) g(co)s(de:)120 1779 y Fc(>)95 b(./configure)45 b ([--prefix=/target/instal)o(lati)o(on/)o(path)o(])120 1892 y(>)95 b(make)524 b(\(or)47 b('make)f(shared'\))120 2005 y(>)95 b(make)47 b(install)141 b(\(this)46 b(step)h(is)g (optional\))261 2217 y Ff(The)40 b(optional)i('pre\014x')e(argumen)m(t) h(to)g(con\014gure)f(giv)m(es)i(the)f(path)f(to)h(the)g(directory)g (where)f(the)120 2330 y(CFITSIO)30 b(library)i(and)f(include)h(\014les) g(should)f(b)s(e)g(installed)i(via)g(the)f(later)h('mak)m(e)g(install') g(command.)120 2443 y(F)-8 b(or)31 b(example,)120 2655 y Fc(>)95 b(./configure)45 b(--prefix=/usr1/local)261 2868 y Ff(will)21 b(cause)g(the)g('mak)m(e)h(install')g(command)e(to)h (cop)m(y)h(the)e(CFITSIO)f(lib)s(c\014tsio)i(\014le)g(to)g(/usr1/lo)s (cal/lib)120 2981 y(and)35 b(the)h(necessary)g(include)g(\014les)g(to)g (/usr1/lo)s(cal/include)i(\(assuming)e(of)f(course)h(that)h(the)f(pro)s (cess)120 3094 y(has)30 b(p)s(ermission)f(to)j(write)e(to)h(these)g (directories\).)261 3207 y(Pre-compiled)f(v)m(ersions)g(of)g(the)g (CFITSIO)e(DLL)i(library)f(are)h(a)m(v)-5 b(ailable)32 b(for)d(PCs.)40 b(On)29 b(Macin)m(tosh)120 3320 y(mac)m(hines,)46 b(refer)c(to)g(the)h(README.MacOS)g(\014le)f(for)g(instructions)g(on)g (building)f(CFITSIO)g(using)120 3432 y(Co)s(deW)-8 b(arrior.)261 3545 y(An)m(y)40 b(programs)g(that)h(use)f(CFITSIO)f(m)m(ust)h(of)g (course)h(b)s(e)e(link)m(ed)i(with)f(the)g(CFITSIO)f(library)120 3658 y(when)e(creating)i(the)f(executable)i(\014le.)64 b(The)37 b(exact)j(pro)s(cedure)c(for)i(linking)g(a)h(program)e(dep)s (ends)f(on)120 3771 y(y)m(our)31 b(soft)m(w)m(are)i(en)m(vironmen)m(t,) f(but)f(on)g(Unix)g(platforms,)h(the)f(command)g(line)h(to)g(compile)g (and)f(link)g(a)120 3884 y(program)f(will)h(lo)s(ok)g(something)g(lik)m (e)g(this:)120 4097 y Fc(gcc)47 b(-o)g(myprog)f(myprog.c)g(-L.)h (-lcfitsio)e(-lm)i(-lnsl)f(-lsocket)261 4309 y Ff(Y)-8 b(ou)37 b(ma)m(y)g(not)f(need)g(to)h(include)g(all)g(of)f(the)h('m',)h ('nsl',)g(and)e('so)s(c)m(k)m(et')i(system)f(libraries)f(on)g(y)m(our) 120 4422 y(particular)41 b(mac)m(hine.)73 b(T)-8 b(o)42 b(\014nd)d(out)i(what)g(libraries)g(are)g(required)f(on)h(y)m(our)g (\(Unix\))g(system,)j(t)m(yp)s(e)120 4535 y Fc('make)i(testprog')28 b Ff(and)i(see)h(what)f(libraries)h(are)f(then)h(included)e(on)h(the)h (resulting)g(link)f(line.)1928 5809 y(3)p eop end %%Page: 4 4 TeXDict begin 4 3 bop 120 573 a Fh(3)135 b(Example)46 b(Programs)120 776 y Ff(Before)32 b(describing)f(the)h(individual)f (CFITSIO)e(routines)j(in)f(detail,)i(it)e(is)h(instructiv)m(e)g(to)g (\014rst)f(lo)s(ok)h(at)120 889 y(an)27 b(actual)h(program.)40 b(The)26 b(names)h(of)g(the)g(CFITSIO)f(routines)h(are)g(fairly)g (descriptiv)m(e)h(\(they)g(all)g(b)s(egin)120 1002 y(with)i Fc(fits)p 525 1002 29 4 v 33 w Ff(,)h(so)g(it)f(should)g(b)s(e)g (reasonably)g(clear)i(what)e(this)g(program)g(do)s(es:)120 1202 y Fc(------------------------)o(----)o(----)o(---)o(----)o(----)o (---)o(----)o(----)o(---)o(----)o(---)311 1315 y(#include)45 b()311 1428 y(#include)g()120 1541 y(1:)95 b(#include)45 b("fitsio.h")311 1767 y(int)i(main\(int)e(argc,)i (char)f(*argv[]\))311 1879 y({)120 1992 y(2:)286 b(fitsfile)45 b(*fptr;)502 2105 y(char)h(card[FLEN_CARD];)120 2218 y(3:)286 b(int)47 b(status)f(=)h(0,)95 b(nkeys,)46 b(ii;)95 b(/*)47 b(MUST)g(initialize)e(status)h(*/)120 2444 y(4:)286 b(fits_open_file\(&fptr,)42 b(argv[1],)j(READONLY,)h(&status\);)502 2557 y(fits_get_hdrspace\(fptr,)41 b(&nkeys,)46 b(NULL,)g(&status\);) 502 2783 y(for)h(\(ii)g(=)g(1;)g(ii)g(<=)h(nkeys;)e(ii++\))94 b({)597 2896 y(fits_read_record\(fptr,)42 b(ii,)47 b(card,)f (&status\);)g(/*)h(read)f(keyword)g(*/)597 3009 y(printf\("\045s\\n",)e (card\);)502 3121 y(})502 3234 y(printf\("END\\n\\n"\);)90 b(/*)48 b(terminate)d(listing)h(with)g(END)h(*/)502 3347 y(fits_close_file\(fptr,)42 b(&status\);)502 3573 y(if)47 b(\(status\))475 b(/*)47 b(print)g(any)g(error)f(messages)f(*/)120 3686 y(5:)477 b(fits_report_error\(stder)o(r,)42 b(status\);)502 3799 y(return\(status\);)311 3912 y(})120 4025 y (------------------------)o(----)o(----)o(---)o(----)o(----)o(---)o (----)o(----)o(---)o(----)o(---)261 4225 y Ff(This)29 b(program)g(op)s(ens)f(the)h(sp)s(eci\014ed)g(FITS)f(\014le)i(and)e (prin)m(ts)h(out)g(all)h(the)g(header)f(k)m(eyw)m(ords)g(in)g(the)120 4338 y(curren)m(t)h(HDU.)i(Some)e(other)h(p)s(oin)m(ts)f(to)h(notice)h (ab)s(out)e(the)g(program)g(are:)231 4516 y(1.)46 b(The)30 b Fc(fitsio.h)e Ff(header)i(\014le)g(m)m(ust)h(b)s(e)e(included)h(to)h (de\014ne)e(the)i(v)-5 b(arious)30 b(routines)g(and)g(sym)m(b)s(ols)347 4629 y(used)g(in)g(CFITSIO.)231 4812 y(2.)46 b(The)37 b Fc(fitsfile)e Ff(parameter)i(is)g(the)g(\014rst)g(argumen)m(t)g(in)g (almost)h(ev)m(ery)g(CFITSIO)d(routine.)61 b(It)347 4925 y(is)41 b(a)h(p)s(oin)m(ter)f(to)h(a)g(structure)e(\(de\014ned)g(in)h Fc(fitsio.h)p Ff(\))f(that)h(stores)h(information)f(ab)s(out)g(the)347 5038 y(particular)i(FITS)e(\014le)h(that)h(the)g(routine)f(will)g(op)s (erate)h(on.)76 b(Memory)43 b(for)f(this)g(structure)f(is)347 5151 y(automatically)36 b(allo)s(cated)e(when)e(the)h(\014le)g(is)f (\014rst)g(op)s(ened)g(or)h(created,)h(and)e(is)h(freed)f(when)g(the) 347 5264 y(\014le)f(is)f(closed.)231 5447 y(3.)46 b(Almost)41 b(ev)m(ery)f(CFITSIO)e(routine)h(has)h(a)g Fc(status)d Ff(parameter)j(as)g(the)g(last)g(argumen)m(t.)69 b(The)347 5560 y(status)28 b(v)-5 b(alue)28 b(is)g(also)h(usually)e(returned)g (as)h(the)g(v)-5 b(alue)28 b(of)g(the)f(function)h(itself.)40 b(Normally)29 b(status)1928 5809 y(4)p eop end %%Page: 5 5 TeXDict begin 5 4 bop 347 573 a Ff(=)22 b(0,)i(and)d(a)h(p)s(ositiv)m (e)h(status)f(v)-5 b(alue)22 b(indicates)h(an)f(error)f(of)h(some)g (sort.)38 b(The)22 b(status)g(v)-5 b(ariable)22 b(m)m(ust)347 686 y(alw)m(a)m(ys)33 b(b)s(e)d(initialized)j(to)f(zero)g(b)s(efore)f (use,)g(b)s(ecause)g(if)g(status)g(is)g(greater)i(than)d(zero)i(on)f (input)347 799 y(then)e(the)g(CFITSIO)f(routines)h(will)g(simply)f (return)g(without)h(doing)g(an)m(ything.)41 b(This)28 b(`inherited)347 912 y(status')46 b(feature,)j(where)44 b(eac)m(h)i(CFITSIO)e(routine)h(inherits)f(the)h(status)g(from)g(the)g (previous)347 1024 y(routine,)f(mak)m(es)d(it)g(unnecessary)f(to)i(c)m (hec)m(k)g(the)f(status)g(v)-5 b(alue)41 b(after)g(ev)m(ery)h(single)f (CFITSIO)347 1137 y(routine)e(call.)66 b(Generally)40 b(y)m(ou)f(should)f(c)m(hec)m(k)i(the)e(status)h(after)g(an)g(esp)s (ecially)h(imp)s(ortan)m(t)e(or)347 1250 y(complicated)33 b(routine)e(has)g(b)s(een)g(called,)i(or)e(after)h(a)f(blo)s(c)m(k)h (of)f(closely)i(related)f(CFITSIO)e(calls.)347 1363 y(This)c(example)h (program)g(has)f(tak)m(en)i(this)f(feature)g(to)g(the)g(extreme)g(and)f (only)h(c)m(hec)m(ks)h(the)f(status)347 1476 y(v)-5 b(alue)31 b(at)g(the)g(v)m(ery)g(end)e(of)i(the)f(program.)231 1664 y(4.)46 b(In)37 b(this)f(example)i(program)f(the)g(\014le)g(name)g (to)h(b)s(e)e(op)s(ened)h(is)g(giv)m(en)h(as)f(an)g(argumen)m(t)g(on)g (the)347 1777 y(command)e(line)h(\()p Fc(arg[1])p Ff(\).)53 b(If)35 b(the)g(\014le)h(con)m(tains)g(more)f(than)g(1)g(HDU)h(or)f (extension,)j(y)m(ou)d(can)347 1890 y(sp)s(ecify)20 b(whic)m(h)g (particular)h(HDU)g(to)g(b)s(e)f(op)s(ened)f(b)m(y)h(enclosing)i(the)e (name)g(or)h(n)m(um)m(b)s(er)e(of)h(the)h(HDU)347 2002 y(in)k(square)h(brac)m(k)m(ets)h(follo)m(wing)g(the)e(ro)s(ot)h(name)g (of)f(the)h(\014le.)39 b(F)-8 b(or)26 b(example,)i Fc(file.fts[0])22 b Ff(op)s(ens)347 2115 y(the)31 b(primary)e(arra)m(y)-8 b(,)32 b(while)f Fc(file.fts[2])c Ff(will)k(mo)m(v)m(e)h(to)f(and)f(op) s(en)f(the)i(2nd)f(extension)h(in)f(the)347 2228 y(\014le,)37 b(and)d Fc(file.fit[EVENTS])d Ff(will)k(op)s(en)g(the)g(extension)g (that)h(has)f(a)g Fc(EXTNAME)46 b(=)i('EVENTS')347 2341 y Ff(k)m(eyw)m(ord)31 b(in)f(the)g(header.)41 b(Note)31 b(that)g(on)f(the)h(Unix)f(command)g(line)h(y)m(ou)f(m)m(ust)g(enclose) i(the)e(\014le)347 2454 y(name)h(in)f(single)h(or)g(double)f(quote)i(c) m(haracters)g(if)e(the)h(name)g(con)m(tains)g(sp)s(ecial)h(c)m (haracters)g(suc)m(h)347 2567 y(as)f(`[')g(or)f(`]'.)347 2717 y(All)44 b(of)f(the)h(CFITSIO)d(routines)i(whic)m(h)g(read)g(or)g (write)h(header)f(k)m(eyw)m(ords,)k(image)d(data,)j(or)347 2830 y(table)32 b(data)f(op)s(erate)g(only)g(within)f(the)h(curren)m (tly)g(op)s(ened)f(HDU)h(in)f(the)h(\014le.)42 b(T)-8 b(o)31 b(read)g(or)f(write)347 2943 y(information)38 b(in)f(a)h(di\013eren)m(t)g(HDU)g(y)m(ou)g(m)m(ust)f(\014rst)g (explicitly)i(mo)m(v)m(e)f(to)h(that)f(HDU)g(\(see)g(the)347 3056 y Fc(fits)p 545 3056 29 4 v 34 w(movabs)p 867 3056 V 32 w(hdu)30 b Ff(and)g Fc(fits)p 1442 3056 V 33 w(movrel)p 1763 3056 V 33 w(hdu)f Ff(routines)h(in)g(section)i(4.3\).)231 3244 y(5.)46 b(The)25 b Fc(fits)p 727 3244 V 33 w(report)p 1048 3244 V 33 w(error)e Ff(routine)i(pro)m(vides)g(a)g(con)m(v)m (enien)m(t)i(w)m(a)m(y)f(to)g(prin)m(t)f(out)g(diagnostic)h(mes-)347 3357 y(sages)32 b(ab)s(out)e(an)m(y)g(error)g(that)h(ma)m(y)g(ha)m(v)m (e)h(o)s(ccurred.)261 3544 y(A)f(set)g(of)f(example)h(FITS)f(utilit)m (y)i(programs)e(are)g(a)m(v)-5 b(ailable)33 b(from)d(the)g(CFITSIO)f(w) m(eb)i(site)g(at)120 3657 y(h)m(ttp://heasarc.gsfc.nasa.go)m(v/do)s (cs/soft)n(w)m(are/)q(\014tsio/c)q(exa)q(mples.h)m(tml.)89 b(These)45 b(are)g(real)g(w)m(orking)120 3770 y(programs)d(whic)m(h)f (illustrate)i(ho)m(w)f(to)h(read,)i(write,)g(and)c(mo)s(dify)g(FITS)h (\014les)f(using)h(the)g(CFITSIO)120 3883 y(library)-8 b(.)38 b(Most)24 b(of)g(these)f(programs)g(are)h(v)m(ery)f(short,)i (con)m(taining)g(only)e(a)h(few)f(10s)h(of)f(lines)g(of)h(executable) 120 3996 y(co)s(de)32 b(or)g(less,)h(y)m(et)g(they)f(p)s(erform)e (quite)i(useful)f(op)s(erations)h(on)g(FITS)f(\014les.)45 b(Running)31 b(eac)m(h)i(program)120 4109 y(without)41 b(an)m(y)g(command)f(line)h(argumen)m(ts)g(will)g(pro)s(duce)e(a)i (short)f(description)h(of)g(ho)m(w)g(to)g(use)f(the)120 4222 y(program.)g(The)30 b(curren)m(tly)h(a)m(v)-5 b(ailable)32 b(programs)e(are:)347 4409 y(\014tscop)m(y)h(-)g(cop)m(y)g(a)g(\014le) 347 4522 y(listhead)g(-)g(list)g(header)f(k)m(eyw)m(ords)347 4635 y(liststruc)h(-)g(sho)m(w)f(the)g(structure)g(of)h(a)g(FITS)e (\014le.)347 4748 y(mo)s(dhead)h(-)g(write)h(or)f(mo)s(dify)g(a)h (header)f(k)m(eyw)m(ord)347 4861 y(imarith)h(-)f(add,)g(subtract,)h(m)m (ultiply)-8 b(,)31 b(or)g(divide)f(2)h(images)347 4974 y(imlist)g(-)g(list)g(pixel)g(v)-5 b(alues)30 b(in)g(an)h(image)347 5087 y(imstat)h(-)e(compute)h(mean,)g(min,)f(and)f(max)i(pixel)g(v)-5 b(alues)30 b(in)g(an)h(image)347 5200 y(tablist)h(-)e(displa)m(y)h(the) f(con)m(ten)m(ts)i(of)f(a)g(FITS)e(table)347 5313 y(tab)s(calc)j(-)f (general)g(table)g(calculator)1928 5809 y(5)p eop end %%Page: 6 6 TeXDict begin 6 5 bop 120 573 a Fh(4)135 b(CFITSIO)44 b(Routines)120 776 y Ff(This)37 b(c)m(hapter)h(describ)s(es)f(the)g (main)h(CFITSIO)e(routines)h(that)h(can)g(b)s(e)f(used)g(to)h(p)s (erform)e(the)i(most)120 889 y(common)31 b(t)m(yp)s(es)f(of)h(op)s (erations)f(on)h(FITS)e(\014les.)120 1136 y Fb(4.1)112 b(Error)37 b(Rep)s(orting)120 1310 y Fc(void)47 b (fits_report_error\(FILE)41 b(*stream,)46 b(int)h(status\))120 1423 y(void)g(fits_get_errstatus\(int)41 b(status,)46 b(char)h(*err_text\))120 1536 y(float)f(fits_get_version\(float)c (*version\))261 1748 y Ff(The)24 b(\014rst)g(routine)g(prin)m(ts)g(out) h(information)g(ab)s(out)f(an)m(y)h(error)f(that)h(has)g(o)s(ccurred.) 38 b(Whenev)m(er)25 b(an)m(y)120 1861 y(CFITSIO)f(routine)i(encoun)m (ters)h(an)f(error)f(it)i(usually)e(writes)h(a)h(message)g(describing)e (the)h(nature)g(of)g(the)120 1974 y(error)g(to)i(an)e(in)m(ternal)h (error)g(message)g(stac)m(k)h(and)e(then)h(returns)e(with)h(a)h(p)s (ositiv)m(e)h(in)m(teger)g(status)f(v)-5 b(alue.)120 2087 y(P)m(assing)28 b(the)g(error)f(status)h(v)-5 b(alue)28 b(to)g(this)g(routine)f(will)h(cause)g(a)g(generic)h(description)e(of)h (the)g(error)f(and)120 2200 y(all)g(the)g(messages)h(from)e(the)h(in)m (ternal)g(CFITSIO)e(error)h(stac)m(k)i(to)g(b)s(e)e(prin)m(ted)g(to)h (the)g(sp)s(eci\014ed)f(stream.)120 2313 y(The)k Fc(stream)f Ff(parameter)h(is)h(usually)f(set)h(equal)g(to)g Fc("stdout")d Ff(or)i Fc("stderr")p Ff(.)261 2426 y(The)25 b(second)g(routine)g (simply)f(returns)g(a)h(30-c)m(haracter)j(descriptiv)m(e)e(error)e (message)i(corresp)s(onding)120 2538 y(to)31 b(the)g(input)e(status)i (v)-5 b(alue.)261 2651 y(The)30 b(last)h(routine)g(returns)e(the)h (curren)m(t)g(CFITSIO)f(library)h(v)m(ersion)h(n)m(um)m(b)s(er.)120 2899 y Fb(4.2)112 b(File)39 b(Op)s(en/Close)f(Routines)120 3072 y Fc(int)47 b(fits_open_file\()d(fitsfile)h(**fptr,)h(char)h (*filename,)e(int)h(mode,)h(int)g(*status\))120 3185 y(int)g(fits_open_data\()d(fitsfile)h(**fptr,)h(char)h(*filename,)e (int)h(mode,)h(int)g(*status\))120 3298 y(int)g (fits_open_table\(fitsfile)41 b(**fptr,)46 b(char)h(*filename,)e(int)h (mode,)h(int)g(*status\))120 3411 y(int)g(fits_open_image\(fitsfile)41 b(**fptr,)46 b(char)h(*filename,)e(int)h(mode,)h(int)g(*status\))120 3637 y(int)g(fits_create_file\(fitsfil)o(e)42 b(**fptr,)k(char)g (*filename,)f(int)i(*status\))120 3750 y(int)g (fits_close_file\(fitsfile)41 b(*fptr,)46 b(int)h(*status\))261 3962 y Ff(These)38 b(routines)f(op)s(en)h(or)f(close)j(a)e(\014le.)63 b(The)37 b(\014rst)g Fc(fitsfile)f Ff(parameter)i(in)g(these)g(and)f (nearly)120 4075 y(ev)m(ery)28 b(other)g(CFITSIO)f(routine)g(is)h(a)g (p)s(oin)m(ter)g(to)g(a)g(structure)g(that)g(CFITSIO)e(uses)h(to)i (store)f(relev)-5 b(an)m(t)120 4188 y(parameters)31 b(ab)s(out)f(eac)m (h)i(op)s(ened)e(\014le.)42 b(Y)-8 b(ou)31 b(should)f(nev)m(er)h (directly)g(read)g(or)f(write)h(an)m(y)g(information)120 4301 y(in)24 b(this)h(structure.)38 b(Memory)26 b(for)e(this)h (structure)f(is)h(allo)s(cated)h(automatically)i(when)c(the)h(\014le)f (is)h(op)s(ened)120 4414 y(or)30 b(created,)i(and)e(is)g(freed)g(when)g (the)g(\014le)h(is)f(closed.)261 4527 y(The)e Fc(mode)e Ff(parameter)j(in)e(the)h Fc(fits)p 1552 4527 29 4 v 34 w(open)p 1778 4527 V 33 w(xxxx)f Ff(set)h(of)g(routines)g(can)g(b)s (e)f(set)i(to)f(either)h Fc(READONLY)120 4640 y Ff(or)h Fc(READWRITE)d Ff(to)j(select)h(the)f(t)m(yp)s(e)f(of)h(\014le)g (access)h(that)f(will)g(b)s(e)f(allo)m(w)m(ed.)42 b(These)29 b(sym)m(b)s(olic)h(constan)m(ts)120 4753 y(are)h(de\014ned)e(in)h Fc(fitsio.h)p Ff(.)261 4866 y(The)j Fc(fits)p 649 4866 V 33 w(open)p 874 4866 V 34 w(file)f Ff(routine)i(op)s(ens)e(the)i (\014le)g(and)e(p)s(ositions)i(the)g(in)m(ternal)g(\014le)f(p)s(oin)m (ter)h(to)g(the)120 4979 y(b)s(eginning)23 b(of)h(the)g(\014le,)h(or)f (to)h(the)f(sp)s(eci\014ed)f(extension)h(if)g(an)g(extension)g(name)g (or)g(n)m(um)m(b)s(er)e(is)i(app)s(ended)120 5092 y(to)j(the)f(\014le)h (name)f(\(see)h(the)g(later)g(section)h(on)e(\\CFITSIO)f(File)i(Names)g (and)f(Filters")i(for)e(a)g(description)120 5204 y(of)32 b(the)f(syn)m(tax\).)45 b Fc(fits)p 945 5204 V 33 w(open)p 1170 5204 V 33 w(data)31 b Ff(b)s(eha)m(v)m(es)g(similarly)h(except)h (that)f(it)g(will)f(mo)m(v)m(e)i(to)f(the)g(\014rst)f(HDU)120 5317 y(con)m(taining)37 b(signi\014can)m(t)f(data)g(if)f(a)h(HDU)g (name)g(or)f(n)m(um)m(b)s(er)f(to)i(op)s(en)f(is)g(not)h(explicitly)g (sp)s(eci\014ed)f(as)120 5430 y(part)23 b(of)h(the)g(\014lename.)39 b(It)23 b(will)h(mo)m(v)m(e)h(to)g(the)e(\014rst)g(IMA)m(GE)i(HDU)f (with)f(NAXIS)h(greater)h(than)e(0,)j(or)d(the)1928 5809 y(6)p eop end %%Page: 7 7 TeXDict begin 7 6 bop 120 573 a Ff(\014rst)29 b(table)h(that)h(do)s(es) e(not)h(con)m(tain)h(the)f(strings)f(`GTI')h(\(a)g(Go)s(o)s(d)g(Time)f (In)m(terv)-5 b(al)31 b(extension\))f(or)g(`OB-)120 686 y(ST)-8 b(ABLE')37 b(in)g(the)g(EXTNAME)h(k)m(eyw)m(ord)f(v)-5 b(alue.)62 b(The)36 b Fc(fits)p 2380 686 29 4 v 34 w(open)p 2606 686 V 33 w(table)g Ff(and)g Fc(fits)p 3290 686 V 34 w(open)p 3516 686 V 33 w(image)120 799 y Ff(routines)f(are)h (similar)f(except)i(that)f(they)f(will)h(mo)m(v)m(e)g(to)g(the)g (\014rst)e(signi\014can)m(t)j(table)f(HDU)g(or)f(image)120 912 y(HDU,)c(resp)s(ectiv)m(ely)h(if)e(a)h(HDU)g(name)g(of)f(n)m(um)m (b)s(er)f(is)i(not)f(sp)s(eci\014ed)g(as)h(part)f(of)g(the)h(input)e (\014le)i(name.)261 1024 y(When)d(op)s(ening)g(an)g(existing)h(\014le,) g(the)g Fc(filename)d Ff(can)i(include)g(optional)i(argumen)m(ts,)f (enclosed)g(in)120 1137 y(square)g(brac)m(k)m(ets)i(that)f(sp)s(ecify)f (\014ltering)h(op)s(erations)f(that)h(should)f(b)s(e)g(applied)g(to)h (the)g(input)e(\014le.)41 b(F)-8 b(or)120 1250 y(example,)263 1428 y Fc(myfile.fit[EVENTS][counts)41 b(>)48 b(0])120 1605 y Ff(op)s(ens)27 b(the)i(table)g(in)f(the)h(EVENTS)e(extension)i (and)f(creates)i(a)e(virtual)h(table)g(b)m(y)f(selecting)i(only)f (those)120 1718 y(ro)m(ws)f(where)f(the)i(COUNTS)d(column)i(v)-5 b(alue)29 b(is)f(greater)h(than)f(0.)40 b(See)28 b(section)h(5)g(for)f (more)g(examples)g(of)120 1831 y(these)j(p)s(o)m(w)m(erful)f (\014ltering)g(capabilities.)261 1944 y(In)38 b Fc(fits)p 581 1944 V 33 w(create)p 902 1944 V 33 w(file)p Ff(,)h(the)g Fc(filename)d Ff(is)j(simply)f(the)g(ro)s(ot)h(name)f(of)h(the)g (\014le)f(to)h(b)s(e)f(created.)120 2057 y(Y)-8 b(ou)36 b(can)g(o)m(v)m(erwrite)h(an)f(existing)g(\014le)g(b)m(y)f(pre\014xing) g(the)h(name)g(with)f(a)h(`!')57 b(c)m(haracter)37 b(\(on)f(the)f(Unix) 120 2170 y(command)30 b(line)g(this)g(m)m(ust)f(b)s(e)g(pre\014xed)g (with)h(a)g(bac)m(kslash,)h(as)f(in)f Fc(`\\!file.fit')p Ff(\).)38 b(If)29 b(the)h(\014le)g(name)120 2282 y(ends)e(with)g Fc(.gz)g Ff(the)h(\014le)g(will)g(b)s(e)f(compressed)g(using)g(the)h (gzip)g(algorithm.)41 b(If)29 b(the)f(\014lename)h(is)g Fc(stdout)120 2395 y Ff(or)g Fc("-")e Ff(\(a)j(single)f(dash)f(c)m (haracter\))j(then)d(the)h(output)f(\014le)h(will)g(b)s(e)f(pip)s(ed)f (to)j(the)f(stdout)f(stream.)41 b(Y)-8 b(ou)120 2508 y(can)27 b(c)m(hain)g(sev)m(eral)g(tasks)g(together)h(b)m(y)f(writing)f (the)h(output)f(from)g(the)g(\014rst)g(task)h(to)g Fc(stdout)e Ff(and)h(then)120 2621 y(reading)k(the)h(input)e(\014le)i(in)f(the)h (2nd)e(task)i(from)f Fc(stdin)f Ff(or)h Fc("-")p Ff(.)120 2867 y Fb(4.3)112 b(HDU-lev)m(el)38 b(Routines)261 3040 y Ff(The)30 b(routines)g(listed)h(in)f(this)h(section)g(op)s(erate)g (on)f(Header-Data)j(Units)e(\(HDUs\))g(in)f(a)h(\014le.)120 3153 y Fc(________________________)o(____)o(____)o(___)o(____)o(____)o (___)o(____)o(____)o(___)o(____)o(__)120 3266 y(int)47 b(fits_get_num_hdus\(fitsfi)o(le)42 b(*fptr,)k(int)h(*hdunum,)e(int)i (*status\))120 3379 y(int)g(fits_get_hdu_num\(fitsfil)o(e)42 b(*fptr,)94 b(int)47 b(*hdunum\))261 3579 y Ff(The)39 b(\014rst)f(routines)h(returns)f(the)h(total)i(n)m(um)m(b)s(er)d(of)h (HDUs)h(in)e(the)i(FITS)e(\014le,)k(and)c(the)h(second)120 3692 y(routine)33 b(returns)e(the)i(p)s(osition)g(of)g(the)g(curren)m (tly)f(op)s(ened)g(HDU)i(in)e(the)h(FITS)f(\014le)h(\(starting)g(with)g (1,)120 3805 y(not)e(0\).)120 4005 y Fc(________________________)o (____)o(____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o (____)o(___)o(____)o(__)120 4118 y(int)47 b(fits_movabs_hdu\(fitsfile) 41 b(*fptr,)46 b(int)h(hdunum,)f(int)h(*hdutype,)e(int)i(*status\))120 4231 y(int)g(fits_movrel_hdu\(fitsfile)41 b(*fptr,)46 b(int)h(nmove,)94 b(int)47 b(*hdutype,)e(int)i(*status\))120 4344 y(int)g(fits_movnam_hdu\(fitsfile)41 b(*fptr,)46 b(int)h(hdutype,)f(char)g(*extname,)1075 4457 y(int)g(extver,)g(int)h (*status\))261 4657 y Ff(These)31 b(routines)g(enable)h(y)m(ou)f(to)h (mo)m(v)m(e)g(to)g(a)g(di\013eren)m(t)f(HDU)h(in)f(the)g(\014le.)43 b(Most)32 b(of)g(the)f(CFITSIO)120 4770 y(functions)h(whic)m(h)h(read)g (or)g(write)g(k)m(eyw)m(ords)g(or)g(data)h(op)s(erate)f(only)h(on)e (the)h(curren)m(tly)g(op)s(ened)g(HDU)120 4883 y(in)i(the)g(\014le.)54 b(The)34 b(\014rst)g(routine)h(mo)m(v)m(es)h(to)g(the)f(sp)s(eci\014ed) f(absolute)i(HDU)f(n)m(um)m(b)s(er)f(in)g(the)h(FITS)f(\014le)120 4996 y(\(the)e(\014rst)f(HDU)i(=)e(1\),)i(whereas)f(the)g(second)f (routine)h(mo)m(v)m(es)h(a)f(relativ)m(e)i(n)m(um)m(b)s(er)d(of)h(HDUs) g(forw)m(ard)120 5109 y(or)f(bac)m(kw)m(ard)h(from)e(the)i(curren)m (tly)f(op)s(en)f(HDU.)i(The)f Fc(hdutype)e Ff(parameter)i(returns)f (the)i(t)m(yp)s(e)f(of)g(the)120 5222 y(newly)e(op)s(ened)g(HDU,)i(and) e(will)h(b)s(e)f(equal)h(to)g(one)g(of)g(these)g(sym)m(b)s(olic)g (constan)m(t)h(v)-5 b(alues:)41 b Fc(IMAGE)p 3564 5222 V 33 w(HDU,)120 5334 y(ASCII)p 366 5334 V 33 w(TBL,)47 b(or)g(BINARY)p 1069 5334 V 33 w(TBL)p Ff(.)37 b Fc(hdutype)g Ff(ma)m(y)h(b)s(e)g(set)h(to)g(NULL)f(if)g(it)h(is)g(not)f(needed.)64 b(The)38 b(third)120 5447 y(routine)31 b(mo)m(v)m(es)i(to)f(the)f (\(\014rst\))h(HDU)g(that)f(matc)m(hes)i(the)e(input)g(extension)h(t)m (yp)s(e,)f(name,)h(and)f(v)m(ersion)120 5560 y(n)m(um)m(b)s(er,)23 b(as)f(giv)m(en)i(b)m(y)e(the)g Fc(XTENSION,)46 b(EXTNAME)20 b Ff(\(or)j Fc(HDUNAME)p Ff(\))d(and)i Fc(EXTVER)f Ff(k)m(eyw)m(ords.) 38 b(If)22 b(the)g(input)1928 5809 y(7)p eop end %%Page: 8 8 TeXDict begin 8 7 bop 120 573 a Ff(v)-5 b(alue)34 b(of)f Fc(extver)e Ff(=)i(0,)i(then)e(the)g(v)m(ersion)h(n)m(um)m(b)s(er)d (will)j(b)s(e)e(ignored)i(when)e(lo)s(oking)i(for)f(a)g(matc)m(hing)120 686 y(HDU.)120 898 y Fc(________________________)o(____)o(____)o(___)o (____)o(____)o(___)o(____)o(____)o(___)o(____)o(____)120 1011 y(int)47 b(fits_get_hdu_type\(fitsfi)o(le)42 b(*fptr,)93 b(int)47 b(*hdutype,)f(int)g(*status\))261 1224 y Ff(Get)21 b(the)g(t)m(yp)s(e)f(of)h(the)f(curren)m(t)g(HDU)h(in)f(the)h(FITS)e (\014le:)36 b Fc(IMAGE)p 2435 1224 29 4 v 33 w(HDU,)47 b(ASCII)p 2947 1224 V 33 w(TBL,)f(or)h(BINARY)p 3649 1224 V 33 w(TBL)p Ff(.)120 1436 y Fc(________________________)o(____)o (____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o(____)o (___)120 1549 y(int)g(fits_copy_hdu\(fitsfile)42 b(*infptr,)j(fitsfile) h(*outfptr,)f(int)i(morekeys,)979 1662 y(int)g(*status\))120 1775 y(int)g(fits_copy_file\(fitsfile)41 b(*infptr,)46 b(fitsfile)f(*outfptr,)h(int)h(previous,)979 1888 y(int)g(current,)f (int)g(following,)f(>)j(int)f(*status\))261 2100 y Ff(The)34 b(\014rst)g(routine)g(copies)i(the)e(curren)m(t)g(HDU)i(from)e(the)g (FITS)g(\014le)h(asso)s(ciated)g(with)g(infptr)e(and)120 2213 y(app)s(ends)h(it)j(to)g(the)f(end)f(of)h(the)g(FITS)g(\014le)g (asso)s(ciated)h(with)f(outfptr.)57 b(Space)36 b(ma)m(y)h(b)s(e)e (reserv)m(ed)i(for)120 2326 y Fc(morekeys)32 b Ff(additional)k(k)m(eyw) m(ords)f(in)g(the)f(output)h(header.)53 b(The)35 b(second)f(routine)h (copies)h(an)m(y)f(HDUs)120 2439 y(previous)42 b(to)i(the)e(curren)m(t) h(HDU,)h(and/or)e(the)h(curren)m(t)f(HDU,)i(and/or)f(an)m(y)g(HDUs)g (follo)m(wing)h(the)120 2552 y(curren)m(t)22 b(HDU,)h(dep)s(ending)d (on)i(the)g(v)-5 b(alue)23 b(\(T)-8 b(rue)22 b(or)g(F)-8 b(alse\))24 b(of)e Fc(previous,)45 b(current)p Ff(,)22 b(and)g Fc(following)p Ff(,)120 2665 y(resp)s(ectiv)m(ely)-8 b(.)42 b(F)-8 b(or)32 b(example,)215 2853 y Fc(fits_copy_file\(infptr,) 42 b(outfptr,)k(0,)h(1,)g(1,)g(&status\);)120 3040 y Ff(will)35 b(cop)m(y)h(the)f(curren)m(t)g(HDU)g(and)g(an)m(y)g(HDUs)g (that)h(follo)m(w)g(it)f(from)g(the)g(input)f(to)h(the)h(output)e (\014le,)120 3153 y(but)c(it)h(will)f(not)h(cop)m(y)g(an)m(y)g(HDUs)g (preceding)f(the)h(curren)m(t)f(HDU.)1928 5809 y(8)p eop end %%Page: 9 9 TeXDict begin 9 8 bop 120 573 a Fb(4.4)112 b(Image)38 b(I/O)g(Routines)120 744 y Ff(This)30 b(section)h(lists)g(the)g(more)f (imp)s(ortan)m(t)h(CFITSIO)d(routines)j(whic)m(h)f(op)s(erate)h(on)f (FITS)g(images.)120 956 y Fc(________________________)o(____)o(____)o (___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o(__)120 1069 y(int)47 b(fits_get_img_type\(fitsfi)o(le)42 b(*fptr,)k(int)h (*bitpix,)e(int)i(*status\))120 1181 y(int)g(fits_get_img_dim\()c (fitsfile)j(*fptr,)g(int)h(*naxis,)93 b(int)47 b(*status\))120 1294 y(int)g(fits_get_img_size\(fitsfi)o(le)42 b(*fptr,)k(int)h (maxdim,)93 b(long)47 b(*naxes,)1170 1407 y(int)g(*status\))120 1520 y(int)g(fits_get_img_param\(fitsf)o(ile)41 b(*fptr,)46 b(int)h(maxdim,)94 b(int)47 b(*bitpix,)1218 1633 y(int)g(*naxis,)e (long)i(*naxes,)f(int)h(*status\))261 1844 y Ff(Get)38 b(information)g(ab)s(out)f(the)g(curren)m(tly)g(op)s(ened)g(image)h (HDU.)g(The)f(\014rst)f(routine)h(returns)f(the)120 1957 y(datat)m(yp)s(e)41 b(of)e(the)h(image)h(as)f(\(de\014ned)f(b)m(y)g (the)h Fc(BITPIX)e Ff(k)m(eyw)m(ord\),)43 b(whic)m(h)c(can)h(ha)m(v)m (e)h(the)f(follo)m(wing)120 2070 y(sym)m(b)s(olic)31 b(constan)m(t)g(v)-5 b(alues:)311 2256 y Fc(BYTE_IMG)284 b(=)143 b(8)g(\()47 b(8-bit)g(byte)f(pixels,)g(0)i(-)f(255\))311 2369 y(SHORT_IMG)236 b(=)95 b(16)143 b(\(16)47 b(bit)g(integer)f (pixels\))311 2482 y(LONG_IMG)284 b(=)95 b(32)143 b(\(32-bit)46 b(integer)g(pixels\))311 2595 y(LONGLONG_IMG)92 b(=)j(64)143 b(\(64-bit)46 b(integer)g(pixels\))311 2708 y(FLOAT_IMG)236 b(=)48 b(-32)142 b(\(32-bit)46 b(floating)f(point)i(pixels\))311 2821 y(DOUBLE_IMG)188 b(=)48 b(-64)142 b(\(64-bit)46 b(floating)f(point)i(pixels\))261 3007 y Ff(The)34 b(second)g(and)f (third)g(routines)h(return)f(the)h(n)m(um)m(b)s(er)e(of)i(dimensions)f (in)h(the)g(image)h(\(from)f(the)120 3120 y Fc(NAXIS)25 b Ff(k)m(eyw)m(ord\),)j(and)e(the)h(sizes)g(of)f(eac)m(h)i(dimension)e (\(from)g(the)g Fc(NAXIS1,)46 b(NAXIS2)p Ff(,)26 b(etc.)40 b(k)m(eyw)m(ords\).)120 3233 y(The)g(last)i(routine)f(simply)g(com)m (bines)g(the)h(function)e(of)h(the)h(\014rst)e(3)h(routines.)73 b(The)40 b(input)g Fc(maxdim)120 3346 y Ff(parameter)28 b(in)g(this)f(routine)h(giv)m(es)h(the)f(maxim)m(um)g(n)m(um)m(b)s(er)e (dimensions)h(that)i(ma)m(y)f(b)s(e)f(returned)g(\(i.e.,)120 3459 y(the)k(dimension)e(of)i(the)f Fc(naxes)f Ff(arra)m(y\))120 3670 y Fc(________________________)o(____)o(____)o(___)o(____)o(____)o (___)o(____)o(____)o(___)o(_)120 3783 y(int)47 b (fits_create_img\(fitsfile)41 b(*fptr,)46 b(int)h(bitpix,)f(int)h (naxis,)1075 3896 y(long)f(*naxes,)g(int)h(*status\))261 4107 y Ff(Create)28 b(an)f(image)i(HDU)f(b)m(y)f(writing)g(the)g (required)g(k)m(eyw)m(ords)g(whic)m(h)g(de\014ne)g(the)g(structure)g (of)g(the)120 4220 y(image.)51 b(The)33 b(2nd)f(through)h(4th)h (parameters)f(sp)s(eci\014ed)g(the)g(datat)m(yp)s(e,)j(the)d(n)m(um)m (b)s(er)f(of)i(dimensions,)120 4333 y(and)26 b(the)h(sizes)g(of)f(the)h (dimensions.)39 b(The)26 b(allo)m(w)m(ed)i(v)-5 b(alues)27 b(of)g(the)f Fc(bitpix)f Ff(parameter)i(are)g(listed)g(ab)s(o)m(v)m(e) 120 4446 y(in)33 b(the)g(description)g(of)g(the)g Fc(fits)p 1319 4446 29 4 v 33 w(get)p 1496 4446 V 33 w(img)p 1673 4446 V 34 w(type)f Ff(routine.)48 b(If)32 b(the)h(FITS)f(\014le)h(p)s (oin)m(ted)g(to)h(b)m(y)f Fc(fptr)e Ff(is)120 4559 y(empt)m(y)c (\(previously)f(created)h(with)f Fc(fits)p 1575 4559 V 33 w(create)p 1896 4559 V 33 w(file)p Ff(\))f(then)h(this)g(routine)g (creates)i(a)f(primary)e(arra)m(y)120 4672 y(in)37 b(the)g(\014le,)i (otherwise)f(a)f(new)g(IMA)m(GE)h(extension)g(is)f(app)s(ended)e(to)j (end)f(of)g(the)g(\014le)h(follo)m(wing)g(the)120 4785 y(other)31 b(HDUs)g(in)f(the)g(\014le.)120 4996 y Fc (________________________)o(____)o(____)o(___)o(____)o(____)o(___)o (____)o(____)o(___)o(____)o(_)120 5109 y(int)47 b (fits_write_pix\(fitsfile)41 b(*fptr,)46 b(int)h(datatype,)f(long)g (*fpixel,)836 5222 y(long)h(nelements,)e(void)h(*array,)g(int)h (*status\);)120 5447 y(int)g(fits_write_pixnull\(fitsf)o(ile)41 b(*fptr,)46 b(int)h(datatype,)f(long)g(*fpixel,)836 5560 y(long)h(nelements,)e(void)h(*array,)g(void)h(*nulval,)e(int)i (*status\);)1928 5809 y Ff(9)p eop end %%Page: 10 10 TeXDict begin 10 9 bop 120 686 a Fc(int)47 b(fits_read_pix\(fitsfile)42 b(*fptr,)k(int)94 b(datatype,)46 b(long)g(*fpixel,)979 799 y(long)h(nelements,)e(void)h(*nulval,)g(void)h(*array,)979 912 y(int)g(*anynul,)f(int)g(*status\))261 1124 y Ff(Read)32 b(or)f(write)g(all)h(or)f(part)h(of)f(the)g(FITS)g(image.)44 b(There)31 b(are)h(2)f(di\013eren)m(t)h('write')g(pixel)f(routines:)120 1237 y(The)23 b(\014rst)g(simply)g(writes)h(the)g(input)f(arra)m(y)h (of)g(pixels)g(to)g(the)g(FITS)f(\014le.)39 b(The)23 b(second)h(is)g(similar,)h(except)120 1350 y(that)30 b(it)f(substitutes)g(the)g(appropriate)g(n)m(ull)g(pixel)g(v)-5 b(alue)30 b(in)f(the)g(FITS)f(\014le)h(for)g(an)m(y)g(pixels)g(whic)m (h)g(ha)m(v)m(e)120 1463 y(a)i(v)-5 b(alue)30 b(equal)h(to)g Fc(*nulval)d Ff(\(note)j(that)g(this)f(parameter)g(giv)m(es)i(the)e (address)f(of)i(the)f(n)m(ull)g(pixel)h(v)-5 b(alue,)120 1576 y(not)35 b(the)g(v)-5 b(alue)35 b(itself)7 b(\).)54 b(Similarly)-8 b(,)37 b(when)c(reading)i(an)g(image,)i(CFITSIO)c(will)i (substitute)f(the)h(v)-5 b(alue)120 1689 y(giv)m(en)30 b(b)m(y)e Fc(nulval)f Ff(for)i(an)m(y)g(unde\014ned)d(pixels)j(in)g (the)g(image,)h(unless)e Fc(nulval)46 b(=)i(NULL)p Ff(,)27 b(in)i(whic)m(h)f(case)120 1802 y(no)i(c)m(hec)m(ks)i(will)f(b)s(e)f (made)g(for)g(unde\014ned)e(pixels)j(when)e(reading)i(the)f(FITS)g (image.)261 1914 y(The)35 b Fc(fpixel)f Ff(parameter)i(in)f(these)h (routines)f(is)h(an)f(arra)m(y)h(whic)m(h)f(giv)m(es)i(the)f(co)s (ordinate)g(in)f(eac)m(h)120 2027 y(dimension)24 b(of)i(the)f(\014rst)f (pixel)i(to)f(b)s(e)g(read)g(or)g(written,)h(and)f Fc(nelements)d Ff(is)j(the)g(total)i(n)m(um)m(b)s(er)d(of)h(pixels)120 2140 y(to)i(read)g(or)f(write.)40 b Fc(array)25 b Ff(is)i(the)f (address)g(of)h(an)f(arra)m(y)h(whic)m(h)f(either)h(con)m(tains)h(the)f (pixel)g(v)-5 b(alues)27 b(to)g(b)s(e)120 2253 y(written,)32 b(or)f(will)h(hold)e(the)i(v)-5 b(alues)31 b(of)h(the)f(pixels)h(that)g (are)f(read.)43 b(When)31 b(reading,)h Fc(array)e Ff(m)m(ust)h(ha)m(v)m (e)120 2366 y(b)s(een)k(allo)s(cated)j(large)f(enough)e(to)i(hold)e (all)i(the)f(returned)f(pixel)h(v)-5 b(alues.)57 b(These)36 b(routines)f(starts)i(at)120 2479 y(the)e Fc(fpixel)d Ff(lo)s(cation)k(and)e(then)g(read)h(or)f(write)h(the)f Fc(nelements)e Ff(pixels,)k(con)m(tin)m(uing)g(on)e(successiv)m(e)120 2592 y(ro)m(ws)f(of)g(the)g(image)h(if)f(necessary)-8 b(.)49 b(F)-8 b(or)34 b(example,)h(to)e(write)g(an)g(en)m(tire)h(2D)g (image,)h(set)e Fc(fpixel[0])46 b(=)120 2705 y(fpixel[1])f(=)j(1)p Ff(,)35 b(and)f Fc(nelements)46 b(=)h(NAXIS1)f(*)i(NAXIS2)p Ff(.)j(Or)34 b(to)i(read)e(just)g(the)h(10th)h(ro)m(w)e(of)h(the)120 2818 y(image,)50 b(set)45 b Fc(fpixel[0])g(=)j(1,)f(fpixel[1])e(=)j(10) p Ff(,)g(and)c Fc(nelements)h(=)i(NAXIS1)p Ff(.)82 b(The)45 b Fc(datatype)120 2931 y Ff(parameter)28 b(sp)s(eci\014es)e(the)i (datat)m(yp)s(e)g(of)f(the)g(C)g Fc(array)e Ff(in)i(the)g(program,)h (whic)m(h)f(need)g(not)g(b)s(e)g(the)g(same)120 3044 y(as)32 b(the)f(datat)m(yp)s(e)i(of)e(the)h(FITS)f(image)h(itself.)45 b(If)31 b(the)h(datat)m(yp)s(es)g(di\013er)f(then)g(CFITSIO)f(will)i (con)m(v)m(ert)120 3156 y(the)f(data)h(as)f(it)h(is)f(read)g(or)g (written.)42 b(The)31 b(follo)m(wing)h(sym)m(b)s(olic)g(constan)m(ts)g (are)f(allo)m(w)m(ed)i(for)e(the)g(v)-5 b(alue)120 3269 y(of)31 b Fc(datatype)p Ff(:)215 3457 y Fc(TBYTE)238 b(unsigned)45 b(char)215 3570 y(TSBYTE)190 b(signed)46 b(char)215 3683 y(TSHORT)190 b(signed)46 b(short)215 3796 y(TUSHORT)142 b(unsigned)45 b(short)215 3909 y(TINT)286 b(signed)46 b(int)215 4022 y(TUINT)238 b(unsigned)45 b(int)215 4134 y(TLONG)238 b(signed)46 b(long)215 4247 y(TLONGLONG)g(signed)g(8-byte)g(integer)215 4360 y(TULONG)190 b(unsigned)45 b(long)215 4473 y(TFLOAT)190 b(float)215 4586 y(TDOUBLE)142 b(double)120 4799 y(________________________)o(____) o(____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o(____)120 4912 y(int)47 b(fits_write_subset\(fitsfi)o(le)42 b(*fptr,)k(int)h (datatype,)e(long)h(*fpixel,)740 5024 y(long)h(*lpixel,)f(DTYPE)g (*array,)g(>)h(int)g(*status\))120 5250 y(int)g (fits_read_subset\(fitsfil)o(e)42 b(*fptr,)k(int)95 b(datatype,)45 b(long)h(*fpixel,)740 5363 y(long)h(*lpixel,)f(long)g(*inc,)h(void)f (*nulval,)94 b(void)46 b(*array,)740 5476 y(int)h(*anynul,)f(int)h (*status\))1905 5809 y Ff(10)p eop end %%Page: 11 11 TeXDict begin 11 10 bop 261 573 a Ff(Read)49 b(or)g(write)f(a)h (rectangular)h(section)g(of)f(the)f(FITS)g(image.)97 b(These)49 b(are)g(v)m(ery)g(similar)g(to)120 686 y Fc(fits)p 318 686 29 4 v 33 w(write)p 591 686 V 33 w(pix)37 b Ff(and)f Fc(fits)p 1180 686 V 34 w(read)p 1406 686 V 33 w(pix)g Ff(except)j(that)f(y)m(ou)f(sp)s(ecify)g(the)h(last)g(pixel)g(co)s (ordinate)g(\(the)120 799 y(upp)s(er)22 b(righ)m(t)i(corner)g(of)g(the) h(section\))g(instead)f(of)g(the)h(n)m(um)m(b)s(er)d(of)i(pixels)h(to)f (b)s(e)g(read.)38 b(The)23 b(read)h(routine)120 912 y(also)39 b(has)e(an)h Fc(inc)f Ff(parameter)h(whic)m(h)f(can)i(b)s(e)e(used)g (to)h(read)g(only)g(ev)m(ery)g Fc(inc-th)e Ff(pixel)i(along)h(eac)m(h) 120 1024 y(dimension)28 b(of)h(the)g(image.)41 b(Normally)30 b Fc(inc[0])46 b(=)h(inc[1])f(=)i(1)28 b Ff(to)i(read)e(ev)m(ery)i (pixel)f(in)f(a)h(2D)h(image.)120 1137 y(T)-8 b(o)31 b(read)f(ev)m(ery)h(other)g(pixel)g(in)f(the)g(en)m(tire)i(2D)f(image,) h(set)311 1325 y Fc(fpixel[0])45 b(=)j(fpixel[1])d(=)i(1)311 1438 y(lpixel[0])e(=)j({NAXIS1})311 1551 y(lpixel[1])d(=)j({NAXIS2})311 1664 y(inc[0])e(=)h(inc[1])g(=)g(2)261 1851 y Ff(Or,)30 b(to)h(read)f(the)h(8th)g(ro)m(w)f(of)h(a)f(2D)i(image,)f(set)311 2039 y Fc(fpixel[0])45 b(=)j(1)311 2152 y(fpixel[1])d(=)j(8)311 2265 y(lpixel[0])d(=)j({NAXIS1})311 2378 y(lpixel[1])d(=)j(8)311 2491 y(inc[0])e(=)h(inc[1])g(=)g(1)1905 5809 y Ff(11)p eop end %%Page: 12 12 TeXDict begin 12 11 bop 120 573 a Fb(4.5)112 b(T)-9 b(able)38 b(I/O)g(Routines)120 744 y Ff(This)30 b(section)h(lists)g(the)g(most)f (imp)s(ortan)m(t)h(CFITSIO)e(routines)h(whic)m(h)g(op)s(erate)h(on)f (FITS)g(tables.)120 957 y Fc(________________________)o(____)o(____)o (___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)o (____)o(__)120 1070 y(int)47 b(fits_create_tbl\(fitsfile)41 b(*fptr,)46 b(int)h(tbltype,)f(long)g(nrows,)g(int)h(tfields,)311 1183 y(char)g(*ttype[],char)d(*tform[],)h(char)i(*tunit[],)e(char)i (*extname,)e(int)i(*status\))261 1395 y Ff(Create)e(a)f(new)f(table)i (extension)f(b)m(y)g(writing)g(the)g(required)f(k)m(eyw)m(ords)h(that)g (de\014ne)f(the)h(table)120 1508 y(structure.)38 b(The)22 b(required)f(n)m(ull)i(primary)e(arra)m(y)i(will)g(b)s(e)f(created)i (\014rst)d(if)i(the)g(\014le)f(is)h(initially)h(completely)120 1621 y(empt)m(y)-8 b(.)41 b Fc(tbltype)26 b Ff(de\014nes)i(the)g(t)m (yp)s(e)h(of)g(table)g(and)f(can)g(ha)m(v)m(e)i(v)-5 b(alues)29 b(of)f Fc(ASCII)p 2931 1621 29 4 v 33 w(TBL)47 b(or)g(BINARY)p 3586 1621 V 33 w(TBL)p Ff(.)120 1734 y(Binary)34 b(tables)h(are)g(generally)g(preferred)e(b)s(ecause)h(they) h(are)f(more)h(e\016cien)m(t)g(and)f(supp)s(ort)f(a)h(greater)120 1847 y(range)d(of)f(column)g(datat)m(yp)s(es)i(than)e(ASCI)s(I)f (tables.)261 1960 y(The)c Fc(nrows)f Ff(parameter)i(giv)m(es)h(the)e (initial)i(n)m(um)m(b)s(er)d(of)i(empt)m(y)g(ro)m(ws)f(to)h(b)s(e)f (allo)s(cated)i(for)f(the)f(table;)120 2073 y(this)h(should)g(normally) g(b)s(e)g(set)h(to)g(0.)40 b(The)26 b Fc(tfields)f Ff(parameter)i(giv)m (es)g(the)g(n)m(um)m(b)s(er)e(of)i(columns)f(in)g(the)120 2186 y(table)e(\(maxim)m(um)f(=)f(999\).)40 b(The)22 b Fc(ttype,)46 b(tform)p Ff(,)24 b(and)e Fc(tunit)f Ff(parameters)i (giv)m(e)i(the)e(name,)h(datat)m(yp)s(e,)120 2299 y(and)34 b(ph)m(ysical)h(units)g(of)f(eac)m(h)i(column,)g(and)e Fc(extname)f Ff(giv)m(es)j(the)f(name)g(for)f(the)h(table)h(\(the)f(v) -5 b(alue)35 b(of)120 2412 y(the)i Fc(EXTNAME)e Ff(k)m(eyw)m(ord\).)61 b(The)36 b(FITS)g(Standard)g(recommends)g(that)i(only)f(letters,)j (digits,)f(and)d(the)120 2524 y(underscore)27 b(c)m(haracter)h(b)s(e)f (used)g(in)g(column)g(names)g(with)g(no)g(em)m(b)s(edded)g(spaces.)40 b(It)27 b(is)h(recommended)120 2637 y(that)j(all)g(the)g(column)f (names)g(in)g(a)h(giv)m(en)g(table)h(b)s(e)d(unique)h(within)g(the)g (\014rst)g(8)h(c)m(haracters.)261 2750 y(The)g(follo)m(wing)i(table)g (sho)m(ws)e(the)h(TF)m(ORM)g(column)f(format)h(v)-5 b(alues)32 b(that)g(are)g(allo)m(w)m(ed)i(in)d(ASCI)s(I)120 2863 y(tables)g(and)f(in)g(binary)g(tables:)502 3051 y Fc(ASCII)46 b(Table)h(Column)f(Format)g(Codes)502 3164 y(------------------------)o (---)o(----)502 3277 y(\(w)h(=)g(column)g(width,)f(d)h(=)h(no.)e(of)i (decimal)d(places)i(to)g(display\))693 3390 y(Aw)142 b(-)48 b(character)d(string)693 3502 y(Iw)142 b(-)48 b(integer)693 3615 y(Fw.d)e(-)i(fixed)e(floating)g(point)693 3728 y(Ew.d)g(-)i(exponential)d(floating)g(point)693 3841 y(Dw.d)h(-)i(exponential)d(floating)g(point)502 4067 y(Binary)h(Table)g(Column)g(Format)g(Codes)502 4180 y(------------------------)o(---)o(----)o(-)502 4293 y(\(r)h(=)g(vector)g(length,)e(default)h(=)i(1\))693 4406 y(rA)95 b(-)47 b(character)e(string)693 4519 y(rAw)i(-)g(array)f (of)i(strings,)d(each)i(of)g(length)f(w)693 4632 y(rL)95 b(-)47 b(logical)693 4744 y(rX)95 b(-)47 b(bit)693 4857 y(rB)95 b(-)47 b(unsigned)f(byte)693 4970 y(rS)95 b(-)47 b(signed)f(byte)h(**)693 5083 y(rI)95 b(-)47 b(signed)f(16-bit)g (integer)693 5196 y(rU)95 b(-)47 b(unsigned)f(16-bit)g(integer)g(**)693 5309 y(rJ)95 b(-)47 b(signed)f(32-bit)g(integer)693 5422 y(rV)95 b(-)47 b(unsigned)f(32-bit)g(integer)g(**)693 5535 y(rK)95 b(-)47 b(signed)f(64-bit)g(integer)1905 5809 y Ff(12)p eop end %%Page: 13 13 TeXDict begin 13 12 bop 693 573 a Fc(rE)95 b(-)47 b(32-bit)f(floating)g (point)693 686 y(rD)95 b(-)47 b(64-bit)f(floating)g(point)693 799 y(rC)95 b(-)47 b(32-bit)f(complex)g(pair)693 912 y(rM)95 b(-)47 b(64-bit)f(complex)g(pair)359 1137 y(**)h(The)g(S,)g(U)g (and)g(V)h(format)e(codes)g(are)h(not)g(actual)f(legal)g(TFORMn)h (values.)502 1250 y(CFITSIO)f(substitutes)e(the)j(somewhat)f(more)g (complicated)f(set)i(of)502 1363 y(keywords)e(that)i(are)g(used)g(to)g (represent)e(unsigned)h(integers)f(or)502 1476 y(signed)h(bytes.)261 1777 y Ff(The)27 b Fc(tunit)e Ff(and)h Fc(extname)f Ff(parameters)j (are)f(optional)h(and)f(ma)m(y)g(b)s(e)g(set)g(to)h(NULL)f(if)g(they)g (are)g(not)120 1890 y(needed.)261 2002 y(Note)41 b(that)f(it)f(ma)m(y)h (b)s(e)f(easier)h(to)g(create)h(a)f(new)e(table)i(b)m(y)g(cop)m(ying)g (the)f(header)g(from)g(another)120 2115 y(existing)31 b(table)h(with)e Fc(fits)p 1089 2115 29 4 v 33 w(copy)p 1314 2115 V 33 w(header)f Ff(rather)h(than)g(calling)i(this)e(routine.) 120 2328 y Fc(________________________)o(____)o(____)o(___)o(____)o (____)o(___)o(____)o(____)o(___)o(____)o(__)120 2441 y(int)47 b(fits_get_num_rows\(fitsfi)o(le)42 b(*fptr,)k(long)g(*nrows,) g(int)h(*status\))120 2554 y(int)g(fits_get_num_cols\(fitsfi)o(le)42 b(*fptr,)k(int)94 b(*ncols,)46 b(int)h(*status\))261 2766 y Ff(Get)37 b(the)g(n)m(um)m(b)s(er)d(of)j(ro)m(ws)f(or)g(columns) g(in)f(the)i(curren)m(t)e(FITS)h(table.)59 b(The)35 b(n)m(um)m(b)s(er)g (of)h(ro)m(ws)g(is)120 2879 y(giv)m(en)e(b)m(y)f(the)g Fc(NAXIS2)e Ff(k)m(eyw)m(ord)j(and)e(the)h(n)m(um)m(b)s(er)f(of)h (columns)g(is)g(giv)m(en)h(b)m(y)f(the)g Fc(TFIELDS)e Ff(k)m(eyw)m(ord)120 2992 y(in)f(the)h(header)f(of)g(the)h(table.)120 3205 y Fc(________________________)o(____)o(____)o(___)o(____)o(____)o (___)o(____)o(____)o(___)o(____)o(__)120 3318 y(int)47 b(fits_get_colnum\(fitsfile)41 b(*fptr,)46 b(int)h(casesen,)f(char)g (*template,)1075 3430 y(int)g(*colnum,)g(int)h(*status\))120 3543 y(int)g(fits_get_colname\(fitsfil)o(e)42 b(*fptr,)k(int)h (casesen,)e(char)i(*template,)1075 3656 y(char)f(*colname,)f(int)i (*colnum,)f(int)h(*status\))261 3869 y Ff(Get)33 b(the)e(column)g(n)m (um)m(b)s(er)f(\(starting)j(with)e(1,)h(not)g(0\))g(of)f(the)h(column)f (whose)g(name)h(matc)m(hes)g(the)120 3982 y(sp)s(eci\014ed)38 b(template)i(name.)66 b(The)38 b(only)h(di\013erence)g(in)f(these)h(2)g (routines)g(is)f(that)i(the)e(2nd)g(one)h(also)120 4095 y(returns)29 b(the)i(name)f(of)h(the)f(column)g(that)h(matc)m(hed)h (the)e(template)i(string.)261 4208 y(Normally)-8 b(,)29 b Fc(casesen)24 b Ff(should)h(b)s(e)h(set)h(to)g Fc(CASEINSEN)p Ff(,)d(but)i(it)g(ma)m(y)h(b)s(e)f(set)h(to)g Fc(CASESEN)d Ff(to)j(force)g(the)120 4320 y(name)j(matc)m(hing)i(to)f(b)s(e)f (case-sensitiv)m(e.)261 4433 y(The)22 b(input)f Fc(template)f Ff(string)i(giv)m(es)i(the)e(name)h(of)f(the)h(desired)e(column)h(and)g (ma)m(y)h(include)f(wildcard)120 4546 y(c)m(haracters:)41 b(a)30 b(`*')g(matc)m(hes)g(an)m(y)f(sequence)g(of)h(c)m(haracters)g (\(including)f(zero)h(c)m(haracters\),)h(`?')40 b(matc)m(hes)120 4659 y(an)m(y)45 b(single)g(c)m(haracter,)50 b(and)44 b(`#')h(matc)m(hes)g(an)m(y)g(consecutiv)m(e)i(string)d(of)h(decimal)h (digits)f(\(0-9\).)85 b(If)120 4772 y(more)27 b(than)g(one)g(column)g (name)g(in)g(the)g(table)h(matc)m(hes)g(the)f(template)h(string,)g (then)f(the)g(\014rst)f(matc)m(h)i(is)120 4885 y(returned)22 b(and)h(the)h(status)f(v)-5 b(alue)24 b(will)g(b)s(e)f(set)h(to)g Fc(COL)p 1962 4885 V 33 w(NOT)p 2139 4885 V 34 w(UNIQUE)e Ff(as)h(a)h(w)m(arning)f(that)h(a)g(unique)e(matc)m(h)120 4998 y(w)m(as)34 b(not)g(found.)50 b(T)-8 b(o)35 b(\014nd)d(the)i(next) g(column)g(that)h(matc)m(hes)g(the)f(template,)i(call)g(this)d(routine) h(again)120 5111 y(lea)m(ving)e(the)f(input)e(status)i(v)-5 b(alue)31 b(equal)g(to)g Fc(COL)p 1832 5111 V 33 w(NOT)p 2009 5111 V 34 w(UNIQUE)p Ff(.)e(Rep)s(eat)i(this)f(pro)s(cess)g(un)m (til)h Fc(status)46 b(=)120 5224 y(COL)p 270 5224 V 34 w(NOT)p 448 5224 V 33 w(FOUND)29 b Ff(is)h(returned.)120 5436 y Fc(________________________)o(____)o(____)o(___)o(____)o(____)o (___)o(____)o(____)o(___)o(____)o(__)120 5549 y(int)47 b(fits_get_coltype\(fitsfil)o(e)42 b(*fptr,)k(int)h(colnum,)f(int)h (*typecode,)1905 5809 y Ff(13)p eop end %%Page: 14 14 TeXDict begin 14 13 bop 1122 573 a Fc(long)47 b(*repeat,)e(long)i (*width,)f(int)h(*status\))120 799 y(int)g(fits_get_eqcoltype\(fitsf)o (ile)41 b(*fptr,)46 b(int)h(colnum,)f(int)h(*typecode,)1122 912 y(long)g(*repeat,)e(long)i(*width,)f(int)h(*status\))261 1106 y Ff(Return)41 b(the)h(datat)m(yp)s(e,)k(v)m(ector)d(rep)s(eat)f (coun)m(t,)j(and)c(the)h(width)f(in)g(b)m(ytes)h(of)g(a)g(single)h (column)120 1219 y(elemen)m(t)h(for)d(column)h(n)m(um)m(b)s(er)f Fc(colnum)p Ff(.)74 b(Allo)m(w)m(ed)44 b(v)-5 b(alues)42 b(for)g(the)g(returned)f(datat)m(yp)s(e)i(in)f(ASCI)s(I)120 1332 y(tables)31 b(are:)42 b Fc(TSTRING,)j(TSHORT,)h(TLONG,)g(TFLOAT,)g (and)h(TDOUBLE)p Ff(.)29 b(Binary)i(tables)g(supp)s(ort)e(these)120 1445 y(additional)22 b(t)m(yp)s(es:)36 b Fc(TLOGICAL,)45 b(TBIT,)h(TBYTE,)g(TINT32BIT,)f(TCOMPLEX)h(and)h(TDBLCOMPLEX)p Ff(.)18 b(The)120 1558 y(negativ)m(e)33 b(of)d(the)h(datat)m(yp)s(e)g (co)s(de)g(v)-5 b(alue)30 b(is)h(returned)e(if)h(it)h(is)g(a)f(v)-5 b(ariable)32 b(length)e(arra)m(y)h(column.)261 1671 y(These)36 b(2)h(routines)f(are)h(similar,)h(except)f(that)g(in)f(the)g(case)i(of) e(scaled)h(in)m(teger)h(columns)e(the)g(2nd)120 1784 y(routine,)28 b(\014t)p 547 1784 28 4 v 33 w(get)p 700 1784 V 34 w(eqcolt)m(yp)s(e,)i(returns)c(the)i('equiv)-5 b(alen)m(t')29 b(datat)m(yp)s(e)g(that)f(is)f(needed)h(to)g(store)g (the)g(scaled)120 1897 y(v)-5 b(alues,)34 b(whic)m(h)e(is)h(not)g (necessarily)g(the)g(same)g(as)g(the)g(ph)m(ysical)g(datat)m(yp)s(e)h (of)f(the)g(unscaled)f(v)-5 b(alues)33 b(as)120 2010 y(stored)h(in)g(the)h(FITS)e(table.)54 b(F)-8 b(or)35 b(example)f(if)h(a)f('1I')h(column)f(in)g(a)h(binary)e(table)j(has)e (TSCALn)e(=)i(1)120 2122 y(and)f(TZER)m(On)f(=)h(32768,)k(then)d(this)f (column)h(e\013ectiv)m(ely)i(con)m(tains)f(unsigned)d(short)i(in)m (teger)h(v)-5 b(alues,)120 2235 y(and)32 b(th)m(us)h(the)g(returned)f (v)-5 b(alue)34 b(of)f(t)m(yp)s(eco)s(de)g(will)h(b)s(e)e(TUSHOR)-8 b(T,)32 b(not)i(TSHOR)-8 b(T.)32 b(Or,)h(if)g(TSCALn)120 2348 y(or)g(TZER)m(On)e(are)j(not)f(in)m(tegers,)i(then)d(the)h(equiv) -5 b(alen)m(t)34 b(datat)m(yp)s(e)g(will)f(b)s(e)g(returned)e(as)i (TFLO)m(A)-8 b(T)33 b(or)120 2461 y(TDOUBLE,)e(dep)s(ending)d(on)j(the) f(size)i(of)e(the)h(in)m(teger.)261 2574 y(The)e(rep)s(eat)h(coun)m(t)h (is)e(alw)m(a)m(ys)j(1)e(in)f(ASCI)s(I)f(tables.)42 b(The)29 b('rep)s(eat')h(parameter)g(returns)f(the)h(v)m(ector)120 2687 y(rep)s(eat)23 b(coun)m(t)h(on)f(the)h(binary)e(table)j(TF)m(ORMn) e(k)m(eyw)m(ord)g(v)-5 b(alue.)39 b(\(ASCI)s(I)22 b(table)i(columns)f (alw)m(a)m(ys)i(ha)m(v)m(e)120 2800 y(rep)s(eat)35 b(=)f(1\).)55 b(The)34 b('width')h(parameter)g(returns)f(the)h(width)f(in)g(b)m(ytes) i(of)f(a)g(single)g(column)g(elemen)m(t)120 2913 y(\(e.g.,)h(a)e('10D') h(binary)d(table)i(column)f(will)h(ha)m(v)m(e)g(width)f(=)g(8,)h(an)f (ASCI)s(I)f(table)i('F12.2')i(column)d(will)120 3026 y(ha)m(v)m(e)39 b(width)d(=)h(12,)j(and)d(a)h(binary)f(table'60A')i(c)m (haracter)g(string)f(column)f(will)h(ha)m(v)m(e)g(width)f(=)g(60\);)120 3139 y(Note)43 b(that)g(this)f(routine)f(supp)s(orts)g(the)h(lo)s(cal)h (con)m(v)m(en)m(tion)h(for)e(sp)s(ecifying)f(arra)m(ys)i(of)f(\014xed)f (length)120 3252 y(strings)32 b(within)f(a)h(binary)f(table)i(c)m (haracter)h(column)d(using)h(the)g(syn)m(tax)g(TF)m(ORM)h(=)e('rAw')h (where)f('r')120 3364 y(is)f(the)g(total)i(n)m(um)m(b)s(er)d(of)h(c)m (haracters)i(\(=)e(the)g(width)g(of)g(the)g(column\))h(and)e('w')h(is)g (the)h(width)e(of)h(a)h(unit)120 3477 y(string)h(within)f(the)h (column.)45 b(Th)m(us)31 b(if)h(the)g(column)f(has)h(TF)m(ORM)g(=)f ('60A12')k(then)c(this)h(means)g(that)120 3590 y(eac)m(h)38 b(ro)m(w)f(of)g(the)g(table)h(con)m(tains)g(5)g(12-c)m(haracter)i (substrings)35 b(within)i(the)g(60-c)m(haracter)j(\014eld,)e(and)120 3703 y(th)m(us)33 b(in)g(this)h(case)g(this)g(routine)f(will)h(return)e (t)m(yp)s(eco)s(de)i(=)f(TSTRING,)g(rep)s(eat)h(=)f(60,)i(and)e(width)g (=)120 3816 y(12.)47 b(The)31 b(n)m(um)m(b)s(er)g(of)h(substings)g(in)f (an)m(y)i(binary)e(table)i(c)m(haracter)h(string)e(\014eld)g(can)g(b)s (e)f(calculated)j(b)m(y)120 3929 y(\(rep)s(eat/width\).)47 b(A)33 b(n)m(ull)f(p)s(oin)m(ter)g(ma)m(y)h(b)s(e)f(giv)m(en)h(for)f (an)m(y)h(of)f(the)h(output)f(parameters)g(that)h(are)g(not)120 4042 y(needed.)120 4237 y Fc(________________________)o(____)o(____)o (___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)o (____)o(____)120 4349 y(int)47 b(fits_insert_rows\(fitsfil)o(e)42 b(*fptr,)k(long)h(firstrow,)e(long)h(nrows,)h(int)f(*status\))120 4462 y(int)h(fits_delete_rows\(fitsfil)o(e)42 b(*fptr,)k(long)h (firstrow,)e(long)h(nrows,)h(int)f(*status\))120 4575 y(int)h(fits_delete_rowrange\(fit)o(sfil)o(e)42 b(*fptr,)k(char)g (*rangelist,)f(int)i(*status\))120 4688 y(int)g (fits_delete_rowlist\(fits)o(file)41 b(*fptr,)46 b(long)h(*rowlist,)e (long)i(nrows,)f(int)h(*stat\))261 4883 y Ff(Insert)33 b(or)g(delete)h(ro)m(ws)f(in)f(a)i(table.)49 b(The)33 b(blank)f(ro)m(ws)h(are)h(inserted)e(immediately)j(follo)m(wing)f(ro)m (w)120 4996 y Fc(frow)p Ff(.)54 b(Set)35 b Fc(frow)f Ff(=)g(0)i(to)f(insert)g(ro)m(ws)g(at)h(the)f(b)s(eginning)g(of)g(the)g (table.)56 b(The)34 b(\014rst)h('delete')h(routine)120 5109 y(deletes)k Fc(nrows)d Ff(ro)m(ws)i(b)s(eginning)f(with)h(ro)m(w)g Fc(firstrow)p Ff(.)64 b(The)38 b(2nd)g(delete)i(routine)f(tak)m(es)i (an)d(input)120 5222 y(string)27 b(listing)h(the)f(ro)m(ws)f(or)h(ro)m (w)g(ranges)g(to)h(b)s(e)e(deleted)i(\(e.g.,)h('2,4-7,)h(9-12'\).)42 b(The)26 b(last)i(delete)g(routine)120 5334 y(tak)m(es)35 b(an)f(input)e(long)i(in)m(teger)h(arra)m(y)g(that)f(sp)s(eci\014es)f (eac)m(h)i(individual)e(ro)m(w)h(to)g(b)s(e)f(deleted.)51 b(The)33 b(ro)m(w)120 5447 y(lists)j(m)m(ust)f(b)s(e)f(sorted)i(in)f (ascending)g(order.)55 b(All)36 b(these)g(routines)f(up)s(date)f(the)i (v)-5 b(alue)35 b(of)h(the)f Fc(NAXIS2)120 5560 y Ff(k)m(eyw)m(ord)c (to)g(re\015ect)g(the)f(new)g(n)m(um)m(b)s(er)f(of)i(ro)m(ws)f(in)g (the)h(table.)1905 5809 y(14)p eop end %%Page: 15 15 TeXDict begin 15 14 bop 120 573 a Fc(________________________)o(____)o (____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o(____)o (___)o(____)o(_)120 686 y(int)47 b(fits_insert_col\(fitsfile)41 b(*fptr,)46 b(int)h(colnum,)f(char)h(*ttype,)e(char)i(*tform,)1075 799 y(int)f(*status\))120 912 y(int)h(fits_insert_cols\(fitsfil)o(e)42 b(*fptr,)k(int)h(colnum,)f(int)h(ncols,)f(char)g(**ttype,)1122 1024 y(char)h(**tform,)e(int)i(*status\))120 1250 y(int)g (fits_delete_col\(fitsfile)41 b(*fptr,)46 b(int)h(colnum,)f(int)h (*status\))261 1457 y Ff(Insert)25 b(or)g(delete)h(columns)f(in)f(a)i (table.)39 b Fc(colnum)24 b Ff(giv)m(es)i(the)f(p)s(osition)g(of)g(the) h(column)e(to)i(b)s(e)f(inserted)120 1570 y(or)34 b(deleted)g(\(where)g (the)g(\014rst)f(column)h(of)g(the)g(table)h(is)e(at)i(p)s(osition)f (1\).)52 b Fc(ttype)32 b Ff(and)h Fc(tform)g Ff(giv)m(e)i(the)120 1683 y(column)j(name)h(and)f(column)g(format,)j(where)d(the)h(allo)m(w) m(ed)i(format)d(co)s(des)h(are)g(listed)g(ab)s(o)m(v)m(e)h(in)e(the)120 1796 y(description)45 b(of)g(the)h Fc(fits)p 1088 1796 29 4 v 33 w(create)p 1409 1796 V 33 w(table)d Ff(routine.)85 b(The)45 b(2nd)f('insert')i(routine)f(inserts)g(m)m(ultiple)120 1909 y(columns,)33 b(where)g Fc(ncols)e Ff(is)i(the)g(n)m(um)m(b)s(er)e (of)i(columns)g(to)g(insert,)h(and)e Fc(ttype)f Ff(and)h Fc(tform)g Ff(are)h(arra)m(ys)120 2022 y(of)e(string)f(p)s(oin)m(ters)g (in)g(this)g(case.)120 2229 y Fc(________________________)o(____)o (____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o(____)o (___)120 2342 y(int)47 b(fits_copy_col\(fitsfile)42 b(*infptr,)j (fitsfile)h(*outfptr,)f(int)i(incolnum,)502 2455 y(int)g(outcolnum,)e (int)i(create_col,)d(int)j(*status\);)261 2662 y Ff(Cop)m(y)31 b(a)g(column)g(from)f(one)i(table)f(HDU)h(to)g(another.)42 b(If)31 b Fc(create)p 2609 2662 V 32 w(col)f Ff(=)h(TR)m(UE)g(\(i.e.,)i (not)e(equal)120 2775 y(to)42 b(zero\),)k(then)41 b(a)h(new)f(column)g (will)h(b)s(e)f(inserted)g(in)h(the)f(output)g(table)i(at)f(p)s (osition)g Fc(outcolumn)p Ff(,)120 2888 y(otherwise)31 b(the)f(v)-5 b(alues)31 b(in)f(the)h(existing)g(output)f(column)g(will) h(b)s(e)f(o)m(v)m(erwritten.)120 3095 y Fc(________________________)o (____)o(____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o (____)o(___)o(____)o(__)120 3208 y(int)47 b(fits_write_col\(fitsfile)41 b(*fptr,)46 b(int)h(datatype,)f(int)h(colnum,)e(long)i(firstrow,)979 3321 y(long)g(firstelem,)e(long)h(nelements,)f(void)i(*array,)f(int)h (*status\))120 3434 y(int)g(fits_write_colnull\(fitsf)o(ile)41 b(*fptr,)46 b(int)h(datatype,)f(int)g(colnum,)979 3547 y(long)h(firstrow,)e(long)i(firstelem,)e(long)h(nelements,)979 3660 y(void)h(*array,)f(void)g(*nulval,)g(int)h(*status\))120 3772 y(int)g(fits_write_col_null\(fits)o(file)41 b(*fptr,)46 b(int)h(colnum,)f(long)g(firstrow,)979 3885 y(long)h(firstelem,)e(long) h(nelements,)f(int)i(*status\))120 4111 y(int)g (fits_read_col\(fitsfile)42 b(*fptr,)k(int)h(datatype,)e(int)i(colnum,) f(long)g(firstrow,)454 4224 y(long)h(firstelem,)e(long)h(nelements,)f (void)i(*nulval,)f(void)g(*array,)454 4337 y(int)h(*anynul,)f(int)g (*status\))261 4657 y Ff(W)-8 b(rite)45 b(or)e(read)g(elemen)m(ts)i(in) e(column)g(n)m(um)m(b)s(er)f Fc(colnum)p Ff(,)j(starting)f(with)f(ro)m (w)g Fc(firstsrow)e Ff(and)120 4770 y(elemen)m(t)34 b Fc(firstelem)c Ff(\(if)j(it)g(is)g(a)g(v)m(ector)h(column\).)47 b Fc(firstelem)30 b Ff(is)j(ignored)g(if)f(it)h(is)g(a)g(scalar)g (column.)120 4883 y(The)c Fc(nelements)f Ff(n)m(um)m(b)s(er)g(of)i (elemen)m(ts)i(are)e(read)g(or)f(written)h(con)m(tin)m(uing)h(on)f (successiv)m(e)h(ro)m(ws)f(of)g(the)120 4996 y(table)37 b(if)f(necessary)-8 b(.)59 b Fc(array)35 b Ff(is)h(the)h(address)e(of)h (an)g(arra)m(y)h(whic)m(h)f(either)h(con)m(tains)g(the)g(v)-5 b(alues)36 b(to)h(b)s(e)120 5109 y(written,)28 b(or)e(will)h(hold)g (the)f(returned)g(v)-5 b(alues)27 b(that)g(are)g(read.)39 b(When)27 b(reading,)h Fc(array)d Ff(m)m(ust)h(ha)m(v)m(e)i(b)s(een)120 5222 y(allo)s(cated)k(large)g(enough)e(to)h(hold)f(all)h(the)g (returned)e(v)-5 b(alues.)261 5334 y(There)40 b(are)h(3)h(di\013eren)m (t)f('write')g(column)g(routines:)61 b(The)40 b(\014rst)g(simply)g (writes)h(the)g(input)f(arra)m(y)120 5447 y(in)m(to)33 b(the)f(column.)44 b(The)31 b(second)h(is)g(similar,)g(except)h(that)f (it)g(substitutes)g(the)g(appropriate)f(n)m(ull)h(pixel)120 5560 y(v)-5 b(alue)36 b(in)e(the)i(column)e(for)h(an)m(y)h(input)e (arra)m(y)h(v)-5 b(alues)36 b(whic)m(h)f(are)g(equal)h(to)g Fc(*nulval)d Ff(\(note)j(that)f(this)1905 5809 y(15)p eop end %%Page: 16 16 TeXDict begin 16 15 bop 120 573 a Ff(parameter)39 b(giv)m(es)g(the)g (address)e(of)i(the)f(n)m(ull)g(pixel)h(v)-5 b(alue,)41 b(not)d(the)h(v)-5 b(alue)38 b(itself)7 b(\).)66 b(The)38 b(third)f(write)120 686 y(routine)28 b(sets)g(the)g(sp)s(eci\014ed)f (table)i(elemen)m(ts)g(to)g(a)f(n)m(ull)g(v)-5 b(alue.)40 b(New)28 b(ro)m(ws)g(will)g(b)s(e)g(automatical)i(added)120 799 y(to)h(the)g(table)g(if)f(the)h(write)f(op)s(eration)h(extends)g(b) s(ey)m(ond)e(the)i(curren)m(t)f(size)h(of)g(the)f(table.)261 912 y(When)42 b(reading)g(a)h(column,)i(CFITSIO)40 b(will)j(substitute) f(the)g(v)-5 b(alue)43 b(giv)m(en)g(b)m(y)f Fc(nulval)e Ff(for)i(an)m(y)120 1024 y(unde\014ned)25 b(elemen)m(ts)j(in)f(the)g (FITS)f(column,)i(unless)e Fc(nulval)f Ff(or)i Fc(*nulval)46 b(=)h(NULL)p Ff(,)26 b(in)h(whic)m(h)f(case)i(no)120 1137 y(c)m(hec)m(ks)k(will)f(b)s(e)e(made)i(for)f(unde\014ned)e(v)-5 b(alues)31 b(when)e(reading)i(the)f(column.)261 1250 y Fc(datatype)i Ff(sp)s(eci\014es)i(the)g(datat)m(yp)s(e)h(of)g(the)f (C)g Fc(array)e Ff(in)i(the)g(program,)i(whic)m(h)d(need)h(not)h(b)s(e) e(the)120 1363 y(same)42 b(as)f(the)g(in)m(trinsic)h(datat)m(yp)s(e)g (of)f(the)h(column)f(in)g(the)g(FITS)g(table.)74 b(The)40 b(follo)m(wing)j(sym)m(b)s(olic)120 1476 y(constan)m(ts)32 b(are)e(allo)m(w)m(ed)j(for)d(the)g(v)-5 b(alue)31 b(of)g Fc(datatype)p Ff(:)215 1650 y Fc(TSTRING)142 b(array)46 b(of)h(character)f(string)g(pointers)215 1763 y(TBYTE)238 b(unsigned)45 b(char)215 1876 y(TSHORT)190 b(signed)46 b(short)215 1989 y(TUSHORT)142 b(unsigned)45 b(short)215 2102 y(TINT)286 b(signed)46 b(int)215 2215 y(TUINT)238 b(unsigned)45 b(int)215 2328 y(TLONG)238 b(signed)46 b(long)215 2441 y(TLONGLONG)g(signed)g(8-byte)g(integer)215 2554 y(TULONG)190 b(unsigned)45 b(long)215 2667 y(TFLOAT)190 b(float)215 2779 y(TDOUBLE)142 b(double)261 2954 y Ff(Note)35 b(that)e Fc(TSTRING)f Ff(corresp)s(onds)g(to)h(the)h(C)f Fc(char**)e Ff(datat)m(yp)s(e,)k(i.e.,)h(a)d(p)s(oin)m(ter)g(to)h(an)f (arra)m(y)h(of)120 3067 y(p)s(oin)m(ters)c(to)h(an)g(arra)m(y)f(of)h(c) m(haracters.)261 3179 y(An)m(y)38 b(column,)j(regardless)d(of)h(it's)g (in)m(trinsic)f(datat)m(yp)s(e,)k(ma)m(y)d(b)s(e)e(read)h(as)h(a)f Fc(TSTRING)f Ff(c)m(haracter)120 3292 y(string.)i(The)24 b(displa)m(y)i(format)f(of)g(the)h(returned)e(strings)g(will)i(b)s(e)e (determined)h(b)m(y)g(the)g Fc(TDISPn)f Ff(k)m(eyw)m(ord,)120 3405 y(if)j(it)h(exists,)h(otherwise)f(a)f(default)h(format)g(will)f(b) s(e)g(used)f(dep)s(ending)g(on)i(the)f(datat)m(yp)s(e)h(of)g(the)f (column.)120 3518 y(The)22 b Fc(tablist)e Ff(example)j(utilit)m(y)h (program)e(\(a)m(v)-5 b(ailable)25 b(from)d(the)h(CFITSIO)e(w)m(eb)h (site\))i(uses)e(this)g(feature)120 3631 y(to)31 b(displa)m(y)g(all)g (the)g(v)-5 b(alues)30 b(in)g(a)h(FITS)f(table.)120 3805 y Fc(________________________)o(____)o(____)o(___)o(____)o(____)o(___)o (____)o(____)o(___)o(____)o(____)o(___)o(_)120 3918 y(int)47 b(fits_select_rows\(fitsfil)o(e)42 b(*infptr,)j(fitsfile)h(*outfptr,)f (char)i(*expr,)1122 4031 y(int)g(*status\))120 4144 y(int)g (fits_calculator\(fitsfile)41 b(*infptr,)46 b(char)g(*expr,)g(fitsfile) g(*outfptr,)1075 4257 y(char)g(*colname,)f(char)i(*tform,)f(int)h (*status\))261 4431 y Ff(These)26 b(are)h(2)g(of)g(the)f(most)h(p)s(o)m (w)m(erful)f(routines)h(in)f(the)h(CFITSIO)d(library)-8 b(.)40 b(\(See)27 b(the)g(full)f(CFITSIO)120 4544 y(Reference)37 b(Guide)f(for)g(a)h(description)f(of)g(sev)m(eral)i(related)f (routines\).)58 b(These)36 b(routines)g(can)h(p)s(erform)120 4657 y(complicated)47 b(transformations)f(on)f(tables)h(based)f(on)g (an)g(input)g(arithmetic)h(expression)f(whic)m(h)g(is)120 4770 y(ev)-5 b(aluated)38 b(for)e(eac)m(h)h(ro)m(w)g(of)g(the)f(table.) 60 b(The)36 b(\014rst)g(routine)g(will)h(select)h(or)f(cop)m(y)g(ro)m (ws)f(of)h(the)f(table)120 4883 y(for)i(whic)m(h)g(the)g(expression)g (ev)-5 b(aluates)40 b(to)f(TR)m(UE)g(\(i.e.,)i(not)e(equal)g(to)g (zero\).)65 b(The)38 b(second)g(routine)120 4996 y(writes)d(the)g(v)-5 b(alue)35 b(of)g(the)g(expression)g(to)h(a)f(column)g(in)f(the)h (output)g(table.)55 b(Rather)35 b(than)g(supplying)120 5109 y(the)j(expression)f(directly)h(to)g(these)g(routines,)i(the)d (expression)h(ma)m(y)g(also)g(b)s(e)f(written)h(to)g(a)g(text)g(\014le) 120 5222 y(\(con)m(tin)m(ued)f(o)m(v)m(er)f(m)m(ultiple)h(lines)e(if)h (necessary\))g(and)f(the)h(name)f(of)h(the)g(\014le,)h(prep)s(ended)c (with)i(a)h('@')120 5334 y(c)m(haracter,)c(ma)m(y)f(b)s(e)f(supplied)f (as)i(the)f(v)-5 b(alue)31 b(of)g(the)f('expr')g(parameter)h(\(e.g.)42 b('@\014lename.txt'\).)261 5447 y(The)26 b(arithmetic)h(expression)f (ma)m(y)h(b)s(e)f(a)g(function)g(of)g(an)m(y)h(column)f(or)g(k)m(eyw)m (ord)h(in)f(the)g(input)f(table)120 5560 y(as)31 b(sho)m(wn)e(in)h (these)h(examples:)1905 5809 y(16)p eop end %%Page: 17 17 TeXDict begin 17 16 bop 120 573 a Fc(Row)47 b(Selection)e(Expressions:) 263 686 y(counts)h(>)i(0)1240 b(uses)47 b(COUNTS)f(column)g(value)263 799 y(sqrt\()h(X**2)f(+)i(Y**2\))e(<)h(10.)572 b(uses)47 b(X)g(and)g(Y)h(column)e(values)263 912 y(\(X)h(>)h(10\))f(||)g(\(X)g (<)h(-10\))e(&&)h(\(Y)h(==)f(0\))142 b(used)47 b('or')g(and)g('and')f (operators)263 1024 y(gtifilter\(\))1190 b(filter)46 b(on)i(Good)e(Time)h(Intervals)263 1137 y(regfilter\("myregion.reg"\)) 518 b(filter)46 b(using)h(a)g(region)f(file)263 1250 y(@select.txt)1190 b(reads)47 b(expression)e(from)h(a)i(text)e(file)120 1363 y(Calculator)f(Expressions:)263 1476 y(#row)i(\045)g(10)1145 b(modulus)46 b(of)h(the)g(row)g(number)263 1589 y(counts/#exposure)807 b(Fn)47 b(of)h(COUNTS)e(column)g(and)h(EXPOSURE)e(keyword)263 1702 y(dec)i(<)h(85)f(?)g(cos\(dec)f(*)h(#deg\))g(:)g(0)143 b(Conditional)45 b(expression:)g(evaluates)g(to)1934 1815 y(cos\(dec\))g(if)i(dec)g(<)h(85,)f(else)f(0)263 1928 y(\(count{-1}+count+count{+1)o(}\)/3)o(.)137 b(running)46 b(mean)h(of)g(the)g(count)f(values)g(in)h(the)1934 2041 y(previous,)e(current,)g(and)i(next)g(rows)263 2154 y(max\(0,)f (min\(X,)g(1000\)\))619 b(returns)46 b(a)h(value)g(between)f(0)h(-)h (1000)263 2267 y(@calc.txt)1143 b(reads)47 b(expression)e(from)h(a)i (text)e(file)261 2479 y Ff(Most)40 b(standard)d(mathematical)k(op)s (erators)e(and)f(functions)g(are)h(supp)s(orted.)64 b(If)38 b(the)h(expression)120 2592 y(includes)34 b(the)h(name)f(of)h(a)f (column,)i(than)e(the)h(v)-5 b(alue)35 b(in)f(the)g(curren)m(t)h(ro)m (w)f(of)h(the)f(table)i(will)e(b)s(e)g(used)120 2705 y(when)f(ev)-5 b(aluating)35 b(the)f(expression)g(on)g(eac)m(h)h(ro)m (w.)51 b(An)34 b(o\013set)h(to)g(an)e(adjacen)m(t)j(ro)m(w)e(can)g(b)s (e)f(sp)s(eci\014ed)120 2818 y(b)m(y)d(including)g(the)g(o\013set)h(v) -5 b(alue)30 b(in)g(curly)g(brac)m(k)m(ets)h(after)g(the)f(column)g (name)g(as)g(sho)m(wn)g(in)g(one)g(of)g(the)120 2931 y(examples.)40 b(Keyw)m(ord)27 b(v)-5 b(alues)28 b(can)f(b)s(e)g (included)f(in)h(the)h(expression)f(b)m(y)g(preceding)g(the)h(k)m(eyw)m (ord)f(name)120 3044 y(with)h(a)h(`#')f(sign.)40 b(See)28 b(Section)i(5)e(of)h(this)f(do)s(cumen)m(t)g(for)g(more)g(discussion)g (of)g(the)h(expression)f(syn)m(tax.)261 3156 y Fc(gtifilter)h Ff(is)i(a)h(sp)s(ecial)g(function)f(whic)m(h)g(tests)h(whether)f(the)h Fc(TIME)e Ff(column)h(v)-5 b(alue)32 b(in)f(the)g(input)120 3269 y(table)39 b(falls)g(within)f(one)h(or)f(more)h(Go)s(o)s(d)f(Time) g(In)m(terv)-5 b(als.)66 b(By)39 b(default,)h(this)f(function)f(lo)s (oks)h(for)f(a)120 3382 y('GTI')27 b(extension)g(in)f(the)h(same)g (\014le)f(as)h(the)g(input)e(table.)41 b(The)26 b('GTI')g(table)i(con)m (tains)g Fc(START)d Ff(and)h Fc(STOP)120 3495 y Ff(columns)g(whic)m(h)h (de\014ne)f(the)g(range)h(of)g(eac)m(h)h(go)s(o)s(d)f(time)g(in)m(terv) -5 b(al.)41 b(See)27 b(section)g(5.4.3)i(for)d(more)h(details.)261 3608 y Fc(regfilter)35 b Ff(is)i(another)g(sp)s(ecial)h(function)f (whic)m(h)g(selects)h(ro)m(ws)g(based)e(on)h(whether)g(the)g(spatial) 120 3721 y(p)s(osition)23 b(asso)s(ciated)i(with)e(eac)m(h)i(ro)m(w)e (is)g(lo)s(cated)i(within)e(in)g(a)g(sp)s(eci\014ed)g(region)h(of)f (the)h(sky)-8 b(.)38 b(By)24 b(default,)120 3834 y(the)35 b Fc(X)g Ff(and)f Fc(Y)h Ff(columns)g(in)g(the)g(input)f(table)i(are)f (assumed)g(to)h(giv)m(e)g(the)f(p)s(osition)g(of)h(eac)m(h)g(ro)m(w.)55 b(The)120 3947 y(spatial)37 b(region)f(is)f(de\014ned)g(in)g(an)g(ASCI) s(I)f(text)j(\014le)e(whose)h(name)f(is)h(giv)m(en)g(as)g(the)g (argumen)m(t)g(to)g(the)120 4060 y Fc(regfilter)28 b Ff(function.)40 b(See)31 b(section)g(5.4.4)i(for)d(more)g(details.)261 4173 y(The)e Fc(infptr)e Ff(and)i Fc(outfptr)e Ff(parameters)j(in)f (these)g(routines)g(ma)m(y)h(p)s(oin)m(t)f(to)h(the)g(same)f(table)h (or)g(to)120 4286 y(di\013eren)m(t)i(tables.)43 b(In)31 b Fc(fits)p 1092 4286 29 4 v 33 w(select)p 1413 4286 V 33 w(rows)p Ff(,)f(if)g(the)i(input)d(and)i(output)f(tables)i(are)f (the)g(same)h(then)e(the)120 4399 y(ro)m(ws)e(that)h(do)f(not)g (satisfy)h(the)f(selection)i(expression)e(will)g(b)s(e)f(deleted)i (from)f(the)g(table.)41 b(Otherwise,)28 b(if)120 4511 y(the)j(output)g(table)h(is)f(di\013eren)m(t)h(from)f(the)g(input)f (table)i(then)f(the)g(selected)i(ro)m(ws)e(will)h(b)s(e)e(copied)i (from)120 4624 y(the)f(input)e(table)i(to)g(the)g(output)f(table.)261 4737 y(The)i(output)g(column)g(in)g Fc(fits)p 1376 4737 V 33 w(calculator)e Ff(ma)m(y)i(or)h(ma)m(y)g(not)f(already)h(exist.)47 b(If)32 b(it)h(exists)g(then)120 4850 y(the)44 b(calculated)h(v)-5 b(alues)44 b(will)g(b)s(e)f(written)h(to)g(that)h(column,)i(o)m(v)m (erwriting)e(the)e(existing)i(v)-5 b(alues.)81 b(If)120 4963 y(the)36 b(column)g(do)s(esn't)g(exist)g(then)g(the)g(new)g (column)f(will)i(b)s(e)e(app)s(ended)f(to)j(the)f(output)g(table.)58 b(The)120 5076 y Fc(tform)37 b Ff(parameter)i(can)f(b)s(e)g(used)g(to)h (sp)s(ecify)f(the)g(datat)m(yp)s(e)i(of)e(the)h(new)f(column)g(\(e.g.,) k(the)d Fc(TFORM)120 5189 y Ff(k)m(eyw)m(ord)26 b(v)-5 b(alue)26 b(as)g(in)g Fc('1E',)46 b(or)h('1J')p Ff(\).)25 b(If)h Fc(tform)e Ff(=)h(NULL)h(then)f(a)h(default)g(datat)m(yp)s(e)h (will)f(b)s(e)f(used,)120 5302 y(dep)s(ending)k(on)h(the)h(expression.) 120 5514 y Fc(________________________)o(____)o(____)o(___)o(____)o (____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)o(_)1905 5809 y Ff(17)p eop end %%Page: 18 18 TeXDict begin 18 17 bop 120 573 a Fc(int)47 b (fits_read_tblbytes\(fitsf)o(ile)41 b(*fptr,)46 b(long)h(firstrow,)e (long)i(firstchar,)1122 686 y(long)g(nchars,)f(unsigned)f(char)i (*array,)f(int)h(*status\))120 799 y(int)g(fits_write_tblbytes)42 b(\(fitsfile)k(*fptr,)g(long)g(firstrow,)g(long)g(firstchar,)1122 912 y(long)h(nchars,)f(unsigned)f(char)i(*array,)f(int)h(*status\))261 1124 y Ff(These)35 b(2)g(routines)f(pro)m(vide)h(lo)m(w-lev)m(el)j (access)e(to)f(tables)h(and)e(are)h(mainly)g(useful)f(as)h(an)g (e\016cien)m(t)120 1237 y(w)m(a)m(y)i(to)g(cop)m(y)g(ro)m(ws)f(of)g(a)h (table)g(from)f(one)g(\014le)g(to)h(another.)58 b(These)36 b(routines)g(simply)g(read)g(or)g(write)120 1350 y(the)30 b(sp)s(eci\014ed)g(n)m(um)m(b)s(er)f(of)h(consecutiv)m(e)j(c)m (haracters)e(\(b)m(ytes\))h(in)e(a)h(table,)g(without)f(regard)g(for)h (column)120 1463 y(b)s(oundaries.)84 b(F)-8 b(or)47 b(example,)j(to)c (read)f(or)h(write)f(the)h(\014rst)f(ro)m(w)g(of)h(a)g(table,)k(set)c Fc(firstrow)g(=)h(1,)120 1576 y(firstchar)e(=)j(1)p Ff(,)38 b(and)e Fc(nchars)46 b(=)i(NAXIS1)35 b Ff(where)h(the)h(length)g(of)g (a)h(ro)m(w)f(is)f(giv)m(en)i(b)m(y)f(the)g(v)-5 b(alue)37 b(of)120 1689 y(the)31 b Fc(NAXIS1)f Ff(header)h(k)m(eyw)m(ord.)43 b(When)31 b(reading)h(a)f(table,)i Fc(array)d Ff(m)m(ust)h(ha)m(v)m(e)h (b)s(een)f(declared)g(at)h(least)120 1802 y Fc(nchars)d Ff(b)m(ytes)i(long)g(to)g(hold)f(the)g(returned)f(string)i(of)f(b)m (ytes.)1905 5809 y(18)p eop end %%Page: 19 19 TeXDict begin 19 18 bop 120 573 a Fb(4.6)112 b(Header)38 b(Keyw)m(ord)f(I/O)h(Routines)120 744 y Ff(The)30 b(follo)m(wing)i (routines)e(read)g(and)g(write)h(header)f(k)m(eyw)m(ords)g(in)h(the)f (curren)m(t)g(HDU.)120 957 y Fc(________________________)o(____)o(____) o(___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)120 1070 y(int)47 b(fits_get_hdrspace\(fitsfi)o(le)42 b(*fptr,)k(int)h (*keysexist,)d(int)j(*morekeys,)1170 1183 y(int)g(*status\))120 1395 y Ff(Return)36 b(the)g(n)m(um)m(b)s(er)f(of)i(existing)g(k)m(eyw)m (ords)g(\(not)g(coun)m(ting)g(the)g(mandatory)f(END)h(k)m(eyw)m(ord\))g (and)120 1508 y(the)29 b(amoun)m(t)h(of)f(empt)m(y)h(space)g(curren)m (tly)f(a)m(v)-5 b(ailable)31 b(for)e(more)h(k)m(eyw)m(ords.)40 b(The)29 b Fc(morekeys)e Ff(parameter)120 1621 y(ma)m(y)k(b)s(e)f(set)h (to)g(NULL)f(if)g(it's)h(v)-5 b(alue)31 b(is)g(not)f(needed.)120 1834 y Fc(________________________)o(____)o(____)o(___)o(____)o(____)o (___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o(___)120 1947 y(int)47 b(fits_read_record\(fitsfil)o(e)42 b(*fptr,)k(int)h (keynum,)f(char)g(*record,)g(int)h(*status\))120 2060 y(int)g(fits_read_card\(fitsfile)41 b(*fptr,)46 b(char)h(*keyname,)e (char)i(*record,)f(int)g(*status\))120 2172 y(int)h (fits_read_key\(fitsfile)42 b(*fptr,)k(int)h(datatype,)e(char)i (*keyname,)979 2285 y(void)g(*value,)f(char)g(*comment,)f(int)i (*status\))120 2511 y(int)g(fits_find_nextkey\(fitsfi)o(le)42 b(*fptr,)k(char)g(**inclist,)f(int)i(ninc,)1170 2624 y(char)g(**exclist,)e(int)i(nexc,)f(char)h(*card,)f(int)h(*status\))120 2850 y(int)g(fits_read_key_unit\(fitsf)o(ile)41 b(*fptr,)46 b(char)h(*keyname,)e(char)i(*unit,)1218 2963 y(int)g(*status\))261 3175 y Ff(These)d(routines)h(all)g(read)f(a)h(header)f(record)g(in)g (the)h(curren)m(t)f(HDU.)i(The)e(\014rst)f(routine)i(reads)120 3288 y(k)m(eyw)m(ord)40 b(n)m(um)m(b)s(er)f Fc(keynum)f Ff(\(where)i(the)g(\014rst)f(k)m(eyw)m(ord)i(is)f(at)h(p)s(osition)f (1\).)70 b(This)39 b(routine)h(is)g(most)120 3401 y(commonly)29 b(used)f(when)f(sequen)m(tially)j(reading)e(ev)m(ery)i(record)e(in)g (the)h(header)f(from)g(b)s(eginning)g(to)h(end.)120 3514 y(The)d(2nd)f(and)g(3rd)h(routines)g(read)g(the)g(named)f(k)m(eyw)m (ord)i(and)e(return)g(either)i(the)f(whole)g(record,)h(or)f(the)120 3627 y(k)m(eyw)m(ord)g(v)-5 b(alue)26 b(and)e(commen)m(t)j(string.)39 b(In)25 b(eac)m(h)h(case)h(an)m(y)e(non-signi\014can)m(t)h(trailing)h (blank)e(c)m(haracters)120 3740 y(in)30 b(the)h(strings)f(are)h (truncated.)261 3853 y(Wild)c(card)e(c)m(haracters)j(\(*,)g(?,)f(and)e (#\))h(ma)m(y)h(b)s(e)e(used)g(when)g(sp)s(ecifying)h(the)g(name)h(of)f (the)g(k)m(eyw)m(ord)120 3966 y(to)31 b(b)s(e)f(read,)g(in)g(whic)m(h)h (case)g(the)g(\014rst)e(matc)m(hing)j(k)m(eyw)m(ord)e(is)h(returned.) 261 4079 y(The)41 b Fc(datatype)e Ff(parameter)j(sp)s(eci\014es)f(the)g (C)g(datat)m(yp)s(e)h(of)g(the)f(returned)f(k)m(eyw)m(ord)i(v)-5 b(alue)42 b(and)120 4192 y(can)48 b(ha)m(v)m(e)h(one)f(of)g(the)f (follo)m(wing)i(sym)m(b)s(olic)f(constan)m(t)h(v)-5 b(alues:)76 b Fc(TSTRING,)46 b(TLOGICAL)f Ff(\(==)i(in)m(t\),)120 4304 y Fc(TBYTE)p Ff(,)d Fc(TSHORT)p Ff(,)f Fc(TUSHORT)p Ff(,)g Fc(TINT)p Ff(,)h Fc(TUINT)p Ff(,)f Fc(TLONG)p Ff(,)h Fc(TULONG)p Ff(,)f Fc(TFLOAT)p Ff(,)g Fc(TDOUBLE)p Ff(,)g Fc(TCOMPLEX)p Ff(,)g(and)120 4417 y Fc(TDBLCOMPLEX)p Ff(.)e(Data)k(t)m(yp)s(e)f(con)m(v)m(ersion)h(will)f(b)s(e)f(p)s (erformed)f(for)i(n)m(umeric)f(v)-5 b(alues)44 b(if)g(the)g(in)m (trinsic)120 4530 y(FITS)32 b(k)m(eyw)m(ord)h(v)-5 b(alue)33 b(do)s(es)f(not)g(ha)m(v)m(e)i(the)f(same)g(datat)m(yp)s(e.)48 b(The)32 b Fc(comment)e Ff(parameter)j(ma)m(y)g(b)s(e)f(set)120 4643 y(equal)f(to)g(NULL)f(if)h(the)f(commen)m(t)i(string)e(is)g(not)h (needed.)261 4756 y(The)21 b(4th)h(routine)g(pro)m(vides)g(an)g(easy)g (w)m(a)m(y)h(to)f(\014nd)e(all)j(the)f(k)m(eyw)m(ords)g(in)g(the)f (header)h(that)g(matc)m(h)h(one)120 4869 y(of)29 b(the)h(name)f (templates)h(in)f Fc(inclist)e Ff(and)h(do)h(not)h(matc)m(h)g(an)m(y)f (of)g(the)h(name)f(templates)h(in)f Fc(exclist)p Ff(.)120 4982 y Fc(ninc)37 b Ff(and)h Fc(nexc)f Ff(are)i(the)g(n)m(um)m(b)s(er)e (of)h(template)i(strings)e(in)g Fc(inclist)f Ff(and)h Fc(exclist)p Ff(,)g(resp)s(ectiv)m(ely)-8 b(.)120 5095 y(Wild)35 b(cards)f(\(*,)i(?,)f(and)f(#\))g(ma)m(y)h(b)s(e)f(used)f(in) h(the)g(templates)i(to)f(matc)m(h)g(m)m(ultiple)g(k)m(eyw)m(ords.)53 b(Eac)m(h)120 5208 y(time)36 b(this)f(routine)g(is)g(called)h(it)f (returns)f(the)h(next)h(matc)m(hing)g(80-b)m(yte)g(k)m(eyw)m(ord)g (record.)54 b(It)36 b(returns)120 5321 y(status)31 b(=)f Fc(KEY)p 640 5321 29 4 v 33 w(NO)p 769 5321 V 34 w(EXIST)f Ff(if)h(there)h(are)g(no)f(more)g(matc)m(hes.)261 5434 y(The)f(5th)g(routine)g(returns)f(the)i(k)m(eyw)m(ord)g(v)-5 b(alue)29 b(units)g(string,)g(if)h(an)m(y)-8 b(.)41 b(The)28 b(units)h(are)h(recorded)f(at)120 5546 y(the)i(b)s(eginning)e(of)i(the) f(k)m(eyw)m(ord)h(commen)m(t)h(\014eld)e(enclosed)h(in)f(square)g(brac) m(k)m(ets.)1905 5809 y(19)p eop end %%Page: 20 20 TeXDict begin 20 19 bop 120 573 a Fc(________________________)o(____)o (____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o(__)120 686 y(int)47 b(fits_write_key\(fitsfile)41 b(*fptr,)46 b(int)h(datatype,)f(char)g(*keyname,)502 799 y(void)g(*value,)g(char)h (*comment,)e(int)i(*status\))120 912 y(int)g(fits_update_key\(fitsfile) 41 b(*fptr,)46 b(int)h(datatype,)e(char)i(*keyname,)502 1024 y(void)f(*value,)g(char)h(*comment,)e(int)i(*status\))120 1137 y(int)g(fits_write_record\(fitsfi)o(le)42 b(*fptr,)k(char)g (*card,)g(int)h(*status\))120 1363 y(int)g(fits_modify_comment\(fits)o (file)41 b(*fptr,)46 b(char)h(*keyname,)e(char)i(*comment,)502 1476 y(int)g(*status\))120 1589 y(int)g(fits_write_key_unit\(fits)o (file)41 b(*fptr,)46 b(char)h(*keyname,)e(char)i(*unit,)502 1702 y(int)g(*status\))261 1975 y Ff(W)-8 b(rite)32 b(or)f(mo)s(dify)g (a)g(k)m(eyw)m(ord)g(in)g(the)g(header)g(of)g(the)g(curren)m(t)g(HDU.)h (The)e(\014rst)g(routine)h(app)s(ends)120 2087 y(the)f(new)g(k)m(eyw)m (ord)g(to)h(the)f(end)g(of)g(the)g(header,)h(whereas)e(the)i(second)f (routine)g(will)g(up)s(date)g(the)g(v)-5 b(alue)120 2200 y(and)40 b(commen)m(t)h(\014elds)f(of)h(the)g(k)m(eyw)m(ord)g(if)f(it)h (already)h(exists,)h(otherwise)e(it)h(b)s(eha)m(v)m(es)f(lik)m(e)g(the) g(\014rst)120 2313 y(routine)33 b(and)f(app)s(ends)f(the)h(new)h(k)m (eyw)m(ord.)48 b(Note)34 b(that)f Fc(value)e Ff(giv)m(es)j(the)f (address)f(to)h(the)g(v)-5 b(alue)33 b(and)120 2426 y(not)e(the)g(v)-5 b(alue)32 b(itself.)43 b(The)31 b Fc(datatype)d Ff(parameter)k(sp)s (eci\014es)e(the)i(C)e(datat)m(yp)s(e)i(of)f(the)g(k)m(eyw)m(ord)h(v)-5 b(alue)120 2539 y(and)38 b(ma)m(y)g(ha)m(v)m(e)i(an)m(y)f(of)f(the)g(v) -5 b(alues)39 b(listed)g(in)f(the)g(description)g(of)h(the)f(k)m(eyw)m (ord)h(reading)f(routines,)120 2652 y(ab)s(o)m(v)m(e.)71 b(A)40 b(NULL)g(ma)m(y)h(b)s(e)e(en)m(tered)i(for)f(the)g(commen)m(t)h (parameter,)i(in)d(whic)m(h)g(case)h(the)f(k)m(eyw)m(ord)120 2765 y(commen)m(t)31 b(\014eld)f(will)h(b)s(e)f(unmo)s(di\014ed)e(or)i (left)i(blank.)261 2878 y(The)25 b(third)g(routine)h(is)g(more)g (primitiv)m(e)h(and)e(simply)g(writes)h(the)g(80-c)m(haracter)j Fc(card)c Ff(record)h(to)g(the)120 2991 y(header.)40 b(It)30 b(is)g(the)g(programmer's)f(resp)s(onsibilit)m(y)h(in)f(this)h (case)g(to)h(ensure)e(that)h(the)g(record)g(conforms)120 3104 y(to)h(all)g(the)g(FITS)f(format)g(requiremen)m(ts)h(for)f(a)h (header)f(record.)261 3217 y(The)42 b(fourth)f(routine)h(mo)s(di\014es) f(the)h(commen)m(t)h(string)f(in)g(an)f(existing)i(k)m(eyw)m(ord,)j (and)41 b(the)h(last)120 3329 y(routine)34 b(writes)g(or)g(up)s(dates)f (the)h(k)m(eyw)m(ord)h(units)e(string)h(for)g(an)g(existing)h(k)m(eyw)m (ord.)52 b(\(The)34 b(units)f(are)120 3442 y(recorded)d(at)h(the)g(b)s (eginning)f(of)g(the)h(k)m(eyw)m(ord)f(commen)m(t)i(\014eld)e(enclosed) h(in)f(square)g(brac)m(k)m(ets\).)120 3621 y Fc (________________________)o(____)o(____)o(___)o(____)o(____)o(___)o (____)o(____)o(___)o(____)o(____)o(__)120 3734 y(int)47 b(fits_write_comment\(fitsf)o(ile)41 b(*fptr,)46 b(char)h(*comment,)93 b(int)47 b(*status\))120 3847 y(int)g(fits_write_history\(fitsf)o(ile) 41 b(*fptr,)46 b(char)h(*history,)93 b(int)47 b(*status\))120 3960 y(int)g(fits_write_date\(fitsfile)41 b(*fptr,)94 b(int)47 b(*status\))261 4139 y Ff(W)-8 b(rite)22 b(a)f Fc(COMMENT,)46 b(HISTORY)p Ff(,)18 b(or)j Fc(DATE)e Ff(k)m(eyw)m(ord)i (to)h(the)f(curren)m(t)f(header.)37 b(The)20 b Fc(COMMENT)f Ff(k)m(eyw)m(ord)120 4252 y(is)38 b(t)m(ypically)i(used)d(to)h(write)h (a)f(commen)m(t)h(ab)s(out)e(the)i(\014le)f(or)f(the)i(data.)64 b(The)37 b Fc(HISTORY)f Ff(k)m(eyw)m(ord)i(is)120 4365 y(t)m(ypically)25 b(used)c(to)j(pro)m(vide)f(information)g(ab)s(out)f (the)h(history)f(of)h(the)g(pro)s(cessing)f(pro)s(cedures)g(that)h(ha)m (v)m(e)120 4478 y(b)s(een)36 b(applied)h(to)g(the)g(data.)61 b(The)36 b Fc(comment)f Ff(or)i Fc(history)e Ff(string)i(will)g(b)s(e)f (con)m(tin)m(ued)i(o)m(v)m(er)g(m)m(ultiple)120 4591 y(k)m(eyw)m(ords)31 b(if)f(it)h(is)f(more)h(than)f(70)h(c)m(haracters)h (long.)261 4704 y(The)k Fc(DATE)f Ff(k)m(eyw)m(ord)i(is)f(used)g(to)h (record)f(the)h(date)g(and)f(time)h(that)g(the)f(FITS)g(\014le)g(w)m (as)h(created.)120 4817 y(Note)f(that)f(this)f(\014le)h(creation)h (date)f(is)g(usually)f(di\013eren)m(t)h(from)f(the)h(date)g(of)g(the)f (observ)-5 b(ation)36 b(whic)m(h)120 4930 y(obtained)e(the)g(data)h(in) e(the)i(FITS)e(\014le.)51 b(The)33 b Fc(DATE)g Ff(k)m(eyw)m(ord)h(v)-5 b(alue)35 b(is)f(a)g(c)m(haracter)i(string)d(in)h('yyyy-)120 5042 y(mm-ddThh:mm:ss')27 b(format.)40 b(If)29 b(a)g Fc(DATE)f Ff(k)m(eyw)m(ord)i(already)f(exists)h(in)f(the)g(header,)h (then)e(this)h(routine)120 5155 y(will)i(up)s(date)e(the)i(v)-5 b(alue)31 b(with)f(the)g(curren)m(t)g(system)h(date.)120 5334 y Fc(________________________)o(____)o(____)o(___)o(____)o(____)o (___)o(____)o(____)o(___)o(____)o(____)o(__)120 5447 y(int)47 b(fits_delete_record\(fitsf)o(ile)41 b(*fptr,)46 b(int)h(keynum,)94 b(int)47 b(*status\))120 5560 y(int)g (fits_delete_key\(fitsfile)41 b(*fptr,)46 b(char)h(*keyname,)93 b(int)47 b(*status\))1905 5809 y Ff(20)p eop end %%Page: 21 21 TeXDict begin 21 20 bop 261 573 a Ff(Delete)33 b(a)e(k)m(eyw)m(ord)h (record.)42 b(The)30 b(\014rst)g(routine)h(deletes)h(a)f(k)m(eyw)m(ord) h(at)f(a)h(sp)s(eci\014ed)e(p)s(osition)h(\(the)120 686 y(\014rst)c(k)m(eyw)m(ord)h(is)f(at)h(p)s(osition)g(1,)h(not)e(0\),)i (whereas)f(the)f(second)h(routine)f(deletes)i(the)f(named)f(k)m(eyw)m (ord.)120 898 y Fc(________________________)o(____)o(____)o(___)o(____) o(____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)o(___)120 1011 y(int)47 b(fits_copy_header\(fitsfil)o(e)42 b(*infptr,)j(fitsfile) h(*outfptr,)93 b(int)47 b(*status\))261 1224 y Ff(Cop)m(y)26 b(all)h(the)f(header)g(k)m(eyw)m(ords)h(from)e(the)i(curren)m(t)e(HDU)i (asso)s(ciated)h(with)d(infptr)g(to)i(the)g(curren)m(t)120 1337 y(HDU)h(asso)s(ciated)g(with)e(outfptr.)39 b(If)27 b(the)g(curren)m(t)f(output)h(HDU)g(is)g(not)g(empt)m(y)-8 b(,)29 b(then)d(a)h(new)f(HDU)i(will)120 1450 y(b)s(e)34 b(app)s(ended)f(to)j(the)f(output)f(\014le.)54 b(The)35 b(output)f(HDU)i(will)f(then)f(ha)m(v)m(e)i(the)f(iden)m(tical)i (structure)d(as)120 1562 y(the)d(input)e(HDU,)i(but)f(will)h(con)m (tain)g(no)g(data.)1905 5809 y(21)p eop end %%Page: 22 22 TeXDict begin 22 21 bop 120 573 a Fb(4.7)112 b(Utilit)m(y)37 b(Routines)120 744 y Ff(This)30 b(section)h(lists)g(the)g(most)f(imp)s (ortan)m(t)h(CFITSIO)e(general)i(utilit)m(y)h(routines.)120 957 y Fc(________________________)o(____)o(____)o(___)o(____)o(____)o (___)o(____)o(____)o(___)o(____)o(____)o(__)120 1070 y(int)47 b(fits_write_chksum\()c(fitsfile)i(*fptr,)h(int)h(*status\)) 120 1183 y(int)g(fits_verify_chksum\(fitsf)o(ile)41 b(*fptr,)46 b(int)h(*dataok,)f(int)h(*hduok,)f(int)g(*status\))261 1395 y Ff(These)35 b(routines)g(compute)g(or)g(v)-5 b(alidate)36 b(the)g(c)m(hec)m(ksums)f(for)g(the)g(currenrt)f(HDU.)i(The)e Fc(DATASUM)120 1508 y Ff(k)m(eyw)m(ord)d(is)f(used)f(to)i(store)g(the)f (n)m(umerical)h(v)-5 b(alue)30 b(of)h(the)f(32-bit,)i(1's)e(complemen)m (t)h(c)m(hec)m(ksum)g(for)f(the)120 1621 y(data)25 b(unit)f(alone.)40 b(The)24 b Fc(CHECKSUM)f Ff(k)m(eyw)m(ord)i(is)g(used)e(to)j(store)f (the)g(ASCI)s(I)e(enco)s(ded)h(COMPLEMENT)120 1734 y(of)32 b(the)f(c)m(hec)m(ksum)h(for)f(the)h(en)m(tire)g(HDU.)h(Storing)e(the)h (complemen)m(t,)h(rather)e(than)g(the)h(actual)g(c)m(hec)m(k-)120 1847 y(sum,)26 b(forces)g(the)g(c)m(hec)m(ksum)g(for)f(the)h(whole)g (HDU)g(to)g(equal)g(zero.)40 b(If)25 b(the)h(\014le)g(has)f(b)s(een)g (mo)s(di\014ed)f(since)120 1960 y(the)31 b(c)m(hec)m(ksums)f(w)m(ere)h (computed,)g(then)f(the)g(HDU)i(c)m(hec)m(ksum)f(will)f(usually)g(not)h (equal)g(zero.)261 2073 y(The)f(returned)g Fc(dataok)f Ff(and)h Fc(hduok)g Ff(parameters)h(will)g(ha)m(v)m(e)h(a)f(v)-5 b(alue)31 b(=)g(1)g(if)g(the)g(data)g(or)g(HDU)g(is)120 2186 y(v)m(eri\014ed)d(correctly)-8 b(,)31 b(a)d(v)-5 b(alue)29 b(=)f(0)g(if)g(the)h Fc(DATASUM)d Ff(or)i Fc(CHECKSUM)e Ff(k)m(eyw)m(ord)j(is)f(not)g(presen)m(t,)h(or)f(v)-5 b(alue)29 b(=)120 2299 y(-1)i(if)f(the)h(computed)f(c)m(hec)m(ksum)h (is)g(not)f(correct.)120 2511 y Fc(________________________)o(____)o (____)o(___)o(____)o(____)o(___)o(____)o(____)o(___)o(____)o(____)o(__) 120 2624 y(int)47 b(fits_parse_value\(char)42 b(*card,)k(char)h (*value,)e(char)i(*comment,)e(int)i(*status\))120 2737 y(int)g(fits_get_keytype\(char)42 b(*value,)k(char)g(*dtype,)g(int)h (*status\))120 2850 y(int)g(fits_get_keyclass\(char)42 b(*card\))120 2963 y(int)47 b(fits_parse_template\(char)41 b(*template,)k(char)i(*card,)f(int)h(*keytype,)e(int)i(*status\))261 3288 y(fits)p 459 3288 29 4 v 33 w(parse)p 732 3288 V 33 w(value)29 b Ff(parses)h(the)h(input)e(80-c)m(hararacter)k(header)d (k)m(eyw)m(ord)h(record,)g(returning)e(the)120 3401 y(v)-5 b(alue)21 b(\(as)h(a)f(literal)h(c)m(haracter)h(string\))e(and)f (commen)m(t)i(strings.)38 b(If)20 b(the)h(k)m(eyw)m(ord)h(has)e(no)h(v) -5 b(alue)21 b(\(columns)120 3514 y(9-10)38 b(not)e(equal)h(to)g('=)f ('\),)j(then)d(a)g(n)m(ull)h(v)-5 b(alue)36 b(string)h(is)f(returned)f (and)h(the)g(commen)m(t)h(string)g(is)f(set)120 3627 y(equal)31 b(to)g(column)f(9)h(-)g(80)g(of)f(the)h(input)e(string.)261 3740 y Fc(fits)p 459 3740 V 33 w(get)p 636 3740 V 34 w(keytype)41 b Ff(parses)i(the)g(k)m(eyw)m(ord)h(v)-5 b(alue)43 b(string)g(to)h(determine)f(its)h(datat)m(yp)s(e.)80 b Fc(dtype)120 3853 y Ff(returns)34 b(with)g(a)h(v)-5 b(alue)36 b(of)f('C',)g('L',)g('I',)h('F')f(or)g('X',)h(for)f(c)m (haracter)h(string,)g(logical,)j(in)m(teger,)e(\015oating)120 3966 y(p)s(oin)m(t,)31 b(or)f(complex,)h(resp)s(ectiv)m(ely)-8 b(.)261 4079 y Fc(fits)p 459 4079 V 33 w(get)p 636 4079 V 34 w(keyclass)31 b Ff(returns)i(a)h(classi\014cation)h(co)s(de)f (that)g(indicates)h(the)f(classi\014cation)h(t)m(yp)s(e)f(of)120 4192 y(the)41 b(input)e(k)m(eyw)m(ord)i(record)f(\(e.g.,)45 b(a)40 b(required)g(structural)g(k)m(eyw)m(ord,)k(a)d(TDIM)f(k)m(eyw)m (ord,)k(a)c(W)m(CS)120 4304 y(k)m(eyw)m(ord,)49 b(a)d(commen)m(t)g(k)m (eyw)m(ord,)j(etc.)85 b(See)45 b(the)h(CFITSIO)d(Reference)j(Guide)e (for)h(a)g(list)h(of)f(the)120 4417 y(di\013eren)m(t)31 b(classi\014cation)h(co)s(des.)261 4530 y Fc(fits)p 459 4530 V 33 w(parse)p 732 4530 V 33 w(template)37 b Ff(tak)m(es)j(an)e (input)g(free)g(format)h(k)m(eyw)m(ord)g(template)h(string)f(and)f (returns)120 4643 y(a)i(formatted)g(80*c)m(har)h(record)e(that)h (satis\014es)g(all)h(the)e(FITS)g(requiremen)m(ts)h(for)f(a)h(header)f (k)m(eyw)m(ord)120 4756 y(record.)65 b(The)38 b(template)i(should)d (generally)j(con)m(tain)g(3)f(tok)m(ens:)58 b(the)38 b(k)m(eyw)m(ord)h(name,)i(the)e(k)m(eyw)m(ord)120 4869 y(v)-5 b(alue,)29 b(and)e(the)g(k)m(eyw)m(ord)h(commen)m(t)h(string.)40 b(The)27 b(returned)f Fc(keytype)g Ff(parameter)i(indicates)g(whether) 120 4982 y(the)33 b(k)m(eyw)m(ord)g(is)g(a)g(COMMENT)g(k)m(eyw)m(ord)g (or)g(not.)48 b(See)33 b(the)g(CFITSIO)e(Reference)j(Guide)f(for)f (more)120 5095 y(details.)1905 5809 y(22)p eop end %%Page: 23 23 TeXDict begin 23 22 bop 120 573 a Fh(5)135 b(CFITSIO)44 b(File)h(Names)h(and)f(Filters)120 779 y Fb(5.1)112 b(Creating)38 b(New)f(Files)120 951 y Ff(When)43 b(creating)h(a)f(new)g(output)f (\014le)h(on)g(magnetic)i(disk)d(with)h Fc(fits)p 2677 951 29 4 v 33 w(create)p 2998 951 V 33 w(file)f Ff(the)h(follo)m(wing) 120 1064 y(features)31 b(are)f(supp)s(orted.)256 1251 y Fa(\017)46 b Ff(Ov)m(erwriting,)31 b(or)f('Clobb)s(ering')g(an)h (Existing)f(File)347 1402 y(If)d(the)h(\014lename)g(is)g(preceded)f(b)m (y)g(an)h(exclamation)i(p)s(oin)m(t)d(\(!\))41 b(then)27 b(if)h(that)g(\014le)f(already)i(exists)f(it)347 1514 y(will)h(b)s(e)e(deleted)i(prior)e(to)i(creating)g(the)f(new)g(FITS)f (\014le.)40 b(Otherwise)27 b(if)h(there)g(is)g(an)g(existing)h(\014le) 347 1627 y(with)36 b(the)f(same)h(name,)i(CFITSIO)c(will)i(not)g(o)m(v) m(erwrite)h(the)f(existing)g(\014le)g(and)f(will)h(return)e(an)347 1740 y(error)28 b(status)h(co)s(de.)40 b(Note)30 b(that)f(the)f (exclamation)j(p)s(oin)m(t)d(is)g(a)h(sp)s(ecial)g(UNIX)f(c)m (haracter,)j(so)e(if)f(it)347 1853 y(is)f(used)f(on)g(the)h(command)g (line)g(rather)f(than)g(en)m(tered)i(at)f(a)g(task)g(prompt,)g(it)g(m)m (ust)g(b)s(e)f(preceded)347 1966 y(b)m(y)j(a)h(bac)m(kslash)g(to)g (force)g(the)f(UNIX)h(shell)f(to)i(pass)d(it)i(v)m(erbatim)g(to)g(the)g (application)g(program.)256 2154 y Fa(\017)46 b Ff(Compressed)30 b(Output)f(Files)347 2304 y(If)g(the)g(output)f(disk)h(\014le)g(name)g (ends)f(with)g(the)h(su\016x)f('.gz',)j(then)e(CFITSIO)e(will)i (compress)g(the)347 2417 y(\014le)39 b(using)g(the)g(gzip)h (compression)f(algorithm)h(b)s(efore)e(writing)h(it)h(to)g(disk.)66 b(This)38 b(can)i(reduce)347 2530 y(the)h(amoun)m(t)g(of)g(disk)f (space)h(used)f(b)m(y)g(the)h(\014le.)71 b(Note)42 b(that)f(this)g (feature)g(requires)f(that)h(the)347 2643 y(uncompressed)e(\014le)i(b)s (e)f(constructed)h(in)f(memory)g(b)s(efore)g(it)h(is)g(compressed)f (and)g(written)h(to)347 2756 y(disk,)30 b(so)h(it)g(can)g(fail)g(if)f (there)h(is)f(insu\016cien)m(t)h(a)m(v)-5 b(ailable)32 b(memory)-8 b(.)347 2906 y(One)32 b(can)h(also)h(sp)s(ecify)e(that)h (an)m(y)g(images)h(written)f(to)g(the)g(output)f(\014le)h(should)f(b)s (e)g(compressed)347 3019 y(using)23 b(the)g(newly)g(dev)m(elop)s(ed)h (`tile-compression')h(algorithm)f(b)m(y)f(app)s(ending)f(`[compress]')i (to)g(the)347 3132 y(name)36 b(of)h(the)f(disk)g(\014le)g(\(as)h(in)f Fc(myfile.fits[compress])p Ff(\).)52 b(Refer)36 b(to)h(the)g(CFITSIO)d (User's)347 3245 y(Reference)d(Guide)g(for)f(more)g(information)h(ab)s (out)f(this)g(new)g(image)i(compression)e(format.)256 3432 y Fa(\017)46 b Ff(Using)31 b(a)g(T)-8 b(emplate)31 b(to)g(Create)g(a)g(New)g(FITS)e(File)347 3583 y(The)k(structure)g(of)g (an)m(y)h(new)f(FITS)f(\014le)i(that)g(is)f(to)h(b)s(e)f(created)h(ma)m (y)g(b)s(e)f(de\014ned)f(in)h(an)g(ASCI)s(I)347 3695 y(template)d(\014le.)40 b(If)29 b(the)f(name)h(of)g(the)f(template)i (\014le)f(is)g(app)s(ended)d(to)k(the)e(name)h(of)g(the)f(FITS)g (\014le)347 3808 y(itself,)38 b(enclosed)e(in)f(paren)m(thesis)g (\(e.g.,)j Fc('newfile.fits\(template.tx)o(t\)')p Ff(\))29 b(then)35 b(CFITSIO)347 3921 y(will)c(create)i(a)e(FITS)f(\014le)h (with)f(that)i(structure)e(b)s(efore)h(op)s(ening)f(it)h(for)g(the)g (application)h(to)f(use.)347 4034 y(The)h(template)i(\014le)f (basically)g(de\014nes)f(the)h(dimensions)e(and)h(data)h(t)m(yp)s(e)g (of)g(the)f(primary)g(arra)m(y)347 4147 y(and)23 b(an)m(y)h(IMA)m(GE)g (extensions,)i(and)d(the)g(names)g(and)g(data)h(t)m(yp)s(es)g(of)f(the) h(columns)f(in)g(an)m(y)h(ASCI)s(I)347 4260 y(or)35 b(binary)g(table)h (extensions.)55 b(The)35 b(template)h(\014le)f(can)h(also)g(b)s(e)e (used)h(to)g(de\014ne)g(an)m(y)g(optional)347 4373 y(k)m(eyw)m(ords)g (that)g(should)e(b)s(e)h(written)g(in)h(an)m(y)f(of)h(the)f(HDU)h (headers.)53 b(The)34 b(image)h(pixel)g(v)-5 b(alues)347 4486 y(and)38 b(table)i(en)m(try)e(v)-5 b(alues)39 b(are)g(all)g (initialized)i(to)e(zero.)66 b(The)38 b(application)i(program)e(can)h (then)347 4599 y(write)28 b(actual)g(data)g(in)m(to)h(the)e(HDUs.)40 b(See)28 b(the)f(CFITSIO)f(Reference)i(Guide)f(for)g(for)g(a)h (complete)347 4712 y(description)j(of)f(the)h(template)h(\014le)e(syn)m (tax.)256 4899 y Fa(\017)46 b Ff(Creating)31 b(a)g(T)-8 b(emp)s(orary)30 b(Scratc)m(h)h(File)g(in)f(Memory)347 5050 y(It)38 b(is)g(sometimes)h(useful)e(to)i(create)g(a)f(temp)s (orary)g(output)f(\014le)h(when)f(testing)i(an)f(application)347 5162 y(program.)45 b(If)31 b(the)h(name)g(of)g(the)g(\014le)g(to)h(b)s (e)e(created)i(is)f(sp)s(eci\014ed)f(as)h Fc(mem:)42 b Ff(then)32 b(CFITSIO)e(will)347 5275 y(create)39 b(the)e(\014le)h(in) f(memory)g(where)f(it)i(will)g(p)s(ersist)e(only)h(un)m(til)h(the)f (program)g(closes)i(the)e(\014le.)347 5388 y(Use)e(of)g(this)g Fc(mem:)48 b Ff(output)34 b(\014le)h(usually)f(enables)h(the)g(program) f(to)i(run)d(faster,)j(and)e(of)h(course)347 5501 y(the)c(output)f (\014le)g(do)s(es)g(not)h(use)f(up)f(an)m(y)i(disk)f(space.)1905 5809 y(23)p eop end %%Page: 24 24 TeXDict begin 24 23 bop 120 573 a Fb(5.2)112 b(Op)s(ening)39 b(Existing)e(Files)120 744 y Ff(When)h(op)s(ening)f(a)i(\014le)f(with)g Fc(fits)p 1392 744 29 4 v 33 w(open)p 1617 744 V 33 w(file)p Ff(,)h(CFITSIO)e(can)h(read)g(a)g(v)-5 b(ariet)m(y)40 b(of)e(di\013eren)m(t)g(input)120 857 y(\014le)31 b(formats)g(and)g(is) g(not)g(restricted)h(to)g(only)f(reading)g(FITS)g(format)g(\014les)g (from)g(magnetic)h(disk.)43 b(The)120 970 y(follo)m(wing)32 b(t)m(yp)s(es)e(of)h(input)e(\014les)i(are)f(all)i(supp)s(orted:)256 1183 y Fa(\017)46 b Ff(FITS)30 b(\014les)g(compressed)g(with)g Fc(zip,)47 b(gzip)29 b Ff(or)i Fc(compress)347 1333 y Ff(If)36 b(CFITSIO)f(cannot)i(\014nd)e(the)i(sp)s(eci\014ed)f(\014le)g (to)h(op)s(en)f(it)h(will)g(automatically)i(lo)s(ok)e(for)f(a)h(\014le) 347 1446 y(with)k(the)f(same)h(ro)s(otname)h(but)d(with)i(a)g Fc(.gz,)46 b(.zip)p Ff(,)d(or)d Fc(.Z)g Ff(extension.)72 b(If)41 b(it)g(\014nds)e(suc)m(h)h(a)347 1559 y(compressed)d(\014le,)h (it)g(will)f(allo)s(cate)i(a)e(blo)s(c)m(k)g(of)g(memory)g(and)f (uncompress)f(the)i(\014le)g(in)m(to)h(that)347 1672 y(memory)25 b(space.)39 b(The)25 b(application)h(program)e(will)i(then) e(transparen)m(tly)h(op)s(en)f(this)h(virtual)g(FITS)347 1785 y(\014le)36 b(in)f(memory)-8 b(.)56 b(Compressed)35 b(\014les)g(can)h(only)g(b)s(e)e(op)s(ened)h(with)g('readonly',)j(not)e ('readwrite')347 1898 y(\014le)31 b(access.)256 2085 y Fa(\017)46 b Ff(FITS)30 b(\014les)g(on)g(the)h(in)m(ternet,)g(using)f Fc(ftp)g Ff(or)g Fc(http)f Ff(URLs)347 2236 y(Simply)22 b(pro)m(vide)h(the)h(full)e(URL)h(as)g(the)g(name)g(of)h(the)f(\014le)g (that)g(y)m(ou)h(w)m(an)m(t)f(to)h(op)s(en.)38 b(F)-8 b(or)23 b(example,)347 2348 y Fc(ftp://legacy.gsfc.nasa.go)o(v/so)o (ftwa)o(re/)o(fits)o(io/c)o(/te)o(stpr)o(og.s)o(td)347 2461 y Ff(will)37 b(op)s(en)e(the)h(CFITSIO)e(test)j(FITS)e(\014le)h (that)h(is)e(lo)s(cated)j(on)d(the)h Fc(legacy)f Ff(mac)m(hine.)58 b(These)347 2574 y(\014les)31 b(can)f(only)h(b)s(e)e(op)s(ened)h(with)g ('readonly')h(\014le)g(access.)256 2762 y Fa(\017)46 b Ff(FITS)30 b(\014les)g(on)g Fc(stdin)f Ff(or)i Fc(stdout)d Ff(\014le)j(streams)347 2912 y(If)j(the)g(name)h(of)f(the)h(\014le)f (to)h(b)s(e)f(op)s(ened)f(is)h Fc('stdin')f Ff(or)h Fc('-')f Ff(\(a)i(single)g(dash)e(c)m(haracter\))k(then)347 3025 y(CFITSIO)f(will)i(read)g(the)f(\014le)h(from)f(the)h(standard)f(input) f(stream.)63 b(Similarly)-8 b(,)40 b(if)e(the)g(output)347 3138 y(\014le)43 b(name)g(is)g Fc('stdout')e Ff(or)i Fc('-')p Ff(,)j(then)c(the)i(\014le)f(will)g(b)s(e)g(written)g(to)g (the)h(standard)e(output)347 3251 y(stream.)54 b(In)34 b(addition,)i(if)e(the)h(output)f(\014lename)h(is)g Fc('stdout.gz')c Ff(or)k Fc('-.gz')e Ff(then)h(it)h(will)g(b)s(e)347 3364 y(gzip)f(compressed)f(b)s(efore)g(b)s(eing)f(written)h(to)h(stdout.)49 b(This)33 b(mec)m(hanism)g(can)h(b)s(e)e(used)g(to)i(pip)s(e)347 3477 y(FITS)c(\014les)g(from)g(one)h(task)g(to)g(another)f(without)h (ha)m(ving)g(to)g(write)f(an)h(in)m(termediary)g(FITS)e(\014le)347 3590 y(on)i(magnetic)g(disk.)256 3777 y Fa(\017)46 b Ff(FITS)30 b(\014les)g(that)h(exist)g(only)g(in)f(memory)-8 b(,)31 b(or)f(shared)g(memory)-8 b(.)347 3928 y(In)38 b(some)i(applications,)i(suc)m(h)d(as)g(real)g(time)h(data)f (acquisition,)k(y)m(ou)c(ma)m(y)h(w)m(an)m(t)f(to)h(ha)m(v)m(e)g(one) 347 4040 y(pro)s(cess)31 b(write)g(a)h(FITS)e(\014le)h(in)m(to)h(a)g (certain)g(section)g(of)f(computer)g(memory)-8 b(,)32 b(and)f(then)f(b)s(e)h(able)347 4153 y(to)26 b(op)s(en)f(that)g(\014le) g(in)g(memory)g(with)g(another)g(pro)s(cess.)39 b(There)25 b(is)g(a)g(sp)s(ecialized)h(CFITSIO)e(op)s(en)347 4266 y(routine)f(called)i Fc(fits)p 1102 4266 V 33 w(open)p 1327 4266 V 33 w(memfile)d Ff(that)h(can)h(b)s(e)e(used)h(for)g(this)g (purp)s(ose.)37 b(See)23 b(the)g(\\CFITSIO)347 4379 y(User's)31 b(Reference)g(Guide")g(for)f(more)g(details.)256 4567 y Fa(\017)46 b Ff(IRAF)31 b(format)g(images)g(\(with)f Fc(.imh)g Ff(\014le)g(extensions\))347 4717 y(CFITSIO)38 b(supp)s(orts)g(reading)i(IRAF)g(format)g(images)h(b)m(y)f(con)m(v)m (erting)h(them)f(on)f(the)h(\015y)f(in)m(to)347 4830 y(FITS)27 b(images)i(in)e(memory)-8 b(.)40 b(The)28 b(application)g (program)g(then)f(reads)h(this)f(virtual)h(FITS)f(format)347 4943 y(image)36 b(in)f(memory)-8 b(.)55 b(There)34 b(is)h(curren)m(tly) g(no)g(supp)s(ort)e(for)i(writing)g(IRAF)g(format)g(images,)i(or)347 5056 y(for)30 b(reading)h(or)f(writing)h(IRAF)f(tables.)256 5243 y Fa(\017)46 b Ff(Image)31 b(arra)m(ys)g(in)f(ra)m(w)h(binary)e (format)347 5394 y(If)23 b(the)h(input)e(\014le)i(is)f(a)h(ra)m(w)f (binary)g(data)h(arra)m(y)-8 b(,)26 b(then)d(CFITSIO)f(will)h(con)m(v)m (ert)i(it)f(on)f(the)h(\015y)f(in)m(to)h(a)347 5507 y(virtual)g(FITS)e (image)j(with)e(the)h(basic)f(set)h(of)g(required)e(header)h(k)m(eyw)m (ords)h(b)s(efore)f(it)h(is)f(op)s(ened)f(b)m(y)1905 5809 y(24)p eop end %%Page: 25 25 TeXDict begin 25 24 bop 347 573 a Ff(the)31 b(application)g(program.)40 b(In)30 b(this)g(case)h(the)f(data)h(t)m(yp)s(e)g(and)e(dimensions)g (of)i(the)f(image)h(m)m(ust)347 686 y(b)s(e)c(sp)s(eci\014ed)f(in)h (square)g(brac)m(k)m(ets)h(follo)m(wing)h(the)e(\014lename)h(\(e.g.)41 b Fc(rawfile.dat[ib512,512])p Ff(\).)347 799 y(The)30 b(\014rst)g(c)m(haracter)i(inside)e(the)g(brac)m(k)m(ets)i(de\014nes)e (the)g(datat)m(yp)s(e)i(of)e(the)h(arra)m(y:)586 1049 y Fc(b)429 b(8-bit)47 b(unsigned)e(byte)586 1161 y(i)381 b(16-bit)47 b(signed)f(integer)586 1274 y(u)381 b(16-bit)47 b(unsigned)e(integer)586 1387 y(j)381 b(32-bit)47 b(signed)f(integer) 586 1500 y(r)h(or)h(f)142 b(32-bit)47 b(floating)e(point)586 1613 y(d)381 b(64-bit)47 b(floating)e(point)347 1863 y Ff(An)32 b(optional)g(second)g(c)m(haracter)h(sp)s(eci\014es)e(the)h (b)m(yte)h(order)e(of)g(the)h(arra)m(y)g(v)-5 b(alues:)44 b(b)31 b(or)h(B)g(indi-)347 1976 y(cates)27 b(big)e(endian)f(\(as)i(in) f(FITS)f(\014les)h(and)f(the)i(nativ)m(e)g(format)f(of)h(SUN)e(UNIX)i (w)m(orkstations)g(and)347 2089 y(Mac)35 b(PCs\))d(and)h(l)g(or)g(L)g (indicates)h(little)h(endian)e(\(nativ)m(e)i(format)e(of)g(DEC)h(OSF)e (w)m(orkstations)347 2202 y(and)41 b(IBM)g(PCs\).)73 b(If)41 b(this)g(c)m(haracter)h(is)g(omitted)g(then)e(the)i(arra)m(y)f (is)h(assumed)e(to)i(ha)m(v)m(e)g(the)347 2315 y(nativ)m(e)30 b(b)m(yte)f(order)e(of)h(the)h(lo)s(cal)g(mac)m(hine.)41 b(These)28 b(datat)m(yp)s(e)h(c)m(haracters)g(are)g(then)f(follo)m(w)m (ed)h(b)m(y)347 2428 y(a)d(series)g(of)f(one)h(or)f(more)h(in)m(teger)g (v)-5 b(alues)26 b(separated)g(b)m(y)f(commas)h(whic)m(h)f(de\014ne)g (the)g(size)i(of)e(eac)m(h)347 2540 y(dimension)30 b(of)h(the)f(ra)m(w) h(arra)m(y)-8 b(.)41 b(Arra)m(ys)31 b(with)f(up)f(to)i(5)g(dimensions)f (are)g(curren)m(tly)h(supp)s(orted.)347 2691 y(Finally)-8 b(,)35 b(a)e(b)m(yte)g(o\013set)g(to)g(the)g(p)s(osition)f(of)g(the)h (\014rst)f(pixel)g(in)g(the)h(data)g(\014le)f(ma)m(y)h(b)s(e)f(sp)s (eci\014ed)347 2804 y(b)m(y)c(separating)h(it)g(with)e(a)i(':')40 b(from)27 b(the)i(last)f(dimension)g(v)-5 b(alue.)40 b(If)28 b(omitted,)i(it)e(is)g(assumed)g(that)347 2917 y(the)h(o\013set)g(=)f(0.)41 b(This)27 b(parameter)i(ma)m(y)g(b)s(e)f (used)f(to)i(skip)f(o)m(v)m(er)i(an)m(y)e(header)g(information)h(in)f (the)347 3029 y(\014le)j(that)g(precedes)f(the)h(binary)e(data.)42 b(F)-8 b(urther)30 b(examples:)443 3279 y Fc(raw.dat[b10000])473 b(1-dimensional)44 b(10000)i(pixel)h(byte)f(array)443 3392 y(raw.dat[rb400,400,12])185 b(3-dimensional)44 b(floating)i(point) g(big-endian)f(array)443 3505 y(img.fits[ib512,512:2880)o(])d(reads)k (the)h(512)g(x)h(512)e(short)h(integer)f(array)g(in)h(a)1636 3618 y(FITS)g(file,)f(skipping)f(over)i(the)g(2880)g(byte)f(header)1905 5809 y Ff(25)p eop end %%Page: 26 26 TeXDict begin 26 25 bop 120 573 a Fb(5.3)112 b(Image)38 b(Filtering)120 744 y Fg(5.3.1)105 b(Extracting)35 b(a)g(subsection)h (of)f(an)g(image)120 916 y Ff(When)21 b(sp)s(ecifying)g(the)h(name)f (of)g(an)g(image)i(to)f(b)s(e)f(op)s(ened,)h(y)m(ou)g(can)f(select)i(a) f(rectangular)g(subsection)f(of)120 1029 y(the)29 b(image)g(to)g(b)s(e) f(extracted)i(and)e(op)s(ened)f(b)m(y)i(the)f(application)i(program.)40 b(The)28 b(application)i(program)120 1142 y(then)h(op)s(ens)f(a)i (virtual)g(image)g(that)g(only)f(con)m(tains)i(the)e(pixels)h(within)e (the)i(sp)s(eci\014ed)e(subsection.)44 b(T)-8 b(o)120 1255 y(do)33 b(this,)h(sp)s(ecify)f(the)h(the)f(range)h(of)f(pixels)g (\(start:end\))i(along)f(eac)m(h)g(axis)g(to)g(b)s(e)f(extracted)h (from)f(the)120 1368 y(original)e(image)h(enclosed)f(in)f(square)g (brac)m(k)m(ets.)42 b(Y)-8 b(ou)31 b(can)f(also)i(sp)s(ecify)e(an)g (optional)h(pixel)g(incremen)m(t)120 1481 y(\(start:end:step\))37 b(for)f(eac)m(h)g(axis)h(of)e(the)h(input)f(image.)58 b(A)36 b(pixel)g(step)g(=)f(1)h(will)g(b)s(e)f(assumed)g(if)h(it)g(is) 120 1594 y(not)29 b(sp)s(eci\014ed.)39 b(If)28 b(the)h(starting)g (pixel)g(is)f(larger)i(then)e(the)h(end)e(pixel,)j(then)e(the)h(image)h (will)e(b)s(e)g(\015ipp)s(ed)120 1706 y(\(pro)s(ducing)34 b(a)h(mirror)e(image\))j(along)g(that)f(dimension.)53 b(An)34 b(asterisk,)j('*',)g(ma)m(y)e(b)s(e)f(used)f(to)j(sp)s(ecify) 120 1819 y(the)25 b(en)m(tire)h(range)f(of)g(an)g(axis,)i(and)d('-*')i (will)g(\015ip)e(the)h(en)m(tire)h(axis.)39 b(In)24 b(the)h(follo)m (wing)i(examples,)g(assume)120 1932 y(that)k Fc(myfile.fits)c Ff(con)m(tains)32 b(a)f(512)g(x)g(512)g(pixel)g(2D)g(image.)215 2130 y Fc(myfile.fits[201:210,)43 b(251:260])i(-)j(opens)e(a)i(10)f(x)g (10)g(pixel)g(subimage.)215 2356 y(myfile.fits[*,)d(512:257])i(-)h (opens)g(a)g(512)g(x)h(256)e(image)h(consisting)e(of)406 2469 y(all)i(the)g(columns)f(in)h(the)g(input)f(image,)h(but)f(only)h (rows)g(257)406 2582 y(through)f(512.)95 b(The)46 b(image)h(will)f(be)i (flipped)d(along)i(the)g(Y)g(axis)406 2695 y(since)g(the)g(starting)e (row)i(is)g(greater)f(than)h(the)g(ending)406 2808 y(row.)215 3033 y(myfile.fits[*:2,)d(512:257:2])h(-)i(creates)f(a)i(256)e(x)i(128) f(pixel)f(image.)406 3146 y(Similar)g(to)h(the)g(previous)f(example,)f (but)i(only)g(every)f(other)h(row)406 3259 y(and)g(column)f(is)i(read)e (from)h(the)g(input)f(image.)215 3485 y(myfile.fits[-*,)e(*])j(-)h (creates)e(an)h(image)f(containing)f(all)i(the)g(rows)g(and)406 3598 y(columns)f(in)h(the)g(input)g(image,)f(but)h(flips)f(it)h(along)g (the)f(X)406 3711 y(axis.)261 3909 y Ff(If)33 b(the)g(arra)m(y)h(to)g (b)s(e)f(op)s(ened)f(is)i(in)f(an)g(Image)h(extension,)h(and)e(not)g (in)g(the)h(primary)e(arra)m(y)i(of)f(the)120 4022 y(\014le,)d(then)f (y)m(ou)g(need)g(to)h(sp)s(ecify)e(the)i(extension)g(name)f(or)g(n)m (um)m(b)s(er)f(in)g(square)h(brac)m(k)m(ets)i(b)s(efore)e(giving)120 4135 y(the)h(subsection)f(range,)h(as)g(in)f Fc(myfile.fits[1][-*,)42 b(*])29 b Ff(to)h(read)f(the)h(image)h(in)e(the)g(\014rst)g(extension) 120 4248 y(in)h(the)h(\014le.)120 4485 y Fg(5.3.2)105 b(Create)34 b(an)h(Image)g(b)m(y)g(Binning)h(T)-9 b(able)34 b(Columns)120 4657 y Ff(Y)-8 b(ou)40 b(can)f(also)h(create)h(and)d(op)s (en)h(a)g(virtual)h(image)g(b)m(y)f(binning)f(the)i(v)-5 b(alues)39 b(in)g(a)g(pair)g(of)h(columns)120 4770 y(of)f(a)h(FITS)f (table)h(\(in)f(other)h(w)m(ords,)h(create)g(a)e(2-D)i(histogram)f(of)f (the)g(v)-5 b(alues)40 b(in)f(the)g(2)h(columns\).)120 4883 y(This)34 b(tec)m(hnique)h(is)g(often)g(used)f(in)h(X-ra)m(y)h (astronom)m(y)f(where)f(eac)m(h)i(detected)g(X-ra)m(y)g(photon)f (during)120 4996 y(an)29 b(observ)-5 b(ation)29 b(is)g(recorded)g(in)f (a)h(FITS)f(table.)41 b(There)29 b(are)g(t)m(ypically)h(2)g(columns)e (in)g(the)h(table)h(called)120 5109 y Fc(X)35 b Ff(and)h Fc(Y)f Ff(whic)m(h)h(record)f(the)i(pixel)f(lo)s(cation)h(of)f(that)h (ev)m(en)m(t)g(in)e(a)i(virtual)f(2D)g(image.)59 b(T)-8 b(o)36 b(create)h(an)120 5222 y(image)28 b(from)e(this)h(table,)i(one)e (just)f(scans)h(the)g(X)g(and)f(Y)h(columns)g(and)f(coun)m(ts)h(up)f (ho)m(w)h(man)m(y)g(photons)120 5334 y(w)m(ere)k(recorded)g(in)g(eac)m (h)h(pixel)f(of)g(the)g(image.)44 b(When)30 b(table)i(binning)e(is)h (sp)s(eci\014ed,)g(CFITSIO)e(creates)120 5447 y(a)38 b(temp)s(orary)e(FITS)h(primary)f(arra)m(y)i(in)f(memory)g(b)m(y)g (computing)h(the)f(histogram)h(of)g(the)f(v)-5 b(alues)38 b(in)120 5560 y(the)29 b(sp)s(eci\014ed)f(columns.)40 b(After)29 b(the)g(histogram)g(is)g(computed)g(the)g(original)h(FITS)e (\014le)h(con)m(taining)h(the)1905 5809 y(26)p eop end %%Page: 27 27 TeXDict begin 27 26 bop 120 573 a Ff(table)25 b(is)e(closed)i(and)e (the)g(temp)s(orary)h(FITS)e(primary)h(arra)m(y)h(is)g(op)s(ened)f(and) g(passed)g(to)h(the)g(application)120 686 y(program.)39 b(Th)m(us,)27 b(the)g(application)h(program)f(nev)m(er)g(sees)h(the)f (original)h(FITS)e(table)i(and)e(only)h(sees)g(the)120 799 y(image)32 b(in)e(the)g(new)g(temp)s(orary)g(\014le)h(\(whic)m(h)f (has)g(no)g(extensions\).)261 912 y(The)f(table)h(binning)e(sp)s (eci\014er)h(is)h(enclosed)g(in)f(square)g(brac)m(k)m(ets)h(follo)m (wing)h(the)f(ro)s(ot)f(\014lename)h(and)120 1024 y(table)h(extension)g (name)g(or)f(n)m(um)m(b)s(er)f(and)h(b)s(egins)g(with)g(the)g(k)m(eyw)m (ord)h('bin',)g(as)f(in:)120 1137 y Fc('myfile.fits[events][bin)41 b(\(X,Y\)]')p Ff(.)20 b(In)h(this)h(case,)j(the)d(X)g(and)f(Y)h (columns)g(in)g(the)g('ev)m(en)m(ts')h(table)120 1250 y(extension)30 b(are)g(binned)f(up)f(to)j(create)g(the)f(image.)42 b(The)29 b(size)h(of)g(the)g(image)h(is)f(usually)f(determined)g(b)m(y) 120 1363 y(the)22 b Fc(TLMINn)d Ff(and)i Fc(TLMAXn)f Ff(header)h(k)m(eyw)m(ords)h(whic)m(h)f(giv)m(e)i(the)e(minim)m(um)g (and)g(maxim)m(um)g(allo)m(w)m(ed)i(pixel)120 1476 y(v)-5 b(alues)38 b(in)f(the)h(columns.)62 b(F)-8 b(or)38 b(instance)g(if)g Fc(TLMINn)46 b(=)h(1)37 b Ff(and)g Fc(TLMAXn)46 b(=)i(4096)36 b Ff(for)i(b)s(oth)e(columns,)120 1589 y(this)f(w)m(ould)g(generate)h (a)f(4096)i(x)e(4096)h(pixel)g(image)g(b)m(y)f(default.)54 b(This)34 b(is)h(rather)g(large,)j(so)d(y)m(ou)g(can)120 1702 y(also)e(sp)s(ecify)f(a)h(pixel)f(binning)f(factor)j(to)f(reduce)f (the)g(image)i(size.)47 b(F)-8 b(or)33 b(example)g(sp)s(ecifying)f(,)h Fc('[bin)120 1815 y(\(X,Y\))46 b(=)i(16]')29 b Ff(will)h(use)f(a)i (binning)d(factor)j(of)f(16,)h(whic)m(h)f(will)g(pro)s(duce)f(a)h(256)h (x)f(256)h(pixel)g(image)g(in)120 1928 y(the)g(previous)e(example.)261 2041 y(If)35 b(the)g(TLMIN)g(and)g(TLMAX)g(k)m(eyw)m(ords)g(don't)g (exist,)j(or)d(y)m(ou)g(w)m(an)m(t)h(to)g(o)m(v)m(erride)h(their)e(v)-5 b(alues,)120 2154 y(y)m(ou)36 b(can)h(sp)s(ecify)e(the)h(image)i(range) e(and)f(binning)g(factor)i(directly)-8 b(,)39 b(as)d(in)g Fc('[bin)46 b(X)i(=)f(1:4096:16,)120 2267 y(Y=1:4096:16]')p Ff(.)36 b(Y)-8 b(ou)28 b(can)g(also)g(sp)s(ecify)f(the)h(datat)m(yp)s (e)g(of)g(the)g(created)g(image)h(b)m(y)e(app)s(ending)f(a)i(b,)g(i,) 120 2379 y(j,)f(r,)g(or)f(d)f(\(for)h(8-bit)h(b)m(yte,)h(16-bit)g(in)m (tegers,)g(32-bit)f(in)m(teger,)i(32-bit)e(\015oating)g(p)s(oin)m(ts,)g (or)f(64-bit)i(double)120 2492 y(precision)36 b(\015oating)g(p)s(oin)m (t,)h(resp)s(ectiv)m(ely\))g(to)f(the)g('bin')f(k)m(eyw)m(ord)g(\(e.g.) 58 b Fc('[binr)46 b(\(X,Y\)]')33 b Ff(creates)k(a)120 2605 y(\015oating)j(p)s(oin)m(t)e(image\).)67 b(If)38 b(the)h(datat)m(yp)s(e)h(is)e(not)h(sp)s(eci\014ed)f(then)g(a)h(32-bit) h(in)m(teger)g(image)g(will)f(b)s(e)120 2718 y(created)31 b(b)m(y)g(default.)261 2831 y(If)39 b(the)h(column)f(name)g(is)h(not)f (sp)s(eci\014ed,)i(then)e(CFITSIO)f(will)i(\014rst)e(try)i(to)g(use)f (the)g('preferred)120 2944 y(column')c(as)g(sp)s(eci\014ed)f(b)m(y)h (the)g(CPREF)g(k)m(eyw)m(ord)g(if)g(it)h(exists)f(\(e.g.,)j('CPREF)d(=) g('DETX,DETY'\),)120 3057 y(otherwise)c(column)f(names)g('X',)i('Y')e (will)h(b)s(e)f(assumed)g(for)g(the)g(2)h(axes.)261 3170 y(Note)37 b(that)f(this)f(binning)f(sp)s(eci\014er)h(is)g(not)g (restricted)h(to)g(only)g(2D)g(images)g(and)f(can)g(b)s(e)g(used)g(to) 120 3283 y(create)f(1D,)f(3D,)g(or)g(4D)g(images)g(as)f(w)m(ell.)48 b(It)32 b(is)g(also)h(p)s(ossible)f(to)h(sp)s(ecify)f(a)g(w)m(eigh)m (ting)i(factor)g(that)e(is)120 3396 y(applied)d(during)g(the)g (binning.)40 b(Please)30 b(refer)g(to)g(the)g(\\CFITSIO)e(User's)i (Reference)g(Guide")g(for)f(more)120 3509 y(details)i(on)g(these)f(adv) -5 b(anced)31 b(features.)1905 5809 y(27)p eop end %%Page: 28 28 TeXDict begin 28 27 bop 120 573 a Fb(5.4)112 b(T)-9 b(able)38 b(Filtering)120 744 y Fg(5.4.1)105 b(Column)35 b(and)g(Keyw)m(ord)g (Filtering)120 916 y Ff(The)29 b(column)g(or)g(k)m(eyw)m(ord)h (\014ltering)g(sp)s(eci\014er)f(is)g(used)g(to)h(mo)s(dify)e(the)i (column)f(structure)g(and/or)g(the)120 1029 y(header)h(k)m(eyw)m(ords)h (in)f(the)h(HDU)g(that)g(w)m(as)g(selected)h(with)e(the)h(previous)f (HDU)h(lo)s(cation)h(sp)s(eci\014er.)40 b(It)120 1142 y(can)31 b(b)s(e)e(used)h(to)h(p)s(erform)e(the)i(follo)m(wing)g(t)m (yp)s(es)g(of)f(op)s(erations.)256 1354 y Fa(\017)46 b Ff(App)s(end)35 b(a)h(new)g(column)g(to)h(a)f(table)h(b)m(y)g(giving) g(the)f(column)g(name,)i(optionally)g(follo)m(w)m(ed)f(b)m(y)347 1467 y(the)c(datat)m(yp)s(e)h(in)e(paren)m(theses,)i(follo)m(w)m(ed)g (b)m(y)f(an)g(equals)g(sign)g(and)f(the)h(arithmetic)h(expression)347 1580 y(to)c(b)s(e)e(used)g(to)i(compute)f(the)g(v)-5 b(alue.)41 b(The)28 b(datat)m(yp)s(e)i(is)f(sp)s(eci\014ed)f(using)h (the)g(same)g(syn)m(tax)h(that)347 1693 y(is)k(allo)m(w)m(ed)h(for)e (the)g(v)-5 b(alue)34 b(of)g(the)f(FITS)g(TF)m(ORMn)g(k)m(eyw)m(ord)h (\(e.g.,)i('I',)e('J',)g('E',)f('D',)i(etc.)51 b(for)347 1806 y(binary)32 b(tables,)h(and)f('I8',)h(F12.3',)i('E20.12',)g(etc.) 47 b(for)32 b(ASCI)s(I)f(tables\).)47 b(If)32 b(the)g(datat)m(yp)s(e)h (is)f(not)347 1919 y(sp)s(eci\014ed)e(then)g(a)h(default)f(datat)m(yp)s (e)i(will)e(b)s(e)g(c)m(hosen)h(dep)s(ending)e(on)h(the)h(expression.) 256 2107 y Fa(\017)46 b Ff(Create)33 b(a)g(new)f(header)g(k)m(eyw)m (ord)h(b)m(y)f(giving)h(the)g(k)m(eyw)m(ord)g(name,)g(preceded)f(b)m(y) g(a)h(p)s(ound)d(sign)347 2220 y('#',)24 b(follo)m(w)m(ed)e(b)m(y)f(an) g(equals)g(sign)g(and)f(an)h(arithmetic)h(expression)f(for)g(the)g(v)-5 b(alue)21 b(of)g(the)h(k)m(eyw)m(ord.)347 2332 y(The)k(expression)g(ma) m(y)h(b)s(e)f(a)h(function)f(of)h(other)f(header)g(k)m(eyw)m(ord)h(v)-5 b(alues.)40 b(The)26 b(commen)m(t)h(string)347 2445 y(for)40 b(the)h(k)m(eyw)m(ord)g(ma)m(y)g(b)s(e)f(sp)s(eci\014ed)g(in)g(paren)m (theses)h(immediately)g(follo)m(wing)h(the)f(k)m(eyw)m(ord)347 2558 y(name.)256 2746 y Fa(\017)46 b Ff(Ov)m(erwrite)30 b(the)f(v)-5 b(alues)30 b(in)e(an)h(existing)i(column)d(or)i(k)m(eyw)m (ord)f(b)m(y)g(giving)h(the)g(name)f(follo)m(w)m(ed)h(b)m(y)347 2859 y(an)h(equals)f(sign)h(and)e(an)i(arithmetic)g(expression.)256 3046 y Fa(\017)46 b Ff(Select)36 b(a)e(set)g(of)h(columns)e(to)i(b)s(e) e(included)h(in)f(the)i(\014ltered)f(\014le)g(b)m(y)g(listing)g(the)h (column)e(names)347 3159 y(separated)c(with)f(semi-colons.)41 b(Wild)29 b(card)f(c)m(haracters)i(ma)m(y)e(b)s(e)g(used)f(in)h(the)h (column)f(names)g(to)347 3272 y(matc)m(h)33 b(m)m(ultiple)g(columns.)46 b(An)m(y)32 b(other)h(columns)e(in)h(the)h(input)e(table)i(will)f(not)h (app)s(ear)e(in)h(the)347 3385 y(\014ltered)f(\014le.)256 3573 y Fa(\017)46 b Ff(Delete)32 b(a)e(column)g(or)f(k)m(eyw)m(ord)h(b) m(y)g(listing)g(the)g(name)g(preceded)f(b)m(y)h(a)g(min)m(us)f(sign)g (or)h(an)g(excla-)347 3686 y(mation)h(mark)f(\(!\))256 3873 y Fa(\017)46 b Ff(Rename)31 b(an)f(existing)i(column)e(or)g(k)m (eyw)m(ord)h(with)f(the)h(syn)m(tax)g('NewName)g(==)f(OldName'.)261 4086 y(The)20 b(column)g(\014ltering)h(sp)s(eci\014er)e(is)i(enclosed)g (in)f(square)g(brac)m(k)m(ets)h(and)f(b)s(egins)g(with)g(the)g(string)h ('col'.)120 4199 y(Multiple)32 b(op)s(erations)f(can)g(b)s(e)f(p)s (erformed)f(b)m(y)i(separating)g(them)g(with)f(semi-colons.)43 b(F)-8 b(or)32 b(complex)f(or)120 4312 y(commonly)g(used)g(op)s (erations,)g(y)m(ou)h(can)f(write)g(the)g(column)g(\014lter)g(to)h(a)f (text)h(\014le,)f(and)g(then)f(use)h(it)g(b)m(y)120 4425 y(giving)g(the)g(name)f(of)h(the)f(text)i(\014le,)e(preceded)g(b)m(y)h (a)f('@')h(c)m(haracter.)261 4538 y(Some)g(examples:)215 4750 y Fc([col)47 b(PI=PHA)f(*)i(1.1)f(+)g(0.2])285 b(-)48 b(creates)e(new)g(PI)i(column)e(from)g(PHA)h(values)215 4976 y([col)g(rate)g(=)g(counts/exposure])91 b(-)48 b(creates)e(or)h (overwrites)e(the)i(rate)f(column)g(by)1743 5089 y(dividing)f(the)i (counts)f(column)g(by)i(the)1743 5202 y(EXPOSURE)d(keyword)h(value.)215 5428 y([col)h(TIME;)f(X;)i(Y])667 b(-)48 b(only)e(the)h(listed)f (columns)g(will)h(appear)1743 5540 y(in)g(the)g(filtered)e(file)1905 5809 y Ff(28)p eop end %%Page: 29 29 TeXDict begin 29 28 bop 215 686 a Fc([col)47 b(Time;*raw])713 b(-)48 b(include)e(the)g(Time)h(column)f(and)h(any)g(other)1743 799 y(columns)f(whose)g(name)h(ends)f(with)h('raw'.)215 1024 y([col)g(-TIME;)f(Good)h(==)g(STATUS])141 b(-)48 b(deletes)e(the)g(TIME)h(column)f(and)1743 1137 y(renames)g(the)g (STATUS)h(column)f(to)h(GOOD)215 1363 y([col)g(@colfilt.txt])569 b(-)48 b(uses)e(the)h(filtering)f(expression)f(in)1743 1476 y(the)i(colfilt.txt)d(text)j(file)261 1689 y Ff(The)30 b(original)i(\014le)f(is)g(not)g(c)m(hanged)g(b)m(y)g(this)g (\014ltering)g(op)s(eration,)g(and)f(instead)h(the)g(mo)s (di\014cations)120 1802 y(are)36 b(made)f(on)h(a)f(temp)s(orary)h(cop)m (y)g(of)f(the)h(input)e(FITS)h(\014le)h(\(usually)f(in)g(memory\),)j (whic)m(h)d(includes)120 1914 y(a)42 b(cop)m(y)g(of)g(all)g(the)g (other)g(HDUs)g(in)f(the)h(input)f(\014le.)74 b(The)41 b(original)i(input)e(\014le)g(is)h(closed)g(and)f(the)120 2027 y(application)32 b(program)e(op)s(ens)f(the)i(\014ltered)f(cop)m (y)h(of)g(the)g(\014le.)120 2268 y Fg(5.4.2)105 b(Ro)m(w)36 b(Filtering)120 2439 y Ff(The)22 b(ro)m(w)h(\014lter)g(is)g(used)f(to)h (select)h(a)g(subset)e(of)h(the)g(ro)m(ws)f(from)h(a)g(table)g(based)g (on)f(a)i(b)s(o)s(olean)e(expression.)120 2552 y(A)37 b(temp)s(orary)g(new)f(FITS)g(\014le)i(is)f(created)h(on)f(the)g(\015y) f(\(usually)h(in)g(memory\))g(whic)m(h)g(con)m(tains)h(only)120 2665 y(those)30 b(ro)m(ws)g(for)g(whic)m(h)g(the)g(ro)m(w)g(\014lter)g (expression)f(ev)-5 b(aluates)32 b(to)e(true)g(\(i.e.,)i(not)e(equal)g (to)h(zero\).)42 b(The)120 2778 y(primary)25 b(arra)m(y)i(and)e(an)m(y) h(other)h(extensions)f(in)g(the)g(input)f(\014le)h(are)h(also)g(copied) f(to)h(the)f(temp)s(orary)g(\014le.)120 2891 y(The)h(original)i(FITS)e (\014le)h(is)g(closed)g(and)g(the)g(new)f(temp)s(orary)g(\014le)h(is)g (then)f(op)s(ened)g(b)m(y)h(the)g(application)120 3004 y(program.)261 3117 y(The)f(ro)m(w)g(\014lter)g(expression)g(is)g (enclosed)g(in)g(square)g(brac)m(k)m(ets)h(follo)m(wing)h(the)e(\014le) g(name)g(and)f(exten-)120 3230 y(sion)32 b(name.)48 b(F)-8 b(or)33 b(example,)h Fc('file.fits[events][GRAD)o(E==5)o(0]')26 b Ff(selects)34 b(only)f(those)g(ro)m(ws)f(in)g(the)120 3342 y(EVENTS)e(table)h(where)f(the)g(GRADE)h(column)g(v)-5 b(alue)30 b(is)h(equal)g(to)g(50\).)261 3455 y(The)d(ro)m(w)h (\014ltering)f(expression)h(can)f(b)s(e)g(an)h(arbitrarily)f(complex)i (series)e(of)h(op)s(erations)g(p)s(erformed)120 3568 y(on)d(constan)m(ts,)i(k)m(eyw)m(ord)e(v)-5 b(alues,)27 b(and)e(column)h(data)g(tak)m(en)h(from)e(the)h(sp)s(eci\014ed)f(FITS)g (T)-8 b(ABLE)26 b(exten-)120 3681 y(sion.)40 b(The)27 b(expression)g(also)i(can)e(b)s(e)g(written)h(in)m(to)h(a)e(text)i (\014le)f(and)f(then)g(used)g(b)m(y)g(giving)h(the)g(\014lename)120 3794 y(preceded)i(b)m(y)g(a)h('@')g(c)m(haracter,)h(as)e(in)g Fc('[@rowfilt.txt]')p Ff(.)261 3907 y(Keyw)m(ord)40 b(and)f(column)h (data)g(are)h(referenced)f(b)m(y)f(name.)70 b(An)m(y)40 b(string)g(of)g(c)m(haracters)h(not)f(sur-)120 4020 y(rounded)30 b(b)m(y)i(quotes)g(\(ie,)h(a)g(constan)m(t)g(string\))f(or)f(follo)m(w) m(ed)j(b)m(y)d(an)h(op)s(en)f(paren)m(theses)h(\(ie,)i(a)e(function)120 4133 y(name\))e(will)f(b)s(e)g(initially)h(in)m(terpreted)g(as)f(a)h (column)f(name)g(and)g(its)h(con)m(ten)m(ts)h(for)e(the)g(curren)m(t)g (ro)m(w)g(in-)120 4246 y(serted)e(in)m(to)h(the)g(expression.)39 b(If)27 b(no)g(suc)m(h)g(column)g(exists,)i(a)e(k)m(eyw)m(ord)h(of)g (that)f(name)h(will)f(b)s(e)g(searc)m(hed)120 4359 y(for)34 b(and)f(its)h(v)-5 b(alue)35 b(used,)f(if)g(found.)50 b(T)-8 b(o)35 b(force)f(the)g(name)g(to)h(b)s(e)e(in)m(terpreted)h(as)h (a)f(k)m(eyw)m(ord)g(\(in)g(case)120 4472 y(there)28 b(is)g(b)s(oth)f(a)h(column)g(and)f(k)m(eyw)m(ord)h(with)g(the)g(same)g (name\),)h(precede)f(the)g(k)m(eyw)m(ord)h(name)e(with)h(a)120 4584 y(single)k(p)s(ound)d(sign,)j('#',)g(as)g(in)f Fc(#NAXIS2)p Ff(.)41 b(Due)32 b(to)g(the)f(generalities)j(of)d(FITS)g(column)g(and)g (k)m(eyw)m(ord)120 4697 y(names,)c(if)e(the)h(column)g(or)f(k)m(eyw)m (ord)h(name)g(con)m(tains)h(a)f(space)g(or)g(a)g(c)m(haracter)h(whic)m (h)f(migh)m(t)g(app)s(ear)f(as)120 4810 y(an)32 b(arithmetic)h(term)f (then)g(inclose)h(the)f(name)g(in)f('$')i(c)m(haracters)h(as)e(in)g Fc($MAX)46 b(PHA$)31 b Ff(or)h Fc(#$MAX-PHA$)p Ff(.)120 4923 y(The)e(names)g(are)h(case)g(insensitiv)m(e.)261 5036 y(T)-8 b(o)37 b(access)g(a)g(table)g(en)m(try)g(in)f(a)g(ro)m(w)h (other)f(than)g(the)h(curren)m(t)f(one,)i(follo)m(w)g(the)e(column's)g (name)120 5149 y(with)j(a)g(ro)m(w)g(o\013set)g(within)g(curly)f (braces.)66 b(F)-8 b(or)40 b(example,)i Fc('PHA)p Fa(f)p Fc(-3)p Fa(g)p Fc(')c Ff(will)h(ev)-5 b(aluate)40 b(to)g(the)f(v)-5 b(alue)120 5262 y(of)40 b(column)f(PHA,)h(3)g(ro)m(ws)f(ab)s(o)m(v)m(e) i(the)f(ro)m(w)g(curren)m(tly)f(b)s(eing)g(pro)s(cessed.)68 b(One)39 b(cannot)h(sp)s(ecify)f(an)120 5375 y(absolute)33 b(ro)m(w)f(n)m(um)m(b)s(er,)f(only)h(a)h(relativ)m(e)h(o\013set.)47 b(Ro)m(ws)32 b(that)h(fall)f(outside)g(the)h(table)g(will)f(b)s(e)f (treated)120 5488 y(as)g(unde\014ned,)d(or)i(NULLs.)1905 5809 y(29)p eop end %%Page: 30 30 TeXDict begin 30 29 bop 261 573 a Ff(Bo)s(olean)32 b(op)s(erators)f (can)g(b)s(e)g(used)f(in)g(the)h(expression)g(in)f(either)i(their)f(F) -8 b(ortran)31 b(or)g(C)f(forms.)42 b(The)120 686 y(follo)m(wing)32 b(b)s(o)s(olean)e(op)s(erators)h(are)g(a)m(v)-5 b(ailable:)311 886 y Fc("equal")428 b(.eq.)46 b(.EQ.)h(==)95 b("not)46 b(equal")476 b(.ne.)94 b(.NE.)h(!=)311 999 y("less)46 b(than")238 b(.lt.)46 b(.LT.)h(<)143 b("less)46 b(than/equal")188 b(.le.)94 b(.LE.)h(<=)47 b(=<)311 1112 y("greater)e(than")95 b(.gt.)46 b(.GT.)h(>)143 b("greater)45 b(than/equal")g(.ge.)94 b(.GE.)h(>=)47 b(=>)311 1225 y("or")572 b(.or.)46 b(.OR.)h(||)95 b("and")762 b(.and.)46 b(.AND.)h(&&)311 1337 y("negation")236 b(.not.)46 b(.NOT.)h(!)95 b("approx.)45 b(equal\(1e-7\)")92 b(~)261 1537 y Ff(Note)34 b(that)g(the)f(exclamation)i(p)s(oin)m(t,)f (')10 b(!',)34 b(is)f(a)h(sp)s(ecial)f(UNIX)g(c)m(haracter,)j(so)d(if)g (it)g(is)g(used)f(on)h(the)120 1650 y(command)f(line)h(rather)f(than)g (en)m(tered)h(at)g(a)g(task)g(prompt,)f(it)h(m)m(ust)f(b)s(e)g (preceded)g(b)m(y)g(a)h(bac)m(kslash)g(to)120 1763 y(force)e(the)g (UNIX)f(shell)h(to)g(ignore)g(it.)261 1876 y(The)c(expression)f(ma)m(y) i(also)g(include)f(arithmetic)h(op)s(erators)f(and)f(functions.)39 b(T)-8 b(rigonometric)29 b(func-)120 1989 y(tions)f(use)g(radians,)h (not)f(degrees.)40 b(The)28 b(follo)m(wing)i(arithmetic)f(op)s(erators) f(and)g(functions)f(can)i(b)s(e)e(used)120 2102 y(in)j(the)h (expression)f(\(function)g(names)g(are)h(case)h(insensitiv)m(e\):)311 2302 y Fc("addition")522 b(+)477 b("subtraction")d(-)311 2415 y("multiplication")234 b(*)477 b("division")618 b(/)311 2528 y("negation")522 b(-)477 b("exponentiation")330 b(**)143 b(^)311 2641 y("absolute)45 b(value")237 b(abs\(x\))g ("cosine")714 b(cos\(x\))311 2754 y("sine")g(sin\(x\))237 b("tangent")666 b(tan\(x\))311 2867 y("arc)47 b(cosine")427 b(arccos\(x\))93 b("arc)47 b(sine")619 b(arcsin\(x\))311 2979 y("arc)47 b(tangent")379 b(arctan\(x\))93 b("arc)47 b(tangent")475 b(arctan2\(x,y\))311 3092 y("exponential")378 b(exp\(x\))237 b("square)46 b(root")476 b(sqrt\(x\))311 3205 y("natural)45 b(log")381 b(log\(x\))237 b("common)46 b(log")524 b(log10\(x\))311 3318 y("modulus")570 b(i)48 b(\045)f(j)286 b("random)46 b(#)h([0.0,1.0\)")141 b(random\(\))311 3431 y("minimum")570 b(min\(x,y\))141 b("maximum")666 b(max\(x,y\))311 3544 y("if-then-else")330 b(b?x:y)261 3744 y Ff(The)37 b(follo)m(wing)i(t)m(yp)s(e)f(casting)g(op)s(erators)g (are)g(a)m(v)-5 b(ailable,)41 b(where)c(the)h(inclosing)g(paren)m (theses)g(are)120 3857 y(required)23 b(and)h(tak)m(en)h(from)f(the)h(C) f(language)h(usage.)40 b(Also,)26 b(the)e(in)m(teger)i(to)f(real)g (casts)g(v)-5 b(alues)25 b(to)g(double)120 3970 y(precision:)884 4170 y Fc("real)46 b(to)h(integer")189 b(\(int\))46 b(x)239 b(\(INT\))46 b(x)884 4283 y("integer)f(to)i(real")190 b(\(float\))46 b(i)143 b(\(FLOAT\))45 b(i)261 4483 y Ff(Sev)m(eral)32 b(constan)m(ts)f(are)g(built)f(in)g(for)g(use)g(in)g (n)m(umerical)h(expressions:)502 4683 y Fc(#pi)667 b(3.1415...)284 b(#e)620 b(2.7182...)502 4796 y(#deg)f(#pi/180)380 b(#row)524 b(current)46 b(row)h(number)502 4909 y(#null)428 b(undefined)45 b(value)142 b(#snull)428 b(undefined)45 b(string)261 5109 y Ff(A)d(string)g(constan)m(t)h(m)m(ust)f(b)s(e)f(enclosed)i(in)f (quotes)g(as)g(in)g('Crab'.)75 b(The)41 b("n)m(ull")i(constan)m(ts)g (are)120 5222 y(useful)37 b(for)g(conditionally)i(setting)g(table)f(v) -5 b(alues)38 b(to)g(a)g(NULL,)g(or)f(unde\014ned,)h(v)-5 b(alue)38 b(\(F)-8 b(or)38 b(example,)120 5334 y Fc("col1==-99)45 b(?)95 b(#NULL)47 b(:)g(col1")p Ff(\).)261 5447 y(There)33 b(is)h(also)g(a)g(function)g(for)f(testing)i(if)e(t)m(w)m(o)i(v)-5 b(alues)34 b(are)g(close)h(to)f(eac)m(h)h(other,)g(i.e.,)h(if)d(they)h (are)120 5560 y("near")29 b(eac)m(h)g(other)f(to)g(within)g(a)g(user)f (sp)s(eci\014ed)g(tolerance.)42 b(The)27 b(argumen)m(ts,)i Fc(value)p 3184 5560 29 4 v 33 w(1)e Ff(and)h Fc(value)p 3707 5560 V 33 w(2)1905 5809 y Ff(30)p eop end %%Page: 31 31 TeXDict begin 31 30 bop 120 573 a Ff(can)39 b(b)s(e)g(in)m(teger)h(or)f (real)g(and)g(represen)m(t)g(the)g(t)m(w)m(o)h(v)-5 b(alues)39 b(who's)g(pro)m(ximit)m(y)h(is)f(b)s(eing)g(tested)g(to)h(b)s(e)120 686 y(within)30 b(the)g(sp)s(eci\014ed)g(tolerance,)i(also)g(an)e(in)m (teger)i(or)e(real:)1075 880 y Fc(near\(value_1,)44 b(value_2,)h (tolerance\))261 1074 y Ff(When)30 b(a)h(NULL,)f(or)h(unde\014ned,)d(v) -5 b(alue)31 b(is)f(encoun)m(tered)h(in)f(the)g(FITS)g(table,)h(the)g (expression)f(will)120 1186 y(ev)-5 b(aluate)43 b(to)f(NULL)g(unless)e (the)i(unde\014ned)d(v)-5 b(alue)42 b(is)g(not)f(actually)i(required)e (for)g(ev)-5 b(aluation,)46 b(e.g.)120 1299 y("TR)m(UE)c(.or.)76 b(NULL")42 b(ev)-5 b(aluates)44 b(to)f(TR)m(UE.)f(The)f(follo)m(wing)j (t)m(w)m(o)f(functions)f(allo)m(w)h(some)f(NULL)120 1412 y(detection)32 b(and)e(handling:)1027 1606 y Fc(ISNULL\(x\))1027 1719 y(DEFNULL\(x,y\))261 1913 y Ff(The)43 b(former)g(returns)f(a)i(b)s (o)s(olean)f(v)-5 b(alue)44 b(of)f(TR)m(UE)h(if)f(the)h(argumen)m(t)f (x)h(is)f(NULL.)h(The)e(later)120 2026 y("de\014nes")e(a)g(v)-5 b(alue)40 b(to)g(b)s(e)g(substituted)f(for)g(NULL)h(v)-5 b(alues;)45 b(it)40 b(returns)e(the)i(v)-5 b(alue)41 b(of)e(x)h(if)g(x)f(is)h(not)120 2139 y(NULL,)31 b(otherwise)f(it)h (returns)e(the)i(v)-5 b(alue)31 b(of)f(y)-8 b(.)261 2252 y(Bit)32 b(masks)f(can)g(b)s(e)f(used)g(to)h(select)i(out)e(ro)m(ws)g (from)f(bit)h(columns)f(\()p Fc(TFORMn)47 b(=)g(#X)p Ff(\))31 b(in)f(FITS)g(\014les.)120 2365 y(T)-8 b(o)31 b(represen)m(t)f(the)h(mask,)f(binary)-8 b(,)31 b(o)s(ctal,)h(and)d (hex)i(formats)f(are)h(allo)m(w)m(ed:)931 2558 y Fc(binary:)142 b(b0110xx1010000101xxxx00)o(01)931 2671 y(octal:)190 b(o720x1)46 b(->)h(\(b111010000xxx001\))931 2784 y(hex:)286 b(h0FxD)94 b(->)47 b(\(b00001111xxxx1101\))261 2978 y Ff(In)28 b(all)i(the)g(represen)m(tations,)g(an)f(x)g(or)g(X)g(is)g (allo)m(w)m(ed)i(in)e(the)g(mask)g(as)h(a)f(wild)g(card.)40 b(Note)30 b(that)g(the)120 3091 y(x)i(represen)m(ts)f(a)h(di\013eren)m (t)g(n)m(um)m(b)s(er)f(of)h(wild)f(card)h(bits)f(in)g(eac)m(h)i (represen)m(tation.)46 b(All)32 b(represen)m(tations)120 3204 y(are)f(case)g(insensitiv)m(e.)261 3317 y(T)-8 b(o)38 b(construct)f(the)h(b)s(o)s(olean)f(expression)g(using)g(the)g(mask)h (as)f(the)h(b)s(o)s(olean)f(equal)h(op)s(erator)f(de-)120 3430 y(scrib)s(ed)30 b(ab)s(o)m(v)m(e)h(on)g(a)g(bit)g(table)g(column.) 41 b(F)-8 b(or)32 b(example,)f(if)g(y)m(ou)g(had)f(a)h(7)g(bit)f (column)h(named)f(\015ags)h(in)120 3543 y(a)36 b(FITS)e(table)j(and)e (w)m(an)m(ted)h(all)g(ro)m(ws)f(ha)m(ving)h(the)g(bit)f(pattern)h (0010011,)k(the)35 b(selection)j(expression)120 3656 y(w)m(ould)30 b(b)s(e:)1456 3850 y Fc(flags)47 b(==)g(b0010011)311 3962 y(or)1456 4075 y(flags)g(.eq.)f(b10011)261 4269 y Ff(It)32 b(is)f(also)i(p)s(ossible)e(to)h(test)g(if)g(a)g(range)f(of) h(bits)f(is)h(less)g(than,)f(less)h(than)g(equal,)g(greater)h(than)e (and)120 4382 y(greater)h(than)e(equal)h(to)g(a)f(particular)h(b)s(o)s (olean)g(v)-5 b(alue:)1456 4576 y Fc(flags)47 b(<=)g(bxxx010xx)1456 4689 y(flags)g(.gt.)f(bxxx100xx)1456 4802 y(flags)h(.le.)f(b1xxxxxxx) 261 4996 y Ff(Notice)32 b(the)f(use)f(of)h(the)f(x)h(bit)f(v)-5 b(alue)31 b(to)g(limit)g(the)g(range)f(of)h(bits)f(b)s(eing)g (compared.)261 5109 y(It)j(is)g(not)g(necessary)g(to)g(sp)s(ecify)g (the)f(leading)i(\(most)f(signi\014can)m(t\))h(zero)g(\(0\))g(bits)e (in)h(the)g(mask,)g(as)120 5222 y(sho)m(wn)d(in)g(the)g(second)h (expression)f(ab)s(o)m(v)m(e.)261 5334 y(Bit)h(wise)f(AND,)g(OR)g(and)f (NOT)g(op)s(erations)h(are)g(also)h(p)s(ossible)e(on)g(t)m(w)m(o)i(or)f (more)g(bit)g(\014elds)f(using)120 5447 y(the)38 b('&'\(AND\),)h(')p Fa(j)p Ff('\(OR\),)g(and)e(the)h(')10 b(!'\(NOT\))38 b(op)s(erators.)63 b(All)38 b(of)g(these)g(op)s(erators)g(result)f(in)g (a)h(bit)120 5560 y(\014eld)30 b(whic)m(h)g(can)h(then)f(b)s(e)g(used)f (with)h(the)h(equal)g(op)s(erator.)41 b(F)-8 b(or)31 b(example:)1905 5809 y(31)p eop end %%Page: 32 32 TeXDict begin 32 31 bop 1361 573 a Fc(\(!flags\))45 b(==)j(b1101100) 1361 686 y(\(flags)e(&)h(b1000001\))f(==)h(bx000001)261 887 y Ff(Bit)36 b(\014elds)e(can)g(b)s(e)g(app)s(ended)f(as)i(w)m(ell)g (using)f(the)h('+')g(op)s(erator.)53 b(Strings)34 b(can)h(b)s(e)f (concatenated)120 1000 y(this)c(w)m(a)m(y)-8 b(,)32 b(to)s(o.)120 1238 y Fg(5.4.3)105 b(Go)s(o)s(d)36 b(Time)f(In)m(terv)-6 b(al)34 b(Filtering)120 1410 y Ff(A)27 b(common)g(\014ltering)g(metho)s (d)g(in)m(v)m(olv)m(es)i(selecting)g(ro)m(ws)d(whic)m(h)h(ha)m(v)m(e)h (a)g(time)f(v)-5 b(alue)28 b(whic)m(h)e(lies)i(within)120 1523 y(what)38 b(is)f(called)i(a)f(Go)s(o)s(d)g(Time)f(In)m(terv)-5 b(al)39 b(or)e(GTI.)h(The)f(time)i(in)m(terv)-5 b(als)38 b(are)g(de\014ned)f(in)g(a)h(separate)120 1636 y(FITS)31 b(table)i(extension)f(whic)m(h)g(con)m(tains)h(2)f(columns)f(giving)i (the)f(start)g(and)f(stop)h(time)h(of)f(eac)m(h)g(go)s(o)s(d)120 1749 y(in)m(terv)-5 b(al.)61 b(The)37 b(\014ltering)g(op)s(eration)g (accepts)h(only)f(those)g(ro)m(ws)g(of)g(the)g(input)f(table)i(whic)m (h)e(ha)m(v)m(e)i(an)120 1861 y(asso)s(ciated)32 b(time)g(whic)m(h)f (falls)g(within)f(one)i(of)f(the)g(time)g(in)m(terv)-5 b(als)32 b(de\014ned)e(in)h(the)g(GTI)f(extension.)43 b(A)120 1974 y(high)29 b(lev)m(el)j(function,)e (gti\014lter\(a,b,c,d\),)j(is)c(a)m(v)-5 b(ailable)33 b(whic)m(h)c(ev)-5 b(aluates)32 b(eac)m(h)f(ro)m(w)f(of)g(the)g(input)e (table)120 2087 y(and)i(returns)g(TR)m(UE)g(or)h(F)-10 b(ALSE)30 b(dep)s(ending)g(whether)g(the)g(ro)m(w)h(is)g(inside)f(or)h (outside)g(the)g(go)s(o)s(d)g(time)120 2200 y(in)m(terv)-5 b(al.)42 b(The)30 b(syn)m(tax)h(is)406 2401 y Fc(gtifilter\()45 b([)j("gtifile")d([,)i(expr)g([,)g("STARTCOL",)e("STOPCOL")g(])j(])f(]) g(\))120 2603 y Ff(where)35 b(eac)m(h)i("[]")g(demarks)e(optional)h (parameters.)57 b(Note)37 b(that)f(the)g(quotes)g(around)e(the)i (gti\014le)h(and)120 2716 y(ST)-8 b(AR)g(T/STOP)31 b(column)i(are)g (required.)46 b(Either)33 b(single)g(or)f(double)h(quote)g(c)m (haracters)h(ma)m(y)f(b)s(e)f(used.)120 2828 y(The)c(gti\014le,)i(if)e (sp)s(eci\014ed,)h(can)f(b)s(e)g(blank)g(\(""\))i(whic)m(h)e(will)h (mean)g(to)g(use)f(the)g(\014rst)g(extension)h(with)f(the)120 2941 y(name)23 b("*GTI*")i(in)e(the)g(curren)m(t)g(\014le,)i(a)e(plain) g(extension)h(sp)s(eci\014er)f(\(eg,)j("+2",)f("[2]",)i(or)c ("[STDGTI]"\))120 3054 y(whic)m(h)g(will)h(b)s(e)f(used)g(to)i(select)g (an)f(extension)g(in)f(the)h(curren)m(t)g(\014le,)h(or)f(a)g(regular)f (\014lename)h(with)g(or)f(with-)120 3167 y(out)j(an)g(extension)h(sp)s (eci\014er)e(whic)m(h)h(in)f(the)i(latter)g(case)g(will)f(mean)g(to)h (use)f(the)g(\014rst)f(extension)i(with)e(an)120 3280 y(extension)30 b(name)g("*GTI*".)42 b(Expr)28 b(can)i(b)s(e)f(an)m(y)g (arithmetic)i(expression,)f(including)f(simply)g(the)h(time)120 3393 y(column)k(name.)52 b(A)34 b(v)m(ector)i(time)f(expression)f(will) g(pro)s(duce)f(a)i(v)m(ector)g(b)s(o)s(olean)g(result.)51 b(ST)-8 b(AR)g(TCOL)120 3506 y(and)33 b(STOPCOL)f(are)j(the)f(names)g (of)g(the)g(ST)-8 b(AR)g(T/STOP)33 b(columns)h(in)f(the)i(GTI)e (extension.)53 b(If)33 b(one)120 3619 y(of)e(them)f(is)g(sp)s (eci\014ed,)g(they)h(b)s(oth)e(m)m(ust)i(b)s(e.)261 3732 y(In)37 b(its)i(simplest)f(form,)i(no)e(parameters)g(need)g(to)h(b)s(e) e(pro)m(vided)h({)g(default)h(v)-5 b(alues)38 b(will)g(b)s(e)g(used.) 120 3845 y(The)30 b(expression)g Fc("gtifilter\(\)")d Ff(is)j(equiv)-5 b(alen)m(t)32 b(to)454 4046 y Fc(gtifilter\()45 b("",)i(TIME,)f("*START*",)f("*STOP*")h(\))120 4247 y Ff(This)31 b(will)i(searc)m(h)g(the)f(curren)m(t)g(\014le)h(for)f(a)g (GTI)g(extension,)i(\014lter)e(the)g(TIME)g(column)g(in)g(the)h(curren) m(t)120 4360 y(table,)48 b(using)c(ST)-8 b(AR)g(T/STOP)43 b(times)h(tak)m(en)h(from)e(columns)h(in)g(the)g(GTI)f(extension)i (with)e(names)120 4473 y(con)m(taining)32 b(the)f(strings)f("ST)-8 b(AR)g(T")31 b(and)f("STOP".)41 b(The)30 b(wildcards)g(\('*'\))i(allo)m (w)g(sligh)m(t)f(v)-5 b(ariations)32 b(in)120 4586 y(naming)g(con)m(v)m (en)m(tions)h(suc)m(h)f(as)g("TST)-8 b(AR)g(T")32 b(or)g("ST)-8 b(AR)g(TTIME".)45 b(The)31 b(same)i(default)f(v)-5 b(alues)32 b(apply)120 4699 y(for)f(unsp)s(eci\014ed)f(parameters)i(when)e(the)i (\014rst)e(one)i(or)f(t)m(w)m(o)i(parameters)f(are)g(sp)s(eci\014ed.)43 b(The)31 b(function)120 4812 y(automatically)44 b(searc)m(hes)d(for)g (TIMEZER)m(O/I/F)g(k)m(eyw)m(ords)g(in)f(the)h(curren)m(t)g(and)f(GTI)h (extensions,)120 4924 y(applying)30 b(a)h(relativ)m(e)h(time)g (o\013set,)f(if)g(necessary)-8 b(.)120 5163 y Fg(5.4.4)105 b(Spatial)35 b(Region)h(Filtering)120 5334 y Ff(Another)f(common)h (\014ltering)g(metho)s(d)f(selects)h(ro)m(ws)g(based)f(on)g(whether)g (the)h(spatial)g(p)s(osition)f(asso-)120 5447 y(ciated)41 b(with)f(eac)m(h)i(ro)m(w)e(is)g(lo)s(cated)h(within)f(a)g(giv)m(en)i (2-dimensional)f(region.)70 b(The)40 b(syn)m(tax)h(for)e(this)120 5560 y(high-lev)m(el)32 b(\014lter)f(is)1905 5809 y(32)p eop end %%Page: 33 33 TeXDict begin 33 32 bop 454 573 a Fc(regfilter\()45 b("regfilename")f ([)k(,)f(Xexpr,)f(Yexpr)h([)g(,)h("wcs)e(cols")h(])g(])g(\))120 757 y Ff(where)28 b(eac)m(h)i("[)g(]")f(demarks)g(optional)h (parameters.)40 b(The)29 b(region)g(\014le)g(name)g(is)g(required)f (and)g(m)m(ust)h(b)s(e)120 870 y(enclosed)h(in)f(quotes.)41 b(The)29 b(remaining)g(parameters)h(are)f(optional.)42 b(The)29 b(region)h(\014le)f(is)g(an)h(ASCI)s(I)d(text)120 983 y(\014le)37 b(whic)m(h)f(con)m(tains)i(a)f(list)h(of)e(one)h(or)g (more)g(geometric)i(shap)s(es)c(\(circle,)41 b(ellipse,)e(b)s(o)m(x,)f (etc.\))62 b(whic)m(h)120 1096 y(de\014nes)30 b(a)i(region)g(on)f(the)h (celestial)i(sphere)d(or)g(an)g(area)h(within)f(a)h(particular)g(2D)g (image.)45 b(The)31 b(region)120 1209 y(\014le)38 b(is)g(t)m(ypically)i (generated)f(using)f(an)g(image)h(displa)m(y)g(program)f(suc)m(h)f(as)i (fv/PO)m(W)f(\(distribute)g(b)m(y)120 1322 y(the)32 b(HEASAR)m(C\),)g (or)g(ds9)g(\(distributed)f(b)m(y)g(the)h(Smithsonian)g(Astroph)m (ysical)g(Observ)-5 b(atory\).)46 b(Users)120 1435 y(should)41 b(refer)h(to)h(the)f(do)s(cumen)m(tation)h(pro)m(vided)f(with)g(these)g (programs)g(for)g(more)g(details)h(on)f(the)120 1548 y(syn)m(tax)31 b(used)e(in)i(the)f(region)h(\014les.)261 1661 y(In)k(its)h(simpliest)g(form,)h(\(e.g.,)i Fc (regfilter\("region.reg"\))30 b Ff(\))36 b(the)f(co)s(ordinates)i(in)e (the)h(default)120 1774 y('X')24 b(and)e('Y')i(columns)e(will)i(b)s(e)e (used)g(to)i(determine)f(if)g(eac)m(h)h(ro)m(w)f(is)g(inside)g(or)g (outside)g(the)g(area)h(sp)s(eci\014ed)120 1886 y(in)h(the)h(region)g (\014le.)39 b(Alternate)27 b(p)s(osition)e(column)g(names,)i(or)e (expressions,)h(ma)m(y)g(b)s(e)f(en)m(tered)h(if)f(needed,)120 1999 y(as)31 b(in)502 2184 y Fc(regfilter\("region.reg",)41 b(XPOS,)47 b(YPOS\))120 2368 y Ff(Region)39 b(\014ltering)g(can)f(b)s (e)g(applied)g(most)g(unam)m(biguously)g(if)g(the)g(p)s(ositions)h(in)e (the)i(region)g(\014le)f(and)120 2481 y(in)e(the)h(table)h(to)g(b)s(e)e (\014ltered)h(are)g(b)s(oth)f(giv)m(e)i(in)f(terms)f(of)h(absolute)h (celestial)h(co)s(ordinate)f(units.)59 b(In)120 2594 y(this)38 b(case)h(the)g(lo)s(cations)h(and)d(sizes)i(of)g(the)f (geometric)i(shap)s(es)e(in)g(the)g(region)h(\014le)f(are)h(sp)s (eci\014ed)f(in)120 2707 y(angular)d(units)f(on)g(the)h(sky)f(\(e.g.,)j (p)s(ositions)e(giv)m(en)h(in)e(R.A.)h(and)f(Dec.)54 b(and)34 b(sizes)h(in)f(arcseconds)h(or)120 2820 y(arcmin)m(utes\).)k (Similarly)-8 b(,)24 b(eac)m(h)f(ro)m(w)g(of)f(the)g(\014ltered)g (table)h(will)f(ha)m(v)m(e)h(a)g(celestial)h(co)s(ordinate)f(asso)s (ciated)120 2933 y(with)33 b(it.)51 b(This)33 b(asso)s(ciation)i(is)f (usually)f(implemen)m(ted)h(using)g(a)f(set)i(of)e(so-called)j('W)-8 b(orld)34 b(Co)s(ordinate)120 3046 y(System')i(\(or)h(W)m(CS\))f(FITS)f (k)m(eyw)m(ords)i(that)f(de\014ne)g(the)g(co)s(ordinate)h (transformation)f(that)h(m)m(ust)f(b)s(e)120 3159 y(applied)30 b(to)h(the)g(v)-5 b(alues)31 b(in)f(the)g('X')h(and)f('Y')h(columns)f (to)h(calculate)i(the)d(co)s(ordinate.)261 3272 y(Alternativ)m(ely)-8 b(,)40 b(one)c(can)f(p)s(erform)f(spatial)j(\014ltering)e(using)g (unitless)h('pixel')g(co)s(ordinates)g(for)f(the)120 3385 y(regions)c(and)f(ro)m(w)h(p)s(ositions.)42 b(In)30 b(this)g(case)i(the)f(user)f(m)m(ust)h(b)s(e)f(careful)h(to)g(ensure)f (that)h(the)g(p)s(ositions)120 3498 y(in)i(the)g(2)h(\014les)f(are)h (self-consisten)m(t.)51 b(A)34 b(t)m(ypical)g(problem)f(is)g(that)h (the)g(region)g(\014le)f(ma)m(y)h(b)s(e)e(generated)120 3610 y(using)23 b(a)h(binned)f(image,)j(but)d(the)h(un)m(binned)e(co)s (ordinates)i(are)h(giv)m(en)f(in)g(the)g(ev)m(en)m(t)h(table.)39 b(The)24 b(R)m(OSA)-8 b(T)120 3723 y(ev)m(en)m(ts)34 b(\014les,)g(for)f(example,)i(ha)m(v)m(e)f(X)f(and)g(Y)g(pixel)g(co)s (ordinates)h(that)g(range)f(from)g(1)g(-)h(15360.)51 b(These)120 3836 y(co)s(ordinates)33 b(are)g(t)m(ypically)i(binned)c(b) m(y)i(a)g(factor)g(of)g(32)h(to)f(pro)s(duce)f(a)h(480x480)i(pixel)e (image.)49 b(If)32 b(one)120 3949 y(then)f(uses)g(a)g(region)h(\014le)f (generated)i(from)d(this)h(image)i(\(in)e(image)h(pixel)g(units\))f(to) h(\014lter)f(the)h(R)m(OSA)-8 b(T)120 4062 y(ev)m(en)m(ts)33 b(\014le,)f(then)f(the)g(X)g(and)g(Y)h(column)f(v)-5 b(alues)31 b(m)m(ust)h(b)s(e)e(con)m(v)m(erted)j(to)f(corresp)s(onding) e(pixel)i(units)120 4175 y(as)f(in:)502 4360 y Fc (regfilter\("rosat.reg",)42 b(X/32.+.5,)j(Y/32.+.5\))120 4544 y Ff(Note)30 b(that)f(this)f(binning)g(con)m(v)m(ersion)h(is)g (not)g(necessary)g(if)f(the)h(region)g(\014le)f(is)h(sp)s(eci\014ed)f (using)g(celestial)120 4657 y(co)s(ordinate)g(units)f(instead)g(of)g (pixel)h(units)e(b)s(ecause)h(CFITSIO)f(is)h(then)g(able)h(to)g (directly)f(compare)h(the)120 4770 y(celestial)37 b(co)s(ordinate)e(of) f(eac)m(h)h(ro)m(w)f(in)g(the)g(table)h(with)f(the)g(celestial)j(co)s (ordinates)e(in)e(the)i(region)f(\014le)120 4883 y(without)c(ha)m(ving) h(to)g(kno)m(w)g(an)m(ything)g(ab)s(out)f(ho)m(w)g(the)h(image)g(ma)m (y)g(ha)m(v)m(e)h(b)s(een)d(binned.)261 4996 y(The)k(last)h("w)m(cs)f (cols")i(parameter)e(should)f(rarely)h(b)s(e)g(needed.)48 b(If)33 b(supplied,)f(this)h(string)g(con)m(tains)120 5109 y(the)39 b(names)g(of)h(the)f(2)g(columns)g(\(space)h(or)f(comma)h (separated\))g(whic)m(h)f(ha)m(v)m(e)h(the)g(asso)s(ciated)g(W)m(CS)120 5222 y(k)m(eyw)m(ords.)j(If)30 b(not)h(supplied,)f(the)h(\014lter)g (will)g(scan)g(the)g(X)g(and)g(Y)g(expressions)f(for)h(column)g(names.) 42 b(If)120 5334 y(only)33 b(one)f(is)h(found)e(in)h(eac)m(h)i (expression,)f(those)g(columns)f(will)h(b)s(e)f(used,)h(otherwise)g(an) f(error)g(will)h(b)s(e)120 5447 y(returned.)261 5560 y(These)d(region)h(shap)s(es)f(are)g(supp)s(orted)f(\(names)i(are)f (case)i(insensitiv)m(e\):)1905 5809 y(33)p eop end %%Page: 34 34 TeXDict begin 34 33 bop 454 573 a Fc(Point)428 b(\()48 b(X1,)f(Y1)g(\))715 b(<-)48 b(One)f(pixel)f(square)g(region)454 686 y(Line)476 b(\()48 b(X1,)f(Y1,)g(X2,)f(Y2)i(\))333 b(<-)48 b(One)f(pixel)f(wide)h(region)454 799 y(Polygon)332 b(\()48 b(X1,)f(Y1,)g(X2,)f(Y2,)h(...)g(\))95 b(<-)48 b(Rest)e(are)h(interiors)e(with)454 912 y(Rectangle)236 b(\()48 b(X1,)f(Y1,)g(X2,)f(Y2,)h(A)h(\))334 b(|)47 b(boundaries)e (considered)454 1024 y(Box)524 b(\()48 b(Xc,)f(Yc,)g(Wdth,)f(Hght,)g(A) i(\))143 b(V)47 b(within)f(the)h(region)454 1137 y(Diamond)332 b(\()48 b(Xc,)f(Yc,)g(Wdth,)f(Hght,)g(A)i(\))454 1250 y(Circle)380 b(\()48 b(Xc,)f(Yc,)g(R)g(\))454 1363 y(Annulus)332 b(\()48 b(Xc,)f(Yc,)g(Rin,)f(Rout)h(\))454 1476 y(Ellipse)332 b(\()48 b(Xc,)f(Yc,)g(Rx,)f(Ry,)h(A)h(\))454 1589 y(Elliptannulus)c(\() k(Xc,)f(Yc,)g(Rinx,)f(Riny,)g(Routx,)g(Routy,)g(Ain,)h(Aout)g(\))454 1702 y(Sector)380 b(\()48 b(Xc,)f(Yc,)g(Amin,)f(Amax)h(\))120 1914 y Ff(where)33 b(\(Xc,Yc\))j(is)e(the)h(co)s(ordinate)f(of)h(the)f (shap)s(e's)f(cen)m(ter;)k(\(X#,Y#\))e(are)f(the)g(co)s(ordinates)h(of) f(the)120 2027 y(shap)s(e's)22 b(edges;)k(Rxxx)d(are)g(the)h(shap)s (es')e(v)-5 b(arious)23 b(Radii)g(or)g(semima)5 b(jor/minor)23 b(axes;)k(and)22 b(Axxx)h(are)g(the)120 2140 y(angles)j(of)f(rotation)h (\(or)f(b)s(ounding)e(angles)j(for)f(Sector\))h(in)e(degrees.)40 b(F)-8 b(or)26 b(rotated)g(shap)s(es,)f(the)g(rotation)120 2253 y(angle)37 b(can)g(b)s(e)e(left)i(o\013,)h(indicating)f(no)f (rotation.)60 b(Common)35 b(alternate)j(names)e(for)g(the)g(regions)h (can)120 2366 y(also)28 b(b)s(e)e(used:)39 b(rotb)s(o)m(x)27 b(=)f(b)s(o)m(x;)j(rotrectangle)g(=)e(rectangle;)j(\(rot\)rhom)m(bus)c (=)h(\(rot\)diamond;)i(and)d(pie)120 2479 y(=)h(sector.)41 b(When)28 b(a)g(shap)s(e's)f(name)g(is)h(preceded)f(b)m(y)h(a)g(min)m (us)f(sign,)i('-',)g(the)f(de\014ned)e(region)i(is)g(instead)120 2592 y(the)36 b(area)g(*outside*)h(its)f(b)s(oundary)d(\(ie,)38 b(the)e(region)g(is)g(in)m(v)m(erted\).)57 b(All)36 b(the)g(shap)s(es)f (within)g(a)h(single)120 2705 y(region)f(\014le)g(are)g(OR'd)g (together)h(to)f(create)i(the)e(region,)h(and)f(the)g(order)f(is)h (signi\014can)m(t.)55 b(The)34 b(o)m(v)m(erall)120 2818 y(w)m(a)m(y)g(of)g(lo)s(oking)g(at)g(region)g(\014les)f(is)g(that)h(if) f(the)h(\014rst)e(region)i(is)g(an)f(excluded)g(region)h(then)f(a)g (dumm)m(y)120 2931 y(included)c(region)i(of)f(the)g(whole)g(detector)i (is)e(inserted)f(in)h(the)g(fron)m(t.)41 b(Then)29 b(eac)m(h)i(region)g (sp)s(eci\014cation)120 3044 y(as)g(it)h(is)f(pro)s(cessed)g(o)m(v)m (errides)h(an)m(y)f(selections)i(inside)e(of)g(that)h(region)g(sp)s (eci\014ed)e(b)m(y)h(previous)g(regions.)120 3156 y(Another)e(w)m(a)m (y)i(of)e(thinking)g(ab)s(out)g(this)g(is)h(that)f(if)h(a)f(previous)g (excluded)g(region)h(is)g(completely)h(inside)120 3269 y(of)g(a)f(subsequen)m(t)g(included)g(region)h(the)f(excluded)g(region) h(is)g(ignored.)261 3382 y(The)20 b(p)s(ositional)h(co)s(ordinates)g (ma)m(y)g(b)s(e)e(giv)m(en)j(either)e(in)g(pixel)h(units,)h(decimal)f (degrees)g(or)f(hh:mm:ss.s,)120 3495 y(dd:mm:ss.s)25 b(units.)38 b(The)26 b(shap)s(e)f(sizes)h(ma)m(y)h(b)s(e)e(giv)m(en)i (in)e(pixels,)j(degrees,)f(arcmin)m(utes,)h(or)e(arcseconds.)120 3608 y(Lo)s(ok)k(at)i(examples)e(of)h(region)g(\014le)f(pro)s(duced)f (b)m(y)h(fv/PO)m(W)h(or)f(ds9)g(for)g(further)f(details)j(of)e(the)h (region)120 3721 y(\014le)f(format.)120 3961 y Fg(5.4.5)105 b(Example)35 b(Ro)m(w)g(Filters)311 4133 y Fc([double)46 b(&&)h(mag)g(<=)g(5.0])381 b(-)95 b(Extract)46 b(all)h(double)f(stars)g (brighter)1886 4246 y(than)94 b(fifth)47 b(magnitude)311 4472 y([#row)f(>=)h(125)g(&&)h(#row)e(<=)h(175])142 b(-)48 b(Extract)e(row)h(numbers)e(125)i(through)f(175)311 4697 y([abs\(sin\(theta)e(*)j(#deg\)\))f(<)i(0.5])e(-)i(Extract)e(all)h (rows)f(having)g(the)1886 4810 y(absolute)f(value)i(of)g(the)g(sine)g (of)g(theta)1886 4923 y(less)94 b(than)47 b(a)g(half)g(where)f(the)h (angles)1886 5036 y(are)g(tabulated)e(in)i(degrees)311 5262 y([@rowFilter.txt])711 b(-)48 b(Extract)e(rows)g(using)h(the)g (expression)1886 5375 y(contained)e(within)h(the)h(text)g(file)1886 5488 y(rowFilter.txt)1905 5809 y Ff(34)p eop end %%Page: 35 35 TeXDict begin 35 34 bop 311 686 a Fc([gtifilter\(\)])855 b(-)48 b(Search)e(the)h(current)f(file)g(for)h(a)h(GTI)359 799 y(extension,)92 b(filter)i(the)47 b(TIME)359 912 y(column)f(in)h(the)g(current)f(table,)g(using)359 1024 y(START/STOP)f(times)h(taken)g(from)359 1137 y(columns)f(in)j(the)f (GTI)94 b(extension)311 1363 y([regfilter\("pow.reg"\)])423 b(-)48 b(Extract)e(rows)g(which)h(have)f(a)i(coordinate)1886 1476 y(\(as)f(given)f(in)h(the)g(X)h(and)f(Y)g(columns\))1886 1589 y(within)f(the)h(spatial)f(region)g(specified)1886 1702 y(in)h(the)g(pow.reg)f(region)g(file.)1905 5809 y Ff(35)p eop end %%Page: 36 36 TeXDict begin 36 35 bop 120 573 a Fb(5.5)112 b(Com)m(bined)39 b(Filtering)f(Examples)120 744 y Ff(The)29 b(previous)h(sections)g (describ)s(ed)f(all)i(the)f(individual)f(t)m(yp)s(es)h(of)g(\014lters)f (that)i(ma)m(y)f(b)s(e)f(applied)h(to)g(the)120 857 y(input)j(\014le.) 50 b(In)33 b(this)g(section)i(w)m(e)f(sho)m(w)g(examples)g(whic)m(h)f (com)m(bine)i(sev)m(eral)f(di\013eren)m(t)h(\014lters)e(at)h(once.)120 970 y(These)h(examples)g(all)h(use)f(the)g Fc(fitscopy)e Ff(program)i(that)g(is)g(distributed)f(with)h(the)g(CFITSIO)f(co)s(de.) 120 1083 y(It)c(simply)g(copies)i(the)e(input)g(\014le)g(to)h(the)g (output)f(\014le.)120 1268 y Fc(fitscopy)46 b(rosat.fit)f(out.fit)261 1453 y Ff(This)26 b(trivial)i(example)f(simply)g(mak)m(es)g(an)g(iden)m (tical)i(cop)m(y)e(of)g(the)g(input)f(rosat.\014t)h(\014le)g(without)g (an)m(y)120 1566 y(\014ltering.)120 1751 y Fc(fitscopy)46 b('rosat.fit[events][col)41 b(Time;X;Y][#row)j(<)k(1000]')e(out.fit)261 1936 y Ff(The)34 b(output)g(\014le)h(con)m(tains)h(only)e(the)h(Time,)h (X,)f(and)e(Y)i(columns,)h(and)d(only)i(the)g(\014rst)f(999)h(ro)m(ws) 120 2049 y(from)g(the)g('EVENTS')f(table)i(extension)g(of)f(the)g (input)f(\014le.)55 b(All)35 b(the)h(other)f(HDUs)g(in)g(the)g(input)f (\014le)120 2162 y(are)d(copied)g(to)g(the)f(output)g(\014le)h(without) f(an)m(y)h(mo)s(di\014cation.)120 2346 y Fc(fitscopy)46 b('rosat.fit[events][PI)c(<)47 b(50][bin)f(\(Xdet,Ydet\))f(=)i(16]')g (image.fit)261 2531 y Ff(This)30 b(creates)h(an)f(output)g(image)i(b)m (y)e(binning)f(the)h(Xdet)h(and)f(Ydet)g(columns)g(of)g(the)h(ev)m(en)m (ts)g(table)120 2644 y(with)26 b(a)h(pixel)g(binning)e(factor)i(of)g (16.)40 b(Only)26 b(the)h(ro)m(ws)f(whic)m(h)g(ha)m(v)m(e)i(a)e(PI)h (energy)f(less)h(than)f(50)h(are)g(used)120 2757 y(to)33 b(construct)f(this)f(image.)46 b(The)32 b(output)f(image)i(\014le)f (con)m(tains)h(a)f(primary)f(arra)m(y)h(image)h(without)f(an)m(y)120 2870 y(extensions.)120 3055 y Fc(fitscopy)46 b('rosat.fit[events][gtif) o(ilt)o(er\(\))41 b(&&)47 b(regfilter\("pow.reg"\)]')42 b(out.fit)261 3240 y Ff(The)29 b(\014ltering)h(expression)f(in)g(this)h (example)g(uses)f(the)h Fc(gtifilter)d Ff(function)i(to)h(test)g (whether)f(the)120 3353 y(TIME)e(column)g(v)-5 b(alue)27 b(in)g(eac)m(h)i(ro)m(w)e(is)g(within)g(one)g(of)g(the)h(Go)s(o)s(d)f (Time)g(In)m(terv)-5 b(als)27 b(de\014ned)f(in)h(the)h(GTI)120 3466 y(extension)i(in)f(the)h(same)g(input)e(\014le,)i(and)f(also)i (uses)e(the)g Fc(regfilter)e Ff(function)j(to)g(test)g(if)g(the)f(p)s (osition)120 3579 y(asso)s(ciated)j(with)d(eac)m(h)i(ro)m(w)g(\(deriv)m (ed)f(b)m(y)g(default)g(from)g(the)g(v)-5 b(alues)30 b(in)g(the)g(X)h(and)e(Y)h(columns)g(of)g(the)120 3692 y(ev)m(en)m(ts)38 b(table\))f(is)g(lo)s(cated)h(within)d(the)i(area)g (de\014ned)e(in)i(the)f Fc(pow.reg)f Ff(text)i(region)g(\014le)f (\(whic)m(h)h(w)m(as)120 3804 y(previously)h(created)i(with)f(the)f Fc(fv/POW)f Ff(image)j(displa)m(y)f(program\).)66 b(Only)38 b(the)h(ro)m(ws)f(whic)m(h)h(satisfy)120 3917 y(b)s(oth)30 b(tests)h(are)g(copied)f(to)h(the)g(output)f(table.)120 4102 y Fc(fitscopy)46 b('r.fit[evt][PI<50]')c(stdout)k(|)i(fitscopy)d (stdin[evt][col)f(X,Y])j(out.fit)261 4287 y Ff(In)25 b(this)g(somewhat)h(con)m(v)m(oluted)g(example,)i(\014tscop)m(y)d(is)h (used)e(to)i(\014rst)f(select)i(the)e(ro)m(ws)g(from)g(the)h(evt)120 4400 y(extension)k(whic)m(h)g(ha)m(v)m(e)h(PI)e(less)h(than)g(50)g(and) f(write)h(the)g(resulting)g(table)h(out)f(to)g(the)g(stdout)g(stream.) 120 4513 y(This)37 b(is)g(pip)s(ed)f(to)i(a)g(2nd)f(instance)h(of)g (\014tscop)m(y)g(\(with)f(the)h(Unix)f(`)p Fa(j)p Ff(')h(pip)s(e)f (command\))g(whic)m(h)h(reads)120 4626 y(that)31 b(\014ltered)g(FITS)e (\014le)i(from)f(the)h(stdin)f(stream)h(and)f(copies)h(only)g(the)g(X)f (and)g(Y)h(columns)f(from)g(the)120 4739 y(evt)h(table)g(to)g(the)g (output)f(\014le.)120 4924 y Fc(fitscopy)46 b('r.fit[evt][col)d (RAD=sqrt\(\(X-#XCEN\)**2+\(Y-)o(#YCE)o(N\)*)o(*2\)])o([rad)o(<10)o (0]')e(out.fit)261 5109 y Ff(This)24 b(example)i(\014rst)e(creates)i(a) f(new)f(column)h(called)h(RAD)f(whic)m(h)f(giv)m(es)i(the)f(distance)h (b)s(et)m(w)m(een)f(the)120 5222 y(X,Y)k(co)s(ordinate)g(of)f(eac)m(h)i (ev)m(en)m(t)g(and)d(the)i(co)s(ordinate)g(de\014ned)e(b)m(y)h(the)h(X) m(CEN)f(and)g(YCEN)g(k)m(eyw)m(ords)120 5334 y(in)k(the)h(header.)47 b(Then,)32 b(only)h(those)g(ro)m(ws)g(whic)m(h)f(ha)m(v)m(e)i(a)f (distance)g(less)g(than)f(100)i(are)f(copied)g(to)g(the)120 5447 y(output)e(table.)46 b(In)31 b(other)h(w)m(ords,)f(only)h(the)g (ev)m(en)m(ts)h(whic)m(h)f(are)g(lo)s(cated)h(within)e(100)i(pixel)f (units)f(from)120 5560 y(the)g(\(X)m(CEN,)g(YCEN\))f(co)s(ordinate)i (are)e(copied)h(to)g(the)g(output)f(table.)1905 5809 y(36)p eop end %%Page: 37 37 TeXDict begin 37 36 bop 120 573 a Fc(fitscopy)46 b ('ftp://heasarc.gsfc.nas)o(a.g)o(ov/r)o(osat)o(.fi)o(t[ev)o(ents)o(][b) o(in)c(\(X,Y\)=16]')j(img.fit)261 785 y Ff(This)23 b(example)h(bins)e (the)h(X)h(and)f(Y)g(columns)g(of)g(the)h(h)m(yp)s(othetical)g(R)m(OSA) -8 b(T)24 b(\014le)f(at)h(the)f(HEASAR)m(C)120 898 y(ftp)30 b(site)h(to)g(create)h(the)f(output)f(image.)120 1111 y Fc(fitscopy)46 b('raw.fit[i512,512][101:)o(110)o(,51:)o(60]')41 b(image.fit)261 1323 y Ff(This)29 b(example)h(con)m(v)m(erts)h(the)e (512)i(x)e(512)i(pixel)f(ra)m(w)f(binary)g(16-bit)h(in)m(teger)h(image) g(to)f(a)g(FITS)e(\014le)120 1436 y(and)i(copies)h(a)g(10)g(x)f(10)h (pixel)g(subimage)g(from)f(it)g(to)i(the)e(output)g(FITS)g(image.)1905 5809 y(37)p eop end %%Page: 38 38 TeXDict begin 38 37 bop 120 573 a Fh(6)135 b(CFITSIO)44 b(Error)h(Status)g(Co)t(des)120 776 y Ff(The)34 b(follo)m(wing)h(table) g(lists)g(all)g(the)f(error)g(status)g(co)s(des)h(used)e(b)m(y)h (CFITSIO.)f(Programmers)h(are)g(en-)120 889 y(couraged)f(to)g(use)g (the)f(sym)m(b)s(olic)h(mnemonics)g(\(de\014ned)e(in)h(the)h(\014le)g (\014tsio.h\))g(rather)f(than)g(the)h(actual)120 1002 y(in)m(teger)f(status)e(v)-5 b(alues)31 b(to)g(impro)m(v)m(e)g(the)g (readabilit)m(y)h(of)e(their)h(co)s(de.)168 1214 y Fc(Symbolic)45 b(Const)190 b(Value)237 b(Meaning)168 1327 y(--------------)187 b(-----)94 b(------------------------)o(----)o(---)o(----)o(----)o(--) 1122 1440 y(0)191 b(OK,)47 b(no)g(error)168 1553 y(SAME_FILE)427 b(101)190 b(input)46 b(and)h(output)f(files)h(are)g(the)f(same)168 1666 y(TOO_MANY_FILES)187 b(103)j(tried)46 b(to)h(open)g(too)g(many)g (FITS)f(files)h(at)g(once)168 1779 y(FILE_NOT_OPENED)139 b(104)190 b(could)46 b(not)h(open)g(the)g(named)f(file)168 1892 y(FILE_NOT_CREATED)91 b(105)190 b(could)46 b(not)h(create)f(the)h (named)g(file)168 2005 y(WRITE_ERROR)331 b(106)190 b(error)46 b(writing)g(to)h(FITS)g(file)168 2117 y(END_OF_FILE)331 b(107)190 b(tried)46 b(to)h(move)g(past)g(end)g(of)g(file)168 2230 y(READ_ERROR)379 b(108)190 b(error)46 b(reading)g(from)h(FITS)f (file)168 2343 y(FILE_NOT_CLOSED)139 b(110)190 b(could)46 b(not)h(close)g(the)f(file)168 2456 y(ARRAY_TOO_BIG)235 b(111)190 b(array)46 b(dimensions)f(exceed)h(internal)g(limit)168 2569 y(READONLY_FILE)235 b(112)190 b(Cannot)46 b(write)g(to)i(readonly) d(file)168 2682 y(MEMORY_ALLOCATION)e(113)190 b(Could)46 b(not)h(allocate)f(memory)168 2795 y(BAD_FILEPTR)331 b(114)190 b(invalid)46 b(fitsfile)f(pointer)168 2908 y(NULL_INPUT_PTR)187 b(115)j(NULL)47 b(input)f(pointer)g(to)h(routine) 168 3021 y(SEEK_ERROR)379 b(116)190 b(error)46 b(seeking)g(position)g (in)h(file)168 3247 y(BAD_URL_PREFIX)235 b(121)142 b(invalid)46 b(URL)h(prefix)f(on)h(file)g(name)168 3359 y(TOO_MANY_DRIVERS)139 b(122)j(tried)46 b(to)h(register)f(too)h(many)g(IO)g(drivers)168 3472 y(DRIVER_INIT_FAILED)c(123)142 b(driver)46 b(initialization)e (failed)168 3585 y(NO_MATCHING_DRIVER)f(124)142 b(matching)45 b(driver)i(is)g(not)g(registered)168 3698 y(URL_PARSE_ERROR)187 b(125)142 b(failed)46 b(to)h(parse)g(input)f(file)h(URL)168 3924 y(SHARED_BADARG)235 b(151)190 b(bad)47 b(argument)e(in)j(shared)e (memory)g(driver)168 4037 y(SHARED_NULPTR)235 b(152)190 b(null)47 b(pointer)e(passed)h(as)i(an)f(argument)168 4150 y(SHARED_TABFULL)187 b(153)j(no)47 b(more)g(free)f(shared)g (memory)h(handles)168 4263 y(SHARED_NOTINIT)187 b(154)j(shared)46 b(memory)g(driver)g(is)h(not)g(initialized)168 4376 y(SHARED_IPCERR)235 b(155)190 b(IPC)47 b(error)f(returned)g(by)h(a)g(system)f(call)168 4489 y(SHARED_NOMEM)283 b(156)190 b(no)47 b(memory)f(in)h(shared)f (memory)h(driver)168 4601 y(SHARED_AGAIN)283 b(157)190 b(resource)45 b(deadlock)h(would)g(occur)168 4714 y(SHARED_NOFILE)235 b(158)190 b(attempt)46 b(to)h(open/create)e(lock)h(file)h(failed)168 4827 y(SHARED_NORESIZE)139 b(159)190 b(shared)46 b(memory)g(block)g (cannot)h(be)g(resized)f(at)h(the)g(moment)168 5053 y(HEADER_NOT_EMPTY) 91 b(201)190 b(header)46 b(already)g(contains)f(keywords)168 5166 y(KEY_NO_EXIST)283 b(202)190 b(keyword)46 b(not)h(found)f(in)h (header)168 5279 y(KEY_OUT_BOUNDS)187 b(203)j(keyword)46 b(record)g(number)g(is)h(out)g(of)g(bounds)168 5392 y(VALUE_UNDEFINED) 139 b(204)190 b(keyword)46 b(value)g(field)g(is)i(blank)168 5505 y(NO_QUOTE)475 b(205)190 b(string)46 b(is)h(missing)f(the)h (closing)f(quote)1905 5809 y Ff(38)p eop end %%Page: 39 39 TeXDict begin 39 38 bop 168 573 a Fc(BAD_KEYCHAR)331 b(207)190 b(illegal)46 b(character)f(in)i(keyword)f(name)h(or)g(card) 168 686 y(BAD_ORDER)427 b(208)190 b(required)45 b(keywords)h(out)h(of)g (order)168 799 y(NOT_POS_INT)331 b(209)190 b(keyword)46 b(value)g(is)h(not)g(a)h(positive)d(integer)168 912 y(NO_END)571 b(210)190 b(couldn't)45 b(find)i(END)g(keyword)168 1024 y(BAD_BITPIX)379 b(211)190 b(illegal)46 b(BITPIX)g(keyword)g(value)168 1137 y(BAD_NAXIS)427 b(212)190 b(illegal)46 b(NAXIS)g(keyword)g(value) 168 1250 y(BAD_NAXES)427 b(213)190 b(illegal)46 b(NAXISn)g(keyword)g (value)168 1363 y(BAD_PCOUNT)379 b(214)190 b(illegal)46 b(PCOUNT)g(keyword)g(value)168 1476 y(BAD_GCOUNT)379 b(215)190 b(illegal)46 b(GCOUNT)g(keyword)g(value)168 1589 y(BAD_TFIELDS)331 b(216)190 b(illegal)46 b(TFIELDS)g(keyword)f (value)168 1702 y(NEG_WIDTH)427 b(217)190 b(negative)45 b(table)i(row)g(size)168 1815 y(NEG_ROWS)475 b(218)190 b(negative)45 b(number)i(of)g(rows)f(in)i(table)168 1928 y(COL_NOT_FOUND)235 b(219)190 b(column)46 b(with)h(this)f(name)h(not)g (found)f(in)h(table)168 2041 y(BAD_SIMPLE)379 b(220)190 b(illegal)46 b(value)g(of)h(SIMPLE)f(keyword)168 2154 y(NO_SIMPLE)427 b(221)190 b(Primary)46 b(array)g(doesn't)g(start)g (with)h(SIMPLE)168 2267 y(NO_BITPIX)427 b(222)190 b(Second)46 b(keyword)g(not)h(BITPIX)168 2379 y(NO_NAXIS)475 b(223)190 b(Third)46 b(keyword)g(not)h(NAXIS)168 2492 y(NO_NAXES)475 b(224)190 b(Couldn't)45 b(find)i(all)g(the)g(NAXISn)f(keywords)168 2605 y(NO_XTENSION)331 b(225)190 b(HDU)47 b(doesn't)f(start)g(with)h (XTENSION)e(keyword)168 2718 y(NOT_ATABLE)379 b(226)190 b(the)47 b(CHDU)f(is)i(not)f(an)g(ASCII)f(table)g(extension)168 2831 y(NOT_BTABLE)379 b(227)190 b(the)47 b(CHDU)f(is)i(not)f(a)g (binary)f(table)g(extension)168 2944 y(NO_PCOUNT)427 b(228)190 b(couldn't)45 b(find)i(PCOUNT)f(keyword)168 3057 y(NO_GCOUNT)427 b(229)190 b(couldn't)45 b(find)i(GCOUNT)f(keyword) 168 3170 y(NO_TFIELDS)379 b(230)190 b(couldn't)45 b(find)i(TFIELDS)f (keyword)168 3283 y(NO_TBCOL)475 b(231)190 b(couldn't)45 b(find)i(TBCOLn)f(keyword)168 3396 y(NO_TFORM)475 b(232)190 b(couldn't)45 b(find)i(TFORMn)f(keyword)168 3509 y(NOT_IMAGE)427 b(233)190 b(the)47 b(CHDU)f(is)i(not)f(an)g(IMAGE)f(extension)168 3621 y(BAD_TBCOL)427 b(234)190 b(TBCOLn)46 b(keyword)g(value)g(<)i(0)f (or)g(>)h(rowlength)168 3734 y(NOT_TABLE)427 b(235)190 b(the)47 b(CHDU)f(is)i(not)f(a)g(table)168 3847 y(COL_TOO_WIDE)283 b(236)190 b(column)46 b(is)h(too)g(wide)g(to)g(fit)g(in)g(table)168 3960 y(COL_NOT_UNIQUE)187 b(237)j(more)47 b(than)f(1)i(column)e(name)g (matches)g(template)168 4073 y(BAD_ROW_WIDTH)235 b(241)190 b(sum)47 b(of)g(column)f(widths)g(not)h(=)h(NAXIS1)168 4186 y(UNKNOWN_EXT)331 b(251)190 b(unrecognizable)44 b(FITS)i(extension)g(type)168 4299 y(UNKNOWN_REC)331 b(252)190 b(unknown)46 b(record;)g(1st)g(keyword)g(not)h(SIMPLE)f(or)h (XTENSION)168 4412 y(END_JUNK)475 b(253)190 b(END)47 b(keyword)f(is)h(not)g(blank)168 4525 y(BAD_HEADER_FILL)139 b(254)190 b(Header)46 b(fill)h(area)f(contains)g(non-blank)f(chars)168 4638 y(BAD_DATA_FILL)235 b(255)190 b(Illegal)46 b(data)g(fill)h(bytes)f (\(not)h(zero)g(or)g(blank\))168 4751 y(BAD_TFORM)427 b(261)190 b(illegal)46 b(TFORM)g(format)g(code)168 4863 y(BAD_TFORM_DTYPE)139 b(262)190 b(unrecognizable)44 b(TFORM)i(datatype) g(code)168 4976 y(BAD_TDIM)475 b(263)190 b(illegal)46 b(TDIMn)g(keyword)g(value)168 5089 y(BAD_HEAP_PTR)283 b(264)190 b(invalid)46 b(BINTABLE)f(heap)i(pointer)f(is)h(out)g(of)g (range)168 5315 y(BAD_HDU_NUM)331 b(301)190 b(HDU)47 b(number)f(<)h(1)h(or)f(>)g(MAXHDU)168 5428 y(BAD_COL_NUM)331 b(302)190 b(column)46 b(number)g(<)i(1)f(or)g(>)h(tfields)168 5541 y(NEG_FILE_POS)283 b(304)190 b(tried)46 b(to)h(move)g(to)g (negative)f(byte)g(location)g(in)h(file)1905 5809 y Ff(39)p eop end %%Page: 40 40 TeXDict begin 40 39 bop 168 573 a Fc(NEG_BYTES)427 b(306)190 b(tried)46 b(to)h(read)g(or)g(write)g(negative)e(number)h(of)h(bytes) 168 686 y(BAD_ROW_NUM)331 b(307)190 b(illegal)46 b(starting)f(row)i (number)f(in)h(table)168 799 y(BAD_ELEM_NUM)283 b(308)190 b(illegal)46 b(starting)f(element)h(number)g(in)h(vector)168 912 y(NOT_ASCII_COL)235 b(309)190 b(this)47 b(is)g(not)g(an)g(ASCII)f (string)g(column)168 1024 y(NOT_LOGICAL_COL)139 b(310)190 b(this)47 b(is)g(not)g(a)g(logical)f(datatype)f(column)168 1137 y(BAD_ATABLE_FORMAT)e(311)190 b(ASCII)46 b(table)h(column)f(has)h (wrong)f(format)168 1250 y(BAD_BTABLE_FORMAT)d(312)190 b(Binary)46 b(table)g(column)g(has)h(wrong)g(format)168 1363 y(NO_NULL)523 b(314)190 b(null)47 b(value)f(has)h(not)g(been)f (defined)168 1476 y(NOT_VARI_LEN)283 b(317)190 b(this)47 b(is)g(not)g(a)g(variable)f(length)g(column)168 1589 y(BAD_DIMEN)427 b(320)190 b(illegal)46 b(number)g(of)h(dimensions)e(in) i(array)168 1702 y(BAD_PIX_NUM)331 b(321)190 b(first)46 b(pixel)h(number)f(greater)g(than)g(last)h(pixel)168 1815 y(ZERO_SCALE)379 b(322)190 b(illegal)46 b(BSCALE)g(or)h(TSCALn)f (keyword)g(=)h(0)168 1928 y(NEG_AXIS)475 b(323)190 b(illegal)46 b(axis)g(length)g(<)i(1)168 2154 y(NOT_GROUP_TABLE)330 b(340)142 b(Grouping)46 b(function)f(error)168 2267 y (HDU_ALREADY_MEMBER)186 b(341)168 2379 y(MEMBER_NOT_FOUND)282 b(342)168 2492 y(GROUP_NOT_FOUND)330 b(343)168 2605 y(BAD_GROUP_ID)474 b(344)168 2718 y(TOO_MANY_HDUS_TRACKED)42 b(345)168 2831 y(HDU_ALREADY_TRACKED)138 b(346)168 2944 y(BAD_OPTION)570 b(347)168 3057 y(IDENTICAL_POINTERS)186 b(348)168 3170 y(BAD_GROUP_ATTACH)282 b(349)168 3283 y(BAD_GROUP_DETACH)g(350)168 3509 y(NGP_NO_MEMORY)426 b(360)238 b(malloc)46 b(failed)168 3621 y(NGP_READ_ERR)474 b(361)238 b(read)46 b(error)h(from)f(file)168 3734 y(NGP_NUL_PTR)522 b(362)238 b(null)46 b(pointer)g(passed)g(as)h (an)g(argument.)1695 3847 y(Passing)f(null)g(pointer)g(as)h(a)h(name)f (of)1695 3960 y(template)f(file)g(raises)g(this)h(error)168 4073 y(NGP_EMPTY_CURLINE)234 b(363)k(line)46 b(read)h(seems)f(to)h(be)h (empty)e(\(used)1695 4186 y(internally\))168 4299 y (NGP_UNREAD_QUEUE_FULL)c(364)238 b(cannot)46 b(unread)g(more)g(then)h (1)g(line)g(\(or)g(single)1695 4412 y(line)g(twice\))168 4525 y(NGP_INC_NESTING)330 b(365)238 b(too)46 b(deep)h(include)f(file)h (nesting)e(\(infinite)1695 4638 y(loop,)h(template)g(includes)f(itself) i(?\))168 4751 y(NGP_ERR_FOPEN)426 b(366)238 b(fopen\(\))45 b(failed,)h(cannot)g(open)h(template)e(file)168 4863 y(NGP_EOF)714 b(367)238 b(end)46 b(of)i(file)e(encountered)f(and)i(not) g(expected)168 4976 y(NGP_BAD_ARG)522 b(368)238 b(bad)46 b(arguments)g(passed.)g(Usually)f(means)1695 5089 y(internal)h(parser)g (error.)g(Should)g(not)h(happen)168 5202 y(NGP_TOKEN_NOT_EXPECT)90 b(369)238 b(token)46 b(not)h(expected)e(here)168 5428 y(BAD_I2C)523 b(401)190 b(bad)47 b(int)g(to)g(formatted)e(string)h (conversion)168 5541 y(BAD_F2C)523 b(402)190 b(bad)47 b(float)f(to)h(formatted)f(string)g(conversion)1905 5809 y Ff(40)p eop end %%Page: 41 41 TeXDict begin 41 40 bop 168 573 a Fc(BAD_INTKEY)379 b(403)190 b(can't)46 b(interpret)g(keyword)f(value)i(as)g(integer)168 686 y(BAD_LOGICALKEY)187 b(404)j(can't)46 b(interpret)g(keyword)f (value)i(as)g(logical)168 799 y(BAD_FLOATKEY)283 b(405)190 b(can't)46 b(interpret)g(keyword)f(value)i(as)g(float)168 912 y(BAD_DOUBLEKEY)235 b(406)190 b(can't)46 b(interpret)g(keyword)f (value)i(as)g(double)168 1024 y(BAD_C2I)523 b(407)190 b(bad)47 b(formatted)e(string)h(to)h(int)g(conversion)168 1137 y(BAD_C2F)523 b(408)190 b(bad)47 b(formatted)e(string)h(to)h (float)g(conversion)168 1250 y(BAD_C2D)523 b(409)190 b(bad)47 b(formatted)e(string)h(to)h(double)f(conversion)168 1363 y(BAD_DATATYPE)283 b(410)190 b(illegal)46 b(datatype)f(code)i (value)168 1476 y(BAD_DECIM)427 b(411)190 b(bad)47 b(number)f(of)h (decimal)f(places)g(specified)168 1589 y(NUM_OVERFLOW)283 b(412)190 b(overflow)45 b(during)i(datatype)e(conversion)168 1702 y(DATA_COMPRESSION_ERR)137 b(413)95 b(error)46 b(compressing)f (image)168 1815 y(DATA_DECOMPRESSION_ERR)c(414)95 b(error)46 b(uncompressing)f(image)168 2041 y(BAD_DATE)475 b(420)190 b(error)46 b(in)h(date)g(or)g(time)g(conversion)168 2267 y(PARSE_SYNTAX_ERR)91 b(431)190 b(syntax)46 b(error)g(in)i(parser)e (expression)168 2379 y(PARSE_BAD_TYPE)187 b(432)j(expression)45 b(did)i(not)g(evaluate)e(to)i(desired)f(type)168 2492 y(PARSE_LRG_VECTOR)91 b(433)190 b(vector)46 b(result)g(too)h(large)f (to)i(return)e(in)h(array)168 2605 y(PARSE_NO_OUTPUT)139 b(434)190 b(data)47 b(parser)f(failed)g(not)h(sent)f(an)h(out)g(column) 168 2718 y(PARSE_BAD_COL)235 b(435)190 b(bad)47 b(data)f(encounter)g (while)g(parsing)g(column)168 2831 y(PARSE_BAD_OUTPUT)91 b(436)190 b(Output)46 b(file)h(not)g(of)g(proper)f(type)168 3057 y(ANGLE_TOO_BIG)235 b(501)190 b(celestial)45 b(angle)i(too)f (large)h(for)g(projection)168 3170 y(BAD_WCS_VAL)331 b(502)190 b(bad)47 b(celestial)e(coordinate)g(or)i(pixel)g(value)168 3283 y(WCS_ERROR)427 b(503)190 b(error)46 b(in)h(celestial)f (coordinate)f(calculation)168 3396 y(BAD_WCS_PROJ)283 b(504)190 b(unsupported)45 b(type)h(of)h(celestial)f(projection)168 3509 y(NO_WCS_KEY)379 b(505)190 b(celestial)45 b(coordinate)g(keywords) h(not)h(found)168 3621 y(APPROX_WCS_KEY)187 b(506)j(approximate)45 b(wcs)i(keyword)e(values)h(were)h(returned)1905 5809 y Ff(41)p eop end %%Trailer userdict /end-hook known{end-hook}if %%EOF cfitsio-3.47/docs/quick.tex0000644000225700000360000030611013464573431015176 0ustar cagordonlhea\documentclass[11pt]{article} \input{html.sty} \htmladdtonavigation {\begin{rawhtml} FITSIO Home \end{rawhtml}} \oddsidemargin=0.20in \evensidemargin=0.20in \textwidth=15.5truecm \textheight=21.5truecm \title{CFITSIO Quick Start Guide} \author{William Pence \thanks{HEASARC, NASA Goddard Space Flight Center}} \date{January 2003} \begin{document} \maketitle \tableofcontents % =================================================================== \section{Introduction} This document is intended to help you quickly start writing C programs to read and write FITS files using the CFITSIO library. It covers the most important CFITSIO routines that are needed to perform most types of operations on FITS files. For more complete information about these and all the other available routines in the library please refer to the ``CFITSIO User's Reference Guide'', which is available from the CFITSIO Web site at {\tt http://heasarc.gsfc.nasa.gov/fitsio}. For more general information about the FITS data format, refer to the following web page: http://heasarc.gsfc.nasa.gov/docs/heasarc/fits.html FITS stands for Flexible Image Transport System and is the standard file format used to store most astronomical data files. There are 2 basic types of FITS files: images and tables. FITS images often contain a 2-dimensional array of pixels representing an image of a piece of the sky, but FITS images can also contain 1-D arrays (i.e, a spectrum or light curve), or 3-D arrays (a data cube), or even higher dimensional arrays of data. An image may also have zero dimensions, in which case it is referred to as a null or empty array. The supported datatypes for the image arrays are 8, 16, and 32-bit integers, and 32 and 64-bit floating point real numbers. Both signed and unsigned integers are supported. FITS tables contain rows and columns of data, similar to a spreadsheet. All the values in a particular column must have the same datatype. A cell of a column is not restricted to a single number, and instead can contain an array or vector of numbers. There are actually 2 subtypes of FITS tables: ASCII and binary. As the names imply, ASCII tables store the data values in an ASCII representation whereas binary tables store the data values in a more efficient machine-readable binary format. Binary tables are generally more compact and support more features (e.g., a wider range of datatypes, and vector columns) than ASCII tables. A single FITS file many contain multiple images or tables. Each table or image is called a Header-Data Unit, or HDU. The first HDU in a FITS file must be an image (but it may have zero axes) and is called the Primary Array. Any additional HDUs in the file (which are also referred to as `extensions') may contain either an image or a table. Every HDU contains a header containing keyword records. Each keyword record is 80 ASCII characters long and has the following format: \begin{verbatim} KEYWORD = value / comment string \end{verbatim} The keyword name can be up to 8 characters long (all uppercase). The value can be either an integer or floating point number, a logical value (T or F), or a character string enclosed in single quotes. Each header begins with a series of required keywords to describe the datatype and format of the following data unit, if any. Any number of other optional keywords can be included in the header to provide other descriptive information about the data. For the most part, the CFITSIO routines automatically write the required FITS keywords for each HDU, so you, the programmer, usually do not need to worry about them. % =================================================================== \section{Installing and Using CFITSIO} First, you should download the CFITSIO software and the set of example FITS utility programs from the web site at http://heasarc.gsfc.nasa.gov/fitsio. The example programs illustrate how to perform many common types of operations on FITS files using CFITSIO. They are also useful when writing a new program because it is often easier to take a copy of one of these utility programs as a template and then modify it for your own purposes, rather than writing the new program completely from scratch. To build the CFITSIO library on Unix platforms, `untar' the source code distribution file and then execute the following commands in the directory containing the source code: \begin{verbatim} > ./configure [--prefix=/target/installation/path] > make (or 'make shared') > make install (this step is optional) \end{verbatim} The optional 'prefix' argument to configure gives the path to the directory where the CFITSIO library and include files should be installed via the later 'make install' command. For example, \begin{verbatim} > ./configure --prefix=/usr1/local \end{verbatim} will cause the 'make install' command to copy the CFITSIO libcfitsio file to /usr1/local/lib and the necessary include files to /usr1/local/include (assuming of course that the process has permission to write to these directories). Pre-compiled versions of the CFITSIO DLL library are available for PCs. On Macintosh machines, refer to the README.MacOS file for instructions on building CFITSIO using CodeWarrior. Any programs that use CFITSIO must of course be linked with the CFITSIO library when creating the executable file. The exact procedure for linking a program depends on your software environment, but on Unix platforms, the command line to compile and link a program will look something like this: \begin{verbatim} gcc -o myprog myprog.c -L. -lcfitsio -lm -lnsl -lsocket \end{verbatim} You may not need to include all of the 'm', 'nsl', and 'socket' system libraries on your particular machine. To find out what libraries are required on your (Unix) system, type {\tt'make testprog'} and see what libraries are then included on the resulting link line. \newpage % =================================================================== \section{Example Programs} Before describing the individual CFITSIO routines in detail, it is instructive to first look at an actual program. The names of the CFITSIO routines are fairly descriptive (they all begin with {\tt fits\_}, so it should be reasonably clear what this program does: \begin{verbatim} ---------------------------------------------------------------- #include #include 1: #include "fitsio.h" int main(int argc, char *argv[]) { 2: fitsfile *fptr; char card[FLEN_CARD]; 3: int status = 0, nkeys, ii; /* MUST initialize status */ 4: fits_open_file(&fptr, argv[1], READONLY, &status); fits_get_hdrspace(fptr, &nkeys, NULL, &status); for (ii = 1; ii <= nkeys; ii++) { fits_read_record(fptr, ii, card, &status); /* read keyword */ printf("%s\n", card); } printf("END\n\n"); /* terminate listing with END */ fits_close_file(fptr, &status); if (status) /* print any error messages */ 5: fits_report_error(stderr, status); return(status); } ---------------------------------------------------------------- \end{verbatim} This program opens the specified FITS file and prints out all the header keywords in the current HDU. Some other points to notice about the program are: \begin{enumerate} \item The {\tt fitsio.h} header file must be included to define the various routines and symbols used in CFITSIO. \item The {\tt fitsfile} parameter is the first argument in almost every CFITSIO routine. It is a pointer to a structure (defined in {\tt fitsio.h}) that stores information about the particular FITS file that the routine will operate on. Memory for this structure is automatically allocated when the file is first opened or created, and is freed when the file is closed. \item Almost every CFITSIO routine has a {\tt status} parameter as the last argument. The status value is also usually returned as the value of the function itself. Normally status = 0, and a positive status value indicates an error of some sort. The status variable must always be initialized to zero before use, because if status is greater than zero on input then the CFITSIO routines will simply return without doing anything. This `inherited status' feature, where each CFITSIO routine inherits the status from the previous routine, makes it unnecessary to check the status value after every single CFITSIO routine call. Generally you should check the status after an especially important or complicated routine has been called, or after a block of closely related CFITSIO calls. This example program has taken this feature to the extreme and only checks the status value at the very end of the program. \item In this example program the file name to be opened is given as an argument on the command line ({\tt arg[1]}). If the file contains more than 1 HDU or extension, you can specify which particular HDU to be opened by enclosing the name or number of the HDU in square brackets following the root name of the file. For example, {\tt file.fts[0]} opens the primary array, while {\tt file.fts[2]} will move to and open the 2nd extension in the file, and {\tt file.fit[EVENTS]} will open the extension that has a {\tt EXTNAME = 'EVENTS'} keyword in the header. Note that on the Unix command line you must enclose the file name in single or double quote characters if the name contains special characters such as `[' or `]'. All of the CFITSIO routines which read or write header keywords, image data, or table data operate only within the currently opened HDU in the file. To read or write information in a different HDU you must first explicitly move to that HDU (see the {\tt fits\_movabs\_hdu} and {\tt fits\_movrel\_hdu} routines in section 4.3). \item The {\tt fits\_report\_error} routine provides a convenient way to print out diagnostic messages about any error that may have occurred. \end{enumerate} A set of example FITS utility programs are available from the CFITSIO web site at \newline http://heasarc.gsfc.nasa.gov/docs/software/fitsio/cexamples.html. These are real working programs which illustrate how to read, write, and modify FITS files using the CFITSIO library. Most of these programs are very short, containing only a few 10s of lines of executable code or less, yet they perform quite useful operations on FITS files. Running each program without any command line arguments will produce a short description of how to use the program. The currently available programs are: \begin{quote} fitscopy - copy a file \newline listhead - list header keywords \newline liststruc - show the structure of a FITS file. \newline modhead - write or modify a header keyword \newline imarith - add, subtract, multiply, or divide 2 images \newline imlist - list pixel values in an image \newline imstat - compute mean, min, and max pixel values in an image \newline tablist - display the contents of a FITS table \newline tabcalc - general table calculator \end{quote} \newpage % =================================================================== \section{CFITSIO Routines} This chapter describes the main CFITSIO routines that can be used to perform the most common types of operations on FITS files. % =================================================================== {\bf \subsection{Error Reporting}} \begin{verbatim} void fits_report_error(FILE *stream, int status) void fits_get_errstatus(int status, char *err_text) float fits_get_version(float *version) \end{verbatim} The first routine prints out information about any error that has occurred. Whenever any CFITSIO routine encounters an error it usually writes a message describing the nature of the error to an internal error message stack and then returns with a positive integer status value. Passing the error status value to this routine will cause a generic description of the error and all the messages from the internal CFITSIO error stack to be printed to the specified stream. The {\tt stream} parameter is usually set equal to {\tt "stdout"} or {\tt "stderr"}. The second routine simply returns a 30-character descriptive error message corresponding to the input status value. The last routine returns the current CFITSIO library version number. % =================================================================== {\bf \subsection{File Open/Close Routines}} \begin{verbatim} int fits_open_file( fitsfile **fptr, char *filename, int mode, int *status) int fits_open_data( fitsfile **fptr, char *filename, int mode, int *status) int fits_open_table(fitsfile **fptr, char *filename, int mode, int *status) int fits_open_image(fitsfile **fptr, char *filename, int mode, int *status) int fits_create_file(fitsfile **fptr, char *filename, int *status) int fits_close_file(fitsfile *fptr, int *status) \end{verbatim} These routines open or close a file. The first {\tt fitsfile} parameter in these and nearly every other CFITSIO routine is a pointer to a structure that CFITSIO uses to store relevant parameters about each opened file. You should never directly read or write any information in this structure. Memory for this structure is allocated automatically when the file is opened or created, and is freed when the file is closed. The {\tt mode} parameter in the {\tt fits\_open\_xxxx} set of routines can be set to either {\tt READONLY} or {\tt READWRITE} to select the type of file access that will be allowed. These symbolic constants are defined in {\tt fitsio.h}. The {\tt fits\_open\_file} routine opens the file and positions the internal file pointer to the beginning of the file, or to the specified extension if an extension name or number is appended to the file name (see the later section on ``CFITSIO File Names and Filters'' for a description of the syntax). {\tt fits\_open\_data} behaves similarly except that it will move to the first HDU containing significant data if a HDU name or number to open is not explicitly specified as part of the filename. It will move to the first IMAGE HDU with NAXIS greater than 0, or the first table that does not contain the strings `GTI' (a Good Time Interval extension) or `OBSTABLE' in the EXTNAME keyword value. The {\tt fits\_open\_table} and {\tt fits\_open\_image} routines are similar except that they will move to the first significant table HDU or image HDU, respectively if a HDU name of number is not specified as part of the input file name. When opening an existing file, the {\tt filename} can include optional arguments, enclosed in square brackets that specify filtering operations that should be applied to the input file. For example, \begin{verbatim} myfile.fit[EVENTS][counts > 0] \end{verbatim} opens the table in the EVENTS extension and creates a virtual table by selecting only those rows where the COUNTS column value is greater than 0. See section 5 for more examples of these powerful filtering capabilities. In {\tt fits\_create\_file}, the {\tt filename} is simply the root name of the file to be created. You can overwrite an existing file by prefixing the name with a `!' character (on the Unix command line this must be prefixed with a backslash, as in \verb+`\!file.fit'+). If the file name ends with {\tt .gz} the file will be compressed using the gzip algorithm. If the filename is {\tt stdout} or {\tt "-"} (a single dash character) then the output file will be piped to the stdout stream. You can chain several tasks together by writing the output from the first task to {\tt stdout} and then reading the input file in the 2nd task from {\tt stdin} or {\tt "-"}. % =================================================================== {\bf \subsection{HDU-level Routines}} The routines listed in this section operate on Header-Data Units (HDUs) in a file. \begin{verbatim} _______________________________________________________________ int fits_get_num_hdus(fitsfile *fptr, int *hdunum, int *status) int fits_get_hdu_num(fitsfile *fptr, int *hdunum) \end{verbatim} The first routines returns the total number of HDUs in the FITS file, and the second routine returns the position of the currently opened HDU in the FITS file (starting with 1, not 0). \begin{verbatim} __________________________________________________________________________ int fits_movabs_hdu(fitsfile *fptr, int hdunum, int *hdutype, int *status) int fits_movrel_hdu(fitsfile *fptr, int nmove, int *hdutype, int *status) int fits_movnam_hdu(fitsfile *fptr, int hdutype, char *extname, int extver, int *status) \end{verbatim} These routines enable you to move to a different HDU in the file. Most of the CFITSIO functions which read or write keywords or data operate only on the currently opened HDU in the file. The first routine moves to the specified absolute HDU number in the FITS file (the first HDU = 1), whereas the second routine moves a relative number of HDUs forward or backward from the currently open HDU. The {\tt hdutype} parameter returns the type of the newly opened HDU, and will be equal to one of these symbolic constant values: {\tt IMAGE\_HDU, ASCII\_TBL, or BINARY\_TBL}. {\tt hdutype} may be set to NULL if it is not needed. The third routine moves to the (first) HDU that matches the input extension type, name, and version number, as given by the {\tt XTENSION, EXTNAME} (or {\tt HDUNAME}) and {\tt EXTVER} keywords. If the input value of {\tt extver} = 0, then the version number will be ignored when looking for a matching HDU. \begin{verbatim} _________________________________________________________________ int fits_get_hdu_type(fitsfile *fptr, int *hdutype, int *status) \end{verbatim} Get the type of the current HDU in the FITS file: {\tt IMAGE\_HDU, ASCII\_TBL, or BINARY\_TBL}. \begin{verbatim} ____________________________________________________________________ int fits_copy_hdu(fitsfile *infptr, fitsfile *outfptr, int morekeys, int *status) int fits_copy_file(fitsfile *infptr, fitsfile *outfptr, int previous, int current, int following, > int *status) \end{verbatim} The first routine copies the current HDU from the FITS file associated with infptr and appends it to the end of the FITS file associated with outfptr. Space may be reserved for {\tt morekeys} additional keywords in the output header. The second routine copies any HDUs previous to the current HDU, and/or the current HDU, and/or any HDUs following the current HDU, depending on the value (True or False) of {\tt previous, current}, and {\tt following}, respectively. For example, \begin{verbatim} fits_copy_file(infptr, outfptr, 0, 1, 1, &status); \end{verbatim} will copy the current HDU and any HDUs that follow it from the input to the output file, but it will not copy any HDUs preceding the current HDU. \newpage % =================================================================== \subsection{Image I/O Routines} This section lists the more important CFITSIO routines which operate on FITS images. \begin{verbatim} _______________________________________________________________ int fits_get_img_type(fitsfile *fptr, int *bitpix, int *status) int fits_get_img_dim( fitsfile *fptr, int *naxis, int *status) int fits_get_img_size(fitsfile *fptr, int maxdim, long *naxes, int *status) int fits_get_img_param(fitsfile *fptr, int maxdim, int *bitpix, int *naxis, long *naxes, int *status) \end{verbatim} Get information about the currently opened image HDU. The first routine returns the datatype of the image as (defined by the {\tt BITPIX} keyword), which can have the following symbolic constant values: \begin{verbatim} BYTE_IMG = 8 ( 8-bit byte pixels, 0 - 255) SHORT_IMG = 16 (16 bit integer pixels) LONG_IMG = 32 (32-bit integer pixels) LONGLONG_IMG = 64 (64-bit integer pixels) FLOAT_IMG = -32 (32-bit floating point pixels) DOUBLE_IMG = -64 (64-bit floating point pixels) \end{verbatim} The second and third routines return the number of dimensions in the image (from the {\tt NAXIS} keyword), and the sizes of each dimension (from the {\tt NAXIS1, NAXIS2}, etc. keywords). The last routine simply combines the function of the first 3 routines. The input {\tt maxdim} parameter in this routine gives the maximum number dimensions that may be returned (i.e., the dimension of the {\tt naxes} array) \begin{verbatim} __________________________________________________________ int fits_create_img(fitsfile *fptr, int bitpix, int naxis, long *naxes, int *status) \end{verbatim} Create an image HDU by writing the required keywords which define the structure of the image. The 2nd through 4th parameters specified the datatype, the number of dimensions, and the sizes of the dimensions. The allowed values of the {\tt bitpix} parameter are listed above in the description of the {\tt fits\_get\_img\_type} routine. If the FITS file pointed to by {\tt fptr} is empty (previously created with {\tt fits\_create\_file}) then this routine creates a primary array in the file, otherwise a new IMAGE extension is appended to end of the file following the other HDUs in the file. \begin{verbatim} ______________________________________________________________ int fits_write_pix(fitsfile *fptr, int datatype, long *fpixel, long nelements, void *array, int *status); int fits_write_pixnull(fitsfile *fptr, int datatype, long *fpixel, long nelements, void *array, void *nulval, int *status); int fits_read_pix(fitsfile *fptr, int datatype, long *fpixel, long nelements, void *nulval, void *array, int *anynul, int *status) \end{verbatim} Read or write all or part of the FITS image. There are 2 different 'write' pixel routines: The first simply writes the input array of pixels to the FITS file. The second is similar, except that it substitutes the appropriate null pixel value in the FITS file for any pixels which have a value equal to {\tt *nulval} (note that this parameter gives the address of the null pixel value, not the value itself). Similarly, when reading an image, CFITSIO will substitute the value given by {\tt nulval} for any undefined pixels in the image, unless {\tt nulval = NULL}, in which case no checks will be made for undefined pixels when reading the FITS image. The {\tt fpixel} parameter in these routines is an array which gives the coordinate in each dimension of the first pixel to be read or written, and {\tt nelements} is the total number of pixels to read or write. {\tt array} is the address of an array which either contains the pixel values to be written, or will hold the values of the pixels that are read. When reading, {\tt array} must have been allocated large enough to hold all the returned pixel values. These routines starts at the {\tt fpixel} location and then read or write the {\tt nelements} pixels, continuing on successive rows of the image if necessary. For example, to write an entire 2D image, set {\tt fpixel[0] = fpixel[1] = 1}, and {\tt nelements = NAXIS1 * NAXIS2}. Or to read just the 10th row of the image, set {\tt fpixel[0] = 1, fpixel[1] = 10}, and {\tt nelements = NAXIS1}. The {\tt datatype} parameter specifies the datatype of the C {\tt array} in the program, which need not be the same as the datatype of the FITS image itself. If the datatypes differ then CFITSIO will convert the data as it is read or written. The following symbolic constants are allowed for the value of {\tt datatype}: \begin{verbatim} TBYTE unsigned char TSBYTE signed char TSHORT signed short TUSHORT unsigned short TINT signed int TUINT unsigned int TLONG signed long TLONGLONG signed 8-byte integer TULONG unsigned long TFLOAT float TDOUBLE double \end{verbatim} \begin{verbatim} _________________________________________________________________ int fits_write_subset(fitsfile *fptr, int datatype, long *fpixel, long *lpixel, DTYPE *array, > int *status) int fits_read_subset(fitsfile *fptr, int datatype, long *fpixel, long *lpixel, long *inc, void *nulval, void *array, int *anynul, int *status) \end{verbatim} Read or write a rectangular section of the FITS image. These are very similar to {\tt fits\_write\_pix} and {\tt fits\_read\_pix} except that you specify the last pixel coordinate (the upper right corner of the section) instead of the number of pixels to be read. The read routine also has an {\tt inc} parameter which can be used to read only every {\tt inc-th} pixel along each dimension of the image. Normally {\tt inc[0] = inc[1] = 1} to read every pixel in a 2D image. To read every other pixel in the entire 2D image, set \begin{verbatim} fpixel[0] = fpixel[1] = 1 lpixel[0] = {NAXIS1} lpixel[1] = {NAXIS2} inc[0] = inc[1] = 2 \end{verbatim} Or, to read the 8th row of a 2D image, set \begin{verbatim} fpixel[0] = 1 fpixel[1] = 8 lpixel[0] = {NAXIS1} lpixel[1] = 8 inc[0] = inc[1] = 1 \end{verbatim} \newpage % =================================================================== \subsection{Table I/O Routines} This section lists the most important CFITSIO routines which operate on FITS tables. \begin{verbatim} __________________________________________________________________________ int fits_create_tbl(fitsfile *fptr, int tbltype, long nrows, int tfields, char *ttype[],char *tform[], char *tunit[], char *extname, int *status) \end{verbatim} Create a new table extension by writing the required keywords that define the table structure. The required null primary array will be created first if the file is initially completely empty. {\tt tbltype} defines the type of table and can have values of {\tt ASCII\_TBL or BINARY\_TBL}. Binary tables are generally preferred because they are more efficient and support a greater range of column datatypes than ASCII tables. The {\tt nrows} parameter gives the initial number of empty rows to be allocated for the table; this should normally be set to 0. The {\tt tfields} parameter gives the number of columns in the table (maximum = 999). The {\tt ttype, tform}, and {\tt tunit} parameters give the name, datatype, and physical units of each column, and {\tt extname} gives the name for the table (the value of the {\tt EXTNAME} keyword). The FITS Standard recommends that only letters, digits, and the underscore character be used in column names with no embedded spaces. It is recommended that all the column names in a given table be unique within the first 8 characters. The following table shows the TFORM column format values that are allowed in ASCII tables and in binary tables: \begin{verbatim} ASCII Table Column Format Codes ------------------------------- (w = column width, d = no. of decimal places to display) Aw - character string Iw - integer Fw.d - fixed floating point Ew.d - exponential floating point Dw.d - exponential floating point Binary Table Column Format Codes -------------------------------- (r = vector length, default = 1) rA - character string rAw - array of strings, each of length w rL - logical rX - bit rB - unsigned byte rS - signed byte ** rI - signed 16-bit integer rU - unsigned 16-bit integer ** rJ - signed 32-bit integer rV - unsigned 32-bit integer ** rK - signed 64-bit integer rE - 32-bit floating point rD - 64-bit floating point rC - 32-bit complex pair rM - 64-bit complex pair ** The S, U and V format codes are not actual legal TFORMn values. CFITSIO substitutes the somewhat more complicated set of keywords that are used to represent unsigned integers or signed bytes. \end{verbatim} The {\tt tunit} and {\tt extname} parameters are optional and may be set to NULL if they are not needed. Note that it may be easier to create a new table by copying the header from another existing table with {\tt fits\_copy\_header} rather than calling this routine. \begin{verbatim} _______________________________________________________________ int fits_get_num_rows(fitsfile *fptr, long *nrows, int *status) int fits_get_num_cols(fitsfile *fptr, int *ncols, int *status) \end{verbatim} Get the number of rows or columns in the current FITS table. The number of rows is given by the {\tt NAXIS2} keyword and the number of columns is given by the {\tt TFIELDS} keyword in the header of the table. \begin{verbatim} _______________________________________________________________ int fits_get_colnum(fitsfile *fptr, int casesen, char *template, int *colnum, int *status) int fits_get_colname(fitsfile *fptr, int casesen, char *template, char *colname, int *colnum, int *status) \end{verbatim} Get the column number (starting with 1, not 0) of the column whose name matches the specified template name. The only difference in these 2 routines is that the 2nd one also returns the name of the column that matched the template string. Normally, {\tt casesen} should be set to {\tt CASEINSEN}, but it may be set to {\tt CASESEN} to force the name matching to be case-sensitive. The input {\tt template} string gives the name of the desired column and may include wildcard characters: a `*' matches any sequence of characters (including zero characters), `?' matches any single character, and `\#' matches any consecutive string of decimal digits (0-9). If more than one column name in the table matches the template string, then the first match is returned and the status value will be set to {\tt COL\_NOT\_UNIQUE} as a warning that a unique match was not found. To find the next column that matches the template, call this routine again leaving the input status value equal to {\tt COL\_NOT\_UNIQUE}. Repeat this process until {\tt status = COL\_NOT\_FOUND} is returned. \begin{verbatim} _______________________________________________________________ int fits_get_coltype(fitsfile *fptr, int colnum, int *typecode, long *repeat, long *width, int *status) int fits_get_eqcoltype(fitsfile *fptr, int colnum, int *typecode, long *repeat, long *width, int *status) \end{verbatim} Return the datatype, vector repeat count, and the width in bytes of a single column element for column number {\tt colnum}. Allowed values for the returned datatype in ASCII tables are: {\tt TSTRING, TSHORT, TLONG, TFLOAT, and TDOUBLE}. Binary tables support these additional types: {\tt TLOGICAL, TBIT, TBYTE, TINT32BIT, TCOMPLEX and TDBLCOMPLEX}. The negative of the datatype code value is returned if it is a variable length array column. These 2 routines are similar, except that in the case of scaled integer columns the 2nd routine, fit\_get\_eqcoltype, returns the 'equivalent' datatype that is needed to store the scaled values, which is not necessarily the same as the physical datatype of the unscaled values as stored in the FITS table. For example if a '1I' column in a binary table has TSCALn = 1 and TZEROn = 32768, then this column effectively contains unsigned short integer values, and thus the returned value of typecode will be TUSHORT, not TSHORT. Or, if TSCALn or TZEROn are not integers, then the equivalent datatype will be returned as TFLOAT or TDOUBLE, depending on the size of the integer. The repeat count is always 1 in ASCII tables. The 'repeat' parameter returns the vector repeat count on the binary table TFORMn keyword value. (ASCII table columns always have repeat = 1). The 'width' parameter returns the width in bytes of a single column element (e.g., a '10D' binary table column will have width = 8, an ASCII table 'F12.2' column will have width = 12, and a binary table'60A' character string column will have width = 60); Note that this routine supports the local convention for specifying arrays of fixed length strings within a binary table character column using the syntax TFORM = 'rAw' where 'r' is the total number of characters (= the width of the column) and 'w' is the width of a unit string within the column. Thus if the column has TFORM = '60A12' then this means that each row of the table contains 5 12-character substrings within the 60-character field, and thus in this case this routine will return typecode = TSTRING, repeat = 60, and width = 12. The number of substings in any binary table character string field can be calculated by (repeat/width). A null pointer may be given for any of the output parameters that are not needed. \begin{verbatim} ____________________________________________________________________________ int fits_insert_rows(fitsfile *fptr, long firstrow, long nrows, int *status) int fits_delete_rows(fitsfile *fptr, long firstrow, long nrows, int *status) int fits_delete_rowrange(fitsfile *fptr, char *rangelist, int *status) int fits_delete_rowlist(fitsfile *fptr, long *rowlist, long nrows, int *stat) \end{verbatim} Insert or delete rows in a table. The blank rows are inserted immediately following row {\tt frow}. Set {\tt frow} = 0 to insert rows at the beginning of the table. The first 'delete' routine deletes {\tt nrows} rows beginning with row {\tt firstrow}. The 2nd delete routine takes an input string listing the rows or row ranges to be deleted (e.g., '2,4-7, 9-12'). The last delete routine takes an input long integer array that specifies each individual row to be deleted. The row lists must be sorted in ascending order. All these routines update the value of the {\tt NAXIS2} keyword to reflect the new number of rows in the table. \begin{verbatim} _________________________________________________________________________ int fits_insert_col(fitsfile *fptr, int colnum, char *ttype, char *tform, int *status) int fits_insert_cols(fitsfile *fptr, int colnum, int ncols, char **ttype, char **tform, int *status) int fits_delete_col(fitsfile *fptr, int colnum, int *status) \end{verbatim} Insert or delete columns in a table. {\tt colnum} gives the position of the column to be inserted or deleted (where the first column of the table is at position 1). {\tt ttype} and {\tt tform} give the column name and column format, where the allowed format codes are listed above in the description of the {\tt fits\_create\_table} routine. The 2nd 'insert' routine inserts multiple columns, where {\tt ncols} is the number of columns to insert, and {\tt ttype} and {\tt tform} are arrays of string pointers in this case. \begin{verbatim} ____________________________________________________________________ int fits_copy_col(fitsfile *infptr, fitsfile *outfptr, int incolnum, int outcolnum, int create_col, int *status); \end{verbatim} Copy a column from one table HDU to another. If {\tt create\_col} = TRUE (i.e., not equal to zero), then a new column will be inserted in the output table at position {\tt outcolumn}, otherwise the values in the existing output column will be overwritten. \begin{verbatim} __________________________________________________________________________ int fits_write_col(fitsfile *fptr, int datatype, int colnum, long firstrow, long firstelem, long nelements, void *array, int *status) int fits_write_colnull(fitsfile *fptr, int datatype, int colnum, long firstrow, long firstelem, long nelements, void *array, void *nulval, int *status) int fits_write_col_null(fitsfile *fptr, int colnum, long firstrow, long firstelem, long nelements, int *status) int fits_read_col(fitsfile *fptr, int datatype, int colnum, long firstrow, long firstelem, long nelements, void *nulval, void *array, int *anynul, int *status) \end{verbatim} Write or read elements in column number {\tt colnum}, starting with row {\tt firstsrow} and element {\tt firstelem} (if it is a vector column). {\tt firstelem} is ignored if it is a scalar column. The {\tt nelements} number of elements are read or written continuing on successive rows of the table if necessary. {\tt array} is the address of an array which either contains the values to be written, or will hold the returned values that are read. When reading, {\tt array} must have been allocated large enough to hold all the returned values. There are 3 different 'write' column routines: The first simply writes the input array into the column. The second is similar, except that it substitutes the appropriate null pixel value in the column for any input array values which are equal to {\tt *nulval} (note that this parameter gives the address of the null pixel value, not the value itself). The third write routine sets the specified table elements to a null value. New rows will be automatical added to the table if the write operation extends beyond the current size of the table. When reading a column, CFITSIO will substitute the value given by {\tt nulval} for any undefined elements in the FITS column, unless {\tt nulval} or {\tt *nulval = NULL}, in which case no checks will be made for undefined values when reading the column. {\tt datatype} specifies the datatype of the C {\tt array} in the program, which need not be the same as the intrinsic datatype of the column in the FITS table. The following symbolic constants are allowed for the value of {\tt datatype}: \begin{verbatim} TSTRING array of character string pointers TBYTE unsigned char TSHORT signed short TUSHORT unsigned short TINT signed int TUINT unsigned int TLONG signed long TLONGLONG signed 8-byte integer TULONG unsigned long TFLOAT float TDOUBLE double \end{verbatim} Note that {\tt TSTRING} corresponds to the C {\tt char**} datatype, i.e., a pointer to an array of pointers to an array of characters. Any column, regardless of it's intrinsic datatype, may be read as a {\tt TSTRING} character string. The display format of the returned strings will be determined by the {\tt TDISPn} keyword, if it exists, otherwise a default format will be used depending on the datatype of the column. The {\tt tablist} example utility program (available from the CFITSIO web site) uses this feature to display all the values in a FITS table. \begin{verbatim} _____________________________________________________________________ int fits_select_rows(fitsfile *infptr, fitsfile *outfptr, char *expr, int *status) int fits_calculator(fitsfile *infptr, char *expr, fitsfile *outfptr, char *colname, char *tform, int *status) \end{verbatim} These are 2 of the most powerful routines in the CFITSIO library. (See the full CFITSIO Reference Guide for a description of several related routines). These routines can perform complicated transformations on tables based on an input arithmetic expression which is evaluated for each row of the table. The first routine will select or copy rows of the table for which the expression evaluates to TRUE (i.e., not equal to zero). The second routine writes the value of the expression to a column in the output table. Rather than supplying the expression directly to these routines, the expression may also be written to a text file (continued over multiple lines if necessary) and the name of the file, prepended with a '@' character, may be supplied as the value of the 'expr' parameter (e.g. '@filename.txt'). The arithmetic expression may be a function of any column or keyword in the input table as shown in these examples: \begin{verbatim} Row Selection Expressions: counts > 0 uses COUNTS column value sqrt( X**2 + Y**2) < 10. uses X and Y column values (X > 10) || (X < -10) && (Y == 0) used 'or' and 'and' operators gtifilter() filter on Good Time Intervals regfilter("myregion.reg") filter using a region file @select.txt reads expression from a text file Calculator Expressions: #row % 10 modulus of the row number counts/#exposure Fn of COUNTS column and EXPOSURE keyword dec < 85 ? cos(dec * #deg) : 0 Conditional expression: evaluates to cos(dec) if dec < 85, else 0 (count{-1}+count+count{+1})/3. running mean of the count values in the previous, current, and next rows max(0, min(X, 1000)) returns a value between 0 - 1000 @calc.txt reads expression from a text file \end{verbatim} Most standard mathematical operators and functions are supported. If the expression includes the name of a column, than the value in the current row of the table will be used when evaluating the expression on each row. An offset to an adjacent row can be specified by including the offset value in curly brackets after the column name as shown in one of the examples. Keyword values can be included in the expression by preceding the keyword name with a `\#' sign. See Section 5 of this document for more discussion of the expression syntax. {\tt gtifilter} is a special function which tests whether the {\tt TIME} column value in the input table falls within one or more Good Time Intervals. By default, this function looks for a 'GTI' extension in the same file as the input table. The 'GTI' table contains {\tt START} and {\tt STOP} columns which define the range of each good time interval. See section 5.4.3 for more details. {\tt regfilter} is another special function which selects rows based on whether the spatial position associated with each row is located within in a specified region of the sky. By default, the {\tt X} and {\tt Y} columns in the input table are assumed to give the position of each row. The spatial region is defined in an ASCII text file whose name is given as the argument to the {\tt regfilter} function. See section 5.4.4 for more details. The {\tt infptr} and {\tt outfptr} parameters in these routines may point to the same table or to different tables. In {\tt fits\_select\_rows}, if the input and output tables are the same then the rows that do not satisfy the selection expression will be deleted from the table. Otherwise, if the output table is different from the input table then the selected rows will be copied from the input table to the output table. The output column in {\tt fits\_calculator} may or may not already exist. If it exists then the calculated values will be written to that column, overwriting the existing values. If the column doesn't exist then the new column will be appended to the output table. The {\tt tform} parameter can be used to specify the datatype of the new column (e.g., the {\tt TFORM} keyword value as in {\tt '1E', or '1J'}). If {\tt tform} = NULL then a default datatype will be used, depending on the expression. \begin{verbatim} _____________________________________________________________________ int fits_read_tblbytes(fitsfile *fptr, long firstrow, long firstchar, long nchars, unsigned char *array, int *status) int fits_write_tblbytes (fitsfile *fptr, long firstrow, long firstchar, long nchars, unsigned char *array, int *status) \end{verbatim} These 2 routines provide low-level access to tables and are mainly useful as an efficient way to copy rows of a table from one file to another. These routines simply read or write the specified number of consecutive characters (bytes) in a table, without regard for column boundaries. For example, to read or write the first row of a table, set {\tt firstrow = 1, firstchar = 1}, and {\tt nchars = NAXIS1} where the length of a row is given by the value of the {\tt NAXIS1} header keyword. When reading a table, {\tt array} must have been declared at least {\tt nchars} bytes long to hold the returned string of bytes. \newpage % =================================================================== \subsection{Header Keyword I/O Routines} \nopagebreak The following routines read and write header keywords in the current HDU. \nopagebreak \begin{verbatim} ____________________________________________________________________ int fits_get_hdrspace(fitsfile *fptr, int *keysexist, int *morekeys, int *status) \end{verbatim} \nopagebreak Return the number of existing keywords (not counting the mandatory END keyword) and the amount of empty space currently available for more keywords. The {\tt morekeys} parameter may be set to NULL if it's value is not needed. \begin{verbatim} ___________________________________________________________________________ int fits_read_record(fitsfile *fptr, int keynum, char *record, int *status) int fits_read_card(fitsfile *fptr, char *keyname, char *record, int *status) int fits_read_key(fitsfile *fptr, int datatype, char *keyname, void *value, char *comment, int *status) int fits_find_nextkey(fitsfile *fptr, char **inclist, int ninc, char **exclist, int nexc, char *card, int *status) int fits_read_key_unit(fitsfile *fptr, char *keyname, char *unit, int *status) \end{verbatim} These routines all read a header record in the current HDU. The first routine reads keyword number {\tt keynum} (where the first keyword is at position 1). This routine is most commonly used when sequentially reading every record in the header from beginning to end. The 2nd and 3rd routines read the named keyword and return either the whole record, or the keyword value and comment string. In each case any non-significant trailing blank characters in the strings are truncated. Wild card characters (*, ?, and \#) may be used when specifying the name of the keyword to be read, in which case the first matching keyword is returned. The {\tt datatype} parameter specifies the C datatype of the returned keyword value and can have one of the following symbolic constant values: {\tt TSTRING, TLOGICAL} (== int), {\tt TBYTE}, {\tt TSHORT}, {\tt TUSHORT}, {\tt TINT}, {\tt TUINT}, {\tt TLONG}, {\tt TULONG}, {\tt TFLOAT}, {\tt TDOUBLE}, {\tt TCOMPLEX}, and {\tt TDBLCOMPLEX}. Data type conversion will be performed for numeric values if the intrinsic FITS keyword value does not have the same datatype. The {\tt comment} parameter may be set equal to NULL if the comment string is not needed. The 4th routine provides an easy way to find all the keywords in the header that match one of the name templates in {\tt inclist} and do not match any of the name templates in {\tt exclist}. {\tt ninc} and {\tt nexc} are the number of template strings in {\tt inclist} and {\tt exclist}, respectively. Wild cards (*, ?, and \#) may be used in the templates to match multiple keywords. Each time this routine is called it returns the next matching 80-byte keyword record. It returns status = {\tt KEY\_NO\_EXIST} if there are no more matches. The 5th routine returns the keyword value units string, if any. The units are recorded at the beginning of the keyword comment field enclosed in square brackets. \begin{verbatim} _______________________________________________________________ int fits_write_key(fitsfile *fptr, int datatype, char *keyname, void *value, char *comment, int *status) int fits_update_key(fitsfile *fptr, int datatype, char *keyname, void *value, char *comment, int *status) int fits_write_record(fitsfile *fptr, char *card, int *status) int fits_modify_comment(fitsfile *fptr, char *keyname, char *comment, int *status) int fits_write_key_unit(fitsfile *fptr, char *keyname, char *unit, int *status) \end{verbatim} Write or modify a keyword in the header of the current HDU. The first routine appends the new keyword to the end of the header, whereas the second routine will update the value and comment fields of the keyword if it already exists, otherwise it behaves like the first routine and appends the new keyword. Note that {\tt value} gives the address to the value and not the value itself. The {\tt datatype} parameter specifies the C datatype of the keyword value and may have any of the values listed in the description of the keyword reading routines, above. A NULL may be entered for the comment parameter, in which case the keyword comment field will be unmodified or left blank. The third routine is more primitive and simply writes the 80-character {\tt card} record to the header. It is the programmer's responsibility in this case to ensure that the record conforms to all the FITS format requirements for a header record. The fourth routine modifies the comment string in an existing keyword, and the last routine writes or updates the keyword units string for an existing keyword. (The units are recorded at the beginning of the keyword comment field enclosed in square brackets). \begin{verbatim} ___________________________________________________________________ int fits_write_comment(fitsfile *fptr, char *comment, int *status) int fits_write_history(fitsfile *fptr, char *history, int *status) int fits_write_date(fitsfile *fptr, int *status) \end{verbatim} Write a {\tt COMMENT, HISTORY}, or {\tt DATE} keyword to the current header. The {\tt COMMENT} keyword is typically used to write a comment about the file or the data. The {\tt HISTORY} keyword is typically used to provide information about the history of the processing procedures that have been applied to the data. The {\tt comment} or {\tt history} string will be continued over multiple keywords if it is more than 70 characters long. The {\tt DATE} keyword is used to record the date and time that the FITS file was created. Note that this file creation date is usually different from the date of the observation which obtained the data in the FITS file. The {\tt DATE} keyword value is a character string in 'yyyy-mm-ddThh:mm:ss' format. If a {\tt DATE} keyword already exists in the header, then this routine will update the value with the current system date. \begin{verbatim} ___________________________________________________________________ int fits_delete_record(fitsfile *fptr, int keynum, int *status) int fits_delete_key(fitsfile *fptr, char *keyname, int *status) \end{verbatim} Delete a keyword record. The first routine deletes a keyword at a specified position (the first keyword is at position 1, not 0), whereas the second routine deletes the named keyword. \begin{verbatim} _______________________________________________________________________ int fits_copy_header(fitsfile *infptr, fitsfile *outfptr, int *status) \end{verbatim} Copy all the header keywords from the current HDU associated with infptr to the current HDU associated with outfptr. If the current output HDU is not empty, then a new HDU will be appended to the output file. The output HDU will then have the identical structure as the input HDU, but will contain no data. \newpage % =================================================================== \subsection{Utility Routines} This section lists the most important CFITSIO general utility routines. \begin{verbatim} ___________________________________________________________________ int fits_write_chksum( fitsfile *fptr, int *status) int fits_verify_chksum(fitsfile *fptr, int *dataok, int *hduok, int *status) \end{verbatim} These routines compute or validate the checksums for the currenrt HDU. The {\tt DATASUM} keyword is used to store the numerical value of the 32-bit, 1's complement checksum for the data unit alone. The {\tt CHECKSUM} keyword is used to store the ASCII encoded COMPLEMENT of the checksum for the entire HDU. Storing the complement, rather than the actual checksum, forces the checksum for the whole HDU to equal zero. If the file has been modified since the checksums were computed, then the HDU checksum will usually not equal zero. The returned {\tt dataok} and {\tt hduok} parameters will have a value = 1 if the data or HDU is verified correctly, a value = 0 if the {\tt DATASUM} or {\tt CHECKSUM} keyword is not present, or value = -1 if the computed checksum is not correct. \begin{verbatim} ___________________________________________________________________ int fits_parse_value(char *card, char *value, char *comment, int *status) int fits_get_keytype(char *value, char *dtype, int *status) int fits_get_keyclass(char *card) int fits_parse_template(char *template, char *card, int *keytype, int *status) \end{verbatim} {\tt fits\_parse\_value} parses the input 80-chararacter header keyword record, returning the value (as a literal character string) and comment strings. If the keyword has no value (columns 9-10 not equal to '= '), then a null value string is returned and the comment string is set equal to column 9 - 80 of the input string. {\tt fits\_get\_keytype} parses the keyword value string to determine its datatype. {\tt dtype} returns with a value of 'C', 'L', 'I', 'F' or 'X', for character string, logical, integer, floating point, or complex, respectively. {\tt fits\_get\_keyclass} returns a classification code that indicates the classification type of the input keyword record (e.g., a required structural keyword, a TDIM keyword, a WCS keyword, a comment keyword, etc. See the CFITSIO Reference Guide for a list of the different classification codes. {\tt fits\_parse\_template} takes an input free format keyword template string and returns a formatted 80*char record that satisfies all the FITS requirements for a header keyword record. The template should generally contain 3 tokens: the keyword name, the keyword value, and the keyword comment string. The returned {\tt keytype} parameter indicates whether the keyword is a COMMENT keyword or not. See the CFITSIO Reference Guide for more details. \newpage % =================================================================== \section{CFITSIO File Names and Filters} \subsection{Creating New Files} When creating a new output file on magnetic disk with {\tt fits\_create\_file} the following features are supported. \begin{itemize} \item Overwriting, or 'Clobbering' an Existing File If the filename is preceded by an exclamation point (!) then if that file already exists it will be deleted prior to creating the new FITS file. Otherwise if there is an existing file with the same name, CFITSIO will not overwrite the existing file and will return an error status code. Note that the exclamation point is a special UNIX character, so if it is used on the command line rather than entered at a task prompt, it must be preceded by a backslash to force the UNIX shell to pass it verbatim to the application program. \item Compressed Output Files If the output disk file name ends with the suffix '.gz', then CFITSIO will compress the file using the gzip compression algorithm before writing it to disk. This can reduce the amount of disk space used by the file. Note that this feature requires that the uncompressed file be constructed in memory before it is compressed and written to disk, so it can fail if there is insufficient available memory. One can also specify that any images written to the output file should be compressed using the newly developed `tile-compression' algorithm by appending `[compress]' to the name of the disk file (as in {\tt myfile.fits[compress]}). Refer to the CFITSIO User's Reference Guide for more information about this new image compression format. \item Using a Template to Create a New FITS File The structure of any new FITS file that is to be created may be defined in an ASCII template file. If the name of the template file is appended to the name of the FITS file itself, enclosed in parenthesis (e.g., {\tt 'newfile.fits(template.txt)'}) then CFITSIO will create a FITS file with that structure before opening it for the application to use. The template file basically defines the dimensions and data type of the primary array and any IMAGE extensions, and the names and data types of the columns in any ASCII or binary table extensions. The template file can also be used to define any optional keywords that should be written in any of the HDU headers. The image pixel values and table entry values are all initialized to zero. The application program can then write actual data into the HDUs. See the CFITSIO Reference Guide for for a complete description of the template file syntax. \item Creating a Temporary Scratch File in Memory It is sometimes useful to create a temporary output file when testing an application program. If the name of the file to be created is specified as {\tt mem:} then CFITSIO will create the file in memory where it will persist only until the program closes the file. Use of this {\tt mem:} output file usually enables the program to run faster, and of course the output file does not use up any disk space. \end{itemize} \subsection{Opening Existing Files} When opening a file with {\tt fits\_open\_file}, CFITSIO can read a variety of different input file formats and is not restricted to only reading FITS format files from magnetic disk. The following types of input files are all supported: \begin{itemize} \item FITS files compressed with {\tt zip, gzip} or {\tt compress} If CFITSIO cannot find the specified file to open it will automatically look for a file with the same rootname but with a {\tt .gz, .zip}, or {\tt .Z} extension. If it finds such a compressed file, it will allocate a block of memory and uncompress the file into that memory space. The application program will then transparently open this virtual FITS file in memory. Compressed files can only be opened with 'readonly', not 'readwrite' file access. \item FITS files on the internet, using {\tt ftp} or {\tt http} URLs Simply provide the full URL as the name of the file that you want to open. For example,\linebreak {\tt ftp://legacy.gsfc.nasa.gov/software/fitsio/c/testprog.std}\linebreak will open the CFITSIO test FITS file that is located on the {\tt legacy} machine. These files can only be opened with 'readonly' file access. \item FITS files on {\tt stdin} or {\tt stdout} file streams If the name of the file to be opened is {\tt 'stdin'} or {\tt '-'} (a single dash character) then CFITSIO will read the file from the standard input stream. Similarly, if the output file name is {\tt 'stdout'} or {\tt '-'}, then the file will be written to the standard output stream. In addition, if the output filename is {\tt 'stdout.gz'} or {\tt '-.gz'} then it will be gzip compressed before being written to stdout. This mechanism can be used to pipe FITS files from one task to another without having to write an intermediary FITS file on magnetic disk. \item FITS files that exist only in memory, or shared memory. In some applications, such as real time data acquisition, you may want to have one process write a FITS file into a certain section of computer memory, and then be able to open that file in memory with another process. There is a specialized CFITSIO open routine called {\tt fits\_open\_memfile} that can be used for this purpose. See the ``CFITSIO User's Reference Guide'' for more details. \item IRAF format images (with {\tt .imh} file extensions) CFITSIO supports reading IRAF format images by converting them on the fly into FITS images in memory. The application program then reads this virtual FITS format image in memory. There is currently no support for writing IRAF format images, or for reading or writing IRAF tables. \item Image arrays in raw binary format If the input file is a raw binary data array, then CFITSIO will convert it on the fly into a virtual FITS image with the basic set of required header keywords before it is opened by the application program. In this case the data type and dimensions of the image must be specified in square brackets following the filename (e.g. {\tt rawfile.dat[ib512,512]}). The first character inside the brackets defines the datatype of the array: \begin{verbatim} b 8-bit unsigned byte i 16-bit signed integer u 16-bit unsigned integer j 32-bit signed integer r or f 32-bit floating point d 64-bit floating point \end{verbatim} An optional second character specifies the byte order of the array values: b or B indicates big endian (as in FITS files and the native format of SUN UNIX workstations and Mac PCs) and l or L indicates little endian (native format of DEC OSF workstations and IBM PCs). If this character is omitted then the array is assumed to have the native byte order of the local machine. These datatype characters are then followed by a series of one or more integer values separated by commas which define the size of each dimension of the raw array. Arrays with up to 5 dimensions are currently supported. Finally, a byte offset to the position of the first pixel in the data file may be specified by separating it with a ':' from the last dimension value. If omitted, it is assumed that the offset = 0. This parameter may be used to skip over any header information in the file that precedes the binary data. Further examples: \begin{verbatim} raw.dat[b10000] 1-dimensional 10000 pixel byte array raw.dat[rb400,400,12] 3-dimensional floating point big-endian array img.fits[ib512,512:2880] reads the 512 x 512 short integer array in a FITS file, skipping over the 2880 byte header \end{verbatim} \end{itemize} \newpage \subsection{Image Filtering} \subsubsection{Extracting a subsection of an image} When specifying the name of an image to be opened, you can select a rectangular subsection of the image to be extracted and opened by the application program. The application program then opens a virtual image that only contains the pixels within the specified subsection. To do this, specify the the range of pixels (start:end) along each axis to be extracted from the original image enclosed in square brackets. You can also specify an optional pixel increment (start:end:step) for each axis of the input image. A pixel step = 1 will be assumed if it is not specified. If the starting pixel is larger then the end pixel, then the image will be flipped (producing a mirror image) along that dimension. An asterisk, '*', may be used to specify the entire range of an axis, and '-*' will flip the entire axis. In the following examples, assume that {\tt myfile.fits} contains a 512 x 512 pixel 2D image. \begin{verbatim} myfile.fits[201:210, 251:260] - opens a 10 x 10 pixel subimage. myfile.fits[*, 512:257] - opens a 512 x 256 image consisting of all the columns in the input image, but only rows 257 through 512. The image will be flipped along the Y axis since the starting row is greater than the ending row. myfile.fits[*:2, 512:257:2] - creates a 256 x 128 pixel image. Similar to the previous example, but only every other row and column is read from the input image. myfile.fits[-*, *] - creates an image containing all the rows and columns in the input image, but flips it along the X axis. \end{verbatim} If the array to be opened is in an Image extension, and not in the primary array of the file, then you need to specify the extension name or number in square brackets before giving the subsection range, as in {\tt myfile.fits[1][-*, *]} to read the image in the first extension in the file. \subsubsection{Create an Image by Binning Table Columns} You can also create and open a virtual image by binning the values in a pair of columns of a FITS table (in other words, create a 2-D histogram of the values in the 2 columns). This technique is often used in X-ray astronomy where each detected X-ray photon during an observation is recorded in a FITS table. There are typically 2 columns in the table called {\tt X} and {\tt Y} which record the pixel location of that event in a virtual 2D image. To create an image from this table, one just scans the X and Y columns and counts up how many photons were recorded in each pixel of the image. When table binning is specified, CFITSIO creates a temporary FITS primary array in memory by computing the histogram of the values in the specified columns. After the histogram is computed the original FITS file containing the table is closed and the temporary FITS primary array is opened and passed to the application program. Thus, the application program never sees the original FITS table and only sees the image in the new temporary file (which has no extensions). The table binning specifier is enclosed in square brackets following the root filename and table extension name or number and begins with the keyword 'bin', as in: \newline {\tt 'myfile.fits[events][bin (X,Y)]'}. In this case, the X and Y columns in the 'events' table extension are binned up to create the image. The size of the image is usually determined by the {\tt TLMINn} and {\tt TLMAXn} header keywords which give the minimum and maximum allowed pixel values in the columns. For instance if {\tt TLMINn = 1} and {\tt TLMAXn = 4096} for both columns, this would generate a 4096 x 4096 pixel image by default. This is rather large, so you can also specify a pixel binning factor to reduce the image size. For example specifying , {\tt '[bin (X,Y) = 16]'} will use a binning factor of 16, which will produce a 256 x 256 pixel image in the previous example. If the TLMIN and TLMAX keywords don't exist, or you want to override their values, you can specify the image range and binning factor directly, as in {\tt '[bin X = 1:4096:16, Y=1:4096:16]'}. You can also specify the datatype of the created image by appending a b, i, j, r, or d (for 8-bit byte, 16-bit integers, 32-bit integer, 32-bit floating points, or 64-bit double precision floating point, respectively) to the 'bin' keyword (e.g. {\tt '[binr (X,Y)]'} creates a floating point image). If the datatype is not specified then a 32-bit integer image will be created by default. If the column name is not specified, then CFITSIO will first try to use the 'preferred column' as specified by the CPREF keyword if it exists (e.g., 'CPREF = 'DETX,DETY'), otherwise column names 'X', 'Y' will be assumed for the 2 axes. Note that this binning specifier is not restricted to only 2D images and can be used to create 1D, 3D, or 4D images as well. It is also possible to specify a weighting factor that is applied during the binning. Please refer to the ``CFITSIO User's Reference Guide'' for more details on these advanced features. \newpage \subsection{Table Filtering} \subsubsection{Column and Keyword Filtering} The column or keyword filtering specifier is used to modify the column structure and/or the header keywords in the HDU that was selected with the previous HDU location specifier. It can be used to perform the following types of operations. \begin{itemize} \item Append a new column to a table by giving the column name, optionally followed by the datatype in parentheses, followed by an equals sign and the arithmetic expression to be used to compute the value. The datatype is specified using the same syntax that is allowed for the value of the FITS TFORMn keyword (e.g., 'I', 'J', 'E', 'D', etc. for binary tables, and 'I8', F12.3', 'E20.12', etc. for ASCII tables). If the datatype is not specified then a default datatype will be chosen depending on the expression. \item Create a new header keyword by giving the keyword name, preceded by a pound sign '\#', followed by an equals sign and an arithmetic expression for the value of the keyword. The expression may be a function of other header keyword values. The comment string for the keyword may be specified in parentheses immediately following the keyword name. \item Overwrite the values in an existing column or keyword by giving the name followed by an equals sign and an arithmetic expression. \item Select a set of columns to be included in the filtered file by listing the column names separated with semi-colons. Wild card characters may be used in the column names to match multiple columns. Any other columns in the input table will not appear in the filtered file. \item Delete a column or keyword by listing the name preceded by a minus sign or an exclamation mark (!) \item Rename an existing column or keyword with the syntax 'NewName == OldName'. \end{itemize} The column filtering specifier is enclosed in square brackets and begins with the string 'col'. Multiple operations can be performed by separating them with semi-colons. For complex or commonly used operations, you can write the column filter to a text file, and then use it by giving the name of the text file, preceded by a '@' character. Some examples: \begin{verbatim} [col PI=PHA * 1.1 + 0.2] - creates new PI column from PHA values [col rate = counts/exposure] - creates or overwrites the rate column by dividing the counts column by the EXPOSURE keyword value. [col TIME; X; Y] - only the listed columns will appear in the filtered file [col Time;*raw] - include the Time column and any other columns whose name ends with 'raw'. [col -TIME; Good == STATUS] - deletes the TIME column and renames the STATUS column to GOOD [col @colfilt.txt] - uses the filtering expression in the colfilt.txt text file \end{verbatim} The original file is not changed by this filtering operation, and instead the modifications are made on a temporary copy of the input FITS file (usually in memory), which includes a copy of all the other HDUs in the input file. The original input file is closed and the application program opens the filtered copy of the file. \subsubsection{Row Filtering} The row filter is used to select a subset of the rows from a table based on a boolean expression. A temporary new FITS file is created on the fly (usually in memory) which contains only those rows for which the row filter expression evaluates to true (i.e., not equal to zero). The primary array and any other extensions in the input file are also copied to the temporary file. The original FITS file is closed and the new temporary file is then opened by the application program. The row filter expression is enclosed in square brackets following the file name and extension name. For example, {\tt 'file.fits[events][GRADE==50]'} selects only those rows in the EVENTS table where the GRADE column value is equal to 50). The row filtering expression can be an arbitrarily complex series of operations performed on constants, keyword values, and column data taken from the specified FITS TABLE extension. The expression also can be written into a text file and then used by giving the filename preceded by a '@' character, as in {\tt '[@rowfilt.txt]'}. Keyword and column data are referenced by name. Any string of characters not surrounded by quotes (ie, a constant string) or followed by an open parentheses (ie, a function name) will be initially interpreted as a column name and its contents for the current row inserted into the expression. If no such column exists, a keyword of that name will be searched for and its value used, if found. To force the name to be interpreted as a keyword (in case there is both a column and keyword with the same name), precede the keyword name with a single pound sign, '\#', as in {\tt \#NAXIS2}. Due to the generalities of FITS column and keyword names, if the column or keyword name contains a space or a character which might appear as an arithmetic term then inclose the name in '\$' characters as in {\tt \$MAX PHA\$} or {\tt \#\$MAX-PHA\$}. The names are case insensitive. To access a table entry in a row other than the current one, follow the column's name with a row offset within curly braces. For example, {\tt'PHA\{-3\}'} will evaluate to the value of column PHA, 3 rows above the row currently being processed. One cannot specify an absolute row number, only a relative offset. Rows that fall outside the table will be treated as undefined, or NULLs. Boolean operators can be used in the expression in either their Fortran or C forms. The following boolean operators are available: \begin{verbatim} "equal" .eq. .EQ. == "not equal" .ne. .NE. != "less than" .lt. .LT. < "less than/equal" .le. .LE. <= =< "greater than" .gt. .GT. > "greater than/equal" .ge. .GE. >= => "or" .or. .OR. || "and" .and. .AND. && "negation" .not. .NOT. ! "approx. equal(1e-7)" ~ \end{verbatim} Note that the exclamation point, '!', is a special UNIX character, so if it is used on the command line rather than entered at a task prompt, it must be preceded by a backslash to force the UNIX shell to ignore it. The expression may also include arithmetic operators and functions. Trigonometric functions use radians, not degrees. The following arithmetic operators and functions can be used in the expression (function names are case insensitive): \begin{verbatim} "addition" + "subtraction" - "multiplication" * "division" / "negation" - "exponentiation" ** ^ "absolute value" abs(x) "cosine" cos(x) "sine" sin(x) "tangent" tan(x) "arc cosine" arccos(x) "arc sine" arcsin(x) "arc tangent" arctan(x) "arc tangent" arctan2(x,y) "exponential" exp(x) "square root" sqrt(x) "natural log" log(x) "common log" log10(x) "modulus" i % j "random # [0.0,1.0)" random() "minimum" min(x,y) "maximum" max(x,y) "if-then-else" b?x:y \end{verbatim} The following type casting operators are available, where the inclosing parentheses are required and taken from the C language usage. Also, the integer to real casts values to double precision: \begin{verbatim} "real to integer" (int) x (INT) x "integer to real" (float) i (FLOAT) i \end{verbatim} Several constants are built in for use in numerical expressions: \begin{verbatim} #pi 3.1415... #e 2.7182... #deg #pi/180 #row current row number #null undefined value #snull undefined string \end{verbatim} A string constant must be enclosed in quotes as in 'Crab'. The "null" constants are useful for conditionally setting table values to a NULL, or undefined, value (For example, {\tt "col1==-99 ? \#NULL : col1"}). There is also a function for testing if two values are close to each other, i.e., if they are "near" each other to within a user specified tolerance. The arguments, {\tt value\_1} and {\tt value\_2} can be integer or real and represent the two values who's proximity is being tested to be within the specified tolerance, also an integer or real: \begin{verbatim} near(value_1, value_2, tolerance) \end{verbatim} When a NULL, or undefined, value is encountered in the FITS table, the expression will evaluate to NULL unless the undefined value is not actually required for evaluation, e.g. "TRUE .or. NULL" evaluates to TRUE. The following two functions allow some NULL detection and handling: \begin{verbatim} ISNULL(x) DEFNULL(x,y) \end{verbatim} The former returns a boolean value of TRUE if the argument x is NULL. The later "defines" a value to be substituted for NULL values; it returns the value of x if x is not NULL, otherwise it returns the value of y. Bit masks can be used to select out rows from bit columns ({\tt TFORMn = \#X}) in FITS files. To represent the mask, binary, octal, and hex formats are allowed: \begin{verbatim} binary: b0110xx1010000101xxxx0001 octal: o720x1 -> (b111010000xxx001) hex: h0FxD -> (b00001111xxxx1101) \end{verbatim} In all the representations, an x or X is allowed in the mask as a wild card. Note that the x represents a different number of wild card bits in each representation. All representations are case insensitive. To construct the boolean expression using the mask as the boolean equal operator described above on a bit table column. For example, if you had a 7 bit column named flags in a FITS table and wanted all rows having the bit pattern 0010011, the selection expression would be: \begin{verbatim} flags == b0010011 or flags .eq. b10011 \end{verbatim} It is also possible to test if a range of bits is less than, less than equal, greater than and greater than equal to a particular boolean value: \begin{verbatim} flags <= bxxx010xx flags .gt. bxxx100xx flags .le. b1xxxxxxx \end{verbatim} Notice the use of the x bit value to limit the range of bits being compared. It is not necessary to specify the leading (most significant) zero (0) bits in the mask, as shown in the second expression above. Bit wise AND, OR and NOT operations are also possible on two or more bit fields using the '\&'(AND), '$|$'(OR), and the '!'(NOT) operators. All of these operators result in a bit field which can then be used with the equal operator. For example: \begin{verbatim} (!flags) == b1101100 (flags & b1000001) == bx000001 \end{verbatim} Bit fields can be appended as well using the '+' operator. Strings can be concatenated this way, too. \subsubsection{Good Time Interval Filtering} A common filtering method involves selecting rows which have a time value which lies within what is called a Good Time Interval or GTI. The time intervals are defined in a separate FITS table extension which contains 2 columns giving the start and stop time of each good interval. The filtering operation accepts only those rows of the input table which have an associated time which falls within one of the time intervals defined in the GTI extension. A high level function, gtifilter(a,b,c,d), is available which evaluates each row of the input table and returns TRUE or FALSE depending whether the row is inside or outside the good time interval. The syntax is \begin{verbatim} gtifilter( [ "gtifile" [, expr [, "STARTCOL", "STOPCOL" ] ] ] ) \end{verbatim} where each "[]" demarks optional parameters. Note that the quotes around the gtifile and START/STOP column are required. Either single or double quote characters may be used. The gtifile, if specified, can be blank ("") which will mean to use the first extension with the name "*GTI*" in the current file, a plain extension specifier (eg, "+2", "[2]", or "[STDGTI]") which will be used to select an extension in the current file, or a regular filename with or without an extension specifier which in the latter case will mean to use the first extension with an extension name "*GTI*". Expr can be any arithmetic expression, including simply the time column name. A vector time expression will produce a vector boolean result. STARTCOL and STOPCOL are the names of the START/STOP columns in the GTI extension. If one of them is specified, they both must be. In its simplest form, no parameters need to be provided -- default values will be used. The expression {\tt "gtifilter()"} is equivalent to \begin{verbatim} gtifilter( "", TIME, "*START*", "*STOP*" ) \end{verbatim} This will search the current file for a GTI extension, filter the TIME column in the current table, using START/STOP times taken from columns in the GTI extension with names containing the strings "START" and "STOP". The wildcards ('*') allow slight variations in naming conventions such as "TSTART" or "STARTTIME". The same default values apply for unspecified parameters when the first one or two parameters are specified. The function automatically searches for TIMEZERO/I/F keywords in the current and GTI extensions, applying a relative time offset, if necessary. \subsubsection{Spatial Region Filtering} Another common filtering method selects rows based on whether the spatial position associated with each row is located within a given 2-dimensional region. The syntax for this high-level filter is \begin{verbatim} regfilter( "regfilename" [ , Xexpr, Yexpr [ , "wcs cols" ] ] ) \end{verbatim} where each "[ ]" demarks optional parameters. The region file name is required and must be enclosed in quotes. The remaining parameters are optional. The region file is an ASCII text file which contains a list of one or more geometric shapes (circle, ellipse, box, etc.) which defines a region on the celestial sphere or an area within a particular 2D image. The region file is typically generated using an image display program such as fv/POW (distribute by the HEASARC), or ds9 (distributed by the Smithsonian Astrophysical Observatory). Users should refer to the documentation provided with these programs for more details on the syntax used in the region files. In its simpliest form, (e.g., {\tt regfilter("region.reg")} ) the coordinates in the default 'X' and 'Y' columns will be used to determine if each row is inside or outside the area specified in the region file. Alternate position column names, or expressions, may be entered if needed, as in \begin{verbatim} regfilter("region.reg", XPOS, YPOS) \end{verbatim} Region filtering can be applied most unambiguously if the positions in the region file and in the table to be filtered are both give in terms of absolute celestial coordinate units. In this case the locations and sizes of the geometric shapes in the region file are specified in angular units on the sky (e.g., positions given in R.A. and Dec. and sizes in arcseconds or arcminutes). Similarly, each row of the filtered table will have a celestial coordinate associated with it. This association is usually implemented using a set of so-called 'World Coordinate System' (or WCS) FITS keywords that define the coordinate transformation that must be applied to the values in the 'X' and 'Y' columns to calculate the coordinate. Alternatively, one can perform spatial filtering using unitless 'pixel' coordinates for the regions and row positions. In this case the user must be careful to ensure that the positions in the 2 files are self-consistent. A typical problem is that the region file may be generated using a binned image, but the unbinned coordinates are given in the event table. The ROSAT events files, for example, have X and Y pixel coordinates that range from 1 - 15360. These coordinates are typically binned by a factor of 32 to produce a 480x480 pixel image. If one then uses a region file generated from this image (in image pixel units) to filter the ROSAT events file, then the X and Y column values must be converted to corresponding pixel units as in: \begin{verbatim} regfilter("rosat.reg", X/32.+.5, Y/32.+.5) \end{verbatim} Note that this binning conversion is not necessary if the region file is specified using celestial coordinate units instead of pixel units because CFITSIO is then able to directly compare the celestial coordinate of each row in the table with the celestial coordinates in the region file without having to know anything about how the image may have been binned. The last "wcs cols" parameter should rarely be needed. If supplied, this string contains the names of the 2 columns (space or comma separated) which have the associated WCS keywords. If not supplied, the filter will scan the X and Y expressions for column names. If only one is found in each expression, those columns will be used, otherwise an error will be returned. These region shapes are supported (names are case insensitive): \begin{verbatim} Point ( X1, Y1 ) <- One pixel square region Line ( X1, Y1, X2, Y2 ) <- One pixel wide region Polygon ( X1, Y1, X2, Y2, ... ) <- Rest are interiors with Rectangle ( X1, Y1, X2, Y2, A ) | boundaries considered Box ( Xc, Yc, Wdth, Hght, A ) V within the region Diamond ( Xc, Yc, Wdth, Hght, A ) Circle ( Xc, Yc, R ) Annulus ( Xc, Yc, Rin, Rout ) Ellipse ( Xc, Yc, Rx, Ry, A ) Elliptannulus ( Xc, Yc, Rinx, Riny, Routx, Routy, Ain, Aout ) Sector ( Xc, Yc, Amin, Amax ) \end{verbatim} where (Xc,Yc) is the coordinate of the shape's center; (X\#,Y\#) are the coordinates of the shape's edges; Rxxx are the shapes' various Radii or semimajor/minor axes; and Axxx are the angles of rotation (or bounding angles for Sector) in degrees. For rotated shapes, the rotation angle can be left off, indicating no rotation. Common alternate names for the regions can also be used: rotbox = box; rotrectangle = rectangle; (rot)rhombus = (rot)diamond; and pie = sector. When a shape's name is preceded by a minus sign, '-', the defined region is instead the area *outside* its boundary (ie, the region is inverted). All the shapes within a single region file are OR'd together to create the region, and the order is significant. The overall way of looking at region files is that if the first region is an excluded region then a dummy included region of the whole detector is inserted in the front. Then each region specification as it is processed overrides any selections inside of that region specified by previous regions. Another way of thinking about this is that if a previous excluded region is completely inside of a subsequent included region the excluded region is ignored. The positional coordinates may be given either in pixel units, decimal degrees or hh:mm:ss.s, dd:mm:ss.s units. The shape sizes may be given in pixels, degrees, arcminutes, or arcseconds. Look at examples of region file produced by fv/POW or ds9 for further details of the region file format. \subsubsection{Example Row Filters} \begin{verbatim} [double && mag <= 5.0] - Extract all double stars brighter than fifth magnitude [#row >= 125 && #row <= 175] - Extract row numbers 125 through 175 [abs(sin(theta * #deg)) < 0.5] - Extract all rows having the absolute value of the sine of theta less than a half where the angles are tabulated in degrees [@rowFilter.txt] - Extract rows using the expression contained within the text file rowFilter.txt [gtifilter()] - Search the current file for a GTI extension, filter the TIME column in the current table, using START/STOP times taken from columns in the GTI extension [regfilter("pow.reg")] - Extract rows which have a coordinate (as given in the X and Y columns) within the spatial region specified in the pow.reg region file. \end{verbatim} \newpage \subsection{Combined Filtering Examples} The previous sections described all the individual types of filters that may be applied to the input file. In this section we show examples which combine several different filters at once. These examples all use the {\tt fitscopy} program that is distributed with the CFITSIO code. It simply copies the input file to the output file. \begin{verbatim} fitscopy rosat.fit out.fit \end{verbatim} This trivial example simply makes an identical copy of the input rosat.fit file without any filtering. \begin{verbatim} fitscopy 'rosat.fit[events][col Time;X;Y][#row < 1000]' out.fit \end{verbatim} The output file contains only the Time, X, and Y columns, and only the first 999 rows from the 'EVENTS' table extension of the input file. All the other HDUs in the input file are copied to the output file without any modification. \begin{verbatim} fitscopy 'rosat.fit[events][PI < 50][bin (Xdet,Ydet) = 16]' image.fit \end{verbatim} This creates an output image by binning the Xdet and Ydet columns of the events table with a pixel binning factor of 16. Only the rows which have a PI energy less than 50 are used to construct this image. The output image file contains a primary array image without any extensions. \begin{verbatim} fitscopy 'rosat.fit[events][gtifilter() && regfilter("pow.reg")]' out.fit \end{verbatim} The filtering expression in this example uses the {\tt gtifilter} function to test whether the TIME column value in each row is within one of the Good Time Intervals defined in the GTI extension in the same input file, and also uses the {\tt regfilter} function to test if the position associated with each row (derived by default from the values in the X and Y columns of the events table) is located within the area defined in the {\tt pow.reg} text region file (which was previously created with the {\tt fv/POW} image display program). Only the rows which satisfy both tests are copied to the output table. \begin{verbatim} fitscopy 'r.fit[evt][PI<50]' stdout | fitscopy stdin[evt][col X,Y] out.fit \end{verbatim} In this somewhat convoluted example, fitscopy is used to first select the rows from the evt extension which have PI less than 50 and write the resulting table out to the stdout stream. This is piped to a 2nd instance of fitscopy (with the Unix `$|$' pipe command) which reads that filtered FITS file from the stdin stream and copies only the X and Y columns from the evt table to the output file. \begin{verbatim} fitscopy 'r.fit[evt][col RAD=sqrt((X-#XCEN)**2+(Y-#YCEN)**2)][rad<100]' out.fit \end{verbatim} This example first creates a new column called RAD which gives the distance between the X,Y coordinate of each event and the coordinate defined by the XCEN and YCEN keywords in the header. Then, only those rows which have a distance less than 100 are copied to the output table. In other words, only the events which are located within 100 pixel units from the (XCEN, YCEN) coordinate are copied to the output table. \begin{verbatim} fitscopy 'ftp://heasarc.gsfc.nasa.gov/rosat.fit[events][bin (X,Y)=16]' img.fit \end{verbatim} This example bins the X and Y columns of the hypothetical ROSAT file at the HEASARC ftp site to create the output image. \begin{verbatim} fitscopy 'raw.fit[i512,512][101:110,51:60]' image.fit \end{verbatim} This example converts the 512 x 512 pixel raw binary 16-bit integer image to a FITS file and copies a 10 x 10 pixel subimage from it to the output FITS image. \newpage \section{CFITSIO Error Status Codes} The following table lists all the error status codes used by CFITSIO. Programmers are encouraged to use the symbolic mnemonics (defined in the file fitsio.h) rather than the actual integer status values to improve the readability of their code. \begin{verbatim} Symbolic Const Value Meaning -------------- ----- ----------------------------------------- 0 OK, no error SAME_FILE 101 input and output files are the same TOO_MANY_FILES 103 tried to open too many FITS files at once FILE_NOT_OPENED 104 could not open the named file FILE_NOT_CREATED 105 could not create the named file WRITE_ERROR 106 error writing to FITS file END_OF_FILE 107 tried to move past end of file READ_ERROR 108 error reading from FITS file FILE_NOT_CLOSED 110 could not close the file ARRAY_TOO_BIG 111 array dimensions exceed internal limit READONLY_FILE 112 Cannot write to readonly file MEMORY_ALLOCATION 113 Could not allocate memory BAD_FILEPTR 114 invalid fitsfile pointer NULL_INPUT_PTR 115 NULL input pointer to routine SEEK_ERROR 116 error seeking position in file BAD_URL_PREFIX 121 invalid URL prefix on file name TOO_MANY_DRIVERS 122 tried to register too many IO drivers DRIVER_INIT_FAILED 123 driver initialization failed NO_MATCHING_DRIVER 124 matching driver is not registered URL_PARSE_ERROR 125 failed to parse input file URL SHARED_BADARG 151 bad argument in shared memory driver SHARED_NULPTR 152 null pointer passed as an argument SHARED_TABFULL 153 no more free shared memory handles SHARED_NOTINIT 154 shared memory driver is not initialized SHARED_IPCERR 155 IPC error returned by a system call SHARED_NOMEM 156 no memory in shared memory driver SHARED_AGAIN 157 resource deadlock would occur SHARED_NOFILE 158 attempt to open/create lock file failed SHARED_NORESIZE 159 shared memory block cannot be resized at the moment HEADER_NOT_EMPTY 201 header already contains keywords KEY_NO_EXIST 202 keyword not found in header KEY_OUT_BOUNDS 203 keyword record number is out of bounds VALUE_UNDEFINED 204 keyword value field is blank NO_QUOTE 205 string is missing the closing quote BAD_KEYCHAR 207 illegal character in keyword name or card BAD_ORDER 208 required keywords out of order NOT_POS_INT 209 keyword value is not a positive integer NO_END 210 couldn't find END keyword BAD_BITPIX 211 illegal BITPIX keyword value BAD_NAXIS 212 illegal NAXIS keyword value BAD_NAXES 213 illegal NAXISn keyword value BAD_PCOUNT 214 illegal PCOUNT keyword value BAD_GCOUNT 215 illegal GCOUNT keyword value BAD_TFIELDS 216 illegal TFIELDS keyword value NEG_WIDTH 217 negative table row size NEG_ROWS 218 negative number of rows in table COL_NOT_FOUND 219 column with this name not found in table BAD_SIMPLE 220 illegal value of SIMPLE keyword NO_SIMPLE 221 Primary array doesn't start with SIMPLE NO_BITPIX 222 Second keyword not BITPIX NO_NAXIS 223 Third keyword not NAXIS NO_NAXES 224 Couldn't find all the NAXISn keywords NO_XTENSION 225 HDU doesn't start with XTENSION keyword NOT_ATABLE 226 the CHDU is not an ASCII table extension NOT_BTABLE 227 the CHDU is not a binary table extension NO_PCOUNT 228 couldn't find PCOUNT keyword NO_GCOUNT 229 couldn't find GCOUNT keyword NO_TFIELDS 230 couldn't find TFIELDS keyword NO_TBCOL 231 couldn't find TBCOLn keyword NO_TFORM 232 couldn't find TFORMn keyword NOT_IMAGE 233 the CHDU is not an IMAGE extension BAD_TBCOL 234 TBCOLn keyword value < 0 or > rowlength NOT_TABLE 235 the CHDU is not a table COL_TOO_WIDE 236 column is too wide to fit in table COL_NOT_UNIQUE 237 more than 1 column name matches template BAD_ROW_WIDTH 241 sum of column widths not = NAXIS1 UNKNOWN_EXT 251 unrecognizable FITS extension type UNKNOWN_REC 252 unknown record; 1st keyword not SIMPLE or XTENSION END_JUNK 253 END keyword is not blank BAD_HEADER_FILL 254 Header fill area contains non-blank chars BAD_DATA_FILL 255 Illegal data fill bytes (not zero or blank) BAD_TFORM 261 illegal TFORM format code BAD_TFORM_DTYPE 262 unrecognizable TFORM datatype code BAD_TDIM 263 illegal TDIMn keyword value BAD_HEAP_PTR 264 invalid BINTABLE heap pointer is out of range BAD_HDU_NUM 301 HDU number < 1 or > MAXHDU BAD_COL_NUM 302 column number < 1 or > tfields NEG_FILE_POS 304 tried to move to negative byte location in file NEG_BYTES 306 tried to read or write negative number of bytes BAD_ROW_NUM 307 illegal starting row number in table BAD_ELEM_NUM 308 illegal starting element number in vector NOT_ASCII_COL 309 this is not an ASCII string column NOT_LOGICAL_COL 310 this is not a logical datatype column BAD_ATABLE_FORMAT 311 ASCII table column has wrong format BAD_BTABLE_FORMAT 312 Binary table column has wrong format NO_NULL 314 null value has not been defined NOT_VARI_LEN 317 this is not a variable length column BAD_DIMEN 320 illegal number of dimensions in array BAD_PIX_NUM 321 first pixel number greater than last pixel ZERO_SCALE 322 illegal BSCALE or TSCALn keyword = 0 NEG_AXIS 323 illegal axis length < 1 NOT_GROUP_TABLE 340 Grouping function error HDU_ALREADY_MEMBER 341 MEMBER_NOT_FOUND 342 GROUP_NOT_FOUND 343 BAD_GROUP_ID 344 TOO_MANY_HDUS_TRACKED 345 HDU_ALREADY_TRACKED 346 BAD_OPTION 347 IDENTICAL_POINTERS 348 BAD_GROUP_ATTACH 349 BAD_GROUP_DETACH 350 NGP_NO_MEMORY 360 malloc failed NGP_READ_ERR 361 read error from file NGP_NUL_PTR 362 null pointer passed as an argument. Passing null pointer as a name of template file raises this error NGP_EMPTY_CURLINE 363 line read seems to be empty (used internally) NGP_UNREAD_QUEUE_FULL 364 cannot unread more then 1 line (or single line twice) NGP_INC_NESTING 365 too deep include file nesting (infinite loop, template includes itself ?) NGP_ERR_FOPEN 366 fopen() failed, cannot open template file NGP_EOF 367 end of file encountered and not expected NGP_BAD_ARG 368 bad arguments passed. Usually means internal parser error. Should not happen NGP_TOKEN_NOT_EXPECT 369 token not expected here BAD_I2C 401 bad int to formatted string conversion BAD_F2C 402 bad float to formatted string conversion BAD_INTKEY 403 can't interpret keyword value as integer BAD_LOGICALKEY 404 can't interpret keyword value as logical BAD_FLOATKEY 405 can't interpret keyword value as float BAD_DOUBLEKEY 406 can't interpret keyword value as double BAD_C2I 407 bad formatted string to int conversion BAD_C2F 408 bad formatted string to float conversion BAD_C2D 409 bad formatted string to double conversion BAD_DATATYPE 410 illegal datatype code value BAD_DECIM 411 bad number of decimal places specified NUM_OVERFLOW 412 overflow during datatype conversion DATA_COMPRESSION_ERR 413 error compressing image DATA_DECOMPRESSION_ERR 414 error uncompressing image BAD_DATE 420 error in date or time conversion PARSE_SYNTAX_ERR 431 syntax error in parser expression PARSE_BAD_TYPE 432 expression did not evaluate to desired type PARSE_LRG_VECTOR 433 vector result too large to return in array PARSE_NO_OUTPUT 434 data parser failed not sent an out column PARSE_BAD_COL 435 bad data encounter while parsing column PARSE_BAD_OUTPUT 436 Output file not of proper type ANGLE_TOO_BIG 501 celestial angle too large for projection BAD_WCS_VAL 502 bad celestial coordinate or pixel value WCS_ERROR 503 error in celestial coordinate calculation BAD_WCS_PROJ 504 unsupported type of celestial projection NO_WCS_KEY 505 celestial coordinate keywords not found APPROX_WCS_KEY 506 approximate wcs keyword values were returned \end{verbatim} \end{document} cfitsio-3.47/docs/quick.toc0000644000225700000360000000340313464573431015162 0ustar cagordonlhea\contentsline {section}{\numberline {1}Introduction}{2} \contentsline {section}{\numberline {2}Installing and Using CFITSIO}{3} \contentsline {section}{\numberline {3}Example Programs}{4} \contentsline {section}{\numberline {4}CFITSIO Routines}{6} \contentsline {subsection}{\numberline {4.1}Error Reporting}{6} \contentsline {subsection}{\numberline {4.2}File Open/Close Routines}{6} \contentsline {subsection}{\numberline {4.3}HDU-level Routines}{7} \contentsline {subsection}{\numberline {4.4}Image I/O Routines}{9} \contentsline {subsection}{\numberline {4.5}Table I/O Routines}{12} \contentsline {subsection}{\numberline {4.6}Header Keyword I/O Routines}{19} \contentsline {subsection}{\numberline {4.7}Utility Routines}{22} \contentsline {section}{\numberline {5}CFITSIO File Names and Filters}{23} \contentsline {subsection}{\numberline {5.1}Creating New Files}{23} \contentsline {subsection}{\numberline {5.2}Opening Existing Files}{24} \contentsline {subsection}{\numberline {5.3}Image Filtering}{26} \contentsline {subsubsection}{\numberline {5.3.1}Extracting a subsection of an image}{26} \contentsline {subsubsection}{\numberline {5.3.2}Create an Image by Binning Table Columns}{26} \contentsline {subsection}{\numberline {5.4}Table Filtering}{28} \contentsline {subsubsection}{\numberline {5.4.1}Column and Keyword Filtering}{28} \contentsline {subsubsection}{\numberline {5.4.2}Row Filtering}{29} \contentsline {subsubsection}{\numberline {5.4.3}Good Time Interval Filtering}{32} \contentsline {subsubsection}{\numberline {5.4.4}Spatial Region Filtering}{32} \contentsline {subsubsection}{\numberline {5.4.5}Example Row Filters}{34} \contentsline {subsection}{\numberline {5.5}Combined Filtering Examples}{36} \contentsline {section}{\numberline {6}CFITSIO Error Status Codes}{38} cfitsio-3.47/docs/changes.txt0000644000225700000360000063464713464573431015534 0ustar cagordonlhea Log of Changes Made to CFITSIO Version 3.47 - May 2019 - Added set of drivers for performing ftps file transfers. - Tile sizes for compression may now be specified for any pair of axes, where previously 2D tiles where limited to just X and y. - Fix to ffgsky and ffgkls functions for case of keyword with long string values where the final CONTINUE statement ended with '&'. If the final CONTINUE also contained a comment, it was being repeated twice when passed back through the 'comm' argument. - Fix made to ffedit_columns() for case of multiple col filters containing wildcards. Only the first filter was being searched. - fits_copy_rows (ffcprw) can now handle 'P'-type variable-length columns. - Fix made to an obscure case in fits_modify_vector_len, where a wrongly issued EOF error may occur. - Added internal fffvcl() function. Version 3.46 - Oct 2018 (Ftools release) - Improved the algorithm for ensuring no tile dimensions are smaller than 4 pixels for HCOMPRESS compression. - Added new functions intended to assist in diagnosing (primarily https) download issues: fits_show_download_progress, fits_get_timeout, fits_set_timeout. - Added the '-O ' option to fpack, which previously existed only for funpack. Also added fpack/funpack auto-removal of .bz2 suffix equivalent to what existed for .gz. - For the fpack '-table' cases, warning message is now sent to stderr instead of stdout. This is to allow users to pipe the results from stdout in valid FITS format. (The warning message is otherwise placed at the start of the FITS file and therefore corrupts it.) - Fix made to the '-P' file prefix option in funpack. - Added wildcard deletion syntax for columns, i.e. -COLNAM* will delete the first matching column as always; -COLNAM*+ will delete all matching columns (or none); exact symmetry with the keyword deletion syntax. Version 3.45 - May 2018 - New support for reading and writing unsigned long long datatypes. This includes 'implicit datatype conversion' between the unsigned long long datatype and all the other datatypes. - Increased the hardcoded NMAXFILES setting for maximum number of open files from 1000 to 10000. - Bug fix to fits_calc_binning wrapper function, which wasn't filling in the returned float variables. - Fixed a parsing bug for image subsection and column binning range specifiers that was introduced in v3.44. Version 3.44 - April 2018 - This release primarily patches security vulnerabilities. We strongly encourage this upgrade, particularly for those running CFITSIO in web accessible applications. In addition, the following enhancements and fixes were made: - Enhancement to 'template' and 'colfilter' functionality. It is now possible to delete multiple keywords using wildcard syntax. See "Column and Keyword Filtering Specification" section of manual for details. - histo.c uses double precision internally for all floating point binning; new double-precision subroutines fits_calc_binningd(), fits_rebin_wcsd(), and fits_make_histd(); existing single-precision histogram functions still work but convert values to double-precision internally. - new subroutine fits_copy_cols() / ffccls() to copy multiple columns - Fix in imcompress.c for HCOMPRESS and PLIO compression of unsigned short integers. - Fix to fits_insert_card(ffikey). It had wrongly been capitalizing letters that appeared before an '=' sign on a CONTINUE line. Version 3.43 - March 2018 The NASA security team requires the following warning to all users of CFITSIO: ===== The CFITSIO open source software project contains vulnerabilities that could allow a remote, unauthenticated attacker to take control of a server running the CFITSIO software. These vulnerabilities affect all servers and products running the CFITSIO software. The CFITSIO team has released software updates to address these vulnerabilities. There are no workarounds to address these vulnerabilities. In all cases, the CFITSIO team is recommending an immediate update to resolve the issues. ===== - Fixed security vulnerabilities. - Calls to https driver functions in cfileio.c need to be macro- protected by the HAVE_NET_SERVICES variable (as are the http and ftp driver function calls). Otherwise CMake builds on native Windows will fail since drvrnet.o is left empty. - Bug fix to ffmvec function. Should be resetting a local colptr variable after making a call to ffiblk (which can reallocate Ftpr-> tableptr). Originally reported by Willem van Straten. - Ignore any attempted request to not quantize an image before compressing it if the image has integer datatype pixels. - Improved error message construction throughout CFITSIO. Version 3.42 - August 2017 (Stand-alone release) - added https support to the collection of drivers handled in cfileio.c and drvrnet.c. This also handles the case where http transfers are rerouted to https. Note that this enhancement introduces a dependency on the libcurl development package. If this package is absent, CFITSIO will still build but will not have https capability. - made fix to imcomp_init_table function in imcompress.c. It now writes ZSIMPLE keyword only to a compressed image that will be placed in the primary header. - fix made to fits_get_col_display_width for case of a vector column of strings. Version 3.42 - March 2017 (Ftools release only) - in ftp_open_network and in ftp_file_exist, added code to repeatedly attempt to make a ftp connection if the ftp server does not respond to the first request. (some ftp servers don't appear to be 100% reliable). - in drvrnet.c added many calls to 'fclose' to close unneeded files, to avoid exceeding the maximum allowed number of files that can be open at once. - made substantial changes to the ftp_checkfile and http_checkfile routines to streamline the process of checking for the existence of a .gz or .Z compressed version of the file before opening the uncompressed file (when using http or ftp to open the file). - modified the code in ftp_open_network to send "\r\n" as end-of-line characters instead of just "\n". Some ftp servers (in particular, at heasarc.gsfc.nasa.gov) now require both characters, otherwise the network connection simply hangs. - modified the http_open_network routine to handle HTTP 301 or 302 redirects to a FTP url. This is needed to support the new configuration on the heasarc HTTP server which sometimes redirects http URLS to a ftp URL. Version 3.41 - November 2016 - The change made in version 3.40 to include strings.h caused problems on Windows (and other) platforms, so this change was backed out. The reason for including it was to define the strcasecmp and strcasencmp functions, so as an alternative, new equivalent functions called fits_strcasecmp and fits_strncasecmp have been added to CFITSIO.as a substitute. All the previous calls to the str[n]casecmp functions have been changed to now call fits_str[n]casecmp. In addition, the previously defined ngp_strcasecmp function (in grparser.c) has been removed and the calls to it have been changed to fits_strcasecmp. - The speed.c utility program was changed to correctly call the gettimeofday function with a NULL second arguement. Version 3.40 - October 2016 - fixed a bug when writing long string keywords with the CONTINUE convention which caused the CONTINUE'd strings to only be 16 characters long, instead of using up all the available space in the 80-character header record. - fixed a missing 'defined' keyword in fitsio.h. - replaced all calls to strtok (which is not threadsafe) with a new ffstrtok function which internally calls the threadsafe strtok_r function. One byproduct of this change is that must also be included in several of the C source code files. - modified the ffphbn function in putkey.c to support TFORM specifiers that use lowercase 'p' (instead of uppercase) when referring to a variable-length array column. - modified the lexical parser in eval.y and eval_y.c to support bit array columns (with TFORMn = 'X') with greater than 256 elements. Fix to bitcmp function: The internal 'stream' array is now allocated dynamically rather than statically fixed at size 256. This was failing when users attempted a row filtering of a bitcol that was wider than 256X. In bitlgte, bitand, and bitor functions, replaced static stream[256] array allocation with dynamic allocation. - modified the ffiter function in putcol.c to fix a problem which could cause the iterator function to incorrectly deal with null values. This only affected TLONG type columns in cases where sizeof(long) = 8, as well as for TLONGLONG type columns. - Fix made to uncompress2mem function in zcomprss.c for case where output uncompressed file expands to over the 2^32 (4Gb) limit. It now checks for this case at the start, and implements a 4Gb paging system through the output buffer. The problem was specifically caused by the d_stream.avail_out member being of 4-byte type uInt, and thus unable to handle any memory position values above 4Gb. - fixed a bug in fpackutil.c when using the -i2f (integer to float) option in fpack to compress an integer image that is scaled with non-default values for BSCALE and BZERO. This required an additional call to ffrhdu to reset the internal structures that describe the input FITS file. - modified fits_uncompress_table in imcompress.c to silently ignore the ZTILELEN keyword value if it larger than the number of rows in the table - Tweak strcasecmp/strncasecmp ifdefs to exclude 64-bit MINGW environment, as it does not lack those functions. (eval_l.c, fitsio2.h) - CMakeLists.txt: Set M_LIB to "" for MINGW build environment (in addition to MSVC). - Makefile.in: Add *.dSYM (non-XCode gcc leftovers on Macs) to clean list. Install libs by name rather than using a wildcard. - configure: Fix rpath token usage for XCode vs. non-XCode gcc on Macs. Version 3.39 - April 2016 - added 2 new routines suggested by Eric Mandel: ffhisto3 is similar to ffhisto2, except that it does not close the original file. fits_open_extlist is similar to fits_open_data except that it opens the FITS file and then moves to the first extension in the user-input list of 'interesting' extensions. - in ffpsvc and ffprec, it is necessary to treat CONTINUE, COMMENT, HISTORY, and blank name keywords as a special case which must be treated differently from other keywords because they have no value field and, by definition, have keyword names that are strictly limited in length. - added the Fortran wrapper routines for the 2 new string keyword reading routines (FTGSKY and FTGKSL), and documented all the routines in the FITSIO and CFITSIO users guides. - in ffinttyp, added explicit initialization of the input 'negative' argument to 0. - added new routine to return the length of the keyword value string: fits_get_key_strlen / ffgksl. This is primarily intended for use with string keywords that use the CONTINUE convention to continue the value over multiple header records, but this routine can be used to get the length of the value string for any type keyword. - added new routine to read string-valued keywords: fits_read_string_key / ffgsky This routine supports normal string keywords as well as long string keywords that use the CONTINUE convention. In many cases this routine may be more convenient to use then the older fits_read_key_longstr routine. - changed the prototype of fits_register_driver in fitsio2.h so that the pointer definition argument does not have the same name as the pointer itself (to work around a bug in the pgcc compiler). - added the missing FTDTDM fortran wrapper definition to f77_wrap3.c. - modified Makefile.in and configure.in to add LDFLAGS_BIN for task linker flages, which will be the same as LDFLAGS except on newer Mac OS X where an rpath flag is added. - modified Makefile.in to add a new "make utils" command which will build fpack, funpack, cookbook, fitscopy, imcopy, smem, speed, and testprog. These programs will be installed into $prfix/bin. - fixed a bug when attempting to modify the values in a variable-length bit ("X") column in a binary table. - reinstated the ability to write HIERARCH keywords that contain characters that would not be allowed in a normal 8-character keyword name, which had been disabled in the previous release. Version 3.38 - February 2016 - CRITICAL BUG FIX: The Intel 15 and 16 compilers (and potentially other compilers) may silently produce incorrect assembly code when compiling CFITSIO with the -O2 (or higher) optimization flag. In particular, this problem could cause CFITSIO to incorrectly read the values of arrays of 32-bit integers in a FITS file (i.e., images with BITPIX = 32 or table columns with TFORM = 'J') when the array is being read into a 'long' integer array in cases where the long array elements are 8 bytes long. One way to test if a particular system is affected by this problem is to compile CFITSIO V3.37 (or earlier) with optimization enabled, and then compare the output of the testprog.c program with the testprog.out file that is distributed with CFITSIO. If there are any differences in the files, then this system might be affected by this bug. Further tests should be performed to determine the exact cause. The root cause of this problem was traced to the fact that CFITSIO was aliasing an array of 32-bit integers and an array of 64-bit integers to the same memory location in order to obtain better data I/O efficiency when reading FITS files. When CFITSIO modified the values in these arrays, it was essential that the processing be done in strict sequential order from one end of the array to the other end, as was implicit in the C code algorithm. In this case, however, the compiler adopted certain loop optimization techniques that produced assembly code that violated this assumption. Technically, the CFITSIO code violates the "strict aliasing" assumption in ANSI C99, therefore the affected CFITSIO routines have been modified so that the aliasing of different data types to the same memory location no longer occurs. - fixed problem in configure and configure.in which caused the programs that are distributed with CFITSIO (most notably, fack and funpack) to be build without using any compiler optimization options, which could make them run more slowly than expected. - in imcompress.c, fixed bug where the rowspertile variable (declared as 'long') was mistakenly declared as a TLONGLONG variable in a call to fits_write_key. This could have caused the ZTILELEN keyword to be written incorrectly in the header of tile-compressed FITS tables on systems where sizeof(long) = 4. - in imcompress.c, implemented a new set of routines that safely convert shorter integer arrays into a longer integer arrays (e.g. short to int) where both arrays are aliased to the same memory location. These special routines were needed to guard against certain compiler optimization techniques that could produce incorrect code. - modified the 4 FnNoise5_(type) routines in quantize.c to correctly count the number of non-null pixels in the input array. Previously the count could be inaccurate if the image mainly consisted of null pixels. This could have caused certain floating point image tiles to be quantized during the image compression process, when in fact the tile did not satisfy all the criteria to be safely quantized. - in imcomp_copy_comp2img, added THEAP to the list of binary table keywords that may be present in the header of a compressed image and should not be copied to the uncompressed image header. - modified fits_copy_col to check that when copying a vector column, the vector length in the output column is the same as in the input column. Also modified the code to support the case where a column is being copied to an earlier position in the same table (which shifts the input column over 1 space). - added configure option (--with-bzip2) to support reading bzip2 compressed FITS files. This also required modifications to drvrmem.c and drvrfile.c This depends on having the bzlib library installed on the local machine. This patch was submitted by Dustin Lang. - replaced calls to 'memcpy' by 'memmove' in getcolb.c, getcold.c, getcole.c, and getcoli.c to support cases where the 2 memory areas overlap. (submitted by Aurelien Jarno) - modified the FITS keyword reading and writing routines to potentially support keywords with names longer than 8-characters. This was implemented in anticipation of a new experimental FITS convention which allows longer keyword names. - in fits_quantize_double in quantize.c, test if iseed == N_RANDOM, to avoid the (unlikely) possibility of overflowing the random number array bounds. (The corresponding fits_quantize_float routine already performed this test). - in the FnNoise5_short routine in quantize.c, change the first 'if' statement from "if (nx < 5)" to "if )nx < 9)", in order to support the (very rare) case where the tile is from 5 to 8 pixels wide. Also make the same change in the 3 other similar FnNoise5_* routines. - in the qtree_bitins64 routine in fits_hdecompress.c, must declare the plane_val variable as 'LONGLONG' instead of int. This bug could have caused integer overflow errors when uncompressing integer*4 images that had been compressed with the Hcompress algorithm, but only in cases where the image contains large regions of pixels whose values are close to the maximum integer*4 value of 2**31. - in fits_hcompress.c, call the calloc function instead of malloc when allocating the signbits array, to eliminate the need to individually set each byte to zero. - in the ffinit routine, and in a couple other routines that call ffinit, initialize the *fptr input parameter to NULL, even if the input status parameter value is greater than zero. This helps prevent errors later on if that fptr value is passed to ffclos. - modified ftcopy, in edithdu.c, to only abort if status > 0 rather than if status != 0. This had caused a problem in funpack in rare circumstances. - in imcompress.c changed all the calls to ffgdes to ffgdesll, to support compressed files greater than 2.1 GB in size. - fixed bug in ffeqtyll when it is called with 4th and 5th arguments set to NULL. - in fitsio.h, added the standard C++ guard around the declaration of the function fits_read_wcstab. (reported by Tammo Jan Dijkema, Astron.) - in fitsio.h, changed the prototype variable name "zero" to "zeroval" to avoid conflict in code that uses a literal definition of 'zero' to mean 0. - tweaked Makefile.in and configure.in to use LDFLAGS instead of CFLAGS for linking, use Macros for library name, and let fpack and funpack link with shared library. - modified an 'ifdef' statement in cfileio.c to test for '__GLIBC__' instead of 'linux' when initializing support for multi-threading. - modified ffeqtyll to return an effective column data type of TDOUBLE in the case of a 'K' (64-bit integer) column that has non-integer TSCALn or TZEROn keywords. - modified ffgcls (which returns the value in a column as a formatted string) so that when reading a 'K' (TLONGLONG) column it returns a long long integer value if the column is not scaled, but returns a double floating point value if the column has non-integer TSCALn or TZEROn values. - modified fitsio.h to correctly define "OFF_T long long" when using the Borland compiler - converted the 'end of line' characters in simplerng.c file to the unix style, instead of PC DOS. - updated CMakeLists.txt CMake build file which is primarily used to build CFITSIO on Windows machines. - modified fits_get_keyclass to recognize ZQUANTIZ and ZDITHER0 as TYP_CMPRS_KEY type keywords, i.e., keywords used in tile compressed image files. - added test to see if HAVE_UNISTD_H is defined, as a condition for including unistd.h in drvrfile.c drvrnet.c, drvrsmem.c, and group.c. - modified the CMakelist.txt file to fix several issues (primarily for building CFITSIO on Windows machines).. - fixed bug when reading tile-compressed images that were compressed with the IRAF PLIO algorithm. This bug did not affect fpack or funpack, but other software that reads the compressed image could be affected. The bug would cause the data values to be offset by 32768 from the actual pixel values. Version 3.37 - 3 June 2014 - replaced the random Gaussian and Poissonian distribution functions with new code written by Craig Markwardt derived from public domain C++ functions written by John D Cook. - patched fitsio2.h to support CFITSIO on AArch64 (64-bit ARM) architecture (both big and little endian). Supplied by Marcin Juszkiewicz and Sergio Pascual Ramirez, with further update by Michel Normand. - fixed bug in fpackutil.c that caused fpack to exit prematurely if the FZALGOR directive keyword was present in the HDU header. Version 3.36 - 6 December 2013 - added 9 Dec: small change to the fileseek function in drvrfile.c to support large files > 2 GB when building CFITSIO with MinGW on Windows - reorganized the CFITSIO code directory structure; added a 'docs' subdirectory for all the documentation, and a 'zlib' directory for the zlib/gzip file compression code. - made major changes to the compression code for FITS binary table to support all types of columns, including variable-length arrays. This code is mainly used via the fpack and funpack programs. - increased the number of FITS files that can be opened as one time to 1000, as defined by NMAXFILES in fitsio2.h. - made small configuration changes to configure.in, configure, fitsio.h, and drvrfile.c to support large files (64-bit file offsets} when using the mingw-w64 compiler (provided by Benjamin Gilbert). - made small change to fits_delete_file to more completely ignore any non-zero input status value. - fixed a logic error in a 'if' test when parsing a keyword name in the ngp_keyword_is_write function in grparser.c (provided by David Binderman). - when specifying the image compression parameters as part of the compressed image file name (using the "[compress]" qualifier after the name of the file), the quantization level value, if specified, was not being recognized by the CFITSIO compression routines. The image would always be compressed with the default quantization level of 4.0, regardless of what was specified. This affected the imcopy program, and potentially other user-generated application programs that used this method to specify the compression parameters. This bug did not affect fpack or funpack. This was fixed in the imcomp_get_compressed_image_par routine in the imcompress.c file. (reported by Sean Peters) - defined a new CFITS_API macro in fitsio.h which is used to export the public symbols when building CFITSIO on Windows systems with CMake. This works in conjunction with the new Windows CMake build procedure that is described in the README.win32 file. This complete revamping of the way CFITSIO is built under Windows now supports building 64-bit versions of the library. Thanks to Daniel Kaneider (Luminance HDR Team) for providing these new CMake build procedures. - modified the way that the low-level file_create routine works when running in the Hera environment to ensure that the FITS file that is created is within the allow user data disk area. - modified fits_get_compression_type so that it does not return an error if the HDU is a normal FITS IMAGE extension, and is not a tile-compressed image. - modified the low-level ffgcl* and ffpcl* routines to ensure that they never try ro read or write more than 2**31 bytes from disk at one time, as might happen with very large images, to avoid integer overflow errors. Fix kindly provided by Fred Gutsche at NanoFocus AG (www.nanofocus.de). - modified Makefile.in so that doing 'make distclean' does not delete new config.sub and config.guess files that were recently added. - adopted a patch from Debian in zcompress.c to "define" the values of GZBUFSIZE and BUFFINCR, instead of exporting the symbols as 'int's. Version 3.35 - 26 June 2013 (1st beta release was on 24 May) - fixed problem with the default tile size when compressing images with fpack using the Hcompress algorithm. - fixed returned value ("status" instead of "*status") - in imcompress.c, declared some arrays that are used to store the dimensions of the image from 'int' to 'long', to support very large images (at least on systems where sizeof(long) = 8), - modified the routines that convert a string value to a float or double to prevent them from returning a NaN or Inf value if the string is "NaN" or "Inf" (as can happen with gcc implementation of the strtod function). - removed/replaced the use of the assert() functions when locking or unlocking threads because they did not work correctly if NDEBUG is defined. - made modifications to the way the command-line file filters are parsed to 1) remove the 1024-character limit when specifying a column filter, 2) fixed a potential character buffer-overflow risk in fits_get_token, and 3) improved the parsing logic to remove any possible of confusing 2 slash characters ("//") in the string as the beginning of a comment string. - modified configure and Makefile.in so that when building CFITSIO as a shared library on linux or Mac platforms, it will use the SONAME convention to indicate whether each new release of the CFITSIO library is binary-compatible with the previous version. Application programs that link with the shared library will not need to be recompiled as long as the versions are compatible. In practice, this means that the shared library binary file that is created (on Linux systems) will have a name like 'libcfitsio.so.I.J.K', where I is the SONAME version number, J is the major CFITSIO version number (e.g. 3), and K is the minor CFITSIO version number (e.g., 34). Two link files will also be created such that libcfitsio.so -> libcfitsio.so.I, and libcfitsio.so.I -> libcfitsio.I.J.K Application programs will still run correctly with the new version of CFITSIO as long as the 'I' version number remains the same, but the applications will fail to run if the 'I' number changes, thus alerting the user that the application must be rebuilt. - fixed bug in fits_insert_col when computing the new table row width when inserting a '1Q' variable length array column. - modified the image compression routines so that the output compressed image (stored in a FITS binary table) uses the '1Q' variable length array format (instead of '1P') when the input file is larger than 4 GB. - added support for "compression directive" keywords which indicate how that HDU should be compressed (e.g., which compression algorithm to use, what tiling pattern to use, etc.). The values of these keywords will override the compression parameters that were specified on the command line when running the fpack FITS file compression program. - globally changed the variable and/or subroutine name "dither_offset" to "dither_seed" and "quantize_dither" to "quantize_method" so that the names more accurately reflects their purpose. - added support for a new SUBTRACTIVE_DITHER_2 method when compressing floating point images. The only difference with the previous method is that pixels with a value exactly equal to 0.0 will not be dithered, and instead will be exactly preserved when the image is compressed. - added support for an alias of "RICE_ONE" for "RICE_1" as the value of the ZCMPTYPE keyword, which gives the name of the image compression algorithm. This alias is used if the new SUBTRACTIVE_DITHER_2 option is used, to prevent old versions of funpack from creating a corrupted uncompressed image file. Only newer versions of funpack will recognize this alias and be able to uncompress the image. - made performance improvement to fits_read_compressed_img so that when reading a section of an compressed image that includes only every nth pixel in some dimension, it will only uncompressed a tile if there are actually any pixels of interest in that tile. - fixed several issues with the beta FITS binary table compression code that is used by fpack: added support for zero-length vector columns, made improvements to the output report when using the -T option in fpack, changed the default table compression method to 'Rice' instead of 'Best', and now writes the 'ZTILELEN' keyword to document the number of table rows in each tile. - fixed error in ffbinit in calculating the total length of the binary table extension if the THEAP keyword was used to override the default starting location of the heap. Version 3.34 - 20 March 2013 - modified configure and configure.in to support cross-compiled cfitsio as a static library for Windows on a Linux platform using MXE (http://mxe.cc) - a build environment for mingw32. (contributed by Niels Kristian Bech Jensen) - added conditional compilation statementsfor the mingw32 environment in drvrfile.c because mingw32 does not include the ftello and fseeko functions. (contributed by Niels Kristian Bech Jensen) - fixed a potential bug in ffcpcl (routine to copy a column from one table to another table) when dealing with the rare case of a '0X' column (zero length bit column). - fixed an issue in the routines that update or modify string-valued keyword values, as a result of the change to ffc2s in the previous release. These routines would exit with a 204 error status if the current value of the keyword to be updated or modified is null. - fixed typo in the previous modification that was intended to ignore numerical overflows in Hcompress when decompressing an image. - moved the 'startcol' static variable out of the ffgcnn routine and instead added it as a member of the 'FITSfile' structure that is defined in fitsio.h. This removes a possible race condition in ffgcnn in multi-threaded environments. Version 3.33 - 14 Feb 2013 - modified the imcomp_decompress_tile routine to ignore any numerical overflows that might occur when using Hcompress to decompress the image. If Hcompress is used in its 'lossy' mode, the uncompressed image pixel values may slightly exceed the range of an integer*2 variable. This is generally of no consequence, so we can safely ignore any overflows in this case and just clip the values to the legal range. - the default tiling pattern when writing a tile-compressed image has been changed. The old behavior was to compress the whole image as one single large tile. This is often not optimal when dealing with large images, so the new default behavior is to treat each row of the image as one tile. This is the same default behavior as in the standalone fpack program. The default tile size can be overridden by calling fits_set_tile_dim. - fixed bug that resulted in a corrupted output FITS image when attempting to write a float or double array of values to a tile-compressed integer data type image. CFITSIO does not support implicit data type conversion in this case and now correctly returns an appropriate error status. - modified ricecomp.c to define the nonzero_count lookup table as an external variable, rather then dynamically allocating it within the 3 routines that use it. This simplifies the code and eliminates the need for special thread locking and unlocking statements. (Thanks to Lars Kr. Lundin for this suggestion). - modified how the uncompressed size of a gzipped file is computed in the mem_compress_open routine in drvrmem.c. Since gzip only uses 4 bytes in the compressed file header to store the original file size, one may need to apply a modulo 2^32 byte correction in some cases. The logic here was modified to allow for corner cases (e.g., very small files, and when running on 32-bit platforms that do not support files larger than 2^31 bytes in size). - added new public routine to construct a 80 keyword record from the 3 input component strings, i.e, the keyword name string, the value string, and the comment string: fits_make_key/ffmkky. (This was already an undocumented internal routine in previous versions of CFITSIO). - modified ffc2s so that if the input keyword value string is a null string, then it will return a VALUE_UNDEFINED (204) status value. This makes it consistent with the behavior when attempting to read a null keyword (which has no value) as a logical or as a number (which also returns the 204 error). This should only affect cases where the header keyword does not have an equal sign followed by a space character in columns 9 and 10 of the header record. - Changed the "char *" parameter declarations to "const char *" in many of the routines (mainly the routines that modify or update keywords) to avoid compiler warnings or errors from C++ programs that tend to be more rigorous about using "const char *" when appropriate. - added support for caching uncompressed image tiles, so that the tile does not need to be uncompressed again if the application program wants to read more data from the same tile. This required changes to the main FITS file structure that is defined in fitsio.h, as well as changes to imcompress.c. - enhanced the previous modification to drvrfile.c to handle additional user cases when running in the HEASARC's Hera environment. Version 3.32 - Oct 2012 - fixed flaw in the way logical columns (TFORM = 'L') in binary tables were read which caused an illegal value of 1 in the column to be interpreted as a 'T' (TRUE) value. - extended the column filtering syntax in the CFITSIO file name parser to enable users and scripts to append new COMMENT or HISTORY keyword into the header of the filtered file (provided by Craig Markwardt). For example, fcopy "infile.fits[col #HISTORY='Processed on 2012-10-05']" outfile.fits will append this header keyword: "HISTORY Processed on 2012-10-05" - small change to the code that opens and reads an ASCII region file to return an error if the file is empty. - fixed obscure sign propagation error when attempting to read the uncompressed size of a gzipped FITS file. This resulted in a memory allocation error if the gzipped file had an uncompressed file size between 2^31 and 2^32 bytes. Fix supplied by Gudlaugur Johannesson (Stanford). Version 3.31 - 18 July 2012 - enhanced the CFITSIO column filtering syntax to allow the comma, in addition to the semi-colon, to be used to separate clauses, for example: [col X,Y;Z = max(X,Y)]. This was done because users are not allowed to enter the semi-colon character in the on-line Hera data processing system due to computer security concerns. - enhanced the CFITSIO extended filename syntax to allow specifying image compression parameters (e.g. '[compress Rice]') when opening an existing FITS file with write access. The specified compression parameters will be used by default if more images are appended to the existing file. - modified drvrfile.c to do additional file security checks when CFITSIO is running within the HEASARC's Hera software system. In this case CFITSIO will not allow FITS files to be created outside of the user's individual Hera data directory area. - fixed an issue in fpack and funpack on Windows machines, caused by the fact that the 'rename' function behaves differently on Windows in that it does not clobber an existing file, as it does on Unix platforms. - fixed bug in the way byte-swapping was being performed when writing integer*8 null values to an image or binary table column. - added the missing macro definition for fffree to fitsio.h. - modified the low level table read and write functions in getcol*.c and putcol*.c to remove the 32-bit limitation on the number of elements. These routines now support reading and writing more than 2**31 elements at one time. Thanks to Keh-Cheng Chu (Stanford U.) for the patch. - modified Makefile.in so that the shared libcfitsio.so is linked against pthreads and libm. Version 3.30 - 11 April 2012 Enhancements - Added new routine called fits_is_reentrant which returns 1 or 0 depending on whether or not CFITSIO was compiled with the -D_REENTRANT directive. This can be used to determine if it is safe to use CFITSIO in multi-threaded programs. - Implemented much faster byte-swapping algorithms in swapproc.c based on code provided by Julian Taylor at ESO, Garching. These routines significantly improve the FITS image read and write speed (by more than a factor of 2 in some cases) on little-endian machines (e.g., Linux and Microsoft Windows and Macs running on x86 CPUs) where byte-swapping is required when reading and writing data in FITS files. This has no effect on big-endian machines (e.g. Motorola CPUs and some IBM systems). Even faster byte-swapping performance can be achieved in some cases by invoking the new "--enable-sse2" or "--enable-ssse3" configure options when building CFITSIO on machines that have CPUs and compilers that support the SSE2 and SSSE3 machine instructions. - added additional support for implicit data type conversion in cases where the floating point image has been losslessly compressed with gzip. The pixels in these compressed images can now be read back as arrays of short, int, and long integers as well as single and double precision floating-point. - modified fitsio2.h and f77_wrap.h to recognize IBM System z mainframes by testing if __s390x__ or __s390__ is defined. - small change to ffgcrd in getkey.c so that it supports reading a blank keyword (e.g., a keyword whose name simply contains 8 space characters). Bug Fixes - fixed a bug in imcomp_decompress_tile that caused the tile-compressed image to be uncompressed incorrectly (even though the tile-compressed image itself was written correctly) under the following specific conditions: - the original FITS image has a "float" datatype (R*4) - one or more of the image tiles cannot be compressed using the standard quantization method and instead are losslessly compressed with gzip - the pixels in these tiles are not all equal to zero (this bug does affect tiles where all the pixels are equal to zero) - the program that is reading the compressed image uses CFITSIO's "implicit datatype conversion" feature to read the "float" image back into an array of "double" pixel values. If all these conditions are met, then the returned pixel values in the affected image tiles will be garbage, with values often ranging up to 10**34. Note that this bug does not affect the fpack/funpack programs, because funpack does not use CFITSIO's implicit datatype conversion feature when uncompressing the image. Version 3.29 - 2 December 2011 Enhancements - modified Makefile.in to allow configure to override the lib and include destination directories. - added (or restored actually) support for tile compression of 1-byte integer images in imcomp_compress_tile. Support for that data type was overlooked during recent updates to this routine. - modified the fits_get_token command-line parsing routine to perform more rigorous checks to determine if the token can be interpreted as a number or not. - made small modification to fpack.c to not allow the -i2f option (convert image from integer to floating point) with the "-g -q 0" option (do lossless gzip compression). It is more efficient to simply use the -g option alone. - made modifications to fitsio.h and drvrfile.c to support reading and writing large FITS files (> 2.1 GB) when building CFITSIO using Microsoft Visual C++ on Windows platforms. - added new WCS routine (ffgicsa) which returns the WCS keyword values for a particular WCS version ('A' - 'Z'). Bug Fixes - fixed a problem with multi-threaded apps that open/close FITS files simultaneously by putting mutex locks around the call to fits_already_open and in fits_clear_Fptr. - fixed a bug when using the 'regfilter' function to select a subset of the rows in a FITS table that have coordinates that lie within a specified spatial region on the sky. This bug only affects the rarely used panda (and epanda and bpanda) region shapes in which the region is defined by the intersection of an annulus and a pie-shaped wedge. The previous code (starting with version 3.181 of CFITSIO where support for the panda region was first introduced) only worked correctly if the 2 angles that define the wedge have values between -180 and +180. If not, then fewer rows than expected may have been selected from the table. - fixed the extended filename parser so that when creating a histogram by binning 2 table columns, if a keyword or column name is given as the weighting factor, then the output histogram image will have a floating point datatype, not the default integer datatype as is the case when no weight is specified (e.g. with a filename like "myfile.fits[bin x,y; weight_column]" - added fix to the code in imcompress.c to work around a problem with dereferencing the value of a pointer, in cases where the address of that pointer has not been defined (e.g., the nulval variable). - modified the byte shuffling algorithm in fits_shuffle_8bytes to work around a strange bug in the proprietary SunStudioExpress C compiler under OpenSolaris. - removed spurious messages on the CFITSIO error stack when opening a FITS file with FTP (in drvrnet.c); Version 3.28 - 12 May 2011 - added an enhancement to the tiled-image compression method when compressing floating-point image using the standard (lossy) quantization method. In cases where an image tile cannot be quantized, The floating-point pixel values will be losslessly compressed with gzip before writing them to the tile- compressed file. Previously, the uncompressed pixel values would have been written to the file, which obviously requires more disk space. - made significant internal changes to the structure of the tile compression and uncompression routines in imcompress.c to make them more modular and easier to maintain. - modified configure.in and configure to force it to build a Universal binary on Mac OS X. - modified the ffiter function in putcol.c to properly clean up allocated memory if an error occurs. - in quantize.c, when searching for the min and max values in a float array, initialize the max value to -FLT_MAX instead of FLT_MIN (and similarly for double array). Version 3.27 - 3 March 2011 Enhancements - added new routines fits_read_str and fits_delete_str which read or delete, respectively, a header keyword record that contains a specified character string. - added a new routine called fits_free_memory which frees the memory that fits_read_key_longstr allocated for the long string keyword value. - enhanced the ffmkky routine in fitscore.c to not put a space before the equals sign when writing long string-valued keywords using the ESO HIERARCH keyword convention, if that extra character is needed to fit the length of the keyword name + value string within the 80-character FITS keyword record. - made small change to fits_translate_keyword to support translation of blank keywords (where the name = 8 blank characters) - modified fpack so that it uses the minimum of the 2nd, 3rd, and 5th order MAD noise values when quantizing and compressing a floating point image. This is more conservative than just using the 3rd order MAD value alone. - added new routine imcomp_copy_prime2img to imcompress.c that is used by funpack to copy any keywords that may have been added to the primary array of the compressed image file (a null image) back into the header of the uncompressed image. - enhanced the fits_quantize_float and fits_quantize_double routines in quantize.c to also compress the tile if it is completely filled with null values. Previously, this type of tile would have been written to the output compressed image without any compression. - enhanced imcomp_decompress_tile to support implicit datatype conversion when reading a losslessly compressed (with gzip) real*4 image into an array of real*8 values. - in imcompress.c, removed possible attempt to free memory that had not been allocated. Version 3.26 - 30 December 2010 Enhancements - defined 2 new macros in fitsio.h: #define CFITSIO_MAJOR 3 #define CFITSIO_MINOR 26 These may be used within other macros to detect the CFITSIO version number at compile time. - modified group.c to initialize the output URL to a null string in fits_url2relurl. Also added more robust tests to see if 2 file pointers point to the same file. - enhanced the template keyword parsing code in grparser.c to support the 'D' exponent character in the ASCII representation of floating point keyword values (as in TVAL = 1.23D03). Previously, the parser would have written this keyword with a string value (TVAL = '1.23D03'). - modified the low-level routines that write a keyword record to a FITS header so that they silently replace any illegal characters (ASCII values less than 32 or greater than 126) with an ASCII space character. Previously, these routines would have returned with an error when encountering these illegal characters in the keyword record (most commonly tab, carriage return, and line feed characters). - made substantial internal changes to imcompress.c in preparation for possible future support for compression methods for FITS tables analogous to the tiled image compression method. - replaced all the source code in CFITSIO that was distributed under the GNU General Public License with freely available code. In particular, the gzip file compression and uncompression code was replaced by the zlib compression library. Thus, beginning with this version 3.26 of CFITSIO, other software applications may freely use CFITSIO without necessarily incurring any GNU licensing requirement. See the License.txt file for the CFITSIO licensing requirements. - added support for using cfitsio in different 'locales' which use a comma, not a period, as the decimal point character in ASCII representation of a floating point number (e.g., France). This affects how floating point keyword values and floating point numbers in ASCII tables are read and written with the 'printf' and 'strtod' functions. - added a new utility routine called fits_copy_rows/ffcprw that copies a specified range of rows from one table to another. - enhanced the test for illegal ASCII characters in a header (fftrec) to print out the name of the offending character (e.g TAB or Line Feed) as well as the Hex value of the character. - modified ffgtbc (in fitscore.c) to support nonstandard vector variable length array columns in binary tables (e.g. with TFORMn = 2000PE(500)'). - modified the configure file to add "-lm" when linking CFITSIO on Solaris machines. - added new routine, fits_get_inttype, to parse an integer keyword value string and return the minimum integer datatype (TBYTE, TSHORT, TLONG, TLONGLONG) required to store the integer value. - added new routine, fits_convert_hdr2str, which is similar to fits_hdr2str except that if the input HDU is a tile compressed image (stored in a binary table) then it will first convert that header back to that of a normal uncompressed FITS image before concatenating the header keyword records. - modified the file template reading routine (ngp_line_from_file in grparser.c) so that it ignores any carriage return characters (\r) in the line, that might be present, e.g. if the file was created on a Windows machine that uses \r\n as end of line characters. - modified the ffoptplt routine in cfileio.c to check if the PCOUNT keyword in the template file has a non-zero value, and if so, resets it to zero in the newly created file. Bug Fixes - fixed a bug when uncompressing floating-point images that contain Nan values on some 64-bit platforms. - fixed a bug when updating the value of the CRPIXn world coordinate system keywords when extracting a subimage from larger FITS image, using the extended CFITSIO syntax (e.g. myimage[1:500:2, 1:500:2]). This bug only affects cases where the pixel increment value is not equal to 1, and caused the coordinate grid to be shifted by between 0.25 pixels (in the case of a pixel increment of 2) and 0.5 pixels (for large pixel increment values). - fixed a potential string buffer overflow error in the ffmkls routine that modifies the value and comment strings in a keyword that uses the HEASARC long string keyword convention. - fixed a bug in imcompress.c that could cause programs to abort on 64-bit machines when using gzip to tile-compress images. Changed the declaration of clen in imcomp_compress_tile from int to size_t. Version 3.25 - 9 June 2010 - fixed bug that was introduced in version 3.13 that broke the ability to reverse an image section along the y-axis with an image section specifier like this: myimage.fits[*,-*]. This bug caused the output image to be filled with zeros. - fixed typo in the definition of the ftgprh Fortran wrapper routine in f77_wrap3.c. - modified the cfitsio.pc.in configuration file to make the lib path a variable instead of hard coding the path. The provides more flexibility for projects such as suse and fedora when building CFITSIO. - fixed bug in imcomp_compress_tile in imcompress.c which caused null pixel values to be written incorrectly in the rare case where the floating-point tile of pixels could not be quantized into integers. - modified imcompress.c to add a new specialized routine to uncompress an input image and then write it to a output image on a tile by tile basis. This appears to be faster than the old method of uncompressing the whole image into memory before writing it out. It also supports large images with more than 2**31 pixels. - made trivial changes to 2 statements in drvrfile.c to suppress nuisance compiler warnings. - some compilers define CLOCKS_PER_SEC as a double instead of an integer, so added an explicit integer type conversion to 2 statements in imcompress.c that used this macro. - removed debugging printf statements in drvrnet.c (15 July) Version 3.24 - 26 January 2010 - modified fits_translate_keywords so that it silently ignores any illegal ASCII characters in the value or comment fields of the input FITS file. Otherwise, fpack would abort without compressing input files that contained this minor violation of the FITS rules. - added support for Super H cpu in fitsio2.h - updated funpack to correctly handle the -S option, and to use a more robust algorithm for creating temporary output files. - modified the imcomp_compress_tile routine to support the NOCOMPRESS debugging option for real*4 images. Version 3.23 - 7 January 2010 - reduced the default value for the floating point image quantization parameter (q) from 16 to 4. This parameter is used when tile compressing floating point images. This change will increase the average compression ratio for floating point images from about 4.6 to about 6.5 without losing any significant information in the image. - enhanced the template keyword parsing routine to reject a header template string that only contains a sequence of dashes. - enhanced the ASCII region file reading routine to allow tabs as well as spaces between fields in the file. - got rid of bogus error message when calling fits_update_key_longstr - Made the error message more explicit when CFITSIO tries to write to a GZIP compressed file. Instead of just stating "cannot write to a READONLY file", it will say "cannot write to a GZIP compressed file". Version 3.22 - 28 October 2009 - added an option (in imcompress.c) to losslessly compress floating point images, rather than using the default integer scaling method. This option is almost never useful in practice for astronomical images (because the amount of compression is so poor), but it has been added for test comparison purposes. - enhanced the dithering option when quantizing and compressing floating point images so that a random dithering starting point is used, so that the same dithering pattern does not get used for every image. - modified the architecture setup section of fitsio2.h to support the 64-core 8x8-architecture Tile64 platform (thanks to Ken Mighell, NOAO) Fixes - fixed a problem that was introduced in version 3.13 of CFITSIO in cases where a program writes it own END keyword to the header instead of letting CFITSIO do it, as is strongly recommended. In one case this caused CFITSIO to rewrite the END keyword and any blank fill keywords in the header many times, causing a noticeable slow-down in the FITS file writing speed. Version 3.21 - 24 September 2009 - fixed bug in cfileio.c that caused CFITSIO to crash with a bus error on Mac OS X if CFITSIO was compiled with multi-threaded support (with the --enable-reentrant configure option). The Mac requires an additional thread initialization step that is not required on Linux machines. Even with this fix, occasional bus errors have been seen on some Mac platforms, The bus errors are seen when running the thread_test.c program. The bus errors are very intermittent, and occur less than about 1% of the time, on the affected platforms. These bus errors have not been seen on Linux platforms. - fixed invalid C comment delimiter ("//*" should have been "/*") in imcompress.c. - Increased the CFITSIO version number string length in fpackutil.c, to fix problem on some platforms when running fpack -V or funpack -V. Also modified the output format of the fpack -L command. Version 3.20 - 31 August 2009 - modified configure.in and configure so that it will build the Fortran interface routines by default, even if no Fortran compiler is found in the user's path. Building the interface routines may be disabled by specifying FC="none". This was done at the request of users who obtained CFITSIO from some other standard linux distributions, where CFITSIO was apparently built in an environment that had no Fortran compiler and hence did not build the Fortran wrappers. - modified ffchdu (close HDU) so that it calls the routine to update the maximum length of variable length table columns in the TFORM values in all cases where the values may have changed. Previously it would not update the values if a value was already specified in the TFORM value. - added 2 new string manipulation functions to the CFITSIO parser (contributed by Craig Markwardt): strmid extracts a substring from a string, and strstr searches for a substring within a string. - removed the code in quantize.c that treated "floating-point integer" images as a special case (it would just do a datatype conversion from float to int, and not otherwise quantize the pixel values). This caused complications with the new subtractive dithering feature. - enhanced the code for converting floating point images to quantized scaled integer prior to tile-compressing them, to apply a random subtractive dithering, which improves the photometric accuracy of the compressed images. - added new internal routine, iraf_delete_file, for use by fpack to delete a pair of IRAF format header and pixel files. - small change in cfileio.c in the way it recognizes an IRAF format .imh file. Instead of just requiring that the filename contain the ".imh" string, that string must occur at the end of the file name. - fixed bug in the code that is used when tile-compressing real*4 FITS images, which quantizes the floating point pixel values into integer levels. The bug would only appear in the fairly rare circumstance of tile compressing a floating point image that contains null pixels (NaNs) and only when using the lossy Hcompress algorithm (with the s parameter not equal to 1). This could cause underflow of low valued pixels, causing them to appear as very large pixel values (e.g., > 10**30) in the compressed image - changed the "if defined" blocks in fitsio.h, fitsio2.h and f77_wrap.h to correctly set the length of long variables on sparc64 machines. Patch contributed by Matthew Truch (U. Penn). - modified the HTTP file access code in drvrnet.c to support basic HTTP authentication, where the user supplies a user name and password. The CFITSIO filename format in this case is: "http://username:password@hostname/..." Thanks to Jochen Liske (ESO) for the suggestion and the code. Version 3.181 (BETA) - 12 May 2009 - modified region.c and region.h to add support for additional types of region shapes that are supported by ds9: panda, epanda, and bpanda. - fixed compiler error when using the new _REENTRANT flag, having to do with the an attempted static definition of Fitsio_Lock in several source files, after declaring it to be non-static in fitsio2.h. Version 3.18 (BETA) - 10 April 2009 - Made extensive changes to make CFITSIO thread safe. Previously, all opened FITS files shared a common pool of memory to store the most recently read or written FITS records in the files. In a multi-threaded environment different threads could simultaneously read or write to this common area causing unpredictable results. This was changed so that every opened FITS file has its own private memory area for buffering the file. Most of the changes were in buffers.c, fitsio.h, and fitsio2.h. Additional changes were made to cfileio.c, mainly to put locks around small sections of code when setting up the low-level drivers to read or write the FITS file. Also, locks were needed around the GZIP compression and uncompression code in compress.c., the error message stack access routine in fitscore.c, the encode and decode routines in fits_hcompress.c and fits_hdecompress.c, in ricecomp.c, and the table row selection and table calculator functions. Also, removed the 'static' declaration of the local variables in pliocomp.c which did not appeared to be required and prevented the routines from being thread safe. As a consequence of having a separate memory buffer for every FITS file (by default, about 115 kB per file), CFITSIO may now allocate more memory than previously when an application program opens multiple FITS files at once. The read and write speed may also be slightly faster, since the buffers are not shared between files. - Added new families of Fortran wrapper routines to read and write values to large tables that have more than 2**31 rows. The arguments that define the first row and first element to read or write must be I*8 integers, not ordinary I*4 integers. The names of these new routines have 'LL' appended to them, so for example, ftgcvb becomes ftgcvbll. Fixes - Corrected an obscure bug in imcompress.c that would have incorrectly written the null values only in the rare case of writing a signed byte array that is then tile compressed using the Hcompress or PLIO algorithm. Version 3.14 - 18 March 2009 Enhancements - modified the tiled-image compression and uncompression code to support compressing unsigned 16-bit integer images with PLIO. FITS unsigned integer arrays are offset by -32768, but the PLIO algorithm does not work with negative integer values. In this case, an offset of 32768 is added to the array before compression, and then subtracted again when reading the compressed array. IMPORTANT NOTE: This change is not backward compatible, so these PLIO compressed unsigned 16-bit integer images will not be read correctly by previous versions of CFITSIO; the pixel values will have an offset of +32768. - minor changes to the fpack utility to print out more complete version information with the -V option, and format the report produced by the -T option more compactly. Fixes - Modified imcomp_compress_image (which is called by fpack) so that it will preserve any null values (NaNs) if the input image has a floating point datatype (BITPIX = -32 or -64). Null values in integer datatype images are handled correctly. - Modified imcomp_copy_comp2img so that it does not copy the ZBLANK keyword, if present, from the compressed image header when uncompressing the image. - Fixed typo in the Fortran wrapper macro for the ftexist function. Version 3.13 - 5 January 2009 Enhancements - updated the typedef of LONGLONG in fitsio.h and cfortran.h to support the Borland compiler which uses the __int64 data type. - added new feature to the extended filename syntax so that when performing a filtering operation on specified HDU, if you add a '#' character after the name or number of the HDU, then ONLY that HDU (and the primary array if the HDU is a table) will be copied into the filtered version of the file in memory. Otherwise, by default CFITSIO copies all the HDUs from the input file into memory. - when specifying a section, if the specified number of dimensions is less than the number of dimensions in the image, then CFITSIO will use the entire dimension, as if a '*' had been specified. Thus [1:100] is equivalent to [1:100,*] when specifying a section of 2 dimensional image. - modified fits_copy_image_section to read/write the section 1 row at a time, instead of the whole section, to reduce memory usage. - added new stream:// drivers for reading/writing to stdin/stdout. This driver is somewhat fragile, but for simple FITS read and write operations this driver streams the FITS file on stdin or stdout without first copying the entire file in memory, as is done when specifying the file name as "-". - slight modification to ffcopy to make sure that the END keyword is correctly written before copying the data. This is required by the new stream driver. - modified ffgcprll, so that when writing data to an HDU, it first checks that the END keyword has been written to the correct place. This is required by the new stream driver. Fixes - fixed bug in ffgcls2 when reading an ASCII string column in binary tables in cases where the width of the column is greater than 2880 characters and when reading more than 1 row at a time. Similar change was made to ffpcls to fix same problem with writing to columns wider than 2880 characters. - updated the source files listed in makepc.bat so that it can be used to build CFITSIO with the Borland C++ compiler. - fixed overflow error in ffiblk that could cause writing to Large Files (> 2.1 GB) to fail with an error status. - fixed a bug in the spatial region code (region.c) with the annulus region. This bug only affected specialized applications which directly use the internal region structure; it does not affect any CFITSIO functions directly. - fixed memory corruption bug in region.c that was triggered if the region file contained a large number of excluded regions. - got rid of a harmless error message that would appear if filtering a FITS table with a GTI file that has zero rows. (eval_f.c) - modified fits_read_rgnfile so that it removes the error messages from the error stack if it is unable to open the region file as a FITS file. (region.c) Version 3.12 - 8 October 2008 - modified the histogramming code so that the first pixel in the binned array is chosen as the reference pixel by default, if no other value is previously defined. - modified ffitab and ffibin to allow a null pointer to the EXTNAME string, when inserting a table with no name. Version 3.11 - 19 September 2008 - optimized the code when tile compressing real*4 images (which get scaled to integers). This produced a modest speed increase. For best performance, one must specify the absolute q quantization parameter, rather than relative to the noise in the tile (which is expensive to compute). - modified the FITS region file reading code to check for NaN values, which signify the end of the array of points in a polygon region. - removed the test for LONGSIZE == 64 from fitsio.h, since it may not be defined. - modified imcompress.c to support unconventional floating point FITS images that also have BSCALE and BZERO keywords. The compressed floating point images are linearly scaled twice in this case. Version 3.10 - 20 August 2008 - fixed a number of cases, mainly dealing with long input file names (> 1024 char), where unsafe usage of strcat and strcpy could have caused buffer overflows. These buffer overflows could cause the application to crash, and at least theoretically, could be exploited by a malicious user to execute arbitrary code. There are no known instances of this type of malicious attack on CFITSIO applications, and the likelihood of such an attack seems remote. None the less, it would be prudent for CFITSIO users to upgrade to this new version to guard against this possibility. - modified some of the routines to define input character string parameters as "const char *" rather than just "char *" to eliminate some compiler warnings when the calling routine passes a constant string to the CFITSIO routine. Most of the changes were to the keyword name argument in the many routines that read or write keywords. - fixed bug when tile-compressing a FITS image which caused all the completely blank keywords in the input header to be deleted from the output compressed image. Also added a feature to preserve any empty FITS blocks in the header (reserved space for future keywords) when compressing or uncompressing an image. - fixed small bug in the way the default tile size is set in imcompress.c. (Fix sent in by Paul Price). - added support for reading FITS format region files (in addition to the ASCII format that was previously supported). Thanks to Keith Arnaud for modifying region.c to do this. Version 3.09 - 12 June 2008 - fixed bug in the calculator function, parse_data, that evaluates expressions then selecting rows or modifying values in table columns. This bug only appeared in unusual circumstances where the calculated value has a null value (= TNULLn). The bug could cause elements to not be flagged as having a null value, or in rare cases could cause valid elements to be flagged as null. This only appears to have affected 64-bit platforms (where size(long) = 8). - fixed typo in imcomp_decompress_tile: call to fffi2r8 should have been to fffi4r8. - in the imcopy_copy_comp2img routine, moved the call to fits_translate_keywords outside of the 'if' statement. This could affect reading compressed images that did not have a EXTNAME keyword in the header. - fixed imcomp_compress_tile in imcompress.c to properly support writing unsigned integers, in place, to tile compressed images. - modified fits_read_compressed_img so that if the calling routine specifies nullval = 0, then it will not check for null-valued pixels in the compressed FITS image. This mimics the same behavior when reading normal uncompressed FITS images. Version 3.08 - 15 April 2008 - fixed backwards compatibility issue when uncompressing a Rice compressed image that was created with previous versions of CFITSIO (this late fix was added on May 18). - small change to cfortran.h to add "extern" to the common block definition. This was done for compatibility with the version of cfortran.h that is distributed by the Debian project. - relaxed the requirement that a string valued keyword must have a closing quote character. If the quote is missing, CFITSIO will silently append a quote at the end of the keyword record. This change was made because otherwise it is very difficult to correct the keyword because CFITSIO would exit with an error before making the fix. - added a new BYTEPIX compression parameter when tile-compressing images with the Rice algorithm. - cached the NAXIS and NAXISn keyword values in the fitsio structure for efficiency, to eliminate duplicates reads of these keywords. - added variants of the Rice compression and uncompression routines to support short int images (in addition to the routines that support int). - moved the definition of LONGLONG_MIN and LONGLONG_MAX from fitsio2.h to fitsio.h, to make it accessible to application programs. - make efficiency improvements to fitscore.c, to avoid needless searches through the entire header when reading the required keywords that must be near the beginning of the header. - made several improvements to getcol.c to optimize reading of compressed and uncompressed images. - changed the compression level in the gzip code from 6 to 1. In most cases this will provide nearly the same amount of compression, but is significantly faster in some cases. - added new "helper routines' to imcompress.c to allow applications to specified the "quantize level" and Hcompress scaling and smoothing parameters - modified the extended filename syntax to support the "quantize level" and Hcompress scaling and smoothing parameters. The parser in cfileio.c was extensively modified. - extensive changes to quantize.c: - replace the "nbits" parameter with "quantize level" - the quantize level is now relative to the RMS noise in the image - the HCOMPRESS scale factor is now relative to the RMS noise - added routines to calculate RMS noise in image (these changes require a change to the main file structure in fitsio.h) - initialize errno = 0 before the call to strtol in ffext, in case errno has previously been set by an unrelated error condition. - added the corresponding long name for the ffgkyjj routine to longnam.h. - changed imcomp_copy_comp2img (in imcompress.c) to not require the presence of the EXTNAME keyword in the input compressed image header. - modified imcompress.c to only write the UNCOMPRESSED_DATA column in tile-compressed images if it is actually needed. This eliminates the need to subsequently delete the column if it is not used (which is almost always the case). - found that it is necessary to seek to the EOF of a file after truncating the size of the file, to reestablish a definite current location in the file. The required small changes to 3 routines: file_truncate (to seek to EOF) and fftrun (to set io_pos) and the truncation routine in drvrmem.c. - improved the efficiency when compressing integer images with gzip. Previously, the image was always represented using integer*4 pixels, which were then compressed. Now, if the range of pixel values can be represented with integer*2 pixels or integer*1 pixels, then that is used. This change is backward compatible with any compressed images that used the previous method. - changed the default tiling pattern when using Hcompress from large squares (200 to 600 pixels wide) to 16 rows of the image. This generally requires less memory, compresses faster, and is more consistent with the default row by row tiling when using the other compression methods. - modified imcomp_init_table in imcompress.c to enforce a restriction when using the Hcompress algorithm that the 1st 2 dimensions of sll image tiles must be at least 4 pixels long. Hcompress becomes very inefficient for smaller dimensions, and does not work at all with 1D images. - fixed bug in the Hcompress compression algorithm that could affect compression of I*4 images, using non-square compression tiles (in the encode64 routine). Version 3.07 - 6 December 2007 (internal release) - fixed bug with the PLIO image compression routine which silently produced a corrupted compressed image if the uncompressed image pixels were not all in the range 0 to 2**24. (fixed in November) - fixed several 'for' loops in imcompress.c which were exceeding the bounds of an array by 1. (fixed in November) - fixed a possible, but unlikely, memory overflow issue in iraffits.c. - added a clarification to the cfortran.doc file that cfortran.h may be used and distributed under the terms of the GNU Library General Public License. - fixed bug in the fits_modify_vector_len routine when modifying the vector length of a 'X' bit column. Version 3.06 - 27 August 2007 - modified the imcopy.c utility program (to tile-compress images) so that it writes the default EXTNAME = 'COMPRESSED_IMAGE' keyword in the compressed images, to preserve the behavior of earlier versions of imcopy. - modified the angsep function in the FITS calculator (in eval.y) to use haversines, instead of the 'law of cosines', to provide more precision at small angles (< 0.1 arcsec). Version 3.05 - July 2007 (internal release only) - extensive changes to imcompress.c to fully support implicit data type conversion when reading and writing arrays of data to FITS images, where the data type of the array is not the same as the data type of the FITS image. This includes support for null pixels, and data scaling via the BSCALE and BZERO keywords. - rewrote the fits_read_tbl_coord routine in wcssub.c, that gets the standard set of WCS keywords appropriate to a pair of columns in a table, to better support the full set of officially approved WCS keywords. - made significant changes to histo.c, which creates an image by binning columns of a table, to better translate the WCS keywords in the table header into the WCS keywords that are appropriate for an image HDU. - modified imcompress.c so that when pixels are written to a tile-compressed image, the appropriate BSCALE and BZERO values of that image are applied. This fixes a bug in which writing to an unsigned integer datatype image (with BZERO = 32768) was not done correctly. Version 3.04 - 3 April 2007 - The various table calculator routines (fits_select_rows, etc.) implicitly assumed that the input table has not been modified immediately prior to the call. To cover cases where the table has been modified a call to ffrdef has been added to ffprs. IN UNUSUAL CASES THIS CHANGE COULD CAUSE CFITSIO TO BEHAVE DIFFERENTLY THAN IN PREVIOUS VERSIONS. For example, opening a FITS table with this column-editing virtual file expression: myfile.fits[3][col A==X; B = sqrt(X)] no longer works, because the X column does not exist when the sqrt expression is evaluated. The correct expression in this case is myfile.fits[3][col A==X; B = sqrt(A)] - modified putkey.c to support USHORT_IMG when calling fits_create_img to create a signed byte datatype image. - enhanced the column histogramming function to propagate any TCn_k and TPn_k keywords in the table header to the corresponding CDi_j and PCi_j keywords in the image header. - enhanced the random, randomn, and randomp functions in the lexical parser to take a vector column name argument to specify the length of the vector of random numbers that should be generated (provided by Craig Markwardt, GSFC) - enhanced the ffmcrd routine (to modify an existing header card) to support long string keywords so that any CONTINUE keywords associated with the previous keyword will be deleted. - modified the ffgtbp routine to recognize the TDIMn keyword for ASCII string columns in a binary table. The first dimension is taken to be the size of a unit string. (The TFORMn = 'rAw' syntax may also be used to specify the unit string size). - in fits_img_decompress, the fits_get_img_param function was called with an invalid dimension size, which caused a fatal error on at least 1 platform. - in ffopentest, set the status value before returning in case of error. - in the drvrnet.c file, the string terminators needed to be changed from "\n" to "\r\n" to support the strict interpretation of the http and ftp standard that is enforced by some newer web servers. Version 3.03 - 11 December 2006 New Routine - fits_write_hdu writes the current HDU to a FILE stream (e.g. stdout). Changes - modified the region parsing code to support region files where the keyword "physical" is on a separate line preceding the region shape token. (However, "physical" coordinates are not fully supported, and are treated identically to "image" coordinates). - enhanced the iterator routines to support calculations on 64-bit integer columns and images. Currently, the values are cast to double precision when doing the calculations, which can cause a loss of precision for integer values greater than about 2**52. - added support for accessing FITS files on the computational grid. Giuliano Taffoni and Andrea Barisani, at INAF, University of Trieste, Italy, implemented the necessary I/O driver routines in drvrgsiftp.c. - modified the tiled image compression/uncompression routines to preserve/restore the original CHECKSUM and DATASUM keywords if they exist. (saved as ZHECKSUM and ZDATASUM in the compressed image) - split fits_select_image_section into 2 routines: a higher level routine that creates the output file and copies other HDUs from the input file to the output file, and a lower level routine that extracts the image section from the input image into an output image HDU. - Improved the error messages that get generated if one tries to use the lexical parser to perform calculations on variable-length array columns. - added "#define MACHINE NATIVE" in fitsio2.h for all machines where BYTESWAPPED == FALSE. This may improve the file writing performance by eliminating the need to allocate a temporary buffer in some cases. - modified the configure.in and configure script to fix problems with testing if network services are available, which affects the definition of the HAVE_NET_SERVICES flag. - added explicit type casting to all malloc statements, and deleted declarations of unreferenced variables in the image compression code to suppress compiler warnings. - fixed incorrect logic in fitsio2.h in the way it determined if numerical values are byteswapped or not on MIPS and ARM architectures. - added __BORLANDC__ to the list of environments in fitsio.h that don't use %lld in printf for longlong integers - added "#if defined(unix)" around "#include " statements in several C source files, to make them compatible with Windows. Version 3.02 - 18 Sept 2006 - applied the security patch to the gzip code, available at http://security.FreeBSD.org/patches/SA-06:21/gzip.patch The insufficient bounds checks in buffer use can cause gzip to crash, and may permit the execution of arbitrary code. The NULL pointer deference can cause gzip to crash. The infinite loop can cause a Denial-of-Service situation where gzip uses all available CPU time. - added HCOMPRESS as one of the compression algorithm options in the tiled image compression code. (code provided by Richard White (STScI)) Made other improvements to preserve the exact header structure in the compressed image file so that the compressed-and-then-uncompressed FITS image will be as identical as possible to the original FITS image file. New Routines - the following new routines were added to support reading and writing non-standard extension types: fits_write_exthdr - write required keywords for a conforming extension fits_write_ext - write data to the extension fits_read_ext - read data from the extension - added new routines to compute the RMS noise in the background pixels of an image: fits_rms_float and fits_rms_short (take an input array of floats or shorts, respectively). Fixes - added the missing 64-bit integer case to set of "if (datatype)" statements in the routine that returns information about a particular column (ffgbclll). - fixed a parsing error in ffexts in cases where an extension number is followed by a semi-colon and then the column and row number of an array in a binary table. Also removed an extraneous HISTORY keyword that was being written when specifying an input image in a table cel. - modified the routine that reads a table column returning a string value (ffgcls) so that if the displayed numerical value is too wide to fit in the specified length string, then it will return a string of "*" characters instead of the number string. - small change to fitsio.h to support a particular Fortran and C compiler combination on a SGI Altix system - added a test in the gunzip code to prevent seg. fault when trying to uncompress a corrupted file (at least in some cases). - fixed a rarely-occurring bug in the routine that copies a table cell into an image; had to call the ffflsh call a few lines earlier. Version 3.01 - (in FTOOLS 6.1 release) - modified fits_copy_image2cell to correctly copy all the appropriate header keywords when copying an image into a table cell - in eval.y, explicitly included the code for the lgamma function instead of assuming it is available in a system library (e.g., the lgamma function is currently not included in MS Visual++ libraries) - modified the logic in fits_pixel_filter so that the default data type of the output image will be promoted to at least BITPIX = -32 (a single precision floating point) if the expression that is being evaluated resolves to a floating point result. If the expression resolves to an integer result, the output image will have the same BITPIX as the input image. - in fits_copy_cell2image, added 5 more WCS keywords to the list of keywords related to other columns that should be deleted in the output image header. - disabled code in cfileio.c that would write HISTORY keywords to the output file in fits_copy_image2cell and cell2image, because some tasks would not want these extraneous HISTORY keywords. - added 2 new random number functions to the CFITSIO parser RANDOMN() - produces a normal deviate (mean=0, stddev=1) RANDOMP(X) - produces a Poisson deviate for an expected # of counts X - in f77_wrap.h, removed the restriction that "g77Fortran" must be defined on 64-bit Itanium machines before assuming that sizeof(long) = 8. It appears that "long"s are always 8 bytes long on this machine, regardless of what compilers are used. - added test in fitsio.h so that LONGLONG cannot be multiply defined - modified longnam.h so that both "fits_write_nulrows" and "fits_write_nullrows" get replace by the string "ffprwu". This fixes a documentation error regarding the long name of this routine. Bug fixes - fixed a potential null character string dereferencing error in the the ffphtb and ffphbn routines that write the FITS table keywords. This concerned the optional TUNITn keywords. - fixed a few issues in fits_copy_cell2image and fits_copy_image2cell related to converting some WCS keyword between the image extension form and the table cell form of the keyword. (cfileio.c) - fixed bug in fits_translate_keyword (fitscore.c) that, e.g., caused 'EQUINOX' to be translated to EQUINOXA' if the pattern is 'EQUINOXa' - fixed 2 bugs that could affect 'tile compressed' floating point images that contain NaN pixels (null pixels). First, the ZBLANK keyword was not being written, and second, an integer overflow could occur when computing the BZERO offset in the compressed array. (quantize.c and imcompress.c) Version 3.006 - 20 February 2006 -(first full release of v3) - enhanced the 'col' extended filename syntax to support keyword name expressions like [col error=sqrt(rate); #TUNIT# = 'counts/s'], in which the trailing '#' will be replaced by the column number of the most recently referenced column. - fixed bug in the parse_data iterator work function that caused it to fail to return a value of -1 in cases where only a selected set of rows were to be processed. (affected Fv) - added code to fitsio.h and cfortran.h to typedef LONGLONG to the appropriate 8-byte integer data type. Most compilers now support the 'long long' data type, but older MS Visual C++ compilers used '__int64' instead. - made several small changes based on testing by Martin Reinecke: o in eval.y, change 'int undef' to 'long undef' o in getcold.c and getcole.c, fixed a couple format conversion specifiers when displaying the value of long long variables. o in fitsio.h, modified the definition of USE_LL_SUFFIX in the case of Athon64 machines. o in fitsio2.h, defined BYTESWAPPED in the case of SGI machines. o in group.c, added 'include unistd.h' to get rid of compiler warning. Version 3.005 - 20 December 2005 (beta) - cfortran.h has been enhanced to support 64-bit integer parameters when calling C routines from Fortran. This modification was kindly provided by Martin Reinecke (MPE, Garching). - Many new Fortran wrapper routines have been added to support reading and writing 64-bit integer values in FITS files. These new routines are documented in the updated version of the 'FITSIO User's Guide' for Fortran programmers. - fixed a problem in the fits_get_keyclass routine that caused it to not recognize the special COMMENT keywords at the beginning of most FITS files that defines the FITS format. - added a new check to the ffifile routine that parses the input extended file name, to distinguish between a FITS extension name that begins with 'pix', and a pixel filtering operator that begins with the 'pix' keyword. - small change to the WCSLIB interface routine, fits_read_wcstab, to be more permissive in allowing the TDIMn keyword to be omitted for degenerate coordinate array. Version 3.004 - 16 September 2005 (3rd public beta release) - a major enhancement to the CFITSIO virtual file parser was provided by Robert Wiegand (GSFC). One can now specify filtering operations that will be applied on the fly to the pixel values in a FITS image. For example [pix sqrt(X)] will create a virtual FITS image where the pixel values are the square root of the input image pixels. - modified region.c so that it interprets the position angles of regions in a SAO style region file in the same way as DS9. In particular, if the region parameters are given in WCS units, then the position angle should be relative to the WCS coordinates of the image (increasing CCW from West) instead of relative to the X/Y pixel coordinate system. This only affects rotated images (e.g. with non-zero CROTA2 keyword) with elliptical or rectangular regions. - cleaned up fitsio.h and fitsio2.h to make the definition of LONGLONG and BYTESWAPPED and MACHINE more logical. - removed HAVE_LONGLONG everywhere since it is no longer needed (the compiler now must have an 8-byte integer datatype to build CFITSIO). - added support for the 64-bit IBM AIX platform - modified eval.y so that the circle, ellipse, box, and near functions can operate on vectors as well as scalars. This allows region filtering on images that are stored in a vector cell in a binary table. (provided by Craig Markwardt, GSFC) New Routines - added new fits_read_wcstab routine that serves as an interface to Mark Calabretta's wcslib library for reading WCS information when the -TAB table lookup convention is used in the FITS file. - added new fits_write_nullrows routine, which writes null values into every column of a specified range of rows in a FITS table. - added the fits_translate_keyword and fits_translate_keywords utility routines for converting the names of keywords when moving columns and images around. - added fits_copy_cell2image and fits_copy_image2cell routines for copying an image extension (or primary array) to or from a cell in a binary table vector column. Bug fixes - fixed a memory leak in eval.y; was fixed by changing a call to malloc to cmalloc instead. - changed the definition of several global variables at the beginning of buffers.c to make them 'static' and thus invisible to applications programs. - in fits_copy_image_cell, added a call to flush the internal buffers before reading from the file, in case any records had been modified. Version 3.003 - 28 July 2005 - 2nd public beta release (used in HEASOFT) Enhancements - enhanced the string column reading routing fits_get_col_str to support cases where the user enters a null pointer (rather than a null string) as the nulval parameter. - modified the low level ffread and ffwrite routines that physically read and write data from the FITS file so that they write the name of the file to the CFITSIO error stack if an error occurs. - changed the definition of fits_open_file into a macro that will test that the version of the fitsio.h include file that was used to build the CFITSIO library is the same version as included when compiling the application program. - made a simple modification to region.c to support regions files of type "linear", for compatibility with ds9 and fv. - modified the internal ffgpr routine (and renamed it ffgprll) so that it returns the TNULL value as a LONGLONG parameter instead of 'long'. - in fits_get_col_display_width, added support for TFORM = 'k' - modified fitsio.h, fitsio2.h, and f77_wrap.h to add test for (_SX) to identify NEC SX supercomputers. - modified eval_f.c to treat table columns of TULONG (unsigned long) as a double. Also added support for TLONGLONG (8-byte integers) as a double, which is only a temporary fix, since doubles only have about 52 bits of precision. - changed the 'blank' parameter in the internal ffgphd function to to type LONGLONG to support integer*8 FITS images. - when reading the TNULL keyword value, now use ffc2jj instead of ffc2ii, to support integer*8 values. Bug fixes - fixed a significant bug when writing character strings to a variable length array column of a binary table. This bug would result in some unused space in the variable length heap, making the heap somewhat larger than necessary. This in itself is usually a minor issue, since the FITS files are perfectly valid, and other software should have no problems reading back the characters strings. In some cases, however, this problem could cause the program that is writing the table to exit with a status = 108 disk read error. - modified the standalone imcopy.c utility program to fix a memory allocation bug when running on 64-bit platforms where sizeof(long) = 8 bytes. - added an immediate 'return' statement to ffgtcl if the input status >0, to prevent a segfault on some platforms. Version 3.002 - 15 April 2005 - first public beta release - in drvrfile.c, if it fails to open the file for some reason, then it should reset file_outfile to a null string, to avoid errors on a subsequent call to open a file. - updated fits_get_keyclass to recognize most of the WCS keywords defined in the WCS Papers I and II. Version 3.001 - 15 March 2005 - released with HEASOFT 6.0 - numerous minor changes to the code to get rid of compiler warning messages, mainly dealing with numerical data type casting and the subsequent possible loss of precision in the result. Version 3.000 - 1 March 2005 (internal beta release) Enhancements: - Made major changes to many of the CFITSIO routines to more generally support Large Files (> 2.1 GB). These changes are intended to be 100% backward compatible with software that used the previous versions of CFITSIO. The datatype of many of the integer parameters in the CFITSIO functions has been changed from 'long' to 'LONGLONG', which is typedef'ed to be equivalent to an 8-byte integer datatype on each platform. With these changes, CFITSIO supports the following: - integer FITS keywords with absolute values > 2**31 - FITS files with total sizes > 2**31 bytes - FITS tables in which the number of rows, the row width, or the size of the heap is > 2**31 bytes - FITS images with dimensions > 2**31 bytes (support is still somewhat limited, with full support to be added later). - added another lexical parser function (thanks to Craig Markwardt, GSFC): angsep computes the angular separation between 2 positions on the celestial sphere. - modified the image subset extraction code (e.g., when specifying an image subregion when opening the file, such as 'myimage.fits[21:40, 81:90]') so that in addition to updating the values of the primary WCS keywords CRPIXk, CDELTi, and CDj_i in the extracted/binned image, it also looks for and updates any secondary WCS keywords (e.g., 'CRPIX1P'). - made cosmetic change to group.c, so that when a group table is copied, any extra columns will be appended after the last existing column, instead of being inserted before the last column. - modified the routines that read tile compressed images to support NULL as the input value for the 'anynul' parameter (meaning the calling program does not want the value of 'anynul' returned to it). - when constructing or parsing a year/month/day character string, (e.g, when writing the DATE keyword) the routines now rigorously verify that the input day value is valid for the given month (including leap years). - added some checks in cfileio.c to detect if some vital parameters that are stored in memory have been corrupted. This can occur if a user's program writes to areas of memory that it did not allocate. - added the wcsutil_alternate.c source code file which contains non-working stubs for the 2 Classic AIPS world coordinate conversion routines that are distributed under the GNU General Public License. Users who are unwilling or unable to distribute their software under the General Public License may use this alternate source file which has no GPL restrictions, instead of wcsutil.c. This will have no effect on programs that use CFITSIO as long as they do not call the fits_pix_to_world/ffwldp or fits_world_to_pix/ffxypx routines. Bug Fixes - in ffdtdm (which parses the TDIMn keyword value), the check for consistency between the length of the array defined by TDIMn and the size of the TFORMn repeat value, is now not performed for variable length array columns (which always have repeat = 1). - fixed byteswapping problem when writing null values to non-standard long integer FITS images with BITPIX = 64 and FITS table columns with TFORMn = 'K'. - fixed buffer overflow problem in fits_parse_template/ffgthd that occurred only if the input template keyword value string was much longer than can fit in an 80-char header record. Version 2.510 - 2 December 2004 New Routines: - added fits_open_diskfile and fits_create_diskfile routines that simply open or create a FITS file with a specified name. CFITSIO does not try to parse the name using the extended filename syntax. - 2 new C functions, CFITS2Unit and CUnit2FITS, were added to convert between the C fitsfile pointer value and the Fortran unit number. These functions may be useful in mixed language C and Fortran programs. Enhancements: - added the ability to recognize and open a compressed FITS file (compressed with gzip or unix compress) on the stdin standard input stream. - Craig Markwardt (GSFC) provided 2 more lexical parser functions: accum(x) and seqdiff(x) that compute the cumulative sum and the sequential difference of the values of x. - modified putcole.c and putcold.c so that when writing arrays of pixels to the FITS image or column that contain null values, and there are also numerical overflows when converting some of the non-null values to the FITS values, CFITSIO will now ignore the overflow error until after all the data have been written. Previously, in some circumstances CFITSIO would have simply stopped writing any data after the first overflow error. - modified fitsio2.h to try to eliminate compiler warning messages on some platforms about the use of 'long long' constants when defining the value of LONGLONG_MAX (whether to use L or LL suffix). - modified region.c to support 'physical' regions in addition to 'image', 'fk4', etc. - modified ffiurl (input filename parsing routine) to increase the maximum allowed extension number that can be specified from 9999 to 99999 (e.g. 'myfile.fits+99999') Bug Fixes: - added check to fits_create_template to force it to start with the primary array in the template file, in case an extension number was specified as part of the template FITS file name. Version 2.500 - 28 & 30 July 2004 New Routine: - fits_file_exists tests whether the specified input file, or a compressed version of the file, exists on disk. Enhancements: - modified the way CFITSIO reads and writes data in COMPLEX ('C') and DBLCOMPLEX 'M' columns. Now, in all cases, when referring to the number of elements in the vector, or the value of the offset to a particular element within the vector, CFITSIO considers each pair of numbers (the imaginary and real parts) as a single element instead of treating each single number as an element. In particular, this changes the behavior of fits_write_col_null when writing to complex columns. It also changes the length of the 'nullarray' vector in the fits_read_colnull routine; it is now only 1/2 as long as before. Each element of the nullarray is set = 1 if either the real or imaginary parts of the corresponding complex value have a null value.(this change was added to version 2.500 on 30 July). - Craig Markwardt, at GSFC, provided a number of significant enhancements to the CFITSIO lexical parser that is used to evaluate expressions: - the parser now can operate on bit columns ('X') in a similar way as for other numeric columns (e.g., 'B' or 'I' columns) - range checking has been implemented, so that the following conditions return a Null value, rather than returning an error: divide by zero, sqrt(negative), arccos(>1), arcsin(>1), log(negative), log10(negative) - new vector functions: MEDIAN, AVERAGE, STDDEV, and NVALID (returns the number of non-null values in the vector) - all the new functions (and SUM, MIN and MAX) ignore null values - modified the iterator to support variable-length array columns - modified configure to support AIX systems that have flock in a non- standard location. - modified configure to remove the -D_FILE_OFFSET_BITS flag when running on Mac Darwin systems. This caused conflicts with the Fortran wrappers, and should only be needed in any case when using CFITSIO to read/write FITS files greater than 2.1 GB in size. - modified fitsio2.h to support compilers that define LONG_LONG_MAX. - modified ffrsim (resize an existing image) so that it supports changing the datatype to an unsigned integer image using the USHORT_IMG and ULONG_IMG definitions. - modified the disk file driver (drvrfile.c) so that if an output file is specified when opening an ordinary file (e.g. with the syntax 'myfile.fits(outputfile.fits)' then it will make a copy of the file, close the original file and open the copy. Previously, the specified output file would be ignored unless the file was compressed. - modified f77_wrap.h and f77_wrap3.c to support the Fortran wrappers on 64-bit AMD Opteron machines Bug fixes: - made small change to ffsrow in eval_f.c to avoid potential array bounds overflow. - made small change to group.c to fix problem where an 'int' was incorrectly being cast to a 'long'. - corrected a memory allocation error in the new fits_hdr2str routine that was added in version 2.48 - The on-the-fly row-selection filtering would fail with a segfault if the length of a table row (NAXIS1 value) was greater than 500000 bytes. A small change to eval_f.c was required to fix this. Version 2.490 - 11 February 2004 Bug fixes: - fixed a bug that was introduced in the previous release, which caused the CFITSIO parser to no longer move to a named extension when opening a FITS file, e.g., when opening myfile.fit[events] CFITSIO would just open the primary array instead of moving to the EVENTS extension. - new group.c file from the INTEGRAL Science Data Center. It fixes a problem when you attach a child to a parent and they are both is the same file, but, that parent contains groups in other files. In certain cases the attach would not happen because it seemed that the new child was already in the parent group. - fixed bug in fits_calculator_rng when performing a calculation on a range of rows in a table, so that it does not reset the value in all the other rows that are not in the range = 0. - modified fits_write_chksum so that it updates the TFORMn keywords for any variable length vector table columns BEFORE calculating the CHECKSUM values. Otherwise the CHECKSUM value is invalidated when the HDU is subsequently closed. Version 2.480 - 28 January 2004 New Routines: - fits_get_img_equivtype - just like fits_get_img_type, except in the case of scaled integer images, it returns the 'equivalent' data type that is necessary to store the scaled data values. - fits_hdr2str copies all the header keywords in the current HDU into a single long character string. This is a convenient method of passing the header information to other subroutines. The user may exclude any specified keywords from the list. Enhancements: - modified the filename parser so that it accepts extension names that begin with digits, as in 'myfile.fits[123TEST]'. In this case CFITSIO will try to open the extension with EXTNAME = '123TEST' instead of trying to move to the 123rd extension in the file. - the template keyword parser now preserves the comments on the the mandatory FITS keywords if present, otherwise a standard default comment is provided. - modified the ftp driver file (drvrnet.c) to overcome a timeout or hangup problem caused by some firewall software at the user's end (Thanks to Bruce O'Neel for this fix). - modified iraffits.c to incorporate Doug Mink's latest changes to his wcstools library routines. The biggest change is that now the actual image dimensions, rather than the physically stored dimensions, are used when converting an IRAF file to FITS. Bug fixes: - when writing to ASCII FITS tables, the 'elemnum' parameter was supposed to be ignored if it did not have the default value of 1. In some cases however setting elemnum to a value other than 1 could cause the wrong number of rows to be produced in the output table. - If a cfitsio calculator expression was imported from a text file (e.g. using the extended filename syntax 'file.fits[col @file.calc]') and if any individual lines in that text file were greater than 255 characters long, then a space character would be inserted after the 255th character. This could corrupt the line if the space was inserted within a column name or keyword name token. Version 2.480beta (used in the FTOOLS 5.3 release, 1 Nov 2003) New Routines: - fits_get_eqcoltype - just like fits_get_coltype, except in the case of scaled integer columns, it returns the 'equivalent' data type that is necessary to store the scaled data values. - fits_split_names - splits an input string containing a comma or space delimited list of names (typically file names or column names) into individual name tokens. Enhancements: - changed fhist in histo.c so that it can make histograms of ASCII table columns as well as binary table columns (as long as they contain numeric data). Bug fixes: - removed an erroneous reference to listhead.c in makefile.vcc, that is used to build the cfitsio dll under Windows. This caused a 'main' routine to be added to the library, which causes problems when linking fortran programs to cfitsio under windows. - if an error occurs when opening for a 2nd time (with ffopen) a file that is already open (e.g., the specified extension doesn't exist), and if the file had been modified before attempting to reopen it, then the modified buffers may not get written to disk and the internal state of the file may become corrupted. ffclos was modified to always set status=0 before calling ffflsh if the file has been concurrently opened more than once. Version 2.470 - 18 August 2003 Enhancements: - defined 'TSBYTE' to represent the 'signed char' datatype (similar to 'TBYTE' that represents the 'unsigned char' datatype) and added support for this datatype to all the routines that read or write data to a FITS image or table. This was implemented by adding 2 new C source code files to the package: getcolsb.c and putcolsb.c. - Defined a new '1S' shorthand data code for a signed byte column in a binary table. CFITSIO will write TFORMn = '1B' and TZEROn = -128 in this case, which is the convention used to store signed byte values in a 'B' type column. - in fitsio2.h, added test of whether `__x86_64__` is defined, to support the new AMD Opteron 64-bit processor - modified configure to not use the -fast compiler flag on Solaris platforms when using the proprietary Solaris cc compiler. This flag causes compilation problems in eval_y.c (compiler just hangs forever). Bug fixes: - In the special case of writing 0 elements to a vector table column that contains 0 rows, ffgcpr no longer adds a blank row to the table. - added error checking code for cases where a ASCII string column in a binary table is greater than 28800 characters wide, to avoid going into an infinite loop. - the fits_get_col_display_width routine was incorrectly returning width = 0 for a 'A' binary table column that did not have an explicit vector length character. Version 2.460 - 20 May 2003 Enhancements: - modified the HTTP driver in drvrnet.c so that CFITSIO can read FITS files via a proxy HTTP server. (This code was contributed by Philippe Prugniel, Obs. de Lyon). To use this feature, the 'http_proxy' environment variable must be defined with the address (URL) and port number of the proxy server, i.e., > setenv http_proxy http://heasarc.gsfc.nasa.gov:3128 will use port 3128 on heasarc.gsfc.nasa.gov - suppressed some compiler warnings by casting a variable of type 'size_t' to type 'int' in fftkey (in fitscore.c) and iraftofits and irafrdimge (in iraffits.c). Version 2.450 - 30 April 2003 Enhancements: - modified the WCS keyword reading routine (ffgics) to support cases where some of the CDi_j keywords are omitted (with an assumed value = 0). - Made a change to http_open_network in drvrnet.c to add a 'Host: ' string to the open request. This is required by newer HTTP 1.1 servers (so-called virtual servers). - modified ffgcll (read logical table column) to return the illegal character value itself if the FITS file contains a logical value that is not equal to T, F or zero. Previously it treated this case the same as if the FITS file value was = 0. - modified fits_movnam_hdu (ffmnhd) so that it will move to a tile- compressed image (that is stored in a binary table) if the input desired HDU type is BINARY_TBL as well as if the HDU type = IMAGE_HDU. Bug fixes: - in the routine that checks the data fill bytes (ffcdfl), the call to ffmbyt should not ignore an EOF error when trying to read the bytes. This is a little-used routine that is not called by any other CFITSIO routine. - fits_copy_file was not reporting an error if it hit the End Of File while copying the last extension in the input file to the output file. - fixed inconsistencies in the virtual file column filter parser (ffedit_columns) to properly support expressions which create or modify a keyword, instead of a column. Previously it was only possible to modify keywords in a table extension (not an image), and the keyword filtering could cause some of the table columns to not get propagated into the virtual file. Also, spaces are now allowed within the specified keyword comment field. - ffdtyp was incorrectly returning the data type of FITS keyword values of the form '1E-09' (i.e., an exponential value without a decimal point) as integer rather than floating point. - The enhancement in the previous 2.440 release to allow more files to be opened at one time introduced a bug: if ffclos is called with a non-zero status value, then any subsequent call to ffopen will likely cause a segmentation fault. The fits_clear_Fptr routine was modified to fix this. - rearranged the order of some computations in fits_resize_img so as to not exceed the range of a 32-bit integer when dealing with large images. - the template parser routine, ngp_read_xtension, was testing for "ASCIITABLE" instead of "TABLE" as the XTENSION value of an ASCII table, and it did not allow for optional trailing spaces in the IMAGE" or "TABLE" string value. Version 2.440 - 8 January 2003 Enhancements: - modified the iterator function, ffiter, to operate on random groups files. - decoupled the NIOBUF (= 40) parameter from the limit on the number FITS files that can be opened, so that more files may be opened without the overhead of having to increase the number of NIOBUF buffers. A new NMAXFILES parameter is defined in fitsio2.h which sets the maximum number of opened FITS files. It is set = 300 by default. Note however, that the underlying compiler or operating system may not allow this many files to be opened at one time. - updated the version of cfortran.h that is distributed with CFITSIO from version 3.9 to version 4.4. This required changes to f77_wrap.h and f77_wrap3.c. The original cfortran.h v4.4 file was modified slightly to support CFITSIO and ftools (see comments in the header of cfortran.h). - modified ffhist so that it copies all the non-structural keywords from the original binary table header to the binned image header. - modified fits_get_keyclass so that it recognizes EXTNAME = COMPRESSED_IMAGE as a special tile compression keyword. - modified Makefile.in to support the standard --prefix convention for specifying the install target directory. Bug fixes: - in fits_decompress_img, needed to add a call to ffpscl to turn off the BZERO and BSCALE scaling when reading the compressed image. Version 2.430 - 4 November 2002 Enhancements: - modified fits_create_hdu/ffcrhd so that it returns without doing anything and does not generate an error if the current HDU is already an empty HDU. There is no need in this case to append a new empty HDU to the file. - new version of group.c (supplied by B. O'Neel at the ISDC) fixes 2 limitations: 1 - Groups now have 256 characters rather than 160 for the path lengths in the group tables. - ISDC SPR 1720. 2 - Groups now can have backpointers longer than 68 chars using the long string convention. - ISDC SPR 1738. - small change to f77_wrap.h and f77_wrap3.c to support the fortran wrappers on SUN solaris 64-bit sparc systems (see also change to v2.033) - small change to find_column in eval_f.c to support unsigned long columns in binary tables (with TZEROn = 2147483648.0) - small modification to cfortran.h to support Mac OS-X, (Darwin) Bug fixes: - When reading tile-compress images, the BSCALE and BZERO scaling keywords were not being applied, if present. - Previous changes to the error message stack code caused the tile compressed image routines to not clean up spurious error messages properly. - fits_open_image was not skipping over null primary arrays. Version 2.420 - 19 July 2002 Enhancements: - modified the virtual filename parser to support exponential notation when specifying the min, max or binsize in a binning specifier, as in: myfile.fits[binr X=1:10:1.0E-01, Y=1:10:1.0E-01] - removed the limitation on the maximum number of HDUs in a FITS file (limit used to be 1000 HDUs per file). Now any number of HDUs can be written/read in a FITS file. (BUT files that have huge numbers of HDUs can be difficult to manage and are not recommended); - modified grparser.c to support HIERARCH keywords, based on code supplied by Richard Mathar (Max-Planck) - moved the ffflsh (fits_flush_buffer) from the private to the public interface, since this routine may be useful for some applications. It is much faster than ffflus. - small change to the definition of OFF_T in fitsio.h to support large files on IBM AIX operating systems. Bug fixes: - fixed potential problem reading beyond array bounds in ffpkls. This would not have affected the content of any previously generated FITS files. - in the net driver code in drvrnet.c, the requested protocol string was changed from "http/1.0" to "HTTP/1.0" to support apache 1.3.26. - When using the virtual file syntax to open a vector cell in a binary table as if it were a primary array image, there was a bug in fits_copy_image_cell which garbled the data if the vector was more than 30000 bytes long. - fixed problem that caused fits_report_error to crash under Visual C++ on Windows systems. The fix is to use the '/MD' switch on the cl command line, or, in Visual Studio, under project settings / C++ select use runtime library multithreaded DLL - modified ffpscl so it does not attempt to reset the scaling values in the internal structure if the image is tile-compressed. - fixed multiple bugs in mem_rawfile_open which affected the case where a raw binary file is read and converted on the fly into a FITS file. - several small changes to group.c to suppress compiler warnings. Version 2.410 - 22 April 2002 (used in the FTOOLS 5.2 release) New Routines: - fits_open_data behaves similarly to fits_open_file except that it also will move to the first HDU containing significant data if and an explicit HDU name or number to open was not specified. This is useful for automatically skipping over a null primary array when opening the file. - fits_open_table and fits_open_image behaves similarly to fits_open_data, except they move to the first table or image HDU in the file, respectively. - fits_write_errmark and fits_clear_errmark routines can be use to write an invisible marker to the CFITSIO error stack, and then clear any more recent messages on the stack, back to that mark. This preserves any older messages on the stack. - fits_parse_range utility routine parses a row list string and returns integer arrays giving the min and max row in each range. - fits_delete_rowrange deletes a specified list of rows or row ranges. - fits_copy_file copies all or part of the HDUs in the input file to the output file. - added fits_insert_card/ffikey to the publicly defined set of routines (previously, it was a private routine). Enhancements: - changed the default numeric display format in ffgkys from 'E' format to 'G' format, and changed the format for 'X' columns to a string of 8 1s or 0s representing each bit value. - modified ffflsh so the system 'fflush' call is not made in cases where the file was opened with 'READONLY' access. - modified the output filename parser so the "-.gz", and "stdout.gz" now cause the output file to be initially created in memory, and then compressed and written out to the stdout stream when the file is closed. - modified the routines that delete rows from a table to also update the variable length array heap, to remove any orphaned data from the heap. - modified ffedit_columns so that wild card characters may be used when specifying column names in the 'col' file filter specifier (e.g., file.fits[col TIME; *RAW] will create a virtual table contain only the TIME column and any other columns whose name ends with 'RAW'). - modified the keyword classifier utility, fits_get_keyclass, to support cases where the input string is just the keyword name, not the entire 80-character card. - modified configure.in and configure to see if a proprietary C compiler is available (e.g. 'cc'), and only use 'gcc' if not. - modified ffcpcl (copy columns from one table to another) so that it also copies any WCS keywords related to that column. - included an alternate source file that can be used to replace compress.c, which is distributed under the GNU General Public License. The alternate file contains non-functional stubs for the compression routines, which can be used to make a version of CFITSIO that does not have the GPL restrictions (and is also less functional since it cannot read or write compressed FITS files). - modifications to the iterator routine (ffiter) to support writing tile compressed output images. - modified ffourl to support the [compress] qualifier when specifying the optional output file name. E.g., file.fit(out.file[compress])[3] - modified imcomp_compress_tile to fully support implicit data type conversion when writing to tile-compressed images. Previously, one could not write a floating point array to an integer compressed image. - increased the number of internal 2880-byte I/O buffers allocated by CFITSIO from 25 to 40, in recognition of the larger amount of memory available on typical machines today compared with a few years ago. The number of buffers can be set by the user with the NIOBUF parameter in fitsio2.h. (Setting this too large can actually hurt performance). - modified the #if statements in fitsio2.h, f77_wrap.h and f77_wrap1.c to support the new Itanium 64-bit Intel PC. - a couple minor modifications to fitsio.h needed to support the off_t datatype on Debian linux systems. - increased internal buffer sizes in ffshft and ffsrow to improve the I/O performance. Bug fixes: - fits_get_keyclass could sometimes try to append to an unterminated string, causing an overflow of a string array. - fits_create_template no longer worked because of improvements made to other routines. Had to modify ffghdt to not try to rescan the header keywords if the file is still empty and contains no keywords yet. - ffrtnm, which returns the root filename, sometimes did not work properly when testing if the 'filename+n' convention was used for specifying an extension number. - fixed minor problem in the keyword template parsing routine, ffgthd which in rare cases could cause an improperly terminated string to be returned. - the routine to compare 2 strings, ffcmps, failed to find a match in comparing strings like "*R" and "ERROR" where the match occurs on the last character, but where the same matching character occurs previously in the 2nd string. - the region file reading routine (ffrrgn) did not work correctly if the region file (created by POW and perhaps other programs) had an 'exclude' region (beginning with a '-' sign) as the first region in the file. In this case all points outside the excluded region should be accepted, but in fact no points were being accepted in this case. Version 2.401 - 28 Jan 2002 - added the imcopy example program to the release (and Makefile) Bug fixes: - fixed typo in the imcompress code which affected compression of 3D datacubes. - made small change to fficls (insert column) to allow colums with TFORMn = '1PU' and '1PV' to be inserted in a binary table. The 'U' and 'V' are codes only used within CFITSIO to represent unsigned 16-bit and 32-bit integers; They get replaced by '1PI' and '1PJ' respectively in the FITS table header, along with the appropriate TZEROn keyword. Version 2.400 - 18 Jan 2002 (N.B.: Application programs must be recompiled, not just relinked with the new CFITSIO library because of changes made to fitsio.h) New Routines: - fits_write_subset/ffpss writes a rectangular subset (or the whole image) to a FITS image. - added a whole new family of routines to read and write arrays of 'long long' integers (64-bit) to FITS images or table columns. The new routine names all end in 'jj': ffpprjj, ffppnjj, ffp2djj, ffp3djj, ffppssjj, ffpgpjj, ffpcljj, ffpcnjj. ffgpvjj, ffgpfjj, ffg2djj, ffg3djj, ffgsvjj, ffgsfjj, ffggpjj, ffgcvjj, and ffgcfjj. - added a set of helper routines that are used in conjunction with the new support for tiled image compression. 3 routines set the parameters that should be used when CFITSIO compresses an image: fits_set_compression_type fits_set_tile_dim fits_set_noise_bits 3 corresponding routines report back the current settings: fits_get_compression_type fits_get_tile_dim fits_get_noise_bits Enhancements: - major enhancement was made to support writing to tile-compressed images. In this format, the image is divided up into a rectangular grid of tiles, and each tile of pixels is compressed individually and stored in a row of a variable-length array column in a binary table. CFITSIO has been able to transparently read this compressed image format ever since version 2.1. Now all the CFITSIO image writing routines also transparently support this format. There are 2 ways to force CFITSIO to write compressed images: 1) call the fits_set_compression_type routine before writing the image header keywords, or 2), specify that the image should be compressed when entering the name of the output FITS file, using a new extended filename syntax. (examples: "myfile.fits[compress]" will use the default compression parameters, and "myfile.fits[compress GZIP 100,100] will use the GZIP compression algorithm with 100 x 100 pixel tiles. - added new driver to support creating output .gz compressed fits files. If the name of the output FITS file to be created ends with '.gz' then CFITSIO will initially write the FITS file in memory and then, when the FITS file is closed, CFITSIO will gzip the entire file before writing it out to disk. - when over-writing vectors in a variable length array in a binary table, if the new vector to be written is less than or equal to the length of the previously written vector, then CFITSIO will now reuse the existing space in the heap, rather than always appending the new array to the end of the heap. - modified configure.in to support building cfitsio as a dynamic library on Mac OS X. Use 'make shared' like on other UNIX platforms, but a .dylib file will be created instead of .so. If installed in a nonstandard location, add its location to the DYLD_LIBRARY_PATH environment variable so that the library can be found at run time. - made various modifications to better support the 8-byte long integer datatype on more platforms. The 'LONGLONG' datatype is typedef'ed to equal 'long long' on most Unix platforms and MacOS, and equal to '__int64' on Windows machines. - modified configure.in and makefile.in to better support cases where the system has no Fortran compiler and thus the f77 wrapper routines should not be compiled. - made small modification to eval.y and eval_y.f to get rid of warning on some platforms about redefinition of the 'alloca'. Bug fixes: - other recent bug fixes in ffdblk (delete blocks) caused ffdhdu (delete HDU) to fail when trying to replace the primary array with a null primary array. - fixed bug that prevented inserting a new variable length column into a table that already contained variable length data. - modified fits_delete_file so that it will delete the file even if the input status value is not equal to zero. - in fits_resize_image, it was sometimes necessary to call ffrdef to force the image structure to be defined. - modified the filename parser to support input files with names like: "myfile.fits.gz(mem://tmp)" in which the url type is specified for the output file but not for the input file itself. This required modifications to ffiurl and ffrtnm. Version 2.301 - 7 Dec 2001 Enhancements: - modified the http file driver so that if the filename to be opened contains a '?' character (most likely a cgi related string) then it will not attempt to append a .gz or .Z as it would normally do. - added support for the '!' clobber character when specifying the output disk file name in CFITSIO's extended filename syntax, e.g., 'http://a.b.c.d/myfile.fits.gz(!outfile.fits)' - added new device driver which is used when opening a compressed FITS file on disk by uncompressing it into memory with READWRITE access. This happens when specifying an output filename 'mem://'. - added 2 other device drivers to open http and ftp files in memory with write access. - improved the error trapping and reporting in cases where program attempts to write to a READONLY file (especially in cases where the 'file' resides in memory, as is the case when opening an ftp or http file. - modified the extended filename parser so that it is does not confuse the bracket character '[' which is sometimes used in the root name of files of type 'http://', as the start of an extname or row filter expression. If the file is of type 'http://', the parser now checks to see if the last character in the extended file name is a ')' or ']'. If not, it does not try to parse the file name any further. - improved the efficiency when writing FITS files in memory, by initially allocating enough memory for the entire HDU when it is created, rather than incrementally reallocing memory 2880 bytes at a time (modified ffrhdu and mem_truncate). This change also means that the program will fail much sooner if it cannot allocate enough memory to hold the entire FITS HDU. Bug fixes: - There was an error in the definition of the Fortran ftphtb wrapper routine (writes required ASCII table header keywords) that caused it to fail on DEC OSF and other platforms where sizeof(long) = 8. Version 2.300 - 23 Oct 2001 New Routines: - fits_comp_img and fits_decomp_img are now fully supported and documented. These routine compress and decompress, respective, a FITS image using a new algorithm in which the image is first divided into a grid of rectangular tiles, then the compressed byte stream from each tile is stored in a row of a binary table. CFITSIO can transparently read FITS images stored in this compressed format. Compression ratios of 3 - 6 are typically achieved. Large compression ratios are achieved for floating point images by throwing away non-significant noise bits in the pixel values. - fits_test_heap tests the integrity of the binary table heap and returns statistics on the amount of unused space in the heap and the amount of space that is pointed to by more than 1 descriptor. - fits_compress_heap which will reorder the arrays in the binary table heap, recovering any unused space. Enhancements: - made substantial internal changes to the code to support FITS files containing 64-bit integer data values. These files have BITPIX = 64 or TFORMn = 'K'. This new feature in CFITSIO is currently only enabled if SUPPORT_64BIT_INTEGERS is defined = 1 in the beginning of the fitsio2.h file. By default support for 64-bit integers is not enabled. - improved the ability to read and return a table column value as a formatted string by supporting quasi-legal TDISPn values which have a lowercase format code letter, and by completely ignoring other unrecognizable TDISPn values. Previously, unrecognized TDISPn values could cause zero length strings to be returned. - made fits_write_key_longstr more efficient when writing keywords using the long string CONTINUE convention. It previously did not use all the available space on each card when the string to be written contained many single quote characters. - added a new "CFITSIO Quick Start Guide" which provides all the basic information needed to write C programs using CFITSIO. - updated the standard COMMENT keywords that are written at the beginning of every primary array to refer to the newly published FITS Standard document in Astronomy and Astrophysics. Note: because of this change, any FITS file created with this version of CFITSIO will not be identical to the same file written with a previous version of CFITSIO. - replaced the 2 routines in pliocomp.c with new versions provided by D Tody and N Zarate. These routines compress/uncompress image pixels using the IRAF pixel list compression algorithm. - modified fits_copy_hdu so that when copying a Primary Array to an Image extension, the COMMENT cards which give the reference to the A&A journal article about FITS are not copied. In the inverse case the COMMENT keywords are inserted in the header. - modified configure and Makefile.in to add capability to build a shared version of the CFITSIO library. Type 'make shared' or 'make libcfitsio.so' to invoke this option. - disabled some uninformative error messages on the error stack: 1) when calling ffclos (and then ffchdu) with input status > 0 2) when ffmahd tries to move beyond the end of file. The returned status value remains the same as before, but the annoying error messages no longer get written to the error stack. - The syntax for column filtering has been modified so that if one only specifies a list of column names, then only those columns will be copied into the output file. This provides a simple way to make a copy of a table containing only a specified list of columns. If the column specifier explicitly deletes a column, however, than all the other columns will be copied to the filtered input file, regardless of whether the columns were listed or not. Similarly, if the expression specifies only a column to be modified or created, then all the other columns in the table will be copied. mytable.fit[1][col Time;Rate] - only the Time and Rate columns will be copied to the filtered input file. mytable.fit[1][col -Time ] - all but the Time column are copied to the filtered input file. mytable.fit[1][col Rate;-Time] - same as above. - changed a '#if defined' statement in f77_wrap.h and f77_wrap1.c to support the fortran wrappers on 64-bit IBM/RS6000 systems - modified group.c so that when attaching one group (the child) to another (the parent), check in each file for the existence of a pointer to the other before adding the link. This is to prevent multiple links from forming under all circumstances. - modified the filename parser to accept 'STDIN', 'stdin', 'STDOUT' and 'stdout' in addition to '-' to mean read the file from standard input or write to standard output. - Added support for reversing an axis when reading a subsection of a compressed image using the extended filename syntax, as in myfile.fits+1[-*, *] or myfile.fits+1[600:501,501:600] - When copying a compressed image to a uncompressed image, the EXTNAME keyword is no longer copied if the value is equal to 'COMPRESSED_IMAGE'. - slight change to the comment field of the DATE keyword to reflect the fact that the Unix system date and time is not true UTC time. Bug fixes: - fits_write_key_longstr was not writing the keyword if a null input string value was given. - writing data to a variable length column, if that binary table is not the last HDU in the FITS file, might overwrite the following HDU. Fixed this by changing the order of a couple operations in ffgcpr. - deleting a column from a table containing variable length columns could cause the last few FITS blocks of the file to be reset = 0. This bug occurred as a result of modifications to ffdblk in v2.202. This mainly affects users of the 'compress_fits' utility program. - fixed obscure problem when writing bits to a variable length 'B' column. - when reading a subsection of an image, the BSCALE and BZERO pixel scaling may not have been applied when reading image pixel values (even though the scaling keywords were properly written in the header). - fits_get_keyclass was not returning 'TYP_STRUCT_KEY' for the END keyword. Version 2.204 - 26 July 2001 Bug fixes: - Re-write of fits_clean_url in group.c to solve various problems with invalid bounds checking. Version 2.203 - 19 July 2001 (version in FTOOLS v5.1) Enhancements: - When a row selection or calculator expression is written in an external file (and read by CFITSIO with the '@filename' syntax) the file can now contain comment lines. The comment line must begin with 2 slash characters as the first 2 characters on the line. CFITSIO will ignore the entire line when reading the expression. Bug fixes: - With previous versions of CFITSIO, the pixel values in a FITS image could be read incorrectly in the following case: when opening a subset of a FITS image (using the 'filename.fits[Xmin:Xmax,Ymin:Ymax]' notation) on a PC linux, PC Windows, or DEC OSF machine (but not on a SUN or Mac). This problem only occurs when reading more than 8640 bytes of data (2160 4-byte integers) at a time, and usually only occurs if the reading program reads the pixel data immediately after opening the file, without first reading any header keywords. This error would cause strips of zero valued pixels to appear at semi-random positions in the image, where each strip usually would be 2880 bytes long. This problem does not affect cases where the input subsetted image is simply copied to a new output FITS file. Version 2.202 - 22 May 2001 Enhancements: - revised the logic in the routine that tests if a point is within a region: if the first region is an excluded region, then it implicitly assumes a prior include region covering the entire detector. It also now supports cases where a smaller include region is within a prior exclude region. - made enhancement to ffgclb (read bytes) so that it can also read values from a logical column, returning an array of 1s and 0s. - defined 2 new grouping error status values (349, 350) in cfitsio.h and made minor changes to group.c to use these new status values. - modified fits_open_file so that if it encounters an error while trying to move to a user-specified extension (or select a subset of the rows in an input table, or make a histogram of the column values) it will close the input file instead of leaving it open. - when using the extended filename syntax to filter the rows in an input table, or create a histogram image from the values in a table column, CFITSIO now writes HISTORY keywords in the output file to document the filtering expression that was used. Bug fixes: - ffdblk (called by ffdrow) could overwrite the last FITS block(s) in the file in some cases where one writes data to a variable length column and then calls ffdrow to delete rows in the table. This bug was similar to the ffiblk bug that was fixed in v2.033. - modified fits_write_col_null to fix a problem which under unusual circumstances would cause a End-of-File error when trying to read back the value in an ASCII string column, after initializing if by writing a null value to it. - fixed obscure bug in the calculator function that caused an error when trying to modify the value of a keyword in a HDU that does not have a NAXIS2 keyword (e.g., a null primary array). - the iterator function (in putcol.c) had a bug when calculating the optimum number rows to process in the case where the table has very wide rows (>33120 bytes) and the calculator expression involves columns from more than one FITS table. This could cause an infinite loop in calls to the ffcalc calculator function. - fixed bug in ffmvec, which modifies the length of an existing vector column in a binary table. If the vector was reduced in length, the FITS file could sometimes be left in a corrupted state, and in all cases the values in the remaining vector elements of that column would be altered. - in drvrfile.c, replaced calls to fsetpos and fgetpos with fseek and ftell (or fseeko and ftello) because the fpos_t filetype used in fsetpos is incompatible with the off_t filetype used in fseek, at least on some platforms (Linux 7.0). (This fix was inserted into the V2.201 release on April 4). - added "#define fits_write_pixnull ffppxn" to longnam.h Version 2.201 - 15 March 2001 Enhancements - enhanced the keyword reading routines so that they will do implicit datatype conversion from a string keyword value to a numeric keyword value, if the string consist of a valid number enclosed in quotes. For example, the keyword mykey = '37.5' can be read by ffgkye. - modified ffiimg so that it is possible to insert a new primary array at the beginning of the file. The original primary array is then converted into an IMAGE extension. - modified ffcpdt (copy data unit) to support the case where the data unit is being copied between 2 HDUs in the same file. - enhanced the fits_read_pix and fits_read_pixnull routines so that they support the tiled image compression format that the other image reading routines also support. - modified the Extended File Name syntax to also accept a minus sign (-) as well as an exclamation point (!) as the leading character when specifying a column or or keyword to be deleted, as in [col -time] will delete the TIME column. - now completely support reading subimages, including pixel increments in each dimension, for tile-compressed images (where the compressed image tiles are stored in a binary table). Bug fixes: - fixed confusion in the use of the fpos_t and off_t datatypes in the fgetpos and fsetpos routines in drvrfile.c which caused problems with the Windows VC++ compiler. (fpos_t is not necessarily identical to off_t) - fixed a typo in the fits_get_url function in group.c which caused problems when determining the relative URL to a compressed FITS file. - included fitsio.h in the shared memory utility program, smem.c, in order to define OFF_T. - fixed typo in the datatype of 'nullvalue' in ffgsvi, which caused attempts to read subsections of a short integer tiled compressed image to fail with a bus error. - fixed bug in ffdkey which sometimes worked incorrectly if one tried to delete a nonexistent keyword beyond the end of the header. - fixed problem in fits_select_image_section when it writes a dummy value to the last pixel of the section. If the image contains scaled integer pixels, then in some cases the pixel value could end up out of range. - fixed obscure bug in the ffpcn_ family of routines which gave a floating exception when trying to write zero number of pixels to a zero length array (why would anyone do this?) Version 2.200 - 26 Jan 2001 Enhancements - updated the region filtering code to support the latest region file formats that are generated by the POW, SAOtng and ds9 programs. Region positions may now be given in HH:MM:SS.s, DD:MM:SS.s format, and region sizes may be given arcsec or arcmin instead of only in pixel units. Also changed the logic so that if multiple 'include' regions are specified in the region file, they are ORed together, instead of ANDed, so that the filtering keeps points that are located within any of the 'include' regions, not just the intersection of the regions. - added support for reading raw binary data arrays by converting them on the fly into virtual FITS files. - modified ffpmsg, which writes error messages to CFITSIO's internal error stack, so that messages > 80 characters long will be wrapped around into multiple 80 character messages, instead of just being truncated at 80 characters. - modified the CFITSIO parser so that expression which involve scaled integer columns get cast to double rather than int. - Modified the keyword template parsing routine, ffgthd, to support the HIERARCH keyword. - modified ffainit and ffbinit so that they don't unnecessarily allocate 0 bytes of memory if there are no columns (TFIELDS = 0) in the table that is being opened. - modified fitsio2.h to support NetBSD on Alpha OSF platforms (NetBSD does not define the '__unix__' symbol). - changed the way OFF_T is defined in fitsio.h for greater portability. - changed drvrsmem.c so it is compiled only when HAVE_SHMEM_SERVICES is defined in order to removed the conditional logic from the Makefile - reorganized the CFITSIO User's guide to make it clearer and easier for new users to learn the basic routines. - fixed ffhdef (which reserves space for more header keywords) so that is also updates the start position of the next HDU. This affected the offset values returned by ffghof. Version 2.100 - 18 Oct 2000 Enhancements - made substantial modification to the code to support Large files, i.e., files larger than 2**31 bytes = 2.1GB. FITS files up to 6 terabytes in size may now be read and written on platforms that support Large files (currently only Solaris). - modified ffpcom and ffphis, which write COMMENT and HISTORY keywords, respectively, so that they now use columns 9 - 80, instead of only columns 11 - 80. Previously, these routines avoided using columns 9 and 10, but this is was unnecessarily restrictive. - modified ffdhdu so that instead of refusing to delete the primary array, it will replace the current primary array with a null primary array containing the bare minimum of required keywords and no data. New Routines - fits_read_pix, fits_read_pixnull, fits_read_subset, and fits_write_pix routines were added to enable reading and writing of Large images, with more than 2.1e9 pixels. These new routines are now recommended as the basic routines for reading and writing all images. - fits_get_hduoff returns the byte offset in the file to the start and end of the current HDU. This routine replaces the now obsolete fits_get_hduaddr routine; it uses 'off_t' instead of 'long' as the datatype of the arguments and can support offsets in files greater than 2.1GB in size. Bug fixes: - fixed bug in fits_select_image_section that caused an integer overflow when reading very large image sections (bigger than 8192 x 8192 4-byte pixels). - improved ffptbb, the low-level table writing routine, so that it will insert additional rows in the table if the table is not already big enough. Previously it would have just over- written any HDUs following the table in the FITS file. - fixed a bug in the fits_write_col_bit/ffpclx routine which could not write to a bit 'X' column if that was the first column in the table to be written to. This bug would not appear if any other datatype column was written to first. - non-sensible (but still formally legal) binary table TFORM values such as '8A15', or '1A8' or 'A8' would confuse CFITSIO and cause it to return a 308 error. When parsing the TFORMn = 'rAw' value, the ffbnfm routine has been modified to ignore the 'w' value in cases where w > r. - fixed bug in the blsearch routine in iraffits.c which sometimes caused an out-of-bounds string pointer to be returned when searching for blank space in the header just before the 'END' keyword. - fixed minor problem in ffgtcr in group.c, which sometimes failed while trying to move to the end of file before appending a grouping table. - on Solaris, with Sun CC 5.0, one must check for '__unix' rather than '__unix__' or 'unix' as it's symbol. Needed to modify this in drvrfile.c in 3 places. - in ffextn, the FITS file would be left open if the named extension doesn't exist, thus preventing the file from being opened again later with write access. - fixed bug in ffiimg that would cause attempts to insert a new image extension following a table extension, and in front of any other type of extension, to fail. Version 2.037 - 6 July 2000 Enhancements - added support in the extended filename syntax for flipping an image along any axis either by specifying a starting section pixel number greater than the ending pixel number, or by using '-*' to flip the whole axis. Examples: "myfile.fits[1:100, 50:10]" or "myfile.fits[-*,*]". - when reading a section of an image with the extended filename syntax (e.g. image.fits[1:100:2, 1:100:2), any CDi_j WCS keywords will be updated if necessary to transfer the world coordinate system from the input image to the output image section. - on UNIX platforms, added support for filenames that begin with "~/" or "~user/". The "~" symbol will get expanded into a string that gives the user's home directory. - changed the filename parser to support disk file names that begin with a minus sign. Previously, the leading minus sign would cause CFITSIO to try to read/write the file from/to stdin/stdout. - modified the general fits_update_key routine, which writes or updates a keyword value, to use the 'G' display format instead of the 'E' format for floating point keyword values. This will eliminate trailing zeros from appearing in the value. - added support for the "-CAR" celestial coordinate projection in the ffwldp and ffxypx routines. The "-CAR" projection is the default simplest possible linear projection. - added new fits_create_memfile/ffimem routine to create a new fits file at a designated memory location. - ported f77_wrap.h and f77_wrap1.c so that the Fortran interface wrappers work correctly on 64-bit SGI operating systems. In this environment, C 'long's are 8-bytes long, but Fortran 'integers' are still only 4-bytes long, so the words have to be converted by the wrappers. - minor modification to cfortran.h to automatically detect when it is running on a linux platform, and then define f2cFortran in that case. This eliminates the need to define -Df2cFortran on the command line. - modified group.c to support multiple "/" characters in the path name of the file to be opened/created. - minor modifications to the parser (eval.y, eval_f.c, eval_y.c) to a) add the unary '+' operator, and b) support copying the TDIMn keyword from the input to the output image under certain circumstances. - modified the lexical parser in eval_l.y and eval_l.c to support #NULL and #SNULL constants which act to set the value to Null. Support was also added for the C-conditional expression: 'Boolean ? trueVal : falseVal'. - small modification to eval_f.c to write an error message to the error stack if numerical overflow occurs when evaluating an expression. - configure and configure.in now support the egcs g77 compiler on Linux platforms. Bug fixes: - fixed a significant bug when using the extended filename binning syntax to generate a 2-dimensional image from a histogram of the values in 2 table columns. This bug would cause table events that should have been located in the row just below the bottom row of the image (and thus should have been excluded from the histogram) to be instead added into the first row of the image. Similarly, the first plane of a 3-D or 4-D data cube would include the events that should have been excluded as falling in the previous plane of the cube. - fixed minor bug when parsing an extended filename that contains nested pairs of square brackets (e.g., '[col newcol=oldcol[9]]'). - fixed bug when reading unsigned integer values from a table or image with fits_read_col_uint/ffgcvuk. This bug only occurred on systems like Digital Unix (now Tru64 Unix) in which 'long' integers are 8 bytes long, and only when reading more than 7200 elements at a time. This bug would generally cause the program to crash with a segmentation fault. - modified ffgcpr to update 'heapstart' as well as 'numrows' when writing more rows beyond the end of the table. heapstart is needed to calculate if more space needs to be inserted in the table when inserting columns into the table. - modified fficls (insert column), ffmvec, ffdrow and ffdcol to not use the value of the NAXIS2 keyword as the number of rows in the table, and instead use the value that is stored in an internal structure, because the keyword value may not be up to date. - Fixed bug in the iterator function that affected the handling of null values in string columns in ASCII and binary tables. - Reading a subsample of pixels in very large images, (e.g., file = myfile.fits[1:10000:10,1:10000:10], could cause a long integer overflow (value > 2**31) in the computation of the starting byte offset in the file, and cause a return error status = 304 (negative byte address). This was fixed by changing the order of the arithmetic operations in calculating the value of 'readptr' in the ffgcli, ffgclj, ffgcle, ffgcld, etc. routines. - In version 2.031, a fix to prevent compressed files from being opened with write privilege was implemented incorrectly. The fix was intended to not allow a compressed FITS file to be opened except when a local uncompressed copy of the file is being produced (then the copy is opened with write access), but in fact the opposite behavior occurred: Compressed files could be opened with write access, EXCEPT when a local copy is produced. This has been fixed in the mem_compress_open and file_compress_open routines. - in iraffits.c, a global variable called 'val' caused multiply defined symbols warning when linking cfitsio and IRAF libraries. This was fixed by making 'val' a local variable within the routine. Version 2.036 - 1 Feb 2000 - added 2 new generic routines, ffgpf and ffgcf which are analogous to ffgpv and ffgcv but return an array of null flag values instead of setting null pixels to a reserved value. - minor change to eval_y.c and eval.y to "define alloca malloc" on all platforms, not just VMS. - added support for the unsigned int datatype (TUINT) in the generic ffuky routine and changed ffpky so that unsigned ints are cast to double instead of long before being written to the header. - modified ffs2c so that if a null string is given as input then a null FITS string (2 successive single quotes) will be returned. Previously this routine would just return a string with a single quote, which could cause an illegal keyword record to be written. - The file flush operation on Windows platforms apparently changes the internal file position pointer (!) in violation of the C standard. Put a patch into the file_flush routine to explicitly seek back to the original file position. - changed the name of imcomp_get_compressed_image_parms to imcomp_get_compressed_image_par to not exceed the 31 character limit on some compilers. - modified the filename parser (which is used when moving to a named HDU) to support EXTNAME values which contain embedded blanks. - modified drvrnet.c to deal with ftp compressed files better so that even fits files returned from cgi queries which have the wrong mime types and/or wrong types of file names should still decompress. - modified ffgics to reduce the tolerance for acceptable skewness between the axes, and added a new warning return status = APPROX_WCS_KEY in cases where there is significant skewness between the axes. - fixed bug in ffgics that affected cases where the first coordinate axis was DEC, not RA, and the image was a mirror image of the sky. - fixed bug in ffhist when trying to read the default binning factor keyword, TDBIN. - modified ffhist so that is correctly computes the rotation angle in a 2-D image if the first histogram column has a CROTA type keyword but the 2nd column does not. - modified ffcpcl so that it preserves the comment fields on the TTYPE and TFORM keywords when the column is copied to a new file. - make small change to configure.in to support FreeBSD Linux by setting CFLAGS = -Df2cFortran instead of -Dg77Fortran. Then regenerated configure with autoconf 2.13 instead of 2.12. Version 2.035 - 7 Dec 1999 (internal release only, FTOOLS 5.0.2) - added new routine called fits_get_keyclass/ffgkcl that returns the general class of the keyword, e.g., required structural keyword, WCS keyword, Comment keyword, etc. 15 classes of keywords have been defined in fitsio.h - added new routine called fits_get_img_parm/ffgipr that is similar to ffgphd but it only return the bitpix, naxis, and naxisn values. - added 3 new routines that support the long string keyword convention: fits_insert_key_longstr, fits_modify_key_longstr fits_update_key_longstr. - modified ffgphd which reads image header keywords to support the new experimental compressed image format. - when opening a .Z compressed file, CFITSIO tries to allocate memory equal to 3 times the file size, which may be excessive in some cases. This was changed so that if the allocation fails, then CFITSIO will try again to allocate only enough memory equal to 1 times the file size. More memory will be allocated later if this turns out to be too small. - improved the error checking in the fits_insert_key routine to check for illegal characters in the keyword. Version 2.034 - 23 Nov 1999 - enhanced support for the new 'CD' matrix world coordinate system keywords in the ffigics routine. This routine has been enhanced to look for the new 'CD' keywords, if present, and convert them back to the old CDELTn and CROTAn values, which are then returned. The routine will also swap the WCS parameters for the 2 axes if the declination-like axis is the first WCS axis. - modified ffphbn in putkey.c to support the 'U' and 'V" TFORM characters (which represent unsigned short and unsigned int columns) in variable length array columns. (previously only supported these types in fixed length columns). - added checks when reading gzipped files to detect unexpected EOF. Previously, the 'inflate_codes' routine would just sit in an infinite loop if the file ended unexpectedly. - modified fits_verify_chksum/ffvcks so that checksum keywords with a blank value string are treated as undefined, the same as if the keyword did not exist at all. - fixed ffghtb and ffghbn so that they return the extname value in cases where there are no columns in the table. - fixed bug in the ffgtwcs routine (this is a little utility routine to aid in interfacing to Doug Mink's WCS routines); it was not correctly padding the length of string-valued keywords in the returned string. - fixed bug in 'iraffits.c' that prevented Type-2 IRAF images from being correctly byte-swapped on PCs and DEC-OSF machines. - fixed tiny memory leak in irafncmp in iraffits.c. Only relevant when reading IRAF .imh files. - fixed a bug (introduced in version 2.027) that caused the keyword reading routines to sometimes not find a matching keyword if the input name template used the '*' wildcard as the last character. (e.g., if input name = 'COMMENT*' then it would not find the 'COMMENT' keywords. (It would have found longer keywords like 'COMMENTX' correctly). The fix required a minor change to ffgcrd in getkey.c - modified the routine (ffswap8) that does byteswapping of double precision numbers. Some linux systems have reported floating point exceptions because they were trying to interpret the bytes as a double before the bytes had been swapped. - fixed bug in the calculation of the position of the last byte in the string of bits to be read in ffgcxuk and ffgcxui. This bug generally caused no harm, but could cause the routine to exit with an invalid error message about trying to read beyond the size of the field. - If a unix machine did not have '__unix__', 'unix', or '__unix' C preprocessor symbols defined, then CFITSIO would correctly open one FITS file, but would not correctly open subsequent files. Instead it would think that the same file was being opened multiple times. This problem has only been seen on an IBM/AIX machine. The fits_path2url and fits_url2path routines in group.c were modified to fix the problem. - fixed bug in group.c, which affected WINDOWS platforms only, that caused programs to go into infinite loop when trying to open certain files. - the ftrsim Fortran wrapper routine to ffrsim was not defined correctly, which caused the naxis(2) value to be passed incorrectly on Dec OSF machines, where sizeof(long) != sizeof(int). Version 2.033 - 17 Sept 1999 - New Feature: enhanced the row selection parser so that comparisons between values in different rows of the table are allowed, and the string comparisons with <, >, <=, and >= are supported. - added new routine the returns the name of the keyword in the input keyword record string. The name is usually the first 8 characters of the record, except if the HIERARCH convention is being used in which case the name may be up to 67 characters long. - added new routine called fits_null_check/ffnchk that checks to see if the current header contains any null (ASCII 0) characters. These characters are illegal in FITS headers, but they go undetected by the other CFITSIO routines that read the header keywords. - the group.c file has been replaced with a new version as supplied by the ISDC. The changes are mainly to support partial URLs and absolute URLs more robustly. Host dependent directory paths are now converted to true URLs before being read from/written to grouping tables. - modified ffnmhd slightly so that it will move to the first extension in which either the EXTNAME or the HDUNAME keyword is equal to the user-specified name. Previously, it only checked for HDUNAME if the EXTNAME keyword did not exist. - made small change to drvrnet.c so that it uncompress files which end in .Z and .gz just as for ftp files. - rewrote ffcphd (copy header) to handle the case where the input and output HDU are in the same physical FITS file. - fixed bug in how long string keyword values (using the CONTINUE convention) were read. If the string keyword value ended in an '&' character, then fits_read_key_longstr, fits_modify_key_str, and fits_delete_key would interpret the following keyword as a continuation, regardless of whether that keyword name was 'CONTINUE' as required by this convention. There was also a bug in that if the string keyword value was all blanks, then fits_modify_key_str could in certain unusual cases think that the keyword ended in an '&' and go into an infinite loop. - modified ffgpv so that it calls the higher level ffgpv_ routine rather than directly calling the lower level ffgcl_ routine. This change is needed to eventually support reading compressed images. - added 3 new routines to get the image datatype, image dimensions, and image axes length. These support the case where the image is compressed and stored in a binary table. - fixed bug in ffiblk that could sometimes cause it to insert a new block in a file somewhere in the middle of the data, instead of at the end of the HDU. This fortunately is a rare problem, mainly only occurring in certain cases when inserting rows in a binary table that contains variable length array data (i.e., has a heap). - modified fits_write_tdim so that it double checks the TFORMn value directly if the column repeat count stored in the internal structure is not equal to the product of all the dimensions. - fixed bug that prevented ffitab or ffibin from inserting a new table after a null primary array (can't read NAXIS2 keyword). Required a small change to ffrdef. - modified testprog.c so that it will continue to run even if it cannot open or process the template file testprog.tpt. - modified the logic in lines 1182-1185 of grparser.c so that it returns the correct status value in case of an error. - added test in fitsio2.h to see if __sparcv9 is defined; this identifies a machine running Solaris 7 in 64-bit mode where long integers are 64 bits long. Version 2.032 - 25 May 1999 - the distribution .tar file was changed so that all the files will be untarred into a subdirectory by default instead of into the current directory. - modified ffclos so that it always frees the space allocated by the fptr pointer, even when another fptr points to the same file. - plugged a potential (but rare in practice) memory leak in ffpinit - fixed bug in all the ffp3d_ and ffg3d_ routines in cases where the data cube that has been allocated in memory has more planes than the data cube in the FITS file. - modified drvrsmem.c so that it allocates a small shared memory segment only if CFITSIO tries to read or write a FITS file in shared memory. Previously it always allocated the segment whether it was needed or not. Also, this small segment is removed if 0 shared memory segments remain in the system. - put "static" in front of 7 DECLARE macros in compress.c because these global variables were causing conflicts with other applications programs that had variables with the same names. - modified ffasfm to return datatype = TDOUBLE instead of TFLOAT if the ASCII table column has TFORMn = 'Ew.d' with d > 6. - modified the column reading routines to a) print out the offending entry if an error occurs when trying to read a numeric ASCII table column, and b) print out the column number that had the error (the messages are written to CFITSIOs error stack) - major updates to the Fortran FITSIO User's Guide to include many new functions that have been added to CFITSIO in the past year. - modified fitsio2.h so that the test for __D_FLOAT etc. is only made on Alpha VMS machines, to avoid syntax errors on some other platforms. - modified ffgthd so that it recognizes a floating point value that uses the 'd' or 'D' exponent character. - removed the range check in fftm2s that returned an error if 'decimals' was less than zero. A negative value is OK and is used to return only the date and not the time in the string. Version 2.031 - 31 Mar 1999 - moved the code that updates the NAXIS2 and PCOUNT keywords from ffchdu into the lower lever ffrdef routine. This ensures that other routines which call ffrdef will correctly update these 2 keywords if required. Otherwise, for instance, calling fits_write_checksum before closing the HDU could cause the NAXIS2 keyword (number of rows in the table) to not be updated. - fixed bug (introduced in version 2.030) when writing null values to a primary array or image extension. If trying to set more than 1 pixel to null at a time, then typically only 1 null would be written. Also fixed related bug when writing null values to rows in a table that are beyond the currently defined size of the table (the size of the table was not being expanded properly). - enhanced the extended filename parser to support '*' in image section specifiers, to mean use the whole range of the axis. myfile.fits[*,1:100] means use the whole range of the first axis and pixels 1 to 100 in the second axis. Also supports an increment, as in myfile.fits[*:2, *:2] to use just the odd numbered rows and columns. - modified fitscore.c to set the initial max size of the header, when first reading it, to the current size of the file, rather than to 2 x 10**9 to avoid rare cases where CFITSIO ends up writing a huge file to disk. - modified file_compress_open so that it will not allow a compressed FITS file to be opened with write access. Otherwise, a program could write to the temporary copy of the uncompressed file, but the modification would be lost when the program exits. Version 2.030 - 24 Feb 1999 - fixed bug in ffpclu when trying to write a null value to a row beyond the current size of the table (wouldn't append new rows like it should). - major new feature: enhanced the routines that read ASCII string columns in tables so that they can read any table column, including logical and numeric valued columns. The column values are returned as a formatted string. The format is determined by the TDISPn keyword if present, otherwise a default format based on the datatype of the column is used. - new routine: fits_get_col_display_width/ffgcdw returns the length of the formatted strings that will be returned by the routines that read table columns as strings. - major new feature: added support for specifying an 'image section' when opening an image: e.g, myfile.fits[1:512:2,2:512:2] to open a 256x256 pixel image consisting of the odd columns and the even numbered rows of the input image. - added supporting project files and instructions for building CFITSIO under Windows NT with the Microsoft Visual C++ compiler. - changed the variable 'template' to 'templt' in testprog.c since it conflicted with a reserved word on some compilers. - modified group.c to conditionally include sys/stat.h only on unix platforms - fixed bug in the ffiter iterator function that caused it to always pass 'firstn' = 1 to the work function when reading from the primary array or IMAGE extension. It worked correctly for tables. - fixed bug in the template header keyword parser (ffgthd) in cases where the input template line contains a logical valued keyword (T or F) without any following comment string. It was previously interpreting this as a string-valued keyword. - modified ffrhdu that reads and opens a new HDU, so that it ignores any leading blank characters in the XTENSION name, e.g., XTENSION= ' BINTABLE' will not cause any errors, even though this technically violates the FITS Standard. - modified ffgtbp that reads the required table keywords to make it more lenient and not exit with an error if the THEAP keyword in binary tables cannot be read as an integer. Now it will simply ignore this keyword if it cannot be read. - added test for 'WIN32' as well as '__WIN32__' in fitsio2.h, eval.l and eval_l.c in a preprocessor statement. - changed definition of strcasecmp and strncasecmp in fitsio2.h, eval.l and eval_l.c to conform to the function prototypes under the Alpha VMS v7.1 compiler. - corrected the long function names in longnam.h for the new WCS utility functions in wcssubs.c Version 2.029 - 11 Feb 1999 - fixed bug in the way NANs and underflows were being detected on VAX and Alpha VMS machines. - enhanced the filename parser to distinguish between a VMS-style directory name (e.g. disk:[directory]myfile.fits) and a CFITSIO filter specifier at the end of the name. - modified ffgthd to support the HIERARCH convention for keyword names that are longer than 8 characters or contain characters that would be illegal in standard FITS keyword names. - modified the include statements in grparser.c so that malloc.h and memory.h are only included on the few platforms that really need them. - modified the file_read routine in drvrfile.c to ignore the last record in the FITS file it it only contains a single character that is equal to 0, 10 or 32. Text editors sometimes append a character like this to the end of the file, so CFITSIO will ignore it and treat it as if it had reached the end of file. - minor modifications to fitsio.h to help support the ROOT environment. - installed new version of group.c and group.h; the main change is to support relative paths (e.g. "../filename") in the URLs - modified the histogramming routines so that it looks for the default preferred column axes in a keyword of the form CPREF = 'Xcol, Ycol' instead of separate keywords of the form CPREF1 = 'Xcol' CPREF2 = 'Ycol' - fixed bug so that if the binning spec is just a single integer, as in [bin 4] then this will be interpreted as meaning to make a 2D histogram using the preferred or default axes, with the integer taken as the binning factor in both axes. Version 2.028 - 27 Jan 1999 - if the TNULLn keyword value was outside the range of a 'I' or 'B' column, an overflow would occur when setting the short or char to the TNULLn value, leading to incorrect values being flagged as being undefined. This has been fixed so that CFITSIO will ignore TNULLn values that are beyond the range of the column data type. - changed a few instances of the string {"\0"} to {'\0'} in the file groups.c - installed new version of the grparser.c file from the ISDC - added new WCS support routines (in wcssub.c) which make it easier to call Doug Mink's WCSlib routines for converting between plate and sky coordinates. The CFITSIO routines themselves never call a WCSlib routine, so CFITSIO is not dependent on WCSlib. - modified ffopen so that if you use the extended filename syntax to both select rows in a table and then bin columns into a histogram, then CFITSIO will simply construct an array listing the good row numbers to be used when making the histogram, instead of making a whole new temporary FITS file containing the selected rows. - modified ffgphd which parses the primary array header keywords when opening a file, to not choke on minor format errors in optional keywords. Otherwise, this prevents CFITSIO from even opening the file. - changed a few more variable declarations in compress.c from global to static. Version 2.027 - 12 Jan 1999 - modified the usage of the output filename specifier so that it, a) gives the name of the binned image, if specified, else, b) gives the name of column filtered and/or row filtered table, if specified, else c) is the name for a local copy of the ftp or http file, else, d) is the name for the local uncompressed version of the compressed FITS file, else, e) the output filename is ignored. - fixed minor bug in ffcmps, when comparing 2 strings while using a '*' wild card character. - fixed bug in ftgthd that affected cases where the template string started with a minus sign and contained 2 tokens (to rename a keyword). - added support for the HIERARCH keyword convention for reading and writing keywords longer than 8 characters or that contain ASCII characters not allowed in normal FITS keywords. - modified the extended filename syntax to support opening images that are contained in a single cell of a binary table with syntax: filename.fits[extname; col_name(row_expression)] Version 2.026 - 23 Dec 1998 - modified the group parser to: a) support CFITSIO_INCLUDE_FILES environment variable, which can point to the location of template files, and, b) the FITS file parameter passed to the parser no longer has to point to an empty file. If there are already HDUs in the file, then the parser appends new HDUs to the end of the file. - make a small change to the drvrnet.c file to accommodate creating a static version of the CFITSIO library. - added 2 new routines to read consecutive bits as an unsigned integer from a Bit 'X' or Byte 'B' column (ffgcxui and ffgcxuk). - modified the logic for determining histogram boundaries in ffhisto to add one more bin by default, to catch values that are right on the upper boundary of the histogram, or are in the last partial bin. - modified cfitsio2.h to support the new Solaris 7 64-bit mode operating system. - Add utility routine, CFits2Unit, to the Fortran wrappers which searches the gFitsFiles array for a fptr, returning its element (Fortran unit number), or allocating a new element if one doesn't already exists... for C calling Fortran calling CFITSIO. - modified configure so that it does not use the compiler optimizer when using gcc 2.8.x on Linux - (re)added the fitsio.* documentation files that describe the Fortran-callable FITSIO interface to the C routines. - modified the lexical parser in eval_f.c to fix bug in null detections and bug in ffsrow when nrows = 0. - modified ffcalc so that it creates a TNULLn keyword if appropriate when a new column is created. Also fixed detection of OVERFLOWs so that it ignores null values. - added hyperbolic trig and rounding functions to the lexical parser in the eval* files. - improved error message that gets written when the group number is out of range when reading a 'random groups' array. - added description of shared memory, grouping, and template parsing error messages to ffgerr and to the User's Guide. Moved the error code definitions from drvsmem.h to fitsio.h. - modified grparser.c to compile correctly on Alpha/OSF machines - modified drvrnet.c to eliminate compiler warnings - Modified Makefile.in to include targets for building all the sample programs that are included with CFITSIO. Version 2.025 - 1 Dec 1998 - modified ffgphd and ffgtbp so that they ignores BLANK and TNULLn keywords that do not have a valid integer value. Also, any error while reading the BSCALE, BZERO, TSCALn, or TZEROn keywords will be ignored. Previously, CFITSIO would have simply refused to read an HDU that had such an invalid keyword. - modified the parser in eval_f.c to accept out of order times in GTIs - updated cfitsio_mac.sit.hqx to fix bad target parameters for Mac's speed test program - modified template parser in grparser.c to: 1) not write GRPNAME keyword twice, and 2) assign correct value for EXTVERS keyword. - fixed minor bugs in group.c; mainly would only affect users of the INTEGRAL Data Access Layer. - temporarily removed the prototype for ffiwcs from fitsio.h until full WCS support is added to CFITSIO in the near future. - modified the HTTP driver to send a User-Agent string: HEASARC/CFITSIO/ - declared local variables in compress.c as 'static' to avoid conflicts with other libraries. Version 2.024 - 9 Nov 1998 - added new function fits_url_type which returns the driver prefix string associated with a particular FITS file pointer. Version 2.023 - 1 Nov 1998 - first full release of CFITSIO 2.0 - slightly modified the way real keyword values are formatted, to ensure that it includes a decimal point. E.g., '1.0E-09' instead of '1E-09' - added new function to support template files when creating new FITS files. - support the TCROTn WCS keyword in tables, when reading the WCS keywords. - modified the iterator to support null values in logical columns in binary tables. - fixed bug in iterator to support null values in integer columns in ASCII tables. - changed the values for FLOATNULLVALUE and DOUBLENULLVALUE to make them less likely to duplicate actual values in the data. - fixed major bug when freeing memory in the iterator function. It caused mysterious crashes on a few platforms, but had no effect on most others. - added support for reading IRAF format image (.imh files) - added more error checking to return an error if the size of the FITS file exceeds the largest value of a long integer (2.1 GB on 32-bit platforms). - CFITSIO now will automatically insert space for additional table rows or add space to the data heap, if one writes beyond the current end of the table or heap. This prevents any HDUs which might follow the current HDU from being overwritten. It is thus no longer necessary to explicitly call fits_insert_rows before writing new rows of data to the FITS file. - CFITSIO now automatically keeps track of the number of rows that have been written to a FITS table, and updates the NAXIS2 keyword accordingly when the table is closed. It is no longer necessary for the application program to updated NAXIS2. - When reading from a FITS table, CFITSIO will now return an error if the application tries to read beyond the end of the table. - added 2 routines to get the number of rows or columns in a table. - improved the undocumented feature that allows a '20A' column to be read as though it were a '20B' column by fits_read_col_byt. - added overflow error checking when reading keywords. Previously, the returned value could be silently truncated to the maximum allowed value for that data type. Now an error status is returned whenever an overflow occurs. - added new set of routines dealing with hierarchical groups of files. These were provided by Don Jennings of the INTEGRAL Science Data Center. - added new URL parsing routines. - changed the calling sequence to ffghad (get HDU address) from ffghad(fitsfile *fptr, > long *headstart, long *dataend) to ffghad(fitsfile *fptr, > long *headstart, long datastart, long *dataend, int *status) - major modification to support opening the same FITS file more than once. Now one can open the same file multiple times and read and write simultaneously to different HDUs within the file. fits_open_file automatically detects if the file is already opened. - added the ability to clobber/overwrite an existing file with the same name when creating a new output file. Just precede the output file name with '!' (an exclamation mark) - changed the ffpdat routine which writes the DATE keyword to use the new 'YYYY-MM-DDThh:mm:ss' format. - added several new routines to create or parse the new date/time format string. - changed ifdef for DECFortran in f77_wrap.h and f77_wrap1.c: expanded to recognize Linux/Alpha - added new lexical parsing routines (from Peter Wilson): eval_l.c, eval_y.c, eval_f.c, eval_defs.h, and eval_tab.h. These are used when doing on-the-fly table row selections. - added new family of routines to support reading and writing 'unsigned int' data type values in keywords, images or tables. - restructured all the putcol and getcol routines to provide simpler and more robust support for machines which have sizeof(long) = 8. Defined a new datatype INT32BIT which is always 32 bits long (platform independent) and is used internally in CFITSIO when reading or writing BITPIX = 32 images or 'J' columns. This eliminated the need for specialize routines like ffswaplong, ffunswaplong, and ffpacklong. - overhauled cfileio.c (and other files) to use loadable drivers for doing data I/O to different devices. Now CFITSIO support network access to ftp:// and http:// files, and to shared memory files. - removed the ffsmem routine and replaced it with ffomem. This will only affect software that reads an existing file in core memory. (written there by some other process). - modified all the ffgkn[] routines (get an array of keywords) so that the 'nfound' parameter is = the number of keywords returned, not the highest index value on the returned keywords. This makes no difference if the starting index value to look for = 1. This change is not backward compatible with previous versions of CFITSIO, but is the way that FITSIO behaved. - added new error code = 1 for any application error external to CFITSIO. Also reports "unknown error status" if the value doesn't match a known CFITSIO error. Version 1.42 - 30 April 1998 (included in FTOOLS 4.1 release) - modified the routines which read a FITS float values into a float array, or read FITS double values into a double array, so that the array value is also explicitly set in addition to setting the array of flag values, if the FITS value is a NaN. This ensures that no NaN values get passed back to the calling program, which can cause serious problems on some platforms (OSF). - added calls to ffrdef at the beginning of the insert or delete rows or columns routines in editcol.c to make sure that CFITSIO has correctly initialized the HDU information. - added new routine ffdrws to delete a list of rows in a table - added ffcphd to copy the header keywords from one hdu to another - made the anynul parameter in the ffgcl* routines optional by first checking to see if the pointer is not null before initializing it. - modified ffbinit and ffainit to ignore minor format errors in header keywords so that cfitsio can at least move to an extension that contains illegal keywords. - modified all the ffgcl* routines to simply return without error if nelem = 0. - added check to ffclose to check the validity of the fitsfile pointer before closing it. This should prevent program crashes when someone tries to close the same file more than once. - replaced calls to strcmp and strncmp with macros FSTRCMP and FSTRNCMP in a few places to improve performance when reading header keywords (suggested by Mike Noble) Bug Fixes: - fixed typo in macro definition of error 504 in the file fitsio.h. - in ffopen, reserved space for 4 more characters in the input file name in case a '.zip' suffix needs to be added. - small changes to ffpclx to fix problems when writing bit (X) data columns beyond the current end of file. - fixed small bug in ffcrhd where a dummy pointer was not initialized - initialized the dummy variable in ffgcfe and ffgcfd which was causing crashes under OSF in some cases. - increased the length of the allocated string ffgkls by 2 to support the case of reading a numeric keyword as a string which doesn't have the enclosing quote characters. Version 1.4 - 6 Feb 1998 - major restructuring of the CFITSIO User's Guide - added the new 'iterator' function. The fortran wrapper is in f77_iter.c for now. - enhanced ffcrtb so that it writes a dummy primary array if none currently exists before appending the table. - removed the ffgcl routine and replaced it with ffgcvl - modified ffpcnl to just take a single input null value instead of an entire array of null value flags. - modified ffcmps and ffgnxk so that, for example, the string 'rate' is not considered a match to the string 'rate2', and 'rate*' is a match to the string 'rate'. - modified ffgrsz to also work with images, in which case it returns the optimum number of pixels to process at one time. - modified ffgthd to support null valued keywords - added a new source file 'f77_wrap.c' that includes all the Fortran77 wrapper routines for calling CFITSIO. This will eventually replace the Fortran FITSIO library. - added new routines: ffppn - generic write primary array with null values ffpprn - write null values to primary array ffuky - 'update' a keyword value, with any specified datatype. ffrprt - write out report of error status and error messages ffiter - apply a user function iteratively to all the rows of a table ffpkyc - write complex-valued keyword ffpkym - write double complex-valued keyword ffpkfc - write complex-valued keyword in fixed format ffpkfm - write double complex-valued keyword in fixed format ffgkyc - read complex-valued keyword ffgkym - read double complex-valued keyword ffmkyc - modify complex-valued keyword ffmkym - modify double complex-valued keyword ffmkfc - modify complex-valued keyword in fixed format ffmkfm - modify double complex-valued keyword in fixed format ffukyc - update complex-valued keyword ffukym - update double complex-valued keyword ffukfc - update complex-valued keyword in fixed format ffukfm - update double complex-valued keyword in fixed format ffikyc - insert complex-valued keyword ffikym - insert double complex-valued keyword ffikfc - insert complex-valued keyword in fixed format ffikfm - insert double complex-valued keyword in fixed format ffpktp - write or modify keywords using ASCII template file ffcpcl - copy a column from one table to another ffcpky - copy an indexed keyword from one HDU to another ffpcnl - write logical values, including nulls, to binary table ffpcns - write string values, including nulls, to table ffmnhd - move to HDU with given exttype, EXTNAME and EXTVERS values ffthdu - return the total number of HDUs in the file ffghdt - return the type of the CHDU ffflnm - return the name of the open FITS file ffflmd - return the mode of the file (READONLY or READWRITE) - modified ffmahd and ffmrhd (to move to a new extension) so that a null pointer may be given for the returned HDUTYPE argument. - worked around a bug in the Mac CWpro2 compiler by changing all the statements like "#if BYTESWAPPED == TRUE" to "if BYTESWAPPED". - modified ffitab (insert new ASCII table) to allow tables with zero number of columns - modified Makefile.in and configure to define the -Dg77Fortran CFLAGS variable on Linux platforms. This is needed to compile the new f77_wrap.c file (which includes cfortran.h) Bug Fixes: - fixed small bug in ffgrz (get optimum row size) which sometimes caused it to return slightly less than the maximum optimum size. This bug would have done no harm to application programs. - fixed bug in ffpclk and ffgclk to add an 'else' case if size of int is not equal to size of short or size of long. - added test to ffgkls to check if the input string is not null before allocating memory for it. Version 1.32 - 21 November 1997 (internal release only) - fixed bug in the memory deallocation (free) statements in the ffopen routine in the cfileio.c file. - modified ffgphd to tolerate minor violations of the FITS standard in the format of the XTENSION = 'IMAGE ' keyword when reading FITS files. Extra trailing spaces are now allowed in the keyword value. (FITS standard will be changed so that this is not a violation). Version 1.31 - 4 November 1997 (internal release only) Enhancements: - added support for directly reading compressed FITS files by copying the algorithms from the gzip program. This supports the Unix compress, gzip and pkzip algorithms. - modified ffiimg, ffitab, and ffibin (insert HDUs into a FITS file) so that if the inserted HDU is at the end of the FITS file, then it simply appends a new empty HDU and writes the required keywords. This allows space to be reserved for additional keywords in the header if desired. - added the ffchfl and ffcdfl routines to check the header and data fill values, for compatibility with the Fortran FITSIO library. - added the ffgsdt routine to return the system date for compatibility with the Fortran FITSIO library. - added a diagnostic error message (written to the error stack) if the routines that read data from image or column fail. - modified ffgclb so that it simply copies the bytes from an ASCII 'nA' or 'An' format column into the user's byte array. Previously, CFITSIO would return an error when trying to read an 'A' column with ffgclb. - modified ffpclb so that it simply copies the input array of bytes to an ASCII 'nA' or 'An' format column. Previously, CFITSIO would return an error when trying to write to an 'A' column with ffpclb. Bug Fixes: - ffgkls was allocating one too few bytes when reading continued string keyword values. - in testprog.c added code to properly free the memory that had been allocated for string arrays. - corrected typographical errors in the User's Guide. Version 1.30 - 11 September 1997 - major overhaul to support reading and writing FITS files in memory. The new routines fits_set_mem_buff and fits_write_mem_buff have been added to initialize and copy out the memory buffer, respectively. - added support for reading FITS files piped in on 'stdin' and piped out on 'stdout'. Just specify the file name as '-' when opening or creating the FITS file. - added support for 64-bit SGI IRIX machines. This required adding routines to pack and unpack 32-bit integers into 64-bit integers. - cleaned up the code that supports G_FLOAT and IEEE_FLOAT on Alpha VMS systems. Now, the type of float is determined at compile time, not run time. Bug Fixes: - replaced the malloc calls in the error message stack routines with a static fixed size array. The malloc's cause more problems than they solved, and were prone to cause memory leaks if users don't clear the error message stack when closing the FITS file. - when writing float or double keywords, test that the value is not a special IEEE value such as a NaN. Some compilers would write the string 'NaN' in this case into the output value string. - fixed bug in ffiblk, to ignore EOF status return if it is inserting blocks at the end of the file. - removed the 'l' from printf format string that is constructed in the ffcfmt routine. This 'l' is non-standard and causes problems with the Metrowerks compiler on a Mac. - the default null value in images was mistakenly being set equal to NO_NULL = 314, rather than NULL_UNDEFINED = 1234554321 in the ffgphd routine. - check status value in ffgkls to make sure the keyword exists before allocating memory for the value string. - fixed the support for writing and reading unsigned long integer keyword values in ffpky and ffgky by internally treating the values as doubles. This required changes to ffc2r and ffc2d as well. - added explicit cast to 'double' in one place in putcolb.c and 6 places in pubcolui.c, to get rid of warning messages issued by one compiler. - in ffbinit and ffainit, it is necessary to test that tfield > 0 before trying to allocate memory with calloc. Otherwise, some compilers return a null pointer which CFITSIO interprets to mean the memory allocation failed. - had to explicitly cast the null buffer pointer to a char pointer (cptr = (char *)buffer;) in 4 places in the buffers.c file to satisfy a picky C++ compiler. - changed the test for an ALPHA VMS system to see if '__VMS' is defined, rather than 'VMS'. The latter is not defined by at least one C++ compiler. - modified ffpcls so that it can write a null string to a variable length string column, without going into an infinite loop. - fixed bug in ffgcfl that caused the 'next' variable to be incremented twice. - fixed bug in ffgcpr that caused it write 2x the number of complex elements into the descriptor when writing to a complex or double complex variable length array column. - added call to ffrdef at the end of ffrsim to ensure that the internal structures are updated to correspond to the modified header keywords Version 1.25 - 7 July 1997 - improved the efficiency of the ffiblk routine, when inserting more than one block into the file. - fixed bug in ffwend that in rare instances caused the beginning of the following extension to be overwritten by blank fill. - added new routine to modify the size of an existing primary array or image extension: fits_resize_img/ffrsim. - added support for null-valued keywords, e.g., keywords that have no defined value. These keywords have an equal sign and space in columns 9-10, but have not value string. Example: KEYNAME = / null-valued keyword Support for this feature required the following changes: - modified ffpsvc to return a null value string without error - modified ffc2[ilrd] to return error VALUE_UNDEFINED in this case - modified ffgkn[sljed] to continue reading additional keywords even if one or more keywords have undefined values. - added 4 new routines: ffpkyu, ffikyu, ffmkyu, ffukyu to write, insert, modify, or update an undefined keyword - a new makefile.os2 file was added, for building CFITSIO on OS/2 systems. - modified ffgtkn so that if it finds an unexpected keyword name, the returned error status = BAD_ORDER instead of NOT_POS_INT. - added 2 new routines, fits_write_key_unit/ffpunt and fits_read_key_unit/ffgunt to write/read the physical units of a keyword value. These routines use a local FITS convention for storing the units in square brackets following the '/' comment field separator, as in: VELOCITY= 12 / [km/s] orbit speed The testprog.c program was modified to test these new routines. - in the test of Alpha OSF/1 machines in fitsio2.h, change 'defined(unix)' to 'defined(__unix__)' which appears to be a more robust test. - remove test for linux environment variable from fitsio2.h Version 1.24 - 2 May 1997 - fixed bug in ffpbyt that incorrectly computed the current location in the FITS file when writing > 10000 bytes. - changed the datatype of the 'nbytes' parameter in ffpbyt from 'int' to 'long'. Made corresponding datatype change to some internal variables in ffshft. - changed '(unsigned short *)' to '(short *)' in getcolui.c, and changed '(unsigned long *)' to '(long *)' in getcoluj.c, to work around problem with the VAX/VMS cc compiler. Version 1.23 - 24 April 1997 - modified ffcins and ffdins (in editcol.c) to simply return without error if there are no (zero) rows in the table. Version 1.22 - 18 April 1997 - fixed bug in ffgcpr that caused it to think that all values were undefined in ASCII tables columns that have TNULLn = ' ' (i.e., the TNULLn keyword value is a string of blanks. - fixed bug in the ffgcl[bdeijk,ui,uj] family of routines when parsing a numeric value in an ASCII table. The returned values would have the decimal place shifted to the left if the table field contained an explicit decimal point followed by blanks. Example: in an F5.2 column, the value '16. ' would be returned as 0.16. If the trailing zeros were present, then cfitsio returned the correct value (e.g., '16.00' returns 16.). - fixed another bug in the ffgcl[bdeijk,ui,uj] family of routines that caused them to misread values in an ASCII table in rows following an undefined value when all the values were read at once in a single call to the routine. Version 1.21 - 26 March 1997 - added general support for reading and writing unsigned integer keywords, images, and binary table column values. - fixed bug in the way the column number was used in ffgsve and similar routines. This bug caused cfitsio to read (colnum - 1) rather than the desired column. - fixed a bug in ftgkls that prevented it from reading more than one continuation line of a long string keyword value. - fixed the definition of fits_write_longwarn in longnam.h Version 1.20 - 29 Jan 1997 - when creating a binary table with variable length vector columns, if the calling routine does not specify a value for the maximum length of the vector (e.g., TFORMn = '1PE(400)') then cfitsio will automatically calculate the maximum value and append it to the TFORM value when the binary table is first closed. - added the set of routines to do coordinate system transformations - added support for wildcards ('*', '?', and '#') in the input keyword name when reading, modifying, or deleting keywords. - added new general keyword reading routine, ffgnxk, to return the next keyword whose name matches a list of template names, but does not match any names on a second template list. - modified ftgrec so that it simply moves to the beginning of the header if the input keyword number = 0 - added check in ffdelt to make sure the input fits file pointer is not already null - added check in ffcopy to make sure the output HDU does not already contain any keywords (it must be empty). - modified ffgcls so that it does not test if each string column value equals the null string value if the null string value is longer than the width of the column. - fixed bug in ftgtdm that caused it to fail if the TDIMn keyword did not exist in the FITS file - modified testprog.c to include tests of keyword wildcards and the WCS coordinate transformation routines. - added a test for 'EMX' in fitsio2.h so that cfitsio builds correctly on a PC running OS/2. Version 1.11 - 04 Dec 1996 - modified the testprog.c program that is included with the distribution, so that the output FITS file is identical to that produced by the Fortran FITSIO test program. - changed all instances of the 'extname' variable to 'extnm' to avoid a conflict with the -Dextname switch in cfortran.h on HP machines. - in all the routines like ffi4fi1, which convert an array of values to integers just prior to writing them to the FITS file, the integer value is now rounded to the nearest integer rather than truncated. (ffi4fi1, ffi4fi2, ffi4fi4, etc) - changed ffgcfl (and hence ffgcl) so that the input value of the logical array element is not changed if the corresponding FITS value is undefined. - in ffgacl, the returned value of TBCOL was off by 1 (too small) - fixed the comment of EXTNAME keyword to read 'binary table' instead of 'ASCII table' in the header of binary tables. Version 1.101 - 17 Nov 1996 - Made major I/O efficiency improvements by adding internal buffers rather than directly reading or writing to disk. Access to columns in binary tables is now 50 - 150 times faster. Access to FITS image is also slightly faster. - made significant speed improvements when reading numerical data in FITS ASCII tables by writing my own number parsing routines rather than using the sscanf C library routine. This change requires that the -lm argument now be included when linking a program that calls cfitsio (under UNIX). - regrouped the source files into logically related sets of routines. The Makefile now runs much faster since every single routine is not split into a separate file. - now use the memcpy function, rather than a 'for' loop in several places for added efficiency - redesigned the low-level binary table read and write routines (ffpbytoff and ffgbytoff) for greater efficiency. - added a new error status: 103 = too many open FITS files. - added a 'extern "C"' statement around the function prototypes in fitsio.h, to support use of cfitsio by C++ compilers. - fixed routines for writing or reading fixed-length substrings within a binary table ASCII column, with TFORM values of of the form 'rAw' where 'r' is the total width of the ASCII column and 'w' is the width of a substring within the column. - no longer automatically rewrite the END card and following fill values if they are already correct. - all the 'get keyword value and comment' routines have been changed so that the comment is not returned if the input pointer is NULL. - added new routine to return the optimum number of tables rows that should be read or written at one time for optimum efficiency. - modified the way numerical values in ASCII tables are parsed so that embedded spaces in the value are ignored, and implicit decimal points are now supported. (e.g, the string '123E 12' in a 'E10.2' format column will be interpreted as 1.23 * 10**12). - modified ffpcl and ffgcl to support binary table columns of all datatype (added logical, bit, complex, and double complex) - when writing numerical data to ASCII table columns, the ffpcl_ routines now return an overflow error if a value is too large to be expressed in the column format. - closed small memory leak in ffpcls. - initialized the 'incre' variable in ffgcpr to eliminate compiler warning. Version 1.04 - 17 Sept 1996 - added README.MacOS and cfitsio_mac.sit.hqx to the distribution to support the Mac platforms. - fixed bug in ffpdfl that caused an EOF error (107) when a program creates a new extension that is an exact multiple of 2880 bytes long, AND the program does not write a value to the last element in the table or image. - fixed bug in all the ffgsf* and ffgcv* routines which caused core dumps when reading null values in a table. Version 1.03 - 20 August 1996 - added full support for reading and writing the C 'int' data type. This was a problem on Alpha/OSF where short, int, and long datatypes are 2, 4, and 8 bytes long, respectively. - cleaned up the code in the byte-swapping routines. - renamed the file 'longname.h' to 'longnam.h' to avoid conflict with a file with the same name in another unrelated package. Version 1.02 - 15 August 1996 - ffgtbp was not correctly reading the THEAP keyword, hence would not correctly read variable length data in binary tables if the heap was not at the default starting location (i.e., starting immediately after the fixed length table). - now force the cbuff variable in ffpcl_ and ffgcl_ to be aligned on a double word boundary. Non-alignment can cause program to crash on some systems. Version 1.01 - 12 August 1996 - initial public release cfitsio-3.47/drvrfile.c0000644000225700000360000006753413464573431014407 0ustar cagordonlhea/* This file, drvrfile.c contains driver routines for disk files. */ /* The FITSIO software was written by William Pence at the High Energy */ /* Astrophysic Science Archive Research Center (HEASARC) at the NASA */ /* Goddard Space Flight Center. */ #include #include #include "fitsio2.h" #include "group.h" /* needed for fits_get_cwd in file_create */ #if defined(unix) || defined(__unix__) || defined(__unix) #include /* needed in file_openfile */ #ifdef REPLACE_LINKS #include #include #endif #endif #ifdef HAVE_FTRUNCATE #if defined(unix) || defined(__unix__) || defined(__unix) || defined(HAVE_UNISTD_H) #include /* needed for getcwd prototype on unix machines */ #endif #endif #define IO_SEEK 0 /* last file I/O operation was a seek */ #define IO_READ 1 /* last file I/O operation was a read */ #define IO_WRITE 2 /* last file I/O operation was a write */ static char file_outfile[FLEN_FILENAME]; typedef struct /* structure containing disk file structure */ { FILE *fileptr; LONGLONG currentpos; int last_io_op; } diskdriver; static diskdriver handleTable[NMAXFILES]; /* allocate diskfile handle tables */ /*--------------------------------------------------------------------------*/ int file_init(void) { int ii; for (ii = 0; ii < NMAXFILES; ii++) /* initialize all empty slots in table */ { handleTable[ii].fileptr = 0; } return(0); } /*--------------------------------------------------------------------------*/ int file_setoptions(int options) { /* do something with the options argument, to stop compiler warning */ options = 0; return(options); } /*--------------------------------------------------------------------------*/ int file_getoptions(int *options) { *options = 0; return(0); } /*--------------------------------------------------------------------------*/ int file_getversion(int *version) { *version = 10; return(0); } /*--------------------------------------------------------------------------*/ int file_shutdown(void) { return(0); } /*--------------------------------------------------------------------------*/ int file_open(char *filename, int rwmode, int *handle) { FILE *diskfile; int copyhandle, ii, status; char recbuf[2880]; size_t nread; /* if an output filename has been specified as part of the input file, as in "inputfile.fits(outputfile.fit)" then we have to create the output file, copy the input to it, then reopen the the new copy. */ if (*file_outfile) { /* open the original file, with readonly access */ status = file_openfile(filename, READONLY, &diskfile); if (status) { file_outfile[0] = '\0'; return(status); } /* create the output file */ status = file_create(file_outfile,handle); if (status) { ffpmsg("Unable to create output file for copy of input file:"); ffpmsg(file_outfile); file_outfile[0] = '\0'; return(status); } /* copy the file from input to output */ while(0 != (nread = fread(recbuf,1,2880, diskfile))) { status = file_write(*handle, recbuf, nread); if (status) { file_outfile[0] = '\0'; return(status); } } /* close both files */ fclose(diskfile); copyhandle = *handle; file_close(*handle); *handle = copyhandle; /* reuse the old file handle */ /* reopen the new copy, with correct rwmode */ status = file_openfile(file_outfile, rwmode, &diskfile); file_outfile[0] = '\0'; } else { *handle = -1; for (ii = 0; ii < NMAXFILES; ii++) /* find empty slot in table */ { if (handleTable[ii].fileptr == 0) { *handle = ii; break; } } if (*handle == -1) return(TOO_MANY_FILES); /* too many files opened */ /*open the file */ status = file_openfile(filename, rwmode, &diskfile); } handleTable[*handle].fileptr = diskfile; handleTable[*handle].currentpos = 0; handleTable[*handle].last_io_op = IO_SEEK; return(status); } /*--------------------------------------------------------------------------*/ int file_openfile(char *filename, int rwmode, FILE **diskfile) /* lowest level routine to physically open a disk file */ { char mode[4]; #if defined(unix) || defined(__unix__) || defined(__unix) char tempname[1024], *cptr, user[80]; struct passwd *pwd; int ii = 0; #if defined(REPLACE_LINKS) struct stat stbuf; int success = 0; size_t n; FILE *f1, *f2; char buf[BUFSIZ]; #endif #endif if (rwmode == READWRITE) { strcpy(mode, "r+b"); /* open existing file with read-write */ } else { strcpy(mode, "rb"); /* open existing file readonly */ } #if MACHINE == ALPHAVMS || MACHINE == VAXVMS /* specify VMS record structure: fixed format, 2880 byte records */ /* but force stream mode access to enable random I/O access */ *diskfile = fopen(filename, mode, "rfm=fix", "mrs=2880", "ctx=stm"); #elif defined(unix) || defined(__unix__) || defined(__unix) /* support the ~user/file.fits or ~/file.fits filenames in UNIX */ if (*filename == '~') { if (filename[1] == '/') { cptr = getenv("HOME"); if (cptr) { if (strlen(cptr) + strlen(filename+1) > 1023) return(FILE_NOT_OPENED); strcpy(tempname, cptr); strcat(tempname, filename+1); } else { if (strlen(filename) > 1023) return(FILE_NOT_OPENED); strcpy(tempname, filename); } } else { /* copy user name */ cptr = filename+1; while (*cptr && (*cptr != '/')) { user[ii] = *cptr; cptr++; ii++; } user[ii] = '\0'; /* get structure that includes name of user's home directory */ pwd = getpwnam(user); /* copy user's home directory */ if (strlen(pwd->pw_dir) + strlen(cptr) > 1023) return(FILE_NOT_OPENED); strcpy(tempname, pwd->pw_dir); strcat(tempname, cptr); } *diskfile = fopen(tempname, mode); } else { /* don't need to expand the input file name */ *diskfile = fopen(filename, mode); #if defined(REPLACE_LINKS) if (!(*diskfile) && (rwmode == READWRITE)) { /* failed to open file with READWRITE privilege. Test if */ /* the file we are trying to open is a soft link to a file that */ /* doesn't have write privilege. */ lstat(filename, &stbuf); if ((stbuf.st_mode & S_IFMT) == S_IFLNK) /* is this a soft link? */ { if ((f1 = fopen(filename, "rb")) != 0) /* try opening READONLY */ { if (strlen(filename) + 7 > 1023) return(FILE_NOT_OPENED); strcpy(tempname, filename); strcat(tempname, ".TmxFil"); if ((f2 = fopen(tempname, "wb")) != 0) /* create temp file */ { success = 1; while ((n = fread(buf, 1, BUFSIZ, f1)) > 0) { /* copy linked file to local temporary file */ if (fwrite(buf, 1, n, f2) != n) { success = 0; break; } } fclose(f2); } fclose(f1); if (success) { /* delete link and rename temp file to previous link name */ remove(filename); rename(tempname, filename); /* try once again to open the file with write access */ *diskfile = fopen(filename, mode); } else remove(tempname); /* clean up the failed copy */ } } } #endif } #else /* other non-UNIX machines */ *diskfile = fopen(filename, mode); #endif if (!(*diskfile)) /* couldn't open file */ { return(FILE_NOT_OPENED); } return(0); } /*--------------------------------------------------------------------------*/ int file_create(char *filename, int *handle) { FILE *diskfile; int ii; char mode[4]; int status = 0, rootlen, rootlen2, slen; char *cptr, *cpos; char cwd[FLEN_FILENAME], absURL[FLEN_FILENAME]; char rootstring[256], rootstring2[256]; char username[FLEN_FILENAME], userroot[FLEN_FILENAME], userroot2[FLEN_FILENAME]; cptr = getenv("HERA_DATA_DIRECTORY"); if (cptr) { /* This environment variable is defined in the Hera data analysis environment. */ /* It specifies the root directory path to the users data directories. */ /* CFITSIO will verify that the path to the file that is to be created */ /* is within this root directory + the user's home directory name. */ /* printf("env = %s\n",cptr); */ if (strlen(cptr) > 200) /* guard against possible string overflows */ return(FILE_NOT_CREATED); /* environment variable has the form "path/one/;/path/two/" where the */ /* second path is optional */ strcpy(rootstring, cptr); cpos = strchr(rootstring, ';'); if (cpos) { *cpos = '\0'; cpos++; strcpy(rootstring2, cpos); } else { *rootstring2 = '\0'; } /* printf("%s, %s\n", rootstring, rootstring2); printf("CWD = %s\n", cwd); printf("rootstring=%s, cwd=%s.\n", rootstring, cwd); */ /* Get the current working directory */ fits_get_cwd(cwd, &status); slen = strlen(cwd); if ((slen < FLEN_FILENAME) && cwd[slen-1] != '/') strcat(cwd,"/"); /* make sure the CWD ends with slash */ /* check that CWD string matches the rootstring */ rootlen = strlen(rootstring); if (strncmp(rootstring, cwd, rootlen)) { ffpmsg("invalid CWD: does not match root data directory"); return(FILE_NOT_CREATED); } else { /* get the user name from CWD (it follows the root string) */ strncpy(username, cwd+rootlen, 50); /* limit length of user name */ username[50]=0; cpos=strchr(username, '/'); if (!cpos) { ffpmsg("invalid CWD: not equal to root data directory + username"); return(FILE_NOT_CREATED); } else { *(cpos+1) = '\0'; /* truncate user name string */ /* construct full user root name */ strcpy(userroot, rootstring); strcat(userroot, username); rootlen = strlen(userroot); /* construct alternate full user root name */ strcpy(userroot2, rootstring2); strcat(userroot2, username); rootlen2 = strlen(userroot2); /* convert the input filename to absolute path relative to the CWD */ fits_relurl2url(cwd, filename, absURL, &status); /* printf("username = %s\n", username); printf("userroot = %s\n", userroot); printf("userroot2 = %s\n", userroot2); printf("filename = %s\n", filename); printf("ABS = %s\n", absURL); */ /* check that CWD string matches the rootstring or alternate root string */ if ( strncmp(userroot, absURL, rootlen) && strncmp(userroot2, absURL, rootlen2) ) { ffpmsg("invalid filename: path not within user directory"); return(FILE_NOT_CREATED); } } } /* if we got here, then the input filename appears to be valid */ } *handle = -1; for (ii = 0; ii < NMAXFILES; ii++) /* find empty slot in table */ { if (handleTable[ii].fileptr == 0) { *handle = ii; break; } } if (*handle == -1) return(TOO_MANY_FILES); /* too many files opened */ strcpy(mode, "w+b"); /* create new file with read-write */ diskfile = fopen(filename, "r"); /* does file already exist? */ if (diskfile) { fclose(diskfile); /* close file and exit with error */ return(FILE_NOT_CREATED); } #if MACHINE == ALPHAVMS || MACHINE == VAXVMS /* specify VMS record structure: fixed format, 2880 byte records */ /* but force stream mode access to enable random I/O access */ diskfile = fopen(filename, mode, "rfm=fix", "mrs=2880", "ctx=stm"); #else diskfile = fopen(filename, mode); #endif if (!(diskfile)) /* couldn't create file */ { return(FILE_NOT_CREATED); } handleTable[ii].fileptr = diskfile; handleTable[ii].currentpos = 0; handleTable[ii].last_io_op = IO_SEEK; return(0); } /*--------------------------------------------------------------------------*/ int file_truncate(int handle, LONGLONG filesize) /* truncate the diskfile to a new smaller size */ { #ifdef HAVE_FTRUNCATE int fdesc; fdesc = fileno(handleTable[handle].fileptr); ftruncate(fdesc, (OFF_T) filesize); file_seek(handle, filesize); handleTable[handle].currentpos = filesize; handleTable[handle].last_io_op = IO_SEEK; #endif return(0); } /*--------------------------------------------------------------------------*/ int file_size(int handle, LONGLONG *filesize) /* return the size of the file in bytes */ { OFF_T position1,position2; FILE *diskfile; diskfile = handleTable[handle].fileptr; #if defined(_MSC_VER) && (_MSC_VER >= 1400) /* call the VISUAL C++ version of the routines which support */ /* Large Files (> 2GB) if they are supported (since VC 8.0) */ position1 = _ftelli64(diskfile); /* save current postion */ if (position1 < 0) return(SEEK_ERROR); if (_fseeki64(diskfile, 0, 2) != 0) /* seek to end of file */ return(SEEK_ERROR); position2 = _ftelli64(diskfile); /* get file size */ if (position2 < 0) return(SEEK_ERROR); if (_fseeki64(diskfile, position1, 0) != 0) /* seek back to original pos */ return(SEEK_ERROR); #elif _FILE_OFFSET_BITS - 0 == 64 /* call the newer ftello and fseeko routines , which support */ /* Large Files (> 2GB) if they are supported. */ position1 = ftello(diskfile); /* save current postion */ if (position1 < 0) return(SEEK_ERROR); if (fseeko(diskfile, 0, 2) != 0) /* seek to end of file */ return(SEEK_ERROR); position2 = ftello(diskfile); /* get file size */ if (position2 < 0) return(SEEK_ERROR); if (fseeko(diskfile, position1, 0) != 0) /* seek back to original pos */ return(SEEK_ERROR); #else position1 = ftell(diskfile); /* save current postion */ if (position1 < 0) return(SEEK_ERROR); if (fseek(diskfile, 0, 2) != 0) /* seek to end of file */ return(SEEK_ERROR); position2 = ftell(diskfile); /* get file size */ if (position2 < 0) return(SEEK_ERROR); if (fseek(diskfile, position1, 0) != 0) /* seek back to original pos */ return(SEEK_ERROR); #endif *filesize = (LONGLONG) position2; return(0); } /*--------------------------------------------------------------------------*/ int file_close(int handle) /* close the file */ { if (fclose(handleTable[handle].fileptr) ) return(FILE_NOT_CLOSED); handleTable[handle].fileptr = 0; return(0); } /*--------------------------------------------------------------------------*/ int file_remove(char *filename) /* delete the file from disk */ { remove(filename); return(0); } /*--------------------------------------------------------------------------*/ int file_flush(int handle) /* flush the file */ { if (fflush(handleTable[handle].fileptr) ) return(WRITE_ERROR); /* The flush operation is not supposed to move the internal */ /* file pointer, but it does on some Windows-95 compilers and */ /* perhaps others, so seek to original position to be sure. */ /* This seek will do no harm on other systems. */ #if MACHINE == IBMPC if (file_seek(handle, handleTable[handle].currentpos)) return(SEEK_ERROR); #endif return(0); } /*--------------------------------------------------------------------------*/ int file_seek(int handle, LONGLONG offset) /* seek to position relative to start of the file */ { #if defined(_MSC_VER) && (_MSC_VER >= 1400) /* Microsoft visual studio C++ */ /* _fseeki64 supported beginning with version 8.0 */ if (_fseeki64(handleTable[handle].fileptr, (OFF_T) offset, 0) != 0) return(SEEK_ERROR); #elif _FILE_OFFSET_BITS - 0 == 64 if (fseeko(handleTable[handle].fileptr, (OFF_T) offset, 0) != 0) return(SEEK_ERROR); #else if (fseek(handleTable[handle].fileptr, (OFF_T) offset, 0) != 0) return(SEEK_ERROR); #endif handleTable[handle].currentpos = offset; return(0); } /*--------------------------------------------------------------------------*/ int file_read(int hdl, void *buffer, long nbytes) /* read bytes from the current position in the file */ { long nread; char *cptr; if (handleTable[hdl].last_io_op == IO_WRITE) { if (file_seek(hdl, handleTable[hdl].currentpos)) return(SEEK_ERROR); } nread = (long) fread(buffer, 1, nbytes, handleTable[hdl].fileptr); if (nread == 1) { cptr = (char *) buffer; /* some editors will add a single end-of-file character to a file */ /* Ignore it if the character is a zero, 10, or 32 */ if (*cptr == 0 || *cptr == 10 || *cptr == 32) return(END_OF_FILE); else return(READ_ERROR); } else if (nread != nbytes) { return(READ_ERROR); } handleTable[hdl].currentpos += nbytes; handleTable[hdl].last_io_op = IO_READ; return(0); } /*--------------------------------------------------------------------------*/ int file_write(int hdl, void *buffer, long nbytes) /* write bytes at the current position in the file */ { if (handleTable[hdl].last_io_op == IO_READ) { if (file_seek(hdl, handleTable[hdl].currentpos)) return(SEEK_ERROR); } if((long) fwrite(buffer, 1, nbytes, handleTable[hdl].fileptr) != nbytes) return(WRITE_ERROR); handleTable[hdl].currentpos += nbytes; handleTable[hdl].last_io_op = IO_WRITE; return(0); } /*--------------------------------------------------------------------------*/ int file_compress_open(char *filename, int rwmode, int *hdl) /* This routine opens the compressed diskfile by creating a new uncompressed file then opening it. The input file name (the name of the compressed file) gets replaced with the name of the uncompressed file, which is initially stored in the global file_outfile string. file_outfile then gets set to a null string. */ { FILE *indiskfile, *outdiskfile; int status; char *cptr; /* open the compressed disk file */ status = file_openfile(filename, READONLY, &indiskfile); if (status) { ffpmsg("failed to open compressed disk file (file_compress_open)"); ffpmsg(filename); return(status); } /* name of the output uncompressed file is stored in the */ /* global variable called 'file_outfile'. */ cptr = file_outfile; if (*cptr == '!') { /* clobber any existing file with the same name */ cptr++; remove(cptr); } else { outdiskfile = fopen(file_outfile, "r"); /* does file already exist? */ if (outdiskfile) { ffpmsg("uncompressed file already exists: (file_compress_open)"); ffpmsg(file_outfile); fclose(outdiskfile); /* close file and exit with error */ file_outfile[0] = '\0'; return(FILE_NOT_CREATED); } } outdiskfile = fopen(cptr, "w+b"); /* create new file */ if (!outdiskfile) { ffpmsg("could not create uncompressed file: (file_compress_open)"); ffpmsg(file_outfile); file_outfile[0] = '\0'; return(FILE_NOT_CREATED); } /* uncompress file into another file */ uncompress2file(filename, indiskfile, outdiskfile, &status); fclose(indiskfile); fclose(outdiskfile); if (status) { ffpmsg("error in file_compress_open: failed to uncompressed file:"); ffpmsg(filename); ffpmsg(" into new output file:"); ffpmsg(file_outfile); file_outfile[0] = '\0'; return(status); } strcpy(filename, cptr); /* switch the names */ file_outfile[0] = '\0'; status = file_open(filename, rwmode, hdl); return(status); } /*--------------------------------------------------------------------------*/ int file_is_compressed(char *filename) /* I - FITS file name */ /* Test if the disk file is compressed. Returns 1 if compressed, 0 if not. This may modify the filename string by appending a compression suffex. */ { FILE *diskfile; unsigned char buffer[2]; char tmpfilename[FLEN_FILENAME]; /* Open file. Try various suffix combinations */ if (file_openfile(filename, 0, &diskfile)) { if (strlen(filename) > FLEN_FILENAME - 5) return(0); strcpy(tmpfilename,filename); strcat(filename,".gz"); if (file_openfile(filename, 0, &diskfile)) { #if HAVE_BZIP2 strcpy(filename,tmpfilename); strcat(filename,".bz2"); if (file_openfile(filename, 0, &diskfile)) { #endif strcpy(filename, tmpfilename); strcat(filename,".Z"); if (file_openfile(filename, 0, &diskfile)) { strcpy(filename, tmpfilename); strcat(filename,".z"); /* it's often lower case on CDROMs */ if (file_openfile(filename, 0, &diskfile)) { strcpy(filename, tmpfilename); strcat(filename,".zip"); if (file_openfile(filename, 0, &diskfile)) { strcpy(filename, tmpfilename); strcat(filename,"-z"); /* VMS suffix */ if (file_openfile(filename, 0, &diskfile)) { strcpy(filename, tmpfilename); strcat(filename,"-gz"); /* VMS suffix */ if (file_openfile(filename, 0, &diskfile)) { strcpy(filename,tmpfilename); /* restore original name */ return(0); /* file not found */ } } } } } #if HAVE_BZIP2 } #endif } } if (fread(buffer, 1, 2, diskfile) != 2) /* read 2 bytes */ { fclose(diskfile); /* error reading file so just return */ return(0); } fclose(diskfile); /* see if the 2 bytes have the magic values for a compressed file */ if ( (memcmp(buffer, "\037\213", 2) == 0) || /* GZIP */ (memcmp(buffer, "\120\113", 2) == 0) || /* PKZIP */ (memcmp(buffer, "\037\036", 2) == 0) || /* PACK */ (memcmp(buffer, "\037\235", 2) == 0) || /* LZW */ #if HAVE_BZIP2 (memcmp(buffer, "BZ", 2) == 0) || /* BZip2 */ #endif (memcmp(buffer, "\037\240", 2) == 0)) /* LZH */ { return(1); /* this is a compressed file */ } else { return(0); /* not a compressed file */ } } /*--------------------------------------------------------------------------*/ int file_checkfile (char *urltype, char *infile, char *outfile) { /* special case: if file:// driver, check if the file is compressed */ if ( file_is_compressed(infile) ) { /* if output file has been specified, save the name for future use: */ /* This is the name of the uncompressed file to be created on disk. */ if (strlen(outfile)) { if (!strncmp(outfile, "mem:", 4) ) { /* uncompress the file in memory, with READ and WRITE access */ strcpy(urltype, "compressmem://"); /* use special driver */ *file_outfile = '\0'; } else { strcpy(urltype, "compressfile://"); /* use special driver */ /* don't copy the "file://" prefix, if present. */ if (!strncmp(outfile, "file://", 7) ) strcpy(file_outfile,outfile+7); else strcpy(file_outfile,outfile); } } else { /* uncompress the file in memory */ strcpy(urltype, "compress://"); /* use special driver */ *file_outfile = '\0'; /* no output file was specified */ } } else /* an ordinary, uncompressed FITS file on disk */ { /* save the output file name for later use when opening the file. */ /* In this case, the file to be opened will be opened READONLY, */ /* and copied to this newly created output file. The original file */ /* will be closed, and the copy will be opened by CFITSIO for */ /* subsequent processing (possibly with READWRITE access). */ if (strlen(outfile)) { file_outfile[0] = '\0'; strncat(file_outfile,outfile,FLEN_FILENAME-1); } } return 0; } /**********************************************************************/ /**********************************************************************/ /**********************************************************************/ /**** driver routines for stream//: device (stdin or stdout) ********/ /*--------------------------------------------------------------------------*/ int stream_open(char *filename, int rwmode, int *handle) { /* read from stdin */ if (filename) rwmode = 1; /* dummy statement to suppress unused parameter compiler warning */ *handle = 1; /* 1 = stdin */ return(0); } /*--------------------------------------------------------------------------*/ int stream_create(char *filename, int *handle) { /* write to stdout */ if (filename) /* dummy statement to suppress unused parameter compiler warning */ *handle = 2; else *handle = 2; /* 2 = stdout */ return(0); } /*--------------------------------------------------------------------------*/ int stream_size(int handle, LONGLONG *filesize) /* return the size of the file in bytes */ { handle = 0; /* suppress unused parameter compiler warning */ /* this operation is not supported in a stream; return large value */ *filesize = LONG_MAX; return(0); } /*--------------------------------------------------------------------------*/ int stream_close(int handle) /* don't have to close stdin or stdout */ { handle = 0; /* suppress unused parameter compiler warning */ return(0); } /*--------------------------------------------------------------------------*/ int stream_flush(int handle) /* flush the file */ { if (handle == 2) fflush(stdout); return(0); } /*--------------------------------------------------------------------------*/ int stream_seek(int handle, LONGLONG offset) /* seeking is not allowed in a stream */ { offset = handle; /* suppress unused parameter compiler warning */ return(1); } /*--------------------------------------------------------------------------*/ int stream_read(int hdl, void *buffer, long nbytes) /* reading from stdin stream */ { long nread; if (hdl != 1) return(1); /* can only read from stdin */ nread = (long) fread(buffer, 1, nbytes, stdin); if (nread != nbytes) { /* return(READ_ERROR); */ return(END_OF_FILE); } return(0); } /*--------------------------------------------------------------------------*/ int stream_write(int hdl, void *buffer, long nbytes) /* write bytes at the current position in the file */ { if (hdl != 2) return(1); /* can only write to stdout */ if((long) fwrite(buffer, 1, nbytes, stdout) != nbytes) return(WRITE_ERROR); return(0); } cfitsio-3.47/drvrgsiftp.c0000644000225700000360000003321013464573431014744 0ustar cagordonlhea /* This file, drvrgsiftp.c contains driver routines for gsiftp files. */ /* Andrea Barisani */ /* Taffoni Giuliano */ #ifdef HAVE_NET_SERVICES #ifdef HAVE_GSIFTP #include #include #include #include #include #include "fitsio2.h" #include #define MAXLEN 1200 #define NETTIMEOUT 80 #define MAX_BUFFER_SIZE_R 1024 #define MAX_BUFFER_SIZE_W (64*1024) static int gsiftpopen = 0; static int global_offset = 0; static int free_gsiftp_tmp=0; static int gsiftp_get(char *filename, FILE **gsiftpfile, int num_streams); static globus_mutex_t lock; static globus_cond_t cond; static globus_bool_t done; static char *gsiftp_tmpfile; static char *gsiftpurl = NULL; static char gsiftp_tmpdir[MAXLEN]; static jmp_buf env; /* holds the jump buffer for setjmp/longjmp pairs */ static void signal_handler(int sig); int gsiftp_init(void) { if (getenv("GSIFTP_TMPFILE")) { gsiftp_tmpfile = getenv("GSIFTP_TMPFILE"); } else { strncpy(gsiftp_tmpdir, "/tmp/gsiftp_XXXXXX", sizeof gsiftp_tmpdir); if (mkdtemp(gsiftp_tmpdir) == NULL) { ffpmsg("Cannot create temporary directory!"); return (FILE_NOT_OPENED); } gsiftp_tmpfile = malloc(strlen(gsiftp_tmpdir) + strlen("/gsiftp_buffer.tmp")+1); gsiftp_tmpfile[0]=0; free_gsiftp_tmp=1; strcat(gsiftp_tmpfile, gsiftp_tmpdir); strcat(gsiftp_tmpfile, "/gsiftp_buffer.tmp"); } return file_init(); } int gsiftp_shutdown(void) { free(gsiftpurl); if (free_gsiftp_tmp) free(gsiftp_tmpfile); return file_shutdown(); } int gsiftp_setoptions(int options) { return file_setoptions(options); } int gsiftp_getoptions(int *options) { return file_getoptions(options); } int gsiftp_getversion(int *version) { return file_getversion(version); } int gsiftp_checkfile(char *urltype, char *infile, char *outfile) { return file_checkfile(urltype, infile, outfile); } int gsiftp_open(char *filename, int rwmode, int *handle) { FILE *gsiftpfile; int num_streams; if (getenv("GSIFTP_STREAMS")) { num_streams = (int)getenv("GSIFTP_STREAMS"); } else { num_streams = 1; } if (rwmode) { gsiftpopen = 2; } else { gsiftpopen = 1; } if (gsiftpurl) free(gsiftpurl); gsiftpurl = strdup(filename); if (setjmp(env) != 0) { ffpmsg("Timeout (gsiftp_open)"); goto error; } signal(SIGALRM, signal_handler); alarm(NETTIMEOUT); if (gsiftp_get(filename,&gsiftpfile,num_streams)) { alarm(0); ffpmsg("Unable to open gsiftp file (gsiftp_open)"); ffpmsg(filename); goto error; } fclose(gsiftpfile); signal(SIGALRM, SIG_DFL); alarm(0); return file_open(gsiftp_tmpfile, rwmode, handle); error: alarm(0); signal(SIGALRM, SIG_DFL); return (FILE_NOT_OPENED); } int gsiftp_create(char *filename, int *handle) { if (gsiftpurl) free(gsiftpurl); gsiftpurl = strdup(filename); return file_create(gsiftp_tmpfile, handle); } int gsiftp_truncate(int handle, LONGLONG filesize) { return file_truncate(handle, filesize); } int gsiftp_size(int handle, LONGLONG *filesize) { return file_size(handle, filesize); } int gsiftp_flush(int handle) { FILE *gsiftpfile; int num_streams; if (getenv("GSIFTP_STREAMS")) { num_streams = (int)getenv("GSIFTP_STREAMS"); } else { num_streams = 1; } int rc = file_flush(handle); if (gsiftpopen != 1) { if (setjmp(env) != 0) { ffpmsg("Timeout (gsiftp_write)"); goto error; } signal(SIGALRM, signal_handler); alarm(NETTIMEOUT); if (gsiftp_put(gsiftpurl,&gsiftpfile,num_streams)) { alarm(0); ffpmsg("Unable to open gsiftp file (gsiftp_flush)"); ffpmsg(gsiftpurl); goto error; } fclose(gsiftpfile); signal(SIGALRM, SIG_DFL); alarm(0); } return rc; error: alarm(0); signal(SIGALRM, SIG_DFL); return (FILE_NOT_OPENED); } int gsiftp_seek(int handle, LONGLONG offset) { return file_seek(handle, offset); } int gsiftp_read(int hdl, void *buffer, long nbytes) { return file_read(hdl, buffer, nbytes); } int gsiftp_write(int hdl, void *buffer, long nbytes) { return file_write(hdl, buffer, nbytes); } int gsiftp_close(int handle) { unlink(gsiftp_tmpfile); if (gsiftp_tmpdir) rmdir(gsiftp_tmpdir); return file_close(handle); } static void done_cb( void * user_arg, globus_ftp_client_handle_t * handle, globus_object_t * err) { if(err){ fprintf(stderr, "%s", globus_object_printable_to_string(err)); } globus_mutex_lock(&lock); done = GLOBUS_TRUE; globus_cond_signal(&cond); globus_mutex_unlock(&lock); return; } static void data_cb_read( void * user_arg, globus_ftp_client_handle_t * handle, globus_object_t * err, globus_byte_t * buffer, globus_size_t length, globus_off_t offset, globus_bool_t eof) { if(err) { fprintf(stderr, "%s", globus_object_printable_to_string(err)); } else { FILE* fd = (FILE*) user_arg; int rc = fwrite(buffer, 1, length, fd); if (ferror(fd)) { printf("Read error in function data_cb_read; errno = %d\n", errno); return; } if (!eof) { globus_ftp_client_register_read(handle, buffer, MAX_BUFFER_SIZE_R, data_cb_read, (void*) fd); } } return; } static void data_cb_write( void * user_arg, globus_ftp_client_handle_t * handle, globus_object_t * err, globus_byte_t * buffer, globus_size_t length, globus_off_t offset, globus_bool_t eof) { int curr_offset; if(err) { fprintf(stderr, "%s", globus_object_printable_to_string(err)); } else { if (!eof) { FILE* fd = (FILE*) user_arg; int rc; globus_mutex_lock(&lock); curr_offset = global_offset; rc = fread(buffer, 1, MAX_BUFFER_SIZE_W, fd); global_offset += rc; globus_mutex_unlock(&lock); if (ferror(fd)) { printf("Read error in function data_cb_write; errno = %d\n", errno); return; } globus_ftp_client_register_write(handle, buffer, rc, curr_offset, feof(fd) != 0, data_cb_write, (void*) fd); } else { globus_libc_free(buffer); } } return; } int gsiftp_get(char *filename, FILE **gsiftpfile, int num_streams) { char gsiurl[MAXLEN]; globus_ftp_client_handle_t handle; globus_ftp_client_operationattr_t attr; globus_ftp_client_handleattr_t handle_attr; globus_ftp_control_parallelism_t parallelism; globus_ftp_control_layout_t layout; globus_byte_t buffer[MAX_BUFFER_SIZE_R]; globus_size_t buffer_length = sizeof(buffer); globus_result_t result; globus_ftp_client_restart_marker_t restart; globus_ftp_control_type_t filetype; globus_module_activate(GLOBUS_FTP_CLIENT_MODULE); globus_mutex_init(&lock, GLOBUS_NULL); globus_cond_init(&cond, GLOBUS_NULL); globus_ftp_client_handle_init(&handle, GLOBUS_NULL); globus_ftp_client_handleattr_init(&handle_attr); globus_ftp_client_operationattr_init(&attr); layout.mode = GLOBUS_FTP_CONTROL_STRIPING_NONE; globus_ftp_client_restart_marker_init(&restart); globus_ftp_client_operationattr_set_mode( &attr, GLOBUS_FTP_CONTROL_MODE_EXTENDED_BLOCK); if (num_streams >= 1) { parallelism.mode = GLOBUS_FTP_CONTROL_PARALLELISM_FIXED; parallelism.fixed.size = num_streams; globus_ftp_client_operationattr_set_parallelism( &attr, ¶llelism); } globus_ftp_client_operationattr_set_layout(&attr, &layout); filetype = GLOBUS_FTP_CONTROL_TYPE_IMAGE; globus_ftp_client_operationattr_set_type (&attr, filetype); globus_ftp_client_handle_init(&handle, &handle_attr); done = GLOBUS_FALSE; strcpy(gsiurl,"gsiftp://"); if (strlen(gsiurl)+strlen(filename) > MAXLEN-1) { ffpmsg("file name too long (gsiftp_get)"); return (FILE_NOT_OPENED); } strcat(gsiurl,filename); *gsiftpfile = fopen(gsiftp_tmpfile,"w+"); if (!*gsiftpfile) { ffpmsg("Unable to open temporary file!"); return (FILE_NOT_OPENED); } result = globus_ftp_client_get(&handle, gsiurl, &attr, &restart, done_cb, 0); if(result != GLOBUS_SUCCESS) { globus_object_t * err; err = globus_error_get(result); fprintf(stderr, "%s", globus_object_printable_to_string(err)); done = GLOBUS_TRUE; } else { globus_ftp_client_register_read(&handle, buffer, buffer_length, data_cb_read, (void*) *gsiftpfile); } globus_mutex_lock(&lock); while(!done) { globus_cond_wait(&cond, &lock); } globus_mutex_unlock(&lock); globus_ftp_client_handle_destroy(&handle); globus_module_deactivate_all(); return 0; } int gsiftp_put(char *filename, FILE **gsiftpfile, int num_streams) { int i; char gsiurl[MAXLEN]; globus_ftp_client_handle_t handle; globus_ftp_client_operationattr_t attr; globus_ftp_client_handleattr_t handle_attr; globus_ftp_control_parallelism_t parallelism; globus_ftp_control_layout_t layout; globus_byte_t * buffer; globus_size_t buffer_length = sizeof(buffer); globus_result_t result; globus_ftp_client_restart_marker_t restart; globus_ftp_control_type_t filetype; globus_module_activate(GLOBUS_FTP_CLIENT_MODULE); globus_mutex_init(&lock, GLOBUS_NULL); globus_cond_init(&cond, GLOBUS_NULL); globus_ftp_client_handle_init(&handle, GLOBUS_NULL); globus_ftp_client_handleattr_init(&handle_attr); globus_ftp_client_operationattr_init(&attr); layout.mode = GLOBUS_FTP_CONTROL_STRIPING_NONE; globus_ftp_client_restart_marker_init(&restart); globus_ftp_client_operationattr_set_mode( &attr, GLOBUS_FTP_CONTROL_MODE_EXTENDED_BLOCK); if (num_streams >= 1) { parallelism.mode = GLOBUS_FTP_CONTROL_PARALLELISM_FIXED; parallelism.fixed.size = num_streams; globus_ftp_client_operationattr_set_parallelism( &attr, ¶llelism); } globus_ftp_client_operationattr_set_layout(&attr, &layout); filetype = GLOBUS_FTP_CONTROL_TYPE_IMAGE; globus_ftp_client_operationattr_set_type (&attr, filetype); globus_ftp_client_handle_init(&handle, &handle_attr); done = GLOBUS_FALSE; strcpy(gsiurl,"gsiftp://"); if (strlen(gsiurl)+strlen(filename) > MAXLEN-1) { ffpmsg("file name too long (gsiftp_put)"); return (FILE_NOT_OPENED); } strcat(gsiurl,filename); *gsiftpfile = fopen(gsiftp_tmpfile,"r"); if (!*gsiftpfile) { ffpmsg("Unable to open temporary file!"); return (FILE_NOT_OPENED); } result = globus_ftp_client_put(&handle, gsiurl, &attr, &restart, done_cb, 0); if(result != GLOBUS_SUCCESS) { globus_object_t * err; err = globus_error_get(result); fprintf(stderr, "%s", globus_object_printable_to_string(err)); done = GLOBUS_TRUE; } else { int rc; int curr_offset; for (i = 0; i< 2 * num_streams && feof(*gsiftpfile) == 0; i++) { buffer = malloc(MAX_BUFFER_SIZE_W); globus_mutex_lock(&lock); curr_offset = global_offset; rc = fread(buffer, 1, MAX_BUFFER_SIZE_W, *gsiftpfile); global_offset += rc; globus_mutex_unlock(&lock); globus_ftp_client_register_write( &handle, buffer, rc, curr_offset, feof(*gsiftpfile) != 0, data_cb_write, (void*) *gsiftpfile); } } globus_mutex_lock(&lock); while(!done) { globus_cond_wait(&cond, &lock); } globus_mutex_unlock(&lock); globus_ftp_client_handle_destroy(&handle); globus_module_deactivate_all(); return 0; } static void signal_handler(int sig) { switch (sig) { case SIGALRM: /* process for alarm */ longjmp(env,sig); default: { /* Hmm, shouldn't have happend */ exit(sig); } } } #endif #endif cfitsio-3.47/drvrgsiftp.h0000644000225700000360000000142313464573431014752 0ustar cagordonlhea#ifndef _GSIFTP_H #define _GSIFTP_H int gsiftp_init(void); int gsiftp_setoptions(int options); int gsiftp_getoptions(int *options); int gsiftp_getversion(int *version); int gsiftp_shutdown(void); int gsiftp_checkfile(char *urltype, char *infile, char *outfile); int gsiftp_open(char *filename, int rwmode, int *driverhandle); int gsiftp_create(char *filename, int *driverhandle); int gsiftp_truncate(int driverhandle, LONGLONG filesize); int gsiftp_size(int driverhandle, LONGLONG *filesize); int gsiftp_close(int driverhandle); int gsiftp_remove(char *filename); int gsiftp_flush(int driverhandle); int gsiftp_seek(int driverhandle, LONGLONG offset); int gsiftp_read (int driverhandle, void *buffer, long nbytes); int gsiftp_write(int driverhandle, void *buffer, long nbytes); #endif cfitsio-3.47/drvrmem.c0000644000225700000360000011520113464573431014227 0ustar cagordonlhea/* This file, drvrmem.c, contains driver routines for memory files. */ /* The FITSIO software was written by William Pence at the High Energy */ /* Astrophysic Science Archive Research Center (HEASARC) at the NASA */ /* Goddard Space Flight Center. */ #include #include #include /* apparently needed to define size_t */ #include "fitsio2.h" #if HAVE_BZIP2 #include "bzlib.h" #endif /* prototype for .Z file uncompression function in zuncompress.c */ int zuncompress2mem(char *filename, FILE *diskfile, char **buffptr, size_t *buffsize, void *(*mem_realloc)(void *p, size_t newsize), size_t *filesize, int *status); #if HAVE_BZIP2 /* prototype for .bz2 uncompression function (in this file) */ void bzip2uncompress2mem(char *filename, FILE *diskfile, int hdl, size_t* filesize, int* status); #endif #define RECBUFLEN 1000 static char stdin_outfile[FLEN_FILENAME]; typedef struct /* structure containing mem file structure */ { char **memaddrptr; /* Pointer to memory address pointer; */ /* This may or may not point to memaddr. */ char *memaddr; /* Pointer to starting memory address; may */ /* not always be used, so use *memaddrptr instead */ size_t *memsizeptr; /* Pointer to the size of the memory allocation. */ /* This may or may not point to memsize. */ size_t memsize; /* Size of the memory allocation; this may not */ /* always be used, so use *memsizeptr instead. */ size_t deltasize; /* Suggested increment for reallocating memory */ void *(*mem_realloc)(void *p, size_t newsize); /* realloc function */ LONGLONG currentpos; /* current file position, relative to start */ LONGLONG fitsfilesize; /* size of the FITS file (always <= *memsizeptr) */ FILE *fileptr; /* pointer to compressed output disk file */ } memdriver; static memdriver memTable[NMAXFILES]; /* allocate mem file handle tables */ /*--------------------------------------------------------------------------*/ int mem_init(void) { int ii; for (ii = 0; ii < NMAXFILES; ii++) /* initialize all empty slots in table */ { memTable[ii].memaddrptr = 0; memTable[ii].memaddr = 0; } return(0); } /*--------------------------------------------------------------------------*/ int mem_setoptions(int options) { /* do something with the options argument, to stop compiler warning */ options = 0; return(options); } /*--------------------------------------------------------------------------*/ int mem_getoptions(int *options) { *options = 0; return(0); } /*--------------------------------------------------------------------------*/ int mem_getversion(int *version) { *version = 10; return(0); } /*--------------------------------------------------------------------------*/ int mem_shutdown(void) { return(0); } /*--------------------------------------------------------------------------*/ int mem_create(char *filename, int *handle) /* Create a new empty memory file for subsequent writes. The file name is ignored in this case. */ { int status; /* initially allocate 1 FITS block = 2880 bytes */ status = mem_createmem(2880L, handle); if (status) { ffpmsg("failed to create empty memory file (mem_create)"); return(status); } return(0); } /*--------------------------------------------------------------------------*/ int mem_create_comp(char *filename, int *handle) /* Create a new empty memory file for subsequent writes. Also create an empty compressed .gz file. The memory file will be compressed and written to the disk file when the file is closed. */ { FILE *diskfile; char mode[4]; int status; /* first, create disk file for the compressed output */ if ( !strcmp(filename, "-.gz") || !strcmp(filename, "stdout.gz") || !strcmp(filename, "STDOUT.gz") ) { /* special case: create uncompressed FITS file in memory, then compress it an write it out to 'stdout' when it is closed. */ diskfile = stdout; } else { /* normal case: create disk file for the compressed output */ strcpy(mode, "w+b"); /* create file with read-write */ diskfile = fopen(filename, "r"); /* does file already exist? */ if (diskfile) { fclose(diskfile); /* close file and exit with error */ return(FILE_NOT_CREATED); } #if MACHINE == ALPHAVMS || MACHINE == VAXVMS /* specify VMS record structure: fixed format, 2880 byte records */ /* but force stream mode access to enable random I/O access */ diskfile = fopen(filename, mode, "rfm=fix", "mrs=2880", "ctx=stm"); #else diskfile = fopen(filename, mode); #endif if (!(diskfile)) /* couldn't create file */ { return(FILE_NOT_CREATED); } } /* now create temporary memory file */ /* initially allocate 1 FITS block = 2880 bytes */ status = mem_createmem(2880L, handle); if (status) { ffpmsg("failed to create empty memory file (mem_create_comp)"); return(status); } memTable[*handle].fileptr = diskfile; return(0); } /*--------------------------------------------------------------------------*/ int mem_openmem(void **buffptr, /* I - address of memory pointer */ size_t *buffsize, /* I - size of buffer, in bytes */ size_t deltasize, /* I - increment for future realloc's */ void *(*memrealloc)(void *p, size_t newsize), /* function */ int *handle) /* lowest level routine to open a pre-existing memory file. */ { int ii; *handle = -1; for (ii = 0; ii < NMAXFILES; ii++) /* find empty slot in handle table */ { if (memTable[ii].memaddrptr == 0) { *handle = ii; break; } } if (*handle == -1) return(TOO_MANY_FILES); /* too many files opened */ memTable[ii].memaddrptr = (char **) buffptr; /* pointer to start addres */ memTable[ii].memsizeptr = buffsize; /* allocated size of memory */ memTable[ii].deltasize = deltasize; /* suggested realloc increment */ memTable[ii].fitsfilesize = *buffsize; /* size of FITS file (upper limit) */ memTable[ii].currentpos = 0; /* at beginning of the file */ memTable[ii].mem_realloc = memrealloc; /* memory realloc function */ return(0); } /*--------------------------------------------------------------------------*/ int mem_createmem(size_t msize, int *handle) /* lowest level routine to allocate a memory file. */ { int ii; *handle = -1; for (ii = 0; ii < NMAXFILES; ii++) /* find empty slot in handle table */ { if (memTable[ii].memaddrptr == 0) { *handle = ii; break; } } if (*handle == -1) return(TOO_MANY_FILES); /* too many files opened */ /* use the internally allocated memaddr and memsize variables */ memTable[ii].memaddrptr = &memTable[ii].memaddr; memTable[ii].memsizeptr = &memTable[ii].memsize; /* allocate initial block of memory for the file */ if (msize > 0) { memTable[ii].memaddr = (char *) malloc(msize); if ( !(memTable[ii].memaddr) ) { ffpmsg("malloc of initial memory failed (mem_createmem)"); return(FILE_NOT_OPENED); } } /* set initial state of the file */ memTable[ii].memsize = msize; memTable[ii].deltasize = 2880; memTable[ii].fitsfilesize = 0; memTable[ii].currentpos = 0; memTable[ii].mem_realloc = realloc; return(0); } /*--------------------------------------------------------------------------*/ int mem_truncate(int handle, LONGLONG filesize) /* truncate the file to a new size */ { char *ptr; /* call the memory reallocation function, if defined */ if ( memTable[handle].mem_realloc ) { /* explicit LONGLONG->size_t cast */ ptr = (memTable[handle].mem_realloc)( *(memTable[handle].memaddrptr), (size_t) filesize); if (!ptr) { ffpmsg("Failed to reallocate memory (mem_truncate)"); return(MEMORY_ALLOCATION); } /* if allocated more memory, initialize it to zero */ if ( filesize > *(memTable[handle].memsizeptr) ) { memset(ptr + *(memTable[handle].memsizeptr), 0, ((size_t) filesize) - *(memTable[handle].memsizeptr) ); } *(memTable[handle].memaddrptr) = ptr; *(memTable[handle].memsizeptr) = (size_t) (filesize); } memTable[handle].currentpos = filesize; memTable[handle].fitsfilesize = filesize; return(0); } /*--------------------------------------------------------------------------*/ int stdin_checkfile(char *urltype, char *infile, char *outfile) /* do any special case checking when opening a file on the stdin stream */ { if (strlen(outfile)) { stdin_outfile[0] = '\0'; strncat(stdin_outfile,outfile,FLEN_FILENAME-1); /* an output file is specified */ strcpy(urltype,"stdinfile://"); } else *stdin_outfile = '\0'; /* no output file was specified */ return(0); } /*--------------------------------------------------------------------------*/ int stdin_open(char *filename, int rwmode, int *handle) /* open a FITS file from the stdin file stream by copying it into memory The file name is ignored in this case. */ { int status; char cbuff; if (*stdin_outfile) { /* copy the stdin stream to the specified disk file then open the file */ /* Create the output file */ status = file_create(stdin_outfile,handle); if (status) { ffpmsg("Unable to create output file to copy stdin (stdin_open):"); ffpmsg(stdin_outfile); return(status); } /* copy the whole stdin stream to the file */ status = stdin2file(*handle); file_close(*handle); if (status) { ffpmsg("failed to copy stdin to file (stdin_open)"); ffpmsg(stdin_outfile); return(status); } /* reopen file with proper rwmode attribute */ status = file_open(stdin_outfile, rwmode, handle); } else { /* get the first character, then put it back */ cbuff = fgetc(stdin); ungetc(cbuff, stdin); /* compressed files begin with 037 or 'P' */ if (cbuff == 31 || cbuff == 75) { /* looks like the input stream is compressed */ status = mem_compress_stdin_open(filename, rwmode, handle); } else { /* copy the stdin stream into memory then open file in memory */ if (rwmode != READONLY) { ffpmsg("cannot open stdin with WRITE access"); return(READONLY_FILE); } status = mem_createmem(2880L, handle); if (status) { ffpmsg("failed to create empty memory file (stdin_open)"); return(status); } /* copy the whole stdin stream into memory */ status = stdin2mem(*handle); if (status) { ffpmsg("failed to copy stdin into memory (stdin_open)"); free(memTable[*handle].memaddr); } } } return(status); } /*--------------------------------------------------------------------------*/ int stdin2mem(int hd) /* handle number */ /* Copy the stdin stream into memory. Fill whatever amount of memory has already been allocated, then realloc more memory if necessary. */ { size_t nread, memsize, delta; LONGLONG filesize; char *memptr; char simple[] = "SIMPLE"; int c, ii, jj; memptr = *memTable[hd].memaddrptr; memsize = *memTable[hd].memsizeptr; delta = memTable[hd].deltasize; filesize = 0; ii = 0; for(jj = 0; (c = fgetc(stdin)) != EOF && jj < 2000; jj++) { /* Skip over any garbage at the beginning of the stdin stream by */ /* reading 1 char at a time, looking for 'S', 'I', 'M', 'P', 'L', 'E' */ /* Give up if not found in the first 2000 characters */ if (c == simple[ii]) { ii++; if (ii == 6) /* found the complete string? */ { memcpy(memptr, simple, 6); /* copy "SIMPLE" to buffer */ filesize = 6; break; } } else ii = 0; /* reset search to beginning of the string */ } if (filesize == 0) { ffpmsg("Couldn't find the string 'SIMPLE' in the stdin stream."); ffpmsg("This does not look like a FITS file."); return(FILE_NOT_OPENED); } /* fill up the remainder of the initial memory allocation */ nread = fread(memptr + 6, 1, memsize - 6, stdin); nread += 6; /* add in the 6 characters in 'SIMPLE' */ if (nread < memsize) /* reached the end? */ { memTable[hd].fitsfilesize = nread; return(0); } filesize = nread; while (1) { /* allocate memory for another FITS block */ memptr = realloc(memptr, memsize + delta); if (!memptr) { ffpmsg("realloc failed while copying stdin (stdin2mem)"); return(MEMORY_ALLOCATION); } memsize += delta; /* read another FITS block */ nread = fread(memptr + filesize, 1, delta, stdin); filesize += nread; if (nread < delta) /* reached the end? */ break; } memTable[hd].fitsfilesize = filesize; *memTable[hd].memaddrptr = memptr; *memTable[hd].memsizeptr = memsize; return(0); } /*--------------------------------------------------------------------------*/ int stdin2file(int handle) /* handle number */ /* Copy the stdin stream to a file. . */ { size_t nread; char simple[] = "SIMPLE"; int c, ii, jj, status; char recbuf[RECBUFLEN]; ii = 0; for(jj = 0; (c = fgetc(stdin)) != EOF && jj < 2000; jj++) { /* Skip over any garbage at the beginning of the stdin stream by */ /* reading 1 char at a time, looking for 'S', 'I', 'M', 'P', 'L', 'E' */ /* Give up if not found in the first 2000 characters */ if (c == simple[ii]) { ii++; if (ii == 6) /* found the complete string? */ { memcpy(recbuf, simple, 6); /* copy "SIMPLE" to buffer */ break; } } else ii = 0; /* reset search to beginning of the string */ } if (ii != 6) { ffpmsg("Couldn't find the string 'SIMPLE' in the stdin stream"); return(FILE_NOT_OPENED); } /* fill up the remainder of the buffer */ nread = fread(recbuf + 6, 1, RECBUFLEN - 6, stdin); nread += 6; /* add in the 6 characters in 'SIMPLE' */ status = file_write(handle, recbuf, nread); if (status) return(status); /* copy the rest of stdin stream */ while(0 != (nread = fread(recbuf,1,RECBUFLEN, stdin))) { status = file_write(handle, recbuf, nread); if (status) return(status); } return(status); } /*--------------------------------------------------------------------------*/ int stdout_close(int handle) /* copy the memory file to stdout, then free the memory */ { int status = 0; /* copy from memory to standard out. explicit LONGLONG->size_t cast */ if(fwrite(memTable[handle].memaddr, 1, ((size_t) memTable[handle].fitsfilesize), stdout) != (size_t) memTable[handle].fitsfilesize ) { ffpmsg("failed to copy memory file to stdout (stdout_close)"); status = WRITE_ERROR; } free( memTable[handle].memaddr ); /* free the memory */ memTable[handle].memaddrptr = 0; memTable[handle].memaddr = 0; return(status); } /*--------------------------------------------------------------------------*/ int mem_compress_openrw(char *filename, int rwmode, int *hdl) /* This routine opens the compressed diskfile and creates an empty memory buffer with an appropriate size, then calls mem_uncompress2mem. It allows the memory 'file' to be opened with READWRITE access. */ { return(mem_compress_open(filename, READONLY, hdl)); } /*--------------------------------------------------------------------------*/ int mem_compress_open(char *filename, int rwmode, int *hdl) /* This routine opens the compressed diskfile and creates an empty memory buffer with an appropriate size, then calls mem_uncompress2mem. */ { FILE *diskfile; int status, estimated = 1; unsigned char buffer[4]; size_t finalsize, filesize; LONGLONG llsize = 0; unsigned int modulosize; char *ptr; if (rwmode != READONLY) { ffpmsg( "cannot open compressed file with WRITE access (mem_compress_open)"); ffpmsg(filename); return(READONLY_FILE); } /* open the compressed disk file */ status = file_openfile(filename, READONLY, &diskfile); if (status) { ffpmsg("failed to open compressed disk file (compress_open)"); ffpmsg(filename); return(status); } if (fread(buffer, 1, 2, diskfile) != 2) /* read 2 bytes */ { fclose(diskfile); return(READ_ERROR); } if (memcmp(buffer, "\037\213", 2) == 0) /* GZIP */ { /* the uncompressed file size is give at the end */ /* of the file in the ISIZE field (modulo 2^32) */ fseek(diskfile, 0, 2); /* move to end of file */ filesize = ftell(diskfile); /* position = size of file */ fseek(diskfile, -4L, 1); /* move back 4 bytes */ fread(buffer, 1, 4L, diskfile); /* read 4 bytes */ /* have to worry about integer byte order */ modulosize = buffer[0]; modulosize |= buffer[1] << 8; modulosize |= buffer[2] << 16; modulosize |= buffer[3] << 24; /* the field ISIZE in the gzipped file header only stores 4 bytes and contains the uncompressed file size modulo 2^32. If the uncompressed file size is less than the compressed file size (filesize), then one probably needs to add 2^32 = 4294967296 to the uncompressed file size, assuming that the gzip produces a compressed file that is smaller than the original file. But one must allow for the case of very small files, where the gzipped file may actually be larger then the original uncompressed file. Therefore, only perform the modulo 2^32 correction test if the compressed file is greater than 10,000 bytes in size. (Note: this threhold would fail only if the original file was greater than 2^32 bytes in size AND gzip was able to compress it by more than a factor of 400,000 (!) which seems highly unlikely.) Also, obviously, this 2^32 modulo correction cannot be performed if the finalsize variable is only 32-bits long. Typically, the 'size_t' integer type must be 8 bytes or larger in size to support data files that are greater than 2 GB (2^31 bytes) in size. */ finalsize = modulosize; if (sizeof(size_t) > 4 && filesize > 10000) { llsize = (LONGLONG) finalsize; /* use LONGLONG variable to suppress compiler warning */ while (llsize < (LONGLONG) filesize) llsize += 4294967296; finalsize = (size_t) llsize; } estimated = 0; /* file size is known, not estimated */ } else if (memcmp(buffer, "\120\113", 2) == 0) /* PKZIP */ { /* the uncompressed file size is give at byte 22 the file */ fseek(diskfile, 22L, 0); /* move to byte 22 */ fread(buffer, 1, 4L, diskfile); /* read 4 bytes */ /* have to worry about integer byte order */ modulosize = buffer[0]; modulosize |= buffer[1] << 8; modulosize |= buffer[2] << 16; modulosize |= buffer[3] << 24; finalsize = modulosize; estimated = 0; /* file size is known, not estimated */ } else if (memcmp(buffer, "\037\036", 2) == 0) /* PACK */ finalsize = 0; /* for most methods we can't determine final size */ else if (memcmp(buffer, "\037\235", 2) == 0) /* LZW */ finalsize = 0; /* for most methods we can't determine final size */ else if (memcmp(buffer, "\037\240", 2) == 0) /* LZH */ finalsize = 0; /* for most methods we can't determine final size */ #if HAVE_BZIP2 else if (memcmp(buffer, "BZ", 2) == 0) /* BZip2 */ finalsize = 0; /* for most methods we can't determine final size */ #endif else { /* not a compressed file; this should never happen */ fclose(diskfile); return(1); } if (finalsize == 0) /* estimate uncompressed file size */ { fseek(diskfile, 0, 2); /* move to end of the compressed file */ finalsize = ftell(diskfile); /* position = size of file */ finalsize = finalsize * 3; /* assume factor of 3 compression */ } fseek(diskfile, 0, 0); /* move back to beginning of file */ /* create a memory file big enough (hopefully) for the uncompressed file */ status = mem_createmem(finalsize, hdl); if (status && estimated) { /* memory allocation failed, so try a smaller estimated size */ finalsize = finalsize / 3; status = mem_createmem(finalsize, hdl); } if (status) { fclose(diskfile); ffpmsg("failed to create empty memory file (compress_open)"); return(status); } /* uncompress file into memory */ status = mem_uncompress2mem(filename, diskfile, *hdl); fclose(diskfile); if (status) { mem_close_free(*hdl); /* free up the memory */ ffpmsg("failed to uncompress file into memory (compress_open)"); return(status); } /* if we allocated too much memory initially, then free it */ if (*(memTable[*hdl].memsizeptr) > (( (size_t) memTable[*hdl].fitsfilesize) + 256L) ) { ptr = realloc(*(memTable[*hdl].memaddrptr), ((size_t) memTable[*hdl].fitsfilesize) ); if (!ptr) { ffpmsg("Failed to reduce size of allocated memory (compress_open)"); return(MEMORY_ALLOCATION); } *(memTable[*hdl].memaddrptr) = ptr; *(memTable[*hdl].memsizeptr) = (size_t) (memTable[*hdl].fitsfilesize); } return(0); } /*--------------------------------------------------------------------------*/ int mem_compress_stdin_open(char *filename, int rwmode, int *hdl) /* This routine reads the compressed input stream and creates an empty memory buffer, then calls mem_uncompress2mem. */ { int status; char *ptr; if (rwmode != READONLY) { ffpmsg( "cannot open compressed input stream with WRITE access (mem_compress_stdin_open)"); return(READONLY_FILE); } /* create a memory file for the uncompressed file */ status = mem_createmem(28800, hdl); if (status) { ffpmsg("failed to create empty memory file (compress_stdin_open)"); return(status); } /* uncompress file into memory */ status = mem_uncompress2mem(filename, stdin, *hdl); if (status) { mem_close_free(*hdl); /* free up the memory */ ffpmsg("failed to uncompress stdin into memory (compress_stdin_open)"); return(status); } /* if we allocated too much memory initially, then free it */ if (*(memTable[*hdl].memsizeptr) > (( (size_t) memTable[*hdl].fitsfilesize) + 256L) ) { ptr = realloc(*(memTable[*hdl].memaddrptr), ((size_t) memTable[*hdl].fitsfilesize) ); if (!ptr) { ffpmsg("Failed to reduce size of allocated memory (compress_stdin_open)"); return(MEMORY_ALLOCATION); } *(memTable[*hdl].memaddrptr) = ptr; *(memTable[*hdl].memsizeptr) = (size_t) (memTable[*hdl].fitsfilesize); } return(0); } /*--------------------------------------------------------------------------*/ int mem_iraf_open(char *filename, int rwmode, int *hdl) /* This routine creates an empty memory buffer, then calls iraf2mem to open the IRAF disk file and convert it to a FITS file in memeory. */ { int status; size_t filesize = 0; /* create a memory file with size = 0 for the FITS converted IRAF file */ status = mem_createmem(filesize, hdl); if (status) { ffpmsg("failed to create empty memory file (mem_iraf_open)"); return(status); } /* convert the iraf file into a FITS file in memory */ status = iraf2mem(filename, memTable[*hdl].memaddrptr, memTable[*hdl].memsizeptr, &filesize, &status); if (status) { mem_close_free(*hdl); /* free up the memory */ ffpmsg("failed to convert IRAF file into memory (mem_iraf_open)"); return(status); } memTable[*hdl].currentpos = 0; /* save starting position */ memTable[*hdl].fitsfilesize=filesize; /* and initial file size */ return(0); } /*--------------------------------------------------------------------------*/ int mem_rawfile_open(char *filename, int rwmode, int *hdl) /* This routine creates an empty memory buffer, writes a minimal image header, then copies the image data from the raw file into memory. It will byteswap the pixel values if the raw array is in little endian byte order. */ { FILE *diskfile; fitsfile *fptr; short *sptr; int status, endian, datatype, bytePerPix, naxis; long dim[5] = {1,1,1,1,1}, ii, nvals, offset = 0; size_t filesize = 0, datasize; char rootfile[FLEN_FILENAME], *cptr = 0, *cptr2 = 0; void *ptr; if (rwmode != READONLY) { ffpmsg( "cannot open raw binary file with WRITE access (mem_rawfile_open)"); ffpmsg(filename); return(READONLY_FILE); } cptr = strchr(filename, '['); /* search for opening bracket [ */ if (!cptr) { ffpmsg("binary file name missing '[' character (mem_rawfile_open)"); ffpmsg(filename); return(URL_PARSE_ERROR); } *rootfile = '\0'; strncat(rootfile, filename, cptr - filename); /* store the rootname */ cptr++; while (*cptr == ' ') cptr++; /* skip leading blanks */ /* Get the Data Type of the Image */ if (*cptr == 'b' || *cptr == 'B') { datatype = BYTE_IMG; bytePerPix = 1; } else if (*cptr == 'i' || *cptr == 'I') { datatype = SHORT_IMG; bytePerPix = 2; } else if (*cptr == 'u' || *cptr == 'U') { datatype = USHORT_IMG; bytePerPix = 2; } else if (*cptr == 'j' || *cptr == 'J') { datatype = LONG_IMG; bytePerPix = 4; } else if (*cptr == 'r' || *cptr == 'R' || *cptr == 'f' || *cptr == 'F') { datatype = FLOAT_IMG; bytePerPix = 4; } else if (*cptr == 'd' || *cptr == 'D') { datatype = DOUBLE_IMG; bytePerPix = 8; } else { ffpmsg("error in raw binary file datatype (mem_rawfile_open)"); ffpmsg(filename); return(URL_PARSE_ERROR); } cptr++; /* get Endian: Big or Little; default is same as the local machine */ if (*cptr == 'b' || *cptr == 'B') { endian = 0; cptr++; } else if (*cptr == 'l' || *cptr == 'L') { endian = 1; cptr++; } else endian = BYTESWAPPED; /* byteswapped machines are little endian */ /* read each dimension (up to 5) */ naxis = 1; dim[0] = strtol(cptr, &cptr2, 10); if (cptr2 && *cptr2 == ',') { naxis = 2; dim[1] = strtol(cptr2+1, &cptr, 10); if (cptr && *cptr == ',') { naxis = 3; dim[2] = strtol(cptr+1, &cptr2, 10); if (cptr2 && *cptr2 == ',') { naxis = 4; dim[3] = strtol(cptr2+1, &cptr, 10); if (cptr && *cptr == ',') naxis = 5; dim[4] = strtol(cptr+1, &cptr2, 10); } } } cptr = maxvalue(cptr, cptr2); if (*cptr == ':') /* read starting offset value */ offset = strtol(cptr+1, 0, 10); nvals = dim[0] * dim[1] * dim[2] * dim[3] * dim[4]; datasize = nvals * bytePerPix; filesize = nvals * bytePerPix + 2880; filesize = ((filesize - 1) / 2880 + 1) * 2880; /* open the raw binary disk file */ status = file_openfile(rootfile, READONLY, &diskfile); if (status) { ffpmsg("failed to open raw binary file (mem_rawfile_open)"); ffpmsg(rootfile); return(status); } /* create a memory file with corrct size for the FITS converted raw file */ status = mem_createmem(filesize, hdl); if (status) { ffpmsg("failed to create memory file (mem_rawfile_open)"); fclose(diskfile); return(status); } /* open this piece of memory as a new FITS file */ ffimem(&fptr, (void **) memTable[*hdl].memaddrptr, &filesize, 0, 0, &status); /* write the required header keywords */ ffcrim(fptr, datatype, naxis, dim, &status); /* close the FITS file, but keep the memory allocated */ ffclos(fptr, &status); if (status > 0) { ffpmsg("failed to write basic image header (mem_rawfile_open)"); fclose(diskfile); mem_close_free(*hdl); /* free up the memory */ return(status); } if (offset > 0) fseek(diskfile, offset, 0); /* offset to start of the data */ /* read the raw data into memory */ ptr = *memTable[*hdl].memaddrptr + 2880; if (fread((char *) ptr, 1, datasize, diskfile) != datasize) status = READ_ERROR; fclose(diskfile); /* close the raw binary disk file */ if (status) { mem_close_free(*hdl); /* free up the memory */ ffpmsg("failed to copy raw file data into memory (mem_rawfile_open)"); return(status); } if (datatype == USHORT_IMG) /* have to subtract 32768 from each unsigned */ { /* value to conform to FITS convention. More */ /* efficient way to do this is to just flip */ /* the most significant bit. */ sptr = (short *) ptr; if (endian == BYTESWAPPED) /* working with native format */ { for (ii = 0; ii < nvals; ii++, sptr++) { *sptr = ( *sptr ) ^ 0x8000; } } else /* pixels are byteswapped WRT the native format */ { for (ii = 0; ii < nvals; ii++, sptr++) { *sptr = ( *sptr ) ^ 0x80; } } } if (endian) /* swap the bytes if array is in little endian byte order */ { if (datatype == SHORT_IMG || datatype == USHORT_IMG) { ffswap2( (short *) ptr, nvals); } else if (datatype == LONG_IMG || datatype == FLOAT_IMG) { ffswap4( (INT32BIT *) ptr, nvals); } else if (datatype == DOUBLE_IMG) { ffswap8( (double *) ptr, nvals); } } memTable[*hdl].currentpos = 0; /* save starting position */ memTable[*hdl].fitsfilesize=filesize; /* and initial file size */ return(0); } /*--------------------------------------------------------------------------*/ int mem_uncompress2mem(char *filename, FILE *diskfile, int hdl) { /* lower level routine to uncompress a file into memory. The file has already been opened and the memory buffer has been allocated. */ size_t finalsize; int status; /* uncompress file into memory */ status = 0; if (strstr(filename, ".Z")) { zuncompress2mem(filename, diskfile, memTable[hdl].memaddrptr, /* pointer to memory address */ memTable[hdl].memsizeptr, /* pointer to size of memory */ realloc, /* reallocation function */ &finalsize, &status); /* returned file size nd status*/ #if HAVE_BZIP2 } else if (strstr(filename, ".bz2")) { bzip2uncompress2mem(filename, diskfile, hdl, &finalsize, &status); #endif } else { uncompress2mem(filename, diskfile, memTable[hdl].memaddrptr, /* pointer to memory address */ memTable[hdl].memsizeptr, /* pointer to size of memory */ realloc, /* reallocation function */ &finalsize, &status); /* returned file size nd status*/ } memTable[hdl].currentpos = 0; /* save starting position */ memTable[hdl].fitsfilesize=finalsize; /* and initial file size */ return status; } /*--------------------------------------------------------------------------*/ int mem_size(int handle, LONGLONG *filesize) /* return the size of the file; only called when the file is first opened */ { *filesize = memTable[handle].fitsfilesize; return(0); } /*--------------------------------------------------------------------------*/ int mem_close_free(int handle) /* close the file and free the memory. */ { free( *(memTable[handle].memaddrptr) ); memTable[handle].memaddrptr = 0; memTable[handle].memaddr = 0; return(0); } /*--------------------------------------------------------------------------*/ int mem_close_keep(int handle) /* close the memory file but do not free the memory. */ { memTable[handle].memaddrptr = 0; memTable[handle].memaddr = 0; return(0); } /*--------------------------------------------------------------------------*/ int mem_close_comp(int handle) /* compress the memory file, writing it out to the fileptr (which might be stdout) */ { int status = 0; size_t compsize; /* compress file in memory to a .gz disk file */ if(compress2file_from_mem(memTable[handle].memaddr, (size_t) (memTable[handle].fitsfilesize), memTable[handle].fileptr, &compsize, &status ) ) { ffpmsg("failed to copy memory file to file (mem_close_comp)"); status = WRITE_ERROR; } free( memTable[handle].memaddr ); /* free the memory */ memTable[handle].memaddrptr = 0; memTable[handle].memaddr = 0; /* close the compressed disk file (except if it is 'stdout' */ if (memTable[handle].fileptr != stdout) fclose(memTable[handle].fileptr); return(status); } /*--------------------------------------------------------------------------*/ int mem_seek(int handle, LONGLONG offset) /* seek to position relative to start of the file. */ { if (offset > memTable[handle].fitsfilesize ) return(END_OF_FILE); memTable[handle].currentpos = offset; return(0); } /*--------------------------------------------------------------------------*/ int mem_read(int hdl, void *buffer, long nbytes) /* read bytes from the current position in the file */ { if (memTable[hdl].currentpos + nbytes > memTable[hdl].fitsfilesize) return(END_OF_FILE); memcpy(buffer, *(memTable[hdl].memaddrptr) + memTable[hdl].currentpos, nbytes); memTable[hdl].currentpos += nbytes; return(0); } /*--------------------------------------------------------------------------*/ int mem_write(int hdl, void *buffer, long nbytes) /* write bytes at the current position in the file */ { size_t newsize; char *ptr; if ((size_t) (memTable[hdl].currentpos + nbytes) > *(memTable[hdl].memsizeptr) ) { if (!(memTable[hdl].mem_realloc)) { ffpmsg("realloc function not defined (mem_write)"); return(WRITE_ERROR); } /* Attempt to reallocate additional memory: the memory buffer size is incremented by the larger of: 1 FITS block (2880 bytes) or the defined 'deltasize' parameter */ newsize = maxvalue( (size_t) (((memTable[hdl].currentpos + nbytes - 1) / 2880) + 1) * 2880, *(memTable[hdl].memsizeptr) + memTable[hdl].deltasize); /* call the realloc function */ ptr = (memTable[hdl].mem_realloc)( *(memTable[hdl].memaddrptr), newsize); if (!ptr) { ffpmsg("Failed to reallocate memory (mem_write)"); return(MEMORY_ALLOCATION); } *(memTable[hdl].memaddrptr) = ptr; *(memTable[hdl].memsizeptr) = newsize; } /* now copy the bytes from the buffer into memory */ memcpy( *(memTable[hdl].memaddrptr) + memTable[hdl].currentpos, buffer, nbytes); memTable[hdl].currentpos += nbytes; memTable[hdl].fitsfilesize = maxvalue(memTable[hdl].fitsfilesize, memTable[hdl].currentpos); return(0); } #if HAVE_BZIP2 void bzip2uncompress2mem(char *filename, FILE *diskfile, int hdl, size_t* filesize, int* status) { BZFILE* b; int bzerror; char buf[8192]; size_t total_read = 0; char* errormsg = NULL; *filesize = 0; *status = 0; b = BZ2_bzReadOpen(&bzerror, diskfile, 0, 0, NULL, 0); if (bzerror != BZ_OK) { BZ2_bzReadClose(&bzerror, b); if (bzerror == BZ_MEM_ERROR) ffpmsg("failed to open a bzip2 file: out of memory\n"); else if (bzerror == BZ_CONFIG_ERROR) ffpmsg("failed to open a bzip2 file: miscompiled bzip2 library\n"); else if (bzerror == BZ_IO_ERROR) ffpmsg("failed to open a bzip2 file: I/O error"); else ffpmsg("failed to open a bzip2 file"); *status = READ_ERROR; return; } bzerror = BZ_OK; while (bzerror == BZ_OK) { int nread; nread = BZ2_bzRead(&bzerror, b, buf, sizeof(buf)); if (bzerror == BZ_OK || bzerror == BZ_STREAM_END) { *status = mem_write(hdl, buf, nread); if (*status) { BZ2_bzReadClose(&bzerror, b); if (*status == MEMORY_ALLOCATION) ffpmsg("Failed to reallocate memory while uncompressing bzip2 file"); return; } total_read += nread; } else { if (bzerror == BZ_IO_ERROR) errormsg = "failed to read bzip2 file: I/O error"; else if (bzerror == BZ_UNEXPECTED_EOF) errormsg = "failed to read bzip2 file: unexpected end-of-file"; else if (bzerror == BZ_DATA_ERROR) errormsg = "failed to read bzip2 file: data integrity error"; else if (bzerror == BZ_MEM_ERROR) errormsg = "failed to read bzip2 file: insufficient memory"; } } BZ2_bzReadClose(&bzerror, b); if (bzerror != BZ_OK) { if (errormsg) ffpmsg(errormsg); else ffpmsg("failure closing bzip2 file after reading\n"); *status = READ_ERROR; return; } *filesize = total_read; } #endif cfitsio-3.47/drvrnet.c0000644000225700000360000036551713471052202014242 0ustar cagordonlhea/* This file, drvrhttp.c contains driver routines for http, ftp and root files. */ /* This file was written by Bruce O'Neel at the ISDC, Switzerland */ /* The FITSIO software is maintained by William Pence at the High Energy */ /* Astrophysic Science Archive Research Center (HEASARC) at the NASA */ /* Goddard Space Flight Center. */ /* Notes on the drivers: The ftp driver uses passive mode exclusivly. If your remote system can't deal with passive mode then it'll fail. Since Netscape Navigator uses passive mode as well there shouldn't be too many ftp servers which have problems. The http driver works properly with 301 and 302 redirects. For many more gory details see http://www.w3c.org/Protocols/rfc2068/rfc2068. The only catch to the 301/302 redirects is that they have to redirect to another http:// url. If not, things would have to change a lot in cfitsio and this was thought to be too difficult. Redirects look like 301 Moved Permanently

Moved Permanently

The document has moved here.

This redirect was from apache 1.2.5 but most of the other servers produce something very similiar. The parser for the redirects finds the first anchor tag in the body and goes there. If that wasn't what was intended by the remote system then hopefully the error stack, which includes notes about the redirect will help the user fix the problem. **************************************************************** Note added in 2017: The redirect format shown above is actually preceded by 2 lines that look like HTTP/1.1 302 Found LOCATION: http://heasarc.gsfc.nasa.gov/FTP/software/ftools/release/other/image.fits.gz The CFITSIO parser now looks for the "Location:" string, not the html tag. **************************************************************** Root protocal doesn't have any real docs, so, the emperical docs are as follows. First, you must use a slightly modified rootd server. The modifications include implimentation of the stat command which returns the size of the remote file. Without that it's impossible for cfitsio to work properly since fitsfiles don't include any information about the size of the files in the headers. The rootd server closes the connections on any errors, including reading beyond the end of the file or seeking beyond the end of the file. The rootd:// driver doesn't reopen a closed connection, if the connection is closed you're pretty much done. The messages are of the form All binary information is transfered in network format, so use htonl and ntohl to convert back and forth. :== 4 byte length, in network format, the len doesn't include the length of :== one of the message opcodes below, 4 bytes, network format :== depends on opcode The response is of the same form with the same opcode sent. Success is indicated by being 0. Root is a NFSish protocol where each read/write includes the byte offset to read or write to. As a result, seeks will always succeed in the driver even if they would cause a fatal error when you try to read because you're beyond the end of the file. There is file locking on the host such that you need to possibly create /usr/tmp/rootdtab on the host system. There is one file per socket connection, though the rootd daemon can support multiple files open at once. The messages are sent in the following order: ROOTD_USER - user name, is the user name, trailing null is sent though it's not required it seems. A ROOTD_AUTH message is returned with any sort of error meaning that the user name is wrong. ROOTD_PASS - password, ones complemented, stored in . Once again the trailing null is sent. Once again a ROOTD_AUTH message is returned ROOTD_OPEN - includes filename and one of {create|update|read} as the file mode. ~ seems to be dealt with as the username's login directory. A ROOTD_OPEN message is returned. Once the file is opened any of the following can be sent: ROOTD_STAT - file status and size returns a message where is the file length in bytes ROOTD_FLUSH - flushes the file, not sure this has any real effect on the daemon since the daemon uses open/read/write/close rather than the buffered fopen/fread/fwrite/fclose. ROOTD_GET - on send includes a text message of offset and length to get. Return is a status message first with a status value, then, the raw bytes for the length that you requested. It's an error to seek or read past the end of the file, and, the rootd daemon exits and won't respond anymore. Ie, don't do this. ROOTD_PUT - on send includes a text message of offset and length to put. Then send the raw bytes you want to write. Then recieve a status message When you are finished then you send the message: ROOTD_CLOSE - closes the file Once the file is closed then the socket is closed. Revision 1.56 2000/01/04 11:58:31 oneel Updates so that compressed network files are dealt with regardless of their file names and/or mime types. Revision 1.55 2000/01/04 10:52:40 oneel cfitsio 2.034 Revision 1.51 1999/08/10 12:13:40 oneel Make the http code a bit less picky about the types of files it uncompresses. Now it also uncompresses files which end in .Z or .gz. Revision 1.50 1999/08/04 12:38:46 oneel Don's 2.0.32 patch with dal 1.3 Revision 1.39 1998/12/02 15:31:33 oneel Updates to drvrnet.c so that less compiler warnings would be generated. Fixes the signal handling. Revision 1.38 1998/11/23 10:03:24 oneel Added in a useragent string, as suggested by: Tim Kimball Data Systems Division kimball@stsci.edu 410-338-4417 Space Telescope Science Institute http://www.stsci.edu/~kimball/ 3700 San Martin Drive http://archive.stsci.edu/ Baltimore MD 21218 USA http://faxafloi.stsci.edu:4547/ */ #ifdef HAVE_NET_SERVICES #include #include #include #include #include #include #include #include #include #include #include #include #ifdef CFITSIO_HAVE_CURL #include #endif #if defined(unix) || defined(__unix__) || defined(__unix) || defined(HAVE_UNISTD_H) #include #endif #include #include #include "fitsio2.h" static jmp_buf env; /* holds the jump buffer for setjmp/longjmp pairs */ static void signal_handler(int sig); /* Network routine error codes */ #define NET_OK 0 #define NOT_INET_ADDRESS -1000 #define UNKNOWN_INET_HOST -1001 #define CONNECTION_ERROR -1002 /* Network routine constants */ #define NET_DEFAULT 0 #define NET_OOB 1 #define NET_PEEK 2 /* local defines and variables */ #define MAXLEN 1200 #define SHORTLEN 100 static char netoutfile[MAXLEN]; #define ROOTD_USER 2000 /*user id follows */ #define ROOTD_PASS 2001 /*passwd follows */ #define ROOTD_AUTH 2002 /*authorization status (to client) */ #define ROOTD_FSTAT 2003 /*filename follows */ #define ROOTD_OPEN 2004 /*filename follows + mode */ #define ROOTD_PUT 2005 /*offset, number of bytes and buffer */ #define ROOTD_GET 2006 /*offset, number of bytes */ #define ROOTD_FLUSH 2007 /*flush file */ #define ROOTD_CLOSE 2008 /*close file */ #define ROOTD_STAT 2009 /*return rootd statistics */ #define ROOTD_ACK 2010 /*acknowledgement (all OK) */ #define ROOTD_ERR 2011 /*error code and message follow */ typedef struct /* structure containing disk file structure */ { int sock; LONGLONG currentpos; } rootdriver; typedef struct /* simple mem struct for receiving files from curl */ { char *memory; size_t size; } curlmembuf; static rootdriver handleTable[NMAXFILES]; /* allocate diskfile handle tables */ /* static prototypes */ static int NET_TcpConnect(char *hostname, int port); static int NET_SendRaw(int sock, const void *buf, int length, int opt); static int NET_RecvRaw(int sock, void *buffer, int length); static int NET_ParseUrl(const char *url, char *proto, char *host, int *port, char *fn); static int CreateSocketAddress(struct sockaddr_in *sockaddrPtr, char *host,int port); static int ftp_status(FILE *ftp, char *statusstr); static int http_open_network(char *url, FILE **httpfile, char *contentencoding, int *contentlength); static int https_open_network(char *filename, curlmembuf* buffer); static int ftp_open_network(char *url, FILE **ftpfile, FILE **command, int *sock); static int ftps_open_network(char *filename, curlmembuf* buffer); static int ftp_file_exist(char *url); static int root_send_buffer(int sock, int op, char *buffer, int buflen); static int root_recv_buffer(int sock, int *op, char *buffer,int buflen); static int root_openfile(char *filename, char *rwmode, int *sock); static int encode64(unsigned s_len, char *src, unsigned d_len, char *dst); static int ssl_get_with_curl(char *url, curlmembuf* buffer, char* username, char* password); static size_t curlToMemCallback(void *buffer, size_t size, size_t nmemb, void *userp); static int curlProgressCallback(void *clientp, double dltotal, double dlnow, double ultotal, double ulnow); /***************************/ /* Static variables */ static int closehttpfile; static int closememfile; static int closefdiskfile; static int closediskfile; static int closefile; static int closeoutfile; static int closecommandfile; static int closeftpfile; static FILE *diskfile; static FILE *outfile; static int curl_verbose=0; static int show_fits_download_progress=0; static unsigned int net_timeout = 360; /* in seconds */ /*--------------------------------------------------------------------------*/ /* This creates a memory file handle with a copy of the URL in filename. The file is uncompressed if necessary */ int http_open(char *filename, int rwmode, int *handle) { FILE *httpfile; char contentencoding[SHORTLEN]; char errorstr[MAXLEN]; char recbuf[MAXLEN]; long len; int contentlength; int status; char firstchar; closehttpfile = 0; closememfile = 0; /* don't do r/w files */ if (rwmode != 0) { ffpmsg("Can't open http:// type file with READWRITE access"); ffpmsg(" Specify an outfile for r/w access (http_open)"); goto error; } /* do the signal handler bits */ if (setjmp(env) != 0) { /* feels like the second time */ /* this means something bad happened */ ffpmsg("Timeout (http_open)"); snprintf(errorstr, MAXLEN, "Download timeout exceeded: %d seconds",net_timeout); ffpmsg(errorstr); ffpmsg(" (multiplied x10 for files requiring uncompression)"); ffpmsg(" Timeout may be adjusted with fits_set_timeout"); goto error; } (void) signal(SIGALRM, signal_handler); /* Open the network connection */ if (http_open_network(filename,&httpfile,contentencoding, &contentlength)) { alarm(0); ffpmsg("Unable to open http file (http_open):"); ffpmsg(filename); goto error; } closehttpfile++; /* Create the memory file */ if ((status = mem_create(filename,handle))) { ffpmsg("Unable to create memory file (http_open)"); goto error; } closememfile++; /* Now, what do we do with the file */ /* Check to see what the first character is */ firstchar = fgetc(httpfile); ungetc(firstchar,httpfile); if (!strcmp(contentencoding,"x-gzip") || !strcmp(contentencoding,"x-compress") || strstr(filename,".gz") || strstr(filename,".Z") || ('\037' == firstchar)) { /* do the compress dance, which is the same as the gzip dance */ /* Using the cfitsio routine */ status = 0; /* Ok, this is a tough case, let's be arbritary and say 10*net_timeout, Given the choices for nettimeout above they'll probaby ^C before, but it's always worth a shot*/ alarm(net_timeout*10); status = mem_uncompress2mem(filename, httpfile, *handle); alarm(0); if (status) { ffpmsg("Error writing compressed memory file (http_open)"); ffpmsg(filename); goto error; } } else { /* It's not compressed, bad choice, but we'll copy it anyway */ if (contentlength % 2880) { snprintf(errorstr,MAXLEN,"Content-Length not a multiple of 2880 (http_open) %d", contentlength); ffpmsg(errorstr); } /* write a memory file */ alarm(net_timeout); while(0 != (len = fread(recbuf,1,MAXLEN,httpfile))) { alarm(0); /* cancel alarm */ status = mem_write(*handle,recbuf,len); if (status) { ffpmsg("Error copying http file into memory (http_open)"); ffpmsg(filename); goto error; } alarm(net_timeout); /* rearm the alarm */ } } fclose(httpfile); signal(SIGALRM, SIG_DFL); alarm(0); return mem_seek(*handle,0); error: alarm(0); /* clear it */ if (closehttpfile) { fclose(httpfile); } if (closememfile) { mem_close_free(*handle); } signal(SIGALRM, SIG_DFL); return (FILE_NOT_OPENED); } /*--------------------------------------------------------------------------*/ /* This creates a memory file handle with a copy of the URL in filename. The file must be compressed and is copied (still compressed) to disk first. The compressed disk file is then uncompressed into memory (READONLY). */ int http_compress_open(char *url, int rwmode, int *handle) { FILE *httpfile; char contentencoding[SHORTLEN]; char errorstr[MAXLEN]; char recbuf[MAXLEN]; long len; int contentlength; int ii, flen, status; char firstchar; closehttpfile = 0; closediskfile = 0; closefdiskfile = 0; closememfile = 0; flen = strlen(netoutfile); if (!flen) { /* cfileio made a mistake, should set the netoufile first otherwise we don't know where to write the output file */ ffpmsg ("Output file not set, shouldn't have happened (http_compress_open)"); goto error; } if (rwmode != 0) { ffpmsg("Can't open compressed http:// type file with READWRITE access"); ffpmsg(" Specify an UNCOMPRESSED outfile (http_compress_open)"); goto error; } /* do the signal handler bits */ if (setjmp(env) != 0) { /* feels like the second time */ /* this means something bad happened */ ffpmsg("Timeout (http_open)"); snprintf(errorstr, MAXLEN, "Download timeout exceeded: %d seconds",net_timeout); ffpmsg(errorstr); ffpmsg(" Timeout may be adjusted with fits_set_timeout"); goto error; } signal(SIGALRM, signal_handler); /* Open the http connectin */ alarm(net_timeout); if ((status = http_open_network(url,&httpfile,contentencoding, &contentlength))) { alarm(0); ffpmsg("Unable to open http file (http_compress_open)"); ffpmsg(url); goto error; } closehttpfile++; /* Better be compressed */ firstchar = fgetc(httpfile); ungetc(firstchar,httpfile); if (!strcmp(contentencoding,"x-gzip") || !strcmp(contentencoding,"x-compress") || ('\037' == firstchar)) { if (*netoutfile == '!') { /* user wants to clobber file, if it already exists */ for (ii = 0; ii < flen; ii++) netoutfile[ii] = netoutfile[ii + 1]; /* remove '!' */ status = file_remove(netoutfile); } /* Create the new file */ if ((status = file_create(netoutfile,handle))) { ffpmsg("Unable to create output disk file (http_compress_open):"); ffpmsg(netoutfile); goto error; } closediskfile++; /* write a file */ alarm(net_timeout); while(0 != (len = fread(recbuf,1,MAXLEN,httpfile))) { alarm(0); status = file_write(*handle,recbuf,len); if (status) { ffpmsg("Error writing disk file (http_compres_open)"); ffpmsg(netoutfile); goto error; } alarm(net_timeout); } file_close(*handle); fclose(httpfile); closehttpfile--; closediskfile--; /* File is on disk, let's uncompress it into memory */ if (NULL == (diskfile = fopen(netoutfile,"r"))) { ffpmsg("Unable to reopen disk file (http_compress_open)"); ffpmsg(netoutfile); goto error; } closefdiskfile++; /* Create the memory handle to hold it */ if ((status = mem_create(url,handle))) { ffpmsg("Unable to create memory file (http_compress_open)"); goto error; } closememfile++; /* Uncompress it */ status = 0; status = mem_uncompress2mem(url,diskfile,*handle); fclose(diskfile); closefdiskfile--; if (status) { ffpmsg("Error uncompressing disk file to memory (http_compress_open)"); ffpmsg(netoutfile); goto error; } } else { /* Opps, this should not have happened */ ffpmsg("Can only have compressed files here (http_compress_open)"); goto error; } signal(SIGALRM, SIG_DFL); alarm(0); return mem_seek(*handle,0); error: alarm(0); /* clear it */ if (closehttpfile) { fclose(httpfile); } if (closefdiskfile) { fclose(diskfile); } if (closememfile) { mem_close_free(*handle); } if (closediskfile) { file_close(*handle); } signal(SIGALRM, SIG_DFL); return (FILE_NOT_OPENED); } /*--------------------------------------------------------------------------*/ /* This creates a file handle with a copy of the URL in filename. The http file is copied to disk first. If it's compressed then it is uncompressed when copying to the disk */ int http_file_open(char *url, int rwmode, int *handle) { FILE *httpfile; char contentencoding[SHORTLEN]; char errorstr[MAXLEN]; char recbuf[MAXLEN]; long len; int contentlength; int ii, flen, status; char firstchar; /* Check if output file is actually a memory file */ if (!strncmp(netoutfile, "mem:", 4) ) { /* allow the memory file to be opened with write access */ return( http_open(url, READONLY, handle) ); } closehttpfile = 0; closefile = 0; closeoutfile = 0; flen = strlen(netoutfile); if (!flen) { /* cfileio made a mistake, we need to know where to write the file */ ffpmsg("Output file not set, shouldn't have happened (http_file_open)"); return (FILE_NOT_OPENED); } /* do the signal handler bits */ if (setjmp(env) != 0) { /* feels like the second time */ /* this means something bad happened */ ffpmsg("Timeout (http_open)"); snprintf(errorstr, MAXLEN, "Download timeout exceeded: %d seconds",net_timeout); ffpmsg(errorstr); ffpmsg(" (multiplied x10 for files requiring uncompression)"); ffpmsg(" Timeout may be adjusted with fits_set_timeout"); goto error; } signal(SIGALRM, signal_handler); /* Open the network connection */ alarm(net_timeout); if ((status = http_open_network(url,&httpfile,contentencoding, &contentlength))) { alarm(0); ffpmsg("Unable to open http file (http_file_open)"); ffpmsg(url); goto error; } closehttpfile++; if (*netoutfile == '!') { /* user wants to clobber disk file, if it already exists */ for (ii = 0; ii < flen; ii++) netoutfile[ii] = netoutfile[ii + 1]; /* remove '!' */ status = file_remove(netoutfile); } firstchar = fgetc(httpfile); ungetc(firstchar,httpfile); if (!strcmp(contentencoding,"x-gzip") || !strcmp(contentencoding,"x-compress") || ('\037' == firstchar)) { /* to make this more cfitsioish we use the file driver calls to create the disk file */ /* Create the output file */ if ((status = file_create(netoutfile,handle))) { ffpmsg("Unable to create output file (http_file_open)"); ffpmsg(netoutfile); goto error; } file_close(*handle); if (NULL == (outfile = fopen(netoutfile,"w"))) { ffpmsg("Unable to reopen the output file (http_file_open)"); ffpmsg(netoutfile); goto error; } closeoutfile++; status = 0; /* Ok, this is a tough case, let's be arbritary and say 10*net_timeout, Given the choices for nettimeout above they'll probaby ^C before, but it's always worth a shot*/ alarm(net_timeout*10); status = uncompress2file(url,httpfile,outfile,&status); alarm(0); if (status) { ffpmsg("Error uncompressing http file to disk file (http_file_open)"); ffpmsg(url); ffpmsg(netoutfile); goto error; } fclose(outfile); closeoutfile--; } else { /* Create the output file */ if ((status = file_create(netoutfile,handle))) { ffpmsg("Unable to create output file (http_file_open)"); ffpmsg(netoutfile); goto error; } /* Give a warning message. This could just be bad padding at the end so don't treat it like an error. */ closefile++; if (contentlength % 2880) { snprintf(errorstr, MAXLEN, "Content-Length not a multiple of 2880 (http_file_open) %d", contentlength); ffpmsg(errorstr); } /* write a file */ alarm(net_timeout); while(0 != (len = fread(recbuf,1,MAXLEN,httpfile))) { alarm(0); status = file_write(*handle,recbuf,len); if (status) { ffpmsg("Error copying http file to disk file (http_file_open)"); ffpmsg(url); ffpmsg(netoutfile); goto error; } } file_close(*handle); closefile--; } fclose(httpfile); closehttpfile--; signal(SIGALRM, SIG_DFL); alarm(0); return file_open(netoutfile,rwmode,handle); error: alarm(0); /* clear it */ if (closehttpfile) { fclose(httpfile); } if (closeoutfile) { fclose(outfile); } if (closefile) { file_close(*handle); } signal(SIGALRM, SIG_DFL); return (FILE_NOT_OPENED); } /*--------------------------------------------------------------------------*/ /* This is the guts of the code to get a file via http. url is the input url httpfile is set to be the file connected to the socket which you can read the file from contentencoding is the mime type of the file, returned if the http server returns it contentlength is the length of the file, returned if the http server returns it */ static int http_open_network(char *url, FILE **httpfile, char *contentencoding, int *contentlength) { int status; int sock; int tmpint; char recbuf[MAXLEN]; char tmpstr[MAXLEN]; char tmpstr1[SHORTLEN]; char tmpstr2[MAXLEN]; char errorstr[MAXLEN]; char proto[SHORTLEN]; char host[SHORTLEN]; char userpass[MAXLEN]; char fn[MAXLEN]; char turl[MAXLEN]; char *scratchstr; char *scratchstr2; char *saveptr; int port; float version; char pproto[SHORTLEN]; char phost[SHORTLEN]; /* address of the proxy server */ int pport; /* port number of the proxy server */ char pfn[MAXLEN]; char *proxy; /* URL of the proxy server */ /* Parse the URL apart again */ strcpy(turl,"http://"); strncat(turl,url,MAXLEN - 8); if (NET_ParseUrl(turl,proto,host,&port,fn)) { snprintf(errorstr,MAXLEN,"URL Parse Error (http_open) %s",url); ffpmsg(errorstr); return (FILE_NOT_OPENED); } /* Do we have a user:password combo ? */ strcpy(userpass, url); if ((scratchstr = strchr(userpass, '@')) != NULL) { *scratchstr = '\0'; } else { strcpy(userpass, ""); } /* Ph. Prugniel 2003/04/03 Are we using a proxy? We use a proxy if the environment variable "http_proxy" is set to an address, eg. http://wwwcache.nottingham.ac.uk:3128 ("http_proxy" is also used by wget) */ proxy = getenv("http_proxy"); /* Connect to the remote host */ if (proxy) { if (NET_ParseUrl(proxy,pproto,phost,&pport,pfn)) { snprintf(errorstr,MAXLEN,"URL Parse Error (http_open) %s",proxy); ffpmsg(errorstr); return (FILE_NOT_OPENED); } sock = NET_TcpConnect(phost,pport); } else { sock = NET_TcpConnect(host,port); } if (sock < 0) { if (proxy) { ffpmsg("Couldn't connect to host via proxy server (http_open_network)"); ffpmsg(proxy); } return (FILE_NOT_OPENED); } /* Make the socket a stdio file */ if (NULL == (*httpfile = fdopen(sock,"r"))) { ffpmsg ("fdopen failed to convert socket to file (http_open_network)"); close(sock); return (FILE_NOT_OPENED); } /* Send the GET request to the remote server */ /* Ph. Prugniel 2003/04/03 One must add the Host: command because of HTTP 1.1 servers (ie. virtual hosts) */ if (proxy) { snprintf(tmpstr,MAXLEN,"GET http://%s:%-d%s HTTP/1.0\r\n",host,port,fn); } else { snprintf(tmpstr,MAXLEN,"GET %s HTTP/1.0\r\n",fn); } if (strcmp(userpass, "")) { encode64(strlen(userpass), userpass, MAXLEN, tmpstr2); snprintf(tmpstr1, SHORTLEN,"Authorization: Basic %s\r\n", tmpstr2); if (strlen(tmpstr) + strlen(tmpstr1) > MAXLEN - 1) { fclose(*httpfile); *httpfile=0; return (FILE_NOT_OPENED); } strcat(tmpstr,tmpstr1); } /* snprintf(tmpstr1,SHORTLEN,"User-Agent: HEASARC/CFITSIO/%-8.3f\r\n",ffvers(&version)); */ /* snprintf(tmpstr1,SHORTLEN,"User-Agent: CFITSIO/HEASARC/%-8.3f\r\n",ffvers(&version)); */ snprintf(tmpstr1,SHORTLEN,"User-Agent: FITSIO/HEASARC/%-8.3f\r\n",ffvers(&version)); if (strlen(tmpstr) + strlen(tmpstr1) > MAXLEN - 1) { fclose(*httpfile); *httpfile=0; return (FILE_NOT_OPENED); } strcat(tmpstr,tmpstr1); /* HTTP 1.1 servers require the following 'Host: ' string */ snprintf(tmpstr1,SHORTLEN,"Host: %s:%-d\r\n\r\n",host,port); if (strlen(tmpstr) + strlen(tmpstr1) > MAXLEN - 1) { fclose(*httpfile); *httpfile=0; return (FILE_NOT_OPENED); } strcat(tmpstr,tmpstr1); status = NET_SendRaw(sock,tmpstr,strlen(tmpstr),NET_DEFAULT); /* read the header */ if (!(fgets(recbuf,MAXLEN,*httpfile))) { snprintf (errorstr,MAXLEN,"http header short (http_open_network) %s",recbuf); ffpmsg(errorstr); fclose(*httpfile); *httpfile=0; return (FILE_NOT_OPENED); } *contentlength = 0; contentencoding[0] = '\0'; /* Our choices are 200, ok, 302, temporary redirect, or 301 perm redirect */ sscanf(recbuf,"%s %d",tmpstr,&status); if (status != 200){ if (status == 301 || status == 302) { /* got a redirect */ /* if (status == 302) { ffpmsg("Note: Web server replied with a temporary redirect from"); } else { ffpmsg("Note: Web server replied with a redirect from"); } ffpmsg(turl); */ /* now, let's not write the most sophisticated parser here */ while (fgets(recbuf,MAXLEN,*httpfile)) { scratchstr = strstr(recbuf,"Location: "); if (scratchstr != NULL) { /* Ok, we found the Location line which gives the redirected URL */ /* skip the "Location: " charactrers */ scratchstr += 10; /* strip off any end-of-line characters */ tmpint = strlen(scratchstr); if (scratchstr[tmpint-1] == '\r') scratchstr[tmpint-1] = '\0'; tmpint = strlen(scratchstr); if (scratchstr[tmpint-1] == '\n') scratchstr[tmpint-1] = '\0'; tmpint = strlen(scratchstr); if (scratchstr[tmpint-1] == '\r') scratchstr[tmpint-1] = '\0'; /* ffpmsg("to:"); ffpmsg(scratchstr); ffpmsg(" "); */ scratchstr2 = strstr(scratchstr,"http://"); if (scratchstr2 != NULL) { /* Ok, we found the HTTP redirection is to another HTTP URL. */ /* We can handle this case directly, here */ /* skip the "http://" characters */ scratchstr2 += 7; strcpy(turl, scratchstr2); fclose (*httpfile); *httpfile=0; /* note the recursive call to itself */ return http_open_network(turl,httpfile,contentencoding,contentlength); } /* It was not a HTTP to HTTP redirection, so see if it HTTP to FTP */ scratchstr2 = strstr(scratchstr,"ftp://"); if (scratchstr2 != NULL) { /* Ok, we found the HTTP redirection is to a FTP URL. */ /* skip the "ftp://" characters */ scratchstr2 += 6; /* return the new URL string, and set contentencoding to "ftp" as a flag to the http_checkfile routine */ if (strlen(scratchstr2) > FLEN_FILENAME-1) { ffpmsg("Error: redirected url string too long (http_open_network)"); fclose(*httpfile); *httpfile=0; return URL_PARSE_ERROR; } strcpy(url, scratchstr2); strcpy(contentencoding,"ftp://"); fclose (*httpfile); *httpfile=0; return 0; } /* Now check for HTTP to HTTPS redirection. */ scratchstr2 = strstr(scratchstr,"https://"); if (scratchstr2 != NULL) { /* skip the "https://" characters */ scratchstr2 += 8; /* return the new URL string, and set contentencoding to "https" as a flag to the http_checkfile routine */ if (strlen(scratchstr2) > FLEN_FILENAME-1) { ffpmsg("Error: redirected url string too long (http_open_network)"); fclose(*httpfile); return URL_PARSE_ERROR; } strcpy(url, scratchstr2); strcpy(contentencoding,"https://"); fclose(*httpfile); *httpfile=0; return 0; } } } /* if we get here then we couldnt' decide the redirect */ ffpmsg("but we were unable to find the redirected url in the servers response"); } /* error. could not open the http file */ fclose(*httpfile); *httpfile=0; return (FILE_NOT_OPENED); } /* from here the first word holds the keyword we want */ /* so, read the rest of the header */ while (fgets(recbuf,MAXLEN,*httpfile)) { /* Blank line ends the header */ if (*recbuf == '\r') break; if (strlen(recbuf) > 3) { recbuf[strlen(recbuf)-1] = '\0'; recbuf[strlen(recbuf)-1] = '\0'; } sscanf(recbuf,"%s %d",tmpstr,&tmpint); /* Did we get a content-length header ? */ if (!strcmp(tmpstr,"Content-Length:")) { *contentlength = tmpint; } /* Did we get the content-encoding header ? */ if (!strcmp(tmpstr,"Content-Encoding:")) { if (NULL != (scratchstr = strstr(recbuf,":"))) { /* Found the : */ scratchstr++; /* skip the : */ scratchstr++; /* skip the extra space */ if (strlen(scratchstr) > SHORTLEN-1) { ffpmsg("Error: content-encoding string too long (http_open_network)"); fclose(*httpfile); *httpfile=0; return URL_PARSE_ERROR; } strcpy(contentencoding,scratchstr); } } } /* we're done, so return */ return 0; } /*--------------------------------------------------------------------------*/ /* This creates a memory file handle with a copy of the URL in filename. The curl library called from https_open_network will perform file uncompression if necessary. */ int https_open(char *filename, int rwmode, int *handle) { curlmembuf inmem; char errStr[MAXLEN]; int status=0; /* don't do r/w files */ if (rwmode != 0) { ffpmsg("Can't open https:// type file with READWRITE access"); ffpmsg(" Specify an outfile for r/w access (https_open)"); return (FILE_NOT_OPENED); } inmem.memory=0; inmem.size=0; if (setjmp(env) != 0) { alarm(0); signal(SIGALRM, SIG_DFL); ffpmsg("Timeout (https_open)"); snprintf(errStr, MAXLEN, "Download timeout exceeded: %d seconds",net_timeout); ffpmsg(errStr); ffpmsg(" Timeout may be adjusted with fits_set_timeout"); free(inmem.memory); return (FILE_NOT_OPENED); } signal(SIGALRM, signal_handler); alarm(net_timeout); if (https_open_network(filename, &inmem)) { alarm(0); signal(SIGALRM, SIG_DFL); ffpmsg("Unable to read https file into memory (https_open)"); free(inmem.memory); return (FILE_NOT_OPENED); } alarm(0); signal(SIGALRM, SIG_DFL); /* We now have the file transfered from the https server into the inmem.memory buffer. Now transfer that into a FITS memory file. */ if ((status = mem_create(filename, handle))) { ffpmsg("Unable to create memory file (https_open)"); free(inmem.memory); return (FILE_NOT_OPENED); } if (inmem.size % 2880) { snprintf(errStr,MAXLEN,"Content-Length not a multiple of 2880 (https_open) %u", inmem.size); ffpmsg(errStr); } status = mem_write(*handle, inmem.memory, inmem.size); if (status) { ffpmsg("Error copying https file into memory (https_open)"); ffpmsg(filename); free(inmem.memory); mem_close_free(*handle); return (FILE_NOT_OPENED); } free(inmem.memory); return mem_seek(*handle, 0); } /*--------------------------------------------------------------------------*/ int https_file_open(char *filename, int rwmode, int *handle) { int ii, flen; char errStr[MAXLEN]; curlmembuf inmem; /* Check if output file is actually a memory file */ if (!strncmp(netoutfile, "mem:", 4) ) { /* allow the memory file to be opened with write access */ return( https_open(filename, READONLY, handle) ); } flen = strlen(netoutfile); if (!flen) { /* cfileio made a mistake, we need to know where to write the file */ ffpmsg("Output file not set, shouldn't have happened (https_file_open)"); return (FILE_NOT_OPENED); } inmem.memory=0; inmem.size=0; if (setjmp(env) != 0) { alarm(0); signal(SIGALRM, SIG_DFL); ffpmsg("Timeout (https_file_open)"); snprintf(errStr, MAXLEN, "Download timeout exceeded: %d seconds",net_timeout); ffpmsg(errStr); ffpmsg(" Timeout may be adjusted with fits_set_timeout"); free(inmem.memory); return (FILE_NOT_OPENED); } signal(SIGALRM, signal_handler); alarm(net_timeout); if (https_open_network(filename, &inmem)) { alarm(0); signal(SIGALRM, SIG_DFL); ffpmsg("Unable to read https file into memory (https_file_open)"); free(inmem.memory); return (FILE_NOT_OPENED); } alarm(0); signal(SIGALRM, SIG_DFL); if (*netoutfile == '!') { /* user wants to clobber disk file, if it already exists */ for (ii = 0; ii < flen; ii++) netoutfile[ii] = netoutfile[ii + 1]; /* remove '!' */ file_remove(netoutfile); } /* Create the output file */ if (file_create(netoutfile,handle)) { ffpmsg("Unable to create output file (https_file_open)"); ffpmsg(netoutfile); free(inmem.memory); return (FILE_NOT_OPENED); } if (inmem.size % 2880) { snprintf(errStr, MAXLEN, "Content-Length not a multiple of 2880 (https_file_open) %d", inmem.size); ffpmsg(errStr); } if (file_write(*handle, inmem.memory, inmem.size)) { ffpmsg("Error copying https file to disk file (https_file_open)"); ffpmsg(filename); ffpmsg(netoutfile); free(inmem.memory); file_close(*handle); return (FILE_NOT_OPENED); } free(inmem.memory); file_close(*handle); return file_open(netoutfile, rwmode, handle); } /*--------------------------------------------------------------------------*/ /* Callback function curl library uses during https connection to transfer server file into memory */ size_t curlToMemCallback(void *buffer, size_t size, size_t nmemb, void *userp) { curlmembuf* inmem = (curlmembuf* )userp; size_t transferSize = size*nmemb; if (!inmem->size) { /* First time through - initialize with malloc */ inmem->memory = (char *)malloc(transferSize); } else inmem->memory = realloc(inmem->memory, inmem->size+transferSize); if (inmem->memory == NULL) { ffpmsg("realloc error - not enough memory (curlToMemCallback)\n"); return 0; } memcpy(&(inmem->memory[inmem->size]), buffer, transferSize); inmem->size += transferSize; return transferSize; } /*--------------------------------------------------------------------------*/ /* Callback function for displaying status bar during download */ int curlProgressCallback(void *clientp, double dltotal, double dlnow, double ultotal, double ulnow) { int i, fullBar = 50, nToDisplay = 0; int percent = 0; double fracCompleted = 0.0; char *urlname=0; static int isComplete = 0; static int isFirst = 1; /* isFirst is true the very first time this is entered. Afterwards it should get reset to true when isComplete is first detected to have toggled from true to false. */ if (dltotal == 0.0) { if (isComplete) isFirst = 1; isComplete = 0; return 0; } fracCompleted = dlnow/dltotal; percent = (int)ceil(fracCompleted*100.0 - 0.5); if (isComplete && percent < 100) isFirst = 1; if (!isComplete || percent < 100) { if (isFirst) { urlname = (char *)clientp; if (urlname) { fprintf(stderr,"Downloading "); fprintf(stderr,urlname); fprintf(stderr,"...\n"); } isFirst = 0; } isComplete = (percent >= 100) ? 1 : 0; nToDisplay = (int)ceil(fracCompleted*fullBar - 0.5); /* Can dlnow ever be > dltotal? Just in case... */ if (nToDisplay > fullBar) nToDisplay = fullBar; fprintf(stderr,"%3d%% [",percent); for (i=0; i 0) net_timeout = (unsigned int)sec; return (int)net_timeout; } /*--------------------------------------------------------------------------*/ int ftps_open(char *filename, int rwmode, int *handle) { curlmembuf inmem; char errStr[MAXLEN]; char localFilename[MAXLEN]; /* may have .gz or .Z appended in ftps_open_network.*/ unsigned char firstByte=0,secondByte=0; int status=0; FILE *compressedFile=0; strcpy(localFilename,filename); /* don't do r/w files */ if (rwmode != 0) { ffpmsg("Can't open ftps:// type file with READWRITE access"); ffpmsg(" Specify an outfile for r/w access (ftps_open)"); return (FILE_NOT_OPENED); } inmem.memory=0; inmem.size=0; if (setjmp(env) != 0) { alarm(0); signal(SIGALRM, SIG_DFL); ffpmsg("Timeout (ftps_open)"); snprintf(errStr, MAXLEN, "Download timeout exceeded: %d seconds",net_timeout); ffpmsg(errStr); ffpmsg(" Timeout may be adjusted with fits_set_timeout"); free(inmem.memory); return (FILE_NOT_OPENED); } signal(SIGALRM, signal_handler); alarm(net_timeout); if (ftps_open_network(localFilename, &inmem)) { alarm(0); signal(SIGALRM, SIG_DFL); ffpmsg("Unable to read ftps file into memory (ftps_open)"); free(inmem.memory); return (FILE_NOT_OPENED); } alarm(0); signal(SIGALRM, SIG_DFL); if (strcmp(localFilename, filename)) { /* ftps_open_network has already checked that this is safe to copy into string of size FLEN_FILENAME */ strcpy(filename, localFilename); } /* We now have the file transfered from the ftps server into the inmem.memory buffer. Now transfer that into a FITS memory file. */ if ((status = mem_create(filename, handle))) { ffpmsg("Unable to create memory file (ftps_open)"); free(inmem.memory); return (FILE_NOT_OPENED); } if (inmem.size > 1) { firstByte = (unsigned char)inmem.memory[0]; secondByte = (unsigned char)inmem.memory[1]; } if (firstByte == 0x1f && secondByte == 0x8b || strstr(localFilename,".Z")) { #ifdef HAVE_FMEMOPEN compressedFile = fmemopen(inmem.memory, inmem.size, "r"); #endif if (!compressedFile) { ffpmsg("Error creating file in memory (ftps_open)"); free(inmem.memory); return(FILE_NOT_OPENED); } if(mem_uncompress2mem(localFilename,compressedFile,*handle)) { ffpmsg("Error writing compressed memory file (ftps_open)"); ffpmsg(filename); fclose(compressedFile); free(inmem.memory); return(FILE_NOT_OPENED); } fclose(compressedFile); } else { if (inmem.size % 2880) { snprintf(errStr,MAXLEN,"Content-Length not a multiple of 2880 (ftps_open) %u", inmem.size); ffpmsg(errStr); } status = mem_write(*handle, inmem.memory, inmem.size); if (status) { ffpmsg("Error copying https file into memory (ftps_open)"); ffpmsg(filename); free(inmem.memory); mem_close_free(*handle); return (FILE_NOT_OPENED); } } free(inmem.memory); return mem_seek(*handle, 0); } /*--------------------------------------------------------------------------*/ int ftps_file_open(char *filename, int rwmode, int *handle) { int ii, flen, status=0; char errStr[MAXLEN]; char localFilename[MAXLEN]; /* may have .gz or .Z appended */ unsigned char firstByte=0,secondByte=0; curlmembuf inmem; FILE *compressedInFile=0; strcpy(localFilename, filename); /* Check if output file is actually a memory file */ if (!strncmp(netoutfile, "mem:", 4) ) { /* allow the memory file to be opened with write access */ return( ftps_open(filename, READONLY, handle) ); } flen = strlen(netoutfile); if (!flen) { /* cfileio made a mistake, we need to know where to write the file */ ffpmsg("Output file not set, shouldn't have happened (ftps_file_open)"); return (FILE_NOT_OPENED); } inmem.memory=0; inmem.size=0; if (setjmp(env) != 0) { alarm(0); signal(SIGALRM, SIG_DFL); ffpmsg("Timeout (ftps_file_open)"); snprintf(errStr, MAXLEN, "Download timeout exceeded: %d seconds",net_timeout); ffpmsg(errStr); ffpmsg(" Timeout may be adjusted with fits_set_timeout"); free(inmem.memory); return (FILE_NOT_OPENED); } signal(SIGALRM, signal_handler); alarm(net_timeout); if (ftps_open_network(localFilename, &inmem)) { alarm(0); signal(SIGALRM, SIG_DFL); ffpmsg("Unable to read ftps file into memory (ftps_file_open)"); free(inmem.memory); return (FILE_NOT_OPENED); } alarm(0); signal(SIGALRM, SIG_DFL); if (strstr(localFilename, ".Z")) { ffpmsg(".Z decompression not supported for file output (ftps_file_open)"); free(inmem.memory); return (FILE_NOT_OPENED); } if (strcmp(localFilename, filename)) { /* ftps_open_network has already checked that this is safe to copy into string of size FLEN_FILENAME */ strcpy(filename, localFilename); } if (*netoutfile == '!') { /* user wants to clobber disk file, if it already exists */ for (ii = 0; ii < flen; ii++) netoutfile[ii] = netoutfile[ii + 1]; /* remove '!' */ file_remove(netoutfile); } /* Create the output file */ if (file_create(netoutfile,handle)) { ffpmsg("Unable to create output file (ftps_file_open)"); ffpmsg(netoutfile); free(inmem.memory); return (FILE_NOT_OPENED); } if (inmem.size > 1) { firstByte = (unsigned char)inmem.memory[0]; secondByte = (unsigned char)inmem.memory[1]; } if (firstByte == 0x1f && secondByte == 0x8b) { /* Doing a file create/close/reopen to mimic the procedure in ftp_file_open. The earlier call to file_create ensures that checking is performed for the Hera case. */ file_close(*handle); /* Reopen with direct call to fopen to set the outfile pointer */ outfile = fopen(netoutfile,"w"); if (!outfile) { ffpmsg("Unable to reopen the output file (ftps_file_open)"); ffpmsg(netoutfile); free(inmem.memory); return(FILE_NOT_OPENED); } #ifdef HAVE_FMEMOPEN compressedInFile = fmemopen(inmem.memory, inmem.size, "r"); #endif if (!compressedInFile) { ffpmsg("Error creating compressed file in memory (ftps_file_open)"); free(inmem.memory); fclose(outfile); return(FILE_NOT_OPENED); } if (uncompress2file(filename, compressedInFile, outfile, &status)) { ffpmsg("Unable to uncompress the output file (ftps_file_open)"); ffpmsg(filename); ffpmsg(netoutfile); fclose(outfile); fclose(compressedInFile); free(inmem.memory); return(FILE_NOT_OPENED); } fclose(outfile); fclose(compressedInFile); } else { if (inmem.size % 2880) { snprintf(errStr, MAXLEN, "Content-Length not a multiple of 2880 (ftps_file_open) %d", inmem.size); ffpmsg(errStr); } if (file_write(*handle, inmem.memory, inmem.size)) { ffpmsg("Error copying ftps file to disk file (ftps_file_open)"); ffpmsg(filename); ffpmsg(netoutfile); free(inmem.memory); file_close(*handle); return (FILE_NOT_OPENED); } file_close(*handle); } free(inmem.memory); return file_open(netoutfile, rwmode, handle); } /*--------------------------------------------------------------------------*/ int ftps_compress_open(char *filename, int rwmode, int *handle) { int ii, flen, status=0; char errStr[MAXLEN]; char localFilename[MAXLEN]; /* may have .gz or .Z appended */ unsigned char firstByte=0,secondByte=0; curlmembuf inmem; FILE *compressedInFile=0; /* don't do r/w files */ if (rwmode != 0) { ffpmsg("Compressed files must be r/o"); return (FILE_NOT_OPENED); } strcpy(localFilename, filename); flen = strlen(netoutfile); if (!flen) { /* cfileio made a mistake, we need to know where to write the file */ ffpmsg("Output file not set, shouldn't have happened (ftps_compress_open)"); return (FILE_NOT_OPENED); } inmem.memory=0; inmem.size=0; if (setjmp(env) != 0) { alarm(0); signal(SIGALRM, SIG_DFL); ffpmsg("Timeout (ftps_compress_open)"); snprintf(errStr, MAXLEN, "Download timeout exceeded: %d seconds",net_timeout); ffpmsg(errStr); ffpmsg(" Timeout may be adjusted with fits_set_timeout"); free(inmem.memory); return (FILE_NOT_OPENED); } signal(SIGALRM, signal_handler); alarm(net_timeout); if (ftps_open_network(localFilename, &inmem)) { alarm(0); signal(SIGALRM, SIG_DFL); ffpmsg("Unable to read ftps file into memory (ftps_compress_open)"); free(inmem.memory); return (FILE_NOT_OPENED); } alarm(0); signal(SIGALRM, SIG_DFL); if (strcmp(localFilename, filename)) { /* ftps_open_network has already checked that this is safe to copy into string of size FLEN_FILENAME */ strcpy(filename, localFilename); } if (inmem.size > 1) { firstByte = (unsigned char)inmem.memory[0]; secondByte = (unsigned char)inmem.memory[1]; } if ((firstByte == 0x1f && secondByte == 0x8b) || strstr(localFilename,".gz") || strstr(localFilename,".Z")) { if (*netoutfile == '!') { /* user wants to clobber disk file, if it already exists */ for (ii = 0; ii < flen; ii++) netoutfile[ii] = netoutfile[ii + 1]; /* remove '!' */ file_remove(netoutfile); } /* Create the output file */ if (file_create(netoutfile,handle)) { ffpmsg("Unable to create output file (ftps_compress_open)"); ffpmsg(netoutfile); free(inmem.memory); return (FILE_NOT_OPENED); } if (file_write(*handle, inmem.memory, inmem.size)) { ffpmsg("Error copying ftps file to disk file (ftps_file_open)"); ffpmsg(filename); ffpmsg(netoutfile); free(inmem.memory); file_close(*handle); return (FILE_NOT_OPENED); } file_close(*handle); /* File is on disk, let's uncompress it into memory */ if (NULL == (diskfile = fopen(netoutfile,"r"))) { ffpmsg("Unable to reopen disk file (ftps_compress_open)"); ffpmsg(netoutfile); free(inmem.memory); return (FILE_NOT_OPENED); } if ((status = mem_create(localFilename,handle))) { ffpmsg("Unable to create memory file (ftps_compress_open)"); ffpmsg(localFilename); free(inmem.memory); fclose(diskfile); diskfile=0; return (FILE_NOT_OPENED); } status = mem_uncompress2mem(localFilename,diskfile,*handle); fclose(diskfile); diskfile=0; if (status) { ffpmsg("Error writing compressed memory file (ftps_compress_open)"); free(inmem.memory); mem_close_free(*handle); return (FILE_NOT_OPENED); } } else { ffpmsg("Cannot write uncompressed infile to compressed outfile (ftps_compress_open)"); free(inmem.memory); return (FILE_NOT_OPENED); } free(inmem.memory); return mem_seek(*handle,0); } /*--------------------------------------------------------------------------*/ int ftps_open_network(char *filename, curlmembuf* buffer) { char agentStr[SHORTLEN]; char url[MAXLEN]; char tmphost[SHORTLEN]; /* work array for separating user/pass/host names */ char *username=0; char *password=0; char *hostname=0; char *dirpath=0; char *strptr=0; float version=0.0; int iDirpath=0, len=0, origLen=0; int status=0; strcpy(url,"ftp://"); /* The filename may already contain a username and password, as indicated by a '@' within the host part of the name (which we'll define as the substring before the first '/'). If not, we'll set a default username:password */ len = strlen(filename); for (iDirpath=0; iDirpath SHORTLEN-1) { ffpmsg("Host name is too long in URL (ftps_open_network)"); return (FILE_NOT_OPENED); } strncpy(tmphost, filename, iDirpath); dirpath = &filename[iDirpath]; tmphost[iDirpath]='\0'; /* There could be more than one '@' since they can also exist in the username or password. Find the right-most '@' and assume that it delimits the host name. */ hostname = strrchr(tmphost, '@'); if (hostname) { *hostname = '\0'; ++hostname; /* Assume first occurrence of ':' is indicative of password delimiter. */ password = strchr(tmphost, ':'); if (password) { *password = '\0'; ++password; } username = tmphost; } else hostname = tmphost; if (!username || strlen(username)==0) username = "anonymous"; if (!password || strlen(password)==0) { snprintf(agentStr,SHORTLEN,"User-Agent: FITSIO/HEASARC/%-8.3f",ffvers(&version)); password = agentStr; } /* url may eventually have .gz or .Z appended to it */ if (strlen(url) + strlen(hostname) + strlen(dirpath) > MAXLEN-4) { ffpmsg("Full URL name is too long (ftps_open_network)"); return (FILE_NOT_OPENED); } strcat(url, hostname); strcat(url, dirpath); /* printf("url = %s\n",url); printf("username = %s\n",username); printf("password = %s\n",password); printf("hostname = %s\n",hostname); */ origLen = strlen(url); status = ssl_get_with_curl(url, buffer, username, password); /* If original url has .gz or .Z appended, do the same to the original filename. Note that url also differs from original filename at this point, since filename may have included username@password (which url would not). */ len = strlen(url); if ((len-origLen) == 2 || (len-origLen) == 3) { if (strlen(filename) > FLEN_FILENAME - 4) { ffpmsg("Filename is too long to append compression ext (ftps_open_network)"); /* buffer memory must be freed by calling routine */ return (FILE_NOT_OPENED); } strptr = url + origLen; strcat(filename, strptr); } return status; } /*--------------------------------------------------------------------------*/ /* Function to perform common curl interfacing for https or ftps transfers */ int ssl_get_with_curl(char *url, curlmembuf* buffer, char* username, char* password) { /* These settings will force libcurl to perform host and peer authentication. If it fails, this routine will try again without authentication (unless user forbids this via CFITSIO_VERIFY_HTTPS environment variable). */ long verifyPeer = 1; long verifyHost = 2; char errStr[MAXLEN]; char agentStr[MAXLEN]; float version=0.0; char *tmpUrl=0; char *verify=0; int isFtp = (strstr(url,"ftp://") != NULL); int experimentWithCompression = (!strstr(url,".gz") && !strstr(url,".Z") && !strstr(url,"?")); int notFound=1; #ifdef CFITSIO_HAVE_CURL CURL *curl=0; CURLcode res; char curlErrBuf[CURL_ERROR_SIZE]; if (strstr(url,".Z") && !isFtp) { ffpmsg("x-compress .Z format not currently supported with curl https transfers"); return(FILE_NOT_OPENED); } /* Will ASSUME curl_global_init has been called by this point. It is not thread-safe to call it here. */ curl = curl_easy_init(); res = curl_easy_setopt(curl, CURLOPT_SSL_VERIFYPEER, verifyPeer); if (res != CURLE_OK) { ffpmsg("ERROR: CFITSIO was built with a libcurl library that "); ffpmsg("does not have SSL support, and therefore can't perform https or ftps transfers."); return (FILE_NOT_OPENED); } curl_easy_setopt(curl, CURLOPT_SSL_VERIFYHOST, verifyHost); curl_easy_setopt(curl, CURLOPT_VERBOSE, (long)curl_verbose); curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, curlToMemCallback); snprintf(agentStr,MAXLEN,"User-Agent: FITSIO/HEASARC/%-8.3f",ffvers(&version)); curl_easy_setopt(curl, CURLOPT_USERAGENT,agentStr); buffer->memory = 0; /* malloc/realloc will grow this in the callback function */ buffer->size = 0; curl_easy_setopt(curl, CURLOPT_WRITEDATA, (void *)buffer); curl_easy_setopt(curl, CURLOPT_ERRORBUFFER, curlErrBuf); curlErrBuf[0]=0; /* This is needed for easy_perform to return an error whenever http server returns an error >= 400, ie. if it can't find the requested file. */ curl_easy_setopt(curl, CURLOPT_FAILONERROR, 1L); /* This turns on automatic decompression for all recognized types. */ curl_easy_setopt(curl, CURLOPT_ENCODING, ""); /* tmpUrl should be large enough to accomodate original url + ".gz" */ tmpUrl = (char *)malloc(strlen(url)+4); strcpy(tmpUrl, url); if (show_fits_download_progress) { curl_easy_setopt(curl, CURLOPT_PROGRESSFUNCTION, curlProgressCallback); curl_easy_setopt(curl, CURLOPT_PROGRESSDATA, tmpUrl); curl_easy_setopt(curl, CURLOPT_NOPROGRESS, 0L); } else curl_easy_setopt(curl, CURLOPT_NOPROGRESS, 1L); /* USESSL only necessary for ftps, though it may not hurt anything if it were also set for https. */ if (isFtp) { curl_easy_setopt(curl, CURLOPT_USE_SSL, CURLUSESSL_ALL); if (username) curl_easy_setopt(curl, CURLOPT_USERNAME, username); if (password) curl_easy_setopt(curl, CURLOPT_PASSWORD, password); } /* Unless url already contains a .gz, .Z or '?' (probably from a cgi script), first try with .gz appended. */ if (experimentWithCompression) strcat(tmpUrl, ".gz"); /* First attempt: verification on */ curl_easy_setopt(curl, CURLOPT_URL, tmpUrl); res = curl_easy_perform(curl); if (res != CURLE_OK && res != CURLE_HTTP_RETURNED_ERROR && res != CURLE_REMOTE_FILE_NOT_FOUND) { /* CURLE_HTTP_RETURNED_ERROR is what gets returned if HTTP server returns an error code >= 400. CURLE_REMOTE_FILE_NOT_FOUND may be returned by an ftp server. If these are not causing this error, assume it is a verification issue. Try again with verification removed, unless user disallowed it via environment variable. */ verify = getenv("CFITSIO_VERIFY_HTTPS"); if (verify) { if (verify[0] == 'T' || verify[0] == 't') { snprintf(errStr,MAXLEN,"libcurl error: %d",res); ffpmsg(errStr); if (strlen(curlErrBuf)) ffpmsg(curlErrBuf); curl_easy_cleanup(curl); free(tmpUrl); return (FILE_NOT_OPENED); } } verifyPeer = 0; verifyHost = 0; curl_easy_setopt(curl, CURLOPT_SSL_VERIFYPEER, verifyPeer); curl_easy_setopt(curl, CURLOPT_SSL_VERIFYHOST, verifyHost); /* Second attempt: no verification, .gz appended */ res = curl_easy_perform(curl); if (res != CURLE_OK) { if (isFtp && experimentWithCompression) { strcpy(tmpUrl, url); strcat(tmpUrl, ".Z"); curl_easy_setopt(curl, CURLOPT_URL, tmpUrl); /* For ftps, make another attempt with .Z */ res = curl_easy_perform(curl); if (res == CURLE_OK) { /* Success, but should still warn */ fprintf(stderr, "Warning: Unable to perform SSL verification on https transfer from: %s\n", tmpUrl); notFound=0; } } /* If we've been appending .gz or .Z, try a final time without. */ if (experimentWithCompression && notFound) { strcpy(tmpUrl, url); curl_easy_setopt(curl, CURLOPT_URL, tmpUrl); /* attempt with no verification, no .gz or .Z appended */ res = curl_easy_perform(curl); if (res != CURLE_OK) { snprintf(errStr,MAXLEN,"libcurl error: %d",res); ffpmsg(errStr); if (strlen(curlErrBuf)) ffpmsg(curlErrBuf); curl_easy_cleanup(curl); free(tmpUrl); return (FILE_NOT_OPENED); } else /* Success, but should still warn */ fprintf(stderr, "Warning: Unable to perform SSL verification on https transfer from: %s\n", tmpUrl); } else if (notFound) { snprintf(errStr,MAXLEN,"libcurl error: %d",res); ffpmsg(errStr); if (strlen(curlErrBuf)) ffpmsg(curlErrBuf); curl_easy_cleanup(curl); free(tmpUrl); return (FILE_NOT_OPENED); } } else /* Success, but still issue warning */ fprintf(stderr, "Warning: Unable to perform SSL verification on https transfer from: %s\n", tmpUrl); } else if (res == CURLE_HTTP_RETURNED_ERROR || res == CURLE_REMOTE_FILE_NOT_FOUND) { /* .gz extension failed and verification isn't the problem. No need to relax peer/host checking */ /* Unless url already contained a .gz, .Z or '?' (probably from a cgi script), try again with original url unappended (but first try .Z if this is ftps). */ if (experimentWithCompression) { if (isFtp) { strcpy(tmpUrl, url); strcat(tmpUrl, ".Z"); curl_easy_setopt(curl, CURLOPT_URL, tmpUrl); res = curl_easy_perform(curl); if (res == CURLE_OK) notFound = 0; } if (notFound) { strcpy(tmpUrl, url); curl_easy_setopt(curl, CURLOPT_URL, tmpUrl); res = curl_easy_perform(curl); if (res != CURLE_OK) { snprintf(errStr,MAXLEN,"libcurl error: %d",res); ffpmsg(errStr); if (strlen(curlErrBuf)) ffpmsg(curlErrBuf); curl_easy_cleanup(curl); free(tmpUrl); return (FILE_NOT_OPENED); } } } else { snprintf(errStr,MAXLEN,"libcurl error: %d",res); ffpmsg(errStr); if (strlen(curlErrBuf)) ffpmsg(curlErrBuf); curl_easy_cleanup(curl); free(tmpUrl); return (FILE_NOT_OPENED); } } /* If we made it here, assume tmpUrl was successful. Calling routines must make sure url can hold up to 3 extra chars */ strcpy(url, tmpUrl); free(tmpUrl); curl_easy_cleanup(curl); #else ffpmsg("ERROR: This CFITSIO build was not compiled with the libcurl library package "); ffpmsg("and therefore it cannot perform HTTPS or FTPS connections."); return (FILE_NOT_OPENED); #endif return 0; } /*--------------------------------------------------------------------------*/ /* This creates a memory file handle with a copy of the URL in filename. The file is uncompressed if necessary */ int ftp_open(char *filename, int rwmode, int *handle) { FILE *ftpfile; FILE *command; int sock; char errorstr[MAXLEN]; char recbuf[MAXLEN]; long len; int status; char firstchar; closememfile = 0; closecommandfile = 0; closeftpfile = 0; /* don't do r/w files */ if (rwmode != 0) { ffpmsg("Can't open ftp:// type file with READWRITE access"); ffpmsg("Specify an outfile for r/w access (ftp_open)"); return (FILE_NOT_OPENED); } /* do the signal handler bits */ if (setjmp(env) != 0) { /* feels like the second time */ /* this means something bad happened */ ffpmsg("Timeout (ftp_open)"); snprintf(errorstr, MAXLEN, "Download timeout exceeded: %d seconds",net_timeout); ffpmsg(errorstr); ffpmsg(" (multiplied x10 for files requiring uncompression)"); ffpmsg(" Timeout may be adjusted with fits_set_timeout"); goto error; } signal(SIGALRM, signal_handler); /* Open the ftp connetion. ftpfile is connected to the file port, command is connected to port 21. sock is the socket on port 21 */ if (strlen(filename) > MAXLEN - 4) { ffpmsg("filename too long (ftp_open)"); ffpmsg(filename); goto error; } alarm(net_timeout); if (ftp_open_network(filename,&ftpfile,&command,&sock)) { alarm(0); ffpmsg("Unable to open following ftp file (ftp_open):"); ffpmsg(filename); goto error; } closeftpfile++; closecommandfile++; /* create the memory file */ if ((status = mem_create(filename,handle))) { ffpmsg ("Could not create memory file to passive port (ftp_open)"); ffpmsg(filename); goto error; } closememfile++; /* This isn't quite right, it'll fail if the file has .gzabc at the end for instance */ /* Decide if the file is compressed */ firstchar = fgetc(ftpfile); ungetc(firstchar,ftpfile); if (strstr(filename,".gz") || strstr(filename,".Z") || ('\037' == firstchar)) { status = 0; /* A bit arbritary really, the user will probably hit ^C */ alarm(net_timeout*10); status = mem_uncompress2mem(filename, ftpfile, *handle); alarm(0); if (status) { ffpmsg("Error writing compressed memory file (ftp_open)"); ffpmsg(filename); goto error; } } else { /* write a memory file */ alarm(net_timeout); while(0 != (len = fread(recbuf,1,MAXLEN,ftpfile))) { alarm(0); status = mem_write(*handle,recbuf,len); if (status) { ffpmsg("Error writing memory file (http_open)"); ffpmsg(filename); goto error; } alarm(net_timeout); } } /* close and clean up */ fclose(ftpfile); closeftpfile--; fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); closecommandfile--; signal(SIGALRM, SIG_DFL); alarm(0); return mem_seek(*handle,0); error: alarm(0); /* clear it */ if (closecommandfile) { fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); } if (closeftpfile) { fclose(ftpfile); } if (closememfile) { mem_close_free(*handle); } signal(SIGALRM, SIG_DFL); return (FILE_NOT_OPENED); } /*--------------------------------------------------------------------------*/ /* This creates a file handle with a copy of the URL in filename. The file must be uncompressed and is copied to disk first */ int ftp_file_open(char *url, int rwmode, int *handle) { FILE *ftpfile; FILE *command; char errorstr[MAXLEN]; char recbuf[MAXLEN]; long len; int sock; int ii, flen, status; char firstchar; /* Check if output file is actually a memory file */ if (!strncmp(netoutfile, "mem:", 4) ) { /* allow the memory file to be opened with write access */ return( ftp_open(url, READONLY, handle) ); } closeftpfile = 0; closecommandfile = 0; closefile = 0; closeoutfile = 0; /* cfileio made a mistake, need to know where to write the output file */ flen = strlen(netoutfile); if (!flen) { ffpmsg("Output file not set, shouldn't have happened (ftp_file_open)"); return (FILE_NOT_OPENED); } /* do the signal handler bits */ if (setjmp(env) != 0) { /* feels like the second time */ /* this means something bad happened */ ffpmsg("Timeout (ftp_file_open)"); snprintf(errorstr, MAXLEN, "Download timeout exceeded: %d seconds",net_timeout); ffpmsg(errorstr); ffpmsg(" (multiplied x10 for files requiring uncompression)"); ffpmsg(" Timeout may be adjusted with fits_set_timeout"); goto error; } signal(SIGALRM, signal_handler); /* open the network connection to url. ftpfile holds the connection to the input file, command holds the connection to port 21, and sock is the socket connected to port 21 */ alarm(net_timeout); if ((status = ftp_open_network(url,&ftpfile,&command,&sock))) { alarm(0); ffpmsg("Unable to open http file (ftp_file_open)"); ffpmsg(url); goto error; } closeftpfile++; closecommandfile++; if (*netoutfile == '!') { /* user wants to clobber file, if it already exists */ for (ii = 0; ii < flen; ii++) netoutfile[ii] = netoutfile[ii + 1]; /* remove '!' */ status = file_remove(netoutfile); } /* Now, what do we do with the file */ firstchar = fgetc(ftpfile); ungetc(firstchar,ftpfile); if (strstr(url,".gz") || strstr(url,".Z") || ('\037' == firstchar)) { /* to make this more cfitsioish we use the file driver calls to create the file */ /* Create the output file */ if ((status = file_create(netoutfile,handle))) { ffpmsg("Unable to create output file (ftp_file_open)"); ffpmsg(netoutfile); goto error; } file_close(*handle); if (NULL == (outfile = fopen(netoutfile,"w"))) { ffpmsg("Unable to reopen the output file (ftp_file_open)"); ffpmsg(netoutfile); goto error; } closeoutfile++; status = 0; /* Ok, this is a tough case, let's be arbritary and say 10*net_timeout, Given the choices for nettimeout above they'll probaby ^C before, but it's always worth a shot*/ alarm(net_timeout*10); status = uncompress2file(url,ftpfile,outfile,&status); alarm(0); if (status) { ffpmsg("Unable to uncompress the output file (ftp_file_open)"); ffpmsg(url); ffpmsg(netoutfile); goto error; } fclose(outfile); closeoutfile--; } else { /* Create the output file */ if ((status = file_create(netoutfile,handle))) { ffpmsg("Unable to create output file (ftp_file_open)"); ffpmsg(netoutfile); goto error; } closefile++; /* write a file */ alarm(net_timeout); while(0 != (len = fread(recbuf,1,MAXLEN,ftpfile))) { alarm(0); status = file_write(*handle,recbuf,len); if (status) { ffpmsg("Error writing file (ftp_file_open)"); ffpmsg(url); ffpmsg(netoutfile); goto error; } alarm(net_timeout); } file_close(*handle); } fclose(ftpfile); closeftpfile--; fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); closecommandfile--; signal(SIGALRM, SIG_DFL); alarm(0); return file_open(netoutfile,rwmode,handle); error: alarm(0); /* clear it */ if (closeftpfile) { fclose(ftpfile); } if (closecommandfile) { fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); } if (closeoutfile) { fclose(outfile); } if (closefile) { file_close(*handle); } signal(SIGALRM, SIG_DFL); return (FILE_NOT_OPENED); } /*--------------------------------------------------------------------------*/ /* This creates a memory handle with a copy of the URL in filename. The file must be compressed and is copied to disk first */ int ftp_compress_open(char *url, int rwmode, int *handle) { FILE *ftpfile; FILE *command; char errorstr[MAXLEN]; char recbuf[MAXLEN]; long len; int ii, flen, status; int sock; char firstchar; closeftpfile = 0; closecommandfile = 0; closememfile = 0; closefdiskfile = 0; closediskfile = 0; /* don't do r/w files */ if (rwmode != 0) { ffpmsg("Compressed files must be r/o"); return (FILE_NOT_OPENED); } /* Need to know where to write the output file */ flen = strlen(netoutfile); if (!flen) { ffpmsg( "Output file not set, shouldn't have happened (ftp_compress_open)"); return (FILE_NOT_OPENED); } /* do the signal handler bits */ if (setjmp(env) != 0) { /* feels like the second time */ /* this means something bad happened */ ffpmsg("Timeout (ftp_compress_open)"); snprintf(errorstr, MAXLEN, "Download timeout exceeded: %d seconds",net_timeout); ffpmsg(errorstr); ffpmsg(" Timeout may be adjusted with fits_set_timeout"); goto error; } signal(SIGALRM, signal_handler); /* Open the network connection to url, ftpfile is connected to the file port, command is connected to port 21. sock is for writing to port 21 */ alarm(net_timeout); if ((status = ftp_open_network(url,&ftpfile,&command,&sock))) { alarm(0); ffpmsg("Unable to open ftp file (ftp_compress_open)"); ffpmsg(url); goto error; } closeftpfile++; closecommandfile++; /* Now, what do we do with the file */ firstchar = fgetc(ftpfile); ungetc(firstchar,ftpfile); if (strstr(url,".gz") || strstr(url,".Z") || ('\037' == firstchar)) { if (*netoutfile == '!') { /* user wants to clobber file, if it already exists */ for (ii = 0; ii < flen; ii++) netoutfile[ii] = netoutfile[ii + 1]; /* remove '!' */ status = file_remove(netoutfile); } /* Create the output file */ if ((status = file_create(netoutfile,handle))) { ffpmsg("Unable to create output file (ftp_compress_open)"); ffpmsg(netoutfile); goto error; } closediskfile++; /* write a file */ alarm(net_timeout); while(0 != (len = fread(recbuf,1,MAXLEN,ftpfile))) { alarm(0); status = file_write(*handle,recbuf,len); if (status) { ffpmsg("Error writing file (ftp_compres_open)"); ffpmsg(url); ffpmsg(netoutfile); goto error; } alarm(net_timeout); } file_close(*handle); closediskfile--; fclose(ftpfile); closeftpfile--; /* Close down the ftp connection */ fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); closecommandfile--; /* File is on disk, let's uncompress it into memory */ if (NULL == (diskfile = fopen(netoutfile,"r"))) { ffpmsg("Unable to reopen disk file (ftp_compress_open)"); ffpmsg(netoutfile); return (FILE_NOT_OPENED); } closefdiskfile++; if ((status = mem_create(url,handle))) { ffpmsg("Unable to create memory file (ftp_compress_open)"); ffpmsg(url); goto error; } closememfile++; status = 0; status = mem_uncompress2mem(url,diskfile,*handle); fclose(diskfile); closefdiskfile--; if (status) { ffpmsg("Error writing compressed memory file (ftp_compress_open)"); goto error; } } else { /* Opps, this should not have happened */ ffpmsg("Can only compressed files here (ftp_compress_open)"); goto error; } signal(SIGALRM, SIG_DFL); alarm(0); return mem_seek(*handle,0); error: alarm(0); /* clear it */ if (closeftpfile) { fclose(ftpfile); } if (closecommandfile) { fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); } if (closefdiskfile) { fclose(diskfile); } if (closememfile) { mem_close_free(*handle); } if (closediskfile) { file_close(*handle); } signal(SIGALRM, SIG_DFL); return (FILE_NOT_OPENED); } /*--------------------------------------------------------------------------*/ /* Open a ftp connection to filename (really a URL), return ftpfile set to the file connection, and command set to the control connection, with sock also set to the control connection */ static int ftp_open_network(char *filename, FILE **ftpfile, FILE **command, int *sock) { int status; int sock1; int tmpint; char recbuf[MAXLEN]; char errorstr[MAXLEN]; char tmpstr[MAXLEN]; char proto[SHORTLEN]; char host[SHORTLEN]; char agentStr[SHORTLEN]; char *newhost; char *username; char *password; char fn[MAXLEN]; char *newfn; char *passive; char *tstr; char *saveptr; char ip[SHORTLEN]; char turl[MAXLEN]; int port; int ii,tryingtologin = 1; float version=0.0; /* parse the URL */ if (strlen(filename) > MAXLEN - 7) { ffpmsg("ftp filename is too long (ftp_open_network)"); return (FILE_NOT_OPENED); } strcpy(turl,"ftp://"); strcat(turl,filename); if (NET_ParseUrl(turl,proto,host,&port,fn)) { snprintf(errorstr,MAXLEN,"URL Parse Error (ftp_open) %s",filename); ffpmsg(errorstr); return (FILE_NOT_OPENED); } port = 21; /* We might have a user name. If not, set defaults for username and password */ username = "anonymous"; snprintf(agentStr,SHORTLEN,"User-Agent: FITSIO/HEASARC/%-8.3f",ffvers(&version)); password = agentStr; /* is there an @ sign */ if (NULL != (newhost = strrchr(host,'@'))) { *newhost = '\0'; /* make it a null, */ newhost++; /* Now newhost points to the host name and host points to the user name, password combo */ username = host; /* is there a : for a password */ if (NULL != strchr(username,':')) { password = strchr(username,':'); *password = '\0'; password++; } } else { newhost = host; } for (ii = 0; ii < 10; ii++) { /* make up to 10 attempts to log in */ /* Connect to the host on the required port */ *sock = NET_TcpConnect(newhost,port); /* convert it to a stdio file */ if (NULL == (*command = fdopen(*sock,"r"))) { ffpmsg ("fdopen failed to convert socket to stdio file (ftp_open_netowrk)"); return (FILE_NOT_OPENED); } /* Wait for the 220 response */ if (ftp_status(*command,"220 ")) { fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); /* ffpmsg("sleeping for 5 in ftp_open_network, then try again"); */ sleep (5); /* take a nap and hope ftp server sorts itself out in the meantime */ } else { tryingtologin = 0; break; } } if (tryingtologin) { /* the 10 attempts were not successful */ ffpmsg ("error connecting to remote server, no 220 seen (ftp_open_network)"); return (FILE_NOT_OPENED); } /* Send the user name and wait for the right response */ snprintf(tmpstr,MAXLEN,"USER %s\r\n",username); status = NET_SendRaw(*sock,tmpstr,strlen(tmpstr),NET_DEFAULT); if (ftp_status(*command,"331 ")) { ffpmsg ("USER error no 331 seen (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } /* Send the password and wait for the right response */ snprintf(tmpstr,MAXLEN,"PASS %s\r\n",password); status = NET_SendRaw(*sock,tmpstr,strlen(tmpstr),NET_DEFAULT); if (ftp_status(*command,"230 ")) { ffpmsg ("PASS error, no 230 seen (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } /* now do the cwd command */ newfn = strrchr(fn,'/'); if (newfn == NULL) { strcpy(tmpstr,"CWD /\r\n"); newfn = fn; } else { *newfn = '\0'; newfn++; if (strlen(fn) == 0) { strcpy(tmpstr,"CWD /\r\n"); } else { /* remove the leading slash */ if (fn[0] == '/') { snprintf(tmpstr,MAXLEN,"CWD %s\r\n",&fn[1]); } else { snprintf(tmpstr,MAXLEN,"CWD %s\r\n",fn); } } } status = NET_SendRaw(*sock,tmpstr,strlen(tmpstr),NET_DEFAULT); if (ftp_status(*command,"250 ")) { ffpmsg ("CWD error, no 250 seen (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } if (!strlen(newfn)) { ffpmsg("Null file name (ftp_open)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } /* Always use binary mode */ snprintf(tmpstr,MAXLEN,"TYPE I\r\n"); status = NET_SendRaw(*sock,tmpstr,strlen(tmpstr),NET_DEFAULT); if (ftp_status(*command,"200 ")) { ffpmsg ("TYPE I error, 200 not seen (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } status = NET_SendRaw(*sock,"PASV\r\n",6,NET_DEFAULT); if (!(fgets(recbuf,MAXLEN,*command))) { ffpmsg ("PASV error (ftp_open)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } /* Passive mode response looks like 227 Entering Passive Mode (129,194,67,8,210,80) */ if (recbuf[0] == '2' && recbuf[1] == '2' && recbuf[2] == '7') { /* got a good passive mode response, find the opening ( */ if (!(passive = strchr(recbuf,'('))) { ffpmsg ("PASV error (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } *passive = '\0'; passive++; ip[0] = '\0'; /* Messy parsing of response from PASV *command */ if (!(tstr = ffstrtok(passive,",)",&saveptr))) { ffpmsg ("PASV error (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } strcpy(ip,tstr); strcat(ip,"."); if (!(tstr = ffstrtok(NULL,",)",&saveptr))) { ffpmsg ("PASV error (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } strcat(ip,tstr); strcat(ip,"."); if (!(tstr = ffstrtok(NULL,",)",&saveptr))) { ffpmsg ("PASV error (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } strcat(ip,tstr); strcat(ip,"."); if (!(tstr = ffstrtok(NULL,",)",&saveptr))) { ffpmsg ("PASV error (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } strcat(ip,tstr); /* Done the ip number, now do the port # */ if (!(tstr = ffstrtok(NULL,",)",&saveptr))) { ffpmsg ("PASV error (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } sscanf(tstr,"%d",&port); port *= 256; if (!(tstr = ffstrtok(NULL,",)",&saveptr))) { ffpmsg ("PASV error (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } sscanf(tstr,"%d",&tmpint); port += tmpint; if (!strlen(newfn)) { ffpmsg("Null file name (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } /* Connect to the data port */ sock1 = NET_TcpConnect(ip,port); if (NULL == (*ftpfile = fdopen(sock1,"r"))) { ffpmsg ("Could not connect to passive port (ftp_open_network)"); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } /* Send the retrieve command */ snprintf(tmpstr,MAXLEN,"RETR %s\r\n",newfn); status = NET_SendRaw(*sock,tmpstr,strlen(tmpstr),NET_DEFAULT); if (ftp_status(*command,"150 ")) { fclose(*ftpfile); NET_SendRaw(sock1,"QUIT\r\n",6,NET_DEFAULT); fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } return 0; /* successfully opened the ftp file */ } /* no passive mode */ fclose(*command); NET_SendRaw(*sock,"QUIT\r\n",6,NET_DEFAULT); return (FILE_NOT_OPENED); } /*--------------------------------------------------------------------------*/ /* Open a ftp connection to see if the file exists (return 1) or not (return 0) */ int ftp_file_exist(char *filename) { FILE *ftpfile; FILE *command; int sock; int status; int sock1; int tmpint; char recbuf[MAXLEN]; char errorstr[MAXLEN]; char tmpstr[MAXLEN]; char proto[SHORTLEN]; char host[SHORTLEN]; char *newhost; char *username; char *password; char fn[MAXLEN]; char *newfn; char *passive; char *tstr; char *saveptr; char ip[SHORTLEN]; char turl[MAXLEN]; int port; int ii, tryingtologin = 1; /* parse the URL */ if (strlen(filename) > MAXLEN - 7) { ffpmsg("ftp filename is too long (ftp_file_exist)"); return 0; } strcpy(turl,"ftp://"); strcat(turl,filename); if (NET_ParseUrl(turl,proto,host,&port,fn)) { snprintf(errorstr,MAXLEN,"URL Parse Error (ftp_file_exist) %s",filename); ffpmsg(errorstr); return 0; } port = 21; /* we might have a user name */ username = "anonymous"; password = "user@host.com"; /* is there an @ sign */ if (NULL != (newhost = strrchr(host,'@'))) { *newhost = '\0'; /* make it a null, */ newhost++; /* Now newhost points to the host name and host points to the user name, password combo */ username = host; /* is there a : for a password */ if (NULL != strchr(username,':')) { password = strchr(username,':'); *password = '\0'; password++; } } else { newhost = host; } for (ii = 0; ii < 10; ii++) { /* make up to 10 attempts to log in */ /* Connect to the host on the required port */ sock = NET_TcpConnect(newhost,port); /* convert it to a stdio file */ if (NULL == (command = fdopen(sock,"r"))) { ffpmsg ("Failed to convert socket to stdio file (ftp_file_exist)"); return 0; } /* Wait for the 220 response */ if (ftp_status(command,"220")) { ffpmsg ("error connecting to remote server, no 220 seen (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); /* ffpmsg("sleeping for 5 in ftp_file_exist, then try again"); */ sleep (5); /* take a nap and hope ftp server sorts itself out in the meantime */ } else { tryingtologin = 0; break; } } if (tryingtologin) { /* the 10 attempts were not successful */ ffpmsg ("error connecting to remote server, no 220 seen (ftp_open_network)"); return (0); } /* Send the user name and wait for the right response */ snprintf(tmpstr,MAXLEN,"USER %s\r\n",username); status = NET_SendRaw(sock,tmpstr,strlen(tmpstr),NET_DEFAULT); /* If command is refused due to the connection requiring SSL (ie. an fpts connection), this is where it will first be detected by way of a 550 error code. */ status = ftp_status(command,"331 "); if (status == 550) { ffpmsg ("Server is requesting SSL, will switch to ftps (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return -1; } else if (status) { ffpmsg ("USER error no 331 seen (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } /* Send the password and wait for the right response */ snprintf(tmpstr,MAXLEN,"PASS %s\r\n",password); status = NET_SendRaw(sock,tmpstr,strlen(tmpstr),NET_DEFAULT); if (ftp_status(command,"230 ")) { ffpmsg ("PASS error, no 230 seen (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } /* now do the cwd command */ newfn = strrchr(fn,'/'); if (newfn == NULL) { strcpy(tmpstr,"CWD /\r\n"); newfn = fn; } else { *newfn = '\0'; newfn++; if (strlen(fn) == 0) { strcpy(tmpstr,"CWD /\r\n"); } else { /* remove the leading slash */ if (fn[0] == '/') { snprintf(tmpstr,MAXLEN,"CWD %s\r\n",&fn[1]); } else { snprintf(tmpstr,MAXLEN,"CWD %s\r\n",fn); } } } status = NET_SendRaw(sock,tmpstr,strlen(tmpstr),NET_DEFAULT); if (ftp_status(command,"250 ")) { ffpmsg ("CWD error, no 250 seen (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } if (!strlen(newfn)) { ffpmsg("Null file name (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } /* Always use binary mode */ snprintf(tmpstr,MAXLEN,"TYPE I\r\n"); status = NET_SendRaw(sock,tmpstr,strlen(tmpstr),NET_DEFAULT); if (ftp_status(command,"200 ")) { ffpmsg ("TYPE I error, 200 not seen (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } status = NET_SendRaw(sock,"PASV\r\n",6,NET_DEFAULT); if (!(fgets(recbuf,MAXLEN,command))) { ffpmsg ("PASV error (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } /* Passive mode response looks like 227 Entering Passive Mode (129,194,67,8,210,80) */ if (recbuf[0] == '2' && recbuf[1] == '2' && recbuf[2] == '7') { /* got a good passive mode response, find the opening ( */ if (!(passive = strchr(recbuf,'('))) { ffpmsg ("PASV error (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } *passive = '\0'; passive++; ip[0] = '\0'; /* Messy parsing of response from PASV command */ if (!(tstr = ffstrtok(passive,",)",&saveptr))) { ffpmsg ("PASV error (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } strcpy(ip,tstr); strcat(ip,"."); if (!(tstr = ffstrtok(NULL,",)",&saveptr))) { ffpmsg ("PASV error (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } strcat(ip,tstr); strcat(ip,"."); if (!(tstr = ffstrtok(NULL,",)",&saveptr))) { ffpmsg ("PASV error (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } strcat(ip,tstr); strcat(ip,"."); if (!(tstr = ffstrtok(NULL,",)",&saveptr))) { ffpmsg ("PASV error (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } strcat(ip,tstr); /* Done the ip number, now do the port # */ if (!(tstr = ffstrtok(NULL,",)",&saveptr))) { ffpmsg ("PASV error (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } sscanf(tstr,"%d",&port); port *= 256; if (!(tstr = ffstrtok(NULL,",)",&saveptr))) { ffpmsg ("PASV error (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } sscanf(tstr,"%d",&tmpint); port += tmpint; if (!strlen(newfn)) { ffpmsg("Null file name (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } /* Connect to the data port */ sock1 = NET_TcpConnect(ip,port); if (NULL == (ftpfile = fdopen(sock1,"r"))) { ffpmsg ("Could not connect to passive port (ftp_file_exist)"); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } /* Send the retrieve command */ snprintf(tmpstr,MAXLEN,"RETR %s\r\n",newfn); status = NET_SendRaw(sock,tmpstr,strlen(tmpstr),NET_DEFAULT); if (ftp_status(command,"150 ")) { fclose(ftpfile); NET_SendRaw(sock1,"QUIT\r\n",6,NET_DEFAULT); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } /* if we got here then the file probably exists */ fclose(ftpfile); NET_SendRaw(sock1,"QUIT\r\n",6,NET_DEFAULT); fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 1; } /* no passive mode */ fclose(command); NET_SendRaw(sock,"QUIT\r\n",6,NET_DEFAULT); return 0; } /*--------------------------------------------------------------------------*/ /* return a socket which results from connection to hostname on port port */ int NET_TcpConnect(char *hostname, int port) { /* Connect to hostname on port */ struct sockaddr_in sockaddr; int sock; int stat; int val = 1; CreateSocketAddress(&sockaddr,hostname,port); /* Create socket */ if ((sock = socket(AF_INET, SOCK_STREAM, 0)) < 0) { ffpmsg("ERROR: NET_TcpConnect can't create socket"); return CONNECTION_ERROR; } if ((stat = connect(sock, (struct sockaddr*) &sockaddr, sizeof(sockaddr))) < 0) { close(sock); /* perror("NET_Tcpconnect - Connection error"); ffpmsg("Can't connect to host, connection error"); */ return CONNECTION_ERROR; } setsockopt(sock, IPPROTO_TCP, TCP_NODELAY, (char *)&val, sizeof(val)); setsockopt(sock, SOL_SOCKET, SO_KEEPALIVE, (char *)&val, sizeof(val)); val = 65536; setsockopt(sock, SOL_SOCKET, SO_SNDBUF, (char *)&val, sizeof(val)); setsockopt(sock, SOL_SOCKET, SO_RCVBUF, (char *)&val, sizeof(val)); return sock; } /*--------------------------------------------------------------------------*/ /* Write len bytes from buffer to socket sock */ static int NET_SendRaw(int sock, const void *buffer, int length, int opt) { char * buf = (char *) buffer; int flag; int n, nsent = 0; switch (opt) { case NET_DEFAULT: flag = 0; break; case NET_OOB: flag = MSG_OOB; break; case NET_PEEK: default: flag = 0; break; } if (sock < 0) return -1; for (n = 0; n < length; n += nsent) { if ((nsent = send(sock, buf+n, length-n, flag)) <= 0) { return nsent; } } return n; } /*--------------------------------------------------------------------------*/ static int NET_RecvRaw(int sock, void *buffer, int length) { /* Receive exactly length bytes into buffer. Returns number of bytes */ /* received. Returns -1 in case of error. */ int nrecv, n; char *buf = (char *)buffer; if (sock < 0) return -1; for (n = 0; n < length; n += nrecv) { while ((nrecv = recv(sock, buf+n, length-n, 0)) == -1 && errno == EINTR) errno = 0; /* probably a SIGCLD that was caught */ if (nrecv < 0) return nrecv; else if (nrecv == 0) break; /*/ EOF */ } return n; } /*--------------------------------------------------------------------------*/ /* Yet Another URL Parser url - input url proto - input protocol host - output host port - output port fn - output filename */ static int NET_ParseUrl(const char *url, char *proto, char *host, int *port, char *fn) { /* parses urls into their bits */ /* returns 1 if error, else 0 */ char *urlcopy, *urlcopyorig; char *ptrstr; char *thost; int isftp = 0; /* figure out if there is a http: or ftp: */ urlcopyorig = urlcopy = (char *) malloc(strlen(url)+1); strcpy(urlcopy,url); /* set some defaults */ *port = 80; strcpy(proto,"http:"); strcpy(host,"localhost"); strcpy(fn,"/"); ptrstr = strstr(urlcopy,"http:"); if (ptrstr == NULL) { /* Nope, not http: */ ptrstr = strstr(urlcopy,"root:"); if (ptrstr == NULL) { /* Nope, not root either */ ptrstr = strstr(urlcopy,"ftp:"); if (ptrstr != NULL) { if (ptrstr == urlcopy) { strcpy(proto,"ftp:"); *port = 21; isftp++; urlcopy += 4; /* move past ftp: */ } else { /* not at the beginning, bad url */ free(urlcopyorig); return 1; } } } else { if (ptrstr == urlcopy) { urlcopy += 5; /* move past root: */ } else { /* not at the beginning, bad url */ free(urlcopyorig); return 1; } } } else { if (ptrstr == urlcopy) { urlcopy += 5; /* move past http: */ } else { free(urlcopyorig); return 1; } } /* got the protocol */ /* get the hostname */ if (urlcopy[0] == '/' && urlcopy[1] == '/') { /* we have a hostname */ urlcopy += 2; /* move past the // */ } /* do this only if http */ if (!strcmp(proto,"http:")) { /* Move past any user:password */ if ((thost = strchr(urlcopy, '@')) != NULL) urlcopy = thost+1; if (strlen(urlcopy) > SHORTLEN-1) { free(urlcopyorig); return 1; } strcpy(host,urlcopy); thost = host; while (*urlcopy != '/' && *urlcopy != ':' && *urlcopy) { thost++; urlcopy++; } /* we should either be at the end of the string, have a /, or have a : */ *thost = '\0'; if (*urlcopy == ':') { /* follows a port number */ urlcopy++; sscanf(urlcopy,"%d",port); while (*urlcopy != '/' && *urlcopy) urlcopy++; /* step to the */ } } else { /* do this for ftp */ if (strlen(urlcopy) > SHORTLEN-1) { free(urlcopyorig); return 1; } strcpy(host,urlcopy); thost = host; while (*urlcopy != '/' && *urlcopy) { thost++; urlcopy++; } *thost = '\0'; /* Now, we should either be at the end of the string, or have a / */ } /* Now the rest is a fn */ if (*urlcopy) { if (strlen(urlcopy) > MAXLEN-1) { free(urlcopyorig); return 1; } strcpy(fn,urlcopy); } free(urlcopyorig); return 0; } /*--------------------------------------------------------------------------*/ int http_checkfile (char *urltype, char *infile, char *outfile1) { /* Small helper functions to set the netoutfile static string */ /* Called by cfileio after parsing the output file off of the input file url */ char newinfile[MAXLEN]; FILE *httpfile=0; char contentencoding[MAXLEN]; int contentlength; int foundfile = 0; int status=0; /* set defaults */ strcpy(urltype,"http://"); if (strlen(outfile1)) { /* don't copy the "file://" prefix, if present. */ if (!strncmp(outfile1, "file://", 7) ) { strcpy(netoutfile,outfile1+7); } else { strcpy(netoutfile,outfile1); } } if (strstr(infile, "?")) { /* Special case where infile name contains a "?". */ /* This is probably a CGI string; no point in testing if it exists */ /* so just set urltype and netoutfile if necessary, then return */ if (strlen(outfile1)) { /* was an outfile specified? */ strcpy(urltype,"httpfile://"); /* don't copy the "file://" prefix, if present. */ if (!strncmp(outfile1, "file://", 7) ) { strcpy(netoutfile,outfile1+7); } else { strcpy(netoutfile,outfile1); } } return 0; /* case where infile name contains "?" */ } /* If the specified infile file name does not contain a .gz or .Z suffix, then first test if a .gz compressed version of the file exists, and if not then test if a .Z version of the file exists. (because it will be much faster to read the compressed file). If the compressed files do not exist, then finally just open the infile name exactly as specified. */ if (!strstr(infile,".gz") && (!strstr(infile,".Z"))) { /* The infile string does not contain the name of a compressed file. */ /* Fisrt, look for a .gz compressed version of the file. */ if (strlen(infile) + 3 > MAXLEN-1) { return URL_PARSE_ERROR; } strcpy(newinfile,infile); strcat(newinfile,".gz"); status = http_open_network(newinfile,&httpfile,contentencoding, &contentlength); if (!status) { if (!strcmp(contentencoding, "ftp://")) { /* this is a signal from http_open_network that indicates that */ /* the http server returned a 301 or 302 redirect to a FTP URL. */ /* Check that the file exists, because redirect many not be reliable */ if (ftp_file_exist(newinfile)>0) { /* The ftp .gz compressed file is there, all is good! */ strcpy(urltype, "ftp://"); if (strlen(newinfile) > FLEN_FILENAME-1) { return URL_PARSE_ERROR; } strcpy(infile,newinfile); if (strlen(outfile1)) { /* there is an output file; might need to modify the urltype */ if (!strncmp(outfile1, "mem:", 4) ) { /* copy the file to memory, with READ and WRITE access In this case, it makes no difference whether the ftp file and or the output file are compressed or not. */ strcpy(urltype, "ftpmem://"); /* use special driver */ } else { /* input file is compressed */ if (strstr(outfile1,".gz") || (strstr(outfile1,".Z"))) { strcpy(urltype,"ftpcompress://"); } else { strcpy(urltype,"ftpfile://"); } } } return 0; /* found the .gz compressed ftp file */ } /* fall through to here if ftp redirect does not exist */ } else if (!strcmp(contentencoding, "https://")) { /* the http server returned a 301 or 302 redirect to an HTTPS URL. */ https_checkfile(urltype, infile, outfile1); /* For https we're not testing for compressed extensions at this stage. It will all be done in https_open_network. Therefore leave infile alone and do immediate return. */ return 0; } else { /* found the http .gz compressed file */ if (httpfile) fclose(httpfile); foundfile = 1; if (strlen(newinfile) > FLEN_FILENAME-1) { return URL_PARSE_ERROR; } strcpy(infile,newinfile); } } else if (status != FILE_NOT_OPENED) { /* Some other error occured aside from not finding file, such as a url parsing error. Don't continue trying with other extensions. */ return status; } if (!foundfile) { /* did not find .gz compressed version of the file, so look for .Z file. */ if (strlen(infile+2) > MAXLEN-1) { return URL_PARSE_ERROR; } strcpy(newinfile,infile); strcat(newinfile,".Z"); if (!http_open_network(newinfile,&httpfile,contentencoding, &contentlength)) { if (!strcmp(contentencoding, "ftp://")) { /* this is a signal from http_open_network that indicates that */ /* the http server returned a 301 or 302 redirect to a FTP URL. */ /* Check that the file exists, because redirect many not be reliable */ if (ftp_file_exist(newinfile)>0) { /* The ftp .Z compressed file is there, all is good! */ strcpy(urltype, "ftp://"); if (strlen(newinfile) > FLEN_FILENAME-1) { return URL_PARSE_ERROR; } strcpy(infile,newinfile); if (strlen(outfile1)) { /* there is an output file; might need to modify the urltype */ if (!strncmp(outfile1, "mem:", 4) ) { /* copy the file to memory, with READ and WRITE access In this case, it makes no difference whether the ftp file and or the output file are compressed or not. */ strcpy(urltype, "ftpmem://"); /* use special driver */ } else { /* input file is compressed */ if (strstr(outfile1,".gz") || (strstr(outfile1,".Z"))) { strcpy(urltype,"ftpcompress://"); } else { strcpy(urltype,"ftpfile://"); } } } return 0; /* found the .Z compressed ftp file */ } /* fall through to here if ftp redirect does not exist */ } else { /* found the http .Z compressed file */ if (httpfile) fclose(httpfile); foundfile = 1; if (strlen(newinfile) > FLEN_FILENAME-1) { return URL_PARSE_ERROR; } strcpy(infile,newinfile); } } } } /* end of case where infile does not contain .gz or .Z */ if (!foundfile) { /* look for the base file.name */ strcpy(newinfile,infile); if (!http_open_network(newinfile,&httpfile,contentencoding, &contentlength)) { if (!strcmp(contentencoding, "ftp://")) { /* this is a signal from http_open_network that indicates that */ /* the http server returned a 301 or 302 redirect to a FTP URL. */ /* Check that the file exists, because redirect many not be reliable */ if (ftp_file_exist(newinfile)>0) { /* The ftp file is there, all is good! */ strcpy(urltype, "ftp://"); if (strlen(newinfile) > FLEN_FILENAME-1) { return URL_PARSE_ERROR; } strcpy(infile,newinfile); if (strlen(outfile1)) { /* there is an output file; might need to modify the urltype */ if (!strncmp(outfile1, "mem:", 4) ) { /* copy the file to memory, with READ and WRITE access In this case, it makes no difference whether the ftp file and or the output file are compressed or not. */ strcpy(urltype, "ftpmem://"); /* use special driver */ return 0; } else { /* input file is not compressed */ strcpy(urltype,"ftpfile://"); } } return 0; /* found the ftp file */ } /* fall through to here if ftp redirect does not exist */ } else if (!strcmp(contentencoding, "https://")) { /* the http server returned a 301 or 302 redirect to an HTTPS URL. */ https_checkfile(urltype, infile, outfile1); /* For https we're not testing for compressed extensions at this stage. It will all be done in https_open_network. Therefore leave infile alone and do immediate return. */ return 0; } else { /* found the base named file */ if (httpfile) fclose(httpfile); foundfile = 1; if (strlen(newinfile) > FLEN_FILENAME-1) { return URL_PARSE_ERROR; } strcpy(infile,newinfile); } } } if (!foundfile) { return (FILE_NOT_OPENED); } if (strlen(outfile1)) { /* there is an output file */ if (!strncmp(outfile1, "mem:", 4) ) { /* copy the file to memory, with READ and WRITE access In this case, it makes no difference whether the http file and or the output file are compressed or not. */ strcpy(urltype, "httpmem://"); /* use special driver */ return 0; } if (strstr(infile, "?")) { /* file name contains a '?' so probably a cgi string; */ strcpy(urltype,"httpfile://"); return 0; } if (strstr(infile,".gz") || (strstr(infile,".Z"))) { /* It's compressed */ if (strstr(outfile1,".gz") || (strstr(outfile1,".Z"))) { strcpy(urltype,"httpcompress://"); } else { strcpy(urltype,"httpfile://"); } } else { strcpy(urltype,"httpfile://"); } } return 0; } /*--------------------------------------------------------------------------*/ int https_checkfile (char *urltype, char *infile, char *outfile1) { /* set default */ strcpy(urltype,"https://"); if (strlen(outfile1)) { /* don't copy the "file://" prefix, if present. */ if (!strncmp(outfile1, "file://", 7) ) { strcpy(netoutfile,outfile1+7); } else { strcpy(netoutfile,outfile1); } if (!strncmp(outfile1, "mem:", 4)) strcpy(urltype,"httpsmem://"); else strcpy(urltype,"httpsfile://"); } return 0; } /*--------------------------------------------------------------------------*/ int ftps_checkfile (char *urltype, char *infile, char *outfile1) { strcpy(urltype,"ftps://"); if (strlen(outfile1)) { /* don't copy the "file://" prefix, if present. */ if (!strncmp(outfile1, "file://", 7) ) { strcpy(netoutfile,outfile1+7); } else { strcpy(netoutfile,outfile1); } if (!strncmp(outfile1, "mem:", 4)) strcpy(urltype,"ftpsmem://"); else { if (strstr(outfile1,".gz") || strstr(outfile1,".Z")) { /* Note that for Curl dependent handlers, we can't check at this point if infile will have a .gz or .Z appended. If it does not, the ftpscompress 'open' handler will fail.*/ strcpy(urltype,"ftpscompress://"); } else strcpy(urltype,"ftpsfile://"); } } return 0; } /*--------------------------------------------------------------------------*/ int ftp_checkfile (char *urltype, char *infile, char *outfile1) { char newinfile[MAXLEN]; FILE *ftpfile; FILE *command; int sock; int foundfile = 0; int status=0; /* Small helper functions to set the netoutfile static string */ /* default to ftp:// if no outfile specified */ strcpy(urltype,"ftp://"); if (!strstr(infile,".gz") && (!strstr(infile,".Z"))) { /* The infile string does not contain the name of a compressed file. */ /* Fisrt, look for a .gz compressed version of the file. */ if (strlen(infile)+3 > MAXLEN-1) { return URL_PARSE_ERROR; } strcpy(newinfile,infile); strcat(newinfile,".gz"); /* look for .gz version of the file */ status = ftp_file_exist(newinfile); if (status > 0) { foundfile = 1; if (strlen(newinfile) > FLEN_FILENAME-1) return URL_PARSE_ERROR; strcpy(infile,newinfile); } else if (status < 0) { /* Server is demanding an SSL connection. Change urltype and exit. */ ftps_checkfile(urltype, infile, outfile1); return 0; } if (!foundfile) { if (strlen(infile)+2 > MAXLEN-1) { return URL_PARSE_ERROR; } strcpy(newinfile,infile); strcat(newinfile,".Z"); /* look for .Z version of the file */ if (ftp_file_exist(newinfile)) { foundfile = 1; if (strlen(newinfile) > FLEN_FILENAME-1) return URL_PARSE_ERROR; strcpy(infile,newinfile); } } } if (!foundfile) { strcpy(newinfile,infile); /* look for the base file */ status = ftp_file_exist(newinfile); if (status > 0) { foundfile = 1; if (strlen(newinfile) > FLEN_FILENAME-1) return URL_PARSE_ERROR; strcpy(infile,newinfile); } else if (status < 0) { /* Server is demanding an SSL connection. Change urltype and exit. */ ftps_checkfile(urltype, infile, outfile1); return 0; } } if (!foundfile) { return (FILE_NOT_OPENED); } if (strlen(outfile1)) { /* there is an output file; might need to modify the urltype */ /* don't copy the "file://" prefix, if present. */ if (!strncmp(outfile1, "file://", 7) ) strcpy(netoutfile,outfile1+7); else strcpy(netoutfile,outfile1); if (!strncmp(outfile1, "mem:", 4) ) { /* copy the file to memory, with READ and WRITE access In this case, it makes no difference whether the ftp file and or the output file are compressed or not. */ strcpy(urltype, "ftpmem://"); /* use special driver */ return 0; } if (strstr(infile,".gz") || (strstr(infile,".Z"))) { /* input file is compressed */ if (strstr(outfile1,".gz") || (strstr(outfile1,".Z"))) { strcpy(urltype,"ftpcompress://"); } else { strcpy(urltype,"ftpfile://"); } } else { strcpy(urltype,"ftpfile://"); } } return 0; } /*--------------------------------------------------------------------------*/ /* A small helper function to wait for a particular status on the ftp connectino */ static int ftp_status(FILE *ftp, char *statusstr) { /* read through until we find a string beginning with statusstr */ /* This needs a timeout */ /* Modified 2/19 to return the numerical value of the returned status when it differs from the requested status. */ char recbuf[MAXLEN], errorstr[SHORTLEN]; int len, ftpcode=0; len = strlen(statusstr); while (1) { if (!(fgets(recbuf,MAXLEN,ftp))) { snprintf(errorstr,SHORTLEN,"ERROR: ftp_status wants %s but fgets returned 0",statusstr); ffpmsg(errorstr); return 1; /* error reading */ } recbuf[len] = '\0'; /* make it short */ if (!strcmp(recbuf,statusstr)) { return 0; /* we're ok */ } if (recbuf[0] > '3') { /* oh well, some sort of error. */ snprintf(errorstr,SHORTLEN,"ERROR ftp_status wants %s but got %s", statusstr, recbuf); ffpmsg(errorstr); /* Return the numerical code, if string can be converted to int. But must not return 0 from here. */ ftpcode = atoi(recbuf); return ftpcode ? ftpcode : 1; } snprintf(errorstr,SHORTLEN,"ERROR ftp_status wants %s but got unexpected %s", statusstr, recbuf); ffpmsg(errorstr); } } /* *---------------------------------------------------------------------- * * CreateSocketAddress -- * * This function initializes a sockaddr structure for a host and port. * * Results: * 1 if the host was valid, 0 if the host could not be converted to * an IP address. * * Side effects: * Fills in the *sockaddrPtr structure. * *---------------------------------------------------------------------- */ static int CreateSocketAddress( struct sockaddr_in *sockaddrPtr, /* Socket address */ char *host, /* Host. NULL implies INADDR_ANY */ int port) /* Port number */ { struct hostent *hostent; /* Host database entry */ struct in_addr addr; /* For 64/32 bit madness */ char localhost[MAXLEN]; strcpy(localhost,host); memset((void *) sockaddrPtr, '\0', sizeof(struct sockaddr_in)); sockaddrPtr->sin_family = AF_INET; sockaddrPtr->sin_port = htons((unsigned short) (port & 0xFFFF)); if (host == NULL) { addr.s_addr = INADDR_ANY; } else { addr.s_addr = inet_addr(localhost); if (addr.s_addr == 0xFFFFFFFF) { hostent = gethostbyname(localhost); if (hostent != NULL) { memcpy((void *) &addr, (void *) hostent->h_addr_list[0], (size_t) hostent->h_length); } else { #ifdef EHOSTUNREACH errno = EHOSTUNREACH; #else #ifdef ENXIO errno = ENXIO; #endif #endif return 0; /* error */ } } } /* * NOTE: On 64 bit machines the assignment below is rumored to not * do the right thing. Please report errors related to this if you * observe incorrect behavior on 64 bit machines such as DEC Alphas. * Should we modify this code to do an explicit memcpy? */ sockaddrPtr->sin_addr.s_addr = addr.s_addr; return 1; /* Success. */ } /* Signal handler for timeouts */ static void signal_handler(int sig) { switch (sig) { case SIGALRM: /* process for alarm */ longjmp(env,sig); default: { /* Hmm, shouldn't have happend */ exit(sig); } } } /**************************************************************/ /* Root driver */ /*--------------------------------------------------------------------------*/ int root_init(void) { int ii; for (ii = 0; ii < NMAXFILES; ii++) /* initialize all empty slots in table */ { handleTable[ii].sock = 0; handleTable[ii].currentpos = 0; } return(0); } /*--------------------------------------------------------------------------*/ int root_setoptions(int options) { /* do something with the options argument, to stop compiler warning */ options = 0; return(options); } /*--------------------------------------------------------------------------*/ int root_getoptions(int *options) { *options = 0; return(0); } /*--------------------------------------------------------------------------*/ int root_getversion(int *version) { *version = 10; return(0); } /*--------------------------------------------------------------------------*/ int root_shutdown(void) { return(0); } /*--------------------------------------------------------------------------*/ int root_open(char *url, int rwmode, int *handle) { int ii, status; int sock; *handle = -1; for (ii = 0; ii < NMAXFILES; ii++) /* find empty slot in table */ { if (handleTable[ii].sock == 0) { *handle = ii; break; } } if (*handle == -1) return(TOO_MANY_FILES); /* too many files opened */ /*open the file */ if (rwmode) { status = root_openfile(url, "update", &sock); } else { status = root_openfile(url, "read", &sock); } if (status) return(status); handleTable[ii].sock = sock; handleTable[ii].currentpos = 0; return(0); } /*--------------------------------------------------------------------------*/ int root_create(char *filename, int *handle) { int ii, status; int sock; *handle = -1; for (ii = 0; ii < NMAXFILES; ii++) /* find empty slot in table */ { if (handleTable[ii].sock == 0) { *handle = ii; break; } } if (*handle == -1) return(TOO_MANY_FILES); /* too many files opened */ /*open the file */ status = root_openfile(filename, "create", &sock); if (status) { ffpmsg("Unable to create file"); return(status); } handleTable[ii].sock = sock; handleTable[ii].currentpos = 0; return(0); } /*--------------------------------------------------------------------------*/ int root_size(int handle, LONGLONG *filesize) /* return the size of the file in bytes */ { int sock; int offset; int status; int op; sock = handleTable[handle].sock; status = root_send_buffer(sock,ROOTD_STAT,NULL,0); status = root_recv_buffer(sock,&op,(char *)&offset, 4); *filesize = (LONGLONG) ntohl(offset); return(0); } /*--------------------------------------------------------------------------*/ int root_close(int handle) /* close the file */ { int status; int sock; sock = handleTable[handle].sock; status = root_send_buffer(sock,ROOTD_CLOSE,NULL,0); close(sock); handleTable[handle].sock = 0; return(0); } /*--------------------------------------------------------------------------*/ int root_flush(int handle) /* flush the file */ { int status; int sock; sock = handleTable[handle].sock; status = root_send_buffer(sock,ROOTD_FLUSH,NULL,0); return(0); } /*--------------------------------------------------------------------------*/ int root_seek(int handle, LONGLONG offset) /* seek to position relative to start of the file */ { handleTable[handle].currentpos = offset; return(0); } /*--------------------------------------------------------------------------*/ int root_read(int hdl, void *buffer, long nbytes) /* read bytes from the current position in the file */ { char msg[SHORTLEN]; int op; int status; int astat; /* we presume here that the file position will never be > 2**31 = 2.1GB */ snprintf(msg,SHORTLEN,"%ld %ld ",(long) handleTable[hdl].currentpos,nbytes); status = root_send_buffer(handleTable[hdl].sock,ROOTD_GET,msg,strlen(msg)); if ((unsigned) status != strlen(msg)) { return (READ_ERROR); } astat = 0; status = root_recv_buffer(handleTable[hdl].sock,&op,(char *) &astat,4); if (astat != 0) { return (READ_ERROR); } status = NET_RecvRaw(handleTable[hdl].sock,buffer,nbytes); if (status != nbytes) { return (READ_ERROR); } handleTable[hdl].currentpos += nbytes; return(0); } /*--------------------------------------------------------------------------*/ int root_write(int hdl, void *buffer, long nbytes) /* write bytes at the current position in the file */ { char msg[SHORTLEN]; int len; int sock; int status; int astat; int op; sock = handleTable[hdl].sock; /* we presume here that the file position will never be > 2**31 = 2.1GB */ snprintf(msg,SHORTLEN,"%ld %ld ",(long) handleTable[hdl].currentpos,nbytes); len = strlen(msg); status = root_send_buffer(sock,ROOTD_PUT,msg,len+1); if (status != len+1) { return (WRITE_ERROR); } status = NET_SendRaw(sock,buffer,nbytes,NET_DEFAULT); if (status != nbytes) { return (WRITE_ERROR); } astat = 0; status = root_recv_buffer(handleTable[hdl].sock,&op,(char *) &astat,4); if (astat != 0) { return (WRITE_ERROR); } handleTable[hdl].currentpos += nbytes; return(0); } /*--------------------------------------------------------------------------*/ int root_openfile(char *url, char *rwmode, int *sock) /* lowest level routine to physically open a root file */ { int status; char recbuf[MAXLEN]; char errorstr[MAXLEN]; char proto[SHORTLEN]; char host[SHORTLEN]; char fn[MAXLEN]; char turl[MAXLEN]; int port; int op; int ii; int authstat; /* Parse the URL apart again */ if (strlen(url)+7 > MAXLEN-1) { ffpmsg("Error: url too long"); return(FILE_NOT_OPENED); } strcpy(turl,"root://"); strcat(turl,url); if (NET_ParseUrl(turl,proto,host,&port,fn)) { snprintf(errorstr,MAXLEN,"URL Parse Error (root_open) %s",url); ffpmsg(errorstr); return (FILE_NOT_OPENED); } /* Connect to the remote host */ *sock = NET_TcpConnect(host,port); if (*sock < 0) { ffpmsg("Couldn't connect to host (root_openfile)"); return (FILE_NOT_OPENED); } /* get the username */ if (NULL != getenv("ROOTUSERNAME")) { if (strlen(getenv("ROOTUSERNAME")) > MAXLEN-1) { ffpmsg("root user name too long (root_openfile)"); return (FILE_NOT_OPENED); } strcpy(recbuf,getenv("ROOTUSERNAME")); } else { printf("Username: "); fgets(recbuf,MAXLEN,stdin); recbuf[strlen(recbuf)-1] = '\0'; } status = root_send_buffer(*sock, ROOTD_USER, recbuf,strlen(recbuf)); if (status < 0) { ffpmsg("error talking to remote system on username "); return (FILE_NOT_OPENED); } status = root_recv_buffer(*sock,&op,(char *)&authstat,4); if (!status) { ffpmsg("error talking to remote system on username"); return (FILE_NOT_OPENED); } if (op != ROOTD_AUTH) { ffpmsg("ERROR on ROOTD_USER"); ffpmsg(recbuf); return (FILE_NOT_OPENED); } /* now the password */ if (NULL != getenv("ROOTPASSWORD")) { if (strlen(getenv("ROOTPASSWORD")) > MAXLEN-1) { ffpmsg("root password too long (root_openfile)"); return (FILE_NOT_OPENED); } strcpy(recbuf,getenv("ROOTPASSWORD")); } else { printf("Password: "); fgets(recbuf,MAXLEN,stdin); recbuf[strlen(recbuf)-1] = '\0'; } /* ones complement the password */ for (ii=0;(unsigned) ii MAXLEN-1) { ffpmsg("root file name too long (root_openfile)"); return (FILE_NOT_OPENED); } strcpy(recbuf,fn); strcat(recbuf," "); strcat(recbuf,rwmode); status = root_send_buffer(*sock, ROOTD_OPEN, recbuf, strlen(recbuf)); if (status < 0) { ffpmsg("error talking to remote system on open "); return (FILE_NOT_OPENED); } status = root_recv_buffer(*sock,&op,(char *)&authstat,4); if (status < 0) { ffpmsg("error talking to remote system on open"); return (FILE_NOT_OPENED); } if ((op != ROOTD_OPEN) && (authstat != 0)) { ffpmsg("ERROR on ROOTD_OPEN"); ffpmsg(recbuf); return (FILE_NOT_OPENED); } return 0; } static int root_send_buffer(int sock, int op, char *buffer, int buflen) { /* send a buffer, the form is includes the 4 bytes for the op, the length bytes (4) are implicit if buffer is null don't send it, not everything needs something sent */ int len; int status; int hdr[2]; len = 4; if (buffer != NULL) { len += buflen; } hdr[0] = htonl(len); hdr[1] = htonl(op); status = NET_SendRaw(sock,hdr,sizeof(hdr),NET_DEFAULT); if (status < 0) { return status; } if (buffer != NULL) { status = NET_SendRaw(sock,buffer,buflen,NET_DEFAULT); } return status; } static int root_recv_buffer(int sock, int *op, char *buffer, int buflen) { /* recv a buffer, the form is */ int recv1 = 0; int len; int status; char recbuf[MAXLEN]; status = NET_RecvRaw(sock,&len,4); if (status < 0) { return status; } recv1 += status; len = ntohl(len); /* ok, have the length, recive the operation */ len -= 4; status = NET_RecvRaw(sock,op,4); if (status < 0) { return status; } recv1 += status; *op = ntohl(*op); if (len > MAXLEN) { len = MAXLEN; } if (len > 0) { /* Get the rest of the message */ status = NET_RecvRaw(sock,recbuf,len); if (len > buflen) { len = buflen; } memcpy(buffer,recbuf,len); if (status < 0) { return status; } } recv1 += status; return recv1; } /*****************************************************************************/ /* Encode a string into MIME Base64 format string */ static int encode64(unsigned s_len, char *src, unsigned d_len, char *dst) { static char base64[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" "abcdefghijklmnopqrstuvwxyz" "0123456789" "+/"; unsigned triad; for (triad = 0; triad < s_len; triad += 3) { unsigned long int sr; unsigned byte; for (byte = 0; (byte<3) && (triad+byte #include #include #include #include #include #include #if defined(unix) || defined(__unix__) || defined(__unix) || defined(HAVE_UNISTD_H) #include #endif static int shared_kbase = 0; /* base for shared memory handles */ static int shared_maxseg = 0; /* max number of shared memory blocks */ static int shared_range = 0; /* max number of tried entries */ static int shared_fd = SHARED_INVALID; /* handle of global access lock file */ static int shared_gt_h = SHARED_INVALID; /* handle of global table segment */ static SHARED_LTAB *shared_lt = NULL; /* local table pointer */ static SHARED_GTAB *shared_gt = NULL; /* global table pointer */ static int shared_create_mode = 0666; /* permission flags for created objects */ static int shared_debug = 1; /* simple debugging tool, set to 0 to disable messages */ static int shared_init_called = 0; /* flag whether shared_init() has been called, used for delayed init */ /* static support routines prototypes */ static int shared_clear_entry(int idx); /* unconditionally clear entry */ static int shared_destroy_entry(int idx); /* unconditionally destroy sema & shseg and clear entry */ static int shared_mux(int idx, int mode); /* obtain exclusive access to specified segment */ static int shared_demux(int idx, int mode); /* free exclusive access to specified segment */ static int shared_process_count(int sem); /* valid only for time of invocation */ static int shared_delta_process(int sem, int delta); /* change number of processes hanging on segment */ static int shared_attach_process(int sem); static int shared_detach_process(int sem); static int shared_get_free_entry(int newhandle); /* get free entry in shared_key, or -1, entry is set rw locked */ static int shared_get_hash(long size, int idx);/* return hash value for malloc */ static long shared_adjust_size(long size); /* size must be >= 0 !!! */ static int shared_check_locked_index(int idx); /* verify that given idx is valid */ static int shared_map(int idx); /* map all tables for given idx, check for validity */ static int shared_validate(int idx, int mode); /* use intrnally inside crit.sect !!! */ /* support routines - initialization */ static int shared_clear_entry(int idx) /* unconditionally clear entry */ { if ((idx < 0) || (idx >= shared_maxseg)) return(SHARED_BADARG); shared_gt[idx].key = SHARED_INVALID; /* clear entries in global table */ shared_gt[idx].handle = SHARED_INVALID; shared_gt[idx].sem = SHARED_INVALID; shared_gt[idx].semkey = SHARED_INVALID; shared_gt[idx].nprocdebug = 0; shared_gt[idx].size = 0; shared_gt[idx].attr = 0; return(SHARED_OK); } static int shared_destroy_entry(int idx) /* unconditionally destroy sema & shseg and clear entry */ { int r, r2; union semun filler; if ((idx < 0) || (idx >= shared_maxseg)) return(SHARED_BADARG); r2 = r = SHARED_OK; filler.val = 0; /* this is to make cc happy (warning otherwise) */ if (SHARED_INVALID != shared_gt[idx].sem) r = semctl(shared_gt[idx].sem, 0, IPC_RMID, filler); /* destroy semaphore */ if (SHARED_INVALID != shared_gt[idx].handle) r2 = shmctl(shared_gt[idx].handle, IPC_RMID, 0); /* destroy shared memory segment */ if (SHARED_OK == r) r = r2; /* accumulate error code in r, free r2 */ r2 = shared_clear_entry(idx); return((SHARED_OK == r) ? r2 : r); } void shared_cleanup(void) /* this must (should) be called during exit/abort */ { int i, j, r, oktodelete, filelocked, segmentspresent; flock_t flk; struct shmid_ds ds; if (shared_debug) printf("shared_cleanup:"); if (NULL != shared_lt) { if (shared_debug) printf(" deleting segments:"); for (i=0; i>\n"); return; } int shared_init(int debug_msgs) /* initialize shared memory stuff, you have to call this routine once */ { int i; char buf[1000], *p; mode_t oldumask; shared_init_called = 1; /* tell everybody no need to call us for the 2nd time */ shared_debug = debug_msgs; /* set required debug mode */ if (shared_debug) printf("shared_init:"); shared_kbase = 0; /* adapt to current env. settings */ if (NULL != (p = getenv(SHARED_ENV_KEYBASE))) shared_kbase = atoi(p); if (0 == shared_kbase) shared_kbase = SHARED_KEYBASE; if (shared_debug) printf(" keybase=%d", shared_kbase); shared_maxseg = 0; if (NULL != (p = getenv(SHARED_ENV_MAXSEG))) shared_maxseg = atoi(p); if (0 == shared_maxseg) shared_maxseg = SHARED_MAXSEG; if (shared_debug) printf(" maxseg=%d", shared_maxseg); shared_range = 3 * shared_maxseg; if (SHARED_INVALID == shared_fd) /* create rw locking file (this file is never deleted) */ { if (shared_debug) printf(" lockfileinit="); snprintf(buf, 1000,"%s.%d.%d", SHARED_FDNAME, shared_kbase, shared_maxseg); oldumask = umask(0); shared_fd = open(buf, O_TRUNC | O_EXCL | O_CREAT | O_RDWR, shared_create_mode); umask(oldumask); if (SHARED_INVALID == shared_fd) /* or just open rw locking file, in case it already exists */ { shared_fd = open(buf, O_TRUNC | O_RDWR, shared_create_mode); if (SHARED_INVALID == shared_fd) return(SHARED_NOFILE); if (shared_debug) printf("slave"); } else { if (shared_debug) printf("master"); } } if (SHARED_INVALID == shared_gt_h) /* global table not attached, try to create it in shared memory */ { if (shared_debug) printf(" globalsharedtableinit="); shared_gt_h = shmget(shared_kbase, shared_maxseg * sizeof(SHARED_GTAB), IPC_CREAT | IPC_EXCL | shared_create_mode); /* try open as a master */ if (SHARED_INVALID == shared_gt_h) /* if failed, try to open as a slave */ { shared_gt_h = shmget(shared_kbase, shared_maxseg * sizeof(SHARED_GTAB), shared_create_mode); if (SHARED_INVALID == shared_gt_h) return(SHARED_IPCERR); /* means deleted ID residing in system, shared mem unusable ... */ shared_gt = (SHARED_GTAB *)shmat(shared_gt_h, 0, 0); /* attach segment */ if (((SHARED_GTAB *)SHARED_INVALID) == shared_gt) return(SHARED_IPCERR); if (shared_debug) printf("slave"); } else { shared_gt = (SHARED_GTAB *)shmat(shared_gt_h, 0, 0); /* attach segment */ if (((SHARED_GTAB *)SHARED_INVALID) == shared_gt) return(SHARED_IPCERR); for (i=0; i>\n"); return(SHARED_OK); } int shared_recover(int id) /* try to recover dormant segments after applic crash */ { int i, r, r2; if (NULL == shared_gt) return(SHARED_NOTINIT); /* not initialized */ if (NULL == shared_lt) return(SHARED_NOTINIT); /* not initialized */ r = SHARED_OK; for (i=0; i r2) || (0 == r2)) { if (shared_debug) printf("Bogus handle=%d nproc=%d sema=%d:", i, shared_gt[i].nprocdebug, r2); r = shared_destroy_entry(i); if (shared_debug) { printf("%s", r ? "error couldn't clear handle" : "handle cleared"); } } shared_demux(i, SHARED_RDWRITE); } return(r); /* table full */ } /* API routines - mutexes and locking */ static int shared_mux(int idx, int mode) /* obtain exclusive access to specified segment */ { flock_t flk; int r; if (0 == shared_init_called) /* delayed initialization */ { if (SHARED_OK != (r = shared_init(0))) return(r); } if (SHARED_INVALID == shared_fd) return(SHARED_NOTINIT); if ((idx < 0) || (idx >= shared_maxseg)) return(SHARED_BADARG); flk.l_type = ((mode & SHARED_RDWRITE) ? F_WRLCK : F_RDLCK); flk.l_whence = 0; flk.l_start = idx; flk.l_len = 1; if (shared_debug) printf(" [mux (%d): ", idx); if (-1 == fcntl(shared_fd, ((mode & SHARED_NOWAIT) ? F_SETLK : F_SETLKW), &flk)) { switch (errno) { case EAGAIN: ; case EACCES: if (shared_debug) printf("again]"); return(SHARED_AGAIN); default: if (shared_debug) printf("err]"); return(SHARED_IPCERR); } } if (shared_debug) printf("ok]"); return(SHARED_OK); } static int shared_demux(int idx, int mode) /* free exclusive access to specified segment */ { flock_t flk; if (SHARED_INVALID == shared_fd) return(SHARED_NOTINIT); if ((idx < 0) || (idx >= shared_maxseg)) return(SHARED_BADARG); flk.l_type = F_UNLCK; flk.l_whence = 0; flk.l_start = idx; flk.l_len = 1; if (shared_debug) printf(" [demux (%d): ", idx); if (-1 == fcntl(shared_fd, F_SETLKW, &flk)) { switch (errno) { case EAGAIN: ; case EACCES: if (shared_debug) printf("again]"); return(SHARED_AGAIN); default: if (shared_debug) printf("err]"); return(SHARED_IPCERR); } } if (shared_debug) printf("mode=%d ok]", mode); return(SHARED_OK); } static int shared_process_count(int sem) /* valid only for time of invocation */ { union semun su; su.val = 0; /* to force compiler not to give warning messages */ return(semctl(sem, 0, GETVAL, su)); /* su is unused here */ } static int shared_delta_process(int sem, int delta) /* change number of processes hanging on segment */ { struct sembuf sb; if (SHARED_INVALID == sem) return(SHARED_BADARG); /* semaphore not attached */ sb.sem_num = 0; sb.sem_op = delta; sb.sem_flg = SEM_UNDO; return((-1 == semop(sem, &sb, 1)) ? SHARED_IPCERR : SHARED_OK); } static int shared_attach_process(int sem) { if (shared_debug) printf(" [attach process]"); return(shared_delta_process(sem, 1)); } static int shared_detach_process(int sem) { if (shared_debug) printf(" [detach process]"); return(shared_delta_process(sem, -1)); } /* API routines - hashing and searching */ static int shared_get_free_entry(int newhandle) /* get newhandle, or -1, entry is set rw locked */ { if (NULL == shared_gt) return(-1); /* not initialized */ if (NULL == shared_lt) return(-1); /* not initialized */ if (newhandle < 0) return(-1); if (newhandle >= shared_maxseg) return(-1); if (shared_lt[newhandle].tcnt) return(-1); /* somebody (we) is using it */ if (shared_mux(newhandle, SHARED_NOWAIT | SHARED_RDWRITE)) return(-1); /* used by others */ if (SHARED_INVALID == shared_gt[newhandle].key) return(newhandle); /* we have found free slot, lock it and return index */ shared_demux(newhandle, SHARED_RDWRITE); if (shared_debug) printf("[free_entry - ERROR - entry unusable]"); return(-1); /* table full */ } static int shared_get_hash(long size, int idx) /* return hash value for malloc */ { static int counter = 0; int hash; hash = (counter + size * idx) % shared_range; counter = (counter + 1) % shared_range; return(hash); } static long shared_adjust_size(long size) /* size must be >= 0 !!! */ { return(((size + sizeof(BLKHEAD) + SHARED_GRANUL - 1) / SHARED_GRANUL) * SHARED_GRANUL); } /* API routines - core : malloc/realloc/free/attach/detach/lock/unlock */ int shared_malloc(long size, int mode, int newhandle) /* return idx or SHARED_INVALID */ { int h, i, r, idx, key; union semun filler; BLKHEAD *bp; if (0 == shared_init_called) /* delayed initialization */ { if (SHARED_OK != (r = shared_init(0))) return(r); } if (shared_debug) printf("malloc (size = %ld, mode = %d):", size, mode); if (size < 0) return(SHARED_INVALID); if (-1 == (idx = shared_get_free_entry(newhandle))) return(SHARED_INVALID); if (shared_debug) printf(" idx=%d", idx); for (i = 0; ; i++) { if (i >= shared_range) /* table full, signal error & exit */ { shared_demux(idx, SHARED_RDWRITE); return(SHARED_INVALID); } key = shared_kbase + ((i + shared_get_hash(size, idx)) % shared_range); if (shared_debug) printf(" key=%d", key); h = shmget(key, shared_adjust_size(size), IPC_CREAT | IPC_EXCL | shared_create_mode); if (shared_debug) printf(" handle=%d", h); if (SHARED_INVALID == h) continue; /* segment already accupied */ bp = (BLKHEAD *)shmat(h, 0, 0); /* try attach */ if (shared_debug) printf(" p=%p", bp); if (((BLKHEAD *)SHARED_INVALID) == bp) /* cannot attach, delete segment, try with another key */ { shmctl(h, IPC_RMID, 0); continue; } /* now create semaphor counting number of processes attached */ if (SHARED_INVALID == (shared_gt[idx].sem = semget(key, 1, IPC_CREAT | IPC_EXCL | shared_create_mode))) { shmdt((void *)bp); /* cannot create segment, delete everything */ shmctl(h, IPC_RMID, 0); continue; /* try with another key */ } if (shared_debug) printf(" sem=%d", shared_gt[idx].sem); if (shared_attach_process(shared_gt[idx].sem)) /* try attach process */ { semctl(shared_gt[idx].sem, 0, IPC_RMID, filler); /* destroy semaphore */ shmdt((char *)bp); /* detach shared mem segment */ shmctl(h, IPC_RMID, 0); /* destroy shared mem segment */ continue; /* try with another key */ } bp->s.tflag = BLOCK_SHARED; /* fill in data in segment's header (this is really not necessary) */ bp->s.ID[0] = SHARED_ID_0; bp->s.ID[1] = SHARED_ID_1; bp->s.handle = idx; /* used in yorick */ if (mode & SHARED_RESIZE) { if (shmdt((char *)bp)) r = SHARED_IPCERR; /* if segment is resizable, then detach segment */ shared_lt[idx].p = NULL; } else { shared_lt[idx].p = bp; } shared_lt[idx].tcnt = 1; /* one thread using segment */ shared_lt[idx].lkcnt = 0; /* no locks at the moment */ shared_lt[idx].seekpos = 0L; /* r/w pointer positioned at beg of block */ shared_gt[idx].handle = h; /* fill in data in global table */ shared_gt[idx].size = size; shared_gt[idx].attr = mode; shared_gt[idx].semkey = key; shared_gt[idx].key = key; shared_gt[idx].nprocdebug = 0; break; } shared_demux(idx, SHARED_RDWRITE); /* hope this will not fail */ return(idx); } int shared_attach(int idx) { int r, r2; if (SHARED_OK != (r = shared_mux(idx, SHARED_RDWRITE | SHARED_WAIT))) return(r); if (SHARED_OK != (r = shared_map(idx))) { shared_demux(idx, SHARED_RDWRITE); return(r); } if (shared_attach_process(shared_gt[idx].sem)) /* try attach process */ { shmdt((char *)(shared_lt[idx].p)); /* cannot attach process, detach everything */ shared_lt[idx].p = NULL; shared_demux(idx, SHARED_RDWRITE); return(SHARED_BADARG); } shared_lt[idx].tcnt++; /* one more thread is using segment */ if (shared_gt[idx].attr & SHARED_RESIZE) /* if resizeable, detach and return special pointer */ { if (shmdt((char *)(shared_lt[idx].p))) r = SHARED_IPCERR; /* if segment is resizable, then detach segment */ shared_lt[idx].p = NULL; } shared_lt[idx].seekpos = 0L; /* r/w pointer positioned at beg of block */ r2 = shared_demux(idx, SHARED_RDWRITE); return(r ? r : r2); } static int shared_check_locked_index(int idx) /* verify that given idx is valid */ { int r; if (0 == shared_init_called) /* delayed initialization */ { if (SHARED_OK != (r = shared_init(0))) return(r); } if ((idx < 0) || (idx >= shared_maxseg)) return(SHARED_BADARG); if (NULL == shared_lt[idx].p) return(SHARED_BADARG); /* NULL pointer, not attached ?? */ if (0 == shared_lt[idx].lkcnt) return(SHARED_BADARG); /* not locked ?? */ if ((SHARED_ID_0 != (shared_lt[idx].p)->s.ID[0]) || (SHARED_ID_1 != (shared_lt[idx].p)->s.ID[1]) || (BLOCK_SHARED != (shared_lt[idx].p)->s.tflag)) /* invalid data in segment */ return(SHARED_BADARG); return(SHARED_OK); } static int shared_map(int idx) /* map all tables for given idx, check for validity */ { int h; /* have to obtain excl. access before calling shared_map */ BLKHEAD *bp; if ((idx < 0) || (idx >= shared_maxseg)) return(SHARED_BADARG); if (SHARED_INVALID == shared_gt[idx].key) return(SHARED_BADARG); if (SHARED_INVALID == (h = shmget(shared_gt[idx].key, 1, shared_create_mode))) return(SHARED_BADARG); if (((BLKHEAD *)SHARED_INVALID) == (bp = (BLKHEAD *)shmat(h, 0, 0))) return(SHARED_BADARG); if ((SHARED_ID_0 != bp->s.ID[0]) || (SHARED_ID_1 != bp->s.ID[1]) || (BLOCK_SHARED != bp->s.tflag) || (h != shared_gt[idx].handle)) { shmdt((char *)bp); /* invalid segment, detach everything */ return(SHARED_BADARG); } if (shared_gt[idx].sem != semget(shared_gt[idx].semkey, 1, shared_create_mode)) /* check if sema is still there */ { shmdt((char *)bp); /* cannot attach semaphore, detach everything */ return(SHARED_BADARG); } shared_lt[idx].p = bp; /* store pointer to shmem data */ return(SHARED_OK); } static int shared_validate(int idx, int mode) /* use intrnally inside crit.sect !!! */ { int r; if (SHARED_OK != (r = shared_mux(idx, mode))) return(r); /* idx checked by shared_mux */ if (NULL == shared_lt[idx].p) if (SHARED_OK != (r = shared_map(idx))) { shared_demux(idx, mode); return(r); } if ((SHARED_ID_0 != (shared_lt[idx].p)->s.ID[0]) || (SHARED_ID_1 != (shared_lt[idx].p)->s.ID[1]) || (BLOCK_SHARED != (shared_lt[idx].p)->s.tflag)) { shared_demux(idx, mode); return(r); } return(SHARED_OK); } SHARED_P shared_realloc(int idx, long newsize) /* realloc shared memory segment */ { int h, key, i, r; BLKHEAD *bp; long transfersize; r = SHARED_OK; if (newsize < 0) return(NULL); if (shared_check_locked_index(idx)) return(NULL); if (0 == (shared_gt[idx].attr & SHARED_RESIZE)) return(NULL); if (-1 != shared_lt[idx].lkcnt) return(NULL); /* check for RW lock */ if (shared_adjust_size(shared_gt[idx].size) == shared_adjust_size(newsize)) { shared_gt[idx].size = newsize; return((SHARED_P)((shared_lt[idx].p) + 1)); } for (i = 0; ; i++) { if (i >= shared_range) return(NULL); /* table full, signal error & exit */ key = shared_kbase + ((i + shared_get_hash(newsize, idx)) % shared_range); h = shmget(key, shared_adjust_size(newsize), IPC_CREAT | IPC_EXCL | shared_create_mode); if (SHARED_INVALID == h) continue; /* segment already accupied */ bp = (BLKHEAD *)shmat(h, 0, 0); /* try attach */ if (((BLKHEAD *)SHARED_INVALID) == bp) /* cannot attach, delete segment, try with another key */ { shmctl(h, IPC_RMID, 0); continue; } *bp = *(shared_lt[idx].p); /* copy header, then data */ transfersize = ((newsize < shared_gt[idx].size) ? newsize : shared_gt[idx].size); if (transfersize > 0) memcpy((void *)(bp + 1), (void *)((shared_lt[idx].p) + 1), transfersize); if (shmdt((char *)(shared_lt[idx].p))) r = SHARED_IPCERR; /* try to detach old segment */ if (shmctl(shared_gt[idx].handle, IPC_RMID, 0)) if (SHARED_OK == r) r = SHARED_IPCERR; /* destroy old shared memory segment */ shared_gt[idx].size = newsize; /* signal new size */ shared_gt[idx].handle = h; /* signal new handle */ shared_gt[idx].key = key; /* signal new key */ shared_lt[idx].p = bp; break; } return((SHARED_P)(bp + 1)); } int shared_free(int idx) /* detach segment, if last process & !PERSIST, destroy segment */ { int cnt, r, r2; if (SHARED_OK != (r = shared_validate(idx, SHARED_RDWRITE | SHARED_WAIT))) return(r); if (SHARED_OK != (r = shared_detach_process(shared_gt[idx].sem))) /* update number of processes using segment */ { shared_demux(idx, SHARED_RDWRITE); return(r); } shared_lt[idx].tcnt--; /* update number of threads using segment */ if (shared_lt[idx].tcnt > 0) return(shared_demux(idx, SHARED_RDWRITE)); /* if more threads are using segment we are done */ if (shmdt((char *)(shared_lt[idx].p))) /* if, we are the last thread, try to detach segment */ { shared_demux(idx, SHARED_RDWRITE); return(SHARED_IPCERR); } shared_lt[idx].p = NULL; /* clear entry in local table */ shared_lt[idx].seekpos = 0L; /* r/w pointer positioned at beg of block */ if (-1 == (cnt = shared_process_count(shared_gt[idx].sem))) /* get number of processes hanging on segment */ { shared_demux(idx, SHARED_RDWRITE); return(SHARED_IPCERR); } if ((0 == cnt) && (0 == (shared_gt[idx].attr & SHARED_PERSIST))) r = shared_destroy_entry(idx); /* no procs on seg, destroy it */ r2 = shared_demux(idx, SHARED_RDWRITE); return(r ? r : r2); } SHARED_P shared_lock(int idx, int mode) /* lock given segment for exclusive access */ { int r; if (shared_mux(idx, mode)) return(NULL); /* idx checked by shared_mux */ if (0 != shared_lt[idx].lkcnt) /* are we already locked ?? */ if (SHARED_OK != (r = shared_map(idx))) { shared_demux(idx, mode); return(NULL); } if (NULL == shared_lt[idx].p) /* stupid pointer ?? */ if (SHARED_OK != (r = shared_map(idx))) { shared_demux(idx, mode); return(NULL); } if ((SHARED_ID_0 != (shared_lt[idx].p)->s.ID[0]) || (SHARED_ID_1 != (shared_lt[idx].p)->s.ID[1]) || (BLOCK_SHARED != (shared_lt[idx].p)->s.tflag)) { shared_demux(idx, mode); return(NULL); } if (mode & SHARED_RDWRITE) { shared_lt[idx].lkcnt = -1; shared_gt[idx].nprocdebug++; } else shared_lt[idx].lkcnt++; shared_lt[idx].seekpos = 0L; /* r/w pointer positioned at beg of block */ return((SHARED_P)((shared_lt[idx].p) + 1)); } int shared_unlock(int idx) /* unlock given segment, assumes seg is locked !! */ { int r, r2, mode; if (SHARED_OK != (r = shared_check_locked_index(idx))) return(r); if (shared_lt[idx].lkcnt > 0) { shared_lt[idx].lkcnt--; /* unlock read lock */ mode = SHARED_RDONLY; } else { shared_lt[idx].lkcnt = 0; /* unlock write lock */ shared_gt[idx].nprocdebug--; mode = SHARED_RDWRITE; } if (0 == shared_lt[idx].lkcnt) if (shared_gt[idx].attr & SHARED_RESIZE) { if (shmdt((char *)(shared_lt[idx].p))) r = SHARED_IPCERR; /* segment is resizable, then detach segment */ shared_lt[idx].p = NULL; /* signal detachment in local table */ } r2 = shared_demux(idx, mode); /* unlock segment, rest is only parameter checking */ return(r ? r : r2); } /* API routines - support and info routines */ int shared_attr(int idx) /* get the attributes of the shared memory segment */ { int r; if (shared_check_locked_index(idx)) return(SHARED_INVALID); r = shared_gt[idx].attr; return(r); } int shared_set_attr(int idx, int newattr) /* get the attributes of the shared memory segment */ { int r; if (shared_check_locked_index(idx)) return(SHARED_INVALID); if (-1 != shared_lt[idx].lkcnt) return(SHARED_INVALID); /* ADDED - check for RW lock */ r = shared_gt[idx].attr; shared_gt[idx].attr = newattr; return(r); } int shared_set_debug(int mode) /* set/reset debug mode */ { int r = shared_debug; shared_debug = mode; return(r); } int shared_set_createmode(int mode) /* set/reset debug mode */ { int r = shared_create_mode; shared_create_mode = mode; return(r); } int shared_list(int id) { int i, r; if (NULL == shared_gt) return(SHARED_NOTINIT); /* not initialized */ if (NULL == shared_lt) return(SHARED_NOTINIT); /* not initialized */ if (shared_debug) printf("shared_list:"); r = SHARED_OK; printf(" Idx Key Nproc Size Flags\n"); printf("==============================================\n"); for (i=0; i= SHARED_ERRBASE) { printf(" cannot clear PERSIST attribute"); } if (shared_free(i)) { printf(" delete failed\n"); } else { printf(" deleted\n"); } } if (shared_debug) printf(" done\n"); return(r); /* table full */ } /************************* CFITSIO DRIVER FUNCTIONS ***************************/ int smem_init(void) { return(0); } int smem_shutdown(void) { if (shared_init_called) shared_cleanup(); return(0); } int smem_setoptions(int option) { option = 0; return(0); } int smem_getoptions(int *options) { if (NULL == options) return(SHARED_NULPTR); *options = 0; return(0); } int smem_getversion(int *version) { if (NULL == version) return(SHARED_NULPTR); *version = 10; return(0); } int smem_open(char *filename, int rwmode, int *driverhandle) { int h, nitems, r; DAL_SHM_SEGHEAD *sp; if (NULL == filename) return(SHARED_NULPTR); if (NULL == driverhandle) return(SHARED_NULPTR); nitems = sscanf(filename, "h%d", &h); if (1 != nitems) return(SHARED_BADARG); if (SHARED_OK != (r = shared_attach(h))) return(r); if (NULL == (sp = (DAL_SHM_SEGHEAD *)shared_lock(h, ((READWRITE == rwmode) ? SHARED_RDWRITE : SHARED_RDONLY)))) { shared_free(h); return(SHARED_BADARG); } if ((h != sp->h) || (DAL_SHM_SEGHEAD_ID != sp->ID)) { shared_unlock(h); shared_free(h); return(SHARED_BADARG); } *driverhandle = h; return(0); } int smem_create(char *filename, int *driverhandle) { DAL_SHM_SEGHEAD *sp; int h, sz, nitems; if (NULL == filename) return(SHARED_NULPTR); /* currently ignored */ if (NULL == driverhandle) return(SHARED_NULPTR); nitems = sscanf(filename, "h%d", &h); if (1 != nitems) return(SHARED_BADARG); if (SHARED_INVALID == (h = shared_malloc(sz = 2880 + sizeof(DAL_SHM_SEGHEAD), SHARED_RESIZE | SHARED_PERSIST, h))) return(SHARED_NOMEM); if (NULL == (sp = (DAL_SHM_SEGHEAD *)shared_lock(h, SHARED_RDWRITE))) { shared_free(h); return(SHARED_BADARG); } sp->ID = DAL_SHM_SEGHEAD_ID; sp->h = h; sp->size = sz; sp->nodeidx = -1; *driverhandle = h; return(0); } int smem_close(int driverhandle) { int r; if (SHARED_OK != (r = shared_unlock(driverhandle))) return(r); return(shared_free(driverhandle)); } int smem_remove(char *filename) { int nitems, h, r; if (NULL == filename) return(SHARED_NULPTR); nitems = sscanf(filename, "h%d", &h); if (1 != nitems) return(SHARED_BADARG); if (0 == shared_check_locked_index(h)) /* are we locked ? */ { if (-1 != shared_lt[h].lkcnt) /* are we locked RO ? */ { if (SHARED_OK != (r = shared_unlock(h))) return(r); /* yes, so relock in RW */ if (NULL == shared_lock(h, SHARED_RDWRITE)) return(SHARED_BADARG); } } else /* not locked */ { if (SHARED_OK != (r = smem_open(filename, READWRITE, &h))) return(r); /* so open in RW mode */ } shared_set_attr(h, SHARED_RESIZE); /* delete PERSIST attribute */ return(smem_close(h)); /* detach segment (this will delete it) */ } int smem_size(int driverhandle, LONGLONG *size) { if (NULL == size) return(SHARED_NULPTR); if (shared_check_locked_index(driverhandle)) return(SHARED_INVALID); *size = (LONGLONG) (shared_gt[driverhandle].size - sizeof(DAL_SHM_SEGHEAD)); return(0); } int smem_flush(int driverhandle) { if (shared_check_locked_index(driverhandle)) return(SHARED_INVALID); return(0); } int smem_seek(int driverhandle, LONGLONG offset) { if (offset < 0) return(SHARED_BADARG); if (shared_check_locked_index(driverhandle)) return(SHARED_INVALID); shared_lt[driverhandle].seekpos = offset; return(0); } int smem_read(int driverhandle, void *buffer, long nbytes) { if (NULL == buffer) return(SHARED_NULPTR); if (shared_check_locked_index(driverhandle)) return(SHARED_INVALID); if (nbytes < 0) return(SHARED_BADARG); if ((shared_lt[driverhandle].seekpos + nbytes) > shared_gt[driverhandle].size) return(SHARED_BADARG); /* read beyond EOF */ memcpy(buffer, ((char *)(((DAL_SHM_SEGHEAD *)(shared_lt[driverhandle].p + 1)) + 1)) + shared_lt[driverhandle].seekpos, nbytes); shared_lt[driverhandle].seekpos += nbytes; return(0); } int smem_write(int driverhandle, void *buffer, long nbytes) { if (NULL == buffer) return(SHARED_NULPTR); if (shared_check_locked_index(driverhandle)) return(SHARED_INVALID); if (-1 != shared_lt[driverhandle].lkcnt) return(SHARED_INVALID); /* are we locked RW ? */ if (nbytes < 0) return(SHARED_BADARG); if ((unsigned long)(shared_lt[driverhandle].seekpos + nbytes) > (unsigned long)(shared_gt[driverhandle].size - sizeof(DAL_SHM_SEGHEAD))) { /* need to realloc shmem */ if (NULL == shared_realloc(driverhandle, shared_lt[driverhandle].seekpos + nbytes + sizeof(DAL_SHM_SEGHEAD))) return(SHARED_NOMEM); } memcpy(((char *)(((DAL_SHM_SEGHEAD *)(shared_lt[driverhandle].p + 1)) + 1)) + shared_lt[driverhandle].seekpos, buffer, nbytes); shared_lt[driverhandle].seekpos += nbytes; return(0); } #endif cfitsio-3.47/drvrsmem.h0000644000225700000360000001461013464573431014421 0ustar cagordonlhea/* S H A R E D M E M O R Y D R I V E R ======================================= by Jerzy.Borkowski@obs.unige.ch 09-Mar-98 : initial version 1.0 released 23-Mar-98 : shared_malloc now accepts new handle as an argument */ #include /* this is necessary for Solaris/Linux */ #include #include #ifdef _AIX #include #else #include #endif /* configuration parameters */ #define SHARED_MAXSEG (16) /* maximum number of shared memory blocks */ #define SHARED_KEYBASE (14011963) /* base for shared memory keys, may be overriden by getenv */ #define SHARED_FDNAME ("/tmp/.shmem-lockfile") /* template for lock file name */ #define SHARED_ENV_KEYBASE ("SHMEM_LIB_KEYBASE") /* name of environment variable */ #define SHARED_ENV_MAXSEG ("SHMEM_LIB_MAXSEG") /* name of environment variable */ /* useful constants */ #define SHARED_RDONLY (0) /* flag for shared_(un)lock, lock for read */ #define SHARED_RDWRITE (1) /* flag for shared_(un)lock, lock for write */ #define SHARED_WAIT (0) /* flag for shared_lock, block if cannot lock immediate */ #define SHARED_NOWAIT (2) /* flag for shared_lock, fail if cannot lock immediate */ #define SHARED_NOLOCK (0x100) /* flag for shared_validate function */ #define SHARED_RESIZE (4) /* flag for shared_malloc, object is resizeable */ #define SHARED_PERSIST (8) /* flag for shared_malloc, object is not deleted after last proc detaches */ #define SHARED_INVALID (-1) /* invalid handle for semaphore/shared memory */ #define SHARED_EMPTY (0) /* entries for shared_used table */ #define SHARED_USED (1) #define SHARED_GRANUL (16384) /* granularity of shared_malloc allocation = phys page size, system dependent */ /* checkpoints in shared memory segments - might be omitted */ #define SHARED_ID_0 ('J') /* first byte of identifier in BLKHEAD */ #define SHARED_ID_1 ('B') /* second byte of identifier in BLKHEAD */ #define BLOCK_REG (0) /* value for tflag member of BLKHEAD */ #define BLOCK_SHARED (1) /* value for tflag member of BLKHEAD */ /* generic error codes */ #define SHARED_OK (0) #define SHARED_ERR_MIN_IDX SHARED_BADARG #define SHARED_ERR_MAX_IDX SHARED_NORESIZE #define DAL_SHM_FREE (0) #define DAL_SHM_USED (1) #define DAL_SHM_ID0 ('D') #define DAL_SHM_ID1 ('S') #define DAL_SHM_ID2 ('M') #define DAL_SHM_SEGHEAD_ID (0x19630114) /* data types */ /* BLKHEAD object is placed at the beginning of every memory segment (both shared and regular) to allow automatic recognition of segments type */ typedef union { struct BLKHEADstruct { char ID[2]; /* ID = 'JB', just as a checkpoint */ char tflag; /* is it shared memory or regular one ? */ int handle; /* this is not necessary, used only for non-resizeable objects via ptr */ } s; double d; /* for proper alignment on every machine */ } BLKHEAD; typedef void *SHARED_P; /* generic type of shared memory pointer */ typedef struct SHARED_GTABstruct /* data type used in global table */ { int sem; /* access semaphore (1 field): process count */ int semkey; /* key value used to generate semaphore handle */ int key; /* key value used to generate shared memory handle (realloc changes it) */ int handle; /* handle of shared memory segment */ int size; /* size of shared memory segment */ int nprocdebug; /* attached proc counter, helps remove zombie segments */ char attr; /* attributes of shared memory object */ } SHARED_GTAB; typedef struct SHARED_LTABstruct /* data type used in local table */ { BLKHEAD *p; /* pointer to segment (may be null) */ int tcnt; /* number of threads in this process attached to segment */ int lkcnt; /* >=0 <- number of read locks, -1 - write lock */ long seekpos; /* current pointer position, read/write/seek operations change it */ } SHARED_LTAB; /* system dependent definitions */ #ifndef HAVE_FLOCK_T typedef struct flock flock_t; #define HAVE_FLOCK_T #endif #ifndef HAVE_UNION_SEMUN union semun { int val; struct semid_ds *buf; unsigned short *array; }; #define HAVE_UNION_SEMUN #endif typedef struct DAL_SHM_SEGHEAD_STRUCT DAL_SHM_SEGHEAD; struct DAL_SHM_SEGHEAD_STRUCT { int ID; /* ID for debugging */ int h; /* handle of sh. mem */ int size; /* size of data area */ int nodeidx; /* offset of root object (node struct typically) */ }; /* API routines */ #ifdef __cplusplus extern "C" { #endif void shared_cleanup(void); /* must be called at exit/abort */ int shared_init(int debug_msgs); /* must be called before any other shared memory routine */ int shared_recover(int id); /* try to recover dormant segment(s) after applic crash */ int shared_malloc(long size, int mode, int newhandle); /* allocate n-bytes of shared memory */ int shared_attach(int idx); /* attach to segment given index to table */ int shared_free(int idx); /* release shared memory */ SHARED_P shared_lock(int idx, int mode); /* lock segment for reading */ SHARED_P shared_realloc(int idx, long newsize); /* reallocate n-bytes of shared memory (ON LOCKED SEGMENT ONLY) */ int shared_size(int idx); /* get size of attached shared memory segment (ON LOCKED SEGMENT ONLY) */ int shared_attr(int idx); /* get attributes of attached shared memory segment (ON LOCKED SEGMENT ONLY) */ int shared_set_attr(int idx, int newattr); /* set attributes of attached shared memory segment (ON LOCKED SEGMENT ONLY) */ int shared_unlock(int idx); /* unlock segment (ON LOCKED SEGMENT ONLY) */ int shared_set_debug(int debug_msgs); /* set/reset debug mode */ int shared_set_createmode(int mode); /* set/reset debug mode */ int shared_list(int id); /* list segment(s) */ int shared_uncond_delete(int id); /* uncondintionally delete (NOWAIT operation) segment(s) */ int shared_getaddr(int id, char **address); /* get starting address of FITS file in segment */ int smem_init(void); int smem_shutdown(void); int smem_setoptions(int options); int smem_getoptions(int *options); int smem_getversion(int *version); int smem_open(char *filename, int rwmode, int *driverhandle); int smem_create(char *filename, int *driverhandle); int smem_close(int driverhandle); int smem_remove(char *filename); int smem_size(int driverhandle, LONGLONG *size); int smem_flush(int driverhandle); int smem_seek(int driverhandle, LONGLONG offset); int smem_read(int driverhandle, void *buffer, long nbytes); int smem_write(int driverhandle, void *buffer, long nbytes); #ifdef __cplusplus } #endif cfitsio-3.47/editcol.c0000644000225700000360000030241513464573431014203 0ustar cagordonlhea/* This file, editcol.c, contains the set of FITSIO routines that */ /* insert or delete rows or columns in a table or resize an image */ /* The FITSIO software was written by William Pence at the High Energy */ /* Astrophysic Science Archive Research Center (HEASARC) at the NASA */ /* Goddard Space Flight Center. */ #include #include #include #include "fitsio2.h" /*--------------------------------------------------------------------------*/ int ffrsim(fitsfile *fptr, /* I - FITS file pointer */ int bitpix, /* I - bits per pixel */ int naxis, /* I - number of axes in the array */ long *naxes, /* I - size of each axis */ int *status) /* IO - error status */ /* resize an existing primary array or IMAGE extension. */ { LONGLONG tnaxes[99]; int ii; if (*status > 0) return(*status); for (ii = 0; (ii < naxis) && (ii < 99); ii++) tnaxes[ii] = naxes[ii]; ffrsimll(fptr, bitpix, naxis, tnaxes, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffrsimll(fitsfile *fptr, /* I - FITS file pointer */ int bitpix, /* I - bits per pixel */ int naxis, /* I - number of axes in the array */ LONGLONG *naxes, /* I - size of each axis */ int *status) /* IO - error status */ /* resize an existing primary array or IMAGE extension. */ { int ii, simple, obitpix, onaxis, extend, nmodify; long nblocks, longval; long pcount, gcount, longbitpix; LONGLONG onaxes[99], newsize, oldsize; char comment[FLEN_COMMENT], keyname[FLEN_KEYWORD], message[FLEN_ERRMSG]; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) { ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); } /* rescan header if data structure is undefined */ else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) return(*status); /* get current image size parameters */ if (ffghprll(fptr, 99, &simple, &obitpix, &onaxis, onaxes, &pcount, &gcount, &extend, status) > 0) return(*status); longbitpix = bitpix; /* test for the 2 special cases that represent unsigned integers */ if (longbitpix == USHORT_IMG) longbitpix = SHORT_IMG; else if (longbitpix == ULONG_IMG) longbitpix = LONG_IMG; /* test that the new values are legal */ if (longbitpix != BYTE_IMG && longbitpix != SHORT_IMG && longbitpix != LONG_IMG && longbitpix != LONGLONG_IMG && longbitpix != FLOAT_IMG && longbitpix != DOUBLE_IMG) { snprintf(message, FLEN_ERRMSG, "Illegal value for BITPIX keyword: %d", bitpix); ffpmsg(message); return(*status = BAD_BITPIX); } if (naxis < 0 || naxis > 999) { snprintf(message, FLEN_ERRMSG, "Illegal value for NAXIS keyword: %d", naxis); ffpmsg(message); return(*status = BAD_NAXIS); } if (naxis == 0) newsize = 0; else newsize = 1; for (ii = 0; ii < naxis; ii++) { if (naxes[ii] < 0) { snprintf(message, FLEN_ERRMSG, "Illegal value for NAXIS%d keyword: %.0f", ii + 1, (double) (naxes[ii])); ffpmsg(message); return(*status = BAD_NAXES); } newsize *= naxes[ii]; /* compute new image size, in pixels */ } /* compute size of old image, in bytes */ if (onaxis == 0) oldsize = 0; else { oldsize = 1; for (ii = 0; ii < onaxis; ii++) oldsize *= onaxes[ii]; oldsize = (oldsize + pcount) * gcount * (abs(obitpix) / 8); } oldsize = (oldsize + 2879) / 2880; /* old size, in blocks */ newsize = (newsize + pcount) * gcount * (abs(longbitpix) / 8); newsize = (newsize + 2879) / 2880; /* new size, in blocks */ if (newsize > oldsize) /* have to insert new blocks for image */ { nblocks = (long) (newsize - oldsize); if (ffiblk(fptr, nblocks, 1, status) > 0) return(*status); } else if (oldsize > newsize) /* have to delete blocks from image */ { nblocks = (long) (oldsize - newsize); if (ffdblk(fptr, nblocks, status) > 0) return(*status); } /* now update the header keywords */ strcpy(comment,"&"); /* special value to leave comments unchanged */ if (longbitpix != obitpix) { /* update BITPIX value */ ffmkyj(fptr, "BITPIX", longbitpix, comment, status); } if (naxis != onaxis) { /* update NAXIS value */ longval = naxis; ffmkyj(fptr, "NAXIS", longval, comment, status); } /* modify the existing NAXISn keywords */ nmodify = minvalue(naxis, onaxis); for (ii = 0; ii < nmodify; ii++) { ffkeyn("NAXIS", ii+1, keyname, status); ffmkyj(fptr, keyname, naxes[ii], comment, status); } if (naxis > onaxis) /* insert additional NAXISn keywords */ { strcpy(comment,"length of data axis"); for (ii = onaxis; ii < naxis; ii++) { ffkeyn("NAXIS", ii+1, keyname, status); ffikyj(fptr, keyname, naxes[ii], comment, status); } } else if (onaxis > naxis) /* delete old NAXISn keywords */ { for (ii = naxis; ii < onaxis; ii++) { ffkeyn("NAXIS", ii+1, keyname, status); ffdkey(fptr, keyname, status); } } /* Update the BSCALE and BZERO keywords, if an unsigned integer image */ if (bitpix == USHORT_IMG) { strcpy(comment, "offset data range to that of unsigned short"); ffukyg(fptr, "BZERO", 32768., 0, comment, status); strcpy(comment, "default scaling factor"); ffukyg(fptr, "BSCALE", 1.0, 0, comment, status); } else if (bitpix == ULONG_IMG) { strcpy(comment, "offset data range to that of unsigned long"); ffukyg(fptr, "BZERO", 2147483648., 0, comment, status); strcpy(comment, "default scaling factor"); ffukyg(fptr, "BSCALE", 1.0, 0, comment, status); } /* re-read the header, to make sure structures are updated */ ffrdef(fptr, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffirow(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG firstrow, /* I - insert space AFTER this row */ /* 0 = insert space at beginning of table */ LONGLONG nrows, /* I - number of rows to insert */ int *status) /* IO - error status */ /* insert NROWS blank rows immediated after row firstrow (1 = first row). Set firstrow = 0 to insert space at the beginning of the table. */ { int tstatus; LONGLONG naxis1, naxis2; LONGLONG datasize, firstbyte, nshift, nbytes; LONGLONG freespace; long nblock; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) { ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); } /* rescan header if data structure is undefined */ else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) { ffpmsg("Can only add rows to TABLE or BINTABLE extension (ffirow)"); return(*status = NOT_TABLE); } if (nrows < 0 ) return(*status = NEG_BYTES); else if (nrows == 0) return(*status); /* no op, so just return */ /* get the current size of the table */ /* use internal structure since NAXIS2 keyword may not be up to date */ naxis1 = (fptr->Fptr)->rowlength; naxis2 = (fptr->Fptr)->numrows; if (firstrow > naxis2) { ffpmsg( "Insert position greater than the number of rows in the table (ffirow)"); return(*status = BAD_ROW_NUM); } else if (firstrow < 0) { ffpmsg("Insert position is less than 0 (ffirow)"); return(*status = BAD_ROW_NUM); } /* current data size */ datasize = (fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize; freespace = ( ( (datasize + 2879) / 2880) * 2880) - datasize; nshift = naxis1 * nrows; /* no. of bytes to add to table */ if ( (freespace - nshift) < 0) /* not enough existing space? */ { nblock = (long) ((nshift - freespace + 2879) / 2880); /* number of blocks */ ffiblk(fptr, nblock, 1, status); /* insert the blocks */ } firstbyte = naxis1 * firstrow; /* relative insert position */ nbytes = datasize - firstbyte; /* no. of bytes to shift down */ firstbyte += ((fptr->Fptr)->datastart); /* absolute insert position */ ffshft(fptr, firstbyte, nbytes, nshift, status); /* shift rows and heap */ /* update the heap starting address */ (fptr->Fptr)->heapstart += nshift; /* update the THEAP keyword if it exists */ tstatus = 0; ffmkyj(fptr, "THEAP", (fptr->Fptr)->heapstart, "&", &tstatus); /* update the NAXIS2 keyword */ ffmkyj(fptr, "NAXIS2", naxis2 + nrows, "&", status); ((fptr->Fptr)->numrows) += nrows; ((fptr->Fptr)->origrows) += nrows; return(*status); } /*--------------------------------------------------------------------------*/ int ffdrow(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG firstrow, /* I - first row to delete (1 = first) */ LONGLONG nrows, /* I - number of rows to delete */ int *status) /* IO - error status */ /* delete NROWS rows from table starting with firstrow (1 = first row of table). */ { int tstatus; LONGLONG naxis1, naxis2; LONGLONG datasize, firstbyte, nbytes, nshift; LONGLONG freespace; long nblock; char comm[FLEN_COMMENT]; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) { ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); } /* rescan header if data structure is undefined */ else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) { ffpmsg("Can only delete rows in TABLE or BINTABLE extension (ffdrow)"); return(*status = NOT_TABLE); } if (nrows < 0 ) return(*status = NEG_BYTES); else if (nrows == 0) return(*status); /* no op, so just return */ ffgkyjj(fptr, "NAXIS1", &naxis1, comm, status); /* get the current */ /* ffgkyj(fptr, "NAXIS2", &naxis2, comm, status);*/ /* size of the table */ /* the NAXIS2 keyword may not be up to date, so use the structure value */ naxis2 = (fptr->Fptr)->numrows; if (firstrow > naxis2) { ffpmsg( "Delete position greater than the number of rows in the table (ffdrow)"); return(*status = BAD_ROW_NUM); } else if (firstrow < 1) { ffpmsg("Delete position is less than 1 (ffdrow)"); return(*status = BAD_ROW_NUM); } else if (firstrow + nrows - 1 > naxis2) { ffpmsg("No. of rows to delete exceeds size of table (ffdrow)"); return(*status = BAD_ROW_NUM); } nshift = naxis1 * nrows; /* no. of bytes to delete from table */ /* cur size of data */ datasize = (fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize; firstbyte = naxis1 * (firstrow + nrows - 1); /* relative del pos */ nbytes = datasize - firstbyte; /* no. of bytes to shift up */ firstbyte += ((fptr->Fptr)->datastart); /* absolute delete position */ ffshft(fptr, firstbyte, nbytes, nshift * (-1), status); /* shift data */ freespace = ( ( (datasize + 2879) / 2880) * 2880) - datasize; nblock = (long) ((nshift + freespace) / 2880); /* number of blocks */ /* delete integral number blocks */ if (nblock > 0) ffdblk(fptr, nblock, status); /* update the heap starting address */ (fptr->Fptr)->heapstart -= nshift; /* update the THEAP keyword if it exists */ tstatus = 0; ffmkyj(fptr, "THEAP", (long)(fptr->Fptr)->heapstart, "&", &tstatus); /* update the NAXIS2 keyword */ ffmkyj(fptr, "NAXIS2", naxis2 - nrows, "&", status); ((fptr->Fptr)->numrows) -= nrows; ((fptr->Fptr)->origrows) -= nrows; /* Update the heap data, if any. This will remove any orphaned data */ /* that was only pointed to by the rows that have been deleted */ ffcmph(fptr, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffdrrg(fitsfile *fptr, /* I - FITS file pointer to table */ char *ranges, /* I - ranges of rows to delete (1 = first) */ int *status) /* IO - error status */ /* delete the ranges of rows from the table (1 = first row of table). The 'ranges' parameter typically looks like: '10-20, 30 - 40, 55' or '50-' and gives a list of rows or row ranges separated by commas. */ { char *cptr; int nranges, nranges2, ii; long *minrow, *maxrow, nrows, *rowarray, jj, kk; LONGLONG naxis2; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) { ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); } /* rescan header if data structure is undefined */ else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) { ffpmsg("Can only delete rows in TABLE or BINTABLE extension (ffdrrg)"); return(*status = NOT_TABLE); } /* the NAXIS2 keyword may not be up to date, so use the structure value */ naxis2 = (fptr->Fptr)->numrows; /* find how many ranges were specified ( = no. of commas in string + 1) */ cptr = ranges; for (nranges = 1; (cptr = strchr(cptr, ',')); nranges++) cptr++; minrow = calloc(nranges, sizeof(long)); maxrow = calloc(nranges, sizeof(long)); if (!minrow || !maxrow) { *status = MEMORY_ALLOCATION; ffpmsg("failed to allocate memory for row ranges (ffdrrg)"); if (maxrow) free(maxrow); if (minrow) free(minrow); return(*status); } /* parse range list into array of range min and max values */ ffrwrg(ranges, naxis2, nranges, &nranges2, minrow, maxrow, status); if (*status > 0 || nranges2 == 0) { free(maxrow); free(minrow); return(*status); } /* determine total number or rows to delete */ nrows = 0; for (ii = 0; ii < nranges2; ii++) { nrows = nrows + maxrow[ii] - minrow[ii] + 1; } rowarray = calloc(nrows, sizeof(long)); if (!rowarray) { *status = MEMORY_ALLOCATION; ffpmsg("failed to allocate memory for row array (ffdrrg)"); return(*status); } for (kk = 0, ii = 0; ii < nranges2; ii++) { for (jj = minrow[ii]; jj <= maxrow[ii]; jj++) { rowarray[kk] = jj; kk++; } } /* delete the rows */ ffdrws(fptr, rowarray, nrows, status); free(rowarray); free(maxrow); free(minrow); return(*status); } /*--------------------------------------------------------------------------*/ int ffdrws(fitsfile *fptr, /* I - FITS file pointer */ long *rownum, /* I - list of rows to delete (1 = first) */ long nrows, /* I - number of rows to delete */ int *status) /* IO - error status */ /* delete the list of rows from the table (1 = first row of table). */ { LONGLONG naxis1, naxis2, insertpos, nextrowpos; long ii, nextrow; char comm[FLEN_COMMENT]; unsigned char *buffer; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); /* rescan header if data structure is undefined */ if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) { ffpmsg("Can only delete rows in TABLE or BINTABLE extension (ffdrws)"); return(*status = NOT_TABLE); } if (nrows < 0 ) return(*status = NEG_BYTES); else if (nrows == 0) return(*status); /* no op, so just return */ ffgkyjj(fptr, "NAXIS1", &naxis1, comm, status); /* row width */ ffgkyjj(fptr, "NAXIS2", &naxis2, comm, status); /* number of rows */ /* check that input row list is in ascending order */ for (ii = 1; ii < nrows; ii++) { if (rownum[ii - 1] >= rownum[ii]) { ffpmsg("row numbers are not in increasing order (ffdrws)"); return(*status = BAD_ROW_NUM); } } if (rownum[0] < 1) { ffpmsg("first row to delete is less than 1 (ffdrws)"); return(*status = BAD_ROW_NUM); } else if (rownum[nrows - 1] > naxis2) { ffpmsg("last row to delete exceeds size of table (ffdrws)"); return(*status = BAD_ROW_NUM); } buffer = (unsigned char *) malloc( (size_t) naxis1); /* buffer for one row */ if (!buffer) { ffpmsg("malloc failed (ffdrws)"); return(*status = MEMORY_ALLOCATION); } /* byte location to start of first row to delete, and the next row */ insertpos = (fptr->Fptr)->datastart + ((rownum[0] - 1) * naxis1); nextrowpos = insertpos + naxis1; nextrow = rownum[0] + 1; /* work through the list of rows to delete */ for (ii = 1; ii < nrows; nextrow++, nextrowpos += naxis1) { if (nextrow < rownum[ii]) { /* keep this row, so copy it to the new position */ ffmbyt(fptr, nextrowpos, REPORT_EOF, status); ffgbyt(fptr, naxis1, buffer, status); /* read the bytes */ ffmbyt(fptr, insertpos, IGNORE_EOF, status); ffpbyt(fptr, naxis1, buffer, status); /* write the bytes */ if (*status > 0) { ffpmsg("error while copying good rows in table (ffdrws)"); free(buffer); return(*status); } insertpos += naxis1; } else { /* skip over this row since it is in the list */ ii++; } } /* finished with all the rows to delete; copy remaining rows */ while(nextrow <= naxis2) { ffmbyt(fptr, nextrowpos, REPORT_EOF, status); ffgbyt(fptr, naxis1, buffer, status); /* read the bytes */ ffmbyt(fptr, insertpos, IGNORE_EOF, status); ffpbyt(fptr, naxis1, buffer, status); /* write the bytes */ if (*status > 0) { ffpmsg("failed to copy remaining rows in table (ffdrws)"); free(buffer); return(*status); } insertpos += naxis1; nextrowpos += naxis1; nextrow++; } free(buffer); /* now delete the empty rows at the end of the table */ ffdrow(fptr, naxis2 - nrows + 1, nrows, status); /* Update the heap data, if any. This will remove any orphaned data */ /* that was only pointed to by the rows that have been deleted */ ffcmph(fptr, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffdrwsll(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG *rownum, /* I - list of rows to delete (1 = first) */ LONGLONG nrows, /* I - number of rows to delete */ int *status) /* IO - error status */ /* delete the list of rows from the table (1 = first row of table). */ { LONGLONG insertpos, nextrowpos; LONGLONG naxis1, naxis2, ii, nextrow; char comm[FLEN_COMMENT]; unsigned char *buffer; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); /* rescan header if data structure is undefined */ if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) { ffpmsg("Can only delete rows in TABLE or BINTABLE extension (ffdrws)"); return(*status = NOT_TABLE); } if (nrows < 0 ) return(*status = NEG_BYTES); else if (nrows == 0) return(*status); /* no op, so just return */ ffgkyjj(fptr, "NAXIS1", &naxis1, comm, status); /* row width */ ffgkyjj(fptr, "NAXIS2", &naxis2, comm, status); /* number of rows */ /* check that input row list is in ascending order */ for (ii = 1; ii < nrows; ii++) { if (rownum[ii - 1] >= rownum[ii]) { ffpmsg("row numbers are not in increasing order (ffdrws)"); return(*status = BAD_ROW_NUM); } } if (rownum[0] < 1) { ffpmsg("first row to delete is less than 1 (ffdrws)"); return(*status = BAD_ROW_NUM); } else if (rownum[nrows - 1] > naxis2) { ffpmsg("last row to delete exceeds size of table (ffdrws)"); return(*status = BAD_ROW_NUM); } buffer = (unsigned char *) malloc( (size_t) naxis1); /* buffer for one row */ if (!buffer) { ffpmsg("malloc failed (ffdrwsll)"); return(*status = MEMORY_ALLOCATION); } /* byte location to start of first row to delete, and the next row */ insertpos = (fptr->Fptr)->datastart + ((rownum[0] - 1) * naxis1); nextrowpos = insertpos + naxis1; nextrow = rownum[0] + 1; /* work through the list of rows to delete */ for (ii = 1; ii < nrows; nextrow++, nextrowpos += naxis1) { if (nextrow < rownum[ii]) { /* keep this row, so copy it to the new position */ ffmbyt(fptr, nextrowpos, REPORT_EOF, status); ffgbyt(fptr, naxis1, buffer, status); /* read the bytes */ ffmbyt(fptr, insertpos, IGNORE_EOF, status); ffpbyt(fptr, naxis1, buffer, status); /* write the bytes */ if (*status > 0) { ffpmsg("error while copying good rows in table (ffdrws)"); free(buffer); return(*status); } insertpos += naxis1; } else { /* skip over this row since it is in the list */ ii++; } } /* finished with all the rows to delete; copy remaining rows */ while(nextrow <= naxis2) { ffmbyt(fptr, nextrowpos, REPORT_EOF, status); ffgbyt(fptr, naxis1, buffer, status); /* read the bytes */ ffmbyt(fptr, insertpos, IGNORE_EOF, status); ffpbyt(fptr, naxis1, buffer, status); /* write the bytes */ if (*status > 0) { ffpmsg("failed to copy remaining rows in table (ffdrws)"); free(buffer); return(*status); } insertpos += naxis1; nextrowpos += naxis1; nextrow++; } free(buffer); /* now delete the empty rows at the end of the table */ ffdrow(fptr, naxis2 - nrows + 1, nrows, status); /* Update the heap data, if any. This will remove any orphaned data */ /* that was only pointed to by the rows that have been deleted */ ffcmph(fptr, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffrwrg( char *rowlist, /* I - list of rows and row ranges */ LONGLONG maxrows, /* I - number of rows in the table */ int maxranges, /* I - max number of ranges to be returned */ int *numranges, /* O - number ranges returned */ long *minrow, /* O - first row in each range */ long *maxrow, /* O - last row in each range */ int *status) /* IO - status value */ { /* parse the input list of row ranges, returning the number of ranges, and the min and max row value in each range. The only characters allowed in the input rowlist are decimal digits, minus sign, and comma (and non-significant spaces) Example: list = "10-20, 30-35,50" would return numranges = 3, minrow[] = {10, 30, 50}, maxrow[] = {20, 35, 50} error is returned if min value of range is > max value of range or if the ranges are not monotonically increasing. */ char *next; long minval, maxval; if (*status > 0) return(*status); if (maxrows <= 0 ) { *status = RANGE_PARSE_ERROR; ffpmsg("Input maximum range value is <= 0 (fits_parse_ranges)"); return(*status); } next = rowlist; *numranges = 0; while (*next == ' ')next++; /* skip spaces */ while (*next != '\0') { /* find min value of next range; *next must be '-' or a digit */ if (*next == '-') { minval = 1; /* implied minrow value = 1 */ } else if ( isdigit((int) *next) ) { minval = strtol(next, &next, 10); } else { *status = RANGE_PARSE_ERROR; ffpmsg("Syntax error in this row range list:"); ffpmsg(rowlist); return(*status); } while (*next == ' ')next++; /* skip spaces */ /* find max value of next range; *next must be '-', or ',' */ if (*next == '-') { next++; while (*next == ' ')next++; /* skip spaces */ if ( isdigit((int) *next) ) { maxval = strtol(next, &next, 10); } else if (*next == ',' || *next == '\0') { maxval = (long) maxrows; /* implied max value */ } else { *status = RANGE_PARSE_ERROR; ffpmsg("Syntax error in this row range list:"); ffpmsg(rowlist); return(*status); } } else if (*next == ',' || *next == '\0') { maxval = minval; /* only a single integer in this range */ } else { *status = RANGE_PARSE_ERROR; ffpmsg("Syntax error in this row range list:"); ffpmsg(rowlist); return(*status); } if (*numranges + 1 > maxranges) { *status = RANGE_PARSE_ERROR; ffpmsg("Overflowed maximum number of ranges (fits_parse_ranges)"); return(*status); } if (minval < 1 ) { *status = RANGE_PARSE_ERROR; ffpmsg("Syntax error in this row range list: row number < 1"); ffpmsg(rowlist); return(*status); } if (maxval < minval) { *status = RANGE_PARSE_ERROR; ffpmsg("Syntax error in this row range list: min > max"); ffpmsg(rowlist); return(*status); } if (*numranges > 0) { if (minval <= maxrow[(*numranges) - 1]) { *status = RANGE_PARSE_ERROR; ffpmsg("Syntax error in this row range list. Range minimum is"); ffpmsg(" less than or equal to previous range maximum"); ffpmsg(rowlist); return(*status); } } if (minval <= maxrows) { /* ignore range if greater than maxrows */ if (maxval > maxrows) maxval = (long) maxrows; minrow[*numranges] = minval; maxrow[*numranges] = maxval; (*numranges)++; } while (*next == ' ')next++; /* skip spaces */ if (*next == ',') { next++; while (*next == ' ')next++; /* skip more spaces */ } } if (*numranges == 0) { /* a null string was entered */ minrow[0] = 1; maxrow[0] = (long) maxrows; *numranges = 1; } return(*status); } /*--------------------------------------------------------------------------*/ int ffrwrgll( char *rowlist, /* I - list of rows and row ranges */ LONGLONG maxrows, /* I - number of rows in the list */ int maxranges, /* I - max number of ranges to be returned */ int *numranges, /* O - number ranges returned */ LONGLONG *minrow, /* O - first row in each range */ LONGLONG *maxrow, /* O - last row in each range */ int *status) /* IO - status value */ { /* parse the input list of row ranges, returning the number of ranges, and the min and max row value in each range. The only characters allowed in the input rowlist are decimal digits, minus sign, and comma (and non-significant spaces) Example: list = "10-20, 30-35,50" would return numranges = 3, minrow[] = {10, 30, 50}, maxrow[] = {20, 35, 50} error is returned if min value of range is > max value of range or if the ranges are not monotonically increasing. */ char *next; LONGLONG minval, maxval; double dvalue; if (*status > 0) return(*status); if (maxrows <= 0 ) { *status = RANGE_PARSE_ERROR; ffpmsg("Input maximum range value is <= 0 (fits_parse_ranges)"); return(*status); } next = rowlist; *numranges = 0; while (*next == ' ')next++; /* skip spaces */ while (*next != '\0') { /* find min value of next range; *next must be '-' or a digit */ if (*next == '-') { minval = 1; /* implied minrow value = 1 */ } else if ( isdigit((int) *next) ) { /* read as a double, because the string to LONGLONG function */ /* is platform dependent (strtoll, strtol, _atoI64) */ dvalue = strtod(next, &next); minval = (LONGLONG) (dvalue + 0.1); } else { *status = RANGE_PARSE_ERROR; ffpmsg("Syntax error in this row range list:"); ffpmsg(rowlist); return(*status); } while (*next == ' ')next++; /* skip spaces */ /* find max value of next range; *next must be '-', or ',' */ if (*next == '-') { next++; while (*next == ' ')next++; /* skip spaces */ if ( isdigit((int) *next) ) { /* read as a double, because the string to LONGLONG function */ /* is platform dependent (strtoll, strtol, _atoI64) */ dvalue = strtod(next, &next); maxval = (LONGLONG) (dvalue + 0.1); } else if (*next == ',' || *next == '\0') { maxval = maxrows; /* implied max value */ } else { *status = RANGE_PARSE_ERROR; ffpmsg("Syntax error in this row range list:"); ffpmsg(rowlist); return(*status); } } else if (*next == ',' || *next == '\0') { maxval = minval; /* only a single integer in this range */ } else { *status = RANGE_PARSE_ERROR; ffpmsg("Syntax error in this row range list:"); ffpmsg(rowlist); return(*status); } if (*numranges + 1 > maxranges) { *status = RANGE_PARSE_ERROR; ffpmsg("Overflowed maximum number of ranges (fits_parse_ranges)"); return(*status); } if (minval < 1 ) { *status = RANGE_PARSE_ERROR; ffpmsg("Syntax error in this row range list: row number < 1"); ffpmsg(rowlist); return(*status); } if (maxval < minval) { *status = RANGE_PARSE_ERROR; ffpmsg("Syntax error in this row range list: min > max"); ffpmsg(rowlist); return(*status); } if (*numranges > 0) { if (minval <= maxrow[(*numranges) - 1]) { *status = RANGE_PARSE_ERROR; ffpmsg("Syntax error in this row range list. Range minimum is"); ffpmsg(" less than or equal to previous range maximum"); ffpmsg(rowlist); return(*status); } } if (minval <= maxrows) { /* ignore range if greater than maxrows */ if (maxval > maxrows) maxval = maxrows; minrow[*numranges] = minval; maxrow[*numranges] = maxval; (*numranges)++; } while (*next == ' ')next++; /* skip spaces */ if (*next == ',') { next++; while (*next == ' ')next++; /* skip more spaces */ } } if (*numranges == 0) { /* a null string was entered */ minrow[0] = 1; maxrow[0] = maxrows; *numranges = 1; } return(*status); } /*--------------------------------------------------------------------------*/ int fficol(fitsfile *fptr, /* I - FITS file pointer */ int numcol, /* I - position for new col. (1 = 1st) */ char *ttype, /* I - name of column (TTYPE keyword) */ char *tform, /* I - format of column (TFORM keyword) */ int *status) /* IO - error status */ /* Insert a new column into an existing table at position numcol. If numcol is greater than the number of existing columns in the table then the new column will be appended as the last column in the table. */ { char *name, *format; name = ttype; format = tform; fficls(fptr, numcol, 1, &name, &format, status); return(*status); } /*--------------------------------------------------------------------------*/ int fficls(fitsfile *fptr, /* I - FITS file pointer */ int fstcol, /* I - position for first new col. (1 = 1st) */ int ncols, /* I - number of columns to insert */ char **ttype, /* I - array of column names(TTYPE keywords) */ char **tform, /* I - array of formats of column (TFORM) */ int *status) /* IO - error status */ /* Insert 1 or more new columns into an existing table at position numcol. If fstcol is greater than the number of existing columns in the table then the new column will be appended as the last column in the table. */ { int colnum, datacode, decims, tfields, tstatus, ii; LONGLONG datasize, firstbyte, nbytes, nadd, naxis1, naxis2, freespace; LONGLONG tbcol, firstcol, delbyte; long nblock, width, repeat; char tfm[FLEN_VALUE], keyname[FLEN_KEYWORD], comm[FLEN_COMMENT], *cptr; tcolumn *colptr; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) { ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); } /* rescan header if data structure is undefined */ else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) { ffpmsg("Can only add columns to TABLE or BINTABLE extension (fficls)"); return(*status = NOT_TABLE); } /* is the column number valid? */ tfields = (fptr->Fptr)->tfield; if (fstcol < 1 ) return(*status = BAD_COL_NUM); else if (fstcol > tfields) colnum = tfields + 1; /* append as last column */ else colnum = fstcol; /* parse the tform value and calc number of bytes to add to each row */ delbyte = 0; for (ii = 0; ii < ncols; ii++) { if (strlen(tform[ii]) > FLEN_VALUE-1) { ffpmsg("Column format string too long (fficls)"); return (*status=BAD_TFORM); } strcpy(tfm, tform[ii]); ffupch(tfm); /* make sure format is in upper case */ if ((fptr->Fptr)->hdutype == ASCII_TBL) { ffasfm(tfm, &datacode, &width, &decims, status); delbyte += width + 1; /* add one space between the columns */ } else { ffbnfm(tfm, &datacode, &repeat, &width, status); if (datacode < 0) { /* variable length array column */ if (strchr(tfm, 'Q')) delbyte += 16; else delbyte += 8; } else if (datacode == 1) /* bit column; round up */ delbyte += (repeat + 7) / 8; /* to multiple of 8 bits */ else if (datacode == 16) /* ASCII string column */ delbyte += repeat; else /* numerical data type */ delbyte += (datacode / 10) * repeat; } } if (*status > 0) return(*status); /* get the current size of the table */ /* use internal structure since NAXIS2 keyword may not be up to date */ naxis1 = (fptr->Fptr)->rowlength; naxis2 = (fptr->Fptr)->numrows; /* current size of data */ datasize = (fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize; freespace = ( ( (datasize + 2879) / 2880) * 2880) - datasize; nadd = delbyte * naxis2; /* no. of bytes to add to table */ if ( (freespace - nadd) < 0) /* not enough existing space? */ { nblock = (long) ((nadd - freespace + 2879) / 2880); /* number of blocks */ if (ffiblk(fptr, nblock, 1, status) > 0) /* insert the blocks */ return(*status); } /* shift heap down (if it exists) */ if ((fptr->Fptr)->heapsize > 0) { nbytes = (fptr->Fptr)->heapsize; /* no. of bytes to shift down */ /* absolute heap pos */ firstbyte = (fptr->Fptr)->datastart + (fptr->Fptr)->heapstart; if (ffshft(fptr, firstbyte, nbytes, nadd, status) > 0) /* move heap */ return(*status); } /* update the heap starting address */ (fptr->Fptr)->heapstart += nadd; /* update the THEAP keyword if it exists */ tstatus = 0; ffmkyj(fptr, "THEAP", (fptr->Fptr)->heapstart, "&", &tstatus); /* calculate byte position in the row where to insert the new column */ if (colnum > tfields) firstcol = naxis1; else { colptr = (fptr->Fptr)->tableptr; colptr += (colnum - 1); firstcol = colptr->tbcol; } /* insert delbyte bytes in every row, at byte position firstcol */ ffcins(fptr, naxis1, naxis2, delbyte, firstcol, status); if ((fptr->Fptr)->hdutype == ASCII_TBL) { /* adjust the TBCOL values of the existing columns */ for(ii = 0; ii < tfields; ii++) { ffkeyn("TBCOL", ii + 1, keyname, status); ffgkyjj(fptr, keyname, &tbcol, comm, status); if (tbcol > firstcol) { tbcol += delbyte; ffmkyj(fptr, keyname, tbcol, "&", status); } } } /* update the mandatory keywords */ ffmkyj(fptr, "TFIELDS", tfields + ncols, "&", status); ffmkyj(fptr, "NAXIS1", naxis1 + delbyte, "&", status); /* increment the index value on any existing column keywords */ if(colnum <= tfields) ffkshf(fptr, colnum, tfields, ncols, status); /* add the required keywords for the new columns */ for (ii = 0; ii < ncols; ii++, colnum++) { strcpy(comm, "label for field"); ffkeyn("TTYPE", colnum, keyname, status); ffpkys(fptr, keyname, ttype[ii], comm, status); strcpy(comm, "format of field"); strcpy(tfm, tform[ii]); ffupch(tfm); /* make sure format is in upper case */ ffkeyn("TFORM", colnum, keyname, status); if (abs(datacode) == TSBYTE) { /* Replace the 'S' with an 'B' in the TFORMn code */ cptr = tfm; while (*cptr != 'S') cptr++; *cptr = 'B'; ffpkys(fptr, keyname, tfm, comm, status); /* write the TZEROn and TSCALn keywords */ ffkeyn("TZERO", colnum, keyname, status); strcpy(comm, "offset for signed bytes"); ffpkyg(fptr, keyname, -128., 0, comm, status); ffkeyn("TSCAL", colnum, keyname, status); strcpy(comm, "data are not scaled"); ffpkyg(fptr, keyname, 1., 0, comm, status); } else if (abs(datacode) == TUSHORT) { /* Replace the 'U' with an 'I' in the TFORMn code */ cptr = tfm; while (*cptr != 'U') cptr++; *cptr = 'I'; ffpkys(fptr, keyname, tfm, comm, status); /* write the TZEROn and TSCALn keywords */ ffkeyn("TZERO", colnum, keyname, status); strcpy(comm, "offset for unsigned integers"); ffpkyg(fptr, keyname, 32768., 0, comm, status); ffkeyn("TSCAL", colnum, keyname, status); strcpy(comm, "data are not scaled"); ffpkyg(fptr, keyname, 1., 0, comm, status); } else if (abs(datacode) == TULONG) { /* Replace the 'V' with an 'J' in the TFORMn code */ cptr = tfm; while (*cptr != 'V') cptr++; *cptr = 'J'; ffpkys(fptr, keyname, tfm, comm, status); /* write the TZEROn and TSCALn keywords */ ffkeyn("TZERO", colnum, keyname, status); strcpy(comm, "offset for unsigned integers"); ffpkyg(fptr, keyname, 2147483648., 0, comm, status); ffkeyn("TSCAL", colnum, keyname, status); strcpy(comm, "data are not scaled"); ffpkyg(fptr, keyname, 1., 0, comm, status); } else { ffpkys(fptr, keyname, tfm, comm, status); } if ((fptr->Fptr)->hdutype == ASCII_TBL) /* write the TBCOL keyword */ { if (colnum == tfields + 1) tbcol = firstcol + 2; /* allow space between preceding col */ else tbcol = firstcol + 1; strcpy(comm, "beginning column of field"); ffkeyn("TBCOL", colnum, keyname, status); ffpkyj(fptr, keyname, tbcol, comm, status); /* increment the column starting position for the next column */ ffasfm(tfm, &datacode, &width, &decims, status); firstcol += width + 1; /* add one space between the columns */ } } ffrdef(fptr, status); /* initialize the new table structure */ return(*status); } /*--------------------------------------------------------------------------*/ int ffmvec(fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - position of col to be modified */ LONGLONG newveclen, /* I - new vector length of column (TFORM) */ int *status) /* IO - error status */ /* Modify the vector length of a column in a binary table, larger or smaller. E.g., change a column from TFORMn = '1E' to '20E'. */ { int datacode, tfields, tstatus; LONGLONG datasize, size, firstbyte, nbytes, nadd, ndelete; LONGLONG naxis1, naxis2, firstcol, freespace; LONGLONG width, delbyte, repeat; long nblock; char tfm[FLEN_VALUE], keyname[FLEN_KEYWORD], tcode[2]; tcolumn *colptr; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) { ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); } /* rescan header if data structure is undefined */ else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) return(*status); if ((fptr->Fptr)->hdutype != BINARY_TBL) { ffpmsg( "Can only change vector length of a column in BINTABLE extension (ffmvec)"); return(*status = NOT_TABLE); } /* is the column number valid? */ tfields = (fptr->Fptr)->tfield; if (colnum < 1 || colnum > tfields) return(*status = BAD_COL_NUM); /* look up the current vector length and element width */ colptr = (fptr->Fptr)->tableptr; colptr += (colnum - 1); datacode = colptr->tdatatype; /* datatype of the column */ repeat = colptr->trepeat; /* field repeat count */ width = colptr->twidth; /* width of a single element in chars */ if (datacode < 0) { ffpmsg( "Can't modify vector length of variable length column (ffmvec)"); return(*status = BAD_TFORM); } if (repeat == newveclen) return(*status); /* column already has the desired vector length */ if (datacode == TSTRING) width = 1; /* width was equal to width of unit string */ naxis1 = (fptr->Fptr)->rowlength; /* current width of the table */ naxis2 = (fptr->Fptr)->numrows; delbyte = (newveclen - repeat) * width; /* no. of bytes to insert */ if (datacode == TBIT) /* BIT column is a special case */ delbyte = ((newveclen + 7) / 8) - ((repeat + 7) / 8); if (delbyte > 0) /* insert space for more elements */ { /* current size of data */ datasize = (fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize; freespace = ( ( (datasize + 2879) / 2880) * 2880) - datasize; nadd = (LONGLONG)delbyte * naxis2; /* no. of bytes to add to table */ if ( (freespace - nadd) < 0) /* not enough existing space? */ { nblock = (long) ((nadd - freespace + 2879) / 2880); /* number of blocks */ if (ffiblk(fptr, nblock, 1, status) > 0) /* insert the blocks */ return(*status); } /* shift heap down (if it exists) */ if ((fptr->Fptr)->heapsize > 0) { nbytes = (fptr->Fptr)->heapsize; /* no. of bytes to shift down */ /* absolute heap pos */ firstbyte = (fptr->Fptr)->datastart + (fptr->Fptr)->heapstart; if (ffshft(fptr, firstbyte, nbytes, nadd, status) > 0) /* move heap */ return(*status); } /* update the heap starting address */ (fptr->Fptr)->heapstart += nadd; /* update the THEAP keyword if it exists */ tstatus = 0; ffmkyj(fptr, "THEAP", (fptr->Fptr)->heapstart, "&", &tstatus); /* Must reset colptr before using it again. (fptr->Fptr)->tableptr may have been reallocated down in ffbinit via the call to ffiblk above.*/ colptr = (fptr->Fptr)->tableptr; colptr += (colnum - 1); firstcol = colptr->tbcol + (repeat * width); /* insert position */ /* insert delbyte bytes in every row, at byte position firstcol */ ffcins(fptr, naxis1, naxis2, delbyte, firstcol, status); } else if (delbyte < 0) { /* current size of table */ size = (fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize; freespace = ((size + 2879) / 2880) * 2880 - size - ((LONGLONG)delbyte * naxis2); nblock = (long) (freespace / 2880); /* number of empty blocks to delete */ firstcol = colptr->tbcol + (newveclen * width); /* delete position */ /* delete elements from the vector */ ffcdel(fptr, naxis1, naxis2, -delbyte, firstcol, status); /* abs heap pos */ firstbyte = (fptr->Fptr)->datastart + (fptr->Fptr)->heapstart; ndelete = (LONGLONG)delbyte * naxis2; /* size of shift (negative) */ /* shift heap up (if it exists) */ if ((fptr->Fptr)->heapsize > 0) { nbytes = (fptr->Fptr)->heapsize; /* no. of bytes to shift up */ if (ffshft(fptr, firstbyte, nbytes, ndelete, status) > 0) return(*status); } /* delete the empty blocks at the end of the HDU */ if (nblock > 0) ffdblk(fptr, nblock, status); /* update the heap starting address */ (fptr->Fptr)->heapstart += ndelete; /* ndelete is negative */ /* update the THEAP keyword if it exists */ tstatus = 0; ffmkyj(fptr, "THEAP", (fptr->Fptr)->heapstart, "&", &tstatus); } /* construct the new TFORM keyword for the column */ if (datacode == TBIT) strcpy(tcode,"X"); else if (datacode == TBYTE) strcpy(tcode,"B"); else if (datacode == TLOGICAL) strcpy(tcode,"L"); else if (datacode == TSTRING) strcpy(tcode,"A"); else if (datacode == TSHORT) strcpy(tcode,"I"); else if (datacode == TLONG) strcpy(tcode,"J"); else if (datacode == TLONGLONG) strcpy(tcode,"K"); else if (datacode == TFLOAT) strcpy(tcode,"E"); else if (datacode == TDOUBLE) strcpy(tcode,"D"); else if (datacode == TCOMPLEX) strcpy(tcode,"C"); else if (datacode == TDBLCOMPLEX) strcpy(tcode,"M"); /* write as a double value because the LONGLONG conversion */ /* character in snprintf is platform dependent ( %lld, %ld, %I64d ) */ snprintf(tfm,FLEN_VALUE,"%.0f%s",(double) newveclen, tcode); ffkeyn("TFORM", colnum, keyname, status); /* Keyword name */ ffmkys(fptr, keyname, tfm, "&", status); /* modify TFORM keyword */ ffmkyj(fptr, "NAXIS1", naxis1 + delbyte, "&", status); /* modify NAXIS1 */ ffrdef(fptr, status); /* reinitialize the new table structure */ return(*status); } /*--------------------------------------------------------------------------*/ int ffcpcl(fitsfile *infptr, /* I - FITS file pointer to input file */ fitsfile *outfptr, /* I - FITS file pointer to output file */ int incol, /* I - number of input column */ int outcol, /* I - number for output column */ int create_col, /* I - create new col if TRUE, else overwrite */ int *status) /* IO - error status */ /* copy a column from infptr and insert it in the outfptr table. */ { int tstatus, colnum, typecode, otypecode, anynull; int inHduType, outHduType; long tfields, repeat, orepeat, width, owidth, nrows, outrows; long inloop, outloop, maxloop, ndone, ntodo, npixels; long firstrow, firstelem, ii; char keyname[FLEN_KEYWORD], ttype[FLEN_VALUE], tform[FLEN_VALUE]; char ttype_comm[FLEN_COMMENT],tform_comm[FLEN_COMMENT]; char *lvalues = 0, nullflag, **strarray = 0; char nulstr[] = {'\5', '\0'}; /* unique null string value */ double dnull = 0.l, *dvalues = 0; float fnull = 0., *fvalues = 0; if (*status > 0) return(*status); if (infptr->HDUposition != (infptr->Fptr)->curhdu) { ffmahd(infptr, (infptr->HDUposition) + 1, NULL, status); } else if ((infptr->Fptr)->datastart == DATA_UNDEFINED) ffrdef(infptr, status); /* rescan header */ inHduType = (infptr->Fptr)->hdutype; if (outfptr->HDUposition != (outfptr->Fptr)->curhdu) { ffmahd(outfptr, (outfptr->HDUposition) + 1, NULL, status); } else if ((outfptr->Fptr)->datastart == DATA_UNDEFINED) ffrdef(outfptr, status); /* rescan header */ outHduType = (outfptr->Fptr)->hdutype; if (*status > 0) return(*status); if (inHduType == IMAGE_HDU || outHduType == IMAGE_HDU) { ffpmsg ("Can not copy columns to or from IMAGE HDUs (ffcpcl)"); return(*status = NOT_TABLE); } if ( inHduType == BINARY_TBL && outHduType == ASCII_TBL) { ffpmsg ("Copying from Binary table to ASCII table is not supported (ffcpcl)"); return(*status = NOT_BTABLE); } /* get the datatype and vector repeat length of the column */ ffgtcl(infptr, incol, &typecode, &repeat, &width, status); if (typecode < 0) { ffpmsg("Variable-length columns are not supported (ffcpcl)"); return(*status = BAD_TFORM); } if (create_col) /* insert new column in output table? */ { tstatus = 0; ffkeyn("TTYPE", incol, keyname, &tstatus); ffgkys(infptr, keyname, ttype, ttype_comm, &tstatus); ffkeyn("TFORM", incol, keyname, &tstatus); if (ffgkys(infptr, keyname, tform, tform_comm, &tstatus) ) { ffpmsg ("Could not find TTYPE and TFORM keywords in input table (ffcpcl)"); return(*status = NO_TFORM); } if (inHduType == ASCII_TBL && outHduType == BINARY_TBL) { /* convert from ASCII table to BINARY table format string */ if (typecode == TSTRING) ffnkey(width, "A", tform, status); else if (typecode == TLONG) strcpy(tform, "1J"); else if (typecode == TSHORT) strcpy(tform, "1I"); else if (typecode == TFLOAT) strcpy(tform,"1E"); else if (typecode == TDOUBLE) strcpy(tform,"1D"); } if (ffgkyj(outfptr, "TFIELDS", &tfields, 0, &tstatus)) { ffpmsg ("Could not read TFIELDS keyword in output table (ffcpcl)"); return(*status = NO_TFIELDS); } colnum = minvalue((int) tfields + 1, outcol); /* output col. number */ /* create the empty column */ if (fficol(outfptr, colnum, ttype, tform, status) > 0) { ffpmsg ("Could not append new column to output file (ffcpcl)"); return(*status); } if ((infptr->Fptr == outfptr->Fptr) && (infptr->HDUposition == outfptr->HDUposition) && (colnum <= incol)) { incol++; /* the input column has been shifted over */ } /* copy the comment strings from the input file for TTYPE and TFORM */ tstatus = 0; ffkeyn("TTYPE", colnum, keyname, &tstatus); ffmcom(outfptr, keyname, ttype_comm, &tstatus); ffkeyn("TFORM", colnum, keyname, &tstatus); ffmcom(outfptr, keyname, tform_comm, &tstatus); /* copy other column-related keywords if they exist */ ffcpky(infptr, outfptr, incol, colnum, "TUNIT", status); ffcpky(infptr, outfptr, incol, colnum, "TSCAL", status); ffcpky(infptr, outfptr, incol, colnum, "TZERO", status); ffcpky(infptr, outfptr, incol, colnum, "TDISP", status); ffcpky(infptr, outfptr, incol, colnum, "TLMIN", status); ffcpky(infptr, outfptr, incol, colnum, "TLMAX", status); ffcpky(infptr, outfptr, incol, colnum, "TDIM", status); /* WCS keywords */ ffcpky(infptr, outfptr, incol, colnum, "TCTYP", status); ffcpky(infptr, outfptr, incol, colnum, "TCUNI", status); ffcpky(infptr, outfptr, incol, colnum, "TCRVL", status); ffcpky(infptr, outfptr, incol, colnum, "TCRPX", status); ffcpky(infptr, outfptr, incol, colnum, "TCDLT", status); ffcpky(infptr, outfptr, incol, colnum, "TCROT", status); if (inHduType == ASCII_TBL && outHduType == BINARY_TBL) { /* binary tables only have TNULLn keyword for integer columns */ if (typecode == TLONG || typecode == TSHORT) { /* check if null string is defined; replace with integer */ ffkeyn("TNULL", incol, keyname, &tstatus); if (ffgkys(infptr, keyname, ttype, 0, &tstatus) <= 0) { ffkeyn("TNULL", colnum, keyname, &tstatus); if (typecode == TLONG) ffpkyj(outfptr, keyname, -9999999L, "Null value", status); else ffpkyj(outfptr, keyname, -32768L, "Null value", status); } } } else { ffcpky(infptr, outfptr, incol, colnum, "TNULL", status); } /* rescan header to recognize the new keywords */ if (ffrdef(outfptr, status) ) return(*status); } else { colnum = outcol; /* get the datatype and vector repeat length of the output column */ ffgtcl(outfptr, outcol, &otypecode, &orepeat, &owidth, status); if (orepeat != repeat) { ffpmsg("Input and output vector columns must have same length (ffcpcl)"); return(*status = BAD_TFORM); } } ffgkyj(infptr, "NAXIS2", &nrows, 0, status); /* no. of input rows */ ffgkyj(outfptr, "NAXIS2", &outrows, 0, status); /* no. of output rows */ nrows = minvalue(nrows, outrows); if (typecode == TBIT) repeat = (repeat + 7) / 8; /* convert from bits to bytes */ else if (typecode == TSTRING && inHduType == BINARY_TBL) repeat = repeat / width; /* convert from chars to unit strings */ /* get optimum number of rows to copy at one time */ ffgrsz(infptr, &inloop, status); ffgrsz(outfptr, &outloop, status); /* adjust optimum number, since 2 tables are open at once */ maxloop = minvalue(inloop, outloop); /* smallest of the 2 tables */ maxloop = maxvalue(1, maxloop / 2); /* at least 1 row */ maxloop = minvalue(maxloop, nrows); /* max = nrows to be copied */ maxloop *= repeat; /* mult by no of elements in a row */ /* allocate memory for arrays */ if (typecode == TLOGICAL) { lvalues = (char *) calloc(maxloop, sizeof(char) ); if (!lvalues) { ffpmsg ("malloc failed to get memory for logicals (ffcpcl)"); return(*status = ARRAY_TOO_BIG); } } else if (typecode == TSTRING) { /* allocate array of pointers */ strarray = (char **) calloc(maxloop, sizeof(strarray)); /* allocate space for each string */ for (ii = 0; ii < maxloop; ii++) strarray[ii] = (char *) calloc(width+1, sizeof(char)); } else if (typecode == TCOMPLEX) { fvalues = (float *) calloc(maxloop * 2, sizeof(float) ); if (!fvalues) { ffpmsg ("malloc failed to get memory for complex (ffcpcl)"); return(*status = ARRAY_TOO_BIG); } fnull = 0.; } else if (typecode == TDBLCOMPLEX) { dvalues = (double *) calloc(maxloop * 2, sizeof(double) ); if (!dvalues) { ffpmsg ("malloc failed to get memory for dbl complex (ffcpcl)"); return(*status = ARRAY_TOO_BIG); } dnull = 0.; } else /* numerical datatype; read them all as doubles */ { dvalues = (double *) calloc(maxloop, sizeof(double) ); if (!dvalues) { ffpmsg ("malloc failed to get memory for doubles (ffcpcl)"); return(*status = ARRAY_TOO_BIG); } dnull = -9.99991999E31; /* use an unlikely value for nulls */ } npixels = nrows * repeat; /* total no. of pixels to copy */ ntodo = minvalue(npixels, maxloop); /* no. to copy per iteration */ ndone = 0; /* total no. of pixels that have been copied */ while (ntodo) /* iterate through the table */ { firstrow = ndone / repeat + 1; firstelem = ndone - ((firstrow - 1) * repeat) + 1; /* read from input table */ if (typecode == TLOGICAL) ffgcl(infptr, incol, firstrow, firstelem, ntodo, lvalues, status); else if (typecode == TSTRING) ffgcvs(infptr, incol, firstrow, firstelem, ntodo, nulstr, strarray, &anynull, status); else if (typecode == TCOMPLEX) ffgcvc(infptr, incol, firstrow, firstelem, ntodo, fnull, fvalues, &anynull, status); else if (typecode == TDBLCOMPLEX) ffgcvm(infptr, incol, firstrow, firstelem, ntodo, dnull, dvalues, &anynull, status); else /* all numerical types */ ffgcvd(infptr, incol, firstrow, firstelem, ntodo, dnull, dvalues, &anynull, status); if (*status > 0) { ffpmsg("Error reading input copy of column (ffcpcl)"); break; } /* write to output table */ if (typecode == TLOGICAL) { nullflag = 2; ffpcnl(outfptr, colnum, firstrow, firstelem, ntodo, lvalues, nullflag, status); } else if (typecode == TSTRING) { if (anynull) ffpcns(outfptr, colnum, firstrow, firstelem, ntodo, strarray, nulstr, status); else ffpcls(outfptr, colnum, firstrow, firstelem, ntodo, strarray, status); } else if (typecode == TCOMPLEX) { /* doesn't support writing nulls */ ffpclc(outfptr, colnum, firstrow, firstelem, ntodo, fvalues, status); } else if (typecode == TDBLCOMPLEX) { /* doesn't support writing nulls */ ffpclm(outfptr, colnum, firstrow, firstelem, ntodo, dvalues, status); } else /* all other numerical types */ { if (anynull) ffpcnd(outfptr, colnum, firstrow, firstelem, ntodo, dvalues, dnull, status); else ffpcld(outfptr, colnum, firstrow, firstelem, ntodo, dvalues, status); } if (*status > 0) { ffpmsg("Error writing output copy of column (ffcpcl)"); break; } npixels -= ntodo; ndone += ntodo; ntodo = minvalue(npixels, maxloop); } /* free the previously allocated memory */ if (typecode == TLOGICAL) { free(lvalues); } else if (typecode == TSTRING) { for (ii = 0; ii < maxloop; ii++) free(strarray[ii]); free(strarray); } else { free(dvalues); } return(*status); } /*--------------------------------------------------------------------------*/ int ffccls(fitsfile *infptr, /* I - FITS file pointer to input file */ fitsfile *outfptr, /* I - FITS file pointer to output file */ int incol, /* I - number of first input column */ int outcol, /* I - number for first output column */ int ncols, /* I - number of columns to copy from input to output */ int create_col, /* I - create new col if TRUE, else overwrite */ int *status) /* IO - error status */ /* copy multiple columns from infptr and insert them in the outfptr table. Optimized for multiple-column case since it only expands the output file once using fits_insert_cols() instead of calling fits_insert_col() multiple times. */ { int tstatus, colnum, typecode, otypecode, anynull; int inHduType, outHduType; long tfields, repeat, orepeat, width, owidth, nrows, outrows; long inloop, outloop, maxloop, ndone, ntodo, npixels; long firstrow, firstelem, ii; char keyname[FLEN_KEYWORD], ttype[FLEN_VALUE], tform[FLEN_VALUE]; char ttype_comm[FLEN_COMMENT],tform_comm[FLEN_COMMENT]; char *lvalues = 0, nullflag, **strarray = 0; char nulstr[] = {'\5', '\0'}; /* unique null string value */ double dnull = 0.l, *dvalues = 0; float fnull = 0., *fvalues = 0; int typecodes[1000]; char *ttypes[1000], *tforms[1000], keyarr[1001][FLEN_CARD]; int ikey = 0; int icol, incol1, outcol1; if (*status > 0) return(*status); if (infptr->HDUposition != (infptr->Fptr)->curhdu) { ffmahd(infptr, (infptr->HDUposition) + 1, NULL, status); } else if ((infptr->Fptr)->datastart == DATA_UNDEFINED) ffrdef(infptr, status); /* rescan header */ inHduType = (infptr->Fptr)->hdutype; if (outfptr->HDUposition != (outfptr->Fptr)->curhdu) { ffmahd(outfptr, (outfptr->HDUposition) + 1, NULL, status); } else if ((outfptr->Fptr)->datastart == DATA_UNDEFINED) ffrdef(outfptr, status); /* rescan header */ outHduType = (outfptr->Fptr)->hdutype; if (*status > 0) return(*status); if (inHduType == IMAGE_HDU || outHduType == IMAGE_HDU) { ffpmsg ("Can not copy columns to or from IMAGE HDUs (ffccls)"); return(*status = NOT_TABLE); } if ( (inHduType == BINARY_TBL && outHduType == ASCII_TBL) || (inHduType == ASCII_TBL && outHduType == BINARY_TBL) ) { ffpmsg ("Copying between Binary and ASCII tables is not supported (ffccls)"); return(*status = NOT_BTABLE); } /* Do not allow copying multiple columns in the same HDU because the permutations of possible overlapping copies is mind-bending */ if ((infptr->Fptr == outfptr->Fptr) && (infptr->HDUposition == outfptr->HDUposition)) { ffpmsg ("Copying multiple columns in same HDU is not supported (ffccls)"); return(*status = NOT_BTABLE); } /* Retrieve the number of columns in output file */ tstatus=0; if (ffgkyj(outfptr, "TFIELDS", &tfields, 0, &tstatus)) { ffpmsg ("Could not read TFIELDS keyword in output table (ffccls)"); return(*status = NO_TFIELDS); } colnum = minvalue((int) tfields + 1, outcol); /* output col. number */ /* Collect data about input column (type, repeat, etc) */ for (incol1 = incol, outcol1 = colnum, icol = 0; icol < ncols; icol++, incol1++, outcol1++) { ffgtcl(infptr, incol1, &typecode, &repeat, &width, status); if (typecode < 0) { ffpmsg("Variable-length columns are not supported (ffccls)"); return(*status = BAD_TFORM); } typecodes[icol] = typecode; tstatus = 0; ffkeyn("TTYPE", incol1, keyname, &tstatus); ffgkys(infptr, keyname, ttype, ttype_comm, &tstatus); ffkeyn("TFORM", incol1, keyname, &tstatus); if (ffgkys(infptr, keyname, tform, tform_comm, &tstatus) ) { ffpmsg ("Could not find TTYPE and TFORM keywords in input table (ffccls)"); return(*status = NO_TFORM); } /* If creating columns, we need to save these values */ if ( create_col ) { tforms[icol] = keyarr[ikey++]; ttypes[icol] = keyarr[ikey++]; strcpy(tforms[icol], tform); strcpy(ttypes[icol], ttype); } else { /* If not creating columns, then check the datatype and vector repeat length of the output column */ ffgtcl(outfptr, outcol1, &otypecode, &orepeat, &owidth, status); if (orepeat != repeat) { ffpmsg("Input and output vector columns must have same length (ffccls)"); return(*status = BAD_TFORM); } } } /* Insert columns into output file and copy all meta-data keywords, if requested */ if (create_col) { /* create the empty columns */ if (fficls(outfptr, colnum, ncols, ttypes, tforms, status) > 0) { ffpmsg ("Could not append new columns to output file (ffccls)"); return(*status); } /* Copy meta-data strings from input column to output */ for (incol1 = incol, outcol1 = colnum, icol = 0; icol < ncols; icol++, incol1++, outcol1++) { /* copy the comment strings from the input file for TTYPE and TFORM */ ffkeyn("TTYPE", incol1, keyname, status); ffgkys(infptr, keyname, ttype, ttype_comm, status); ffkeyn("TTYPE", outcol1, keyname, status); ffmcom(outfptr, keyname, ttype_comm, status); ffkeyn("TFORM", incol1, keyname, status); ffgkys(infptr, keyname, tform, tform_comm, status); ffkeyn("TFORM", outcol1, keyname, status); ffmcom(outfptr, keyname, tform_comm, status); /* copy other column-related keywords if they exist */ ffcpky(infptr, outfptr, incol1, outcol1, "TUNIT", status); ffcpky(infptr, outfptr, incol1, outcol1, "TSCAL", status); ffcpky(infptr, outfptr, incol1, outcol1, "TZERO", status); ffcpky(infptr, outfptr, incol1, outcol1, "TDISP", status); ffcpky(infptr, outfptr, incol1, outcol1, "TLMIN", status); ffcpky(infptr, outfptr, incol1, outcol1, "TLMAX", status); ffcpky(infptr, outfptr, incol1, outcol1, "TDIM", status); /* WCS keywords */ ffcpky(infptr, outfptr, incol1, outcol1, "TCTYP", status); ffcpky(infptr, outfptr, incol1, outcol1, "TCUNI", status); ffcpky(infptr, outfptr, incol1, outcol1, "TCRVL", status); ffcpky(infptr, outfptr, incol1, outcol1, "TCRPX", status); ffcpky(infptr, outfptr, incol1, outcol1, "TCDLT", status); ffcpky(infptr, outfptr, incol1, outcol1, "TCROT", status); ffcpky(infptr, outfptr, incol1, outcol1, "TNULL", status); } /* rescan header to recognize the new keywords */ if (ffrdef(outfptr, status) ) return(*status); } /* Copy columns using standard ffcpcl(); do this in a loop because the I/O-intensive column expanding is done */ for (incol1 = incol, outcol1 = colnum, icol = 0; icol < ncols; icol++, incol1++, outcol1++) { ffcpcl(infptr, outfptr, incol1, outcol1, 0, status); } return(*status); } /*--------------------------------------------------------------------------*/ int ffcprw(fitsfile *infptr, /* I - FITS file pointer to input file */ fitsfile *outfptr, /* I - FITS file pointer to output file */ LONGLONG firstrow, /* I - number of first row to copy (1 based) */ LONGLONG nrows, /* I - number of rows to copy */ int *status) /* IO - error status */ /* copy consecutive set of rows from infptr and append it in the outfptr table. */ { LONGLONG innaxis1, innaxis2, outnaxis1, outnaxis2, ii, jj, icol; LONGLONG iVarCol, inPos, outPos, nVarBytes, nVarAllocBytes = 0; unsigned char *buffer, *varColBuff=0; int nInVarCols=0, nOutVarCols=0, varColDiff=0; int *inVarCols=0, *outVarCols=0; long nNewBlocks; LONGLONG hrepeat=0, hoffset=0; tcolumn *colptr=0; if (*status > 0) return(*status); if (infptr->HDUposition != (infptr->Fptr)->curhdu) { ffmahd(infptr, (infptr->HDUposition) + 1, NULL, status); } else if ((infptr->Fptr)->datastart == DATA_UNDEFINED) ffrdef(infptr, status); /* rescan header */ if (outfptr->HDUposition != (outfptr->Fptr)->curhdu) { ffmahd(outfptr, (outfptr->HDUposition) + 1, NULL, status); } else if ((outfptr->Fptr)->datastart == DATA_UNDEFINED) ffrdef(outfptr, status); /* rescan header */ if (*status > 0) return(*status); if ((infptr->Fptr)->hdutype == IMAGE_HDU || (outfptr->Fptr)->hdutype == IMAGE_HDU) { ffpmsg ("Can not copy rows to or from IMAGE HDUs (ffcprw)"); return(*status = NOT_TABLE); } if ( ((infptr->Fptr)->hdutype == BINARY_TBL && (outfptr->Fptr)->hdutype == ASCII_TBL) || ((infptr->Fptr)->hdutype == ASCII_TBL && (outfptr->Fptr)->hdutype == BINARY_TBL) ) { ffpmsg ("Copying rows between Binary and ASCII tables is not supported (ffcprw)"); return(*status = NOT_BTABLE); } ffgkyjj(infptr, "NAXIS1", &innaxis1, 0, status); /* width of input rows */ ffgkyjj(infptr, "NAXIS2", &innaxis2, 0, status); /* no. of input rows */ ffgkyjj(outfptr, "NAXIS1", &outnaxis1, 0, status); /* width of output rows */ ffgkyjj(outfptr, "NAXIS2", &outnaxis2, 0, status); /* no. of output rows */ if (*status > 0) return(*status); if (outnaxis1 != innaxis1) { ffpmsg ("Input and output tables do not have same width (ffcprw)"); return(*status = BAD_ROW_WIDTH); } if (firstrow + nrows - 1 > innaxis2) { ffpmsg ("Not enough rows in input table to copy (ffcprw)"); return(*status = BAD_ROW_NUM); } if ((infptr->Fptr)->tfield != (outfptr->Fptr)->tfield) { ffpmsg ("Input and output tables do not have same number of columns (ffcprw)"); return(*status = BAD_COL_NUM); } /* allocate buffer to hold 1 row of data */ buffer = malloc( (size_t) innaxis1); if (!buffer) { ffpmsg ("Unable to allocate memory (ffcprw)"); return(*status = MEMORY_ALLOCATION); } inVarCols = malloc(infptr->Fptr->tfield*sizeof(int)); outVarCols = malloc(outfptr->Fptr->tfield*sizeof(int)); fffvcl(infptr, &nInVarCols, inVarCols, status); fffvcl(outfptr, &nOutVarCols, outVarCols, status); if (nInVarCols != nOutVarCols) varColDiff=1; else { for (ii=0; iiFptr)->tableptr; for (icol=0; icol<(infptr->Fptr)->tfield; ++icol) { if (iVarCol < nInVarCols && inVarCols[iVarCol] == icol+1) { /* Copy from a variable length column */ ffgdesll(infptr, icol+1, ii, &hrepeat, &hoffset, status); /* If this is a bit column, hrepeat will be number of bits, not bytes. If it is a string column, hrepeat is the number of bytes, twidth is the max col width and can be ignored.*/ if (colptr->tdatatype == -TBIT) { nVarBytes = (hrepeat+7)/8; } else if (colptr->tdatatype == -TSTRING) { nVarBytes = hrepeat; } else { nVarBytes = hrepeat*colptr->twidth*sizeof(char); } inPos = (infptr->Fptr)->datastart + (infptr->Fptr)->heapstart + hoffset; outPos = (outfptr->Fptr)->datastart + (outfptr->Fptr)->heapstart + (outfptr->Fptr)->heapsize; ffmbyt(infptr, inPos, REPORT_EOF, status); /* If this is not the last HDU in the file, then check if */ /* extending the heap would overwrite the following header. */ /* If so, then have to insert more blocks. */ if ( !((outfptr->Fptr)->lasthdu) ) { if (outPos+nVarBytes > (outfptr->Fptr)->headstart[(outfptr->Fptr)->curhdu+1]) { nNewBlocks = (long)(((outPos+nVarBytes - 1 - (outfptr->Fptr)->headstart[(outfptr->Fptr)-> curhdu+1]) / 2880) + 1); if (ffiblk(outfptr, nNewBlocks, 1, status) > 0) { ffpmsg("Failed to extend the size of the variable length heap (ffcprw)"); goto CLEANUP_RETURN; } } } if (nVarBytes) { if (nVarBytes > nVarAllocBytes) { /* Grow the copy buffer to accomodate the new maximum size. Note it is safe to call realloc() with null input pointer, which is equivalent to malloc(). */ unsigned char *varColBuff1 = (unsigned char *) realloc(varColBuff, nVarBytes); if (! varColBuff1) { *status = MEMORY_ALLOCATION; ffpmsg("failed to allocate memory for variable column copy (ffcprw)"); goto CLEANUP_RETURN; } /* Record the new state */ varColBuff = varColBuff1; nVarAllocBytes = nVarBytes; } /* Copy date from input to output */ ffgbyt(infptr, nVarBytes, varColBuff, status); ffmbyt(outfptr, outPos, IGNORE_EOF, status); ffpbyt(outfptr, nVarBytes, varColBuff, status); } ffpdes(outfptr, icol+1, jj, hrepeat, (outfptr->Fptr)->heapsize, status); (outfptr->Fptr)->heapsize += nVarBytes; ++iVarCol; } ++colptr; } ++jj; } } else { /* copy the rows, 1 at a time */ for (ii = firstrow; ii < firstrow + nrows; ii++) { fits_read_tblbytes (infptr, ii, 1, innaxis1, buffer, status); fits_write_tblbytes(outfptr, jj, 1, innaxis1, buffer, status); jj++; } } outnaxis2 += nrows; fits_update_key(outfptr, TLONGLONG, "NAXIS2", &outnaxis2, 0, status); CLEANUP_RETURN: free(buffer); free(inVarCols); free(outVarCols); if (varColBuff) free(varColBuff); return(*status); } /*--------------------------------------------------------------------------*/ int ffcpky(fitsfile *infptr, /* I - FITS file pointer to input file */ fitsfile *outfptr, /* I - FITS file pointer to output file */ int incol, /* I - input index number */ int outcol, /* I - output index number */ char *rootname, /* I - root name of the keyword to be copied */ int *status) /* IO - error status */ /* copy an indexed keyword from infptr to outfptr. */ { int tstatus = 0; char keyname[FLEN_KEYWORD]; char value[FLEN_VALUE], comment[FLEN_COMMENT], card[FLEN_CARD]; ffkeyn(rootname, incol, keyname, &tstatus); if (ffgkey(infptr, keyname, value, comment, &tstatus) <= 0) { ffkeyn(rootname, outcol, keyname, &tstatus); ffmkky(keyname, value, comment, card, status); ffprec(outfptr, card, status); } return(*status); } /*--------------------------------------------------------------------------*/ int ffdcol(fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column to delete (1 = 1st) */ int *status) /* IO - error status */ /* Delete a column from a table. */ { int ii, tstatus; LONGLONG firstbyte, size, ndelete, nbytes, naxis1, naxis2, firstcol, delbyte, freespace; LONGLONG tbcol; long nblock, nspace; char keyname[FLEN_KEYWORD], comm[FLEN_COMMENT]; tcolumn *colptr, *nextcol; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) { ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); } /* rescan header if data structure is undefined */ else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) { ffpmsg ("Can only delete column from TABLE or BINTABLE extension (ffdcol)"); return(*status = NOT_TABLE); } if (colnum < 1 || colnum > (fptr->Fptr)->tfield ) return(*status = BAD_COL_NUM); colptr = (fptr->Fptr)->tableptr; colptr += (colnum - 1); firstcol = colptr->tbcol; /* starting byte position of the column */ /* use column width to determine how many bytes to delete in each row */ if ((fptr->Fptr)->hdutype == ASCII_TBL) { delbyte = colptr->twidth; /* width of ASCII column */ if (colnum < (fptr->Fptr)->tfield) /* check for space between next column */ { nextcol = colptr + 1; nspace = (long) ((nextcol->tbcol) - (colptr->tbcol) - delbyte); if (nspace > 0) delbyte++; } else if (colnum > 1) /* check for space between last 2 columns */ { nextcol = colptr - 1; nspace = (long) ((colptr->tbcol) - (nextcol->tbcol) - (nextcol->twidth)); if (nspace > 0) { delbyte++; firstcol--; /* delete the leading space */ } } } else /* a binary table */ { if (colnum < (fptr->Fptr)->tfield) { nextcol = colptr + 1; delbyte = (nextcol->tbcol) - (colptr->tbcol); } else { delbyte = ((fptr->Fptr)->rowlength) - (colptr->tbcol); } } naxis1 = (fptr->Fptr)->rowlength; /* current width of the table */ naxis2 = (fptr->Fptr)->numrows; /* current size of table */ size = (fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize; freespace = ((LONGLONG)delbyte * naxis2) + ((size + 2879) / 2880) * 2880 - size; nblock = (long) (freespace / 2880); /* number of empty blocks to delete */ ffcdel(fptr, naxis1, naxis2, delbyte, firstcol, status); /* delete col */ /* absolute heap position */ firstbyte = (fptr->Fptr)->datastart + (fptr->Fptr)->heapstart; ndelete = (LONGLONG)delbyte * naxis2; /* size of shift */ /* shift heap up (if it exists) */ if ((fptr->Fptr)->heapsize > 0) { nbytes = (fptr->Fptr)->heapsize; /* no. of bytes to shift up */ if (ffshft(fptr, firstbyte, nbytes, -ndelete, status) > 0) /* mv heap */ return(*status); } /* delete the empty blocks at the end of the HDU */ if (nblock > 0) ffdblk(fptr, nblock, status); /* update the heap starting address */ (fptr->Fptr)->heapstart -= ndelete; /* update the THEAP keyword if it exists */ tstatus = 0; ffmkyj(fptr, "THEAP", (long)(fptr->Fptr)->heapstart, "&", &tstatus); if ((fptr->Fptr)->hdutype == ASCII_TBL) { /* adjust the TBCOL values of the remaining columns */ for (ii = 1; ii <= (fptr->Fptr)->tfield; ii++) { ffkeyn("TBCOL", ii, keyname, status); ffgkyjj(fptr, keyname, &tbcol, comm, status); if (tbcol > firstcol) { tbcol = tbcol - delbyte; ffmkyj(fptr, keyname, tbcol, "&", status); } } } /* update the mandatory keywords */ ffmkyj(fptr, "TFIELDS", ((fptr->Fptr)->tfield) - 1, "&", status); ffmkyj(fptr, "NAXIS1", naxis1 - delbyte, "&", status); /* delete the index keywords starting with 'T' associated with the deleted column and subtract 1 from index of all higher keywords */ ffkshf(fptr, colnum, (fptr->Fptr)->tfield, -1, status); ffrdef(fptr, status); /* initialize the new table structure */ return(*status); } /*--------------------------------------------------------------------------*/ int ffcins(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG naxis1, /* I - width of the table, in bytes */ LONGLONG naxis2, /* I - number of rows in the table */ LONGLONG ninsert, /* I - number of bytes to insert in each row */ LONGLONG bytepos, /* I - rel. position in row to insert bytes */ int *status) /* IO - error status */ /* Insert 'ninsert' bytes into each row of the table at position 'bytepos'. */ { unsigned char buffer[10000], cfill; LONGLONG newlen, fbyte, nbytes, irow, nseg, ii; if (*status > 0) return(*status); if (naxis2 == 0) return(*status); /* just return if there are 0 rows in the table */ /* select appropriate fill value */ if ((fptr->Fptr)->hdutype == ASCII_TBL) cfill = 32; /* ASCII tables use blank fill */ else cfill = 0; /* primary array and binary tables use zero fill */ newlen = naxis1 + ninsert; if (newlen <= 10000) { /******************************************************************* CASE #1: optimal case where whole new row fits in the work buffer *******************************************************************/ for (ii = 0; ii < ninsert; ii++) buffer[ii] = cfill; /* initialize buffer with fill value */ /* first move the trailing bytes (if any) in the last row */ fbyte = bytepos + 1; nbytes = naxis1 - bytepos; /* If the last row hasn't yet been accessed in full, it's possible that logfilesize hasn't been updated to account for it (by way of an ffldrc call). This could cause ffgtbb to return with an EOF error. To prevent this, we must increase logfilesize here. */ if ((fptr->Fptr)->logfilesize < (fptr->Fptr)->datastart + (fptr->Fptr)->heapstart) { (fptr->Fptr)->logfilesize = (((fptr->Fptr)->datastart + (fptr->Fptr)->heapstart + 2879)/2880)*2880; } ffgtbb(fptr, naxis2, fbyte, nbytes, &buffer[ninsert], status); (fptr->Fptr)->rowlength = newlen; /* new row length */ /* write the row (with leading fill bytes) in the new place */ nbytes += ninsert; ffptbb(fptr, naxis2, fbyte, nbytes, buffer, status); (fptr->Fptr)->rowlength = naxis1; /* reset to orig. value */ /* now move the rest of the rows */ for (irow = naxis2 - 1; irow > 0; irow--) { /* read the row to be shifted (work backwards thru the table) */ ffgtbb(fptr, irow, fbyte, naxis1, &buffer[ninsert], status); (fptr->Fptr)->rowlength = newlen; /* new row length */ /* write the row (with the leading fill bytes) in the new place */ ffptbb(fptr, irow, fbyte, newlen, buffer, status); (fptr->Fptr)->rowlength = naxis1; /* reset to orig value */ } } else { /***************************************************************** CASE #2: whole row doesn't fit in work buffer; move row in pieces ****************************************************************** first copy the data, then go back and write fill into the new column start by copying the trailing bytes (if any) in the last row. */ nbytes = naxis1 - bytepos; nseg = (nbytes + 9999) / 10000; fbyte = (nseg - 1) * 10000 + bytepos + 1; nbytes = naxis1 - fbyte + 1; for (ii = 0; ii < nseg; ii++) { ffgtbb(fptr, naxis2, fbyte, nbytes, buffer, status); (fptr->Fptr)->rowlength = newlen; /* new row length */ ffptbb(fptr, naxis2, fbyte + ninsert, nbytes, buffer, status); (fptr->Fptr)->rowlength = naxis1; /* reset to orig value */ fbyte -= 10000; nbytes = 10000; } /* now move the rest of the rows */ nseg = (naxis1 + 9999) / 10000; for (irow = naxis2 - 1; irow > 0; irow--) { fbyte = (nseg - 1) * 10000 + bytepos + 1; nbytes = naxis1 - (nseg - 1) * 10000; for (ii = 0; ii < nseg; ii++) { /* read the row to be shifted (work backwards thru the table) */ ffgtbb(fptr, irow, fbyte, nbytes, buffer, status); (fptr->Fptr)->rowlength = newlen; /* new row length */ /* write the row in the new place */ ffptbb(fptr, irow, fbyte + ninsert, nbytes, buffer, status); (fptr->Fptr)->rowlength = naxis1; /* reset to orig value */ fbyte -= 10000; nbytes = 10000; } } /* now write the fill values into the new column */ nbytes = minvalue(ninsert, 10000); memset(buffer, cfill, (size_t) nbytes); /* initialize with fill value */ nseg = (ninsert + 9999) / 10000; (fptr->Fptr)->rowlength = newlen; /* new row length */ for (irow = 1; irow <= naxis2; irow++) { fbyte = bytepos + 1; nbytes = ninsert - ((nseg - 1) * 10000); for (ii = 0; ii < nseg; ii++) { ffptbb(fptr, irow, fbyte, nbytes, buffer, status); fbyte += nbytes; nbytes = 10000; } } (fptr->Fptr)->rowlength = naxis1; /* reset to orig value */ } return(*status); } /*--------------------------------------------------------------------------*/ int ffcdel(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG naxis1, /* I - width of the table, in bytes */ LONGLONG naxis2, /* I - number of rows in the table */ LONGLONG ndelete, /* I - number of bytes to delete in each row */ LONGLONG bytepos, /* I - rel. position in row to delete bytes */ int *status) /* IO - error status */ /* delete 'ndelete' bytes from each row of the table at position 'bytepos'. */ { unsigned char buffer[10000]; LONGLONG i1, i2, ii, irow, nseg; LONGLONG newlen, remain, nbytes; if (*status > 0) return(*status); if (naxis2 == 0) return(*status); /* just return if there are 0 rows in the table */ newlen = naxis1 - ndelete; if (newlen <= 10000) { /******************************************************************* CASE #1: optimal case where whole new row fits in the work buffer *******************************************************************/ i1 = bytepos + 1; i2 = i1 + ndelete; for (irow = 1; irow < naxis2; irow++) { ffgtbb(fptr, irow, i2, newlen, buffer, status); /* read row */ (fptr->Fptr)->rowlength = newlen; /* new row length */ ffptbb(fptr, irow, i1, newlen, buffer, status); /* write row */ (fptr->Fptr)->rowlength = naxis1; /* reset to orig value */ } /* now do the last row */ remain = naxis1 - (bytepos + ndelete); if (remain > 0) { ffgtbb(fptr, naxis2, i2, remain, buffer, status); /* read row */ (fptr->Fptr)->rowlength = newlen; /* new row length */ ffptbb(fptr, naxis2, i1, remain, buffer, status); /* write row */ (fptr->Fptr)->rowlength = naxis1; /* reset to orig value */ } } else { /***************************************************************** CASE #2: whole row doesn't fit in work buffer; move row in pieces ******************************************************************/ nseg = (newlen + 9999) / 10000; for (irow = 1; irow < naxis2; irow++) { i1 = bytepos + 1; i2 = i1 + ndelete; nbytes = newlen - (nseg - 1) * 10000; for (ii = 0; ii < nseg; ii++) { ffgtbb(fptr, irow, i2, nbytes, buffer, status); /* read bytes */ (fptr->Fptr)->rowlength = newlen; /* new row length */ ffptbb(fptr, irow, i1, nbytes, buffer, status); /* rewrite bytes */ (fptr->Fptr)->rowlength = naxis1; /* reset to orig value */ i1 += nbytes; i2 += nbytes; nbytes = 10000; } } /* now do the last row */ remain = naxis1 - (bytepos + ndelete); if (remain > 0) { nseg = (remain + 9999) / 10000; i1 = bytepos + 1; i2 = i1 + ndelete; nbytes = remain - (nseg - 1) * 10000; for (ii = 0; ii < nseg; ii++) { ffgtbb(fptr, naxis2, i2, nbytes, buffer, status); (fptr->Fptr)->rowlength = newlen; /* new row length */ ffptbb(fptr, naxis2, i1, nbytes, buffer, status); /* write row */ (fptr->Fptr)->rowlength = naxis1; /* reset to orig value */ i1 += nbytes; i2 += nbytes; nbytes = 10000; } } } return(*status); } /*--------------------------------------------------------------------------*/ int ffkshf(fitsfile *fptr, /* I - FITS file pointer */ int colmin, /* I - starting col. to be incremented; 1 = 1st */ int colmax, /* I - last column to be incremented */ int incre, /* I - shift index number by this amount */ int *status) /* IO - error status */ /* shift the index value on any existing column keywords This routine will modify the name of any keyword that begins with 'T' and has an index number in the range COLMIN - COLMAX, inclusive. if incre is positive, then the index values will be incremented. if incre is negative, then the kewords with index = COLMIN will be deleted and the index of higher numbered keywords will be decremented. */ { int nkeys, nmore, nrec, tstatus, i1; long ivalue; char rec[FLEN_CARD], q[FLEN_KEYWORD], newkey[FLEN_KEYWORD]; ffghsp(fptr, &nkeys, &nmore, status); /* get number of keywords */ /* go thru header starting with the 9th keyword looking for 'TxxxxNNN' */ for (nrec = 9; nrec <= nkeys; nrec++) { ffgrec(fptr, nrec, rec, status); if (rec[0] == 'T') { i1 = 0; strncpy(q, &rec[1], 4); if (!strncmp(q, "BCOL", 4) || !strncmp(q, "FORM", 4) || !strncmp(q, "TYPE", 4) || !strncmp(q, "SCAL", 4) || !strncmp(q, "UNIT", 4) || !strncmp(q, "NULL", 4) || !strncmp(q, "ZERO", 4) || !strncmp(q, "DISP", 4) || !strncmp(q, "LMIN", 4) || !strncmp(q, "LMAX", 4) || !strncmp(q, "DMIN", 4) || !strncmp(q, "DMAX", 4) || !strncmp(q, "CTYP", 4) || !strncmp(q, "CRPX", 4) || !strncmp(q, "CRVL", 4) || !strncmp(q, "CDLT", 4) || !strncmp(q, "CROT", 4) || !strncmp(q, "CUNI", 4) ) i1 = 5; else if (!strncmp(rec, "TDIM", 4) ) i1 = 4; if (i1) { /* try reading the index number suffix */ q[0] = '\0'; strncat(q, &rec[i1], 8 - i1); tstatus = 0; ffc2ii(q, &ivalue, &tstatus); if (tstatus == 0 && ivalue >= colmin && ivalue <= colmax) { if (incre <= 0 && ivalue == colmin) { ffdrec(fptr, nrec, status); /* delete keyword */ nkeys = nkeys - 1; nrec = nrec - 1; } else { ivalue = ivalue + incre; q[0] = '\0'; strncat(q, rec, i1); ffkeyn(q, ivalue, newkey, status); /* NOTE: because of null termination, it is not equivalent to use strcpy() for the same calls */ strncpy(rec, " ", 8); /* erase old keyword name */ i1 = strlen(newkey); strncpy(rec, newkey, i1); /* overwrite new keyword name */ ffmrec(fptr, nrec, rec, status); /* modify the record */ } } } } } return(*status); } /*--------------------------------------------------------------------------*/ int fffvcl(fitsfile *fptr, /* I - FITS file pointer */ int *nvarcols, /* O - Number of variable length columns found */ int *colnums, /* O - 1-based variable column positions */ int *status) /* IO - error status */ { /* Internal function to identify which columns in a binary table are variable length. The colnums array will be filled with nvarcols elements - the 1-based numbers of all variable length columns in the table. This ASSUMES calling function has passed in a colnums array large enough to hold these. */ int tfields=0,icol; tcolumn *colptr=0; *nvarcols = 0; if (*status > 0) return(*status); if ((fptr->Fptr)->hdutype != BINARY_TBL) { ffpmsg("Var-length column search can only be performed on Binary tables (fffvcl)"); return(*status = NOT_BTABLE); } if ((fptr->Fptr)->tableptr) { colptr = (fptr->Fptr)->tableptr; tfields = (fptr->Fptr)->tfield; for (icol=0; icoltdatatype < 0) { colnums[*nvarcols] = icol + 1; *nvarcols += 1; } } } return(*status); } /*--------------------------------------------------------------------------*/ int ffshft(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG firstbyte, /* I - position of first byte in block to shift */ LONGLONG nbytes, /* I - size of block of bytes to shift */ LONGLONG nshift, /* I - size of shift in bytes (+ or -) */ int *status) /* IO - error status */ /* Shift block of bytes by nshift bytes (positive or negative). A positive nshift value moves the block down further in the file, while a negative value shifts the block towards the beginning of the file. */ { #define shftbuffsize 100000 long ntomov; LONGLONG ptr, ntodo; char buffer[shftbuffsize]; if (*status > 0) return(*status); ntodo = nbytes; /* total number of bytes to shift */ if (nshift > 0) /* start at the end of the block and work backwards */ ptr = firstbyte + nbytes; else /* start at the beginning of the block working forwards */ ptr = firstbyte; while (ntodo) { /* number of bytes to move at one time */ ntomov = (long) (minvalue(ntodo, shftbuffsize)); if (nshift > 0) /* if moving block down ... */ ptr -= ntomov; /* move to position and read the bytes to be moved */ ffmbyt(fptr, ptr, REPORT_EOF, status); ffgbyt(fptr, ntomov, buffer, status); /* move by shift amount and write the bytes */ ffmbyt(fptr, ptr + nshift, IGNORE_EOF, status); if (ffpbyt(fptr, ntomov, buffer, status) > 0) { ffpmsg("Error while shifting block (ffshft)"); return(*status); } ntodo -= ntomov; if (nshift < 0) /* if moving block up ... */ ptr += ntomov; } /* now overwrite the old data with fill */ if ((fptr->Fptr)->hdutype == ASCII_TBL) memset(buffer, 32, shftbuffsize); /* fill ASCII tables with spaces */ else memset(buffer, 0, shftbuffsize); /* fill other HDUs with zeros */ if (nshift < 0) { ntodo = -nshift; /* point to the end of the shifted block */ ptr = firstbyte + nbytes + nshift; } else { ntodo = nshift; /* point to original beginning of the block */ ptr = firstbyte; } ffmbyt(fptr, ptr, REPORT_EOF, status); while (ntodo) { ntomov = (long) (minvalue(ntodo, shftbuffsize)); ffpbyt(fptr, ntomov, buffer, status); ntodo -= ntomov; } return(*status); } cfitsio-3.47/edithdu.c0000644000225700000360000007506213464573431014213 0ustar cagordonlhea/* This file, edithdu.c, contains the FITSIO routines related to */ /* copying, inserting, or deleting HDUs in a FITS file */ /* The FITSIO software was written by William Pence at the High Energy */ /* Astrophysic Science Archive Research Center (HEASARC) at the NASA */ /* Goddard Space Flight Center. */ #include #include #include "fitsio2.h" /*--------------------------------------------------------------------------*/ int ffcopy(fitsfile *infptr, /* I - FITS file pointer to input file */ fitsfile *outfptr, /* I - FITS file pointer to output file */ int morekeys, /* I - reserve space in output header */ int *status) /* IO - error status */ /* copy the CHDU from infptr to the CHDU of outfptr. This will also allocate space in the output header for MOREKY keywords */ { int nspace; if (*status > 0) return(*status); if (infptr == outfptr) return(*status = SAME_FILE); if (ffcphd(infptr, outfptr, status) > 0) /* copy the header keywords */ return(*status); if (morekeys > 0) { ffhdef(outfptr, morekeys, status); /* reserve space for more keywords */ } else { if (ffghsp(infptr, NULL, &nspace, status) > 0) /* get existing space */ return(*status); if (nspace > 0) { ffhdef(outfptr, nspace, status); /* preserve same amount of space */ if (nspace >= 35) { /* There is at least 1 full empty FITS block in the header. */ /* Physically write the END keyword at the beginning of the */ /* last block to preserve this extra space now rather than */ /* later. This is needed by the stream: driver which cannot */ /* seek back to the header to write the END keyword later. */ ffwend(outfptr, status); } } } ffcpdt(infptr, outfptr, status); /* now copy the data unit */ return(*status); } /*--------------------------------------------------------------------------*/ int ffcpfl(fitsfile *infptr, /* I - FITS file pointer to input file */ fitsfile *outfptr, /* I - FITS file pointer to output file */ int previous, /* I - copy any previous HDUs? */ int current, /* I - copy the current HDU? */ int following, /* I - copy any following HDUs? */ int *status) /* IO - error status */ /* copy all or part of the input file to the output file. */ { int hdunum, ii; if (*status > 0) return(*status); if (infptr == outfptr) return(*status = SAME_FILE); ffghdn(infptr, &hdunum); if (previous) { /* copy any previous HDUs */ for (ii=1; ii < hdunum; ii++) { ffmahd(infptr, ii, NULL, status); ffcopy(infptr, outfptr, 0, status); } } if (current && (*status <= 0) ) { /* copy current HDU */ ffmahd(infptr, hdunum, NULL, status); ffcopy(infptr, outfptr, 0, status); } if (following && (*status <= 0) ) { /* copy any remaining HDUs */ ii = hdunum + 1; while (1) { if (ffmahd(infptr, ii, NULL, status) ) { /* reset expected end of file status */ if (*status == END_OF_FILE) *status = 0; break; } if (ffcopy(infptr, outfptr, 0, status)) break; /* quit on unexpected error */ ii++; } } ffmahd(infptr, hdunum, NULL, status); /* restore initial position */ return(*status); } /*--------------------------------------------------------------------------*/ int ffcphd(fitsfile *infptr, /* I - FITS file pointer to input file */ fitsfile *outfptr, /* I - FITS file pointer to output file */ int *status) /* IO - error status */ /* copy the header keywords from infptr to outfptr. */ { int nkeys, ii, inPrim = 0, outPrim = 0; long naxis, naxes[1]; char *card, comm[FLEN_COMMENT]; char *tmpbuff; if (*status > 0) return(*status); if (infptr == outfptr) return(*status = SAME_FILE); /* set the input pointer to the correct HDU */ if (infptr->HDUposition != (infptr->Fptr)->curhdu) ffmahd(infptr, (infptr->HDUposition) + 1, NULL, status); if (ffghsp(infptr, &nkeys, NULL, status) > 0) /* get no. of keywords */ return(*status); /* create a memory buffer to hold the header records */ tmpbuff = (char*) malloc(nkeys*FLEN_CARD*sizeof(char)); if (!tmpbuff) return(*status = MEMORY_ALLOCATION); /* read all of the header records in the input HDU */ for (ii = 0; ii < nkeys; ii++) ffgrec(infptr, ii+1, tmpbuff + (ii * FLEN_CARD), status); if (infptr->HDUposition == 0) /* set flag if this is the Primary HDU */ inPrim = 1; /* if input is an image hdu, get the number of axes */ naxis = -1; /* negative if HDU is a table */ if ((infptr->Fptr)->hdutype == IMAGE_HDU) ffgkyj(infptr, "NAXIS", &naxis, NULL, status); /* set the output pointer to the correct HDU */ if (outfptr->HDUposition != (outfptr->Fptr)->curhdu) ffmahd(outfptr, (outfptr->HDUposition) + 1, NULL, status); /* check if output header is empty; if not create new empty HDU */ if ((outfptr->Fptr)->headend != (outfptr->Fptr)->headstart[(outfptr->Fptr)->curhdu] ) ffcrhd(outfptr, status); if (outfptr->HDUposition == 0) { if (naxis < 0) { /* the input HDU is a table, so we have to create */ /* a dummy Primary array before copying it to the output */ ffcrim(outfptr, 8, 0, naxes, status); ffcrhd(outfptr, status); /* create new empty HDU */ } else { /* set flag that this is the Primary HDU */ outPrim = 1; } } if (*status > 0) /* check for errors before proceeding */ { free(tmpbuff); return(*status); } if ( inPrim == 1 && outPrim == 0 ) { /* copying from primary array to image extension */ strcpy(comm, "IMAGE extension"); ffpkys(outfptr, "XTENSION", "IMAGE", comm, status); /* copy BITPIX through NAXISn keywords */ for (ii = 1; ii < 3 + naxis; ii++) { card = tmpbuff + (ii * FLEN_CARD); ffprec(outfptr, card, status); } strcpy(comm, "number of random group parameters"); ffpkyj(outfptr, "PCOUNT", 0, comm, status); strcpy(comm, "number of random groups"); ffpkyj(outfptr, "GCOUNT", 1, comm, status); /* copy remaining keywords, excluding EXTEND, and reference COMMENT keywords */ for (ii = 3 + naxis ; ii < nkeys; ii++) { card = tmpbuff+(ii * FLEN_CARD); if (FSTRNCMP(card, "EXTEND ", 8) && FSTRNCMP(card, "COMMENT FITS (Flexible Image Transport System) format is", 58) && FSTRNCMP(card, "COMMENT and Astrophysics', volume 376, page 3", 47) ) { ffprec(outfptr, card, status); } } } else if ( inPrim == 0 && outPrim == 1 ) { /* copying between image extension and primary array */ strcpy(comm, "file does conform to FITS standard"); ffpkyl(outfptr, "SIMPLE", TRUE, comm, status); /* copy BITPIX through NAXISn keywords */ for (ii = 1; ii < 3 + naxis; ii++) { card = tmpbuff + (ii * FLEN_CARD); ffprec(outfptr, card, status); } /* add the EXTEND keyword */ strcpy(comm, "FITS dataset may contain extensions"); ffpkyl(outfptr, "EXTEND", TRUE, comm, status); /* write standard block of self-documentating comments */ ffprec(outfptr, "COMMENT FITS (Flexible Image Transport System) format is defined in 'Astronomy", status); ffprec(outfptr, "COMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H", status); /* copy remaining keywords, excluding pcount, gcount */ for (ii = 3 + naxis; ii < nkeys; ii++) { card = tmpbuff+(ii * FLEN_CARD); if (FSTRNCMP(card, "PCOUNT ", 8) && FSTRNCMP(card, "GCOUNT ", 8)) { ffprec(outfptr, card, status); } } } else { /* input and output HDUs are same type; simply copy all keywords */ for (ii = 0; ii < nkeys; ii++) { card = tmpbuff+(ii * FLEN_CARD); ffprec(outfptr, card, status); } } free(tmpbuff); return(*status); } /*--------------------------------------------------------------------------*/ int ffcpdt(fitsfile *infptr, /* I - FITS file pointer to input file */ fitsfile *outfptr, /* I - FITS file pointer to output file */ int *status) /* IO - error status */ { /* copy the data unit from the CHDU of infptr to the CHDU of outfptr. This will overwrite any data already in the outfptr CHDU. */ long nb, ii; LONGLONG indatastart, indataend, outdatastart; char buffer[2880]; if (*status > 0) return(*status); if (infptr == outfptr) return(*status = SAME_FILE); ffghadll(infptr, NULL, &indatastart, &indataend, status); ffghadll(outfptr, NULL, &outdatastart, NULL, status); /* Calculate the number of blocks to be copied */ nb = (long) ((indataend - indatastart) / 2880); if (nb > 0) { if (infptr->Fptr == outfptr->Fptr) { /* copying between 2 HDUs in the SAME file */ for (ii = 0; ii < nb; ii++) { ffmbyt(infptr, indatastart, REPORT_EOF, status); ffgbyt(infptr, 2880L, buffer, status); /* read input block */ ffmbyt(outfptr, outdatastart, IGNORE_EOF, status); ffpbyt(outfptr, 2880L, buffer, status); /* write output block */ indatastart += 2880; /* move address */ outdatastart += 2880; /* move address */ } } else { /* copying between HDUs in separate files */ /* move to the initial copy position in each of the files */ ffmbyt(infptr, indatastart, REPORT_EOF, status); ffmbyt(outfptr, outdatastart, IGNORE_EOF, status); for (ii = 0; ii < nb; ii++) { ffgbyt(infptr, 2880L, buffer, status); /* read input block */ ffpbyt(outfptr, 2880L, buffer, status); /* write output block */ } } } return(*status); } /*--------------------------------------------------------------------------*/ int ffwrhdu(fitsfile *infptr, /* I - FITS file pointer to input file */ FILE *outstream, /* I - stream to write HDU to */ int *status) /* IO - error status */ { /* write the data unit from the CHDU of infptr to the output file stream */ long nb, ii; LONGLONG hdustart, hduend; char buffer[2880]; if (*status > 0) return(*status); ffghadll(infptr, &hdustart, NULL, &hduend, status); nb = (long) ((hduend - hdustart) / 2880); /* number of blocks to copy */ if (nb > 0) { /* move to the start of the HDU */ ffmbyt(infptr, hdustart, REPORT_EOF, status); for (ii = 0; ii < nb; ii++) { ffgbyt(infptr, 2880L, buffer, status); /* read input block */ fwrite(buffer, 1, 2880, outstream ); /* write to output stream */ } } return(*status); } /*--------------------------------------------------------------------------*/ int ffiimg(fitsfile *fptr, /* I - FITS file pointer */ int bitpix, /* I - bits per pixel */ int naxis, /* I - number of axes in the array */ long *naxes, /* I - size of each axis */ int *status) /* IO - error status */ /* insert an IMAGE extension following the current HDU */ { LONGLONG tnaxes[99]; int ii; if (*status > 0) return(*status); if (naxis > 99) { ffpmsg("NAXIS value is too large (>99) (ffiimg)"); return(*status = 212); } for (ii = 0; (ii < naxis); ii++) tnaxes[ii] = naxes[ii]; ffiimgll(fptr, bitpix, naxis, tnaxes, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffiimgll(fitsfile *fptr, /* I - FITS file pointer */ int bitpix, /* I - bits per pixel */ int naxis, /* I - number of axes in the array */ LONGLONG *naxes, /* I - size of each axis */ int *status) /* IO - error status */ /* insert an IMAGE extension following the current HDU */ { int bytlen, nexthdu, maxhdu, ii, onaxis; long nblocks; LONGLONG npixels, newstart, datasize; char errmsg[FLEN_ERRMSG], card[FLEN_CARD], naxiskey[FLEN_KEYWORD]; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); maxhdu = (fptr->Fptr)->maxhdu; if (*status != PREPEND_PRIMARY) { /* if the current header is completely empty ... */ if (( (fptr->Fptr)->headend == (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu]) /* or, if we are at the end of the file, ... */ || ( (((fptr->Fptr)->curhdu) == maxhdu ) && ((fptr->Fptr)->headstart[maxhdu + 1] >= (fptr->Fptr)->logfilesize ) ) ) { /* then simply append new image extension */ ffcrimll(fptr, bitpix, naxis, naxes, status); return(*status); } } if (bitpix == 8) bytlen = 1; else if (bitpix == 16) bytlen = 2; else if (bitpix == 32 || bitpix == -32) bytlen = 4; else if (bitpix == 64 || bitpix == -64) bytlen = 8; else { snprintf(errmsg, FLEN_ERRMSG, "Illegal value for BITPIX keyword: %d", bitpix); ffpmsg(errmsg); return(*status = BAD_BITPIX); /* illegal bitpix value */ } if (naxis < 0 || naxis > 999) { snprintf(errmsg, FLEN_ERRMSG, "Illegal value for NAXIS keyword: %d", naxis); ffpmsg(errmsg); return(*status = BAD_NAXIS); } for (ii = 0; ii < naxis; ii++) { if (naxes[ii] < 0) { snprintf(errmsg, FLEN_ERRMSG, "Illegal value for NAXIS%d keyword: %ld", ii + 1, (long) naxes[ii]); ffpmsg(errmsg); return(*status = BAD_NAXES); } } /* calculate number of pixels in the image */ if (naxis == 0) npixels = 0; else npixels = naxes[0]; for (ii = 1; ii < naxis; ii++) npixels = npixels * naxes[ii]; datasize = npixels * bytlen; /* size of image in bytes */ nblocks = (long) (((datasize + 2879) / 2880) + 1); /* +1 for the header */ if ((fptr->Fptr)->writemode == READWRITE) /* must have write access */ { /* close the CHDU */ ffrdef(fptr, status); /* scan header to redefine structure */ ffpdfl(fptr, status); /* insure correct data file values */ } else return(*status = READONLY_FILE); if (*status == PREPEND_PRIMARY) { /* inserting a new primary array; the current primary */ /* array must be transformed into an image extension. */ *status = 0; ffmahd(fptr, 1, NULL, status); /* move to the primary array */ ffgidm(fptr, &onaxis, status); if (onaxis > 0) ffkeyn("NAXIS",onaxis, naxiskey, status); else strcpy(naxiskey, "NAXIS"); ffgcrd(fptr, naxiskey, card, status); /* read last NAXIS keyword */ ffikyj(fptr, "PCOUNT", 0, "required keyword", status); /* add PCOUNT and */ ffikyj(fptr, "GCOUNT", 1, "required keyword", status); /* GCOUNT keywords */ if (*status > 0) return(*status); if (ffdkey(fptr, "EXTEND", status) ) /* delete the EXTEND keyword */ *status = 0; /* redefine internal structure for this HDU */ ffrdef(fptr, status); /* insert space for the primary array */ if (ffiblk(fptr, nblocks, -1, status) > 0) /* insert the blocks */ return(*status); nexthdu = 0; /* number of the new hdu */ newstart = 0; /* starting addr of HDU */ } else { nexthdu = ((fptr->Fptr)->curhdu) + 1; /* number of the next (new) hdu */ newstart = (fptr->Fptr)->headstart[nexthdu]; /* save starting addr of HDU */ (fptr->Fptr)->hdutype = IMAGE_HDU; /* so that correct fill value is used */ /* ffiblk also increments headstart for all following HDUs */ if (ffiblk(fptr, nblocks, 1, status) > 0) /* insert the blocks */ return(*status); } ((fptr->Fptr)->maxhdu)++; /* increment known number of HDUs in the file */ for (ii = (fptr->Fptr)->maxhdu; ii > (fptr->Fptr)->curhdu; ii--) (fptr->Fptr)->headstart[ii + 1] = (fptr->Fptr)->headstart[ii]; /* incre start addr */ if (nexthdu == 0) (fptr->Fptr)->headstart[1] = nblocks * 2880; /* start of the old Primary array */ (fptr->Fptr)->headstart[nexthdu] = newstart; /* set starting addr of HDU */ /* set default parameters for this new empty HDU */ (fptr->Fptr)->curhdu = nexthdu; /* we are now located at the next HDU */ fptr->HDUposition = nexthdu; /* we are now located at the next HDU */ (fptr->Fptr)->nextkey = (fptr->Fptr)->headstart[nexthdu]; (fptr->Fptr)->headend = (fptr->Fptr)->headstart[nexthdu]; (fptr->Fptr)->datastart = ((fptr->Fptr)->headstart[nexthdu]) + 2880; (fptr->Fptr)->hdutype = IMAGE_HDU; /* might need to be reset... */ /* write the required header keywords */ ffphprll(fptr, TRUE, bitpix, naxis, naxes, 0, 1, TRUE, status); /* redefine internal structure for this HDU */ ffrdef(fptr, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffitab(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG naxis1, /* I - width of row in the table */ LONGLONG naxis2, /* I - number of rows in the table */ int tfields, /* I - number of columns in the table */ char **ttype, /* I - name of each column */ long *tbcol, /* I - byte offset in row to each column */ char **tform, /* I - value of TFORMn keyword for each column */ char **tunit, /* I - value of TUNITn keyword for each column */ const char *extnmx, /* I - value of EXTNAME keyword, if any */ int *status) /* IO - error status */ /* insert an ASCII table extension following the current HDU */ { int nexthdu, maxhdu, ii, nunit, nhead, ncols, gotmem = 0; long nblocks, rowlen; LONGLONG datasize, newstart; char errmsg[FLEN_ERRMSG], extnm[FLEN_VALUE]; if (*status > 0) return(*status); extnm[0] = '\0'; if (extnmx) strncat(extnm, extnmx, FLEN_VALUE-1); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); maxhdu = (fptr->Fptr)->maxhdu; /* if the current header is completely empty ... */ if (( (fptr->Fptr)->headend == (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] ) /* or, if we are at the end of the file, ... */ || ( (((fptr->Fptr)->curhdu) == maxhdu ) && ((fptr->Fptr)->headstart[maxhdu + 1] >= (fptr->Fptr)->logfilesize ) ) ) { /* then simply append new image extension */ ffcrtb(fptr, ASCII_TBL, naxis2, tfields, ttype, tform, tunit, extnm, status); return(*status); } if (naxis1 < 0) return(*status = NEG_WIDTH); else if (naxis2 < 0) return(*status = NEG_ROWS); else if (tfields < 0 || tfields > 999) { snprintf(errmsg, FLEN_ERRMSG, "Illegal value for TFIELDS keyword: %d", tfields); ffpmsg(errmsg); return(*status = BAD_TFIELDS); } /* count number of optional TUNIT keywords to be written */ nunit = 0; for (ii = 0; ii < tfields; ii++) { if (tunit && *tunit && *tunit[ii]) nunit++; } if (*extnm) nunit++; /* add one for the EXTNAME keyword */ rowlen = (long) naxis1; if (!tbcol || !tbcol[0] || (!naxis1 && tfields)) /* spacing not defined? */ { /* allocate mem for tbcol; malloc may have problems allocating small */ /* arrays, so allocate at least 20 bytes */ ncols = maxvalue(5, tfields); tbcol = (long *) calloc(ncols, sizeof(long)); if (tbcol) { gotmem = 1; /* calculate width of a row and starting position of each column. */ /* Each column will be separated by 1 blank space */ ffgabc(tfields, tform, 1, &rowlen, tbcol, status); } } nhead = (9 + (3 * tfields) + nunit + 35) / 36; /* no. of header blocks */ datasize = (LONGLONG)rowlen * naxis2; /* size of table in bytes */ nblocks = (long) (((datasize + 2879) / 2880) + nhead); /* size of HDU */ if ((fptr->Fptr)->writemode == READWRITE) /* must have write access */ { /* close the CHDU */ ffrdef(fptr, status); /* scan header to redefine structure */ ffpdfl(fptr, status); /* insure correct data file values */ } else return(*status = READONLY_FILE); nexthdu = ((fptr->Fptr)->curhdu) + 1; /* number of the next (new) hdu */ newstart = (fptr->Fptr)->headstart[nexthdu]; /* save starting addr of HDU */ (fptr->Fptr)->hdutype = ASCII_TBL; /* so that correct fill value is used */ /* ffiblk also increments headstart for all following HDUs */ if (ffiblk(fptr, nblocks, 1, status) > 0) /* insert the blocks */ { if (gotmem) free(tbcol); return(*status); } ((fptr->Fptr)->maxhdu)++; /* increment known number of HDUs in the file */ for (ii = (fptr->Fptr)->maxhdu; ii > (fptr->Fptr)->curhdu; ii--) (fptr->Fptr)->headstart[ii + 1] = (fptr->Fptr)->headstart[ii]; /* incre start addr */ (fptr->Fptr)->headstart[nexthdu] = newstart; /* set starting addr of HDU */ /* set default parameters for this new empty HDU */ (fptr->Fptr)->curhdu = nexthdu; /* we are now located at the next HDU */ fptr->HDUposition = nexthdu; /* we are now located at the next HDU */ (fptr->Fptr)->nextkey = (fptr->Fptr)->headstart[nexthdu]; (fptr->Fptr)->headend = (fptr->Fptr)->headstart[nexthdu]; (fptr->Fptr)->datastart = ((fptr->Fptr)->headstart[nexthdu]) + (nhead * 2880); (fptr->Fptr)->hdutype = ASCII_TBL; /* might need to be reset... */ /* write the required header keywords */ ffphtb(fptr, rowlen, naxis2, tfields, ttype, tbcol, tform, tunit, extnm, status); if (gotmem) free(tbcol); /* redefine internal structure for this HDU */ ffrdef(fptr, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffibin(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG naxis2, /* I - number of rows in the table */ int tfields, /* I - number of columns in the table */ char **ttype, /* I - name of each column */ char **tform, /* I - value of TFORMn keyword for each column */ char **tunit, /* I - value of TUNITn keyword for each column */ const char *extnmx, /* I - value of EXTNAME keyword, if any */ LONGLONG pcount, /* I - size of special data area (heap) */ int *status) /* IO - error status */ /* insert a Binary table extension following the current HDU */ { int nexthdu, maxhdu, ii, nunit, nhead, datacode; LONGLONG naxis1; long nblocks, repeat, width; LONGLONG datasize, newstart; char errmsg[FLEN_ERRMSG], extnm[FLEN_VALUE]; if (*status > 0) return(*status); extnm[0] = '\0'; if (extnmx) strncat(extnm, extnmx, FLEN_VALUE-1); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); maxhdu = (fptr->Fptr)->maxhdu; /* if the current header is completely empty ... */ if (( (fptr->Fptr)->headend == (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] ) /* or, if we are at the end of the file, ... */ || ( (((fptr->Fptr)->curhdu) == maxhdu ) && ((fptr->Fptr)->headstart[maxhdu + 1] >= (fptr->Fptr)->logfilesize ) ) ) { /* then simply append new image extension */ ffcrtb(fptr, BINARY_TBL, naxis2, tfields, ttype, tform, tunit, extnm, status); return(*status); } if (naxis2 < 0) return(*status = NEG_ROWS); else if (tfields < 0 || tfields > 999) { snprintf(errmsg, FLEN_ERRMSG, "Illegal value for TFIELDS keyword: %d", tfields); ffpmsg(errmsg); return(*status = BAD_TFIELDS); } /* count number of optional TUNIT keywords to be written */ nunit = 0; for (ii = 0; ii < tfields; ii++) { if (tunit && *tunit && *tunit[ii]) nunit++; } if (*extnm) nunit++; /* add one for the EXTNAME keyword */ nhead = (9 + (2 * tfields) + nunit + 35) / 36; /* no. of header blocks */ /* calculate total width of the table */ naxis1 = 0; for (ii = 0; ii < tfields; ii++) { ffbnfm(tform[ii], &datacode, &repeat, &width, status); if (datacode == TBIT) naxis1 = naxis1 + ((repeat + 7) / 8); else if (datacode == TSTRING) naxis1 += repeat; else naxis1 = naxis1 + (repeat * width); } datasize = ((LONGLONG)naxis1 * naxis2) + pcount; /* size of table in bytes */ nblocks = (long) ((datasize + 2879) / 2880) + nhead; /* size of HDU */ if ((fptr->Fptr)->writemode == READWRITE) /* must have write access */ { /* close the CHDU */ ffrdef(fptr, status); /* scan header to redefine structure */ ffpdfl(fptr, status); /* insure correct data file values */ } else return(*status = READONLY_FILE); nexthdu = ((fptr->Fptr)->curhdu) + 1; /* number of the next (new) hdu */ newstart = (fptr->Fptr)->headstart[nexthdu]; /* save starting addr of HDU */ (fptr->Fptr)->hdutype = BINARY_TBL; /* so that correct fill value is used */ /* ffiblk also increments headstart for all following HDUs */ if (ffiblk(fptr, nblocks, 1, status) > 0) /* insert the blocks */ return(*status); ((fptr->Fptr)->maxhdu)++; /* increment known number of HDUs in the file */ for (ii = (fptr->Fptr)->maxhdu; ii > (fptr->Fptr)->curhdu; ii--) (fptr->Fptr)->headstart[ii + 1] = (fptr->Fptr)->headstart[ii]; /* incre start addr */ (fptr->Fptr)->headstart[nexthdu] = newstart; /* set starting addr of HDU */ /* set default parameters for this new empty HDU */ (fptr->Fptr)->curhdu = nexthdu; /* we are now located at the next HDU */ fptr->HDUposition = nexthdu; /* we are now located at the next HDU */ (fptr->Fptr)->nextkey = (fptr->Fptr)->headstart[nexthdu]; (fptr->Fptr)->headend = (fptr->Fptr)->headstart[nexthdu]; (fptr->Fptr)->datastart = ((fptr->Fptr)->headstart[nexthdu]) + (nhead * 2880); (fptr->Fptr)->hdutype = BINARY_TBL; /* might need to be reset... */ /* write the required header keywords. This will write PCOUNT = 0 */ /* so that the variable length data will be written at the right place */ ffphbn(fptr, naxis2, tfields, ttype, tform, tunit, extnm, pcount, status); /* redefine internal structure for this HDU (with PCOUNT = 0) */ ffrdef(fptr, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffdhdu(fitsfile *fptr, /* I - FITS file pointer */ int *hdutype, /* O - type of the new CHDU after deletion */ int *status) /* IO - error status */ /* Delete the CHDU. If the CHDU is the primary array, then replace the HDU with an empty primary array with no data. Return the type of the new CHDU after the old CHDU is deleted. */ { int tmptype = 0; long nblocks, ii, naxes[1]; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); if ((fptr->Fptr)->curhdu == 0) /* replace primary array with null image */ { /* ignore any existing keywords */ (fptr->Fptr)->headend = 0; (fptr->Fptr)->nextkey = 0; /* write default primary array header */ ffphpr(fptr,1,8,0,naxes,0,1,1,status); /* calc number of blocks to delete (leave just 1 block) */ nblocks = (long) (( (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu + 1] - 2880 ) / 2880); /* ffdblk also updates the starting address of all following HDUs */ if (nblocks > 0) { if (ffdblk(fptr, nblocks, status) > 0) /* delete the HDU */ return(*status); } /* this might not be necessary, but is doesn't hurt */ (fptr->Fptr)->datastart = DATA_UNDEFINED; ffrdef(fptr, status); /* reinitialize the primary array */ } else { /* calc number of blocks to delete */ nblocks = (long) (( (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu + 1] - (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] ) / 2880); /* ffdblk also updates the starting address of all following HDUs */ if (ffdblk(fptr, nblocks, status) > 0) /* delete the HDU */ return(*status); /* delete the CHDU from the list of HDUs */ for (ii = (fptr->Fptr)->curhdu + 1; ii <= (fptr->Fptr)->maxhdu; ii++) (fptr->Fptr)->headstart[ii] = (fptr->Fptr)->headstart[ii + 1]; (fptr->Fptr)->headstart[(fptr->Fptr)->maxhdu + 1] = 0; ((fptr->Fptr)->maxhdu)--; /* decrement the known number of HDUs */ if (ffrhdu(fptr, &tmptype, status) > 0) /* initialize next HDU */ { /* failed (end of file?), so move back one HDU */ *status = 0; ffcmsg(); /* clear extraneous error messages */ ffgext(fptr, ((fptr->Fptr)->curhdu) - 1, &tmptype, status); } } if (hdutype) *hdutype = tmptype; return(*status); } cfitsio-3.47/eval_defs.h0000644000225700000360000001023613464573431014512 0ustar cagordonlhea#include #include #include #include #if defined(__sgi) || defined(__hpux) #include #endif #ifdef sparc #include #endif #include "fitsio2.h" #define MAXDIMS 5 #define MAXSUBS 10 #define MAXVARNAME 80 #define CONST_OP -1000 #define pERROR -1 #define MAX_STRLEN 256 #define MAX_STRLEN_S "255" #ifndef FFBISON #include "eval_tab.h" #endif typedef struct { char name[MAXVARNAME+1]; int type; long nelem; int naxis; long naxes[MAXDIMS]; char *undef; void *data; } DataInfo; typedef struct { long nelem; int naxis; long naxes[MAXDIMS]; char *undef; union { double dbl; long lng; char log; char str[MAX_STRLEN]; double *dblptr; long *lngptr; char *logptr; char **strptr; void *ptr; } data; } lval; typedef struct Node { int operation; void (*DoOp)(struct Node *this); int nSubNodes; int SubNodes[MAXSUBS]; int type; lval value; } Node; typedef struct { fitsfile *def_fptr; int (*getData)( char *dataName, void *dataValue ); int (*loadData)( int varNum, long fRow, long nRows, void *data, char *undef ); int compressed; int timeCol; int parCol; int valCol; char *expr; int index; int is_eobuf; Node *Nodes; int nNodes; int nNodesAlloc; int resultNode; long firstRow; long nRows; int nCols; iteratorCol *colData; DataInfo *varData; PixelFilter *pixFilter; long firstDataRow; long nDataRows; long totalRows; int datatype; int hdutype; int status; } ParseData; typedef enum { rnd_fct = 1001, sum_fct, nelem_fct, sin_fct, cos_fct, tan_fct, asin_fct, acos_fct, atan_fct, sinh_fct, cosh_fct, tanh_fct, exp_fct, log_fct, log10_fct, sqrt_fct, abs_fct, atan2_fct, ceil_fct, floor_fct, round_fct, min1_fct, min2_fct, max1_fct, max2_fct, near_fct, circle_fct, box_fct, elps_fct, isnull_fct, defnull_fct, gtifilt_fct, regfilt_fct, ifthenelse_fct, row_fct, null_fct, median_fct, average_fct, stddev_fct, nonnull_fct, angsep_fct, gasrnd_fct, poirnd_fct, strmid_fct, strpos_fct } funcOp; extern ParseData gParse; #ifdef __cplusplus extern "C" { #endif int ffparse(void); int fflex(void); void ffrestart(FILE*); void Evaluate_Parser( long firstRow, long nRows ); #ifdef __cplusplus } #endif cfitsio-3.47/eval_f.c0000644000225700000360000030076213464573431014017 0ustar cagordonlhea/************************************************************************/ /* */ /* CFITSIO Lexical Parser */ /* */ /* This file is one of 3 files containing code which parses an */ /* arithmetic expression and evaluates it in the context of an input */ /* FITS file table extension. The CFITSIO lexical parser is divided */ /* into the following 3 parts/files: the CFITSIO "front-end", */ /* eval_f.c, contains the interface between the user/CFITSIO and the */ /* real core of the parser; the FLEX interpreter, eval_l.c, takes the */ /* input string and parses it into tokens and identifies the FITS */ /* information required to evaluate the expression (ie, keywords and */ /* columns); and, the BISON grammar and evaluation routines, eval_y.c, */ /* receives the FLEX output and determines and performs the actual */ /* operations. The files eval_l.c and eval_y.c are produced from */ /* running flex and bison on the files eval.l and eval.y, respectively. */ /* (flex and bison are available from any GNU archive: see www.gnu.org) */ /* */ /* The grammar rules, rather than evaluating the expression in situ, */ /* builds a tree, or Nodal, structure mapping out the order of */ /* operations and expression dependencies. This "compilation" process */ /* allows for much faster processing of multiple rows. This technique */ /* was developed by Uwe Lammers of the XMM Science Analysis System, */ /* although the CFITSIO implementation is entirely code original. */ /* */ /* */ /* Modification History: */ /* */ /* Kent Blackburn c1992 Original parser code developed for the */ /* FTOOLS software package, in particular, */ /* the fselect task. */ /* Kent Blackburn c1995 BIT column support added */ /* Peter D Wilson Feb 1998 Vector column support added */ /* Peter D Wilson May 1998 Ported to CFITSIO library. User */ /* interface routines written, in essence */ /* making fselect, fcalc, and maketime */ /* capabilities available to all tools */ /* via single function calls. */ /* Peter D Wilson Jun 1998 Major rewrite of parser core, so as to */ /* create a run-time evaluation tree, */ /* inspired by the work of Uwe Lammers, */ /* resulting in a speed increase of */ /* 10-100 times. */ /* Peter D Wilson Jul 1998 gtifilter(a,b,c,d) function added */ /* Peter D Wilson Aug 1998 regfilter(a,b,c,d) function added */ /* Peter D Wilson Jul 1999 Make parser fitsfile-independent, */ /* allowing a purely vector-based usage */ /* Peter D Wilson Aug 1999 Add row-offset capability */ /* Peter D Wilson Sep 1999 Add row-range capability to ffcalc_rng */ /* */ /************************************************************************/ #include #include #include "eval_defs.h" #include "region.h" typedef struct { int datatype; /* Data type to cast parse results into for user */ void *dataPtr; /* Pointer to array of results, NULL if to use iterCol */ void *nullPtr; /* Pointer to nulval, use zero if NULL */ long maxRows; /* Max No. of rows to process, -1=all, 0=1 iteration */ int anyNull; /* Flag indicating at least 1 undef value encountered */ } parseInfo; /* Internal routines needed to allow the evaluator to operate on FITS data */ static void Setup_DataArrays( int nCols, iteratorCol *cols, long fRow, long nRows ); static int find_column( char *colName, void *itslval ); static int find_keywd ( char *key, void *itslval ); static int allocateCol( int nCol, int *status ); static int load_column( int varNum, long fRow, long nRows, void *data, char *undef ); static int DEBUG_PIXFILTER; #define FREE(x) { if (x) free(x); else printf("invalid free(" #x ") at %s:%d\n", __FILE__, __LINE__); } /*---------------------------------------------------------------------------*/ int fffrow( fitsfile *fptr, /* I - Input FITS file */ char *expr, /* I - Boolean expression */ long firstrow, /* I - First row of table to eval */ long nrows, /* I - Number of rows to evaluate */ long *n_good_rows, /* O - Number of rows eval to True */ char *row_status, /* O - Array of boolean results */ int *status ) /* O - Error status */ /* */ /* Evaluate a boolean expression using the indicated rows, returning an */ /* array of flags indicating which rows evaluated to TRUE/FALSE */ /*---------------------------------------------------------------------------*/ { parseInfo Info; int naxis, constant; long nelem, naxes[MAXDIMS], elem; char result; if( *status ) return( *status ); FFLOCK; if( ffiprs( fptr, 0, expr, MAXDIMS, &Info.datatype, &nelem, &naxis, naxes, status ) ) { ffcprs(); FFUNLOCK; return( *status ); } if( nelem<0 ) { constant = 1; nelem = -nelem; } else constant = 0; if( Info.datatype!=TLOGICAL || nelem!=1 ) { ffcprs(); ffpmsg("Expression does not evaluate to a logical scalar."); FFUNLOCK; return( *status = PARSE_BAD_TYPE ); } if( constant ) { /* No need to call parser... have result from ffiprs */ result = gParse.Nodes[gParse.resultNode].value.data.log; *n_good_rows = nrows; for( elem=0; elem1 ? firstrow : 1); Info.dataPtr = row_status; Info.nullPtr = NULL; Info.maxRows = nrows; if( ffiter( gParse.nCols, gParse.colData, firstrow-1, 0, parse_data, (void*)&Info, status ) == -1 ) *status = 0; /* -1 indicates exitted without error before end... OK */ if( *status ) { /***********************/ /* Error... Do nothing */ /***********************/ } else { /***********************************/ /* Count number of good rows found */ /***********************************/ *n_good_rows = 0L; for( elem=0; elemHDUposition != (infptr->Fptr)->curhdu ) ffmahd( infptr, (infptr->HDUposition) + 1, NULL, status ); if( *status ) { ffcprs(); FFUNLOCK; return( *status ); } inExt.rowLength = (long) (infptr->Fptr)->rowlength; inExt.numRows = (infptr->Fptr)->numrows; inExt.heapSize = (infptr->Fptr)->heapsize; if( inExt.numRows == 0 ) { /* Nothing to copy */ ffcprs(); FFUNLOCK; return( *status ); } if( outfptr->HDUposition != (outfptr->Fptr)->curhdu ) ffmahd( outfptr, (outfptr->HDUposition) + 1, NULL, status ); if( (outfptr->Fptr)->datastart < 0 ) ffrdef( outfptr, status ); if( *status ) { ffcprs(); FFUNLOCK; return( *status ); } outExt.rowLength = (long) (outfptr->Fptr)->rowlength; outExt.numRows = (outfptr->Fptr)->numrows; if( !outExt.numRows ) (outfptr->Fptr)->heapsize = 0L; outExt.heapSize = (outfptr->Fptr)->heapsize; if( inExt.rowLength != outExt.rowLength ) { ffpmsg("Output table has different row length from input"); ffcprs(); FFUNLOCK; return( *status = PARSE_BAD_OUTPUT ); } /***********************************/ /* Fill out Info data for parser */ /***********************************/ Info.dataPtr = (char *)malloc( (size_t) ((inExt.numRows + 1) * sizeof(char)) ); Info.nullPtr = NULL; Info.maxRows = (long) inExt.numRows; if( !Info.dataPtr ) { ffpmsg("Unable to allocate memory for row selection"); ffcprs(); FFUNLOCK; return( *status = MEMORY_ALLOCATION ); } /* make sure array is zero terminated */ ((char*)Info.dataPtr)[inExt.numRows] = 0; if( constant ) { /* Set all rows to the same value from constant result */ result = gParse.Nodes[gParse.resultNode].value.data.log; for( ntodo = 0; ntodo 1) ffirow( outfptr, outExt.numRows, nGood, status ); } do { if( ((char*)Info.dataPtr)[inloc-1] ) { ffgtbb( infptr, inloc, 1L, rdlen, buffer+rdlen*nbuff, status ); nbuff++; if( nbuff==maxrows ) { ffptbb( outfptr, outloc, 1L, rdlen*nbuff, buffer, status ); outloc += nbuff; nbuff = 0; } } inloc++; } while( !*status && inloc<=inExt.numRows ); if( nbuff ) { ffptbb( outfptr, outloc, 1L, rdlen*nbuff, buffer, status ); outloc += nbuff; } if( infptr==outfptr ) { if( outloc<=inExt.numRows ) ffdrow( infptr, outloc, inExt.numRows-outloc+1, status ); } else if( inExt.heapSize && nGood ) { /* Copy heap, if it exists and at least one row copied */ /********************************************************/ /* Get location information from the output extension */ /********************************************************/ if( outfptr->HDUposition != (outfptr->Fptr)->curhdu ) ffmahd( outfptr, (outfptr->HDUposition) + 1, NULL, status ); outExt.dataStart = (outfptr->Fptr)->datastart; outExt.heapStart = (outfptr->Fptr)->heapstart; /*************************************************/ /* Insert more space into outfptr if necessary */ /*************************************************/ hsize = outExt.heapStart + outExt.heapSize; freespace = (long) (( ( (hsize + 2879) / 2880) * 2880) - hsize); ntodo = inExt.heapSize; if ( (freespace - ntodo) < 0) { /* not enough existing space? */ ntodo = (ntodo - freespace + 2879) / 2880; /* number of blocks */ ffiblk(outfptr, (long) ntodo, 1, status); /* insert the blocks */ } ffukyj( outfptr, "PCOUNT", inExt.heapSize+outExt.heapSize, NULL, status ); /*******************************************************/ /* Get location information from the input extension */ /*******************************************************/ if( infptr->HDUposition != (infptr->Fptr)->curhdu ) ffmahd( infptr, (infptr->HDUposition) + 1, NULL, status ); inExt.dataStart = (infptr->Fptr)->datastart; inExt.heapStart = (infptr->Fptr)->heapstart; /**********************************/ /* Finally copy heap to outfptr */ /**********************************/ ntodo = inExt.heapSize; inbyteloc = inExt.heapStart + inExt.dataStart; outbyteloc = outExt.heapStart + outExt.dataStart + outExt.heapSize; while ( ntodo && !*status ) { rdlen = (long) minvalue(ntodo,500000); ffmbyt( infptr, inbyteloc, REPORT_EOF, status ); ffgbyt( infptr, rdlen, buffer, status ); ffmbyt( outfptr, outbyteloc, IGNORE_EOF, status ); ffpbyt( outfptr, rdlen, buffer, status ); inbyteloc += rdlen; outbyteloc += rdlen; ntodo -= rdlen; } /***********************************************************/ /* But must update DES if data is being appended to a */ /* pre-existing heap space. Edit each new entry in file */ /***********************************************************/ if( outExt.heapSize ) { LONGLONG repeat, offset, j; int i; for( i=1; i<=(outfptr->Fptr)->tfield; i++ ) { if( (outfptr->Fptr)->tableptr[i-1].tdatatype<0 ) { for( j=outExt.numRows+1; j<=outExt.numRows+nGood; j++ ) { ffgdesll( outfptr, i, j, &repeat, &offset, status ); offset += outExt.heapSize; ffpdes( outfptr, i, j, repeat, offset, status ); } } } } } /* End of HEAP copy */ FREE(buffer); } FREE(Info.dataPtr); ffcprs(); ffcmph(outfptr, status); /* compress heap, deleting any orphaned data */ FFUNLOCK; return(*status); } /*---------------------------------------------------------------------------*/ int ffcrow( fitsfile *fptr, /* I - Input FITS file */ int datatype, /* I - Datatype to return results as */ char *expr, /* I - Arithmetic expression */ long firstrow, /* I - First row to evaluate */ long nelements, /* I - Number of elements to return */ void *nulval, /* I - Ptr to value to use as UNDEF */ void *array, /* O - Array of results */ int *anynul, /* O - Were any UNDEFs encountered? */ int *status ) /* O - Error status */ /* */ /* Calculate an expression for the indicated rows of a table, returning */ /* the results, cast as datatype (TSHORT, TDOUBLE, etc), in array. If */ /* nulval==NULL, UNDEFs will be zeroed out. For vector results, the number */ /* of elements returned may be less than nelements if nelements is not an */ /* even multiple of the result dimension. Call fftexp to obtain the */ /* dimensions of the results. */ /*---------------------------------------------------------------------------*/ { parseInfo Info; int naxis; long nelem1, naxes[MAXDIMS]; if( *status ) return( *status ); FFLOCK; if( ffiprs( fptr, 0, expr, MAXDIMS, &Info.datatype, &nelem1, &naxis, naxes, status ) ) { ffcprs(); FFUNLOCK; return( *status ); } if( nelem1<0 ) nelem1 = - nelem1; if( nelements1 ? firstrow : 1); if( datatype ) Info.datatype = datatype; Info.dataPtr = array; Info.nullPtr = nulval; Info.maxRows = nelements / nelem1; if( ffiter( gParse.nCols, gParse.colData, firstrow-1, 0, parse_data, (void*)&Info, status ) == -1 ) *status=0; /* -1 indicates exitted without error before end... OK */ *anynul = Info.anyNull; ffcprs(); FFUNLOCK; return( *status ); } /*--------------------------------------------------------------------------*/ int ffcalc( fitsfile *infptr, /* I - Input FITS file */ char *expr, /* I - Arithmetic expression */ fitsfile *outfptr, /* I - Output fits file */ char *parName, /* I - Name of output parameter */ char *parInfo, /* I - Extra information on parameter */ int *status ) /* O - Error status */ /* */ /* Evaluate an expression for all rows of a table. Call ffcalc_rng with */ /* a row range of 1-MAX. */ { long start=1, end=LONG_MAX; return ffcalc_rng( infptr, expr, outfptr, parName, parInfo, 1, &start, &end, status ); } /*--------------------------------------------------------------------------*/ int ffcalc_rng( fitsfile *infptr, /* I - Input FITS file */ char *expr, /* I - Arithmetic expression */ fitsfile *outfptr, /* I - Output fits file */ char *parName, /* I - Name of output parameter */ char *parInfo, /* I - Extra information on parameter */ int nRngs, /* I - Row range info */ long *start, /* I - Row range info */ long *end, /* I - Row range info */ int *status ) /* O - Error status */ /* */ /* Evaluate an expression using the data in the input FITS file and place */ /* the results into either a column or keyword in the output fits file, */ /* depending on the value of parName (keywords normally prefixed with '#') */ /* and whether the expression evaluates to a constant or a table column. */ /* The logic is as follows: */ /* (1) If a column exists with name, parName, put results there. */ /* (2) If parName starts with '#', as in #NAXIS, put result there, */ /* with parInfo used as the comment. If expression does not evaluate */ /* to a constant, flag an error. */ /* (3) If a keyword exists with name, parName, and expression is a */ /* constant, put result there, using parInfo as the new comment. */ /* (4) Else, create a new column with name parName and TFORM parInfo. */ /* If parInfo is NULL, use a default data type for the column. */ /*--------------------------------------------------------------------------*/ { parseInfo Info; int naxis, constant, typecode, newNullKwd=0; long nelem, naxes[MAXDIMS], repeat, width; int col_cnt, colNo; Node *result; char card[81], tform[16], nullKwd[9], tdimKwd[9]; if( *status ) return( *status ); FFLOCK; if( ffiprs( infptr, 0, expr, MAXDIMS, &Info.datatype, &nelem, &naxis, naxes, status ) ) { ffcprs(); FFUNLOCK; return( *status ); } if( nelem<0 ) { constant = 1; nelem = -nelem; } else constant = 0; /* Case (1): If column exists put it there */ colNo = 0; if( ffgcno( outfptr, CASEINSEN, parName, &colNo, status )==COL_NOT_FOUND ) { /* Output column doesn't exist. Test for keyword. */ /* Case (2): Does parName indicate result should be put into keyword */ *status = 0; if( parName[0]=='#' ) { if( ! constant ) { ffcprs(); ffpmsg( "Cannot put tabular result into keyword (ffcalc)" ); FFUNLOCK; return( *status = PARSE_BAD_TYPE ); } parName++; /* Advance past '#' */ if ( (fits_strcasecmp(parName,"HISTORY") == 0 || fits_strcasecmp(parName,"COMMENT") == 0) && Info.datatype != TSTRING ) { ffcprs(); ffpmsg( "HISTORY and COMMENT values must be strings (ffcalc)" ); FFUNLOCK; return( *status = PARSE_BAD_TYPE ); } } else if( constant ) { /* Case (3): Does a keyword named parName already exist */ if( ffgcrd( outfptr, parName, card, status )==KEY_NO_EXIST ) { colNo = -1; } else if( *status ) { ffcprs(); FFUNLOCK; return( *status ); } } else colNo = -1; if( colNo<0 ) { /* Case (4): Create new column */ *status = 0; ffgncl( outfptr, &colNo, status ); colNo++; if( parInfo==NULL || *parInfo=='\0' ) { /* Figure out best default column type */ if( gParse.hdutype==BINARY_TBL ) { snprintf(tform,15,"%ld",nelem); switch( Info.datatype ) { case TLOGICAL: strcat(tform,"L"); break; case TLONG: strcat(tform,"J"); break; case TDOUBLE: strcat(tform,"D"); break; case TSTRING: strcat(tform,"A"); break; case TBIT: strcat(tform,"X"); break; case TLONGLONG: strcat(tform,"K"); break; } } else { switch( Info.datatype ) { case TLOGICAL: ffcprs(); ffpmsg("Cannot create LOGICAL column in ASCII table"); FFUNLOCK; return( *status = NOT_BTABLE ); case TLONG: strcpy(tform,"I11"); break; case TDOUBLE: strcpy(tform,"D23.15"); break; case TSTRING: case TBIT: snprintf(tform,16,"A%ld",nelem); break; } } parInfo = tform; } else if( !(isdigit((int) *parInfo)) && gParse.hdutype==BINARY_TBL ) { if( Info.datatype==TBIT && *parInfo=='B' ) nelem = (nelem+7)/8; snprintf(tform,16,"%ld%s",nelem,parInfo); parInfo = tform; } fficol( outfptr, colNo, parName, parInfo, status ); if( naxis>1 ) ffptdm( outfptr, colNo, naxis, naxes, status ); /* Setup TNULLn keyword in case NULLs are encountered */ ffkeyn("TNULL", colNo, nullKwd, status); if( ffgcrd( outfptr, nullKwd, card, status )==KEY_NO_EXIST ) { *status = 0; if( gParse.hdutype==BINARY_TBL ) { LONGLONG nullVal=0; fits_binary_tform( parInfo, &typecode, &repeat, &width, status ); if( typecode==TBYTE ) nullVal = UCHAR_MAX; else if( typecode==TSHORT ) nullVal = SHRT_MIN; else if( typecode==TINT ) nullVal = INT_MIN; else if( typecode==TLONG ) nullVal = LONG_MIN; else if( typecode==TLONGLONG ) nullVal = LONGLONG_MIN; if( nullVal ) { ffpkyj( outfptr, nullKwd, nullVal, "Null value", status ); fits_set_btblnull( outfptr, colNo, nullVal, status ); newNullKwd = 1; } } else if( gParse.hdutype==ASCII_TBL ) { ffpkys( outfptr, nullKwd, "NULL", "Null value string", status ); fits_set_atblnull( outfptr, colNo, "NULL", status ); newNullKwd = 1; } } } } else if( *status ) { ffcprs(); FFUNLOCK; return( *status ); } else { /********************************************************/ /* Check if a TDIM keyword should be written/updated. */ /********************************************************/ ffkeyn("TDIM", colNo, tdimKwd, status); ffgcrd( outfptr, tdimKwd, card, status ); if( *status==0 ) { /* TDIM exists, so update it with result's dimension */ ffptdm( outfptr, colNo, naxis, naxes, status ); } else if( *status==KEY_NO_EXIST ) { /* TDIM does not exist, so clear error stack and */ /* write a TDIM only if result is multi-dimensional */ *status = 0; ffcmsg(); if( naxis>1 ) ffptdm( outfptr, colNo, naxis, naxes, status ); } if( *status ) { /* Either some other error happened in ffgcrd */ /* or one happened in ffptdm */ ffcprs(); FFUNLOCK; return( *status ); } } if( colNo>0 ) { /* Output column exists (now)... put results into it */ int anyNull = 0; int nPerLp, i; long totaln; ffgkyj(infptr, "NAXIS2", &totaln, 0, status); /*************************************/ /* Create new iterator Output Column */ /*************************************/ col_cnt = gParse.nCols; if( allocateCol( col_cnt, status ) ) { ffcprs(); FFUNLOCK; return( *status ); } fits_iter_set_by_num( gParse.colData+col_cnt, outfptr, colNo, 0, OutputCol ); gParse.nCols++; for( i=0; i= 10) && (nRngs == 1) && (start[0] == 1) && (end[0] == totaln)) nPerLp = 0; else nPerLp = Info.maxRows; if( ffiter( gParse.nCols, gParse.colData, start[i]-1, nPerLp, parse_data, (void*)&Info, status ) == -1 ) *status = 0; else if( *status ) { ffcprs(); FFUNLOCK; return( *status ); } if( Info.anyNull ) anyNull = 1; } if( newNullKwd && !anyNull ) { ffdkey( outfptr, nullKwd, status ); } } else { /* Put constant result into keyword */ result = gParse.Nodes + gParse.resultNode; switch( Info.datatype ) { case TDOUBLE: ffukyd( outfptr, parName, result->value.data.dbl, 15, parInfo, status ); break; case TLONG: ffukyj( outfptr, parName, result->value.data.lng, parInfo, status ); break; case TLOGICAL: ffukyl( outfptr, parName, result->value.data.log, parInfo, status ); break; case TBIT: case TSTRING: if (fits_strcasecmp(parName,"HISTORY") == 0) { ffphis( outfptr, result->value.data.str, status); } else if (fits_strcasecmp(parName,"COMMENT") == 0) { ffpcom( outfptr, result->value.data.str, status); } else { ffukys( outfptr, parName, result->value.data.str, parInfo, status ); } break; } } ffcprs(); FFUNLOCK; return( *status ); } /*--------------------------------------------------------------------------*/ int fftexp( fitsfile *fptr, /* I - Input FITS file */ char *expr, /* I - Arithmetic expression */ int maxdim, /* I - Max Dimension of naxes */ int *datatype, /* O - Data type of result */ long *nelem, /* O - Vector length of result */ int *naxis, /* O - # of dimensions of result */ long *naxes, /* O - Size of each dimension */ int *status ) /* O - Error status */ /* */ /* Evaluate the given expression and return information on the result. */ /*--------------------------------------------------------------------------*/ { FFLOCK; ffiprs( fptr, 0, expr, maxdim, datatype, nelem, naxis, naxes, status ); ffcprs(); FFUNLOCK; return( *status ); } /*--------------------------------------------------------------------------*/ int ffiprs( fitsfile *fptr, /* I - Input FITS file */ int compressed, /* I - Is FITS file hkunexpanded? */ char *expr, /* I - Arithmetic expression */ int maxdim, /* I - Max Dimension of naxes */ int *datatype, /* O - Data type of result */ long *nelem, /* O - Vector length of result */ int *naxis, /* O - # of dimensions of result */ long *naxes, /* O - Size of each dimension */ int *status ) /* O - Error status */ /* */ /* Initialize the parser and determine what type of result the expression */ /* produces. */ /*--------------------------------------------------------------------------*/ { Node *result; int i,lexpr, tstatus = 0; int xaxis, bitpix; long xaxes[9]; static iteratorCol dmyCol; if( *status ) return( *status ); /* make sure all internal structures for this HDU are current */ if ( ffrdef(fptr, status) ) return(*status); /* Initialize the Parser structure */ gParse.def_fptr = fptr; gParse.compressed = compressed; gParse.nCols = 0; gParse.colData = NULL; gParse.varData = NULL; gParse.getData = find_column; gParse.loadData = load_column; gParse.Nodes = NULL; gParse.nNodesAlloc= 0; gParse.nNodes = 0; gParse.hdutype = 0; gParse.status = 0; fits_get_hdu_type(fptr, &gParse.hdutype, status ); if (gParse.hdutype == IMAGE_HDU) { fits_get_img_param(fptr, 9, &bitpix, &xaxis, xaxes, status); if (*status) { ffpmsg("ffiprs: unable to get image dimensions"); return( *status ); } gParse.totalRows = xaxis > 0 ? 1 : 0; for (i = 0; i < xaxis; ++i) gParse.totalRows *= xaxes[i]; if (DEBUG_PIXFILTER) printf("naxis=%d, gParse.totalRows=%ld\n", xaxis, gParse.totalRows); } else if( ffgkyj(fptr, "NAXIS2", &gParse.totalRows, 0, &tstatus) ) { /* this might be a 1D or null image with no NAXIS2 keyword */ gParse.totalRows = 0; } /* Copy expression into parser... read from file if necessary */ if( expr[0]=='@' ) { if( ffimport_file( expr+1, &gParse.expr, status ) ) return( *status ); lexpr = strlen(gParse.expr); } else { lexpr = strlen(expr); gParse.expr = (char*)malloc( (2+lexpr)*sizeof(char)); strcpy(gParse.expr,expr); } strcat(gParse.expr + lexpr,"\n"); gParse.index = 0; gParse.is_eobuf = 0; /* Parse the expression, building the Nodes and determing */ /* which columns are needed and what data type is returned */ ffrestart(NULL); if( ffparse() ) { return( *status = PARSE_SYNTAX_ERR ); } /* Check results */ *status = gParse.status; if( *status ) return(*status); if( !gParse.nNodes ) { ffpmsg("Blank expression"); return( *status = PARSE_SYNTAX_ERR ); } if( !gParse.nCols ) { dmyCol.fptr = fptr; /* This allows iterator to know value of */ gParse.colData = &dmyCol; /* fptr when no columns are referenced */ } result = gParse.Nodes + gParse.resultNode; *naxis = result->value.naxis; *nelem = result->value.nelem; for( i=0; i<*naxis && ivalue.naxes[i]; switch( result->type ) { case BOOLEAN: *datatype = TLOGICAL; break; case LONG: *datatype = TLONG; break; case DOUBLE: *datatype = TDOUBLE; break; case BITSTR: *datatype = TBIT; break; case STRING: *datatype = TSTRING; break; default: *datatype = 0; ffpmsg("Bad return data type"); *status = gParse.status = PARSE_BAD_TYPE; break; } gParse.datatype = *datatype; FREE(gParse.expr); if( result->operation==CONST_OP ) *nelem = - *nelem; return(*status); } /*--------------------------------------------------------------------------*/ void ffcprs( void ) /* No parameters */ /* */ /* Clear the parser, making it ready to accept a new expression. */ /*--------------------------------------------------------------------------*/ { int col, node, i; if( gParse.nCols > 0 ) { FREE( gParse.colData ); for( col=0; col 0 ) { node = gParse.nNodes; while( node-- ) { if( gParse.Nodes[node].operation==gtifilt_fct ) { i = gParse.Nodes[node].SubNodes[0]; if (gParse.Nodes[ i ].value.data.ptr) FREE( gParse.Nodes[ i ].value.data.ptr ); } else if( gParse.Nodes[node].operation==regfilt_fct ) { i = gParse.Nodes[node].SubNodes[0]; fits_free_region( (SAORegion *)gParse.Nodes[ i ].value.data.ptr ); } } gParse.nNodes = 0; } if( gParse.Nodes ) free( gParse.Nodes ); gParse.Nodes = NULL; gParse.hdutype = ANY_HDU; gParse.pixFilter = 0; } /*---------------------------------------------------------------------------*/ int parse_data( long totalrows, /* I - Total rows to be processed */ long offset, /* I - Number of rows skipped at start*/ long firstrow, /* I - First row of this iteration */ long nrows, /* I - Number of rows in this iter */ int nCols, /* I - Number of columns in use */ iteratorCol *colData, /* IO- Column information/data */ void *userPtr ) /* I - Data handling instructions */ /* */ /* Iterator work function which calls the parser and copies the results */ /* into either an OutputCol or a data pointer supplied in the userPtr */ /* structure. */ /*---------------------------------------------------------------------------*/ { int status, constant=0, anyNullThisTime=0; long jj, kk, idx, remain, ntodo; Node *result; iteratorCol * outcol; /* declare variables static to preserve their values between calls */ static void *Data, *Null; static int datasize; static long lastRow, repeat, resDataSize; static LONGLONG jnull; static parseInfo *userInfo; static long zeros[4] = {0,0,0,0}; if (DEBUG_PIXFILTER) printf("parse_data(total=%ld, offset=%ld, first=%ld, rows=%ld, cols=%d)\n", totalrows, offset, firstrow, nrows, nCols); /*--------------------------------------------------------*/ /* Initialization procedures: execute on the first call */ /*--------------------------------------------------------*/ outcol = colData + (nCols - 1); if (firstrow == offset+1) { userInfo = (parseInfo*)userPtr; userInfo->anyNull = 0; if( userInfo->maxRows>0 ) userInfo->maxRows = minvalue(totalrows,userInfo->maxRows); else if( userInfo->maxRows<0 ) userInfo->maxRows = totalrows; else userInfo->maxRows = nrows; lastRow = firstrow + userInfo->maxRows - 1; if( userInfo->dataPtr==NULL ) { if( outcol->iotype == InputCol ) { ffpmsg("Output column for parser results not found!"); return( PARSE_NO_OUTPUT ); } /* Data gets set later */ Null = outcol->array; userInfo->datatype = outcol->datatype; /* Check for a TNULL/BLANK keyword for output column/image */ status = 0; jnull = 0; if (gParse.hdutype == IMAGE_HDU) { if (gParse.pixFilter->blank) jnull = (LONGLONG) gParse.pixFilter->blank; } else { ffgknjj( outcol->fptr, "TNULL", outcol->colnum, 1, &jnull, (int*)&jj, &status ); if( status==BAD_INTKEY ) { /* Probably ASCII table with text TNULL keyword */ switch( userInfo->datatype ) { case TSHORT: jnull = (LONGLONG) SHRT_MIN; break; case TINT: jnull = (LONGLONG) INT_MIN; break; case TLONG: jnull = (LONGLONG) LONG_MIN; break; } } } repeat = outcol->repeat; /* if (DEBUG_PIXFILTER) printf("parse_data: using null value %ld\n", jnull); */ } else { Data = userInfo->dataPtr; Null = (userInfo->nullPtr ? userInfo->nullPtr : zeros); repeat = gParse.Nodes[gParse.resultNode].value.nelem; } /* Determine the size of each element of the returned result */ switch( userInfo->datatype ) { case TBIT: /* Fall through to TBYTE */ case TLOGICAL: /* Fall through to TBYTE */ case TBYTE: datasize = sizeof(char); break; case TSHORT: datasize = sizeof(short); break; case TINT: datasize = sizeof(int); break; case TLONG: datasize = sizeof(long); break; case TLONGLONG: datasize = sizeof(LONGLONG); break; case TFLOAT: datasize = sizeof(float); break; case TDOUBLE: datasize = sizeof(double); break; case TSTRING: datasize = sizeof(char*); break; } /* Determine the size of each element of the calculated result */ /* (only matters for numeric/logical data) */ switch( gParse.Nodes[gParse.resultNode].type ) { case BOOLEAN: resDataSize = sizeof(char); break; case LONG: resDataSize = sizeof(long); break; case DOUBLE: resDataSize = sizeof(double); break; } } /*-------------------------------------------*/ /* Main loop: process all the rows of data */ /*-------------------------------------------*/ /* If writing to output column, set first element to appropriate */ /* null value. If no NULLs encounter, zero out before returning. */ /* if (DEBUG_PIXFILTER) printf("parse_data: using null value %ld\n", jnull); */ if( userInfo->dataPtr == NULL ) { /* First, reset Data pointer to start of output array */ Data = (char*) outcol->array + datasize; switch( userInfo->datatype ) { case TLOGICAL: *(char *)Null = 'U'; break; case TBYTE: *(char *)Null = (char )jnull; break; case TSHORT: *(short *)Null = (short)jnull; break; case TINT: *(int *)Null = (int )jnull; break; case TLONG: *(long *)Null = (long )jnull; break; case TLONGLONG: *(LONGLONG *)Null = (LONGLONG )jnull; break; case TFLOAT: *(float *)Null = FLOATNULLVALUE; break; case TDOUBLE: *(double*)Null = DOUBLENULLVALUE; break; case TSTRING: (*(char **)Null)[0] = '\1'; (*(char **)Null)[1] = '\0'; break; } } /* Alter nrows in case calling routine didn't want to do all rows */ nrows = minvalue(nrows,lastRow-firstrow+1); Setup_DataArrays( nCols, colData, firstrow, nrows ); /* Parser allocates arrays for each column and calculation it performs. */ /* Limit number of rows processed during each pass to reduce memory */ /* requirements... In most cases, iterator will limit rows to less */ /* than 2500 rows per iteration, so this is really only relevant for */ /* hk-compressed files which must be decompressed in memory and sent */ /* whole to parse_data in a single iteration. */ remain = nrows; while( remain ) { ntodo = minvalue(remain,2500); Evaluate_Parser ( firstrow, ntodo ); if( gParse.status ) break; firstrow += ntodo; remain -= ntodo; /* Copy results into data array */ result = gParse.Nodes + gParse.resultNode; if( result->operation==CONST_OP ) constant = 1; switch( result->type ) { case BOOLEAN: case LONG: case DOUBLE: if( constant ) { char undef=0; for( kk=0; kkvalue.data), &undef, result->value.nelem /* 1 */, userInfo->datatype, Null, (char*)Data + (kk*repeat+jj)*datasize, &anyNullThisTime, &gParse.status ); } else { if ( repeat == result->value.nelem ) { ffcvtn( gParse.datatype, result->value.data.ptr, result->value.undef, result->value.nelem*ntodo, userInfo->datatype, Null, Data, &anyNullThisTime, &gParse.status ); } else if( result->value.nelem == 1 ) { for( kk=0; kkvalue.data.ptr + kk*resDataSize, (char*)result->value.undef + kk, 1, userInfo->datatype, Null, (char*)Data + (kk*repeat+jj)*datasize, &anyNullThisTime, &gParse.status ); } } else { int nCopy; nCopy = minvalue( repeat, result->value.nelem ); for( kk=0; kkvalue.data.ptr + kk*result->value.nelem*resDataSize, (char*)result->value.undef + kk*result->value.nelem, nCopy, userInfo->datatype, Null, (char*)Data + (kk*repeat)*datasize, &anyNullThisTime, &gParse.status ); if( nCopy < repeat ) { memset( (char*)Data + (kk*repeat+nCopy)*datasize, 0, (repeat-nCopy)*datasize); } } } if( result->operation>0 ) { FREE( result->value.data.ptr ); } } if( gParse.status==OVERFLOW_ERR ) { gParse.status = NUM_OVERFLOW; ffpmsg("Numerical overflow while converting expression to necessary datatype"); } break; case BITSTR: switch( userInfo->datatype ) { case TBYTE: idx = -1; for( kk=0; kkvalue.nelem; jj++ ) { if( jj%8 == 0 ) ((char*)Data)[++idx] = 0; if( constant ) { if( result->value.data.str[jj]=='1' ) ((char*)Data)[idx] |= 128>>(jj%8); } else { if( result->value.data.strptr[kk][jj]=='1' ) ((char*)Data)[idx] |= 128>>(jj%8); } } } break; case TBIT: case TLOGICAL: if( constant ) { for( kk=0; kkvalue.nelem; jj++ ) { ((char*)Data)[ jj+kk*result->value.nelem ] = ( result->value.data.str[jj]=='1' ); } } else { for( kk=0; kkvalue.nelem; jj++ ) { ((char*)Data)[ jj+kk*result->value.nelem ] = ( result->value.data.strptr[kk][jj]=='1' ); } } break; case TSTRING: if( constant ) { for( jj=0; jjvalue.data.str ); } } else { for( jj=0; jjvalue.data.strptr[jj] ); } } break; default: ffpmsg("Cannot convert bit expression to desired type."); gParse.status = PARSE_BAD_TYPE; break; } if( result->operation>0 ) { FREE( result->value.data.strptr[0] ); FREE( result->value.data.strptr ); } break; case STRING: if( userInfo->datatype==TSTRING ) { if( constant ) { for( jj=0; jjvalue.data.str ); } else { for( jj=0; jjvalue.undef[jj] ) { anyNullThisTime = 1; strcpy( ((char**)Data)[jj], *(char **)Null ); } else { strcpy( ((char**)Data)[jj], result->value.data.strptr[jj] ); } } } else { ffpmsg("Cannot convert string expression to desired type."); gParse.status = PARSE_BAD_TYPE; } if( result->operation>0 ) { FREE( result->value.data.strptr[0] ); FREE( result->value.data.strptr ); } break; } if( gParse.status ) break; /* Increment Data to point to where the next block should go */ if( result->type==BITSTR && userInfo->datatype==TBYTE ) Data = (char*)Data + datasize * ( (result->value.nelem+7)/8 ) * ntodo; else if( result->type==STRING ) Data = (char*)Data + datasize * ntodo; else Data = (char*)Data + datasize * ntodo * repeat; } /* If no NULLs encountered during this pass, set Null value to */ /* zero to make the writing of the output column data faster */ if( anyNullThisTime ) userInfo->anyNull = 1; else if( userInfo->dataPtr == NULL ) { if( userInfo->datatype == TSTRING ) memcpy( *(char **)Null, zeros, 2 ); else memcpy( Null, zeros, datasize ); } /*-------------------------------------------------------*/ /* Clean up procedures: after processing all the rows */ /*-------------------------------------------------------*/ /* if the calling routine specified that only a limited number */ /* of rows in the table should be processed, return a value of -1 */ /* once all the rows have been done, if no other error occurred. */ if (gParse.hdutype != IMAGE_HDU && firstrow - 1 == lastRow) { if (!gParse.status && userInfo->maxRowsiotype == OutputCol ) continue; nelem = varData->nelem; len = nelem * nRows; switch ( varData->type ) { case BITSTR: /* No need for UNDEF array, but must make string DATA array */ len = (nelem+1)*nRows; /* Count '\0' */ bitStrs = (char**)varData->data; if( bitStrs ) FREE( bitStrs[0] ); free( bitStrs ); bitStrs = (char**)malloc( nRows*sizeof(char*) ); if( bitStrs==NULL ) { varData->data = varData->undef = NULL; gParse.status = MEMORY_ALLOCATION; break; } bitStrs[0] = (char*)malloc( len*sizeof(char) ); if( bitStrs[0]==NULL ) { free( bitStrs ); varData->data = varData->undef = NULL; gParse.status = MEMORY_ALLOCATION; break; } for( row=0; rowarray)[idx] & (1<<(7-len%8)) ) bitStrs[row][len] = '1'; else bitStrs[row][len] = '0'; if( len%8==7 ) idx++; } bitStrs[row][len] = '\0'; } varData->undef = (char*)bitStrs; varData->data = (char*)bitStrs; break; case STRING: sptr = (char**)icol->array; if (varData->undef) free( varData->undef ); varData->undef = (char*)malloc( nRows*sizeof(char) ); if( varData->undef==NULL ) { gParse.status = MEMORY_ALLOCATION; break; } row = nRows; while( row-- ) varData->undef[row] = ( **sptr != '\0' && FSTRCMP( sptr[0], sptr[row+1] )==0 ); varData->data = sptr + 1; break; case BOOLEAN: barray = (char*)icol->array; if (varData->undef) free( varData->undef ); varData->undef = (char*)malloc( len*sizeof(char) ); if( varData->undef==NULL ) { gParse.status = MEMORY_ALLOCATION; break; } while( len-- ) { varData->undef[len] = ( barray[0]!=0 && barray[0]==barray[len+1] ); } varData->data = barray + 1; break; case LONG: iarray = (long*)icol->array; if (varData->undef) free( varData->undef ); varData->undef = (char*)malloc( len*sizeof(char) ); if( varData->undef==NULL ) { gParse.status = MEMORY_ALLOCATION; break; } while( len-- ) { varData->undef[len] = ( iarray[0]!=0L && iarray[0]==iarray[len+1] ); } varData->data = iarray + 1; break; case DOUBLE: rarray = (double*)icol->array; if (varData->undef) free( varData->undef ); varData->undef = (char*)malloc( len*sizeof(char) ); if( varData->undef==NULL ) { gParse.status = MEMORY_ALLOCATION; break; } while( len-- ) { varData->undef[len] = ( rarray[0]!=0.0 && rarray[0]==rarray[len+1]); } varData->data = rarray + 1; break; default: snprintf(msg, 80, "SetupDataArrays, unhandled type %d\n", varData->type); ffpmsg(msg); } if( gParse.status ) { /* Deallocate NULL arrays of previous columns */ while( i-- ) { varData = gParse.varData + i; if( varData->type==BITSTR ) FREE( ((char**)varData->data)[0] ); FREE( varData->undef ); varData->undef = NULL; } return; } } } /*--------------------------------------------------------------------------*/ int ffcvtn( int inputType, /* I - Data type of input array */ void *input, /* I - Input array of type inputType */ char *undef, /* I - Array of flags indicating UNDEF elems */ long ntodo, /* I - Number of elements to process */ int outputType, /* I - Data type of output array */ void *nulval, /* I - Ptr to value to use for UNDEF elements */ void *output, /* O - Output array of type outputType */ int *anynull, /* O - Any nulls flagged? */ int *status ) /* O - Error status */ /* */ /* Convert an array of any input data type to an array of any output */ /* data type, using an array of UNDEF flags to assign nulvals to */ /*--------------------------------------------------------------------------*/ { long i; switch( outputType ) { case TLOGICAL: switch( inputType ) { case TLOGICAL: case TBYTE: for( i=0; i UCHAR_MAX ) { *status = OVERFLOW_ERR; ((unsigned char*)output)[i] = UCHAR_MAX; } else ((unsigned char*)output)[i] = (unsigned char) ((long*)input)[i]; } } return( *status ); case TFLOAT: fffr4i1((float*)input,ntodo,1.,0.,0,0,NULL,NULL, (unsigned char*)output,status); break; case TDOUBLE: fffr8i1((double*)input,ntodo,1.,0.,0,0,NULL,NULL, (unsigned char*)output,status); break; default: *status = BAD_DATATYPE; break; } for(i=0;i SHRT_MAX ) { *status = OVERFLOW_ERR; ((short*)output)[i] = SHRT_MAX; } else ((short*)output)[i] = (short) ((long*)input)[i]; } } return( *status ); case TFLOAT: fffr4i2((float*)input,ntodo,1.,0.,0,0,NULL,NULL, (short*)output,status); break; case TDOUBLE: fffr8i2((double*)input,ntodo,1.,0.,0,0,NULL,NULL, (short*)output,status); break; default: *status = BAD_DATATYPE; break; } for(i=0;i=0 ) { found[parNo] = 1; /* Flag this parameter as found */ switch( gParse.colData[parNo].datatype ) { case TLONG: ffgcvj( fptr, gParse.valCol, row, 1L, 1L, ((long*)gParse.colData[parNo].array)[0], ((long*)gParse.colData[parNo].array)+currelem, &anynul, status ); break; case TDOUBLE: ffgcvd( fptr, gParse.valCol, row, 1L, 1L, ((double*)gParse.colData[parNo].array)[0], ((double*)gParse.colData[parNo].array)+currelem, &anynul, status ); break; case TSTRING: ffgcvs( fptr, gParse.valCol, row, 1L, 1L, ((char**)gParse.colData[parNo].array)[0], ((char**)gParse.colData[parNo].array)+currelem, &anynul, status ); break; } if( *status ) return( *status ); } } if( currelemoperation==CONST_OP ) { if( result->value.data.log ) { *(long*)userPtr = firstrow; return( -1 ); } } else { for( idx=0; idxvalue.data.logptr[idx] && !result->value.undef[idx] ) { *(long*)userPtr = firstrow + idx; return( -1 ); } } } return( gParse.status ); } static int set_image_col_types (fitsfile * fptr, const char * name, int bitpix, DataInfo * varInfo, iteratorCol *colIter) { int istatus; double tscale, tzero; char temp[80]; switch (bitpix) { case BYTE_IMG: case SHORT_IMG: case LONG_IMG: istatus = 0; if (fits_read_key(fptr, TDOUBLE, "BZERO", &tzero, NULL, &istatus)) tzero = 0.0; istatus = 0; if (fits_read_key(fptr, TDOUBLE, "BSCALE", &tscale, NULL, &istatus)) tscale = 1.0; if (tscale == 1.0 && (tzero == 0.0 || tzero == 32768.0 )) { varInfo->type = LONG; colIter->datatype = TLONG; } else { varInfo->type = DOUBLE; colIter->datatype = TDOUBLE; if (DEBUG_PIXFILTER) printf("use DOUBLE for %s with BSCALE=%g/BZERO=%g\n", name, tscale, tzero); } break; case LONGLONG_IMG: case FLOAT_IMG: case DOUBLE_IMG: varInfo->type = DOUBLE; colIter->datatype = TDOUBLE; break; default: snprintf(temp, 80,"set_image_col_types: unrecognized image bitpix [%d]\n", bitpix); ffpmsg(temp); return gParse.status = PARSE_BAD_TYPE; } return 0; } /************************************************************************* Functions used by the evaluator to access FITS data (find_column, find_keywd, allocateCol, load_column) *************************************************************************/ static int find_column( char *colName, void *itslval ) { FFSTYPE *thelval = (FFSTYPE*)itslval; int col_cnt, status; int colnum, typecode, type; long repeat, width; fitsfile *fptr; char temp[80]; double tzero,tscale; int istatus; DataInfo *varInfo; iteratorCol *colIter; if (DEBUG_PIXFILTER) printf("find_column(%s)\n", colName); if( *colName == '#' ) return( find_keywd( colName + 1, itslval ) ); fptr = gParse.def_fptr; status = 0; col_cnt = gParse.nCols; if (gParse.hdutype == IMAGE_HDU) { int i; if (!gParse.pixFilter) { gParse.status = COL_NOT_FOUND; ffpmsg("find_column: IMAGE_HDU but no PixelFilter"); return pERROR; } colnum = -1; for (i = 0; i < gParse.pixFilter->count; ++i) { if (!fits_strcasecmp(colName, gParse.pixFilter->tag[i])) colnum = i; } if (colnum < 0) { snprintf(temp, 80, "find_column: PixelFilter tag %s not found", colName); ffpmsg(temp); gParse.status = COL_NOT_FOUND; return pERROR; } if( allocateCol( col_cnt, &gParse.status ) ) return pERROR; varInfo = gParse.varData + col_cnt; colIter = gParse.colData + col_cnt; fptr = gParse.pixFilter->ifptr[colnum]; fits_get_img_param(fptr, MAXDIMS, &typecode, /* actually bitpix */ &varInfo->naxis, &varInfo->naxes[0], &status); varInfo->nelem = 1; type = COLUMN; if (set_image_col_types(fptr, colName, typecode, varInfo, colIter)) return pERROR; colIter->fptr = fptr; colIter->iotype = InputCol; } else { /* HDU holds a table */ if( gParse.compressed ) colnum = gParse.valCol; else if( fits_get_colnum( fptr, CASEINSEN, colName, &colnum, &status ) ) { if( status == COL_NOT_FOUND ) { type = find_keywd( colName, itslval ); if( type != pERROR ) ffcmsg(); return( type ); } gParse.status = status; return pERROR; } if( fits_get_coltype( fptr, colnum, &typecode, &repeat, &width, &status ) ) { gParse.status = status; return pERROR; } if( allocateCol( col_cnt, &gParse.status ) ) return pERROR; varInfo = gParse.varData + col_cnt; colIter = gParse.colData + col_cnt; fits_iter_set_by_num( colIter, fptr, colnum, 0, InputCol ); } /* Make sure we don't overflow variable name array */ strncpy(varInfo->name,colName,MAXVARNAME); varInfo->name[MAXVARNAME] = '\0'; if (gParse.hdutype != IMAGE_HDU) { switch( typecode ) { case TBIT: varInfo->type = BITSTR; colIter->datatype = TBYTE; type = BITCOL; break; case TBYTE: case TSHORT: case TLONG: /* The datatype of column with TZERO and TSCALE keywords might be float or double. */ snprintf(temp,80,"TZERO%d",colnum); istatus = 0; if(fits_read_key(fptr,TDOUBLE,temp,&tzero,NULL,&istatus)) { tzero = 0.0; } snprintf(temp,80,"TSCAL%d",colnum); istatus = 0; if(fits_read_key(fptr,TDOUBLE,temp,&tscale,NULL,&istatus)) { tscale = 1.0; } if (tscale == 1.0 && (tzero == 0.0 || tzero == 32768.0 )) { varInfo->type = LONG; colIter->datatype = TLONG; /* Reading an unsigned long column as a long can cause overflow errors. Treat the column as a double instead. } else if (tscale == 1.0 && tzero == 2147483648.0 ) { varInfo->type = LONG; colIter->datatype = TULONG; */ } else { varInfo->type = DOUBLE; colIter->datatype = TDOUBLE; } type = COLUMN; break; /* For now, treat 8-byte integer columns as type double. This can lose precision, so the better long term solution will be to add support for TLONGLONG as a separate datatype. */ case TLONGLONG: case TFLOAT: case TDOUBLE: varInfo->type = DOUBLE; colIter->datatype = TDOUBLE; type = COLUMN; break; case TLOGICAL: varInfo->type = BOOLEAN; colIter->datatype = TLOGICAL; type = BCOLUMN; break; case TSTRING: varInfo->type = STRING; colIter->datatype = TSTRING; type = SCOLUMN; if ( width >= MAX_STRLEN ) { snprintf(temp, 80, "column %d is wider than maximum %d characters", colnum, MAX_STRLEN-1); ffpmsg(temp); gParse.status = PARSE_LRG_VECTOR; return pERROR; } if( gParse.hdutype == ASCII_TBL ) repeat = width; break; default: if (typecode < 0) { snprintf(temp, 80,"variable-length array columns are not supported. typecode = %d", typecode); ffpmsg(temp); } gParse.status = PARSE_BAD_TYPE; return pERROR; } varInfo->nelem = repeat; if( repeat>1 && typecode!=TSTRING ) { if( fits_read_tdim( fptr, colnum, MAXDIMS, &varInfo->naxis, &varInfo->naxes[0], &status ) ) { gParse.status = status; return pERROR; } } else { varInfo->naxis = 1; varInfo->naxes[0] = 1; } } gParse.nCols++; thelval->lng = col_cnt; return( type ); } static int find_keywd(char *keyname, void *itslval ) { FFSTYPE *thelval = (FFSTYPE*)itslval; int status, type; char keyvalue[FLEN_VALUE], dtype; fitsfile *fptr; double rval; int bval; long ival; status = 0; fptr = gParse.def_fptr; if( fits_read_keyword( fptr, keyname, keyvalue, NULL, &status ) ) { if( status == KEY_NO_EXIST ) { /* Do this since ffgkey doesn't put an error message on stack */ snprintf(keyvalue,FLEN_VALUE, "ffgkey could not find keyword: %s",keyname); ffpmsg(keyvalue); } gParse.status = status; return( pERROR ); } if( fits_get_keytype( keyvalue, &dtype, &status ) ) { gParse.status = status; return( pERROR ); } switch( dtype ) { case 'C': fits_read_key_str( fptr, keyname, keyvalue, NULL, &status ); type = STRING; strcpy( thelval->str , keyvalue ); break; case 'L': fits_read_key_log( fptr, keyname, &bval, NULL, &status ); type = BOOLEAN; thelval->log = bval; break; case 'I': fits_read_key_lng( fptr, keyname, &ival, NULL, &status ); type = LONG; thelval->lng = ival; break; case 'F': fits_read_key_dbl( fptr, keyname, &rval, NULL, &status ); type = DOUBLE; thelval->dbl = rval; break; default: type = pERROR; break; } if( status ) { gParse.status=status; return pERROR; } return( type ); } static int allocateCol( int nCol, int *status ) { if( (nCol%25)==0 ) { if( nCol ) { gParse.colData = (iteratorCol*) realloc( gParse.colData, (nCol+25)*sizeof(iteratorCol) ); gParse.varData = (DataInfo *) realloc( gParse.varData, (nCol+25)*sizeof(DataInfo) ); } else { gParse.colData = (iteratorCol*) malloc( 25*sizeof(iteratorCol) ); gParse.varData = (DataInfo *) malloc( 25*sizeof(DataInfo) ); } if( gParse.colData == NULL || gParse.varData == NULL ) { if( gParse.colData ) free(gParse.colData); if( gParse.varData ) free(gParse.varData); gParse.colData = NULL; gParse.varData = NULL; return( *status = MEMORY_ALLOCATION ); } } gParse.varData[nCol].data = NULL; gParse.varData[nCol].undef = NULL; return 0; } static int load_column( int varNum, long fRow, long nRows, void *data, char *undef ) { iteratorCol *var = gParse.colData+varNum; long nelem,nbytes,row,len,idx; char **bitStrs, msg[80]; unsigned char *bytes; int status = 0, anynul; if (gParse.hdutype == IMAGE_HDU) { /* This test would need to be on a per varNum basis to support * cross HDU operations */ fits_read_imgnull(var->fptr, var->datatype, fRow, nRows, data, undef, &anynul, &status); if (DEBUG_PIXFILTER) printf("load_column: IMAGE_HDU fRow=%ld, nRows=%ld => %d\n", fRow, nRows, status); } else { nelem = nRows * var->repeat; switch( var->datatype ) { case TBYTE: nbytes = ((var->repeat+7)/8) * nRows; bytes = (unsigned char *)malloc( nbytes * sizeof(char) ); ffgcvb(var->fptr, var->colnum, fRow, 1L, nbytes, 0, bytes, &anynul, &status); nelem = var->repeat; bitStrs = (char **)data; for( row=0; rowfptr, var->colnum, fRow, 1L, nRows, (char **)data, undef, &anynul, &status); break; case TLOGICAL: ffgcfl(var->fptr, var->colnum, fRow, 1L, nelem, (char *)data, undef, &anynul, &status); break; case TLONG: ffgcfj(var->fptr, var->colnum, fRow, 1L, nelem, (long *)data, undef, &anynul, &status); break; case TDOUBLE: ffgcfd(var->fptr, var->colnum, fRow, 1L, nelem, (double *)data, undef, &anynul, &status); break; default: snprintf(msg,80,"load_column: unexpected datatype %d", var->datatype); ffpmsg(msg); } } if( status ) { gParse.status = status; return pERROR; } return 0; } /*--------------------------------------------------------------------------*/ int fits_pixel_filter (PixelFilter * filter, int * status) /* Evaluate an expression using the data in the input FITS file(s) */ /*--------------------------------------------------------------------------*/ { parseInfo Info = { 0 }; int naxis, bitpix; long nelem, naxes[MAXDIMS]; int col_cnt; Node *result; int datatype; fitsfile * infptr; fitsfile * outfptr; char * DEFAULT_TAGS[] = { "X" }; char msg[256]; int writeBlankKwd = 0; /* write BLANK if any output nulls? */ DEBUG_PIXFILTER = getenv("DEBUG_PIXFILTER") ? 1 : 0; if (*status) return (*status); FFLOCK; if (!filter->tag || !filter->tag[0] || !filter->tag[0][0]) { filter->tag = DEFAULT_TAGS; if (DEBUG_PIXFILTER) printf("using default tag '%s'\n", filter->tag[0]); } infptr = filter->ifptr[0]; outfptr = filter->ofptr; gParse.pixFilter = filter; if (ffiprs(infptr, 0, filter->expression, MAXDIMS, &Info.datatype, &nelem, &naxis, naxes, status)) { goto CLEANUP; } if (nelem < 0) { nelem = -nelem; } { /* validate result type */ const char * type = 0; switch (Info.datatype) { case TLOGICAL: type = "LOGICAL"; break; case TLONG: type = "LONG"; break; case TDOUBLE: type = "DOUBLE"; break; case TSTRING: type = "STRING"; *status = pERROR; ffpmsg("pixel_filter: cannot have string image"); case TBIT: type = "BIT"; if (DEBUG_PIXFILTER) printf("hmm, image from bits?\n"); break; default: type = "UNKNOWN?!"; *status = pERROR; ffpmsg("pixel_filter: unexpected result datatype"); } if (DEBUG_PIXFILTER) printf("result type is %s [%d]\n", type, Info.datatype); if (*status) goto CLEANUP; } if (fits_get_img_param(infptr, MAXDIMS, &bitpix, &naxis, &naxes[0], status)) { ffpmsg("pixel_filter: unable to read input image parameters"); goto CLEANUP; } if (DEBUG_PIXFILTER) printf("input bitpix %d\n", bitpix); if (Info.datatype == TDOUBLE) { /* for floating point expressions, set the default output image to bitpix = -32 (float) unless the default is already a double */ if (bitpix != DOUBLE_IMG) bitpix = FLOAT_IMG; } /* override output image bitpix if specified by caller */ if (filter->bitpix) bitpix = filter->bitpix; if (DEBUG_PIXFILTER) printf("output bitpix %d\n", bitpix); if (fits_create_img(outfptr, bitpix, naxis, naxes, status)) { ffpmsg("pixel_filter: unable to create output image"); goto CLEANUP; } /* transfer keycards */ { int i, ncards, more; if (fits_get_hdrspace(infptr, &ncards, &more, status)) { ffpmsg("pixel_filter: unable to determine number of keycards"); goto CLEANUP; } for (i = 1; i <= ncards; ++i) { int keyclass; char card[FLEN_CARD]; if (fits_read_record(infptr, i, card, status)) { snprintf(msg, 256,"pixel_filter: unable to read keycard %d", i); ffpmsg(msg); goto CLEANUP; } keyclass = fits_get_keyclass(card); if (keyclass == TYP_STRUC_KEY) { /* output structure defined by fits_create_img */ } else if (keyclass == TYP_COMM_KEY && i < 12) { /* assume this is one of the FITS standard comments */ } else if (keyclass == TYP_NULL_KEY && bitpix < 0) { /* do not transfer BLANK to real output image */ } else if (keyclass == TYP_SCAL_KEY && bitpix < 0) { /* do not transfer BZERO, BSCALE to real output image */ } else if (fits_write_record(outfptr, card, status)) { snprintf(msg,256, "pixel_filter: unable to write keycard '%s' [%d]\n", card, *status); ffpmsg(msg); goto CLEANUP; } } } switch (bitpix) { case BYTE_IMG: datatype = TLONG; Info.datatype = TBYTE; break; case SHORT_IMG: datatype = TLONG; Info.datatype = TSHORT; break; case LONG_IMG: datatype = TLONG; Info.datatype = TLONG; break; case FLOAT_IMG: datatype = TDOUBLE; Info.datatype = TFLOAT; break; case DOUBLE_IMG: datatype = TDOUBLE; Info.datatype = TDOUBLE; break; default: snprintf(msg, 256,"pixel_filter: unexpected output bitpix %d\n", bitpix); ffpmsg(msg); *status = pERROR; goto CLEANUP; } if (bitpix > 0) { /* arrange for NULLs in output */ long nullVal = filter->blank; if (!filter->blank) { int tstatus = 0; if (fits_read_key_lng(infptr, "BLANK", &nullVal, 0, &tstatus)) { writeBlankKwd = 1; if (bitpix == BYTE_IMG) nullVal = UCHAR_MAX; else if (bitpix == SHORT_IMG) nullVal = SHRT_MIN; else if (bitpix == LONG_IMG) nullVal = LONG_MIN; else printf("unhandled positive output BITPIX %d\n", bitpix); } filter->blank = nullVal; } fits_set_imgnull(outfptr, filter->blank, status); if (DEBUG_PIXFILTER) printf("using blank %ld\n", nullVal); } if (!filter->keyword[0]) { iteratorCol * colIter; DataInfo * varInfo; /*************************************/ /* Create new iterator Output Column */ /*************************************/ col_cnt = gParse.nCols; if (allocateCol(col_cnt, status)) goto CLEANUP; gParse.nCols++; colIter = &gParse.colData[col_cnt]; colIter->fptr = filter->ofptr; colIter->iotype = OutputCol; varInfo = &gParse.varData[col_cnt]; set_image_col_types(colIter->fptr, "CREATED", bitpix, varInfo, colIter); Info.maxRows = -1; if (ffiter(gParse.nCols, gParse.colData, 0, 0, parse_data, &Info, status) == -1) *status = 0; else if (*status) goto CLEANUP; if (Info.anyNull) { if (writeBlankKwd) { fits_update_key_lng(outfptr, "BLANK", filter->blank, "NULL pixel value", status); if (*status) ffpmsg("pixel_filter: unable to write BLANK keyword"); if (DEBUG_PIXFILTER) { printf("output has NULLs\n"); printf("wrote blank [%d]\n", *status); } } } else if (bitpix > 0) /* never used a null */ if (fits_set_imgnull(outfptr, -1234554321, status)) ffpmsg("pixel_filter: unable to reset imgnull"); } else { /* Put constant result into keyword */ char * parName = filter->keyword; char * parInfo = filter->comment; result = gParse.Nodes + gParse.resultNode; switch (Info.datatype) { case TDOUBLE: ffukyd(outfptr, parName, result->value.data.dbl, 15, parInfo, status); break; case TLONG: ffukyj(outfptr, parName, result->value.data.lng, parInfo, status); break; case TLOGICAL: ffukyl(outfptr, parName, result->value.data.log, parInfo, status); break; case TBIT: case TSTRING: ffukys(outfptr, parName, result->value.data.str, parInfo, status); break; default: snprintf(msg, 256,"pixel_filter: unexpected constant result type [%d]\n", Info.datatype); ffpmsg(msg); } } CLEANUP: ffcprs(); FFUNLOCK; return (*status); } cfitsio-3.47/eval.l0000644000225700000360000003572313464573431013525 0ustar cagordonlhea%{ /************************************************************************/ /* */ /* CFITSIO Lexical Parser */ /* */ /* This file is one of 3 files containing code which parses an */ /* arithmetic expression and evaluates it in the context of an input */ /* FITS file table extension. The CFITSIO lexical parser is divided */ /* into the following 3 parts/files: the CFITSIO "front-end", */ /* eval_f.c, contains the interface between the user/CFITSIO and the */ /* real core of the parser; the FLEX interpreter, eval_l.c, takes the */ /* input string and parses it into tokens and identifies the FITS */ /* information required to evaluate the expression (ie, keywords and */ /* columns); and, the BISON grammar and evaluation routines, eval_y.c, */ /* receives the FLEX output and determines and performs the actual */ /* operations. The files eval_l.c and eval_y.c are produced from */ /* running flex and bison on the files eval.l and eval.y, respectively. */ /* (flex and bison are available from any GNU archive: see www.gnu.org) */ /* */ /* The grammar rules, rather than evaluating the expression in situ, */ /* builds a tree, or Nodal, structure mapping out the order of */ /* operations and expression dependencies. This "compilation" process */ /* allows for much faster processing of multiple rows. This technique */ /* was developed by Uwe Lammers of the XMM Science Analysis System, */ /* although the CFITSIO implementation is entirely code original. */ /* */ /* */ /* Modification History: */ /* */ /* Kent Blackburn c1992 Original parser code developed for the */ /* FTOOLS software package, in particular, */ /* the fselect task. */ /* Kent Blackburn c1995 BIT column support added */ /* Peter D Wilson Feb 1998 Vector column support added */ /* Peter D Wilson May 1998 Ported to CFITSIO library. User */ /* interface routines written, in essence */ /* making fselect, fcalc, and maketime */ /* capabilities available to all tools */ /* via single function calls. */ /* Peter D Wilson Jun 1998 Major rewrite of parser core, so as to */ /* create a run-time evaluation tree, */ /* inspired by the work of Uwe Lammers, */ /* resulting in a speed increase of */ /* 10-100 times. */ /* Peter D Wilson Jul 1998 gtifilter(a,b,c,d) function added */ /* Peter D Wilson Aug 1998 regfilter(a,b,c,d) function added */ /* Peter D Wilson Jul 1999 Make parser fitsfile-independent, */ /* allowing a purely vector-based usage */ /* */ /************************************************************************/ #include #include #include #ifdef sparc #include #else #include #endif #include "eval_defs.h" ParseData gParse; /* Global structure holding all parser information */ /***** Internal functions *****/ int yyGetVariable( char *varName, YYSTYPE *varVal ); static int find_variable( char *varName ); static int expr_read( char *buf, int nbytes ); /***** Definitions *****/ #define YY_NO_UNPUT /* Don't include YYUNPUT function */ #define YY_NEVER_INTERACTIVE 1 #define MAXCHR 256 #define MAXBIT 128 #define OCT_0 "000" #define OCT_1 "001" #define OCT_2 "010" #define OCT_3 "011" #define OCT_4 "100" #define OCT_5 "101" #define OCT_6 "110" #define OCT_7 "111" #define OCT_X "xxx" #define HEX_0 "0000" #define HEX_1 "0001" #define HEX_2 "0010" #define HEX_3 "0011" #define HEX_4 "0100" #define HEX_5 "0101" #define HEX_6 "0110" #define HEX_7 "0111" #define HEX_8 "1000" #define HEX_9 "1001" #define HEX_A "1010" #define HEX_B "1011" #define HEX_C "1100" #define HEX_D "1101" #define HEX_E "1110" #define HEX_F "1111" #define HEX_X "xxxx" /* MJT - 13 June 1996 read from buffer instead of stdin (as per old ftools.skel) */ #undef YY_INPUT #define YY_INPUT(buf,result,max_size) \ if ( (result = expr_read( (char *) buf, max_size )) < 0 ) \ YY_FATAL_ERROR( "read() in flex scanner failed" ); %} bit ([bB][01xX]+) oct ([oO][01234567xX]+) hex ([hH][0123456789aAbBcCdDeEfFxX]+) integer [0-9]+ boolean (t|f|T|F) real ([0-9]*"."[0-9]+)|([0-9]*"."*[0-9]+[eEdD][+-]?[0-9]+)|([0-9]*".") constant ("#"[a-zA-Z0-9_]+)|("#""$"[^\n]*"$") string ([\"][^\"\n]*[\"])|([\'][^\'\n]*[\']) variable ([a-zA-Z_][a-zA-Z0-9_]*)|("$"[^$\n]*"$") function [a-zA-Z][a-zA-Z0-9]+"(" intcast ("(int)"|"(INT)") fltcast ("(float)"|"(FLOAT)"|"(double)"|"(DOUBLE)") power ("^"|"**") not ("!"|".not."|".NOT."|"not."|"NOT.") or ("||"|".or."|".OR."|"or."|"OR.") and ("&&"|".and."|".AND."|"and."|"AND.") equal ("=="|".eq."|".EQ."|"eq."|"EQ.") not_equal ("!="|".ne."|".NE."|"ne."|"NE.") greater (">"|".gt."|".GT."|"gt."|"GT.") lesser ("<"|".lt."|".LT."|"lt."|"LT.") greater_eq (">="|"=>"|".ge."|".GE."|"ge."|"GE.") lesser_eq ("<="|"=<"|".le."|".LE."|"le."|"LE.") nl \n %% [ \t]+ ; {bit} { int len; len = strlen(yytext); while (yytext[len] == ' ') len--; len = len - 1; strncpy(yylval.str,&yytext[1],len); yylval.str[len] = '\0'; return( BITSTR ); } {oct} { int len; char tmpstring[256]; char bitstring[256]; len = strlen(yytext); if (len >= 256) { char errMsg[100]; gParse.status = PARSE_SYNTAX_ERR; strcpy (errMsg,"Bit string exceeds maximum length: '"); strncat(errMsg, &(yytext[0]), 20); strcat (errMsg,"...'"); ffpmsg (errMsg); len = 0; } else { while (yytext[len] == ' ') len--; len = len - 1; strncpy(tmpstring,&yytext[1],len); } tmpstring[len] = '\0'; bitstring[0] = '\0'; len = 0; while ( tmpstring[len] != '\0') { switch ( tmpstring[len] ) { case '0': strcat(bitstring,OCT_0); break; case '1': strcat(bitstring,OCT_1); break; case '2': strcat(bitstring,OCT_2); break; case '3': strcat(bitstring,OCT_3); break; case '4': strcat(bitstring,OCT_4); break; case '5': strcat(bitstring,OCT_5); break; case '6': strcat(bitstring,OCT_6); break; case '7': strcat(bitstring,OCT_7); break; case 'x': case 'X': strcat(bitstring,OCT_X); break; } len++; } strcpy( yylval.str, bitstring ); return( BITSTR ); } {hex} { int len; char tmpstring[256]; char bitstring[256]; len = strlen(yytext); if (len >= 256) { char errMsg[100]; gParse.status = PARSE_SYNTAX_ERR; strcpy (errMsg,"Hex string exceeds maximum length: '"); strncat(errMsg, &(yytext[0]), 20); strcat (errMsg,"...'"); ffpmsg (errMsg); len = 0; } else { while (yytext[len] == ' ') len--; len = len - 1; strncpy(tmpstring,&yytext[1],len); } tmpstring[len] = '\0'; bitstring[0] = '\0'; len = 0; while ( tmpstring[len] != '\0') { switch ( tmpstring[len] ) { case '0': strcat(bitstring,HEX_0); break; case '1': strcat(bitstring,HEX_1); break; case '2': strcat(bitstring,HEX_2); break; case '3': strcat(bitstring,HEX_3); break; case '4': strcat(bitstring,HEX_4); break; case '5': strcat(bitstring,HEX_5); break; case '6': strcat(bitstring,HEX_6); break; case '7': strcat(bitstring,HEX_7); break; case '8': strcat(bitstring,HEX_8); break; case '9': strcat(bitstring,HEX_9); break; case 'a': case 'A': strcat(bitstring,HEX_A); break; case 'b': case 'B': strcat(bitstring,HEX_B); break; case 'c': case 'C': strcat(bitstring,HEX_C); break; case 'd': case 'D': strcat(bitstring,HEX_D); break; case 'e': case 'E': strcat(bitstring,HEX_E); break; case 'f': case 'F': strcat(bitstring,HEX_F); break; case 'x': case 'X': strcat(bitstring,HEX_X); break; } len++; } strcpy( yylval.str, bitstring ); return( BITSTR ); } {integer} { yylval.lng = atol(yytext); return( LONG ); } {boolean} { if ((yytext[0] == 't') || (yytext[0] == 'T')) yylval.log = 1; else yylval.log = 0; return( BOOLEAN ); } {real} { yylval.dbl = atof(yytext); return( DOUBLE ); } {constant} { if( !fits_strcasecmp(yytext,"#PI") ) { yylval.dbl = (double)(4) * atan((double)(1)); return( DOUBLE ); } else if( !fits_strcasecmp(yytext,"#E") ) { yylval.dbl = exp((double)(1)); return( DOUBLE ); } else if( !fits_strcasecmp(yytext,"#DEG") ) { yylval.dbl = ((double)4)*atan((double)1)/((double)180); return( DOUBLE ); } else if( !fits_strcasecmp(yytext,"#ROW") ) { return( ROWREF ); } else if( !fits_strcasecmp(yytext,"#NULL") ) { return( NULLREF ); } else if( !fits_strcasecmp(yytext,"#SNULL") ) { return( SNULLREF ); } else { int len; if (yytext[1] == '$') { len = strlen(yytext) - 3; yylval.str[0] = '#'; strncpy(yylval.str+1,&yytext[2],len); yylval.str[len+1] = '\0'; yytext = yylval.str; } return( (*gParse.getData)(yytext, &yylval) ); } } {string} { int len; len = strlen(yytext) - 2; if (len >= MAX_STRLEN) { char errMsg[100]; gParse.status = PARSE_SYNTAX_ERR; strcpy (errMsg,"String exceeds maximum length: '"); strncat(errMsg, &(yytext[1]), 20); strcat (errMsg,"...'"); ffpmsg (errMsg); len = 0; } else { strncpy(yylval.str,&yytext[1],len); } yylval.str[len] = '\0'; return( STRING ); } {variable} { int len,type; if (yytext[0] == '$') { len = strlen(yytext) - 2; strncpy(yylval.str,&yytext[1],len); yylval.str[len] = '\0'; yytext = yylval.str; } type = yyGetVariable(yytext, &yylval); return( type ); } {function} { char *fname; int len=0; fname = &yylval.str[0]; while( (fname[len]=toupper(yytext[len])) ) len++; if( FSTRCMP(fname,"BOX(")==0 || FSTRCMP(fname,"CIRCLE(")==0 || FSTRCMP(fname,"ELLIPSE(")==0 || FSTRCMP(fname,"NEAR(")==0 || FSTRCMP(fname,"ISNULL(")==0 ) /* Return type is always boolean */ return( BFUNCTION ); else if( FSTRCMP(fname,"GTIFILTER(")==0 ) return( GTIFILTER ); else if( FSTRCMP(fname,"REGFILTER(")==0 ) return( REGFILTER ); else if( FSTRCMP(fname,"STRSTR(")==0 ) return( IFUNCTION ); /* Returns integer */ else return( FUNCTION ); } {intcast} { return( INTCAST ); } {fltcast} { return( FLTCAST ); } {power} { return( POWER ); } {not} { return( NOT ); } {or} { return( OR ); } {and} { return( AND ); } {equal} { return( EQ ); } {not_equal} { return( NE ); } {greater} { return( GT ); } {lesser} { return( LT ); } {greater_eq} { return( GTE ); } {lesser_eq} { return( LTE ); } {nl} { return( '\n' ); } . { return( yytext[0] ); } %% int yywrap() { /* MJT -- 13 June 1996 Supplied for compatibility with pre-2.5.1 versions of flex which do not recognize %option noyywrap */ return(1); } /* expr_read is lifted from old ftools.skel. Now we can use any version of flex with no .skel file necessary! MJT - 13 June 1996 keep a memory of how many bytes have been read previously, so that an unlimited-sized buffer can be supported. PDW - 28 Feb 1998 */ static int expr_read(char *buf, int nbytes) { int n; n = 0; if( !gParse.is_eobuf ) { do { buf[n++] = gParse.expr[gParse.index++]; } while ((nlng = varNum; } return( type ); } static int find_variable(char *varName) { int i; if( gParse.nCols ) for( i=0; i" #define FF_INT_ALIGNED short int /* A lexical scanner generated by flex */ #define FLEX_SCANNER #define FF_FLEX_MAJOR_VERSION 2 #define FF_FLEX_MINOR_VERSION 5 #define FF_FLEX_SUBMINOR_VERSION 35 #if FF_FLEX_SUBMINOR_VERSION > 0 #define FLEX_BETA #endif /* First, we deal with platform-specific or compiler-specific issues. */ /* begin standard C headers. */ #include #include #include #include /* end standard C headers. */ /* flex integer type definitions */ #ifndef FLEXINT_H #define FLEXINT_H /* C99 systems have . Non-C99 systems may or may not. */ #if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L /* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, * if you want the limit (max/min) macros for int types. */ #ifndef __STDC_LIMIT_MACROS #define __STDC_LIMIT_MACROS 1 #endif #include typedef int8_t flex_int8_t; typedef uint8_t flex_uint8_t; typedef int16_t flex_int16_t; typedef uint16_t flex_uint16_t; typedef int32_t flex_int32_t; typedef uint32_t flex_uint32_t; #else typedef signed char flex_int8_t; typedef short int flex_int16_t; typedef int flex_int32_t; typedef unsigned char flex_uint8_t; typedef unsigned short int flex_uint16_t; typedef unsigned int flex_uint32_t; #endif /* ! C99 */ /* Limits of integral types. */ #ifndef INT8_MIN #define INT8_MIN (-128) #endif #ifndef INT16_MIN #define INT16_MIN (-32767-1) #endif #ifndef INT32_MIN #define INT32_MIN (-2147483647-1) #endif #ifndef INT8_MAX #define INT8_MAX (127) #endif #ifndef INT16_MAX #define INT16_MAX (32767) #endif #ifndef INT32_MAX #define INT32_MAX (2147483647) #endif #ifndef UINT8_MAX #define UINT8_MAX (255U) #endif #ifndef UINT16_MAX #define UINT16_MAX (65535U) #endif #ifndef UINT32_MAX #define UINT32_MAX (4294967295U) #endif #endif /* ! FLEXINT_H */ #ifdef __cplusplus /* The "const" storage-class-modifier is valid. */ #define FF_USE_CONST #else /* ! __cplusplus */ /* C99 requires __STDC__ to be defined as 1. */ #if defined (__STDC__) #define FF_USE_CONST #endif /* defined (__STDC__) */ #endif /* ! __cplusplus */ #ifdef FF_USE_CONST #define ffconst const #else #define ffconst #endif /* Returned upon end-of-file. */ #define FF_NULL 0 /* Promotes a possibly negative, possibly signed char to an unsigned * integer for use as an array index. If the signed char is negative, * we want to instead treat it as an 8-bit unsigned char, hence the * double cast. */ #define FF_SC_TO_UI(c) ((unsigned int) (unsigned char) c) /* Enter a start condition. This macro really ought to take a parameter, * but we do it the disgusting crufty way forced on us by the ()-less * definition of BEGIN. */ #define BEGIN (ff_start) = 1 + 2 * /* Translate the current start state into a value that can be later handed * to BEGIN to return to the state. The FFSTATE alias is for lex * compatibility. */ #define FF_START (((ff_start) - 1) / 2) #define FFSTATE FF_START /* Action number for EOF rule of a given start state. */ #define FF_STATE_EOF(state) (FF_END_OF_BUFFER + state + 1) /* Special action meaning "start processing a new file". */ #define FF_NEW_FILE ffrestart(ffin ) #define FF_END_OF_BUFFER_CHAR 0 /* Size of default input buffer. */ #ifndef FF_BUF_SIZE #define FF_BUF_SIZE 16384 #endif /* The state buf must be large enough to hold one state per character in the main buffer. */ #define FF_STATE_BUF_SIZE ((FF_BUF_SIZE + 2) * sizeof(ff_state_type)) #ifndef FF_TYPEDEF_FF_BUFFER_STATE #define FF_TYPEDEF_FF_BUFFER_STATE typedef struct ff_buffer_state *FF_BUFFER_STATE; #endif extern int ffleng; extern FILE *ffin, *ffout; #define EOB_ACT_CONTINUE_SCAN 0 #define EOB_ACT_END_OF_FILE 1 #define EOB_ACT_LAST_MATCH 2 #define FF_LESS_LINENO(n) /* Return all but the first "n" matched characters back to the input stream. */ #define ffless(n) \ do \ { \ /* Undo effects of setting up fftext. */ \ int ffless_macro_arg = (n); \ FF_LESS_LINENO(ffless_macro_arg);\ *ff_cp = (ff_hold_char); \ FF_RESTORE_FF_MORE_OFFSET \ (ff_c_buf_p) = ff_cp = ff_bp + ffless_macro_arg - FF_MORE_ADJ; \ FF_DO_BEFORE_ACTION; /* set up fftext again */ \ } \ while ( 0 ) #define unput(c) ffunput( c, (fftext_ptr) ) #ifndef FF_TYPEDEF_FF_SIZE_T #define FF_TYPEDEF_FF_SIZE_T typedef size_t ff_size_t; #endif #ifndef FF_STRUCT_FF_BUFFER_STATE #define FF_STRUCT_FF_BUFFER_STATE struct ff_buffer_state { FILE *ff_input_file; char *ff_ch_buf; /* input buffer */ char *ff_buf_pos; /* current position in input buffer */ /* Size of input buffer in bytes, not including room for EOB * characters. */ ff_size_t ff_buf_size; /* Number of characters read into ff_ch_buf, not including EOB * characters. */ int ff_n_chars; /* Whether we "own" the buffer - i.e., we know we created it, * and can realloc() it to grow it, and should free() it to * delete it. */ int ff_is_our_buffer; /* Whether this is an "interactive" input source; if so, and * if we're using stdio for input, then we want to use getc() * instead of fread(), to make sure we stop fetching input after * each newline. */ int ff_is_interactive; /* Whether we're considered to be at the beginning of a line. * If so, '^' rules will be active on the next match, otherwise * not. */ int ff_at_bol; int ff_bs_lineno; /**< The line count. */ int ff_bs_column; /**< The column count. */ /* Whether to try to fill the input buffer when we reach the * end of it. */ int ff_fill_buffer; int ff_buffer_status; #define FF_BUFFER_NEW 0 #define FF_BUFFER_NORMAL 1 /* When an EOF's been seen but there's still some text to process * then we mark the buffer as FF_EOF_PENDING, to indicate that we * shouldn't try reading from the input source any more. We might * still have a bunch of tokens to match, though, because of * possible backing-up. * * When we actually see the EOF, we change the status to "new" * (via ffrestart()), so that the user can continue scanning by * just pointing ffin at a new input file. */ #define FF_BUFFER_EOF_PENDING 2 }; #endif /* !FF_STRUCT_FF_BUFFER_STATE */ /* Stack of input buffers. */ static size_t ff_buffer_stack_top = 0; /**< index of top of stack. */ static size_t ff_buffer_stack_max = 0; /**< capacity of stack. */ static FF_BUFFER_STATE * ff_buffer_stack = 0; /**< Stack as an array. */ /* We provide macros for accessing buffer states in case in the * future we want to put the buffer states in a more general * "scanner state". * * Returns the top of the stack, or NULL. */ #define FF_CURRENT_BUFFER ( (ff_buffer_stack) \ ? (ff_buffer_stack)[(ff_buffer_stack_top)] \ : NULL) /* Same as previous macro, but useful when we know that the buffer stack is not * NULL or when we need an lvalue. For internal use only. */ #define FF_CURRENT_BUFFER_LVALUE (ff_buffer_stack)[(ff_buffer_stack_top)] /* ff_hold_char holds the character lost when fftext is formed. */ static char ff_hold_char; static int ff_n_chars; /* number of characters read into ff_ch_buf */ int ffleng; /* Points to current character in buffer. */ static char *ff_c_buf_p = (char *) 0; static int ff_init = 0; /* whether we need to initialize */ static int ff_start = 0; /* start state number */ /* Flag which is used to allow ffwrap()'s to do buffer switches * instead of setting up a fresh ffin. A bit of a hack ... */ static int ff_did_buffer_switch_on_eof; void ffrestart (FILE *input_file ); void ff_switch_to_buffer (FF_BUFFER_STATE new_buffer ); FF_BUFFER_STATE ff_create_buffer (FILE *file,int size ); void ff_delete_buffer (FF_BUFFER_STATE b ); void ff_flush_buffer (FF_BUFFER_STATE b ); void ffpush_buffer_state (FF_BUFFER_STATE new_buffer ); void ffpop_buffer_state (void ); static void ffensure_buffer_stack (void ); static void ff_load_buffer_state (void ); static void ff_init_buffer (FF_BUFFER_STATE b,FILE *file ); #define FF_FLUSH_BUFFER ff_flush_buffer(FF_CURRENT_BUFFER ) FF_BUFFER_STATE ff_scan_buffer (char *base,ff_size_t size ); FF_BUFFER_STATE ff_scan_string (ffconst char *ff_str ); FF_BUFFER_STATE ff_scan_bytes (ffconst char *bytes,int len ); void *ffalloc (ff_size_t ); void *ffrealloc (void *,ff_size_t ); void yyfffree (void * ); #define ff_new_buffer ff_create_buffer #define ff_set_interactive(is_interactive) \ { \ if ( ! FF_CURRENT_BUFFER ){ \ ffensure_buffer_stack (); \ FF_CURRENT_BUFFER_LVALUE = \ ff_create_buffer(ffin,FF_BUF_SIZE ); \ } \ FF_CURRENT_BUFFER_LVALUE->ff_is_interactive = is_interactive; \ } #define ff_set_bol(at_bol) \ { \ if ( ! FF_CURRENT_BUFFER ){\ ffensure_buffer_stack (); \ FF_CURRENT_BUFFER_LVALUE = \ ff_create_buffer(ffin,FF_BUF_SIZE ); \ } \ FF_CURRENT_BUFFER_LVALUE->ff_at_bol = at_bol; \ } #define FF_AT_BOL() (FF_CURRENT_BUFFER_LVALUE->ff_at_bol) /* Begin user sect3 */ typedef unsigned char FF_CHAR; FILE *ffin = (FILE *) 0, *ffout = (FILE *) 0; typedef int ff_state_type; extern int fflineno; int fflineno = 1; extern char *fftext; #define fftext_ptr fftext static ff_state_type ff_get_previous_state (void ); static ff_state_type ff_try_NUL_trans (ff_state_type current_state ); static int ff_get_next_buffer (void ); static void ff_fatal_error (ffconst char msg[] ); /* Done after the current pattern has been matched and before the * corresponding action - sets up fftext. */ #define FF_DO_BEFORE_ACTION \ (fftext_ptr) = ff_bp; \ ffleng = (size_t) (ff_cp - ff_bp); \ (ff_hold_char) = *ff_cp; \ *ff_cp = '\0'; \ (ff_c_buf_p) = ff_cp; #define FF_NUM_RULES 26 #define FF_END_OF_BUFFER 27 /* This struct is not used in this scanner, but its presence is necessary. */ struct ff_trans_info { flex_int32_t ff_verify; flex_int32_t ff_nxt; }; static ffconst flex_int16_t ff_accept[160] = { 0, 0, 0, 27, 25, 1, 24, 15, 25, 25, 25, 25, 25, 25, 25, 7, 5, 21, 25, 20, 10, 10, 10, 10, 6, 10, 10, 10, 10, 10, 14, 10, 10, 10, 10, 10, 10, 10, 25, 1, 19, 0, 9, 0, 8, 0, 10, 17, 0, 0, 0, 0, 0, 0, 0, 14, 0, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 5, 0, 23, 18, 22, 10, 10, 10, 2, 10, 10, 10, 4, 10, 10, 10, 10, 3, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 16, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 11, 10, 20, 21, 10, 10, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 13, 0, 0 } ; static ffconst flex_int32_t ff_ec[256] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 5, 6, 7, 1, 8, 9, 10, 11, 12, 13, 1, 13, 14, 1, 15, 15, 16, 16, 16, 16, 16, 16, 17, 17, 1, 1, 18, 19, 20, 1, 1, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 30, 31, 30, 32, 33, 30, 34, 35, 30, 36, 37, 30, 30, 38, 30, 30, 1, 1, 1, 39, 40, 1, 41, 42, 23, 43, 44, 45, 46, 28, 47, 30, 30, 48, 30, 49, 50, 30, 51, 52, 30, 53, 54, 30, 30, 38, 30, 30, 1, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 } ; static ffconst flex_int32_t ff_meta[56] = { 0, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 4, 4, 4, 1, 1, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1 } ; static ffconst flex_int16_t ff_base[167] = { 0, 0, 0, 367, 368, 364, 368, 346, 359, 356, 355, 353, 351, 32, 347, 66, 103, 339, 44, 338, 25, 52, 316, 26, 315, 34, 133, 48, 61, 125, 368, 0, 29, 45, 60, 81, 82, 93, 299, 351, 368, 347, 368, 344, 343, 342, 368, 368, 339, 314, 315, 313, 294, 295, 293, 368, 121, 164, 307, 301, 70, 117, 43, 296, 276, 271, 58, 86, 79, 269, 152, 168, 181, 368, 368, 368, 151, 162, 0, 180, 189, 190, 191, 309, 196, 199, 205, 204, 211, 214, 207, 223, 224, 232, 238, 243, 245, 222, 246, 368, 311, 310, 279, 282, 278, 259, 262, 258, 252, 286, 295, 294, 293, 292, 291, 290, 267, 288, 258, 285, 284, 278, 270, 268, 259, 218, 252, 264, 272, 368, 251, 368, 368, 260, 280, 283, 236, 222, 230, 193, 184, 212, 208, 202, 173, 156, 368, 133, 126, 368, 104, 98, 119, 132, 80, 94, 92, 368, 78, 368, 323, 325, 329, 333, 68, 67, 337 } ; static ffconst flex_int16_t ff_def[167] = { 0, 159, 1, 159, 159, 159, 159, 159, 160, 161, 162, 159, 163, 159, 159, 159, 159, 159, 159, 159, 164, 164, 164, 164, 164, 164, 164, 164, 164, 164, 159, 165, 164, 164, 164, 164, 164, 164, 159, 159, 159, 160, 159, 166, 161, 162, 159, 159, 163, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 164, 164, 165, 164, 164, 164, 164, 26, 164, 164, 164, 164, 164, 164, 164, 164, 164, 164, 164, 164, 164, 164, 164, 159, 166, 166, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 164, 159, 159, 164, 164, 164, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 0, 159, 159, 159, 159, 159, 159, 159 } ; static ffconst flex_int16_t ff_nxt[424] = { 0, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 4, 14, 4, 15, 16, 16, 16, 17, 18, 19, 20, 21, 22, 22, 23, 24, 25, 26, 22, 22, 27, 28, 29, 22, 22, 24, 22, 22, 30, 31, 32, 21, 22, 33, 24, 34, 22, 35, 36, 37, 22, 22, 24, 22, 38, 49, 77, 50, 81, 80, 51, 73, 74, 75, 78, 78, 79, 115, 78, 82, 78, 76, 84, 78, 52, 116, 53, 90, 54, 56, 57, 57, 57, 85, 78, 86, 58, 78, 157, 79, 59, 78, 60, 87, 111, 91, 61, 62, 63, 78, 78, 120, 157, 92, 157, 112, 64, 88, 88, 65, 121, 66, 93, 67, 68, 69, 70, 71, 71, 71, 78, 78, 124, 158, 94, 96, 72, 72, 125, 122, 88, 97, 78, 95, 56, 108, 108, 108, 123, 88, 88, 113, 157, 156, 98, 72, 72, 83, 83, 83, 155, 154, 114, 83, 83, 83, 83, 83, 83, 89, 129, 153, 88, 152, 78, 56, 57, 57, 57, 146, 83, 129, 78, 83, 83, 83, 83, 83, 57, 57, 57, 70, 71, 71, 71, 130, 47, 72, 72, 129, 78, 72, 72, 127, 79, 128, 128, 128, 129, 129, 129, 78, 74, 75, 131, 129, 72, 72, 129, 73, 72, 72, 132, 129, 129, 146, 129, 79, 40, 78, 129, 47, 149, 129, 151, 88, 88, 99, 78, 78, 78, 129, 129, 129, 150, 78, 74, 75, 78, 133, 149, 129, 148, 78, 78, 131, 78, 129, 88, 134, 78, 73, 129, 78, 129, 129, 132, 147, 40, 99, 129, 78, 78, 78, 47, 99, 108, 108, 108, 129, 145, 78, 40, 146, 135, 72, 72, 78, 128, 128, 128, 132, 78, 73, 78, 78, 128, 128, 128, 129, 78, 131, 129, 47, 72, 72, 146, 75, 74, 78, 144, 99, 143, 40, 132, 73, 131, 75, 74, 142, 141, 140, 139, 138, 137, 136, 101, 101, 129, 78, 126, 119, 78, 41, 118, 41, 41, 44, 44, 45, 117, 45, 45, 48, 110, 48, 48, 100, 109, 100, 100, 107, 106, 105, 104, 103, 102, 42, 46, 159, 101, 42, 39, 99, 78, 78, 75, 73, 55, 42, 47, 46, 43, 42, 40, 39, 159, 3, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159 } ; static ffconst flex_int16_t ff_chk[424] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 13, 20, 13, 25, 23, 13, 18, 18, 18, 20, 23, 21, 62, 32, 25, 165, 164, 27, 25, 13, 62, 13, 32, 13, 15, 15, 15, 15, 27, 33, 28, 15, 27, 158, 21, 15, 21, 15, 28, 60, 33, 15, 15, 15, 34, 28, 66, 156, 34, 155, 60, 15, 37, 37, 15, 66, 15, 34, 15, 15, 15, 16, 16, 16, 16, 35, 36, 68, 154, 35, 36, 16, 16, 68, 67, 37, 36, 37, 35, 56, 56, 56, 56, 67, 29, 29, 61, 153, 152, 37, 16, 16, 26, 26, 26, 151, 150, 61, 26, 26, 26, 26, 26, 26, 29, 76, 148, 29, 147, 29, 70, 70, 70, 70, 145, 26, 77, 26, 26, 26, 26, 26, 26, 57, 57, 57, 71, 71, 71, 71, 77, 144, 57, 57, 79, 76, 71, 71, 72, 79, 72, 72, 72, 80, 81, 82, 77, 80, 81, 82, 84, 57, 57, 85, 84, 71, 71, 85, 87, 86, 143, 90, 79, 86, 79, 88, 142, 141, 89, 140, 88, 88, 89, 80, 81, 82, 97, 91, 92, 139, 84, 91, 92, 85, 87, 138, 93, 137, 87, 86, 93, 90, 94, 88, 90, 88, 94, 95, 89, 96, 98, 95, 136, 96, 98, 130, 97, 91, 92, 130, 126, 108, 108, 108, 133, 125, 93, 124, 133, 97, 108, 108, 94, 127, 127, 127, 123, 95, 122, 96, 98, 128, 128, 128, 134, 130, 121, 135, 134, 108, 108, 135, 120, 119, 133, 118, 117, 116, 115, 114, 113, 112, 111, 110, 109, 107, 106, 105, 104, 103, 102, 101, 100, 83, 134, 69, 65, 135, 160, 64, 160, 160, 161, 161, 162, 63, 162, 162, 163, 59, 163, 163, 166, 58, 166, 166, 54, 53, 52, 51, 50, 49, 48, 45, 44, 43, 41, 39, 38, 24, 22, 19, 17, 14, 12, 11, 10, 9, 8, 7, 5, 3, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159 } ; static ff_state_type ff_last_accepting_state; static char *ff_last_accepting_cpos; extern int ff_flex_debug; int ff_flex_debug = 0; /* The intent behind this definition is that it'll catch * any uses of REJECT which flex missed. */ #define REJECT reject_used_but_not_detected #define ffmore() ffmore_used_but_not_detected #define FF_MORE_ADJ 0 #define FF_RESTORE_FF_MORE_OFFSET char *fftext; #line 1 "eval.l" #line 2 "eval.l" /************************************************************************/ /* */ /* CFITSIO Lexical Parser */ /* */ /* This file is one of 3 files containing code which parses an */ /* arithmetic expression and evaluates it in the context of an input */ /* FITS file table extension. The CFITSIO lexical parser is divided */ /* into the following 3 parts/files: the CFITSIO "front-end", */ /* eval_f.c, contains the interface between the user/CFITSIO and the */ /* real core of the parser; the FLEX interpreter, eval_l.c, takes the */ /* input string and parses it into tokens and identifies the FITS */ /* information required to evaluate the expression (ie, keywords and */ /* columns); and, the BISON grammar and evaluation routines, eval_y.c, */ /* receives the FLEX output and determines and performs the actual */ /* operations. The files eval_l.c and eval_y.c are produced from */ /* running flex and bison on the files eval.l and eval.y, respectively. */ /* (flex and bison are available from any GNU archive: see www.gnu.org) */ /* */ /* The grammar rules, rather than evaluating the expression in situ, */ /* builds a tree, or Nodal, structure mapping out the order of */ /* operations and expression dependencies. This "compilation" process */ /* allows for much faster processing of multiple rows. This technique */ /* was developed by Uwe Lammers of the XMM Science Analysis System, */ /* although the CFITSIO implementation is entirely code original. */ /* */ /* */ /* Modification History: */ /* */ /* Kent Blackburn c1992 Original parser code developed for the */ /* FTOOLS software package, in particular, */ /* the fselect task. */ /* Kent Blackburn c1995 BIT column support added */ /* Peter D Wilson Feb 1998 Vector column support added */ /* Peter D Wilson May 1998 Ported to CFITSIO library. User */ /* interface routines written, in essence */ /* making fselect, fcalc, and maketime */ /* capabilities available to all tools */ /* via single function calls. */ /* Peter D Wilson Jun 1998 Major rewrite of parser core, so as to */ /* create a run-time evaluation tree, */ /* inspired by the work of Uwe Lammers, */ /* resulting in a speed increase of */ /* 10-100 times. */ /* Peter D Wilson Jul 1998 gtifilter(a,b,c,d) function added */ /* Peter D Wilson Aug 1998 regfilter(a,b,c,d) function added */ /* Peter D Wilson Jul 1999 Make parser fitsfile-independent, */ /* allowing a purely vector-based usage */ /* */ /************************************************************************/ #include #include #include #ifdef sparc #include #else #include #endif #include "eval_defs.h" ParseData gParse; /* Global structure holding all parser information */ /***** Internal functions *****/ int ffGetVariable( char *varName, FFSTYPE *varVal ); static int find_variable( char *varName ); static int expr_read( char *buf, int nbytes ); /***** Definitions *****/ #define FF_NO_UNPUT /* Don't include FFUNPUT function */ #define FF_NEVER_INTERACTIVE 1 #define MAXCHR 256 #define MAXBIT 128 #define OCT_0 "000" #define OCT_1 "001" #define OCT_2 "010" #define OCT_3 "011" #define OCT_4 "100" #define OCT_5 "101" #define OCT_6 "110" #define OCT_7 "111" #define OCT_X "xxx" #define HEX_0 "0000" #define HEX_1 "0001" #define HEX_2 "0010" #define HEX_3 "0011" #define HEX_4 "0100" #define HEX_5 "0101" #define HEX_6 "0110" #define HEX_7 "0111" #define HEX_8 "1000" #define HEX_9 "1001" #define HEX_A "1010" #define HEX_B "1011" #define HEX_C "1100" #define HEX_D "1101" #define HEX_E "1110" #define HEX_F "1111" #define HEX_X "xxxx" /* MJT - 13 June 1996 read from buffer instead of stdin (as per old ftools.skel) */ #undef FF_INPUT #define FF_INPUT(buf,result,max_size) \ if ( (result = expr_read( (char *) buf, max_size )) < 0 ) \ FF_FATAL_ERROR( "read() in flex scanner failed" ); #line 712 "" #define INITIAL 0 #ifndef FF_NO_UNISTD_H /* Special case for "unistd.h", since it is non-ANSI. We include it way * down here because we want the user's section 1 to have been scanned first. * The user has a chance to override it with an option. */ #include #endif #ifndef FF_EXTRA_TYPE #define FF_EXTRA_TYPE void * #endif static int ff_init_globals (void ); /* Accessor methods to globals. These are made visible to non-reentrant scanners for convenience. */ int fflex_destroy (void ); int ffget_debug (void ); void ffset_debug (int debug_flag ); FF_EXTRA_TYPE ffget_extra (void ); void ffset_extra (FF_EXTRA_TYPE user_defined ); FILE *ffget_in (void ); void ffset_in (FILE * in_str ); FILE *ffget_out (void ); void ffset_out (FILE * out_str ); int ffget_leng (void ); char *ffget_text (void ); int ffget_lineno (void ); void ffset_lineno (int line_number ); /* Macros after this point can all be overridden by user definitions in * section 1. */ #ifndef FF_SKIP_FFWRAP #ifdef __cplusplus extern "C" int ffwrap (void ); #else extern int ffwrap (void ); #endif #endif static void ffunput (int c,char *buf_ptr ); #ifndef fftext_ptr static void ff_flex_strncpy (char *,ffconst char *,int ); #endif #ifdef FF_NEED_STRLEN static int ff_flex_strlen (ffconst char * ); #endif #ifndef FF_NO_INPUT #ifdef __cplusplus static int ffinput (void ); #else static int input (void ); #endif #endif /* Amount of stuff to slurp up with each read. */ #ifndef FF_READ_BUF_SIZE #define FF_READ_BUF_SIZE 8192 #endif /* Copy whatever the last rule matched to the standard output. */ #ifndef ECHO /* This used to be an fputs(), but since the string might contain NUL's, * we now use fwrite(). */ #define ECHO do { if (fwrite( fftext, ffleng, 1, ffout )) {} } while (0) #endif /* Gets input and stuffs it into "buf". number of characters read, or FF_NULL, * is returned in "result". */ #ifndef FF_INPUT #define FF_INPUT(buf,result,max_size) \ if ( FF_CURRENT_BUFFER_LVALUE->ff_is_interactive ) \ { \ int c = '*'; \ unsigned n; \ for ( n = 0; n < max_size && \ (c = getc( ffin )) != EOF && c != '\n'; ++n ) \ buf[n] = (char) c; \ if ( c == '\n' ) \ buf[n++] = (char) c; \ if ( c == EOF && ferror( ffin ) ) \ FF_FATAL_ERROR( "input in flex scanner failed" ); \ result = n; \ } \ else \ { \ errno=0; \ while ( (result = fread(buf, 1, max_size, ffin))==0 && ferror(ffin)) \ { \ if( errno != EINTR) \ { \ FF_FATAL_ERROR( "input in flex scanner failed" ); \ break; \ } \ errno=0; \ clearerr(ffin); \ } \ }\ \ #endif /* No semi-colon after return; correct usage is to write "ffterminate();" - * we don't want an extra ';' after the "return" because that will cause * some compilers to complain about unreachable statements. */ #ifndef ffterminate #define ffterminate() return FF_NULL #endif /* Number of entries by which start-condition stack grows. */ #ifndef FF_START_STACK_INCR #define FF_START_STACK_INCR 25 #endif /* Report a fatal error. */ #ifndef FF_FATAL_ERROR #define FF_FATAL_ERROR(msg) ff_fatal_error( msg ) #endif /* end tables serialization structures and prototypes */ /* Default declaration of generated scanner - a define so the user can * easily add parameters. */ #ifndef FF_DECL #define FF_DECL_IS_OURS 1 extern int fflex (void); #define FF_DECL int fflex (void) #endif /* !FF_DECL */ /* Code executed at the beginning of each rule, after fftext and ffleng * have been set up. */ #ifndef FF_USER_ACTION #define FF_USER_ACTION #endif /* Code executed at the end of each rule. */ #ifndef FF_BREAK #define FF_BREAK break; #endif #define FF_RULE_SETUP \ FF_USER_ACTION /** The main scanner function which does all the work. */ FF_DECL { register ff_state_type ff_current_state; register char *ff_cp, *ff_bp; register int ff_act; #line 142 "eval.l" #line 897 "" if ( !(ff_init) ) { (ff_init) = 1; #ifdef FF_USER_INIT FF_USER_INIT; #endif if ( ! (ff_start) ) (ff_start) = 1; /* first start state */ if ( ! ffin ) ffin = stdin; if ( ! ffout ) ffout = stdout; if ( ! FF_CURRENT_BUFFER ) { ffensure_buffer_stack (); FF_CURRENT_BUFFER_LVALUE = ff_create_buffer(ffin,FF_BUF_SIZE ); } ff_load_buffer_state( ); } while ( 1 ) /* loops until end-of-file is reached */ { ff_cp = (ff_c_buf_p); /* Support of fftext. */ *ff_cp = (ff_hold_char); /* ff_bp points to the position in ff_ch_buf of the start of * the current run. */ ff_bp = ff_cp; ff_current_state = (ff_start); ff_match: do { register FF_CHAR ff_c = ff_ec[FF_SC_TO_UI(*ff_cp)]; if ( ff_accept[ff_current_state] ) { (ff_last_accepting_state) = ff_current_state; (ff_last_accepting_cpos) = ff_cp; } while ( ff_chk[ff_base[ff_current_state] + ff_c] != ff_current_state ) { ff_current_state = (int) ff_def[ff_current_state]; if ( ff_current_state >= 160 ) ff_c = ff_meta[(unsigned int) ff_c]; } ff_current_state = ff_nxt[ff_base[ff_current_state] + (unsigned int) ff_c]; ++ff_cp; } while ( ff_base[ff_current_state] != 368 ); ff_find_action: ff_act = ff_accept[ff_current_state]; if ( ff_act == 0 ) { /* have to back up */ ff_cp = (ff_last_accepting_cpos); ff_current_state = (ff_last_accepting_state); ff_act = ff_accept[ff_current_state]; } FF_DO_BEFORE_ACTION; do_action: /* This label is used only to access EOF actions. */ switch ( ff_act ) { /* beginning of action switch */ case 0: /* must back up */ /* undo the effects of FF_DO_BEFORE_ACTION */ *ff_cp = (ff_hold_char); ff_cp = (ff_last_accepting_cpos); ff_current_state = (ff_last_accepting_state); goto ff_find_action; case 1: FF_RULE_SETUP #line 144 "eval.l" ; FF_BREAK case 2: FF_RULE_SETUP #line 145 "eval.l" { int len; len = strlen(fftext); while (fftext[len] == ' ') len--; len = len - 1; strncpy(fflval.str,&fftext[1],len); fflval.str[len] = '\0'; return( BITSTR ); } FF_BREAK case 3: FF_RULE_SETUP #line 155 "eval.l" { int len; char tmpstring[256]; char bitstring[256]; len = strlen(fftext); if (len >= 256) { char errMsg[100]; gParse.status = PARSE_SYNTAX_ERR; strcpy (errMsg,"Bit string exceeds maximum length: '"); strncat(errMsg, &(fftext[0]), 20); strcat (errMsg,"...'"); ffpmsg (errMsg); len = 0; } else { while (fftext[len] == ' ') len--; len = len - 1; strncpy(tmpstring,&fftext[1],len); } tmpstring[len] = '\0'; bitstring[0] = '\0'; len = 0; while ( tmpstring[len] != '\0') { switch ( tmpstring[len] ) { case '0': strcat(bitstring,OCT_0); break; case '1': strcat(bitstring,OCT_1); break; case '2': strcat(bitstring,OCT_2); break; case '3': strcat(bitstring,OCT_3); break; case '4': strcat(bitstring,OCT_4); break; case '5': strcat(bitstring,OCT_5); break; case '6': strcat(bitstring,OCT_6); break; case '7': strcat(bitstring,OCT_7); break; case 'x': case 'X': strcat(bitstring,OCT_X); break; } len++; } strcpy( fflval.str, bitstring ); return( BITSTR ); } FF_BREAK case 4: FF_RULE_SETUP #line 215 "eval.l" { int len; char tmpstring[256]; char bitstring[256]; len = strlen(fftext); if (len >= 256) { char errMsg[100]; gParse.status = PARSE_SYNTAX_ERR; strcpy (errMsg,"Hex string exceeds maximum length: '"); strncat(errMsg, &(fftext[0]), 20); strcat (errMsg,"...'"); ffpmsg (errMsg); len = 0; } else { while (fftext[len] == ' ') len--; len = len - 1; strncpy(tmpstring,&fftext[1],len); } tmpstring[len] = '\0'; bitstring[0] = '\0'; len = 0; while ( tmpstring[len] != '\0') { switch ( tmpstring[len] ) { case '0': strcat(bitstring,HEX_0); break; case '1': strcat(bitstring,HEX_1); break; case '2': strcat(bitstring,HEX_2); break; case '3': strcat(bitstring,HEX_3); break; case '4': strcat(bitstring,HEX_4); break; case '5': strcat(bitstring,HEX_5); break; case '6': strcat(bitstring,HEX_6); break; case '7': strcat(bitstring,HEX_7); break; case '8': strcat(bitstring,HEX_8); break; case '9': strcat(bitstring,HEX_9); break; case 'a': case 'A': strcat(bitstring,HEX_A); break; case 'b': case 'B': strcat(bitstring,HEX_B); break; case 'c': case 'C': strcat(bitstring,HEX_C); break; case 'd': case 'D': strcat(bitstring,HEX_D); break; case 'e': case 'E': strcat(bitstring,HEX_E); break; case 'f': case 'F': strcat(bitstring,HEX_F); break; case 'x': case 'X': strcat(bitstring,HEX_X); break; } len++; } strcpy( fflval.str, bitstring ); return( BITSTR ); } FF_BREAK case 5: FF_RULE_SETUP #line 306 "eval.l" { fflval.lng = atol(fftext); return( LONG ); } FF_BREAK case 6: FF_RULE_SETUP #line 310 "eval.l" { if ((fftext[0] == 't') || (fftext[0] == 'T')) fflval.log = 1; else fflval.log = 0; return( BOOLEAN ); } FF_BREAK case 7: FF_RULE_SETUP #line 317 "eval.l" { fflval.dbl = atof(fftext); return( DOUBLE ); } FF_BREAK case 8: FF_RULE_SETUP #line 321 "eval.l" { if( !fits_strcasecmp(fftext,"#PI") ) { fflval.dbl = (double)(4) * atan((double)(1)); return( DOUBLE ); } else if( !fits_strcasecmp(fftext,"#E") ) { fflval.dbl = exp((double)(1)); return( DOUBLE ); } else if( !fits_strcasecmp(fftext,"#DEG") ) { fflval.dbl = ((double)4)*atan((double)1)/((double)180); return( DOUBLE ); } else if( !fits_strcasecmp(fftext,"#ROW") ) { return( ROWREF ); } else if( !fits_strcasecmp(fftext,"#NULL") ) { return( NULLREF ); } else if( !fits_strcasecmp(fftext,"#SNULL") ) { return( SNULLREF ); } else { int len; if (fftext[1] == '$') { len = strlen(fftext) - 3; fflval.str[0] = '#'; strncpy(fflval.str+1,&fftext[2],len); fflval.str[len+1] = '\0'; fftext = fflval.str; } return( (*gParse.getData)(fftext, &fflval) ); } } FF_BREAK case 9: FF_RULE_SETUP #line 349 "eval.l" { int len; len = strlen(fftext) - 2; if (len >= MAX_STRLEN) { char errMsg[100]; gParse.status = PARSE_SYNTAX_ERR; strcpy (errMsg,"String exceeds maximum length: '"); strncat(errMsg, &(fftext[1]), 20); strcat (errMsg,"...'"); ffpmsg (errMsg); len = 0; } else { strncpy(fflval.str,&fftext[1],len); } fflval.str[len] = '\0'; return( STRING ); } FF_BREAK case 10: FF_RULE_SETUP #line 366 "eval.l" { int len,type; if (fftext[0] == '$') { len = strlen(fftext) - 2; strncpy(fflval.str,&fftext[1],len); fflval.str[len] = '\0'; fftext = fflval.str; } type = ffGetVariable(fftext, &fflval); return( type ); } FF_BREAK case 11: FF_RULE_SETUP #line 378 "eval.l" { char *fname; int len=0; fname = &fflval.str[0]; while( (fname[len]=toupper(fftext[len])) ) len++; if( FSTRCMP(fname,"BOX(")==0 || FSTRCMP(fname,"CIRCLE(")==0 || FSTRCMP(fname,"ELLIPSE(")==0 || FSTRCMP(fname,"NEAR(")==0 || FSTRCMP(fname,"ISNULL(")==0 ) /* Return type is always boolean */ return( BFUNCTION ); else if( FSTRCMP(fname,"GTIFILTER(")==0 ) return( GTIFILTER ); else if( FSTRCMP(fname,"REGFILTER(")==0 ) return( REGFILTER ); else if( FSTRCMP(fname,"STRSTR(")==0 ) return( IFUNCTION ); /* Returns integer */ else return( FUNCTION ); } FF_BREAK case 12: FF_RULE_SETUP #line 405 "eval.l" { return( INTCAST ); } FF_BREAK case 13: FF_RULE_SETUP #line 406 "eval.l" { return( FLTCAST ); } FF_BREAK case 14: FF_RULE_SETUP #line 407 "eval.l" { return( POWER ); } FF_BREAK case 15: FF_RULE_SETUP #line 408 "eval.l" { return( NOT ); } FF_BREAK case 16: FF_RULE_SETUP #line 409 "eval.l" { return( OR ); } FF_BREAK case 17: FF_RULE_SETUP #line 410 "eval.l" { return( AND ); } FF_BREAK case 18: FF_RULE_SETUP #line 411 "eval.l" { return( EQ ); } FF_BREAK case 19: FF_RULE_SETUP #line 412 "eval.l" { return( NE ); } FF_BREAK case 20: FF_RULE_SETUP #line 413 "eval.l" { return( GT ); } FF_BREAK case 21: FF_RULE_SETUP #line 414 "eval.l" { return( LT ); } FF_BREAK case 22: FF_RULE_SETUP #line 415 "eval.l" { return( GTE ); } FF_BREAK case 23: FF_RULE_SETUP #line 416 "eval.l" { return( LTE ); } FF_BREAK case 24: /* rule 24 can match eol */ FF_RULE_SETUP #line 417 "eval.l" { return( '\n' ); } FF_BREAK case 25: FF_RULE_SETUP #line 418 "eval.l" { return( fftext[0] ); } FF_BREAK case 26: FF_RULE_SETUP #line 419 "eval.l" ECHO; FF_BREAK #line 1361 "" case FF_STATE_EOF(INITIAL): ffterminate(); case FF_END_OF_BUFFER: { /* Amount of text matched not including the EOB char. */ int ff_amount_of_matched_text = (int) (ff_cp - (fftext_ptr)) - 1; /* Undo the effects of FF_DO_BEFORE_ACTION. */ *ff_cp = (ff_hold_char); FF_RESTORE_FF_MORE_OFFSET if ( FF_CURRENT_BUFFER_LVALUE->ff_buffer_status == FF_BUFFER_NEW ) { /* We're scanning a new file or input source. It's * possible that this happened because the user * just pointed ffin at a new source and called * fflex(). If so, then we have to assure * consistency between FF_CURRENT_BUFFER and our * globals. Here is the right place to do so, because * this is the first action (other than possibly a * back-up) that will match for the new input source. */ (ff_n_chars) = FF_CURRENT_BUFFER_LVALUE->ff_n_chars; FF_CURRENT_BUFFER_LVALUE->ff_input_file = ffin; FF_CURRENT_BUFFER_LVALUE->ff_buffer_status = FF_BUFFER_NORMAL; } /* Note that here we test for ff_c_buf_p "<=" to the position * of the first EOB in the buffer, since ff_c_buf_p will * already have been incremented past the NUL character * (since all states make transitions on EOB to the * end-of-buffer state). Contrast this with the test * in input(). */ if ( (ff_c_buf_p) <= &FF_CURRENT_BUFFER_LVALUE->ff_ch_buf[(ff_n_chars)] ) { /* This was really a NUL. */ ff_state_type ff_next_state; (ff_c_buf_p) = (fftext_ptr) + ff_amount_of_matched_text; ff_current_state = ff_get_previous_state( ); /* Okay, we're now positioned to make the NUL * transition. We couldn't have * ff_get_previous_state() go ahead and do it * for us because it doesn't know how to deal * with the possibility of jamming (and we don't * want to build jamming into it because then it * will run more slowly). */ ff_next_state = ff_try_NUL_trans( ff_current_state ); ff_bp = (fftext_ptr) + FF_MORE_ADJ; if ( ff_next_state ) { /* Consume the NUL. */ ff_cp = ++(ff_c_buf_p); ff_current_state = ff_next_state; goto ff_match; } else { ff_cp = (ff_c_buf_p); goto ff_find_action; } } else switch ( ff_get_next_buffer( ) ) { case EOB_ACT_END_OF_FILE: { (ff_did_buffer_switch_on_eof) = 0; if ( ffwrap( ) ) { /* Note: because we've taken care in * ff_get_next_buffer() to have set up * fftext, we can now set up * ff_c_buf_p so that if some total * hoser (like flex itself) wants to * call the scanner after we return the * FF_NULL, it'll still work - another * FF_NULL will get returned. */ (ff_c_buf_p) = (fftext_ptr) + FF_MORE_ADJ; ff_act = FF_STATE_EOF(FF_START); goto do_action; } else { if ( ! (ff_did_buffer_switch_on_eof) ) FF_NEW_FILE; } break; } case EOB_ACT_CONTINUE_SCAN: (ff_c_buf_p) = (fftext_ptr) + ff_amount_of_matched_text; ff_current_state = ff_get_previous_state( ); ff_cp = (ff_c_buf_p); ff_bp = (fftext_ptr) + FF_MORE_ADJ; goto ff_match; case EOB_ACT_LAST_MATCH: (ff_c_buf_p) = &FF_CURRENT_BUFFER_LVALUE->ff_ch_buf[(ff_n_chars)]; ff_current_state = ff_get_previous_state( ); ff_cp = (ff_c_buf_p); ff_bp = (fftext_ptr) + FF_MORE_ADJ; goto ff_find_action; } break; } default: FF_FATAL_ERROR( "fatal flex scanner internal error--no action found" ); } /* end of action switch */ } /* end of scanning one token */ } /* end of fflex */ /* ff_get_next_buffer - try to read in a new buffer * * Returns a code representing an action: * EOB_ACT_LAST_MATCH - * EOB_ACT_CONTINUE_SCAN - continue scanning from current position * EOB_ACT_END_OF_FILE - end of file */ static int ff_get_next_buffer (void) { register char *dest = FF_CURRENT_BUFFER_LVALUE->ff_ch_buf; register char *source = (fftext_ptr); register int number_to_move, i; int ret_val; if ( (ff_c_buf_p) > &FF_CURRENT_BUFFER_LVALUE->ff_ch_buf[(ff_n_chars) + 1] ) FF_FATAL_ERROR( "fatal flex scanner internal error--end of buffer missed" ); if ( FF_CURRENT_BUFFER_LVALUE->ff_fill_buffer == 0 ) { /* Don't try to fill the buffer, so this is an EOF. */ if ( (ff_c_buf_p) - (fftext_ptr) - FF_MORE_ADJ == 1 ) { /* We matched a single character, the EOB, so * treat this as a final EOF. */ return EOB_ACT_END_OF_FILE; } else { /* We matched some text prior to the EOB, first * process it. */ return EOB_ACT_LAST_MATCH; } } /* Try to read more data. */ /* First move last chars to start of buffer. */ number_to_move = (int) ((ff_c_buf_p) - (fftext_ptr)) - 1; for ( i = 0; i < number_to_move; ++i ) *(dest++) = *(source++); if ( FF_CURRENT_BUFFER_LVALUE->ff_buffer_status == FF_BUFFER_EOF_PENDING ) /* don't do the read, it's not guaranteed to return an EOF, * just force an EOF */ FF_CURRENT_BUFFER_LVALUE->ff_n_chars = (ff_n_chars) = 0; else { int num_to_read = FF_CURRENT_BUFFER_LVALUE->ff_buf_size - number_to_move - 1; while ( num_to_read <= 0 ) { /* Not enough room in the buffer - grow it. */ /* just a shorter name for the current buffer */ FF_BUFFER_STATE b = FF_CURRENT_BUFFER; int ff_c_buf_p_offset = (int) ((ff_c_buf_p) - b->ff_ch_buf); if ( b->ff_is_our_buffer ) { int new_size = b->ff_buf_size * 2; if ( new_size <= 0 ) b->ff_buf_size += b->ff_buf_size / 8; else b->ff_buf_size *= 2; b->ff_ch_buf = (char *) /* Include room in for 2 EOB chars. */ ffrealloc((void *) b->ff_ch_buf,b->ff_buf_size + 2 ); } else /* Can't grow it, we don't own it. */ b->ff_ch_buf = 0; if ( ! b->ff_ch_buf ) FF_FATAL_ERROR( "fatal error - scanner input buffer overflow" ); (ff_c_buf_p) = &b->ff_ch_buf[ff_c_buf_p_offset]; num_to_read = FF_CURRENT_BUFFER_LVALUE->ff_buf_size - number_to_move - 1; } if ( num_to_read > FF_READ_BUF_SIZE ) num_to_read = FF_READ_BUF_SIZE; /* Read in more data. */ FF_INPUT( (&FF_CURRENT_BUFFER_LVALUE->ff_ch_buf[number_to_move]), (ff_n_chars), (size_t) num_to_read ); FF_CURRENT_BUFFER_LVALUE->ff_n_chars = (ff_n_chars); } if ( (ff_n_chars) == 0 ) { if ( number_to_move == FF_MORE_ADJ ) { ret_val = EOB_ACT_END_OF_FILE; ffrestart(ffin ); } else { ret_val = EOB_ACT_LAST_MATCH; FF_CURRENT_BUFFER_LVALUE->ff_buffer_status = FF_BUFFER_EOF_PENDING; } } else ret_val = EOB_ACT_CONTINUE_SCAN; if ((ff_size_t) ((ff_n_chars) + number_to_move) > FF_CURRENT_BUFFER_LVALUE->ff_buf_size) { /* Extend the array by 50%, plus the number we really need. */ ff_size_t new_size = (ff_n_chars) + number_to_move + ((ff_n_chars) >> 1); FF_CURRENT_BUFFER_LVALUE->ff_ch_buf = (char *) ffrealloc((void *) FF_CURRENT_BUFFER_LVALUE->ff_ch_buf,new_size ); if ( ! FF_CURRENT_BUFFER_LVALUE->ff_ch_buf ) FF_FATAL_ERROR( "out of dynamic memory in ff_get_next_buffer()" ); } (ff_n_chars) += number_to_move; FF_CURRENT_BUFFER_LVALUE->ff_ch_buf[(ff_n_chars)] = FF_END_OF_BUFFER_CHAR; FF_CURRENT_BUFFER_LVALUE->ff_ch_buf[(ff_n_chars) + 1] = FF_END_OF_BUFFER_CHAR; (fftext_ptr) = &FF_CURRENT_BUFFER_LVALUE->ff_ch_buf[0]; return ret_val; } /* ff_get_previous_state - get the state just before the EOB char was reached */ static ff_state_type ff_get_previous_state (void) { register ff_state_type ff_current_state; register char *ff_cp; ff_current_state = (ff_start); for ( ff_cp = (fftext_ptr) + FF_MORE_ADJ; ff_cp < (ff_c_buf_p); ++ff_cp ) { register FF_CHAR ff_c = (*ff_cp ? ff_ec[FF_SC_TO_UI(*ff_cp)] : 1); if ( ff_accept[ff_current_state] ) { (ff_last_accepting_state) = ff_current_state; (ff_last_accepting_cpos) = ff_cp; } while ( ff_chk[ff_base[ff_current_state] + ff_c] != ff_current_state ) { ff_current_state = (int) ff_def[ff_current_state]; if ( ff_current_state >= 160 ) ff_c = ff_meta[(unsigned int) ff_c]; } ff_current_state = ff_nxt[ff_base[ff_current_state] + (unsigned int) ff_c]; } return ff_current_state; } /* ff_try_NUL_trans - try to make a transition on the NUL character * * synopsis * next_state = ff_try_NUL_trans( current_state ); */ static ff_state_type ff_try_NUL_trans (ff_state_type ff_current_state ) { register int ff_is_jam; register char *ff_cp = (ff_c_buf_p); register FF_CHAR ff_c = 1; if ( ff_accept[ff_current_state] ) { (ff_last_accepting_state) = ff_current_state; (ff_last_accepting_cpos) = ff_cp; } while ( ff_chk[ff_base[ff_current_state] + ff_c] != ff_current_state ) { ff_current_state = (int) ff_def[ff_current_state]; if ( ff_current_state >= 160 ) ff_c = ff_meta[(unsigned int) ff_c]; } ff_current_state = ff_nxt[ff_base[ff_current_state] + (unsigned int) ff_c]; ff_is_jam = (ff_current_state == 159); return ff_is_jam ? 0 : ff_current_state; } static void ffunput (int c, register char * ff_bp ) { register char *ff_cp; ff_cp = (ff_c_buf_p); /* undo effects of setting up fftext */ *ff_cp = (ff_hold_char); if ( ff_cp < FF_CURRENT_BUFFER_LVALUE->ff_ch_buf + 2 ) { /* need to shift things up to make room */ /* +2 for EOB chars. */ register int number_to_move = (ff_n_chars) + 2; register char *dest = &FF_CURRENT_BUFFER_LVALUE->ff_ch_buf[ FF_CURRENT_BUFFER_LVALUE->ff_buf_size + 2]; register char *source = &FF_CURRENT_BUFFER_LVALUE->ff_ch_buf[number_to_move]; while ( source > FF_CURRENT_BUFFER_LVALUE->ff_ch_buf ) *--dest = *--source; ff_cp += (int) (dest - source); ff_bp += (int) (dest - source); FF_CURRENT_BUFFER_LVALUE->ff_n_chars = (ff_n_chars) = FF_CURRENT_BUFFER_LVALUE->ff_buf_size; if ( ff_cp < FF_CURRENT_BUFFER_LVALUE->ff_ch_buf + 2 ) FF_FATAL_ERROR( "flex scanner push-back overflow" ); } *--ff_cp = (char) c; (fftext_ptr) = ff_bp; (ff_hold_char) = *ff_cp; (ff_c_buf_p) = ff_cp; } #ifndef FF_NO_INPUT #ifdef __cplusplus static int ffinput (void) #else static int input (void) #endif { int c; *(ff_c_buf_p) = (ff_hold_char); if ( *(ff_c_buf_p) == FF_END_OF_BUFFER_CHAR ) { /* ff_c_buf_p now points to the character we want to return. * If this occurs *before* the EOB characters, then it's a * valid NUL; if not, then we've hit the end of the buffer. */ if ( (ff_c_buf_p) < &FF_CURRENT_BUFFER_LVALUE->ff_ch_buf[(ff_n_chars)] ) /* This was really a NUL. */ *(ff_c_buf_p) = '\0'; else { /* need more input */ int offset = (ff_c_buf_p) - (fftext_ptr); ++(ff_c_buf_p); switch ( ff_get_next_buffer( ) ) { case EOB_ACT_LAST_MATCH: /* This happens because ff_g_n_b() * sees that we've accumulated a * token and flags that we need to * try matching the token before * proceeding. But for input(), * there's no matching to consider. * So convert the EOB_ACT_LAST_MATCH * to EOB_ACT_END_OF_FILE. */ /* Reset buffer status. */ ffrestart(ffin ); /*FALLTHROUGH*/ case EOB_ACT_END_OF_FILE: { if ( ffwrap( ) ) return EOF; if ( ! (ff_did_buffer_switch_on_eof) ) FF_NEW_FILE; #ifdef __cplusplus return ffinput(); #else return input(); #endif } case EOB_ACT_CONTINUE_SCAN: (ff_c_buf_p) = (fftext_ptr) + offset; break; } } } c = *(unsigned char *) (ff_c_buf_p); /* cast for 8-bit char's */ *(ff_c_buf_p) = '\0'; /* preserve fftext */ (ff_hold_char) = *++(ff_c_buf_p); return c; } #endif /* ifndef FF_NO_INPUT */ /** Immediately switch to a different input stream. * @param input_file A readable stream. * * @note This function does not reset the start condition to @c INITIAL . */ void ffrestart (FILE * input_file ) { if ( ! FF_CURRENT_BUFFER ){ ffensure_buffer_stack (); FF_CURRENT_BUFFER_LVALUE = ff_create_buffer(ffin,FF_BUF_SIZE ); } ff_init_buffer(FF_CURRENT_BUFFER,input_file ); ff_load_buffer_state( ); } /** Switch to a different input buffer. * @param new_buffer The new input buffer. * */ void ff_switch_to_buffer (FF_BUFFER_STATE new_buffer ) { /* TODO. We should be able to replace this entire function body * with * ffpop_buffer_state(); * ffpush_buffer_state(new_buffer); */ ffensure_buffer_stack (); if ( FF_CURRENT_BUFFER == new_buffer ) return; if ( FF_CURRENT_BUFFER ) { /* Flush out information for old buffer. */ *(ff_c_buf_p) = (ff_hold_char); FF_CURRENT_BUFFER_LVALUE->ff_buf_pos = (ff_c_buf_p); FF_CURRENT_BUFFER_LVALUE->ff_n_chars = (ff_n_chars); } FF_CURRENT_BUFFER_LVALUE = new_buffer; ff_load_buffer_state( ); /* We don't actually know whether we did this switch during * EOF (ffwrap()) processing, but the only time this flag * is looked at is after ffwrap() is called, so it's safe * to go ahead and always set it. */ (ff_did_buffer_switch_on_eof) = 1; } static void ff_load_buffer_state (void) { (ff_n_chars) = FF_CURRENT_BUFFER_LVALUE->ff_n_chars; (fftext_ptr) = (ff_c_buf_p) = FF_CURRENT_BUFFER_LVALUE->ff_buf_pos; ffin = FF_CURRENT_BUFFER_LVALUE->ff_input_file; (ff_hold_char) = *(ff_c_buf_p); } /** Allocate and initialize an input buffer state. * @param file A readable stream. * @param size The character buffer size in bytes. When in doubt, use @c FF_BUF_SIZE. * * @return the allocated buffer state. */ FF_BUFFER_STATE ff_create_buffer (FILE * file, int size ) { FF_BUFFER_STATE b; b = (FF_BUFFER_STATE) ffalloc(sizeof( struct ff_buffer_state ) ); if ( ! b ) FF_FATAL_ERROR( "out of dynamic memory in ff_create_buffer()" ); b->ff_buf_size = size; /* ff_ch_buf has to be 2 characters longer than the size given because * we need to put in 2 end-of-buffer characters. */ b->ff_ch_buf = (char *) ffalloc(b->ff_buf_size + 2 ); if ( ! b->ff_ch_buf ) FF_FATAL_ERROR( "out of dynamic memory in ff_create_buffer()" ); b->ff_is_our_buffer = 1; ff_init_buffer(b,file ); return b; } /** Destroy the buffer. * @param b a buffer created with ff_create_buffer() * */ void ff_delete_buffer (FF_BUFFER_STATE b ) { if ( ! b ) return; if ( b == FF_CURRENT_BUFFER ) /* Not sure if we should pop here. */ FF_CURRENT_BUFFER_LVALUE = (FF_BUFFER_STATE) 0; if ( b->ff_is_our_buffer ) yyfffree((void *) b->ff_ch_buf ); yyfffree((void *) b ); } #ifndef __cplusplus extern int isatty (int ); #endif /* __cplusplus */ /* Initializes or reinitializes a buffer. * This function is sometimes called more than once on the same buffer, * such as during a ffrestart() or at EOF. */ static void ff_init_buffer (FF_BUFFER_STATE b, FILE * file ) { int oerrno = errno; ff_flush_buffer(b ); b->ff_input_file = file; b->ff_fill_buffer = 1; /* If b is the current buffer, then ff_init_buffer was _probably_ * called from ffrestart() or through ff_get_next_buffer. * In that case, we don't want to reset the lineno or column. */ if (b != FF_CURRENT_BUFFER){ b->ff_bs_lineno = 1; b->ff_bs_column = 0; } b->ff_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; errno = oerrno; } /** Discard all buffered characters. On the next scan, FF_INPUT will be called. * @param b the buffer state to be flushed, usually @c FF_CURRENT_BUFFER. * */ void ff_flush_buffer (FF_BUFFER_STATE b ) { if ( ! b ) return; b->ff_n_chars = 0; /* We always need two end-of-buffer characters. The first causes * a transition to the end-of-buffer state. The second causes * a jam in that state. */ b->ff_ch_buf[0] = FF_END_OF_BUFFER_CHAR; b->ff_ch_buf[1] = FF_END_OF_BUFFER_CHAR; b->ff_buf_pos = &b->ff_ch_buf[0]; b->ff_at_bol = 1; b->ff_buffer_status = FF_BUFFER_NEW; if ( b == FF_CURRENT_BUFFER ) ff_load_buffer_state( ); } /** Pushes the new state onto the stack. The new state becomes * the current state. This function will allocate the stack * if necessary. * @param new_buffer The new state. * */ void ffpush_buffer_state (FF_BUFFER_STATE new_buffer ) { if (new_buffer == NULL) return; ffensure_buffer_stack(); /* This block is copied from ff_switch_to_buffer. */ if ( FF_CURRENT_BUFFER ) { /* Flush out information for old buffer. */ *(ff_c_buf_p) = (ff_hold_char); FF_CURRENT_BUFFER_LVALUE->ff_buf_pos = (ff_c_buf_p); FF_CURRENT_BUFFER_LVALUE->ff_n_chars = (ff_n_chars); } /* Only push if top exists. Otherwise, replace top. */ if (FF_CURRENT_BUFFER) (ff_buffer_stack_top)++; FF_CURRENT_BUFFER_LVALUE = new_buffer; /* copied from ff_switch_to_buffer. */ ff_load_buffer_state( ); (ff_did_buffer_switch_on_eof) = 1; } /** Removes and deletes the top of the stack, if present. * The next element becomes the new top. * */ void ffpop_buffer_state (void) { if (!FF_CURRENT_BUFFER) return; ff_delete_buffer(FF_CURRENT_BUFFER ); FF_CURRENT_BUFFER_LVALUE = NULL; if ((ff_buffer_stack_top) > 0) --(ff_buffer_stack_top); if (FF_CURRENT_BUFFER) { ff_load_buffer_state( ); (ff_did_buffer_switch_on_eof) = 1; } } /* Allocates the stack if it does not exist. * Guarantees space for at least one push. */ static void ffensure_buffer_stack (void) { int num_to_alloc; if (!(ff_buffer_stack)) { /* First allocation is just for 2 elements, since we don't know if this * scanner will even need a stack. We use 2 instead of 1 to avoid an * immediate realloc on the next call. */ num_to_alloc = 1; (ff_buffer_stack) = (struct ff_buffer_state**)ffalloc (num_to_alloc * sizeof(struct ff_buffer_state*) ); if ( ! (ff_buffer_stack) ) FF_FATAL_ERROR( "out of dynamic memory in ffensure_buffer_stack()" ); memset((ff_buffer_stack), 0, num_to_alloc * sizeof(struct ff_buffer_state*)); (ff_buffer_stack_max) = num_to_alloc; (ff_buffer_stack_top) = 0; return; } if ((ff_buffer_stack_top) >= ((ff_buffer_stack_max)) - 1){ /* Increase the buffer to prepare for a possible push. */ int grow_size = 8 /* arbitrary grow size */; num_to_alloc = (ff_buffer_stack_max) + grow_size; (ff_buffer_stack) = (struct ff_buffer_state**)ffrealloc ((ff_buffer_stack), num_to_alloc * sizeof(struct ff_buffer_state*) ); if ( ! (ff_buffer_stack) ) FF_FATAL_ERROR( "out of dynamic memory in ffensure_buffer_stack()" ); /* zero only the new slots.*/ memset((ff_buffer_stack) + (ff_buffer_stack_max), 0, grow_size * sizeof(struct ff_buffer_state*)); (ff_buffer_stack_max) = num_to_alloc; } } /** Setup the input buffer state to scan directly from a user-specified character buffer. * @param base the character buffer * @param size the size in bytes of the character buffer * * @return the newly allocated buffer state object. */ FF_BUFFER_STATE ff_scan_buffer (char * base, ff_size_t size ) { FF_BUFFER_STATE b; if ( size < 2 || base[size-2] != FF_END_OF_BUFFER_CHAR || base[size-1] != FF_END_OF_BUFFER_CHAR ) /* They forgot to leave room for the EOB's. */ return 0; b = (FF_BUFFER_STATE) ffalloc(sizeof( struct ff_buffer_state ) ); if ( ! b ) FF_FATAL_ERROR( "out of dynamic memory in ff_scan_buffer()" ); b->ff_buf_size = size - 2; /* "- 2" to take care of EOB's */ b->ff_buf_pos = b->ff_ch_buf = base; b->ff_is_our_buffer = 0; b->ff_input_file = 0; b->ff_n_chars = b->ff_buf_size; b->ff_is_interactive = 0; b->ff_at_bol = 1; b->ff_fill_buffer = 0; b->ff_buffer_status = FF_BUFFER_NEW; ff_switch_to_buffer(b ); return b; } /** Setup the input buffer state to scan a string. The next call to fflex() will * scan from a @e copy of @a str. * @param ffstr a NUL-terminated string to scan * * @return the newly allocated buffer state object. * @note If you want to scan bytes that may contain NUL values, then use * ff_scan_bytes() instead. */ FF_BUFFER_STATE ff_scan_string (ffconst char * ffstr ) { return ff_scan_bytes(ffstr,strlen(ffstr) ); } /** Setup the input buffer state to scan the given bytes. The next call to fflex() will * scan from a @e copy of @a bytes. * @param bytes the byte buffer to scan * @param len the number of bytes in the buffer pointed to by @a bytes. * * @return the newly allocated buffer state object. */ FF_BUFFER_STATE ff_scan_bytes (ffconst char * ffbytes, int _ffbytes_len ) { FF_BUFFER_STATE b; char *buf; ff_size_t n; int i; /* Get memory for full buffer, including space for trailing EOB's. */ n = _ffbytes_len + 2; buf = (char *) ffalloc(n ); if ( ! buf ) FF_FATAL_ERROR( "out of dynamic memory in ff_scan_bytes()" ); for ( i = 0; i < _ffbytes_len; ++i ) buf[i] = ffbytes[i]; buf[_ffbytes_len] = buf[_ffbytes_len+1] = FF_END_OF_BUFFER_CHAR; b = ff_scan_buffer(buf,n ); if ( ! b ) FF_FATAL_ERROR( "bad buffer in ff_scan_bytes()" ); /* It's okay to grow etc. this buffer, and we should throw it * away when we're done. */ b->ff_is_our_buffer = 1; return b; } #ifndef FF_EXIT_FAILURE #define FF_EXIT_FAILURE 2 #endif static void ff_fatal_error (ffconst char* msg ) { (void) fprintf( stderr, "%s\n", msg ); exit( FF_EXIT_FAILURE ); } /* Redefine ffless() so it works in section 3 code. */ #undef ffless #define ffless(n) \ do \ { \ /* Undo effects of setting up fftext. */ \ int ffless_macro_arg = (n); \ FF_LESS_LINENO(ffless_macro_arg);\ fftext[ffleng] = (ff_hold_char); \ (ff_c_buf_p) = fftext + ffless_macro_arg; \ (ff_hold_char) = *(ff_c_buf_p); \ *(ff_c_buf_p) = '\0'; \ ffleng = ffless_macro_arg; \ } \ while ( 0 ) /* Accessor methods (get/set functions) to struct members. */ /** Get the current line number. * */ int ffget_lineno (void) { return fflineno; } /** Get the input stream. * */ FILE *ffget_in (void) { return ffin; } /** Get the output stream. * */ FILE *ffget_out (void) { return ffout; } /** Get the length of the current token. * */ int ffget_leng (void) { return ffleng; } /** Get the current token. * */ char *ffget_text (void) { return fftext; } /** Set the current line number. * @param line_number * */ void ffset_lineno (int line_number ) { fflineno = line_number; } /** Set the input stream. This does not discard the current * input buffer. * @param in_str A readable stream. * * @see ff_switch_to_buffer */ void ffset_in (FILE * in_str ) { ffin = in_str ; } void ffset_out (FILE * out_str ) { ffout = out_str ; } int ffget_debug (void) { return ff_flex_debug; } void ffset_debug (int bdebug ) { ff_flex_debug = bdebug ; } static int ff_init_globals (void) { /* Initialization is the same as for the non-reentrant scanner. * This function is called from fflex_destroy(), so don't allocate here. */ (ff_buffer_stack) = 0; (ff_buffer_stack_top) = 0; (ff_buffer_stack_max) = 0; (ff_c_buf_p) = (char *) 0; (ff_init) = 0; (ff_start) = 0; /* Defined in main.c */ #ifdef FF_STDINIT ffin = stdin; ffout = stdout; #else ffin = (FILE *) 0; ffout = (FILE *) 0; #endif /* For future reference: Set errno on error, since we are called by * fflex_init() */ return 0; } /* fflex_destroy is for both reentrant and non-reentrant scanners. */ int fflex_destroy (void) { /* Pop the buffer stack, destroying each element. */ while(FF_CURRENT_BUFFER){ ff_delete_buffer(FF_CURRENT_BUFFER ); FF_CURRENT_BUFFER_LVALUE = NULL; ffpop_buffer_state(); } /* Destroy the stack itself. */ yyfffree((ff_buffer_stack) ); (ff_buffer_stack) = NULL; /* Reset the globals. This is important in a non-reentrant scanner so the next time * fflex() is called, initialization will occur. */ ff_init_globals( ); return 0; } /* * Internal utility routines. */ #ifndef fftext_ptr static void ff_flex_strncpy (char* s1, ffconst char * s2, int n ) { register int i; for ( i = 0; i < n; ++i ) s1[i] = s2[i]; } #endif #ifdef FF_NEED_STRLEN static int ff_flex_strlen (ffconst char * s ) { register int n; for ( n = 0; s[n]; ++n ) ; return n; } #endif void *ffalloc (ff_size_t size ) { return (void *) malloc( size ); } void *ffrealloc (void * ptr, ff_size_t size ) { /* The cast to (char *) in the following accommodates both * implementations that use char* generic pointers, and those * that use void* generic pointers. It works with the latter * because both ANSI C and C++ allow castless assignment from * any pointer type to void*, and deal with argument conversions * as though doing an assignment. */ return (void *) realloc( (char *) ptr, size ); } void yyfffree (void * ptr ) { free( (char *) ptr ); /* see ffrealloc() for (char *) cast */ } #define FFTABLES_NAME "fftables" #line 419 "eval.l" int ffwrap() { /* MJT -- 13 June 1996 Supplied for compatibility with pre-2.5.1 versions of flex which do not recognize %option noffwrap */ return(1); } /* expr_read is lifted from old ftools.skel. Now we can use any version of flex with no .skel file necessary! MJT - 13 June 1996 keep a memory of how many bytes have been read previously, so that an unlimited-sized buffer can be supported. PDW - 28 Feb 1998 */ static int expr_read(char *buf, int nbytes) { int n; n = 0; if( !gParse.is_eobuf ) { do { buf[n++] = gParse.expr[gParse.index++]; } while ((nlng = varNum; } return( type ); } static int find_variable(char *varName) { int i; if( gParse.nCols ) for( i=0; i. */ /* As a special exception, you may create a larger work that contains part or all of the Bison parser skeleton and distribute that work under terms of your choice, so long as that work isn't itself a parser generator using the skeleton or a modified version thereof as a parser skeleton. Alternatively, if you modify or redistribute the parser skeleton itself, you may (at your option) remove this special exception, which will cause the skeleton and the resulting Bison output files to be licensed under the GNU General Public License without this special exception. This special exception was added by the Free Software Foundation in version 2.2 of Bison. */ /* Tokens. */ #ifndef FFTOKENTYPE # define FFTOKENTYPE /* Put the tokens into the symbol table, so that GDB and other debuggers know about them. */ enum fftokentype { BOOLEAN = 258, LONG = 259, DOUBLE = 260, STRING = 261, BITSTR = 262, FUNCTION = 263, BFUNCTION = 264, IFUNCTION = 265, GTIFILTER = 266, REGFILTER = 267, COLUMN = 268, BCOLUMN = 269, SCOLUMN = 270, BITCOL = 271, ROWREF = 272, NULLREF = 273, SNULLREF = 274, OR = 275, AND = 276, NE = 277, EQ = 278, GTE = 279, LTE = 280, LT = 281, GT = 282, POWER = 283, NOT = 284, FLTCAST = 285, INTCAST = 286, UMINUS = 287, DIFF = 288, ACCUM = 289 }; #endif /* Tokens. */ #define BOOLEAN 258 #define LONG 259 #define DOUBLE 260 #define STRING 261 #define BITSTR 262 #define FUNCTION 263 #define BFUNCTION 264 #define IFUNCTION 265 #define GTIFILTER 266 #define REGFILTER 267 #define COLUMN 268 #define BCOLUMN 269 #define SCOLUMN 270 #define BITCOL 271 #define ROWREF 272 #define NULLREF 273 #define SNULLREF 274 #define OR 275 #define AND 276 #define NE 277 #define EQ 278 #define GTE 279 #define LTE 280 #define LT 281 #define GT 282 #define POWER 283 #define NOT 284 #define FLTCAST 285 #define INTCAST 286 #define UMINUS 287 #define DIFF 288 #define ACCUM 289 #if ! defined FFSTYPE && ! defined FFSTYPE_IS_DECLARED typedef union FFSTYPE { /* Line 1676 of yacc.c */ #line 192 "eval.y" int Node; /* Index of Node */ double dbl; /* real value */ long lng; /* integer value */ char log; /* logical value */ char str[MAX_STRLEN]; /* string value */ /* Line 1676 of yacc.c */ #line 130 "y.tab.h" } FFSTYPE; # define FFSTYPE_IS_TRIVIAL 1 # define ffstype FFSTYPE /* obsolescent; will be withdrawn */ # define FFSTYPE_IS_DECLARED 1 #endif extern FFSTYPE fflval; cfitsio-3.47/eval.y0000644000225700000360000052733313464573431013545 0ustar cagordonlhea%{ /************************************************************************/ /* */ /* CFITSIO Lexical Parser */ /* */ /* This file is one of 3 files containing code which parses an */ /* arithmetic expression and evaluates it in the context of an input */ /* FITS file table extension. The CFITSIO lexical parser is divided */ /* into the following 3 parts/files: the CFITSIO "front-end", */ /* eval_f.c, contains the interface between the user/CFITSIO and the */ /* real core of the parser; the FLEX interpreter, eval_l.c, takes the */ /* input string and parses it into tokens and identifies the FITS */ /* information required to evaluate the expression (ie, keywords and */ /* columns); and, the BISON grammar and evaluation routines, eval_y.c, */ /* receives the FLEX output and determines and performs the actual */ /* operations. The files eval_l.c and eval_y.c are produced from */ /* running flex and bison on the files eval.l and eval.y, respectively. */ /* (flex and bison are available from any GNU archive: see www.gnu.org) */ /* */ /* The grammar rules, rather than evaluating the expression in situ, */ /* builds a tree, or Nodal, structure mapping out the order of */ /* operations and expression dependencies. This "compilation" process */ /* allows for much faster processing of multiple rows. This technique */ /* was developed by Uwe Lammers of the XMM Science Analysis System, */ /* although the CFITSIO implementation is entirely code original. */ /* */ /* */ /* Modification History: */ /* */ /* Kent Blackburn c1992 Original parser code developed for the */ /* FTOOLS software package, in particular, */ /* the fselect task. */ /* Kent Blackburn c1995 BIT column support added */ /* Peter D Wilson Feb 1998 Vector column support added */ /* Peter D Wilson May 1998 Ported to CFITSIO library. User */ /* interface routines written, in essence */ /* making fselect, fcalc, and maketime */ /* capabilities available to all tools */ /* via single function calls. */ /* Peter D Wilson Jun 1998 Major rewrite of parser core, so as to */ /* create a run-time evaluation tree, */ /* inspired by the work of Uwe Lammers, */ /* resulting in a speed increase of */ /* 10-100 times. */ /* Peter D Wilson Jul 1998 gtifilter(a,b,c,d) function added */ /* Peter D Wilson Aug 1998 regfilter(a,b,c,d) function added */ /* Peter D Wilson Jul 1999 Make parser fitsfile-independent, */ /* allowing a purely vector-based usage */ /* Craig B Markwardt Jun 2004 Add MEDIAN() function */ /* Craig B Markwardt Jun 2004 Add SUM(), and MIN/MAX() for bit arrays */ /* Craig B Markwardt Jun 2004 Allow subscripting of nX bit arrays */ /* Craig B Markwardt Jun 2004 Implement statistical functions */ /* NVALID(), AVERAGE(), and STDDEV() */ /* for integer and floating point vectors */ /* Craig B Markwardt Jun 2004 Use NULL values for range errors instead*/ /* of throwing a parse error */ /* Craig B Markwardt Oct 2004 Add ACCUM() and SEQDIFF() functions */ /* Craig B Markwardt Feb 2005 Add ANGSEP() function */ /* Craig B Markwardt Aug 2005 CIRCLE, BOX, ELLIPSE, NEAR and REGFILTER*/ /* functions now accept vector arguments */ /* Craig B Markwardt Sum 2006 Add RANDOMN() and RANDOMP() functions */ /* Craig B Markwardt Mar 2007 Allow arguments to RANDOM and RANDOMN to*/ /* determine the output dimensions */ /* Craig B Markwardt Aug 2009 Add substring STRMID() and string search*/ /* STRSTR() functions; more overflow checks*/ /* */ /************************************************************************/ #define APPROX 1.0e-7 #include "eval_defs.h" #include "region.h" #include #include #ifndef alloca #define alloca malloc #endif /* Random number generators for various distributions */ #include "simplerng.h" /* Shrink the initial stack depth to keep local data <32K (mac limit) */ /* yacc will allocate more space if needed, though. */ #define YYINITDEPTH 100 /***************************************************************/ /* Replace Bison's BACKUP macro with one that fixes a bug -- */ /* must update state after popping the stack -- and allows */ /* popping multiple terms at one time. */ /***************************************************************/ #define YYNEWBACKUP(token, value) \ do \ if (yychar == YYEMPTY ) \ { yychar = (token); \ memcpy( &yylval, &(value), sizeof(value) ); \ yychar1 = YYTRANSLATE (yychar); \ while (yylen--) YYPOPSTACK; \ yystate = *yyssp; \ goto yybackup; \ } \ else \ { yyerror ("syntax error: cannot back up"); YYERROR; } \ while (0) /***************************************************************/ /* Useful macros for accessing/testing Nodes */ /***************************************************************/ #define TEST(a) if( (a)<0 ) YYERROR #define SIZE(a) gParse.Nodes[ a ].value.nelem #define TYPE(a) gParse.Nodes[ a ].type #define OPER(a) gParse.Nodes[ a ].operation #define PROMOTE(a,b) if( TYPE(a) > TYPE(b) ) \ b = New_Unary( TYPE(a), 0, b ); \ else if( TYPE(a) < TYPE(b) ) \ a = New_Unary( TYPE(b), 0, a ); /***** Internal functions *****/ #ifdef __cplusplus extern "C" { #endif static int Alloc_Node ( void ); static void Free_Last_Node( void ); static void Evaluate_Node ( int thisNode ); static int New_Const ( int returnType, void *value, long len ); static int New_Column( int ColNum ); static int New_Offset( int ColNum, int offset ); static int New_Unary ( int returnType, int Op, int Node1 ); static int New_BinOp ( int returnType, int Node1, int Op, int Node2 ); static int New_Func ( int returnType, funcOp Op, int nNodes, int Node1, int Node2, int Node3, int Node4, int Node5, int Node6, int Node7 ); static int New_FuncSize( int returnType, funcOp Op, int nNodes, int Node1, int Node2, int Node3, int Node4, int Node5, int Node6, int Node7, int Size); static int New_Deref ( int Var, int nDim, int Dim1, int Dim2, int Dim3, int Dim4, int Dim5 ); static int New_GTI ( char *fname, int Node1, char *start, char *stop ); static int New_REG ( char *fname, int NodeX, int NodeY, char *colNames ); static int New_Vector( int subNode ); static int Close_Vec ( int vecNode ); static int Locate_Col( Node *this ); static int Test_Dims ( int Node1, int Node2 ); static void Copy_Dims ( int Node1, int Node2 ); static void Allocate_Ptrs( Node *this ); static void Do_Unary ( Node *this ); static void Do_Offset ( Node *this ); static void Do_BinOp_bit ( Node *this ); static void Do_BinOp_str ( Node *this ); static void Do_BinOp_log ( Node *this ); static void Do_BinOp_lng ( Node *this ); static void Do_BinOp_dbl ( Node *this ); static void Do_Func ( Node *this ); static void Do_Deref ( Node *this ); static void Do_GTI ( Node *this ); static void Do_REG ( Node *this ); static void Do_Vector ( Node *this ); static long Search_GTI ( double evtTime, long nGTI, double *start, double *stop, int ordered ); static char saobox (double xcen, double ycen, double xwid, double ywid, double rot, double xcol, double ycol); static char ellipse(double xcen, double ycen, double xrad, double yrad, double rot, double xcol, double ycol); static char circle (double xcen, double ycen, double rad, double xcol, double ycol); static char bnear (double x, double y, double tolerance); static char bitcmp (char *bitstrm1, char *bitstrm2); static char bitlgte(char *bits1, int oper, char *bits2); static void bitand(char *result, char *bitstrm1, char *bitstrm2); static void bitor (char *result, char *bitstrm1, char *bitstrm2); static void bitnot(char *result, char *bits); static int cstrmid(char *dest_str, int dest_len, char *src_str, int src_len, int pos); static void yyerror(char *msg); #ifdef __cplusplus } #endif %} %union { int Node; /* Index of Node */ double dbl; /* real value */ long lng; /* integer value */ char log; /* logical value */ char str[MAX_STRLEN]; /* string value */ } %token BOOLEAN /* First 3 must be in order of */ %token LONG /* increasing promotion for later use */ %token DOUBLE %token STRING %token BITSTR %token FUNCTION %token BFUNCTION /* Bit function */ %token IFUNCTION /* Integer function */ %token GTIFILTER %token REGFILTER %token COLUMN %token BCOLUMN %token SCOLUMN %token BITCOL %token ROWREF %token NULLREF %token SNULLREF %type expr %type bexpr %type sexpr %type bits %type vector %type bvector %left ',' '=' ':' '{' '}' %right '?' %left OR %left AND %left EQ NE '~' %left GT LT LTE GTE %left '+' '-' '%' %left '*' '/' %left '|' '&' %right POWER %left NOT %left INTCAST FLTCAST %left UMINUS %left '[' %right ACCUM DIFF %% lines: /* nothing ; was | lines line */ | lines line ; line: '\n' {} | expr '\n' { if( $1<0 ) { yyerror("Couldn't build node structure: out of memory?"); YYERROR; } gParse.resultNode = $1; } | bexpr '\n' { if( $1<0 ) { yyerror("Couldn't build node structure: out of memory?"); YYERROR; } gParse.resultNode = $1; } | sexpr '\n' { if( $1<0 ) { yyerror("Couldn't build node structure: out of memory?"); YYERROR; } gParse.resultNode = $1; } | bits '\n' { if( $1<0 ) { yyerror("Couldn't build node structure: out of memory?"); YYERROR; } gParse.resultNode = $1; } | error '\n' { yyerrok; } ; bvector: '{' bexpr { $$ = New_Vector( $2 ); TEST($$); } | bvector ',' bexpr { if( gParse.Nodes[$1].nSubNodes >= MAXSUBS ) { $1 = Close_Vec( $1 ); TEST($1); $$ = New_Vector( $1 ); TEST($$); } else { $$ = $1; } gParse.Nodes[$$].SubNodes[ gParse.Nodes[$$].nSubNodes++ ] = $3; } ; vector: '{' expr { $$ = New_Vector( $2 ); TEST($$); } | vector ',' expr { if( TYPE($1) < TYPE($3) ) TYPE($1) = TYPE($3); if( gParse.Nodes[$1].nSubNodes >= MAXSUBS ) { $1 = Close_Vec( $1 ); TEST($1); $$ = New_Vector( $1 ); TEST($$); } else { $$ = $1; } gParse.Nodes[$$].SubNodes[ gParse.Nodes[$$].nSubNodes++ ] = $3; } | vector ',' bexpr { if( gParse.Nodes[$1].nSubNodes >= MAXSUBS ) { $1 = Close_Vec( $1 ); TEST($1); $$ = New_Vector( $1 ); TEST($$); } else { $$ = $1; } gParse.Nodes[$$].SubNodes[ gParse.Nodes[$$].nSubNodes++ ] = $3; } | bvector ',' expr { TYPE($1) = TYPE($3); if( gParse.Nodes[$1].nSubNodes >= MAXSUBS ) { $1 = Close_Vec( $1 ); TEST($1); $$ = New_Vector( $1 ); TEST($$); } else { $$ = $1; } gParse.Nodes[$$].SubNodes[ gParse.Nodes[$$].nSubNodes++ ] = $3; } ; expr: vector '}' { $$ = Close_Vec( $1 ); TEST($$); } ; bexpr: bvector '}' { $$ = Close_Vec( $1 ); TEST($$); } ; bits: BITSTR { $$ = New_Const( BITSTR, $1, strlen($1)+1 ); TEST($$); SIZE($$) = strlen($1); } | BITCOL { $$ = New_Column( $1 ); TEST($$); } | BITCOL '{' expr '}' { if( TYPE($3) != LONG || OPER($3) != CONST_OP ) { yyerror("Offset argument must be a constant integer"); YYERROR; } $$ = New_Offset( $1, $3 ); TEST($$); } | bits '&' bits { $$ = New_BinOp( BITSTR, $1, '&', $3 ); TEST($$); SIZE($$) = ( SIZE($1)>SIZE($3) ? SIZE($1) : SIZE($3) ); } | bits '|' bits { $$ = New_BinOp( BITSTR, $1, '|', $3 ); TEST($$); SIZE($$) = ( SIZE($1)>SIZE($3) ? SIZE($1) : SIZE($3) ); } | bits '+' bits { if (SIZE($1)+SIZE($3) >= MAX_STRLEN) { yyerror("Combined bit string size exceeds " MAX_STRLEN_S " bits"); YYERROR; } $$ = New_BinOp( BITSTR, $1, '+', $3 ); TEST($$); SIZE($$) = SIZE($1) + SIZE($3); } | bits '[' expr ']' { $$ = New_Deref( $1, 1, $3, 0, 0, 0, 0 ); TEST($$); } | bits '[' expr ',' expr ']' { $$ = New_Deref( $1, 2, $3, $5, 0, 0, 0 ); TEST($$); } | bits '[' expr ',' expr ',' expr ']' { $$ = New_Deref( $1, 3, $3, $5, $7, 0, 0 ); TEST($$); } | bits '[' expr ',' expr ',' expr ',' expr ']' { $$ = New_Deref( $1, 4, $3, $5, $7, $9, 0 ); TEST($$); } | bits '[' expr ',' expr ',' expr ',' expr ',' expr ']' { $$ = New_Deref( $1, 5, $3, $5, $7, $9, $11 ); TEST($$); } | NOT bits { $$ = New_Unary( BITSTR, NOT, $2 ); TEST($$); } | '(' bits ')' { $$ = $2; } ; expr: LONG { $$ = New_Const( LONG, &($1), sizeof(long) ); TEST($$); } | DOUBLE { $$ = New_Const( DOUBLE, &($1), sizeof(double) ); TEST($$); } | COLUMN { $$ = New_Column( $1 ); TEST($$); } | COLUMN '{' expr '}' { if( TYPE($3) != LONG || OPER($3) != CONST_OP ) { yyerror("Offset argument must be a constant integer"); YYERROR; } $$ = New_Offset( $1, $3 ); TEST($$); } | ROWREF { $$ = New_Func( LONG, row_fct, 0, 0, 0, 0, 0, 0, 0, 0 ); } | NULLREF { $$ = New_Func( LONG, null_fct, 0, 0, 0, 0, 0, 0, 0, 0 ); } | expr '%' expr { PROMOTE($1,$3); $$ = New_BinOp( TYPE($1), $1, '%', $3 ); TEST($$); } | expr '+' expr { PROMOTE($1,$3); $$ = New_BinOp( TYPE($1), $1, '+', $3 ); TEST($$); } | expr '-' expr { PROMOTE($1,$3); $$ = New_BinOp( TYPE($1), $1, '-', $3 ); TEST($$); } | expr '*' expr { PROMOTE($1,$3); $$ = New_BinOp( TYPE($1), $1, '*', $3 ); TEST($$); } | expr '/' expr { PROMOTE($1,$3); $$ = New_BinOp( TYPE($1), $1, '/', $3 ); TEST($$); } | expr POWER expr { PROMOTE($1,$3); $$ = New_BinOp( TYPE($1), $1, POWER, $3 ); TEST($$); } | '+' expr %prec UMINUS { $$ = $2; } | '-' expr %prec UMINUS { $$ = New_Unary( TYPE($2), UMINUS, $2 ); TEST($$); } | '(' expr ')' { $$ = $2; } | expr '*' bexpr { $3 = New_Unary( TYPE($1), 0, $3 ); $$ = New_BinOp( TYPE($1), $1, '*', $3 ); TEST($$); } | bexpr '*' expr { $1 = New_Unary( TYPE($3), 0, $1 ); $$ = New_BinOp( TYPE($3), $1, '*', $3 ); TEST($$); } | bexpr '?' expr ':' expr { PROMOTE($3,$5); if( ! Test_Dims($3,$5) ) { yyerror("Incompatible dimensions in '?:' arguments"); YYERROR; } $$ = New_Func( 0, ifthenelse_fct, 3, $3, $5, $1, 0, 0, 0, 0 ); TEST($$); if( SIZE($3)=SIZE($4) && Test_Dims( $2, $4 ) ) { PROMOTE($2,$4); $$ = New_Func( 0, defnull_fct, 2, $2, $4, 0, 0, 0, 0, 0 ); TEST($$); } else { yyerror("Dimensions of DEFNULL arguments " "are not compatible"); YYERROR; } } else if (FSTRCMP($1,"ARCTAN2(") == 0) { if( TYPE($2) != DOUBLE ) $2 = New_Unary( DOUBLE, 0, $2 ); if( TYPE($4) != DOUBLE ) $4 = New_Unary( DOUBLE, 0, $4 ); if( Test_Dims( $2, $4 ) ) { $$ = New_Func( 0, atan2_fct, 2, $2, $4, 0, 0, 0, 0, 0 ); TEST($$); if( SIZE($2)=SIZE($4) && Test_Dims( $2, $4 ) ) { $$ = New_Func( 0, defnull_fct, 2, $2, $4, 0, 0, 0, 0, 0 ); TEST($$); } else { yyerror("Dimensions of DEFNULL arguments are not compatible"); YYERROR; } } else { yyerror("Boolean Function(expr,expr) not supported"); YYERROR; } } | BFUNCTION expr ',' expr ',' expr ')' { if( TYPE($2) != DOUBLE ) $2 = New_Unary( DOUBLE, 0, $2 ); if( TYPE($4) != DOUBLE ) $4 = New_Unary( DOUBLE, 0, $4 ); if( TYPE($6) != DOUBLE ) $6 = New_Unary( DOUBLE, 0, $6 ); if( ! (Test_Dims( $2, $4 ) && Test_Dims( $4, $6 ) ) ) { yyerror("Dimensions of NEAR arguments " "are not compatible"); YYERROR; } else { if (FSTRCMP($1,"NEAR(") == 0) { $$ = New_Func( BOOLEAN, near_fct, 3, $2, $4, $6, 0, 0, 0, 0 ); } else { yyerror("Boolean Function not supported"); YYERROR; } TEST($$); if( SIZE($$)= MAX_STRLEN) { yyerror("Combined string size exceeds " MAX_STRLEN_S " characters"); YYERROR; } $$ = New_BinOp( STRING, $1, '+', $3 ); TEST($$); SIZE($$) = SIZE($1) + SIZE($3); } | bexpr '?' sexpr ':' sexpr { int outSize; if( SIZE($1)!=1 ) { yyerror("Cannot have a vector string column"); YYERROR; } /* Since the output can be calculated now, as a constant scalar, we must precalculate the output size, in order to avoid an overflow. */ outSize = SIZE($3); if (SIZE($5) > outSize) outSize = SIZE($5); $$ = New_FuncSize( 0, ifthenelse_fct, 3, $3, $5, $1, 0, 0, 0, 0, outSize); TEST($$); if( SIZE($3) outSize) outSize = SIZE($4); $$ = New_FuncSize( 0, defnull_fct, 2, $2, $4, 0, 0, 0, 0, 0, outSize ); TEST($$); if( SIZE($4)>SIZE($2) ) SIZE($$) = SIZE($4); } else { yyerror("Function(string,string) not supported"); YYERROR; } } | FUNCTION sexpr ',' expr ',' expr ')' { if (FSTRCMP($1,"STRMID(") == 0) { int len; if( TYPE($4) != LONG || SIZE($4) != 1 || TYPE($6) != LONG || SIZE($6) != 1) { yyerror("When using STRMID(S,P,N), P and N must be integers (and not vector columns)"); YYERROR; } if (OPER($6) == CONST_OP) { /* Constant value: use that directly */ len = (gParse.Nodes[$6].value.data.lng); } else { /* Variable value: use the maximum possible (from $2) */ len = SIZE($2); } if (len <= 0 || len >= MAX_STRLEN) { yyerror("STRMID(S,P,N), N must be 1-" MAX_STRLEN_S); YYERROR; } $$ = New_FuncSize( 0, strmid_fct, 3, $2, $4,$6,0,0,0,0,len); TEST($$); } else { yyerror("Function(string,expr,expr) not supported"); YYERROR; } } ; %% /*************************************************************************/ /* Start of "New" routines which build the expression Nodal structure */ /*************************************************************************/ static int Alloc_Node( void ) { /* Use this for allocation to guarantee *Nodes */ Node *newNodePtr; /* survives on failure, making it still valid */ /* while working our way out of this error */ if( gParse.nNodes == gParse.nNodesAlloc ) { if( gParse.Nodes ) { gParse.nNodesAlloc += gParse.nNodesAlloc; newNodePtr = (Node *)realloc( gParse.Nodes, sizeof(Node)*gParse.nNodesAlloc ); } else { gParse.nNodesAlloc = 100; newNodePtr = (Node *)malloc ( sizeof(Node)*gParse.nNodesAlloc ); } if( newNodePtr ) { gParse.Nodes = newNodePtr; } else { gParse.status = MEMORY_ALLOCATION; return( -1 ); } } return ( gParse.nNodes++ ); } static void Free_Last_Node( void ) { if( gParse.nNodes ) gParse.nNodes--; } static int New_Const( int returnType, void *value, long len ) { Node *this; int n; n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->operation = CONST_OP; /* Flag a constant */ this->DoOp = NULL; this->nSubNodes = 0; this->type = returnType; memcpy( &(this->value.data), value, len ); this->value.undef = NULL; this->value.nelem = 1; this->value.naxis = 1; this->value.naxes[0] = 1; } return(n); } static int New_Column( int ColNum ) { Node *this; int n, i; n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->operation = -ColNum; this->DoOp = NULL; this->nSubNodes = 0; this->type = gParse.varData[ColNum].type; this->value.nelem = gParse.varData[ColNum].nelem; this->value.naxis = gParse.varData[ColNum].naxis; for( i=0; ivalue.naxes[i] = gParse.varData[ColNum].naxes[i]; } return(n); } static int New_Offset( int ColNum, int offsetNode ) { Node *this; int n, i, colNode; colNode = New_Column( ColNum ); if( colNode<0 ) return(-1); n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->operation = '{'; this->DoOp = Do_Offset; this->nSubNodes = 2; this->SubNodes[0] = colNode; this->SubNodes[1] = offsetNode; this->type = gParse.varData[ColNum].type; this->value.nelem = gParse.varData[ColNum].nelem; this->value.naxis = gParse.varData[ColNum].naxis; for( i=0; ivalue.naxes[i] = gParse.varData[ColNum].naxes[i]; } return(n); } static int New_Unary( int returnType, int Op, int Node1 ) { Node *this, *that; int i,n; if( Node1<0 ) return(-1); that = gParse.Nodes + Node1; if( !Op ) Op = returnType; if( (Op==DOUBLE || Op==FLTCAST) && that->type==DOUBLE ) return( Node1 ); if( (Op==LONG || Op==INTCAST) && that->type==LONG ) return( Node1 ); if( (Op==BOOLEAN ) && that->type==BOOLEAN ) return( Node1 ); n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->operation = Op; this->DoOp = Do_Unary; this->nSubNodes = 1; this->SubNodes[0] = Node1; this->type = returnType; that = gParse.Nodes + Node1; /* Reset in case .Nodes mv'd */ this->value.nelem = that->value.nelem; this->value.naxis = that->value.naxis; for( i=0; ivalue.naxis; i++ ) this->value.naxes[i] = that->value.naxes[i]; if( that->operation==CONST_OP ) this->DoOp( this ); } return( n ); } static int New_BinOp( int returnType, int Node1, int Op, int Node2 ) { Node *this,*that1,*that2; int n,i,constant; if( Node1<0 || Node2<0 ) return(-1); n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->operation = Op; this->nSubNodes = 2; this->SubNodes[0]= Node1; this->SubNodes[1]= Node2; this->type = returnType; that1 = gParse.Nodes + Node1; that2 = gParse.Nodes + Node2; constant = (that1->operation==CONST_OP && that2->operation==CONST_OP); if( that1->type!=STRING && that1->type!=BITSTR ) if( !Test_Dims( Node1, Node2 ) ) { Free_Last_Node(); yyerror("Array sizes/dims do not match for binary operator"); return(-1); } if( that1->value.nelem == 1 ) that1 = that2; this->value.nelem = that1->value.nelem; this->value.naxis = that1->value.naxis; for( i=0; ivalue.naxis; i++ ) this->value.naxes[i] = that1->value.naxes[i]; if ( Op == ACCUM && that1->type == BITSTR ) { /* ACCUM is rank-reducing on bit strings */ this->value.nelem = 1; this->value.naxis = 1; this->value.naxes[0] = 1; } /* Both subnodes should be of same time */ switch( that1->type ) { case BITSTR: this->DoOp = Do_BinOp_bit; break; case STRING: this->DoOp = Do_BinOp_str; break; case BOOLEAN: this->DoOp = Do_BinOp_log; break; case LONG: this->DoOp = Do_BinOp_lng; break; case DOUBLE: this->DoOp = Do_BinOp_dbl; break; } if( constant ) this->DoOp( this ); } return( n ); } static int New_Func( int returnType, funcOp Op, int nNodes, int Node1, int Node2, int Node3, int Node4, int Node5, int Node6, int Node7 ) { return New_FuncSize(returnType, Op, nNodes, Node1, Node2, Node3, Node4, Node5, Node6, Node7, 0); } static int New_FuncSize( int returnType, funcOp Op, int nNodes, int Node1, int Node2, int Node3, int Node4, int Node5, int Node6, int Node7, int Size ) /* If returnType==0 , use Node1's type and vector sizes as returnType, */ /* else return a single value of type returnType */ { Node *this, *that; int i,n,constant; if( Node1<0 || Node2<0 || Node3<0 || Node4<0 || Node5<0 || Node6<0 || Node7<0 ) return(-1); n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->operation = (int)Op; this->DoOp = Do_Func; this->nSubNodes = nNodes; this->SubNodes[0] = Node1; this->SubNodes[1] = Node2; this->SubNodes[2] = Node3; this->SubNodes[3] = Node4; this->SubNodes[4] = Node5; this->SubNodes[5] = Node6; this->SubNodes[6] = Node7; i = constant = nNodes; /* Functions with zero params are not const */ if (Op == poirnd_fct) constant = 0; /* Nor is Poisson deviate */ while( i-- ) constant = ( constant && OPER(this->SubNodes[i]) == CONST_OP ); if( returnType ) { this->type = returnType; this->value.nelem = 1; this->value.naxis = 1; this->value.naxes[0] = 1; } else { that = gParse.Nodes + Node1; this->type = that->type; this->value.nelem = that->value.nelem; this->value.naxis = that->value.naxis; for( i=0; ivalue.naxis; i++ ) this->value.naxes[i] = that->value.naxes[i]; } /* Force explicit size before evaluating */ if (Size > 0) this->value.nelem = Size; if( constant ) this->DoOp( this ); } return( n ); } static int New_Deref( int Var, int nDim, int Dim1, int Dim2, int Dim3, int Dim4, int Dim5 ) { int n, idx, constant; long elem=0; Node *this, *theVar, *theDim[MAXDIMS]; if( Var<0 || Dim1<0 || Dim2<0 || Dim3<0 || Dim4<0 || Dim5<0 ) return(-1); theVar = gParse.Nodes + Var; if( theVar->operation==CONST_OP || theVar->value.nelem==1 ) { yyerror("Cannot index a scalar value"); return(-1); } n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->nSubNodes = nDim+1; theVar = gParse.Nodes + (this->SubNodes[0]=Var); theDim[0] = gParse.Nodes + (this->SubNodes[1]=Dim1); theDim[1] = gParse.Nodes + (this->SubNodes[2]=Dim2); theDim[2] = gParse.Nodes + (this->SubNodes[3]=Dim3); theDim[3] = gParse.Nodes + (this->SubNodes[4]=Dim4); theDim[4] = gParse.Nodes + (this->SubNodes[5]=Dim5); constant = theVar->operation==CONST_OP; for( idx=0; idxoperation==CONST_OP); for( idx=0; idxvalue.nelem>1 ) { Free_Last_Node(); yyerror("Cannot use an array as an index value"); return(-1); } else if( theDim[idx]->type!=LONG ) { Free_Last_Node(); yyerror("Index value must be an integer type"); return(-1); } this->operation = '['; this->DoOp = Do_Deref; this->type = theVar->type; if( theVar->value.naxis == nDim ) { /* All dimensions specified */ this->value.nelem = 1; this->value.naxis = 1; this->value.naxes[0] = 1; } else if( nDim==1 ) { /* Dereference only one dimension */ elem=1; this->value.naxis = theVar->value.naxis-1; for( idx=0; idxvalue.naxis; idx++ ) { elem *= ( this->value.naxes[idx] = theVar->value.naxes[idx] ); } this->value.nelem = elem; } else { Free_Last_Node(); yyerror("Must specify just one or all indices for vector"); return(-1); } if( constant ) this->DoOp( this ); } return(n); } extern int yyGetVariable( char *varName, YYSTYPE *varVal ); static int New_GTI( char *fname, int Node1, char *start, char *stop ) { fitsfile *fptr; Node *this, *that0, *that1; int type,i,n, startCol, stopCol, Node0; int hdutype, hdunum, evthdu, samefile, extvers, movetotype, tstat; char extname[100]; long nrows; double timeZeroI[2], timeZeroF[2], dt, timeSpan; char xcol[20], xexpr[20]; YYSTYPE colVal; if( Node1==-99 ) { type = yyGetVariable( "TIME", &colVal ); if( type==COLUMN ) { Node1 = New_Column( (int)colVal.lng ); } else { yyerror("Could not build TIME column for GTIFILTER"); return(-1); } } Node1 = New_Unary( DOUBLE, 0, Node1 ); Node0 = Alloc_Node(); /* This will hold the START/STOP times */ if( Node1<0 || Node0<0 ) return(-1); /* Record current HDU number in case we need to move within this file */ fptr = gParse.def_fptr; ffghdn( fptr, &evthdu ); /* Look for TIMEZERO keywords in current extension */ tstat = 0; if( ffgkyd( fptr, "TIMEZERO", timeZeroI, NULL, &tstat ) ) { tstat = 0; if( ffgkyd( fptr, "TIMEZERI", timeZeroI, NULL, &tstat ) ) { timeZeroI[0] = timeZeroF[0] = 0.0; } else if( ffgkyd( fptr, "TIMEZERF", timeZeroF, NULL, &tstat ) ) { timeZeroF[0] = 0.0; } } else { timeZeroF[0] = 0.0; } /* Resolve filename parameter */ switch( fname[0] ) { case '\0': samefile = 1; hdunum = 1; break; case '[': samefile = 1; i = 1; while( fname[i] != '\0' && fname[i] != ']' ) i++; if( fname[i] ) { fname[i] = '\0'; fname++; ffexts( fname, &hdunum, extname, &extvers, &movetotype, xcol, xexpr, &gParse.status ); if( *extname ) { ffmnhd( fptr, movetotype, extname, extvers, &gParse.status ); ffghdn( fptr, &hdunum ); } else if( hdunum ) { ffmahd( fptr, ++hdunum, &hdutype, &gParse.status ); } else if( !gParse.status ) { yyerror("Cannot use primary array for GTI filter"); return( -1 ); } } else { yyerror("File extension specifier lacks closing ']'"); return( -1 ); } break; case '+': samefile = 1; hdunum = atoi( fname ) + 1; if( hdunum>1 ) ffmahd( fptr, hdunum, &hdutype, &gParse.status ); else { yyerror("Cannot use primary array for GTI filter"); return( -1 ); } break; default: samefile = 0; if( ! ffopen( &fptr, fname, READONLY, &gParse.status ) ) ffghdn( fptr, &hdunum ); break; } if( gParse.status ) return(-1); /* If at primary, search for GTI extension */ if( hdunum==1 ) { while( 1 ) { hdunum++; if( ffmahd( fptr, hdunum, &hdutype, &gParse.status ) ) break; if( hdutype==IMAGE_HDU ) continue; tstat = 0; if( ffgkys( fptr, "EXTNAME", extname, NULL, &tstat ) ) continue; ffupch( extname ); if( strstr( extname, "GTI" ) ) break; } if( gParse.status ) { if( gParse.status==END_OF_FILE ) yyerror("GTI extension not found in this file"); return(-1); } } /* Locate START/STOP Columns */ ffgcno( fptr, CASEINSEN, start, &startCol, &gParse.status ); ffgcno( fptr, CASEINSEN, stop, &stopCol, &gParse.status ); if( gParse.status ) return(-1); /* Look for TIMEZERO keywords in GTI extension */ tstat = 0; if( ffgkyd( fptr, "TIMEZERO", timeZeroI+1, NULL, &tstat ) ) { tstat = 0; if( ffgkyd( fptr, "TIMEZERI", timeZeroI+1, NULL, &tstat ) ) { timeZeroI[1] = timeZeroF[1] = 0.0; } else if( ffgkyd( fptr, "TIMEZERF", timeZeroF+1, NULL, &tstat ) ) { timeZeroF[1] = 0.0; } } else { timeZeroF[1] = 0.0; } n = Alloc_Node(); if( n >= 0 ) { this = gParse.Nodes + n; this->nSubNodes = 2; this->SubNodes[1] = Node1; this->operation = (int)gtifilt_fct; this->DoOp = Do_GTI; this->type = BOOLEAN; that1 = gParse.Nodes + Node1; this->value.nelem = that1->value.nelem; this->value.naxis = that1->value.naxis; for( i=0; i < that1->value.naxis; i++ ) this->value.naxes[i] = that1->value.naxes[i]; /* Init START/STOP node to be treated as a "constant" */ this->SubNodes[0] = Node0; that0 = gParse.Nodes + Node0; that0->operation = CONST_OP; that0->DoOp = NULL; that0->value.data.ptr= NULL; /* Read in START/STOP times */ if( ffgkyj( fptr, "NAXIS2", &nrows, NULL, &gParse.status ) ) return(-1); that0->value.nelem = nrows; if( nrows ) { that0->value.data.dblptr = (double*)malloc( 2*nrows*sizeof(double) ); if( !that0->value.data.dblptr ) { gParse.status = MEMORY_ALLOCATION; return(-1); } ffgcvd( fptr, startCol, 1L, 1L, nrows, 0.0, that0->value.data.dblptr, &i, &gParse.status ); ffgcvd( fptr, stopCol, 1L, 1L, nrows, 0.0, that0->value.data.dblptr+nrows, &i, &gParse.status ); if( gParse.status ) { free( that0->value.data.dblptr ); return(-1); } /* Test for fully time-ordered GTI... both START && STOP */ that0->type = 1; /* Assume yes */ i = nrows; while( --i ) if( that0->value.data.dblptr[i-1] >= that0->value.data.dblptr[i] || that0->value.data.dblptr[i-1+nrows] >= that0->value.data.dblptr[i+nrows] ) { that0->type = 0; break; } /* Handle TIMEZERO offset, if any */ dt = (timeZeroI[1] - timeZeroI[0]) + (timeZeroF[1] - timeZeroF[0]); timeSpan = that0->value.data.dblptr[nrows+nrows-1] - that0->value.data.dblptr[0]; if( fabs( dt / timeSpan ) > 1e-12 ) { for( i=0; i<(nrows+nrows); i++ ) that0->value.data.dblptr[i] += dt; } } if( OPER(Node1)==CONST_OP ) this->DoOp( this ); } if( samefile ) ffmahd( fptr, evthdu, &hdutype, &gParse.status ); else ffclos( fptr, &gParse.status ); return( n ); } static int New_REG( char *fname, int NodeX, int NodeY, char *colNames ) { Node *this, *that0; int type, n, Node0; int Xcol, Ycol, tstat; WCSdata wcs; SAORegion *Rgn; char *cX, *cY; YYSTYPE colVal; if( NodeX==-99 ) { type = yyGetVariable( "X", &colVal ); if( type==COLUMN ) { NodeX = New_Column( (int)colVal.lng ); } else { yyerror("Could not build X column for REGFILTER"); return(-1); } } if( NodeY==-99 ) { type = yyGetVariable( "Y", &colVal ); if( type==COLUMN ) { NodeY = New_Column( (int)colVal.lng ); } else { yyerror("Could not build Y column for REGFILTER"); return(-1); } } NodeX = New_Unary( DOUBLE, 0, NodeX ); NodeY = New_Unary( DOUBLE, 0, NodeY ); Node0 = Alloc_Node(); /* This will hold the Region Data */ if( NodeX<0 || NodeY<0 || Node0<0 ) return(-1); if( ! (Test_Dims( NodeX, NodeY ) ) ) { yyerror("Dimensions of REGFILTER arguments are not compatible"); return (-1); } n = Alloc_Node(); if( n >= 0 ) { this = gParse.Nodes + n; this->nSubNodes = 3; this->SubNodes[0] = Node0; this->SubNodes[1] = NodeX; this->SubNodes[2] = NodeY; this->operation = (int)regfilt_fct; this->DoOp = Do_REG; this->type = BOOLEAN; this->value.nelem = 1; this->value.naxis = 1; this->value.naxes[0] = 1; Copy_Dims(n, NodeX); if( SIZE(NodeX)operation = CONST_OP; that0->DoOp = NULL; /* Identify what columns to use for WCS information */ Xcol = Ycol = 0; if( *colNames ) { /* Use the column names in this string for WCS info */ while( *colNames==' ' ) colNames++; cX = cY = colNames; while( *cY && *cY!=' ' && *cY!=',' ) cY++; if( *cY ) *(cY++) = '\0'; while( *cY==' ' ) cY++; if( !*cY ) { yyerror("Could not extract valid pair of column names from REGFILTER"); Free_Last_Node(); return( -1 ); } fits_get_colnum( gParse.def_fptr, CASEINSEN, cX, &Xcol, &gParse.status ); fits_get_colnum( gParse.def_fptr, CASEINSEN, cY, &Ycol, &gParse.status ); if( gParse.status ) { yyerror("Could not locate columns indicated for WCS info"); Free_Last_Node(); return( -1 ); } } else { /* Try to find columns used in X/Y expressions */ Xcol = Locate_Col( gParse.Nodes + NodeX ); Ycol = Locate_Col( gParse.Nodes + NodeY ); if( Xcol<0 || Ycol<0 ) { yyerror("Found multiple X/Y column references in REGFILTER"); Free_Last_Node(); return( -1 ); } } /* Now, get the WCS info, if it exists, from the indicated columns */ wcs.exists = 0; if( Xcol>0 && Ycol>0 ) { tstat = 0; ffgtcs( gParse.def_fptr, Xcol, Ycol, &wcs.xrefval, &wcs.yrefval, &wcs.xrefpix, &wcs.yrefpix, &wcs.xinc, &wcs.yinc, &wcs.rot, wcs.type, &tstat ); if( tstat==NO_WCS_KEY ) { wcs.exists = 0; } else if( tstat ) { gParse.status = tstat; Free_Last_Node(); return( -1 ); } else { wcs.exists = 1; } } /* Read in Region file */ fits_read_rgnfile( fname, &wcs, &Rgn, &gParse.status ); if( gParse.status ) { Free_Last_Node(); return( -1 ); } that0->value.data.ptr = Rgn; if( OPER(NodeX)==CONST_OP && OPER(NodeY)==CONST_OP ) this->DoOp( this ); } return( n ); } static int New_Vector( int subNode ) { Node *this, *that; int n; n = Alloc_Node(); if( n >= 0 ) { this = gParse.Nodes + n; that = gParse.Nodes + subNode; this->type = that->type; this->nSubNodes = 1; this->SubNodes[0] = subNode; this->operation = '{'; this->DoOp = Do_Vector; } return( n ); } static int Close_Vec( int vecNode ) { Node *this; int n, nelem=0; this = gParse.Nodes + vecNode; for( n=0; n < this->nSubNodes; n++ ) { if( TYPE( this->SubNodes[n] ) != this->type ) { this->SubNodes[n] = New_Unary( this->type, 0, this->SubNodes[n] ); if( this->SubNodes[n]<0 ) return(-1); } nelem += SIZE(this->SubNodes[n]); } this->value.naxis = 1; this->value.nelem = nelem; this->value.naxes[0] = nelem; return( vecNode ); } static int Locate_Col( Node *this ) /* Locate the TABLE column number of any columns in "this" calculation. */ /* Return ZERO if none found, or negative if more than 1 found. */ { Node *that; int i, col=0, newCol, nfound=0; if( this->nSubNodes==0 && this->operation<=0 && this->operation!=CONST_OP ) return gParse.colData[ - this->operation].colnum; for( i=0; inSubNodes; i++ ) { that = gParse.Nodes + this->SubNodes[i]; if( that->operation>0 ) { newCol = Locate_Col( that ); if( newCol<=0 ) { nfound += -newCol; } else { if( !nfound ) { col = newCol; nfound++; } else if( col != newCol ) { nfound++; } } } else if( that->operation!=CONST_OP ) { /* Found a Column */ newCol = gParse.colData[- that->operation].colnum; if( !nfound ) { col = newCol; nfound++; } else if( col != newCol ) { nfound++; } } } if( nfound!=1 ) return( - nfound ); else return( col ); } static int Test_Dims( int Node1, int Node2 ) { Node *that1, *that2; int valid, i; if( Node1<0 || Node2<0 ) return(0); that1 = gParse.Nodes + Node1; that2 = gParse.Nodes + Node2; if( that1->value.nelem==1 || that2->value.nelem==1 ) valid = 1; else if( that1->type==that2->type && that1->value.nelem==that2->value.nelem && that1->value.naxis==that2->value.naxis ) { valid = 1; for( i=0; ivalue.naxis; i++ ) { if( that1->value.naxes[i]!=that2->value.naxes[i] ) valid = 0; } } else valid = 0; return( valid ); } static void Copy_Dims( int Node1, int Node2 ) { Node *that1, *that2; int i; if( Node1<0 || Node2<0 ) return; that1 = gParse.Nodes + Node1; that2 = gParse.Nodes + Node2; that1->value.nelem = that2->value.nelem; that1->value.naxis = that2->value.naxis; for( i=0; ivalue.naxis; i++ ) that1->value.naxes[i] = that2->value.naxes[i]; } /********************************************************************/ /* Routines for actually evaluating the expression start here */ /********************************************************************/ void Evaluate_Parser( long firstRow, long nRows ) /***********************************************************************/ /* Reset the parser for processing another batch of data... */ /* firstRow: Row number of the first element to evaluate */ /* nRows: Number of rows to be processed */ /* Initialize each COLUMN node so that its UNDEF and DATA pointers */ /* point to the appropriate column arrays. */ /* Finally, call Evaluate_Node for final node. */ /***********************************************************************/ { int i, column; long offset, rowOffset; static int rand_initialized = 0; /* Initialize the random number generator once and only once */ if (rand_initialized == 0) { simplerng_srand( (unsigned int) time(NULL) ); rand_initialized = 1; } gParse.firstRow = firstRow; gParse.nRows = nRows; /* Reset Column Nodes' pointers to point to right data and UNDEF arrays */ rowOffset = firstRow - gParse.firstDataRow; for( i=0; i 0 || OPER(i) == CONST_OP ) continue; column = -OPER(i); offset = gParse.varData[column].nelem * rowOffset; gParse.Nodes[i].value.undef = gParse.varData[column].undef + offset; switch( gParse.Nodes[i].type ) { case BITSTR: gParse.Nodes[i].value.data.strptr = (char**)gParse.varData[column].data + rowOffset; gParse.Nodes[i].value.undef = NULL; break; case STRING: gParse.Nodes[i].value.data.strptr = (char**)gParse.varData[column].data + rowOffset; gParse.Nodes[i].value.undef = gParse.varData[column].undef + rowOffset; break; case BOOLEAN: gParse.Nodes[i].value.data.logptr = (char*)gParse.varData[column].data + offset; break; case LONG: gParse.Nodes[i].value.data.lngptr = (long*)gParse.varData[column].data + offset; break; case DOUBLE: gParse.Nodes[i].value.data.dblptr = (double*)gParse.varData[column].data + offset; break; } } Evaluate_Node( gParse.resultNode ); } static void Evaluate_Node( int thisNode ) /**********************************************************************/ /* Recursively evaluate thisNode's subNodes, then call one of the */ /* Do_ functions pointed to by thisNode's DoOp element. */ /**********************************************************************/ { Node *this; int i; if( gParse.status ) return; this = gParse.Nodes + thisNode; if( this->operation>0 ) { /* <=0 indicate constants and columns */ i = this->nSubNodes; while( i-- ) { Evaluate_Node( this->SubNodes[i] ); if( gParse.status ) return; } this->DoOp( this ); } } static void Allocate_Ptrs( Node *this ) { long elem, row, size; if( this->type==BITSTR || this->type==STRING ) { this->value.data.strptr = (char**)malloc( gParse.nRows * sizeof(char*) ); if( this->value.data.strptr ) { this->value.data.strptr[0] = (char*)malloc( gParse.nRows * (this->value.nelem+2) * sizeof(char) ); if( this->value.data.strptr[0] ) { row = 0; while( (++row)value.data.strptr[row] = this->value.data.strptr[row-1] + this->value.nelem+1; } if( this->type==STRING ) { this->value.undef = this->value.data.strptr[row-1] + this->value.nelem+1; } else { this->value.undef = NULL; /* BITSTRs don't use undef array */ } } else { gParse.status = MEMORY_ALLOCATION; free( this->value.data.strptr ); } } else { gParse.status = MEMORY_ALLOCATION; } } else { elem = this->value.nelem * gParse.nRows; switch( this->type ) { case DOUBLE: size = sizeof( double ); break; case LONG: size = sizeof( long ); break; case BOOLEAN: size = sizeof( char ); break; default: size = 1; break; } this->value.data.ptr = calloc(size+1, elem); if( this->value.data.ptr==NULL ) { gParse.status = MEMORY_ALLOCATION; } else { this->value.undef = (char *)this->value.data.ptr + elem*size; } } } static void Do_Unary( Node *this ) { Node *that; long elem; that = gParse.Nodes + this->SubNodes[0]; if( that->operation==CONST_OP ) { /* Operating on a constant! */ switch( this->operation ) { case DOUBLE: case FLTCAST: if( that->type==LONG ) this->value.data.dbl = (double)that->value.data.lng; else if( that->type==BOOLEAN ) this->value.data.dbl = ( that->value.data.log ? 1.0 : 0.0 ); break; case LONG: case INTCAST: if( that->type==DOUBLE ) this->value.data.lng = (long)that->value.data.dbl; else if( that->type==BOOLEAN ) this->value.data.lng = ( that->value.data.log ? 1L : 0L ); break; case BOOLEAN: if( that->type==DOUBLE ) this->value.data.log = ( that->value.data.dbl != 0.0 ); else if( that->type==LONG ) this->value.data.log = ( that->value.data.lng != 0L ); break; case UMINUS: if( that->type==DOUBLE ) this->value.data.dbl = - that->value.data.dbl; else if( that->type==LONG ) this->value.data.lng = - that->value.data.lng; break; case NOT: if( that->type==BOOLEAN ) this->value.data.log = ( ! that->value.data.log ); else if( that->type==BITSTR ) bitnot( this->value.data.str, that->value.data.str ); break; } this->operation = CONST_OP; } else { Allocate_Ptrs( this ); if( !gParse.status ) { if( this->type!=BITSTR ) { elem = gParse.nRows; if( this->type!=STRING ) elem *= this->value.nelem; while( elem-- ) this->value.undef[elem] = that->value.undef[elem]; } elem = gParse.nRows * this->value.nelem; switch( this->operation ) { case BOOLEAN: if( that->type==DOUBLE ) while( elem-- ) this->value.data.logptr[elem] = ( that->value.data.dblptr[elem] != 0.0 ); else if( that->type==LONG ) while( elem-- ) this->value.data.logptr[elem] = ( that->value.data.lngptr[elem] != 0L ); break; case DOUBLE: case FLTCAST: if( that->type==LONG ) while( elem-- ) this->value.data.dblptr[elem] = (double)that->value.data.lngptr[elem]; else if( that->type==BOOLEAN ) while( elem-- ) this->value.data.dblptr[elem] = ( that->value.data.logptr[elem] ? 1.0 : 0.0 ); break; case LONG: case INTCAST: if( that->type==DOUBLE ) while( elem-- ) this->value.data.lngptr[elem] = (long)that->value.data.dblptr[elem]; else if( that->type==BOOLEAN ) while( elem-- ) this->value.data.lngptr[elem] = ( that->value.data.logptr[elem] ? 1L : 0L ); break; case UMINUS: if( that->type==DOUBLE ) { while( elem-- ) this->value.data.dblptr[elem] = - that->value.data.dblptr[elem]; } else if( that->type==LONG ) { while( elem-- ) this->value.data.lngptr[elem] = - that->value.data.lngptr[elem]; } break; case NOT: if( that->type==BOOLEAN ) { while( elem-- ) this->value.data.logptr[elem] = ( ! that->value.data.logptr[elem] ); } else if( that->type==BITSTR ) { elem = gParse.nRows; while( elem-- ) bitnot( this->value.data.strptr[elem], that->value.data.strptr[elem] ); } break; } } } if( that->operation>0 ) { free( that->value.data.ptr ); } } static void Do_Offset( Node *this ) { Node *col; long fRow, nRowOverlap, nRowReload, rowOffset; long nelem, elem, offset, nRealElem; int status; col = gParse.Nodes + this->SubNodes[0]; rowOffset = gParse.Nodes[ this->SubNodes[1] ].value.data.lng; Allocate_Ptrs( this ); fRow = gParse.firstRow + rowOffset; if( this->type==STRING || this->type==BITSTR ) nRealElem = 1; else nRealElem = this->value.nelem; nelem = nRealElem; if( fRow < gParse.firstDataRow ) { /* Must fill in data at start of array */ nRowReload = gParse.firstDataRow - fRow; if( nRowReload > gParse.nRows ) nRowReload = gParse.nRows; nRowOverlap = gParse.nRows - nRowReload; offset = 0; /* NULLify any values falling out of bounds */ while( fRow<1 && nRowReload>0 ) { if( this->type == BITSTR ) { nelem = this->value.nelem; this->value.data.strptr[offset][ nelem ] = '\0'; while( nelem-- ) this->value.data.strptr[offset][nelem] = '0'; offset++; } else { while( nelem-- ) this->value.undef[offset++] = 1; } nelem = nRealElem; fRow++; nRowReload--; } } else if( fRow + gParse.nRows > gParse.firstDataRow + gParse.nDataRows ) { /* Must fill in data at end of array */ nRowReload = (fRow+gParse.nRows) - (gParse.firstDataRow+gParse.nDataRows); if( nRowReload>gParse.nRows ) { nRowReload = gParse.nRows; } else { fRow = gParse.firstDataRow + gParse.nDataRows; } nRowOverlap = gParse.nRows - nRowReload; offset = nRowOverlap * nelem; /* NULLify any values falling out of bounds */ elem = gParse.nRows * nelem; while( fRow+nRowReload>gParse.totalRows && nRowReload>0 ) { if( this->type == BITSTR ) { nelem = this->value.nelem; elem--; this->value.data.strptr[elem][ nelem ] = '\0'; while( nelem-- ) this->value.data.strptr[elem][nelem] = '0'; } else { while( nelem-- ) this->value.undef[--elem] = 1; } nelem = nRealElem; nRowReload--; } } else { nRowReload = 0; nRowOverlap = gParse.nRows; offset = 0; } if( nRowReload>0 ) { switch( this->type ) { case BITSTR: case STRING: status = (*gParse.loadData)( -col->operation, fRow, nRowReload, this->value.data.strptr+offset, this->value.undef+offset ); break; case BOOLEAN: status = (*gParse.loadData)( -col->operation, fRow, nRowReload, this->value.data.logptr+offset, this->value.undef+offset ); break; case LONG: status = (*gParse.loadData)( -col->operation, fRow, nRowReload, this->value.data.lngptr+offset, this->value.undef+offset ); break; case DOUBLE: status = (*gParse.loadData)( -col->operation, fRow, nRowReload, this->value.data.dblptr+offset, this->value.undef+offset ); break; } } /* Now copy over the overlapping region, if any */ if( nRowOverlap <= 0 ) return; if( rowOffset>0 ) elem = nRowOverlap * nelem; else elem = gParse.nRows * nelem; offset = nelem * rowOffset; while( nRowOverlap-- && !gParse.status ) { while( nelem-- && !gParse.status ) { elem--; if( this->type != BITSTR ) this->value.undef[elem] = col->value.undef[elem+offset]; switch( this->type ) { case BITSTR: strcpy( this->value.data.strptr[elem ], col->value.data.strptr[elem+offset] ); break; case STRING: strcpy( this->value.data.strptr[elem ], col->value.data.strptr[elem+offset] ); break; case BOOLEAN: this->value.data.logptr[elem] = col->value.data.logptr[elem+offset]; break; case LONG: this->value.data.lngptr[elem] = col->value.data.lngptr[elem+offset]; break; case DOUBLE: this->value.data.dblptr[elem] = col->value.data.dblptr[elem+offset]; break; } } nelem = nRealElem; } } static void Do_BinOp_bit( Node *this ) { Node *that1, *that2; char *sptr1=NULL, *sptr2=NULL; int const1, const2; long rows; that1 = gParse.Nodes + this->SubNodes[0]; that2 = gParse.Nodes + this->SubNodes[1]; const1 = ( that1->operation==CONST_OP ); const2 = ( that2->operation==CONST_OP ); sptr1 = ( const1 ? that1->value.data.str : NULL ); sptr2 = ( const2 ? that2->value.data.str : NULL ); if( const1 && const2 ) { switch( this->operation ) { case NE: this->value.data.log = !bitcmp( sptr1, sptr2 ); break; case EQ: this->value.data.log = bitcmp( sptr1, sptr2 ); break; case GT: case LT: case LTE: case GTE: this->value.data.log = bitlgte( sptr1, this->operation, sptr2 ); break; case '|': bitor( this->value.data.str, sptr1, sptr2 ); break; case '&': bitand( this->value.data.str, sptr1, sptr2 ); break; case '+': strcpy( this->value.data.str, sptr1 ); strcat( this->value.data.str, sptr2 ); break; case ACCUM: this->value.data.lng = 0; while( *sptr1 ) { if ( *sptr1 == '1' ) this->value.data.lng ++; sptr1 ++; } break; } this->operation = CONST_OP; } else { Allocate_Ptrs( this ); if( !gParse.status ) { rows = gParse.nRows; switch( this->operation ) { /* BITSTR comparisons */ case NE: case EQ: case GT: case LT: case LTE: case GTE: while( rows-- ) { if( !const1 ) sptr1 = that1->value.data.strptr[rows]; if( !const2 ) sptr2 = that2->value.data.strptr[rows]; switch( this->operation ) { case NE: this->value.data.logptr[rows] = !bitcmp( sptr1, sptr2 ); break; case EQ: this->value.data.logptr[rows] = bitcmp( sptr1, sptr2 ); break; case GT: case LT: case LTE: case GTE: this->value.data.logptr[rows] = bitlgte( sptr1, this->operation, sptr2 ); break; } this->value.undef[rows] = 0; } break; /* BITSTR AND/ORs ... no UNDEFS in or out */ case '|': case '&': case '+': while( rows-- ) { if( !const1 ) sptr1 = that1->value.data.strptr[rows]; if( !const2 ) sptr2 = that2->value.data.strptr[rows]; if( this->operation=='|' ) bitor( this->value.data.strptr[rows], sptr1, sptr2 ); else if( this->operation=='&' ) bitand( this->value.data.strptr[rows], sptr1, sptr2 ); else { strcpy( this->value.data.strptr[rows], sptr1 ); strcat( this->value.data.strptr[rows], sptr2 ); } } break; /* Accumulate 1 bits */ case ACCUM: { long i, previous, curr; previous = that2->value.data.lng; /* Cumulative sum of this chunk */ for (i=0; ivalue.data.strptr[i]; for (curr = 0; *sptr1; sptr1 ++) { if ( *sptr1 == '1' ) curr ++; } previous += curr; this->value.data.lngptr[i] = previous; this->value.undef[i] = 0; } /* Store final cumulant for next pass */ that2->value.data.lng = previous; } } } } if( that1->operation>0 ) { free( that1->value.data.strptr[0] ); free( that1->value.data.strptr ); } if( that2->operation>0 ) { free( that2->value.data.strptr[0] ); free( that2->value.data.strptr ); } } static void Do_BinOp_str( Node *this ) { Node *that1, *that2; char *sptr1, *sptr2, null1=0, null2=0; int const1, const2, val; long rows; that1 = gParse.Nodes + this->SubNodes[0]; that2 = gParse.Nodes + this->SubNodes[1]; const1 = ( that1->operation==CONST_OP ); const2 = ( that2->operation==CONST_OP ); sptr1 = ( const1 ? that1->value.data.str : NULL ); sptr2 = ( const2 ? that2->value.data.str : NULL ); if( const1 && const2 ) { /* Result is a constant */ switch( this->operation ) { /* Compare Strings */ case NE: case EQ: val = ( FSTRCMP( sptr1, sptr2 ) == 0 ); this->value.data.log = ( this->operation==EQ ? val : !val ); break; case GT: this->value.data.log = ( FSTRCMP( sptr1, sptr2 ) > 0 ); break; case LT: this->value.data.log = ( FSTRCMP( sptr1, sptr2 ) < 0 ); break; case GTE: this->value.data.log = ( FSTRCMP( sptr1, sptr2 ) >= 0 ); break; case LTE: this->value.data.log = ( FSTRCMP( sptr1, sptr2 ) <= 0 ); break; /* Concat Strings */ case '+': strcpy( this->value.data.str, sptr1 ); strcat( this->value.data.str, sptr2 ); break; } this->operation = CONST_OP; } else { /* Not a constant */ Allocate_Ptrs( this ); if( !gParse.status ) { rows = gParse.nRows; switch( this->operation ) { /* Compare Strings */ case NE: case EQ: while( rows-- ) { if( !const1 ) null1 = that1->value.undef[rows]; if( !const2 ) null2 = that2->value.undef[rows]; this->value.undef[rows] = (null1 || null2); if( ! this->value.undef[rows] ) { if( !const1 ) sptr1 = that1->value.data.strptr[rows]; if( !const2 ) sptr2 = that2->value.data.strptr[rows]; val = ( FSTRCMP( sptr1, sptr2 ) == 0 ); this->value.data.logptr[rows] = ( this->operation==EQ ? val : !val ); } } break; case GT: case LT: while( rows-- ) { if( !const1 ) null1 = that1->value.undef[rows]; if( !const2 ) null2 = that2->value.undef[rows]; this->value.undef[rows] = (null1 || null2); if( ! this->value.undef[rows] ) { if( !const1 ) sptr1 = that1->value.data.strptr[rows]; if( !const2 ) sptr2 = that2->value.data.strptr[rows]; val = ( FSTRCMP( sptr1, sptr2 ) ); this->value.data.logptr[rows] = ( this->operation==GT ? val>0 : val<0 ); } } break; case GTE: case LTE: while( rows-- ) { if( !const1 ) null1 = that1->value.undef[rows]; if( !const2 ) null2 = that2->value.undef[rows]; this->value.undef[rows] = (null1 || null2); if( ! this->value.undef[rows] ) { if( !const1 ) sptr1 = that1->value.data.strptr[rows]; if( !const2 ) sptr2 = that2->value.data.strptr[rows]; val = ( FSTRCMP( sptr1, sptr2 ) ); this->value.data.logptr[rows] = ( this->operation==GTE ? val>=0 : val<=0 ); } } break; /* Concat Strings */ case '+': while( rows-- ) { if( !const1 ) null1 = that1->value.undef[rows]; if( !const2 ) null2 = that2->value.undef[rows]; this->value.undef[rows] = (null1 || null2); if( ! this->value.undef[rows] ) { if( !const1 ) sptr1 = that1->value.data.strptr[rows]; if( !const2 ) sptr2 = that2->value.data.strptr[rows]; strcpy( this->value.data.strptr[rows], sptr1 ); strcat( this->value.data.strptr[rows], sptr2 ); } } break; } } } if( that1->operation>0 ) { free( that1->value.data.strptr[0] ); free( that1->value.data.strptr ); } if( that2->operation>0 ) { free( that2->value.data.strptr[0] ); free( that2->value.data.strptr ); } } static void Do_BinOp_log( Node *this ) { Node *that1, *that2; int vector1, vector2; char val1=0, val2=0, null1=0, null2=0; long rows, nelem, elem; that1 = gParse.Nodes + this->SubNodes[0]; that2 = gParse.Nodes + this->SubNodes[1]; vector1 = ( that1->operation!=CONST_OP ); if( vector1 ) vector1 = that1->value.nelem; else { val1 = that1->value.data.log; } vector2 = ( that2->operation!=CONST_OP ); if( vector2 ) vector2 = that2->value.nelem; else { val2 = that2->value.data.log; } if( !vector1 && !vector2 ) { /* Result is a constant */ switch( this->operation ) { case OR: this->value.data.log = (val1 || val2); break; case AND: this->value.data.log = (val1 && val2); break; case EQ: this->value.data.log = ( (val1 && val2) || (!val1 && !val2) ); break; case NE: this->value.data.log = ( (val1 && !val2) || (!val1 && val2) ); break; case ACCUM: this->value.data.lng = val1; break; } this->operation=CONST_OP; } else if (this->operation == ACCUM) { long i, previous, curr; rows = gParse.nRows; nelem = this->value.nelem; elem = this->value.nelem * rows; Allocate_Ptrs( this ); if( !gParse.status ) { previous = that2->value.data.lng; /* Cumulative sum of this chunk */ for (i=0; ivalue.undef[i]) { curr = that1->value.data.logptr[i]; previous += curr; } this->value.data.lngptr[i] = previous; this->value.undef[i] = 0; } /* Store final cumulant for next pass */ that2->value.data.lng = previous; } } else { rows = gParse.nRows; nelem = this->value.nelem; elem = this->value.nelem * rows; Allocate_Ptrs( this ); if( !gParse.status ) { if (this->operation == ACCUM) { long i, previous, curr; previous = that2->value.data.lng; /* Cumulative sum of this chunk */ for (i=0; ivalue.undef[i]) { curr = that1->value.data.logptr[i]; previous += curr; } this->value.data.lngptr[i] = previous; this->value.undef[i] = 0; } /* Store final cumulant for next pass */ that2->value.data.lng = previous; } while( rows-- ) { while( nelem-- ) { elem--; if( vector1>1 ) { val1 = that1->value.data.logptr[elem]; null1 = that1->value.undef[elem]; } else if( vector1 ) { val1 = that1->value.data.logptr[rows]; null1 = that1->value.undef[rows]; } if( vector2>1 ) { val2 = that2->value.data.logptr[elem]; null2 = that2->value.undef[elem]; } else if( vector2 ) { val2 = that2->value.data.logptr[rows]; null2 = that2->value.undef[rows]; } this->value.undef[elem] = (null1 || null2); switch( this->operation ) { case OR: /* This is more complicated than others to suppress UNDEFs */ /* in those cases where the other argument is DEF && TRUE */ if( !null1 && !null2 ) { this->value.data.logptr[elem] = (val1 || val2); } else if( (null1 && !null2 && val2) || ( !null1 && null2 && val1 ) ) { this->value.data.logptr[elem] = 1; this->value.undef[elem] = 0; } break; case AND: /* This is more complicated than others to suppress UNDEFs */ /* in those cases where the other argument is DEF && FALSE */ if( !null1 && !null2 ) { this->value.data.logptr[elem] = (val1 && val2); } else if( (null1 && !null2 && !val2) || ( !null1 && null2 && !val1 ) ) { this->value.data.logptr[elem] = 0; this->value.undef[elem] = 0; } break; case EQ: this->value.data.logptr[elem] = ( (val1 && val2) || (!val1 && !val2) ); break; case NE: this->value.data.logptr[elem] = ( (val1 && !val2) || (!val1 && val2) ); break; } } nelem = this->value.nelem; } } } if( that1->operation>0 ) { free( that1->value.data.ptr ); } if( that2->operation>0 ) { free( that2->value.data.ptr ); } } static void Do_BinOp_lng( Node *this ) { Node *that1, *that2; int vector1, vector2; long val1=0, val2=0; char null1=0, null2=0; long rows, nelem, elem; that1 = gParse.Nodes + this->SubNodes[0]; that2 = gParse.Nodes + this->SubNodes[1]; vector1 = ( that1->operation!=CONST_OP ); if( vector1 ) vector1 = that1->value.nelem; else { val1 = that1->value.data.lng; } vector2 = ( that2->operation!=CONST_OP ); if( vector2 ) vector2 = that2->value.nelem; else { val2 = that2->value.data.lng; } if( !vector1 && !vector2 ) { /* Result is a constant */ switch( this->operation ) { case '~': /* Treat as == for LONGS */ case EQ: this->value.data.log = (val1 == val2); break; case NE: this->value.data.log = (val1 != val2); break; case GT: this->value.data.log = (val1 > val2); break; case LT: this->value.data.log = (val1 < val2); break; case LTE: this->value.data.log = (val1 <= val2); break; case GTE: this->value.data.log = (val1 >= val2); break; case '+': this->value.data.lng = (val1 + val2); break; case '-': this->value.data.lng = (val1 - val2); break; case '*': this->value.data.lng = (val1 * val2); break; case '%': if( val2 ) this->value.data.lng = (val1 % val2); else yyerror("Divide by Zero"); break; case '/': if( val2 ) this->value.data.lng = (val1 / val2); else yyerror("Divide by Zero"); break; case POWER: this->value.data.lng = (long)pow((double)val1,(double)val2); break; case ACCUM: this->value.data.lng = val1; break; case DIFF: this->value.data.lng = 0; break; } this->operation=CONST_OP; } else if ((this->operation == ACCUM) || (this->operation == DIFF)) { long i, previous, curr; long undef; rows = gParse.nRows; nelem = this->value.nelem; elem = this->value.nelem * rows; Allocate_Ptrs( this ); if( !gParse.status ) { previous = that2->value.data.lng; undef = (long) that2->value.undef; if (this->operation == ACCUM) { /* Cumulative sum of this chunk */ for (i=0; ivalue.undef[i]) { curr = that1->value.data.lngptr[i]; previous += curr; } this->value.data.lngptr[i] = previous; this->value.undef[i] = 0; } } else { /* Sequential difference for this chunk */ for (i=0; ivalue.data.lngptr[i]; if (that1->value.undef[i] || undef) { /* Either this, or previous, value was undefined */ this->value.data.lngptr[i] = 0; this->value.undef[i] = 1; } else { /* Both defined, we are okay! */ this->value.data.lngptr[i] = curr - previous; this->value.undef[i] = 0; } previous = curr; undef = that1->value.undef[i]; } } /* Store final cumulant for next pass */ that2->value.data.lng = previous; that2->value.undef = (char *) undef; /* XXX evil, but no harm here */ } } else { rows = gParse.nRows; nelem = this->value.nelem; elem = this->value.nelem * rows; Allocate_Ptrs( this ); while( rows-- && !gParse.status ) { while( nelem-- && !gParse.status ) { elem--; if( vector1>1 ) { val1 = that1->value.data.lngptr[elem]; null1 = that1->value.undef[elem]; } else if( vector1 ) { val1 = that1->value.data.lngptr[rows]; null1 = that1->value.undef[rows]; } if( vector2>1 ) { val2 = that2->value.data.lngptr[elem]; null2 = that2->value.undef[elem]; } else if( vector2 ) { val2 = that2->value.data.lngptr[rows]; null2 = that2->value.undef[rows]; } this->value.undef[elem] = (null1 || null2); switch( this->operation ) { case '~': /* Treat as == for LONGS */ case EQ: this->value.data.logptr[elem] = (val1 == val2); break; case NE: this->value.data.logptr[elem] = (val1 != val2); break; case GT: this->value.data.logptr[elem] = (val1 > val2); break; case LT: this->value.data.logptr[elem] = (val1 < val2); break; case LTE: this->value.data.logptr[elem] = (val1 <= val2); break; case GTE: this->value.data.logptr[elem] = (val1 >= val2); break; case '+': this->value.data.lngptr[elem] = (val1 + val2); break; case '-': this->value.data.lngptr[elem] = (val1 - val2); break; case '*': this->value.data.lngptr[elem] = (val1 * val2); break; case '%': if( val2 ) this->value.data.lngptr[elem] = (val1 % val2); else { this->value.data.lngptr[elem] = 0; this->value.undef[elem] = 1; } break; case '/': if( val2 ) this->value.data.lngptr[elem] = (val1 / val2); else { this->value.data.lngptr[elem] = 0; this->value.undef[elem] = 1; } break; case POWER: this->value.data.lngptr[elem] = (long)pow((double)val1,(double)val2); break; } } nelem = this->value.nelem; } } if( that1->operation>0 ) { free( that1->value.data.ptr ); } if( that2->operation>0 ) { free( that2->value.data.ptr ); } } static void Do_BinOp_dbl( Node *this ) { Node *that1, *that2; int vector1, vector2; double val1=0.0, val2=0.0; char null1=0, null2=0; long rows, nelem, elem; that1 = gParse.Nodes + this->SubNodes[0]; that2 = gParse.Nodes + this->SubNodes[1]; vector1 = ( that1->operation!=CONST_OP ); if( vector1 ) vector1 = that1->value.nelem; else { val1 = that1->value.data.dbl; } vector2 = ( that2->operation!=CONST_OP ); if( vector2 ) vector2 = that2->value.nelem; else { val2 = that2->value.data.dbl; } if( !vector1 && !vector2 ) { /* Result is a constant */ switch( this->operation ) { case '~': this->value.data.log = ( fabs(val1-val2) < APPROX ); break; case EQ: this->value.data.log = (val1 == val2); break; case NE: this->value.data.log = (val1 != val2); break; case GT: this->value.data.log = (val1 > val2); break; case LT: this->value.data.log = (val1 < val2); break; case LTE: this->value.data.log = (val1 <= val2); break; case GTE: this->value.data.log = (val1 >= val2); break; case '+': this->value.data.dbl = (val1 + val2); break; case '-': this->value.data.dbl = (val1 - val2); break; case '*': this->value.data.dbl = (val1 * val2); break; case '%': if( val2 ) this->value.data.dbl = val1 - val2*((int)(val1/val2)); else yyerror("Divide by Zero"); break; case '/': if( val2 ) this->value.data.dbl = (val1 / val2); else yyerror("Divide by Zero"); break; case POWER: this->value.data.dbl = (double)pow(val1,val2); break; case ACCUM: this->value.data.dbl = val1; break; case DIFF: this->value.data.dbl = 0; break; } this->operation=CONST_OP; } else if ((this->operation == ACCUM) || (this->operation == DIFF)) { long i; long undef; double previous, curr; rows = gParse.nRows; nelem = this->value.nelem; elem = this->value.nelem * rows; Allocate_Ptrs( this ); if( !gParse.status ) { previous = that2->value.data.dbl; undef = (long) that2->value.undef; if (this->operation == ACCUM) { /* Cumulative sum of this chunk */ for (i=0; ivalue.undef[i]) { curr = that1->value.data.dblptr[i]; previous += curr; } this->value.data.dblptr[i] = previous; this->value.undef[i] = 0; } } else { /* Sequential difference for this chunk */ for (i=0; ivalue.data.dblptr[i]; if (that1->value.undef[i] || undef) { /* Either this, or previous, value was undefined */ this->value.data.dblptr[i] = 0; this->value.undef[i] = 1; } else { /* Both defined, we are okay! */ this->value.data.dblptr[i] = curr - previous; this->value.undef[i] = 0; } previous = curr; undef = that1->value.undef[i]; } } /* Store final cumulant for next pass */ that2->value.data.dbl = previous; that2->value.undef = (char *) undef; /* XXX evil, but no harm here */ } } else { rows = gParse.nRows; nelem = this->value.nelem; elem = this->value.nelem * rows; Allocate_Ptrs( this ); while( rows-- && !gParse.status ) { while( nelem-- && !gParse.status ) { elem--; if( vector1>1 ) { val1 = that1->value.data.dblptr[elem]; null1 = that1->value.undef[elem]; } else if( vector1 ) { val1 = that1->value.data.dblptr[rows]; null1 = that1->value.undef[rows]; } if( vector2>1 ) { val2 = that2->value.data.dblptr[elem]; null2 = that2->value.undef[elem]; } else if( vector2 ) { val2 = that2->value.data.dblptr[rows]; null2 = that2->value.undef[rows]; } this->value.undef[elem] = (null1 || null2); switch( this->operation ) { case '~': this->value.data.logptr[elem] = ( fabs(val1-val2) < APPROX ); break; case EQ: this->value.data.logptr[elem] = (val1 == val2); break; case NE: this->value.data.logptr[elem] = (val1 != val2); break; case GT: this->value.data.logptr[elem] = (val1 > val2); break; case LT: this->value.data.logptr[elem] = (val1 < val2); break; case LTE: this->value.data.logptr[elem] = (val1 <= val2); break; case GTE: this->value.data.logptr[elem] = (val1 >= val2); break; case '+': this->value.data.dblptr[elem] = (val1 + val2); break; case '-': this->value.data.dblptr[elem] = (val1 - val2); break; case '*': this->value.data.dblptr[elem] = (val1 * val2); break; case '%': if( val2 ) this->value.data.dblptr[elem] = val1 - val2*((int)(val1/val2)); else { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } break; case '/': if( val2 ) this->value.data.dblptr[elem] = (val1 / val2); else { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } break; case POWER: this->value.data.dblptr[elem] = (double)pow(val1,val2); break; } } nelem = this->value.nelem; } } if( that1->operation>0 ) { free( that1->value.data.ptr ); } if( that2->operation>0 ) { free( that2->value.data.ptr ); } } /* * This Quickselect routine is based on the algorithm described in * "Numerical recipes in C", Second Edition, * Cambridge University Press, 1992, Section 8.5, ISBN 0-521-43108-5 * This code by Nicolas Devillard - 1998. Public domain. * http://ndevilla.free.fr/median/median/src/quickselect.c */ #define ELEM_SWAP(a,b) { register long t=(a);(a)=(b);(b)=t; } /* * qselect_median_lng - select the median value of a long array * * This routine selects the median value of the long integer array * arr[]. If there are an even number of elements, the "lower median" * is selected. * * The array arr[] is scrambled, so users must operate on a scratch * array if they wish the values to be preserved. * * long arr[] - array of values * int n - number of elements in arr * * RETURNS: the lower median value of arr[] * */ long qselect_median_lng(long arr[], int n) { int low, high ; int median; int middle, ll, hh; low = 0 ; high = n-1 ; median = (low + high) / 2; for (;;) { if (high <= low) { /* One element only */ return arr[median]; } if (high == low + 1) { /* Two elements only */ if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]) ; return arr[median]; } /* Find median of low, middle and high items; swap into position low */ middle = (low + high) / 2; if (arr[middle] > arr[high]) ELEM_SWAP(arr[middle], arr[high]) ; if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]) ; if (arr[middle] > arr[low]) ELEM_SWAP(arr[middle], arr[low]) ; /* Swap low item (now in position middle) into position (low+1) */ ELEM_SWAP(arr[middle], arr[low+1]) ; /* Nibble from each end towards middle, swapping items when stuck */ ll = low + 1; hh = high; for (;;) { do ll++; while (arr[low] > arr[ll]) ; do hh--; while (arr[hh] > arr[low]) ; if (hh < ll) break; ELEM_SWAP(arr[ll], arr[hh]) ; } /* Swap middle item (in position low) back into correct position */ ELEM_SWAP(arr[low], arr[hh]) ; /* Re-set active partition */ if (hh <= median) low = ll; if (hh >= median) high = hh - 1; } } #undef ELEM_SWAP #define ELEM_SWAP(a,b) { register double t=(a);(a)=(b);(b)=t; } /* * qselect_median_dbl - select the median value of a double array * * This routine selects the median value of the double array * arr[]. If there are an even number of elements, the "lower median" * is selected. * * The array arr[] is scrambled, so users must operate on a scratch * array if they wish the values to be preserved. * * double arr[] - array of values * int n - number of elements in arr * * RETURNS: the lower median value of arr[] * */ double qselect_median_dbl(double arr[], int n) { int low, high ; int median; int middle, ll, hh; low = 0 ; high = n-1 ; median = (low + high) / 2; for (;;) { if (high <= low) { /* One element only */ return arr[median] ; } if (high == low + 1) { /* Two elements only */ if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]) ; return arr[median] ; } /* Find median of low, middle and high items; swap into position low */ middle = (low + high) / 2; if (arr[middle] > arr[high]) ELEM_SWAP(arr[middle], arr[high]) ; if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]) ; if (arr[middle] > arr[low]) ELEM_SWAP(arr[middle], arr[low]) ; /* Swap low item (now in position middle) into position (low+1) */ ELEM_SWAP(arr[middle], arr[low+1]) ; /* Nibble from each end towards middle, swapping items when stuck */ ll = low + 1; hh = high; for (;;) { do ll++; while (arr[low] > arr[ll]) ; do hh--; while (arr[hh] > arr[low]) ; if (hh < ll) break; ELEM_SWAP(arr[ll], arr[hh]) ; } /* Swap middle item (in position low) back into correct position */ ELEM_SWAP(arr[low], arr[hh]) ; /* Re-set active partition */ if (hh <= median) low = ll; if (hh >= median) high = hh - 1; } } #undef ELEM_SWAP /* * angsep_calc - compute angular separation between celestial coordinates * * This routine computes the angular separation between to coordinates * on the celestial sphere (i.e. RA and Dec). Note that all units are * in DEGREES, unlike the other trig functions in the calculator. * * double ra1, dec1 - RA and Dec of the first position in degrees * double ra2, dec2 - RA and Dec of the second position in degrees * * RETURNS: (double) angular separation in degrees * */ double angsep_calc(double ra1, double dec1, double ra2, double dec2) { /* double cd; */ static double deg = 0; double a, sdec, sra; if (deg == 0) deg = ((double)4)*atan((double)1)/((double)180); /* deg = 1.0; **** UNCOMMENT IF YOU WANT RADIANS */ /* The algorithm is the law of Haversines. This algorithm is stable even when the points are close together. The normal Law of Cosines fails for angles around 0.1 arcsec. */ sra = sin( (ra2 - ra1)*deg / 2 ); sdec = sin( (dec2 - dec1)*deg / 2); a = sdec*sdec + cos(dec1*deg)*cos(dec2*deg)*sra*sra; /* Sanity checking to avoid a range error in the sqrt()'s below */ if (a < 0) { a = 0; } if (a > 1) { a = 1; } return 2.0*atan2(sqrt(a), sqrt(1.0 - a)) / deg; } static void Do_Func( Node *this ) { Node *theParams[MAXSUBS]; int vector[MAXSUBS], allConst; lval pVals[MAXSUBS]; char pNull[MAXSUBS]; long ival; double dval; int i, valInit; long row, elem, nelem; i = this->nSubNodes; allConst = 1; while( i-- ) { theParams[i] = gParse.Nodes + this->SubNodes[i]; vector[i] = ( theParams[i]->operation!=CONST_OP ); if( vector[i] ) { allConst = 0; vector[i] = theParams[i]->value.nelem; } else { if( theParams[i]->type==DOUBLE ) { pVals[i].data.dbl = theParams[i]->value.data.dbl; } else if( theParams[i]->type==LONG ) { pVals[i].data.lng = theParams[i]->value.data.lng; } else if( theParams[i]->type==BOOLEAN ) { pVals[i].data.log = theParams[i]->value.data.log; } else strcpy(pVals[i].data.str, theParams[i]->value.data.str); pNull[i] = 0; } } if( this->nSubNodes==0 ) allConst = 0; /* These do produce scalars */ /* Random numbers are *never* constant !! */ if( this->operation == poirnd_fct ) allConst = 0; if( this->operation == gasrnd_fct ) allConst = 0; if( this->operation == rnd_fct ) allConst = 0; if( allConst ) { switch( this->operation ) { /* Non-Trig single-argument functions */ case sum_fct: if( theParams[0]->type==BOOLEAN ) this->value.data.lng = ( pVals[0].data.log ? 1 : 0 ); else if( theParams[0]->type==LONG ) this->value.data.lng = pVals[0].data.lng; else if( theParams[0]->type==DOUBLE ) this->value.data.dbl = pVals[0].data.dbl; else if( theParams[0]->type==BITSTR ) strcpy(this->value.data.str, pVals[0].data.str); break; case average_fct: if( theParams[0]->type==LONG ) this->value.data.dbl = pVals[0].data.lng; else if( theParams[0]->type==DOUBLE ) this->value.data.dbl = pVals[0].data.dbl; break; case stddev_fct: this->value.data.dbl = 0; /* Standard deviation of a constant = 0 */ break; case median_fct: if( theParams[0]->type==BOOLEAN ) this->value.data.lng = ( pVals[0].data.log ? 1 : 0 ); else if( theParams[0]->type==LONG ) this->value.data.lng = pVals[0].data.lng; else this->value.data.dbl = pVals[0].data.dbl; break; case poirnd_fct: if( theParams[0]->type==DOUBLE ) this->value.data.lng = simplerng_getpoisson(pVals[0].data.dbl); else this->value.data.lng = simplerng_getpoisson(pVals[0].data.lng); break; case abs_fct: if( theParams[0]->type==DOUBLE ) { dval = pVals[0].data.dbl; this->value.data.dbl = (dval>0.0 ? dval : -dval); } else { ival = pVals[0].data.lng; this->value.data.lng = (ival> 0 ? ival : -ival); } break; /* Special Null-Handling Functions */ case nonnull_fct: this->value.data.lng = 1; /* Constants are always 1-element and defined */ break; case isnull_fct: /* Constants are always defined */ this->value.data.log = 0; break; case defnull_fct: if( this->type==BOOLEAN ) this->value.data.log = pVals[0].data.log; else if( this->type==LONG ) this->value.data.lng = pVals[0].data.lng; else if( this->type==DOUBLE ) this->value.data.dbl = pVals[0].data.dbl; else if( this->type==STRING ) strcpy(this->value.data.str,pVals[0].data.str); break; /* Math functions with 1 double argument */ case sin_fct: this->value.data.dbl = sin( pVals[0].data.dbl ); break; case cos_fct: this->value.data.dbl = cos( pVals[0].data.dbl ); break; case tan_fct: this->value.data.dbl = tan( pVals[0].data.dbl ); break; case asin_fct: dval = pVals[0].data.dbl; if( dval<-1.0 || dval>1.0 ) yyerror("Out of range argument to arcsin"); else this->value.data.dbl = asin( dval ); break; case acos_fct: dval = pVals[0].data.dbl; if( dval<-1.0 || dval>1.0 ) yyerror("Out of range argument to arccos"); else this->value.data.dbl = acos( dval ); break; case atan_fct: this->value.data.dbl = atan( pVals[0].data.dbl ); break; case sinh_fct: this->value.data.dbl = sinh( pVals[0].data.dbl ); break; case cosh_fct: this->value.data.dbl = cosh( pVals[0].data.dbl ); break; case tanh_fct: this->value.data.dbl = tanh( pVals[0].data.dbl ); break; case exp_fct: this->value.data.dbl = exp( pVals[0].data.dbl ); break; case log_fct: dval = pVals[0].data.dbl; if( dval<=0.0 ) yyerror("Out of range argument to log"); else this->value.data.dbl = log( dval ); break; case log10_fct: dval = pVals[0].data.dbl; if( dval<=0.0 ) yyerror("Out of range argument to log10"); else this->value.data.dbl = log10( dval ); break; case sqrt_fct: dval = pVals[0].data.dbl; if( dval<0.0 ) yyerror("Out of range argument to sqrt"); else this->value.data.dbl = sqrt( dval ); break; case ceil_fct: this->value.data.dbl = ceil( pVals[0].data.dbl ); break; case floor_fct: this->value.data.dbl = floor( pVals[0].data.dbl ); break; case round_fct: this->value.data.dbl = floor( pVals[0].data.dbl + 0.5 ); break; /* Two-argument Trig Functions */ case atan2_fct: this->value.data.dbl = atan2( pVals[0].data.dbl, pVals[1].data.dbl ); break; /* Four-argument ANGSEP function */ case angsep_fct: this->value.data.dbl = angsep_calc(pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl); /* Min/Max functions taking 1 or 2 arguments */ case min1_fct: /* No constant vectors! */ if( this->type == DOUBLE ) this->value.data.dbl = pVals[0].data.dbl; else if( this->type == LONG ) this->value.data.lng = pVals[0].data.lng; else if( this->type == BITSTR ) strcpy(this->value.data.str, pVals[0].data.str); break; case min2_fct: if( this->type == DOUBLE ) this->value.data.dbl = minvalue( pVals[0].data.dbl, pVals[1].data.dbl ); else if( this->type == LONG ) this->value.data.lng = minvalue( pVals[0].data.lng, pVals[1].data.lng ); break; case max1_fct: /* No constant vectors! */ if( this->type == DOUBLE ) this->value.data.dbl = pVals[0].data.dbl; else if( this->type == LONG ) this->value.data.lng = pVals[0].data.lng; else if( this->type == BITSTR ) strcpy(this->value.data.str, pVals[0].data.str); break; case max2_fct: if( this->type == DOUBLE ) this->value.data.dbl = maxvalue( pVals[0].data.dbl, pVals[1].data.dbl ); else if( this->type == LONG ) this->value.data.lng = maxvalue( pVals[0].data.lng, pVals[1].data.lng ); break; /* Boolean SAO region Functions... scalar or vector dbls */ case near_fct: this->value.data.log = bnear( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl ); break; case circle_fct: this->value.data.log = circle( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl, pVals[4].data.dbl ); break; case box_fct: this->value.data.log = saobox( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl, pVals[4].data.dbl, pVals[5].data.dbl, pVals[6].data.dbl ); break; case elps_fct: this->value.data.log = ellipse( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl, pVals[4].data.dbl, pVals[5].data.dbl, pVals[6].data.dbl ); break; /* C Conditional expression: bool ? expr : expr */ case ifthenelse_fct: switch( this->type ) { case BOOLEAN: this->value.data.log = ( pVals[2].data.log ? pVals[0].data.log : pVals[1].data.log ); break; case LONG: this->value.data.lng = ( pVals[2].data.log ? pVals[0].data.lng : pVals[1].data.lng ); break; case DOUBLE: this->value.data.dbl = ( pVals[2].data.log ? pVals[0].data.dbl : pVals[1].data.dbl ); break; case STRING: strcpy(this->value.data.str, ( pVals[2].data.log ? pVals[0].data.str : pVals[1].data.str ) ); break; } break; /* String functions */ case strmid_fct: cstrmid(this->value.data.str, this->value.nelem, pVals[0].data.str, pVals[0].nelem, pVals[1].data.lng); break; case strpos_fct: { char *res = strstr(pVals[0].data.str, pVals[1].data.str); if (res == NULL) { this->value.data.lng = 0; } else { this->value.data.lng = (res - pVals[0].data.str) + 1; } break; } } this->operation = CONST_OP; } else { Allocate_Ptrs( this ); row = gParse.nRows; elem = row * this->value.nelem; if( !gParse.status ) { switch( this->operation ) { /* Special functions with no arguments */ case row_fct: while( row-- ) { this->value.data.lngptr[row] = gParse.firstRow + row; this->value.undef[row] = 0; } break; case null_fct: if( this->type==LONG ) { while( row-- ) { this->value.data.lngptr[row] = 0; this->value.undef[row] = 1; } } else if( this->type==STRING ) { while( row-- ) { this->value.data.strptr[row][0] = '\0'; this->value.undef[row] = 1; } } break; case rnd_fct: while( elem-- ) { this->value.data.dblptr[elem] = simplerng_getuniform(); this->value.undef[elem] = 0; } break; case gasrnd_fct: while( elem-- ) { this->value.data.dblptr[elem] = simplerng_getnorm(); this->value.undef[elem] = 0; } break; case poirnd_fct: if( theParams[0]->type==DOUBLE ) { if (theParams[0]->operation == CONST_OP) { while( elem-- ) { this->value.undef[elem] = (pVals[0].data.dbl < 0); if (! this->value.undef[elem]) { this->value.data.lngptr[elem] = simplerng_getpoisson(pVals[0].data.dbl); } } } else { while( elem-- ) { this->value.undef[elem] = theParams[0]->value.undef[elem]; if (theParams[0]->value.data.dblptr[elem] < 0) this->value.undef[elem] = 1; if (! this->value.undef[elem]) { this->value.data.lngptr[elem] = simplerng_getpoisson(theParams[0]->value.data.dblptr[elem]); } } /* while */ } /* ! CONST_OP */ } else { /* LONG */ if (theParams[0]->operation == CONST_OP) { while( elem-- ) { this->value.undef[elem] = (pVals[0].data.lng < 0); if (! this->value.undef[elem]) { this->value.data.lngptr[elem] = simplerng_getpoisson(pVals[0].data.lng); } } } else { while( elem-- ) { this->value.undef[elem] = theParams[0]->value.undef[elem]; if (theParams[0]->value.data.lngptr[elem] < 0) this->value.undef[elem] = 1; if (! this->value.undef[elem]) { this->value.data.lngptr[elem] = simplerng_getpoisson(theParams[0]->value.data.lngptr[elem]); } } /* while */ } /* ! CONST_OP */ } /* END LONG */ break; /* Non-Trig single-argument functions */ case sum_fct: elem = row * theParams[0]->value.nelem; if( theParams[0]->type==BOOLEAN ) { while( row-- ) { this->value.data.lngptr[row] = 0; /* Default is UNDEF until a defined value is found */ this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( ! theParams[0]->value.undef[elem] ) { this->value.data.lngptr[row] += ( theParams[0]->value.data.logptr[elem] ? 1 : 0 ); this->value.undef[row] = 0; } } } } else if( theParams[0]->type==LONG ) { while( row-- ) { this->value.data.lngptr[row] = 0; /* Default is UNDEF until a defined value is found */ this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( ! theParams[0]->value.undef[elem] ) { this->value.data.lngptr[row] += theParams[0]->value.data.lngptr[elem]; this->value.undef[row] = 0; } } } } else if( theParams[0]->type==DOUBLE ){ while( row-- ) { this->value.data.dblptr[row] = 0.0; /* Default is UNDEF until a defined value is found */ this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( ! theParams[0]->value.undef[elem] ) { this->value.data.dblptr[row] += theParams[0]->value.data.dblptr[elem]; this->value.undef[row] = 0; } } } } else { /* BITSTR */ nelem = theParams[0]->value.nelem; while( row-- ) { char *sptr1 = theParams[0]->value.data.strptr[row]; this->value.data.lngptr[row] = 0; this->value.undef[row] = 0; while (*sptr1) { if (*sptr1 == '1') this->value.data.lngptr[row] ++; sptr1++; } } } break; case average_fct: elem = row * theParams[0]->value.nelem; if( theParams[0]->type==LONG ) { while( row-- ) { int count = 0; this->value.data.dblptr[row] = 0; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if (theParams[0]->value.undef[elem] == 0) { this->value.data.dblptr[row] += theParams[0]->value.data.lngptr[elem]; count ++; } } if (count == 0) { this->value.undef[row] = 1; } else { this->value.undef[row] = 0; this->value.data.dblptr[row] /= count; } } } else if( theParams[0]->type==DOUBLE ){ while( row-- ) { int count = 0; this->value.data.dblptr[row] = 0; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if (theParams[0]->value.undef[elem] == 0) { this->value.data.dblptr[row] += theParams[0]->value.data.dblptr[elem]; count ++; } } if (count == 0) { this->value.undef[row] = 1; } else { this->value.undef[row] = 0; this->value.data.dblptr[row] /= count; } } } break; case stddev_fct: elem = row * theParams[0]->value.nelem; if( theParams[0]->type==LONG ) { /* Compute the mean value */ while( row-- ) { int count = 0; double sum = 0, sum2 = 0; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if (theParams[0]->value.undef[elem] == 0) { sum += theParams[0]->value.data.lngptr[elem]; count ++; } } if (count > 1) { sum /= count; /* Compute the sum of squared deviations */ nelem = theParams[0]->value.nelem; elem += nelem; /* Reset elem for second pass */ while( nelem-- ) { elem--; if (theParams[0]->value.undef[elem] == 0) { double dx = (theParams[0]->value.data.lngptr[elem] - sum); sum2 += (dx*dx); } } sum2 /= (double)count-1; this->value.undef[row] = 0; this->value.data.dblptr[row] = sqrt(sum2); } else { this->value.undef[row] = 0; /* STDDEV => 0 */ this->value.data.dblptr[row] = 0; } } } else if( theParams[0]->type==DOUBLE ){ /* Compute the mean value */ while( row-- ) { int count = 0; double sum = 0, sum2 = 0; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if (theParams[0]->value.undef[elem] == 0) { sum += theParams[0]->value.data.dblptr[elem]; count ++; } } if (count > 1) { sum /= count; /* Compute the sum of squared deviations */ nelem = theParams[0]->value.nelem; elem += nelem; /* Reset elem for second pass */ while( nelem-- ) { elem--; if (theParams[0]->value.undef[elem] == 0) { double dx = (theParams[0]->value.data.dblptr[elem] - sum); sum2 += (dx*dx); } } sum2 /= (double)count-1; this->value.undef[row] = 0; this->value.data.dblptr[row] = sqrt(sum2); } else { this->value.undef[row] = 0; /* STDDEV => 0 */ this->value.data.dblptr[row] = 0; } } } break; case median_fct: elem = row * theParams[0]->value.nelem; nelem = theParams[0]->value.nelem; if( theParams[0]->type==LONG ) { long *dptr = theParams[0]->value.data.lngptr; char *uptr = theParams[0]->value.undef; long *mptr = (long *) malloc(sizeof(long)*nelem); int irow; /* Allocate temporary storage for this row, since the quickselect function will scramble the contents */ if (mptr == 0) { yyerror("Could not allocate temporary memory in median function"); free( this->value.data.ptr ); break; } for (irow=0; irow 0) { this->value.undef[irow] = 0; this->value.data.lngptr[irow] = qselect_median_lng(mptr, nelem1); } else { this->value.undef[irow] = 1; this->value.data.lngptr[irow] = 0; } } free(mptr); } else { double *dptr = theParams[0]->value.data.dblptr; char *uptr = theParams[0]->value.undef; double *mptr = (double *) malloc(sizeof(double)*nelem); int irow; /* Allocate temporary storage for this row, since the quickselect function will scramble the contents */ if (mptr == 0) { yyerror("Could not allocate temporary memory in median function"); free( this->value.data.ptr ); break; } for (irow=0; irow 0) { this->value.undef[irow] = 0; this->value.data.dblptr[irow] = qselect_median_dbl(mptr, nelem1); } else { this->value.undef[irow] = 1; this->value.data.dblptr[irow] = 0; } } free(mptr); } break; case abs_fct: if( theParams[0]->type==DOUBLE ) while( elem-- ) { dval = theParams[0]->value.data.dblptr[elem]; this->value.data.dblptr[elem] = (dval>0.0 ? dval : -dval); this->value.undef[elem] = theParams[0]->value.undef[elem]; } else while( elem-- ) { ival = theParams[0]->value.data.lngptr[elem]; this->value.data.lngptr[elem] = (ival> 0 ? ival : -ival); this->value.undef[elem] = theParams[0]->value.undef[elem]; } break; /* Special Null-Handling Functions */ case nonnull_fct: nelem = theParams[0]->value.nelem; if ( theParams[0]->type==STRING ) nelem = 1; elem = row * nelem; while( row-- ) { int nelem1 = nelem; this->value.undef[row] = 0; /* Initialize to 0 (defined) */ this->value.data.lngptr[row] = 0; while( nelem1-- ) { elem --; if ( theParams[0]->value.undef[elem] == 0 ) this->value.data.lngptr[row] ++; } } break; case isnull_fct: if( theParams[0]->type==STRING ) elem = row; while( elem-- ) { this->value.data.logptr[elem] = theParams[0]->value.undef[elem]; this->value.undef[elem] = 0; } break; case defnull_fct: switch( this->type ) { case BOOLEAN: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pNull[i] = theParams[i]->value.undef[elem]; pVals[i].data.log = theParams[i]->value.data.logptr[elem]; } else if( vector[i] ) { pNull[i] = theParams[i]->value.undef[row]; pVals[i].data.log = theParams[i]->value.data.logptr[row]; } if( pNull[0] ) { this->value.undef[elem] = pNull[1]; this->value.data.logptr[elem] = pVals[1].data.log; } else { this->value.undef[elem] = 0; this->value.data.logptr[elem] = pVals[0].data.log; } } } break; case LONG: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pNull[i] = theParams[i]->value.undef[elem]; pVals[i].data.lng = theParams[i]->value.data.lngptr[elem]; } else if( vector[i] ) { pNull[i] = theParams[i]->value.undef[row]; pVals[i].data.lng = theParams[i]->value.data.lngptr[row]; } if( pNull[0] ) { this->value.undef[elem] = pNull[1]; this->value.data.lngptr[elem] = pVals[1].data.lng; } else { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = pVals[0].data.lng; } } } break; case DOUBLE: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pNull[i] = theParams[i]->value.undef[elem]; pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; } else if( vector[i] ) { pNull[i] = theParams[i]->value.undef[row]; pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; } if( pNull[0] ) { this->value.undef[elem] = pNull[1]; this->value.data.dblptr[elem] = pVals[1].data.dbl; } else { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = pVals[0].data.dbl; } } } break; case STRING: while( row-- ) { i=2; while( i-- ) if( vector[i] ) { pNull[i] = theParams[i]->value.undef[row]; strcpy(pVals[i].data.str, theParams[i]->value.data.strptr[row]); } if( pNull[0] ) { this->value.undef[row] = pNull[1]; strcpy(this->value.data.strptr[row],pVals[1].data.str); } else { this->value.undef[elem] = 0; strcpy(this->value.data.strptr[row],pVals[0].data.str); } } } break; /* Math functions with 1 double argument */ case sin_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = sin( theParams[0]->value.data.dblptr[elem] ); } break; case cos_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = cos( theParams[0]->value.data.dblptr[elem] ); } break; case tan_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = tan( theParams[0]->value.data.dblptr[elem] ); } break; case asin_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; if( dval<-1.0 || dval>1.0 ) { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } else this->value.data.dblptr[elem] = asin( dval ); } break; case acos_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; if( dval<-1.0 || dval>1.0 ) { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } else this->value.data.dblptr[elem] = acos( dval ); } break; case atan_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; this->value.data.dblptr[elem] = atan( dval ); } break; case sinh_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = sinh( theParams[0]->value.data.dblptr[elem] ); } break; case cosh_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = cosh( theParams[0]->value.data.dblptr[elem] ); } break; case tanh_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = tanh( theParams[0]->value.data.dblptr[elem] ); } break; case exp_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; this->value.data.dblptr[elem] = exp( dval ); } break; case log_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; if( dval<=0.0 ) { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } else this->value.data.dblptr[elem] = log( dval ); } break; case log10_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; if( dval<=0.0 ) { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } else this->value.data.dblptr[elem] = log10( dval ); } break; case sqrt_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; if( dval<0.0 ) { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } else this->value.data.dblptr[elem] = sqrt( dval ); } break; case ceil_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = ceil( theParams[0]->value.data.dblptr[elem] ); } break; case floor_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = floor( theParams[0]->value.data.dblptr[elem] ); } break; case round_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = floor( theParams[0]->value.data.dblptr[elem] + 0.5); } break; /* Two-argument Trig Functions */ case atan2_fct: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = (pNull[0] || pNull[1]) ) ) this->value.data.dblptr[elem] = atan2( pVals[0].data.dbl, pVals[1].data.dbl ); } } break; /* Four-argument ANGSEP Function */ case angsep_fct: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=4; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = (pNull[0] || pNull[1] || pNull[2] || pNull[3]) ) ) this->value.data.dblptr[elem] = angsep_calc(pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl); } } break; /* Min/Max functions taking 1 or 2 arguments */ case min1_fct: elem = row * theParams[0]->value.nelem; if( this->type==LONG ) { long minVal=0; while( row-- ) { valInit = 1; this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( !theParams[0]->value.undef[elem] ) { if ( valInit ) { valInit = 0; minVal = theParams[0]->value.data.lngptr[elem]; } else { minVal = minvalue( minVal, theParams[0]->value.data.lngptr[elem] ); } this->value.undef[row] = 0; } } this->value.data.lngptr[row] = minVal; } } else if( this->type==DOUBLE ) { double minVal=0.0; while( row-- ) { valInit = 1; this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( !theParams[0]->value.undef[elem] ) { if ( valInit ) { valInit = 0; minVal = theParams[0]->value.data.dblptr[elem]; } else { minVal = minvalue( minVal, theParams[0]->value.data.dblptr[elem] ); } this->value.undef[row] = 0; } } this->value.data.dblptr[row] = minVal; } } else if( this->type==BITSTR ) { char minVal; while( row-- ) { char *sptr1 = theParams[0]->value.data.strptr[row]; minVal = '1'; while (*sptr1) { if (*sptr1 == '0') minVal = '0'; sptr1++; } this->value.data.strptr[row][0] = minVal; this->value.data.strptr[row][1] = 0; /* Null terminate */ } } break; case min2_fct: if( this->type==LONG ) { while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.lng = theParams[i]->value.data.lngptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.lng = theParams[i]->value.data.lngptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( pNull[0] && pNull[1] ) { this->value.undef[elem] = 1; this->value.data.lngptr[elem] = 0; } else if (pNull[0]) { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = pVals[1].data.lng; } else if (pNull[1]) { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = pVals[0].data.lng; } else { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = minvalue( pVals[0].data.lng, pVals[1].data.lng ); } } } } else if( this->type==DOUBLE ) { while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( pNull[0] && pNull[1] ) { this->value.undef[elem] = 1; this->value.data.dblptr[elem] = 0; } else if (pNull[0]) { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = pVals[1].data.dbl; } else if (pNull[1]) { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = pVals[0].data.dbl; } else { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = minvalue( pVals[0].data.dbl, pVals[1].data.dbl ); } } } } break; case max1_fct: elem = row * theParams[0]->value.nelem; if( this->type==LONG ) { long maxVal=0; while( row-- ) { valInit = 1; this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( !theParams[0]->value.undef[elem] ) { if ( valInit ) { valInit = 0; maxVal = theParams[0]->value.data.lngptr[elem]; } else { maxVal = maxvalue( maxVal, theParams[0]->value.data.lngptr[elem] ); } this->value.undef[row] = 0; } } this->value.data.lngptr[row] = maxVal; } } else if( this->type==DOUBLE ) { double maxVal=0.0; while( row-- ) { valInit = 1; this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( !theParams[0]->value.undef[elem] ) { if ( valInit ) { valInit = 0; maxVal = theParams[0]->value.data.dblptr[elem]; } else { maxVal = maxvalue( maxVal, theParams[0]->value.data.dblptr[elem] ); } this->value.undef[row] = 0; } } this->value.data.dblptr[row] = maxVal; } } else if( this->type==BITSTR ) { char maxVal; while( row-- ) { char *sptr1 = theParams[0]->value.data.strptr[row]; maxVal = '0'; while (*sptr1) { if (*sptr1 == '1') maxVal = '1'; sptr1++; } this->value.data.strptr[row][0] = maxVal; this->value.data.strptr[row][1] = 0; /* Null terminate */ } } break; case max2_fct: if( this->type==LONG ) { while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.lng = theParams[i]->value.data.lngptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.lng = theParams[i]->value.data.lngptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( pNull[0] && pNull[1] ) { this->value.undef[elem] = 1; this->value.data.lngptr[elem] = 0; } else if (pNull[0]) { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = pVals[1].data.lng; } else if (pNull[1]) { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = pVals[0].data.lng; } else { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = maxvalue( pVals[0].data.lng, pVals[1].data.lng ); } } } } else if( this->type==DOUBLE ) { while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( pNull[0] && pNull[1] ) { this->value.undef[elem] = 1; this->value.data.dblptr[elem] = 0; } else if (pNull[0]) { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = pVals[1].data.dbl; } else if (pNull[1]) { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = pVals[0].data.dbl; } else { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = maxvalue( pVals[0].data.dbl, pVals[1].data.dbl ); } } } } break; /* Boolean SAO region Functions... scalar or vector dbls */ case near_fct: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=3; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = (pNull[0] || pNull[1] || pNull[2]) ) ) this->value.data.logptr[elem] = bnear( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl ); } } break; case circle_fct: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=5; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = (pNull[0] || pNull[1] || pNull[2] || pNull[3] || pNull[4]) ) ) this->value.data.logptr[elem] = circle( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl, pVals[4].data.dbl ); } } break; case box_fct: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=7; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = (pNull[0] || pNull[1] || pNull[2] || pNull[3] || pNull[4] || pNull[5] || pNull[6] ) ) ) this->value.data.logptr[elem] = saobox( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl, pVals[4].data.dbl, pVals[5].data.dbl, pVals[6].data.dbl ); } } break; case elps_fct: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=7; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = (pNull[0] || pNull[1] || pNull[2] || pNull[3] || pNull[4] || pNull[5] || pNull[6] ) ) ) this->value.data.logptr[elem] = ellipse( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl, pVals[4].data.dbl, pVals[5].data.dbl, pVals[6].data.dbl ); } } break; /* C Conditional expression: bool ? expr : expr */ case ifthenelse_fct: switch( this->type ) { case BOOLEAN: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; if( vector[2]>1 ) { pVals[2].data.log = theParams[2]->value.data.logptr[elem]; pNull[2] = theParams[2]->value.undef[elem]; } else if( vector[2] ) { pVals[2].data.log = theParams[2]->value.data.logptr[row]; pNull[2] = theParams[2]->value.undef[row]; } i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.log = theParams[i]->value.data.logptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.log = theParams[i]->value.data.logptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = pNull[2]) ) { if( pVals[2].data.log ) { this->value.data.logptr[elem] = pVals[0].data.log; this->value.undef[elem] = pNull[0]; } else { this->value.data.logptr[elem] = pVals[1].data.log; this->value.undef[elem] = pNull[1]; } } } } break; case LONG: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; if( vector[2]>1 ) { pVals[2].data.log = theParams[2]->value.data.logptr[elem]; pNull[2] = theParams[2]->value.undef[elem]; } else if( vector[2] ) { pVals[2].data.log = theParams[2]->value.data.logptr[row]; pNull[2] = theParams[2]->value.undef[row]; } i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.lng = theParams[i]->value.data.lngptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.lng = theParams[i]->value.data.lngptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = pNull[2]) ) { if( pVals[2].data.log ) { this->value.data.lngptr[elem] = pVals[0].data.lng; this->value.undef[elem] = pNull[0]; } else { this->value.data.lngptr[elem] = pVals[1].data.lng; this->value.undef[elem] = pNull[1]; } } } } break; case DOUBLE: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; if( vector[2]>1 ) { pVals[2].data.log = theParams[2]->value.data.logptr[elem]; pNull[2] = theParams[2]->value.undef[elem]; } else if( vector[2] ) { pVals[2].data.log = theParams[2]->value.data.logptr[row]; pNull[2] = theParams[2]->value.undef[row]; } i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = pNull[2]) ) { if( pVals[2].data.log ) { this->value.data.dblptr[elem] = pVals[0].data.dbl; this->value.undef[elem] = pNull[0]; } else { this->value.data.dblptr[elem] = pVals[1].data.dbl; this->value.undef[elem] = pNull[1]; } } } } break; case STRING: while( row-- ) { if( vector[2] ) { pVals[2].data.log = theParams[2]->value.data.logptr[row]; pNull[2] = theParams[2]->value.undef[row]; } i=2; while( i-- ) if( vector[i] ) { strcpy( pVals[i].data.str, theParams[i]->value.data.strptr[row] ); pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[row] = pNull[2]) ) { if( pVals[2].data.log ) { strcpy( this->value.data.strptr[row], pVals[0].data.str ); this->value.undef[row] = pNull[0]; } else { strcpy( this->value.data.strptr[row], pVals[1].data.str ); this->value.undef[row] = pNull[1]; } } else { this->value.data.strptr[row][0] = '\0'; } } break; } break; /* String functions */ case strmid_fct: { int strconst = theParams[0]->operation == CONST_OP; int posconst = theParams[1]->operation == CONST_OP; int lenconst = theParams[2]->operation == CONST_OP; int dest_len = this->value.nelem; int src_len = theParams[0]->value.nelem; while (row--) { int pos; int len; char *str; int undef = 0; if (posconst) { pos = theParams[1]->value.data.lng; } else { pos = theParams[1]->value.data.lngptr[row]; if (theParams[1]->value.undef[row]) undef = 1; } if (strconst) { str = theParams[0]->value.data.str; if (src_len == 0) src_len = strlen(str); } else { str = theParams[0]->value.data.strptr[row]; if (theParams[0]->value.undef[row]) undef = 1; } if (lenconst) { len = dest_len; } else { len = theParams[2]->value.data.lngptr[row]; if (theParams[2]->value.undef[row]) undef = 1; } this->value.data.strptr[row][0] = '\0'; if (pos == 0) undef = 1; if (! undef ) { if (cstrmid(this->value.data.strptr[row], len, str, src_len, pos) < 0) break; } this->value.undef[row] = undef; } } break; /* String functions */ case strpos_fct: { int const1 = theParams[0]->operation == CONST_OP; int const2 = theParams[1]->operation == CONST_OP; while (row--) { char *str1, *str2; int undef = 0; if (const1) { str1 = theParams[0]->value.data.str; } else { str1 = theParams[0]->value.data.strptr[row]; if (theParams[0]->value.undef[row]) undef = 1; } if (const2) { str2 = theParams[1]->value.data.str; } else { str2 = theParams[1]->value.data.strptr[row]; if (theParams[1]->value.undef[row]) undef = 1; } this->value.data.lngptr[row] = 0; if (! undef ) { char *res = strstr(str1, str2); if (res == NULL) { undef = 1; this->value.data.lngptr[row] = 0; } else { this->value.data.lngptr[row] = (res - str1) + 1; } } this->value.undef[row] = undef; } } break; } /* End switch(this->operation) */ } /* End if (!gParse.status) */ } /* End non-constant operations */ i = this->nSubNodes; while( i-- ) { if( theParams[i]->operation>0 ) { /* Currently only numeric params allowed */ free( theParams[i]->value.data.ptr ); } } } static void Do_Deref( Node *this ) { Node *theVar, *theDims[MAXDIMS]; int isConst[MAXDIMS], allConst; long dimVals[MAXDIMS]; int i, nDims; long row, elem, dsize; theVar = gParse.Nodes + this->SubNodes[0]; i = nDims = this->nSubNodes-1; allConst = 1; while( i-- ) { theDims[i] = gParse.Nodes + this->SubNodes[i+1]; isConst[i] = ( theDims[i]->operation==CONST_OP ); if( isConst[i] ) dimVals[i] = theDims[i]->value.data.lng; else allConst = 0; } if( this->type==DOUBLE ) { dsize = sizeof( double ); } else if( this->type==LONG ) { dsize = sizeof( long ); } else if( this->type==BOOLEAN ) { dsize = sizeof( char ); } else dsize = 0; Allocate_Ptrs( this ); if( !gParse.status ) { if( allConst && theVar->value.naxis==nDims ) { /* Dereference completely using constant indices */ elem = 0; i = nDims; while( i-- ) { if( dimVals[i]<1 || dimVals[i]>theVar->value.naxes[i] ) break; elem = theVar->value.naxes[i]*elem + dimVals[i]-1; } if( i<0 ) { for( row=0; rowtype==STRING ) this->value.undef[row] = theVar->value.undef[row]; else if( this->type==BITSTR ) this->value.undef; /* Dummy - BITSTRs do not have undefs */ else this->value.undef[row] = theVar->value.undef[elem]; if( this->type==DOUBLE ) this->value.data.dblptr[row] = theVar->value.data.dblptr[elem]; else if( this->type==LONG ) this->value.data.lngptr[row] = theVar->value.data.lngptr[elem]; else if( this->type==BOOLEAN ) this->value.data.logptr[row] = theVar->value.data.logptr[elem]; else { /* XXX Note, the below expression uses knowledge of the layout of the string format, namely (nelem+1) characters per string, followed by (nelem+1) "undef" values. */ this->value.data.strptr[row][0] = theVar->value.data.strptr[0][elem+row]; this->value.data.strptr[row][1] = 0; /* Null terminate */ } elem += theVar->value.nelem; } } else { yyerror("Index out of range"); free( this->value.data.ptr ); } } else if( allConst && nDims==1 ) { /* Reduce dimensions by 1, using a constant index */ if( dimVals[0] < 1 || dimVals[0] > theVar->value.naxes[ theVar->value.naxis-1 ] ) { yyerror("Index out of range"); free( this->value.data.ptr ); } else if ( this->type == BITSTR || this->type == STRING ) { elem = this->value.nelem * (dimVals[0]-1); for( row=0; rowvalue.undef) this->value.undef[row] = theVar->value.undef[row]; memcpy( (char*)this->value.data.strptr[0] + row*sizeof(char)*(this->value.nelem+1), (char*)theVar->value.data.strptr[0] + elem*sizeof(char), this->value.nelem * sizeof(char) ); /* Null terminate */ this->value.data.strptr[row][this->value.nelem] = 0; elem += theVar->value.nelem+1; } } else { elem = this->value.nelem * (dimVals[0]-1); for( row=0; rowvalue.undef + row*this->value.nelem, theVar->value.undef + elem, this->value.nelem * sizeof(char) ); memcpy( (char*)this->value.data.ptr + row*dsize*this->value.nelem, (char*)theVar->value.data.ptr + elem*dsize, this->value.nelem * dsize ); elem += theVar->value.nelem; } } } else if( theVar->value.naxis==nDims ) { /* Dereference completely using an expression for the indices */ for( row=0; rowvalue.undef[row] ) { yyerror("Null encountered as vector index"); free( this->value.data.ptr ); break; } else dimVals[i] = theDims[i]->value.data.lngptr[row]; } } if( gParse.status ) break; elem = 0; i = nDims; while( i-- ) { if( dimVals[i]<1 || dimVals[i]>theVar->value.naxes[i] ) break; elem = theVar->value.naxes[i]*elem + dimVals[i]-1; } if( i<0 ) { elem += row*theVar->value.nelem; if( this->type==STRING ) this->value.undef[row] = theVar->value.undef[row]; else if( this->type==BITSTR ) this->value.undef; /* Dummy - BITSTRs do not have undefs */ else this->value.undef[row] = theVar->value.undef[elem]; if( this->type==DOUBLE ) this->value.data.dblptr[row] = theVar->value.data.dblptr[elem]; else if( this->type==LONG ) this->value.data.lngptr[row] = theVar->value.data.lngptr[elem]; else if( this->type==BOOLEAN ) this->value.data.logptr[row] = theVar->value.data.logptr[elem]; else { /* XXX Note, the below expression uses knowledge of the layout of the string format, namely (nelem+1) characters per string, followed by (nelem+1) "undef" values. */ this->value.data.strptr[row][0] = theVar->value.data.strptr[0][elem+row]; this->value.data.strptr[row][1] = 0; /* Null terminate */ } } else { yyerror("Index out of range"); free( this->value.data.ptr ); } } } else { /* Reduce dimensions by 1, using a nonconstant expression */ for( row=0; rowvalue.undef[row] ) { yyerror("Null encountered as vector index"); free( this->value.data.ptr ); break; } else dimVals[0] = theDims[0]->value.data.lngptr[row]; if( dimVals[0] < 1 || dimVals[0] > theVar->value.naxes[ theVar->value.naxis-1 ] ) { yyerror("Index out of range"); free( this->value.data.ptr ); } else if ( this->type == BITSTR || this->type == STRING ) { elem = this->value.nelem * (dimVals[0]-1); elem += row*(theVar->value.nelem+1); if (this->value.undef) this->value.undef[row] = theVar->value.undef[row]; memcpy( (char*)this->value.data.strptr[0] + row*sizeof(char)*(this->value.nelem+1), (char*)theVar->value.data.strptr[0] + elem*sizeof(char), this->value.nelem * sizeof(char) ); /* Null terminate */ this->value.data.strptr[row][this->value.nelem] = 0; } else { elem = this->value.nelem * (dimVals[0]-1); elem += row*theVar->value.nelem; memcpy( this->value.undef + row*this->value.nelem, theVar->value.undef + elem, this->value.nelem * sizeof(char) ); memcpy( (char*)this->value.data.ptr + row*dsize*this->value.nelem, (char*)theVar->value.data.ptr + elem*dsize, this->value.nelem * dsize ); } } } } if( theVar->operation>0 ) { if (theVar->type == STRING || theVar->type == BITSTR) free(theVar->value.data.strptr[0] ); else free( theVar->value.data.ptr ); } for( i=0; ioperation>0 ) { free( theDims[i]->value.data.ptr ); } } static void Do_GTI( Node *this ) { Node *theExpr, *theTimes; double *start, *stop, *times; long elem, nGTI, gti; int ordered; theTimes = gParse.Nodes + this->SubNodes[0]; theExpr = gParse.Nodes + this->SubNodes[1]; nGTI = theTimes->value.nelem; start = theTimes->value.data.dblptr; stop = theTimes->value.data.dblptr + nGTI; ordered = theTimes->type; if( theExpr->operation==CONST_OP ) { this->value.data.log = (Search_GTI( theExpr->value.data.dbl, nGTI, start, stop, ordered )>=0); this->operation = CONST_OP; } else { Allocate_Ptrs( this ); times = theExpr->value.data.dblptr; if( !gParse.status ) { elem = gParse.nRows * this->value.nelem; if( nGTI ) { gti = -1; while( elem-- ) { if( (this->value.undef[elem] = theExpr->value.undef[elem]) ) continue; /* Before searching entire GTI, check the GTI found last time */ if( gti<0 || times[elem]stop[gti] ) { gti = Search_GTI( times[elem], nGTI, start, stop, ordered ); } this->value.data.logptr[elem] = ( gti>=0 ); } } else while( elem-- ) { this->value.data.logptr[elem] = 0; this->value.undef[elem] = 0; } } } if( theExpr->operation>0 ) free( theExpr->value.data.ptr ); } static long Search_GTI( double evtTime, long nGTI, double *start, double *stop, int ordered ) { long gti, step; if( ordered && nGTI>15 ) { /* If time-ordered and lots of GTIs, */ /* use "FAST" Binary search algorithm */ if( evtTime>=start[0] && evtTime<=stop[nGTI-1] ) { gti = step = (nGTI >> 1); while(1) { if( step>1L ) step >>= 1; if( evtTime>stop[gti] ) { if( evtTime>=start[gti+1] ) gti += step; else { gti = -1L; break; } } else if( evtTime=start[gti] && evtTime<=stop[gti] ) break; } return( gti ); } static void Do_REG( Node *this ) { Node *theRegion, *theX, *theY; double Xval=0.0, Yval=0.0; char Xnull=0, Ynull=0; int Xvector, Yvector; long nelem, elem, rows; theRegion = gParse.Nodes + this->SubNodes[0]; theX = gParse.Nodes + this->SubNodes[1]; theY = gParse.Nodes + this->SubNodes[2]; Xvector = ( theX->operation!=CONST_OP ); if( Xvector ) Xvector = theX->value.nelem; else { Xval = theX->value.data.dbl; } Yvector = ( theY->operation!=CONST_OP ); if( Yvector ) Yvector = theY->value.nelem; else { Yval = theY->value.data.dbl; } if( !Xvector && !Yvector ) { this->value.data.log = ( fits_in_region( Xval, Yval, (SAORegion *)theRegion->value.data.ptr ) != 0 ); this->operation = CONST_OP; } else { Allocate_Ptrs( this ); if( !gParse.status ) { rows = gParse.nRows; nelem = this->value.nelem; elem = rows*nelem; while( rows-- ) { while( nelem-- ) { elem--; if( Xvector>1 ) { Xval = theX->value.data.dblptr[elem]; Xnull = theX->value.undef[elem]; } else if( Xvector ) { Xval = theX->value.data.dblptr[rows]; Xnull = theX->value.undef[rows]; } if( Yvector>1 ) { Yval = theY->value.data.dblptr[elem]; Ynull = theY->value.undef[elem]; } else if( Yvector ) { Yval = theY->value.data.dblptr[rows]; Ynull = theY->value.undef[rows]; } this->value.undef[elem] = ( Xnull || Ynull ); if( this->value.undef[elem] ) continue; this->value.data.logptr[elem] = ( fits_in_region( Xval, Yval, (SAORegion *)theRegion->value.data.ptr ) != 0 ); } nelem = this->value.nelem; } } } if( theX->operation>0 ) free( theX->value.data.ptr ); if( theY->operation>0 ) free( theY->value.data.ptr ); } static void Do_Vector( Node *this ) { Node *that; long row, elem, idx, jdx, offset=0; int node; Allocate_Ptrs( this ); if( !gParse.status ) { for( node=0; nodenSubNodes; node++ ) { that = gParse.Nodes + this->SubNodes[node]; if( that->operation == CONST_OP ) { idx = gParse.nRows*this->value.nelem + offset; while( (idx-=this->value.nelem)>=0 ) { this->value.undef[idx] = 0; switch( this->type ) { case BOOLEAN: this->value.data.logptr[idx] = that->value.data.log; break; case LONG: this->value.data.lngptr[idx] = that->value.data.lng; break; case DOUBLE: this->value.data.dblptr[idx] = that->value.data.dbl; break; } } } else { row = gParse.nRows; idx = row * that->value.nelem; while( row-- ) { elem = that->value.nelem; jdx = row*this->value.nelem + offset; while( elem-- ) { this->value.undef[jdx+elem] = that->value.undef[--idx]; switch( this->type ) { case BOOLEAN: this->value.data.logptr[jdx+elem] = that->value.data.logptr[idx]; break; case LONG: this->value.data.lngptr[jdx+elem] = that->value.data.lngptr[idx]; break; case DOUBLE: this->value.data.dblptr[jdx+elem] = that->value.data.dblptr[idx]; break; } } } } offset += that->value.nelem; } } for( node=0; node < this->nSubNodes; node++ ) if( OPER(this->SubNodes[node])>0 ) free( gParse.Nodes[this->SubNodes[node]].value.data.ptr ); } /*****************************************************************************/ /* Utility routines which perform the calculations on bits and SAO regions */ /*****************************************************************************/ static char bitlgte(char *bits1, int oper, char *bits2) { int val1, val2, nextbit; char result; int i, l1, l2, length, ldiff; char *stream=0; char chr1, chr2; l1 = strlen(bits1); l2 = strlen(bits2); length = (l1 > l2) ? l1 : l2; stream = (char *)malloc(sizeof(char)*(length+1)); if (l1 < l2) { ldiff = l2 - l1; i=0; while( ldiff-- ) stream[i++] = '0'; while( l1-- ) stream[i++] = *(bits1++); stream[i] = '\0'; bits1 = stream; } else if (l2 < l1) { ldiff = l1 - l2; i=0; while( ldiff-- ) stream[i++] = '0'; while( l2-- ) stream[i++] = *(bits2++); stream[i] = '\0'; bits2 = stream; } val1 = val2 = 0; nextbit = 1; while( length-- ) { chr1 = bits1[length]; chr2 = bits2[length]; if ((chr1 != 'x')&&(chr1 != 'X')&&(chr2 != 'x')&&(chr2 != 'X')) { if (chr1 == '1') val1 += nextbit; if (chr2 == '1') val2 += nextbit; nextbit *= 2; } } result = 0; switch (oper) { case LT: if (val1 < val2) result = 1; break; case LTE: if (val1 <= val2) result = 1; break; case GT: if (val1 > val2) result = 1; break; case GTE: if (val1 >= val2) result = 1; break; } free(stream); return (result); } static void bitand(char *result,char *bitstrm1,char *bitstrm2) { int i, l1, l2, ldiff, largestStream; char *stream=0; char chr1, chr2; l1 = strlen(bitstrm1); l2 = strlen(bitstrm2); largestStream = (l1 > l2) ? l1 : l2; stream = (char *)malloc(sizeof(char)*(largestStream+1)); if (l1 < l2) { ldiff = l2 - l1; i=0; while( ldiff-- ) stream[i++] = '0'; while( l1-- ) stream[i++] = *(bitstrm1++); stream[i] = '\0'; bitstrm1 = stream; } else if (l2 < l1) { ldiff = l1 - l2; i=0; while( ldiff-- ) stream[i++] = '0'; while( l2-- ) stream[i++] = *(bitstrm2++); stream[i] = '\0'; bitstrm2 = stream; } while ( (chr1 = *(bitstrm1++)) ) { chr2 = *(bitstrm2++); if ((chr1 == 'x') || (chr2 == 'x')) *result = 'x'; else if ((chr1 == '1') && (chr2 == '1')) *result = '1'; else *result = '0'; result++; } free(stream); *result = '\0'; } static void bitor(char *result,char *bitstrm1,char *bitstrm2) { int i, l1, l2, ldiff, largestStream; char *stream=0; char chr1, chr2; l1 = strlen(bitstrm1); l2 = strlen(bitstrm2); largestStream = (l1 > l2) ? l1 : l2; stream = (char *)malloc(sizeof(char)*(largestStream+1)); if (l1 < l2) { ldiff = l2 - l1; i=0; while( ldiff-- ) stream[i++] = '0'; while( l1-- ) stream[i++] = *(bitstrm1++); stream[i] = '\0'; bitstrm1 = stream; } else if (l2 < l1) { ldiff = l1 - l2; i=0; while( ldiff-- ) stream[i++] = '0'; while( l2-- ) stream[i++] = *(bitstrm2++); stream[i] = '\0'; bitstrm2 = stream; } while ( (chr1 = *(bitstrm1++)) ) { chr2 = *(bitstrm2++); if ((chr1 == '1') || (chr2 == '1')) *result = '1'; else if ((chr1 == '0') || (chr2 == '0')) *result = '0'; else *result = 'x'; result++; } free(stream); *result = '\0'; } static void bitnot(char *result,char *bits) { int length; char chr; length = strlen(bits); while( length-- ) { chr = *(bits++); *(result++) = ( chr=='1' ? '0' : ( chr=='0' ? '1' : chr ) ); } *result = '\0'; } static char bitcmp(char *bitstrm1, char *bitstrm2) { int i, l1, l2, ldiff, largestStream; char *stream=0; char chr1, chr2; l1 = strlen(bitstrm1); l2 = strlen(bitstrm2); largestStream = (l1 > l2) ? l1 : l2; stream = (char *)malloc(sizeof(char)*(largestStream+1)); if (l1 < l2) { ldiff = l2 - l1; i=0; while( ldiff-- ) stream[i++] = '0'; while( l1-- ) stream[i++] = *(bitstrm1++); stream[i] = '\0'; bitstrm1 = stream; } else if (l2 < l1) { ldiff = l1 - l2; i=0; while( ldiff-- ) stream[i++] = '0'; while( l2-- ) stream[i++] = *(bitstrm2++); stream[i] = '\0'; bitstrm2 = stream; } while( (chr1 = *(bitstrm1++)) ) { chr2 = *(bitstrm2++); if ( ((chr1 == '0') && (chr2 == '1')) || ((chr1 == '1') && (chr2 == '0')) ) { free(stream); return( 0 ); } } free(stream); return( 1 ); } static char bnear(double x, double y, double tolerance) { if (fabs(x - y) < tolerance) return ( 1 ); else return ( 0 ); } static char saobox(double xcen, double ycen, double xwid, double ywid, double rot, double xcol, double ycol) { double x,y,xprime,yprime,xmin,xmax,ymin,ymax,theta; theta = (rot / 180.0) * myPI; xprime = xcol - xcen; yprime = ycol - ycen; x = xprime * cos(theta) + yprime * sin(theta); y = -xprime * sin(theta) + yprime * cos(theta); xmin = - 0.5 * xwid; xmax = 0.5 * xwid; ymin = - 0.5 * ywid; ymax = 0.5 * ywid; if ((x >= xmin) && (x <= xmax) && (y >= ymin) && (y <= ymax)) return ( 1 ); else return ( 0 ); } static char circle(double xcen, double ycen, double rad, double xcol, double ycol) { double r2,dx,dy,dlen; dx = xcol - xcen; dy = ycol - ycen; dx *= dx; dy *= dy; dlen = dx + dy; r2 = rad * rad; if (dlen <= r2) return ( 1 ); else return ( 0 ); } static char ellipse(double xcen, double ycen, double xrad, double yrad, double rot, double xcol, double ycol) { double x,y,xprime,yprime,dx,dy,dlen,theta; theta = (rot / 180.0) * myPI; xprime = xcol - xcen; yprime = ycol - ycen; x = xprime * cos(theta) + yprime * sin(theta); y = -xprime * sin(theta) + yprime * cos(theta); dx = x / xrad; dy = y / yrad; dx *= dx; dy *= dy; dlen = dx + dy; if (dlen <= 1.0) return ( 1 ); else return ( 0 ); } /* * Extract substring */ int cstrmid(char *dest_str, int dest_len, char *src_str, int src_len, int pos) { /* char fill_char = ' '; */ char fill_char = '\0'; if (src_len == 0) { src_len = strlen(src_str); } /* .. if constant */ /* Fill destination with blanks */ if (pos < 0) { yyerror("STRMID(S,P,N) P must be 0 or greater"); return -1; } if (pos > src_len || pos == 0) { /* pos==0: blank string requested */ memset(dest_str, fill_char, dest_len); } else if (pos+dest_len > src_len) { /* Copy a subset */ int nsub = src_len-pos+1; int npad = dest_len - nsub; memcpy(dest_str, src_str+pos-1, nsub); /* Fill remaining string with blanks */ memset(dest_str+nsub, fill_char, npad); } else { /* Full string copy */ memcpy(dest_str, src_str+pos-1, dest_len); } dest_str[dest_len] = '\0'; /* Null-terminate */ return 0; } static void yyerror(char *s) { char msg[80]; if( !gParse.status ) gParse.status = PARSE_SYNTAX_ERR; strncpy(msg, s, 80); msg[79] = '\0'; ffpmsg(msg); } cfitsio-3.47/eval_y.c0000644000225700000360000103471213464573431014042 0ustar cagordonlhea /* A Bison parser, made by GNU Bison 2.4.1. */ /* Skeleton implementation for Bison's Yacc-like parsers in C Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . */ /* As a special exception, you may create a larger work that contains part or all of the Bison parser skeleton and distribute that work under terms of your choice, so long as that work isn't itself a parser generator using the skeleton or a modified version thereof as a parser skeleton. Alternatively, if you modify or redistribute the parser skeleton itself, you may (at your option) remove this special exception, which will cause the skeleton and the resulting Bison output files to be licensed under the GNU General Public License without this special exception. This special exception was added by the Free Software Foundation in version 2.2 of Bison. */ /* C LALR(1) parser skeleton written by Richard Stallman, by simplifying the original so-called "semantic" parser. */ /* All symbols defined below should begin with ff or FF, to avoid infringing on user name space. This should be done even for local variables, as they might otherwise be expanded by user macros. There are some unavoidable exceptions within include files to define necessary library symbols; they are noted "INFRINGES ON USER NAME SPACE" below. */ /* Identify Bison output. */ #define FFBISON 1 /* Bison version. */ #define FFBISON_VERSION "2.4.1" /* Skeleton name. */ #define FFSKELETON_NAME "yacc.c" /* Pure parsers. */ #define FFPURE 0 /* Push parsers. */ #define FFPUSH 0 /* Pull parsers. */ #define FFPULL 1 /* Using locations. */ #define FFLSP_NEEDED 0 /* Copy the first part of user declarations. */ /* Line 189 of yacc.c */ #line 1 "eval.y" /************************************************************************/ /* */ /* CFITSIO Lexical Parser */ /* */ /* This file is one of 3 files containing code which parses an */ /* arithmetic expression and evaluates it in the context of an input */ /* FITS file table extension. The CFITSIO lexical parser is divided */ /* into the following 3 parts/files: the CFITSIO "front-end", */ /* eval_f.c, contains the interface between the user/CFITSIO and the */ /* real core of the parser; the FLEX interpreter, eval_l.c, takes the */ /* input string and parses it into tokens and identifies the FITS */ /* information required to evaluate the expression (ie, keywords and */ /* columns); and, the BISON grammar and evaluation routines, eval_y.c, */ /* receives the FLEX output and determines and performs the actual */ /* operations. The files eval_l.c and eval_y.c are produced from */ /* running flex and bison on the files eval.l and eval.y, respectively. */ /* (flex and bison are available from any GNU archive: see www.gnu.org) */ /* */ /* The grammar rules, rather than evaluating the expression in situ, */ /* builds a tree, or Nodal, structure mapping out the order of */ /* operations and expression dependencies. This "compilation" process */ /* allows for much faster processing of multiple rows. This technique */ /* was developed by Uwe Lammers of the XMM Science Analysis System, */ /* although the CFITSIO implementation is entirely code original. */ /* */ /* */ /* Modification History: */ /* */ /* Kent Blackburn c1992 Original parser code developed for the */ /* FTOOLS software package, in particular, */ /* the fselect task. */ /* Kent Blackburn c1995 BIT column support added */ /* Peter D Wilson Feb 1998 Vector column support added */ /* Peter D Wilson May 1998 Ported to CFITSIO library. User */ /* interface routines written, in essence */ /* making fselect, fcalc, and maketime */ /* capabilities available to all tools */ /* via single function calls. */ /* Peter D Wilson Jun 1998 Major rewrite of parser core, so as to */ /* create a run-time evaluation tree, */ /* inspired by the work of Uwe Lammers, */ /* resulting in a speed increase of */ /* 10-100 times. */ /* Peter D Wilson Jul 1998 gtifilter(a,b,c,d) function added */ /* Peter D Wilson Aug 1998 regfilter(a,b,c,d) function added */ /* Peter D Wilson Jul 1999 Make parser fitsfile-independent, */ /* allowing a purely vector-based usage */ /* Craig B Markwardt Jun 2004 Add MEDIAN() function */ /* Craig B Markwardt Jun 2004 Add SUM(), and MIN/MAX() for bit arrays */ /* Craig B Markwardt Jun 2004 Allow subscripting of nX bit arrays */ /* Craig B Markwardt Jun 2004 Implement statistical functions */ /* NVALID(), AVERAGE(), and STDDEV() */ /* for integer and floating point vectors */ /* Craig B Markwardt Jun 2004 Use NULL values for range errors instead*/ /* of throwing a parse error */ /* Craig B Markwardt Oct 2004 Add ACCUM() and SEQDIFF() functions */ /* Craig B Markwardt Feb 2005 Add ANGSEP() function */ /* Craig B Markwardt Aug 2005 CIRCLE, BOX, ELLIPSE, NEAR and REGFILTER*/ /* functions now accept vector arguments */ /* Craig B Markwardt Sum 2006 Add RANDOMN() and RANDOMP() functions */ /* Craig B Markwardt Mar 2007 Allow arguments to RANDOM and RANDOMN to*/ /* determine the output dimensions */ /* Craig B Markwardt Aug 2009 Add substring STRMID() and string search*/ /* STRSTR() functions; more overflow checks*/ /* */ /************************************************************************/ #define APPROX 1.0e-7 #include "eval_defs.h" #include "region.h" #include #include #ifndef alloca #define alloca malloc #endif /* Random number generators for various distributions */ #include "simplerng.h" /* Shrink the initial stack depth to keep local data <32K (mac limit) */ /* yacc will allocate more space if needed, though. */ #define FFINITDEPTH 100 /***************************************************************/ /* Replace Bison's BACKUP macro with one that fixes a bug -- */ /* must update state after popping the stack -- and allows */ /* popping multiple terms at one time. */ /***************************************************************/ #define FFNEWBACKUP(token, value) \ do \ if (ffchar == FFEMPTY ) \ { ffchar = (token); \ memcpy( &fflval, &(value), sizeof(value) ); \ ffchar1 = FFTRANSLATE (ffchar); \ while (fflen--) FFPOPSTACK; \ ffstate = *ffssp; \ goto ffbackup; \ } \ else \ { fferror ("syntax error: cannot back up"); FFERROR; } \ while (0) /***************************************************************/ /* Useful macros for accessing/testing Nodes */ /***************************************************************/ #define TEST(a) if( (a)<0 ) FFERROR #define SIZE(a) gParse.Nodes[ a ].value.nelem #define TYPE(a) gParse.Nodes[ a ].type #define OPER(a) gParse.Nodes[ a ].operation #define PROMOTE(a,b) if( TYPE(a) > TYPE(b) ) \ b = New_Unary( TYPE(a), 0, b ); \ else if( TYPE(a) < TYPE(b) ) \ a = New_Unary( TYPE(b), 0, a ); /***** Internal functions *****/ #ifdef __cplusplus extern "C" { #endif static int Alloc_Node ( void ); static void Free_Last_Node( void ); static void Evaluate_Node ( int thisNode ); static int New_Const ( int returnType, void *value, long len ); static int New_Column( int ColNum ); static int New_Offset( int ColNum, int offset ); static int New_Unary ( int returnType, int Op, int Node1 ); static int New_BinOp ( int returnType, int Node1, int Op, int Node2 ); static int New_Func ( int returnType, funcOp Op, int nNodes, int Node1, int Node2, int Node3, int Node4, int Node5, int Node6, int Node7 ); static int New_FuncSize( int returnType, funcOp Op, int nNodes, int Node1, int Node2, int Node3, int Node4, int Node5, int Node6, int Node7, int Size); static int New_Deref ( int Var, int nDim, int Dim1, int Dim2, int Dim3, int Dim4, int Dim5 ); static int New_GTI ( char *fname, int Node1, char *start, char *stop ); static int New_REG ( char *fname, int NodeX, int NodeY, char *colNames ); static int New_Vector( int subNode ); static int Close_Vec ( int vecNode ); static int Locate_Col( Node *this ); static int Test_Dims ( int Node1, int Node2 ); static void Copy_Dims ( int Node1, int Node2 ); static void Allocate_Ptrs( Node *this ); static void Do_Unary ( Node *this ); static void Do_Offset ( Node *this ); static void Do_BinOp_bit ( Node *this ); static void Do_BinOp_str ( Node *this ); static void Do_BinOp_log ( Node *this ); static void Do_BinOp_lng ( Node *this ); static void Do_BinOp_dbl ( Node *this ); static void Do_Func ( Node *this ); static void Do_Deref ( Node *this ); static void Do_GTI ( Node *this ); static void Do_REG ( Node *this ); static void Do_Vector ( Node *this ); static long Search_GTI ( double evtTime, long nGTI, double *start, double *stop, int ordered ); static char saobox (double xcen, double ycen, double xwid, double ywid, double rot, double xcol, double ycol); static char ellipse(double xcen, double ycen, double xrad, double yrad, double rot, double xcol, double ycol); static char circle (double xcen, double ycen, double rad, double xcol, double ycol); static char bnear (double x, double y, double tolerance); static char bitcmp (char *bitstrm1, char *bitstrm2); static char bitlgte(char *bits1, int oper, char *bits2); static void bitand(char *result, char *bitstrm1, char *bitstrm2); static void bitor (char *result, char *bitstrm1, char *bitstrm2); static void bitnot(char *result, char *bits); static int cstrmid(char *dest_str, int dest_len, char *src_str, int src_len, int pos); static void fferror(char *msg); #ifdef __cplusplus } #endif /* Line 189 of yacc.c */ #line 265 "y.tab.c" /* Enabling traces. */ #ifndef FFDEBUG # define FFDEBUG 0 #endif /* Enabling verbose error messages. */ #ifdef FFERROR_VERBOSE # undef FFERROR_VERBOSE # define FFERROR_VERBOSE 1 #else # define FFERROR_VERBOSE 0 #endif /* Enabling the token table. */ #ifndef FFTOKEN_TABLE # define FFTOKEN_TABLE 0 #endif /* Tokens. */ #ifndef FFTOKENTYPE # define FFTOKENTYPE /* Put the tokens into the symbol table, so that GDB and other debuggers know about them. */ enum fftokentype { BOOLEAN = 258, LONG = 259, DOUBLE = 260, STRING = 261, BITSTR = 262, FUNCTION = 263, BFUNCTION = 264, IFUNCTION = 265, GTIFILTER = 266, REGFILTER = 267, COLUMN = 268, BCOLUMN = 269, SCOLUMN = 270, BITCOL = 271, ROWREF = 272, NULLREF = 273, SNULLREF = 274, OR = 275, AND = 276, NE = 277, EQ = 278, GTE = 279, LTE = 280, LT = 281, GT = 282, POWER = 283, NOT = 284, FLTCAST = 285, INTCAST = 286, UMINUS = 287, DIFF = 288, ACCUM = 289 }; #endif /* Tokens. */ #define BOOLEAN 258 #define LONG 259 #define DOUBLE 260 #define STRING 261 #define BITSTR 262 #define FUNCTION 263 #define BFUNCTION 264 #define IFUNCTION 265 #define GTIFILTER 266 #define REGFILTER 267 #define COLUMN 268 #define BCOLUMN 269 #define SCOLUMN 270 #define BITCOL 271 #define ROWREF 272 #define NULLREF 273 #define SNULLREF 274 #define OR 275 #define AND 276 #define NE 277 #define EQ 278 #define GTE 279 #define LTE 280 #define LT 281 #define GT 282 #define POWER 283 #define NOT 284 #define FLTCAST 285 #define INTCAST 286 #define UMINUS 287 #define DIFF 288 #define ACCUM 289 #if ! defined FFSTYPE && ! defined FFSTYPE_IS_DECLARED typedef union FFSTYPE { /* Line 214 of yacc.c */ #line 192 "eval.y" int Node; /* Index of Node */ double dbl; /* real value */ long lng; /* integer value */ char log; /* logical value */ char str[MAX_STRLEN]; /* string value */ /* Line 214 of yacc.c */ #line 379 "y.tab.c" } FFSTYPE; # define FFSTYPE_IS_TRIVIAL 1 # define ffstype FFSTYPE /* obsolescent; will be withdrawn */ # define FFSTYPE_IS_DECLARED 1 #endif /* Copy the second part of user declarations. */ /* Line 264 of yacc.c */ #line 391 "y.tab.c" #ifdef short # undef short #endif #ifdef FFTYPE_UINT8 typedef FFTYPE_UINT8 fftype_uint8; #else typedef unsigned char fftype_uint8; #endif #ifdef FFTYPE_INT8 typedef FFTYPE_INT8 fftype_int8; #elif (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) typedef signed char fftype_int8; #else typedef short int fftype_int8; #endif #ifdef FFTYPE_UINT16 typedef FFTYPE_UINT16 fftype_uint16; #else typedef unsigned short int fftype_uint16; #endif #ifdef FFTYPE_INT16 typedef FFTYPE_INT16 fftype_int16; #else typedef short int fftype_int16; #endif #ifndef FFSIZE_T # ifdef __SIZE_TYPE__ # define FFSIZE_T __SIZE_TYPE__ # elif defined size_t # define FFSIZE_T size_t # elif ! defined FFSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) # include /* INFRINGES ON USER NAME SPACE */ # define FFSIZE_T size_t # else # define FFSIZE_T unsigned int # endif #endif #define FFSIZE_MAXIMUM ((FFSIZE_T) -1) #ifndef FF_ # if FFENABLE_NLS # if ENABLE_NLS # include /* INFRINGES ON USER NAME SPACE */ # define FF_(msgid) dgettext ("bison-runtime", msgid) # endif # endif # ifndef FF_ # define FF_(msgid) msgid # endif #endif /* Suppress unused-variable warnings by "using" E. */ #if ! defined lint || defined __GNUC__ # define FFUSE(e) ((void) (e)) #else # define FFUSE(e) /* empty */ #endif /* Identity function, used to suppress warnings about constant conditions. */ #ifndef lint # define FFID(n) (n) #else #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static int FFID (int ffi) #else static int FFID (ffi) int ffi; #endif { return ffi; } #endif #if ! defined ffoverflow || FFERROR_VERBOSE /* The parser invokes alloca or malloc; define the necessary symbols. */ # ifdef FFSTACK_USE_ALLOCA # if FFSTACK_USE_ALLOCA # ifdef __GNUC__ # define FFSTACK_ALLOC __builtin_alloca # elif defined __BUILTIN_VA_ARG_INCR # include /* INFRINGES ON USER NAME SPACE */ # elif defined _AIX # define FFSTACK_ALLOC __alloca # elif defined _MSC_VER # include /* INFRINGES ON USER NAME SPACE */ # define alloca _alloca # else # define FFSTACK_ALLOC alloca # if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) # include /* INFRINGES ON USER NAME SPACE */ # ifndef _STDLIB_H # define _STDLIB_H 1 # endif # endif # endif # endif # endif # ifdef FFSTACK_ALLOC /* Pacify GCC's `empty if-body' warning. */ # define FFSTACK_FREE(Ptr) do { /* empty */; } while (FFID (0)) # ifndef FFSTACK_ALLOC_MAXIMUM /* The OS might guarantee only one guard page at the bottom of the stack, and a page size can be as small as 4096 bytes. So we cannot safely invoke alloca (N) if N exceeds 4096. Use a slightly smaller number to allow for a few compiler-allocated temporary stack slots. */ # define FFSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */ # endif # else # define FFSTACK_ALLOC FFMALLOC # define FFSTACK_FREE FFFREE # ifndef FFSTACK_ALLOC_MAXIMUM # define FFSTACK_ALLOC_MAXIMUM FFSIZE_MAXIMUM # endif # if (defined __cplusplus && ! defined _STDLIB_H \ && ! ((defined FFMALLOC || defined malloc) \ && (defined FFFREE || defined free))) # include /* INFRINGES ON USER NAME SPACE */ # ifndef _STDLIB_H # define _STDLIB_H 1 # endif # endif # ifndef FFMALLOC # define FFMALLOC malloc # if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) void *malloc (FFSIZE_T); /* INFRINGES ON USER NAME SPACE */ # endif # endif # ifndef FFFREE # define FFFREE free # if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) void free (void *); /* INFRINGES ON USER NAME SPACE */ # endif # endif # endif #endif /* ! defined ffoverflow || FFERROR_VERBOSE */ #if (! defined ffoverflow \ && (! defined __cplusplus \ || (defined FFSTYPE_IS_TRIVIAL && FFSTYPE_IS_TRIVIAL))) /* A type that is properly aligned for any stack member. */ union ffalloc { fftype_int16 ffss_alloc; FFSTYPE ffvs_alloc; }; /* The size of the maximum gap between one aligned stack and the next. */ # define FFSTACK_GAP_MAXIMUM (sizeof (union ffalloc) - 1) /* The size of an array large to enough to hold all stacks, each with N elements. */ # define FFSTACK_BYTES(N) \ ((N) * (sizeof (fftype_int16) + sizeof (FFSTYPE)) \ + FFSTACK_GAP_MAXIMUM) /* Copy COUNT objects from FROM to TO. The source and destination do not overlap. */ # ifndef FFCOPY # if defined __GNUC__ && 1 < __GNUC__ # define FFCOPY(To, From, Count) \ __builtin_memcpy (To, From, (Count) * sizeof (*(From))) # else # define FFCOPY(To, From, Count) \ do \ { \ FFSIZE_T ffi; \ for (ffi = 0; ffi < (Count); ffi++) \ (To)[ffi] = (From)[ffi]; \ } \ while (FFID (0)) # endif # endif /* Relocate STACK from its old location to the new one. The local variables FFSIZE and FFSTACKSIZE give the old and new number of elements in the stack, and FFPTR gives the new location of the stack. Advance FFPTR to a properly aligned location for the next stack. */ # define FFSTACK_RELOCATE(Stack_alloc, Stack) \ do \ { \ FFSIZE_T ffnewbytes; \ FFCOPY (&ffptr->Stack_alloc, Stack, ffsize); \ Stack = &ffptr->Stack_alloc; \ ffnewbytes = ffstacksize * sizeof (*Stack) + FFSTACK_GAP_MAXIMUM; \ ffptr += ffnewbytes / sizeof (*ffptr); \ } \ while (FFID (0)) #endif /* FFFINAL -- State number of the termination state. */ #define FFFINAL 2 /* FFLAST -- Last index in FFTABLE. */ #define FFLAST 1603 /* FFNTOKENS -- Number of terminals. */ #define FFNTOKENS 54 /* FFNNTS -- Number of nonterminals. */ #define FFNNTS 9 /* FFNRULES -- Number of rules. */ #define FFNRULES 125 /* FFNRULES -- Number of states. */ #define FFNSTATES 290 /* FFTRANSLATE(FFLEX) -- Bison symbol number corresponding to FFLEX. */ #define FFUNDEFTOK 2 #define FFMAXUTOK 289 #define FFTRANSLATE(FFX) \ ((unsigned int) (FFX) <= FFMAXUTOK ? fftranslate[FFX] : FFUNDEFTOK) /* FFTRANSLATE[FFLEX] -- Bison symbol number corresponding to FFLEX. */ static const fftype_uint8 fftranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 50, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 37, 41, 2, 52, 53, 38, 35, 20, 36, 2, 39, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 22, 2, 2, 21, 2, 25, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 47, 2, 51, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 23, 40, 24, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 26, 27, 29, 30, 31, 32, 33, 34, 42, 43, 44, 45, 46, 48, 49 }; #if FFDEBUG /* FFPRHS[FFN] -- Index of the first RHS symbol of rule number FFN in FFRHS. */ static const fftype_uint16 ffprhs[] = { 0, 0, 3, 4, 7, 9, 12, 15, 18, 21, 24, 27, 31, 34, 38, 42, 46, 49, 52, 54, 56, 61, 65, 69, 73, 78, 85, 94, 105, 118, 121, 125, 127, 129, 131, 136, 138, 140, 144, 148, 152, 156, 160, 164, 167, 170, 174, 178, 182, 188, 194, 200, 203, 207, 211, 215, 219, 225, 231, 241, 246, 253, 262, 273, 286, 289, 292, 295, 298, 300, 302, 307, 311, 315, 319, 323, 327, 331, 335, 339, 343, 347, 351, 355, 359, 363, 367, 371, 375, 379, 383, 387, 391, 395, 399, 405, 411, 415, 419, 423, 429, 437, 449, 465, 468, 472, 478, 488, 492, 500, 510, 515, 522, 531, 542, 555, 558, 562, 564, 566, 571, 573, 577, 581, 587, 593 }; /* FFRHS -- A `-1'-separated list of the rules' RHS. */ static const fftype_int8 ffrhs[] = { 55, 0, -1, -1, 55, 56, -1, 50, -1, 59, 50, -1, 60, 50, -1, 62, 50, -1, 61, 50, -1, 1, 50, -1, 23, 60, -1, 57, 20, 60, -1, 23, 59, -1, 58, 20, 59, -1, 58, 20, 60, -1, 57, 20, 59, -1, 58, 24, -1, 57, 24, -1, 7, -1, 16, -1, 16, 23, 59, 24, -1, 61, 41, 61, -1, 61, 40, 61, -1, 61, 35, 61, -1, 61, 47, 59, 51, -1, 61, 47, 59, 20, 59, 51, -1, 61, 47, 59, 20, 59, 20, 59, 51, -1, 61, 47, 59, 20, 59, 20, 59, 20, 59, 51, -1, 61, 47, 59, 20, 59, 20, 59, 20, 59, 20, 59, 51, -1, 43, 61, -1, 52, 61, 53, -1, 4, -1, 5, -1, 13, -1, 13, 23, 59, 24, -1, 17, -1, 18, -1, 59, 37, 59, -1, 59, 35, 59, -1, 59, 36, 59, -1, 59, 38, 59, -1, 59, 39, 59, -1, 59, 42, 59, -1, 35, 59, -1, 36, 59, -1, 52, 59, 53, -1, 59, 38, 60, -1, 60, 38, 59, -1, 60, 25, 59, 22, 59, -1, 60, 25, 60, 22, 59, -1, 60, 25, 59, 22, 60, -1, 8, 53, -1, 8, 60, 53, -1, 8, 62, 53, -1, 8, 61, 53, -1, 8, 59, 53, -1, 10, 62, 20, 62, 53, -1, 8, 59, 20, 59, 53, -1, 8, 59, 20, 59, 20, 59, 20, 59, 53, -1, 59, 47, 59, 51, -1, 59, 47, 59, 20, 59, 51, -1, 59, 47, 59, 20, 59, 20, 59, 51, -1, 59, 47, 59, 20, 59, 20, 59, 20, 59, 51, -1, 59, 47, 59, 20, 59, 20, 59, 20, 59, 20, 59, 51, -1, 45, 59, -1, 45, 60, -1, 44, 59, -1, 44, 60, -1, 3, -1, 14, -1, 14, 23, 59, 24, -1, 61, 30, 61, -1, 61, 29, 61, -1, 61, 33, 61, -1, 61, 32, 61, -1, 61, 34, 61, -1, 61, 31, 61, -1, 59, 34, 59, -1, 59, 33, 59, -1, 59, 31, 59, -1, 59, 32, 59, -1, 59, 28, 59, -1, 59, 30, 59, -1, 59, 29, 59, -1, 62, 30, 62, -1, 62, 29, 62, -1, 62, 34, 62, -1, 62, 31, 62, -1, 62, 33, 62, -1, 62, 32, 62, -1, 60, 27, 60, -1, 60, 26, 60, -1, 60, 30, 60, -1, 60, 29, 60, -1, 59, 21, 59, 22, 59, -1, 60, 25, 60, 22, 60, -1, 9, 59, 53, -1, 9, 60, 53, -1, 9, 62, 53, -1, 8, 60, 20, 60, 53, -1, 9, 59, 20, 59, 20, 59, 53, -1, 9, 59, 20, 59, 20, 59, 20, 59, 20, 59, 53, -1, 9, 59, 20, 59, 20, 59, 20, 59, 20, 59, 20, 59, 20, 59, 53, -1, 11, 53, -1, 11, 6, 53, -1, 11, 6, 20, 59, 53, -1, 11, 6, 20, 59, 20, 6, 20, 6, 53, -1, 12, 6, 53, -1, 12, 6, 20, 59, 20, 59, 53, -1, 12, 6, 20, 59, 20, 59, 20, 6, 53, -1, 60, 47, 59, 51, -1, 60, 47, 59, 20, 59, 51, -1, 60, 47, 59, 20, 59, 20, 59, 51, -1, 60, 47, 59, 20, 59, 20, 59, 20, 59, 51, -1, 60, 47, 59, 20, 59, 20, 59, 20, 59, 20, 59, 51, -1, 43, 60, -1, 52, 60, 53, -1, 6, -1, 15, -1, 15, 23, 59, 24, -1, 19, -1, 52, 62, 53, -1, 62, 35, 62, -1, 60, 25, 62, 22, 62, -1, 8, 62, 20, 62, 53, -1, 8, 62, 20, 59, 20, 59, 53, -1 }; /* FFRLINE[FFN] -- source line where rule number FFN was defined. */ static const fftype_uint16 ffrline[] = { 0, 244, 244, 245, 248, 249, 255, 261, 267, 273, 276, 278, 291, 293, 306, 317, 331, 335, 339, 343, 345, 354, 357, 360, 369, 371, 373, 375, 377, 379, 382, 386, 388, 390, 392, 401, 403, 405, 408, 411, 414, 417, 420, 423, 425, 427, 429, 433, 437, 456, 475, 494, 505, 519, 531, 562, 657, 665, 727, 751, 753, 755, 757, 759, 761, 763, 765, 767, 771, 773, 775, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 841, 843, 845, 847, 850, 857, 874, 887, 900, 911, 927, 951, 979, 1016, 1020, 1024, 1027, 1031, 1035, 1038, 1042, 1044, 1046, 1048, 1050, 1052, 1054, 1058, 1061, 1063, 1072, 1074, 1076, 1085, 1104, 1123 }; #endif #if FFDEBUG || FFERROR_VERBOSE || FFTOKEN_TABLE /* FFTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. First, the terminals, then, starting at FFNTOKENS, nonterminals. */ static const char *const fftname[] = { "$end", "error", "$undefined", "BOOLEAN", "LONG", "DOUBLE", "STRING", "BITSTR", "FUNCTION", "BFUNCTION", "IFUNCTION", "GTIFILTER", "REGFILTER", "COLUMN", "BCOLUMN", "SCOLUMN", "BITCOL", "ROWREF", "NULLREF", "SNULLREF", "','", "'='", "':'", "'{'", "'}'", "'?'", "OR", "AND", "'~'", "NE", "EQ", "GTE", "LTE", "LT", "GT", "'+'", "'-'", "'%'", "'*'", "'/'", "'|'", "'&'", "POWER", "NOT", "FLTCAST", "INTCAST", "UMINUS", "'['", "DIFF", "ACCUM", "'\\n'", "']'", "'('", "')'", "$accept", "lines", "line", "bvector", "vector", "expr", "bexpr", "bits", "sexpr", 0 }; #endif # ifdef FFPRINT /* FFTOKNUM[FFLEX-NUM] -- Internal token number corresponding to token FFLEX-NUM. */ static const fftype_uint16 fftoknum[] = { 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 44, 61, 58, 123, 125, 63, 275, 276, 126, 277, 278, 279, 280, 281, 282, 43, 45, 37, 42, 47, 124, 38, 283, 284, 285, 286, 287, 91, 288, 289, 10, 93, 40, 41 }; # endif /* FFR1[FFN] -- Symbol number of symbol that rule FFN derives. */ static const fftype_uint8 ffr1[] = { 0, 54, 55, 55, 56, 56, 56, 56, 56, 56, 57, 57, 58, 58, 58, 58, 59, 60, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 62, 62, 62, 62, 62, 62, 62, 62, 62 }; /* FFR2[FFN] -- Number of symbols composing right hand side of rule FFN. */ static const fftype_uint8 ffr2[] = { 0, 2, 0, 2, 1, 2, 2, 2, 2, 2, 2, 3, 2, 3, 3, 3, 2, 2, 1, 1, 4, 3, 3, 3, 4, 6, 8, 10, 12, 2, 3, 1, 1, 1, 4, 1, 1, 3, 3, 3, 3, 3, 3, 2, 2, 3, 3, 3, 5, 5, 5, 2, 3, 3, 3, 3, 5, 5, 9, 4, 6, 8, 10, 12, 2, 2, 2, 2, 1, 1, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 5, 3, 3, 3, 5, 7, 11, 15, 2, 3, 5, 9, 3, 7, 9, 4, 6, 8, 10, 12, 2, 3, 1, 1, 4, 1, 3, 3, 5, 5, 7 }; /* FFDEFACT[STATE-NAME] -- Default rule to reduce with in state STATE-NUM when FFTABLE doesn't specify something else to do. Zero means the default is an error. */ static const fftype_uint8 ffdefact[] = { 2, 0, 1, 0, 68, 31, 32, 117, 18, 0, 0, 0, 0, 0, 33, 69, 118, 19, 35, 36, 120, 0, 0, 0, 0, 0, 0, 4, 0, 3, 0, 0, 0, 0, 0, 0, 9, 51, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 103, 0, 0, 0, 0, 0, 12, 10, 0, 43, 44, 115, 29, 66, 67, 64, 65, 0, 0, 0, 0, 0, 17, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 7, 0, 55, 0, 52, 54, 0, 53, 0, 96, 97, 98, 0, 0, 104, 0, 107, 0, 0, 0, 0, 45, 116, 30, 121, 15, 11, 13, 14, 0, 81, 83, 82, 79, 80, 78, 77, 38, 39, 37, 40, 46, 41, 42, 0, 0, 0, 0, 91, 90, 93, 92, 47, 0, 0, 0, 72, 71, 76, 74, 73, 75, 23, 22, 21, 0, 85, 84, 87, 89, 88, 86, 122, 0, 0, 0, 0, 0, 0, 0, 0, 34, 70, 119, 20, 0, 0, 59, 0, 0, 0, 0, 110, 29, 0, 0, 24, 0, 57, 99, 0, 124, 0, 56, 0, 105, 0, 94, 0, 48, 50, 49, 95, 123, 0, 0, 0, 0, 0, 0, 0, 0, 60, 0, 111, 0, 25, 0, 125, 0, 100, 0, 0, 108, 0, 0, 0, 0, 0, 0, 0, 0, 61, 0, 112, 0, 26, 58, 0, 106, 109, 0, 0, 0, 0, 0, 62, 0, 113, 0, 27, 0, 101, 0, 0, 0, 0, 63, 114, 28, 0, 0, 102 }; /* FFDEFGOTO[NTERM-NUM]. */ static const fftype_int8 ffdefgoto[] = { -1, 1, 29, 30, 31, 46, 47, 44, 58 }; /* FFPACT[STATE-NUM] -- Index in FFTABLE of the portion describing STATE-NUM. */ #define FFPACT_NINF -46 static const fftype_int16 ffpact[] = { -46, 297, -46, -45, -46, -46, -46, -46, -46, 347, 398, 398, -5, 0, -4, 5, 19, 23, -46, -46, -46, 398, 398, 398, 398, 398, 398, -46, 398, -46, 6, 17, 1088, 296, 1468, 1490, -46, -46, 424, 9, 1374, 135, 452, 168, 1518, 344, 1355, 1449, 1555, -10, -46, -9, 398, 398, 398, 398, 1355, 1449, 250, -2, -2, 10, 11, -2, 10, -2, 10, 619, 240, 1399, 1424, 398, -46, 398, -46, 398, 398, 398, 398, 398, 398, 398, 398, 398, 398, 398, 398, 398, 398, 398, -46, 398, 398, 398, 398, 398, 398, 398, -46, -3, -3, -3, -3, -3, -3, -3, -3, -3, 398, -46, 398, 398, 398, 398, 398, 398, 398, -46, 398, -46, 398, -46, -46, 398, -46, 398, -46, -46, -46, 398, 398, -46, 398, -46, 1231, 1251, 1271, 1291, -46, -46, -46, -46, 1355, 1449, 1355, 1449, 1313, 1535, 1535, 1535, 1556, 1556, 1556, 1556, 55, 55, 55, -40, 10, -40, -40, 728, 1335, 400, 201, 74, 111, -35, -35, -40, 752, -3, -3, 24, 24, 24, 24, 24, 24, 79, 11, 11, 776, -17, -17, 28, 28, 28, 28, -46, 480, 342, 1111, 1431, 1131, 1438, 508, 1151, -46, -46, -46, -46, 398, 398, -46, 398, 398, 398, 398, -46, 11, 20, 398, -46, 398, -46, -46, 398, -46, 398, -46, 60, -46, 398, 1499, 800, 1499, 1449, 1499, 1449, 250, 824, 848, 1171, 646, 536, 48, 564, 398, -46, 398, -46, 398, -46, 398, -46, 398, -46, 63, 83, -46, 872, 896, 920, 673, 1191, 39, 45, 398, -46, 398, -46, 398, -46, -46, 398, -46, -46, 944, 968, 992, 592, 398, -46, 398, -46, 398, -46, 398, -46, 1016, 1040, 1064, 1211, -46, -46, -46, 398, 700, -46 }; /* FFPGOTO[NTERM-NUM]. */ static const fftype_int16 ffpgoto[] = { -46, -46, -46, -46, -46, -1, 90, 147, 22 }; /* FFTABLE[FFPACT[STATE-NUM]]. What to do in state STATE-NUM. If positive, shift that token. If negative, reduce the rule which number is the opposite. If zero, do what FFDEFACT says. If FFTABLE_NINF, syntax error. */ #define FFTABLE_NINF -1 static const fftype_uint16 fftable[] = { 32, 49, 88, 96, 8, 36, 51, 89, 38, 42, 130, 132, 97, 17, 112, 113, 114, 115, 116, 52, 56, 59, 60, 35, 63, 65, 71, 67, 53, 120, 72, 41, 45, 48, 91, 92, 93, 73, 94, 95, 171, 74, 54, 131, 133, 89, 55, 96, 50, 172, 70, 134, 135, 136, 137, 105, 97, 97, 108, 105, 106, 107, 121, 116, 106, 107, 236, 108, 248, 256, 142, 108, 144, 140, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 159, 160, 161, 257, 162, 33, 266, 86, 87, 169, 170, 88, 267, 39, 43, 93, 89, 94, 95, 0, 0, 182, 0, 0, 0, 57, 96, 164, 61, 64, 66, 190, 68, 106, 107, 97, 192, 0, 194, 0, 108, 0, 0, 196, 0, 197, 183, 184, 185, 186, 187, 188, 189, 0, 94, 95, 0, 0, 0, 193, 0, 0, 34, 96, 0, 195, 0, 0, 0, 123, 40, 0, 97, 0, 0, 143, 0, 145, 110, 111, 112, 113, 114, 115, 116, 62, 0, 0, 0, 69, 158, 0, 0, 0, 0, 163, 165, 166, 167, 168, 0, 0, 124, 0, 0, 0, 0, 91, 92, 93, 0, 94, 95, 0, 0, 224, 225, 0, 226, 228, 96, 231, 0, 0, 191, 232, 0, 233, 0, 97, 234, 0, 235, 0, 0, 127, 237, 207, 0, 0, 0, 0, 0, 230, 110, 111, 112, 113, 114, 115, 116, 251, 0, 252, 0, 253, 0, 254, 0, 255, 173, 174, 175, 176, 177, 178, 179, 180, 181, 0, 0, 268, 0, 269, 0, 270, 0, 0, 271, 91, 92, 93, 0, 94, 95, 280, 0, 281, 0, 282, 0, 283, 96, 110, 111, 112, 113, 114, 115, 116, 288, 97, 0, 0, 0, 0, 0, 139, 0, 227, 229, 2, 3, 0, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 0, 210, 211, 21, 91, 92, 93, 0, 94, 95, 0, 0, 0, 0, 0, 22, 23, 96, 0, 0, 0, 0, 0, 24, 25, 26, 97, 0, 0, 98, 27, 0, 28, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 91, 92, 93, 21, 94, 95, 110, 111, 112, 113, 114, 115, 116, 96, 0, 22, 23, 0, 0, 0, 0, 0, 97, 24, 25, 26, 0, 0, 216, 0, 128, 0, 28, 37, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 0, 0, 0, 21, 206, 0, 0, 91, 92, 93, 0, 94, 95, 0, 0, 22, 23, 0, 0, 0, 96, 0, 0, 24, 25, 26, 118, 75, 0, 97, 0, 0, 28, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89, 125, 75, 0, 0, 0, 119, 0, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89, 214, 75, 0, 0, 0, 126, 0, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89, 221, 75, 0, 0, 0, 215, 0, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89, 246, 75, 0, 0, 0, 222, 0, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89, 249, 75, 0, 0, 0, 247, 0, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89, 278, 75, 0, 0, 0, 250, 0, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89, 75, 0, 0, 0, 0, 279, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89, 75, 0, 0, 0, 0, 138, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89, 75, 0, 0, 0, 0, 245, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89, 75, 0, 0, 0, 0, 264, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89, 203, 75, 0, 0, 0, 289, 0, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 208, 75, 0, 89, 0, 0, 0, 204, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 212, 75, 0, 89, 0, 0, 0, 209, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 238, 75, 0, 89, 0, 0, 0, 213, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 240, 75, 0, 89, 0, 0, 0, 239, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 242, 75, 0, 89, 0, 0, 0, 241, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 258, 75, 0, 89, 0, 0, 0, 243, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 260, 75, 0, 89, 0, 0, 0, 259, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 262, 75, 0, 89, 0, 0, 0, 261, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 272, 75, 0, 89, 0, 0, 0, 263, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 274, 75, 0, 89, 0, 0, 0, 273, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 276, 75, 0, 89, 0, 0, 0, 275, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 75, 0, 89, 0, 0, 0, 277, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 75, 0, 89, 0, 0, 0, 284, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 75, 0, 89, 0, 0, 0, 285, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 75, 0, 89, 0, 0, 0, 286, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 217, 75, 0, 0, 89, 0, 0, 90, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 219, 75, 88, 0, 0, 0, 0, 89, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 223, 75, 88, 0, 0, 0, 0, 89, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 244, 75, 88, 0, 0, 0, 0, 89, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 265, 75, 88, 0, 0, 0, 0, 89, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 287, 75, 88, 0, 0, 0, 0, 89, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 75, 88, 0, 198, 0, 0, 89, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 75, 88, 0, 199, 0, 0, 89, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 75, 88, 0, 200, 0, 0, 89, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 75, 88, 0, 201, 0, 0, 89, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 75, 202, 0, 0, 89, 0, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 75, 205, 0, 0, 89, 0, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 75, 88, 0, 0, 0, 0, 89, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89, 99, 100, 101, 102, 103, 104, 105, 0, 0, 0, 0, 106, 107, 0, 0, 0, 0, 0, 108, 0, 0, 0, 0, 0, 122, 99, 100, 101, 102, 103, 104, 105, 0, 0, 0, 0, 106, 107, 0, 0, 0, 0, 0, 108, 0, 0, 0, 0, 0, 140, 110, 111, 112, 113, 114, 115, 116, 110, 111, 112, 113, 114, 115, 116, 110, 111, 112, 113, 114, 115, 116, 91, 92, 93, 141, 94, 95, 0, 0, 0, 0, 218, 0, 0, 96, 0, 0, 0, 220, 0, 0, 0, 0, 97, 99, 100, 101, 102, 103, 104, 105, 0, 0, 0, 0, 106, 107, 0, 0, 0, 0, 0, 108, 0, 0, 109, 110, 111, 112, 113, 114, 115, 116, 0, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 0, 117, 88, 0, 0, 0, 0, 89, 99, 100, 101, 102, 103, 104, 105, 0, 0, 0, 0, 106, 107, 0, 0, 0, 0, 0, 108, 79, 80, 81, 82, 83, 84, 85, 86, 87, 129, 0, 88, 0, 0, 0, 0, 89, 0, 110, 111, 112, 113, 114, 115, 116, 83, 84, 85, 86, 87, 0, 0, 88, 0, 0, 0, 0, 89 }; static const fftype_int16 ffcheck[] = { 1, 6, 42, 38, 7, 50, 6, 47, 9, 10, 20, 20, 47, 16, 31, 32, 33, 34, 35, 23, 21, 22, 23, 1, 25, 26, 20, 28, 23, 20, 24, 9, 10, 11, 25, 26, 27, 20, 29, 30, 43, 24, 23, 53, 53, 47, 23, 38, 53, 52, 28, 52, 53, 54, 55, 35, 47, 47, 47, 35, 40, 41, 53, 35, 40, 41, 6, 47, 20, 6, 71, 47, 73, 53, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 6, 91, 1, 53, 38, 39, 96, 97, 42, 53, 9, 10, 27, 47, 29, 30, -1, -1, 108, -1, -1, -1, 21, 38, 91, 24, 25, 26, 118, 28, 40, 41, 47, 123, -1, 125, -1, 47, -1, -1, 130, -1, 132, 110, 111, 112, 113, 114, 115, 116, -1, 29, 30, -1, -1, -1, 123, -1, -1, 1, 38, -1, 129, -1, -1, -1, 20, 9, -1, 47, -1, -1, 71, -1, 73, 29, 30, 31, 32, 33, 34, 35, 24, -1, -1, -1, 28, 86, -1, -1, -1, -1, 91, 92, 93, 94, 95, -1, -1, 53, -1, -1, -1, -1, 25, 26, 27, -1, 29, 30, -1, -1, 202, 203, -1, 205, 206, 38, 208, -1, -1, 120, 212, -1, 214, -1, 47, 217, -1, 219, -1, -1, 53, 223, 22, -1, -1, -1, -1, -1, 207, 29, 30, 31, 32, 33, 34, 35, 238, -1, 240, -1, 242, -1, 244, -1, 246, 99, 100, 101, 102, 103, 104, 105, 106, 107, -1, -1, 258, -1, 260, -1, 262, -1, -1, 265, 25, 26, 27, -1, 29, 30, 272, -1, 274, -1, 276, -1, 278, 38, 29, 30, 31, 32, 33, 34, 35, 287, 47, -1, -1, -1, -1, -1, 53, -1, 205, 206, 0, 1, -1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, -1, 171, 172, 23, 25, 26, 27, -1, 29, 30, -1, -1, -1, -1, -1, 35, 36, 38, -1, -1, -1, -1, -1, 43, 44, 45, 47, -1, -1, 50, 50, -1, 52, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 25, 26, 27, 23, 29, 30, 29, 30, 31, 32, 33, 34, 35, 38, -1, 35, 36, -1, -1, -1, -1, -1, 47, 43, 44, 45, -1, -1, 53, -1, 53, -1, 52, 53, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, -1, -1, -1, 23, 22, -1, -1, 25, 26, 27, -1, 29, 30, -1, -1, 35, 36, -1, -1, -1, 38, -1, -1, 43, 44, 45, 20, 21, -1, 47, -1, -1, 52, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47, 20, 21, -1, -1, -1, 53, -1, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47, 20, 21, -1, -1, -1, 53, -1, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47, 20, 21, -1, -1, -1, 53, -1, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47, 20, 21, -1, -1, -1, 53, -1, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47, 20, 21, -1, -1, -1, 53, -1, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47, 20, 21, -1, -1, -1, 53, -1, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47, 21, -1, -1, -1, -1, 53, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47, 21, -1, -1, -1, -1, 53, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47, 21, -1, -1, -1, -1, 53, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47, 21, -1, -1, -1, -1, 53, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47, 20, 21, -1, -1, -1, 53, -1, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, 20, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, 20, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, 20, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, 20, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, 20, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, 20, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, 20, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, 20, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, 20, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, 20, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, 20, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, 21, -1, 47, -1, -1, -1, 51, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, 20, 21, -1, -1, 47, -1, -1, 50, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 20, 21, 42, -1, -1, -1, -1, 47, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 20, 21, 42, -1, -1, -1, -1, 47, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 20, 21, 42, -1, -1, -1, -1, 47, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 20, 21, 42, -1, -1, -1, -1, 47, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 20, 21, 42, -1, -1, -1, -1, 47, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, 21, 42, -1, 24, -1, -1, 47, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, 21, 42, -1, 24, -1, -1, 47, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, 21, 42, -1, 24, -1, -1, 47, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, 21, 42, -1, 24, -1, -1, 47, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, 21, 22, -1, -1, 47, -1, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, 21, 22, -1, -1, 47, -1, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, 21, 42, -1, -1, -1, -1, 47, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47, 29, 30, 31, 32, 33, 34, 35, -1, -1, -1, -1, 40, 41, -1, -1, -1, -1, -1, 47, -1, -1, -1, -1, -1, 53, 29, 30, 31, 32, 33, 34, 35, -1, -1, -1, -1, 40, 41, -1, -1, -1, -1, -1, 47, -1, -1, -1, -1, -1, 53, 29, 30, 31, 32, 33, 34, 35, 29, 30, 31, 32, 33, 34, 35, 29, 30, 31, 32, 33, 34, 35, 25, 26, 27, 53, 29, 30, -1, -1, -1, -1, 53, -1, -1, 38, -1, -1, -1, 53, -1, -1, -1, -1, 47, 29, 30, 31, 32, 33, 34, 35, -1, -1, -1, -1, 40, 41, -1, -1, -1, -1, -1, 47, -1, -1, 50, 29, 30, 31, 32, 33, 34, 35, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, 50, 42, -1, -1, -1, -1, 47, 29, 30, 31, 32, 33, 34, 35, -1, -1, -1, -1, 40, 41, -1, -1, -1, -1, -1, 47, 31, 32, 33, 34, 35, 36, 37, 38, 39, 20, -1, 42, -1, -1, -1, -1, 47, -1, 29, 30, 31, 32, 33, 34, 35, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, -1, -1, 47 }; /* FFSTOS[STATE-NUM] -- The (internal number of the) accessing symbol of state STATE-NUM. */ static const fftype_uint8 ffstos[] = { 0, 55, 0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 23, 35, 36, 43, 44, 45, 50, 52, 56, 57, 58, 59, 60, 61, 62, 50, 53, 59, 60, 61, 62, 59, 60, 61, 62, 59, 60, 62, 6, 53, 6, 23, 23, 23, 23, 59, 60, 62, 59, 59, 60, 61, 59, 60, 59, 60, 59, 60, 61, 62, 20, 24, 20, 24, 21, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 42, 47, 50, 25, 26, 27, 29, 30, 38, 47, 50, 29, 30, 31, 32, 33, 34, 35, 40, 41, 47, 50, 29, 30, 31, 32, 33, 34, 35, 50, 20, 53, 20, 53, 53, 20, 53, 20, 53, 53, 53, 20, 20, 53, 20, 53, 59, 59, 59, 59, 53, 53, 53, 53, 59, 60, 59, 60, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 60, 59, 59, 59, 59, 60, 62, 60, 60, 60, 60, 59, 59, 43, 52, 61, 61, 61, 61, 61, 61, 61, 61, 61, 59, 62, 62, 62, 62, 62, 62, 62, 59, 60, 59, 62, 59, 62, 59, 59, 24, 24, 24, 24, 22, 20, 51, 22, 22, 22, 20, 51, 61, 61, 20, 51, 20, 53, 53, 20, 53, 20, 53, 20, 53, 20, 59, 59, 59, 60, 59, 60, 62, 59, 59, 59, 59, 59, 6, 59, 20, 51, 20, 51, 20, 51, 20, 53, 20, 53, 20, 20, 53, 59, 59, 59, 59, 59, 6, 6, 20, 51, 20, 51, 20, 51, 53, 20, 53, 53, 59, 59, 59, 59, 20, 51, 20, 51, 20, 51, 20, 53, 59, 59, 59, 59, 51, 51, 51, 20, 59, 53 }; #define fferrok (fferrstatus = 0) #define ffclearin (ffchar = FFEMPTY) #define FFEMPTY (-2) #define FFEOF 0 #define FFACCEPT goto ffacceptlab #define FFABORT goto ffabortlab #define FFERROR goto fferrorlab /* Like FFERROR except do call fferror. This remains here temporarily to ease the transition to the new meaning of FFERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define FFFAIL goto fferrlab #define FFRECOVERING() (!!fferrstatus) #define FFBACKUP(Token, Value) \ do \ if (ffchar == FFEMPTY && fflen == 1) \ { \ ffchar = (Token); \ fflval = (Value); \ fftoken = FFTRANSLATE (ffchar); \ FFPOPSTACK (1); \ goto ffbackup; \ } \ else \ { \ fferror (FF_("syntax error: cannot back up")); \ FFERROR; \ } \ while (FFID (0)) #define FFTERROR 1 #define FFERRCODE 256 /* FFLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. If N is 0, then set CURRENT to the empty location which ends the previous symbol: RHS[0] (always defined). */ #define FFRHSLOC(Rhs, K) ((Rhs)[K]) #ifndef FFLLOC_DEFAULT # define FFLLOC_DEFAULT(Current, Rhs, N) \ do \ if (FFID (N)) \ { \ (Current).first_line = FFRHSLOC (Rhs, 1).first_line; \ (Current).first_column = FFRHSLOC (Rhs, 1).first_column; \ (Current).last_line = FFRHSLOC (Rhs, N).last_line; \ (Current).last_column = FFRHSLOC (Rhs, N).last_column; \ } \ else \ { \ (Current).first_line = (Current).last_line = \ FFRHSLOC (Rhs, 0).last_line; \ (Current).first_column = (Current).last_column = \ FFRHSLOC (Rhs, 0).last_column; \ } \ while (FFID (0)) #endif /* FF_LOCATION_PRINT -- Print the location on the stream. This macro was not mandated originally: define only if we know we won't break user code: when these are the locations we know. */ #ifndef FF_LOCATION_PRINT # if FFLTYPE_IS_TRIVIAL # define FF_LOCATION_PRINT(File, Loc) \ fprintf (File, "%d.%d-%d.%d", \ (Loc).first_line, (Loc).first_column, \ (Loc).last_line, (Loc).last_column) # else # define FF_LOCATION_PRINT(File, Loc) ((void) 0) # endif #endif /* FFLEX -- calling `fflex' with the right arguments. */ #ifdef FFLEX_PARAM # define FFLEX fflex (FFLEX_PARAM) #else # define FFLEX fflex () #endif /* Enable debugging if requested. */ #if FFDEBUG # ifndef FFFPRINTF # include /* INFRINGES ON USER NAME SPACE */ # define FFFPRINTF fprintf # endif # define FFDPRINTF(Args) \ do { \ if (ffdebug) \ FFFPRINTF Args; \ } while (FFID (0)) # define FF_SYMBOL_PRINT(Title, Type, Value, Location) \ do { \ if (ffdebug) \ { \ FFFPRINTF (stderr, "%s ", Title); \ ff_symbol_print (stderr, \ Type, Value); \ FFFPRINTF (stderr, "\n"); \ } \ } while (FFID (0)) /*--------------------------------. | Print this symbol on FFOUTPUT. | `--------------------------------*/ /*ARGSUSED*/ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static void ff_symbol_value_print (FILE *ffoutput, int fftype, FFSTYPE const * const ffvaluep) #else static void ff_symbol_value_print (ffoutput, fftype, ffvaluep) FILE *ffoutput; int fftype; FFSTYPE const * const ffvaluep; #endif { if (!ffvaluep) return; # ifdef FFPRINT if (fftype < FFNTOKENS) FFPRINT (ffoutput, fftoknum[fftype], *ffvaluep); # else FFUSE (ffoutput); # endif switch (fftype) { default: break; } } /*--------------------------------. | Print this symbol on FFOUTPUT. | `--------------------------------*/ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static void ff_symbol_print (FILE *ffoutput, int fftype, FFSTYPE const * const ffvaluep) #else static void ff_symbol_print (ffoutput, fftype, ffvaluep) FILE *ffoutput; int fftype; FFSTYPE const * const ffvaluep; #endif { if (fftype < FFNTOKENS) FFFPRINTF (ffoutput, "token %s (", fftname[fftype]); else FFFPRINTF (ffoutput, "nterm %s (", fftname[fftype]); ff_symbol_value_print (ffoutput, fftype, ffvaluep); FFFPRINTF (ffoutput, ")"); } /*------------------------------------------------------------------. | ff_stack_print -- Print the state stack from its BOTTOM up to its | | TOP (included). | `------------------------------------------------------------------*/ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static void ff_stack_print (fftype_int16 *ffbottom, fftype_int16 *fftop) #else static void ff_stack_print (ffbottom, fftop) fftype_int16 *ffbottom; fftype_int16 *fftop; #endif { FFFPRINTF (stderr, "Stack now"); for (; ffbottom <= fftop; ffbottom++) { int ffbot = *ffbottom; FFFPRINTF (stderr, " %d", ffbot); } FFFPRINTF (stderr, "\n"); } # define FF_STACK_PRINT(Bottom, Top) \ do { \ if (ffdebug) \ ff_stack_print ((Bottom), (Top)); \ } while (FFID (0)) /*------------------------------------------------. | Report that the FFRULE is going to be reduced. | `------------------------------------------------*/ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static void ff_reduce_print (FFSTYPE *ffvsp, int ffrule) #else static void ff_reduce_print (ffvsp, ffrule) FFSTYPE *ffvsp; int ffrule; #endif { int ffnrhs = ffr2[ffrule]; int ffi; unsigned long int fflno = ffrline[ffrule]; FFFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", ffrule - 1, fflno); /* The symbols being reduced. */ for (ffi = 0; ffi < ffnrhs; ffi++) { FFFPRINTF (stderr, " $%d = ", ffi + 1); ff_symbol_print (stderr, ffrhs[ffprhs[ffrule] + ffi], &(ffvsp[(ffi + 1) - (ffnrhs)]) ); FFFPRINTF (stderr, "\n"); } } # define FF_REDUCE_PRINT(Rule) \ do { \ if (ffdebug) \ ff_reduce_print (ffvsp, Rule); \ } while (FFID (0)) /* Nonzero means print parse trace. It is left uninitialized so that multiple parsers can coexist. */ int ffdebug; #else /* !FFDEBUG */ # define FFDPRINTF(Args) # define FF_SYMBOL_PRINT(Title, Type, Value, Location) # define FF_STACK_PRINT(Bottom, Top) # define FF_REDUCE_PRINT(Rule) #endif /* !FFDEBUG */ /* FFINITDEPTH -- initial size of the parser's stacks. */ #ifndef FFINITDEPTH # define FFINITDEPTH 200 #endif /* FFMAXDEPTH -- maximum size the stacks can grow to (effective only if the built-in stack extension method is used). Do not make this value too large; the results are undefined if FFSTACK_ALLOC_MAXIMUM < FFSTACK_BYTES (FFMAXDEPTH) evaluated with infinite-precision integer arithmetic. */ #ifndef FFMAXDEPTH # define FFMAXDEPTH 10000 #endif #if FFERROR_VERBOSE # ifndef ffstrlen # if defined __GLIBC__ && defined _STRING_H # define ffstrlen strlen # else /* Return the length of FFSTR. */ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static FFSIZE_T ffstrlen (const char *ffstr) #else static FFSIZE_T ffstrlen (ffstr) const char *ffstr; #endif { FFSIZE_T fflen; for (fflen = 0; ffstr[fflen]; fflen++) continue; return fflen; } # endif # endif # ifndef ffstpcpy # if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE # define ffstpcpy stpcpy # else /* Copy FFSRC to FFDEST, returning the address of the terminating '\0' in FFDEST. */ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static char * ffstpcpy (char *ffdest, const char *ffsrc) #else static char * ffstpcpy (ffdest, ffsrc) char *ffdest; const char *ffsrc; #endif { char *ffd = ffdest; const char *ffs = ffsrc; while ((*ffd++ = *ffs++) != '\0') continue; return ffd - 1; } # endif # endif # ifndef fftnamerr /* Copy to FFRES the contents of FFSTR after stripping away unnecessary quotes and backslashes, so that it's suitable for fferror. The heuristic is that double-quoting is unnecessary unless the string contains an apostrophe, a comma, or backslash (other than backslash-backslash). FFSTR is taken from fftname. If FFRES is null, do not copy; instead, return the length of what the result would have been. */ static FFSIZE_T fftnamerr (char *ffres, const char *ffstr) { if (*ffstr == '"') { FFSIZE_T ffn = 0; char const *ffp = ffstr; for (;;) switch (*++ffp) { case '\'': case ',': goto do_not_strip_quotes; case '\\': if (*++ffp != '\\') goto do_not_strip_quotes; /* Fall through. */ default: if (ffres) ffres[ffn] = *ffp; ffn++; break; case '"': if (ffres) ffres[ffn] = '\0'; return ffn; } do_not_strip_quotes: ; } if (! ffres) return ffstrlen (ffstr); return ffstpcpy (ffres, ffstr) - ffres; } # endif /* Copy into FFRESULT an error message about the unexpected token FFCHAR while in state FFSTATE. Return the number of bytes copied, including the terminating null byte. If FFRESULT is null, do not copy anything; just return the number of bytes that would be copied. As a special case, return 0 if an ordinary "syntax error" message will do. Return FFSIZE_MAXIMUM if overflow occurs during size calculation. */ static FFSIZE_T ffsyntax_error (char *ffresult, int ffstate, int ffchar) { int ffn = ffpact[ffstate]; if (! (FFPACT_NINF < ffn && ffn <= FFLAST)) return 0; else { int fftype = FFTRANSLATE (ffchar); FFSIZE_T ffsize0 = fftnamerr (0, fftname[fftype]); FFSIZE_T ffsize = ffsize0; FFSIZE_T ffsize1; int ffsize_overflow = 0; enum { FFERROR_VERBOSE_ARGS_MAXIMUM = 5 }; char const *ffarg[FFERROR_VERBOSE_ARGS_MAXIMUM]; int ffx; # if 0 /* This is so xgettext sees the translatable formats that are constructed on the fly. */ FF_("syntax error, unexpected %s"); FF_("syntax error, unexpected %s, expecting %s"); FF_("syntax error, unexpected %s, expecting %s or %s"); FF_("syntax error, unexpected %s, expecting %s or %s or %s"); FF_("syntax error, unexpected %s, expecting %s or %s or %s or %s"); # endif char *fffmt; char const *fff; static char const ffunexpected[] = "syntax error, unexpected %s"; static char const ffexpecting[] = ", expecting %s"; static char const ffor[] = " or %s"; char ffformat[sizeof ffunexpected + sizeof ffexpecting - 1 + ((FFERROR_VERBOSE_ARGS_MAXIMUM - 2) * (sizeof ffor - 1))]; char const *ffprefix = ffexpecting; /* Start FFX at -FFN if negative to avoid negative indexes in FFCHECK. */ int ffxbegin = ffn < 0 ? -ffn : 0; /* Stay within bounds of both ffcheck and fftname. */ int ffchecklim = FFLAST - ffn + 1; int ffxend = ffchecklim < FFNTOKENS ? ffchecklim : FFNTOKENS; int ffcount = 1; ffarg[0] = fftname[fftype]; fffmt = ffstpcpy (ffformat, ffunexpected); for (ffx = ffxbegin; ffx < ffxend; ++ffx) if (ffcheck[ffx + ffn] == ffx && ffx != FFTERROR) { if (ffcount == FFERROR_VERBOSE_ARGS_MAXIMUM) { ffcount = 1; ffsize = ffsize0; ffformat[sizeof ffunexpected - 1] = '\0'; break; } ffarg[ffcount++] = fftname[ffx]; ffsize1 = ffsize + fftnamerr (0, fftname[ffx]); ffsize_overflow |= (ffsize1 < ffsize); ffsize = ffsize1; fffmt = ffstpcpy (fffmt, ffprefix); ffprefix = ffor; } fff = FF_(ffformat); ffsize1 = ffsize + ffstrlen (fff); ffsize_overflow |= (ffsize1 < ffsize); ffsize = ffsize1; if (ffsize_overflow) return FFSIZE_MAXIMUM; if (ffresult) { /* Avoid sprintf, as that infringes on the user's name space. Don't have undefined behavior even if the translation produced a string with the wrong number of "%s"s. */ char *ffp = ffresult; int ffi = 0; while ((*ffp = *fff) != '\0') { if (*ffp == '%' && fff[1] == 's' && ffi < ffcount) { ffp += fftnamerr (ffp, ffarg[ffi++]); fff += 2; } else { ffp++; fff++; } } } return ffsize; } } #endif /* FFERROR_VERBOSE */ /*-----------------------------------------------. | Release the memory associated to this symbol. | `-----------------------------------------------*/ /*ARGSUSED*/ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static void ffdestruct (const char *ffmsg, int fftype, FFSTYPE *ffvaluep) #else static void ffdestruct (ffmsg, fftype, ffvaluep) const char *ffmsg; int fftype; FFSTYPE *ffvaluep; #endif { FFUSE (ffvaluep); if (!ffmsg) ffmsg = "Deleting"; FF_SYMBOL_PRINT (ffmsg, fftype, ffvaluep, fflocationp); switch (fftype) { default: break; } } /* Prevent warnings from -Wmissing-prototypes. */ #ifdef FFPARSE_PARAM #if defined __STDC__ || defined __cplusplus int ffparse (void *FFPARSE_PARAM); #else int ffparse (); #endif #else /* ! FFPARSE_PARAM */ #if defined __STDC__ || defined __cplusplus int ffparse (void); #else int ffparse (); #endif #endif /* ! FFPARSE_PARAM */ /* The lookahead symbol. */ int ffchar; /* The semantic value of the lookahead symbol. */ FFSTYPE fflval; /* Number of syntax errors so far. */ int ffnerrs; /*-------------------------. | ffparse or ffpush_parse. | `-------------------------*/ #ifdef FFPARSE_PARAM #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) int ffparse (void *FFPARSE_PARAM) #else int ffparse (FFPARSE_PARAM) void *FFPARSE_PARAM; #endif #else /* ! FFPARSE_PARAM */ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) int ffparse (void) #else int ffparse () #endif #endif { int ffstate; /* Number of tokens to shift before error messages enabled. */ int fferrstatus; /* The stacks and their tools: `ffss': related to states. `ffvs': related to semantic values. Refer to the stacks thru separate pointers, to allow ffoverflow to reallocate them elsewhere. */ /* The state stack. */ fftype_int16 ffssa[FFINITDEPTH]; fftype_int16 *ffss; fftype_int16 *ffssp; /* The semantic value stack. */ FFSTYPE ffvsa[FFINITDEPTH]; FFSTYPE *ffvs; FFSTYPE *ffvsp; FFSIZE_T ffstacksize; int ffn; int ffresult; /* Lookahead token as an internal (translated) token number. */ int fftoken; /* The variables used to return semantic value and location from the action routines. */ FFSTYPE ffval; #if FFERROR_VERBOSE /* Buffer for error messages, and its allocated size. */ char ffmsgbuf[128]; char *ffmsg = ffmsgbuf; FFSIZE_T ffmsg_alloc = sizeof ffmsgbuf; #endif #define FFPOPSTACK(N) (ffvsp -= (N), ffssp -= (N)) /* The number of symbols on the RHS of the reduced rule. Keep to zero when no symbol should be popped. */ int fflen = 0; fftoken = 0; ffss = ffssa; ffvs = ffvsa; ffstacksize = FFINITDEPTH; FFDPRINTF ((stderr, "Starting parse\n")); ffstate = 0; fferrstatus = 0; ffnerrs = 0; ffchar = FFEMPTY; /* Cause a token to be read. */ /* Initialize stack pointers. Waste one element of value and location stack so that they stay on the same level as the state stack. The wasted elements are never initialized. */ ffssp = ffss; ffvsp = ffvs; goto ffsetstate; /*------------------------------------------------------------. | ffnewstate -- Push a new state, which is found in ffstate. | `------------------------------------------------------------*/ ffnewstate: /* In all cases, when you get here, the value and location stacks have just been pushed. So pushing a state here evens the stacks. */ ffssp++; ffsetstate: *ffssp = ffstate; if (ffss + ffstacksize - 1 <= ffssp) { /* Get the current used size of the three stacks, in elements. */ FFSIZE_T ffsize = ffssp - ffss + 1; #ifdef ffoverflow { /* Give user a chance to reallocate the stack. Use copies of these so that the &'s don't force the real ones into memory. */ FFSTYPE *ffvs1 = ffvs; fftype_int16 *ffss1 = ffss; /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. This used to be a conditional around just the two extra args, but that might be undefined if ffoverflow is a macro. */ ffoverflow (FF_("memory exhausted"), &ffss1, ffsize * sizeof (*ffssp), &ffvs1, ffsize * sizeof (*ffvsp), &ffstacksize); ffss = ffss1; ffvs = ffvs1; } #else /* no ffoverflow */ # ifndef FFSTACK_RELOCATE goto ffexhaustedlab; # else /* Extend the stack our own way. */ if (FFMAXDEPTH <= ffstacksize) goto ffexhaustedlab; ffstacksize *= 2; if (FFMAXDEPTH < ffstacksize) ffstacksize = FFMAXDEPTH; { fftype_int16 *ffss1 = ffss; union ffalloc *ffptr = (union ffalloc *) FFSTACK_ALLOC (FFSTACK_BYTES (ffstacksize)); if (! ffptr) goto ffexhaustedlab; FFSTACK_RELOCATE (ffss_alloc, ffss); FFSTACK_RELOCATE (ffvs_alloc, ffvs); # undef FFSTACK_RELOCATE if (ffss1 != ffssa) FFSTACK_FREE (ffss1); } # endif #endif /* no ffoverflow */ ffssp = ffss + ffsize - 1; ffvsp = ffvs + ffsize - 1; FFDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) ffstacksize)); if (ffss + ffstacksize - 1 <= ffssp) FFABORT; } FFDPRINTF ((stderr, "Entering state %d\n", ffstate)); if (ffstate == FFFINAL) FFACCEPT; goto ffbackup; /*-----------. | ffbackup. | `-----------*/ ffbackup: /* Do appropriate processing given the current state. Read a lookahead token if we need one and don't already have one. */ /* First try to decide what to do without reference to lookahead token. */ ffn = ffpact[ffstate]; if (ffn == FFPACT_NINF) goto ffdefault; /* Not known => get a lookahead token if don't already have one. */ /* FFCHAR is either FFEMPTY or FFEOF or a valid lookahead symbol. */ if (ffchar == FFEMPTY) { FFDPRINTF ((stderr, "Reading a token: ")); ffchar = FFLEX; } if (ffchar <= FFEOF) { ffchar = fftoken = FFEOF; FFDPRINTF ((stderr, "Now at end of input.\n")); } else { fftoken = FFTRANSLATE (ffchar); FF_SYMBOL_PRINT ("Next token is", fftoken, &fflval, &fflloc); } /* If the proper action on seeing token FFTOKEN is to reduce or to detect an error, take that action. */ ffn += fftoken; if (ffn < 0 || FFLAST < ffn || ffcheck[ffn] != fftoken) goto ffdefault; ffn = fftable[ffn]; if (ffn <= 0) { if (ffn == 0 || ffn == FFTABLE_NINF) goto fferrlab; ffn = -ffn; goto ffreduce; } /* Count tokens shifted since error; after three, turn off error status. */ if (fferrstatus) fferrstatus--; /* Shift the lookahead token. */ FF_SYMBOL_PRINT ("Shifting", fftoken, &fflval, &fflloc); /* Discard the shifted token. */ ffchar = FFEMPTY; ffstate = ffn; *++ffvsp = fflval; goto ffnewstate; /*-----------------------------------------------------------. | ffdefault -- do the default action for the current state. | `-----------------------------------------------------------*/ ffdefault: ffn = ffdefact[ffstate]; if (ffn == 0) goto fferrlab; goto ffreduce; /*-----------------------------. | ffreduce -- Do a reduction. | `-----------------------------*/ ffreduce: /* ffn is the number of a rule to reduce with. */ fflen = ffr2[ffn]; /* If FFLEN is nonzero, implement the default value of the action: `$$ = $1'. Otherwise, the following line sets FFVAL to garbage. This behavior is undocumented and Bison users should not rely upon it. Assigning to FFVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that FFVAL may be used uninitialized. */ ffval = ffvsp[1-fflen]; FF_REDUCE_PRINT (ffn); switch (ffn) { case 4: /* Line 1455 of yacc.c */ #line 248 "eval.y" {} break; case 5: /* Line 1455 of yacc.c */ #line 250 "eval.y" { if( (ffvsp[(1) - (2)].Node)<0 ) { fferror("Couldn't build node structure: out of memory?"); FFERROR; } gParse.resultNode = (ffvsp[(1) - (2)].Node); } break; case 6: /* Line 1455 of yacc.c */ #line 256 "eval.y" { if( (ffvsp[(1) - (2)].Node)<0 ) { fferror("Couldn't build node structure: out of memory?"); FFERROR; } gParse.resultNode = (ffvsp[(1) - (2)].Node); } break; case 7: /* Line 1455 of yacc.c */ #line 262 "eval.y" { if( (ffvsp[(1) - (2)].Node)<0 ) { fferror("Couldn't build node structure: out of memory?"); FFERROR; } gParse.resultNode = (ffvsp[(1) - (2)].Node); } break; case 8: /* Line 1455 of yacc.c */ #line 268 "eval.y" { if( (ffvsp[(1) - (2)].Node)<0 ) { fferror("Couldn't build node structure: out of memory?"); FFERROR; } gParse.resultNode = (ffvsp[(1) - (2)].Node); } break; case 9: /* Line 1455 of yacc.c */ #line 273 "eval.y" { fferrok; } break; case 10: /* Line 1455 of yacc.c */ #line 277 "eval.y" { (ffval.Node) = New_Vector( (ffvsp[(2) - (2)].Node) ); TEST((ffval.Node)); } break; case 11: /* Line 1455 of yacc.c */ #line 279 "eval.y" { if( gParse.Nodes[(ffvsp[(1) - (3)].Node)].nSubNodes >= MAXSUBS ) { (ffvsp[(1) - (3)].Node) = Close_Vec( (ffvsp[(1) - (3)].Node) ); TEST((ffvsp[(1) - (3)].Node)); (ffval.Node) = New_Vector( (ffvsp[(1) - (3)].Node) ); TEST((ffval.Node)); } else { (ffval.Node) = (ffvsp[(1) - (3)].Node); } gParse.Nodes[(ffval.Node)].SubNodes[ gParse.Nodes[(ffval.Node)].nSubNodes++ ] = (ffvsp[(3) - (3)].Node); } break; case 12: /* Line 1455 of yacc.c */ #line 292 "eval.y" { (ffval.Node) = New_Vector( (ffvsp[(2) - (2)].Node) ); TEST((ffval.Node)); } break; case 13: /* Line 1455 of yacc.c */ #line 294 "eval.y" { if( TYPE((ffvsp[(1) - (3)].Node)) < TYPE((ffvsp[(3) - (3)].Node)) ) TYPE((ffvsp[(1) - (3)].Node)) = TYPE((ffvsp[(3) - (3)].Node)); if( gParse.Nodes[(ffvsp[(1) - (3)].Node)].nSubNodes >= MAXSUBS ) { (ffvsp[(1) - (3)].Node) = Close_Vec( (ffvsp[(1) - (3)].Node) ); TEST((ffvsp[(1) - (3)].Node)); (ffval.Node) = New_Vector( (ffvsp[(1) - (3)].Node) ); TEST((ffval.Node)); } else { (ffval.Node) = (ffvsp[(1) - (3)].Node); } gParse.Nodes[(ffval.Node)].SubNodes[ gParse.Nodes[(ffval.Node)].nSubNodes++ ] = (ffvsp[(3) - (3)].Node); } break; case 14: /* Line 1455 of yacc.c */ #line 307 "eval.y" { if( gParse.Nodes[(ffvsp[(1) - (3)].Node)].nSubNodes >= MAXSUBS ) { (ffvsp[(1) - (3)].Node) = Close_Vec( (ffvsp[(1) - (3)].Node) ); TEST((ffvsp[(1) - (3)].Node)); (ffval.Node) = New_Vector( (ffvsp[(1) - (3)].Node) ); TEST((ffval.Node)); } else { (ffval.Node) = (ffvsp[(1) - (3)].Node); } gParse.Nodes[(ffval.Node)].SubNodes[ gParse.Nodes[(ffval.Node)].nSubNodes++ ] = (ffvsp[(3) - (3)].Node); } break; case 15: /* Line 1455 of yacc.c */ #line 318 "eval.y" { TYPE((ffvsp[(1) - (3)].Node)) = TYPE((ffvsp[(3) - (3)].Node)); if( gParse.Nodes[(ffvsp[(1) - (3)].Node)].nSubNodes >= MAXSUBS ) { (ffvsp[(1) - (3)].Node) = Close_Vec( (ffvsp[(1) - (3)].Node) ); TEST((ffvsp[(1) - (3)].Node)); (ffval.Node) = New_Vector( (ffvsp[(1) - (3)].Node) ); TEST((ffval.Node)); } else { (ffval.Node) = (ffvsp[(1) - (3)].Node); } gParse.Nodes[(ffval.Node)].SubNodes[ gParse.Nodes[(ffval.Node)].nSubNodes++ ] = (ffvsp[(3) - (3)].Node); } break; case 16: /* Line 1455 of yacc.c */ #line 332 "eval.y" { (ffval.Node) = Close_Vec( (ffvsp[(1) - (2)].Node) ); TEST((ffval.Node)); } break; case 17: /* Line 1455 of yacc.c */ #line 336 "eval.y" { (ffval.Node) = Close_Vec( (ffvsp[(1) - (2)].Node) ); TEST((ffval.Node)); } break; case 18: /* Line 1455 of yacc.c */ #line 340 "eval.y" { (ffval.Node) = New_Const( BITSTR, (ffvsp[(1) - (1)].str), strlen((ffvsp[(1) - (1)].str))+1 ); TEST((ffval.Node)); SIZE((ffval.Node)) = strlen((ffvsp[(1) - (1)].str)); } break; case 19: /* Line 1455 of yacc.c */ #line 344 "eval.y" { (ffval.Node) = New_Column( (ffvsp[(1) - (1)].lng) ); TEST((ffval.Node)); } break; case 20: /* Line 1455 of yacc.c */ #line 346 "eval.y" { if( TYPE((ffvsp[(3) - (4)].Node)) != LONG || OPER((ffvsp[(3) - (4)].Node)) != CONST_OP ) { fferror("Offset argument must be a constant integer"); FFERROR; } (ffval.Node) = New_Offset( (ffvsp[(1) - (4)].lng), (ffvsp[(3) - (4)].Node) ); TEST((ffval.Node)); } break; case 21: /* Line 1455 of yacc.c */ #line 355 "eval.y" { (ffval.Node) = New_BinOp( BITSTR, (ffvsp[(1) - (3)].Node), '&', (ffvsp[(3) - (3)].Node) ); TEST((ffval.Node)); SIZE((ffval.Node)) = ( SIZE((ffvsp[(1) - (3)].Node))>SIZE((ffvsp[(3) - (3)].Node)) ? SIZE((ffvsp[(1) - (3)].Node)) : SIZE((ffvsp[(3) - (3)].Node)) ); } break; case 22: /* Line 1455 of yacc.c */ #line 358 "eval.y" { (ffval.Node) = New_BinOp( BITSTR, (ffvsp[(1) - (3)].Node), '|', (ffvsp[(3) - (3)].Node) ); TEST((ffval.Node)); SIZE((ffval.Node)) = ( SIZE((ffvsp[(1) - (3)].Node))>SIZE((ffvsp[(3) - (3)].Node)) ? SIZE((ffvsp[(1) - (3)].Node)) : SIZE((ffvsp[(3) - (3)].Node)) ); } break; case 23: /* Line 1455 of yacc.c */ #line 361 "eval.y" { if (SIZE((ffvsp[(1) - (3)].Node))+SIZE((ffvsp[(3) - (3)].Node)) >= MAX_STRLEN) { fferror("Combined bit string size exceeds " MAX_STRLEN_S " bits"); FFERROR; } (ffval.Node) = New_BinOp( BITSTR, (ffvsp[(1) - (3)].Node), '+', (ffvsp[(3) - (3)].Node) ); TEST((ffval.Node)); SIZE((ffval.Node)) = SIZE((ffvsp[(1) - (3)].Node)) + SIZE((ffvsp[(3) - (3)].Node)); } break; case 24: /* Line 1455 of yacc.c */ #line 370 "eval.y" { (ffval.Node) = New_Deref( (ffvsp[(1) - (4)].Node), 1, (ffvsp[(3) - (4)].Node), 0, 0, 0, 0 ); TEST((ffval.Node)); } break; case 25: /* Line 1455 of yacc.c */ #line 372 "eval.y" { (ffval.Node) = New_Deref( (ffvsp[(1) - (6)].Node), 2, (ffvsp[(3) - (6)].Node), (ffvsp[(5) - (6)].Node), 0, 0, 0 ); TEST((ffval.Node)); } break; case 26: /* Line 1455 of yacc.c */ #line 374 "eval.y" { (ffval.Node) = New_Deref( (ffvsp[(1) - (8)].Node), 3, (ffvsp[(3) - (8)].Node), (ffvsp[(5) - (8)].Node), (ffvsp[(7) - (8)].Node), 0, 0 ); TEST((ffval.Node)); } break; case 27: /* Line 1455 of yacc.c */ #line 376 "eval.y" { (ffval.Node) = New_Deref( (ffvsp[(1) - (10)].Node), 4, (ffvsp[(3) - (10)].Node), (ffvsp[(5) - (10)].Node), (ffvsp[(7) - (10)].Node), (ffvsp[(9) - (10)].Node), 0 ); TEST((ffval.Node)); } break; case 28: /* Line 1455 of yacc.c */ #line 378 "eval.y" { (ffval.Node) = New_Deref( (ffvsp[(1) - (12)].Node), 5, (ffvsp[(3) - (12)].Node), (ffvsp[(5) - (12)].Node), (ffvsp[(7) - (12)].Node), (ffvsp[(9) - (12)].Node), (ffvsp[(11) - (12)].Node) ); TEST((ffval.Node)); } break; case 29: /* Line 1455 of yacc.c */ #line 380 "eval.y" { (ffval.Node) = New_Unary( BITSTR, NOT, (ffvsp[(2) - (2)].Node) ); TEST((ffval.Node)); } break; case 30: /* Line 1455 of yacc.c */ #line 383 "eval.y" { (ffval.Node) = (ffvsp[(2) - (3)].Node); } break; case 31: /* Line 1455 of yacc.c */ #line 387 "eval.y" { (ffval.Node) = New_Const( LONG, &((ffvsp[(1) - (1)].lng)), sizeof(long) ); TEST((ffval.Node)); } break; case 32: /* Line 1455 of yacc.c */ #line 389 "eval.y" { (ffval.Node) = New_Const( DOUBLE, &((ffvsp[(1) - (1)].dbl)), sizeof(double) ); TEST((ffval.Node)); } break; case 33: /* Line 1455 of yacc.c */ #line 391 "eval.y" { (ffval.Node) = New_Column( (ffvsp[(1) - (1)].lng) ); TEST((ffval.Node)); } break; case 34: /* Line 1455 of yacc.c */ #line 393 "eval.y" { if( TYPE((ffvsp[(3) - (4)].Node)) != LONG || OPER((ffvsp[(3) - (4)].Node)) != CONST_OP ) { fferror("Offset argument must be a constant integer"); FFERROR; } (ffval.Node) = New_Offset( (ffvsp[(1) - (4)].lng), (ffvsp[(3) - (4)].Node) ); TEST((ffval.Node)); } break; case 35: /* Line 1455 of yacc.c */ #line 402 "eval.y" { (ffval.Node) = New_Func( LONG, row_fct, 0, 0, 0, 0, 0, 0, 0, 0 ); } break; case 36: /* Line 1455 of yacc.c */ #line 404 "eval.y" { (ffval.Node) = New_Func( LONG, null_fct, 0, 0, 0, 0, 0, 0, 0, 0 ); } break; case 37: /* Line 1455 of yacc.c */ #line 406 "eval.y" { PROMOTE((ffvsp[(1) - (3)].Node),(ffvsp[(3) - (3)].Node)); (ffval.Node) = New_BinOp( TYPE((ffvsp[(1) - (3)].Node)), (ffvsp[(1) - (3)].Node), '%', (ffvsp[(3) - (3)].Node) ); TEST((ffval.Node)); } break; case 38: /* Line 1455 of yacc.c */ #line 409 "eval.y" { PROMOTE((ffvsp[(1) - (3)].Node),(ffvsp[(3) - (3)].Node)); (ffval.Node) = New_BinOp( TYPE((ffvsp[(1) - (3)].Node)), (ffvsp[(1) - (3)].Node), '+', (ffvsp[(3) - (3)].Node) ); TEST((ffval.Node)); } break; case 39: /* Line 1455 of yacc.c */ #line 412 "eval.y" { PROMOTE((ffvsp[(1) - (3)].Node),(ffvsp[(3) - (3)].Node)); (ffval.Node) = New_BinOp( TYPE((ffvsp[(1) - (3)].Node)), (ffvsp[(1) - (3)].Node), '-', (ffvsp[(3) - (3)].Node) ); TEST((ffval.Node)); } break; case 40: /* Line 1455 of yacc.c */ #line 415 "eval.y" { PROMOTE((ffvsp[(1) - (3)].Node),(ffvsp[(3) - (3)].Node)); (ffval.Node) = New_BinOp( TYPE((ffvsp[(1) - (3)].Node)), (ffvsp[(1) - (3)].Node), '*', (ffvsp[(3) - (3)].Node) ); TEST((ffval.Node)); } break; case 41: /* Line 1455 of yacc.c */ #line 418 "eval.y" { PROMOTE((ffvsp[(1) - (3)].Node),(ffvsp[(3) - (3)].Node)); (ffval.Node) = New_BinOp( TYPE((ffvsp[(1) - (3)].Node)), (ffvsp[(1) - (3)].Node), '/', (ffvsp[(3) - (3)].Node) ); TEST((ffval.Node)); } break; case 42: /* Line 1455 of yacc.c */ #line 421 "eval.y" { PROMOTE((ffvsp[(1) - (3)].Node),(ffvsp[(3) - (3)].Node)); (ffval.Node) = New_BinOp( TYPE((ffvsp[(1) - (3)].Node)), (ffvsp[(1) - (3)].Node), POWER, (ffvsp[(3) - (3)].Node) ); TEST((ffval.Node)); } break; case 43: /* Line 1455 of yacc.c */ #line 424 "eval.y" { (ffval.Node) = (ffvsp[(2) - (2)].Node); } break; case 44: /* Line 1455 of yacc.c */ #line 426 "eval.y" { (ffval.Node) = New_Unary( TYPE((ffvsp[(2) - (2)].Node)), UMINUS, (ffvsp[(2) - (2)].Node) ); TEST((ffval.Node)); } break; case 45: /* Line 1455 of yacc.c */ #line 428 "eval.y" { (ffval.Node) = (ffvsp[(2) - (3)].Node); } break; case 46: /* Line 1455 of yacc.c */ #line 430 "eval.y" { (ffvsp[(3) - (3)].Node) = New_Unary( TYPE((ffvsp[(1) - (3)].Node)), 0, (ffvsp[(3) - (3)].Node) ); (ffval.Node) = New_BinOp( TYPE((ffvsp[(1) - (3)].Node)), (ffvsp[(1) - (3)].Node), '*', (ffvsp[(3) - (3)].Node) ); TEST((ffval.Node)); } break; case 47: /* Line 1455 of yacc.c */ #line 434 "eval.y" { (ffvsp[(1) - (3)].Node) = New_Unary( TYPE((ffvsp[(3) - (3)].Node)), 0, (ffvsp[(1) - (3)].Node) ); (ffval.Node) = New_BinOp( TYPE((ffvsp[(3) - (3)].Node)), (ffvsp[(1) - (3)].Node), '*', (ffvsp[(3) - (3)].Node) ); TEST((ffval.Node)); } break; case 48: /* Line 1455 of yacc.c */ #line 438 "eval.y" { PROMOTE((ffvsp[(3) - (5)].Node),(ffvsp[(5) - (5)].Node)); if( ! Test_Dims((ffvsp[(3) - (5)].Node),(ffvsp[(5) - (5)].Node)) ) { fferror("Incompatible dimensions in '?:' arguments"); FFERROR; } (ffval.Node) = New_Func( 0, ifthenelse_fct, 3, (ffvsp[(3) - (5)].Node), (ffvsp[(5) - (5)].Node), (ffvsp[(1) - (5)].Node), 0, 0, 0, 0 ); TEST((ffval.Node)); if( SIZE((ffvsp[(3) - (5)].Node))=SIZE((ffvsp[(4) - (5)].Node)) && Test_Dims( (ffvsp[(2) - (5)].Node), (ffvsp[(4) - (5)].Node) ) ) { PROMOTE((ffvsp[(2) - (5)].Node),(ffvsp[(4) - (5)].Node)); (ffval.Node) = New_Func( 0, defnull_fct, 2, (ffvsp[(2) - (5)].Node), (ffvsp[(4) - (5)].Node), 0, 0, 0, 0, 0 ); TEST((ffval.Node)); } else { fferror("Dimensions of DEFNULL arguments " "are not compatible"); FFERROR; } } else if (FSTRCMP((ffvsp[(1) - (5)].str),"ARCTAN2(") == 0) { if( TYPE((ffvsp[(2) - (5)].Node)) != DOUBLE ) (ffvsp[(2) - (5)].Node) = New_Unary( DOUBLE, 0, (ffvsp[(2) - (5)].Node) ); if( TYPE((ffvsp[(4) - (5)].Node)) != DOUBLE ) (ffvsp[(4) - (5)].Node) = New_Unary( DOUBLE, 0, (ffvsp[(4) - (5)].Node) ); if( Test_Dims( (ffvsp[(2) - (5)].Node), (ffvsp[(4) - (5)].Node) ) ) { (ffval.Node) = New_Func( 0, atan2_fct, 2, (ffvsp[(2) - (5)].Node), (ffvsp[(4) - (5)].Node), 0, 0, 0, 0, 0 ); TEST((ffval.Node)); if( SIZE((ffvsp[(2) - (5)].Node))=SIZE((ffvsp[(4) - (5)].Node)) && Test_Dims( (ffvsp[(2) - (5)].Node), (ffvsp[(4) - (5)].Node) ) ) { (ffval.Node) = New_Func( 0, defnull_fct, 2, (ffvsp[(2) - (5)].Node), (ffvsp[(4) - (5)].Node), 0, 0, 0, 0, 0 ); TEST((ffval.Node)); } else { fferror("Dimensions of DEFNULL arguments are not compatible"); FFERROR; } } else { fferror("Boolean Function(expr,expr) not supported"); FFERROR; } } break; case 100: /* Line 1455 of yacc.c */ #line 928 "eval.y" { if( TYPE((ffvsp[(2) - (7)].Node)) != DOUBLE ) (ffvsp[(2) - (7)].Node) = New_Unary( DOUBLE, 0, (ffvsp[(2) - (7)].Node) ); if( TYPE((ffvsp[(4) - (7)].Node)) != DOUBLE ) (ffvsp[(4) - (7)].Node) = New_Unary( DOUBLE, 0, (ffvsp[(4) - (7)].Node) ); if( TYPE((ffvsp[(6) - (7)].Node)) != DOUBLE ) (ffvsp[(6) - (7)].Node) = New_Unary( DOUBLE, 0, (ffvsp[(6) - (7)].Node) ); if( ! (Test_Dims( (ffvsp[(2) - (7)].Node), (ffvsp[(4) - (7)].Node) ) && Test_Dims( (ffvsp[(4) - (7)].Node), (ffvsp[(6) - (7)].Node) ) ) ) { fferror("Dimensions of NEAR arguments " "are not compatible"); FFERROR; } else { if (FSTRCMP((ffvsp[(1) - (7)].str),"NEAR(") == 0) { (ffval.Node) = New_Func( BOOLEAN, near_fct, 3, (ffvsp[(2) - (7)].Node), (ffvsp[(4) - (7)].Node), (ffvsp[(6) - (7)].Node), 0, 0, 0, 0 ); } else { fferror("Boolean Function not supported"); FFERROR; } TEST((ffval.Node)); if( SIZE((ffval.Node))= MAX_STRLEN) { fferror("Combined string size exceeds " MAX_STRLEN_S " characters"); FFERROR; } (ffval.Node) = New_BinOp( STRING, (ffvsp[(1) - (3)].Node), '+', (ffvsp[(3) - (3)].Node) ); TEST((ffval.Node)); SIZE((ffval.Node)) = SIZE((ffvsp[(1) - (3)].Node)) + SIZE((ffvsp[(3) - (3)].Node)); } break; case 123: /* Line 1455 of yacc.c */ #line 1086 "eval.y" { int outSize; if( SIZE((ffvsp[(1) - (5)].Node))!=1 ) { fferror("Cannot have a vector string column"); FFERROR; } /* Since the output can be calculated now, as a constant scalar, we must precalculate the output size, in order to avoid an overflow. */ outSize = SIZE((ffvsp[(3) - (5)].Node)); if (SIZE((ffvsp[(5) - (5)].Node)) > outSize) outSize = SIZE((ffvsp[(5) - (5)].Node)); (ffval.Node) = New_FuncSize( 0, ifthenelse_fct, 3, (ffvsp[(3) - (5)].Node), (ffvsp[(5) - (5)].Node), (ffvsp[(1) - (5)].Node), 0, 0, 0, 0, outSize); TEST((ffval.Node)); if( SIZE((ffvsp[(3) - (5)].Node)) outSize) outSize = SIZE((ffvsp[(4) - (5)].Node)); (ffval.Node) = New_FuncSize( 0, defnull_fct, 2, (ffvsp[(2) - (5)].Node), (ffvsp[(4) - (5)].Node), 0, 0, 0, 0, 0, outSize ); TEST((ffval.Node)); if( SIZE((ffvsp[(4) - (5)].Node))>SIZE((ffvsp[(2) - (5)].Node)) ) SIZE((ffval.Node)) = SIZE((ffvsp[(4) - (5)].Node)); } else { fferror("Function(string,string) not supported"); FFERROR; } } break; case 125: /* Line 1455 of yacc.c */ #line 1124 "eval.y" { if (FSTRCMP((ffvsp[(1) - (7)].str),"STRMID(") == 0) { int len; if( TYPE((ffvsp[(4) - (7)].Node)) != LONG || SIZE((ffvsp[(4) - (7)].Node)) != 1 || TYPE((ffvsp[(6) - (7)].Node)) != LONG || SIZE((ffvsp[(6) - (7)].Node)) != 1) { fferror("When using STRMID(S,P,N), P and N must be integers (and not vector columns)"); FFERROR; } if (OPER((ffvsp[(6) - (7)].Node)) == CONST_OP) { /* Constant value: use that directly */ len = (gParse.Nodes[(ffvsp[(6) - (7)].Node)].value.data.lng); } else { /* Variable value: use the maximum possible (from $2) */ len = SIZE((ffvsp[(2) - (7)].Node)); } if (len <= 0 || len >= MAX_STRLEN) { fferror("STRMID(S,P,N), N must be 1-" MAX_STRLEN_S); FFERROR; } (ffval.Node) = New_FuncSize( 0, strmid_fct, 3, (ffvsp[(2) - (7)].Node), (ffvsp[(4) - (7)].Node),(ffvsp[(6) - (7)].Node),0,0,0,0,len); TEST((ffval.Node)); } else { fferror("Function(string,expr,expr) not supported"); FFERROR; } } break; /* Line 1455 of yacc.c */ #line 3584 "y.tab.c" default: break; } FF_SYMBOL_PRINT ("-> $$ =", ffr1[ffn], &ffval, &ffloc); FFPOPSTACK (fflen); fflen = 0; FF_STACK_PRINT (ffss, ffssp); *++ffvsp = ffval; /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ ffn = ffr1[ffn]; ffstate = ffpgoto[ffn - FFNTOKENS] + *ffssp; if (0 <= ffstate && ffstate <= FFLAST && ffcheck[ffstate] == *ffssp) ffstate = fftable[ffstate]; else ffstate = ffdefgoto[ffn - FFNTOKENS]; goto ffnewstate; /*------------------------------------. | fferrlab -- here on detecting error | `------------------------------------*/ fferrlab: /* If not already recovering from an error, report this error. */ if (!fferrstatus) { ++ffnerrs; #if ! FFERROR_VERBOSE fferror (FF_("syntax error")); #else { FFSIZE_T ffsize = ffsyntax_error (0, ffstate, ffchar); if (ffmsg_alloc < ffsize && ffmsg_alloc < FFSTACK_ALLOC_MAXIMUM) { FFSIZE_T ffalloc = 2 * ffsize; if (! (ffsize <= ffalloc && ffalloc <= FFSTACK_ALLOC_MAXIMUM)) ffalloc = FFSTACK_ALLOC_MAXIMUM; if (ffmsg != ffmsgbuf) FFSTACK_FREE (ffmsg); ffmsg = (char *) FFSTACK_ALLOC (ffalloc); if (ffmsg) ffmsg_alloc = ffalloc; else { ffmsg = ffmsgbuf; ffmsg_alloc = sizeof ffmsgbuf; } } if (0 < ffsize && ffsize <= ffmsg_alloc) { (void) ffsyntax_error (ffmsg, ffstate, ffchar); fferror (ffmsg); } else { fferror (FF_("syntax error")); if (ffsize != 0) goto ffexhaustedlab; } } #endif } if (fferrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ if (ffchar <= FFEOF) { /* Return failure if at end of input. */ if (ffchar == FFEOF) FFABORT; } else { ffdestruct ("Error: discarding", fftoken, &fflval); ffchar = FFEMPTY; } } /* Else will try to reuse lookahead token after shifting the error token. */ goto fferrlab1; /*---------------------------------------------------. | fferrorlab -- error raised explicitly by FFERROR. | `---------------------------------------------------*/ fferrorlab: /* Pacify compilers like GCC when the user code never invokes FFERROR and the label fferrorlab therefore never appears in user code. */ if (/*CONSTCOND*/ 0) goto fferrorlab; /* Do not reclaim the symbols of the rule which action triggered this FFERROR. */ FFPOPSTACK (fflen); fflen = 0; FF_STACK_PRINT (ffss, ffssp); ffstate = *ffssp; goto fferrlab1; /*-------------------------------------------------------------. | fferrlab1 -- common code for both syntax error and FFERROR. | `-------------------------------------------------------------*/ fferrlab1: fferrstatus = 3; /* Each real token shifted decrements this. */ for (;;) { ffn = ffpact[ffstate]; if (ffn != FFPACT_NINF) { ffn += FFTERROR; if (0 <= ffn && ffn <= FFLAST && ffcheck[ffn] == FFTERROR) { ffn = fftable[ffn]; if (0 < ffn) break; } } /* Pop the current state because it cannot handle the error token. */ if (ffssp == ffss) FFABORT; ffdestruct ("Error: popping", ffstos[ffstate], ffvsp); FFPOPSTACK (1); ffstate = *ffssp; FF_STACK_PRINT (ffss, ffssp); } *++ffvsp = fflval; /* Shift the error token. */ FF_SYMBOL_PRINT ("Shifting", ffstos[ffn], ffvsp, fflsp); ffstate = ffn; goto ffnewstate; /*-------------------------------------. | ffacceptlab -- FFACCEPT comes here. | `-------------------------------------*/ ffacceptlab: ffresult = 0; goto ffreturn; /*-----------------------------------. | ffabortlab -- FFABORT comes here. | `-----------------------------------*/ ffabortlab: ffresult = 1; goto ffreturn; #if !defined(ffoverflow) || FFERROR_VERBOSE /*-------------------------------------------------. | ffexhaustedlab -- memory exhaustion comes here. | `-------------------------------------------------*/ ffexhaustedlab: fferror (FF_("memory exhausted")); ffresult = 2; /* Fall through. */ #endif ffreturn: if (ffchar != FFEMPTY) ffdestruct ("Cleanup: discarding lookahead", fftoken, &fflval); /* Do not reclaim the symbols of the rule which action triggered this FFABORT or FFACCEPT. */ FFPOPSTACK (fflen); FF_STACK_PRINT (ffss, ffssp); while (ffssp != ffss) { ffdestruct ("Cleanup: popping", ffstos[*ffssp], ffvsp); FFPOPSTACK (1); } #ifndef ffoverflow if (ffss != ffssa) FFSTACK_FREE (ffss); #endif #if FFERROR_VERBOSE if (ffmsg != ffmsgbuf) FFSTACK_FREE (ffmsg); #endif /* Make sure FFID is used. */ return FFID (ffresult); } /* Line 1675 of yacc.c */ #line 1153 "eval.y" /*************************************************************************/ /* Start of "New" routines which build the expression Nodal structure */ /*************************************************************************/ static int Alloc_Node( void ) { /* Use this for allocation to guarantee *Nodes */ Node *newNodePtr; /* survives on failure, making it still valid */ /* while working our way out of this error */ if( gParse.nNodes == gParse.nNodesAlloc ) { if( gParse.Nodes ) { gParse.nNodesAlloc += gParse.nNodesAlloc; newNodePtr = (Node *)realloc( gParse.Nodes, sizeof(Node)*gParse.nNodesAlloc ); } else { gParse.nNodesAlloc = 100; newNodePtr = (Node *)malloc ( sizeof(Node)*gParse.nNodesAlloc ); } if( newNodePtr ) { gParse.Nodes = newNodePtr; } else { gParse.status = MEMORY_ALLOCATION; return( -1 ); } } return ( gParse.nNodes++ ); } static void Free_Last_Node( void ) { if( gParse.nNodes ) gParse.nNodes--; } static int New_Const( int returnType, void *value, long len ) { Node *this; int n; n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->operation = CONST_OP; /* Flag a constant */ this->DoOp = NULL; this->nSubNodes = 0; this->type = returnType; memcpy( &(this->value.data), value, len ); this->value.undef = NULL; this->value.nelem = 1; this->value.naxis = 1; this->value.naxes[0] = 1; } return(n); } static int New_Column( int ColNum ) { Node *this; int n, i; n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->operation = -ColNum; this->DoOp = NULL; this->nSubNodes = 0; this->type = gParse.varData[ColNum].type; this->value.nelem = gParse.varData[ColNum].nelem; this->value.naxis = gParse.varData[ColNum].naxis; for( i=0; ivalue.naxes[i] = gParse.varData[ColNum].naxes[i]; } return(n); } static int New_Offset( int ColNum, int offsetNode ) { Node *this; int n, i, colNode; colNode = New_Column( ColNum ); if( colNode<0 ) return(-1); n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->operation = '{'; this->DoOp = Do_Offset; this->nSubNodes = 2; this->SubNodes[0] = colNode; this->SubNodes[1] = offsetNode; this->type = gParse.varData[ColNum].type; this->value.nelem = gParse.varData[ColNum].nelem; this->value.naxis = gParse.varData[ColNum].naxis; for( i=0; ivalue.naxes[i] = gParse.varData[ColNum].naxes[i]; } return(n); } static int New_Unary( int returnType, int Op, int Node1 ) { Node *this, *that; int i,n; if( Node1<0 ) return(-1); that = gParse.Nodes + Node1; if( !Op ) Op = returnType; if( (Op==DOUBLE || Op==FLTCAST) && that->type==DOUBLE ) return( Node1 ); if( (Op==LONG || Op==INTCAST) && that->type==LONG ) return( Node1 ); if( (Op==BOOLEAN ) && that->type==BOOLEAN ) return( Node1 ); n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->operation = Op; this->DoOp = Do_Unary; this->nSubNodes = 1; this->SubNodes[0] = Node1; this->type = returnType; that = gParse.Nodes + Node1; /* Reset in case .Nodes mv'd */ this->value.nelem = that->value.nelem; this->value.naxis = that->value.naxis; for( i=0; ivalue.naxis; i++ ) this->value.naxes[i] = that->value.naxes[i]; if( that->operation==CONST_OP ) this->DoOp( this ); } return( n ); } static int New_BinOp( int returnType, int Node1, int Op, int Node2 ) { Node *this,*that1,*that2; int n,i,constant; if( Node1<0 || Node2<0 ) return(-1); n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->operation = Op; this->nSubNodes = 2; this->SubNodes[0]= Node1; this->SubNodes[1]= Node2; this->type = returnType; that1 = gParse.Nodes + Node1; that2 = gParse.Nodes + Node2; constant = (that1->operation==CONST_OP && that2->operation==CONST_OP); if( that1->type!=STRING && that1->type!=BITSTR ) if( !Test_Dims( Node1, Node2 ) ) { Free_Last_Node(); fferror("Array sizes/dims do not match for binary operator"); return(-1); } if( that1->value.nelem == 1 ) that1 = that2; this->value.nelem = that1->value.nelem; this->value.naxis = that1->value.naxis; for( i=0; ivalue.naxis; i++ ) this->value.naxes[i] = that1->value.naxes[i]; if ( Op == ACCUM && that1->type == BITSTR ) { /* ACCUM is rank-reducing on bit strings */ this->value.nelem = 1; this->value.naxis = 1; this->value.naxes[0] = 1; } /* Both subnodes should be of same time */ switch( that1->type ) { case BITSTR: this->DoOp = Do_BinOp_bit; break; case STRING: this->DoOp = Do_BinOp_str; break; case BOOLEAN: this->DoOp = Do_BinOp_log; break; case LONG: this->DoOp = Do_BinOp_lng; break; case DOUBLE: this->DoOp = Do_BinOp_dbl; break; } if( constant ) this->DoOp( this ); } return( n ); } static int New_Func( int returnType, funcOp Op, int nNodes, int Node1, int Node2, int Node3, int Node4, int Node5, int Node6, int Node7 ) { return New_FuncSize(returnType, Op, nNodes, Node1, Node2, Node3, Node4, Node5, Node6, Node7, 0); } static int New_FuncSize( int returnType, funcOp Op, int nNodes, int Node1, int Node2, int Node3, int Node4, int Node5, int Node6, int Node7, int Size ) /* If returnType==0 , use Node1's type and vector sizes as returnType, */ /* else return a single value of type returnType */ { Node *this, *that; int i,n,constant; if( Node1<0 || Node2<0 || Node3<0 || Node4<0 || Node5<0 || Node6<0 || Node7<0 ) return(-1); n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->operation = (int)Op; this->DoOp = Do_Func; this->nSubNodes = nNodes; this->SubNodes[0] = Node1; this->SubNodes[1] = Node2; this->SubNodes[2] = Node3; this->SubNodes[3] = Node4; this->SubNodes[4] = Node5; this->SubNodes[5] = Node6; this->SubNodes[6] = Node7; i = constant = nNodes; /* Functions with zero params are not const */ if (Op == poirnd_fct) constant = 0; /* Nor is Poisson deviate */ while( i-- ) constant = ( constant && OPER(this->SubNodes[i]) == CONST_OP ); if( returnType ) { this->type = returnType; this->value.nelem = 1; this->value.naxis = 1; this->value.naxes[0] = 1; } else { that = gParse.Nodes + Node1; this->type = that->type; this->value.nelem = that->value.nelem; this->value.naxis = that->value.naxis; for( i=0; ivalue.naxis; i++ ) this->value.naxes[i] = that->value.naxes[i]; } /* Force explicit size before evaluating */ if (Size > 0) this->value.nelem = Size; if( constant ) this->DoOp( this ); } return( n ); } static int New_Deref( int Var, int nDim, int Dim1, int Dim2, int Dim3, int Dim4, int Dim5 ) { int n, idx, constant; long elem=0; Node *this, *theVar, *theDim[MAXDIMS]; if( Var<0 || Dim1<0 || Dim2<0 || Dim3<0 || Dim4<0 || Dim5<0 ) return(-1); theVar = gParse.Nodes + Var; if( theVar->operation==CONST_OP || theVar->value.nelem==1 ) { fferror("Cannot index a scalar value"); return(-1); } n = Alloc_Node(); if( n>=0 ) { this = gParse.Nodes + n; this->nSubNodes = nDim+1; theVar = gParse.Nodes + (this->SubNodes[0]=Var); theDim[0] = gParse.Nodes + (this->SubNodes[1]=Dim1); theDim[1] = gParse.Nodes + (this->SubNodes[2]=Dim2); theDim[2] = gParse.Nodes + (this->SubNodes[3]=Dim3); theDim[3] = gParse.Nodes + (this->SubNodes[4]=Dim4); theDim[4] = gParse.Nodes + (this->SubNodes[5]=Dim5); constant = theVar->operation==CONST_OP; for( idx=0; idxoperation==CONST_OP); for( idx=0; idxvalue.nelem>1 ) { Free_Last_Node(); fferror("Cannot use an array as an index value"); return(-1); } else if( theDim[idx]->type!=LONG ) { Free_Last_Node(); fferror("Index value must be an integer type"); return(-1); } this->operation = '['; this->DoOp = Do_Deref; this->type = theVar->type; if( theVar->value.naxis == nDim ) { /* All dimensions specified */ this->value.nelem = 1; this->value.naxis = 1; this->value.naxes[0] = 1; } else if( nDim==1 ) { /* Dereference only one dimension */ elem=1; this->value.naxis = theVar->value.naxis-1; for( idx=0; idxvalue.naxis; idx++ ) { elem *= ( this->value.naxes[idx] = theVar->value.naxes[idx] ); } this->value.nelem = elem; } else { Free_Last_Node(); fferror("Must specify just one or all indices for vector"); return(-1); } if( constant ) this->DoOp( this ); } return(n); } extern int ffGetVariable( char *varName, FFSTYPE *varVal ); static int New_GTI( char *fname, int Node1, char *start, char *stop ) { fitsfile *fptr; Node *this, *that0, *that1; int type,i,n, startCol, stopCol, Node0; int hdutype, hdunum, evthdu, samefile, extvers, movetotype, tstat; char extname[100]; long nrows; double timeZeroI[2], timeZeroF[2], dt, timeSpan; char xcol[20], xexpr[20]; FFSTYPE colVal; if( Node1==-99 ) { type = ffGetVariable( "TIME", &colVal ); if( type==COLUMN ) { Node1 = New_Column( (int)colVal.lng ); } else { fferror("Could not build TIME column for GTIFILTER"); return(-1); } } Node1 = New_Unary( DOUBLE, 0, Node1 ); Node0 = Alloc_Node(); /* This will hold the START/STOP times */ if( Node1<0 || Node0<0 ) return(-1); /* Record current HDU number in case we need to move within this file */ fptr = gParse.def_fptr; ffghdn( fptr, &evthdu ); /* Look for TIMEZERO keywords in current extension */ tstat = 0; if( ffgkyd( fptr, "TIMEZERO", timeZeroI, NULL, &tstat ) ) { tstat = 0; if( ffgkyd( fptr, "TIMEZERI", timeZeroI, NULL, &tstat ) ) { timeZeroI[0] = timeZeroF[0] = 0.0; } else if( ffgkyd( fptr, "TIMEZERF", timeZeroF, NULL, &tstat ) ) { timeZeroF[0] = 0.0; } } else { timeZeroF[0] = 0.0; } /* Resolve filename parameter */ switch( fname[0] ) { case '\0': samefile = 1; hdunum = 1; break; case '[': samefile = 1; i = 1; while( fname[i] != '\0' && fname[i] != ']' ) i++; if( fname[i] ) { fname[i] = '\0'; fname++; ffexts( fname, &hdunum, extname, &extvers, &movetotype, xcol, xexpr, &gParse.status ); if( *extname ) { ffmnhd( fptr, movetotype, extname, extvers, &gParse.status ); ffghdn( fptr, &hdunum ); } else if( hdunum ) { ffmahd( fptr, ++hdunum, &hdutype, &gParse.status ); } else if( !gParse.status ) { fferror("Cannot use primary array for GTI filter"); return( -1 ); } } else { fferror("File extension specifier lacks closing ']'"); return( -1 ); } break; case '+': samefile = 1; hdunum = atoi( fname ) + 1; if( hdunum>1 ) ffmahd( fptr, hdunum, &hdutype, &gParse.status ); else { fferror("Cannot use primary array for GTI filter"); return( -1 ); } break; default: samefile = 0; if( ! ffopen( &fptr, fname, READONLY, &gParse.status ) ) ffghdn( fptr, &hdunum ); break; } if( gParse.status ) return(-1); /* If at primary, search for GTI extension */ if( hdunum==1 ) { while( 1 ) { hdunum++; if( ffmahd( fptr, hdunum, &hdutype, &gParse.status ) ) break; if( hdutype==IMAGE_HDU ) continue; tstat = 0; if( ffgkys( fptr, "EXTNAME", extname, NULL, &tstat ) ) continue; ffupch( extname ); if( strstr( extname, "GTI" ) ) break; } if( gParse.status ) { if( gParse.status==END_OF_FILE ) fferror("GTI extension not found in this file"); return(-1); } } /* Locate START/STOP Columns */ ffgcno( fptr, CASEINSEN, start, &startCol, &gParse.status ); ffgcno( fptr, CASEINSEN, stop, &stopCol, &gParse.status ); if( gParse.status ) return(-1); /* Look for TIMEZERO keywords in GTI extension */ tstat = 0; if( ffgkyd( fptr, "TIMEZERO", timeZeroI+1, NULL, &tstat ) ) { tstat = 0; if( ffgkyd( fptr, "TIMEZERI", timeZeroI+1, NULL, &tstat ) ) { timeZeroI[1] = timeZeroF[1] = 0.0; } else if( ffgkyd( fptr, "TIMEZERF", timeZeroF+1, NULL, &tstat ) ) { timeZeroF[1] = 0.0; } } else { timeZeroF[1] = 0.0; } n = Alloc_Node(); if( n >= 0 ) { this = gParse.Nodes + n; this->nSubNodes = 2; this->SubNodes[1] = Node1; this->operation = (int)gtifilt_fct; this->DoOp = Do_GTI; this->type = BOOLEAN; that1 = gParse.Nodes + Node1; this->value.nelem = that1->value.nelem; this->value.naxis = that1->value.naxis; for( i=0; i < that1->value.naxis; i++ ) this->value.naxes[i] = that1->value.naxes[i]; /* Init START/STOP node to be treated as a "constant" */ this->SubNodes[0] = Node0; that0 = gParse.Nodes + Node0; that0->operation = CONST_OP; that0->DoOp = NULL; that0->value.data.ptr= NULL; /* Read in START/STOP times */ if( ffgkyj( fptr, "NAXIS2", &nrows, NULL, &gParse.status ) ) return(-1); that0->value.nelem = nrows; if( nrows ) { that0->value.data.dblptr = (double*)malloc( 2*nrows*sizeof(double) ); if( !that0->value.data.dblptr ) { gParse.status = MEMORY_ALLOCATION; return(-1); } ffgcvd( fptr, startCol, 1L, 1L, nrows, 0.0, that0->value.data.dblptr, &i, &gParse.status ); ffgcvd( fptr, stopCol, 1L, 1L, nrows, 0.0, that0->value.data.dblptr+nrows, &i, &gParse.status ); if( gParse.status ) { free( that0->value.data.dblptr ); return(-1); } /* Test for fully time-ordered GTI... both START && STOP */ that0->type = 1; /* Assume yes */ i = nrows; while( --i ) if( that0->value.data.dblptr[i-1] >= that0->value.data.dblptr[i] || that0->value.data.dblptr[i-1+nrows] >= that0->value.data.dblptr[i+nrows] ) { that0->type = 0; break; } /* Handle TIMEZERO offset, if any */ dt = (timeZeroI[1] - timeZeroI[0]) + (timeZeroF[1] - timeZeroF[0]); timeSpan = that0->value.data.dblptr[nrows+nrows-1] - that0->value.data.dblptr[0]; if( fabs( dt / timeSpan ) > 1e-12 ) { for( i=0; i<(nrows+nrows); i++ ) that0->value.data.dblptr[i] += dt; } } if( OPER(Node1)==CONST_OP ) this->DoOp( this ); } if( samefile ) ffmahd( fptr, evthdu, &hdutype, &gParse.status ); else ffclos( fptr, &gParse.status ); return( n ); } static int New_REG( char *fname, int NodeX, int NodeY, char *colNames ) { Node *this, *that0; int type, n, Node0; int Xcol, Ycol, tstat; WCSdata wcs; SAORegion *Rgn; char *cX, *cY; FFSTYPE colVal; if( NodeX==-99 ) { type = ffGetVariable( "X", &colVal ); if( type==COLUMN ) { NodeX = New_Column( (int)colVal.lng ); } else { fferror("Could not build X column for REGFILTER"); return(-1); } } if( NodeY==-99 ) { type = ffGetVariable( "Y", &colVal ); if( type==COLUMN ) { NodeY = New_Column( (int)colVal.lng ); } else { fferror("Could not build Y column for REGFILTER"); return(-1); } } NodeX = New_Unary( DOUBLE, 0, NodeX ); NodeY = New_Unary( DOUBLE, 0, NodeY ); Node0 = Alloc_Node(); /* This will hold the Region Data */ if( NodeX<0 || NodeY<0 || Node0<0 ) return(-1); if( ! (Test_Dims( NodeX, NodeY ) ) ) { fferror("Dimensions of REGFILTER arguments are not compatible"); return (-1); } n = Alloc_Node(); if( n >= 0 ) { this = gParse.Nodes + n; this->nSubNodes = 3; this->SubNodes[0] = Node0; this->SubNodes[1] = NodeX; this->SubNodes[2] = NodeY; this->operation = (int)regfilt_fct; this->DoOp = Do_REG; this->type = BOOLEAN; this->value.nelem = 1; this->value.naxis = 1; this->value.naxes[0] = 1; Copy_Dims(n, NodeX); if( SIZE(NodeX)operation = CONST_OP; that0->DoOp = NULL; /* Identify what columns to use for WCS information */ Xcol = Ycol = 0; if( *colNames ) { /* Use the column names in this string for WCS info */ while( *colNames==' ' ) colNames++; cX = cY = colNames; while( *cY && *cY!=' ' && *cY!=',' ) cY++; if( *cY ) *(cY++) = '\0'; while( *cY==' ' ) cY++; if( !*cY ) { fferror("Could not extract valid pair of column names from REGFILTER"); Free_Last_Node(); return( -1 ); } fits_get_colnum( gParse.def_fptr, CASEINSEN, cX, &Xcol, &gParse.status ); fits_get_colnum( gParse.def_fptr, CASEINSEN, cY, &Ycol, &gParse.status ); if( gParse.status ) { fferror("Could not locate columns indicated for WCS info"); Free_Last_Node(); return( -1 ); } } else { /* Try to find columns used in X/Y expressions */ Xcol = Locate_Col( gParse.Nodes + NodeX ); Ycol = Locate_Col( gParse.Nodes + NodeY ); if( Xcol<0 || Ycol<0 ) { fferror("Found multiple X/Y column references in REGFILTER"); Free_Last_Node(); return( -1 ); } } /* Now, get the WCS info, if it exists, from the indicated columns */ wcs.exists = 0; if( Xcol>0 && Ycol>0 ) { tstat = 0; ffgtcs( gParse.def_fptr, Xcol, Ycol, &wcs.xrefval, &wcs.yrefval, &wcs.xrefpix, &wcs.yrefpix, &wcs.xinc, &wcs.yinc, &wcs.rot, wcs.type, &tstat ); if( tstat==NO_WCS_KEY ) { wcs.exists = 0; } else if( tstat ) { gParse.status = tstat; Free_Last_Node(); return( -1 ); } else { wcs.exists = 1; } } /* Read in Region file */ fits_read_rgnfile( fname, &wcs, &Rgn, &gParse.status ); if( gParse.status ) { Free_Last_Node(); return( -1 ); } that0->value.data.ptr = Rgn; if( OPER(NodeX)==CONST_OP && OPER(NodeY)==CONST_OP ) this->DoOp( this ); } return( n ); } static int New_Vector( int subNode ) { Node *this, *that; int n; n = Alloc_Node(); if( n >= 0 ) { this = gParse.Nodes + n; that = gParse.Nodes + subNode; this->type = that->type; this->nSubNodes = 1; this->SubNodes[0] = subNode; this->operation = '{'; this->DoOp = Do_Vector; } return( n ); } static int Close_Vec( int vecNode ) { Node *this; int n, nelem=0; this = gParse.Nodes + vecNode; for( n=0; n < this->nSubNodes; n++ ) { if( TYPE( this->SubNodes[n] ) != this->type ) { this->SubNodes[n] = New_Unary( this->type, 0, this->SubNodes[n] ); if( this->SubNodes[n]<0 ) return(-1); } nelem += SIZE(this->SubNodes[n]); } this->value.naxis = 1; this->value.nelem = nelem; this->value.naxes[0] = nelem; return( vecNode ); } static int Locate_Col( Node *this ) /* Locate the TABLE column number of any columns in "this" calculation. */ /* Return ZERO if none found, or negative if more than 1 found. */ { Node *that; int i, col=0, newCol, nfound=0; if( this->nSubNodes==0 && this->operation<=0 && this->operation!=CONST_OP ) return gParse.colData[ - this->operation].colnum; for( i=0; inSubNodes; i++ ) { that = gParse.Nodes + this->SubNodes[i]; if( that->operation>0 ) { newCol = Locate_Col( that ); if( newCol<=0 ) { nfound += -newCol; } else { if( !nfound ) { col = newCol; nfound++; } else if( col != newCol ) { nfound++; } } } else if( that->operation!=CONST_OP ) { /* Found a Column */ newCol = gParse.colData[- that->operation].colnum; if( !nfound ) { col = newCol; nfound++; } else if( col != newCol ) { nfound++; } } } if( nfound!=1 ) return( - nfound ); else return( col ); } static int Test_Dims( int Node1, int Node2 ) { Node *that1, *that2; int valid, i; if( Node1<0 || Node2<0 ) return(0); that1 = gParse.Nodes + Node1; that2 = gParse.Nodes + Node2; if( that1->value.nelem==1 || that2->value.nelem==1 ) valid = 1; else if( that1->type==that2->type && that1->value.nelem==that2->value.nelem && that1->value.naxis==that2->value.naxis ) { valid = 1; for( i=0; ivalue.naxis; i++ ) { if( that1->value.naxes[i]!=that2->value.naxes[i] ) valid = 0; } } else valid = 0; return( valid ); } static void Copy_Dims( int Node1, int Node2 ) { Node *that1, *that2; int i; if( Node1<0 || Node2<0 ) return; that1 = gParse.Nodes + Node1; that2 = gParse.Nodes + Node2; that1->value.nelem = that2->value.nelem; that1->value.naxis = that2->value.naxis; for( i=0; ivalue.naxis; i++ ) that1->value.naxes[i] = that2->value.naxes[i]; } /********************************************************************/ /* Routines for actually evaluating the expression start here */ /********************************************************************/ void Evaluate_Parser( long firstRow, long nRows ) /***********************************************************************/ /* Reset the parser for processing another batch of data... */ /* firstRow: Row number of the first element to evaluate */ /* nRows: Number of rows to be processed */ /* Initialize each COLUMN node so that its UNDEF and DATA pointers */ /* point to the appropriate column arrays. */ /* Finally, call Evaluate_Node for final node. */ /***********************************************************************/ { int i, column; long offset, rowOffset; static int rand_initialized = 0; /* Initialize the random number generator once and only once */ if (rand_initialized == 0) { simplerng_srand( (unsigned int) time(NULL) ); rand_initialized = 1; } gParse.firstRow = firstRow; gParse.nRows = nRows; /* Reset Column Nodes' pointers to point to right data and UNDEF arrays */ rowOffset = firstRow - gParse.firstDataRow; for( i=0; i 0 || OPER(i) == CONST_OP ) continue; column = -OPER(i); offset = gParse.varData[column].nelem * rowOffset; gParse.Nodes[i].value.undef = gParse.varData[column].undef + offset; switch( gParse.Nodes[i].type ) { case BITSTR: gParse.Nodes[i].value.data.strptr = (char**)gParse.varData[column].data + rowOffset; gParse.Nodes[i].value.undef = NULL; break; case STRING: gParse.Nodes[i].value.data.strptr = (char**)gParse.varData[column].data + rowOffset; gParse.Nodes[i].value.undef = gParse.varData[column].undef + rowOffset; break; case BOOLEAN: gParse.Nodes[i].value.data.logptr = (char*)gParse.varData[column].data + offset; break; case LONG: gParse.Nodes[i].value.data.lngptr = (long*)gParse.varData[column].data + offset; break; case DOUBLE: gParse.Nodes[i].value.data.dblptr = (double*)gParse.varData[column].data + offset; break; } } Evaluate_Node( gParse.resultNode ); } static void Evaluate_Node( int thisNode ) /**********************************************************************/ /* Recursively evaluate thisNode's subNodes, then call one of the */ /* Do_ functions pointed to by thisNode's DoOp element. */ /**********************************************************************/ { Node *this; int i; if( gParse.status ) return; this = gParse.Nodes + thisNode; if( this->operation>0 ) { /* <=0 indicate constants and columns */ i = this->nSubNodes; while( i-- ) { Evaluate_Node( this->SubNodes[i] ); if( gParse.status ) return; } this->DoOp( this ); } } static void Allocate_Ptrs( Node *this ) { long elem, row, size; if( this->type==BITSTR || this->type==STRING ) { this->value.data.strptr = (char**)malloc( gParse.nRows * sizeof(char*) ); if( this->value.data.strptr ) { this->value.data.strptr[0] = (char*)malloc( gParse.nRows * (this->value.nelem+2) * sizeof(char) ); if( this->value.data.strptr[0] ) { row = 0; while( (++row)value.data.strptr[row] = this->value.data.strptr[row-1] + this->value.nelem+1; } if( this->type==STRING ) { this->value.undef = this->value.data.strptr[row-1] + this->value.nelem+1; } else { this->value.undef = NULL; /* BITSTRs don't use undef array */ } } else { gParse.status = MEMORY_ALLOCATION; free( this->value.data.strptr ); } } else { gParse.status = MEMORY_ALLOCATION; } } else { elem = this->value.nelem * gParse.nRows; switch( this->type ) { case DOUBLE: size = sizeof( double ); break; case LONG: size = sizeof( long ); break; case BOOLEAN: size = sizeof( char ); break; default: size = 1; break; } this->value.data.ptr = calloc(size+1, elem); if( this->value.data.ptr==NULL ) { gParse.status = MEMORY_ALLOCATION; } else { this->value.undef = (char *)this->value.data.ptr + elem*size; } } } static void Do_Unary( Node *this ) { Node *that; long elem; that = gParse.Nodes + this->SubNodes[0]; if( that->operation==CONST_OP ) { /* Operating on a constant! */ switch( this->operation ) { case DOUBLE: case FLTCAST: if( that->type==LONG ) this->value.data.dbl = (double)that->value.data.lng; else if( that->type==BOOLEAN ) this->value.data.dbl = ( that->value.data.log ? 1.0 : 0.0 ); break; case LONG: case INTCAST: if( that->type==DOUBLE ) this->value.data.lng = (long)that->value.data.dbl; else if( that->type==BOOLEAN ) this->value.data.lng = ( that->value.data.log ? 1L : 0L ); break; case BOOLEAN: if( that->type==DOUBLE ) this->value.data.log = ( that->value.data.dbl != 0.0 ); else if( that->type==LONG ) this->value.data.log = ( that->value.data.lng != 0L ); break; case UMINUS: if( that->type==DOUBLE ) this->value.data.dbl = - that->value.data.dbl; else if( that->type==LONG ) this->value.data.lng = - that->value.data.lng; break; case NOT: if( that->type==BOOLEAN ) this->value.data.log = ( ! that->value.data.log ); else if( that->type==BITSTR ) bitnot( this->value.data.str, that->value.data.str ); break; } this->operation = CONST_OP; } else { Allocate_Ptrs( this ); if( !gParse.status ) { if( this->type!=BITSTR ) { elem = gParse.nRows; if( this->type!=STRING ) elem *= this->value.nelem; while( elem-- ) this->value.undef[elem] = that->value.undef[elem]; } elem = gParse.nRows * this->value.nelem; switch( this->operation ) { case BOOLEAN: if( that->type==DOUBLE ) while( elem-- ) this->value.data.logptr[elem] = ( that->value.data.dblptr[elem] != 0.0 ); else if( that->type==LONG ) while( elem-- ) this->value.data.logptr[elem] = ( that->value.data.lngptr[elem] != 0L ); break; case DOUBLE: case FLTCAST: if( that->type==LONG ) while( elem-- ) this->value.data.dblptr[elem] = (double)that->value.data.lngptr[elem]; else if( that->type==BOOLEAN ) while( elem-- ) this->value.data.dblptr[elem] = ( that->value.data.logptr[elem] ? 1.0 : 0.0 ); break; case LONG: case INTCAST: if( that->type==DOUBLE ) while( elem-- ) this->value.data.lngptr[elem] = (long)that->value.data.dblptr[elem]; else if( that->type==BOOLEAN ) while( elem-- ) this->value.data.lngptr[elem] = ( that->value.data.logptr[elem] ? 1L : 0L ); break; case UMINUS: if( that->type==DOUBLE ) { while( elem-- ) this->value.data.dblptr[elem] = - that->value.data.dblptr[elem]; } else if( that->type==LONG ) { while( elem-- ) this->value.data.lngptr[elem] = - that->value.data.lngptr[elem]; } break; case NOT: if( that->type==BOOLEAN ) { while( elem-- ) this->value.data.logptr[elem] = ( ! that->value.data.logptr[elem] ); } else if( that->type==BITSTR ) { elem = gParse.nRows; while( elem-- ) bitnot( this->value.data.strptr[elem], that->value.data.strptr[elem] ); } break; } } } if( that->operation>0 ) { free( that->value.data.ptr ); } } static void Do_Offset( Node *this ) { Node *col; long fRow, nRowOverlap, nRowReload, rowOffset; long nelem, elem, offset, nRealElem; int status; col = gParse.Nodes + this->SubNodes[0]; rowOffset = gParse.Nodes[ this->SubNodes[1] ].value.data.lng; Allocate_Ptrs( this ); fRow = gParse.firstRow + rowOffset; if( this->type==STRING || this->type==BITSTR ) nRealElem = 1; else nRealElem = this->value.nelem; nelem = nRealElem; if( fRow < gParse.firstDataRow ) { /* Must fill in data at start of array */ nRowReload = gParse.firstDataRow - fRow; if( nRowReload > gParse.nRows ) nRowReload = gParse.nRows; nRowOverlap = gParse.nRows - nRowReload; offset = 0; /* NULLify any values falling out of bounds */ while( fRow<1 && nRowReload>0 ) { if( this->type == BITSTR ) { nelem = this->value.nelem; this->value.data.strptr[offset][ nelem ] = '\0'; while( nelem-- ) this->value.data.strptr[offset][nelem] = '0'; offset++; } else { while( nelem-- ) this->value.undef[offset++] = 1; } nelem = nRealElem; fRow++; nRowReload--; } } else if( fRow + gParse.nRows > gParse.firstDataRow + gParse.nDataRows ) { /* Must fill in data at end of array */ nRowReload = (fRow+gParse.nRows) - (gParse.firstDataRow+gParse.nDataRows); if( nRowReload>gParse.nRows ) { nRowReload = gParse.nRows; } else { fRow = gParse.firstDataRow + gParse.nDataRows; } nRowOverlap = gParse.nRows - nRowReload; offset = nRowOverlap * nelem; /* NULLify any values falling out of bounds */ elem = gParse.nRows * nelem; while( fRow+nRowReload>gParse.totalRows && nRowReload>0 ) { if( this->type == BITSTR ) { nelem = this->value.nelem; elem--; this->value.data.strptr[elem][ nelem ] = '\0'; while( nelem-- ) this->value.data.strptr[elem][nelem] = '0'; } else { while( nelem-- ) this->value.undef[--elem] = 1; } nelem = nRealElem; nRowReload--; } } else { nRowReload = 0; nRowOverlap = gParse.nRows; offset = 0; } if( nRowReload>0 ) { switch( this->type ) { case BITSTR: case STRING: status = (*gParse.loadData)( -col->operation, fRow, nRowReload, this->value.data.strptr+offset, this->value.undef+offset ); break; case BOOLEAN: status = (*gParse.loadData)( -col->operation, fRow, nRowReload, this->value.data.logptr+offset, this->value.undef+offset ); break; case LONG: status = (*gParse.loadData)( -col->operation, fRow, nRowReload, this->value.data.lngptr+offset, this->value.undef+offset ); break; case DOUBLE: status = (*gParse.loadData)( -col->operation, fRow, nRowReload, this->value.data.dblptr+offset, this->value.undef+offset ); break; } } /* Now copy over the overlapping region, if any */ if( nRowOverlap <= 0 ) return; if( rowOffset>0 ) elem = nRowOverlap * nelem; else elem = gParse.nRows * nelem; offset = nelem * rowOffset; while( nRowOverlap-- && !gParse.status ) { while( nelem-- && !gParse.status ) { elem--; if( this->type != BITSTR ) this->value.undef[elem] = col->value.undef[elem+offset]; switch( this->type ) { case BITSTR: strcpy( this->value.data.strptr[elem ], col->value.data.strptr[elem+offset] ); break; case STRING: strcpy( this->value.data.strptr[elem ], col->value.data.strptr[elem+offset] ); break; case BOOLEAN: this->value.data.logptr[elem] = col->value.data.logptr[elem+offset]; break; case LONG: this->value.data.lngptr[elem] = col->value.data.lngptr[elem+offset]; break; case DOUBLE: this->value.data.dblptr[elem] = col->value.data.dblptr[elem+offset]; break; } } nelem = nRealElem; } } static void Do_BinOp_bit( Node *this ) { Node *that1, *that2; char *sptr1=NULL, *sptr2=NULL; int const1, const2; long rows; that1 = gParse.Nodes + this->SubNodes[0]; that2 = gParse.Nodes + this->SubNodes[1]; const1 = ( that1->operation==CONST_OP ); const2 = ( that2->operation==CONST_OP ); sptr1 = ( const1 ? that1->value.data.str : NULL ); sptr2 = ( const2 ? that2->value.data.str : NULL ); if( const1 && const2 ) { switch( this->operation ) { case NE: this->value.data.log = !bitcmp( sptr1, sptr2 ); break; case EQ: this->value.data.log = bitcmp( sptr1, sptr2 ); break; case GT: case LT: case LTE: case GTE: this->value.data.log = bitlgte( sptr1, this->operation, sptr2 ); break; case '|': bitor( this->value.data.str, sptr1, sptr2 ); break; case '&': bitand( this->value.data.str, sptr1, sptr2 ); break; case '+': strcpy( this->value.data.str, sptr1 ); strcat( this->value.data.str, sptr2 ); break; case ACCUM: this->value.data.lng = 0; while( *sptr1 ) { if ( *sptr1 == '1' ) this->value.data.lng ++; sptr1 ++; } break; } this->operation = CONST_OP; } else { Allocate_Ptrs( this ); if( !gParse.status ) { rows = gParse.nRows; switch( this->operation ) { /* BITSTR comparisons */ case NE: case EQ: case GT: case LT: case LTE: case GTE: while( rows-- ) { if( !const1 ) sptr1 = that1->value.data.strptr[rows]; if( !const2 ) sptr2 = that2->value.data.strptr[rows]; switch( this->operation ) { case NE: this->value.data.logptr[rows] = !bitcmp( sptr1, sptr2 ); break; case EQ: this->value.data.logptr[rows] = bitcmp( sptr1, sptr2 ); break; case GT: case LT: case LTE: case GTE: this->value.data.logptr[rows] = bitlgte( sptr1, this->operation, sptr2 ); break; } this->value.undef[rows] = 0; } break; /* BITSTR AND/ORs ... no UNDEFS in or out */ case '|': case '&': case '+': while( rows-- ) { if( !const1 ) sptr1 = that1->value.data.strptr[rows]; if( !const2 ) sptr2 = that2->value.data.strptr[rows]; if( this->operation=='|' ) bitor( this->value.data.strptr[rows], sptr1, sptr2 ); else if( this->operation=='&' ) bitand( this->value.data.strptr[rows], sptr1, sptr2 ); else { strcpy( this->value.data.strptr[rows], sptr1 ); strcat( this->value.data.strptr[rows], sptr2 ); } } break; /* Accumulate 1 bits */ case ACCUM: { long i, previous, curr; previous = that2->value.data.lng; /* Cumulative sum of this chunk */ for (i=0; ivalue.data.strptr[i]; for (curr = 0; *sptr1; sptr1 ++) { if ( *sptr1 == '1' ) curr ++; } previous += curr; this->value.data.lngptr[i] = previous; this->value.undef[i] = 0; } /* Store final cumulant for next pass */ that2->value.data.lng = previous; } } } } if( that1->operation>0 ) { free( that1->value.data.strptr[0] ); free( that1->value.data.strptr ); } if( that2->operation>0 ) { free( that2->value.data.strptr[0] ); free( that2->value.data.strptr ); } } static void Do_BinOp_str( Node *this ) { Node *that1, *that2; char *sptr1, *sptr2, null1=0, null2=0; int const1, const2, val; long rows; that1 = gParse.Nodes + this->SubNodes[0]; that2 = gParse.Nodes + this->SubNodes[1]; const1 = ( that1->operation==CONST_OP ); const2 = ( that2->operation==CONST_OP ); sptr1 = ( const1 ? that1->value.data.str : NULL ); sptr2 = ( const2 ? that2->value.data.str : NULL ); if( const1 && const2 ) { /* Result is a constant */ switch( this->operation ) { /* Compare Strings */ case NE: case EQ: val = ( FSTRCMP( sptr1, sptr2 ) == 0 ); this->value.data.log = ( this->operation==EQ ? val : !val ); break; case GT: this->value.data.log = ( FSTRCMP( sptr1, sptr2 ) > 0 ); break; case LT: this->value.data.log = ( FSTRCMP( sptr1, sptr2 ) < 0 ); break; case GTE: this->value.data.log = ( FSTRCMP( sptr1, sptr2 ) >= 0 ); break; case LTE: this->value.data.log = ( FSTRCMP( sptr1, sptr2 ) <= 0 ); break; /* Concat Strings */ case '+': strcpy( this->value.data.str, sptr1 ); strcat( this->value.data.str, sptr2 ); break; } this->operation = CONST_OP; } else { /* Not a constant */ Allocate_Ptrs( this ); if( !gParse.status ) { rows = gParse.nRows; switch( this->operation ) { /* Compare Strings */ case NE: case EQ: while( rows-- ) { if( !const1 ) null1 = that1->value.undef[rows]; if( !const2 ) null2 = that2->value.undef[rows]; this->value.undef[rows] = (null1 || null2); if( ! this->value.undef[rows] ) { if( !const1 ) sptr1 = that1->value.data.strptr[rows]; if( !const2 ) sptr2 = that2->value.data.strptr[rows]; val = ( FSTRCMP( sptr1, sptr2 ) == 0 ); this->value.data.logptr[rows] = ( this->operation==EQ ? val : !val ); } } break; case GT: case LT: while( rows-- ) { if( !const1 ) null1 = that1->value.undef[rows]; if( !const2 ) null2 = that2->value.undef[rows]; this->value.undef[rows] = (null1 || null2); if( ! this->value.undef[rows] ) { if( !const1 ) sptr1 = that1->value.data.strptr[rows]; if( !const2 ) sptr2 = that2->value.data.strptr[rows]; val = ( FSTRCMP( sptr1, sptr2 ) ); this->value.data.logptr[rows] = ( this->operation==GT ? val>0 : val<0 ); } } break; case GTE: case LTE: while( rows-- ) { if( !const1 ) null1 = that1->value.undef[rows]; if( !const2 ) null2 = that2->value.undef[rows]; this->value.undef[rows] = (null1 || null2); if( ! this->value.undef[rows] ) { if( !const1 ) sptr1 = that1->value.data.strptr[rows]; if( !const2 ) sptr2 = that2->value.data.strptr[rows]; val = ( FSTRCMP( sptr1, sptr2 ) ); this->value.data.logptr[rows] = ( this->operation==GTE ? val>=0 : val<=0 ); } } break; /* Concat Strings */ case '+': while( rows-- ) { if( !const1 ) null1 = that1->value.undef[rows]; if( !const2 ) null2 = that2->value.undef[rows]; this->value.undef[rows] = (null1 || null2); if( ! this->value.undef[rows] ) { if( !const1 ) sptr1 = that1->value.data.strptr[rows]; if( !const2 ) sptr2 = that2->value.data.strptr[rows]; strcpy( this->value.data.strptr[rows], sptr1 ); strcat( this->value.data.strptr[rows], sptr2 ); } } break; } } } if( that1->operation>0 ) { free( that1->value.data.strptr[0] ); free( that1->value.data.strptr ); } if( that2->operation>0 ) { free( that2->value.data.strptr[0] ); free( that2->value.data.strptr ); } } static void Do_BinOp_log( Node *this ) { Node *that1, *that2; int vector1, vector2; char val1=0, val2=0, null1=0, null2=0; long rows, nelem, elem; that1 = gParse.Nodes + this->SubNodes[0]; that2 = gParse.Nodes + this->SubNodes[1]; vector1 = ( that1->operation!=CONST_OP ); if( vector1 ) vector1 = that1->value.nelem; else { val1 = that1->value.data.log; } vector2 = ( that2->operation!=CONST_OP ); if( vector2 ) vector2 = that2->value.nelem; else { val2 = that2->value.data.log; } if( !vector1 && !vector2 ) { /* Result is a constant */ switch( this->operation ) { case OR: this->value.data.log = (val1 || val2); break; case AND: this->value.data.log = (val1 && val2); break; case EQ: this->value.data.log = ( (val1 && val2) || (!val1 && !val2) ); break; case NE: this->value.data.log = ( (val1 && !val2) || (!val1 && val2) ); break; case ACCUM: this->value.data.lng = val1; break; } this->operation=CONST_OP; } else if (this->operation == ACCUM) { long i, previous, curr; rows = gParse.nRows; nelem = this->value.nelem; elem = this->value.nelem * rows; Allocate_Ptrs( this ); if( !gParse.status ) { previous = that2->value.data.lng; /* Cumulative sum of this chunk */ for (i=0; ivalue.undef[i]) { curr = that1->value.data.logptr[i]; previous += curr; } this->value.data.lngptr[i] = previous; this->value.undef[i] = 0; } /* Store final cumulant for next pass */ that2->value.data.lng = previous; } } else { rows = gParse.nRows; nelem = this->value.nelem; elem = this->value.nelem * rows; Allocate_Ptrs( this ); if( !gParse.status ) { if (this->operation == ACCUM) { long i, previous, curr; previous = that2->value.data.lng; /* Cumulative sum of this chunk */ for (i=0; ivalue.undef[i]) { curr = that1->value.data.logptr[i]; previous += curr; } this->value.data.lngptr[i] = previous; this->value.undef[i] = 0; } /* Store final cumulant for next pass */ that2->value.data.lng = previous; } while( rows-- ) { while( nelem-- ) { elem--; if( vector1>1 ) { val1 = that1->value.data.logptr[elem]; null1 = that1->value.undef[elem]; } else if( vector1 ) { val1 = that1->value.data.logptr[rows]; null1 = that1->value.undef[rows]; } if( vector2>1 ) { val2 = that2->value.data.logptr[elem]; null2 = that2->value.undef[elem]; } else if( vector2 ) { val2 = that2->value.data.logptr[rows]; null2 = that2->value.undef[rows]; } this->value.undef[elem] = (null1 || null2); switch( this->operation ) { case OR: /* This is more complicated than others to suppress UNDEFs */ /* in those cases where the other argument is DEF && TRUE */ if( !null1 && !null2 ) { this->value.data.logptr[elem] = (val1 || val2); } else if( (null1 && !null2 && val2) || ( !null1 && null2 && val1 ) ) { this->value.data.logptr[elem] = 1; this->value.undef[elem] = 0; } break; case AND: /* This is more complicated than others to suppress UNDEFs */ /* in those cases where the other argument is DEF && FALSE */ if( !null1 && !null2 ) { this->value.data.logptr[elem] = (val1 && val2); } else if( (null1 && !null2 && !val2) || ( !null1 && null2 && !val1 ) ) { this->value.data.logptr[elem] = 0; this->value.undef[elem] = 0; } break; case EQ: this->value.data.logptr[elem] = ( (val1 && val2) || (!val1 && !val2) ); break; case NE: this->value.data.logptr[elem] = ( (val1 && !val2) || (!val1 && val2) ); break; } } nelem = this->value.nelem; } } } if( that1->operation>0 ) { free( that1->value.data.ptr ); } if( that2->operation>0 ) { free( that2->value.data.ptr ); } } static void Do_BinOp_lng( Node *this ) { Node *that1, *that2; int vector1, vector2; long val1=0, val2=0; char null1=0, null2=0; long rows, nelem, elem; that1 = gParse.Nodes + this->SubNodes[0]; that2 = gParse.Nodes + this->SubNodes[1]; vector1 = ( that1->operation!=CONST_OP ); if( vector1 ) vector1 = that1->value.nelem; else { val1 = that1->value.data.lng; } vector2 = ( that2->operation!=CONST_OP ); if( vector2 ) vector2 = that2->value.nelem; else { val2 = that2->value.data.lng; } if( !vector1 && !vector2 ) { /* Result is a constant */ switch( this->operation ) { case '~': /* Treat as == for LONGS */ case EQ: this->value.data.log = (val1 == val2); break; case NE: this->value.data.log = (val1 != val2); break; case GT: this->value.data.log = (val1 > val2); break; case LT: this->value.data.log = (val1 < val2); break; case LTE: this->value.data.log = (val1 <= val2); break; case GTE: this->value.data.log = (val1 >= val2); break; case '+': this->value.data.lng = (val1 + val2); break; case '-': this->value.data.lng = (val1 - val2); break; case '*': this->value.data.lng = (val1 * val2); break; case '%': if( val2 ) this->value.data.lng = (val1 % val2); else fferror("Divide by Zero"); break; case '/': if( val2 ) this->value.data.lng = (val1 / val2); else fferror("Divide by Zero"); break; case POWER: this->value.data.lng = (long)pow((double)val1,(double)val2); break; case ACCUM: this->value.data.lng = val1; break; case DIFF: this->value.data.lng = 0; break; } this->operation=CONST_OP; } else if ((this->operation == ACCUM) || (this->operation == DIFF)) { long i, previous, curr; long undef; rows = gParse.nRows; nelem = this->value.nelem; elem = this->value.nelem * rows; Allocate_Ptrs( this ); if( !gParse.status ) { previous = that2->value.data.lng; undef = (long) that2->value.undef; if (this->operation == ACCUM) { /* Cumulative sum of this chunk */ for (i=0; ivalue.undef[i]) { curr = that1->value.data.lngptr[i]; previous += curr; } this->value.data.lngptr[i] = previous; this->value.undef[i] = 0; } } else { /* Sequential difference for this chunk */ for (i=0; ivalue.data.lngptr[i]; if (that1->value.undef[i] || undef) { /* Either this, or previous, value was undefined */ this->value.data.lngptr[i] = 0; this->value.undef[i] = 1; } else { /* Both defined, we are okay! */ this->value.data.lngptr[i] = curr - previous; this->value.undef[i] = 0; } previous = curr; undef = that1->value.undef[i]; } } /* Store final cumulant for next pass */ that2->value.data.lng = previous; that2->value.undef = (char *) undef; /* XXX evil, but no harm here */ } } else { rows = gParse.nRows; nelem = this->value.nelem; elem = this->value.nelem * rows; Allocate_Ptrs( this ); while( rows-- && !gParse.status ) { while( nelem-- && !gParse.status ) { elem--; if( vector1>1 ) { val1 = that1->value.data.lngptr[elem]; null1 = that1->value.undef[elem]; } else if( vector1 ) { val1 = that1->value.data.lngptr[rows]; null1 = that1->value.undef[rows]; } if( vector2>1 ) { val2 = that2->value.data.lngptr[elem]; null2 = that2->value.undef[elem]; } else if( vector2 ) { val2 = that2->value.data.lngptr[rows]; null2 = that2->value.undef[rows]; } this->value.undef[elem] = (null1 || null2); switch( this->operation ) { case '~': /* Treat as == for LONGS */ case EQ: this->value.data.logptr[elem] = (val1 == val2); break; case NE: this->value.data.logptr[elem] = (val1 != val2); break; case GT: this->value.data.logptr[elem] = (val1 > val2); break; case LT: this->value.data.logptr[elem] = (val1 < val2); break; case LTE: this->value.data.logptr[elem] = (val1 <= val2); break; case GTE: this->value.data.logptr[elem] = (val1 >= val2); break; case '+': this->value.data.lngptr[elem] = (val1 + val2); break; case '-': this->value.data.lngptr[elem] = (val1 - val2); break; case '*': this->value.data.lngptr[elem] = (val1 * val2); break; case '%': if( val2 ) this->value.data.lngptr[elem] = (val1 % val2); else { this->value.data.lngptr[elem] = 0; this->value.undef[elem] = 1; } break; case '/': if( val2 ) this->value.data.lngptr[elem] = (val1 / val2); else { this->value.data.lngptr[elem] = 0; this->value.undef[elem] = 1; } break; case POWER: this->value.data.lngptr[elem] = (long)pow((double)val1,(double)val2); break; } } nelem = this->value.nelem; } } if( that1->operation>0 ) { free( that1->value.data.ptr ); } if( that2->operation>0 ) { free( that2->value.data.ptr ); } } static void Do_BinOp_dbl( Node *this ) { Node *that1, *that2; int vector1, vector2; double val1=0.0, val2=0.0; char null1=0, null2=0; long rows, nelem, elem; that1 = gParse.Nodes + this->SubNodes[0]; that2 = gParse.Nodes + this->SubNodes[1]; vector1 = ( that1->operation!=CONST_OP ); if( vector1 ) vector1 = that1->value.nelem; else { val1 = that1->value.data.dbl; } vector2 = ( that2->operation!=CONST_OP ); if( vector2 ) vector2 = that2->value.nelem; else { val2 = that2->value.data.dbl; } if( !vector1 && !vector2 ) { /* Result is a constant */ switch( this->operation ) { case '~': this->value.data.log = ( fabs(val1-val2) < APPROX ); break; case EQ: this->value.data.log = (val1 == val2); break; case NE: this->value.data.log = (val1 != val2); break; case GT: this->value.data.log = (val1 > val2); break; case LT: this->value.data.log = (val1 < val2); break; case LTE: this->value.data.log = (val1 <= val2); break; case GTE: this->value.data.log = (val1 >= val2); break; case '+': this->value.data.dbl = (val1 + val2); break; case '-': this->value.data.dbl = (val1 - val2); break; case '*': this->value.data.dbl = (val1 * val2); break; case '%': if( val2 ) this->value.data.dbl = val1 - val2*((int)(val1/val2)); else fferror("Divide by Zero"); break; case '/': if( val2 ) this->value.data.dbl = (val1 / val2); else fferror("Divide by Zero"); break; case POWER: this->value.data.dbl = (double)pow(val1,val2); break; case ACCUM: this->value.data.dbl = val1; break; case DIFF: this->value.data.dbl = 0; break; } this->operation=CONST_OP; } else if ((this->operation == ACCUM) || (this->operation == DIFF)) { long i; long undef; double previous, curr; rows = gParse.nRows; nelem = this->value.nelem; elem = this->value.nelem * rows; Allocate_Ptrs( this ); if( !gParse.status ) { previous = that2->value.data.dbl; undef = (long) that2->value.undef; if (this->operation == ACCUM) { /* Cumulative sum of this chunk */ for (i=0; ivalue.undef[i]) { curr = that1->value.data.dblptr[i]; previous += curr; } this->value.data.dblptr[i] = previous; this->value.undef[i] = 0; } } else { /* Sequential difference for this chunk */ for (i=0; ivalue.data.dblptr[i]; if (that1->value.undef[i] || undef) { /* Either this, or previous, value was undefined */ this->value.data.dblptr[i] = 0; this->value.undef[i] = 1; } else { /* Both defined, we are okay! */ this->value.data.dblptr[i] = curr - previous; this->value.undef[i] = 0; } previous = curr; undef = that1->value.undef[i]; } } /* Store final cumulant for next pass */ that2->value.data.dbl = previous; that2->value.undef = (char *) undef; /* XXX evil, but no harm here */ } } else { rows = gParse.nRows; nelem = this->value.nelem; elem = this->value.nelem * rows; Allocate_Ptrs( this ); while( rows-- && !gParse.status ) { while( nelem-- && !gParse.status ) { elem--; if( vector1>1 ) { val1 = that1->value.data.dblptr[elem]; null1 = that1->value.undef[elem]; } else if( vector1 ) { val1 = that1->value.data.dblptr[rows]; null1 = that1->value.undef[rows]; } if( vector2>1 ) { val2 = that2->value.data.dblptr[elem]; null2 = that2->value.undef[elem]; } else if( vector2 ) { val2 = that2->value.data.dblptr[rows]; null2 = that2->value.undef[rows]; } this->value.undef[elem] = (null1 || null2); switch( this->operation ) { case '~': this->value.data.logptr[elem] = ( fabs(val1-val2) < APPROX ); break; case EQ: this->value.data.logptr[elem] = (val1 == val2); break; case NE: this->value.data.logptr[elem] = (val1 != val2); break; case GT: this->value.data.logptr[elem] = (val1 > val2); break; case LT: this->value.data.logptr[elem] = (val1 < val2); break; case LTE: this->value.data.logptr[elem] = (val1 <= val2); break; case GTE: this->value.data.logptr[elem] = (val1 >= val2); break; case '+': this->value.data.dblptr[elem] = (val1 + val2); break; case '-': this->value.data.dblptr[elem] = (val1 - val2); break; case '*': this->value.data.dblptr[elem] = (val1 * val2); break; case '%': if( val2 ) this->value.data.dblptr[elem] = val1 - val2*((int)(val1/val2)); else { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } break; case '/': if( val2 ) this->value.data.dblptr[elem] = (val1 / val2); else { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } break; case POWER: this->value.data.dblptr[elem] = (double)pow(val1,val2); break; } } nelem = this->value.nelem; } } if( that1->operation>0 ) { free( that1->value.data.ptr ); } if( that2->operation>0 ) { free( that2->value.data.ptr ); } } /* * This Quickselect routine is based on the algorithm described in * "Numerical recipes in C", Second Edition, * Cambridge University Press, 1992, Section 8.5, ISBN 0-521-43108-5 * This code by Nicolas Devillard - 1998. Public domain. * http://ndevilla.free.fr/median/median/src/quickselect.c */ #define ELEM_SWAP(a,b) { register long t=(a);(a)=(b);(b)=t; } /* * qselect_median_lng - select the median value of a long array * * This routine selects the median value of the long integer array * arr[]. If there are an even number of elements, the "lower median" * is selected. * * The array arr[] is scrambled, so users must operate on a scratch * array if they wish the values to be preserved. * * long arr[] - array of values * int n - number of elements in arr * * RETURNS: the lower median value of arr[] * */ long qselect_median_lng(long arr[], int n) { int low, high ; int median; int middle, ll, hh; low = 0 ; high = n-1 ; median = (low + high) / 2; for (;;) { if (high <= low) { /* One element only */ return arr[median]; } if (high == low + 1) { /* Two elements only */ if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]) ; return arr[median]; } /* Find median of low, middle and high items; swap into position low */ middle = (low + high) / 2; if (arr[middle] > arr[high]) ELEM_SWAP(arr[middle], arr[high]) ; if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]) ; if (arr[middle] > arr[low]) ELEM_SWAP(arr[middle], arr[low]) ; /* Swap low item (now in position middle) into position (low+1) */ ELEM_SWAP(arr[middle], arr[low+1]) ; /* Nibble from each end towards middle, swapping items when stuck */ ll = low + 1; hh = high; for (;;) { do ll++; while (arr[low] > arr[ll]) ; do hh--; while (arr[hh] > arr[low]) ; if (hh < ll) break; ELEM_SWAP(arr[ll], arr[hh]) ; } /* Swap middle item (in position low) back into correct position */ ELEM_SWAP(arr[low], arr[hh]) ; /* Re-set active partition */ if (hh <= median) low = ll; if (hh >= median) high = hh - 1; } } #undef ELEM_SWAP #define ELEM_SWAP(a,b) { register double t=(a);(a)=(b);(b)=t; } /* * qselect_median_dbl - select the median value of a double array * * This routine selects the median value of the double array * arr[]. If there are an even number of elements, the "lower median" * is selected. * * The array arr[] is scrambled, so users must operate on a scratch * array if they wish the values to be preserved. * * double arr[] - array of values * int n - number of elements in arr * * RETURNS: the lower median value of arr[] * */ double qselect_median_dbl(double arr[], int n) { int low, high ; int median; int middle, ll, hh; low = 0 ; high = n-1 ; median = (low + high) / 2; for (;;) { if (high <= low) { /* One element only */ return arr[median] ; } if (high == low + 1) { /* Two elements only */ if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]) ; return arr[median] ; } /* Find median of low, middle and high items; swap into position low */ middle = (low + high) / 2; if (arr[middle] > arr[high]) ELEM_SWAP(arr[middle], arr[high]) ; if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]) ; if (arr[middle] > arr[low]) ELEM_SWAP(arr[middle], arr[low]) ; /* Swap low item (now in position middle) into position (low+1) */ ELEM_SWAP(arr[middle], arr[low+1]) ; /* Nibble from each end towards middle, swapping items when stuck */ ll = low + 1; hh = high; for (;;) { do ll++; while (arr[low] > arr[ll]) ; do hh--; while (arr[hh] > arr[low]) ; if (hh < ll) break; ELEM_SWAP(arr[ll], arr[hh]) ; } /* Swap middle item (in position low) back into correct position */ ELEM_SWAP(arr[low], arr[hh]) ; /* Re-set active partition */ if (hh <= median) low = ll; if (hh >= median) high = hh - 1; } } #undef ELEM_SWAP /* * angsep_calc - compute angular separation between celestial coordinates * * This routine computes the angular separation between to coordinates * on the celestial sphere (i.e. RA and Dec). Note that all units are * in DEGREES, unlike the other trig functions in the calculator. * * double ra1, dec1 - RA and Dec of the first position in degrees * double ra2, dec2 - RA and Dec of the second position in degrees * * RETURNS: (double) angular separation in degrees * */ double angsep_calc(double ra1, double dec1, double ra2, double dec2) { /* double cd; */ static double deg = 0; double a, sdec, sra; if (deg == 0) deg = ((double)4)*atan((double)1)/((double)180); /* deg = 1.0; **** UNCOMMENT IF YOU WANT RADIANS */ /* The algorithm is the law of Haversines. This algorithm is stable even when the points are close together. The normal Law of Cosines fails for angles around 0.1 arcsec. */ sra = sin( (ra2 - ra1)*deg / 2 ); sdec = sin( (dec2 - dec1)*deg / 2); a = sdec*sdec + cos(dec1*deg)*cos(dec2*deg)*sra*sra; /* Sanity checking to avoid a range error in the sqrt()'s below */ if (a < 0) { a = 0; } if (a > 1) { a = 1; } return 2.0*atan2(sqrt(a), sqrt(1.0 - a)) / deg; } static void Do_Func( Node *this ) { Node *theParams[MAXSUBS]; int vector[MAXSUBS], allConst; lval pVals[MAXSUBS]; char pNull[MAXSUBS]; long ival; double dval; int i, valInit; long row, elem, nelem; i = this->nSubNodes; allConst = 1; while( i-- ) { theParams[i] = gParse.Nodes + this->SubNodes[i]; vector[i] = ( theParams[i]->operation!=CONST_OP ); if( vector[i] ) { allConst = 0; vector[i] = theParams[i]->value.nelem; } else { if( theParams[i]->type==DOUBLE ) { pVals[i].data.dbl = theParams[i]->value.data.dbl; } else if( theParams[i]->type==LONG ) { pVals[i].data.lng = theParams[i]->value.data.lng; } else if( theParams[i]->type==BOOLEAN ) { pVals[i].data.log = theParams[i]->value.data.log; } else strcpy(pVals[i].data.str, theParams[i]->value.data.str); pNull[i] = 0; } } if( this->nSubNodes==0 ) allConst = 0; /* These do produce scalars */ /* Random numbers are *never* constant !! */ if( this->operation == poirnd_fct ) allConst = 0; if( this->operation == gasrnd_fct ) allConst = 0; if( this->operation == rnd_fct ) allConst = 0; if( allConst ) { switch( this->operation ) { /* Non-Trig single-argument functions */ case sum_fct: if( theParams[0]->type==BOOLEAN ) this->value.data.lng = ( pVals[0].data.log ? 1 : 0 ); else if( theParams[0]->type==LONG ) this->value.data.lng = pVals[0].data.lng; else if( theParams[0]->type==DOUBLE ) this->value.data.dbl = pVals[0].data.dbl; else if( theParams[0]->type==BITSTR ) strcpy(this->value.data.str, pVals[0].data.str); break; case average_fct: if( theParams[0]->type==LONG ) this->value.data.dbl = pVals[0].data.lng; else if( theParams[0]->type==DOUBLE ) this->value.data.dbl = pVals[0].data.dbl; break; case stddev_fct: this->value.data.dbl = 0; /* Standard deviation of a constant = 0 */ break; case median_fct: if( theParams[0]->type==BOOLEAN ) this->value.data.lng = ( pVals[0].data.log ? 1 : 0 ); else if( theParams[0]->type==LONG ) this->value.data.lng = pVals[0].data.lng; else this->value.data.dbl = pVals[0].data.dbl; break; case poirnd_fct: if( theParams[0]->type==DOUBLE ) this->value.data.lng = simplerng_getpoisson(pVals[0].data.dbl); else this->value.data.lng = simplerng_getpoisson(pVals[0].data.lng); break; case abs_fct: if( theParams[0]->type==DOUBLE ) { dval = pVals[0].data.dbl; this->value.data.dbl = (dval>0.0 ? dval : -dval); } else { ival = pVals[0].data.lng; this->value.data.lng = (ival> 0 ? ival : -ival); } break; /* Special Null-Handling Functions */ case nonnull_fct: this->value.data.lng = 1; /* Constants are always 1-element and defined */ break; case isnull_fct: /* Constants are always defined */ this->value.data.log = 0; break; case defnull_fct: if( this->type==BOOLEAN ) this->value.data.log = pVals[0].data.log; else if( this->type==LONG ) this->value.data.lng = pVals[0].data.lng; else if( this->type==DOUBLE ) this->value.data.dbl = pVals[0].data.dbl; else if( this->type==STRING ) strcpy(this->value.data.str,pVals[0].data.str); break; /* Math functions with 1 double argument */ case sin_fct: this->value.data.dbl = sin( pVals[0].data.dbl ); break; case cos_fct: this->value.data.dbl = cos( pVals[0].data.dbl ); break; case tan_fct: this->value.data.dbl = tan( pVals[0].data.dbl ); break; case asin_fct: dval = pVals[0].data.dbl; if( dval<-1.0 || dval>1.0 ) fferror("Out of range argument to arcsin"); else this->value.data.dbl = asin( dval ); break; case acos_fct: dval = pVals[0].data.dbl; if( dval<-1.0 || dval>1.0 ) fferror("Out of range argument to arccos"); else this->value.data.dbl = acos( dval ); break; case atan_fct: this->value.data.dbl = atan( pVals[0].data.dbl ); break; case sinh_fct: this->value.data.dbl = sinh( pVals[0].data.dbl ); break; case cosh_fct: this->value.data.dbl = cosh( pVals[0].data.dbl ); break; case tanh_fct: this->value.data.dbl = tanh( pVals[0].data.dbl ); break; case exp_fct: this->value.data.dbl = exp( pVals[0].data.dbl ); break; case log_fct: dval = pVals[0].data.dbl; if( dval<=0.0 ) fferror("Out of range argument to log"); else this->value.data.dbl = log( dval ); break; case log10_fct: dval = pVals[0].data.dbl; if( dval<=0.0 ) fferror("Out of range argument to log10"); else this->value.data.dbl = log10( dval ); break; case sqrt_fct: dval = pVals[0].data.dbl; if( dval<0.0 ) fferror("Out of range argument to sqrt"); else this->value.data.dbl = sqrt( dval ); break; case ceil_fct: this->value.data.dbl = ceil( pVals[0].data.dbl ); break; case floor_fct: this->value.data.dbl = floor( pVals[0].data.dbl ); break; case round_fct: this->value.data.dbl = floor( pVals[0].data.dbl + 0.5 ); break; /* Two-argument Trig Functions */ case atan2_fct: this->value.data.dbl = atan2( pVals[0].data.dbl, pVals[1].data.dbl ); break; /* Four-argument ANGSEP function */ case angsep_fct: this->value.data.dbl = angsep_calc(pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl); /* Min/Max functions taking 1 or 2 arguments */ case min1_fct: /* No constant vectors! */ if( this->type == DOUBLE ) this->value.data.dbl = pVals[0].data.dbl; else if( this->type == LONG ) this->value.data.lng = pVals[0].data.lng; else if( this->type == BITSTR ) strcpy(this->value.data.str, pVals[0].data.str); break; case min2_fct: if( this->type == DOUBLE ) this->value.data.dbl = minvalue( pVals[0].data.dbl, pVals[1].data.dbl ); else if( this->type == LONG ) this->value.data.lng = minvalue( pVals[0].data.lng, pVals[1].data.lng ); break; case max1_fct: /* No constant vectors! */ if( this->type == DOUBLE ) this->value.data.dbl = pVals[0].data.dbl; else if( this->type == LONG ) this->value.data.lng = pVals[0].data.lng; else if( this->type == BITSTR ) strcpy(this->value.data.str, pVals[0].data.str); break; case max2_fct: if( this->type == DOUBLE ) this->value.data.dbl = maxvalue( pVals[0].data.dbl, pVals[1].data.dbl ); else if( this->type == LONG ) this->value.data.lng = maxvalue( pVals[0].data.lng, pVals[1].data.lng ); break; /* Boolean SAO region Functions... scalar or vector dbls */ case near_fct: this->value.data.log = bnear( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl ); break; case circle_fct: this->value.data.log = circle( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl, pVals[4].data.dbl ); break; case box_fct: this->value.data.log = saobox( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl, pVals[4].data.dbl, pVals[5].data.dbl, pVals[6].data.dbl ); break; case elps_fct: this->value.data.log = ellipse( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl, pVals[4].data.dbl, pVals[5].data.dbl, pVals[6].data.dbl ); break; /* C Conditional expression: bool ? expr : expr */ case ifthenelse_fct: switch( this->type ) { case BOOLEAN: this->value.data.log = ( pVals[2].data.log ? pVals[0].data.log : pVals[1].data.log ); break; case LONG: this->value.data.lng = ( pVals[2].data.log ? pVals[0].data.lng : pVals[1].data.lng ); break; case DOUBLE: this->value.data.dbl = ( pVals[2].data.log ? pVals[0].data.dbl : pVals[1].data.dbl ); break; case STRING: strcpy(this->value.data.str, ( pVals[2].data.log ? pVals[0].data.str : pVals[1].data.str ) ); break; } break; /* String functions */ case strmid_fct: cstrmid(this->value.data.str, this->value.nelem, pVals[0].data.str, pVals[0].nelem, pVals[1].data.lng); break; case strpos_fct: { char *res = strstr(pVals[0].data.str, pVals[1].data.str); if (res == NULL) { this->value.data.lng = 0; } else { this->value.data.lng = (res - pVals[0].data.str) + 1; } break; } } this->operation = CONST_OP; } else { Allocate_Ptrs( this ); row = gParse.nRows; elem = row * this->value.nelem; if( !gParse.status ) { switch( this->operation ) { /* Special functions with no arguments */ case row_fct: while( row-- ) { this->value.data.lngptr[row] = gParse.firstRow + row; this->value.undef[row] = 0; } break; case null_fct: if( this->type==LONG ) { while( row-- ) { this->value.data.lngptr[row] = 0; this->value.undef[row] = 1; } } else if( this->type==STRING ) { while( row-- ) { this->value.data.strptr[row][0] = '\0'; this->value.undef[row] = 1; } } break; case rnd_fct: while( elem-- ) { this->value.data.dblptr[elem] = simplerng_getuniform(); this->value.undef[elem] = 0; } break; case gasrnd_fct: while( elem-- ) { this->value.data.dblptr[elem] = simplerng_getnorm(); this->value.undef[elem] = 0; } break; case poirnd_fct: if( theParams[0]->type==DOUBLE ) { if (theParams[0]->operation == CONST_OP) { while( elem-- ) { this->value.undef[elem] = (pVals[0].data.dbl < 0); if (! this->value.undef[elem]) { this->value.data.lngptr[elem] = simplerng_getpoisson(pVals[0].data.dbl); } } } else { while( elem-- ) { this->value.undef[elem] = theParams[0]->value.undef[elem]; if (theParams[0]->value.data.dblptr[elem] < 0) this->value.undef[elem] = 1; if (! this->value.undef[elem]) { this->value.data.lngptr[elem] = simplerng_getpoisson(theParams[0]->value.data.dblptr[elem]); } } /* while */ } /* ! CONST_OP */ } else { /* LONG */ if (theParams[0]->operation == CONST_OP) { while( elem-- ) { this->value.undef[elem] = (pVals[0].data.lng < 0); if (! this->value.undef[elem]) { this->value.data.lngptr[elem] = simplerng_getpoisson(pVals[0].data.lng); } } } else { while( elem-- ) { this->value.undef[elem] = theParams[0]->value.undef[elem]; if (theParams[0]->value.data.lngptr[elem] < 0) this->value.undef[elem] = 1; if (! this->value.undef[elem]) { this->value.data.lngptr[elem] = simplerng_getpoisson(theParams[0]->value.data.lngptr[elem]); } } /* while */ } /* ! CONST_OP */ } /* END LONG */ break; /* Non-Trig single-argument functions */ case sum_fct: elem = row * theParams[0]->value.nelem; if( theParams[0]->type==BOOLEAN ) { while( row-- ) { this->value.data.lngptr[row] = 0; /* Default is UNDEF until a defined value is found */ this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( ! theParams[0]->value.undef[elem] ) { this->value.data.lngptr[row] += ( theParams[0]->value.data.logptr[elem] ? 1 : 0 ); this->value.undef[row] = 0; } } } } else if( theParams[0]->type==LONG ) { while( row-- ) { this->value.data.lngptr[row] = 0; /* Default is UNDEF until a defined value is found */ this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( ! theParams[0]->value.undef[elem] ) { this->value.data.lngptr[row] += theParams[0]->value.data.lngptr[elem]; this->value.undef[row] = 0; } } } } else if( theParams[0]->type==DOUBLE ){ while( row-- ) { this->value.data.dblptr[row] = 0.0; /* Default is UNDEF until a defined value is found */ this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( ! theParams[0]->value.undef[elem] ) { this->value.data.dblptr[row] += theParams[0]->value.data.dblptr[elem]; this->value.undef[row] = 0; } } } } else { /* BITSTR */ nelem = theParams[0]->value.nelem; while( row-- ) { char *sptr1 = theParams[0]->value.data.strptr[row]; this->value.data.lngptr[row] = 0; this->value.undef[row] = 0; while (*sptr1) { if (*sptr1 == '1') this->value.data.lngptr[row] ++; sptr1++; } } } break; case average_fct: elem = row * theParams[0]->value.nelem; if( theParams[0]->type==LONG ) { while( row-- ) { int count = 0; this->value.data.dblptr[row] = 0; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if (theParams[0]->value.undef[elem] == 0) { this->value.data.dblptr[row] += theParams[0]->value.data.lngptr[elem]; count ++; } } if (count == 0) { this->value.undef[row] = 1; } else { this->value.undef[row] = 0; this->value.data.dblptr[row] /= count; } } } else if( theParams[0]->type==DOUBLE ){ while( row-- ) { int count = 0; this->value.data.dblptr[row] = 0; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if (theParams[0]->value.undef[elem] == 0) { this->value.data.dblptr[row] += theParams[0]->value.data.dblptr[elem]; count ++; } } if (count == 0) { this->value.undef[row] = 1; } else { this->value.undef[row] = 0; this->value.data.dblptr[row] /= count; } } } break; case stddev_fct: elem = row * theParams[0]->value.nelem; if( theParams[0]->type==LONG ) { /* Compute the mean value */ while( row-- ) { int count = 0; double sum = 0, sum2 = 0; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if (theParams[0]->value.undef[elem] == 0) { sum += theParams[0]->value.data.lngptr[elem]; count ++; } } if (count > 1) { sum /= count; /* Compute the sum of squared deviations */ nelem = theParams[0]->value.nelem; elem += nelem; /* Reset elem for second pass */ while( nelem-- ) { elem--; if (theParams[0]->value.undef[elem] == 0) { double dx = (theParams[0]->value.data.lngptr[elem] - sum); sum2 += (dx*dx); } } sum2 /= (double)count-1; this->value.undef[row] = 0; this->value.data.dblptr[row] = sqrt(sum2); } else { this->value.undef[row] = 0; /* STDDEV => 0 */ this->value.data.dblptr[row] = 0; } } } else if( theParams[0]->type==DOUBLE ){ /* Compute the mean value */ while( row-- ) { int count = 0; double sum = 0, sum2 = 0; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if (theParams[0]->value.undef[elem] == 0) { sum += theParams[0]->value.data.dblptr[elem]; count ++; } } if (count > 1) { sum /= count; /* Compute the sum of squared deviations */ nelem = theParams[0]->value.nelem; elem += nelem; /* Reset elem for second pass */ while( nelem-- ) { elem--; if (theParams[0]->value.undef[elem] == 0) { double dx = (theParams[0]->value.data.dblptr[elem] - sum); sum2 += (dx*dx); } } sum2 /= (double)count-1; this->value.undef[row] = 0; this->value.data.dblptr[row] = sqrt(sum2); } else { this->value.undef[row] = 0; /* STDDEV => 0 */ this->value.data.dblptr[row] = 0; } } } break; case median_fct: elem = row * theParams[0]->value.nelem; nelem = theParams[0]->value.nelem; if( theParams[0]->type==LONG ) { long *dptr = theParams[0]->value.data.lngptr; char *uptr = theParams[0]->value.undef; long *mptr = (long *) malloc(sizeof(long)*nelem); int irow; /* Allocate temporary storage for this row, since the quickselect function will scramble the contents */ if (mptr == 0) { fferror("Could not allocate temporary memory in median function"); free( this->value.data.ptr ); break; } for (irow=0; irow 0) { this->value.undef[irow] = 0; this->value.data.lngptr[irow] = qselect_median_lng(mptr, nelem1); } else { this->value.undef[irow] = 1; this->value.data.lngptr[irow] = 0; } } free(mptr); } else { double *dptr = theParams[0]->value.data.dblptr; char *uptr = theParams[0]->value.undef; double *mptr = (double *) malloc(sizeof(double)*nelem); int irow; /* Allocate temporary storage for this row, since the quickselect function will scramble the contents */ if (mptr == 0) { fferror("Could not allocate temporary memory in median function"); free( this->value.data.ptr ); break; } for (irow=0; irow 0) { this->value.undef[irow] = 0; this->value.data.dblptr[irow] = qselect_median_dbl(mptr, nelem1); } else { this->value.undef[irow] = 1; this->value.data.dblptr[irow] = 0; } } free(mptr); } break; case abs_fct: if( theParams[0]->type==DOUBLE ) while( elem-- ) { dval = theParams[0]->value.data.dblptr[elem]; this->value.data.dblptr[elem] = (dval>0.0 ? dval : -dval); this->value.undef[elem] = theParams[0]->value.undef[elem]; } else while( elem-- ) { ival = theParams[0]->value.data.lngptr[elem]; this->value.data.lngptr[elem] = (ival> 0 ? ival : -ival); this->value.undef[elem] = theParams[0]->value.undef[elem]; } break; /* Special Null-Handling Functions */ case nonnull_fct: nelem = theParams[0]->value.nelem; if ( theParams[0]->type==STRING ) nelem = 1; elem = row * nelem; while( row-- ) { int nelem1 = nelem; this->value.undef[row] = 0; /* Initialize to 0 (defined) */ this->value.data.lngptr[row] = 0; while( nelem1-- ) { elem --; if ( theParams[0]->value.undef[elem] == 0 ) this->value.data.lngptr[row] ++; } } break; case isnull_fct: if( theParams[0]->type==STRING ) elem = row; while( elem-- ) { this->value.data.logptr[elem] = theParams[0]->value.undef[elem]; this->value.undef[elem] = 0; } break; case defnull_fct: switch( this->type ) { case BOOLEAN: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pNull[i] = theParams[i]->value.undef[elem]; pVals[i].data.log = theParams[i]->value.data.logptr[elem]; } else if( vector[i] ) { pNull[i] = theParams[i]->value.undef[row]; pVals[i].data.log = theParams[i]->value.data.logptr[row]; } if( pNull[0] ) { this->value.undef[elem] = pNull[1]; this->value.data.logptr[elem] = pVals[1].data.log; } else { this->value.undef[elem] = 0; this->value.data.logptr[elem] = pVals[0].data.log; } } } break; case LONG: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pNull[i] = theParams[i]->value.undef[elem]; pVals[i].data.lng = theParams[i]->value.data.lngptr[elem]; } else if( vector[i] ) { pNull[i] = theParams[i]->value.undef[row]; pVals[i].data.lng = theParams[i]->value.data.lngptr[row]; } if( pNull[0] ) { this->value.undef[elem] = pNull[1]; this->value.data.lngptr[elem] = pVals[1].data.lng; } else { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = pVals[0].data.lng; } } } break; case DOUBLE: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pNull[i] = theParams[i]->value.undef[elem]; pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; } else if( vector[i] ) { pNull[i] = theParams[i]->value.undef[row]; pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; } if( pNull[0] ) { this->value.undef[elem] = pNull[1]; this->value.data.dblptr[elem] = pVals[1].data.dbl; } else { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = pVals[0].data.dbl; } } } break; case STRING: while( row-- ) { i=2; while( i-- ) if( vector[i] ) { pNull[i] = theParams[i]->value.undef[row]; strcpy(pVals[i].data.str, theParams[i]->value.data.strptr[row]); } if( pNull[0] ) { this->value.undef[row] = pNull[1]; strcpy(this->value.data.strptr[row],pVals[1].data.str); } else { this->value.undef[elem] = 0; strcpy(this->value.data.strptr[row],pVals[0].data.str); } } } break; /* Math functions with 1 double argument */ case sin_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = sin( theParams[0]->value.data.dblptr[elem] ); } break; case cos_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = cos( theParams[0]->value.data.dblptr[elem] ); } break; case tan_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = tan( theParams[0]->value.data.dblptr[elem] ); } break; case asin_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; if( dval<-1.0 || dval>1.0 ) { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } else this->value.data.dblptr[elem] = asin( dval ); } break; case acos_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; if( dval<-1.0 || dval>1.0 ) { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } else this->value.data.dblptr[elem] = acos( dval ); } break; case atan_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; this->value.data.dblptr[elem] = atan( dval ); } break; case sinh_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = sinh( theParams[0]->value.data.dblptr[elem] ); } break; case cosh_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = cosh( theParams[0]->value.data.dblptr[elem] ); } break; case tanh_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = tanh( theParams[0]->value.data.dblptr[elem] ); } break; case exp_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; this->value.data.dblptr[elem] = exp( dval ); } break; case log_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; if( dval<=0.0 ) { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } else this->value.data.dblptr[elem] = log( dval ); } break; case log10_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; if( dval<=0.0 ) { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } else this->value.data.dblptr[elem] = log10( dval ); } break; case sqrt_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { dval = theParams[0]->value.data.dblptr[elem]; if( dval<0.0 ) { this->value.data.dblptr[elem] = 0.0; this->value.undef[elem] = 1; } else this->value.data.dblptr[elem] = sqrt( dval ); } break; case ceil_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = ceil( theParams[0]->value.data.dblptr[elem] ); } break; case floor_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = floor( theParams[0]->value.data.dblptr[elem] ); } break; case round_fct: while( elem-- ) if( !(this->value.undef[elem] = theParams[0]->value.undef[elem]) ) { this->value.data.dblptr[elem] = floor( theParams[0]->value.data.dblptr[elem] + 0.5); } break; /* Two-argument Trig Functions */ case atan2_fct: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = (pNull[0] || pNull[1]) ) ) this->value.data.dblptr[elem] = atan2( pVals[0].data.dbl, pVals[1].data.dbl ); } } break; /* Four-argument ANGSEP Function */ case angsep_fct: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=4; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = (pNull[0] || pNull[1] || pNull[2] || pNull[3]) ) ) this->value.data.dblptr[elem] = angsep_calc(pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl); } } break; /* Min/Max functions taking 1 or 2 arguments */ case min1_fct: elem = row * theParams[0]->value.nelem; if( this->type==LONG ) { long minVal=0; while( row-- ) { valInit = 1; this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( !theParams[0]->value.undef[elem] ) { if ( valInit ) { valInit = 0; minVal = theParams[0]->value.data.lngptr[elem]; } else { minVal = minvalue( minVal, theParams[0]->value.data.lngptr[elem] ); } this->value.undef[row] = 0; } } this->value.data.lngptr[row] = minVal; } } else if( this->type==DOUBLE ) { double minVal=0.0; while( row-- ) { valInit = 1; this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( !theParams[0]->value.undef[elem] ) { if ( valInit ) { valInit = 0; minVal = theParams[0]->value.data.dblptr[elem]; } else { minVal = minvalue( minVal, theParams[0]->value.data.dblptr[elem] ); } this->value.undef[row] = 0; } } this->value.data.dblptr[row] = minVal; } } else if( this->type==BITSTR ) { char minVal; while( row-- ) { char *sptr1 = theParams[0]->value.data.strptr[row]; minVal = '1'; while (*sptr1) { if (*sptr1 == '0') minVal = '0'; sptr1++; } this->value.data.strptr[row][0] = minVal; this->value.data.strptr[row][1] = 0; /* Null terminate */ } } break; case min2_fct: if( this->type==LONG ) { while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.lng = theParams[i]->value.data.lngptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.lng = theParams[i]->value.data.lngptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( pNull[0] && pNull[1] ) { this->value.undef[elem] = 1; this->value.data.lngptr[elem] = 0; } else if (pNull[0]) { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = pVals[1].data.lng; } else if (pNull[1]) { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = pVals[0].data.lng; } else { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = minvalue( pVals[0].data.lng, pVals[1].data.lng ); } } } } else if( this->type==DOUBLE ) { while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( pNull[0] && pNull[1] ) { this->value.undef[elem] = 1; this->value.data.dblptr[elem] = 0; } else if (pNull[0]) { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = pVals[1].data.dbl; } else if (pNull[1]) { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = pVals[0].data.dbl; } else { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = minvalue( pVals[0].data.dbl, pVals[1].data.dbl ); } } } } break; case max1_fct: elem = row * theParams[0]->value.nelem; if( this->type==LONG ) { long maxVal=0; while( row-- ) { valInit = 1; this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( !theParams[0]->value.undef[elem] ) { if ( valInit ) { valInit = 0; maxVal = theParams[0]->value.data.lngptr[elem]; } else { maxVal = maxvalue( maxVal, theParams[0]->value.data.lngptr[elem] ); } this->value.undef[row] = 0; } } this->value.data.lngptr[row] = maxVal; } } else if( this->type==DOUBLE ) { double maxVal=0.0; while( row-- ) { valInit = 1; this->value.undef[row] = 1; nelem = theParams[0]->value.nelem; while( nelem-- ) { elem--; if ( !theParams[0]->value.undef[elem] ) { if ( valInit ) { valInit = 0; maxVal = theParams[0]->value.data.dblptr[elem]; } else { maxVal = maxvalue( maxVal, theParams[0]->value.data.dblptr[elem] ); } this->value.undef[row] = 0; } } this->value.data.dblptr[row] = maxVal; } } else if( this->type==BITSTR ) { char maxVal; while( row-- ) { char *sptr1 = theParams[0]->value.data.strptr[row]; maxVal = '0'; while (*sptr1) { if (*sptr1 == '1') maxVal = '1'; sptr1++; } this->value.data.strptr[row][0] = maxVal; this->value.data.strptr[row][1] = 0; /* Null terminate */ } } break; case max2_fct: if( this->type==LONG ) { while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.lng = theParams[i]->value.data.lngptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.lng = theParams[i]->value.data.lngptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( pNull[0] && pNull[1] ) { this->value.undef[elem] = 1; this->value.data.lngptr[elem] = 0; } else if (pNull[0]) { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = pVals[1].data.lng; } else if (pNull[1]) { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = pVals[0].data.lng; } else { this->value.undef[elem] = 0; this->value.data.lngptr[elem] = maxvalue( pVals[0].data.lng, pVals[1].data.lng ); } } } } else if( this->type==DOUBLE ) { while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( pNull[0] && pNull[1] ) { this->value.undef[elem] = 1; this->value.data.dblptr[elem] = 0; } else if (pNull[0]) { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = pVals[1].data.dbl; } else if (pNull[1]) { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = pVals[0].data.dbl; } else { this->value.undef[elem] = 0; this->value.data.dblptr[elem] = maxvalue( pVals[0].data.dbl, pVals[1].data.dbl ); } } } } break; /* Boolean SAO region Functions... scalar or vector dbls */ case near_fct: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=3; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = (pNull[0] || pNull[1] || pNull[2]) ) ) this->value.data.logptr[elem] = bnear( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl ); } } break; case circle_fct: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=5; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = (pNull[0] || pNull[1] || pNull[2] || pNull[3] || pNull[4]) ) ) this->value.data.logptr[elem] = circle( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl, pVals[4].data.dbl ); } } break; case box_fct: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=7; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = (pNull[0] || pNull[1] || pNull[2] || pNull[3] || pNull[4] || pNull[5] || pNull[6] ) ) ) this->value.data.logptr[elem] = saobox( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl, pVals[4].data.dbl, pVals[5].data.dbl, pVals[6].data.dbl ); } } break; case elps_fct: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; i=7; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = (pNull[0] || pNull[1] || pNull[2] || pNull[3] || pNull[4] || pNull[5] || pNull[6] ) ) ) this->value.data.logptr[elem] = ellipse( pVals[0].data.dbl, pVals[1].data.dbl, pVals[2].data.dbl, pVals[3].data.dbl, pVals[4].data.dbl, pVals[5].data.dbl, pVals[6].data.dbl ); } } break; /* C Conditional expression: bool ? expr : expr */ case ifthenelse_fct: switch( this->type ) { case BOOLEAN: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; if( vector[2]>1 ) { pVals[2].data.log = theParams[2]->value.data.logptr[elem]; pNull[2] = theParams[2]->value.undef[elem]; } else if( vector[2] ) { pVals[2].data.log = theParams[2]->value.data.logptr[row]; pNull[2] = theParams[2]->value.undef[row]; } i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.log = theParams[i]->value.data.logptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.log = theParams[i]->value.data.logptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = pNull[2]) ) { if( pVals[2].data.log ) { this->value.data.logptr[elem] = pVals[0].data.log; this->value.undef[elem] = pNull[0]; } else { this->value.data.logptr[elem] = pVals[1].data.log; this->value.undef[elem] = pNull[1]; } } } } break; case LONG: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; if( vector[2]>1 ) { pVals[2].data.log = theParams[2]->value.data.logptr[elem]; pNull[2] = theParams[2]->value.undef[elem]; } else if( vector[2] ) { pVals[2].data.log = theParams[2]->value.data.logptr[row]; pNull[2] = theParams[2]->value.undef[row]; } i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.lng = theParams[i]->value.data.lngptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.lng = theParams[i]->value.data.lngptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = pNull[2]) ) { if( pVals[2].data.log ) { this->value.data.lngptr[elem] = pVals[0].data.lng; this->value.undef[elem] = pNull[0]; } else { this->value.data.lngptr[elem] = pVals[1].data.lng; this->value.undef[elem] = pNull[1]; } } } } break; case DOUBLE: while( row-- ) { nelem = this->value.nelem; while( nelem-- ) { elem--; if( vector[2]>1 ) { pVals[2].data.log = theParams[2]->value.data.logptr[elem]; pNull[2] = theParams[2]->value.undef[elem]; } else if( vector[2] ) { pVals[2].data.log = theParams[2]->value.data.logptr[row]; pNull[2] = theParams[2]->value.undef[row]; } i=2; while( i-- ) if( vector[i]>1 ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[elem]; pNull[i] = theParams[i]->value.undef[elem]; } else if( vector[i] ) { pVals[i].data.dbl = theParams[i]->value.data.dblptr[row]; pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[elem] = pNull[2]) ) { if( pVals[2].data.log ) { this->value.data.dblptr[elem] = pVals[0].data.dbl; this->value.undef[elem] = pNull[0]; } else { this->value.data.dblptr[elem] = pVals[1].data.dbl; this->value.undef[elem] = pNull[1]; } } } } break; case STRING: while( row-- ) { if( vector[2] ) { pVals[2].data.log = theParams[2]->value.data.logptr[row]; pNull[2] = theParams[2]->value.undef[row]; } i=2; while( i-- ) if( vector[i] ) { strcpy( pVals[i].data.str, theParams[i]->value.data.strptr[row] ); pNull[i] = theParams[i]->value.undef[row]; } if( !(this->value.undef[row] = pNull[2]) ) { if( pVals[2].data.log ) { strcpy( this->value.data.strptr[row], pVals[0].data.str ); this->value.undef[row] = pNull[0]; } else { strcpy( this->value.data.strptr[row], pVals[1].data.str ); this->value.undef[row] = pNull[1]; } } else { this->value.data.strptr[row][0] = '\0'; } } break; } break; /* String functions */ case strmid_fct: { int strconst = theParams[0]->operation == CONST_OP; int posconst = theParams[1]->operation == CONST_OP; int lenconst = theParams[2]->operation == CONST_OP; int dest_len = this->value.nelem; int src_len = theParams[0]->value.nelem; while (row--) { int pos; int len; char *str; int undef = 0; if (posconst) { pos = theParams[1]->value.data.lng; } else { pos = theParams[1]->value.data.lngptr[row]; if (theParams[1]->value.undef[row]) undef = 1; } if (strconst) { str = theParams[0]->value.data.str; if (src_len == 0) src_len = strlen(str); } else { str = theParams[0]->value.data.strptr[row]; if (theParams[0]->value.undef[row]) undef = 1; } if (lenconst) { len = dest_len; } else { len = theParams[2]->value.data.lngptr[row]; if (theParams[2]->value.undef[row]) undef = 1; } this->value.data.strptr[row][0] = '\0'; if (pos == 0) undef = 1; if (! undef ) { if (cstrmid(this->value.data.strptr[row], len, str, src_len, pos) < 0) break; } this->value.undef[row] = undef; } } break; /* String functions */ case strpos_fct: { int const1 = theParams[0]->operation == CONST_OP; int const2 = theParams[1]->operation == CONST_OP; while (row--) { char *str1, *str2; int undef = 0; if (const1) { str1 = theParams[0]->value.data.str; } else { str1 = theParams[0]->value.data.strptr[row]; if (theParams[0]->value.undef[row]) undef = 1; } if (const2) { str2 = theParams[1]->value.data.str; } else { str2 = theParams[1]->value.data.strptr[row]; if (theParams[1]->value.undef[row]) undef = 1; } this->value.data.lngptr[row] = 0; if (! undef ) { char *res = strstr(str1, str2); if (res == NULL) { undef = 1; this->value.data.lngptr[row] = 0; } else { this->value.data.lngptr[row] = (res - str1) + 1; } } this->value.undef[row] = undef; } } break; } /* End switch(this->operation) */ } /* End if (!gParse.status) */ } /* End non-constant operations */ i = this->nSubNodes; while( i-- ) { if( theParams[i]->operation>0 ) { /* Currently only numeric params allowed */ free( theParams[i]->value.data.ptr ); } } } static void Do_Deref( Node *this ) { Node *theVar, *theDims[MAXDIMS]; int isConst[MAXDIMS], allConst; long dimVals[MAXDIMS]; int i, nDims; long row, elem, dsize; theVar = gParse.Nodes + this->SubNodes[0]; i = nDims = this->nSubNodes-1; allConst = 1; while( i-- ) { theDims[i] = gParse.Nodes + this->SubNodes[i+1]; isConst[i] = ( theDims[i]->operation==CONST_OP ); if( isConst[i] ) dimVals[i] = theDims[i]->value.data.lng; else allConst = 0; } if( this->type==DOUBLE ) { dsize = sizeof( double ); } else if( this->type==LONG ) { dsize = sizeof( long ); } else if( this->type==BOOLEAN ) { dsize = sizeof( char ); } else dsize = 0; Allocate_Ptrs( this ); if( !gParse.status ) { if( allConst && theVar->value.naxis==nDims ) { /* Dereference completely using constant indices */ elem = 0; i = nDims; while( i-- ) { if( dimVals[i]<1 || dimVals[i]>theVar->value.naxes[i] ) break; elem = theVar->value.naxes[i]*elem + dimVals[i]-1; } if( i<0 ) { for( row=0; rowtype==STRING ) this->value.undef[row] = theVar->value.undef[row]; else if( this->type==BITSTR ) this->value.undef; /* Dummy - BITSTRs do not have undefs */ else this->value.undef[row] = theVar->value.undef[elem]; if( this->type==DOUBLE ) this->value.data.dblptr[row] = theVar->value.data.dblptr[elem]; else if( this->type==LONG ) this->value.data.lngptr[row] = theVar->value.data.lngptr[elem]; else if( this->type==BOOLEAN ) this->value.data.logptr[row] = theVar->value.data.logptr[elem]; else { /* XXX Note, the below expression uses knowledge of the layout of the string format, namely (nelem+1) characters per string, followed by (nelem+1) "undef" values. */ this->value.data.strptr[row][0] = theVar->value.data.strptr[0][elem+row]; this->value.data.strptr[row][1] = 0; /* Null terminate */ } elem += theVar->value.nelem; } } else { fferror("Index out of range"); free( this->value.data.ptr ); } } else if( allConst && nDims==1 ) { /* Reduce dimensions by 1, using a constant index */ if( dimVals[0] < 1 || dimVals[0] > theVar->value.naxes[ theVar->value.naxis-1 ] ) { fferror("Index out of range"); free( this->value.data.ptr ); } else if ( this->type == BITSTR || this->type == STRING ) { elem = this->value.nelem * (dimVals[0]-1); for( row=0; rowvalue.undef) this->value.undef[row] = theVar->value.undef[row]; memcpy( (char*)this->value.data.strptr[0] + row*sizeof(char)*(this->value.nelem+1), (char*)theVar->value.data.strptr[0] + elem*sizeof(char), this->value.nelem * sizeof(char) ); /* Null terminate */ this->value.data.strptr[row][this->value.nelem] = 0; elem += theVar->value.nelem+1; } } else { elem = this->value.nelem * (dimVals[0]-1); for( row=0; rowvalue.undef + row*this->value.nelem, theVar->value.undef + elem, this->value.nelem * sizeof(char) ); memcpy( (char*)this->value.data.ptr + row*dsize*this->value.nelem, (char*)theVar->value.data.ptr + elem*dsize, this->value.nelem * dsize ); elem += theVar->value.nelem; } } } else if( theVar->value.naxis==nDims ) { /* Dereference completely using an expression for the indices */ for( row=0; rowvalue.undef[row] ) { fferror("Null encountered as vector index"); free( this->value.data.ptr ); break; } else dimVals[i] = theDims[i]->value.data.lngptr[row]; } } if( gParse.status ) break; elem = 0; i = nDims; while( i-- ) { if( dimVals[i]<1 || dimVals[i]>theVar->value.naxes[i] ) break; elem = theVar->value.naxes[i]*elem + dimVals[i]-1; } if( i<0 ) { elem += row*theVar->value.nelem; if( this->type==STRING ) this->value.undef[row] = theVar->value.undef[row]; else if( this->type==BITSTR ) this->value.undef; /* Dummy - BITSTRs do not have undefs */ else this->value.undef[row] = theVar->value.undef[elem]; if( this->type==DOUBLE ) this->value.data.dblptr[row] = theVar->value.data.dblptr[elem]; else if( this->type==LONG ) this->value.data.lngptr[row] = theVar->value.data.lngptr[elem]; else if( this->type==BOOLEAN ) this->value.data.logptr[row] = theVar->value.data.logptr[elem]; else { /* XXX Note, the below expression uses knowledge of the layout of the string format, namely (nelem+1) characters per string, followed by (nelem+1) "undef" values. */ this->value.data.strptr[row][0] = theVar->value.data.strptr[0][elem+row]; this->value.data.strptr[row][1] = 0; /* Null terminate */ } } else { fferror("Index out of range"); free( this->value.data.ptr ); } } } else { /* Reduce dimensions by 1, using a nonconstant expression */ for( row=0; rowvalue.undef[row] ) { fferror("Null encountered as vector index"); free( this->value.data.ptr ); break; } else dimVals[0] = theDims[0]->value.data.lngptr[row]; if( dimVals[0] < 1 || dimVals[0] > theVar->value.naxes[ theVar->value.naxis-1 ] ) { fferror("Index out of range"); free( this->value.data.ptr ); } else if ( this->type == BITSTR || this->type == STRING ) { elem = this->value.nelem * (dimVals[0]-1); elem += row*(theVar->value.nelem+1); if (this->value.undef) this->value.undef[row] = theVar->value.undef[row]; memcpy( (char*)this->value.data.strptr[0] + row*sizeof(char)*(this->value.nelem+1), (char*)theVar->value.data.strptr[0] + elem*sizeof(char), this->value.nelem * sizeof(char) ); /* Null terminate */ this->value.data.strptr[row][this->value.nelem] = 0; } else { elem = this->value.nelem * (dimVals[0]-1); elem += row*theVar->value.nelem; memcpy( this->value.undef + row*this->value.nelem, theVar->value.undef + elem, this->value.nelem * sizeof(char) ); memcpy( (char*)this->value.data.ptr + row*dsize*this->value.nelem, (char*)theVar->value.data.ptr + elem*dsize, this->value.nelem * dsize ); } } } } if( theVar->operation>0 ) { if (theVar->type == STRING || theVar->type == BITSTR) free(theVar->value.data.strptr[0] ); else free( theVar->value.data.ptr ); } for( i=0; ioperation>0 ) { free( theDims[i]->value.data.ptr ); } } static void Do_GTI( Node *this ) { Node *theExpr, *theTimes; double *start, *stop, *times; long elem, nGTI, gti; int ordered; theTimes = gParse.Nodes + this->SubNodes[0]; theExpr = gParse.Nodes + this->SubNodes[1]; nGTI = theTimes->value.nelem; start = theTimes->value.data.dblptr; stop = theTimes->value.data.dblptr + nGTI; ordered = theTimes->type; if( theExpr->operation==CONST_OP ) { this->value.data.log = (Search_GTI( theExpr->value.data.dbl, nGTI, start, stop, ordered )>=0); this->operation = CONST_OP; } else { Allocate_Ptrs( this ); times = theExpr->value.data.dblptr; if( !gParse.status ) { elem = gParse.nRows * this->value.nelem; if( nGTI ) { gti = -1; while( elem-- ) { if( (this->value.undef[elem] = theExpr->value.undef[elem]) ) continue; /* Before searching entire GTI, check the GTI found last time */ if( gti<0 || times[elem]stop[gti] ) { gti = Search_GTI( times[elem], nGTI, start, stop, ordered ); } this->value.data.logptr[elem] = ( gti>=0 ); } } else while( elem-- ) { this->value.data.logptr[elem] = 0; this->value.undef[elem] = 0; } } } if( theExpr->operation>0 ) free( theExpr->value.data.ptr ); } static long Search_GTI( double evtTime, long nGTI, double *start, double *stop, int ordered ) { long gti, step; if( ordered && nGTI>15 ) { /* If time-ordered and lots of GTIs, */ /* use "FAST" Binary search algorithm */ if( evtTime>=start[0] && evtTime<=stop[nGTI-1] ) { gti = step = (nGTI >> 1); while(1) { if( step>1L ) step >>= 1; if( evtTime>stop[gti] ) { if( evtTime>=start[gti+1] ) gti += step; else { gti = -1L; break; } } else if( evtTime=start[gti] && evtTime<=stop[gti] ) break; } return( gti ); } static void Do_REG( Node *this ) { Node *theRegion, *theX, *theY; double Xval=0.0, Yval=0.0; char Xnull=0, Ynull=0; int Xvector, Yvector; long nelem, elem, rows; theRegion = gParse.Nodes + this->SubNodes[0]; theX = gParse.Nodes + this->SubNodes[1]; theY = gParse.Nodes + this->SubNodes[2]; Xvector = ( theX->operation!=CONST_OP ); if( Xvector ) Xvector = theX->value.nelem; else { Xval = theX->value.data.dbl; } Yvector = ( theY->operation!=CONST_OP ); if( Yvector ) Yvector = theY->value.nelem; else { Yval = theY->value.data.dbl; } if( !Xvector && !Yvector ) { this->value.data.log = ( fits_in_region( Xval, Yval, (SAORegion *)theRegion->value.data.ptr ) != 0 ); this->operation = CONST_OP; } else { Allocate_Ptrs( this ); if( !gParse.status ) { rows = gParse.nRows; nelem = this->value.nelem; elem = rows*nelem; while( rows-- ) { while( nelem-- ) { elem--; if( Xvector>1 ) { Xval = theX->value.data.dblptr[elem]; Xnull = theX->value.undef[elem]; } else if( Xvector ) { Xval = theX->value.data.dblptr[rows]; Xnull = theX->value.undef[rows]; } if( Yvector>1 ) { Yval = theY->value.data.dblptr[elem]; Ynull = theY->value.undef[elem]; } else if( Yvector ) { Yval = theY->value.data.dblptr[rows]; Ynull = theY->value.undef[rows]; } this->value.undef[elem] = ( Xnull || Ynull ); if( this->value.undef[elem] ) continue; this->value.data.logptr[elem] = ( fits_in_region( Xval, Yval, (SAORegion *)theRegion->value.data.ptr ) != 0 ); } nelem = this->value.nelem; } } } if( theX->operation>0 ) free( theX->value.data.ptr ); if( theY->operation>0 ) free( theY->value.data.ptr ); } static void Do_Vector( Node *this ) { Node *that; long row, elem, idx, jdx, offset=0; int node; Allocate_Ptrs( this ); if( !gParse.status ) { for( node=0; nodenSubNodes; node++ ) { that = gParse.Nodes + this->SubNodes[node]; if( that->operation == CONST_OP ) { idx = gParse.nRows*this->value.nelem + offset; while( (idx-=this->value.nelem)>=0 ) { this->value.undef[idx] = 0; switch( this->type ) { case BOOLEAN: this->value.data.logptr[idx] = that->value.data.log; break; case LONG: this->value.data.lngptr[idx] = that->value.data.lng; break; case DOUBLE: this->value.data.dblptr[idx] = that->value.data.dbl; break; } } } else { row = gParse.nRows; idx = row * that->value.nelem; while( row-- ) { elem = that->value.nelem; jdx = row*this->value.nelem + offset; while( elem-- ) { this->value.undef[jdx+elem] = that->value.undef[--idx]; switch( this->type ) { case BOOLEAN: this->value.data.logptr[jdx+elem] = that->value.data.logptr[idx]; break; case LONG: this->value.data.lngptr[jdx+elem] = that->value.data.lngptr[idx]; break; case DOUBLE: this->value.data.dblptr[jdx+elem] = that->value.data.dblptr[idx]; break; } } } } offset += that->value.nelem; } } for( node=0; node < this->nSubNodes; node++ ) if( OPER(this->SubNodes[node])>0 ) free( gParse.Nodes[this->SubNodes[node]].value.data.ptr ); } /*****************************************************************************/ /* Utility routines which perform the calculations on bits and SAO regions */ /*****************************************************************************/ static char bitlgte(char *bits1, int oper, char *bits2) { int val1, val2, nextbit; char result; int i, l1, l2, length, ldiff; char *stream=0; char chr1, chr2; l1 = strlen(bits1); l2 = strlen(bits2); length = (l1 > l2) ? l1 : l2; stream = (char *)malloc(sizeof(char)*(length+1)); if (l1 < l2) { ldiff = l2 - l1; i=0; while( ldiff-- ) stream[i++] = '0'; while( l1-- ) stream[i++] = *(bits1++); stream[i] = '\0'; bits1 = stream; } else if (l2 < l1) { ldiff = l1 - l2; i=0; while( ldiff-- ) stream[i++] = '0'; while( l2-- ) stream[i++] = *(bits2++); stream[i] = '\0'; bits2 = stream; } val1 = val2 = 0; nextbit = 1; while( length-- ) { chr1 = bits1[length]; chr2 = bits2[length]; if ((chr1 != 'x')&&(chr1 != 'X')&&(chr2 != 'x')&&(chr2 != 'X')) { if (chr1 == '1') val1 += nextbit; if (chr2 == '1') val2 += nextbit; nextbit *= 2; } } result = 0; switch (oper) { case LT: if (val1 < val2) result = 1; break; case LTE: if (val1 <= val2) result = 1; break; case GT: if (val1 > val2) result = 1; break; case GTE: if (val1 >= val2) result = 1; break; } free(stream); return (result); } static void bitand(char *result,char *bitstrm1,char *bitstrm2) { int i, l1, l2, ldiff, largestStream; char *stream=0; char chr1, chr2; l1 = strlen(bitstrm1); l2 = strlen(bitstrm2); largestStream = (l1 > l2) ? l1 : l2; stream = (char *)malloc(sizeof(char)*(largestStream+1)); if (l1 < l2) { ldiff = l2 - l1; i=0; while( ldiff-- ) stream[i++] = '0'; while( l1-- ) stream[i++] = *(bitstrm1++); stream[i] = '\0'; bitstrm1 = stream; } else if (l2 < l1) { ldiff = l1 - l2; i=0; while( ldiff-- ) stream[i++] = '0'; while( l2-- ) stream[i++] = *(bitstrm2++); stream[i] = '\0'; bitstrm2 = stream; } while ( (chr1 = *(bitstrm1++)) ) { chr2 = *(bitstrm2++); if ((chr1 == 'x') || (chr2 == 'x')) *result = 'x'; else if ((chr1 == '1') && (chr2 == '1')) *result = '1'; else *result = '0'; result++; } free(stream); *result = '\0'; } static void bitor(char *result,char *bitstrm1,char *bitstrm2) { int i, l1, l2, ldiff, largestStream; char *stream=0; char chr1, chr2; l1 = strlen(bitstrm1); l2 = strlen(bitstrm2); largestStream = (l1 > l2) ? l1 : l2; stream = (char *)malloc(sizeof(char)*(largestStream+1)); if (l1 < l2) { ldiff = l2 - l1; i=0; while( ldiff-- ) stream[i++] = '0'; while( l1-- ) stream[i++] = *(bitstrm1++); stream[i] = '\0'; bitstrm1 = stream; } else if (l2 < l1) { ldiff = l1 - l2; i=0; while( ldiff-- ) stream[i++] = '0'; while( l2-- ) stream[i++] = *(bitstrm2++); stream[i] = '\0'; bitstrm2 = stream; } while ( (chr1 = *(bitstrm1++)) ) { chr2 = *(bitstrm2++); if ((chr1 == '1') || (chr2 == '1')) *result = '1'; else if ((chr1 == '0') || (chr2 == '0')) *result = '0'; else *result = 'x'; result++; } free(stream); *result = '\0'; } static void bitnot(char *result,char *bits) { int length; char chr; length = strlen(bits); while( length-- ) { chr = *(bits++); *(result++) = ( chr=='1' ? '0' : ( chr=='0' ? '1' : chr ) ); } *result = '\0'; } static char bitcmp(char *bitstrm1, char *bitstrm2) { int i, l1, l2, ldiff, largestStream; char *stream=0; char chr1, chr2; l1 = strlen(bitstrm1); l2 = strlen(bitstrm2); largestStream = (l1 > l2) ? l1 : l2; stream = (char *)malloc(sizeof(char)*(largestStream+1)); if (l1 < l2) { ldiff = l2 - l1; i=0; while( ldiff-- ) stream[i++] = '0'; while( l1-- ) stream[i++] = *(bitstrm1++); stream[i] = '\0'; bitstrm1 = stream; } else if (l2 < l1) { ldiff = l1 - l2; i=0; while( ldiff-- ) stream[i++] = '0'; while( l2-- ) stream[i++] = *(bitstrm2++); stream[i] = '\0'; bitstrm2 = stream; } while( (chr1 = *(bitstrm1++)) ) { chr2 = *(bitstrm2++); if ( ((chr1 == '0') && (chr2 == '1')) || ((chr1 == '1') && (chr2 == '0')) ) { free(stream); return( 0 ); } } free(stream); return( 1 ); } static char bnear(double x, double y, double tolerance) { if (fabs(x - y) < tolerance) return ( 1 ); else return ( 0 ); } static char saobox(double xcen, double ycen, double xwid, double ywid, double rot, double xcol, double ycol) { double x,y,xprime,yprime,xmin,xmax,ymin,ymax,theta; theta = (rot / 180.0) * myPI; xprime = xcol - xcen; yprime = ycol - ycen; x = xprime * cos(theta) + yprime * sin(theta); y = -xprime * sin(theta) + yprime * cos(theta); xmin = - 0.5 * xwid; xmax = 0.5 * xwid; ymin = - 0.5 * ywid; ymax = 0.5 * ywid; if ((x >= xmin) && (x <= xmax) && (y >= ymin) && (y <= ymax)) return ( 1 ); else return ( 0 ); } static char circle(double xcen, double ycen, double rad, double xcol, double ycol) { double r2,dx,dy,dlen; dx = xcol - xcen; dy = ycol - ycen; dx *= dx; dy *= dy; dlen = dx + dy; r2 = rad * rad; if (dlen <= r2) return ( 1 ); else return ( 0 ); } static char ellipse(double xcen, double ycen, double xrad, double yrad, double rot, double xcol, double ycol) { double x,y,xprime,yprime,dx,dy,dlen,theta; theta = (rot / 180.0) * myPI; xprime = xcol - xcen; yprime = ycol - ycen; x = xprime * cos(theta) + yprime * sin(theta); y = -xprime * sin(theta) + yprime * cos(theta); dx = x / xrad; dy = y / yrad; dx *= dx; dy *= dy; dlen = dx + dy; if (dlen <= 1.0) return ( 1 ); else return ( 0 ); } /* * Extract substring */ int cstrmid(char *dest_str, int dest_len, char *src_str, int src_len, int pos) { /* char fill_char = ' '; */ char fill_char = '\0'; if (src_len == 0) { src_len = strlen(src_str); } /* .. if constant */ /* Fill destination with blanks */ if (pos < 0) { fferror("STRMID(S,P,N) P must be 0 or greater"); return -1; } if (pos > src_len || pos == 0) { /* pos==0: blank string requested */ memset(dest_str, fill_char, dest_len); } else if (pos+dest_len > src_len) { /* Copy a subset */ int nsub = src_len-pos+1; int npad = dest_len - nsub; memcpy(dest_str, src_str+pos-1, nsub); /* Fill remaining string with blanks */ memset(dest_str+nsub, fill_char, npad); } else { /* Full string copy */ memcpy(dest_str, src_str+pos-1, dest_len); } dest_str[dest_len] = '\0'; /* Null-terminate */ return 0; } static void fferror(char *s) { char msg[80]; if( !gParse.status ) gParse.status = PARSE_SYNTAX_ERR; strncpy(msg, s, 80); msg[79] = '\0'; ffpmsg(msg); } cfitsio-3.47/f77.inc0000644000225700000360000000152513464573431013510 0ustar cagordonlheaC Codes for FITS extension types integer IMAGE_HDU, ASCII_TBL, BINARY_TBL parameter ( & IMAGE_HDU = 0, & ASCII_TBL = 1, & BINARY_TBL = 2 ) C Codes for FITS table data types integer TBIT,TBYTE,TLOGICAL,TSTRING,TSHORT,TINT integer TFLOAT,TDOUBLE,TCOMPLEX,TDBLCOMPLEX parameter ( & TBIT = 1, & TBYTE = 11, & TLOGICAL = 14, & TSTRING = 16, & TSHORT = 21, & TINT = 31, & TFLOAT = 42, & TDOUBLE = 82, & TCOMPLEX = 83, & TDBLCOMPLEX = 163 ) C Codes for iterator column types integer InputCol, InputOutputCol, OutputCol parameter ( & InputCol = 0, & InputOutputCol = 1, & OutputCol = 2 ) cfitsio-3.47/f77_wrap1.c0000644000225700000360000003075313464573431014300 0ustar cagordonlhea/************************************************************************ f77_wrap1.c and f77_wrap2.c have now been split into 4 files to prevent compile-time memory errors (from expansion of compiler commands). f77_wrap1.c was split into f77_wrap1.c and f77_wrap3.c, and f77_wrap2.c was split into f77_wrap2.c and f77_wrap4.c: f77_wrap1.c contains routines operating on whole files and some utility routines. f77_wrap2.c contains routines operating on primary array, image, or column elements. f77_wrap3.c contains routines operating on headers & keywords. f77_wrap4.c contains miscellaneous routines. Peter's original comments: Together, f77_wrap1.c and f77_wrap2.c contain C wrappers for all the CFITSIO routines prototyped in fitsio.h, except for the generic datatype routines and features not supported in fortran (eg, unsigned integers), a few routines prototyped in fitsio2.h, which only a handful of FTOOLS use, plus a few obsolete FITSIO routines not present in CFITSIO. This file allows Fortran code to use the CFITSIO library instead of the FITSIO library without modification. It also gives access to new routines not present in FITSIO. Fortran FTOOLS must continue using the old routine names from FITSIO (ie, ftxxxx), but most of the C-wrappers simply redirect those calls to the corresponding CFITSIO routines (ie, ffxxxx), with appropriate parameter massaging where necessary. The main exception are read/write routines ending in j (ie, long data) which get redirected to C routines ending in k (ie, int data). This is more consistent with the default integer type in Fortran. f77_wrap1.c primarily holds routines operating on whole files and extension headers. f77_wrap2.c handle routines which read and write the data portion, plus miscellaneous extra routines. File created by Peter Wilson (HSTX), Oct-Dec. 1997 ************************************************************************/ #include "fitsio2.h" #include "f77_wrap.h" unsigned long gMinStrLen=80L; fitsfile *gFitsFiles[NMAXFILES]={0}; /*---------------- Fortran Unit Number Allocation -------------*/ void Cffgiou( int *unit, int *status ); void Cffgiou( int *unit, int *status ) { int i; if( *status>0 ) return; for( i=50;i0 ) return; if( unit == -1 ) { int i; for( i=50; i=NMAXFILES ) { *status = BAD_FILEPTR; ffpmsg("Cfffiou was sent an unacceptable unit number."); } else gFitsFiles[unit]=NULL; } FCALLSCSUB2(Cfffiou,FTFIOU,ftfiou,INT,PINT) int CFITS2Unit( fitsfile *fptr ) /* Utility routine to convert a fitspointer to a Fortran unit number */ /* for use when a C program is calling a Fortran routine which could */ /* in turn call CFITSIO... Modelled after code by Ning Gan. */ { static fitsfile *last_fptr = (fitsfile *)NULL; /* Remember last fptr */ static int last_unit = 0; /* Remember last unit */ int status = 0; /* Test whether we are repeating the last lookup */ if( last_unit && fptr==gFitsFiles[last_unit] ) return( last_unit ); /* Check if gFitsFiles has an entry for this fptr. */ /* Allows Fortran to call C to call Fortran to */ /* call CFITSIO... OUCH!!! */ last_fptr = fptr; for( last_unit=1; last_unit=NMAXFILES ) return(0); return(gFitsFiles[unit]); } /**************************************************/ /* Start of wrappers for routines in fitsio.h */ /**************************************************/ /*---------------- FITS file URL parsing routines -------------*/ FCALLSCSUB9(ffiurl,FTIURL,ftiurl,STRING,PSTRING,PSTRING,PSTRING,PSTRING,PSTRING,PSTRING,PSTRING,PINT) FCALLSCSUB3(ffrtnm,FTRTNM,ftrtnm,STRING,PSTRING,PINT) FCALLSCSUB3(ffexist,FTEXIST,ftexist,STRING,PINT,PINT) FCALLSCSUB3(ffextn,FTEXTN,ftextn,STRING,PINT,PINT) FCALLSCSUB7(ffrwrg,FTRWRG,ftrwrg,STRING,LONG,INT,PINT,PLONG,PLONG,PINT) /*---------------- FITS file I/O routines ---------------*/ void Cffopen( fitsfile **fptr, const char *filename, int iomode, int *blocksize, int *status ); void Cffopen( fitsfile **fptr, const char *filename, int iomode, int *blocksize, int *status ) { int hdutype; if( *fptr==NULL || *fptr==(fitsfile*)1 ) { ffopen( fptr, filename, iomode, status ); ffmahd( *fptr, 1, &hdutype, status ); *blocksize = 1; } else { *status = FILE_NOT_OPENED; ffpmsg("Cffopen tried to use an already opened unit."); } } FCALLSCSUB5(Cffopen,FTOPEN,ftopen,PFITSUNIT,STRING,INT,PINT,PINT) void Cffdkopn( fitsfile **fptr, const char *filename, int iomode, int *blocksize, int *status ); void Cffdkopn( fitsfile **fptr, const char *filename, int iomode, int *blocksize, int *status ) { int hdutype; if( *fptr==NULL || *fptr==(fitsfile*)1 ) { ffdkopn( fptr, filename, iomode, status ); ffmahd( *fptr, 1, &hdutype, status ); *blocksize = 1; } else { *status = FILE_NOT_OPENED; ffpmsg("Cffdkopn tried to use an already opened unit."); } } FCALLSCSUB5(Cffdkopn,FTDKOPN,ftdkopn,PFITSUNIT,STRING,INT,PINT,PINT) void Cffnopn( fitsfile **fptr, const char *filename, int iomode, int *status ); void Cffnopn( fitsfile **fptr, const char *filename, int iomode, int *status ) { if( *fptr==NULL || *fptr==(fitsfile*)1 ) { ffopen( fptr, filename, iomode, status ); } else { *status = FILE_NOT_OPENED; ffpmsg("Cffnopn tried to use an already opened unit."); } } FCALLSCSUB4(Cffnopn,FTNOPN,ftnopn,PFITSUNIT,STRING,INT,PINT) void Cffdopn( fitsfile **fptr, const char *filename, int iomode, int *status ); void Cffdopn( fitsfile **fptr, const char *filename, int iomode, int *status ) { if( *fptr==NULL || *fptr==(fitsfile*)1 ) { ffdopn( fptr, filename, iomode, status ); } else { *status = FILE_NOT_OPENED; ffpmsg("Cffdopn tried to use an already opened unit."); } } FCALLSCSUB4(Cffdopn,FTDOPN,ftdopn,PFITSUNIT,STRING,INT,PINT) void Cfftopn( fitsfile **fptr, const char *filename, int iomode, int *status ); void Cfftopn( fitsfile **fptr, const char *filename, int iomode, int *status ) { if( *fptr==NULL || *fptr==(fitsfile*)1 ) { fftopn( fptr, filename, iomode, status ); } else { *status = FILE_NOT_OPENED; ffpmsg("Cfftopn tried to use an already opened unit."); } } FCALLSCSUB4(Cfftopn,FTTOPN,fttopn,PFITSUNIT,STRING,INT,PINT) void Cffiopn( fitsfile **fptr, const char *filename, int iomode, int *status ); void Cffiopn( fitsfile **fptr, const char *filename, int iomode, int *status ) { if( *fptr==NULL || *fptr==(fitsfile*)1 ) { ffiopn( fptr, filename, iomode, status ); } else { *status = FILE_NOT_OPENED; ffpmsg("Cffiopn tried to use an already opened unit."); } } FCALLSCSUB4(Cffiopn,FTIOPN,ftiopn,PFITSUNIT,STRING,INT,PINT) void Cffreopen( fitsfile *openfptr, fitsfile **newfptr, int *status ); void Cffreopen( fitsfile *openfptr, fitsfile **newfptr, int *status ) { if( *newfptr==NULL || *newfptr==(fitsfile*)1 ) { ffreopen( openfptr, newfptr, status ); } else { *status = FILE_NOT_OPENED; ffpmsg("Cffreopen tried to use an already opened unit."); } } FCALLSCSUB3(Cffreopen,FTREOPEN,ftreopen,FITSUNIT,PFITSUNIT,PINT) void Cffinit( fitsfile **fptr, const char *filename, int blocksize, int *status ); void Cffinit( fitsfile **fptr, const char *filename, int blocksize, int *status ) { if( *fptr==NULL || *fptr==(fitsfile*)1 ) { ffinit( fptr, filename, status ); } else { *status = FILE_NOT_CREATED; ffpmsg("Cffinit tried to use an already opened unit."); } } FCALLSCSUB4(Cffinit,FTINIT,ftinit,PFITSUNIT,STRING,INT,PINT) void Cffdkinit( fitsfile **fptr, const char *filename, int blocksize, int *status ); void Cffdkinit( fitsfile **fptr, const char *filename, int blocksize, int *status ) { if( *fptr==NULL || *fptr==(fitsfile*)1 ) { ffdkinit( fptr, filename, status ); } else { *status = FILE_NOT_CREATED; ffpmsg("Cffdkinit tried to use an already opened unit."); } } FCALLSCSUB4(Cffdkinit,FTDKINIT,ftdkinit,PFITSUNIT,STRING,INT,PINT) void Cfftplt( fitsfile **fptr, const char *filename, const char *tempname, int *status ); void Cfftplt( fitsfile **fptr, const char *filename, const char *tempname, int *status ) { if( *fptr==NULL || *fptr==(fitsfile*)1 ) { fftplt( fptr, filename, tempname, status ); } else { *status = FILE_NOT_CREATED; ffpmsg("Cfftplt tried to use an already opened unit."); } } FCALLSCSUB4(Cfftplt,FTTPLT,fttplt,PFITSUNIT,STRING,STRING,PINT) FCALLSCSUB2(ffflus,FTFLUS,ftflus,FITSUNIT,PINT) FCALLSCSUB3(ffflsh,FTFLSH,ftflsh,FITSUNIT, INT, PINT) void Cffclos( int unit, int *status ); void Cffclos( int unit, int *status ) { if( gFitsFiles[unit]!=NULL && gFitsFiles[unit]!=(void*)1 ) { ffclos( gFitsFiles[unit], status ); /* Flag unit number as unavailable */ gFitsFiles[unit]=(fitsfile*)1; /* in case want to reuse it */ } } FCALLSCSUB2(Cffclos,FTCLOS,ftclos,INT,PINT) void Cffdelt( int unit, int *status ); void Cffdelt( int unit, int *status ) { if( gFitsFiles[unit]!=NULL && gFitsFiles[unit]!=(void*)1 ) { ffdelt( gFitsFiles[unit], status ); /* Flag unit number as unavailable */ gFitsFiles[unit]=(fitsfile*)1; /* in case want to reuse it */ } } FCALLSCSUB2(Cffdelt,FTDELT,ftdelt,INT,PINT) FCALLSCSUB3(ffflnm,FTFLNM,ftflnm,FITSUNIT,PSTRING,PINT) FCALLSCSUB3(ffflmd,FTFLMD,ftflmd,FITSUNIT,PINT,PINT) /*--------------- utility routines ---------------*/ FCALLSCSUB1(ffvers,FTVERS,ftvers,PFLOAT) FCALLSCSUB1(ffupch,FTUPCH,ftupch,PSTRING) FCALLSCSUB2(ffgerr,FTGERR,ftgerr,INT,PSTRING) FCALLSCSUB1(ffpmsg,FTPMSG,ftpmsg,STRING) FCALLSCSUB1(ffgmsg,FTGMSG,ftgmsg,PSTRING) FCALLSCSUB0(ffcmsg,FTCMSG,ftcmsg) FCALLSCSUB0(ffpmrk,FTPMRK,ftpmrk) FCALLSCSUB0(ffcmrk,FTCMRK,ftcmrk) void Cffrprt( char *fname, int status ); void Cffrprt( char *fname, int status ) { if( !strcmp(fname,"STDOUT") || !strcmp(fname,"stdout") ) ffrprt( stdout, status ); else if( !strcmp(fname,"STDERR") || !strcmp(fname,"stderr") ) ffrprt( stderr, status ); else { FILE *fptr; fptr = fopen(fname, "a"); if (fptr==NULL) printf("file pointer is null.\n"); else { ffrprt(fptr,status); fclose(fptr); } } } FCALLSCSUB2(Cffrprt,FTRPRT,ftrprt,STRING,INT) FCALLSCSUB5(ffcmps,FTCMPS,ftcmps,STRING,STRING,LOGICAL,PLOGICAL,PLOGICAL) FCALLSCSUB2(fftkey,FTTKEY,fttkey,STRING,PINT) FCALLSCSUB2(fftrec,FTTREC,fttrec,STRING,PINT) FCALLSCSUB2(ffnchk,FTNCHK,ftnchk,FITSUNIT,PINT) FCALLSCSUB4(ffkeyn,FTKEYN,ftkeyn,STRING,INT,PSTRING,PINT) FCALLSCSUB4(ffgknm,FTGKNM,ftgknm,STRING,PSTRING, PINT, PINT) FCALLSCSUB4(ffnkey,FTNKEY,ftnkey,INT,STRING,PSTRING,PINT) FCALLSCSUB3(ffdtyp,FTDTYP,ftdtyp,STRING,PSTRING,PINT) FCALLSCFUN1(INT,ffgkcl,FTGKCL,ftgkcl,STRING) FCALLSCSUB5(ffmkky,FTMKKY,ftmkky,STRING,STRING,STRING,PSTRING,PINT) FCALLSCSUB4(ffpsvc,FTPSVC,ftpsvc,STRING,PSTRING,PSTRING,PINT) FCALLSCSUB4(ffgthd,FTGTHD,ftgthd,STRING,PSTRING,PINT,PINT) FCALLSCSUB5(ffasfm,FTASFM,ftasfm,STRING,PINT,PLONG,PINT,PINT) FCALLSCSUB5(ffbnfm,FTBNFM,ftbnfm,STRING,PINT,PLONG,PLONG,PINT) #define ftgabc_STRV_A2 NUM_ELEM_ARG(1) #define ftgabc_LONGV_A5 A1 FCALLSCSUB6(ffgabc,FTGABC,ftgabc,INT,STRINGV,INT,PLONG,LONGV,PINT) /* File download diagnostic functions */ FCALLSCSUB1(ffvhtps,FTVHTPS,ftvhtps,INT) FCALLSCSUB1(ffshdwn,FTSHDWN,ftshdwn,INT) void Cffgtmo(int *secs); void Cffgtmo(int *secs) { *secs = ffgtmo(); } FCALLSCSUB1(Cffgtmo,FTGTMO,ftgtmo,PINT) FCALLSCSUB2(ffstmo,FTSTMO,ftstmo,INT,PINT) cfitsio-3.47/f77_wrap2.c0000644000225700000360000007720113464573431014300 0ustar cagordonlhea/************************************************************************ f77_wrap1.c and f77_wrap2.c have now been split into 4 files to prevent compile-time memory errors (from expansion of compiler commands). f77_wrap1.c was split into f77_wrap1.c and f77_wrap3.c, and f77_wrap2.c was split into f77_wrap2.c and f77_wrap4.c: f77_wrap1.c contains routines operating on whole files and some utility routines. f77_wrap2.c contains routines operating on primary array, image, or column elements. f77_wrap3.c contains routines operating on headers & keywords. f77_wrap4.c contains miscellaneous routines. Peter's original comments: Together, f77_wrap1.c and f77_wrap2.c contain C wrappers for all the CFITSIO routines prototyped in fitsio.h, except for the generic datatype routines and features not supported in fortran (eg, unsigned integers), a few routines prototyped in fitsio2.h, which only a handful of FTOOLS use, plus a few obsolete FITSIO routines not present in CFITSIO. This file allows Fortran code to use the CFITSIO library instead of the FITSIO library without modification. It also gives access to new routines not present in FITSIO. Fortran FTOOLS must continue using the old routine names from FITSIO (ie, ftxxxx), but most of the C-wrappers simply redirect those calls to the corresponding CFITSIO routines (ie, ffxxxx), with appropriate parameter massaging where necessary. The main exception are read/write routines ending in j (ie, long data) which get redirected to C routines ending in k (ie, int data). This is more consistent with the default integer type in Fortran. f77_wrap1.c primarily holds routines operating on whole files and extension headers. f77_wrap2.c handle routines which read and write the data portion, plus miscellaneous extra routines. File created by Peter Wilson (HSTX), Oct-Dec. 1997 ************************************************************************/ #include "fitsio2.h" #include "f77_wrap.h" FCALLSCSUB5(ffgextn,FTGEXTN,ftgextn,FITSUNIT,LONG,LONG,BYTEV,PINT) FCALLSCSUB5(ffpextn,FTPEXTN,ftpextn,FITSUNIT,LONG,LONG,BYTEV,PINT) /*------------ read primary array or image elements -------------*/ FCALLSCSUB8(ffgpvb,FTGPVB,ftgpvb,FITSUNIT,LONG,LONG,LONG,BYTE,BYTEV,PLOGICAL,PINT) FCALLSCSUB8(ffgpvi,FTGPVI,ftgpvi,FITSUNIT,LONG,LONG,LONG,SHORT,SHORTV,PLOGICAL,PINT) FCALLSCSUB8(ffgpvk,FTGPVJ,ftgpvj,FITSUNIT,LONG,LONG,LONG,INT,INTV,PLOGICAL,PINT) FCALLSCSUB8(ffgpvjj,FTGPVK,ftgpvk,FITSUNIT,LONG,LONG,LONG,LONGLONG,LONGLONGV,PLOGICAL,PINT) FCALLSCSUB8(ffgpve,FTGPVE,ftgpve,FITSUNIT,LONG,LONG,LONG,FLOAT,FLOATV,PLOGICAL,PINT) FCALLSCSUB8(ffgpvd,FTGPVD,ftgpvd,FITSUNIT,LONG,LONG,LONG,DOUBLE,DOUBLEV,PLOGICAL,PINT) #define ftgpfb_LOGV_A6 A4 FCALLSCSUB8(ffgpfb,FTGPFB,ftgpfb,FITSUNIT,LONG,LONG,LONG,BYTEV,LOGICALV,PLOGICAL,PINT) #define ftgpfi_LOGV_A6 A4 FCALLSCSUB8(ffgpfi,FTGPFI,ftgpfi,FITSUNIT,LONG,LONG,LONG,SHORTV,LOGICALV,PLOGICAL,PINT) #define ftgpfj_LOGV_A6 A4 FCALLSCSUB8(ffgpfk,FTGPFJ,ftgpfj,FITSUNIT,LONG,LONG,LONG,INTV,LOGICALV,PLOGICAL,PINT) #define ftgpfk_LOGV_A6 A4 FCALLSCSUB8(ffgpfjj,FTGPFK,ftgpfk,FITSUNIT,LONG,LONG,LONG,LONGLONGV,LOGICALV,PLOGICAL,PINT) #define ftgpfe_LOGV_A6 A4 FCALLSCSUB8(ffgpfe,FTGPFE,ftgpfe,FITSUNIT,LONG,LONG,LONG,FLOATV,LOGICALV,PLOGICAL,PINT) #define ftgpfd_LOGV_A6 A4 FCALLSCSUB8(ffgpfd,FTGPFD,ftgpfd,FITSUNIT,LONG,LONG,LONG,DOUBLEV,LOGICALV,PLOGICAL,PINT) FCALLSCSUB9(ffg2db,FTG2DB,ftg2db,FITSUNIT,LONG,BYTE,LONG,LONG,LONG,BYTEV,PLOGICAL,PINT) FCALLSCSUB9(ffg2di,FTG2DI,ftg2di,FITSUNIT,LONG,SHORT,LONG,LONG,LONG,SHORTV,PLOGICAL,PINT) FCALLSCSUB9(ffg2dk,FTG2DJ,ftg2dj,FITSUNIT,LONG,INT,LONG,LONG,LONG,INTV,PLOGICAL,PINT) FCALLSCSUB9(ffg2djj,FTG2DK,ftg2dk,FITSUNIT,LONG,LONGLONG,LONG,LONG,LONG,LONGLONGV,PLOGICAL,PINT) FCALLSCSUB9(ffg2de,FTG2DE,ftg2de,FITSUNIT,LONG,FLOAT,LONG,LONG,LONG,FLOATV,PLOGICAL,PINT) FCALLSCSUB9(ffg2dd,FTG2DD,ftg2dd,FITSUNIT,LONG,DOUBLE,LONG,LONG,LONG,DOUBLEV,PLOGICAL,PINT) FCALLSCSUB11(ffg3db,FTG3DB,ftg3db,FITSUNIT,LONG,BYTE,LONG,LONG,LONG,LONG,LONG,BYTEV,PLOGICAL,PINT) FCALLSCSUB11(ffg3di,FTG3DI,ftg3di,FITSUNIT,LONG,SHORT,LONG,LONG,LONG,LONG,LONG,SHORTV,PLOGICAL,PINT) FCALLSCSUB11(ffg3dk,FTG3DJ,ftg3dj,FITSUNIT,LONG,INT,LONG,LONG,LONG,LONG,LONG,INTV,PLOGICAL,PINT) FCALLSCSUB11(ffg3djj,FTG3DK,ftg3dk,FITSUNIT,LONG,LONGLONG,LONG,LONG,LONG,LONG,LONG,LONGLONGV,PLOGICAL,PINT) FCALLSCSUB11(ffg3de,FTG3DE,ftg3de,FITSUNIT,LONG,FLOAT,LONG,LONG,LONG,LONG,LONG,FLOATV,PLOGICAL,PINT) FCALLSCSUB11(ffg3dd,FTG3DD,ftg3dd,FITSUNIT,LONG,DOUBLE,LONG,LONG,LONG,LONG,LONG,DOUBLEV,PLOGICAL,PINT) /* The follow LONGV definitions have +1 appended because the */ /* routines use of NAXIS+1 elements of the long vectors. */ #define ftgsvb_LONGV_A4 A3+1 #define ftgsvb_LONGV_A5 A3+1 #define ftgsvb_LONGV_A6 A3+1 #define ftgsvb_LONGV_A7 A3+1 FCALLSCSUB11(ffgsvb,FTGSVB,ftgsvb,FITSUNIT,INT,INT,LONGV,LONGV,LONGV,LONGV,BYTE,BYTEV,PLOGICAL,PINT) #define ftgsvi_LONGV_A4 A3+1 #define ftgsvi_LONGV_A5 A3+1 #define ftgsvi_LONGV_A6 A3+1 #define ftgsvi_LONGV_A7 A3+1 FCALLSCSUB11(ffgsvi,FTGSVI,ftgsvi,FITSUNIT,INT,INT,LONGV,LONGV,LONGV,LONGV,SHORT,SHORTV,PLOGICAL,PINT) #define ftgsvj_LONGV_A4 A3+1 #define ftgsvj_LONGV_A5 A3+1 #define ftgsvj_LONGV_A6 A3+1 #define ftgsvj_LONGV_A7 A3+1 FCALLSCSUB11(ffgsvk,FTGSVJ,ftgsvj,FITSUNIT,INT,INT,LONGV,LONGV,LONGV,LONGV,INT,INTV,PLOGICAL,PINT) #define ftgsvk_LONGV_A4 A3+1 #define ftgsvk_LONGV_A5 A3+1 #define ftgsvk_LONGV_A6 A3+1 #define ftgsvk_LONGV_A7 A3+1 FCALLSCSUB11(ffgsvjj,FTGSVK,ftgsvk,FITSUNIT,INT,INT,LONGV,LONGV,LONGV,LONGV,LONGLONG,LONGLONGV,PLOGICAL,PINT) #define ftgsve_LONGV_A4 A3+1 #define ftgsve_LONGV_A5 A3+1 #define ftgsve_LONGV_A6 A3+1 #define ftgsve_LONGV_A7 A3+1 FCALLSCSUB11(ffgsve,FTGSVE,ftgsve,FITSUNIT,INT,INT,LONGV,LONGV,LONGV,LONGV,FLOAT,FLOATV,PLOGICAL,PINT) #define ftgsvd_LONGV_A4 A3+1 #define ftgsvd_LONGV_A5 A3+1 #define ftgsvd_LONGV_A6 A3+1 #define ftgsvd_LONGV_A7 A3+1 FCALLSCSUB11(ffgsvd,FTGSVD,ftgsvd,FITSUNIT,INT,INT,LONGV,LONGV,LONGV,LONGV,DOUBLE,DOUBLEV,PLOGICAL,PINT) /* Must handle LOGICALV conversion manually */ void Cffgsfb( fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, unsigned char *array, int *flagval, int *anynul, int *status ); void Cffgsfb( fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, unsigned char *array, int *flagval, int *anynul, int *status ) { char *Cflagval; long nflagval; int i; for( nflagval=1, i=0; iFwork_fn(&a1,&a2,&a3,&a4,&n_cols,units,colnum,datatype, iotype,repeat,&status,f->userData, ptrs[ 0], ptrs[ 1], ptrs[ 2], ptrs[ 3], ptrs[ 4], ptrs[ 5], ptrs[ 6], ptrs[ 7], ptrs[ 8], ptrs[ 9], ptrs[10], ptrs[11], ptrs[12], ptrs[13], ptrs[14], ptrs[15], ptrs[16], ptrs[17], ptrs[18], ptrs[19], ptrs[20], ptrs[21], ptrs[22], ptrs[23], ptrs[24] ); } /* Check whether there are any LOGICAL or STRING columns being outputted */ nstr=0; for( i=0;idsc$a_pointer /* We want single strings to be equivalent to string vectors with */ /* a single element, so ignore the number of elements info in the */ /* vector structure, and rely on the NUM_ELEM definitions. */ #undef STRINGV_cfT #define STRINGV_cfT(M,I,A,B,D) TTTTSTRV(A->dsc$a_pointer, B, \ A->dsc$w_length, \ num_elem(A->dsc$a_pointer, \ A->dsc$w_length, \ _3(M,_STRV_A,I) ) ) #else #ifdef CRAYFortran #define PPSTRING_cfT(M,I,A,B,D) (unsigned char*)_fcdtocp(A) #else #define PPSTRING_cfT(M,I,A,B,D) (unsigned char*)A #endif #endif #define _cfMAX(A,B) ( (A>B) ? A : B ) #define STRINGV_cfQ(B) char **B; unsigned int _(B,N), _(B,M); #define STRINGV_cfR(A,B,D) free(B[0]); free(B); #define TTSTR( A,B,D) \ ((B=(char*)malloc(_cfMAX(D,gMinStrLen)+1))[D]='\0',memcpy(B,A,D), \ kill_trailing(B,' ')) #define TTTTSTRV( A,B,D,E) ( \ _(B,N)=_cfMAX(E,1), \ _(B,M)=_cfMAX(D,gMinStrLen)+1, \ B=(char**)malloc(_(B,N)*sizeof(char*)), \ B[0]=(char*)malloc(_(B,N)*_(B,M)), \ vindex(B,_(B,M),_(B,N),f2cstrv2(A,B[0],D,_(B,M),_(B,N))) \ ) #define RRRRPSTRV(A,B,D) \ c2fstrv2(B[0],A,_(B,M),D,_(B,N)), \ free(B[0]), \ free(B); static char **vindex(char **B, int elem_len, int nelem, char *B0) { int i; if( nelem ) for( i=0;idsc$a_pointer)[0]) #define BYTEV_cfT(M,I,A,B,D) (INTEGER_BYTE*)A->dsc$a_pointer #else #ifdef CRAYFortran #define BYTE_cfN(T,A) _fcd A #define BYTEV_cfN(T,A) _fcd A #define BYTE_cfT(M,I,A,B,D) (INTEGER_BYTE)((_fcdtocp(A))[0]) #define BYTEV_cfT(M,I,A,B,D) (INTEGER_BYTE*)_fcdtocp(A) #else #define BYTE_cfN(T,A) INTEGER_BYTE * A #define BYTEV_cfN(T,A) INTEGER_BYTE * A #define BYTE_cfT(M,I,A,B,D) A[0] #define BYTEV_cfT(M,I,A,B,D) A #endif #endif /************************************************************************ The following definitions and functions handle conversions between C and Fortran arrays of LOGICALS. Individually, LOGICALS are treated as int's but as char's when in an array. cfortran defines (F2C/C2F)LOGICALV but never uses them, so these routines also handle TRUE/FALSE conversions. *************************************************************************/ #undef LOGICALV_cfSTR #undef LOGICALV_cfT #define LOGICALV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,LOGICALV,A,B,C,D,E) #define LOGICALV_cfQ(B) char *B; unsigned int _(B,N); #define LOGICALV_cfT(M,I,A,B,D) (_(B,N)= * _3(M,_LOGV_A,I), \ B=F2CcopyLogVect(_(B,N),A)) #define LOGICALV_cfR(A,B,D) C2FcopyLogVect(_(B,N),A,B); #define LOGICALV_cfH(S,U,B) static char *F2CcopyLogVect(long size, int *A) { long i; char *B; B=(char *)malloc(size*sizeof(char)); for( i=0; i #include "fitsio.h" int main(int argc, char *argv[]) { fitsfile *infptr, *outfptr; /* FITS file pointers defined in fitsio.h */ int status = 0; /* status must always be initialized = 0 */ if (argc != 3) { printf("Usage: fitscopy inputfile outputfile\n"); printf("\n"); printf("Copy an input file to an output file, optionally filtering\n"); printf("the file in the process. This seemingly simple program can\n"); printf("apply powerful filters which transform the input file as\n"); printf("it is being copied. Filters may be used to extract a\n"); printf("subimage from a larger image, select rows from a table,\n"); printf("filter a table with a GTI time extension or a SAO region file,\n"); printf("create or delete columns in a table, create an image by\n"); printf("binning (histogramming) 2 table columns, and convert IRAF\n"); printf("format *.imh or raw binary data files into FITS images.\n"); printf("See the CFITSIO User's Guide for a complete description of\n"); printf("the Extended File Name filtering syntax.\n"); printf("\n"); printf("Examples:\n"); printf("\n"); printf("fitscopy in.fit out.fit (simple file copy)\n"); printf("fitscopy - - (stdin to stdout)\n"); printf("fitscopy in.fit[11:50,21:60] out.fit (copy a subimage)\n"); printf("fitscopy iniraf.imh out.fit (IRAF image to FITS)\n"); printf("fitscopy in.dat[i512,512] out.fit (raw array to FITS)\n"); printf("fitscopy in.fit[events][pi>35] out.fit (copy rows with pi>35)\n"); printf("fitscopy in.fit[events][bin X,Y] out.fit (bin an image) \n"); printf("fitscopy in.fit[events][col x=.9*y] out.fit (new x column)\n"); printf("fitscopy in.fit[events][gtifilter()] out.fit (time filter)\n"); printf("fitscopy in.fit[2][regfilter(\"pow.reg\")] out.fit (spatial filter)\n"); printf("\n"); printf("Note that it may be necessary to enclose the input file name\n"); printf("in single quote characters on the Unix command line.\n"); return(0); } /* Open the input file */ if ( !fits_open_file(&infptr, argv[1], READONLY, &status) ) { /* Create the output file */ if ( !fits_create_file(&outfptr, argv[2], &status) ) { /* copy the previous, current, and following HDUs */ fits_copy_file(infptr, outfptr, 1, 1, 1, &status); fits_close_file(outfptr, &status); } fits_close_file(infptr, &status); } /* if error occured, print out error message */ if (status) fits_report_error(stderr, status); return(status); } cfitsio-3.47/fitscore.c0000644000225700000360000115421213464573432014400 0ustar cagordonlhea/* This file, fitscore.c, contains the core set of FITSIO routines. */ /* The FITSIO software was written by William Pence at the High Energy */ /* Astrophysic Science Archive Research Center (HEASARC) at the NASA */ /* Goddard Space Flight Center. */ /* Copyright (Unpublished--all rights reserved under the copyright laws of the United States), U.S. Government as represented by the Administrator of the National Aeronautics and Space Administration. No copyright is claimed in the United States under Title 17, U.S. Code. Permission to freely use, copy, modify, and distribute this software and its documentation without fee is hereby granted, provided that this copyright notice and disclaimer of warranty appears in all copies. DISCLAIMER: THE SOFTWARE IS PROVIDED 'AS IS' WITHOUT ANY WARRANTY OF ANY KIND, EITHER EXPRESSED, IMPLIED, OR STATUTORY, INCLUDING, BUT NOT LIMITED TO, ANY WARRANTY THAT THE SOFTWARE WILL CONFORM TO SPECIFICATIONS, ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND FREEDOM FROM INFRINGEMENT, AND ANY WARRANTY THAT THE DOCUMENTATION WILL CONFORM TO THE SOFTWARE, OR ANY WARRANTY THAT THE SOFTWARE WILL BE ERROR FREE. IN NO EVENT SHALL NASA BE LIABLE FOR ANY DAMAGES, INCLUDING, BUT NOT LIMITED TO, DIRECT, INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES, ARISING OUT OF, RESULTING FROM, OR IN ANY WAY CONNECTED WITH THIS SOFTWARE, WHETHER OR NOT BASED UPON WARRANTY, CONTRACT, TORT , OR OTHERWISE, WHETHER OR NOT INJURY WAS SUSTAINED BY PERSONS OR PROPERTY OR OTHERWISE, AND WHETHER OR NOT LOSS WAS SUSTAINED FROM, OR AROSE OUT OF THE RESULTS OF, OR USE OF, THE SOFTWARE OR SERVICES PROVIDED HEREUNDER." */ #include #include #include #include #include #include /* stddef.h is apparently needed to define size_t with some compilers ?? */ #include #include #include "fitsio2.h" #define errmsgsiz 25 #define ESMARKER 27 /* Escape character is used as error stack marker */ #define DelAll 1 /* delete all messages on the error stack */ #define DelMark 2 /* delete newest messages back to and including marker */ #define DelNewest 3 /* delete the newest message from the stack */ #define GetMesg 4 /* pop and return oldest message, ignoring marks */ #define PutMesg 5 /* add a new message to the stack */ #define PutMark 6 /* add a marker to the stack */ #ifdef _REENTRANT /* Fitsio_Lock and Fitsio_Pthread_Status are declared in fitsio2.h. */ pthread_mutex_t Fitsio_Lock; int Fitsio_Pthread_Status = 0; #endif int STREAM_DRIVER = 0; struct lconv *lcxxx; /*--------------------------------------------------------------------------*/ float ffvers(float *version) /* IO - version number */ /* return the current version number of the FITSIO software */ { *version = (float) 3.47; /* May 2019 Previous releases: *version = 3.46 Oct 2018 *version = 3.45 May 2018 *version = 3.44 Apr 2018 *version = 3.43 Mar 2018 *version = 3.42 Mar 2017 *version = 3.41 Nov 2016 *version = 3.40 Oct 2016 *version = 3.39 Apr 2016 *version = 3.38 Feb 2016 *version = 3.37 3 Jun 2014 *version = 3.36 6 Dec 2013 *version = 3.35 23 May 2013 *version = 3.34 20 Mar 2013 *version = 3.33 14 Feb 2013 *version = 3.32 Oct 2012 *version = 3.31 18 Jul 2012 *version = 3.30 11 Apr 2012 *version = 3.29 22 Sep 2011 *version = 3.28 12 May 2011 *version = 3.27 3 Mar 2011 *version = 3.26 30 Dec 2010 *version = 3.25 9 June 2010 *version = 3.24 26 Jan 2010 *version = 3.23 7 Jan 2010 *version = 3.22 28 Oct 2009 *version = 3.21 24 Sep 2009 *version = 3.20 31 Aug 2009 *version = 3.18 12 May 2009 (beta version) *version = 3.14 18 Mar 2009 *version = 3.13 5 Jan 2009 *version = 3.12 8 Oct 2008 *version = 3.11 19 Sep 2008 *version = 3.10 20 Aug 2008 *version = 3.09 3 Jun 2008 *version = 3.08 15 Apr 2007 (internal release) *version = 3.07 5 Nov 2007 (internal release) *version = 3.06 27 Aug 2007 *version = 3.05 12 Jul 2007 (internal release) *version = 3.03 11 Dec 2006 *version = 3.02 18 Sep 2006 *version = 3.01 May 2006 included in FTOOLS 6.1 release *version = 3.006 20 Feb 2006 *version = 3.005 20 Dec 2005 (beta, in heasoft swift release *version = 3.004 16 Sep 2005 (beta, in heasoft swift release *version = 3.003 28 Jul 2005 (beta, in heasoft swift release *version = 3.002 15 Apr 2005 (beta) *version = 3.001 15 Mar 2005 (beta) released with heasoft 6.0 *version = 3.000 1 Mar 2005 (internal release only) *version = 2.51 2 Dec 2004 *version = 2.50 28 Jul 2004 *version = 2.49 11 Feb 2004 *version = 2.48 28 Jan 2004 *version = 2.470 18 Aug 2003 *version = 2.460 20 May 2003 *version = 2.450 30 Apr 2003 (internal release only) *version = 2.440 8 Jan 2003 *version = 2.430; 4 Nov 2002 *version = 2.420; 19 Jul 2002 *version = 2.410; 22 Apr 2002 used in ftools v5.2 *version = 2.401; 28 Jan 2002 *version = 2.400; 18 Jan 2002 *version = 2.301; 7 Dec 2001 *version = 2.300; 23 Oct 2001 *version = 2.204; 26 Jul 2001 *version = 2.203; 19 Jul 2001 used in ftools v5.1 *version = 2.202; 22 May 2001 *version = 2.201; 15 Mar 2001 *version = 2.200; 26 Jan 2001 *version = 2.100; 26 Sep 2000 *version = 2.037; 6 Jul 2000 *version = 2.036; 1 Feb 2000 *version = 2.035; 7 Dec 1999 (internal release only) *version = 2.034; 23 Nov 1999 *version = 2.033; 17 Sep 1999 *version = 2.032; 25 May 1999 *version = 2.031; 31 Mar 1999 *version = 2.030; 24 Feb 1999 *version = 2.029; 11 Feb 1999 *version = 2.028; 26 Jan 1999 *version = 2.027; 12 Jan 1999 *version = 2.026; 23 Dec 1998 *version = 2.025; 1 Dec 1998 *version = 2.024; 9 Nov 1998 *version = 2.023; 1 Nov 1998 first full release of V2.0 *version = 1.42; 30 Apr 1998 *version = 1.40; 6 Feb 1998 *version = 1.33; 16 Dec 1997 (internal release only) *version = 1.32; 21 Nov 1997 (internal release only) *version = 1.31; 4 Nov 1997 (internal release only) *version = 1.30; 11 Sep 1997 *version = 1.27; 3 Sep 1997 (internal release only) *version = 1.25; 2 Jul 1997 *version = 1.24; 2 May 1997 *version = 1.23; 24 Apr 1997 *version = 1.22; 18 Apr 1997 *version = 1.21; 26 Mar 1997 *version = 1.2; 29 Jan 1997 *version = 1.11; 04 Dec 1996 *version = 1.101; 13 Nov 1996 *version = 1.1; 6 Nov 1996 *version = 1.04; 17 Sep 1996 *version = 1.03; 20 Aug 1996 *version = 1.02; 15 Aug 1996 *version = 1.01; 12 Aug 1996 */ return(*version); } /*--------------------------------------------------------------------------*/ int ffflnm(fitsfile *fptr, /* I - FITS file pointer */ char *filename, /* O - name of the file */ int *status) /* IO - error status */ /* return the name of the FITS file */ { strcpy(filename,(fptr->Fptr)->filename); return(*status); } /*--------------------------------------------------------------------------*/ int ffflmd(fitsfile *fptr, /* I - FITS file pointer */ int *filemode, /* O - open mode of the file */ int *status) /* IO - error status */ /* return the access mode of the FITS file */ { *filemode = (fptr->Fptr)->writemode; return(*status); } /*--------------------------------------------------------------------------*/ void ffgerr(int status, /* I - error status value */ char *errtext) /* O - error message (max 30 char long + null) */ /* Return a short descriptive error message that corresponds to the input error status value. The message may be up to 30 characters long, plus the terminating null character. */ { errtext[0] = '\0'; if (status >= 0 && status < 300) { switch (status) { case 0: strcpy(errtext, "OK - no error"); break; case 1: strcpy(errtext, "non-CFITSIO program error"); break; case 101: strcpy(errtext, "same input and output files"); break; case 103: strcpy(errtext, "attempt to open too many files"); break; case 104: strcpy(errtext, "could not open the named file"); break; case 105: strcpy(errtext, "couldn't create the named file"); break; case 106: strcpy(errtext, "error writing to FITS file"); break; case 107: strcpy(errtext, "tried to move past end of file"); break; case 108: strcpy(errtext, "error reading from FITS file"); break; case 110: strcpy(errtext, "could not close the file"); break; case 111: strcpy(errtext, "array dimensions too big"); break; case 112: strcpy(errtext, "cannot write to readonly file"); break; case 113: strcpy(errtext, "could not allocate memory"); break; case 114: strcpy(errtext, "invalid fitsfile pointer"); break; case 115: strcpy(errtext, "NULL input pointer"); break; case 116: strcpy(errtext, "error seeking file position"); break; case 117: strcpy(errtext, "bad value for file download timeout setting"); break; case 121: strcpy(errtext, "invalid URL prefix"); break; case 122: strcpy(errtext, "too many I/O drivers"); break; case 123: strcpy(errtext, "I/O driver init failed"); break; case 124: strcpy(errtext, "no I/O driver for this URLtype"); break; case 125: strcpy(errtext, "parse error in input file URL"); break; case 126: strcpy(errtext, "parse error in range list"); break; case 151: strcpy(errtext, "bad argument (shared mem drvr)"); break; case 152: strcpy(errtext, "null ptr arg (shared mem drvr)"); break; case 153: strcpy(errtext, "no free shared memory handles"); break; case 154: strcpy(errtext, "share mem drvr not initialized"); break; case 155: strcpy(errtext, "IPC system error (shared mem)"); break; case 156: strcpy(errtext, "no memory (shared mem drvr)"); break; case 157: strcpy(errtext, "share mem resource deadlock"); break; case 158: strcpy(errtext, "lock file open/create failed"); break; case 159: strcpy(errtext, "can't resize share mem block"); break; case 201: strcpy(errtext, "header already has keywords"); break; case 202: strcpy(errtext, "keyword not found in header"); break; case 203: strcpy(errtext, "keyword number out of bounds"); break; case 204: strcpy(errtext, "keyword value is undefined"); break; case 205: strcpy(errtext, "string missing closing quote"); break; case 206: strcpy(errtext, "error in indexed keyword name"); break; case 207: strcpy(errtext, "illegal character in keyword"); break; case 208: strcpy(errtext, "required keywords out of order"); break; case 209: strcpy(errtext, "keyword value not positive int"); break; case 210: strcpy(errtext, "END keyword not found"); break; case 211: strcpy(errtext, "illegal BITPIX keyword value"); break; case 212: strcpy(errtext, "illegal NAXIS keyword value"); break; case 213: strcpy(errtext, "illegal NAXISn keyword value"); break; case 214: strcpy(errtext, "illegal PCOUNT keyword value"); break; case 215: strcpy(errtext, "illegal GCOUNT keyword value"); break; case 216: strcpy(errtext, "illegal TFIELDS keyword value"); break; case 217: strcpy(errtext, "negative table row size"); break; case 218: strcpy(errtext, "negative number of rows"); break; case 219: strcpy(errtext, "named column not found"); break; case 220: strcpy(errtext, "illegal SIMPLE keyword value"); break; case 221: strcpy(errtext, "first keyword not SIMPLE"); break; case 222: strcpy(errtext, "second keyword not BITPIX"); break; case 223: strcpy(errtext, "third keyword not NAXIS"); break; case 224: strcpy(errtext, "missing NAXISn keywords"); break; case 225: strcpy(errtext, "first keyword not XTENSION"); break; case 226: strcpy(errtext, "CHDU not an ASCII table"); break; case 227: strcpy(errtext, "CHDU not a binary table"); break; case 228: strcpy(errtext, "PCOUNT keyword not found"); break; case 229: strcpy(errtext, "GCOUNT keyword not found"); break; case 230: strcpy(errtext, "TFIELDS keyword not found"); break; case 231: strcpy(errtext, "missing TBCOLn keyword"); break; case 232: strcpy(errtext, "missing TFORMn keyword"); break; case 233: strcpy(errtext, "CHDU not an IMAGE extension"); break; case 234: strcpy(errtext, "illegal TBCOLn keyword value"); break; case 235: strcpy(errtext, "CHDU not a table extension"); break; case 236: strcpy(errtext, "column exceeds width of table"); break; case 237: strcpy(errtext, "more than 1 matching col. name"); break; case 241: strcpy(errtext, "row width not = field widths"); break; case 251: strcpy(errtext, "unknown FITS extension type"); break; case 252: strcpy(errtext, "1st key not SIMPLE or XTENSION"); break; case 253: strcpy(errtext, "END keyword is not blank"); break; case 254: strcpy(errtext, "Header fill area not blank"); break; case 255: strcpy(errtext, "Data fill area invalid"); break; case 261: strcpy(errtext, "illegal TFORM format code"); break; case 262: strcpy(errtext, "unknown TFORM datatype code"); break; case 263: strcpy(errtext, "illegal TDIMn keyword value"); break; case 264: strcpy(errtext, "invalid BINTABLE heap pointer"); break; default: strcpy(errtext, "unknown error status"); break; } } else if (status < 600) { switch(status) { case 301: strcpy(errtext, "illegal HDU number"); break; case 302: strcpy(errtext, "column number < 1 or > tfields"); break; case 304: strcpy(errtext, "negative byte address"); break; case 306: strcpy(errtext, "negative number of elements"); break; case 307: strcpy(errtext, "bad first row number"); break; case 308: strcpy(errtext, "bad first element number"); break; case 309: strcpy(errtext, "not an ASCII (A) column"); break; case 310: strcpy(errtext, "not a logical (L) column"); break; case 311: strcpy(errtext, "bad ASCII table datatype"); break; case 312: strcpy(errtext, "bad binary table datatype"); break; case 314: strcpy(errtext, "null value not defined"); break; case 317: strcpy(errtext, "not a variable length column"); break; case 320: strcpy(errtext, "illegal number of dimensions"); break; case 321: strcpy(errtext, "1st pixel no. > last pixel no."); break; case 322: strcpy(errtext, "BSCALE or TSCALn = 0."); break; case 323: strcpy(errtext, "illegal axis length < 1"); break; case 340: strcpy(errtext, "not group table"); break; case 341: strcpy(errtext, "HDU already member of group"); break; case 342: strcpy(errtext, "group member not found"); break; case 343: strcpy(errtext, "group not found"); break; case 344: strcpy(errtext, "bad group id"); break; case 345: strcpy(errtext, "too many HDUs tracked"); break; case 346: strcpy(errtext, "HDU alread tracked"); break; case 347: strcpy(errtext, "bad Grouping option"); break; case 348: strcpy(errtext, "identical pointers (groups)"); break; case 360: strcpy(errtext, "malloc failed in parser"); break; case 361: strcpy(errtext, "file read error in parser"); break; case 362: strcpy(errtext, "null pointer arg (parser)"); break; case 363: strcpy(errtext, "empty line (parser)"); break; case 364: strcpy(errtext, "cannot unread > 1 line"); break; case 365: strcpy(errtext, "parser too deeply nested"); break; case 366: strcpy(errtext, "file open failed (parser)"); break; case 367: strcpy(errtext, "hit EOF (parser)"); break; case 368: strcpy(errtext, "bad argument (parser)"); break; case 369: strcpy(errtext, "unexpected token (parser)"); break; case 401: strcpy(errtext, "bad int to string conversion"); break; case 402: strcpy(errtext, "bad float to string conversion"); break; case 403: strcpy(errtext, "keyword value not integer"); break; case 404: strcpy(errtext, "keyword value not logical"); break; case 405: strcpy(errtext, "keyword value not floating pt"); break; case 406: strcpy(errtext, "keyword value not double"); break; case 407: strcpy(errtext, "bad string to int conversion"); break; case 408: strcpy(errtext, "bad string to float conversion"); break; case 409: strcpy(errtext, "bad string to double convert"); break; case 410: strcpy(errtext, "illegal datatype code value"); break; case 411: strcpy(errtext, "illegal no. of decimals"); break; case 412: strcpy(errtext, "datatype conversion overflow"); break; case 413: strcpy(errtext, "error compressing image"); break; case 414: strcpy(errtext, "error uncompressing image"); break; case 420: strcpy(errtext, "bad date or time conversion"); break; case 431: strcpy(errtext, "syntax error in expression"); break; case 432: strcpy(errtext, "expression result wrong type"); break; case 433: strcpy(errtext, "vector result too large"); break; case 434: strcpy(errtext, "missing output column"); break; case 435: strcpy(errtext, "bad data in parsed column"); break; case 436: strcpy(errtext, "output extension of wrong type"); break; case 501: strcpy(errtext, "WCS angle too large"); break; case 502: strcpy(errtext, "bad WCS coordinate"); break; case 503: strcpy(errtext, "error in WCS calculation"); break; case 504: strcpy(errtext, "bad WCS projection type"); break; case 505: strcpy(errtext, "WCS keywords not found"); break; default: strcpy(errtext, "unknown error status"); break; } } else { strcpy(errtext, "unknown error status"); } return; } /*--------------------------------------------------------------------------*/ void ffpmsg(const char *err_message) /* put message on to error stack */ { ffxmsg(PutMesg, (char *)err_message); return; } /*--------------------------------------------------------------------------*/ void ffpmrk(void) /* write a marker to the stack. It is then possible to pop only those messages following the marker off of the stack, leaving the previous messages unaffected. The marker is ignored by the ffgmsg routine. */ { char *dummy = 0; ffxmsg(PutMark, dummy); return; } /*--------------------------------------------------------------------------*/ int ffgmsg(char *err_message) /* get oldest message from error stack, ignoring markers */ { ffxmsg(GetMesg, err_message); return(*err_message); } /*--------------------------------------------------------------------------*/ void ffcmsg(void) /* erase all messages in the error stack */ { char *dummy = 0; ffxmsg(DelAll, dummy); return; } /*--------------------------------------------------------------------------*/ void ffcmrk(void) /* erase newest messages in the error stack, stopping if a marker is found. The marker is also erased in this case. */ { char *dummy = 0; ffxmsg(DelMark, dummy); return; } /*--------------------------------------------------------------------------*/ void ffxmsg( int action, char *errmsg) /* general routine to get, put, or clear the error message stack. Use a static array rather than allocating memory as needed for the error messages because it is likely to be more efficient and simpler to implement. Action Code: DelAll 1 delete all messages on the error stack DelMark 2 delete messages back to and including the 1st marker DelNewest 3 delete the newest message from the stack GetMesg 4 pop and return oldest message, ignoring marks PutMesg 5 add a new message to the stack PutMark 6 add a marker to the stack */ { int ii; char markflag; static char *txtbuff[errmsgsiz], *tmpbuff, *msgptr; static char errbuff[errmsgsiz][81]; /* initialize all = \0 */ static int nummsg = 0; FFLOCK; if (action == DelAll) /* clear the whole message stack */ { for (ii = 0; ii < nummsg; ii ++) *txtbuff[ii] = '\0'; nummsg = 0; } else if (action == DelMark) /* clear up to and including first marker */ { while (nummsg > 0) { nummsg--; markflag = *txtbuff[nummsg]; /* store possible marker character */ *txtbuff[nummsg] = '\0'; /* clear the buffer for this msg */ if (markflag == ESMARKER) break; /* found a marker, so quit */ } } else if (action == DelNewest) /* remove newest message from stack */ { if (nummsg > 0) { nummsg--; *txtbuff[nummsg] = '\0'; /* clear the buffer for this msg */ } } else if (action == GetMesg) /* pop and return oldest message from stack */ { /* ignoring markers */ while (nummsg > 0) { strcpy(errmsg, txtbuff[0]); /* copy oldest message to output */ *txtbuff[0] = '\0'; /* clear the buffer for this msg */ nummsg--; for (ii = 0; ii < nummsg; ii++) txtbuff[ii] = txtbuff[ii + 1]; /* shift remaining pointers */ if (errmsg[0] != ESMARKER) { /* quit if this is not a marker */ FFUNLOCK; return; } } errmsg[0] = '\0'; /* no messages in the stack */ } else if (action == PutMesg) /* add new message to stack */ { msgptr = errmsg; while (strlen(msgptr)) { if (nummsg == errmsgsiz) { tmpbuff = txtbuff[0]; /* buffers full; reuse oldest buffer */ *txtbuff[0] = '\0'; /* clear the buffer for this msg */ nummsg--; for (ii = 0; ii < nummsg; ii++) txtbuff[ii] = txtbuff[ii + 1]; /* shift remaining pointers */ txtbuff[nummsg] = tmpbuff; /* set pointer for the new message */ } else { for (ii = 0; ii < errmsgsiz; ii++) { if (*errbuff[ii] == '\0') /* find first empty buffer */ { txtbuff[nummsg] = errbuff[ii]; break; } } } strncat(txtbuff[nummsg], msgptr, 80); nummsg++; msgptr += minvalue(80, strlen(msgptr)); } } else if (action == PutMark) /* put a marker on the stack */ { if (nummsg == errmsgsiz) { tmpbuff = txtbuff[0]; /* buffers full; reuse oldest buffer */ *txtbuff[0] = '\0'; /* clear the buffer for this msg */ nummsg--; for (ii = 0; ii < nummsg; ii++) txtbuff[ii] = txtbuff[ii + 1]; /* shift remaining pointers */ txtbuff[nummsg] = tmpbuff; /* set pointer for the new message */ } else { for (ii = 0; ii < errmsgsiz; ii++) { if (*errbuff[ii] == '\0') /* find first empty buffer */ { txtbuff[nummsg] = errbuff[ii]; break; } } } *txtbuff[nummsg] = ESMARKER; /* write the marker */ *(txtbuff[nummsg] + 1) = '\0'; nummsg++; } FFUNLOCK; return; } /*--------------------------------------------------------------------------*/ int ffpxsz(int datatype) /* return the number of bytes per pixel associated with the datatype */ { if (datatype == TBYTE) return(sizeof(char)); else if (datatype == TUSHORT) return(sizeof(short)); else if (datatype == TSHORT) return(sizeof(short)); else if (datatype == TULONG) return(sizeof(long)); else if (datatype == TLONG) return(sizeof(long)); else if (datatype == TINT) return(sizeof(int)); else if (datatype == TUINT) return(sizeof(int)); else if (datatype == TFLOAT) return(sizeof(float)); else if (datatype == TDOUBLE) return(sizeof(double)); else if (datatype == TLOGICAL) return(sizeof(char)); else return(0); } /*--------------------------------------------------------------------------*/ int fftkey(const char *keyword, /* I - keyword name */ int *status) /* IO - error status */ /* Test that the keyword name conforms to the FITS standard. Must contain only capital letters, digits, minus or underscore chars. Trailing spaces are allowed. If the input status value is less than zero, then the test is modified so that upper or lower case letters are allowed, and no error messages are printed if the keyword is not legal. */ { size_t maxchr, ii; int spaces=0; char msg[FLEN_ERRMSG], testchar; if (*status > 0) /* inherit input status value if > 0 */ return(*status); maxchr=strlen(keyword); if (maxchr > 8) maxchr = 8; for (ii = 0; ii < maxchr; ii++) { if (*status == 0) testchar = keyword[ii]; else testchar = toupper(keyword[ii]); if ( (testchar >= 'A' && testchar <= 'Z') || (testchar >= '0' && testchar <= '9') || testchar == '-' || testchar == '_' ) { if (spaces) { if (*status == 0) { /* don't print error message if status < 0 */ snprintf(msg, FLEN_ERRMSG, "Keyword name contains embedded space(s): %.8s", keyword); ffpmsg(msg); } return(*status = BAD_KEYCHAR); } } else if (keyword[ii] == ' ') spaces = 1; else { if (*status == 0) { /* don't print error message if status < 0 */ snprintf(msg, FLEN_ERRMSG,"Character %d in this keyword is illegal: %.8s", (int) (ii+1), keyword); ffpmsg(msg); /* explicitly flag the 2 most common cases */ if (keyword[ii] == 0) ffpmsg(" (This a NULL (0) character)."); else if (keyword[ii] == 9) ffpmsg(" (This an ASCII TAB (9) character)."); } return(*status = BAD_KEYCHAR); } } return(*status); } /*--------------------------------------------------------------------------*/ int fftrec(char *card, /* I - keyword card to test */ int *status) /* IO - error status */ /* Test that the keyword card conforms to the FITS standard. Must contain only printable ASCII characters; */ { size_t ii, maxchr; char msg[FLEN_ERRMSG]; if (*status > 0) /* inherit input status value if > 0 */ return(*status); maxchr = strlen(card); for (ii = 8; ii < maxchr; ii++) { if (card[ii] < 32 || card[ii] > 126) { snprintf(msg, FLEN_ERRMSG, "Character %d in this keyword is illegal. Hex Value = %X", (int) (ii+1), (int) card[ii] ); if (card[ii] == 0) strncat(msg, " (NULL char.)",FLEN_ERRMSG-strlen(msg)-1); else if (card[ii] == 9) strncat(msg, " (TAB char.)",FLEN_ERRMSG-strlen(msg)-1); else if (card[ii] == 10) strncat(msg, " (Line Feed char.)",FLEN_ERRMSG-strlen(msg)-1); else if (card[ii] == 11) strncat(msg, " (Vertical Tab)",FLEN_ERRMSG-strlen(msg)-1); else if (card[ii] == 12) strncat(msg, " (Form Feed char.)",FLEN_ERRMSG-strlen(msg)-1); else if (card[ii] == 13) strncat(msg, " (Carriage Return)",FLEN_ERRMSG-strlen(msg)-1); else if (card[ii] == 27) strncat(msg, " (Escape char.)",FLEN_ERRMSG-strlen(msg)-1); else if (card[ii] == 127) strncat(msg, " (Delete char.)",FLEN_ERRMSG-strlen(msg)-1); ffpmsg(msg); strncpy(msg, card, 80); msg[80] = '\0'; ffpmsg(msg); return(*status = BAD_KEYCHAR); } } return(*status); } /*--------------------------------------------------------------------------*/ void ffupch(char *string) /* convert string to upper case, in place. */ { size_t len, ii; len = strlen(string); for (ii = 0; ii < len; ii++) string[ii] = toupper(string[ii]); return; } /*--------------------------------------------------------------------------*/ int ffmkky(const char *keyname, /* I - keyword name */ char *value, /* I - keyword value */ const char *comm, /* I - keyword comment */ char *card, /* O - constructed keyword card */ int *status) /* IO - status value */ /* Make a complete FITS 80-byte keyword card from the input name, value and comment strings. Output card is null terminated without any trailing blanks. */ { size_t namelen, len, ii; char tmpname[FLEN_KEYWORD], tmpname2[FLEN_KEYWORD],*cptr; char *saveptr; int tstatus = -1, nblank = 0, ntoken = 0, maxlen = 0, specialchar = 0; if (*status > 0) return(*status); *tmpname = '\0'; *tmpname2 = '\0'; *card = '\0'; /* skip leading blanks in the name */ while(*(keyname + nblank) == ' ') nblank++; strncat(tmpname, keyname + nblank, FLEN_KEYWORD - 1); len = strlen(value); namelen = strlen(tmpname); /* delete non-significant trailing blanks in the name */ if (namelen) { cptr = tmpname + namelen - 1; while(*cptr == ' ') { *cptr = '\0'; cptr--; } namelen = cptr - tmpname + 1; } /* check that the name does not contain an '=' (equals sign) */ if (strchr(tmpname, '=') ) { ffpmsg("Illegal keyword name; contains an equals sign (=)"); ffpmsg(tmpname); return(*status = BAD_KEYCHAR); } if (namelen <= 8 && fftkey(tmpname, &tstatus) <= 0 ) { /* a normal 8-char (or less) FITS keyword. */ strcat(card, tmpname); /* copy keyword name to buffer */ for (ii = namelen; ii < 8; ii++) card[ii] = ' '; /* pad keyword name with spaces */ card[8] = '='; /* append '= ' in columns 9-10 */ card[9] = ' '; card[10] = '\0'; /* terminate the partial string */ namelen = 10; } else if ((FSTRNCMP(tmpname, "HIERARCH ", 9) == 0) || (FSTRNCMP(tmpname, "hierarch ", 9) == 0) ) { /* this is an explicit ESO HIERARCH keyword */ strcat(card, tmpname); /* copy keyword name to buffer */ if (namelen + 3 + len > 80) { /* save 1 char by not putting a space before the equals sign */ strcat(card, "= "); namelen += 2; } else { strcat(card, " = "); namelen += 3; } } else { /* scan the keyword name to determine the number and max length of the tokens */ /* and test if any of the tokens contain nonstandard characters */ strncat(tmpname2, tmpname, FLEN_KEYWORD - 1); cptr = ffstrtok(tmpname2, " ",&saveptr); while (cptr) { if (strlen(cptr) > maxlen) maxlen = strlen(cptr); /* find longest token */ /* name contains special characters? */ tstatus = -1; /* suppress any error message */ if (fftkey(cptr, &tstatus) > 0) specialchar = 1; cptr = ffstrtok(NULL, " ",&saveptr); ntoken++; } tstatus = -1; /* suppress any error message */ /* if (ntoken > 1) { */ if (ntoken > 0) { /* temporarily change so that this case should always be true */ /* for now at least, treat all cases as an implicit ESO HIERARCH keyword. */ /* This could change if FITS is ever expanded to directly support longer keywords. */ if (namelen + 11 > FLEN_CARD-1) { ffpmsg( "The following keyword is too long to fit on a card:"); ffpmsg(keyname); return(*status = BAD_KEYCHAR); } strcat(card, "HIERARCH "); strcat(card, tmpname); namelen += 9; if (namelen + 3 + len > 80) { /* save 1 char by not putting a space before the equals sign */ strcat(card, "= "); namelen += 2; } else { strcat(card, " = "); namelen += 3; } } else if ((fftkey(tmpname, &tstatus) <= 0)) { /* should never get here (at least for now) */ /* allow keyword names longer than 8 characters */ strncat(card, tmpname, FLEN_KEYWORD - 1); strcat(card, "= "); namelen += 2; } else { /* should never get here (at least for now) */ ffpmsg("Illegal keyword name:"); ffpmsg(tmpname); return(*status = BAD_KEYCHAR); } } if (len > 0) /* now process the value string */ { if (value[0] == '\'') /* is this a quoted string value? */ { if (namelen > 77) { ffpmsg( "The following keyword + value is too long to fit on a card:"); ffpmsg(keyname); ffpmsg(value); return(*status = BAD_KEYCHAR); } strncat(card, value, 80 - namelen); /* append the value string */ len = minvalue(80, namelen + len); /* restore the closing quote if it got truncated */ if (len == 80) { card[79] = '\''; } if (comm) { if (comm[0] != 0) { if (len < 30) { for (ii = len; ii < 30; ii++) card[ii] = ' '; /* fill with spaces to col 30 */ card[30] = '\0'; len = 30; } } } } else { if (namelen + len > 80) { ffpmsg( "The following keyword + value is too long to fit on a card:"); ffpmsg(keyname); ffpmsg(value); return(*status = BAD_KEYCHAR); } else if (namelen + len < 30) { /* add spaces so field ends at least in col 30 */ strncat(card, " ", 30 - (namelen + len)); } strncat(card, value, 80 - namelen); /* append the value string */ len = minvalue(80, namelen + len); len = maxvalue(30, len); } if (comm) { if ((len < 77) && ( strlen(comm) > 0) ) /* room for a comment? */ { strcat(card, " / "); /* append comment separator */ strncat(card, comm, 77 - len); /* append comment (what fits) */ } } } else { if (namelen == 10) /* This case applies to normal keywords only */ { card[8] = ' '; /* keywords with no value have no '=' */ if (comm) { strncat(card, comm, 80 - namelen); /* append comment (what fits) */ } } } /* issue a warning if this keyword does not strictly conform to the standard HIERARCH convention, which requires, 1) at least 2 tokens in the name, 2) no tokens longer than 8 characters, and 3) no special characters in any of the tokens */ if (ntoken == 1 || specialchar == 1) { ffpmsg("Warning: the following keyword does not conform to the HIERARCH convention"); /* ffpmsg(" (e.g., name is not hierarchical or contains non-standard characters)."); */ ffpmsg(card); } return(*status); } /*--------------------------------------------------------------------------*/ int ffmkey(fitsfile *fptr, /* I - FITS file pointer */ const char *card, /* I - card string value */ int *status) /* IO - error status */ /* replace the previously read card (i.e. starting 80 bytes before the (fptr->Fptr)->nextkey position) with the contents of the input card. */ { char tcard[81]; size_t len, ii; int keylength = 8; /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); strncpy(tcard,card,80); tcard[80] = '\0'; len = strlen(tcard); /* silently replace any illegal characters with a space */ for (ii=0; ii < len; ii++) if (tcard[ii] < ' ' || tcard[ii] > 126) tcard[ii] = ' '; for (ii=len; ii < 80; ii++) /* fill card with spaces if necessary */ tcard[ii] = ' '; keylength = strcspn(tcard, "="); if (keylength == 80) keylength = 8; for (ii=0; ii < keylength; ii++) /* make sure keyword name is uppercase */ tcard[ii] = toupper(tcard[ii]); fftkey(tcard, status); /* test keyword name contains legal chars */ /* no need to do this any more, since any illegal characters have been removed fftrec(tcard, status); */ /* test rest of keyword for legal chars */ /* move position of keyword to be over written */ ffmbyt(fptr, ((fptr->Fptr)->nextkey) - 80, REPORT_EOF, status); ffpbyt(fptr, 80, tcard, status); /* write the 80 byte card */ return(*status); } /*--------------------------------------------------------------------------*/ int ffkeyn(const char *keyroot, /* I - root string for keyword name */ int value, /* I - index number to be appended to root name */ char *keyname, /* O - output root + index keyword name */ int *status) /* IO - error status */ /* Construct a keyword name string by appending the index number to the root. e.g., if root = "TTYPE" and value = 12 then keyname = "TTYPE12". */ { char suffix[16]; size_t rootlen; keyname[0] = '\0'; /* initialize output name to null */ rootlen = strlen(keyroot); if (rootlen == 0 || value < 0 ) return(*status = 206); snprintf(suffix, 16, "%d", value); /* construct keyword suffix */ strcpy(keyname, keyroot); /* copy root string to name string */ while (rootlen > 0 && keyname[rootlen - 1] == ' ') { rootlen--; /* remove trailing spaces in root name */ keyname[rootlen] = '\0'; } if (strlen(suffix) + strlen(keyname) > 8) return (*status=206); strcat(keyname, suffix); /* append suffix to the root */ return(*status); } /*--------------------------------------------------------------------------*/ int ffnkey(int value, /* I - index number to be appended to root name */ const char *keyroot, /* I - root string for keyword name */ char *keyname, /* O - output root + index keyword name */ int *status) /* IO - error status */ /* Construct a keyword name string by appending the root string to the index number. e.g., if root = "TTYPE" and value = 12 then keyname = "12TTYPE". */ { size_t rootlen; keyname[0] = '\0'; /* initialize output name to null */ rootlen = strlen(keyroot); if (rootlen == 0 || rootlen > 7 || value < 0 ) return(*status = 206); snprintf(keyname, FLEN_VALUE,"%d", value); /* construct keyword prefix */ if (rootlen + strlen(keyname) > 8) return(*status = 206); strcat(keyname, keyroot); /* append root to the prefix */ return(*status); } /*--------------------------------------------------------------------------*/ int ffpsvc(char *card, /* I - FITS header card (nominally 80 bytes long) */ char *value, /* O - value string parsed from the card */ char *comm, /* O - comment string parsed from the card */ int *status) /* IO - error status */ /* ParSe the Value and Comment strings from the input header card string. If the card contains a quoted string value, the returned value string includes the enclosing quote characters. If comm = NULL, don't return the comment string. */ { int jj; size_t ii, cardlen, nblank, valpos; if (*status > 0) return(*status); value[0] = '\0'; if (comm) comm[0] = '\0'; cardlen = strlen(card); /* support for ESO HIERARCH keywords; find the '=' */ if (FSTRNCMP(card, "HIERARCH ", 9) == 0) { valpos = strcspn(card, "="); if (valpos == cardlen) /* no value indicator ??? */ { if (comm != NULL) { if (cardlen > 8) { strcpy(comm, &card[8]); jj=cardlen - 8; for (jj--; jj >= 0; jj--) /* replace trailing blanks with nulls */ { if (comm[jj] == ' ') comm[jj] = '\0'; else break; } } } return(*status); /* no value indicator */ } valpos++; /* point to the position after the '=' */ } else if (cardlen < 9 || FSTRNCMP(card, "COMMENT ", 8) == 0 || /* keywords with no value */ FSTRNCMP(card, "HISTORY ", 8) == 0 || FSTRNCMP(card, "END ", 8) == 0 || FSTRNCMP(card, "CONTINUE", 8) == 0 || FSTRNCMP(card, " ", 8) == 0 ) { /* no value, so the comment extends from cols 9 - 80 */ if (comm != NULL) { if (cardlen > 8) { strcpy(comm, &card[8]); jj=cardlen - 8; for (jj--; jj >= 0; jj--) /* replace trailing blanks with nulls */ { if (comm[jj] == ' ') comm[jj] = '\0'; else break; } } } return(*status); } else if (FSTRNCMP(&card[8], "= ", 2) == 0 ) { /* normal keyword with '= ' in cols 9-10 */ valpos = 10; /* starting position of the value field */ } else { valpos = strcspn(card, "="); if (valpos == cardlen) /* no value indicator ??? */ { if (comm != NULL) { if (cardlen > 8) { strcpy(comm, &card[8]); jj=cardlen - 8; for (jj--; jj >= 0; jj--) /* replace trailing blanks with nulls */ { if (comm[jj] == ' ') comm[jj] = '\0'; else break; } } } return(*status); /* no value indicator */ } valpos++; /* point to the position after the '=' */ } nblank = strspn(&card[valpos], " "); /* find number of leading blanks */ if (nblank + valpos == cardlen) { /* the absence of a value string is legal, and simply indicates that the keyword value is undefined. Don't write an error message in this case. */ return(*status); } ii = valpos + nblank; if (card[ii] == '/' ) /* slash indicates start of the comment */ { ii++; } else if (card[ii] == '\'' ) /* is this a quoted string value? */ { value[0] = card[ii]; for (jj=1, ii++; ii < cardlen; ii++, jj++) { if (card[ii] == '\'') /* is this the closing quote? */ { if (card[ii+1] == '\'') /* 2 successive quotes? */ { value[jj] = card[ii]; ii++; jj++; } else { value[jj] = card[ii]; break; /* found the closing quote, so exit this loop */ } } value[jj] = card[ii]; /* copy the next character to the output */ } if (ii == cardlen) { jj = minvalue(jj, 69); /* don't exceed 70 char string length */ value[jj] = '\''; /* close the bad value string */ value[jj+1] = '\0'; /* terminate the bad value string */ ffpmsg("This keyword string value has no closing quote:"); ffpmsg(card); /* May 2008 - modified to not fail on this minor error */ /* return(*status = NO_QUOTE); */ } else { value[jj+1] = '\0'; /* terminate the good value string */ ii++; /* point to the character following the value */ } } else if (card[ii] == '(' ) /* is this a complex value? */ { nblank = strcspn(&card[ii], ")" ); /* find closing ) */ if (nblank == strlen( &card[ii] ) ) { ffpmsg("This complex keyword value has no closing ')':"); ffpmsg(card); return(*status = NO_QUOTE); } nblank++; strncpy(value, &card[ii], nblank); value[nblank] = '\0'; ii = ii + nblank; } else /* an integer, floating point, or logical FITS value string */ { nblank = strcspn(&card[ii], " /"); /* find the end of the token */ strncpy(value, &card[ii], nblank); value[nblank] = '\0'; ii = ii + nblank; } /* now find the comment string, if any */ if (comm) { nblank = strspn(&card[ii], " "); /* find next non-space character */ ii = ii + nblank; if (ii < 80) { if (card[ii] == '/') /* ignore the slash separator */ { ii++; if (card[ii] == ' ') /* also ignore the following space */ ii++; } strcat(comm, &card[ii]); /* copy the remaining characters */ jj=strlen(comm); for (jj--; jj >= 0; jj--) /* replace trailing blanks with nulls */ { if (comm[jj] == ' ') comm[jj] = '\0'; else break; } } } return(*status); } /*--------------------------------------------------------------------------*/ int ffgthd(char *tmplt, /* I - input header template string */ char *card, /* O - returned FITS header record */ int *hdtype, /* O - how to interpreter the returned card string */ /* -2 = modify the name of a keyword; the old keyword name is returned starting at address chars[0]; the new name is returned starting at address char[40] (to be consistent with the Fortran version). Both names are null terminated. -1 = card contains the name of a keyword that is to be deleted 0 = append this keyword if it doesn't already exist, or modify the value if the keyword already exists. 1 = append this comment keyword ('HISTORY', 'COMMENT', or blank keyword name) 2 = this is the END keyword; do not write it to the header */ int *status) /* IO - error status */ /* 'Get Template HeaDer' parse a template header line and create a formated character string which is suitable for appending to a FITS header */ { char keyname[FLEN_KEYWORD], value[140], comment[140]; char *tok, *suffix, *loc, tvalue[140]; int len, vlen, more, tstatus, lentok1=0, remainlen=0; double dval; if (*status > 0) return(*status); card[0] = '\0'; *hdtype = 0; if (!FSTRNCMP(tmplt, " ", 8) ) { /* if first 8 chars of template are blank, then this is a comment */ strncat(card, tmplt, 80); *hdtype = 1; return(*status); } tok = tmplt; /* point to start of template string */ keyname[0] = '\0'; value[0] = '\0'; comment[0] = '\0'; len = strspn(tok, " "); /* no. of spaces before keyword */ tok += len; /* test for pecular case where token is a string of dashes */ if (strncmp(tok, "--------------------", 20) == 0) return(*status = BAD_KEYCHAR); if (tok[0] == '-') /* is there a leading minus sign? */ { /* first token is name of keyword to be deleted or renamed */ *hdtype = -1; tok++; len = strspn(tok, " "); /* no. of spaces before keyword */ tok += len; len = strcspn(tok, " =+"); /* length of name */ if (len >= FLEN_KEYWORD) return(*status = BAD_KEYCHAR); lentok1 = len; strncat(card, tok, len); /* The HIERARCH convention supports non-standard characters in the keyword name, so don't always convert to upper case or abort if there are illegal characters in the name or if the name is greater than 8 characters long. */ if (len < 9) /* this is possibly a normal FITS keyword name */ { ffupch(card); tstatus = 0; if (fftkey(card, &tstatus) > 0) { /* name contained non-standard characters, so reset */ card[0] = '\0'; strncat(card, tok, len); } } tok += len; /* Check optional "+" indicator to delete multiple keywords */ if (tok[0] == '+' && len < FLEN_KEYWORD) { strcat(card, "+"); return (*status); } /* second token, if present, is the new name for the keyword */ len = strspn(tok, " "); /* no. of spaces before next token */ tok += len; if (tok[0] == '\0' || tok[0] == '=') return(*status); /* no second token */ *hdtype = -2; len = strcspn(tok, " "); /* length of new name */ /* this name has to fit on columns 41-80 of card, and first name must now fit in 1-40 */ if (lentok1 > 40) { card[0] = '\0'; return (*status = BAD_KEYCHAR); } if (len > 40) { card[0] = '\0'; return(*status = BAD_KEYCHAR); } /* copy the new name to card + 40; This is awkward, */ /* but is consistent with the way the Fortran FITSIO works */ strcat(card," "); strncpy(&card[40], tok, len); card[80] = '\0'; /* necessary to add terminator in case len = 40 */ /* The HIERARCH convention supports non-standard characters in the keyword name, so don't always convert to upper case or abort if there are illegal characters in the name or if the name is greater than 8 characters long. */ if (len < 9) /* this is possibly a normal FITS keyword name */ { ffupch(&card[40]); tstatus = 0; if (fftkey(&card[40], &tstatus) > 0) { /* name contained non-standard characters, so reset */ strncpy(&card[40], tok, len); } } } else /* no negative sign at beginning of template */ { /* get the keyword name token */ len = strcspn(tok, " ="); /* length of keyword name */ if (len >= FLEN_KEYWORD) return(*status = BAD_KEYCHAR); strncat(keyname, tok, len); /* The HIERARCH convention supports non-standard characters in the keyword name, so don't always convert to upper case or abort if there are illegal characters in the name or if the name is greater than 8 characters long. */ if (len < 9) /* this is possibly a normal FITS keyword name */ { ffupch(keyname); tstatus = 0; if (fftkey(keyname, &tstatus) > 0) { /* name contained non-standard characters, so reset */ keyname[0] = '\0'; strncat(keyname, tok, len); } } if (!FSTRCMP(keyname, "END") ) { strcpy(card, "END"); *hdtype = 2; return(*status); } tok += len; /* move token pointer to end of the keyword */ if (!FSTRCMP(keyname, "COMMENT") || !FSTRCMP(keyname, "HISTORY") || !FSTRCMP(keyname, "HIERARCH") ) { *hdtype = 1; /* simply append COMMENT and HISTORY keywords */ strcpy(card, keyname); strncat(card, tok, 72); return(*status); } /* look for the value token */ len = strspn(tok, " ="); /* spaces or = between name and value */ tok += len; if (*tok == '\'') /* is value enclosed in quotes? */ { more = TRUE; remainlen = 139; while (more) { tok++; /* temporarily move past the quote char */ len = strcspn(tok, "'"); /* length of quoted string */ tok--; if (len+2 > remainlen) return (*status=BAD_KEYCHAR); strncat(value, tok, len + 2); remainlen -= (len+2); tok += len + 1; if (tok[0] != '\'') /* check there is a closing quote */ return(*status = NO_QUOTE); tok++; if (tok[0] != '\'') /* 2 quote chars = literal quote */ more = FALSE; } } else if (*tok == '/' || *tok == '\0') /* There is no value */ { strcat(value, " "); } else /* not a quoted string value */ { len = strcspn(tok, " /"); /* length of value string */ if (len > 139) return (*status=BAD_KEYCHAR); strncat(value, tok, len); if (!( (tok[0] == 'T' || tok[0] == 'F') && (tok[1] == ' ' || tok[1] == '/' || tok[1] == '\0') )) { /* not a logical value */ dval = strtod(value, &suffix); /* try to read value as number */ if (*suffix != '\0' && *suffix != ' ' && *suffix != '/') { /* value not recognized as a number; might be because it */ /* contains a 'd' or 'D' exponent character */ strcpy(tvalue, value); if ((loc = strchr(tvalue, 'D'))) { *loc = 'E'; /* replace D's with E's. */ dval = strtod(tvalue, &suffix); /* read value again */ } else if ((loc = strchr(tvalue, 'd'))) { *loc = 'E'; /* replace d's with E's. */ dval = strtod(tvalue, &suffix); /* read value again */ } else if ((loc = strchr(tvalue, '.'))) { *loc = ','; /* replace period with a comma */ dval = strtod(tvalue, &suffix); /* read value again */ } } if (*suffix != '\0' && *suffix != ' ' && *suffix != '/') { /* value is not a number; must enclose it in quotes */ if (len > 137) return (*status=BAD_KEYCHAR); strcpy(value, "'"); strncat(value, tok, len); strcat(value, "'"); /* the following useless statement stops the compiler warning */ /* that dval is not used anywhere */ if (dval == 0.) len += (int) dval; } else { /* value is a number; convert any 'e' to 'E', or 'd' to 'D' */ loc = strchr(value, 'e'); if (loc) { *loc = 'E'; } else { loc = strchr(value, 'd'); if (loc) { *loc = 'D'; } } } } tok += len; } len = strspn(tok, " /"); /* no. of spaces between value and comment */ tok += len; vlen = strlen(value); if (vlen > 0 && vlen < 10 && value[0] == '\'') { /* pad quoted string with blanks so it is at least 8 chars long */ value[vlen-1] = '\0'; strncat(value, " ", 10 - vlen); strcat(&value[9], "'"); } /* get the comment string */ strncat(comment, tok, 70); /* construct the complete FITS header card */ ffmkky(keyname, value, comment, card, status); } return(*status); } /*--------------------------------------------------------------------------*/ int fits_translate_keyword( char *inrec, /* I - input string */ char *outrec, /* O - output converted string, or */ /* a null string if input does not */ /* match any of the patterns */ char *patterns[][2],/* I - pointer to input / output string */ /* templates */ int npat, /* I - number of templates passed */ int n_value, /* I - base 'n' template value of interest */ int n_offset, /* I - offset to be applied to the 'n' */ /* value in the output string */ int n_range, /* I - controls range of 'n' template */ /* values of interest (-1,0, or +1) */ int *pat_num, /* O - matched pattern number (0 based) or -1 */ int *i, /* O - value of i, if any, else 0 */ int *j, /* O - value of j, if any, else 0 */ int *m, /* O - value of m, if any, else 0 */ int *n, /* O - value of n, if any, else 0 */ int *status) /* IO - error status */ /* Translate a keyword name to a new name, based on a set of patterns. The user passes an array of patterns to be matched. Input pattern number i is pattern[i][0], and output pattern number i is pattern[i][1]. Keywords are matched against the input patterns. If a match is found then the keyword is re-written according to the output pattern. Order is important. The first match is accepted. The fastest match will be made when templates with the same first character are grouped together. Several characters have special meanings: i,j - single digits, preserved in output template n - column number of one or more digits, preserved in output template m - generic number of one or more digits, preserved in output template a - coordinate designator, preserved in output template # - number of one or more digits ? - any character * - only allowed in first character position, to match all keywords; only useful as last pattern in the list i, j, n, and m are returned by the routine. For example, the input pattern "iCTYPn" will match "1CTYP5" (if n_value is 5); the output pattern "CTYPEi" will be re-written as "CTYPE1". Notice that "i" is preserved. The following output patterns are special Special output pattern characters: "-" - do not copy a keyword that matches the corresponding input pattern "+" - copy the input unchanged The inrec string could be just the 8-char keyword name, or the entire 80-char header record. Characters 9 = 80 in the input string simply get appended to the translated keyword name. If n_range = 0, then only keywords with 'n' equal to n_value will be considered as a pattern match. If n_range = +1, then all values of 'n' greater than or equal to n_value will be a match, and if -1, then values of 'n' less than or equal to n_value will match. This routine was written by Craig Markwardt, GSFC */ { int i1 = 0, j1 = 0, n1 = 0, m1 = 0; int fac; char a = ' '; char oldp; char c, s; int ip, ic, pat, pass = 0, firstfail; char *spat; if (*status > 0) return(*status); if ((inrec == 0) || (outrec == 0)) return (*status = NULL_INPUT_PTR); *outrec = '\0'; /* if (*inrec == '\0') return 0; */ if (*inrec == '\0') /* expand to full 8 char blank keyword name */ strcpy(inrec, " "); oldp = '\0'; firstfail = 0; /* ===== Pattern match stage */ for (pat=0; pat < npat; pat++) { spat = patterns[pat][0]; i1 = 0; j1 = 0; m1 = -1; n1 = -1; a = ' '; /* Initialize the place-holders */ pass = 0; /* Pass the wildcard pattern */ if (spat[0] == '*') { pass = 1; break; } /* Optimization: if we have seen this initial pattern character before, then it must have failed, and we can skip the pattern */ if (firstfail && spat[0] == oldp) continue; oldp = spat[0]; /* ip = index of pattern character being matched ic = index of keyname character being matched firstfail = 1 if we fail on the first characteor (0=not) */ for (ip=0, ic=0, firstfail=1; (spat[ip]) && (ic < 8); ip++, ic++, firstfail=0) { c = inrec[ic]; s = spat[ip]; if (s == 'i') { /* Special pattern: 'i' placeholder */ if (isdigit(c)) { i1 = c - '0'; pass = 1;} } else if (s == 'j') { /* Special pattern: 'j' placeholder */ if (isdigit(c)) { j1 = c - '0'; pass = 1;} } else if ((s == 'n')||(s == 'm')||(s == '#')) { /* Special patterns: multi-digit number */ int val = 0; pass = 0; if (isdigit(c)) { pass = 1; /* NOTE, could fail below */ /* Parse decimal number */ while (ic<8 && isdigit(c)) { val = val*10 + (c - '0'); ic++; c = inrec[ic]; } ic--; c = inrec[ic]; if (s == 'n') { /* Is it a column number? */ if ( val >= 1 && val <= 999 && /* Row range check */ (((n_range == 0) && (val == n_value)) || /* Strict equality */ ((n_range == -1) && (val <= n_value)) || /* n <= n_value */ ((n_range == +1) && (val >= n_value))) ) { /* n >= n_value */ n1 = val; } else { pass = 0; } } else if (s == 'm') { /* Generic number */ m1 = val; } } } else if (s == 'a') { /* Special pattern: coordinate designator */ if (isupper(c) || c == ' ') { a = c; pass = 1;} } else if (s == '?') { /* Match any individual character */ pass = 1; } else if (c == s) { /* Match a specific character */ pass = 1; } else { /* FAIL */ pass = 0; } if (!pass) break; } /* Must pass to the end of the keyword. No partial matches allowed */ if (pass && (ic >= 8 || inrec[ic] == ' ')) break; } /* Transfer the pattern-matched numbers to the output parameters */ if (i) { *i = i1; } if (j) { *j = j1; } if (n) { *n = n1; } if (m) { *m = m1; } if (pat_num) { *pat_num = pat; } /* ===== Keyword rewriting and output stage */ spat = patterns[pat][1]; /* Return case: no match, or explicit deletion pattern */ if (pass == 0 || spat[0] == '\0' || spat[0] == '-') return 0; /* A match: we start by copying the input record to the output */ strcpy(outrec, inrec); /* Return case: return the input record unchanged */ if (spat[0] == '+') return 0; /* Final case: a new output pattern */ for (ip=0, ic=0; spat[ip]; ip++, ic++) { s = spat[ip]; if (s == 'i') { outrec[ic] = (i1+'0'); } else if (s == 'j') { outrec[ic] = (j1+'0'); } else if (s == 'n') { if (n1 == -1) { n1 = n_value; } if (n1 > 0) { n1 += n_offset; for (fac = 1; (n1/fac) > 0; fac *= 10); fac /= 10; while(fac > 0) { outrec[ic] = ((n1/fac) % 10) + '0'; fac /= 10; ic ++; } ic--; } } else if (s == 'm' && m1 >= 0) { for (fac = 1; (m1/fac) > 0; fac *= 10); fac /= 10; while(fac > 0) { outrec[ic] = ((m1/fac) % 10) + '0'; fac /= 10; ic ++; } ic --; } else if (s == 'a') { outrec[ic] = a; } else { outrec[ic] = s; } } /* Pad the keyword name with spaces */ for ( ; ic<8; ic++) { outrec[ic] = ' '; } return(*status); } /*--------------------------------------------------------------------------*/ int fits_translate_keywords( fitsfile *infptr, /* I - pointer to input HDU */ fitsfile *outfptr, /* I - pointer to output HDU */ int firstkey, /* I - first HDU record number to start with */ char *patterns[][2],/* I - pointer to input / output keyword templates */ int npat, /* I - number of templates passed */ int n_value, /* I - base 'n' template value of interest */ int n_offset, /* I - offset to be applied to the 'n' */ /* value in the output string */ int n_range, /* I - controls range of 'n' template */ /* values of interest (-1,0, or +1) */ int *status) /* IO - error status */ /* Copy relevant keywords from the table header into the newly created primary array header. Convert names of keywords where appropriate. See fits_translate_keyword() for the definitions. Translation begins at header record number 'firstkey', and continues to the end of the header. This routine was written by Craig Markwardt, GSFC */ { int nrec, nkeys, nmore; char rec[FLEN_CARD]; int i = 0, j = 0, n = 0, m = 0; int pat_num = 0, maxchr, ii; char outrec[FLEN_CARD]; if (*status > 0) return(*status); ffghsp(infptr, &nkeys, &nmore, status); /* get number of keywords */ for (nrec = firstkey; nrec <= nkeys; nrec++) { outrec[0] = '\0'; ffgrec(infptr, nrec, rec, status); /* silently overlook any illegal ASCII characters in the value or */ /* comment fields of the record. It is usually not appropriate to */ /* abort the process because of this minor transgression of the FITS rules. */ /* Set the offending character to a blank */ maxchr = strlen(rec); for (ii = 8; ii < maxchr; ii++) { if (rec[ii] < 32 || rec[ii] > 126) rec[ii] = ' '; } fits_translate_keyword(rec, outrec, patterns, npat, n_value, n_offset, n_range, &pat_num, &i, &j, &m, &n, status); if (outrec[0]) { ffprec(outfptr, outrec, status); /* copy the keyword */ rec[8] = 0; outrec[8] = 0; } else { rec[8] = 0; outrec[8] = 0; } } return(*status); } /*--------------------------------------------------------------------------*/ int fits_copy_pixlist2image( fitsfile *infptr, /* I - pointer to input HDU */ fitsfile *outfptr, /* I - pointer to output HDU */ int firstkey, /* I - first HDU record number to start with */ int naxis, /* I - number of axes in the image */ int *colnum, /* I - numbers of the columns to be binned */ int *status) /* IO - error status */ /* Copy relevant keywords from the pixel list table header into a newly created primary array header. Convert names of keywords where appropriate. See fits_translate_pixkeyword() for the definitions. Translation begins at header record number 'firstkey', and continues to the end of the header. */ { int nrec, nkeys, nmore; char rec[FLEN_CARD], outrec[FLEN_CARD]; int pat_num = 0, npat; int iret, jret, nret, mret, lret; char *patterns[][2] = { {"TCTYPn", "CTYPEn" }, {"TCTYna", "CTYPEna" }, {"TCUNIn", "CUNITn" }, {"TCUNna", "CUNITna" }, {"TCRVLn", "CRVALn" }, {"TCRVna", "CRVALna" }, {"TCDLTn", "CDELTn" }, {"TCDEna", "CDELTna" }, {"TCRPXn", "CRPIXn" }, {"TCRPna", "CRPIXna" }, {"TCROTn", "CROTAn" }, {"TPn_ma", "PCn_ma" }, {"TPCn_m", "PCn_ma" }, {"TCn_ma", "CDn_ma" }, {"TCDn_m", "CDn_ma" }, {"TVn_la", "PVn_la" }, {"TPVn_l", "PVn_la" }, {"TSn_la", "PSn_la" }, {"TPSn_l", "PSn_la" }, {"TWCSna", "WCSNAMEa" }, {"TCNAna", "CNAMEna" }, {"TCRDna", "CRDERna" }, {"TCSYna", "CSYERna" }, {"LONPna", "LONPOLEa" }, {"LATPna", "LATPOLEa" }, {"EQUIna", "EQUINOXa" }, {"MJDOBn", "MJD-OBS" }, {"MJDAn", "MJD-AVG" }, {"DAVGn", "DATE-AVG" }, {"RADEna", "RADESYSa" }, {"RFRQna", "RESTFRQa" }, {"RWAVna", "RESTWAVa" }, {"SPECna", "SPECSYSa" }, {"SOBSna", "SSYSOBSa" }, {"SSRCna", "SSYSSRCa" }, /* preserve common keywords */ {"LONPOLEa", "+" }, {"LATPOLEa", "+" }, {"EQUINOXa", "+" }, {"EPOCH", "+" }, {"MJD-????", "+" }, {"DATE????", "+" }, {"TIME????", "+" }, {"RADESYSa", "+" }, {"RADECSYS", "+" }, {"TELESCOP", "+" }, {"INSTRUME", "+" }, {"OBSERVER", "+" }, {"OBJECT", "+" }, /* Delete general table column keywords */ {"XTENSION", "-" }, {"BITPIX", "-" }, {"NAXIS", "-" }, {"NAXISi", "-" }, {"PCOUNT", "-" }, {"GCOUNT", "-" }, {"TFIELDS", "-" }, {"TDIM#", "-" }, {"THEAP", "-" }, {"EXTNAME", "-" }, {"EXTVER", "-" }, {"EXTLEVEL","-" }, {"CHECKSUM","-" }, {"DATASUM", "-" }, {"NAXLEN", "-" }, {"AXLEN#", "-" }, {"CPREF", "-" }, /* Delete table keywords related to other columns */ {"T????#a", "-" }, {"TC??#a", "-" }, {"T??#_#", "-" }, {"TWCS#a", "-" }, {"LONP#a", "-" }, {"LATP#a", "-" }, {"EQUI#a", "-" }, {"MJDOB#", "-" }, {"MJDA#", "-" }, {"RADE#a", "-" }, {"DAVG#", "-" }, {"iCTYP#", "-" }, {"iCTY#a", "-" }, {"iCUNI#", "-" }, {"iCUN#a", "-" }, {"iCRVL#", "-" }, {"iCDLT#", "-" }, {"iCRPX#", "-" }, {"iCTY#a", "-" }, {"iCUN#a", "-" }, {"iCRV#a", "-" }, {"iCDE#a", "-" }, {"iCRP#a", "-" }, {"ijPC#a", "-" }, {"ijCD#a", "-" }, {"iV#_#a", "-" }, {"iS#_#a", "-" }, {"iCRD#a", "-" }, {"iCSY#a", "-" }, {"iCROT#", "-" }, {"WCAX#a", "-" }, {"WCSN#a", "-" }, {"iCNA#a", "-" }, {"*", "+" }}; /* copy all other keywords */ if (*status > 0) return(*status); npat = sizeof(patterns)/sizeof(patterns[0][0])/2; ffghsp(infptr, &nkeys, &nmore, status); /* get number of keywords */ for (nrec = firstkey; nrec <= nkeys; nrec++) { outrec[0] = '\0'; ffgrec(infptr, nrec, rec, status); fits_translate_pixkeyword(rec, outrec, patterns, npat, naxis, colnum, &pat_num, &iret, &jret, &nret, &mret, &lret, status); if (outrec[0]) { ffprec(outfptr, outrec, status); /* copy the keyword */ } rec[8] = 0; outrec[8] = 0; } return(*status); } /*--------------------------------------------------------------------------*/ int fits_translate_pixkeyword( char *inrec, /* I - input string */ char *outrec, /* O - output converted string, or */ /* a null string if input does not */ /* match any of the patterns */ char *patterns[][2],/* I - pointer to input / output string */ /* templates */ int npat, /* I - number of templates passed */ int naxis, /* I - number of columns to be binned */ int *colnum, /* I - numbers of the columns to be binned */ int *pat_num, /* O - matched pattern number (0 based) or -1 */ int *i, int *j, int *n, int *m, int *l, int *status) /* IO - error status */ /* Translate a keyword name to a new name, based on a set of patterns. The user passes an array of patterns to be matched. Input pattern number i is pattern[i][0], and output pattern number i is pattern[i][1]. Keywords are matched against the input patterns. If a match is found then the keyword is re-written according to the output pattern. Order is important. The first match is accepted. The fastest match will be made when templates with the same first character are grouped together. Several characters have special meanings: i,j - single digits, preserved in output template n, m - column number of one or more digits, preserved in output template k - generic number of one or more digits, preserved in output template a - coordinate designator, preserved in output template # - number of one or more digits ? - any character * - only allowed in first character position, to match all keywords; only useful as last pattern in the list i, j, n, and m are returned by the routine. For example, the input pattern "iCTYPn" will match "1CTYP5" (if n_value is 5); the output pattern "CTYPEi" will be re-written as "CTYPE1". Notice that "i" is preserved. The following output patterns are special Special output pattern characters: "-" - do not copy a keyword that matches the corresponding input pattern "+" - copy the input unchanged The inrec string could be just the 8-char keyword name, or the entire 80-char header record. Characters 9 = 80 in the input string simply get appended to the translated keyword name. If n_range = 0, then only keywords with 'n' equal to n_value will be considered as a pattern match. If n_range = +1, then all values of 'n' greater than or equal to n_value will be a match, and if -1, then values of 'n' less than or equal to n_value will match. */ { int i1 = 0, j1 = 0, val; int fac, nval = 0, mval = 0, lval = 0; char a = ' '; char oldp; char c, s; int ip, ic, pat, pass = 0, firstfail; char *spat; if (*status > 0) return(*status); if ((inrec == 0) || (outrec == 0)) return (*status = NULL_INPUT_PTR); *outrec = '\0'; if (*inrec == '\0') return 0; oldp = '\0'; firstfail = 0; /* ===== Pattern match stage */ for (pat=0; pat < npat; pat++) { spat = patterns[pat][0]; i1 = 0; j1 = 0; a = ' '; /* Initialize the place-holders */ pass = 0; /* Pass the wildcard pattern */ if (spat[0] == '*') { pass = 1; break; } /* Optimization: if we have seen this initial pattern character before, then it must have failed, and we can skip the pattern */ if (firstfail && spat[0] == oldp) continue; oldp = spat[0]; /* ip = index of pattern character being matched ic = index of keyname character being matched firstfail = 1 if we fail on the first characteor (0=not) */ for (ip=0, ic=0, firstfail=1; (spat[ip]) && (ic < 8); ip++, ic++, firstfail=0) { c = inrec[ic]; s = spat[ip]; if (s == 'i') { /* Special pattern: 'i' placeholder */ if (isdigit(c)) { i1 = c - '0'; pass = 1;} } else if (s == 'j') { /* Special pattern: 'j' placeholder */ if (isdigit(c)) { j1 = c - '0'; pass = 1;} } else if ((s == 'n')||(s == 'm')||(s == 'l')||(s == '#')) { /* Special patterns: multi-digit number */ val = 0; pass = 0; if (isdigit(c)) { pass = 1; /* NOTE, could fail below */ /* Parse decimal number */ while (ic<8 && isdigit(c)) { val = val*10 + (c - '0'); ic++; c = inrec[ic]; } ic--; c = inrec[ic]; if (s == 'n' || s == 'm') { /* Is it a column number? */ if ( val >= 1 && val <= 999) { if (val == colnum[0]) val = 1; else if (val == colnum[1]) val = 2; else if (val == colnum[2]) val = 3; else if (val == colnum[3]) val = 4; else { pass = 0; val = 0; } if (s == 'n') nval = val; else mval = val; } else { pass = 0; } } else if (s == 'l') { /* Generic number */ lval = val; } } } else if (s == 'a') { /* Special pattern: coordinate designator */ if (isupper(c) || c == ' ') { a = c; pass = 1;} } else if (s == '?') { /* Match any individual character */ pass = 1; } else if (c == s) { /* Match a specific character */ pass = 1; } else { /* FAIL */ pass = 0; } if (!pass) break; } /* Must pass to the end of the keyword. No partial matches allowed */ if (pass && (ic >= 8 || inrec[ic] == ' ')) break; } /* Transfer the pattern-matched numbers to the output parameters */ if (i) { *i = i1; } if (j) { *j = j1; } if (n) { *n = nval; } if (m) { *m = mval; } if (l) { *l = lval; } if (pat_num) { *pat_num = pat; } /* ===== Keyword rewriting and output stage */ spat = patterns[pat][1]; /* Return case: no match, or explicit deletion pattern */ if (pass == 0 || spat[0] == '\0' || spat[0] == '-') return 0; /* A match: we start by copying the input record to the output */ strcpy(outrec, inrec); /* Return case: return the input record unchanged */ if (spat[0] == '+') return 0; /* Final case: a new output pattern */ for (ip=0, ic=0; spat[ip]; ip++, ic++) { s = spat[ip]; if (s == 'i') { outrec[ic] = (i1+'0'); } else if (s == 'j') { outrec[ic] = (j1+'0'); } else if (s == 'n' && nval > 0) { for (fac = 1; (nval/fac) > 0; fac *= 10); fac /= 10; while(fac > 0) { outrec[ic] = ((nval/fac) % 10) + '0'; fac /= 10; ic ++; } ic--; } else if (s == 'm' && mval > 0) { for (fac = 1; (mval/fac) > 0; fac *= 10); fac /= 10; while(fac > 0) { outrec[ic] = ((mval/fac) % 10) + '0'; fac /= 10; ic ++; } ic--; } else if (s == 'l' && lval >= 0) { for (fac = 1; (lval/fac) > 0; fac *= 10); fac /= 10; while(fac > 0) { outrec[ic] = ((lval/fac) % 10) + '0'; fac /= 10; ic ++; } ic --; } else if (s == 'a') { outrec[ic] = a; } else { outrec[ic] = s; } } /* Pad the keyword name with spaces */ for ( ; ic<8; ic++) { outrec[ic] = ' '; } return(*status); } /*--------------------------------------------------------------------------*/ int ffasfm(char *tform, /* I - format code from the TFORMn keyword */ int *dtcode, /* O - numerical datatype code */ long *twidth, /* O - width of the field, in chars */ int *decimals, /* O - number of decimal places (F, E, D format) */ int *status) /* IO - error status */ { /* parse the ASCII table TFORM column format to determine the data type, the field width, and number of decimal places (if relevant) */ int ii, datacode; long longval, width; float fwidth; char *form, temp[FLEN_VALUE], message[FLEN_ERRMSG]; if (*status > 0) return(*status); if (dtcode) *dtcode = 0; if (twidth) *twidth = 0; if (decimals) *decimals = 0; ii = 0; while (tform[ii] != 0 && tform[ii] == ' ') /* find first non-blank char */ ii++; if (strlen(&tform[ii]) > FLEN_VALUE-1) { ffpmsg("Error: ASCII table TFORM code is too long (ffasfm)"); return(*status = BAD_TFORM); } strcpy(temp, &tform[ii]); /* copy format string */ ffupch(temp); /* make sure it is in upper case */ form = temp; /* point to start of format string */ if (form[0] == 0) { ffpmsg("Error: ASCII table TFORM code is blank"); return(*status = BAD_TFORM); } /*-----------------------------------------------*/ /* determine default datatype code */ /*-----------------------------------------------*/ if (form[0] == 'A') datacode = TSTRING; else if (form[0] == 'I') datacode = TLONG; else if (form[0] == 'F') datacode = TFLOAT; else if (form[0] == 'E') datacode = TFLOAT; else if (form[0] == 'D') datacode = TDOUBLE; else { snprintf(message, FLEN_ERRMSG, "Illegal ASCII table TFORMn datatype: \'%s\'", tform); ffpmsg(message); return(*status = BAD_TFORM_DTYPE); } if (dtcode) *dtcode = datacode; form++; /* point to the start of field width */ if (datacode == TSTRING || datacode == TLONG) { /*-----------------------------------------------*/ /* A or I data formats: */ /*-----------------------------------------------*/ if (ffc2ii(form, &width, status) <= 0) /* read the width field */ { if (width <= 0) { width = 0; *status = BAD_TFORM; } else { /* set to shorter precision if I4 or less */ if (width <= 4 && datacode == TLONG) datacode = TSHORT; } } } else { /*-----------------------------------------------*/ /* F, E or D data formats: */ /*-----------------------------------------------*/ if (ffc2rr(form, &fwidth, status) <= 0) /* read ww.dd width field */ { if (fwidth <= 0.) *status = BAD_TFORM; else { width = (long) fwidth; /* convert from float to long */ if (width > 7 && *temp == 'F') datacode = TDOUBLE; /* type double if >7 digits */ if (width < 10) form = form + 1; /* skip 1 digit */ else form = form + 2; /* skip 2 digits */ if (form[0] == '.') /* should be a decimal point here */ { form++; /* point to start of decimals field */ if (ffc2ii(form, &longval, status) <= 0) /* read decimals */ { if (decimals) *decimals = longval; /* long to short convertion */ if (longval >= width) /* width < no. of decimals */ *status = BAD_TFORM; if (longval > 6 && *temp == 'E') datacode = TDOUBLE; /* type double if >6 digits */ } } } } } if (*status > 0) { *status = BAD_TFORM; snprintf(message,FLEN_ERRMSG,"Illegal ASCII table TFORMn code: \'%s\'", tform); ffpmsg(message); } if (dtcode) *dtcode = datacode; if (twidth) *twidth = width; return(*status); } /*--------------------------------------------------------------------------*/ int ffbnfm(char *tform, /* I - format code from the TFORMn keyword */ int *dtcode, /* O - numerical datatype code */ long *trepeat, /* O - repeat count of the field */ long *twidth, /* O - width of the field, in chars */ int *status) /* IO - error status */ { /* parse the binary table TFORM column format to determine the data type, repeat count, and the field width (if it is an ASCII (A) field) */ size_t ii, nchar; int datacode, variable, iread; long width, repeat; char *form, temp[FLEN_VALUE], message[FLEN_ERRMSG]; if (*status > 0) return(*status); if (dtcode) *dtcode = 0; if (trepeat) *trepeat = 0; if (twidth) *twidth = 0; nchar = strlen(tform); for (ii = 0; ii < nchar; ii++) { if (tform[ii] != ' ') /* find first non-space char */ break; } if (ii == nchar) { ffpmsg("Error: binary table TFORM code is blank (ffbnfm)."); return(*status = BAD_TFORM); } if (nchar-ii > FLEN_VALUE-1) { ffpmsg("Error: binary table TFORM code is too long (ffbnfm)."); return (*status = BAD_TFORM); } strcpy(temp, &tform[ii]); /* copy format string */ ffupch(temp); /* make sure it is in upper case */ form = temp; /* point to start of format string */ /*-----------------------------------------------*/ /* get the repeat count */ /*-----------------------------------------------*/ ii = 0; while(isdigit((int) form[ii])) ii++; /* look for leading digits in the field */ if (ii == 0) repeat = 1; /* no explicit repeat count */ else { if (sscanf(form,"%ld", &repeat) != 1) /* read repeat count */ { ffpmsg("Error: Bad repeat format in TFORM (ffbnfm)."); return(*status = BAD_TFORM); } } /*-----------------------------------------------*/ /* determine datatype code */ /*-----------------------------------------------*/ form = form + ii; /* skip over the repeat field */ if (form[0] == 'P' || form[0] == 'Q') { variable = 1; /* this is a variable length column */ /* repeat = 1; */ /* disregard any other repeat value */ form++; /* move to the next data type code char */ } else variable = 0; if (form[0] == 'U') /* internal code to signify unsigned short integer */ { datacode = TUSHORT; width = 2; } else if (form[0] == 'I') { datacode = TSHORT; width = 2; } else if (form[0] == 'V') /* internal code to signify unsigned integer */ { datacode = TULONG; width = 4; } else if (form[0] == 'W') /* internal code to signify unsigned long long integer */ { datacode = TULONGLONG; width = 8; } else if (form[0] == 'J') { datacode = TLONG; width = 4; } else if (form[0] == 'K') { datacode = TLONGLONG; width = 8; } else if (form[0] == 'E') { datacode = TFLOAT; width = 4; } else if (form[0] == 'D') { datacode = TDOUBLE; width = 8; } else if (form[0] == 'A') { datacode = TSTRING; /* the following code is used to support the non-standard datatype of the form rAw where r = total width of the field and w = width of fixed-length substrings within the field. */ iread = 0; if (form[1] != 0) { if (form[1] == '(' ) /* skip parenthesis around */ form++; /* variable length column width */ iread = sscanf(&form[1],"%ld", &width); } if (iread != 1 || (!variable && (width > repeat)) ) width = repeat; } else if (form[0] == 'L') { datacode = TLOGICAL; width = 1; } else if (form[0] == 'X') { datacode = TBIT; width = 1; } else if (form[0] == 'B') { datacode = TBYTE; width = 1; } else if (form[0] == 'S') /* internal code to signify signed byte */ { datacode = TSBYTE; width = 1; } else if (form[0] == 'C') { datacode = TCOMPLEX; width = 8; } else if (form[0] == 'M') { datacode = TDBLCOMPLEX; width = 16; } else { snprintf(message, FLEN_ERRMSG, "Illegal binary table TFORMn datatype: \'%s\' ", tform); ffpmsg(message); return(*status = BAD_TFORM_DTYPE); } if (variable) datacode = datacode * (-1); /* flag variable cols w/ neg type code */ if (dtcode) *dtcode = datacode; if (trepeat) *trepeat = repeat; if (twidth) *twidth = width; return(*status); } /*--------------------------------------------------------------------------*/ int ffbnfmll(char *tform, /* I - format code from the TFORMn keyword */ int *dtcode, /* O - numerical datatype code */ LONGLONG *trepeat, /* O - repeat count of the field */ long *twidth, /* O - width of the field, in chars */ int *status) /* IO - error status */ { /* parse the binary table TFORM column format to determine the data type, repeat count, and the field width (if it is an ASCII (A) field) */ size_t ii, nchar; int datacode, variable, iread; long width; LONGLONG repeat; char *form, temp[FLEN_VALUE], message[FLEN_ERRMSG]; double drepeat; if (*status > 0) return(*status); if (dtcode) *dtcode = 0; if (trepeat) *trepeat = 0; if (twidth) *twidth = 0; nchar = strlen(tform); for (ii = 0; ii < nchar; ii++) { if (tform[ii] != ' ') /* find first non-space char */ break; } if (ii == nchar) { ffpmsg("Error: binary table TFORM code is blank (ffbnfmll)."); return(*status = BAD_TFORM); } if (strlen(&tform[ii]) > FLEN_VALUE-1) { ffpmsg("Error: binary table TFORM code is too long (ffbnfmll)."); return(*status = BAD_TFORM); } strcpy(temp, &tform[ii]); /* copy format string */ ffupch(temp); /* make sure it is in upper case */ form = temp; /* point to start of format string */ /*-----------------------------------------------*/ /* get the repeat count */ /*-----------------------------------------------*/ ii = 0; while(isdigit((int) form[ii])) ii++; /* look for leading digits in the field */ if (ii == 0) repeat = 1; /* no explicit repeat count */ else { /* read repeat count */ /* print as double, because the string-to-64-bit int conversion */ /* character is platform dependent (%lld, %ld, %I64d) */ sscanf(form,"%lf", &drepeat); repeat = (LONGLONG) (drepeat + 0.1); } /*-----------------------------------------------*/ /* determine datatype code */ /*-----------------------------------------------*/ form = form + ii; /* skip over the repeat field */ if (form[0] == 'P' || form[0] == 'Q') { variable = 1; /* this is a variable length column */ /* repeat = 1; */ /* disregard any other repeat value */ form++; /* move to the next data type code char */ } else variable = 0; if (form[0] == 'U') /* internal code to signify unsigned integer */ { datacode = TUSHORT; width = 2; } else if (form[0] == 'I') { datacode = TSHORT; width = 2; } else if (form[0] == 'V') /* internal code to signify unsigned integer */ { datacode = TULONG; width = 4; } else if (form[0] == 'W') /* internal code to signify unsigned long long integer */ { datacode = TULONGLONG; width = 8; } else if (form[0] == 'J') { datacode = TLONG; width = 4; } else if (form[0] == 'K') { datacode = TLONGLONG; width = 8; } else if (form[0] == 'E') { datacode = TFLOAT; width = 4; } else if (form[0] == 'D') { datacode = TDOUBLE; width = 8; } else if (form[0] == 'A') { datacode = TSTRING; /* the following code is used to support the non-standard datatype of the form rAw where r = total width of the field and w = width of fixed-length substrings within the field. */ iread = 0; if (form[1] != 0) { if (form[1] == '(' ) /* skip parenthesis around */ form++; /* variable length column width */ iread = sscanf(&form[1],"%ld", &width); } if (iread != 1 || (!variable && (width > repeat)) ) width = (long) repeat; } else if (form[0] == 'L') { datacode = TLOGICAL; width = 1; } else if (form[0] == 'X') { datacode = TBIT; width = 1; } else if (form[0] == 'B') { datacode = TBYTE; width = 1; } else if (form[0] == 'S') /* internal code to signify signed byte */ { datacode = TSBYTE; width = 1; } else if (form[0] == 'C') { datacode = TCOMPLEX; width = 8; } else if (form[0] == 'M') { datacode = TDBLCOMPLEX; width = 16; } else { snprintf(message, FLEN_ERRMSG, "Illegal binary table TFORMn datatype: \'%s\' ", tform); ffpmsg(message); return(*status = BAD_TFORM_DTYPE); } if (variable) datacode = datacode * (-1); /* flag variable cols w/ neg type code */ if (dtcode) *dtcode = datacode; if (trepeat) *trepeat = repeat; if (twidth) *twidth = width; return(*status); } /*--------------------------------------------------------------------------*/ void ffcfmt(char *tform, /* value of an ASCII table TFORMn keyword */ char *cform) /* equivalent format code in C language syntax */ /* convert the FITS format string for an ASCII Table extension column into the equivalent C format string that can be used in a printf statement, after the values have been read as a double. */ { int ii; cform[0] = '\0'; ii = 0; while (tform[ii] != 0 && tform[ii] == ' ') /* find first non-blank char */ ii++; if (tform[ii] == 0) return; /* input format string was blank */ cform[0] = '%'; /* start the format string */ strcpy(&cform[1], &tform[ii + 1]); /* append the width and decimal code */ if (tform[ii] == 'A') strcat(cform, "s"); else if (tform[ii] == 'I') strcat(cform, ".0f"); /* 0 precision to suppress decimal point */ if (tform[ii] == 'F') strcat(cform, "f"); if (tform[ii] == 'E') strcat(cform, "E"); if (tform[ii] == 'D') strcat(cform, "E"); return; } /*--------------------------------------------------------------------------*/ void ffcdsp(char *tform, /* value of an ASCII table TFORMn keyword */ char *cform) /* equivalent format code in C language syntax */ /* convert the FITS TDISPn display format into the equivalent C format suitable for use in a printf statement. */ { int ii; cform[0] = '\0'; ii = 0; while (tform[ii] != 0 && tform[ii] == ' ') /* find first non-blank char */ ii++; if (tform[ii] == 0) { cform[0] = '\0'; return; /* input format string was blank */ } if (strchr(tform+ii, '%')) /* is there a % character in the string?? */ { cform[0] = '\0'; return; /* illegal TFORM string (possibly even harmful) */ } cform[0] = '%'; /* start the format string */ strcpy(&cform[1], &tform[ii + 1]); /* append the width and decimal code */ if (tform[ii] == 'A' || tform[ii] == 'a') strcat(cform, "s"); else if (tform[ii] == 'I' || tform[ii] == 'i') strcat(cform, "d"); else if (tform[ii] == 'O' || tform[ii] == 'o') strcat(cform, "o"); else if (tform[ii] == 'Z' || tform[ii] == 'z') strcat(cform, "X"); else if (tform[ii] == 'F' || tform[ii] == 'f') strcat(cform, "f"); else if (tform[ii] == 'E' || tform[ii] == 'e') strcat(cform, "E"); else if (tform[ii] == 'D' || tform[ii] == 'd') strcat(cform, "E"); else if (tform[ii] == 'G' || tform[ii] == 'g') strcat(cform, "G"); else cform[0] = '\0'; /* unrecognized tform code */ return; } /*--------------------------------------------------------------------------*/ int ffgcno( fitsfile *fptr, /* I - FITS file pionter */ int casesen, /* I - case sensitive string comparison? 0=no */ char *templt, /* I - input name of column (w/wildcards) */ int *colnum, /* O - number of the named column; 1=first col */ int *status) /* IO - error status */ /* Determine the column number corresponding to an input column name. The first column of the table = column 1; This supports the * and ? wild cards in the input template. */ { char colname[FLEN_VALUE]; /* temporary string to hold column name */ ffgcnn(fptr, casesen, templt, colname, colnum, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffgcnn( fitsfile *fptr, /* I - FITS file pointer */ int casesen, /* I - case sensitive string comparison? 0=no */ char *templt, /* I - input name of column (w/wildcards) */ char *colname, /* O - full column name up to 68 + 1 chars long*/ int *colnum, /* O - number of the named column; 1=first col */ int *status) /* IO - error status */ /* Return the full column name and column number of the next column whose TTYPEn keyword value matches the input template string. The template may contain the * and ? wildcards. Status = 237 is returned if the match is not unique. If so, one may call this routine again with input status=237 to get the next match. A status value of 219 is returned when there are no more matching columns. */ { char errmsg[FLEN_ERRMSG]; int tstatus, ii, founde, foundw, match, exact, unique; long ivalue; tcolumn *colptr; if (*status <= 0) { (fptr->Fptr)->startcol = 0; /* start search with first column */ tstatus = 0; } else if (*status == COL_NOT_UNIQUE) /* start search from previous spot */ { tstatus = COL_NOT_UNIQUE; *status = 0; } else return(*status); /* bad input status value */ colname[0] = 0; /* initialize null return */ *colnum = 0; /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header to get col struct */ return(*status); colptr = (fptr->Fptr)->tableptr; /* pointer to first column */ colptr += ((fptr->Fptr)->startcol); /* offset to starting column */ founde = FALSE; /* initialize 'found exact match' flag */ foundw = FALSE; /* initialize 'found wildcard match' flag */ unique = FALSE; for (ii = (fptr->Fptr)->startcol; ii < (fptr->Fptr)->tfield; ii++, colptr++) { ffcmps(templt, colptr->ttype, casesen, &match, &exact); if (match) { if (founde && exact) { /* warning: this is the second exact match we've found */ /*reset pointer to first match so next search starts there */ (fptr->Fptr)->startcol = *colnum; return(*status = COL_NOT_UNIQUE); } else if (founde) /* a wildcard match */ { /* already found exact match so ignore this non-exact match */ } else if (exact) { /* this is the first exact match we have found, so save it. */ strcpy(colname, colptr->ttype); *colnum = ii + 1; founde = TRUE; } else if (foundw) { /* we have already found a wild card match, so not unique */ /* continue searching for other matches */ unique = FALSE; } else { /* this is the first wild card match we've found. save it */ strcpy(colname, colptr->ttype); *colnum = ii + 1; (fptr->Fptr)->startcol = *colnum; foundw = TRUE; unique = TRUE; } } } /* OK, we've checked all the names now see if we got any matches */ if (founde) { if (tstatus == COL_NOT_UNIQUE) /* we did find 1 exact match but */ *status = COL_NOT_UNIQUE; /* there was a previous match too */ } else if (foundw) { /* found one or more wildcard matches; report error if not unique */ if (!unique || tstatus == COL_NOT_UNIQUE) *status = COL_NOT_UNIQUE; } else { /* didn't find a match; check if template is a positive integer */ ffc2ii(templt, &ivalue, &tstatus); if (tstatus == 0 && ivalue <= (fptr->Fptr)->tfield && ivalue > 0) { *colnum = ivalue; colptr = (fptr->Fptr)->tableptr; /* pointer to first column */ colptr += (ivalue - 1); /* offset to correct column */ strcpy(colname, colptr->ttype); } else { *status = COL_NOT_FOUND; if (tstatus != COL_NOT_UNIQUE) { snprintf(errmsg, FLEN_ERRMSG, "ffgcnn could not find column: %.45s", templt); ffpmsg(errmsg); } } } (fptr->Fptr)->startcol = *colnum; /* save pointer for next time */ return(*status); } /*--------------------------------------------------------------------------*/ void ffcmps(char *templt, /* I - input template (may have wildcards) */ char *colname, /* I - full column name up to 68 + 1 chars long */ int casesen, /* I - case sensitive string comparison? 1=yes */ int *match, /* O - do template and colname match? 1=yes */ int *exact) /* O - do strings exactly match, or wildcards */ /* compare the template to the string and test if they match. The strings are limited to 68 characters or less (the max. length of a FITS string keyword value. This routine reports whether the two strings match and whether the match is exact or involves wildcards. This algorithm is very similar to the way unix filename wildcards work except that this first treats a wild card as a literal character when looking for a match. If there is no literal match, then it interpretes it as a wild card. So the template 'AB*DE' is considered to be an exact rather than a wild card match to the string 'AB*DE'. The '#' wild card in the template string will match any consecutive string of decimal digits in the colname. */ { int ii, found, t1, s1, wildsearch = 0, tsave = 0, ssave = 0; char temp[FLEN_VALUE], col[FLEN_VALUE]; *match = FALSE; *exact = TRUE; strncpy(temp, templt, FLEN_VALUE); /* copy strings to work area */ strncpy(col, colname, FLEN_VALUE); temp[FLEN_VALUE - 1] = '\0'; /* make sure strings are terminated */ col[FLEN_VALUE - 1] = '\0'; /* truncate trailing non-significant blanks */ for (ii = strlen(temp) - 1; ii >= 0 && temp[ii] == ' '; ii--) temp[ii] = '\0'; for (ii = strlen(col) - 1; ii >= 0 && col[ii] == ' '; ii--) col[ii] = '\0'; if (!casesen) { /* convert both strings to uppercase before comparison */ ffupch(temp); ffupch(col); } if (!FSTRCMP(temp, col) ) { *match = TRUE; /* strings exactly match */ return; } *exact = FALSE; /* strings don't exactly match */ t1 = 0; /* start comparison with 1st char of each string */ s1 = 0; while(1) /* compare corresponding chars in each string */ { if (temp[t1] == '\0' && col[s1] == '\0') { /* completely scanned both strings so they match */ *match = TRUE; return; } else if (temp[t1] == '\0') { if (wildsearch) { /* the previous wildcard search may have been going down a blind alley. Backtrack, and resume the wildcard search with the next character in the string. */ t1 = tsave; s1 = ssave + 1; } else { /* reached end of template string so they don't match */ return; } } else if (col[s1] == '\0') { /* reached end of other string; they match if the next */ /* character in the template string is a '*' wild card */ if (temp[t1] == '*' && temp[t1 + 1] == '\0') { *match = TRUE; } return; } if (temp[t1] == col[s1] || (temp[t1] == '?') ) { s1++; /* corresponding chars in the 2 strings match */ t1++; /* increment both pointers and loop back again */ } else if (temp[t1] == '#' && isdigit((int) col[s1]) ) { s1++; /* corresponding chars in the 2 strings match */ t1++; /* increment both pointers */ /* find the end of the string of digits */ while (isdigit((int) col[s1]) ) s1++; } else if (temp[t1] == '*') { /* save current string locations, in case we need to restart */ wildsearch = 1; tsave = t1; ssave = s1; /* get next char from template and look for it in the col name */ t1++; if (temp[t1] == '\0' || temp[t1] == ' ') { /* reached end of template so strings match */ *match = TRUE; return; } found = FALSE; while (col[s1] && !found) { if (temp[t1] == col[s1]) { t1++; /* found matching characters; incre both pointers */ s1++; /* and loop back to compare next chars */ found = TRUE; } else s1++; /* increment the column name pointer and try again */ } if (!found) { return; /* hit end of column name and failed to find a match */ } } else { if (wildsearch) { /* the previous wildcard search may have been going down a blind alley. Backtrack, and resume the wildcard search with the next character in the string. */ t1 = tsave; s1 = ssave + 1; } else { return; /* strings don't match */ } } } } /*--------------------------------------------------------------------------*/ int ffgtcl( fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number */ int *typecode, /* O - datatype code (21 = short, etc) */ long *repeat, /* O - repeat count of field */ long *width, /* O - if ASCII, width of field or unit string */ int *status) /* IO - error status */ /* Get Type of table column. Returns the datatype code of the column, as well as the vector repeat count and (if it is an ASCII character column) the width of the field or a unit string within the field. This supports the TFORMn = 'rAw' syntax for specifying arrays of substrings, so if TFORMn = '60A12' then repeat = 60 and width = 12. */ { LONGLONG trepeat, twidth; ffgtclll(fptr, colnum, typecode, &trepeat, &twidth, status); if (*status > 0) return(*status); if (repeat) *repeat= (long) trepeat; if (width) *width = (long) twidth; return(*status); } /*--------------------------------------------------------------------------*/ int ffgtclll( fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number */ int *typecode, /* O - datatype code (21 = short, etc) */ LONGLONG *repeat, /* O - repeat count of field */ LONGLONG *width, /* O - if ASCII, width of field or unit string */ int *status) /* IO - error status */ /* Get Type of table column. Returns the datatype code of the column, as well as the vector repeat count and (if it is an ASCII character column) the width of the field or a unit string within the field. This supports the TFORMn = 'rAw' syntax for specifying arrays of substrings, so if TFORMn = '60A12' then repeat = 60 and width = 12. */ { tcolumn *colptr; int hdutype, decims; long tmpwidth; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); if (colnum < 1 || colnum > (fptr->Fptr)->tfield) return(*status = BAD_COL_NUM); colptr = (fptr->Fptr)->tableptr; /* pointer to first column */ colptr += (colnum - 1); /* offset to correct column */ if (ffghdt(fptr, &hdutype, status) > 0) return(*status); if (hdutype == ASCII_TBL) { ffasfm(colptr->tform, typecode, &tmpwidth, &decims, status); *width = tmpwidth; if (repeat) *repeat = 1; } else { if (typecode) *typecode = colptr->tdatatype; if (width) *width = colptr->twidth; if (repeat) *repeat = colptr->trepeat; } return(*status); } /*--------------------------------------------------------------------------*/ int ffeqty( fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number */ int *typecode, /* O - datatype code (21 = short, etc) */ long *repeat, /* O - repeat count of field */ long *width, /* O - if ASCII, width of field or unit string */ int *status) /* IO - error status */ /* Get the 'equivalent' table column type. This routine is similar to the ffgtcl routine (which returns the physical datatype of the column, as stored in the FITS file) except that if the TSCALn and TZEROn keywords are defined for the column, then it returns the 'equivalent' datatype. Thus, if the column is defined as '1I' (short integer) this routine may return the type as 'TUSHORT' or as 'TFLOAT' depending on the TSCALn and TZEROn values. Returns the datatype code of the column, as well as the vector repeat count and (if it is an ASCII character column) the width of the field or a unit string within the field. This supports the TFORMn = 'rAw' syntax for specifying arrays of substrings, so if TFORMn = '60A12' then repeat = 60 and width = 12. */ { LONGLONG trepeat, twidth; ffeqtyll(fptr, colnum, typecode, &trepeat, &twidth, status); if (repeat) *repeat= (long) trepeat; if (width) *width = (long) twidth; return(*status); } /*--------------------------------------------------------------------------*/ int ffeqtyll( fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number */ int *typecode, /* O - datatype code (21 = short, etc) */ LONGLONG *repeat, /* O - repeat count of field */ LONGLONG *width, /* O - if ASCII, width of field or unit string */ int *status) /* IO - error status */ /* Get the 'equivalent' table column type. This routine is similar to the ffgtcl routine (which returns the physical datatype of the column, as stored in the FITS file) except that if the TSCALn and TZEROn keywords are defined for the column, then it returns the 'equivalent' datatype. Thus, if the column is defined as '1I' (short integer) this routine may return the type as 'TUSHORT' or as 'TFLOAT' depending on the TSCALn and TZEROn values. Returns the datatype code of the column, as well as the vector repeat count and (if it is an ASCII character column) the width of the field or a unit string within the field. This supports the TFORMn = 'rAw' syntax for specifying arrays of substrings, so if TFORMn = '60A12' then repeat = 60 and width = 12. */ { tcolumn *colptr; int hdutype, decims, tcode, effcode; double tscale, tzero, min_val, max_val; long lngscale, lngzero = 0, tmpwidth; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); if (colnum < 1 || colnum > (fptr->Fptr)->tfield) return(*status = BAD_COL_NUM); colptr = (fptr->Fptr)->tableptr; /* pointer to first column */ colptr += (colnum - 1); /* offset to correct column */ if (ffghdt(fptr, &hdutype, status) > 0) return(*status); if (hdutype == ASCII_TBL) { ffasfm(colptr->tform, typecode, &tmpwidth, &decims, status); if (width) *width = tmpwidth; if (repeat) *repeat = 1; } else { if (typecode) *typecode = colptr->tdatatype; if (width) *width = colptr->twidth; if (repeat) *repeat = colptr->trepeat; } /* return if caller is not interested in the typecode value */ if (!typecode) return(*status); /* check if the tscale and tzero keywords are defined, which might change the effective datatype of the column */ tscale = colptr->tscale; tzero = colptr->tzero; if (tscale == 1.0 && tzero == 0.0) /* no scaling */ return(*status); tcode = abs(*typecode); switch (tcode) { case TBYTE: /* binary table 'rB' column */ min_val = 0.; max_val = 255.0; break; case TSHORT: min_val = -32768.0; max_val = 32767.0; break; case TLONG: min_val = -2147483648.0; max_val = 2147483647.0; break; case TLONGLONG: min_val = -9.2233720368547755808E18; max_val = 9.2233720368547755807E18; break; default: /* don't have to deal with other data types */ return(*status); } if (tscale >= 0.) { min_val = tzero + tscale * min_val; max_val = tzero + tscale * max_val; } else { max_val = tzero + tscale * min_val; min_val = tzero + tscale * max_val; } if (tzero < 2147483648.) /* don't exceed range of 32-bit integer */ lngzero = (long) tzero; lngscale = (long) tscale; if ((tzero != 2147483648.) && /* special value that exceeds integer range */ (tzero != 9223372036854775808.) && /* indicates unsigned long long */ (lngzero != tzero || lngscale != tscale)) { /* not integers? */ /* floating point scaled values; just decide on required precision */ if (tcode == TBYTE || tcode == TSHORT) effcode = TFLOAT; else effcode = TDOUBLE; /* In all the remaining cases, TSCALn and TZEROn are integers, and not equal to 1 and 0, respectively. */ } else if ((min_val == -128.) && (max_val == 127.)) { effcode = TSBYTE; } else if ((min_val >= -32768.0) && (max_val <= 32767.0)) { effcode = TSHORT; } else if ((min_val >= 0.0) && (max_val <= 65535.0)) { effcode = TUSHORT; } else if ((min_val >= -2147483648.0) && (max_val <= 2147483647.0)) { effcode = TLONG; } else if ((min_val >= 0.0) && (max_val < 4294967296.0)) { effcode = TULONG; } else if ((min_val >= -9.2233720368547755808E18) && (max_val <= 9.2233720368547755807E18)) { effcode = TLONGLONG; } else if ((min_val >= 0.0) && (max_val <= 1.8446744073709551616E19)) { effcode = TULONGLONG; } else { /* exceeds the range of a 64-bit integer */ effcode = TDOUBLE; } /* return the effective datatype code (negative if variable length col.) */ if (*typecode < 0) /* variable length array column */ *typecode = -effcode; else *typecode = effcode; return(*status); } /*--------------------------------------------------------------------------*/ int ffgncl( fitsfile *fptr, /* I - FITS file pointer */ int *ncols, /* O - number of columns in the table */ int *status) /* IO - error status */ /* Get the number of columns in the table (= TFIELDS keyword) */ { if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) return(*status = NOT_TABLE); *ncols = (fptr->Fptr)->tfield; return(*status); } /*--------------------------------------------------------------------------*/ int ffgnrw( fitsfile *fptr, /* I - FITS file pointer */ long *nrows, /* O - number of rows in the table */ int *status) /* IO - error status */ /* Get the number of rows in the table (= NAXIS2 keyword) */ { if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) return(*status = NOT_TABLE); /* the NAXIS2 keyword may not be up to date, so use the structure value */ *nrows = (long) (fptr->Fptr)->numrows; return(*status); } /*--------------------------------------------------------------------------*/ int ffgnrwll( fitsfile *fptr, /* I - FITS file pointer */ LONGLONG *nrows, /* O - number of rows in the table */ int *status) /* IO - error status */ /* Get the number of rows in the table (= NAXIS2 keyword) */ { if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) return(*status = NOT_TABLE); /* the NAXIS2 keyword may not be up to date, so use the structure value */ *nrows = (fptr->Fptr)->numrows; return(*status); } /*--------------------------------------------------------------------------*/ int ffgacl( fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number */ char *ttype, /* O - TTYPEn keyword value */ long *tbcol, /* O - TBCOLn keyword value */ char *tunit, /* O - TUNITn keyword value */ char *tform, /* O - TFORMn keyword value */ double *tscal, /* O - TSCALn keyword value */ double *tzero, /* O - TZEROn keyword value */ char *tnull, /* O - TNULLn keyword value */ char *tdisp, /* O - TDISPn keyword value */ int *status) /* IO - error status */ /* get ASCII column keyword values */ { char name[FLEN_KEYWORD], comm[FLEN_COMMENT]; tcolumn *colptr; int tstatus; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); if (colnum < 1 || colnum > (fptr->Fptr)->tfield) return(*status = BAD_COL_NUM); /* get what we can from the column structure */ colptr = (fptr->Fptr)->tableptr; /* pointer to first column */ colptr += (colnum -1); /* offset to correct column */ if (ttype) strcpy(ttype, colptr->ttype); if (tbcol) *tbcol = (long) ((colptr->tbcol) + 1); /* first col is 1, not 0 */ if (tform) strcpy(tform, colptr->tform); if (tscal) *tscal = colptr->tscale; if (tzero) *tzero = colptr->tzero; if (tnull) strcpy(tnull, colptr->strnull); /* read keywords to get additional parameters */ if (tunit) { ffkeyn("TUNIT", colnum, name, status); tstatus = 0; *tunit = '\0'; ffgkys(fptr, name, tunit, comm, &tstatus); } if (tdisp) { ffkeyn("TDISP", colnum, name, status); tstatus = 0; *tdisp = '\0'; ffgkys(fptr, name, tdisp, comm, &tstatus); } return(*status); } /*--------------------------------------------------------------------------*/ int ffgbcl( fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number */ char *ttype, /* O - TTYPEn keyword value */ char *tunit, /* O - TUNITn keyword value */ char *dtype, /* O - datatype char: I, J, E, D, etc. */ long *repeat, /* O - vector column repeat count */ double *tscal, /* O - TSCALn keyword value */ double *tzero, /* O - TZEROn keyword value */ long *tnull, /* O - TNULLn keyword value integer cols only */ char *tdisp, /* O - TDISPn keyword value */ int *status) /* IO - error status */ /* get BINTABLE column keyword values */ { LONGLONG trepeat, ttnull; if (*status > 0) return(*status); ffgbclll(fptr, colnum, ttype, tunit, dtype, &trepeat, tscal, tzero, &ttnull, tdisp, status); if (repeat) *repeat = (long) trepeat; if (tnull) *tnull = (long) ttnull; return(*status); } /*--------------------------------------------------------------------------*/ int ffgbclll( fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number */ char *ttype, /* O - TTYPEn keyword value */ char *tunit, /* O - TUNITn keyword value */ char *dtype, /* O - datatype char: I, J, E, D, etc. */ LONGLONG *repeat, /* O - vector column repeat count */ double *tscal, /* O - TSCALn keyword value */ double *tzero, /* O - TZEROn keyword value */ LONGLONG *tnull, /* O - TNULLn keyword value integer cols only */ char *tdisp, /* O - TDISPn keyword value */ int *status) /* IO - error status */ /* get BINTABLE column keyword values */ { char name[FLEN_KEYWORD], comm[FLEN_COMMENT]; tcolumn *colptr; int tstatus; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); if (colnum < 1 || colnum > (fptr->Fptr)->tfield) return(*status = BAD_COL_NUM); /* get what we can from the column structure */ colptr = (fptr->Fptr)->tableptr; /* pointer to first column */ colptr += (colnum -1); /* offset to correct column */ if (ttype) strcpy(ttype, colptr->ttype); if (dtype) { if (colptr->tdatatype < 0) /* add the "P" prefix for */ strcpy(dtype, "P"); /* variable length columns */ else dtype[0] = 0; if (abs(colptr->tdatatype) == TBIT) strcat(dtype, "X"); else if (abs(colptr->tdatatype) == TBYTE) strcat(dtype, "B"); else if (abs(colptr->tdatatype) == TLOGICAL) strcat(dtype, "L"); else if (abs(colptr->tdatatype) == TSTRING) strcat(dtype, "A"); else if (abs(colptr->tdatatype) == TSHORT) strcat(dtype, "I"); else if (abs(colptr->tdatatype) == TLONG) strcat(dtype, "J"); else if (abs(colptr->tdatatype) == TLONGLONG) strcat(dtype, "K"); else if (abs(colptr->tdatatype) == TFLOAT) strcat(dtype, "E"); else if (abs(colptr->tdatatype) == TDOUBLE) strcat(dtype, "D"); else if (abs(colptr->tdatatype) == TCOMPLEX) strcat(dtype, "C"); else if (abs(colptr->tdatatype) == TDBLCOMPLEX) strcat(dtype, "M"); } if (repeat) *repeat = colptr->trepeat; if (tscal) *tscal = colptr->tscale; if (tzero) *tzero = colptr->tzero; if (tnull) *tnull = colptr->tnull; /* read keywords to get additional parameters */ if (tunit) { ffkeyn("TUNIT", colnum, name, status); tstatus = 0; *tunit = '\0'; ffgkys(fptr, name, tunit, comm, &tstatus); } if (tdisp) { ffkeyn("TDISP", colnum, name, status); tstatus = 0; *tdisp = '\0'; ffgkys(fptr, name, tdisp, comm, &tstatus); } return(*status); } /*--------------------------------------------------------------------------*/ int ffghdn(fitsfile *fptr, /* I - FITS file pointer */ int *chdunum) /* O - number of the CHDU; 1 = primary array */ /* Return the number of the Current HDU in the FITS file. The primary array is HDU number 1. Note that this is one of the few cfitsio routines that does not return the error status value as the value of the function. */ { *chdunum = (fptr->HDUposition) + 1; return(*chdunum); } /*--------------------------------------------------------------------------*/ int ffghadll(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG *headstart, /* O - byte offset to beginning of CHDU */ LONGLONG *datastart, /* O - byte offset to beginning of next HDU */ LONGLONG *dataend, /* O - byte offset to beginning of next HDU */ int *status) /* IO - error status */ /* Return the address (= byte offset) in the FITS file to the beginning of the current HDU, the beginning of the data unit, and the end of the data unit. */ { if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) { if (ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status) > 0) return(*status); } else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) { if (ffrdef(fptr, status) > 0) /* rescan header */ return(*status); } if (headstart) *headstart = (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu]; if (datastart) *datastart = (fptr->Fptr)->datastart; if (dataend) *dataend = (fptr->Fptr)->headstart[((fptr->Fptr)->curhdu) + 1]; return(*status); } /*--------------------------------------------------------------------------*/ int ffghof(fitsfile *fptr, /* I - FITS file pointer */ OFF_T *headstart, /* O - byte offset to beginning of CHDU */ OFF_T *datastart, /* O - byte offset to beginning of next HDU */ OFF_T *dataend, /* O - byte offset to beginning of next HDU */ int *status) /* IO - error status */ /* Return the address (= byte offset) in the FITS file to the beginning of the current HDU, the beginning of the data unit, and the end of the data unit. */ { if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) { if (ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status) > 0) return(*status); } else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) { if (ffrdef(fptr, status) > 0) /* rescan header */ return(*status); } if (headstart) *headstart = (OFF_T) (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu]; if (datastart) *datastart = (OFF_T) (fptr->Fptr)->datastart; if (dataend) *dataend = (OFF_T) (fptr->Fptr)->headstart[((fptr->Fptr)->curhdu) + 1]; return(*status); } /*--------------------------------------------------------------------------*/ int ffghad(fitsfile *fptr, /* I - FITS file pointer */ long *headstart, /* O - byte offset to beginning of CHDU */ long *datastart, /* O - byte offset to beginning of next HDU */ long *dataend, /* O - byte offset to beginning of next HDU */ int *status) /* IO - error status */ /* Return the address (= byte offset) in the FITS file to the beginning of the current HDU, the beginning of the data unit, and the end of the data unit. */ { LONGLONG shead, sdata, edata; if (*status > 0) return(*status); ffghadll(fptr, &shead, &sdata, &edata, status); if (headstart) { if (shead > LONG_MAX) *status = NUM_OVERFLOW; else *headstart = (long) shead; } if (datastart) { if (sdata > LONG_MAX) *status = NUM_OVERFLOW; else *datastart = (long) sdata; } if (dataend) { if (edata > LONG_MAX) *status = NUM_OVERFLOW; else *dataend = (long) edata; } return(*status); } /*--------------------------------------------------------------------------*/ int ffrhdu(fitsfile *fptr, /* I - FITS file pointer */ int *hdutype, /* O - type of HDU */ int *status) /* IO - error status */ /* read the required keywords of the CHDU and initialize the corresponding structure elements that describe the format of the HDU */ { int ii, tstatus; char card[FLEN_CARD]; char name[FLEN_KEYWORD], value[FLEN_VALUE], comm[FLEN_COMMENT]; char xname[FLEN_VALUE], *xtension, urltype[20]; if (*status > 0) return(*status); if (ffgrec(fptr, 1, card, status) > 0 ) /* get the 80-byte card */ { ffpmsg("Cannot read first keyword in header (ffrhdu)."); return(*status); } strncpy(name,card,8); /* first 8 characters = the keyword name */ name[8] = '\0'; for (ii=7; ii >= 0; ii--) /* replace trailing blanks with nulls */ { if (name[ii] == ' ') name[ii] = '\0'; else break; } if (ffpsvc(card, value, comm, status) > 0) /* parse value and comment */ { ffpmsg("Cannot read value of first keyword in header (ffrhdu):"); ffpmsg(card); return(*status); } if (!strcmp(name, "SIMPLE")) /* this is the primary array */ { ffpinit(fptr, status); /* initialize the primary array */ if (hdutype != NULL) *hdutype = 0; } else if (!strcmp(name, "XTENSION")) /* this is an XTENSION keyword */ { if (ffc2s(value, xname, status) > 0) /* get the value string */ { ffpmsg("Bad value string for XTENSION keyword:"); ffpmsg(value); return(*status); } xtension = xname; while (*xtension == ' ') /* ignore any leading spaces in name */ xtension++; if (!strcmp(xtension, "TABLE")) { ffainit(fptr, status); /* initialize the ASCII table */ if (hdutype != NULL) *hdutype = 1; } else if (!strcmp(xtension, "BINTABLE") || !strcmp(xtension, "A3DTABLE") || !strcmp(xtension, "3DTABLE") ) { ffbinit(fptr, status); /* initialize the binary table */ if (hdutype != NULL) *hdutype = 2; } else { tstatus = 0; ffpinit(fptr, &tstatus); /* probably an IMAGE extension */ if (tstatus == UNKNOWN_EXT && hdutype != NULL) *hdutype = -1; /* don't recognize this extension type */ else { *status = tstatus; if (hdutype != NULL) *hdutype = 0; } } } else /* not the start of a new extension */ { if (card[0] == 0 || card[0] == 10) /* some editors append this character to EOF */ { *status = END_OF_FILE; } else { *status = UNKNOWN_REC; /* found unknown type of record */ ffpmsg ("Extension doesn't start with SIMPLE or XTENSION keyword. (ffrhdu)"); ffpmsg(card); } } /* compare the starting position of the next HDU (if any) with the size */ /* of the whole file to see if this is the last HDU in the file */ if ((fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu + 1] < (fptr->Fptr)->logfilesize ) { (fptr->Fptr)->lasthdu = 0; /* no, not the last HDU */ } else { (fptr->Fptr)->lasthdu = 1; /* yes, this is the last HDU */ /* special code for mem:// type files (FITS file in memory) */ /* Allocate enough memory to hold the entire HDU. */ /* Without this code, CFITSIO would repeatedly realloc memory */ /* to incrementally increase the size of the file by 2880 bytes */ /* at a time, until it reached the final size */ ffurlt(fptr, urltype, status); if (!strcmp(urltype,"mem://") || !strcmp(urltype,"memkeep://")) { fftrun(fptr, (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu + 1], status); } } return(*status); } /*--------------------------------------------------------------------------*/ int ffpinit(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ /* initialize the parameters defining the structure of the primary array or an Image extension */ { int groups, tstatus, simple, bitpix, naxis, extend, nspace; int ttype = 0, bytlen = 0, ii, ntilebins; long pcount, gcount; LONGLONG naxes[999], npix, blank; double bscale, bzero; char comm[FLEN_COMMENT]; tcolumn *colptr; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); (fptr->Fptr)->hdutype = IMAGE_HDU; /* primary array or IMAGE extension */ (fptr->Fptr)->headend = (fptr->Fptr)->logfilesize; /* set max size */ groups = 0; tstatus = *status; /* get all the descriptive info about this HDU */ ffgphd(fptr, 999, &simple, &bitpix, &naxis, naxes, &pcount, &gcount, &extend, &bscale, &bzero, &blank, &nspace, status); if (*status == NOT_IMAGE) *status = tstatus; /* ignore 'unknown extension type' error */ else if (*status > 0) return(*status); /* the logical end of the header is 80 bytes before the current position, minus any trailing blank keywords just before the END keyword. */ (fptr->Fptr)->headend = (fptr->Fptr)->nextkey - (80 * (nspace + 1)); /* the data unit begins at the beginning of the next logical block */ (fptr->Fptr)->datastart = (((fptr->Fptr)->nextkey - 80) / 2880 + 1) * 2880; if (naxis > 0 && naxes[0] == 0) /* test for 'random groups' */ { tstatus = 0; ffmaky(fptr, 2, status); /* reset to beginning of header */ if (ffgkyl(fptr, "GROUPS", &groups, comm, &tstatus)) groups = 0; /* GROUPS keyword not found */ } if (bitpix == BYTE_IMG) /* test bitpix and set the datatype code */ { ttype=TBYTE; bytlen=1; } else if (bitpix == SHORT_IMG) { ttype=TSHORT; bytlen=2; } else if (bitpix == LONG_IMG) { ttype=TLONG; bytlen=4; } else if (bitpix == LONGLONG_IMG) { ttype=TLONGLONG; bytlen=8; } else if (bitpix == FLOAT_IMG) { ttype=TFLOAT; bytlen=4; } else if (bitpix == DOUBLE_IMG) { ttype=TDOUBLE; bytlen=8; } /* calculate the size of the primary array */ (fptr->Fptr)->imgdim = naxis; if (naxis == 0) { npix = 0; } else { if (groups) { npix = 1; /* NAXIS1 = 0 is a special flag for 'random groups' */ } else { npix = naxes[0]; } (fptr->Fptr)->imgnaxis[0] = naxes[0]; for (ii=1; ii < naxis; ii++) { npix = npix*naxes[ii]; /* calc number of pixels in the array */ (fptr->Fptr)->imgnaxis[ii] = naxes[ii]; } } /* now we know everything about the array; just fill in the parameters: the next HDU begins in the next logical block after the data */ (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu + 1] = (fptr->Fptr)->datastart + ( ((LONGLONG) pcount + npix) * bytlen * gcount + 2879) / 2880 * 2880; /* initialize the fictitious heap starting address (immediately following the array data) and a zero length heap. This is used to find the end of the data when checking the fill values in the last block. */ (fptr->Fptr)->heapstart = (npix + pcount) * bytlen * gcount; (fptr->Fptr)->heapsize = 0; (fptr->Fptr)->compressimg = 0; /* this is not a compressed image */ if (naxis == 0) { (fptr->Fptr)->rowlength = 0; /* rows have zero length */ (fptr->Fptr)->tfield = 0; /* table has no fields */ /* free the tile-compressed image cache, if it exists */ if ((fptr->Fptr)->tilerow) { ntilebins = (((fptr->Fptr)->znaxis[0] - 1) / ((fptr->Fptr)->tilesize[0])) + 1; for (ii = 0; ii < ntilebins; ii++) { if ((fptr->Fptr)->tiledata[ii]) { free((fptr->Fptr)->tiledata[ii]); } if ((fptr->Fptr)->tilenullarray[ii]) { free((fptr->Fptr)->tilenullarray[ii]); } } free((fptr->Fptr)->tileanynull); free((fptr->Fptr)->tiletype); free((fptr->Fptr)->tiledatasize); free((fptr->Fptr)->tilenullarray); free((fptr->Fptr)->tiledata); free((fptr->Fptr)->tilerow); (fptr->Fptr)->tileanynull = 0; (fptr->Fptr)->tiletype = 0; (fptr->Fptr)->tiledatasize = 0; (fptr->Fptr)->tilenullarray = 0; (fptr->Fptr)->tiledata = 0; (fptr->Fptr)->tilerow = 0; } if ((fptr->Fptr)->tableptr) free((fptr->Fptr)->tableptr); /* free memory for the old CHDU */ (fptr->Fptr)->tableptr = 0; /* set a null table structure pointer */ (fptr->Fptr)->numrows = 0; (fptr->Fptr)->origrows = 0; } else { /* The primary array is actually interpreted as a binary table. There are two columns: the first column contains the group parameters if any. The second column contains the primary array of data as a single vector column element. In the case of 'random grouped' format, each group is stored in a separate row of the table. */ /* the number of rows is equal to the number of groups */ (fptr->Fptr)->numrows = gcount; (fptr->Fptr)->origrows = gcount; (fptr->Fptr)->rowlength = (npix + pcount) * bytlen; /* total size */ (fptr->Fptr)->tfield = 2; /* 2 fields: group params and the image */ /* free the tile-compressed image cache, if it exists */ if ((fptr->Fptr)->tilerow) { ntilebins = (((fptr->Fptr)->znaxis[0] - 1) / ((fptr->Fptr)->tilesize[0])) + 1; for (ii = 0; ii < ntilebins; ii++) { if ((fptr->Fptr)->tiledata[ii]) { free((fptr->Fptr)->tiledata[ii]); } if ((fptr->Fptr)->tilenullarray[ii]) { free((fptr->Fptr)->tilenullarray[ii]); } } free((fptr->Fptr)->tileanynull); free((fptr->Fptr)->tiletype); free((fptr->Fptr)->tiledatasize); free((fptr->Fptr)->tilenullarray); free((fptr->Fptr)->tiledata); free((fptr->Fptr)->tilerow); (fptr->Fptr)->tileanynull = 0; (fptr->Fptr)->tiletype = 0; (fptr->Fptr)->tiledatasize = 0; (fptr->Fptr)->tilenullarray = 0; (fptr->Fptr)->tiledata = 0; (fptr->Fptr)->tilerow = 0; } if ((fptr->Fptr)->tableptr) free((fptr->Fptr)->tableptr); /* free memory for the old CHDU */ colptr = (tcolumn *) calloc(2, sizeof(tcolumn) ) ; if (!colptr) { ffpmsg ("malloc failed to get memory for FITS array descriptors (ffpinit)"); (fptr->Fptr)->tableptr = 0; /* set a null table structure pointer */ return(*status = ARRAY_TOO_BIG); } /* copy the table structure address to the fitsfile structure */ (fptr->Fptr)->tableptr = colptr; /* the first column represents the group parameters, if any */ colptr->tbcol = 0; colptr->tdatatype = ttype; colptr->twidth = bytlen; colptr->trepeat = (LONGLONG) pcount; colptr->tscale = 1.; colptr->tzero = 0.; colptr->tnull = blank; colptr++; /* increment pointer to the second column */ /* the second column represents the image array */ colptr->tbcol = pcount * bytlen; /* col starts after the group parms */ colptr->tdatatype = ttype; colptr->twidth = bytlen; colptr->trepeat = npix; colptr->tscale = bscale; colptr->tzero = bzero; colptr->tnull = blank; } /* reset next keyword pointer to the start of the header */ (fptr->Fptr)->nextkey = (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu ]; return(*status); } /*--------------------------------------------------------------------------*/ int ffainit(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ { /* initialize the parameters defining the structure of an ASCII table */ int ii, nspace, ntilebins; long tfield; LONGLONG pcount, rowlen, nrows, tbcoln; tcolumn *colptr = 0; char name[FLEN_KEYWORD], value[FLEN_VALUE], comm[FLEN_COMMENT]; char message[FLEN_ERRMSG], errmsg[FLEN_ERRMSG]; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); (fptr->Fptr)->hdutype = ASCII_TBL; /* set that this is an ASCII table */ (fptr->Fptr)->headend = (fptr->Fptr)->logfilesize; /* set max size */ /* get table parameters and test that the header is a valid: */ if (ffgttb(fptr, &rowlen, &nrows, &pcount, &tfield, status) > 0) return(*status); if (pcount != 0) { ffpmsg("PCOUNT keyword not equal to 0 in ASCII table (ffainit)."); snprintf(errmsg, FLEN_ERRMSG," PCOUNT = %ld", (long) pcount); ffpmsg(errmsg); return(*status = BAD_PCOUNT); } (fptr->Fptr)->rowlength = rowlen; /* store length of a row */ (fptr->Fptr)->tfield = tfield; /* store number of table fields in row */ /* free the tile-compressed image cache, if it exists */ if ((fptr->Fptr)->tilerow) { ntilebins = (((fptr->Fptr)->znaxis[0] - 1) / ((fptr->Fptr)->tilesize[0])) + 1; for (ii = 0; ii < ntilebins; ii++) { if ((fptr->Fptr)->tiledata[ii]) { free((fptr->Fptr)->tiledata[ii]); } if ((fptr->Fptr)->tilenullarray[ii]) { free((fptr->Fptr)->tilenullarray[ii]); } } free((fptr->Fptr)->tileanynull); free((fptr->Fptr)->tiletype); free((fptr->Fptr)->tiledatasize); free((fptr->Fptr)->tilenullarray); free((fptr->Fptr)->tiledata); free((fptr->Fptr)->tilerow); (fptr->Fptr)->tileanynull = 0; (fptr->Fptr)->tiletype = 0; (fptr->Fptr)->tiledatasize = 0; (fptr->Fptr)->tilenullarray = 0; (fptr->Fptr)->tiledata = 0; (fptr->Fptr)->tilerow = 0; } if ((fptr->Fptr)->tableptr) free((fptr->Fptr)->tableptr); /* free memory for the old CHDU */ /* mem for column structures ; space is initialized = 0 */ if (tfield > 0) { colptr = (tcolumn *) calloc(tfield, sizeof(tcolumn) ); if (!colptr) { ffpmsg ("malloc failed to get memory for FITS table descriptors (ffainit)"); (fptr->Fptr)->tableptr = 0; /* set a null table structure pointer */ return(*status = ARRAY_TOO_BIG); } } /* copy the table structure address to the fitsfile structure */ (fptr->Fptr)->tableptr = colptr; /* initialize the table field parameters */ for (ii = 0; ii < tfield; ii++, colptr++) { colptr->ttype[0] = '\0'; /* null column name */ colptr->tscale = 1.; colptr->tzero = 0.; colptr->strnull[0] = ASCII_NULL_UNDEFINED; /* null value undefined */ colptr->tbcol = -1; /* initialize to illegal value */ colptr->tdatatype = -9999; /* initialize to illegal value */ } /* Initialize the fictitious heap starting address (immediately following the table data) and a zero length heap. This is used to find the end of the table data when checking the fill values in the last block. There is no special data following an ASCII table. */ (fptr->Fptr)->numrows = nrows; (fptr->Fptr)->origrows = nrows; (fptr->Fptr)->heapstart = rowlen * nrows; (fptr->Fptr)->heapsize = 0; (fptr->Fptr)->compressimg = 0; /* this is not a compressed image */ /* now search for the table column keywords and the END keyword */ for (nspace = 0, ii = 8; 1; ii++) /* infinite loop */ { ffgkyn(fptr, ii, name, value, comm, status); /* try to ignore minor syntax errors */ if (*status == NO_QUOTE) { strcat(value, "'"); *status = 0; } else if (*status == BAD_KEYCHAR) { *status = 0; } if (*status == END_OF_FILE) { ffpmsg("END keyword not found in ASCII table header (ffainit)."); return(*status = NO_END); } else if (*status > 0) return(*status); else if (name[0] == 'T') /* keyword starts with 'T' ? */ ffgtbp(fptr, name, value, status); /* test if column keyword */ else if (!FSTRCMP(name, "END")) /* is this the END keyword? */ break; if (!name[0] && !value[0] && !comm[0]) /* a blank keyword? */ nspace++; else nspace = 0; } /* test that all required keywords were found and have legal values */ colptr = (fptr->Fptr)->tableptr; for (ii = 0; ii < tfield; ii++, colptr++) { tbcoln = colptr->tbcol; /* the starting column number (zero based) */ if (colptr->tdatatype == -9999) { ffkeyn("TFORM", ii+1, name, status); /* construct keyword name */ snprintf(message,FLEN_ERRMSG,"Required %s keyword not found (ffainit).", name); ffpmsg(message); return(*status = NO_TFORM); } else if (tbcoln == -1) { ffkeyn("TBCOL", ii+1, name, status); /* construct keyword name */ snprintf(message,FLEN_ERRMSG,"Required %s keyword not found (ffainit).", name); ffpmsg(message); return(*status = NO_TBCOL); } else if ((fptr->Fptr)->rowlength != 0 && (tbcoln < 0 || tbcoln >= (fptr->Fptr)->rowlength ) ) { ffkeyn("TBCOL", ii+1, name, status); /* construct keyword name */ snprintf(message,FLEN_ERRMSG,"Value of %s keyword out of range: %ld (ffainit).", name, (long) tbcoln); ffpmsg(message); return(*status = BAD_TBCOL); } else if ((fptr->Fptr)->rowlength != 0 && tbcoln + colptr->twidth > (fptr->Fptr)->rowlength ) { snprintf(message,FLEN_ERRMSG,"Column %d is too wide to fit in table (ffainit)", ii+1); ffpmsg(message); snprintf(message, FLEN_ERRMSG," TFORM = %s and NAXIS1 = %ld", colptr->tform, (long) (fptr->Fptr)->rowlength); ffpmsg(message); return(*status = COL_TOO_WIDE); } } /* now we know everything about the table; just fill in the parameters: the 'END' record is 80 bytes before the current position, minus any trailing blank keywords just before the END keyword. */ (fptr->Fptr)->headend = (fptr->Fptr)->nextkey - (80 * (nspace + 1)); /* the data unit begins at the beginning of the next logical block */ (fptr->Fptr)->datastart = (((fptr->Fptr)->nextkey - 80) / 2880 + 1) * 2880; /* the next HDU begins in the next logical block after the data */ (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu + 1] = (fptr->Fptr)->datastart + ( ((LONGLONG)rowlen * nrows + 2879) / 2880 * 2880 ); /* reset next keyword pointer to the start of the header */ (fptr->Fptr)->nextkey = (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu ]; return(*status); } /*--------------------------------------------------------------------------*/ int ffbinit(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ { /* initialize the parameters defining the structure of a binary table */ int ii, nspace, ntilebins; long tfield; LONGLONG pcount, rowlen, nrows, totalwidth; tcolumn *colptr = 0; char name[FLEN_KEYWORD], value[FLEN_VALUE], comm[FLEN_COMMENT]; char message[FLEN_ERRMSG]; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); (fptr->Fptr)->hdutype = BINARY_TBL; /* set that this is a binary table */ (fptr->Fptr)->headend = (fptr->Fptr)->logfilesize; /* set max size */ /* get table parameters and test that the header is valid: */ if (ffgttb(fptr, &rowlen, &nrows, &pcount, &tfield, status) > 0) return(*status); (fptr->Fptr)->rowlength = rowlen; /* store length of a row */ (fptr->Fptr)->tfield = tfield; /* store number of table fields in row */ /* free the tile-compressed image cache, if it exists */ if ((fptr->Fptr)->tilerow) { ntilebins = (((fptr->Fptr)->znaxis[0] - 1) / ((fptr->Fptr)->tilesize[0])) + 1; for (ii = 0; ii < ntilebins; ii++) { if ((fptr->Fptr)->tiledata[ii]) { free((fptr->Fptr)->tiledata[ii]); } if ((fptr->Fptr)->tilenullarray[ii]) { free((fptr->Fptr)->tilenullarray[ii]); } } free((fptr->Fptr)->tileanynull); free((fptr->Fptr)->tiletype); free((fptr->Fptr)->tiledatasize); free((fptr->Fptr)->tilenullarray); free((fptr->Fptr)->tiledata); free((fptr->Fptr)->tilerow); (fptr->Fptr)->tileanynull = 0; (fptr->Fptr)->tiletype = 0; (fptr->Fptr)->tiledatasize = 0; (fptr->Fptr)->tilenullarray = 0; (fptr->Fptr)->tiledata = 0; (fptr->Fptr)->tilerow = 0; } if ((fptr->Fptr)->tableptr) free((fptr->Fptr)->tableptr); /* free memory for the old CHDU */ /* mem for column structures ; space is initialized = 0 */ if (tfield > 0) { colptr = (tcolumn *) calloc(tfield, sizeof(tcolumn) ); if (!colptr) { ffpmsg ("malloc failed to get memory for FITS table descriptors (ffbinit)"); (fptr->Fptr)->tableptr = 0; /* set a null table structure pointer */ return(*status = ARRAY_TOO_BIG); } } /* copy the table structure address to the fitsfile structure */ (fptr->Fptr)->tableptr = colptr; /* initialize the table field parameters */ for (ii = 0; ii < tfield; ii++, colptr++) { colptr->ttype[0] = '\0'; /* null column name */ colptr->tscale = 1.; colptr->tzero = 0.; colptr->tnull = NULL_UNDEFINED; /* (integer) null value undefined */ colptr->tdatatype = -9999; /* initialize to illegal value */ colptr->trepeat = 1; colptr->strnull[0] = '\0'; /* for ASCII string columns (TFORM = rA) */ } /* Initialize the heap starting address (immediately following the table data) and the size of the heap. This is used to find the end of the table data when checking the fill values in the last block. */ (fptr->Fptr)->numrows = nrows; (fptr->Fptr)->origrows = nrows; (fptr->Fptr)->heapstart = rowlen * nrows; (fptr->Fptr)->heapsize = pcount; (fptr->Fptr)->compressimg = 0; /* initialize as not a compressed image */ /* now search for the table column keywords and the END keyword */ for (nspace = 0, ii = 8; 1; ii++) /* infinite loop */ { ffgkyn(fptr, ii, name, value, comm, status); /* try to ignore minor syntax errors */ if (*status == NO_QUOTE) { strcat(value, "'"); *status = 0; } else if (*status == BAD_KEYCHAR) { *status = 0; } if (*status == END_OF_FILE) { ffpmsg("END keyword not found in binary table header (ffbinit)."); return(*status = NO_END); } else if (*status > 0) return(*status); else if (name[0] == 'T') /* keyword starts with 'T' ? */ ffgtbp(fptr, name, value, status); /* test if column keyword */ else if (!FSTRCMP(name, "ZIMAGE")) { if (value[0] == 'T') (fptr->Fptr)->compressimg = 1; /* this is a compressed image */ } else if (!FSTRCMP(name, "END")) /* is this the END keyword? */ break; if (!name[0] && !value[0] && !comm[0]) /* a blank keyword? */ nspace++; else nspace = 0; /* reset number of consecutive spaces before END */ } /* test that all the required keywords were found and have legal values */ colptr = (fptr->Fptr)->tableptr; /* set pointer to first column */ for (ii = 0; ii < tfield; ii++, colptr++) { if (colptr->tdatatype == -9999) { ffkeyn("TFORM", ii+1, name, status); /* construct keyword name */ snprintf(message,FLEN_ERRMSG,"Required %s keyword not found (ffbinit).", name); ffpmsg(message); return(*status = NO_TFORM); } } /* now we know everything about the table; just fill in the parameters: the 'END' record is 80 bytes before the current position, minus any trailing blank keywords just before the END keyword. */ (fptr->Fptr)->headend = (fptr->Fptr)->nextkey - (80 * (nspace + 1)); /* the data unit begins at the beginning of the next logical block */ (fptr->Fptr)->datastart = (((fptr->Fptr)->nextkey - 80) / 2880 + 1) * 2880; /* the next HDU begins in the next logical block after the data */ (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu + 1] = (fptr->Fptr)->datastart + ( ((fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize + 2879) / 2880 * 2880 ); /* determine the byte offset to the beginning of each column */ ffgtbc(fptr, &totalwidth, status); if (totalwidth != rowlen) { snprintf(message,FLEN_ERRMSG, "NAXIS1 = %ld is not equal to the sum of column widths: %ld", (long) rowlen, (long) totalwidth); ffpmsg(message); *status = BAD_ROW_WIDTH; } /* reset next keyword pointer to the start of the header */ (fptr->Fptr)->nextkey = (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu ]; if ( (fptr->Fptr)->compressimg == 1) /* Is this a compressed image */ imcomp_get_compressed_image_par(fptr, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffgabc(int tfields, /* I - number of columns in the table */ char **tform, /* I - value of TFORMn keyword for each column */ int space, /* I - number of spaces to leave between cols */ long *rowlen, /* O - total width of a table row */ long *tbcol, /* O - starting byte in row for each column */ int *status) /* IO - error status */ /* calculate the starting byte offset of each column of an ASCII table and the total length of a row, in bytes. The input space value determines how many blank spaces to leave between each column (1 is recommended). */ { int ii, datacode, decims; long width; if (*status > 0) return(*status); *rowlen=0; if (tfields <= 0) return(*status); tbcol[0] = 1; for (ii = 0; ii < tfields; ii++) { tbcol[ii] = *rowlen + 1; /* starting byte in row of column */ ffasfm(tform[ii], &datacode, &width, &decims, status); *rowlen += (width + space); /* total length of row */ } *rowlen -= space; /* don't add space after the last field */ return (*status); } /*--------------------------------------------------------------------------*/ int ffgtbc(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG *totalwidth, /* O - total width of a table row */ int *status) /* IO - error status */ { /* calculate the starting byte offset of each column of a binary table. Use the values of the datatype code and repeat counts in the column structure. Return the total length of a row, in bytes. */ int tfields, ii; LONGLONG nbytes; tcolumn *colptr; char message[FLEN_ERRMSG], *cptr; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); tfields = (fptr->Fptr)->tfield; colptr = (fptr->Fptr)->tableptr; /* point to first column structure */ *totalwidth = 0; for (ii = 0; ii < tfields; ii++, colptr++) { colptr->tbcol = *totalwidth; /* byte offset in row to this column */ if (colptr->tdatatype == TSTRING) { nbytes = colptr->trepeat; /* one byte per char */ } else if (colptr->tdatatype == TBIT) { nbytes = ( colptr->trepeat + 7) / 8; } else if (colptr->tdatatype > 0) { nbytes = colptr->trepeat * (colptr->tdatatype / 10); } else { cptr = colptr->tform; while (isdigit(*cptr)) cptr++; if (*cptr == 'P') /* this is a 'P' variable length descriptor (neg. tdatatype) */ nbytes = colptr->trepeat * 8; else if (*cptr == 'Q') /* this is a 'Q' variable length descriptor (neg. tdatatype) */ nbytes = colptr->trepeat * 16; else { snprintf(message,FLEN_ERRMSG, "unknown binary table column type: %s", colptr->tform); ffpmsg(message); *status = BAD_TFORM; return(*status); } } *totalwidth = *totalwidth + nbytes; } return(*status); } /*--------------------------------------------------------------------------*/ int ffgtbp(fitsfile *fptr, /* I - FITS file pointer */ char *name, /* I - name of the keyword */ char *value, /* I - value string of the keyword */ int *status) /* IO - error status */ { /* Get TaBle Parameter. The input keyword name begins with the letter T. Test if the keyword is one of the table column definition keywords of an ASCII or binary table. If so, decode it and update the value in the structure. */ int tstatus, datacode, decimals; long width, repeat, nfield, ivalue; LONGLONG jjvalue; double dvalue; char tvalue[FLEN_VALUE], *loc; char message[FLEN_ERRMSG]; tcolumn *colptr; if (*status > 0) return(*status); tstatus = 0; /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); if(!FSTRNCMP(name + 1, "TYPE", 4) ) { /* get the index number */ if( ffc2ii(name + 5, &nfield, &tstatus) > 0) /* read index no. */ return(*status); /* must not be an indexed keyword */ if (nfield < 1 || nfield > (fptr->Fptr)->tfield ) /* out of range */ return(*status); colptr = (fptr->Fptr)->tableptr; /* get pointer to columns */ colptr = colptr + nfield - 1; /* point to the correct column */ if (ffc2s(value, tvalue, &tstatus) > 0) /* remove quotes */ return(*status); strcpy(colptr->ttype, tvalue); /* copy col name to structure */ } else if(!FSTRNCMP(name + 1, "FORM", 4) ) { /* get the index number */ if( ffc2ii(name + 5, &nfield, &tstatus) > 0) /* read index no. */ return(*status); /* must not be an indexed keyword */ if (nfield < 1 || nfield > (fptr->Fptr)->tfield ) /* out of range */ return(*status); colptr = (fptr->Fptr)->tableptr; /* get pointer to columns */ colptr = colptr + nfield - 1; /* point to the correct column */ if (ffc2s(value, tvalue, &tstatus) > 0) /* remove quotes */ return(*status); strncpy(colptr->tform, tvalue, 9); /* copy TFORM to structure */ colptr->tform[9] = '\0'; /* make sure it is terminated */ if ((fptr->Fptr)->hdutype == ASCII_TBL) /* ASCII table */ { if (ffasfm(tvalue, &datacode, &width, &decimals, status) > 0) return(*status); /* bad format code */ colptr->tdatatype = TSTRING; /* store datatype code */ colptr->trepeat = 1; /* field repeat count == 1 */ colptr->twidth = width; /* the width of the field, in bytes */ } else /* binary table */ { if (ffbnfm(tvalue, &datacode, &repeat, &width, status) > 0) return(*status); /* bad format code */ colptr->tdatatype = datacode; /* store datatype code */ colptr->trepeat = (LONGLONG) repeat; /* field repeat count */ /* Don't overwrite the unit string width if it was previously */ /* set by a TDIMn keyword and has a legal value */ if (datacode == TSTRING) { if (colptr->twidth == 0 || colptr->twidth > repeat) colptr->twidth = width; /* width of a unit string */ } else { colptr->twidth = width; /* width of a unit value in chars */ } } } else if(!FSTRNCMP(name + 1, "BCOL", 4) ) { /* get the index number */ if( ffc2ii(name + 5, &nfield, &tstatus) > 0) /* read index no. */ return(*status); /* must not be an indexed keyword */ if (nfield < 1 || nfield > (fptr->Fptr)->tfield ) /* out of range */ return(*status); colptr = (fptr->Fptr)->tableptr; /* get pointer to columns */ colptr = colptr + nfield - 1; /* point to the correct column */ if ((fptr->Fptr)->hdutype == BINARY_TBL) return(*status); /* binary tables don't have TBCOL keywords */ if (ffc2ii(value, &ivalue, status) > 0) { snprintf(message, FLEN_ERRMSG, "Error reading value of %s as an integer: %s", name, value); ffpmsg(message); return(*status); } colptr->tbcol = ivalue - 1; /* convert to zero base */ } else if(!FSTRNCMP(name + 1, "SCAL", 4) ) { /* get the index number */ if( ffc2ii(name + 5, &nfield, &tstatus) > 0) /* read index no. */ return(*status); /* must not be an indexed keyword */ if (nfield < 1 || nfield > (fptr->Fptr)->tfield ) /* out of range */ return(*status); colptr = (fptr->Fptr)->tableptr; /* get pointer to columns */ colptr = colptr + nfield - 1; /* point to the correct column */ if (ffc2dd(value, &dvalue, &tstatus) > 0) { snprintf(message,FLEN_ERRMSG, "Error reading value of %s as a double: %s", name, value); ffpmsg(message); /* ignore this error, so don't return error status */ return(*status); } colptr->tscale = dvalue; } else if(!FSTRNCMP(name + 1, "ZERO", 4) ) { /* get the index number */ if( ffc2ii(name + 5, &nfield, &tstatus) > 0) /* read index no. */ return(*status); /* must not be an indexed keyword */ if (nfield < 1 || nfield > (fptr->Fptr)->tfield ) /* out of range */ return(*status); colptr = (fptr->Fptr)->tableptr; /* get pointer to columns */ colptr = colptr + nfield - 1; /* point to the correct column */ if (ffc2dd(value, &dvalue, &tstatus) > 0) { snprintf(message,FLEN_ERRMSG, "Error reading value of %s as a double: %s", name, value); ffpmsg(message); /* ignore this error, so don't return error status */ return(*status); } colptr->tzero = dvalue; } else if(!FSTRNCMP(name + 1, "NULL", 4) ) { /* get the index number */ if( ffc2ii(name + 5, &nfield, &tstatus) > 0) /* read index no. */ return(*status); /* must not be an indexed keyword */ if (nfield < 1 || nfield > (fptr->Fptr)->tfield ) /* out of range */ return(*status); colptr = (fptr->Fptr)->tableptr; /* get pointer to columns */ colptr = colptr + nfield - 1; /* point to the correct column */ if ((fptr->Fptr)->hdutype == ASCII_TBL) /* ASCII table */ { if (ffc2s(value, tvalue, &tstatus) > 0) /* remove quotes */ return(*status); strncpy(colptr->strnull, tvalue, 17); /* copy TNULL string */ colptr->strnull[17] = '\0'; /* terminate the strnull field */ } else /* binary table */ { if (ffc2jj(value, &jjvalue, &tstatus) > 0) { snprintf(message,FLEN_ERRMSG, "Error reading value of %s as an integer: %s", name, value); ffpmsg(message); /* ignore this error, so don't return error status */ return(*status); } colptr->tnull = jjvalue; /* null value for integer column */ } } else if(!FSTRNCMP(name + 1, "DIM", 3) ) { if ((fptr->Fptr)->hdutype == ASCII_TBL) /* ASCII table */ return(*status); /* ASCII tables don't support TDIMn keyword */ /* get the index number */ if( ffc2ii(name + 4, &nfield, &tstatus) > 0) /* read index no. */ return(*status); /* must not be an indexed keyword */ if (nfield < 1 || nfield > (fptr->Fptr)->tfield ) /* out of range */ return(*status); colptr = (fptr->Fptr)->tableptr; /* get pointer to columns */ colptr = colptr + nfield - 1; /* point to the correct column */ /* uninitialized columns have tdatatype set = -9999 */ if (colptr->tdatatype != -9999 && colptr->tdatatype != TSTRING) return(*status); /* this is not an ASCII string column */ loc = strchr(value, '(' ); /* find the opening parenthesis */ if (!loc) return(*status); /* not a proper TDIM keyword */ loc++; width = strtol(loc, &loc, 10); /* read size of first dimension */ if (colptr->trepeat != 1 && colptr->trepeat < width) return(*status); /* string length is greater than column width */ colptr->twidth = width; /* set width of a unit string in chars */ } else if (!FSTRNCMP(name + 1, "HEAP", 4) ) { if ((fptr->Fptr)->hdutype == ASCII_TBL) /* ASCII table */ return(*status); /* ASCII tables don't have a heap */ if (ffc2jj(value, &jjvalue, &tstatus) > 0) { snprintf(message,FLEN_ERRMSG, "Error reading value of %s as an integer: %s", name, value); ffpmsg(message); /* ignore this error, so don't return error status */ return(*status); } (fptr->Fptr)->heapstart = jjvalue; /* starting byte of the heap */ return(*status); } return(*status); } /*--------------------------------------------------------------------------*/ int ffgcprll( fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number (1 = 1st column of table) */ LONGLONG firstrow, /* I - first row (1 = 1st row of table) */ LONGLONG firstelem, /* I - first element within vector (1 = 1st) */ LONGLONG nelem, /* I - number of elements to read or write */ int writemode, /* I - = 1 if writing data, = 0 if reading data */ /* If = 2, then writing data, but don't modify */ /* the returned values of repeat and incre. */ /* If = -1, then reading data in reverse */ /* direction. */ double *scale, /* O - FITS scaling factor (TSCALn keyword value) */ double *zero, /* O - FITS scaling zero pt (TZEROn keyword value) */ char *tform, /* O - ASCII column format: value of TFORMn keyword */ long *twidth, /* O - width of ASCII column (characters) */ int *tcode, /* O - column datatype code: I*4=41, R*4=42, etc */ int *maxelem, /* O - max number of elements that fit in buffer */ LONGLONG *startpos,/* O - offset in file to starting row & column */ LONGLONG *elemnum, /* O - starting element number ( 0 = 1st element) */ long *incre, /* O - byte offset between elements within a row */ LONGLONG *repeat, /* O - number of elements in a row (vector column) */ LONGLONG *rowlen, /* O - length of a row, in bytes */ int *hdutype, /* O - HDU type: 0, 1, 2 = primary, table, bintable */ LONGLONG *tnull, /* O - null value for integer columns */ char *snull, /* O - null value for ASCII table columns */ int *status) /* IO - error status */ /* Get Column PaRameters, and test starting row and element numbers for validity. This is a workhorse routine that is call by nearly every other routine that reads or writes to FITS files. */ { int nulpos, rangecheck = 1, tstatus = 0; LONGLONG datastart, endpos; long nblock; LONGLONG heapoffset, lrepeat, endrow, nrows, tbcol; char message[FLEN_ERRMSG]; tcolumn *colptr; if (fptr->HDUposition != (fptr->Fptr)->curhdu) { /* reset position to the correct HDU if necessary */ ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); } else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) { /* rescan header if data structure is undefined */ if ( ffrdef(fptr, status) > 0) return(*status); } else if (writemode > 0) { /* Only terminate the header with the END card if */ /* writing to the stdout stream (don't have random access). */ /* Initialize STREAM_DRIVER to be the device number for */ /* writing FITS files directly out to the stdout stream. */ /* This only needs to be done once and is thread safe. */ if (STREAM_DRIVER <= 0 || STREAM_DRIVER > 40) { urltype2driver("stream://", &STREAM_DRIVER); } if ((fptr->Fptr)->driver == STREAM_DRIVER) { if ((fptr->Fptr)->ENDpos != maxvalue((fptr->Fptr)->headend , (fptr->Fptr)->datastart -2880)) { ffwend(fptr, status); } } } /* Do sanity check of input parameters */ if (firstrow < 1) { if ((fptr->Fptr)->hdutype == IMAGE_HDU) /* Primary Array or IMAGE */ { snprintf(message,FLEN_ERRMSG, "Image group number is less than 1: %.0f", (double) firstrow); ffpmsg(message); return(*status = BAD_ROW_NUM); } else { snprintf(message, FLEN_ERRMSG,"Starting row number is less than 1: %.0f", (double) firstrow); ffpmsg(message); return(*status = BAD_ROW_NUM); } } else if ((fptr->Fptr)->hdutype != ASCII_TBL && firstelem < 1) { snprintf(message, FLEN_ERRMSG,"Starting element number less than 1: %ld", (long) firstelem); ffpmsg(message); return(*status = BAD_ELEM_NUM); } else if (nelem < 0) { snprintf(message, FLEN_ERRMSG,"Tried to read or write less than 0 elements: %.0f", (double) nelem); ffpmsg(message); return(*status = NEG_BYTES); } else if (colnum < 1 || colnum > (fptr->Fptr)->tfield) { snprintf(message, FLEN_ERRMSG,"Specified column number is out of range: %d", colnum); ffpmsg(message); snprintf(message, FLEN_ERRMSG," There are %d columns in this table.", (fptr->Fptr)->tfield ); ffpmsg(message); return(*status = BAD_COL_NUM); } /* copy relevant parameters from the structure */ *hdutype = (fptr->Fptr)->hdutype; /* image, ASCII table, or BINTABLE */ *rowlen = (fptr->Fptr)->rowlength; /* width of the table, in bytes */ datastart = (fptr->Fptr)->datastart; /* offset in file to start of table */ colptr = (fptr->Fptr)->tableptr; /* point to first column */ colptr += (colnum - 1); /* offset to correct column structure */ *scale = colptr->tscale; /* value scaling factor; default = 1.0 */ *zero = colptr->tzero; /* value scaling zeropoint; default = 0.0 */ *tnull = colptr->tnull; /* null value for integer columns */ tbcol = colptr->tbcol; /* offset to start of column within row */ *twidth = colptr->twidth; /* width of a single datum, in bytes */ *incre = colptr->twidth; /* increment between datums, in bytes */ *tcode = colptr->tdatatype; *repeat = colptr->trepeat; strcpy(tform, colptr->tform); /* value of TFORMn keyword */ strcpy(snull, colptr->strnull); /* null value for ASCII table columns */ if (*hdutype == ASCII_TBL && snull[0] == '\0') { /* In ASCII tables, a null value is equivalent to all spaces */ strcpy(snull, " "); /* maximum of 17 spaces */ nulpos = minvalue(17, *twidth); /* truncate to width of column */ snull[nulpos] = '\0'; } /* Special case: interpret writemode = -1 as reading data, but */ /* don't do error check for exceeding the range of pixels */ if (writemode == -1) { writemode = 0; rangecheck = 0; } /* Special case: interprete 'X' column as 'B' */ if (abs(*tcode) == TBIT) { *tcode = *tcode / TBIT * TBYTE; *repeat = (*repeat + 7) / 8; } /* Special case: support the 'rAw' format in BINTABLEs */ if (*hdutype == BINARY_TBL && *tcode == TSTRING) { *repeat = *repeat / *twidth; /* repeat = # of unit strings in field */ } else if (*hdutype == BINARY_TBL && *tcode == -TSTRING) { /* variable length string */ *incre = 1; *twidth = (long) nelem; } if (*hdutype == ASCII_TBL) *elemnum = 0; /* ASCII tables don't have vector elements */ else *elemnum = firstelem - 1; /* interprete complex and double complex as pairs of floats or doubles */ if (abs(*tcode) >= TCOMPLEX) { if (*tcode > 0) *tcode = (*tcode + 1) / 2; else *tcode = (*tcode - 1) / 2; *repeat = *repeat * 2; *twidth = *twidth / 2; *incre = *incre / 2; } /* calculate no. of pixels that fit in buffer */ /* allow for case where floats are 8 bytes long */ if (abs(*tcode) == TFLOAT) *maxelem = DBUFFSIZE / sizeof(float); else if (abs(*tcode) == TDOUBLE) *maxelem = DBUFFSIZE / sizeof(double); else if (abs(*tcode) == TSTRING) { *maxelem = (DBUFFSIZE - 1)/ *twidth; /* leave room for final \0 */ if (*maxelem == 0) { snprintf(message,FLEN_ERRMSG, "ASCII string column is too wide: %ld; max supported width is %d", *twidth, DBUFFSIZE - 1); ffpmsg(message); return(*status = COL_TOO_WIDE); } } else *maxelem = DBUFFSIZE / *twidth; /* calc starting byte position to 1st element of col */ /* (this does not apply to variable length columns) */ *startpos = datastart + ((LONGLONG)(firstrow - 1) * *rowlen) + tbcol; if (*hdutype == IMAGE_HDU && writemode) /* Primary Array or IMAGE */ { /* For primary arrays, set the repeat count greater than the total number of pixels to be written. This prevents an out-of-range error message in cases where the final image array size is not yet known or defined. */ if (*repeat < *elemnum + nelem) *repeat = *elemnum + nelem; } else if (*tcode > 0) /* Fixed length table column */ { if (*elemnum >= *repeat) { snprintf(message,FLEN_ERRMSG, "First element to write is too large: %ld; max allowed value is %ld", (long) ((*elemnum) + 1), (long) *repeat); ffpmsg(message); return(*status = BAD_ELEM_NUM); } /* last row number to be read or written */ endrow = ((*elemnum + nelem - 1) / *repeat) + firstrow; if (writemode) { /* check if we are writing beyond the current end of table */ if ((endrow > (fptr->Fptr)->numrows) && (nelem > 0) ) { /* if there are more HDUs following the current one, or */ /* if there is a data heap, then we must insert space */ /* for the new rows. */ if ( !((fptr->Fptr)->lasthdu) || (fptr->Fptr)->heapsize > 0) { nrows = endrow - ((fptr->Fptr)->numrows); if (ffirow(fptr, (fptr->Fptr)->numrows, nrows, status) > 0) { snprintf(message,FLEN_ERRMSG, "Failed to add space for %.0f new rows in table.", (double) nrows); ffpmsg(message); return(*status); } } else { /* update heap starting address */ (fptr->Fptr)->heapstart += ((LONGLONG)(endrow - (fptr->Fptr)->numrows) * (fptr->Fptr)->rowlength ); (fptr->Fptr)->numrows = endrow; /* update number of rows */ } } } else /* reading from the file */ { if ( endrow > (fptr->Fptr)->numrows && rangecheck) { if (*hdutype == IMAGE_HDU) /* Primary Array or IMAGE */ { if (firstrow > (fptr->Fptr)->numrows) { snprintf(message, FLEN_ERRMSG, "Attempted to read from group %ld of the HDU,", (long) firstrow); ffpmsg(message); snprintf(message, FLEN_ERRMSG, "however the HDU only contains %ld group(s).", (long) ((fptr->Fptr)->numrows) ); ffpmsg(message); } else { ffpmsg("Attempt to read past end of array:"); snprintf(message, FLEN_ERRMSG, " Image has %ld elements;", (long) *repeat); ffpmsg(message); snprintf(message, FLEN_ERRMSG, " Tried to read %ld elements starting at element %ld.", (long) nelem, (long) firstelem); ffpmsg(message); } } else { ffpmsg("Attempt to read past end of table:"); snprintf(message, FLEN_ERRMSG, " Table has %.0f rows with %.0f elements per row;", (double) ((fptr->Fptr)->numrows), (double) *repeat); ffpmsg(message); snprintf(message, FLEN_ERRMSG, " Tried to read %.0f elements starting at row %.0f, element %.0f.", (double) nelem, (double) firstrow, (double) ((*elemnum) + 1)); ffpmsg(message); } return(*status = BAD_ROW_NUM); } } if (*repeat == 1 && nelem > 1 && writemode != 2) { /* When accessing a scalar column, fool the calling routine into thinking that this is a vector column with very big elements. This allows multiple values (up to the maxelem number of elements that will fit in the buffer) to be read or written with a single routine call, which increases the efficiency. If writemode == 2, then the calling program does not want to have this efficiency trick applied. */ if (*rowlen <= LONG_MAX) { *incre = (long) *rowlen; *repeat = nelem; } } } else /* Variable length Binary Table column */ { *tcode *= (-1); if (writemode) /* return next empty heap address for writing */ { *repeat = nelem + *elemnum; /* total no. of elements in the field */ /* first, check if we are overwriting an existing row, and */ /* if so, if the existing space is big enough for the new vector */ if ( firstrow <= (fptr->Fptr)->numrows ) { ffgdesll(fptr, colnum, firstrow, &lrepeat, &heapoffset, &tstatus); if (!tstatus) { if (colptr->tdatatype <= -TCOMPLEX) lrepeat = lrepeat * 2; /* no. of float or double values */ else if (colptr->tdatatype == -TBIT) lrepeat = (lrepeat + 7) / 8; /* convert from bits to bytes */ if (lrepeat >= *repeat) /* enough existing space? */ { *startpos = datastart + heapoffset + (fptr->Fptr)->heapstart; /* write the descriptor into the fixed length part of table */ if (colptr->tdatatype <= -TCOMPLEX) { /* divide repeat count by 2 to get no. of complex values */ ffpdes(fptr, colnum, firstrow, *repeat / 2, heapoffset, status); } else { ffpdes(fptr, colnum, firstrow, *repeat, heapoffset, status); } return(*status); } } } /* Add more rows to the table, if writing beyond the end. */ /* It is necessary to shift the heap down in this case */ if ( firstrow > (fptr->Fptr)->numrows) { nrows = firstrow - ((fptr->Fptr)->numrows); if (ffirow(fptr, (fptr->Fptr)->numrows, nrows, status) > 0) { snprintf(message,FLEN_ERRMSG, "Failed to add space for %.0f new rows in table.", (double) nrows); ffpmsg(message); return(*status); } } /* calculate starting position (for writing new data) in the heap */ *startpos = datastart + (fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize; /* write the descriptor into the fixed length part of table */ if (colptr->tdatatype <= -TCOMPLEX) { /* divide repeat count by 2 to get no. of complex values */ ffpdes(fptr, colnum, firstrow, *repeat / 2, (fptr->Fptr)->heapsize, status); } else { ffpdes(fptr, colnum, firstrow, *repeat, (fptr->Fptr)->heapsize, status); } /* If this is not the last HDU in the file, then check if */ /* extending the heap would overwrite the following header. */ /* If so, then have to insert more blocks. */ if ( !((fptr->Fptr)->lasthdu) ) { endpos = datastart + (fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize + ( *repeat * (*incre)); if (endpos > (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu + 1]) { /* calc the number of blocks that need to be added */ nblock = (long) (((endpos - 1 - (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu + 1] ) / 2880) + 1); if (ffiblk(fptr, nblock, 1, status) > 0) /* insert blocks */ { snprintf(message,FLEN_ERRMSG, "Failed to extend the size of the variable length heap by %ld blocks.", nblock); ffpmsg(message); return(*status); } } } /* increment the address to the next empty heap position */ (fptr->Fptr)->heapsize += ( *repeat * (*incre)); } else /* get the read start position in the heap */ { if ( firstrow > (fptr->Fptr)->numrows) { ffpmsg("Attempt to read past end of table"); snprintf(message,FLEN_ERRMSG, " Table has %.0f rows and tried to read row %.0f.", (double) ((fptr->Fptr)->numrows), (double) firstrow); ffpmsg(message); return(*status = BAD_ROW_NUM); } ffgdesll(fptr, colnum, firstrow, &lrepeat, &heapoffset, status); *repeat = lrepeat; if (colptr->tdatatype <= -TCOMPLEX) *repeat = *repeat * 2; /* no. of float or double values */ else if (colptr->tdatatype == -TBIT) *repeat = (*repeat + 7) / 8; /* convert from bits to bytes */ if (*elemnum >= *repeat) { snprintf(message,FLEN_ERRMSG, "Starting element to read in variable length column is too large: %ld", (long) firstelem); ffpmsg(message); snprintf(message,FLEN_ERRMSG, " This row only contains %ld elements", (long) *repeat); ffpmsg(message); return(*status = BAD_ELEM_NUM); } *startpos = datastart + heapoffset + (fptr->Fptr)->heapstart; } } return(*status); } /*---------------------------------------------------------------------------*/ int fftheap(fitsfile *fptr, /* I - FITS file pointer */ LONGLONG *heapsz, /* O - current size of the heap */ LONGLONG *unused, /* O - no. of unused bytes in the heap */ LONGLONG *overlap, /* O - no. of bytes shared by > 1 descriptors */ int *valid, /* O - are all the heap addresses valid? */ int *status) /* IO - error status */ /* Tests the contents of the binary table variable length array heap. Returns the number of bytes that are currently not pointed to by any of the descriptors, and also the number of bytes that are pointed to by more than one descriptor. It returns valid = FALSE if any of the descriptors point to addresses that are out of the bounds of the heap. */ { int jj, typecode, pixsize; long ii, kk, theapsz, nbytes; LONGLONG repeat, offset, tunused = 0, toverlap = 0; char *buffer, message[FLEN_ERRMSG]; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if ( fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); /* rescan header to make sure everything is up to date */ else if ( ffrdef(fptr, status) > 0) return(*status); if (valid) *valid = TRUE; if (heapsz) *heapsz = (fptr->Fptr)->heapsize; if (unused) *unused = 0; if (overlap) *overlap = 0; /* return if this is not a binary table HDU or if the heap is empty */ if ( (fptr->Fptr)->hdutype != BINARY_TBL || (fptr->Fptr)->heapsize == 0 ) return(*status); if ((fptr->Fptr)->heapsize > LONG_MAX) { ffpmsg("Heap is too big to test ( > 2**31 bytes). (fftheap)"); return(*status = MEMORY_ALLOCATION); } theapsz = (long) (fptr->Fptr)->heapsize; buffer = calloc(1, theapsz); /* allocate temp space */ if (!buffer ) { snprintf(message,FLEN_ERRMSG,"Failed to allocate buffer to test the heap"); ffpmsg(message); return(*status = MEMORY_ALLOCATION); } /* loop over all cols */ for (jj = 1; jj <= (fptr->Fptr)->tfield && *status <= 0; jj++) { ffgtcl(fptr, jj, &typecode, NULL, NULL, status); if (typecode > 0) continue; /* ignore fixed length columns */ pixsize = -typecode / 10; for (ii = 1; ii <= (fptr->Fptr)->numrows; ii++) { ffgdesll(fptr, jj, ii, &repeat, &offset, status); if (typecode == -TBIT) nbytes = (long) (repeat + 7) / 8; else nbytes = (long) repeat * pixsize; if (offset < 0 || offset + nbytes > theapsz) { if (valid) *valid = FALSE; /* address out of bounds */ snprintf(message,FLEN_ERRMSG, "Descriptor in row %ld, column %d has invalid heap address", ii, jj); ffpmsg(message); } else { for (kk = 0; kk < nbytes; kk++) buffer[kk + offset]++; /* increment every used byte */ } } } for (kk = 0; kk < theapsz; kk++) { if (buffer[kk] == 0) tunused++; else if (buffer[kk] > 1) toverlap++; } if (heapsz) *heapsz = theapsz; if (unused) *unused = tunused; if (overlap) *overlap = toverlap; free(buffer); return(*status); } /*--------------------------------------------------------------------------*/ int ffcmph(fitsfile *fptr, /* I -FITS file pointer */ int *status) /* IO - error status */ /* compress the binary table heap by reordering the contents heap and recovering any unused space */ { fitsfile *tptr; int jj, typecode, pixsize, valid; long ii, buffsize = 10000, nblock, nbytes; LONGLONG unused, overlap; LONGLONG repeat, offset; char *buffer, *tbuff, comm[FLEN_COMMENT]; char message[FLEN_ERRMSG]; LONGLONG pcount; LONGLONG readheapstart, writeheapstart, endpos, t1heapsize, t2heapsize; if (*status > 0) return(*status); /* get information about the current heap */ fftheap(fptr, NULL, &unused, &overlap, &valid, status); if (!valid) return(*status = BAD_HEAP_PTR); /* bad heap pointers */ /* return if this is not a binary table HDU or if the heap is OK as is */ if ( (fptr->Fptr)->hdutype != BINARY_TBL || (fptr->Fptr)->heapsize == 0 || (unused == 0 && overlap == 0) || *status > 0 ) return(*status); /* copy the current HDU to a temporary file in memory */ if (ffinit( &tptr, "mem://tempheapfile", status) ) { snprintf(message,FLEN_ERRMSG,"Failed to create temporary file for the heap"); ffpmsg(message); return(*status); } if ( ffcopy(fptr, tptr, 0, status) ) { snprintf(message,FLEN_ERRMSG,"Failed to create copy of the heap"); ffpmsg(message); ffclos(tptr, status); return(*status); } buffer = (char *) malloc(buffsize); /* allocate initial buffer */ if (!buffer) { snprintf(message,FLEN_ERRMSG,"Failed to allocate buffer to copy the heap"); ffpmsg(message); ffclos(tptr, status); return(*status = MEMORY_ALLOCATION); } readheapstart = (tptr->Fptr)->datastart + (tptr->Fptr)->heapstart; writeheapstart = (fptr->Fptr)->datastart + (fptr->Fptr)->heapstart; t1heapsize = (fptr->Fptr)->heapsize; /* save original heap size */ (fptr->Fptr)->heapsize = 0; /* reset heap to zero */ /* loop over all cols */ for (jj = 1; jj <= (fptr->Fptr)->tfield && *status <= 0; jj++) { ffgtcl(tptr, jj, &typecode, NULL, NULL, status); if (typecode > 0) continue; /* ignore fixed length columns */ pixsize = -typecode / 10; /* copy heap data, row by row */ for (ii = 1; ii <= (fptr->Fptr)->numrows; ii++) { ffgdesll(tptr, jj, ii, &repeat, &offset, status); if (typecode == -TBIT) nbytes = (long) (repeat + 7) / 8; else nbytes = (long) repeat * pixsize; /* increase size of buffer if necessary to read whole array */ if (nbytes > buffsize) { tbuff = realloc(buffer, nbytes); if (tbuff) { buffer = tbuff; buffsize = nbytes; } else *status = MEMORY_ALLOCATION; } /* If this is not the last HDU in the file, then check if */ /* extending the heap would overwrite the following header. */ /* If so, then have to insert more blocks. */ if ( !((fptr->Fptr)->lasthdu) ) { endpos = writeheapstart + (fptr->Fptr)->heapsize + nbytes; if (endpos > (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu + 1]) { /* calc the number of blocks that need to be added */ nblock = (long) (((endpos - 1 - (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu + 1] ) / 2880) + 1); if (ffiblk(fptr, nblock, 1, status) > 0) /* insert blocks */ { snprintf(message,FLEN_ERRMSG, "Failed to extend the size of the variable length heap by %ld blocks.", nblock); ffpmsg(message); } } } /* read arrray of bytes from temporary copy */ ffmbyt(tptr, readheapstart + offset, REPORT_EOF, status); ffgbyt(tptr, nbytes, buffer, status); /* write arrray of bytes back to original file */ ffmbyt(fptr, writeheapstart + (fptr->Fptr)->heapsize, IGNORE_EOF, status); ffpbyt(fptr, nbytes, buffer, status); /* write descriptor */ ffpdes(fptr, jj, ii, repeat, (fptr->Fptr)->heapsize, status); (fptr->Fptr)->heapsize += nbytes; /* update heapsize */ if (*status > 0) { free(buffer); ffclos(tptr, status); return(*status); } } } free(buffer); ffclos(tptr, status); /* delete any empty blocks at the end of the HDU */ nblock = (long) (( (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu + 1] - (writeheapstart + (fptr->Fptr)->heapsize) ) / 2880); if (nblock > 0) { t2heapsize = (fptr->Fptr)->heapsize; /* save new heap size */ (fptr->Fptr)->heapsize = t1heapsize; /* restore original heap size */ ffdblk(fptr, nblock, status); (fptr->Fptr)->heapsize = t2heapsize; /* reset correct heap size */ } /* update the PCOUNT value (size of heap) */ ffmaky(fptr, 2, status); /* reset to beginning of header */ ffgkyjj(fptr, "PCOUNT", &pcount, comm, status); if ((fptr->Fptr)->heapsize != pcount) { ffmkyj(fptr, "PCOUNT", (fptr->Fptr)->heapsize, comm, status); } ffrdef(fptr, status); /* rescan new HDU structure */ return(*status); } /*--------------------------------------------------------------------------*/ int ffgdes(fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number (1 = 1st column of table) */ LONGLONG rownum, /* I - row number (1 = 1st row of table) */ long *length, /* O - number of elements in the row */ long *heapaddr, /* O - heap pointer to the data */ int *status) /* IO - error status */ /* get (read) the variable length vector descriptor from the table. */ { LONGLONG lengthjj, heapaddrjj; if (ffgdesll(fptr, colnum, rownum, &lengthjj, &heapaddrjj, status) > 0) return(*status); /* convert the temporary 8-byte values to 4-byte values */ /* check for overflow */ if (length) { if (lengthjj > LONG_MAX) *status = NUM_OVERFLOW; else *length = (long) lengthjj; } if (heapaddr) { if (heapaddrjj > LONG_MAX) *status = NUM_OVERFLOW; else *heapaddr = (long) heapaddrjj; } return(*status); } /*--------------------------------------------------------------------------*/ int ffgdesll(fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number (1 = 1st column of table) */ LONGLONG rownum, /* I - row number (1 = 1st row of table) */ LONGLONG *length, /* O - number of elements in the row */ LONGLONG *heapaddr, /* O - heap pointer to the data */ int *status) /* IO - error status */ /* get (read) the variable length vector descriptor from the binary table. This is similar to ffgdes, except it supports the full 8-byte range of the length and offset values in 'Q' columns, as well as 'P' columns. */ { LONGLONG bytepos; unsigned int descript4[2] = {0,0}; LONGLONG descript8[2] = {0,0}; tcolumn *colptr; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); colptr = (fptr->Fptr)->tableptr; /* point to first column structure */ colptr += (colnum - 1); /* offset to the correct column */ if (colptr->tdatatype >= 0) { *status = NOT_VARI_LEN; return(*status); } bytepos = (fptr->Fptr)->datastart + ((fptr->Fptr)->rowlength * (rownum - 1)) + colptr->tbcol; if (colptr->tform[0] == 'P' || colptr->tform[1] == 'P') { /* read 4-byte descriptor */ if (ffgi4b(fptr, bytepos, 2, 4, (INT32BIT *) descript4, status) <= 0) { if (length) *length = (LONGLONG) descript4[0]; /* 1st word is the length */ if (heapaddr) *heapaddr = (LONGLONG) descript4[1]; /* 2nd word is the address */ } } else /* this is for 'Q' columns */ { /* read 8 byte descriptor */ if (ffgi8b(fptr, bytepos, 2, 8, (long *) descript8, status) <= 0) { if (length) *length = descript8[0]; /* 1st word is the length */ if (heapaddr) *heapaddr = descript8[1]; /* 2nd word is the address */ } } return(*status); } /*--------------------------------------------------------------------------*/ int ffgdess(fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number (1 = 1st column of table) */ LONGLONG firstrow, /* I - first row (1 = 1st row of table) */ LONGLONG nrows, /* I - number or rows to read */ long *length, /* O - number of elements in the row */ long *heapaddr, /* O - heap pointer to the data */ int *status) /* IO - error status */ /* get (read) a range of variable length vector descriptors from the table. */ { LONGLONG rowsize, bytepos; long ii; INT32BIT descript4[2] = {0,0}; LONGLONG descript8[2] = {0,0}; tcolumn *colptr; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); colptr = (fptr->Fptr)->tableptr; /* point to first column structure */ colptr += (colnum - 1); /* offset to the correct column */ if (colptr->tdatatype >= 0) { *status = NOT_VARI_LEN; return(*status); } rowsize = (fptr->Fptr)->rowlength; bytepos = (fptr->Fptr)->datastart + (rowsize * (firstrow - 1)) + colptr->tbcol; if (colptr->tform[0] == 'P' || colptr->tform[1] == 'P') { /* read 4-byte descriptors */ for (ii = 0; ii < nrows; ii++) { /* read descriptors */ if (ffgi4b(fptr, bytepos, 2, 4, descript4, status) <= 0) { if (length) { *length = (long) descript4[0]; /* 1st word is the length */ length++; } if (heapaddr) { *heapaddr = (long) descript4[1]; /* 2nd word is the address */ heapaddr++; } bytepos += rowsize; } else return(*status); } } else /* this is for 'Q' columns */ { /* read 8-byte descriptors */ for (ii = 0; ii < nrows; ii++) { /* read descriptors */ if (ffgi8b(fptr, bytepos, 2, 8, (long *) descript8, status) <= 0) { if (length) { if (descript8[0] > LONG_MAX)*status = NUM_OVERFLOW; *length = (long) descript8[0]; /* 1st word is the length */ length++; } if (heapaddr) { if (descript8[1] > LONG_MAX)*status = NUM_OVERFLOW; *heapaddr = (long) descript8[1]; /* 2nd word is the address */ heapaddr++; } bytepos += rowsize; } else return(*status); } } return(*status); } /*--------------------------------------------------------------------------*/ int ffgdessll(fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number (1 = 1st column of table) */ LONGLONG firstrow, /* I - first row (1 = 1st row of table) */ LONGLONG nrows, /* I - number or rows to read */ LONGLONG *length, /* O - number of elements in the row */ LONGLONG *heapaddr, /* O - heap pointer to the data */ int *status) /* IO - error status */ /* get (read) a range of variable length vector descriptors from the table. */ { LONGLONG rowsize, bytepos; long ii; unsigned int descript4[2] = {0,0}; LONGLONG descript8[2] = {0,0}; tcolumn *colptr; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); colptr = (fptr->Fptr)->tableptr; /* point to first column structure */ colptr += (colnum - 1); /* offset to the correct column */ if (colptr->tdatatype >= 0) { *status = NOT_VARI_LEN; return(*status); } rowsize = (fptr->Fptr)->rowlength; bytepos = (fptr->Fptr)->datastart + (rowsize * (firstrow - 1)) + colptr->tbcol; if (colptr->tform[0] == 'P' || colptr->tform[1] == 'P') { /* read 4-byte descriptors */ for (ii = 0; ii < nrows; ii++) { /* read descriptors */ if (ffgi4b(fptr, bytepos, 2, 4, (INT32BIT *) descript4, status) <= 0) { if (length) { *length = (LONGLONG) descript4[0]; /* 1st word is the length */ length++; } if (heapaddr) { *heapaddr = (LONGLONG) descript4[1]; /* 2nd word is the address */ heapaddr++; } bytepos += rowsize; } else return(*status); } } else /* this is for 'Q' columns */ { /* read 8-byte descriptors */ for (ii = 0; ii < nrows; ii++) { /* read descriptors */ /* cast to type (long *) even though it is actually (LONGLONG *) */ if (ffgi8b(fptr, bytepos, 2, 8, (long *) descript8, status) <= 0) { if (length) { *length = descript8[0]; /* 1st word is the length */ length++; } if (heapaddr) { *heapaddr = descript8[1]; /* 2nd word is the address */ heapaddr++; } bytepos += rowsize; } else return(*status); } } return(*status); } /*--------------------------------------------------------------------------*/ int ffpdes(fitsfile *fptr, /* I - FITS file pointer */ int colnum, /* I - column number (1 = 1st column of table) */ LONGLONG rownum, /* I - row number (1 = 1st row of table) */ LONGLONG length, /* I - number of elements in the row */ LONGLONG heapaddr, /* I - heap pointer to the data */ int *status) /* IO - error status */ /* put (write) the variable length vector descriptor to the table. */ { LONGLONG bytepos; unsigned int descript4[2]; LONGLONG descript8[2]; tcolumn *colptr; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); colptr = (fptr->Fptr)->tableptr; /* point to first column structure */ colptr += (colnum - 1); /* offset to the correct column */ if (colptr->tdatatype >= 0) *status = NOT_VARI_LEN; bytepos = (fptr->Fptr)->datastart + ((fptr->Fptr)->rowlength * (rownum - 1)) + colptr->tbcol; ffmbyt(fptr, bytepos, IGNORE_EOF, status); /* move to element */ if (colptr->tform[0] == 'P' || colptr->tform[1] == 'P') { if (length > UINT_MAX || length < 0 || heapaddr > UINT_MAX || heapaddr < 0) { ffpmsg("P variable length column descriptor is out of range"); *status = NUM_OVERFLOW; return(*status); } descript4[0] = (unsigned int) length; /* 1st word is the length */ descript4[1] = (unsigned int) heapaddr; /* 2nd word is the address */ ffpi4b(fptr, 2, 4, (INT32BIT *) descript4, status); /* write the descriptor */ } else /* this is a 'Q' descriptor column */ { descript8[0] = length; /* 1st word is the length */ descript8[1] = heapaddr; /* 2nd word is the address */ ffpi8b(fptr, 2, 8, (long *) descript8, status); /* write the descriptor */ } return(*status); } /*--------------------------------------------------------------------------*/ int ffchdu(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ { /* close the current HDU. If we have write access to the file, then: - write the END keyword and pad header with blanks if necessary - check the data fill values, and rewrite them if not correct */ char message[FLEN_ERRMSG]; int ii, stdriver, ntilebins; /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) { ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); /* no need to do any further updating of the HDU */ } else if ((fptr->Fptr)->writemode == 1) { urltype2driver("stream://", &stdriver); /* don't rescan header in special case of writing to stdout */ if (((fptr->Fptr)->driver != stdriver)) ffrdef(fptr, status); if ((fptr->Fptr)->heapsize > 0) { ffuptf(fptr, status); /* update the variable length TFORM values */ } ffpdfl(fptr, status); /* insure correct data fill values */ } if ((fptr->Fptr)->open_count == 1) { /* free memory for the CHDU structure only if no other files are using it */ if ((fptr->Fptr)->tableptr) { free((fptr->Fptr)->tableptr); (fptr->Fptr)->tableptr = NULL; /* free the tile-compressed image cache, if it exists */ if ((fptr->Fptr)->tilerow) { ntilebins = (((fptr->Fptr)->znaxis[0] - 1) / ((fptr->Fptr)->tilesize[0])) + 1; for (ii = 0; ii < ntilebins; ii++) { if ((fptr->Fptr)->tiledata[ii]) { free((fptr->Fptr)->tiledata[ii]); } if ((fptr->Fptr)->tilenullarray[ii]) { free((fptr->Fptr)->tilenullarray[ii]); } } free((fptr->Fptr)->tileanynull); free((fptr->Fptr)->tiletype); free((fptr->Fptr)->tiledatasize); free((fptr->Fptr)->tilenullarray); free((fptr->Fptr)->tiledata); free((fptr->Fptr)->tilerow); (fptr->Fptr)->tileanynull = 0; (fptr->Fptr)->tiletype = 0; (fptr->Fptr)->tiledatasize = 0; (fptr->Fptr)->tilenullarray = 0; (fptr->Fptr)->tiledata = 0; (fptr->Fptr)->tilerow = 0; } } } if (*status > 0 && *status != NO_CLOSE_ERROR) { snprintf(message,FLEN_ERRMSG, "Error while closing HDU number %d (ffchdu).", (fptr->Fptr)->curhdu); ffpmsg(message); } return(*status); } /*--------------------------------------------------------------------------*/ int ffuptf(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ /* Update the value of the TFORM keywords for the variable length array columns to make sure they all have the form 1Px(len) or Px(len) where 'len' is the maximum length of the vector in the table (e.g., '1PE(400)') */ { int ii, lenform=0; long tflds; LONGLONG length, addr, maxlen, naxis2, jj; char comment[FLEN_COMMENT], keyname[FLEN_KEYWORD]; char tform[FLEN_VALUE], newform[FLEN_VALUE], lenval[40]; char card[FLEN_CARD]; char message[FLEN_ERRMSG]; char *tmp; ffmaky(fptr, 2, status); /* reset to beginning of header */ ffgkyjj(fptr, "NAXIS2", &naxis2, comment, status); ffgkyj(fptr, "TFIELDS", &tflds, comment, status); for (ii = 1; ii <= tflds; ii++) /* loop over all the columns */ { ffkeyn("TFORM", ii, keyname, status); /* construct name */ if (ffgkys(fptr, keyname, tform, comment, status) > 0) { snprintf(message,FLEN_ERRMSG, "Error while updating variable length vector TFORMn values (ffuptf)."); ffpmsg(message); return(*status); } /* is this a variable array length column ? */ if (tform[0] == 'P' || tform[1] == 'P' || tform[0] == 'Q' || tform[1] == 'Q') { /* get the max length */ maxlen = 0; for (jj=1; jj <= naxis2; jj++) { ffgdesll(fptr, ii, jj, &length, &addr, status); if (length > maxlen) maxlen = length; } /* construct the new keyword value */ strcpy(newform, "'"); tmp = strchr(tform, '('); /* truncate old length, if present */ if (tmp) *tmp = 0; lenform = strlen(tform); /* print as double, because the string-to-64-bit */ /* conversion is platform dependent (%lld, %ld, %I64d) */ snprintf(lenval,40, "(%.0f)", (double) maxlen); if (lenform+strlen(lenval)+2 > FLEN_VALUE-1) { ffpmsg("Error assembling TFORMn string (ffuptf)."); return(*status = BAD_TFORM); } strcat(newform, tform); strcat(newform,lenval); while(strlen(newform) < 9) strcat(newform," "); /* append spaces 'till length = 8 */ strcat(newform,"'" ); /* append closing parenthesis */ /* would be simpler to just call ffmkyj here, but this */ /* would force linking in all the modkey & putkey routines */ ffmkky(keyname, newform, comment, card, status); /* make new card */ ffmkey(fptr, card, status); /* replace last read keyword */ } } return(*status); } /*--------------------------------------------------------------------------*/ int ffrdef(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ /* ReDEFine the structure of a data unit. This routine re-reads the CHDU header keywords to determine the structure and length of the current data unit. This redefines the start of the next HDU. */ { int dummy, tstatus = 0; LONGLONG naxis2; LONGLONG pcount; char card[FLEN_CARD], comm[FLEN_COMMENT], valstring[FLEN_VALUE]; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) { ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); } else if ((fptr->Fptr)->writemode == 1) /* write access to the file? */ { /* don't need to check NAXIS2 and PCOUNT if data hasn't been written */ if ((fptr->Fptr)->datastart != DATA_UNDEFINED) { /* update NAXIS2 keyword if more rows were written to the table */ /* and if the user has not explicitly reset the NAXIS2 value */ if ((fptr->Fptr)->hdutype != IMAGE_HDU) { ffmaky(fptr, 2, status); if (ffgkyjj(fptr, "NAXIS2", &naxis2, comm, &tstatus) > 0) { /* Couldn't read NAXIS2 (odd!); in certain circumstances */ /* this may be normal, so ignore the error. */ naxis2 = (fptr->Fptr)->numrows; } if ((fptr->Fptr)->numrows > naxis2 && (fptr->Fptr)->origrows == naxis2) /* if origrows is not equal to naxis2, then the user must */ /* have manually modified the NAXIS2 keyword value, and */ /* we will assume that the current value is correct. */ { /* would be simpler to just call ffmkyj here, but this */ /* would force linking in all the modkey & putkey routines */ /* print as double because the 64-bit int conversion */ /* is platform dependent (%lld, %ld, %I64 ) */ snprintf(valstring,FLEN_VALUE, "%.0f", (double) ((fptr->Fptr)->numrows)); ffmkky("NAXIS2", valstring, comm, card, status); ffmkey(fptr, card, status); } } /* if data has been written to variable length columns in a */ /* binary table, then we may need to update the PCOUNT value */ if ((fptr->Fptr)->heapsize > 0) { ffmaky(fptr, 2, status); ffgkyjj(fptr, "PCOUNT", &pcount, comm, status); if ((fptr->Fptr)->heapsize != pcount) { ffmkyj(fptr, "PCOUNT", (fptr->Fptr)->heapsize, comm, status); } } } if (ffwend(fptr, status) <= 0) /* rewrite END keyword and fill */ { ffrhdu(fptr, &dummy, status); /* re-scan the header keywords */ } } return(*status); } /*--------------------------------------------------------------------------*/ int ffhdef(fitsfile *fptr, /* I - FITS file pointer */ int morekeys, /* I - reserve space for this many keywords */ int *status) /* IO - error status */ /* based on the number of keywords which have already been written, plus the number of keywords to reserve space for, we then can define where the data unit should start (it must start at the beginning of a 2880-byte logical block). This routine will only have any effect if the starting location of the data unit following the header is not already defined. In any case, it is always possible to add more keywords to the header even if the data has already been written. It is just more efficient to reserve the space in advance. */ { LONGLONG delta; if (*status > 0 || morekeys < 1) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) { ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); } else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) { ffrdef(fptr, status); /* ffrdef defines the offset to datastart and the start of */ /* the next HDU based on the number of existing keywords. */ /* We need to increment both of these values based on */ /* the number of new keywords to be added. */ delta = (((fptr->Fptr)->headend + (morekeys * 80)) / 2880 + 1) * 2880 - (fptr->Fptr)->datastart; (fptr->Fptr)->datastart += delta; (fptr->Fptr)->headstart[ (fptr->Fptr)->curhdu + 1] += delta; } return(*status); } /*--------------------------------------------------------------------------*/ int ffwend(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ /* write the END card and following fill (space chars) in the current header */ { int ii, tstatus; LONGLONG endpos; long nspace; char blankkey[FLEN_CARD], endkey[FLEN_CARD], keyrec[FLEN_CARD] = ""; if (*status > 0) return(*status); endpos = (fptr->Fptr)->headend; /* we assume that the HDUposition == curhdu in all cases */ /* calc the data starting position if not currently defined */ if ((fptr->Fptr)->datastart == DATA_UNDEFINED) (fptr->Fptr)->datastart = ( endpos / 2880 + 1 ) * 2880; /* calculate the number of blank keyword slots in the header */ nspace = (long) (( (fptr->Fptr)->datastart - endpos ) / 80); /* construct a blank and END keyword (80 spaces ) */ strcpy(blankkey, " "); strcat(blankkey, " "); strcpy(endkey, "END "); strcat(endkey, " "); /* check if header is already correctly terminated with END and fill */ tstatus=0; ffmbyt(fptr, endpos, REPORT_EOF, &tstatus); /* move to header end */ for (ii=0; ii < nspace; ii++) { ffgbyt(fptr, 80, keyrec, &tstatus); /* get next keyword */ if (tstatus) break; if (strncmp(keyrec, blankkey, 80) && strncmp(keyrec, endkey, 80)) break; } if (ii == nspace && !tstatus) { /* check if the END keyword exists at the correct position */ endpos=maxvalue( endpos, ( (fptr->Fptr)->datastart - 2880 ) ); ffmbyt(fptr, endpos, REPORT_EOF, &tstatus); /* move to END position */ ffgbyt(fptr, 80, keyrec, &tstatus); /* read the END keyword */ if ( !strncmp(keyrec, endkey, 80) && !tstatus) { /* store this position, for later reference */ (fptr->Fptr)->ENDpos = endpos; return(*status); /* END card was already correct */ } } /* header was not correctly terminated, so write the END and blank fill */ endpos = (fptr->Fptr)->headend; ffmbyt(fptr, endpos, IGNORE_EOF, status); /* move to header end */ for (ii=0; ii < nspace; ii++) ffpbyt(fptr, 80, blankkey, status); /* write the blank keywords */ /* The END keyword must either be placed immediately after the last keyword that was written (as indicated by the headend value), or must be in the first 80 bytes of the 2880-byte FITS record immediately preceeding the data unit, whichever is further in the file. The latter will occur if space has been reserved for more header keywords which have not yet been written. */ endpos=maxvalue( endpos, ( (fptr->Fptr)->datastart - 2880 ) ); ffmbyt(fptr, endpos, REPORT_EOF, status); /* move to END position */ ffpbyt(fptr, 80, endkey, status); /* write the END keyword to header */ /* store this position, for later reference */ (fptr->Fptr)->ENDpos = endpos; if (*status > 0) ffpmsg("Error while writing END card (ffwend)."); return(*status); } /*--------------------------------------------------------------------------*/ int ffpdfl(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ /* Write the Data Unit Fill values if they are not already correct. The fill values are used to fill out the last 2880 byte block of the HDU. Fill the data unit with zeros or blanks depending on the type of HDU from the end of the data to the end of the current FITS 2880 byte block */ { char chfill, fill[2880]; LONGLONG fillstart; int nfill, tstatus, ii; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) return(*status); /* fill has already been correctly written */ if ((fptr->Fptr)->heapstart == 0) return(*status); /* null data unit, so there is no fill */ fillstart = (fptr->Fptr)->datastart + (fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize; nfill = (long) ((fillstart + 2879) / 2880 * 2880 - fillstart); if ((fptr->Fptr)->hdutype == ASCII_TBL) chfill = 32; /* ASCII tables are filled with spaces */ else chfill = 0; /* all other extensions are filled with zeros */ tstatus = 0; if (!nfill) /* no fill bytes; just check that entire table exists */ { fillstart--; nfill = 1; ffmbyt(fptr, fillstart, REPORT_EOF, &tstatus); /* move to last byte */ ffgbyt(fptr, nfill, fill, &tstatus); /* get the last byte */ if (tstatus == 0) return(*status); /* no EOF error, so everything is OK */ } else { ffmbyt(fptr, fillstart, REPORT_EOF, &tstatus); /* move to fill area */ ffgbyt(fptr, nfill, fill, &tstatus); /* get the fill bytes */ if (tstatus == 0) { for (ii = 0; ii < nfill; ii++) { if (fill[ii] != chfill) break; } if (ii == nfill) return(*status); /* all the fill values were correct */ } } /* fill values are incorrect or have not been written, so write them */ memset(fill, chfill, nfill); /* fill the buffer with the fill value */ ffmbyt(fptr, fillstart, IGNORE_EOF, status); /* move to fill area */ ffpbyt(fptr, nfill, fill, status); /* write the fill bytes */ if (*status > 0) ffpmsg("Error writing Data Unit fill bytes (ffpdfl)."); return(*status); } /********************************************************************** ffchfl : Check Header Fill values Check that the header unit is correctly filled with blanks from the END card to the end of the current FITS 2880-byte block Function parameters: fptr Fits file pointer status output error status Translated ftchfl into C by Peter Wilson, Oct. 1997 **********************************************************************/ int ffchfl( fitsfile *fptr, int *status) { int nblank,i,gotend; LONGLONG endpos; char rec[FLEN_CARD]; char *blanks=" "; /* 80 spaces */ if( *status > 0 ) return (*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); /* calculate the number of blank keyword slots in the header */ endpos=(fptr->Fptr)->headend; nblank=(long) (((fptr->Fptr)->datastart-endpos)/80); /* move the i/o pointer to the end of the header keywords */ ffmbyt(fptr,endpos,TRUE,status); /* find the END card (there may be blank keywords perceeding it) */ gotend=FALSE; for(i=0;i 0 ) { rec[FLEN_CARD - 1] = '\0'; /* make sure string is null terminated */ ffpmsg(rec); return( *status ); } } return( *status ); } /********************************************************************** ffcdfl : Check Data Unit Fill values Check that the data unit is correctly filled with zeros or blanks from the end of the data to the end of the current FITS 2880 byte block Function parameters: fptr Fits file pointer status output error status Translated ftcdfl into C by Peter Wilson, Oct. 1997 **********************************************************************/ int ffcdfl( fitsfile *fptr, int *status) { int nfill,i; LONGLONG filpos; char chfill,chbuff[2880]; if( *status > 0 ) return( *status ); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); /* check if the data unit is null */ if( (fptr->Fptr)->heapstart==0 ) return( *status ); /* calculate starting position of the fill bytes, if any */ filpos = (fptr->Fptr)->datastart + (fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize; /* calculate the number of fill bytes */ nfill = (long) ((filpos + 2879) / 2880 * 2880 - filpos); if( nfill == 0 ) return( *status ); /* move to the beginning of the fill bytes */ ffmbyt(fptr, filpos, FALSE, status); if( ffgbyt(fptr, nfill, chbuff, status) > 0) { ffpmsg("Error reading data unit fill bytes (ffcdfl)."); return( *status ); } if( (fptr->Fptr)->hdutype==ASCII_TBL ) chfill = 32; /* ASCII tables are filled with spaces */ else chfill = 0; /* all other extensions are filled with zeros */ /* check for all zeros or blanks */ for(i=0;iFptr)->hdutype==ASCII_TBL ) ffpmsg("Warning: remaining bytes following ASCII table data are not filled with blanks."); else ffpmsg("Warning: remaining bytes following data are not filled with zeros."); return( *status ); } } return( *status ); } /*--------------------------------------------------------------------------*/ int ffcrhd(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ /* CReate Header Data unit: Create, initialize, and move the i/o pointer to a new extension appended to the end of the FITS file. */ { int tstatus = 0; LONGLONG bytepos, *ptr; if (*status > 0) return(*status); if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); /* If the current header is empty, we don't have to do anything */ if ((fptr->Fptr)->headend == (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] ) return(*status); while (ffmrhd(fptr, 1, 0, &tstatus) == 0); /* move to end of file */ if ((fptr->Fptr)->maxhdu == (fptr->Fptr)->MAXHDU) { /* allocate more space for the headstart array */ ptr = (LONGLONG*) realloc( (fptr->Fptr)->headstart, ((fptr->Fptr)->MAXHDU + 1001) * sizeof(LONGLONG) ); if (ptr == NULL) return (*status = MEMORY_ALLOCATION); else { (fptr->Fptr)->MAXHDU = (fptr->Fptr)->MAXHDU + 1000; (fptr->Fptr)->headstart = ptr; } } if (ffchdu(fptr, status) <= 0) /* close the current HDU */ { bytepos = (fptr->Fptr)->headstart[(fptr->Fptr)->maxhdu + 1]; /* last */ ffmbyt(fptr, bytepos, IGNORE_EOF, status); /* move file ptr to it */ (fptr->Fptr)->maxhdu++; /* increment the known number of HDUs */ (fptr->Fptr)->curhdu = (fptr->Fptr)->maxhdu; /* set current HDU loc */ fptr->HDUposition = (fptr->Fptr)->maxhdu; /* set current HDU loc */ (fptr->Fptr)->nextkey = bytepos; /* next keyword = start of header */ (fptr->Fptr)->headend = bytepos; /* end of header */ (fptr->Fptr)->datastart = DATA_UNDEFINED; /* start data unit undefined */ /* any other needed resets */ /* reset the dithering offset that may have been calculated for the */ /* previous HDU back to the requested default value */ (fptr->Fptr)->dither_seed = (fptr->Fptr)->request_dither_seed; } return(*status); } /*--------------------------------------------------------------------------*/ int ffdblk(fitsfile *fptr, /* I - FITS file pointer */ long nblocks, /* I - number of 2880-byte blocks to delete */ int *status) /* IO - error status */ /* Delete the specified number of 2880-byte blocks from the end of the CHDU by shifting all following extensions up this number of blocks. */ { char buffer[2880]; int tstatus, ii; LONGLONG readpos, writepos; if (*status > 0 || nblocks <= 0) return(*status); tstatus = 0; /* pointers to the read and write positions */ readpos = (fptr->Fptr)->datastart + (fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize; readpos = ((readpos + 2879) / 2880) * 2880; /* start of block */ /* the following formula is wrong because the current data unit may have been extended without updating the headstart value of the following HDU. readpos = (fptr->Fptr)->headstart[((fptr->Fptr)->curhdu) + 1]; */ writepos = readpos - ((LONGLONG)nblocks * 2880); while ( !ffmbyt(fptr, readpos, REPORT_EOF, &tstatus) && !ffgbyt(fptr, 2880L, buffer, &tstatus) ) { ffmbyt(fptr, writepos, REPORT_EOF, status); ffpbyt(fptr, 2880L, buffer, status); if (*status > 0) { ffpmsg("Error deleting FITS blocks (ffdblk)"); return(*status); } readpos += 2880; /* increment to next block to transfer */ writepos += 2880; } /* now fill the last nblock blocks with zeros */ memset(buffer, 0, 2880); ffmbyt(fptr, writepos, REPORT_EOF, status); for (ii = 0; ii < nblocks; ii++) ffpbyt(fptr, 2880L, buffer, status); /* move back before the deleted blocks, since they may be deleted */ /* and we do not want to delete the current active buffer */ ffmbyt(fptr, writepos - 1, REPORT_EOF, status); /* truncate the file to the new size, if supported on this device */ fftrun(fptr, writepos, status); /* recalculate the starting location of all subsequent HDUs */ for (ii = (fptr->Fptr)->curhdu; ii <= (fptr->Fptr)->maxhdu; ii++) (fptr->Fptr)->headstart[ii + 1] -= ((LONGLONG)nblocks * 2880); return(*status); } /*--------------------------------------------------------------------------*/ int ffghdt(fitsfile *fptr, /* I - FITS file pointer */ int *exttype, /* O - type of extension, 0, 1, or 2 */ /* for IMAGE_HDU, ASCII_TBL, or BINARY_TBL */ int *status) /* IO - error status */ /* Return the type of the CHDU. This returns the 'logical' type of the HDU, not necessarily the physical type, so in the case of a compressed image stored in a binary table, this will return the type as an Image, not a binary table. */ { if (*status > 0) return(*status); if (fptr->HDUposition == 0 && (fptr->Fptr)->headend == 0) { /* empty primary array is alway an IMAGE_HDU */ *exttype = IMAGE_HDU; } else { /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) { ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); } else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) { /* rescan header if data structure is undefined */ if ( ffrdef(fptr, status) > 0) return(*status); } *exttype = (fptr->Fptr)->hdutype; /* return the type of HDU */ /* check if this is a compressed image */ if ((fptr->Fptr)->compressimg) *exttype = IMAGE_HDU; } return(*status); } /*--------------------------------------------------------------------------*/ int fits_is_reentrant(void) /* Was CFITSIO compiled with the -D_REENTRANT flag? 1 = yes, 0 = no. Note that specifying the -D_REENTRANT flag is required, but may not be sufficient, to ensure that CFITSIO can be safely used in a multi-threaded environoment. */ { #ifdef _REENTRANT return(1); #else return(0); #endif } /*--------------------------------------------------------------------------*/ int fits_is_compressed_image(fitsfile *fptr, /* I - FITS file pointer */ int *status) /* IO - error status */ /* Returns TRUE if the CHDU is a compressed image, else returns zero. */ { if (*status > 0) return(0); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) { ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); } else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) { /* rescan header if data structure is undefined */ if ( ffrdef(fptr, status) > 0) return(*status); } /* check if this is a compressed image */ if ((fptr->Fptr)->compressimg) return(1); return(0); } /*--------------------------------------------------------------------------*/ int ffgipr(fitsfile *infptr, /* I - FITS file pointer */ int maxaxis, /* I - max number of axes to return */ int *bitpix, /* O - image data type */ int *naxis, /* O - image dimension (NAXIS value) */ long *naxes, /* O - size of image dimensions */ int *status) /* IO - error status */ /* get the datatype and size of the input image */ { if (*status > 0) return(*status); /* don't return the parameter if a null pointer was given */ if (bitpix) fits_get_img_type(infptr, bitpix, status); /* get BITPIX value */ if (naxis) fits_get_img_dim(infptr, naxis, status); /* get NAXIS value */ if (naxes) fits_get_img_size(infptr, maxaxis, naxes, status); /* get NAXISn values */ return(*status); } /*--------------------------------------------------------------------------*/ int ffgiprll(fitsfile *infptr, /* I - FITS file pointer */ int maxaxis, /* I - max number of axes to return */ int *bitpix, /* O - image data type */ int *naxis, /* O - image dimension (NAXIS value) */ LONGLONG *naxes, /* O - size of image dimensions */ int *status) /* IO - error status */ /* get the datatype and size of the input image */ { if (*status > 0) return(*status); /* don't return the parameter if a null pointer was given */ if (bitpix) fits_get_img_type(infptr, bitpix, status); /* get BITPIX value */ if (naxis) fits_get_img_dim(infptr, naxis, status); /* get NAXIS value */ if (naxes) fits_get_img_sizell(infptr, maxaxis, naxes, status); /* get NAXISn values */ return(*status); } /*--------------------------------------------------------------------------*/ int ffgidt( fitsfile *fptr, /* I - FITS file pointer */ int *imgtype, /* O - image data type */ int *status) /* IO - error status */ /* Get the datatype of the image (= BITPIX keyword for normal image, or ZBITPIX for a compressed image) */ { if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); /* reset to beginning of header */ ffmaky(fptr, 1, status); /* simply move to beginning of header */ if ((fptr->Fptr)->hdutype == IMAGE_HDU) { ffgky(fptr, TINT, "BITPIX", imgtype, NULL, status); } else if ((fptr->Fptr)->compressimg) { /* this is a binary table containing a compressed image */ ffgky(fptr, TINT, "ZBITPIX", imgtype, NULL, status); } else { *status = NOT_IMAGE; } return(*status); } /*--------------------------------------------------------------------------*/ int ffgiet( fitsfile *fptr, /* I - FITS file pointer */ int *imgtype, /* O - image data type */ int *status) /* IO - error status */ /* Get the effective datatype of the image (= BITPIX keyword for normal image, or ZBITPIX for a compressed image) */ { int tstatus; long lngscale, lngzero = 0; double bscale, bzero, min_val, max_val; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); /* reset to beginning of header */ ffmaky(fptr, 2, status); /* simply move to beginning of header */ if ((fptr->Fptr)->hdutype == IMAGE_HDU) { ffgky(fptr, TINT, "BITPIX", imgtype, NULL, status); } else if ((fptr->Fptr)->compressimg) { /* this is a binary table containing a compressed image */ ffgky(fptr, TINT, "ZBITPIX", imgtype, NULL, status); } else { *status = NOT_IMAGE; return(*status); } /* check if the BSCALE and BZERO keywords are defined, which might change the effective datatype of the image */ tstatus = 0; ffgky(fptr, TDOUBLE, "BSCALE", &bscale, NULL, &tstatus); if (tstatus) bscale = 1.0; tstatus = 0; ffgky(fptr, TDOUBLE, "BZERO", &bzero, NULL, &tstatus); if (tstatus) bzero = 0.0; if (bscale == 1.0 && bzero == 0.0) /* no scaling */ return(*status); switch (*imgtype) { case BYTE_IMG: /* 8-bit image */ min_val = 0.; max_val = 255.0; break; case SHORT_IMG: min_val = -32768.0; max_val = 32767.0; break; case LONG_IMG: min_val = -2147483648.0; max_val = 2147483647.0; break; default: /* don't have to deal with other data types */ return(*status); } if (bscale >= 0.) { min_val = bzero + bscale * min_val; max_val = bzero + bscale * max_val; } else { max_val = bzero + bscale * min_val; min_val = bzero + bscale * max_val; } if (bzero < 2147483648.) /* don't exceed range of 32-bit integer */ lngzero = (long) bzero; lngscale = (long) bscale; if ((bzero != 2147483648.) && /* special value that exceeds integer range */ (lngzero != bzero || lngscale != bscale)) { /* not integers? */ /* floating point scaled values; just decide on required precision */ if (*imgtype == BYTE_IMG || *imgtype == SHORT_IMG) *imgtype = FLOAT_IMG; else *imgtype = DOUBLE_IMG; /* In all the remaining cases, BSCALE and BZERO are integers, and not equal to 1 and 0, respectively. */ } else if ((min_val == -128.) && (max_val == 127.)) { *imgtype = SBYTE_IMG; } else if ((min_val >= -32768.0) && (max_val <= 32767.0)) { *imgtype = SHORT_IMG; } else if ((min_val >= 0.0) && (max_val <= 65535.0)) { *imgtype = USHORT_IMG; } else if ((min_val >= -2147483648.0) && (max_val <= 2147483647.0)) { *imgtype = LONG_IMG; } else if ((min_val >= 0.0) && (max_val < 4294967296.0)) { *imgtype = ULONG_IMG; } else { /* exceeds the range of a 32-bit integer */ *imgtype = DOUBLE_IMG; } return(*status); } /*--------------------------------------------------------------------------*/ int ffgidm( fitsfile *fptr, /* I - FITS file pointer */ int *naxis , /* O - image dimension (NAXIS value) */ int *status) /* IO - error status */ /* Get the dimension of the image (= NAXIS keyword for normal image, or ZNAXIS for a compressed image) These values are cached for faster access. */ { if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) { *naxis = (fptr->Fptr)->imgdim; } else if ((fptr->Fptr)->compressimg) { *naxis = (fptr->Fptr)->zndim; } else { *status = NOT_IMAGE; } return(*status); } /*--------------------------------------------------------------------------*/ int ffgisz( fitsfile *fptr, /* I - FITS file pointer */ int nlen, /* I - number of axes to return */ long *naxes, /* O - size of image dimensions */ int *status) /* IO - error status */ /* Get the size of the image dimensions (= NAXISn keywords for normal image, or ZNAXISn for a compressed image) These values are cached for faster access. */ { int ii, naxis; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) { naxis = minvalue((fptr->Fptr)->imgdim, nlen); for (ii = 0; ii < naxis; ii++) { naxes[ii] = (long) (fptr->Fptr)->imgnaxis[ii]; } } else if ((fptr->Fptr)->compressimg) { naxis = minvalue( (fptr->Fptr)->zndim, nlen); for (ii = 0; ii < naxis; ii++) { naxes[ii] = (long) (fptr->Fptr)->znaxis[ii]; } } else { *status = NOT_IMAGE; } return(*status); } /*--------------------------------------------------------------------------*/ int ffgiszll( fitsfile *fptr, /* I - FITS file pointer */ int nlen, /* I - number of axes to return */ LONGLONG *naxes, /* O - size of image dimensions */ int *status) /* IO - error status */ /* Get the size of the image dimensions (= NAXISn keywords for normal image, or ZNAXISn for a compressed image) */ { int ii, naxis; if (*status > 0) return(*status); /* reset position to the correct HDU if necessary */ if (fptr->HDUposition != (fptr->Fptr)->curhdu) ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status); else if ((fptr->Fptr)->datastart == DATA_UNDEFINED) if ( ffrdef(fptr, status) > 0) /* rescan header */ return(*status); if ((fptr->Fptr)->hdutype == IMAGE_HDU) { naxis = minvalue((fptr->Fptr)->imgdim, nlen); for (ii = 0; ii < naxis; ii++) { naxes[ii] = (fptr->Fptr)->imgnaxis[ii]; } } else if ((fptr->Fptr)->compressimg) { naxis = minvalue( (fptr->Fptr)->zndim, nlen); for (ii = 0; ii < naxis; ii++) { naxes[ii] = (fptr->Fptr)->znaxis[ii]; } } else { *status = NOT_IMAGE; } return(*status); }/*--------------------------------------------------------------------------*/ int ffmahd(fitsfile *fptr, /* I - FITS file pointer */ int hdunum, /* I - number of the HDU to move to */ int *exttype, /* O - type of extension, 0, 1, or 2 */ int *status) /* IO - error status */ /* Move to Absolute Header Data unit. Move to the specified HDU and read the header to initialize the table structure. Note that extnum is one based, so the primary array is extnum = 1. */ { int moveto, tstatus; char message[FLEN_ERRMSG]; LONGLONG *ptr; if (*status > 0) return(*status); else if (hdunum < 1 ) return(*status = BAD_HDU_NUM); else if (hdunum >= (fptr->Fptr)->MAXHDU ) { /* allocate more space for the headstart array */ ptr = (LONGLONG*) realloc( (fptr->Fptr)->headstart, (hdunum + 1001) * sizeof(LONGLONG) ); if (ptr == NULL) return (*status = MEMORY_ALLOCATION); else { (fptr->Fptr)->MAXHDU = hdunum + 1000; (fptr->Fptr)->headstart = ptr; } } /* set logical HDU position to the actual position, in case they differ */ fptr->HDUposition = (fptr->Fptr)->curhdu; while( ((fptr->Fptr)->curhdu) + 1 != hdunum) /* at the correct HDU? */ { /* move directly to the extension if we know that it exists, otherwise move to the highest known extension. */ moveto = minvalue(hdunum - 1, ((fptr->Fptr)->maxhdu) + 1); /* test if HDU exists */ if ((fptr->Fptr)->headstart[moveto] < (fptr->Fptr)->logfilesize ) { if (ffchdu(fptr, status) <= 0) /* close out the current HDU */ { if (ffgext(fptr, moveto, exttype, status) > 0) { /* failed to get the requested extension */ tstatus = 0; ffrhdu(fptr, exttype, &tstatus); /* restore the CHDU */ } } } else *status = END_OF_FILE; if (*status > 0) { if (*status != END_OF_FILE) { /* don't clutter up the message stack in the common case of */ /* simply hitting the end of file (often an expected error) */ snprintf(message,FLEN_ERRMSG, "Failed to move to HDU number %d (ffmahd).", hdunum); ffpmsg(message); } return(*status); } } /* return the type of HDU; tile compressed images which are stored */ /* in a binary table will return exttype = IMAGE_HDU, not BINARY_TBL */ if (exttype != NULL) ffghdt(fptr, exttype, status); return(*status); } /*--------------------------------------------------------------------------*/ int ffmrhd(fitsfile *fptr, /* I - FITS file pointer */ int hdumov, /* I - rel. no. of HDUs to move by (+ or -) */ int *exttype, /* O - type of extension, 0, 1, or 2 */ int *status) /* IO - error status */ /* Move a Relative number of Header Data units. Offset to the specified extension and read the header to initialize the HDU structure. */ { int extnum; if (*status > 0) return(*status); extnum = fptr->HDUposition + 1 + hdumov; /* the absolute HDU number */ ffmahd(fptr, extnum, exttype, status); /* move to the HDU */ return(*status); } /*--------------------------------------------------------------------------*/ int ffmnhd(fitsfile *fptr, /* I - FITS file pointer */ int exttype, /* I - desired extension type */ char *hduname, /* I - desired EXTNAME value for the HDU */ int hduver, /* I - desired EXTVERS value for the HDU */ int *status) /* IO - error status */ /* Move to the next HDU with a given extension type (IMAGE_HDU, ASCII_TBL, BINARY_TBL, or ANY_HDU), extension name (EXTNAME or HDUNAME keyword), and EXTVERS keyword values. If hduvers = 0, then move to the first HDU with the given type and name regardless of EXTVERS value. If no matching HDU is found in the file, then the current open HDU will remain unchanged. */ { char extname[FLEN_VALUE]; int ii, hdutype, alttype, extnum, tstatus, match, exact; int slen, putback = 0, chopped = 0; long extver; if (*status > 0) return(*status); extnum = fptr->HDUposition + 1; /* save the current HDU number */ /* This is a kludge to deal with a special case where the user specified a hduname that ended with a # character, which CFITSIO previously interpreted as a flag to mean "don't copy any other HDUs in the file into the virtual file in memory. If the remaining hduname does not end with a # character (meaning that the user originally entered a hduname ending in 2 # characters) then there is the possibility that the # character should be treated literally, if the actual EXTNAME also ends with a #. Setting putback = 1 means that we need to test for this case later on. */ if ((fptr->Fptr)->only_one) { /* if true, name orignally ended with a # */ slen = strlen(hduname); if (hduname[slen - 1] != '#') /* This will fail if real EXTNAME value */ putback = 1; /* ends with 2 # characters. */ } for (ii=1; 1; ii++) /* loop over all HDUs until EOF */ { tstatus = 0; if (ffmahd(fptr, ii, &hdutype, &tstatus)) /* move to next HDU */ { ffmahd(fptr, extnum, 0, status); /* restore original file position */ return(*status = BAD_HDU_NUM); /* couldn't find desired HDU */ } alttype = -1; if (fits_is_compressed_image(fptr, status)) alttype = BINARY_TBL; /* Does this HDU have a matching type? */ if (exttype == ANY_HDU || hdutype == exttype || hdutype == alttype) { ffmaky(fptr, 2, status); /* reset to the 2nd keyword in the header */ if (ffgkys(fptr, "EXTNAME", extname, 0, &tstatus) <= 0) /* get keyword */ { if (putback) { /* more of the kludge */ /* test if the EXTNAME value ends with a #; if so, chop it */ /* off before comparing the strings */ chopped = 0; slen = strlen(extname); if (extname[slen - 1] == '#') { extname[slen - 1] = '\0'; chopped = 1; } } /* see if the strings are an exact match */ ffcmps(extname, hduname, CASEINSEN, &match, &exact); } /* if EXTNAME keyword doesn't exist, or it does not match, then try HDUNAME */ if (tstatus || !exact) { tstatus = 0; if (ffgkys(fptr, "HDUNAME", extname, 0, &tstatus) <= 0) { if (putback) { /* more of the kludge */ chopped = 0; slen = strlen(extname); if (extname[slen - 1] == '#') { extname[slen - 1] = '\0'; /* chop off the # */ chopped = 1; } } /* see if the strings are an exact match */ ffcmps(extname, hduname, CASEINSEN, &match, &exact); } } if (!tstatus && exact) /* found a matching name */ { if (hduver) /* need to check if version numbers match? */ { if (ffgkyj(fptr, "EXTVER", &extver, 0, &tstatus) > 0) extver = 1; /* assume default EXTVER value */ if ( (int) extver == hduver) { if (chopped) { /* The # was literally part of the name, not a flag */ (fptr->Fptr)->only_one = 0; } return(*status); /* found matching name and vers */ } } else { if (chopped) { /* The # was literally part of the name, not a flag */ (fptr->Fptr)->only_one = 0; } return(*status); /* found matching name */ } } /* end of !tstatus && exact */ } /* end of matching HDU type */ } /* end of loop over HDUs */ } /*--------------------------------------------------------------------------*/ int ffthdu(fitsfile *fptr, /* I - FITS file pointer */ int *nhdu, /* O - number of HDUs in the file */ int *status) /* IO - error status */ /* Return the number of HDUs that currently exist in the file. */ { int ii, extnum, tstatus; if (*status > 0) return(*status); extnum = fptr->HDUposition + 1; /* save the current HDU number */ *nhdu = extnum - 1; /* if the CHDU is empty or not completely defined, just return */ if ((fptr->Fptr)->datastart == DATA_UNDEFINED) return(*status); tstatus = 0; /* loop until EOF */ for (ii=extnum; ffmahd(fptr, ii, 0, &tstatus) <= 0; ii++) { *nhdu = ii; } ffmahd(fptr, extnum, 0, status); /* restore orig file position */ return(*status); } /*--------------------------------------------------------------------------*/ int ffgext(fitsfile *fptr, /* I - FITS file pointer */ int hdunum, /* I - no. of HDU to move get (0 based) */ int *exttype, /* O - type of extension, 0, 1, or 2 */ int *status) /* IO - error status */ /* Get Extension. Move to the specified extension and initialize the HDU structure. */ { int xcurhdu, xmaxhdu; LONGLONG xheadend; if (*status > 0) return(*status); if (ffmbyt(fptr, (fptr->Fptr)->headstart[hdunum], REPORT_EOF, status) <= 0) { /* temporarily save current values, in case of error */ xcurhdu = (fptr->Fptr)->curhdu; xmaxhdu = (fptr->Fptr)->maxhdu; xheadend = (fptr->Fptr)->headend; /* set new parameter values */ (fptr->Fptr)->curhdu = hdunum; fptr->HDUposition = hdunum; (fptr->Fptr)->maxhdu = maxvalue((fptr->Fptr)->maxhdu, hdunum); (fptr->Fptr)->headend = (fptr->Fptr)->logfilesize; /* set max size */ if (ffrhdu(fptr, exttype, status) > 0) { /* failed to get the new HDU, so restore previous values */ (fptr->Fptr)->curhdu = xcurhdu; fptr->HDUposition = xcurhdu; (fptr->Fptr)->maxhdu = xmaxhdu; (fptr->Fptr)->headend = xheadend; } } return(*status); } /*--------------------------------------------------------------------------*/ int ffiblk(fitsfile *fptr, /* I - FITS file pointer */ long nblock, /* I - no. of blocks to insert */ int headdata, /* I - insert where? 0=header, 1=data */ /* -1=beginning of file */ int *status) /* IO - error status */ /* insert 2880-byte blocks at the end of the current header or data unit */ { int tstatus, savehdu, typhdu; LONGLONG insertpt, jpoint; long ii, nshift; char charfill; char buff1[2880], buff2[2880]; char *inbuff, *outbuff, *tmpbuff; char card[FLEN_CARD]; if (*status > 0 || nblock <= 0) return(*status); tstatus = *status; if (headdata == 0 || (fptr->Fptr)->hdutype == ASCII_TBL) charfill = 32; /* headers and ASCII tables have space (32) fill */ else charfill = 0; /* images and binary tables have zero fill */ if (headdata == 0) insertpt = (fptr->Fptr)->datastart; /* insert just before data, or */ else if (headdata == -1) { insertpt = 0; strcpy(card, "XTENSION= 'IMAGE ' / IMAGE extension"); } else /* at end of data, */ { insertpt = (fptr->Fptr)->datastart + (fptr->Fptr)->heapstart + (fptr->Fptr)->heapsize; insertpt = ((insertpt + 2879) / 2880) * 2880; /* start of block */ /* the following formula is wrong because the current data unit may have been extended without updating the headstart value of the following HDU. */ /* insertpt = (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu + 1]; */ } inbuff = buff1; /* set pointers to input and output buffers */ outbuff = buff2; memset(outbuff, charfill, 2880); /* initialize buffer with fill */ if (nblock == 1) /* insert one block */ { if (headdata == -1) ffmrec(fptr, 1, card, status); /* change SIMPLE -> XTENSION */ ffmbyt(fptr, insertpt, REPORT_EOF, status); /* move to 1st point */ ffgbyt(fptr, 2880, inbuff, status); /* read first block of bytes */ while (*status <= 0) { ffmbyt(fptr, insertpt, REPORT_EOF, status); /* insert point */ ffpbyt(fptr, 2880, outbuff, status); /* write the output buffer */ if (*status > 0) return(*status); tmpbuff = inbuff; /* swap input and output pointers */ inbuff = outbuff; outbuff = tmpbuff; insertpt += 2880; /* increment insert point by 1 block */ ffmbyt(fptr, insertpt, REPORT_EOF, status); /* move to next block */ ffgbyt(fptr, 2880, inbuff, status); /* read block of bytes */ } *status = tstatus; /* reset status value */ ffmbyt(fptr, insertpt, IGNORE_EOF, status); /* move back to insert pt */ ffpbyt(fptr, 2880, outbuff, status); /* write the final block */ } else /* inserting more than 1 block */ { savehdu = (fptr->Fptr)->curhdu; /* save the current HDU number */ tstatus = *status; while(*status <= 0) /* find the last HDU in file */ ffmrhd(fptr, 1, &typhdu, status); if (*status == END_OF_FILE) { *status = tstatus; } ffmahd(fptr, savehdu + 1, &typhdu, status); /* move back to CHDU */ if (headdata == -1) ffmrec(fptr, 1, card, status); /* NOW change SIMPLE -> XTENSION */ /* number of 2880-byte blocks that have to be shifted down */ nshift = (long) (((fptr->Fptr)->headstart[(fptr->Fptr)->maxhdu + 1] - insertpt) / 2880); /* position of last block in file to be shifted */ jpoint = (fptr->Fptr)->headstart[(fptr->Fptr)->maxhdu + 1] - 2880; /* move all the blocks starting at end of file working backwards */ for (ii = 0; ii < nshift; ii++) { /* move to the read start position */ if (ffmbyt(fptr, jpoint, REPORT_EOF, status) > 0) return(*status); ffgbyt(fptr, 2880, inbuff,status); /* read one record */ /* move forward to the write postion */ ffmbyt(fptr, jpoint + ((LONGLONG) nblock * 2880), IGNORE_EOF, status); ffpbyt(fptr, 2880, inbuff, status); /* write the record */ jpoint -= 2880; } /* move back to the write start postion (might be EOF) */ ffmbyt(fptr, insertpt, IGNORE_EOF, status); for (ii = 0; ii < nblock; ii++) /* insert correct fill value */ ffpbyt(fptr, 2880, outbuff, status); } if (headdata == 0) /* update data start address */ (fptr->Fptr)->datastart += ((LONGLONG) nblock * 2880); /* update following HDU addresses */ for (ii = (fptr->Fptr)->curhdu; ii <= (fptr->Fptr)->maxhdu; ii++) (fptr->Fptr)->headstart[ii + 1] += ((LONGLONG) nblock * 2880); return(*status); } /*--------------------------------------------------------------------------*/ int ffgkcl(char *tcard) /* Return the type classification of the input header record TYP_STRUC_KEY: SIMPLE, BITPIX, NAXIS, NAXISn, EXTEND, BLOCKED, GROUPS, PCOUNT, GCOUNT, END XTENSION, TFIELDS, TTYPEn, TBCOLn, TFORMn, THEAP, and the first 4 COMMENT keywords in the primary array that define the FITS format. TYP_CMPRS_KEY: The keywords used in the compressed image format ZIMAGE, ZCMPTYPE, ZNAMEn, ZVALn, ZTILEn, ZBITPIX, ZNAXISn, ZSCALE, ZZERO, ZBLANK, EXTNAME = 'COMPRESSED_IMAGE' ZSIMPLE, ZTENSION, ZEXTEND, ZBLOCKED, ZPCOUNT, ZGCOUNT ZQUANTIZ, ZDITHER0 TYP_SCAL_KEY: BSCALE, BZERO, TSCALn, TZEROn TYP_NULL_KEY: BLANK, TNULLn TYP_DIM_KEY: TDIMn TYP_RANG_KEY: TLMINn, TLMAXn, TDMINn, TDMAXn, DATAMIN, DATAMAX TYP_UNIT_KEY: BUNIT, TUNITn TYP_DISP_KEY: TDISPn TYP_HDUID_KEY: EXTNAME, EXTVER, EXTLEVEL, HDUNAME, HDUVER, HDULEVEL TYP_CKSUM_KEY CHECKSUM, DATASUM TYP_WCS_KEY: Primary array: WCAXES, CTYPEn, CUNITn, CRVALn, CRPIXn, CROTAn, CDELTn CDj_is, PVj_ms, LONPOLEs, LATPOLEs Pixel list: TCTYPn, TCTYns, TCUNIn, TCUNns, TCRVLn, TCRVns, TCRPXn, TCRPks, TCDn_k, TCn_ks, TPVn_m, TPn_ms, TCDLTn, TCROTn Bintable vector: jCTYPn, jCTYns, jCUNIn, jCUNns, jCRVLn, jCRVns, iCRPXn, iCRPns, jiCDn, jiCDns, jPVn_m, jPn_ms, jCDLTn, jCROTn TYP_REFSYS_KEY: EQUINOXs, EPOCH, MJD-OBSs, RADECSYS, RADESYSs TYP_COMM_KEY: COMMENT, HISTORY, (blank keyword) TYP_CONT_KEY: CONTINUE TYP_USER_KEY: all other keywords */ { char card[20], *card1, *card5; card[0] = '\0'; strncat(card, tcard, 8); /* copy the keyword name */ strcat(card, " "); /* append blanks to make at least 8 chars long */ ffupch(card); /* make sure it is in upper case */ card1 = card + 1; /* pointer to 2nd character */ card5 = card + 5; /* pointer to 6th character */ /* the strncmp function is slow, so try to be more efficient */ if (*card == 'Z') { if (FSTRNCMP (card1, "IMAGE ", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "CMPTYPE", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "NAME", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_CMPRS_KEY); } else if (FSTRNCMP (card1, "VAL", 3) == 0) { if (*(card + 4) >= '0' && *(card + 4) <= '9') return (TYP_CMPRS_KEY); } else if (FSTRNCMP (card1, "TILE", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_CMPRS_KEY); } else if (FSTRNCMP (card1, "BITPIX ", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "NAXIS", 5) == 0) { if ( ( *(card + 6) >= '0' && *(card + 6) <= '9' ) || (*(card + 6) == ' ') ) return (TYP_CMPRS_KEY); } else if (FSTRNCMP (card1, "SCALE ", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "ZERO ", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "BLANK ", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "SIMPLE ", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "TENSION", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "EXTEND ", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "BLOCKED", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "PCOUNT ", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "GCOUNT ", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "QUANTIZ", 7) == 0) return (TYP_CMPRS_KEY); else if (FSTRNCMP (card1, "DITHER0", 7) == 0) return (TYP_CMPRS_KEY); } else if (*card == ' ') { return (TYP_COMM_KEY); } else if (*card == 'B') { if (FSTRNCMP (card1, "ITPIX ", 7) == 0) return (TYP_STRUC_KEY); if (FSTRNCMP (card1, "LOCKED ", 7) == 0) return (TYP_STRUC_KEY); if (FSTRNCMP (card1, "LANK ", 7) == 0) return (TYP_NULL_KEY); if (FSTRNCMP (card1, "SCALE ", 7) == 0) return (TYP_SCAL_KEY); if (FSTRNCMP (card1, "ZERO ", 7) == 0) return (TYP_SCAL_KEY); if (FSTRNCMP (card1, "UNIT ", 7) == 0) return (TYP_UNIT_KEY); } else if (*card == 'C') { if (FSTRNCMP (card1, "OMMENT",6) == 0) { /* new comment string starting Oct 2001 */ if (FSTRNCMP (tcard, "COMMENT and Astrophysics', volume 376, page 3", 47) == 0) return (TYP_STRUC_KEY); /* original COMMENT strings from 1993 - 2001 */ if (FSTRNCMP (tcard, "COMMENT FITS (Flexible Image Transport System", 47) == 0) return (TYP_STRUC_KEY); if (FSTRNCMP (tcard, "COMMENT Astrophysics Supplement Series v44/p3", 47) == 0) return (TYP_STRUC_KEY); if (FSTRNCMP (tcard, "COMMENT Contact the NASA Science Office of St", 47) == 0) return (TYP_STRUC_KEY); if (FSTRNCMP (tcard, "COMMENT FITS Definition document #100 and oth", 47) == 0) return (TYP_STRUC_KEY); if (*(card + 7) == ' ') return (TYP_COMM_KEY); else return (TYP_USER_KEY); } if (FSTRNCMP (card1, "HECKSUM", 7) == 0) return (TYP_CKSUM_KEY); if (FSTRNCMP (card1, "ONTINUE", 7) == 0) return (TYP_CONT_KEY); if (FSTRNCMP (card1, "TYPE",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "UNIT",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "RVAL",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "RPIX",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "ROTA",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "RDER",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "SYER",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "DELT",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (*card1 == 'D') { if (*(card + 2) >= '0' && *(card + 2) <= '9') return (TYP_WCS_KEY); } } else if (*card == 'D') { if (FSTRNCMP (card1, "ATASUM ", 7) == 0) return (TYP_CKSUM_KEY); if (FSTRNCMP (card1, "ATAMIN ", 7) == 0) return (TYP_RANG_KEY); if (FSTRNCMP (card1, "ATAMAX ", 7) == 0) return (TYP_RANG_KEY); if (FSTRNCMP (card1, "ATE-OBS", 7) == 0) return (TYP_REFSYS_KEY); } else if (*card == 'E') { if (FSTRNCMP (card1, "XTEND ", 7) == 0) return (TYP_STRUC_KEY); if (FSTRNCMP (card1, "ND ", 7) == 0) return (TYP_STRUC_KEY); if (FSTRNCMP (card1, "XTNAME ", 7) == 0) { /* check for special compressed image value */ if (FSTRNCMP(tcard, "EXTNAME = 'COMPRESSED_IMAGE'", 28) == 0) return (TYP_CMPRS_KEY); else return (TYP_HDUID_KEY); } if (FSTRNCMP (card1, "XTVER ", 7) == 0) return (TYP_HDUID_KEY); if (FSTRNCMP (card1, "XTLEVEL", 7) == 0) return (TYP_HDUID_KEY); if (FSTRNCMP (card1, "QUINOX", 6) == 0) return (TYP_REFSYS_KEY); if (FSTRNCMP (card1, "QUI",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_REFSYS_KEY); } if (FSTRNCMP (card1, "POCH ", 7) == 0) return (TYP_REFSYS_KEY); } else if (*card == 'G') { if (FSTRNCMP (card1, "COUNT ", 7) == 0) return (TYP_STRUC_KEY); if (FSTRNCMP (card1, "ROUPS ", 7) == 0) return (TYP_STRUC_KEY); } else if (*card == 'H') { if (FSTRNCMP (card1, "DUNAME ", 7) == 0) return (TYP_HDUID_KEY); if (FSTRNCMP (card1, "DUVER ", 7) == 0) return (TYP_HDUID_KEY); if (FSTRNCMP (card1, "DULEVEL", 7) == 0) return (TYP_HDUID_KEY); if (FSTRNCMP (card1, "ISTORY",6) == 0) { if (*(card + 7) == ' ') return (TYP_COMM_KEY); else return (TYP_USER_KEY); } } else if (*card == 'L') { if (FSTRNCMP (card1, "ONPOLE",6) == 0) return (TYP_WCS_KEY); if (FSTRNCMP (card1, "ATPOLE",6) == 0) return (TYP_WCS_KEY); if (FSTRNCMP (card1, "ONP",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "ATP",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } } else if (*card == 'M') { if (FSTRNCMP (card1, "JD-OBS ", 7) == 0) return (TYP_REFSYS_KEY); if (FSTRNCMP (card1, "JDOB",4) == 0) { if (*(card+5) >= '0' && *(card+5) <= '9') return (TYP_REFSYS_KEY); } } else if (*card == 'N') { if (FSTRNCMP (card1, "AXIS", 4) == 0) { if ((*card5 >= '0' && *card5 <= '9') || (*card5 == ' ')) return (TYP_STRUC_KEY); } } else if (*card == 'P') { if (FSTRNCMP (card1, "COUNT ", 7) == 0) return (TYP_STRUC_KEY); if (*card1 == 'C') { if (*(card + 2) >= '0' && *(card + 2) <= '9') return (TYP_WCS_KEY); } else if (*card1 == 'V') { if (*(card + 2) >= '0' && *(card + 2) <= '9') return (TYP_WCS_KEY); } else if (*card1 == 'S') { if (*(card + 2) >= '0' && *(card + 2) <= '9') return (TYP_WCS_KEY); } } else if (*card == 'R') { if (FSTRNCMP (card1, "ADECSYS", 7) == 0) return (TYP_REFSYS_KEY); if (FSTRNCMP (card1, "ADESYS", 6) == 0) return (TYP_REFSYS_KEY); if (FSTRNCMP (card1, "ADE",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_REFSYS_KEY); } } else if (*card == 'S') { if (FSTRNCMP (card1, "IMPLE ", 7) == 0) return (TYP_STRUC_KEY); } else if (*card == 'T') { if (FSTRNCMP (card1, "TYPE", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_STRUC_KEY); } else if (FSTRNCMP (card1, "FORM", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_STRUC_KEY); } else if (FSTRNCMP (card1, "BCOL", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_STRUC_KEY); } else if (FSTRNCMP (card1, "FIELDS ", 7) == 0) return (TYP_STRUC_KEY); else if (FSTRNCMP (card1, "HEAP ", 7) == 0) return (TYP_STRUC_KEY); else if (FSTRNCMP (card1, "NULL", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_NULL_KEY); } else if (FSTRNCMP (card1, "DIM", 3) == 0) { if (*(card + 4) >= '0' && *(card + 4) <= '9') return (TYP_DIM_KEY); } else if (FSTRNCMP (card1, "UNIT", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_UNIT_KEY); } else if (FSTRNCMP (card1, "DISP", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_DISP_KEY); } else if (FSTRNCMP (card1, "SCAL", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_SCAL_KEY); } else if (FSTRNCMP (card1, "ZERO", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_SCAL_KEY); } else if (FSTRNCMP (card1, "LMIN", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_RANG_KEY); } else if (FSTRNCMP (card1, "LMAX", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_RANG_KEY); } else if (FSTRNCMP (card1, "DMIN", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_RANG_KEY); } else if (FSTRNCMP (card1, "DMAX", 4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_RANG_KEY); } else if (FSTRNCMP (card1, "CTYP",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CTY",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CUNI",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CUN",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CRVL",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CRV",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CRPX",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CRP",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CROT",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CDLT",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CDE",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CRD",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CSY",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "WCS",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "C",1) == 0) { if (*(card + 2) >= '0' && *(card + 2) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "P",1) == 0) { if (*(card + 2) >= '0' && *(card + 2) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "V",1) == 0) { if (*(card + 2) >= '0' && *(card + 2) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "S",1) == 0) { if (*(card + 2) >= '0' && *(card + 2) <= '9') return (TYP_WCS_KEY); } } else if (*card == 'X') { if (FSTRNCMP (card1, "TENSION", 7) == 0) return (TYP_STRUC_KEY); } else if (*card == 'W') { if (FSTRNCMP (card1, "CSAXES", 6) == 0) return (TYP_WCS_KEY); if (FSTRNCMP (card1, "CSNAME", 6) == 0) return (TYP_WCS_KEY); if (FSTRNCMP (card1, "CAX", 3) == 0) { if (*(card + 4) >= '0' && *(card + 4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CSN", 3) == 0) { if (*(card + 4) >= '0' && *(card + 4) <= '9') return (TYP_WCS_KEY); } } else if (*card >= '0' && *card <= '9') { if (*card1 == 'C') { if (FSTRNCMP (card1, "CTYP",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CTY",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CUNI",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CUN",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CRVL",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CRV",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CRPX",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CRP",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CROT",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CDLT",4) == 0) { if (*card5 >= '0' && *card5 <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CDE",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CRD",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "CSY",3) == 0) { if (*(card+4) >= '0' && *(card+4) <= '9') return (TYP_WCS_KEY); } } else if (FSTRNCMP (card1, "V",1) == 0) { if (*(card + 2) >= '0' && *(card + 2) <= '9') return (TYP_WCS_KEY); } else if (FSTRNCMP (card1, "S",1) == 0) { if (*(card + 2) >= '0' && *(card + 2) <= '9') return (TYP_WCS_KEY); } else if (*card1 >= '0' && *card1 <= '9') { /* 2 digits at beginning of keyword */ if ( (*(card + 2) == 'P') && (*(card + 3) == 'C') ) { if (*(card + 4) >= '0' && *(card + 4) <= '9') return (TYP_WCS_KEY); /* ijPCn keyword */ } else if ( (*(card + 2) == 'C') && (*(card + 3) == 'D') ) { if (*(card + 4) >= '0' && *(card + 4) <= '9') return (TYP_WCS_KEY); /* ijCDn keyword */ } } } return (TYP_USER_KEY); /* by default all others are user keywords */ } /*--------------------------------------------------------------------------*/ int ffdtyp(const char *cval, /* I - formatted string representation of the value */ char *dtype, /* O - datatype code: C, L, F, I, or X */ int *status) /* IO - error status */ /* determine implicit datatype of input string. This assumes that the string conforms to the FITS standard for keyword values, so may not detect all invalid formats. */ { if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (cval[0] == '\0') return(*status = VALUE_UNDEFINED); else if (cval[0] == '\'') *dtype = 'C'; /* character string starts with a quote */ else if (cval[0] == 'T' || cval[0] == 'F') *dtype = 'L'; /* logical = T or F character */ else if (cval[0] == '(') *dtype = 'X'; /* complex datatype "(1.2, -3.4)" */ else if (strchr(cval,'.')) *dtype = 'F'; /* float usualy contains a decimal point */ else if (strchr(cval,'E') || strchr(cval,'D') ) *dtype = 'F'; /* exponential contains a E or D */ else *dtype = 'I'; /* if none of the above assume it is integer */ return(*status); } /*--------------------------------------------------------------------------*/ int ffinttyp(char *cval, /* I - formatted string representation of the integer */ int *dtype, /* O - datatype code: TBYTE, TSHORT, TUSHORT, etc */ int *negative, /* O - is cval negative? */ int *status) /* IO - error status */ /* determine implicit datatype of input integer string. This assumes that the string conforms to the FITS standard for integer keyword value, so may not detect all invalid formats. */ { int ii, len; char *p; if (*status > 0) /* inherit input status value if > 0 */ return(*status); *dtype = 0; /* initialize to NULL */ *negative = 0; p = cval; if (*p == '+') { p++; /* ignore leading + sign */ } else if (*p == '-') { p++; *negative = 1; /* this is a negative number */ } if (*p == '0') { while (*p == '0') p++; /* skip leading zeros */ if (*p == 0) { /* the value is a string of 1 or more zeros */ *dtype = TSBYTE; return(*status); } } len = strlen(p); for (ii = 0; ii < len; ii++) { if (!isdigit(*(p+ii))) { *status = BAD_INTKEY; return(*status); } } /* check for unambiguous cases, based on length of the string */ if (len == 0) { *status = VALUE_UNDEFINED; } else if (len < 3) { *dtype = TSBYTE; } else if (len == 4) { *dtype = TSHORT; } else if (len > 5 && len < 10) { *dtype = TINT; } else if (len > 10 && len < 19) { *dtype = TLONGLONG; } else if (len > 20) { *status = BAD_INTKEY; } else { if (!(*negative)) { /* positive integers */ if (len == 3) { if (strcmp(p,"127") <= 0 ) { *dtype = TSBYTE; } else if (strcmp(p,"255") <= 0 ) { *dtype = TBYTE; } else { *dtype = TSHORT; } } else if (len == 5) { if (strcmp(p,"32767") <= 0 ) { *dtype = TSHORT; } else if (strcmp(p,"65535") <= 0 ) { *dtype = TUSHORT; } else { *dtype = TINT; } } else if (len == 10) { if (strcmp(p,"2147483647") <= 0 ) { *dtype = TINT; } else if (strcmp(p,"4294967295") <= 0 ) { *dtype = TUINT; } else { *dtype = TLONGLONG; } } else if (len == 19) { if (strcmp(p,"9223372036854775807") <= 0 ) { *dtype = TLONGLONG; } else { *dtype = TULONGLONG; } } else if (len == 20) { if (strcmp(p,"18446744073709551615") <= 0 ) { *dtype = TULONGLONG; } else { *status = BAD_INTKEY; } } } else { /* negative integers */ if (len == 3) { if (strcmp(p,"128") <= 0 ) { *dtype = TSBYTE; } else { *dtype = TSHORT; } } else if (len == 5) { if (strcmp(p,"32768") <= 0 ) { *dtype = TSHORT; } else { *dtype = TINT; } } else if (len == 10) { if (strcmp(p,"2147483648") <= 0 ) { *dtype = TINT; } else { *dtype = TLONGLONG; } } else if (len == 19) { if (strcmp(p,"9223372036854775808") <= 0 ) { *dtype = TLONGLONG; } else { *status = BAD_INTKEY; } } } } return(*status); } /*--------------------------------------------------------------------------*/ int ffc2x(const char *cval, /* I - formatted string representation of the value */ char *dtype, /* O - datatype code: C, L, F, I or X */ /* Only one of the following will be defined, depending on datatype */ long *ival, /* O - integer value */ int *lval, /* O - logical value */ char *sval, /* O - string value */ double *dval, /* O - double value */ int *status) /* IO - error status */ /* high level routine to convert formatted character string to its intrinsic data type */ { ffdtyp(cval, dtype, status); /* determine the datatype */ if (*dtype == 'I') ffc2ii(cval, ival, status); else if (*dtype == 'F') ffc2dd(cval, dval, status); else if (*dtype == 'L') ffc2ll(cval, lval, status); else ffc2s(cval, sval, status); /* C and X formats */ return(*status); } /*--------------------------------------------------------------------------*/ int ffc2xx(const char *cval, /* I - formatted string representation of the value */ char *dtype, /* O - datatype code: C, L, F, I or X */ /* Only one of the following will be defined, depending on datatype */ LONGLONG *ival, /* O - integer value */ int *lval, /* O - logical value */ char *sval, /* O - string value */ double *dval, /* O - double value */ int *status) /* IO - error status */ /* high level routine to convert formatted character string to its intrinsic data type */ { ffdtyp(cval, dtype, status); /* determine the datatype */ if (*dtype == 'I') ffc2jj(cval, ival, status); else if (*dtype == 'F') ffc2dd(cval, dval, status); else if (*dtype == 'L') ffc2ll(cval, lval, status); else ffc2s(cval, sval, status); /* C and X formats */ return(*status); } /*--------------------------------------------------------------------------*/ int ffc2uxx(const char *cval, /* I - formatted string representation of the value */ char *dtype, /* O - datatype code: C, L, F, I or X */ /* Only one of the following will be defined, depending on datatype */ ULONGLONG *ival, /* O - integer value */ int *lval, /* O - logical value */ char *sval, /* O - string value */ double *dval, /* O - double value */ int *status) /* IO - error status */ /* high level routine to convert formatted character string to its intrinsic data type */ { ffdtyp(cval, dtype, status); /* determine the datatype */ if (*dtype == 'I') ffc2ujj(cval, ival, status); else if (*dtype == 'F') ffc2dd(cval, dval, status); else if (*dtype == 'L') ffc2ll(cval, lval, status); else ffc2s(cval, sval, status); /* C and X formats */ return(*status); } /*--------------------------------------------------------------------------*/ int ffc2i(const char *cval, /* I - string representation of the value */ long *ival, /* O - numerical value of the input string */ int *status) /* IO - error status */ /* convert formatted string to an integer value, doing implicit datatype conversion if necessary. */ { char dtype, sval[81], msg[81]; int lval; double dval; if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (cval[0] == '\0') return(*status = VALUE_UNDEFINED); /* null value string */ /* convert the keyword to its native datatype */ ffc2x(cval, &dtype, ival, &lval, sval, &dval, status); if (dtype == 'X' ) { *status = BAD_INTKEY; } else if (dtype == 'C') { /* try reading the string as a number */ if (ffc2dd(sval, &dval, status) <= 0) { if (dval > (double) LONG_MAX || dval < (double) LONG_MIN) *status = NUM_OVERFLOW; else *ival = (long) dval; } } else if (dtype == 'F') { if (dval > (double) LONG_MAX || dval < (double) LONG_MIN) *status = NUM_OVERFLOW; else *ival = (long) dval; } else if (dtype == 'L') { *ival = (long) lval; } if (*status > 0) { *ival = 0; strcpy(msg,"Error in ffc2i evaluating string as an integer: "); strncat(msg,cval,30); ffpmsg(msg); return(*status); } return(*status); } /*--------------------------------------------------------------------------*/ int ffc2j(const char *cval, /* I - string representation of the value */ LONGLONG *ival, /* O - numerical value of the input string */ int *status) /* IO - error status */ /* convert formatted string to a LONGLONG integer value, doing implicit datatype conversion if necessary. */ { char dtype, sval[81], msg[81]; int lval; double dval; if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (cval[0] == '\0') return(*status = VALUE_UNDEFINED); /* null value string */ /* convert the keyword to its native datatype */ ffc2xx(cval, &dtype, ival, &lval, sval, &dval, status); if (dtype == 'X' ) { *status = BAD_INTKEY; } else if (dtype == 'C') { /* try reading the string as a number */ if (ffc2dd(sval, &dval, status) <= 0) { if (dval > (double) LONGLONG_MAX || dval < (double) LONGLONG_MIN) *status = NUM_OVERFLOW; else *ival = (LONGLONG) dval; } } else if (dtype == 'F') { if (dval > (double) LONGLONG_MAX || dval < (double) LONGLONG_MIN) *status = NUM_OVERFLOW; else *ival = (LONGLONG) dval; } else if (dtype == 'L') { *ival = (LONGLONG) lval; } if (*status > 0) { *ival = 0; strcpy(msg,"Error in ffc2j evaluating string as a long integer: "); strncat(msg,cval,30); ffpmsg(msg); return(*status); } return(*status); } /*--------------------------------------------------------------------------*/ int ffc2uj(const char *cval, /* I - string representation of the value */ ULONGLONG *ival, /* O - numerical value of the input string */ int *status) /* IO - error status */ /* convert formatted string to a ULONGLONG integer value, doing implicit datatype conversion if necessary. */ { char dtype, sval[81], msg[81]; int lval; double dval; if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (cval[0] == '\0') return(*status = VALUE_UNDEFINED); /* null value string */ /* convert the keyword to its native datatype */ ffc2uxx(cval, &dtype, ival, &lval, sval, &dval, status); if (dtype == 'X' ) { *status = BAD_INTKEY; } else if (dtype == 'C') { /* try reading the string as a number */ if (ffc2dd(sval, &dval, status) <= 0) { if (dval > (double) DULONGLONG_MAX || dval < -0.49) *status = NUM_OVERFLOW; else *ival = (ULONGLONG) dval; } } else if (dtype == 'F') { if (dval > (double) DULONGLONG_MAX || dval < -0.49) *status = NUM_OVERFLOW; else *ival = (ULONGLONG) dval; } else if (dtype == 'L') { *ival = (ULONGLONG) lval; } if (*status > 0) { *ival = 0; strcpy(msg,"Error in ffc2j evaluating string as a long integer: "); strncat(msg,cval,30); ffpmsg(msg); return(*status); } return(*status); } /*--------------------------------------------------------------------------*/ int ffc2l(const char *cval, /* I - string representation of the value */ int *lval, /* O - numerical value of the input string */ int *status) /* IO - error status */ /* convert formatted string to a logical value, doing implicit datatype conversion if necessary */ { char dtype, sval[81], msg[81]; long ival; double dval; if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (cval[0] == '\0') return(*status = VALUE_UNDEFINED); /* null value string */ /* convert the keyword to its native datatype */ ffc2x(cval, &dtype, &ival, lval, sval, &dval, status); if (dtype == 'C' || dtype == 'X' ) *status = BAD_LOGICALKEY; if (*status > 0) { *lval = 0; strcpy(msg,"Error in ffc2l evaluating string as a logical: "); strncat(msg,cval,30); ffpmsg(msg); return(*status); } if (dtype == 'I') { if (ival) *lval = 1; else *lval = 0; } else if (dtype == 'F') { if (dval) *lval = 1; else *lval = 0; } return(*status); } /*--------------------------------------------------------------------------*/ int ffc2r(const char *cval, /* I - string representation of the value */ float *fval, /* O - numerical value of the input string */ int *status) /* IO - error status */ /* convert formatted string to a real float value, doing implicit datatype conversion if necessary */ { char dtype, sval[81], msg[81]; int lval; if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (cval[0] == '\0') return(*status = VALUE_UNDEFINED); /* null value string */ ffdtyp(cval, &dtype, status); /* determine the datatype */ if (dtype == 'I' || dtype == 'F') ffc2rr(cval, fval, status); else if (dtype == 'L') { ffc2ll(cval, &lval, status); *fval = (float) lval; } else if (dtype == 'C') { /* try reading the string as a number */ ffc2s(cval, sval, status); ffc2rr(sval, fval, status); } else *status = BAD_FLOATKEY; if (*status > 0) { *fval = 0.; strcpy(msg,"Error in ffc2r evaluating string as a float: "); strncat(msg,cval,30); ffpmsg(msg); return(*status); } return(*status); } /*--------------------------------------------------------------------------*/ int ffc2d(const char *cval, /* I - string representation of the value */ double *dval, /* O - numerical value of the input string */ int *status) /* IO - error status */ /* convert formatted string to a double value, doing implicit datatype conversion if necessary */ { char dtype, sval[81], msg[81]; int lval; if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (cval[0] == '\0') return(*status = VALUE_UNDEFINED); /* null value string */ ffdtyp(cval, &dtype, status); /* determine the datatype */ if (dtype == 'I' || dtype == 'F') ffc2dd(cval, dval, status); else if (dtype == 'L') { ffc2ll(cval, &lval, status); *dval = (double) lval; } else if (dtype == 'C') { /* try reading the string as a number */ ffc2s(cval, sval, status); ffc2dd(sval, dval, status); } else *status = BAD_DOUBLEKEY; if (*status > 0) { *dval = 0.; strcpy(msg,"Error in ffc2d evaluating string as a double: "); strncat(msg,cval,30); ffpmsg(msg); return(*status); } return(*status); } /*--------------------------------------------------------------------------*/ int ffc2ii(const char *cval, /* I - string representation of the value */ long *ival, /* O - numerical value of the input string */ int *status) /* IO - error status */ /* convert null-terminated formatted string to an integer value */ { char *loc, msg[81]; if (*status > 0) /* inherit input status value if > 0 */ return(*status); errno = 0; *ival = 0; *ival = strtol(cval, &loc, 10); /* read the string as an integer */ /* check for read error, or junk following the integer */ if (*loc != '\0' && *loc != ' ' ) *status = BAD_C2I; if (errno == ERANGE) { strcpy(msg,"Range Error in ffc2ii converting string to long int: "); strncat(msg,cval,25); ffpmsg(msg); *status = NUM_OVERFLOW; errno = 0; } return(*status); } /*--------------------------------------------------------------------------*/ int ffc2jj(const char *cval, /* I - string representation of the value */ LONGLONG *ival, /* O - numerical value of the input string */ int *status) /* IO - error status */ /* convert null-terminated formatted string to an long long integer value */ { char *loc, msg[81]; if (*status > 0) /* inherit input status value if > 0 */ return(*status); errno = 0; *ival = 0; #if defined(_MSC_VER) /* Microsoft Visual C++ 6.0 does not have the strtoll function */ *ival = _atoi64(cval); loc = (char *) cval; while (*loc == ' ') loc++; /* skip spaces */ if (*loc == '-') loc++; /* skip minus sign */ if (*loc == '+') loc++; /* skip plus sign */ while (isdigit(*loc)) loc++; /* skip digits */ #elif (USE_LL_SUFFIX == 1) *ival = strtoll(cval, &loc, 10); /* read the string as an integer */ #else *ival = strtol(cval, &loc, 10); /* read the string as an integer */ #endif /* check for read error, or junk following the integer */ if (*loc != '\0' && *loc != ' ' ) *status = BAD_C2I; if (errno == ERANGE) { strcpy(msg,"Range Error in ffc2jj converting string to longlong int: "); strncat(msg,cval,23); ffpmsg(msg); *status = NUM_OVERFLOW; errno = 0; } return(*status); } /*--------------------------------------------------------------------------*/ int ffc2ujj(const char *cval, /* I - string representation of the value */ ULONGLONG *ival, /* O - numerical value of the input string */ int *status) /* IO - error status */ /* convert null-terminated formatted string to an unsigned long long integer value */ { char *loc, msg[81]; if (*status > 0) /* inherit input status value if > 0 */ return(*status); errno = 0; *ival = 0; #if defined(_MSC_VER) /* Microsoft Visual C++ 6.0 does not have the strtoll function */ /* !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! */ /* !!!!! This needs to be modified to use the unsigned long long version of _atoi64 */ /* !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! */ *ival = _atoi64(cval); loc = (char *) cval; while (*loc == ' ') loc++; /* skip spaces */ if (*loc == '-') loc++; /* skip minus sign */ if (*loc == '+') loc++; /* skip plus sign */ while (isdigit(*loc)) loc++; /* skip digits */ #elif (USE_LL_SUFFIX == 1) *ival = strtoull(cval, &loc, 10); /* read the string as an integer */ #else *ival = strtoul(cval, &loc, 10); /* read the string as an integer */ #endif /* check for read error, or junk following the integer */ if (*loc != '\0' && *loc != ' ' ) *status = BAD_C2I; if (errno == ERANGE) { strcpy(msg,"Range Error in ffc2ujj converting string to unsigned longlong int: "); strncat(msg,cval,25); ffpmsg(msg); *status = NUM_OVERFLOW; errno = 0; } return(*status); } /*--------------------------------------------------------------------------*/ int ffc2ll(const char *cval, /* I - string representation of the value: T or F */ int *lval, /* O - numerical value of the input string: 1 or 0 */ int *status) /* IO - error status */ /* convert null-terminated formatted string to a logical value */ { if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (cval[0] == 'T') *lval = 1; else *lval = 0; /* any character besides T is considered false */ return(*status); } /*--------------------------------------------------------------------------*/ int ffc2s(const char *instr, /* I - null terminated quoted input string */ char *outstr, /* O - null terminated output string without quotes */ int *status) /* IO - error status */ /* convert an input quoted string to an unquoted string by removing the leading and trailing quote character. Also, replace any pairs of single quote characters with just a single quote character (FITS used a pair of single quotes to represent a literal quote character within the string). */ { int jj; size_t len, ii; if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (instr[0] != '\'') { if (instr[0] == '\0') { outstr[0] = '\0'; return(*status = VALUE_UNDEFINED); /* null value string */ } else { strcpy(outstr, instr); /* no leading quote, so return input string */ return(*status); } } len = strlen(instr); for (ii=1, jj=0; ii < len; ii++, jj++) { if (instr[ii] == '\'') /* is this the closing quote? */ { if (instr[ii+1] == '\'') /* 2 successive quotes? */ ii++; /* copy only one of the quotes */ else break; /* found the closing quote, so exit this loop */ } outstr[jj] = instr[ii]; /* copy the next character to the output */ } outstr[jj] = '\0'; /* terminate the output string */ if (ii == len) { ffpmsg("This string value has no closing quote (ffc2s):"); ffpmsg(instr); return(*status = 205); } for (jj--; jj >= 0; jj--) /* replace trailing blanks with nulls */ { if (outstr[jj] == ' ') outstr[jj] = 0; else break; } return(*status); } /*--------------------------------------------------------------------------*/ int ffc2rr(const char *cval, /* I - string representation of the value */ float *fval, /* O - numerical value of the input string */ int *status) /* IO - error status */ /* convert null-terminated formatted string to a float value */ { char *loc, msg[81], tval[73]; struct lconv *lcc = 0; static char decimalpt = 0; short *sptr, iret; if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (!decimalpt) { /* only do this once for efficiency */ lcc = localeconv(); /* set structure containing local decimal point symbol */ decimalpt = *(lcc->decimal_point); } errno = 0; *fval = 0.; if (strchr(cval, 'D') || decimalpt == ',') { /* strtod expects a comma, not a period, as the decimal point */ if (strlen(cval) > 72) { strcpy(msg,"Error: Invalid string to float in ffc2rr"); ffpmsg(msg); return (*status=BAD_C2F); } strcpy(tval, cval); /* The C language does not support a 'D'; replace with 'E' */ if ((loc = strchr(tval, 'D'))) *loc = 'E'; if (decimalpt == ',') { /* strtod expects a comma, not a period, as the decimal point */ if ((loc = strchr(tval, '.'))) *loc = ','; } *fval = (float) strtod(tval, &loc); /* read the string as an float */ } else { *fval = (float) strtod(cval, &loc); } /* check for read error, or junk following the value */ if (*loc != '\0' && *loc != ' ' ) { strcpy(msg,"Error in ffc2rr converting string to float: "); strncat(msg,cval,30); ffpmsg(msg); *status = BAD_C2F; } sptr = (short *) fval; #if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS sptr++; /* point to MSBs */ #endif iret = fnan(*sptr); /* if iret == 1, then the float value is a NaN */ if (errno == ERANGE || (iret == 1) ) { strcpy(msg,"Error in ffc2rr converting string to float: "); strncat(msg,cval,30); ffpmsg(msg); *fval = 0.; *status = NUM_OVERFLOW; errno = 0; } return(*status); } /*--------------------------------------------------------------------------*/ int ffc2dd(const char *cval, /* I - string representation of the value */ double *dval, /* O - numerical value of the input string */ int *status) /* IO - error status */ /* convert null-terminated formatted string to a double value */ { char *loc, msg[81], tval[73]; struct lconv *lcc = 0; static char decimalpt = 0; short *sptr, iret; if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (!decimalpt) { /* only do this once for efficiency */ lcc = localeconv(); /* set structure containing local decimal point symbol */ decimalpt = *(lcc->decimal_point); } errno = 0; *dval = 0.; if (strchr(cval, 'D') || decimalpt == ',') { /* need to modify a temporary copy of the string before parsing it */ if (strlen(cval) > 72) { strcpy(msg,"Error: Invalid string to double in ffc2dd"); ffpmsg(msg); return (*status=BAD_C2D); } strcpy(tval, cval); /* The C language does not support a 'D'; replace with 'E' */ if ((loc = strchr(tval, 'D'))) *loc = 'E'; if (decimalpt == ',') { /* strtod expects a comma, not a period, as the decimal point */ if ((loc = strchr(tval, '.'))) *loc = ','; } *dval = strtod(tval, &loc); /* read the string as an double */ } else { *dval = strtod(cval, &loc); } /* check for read error, or junk following the value */ if (*loc != '\0' && *loc != ' ' ) { strcpy(msg,"Error in ffc2dd converting string to double: "); strncat(msg,cval,30); ffpmsg(msg); *status = BAD_C2D; } sptr = (short *) dval; #if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS sptr += 3; /* point to MSBs */ #endif iret = dnan(*sptr); /* if iret == 1, then the double value is a NaN */ if (errno == ERANGE || (iret == 1) ) { strcpy(msg,"Error in ffc2dd converting string to double: "); strncat(msg,cval,30); ffpmsg(msg); *dval = 0.; *status = NUM_OVERFLOW; errno = 0; } return(*status); } /* ================================================================== */ /* A hack for nonunix machines, which lack strcasecmp and strncasecmp */ /* ================================================================== */ int fits_strcasecmp(const char *s1, const char *s2) { char c1, c2; for (;;) { c1 = toupper( *s1 ); c2 = toupper( *s2 ); if (c1 < c2) return(-1); if (c1 > c2) return(1); if (c1 == 0) return(0); s1++; s2++; } } int fits_strncasecmp(const char *s1, const char *s2, size_t n) { char c1, c2; for (; n-- ;) { c1 = toupper( *s1 ); c2 = toupper( *s2 ); if (c1 < c2) return(-1); if (c1 > c2) return(1); if (c1 == 0) return(0); s1++; s2++; } return(0); } cfitsio-3.47/fits_hcompress.c0000644000225700000360000013375213464573432015617 0ustar cagordonlhea/* ######################################################################### These routines to apply the H-compress compression algorithm to a 2-D Fits image were written by R. White at the STScI and were obtained from the STScI at http://www.stsci.edu/software/hcompress.html This source file is a concatination of the following sources files in the original distribution htrans.c digitize.c encode.c qwrite.c doencode.c bit_output.c qtree_encode.c The following modifications have been made to the original code: - commented out redundant "include" statements - added the noutchar global variable - changed all the 'extern' declarations to 'static', since all the routines are in the same source file - changed the first parameter in encode (and in lower level routines from a file stream to a char array - modifid the encode routine to return the size of the compressed array of bytes - changed calls to printf and perror to call the CFITSIO ffpmsg routine - modified the mywrite routine, and lower level byte writing routines, to copy the output bytes to a char array, instead of writing them to a file stream - replace "exit" statements with "return" statements - changed the function declarations to the more modern ANSI C style ############################################################################ */ #include #include #include #include #include "fitsio2.h" static long noutchar; static long noutmax; static int htrans(int a[],int nx,int ny); static void digitize(int a[], int nx, int ny, int scale); static int encode(char *outfile, long *nlen, int a[], int nx, int ny, int scale); static void shuffle(int a[], int n, int n2, int tmp[]); static int htrans64(LONGLONG a[],int nx,int ny); static void digitize64(LONGLONG a[], int nx, int ny, int scale); static int encode64(char *outfile, long *nlen, LONGLONG a[], int nx, int ny, int scale); static void shuffle64(LONGLONG a[], int n, int n2, LONGLONG tmp[]); static void writeint(char *outfile, int a); static void writelonglong(char *outfile, LONGLONG a); static int doencode(char *outfile, int a[], int nx, int ny, unsigned char nbitplanes[3]); static int doencode64(char *outfile, LONGLONG a[], int nx, int ny, unsigned char nbitplanes[3]); static int qwrite(char *file, char buffer[], int n); static int qtree_encode(char *outfile, int a[], int n, int nqx, int nqy, int nbitplanes); static int qtree_encode64(char *outfile, LONGLONG a[], int n, int nqx, int nqy, int nbitplanes); static void start_outputing_bits(void); static void done_outputing_bits(char *outfile); static void output_nbits(char *outfile, int bits, int n); static void qtree_onebit(int a[], int n, int nx, int ny, unsigned char b[], int bit); static void qtree_onebit64(LONGLONG a[], int n, int nx, int ny, unsigned char b[], int bit); static void qtree_reduce(unsigned char a[], int n, int nx, int ny, unsigned char b[]); static int bufcopy(unsigned char a[], int n, unsigned char buffer[], int *b, int bmax); static void write_bdirect(char *outfile, int a[], int n,int nqx, int nqy, unsigned char scratch[], int bit); static void write_bdirect64(char *outfile, LONGLONG a[], int n,int nqx, int nqy, unsigned char scratch[], int bit); /* #define output_nybble(outfile,c) output_nbits(outfile,c,4) */ static void output_nybble(char *outfile, int bits); static void output_nnybble(char *outfile, int n, unsigned char array[]); #define output_huffman(outfile,c) output_nbits(outfile,code[c],ncode[c]) /* ---------------------------------------------------------------------- */ int fits_hcompress(int *a, int ny, int nx, int scale, char *output, long *nbytes, int *status) { /* compress the input image using the H-compress algorithm a - input image array nx - size of X axis of image ny - size of Y axis of image scale - quantization scale factor. Larger values results in more (lossy) compression scale = 0 does lossless compression output - pre-allocated array to hold the output compressed stream of bytes nbyts - input value = size of the output buffer; returned value = size of the compressed byte stream, in bytes NOTE: the nx and ny dimensions as defined within this code are reversed from the usual FITS notation. ny is the fastest varying dimension, which is usually considered the X axis in the FITS image display */ int stat; if (*status > 0) return(*status); /* H-transform */ stat = htrans(a, nx, ny); if (stat) { *status = stat; return(*status); } /* digitize */ digitize(a, nx, ny, scale); /* encode and write to output array */ FFLOCK; noutmax = *nbytes; /* input value is the allocated size of the array */ *nbytes = 0; /* reset */ stat = encode(output, nbytes, a, nx, ny, scale); FFUNLOCK; *status = stat; return(*status); } /* ---------------------------------------------------------------------- */ int fits_hcompress64(LONGLONG *a, int ny, int nx, int scale, char *output, long *nbytes, int *status) { /* compress the input image using the H-compress algorithm a - input image array nx - size of X axis of image ny - size of Y axis of image scale - quantization scale factor. Larger values results in more (lossy) compression scale = 0 does lossless compression output - pre-allocated array to hold the output compressed stream of bytes nbyts - size of the compressed byte stream, in bytes NOTE: the nx and ny dimensions as defined within this code are reversed from the usual FITS notation. ny is the fastest varying dimension, which is usually considered the X axis in the FITS image display */ int stat; if (*status > 0) return(*status); /* H-transform */ stat = htrans64(a, nx, ny); if (stat) { *status = stat; return(*status); } /* digitize */ digitize64(a, nx, ny, scale); /* encode and write to output array */ FFLOCK; noutmax = *nbytes; /* input value is the allocated size of the array */ *nbytes = 0; /* reset */ stat = encode64(output, nbytes, a, nx, ny, scale); FFUNLOCK; *status = stat; return(*status); } /* Copyright (c) 1993 Association of Universities for Research * in Astronomy. All rights reserved. Produced under National * Aeronautics and Space Administration Contract No. NAS5-26555. */ /* htrans.c H-transform of NX x NY integer image * * Programmer: R. White Date: 11 May 1992 */ /* ######################################################################### */ static int htrans(int a[],int nx,int ny) { int nmax, log2n, h0, hx, hy, hc, nxtop, nytop, i, j, k; int oddx, oddy; int shift, mask, mask2, prnd, prnd2, nrnd2; int s10, s00; int *tmp; /* * log2n is log2 of max(nx,ny) rounded up to next power of 2 */ nmax = (nx>ny) ? nx : ny; log2n = (int) (log((float) nmax)/log(2.0)+0.5); if ( nmax > (1<> shift; hx = (a[s10+1] + a[s10] - a[s00+1] - a[s00]) >> shift; hy = (a[s10+1] - a[s10] + a[s00+1] - a[s00]) >> shift; hc = (a[s10+1] - a[s10] - a[s00+1] + a[s00]) >> shift; /* * Throw away the 2 bottom bits of h0, bottom bit of hx,hy. * To get rounding to be same for positive and negative * numbers, nrnd2 = prnd2 - 1. */ a[s10+1] = hc; a[s10 ] = ( (hx>=0) ? (hx+prnd) : hx ) & mask ; a[s00+1] = ( (hy>=0) ? (hy+prnd) : hy ) & mask ; a[s00 ] = ( (h0>=0) ? (h0+prnd2) : (h0+nrnd2) ) & mask2; s00 += 2; s10 += 2; } if (oddy) { /* * do last element in row if row length is odd * s00+1, s10+1 are off edge */ h0 = (a[s10] + a[s00]) << (1-shift); hx = (a[s10] - a[s00]) << (1-shift); a[s10 ] = ( (hx>=0) ? (hx+prnd) : hx ) & mask ; a[s00 ] = ( (h0>=0) ? (h0+prnd2) : (h0+nrnd2) ) & mask2; s00 += 1; s10 += 1; } } if (oddx) { /* * do last row if column length is odd * s10, s10+1 are off edge */ s00 = i*ny; for (j = 0; j=0) ? (hy+prnd) : hy ) & mask ; a[s00 ] = ( (h0>=0) ? (h0+prnd2) : (h0+nrnd2) ) & mask2; s00 += 2; } if (oddy) { /* * do corner element if both row and column lengths are odd * s00+1, s10, s10+1 are off edge */ h0 = a[s00] << (2-shift); a[s00 ] = ( (h0>=0) ? (h0+prnd2) : (h0+nrnd2) ) & mask2; } } /* * now shuffle in each dimension to group coefficients by order */ for (i = 0; i>1; nytop = (nytop+1)>>1; /* * divisor doubles after first reduction */ shift = 1; /* * masks, rounding values double after each iteration */ mask = mask2; prnd = prnd2; mask2 = mask2 << 1; prnd2 = prnd2 << 1; nrnd2 = prnd2 - 1; } free(tmp); return(0); } /* ######################################################################### */ static int htrans64(LONGLONG a[],int nx,int ny) { int nmax, log2n, nxtop, nytop, i, j, k; int oddx, oddy; int shift; int s10, s00; LONGLONG h0, hx, hy, hc, prnd, prnd2, nrnd2, mask, mask2; LONGLONG *tmp; /* * log2n is log2 of max(nx,ny) rounded up to next power of 2 */ nmax = (nx>ny) ? nx : ny; log2n = (int) (log((float) nmax)/log(2.0)+0.5); if ( nmax > (1<> shift; hx = (a[s10+1] + a[s10] - a[s00+1] - a[s00]) >> shift; hy = (a[s10+1] - a[s10] + a[s00+1] - a[s00]) >> shift; hc = (a[s10+1] - a[s10] - a[s00+1] + a[s00]) >> shift; /* * Throw away the 2 bottom bits of h0, bottom bit of hx,hy. * To get rounding to be same for positive and negative * numbers, nrnd2 = prnd2 - 1. */ a[s10+1] = hc; a[s10 ] = ( (hx>=0) ? (hx+prnd) : hx ) & mask ; a[s00+1] = ( (hy>=0) ? (hy+prnd) : hy ) & mask ; a[s00 ] = ( (h0>=0) ? (h0+prnd2) : (h0+nrnd2) ) & mask2; s00 += 2; s10 += 2; } if (oddy) { /* * do last element in row if row length is odd * s00+1, s10+1 are off edge */ h0 = (a[s10] + a[s00]) << (1-shift); hx = (a[s10] - a[s00]) << (1-shift); a[s10 ] = ( (hx>=0) ? (hx+prnd) : hx ) & mask ; a[s00 ] = ( (h0>=0) ? (h0+prnd2) : (h0+nrnd2) ) & mask2; s00 += 1; s10 += 1; } } if (oddx) { /* * do last row if column length is odd * s10, s10+1 are off edge */ s00 = i*ny; for (j = 0; j=0) ? (hy+prnd) : hy ) & mask ; a[s00 ] = ( (h0>=0) ? (h0+prnd2) : (h0+nrnd2) ) & mask2; s00 += 2; } if (oddy) { /* * do corner element if both row and column lengths are odd * s00+1, s10, s10+1 are off edge */ h0 = a[s00] << (2-shift); a[s00 ] = ( (h0>=0) ? (h0+prnd2) : (h0+nrnd2) ) & mask2; } } /* * now shuffle in each dimension to group coefficients by order */ for (i = 0; i>1; nytop = (nytop+1)>>1; /* * divisor doubles after first reduction */ shift = 1; /* * masks, rounding values double after each iteration */ mask = mask2; prnd = prnd2; mask2 = mask2 << 1; prnd2 = prnd2 << 1; nrnd2 = prnd2 - 1; } free(tmp); return(0); } /* ######################################################################### */ static void shuffle(int a[], int n, int n2, int tmp[]) { /* int a[]; array to shuffle int n; number of elements to shuffle int n2; second dimension int tmp[]; scratch storage */ int i; int *p1, *p2, *pt; /* * copy odd elements to tmp */ pt = tmp; p1 = &a[n2]; for (i=1; i < n; i += 2) { *pt = *p1; pt += 1; p1 += (n2+n2); } /* * compress even elements into first half of A */ p1 = &a[n2]; p2 = &a[n2+n2]; for (i=2; i0) ? (*p+d) : (*p-d))/scale; } /* ######################################################################### */ static void digitize64(LONGLONG a[], int nx, int ny, int scale) { LONGLONG d, *p, scale64; /* * round to multiple of scale */ if (scale <= 1) return; d=(scale+1)/2-1; scale64 = scale; /* use a 64-bit int for efficiency in the big loop */ for (p=a; p <= &a[nx*ny-1]; p++) *p = ((*p>0) ? (*p+d) : (*p-d))/scale64; } /* ######################################################################### */ /* ######################################################################### */ /* Copyright (c) 1993 Association of Universities for Research * in Astronomy. All rights reserved. Produced under National * Aeronautics and Space Administration Contract No. NAS5-26555. */ /* encode.c encode H-transform and write to outfile * * Programmer: R. White Date: 2 February 1994 */ static char code_magic[2] = { (char)0xDD, (char)0x99 }; /* ######################################################################### */ static int encode(char *outfile, long *nlength, int a[], int nx, int ny, int scale) { /* FILE *outfile; - change outfile to a char array */ /* long * nlength returned length (in bytes) of the encoded array) int a[]; input H-transform array (nx,ny) int nx,ny; size of H-transform array int scale; scale factor for digitization */ int nel, nx2, ny2, i, j, k, q, vmax[3], nsign, bits_to_go; unsigned char nbitplanes[3]; unsigned char *signbits; int stat; noutchar = 0; /* initialize the number of compressed bytes that have been written */ nel = nx*ny; /* * write magic value */ qwrite(outfile, code_magic, sizeof(code_magic)); writeint(outfile, nx); /* size of image */ writeint(outfile, ny); writeint(outfile, scale); /* scale factor for digitization */ /* * write first value of A (sum of all pixels -- the only value * which does not compress well) */ writelonglong(outfile, (LONGLONG) a[0]); a[0] = 0; /* * allocate array for sign bits and save values, 8 per byte (initialize to all zeros) */ signbits = (unsigned char *) calloc(1, (nel+7)/8); if (signbits == (unsigned char *) NULL) { ffpmsg("encode: insufficient memory"); return(DATA_COMPRESSION_ERR); } nsign = 0; bits_to_go = 8; /* signbits[0] = 0; */ for (i=0; i 0) { /* * positive element, put zero at end of buffer */ signbits[nsign] <<= 1; bits_to_go -= 1; } else if (a[i] < 0) { /* * negative element, shift in a one */ signbits[nsign] <<= 1; signbits[nsign] |= 1; bits_to_go -= 1; /* * replace a by absolute value */ a[i] = -a[i]; } if (bits_to_go == 0) { /* * filled up this byte, go to the next one */ bits_to_go = 8; nsign += 1; /* signbits[nsign] = 0; */ } } if (bits_to_go != 8) { /* * some bits in last element * move bits in last byte to bottom and increment nsign */ signbits[nsign] <<= bits_to_go; nsign += 1; } /* * calculate number of bit planes for 3 quadrants * * quadrant 0=bottom left, 1=bottom right or top left, 2=top right, */ for (q=0; q<3; q++) { vmax[q] = 0; } /* * get maximum absolute value in each quadrant */ nx2 = (nx+1)/2; ny2 = (ny+1)/2; j=0; /* column counter */ k=0; /* row counter */ for (i=0; i=ny2) + (k>=nx2); if (vmax[q] < a[i]) vmax[q] = a[i]; if (++j >= ny) { j = 0; k += 1; } } /* * now calculate number of bits for each quadrant */ /* this is a more efficient way to do this, */ for (q = 0; q < 3; q++) { for (nbitplanes[q] = 0; vmax[q]>0; vmax[q] = vmax[q]>>1, nbitplanes[q]++) ; } /* for (q = 0; q < 3; q++) { nbitplanes[q] = (int) (log((float) (vmax[q]+1))/log(2.0)+0.5); if ( (vmax[q]+1) > (1< 0) { if ( 0 == qwrite(outfile, (char *) signbits, nsign)) { free(signbits); *nlength = noutchar; ffpmsg("encode: output buffer too small"); return(DATA_COMPRESSION_ERR); } } free(signbits); *nlength = noutchar; if (noutchar >= noutmax) { ffpmsg("encode: output buffer too small"); return(DATA_COMPRESSION_ERR); } return(stat); } /* ######################################################################### */ static int encode64(char *outfile, long *nlength, LONGLONG a[], int nx, int ny, int scale) { /* FILE *outfile; - change outfile to a char array */ /* long * nlength returned length (in bytes) of the encoded array) LONGLONG a[]; input H-transform array (nx,ny) int nx,ny; size of H-transform array int scale; scale factor for digitization */ int nel, nx2, ny2, i, j, k, q, nsign, bits_to_go; LONGLONG vmax[3]; unsigned char nbitplanes[3]; unsigned char *signbits; int stat; noutchar = 0; /* initialize the number of compressed bytes that have been written */ nel = nx*ny; /* * write magic value */ qwrite(outfile, code_magic, sizeof(code_magic)); writeint(outfile, nx); /* size of image */ writeint(outfile, ny); writeint(outfile, scale); /* scale factor for digitization */ /* * write first value of A (sum of all pixels -- the only value * which does not compress well) */ writelonglong(outfile, a[0]); a[0] = 0; /* * allocate array for sign bits and save values, 8 per byte */ signbits = (unsigned char *) calloc(1, (nel+7)/8); if (signbits == (unsigned char *) NULL) { ffpmsg("encode64: insufficient memory"); return(DATA_COMPRESSION_ERR); } nsign = 0; bits_to_go = 8; /* signbits[0] = 0; */ for (i=0; i 0) { /* * positive element, put zero at end of buffer */ signbits[nsign] <<= 1; bits_to_go -= 1; } else if (a[i] < 0) { /* * negative element, shift in a one */ signbits[nsign] <<= 1; signbits[nsign] |= 1; bits_to_go -= 1; /* * replace a by absolute value */ a[i] = -a[i]; } if (bits_to_go == 0) { /* * filled up this byte, go to the next one */ bits_to_go = 8; nsign += 1; /* signbits[nsign] = 0; */ } } if (bits_to_go != 8) { /* * some bits in last element * move bits in last byte to bottom and increment nsign */ signbits[nsign] <<= bits_to_go; nsign += 1; } /* * calculate number of bit planes for 3 quadrants * * quadrant 0=bottom left, 1=bottom right or top left, 2=top right, */ for (q=0; q<3; q++) { vmax[q] = 0; } /* * get maximum absolute value in each quadrant */ nx2 = (nx+1)/2; ny2 = (ny+1)/2; j=0; /* column counter */ k=0; /* row counter */ for (i=0; i=ny2) + (k>=nx2); if (vmax[q] < a[i]) vmax[q] = a[i]; if (++j >= ny) { j = 0; k += 1; } } /* * now calculate number of bits for each quadrant */ /* this is a more efficient way to do this, */ for (q = 0; q < 3; q++) { for (nbitplanes[q] = 0; vmax[q]>0; vmax[q] = vmax[q]>>1, nbitplanes[q]++) ; } /* for (q = 0; q < 3; q++) { nbitplanes[q] = log((float) (vmax[q]+1))/log(2.0)+0.5; if ( (vmax[q]+1) > (((LONGLONG) 1)< 0) { if ( 0 == qwrite(outfile, (char *) signbits, nsign)) { free(signbits); *nlength = noutchar; ffpmsg("encode: output buffer too small"); return(DATA_COMPRESSION_ERR); } } free(signbits); *nlength = noutchar; if (noutchar >= noutmax) { ffpmsg("encode64: output buffer too small"); return(DATA_COMPRESSION_ERR); } return(stat); } /* ######################################################################### */ /* ######################################################################### */ /* Copyright (c) 1993 Association of Universities for Research * in Astronomy. All rights reserved. Produced under National * Aeronautics and Space Administration Contract No. NAS5-26555. */ /* qwrite.c Write binary data * * Programmer: R. White Date: 11 March 1991 */ /* ######################################################################### */ static void writeint(char *outfile, int a) { int i; unsigned char b[4]; /* Write integer A one byte at a time to outfile. * * This is portable from Vax to Sun since it eliminates the * need for byte-swapping. */ for (i=3; i>=0; i--) { b[i] = a & 0x000000ff; a >>= 8; } for (i=0; i<4; i++) qwrite(outfile, (char *) &b[i],1); } /* ######################################################################### */ static void writelonglong(char *outfile, LONGLONG a) { int i; unsigned char b[8]; /* Write integer A one byte at a time to outfile. * * This is portable from Vax to Sun since it eliminates the * need for byte-swapping. */ for (i=7; i>=0; i--) { b[i] = (unsigned char) (a & 0x000000ff); a >>= 8; } for (i=0; i<8; i++) qwrite(outfile, (char *) &b[i],1); } /* ######################################################################### */ static int qwrite(char *file, char buffer[], int n){ /* * write n bytes from buffer into file * returns number of bytes read (=n) if successful, <=0 if not */ if (noutchar + n > noutmax) return(0); /* buffer overflow */ memcpy(&file[noutchar], buffer, n); noutchar += n; return(n); } /* ######################################################################### */ /* ######################################################################### */ /* Copyright (c) 1993 Association of Universities for Research * in Astronomy. All rights reserved. Produced under National * Aeronautics and Space Administration Contract No. NAS5-26555. */ /* doencode.c Encode 2-D array and write stream of characters on outfile * * This version assumes that A is positive. * * Programmer: R. White Date: 7 May 1991 */ /* ######################################################################### */ static int doencode(char *outfile, int a[], int nx, int ny, unsigned char nbitplanes[3]) { /* char *outfile; output data stream int a[]; Array of values to encode int nx,ny; Array dimensions [nx][ny] unsigned char nbitplanes[3]; Number of bit planes in quadrants */ int nx2, ny2, stat; nx2 = (nx+1)/2; ny2 = (ny+1)/2; /* * Initialize bit output */ start_outputing_bits(); /* * write out the bit planes for each quadrant */ stat = qtree_encode(outfile, &a[0], ny, nx2, ny2, nbitplanes[0]); if (!stat) stat = qtree_encode(outfile, &a[ny2], ny, nx2, ny/2, nbitplanes[1]); if (!stat) stat = qtree_encode(outfile, &a[ny*nx2], ny, nx/2, ny2, nbitplanes[1]); if (!stat) stat = qtree_encode(outfile, &a[ny*nx2+ny2], ny, nx/2, ny/2, nbitplanes[2]); /* * Add zero as an EOF symbol */ output_nybble(outfile, 0); done_outputing_bits(outfile); return(stat); } /* ######################################################################### */ static int doencode64(char *outfile, LONGLONG a[], int nx, int ny, unsigned char nbitplanes[3]) { /* char *outfile; output data stream LONGLONG a[]; Array of values to encode int nx,ny; Array dimensions [nx][ny] unsigned char nbitplanes[3]; Number of bit planes in quadrants */ int nx2, ny2, stat; nx2 = (nx+1)/2; ny2 = (ny+1)/2; /* * Initialize bit output */ start_outputing_bits(); /* * write out the bit planes for each quadrant */ stat = qtree_encode64(outfile, &a[0], ny, nx2, ny2, nbitplanes[0]); if (!stat) stat = qtree_encode64(outfile, &a[ny2], ny, nx2, ny/2, nbitplanes[1]); if (!stat) stat = qtree_encode64(outfile, &a[ny*nx2], ny, nx/2, ny2, nbitplanes[1]); if (!stat) stat = qtree_encode64(outfile, &a[ny*nx2+ny2], ny, nx/2, ny/2, nbitplanes[2]); /* * Add zero as an EOF symbol */ output_nybble(outfile, 0); done_outputing_bits(outfile); return(stat); } /* ######################################################################### */ /* ######################################################################### */ /* Copyright (c) 1993 Association of Universities for Research * in Astronomy. All rights reserved. Produced under National * Aeronautics and Space Administration Contract No. NAS5-26555. */ /* BIT OUTPUT ROUTINES */ static LONGLONG bitcount; /* THE BIT BUFFER */ static int buffer2; /* Bits buffered for output */ static int bits_to_go2; /* Number of bits free in buffer */ /* ######################################################################### */ /* INITIALIZE FOR BIT OUTPUT */ static void start_outputing_bits(void) { buffer2 = 0; /* Buffer is empty to start */ bits_to_go2 = 8; /* with */ bitcount = 0; } /* ######################################################################### */ /* OUTPUT N BITS (N must be <= 8) */ static void output_nbits(char *outfile, int bits, int n) { /* AND mask for the right-most n bits */ static int mask[9] = {0, 1, 3, 7, 15, 31, 63, 127, 255}; /* * insert bits at end of buffer */ buffer2 <<= n; /* buffer2 |= ( bits & ((1<>(-bits_to_go2)) & 0xff); if (noutchar < noutmax) noutchar++; bits_to_go2 += 8; } bitcount += n; } /* ######################################################################### */ /* OUTPUT a 4 bit nybble */ static void output_nybble(char *outfile, int bits) { /* * insert 4 bits at end of buffer */ buffer2 = (buffer2<<4) | ( bits & 15 ); bits_to_go2 -= 4; if (bits_to_go2 <= 0) { /* * buffer2 full, put out top 8 bits */ outfile[noutchar] = ((buffer2>>(-bits_to_go2)) & 0xff); if (noutchar < noutmax) noutchar++; bits_to_go2 += 8; } bitcount += 4; } /* ############################################################################ */ /* OUTPUT array of 4 BITS */ static void output_nnybble(char *outfile, int n, unsigned char array[]) { /* pack the 4 lower bits in each element of the array into the outfile array */ int ii, jj, kk = 0, shift; if (n == 1) { output_nybble(outfile, (int) array[0]); return; } /* forcing byte alignment doesn;t help, and even makes it go slightly slower if (bits_to_go2 != 8) output_nbits(outfile, kk, bits_to_go2); */ if (bits_to_go2 <= 4) { /* just room for 1 nybble; write it out separately */ output_nybble(outfile, array[0]); kk++; /* index to next array element */ if (n == 2) /* only 1 more nybble to write out */ { output_nybble(outfile, (int) array[1]); return; } } /* bits_to_go2 is now in the range 5 - 8 */ shift = 8 - bits_to_go2; /* now write out pairs of nybbles; this does not affect value of bits_to_go2 */ jj = (n - kk) / 2; if (bits_to_go2 == 8) { /* special case if nybbles are aligned on byte boundary */ /* this actually seems to make very little differnece in speed */ buffer2 = 0; for (ii = 0; ii < jj; ii++) { outfile[noutchar] = ((array[kk] & 15)<<4) | (array[kk+1] & 15); kk += 2; noutchar++; } } else { for (ii = 0; ii < jj; ii++) { buffer2 = (buffer2<<8) | ((array[kk] & 15)<<4) | (array[kk+1] & 15); kk += 2; /* buffer2 full, put out top 8 bits */ outfile[noutchar] = ((buffer2>>shift) & 0xff); noutchar++; } } bitcount += (8 * (ii - 1)); /* write out last odd nybble, if present */ if (kk != n) output_nybble(outfile, (int) array[n - 1]); return; } /* ######################################################################### */ /* FLUSH OUT THE LAST BITS */ static void done_outputing_bits(char *outfile) { if(bits_to_go2 < 8) { /* putc(buffer2<nqy) ? nqx : nqy; log2n = (int) (log((float) nqmax)/log(2.0)+0.5); if (nqmax > (1<= 0; bit--) { /* * initial bit buffer */ b = 0; bitbuffer = 0; bits_to_go3 = 0; /* * on first pass copy A to scratch array */ qtree_onebit(a,n,nqx,nqy,scratch,bit); nx = (nqx+1)>>1; ny = (nqy+1)>>1; /* * copy non-zero values to output buffer, which will be written * in reverse order */ if (bufcopy(scratch,nx*ny,buffer,&b,bmax)) { /* * quadtree is expanding data, * change warning code and just fill buffer with bit-map */ write_bdirect(outfile,a,n,nqx,nqy,scratch,bit); goto bitplane_done; } /* * do log2n reductions */ for (k = 1; k>1; ny = (ny+1)>>1; if (bufcopy(scratch,nx*ny,buffer,&b,bmax)) { write_bdirect(outfile,a,n,nqx,nqy,scratch,bit); goto bitplane_done; } } /* * OK, we've got the code in buffer * Write quadtree warning code, then write buffer in reverse order */ output_nybble(outfile,0xF); if (b==0) { if (bits_to_go3>0) { /* * put out the last few bits */ output_nbits(outfile, bitbuffer & ((1<0) { /* * put out the last few bits */ output_nbits(outfile, bitbuffer & ((1<=0; i--) { output_nbits(outfile,buffer[i],8); } } bitplane_done: ; } free(buffer); free(scratch); return(0); } /* ######################################################################### */ static int qtree_encode64(char *outfile, LONGLONG a[], int n, int nqx, int nqy, int nbitplanes) { /* LONGLONG a[]; int n; physical dimension of row in a int nqx; length of row int nqy; length of column (<=n) int nbitplanes; number of bit planes to output */ int log2n, i, k, bit, b, nqmax, nqx2, nqy2, nx, ny; int bmax; /* this potentially needs to be made a 64-bit int to support large arrays */ unsigned char *scratch, *buffer; /* * log2n is log2 of max(nqx,nqy) rounded up to next power of 2 */ nqmax = (nqx>nqy) ? nqx : nqy; log2n = (int) (log((float) nqmax)/log(2.0)+0.5); if (nqmax > (1<= 0; bit--) { /* * initial bit buffer */ b = 0; bitbuffer = 0; bits_to_go3 = 0; /* * on first pass copy A to scratch array */ qtree_onebit64(a,n,nqx,nqy,scratch,bit); nx = (nqx+1)>>1; ny = (nqy+1)>>1; /* * copy non-zero values to output buffer, which will be written * in reverse order */ if (bufcopy(scratch,nx*ny,buffer,&b,bmax)) { /* * quadtree is expanding data, * change warning code and just fill buffer with bit-map */ write_bdirect64(outfile,a,n,nqx,nqy,scratch,bit); goto bitplane_done; } /* * do log2n reductions */ for (k = 1; k>1; ny = (ny+1)>>1; if (bufcopy(scratch,nx*ny,buffer,&b,bmax)) { write_bdirect64(outfile,a,n,nqx,nqy,scratch,bit); goto bitplane_done; } } /* * OK, we've got the code in buffer * Write quadtree warning code, then write buffer in reverse order */ output_nybble(outfile,0xF); if (b==0) { if (bits_to_go3>0) { /* * put out the last few bits */ output_nbits(outfile, bitbuffer & ((1<0) { /* * put out the last few bits */ output_nbits(outfile, bitbuffer & ((1<=0; i--) { output_nbits(outfile,buffer[i],8); } } bitplane_done: ; } free(buffer); free(scratch); return(0); } /* ######################################################################### */ /* * copy non-zero codes from array to buffer */ static int bufcopy(unsigned char a[], int n, unsigned char buffer[], int *b, int bmax) { int i; for (i = 0; i < n; i++) { if (a[i] != 0) { /* * add Huffman code for a[i] to buffer */ bitbuffer |= code[a[i]] << bits_to_go3; bits_to_go3 += ncode[a[i]]; if (bits_to_go3 >= 8) { buffer[*b] = bitbuffer & 0xFF; *b += 1; /* * return warning code if we fill buffer */ if (*b >= bmax) return(1); bitbuffer >>= 8; bits_to_go3 -= 8; } } } return(0); } /* ######################################################################### */ /* * Do first quadtree reduction step on bit BIT of array A. * Results put into B. * */ static void qtree_onebit(int a[], int n, int nx, int ny, unsigned char b[], int bit) { int i, j, k; int b0, b1, b2, b3; int s10, s00; /* * use selected bit to get amount to shift */ b0 = 1<> bit; k += 1; s00 += 2; s10 += 2; } if (j < ny) { /* * row size is odd, do last element in row * s00+1,s10+1 are off edge */ b[k] = ( ((a[s10 ]<<1) & b1) | ((a[s00 ]<<3) & b3) ) >> bit; k += 1; } } if (i < nx) { /* * column size is odd, do last row * s10,s10+1 are off edge */ s00 = n*i; for (j = 0; j> bit; k += 1; s00 += 2; } if (j < ny) { /* * both row and column size are odd, do corner element * s00+1, s10, s10+1 are off edge */ b[k] = ( ((a[s00 ]<<3) & b3) ) >> bit; k += 1; } } } /* ######################################################################### */ /* * Do first quadtree reduction step on bit BIT of array A. * Results put into B. * */ static void qtree_onebit64(LONGLONG a[], int n, int nx, int ny, unsigned char b[], int bit) { int i, j, k; LONGLONG b0, b1, b2, b3; int s10, s00; /* * use selected bit to get amount to shift */ b0 = ((LONGLONG) 1)<> bit); k += 1; s00 += 2; s10 += 2; } if (j < ny) { /* * row size is odd, do last element in row * s00+1,s10+1 are off edge */ b[k] = (unsigned char) (( ((a[s10 ]<<1) & b1) | ((a[s00 ]<<3) & b3) ) >> bit); k += 1; } } if (i < nx) { /* * column size is odd, do last row * s10,s10+1 are off edge */ s00 = n*i; for (j = 0; j> bit); k += 1; s00 += 2; } if (j < ny) { /* * both row and column size are odd, do corner element * s00+1, s10, s10+1 are off edge */ b[k] = (unsigned char) (( ((a[s00 ]<<3) & b3) ) >> bit); k += 1; } } } /* ######################################################################### */ /* * do one quadtree reduction step on array a * results put into b (which may be the same as a) */ static void qtree_reduce(unsigned char a[], int n, int nx, int ny, unsigned char b[]) { int i, j, k; int s10, s00; k = 0; /* k is index of b[i/2,j/2] */ for (i = 0; i #include #include #include #include "fitsio2.h" /* WDP added test to see if min and max are already defined */ #ifndef min #define min(a,b) (((a)<(b))?(a):(b)) #endif #ifndef max #define max(a,b) (((a)>(b))?(a):(b)) #endif static long nextchar; static int decode(unsigned char *infile, int *a, int *nx, int *ny, int *scale); static int decode64(unsigned char *infile, LONGLONG *a, int *nx, int *ny, int *scale); static int hinv(int a[], int nx, int ny, int smooth ,int scale); static int hinv64(LONGLONG a[], int nx, int ny, int smooth ,int scale); static void undigitize(int a[], int nx, int ny, int scale); static void undigitize64(LONGLONG a[], int nx, int ny, int scale); static void unshuffle(int a[], int n, int n2, int tmp[]); static void unshuffle64(LONGLONG a[], int n, int n2, LONGLONG tmp[]); static void hsmooth(int a[], int nxtop, int nytop, int ny, int scale); static void hsmooth64(LONGLONG a[], int nxtop, int nytop, int ny, int scale); static void qread(unsigned char *infile,char *a, int n); static int readint(unsigned char *infile); static LONGLONG readlonglong(unsigned char *infile); static int dodecode(unsigned char *infile, int a[], int nx, int ny, unsigned char nbitplanes[3]); static int dodecode64(unsigned char *infile, LONGLONG a[], int nx, int ny, unsigned char nbitplanes[3]); static int qtree_decode(unsigned char *infile, int a[], int n, int nqx, int nqy, int nbitplanes); static int qtree_decode64(unsigned char *infile, LONGLONG a[], int n, int nqx, int nqy, int nbitplanes); static void start_inputing_bits(void); static int input_bit(unsigned char *infile); static int input_nbits(unsigned char *infile, int n); /* make input_nybble a separate routine, for added effiency */ /* #define input_nybble(infile) input_nbits(infile,4) */ static int input_nybble(unsigned char *infile); static int input_nnybble(unsigned char *infile, int n, unsigned char *array); static void qtree_expand(unsigned char *infile, unsigned char a[], int nx, int ny, unsigned char b[]); static void qtree_bitins(unsigned char a[], int nx, int ny, int b[], int n, int bit); static void qtree_bitins64(unsigned char a[], int nx, int ny, LONGLONG b[], int n, int bit); static void qtree_copy(unsigned char a[], int nx, int ny, unsigned char b[], int n); static void read_bdirect(unsigned char *infile, int a[], int n, int nqx, int nqy, unsigned char scratch[], int bit); static void read_bdirect64(unsigned char *infile, LONGLONG a[], int n, int nqx, int nqy, unsigned char scratch[], int bit); static int input_huffman(unsigned char *infile); /* ---------------------------------------------------------------------- */ int fits_hdecompress(unsigned char *input, int smooth, int *a, int *ny, int *nx, int *scale, int *status) { /* decompress the input byte stream using the H-compress algorithm input - input array of compressed bytes a - pre-allocated array to hold the output uncompressed image nx - returned X axis size ny - returned Y axis size NOTE: the nx and ny dimensions as defined within this code are reversed from the usual FITS notation. ny is the fastest varying dimension, which is usually considered the X axis in the FITS image display */ int stat; if (*status > 0) return(*status); /* decode the input array */ FFLOCK; /* decode uses the nextchar global variable */ stat = decode(input, a, nx, ny, scale); FFUNLOCK; *status = stat; if (stat) return(*status); /* * Un-Digitize */ undigitize(a, *nx, *ny, *scale); /* * Inverse H-transform */ stat = hinv(a, *nx, *ny, smooth, *scale); *status = stat; return(*status); } /* ---------------------------------------------------------------------- */ int fits_hdecompress64(unsigned char *input, int smooth, LONGLONG *a, int *ny, int *nx, int *scale, int *status) { /* decompress the input byte stream using the H-compress algorithm input - input array of compressed bytes a - pre-allocated array to hold the output uncompressed image nx - returned X axis size ny - returned Y axis size NOTE: the nx and ny dimensions as defined within this code are reversed from the usual FITS notation. ny is the fastest varying dimension, which is usually considered the X axis in the FITS image display */ int stat, *iarray, ii, nval; if (*status > 0) return(*status); /* decode the input array */ FFLOCK; /* decode uses the nextchar global variable */ stat = decode64(input, a, nx, ny, scale); FFUNLOCK; *status = stat; if (stat) return(*status); /* * Un-Digitize */ undigitize64(a, *nx, *ny, *scale); /* * Inverse H-transform */ stat = hinv64(a, *nx, *ny, smooth, *scale); *status = stat; /* pack the I*8 values back into an I*4 array */ iarray = (int *) a; nval = (*nx) * (*ny); for (ii = 0; ii < nval; ii++) iarray[ii] = (int) a[ii]; return(*status); } /* ############################################################################ */ /* ############################################################################ */ /* Copyright (c) 1993 Association of Universities for Research * in Astronomy. All rights reserved. Produced under National * Aeronautics and Space Administration Contract No. NAS5-26555. */ /* hinv.c Inverse H-transform of NX x NY integer image * * Programmer: R. White Date: 23 July 1993 */ /* ############################################################################ */ static int hinv(int a[], int nx, int ny, int smooth ,int scale) /* int smooth; 0 for no smoothing, else smooth during inversion int scale; used if smoothing is specified */ { int nmax, log2n, i, j, k; int nxtop,nytop,nxf,nyf,c; int oddx,oddy; int shift, bit0, bit1, bit2, mask0, mask1, mask2, prnd0, prnd1, prnd2, nrnd0, nrnd1, nrnd2, lowbit0, lowbit1; int h0, hx, hy, hc; int s10, s00; int *tmp; /* * log2n is log2 of max(nx,ny) rounded up to next power of 2 */ nmax = (nx>ny) ? nx : ny; log2n = (int) (log((float) nmax)/log(2.0)+0.5); if ( nmax > (1<> 1; prnd1 = bit1 >> 1; prnd2 = bit2 >> 1; nrnd0 = prnd0 - 1; nrnd1 = prnd1 - 1; nrnd2 = prnd2 - 1; /* * round h0 to multiple of bit2 */ a[0] = (a[0] + ((a[0] >= 0) ? prnd2 : nrnd2)) & mask2; /* * do log2n expansions * * We're indexing a as a 2-D array with dimensions (nx,ny). */ nxtop = 1; nytop = 1; nxf = nx; nyf = ny; c = 1<=0; k--) { /* * this somewhat cryptic code generates the sequence * ntop[k-1] = (ntop[k]+1)/2, where ntop[log2n] = n */ c = c>>1; nxtop = nxtop<<1; nytop = nytop<<1; if (nxf <= c) { nxtop -= 1; } else { nxf -= c; } if (nyf <= c) { nytop -= 1; } else { nyf -= c; } /* * double shift and fix nrnd0 (because prnd0=0) on last pass */ if (k == 0) { nrnd0 = 0; shift = 2; } /* * unshuffle in each dimension to interleave coefficients */ for (i = 0; i= 0) ? prnd1 : nrnd1)) & mask1; hy = (hy + ((hy >= 0) ? prnd1 : nrnd1)) & mask1; hc = (hc + ((hc >= 0) ? prnd0 : nrnd0)) & mask0; /* * propagate bit0 of hc to hx,hy */ lowbit0 = hc & bit0; hx = (hx >= 0) ? (hx - lowbit0) : (hx + lowbit0); hy = (hy >= 0) ? (hy - lowbit0) : (hy + lowbit0); /* * Propagate bits 0 and 1 of hc,hx,hy to h0. * This could be simplified if we assume h0>0, but then * the inversion would not be lossless for images with * negative pixels. */ lowbit1 = (hc ^ hx ^ hy) & bit1; h0 = (h0 >= 0) ? (h0 + lowbit0 - lowbit1) : (h0 + ((lowbit0 == 0) ? lowbit1 : (lowbit0-lowbit1))); /* * Divide sums by 2 (4 last time) */ a[s10+1] = (h0 + hx + hy + hc) >> shift; a[s10 ] = (h0 + hx - hy - hc) >> shift; a[s00+1] = (h0 - hx + hy - hc) >> shift; a[s00 ] = (h0 - hx - hy + hc) >> shift; s00 += 2; s10 += 2; } if (oddy) { /* * do last element in row if row length is odd * s00+1, s10+1 are off edge */ h0 = a[s00 ]; hx = a[s10 ]; hx = ((hx >= 0) ? (hx+prnd1) : (hx+nrnd1)) & mask1; lowbit1 = hx & bit1; h0 = (h0 >= 0) ? (h0 - lowbit1) : (h0 + lowbit1); a[s10 ] = (h0 + hx) >> shift; a[s00 ] = (h0 - hx) >> shift; } } if (oddx) { /* * do last row if column length is odd * s10, s10+1 are off edge */ s00 = ny*i; for (j = 0; j= 0) ? (hy+prnd1) : (hy+nrnd1)) & mask1; lowbit1 = hy & bit1; h0 = (h0 >= 0) ? (h0 - lowbit1) : (h0 + lowbit1); a[s00+1] = (h0 + hy) >> shift; a[s00 ] = (h0 - hy) >> shift; s00 += 2; } if (oddy) { /* * do corner element if both row and column lengths are odd * s00+1, s10, s10+1 are off edge */ h0 = a[s00 ]; a[s00 ] = h0 >> shift; } } /* * divide all the masks and rounding values by 2 */ bit2 = bit1; bit1 = bit0; bit0 = bit0 >> 1; mask1 = mask0; mask0 = mask0 >> 1; prnd1 = prnd0; prnd0 = prnd0 >> 1; nrnd1 = nrnd0; nrnd0 = prnd0 - 1; } free(tmp); return(0); } /* ############################################################################ */ static int hinv64(LONGLONG a[], int nx, int ny, int smooth ,int scale) /* int smooth; 0 for no smoothing, else smooth during inversion int scale; used if smoothing is specified */ { int nmax, log2n, i, j, k; int nxtop,nytop,nxf,nyf,c; int oddx,oddy; int shift; LONGLONG mask0, mask1, mask2, prnd0, prnd1, prnd2, bit0, bit1, bit2; LONGLONG nrnd0, nrnd1, nrnd2, lowbit0, lowbit1; LONGLONG h0, hx, hy, hc; int s10, s00; LONGLONG *tmp; /* * log2n is log2 of max(nx,ny) rounded up to next power of 2 */ nmax = (nx>ny) ? nx : ny; log2n = (int) (log((float) nmax)/log(2.0)+0.5); if ( nmax > (1<> 1; prnd1 = bit1 >> 1; prnd2 = bit2 >> 1; nrnd0 = prnd0 - 1; nrnd1 = prnd1 - 1; nrnd2 = prnd2 - 1; /* * round h0 to multiple of bit2 */ a[0] = (a[0] + ((a[0] >= 0) ? prnd2 : nrnd2)) & mask2; /* * do log2n expansions * * We're indexing a as a 2-D array with dimensions (nx,ny). */ nxtop = 1; nytop = 1; nxf = nx; nyf = ny; c = 1<=0; k--) { /* * this somewhat cryptic code generates the sequence * ntop[k-1] = (ntop[k]+1)/2, where ntop[log2n] = n */ c = c>>1; nxtop = nxtop<<1; nytop = nytop<<1; if (nxf <= c) { nxtop -= 1; } else { nxf -= c; } if (nyf <= c) { nytop -= 1; } else { nyf -= c; } /* * double shift and fix nrnd0 (because prnd0=0) on last pass */ if (k == 0) { nrnd0 = 0; shift = 2; } /* * unshuffle in each dimension to interleave coefficients */ for (i = 0; i= 0) ? prnd1 : nrnd1)) & mask1; hy = (hy + ((hy >= 0) ? prnd1 : nrnd1)) & mask1; hc = (hc + ((hc >= 0) ? prnd0 : nrnd0)) & mask0; /* * propagate bit0 of hc to hx,hy */ lowbit0 = hc & bit0; hx = (hx >= 0) ? (hx - lowbit0) : (hx + lowbit0); hy = (hy >= 0) ? (hy - lowbit0) : (hy + lowbit0); /* * Propagate bits 0 and 1 of hc,hx,hy to h0. * This could be simplified if we assume h0>0, but then * the inversion would not be lossless for images with * negative pixels. */ lowbit1 = (hc ^ hx ^ hy) & bit1; h0 = (h0 >= 0) ? (h0 + lowbit0 - lowbit1) : (h0 + ((lowbit0 == 0) ? lowbit1 : (lowbit0-lowbit1))); /* * Divide sums by 2 (4 last time) */ a[s10+1] = (h0 + hx + hy + hc) >> shift; a[s10 ] = (h0 + hx - hy - hc) >> shift; a[s00+1] = (h0 - hx + hy - hc) >> shift; a[s00 ] = (h0 - hx - hy + hc) >> shift; s00 += 2; s10 += 2; } if (oddy) { /* * do last element in row if row length is odd * s00+1, s10+1 are off edge */ h0 = a[s00 ]; hx = a[s10 ]; hx = ((hx >= 0) ? (hx+prnd1) : (hx+nrnd1)) & mask1; lowbit1 = hx & bit1; h0 = (h0 >= 0) ? (h0 - lowbit1) : (h0 + lowbit1); a[s10 ] = (h0 + hx) >> shift; a[s00 ] = (h0 - hx) >> shift; } } if (oddx) { /* * do last row if column length is odd * s10, s10+1 are off edge */ s00 = ny*i; for (j = 0; j= 0) ? (hy+prnd1) : (hy+nrnd1)) & mask1; lowbit1 = hy & bit1; h0 = (h0 >= 0) ? (h0 - lowbit1) : (h0 + lowbit1); a[s00+1] = (h0 + hy) >> shift; a[s00 ] = (h0 - hy) >> shift; s00 += 2; } if (oddy) { /* * do corner element if both row and column lengths are odd * s00+1, s10, s10+1 are off edge */ h0 = a[s00 ]; a[s00 ] = h0 >> shift; } } /* * divide all the masks and rounding values by 2 */ bit2 = bit1; bit1 = bit0; bit0 = bit0 >> 1; mask1 = mask0; mask0 = mask0 >> 1; prnd1 = prnd0; prnd0 = prnd0 >> 1; nrnd1 = nrnd0; nrnd0 = prnd0 - 1; } free(tmp); return(0); } /* ############################################################################ */ static void unshuffle(int a[], int n, int n2, int tmp[]) /* int a[]; array to shuffle int n; number of elements to shuffle int n2; second dimension int tmp[]; scratch storage */ { int i; int nhalf; int *p1, *p2, *pt; /* * copy 2nd half of array to tmp */ nhalf = (n+1)>>1; pt = tmp; p1 = &a[n2*nhalf]; /* pointer to a[i] */ for (i=nhalf; i= 0; i--) { *p1 = *p2; p2 -= n2; p1 -= (n2+n2); } /* * now distribute 2nd half of array (in tmp) to odd elements */ pt = tmp; p1 = &a[n2]; /* pointer to a[i] */ for (i=1; i>1; pt = tmp; p1 = &a[n2*nhalf]; /* pointer to a[i] */ for (i=nhalf; i= 0; i--) { *p1 = *p2; p2 -= n2; p1 -= (n2+n2); } /* * now distribute 2nd half of array (in tmp) to odd elements */ pt = tmp; p1 = &a[n2]; /* pointer to a[i] */ for (i=1; i> 1); if (smax <= 0) return; ny2 = ny << 1; /* * We're indexing a as a 2-D array with dimensions (nxtop,ny) of which * only (nxtop,nytop) are used. The coefficients on the edge of the * array are not adjusted (which is why the loops below start at 2 * instead of 0 and end at nxtop-2 instead of nxtop.) */ /* * Adjust x difference hx */ for (i = 2; i=0, dmin<=0. */ if (dmin < dmax) { diff = max( min(diff, dmax), dmin); /* * Compute change in slope limited to range +/- smax. * Careful with rounding negative numbers when using * shift for divide by 8. */ s = diff-(a[s10]<<3); s = (s>=0) ? (s>>3) : ((s+7)>>3) ; s = max( min(s, smax), -smax); a[s10] = a[s10]+s; } s00 += 2; s10 += 2; } } /* * Adjust y difference hy */ for (i = 0; i=0) ? (s>>3) : ((s+7)>>3) ; s = max( min(s, smax), -smax); a[s00+1] = a[s00+1]+s; } s00 += 2; s10 += 2; } } /* * Adjust curvature difference hc */ for (i = 2; i=0, dmin<=0. */ if (dmin < dmax) { diff = max( min(diff, dmax), dmin); /* * Compute change in slope limited to range +/- smax. * Careful with rounding negative numbers when using * shift for divide by 64. */ s = diff-(a[s10+1]<<6); s = (s>=0) ? (s>>6) : ((s+63)>>6) ; s = max( min(s, smax), -smax); a[s10+1] = a[s10+1]+s; } s00 += 2; s10 += 2; } } } /* ############################################################################ */ static void hsmooth64(LONGLONG a[], int nxtop, int nytop, int ny, int scale) /* LONGLONG a[]; array of H-transform coefficients int nxtop,nytop; size of coefficient block to use int ny; actual 1st dimension of array int scale; truncation scale factor that was used */ { int i, j; int ny2, s10, s00; LONGLONG hm, h0, hp, hmm, hpm, hmp, hpp, hx2, hy2, diff, dmax, dmin, s, smax, m1, m2; /* * Maximum change in coefficients is determined by scale factor. * Since we rounded during division (see digitize.c), the biggest * permitted change is scale/2. */ smax = (scale >> 1); if (smax <= 0) return; ny2 = ny << 1; /* * We're indexing a as a 2-D array with dimensions (nxtop,ny) of which * only (nxtop,nytop) are used. The coefficients on the edge of the * array are not adjusted (which is why the loops below start at 2 * instead of 0 and end at nxtop-2 instead of nxtop.) */ /* * Adjust x difference hx */ for (i = 2; i=0, dmin<=0. */ if (dmin < dmax) { diff = max( min(diff, dmax), dmin); /* * Compute change in slope limited to range +/- smax. * Careful with rounding negative numbers when using * shift for divide by 8. */ s = diff-(a[s10]<<3); s = (s>=0) ? (s>>3) : ((s+7)>>3) ; s = max( min(s, smax), -smax); a[s10] = a[s10]+s; } s00 += 2; s10 += 2; } } /* * Adjust y difference hy */ for (i = 0; i=0) ? (s>>3) : ((s+7)>>3) ; s = max( min(s, smax), -smax); a[s00+1] = a[s00+1]+s; } s00 += 2; s10 += 2; } } /* * Adjust curvature difference hc */ for (i = 2; i=0, dmin<=0. */ if (dmin < dmax) { diff = max( min(diff, dmax), dmin); /* * Compute change in slope limited to range +/- smax. * Careful with rounding negative numbers when using * shift for divide by 64. */ s = diff-(a[s10+1]<<6); s = (s>=0) ? (s>>6) : ((s+63)>>6) ; s = max( min(s, smax), -smax); a[s10+1] = a[s10+1]+s; } s00 += 2; s10 += 2; } } } /* ############################################################################ */ /* ############################################################################ */ /* Copyright (c) 1993 Association of Universities for Research * in Astronomy. All rights reserved. Produced under National * Aeronautics and Space Administration Contract No. NAS5-26555. */ /* undigitize.c undigitize H-transform * * Programmer: R. White Date: 9 May 1991 */ /* ############################################################################ */ static void undigitize(int a[], int nx, int ny, int scale) { int *p; /* * multiply by scale */ if (scale <= 1) return; for (p=a; p <= &a[nx*ny-1]; p++) *p = (*p)*scale; } /* ############################################################################ */ static void undigitize64(LONGLONG a[], int nx, int ny, int scale) { LONGLONG *p, scale64; /* * multiply by scale */ if (scale <= 1) return; scale64 = (LONGLONG) scale; /* use a 64-bit int for efficiency in the big loop */ for (p=a; p <= &a[nx*ny-1]; p++) *p = (*p)*scale64; } /* ############################################################################ */ /* ############################################################################ */ /* Copyright (c) 1993 Association of Universities for Research * in Astronomy. All rights reserved. Produced under National * Aeronautics and Space Administration Contract No. NAS5-26555. */ /* decode.c read codes from infile and construct array * * Programmer: R. White Date: 2 February 1994 */ static char code_magic[2] = { (char)0xDD, (char)0x99 }; /* ############################################################################ */ static int decode(unsigned char *infile, int *a, int *nx, int *ny, int *scale) /* char *infile; input file int *a; address of output array [nx][ny] int *nx,*ny; size of output array int *scale; scale factor for digitization */ { LONGLONG sumall; int stat; unsigned char nbitplanes[3]; char tmagic[2]; /* initialize the byte read position to the beginning of the array */; nextchar = 0; /* * File starts either with special 2-byte magic code or with * FITS keyword "SIMPLE =" */ qread(infile, tmagic, sizeof(tmagic)); /* * check for correct magic code value */ if (memcmp(tmagic,code_magic,sizeof(code_magic)) != 0) { ffpmsg("bad file format"); return(DATA_DECOMPRESSION_ERR); } *nx =readint(infile); /* x size of image */ *ny =readint(infile); /* y size of image */ *scale=readint(infile); /* scale factor for digitization */ /* sum of all pixels */ sumall=readlonglong(infile); /* # bits in quadrants */ qread(infile, (char *) nbitplanes, sizeof(nbitplanes)); stat = dodecode(infile, a, *nx, *ny, nbitplanes); /* * put sum of all pixels back into pixel 0 */ a[0] = (int) sumall; return(stat); } /* ############################################################################ */ static int decode64(unsigned char *infile, LONGLONG *a, int *nx, int *ny, int *scale) /* char *infile; input file LONGLONG *a; address of output array [nx][ny] int *nx,*ny; size of output array int *scale; scale factor for digitization */ { int stat; LONGLONG sumall; unsigned char nbitplanes[3]; char tmagic[2]; /* initialize the byte read position to the beginning of the array */; nextchar = 0; /* * File starts either with special 2-byte magic code or with * FITS keyword "SIMPLE =" */ qread(infile, tmagic, sizeof(tmagic)); /* * check for correct magic code value */ if (memcmp(tmagic,code_magic,sizeof(code_magic)) != 0) { ffpmsg("bad file format"); return(DATA_DECOMPRESSION_ERR); } *nx =readint(infile); /* x size of image */ *ny =readint(infile); /* y size of image */ *scale=readint(infile); /* scale factor for digitization */ /* sum of all pixels */ sumall=readlonglong(infile); /* # bits in quadrants */ qread(infile, (char *) nbitplanes, sizeof(nbitplanes)); stat = dodecode64(infile, a, *nx, *ny, nbitplanes); /* * put sum of all pixels back into pixel 0 */ a[0] = sumall; return(stat); } /* ############################################################################ */ /* ############################################################################ */ /* Copyright (c) 1993 Association of Universities for Research * in Astronomy. All rights reserved. Produced under National * Aeronautics and Space Administration Contract No. NAS5-26555. */ /* dodecode.c Decode stream of characters on infile and return array * * This version encodes the different quadrants separately * * Programmer: R. White Date: 9 May 1991 */ /* ############################################################################ */ static int dodecode(unsigned char *infile, int a[], int nx, int ny, unsigned char nbitplanes[3]) /* int a[]; int nx,ny; Array dimensions are [nx][ny] unsigned char nbitplanes[3]; Number of bit planes in quadrants */ { int i, nel, nx2, ny2, stat; nel = nx*ny; nx2 = (nx+1)/2; ny2 = (ny+1)/2; /* * initialize a to zero */ for (i=0; inqy) ? nqx : nqy; log2n = (int) (log((float) nqmax)/log(2.0)+0.5); if (nqmax > (1<= 0; bit--) { /* * Was bitplane was quadtree-coded or written directly? */ b = input_nybble(infile); if(b == 0) { /* * bit map was written directly */ read_bdirect(infile,a,n,nqx,nqy,scratch,bit); } else if (b != 0xf) { ffpmsg("qtree_decode: bad format code"); return(DATA_DECOMPRESSION_ERR); } else { /* * bitmap was quadtree-coded, do log2n expansions * * read first code */ scratch[0] = input_huffman(infile); /* * now do log2n expansions, reading codes from file as necessary */ nx = 1; ny = 1; nfx = nqx; nfy = nqy; c = 1<>1; nx = nx<<1; ny = ny<<1; if (nfx <= c) { nx -= 1; } else { nfx -= c; } if (nfy <= c) { ny -= 1; } else { nfy -= c; } qtree_expand(infile,scratch,nx,ny,scratch); } /* * now copy last set of 4-bit codes to bitplane bit of array a */ qtree_bitins(scratch,nqx,nqy,a,n,bit); } } free(scratch); return(0); } /* ############################################################################ */ static int qtree_decode64(unsigned char *infile, LONGLONG a[], int n, int nqx, int nqy, int nbitplanes) /* char *infile; LONGLONG a[]; a is 2-D array with dimensions (n,n) int n; length of full row in a int nqx; partial length of row to decode int nqy; partial length of column (<=n) int nbitplanes; number of bitplanes to decode */ { int log2n, k, bit, b, nqmax; int nx,ny,nfx,nfy,c; int nqx2, nqy2; unsigned char *scratch; /* * log2n is log2 of max(nqx,nqy) rounded up to next power of 2 */ nqmax = (nqx>nqy) ? nqx : nqy; log2n = (int) (log((float) nqmax)/log(2.0)+0.5); if (nqmax > (1<= 0; bit--) { /* * Was bitplane was quadtree-coded or written directly? */ b = input_nybble(infile); if(b == 0) { /* * bit map was written directly */ read_bdirect64(infile,a,n,nqx,nqy,scratch,bit); } else if (b != 0xf) { ffpmsg("qtree_decode64: bad format code"); return(DATA_DECOMPRESSION_ERR); } else { /* * bitmap was quadtree-coded, do log2n expansions * * read first code */ scratch[0] = input_huffman(infile); /* * now do log2n expansions, reading codes from file as necessary */ nx = 1; ny = 1; nfx = nqx; nfy = nqy; c = 1<>1; nx = nx<<1; ny = ny<<1; if (nfx <= c) { nx -= 1; } else { nfx -= c; } if (nfy <= c) { ny -= 1; } else { nfy -= c; } qtree_expand(infile,scratch,nx,ny,scratch); } /* * now copy last set of 4-bit codes to bitplane bit of array a */ qtree_bitins64(scratch,nqx,nqy,a,n,bit); } } free(scratch); return(0); } /* ############################################################################ */ /* * do one quadtree expansion step on array a[(nqx+1)/2,(nqy+1)/2] * results put into b[nqx,nqy] (which may be the same as a) */ static void qtree_expand(unsigned char *infile, unsigned char a[], int nx, int ny, unsigned char b[]) { int i; /* * first copy a to b, expanding each 4-bit value */ qtree_copy(a,nx,ny,b,ny); /* * now read new 4-bit values into b for each non-zero element */ for (i = nx*ny-1; i >= 0; i--) { if (b[i]) b[i] = input_huffman(infile); } } /* ############################################################################ */ /* * copy 4-bit values from a[(nx+1)/2,(ny+1)/2] to b[nx,ny], expanding * each value to 2x2 pixels * a,b may be same array */ static void qtree_copy(unsigned char a[], int nx, int ny, unsigned char b[], int n) /* int n; declared y dimension of b */ { int i, j, k, nx2, ny2; int s00, s10; /* * first copy 4-bit values to b * start at end in case a,b are same array */ nx2 = (nx+1)/2; ny2 = (ny+1)/2; k = ny2*(nx2-1)+ny2-1; /* k is index of a[i,j] */ for (i = nx2-1; i >= 0; i--) { s00 = 2*(n*i+ny2-1); /* s00 is index of b[2*i,2*j] */ for (j = ny2-1; j >= 0; j--) { b[s00] = a[k]; k -= 1; s00 -= 2; } } /* * now expand each 2x2 block */ for (i = 0; i>1) & 1; b[s00+1] = (b[s00]>>2) & 1; b[s00 ] = (b[s00]>>3) & 1; */ s00 += 2; s10 += 2; } if (j < ny) { /* * row size is odd, do last element in row * s00+1, s10+1 are off edge */ /* not worth converting this to use 16 case statements */ b[s10 ] = (b[s00]>>1) & 1; b[s00 ] = (b[s00]>>3) & 1; } } if (i < nx) { /* * column size is odd, do last row * s10, s10+1 are off edge */ s00 = n*i; for (j = 0; j>2) & 1; b[s00 ] = (b[s00]>>3) & 1; s00 += 2; } if (j < ny) { /* * both row and column size are odd, do corner element * s00+1, s10, s10+1 are off edge */ /* not worth converting this to use 16 case statements */ b[s00 ] = (b[s00]>>3) & 1; } } } /* ############################################################################ */ /* * Copy 4-bit values from a[(nx+1)/2,(ny+1)/2] to b[nx,ny], expanding * each value to 2x2 pixels and inserting into bitplane BIT of B. * A,B may NOT be same array (it wouldn't make sense to be inserting * bits into the same array anyway.) */ static void qtree_bitins(unsigned char a[], int nx, int ny, int b[], int n, int bit) /* int n; declared y dimension of b */ { int i, j, k; int s00; int plane_val; plane_val = 1 << bit; /* * expand each 2x2 block */ k = 0; /* k is index of a[i/2,j/2] */ for (i = 0; i>1) & 1) << bit; b[s00+1] |= ((a[k]>>2) & 1) << bit; b[s00 ] |= ((a[k]>>3) & 1) << bit; */ s00 += 2; /* s10 += 2; */ k += 1; } if (j < ny) { /* * row size is odd, do last element in row * s00+1, s10+1 are off edge */ switch (a[k]) { case(0): break; case(1): break; case(2): b[s00+n ] |= plane_val; break; case(3): b[s00+n ] |= plane_val; break; case(4): break; case(5): break; case(6): b[s00+n ] |= plane_val; break; case(7): b[s00+n ] |= plane_val; break; case(8): b[s00 ] |= plane_val; break; case(9): b[s00 ] |= plane_val; break; case(10): b[s00+n ] |= plane_val; b[s00 ] |= plane_val; break; case(11): b[s00+n ] |= plane_val; b[s00 ] |= plane_val; break; case(12): b[s00 ] |= plane_val; break; case(13): b[s00 ] |= plane_val; break; case(14): b[s00+n ] |= plane_val; b[s00 ] |= plane_val; break; case(15): b[s00+n ] |= plane_val; b[s00 ] |= plane_val; break; } /* b[s10 ] |= ((a[k]>>1) & 1) << bit; b[s00 ] |= ((a[k]>>3) & 1) << bit; */ k += 1; } } if (i < nx) { /* * column size is odd, do last row * s10, s10+1 are off edge */ s00 = n*i; for (j = 0; j>2) & 1) << bit; b[s00 ] |= ((a[k]>>3) & 1) << bit; */ s00 += 2; k += 1; } if (j < ny) { /* * both row and column size are odd, do corner element * s00+1, s10, s10+1 are off edge */ switch (a[k]) { case(0): break; case(1): break; case(2): break; case(3): break; case(4): break; case(5): break; case(6): break; case(7): break; case(8): b[s00 ] |= plane_val; break; case(9): b[s00 ] |= plane_val; break; case(10): b[s00 ] |= plane_val; break; case(11): b[s00 ] |= plane_val; break; case(12): b[s00 ] |= plane_val; break; case(13): b[s00 ] |= plane_val; break; case(14): b[s00 ] |= plane_val; break; case(15): b[s00 ] |= plane_val; break; } /* b[s00 ] |= ((a[k]>>3) & 1) << bit; */ k += 1; } } } /* ############################################################################ */ /* * Copy 4-bit values from a[(nx+1)/2,(ny+1)/2] to b[nx,ny], expanding * each value to 2x2 pixels and inserting into bitplane BIT of B. * A,B may NOT be same array (it wouldn't make sense to be inserting * bits into the same array anyway.) */ static void qtree_bitins64(unsigned char a[], int nx, int ny, LONGLONG b[], int n, int bit) /* int n; declared y dimension of b */ { int i, j, k; int s00; LONGLONG plane_val; plane_val = ((LONGLONG) 1) << bit; /* * expand each 2x2 block */ k = 0; /* k is index of a[i/2,j/2] */ for (i = 0; i>1) & 1) << bit; b[s00+1] |= ((((LONGLONG)a[k])>>2) & 1) << bit; b[s00 ] |= ((((LONGLONG)a[k])>>3) & 1) << bit; */ s00 += 2; /* s10 += 2; */ k += 1; } if (j < ny) { /* * row size is odd, do last element in row * s00+1, s10+1 are off edge */ switch (a[k]) { case(0): break; case(1): break; case(2): b[s00+n ] |= plane_val; break; case(3): b[s00+n ] |= plane_val; break; case(4): break; case(5): break; case(6): b[s00+n ] |= plane_val; break; case(7): b[s00+n ] |= plane_val; break; case(8): b[s00 ] |= plane_val; break; case(9): b[s00 ] |= plane_val; break; case(10): b[s00+n ] |= plane_val; b[s00 ] |= plane_val; break; case(11): b[s00+n ] |= plane_val; b[s00 ] |= plane_val; break; case(12): b[s00 ] |= plane_val; break; case(13): b[s00 ] |= plane_val; break; case(14): b[s00+n ] |= plane_val; b[s00 ] |= plane_val; break; case(15): b[s00+n ] |= plane_val; b[s00 ] |= plane_val; break; } /* b[s10 ] |= ((((LONGLONG)a[k])>>1) & 1) << bit; b[s00 ] |= ((((LONGLONG)a[k])>>3) & 1) << bit; */ k += 1; } } if (i < nx) { /* * column size is odd, do last row * s10, s10+1 are off edge */ s00 = n*i; for (j = 0; j>2) & 1) << bit; b[s00 ] |= ((((LONGLONG)a[k])>>3) & 1) << bit; */ s00 += 2; k += 1; } if (j < ny) { /* * both row and column size are odd, do corner element * s00+1, s10, s10+1 are off edge */ switch (a[k]) { case(0): break; case(1): break; case(2): break; case(3): break; case(4): break; case(5): break; case(6): break; case(7): break; case(8): b[s00 ] |= plane_val; break; case(9): b[s00 ] |= plane_val; break; case(10): b[s00 ] |= plane_val; break; case(11): b[s00 ] |= plane_val; break; case(12): b[s00 ] |= plane_val; break; case(13): b[s00 ] |= plane_val; break; case(14): b[s00 ] |= plane_val; break; case(15): b[s00 ] |= plane_val; break; } /* b[s00 ] |= ((((LONGLONG)a[k])>>3) & 1) << bit; */ k += 1; } } } /* ############################################################################ */ static void read_bdirect(unsigned char *infile, int a[], int n, int nqx, int nqy, unsigned char scratch[], int bit) { /* * read bit image packed 4 pixels/nybble */ /* int i; for (i = 0; i < ((nqx+1)/2) * ((nqy+1)/2); i++) { scratch[i] = input_nybble(infile); } */ input_nnybble(infile, ((nqx+1)/2) * ((nqy+1)/2), scratch); /* * insert in bitplane BIT of image A */ qtree_bitins(scratch,nqx,nqy,a,n,bit); } /* ############################################################################ */ static void read_bdirect64(unsigned char *infile, LONGLONG a[], int n, int nqx, int nqy, unsigned char scratch[], int bit) { /* * read bit image packed 4 pixels/nybble */ /* int i; for (i = 0; i < ((nqx+1)/2) * ((nqy+1)/2); i++) { scratch[i] = input_nybble(infile); } */ input_nnybble(infile, ((nqx+1)/2) * ((nqy+1)/2), scratch); /* * insert in bitplane BIT of image A */ qtree_bitins64(scratch,nqx,nqy,a,n,bit); } /* ############################################################################ */ /* * Huffman decoding for fixed codes * * Coded values range from 0-15 * * Huffman code values (hex): * * 3e, 00, 01, 08, 02, 09, 1a, 1b, * 03, 1c, 0a, 1d, 0b, 1e, 3f, 0c * * and number of bits in each code: * * 6, 3, 3, 4, 3, 4, 5, 5, * 3, 5, 4, 5, 4, 5, 6, 4 */ static int input_huffman(unsigned char *infile) { int c; /* * get first 3 bits to start */ c = input_nbits(infile,3); if (c < 4) { /* * this is all we need * return 1,2,4,8 for c=0,1,2,3 */ return(1<>bits_to_go) & 1); } /* ############################################################################ */ /* INPUT N BITS (N must be <= 8) */ static int input_nbits(unsigned char *infile, int n) { /* AND mask for retreiving the right-most n bits */ static int mask[9] = {0, 1, 3, 7, 15, 31, 63, 127, 255}; if (bits_to_go < n) { /* * need another byte's worth of bits */ buffer2 = (buffer2<<8) | (int) infile[nextchar]; nextchar++; bits_to_go += 8; } /* * now pick off the first n bits */ bits_to_go -= n; /* there was a slight gain in speed by replacing the following line */ /* return( (buffer2>>bits_to_go) & ((1<>bits_to_go) & (*(mask+n)) ); } /* ############################################################################ */ /* INPUT 4 BITS */ static int input_nybble(unsigned char *infile) { if (bits_to_go < 4) { /* * need another byte's worth of bits */ buffer2 = (buffer2<<8) | (int) infile[nextchar]; nextchar++; bits_to_go += 8; } /* * now pick off the first 4 bits */ bits_to_go -= 4; return( (buffer2>>bits_to_go) & 15 ); } /* ############################################################################ */ /* INPUT array of 4 BITS */ static int input_nnybble(unsigned char *infile, int n, unsigned char array[]) { /* copy n 4-bit nybbles from infile to the lower 4 bits of array */ int ii, kk, shift1, shift2; /* forcing byte alignment doesn;t help, and even makes it go slightly slower if (bits_to_go != 8) input_nbits(infile, bits_to_go); */ if (n == 1) { array[0] = input_nybble(infile); return(0); } if (bits_to_go == 8) { /* already have 2 full nybbles in buffer2, so backspace the infile array to reuse last char */ nextchar--; bits_to_go = 0; } /* bits_to_go now has a value in the range 0 - 7. After adding */ /* another byte, bits_to_go effectively will be in range 8 - 15 */ shift1 = bits_to_go + 4; /* shift1 will be in range 4 - 11 */ shift2 = bits_to_go; /* shift2 will be in range 0 - 7 */ kk = 0; /* special case */ if (bits_to_go == 0) { for (ii = 0; ii < n/2; ii++) { /* * refill the buffer with next byte */ buffer2 = (buffer2<<8) | (int) infile[nextchar]; nextchar++; array[kk] = (int) ((buffer2>>4) & 15); array[kk + 1] = (int) ((buffer2) & 15); /* no shift required */ kk += 2; } } else { for (ii = 0; ii < n/2; ii++) { /* * refill the buffer with next byte */ buffer2 = (buffer2<<8) | (int) infile[nextchar]; nextchar++; array[kk] = (int) ((buffer2>>shift1) & 15); array[kk + 1] = (int) ((buffer2>>shift2) & 15); kk += 2; } } if (ii * 2 != n) { /* have to read last odd byte */ array[n-1] = input_nybble(infile); } return( (buffer2>>bits_to_go) & 15 ); } cfitsio-3.47/fitsio2.h0000644000225700000360000017272213464573432014153 0ustar cagordonlhea#ifndef _FITSIO2_H #define _FITSIO2_H #include "fitsio.h" /* Threading support using POSIX threads programming interface (supplied by Bruce O'Neel) All threaded programs MUST have the -D_REENTRANT on the compile line and must link with -lpthread. This means that when one builds cfitsio for threads you must have -D_REENTRANT on the gcc or cc command line. */ #ifdef _REENTRANT #include /* #include not needed any more */ extern pthread_mutex_t Fitsio_Lock; extern int Fitsio_Pthread_Status; #define FFLOCK1(lockname) (Fitsio_Pthread_Status = pthread_mutex_lock(&lockname)) #define FFUNLOCK1(lockname) (Fitsio_Pthread_Status = pthread_mutex_unlock(&lockname)) #define FFLOCK FFLOCK1(Fitsio_Lock) #define FFUNLOCK FFUNLOCK1(Fitsio_Lock) #define ffstrtok(str, tok, save) strtok_r(str, tok, save) #else #define FFLOCK #define FFUNLOCK #define ffstrtok(str, tok, save) strtok(str, tok) #endif /* If REPLACE_LINKS is defined, then whenever CFITSIO fails to open a file with write access because it is a soft link to a file that only has read access, then CFITSIO will attempt to replace the link with a local copy of the file, with write access. This feature was originally added to support the ftools in the Hera environment, where many of the user's data file are soft links. */ #if defined(BUILD_HERA) #define REPLACE_LINKS 1 #endif #define USE_LARGE_VALUE -99 /* flag used when writing images */ #define DBUFFSIZE 28800 /* size of data buffer in bytes */ #define NMAXFILES 10000 /* maximum number of FITS files that can be opened */ /* CFITSIO will allocate (NMAXFILES * 80) bytes of memory */ /* plus each file that is opened will use NIOBUF * 2880 bytes of memeory */ /* where NIOBUF is defined in fitio.h and has a default value of 40 */ #define MINDIRECT 8640 /* minimum size for direct reads and writes */ /* MINDIRECT must have a value >= 8640 */ /* it is useful to identify certain specific types of machines */ #define NATIVE 0 /* machine that uses non-byteswapped IEEE formats */ #define OTHERTYPE 1 /* any other type of machine */ #define VAXVMS 3 /* uses an odd floating point format */ #define ALPHAVMS 4 /* uses an odd floating point format */ #define IBMPC 5 /* used in drvrfile.c to work around a bug on PCs */ #define CRAY 6 /* requires a special NaN test algorithm */ #define GFLOAT 1 /* used for VMS */ #define IEEEFLOAT 2 /* used for VMS */ /* ======================================================================= */ /* The following logic is used to determine the type machine, */ /* whether the bytes are swapped, and the number of bits in a long value */ /* ======================================================================= */ /* The following platforms have sizeof(long) == 8 */ /* This block of code should match a similar block in fitsio.h */ /* and the block of code at the beginning of f77_wrap.h */ #if defined(__alpha) && ( defined(__unix__) || defined(__NetBSD__) ) /* old Dec Alpha platforms running OSF */ #define BYTESWAPPED TRUE #define LONGSIZE 64 #elif defined(__sparcv9) || (defined(__sparc__) && defined(__arch64__)) /* SUN Solaris7 in 64-bit mode */ #define BYTESWAPPED FALSE #define MACHINE NATIVE #define LONGSIZE 64 /* IBM System z mainframe support */ #elif defined(__s390x__) #define BYTESWAPPED FALSE #define LONGSIZE 64 #elif defined(__s390__) #define BYTESWAPPED FALSE #define LONGSIZE 32 #elif defined(__ia64__) || defined(__x86_64__) || defined(__AARCH64EL__) /* Intel itanium 64-bit PC, or AMD opteron 64-bit PC */ #define BYTESWAPPED TRUE #define LONGSIZE 64 #elif defined(_SX) /* Nec SuperUx */ #define BYTESWAPPED FALSE #define MACHINE NATIVE #define LONGSIZE 64 #elif defined(__powerpc64__) || defined(__64BIT__) || defined(__AARCH64EB__) /* IBM 64-bit AIX powerpc*/ /* could also test for __ppc64__ or __PPC64 */ # if defined(__LITTLE_ENDIAN__) # define BYTESWAPPED TRUE # else # define BYTESWAPPED FALSE # define MACHINE NATIVE # endif # define LONGSIZE 64 #elif defined(_MIPS_SZLONG) # if defined(MIPSEL) # define BYTESWAPPED TRUE # else # define BYTESWAPPED FALSE # define MACHINE NATIVE # endif # if _MIPS_SZLONG == 32 # define LONGSIZE 32 # elif _MIPS_SZLONG == 64 # define LONGSIZE 64 # else # error "can't handle long size given by _MIPS_SZLONG" # endif /* ============================================================== */ /* the following are all 32-bit byteswapped platforms */ #elif defined(vax) && defined(VMS) #define MACHINE VAXVMS #define BYTESWAPPED TRUE #elif defined(__alpha) && defined(__VMS) #if (__D_FLOAT == TRUE) /* this float option is the same as for VAX/VMS machines. */ #define MACHINE VAXVMS #define BYTESWAPPED TRUE #elif (__G_FLOAT == TRUE) /* G_FLOAT is the default for ALPHA VMS systems */ #define MACHINE ALPHAVMS #define BYTESWAPPED TRUE #define FLOATTYPE GFLOAT #elif (__IEEE_FLOAT == TRUE) #define MACHINE ALPHAVMS #define BYTESWAPPED TRUE #define FLOATTYPE IEEEFLOAT #endif /* end of alpha VMS case */ #elif defined(ultrix) && defined(unix) /* old Dec ultrix machines */ #define BYTESWAPPED TRUE #elif defined(__i386) || defined(__i386__) || defined(__i486__) || defined(__i586__) \ || defined(_MSC_VER) || defined(__BORLANDC__) || defined(__TURBOC__) \ || defined(_NI_mswin_) || defined(__EMX__) /* generic 32-bit IBM PC */ #define MACHINE IBMPC #define BYTESWAPPED TRUE #elif defined(__arm__) /* This assumes all ARM are little endian. In the future, it might be */ /* necessary to use "if defined(__ARMEL__)" to distinguish little from big. */ /* (__ARMEL__ would be defined on little-endian, but not on big-endian). */ #define BYTESWAPPED TRUE #elif defined(__tile__) /* 64-core 8x8-architecture Tile64 platform */ #define BYTESWAPPED TRUE #elif defined(__sh__) /* SuperH CPU can be used in both little and big endian modes */ #if defined(__LITTLE_ENDIAN__) #define BYTESWAPPED TRUE #else #define BYTESWAPPED FALSE #endif #elif defined(__riscv) /* RISC-V is little endian */ #define BYTESWAPPED TRUE #else /* assume all other machine uses the same IEEE formats as used in FITS files */ /* e.g., Macs fall into this category */ #define MACHINE NATIVE #define BYTESWAPPED FALSE #endif #ifndef MACHINE #define MACHINE OTHERTYPE #endif /* assume longs are 4 bytes long, unless previously set otherwise */ #ifndef LONGSIZE #define LONGSIZE 32 #endif /* end of block that determine long size and byte swapping */ /* ==================================================================== */ #define IGNORE_EOF 1 #define REPORT_EOF 0 #define DATA_UNDEFINED -1 #define NULL_UNDEFINED 1234554321 #define ASCII_NULL_UNDEFINED 1 /* indicate no defined null value */ #define maxvalue(A,B) ((A) > (B) ? (A) : (B)) #define minvalue(A,B) ((A) < (B) ? (A) : (B)) /* faster string comparison macros */ #define FSTRCMP(a,b) ((a)[0]<(b)[0]? -1:(a)[0]>(b)[0]?1:strcmp((a),(b))) #define FSTRNCMP(a,b,n) ((a)[0]<(b)[0]?-1:(a)[0]>(b)[0]?1:strncmp((a),(b),(n))) #if defined(__VMS) || defined(VMS) #define FNANMASK 0xFFFF /* mask all bits */ #define DNANMASK 0xFFFF /* mask all bits */ #else #define FNANMASK 0x7F80 /* mask bits 1 - 8; all set on NaNs */ /* all 0 on underflow or 0. */ #define DNANMASK 0x7FF0 /* mask bits 1 - 11; all set on NaNs */ /* all 0 on underflow or 0. */ #endif #if MACHINE == CRAY /* Cray machines: the large negative integer corresponds to the 3 most sig digits set to 1. If these 3 bits are set in a floating point number (64 bits), then it represents a reserved value (i.e., a NaN) */ #define fnan(L) ( (L) >= 0xE000000000000000 ? 1 : 0) ) #else /* these functions work for both big and little endian machines */ /* that use the IEEE floating point format for internal numbers */ /* These functions tests whether the float value is a reserved IEEE */ /* value such as a Not-a-Number (NaN), or underflow, overflow, or */ /* infinity. The functions returns 1 if the value is a NaN, overflow */ /* or infinity; it returns 2 if the value is an denormalized underflow */ /* value; otherwise it returns 0. fnan tests floats, dnan tests doubles */ #define fnan(L) \ ( (L & FNANMASK) == FNANMASK ? 1 : (L & FNANMASK) == 0 ? 2 : 0) #define dnan(L) \ ( (L & DNANMASK) == DNANMASK ? 1 : (L & DNANMASK) == 0 ? 2 : 0) #endif #define DSCHAR_MAX 127.49 /* max double value that fits in an signed char */ #define DSCHAR_MIN -128.49 /* min double value that fits in an signed char */ #define DUCHAR_MAX 255.49 /* max double value that fits in an unsigned char */ #define DUCHAR_MIN -0.49 /* min double value that fits in an unsigned char */ #define DUSHRT_MAX 65535.49 /* max double value that fits in a unsigned short*/ #define DUSHRT_MIN -0.49 /* min double value that fits in an unsigned short */ #define DSHRT_MAX 32767.49 /* max double value that fits in a short */ #define DSHRT_MIN -32768.49 /* min double value that fits in a short */ #if LONGSIZE == 32 # define DLONG_MAX 2147483647.49 /* max double value that fits in a long */ # define DLONG_MIN -2147483648.49 /* min double value that fits in a long */ # define DULONG_MAX 4294967295.49 /* max double that fits in a unsigned long */ #else # define DLONG_MAX 9.2233720368547752E18 /* max double value long */ # define DLONG_MIN -9.2233720368547752E18 /* min double value long */ # define DULONG_MAX 1.84467440737095504E19 /* max double value ulong */ #endif #define DULONG_MIN -0.49 /* min double value that fits in an unsigned long */ #define DULONGLONG_MAX 18446744073709551615. /* max unsigned longlong */ #define DULONGLONG_MIN -0.49 #define DLONGLONG_MAX 9.2233720368547755807E18 /* max double value longlong */ #define DLONGLONG_MIN -9.2233720368547755808E18 /* min double value longlong */ #define DUINT_MAX 4294967295.49 /* max dbl that fits in a unsigned 4-byte int */ #define DUINT_MIN -0.49 /* min dbl that fits in an unsigned 4-byte int */ #define DINT_MAX 2147483647.49 /* max double value that fits in a 4-byte int */ #define DINT_MIN -2147483648.49 /* min double value that fits in a 4-byte int */ #ifndef UINT64_MAX #define UINT64_MAX 18446744073709551615U /* max unsigned 64-bit integer */ #endif #ifndef UINT32_MAX #define UINT32_MAX 4294967295U /* max unsigned 32-bit integer */ #endif #ifndef INT32_MAX #define INT32_MAX 2147483647 /* max 32-bit integer */ #endif #ifndef INT32_MIN #define INT32_MIN (-INT32_MAX -1) /* min 32-bit integer */ #endif #define COMPRESS_NULL_VALUE -2147483647 #define N_RANDOM 10000 /* DO NOT CHANGE THIS; used when quantizing real numbers */ int ffgnky(fitsfile *fptr, char *card, int *status); void ffcfmt(char *tform, char *cform); void ffcdsp(char *tform, char *cform); void ffswap2(short *values, long nvalues); void ffswap4(INT32BIT *values, long nvalues); void ffswap8(double *values, long nvalues); int ffi2c(LONGLONG ival, char *cval, int *status); int ffu2c(ULONGLONG ival, char *cval, int *status); int ffl2c(int lval, char *cval, int *status); int ffs2c(const char *instr, char *outstr, int *status); int ffr2f(float fval, int decim, char *cval, int *status); int ffr2e(float fval, int decim, char *cval, int *status); int ffd2f(double dval, int decim, char *cval, int *status); int ffd2e(double dval, int decim, char *cval, int *status); int ffc2ii(const char *cval, long *ival, int *status); int ffc2jj(const char *cval, LONGLONG *ival, int *status); int ffc2ujj(const char *cval, ULONGLONG *ival, int *status); int ffc2ll(const char *cval, int *lval, int *status); int ffc2rr(const char *cval, float *fval, int *status); int ffc2dd(const char *cval, double *dval, int *status); int ffc2x(const char *cval, char *dtype, long *ival, int *lval, char *sval, double *dval, int *status); int ffc2xx(const char *cval, char *dtype, LONGLONG *ival, int *lval, char *sval, double *dval, int *status); int ffc2uxx(const char *cval, char *dtype, ULONGLONG *ival, int *lval, char *sval, double *dval, int *status); int ffc2s(const char *instr, char *outstr, int *status); int ffc2i(const char *cval, long *ival, int *status); int ffc2j(const char *cval, LONGLONG *ival, int *status); int ffc2uj(const char *cval, ULONGLONG *ival, int *status); int ffc2r(const char *cval, float *fval, int *status); int ffc2d(const char *cval, double *dval, int *status); int ffc2l(const char *cval, int *lval, int *status); void ffxmsg(int action, char *err_message); int ffgcnt(fitsfile *fptr, char *value, char *comm, int *status); int ffgtkn(fitsfile *fptr, int numkey, char *keyname, long *value, int *status); int ffgtknjj(fitsfile *fptr, int numkey, char *keyname, LONGLONG *value, int *status); int fftkyn(fitsfile *fptr, int numkey, char *keyname, char *value, int *status); int ffgphd(fitsfile *fptr, int maxdim, int *simple, int *bitpix, int *naxis, LONGLONG naxes[], long *pcount, long *gcount, int *extend, double *bscale, double *bzero, LONGLONG *blank, int *nspace, int *status); int ffgttb(fitsfile *fptr, LONGLONG *rowlen, LONGLONG *nrows, LONGLONG *pcount, long *tfield, int *status); int ffmkey(fitsfile *fptr, const char *card, int *status); /* ffmbyt has been moved to fitsio.h */ int ffgbyt(fitsfile *fptr, LONGLONG nbytes, void *buffer, int *status); int ffpbyt(fitsfile *fptr, LONGLONG nbytes, void *buffer, int *status); int ffgbytoff(fitsfile *fptr, long gsize, long ngroups, long offset, void *buffer, int *status); int ffpbytoff(fitsfile *fptr, long gsize, long ngroups, long offset, void *buffer, int *status); int ffldrc(fitsfile *fptr, long record, int err_mode, int *status); int ffwhbf(fitsfile *fptr, int *nbuff); int ffbfeof(fitsfile *fptr, int *status); int ffbfwt(FITSfile *Fptr, int nbuff, int *status); int ffpxsz(int datatype); int ffourl(char *url, char *urltype, char *outfile, char *tmplfile, char *compspec, int *status); int ffparsecompspec(fitsfile *fptr, char *compspec, int *status); int ffoptplt(fitsfile *fptr, const char *tempname, int *status); int fits_is_this_a_copy(char *urltype); int fits_store_Fptr(FITSfile *Fptr, int *status); int fits_clear_Fptr(FITSfile *Fptr, int *status); int fits_already_open(fitsfile **fptr, char *url, char *urltype, char *infile, char *extspec, char *rowfilter, char *binspec, char *colspec, int mode,int *isopen, int *status); int ffedit_columns(fitsfile **fptr, char *outfile, char *expr, int *status); int fits_get_col_minmax(fitsfile *fptr, int colnum, double *datamin, double *datamax, int *status); int ffwritehisto(long totaln, long offset, long firstn, long nvalues, int narrays, iteratorCol *imagepars, void *userPointer); int ffcalchist(long totalrows, long offset, long firstrow, long nrows, int ncols, iteratorCol *colpars, void *userPointer); int ffpinit(fitsfile *fptr, int *status); int ffainit(fitsfile *fptr, int *status); int ffbinit(fitsfile *fptr, int *status); int ffchdu(fitsfile *fptr, int *status); int ffwend(fitsfile *fptr, int *status); int ffpdfl(fitsfile *fptr, int *status); int ffuptf(fitsfile *fptr, int *status); int ffdblk(fitsfile *fptr, long nblocks, int *status); int ffgext(fitsfile *fptr, int moveto, int *exttype, int *status); int ffgtbc(fitsfile *fptr, LONGLONG *totalwidth, int *status); int ffgtbp(fitsfile *fptr, char *name, char *value, int *status); int ffiblk(fitsfile *fptr, long nblock, int headdata, int *status); int ffshft(fitsfile *fptr, LONGLONG firstbyte, LONGLONG nbytes, LONGLONG nshift, int *status); int ffgcprll(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, int writemode, double *scale, double *zero, char *tform, long *twidth, int *tcode, int *maxelem, LONGLONG *startpos, LONGLONG *elemnum, long *incre, LONGLONG *repeat, LONGLONG *rowlen, int *hdutype, LONGLONG *tnull, char *snull, int *status); int ffflushx(FITSfile *fptr); int ffseek(FITSfile *fptr, LONGLONG position); int ffread(FITSfile *fptr, long nbytes, void *buffer, int *status); int ffwrite(FITSfile *fptr, long nbytes, void *buffer, int *status); int fftrun(fitsfile *fptr, LONGLONG filesize, int *status); int ffpcluc(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, int *status); int ffgcll(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, int nultyp, char nulval, char *array, char *nularray, int *anynul, int *status); int ffgcls(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, int nultyp, char *nulval, char **array, char *nularray, int *anynul, int *status); int ffgcls2(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, int nultyp, char *nulval, char **array, char *nularray, int *anynul, int *status); int ffgclb(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long elemincre, int nultyp, unsigned char nulval, unsigned char *array, char *nularray, int *anynul, int *status); int ffgclsb(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long elemincre, int nultyp, signed char nulval, signed char *array, char *nularray, int *anynul, int *status); int ffgclui(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long elemincre, int nultyp, unsigned short nulval, unsigned short *array, char *nularray, int *anynul, int *status); int ffgcli(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long elemincre, int nultyp, short nulval, short *array, char *nularray, int *anynul, int *status); int ffgcluj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long elemincre, int nultyp, unsigned long nulval, unsigned long *array, char *nularray, int *anynul, int *status); int ffgclujj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long elemincre, int nultyp, ULONGLONG nulval, ULONGLONG *array, char *nularray, int *anynul, int *status); int ffgcljj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long elemincre, int nultyp, LONGLONG nulval, LONGLONG *array, char *nularray, int *anynul, int *status); int ffgclj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long elemincre, int nultyp, long nulval, long *array, char *nularray, int *anynul, int *status); int ffgcluk(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long elemincre, int nultyp, unsigned int nulval, unsigned int *array, char *nularray, int *anynul, int *status); int ffgclk(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long elemincre, int nultyp, int nulval, int *array, char *nularray, int *anynul, int *status); int ffgcle(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long elemincre, int nultyp, float nulval, float *array, char *nularray, int *anynul, int *status); int ffgcld(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long elemincre, int nultyp, double nulval, double *array, char *nularray, int *anynul, int *status); int ffpi1b(fitsfile *fptr, long nelem, long incre, unsigned char *buffer, int *status); int ffpi2b(fitsfile *fptr, long nelem, long incre, short *buffer, int *status); int ffpi4b(fitsfile *fptr, long nelem, long incre, INT32BIT *buffer, int *status); int ffpi8b(fitsfile *fptr, long nelem, long incre, long *buffer, int *status); int ffpr4b(fitsfile *fptr, long nelem, long incre, float *buffer, int *status); int ffpr8b(fitsfile *fptr, long nelem, long incre, double *buffer, int *status); int ffgi1b(fitsfile *fptr, LONGLONG pos, long nelem, long incre, unsigned char *buffer, int *status); int ffgi2b(fitsfile *fptr, LONGLONG pos, long nelem, long incre, short *buffer, int *status); int ffgi4b(fitsfile *fptr, LONGLONG pos, long nelem, long incre, INT32BIT *buffer, int *status); int ffgi8b(fitsfile *fptr, LONGLONG pos, long nelem, long incre, long *buffer, int *status); int ffgr4b(fitsfile *fptr, LONGLONG pos, long nelem, long incre, float *buffer, int *status); int ffgr8b(fitsfile *fptr, LONGLONG pos, long nelem, long incre, double *buffer, int *status); int ffcins(fitsfile *fptr, LONGLONG naxis1, LONGLONG naxis2, LONGLONG nbytes, LONGLONG bytepos, int *status); int ffcdel(fitsfile *fptr, LONGLONG naxis1, LONGLONG naxis2, LONGLONG nbytes, LONGLONG bytepos, int *status); int ffkshf(fitsfile *fptr, int firstcol, int tfields, int nshift, int *status); int fffvcl(fitsfile *fptr, int *nvarcols, int *colnums, int *status); int fffi1i1(unsigned char *input, long ntodo, double scale, double zero, int nullcheck, unsigned char tnull, unsigned char nullval, char *nullarray, int *anynull, unsigned char *output, int *status); int fffi2i1(short *input, long ntodo, double scale, double zero, int nullcheck, short tnull, unsigned char nullval, char *nullarray, int *anynull, unsigned char *output, int *status); int fffi4i1(INT32BIT *input, long ntodo, double scale, double zero, int nullcheck, INT32BIT tnull, unsigned char nullval, char *nullarray, int *anynull, unsigned char *output, int *status); int fffi8i1(LONGLONG *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG tnull, unsigned char nullval, char *nullarray, int *anynull, unsigned char *output, int *status); int fffr4i1(float *input, long ntodo, double scale, double zero, int nullcheck, unsigned char nullval, char *nullarray, int *anynull, unsigned char *output, int *status); int fffr8i1(double *input, long ntodo, double scale, double zero, int nullcheck, unsigned char nullval, char *nullarray, int *anynull, unsigned char *output, int *status); int fffstri1(char *input, long ntodo, double scale, double zero, long twidth, double power, int nullcheck, char *snull, unsigned char nullval, char *nullarray, int *anynull, unsigned char *output, int *status); int fffi1s1(unsigned char *input, long ntodo, double scale, double zero, int nullcheck, unsigned char tnull, signed char nullval, char *nullarray, int *anynull, signed char *output, int *status); int fffi2s1(short *input, long ntodo, double scale, double zero, int nullcheck, short tnull, signed char nullval, char *nullarray, int *anynull, signed char *output, int *status); int fffi4s1(INT32BIT *input, long ntodo, double scale, double zero, int nullcheck, INT32BIT tnull, signed char nullval, char *nullarray, int *anynull, signed char *output, int *status); int fffi8s1(LONGLONG *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG tnull, signed char nullval, char *nullarray, int *anynull, signed char *output, int *status); int fffr4s1(float *input, long ntodo, double scale, double zero, int nullcheck, signed char nullval, char *nullarray, int *anynull, signed char *output, int *status); int fffr8s1(double *input, long ntodo, double scale, double zero, int nullcheck, signed char nullval, char *nullarray, int *anynull, signed char *output, int *status); int fffstrs1(char *input, long ntodo, double scale, double zero, long twidth, double power, int nullcheck, char *snull, signed char nullval, char *nullarray, int *anynull, signed char *output, int *status); int fffi1u2(unsigned char *input, long ntodo, double scale, double zero, int nullcheck, unsigned char tnull, unsigned short nullval, char *nullarray, int *anynull, unsigned short *output, int *status); int fffi2u2(short *input, long ntodo, double scale, double zero, int nullcheck, short tnull, unsigned short nullval, char *nullarray, int *anynull, unsigned short *output, int *status); int fffi4u2(INT32BIT *input, long ntodo, double scale, double zero, int nullcheck, INT32BIT tnull, unsigned short nullval, char *nullarray, int *anynull, unsigned short *output, int *status); int fffi8u2(LONGLONG *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG tnull, unsigned short nullval, char *nullarray, int *anynull, unsigned short *output, int *status); int fffr4u2(float *input, long ntodo, double scale, double zero, int nullcheck, unsigned short nullval, char *nullarray, int *anynull, unsigned short *output, int *status); int fffr8u2(double *input, long ntodo, double scale, double zero, int nullcheck, unsigned short nullval, char *nullarray, int *anynull, unsigned short *output, int *status); int fffstru2(char *input, long ntodo, double scale, double zero, long twidth, double power, int nullcheck, char *snull, unsigned short nullval, char *nullarray, int *anynull, unsigned short *output, int *status); int fffi1i2(unsigned char *input, long ntodo, double scale, double zero, int nullcheck, unsigned char tnull, short nullval, char *nullarray, int *anynull, short *output, int *status); int fffi2i2(short *input, long ntodo, double scale, double zero, int nullcheck, short tnull, short nullval, char *nullarray, int *anynull, short *output, int *status); int fffi4i2(INT32BIT *input, long ntodo, double scale, double zero, int nullcheck, INT32BIT tnull, short nullval, char *nullarray, int *anynull, short *output, int *status); int fffi8i2(LONGLONG *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG tnull, short nullval, char *nullarray, int *anynull, short *output, int *status); int fffr4i2(float *input, long ntodo, double scale, double zero, int nullcheck, short nullval, char *nullarray, int *anynull, short *output, int *status); int fffr8i2(double *input, long ntodo, double scale, double zero, int nullcheck, short nullval, char *nullarray, int *anynull, short *output, int *status); int fffstri2(char *input, long ntodo, double scale, double zero, long twidth, double power, int nullcheck, char *snull, short nullval, char *nullarray, int *anynull, short *output, int *status); int fffi1u4(unsigned char *input, long ntodo, double scale, double zero, int nullcheck, unsigned char tnull, unsigned long nullval, char *nullarray, int *anynull, unsigned long *output, int *status); int fffi2u4(short *input, long ntodo, double scale, double zero, int nullcheck, short tnull, unsigned long nullval, char *nullarray, int *anynull, unsigned long *output, int *status); int fffi4u4(INT32BIT *input, long ntodo, double scale, double zero, int nullcheck, INT32BIT tnull, unsigned long nullval, char *nullarray, int *anynull, unsigned long *output, int *status); int fffi8u4(LONGLONG *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG tnull, unsigned long nullval, char *nullarray, int *anynull, unsigned long *output, int *status); int fffr4u4(float *input, long ntodo, double scale, double zero, int nullcheck, unsigned long nullval, char *nullarray, int *anynull, unsigned long *output, int *status); int fffr8u4(double *input, long ntodo, double scale, double zero, int nullcheck, unsigned long nullval, char *nullarray, int *anynull, unsigned long *output, int *status); int fffstru4(char *input, long ntodo, double scale, double zero, long twidth, double power, int nullcheck, char *snull, unsigned long nullval, char *nullarray, int *anynull, unsigned long *output, int *status); int fffi1i4(unsigned char *input, long ntodo, double scale, double zero, int nullcheck, unsigned char tnull, long nullval, char *nullarray, int *anynull, long *output, int *status); int fffi2i4(short *input, long ntodo, double scale, double zero, int nullcheck, short tnull, long nullval, char *nullarray, int *anynull, long *output, int *status); int fffi4i4(INT32BIT *input, long ntodo, double scale, double zero, int nullcheck, INT32BIT tnull, long nullval, char *nullarray, int *anynull, long *output, int *status); int fffi8i4(LONGLONG *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG tnull, long nullval, char *nullarray, int *anynull, long *output, int *status); int fffr4i4(float *input, long ntodo, double scale, double zero, int nullcheck, long nullval, char *nullarray, int *anynull, long *output, int *status); int fffr8i4(double *input, long ntodo, double scale, double zero, int nullcheck, long nullval, char *nullarray, int *anynull, long *output, int *status); int fffstri4(char *input, long ntodo, double scale, double zero, long twidth, double power, int nullcheck, char *snull, long nullval, char *nullarray, int *anynull, long *output, int *status); int fffi1int(unsigned char *input, long ntodo, double scale, double zero, int nullcheck, unsigned char tnull, int nullval, char *nullarray, int *anynull, int *output, int *status); int fffi2int(short *input, long ntodo, double scale, double zero, int nullcheck, short tnull, int nullval, char *nullarray, int *anynull, int *output, int *status); int fffi4int(INT32BIT *input, long ntodo, double scale, double zero, int nullcheck, INT32BIT tnull, int nullval, char *nullarray, int *anynull, int *output, int *status); int fffi8int(LONGLONG *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG tnull, int nullval, char *nullarray, int *anynull, int *output, int *status); int fffr4int(float *input, long ntodo, double scale, double zero, int nullcheck, int nullval, char *nullarray, int *anynull, int *output, int *status); int fffr8int(double *input, long ntodo, double scale, double zero, int nullcheck, int nullval, char *nullarray, int *anynull, int *output, int *status); int fffstrint(char *input, long ntodo, double scale, double zero, long twidth, double power, int nullcheck, char *snull, int nullval, char *nullarray, int *anynull, int *output, int *status); int fffi1uint(unsigned char *input, long ntodo, double scale, double zero, int nullcheck, unsigned char tnull, unsigned int nullval, char *nullarray, int *anynull, unsigned int *output, int *status); int fffi2uint(short *input, long ntodo, double scale, double zero, int nullcheck, short tnull, unsigned int nullval, char *nullarray, int *anynull, unsigned int *output, int *status); int fffi4uint(INT32BIT *input, long ntodo, double scale, double zero, int nullcheck, INT32BIT tnull, unsigned int nullval, char *nullarray, int *anynull, unsigned int *output, int *status); int fffi8uint(LONGLONG *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG tnull, unsigned int nullval, char *nullarray, int *anynull, unsigned int *output, int *status); int fffr4uint(float *input, long ntodo, double scale, double zero, int nullcheck, unsigned int nullval, char *nullarray, int *anynull, unsigned int *output, int *status); int fffr8uint(double *input, long ntodo, double scale, double zero, int nullcheck, unsigned int nullval, char *nullarray, int *anynull, unsigned int *output, int *status); int fffstruint(char *input, long ntodo, double scale, double zero, long twidth, double power, int nullcheck, char *snull, unsigned int nullval, char *nullarray, int *anynull, unsigned int *output, int *status); int fffi1i8(unsigned char *input, long ntodo, double scale, double zero, int nullcheck, unsigned char tnull, LONGLONG nullval, char *nullarray, int *anynull, LONGLONG *output, int *status); int fffi2i8(short *input, long ntodo, double scale, double zero, int nullcheck, short tnull, LONGLONG nullval, char *nullarray, int *anynull, LONGLONG *output, int *status); int fffi4i8(INT32BIT *input, long ntodo, double scale, double zero, int nullcheck, INT32BIT tnull, LONGLONG nullval, char *nullarray, int *anynull, LONGLONG *output, int *status); int fffi8i8(LONGLONG *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG tnull, LONGLONG nullval, char *nullarray, int *anynull, LONGLONG *output, int *status); int fffr4i8(float *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG nullval, char *nullarray, int *anynull, LONGLONG *output, int *status); int fffr8i8(double *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG nullval, char *nullarray, int *anynull, LONGLONG *output, int *status); int fffstri8(char *input, long ntodo, double scale, double zero, long twidth, double power, int nullcheck, char *snull, LONGLONG nullval, char *nullarray, int *anynull, LONGLONG *output, int *status); int fffi1u8(unsigned char *input, long ntodo, double scale, double zero, int nullcheck, unsigned char tnull, ULONGLONG nullval, char *nullarray, int *anynull, ULONGLONG *output, int *status); int fffi2u8(short *input, long ntodo, double scale, double zero, int nullcheck, short tnull, ULONGLONG nullval, char *nullarray, int *anynull, ULONGLONG *output, int *status); int fffi4u8(INT32BIT *input, long ntodo, double scale, double zero, int nullcheck, INT32BIT tnull, ULONGLONG nullval, char *nullarray, int *anynull, ULONGLONG *output, int *status); int fffi8u8(LONGLONG *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG tnull, ULONGLONG nullval, char *nullarray, int *anynull, ULONGLONG *output, int *status); int fffr4u8(float *input, long ntodo, double scale, double zero, int nullcheck, ULONGLONG nullval, char *nullarray, int *anynull, ULONGLONG *output, int *status); int fffr8u8(double *input, long ntodo, double scale, double zero, int nullcheck, ULONGLONG nullval, char *nullarray, int *anynull, ULONGLONG *output, int *status); int fffstru8(char *input, long ntodo, double scale, double zero, long twidth, double power, int nullcheck, char *snull, ULONGLONG nullval, char *nullarray, int *anynull, ULONGLONG *output, int *status); int fffi1r4(unsigned char *input, long ntodo, double scale, double zero, int nullcheck, unsigned char tnull, float nullval, char *nullarray, int *anynull, float *output, int *status); int fffi2r4(short *input, long ntodo, double scale, double zero, int nullcheck, short tnull, float nullval, char *nullarray, int *anynull, float *output, int *status); int fffi4r4(INT32BIT *input, long ntodo, double scale, double zero, int nullcheck, INT32BIT tnull, float nullval, char *nullarray, int *anynull, float *output, int *status); int fffi8r4(LONGLONG *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG tnull, float nullval, char *nullarray, int *anynull, float *output, int *status); int fffr4r4(float *input, long ntodo, double scale, double zero, int nullcheck, float nullval, char *nullarray, int *anynull, float *output, int *status); int fffr8r4(double *input, long ntodo, double scale, double zero, int nullcheck, float nullval, char *nullarray, int *anynull, float *output, int *status); int fffstrr4(char *input, long ntodo, double scale, double zero, long twidth, double power, int nullcheck, char *snull, float nullval, char *nullarray, int *anynull, float *output, int *status); int fffi1r8(unsigned char *input, long ntodo, double scale, double zero, int nullcheck, unsigned char tnull, double nullval, char *nullarray, int *anynull, double *output, int *status); int fffi2r8(short *input, long ntodo, double scale, double zero, int nullcheck, short tnull, double nullval, char *nullarray, int *anynull, double *output, int *status); int fffi4r8(INT32BIT *input, long ntodo, double scale, double zero, int nullcheck, INT32BIT tnull, double nullval, char *nullarray, int *anynull, double *output, int *status); int fffi8r8(LONGLONG *input, long ntodo, double scale, double zero, int nullcheck, LONGLONG tnull, double nullval, char *nullarray, int *anynull, double *output, int *status); int fffr4r8(float *input, long ntodo, double scale, double zero, int nullcheck, double nullval, char *nullarray, int *anynull, double *output, int *status); int fffr8r8(double *input, long ntodo, double scale, double zero, int nullcheck, double nullval, char *nullarray, int *anynull, double *output, int *status); int fffstrr8(char *input, long ntodo, double scale, double zero, long twidth, double power, int nullcheck, char *snull, double nullval, char *nullarray, int *anynull, double *output, int *status); int ffi1fi1(unsigned char *array, long ntodo, double scale, double zero, unsigned char *buffer, int *status); int ffs1fi1(signed char *array, long ntodo, double scale, double zero, unsigned char *buffer, int *status); int ffu2fi1(unsigned short *array, long ntodo, double scale, double zero, unsigned char *buffer, int *status); int ffi2fi1(short *array, long ntodo, double scale, double zero, unsigned char *buffer, int *status); int ffu4fi1(unsigned long *array, long ntodo, double scale, double zero, unsigned char *buffer, int *status); int ffi4fi1(long *array, long ntodo, double scale, double zero, unsigned char *buffer, int *status); int ffu8fi1(ULONGLONG *array, long ntodo, double scale, double zero, unsigned char *buffer, int *status); int ffi8fi1(LONGLONG *array, long ntodo, double scale, double zero, unsigned char *buffer, int *status); int ffuintfi1(unsigned int *array, long ntodo, double scale, double zero, unsigned char *buffer, int *status); int ffintfi1(int *array, long ntodo, double scale, double zero, unsigned char *buffer, int *status); int ffr4fi1(float *array, long ntodo, double scale, double zero, unsigned char *buffer, int *status); int ffr8fi1(double *array, long ntodo, double scale, double zero, unsigned char *buffer, int *status); int ffi1fi2(unsigned char *array, long ntodo, double scale, double zero, short *buffer, int *status); int ffs1fi2(signed char *array, long ntodo, double scale, double zero, short *buffer, int *status); int ffu2fi2(unsigned short *array, long ntodo, double scale, double zero, short *buffer, int *status); int ffi2fi2(short *array, long ntodo, double scale, double zero, short *buffer, int *status); int ffu4fi2(unsigned long *array, long ntodo, double scale, double zero, short *buffer, int *status); int ffi4fi2(long *array, long ntodo, double scale, double zero, short *buffer, int *status); int ffu8fi2(ULONGLONG *array, long ntodo, double scale, double zero, short *buffer, int *status); int ffi8fi2(LONGLONG *array, long ntodo, double scale, double zero, short *buffer, int *status); int ffuintfi2(unsigned int *array, long ntodo, double scale, double zero, short *buffer, int *status); int ffintfi2(int *array, long ntodo, double scale, double zero, short *buffer, int *status); int ffr4fi2(float *array, long ntodo, double scale, double zero, short *buffer, int *status); int ffr8fi2(double *array, long ntodo, double scale, double zero, short *buffer, int *status); int ffi1fi4(unsigned char *array, long ntodo, double scale, double zero, INT32BIT *buffer, int *status); int ffs1fi4(signed char *array, long ntodo, double scale, double zero, INT32BIT *buffer, int *status); int ffu2fi4(unsigned short *array, long ntodo, double scale, double zero, INT32BIT *buffer, int *status); int ffi2fi4(short *array, long ntodo, double scale, double zero, INT32BIT *buffer, int *status); int ffu4fi4(unsigned long *array, long ntodo, double scale, double zero, INT32BIT *buffer, int *status); int ffu8fi4(ULONGLONG *array, long ntodo, double scale, double zero, INT32BIT *buffer, int *status); int ffi4fi4(long *array, long ntodo, double scale, double zero, INT32BIT *buffer, int *status); int ffi8fi4(LONGLONG *array, long ntodo, double scale, double zero, INT32BIT *buffer, int *status); int ffuintfi4(unsigned int *array, long ntodo, double scale, double zero, INT32BIT *buffer, int *status); int ffintfi4(int *array, long ntodo, double scale, double zero, INT32BIT *buffer, int *status); int ffr4fi4(float *array, long ntodo, double scale, double zero, INT32BIT *buffer, int *status); int ffr8fi4(double *array, long ntodo, double scale, double zero, INT32BIT *buffer, int *status); int ffi4fi8(long *array, long ntodo, double scale, double zero, LONGLONG *buffer, int *status); int ffi8fi8(LONGLONG *array, long ntodo, double scale, double zero, LONGLONG *buffer, int *status); int ffi2fi8(short *array, long ntodo, double scale, double zero, LONGLONG *buffer, int *status); int ffi1fi8(unsigned char *array, long ntodo, double scale, double zero, LONGLONG *buffer, int *status); int ffs1fi8(signed char *array, long ntodo, double scale, double zero, LONGLONG *buffer, int *status); int ffr4fi8(float *array, long ntodo, double scale, double zero, LONGLONG *buffer, int *status); int ffr8fi8(double *array, long ntodo, double scale, double zero, LONGLONG *buffer, int *status); int ffintfi8(int *array, long ntodo, double scale, double zero, LONGLONG *buffer, int *status); int ffu2fi8(unsigned short *array, long ntodo, double scale, double zero, LONGLONG *buffer, int *status); int ffu4fi8(unsigned long *array, long ntodo, double scale, double zero, LONGLONG *buffer, int *status); int ffu8fi8(ULONGLONG *array, long ntodo, double scale, double zero, LONGLONG *buffer, int *status); int ffuintfi8(unsigned int *array, long ntodo, double scale, double zero, LONGLONG *buffer, int *status); int ffi1fr4(unsigned char *array, long ntodo, double scale, double zero, float *buffer, int *status); int ffs1fr4(signed char *array, long ntodo, double scale, double zero, float *buffer, int *status); int ffu2fr4(unsigned short *array, long ntodo, double scale, double zero, float *buffer, int *status); int ffi2fr4(short *array, long ntodo, double scale, double zero, float *buffer, int *status); int ffu4fr4(unsigned long *array, long ntodo, double scale, double zero, float *buffer, int *status); int ffi4fr4(long *array, long ntodo, double scale, double zero, float *buffer, int *status); int ffu8fr4(ULONGLONG *array, long ntodo, double scale, double zero, float *buffer, int *status); int ffi8fr4(LONGLONG *array, long ntodo, double scale, double zero, float *buffer, int *status); int ffuintfr4(unsigned int *array, long ntodo, double scale, double zero, float *buffer, int *status); int ffintfr4(int *array, long ntodo, double scale, double zero, float *buffer, int *status); int ffr4fr4(float *array, long ntodo, double scale, double zero, float *buffer, int *status); int ffr8fr4(double *array, long ntodo, double scale, double zero, float *buffer, int *status); int ffi1fr8(unsigned char *array, long ntodo, double scale, double zero, double *buffer, int *status); int ffs1fr8(signed char *array, long ntodo, double scale, double zero, double *buffer, int *status); int ffu2fr8(unsigned short *array, long ntodo, double scale, double zero, double *buffer, int *status); int ffi2fr8(short *array, long ntodo, double scale, double zero, double *buffer, int *status); int ffu4fr8(unsigned long *array, long ntodo, double scale, double zero, double *buffer, int *status); int ffi4fr8(long *array, long ntodo, double scale, double zero, double *buffer, int *status); int ffu8fr8(ULONGLONG *array, long ntodo, double scale, double zero, double *buffer, int *status); int ffi8fr8(LONGLONG *array, long ntodo, double scale, double zero, double *buffer, int *status); int ffuintfr8(unsigned int *array, long ntodo, double scale, double zero, double *buffer, int *status); int ffintfr8(int *array, long ntodo, double scale, double zero, double *buffer, int *status); int ffr4fr8(float *array, long ntodo, double scale, double zero, double *buffer, int *status); int ffr8fr8(double *array, long ntodo, double scale, double zero, double *buffer, int *status); int ffi1fstr(unsigned char *input, long ntodo, double scale, double zero, char *cform, long twidth, char *output, int *status); int ffs1fstr(signed char *input, long ntodo, double scale, double zero, char *cform, long twidth, char *output, int *status); int ffu2fstr(unsigned short *input, long ntodo, double scale, double zero, char *cform, long twidth, char *output, int *status); int ffi2fstr(short *input, long ntodo, double scale, double zero, char *cform, long twidth, char *output, int *status); int ffu4fstr(unsigned long *input, long ntodo, double scale, double zero, char *cform, long twidth, char *output, int *status); int ffi4fstr(long *input, long ntodo, double scale, double zero, char *cform, long twidth, char *output, int *status); int ffu8fstr(ULONGLONG *input, long ntodo, double scale, double zero, char *cform, long twidth, char *output, int *status); int ffi8fstr(LONGLONG *input, long ntodo, double scale, double zero, char *cform, long twidth, char *output, int *status); int ffintfstr(int *input, long ntodo, double scale, double zero, char *cform, long twidth, char *output, int *status); int ffuintfstr(unsigned int *input, long ntodo, double scale, double zero, char *cform, long twidth, char *output, int *status); int ffr4fstr(float *input, long ntodo, double scale, double zero, char *cform, long twidth, char *output, int *status); int ffr8fstr(double *input, long ntodo, double scale, double zero, char *cform, long twidth, char *output, int *status); /* the following 4 routines are VMS macros used on VAX or Alpha VMS */ void ieevpd(double *inarray, double *outarray, long *nvals); void ieevud(double *inarray, double *outarray, long *nvals); void ieevpr(float *inarray, float *outarray, long *nvals); void ieevur(float *inarray, float *outarray, long *nvals); /* routines related to the lexical parser */ int ffselect_table(fitsfile **fptr, char *outfile, char *expr, int *status); int ffiprs( fitsfile *fptr, int compressed, char *expr, int maxdim, int *datatype, long *nelem, int *naxis, long *naxes, int *status ); void ffcprs( void ); int ffcvtn( int inputType, void *input, char *undef, long ntodo, int outputType, void *nulval, void *output, int *anynull, int *status ); int parse_data( long totalrows, long offset, long firstrow, long nrows, int nCols, iteratorCol *colData, void *userPtr ); int uncompress_hkdata( fitsfile *fptr, long ntimes, double *times, int *status ); int ffffrw_work( long totalrows, long offset, long firstrow, long nrows, int nCols, iteratorCol *colData, void *userPtr ); int fits_translate_pixkeyword(char *inrec, char *outrec,char *patterns[][2], int npat, int naxis, int *colnum, int *pat_num, int *i, int *j, int *n, int *m, int *l, int *status); /* image compression routines */ int fits_write_compressed_img(fitsfile *fptr, int datatype, long *fpixel, long *lpixel, int nullcheck, void *array, void *nulval, int *status); int fits_write_compressed_pixels(fitsfile *fptr, int datatype, LONGLONG fpixel, LONGLONG npixels, int nullcheck, void *array, void *nulval, int *status); int fits_write_compressed_img_plane(fitsfile *fptr, int datatype, int bytesperpixel, long nplane, long *firstcoord, long *lastcoord, long *naxes, int nullcheck, void *array, void *nullval, long *nread, int *status); int imcomp_init_table(fitsfile *outfptr, int bitpix, int naxis,long *naxes, int writebitpix, int *status); int imcomp_calc_max_elem (int comptype, int nx, int zbitpix, int blocksize); int imcomp_copy_imheader(fitsfile *infptr, fitsfile *outfptr, int *status); int imcomp_copy_img2comp(fitsfile *infptr, fitsfile *outfptr, int *status); int imcomp_copy_comp2img(fitsfile *infptr, fitsfile *outfptr, int norec, int *status); int imcomp_copy_prime2img(fitsfile *infptr, fitsfile *outfptr, int *status); int imcomp_compress_image (fitsfile *infptr, fitsfile *outfptr, int *status); int imcomp_compress_tile (fitsfile *outfptr, long row, int datatype, void *tiledata, long tilelen, long nx, long ny, int nullcheck, void *nullval, int *status); int imcomp_nullscale(int *idata, long tilelen, int nullflagval, int nullval, double scale, double zero, int * status); int imcomp_nullvalues(int *idata, long tilelen, int nullflagval, int nullval, int * status); int imcomp_scalevalues(int *idata, long tilelen, double scale, double zero, int * status); int imcomp_nullscalefloats(float *fdata, long tilelen, int *idata, double scale, double zero, int nullcheck, float nullflagval, int nullval, int *status); int imcomp_nullfloats(float *fdata, long tilelen, int *idata, int nullcheck, float nullflagval, int nullval, int *status); int imcomp_nullscaledoubles(double *fdata, long tilelen, int *idata, double scale, double zero, int nullcheck, double nullflagval, int nullval, int *status); int imcomp_nulldoubles(double *fdata, long tilelen, int *idata, int nullcheck, double nullflagval, int nullval, int *status); /* image decompression routines */ int fits_read_compressed_img(fitsfile *fptr, int datatype, LONGLONG *fpixel,LONGLONG *lpixel,long *inc, int nullcheck, void *nulval, void *array, char *nullarray, int *anynul, int *status); int fits_read_compressed_pixels(fitsfile *fptr, int datatype, LONGLONG fpixel, LONGLONG npixels, int nullcheck, void *nulval, void *array, char *nullarray, int *anynul, int *status); int fits_read_compressed_img_plane(fitsfile *fptr, int datatype, int bytesperpixel, long nplane, LONGLONG *firstcoord, LONGLONG *lastcoord, long *inc, long *naxes, int nullcheck, void *nullval, void *array, char *nullarray, int *anynul, long *nread, int *status); int imcomp_get_compressed_image_par(fitsfile *infptr, int *status); int imcomp_decompress_tile (fitsfile *infptr, int nrow, int tilesize, int datatype, int nullcheck, void *nulval, void *buffer, char *bnullarray, int *anynul, int *status); int imcomp_copy_overlap (char *tile, int pixlen, int ndim, long *tfpixel, long *tlpixel, char *bnullarray, char *image, long *fpixel, long *lpixel, long *inc, int nullcheck, char *nullarray, int *status); int imcomp_test_overlap (int ndim, long *tfpixel, long *tlpixel, long *fpixel, long *lpixel, long *inc, int *status); int imcomp_merge_overlap (char *tile, int pixlen, int ndim, long *tfpixel, long *tlpixel, char *bnullarray, char *image, long *fpixel, long *lpixel, int nullcheck, int *status); int imcomp_decompress_img(fitsfile *infptr, fitsfile *outfptr, int datatype, int *status); int fits_quantize_float (long row, float fdata[], long nx, long ny, int nullcheck, float in_null_value, float quantize_level, int dither_method, int idata[], double *bscale, double *bzero, int *iminval, int *imaxval); int fits_quantize_double (long row, double fdata[], long nx, long ny, int nullcheck, double in_null_value, float quantize_level, int dither_method, int idata[], double *bscale, double *bzero, int *iminval, int *imaxval); int fits_rcomp(int a[], int nx, unsigned char *c, int clen,int nblock); int fits_rcomp_short(short a[], int nx, unsigned char *c, int clen,int nblock); int fits_rcomp_byte(signed char a[], int nx, unsigned char *c, int clen,int nblock); int fits_rdecomp (unsigned char *c, int clen, unsigned int array[], int nx, int nblock); int fits_rdecomp_short (unsigned char *c, int clen, unsigned short array[], int nx, int nblock); int fits_rdecomp_byte (unsigned char *c, int clen, unsigned char array[], int nx, int nblock); int pl_p2li (int *pxsrc, int xs, short *lldst, int npix); int pl_l2pi (short *ll_src, int xs, int *px_dst, int npix); int fits_init_randoms(void); int fits_unset_compression_param( fitsfile *fptr, int *status); int fits_unset_compression_request( fitsfile *fptr, int *status); int fitsio_init_lock(void); /* general driver routines */ int urltype2driver(char *urltype, int *driver); void fits_dwnld_prog_bar(int flag); int fits_net_timeout(int sec); int fits_register_driver( char *prefix, int (*init)(void), int (*fitsshutdown)(void), int (*setoptions)(int option), int (*getoptions)(int *options), int (*getversion)(int *version), int (*checkfile) (char *urltype, char *infile, char *outfile), int (*fitsopen)(char *filename, int rwmode, int *driverhandle), int (*fitscreate)(char *filename, int *driverhandle), int (*fitstruncate)(int driverhandle, LONGLONG filesize), int (*fitsclose)(int driverhandle), int (*fremove)(char *filename), int (*size)(int driverhandle, LONGLONG *sizex), int (*flush)(int driverhandle), int (*seek)(int driverhandle, LONGLONG offset), int (*fitsread) (int driverhandle, void *buffer, long nbytes), int (*fitswrite)(int driverhandle, void *buffer, long nbytes)); /* file driver I/O routines */ int file_init(void); int file_setoptions(int options); int file_getoptions(int *options); int file_getversion(int *version); int file_shutdown(void); int file_checkfile(char *urltype, char *infile, char *outfile); int file_open(char *filename, int rwmode, int *driverhandle); int file_compress_open(char *filename, int rwmode, int *hdl); int file_openfile(char *filename, int rwmode, FILE **diskfile); int file_create(char *filename, int *driverhandle); int file_truncate(int driverhandle, LONGLONG filesize); int file_size(int driverhandle, LONGLONG *filesize); int file_close(int driverhandle); int file_remove(char *filename); int file_flush(int driverhandle); int file_seek(int driverhandle, LONGLONG offset); int file_read (int driverhandle, void *buffer, long nbytes); int file_write(int driverhandle, void *buffer, long nbytes); int file_is_compressed(char *filename); /* stream driver I/O routines */ int stream_open(char *filename, int rwmode, int *driverhandle); int stream_create(char *filename, int *driverhandle); int stream_size(int driverhandle, LONGLONG *filesize); int stream_close(int driverhandle); int stream_flush(int driverhandle); int stream_seek(int driverhandle, LONGLONG offset); int stream_read (int driverhandle, void *buffer, long nbytes); int stream_write(int driverhandle, void *buffer, long nbytes); /* memory driver I/O routines */ int mem_init(void); int mem_setoptions(int options); int mem_getoptions(int *options); int mem_getversion(int *version); int mem_shutdown(void); int mem_create(char *filename, int *handle); int mem_create_comp(char *filename, int *handle); int mem_openmem(void **buffptr, size_t *buffsize, size_t deltasize, void *(*memrealloc)(void *p, size_t newsize), int *handle); int mem_createmem(size_t memsize, int *handle); int stdin_checkfile(char *urltype, char *infile, char *outfile); int stdin_open(char *filename, int rwmode, int *handle); int stdin2mem(int hd); int stdin2file(int hd); int stdout_close(int handle); int mem_compress_openrw(char *filename, int rwmode, int *hdl); int mem_compress_open(char *filename, int rwmode, int *hdl); int mem_compress_stdin_open(char *filename, int rwmode, int *hdl); int mem_iraf_open(char *filename, int rwmode, int *hdl); int mem_rawfile_open(char *filename, int rwmode, int *hdl); int mem_size(int handle, LONGLONG *filesize); int mem_truncate(int handle, LONGLONG filesize); int mem_close_free(int handle); int mem_close_keep(int handle); int mem_close_comp(int handle); int mem_seek(int handle, LONGLONG offset); int mem_read(int hdl, void *buffer, long nbytes); int mem_write(int hdl, void *buffer, long nbytes); int mem_uncompress2mem(char *filename, FILE *diskfile, int hdl); int iraf2mem(char *filename, char **buffptr, size_t *buffsize, size_t *filesize, int *status); /* root driver I/O routines */ int root_init(void); int root_setoptions(int options); int root_getoptions(int *options); int root_getversion(int *version); int root_shutdown(void); int root_open(char *filename, int rwmode, int *driverhandle); int root_create(char *filename, int *driverhandle); int root_close(int driverhandle); int root_flush(int driverhandle); int root_seek(int driverhandle, LONGLONG offset); int root_read (int driverhandle, void *buffer, long nbytes); int root_write(int driverhandle, void *buffer, long nbytes); int root_size(int handle, LONGLONG *filesize); /* http driver I/O routines */ int http_checkfile(char *urltype, char *infile, char *outfile); int http_open(char *filename, int rwmode, int *driverhandle); int http_file_open(char *filename, int rwmode, int *driverhandle); int http_compress_open(char *filename, int rwmode, int *driverhandle); /* https driver I/O routines */ int https_checkfile(char* urltype, char *infile, char *outfile); int https_open(char *filename, int rwmode, int *driverhandle); int https_file_open(char *filename, int rwmode, int *driverhandle); void https_set_verbose(int flag); /* ftps driver I/O routines */ int ftps_checkfile(char* urltype, char *infile, char *outfile); int ftps_open(char *filename, int rwmode, int *handle); int ftps_file_open(char *filename, int rwmode, int *handle); int ftps_compress_open(char *filename, int rwmode, int *driverhandle); /* ftp driver I/O routines */ int ftp_checkfile(char *urltype, char *infile, char *outfile); int ftp_open(char *filename, int rwmode, int *driverhandle); int ftp_file_open(char *filename, int rwmode, int *driverhandle); int ftp_compress_open(char *filename, int rwmode, int *driverhandle); int uncompress2mem(char *filename, FILE *diskfile, char **buffptr, size_t *buffsize, void *(*mem_realloc)(void *p, size_t newsize), size_t *filesize, int *status); int uncompress2mem_from_mem( char *inmemptr, size_t inmemsize, char **buffptr, size_t *buffsize, void *(*mem_realloc)(void *p, size_t newsize), size_t *filesize, int *status); int uncompress2file(char *filename, FILE *indiskfile, FILE *outdiskfile, int *status); int compress2mem_from_mem( char *inmemptr, size_t inmemsize, char **buffptr, size_t *buffsize, void *(*mem_realloc)(void *p, size_t newsize), size_t *filesize, int *status); int compress2file_from_mem( char *inmemptr, size_t inmemsize, FILE *outdiskfile, size_t *filesize, /* O - size of file, in bytes */ int *status); #ifdef HAVE_GSIFTP /* prototypes for gsiftp driver I/O routines */ #include "drvrgsiftp.h" #endif #ifdef HAVE_SHMEM_SERVICES /* prototypes for shared memory driver I/O routines */ #include "drvrsmem.h" #endif /* A hack for nonunix machines, which lack strcasecmp and strncasecmp */ /* these functions are in fitscore.c */ int fits_strcasecmp (const char *s1, const char *s2 ); int fits_strncasecmp(const char *s1, const char *s2, size_t n); /* end of the entire "ifndef _FITSIO2_H" block */ #endif cfitsio-3.47/fitsio.h0000644000225700000360000035046113464573432014067 0ustar cagordonlhea/* The FITSIO software was written by William Pence at the High Energy */ /* Astrophysic Science Archive Research Center (HEASARC) at the NASA */ /* Goddard Space Flight Center. */ /* Copyright (Unpublished--all rights reserved under the copyright laws of the United States), U.S. Government as represented by the Administrator of the National Aeronautics and Space Administration. No copyright is claimed in the United States under Title 17, U.S. Code. Permission to freely use, copy, modify, and distribute this software and its documentation without fee is hereby granted, provided that this copyright notice and disclaimer of warranty appears in all copies. DISCLAIMER: THE SOFTWARE IS PROVIDED 'AS IS' WITHOUT ANY WARRANTY OF ANY KIND, EITHER EXPRESSED, IMPLIED, OR STATUTORY, INCLUDING, BUT NOT LIMITED TO, ANY WARRANTY THAT THE SOFTWARE WILL CONFORM TO SPECIFICATIONS, ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND FREEDOM FROM INFRINGEMENT, AND ANY WARRANTY THAT THE DOCUMENTATION WILL CONFORM TO THE SOFTWARE, OR ANY WARRANTY THAT THE SOFTWARE WILL BE ERROR FREE. IN NO EVENT SHALL NASA BE LIABLE FOR ANY DAMAGES, INCLUDING, BUT NOT LIMITED TO, DIRECT, INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES, ARISING OUT OF, RESULTING FROM, OR IN ANY WAY CONNECTED WITH THIS SOFTWARE, WHETHER OR NOT BASED UPON WARRANTY, CONTRACT, TORT , OR OTHERWISE, WHETHER OR NOT INJURY WAS SUSTAINED BY PERSONS OR PROPERTY OR OTHERWISE, AND WHETHER OR NOT LOSS WAS SUSTAINED FROM, OR AROSE OUT OF THE RESULTS OF, OR USE OF, THE SOFTWARE OR SERVICES PROVIDED HEREUNDER." */ #ifndef _FITSIO_H #define _FITSIO_H #define CFITSIO_VERSION 3.47 #define CFITSIO_MINOR 47 #define CFITSIO_MAJOR 3 #define CFITSIO_SONAME 8 /* the SONAME is incremented in a new release if the binary shared */ /* library (on linux and Mac systems) is not backward compatible */ /* with the previous release of CFITSIO */ /* CFITS_API is defined below for use on Windows systems. */ /* It is used to identify the public functions which should be exported. */ /* This has no effect on non-windows platforms where "WIN32" is not defined */ #if defined (WIN32) #if defined(cfitsio_EXPORTS) #define CFITS_API __declspec(dllexport) #else #define CFITS_API /* __declspec(dllimport) */ #endif /* CFITS_API */ #else /* defined (WIN32) */ #define CFITS_API #endif #include /* the following was provided by Michael Greason (GSFC) to fix a */ /* C/Fortran compatibility problem on an SGI Altix system running */ /* SGI ProPack 4 [this is a Novell SuSE Enterprise 9 derivative] */ /* and using the Intel C++ and Fortran compilers (version 9.1) */ #if defined(__INTEL_COMPILER) && defined(__itanium__) # define mipsFortran 1 # define _MIPS_SZLONG 64 #endif #if defined(linux) || defined(__APPLE__) || defined(__sgi) # include /* apparently needed on debian linux systems */ #endif /* to define off_t */ #include /* apparently needed to define size_t with gcc 2.8.1 */ #include /* needed for LLONG_MAX and INT64_MAX definitions */ /* Define the datatype for variables which store file offset values. */ /* The newer 'off_t' datatype should be used for this purpose, but some */ /* older compilers do not recognize this type, in which case we use 'long' */ /* instead. Note that _OFF_T is defined (or not) in stdio.h depending */ /* on whether _LARGEFILE_SOURCE is defined in sys/feature_tests.h */ /* (at least on Solaris platforms using cc) */ /* Debian systems require: "(defined(linux) && defined(__off_t_defined))" */ /* the mingw-w64 compiler requires: "(defined(__MINGW32__) && defined(_OFF_T_DEFINED))" */ #if defined(_OFF_T) \ || (defined(linux) && defined(__off_t_defined)) \ || (defined(__MINGW32__) && defined(_OFF_T_DEFINED)) \ || defined(_MIPS_SZLONG) || defined(__APPLE__) || defined(_AIX) # define OFF_T off_t #elif defined(__BORLANDC__) || (defined(_MSC_VER) && (_MSC_VER>= 1400)) # define OFF_T long long #else # define OFF_T long #endif /* this block determines if the the string function name is strtol or strtoll, and whether to use %ld or %lld in printf statements */ /* The following 2 cases for that Athon64 were removed on 4 Jan 2006; they appear to be incorrect now that LONGLONG is always typedef'ed to 'long long' || defined(__ia64__) \ || defined(__x86_64__) \ */ #if (defined(__alpha) && ( defined(__unix__) || defined(__NetBSD__) )) \ || defined(__sparcv9) || (defined(__sparc__) && defined(__arch64__)) \ || defined(__powerpc64__) || defined(__64BIT__) \ || (defined(_MIPS_SZLONG) && _MIPS_SZLONG == 64) \ || defined( _MSC_VER)|| defined(__BORLANDC__) # define USE_LL_SUFFIX 0 #else # define USE_LL_SUFFIX 1 #endif /* Determine what 8-byte integer data type is available. 'long long' is now supported by most compilers, but older MS Visual C++ compilers before V7.0 use '__int64' instead. */ #ifndef LONGLONG_TYPE /* this may have been previously defined */ #if defined(_MSC_VER) /* Microsoft Visual C++ */ #if (_MSC_VER < 1300) /* versions earlier than V7.0 do not have 'long long' */ typedef __int64 LONGLONG; typedef unsigned __int64 ULONGLONG; #else /* newer versions do support 'long long' */ typedef long long LONGLONG; typedef unsigned long long ULONGLONG; #endif #elif defined( __BORLANDC__) /* for the Borland 5.5 compiler, in particular */ typedef __int64 LONGLONG; typedef unsigned __int64 ULONGLONG; #else typedef long long LONGLONG; typedef unsigned long long ULONGLONG; #endif #define LONGLONG_TYPE #endif #ifndef LONGLONG_MAX #ifdef LLONG_MAX /* Linux and Solaris definition */ #define LONGLONG_MAX LLONG_MAX #define LONGLONG_MIN LLONG_MIN #elif defined(LONG_LONG_MAX) #define LONGLONG_MAX LONG_LONG_MAX #define LONGLONG_MIN LONG_LONG_MIN #elif defined(__LONG_LONG_MAX__) /* Mac OS X & CYGWIN defintion */ #define LONGLONG_MAX __LONG_LONG_MAX__ #define LONGLONG_MIN (-LONGLONG_MAX -1LL) #elif defined(INT64_MAX) /* windows definition */ #define LONGLONG_MAX INT64_MAX #define LONGLONG_MIN INT64_MIN #elif defined(_I64_MAX) /* windows definition */ #define LONGLONG_MAX _I64_MAX #define LONGLONG_MIN _I64_MIN #elif (defined(__alpha) && ( defined(__unix__) || defined(__NetBSD__) )) \ || defined(__sparcv9) \ || defined(__ia64__) \ || defined(__x86_64__) \ || defined(_SX) \ || defined(__powerpc64__) || defined(__64BIT__) \ || (defined(_MIPS_SZLONG) && _MIPS_SZLONG == 64) /* sizeof(long) = 64 */ #define LONGLONG_MAX 9223372036854775807L /* max 64-bit integer */ #define LONGLONG_MIN (-LONGLONG_MAX -1L) /* min 64-bit integer */ #else /* define a default value, even if it is never used */ #define LONGLONG_MAX 9223372036854775807LL /* max 64-bit integer */ #define LONGLONG_MIN (-LONGLONG_MAX -1LL) /* min 64-bit integer */ #endif #endif /* end of ndef LONGLONG_MAX section */ /* ================================================================= */ /* The following exclusion if __CINT__ is defined is needed for ROOT */ #ifndef __CINT__ #include "longnam.h" #endif #define NIOBUF 40 /* number of IO buffers to create (default = 40) */ /* !! Significantly increasing NIOBUF may degrade performance !! */ #define IOBUFLEN 2880 /* size in bytes of each IO buffer (DONT CHANGE!) */ /* global variables */ #define FLEN_FILENAME 1025 /* max length of a filename */ #define FLEN_KEYWORD 75 /* max length of a keyword (HIERARCH convention) */ #define FLEN_CARD 81 /* length of a FITS header card */ #define FLEN_VALUE 71 /* max length of a keyword value string */ #define FLEN_COMMENT 73 /* max length of a keyword comment string */ #define FLEN_ERRMSG 81 /* max length of a FITSIO error message */ #define FLEN_STATUS 31 /* max length of a FITSIO status text string */ #define TBIT 1 /* codes for FITS table data types */ #define TBYTE 11 #define TSBYTE 12 #define TLOGICAL 14 #define TSTRING 16 #define TUSHORT 20 #define TSHORT 21 #define TUINT 30 #define TINT 31 #define TULONG 40 #define TLONG 41 #define TINT32BIT 41 /* used when returning datatype of a column */ #define TFLOAT 42 #define TULONGLONG 80 #define TLONGLONG 81 #define TDOUBLE 82 #define TCOMPLEX 83 #define TDBLCOMPLEX 163 #define TYP_STRUC_KEY 10 #define TYP_CMPRS_KEY 20 #define TYP_SCAL_KEY 30 #define TYP_NULL_KEY 40 #define TYP_DIM_KEY 50 #define TYP_RANG_KEY 60 #define TYP_UNIT_KEY 70 #define TYP_DISP_KEY 80 #define TYP_HDUID_KEY 90 #define TYP_CKSUM_KEY 100 #define TYP_WCS_KEY 110 #define TYP_REFSYS_KEY 120 #define TYP_COMM_KEY 130 #define TYP_CONT_KEY 140 #define TYP_USER_KEY 150 #define INT32BIT int /* 32-bit integer datatype. Currently this */ /* datatype is an 'int' on all useful platforms */ /* however, it is possible that that are cases */ /* where 'int' is a 2-byte integer, in which case */ /* INT32BIT would need to be defined as 'long'. */ #define BYTE_IMG 8 /* BITPIX code values for FITS image types */ #define SHORT_IMG 16 #define LONG_IMG 32 #define LONGLONG_IMG 64 #define FLOAT_IMG -32 #define DOUBLE_IMG -64 /* The following 2 codes are not true FITS */ /* datatypes; these codes are only used internally */ /* within cfitsio to make it easier for users */ /* to deal with unsigned integers. */ #define SBYTE_IMG 10 #define USHORT_IMG 20 #define ULONG_IMG 40 #define ULONGLONG_IMG 80 #define IMAGE_HDU 0 /* Primary Array or IMAGE HDU */ #define ASCII_TBL 1 /* ASCII table HDU */ #define BINARY_TBL 2 /* Binary table HDU */ #define ANY_HDU -1 /* matches any HDU type */ #define READONLY 0 /* options when opening a file */ #define READWRITE 1 /* adopt a hopefully obscure number to use as a null value flag */ /* could be problems if the FITS files contain data with these values */ #define FLOATNULLVALUE -9.11912E-36F #define DOUBLENULLVALUE -9.1191291391491E-36 /* compression algorithm codes */ #define NO_DITHER -1 #define SUBTRACTIVE_DITHER_1 1 #define SUBTRACTIVE_DITHER_2 2 #define MAX_COMPRESS_DIM 6 #define RICE_1 11 #define GZIP_1 21 #define GZIP_2 22 #define PLIO_1 31 #define HCOMPRESS_1 41 #define BZIP2_1 51 /* not publicly supported; only for test purposes */ #define NOCOMPRESS -1 #ifndef TRUE #define TRUE 1 #endif #ifndef FALSE #define FALSE 0 #endif #define CASESEN 1 /* do case-sensitive string match */ #define CASEINSEN 0 /* do case-insensitive string match */ #define GT_ID_ALL_URI 0 /* hierarchical grouping parameters */ #define GT_ID_REF 1 #define GT_ID_POS 2 #define GT_ID_ALL 3 #define GT_ID_REF_URI 11 #define GT_ID_POS_URI 12 #define OPT_RM_GPT 0 #define OPT_RM_ENTRY 1 #define OPT_RM_MBR 2 #define OPT_RM_ALL 3 #define OPT_GCP_GPT 0 #define OPT_GCP_MBR 1 #define OPT_GCP_ALL 2 #define OPT_MCP_ADD 0 #define OPT_MCP_NADD 1 #define OPT_MCP_REPL 2 #define OPT_MCP_MOV 3 #define OPT_MRG_COPY 0 #define OPT_MRG_MOV 1 #define OPT_CMT_MBR 1 #define OPT_CMT_MBR_DEL 11 typedef struct /* structure used to store table column information */ { char ttype[70]; /* column name = FITS TTYPEn keyword; */ LONGLONG tbcol; /* offset in row to first byte of each column */ int tdatatype; /* datatype code of each column */ LONGLONG trepeat; /* repeat count of column; number of elements */ double tscale; /* FITS TSCALn linear scaling factor */ double tzero; /* FITS TZEROn linear scaling zero point */ LONGLONG tnull; /* FITS null value for int image or binary table cols */ char strnull[20]; /* FITS null value string for ASCII table columns */ char tform[10]; /* FITS tform keyword value */ long twidth; /* width of each ASCII table column */ }tcolumn; #define VALIDSTRUC 555 /* magic value used to identify if structure is valid */ typedef struct /* structure used to store basic FITS file information */ { int filehandle; /* handle returned by the file open function */ int driver; /* defines which set of I/O drivers should be used */ int open_count; /* number of opened 'fitsfiles' using this structure */ char *filename; /* file name */ int validcode; /* magic value used to verify that structure is valid */ int only_one; /* flag meaning only copy the specified extension */ LONGLONG filesize; /* current size of the physical disk file in bytes */ LONGLONG logfilesize; /* logical size of file, including unflushed buffers */ int lasthdu; /* is this the last HDU in the file? 0 = no, else yes */ LONGLONG bytepos; /* current logical I/O pointer position in file */ LONGLONG io_pos; /* current I/O pointer position in the physical file */ int curbuf; /* number of I/O buffer currently in use */ int curhdu; /* current HDU number; 0 = primary array */ int hdutype; /* 0 = primary array, 1 = ASCII table, 2 = binary table */ int writemode; /* 0 = readonly, 1 = readwrite */ int maxhdu; /* highest numbered HDU known to exist in the file */ int MAXHDU; /* dynamically allocated dimension of headstart array */ LONGLONG *headstart; /* byte offset in file to start of each HDU */ LONGLONG headend; /* byte offest in file to end of the current HDU header */ LONGLONG ENDpos; /* byte offest to where the END keyword was last written */ LONGLONG nextkey; /* byte offset in file to beginning of next keyword */ LONGLONG datastart; /* byte offset in file to start of the current data unit */ int imgdim; /* dimension of image; cached for fast access */ LONGLONG imgnaxis[99]; /* length of each axis; cached for fast access */ int tfield; /* number of fields in the table (primary array has 2 */ int startcol; /* used by ffgcnn to record starting column number */ LONGLONG origrows; /* original number of rows (value of NAXIS2 keyword) */ LONGLONG numrows; /* number of rows in the table (dynamically updated) */ LONGLONG rowlength; /* length of a table row or image size (bytes) */ tcolumn *tableptr; /* pointer to the table structure */ LONGLONG heapstart; /* heap start byte relative to start of data unit */ LONGLONG heapsize; /* size of the heap, in bytes */ /* the following elements are related to compressed images */ /* these record the 'requested' options to be used when the image is compressed */ int request_compress_type; /* requested image compression algorithm */ long request_tilesize[MAX_COMPRESS_DIM]; /* requested tiling size */ float request_quantize_level; /* requested quantize level */ int request_quantize_method ; /* requested quantizing method */ int request_dither_seed; /* starting offset into the array of random dithering */ int request_lossy_int_compress; /* lossy compress integer image as if float image? */ int request_huge_hdu; /* use '1Q' rather then '1P' variable length arrays */ float request_hcomp_scale; /* requested HCOMPRESS scale factor */ int request_hcomp_smooth; /* requested HCOMPRESS smooth parameter */ /* these record the actual options that were used when the image was compressed */ int compress_type; /* type of compression algorithm */ long tilesize[MAX_COMPRESS_DIM]; /* size of compression tiles */ float quantize_level; /* floating point quantization level */ int quantize_method; /* floating point pixel quantization algorithm */ int dither_seed; /* starting offset into the array of random dithering */ /* other compression parameters */ int compressimg; /* 1 if HDU contains a compressed image, else 0 */ char zcmptype[12]; /* compression type string */ int zbitpix; /* FITS data type of image (BITPIX) */ int zndim; /* dimension of image */ long znaxis[MAX_COMPRESS_DIM]; /* length of each axis */ long maxtilelen; /* max number of pixels in each image tile */ long maxelem; /* maximum byte length of tile compressed arrays */ int cn_compressed; /* column number for COMPRESSED_DATA column */ int cn_uncompressed; /* column number for UNCOMPRESSED_DATA column */ int cn_gzip_data; /* column number for GZIP2 lossless compressed data */ int cn_zscale; /* column number for ZSCALE column */ int cn_zzero; /* column number for ZZERO column */ int cn_zblank; /* column number for the ZBLANK column */ double zscale; /* scaling value, if same for all tiles */ double zzero; /* zero pt, if same for all tiles */ double cn_bscale; /* value of the BSCALE keyword in header */ double cn_bzero; /* value of the BZERO keyword (may be reset) */ double cn_actual_bzero; /* actual value of the BZERO keyword */ int zblank; /* value for null pixels, if not a column */ int rice_blocksize; /* first compression parameter: Rice pixels/block */ int rice_bytepix; /* 2nd compression parameter: Rice bytes/pixel */ float hcomp_scale; /* 1st hcompress compression parameter */ int hcomp_smooth; /* 2nd hcompress compression parameter */ int *tilerow; /* row number of the array of uncompressed tiledata */ long *tiledatasize; /* length of the array of tile data in bytes */ int *tiletype; /* datatype of the array of tile (TINT, TSHORT, etc) */ void **tiledata; /* array of uncompressed tile of data, for row *tilerow */ void **tilenullarray; /* array of optional array of null value flags */ int *tileanynull; /* anynulls in the array of tile? */ char *iobuffer; /* pointer to FITS file I/O buffers */ long bufrecnum[NIOBUF]; /* file record number of each of the buffers */ int dirty[NIOBUF]; /* has the corresponding buffer been modified? */ int ageindex[NIOBUF]; /* relative age of each buffer */ } FITSfile; typedef struct /* structure used to store basic HDU information */ { int HDUposition; /* HDU position in file; 0 = first HDU */ FITSfile *Fptr; /* pointer to FITS file structure */ }fitsfile; typedef struct /* structure for the iterator function column information */ { /* elements required as input to fits_iterate_data: */ fitsfile *fptr; /* pointer to the HDU containing the column */ int colnum; /* column number in the table (use name if < 1) */ char colname[70]; /* name (= TTYPEn value) of the column (optional) */ int datatype; /* output datatype (converted if necessary */ int iotype; /* = InputCol, InputOutputCol, or OutputCol */ /* output elements that may be useful for the work function: */ void *array; /* pointer to the array (and the null value) */ long repeat; /* binary table vector repeat value */ long tlmin; /* legal minimum data value */ long tlmax; /* legal maximum data value */ char tunit[70]; /* physical unit string */ char tdisp[70]; /* suggested display format */ } iteratorCol; #define InputCol 0 /* flag for input only iterator column */ #define InputOutputCol 1 /* flag for input and output iterator column */ #define OutputCol 2 /* flag for output only iterator column */ /*============================================================================= * * The following wtbarr typedef is used in the fits_read_wcstab() routine, * which is intended for use with the WCSLIB library written by Mark * Calabretta, http://www.atnf.csiro.au/~mcalabre/index.html * * In order to maintain WCSLIB and CFITSIO as independent libraries it * was not permissible for any CFITSIO library code to include WCSLIB * header files, or vice versa. However, the CFITSIO function * fits_read_wcstab() accepts an array of structs defined by wcs.h within * WCSLIB. The problem then was to define this struct within fitsio.h * without including wcs.h, especially noting that wcs.h will often (but * not always) be included together with fitsio.h in an applications * program that uses fits_read_wcstab(). * * Of the various possibilities, the solution adopted was for WCSLIB to * define "struct wtbarr" while fitsio.h defines "typedef wtbarr", a * untagged struct with identical members. This allows both wcs.h and * fitsio.h to define a wtbarr data type without conflict by virtue of * the fact that structure tags and typedef names share different * namespaces in C. Therefore, declarations within WCSLIB look like * * struct wtbarr *w; * * while within CFITSIO they are simply * * wtbarr *w; * * but as suggested by the commonality of the names, these are really the * same aggregate data type. However, in passing a (struct wtbarr *) to * fits_read_wcstab() a cast to (wtbarr *) is formally required. *===========================================================================*/ #ifndef WCSLIB_GETWCSTAB #define WCSLIB_GETWCSTAB typedef struct { int i; /* Image axis number. */ int m; /* Array axis number for index vectors. */ int kind; /* Array type, 'c' (coord) or 'i' (index). */ char extnam[72]; /* EXTNAME of binary table extension. */ int extver; /* EXTVER of binary table extension. */ int extlev; /* EXTLEV of binary table extension. */ char ttype[72]; /* TTYPEn of column containing the array. */ long row; /* Table row number. */ int ndim; /* Expected array dimensionality. */ int *dimlen; /* Where to write the array axis lengths. */ double **arrayp; /* Where to write the address of the array */ /* allocated to store the array. */ } wtbarr; /* The following exclusion if __CINT__ is defined is needed for ROOT */ #ifndef __CINT__ /* the following 3 lines are needed to support C++ compilers */ #ifdef __cplusplus extern "C" { #endif #endif int CFITS_API fits_read_wcstab(fitsfile *fptr, int nwtb, wtbarr *wtb, int *status); /* The following exclusion if __CINT__ is defined is needed for ROOT */ #ifndef __CINT__ #ifdef __cplusplus } #endif #endif #endif /* WCSLIB_GETWCSTAB */ /* error status codes */ #define CREATE_DISK_FILE -106 /* create disk file, without extended filename syntax */ #define OPEN_DISK_FILE -105 /* open disk file, without extended filename syntax */ #define SKIP_TABLE -104 /* move to 1st image when opening file */ #define SKIP_IMAGE -103 /* move to 1st table when opening file */ #define SKIP_NULL_PRIMARY -102 /* skip null primary array when opening file */ #define USE_MEM_BUFF -101 /* use memory buffer when opening file */ #define OVERFLOW_ERR -11 /* overflow during datatype conversion */ #define PREPEND_PRIMARY -9 /* used in ffiimg to insert new primary array */ #define SAME_FILE 101 /* input and output files are the same */ #define TOO_MANY_FILES 103 /* tried to open too many FITS files */ #define FILE_NOT_OPENED 104 /* could not open the named file */ #define FILE_NOT_CREATED 105 /* could not create the named file */ #define WRITE_ERROR 106 /* error writing to FITS file */ #define END_OF_FILE 107 /* tried to move past end of file */ #define READ_ERROR 108 /* error reading from FITS file */ #define FILE_NOT_CLOSED 110 /* could not close the file */ #define ARRAY_TOO_BIG 111 /* array dimensions exceed internal limit */ #define READONLY_FILE 112 /* Cannot write to readonly file */ #define MEMORY_ALLOCATION 113 /* Could not allocate memory */ #define BAD_FILEPTR 114 /* invalid fitsfile pointer */ #define NULL_INPUT_PTR 115 /* NULL input pointer to routine */ #define SEEK_ERROR 116 /* error seeking position in file */ #define BAD_NETTIMEOUT 117 /* bad value for file download timeout setting */ #define BAD_URL_PREFIX 121 /* invalid URL prefix on file name */ #define TOO_MANY_DRIVERS 122 /* tried to register too many IO drivers */ #define DRIVER_INIT_FAILED 123 /* driver initialization failed */ #define NO_MATCHING_DRIVER 124 /* matching driver is not registered */ #define URL_PARSE_ERROR 125 /* failed to parse input file URL */ #define RANGE_PARSE_ERROR 126 /* failed to parse input file URL */ #define SHARED_ERRBASE (150) #define SHARED_BADARG (SHARED_ERRBASE + 1) #define SHARED_NULPTR (SHARED_ERRBASE + 2) #define SHARED_TABFULL (SHARED_ERRBASE + 3) #define SHARED_NOTINIT (SHARED_ERRBASE + 4) #define SHARED_IPCERR (SHARED_ERRBASE + 5) #define SHARED_NOMEM (SHARED_ERRBASE + 6) #define SHARED_AGAIN (SHARED_ERRBASE + 7) #define SHARED_NOFILE (SHARED_ERRBASE + 8) #define SHARED_NORESIZE (SHARED_ERRBASE + 9) #define HEADER_NOT_EMPTY 201 /* header already contains keywords */ #define KEY_NO_EXIST 202 /* keyword not found in header */ #define KEY_OUT_BOUNDS 203 /* keyword record number is out of bounds */ #define VALUE_UNDEFINED 204 /* keyword value field is blank */ #define NO_QUOTE 205 /* string is missing the closing quote */ #define BAD_INDEX_KEY 206 /* illegal indexed keyword name */ #define BAD_KEYCHAR 207 /* illegal character in keyword name or card */ #define BAD_ORDER 208 /* required keywords out of order */ #define NOT_POS_INT 209 /* keyword value is not a positive integer */ #define NO_END 210 /* couldn't find END keyword */ #define BAD_BITPIX 211 /* illegal BITPIX keyword value*/ #define BAD_NAXIS 212 /* illegal NAXIS keyword value */ #define BAD_NAXES 213 /* illegal NAXISn keyword value */ #define BAD_PCOUNT 214 /* illegal PCOUNT keyword value */ #define BAD_GCOUNT 215 /* illegal GCOUNT keyword value */ #define BAD_TFIELDS 216 /* illegal TFIELDS keyword value */ #define NEG_WIDTH 217 /* negative table row size */ #define NEG_ROWS 218 /* negative number of rows in table */ #define COL_NOT_FOUND 219 /* column with this name not found in table */ #define BAD_SIMPLE 220 /* illegal value of SIMPLE keyword */ #define NO_SIMPLE 221 /* Primary array doesn't start with SIMPLE */ #define NO_BITPIX 222 /* Second keyword not BITPIX */ #define NO_NAXIS 223 /* Third keyword not NAXIS */ #define NO_NAXES 224 /* Couldn't find all the NAXISn keywords */ #define NO_XTENSION 225 /* HDU doesn't start with XTENSION keyword */ #define NOT_ATABLE 226 /* the CHDU is not an ASCII table extension */ #define NOT_BTABLE 227 /* the CHDU is not a binary table extension */ #define NO_PCOUNT 228 /* couldn't find PCOUNT keyword */ #define NO_GCOUNT 229 /* couldn't find GCOUNT keyword */ #define NO_TFIELDS 230 /* couldn't find TFIELDS keyword */ #define NO_TBCOL 231 /* couldn't find TBCOLn keyword */ #define NO_TFORM 232 /* couldn't find TFORMn keyword */ #define NOT_IMAGE 233 /* the CHDU is not an IMAGE extension */ #define BAD_TBCOL 234 /* TBCOLn keyword value < 0 or > rowlength */ #define NOT_TABLE 235 /* the CHDU is not a table */ #define COL_TOO_WIDE 236 /* column is too wide to fit in table */ #define COL_NOT_UNIQUE 237 /* more than 1 column name matches template */ #define BAD_ROW_WIDTH 241 /* sum of column widths not = NAXIS1 */ #define UNKNOWN_EXT 251 /* unrecognizable FITS extension type */ #define UNKNOWN_REC 252 /* unrecognizable FITS record */ #define END_JUNK 253 /* END keyword is not blank */ #define BAD_HEADER_FILL 254 /* Header fill area not blank */ #define BAD_DATA_FILL 255 /* Data fill area not blank or zero */ #define BAD_TFORM 261 /* illegal TFORM format code */ #define BAD_TFORM_DTYPE 262 /* unrecognizable TFORM datatype code */ #define BAD_TDIM 263 /* illegal TDIMn keyword value */ #define BAD_HEAP_PTR 264 /* invalid BINTABLE heap address */ #define BAD_HDU_NUM 301 /* HDU number < 1 or > MAXHDU */ #define BAD_COL_NUM 302 /* column number < 1 or > tfields */ #define NEG_FILE_POS 304 /* tried to move before beginning of file */ #define NEG_BYTES 306 /* tried to read or write negative bytes */ #define BAD_ROW_NUM 307 /* illegal starting row number in table */ #define BAD_ELEM_NUM 308 /* illegal starting element number in vector */ #define NOT_ASCII_COL 309 /* this is not an ASCII string column */ #define NOT_LOGICAL_COL 310 /* this is not a logical datatype column */ #define BAD_ATABLE_FORMAT 311 /* ASCII table column has wrong format */ #define BAD_BTABLE_FORMAT 312 /* Binary table column has wrong format */ #define NO_NULL 314 /* null value has not been defined */ #define NOT_VARI_LEN 317 /* this is not a variable length column */ #define BAD_DIMEN 320 /* illegal number of dimensions in array */ #define BAD_PIX_NUM 321 /* first pixel number greater than last pixel */ #define ZERO_SCALE 322 /* illegal BSCALE or TSCALn keyword = 0 */ #define NEG_AXIS 323 /* illegal axis length < 1 */ #define NOT_GROUP_TABLE 340 #define HDU_ALREADY_MEMBER 341 #define MEMBER_NOT_FOUND 342 #define GROUP_NOT_FOUND 343 #define BAD_GROUP_ID 344 #define TOO_MANY_HDUS_TRACKED 345 #define HDU_ALREADY_TRACKED 346 #define BAD_OPTION 347 #define IDENTICAL_POINTERS 348 #define BAD_GROUP_ATTACH 349 #define BAD_GROUP_DETACH 350 #define BAD_I2C 401 /* bad int to formatted string conversion */ #define BAD_F2C 402 /* bad float to formatted string conversion */ #define BAD_INTKEY 403 /* can't interprete keyword value as integer */ #define BAD_LOGICALKEY 404 /* can't interprete keyword value as logical */ #define BAD_FLOATKEY 405 /* can't interprete keyword value as float */ #define BAD_DOUBLEKEY 406 /* can't interprete keyword value as double */ #define BAD_C2I 407 /* bad formatted string to int conversion */ #define BAD_C2F 408 /* bad formatted string to float conversion */ #define BAD_C2D 409 /* bad formatted string to double conversion */ #define BAD_DATATYPE 410 /* bad keyword datatype code */ #define BAD_DECIM 411 /* bad number of decimal places specified */ #define NUM_OVERFLOW 412 /* overflow during datatype conversion */ # define DATA_COMPRESSION_ERR 413 /* error in imcompress routines */ # define DATA_DECOMPRESSION_ERR 414 /* error in imcompress routines */ # define NO_COMPRESSED_TILE 415 /* compressed tile doesn't exist */ #define BAD_DATE 420 /* error in date or time conversion */ #define PARSE_SYNTAX_ERR 431 /* syntax error in parser expression */ #define PARSE_BAD_TYPE 432 /* expression did not evaluate to desired type */ #define PARSE_LRG_VECTOR 433 /* vector result too large to return in array */ #define PARSE_NO_OUTPUT 434 /* data parser failed not sent an out column */ #define PARSE_BAD_COL 435 /* bad data encounter while parsing column */ #define PARSE_BAD_OUTPUT 436 /* Output file not of proper type */ #define ANGLE_TOO_BIG 501 /* celestial angle too large for projection */ #define BAD_WCS_VAL 502 /* bad celestial coordinate or pixel value */ #define WCS_ERROR 503 /* error in celestial coordinate calculation */ #define BAD_WCS_PROJ 504 /* unsupported type of celestial projection */ #define NO_WCS_KEY 505 /* celestial coordinate keywords not found */ #define APPROX_WCS_KEY 506 /* approximate WCS keywords were calculated */ #define NO_CLOSE_ERROR 999 /* special value used internally to switch off */ /* the error message from ffclos and ffchdu */ /*------- following error codes are used in the grparser.c file -----------*/ #define NGP_ERRBASE (360) /* base chosen so not to interfere with CFITSIO */ #define NGP_OK (0) #define NGP_NO_MEMORY (NGP_ERRBASE + 0) /* malloc failed */ #define NGP_READ_ERR (NGP_ERRBASE + 1) /* read error from file */ #define NGP_NUL_PTR (NGP_ERRBASE + 2) /* null pointer passed as argument */ #define NGP_EMPTY_CURLINE (NGP_ERRBASE + 3) /* line read seems to be empty */ #define NGP_UNREAD_QUEUE_FULL (NGP_ERRBASE + 4) /* cannot unread more then 1 line (or single line twice) */ #define NGP_INC_NESTING (NGP_ERRBASE + 5) /* too deep include file nesting (inf. loop ?) */ #define NGP_ERR_FOPEN (NGP_ERRBASE + 6) /* fopen() failed, cannot open file */ #define NGP_EOF (NGP_ERRBASE + 7) /* end of file encountered */ #define NGP_BAD_ARG (NGP_ERRBASE + 8) /* bad arguments passed */ #define NGP_TOKEN_NOT_EXPECT (NGP_ERRBASE + 9) /* token not expected here */ /* The following exclusion if __CINT__ is defined is needed for ROOT */ #ifndef __CINT__ /* the following 3 lines are needed to support C++ compilers */ #ifdef __cplusplus extern "C" { #endif #endif int CFITS2Unit( fitsfile *fptr ); CFITS_API fitsfile* CUnit2FITS(int unit); /*---------------- FITS file URL parsing routines -------------*/ int CFITS_API fits_get_token (char **ptr, char *delimiter, char *token, int *isanumber); int CFITS_API fits_get_token2(char **ptr, char *delimiter, char **token, int *isanumber, int *status); char CFITS_API *fits_split_names(char *list); int CFITS_API ffiurl( char *url, char *urltype, char *infile, char *outfile, char *extspec, char *rowfilter, char *binspec, char *colspec, int *status); int CFITS_API ffifile (char *url, char *urltype, char *infile, char *outfile, char *extspec, char *rowfilter, char *binspec, char *colspec, char *pixfilter, int *status); int CFITS_API ffifile2 (char *url, char *urltype, char *infile, char *outfile, char *extspec, char *rowfilter, char *binspec, char *colspec, char *pixfilter, char *compspec, int *status); int CFITS_API ffrtnm(char *url, char *rootname, int *status); int CFITS_API ffexist(const char *infile, int *exists, int *status); int CFITS_API ffexts(char *extspec, int *extnum, char *extname, int *extvers, int *hdutype, char *colname, char *rowexpress, int *status); int CFITS_API ffextn(char *url, int *extension_num, int *status); int CFITS_API ffurlt(fitsfile *fptr, char *urlType, int *status); int CFITS_API ffbins(char *binspec, int *imagetype, int *haxis, char colname[4][FLEN_VALUE], double *minin, double *maxin, double *binsizein, char minname[4][FLEN_VALUE], char maxname[4][FLEN_VALUE], char binname[4][FLEN_VALUE], double *weight, char *wtname, int *recip, int *status); int CFITS_API ffbinr(char **binspec, char *colname, double *minin, double *maxin, double *binsizein, char *minname, char *maxname, char *binname, int *status); int CFITS_API fits_copy_cell2image(fitsfile *fptr, fitsfile *newptr, char *colname, long rownum, int *status); int CFITS_API fits_copy_image2cell(fitsfile *fptr, fitsfile *newptr, char *colname, long rownum, int copykeyflag, int *status); int CFITS_API fits_copy_pixlist2image(fitsfile *infptr, fitsfile *outfptr, int firstkey, /* I - first HDU record number to start with */ int naxis, int *colnum, int *status); int CFITS_API ffimport_file( char *filename, char **contents, int *status ); int CFITS_API ffrwrg( char *rowlist, LONGLONG maxrows, int maxranges, int *numranges, long *minrow, long *maxrow, int *status); int CFITS_API ffrwrgll( char *rowlist, LONGLONG maxrows, int maxranges, int *numranges, LONGLONG *minrow, LONGLONG *maxrow, int *status); /*---------------- FITS file I/O routines -------------*/ int CFITS_API fits_init_cfitsio(void); int CFITS_API ffomem(fitsfile **fptr, const char *name, int mode, void **buffptr, size_t *buffsize, size_t deltasize, void *(*mem_realloc)(void *p, size_t newsize), int *status); int CFITS_API ffopen(fitsfile **fptr, const char *filename, int iomode, int *status); int CFITS_API ffopentest(int soname, fitsfile **fptr, const char *filename, int iomode, int *status); int CFITS_API ffdopn(fitsfile **fptr, const char *filename, int iomode, int *status); int CFITS_API ffeopn(fitsfile **fptr, const char *filename, int iomode, char *extlist, int *hdutype, int *status); int CFITS_API fftopn(fitsfile **fptr, const char *filename, int iomode, int *status); int CFITS_API ffiopn(fitsfile **fptr, const char *filename, int iomode, int *status); int CFITS_API ffdkopn(fitsfile **fptr, const char *filename, int iomode, int *status); int CFITS_API ffreopen(fitsfile *openfptr, fitsfile **newfptr, int *status); int CFITS_API ffinit( fitsfile **fptr, const char *filename, int *status); int CFITS_API ffdkinit(fitsfile **fptr, const char *filename, int *status); int CFITS_API ffimem(fitsfile **fptr, void **buffptr, size_t *buffsize, size_t deltasize, void *(*mem_realloc)(void *p, size_t newsize), int *status); int CFITS_API fftplt(fitsfile **fptr, const char *filename, const char *tempname, int *status); int CFITS_API ffflus(fitsfile *fptr, int *status); int CFITS_API ffflsh(fitsfile *fptr, int clearbuf, int *status); int CFITS_API ffclos(fitsfile *fptr, int *status); int CFITS_API ffdelt(fitsfile *fptr, int *status); int CFITS_API ffflnm(fitsfile *fptr, char *filename, int *status); int CFITS_API ffflmd(fitsfile *fptr, int *filemode, int *status); int CFITS_API fits_delete_iraf_file(const char *filename, int *status); /*---------------- utility routines -------------*/ float CFITS_API ffvers(float *version); void CFITS_API ffupch(char *string); void CFITS_API ffgerr(int status, char *errtext); void CFITS_API ffpmsg(const char *err_message); void CFITS_API ffpmrk(void); int CFITS_API ffgmsg(char *err_message); void CFITS_API ffcmsg(void); void CFITS_API ffcmrk(void); void CFITS_API ffrprt(FILE *stream, int status); void CFITS_API ffcmps(char *templt, char *colname, int casesen, int *match, int *exact); int CFITS_API fftkey(const char *keyword, int *status); int CFITS_API fftrec(char *card, int *status); int CFITS_API ffnchk(fitsfile *fptr, int *status); int CFITS_API ffkeyn(const char *keyroot, int value, char *keyname, int *status); int CFITS_API ffnkey(int value, const char *keyroot, char *keyname, int *status); int CFITS_API ffgkcl(char *card); int CFITS_API ffdtyp(const char *cval, char *dtype, int *status); int CFITS_API ffinttyp(char *cval, int *datatype, int *negative, int *status); int CFITS_API ffpsvc(char *card, char *value, char *comm, int *status); int CFITS_API ffgknm(char *card, char *name, int *length, int *status); int CFITS_API ffgthd(char *tmplt, char *card, int *hdtype, int *status); int CFITS_API ffmkky(const char *keyname, char *keyval, const char *comm, char *card, int *status); int CFITS_API fits_translate_keyword(char *inrec, char *outrec, char *patterns[][2], int npat, int n_value, int n_offset, int n_range, int *pat_num, int *i, int *j, int *m, int *n, int *status); int CFITS_API fits_translate_keywords(fitsfile *infptr, fitsfile *outfptr, int firstkey, char *patterns[][2], int npat, int n_value, int n_offset, int n_range, int *status); int CFITS_API ffasfm(char *tform, int *datacode, long *width, int *decim, int *status); int CFITS_API ffbnfm(char *tform, int *datacode, long *repeat, long *width, int *status); int CFITS_API ffbnfmll(char *tform, int *datacode, LONGLONG *repeat, long *width, int *status); int CFITS_API ffgabc(int tfields, char **tform, int space, long *rowlen, long *tbcol, int *status); int CFITS_API fits_get_section_range(char **ptr,long *secmin,long *secmax,long *incre, int *status); /* ffmbyt should not normally be used in application programs, but it is defined here as a publicly available routine because there are a few rare cases where it is needed */ int CFITS_API ffmbyt(fitsfile *fptr, LONGLONG bytpos, int ignore_err, int *status); /*----------------- write single keywords --------------*/ int CFITS_API ffpky(fitsfile *fptr, int datatype, const char *keyname, void *value, const char *comm, int *status); int CFITS_API ffprec(fitsfile *fptr, const char *card, int *status); int CFITS_API ffpcom(fitsfile *fptr, const char *comm, int *status); int CFITS_API ffpunt(fitsfile *fptr, const char *keyname, const char *unit, int *status); int CFITS_API ffphis(fitsfile *fptr, const char *history, int *status); int CFITS_API ffpdat(fitsfile *fptr, int *status); int CFITS_API ffverifydate(int year, int month, int day, int *status); int CFITS_API ffgstm(char *timestr, int *timeref, int *status); int CFITS_API ffgsdt(int *day, int *month, int *year, int *status); int CFITS_API ffdt2s(int year, int month, int day, char *datestr, int *status); int CFITS_API fftm2s(int year, int month, int day, int hour, int minute, double second, int decimals, char *datestr, int *status); int CFITS_API ffs2dt(char *datestr, int *year, int *month, int *day, int *status); int CFITS_API ffs2tm(char *datestr, int *year, int *month, int *day, int *hour, int *minute, double *second, int *status); int CFITS_API ffpkyu(fitsfile *fptr, const char *keyname, const char *comm, int *status); int CFITS_API ffpkys(fitsfile *fptr, const char *keyname, const char *value, const char *comm,int *status); int CFITS_API ffpkls(fitsfile *fptr, const char *keyname, const char *value, const char *comm,int *status); int CFITS_API ffplsw(fitsfile *fptr, int *status); int CFITS_API ffpkyl(fitsfile *fptr, const char *keyname, int value, const char *comm, int *status); int CFITS_API ffpkyj(fitsfile *fptr, const char *keyname, LONGLONG value, const char *comm, int *status); int CFITS_API ffpkyuj(fitsfile *fptr, const char *keyname, ULONGLONG value, const char *comm, int *status); int CFITS_API ffpkyf(fitsfile *fptr, const char *keyname, float value, int decim, const char *comm, int *status); int CFITS_API ffpkye(fitsfile *fptr, const char *keyname, float value, int decim, const char *comm, int *status); int CFITS_API ffpkyg(fitsfile *fptr, const char *keyname, double value, int decim, const char *comm, int *status); int CFITS_API ffpkyd(fitsfile *fptr, const char *keyname, double value, int decim, const char *comm, int *status); int CFITS_API ffpkyc(fitsfile *fptr, const char *keyname, float *value, int decim, const char *comm, int *status); int CFITS_API ffpkym(fitsfile *fptr, const char *keyname, double *value, int decim, const char *comm, int *status); int CFITS_API ffpkfc(fitsfile *fptr, const char *keyname, float *value, int decim, const char *comm, int *status); int CFITS_API ffpkfm(fitsfile *fptr, const char *keyname, double *value, int decim, const char *comm, int *status); int CFITS_API ffpkyt(fitsfile *fptr, const char *keyname, long intval, double frac, const char *comm, int *status); int CFITS_API ffptdm( fitsfile *fptr, int colnum, int naxis, long naxes[], int *status); int CFITS_API ffptdmll( fitsfile *fptr, int colnum, int naxis, LONGLONG naxes[], int *status); /*----------------- write array of keywords --------------*/ int CFITS_API ffpkns(fitsfile *fptr, const char *keyroot, int nstart, int nkey, char *value[], char *comm[], int *status); int CFITS_API ffpknl(fitsfile *fptr, const char *keyroot, int nstart, int nkey, int *value, char *comm[], int *status); int CFITS_API ffpknj(fitsfile *fptr, const char *keyroot, int nstart, int nkey, long *value, char *comm[], int *status); int CFITS_API ffpknjj(fitsfile *fptr, const char *keyroot, int nstart, int nkey, LONGLONG *value, char *comm[], int *status); int CFITS_API ffpknf(fitsfile *fptr, const char *keyroot, int nstart, int nkey, float *value, int decim, char *comm[], int *status); int CFITS_API ffpkne(fitsfile *fptr, const char *keyroot, int nstart, int nkey, float *value, int decim, char *comm[], int *status); int CFITS_API ffpkng(fitsfile *fptr, const char *keyroot, int nstart, int nkey, double *value, int decim, char *comm[], int *status); int CFITS_API ffpknd(fitsfile *fptr, const char *keyroot, int nstart, int nkey, double *value, int decim, char *comm[], int *status); int CFITS_API ffcpky(fitsfile *infptr,fitsfile *outfptr,int incol,int outcol, char *rootname, int *status); /*----------------- write required header keywords --------------*/ int CFITS_API ffphps( fitsfile *fptr, int bitpix, int naxis, long naxes[], int *status); int CFITS_API ffphpsll( fitsfile *fptr, int bitpix, int naxis, LONGLONG naxes[], int *status); int CFITS_API ffphpr( fitsfile *fptr, int simple, int bitpix, int naxis, long naxes[], LONGLONG pcount, LONGLONG gcount, int extend, int *status); int CFITS_API ffphprll( fitsfile *fptr, int simple, int bitpix, int naxis, LONGLONG naxes[], LONGLONG pcount, LONGLONG gcount, int extend, int *status); int CFITS_API ffphtb(fitsfile *fptr, LONGLONG naxis1, LONGLONG naxis2, int tfields, char **ttype, long *tbcol, char **tform, char **tunit, const char *extname, int *status); int CFITS_API ffphbn(fitsfile *fptr, LONGLONG naxis2, int tfields, char **ttype, char **tform, char **tunit, const char *extname, LONGLONG pcount, int *status); int CFITS_API ffphext( fitsfile *fptr, const char *xtension, int bitpix, int naxis, long naxes[], LONGLONG pcount, LONGLONG gcount, int *status); /*----------------- write template keywords --------------*/ int CFITS_API ffpktp(fitsfile *fptr, const char *filename, int *status); /*------------------ get header information --------------*/ int CFITS_API ffghsp(fitsfile *fptr, int *nexist, int *nmore, int *status); int CFITS_API ffghps(fitsfile *fptr, int *nexist, int *position, int *status); /*------------------ move position in header -------------*/ int CFITS_API ffmaky(fitsfile *fptr, int nrec, int *status); int CFITS_API ffmrky(fitsfile *fptr, int nrec, int *status); /*------------------ read single keywords -----------------*/ int CFITS_API ffgnxk(fitsfile *fptr, char **inclist, int ninc, char **exclist, int nexc, char *card, int *status); int CFITS_API ffgrec(fitsfile *fptr, int nrec, char *card, int *status); int CFITS_API ffgcrd(fitsfile *fptr, const char *keyname, char *card, int *status); int CFITS_API ffgstr(fitsfile *fptr, const char *string, char *card, int *status); int CFITS_API ffgunt(fitsfile *fptr, const char *keyname, char *unit, int *status); int CFITS_API ffgkyn(fitsfile *fptr, int nkey, char *keyname, char *keyval, char *comm, int *status); int CFITS_API ffgkey(fitsfile *fptr, const char *keyname, char *keyval, char *comm, int *status); int CFITS_API ffgky( fitsfile *fptr, int datatype, const char *keyname, void *value, char *comm, int *status); int CFITS_API ffgkys(fitsfile *fptr, const char *keyname, char *value, char *comm, int *status); int CFITS_API ffgksl(fitsfile *fptr, const char *keyname, int *length, int *status); int CFITS_API ffgkls(fitsfile *fptr, const char *keyname, char **value, char *comm, int *status); int CFITS_API ffgsky(fitsfile *fptr, const char *keyname, int firstchar, int maxchar, char *value, int *valuelen, char *comm, int *status); int CFITS_API fffree(void *value, int *status); int CFITS_API fffkls(char *value, int *status); int CFITS_API ffgkyl(fitsfile *fptr, const char *keyname, int *value, char *comm, int *status); int CFITS_API ffgkyj(fitsfile *fptr, const char *keyname, long *value, char *comm, int *status); int CFITS_API ffgkyjj(fitsfile *fptr, const char *keyname, LONGLONG *value, char *comm, int *status); int CFITS_API ffgkyujj(fitsfile *fptr, const char *keyname, ULONGLONG *value, char *comm, int *status); int CFITS_API ffgkye(fitsfile *fptr, const char *keyname, float *value, char *comm,int *status); int CFITS_API ffgkyd(fitsfile *fptr, const char *keyname, double *value,char *comm,int *status); int CFITS_API ffgkyc(fitsfile *fptr, const char *keyname, float *value, char *comm,int *status); int CFITS_API ffgkym(fitsfile *fptr, const char *keyname, double *value,char *comm,int *status); int CFITS_API ffgkyt(fitsfile *fptr, const char *keyname, long *ivalue, double *dvalue, char *comm, int *status); int CFITS_API ffgtdm(fitsfile *fptr, int colnum, int maxdim, int *naxis, long naxes[], int *status); int CFITS_API ffgtdmll(fitsfile *fptr, int colnum, int maxdim, int *naxis, LONGLONG naxes[], int *status); int CFITS_API ffdtdm(fitsfile *fptr, char *tdimstr, int colnum, int maxdim, int *naxis, long naxes[], int *status); int CFITS_API ffdtdmll(fitsfile *fptr, char *tdimstr, int colnum, int maxdim, int *naxis, LONGLONG naxes[], int *status); /*------------------ read array of keywords -----------------*/ int CFITS_API ffgkns(fitsfile *fptr, const char *keyname, int nstart, int nmax, char *value[], int *nfound, int *status); int CFITS_API ffgknl(fitsfile *fptr, const char *keyname, int nstart, int nmax, int *value, int *nfound, int *status); int CFITS_API ffgknj(fitsfile *fptr, const char *keyname, int nstart, int nmax, long *value, int *nfound, int *status); int CFITS_API ffgknjj(fitsfile *fptr, const char *keyname, int nstart, int nmax, LONGLONG *value, int *nfound, int *status); int CFITS_API ffgkne(fitsfile *fptr, const char *keyname, int nstart, int nmax, float *value, int *nfound, int *status); int CFITS_API ffgknd(fitsfile *fptr, const char *keyname, int nstart, int nmax, double *value, int *nfound, int *status); int CFITS_API ffh2st(fitsfile *fptr, char **header, int *status); int CFITS_API ffhdr2str( fitsfile *fptr, int exclude_comm, char **exclist, int nexc, char **header, int *nkeys, int *status); int CFITS_API ffcnvthdr2str( fitsfile *fptr, int exclude_comm, char **exclist, int nexc, char **header, int *nkeys, int *status); /*----------------- read required header keywords --------------*/ int CFITS_API ffghpr(fitsfile *fptr, int maxdim, int *simple, int *bitpix, int *naxis, long naxes[], long *pcount, long *gcount, int *extend, int *status); int CFITS_API ffghprll(fitsfile *fptr, int maxdim, int *simple, int *bitpix, int *naxis, LONGLONG naxes[], long *pcount, long *gcount, int *extend, int *status); int CFITS_API ffghtb(fitsfile *fptr,int maxfield, long *naxis1, long *naxis2, int *tfields, char **ttype, long *tbcol, char **tform, char **tunit, char *extname, int *status); int CFITS_API ffghtbll(fitsfile *fptr,int maxfield, LONGLONG *naxis1, LONGLONG *naxis2, int *tfields, char **ttype, LONGLONG *tbcol, char **tform, char **tunit, char *extname, int *status); int CFITS_API ffghbn(fitsfile *fptr, int maxfield, long *naxis2, int *tfields, char **ttype, char **tform, char **tunit, char *extname, long *pcount, int *status); int CFITS_API ffghbnll(fitsfile *fptr, int maxfield, LONGLONG *naxis2, int *tfields, char **ttype, char **tform, char **tunit, char *extname, LONGLONG *pcount, int *status); /*--------------------- update keywords ---------------*/ int CFITS_API ffuky(fitsfile *fptr, int datatype, const char *keyname, void *value, const char *comm, int *status); int CFITS_API ffucrd(fitsfile *fptr, const char *keyname, const char *card, int *status); int CFITS_API ffukyu(fitsfile *fptr, const char *keyname, const char *comm, int *status); int CFITS_API ffukys(fitsfile *fptr, const char *keyname, const char *value, const char *comm, int *status); int CFITS_API ffukls(fitsfile *fptr, const char *keyname, const char *value, const char *comm, int *status); int CFITS_API ffukyl(fitsfile *fptr, const char *keyname, int value, const char *comm, int *status); int CFITS_API ffukyj(fitsfile *fptr, const char *keyname, LONGLONG value, const char *comm, int *status); int CFITS_API ffukyf(fitsfile *fptr, const char *keyname, float value, int decim, const char *comm, int *status); int CFITS_API ffukye(fitsfile *fptr, const char *keyname, float value, int decim, const char *comm, int *status); int CFITS_API ffukyg(fitsfile *fptr, const char *keyname, double value, int decim, const char *comm, int *status); int CFITS_API ffukyd(fitsfile *fptr, const char *keyname, double value, int decim, const char *comm, int *status); int CFITS_API ffukyc(fitsfile *fptr, const char *keyname, float *value, int decim, const char *comm, int *status); int CFITS_API ffukym(fitsfile *fptr, const char *keyname, double *value, int decim, const char *comm, int *status); int CFITS_API ffukfc(fitsfile *fptr, const char *keyname, float *value, int decim, const char *comm, int *status); int CFITS_API ffukfm(fitsfile *fptr, const char *keyname, double *value, int decim, const char *comm, int *status); /*--------------------- modify keywords ---------------*/ int CFITS_API ffmrec(fitsfile *fptr, int nkey, const char *card, int *status); int CFITS_API ffmcrd(fitsfile *fptr, const char *keyname, const char *card, int *status); int CFITS_API ffmnam(fitsfile *fptr, const char *oldname, const char *newname, int *status); int CFITS_API ffmcom(fitsfile *fptr, const char *keyname, const char *comm, int *status); int CFITS_API ffmkyu(fitsfile *fptr, const char *keyname, const char *comm, int *status); int CFITS_API ffmkys(fitsfile *fptr, const char *keyname, const char *value, const char *comm,int *status); int CFITS_API ffmkls(fitsfile *fptr, const char *keyname, const char *value, const char *comm,int *status); int CFITS_API ffmkyl(fitsfile *fptr, const char *keyname, int value, const char *comm, int *status); int CFITS_API ffmkyj(fitsfile *fptr, const char *keyname, LONGLONG value, const char *comm, int *status); int CFITS_API ffmkyf(fitsfile *fptr, const char *keyname, float value, int decim, const char *comm, int *status); int CFITS_API ffmkye(fitsfile *fptr, const char *keyname, float value, int decim, const char *comm, int *status); int CFITS_API ffmkyg(fitsfile *fptr, const char *keyname, double value, int decim, const char *comm, int *status); int CFITS_API ffmkyd(fitsfile *fptr, const char *keyname, double value, int decim, const char *comm, int *status); int CFITS_API ffmkyc(fitsfile *fptr, const char *keyname, float *value, int decim, const char *comm, int *status); int CFITS_API ffmkym(fitsfile *fptr, const char *keyname, double *value, int decim, const char *comm, int *status); int CFITS_API ffmkfc(fitsfile *fptr, const char *keyname, float *value, int decim, const char *comm, int *status); int CFITS_API ffmkfm(fitsfile *fptr, const char *keyname, double *value, int decim, const char *comm, int *status); /*--------------------- insert keywords ---------------*/ int CFITS_API ffirec(fitsfile *fptr, int nkey, const char *card, int *status); int CFITS_API ffikey(fitsfile *fptr, const char *card, int *status); int CFITS_API ffikyu(fitsfile *fptr, const char *keyname, const char *comm, int *status); int CFITS_API ffikys(fitsfile *fptr, const char *keyname, const char *value, const char *comm,int *status); int CFITS_API ffikls(fitsfile *fptr, const char *keyname, const char *value, const char *comm,int *status); int CFITS_API ffikyl(fitsfile *fptr, const char *keyname, int value, const char *comm, int *status); int CFITS_API ffikyj(fitsfile *fptr, const char *keyname, LONGLONG value, const char *comm, int *status); int CFITS_API ffikyf(fitsfile *fptr, const char *keyname, float value, int decim, const char *comm, int *status); int CFITS_API ffikye(fitsfile *fptr, const char *keyname, float value, int decim, const char *comm, int *status); int CFITS_API ffikyg(fitsfile *fptr, const char *keyname, double value, int decim, const char *comm, int *status); int CFITS_API ffikyd(fitsfile *fptr, const char *keyname, double value, int decim, const char *comm, int *status); int CFITS_API ffikyc(fitsfile *fptr, const char *keyname, float *value, int decim, const char *comm, int *status); int CFITS_API ffikym(fitsfile *fptr, const char *keyname, double *value, int decim, const char *comm, int *status); int CFITS_API ffikfc(fitsfile *fptr, const char *keyname, float *value, int decim, const char *comm, int *status); int CFITS_API ffikfm(fitsfile *fptr, const char *keyname, double *value, int decim, const char *comm, int *status); /*--------------------- delete keywords ---------------*/ int CFITS_API ffdkey(fitsfile *fptr, const char *keyname, int *status); int CFITS_API ffdstr(fitsfile *fptr, const char *string, int *status); int CFITS_API ffdrec(fitsfile *fptr, int keypos, int *status); /*--------------------- get HDU information -------------*/ int CFITS_API ffghdn(fitsfile *fptr, int *chdunum); int CFITS_API ffghdt(fitsfile *fptr, int *exttype, int *status); int CFITS_API ffghad(fitsfile *fptr, long *headstart, long *datastart, long *dataend, int *status); int CFITS_API ffghadll(fitsfile *fptr, LONGLONG *headstart, LONGLONG *datastart, LONGLONG *dataend, int *status); int CFITS_API ffghof(fitsfile *fptr, OFF_T *headstart, OFF_T *datastart, OFF_T *dataend, int *status); int CFITS_API ffgipr(fitsfile *fptr, int maxaxis, int *imgtype, int *naxis, long *naxes, int *status); int CFITS_API ffgiprll(fitsfile *fptr, int maxaxis, int *imgtype, int *naxis, LONGLONG *naxes, int *status); int CFITS_API ffgidt(fitsfile *fptr, int *imgtype, int *status); int CFITS_API ffgiet(fitsfile *fptr, int *imgtype, int *status); int CFITS_API ffgidm(fitsfile *fptr, int *naxis, int *status); int CFITS_API ffgisz(fitsfile *fptr, int nlen, long *naxes, int *status); int CFITS_API ffgiszll(fitsfile *fptr, int nlen, LONGLONG *naxes, int *status); /*--------------------- HDU operations -------------*/ int CFITS_API ffmahd(fitsfile *fptr, int hdunum, int *exttype, int *status); int CFITS_API ffmrhd(fitsfile *fptr, int hdumov, int *exttype, int *status); int CFITS_API ffmnhd(fitsfile *fptr, int exttype, char *hduname, int hduvers, int *status); int CFITS_API ffthdu(fitsfile *fptr, int *nhdu, int *status); int CFITS_API ffcrhd(fitsfile *fptr, int *status); int CFITS_API ffcrim(fitsfile *fptr, int bitpix, int naxis, long *naxes, int *status); int CFITS_API ffcrimll(fitsfile *fptr, int bitpix, int naxis, LONGLONG *naxes, int *status); int CFITS_API ffcrtb(fitsfile *fptr, int tbltype, LONGLONG naxis2, int tfields, char **ttype, char **tform, char **tunit, const char *extname, int *status); int CFITS_API ffiimg(fitsfile *fptr, int bitpix, int naxis, long *naxes, int *status); int CFITS_API ffiimgll(fitsfile *fptr, int bitpix, int naxis, LONGLONG *naxes, int *status); int CFITS_API ffitab(fitsfile *fptr, LONGLONG naxis1, LONGLONG naxis2, int tfields, char **ttype, long *tbcol, char **tform, char **tunit, const char *extname, int *status); int CFITS_API ffibin(fitsfile *fptr, LONGLONG naxis2, int tfields, char **ttype, char **tform, char **tunit, const char *extname, LONGLONG pcount, int *status); int CFITS_API ffrsim(fitsfile *fptr, int bitpix, int naxis, long *naxes, int *status); int CFITS_API ffrsimll(fitsfile *fptr, int bitpix, int naxis, LONGLONG *naxes, int *status); int CFITS_API ffdhdu(fitsfile *fptr, int *hdutype, int *status); int CFITS_API ffcopy(fitsfile *infptr, fitsfile *outfptr, int morekeys, int *status); int CFITS_API ffcpfl(fitsfile *infptr, fitsfile *outfptr, int prev, int cur, int follow, int *status); int CFITS_API ffcphd(fitsfile *infptr, fitsfile *outfptr, int *status); int CFITS_API ffcpdt(fitsfile *infptr, fitsfile *outfptr, int *status); int CFITS_API ffchfl(fitsfile *fptr, int *status); int CFITS_API ffcdfl(fitsfile *fptr, int *status); int CFITS_API ffwrhdu(fitsfile *fptr, FILE *outstream, int *status); int CFITS_API ffrdef(fitsfile *fptr, int *status); int CFITS_API ffrhdu(fitsfile *fptr, int *hdutype, int *status); int CFITS_API ffhdef(fitsfile *fptr, int morekeys, int *status); int CFITS_API ffpthp(fitsfile *fptr, long theap, int *status); int CFITS_API ffcsum(fitsfile *fptr, long nrec, unsigned long *sum, int *status); void CFITS_API ffesum(unsigned long sum, int complm, char *ascii); unsigned long CFITS_API ffdsum(char *ascii, int complm, unsigned long *sum); int CFITS_API ffpcks(fitsfile *fptr, int *status); int CFITS_API ffupck(fitsfile *fptr, int *status); int CFITS_API ffvcks(fitsfile *fptr, int *datastatus, int *hdustatus, int *status); int CFITS_API ffgcks(fitsfile *fptr, unsigned long *datasum, unsigned long *hdusum, int *status); /*--------------------- define scaling or null values -------------*/ int CFITS_API ffpscl(fitsfile *fptr, double scale, double zeroval, int *status); int CFITS_API ffpnul(fitsfile *fptr, LONGLONG nulvalue, int *status); int CFITS_API fftscl(fitsfile *fptr, int colnum, double scale, double zeroval, int *status); int CFITS_API fftnul(fitsfile *fptr, int colnum, LONGLONG nulvalue, int *status); int CFITS_API ffsnul(fitsfile *fptr, int colnum, char *nulstring, int *status); /*--------------------- get column information -------------*/ int CFITS_API ffgcno(fitsfile *fptr, int casesen, char *templt, int *colnum, int *status); int CFITS_API ffgcnn(fitsfile *fptr, int casesen, char *templt, char *colname, int *colnum, int *status); int CFITS_API ffgtcl(fitsfile *fptr, int colnum, int *typecode, long *repeat, long *width, int *status); int CFITS_API ffgtclll(fitsfile *fptr, int colnum, int *typecode, LONGLONG *repeat, LONGLONG *width, int *status); int CFITS_API ffeqty(fitsfile *fptr, int colnum, int *typecode, long *repeat, long *width, int *status); int CFITS_API ffeqtyll(fitsfile *fptr, int colnum, int *typecode, LONGLONG *repeat, LONGLONG *width, int *status); int CFITS_API ffgncl(fitsfile *fptr, int *ncols, int *status); int CFITS_API ffgnrw(fitsfile *fptr, long *nrows, int *status); int CFITS_API ffgnrwll(fitsfile *fptr, LONGLONG *nrows, int *status); int CFITS_API ffgacl(fitsfile *fptr, int colnum, char *ttype, long *tbcol, char *tunit, char *tform, double *tscal, double *tzero, char *tnull, char *tdisp, int *status); int CFITS_API ffgbcl(fitsfile *fptr, int colnum, char *ttype, char *tunit, char *dtype, long *repeat, double *tscal, double *tzero, long *tnull, char *tdisp, int *status); int CFITS_API ffgbclll(fitsfile *fptr, int colnum, char *ttype, char *tunit, char *dtype, LONGLONG *repeat, double *tscal, double *tzero, LONGLONG *tnull, char *tdisp, int *status); int CFITS_API ffgrsz(fitsfile *fptr, long *nrows, int *status); int CFITS_API ffgcdw(fitsfile *fptr, int colnum, int *width, int *status); /*--------------------- read primary array or image elements -------------*/ int CFITS_API ffgpxv(fitsfile *fptr, int datatype, long *firstpix, LONGLONG nelem, void *nulval, void *array, int *anynul, int *status); int CFITS_API ffgpxvll(fitsfile *fptr, int datatype, LONGLONG *firstpix, LONGLONG nelem, void *nulval, void *array, int *anynul, int *status); int CFITS_API ffgpxf(fitsfile *fptr, int datatype, long *firstpix, LONGLONG nelem, void *array, char *nullarray, int *anynul, int *status); int CFITS_API ffgpxfll(fitsfile *fptr, int datatype, LONGLONG *firstpix, LONGLONG nelem, void *array, char *nullarray, int *anynul, int *status); int CFITS_API ffgsv(fitsfile *fptr, int datatype, long *blc, long *trc, long *inc, void *nulval, void *array, int *anynul, int *status); int CFITS_API ffgpv(fitsfile *fptr, int datatype, LONGLONG firstelem, LONGLONG nelem, void *nulval, void *array, int *anynul, int *status); int CFITS_API ffgpf(fitsfile *fptr, int datatype, LONGLONG firstelem, LONGLONG nelem, void *array, char *nullarray, int *anynul, int *status); int CFITS_API ffgpvb(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned char nulval, unsigned char *array, int *anynul, int *status); int CFITS_API ffgpvsb(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, signed char nulval, signed char *array, int *anynul, int *status); int CFITS_API ffgpvui(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned short nulval, unsigned short *array, int *anynul, int *status); int CFITS_API ffgpvi(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, short nulval, short *array, int *anynul, int *status); int CFITS_API ffgpvuj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned long nulval, unsigned long *array, int *anynul, int *status); int CFITS_API ffgpvj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, long nulval, long *array, int *anynul, int *status); int CFITS_API ffgpvujj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, ULONGLONG nulval, ULONGLONG *array, int *anynul, int *status); int CFITS_API ffgpvjj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, LONGLONG nulval, LONGLONG *array, int *anynul, int *status); int CFITS_API ffgpvuk(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned int nulval, unsigned int *array, int *anynul, int *status); int CFITS_API ffgpvk(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, int nulval, int *array, int *anynul, int *status); int CFITS_API ffgpve(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, float nulval, float *array, int *anynul, int *status); int CFITS_API ffgpvd(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, double nulval, double *array, int *anynul, int *status); int CFITS_API ffgpfb(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned char *array, char *nularray, int *anynul, int *status); int CFITS_API ffgpfsb(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, signed char *array, char *nularray, int *anynul, int *status); int CFITS_API ffgpfui(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned short *array, char *nularray, int *anynul, int *status); int CFITS_API ffgpfi(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, short *array, char *nularray, int *anynul, int *status); int CFITS_API ffgpfuj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned long *array, char *nularray, int *anynul, int *status); int CFITS_API ffgpfj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, long *array, char *nularray, int *anynul, int *status); int CFITS_API ffgpfujj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, ULONGLONG *array, char *nularray, int *anynul, int *status); int CFITS_API ffgpfjj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, LONGLONG *array, char *nularray, int *anynul, int *status); int CFITS_API ffgpfuk(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned int *array, char *nularray, int *anynul, int *status); int CFITS_API ffgpfk(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, int *array, char *nularray, int *anynul, int *status); int CFITS_API ffgpfe(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, float *array, char *nularray, int *anynul, int *status); int CFITS_API ffgpfd(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, double *array, char *nularray, int *anynul, int *status); int CFITS_API ffg2db(fitsfile *fptr, long group, unsigned char nulval, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, unsigned char *array, int *anynul, int *status); int CFITS_API ffg2dsb(fitsfile *fptr, long group, signed char nulval, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, signed char *array, int *anynul, int *status); int CFITS_API ffg2dui(fitsfile *fptr, long group, unsigned short nulval, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, unsigned short *array, int *anynul, int *status); int CFITS_API ffg2di(fitsfile *fptr, long group, short nulval, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, short *array, int *anynul, int *status); int CFITS_API ffg2duj(fitsfile *fptr, long group, unsigned long nulval, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, unsigned long *array, int *anynul, int *status); int CFITS_API ffg2dj(fitsfile *fptr, long group, long nulval, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, long *array, int *anynul, int *status); int CFITS_API ffg2dujj(fitsfile *fptr, long group, ULONGLONG nulval, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, ULONGLONG *array, int *anynul, int *status); int CFITS_API ffg2djj(fitsfile *fptr, long group, LONGLONG nulval, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, LONGLONG *array, int *anynul, int *status); int CFITS_API ffg2duk(fitsfile *fptr, long group, unsigned int nulval, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, unsigned int *array, int *anynul, int *status); int CFITS_API ffg2dk(fitsfile *fptr, long group, int nulval, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, int *array, int *anynul, int *status); int CFITS_API ffg2de(fitsfile *fptr, long group, float nulval, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, float *array, int *anynul, int *status); int CFITS_API ffg2dd(fitsfile *fptr, long group, double nulval, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, double *array, int *anynul, int *status); int CFITS_API ffg3db(fitsfile *fptr, long group, unsigned char nulval, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, unsigned char *array, int *anynul, int *status); int CFITS_API ffg3dsb(fitsfile *fptr, long group, signed char nulval, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, signed char *array, int *anynul, int *status); int CFITS_API ffg3dui(fitsfile *fptr, long group, unsigned short nulval, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, unsigned short *array, int *anynul, int *status); int CFITS_API ffg3di(fitsfile *fptr, long group, short nulval, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, short *array, int *anynul, int *status); int CFITS_API ffg3duj(fitsfile *fptr, long group, unsigned long nulval, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, unsigned long *array, int *anynul, int *status); int CFITS_API ffg3dj(fitsfile *fptr, long group, long nulval, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, long *array, int *anynul, int *status); int CFITS_API ffg3dujj(fitsfile *fptr, long group, ULONGLONG nulval, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, ULONGLONG *array, int *anynul, int *status); int CFITS_API ffg3djj(fitsfile *fptr, long group, LONGLONG nulval, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, LONGLONG *array, int *anynul, int *status); int CFITS_API ffg3duk(fitsfile *fptr, long group, unsigned int nulval, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, unsigned int *array, int *anynul, int *status); int CFITS_API ffg3dk(fitsfile *fptr, long group, int nulval, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, int *array, int *anynul, int *status); int CFITS_API ffg3de(fitsfile *fptr, long group, float nulval, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, float *array, int *anynul, int *status); int CFITS_API ffg3dd(fitsfile *fptr, long group, double nulval, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, double *array, int *anynul, int *status); int CFITS_API ffgsvb(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, unsigned char nulval, unsigned char *array, int *anynul, int *status); int CFITS_API ffgsvsb(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, signed char nulval, signed char *array, int *anynul, int *status); int CFITS_API ffgsvui(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, unsigned short nulval, unsigned short *array, int *anynul, int *status); int CFITS_API ffgsvi(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, short nulval, short *array, int *anynul, int *status); int CFITS_API ffgsvuj(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, unsigned long nulval, unsigned long *array, int *anynul, int *status); int CFITS_API ffgsvj(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, long nulval, long *array, int *anynul, int *status); int CFITS_API ffgsvujj(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, ULONGLONG nulval, ULONGLONG *array, int *anynul, int *status); int CFITS_API ffgsvjj(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, LONGLONG nulval, LONGLONG *array, int *anynul, int *status); int CFITS_API ffgsvuk(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, unsigned int nulval, unsigned int *array, int *anynul, int *status); int CFITS_API ffgsvk(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, int nulval, int *array, int *anynul, int *status); int CFITS_API ffgsve(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, float nulval, float *array, int *anynul, int *status); int CFITS_API ffgsvd(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, double nulval, double *array, int *anynul, int *status); int CFITS_API ffgsfb(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, unsigned char *array, char *flagval, int *anynul, int *status); int CFITS_API ffgsfsb(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, signed char *array, char *flagval, int *anynul, int *status); int CFITS_API ffgsfui(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, unsigned short *array, char *flagval, int *anynul, int *status); int CFITS_API ffgsfi(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, short *array, char *flagval, int *anynul, int *status); int CFITS_API ffgsfuj(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, unsigned long *array, char *flagval, int *anynul, int *status); int CFITS_API ffgsfj(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, long *array, char *flagval, int *anynul, int *status); int CFITS_API ffgsfujj(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, ULONGLONG *array, char *flagval, int *anynul, int *status); int CFITS_API ffgsfjj(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, LONGLONG *array, char *flagval, int *anynul, int *status); int CFITS_API ffgsfuk(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, unsigned int *array, char *flagval, int *anynul, int *status); int CFITS_API ffgsfk(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, int *array, char *flagval, int *anynul, int *status); int CFITS_API ffgsfe(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, float *array, char *flagval, int *anynul, int *status); int CFITS_API ffgsfd(fitsfile *fptr, int colnum, int naxis, long *naxes, long *blc, long *trc, long *inc, double *array, char *flagval, int *anynul, int *status); int CFITS_API ffggpb(fitsfile *fptr, long group, long firstelem, long nelem, unsigned char *array, int *status); int CFITS_API ffggpsb(fitsfile *fptr, long group, long firstelem, long nelem, signed char *array, int *status); int CFITS_API ffggpui(fitsfile *fptr, long group, long firstelem, long nelem, unsigned short *array, int *status); int CFITS_API ffggpi(fitsfile *fptr, long group, long firstelem, long nelem, short *array, int *status); int CFITS_API ffggpuj(fitsfile *fptr, long group, long firstelem, long nelem, unsigned long *array, int *status); int CFITS_API ffggpj(fitsfile *fptr, long group, long firstelem, long nelem, long *array, int *status); int CFITS_API ffggpujj(fitsfile *fptr, long group, long firstelem, long nelem, ULONGLONG *array, int *status); int CFITS_API ffggpjj(fitsfile *fptr, long group, long firstelem, long nelem, LONGLONG *array, int *status); int CFITS_API ffggpuk(fitsfile *fptr, long group, long firstelem, long nelem, unsigned int *array, int *status); int CFITS_API ffggpk(fitsfile *fptr, long group, long firstelem, long nelem, int *array, int *status); int CFITS_API ffggpe(fitsfile *fptr, long group, long firstelem, long nelem, float *array, int *status); int CFITS_API ffggpd(fitsfile *fptr, long group, long firstelem, long nelem, double *array, int *status); /*--------------------- read column elements -------------*/ int CFITS_API ffgcv( fitsfile *fptr, int datatype, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, void *nulval, void *array, int *anynul, int *status); int CFITS_API ffgcf( fitsfile *fptr, int datatype, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, void *array, char *nullarray, int *anynul, int *status); int CFITS_API ffgcvs(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, char *nulval, char **array, int *anynul, int *status); int CFITS_API ffgcl (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, char *array, int *status); int CFITS_API ffgcvl (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, char nulval, char *array, int *anynul, int *status); int CFITS_API ffgcvb(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned char nulval, unsigned char *array, int *anynul, int *status); int CFITS_API ffgcvsb(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, signed char nulval, signed char *array, int *anynul, int *status); int CFITS_API ffgcvui(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned short nulval, unsigned short *array, int *anynul, int *status); int CFITS_API ffgcvi(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, short nulval, short *array, int *anynul, int *status); int CFITS_API ffgcvuj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned long nulval, unsigned long *array, int *anynul, int *status); int CFITS_API ffgcvj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long nulval, long *array, int *anynul, int *status); int CFITS_API ffgcvujj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, ULONGLONG nulval, ULONGLONG *array, int *anynul, int *status); int CFITS_API ffgcvjj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, LONGLONG nulval, LONGLONG *array, int *anynul, int *status); int CFITS_API ffgcvuk(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned int nulval, unsigned int *array, int *anynul, int *status); int CFITS_API ffgcvk(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, int nulval, int *array, int *anynul, int *status); int CFITS_API ffgcve(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, float nulval, float *array, int *anynul, int *status); int CFITS_API ffgcvd(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, double nulval, double *array, int *anynul, int *status); int CFITS_API ffgcvc(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, float nulval, float *array, int *anynul, int *status); int CFITS_API ffgcvm(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, double nulval, double *array, int *anynul, int *status); int CFITS_API ffgcx(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstbit, LONGLONG nbits, char *larray, int *status); int CFITS_API ffgcxui(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG nrows, long firstbit, int nbits, unsigned short *array, int *status); int CFITS_API ffgcxuk(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG nrows, long firstbit, int nbits, unsigned int *array, int *status); int CFITS_API ffgcfs(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, char **array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfl(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, char *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfb(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned char *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfsb(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, signed char *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfui(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned short *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfi(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, short *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfuj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned long *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfujj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, ULONGLONG *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfjj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, LONGLONG *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfuk(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned int *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfk(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, int *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfe(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, float *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfd(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, double *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfc(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, float *array, char *nularray, int *anynul, int *status); int CFITS_API ffgcfm(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, double *array, char *nularray, int *anynul, int *status); int CFITS_API ffgdes(fitsfile *fptr, int colnum, LONGLONG rownum, long *length, long *heapaddr, int *status); int CFITS_API ffgdesll(fitsfile *fptr, int colnum, LONGLONG rownum, LONGLONG *length, LONGLONG *heapaddr, int *status); int CFITS_API ffgdess(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG nrows, long *length, long *heapaddr, int *status); int CFITS_API ffgdessll(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG nrows, LONGLONG *length, LONGLONG *heapaddr, int *status); int CFITS_API ffpdes(fitsfile *fptr, int colnum, LONGLONG rownum, LONGLONG length, LONGLONG heapaddr, int *status); int CFITS_API fftheap(fitsfile *fptr, LONGLONG *heapsize, LONGLONG *unused, LONGLONG *overlap, int *valid, int *status); int CFITS_API ffcmph(fitsfile *fptr, int *status); int CFITS_API ffgtbb(fitsfile *fptr, LONGLONG firstrow, LONGLONG firstchar, LONGLONG nchars, unsigned char *values, int *status); int CFITS_API ffgextn(fitsfile *fptr, LONGLONG offset, LONGLONG nelem, void *array, int *status); int CFITS_API ffpextn(fitsfile *fptr, LONGLONG offset, LONGLONG nelem, void *array, int *status); /*------------ write primary array or image elements -------------*/ int CFITS_API ffppx(fitsfile *fptr, int datatype, long *firstpix, LONGLONG nelem, void *array, int *status); int CFITS_API ffppxll(fitsfile *fptr, int datatype, LONGLONG *firstpix, LONGLONG nelem, void *array, int *status); int CFITS_API ffppxn(fitsfile *fptr, int datatype, long *firstpix, LONGLONG nelem, void *array, void *nulval, int *status); int CFITS_API ffppxnll(fitsfile *fptr, int datatype, LONGLONG *firstpix, LONGLONG nelem, void *array, void *nulval, int *status); int CFITS_API ffppr(fitsfile *fptr, int datatype, LONGLONG firstelem, LONGLONG nelem, void *array, int *status); int CFITS_API ffpprb(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned char *array, int *status); int CFITS_API ffpprsb(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, signed char *array, int *status); int CFITS_API ffpprui(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned short *array, int *status); int CFITS_API ffppri(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, short *array, int *status); int CFITS_API ffppruj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned long *array, int *status); int CFITS_API ffpprj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, long *array, int *status); int CFITS_API ffppruk(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned int *array, int *status); int CFITS_API ffpprk(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, int *array, int *status); int CFITS_API ffppre(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, float *array, int *status); int CFITS_API ffpprd(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, double *array, int *status); int CFITS_API ffpprjj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, LONGLONG *array, int *status); int CFITS_API ffpprujj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, ULONGLONG *array, int *status); int CFITS_API ffppru(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, int *status); int CFITS_API ffpprn(fitsfile *fptr, LONGLONG firstelem, LONGLONG nelem, int *status); int CFITS_API ffppn(fitsfile *fptr, int datatype, LONGLONG firstelem, LONGLONG nelem, void *array, void *nulval, int *status); int CFITS_API ffppnb(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned char *array, unsigned char nulval, int *status); int CFITS_API ffppnsb(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, signed char *array, signed char nulval, int *status); int CFITS_API ffppnui(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned short *array, unsigned short nulval, int *status); int CFITS_API ffppni(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, short *array, short nulval, int *status); int CFITS_API ffppnj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, long *array, long nulval, int *status); int CFITS_API ffppnuj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned long *array, unsigned long nulval, int *status); int CFITS_API ffppnuk(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, unsigned int *array, unsigned int nulval, int *status); int CFITS_API ffppnk(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, int *array, int nulval, int *status); int CFITS_API ffppne(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, float *array, float nulval, int *status); int CFITS_API ffppnd(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, double *array, double nulval, int *status); int CFITS_API ffppnjj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, LONGLONG *array, LONGLONG nulval, int *status); int CFITS_API ffppnujj(fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelem, ULONGLONG *array, ULONGLONG nulval, int *status); int CFITS_API ffp2db(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, unsigned char *array, int *status); int CFITS_API ffp2dsb(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, signed char *array, int *status); int CFITS_API ffp2dui(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, unsigned short *array, int *status); int CFITS_API ffp2di(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, short *array, int *status); int CFITS_API ffp2duj(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, unsigned long *array, int *status); int CFITS_API ffp2dj(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, long *array, int *status); int CFITS_API ffp2duk(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, unsigned int *array, int *status); int CFITS_API ffp2dk(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, int *array, int *status); int CFITS_API ffp2de(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, float *array, int *status); int CFITS_API ffp2dd(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, double *array, int *status); int CFITS_API ffp2djj(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, LONGLONG *array, int *status); int CFITS_API ffp2dujj(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG naxis1, LONGLONG naxis2, ULONGLONG *array, int *status); int CFITS_API ffp3db(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, unsigned char *array, int *status); int CFITS_API ffp3dsb(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, signed char *array, int *status); int CFITS_API ffp3dui(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, unsigned short *array, int *status); int CFITS_API ffp3di(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, short *array, int *status); int CFITS_API ffp3duj(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, unsigned long *array, int *status); int CFITS_API ffp3dj(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, long *array, int *status); int CFITS_API ffp3duk(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, unsigned int *array, int *status); int CFITS_API ffp3dk(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, int *array, int *status); int CFITS_API ffp3de(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, float *array, int *status); int CFITS_API ffp3dd(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, double *array, int *status); int CFITS_API ffp3djj(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, LONGLONG *array, int *status); int CFITS_API ffp3dujj(fitsfile *fptr, long group, LONGLONG ncols, LONGLONG nrows, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, ULONGLONG *array, int *status); int CFITS_API ffpss(fitsfile *fptr, int datatype, long *fpixel, long *lpixel, void *array, int *status); int CFITS_API ffpssb(fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, unsigned char *array, int *status); int CFITS_API ffpsssb(fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, signed char *array, int *status); int CFITS_API ffpssui(fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, unsigned short *array, int *status); int CFITS_API ffpssi(fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, short *array, int *status); int CFITS_API ffpssuj(fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, unsigned long *array, int *status); int CFITS_API ffpssj(fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, long *array, int *status); int CFITS_API ffpssuk(fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, unsigned int *array, int *status); int CFITS_API ffpssk(fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, int *array, int *status); int CFITS_API ffpsse(fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, float *array, int *status); int CFITS_API ffpssd(fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, double *array, int *status); int CFITS_API ffpssjj(fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, LONGLONG *array, int *status); int CFITS_API ffpssujj(fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, ULONGLONG *array, int *status); int CFITS_API ffpgpb(fitsfile *fptr, long group, long firstelem, long nelem, unsigned char *array, int *status); int CFITS_API ffpgpsb(fitsfile *fptr, long group, long firstelem, long nelem, signed char *array, int *status); int CFITS_API ffpgpui(fitsfile *fptr, long group, long firstelem, long nelem, unsigned short *array, int *status); int CFITS_API ffpgpi(fitsfile *fptr, long group, long firstelem, long nelem, short *array, int *status); int CFITS_API ffpgpuj(fitsfile *fptr, long group, long firstelem, long nelem, unsigned long *array, int *status); int CFITS_API ffpgpj(fitsfile *fptr, long group, long firstelem, long nelem, long *array, int *status); int CFITS_API ffpgpuk(fitsfile *fptr, long group, long firstelem, long nelem, unsigned int *array, int *status); int CFITS_API ffpgpk(fitsfile *fptr, long group, long firstelem, long nelem, int *array, int *status); int CFITS_API ffpgpe(fitsfile *fptr, long group, long firstelem, long nelem, float *array, int *status); int CFITS_API ffpgpd(fitsfile *fptr, long group, long firstelem, long nelem, double *array, int *status); int CFITS_API ffpgpjj(fitsfile *fptr, long group, long firstelem, long nelem, LONGLONG *array, int *status); int CFITS_API ffpgpujj(fitsfile *fptr, long group, long firstelem, long nelem, ULONGLONG *array, int *status); /*--------------------- iterator functions -------------*/ int CFITS_API fits_iter_set_by_name(iteratorCol *col, fitsfile *fptr, char *colname, int datatype, int iotype); int CFITS_API fits_iter_set_by_num(iteratorCol *col, fitsfile *fptr, int colnum, int datatype, int iotype); int CFITS_API fits_iter_set_file(iteratorCol *col, fitsfile *fptr); int CFITS_API fits_iter_set_colname(iteratorCol *col, char *colname); int CFITS_API fits_iter_set_colnum(iteratorCol *col, int colnum); int CFITS_API fits_iter_set_datatype(iteratorCol *col, int datatype); int CFITS_API fits_iter_set_iotype(iteratorCol *col, int iotype); CFITS_API fitsfile * fits_iter_get_file(iteratorCol *col); char CFITS_API * fits_iter_get_colname(iteratorCol *col); int CFITS_API fits_iter_get_colnum(iteratorCol *col); int CFITS_API fits_iter_get_datatype(iteratorCol *col); int CFITS_API fits_iter_get_iotype(iteratorCol *col); void CFITS_API *fits_iter_get_array(iteratorCol *col); long CFITS_API fits_iter_get_tlmin(iteratorCol *col); long CFITS_API fits_iter_get_tlmax(iteratorCol *col); long CFITS_API fits_iter_get_repeat(iteratorCol *col); char CFITS_API *fits_iter_get_tunit(iteratorCol *col); char CFITS_API *fits_iter_get_tdisp(iteratorCol *col); int CFITS_API ffiter(int ncols, iteratorCol *data, long offset, long nPerLoop, int (*workFn)( long totaln, long offset, long firstn, long nvalues, int narrays, iteratorCol *data, void *userPointer), void *userPointer, int *status); /*--------------------- write column elements -------------*/ int CFITS_API ffpcl(fitsfile *fptr, int datatype, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, void *array, int *status); int CFITS_API ffpcls(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, char **array, int *status); int CFITS_API ffpcll(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, char *array, int *status); int CFITS_API ffpclb(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned char *array, int *status); int CFITS_API ffpclsb(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, signed char *array, int *status); int CFITS_API ffpclui(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned short *array, int *status); int CFITS_API ffpcli(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, short *array, int *status); int CFITS_API ffpcluj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned long *array, int *status); int CFITS_API ffpclj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long *array, int *status); int CFITS_API ffpcluk(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned int *array, int *status); int CFITS_API ffpclk(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, int *array, int *status); int CFITS_API ffpcle(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, float *array, int *status); int CFITS_API ffpcld(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, double *array, int *status); int CFITS_API ffpclc(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, float *array, int *status); int CFITS_API ffpclm(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, double *array, int *status); int CFITS_API ffpclu(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, int *status); int CFITS_API ffprwu(fitsfile *fptr, LONGLONG firstrow, LONGLONG nrows, int *status); int CFITS_API ffpcljj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, LONGLONG *array, int *status); int CFITS_API ffpclujj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, ULONGLONG *array, int *status); int CFITS_API ffpclx(fitsfile *fptr, int colnum, LONGLONG frow, long fbit, long nbit, char *larray, int *status); int CFITS_API ffpcn(fitsfile *fptr, int datatype, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, void *array, void *nulval, int *status); int CFITS_API ffpcns( fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, char **array, char *nulvalue, int *status); int CFITS_API ffpcnl( fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, char *array, char nulvalue, int *status); int CFITS_API ffpcnb(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned char *array, unsigned char nulvalue, int *status); int CFITS_API ffpcnsb(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, signed char *array, signed char nulvalue, int *status); int CFITS_API ffpcnui(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned short *array, unsigned short nulvalue, int *status); int CFITS_API ffpcni(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, short *array, short nulvalue, int *status); int CFITS_API ffpcnuj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned long *array, unsigned long nulvalue, int *status); int CFITS_API ffpcnj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, long *array, long nulvalue, int *status); int CFITS_API ffpcnuk(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, unsigned int *array, unsigned int nulvalue, int *status); int CFITS_API ffpcnk(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, int *array, int nulvalue, int *status); int CFITS_API ffpcne(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, float *array, float nulvalue, int *status); int CFITS_API ffpcnd(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, double *array, double nulvalue, int *status); int CFITS_API ffpcnjj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, LONGLONG *array, LONGLONG nulvalue, int *status); int CFITS_API ffpcnujj(fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelem, ULONGLONG *array, ULONGLONG nulvalue, int *status); int CFITS_API ffptbb(fitsfile *fptr, LONGLONG firstrow, LONGLONG firstchar, LONGLONG nchars, unsigned char *values, int *status); int CFITS_API ffirow(fitsfile *fptr, LONGLONG firstrow, LONGLONG nrows, int *status); int CFITS_API ffdrow(fitsfile *fptr, LONGLONG firstrow, LONGLONG nrows, int *status); int CFITS_API ffdrrg(fitsfile *fptr, char *ranges, int *status); int CFITS_API ffdrws(fitsfile *fptr, long *rownum, long nrows, int *status); int CFITS_API ffdrwsll(fitsfile *fptr, LONGLONG *rownum, LONGLONG nrows, int *status); int CFITS_API fficol(fitsfile *fptr, int numcol, char *ttype, char *tform, int *status); int CFITS_API fficls(fitsfile *fptr, int firstcol, int ncols, char **ttype, char **tform, int *status); int CFITS_API ffmvec(fitsfile *fptr, int colnum, LONGLONG newveclen, int *status); int CFITS_API ffdcol(fitsfile *fptr, int numcol, int *status); int CFITS_API ffcpcl(fitsfile *infptr, fitsfile *outfptr, int incol, int outcol, int create_col, int *status); int CFITS_API ffccls(fitsfile *infptr, fitsfile *outfptr, int incol, int outcol, int ncols, int create_col, int *status); int CFITS_API ffcprw(fitsfile *infptr, fitsfile *outfptr, LONGLONG firstrow, LONGLONG nrows, int *status); /*--------------------- WCS Utilities ------------------*/ int CFITS_API ffgics(fitsfile *fptr, double *xrval, double *yrval, double *xrpix, double *yrpix, double *xinc, double *yinc, double *rot, char *type, int *status); int CFITS_API ffgicsa(fitsfile *fptr, char version, double *xrval, double *yrval, double *xrpix, double *yrpix, double *xinc, double *yinc, double *rot, char *type, int *status); int CFITS_API ffgtcs(fitsfile *fptr, int xcol, int ycol, double *xrval, double *yrval, double *xrpix, double *yrpix, double *xinc, double *yinc, double *rot, char *type, int *status); int CFITS_API ffwldp(double xpix, double ypix, double xref, double yref, double xrefpix, double yrefpix, double xinc, double yinc, double rot, char *type, double *xpos, double *ypos, int *status); int CFITS_API ffxypx(double xpos, double ypos, double xref, double yref, double xrefpix, double yrefpix, double xinc, double yinc, double rot, char *type, double *xpix, double *ypix, int *status); /* WCS support routines (provide interface to Doug Mink's WCS library */ int CFITS_API ffgiwcs(fitsfile *fptr, char **header, int *status); int CFITS_API ffgtwcs(fitsfile *fptr, int xcol, int ycol, char **header, int *status); /*--------------------- lexical parsing routines ------------------*/ int CFITS_API fftexp( fitsfile *fptr, char *expr, int maxdim, int *datatype, long *nelem, int *naxis, long *naxes, int *status ); int CFITS_API fffrow( fitsfile *infptr, char *expr, long firstrow, long nrows, long *n_good_rows, char *row_status, int *status); int CFITS_API ffffrw( fitsfile *fptr, char *expr, long *rownum, int *status); int CFITS_API fffrwc( fitsfile *fptr, char *expr, char *timeCol, char *parCol, char *valCol, long ntimes, double *times, char *time_status, int *status ); int CFITS_API ffsrow( fitsfile *infptr, fitsfile *outfptr, char *expr, int *status); int CFITS_API ffcrow( fitsfile *fptr, int datatype, char *expr, long firstrow, long nelements, void *nulval, void *array, int *anynul, int *status ); int CFITS_API ffcalc_rng( fitsfile *infptr, char *expr, fitsfile *outfptr, char *parName, char *parInfo, int nRngs, long *start, long *end, int *status ); int CFITS_API ffcalc( fitsfile *infptr, char *expr, fitsfile *outfptr, char *parName, char *parInfo, int *status ); /* ffhist is not really intended as a user-callable routine */ /* but it may be useful for some specialized applications */ /* ffhist2 is a newer version which is strongly recommended instead of ffhist */ int CFITS_API ffhist(fitsfile **fptr, char *outfile, int imagetype, int naxis, char colname[4][FLEN_VALUE], double *minin, double *maxin, double *binsizein, char minname[4][FLEN_VALUE], char maxname[4][FLEN_VALUE], char binname[4][FLEN_VALUE], double weightin, char wtcol[FLEN_VALUE], int recip, char *rowselect, int *status); int CFITS_API ffhist2(fitsfile **fptr, char *outfile, int imagetype, int naxis, char colname[4][FLEN_VALUE], double *minin, double *maxin, double *binsizein, char minname[4][FLEN_VALUE], char maxname[4][FLEN_VALUE], char binname[4][FLEN_VALUE], double weightin, char wtcol[FLEN_VALUE], int recip, char *rowselect, int *status); CFITS_API fitsfile *ffhist3(fitsfile *fptr, char *outfile, int imagetype, int naxis, char colname[4][FLEN_VALUE], double *minin, double *maxin, double *binsizein, char minname[4][FLEN_VALUE], char maxname[4][FLEN_VALUE], char binname[4][FLEN_VALUE], double weightin, char wtcol[FLEN_VALUE], int recip, char *selectrow, int *status); int CFITS_API fits_select_image_section(fitsfile **fptr, char *outfile, char *imagesection, int *status); int CFITS_API fits_copy_image_section(fitsfile *infptr, fitsfile *outfile, char *imagesection, int *status); int CFITS_API fits_calc_binning(fitsfile *fptr, int naxis, char colname[4][FLEN_VALUE], double *minin, double *maxin, double *binsizein, char minname[4][FLEN_VALUE], char maxname[4][FLEN_VALUE], char binname[4][FLEN_VALUE], int *colnum, long *haxes, float *amin, float *amax, float *binsize, int *status); int CFITS_API fits_calc_binningd(fitsfile *fptr, int naxis, char colname[4][FLEN_VALUE], double *minin, double *maxin, double *binsizein, char minname[4][FLEN_VALUE], char maxname[4][FLEN_VALUE], char binname[4][FLEN_VALUE], int *colnum, long *haxes, double *amin, double *amax, double *binsize, int *status); int CFITS_API fits_write_keys_histo(fitsfile *fptr, fitsfile *histptr, int naxis, int *colnum, int *status); int CFITS_API fits_rebin_wcs( fitsfile *fptr, int naxis, float *amin, float *binsize, int *status); int CFITS_API fits_rebin_wcsd( fitsfile *fptr, int naxis, double *amin, double *binsize, int *status); int CFITS_API fits_make_hist(fitsfile *fptr, fitsfile *histptr, int bitpix,int naxis, long *naxes, int *colnum, float *amin, float *amax, float *binsize, float weight, int wtcolnum, int recip, char *selectrow, int *status); int CFITS_API fits_make_histd(fitsfile *fptr, fitsfile *histptr, int bitpix,int naxis, long *naxes, int *colnum, double *amin, double *amax, double *binsize, double weight, int wtcolnum, int recip, char *selectrow, int *status); typedef struct { /* input(s) */ int count; char ** path; char ** tag; fitsfile ** ifptr; char * expression; /* output control */ int bitpix; long blank; fitsfile * ofptr; char keyword[FLEN_KEYWORD]; char comment[FLEN_COMMENT]; } PixelFilter; int CFITS_API fits_pixel_filter (PixelFilter * filter, int * status); /*--------------------- grouping routines ------------------*/ int CFITS_API ffgtcr(fitsfile *fptr, char *grpname, int grouptype, int *status); int CFITS_API ffgtis(fitsfile *fptr, char *grpname, int grouptype, int *status); int CFITS_API ffgtch(fitsfile *gfptr, int grouptype, int *status); int CFITS_API ffgtrm(fitsfile *gfptr, int rmopt, int *status); int CFITS_API ffgtcp(fitsfile *infptr, fitsfile *outfptr, int cpopt, int *status); int CFITS_API ffgtmg(fitsfile *infptr, fitsfile *outfptr, int mgopt, int *status); int CFITS_API ffgtcm(fitsfile *gfptr, int cmopt, int *status); int CFITS_API ffgtvf(fitsfile *gfptr, long *firstfailed, int *status); int CFITS_API ffgtop(fitsfile *mfptr,int group,fitsfile **gfptr,int *status); int CFITS_API ffgtam(fitsfile *gfptr, fitsfile *mfptr, int hdupos, int *status); int CFITS_API ffgtnm(fitsfile *gfptr, long *nmembers, int *status); int CFITS_API ffgmng(fitsfile *mfptr, long *nmembers, int *status); int CFITS_API ffgmop(fitsfile *gfptr, long member, fitsfile **mfptr, int *status); int CFITS_API ffgmcp(fitsfile *gfptr, fitsfile *mfptr, long member, int cpopt, int *status); int CFITS_API ffgmtf(fitsfile *infptr, fitsfile *outfptr, long member, int tfopt, int *status); int CFITS_API ffgmrm(fitsfile *fptr, long member, int rmopt, int *status); /*--------------------- group template parser routines ------------------*/ int CFITS_API fits_execute_template(fitsfile *ff, char *ngp_template, int *status); int CFITS_API fits_img_stats_short(short *array,long nx, long ny, int nullcheck, short nullvalue,long *ngoodpix, short *minvalue, short *maxvalue, double *mean, double *sigma, double *noise1, double *noise2, double *noise3, double *noise5, int *status); int CFITS_API fits_img_stats_int(int *array,long nx, long ny, int nullcheck, int nullvalue,long *ngoodpix, int *minvalue, int *maxvalue, double *mean, double *sigma, double *noise1, double *noise2, double *noise3, double *noise5, int *status); int CFITS_API fits_img_stats_float(float *array, long nx, long ny, int nullcheck, float nullvalue,long *ngoodpix, float *minvalue, float *maxvalue, double *mean, double *sigma, double *noise1, double *noise2, double *noise3, double *noise5, int *status); /*--------------------- image compression routines ------------------*/ int CFITS_API fits_set_compression_type(fitsfile *fptr, int ctype, int *status); int CFITS_API fits_set_tile_dim(fitsfile *fptr, int ndim, long *dims, int *status); int CFITS_API fits_set_noise_bits(fitsfile *fptr, int noisebits, int *status); int CFITS_API fits_set_quantize_level(fitsfile *fptr, float qlevel, int *status); int CFITS_API fits_set_hcomp_scale(fitsfile *fptr, float scale, int *status); int CFITS_API fits_set_hcomp_smooth(fitsfile *fptr, int smooth, int *status); int CFITS_API fits_set_quantize_method(fitsfile *fptr, int method, int *status); int CFITS_API fits_set_quantize_dither(fitsfile *fptr, int dither, int *status); int CFITS_API fits_set_dither_seed(fitsfile *fptr, int seed, int *status); int CFITS_API fits_set_dither_offset(fitsfile *fptr, int offset, int *status); int CFITS_API fits_set_lossy_int(fitsfile *fptr, int lossy_int, int *status); int CFITS_API fits_set_huge_hdu(fitsfile *fptr, int huge, int *status); int CFITS_API fits_set_compression_pref(fitsfile *infptr, fitsfile *outfptr, int *status); int CFITS_API fits_get_compression_type(fitsfile *fptr, int *ctype, int *status); int CFITS_API fits_get_tile_dim(fitsfile *fptr, int ndim, long *dims, int *status); int CFITS_API fits_get_quantize_level(fitsfile *fptr, float *qlevel, int *status); int CFITS_API fits_get_noise_bits(fitsfile *fptr, int *noisebits, int *status); int CFITS_API fits_get_hcomp_scale(fitsfile *fptr, float *scale, int *status); int CFITS_API fits_get_hcomp_smooth(fitsfile *fptr, int *smooth, int *status); int CFITS_API fits_get_dither_seed(fitsfile *fptr, int *seed, int *status); int CFITS_API fits_img_compress(fitsfile *infptr, fitsfile *outfptr, int *status); int CFITS_API fits_compress_img(fitsfile *infptr, fitsfile *outfptr, int compress_type, long *tilesize, int parm1, int parm2, int *status); int CFITS_API fits_is_compressed_image(fitsfile *fptr, int *status); int CFITS_API fits_is_reentrant(void); int CFITS_API fits_decompress_img (fitsfile *infptr, fitsfile *outfptr, int *status); int CFITS_API fits_img_decompress_header(fitsfile *infptr, fitsfile *outfptr, int *status); int CFITS_API fits_img_decompress (fitsfile *infptr, fitsfile *outfptr, int *status); /* H-compress routines */ int CFITS_API fits_hcompress(int *a, int nx, int ny, int scale, char *output, long *nbytes, int *status); int CFITS_API fits_hcompress64(LONGLONG *a, int nx, int ny, int scale, char *output, long *nbytes, int *status); int CFITS_API fits_hdecompress(unsigned char *input, int smooth, int *a, int *nx, int *ny, int *scale, int *status); int CFITS_API fits_hdecompress64(unsigned char *input, int smooth, LONGLONG *a, int *nx, int *ny, int *scale, int *status); int CFITS_API fits_compress_table (fitsfile *infptr, fitsfile *outfptr, int *status); int CFITS_API fits_uncompress_table(fitsfile *infptr, fitsfile *outfptr, int *status); /* curl library wrapper routines (for https access) */ int CFITS_API fits_init_https(void); int CFITS_API fits_cleanup_https(void); void CFITS_API fits_verbose_https(int flag); void CFITS_API ffshdwn(int flag); int CFITS_API ffgtmo(void); int CFITS_API ffstmo(int sec, int *status); /* The following exclusion if __CINT__ is defined is needed for ROOT */ #ifndef __CINT__ #ifdef __cplusplus } #endif #endif #endif cfitsio-3.47/fpack.c0000644000225700000360000003761413464573432013653 0ustar cagordonlhea/* FPACK * R. Seaman, NOAO, with a few enhancements by W. Pence, HEASARC * * Calls fits_img_compress in the CFITSIO library by W. Pence, HEASARC */ #include /* #include */ #include "fitsio.h" #include "fpack.h" /* ================================================================== */ int main(int argc, char *argv[]) { fpstate fpvar; if (argc <= 1) { fp_usage (); fp_hint (); exit (-1); } fp_init (&fpvar); fp_get_param (argc, argv, &fpvar); if (fpvar.listonly) { fp_list (argc, argv, fpvar); } else { fp_preflight (argc, argv, FPACK, &fpvar); fp_loop (argc, argv, FPACK, fpvar); } exit (0); } /* ================================================================== */ int fp_get_param (int argc, char *argv[], fpstate *fpptr) { int gottype=0, gottile=0, wholetile=0, iarg, len, ndim, ii, doffset; int gotR=0, gotO=0; char tmp[SZ_STR], tile[SZ_STR]; if (fpptr->initialized != FP_INIT_MAGIC) { fp_msg ("Error: internal initialization error\n"); exit (-1); } tile[0] = 0; /* flags must come first and be separately specified */ for (iarg = 1; iarg < argc; iarg++) { if ((argv[iarg][0] == '-' && strlen (argv[iarg]) == 2) || !strncmp(argv[iarg], "-q", 2) || !strncmp(argv[iarg], "-qz", 3) || !strncmp(argv[iarg], "-g1", 3) || !strncmp(argv[iarg], "-g2", 3) || !strncmp(argv[iarg], "-i2f", 4) || !strncmp(argv[iarg], "-n3ratio", 8) || !strncmp(argv[iarg], "-n3min", 6) || !strncmp(argv[iarg], "-tableonly", 10) || !strncmp(argv[iarg], "-table", 6) ) { /* Rice is the default, so -r is superfluous */ if ( argv[iarg][1] == 'r') { fpptr->comptype = RICE_1; if (gottype) { fp_msg ("Error: multiple compression flags\n"); fp_usage (); exit (-1); } else gottype++; } else if (argv[iarg][1] == 'p') { fpptr->comptype = PLIO_1; if (gottype) { fp_msg ("Error: multiple compression flags\n"); fp_usage (); exit (-1); } else gottype++; } else if (argv[iarg][1] == 'g') { /* test for modifiers following the 'g' */ if (argv[iarg][2] == '2') fpptr->comptype = GZIP_2; else fpptr->comptype = GZIP_1; if (gottype) { fp_msg ("Error: multiple compression flags\n"); fp_usage (); exit (-1); } else gottype++; /* } else if (argv[iarg][1] == 'b') { fpptr->comptype = BZIP2_1; if (gottype) { fp_msg ("Error: multiple compression flags\n"); fp_usage (); exit (-1); } else gottype++; */ } else if (argv[iarg][1] == 'h') { fpptr->comptype = HCOMPRESS_1; if (gottype) { fp_msg ("Error: multiple compression flags\n"); fp_usage (); exit (-1); } else gottype++; } else if (argv[iarg][1] == 'd') { fpptr->comptype = NOCOMPRESS; if (gottype) { fp_msg ("Error: multiple compression flags\n"); fp_usage (); exit (-1); } else gottype++; } else if (!strcmp(argv[iarg], "-i2f")) { /* this means convert integer images to float, and then */ /* quantize and compress the float image. This lossy */ /* compression method may give higher compression than the */ /* lossless compression method that is usually applied to */ /* integer images. */ fpptr->int_to_float = 1; } else if (!strcmp(argv[iarg], "-n3ratio")) { /* this is the minimum ratio between the MAD noise sigma */ /* and the q parameter value in the case where the integer */ /* image is quantized and compressed like a float image. */ if (++iarg >= argc) { fp_usage (); exit (-1); } else { fpptr->n3ratio = (float) atof (argv[iarg]); } } else if (!strcmp(argv[iarg], "-n3min")) { /* this is the minimum MAD noise sigma in the case where the */ /* integer image is quantized and compressed like a float image. */ if (++iarg >= argc) { fp_usage (); exit (-1); } else { fpptr->n3min = (float) atof (argv[iarg]); } } else if (argv[iarg][1] == 'q') { /* test for modifiers following the 'q' */ if (argv[iarg][2] == 'z') { fpptr->dither_method = 2; /* preserve zero pixels */ if (argv[iarg][3] == 't') { fpptr->dither_offset = -1; /* dither based on tile checksum */ } else if (isdigit(argv[iarg][3])) { /* is a number appended to q? */ doffset = atoi(argv[iarg]+3); if (doffset == 0) { fpptr->no_dither = 1; /* don't dither the quantized values */ } else if (doffset > 0 && doffset <= 10000) { fpptr->dither_offset = doffset; } else { fp_msg ("Error: invalid q suffix\n"); fp_usage (); exit (-1); } } } else { if (argv[iarg][2] == 't') { fpptr->dither_offset = -1; /* dither based on tile checksum */ } else if (isdigit(argv[iarg][2])) { /* is a number appended to q? */ doffset = atoi(argv[iarg]+2); if (doffset == 0) { fpptr->no_dither = 1; /* don't dither the quantized values */ } else if (doffset > 0 && doffset <= 10000) { fpptr->dither_offset = doffset; } else { fp_msg ("Error: invalid q suffix\n"); fp_usage (); exit (-1); } } } if (++iarg >= argc) { fp_usage (); exit (-1); } else { fpptr->quantize_level = (float) atof (argv[iarg]); } } else if (argv[iarg][1] == 'n') { if (++iarg >= argc) { fp_usage (); exit (-1); } else { fpptr->rescale_noise = (float) atof (argv[iarg]); } } else if (argv[iarg][1] == 's') { if (++iarg >= argc) { fp_usage (); exit (-1); } else { fpptr->scale = (float) atof (argv[iarg]); } } else if (!strcmp(argv[iarg], "-tableonly")) { fpptr->do_tables = 1; fpptr->do_images = 0; /* Do not write this to stdout via fp_msg. Otherwise it will be placed at start of piped FITS file, which will then be corrupted. */ fprintf(stderr,"Note: -tableonly is intended for feasibility studies, not general use.\n"); } else if (!strcmp(argv[iarg], "-table")) { fpptr->do_tables = 1; fprintf(stderr, "Note: -table is intended for feasibility studies, not general use.\n"); } else if (argv[iarg][1] == 't') { if (gottile) { fp_msg ("Error: multiple tile specifications\n"); fp_usage (); exit (-1); } else gottile++; if (++iarg >= argc) { fp_usage (); exit (-1); } else { strncpy (tile, argv[iarg], SZ_STR-1); /* checked below */ tile[SZ_STR-1]=0; } } else if (argv[iarg][1] == 'v') { fpptr->verbose = 1; } else if (argv[iarg][1] == 'w') { wholetile++; if (gottile) { fp_msg ("Error: multiple tile specifications\n"); fp_usage (); exit (-1); } else gottile++; } else if (argv[iarg][1] == 'F') { fpptr->clobber++; /* overwrite existing file */ } else if (argv[iarg][1] == 'D') { fpptr->delete_input++; } else if (argv[iarg][1] == 'Y') { fpptr->do_not_prompt++; } else if (argv[iarg][1] == 'S') { fpptr->to_stdout++; } else if (argv[iarg][1] == 'L') { fpptr->listonly++; } else if (argv[iarg][1] == 'C') { fpptr->do_checksums = 0; } else if (argv[iarg][1] == 'T') { fpptr->test_all = 1; } else if (argv[iarg][1] == 'R') { if (gotO) { fp_msg("Error: -R option is not allowed with -O\n"); exit(-1); } else if (++iarg >= argc) { fp_usage (); fp_hint (); exit (-1); } else { strncpy (fpptr->outfile, argv[iarg], SZ_STR-1); fpptr->outfile[SZ_STR-1]=0; gotR=1; } } else if (argv[iarg][1] == 'H') { fp_help (); exit (0); } else if (argv[iarg][1] == 'V') { fp_version (); exit (0); } else if (argv[iarg][1] == 'O') { if (gotR) { fp_msg("Error: -O option is not allowed with -R\n"); exit(-1); } else if (++iarg >= argc) { fp_usage (); fp_hint (); exit (-1); } else { strncpy (fpptr->outfile, argv[iarg], SZ_STR-1); fpptr->outfile[SZ_STR-1]=0; gotO=1; } } else { fp_msg ("Error: unknown command line flag `"); fp_msg (argv[iarg]); fp_msg ("'\n"); fp_usage (); fp_hint (); exit (-1); } } else break; } /* In earlier loop, already made sure both -O and -R are not being used. This is essential, as each must store info in the same 'outfile' array. Now do additional tests of -O and -R with other flags. */ if (gotR && !fpptr->test_all) { fp_msg("Error: -R option may only be used with -T\n"); exit(-1); } if (gotO && (fpptr->test_all || fpptr->to_stdout)) { fp_msg("Error: -O option may not be used with -S or -T\n"); exit(-1); } if (fpptr->scale != 0. && fpptr->comptype != HCOMPRESS_1 && fpptr->test_all != 1) { fp_msg ("Error: `-s' requires `-h or -T'\n"); exit (-1); } if (fpptr->quantize_level == 0) { if ((fpptr->comptype != GZIP_1) && (fpptr->comptype != GZIP_2)) { fp_msg ("Error: `-q 0' only allowed with GZIP\n"); exit (-1); } if (fpptr->int_to_float == 1) { fp_msg ("Error: `-q 0' not allowed with -i2f\n"); exit (-1); } } if (wholetile) { for (ndim=0; ndim < MAX_COMPRESS_DIM; ndim++) fpptr->ntile[ndim] = (long) -1; } else if (gottile) { len = strlen (tile); for (ii=0, ndim=0; ii < len; ) { if (! (isdigit (tile[ii]) || tile[ii] == ',')) { fp_msg ("Error: `-t' requires comma separated tile dims, "); fp_msg ("e.g., `-t 100,100'\n"); exit (-1); } if (tile[ii] == ',') { ii++; continue; } fpptr->ntile[ndim] = atol (&tile[ii]); for ( ; isdigit(tile[ii]); ii++); if (++ndim > MAX_COMPRESS_DIM) { fp_msg ("Error: too many dimensions for `-t', max="); snprintf (tmp, SZ_STR,"%d\n", MAX_COMPRESS_DIM); fp_msg (tmp); exit (-1); } } } if (iarg >= argc) { fp_msg ("Error: no FITS files to compress\n"); fp_usage (); exit (-1); } else fpptr->firstfile = iarg; return(0); } /* ================================================================== */ int fp_usage (void) { fp_msg ("usage: fpack "); fp_msg ( "[-r|-h|-g|-p] [-w|-t ] [-q ] [-s ] [-n ] -v \n"); fp_msg ("more: [-T] [-R] [-F] [-D] [-Y] [-O ] [-S] [-L] [-C] [-H] [-V] [-i2f]\n"); return(0); } /* ================================================================== */ int fp_hint (void) { fp_msg (" `fpack -H' for help\n"); return(0); } /* ================================================================== */ int fp_help (void) { fp_msg ("fpack, a FITS image compression program. Version "); fp_version (); fp_usage (); fp_msg ("\n"); fp_msg ("NOTE: the compression parameters specified on the fpack command line may\n"); fp_msg ("be over-ridden by compression directive keywords in the header of each HDU\n"); fp_msg ("of the input file(s). See the fpack User's Guide for more details\n"); fp_msg ("\n"); fp_msg ("Flags must be separate and appear before filenames:\n"); fp_msg (" -r Rice compression [default], or\n"); fp_msg (" -h Hcompress compression, or\n"); fp_msg (" -g or -g1 GZIP_1 (per-tile) compression, or\n"); fp_msg (" -g2 GZIP_2 (per-tile) compression (with byte shuffling), or\n"); /* fp_msg (" -b BZIP2 (per-tile) compression, or\n"); */ fp_msg (" -p PLIO compression (only for positive 8 or 16-bit integer images).\n"); fp_msg (" -d Tile the image without compression (debugging mode).\n"); fp_msg (" -w Compress the whole image as a single large tile.\n"); fp_msg (" -t Comma separated list of tile dimensions [default is row by row].\n"); fp_msg (" -q Quantized level spacing when converting floating point images to\n"); fp_msg (" scaled integers. (+value relative to sigma of background noise;\n"); fp_msg (" -value is absolute). Default q value of 4 gives a compression ratio\n"); fp_msg (" of about 6 with very high fidelity (only 0.26% increase in noise).\n"); fp_msg (" Using q values of 2, or 1 will give compression ratios of\n"); fp_msg (" about 8, or 10, respectively (with 1.0% or 4.1% noise increase).\n"); fp_msg (" The scaled quantized values are randomly dithered using a seed \n"); fp_msg (" value determined from the system clock at run time.\n"); fp_msg (" Use -q0 instead of -q to suppress random dithering.\n"); fp_msg (" Use -qz instead of -q to not dither zero-valued pixels.\n"); fp_msg (" Use -qt or -qzt to compute random dithering seed from first tile checksum.\n"); fp_msg (" Use -qN or -qzN, (N in range 1 to 10000) to use a specific dithering seed.\n"); fp_msg (" Floating-point images can be losslessly compressed by selecting\n"); fp_msg (" the GZIP algorithm and specifying -q 0, but this is slower and often\n"); fp_msg (" produces much less compression than the default quantization method.\n"); fp_msg (" -i2f Convert integer images to floating point, then quantize and compress\n"); fp_msg (" using the specified q level. When used appropriately, this lossy\n"); fp_msg (" compression method can give much better compression than the normal\n"); fp_msg (" lossless compression methods without significant loss of information.\n"); fp_msg (" The -n3ratio and -n3min flags control the minimum noise thresholds;\n"); fp_msg (" Images below these thresholds will be losslessly compressed.\n"); fp_msg (" -n3ratio Minimum ratio of background noise sigma divided by q. Default = 2.0.\n"); fp_msg (" -n3min Minimum background noise sigma. Default = 6. The -i2f flag will be ignored\n"); fp_msg (" if the noise level in the image does not exceed both thresholds.\n"); fp_msg (" -s Scale factor for lossy Hcompress [default = 0 = lossless]\n"); fp_msg (" (+values relative to RMS noise; -value is absolute)\n"); fp_msg (" -n Rescale scaled-integer images to reduce noise and improve compression.\n"); fp_msg (" -v Verbose mode; list each file as it is processed.\n"); fp_msg (" -T Show compression algorithm comparison test statistics; files unchanged.\n"); fp_msg (" -R Write the comparison test report (above) to a text file.\n"); fp_msg (" -table Compress FITS binary tables as well as compress any image HDUs.\n"); fp_msg (" -tableonly Compress only FITS binary tables; do not compress any image HDUs.\n"); fp_msg (" \n"); fp_msg ("\nkeywords shared with funpack:\n"); fp_msg (" -F Overwrite input file by output file with same name.\n"); fp_msg (" -D Delete input file after writing output.\n"); fp_msg (" -Y Suppress prompts to confirm -F or -D options.\n"); fp_msg (" -O Specify full output file name. This may be used only when fpack\n"); fp_msg (" is run on a single input file.\n"); fp_msg (" -S Output compressed FITS files to STDOUT.\n"); fp_msg (" -L List contents; files unchanged.\n"); fp_msg (" -C Don't update FITS checksum keywords.\n"); fp_msg (" -H Show this message.\n"); fp_msg (" -V Show version number.\n"); fp_msg ("\n FITS files to pack; enter '-' (a hyphen) to read input from stdin stream.\n"); fp_msg (" Refer to the fpack User's Guide for more extensive help.\n"); return(0); } cfitsio-3.47/fpack.h0000644000225700000360000001576313464573432013661 0ustar cagordonlhea/* used by FPACK and FUNPACK * R. Seaman, NOAO * W. Pence, NASA/GSFC */ #include #include #include /* not needed any more */ /* #include */ /* #include */ /* #include */ #define FPACK_VERSION "1.7.0 (Dec 2013)" /* VERSION History 1.7.0 (Dec 2013) - extensive changes to the binary table compression method. All types of binary table columns, including variable length array columns are now supported. The command line table compression flag has been changed to "-table" instead of "-BETAtable", and a new "-tableonly" flag has been introduced to only compress the binary tables in the input files(s) and not the image HDUs. 1.6.1 (Mar 2013) - numerous changes to the BETAtable compression method used to compress binary tables - added support for compression 'steering' keywords that specify the desired compression parameters that should be used when compressing that particular HDU, thus overriding the fpack command line parameter values. 1.6.0 (June 2012) - Fixed behavior of the "rename" function on Windows platforms so that it will clobber/delete an existing file before renaming a file to that name (the rename command behaves differently on POSIX and non-POSIX environments). 1.6.0 (February 2011) - Added full support for compressing and uncompressing FITS binary tables using a newly proposed format convention. This is intended only for further feasibility studies, and is not recommended for use with publicly distributed FITS files. - Use the minimum of the MAD 2nd, 3rd, and 5th order values as a more conservative extimate of the noise when quantizing floating point images. - Enhanced the tile compression routines so that a tile that contains all NaN pixel values will be compressed. - When uncompressing an image that was originally in a FITS primary array, funpack will also append any new keywords that were written into the primary array of the compressed FITS file after the file was compressed. - Added support for the GZIP_2 algorithm, which shuffles the bytes in the pixel values prior to compressing them with gzip. 1.5.1 (December 2010) Added prototype, mainly hidden, support for compressing binary tables. 1.5.0 (August 2010) Added the -i2f option to lossy compress integer images. 1.4.0 (Jan 2010) Reduced the default value for the q floating point image quantization parameter from 16 to 4. This results in about 50% better compression (from about 4.6x to 6.4) with no lost of significant information (with the new subtractive dithering enhancement). Replaced the code for generating temporary filenames to make the code more portable (to Windows). Replaced calls to the unix 'access' and 'stat' functions with more portable code. When unpacking a file, write it first to a temporary file, then rename it when finished, so that other tasks cannot try to read the file before it is complete. 1.3.0 (Oct 2009) added randomization to the dithering pattern so that the same pattern is not used for every image; also added an option for losslessly compressing floating point images with GZIP for test purposes (not recommended for general use). Also added support for reading the input FITS file from the stdin file streams. 1.2.0 (Sept 2009) added subtractive dithering feature (in CFITSIO) when quantizing floating point images; When packing an IRAF .imh + .pix image, the file name is changed to FILE.fits.fz, and if the original file is deleted, then both the .imh and .pix files are deleted. 1.1.4 (May 2009) added -E option to funpack to unpack a list of HDUs 1.1.3 (March 2009) minor modifications to the content and format of the -T report 1.1.2 (September 2008) */ #define FP_INIT_MAGIC 42 #define FPACK 0 #define FUNPACK 1 /* changed from 16 in Jan. 2010 */ #define DEF_QLEVEL 4. #define DEF_HCOMP_SCALE 0. #define DEF_HCOMP_SMOOTH 0 #define DEF_RESCALE_NOISE 0 #define SZ_STR 513 #define SZ_CARD 81 typedef struct { int comptype; float quantize_level; int no_dither; int dither_offset; int dither_method; float scale; float rescale_noise; int smooth; int int_to_float; float n3ratio; float n3min; long ntile[MAX_COMPRESS_DIM]; int to_stdout; int listonly; int clobber; int delete_input; int do_not_prompt; int do_checksums; int do_gzip_file; int do_images; int do_tables; int test_all; int verbose; char prefix[SZ_STR]; char extname[SZ_STR]; int delete_suffix; char outfile[SZ_STR]; int firstfile; int initialized; int preflight_checked; } fpstate; typedef struct { int n_nulls; double minval; double maxval; double mean; double sigma; double noise1; double noise2; double noise3; double noise5; } imgstats; int fp_get_param (int argc, char *argv[], fpstate *fpptr); void abort_fpack(int sig); void fp_abort_output (fitsfile *infptr, fitsfile *outfptr, int stat); int fp_usage (void); int fp_help (void); int fp_hint (void); int fp_init (fpstate *fpptr); int fp_list (int argc, char *argv[], fpstate fpvar); int fp_info (char *infits); int fp_info_hdu (fitsfile *infptr); int fp_preflight (int argc, char *argv[], int unpack, fpstate *fpptr); int fp_loop (int argc, char *argv[], int unpack, fpstate fpvar); int fp_pack (char *infits, char *outfits, fpstate fpvar, int *islossless); int fp_unpack (char *infits, char *outfits, fpstate fpvar); int fp_test (char *infits, char *outfits, char *outfits2, fpstate fpvar); int fp_pack_hdu (fitsfile *infptr, fitsfile *outfptr, fpstate fpvar, int *islossless, int *status); int fp_unpack_hdu (fitsfile *infptr, fitsfile *outfptr, fpstate fpvar, int *status); int fits_read_image_speed (fitsfile *infptr, float *whole_elapse, float *whole_cpu, float *row_elapse, float *row_cpu, int *status); int fp_test_hdu (fitsfile *infptr, fitsfile *outfptr, fitsfile *outfptr2, fpstate fpvar, int *status); int fp_test_table (fitsfile *infptr, fitsfile *outfptr, fitsfile *outfptr2, fpstate fpvar, int *status); int marktime(int *status); int gettime(float *elapse, float *elapscpu, int *status); int fits_read_image_speed (fitsfile *infptr, float *whole_elapse, float *whole_cpu, float *row_elapse, float *row_cpu, int *status); int fp_i2stat(fitsfile *infptr, int naxis, long *naxes, imgstats *imagestats, int *status); int fp_i4stat(fitsfile *infptr, int naxis, long *naxes, imgstats *imagestats, int *status); int fp_r4stat(fitsfile *infptr, int naxis, long *naxes, imgstats *imagestats, int *status); int fp_i2rescale(fitsfile *infptr, int naxis, long *naxes, double rescale, fitsfile *outfptr, int *status); int fp_i4rescale(fitsfile *infptr, int naxis, long *naxes, double rescale, fitsfile *outfptr, int *status); int fp_msg (char *msg); int fp_version (void); int fp_noop (void); int fu_get_param (int argc, char *argv[], fpstate *fpptr); int fu_usage (void); int fu_hint (void); int fu_help (void); cfitsio-3.47/fpackutil.c0000644000225700000360000023110113464573432014534 0ustar cagordonlhea/* FPACK utility routines R. Seaman, NOAO & W. Pence, NASA/GSFC */ #include #include #include #include /* #include "bzlib.h" only for experimental purposes */ #if defined(unix) || defined(__unix__) || defined(__unix) #include #endif #include #include "fitsio.h" #include "fpack.h" /* these filename buffer are used to delete temporary files */ /* in case the program is aborted */ char tempfilename[SZ_STR]; char tempfilename2[SZ_STR]; char tempfilename3[SZ_STR]; /* nearest integer function */ # define NINT(x) ((x >= 0.) ? (int) (x + 0.5) : (int) (x - 0.5)) # define NSHRT(x) ((x >= 0.) ? (short) (x + 0.5) : (short) (x - 0.5)) /* define variables for measuring elapsed time */ clock_t scpu, ecpu; long startsec; /* start of elapsed time interval */ int startmilli; /* start of elapsed time interval */ /* CLOCKS_PER_SEC should be defined by most compilers */ #if defined(CLOCKS_PER_SEC) #define CLOCKTICKS CLOCKS_PER_SEC #else /* on SUN OS machine, CLOCKS_PER_SEC is not defined, so set its value */ #define CLOCKTICKS 1000000 #endif FILE *outreport; /* dimension of central image area to be sampled for test statistics */ int XSAMPLE = 4100; int YSAMPLE = 4100; int fp_msg (char *msg) { printf ("%s", msg); return(0); } /*--------------------------------------------------------------------------*/ int fp_noop (void) { fp_msg ("Input and output files are unchanged.\n"); return(0); } /*--------------------------------------------------------------------------*/ void fp_abort_output (fitsfile *infptr, fitsfile *outfptr, int stat) { int status = 0, hdunum; char msg[SZ_STR]; if (infptr) { fits_file_name(infptr, tempfilename, &status); fits_get_hdu_num(infptr, &hdunum); fits_close_file (infptr, &status); snprintf(msg, SZ_STR,"Error processing file: %s\n", tempfilename); fp_msg (msg); snprintf(msg, SZ_STR," in HDU number %d\n", hdunum); fp_msg (msg); } else { snprintf(msg, SZ_STR,"Error: Unable to process input file\n"); fp_msg(msg); } fits_report_error (stderr, stat); if (outfptr) { fits_delete_file(outfptr, &status); fp_msg ("Input file is unchanged.\n"); } exit (stat); } /*--------------------------------------------------------------------------*/ int fp_version (void) { float version; char cfitsioversion[40]; fp_msg (FPACK_VERSION); fits_get_version(&version); snprintf(cfitsioversion, 40," CFITSIO version %5.3f", version); fp_msg(cfitsioversion); fp_msg ("\n"); return(0); } /*--------------------------------------------------------------------------*/ int fp_access (char *filename) { /* test if a file exists */ FILE *diskfile; diskfile = fopen(filename, "r"); if (diskfile) { fclose(diskfile); return(0); } else { return(-1); } } /*--------------------------------------------------------------------------*/ int fp_tmpnam(char *suffix, char *rootname, char *tmpnam) { /* create temporary file name */ int maxtry = 30, ii; if (strlen(suffix) + strlen(rootname) > SZ_STR-5) { fp_msg ("Error: filename is too long to create tempory file\n"); exit (-1); } strcpy (tmpnam, rootname); /* start with rootname */ strcat(tmpnam, suffix); /* append the suffix */ maxtry = SZ_STR - strlen(tmpnam) - 1; for (ii = 0; ii < maxtry; ii++) { if (fp_access(tmpnam)) break; /* good, the file does not exist */ if (strlen(tmpnam) > SZ_STR-2) { fp_msg ("\nCould not create temporary file name:\n"); fp_msg (tmpnam); fp_msg ("\n"); exit (-1); } strcat(tmpnam, "x"); /* append an x to the name, and try again */ } if (ii == maxtry) { fp_msg ("\nCould not create temporary file name:\n"); fp_msg (tmpnam); fp_msg ("\n"); exit (-1); } return(0); } /*--------------------------------------------------------------------------*/ int fp_init (fpstate *fpptr) { int ii; fpptr->comptype = RICE_1; fpptr->quantize_level = DEF_QLEVEL; fpptr->no_dither = 0; fpptr->dither_method = 1; fpptr->dither_offset = 0; fpptr->int_to_float = 0; /* thresholds when using the -i2f flag */ fpptr->n3ratio = 2.0; /* minimum ratio of image noise sigma / q */ fpptr->n3min = 6.; /* minimum noise sigma. */ fpptr->scale = DEF_HCOMP_SCALE; fpptr->smooth = DEF_HCOMP_SMOOTH; fpptr->rescale_noise = DEF_RESCALE_NOISE; fpptr->ntile[0] = (long) -1; /* -1 means extent of axis */ for (ii=1; ii < MAX_COMPRESS_DIM; ii++) fpptr->ntile[ii] = (long) 1; fpptr->to_stdout = 0; fpptr->listonly = 0; fpptr->clobber = 0; fpptr->delete_input = 0; fpptr->do_not_prompt = 0; fpptr->do_checksums = 1; fpptr->do_gzip_file = 0; fpptr->do_tables = 0; /* this is intended for testing purposes */ fpptr->do_images = 1; /* can be turned off with -tableonly switch */ fpptr->test_all = 0; fpptr->verbose = 0; fpptr->prefix[0] = 0; fpptr->extname[0] = 0; fpptr->delete_suffix = 0; fpptr->outfile[0] = 0; fpptr->firstfile = 1; /* magic number for initialization check, boolean for preflight */ fpptr->initialized = FP_INIT_MAGIC; fpptr->preflight_checked = 0; return(0); } /*--------------------------------------------------------------------------*/ int fp_list (int argc, char *argv[], fpstate fpvar) { fitsfile *infptr; char infits[SZ_STR], msg[SZ_STR]; int hdunum, iarg, stat=0; LONGLONG sizell; if (fpvar.initialized != FP_INIT_MAGIC) { fp_msg ("Error: internal initialization error\n"); exit (-1); } for (iarg=fpvar.firstfile; iarg < argc; iarg++) { strncpy (infits, argv[iarg], SZ_STR-1); infits[SZ_STR-1]=0; if (strchr (infits, '[') || strchr (infits, ']')) { fp_msg ("Error: section/extension notation not supported: "); fp_msg (infits); fp_msg ("\n"); exit (-1); } if (fp_access (infits) != 0) { fp_msg ("Error: can't find or read input file "); fp_msg (infits); fp_msg ("\n"); fp_noop (); exit (-1); } fits_open_file (&infptr, infits, READONLY, &stat); if (stat) { fits_report_error (stderr, stat); exit (stat); } /* move to the end of file, to get the total size in bytes */ fits_get_num_hdus (infptr, &hdunum, &stat); fits_movabs_hdu (infptr, hdunum, NULL, &stat); fits_get_hduaddrll(infptr, NULL, NULL, &sizell, &stat); if (stat) { fp_abort_output(infptr, NULL, stat); } snprintf (msg, SZ_STR,"# %s (", infits); fp_msg (msg); #if defined(_MSC_VER) /* Microsoft Visual C++ 6.0 uses '%I64d' syntax for 8-byte integers */ snprintf(msg, SZ_STR,"%I64d bytes)\n", sizell); fp_msg (msg); #elif (USE_LL_SUFFIX == 1) snprintf(msg, SZ_STR,"%lld bytes)\n", sizell); fp_msg (msg); #else snprintf(msg, SZ_STR,"%ld bytes)\n", sizell); fp_msg (msg); #endif fp_info_hdu (infptr); fits_close_file (infptr, &stat); if (stat) { fits_report_error (stderr, stat); exit (stat); } } return(0); } /*--------------------------------------------------------------------------*/ int fp_info_hdu (fitsfile *infptr) { long naxes[9] = {1, 1, 1, 1, 1, 1, 1, 1, 1}; char msg[SZ_STR], val[SZ_CARD], com[SZ_CARD]; int naxis=0, hdutype, bitpix, hdupos, stat=0, ii; unsigned long datasum, hdusum; fits_movabs_hdu (infptr, 1, NULL, &stat); if (stat) { fp_abort_output(infptr, NULL, stat); } for (hdupos=1; ! stat; hdupos++) { fits_get_hdu_type (infptr, &hdutype, &stat); if (stat) { fp_abort_output(infptr, NULL, stat); } /* fits_get_hdu_type calls unknown extensions "IMAGE_HDU" * so consult XTENSION keyword itself */ fits_read_keyword (infptr, "XTENSION", val, com, &stat); if (stat == KEY_NO_EXIST) { /* in primary HDU which by definition is an "image" */ stat=0; /* clear for later error handling */ } else if (stat) { fp_abort_output(infptr, NULL, stat); } else if (hdutype == IMAGE_HDU) { /* that is, if XTENSION != "IMAGE" AND != "BINTABLE" */ if (strncmp (val+1, "IMAGE", 5) && strncmp (val+1, "BINTABLE", 5)) { /* assign something other than any of these */ hdutype = IMAGE_HDU + ASCII_TBL + BINARY_TBL; } } fits_get_chksum(infptr, &datasum, &hdusum, &stat); if (hdutype == IMAGE_HDU) { snprintf (msg, SZ_STR," %d IMAGE", hdupos); fp_msg (msg); snprintf (msg, SZ_STR," SUMS=%lu/%lu", (unsigned long) (~((int) hdusum)), datasum); fp_msg (msg); fits_get_img_param (infptr, 9, &bitpix, &naxis, naxes, &stat); snprintf (msg, SZ_STR," BITPIX=%d", bitpix); fp_msg (msg); if (naxis == 0) { snprintf (msg, SZ_STR," [no_pixels]"); fp_msg (msg); } else if (naxis == 1) { snprintf (msg, SZ_STR," [%ld]", naxes[1]); fp_msg (msg); } else { snprintf (msg, SZ_STR," [%ld", naxes[0]); fp_msg (msg); for (ii=1; ii < naxis; ii++) { snprintf (msg, SZ_STR,"x%ld", naxes[ii]); fp_msg (msg); } fp_msg ("]"); } if (fits_is_compressed_image (infptr, &stat)) { fits_read_keyword (infptr, "ZCMPTYPE", val, com, &stat); /* allow for quote in keyword value */ if (! strncmp (val+1, "RICE_1", 6)) fp_msg (" tiled_rice\n"); else if (! strncmp (val+1, "GZIP_1", 6)) fp_msg (" tiled_gzip_1\n"); else if (! strncmp (val+1, "GZIP_2", 6)) fp_msg (" tiled_gzip_2\n"); else if (! strncmp (val+1, "PLIO_1", 6)) fp_msg (" tiled_plio\n"); else if (! strncmp (val+1, "HCOMPRESS_1", 11)) fp_msg (" tiled_hcompress\n"); else fp_msg (" unknown\n"); } else fp_msg (" not_tiled\n"); } else if (hdutype == ASCII_TBL) { snprintf (msg, SZ_STR," %d ASCII_TBL", hdupos); fp_msg (msg); snprintf (msg, SZ_STR," SUMS=%lu/%lu\n", (unsigned long) (~((int) hdusum)), datasum); fp_msg (msg); } else if (hdutype == BINARY_TBL) { snprintf (msg, SZ_STR," %d BINARY_TBL", hdupos); fp_msg (msg); snprintf (msg, SZ_STR," SUMS=%lu/%lu\n", (unsigned long) (~((int) hdusum)), datasum); fp_msg (msg); } else { snprintf (msg, SZ_STR," %d OTHER", hdupos); fp_msg (msg); snprintf (msg, SZ_STR," SUMS=%lu/%lu", (unsigned long) (~((int) hdusum)), datasum); fp_msg (msg); snprintf (msg, SZ_STR," %s\n", val); fp_msg (msg); } fits_movrel_hdu (infptr, 1, NULL, &stat); } return(0); } /*--------------------------------------------------------------------------*/ int fp_preflight (int argc, char *argv[], int unpack, fpstate *fpptr) { char infits[SZ_STR], outfits[SZ_STR]; int iarg, namelen, nfiles = 0; if (fpptr->initialized != FP_INIT_MAGIC) { fp_msg ("Error: internal initialization error\n"); exit (-1); } for (iarg=fpptr->firstfile; iarg < argc; iarg++) { outfits[0] = '\0'; if (strlen(argv[iarg]) > SZ_STR - 4) { /* allow for .fz or .gz suffix */ fp_msg ("Error: input file name\n "); fp_msg (argv[iarg]); fp_msg ("\n is too long\n"); fp_noop (); exit (-1); } strncpy (infits, argv[iarg], SZ_STR); if (infits[0] == '-' && infits[1] != '\0') { /* don't interpret this as intending to read input file from stdin */ fp_msg ("Error: invalid input file name\n "); fp_msg (argv[iarg]); fp_msg ("\n"); fp_noop (); exit (-1); } if (strchr (infits, '[') || strchr (infits, ']')) { fp_msg ("Error: section/extension notation not supported: "); fp_msg (infits); fp_msg ("\n"); fp_noop (); exit (-1); } if (unpack) { /* ********** This section applies to funpack ************ */ /* check that input file exists */ if (infits[0] != '-') { /* if not reading from stdin stream */ if (fp_access (infits) != 0) { /* if not, then check if */ strcat(infits, ".fz"); /* a .fz version exsits */ if (fp_access (infits) != 0) { namelen = strlen(infits); infits[namelen - 3] = '\0'; /* remove the .fz suffix */ fp_msg ("Error: can't find or read input file "); fp_msg (infits); fp_msg ("\n"); fp_noop (); exit (-1); } } else { /* make sure a .fz version of the same file doesn't exist */ namelen = strlen(infits); strcat(infits, ".fz"); if (fp_access (infits) == 0) { infits[namelen] = '\0'; /* remove the .fz suffix */ fp_msg ("Error: ambiguous input file name. Which file should be unpacked?:\n "); fp_msg (infits); fp_msg ("\n "); fp_msg (infits); fp_msg (".fz\n"); fp_noop (); exit (-1); } else { infits[namelen] = '\0'; /* remove the .fz suffix */ } } } /* if writing to stdout, then we are all done */ if (fpptr->to_stdout) { continue; } if (fpptr->outfile[0]) { /* user specified output file name */ nfiles++; if (nfiles > 1) { fp_msg ("Error: cannot use same output file name for multiple files:\n "); fp_msg (fpptr->outfile); fp_msg ("\n"); fp_noop (); exit (-1); } /* check that output file doesn't exist */ if (fp_access (fpptr->outfile) == 0) { fp_msg ("Error: output file already exists:\n "); fp_msg (fpptr->outfile); fp_msg ("\n "); fp_noop (); exit (-1); } continue; } /* construct output file name to test */ if (fpptr->prefix[0]) { if (strlen(fpptr->prefix) + strlen(infits) > SZ_STR - 1) { fp_msg ("Error: output file name for\n "); fp_msg (infits); fp_msg ("\n is too long with the prefix\n"); fp_noop (); exit (-1); } strcpy(outfits,fpptr->prefix); } /* construct output file name */ if (infits[0] == '-') { strcpy(outfits, "output.fits"); } else { strcat(outfits, infits); } /* remove .gz or .bz2 suffix, if present (output is not gzipped) */ namelen = strlen(outfits); if (namelen >= 3 && !strcmp(".gz", outfits + namelen - 3) ) { outfits[namelen - 3] = '\0'; } else if (namelen >= 4 && !strcmp(".bz2", outfits + namelen - 4)) { outfits[namelen - 4] = '\0'; } /* check for .fz suffix that is sometimes required */ /* and remove it if present */ if (infits[0] != '-') { /* if not reading from stdin stream */ namelen = strlen(outfits); if (namelen>=3 && !strcmp(".fz", outfits + namelen - 3) ) { /* suffix is present */ outfits[namelen - 3] = '\0'; } else if (fpptr->delete_suffix) { /* required suffix is missing */ fp_msg ("Error: input compressed file "); fp_msg (infits); fp_msg ("\n does not have the default .fz suffix.\n"); fp_noop (); exit (-1); } } /* if infits != outfits, make sure outfits doesn't already exist */ if (strcmp(infits, outfits)) { if (fp_access (outfits) == 0) { fp_msg ("Error: output file already exists:\n "); fp_msg (outfits); fp_msg ("\n "); fp_noop (); exit (-1); } } /* if gzipping the output, make sure .gz file doesn't exist */ if (fpptr->do_gzip_file) { if (strlen(outfits)+3 > SZ_STR-1) { fp_msg ("Error: output file name too long:\n "); fp_msg (outfits); fp_msg ("\n "); fp_noop (); exit (-1); } strcat(outfits, ".gz"); if (fp_access (outfits) == 0) { fp_msg ("Error: output file already exists:\n "); fp_msg (outfits); fp_msg ("\n "); fp_noop (); exit (-1); } namelen = strlen(outfits); outfits[namelen - 3] = '\0'; /* remove the .gz suffix again */ } } else { /* ********** This section applies to fpack ************ */ /* check that input file exists */ if (infits[0] != '-') { /* if not reading from stdin stream */ if (fp_access (infits) != 0) { /* if not, then check if */ if (strlen(infits)+3 > SZ_STR-1) { fp_msg ("Error: input file name too long:\n "); fp_msg (infits); fp_msg ("\n "); fp_noop (); exit (-1); } strcat(infits, ".gz"); /* a gzipped version exsits */ if (fp_access (infits) != 0) { namelen = strlen(infits); infits[namelen - 3] = '\0'; /* remove the .gz suffix */ fp_msg ("Error: can't find or read input file "); fp_msg (infits); fp_msg ("\n"); fp_noop (); exit (-1); } } } /* make sure the file to pack does not already have a .fz suffix */ namelen = strlen(infits); if (namelen>=3 && !strcmp(".fz", infits + namelen - 3) ) { fp_msg ("Error: fpack input file already has '.fz' suffix\n" ); fp_msg (infits); fp_msg ("\n"); fp_noop (); exit (-1); } /* if writing to stdout, or just testing the files, then we are all done */ if (fpptr->to_stdout || fpptr->test_all) { continue; } if (fpptr->outfile[0]) { /* user specified output file name */ nfiles++; if (nfiles > 1) { fp_msg("Error: cannot use same output file name for multiple files:\n "); fp_msg(fpptr->outfile); fp_msg ("\n"); fp_noop (); exit (-1); } /* check that output file doesn't exist */ if (fp_access (fpptr->outfile) == 0) { fp_msg ("Error: output file already exists:\n "); fp_msg (fpptr->outfile); fp_msg ("\n "); fp_noop (); exit (-1); } continue; } /* construct output file name */ if (infits[0] == '-') { strcpy(outfits, "input.fits"); } else { strcpy(outfits, infits); } /* remove .gz suffix, if present (output is not gzipped) */ /* do the same if compression suffix is bz2 */ namelen = strlen(outfits); if (namelen >=3 && !strcmp(".gz", outfits + namelen - 3) ) { outfits[namelen - 3] = '\0'; } else if (namelen >= 4 && !strcmp(".bz2", outfits + namelen - 4)) { outfits[namelen - 4] = '\0'; } /* remove .imh suffix (IRAF format image), and replace with .fits */ namelen = strlen(outfits); if (namelen >=4 && !strcmp(".imh", outfits + namelen - 4) ) { outfits[namelen - 4] = '\0'; if (strlen(outfits) == SZ_STR-5) strcat(outfits, ".fit"); else strcat(outfits, ".fits"); } /* If not clobbering the input file, add .fz suffix to output name */ if (! fpptr->clobber) { if (strlen(outfits) > SZ_STR-4) { fp_msg ("Error: output file name too long:\n "); fp_msg (outfits); fp_msg ("\n "); fp_noop (); exit (-1); } else strcat(outfits, ".fz"); } /* if infits != outfits, make sure outfits doesn't already exist */ if (strcmp(infits, outfits)) { if (fp_access (outfits) == 0) { fp_msg ("Error: output file already exists:\n "); fp_msg (outfits); fp_msg ("\n "); fp_noop (); exit (-1); } } } /* end of fpack section */ } fpptr->preflight_checked++; return(0); } /*--------------------------------------------------------------------------*/ /* must run fp_preflight() before fp_loop() */ int fp_loop (int argc, char *argv[], int unpack, fpstate fpvar) { char infits[SZ_STR], outfits[SZ_STR]; char temp[SZ_STR], answer[30]; char valchar[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz.#()+,-_@[]/^{}"; int ichar=0, outlen=0, iarg, islossless, namelen, iraf_infile = 0, status = 0, ifail; if (fpvar.initialized != FP_INIT_MAGIC) { fp_msg ("Error: internal initialization error\n"); exit (-1); } else if (! fpvar.preflight_checked) { fp_msg ("Error: internal preflight error\n"); exit (-1); } if (fpvar.test_all && fpvar.outfile[0]) { outreport = fopen(fpvar.outfile, "w"); fprintf(outreport," Filename Extension BITPIX NAXIS1 NAXIS2 Size N_nulls Minval Maxval Mean Sigm Noise1 Noise2 Noise3 Noise5 T_whole T_rowbyrow "); fprintf(outreport,"[Comp_ratio, Pack_cpu, Unpack_cpu, Lossless readtimes] (repeated for Rice, Hcompress, and GZIP)\n"); } tempfilename[0] = '\0'; tempfilename2[0] = '\0'; tempfilename3[0] = '\0'; /* set up signal handler to delete temporary file on abort */ #ifdef SIGINT if (signal(SIGINT, SIG_IGN) != SIG_IGN) { (void) signal(SIGINT, abort_fpack); } #endif #ifdef SIGTERM if (signal(SIGTERM, SIG_IGN) != SIG_IGN) { (void) signal(SIGTERM, abort_fpack); } #endif #ifdef SIGHUP if (signal(SIGHUP, SIG_IGN) != SIG_IGN) { (void) signal(SIGHUP, abort_fpack); } #endif for (iarg=fpvar.firstfile; iarg < argc; iarg++) { temp[0] = '\0'; outfits[0] = '\0'; islossless = 1; strncpy (infits, argv[iarg], SZ_STR - 1); infits[SZ_STR-1]=0; if (unpack) { /* ********** This section applies to funpack ************ */ /* find input file */ if (infits[0] != '-') { /* if not reading from stdin stream */ if (fp_access (infits) != 0) { /* if not, then */ strcat(infits, ".fz"); /* a .fz version must exsit */ /* fp_preflight already checked for enough size to add '.fz' */ } } if (fpvar.to_stdout) { strcpy(outfits, "-"); } else if (fpvar.outfile[0]) { /* user specified output file name */ strcpy(outfits, fpvar.outfile); } else { /* construct output file name */ if (fpvar.prefix[0]) { /* fp_preflight already checked this */ strcpy(outfits,fpvar.prefix); } /* construct output file name */ if (infits[0] == '-') { strcpy(outfits, "output.fits"); } else { strcat(outfits, infits); } /* remove .gz suffix, if present (output is not gzipped) */ namelen = strlen(outfits); if (namelen >= 3 && !strcmp(".gz", outfits + namelen - 3) ) { outfits[namelen - 3] = '\0'; } else if (namelen >= 4 && !strcmp(".bz2", outfits + namelen - 4)) { outfits[namelen - 4] = '\0'; } /* check for .fz suffix that is sometimes required */ /* and remove it if present */ namelen = strlen(outfits); if (namelen >= 3 && !strcmp(".fz", outfits + namelen - 3) ) { /* suffix is present */ outfits[namelen - 3] = '\0'; } } } else { /* ********** This section applies to fpack ************ */ if (fpvar.to_stdout) { strcpy(outfits, "-"); } else if (! fpvar.test_all) { if (fpvar.outfile[0]) { /* user specified output file name */ strcpy(outfits, fpvar.outfile); } else { /* construct output file name */ if (infits[0] == '-') { strcpy(outfits, "input.fits"); } else { strcpy(outfits, infits); } /* Remove .gz suffix, if present (output is not gzipped). Do the same for .bz2 */ namelen = strlen(outfits); if (namelen >= 3 && !strcmp(".gz", outfits + namelen - 3) ) { outfits[namelen - 3] = '\0'; } else if (namelen >= 4 && !strcmp(".bz2", outfits + namelen - 4)) { outfits[namelen - 4] = '\0'; } /* remove .imh suffix (IRAF format image), and replace with .fits */ namelen = strlen(outfits); if (namelen >= 4 && !strcmp(".imh", outfits + namelen - 4) ) { outfits[namelen - 4] = '\0'; if (strlen(outfits) == SZ_STR-5) strcat(outfits, ".fit"); else strcat(outfits, ".fits"); iraf_infile = 1; /* this is an IRAF format input file */ /* change the output name to "NAME.fits.fz" */ } /* If not clobbering the input file, add .fz suffix to output name */ if (! fpvar.clobber) strcat(outfits, ".fz"); } } } strncpy(temp, outfits, SZ_STR-1); temp[SZ_STR-1]=0; if (infits[0] != '-') { /* if not reading from stdin stream */ if (!strcmp(infits, outfits) ) { /* are input and output names the same? */ /* clobber the input file with the output file with the same name */ if (! fpvar.clobber) { fp_msg ("\nError: must use -F flag to clobber input file.\n"); exit (-1); } /* create temporary file name in the output directory (same as input directory)*/ fp_tmpnam("Tmp1", infits, outfits); strcpy(tempfilename, outfits); /* store temp file name, in case of abort */ } } /* *************** now do the real work ********************* */ if (fpvar.verbose && ! fpvar.to_stdout) printf("%s ", infits); if (fpvar.test_all) { /* compare all the algorithms */ /* create 2 temporary file names, in the CWD */ fp_tmpnam("Tmpfile1", "", tempfilename); fp_tmpnam("Tmpfile2", "", tempfilename2); fp_test (infits, tempfilename, tempfilename2, fpvar); remove(tempfilename); tempfilename[0] = '\0'; /* clear the temp file name */ remove(tempfilename2); tempfilename2[0] = '\0'; continue; } else if (unpack) { if (fpvar.to_stdout) { /* unpack the input file to the stdout stream */ fp_unpack (infits, outfits, fpvar); } else { /* unpack to temporary file, so other tasks can't open it until it is renamed */ /* create temporary file name, in the output directory */ fp_tmpnam("Tmp2", outfits, tempfilename2); /* unpack the input file to the temporary file */ fp_unpack (infits, tempfilename2, fpvar); /* rename the temporary file to it's real name */ ifail = rename(tempfilename2, outfits); if (ifail) { fp_msg("Failed to rename temporary file name:\n "); fp_msg(tempfilename2); fp_msg(" -> "); fp_msg(outfits); fp_msg("\n"); exit (-1); } else { tempfilename2[0] = '\0'; /* clear temporary file name */ } } } else { fp_pack (infits, outfits, fpvar, &islossless); } if (fpvar.to_stdout) { continue; } /* ********** clobber and/or delete files, if needed ************** */ if (!strcmp(infits, temp) && fpvar.clobber ) { if (!islossless && ! fpvar.do_not_prompt) { fp_msg ("\nFile "); fp_msg (infits); fp_msg ("\nwas compressed with a LOSSY method. Overwrite the\n"); fp_msg ("original file with the compressed version? (Y/N) "); fgets(answer, 29, stdin); if (answer[0] != 'Y' && answer[0] != 'y') { fp_msg ("\noriginal file NOT overwritten!\n"); remove(outfits); continue; } } if (iraf_infile) { /* special case of deleting an IRAF format header and pixel file */ if (fits_delete_iraf_file(infits, &status)) { fp_msg("\nError deleting IRAF .imh and .pix files.\n"); fp_msg(infits); fp_msg ("\n"); exit (-1); } } #if defined(unix) || defined(__unix__) || defined(__unix) /* rename clobbers input on Unix platforms */ if (rename (outfits, temp) != 0) { fp_msg ("\nError renaming tmp file to "); fp_msg (temp); fp_msg ("\n"); exit (-1); } #else /* rename DOES NOT clobber existing files on Windows platforms */ /* so explicitly remove any existing file before renaming the file */ remove(temp); if (rename (outfits, temp) != 0) { fp_msg ("\nError renaming tmp file to "); fp_msg (temp); fp_msg ("\n"); exit (-1); } #endif tempfilename[0] = '\0'; /* clear temporary file name */ strcpy(outfits, temp); } else if (fpvar.clobber || fpvar.delete_input) { /* delete the input file */ if (!islossless && !fpvar.do_not_prompt) { /* user did not turn off delete prompt */ fp_msg ("\nFile "); fp_msg (infits); fp_msg ("\nwas compressed with a LOSSY method. \n"); fp_msg ("Delete the original file? (Y/N) "); fgets(answer, 29, stdin); if (answer[0] != 'Y' && answer[0] != 'y') { /* user abort */ fp_msg ("\noriginal file NOT deleted!\n"); } else { if (iraf_infile) { /* special case of deleting an IRAF format header and pixel file */ if (fits_delete_iraf_file(infits, &status)) { fp_msg("\nError deleting IRAF .imh and .pix files.\n"); fp_msg(infits); fp_msg ("\n"); exit (-1); } } else if (remove(infits) != 0) { /* normal case of deleting input FITS file */ fp_msg ("\nError deleting input file "); fp_msg (infits); fp_msg ("\n"); exit (-1); } } } else { /* user said don't prompt, so just delete the input file */ if (iraf_infile) { /* special case of deleting an IRAF format header and pixel file */ if (fits_delete_iraf_file(infits, &status)) { fp_msg("\nError deleting IRAF .imh and .pix files.\n"); fp_msg(infits); fp_msg ("\n"); exit (-1); } } else if (remove(infits) != 0) { /* normal case of deleting input FITS file */ fp_msg ("\nError deleting input file "); fp_msg (infits); fp_msg ("\n"); exit (-1); } } } iraf_infile = 0; if (fpvar.do_gzip_file) { /* gzip the output file */ strcpy(temp, "gzip -1 "); outlen = strlen(outfits); if (outlen + 8 > SZ_STR-1) { fp_msg("\nError: Output file name is too long.\n"); exit(-1); } for (ichar=0; ichar < outlen; ++ichar) { if (!strchr(valchar, outfits[ichar])) { fp_msg("\n Error: Invalid characters in output file name.\n"); exit(-1); } } strcat(temp,outfits); system(temp); strcat(outfits, ".gz"); /* only possibible with funpack */ } if (fpvar.verbose && ! fpvar.to_stdout) printf("-> %s\n", outfits); } if (fpvar.test_all && fpvar.outfile[0]) fclose(outreport); return(0); } /*--------------------------------------------------------------------------*/ /* fp_pack assumes the output file does not exist (checked by preflight) */ int fp_pack (char *infits, char *outfits, fpstate fpvar, int *islossless) { fitsfile *infptr, *outfptr; int stat=0; fits_open_file (&infptr, infits, READONLY, &stat); if (stat) { fits_report_error (stderr, stat); exit (stat); } fits_create_file (&outfptr, outfits, &stat); if (stat) { fp_abort_output(infptr, NULL, stat); } if (stat) { fp_abort_output(infptr, outfptr, stat); } while (! stat) { /* LOOP OVER EACH HDU */ fits_set_lossy_int (outfptr, fpvar.int_to_float, &stat); fits_set_compression_type (outfptr, fpvar.comptype, &stat); fits_set_tile_dim (outfptr, 6, fpvar.ntile, &stat); if (fpvar.no_dither) fits_set_quantize_method(outfptr, -1, &stat); else fits_set_quantize_method(outfptr, fpvar.dither_method, &stat); fits_set_quantize_level (outfptr, fpvar.quantize_level, &stat); fits_set_dither_offset(outfptr, fpvar.dither_offset, &stat); fits_set_hcomp_scale (outfptr, fpvar.scale, &stat); fits_set_hcomp_smooth (outfptr, fpvar.smooth, &stat); fp_pack_hdu (infptr, outfptr, fpvar, islossless, &stat); if (fpvar.do_checksums) { fits_write_chksum (outfptr, &stat); } fits_movrel_hdu (infptr, 1, NULL, &stat); } if (stat == END_OF_FILE) stat = 0; /* set checksum for case of newly created primary HDU */ if (fpvar.do_checksums) { fits_movabs_hdu (outfptr, 1, NULL, &stat); fits_write_chksum (outfptr, &stat); } if (stat) { fp_abort_output(infptr, outfptr, stat); } fits_close_file (outfptr, &stat); fits_close_file (infptr, &stat); return(0); } /*--------------------------------------------------------------------------*/ /* fp_unpack assumes the output file does not exist */ int fp_unpack (char *infits, char *outfits, fpstate fpvar) { fitsfile *infptr, *outfptr; int stat=0, hdutype, extnum, single = 0; char *loc, *hduloc, hduname[SZ_STR]; fits_open_file (&infptr, infits, READONLY, &stat); fits_create_file (&outfptr, outfits, &stat); if (stat) { fp_abort_output(infptr, outfptr, stat); } if (fpvar.extname[0]) { /* unpack a list of HDUs? */ /* move to the first HDU in the list */ hduloc = fpvar.extname; loc = strchr(hduloc, ','); /* look for 'comma' delimiter between names */ if (loc) *loc = '\0'; /* terminate the first name in the string */ strcpy(hduname, hduloc); /* copy the first name into temporary string */ if (loc) hduloc = loc + 1; /* advance to the beginning of the next name, if any */ else { hduloc += strlen(hduname); /* end of the list */ single = 1; /* only 1 HDU is being unpacked */ } if (isdigit( (int) hduname[0]) ) { extnum = strtol(hduname, &loc, 10); /* read the string as an integer */ /* check for junk following the integer */ if (*loc == '\0' ) /* no junk, so move to this HDU number (+1) */ { fits_movabs_hdu(infptr, extnum + 1, &hdutype, &stat); /* move to HDU number */ if (hdutype != IMAGE_HDU) stat = NOT_IMAGE; } else { /* the string is not an integer, so must be the column name */ hdutype = IMAGE_HDU; fits_movnam_hdu(infptr, hdutype, hduname, 0, &stat); } } else { /* move to the named image extension */ hdutype = IMAGE_HDU; fits_movnam_hdu(infptr, hdutype, hduname, 0, &stat); } } if (stat) { fp_msg ("Unable to find and move to extension '"); fp_msg(hduname); fp_msg("'\n"); fp_abort_output(infptr, outfptr, stat); } while (! stat) { if (single) stat = -1; /* special status flag to force output primary array */ fp_unpack_hdu (infptr, outfptr, fpvar, &stat); if (fpvar.do_checksums) { fits_write_chksum (outfptr, &stat); } /* move to the next HDU */ if (fpvar.extname[0]) { /* unpack a list of HDUs? */ if (!(*hduloc)) { stat = END_OF_FILE; /* we reached the end of the list */ } else { /* parse the next HDU name and move to it */ loc = strchr(hduloc, ','); if (loc) /* look for 'comma' delimiter between names */ *loc = '\0'; /* terminate the first name in the string */ strcpy(hduname, hduloc); /* copy the next name into temporary string */ if (loc) hduloc = loc + 1; /* advance to the beginning of the next name, if any */ else *hduloc = '\0'; /* end of the list */ if (isdigit( (int) hduname[0]) ) { extnum = strtol(hduname, &loc, 10); /* read the string as an integer */ /* check for junk following the integer */ if (*loc == '\0' ) /* no junk, so move to this HDU number (+1) */ { fits_movabs_hdu(infptr, extnum + 1, &hdutype, &stat); /* move to HDU number */ if (hdutype != IMAGE_HDU) stat = NOT_IMAGE; } else { /* the string is not an integer, so must be the column name */ hdutype = IMAGE_HDU; fits_movnam_hdu(infptr, hdutype, hduname, 0, &stat); } } else { /* move to the named image extension */ hdutype = IMAGE_HDU; fits_movnam_hdu(infptr, hdutype, hduname, 0, &stat); } if (stat) { fp_msg ("Unable to find and move to extension '"); fp_msg(hduname); fp_msg("'\n"); } } } else { /* increment to the next HDU */ fits_movrel_hdu (infptr, 1, NULL, &stat); } } if (stat == END_OF_FILE) stat = 0; /* set checksum for case of newly created primary HDU */ if (fpvar.do_checksums) { fits_movabs_hdu (outfptr, 1, NULL, &stat); fits_write_chksum (outfptr, &stat); } if (stat) { fp_abort_output(infptr, outfptr, stat); } fits_close_file (outfptr, &stat); fits_close_file (infptr, &stat); return(0); } /*--------------------------------------------------------------------------*/ /* fp_test assumes the output files do not exist */ int fp_test (char *infits, char *outfits, char *outfits2, fpstate fpvar) { fitsfile *inputfptr, *infptr, *outfptr, *outfptr2, *tempfile; long naxes[9] = {1, 1, 1, 1, 1, 1, 1, 1, 1}; int stat=0, totpix=0, naxis=0, ii, hdutype, bitpix = 0, extnum = 0, len; int tstatus = 0, hdunum, rescale_flag, bpix, ncols; char dtype[8], dimen[100]; double bscale, rescale, noisemin; long headstart, datastart, dataend; float origdata = 0., whole_cpu, whole_elapse, row_elapse, row_cpu, xbits; LONGLONG nrows; /* structure to hold image statistics (defined in fpack.h) */ imgstats imagestats; fits_open_file (&inputfptr, infits, READONLY, &stat); fits_create_file (&outfptr, outfits, &stat); fits_create_file (&outfptr2, outfits2, &stat); if (stat) { fits_report_error (stderr, stat); exit (stat); } while (! stat) { /* LOOP OVER EACH HDU */ rescale_flag = 0; fits_get_hdu_type (inputfptr, &hdutype, &stat); if (hdutype == IMAGE_HDU) { fits_get_img_param (inputfptr, 9, &bitpix, &naxis, naxes, &stat); for (totpix=1, ii=0; ii < 9; ii++) totpix *= naxes[ii]; } if (!fits_is_compressed_image (inputfptr, &stat) && hdutype == IMAGE_HDU && naxis != 0 && totpix != 0 && fpvar.do_images) { /* rescale a scaled integer image to reduce noise? */ if (fpvar.rescale_noise != 0. && bitpix > 0 && bitpix < LONGLONG_IMG) { tstatus = 0; fits_read_key(inputfptr, TDOUBLE, "BSCALE", &bscale, 0, &tstatus); if (tstatus == 0 && bscale != 1.0) { /* image must be scaled */ if (bitpix == LONG_IMG) fp_i4stat(inputfptr, naxis, naxes, &imagestats, &stat); else fp_i2stat(inputfptr, naxis, naxes, &imagestats, &stat); /* use the minimum of the MAD 2nd, 3rd, and 5th order noise estimates */ noisemin = imagestats.noise3; if (imagestats.noise2 != 0. && imagestats.noise2 < noisemin) noisemin = imagestats.noise2; if (imagestats.noise5 != 0. && imagestats.noise5 < noisemin) noisemin = imagestats.noise5; rescale = noisemin / fpvar.rescale_noise; if (rescale > 1.0) { /* all the criteria are met, so create a temporary file that */ /* contains a rescaled version of the image, in CWD */ /* create temporary file name */ fp_tmpnam("Tmpfile3", "", tempfilename3); fits_create_file(&tempfile, tempfilename3, &stat); fits_get_hdu_num(inputfptr, &hdunum); if (hdunum != 1) { /* the input hdu is an image extension, so create dummy primary */ fits_create_img(tempfile, 8, 0, naxes, &stat); } fits_copy_header(inputfptr, tempfile, &stat); /* copy the header */ /* rescale the data, so that it will compress more efficiently */ if (bitpix == LONG_IMG) fp_i4rescale(inputfptr, naxis, naxes, rescale, tempfile, &stat); else fp_i2rescale(inputfptr, naxis, naxes, rescale, tempfile, &stat); /* scale the BSCALE keyword by the inverse factor */ bscale = bscale * rescale; fits_update_key(tempfile, TDOUBLE, "BSCALE", &bscale, 0, &stat); /* rescan the header, to reset the actual scaling parameters */ fits_set_hdustruc(tempfile, &stat); infptr = tempfile; rescale_flag = 1; } } } if (!rescale_flag) /* just compress the input file, without rescaling */ infptr = inputfptr; /* compute basic statistics about the input image */ if (bitpix == BYTE_IMG) { bpix = 8; strcpy(dtype, "8 "); fp_i2stat(infptr, naxis, naxes, &imagestats, &stat); } else if (bitpix == SHORT_IMG) { bpix = 16; strcpy(dtype, "16 "); fp_i2stat(infptr, naxis, naxes, &imagestats, &stat); } else if (bitpix == LONG_IMG) { bpix = 32; strcpy(dtype, "32 "); fp_i4stat(infptr, naxis, naxes, &imagestats, &stat); } else if (bitpix == LONGLONG_IMG) { bpix = 64; strcpy(dtype, "64 "); } else if (bitpix == FLOAT_IMG) { bpix = 32; strcpy(dtype, "-32"); fp_r4stat(infptr, naxis, naxes, &imagestats, &stat); } else if (bitpix == DOUBLE_IMG) { bpix = 64; strcpy(dtype, "-64"); fp_r4stat(infptr, naxis, naxes, &imagestats, &stat); } /* use the minimum of the MAD 2nd, 3rd, and 5th order noise estimates */ noisemin = imagestats.noise3; if (imagestats.noise2 != 0. && imagestats.noise2 < noisemin) noisemin = imagestats.noise2; if (imagestats.noise5 != 0. && imagestats.noise5 < noisemin) noisemin = imagestats.noise5; xbits = (float) (log10(noisemin)/.301 + 1.792); printf("\n File: %s\n", infits); printf(" Ext BITPIX Dimens. Nulls Min Max Mean Sigma Noise2 Noise3 Noise5 Nbits MaxR\n"); printf(" %3d %s", extnum, dtype); snprintf(dimen,100," (%ld", naxes[0]); len =strlen(dimen); for (ii = 1; ii < naxis; ii++) { if (len < 99) snprintf(dimen+len,100-len,",%ld", naxes[ii]); len =strlen(dimen); } if (strlen(dimen)<99) strcat(dimen, ")"); printf("%-12s",dimen); fits_get_hduaddr(inputfptr, &headstart, &datastart, &dataend, &stat); origdata = (float) ((dataend - datastart)/1000000.); /* get elapsed and cpu times need to read the uncompressed image */ fits_read_image_speed (infptr, &whole_elapse, &whole_cpu, &row_elapse, &row_cpu, &stat); printf(" %5d %6.0f %6.0f %8.1f %#8.2g %#7.3g %#7.3g %#7.3g %#5.1f %#6.2f\n", imagestats.n_nulls, imagestats.minval, imagestats.maxval, imagestats.mean, imagestats.sigma, imagestats.noise2, imagestats.noise3, imagestats.noise5, xbits, bpix/xbits); printf("\n Type Ratio Size (MB) Pk (Sec) UnPk Exact ElpN CPUN Elp1 CPU1\n"); printf(" Native %5.3f %5.3f %5.3f %5.3f\n", whole_elapse, whole_cpu, row_elapse, row_cpu); if (fpvar.outfile[0]) { fprintf(outreport, " %s %d %d %ld %ld %#10.4g %d %#10.4g %#10.4g %#10.4g %#10.4g %#10.4g %#10.4g %#10.4g %#10.4g %#10.4g %#10.4g %#10.4g %#10.4g", infits, extnum, bitpix, naxes[0], naxes[1], origdata, imagestats.n_nulls, imagestats.minval, imagestats.maxval, imagestats.mean, imagestats.sigma, imagestats.noise1, imagestats.noise2, imagestats.noise3, imagestats.noise5, whole_elapse, whole_cpu, row_elapse, row_cpu); } fits_set_lossy_int (outfptr, fpvar.int_to_float, &stat); if ( (bitpix > 0) && (fpvar.int_to_float != 0) ) { if ( (noisemin < (fpvar.n3ratio * fpvar.quantize_level) ) || (noisemin < fpvar.n3min)) { /* image contains too little noise to quantize effectively */ fits_set_lossy_int (outfptr, 0, &stat); fits_get_hdu_num(infptr, &hdunum); printf(" HDU %d does not meet noise criteria to be quantized, so losslessly compressed.\n", hdunum); } } /* test compression ratio and speed for each algorithm */ if (fpvar.quantize_level != 0) { fits_set_compression_type (outfptr, RICE_1, &stat); fits_set_tile_dim (outfptr, 6, fpvar.ntile, &stat); if (fpvar.no_dither) fits_set_quantize_method(outfptr, -1, &stat); else fits_set_quantize_method(outfptr, fpvar.dither_method, &stat); fits_set_quantize_level (outfptr, fpvar.quantize_level, &stat); fits_set_dither_offset(outfptr, fpvar.dither_offset, &stat); fits_set_hcomp_scale (outfptr, fpvar.scale, &stat); fits_set_hcomp_smooth (outfptr, fpvar.smooth, &stat); fp_test_hdu(infptr, outfptr, outfptr2, fpvar, &stat); } if (fpvar.quantize_level != 0) { \ fits_set_compression_type (outfptr, HCOMPRESS_1, &stat); fits_set_tile_dim (outfptr, 6, fpvar.ntile, &stat); if (fpvar.no_dither) fits_set_quantize_method(outfptr, -1, &stat); else fits_set_quantize_method(outfptr, fpvar.dither_method, &stat); fits_set_quantize_level (outfptr, fpvar.quantize_level, &stat); fits_set_dither_offset(outfptr, fpvar.dither_offset, &stat); fits_set_hcomp_scale (outfptr, fpvar.scale, &stat); fits_set_hcomp_smooth (outfptr, fpvar.smooth, &stat); fp_test_hdu(infptr, outfptr, outfptr2, fpvar, &stat); } if (fpvar.comptype == GZIP_2) { fits_set_compression_type (outfptr, GZIP_2, &stat); } else { fits_set_compression_type (outfptr, GZIP_1, &stat); } fits_set_tile_dim (outfptr, 6, fpvar.ntile, &stat); if (fpvar.no_dither) fits_set_quantize_method(outfptr, -1, &stat); else fits_set_quantize_method(outfptr, fpvar.dither_method, &stat); fits_set_quantize_level (outfptr, fpvar.quantize_level, &stat); fits_set_dither_offset(outfptr, fpvar.dither_offset, &stat); fits_set_hcomp_scale (outfptr, fpvar.scale, &stat); fits_set_hcomp_smooth (outfptr, fpvar.smooth, &stat); fp_test_hdu(infptr, outfptr, outfptr2, fpvar, &stat); /* fits_set_compression_type (outfptr, BZIP2_1, &stat); fits_set_tile_dim (outfptr, 6, fpvar.ntile, &stat); fp_test_hdu(infptr, outfptr, outfptr2, fpvar, &stat); */ /* fits_set_compression_type (outfptr, PLIO_1, &stat); fits_set_tile_dim (outfptr, 6, fpvar.ntile, &stat); fp_test_hdu(infptr, outfptr, outfptr2, fpvar, &stat); */ /* if (bitpix == SHORT_IMG || bitpix == LONG_IMG) { fits_set_compression_type (outfptr, NOCOMPRESS, &stat); fits_set_tile_dim (outfptr, 6, fpvar.ntile, &stat); fp_test_hdu(infptr, outfptr, outfptr2, fpvar, &stat); } */ if (fpvar.outfile[0]) fprintf(outreport,"\n"); /* delete the temporary file */ if (rescale_flag) { fits_delete_file (infptr, &stat); tempfilename3[0] = '\0'; /* clear the temp filename */ } } else if ( (hdutype == BINARY_TBL) && fpvar.do_tables) { fits_get_num_rowsll(inputfptr, &nrows, &stat); fits_get_num_cols(inputfptr, &ncols, &stat); #if defined(_MSC_VER) /* Microsoft Visual C++ 6.0 uses '%I64d' syntax for 8-byte integers */ printf("\n File: %s, HDU %d, %d cols X %I64d rows\n", infits, extnum, ncols, nrows); #elif (USE_LL_SUFFIX == 1) printf("\n File: %s, HDU %d, %d cols X %lld rows\n", infits, extnum, ncols, nrows); #else printf("\n File: %s, HDU %d, %d cols X %ld rows\n", infits, extnum, ncols, nrows); #endif fp_test_table(inputfptr, outfptr, outfptr2, fpvar, &stat); } else { fits_copy_hdu (inputfptr, outfptr, 0, &stat); fits_copy_hdu (inputfptr, outfptr2, 0, &stat); } fits_movrel_hdu (inputfptr, 1, NULL, &stat); extnum++; } if (stat == END_OF_FILE) stat = 0; fits_close_file (outfptr2, &stat); fits_close_file (outfptr, &stat); fits_close_file (inputfptr, &stat); if (stat) { fits_report_error (stderr, stat); } return(0); } /*--------------------------------------------------------------------------*/ int fp_pack_hdu (fitsfile *infptr, fitsfile *outfptr, fpstate fpvar, int *islossless, int *status) { fitsfile *tempfile; long naxes[9] = {1, 1, 1, 1, 1, 1, 1, 1, 1}; int stat=0, totpix=0, naxis=0, ii, hdutype, bitpix; int tstatus, hdunum; double bscale, rescale; char outfits[SZ_STR], fzalgor[FLEN_VALUE]; long headstart, datastart, dataend, datasize; double noisemin; /* structure to hold image statistics (defined in fpack.h) */ imgstats imagestats; if (*status) return(0); fits_get_hdu_type (infptr, &hdutype, &stat); if (hdutype == IMAGE_HDU) { fits_get_img_param (infptr, 9, &bitpix, &naxis, naxes, &stat); for (totpix=1, ii=0; ii < 9; ii++) totpix *= naxes[ii]; } /* check directive keyword to see if this HDU should not be compressed */ tstatus = 0; if (!fits_read_key(infptr, TSTRING, "FZALGOR", fzalgor, NULL, &tstatus) ) { if (!strcmp(fzalgor, "NONE") || !strcmp(fzalgor, "none") ) { fits_copy_hdu (infptr, outfptr, 0, &stat); *status = stat; return(0); } } /* =============================================================== */ /* This block is only for binary table compression */ if (hdutype == BINARY_TBL && fpvar.do_tables) { fits_get_hduaddr(infptr, &headstart, &datastart, &dataend, status); datasize = dataend - datastart; if (datasize <= 2880) { /* data is less than 1 FITS block in size, so don't compress */ fits_copy_hdu (infptr, outfptr, 0, &stat); } else { fits_compress_table (infptr, outfptr, &stat); } *status = stat; return(0); } /* =============================================================== */ /* If this is not a non-null image HDU, just copy it verbatim */ if (fits_is_compressed_image (infptr, &stat) || hdutype != IMAGE_HDU || naxis == 0 || totpix == 0 || !fpvar.do_images) { fits_copy_hdu (infptr, outfptr, 0, &stat); } else { /* remaining code deals only with IMAGE HDUs */ /* special case: rescale a scaled integer image to reduce noise? */ if (fpvar.rescale_noise != 0. && bitpix > 0 && bitpix < LONGLONG_IMG) { tstatus = 0; fits_read_key(infptr, TDOUBLE, "BSCALE", &bscale, 0, &tstatus); if (tstatus == 0 && bscale != 1.0) { /* image must be scaled */ if (bitpix == LONG_IMG) fp_i4stat(infptr, naxis, naxes, &imagestats, &stat); else fp_i2stat(infptr, naxis, naxes, &imagestats, &stat); /* use the minimum of the MAD 2nd, 3rd, and 5th order noise estimates */ noisemin = imagestats.noise3; if (imagestats.noise2 != 0. && imagestats.noise2 < noisemin) noisemin = imagestats.noise2; if (imagestats.noise5 != 0. && imagestats.noise5 < noisemin) noisemin = imagestats.noise5; rescale = noisemin / fpvar.rescale_noise; if (rescale > 1.0) { /* all the criteria are met, so create a temporary file that */ /* contains a rescaled version of the image, in output directory */ /* create temporary file name */ fits_file_name(outfptr, outfits, &stat); /* get the output file name */ fp_tmpnam("Tmp3", outfits, tempfilename3); fits_create_file(&tempfile, tempfilename3, &stat); fits_get_hdu_num(infptr, &hdunum); if (hdunum != 1) { /* the input hdu is an image extension, so create dummy primary */ fits_create_img(tempfile, 8, 0, naxes, &stat); } fits_copy_header(infptr, tempfile, &stat); /* copy the header */ /* rescale the data, so that it will compress more efficiently */ if (bitpix == LONG_IMG) fp_i4rescale(infptr, naxis, naxes, rescale, tempfile, &stat); else fp_i2rescale(infptr, naxis, naxes, rescale, tempfile, &stat); /* scale the BSCALE keyword by the inverse factor */ bscale = bscale * rescale; fits_update_key(tempfile, TDOUBLE, "BSCALE", &bscale, 0, &stat); /* rescan the header, to reset the actual scaling parameters */ fits_set_hdustruc(tempfile, &stat); fits_img_compress (tempfile, outfptr, &stat); fits_delete_file (tempfile, &stat); tempfilename3[0] = '\0'; /* clear the temp filename */ *islossless = 0; /* used a lossy compression method */ *status = stat; return(0); } } } /* if requested to do lossy compression of integer images (by */ /* converting to float), then check if this HDU qualifies */ if ( (bitpix > 0) && (fpvar.int_to_float != 0) ) { if (bitpix >= LONG_IMG) fp_i4stat(infptr, naxis, naxes, &imagestats, &stat); else fp_i2stat(infptr, naxis, naxes, &imagestats, &stat); /* rescan the image header to reset scaling values (changed by fp_iNstat) */ ffrhdu(infptr, &hdutype, &stat); /* use the minimum of the MAD 2nd, 3rd, and 5th order noise estimates */ noisemin = imagestats.noise3; if (imagestats.noise2 != 0. && imagestats.noise2 < noisemin) noisemin = imagestats.noise2; if (imagestats.noise5 != 0. && imagestats.noise5 < noisemin) noisemin = imagestats.noise5; if ( (noisemin < (fpvar.n3ratio * fpvar.quantize_level) ) || (imagestats.noise3 < fpvar.n3min)) { /* image contains too little noise to quantize effectively */ fits_set_lossy_int (outfptr, 0, &stat); fits_get_hdu_num(infptr, &hdunum); printf(" HDU %d does not meet noise criteria to be quantized, so losslessly compressed.\n", hdunum); } else { /* compressed image is not identical to original */ *islossless = 0; } } /* finally, do the actual image compression */ fits_img_compress (infptr, outfptr, &stat); if (bitpix < 0 || (fpvar.comptype == HCOMPRESS_1 && fpvar.scale != 0.)) { /* compressed image is not identical to original */ *islossless = 0; } } *status = stat; return(0); } /*--------------------------------------------------------------------------*/ int fp_unpack_hdu (fitsfile *infptr, fitsfile *outfptr, fpstate fpvar, int *status) { int hdutype, lval; if (*status > 0) return(0); fits_get_hdu_type (infptr, &hdutype, status); /* =============================================================== */ /* This block is only for beta testing of binary table compression */ if (hdutype == BINARY_TBL) { fits_read_key(infptr, TLOGICAL, "ZTABLE", &lval, NULL, status); if (*status == 0 && lval != 0) { /* uncompress the table */ fits_uncompress_table (infptr, outfptr, status); } else { if (*status == KEY_NO_EXIST) /* table is not compressed */ *status = 0; fits_copy_hdu (infptr, outfptr, 0, status); } return(0); /* =============================================================== */ } else if (fits_is_compressed_image (infptr, status)) { /* uncompress the compressed image HDU */ fits_img_decompress (infptr, outfptr, status); } else { /* not a compressed image HDU, so just copy it to the output */ fits_copy_hdu (infptr, outfptr, 0, status); } return(0); } /*--------------------------------------------------------------------------*/ int fits_read_image_speed (fitsfile *infptr, float *whole_elapse, float *whole_cpu, float *row_elapse, float *row_cpu, int *status) { unsigned char *carray, cnull = 0; short *sarray, snull=0; int bitpix, naxis, anynull, *iarray, inull = 0; long ii, naxes[9], fpixel[9]={1,1,1,1,1,1,1,1,1}, lpixel[9]={1,1,1,1,1,1,1,1,1}; long inc[9]={1,1,1,1,1,1,1,1,1} ; float *earray, enull = 0, filesize; double *darray, dnull = 0; if (*status) return(*status); fits_get_img_param (infptr, 9, &bitpix, &naxis, naxes, status); if (naxis != 2)return(*status); lpixel[0] = naxes[0]; lpixel[1] = naxes[1]; /* filesize in MB */ filesize = (float) (naxes[0] * abs(bitpix) / 8000000. * naxes[1]); /* measure time required to read the raw image */ fits_set_bscale(infptr, 1.0, 0.0, status); *whole_elapse = 0.; *whole_cpu = 0; if (bitpix == BYTE_IMG) { carray = calloc(naxes[1]*naxes[0], sizeof(char)); /* remove any cached uncompressed tile (dangerous to directly modify the structure!) */ /* (infptr->Fptr)->tilerow = 0; */ marktime(status); fits_read_subset(infptr, TBYTE, fpixel, lpixel, inc, &cnull, carray, &anynull, status); /* get elapsped times */ gettime(whole_elapse, whole_cpu, status); /* now read the image again, row by row */ if (row_elapse) { /* remove any cached uncompressed tile (dangerous to directly modify the structure!) */ /* (infptr->Fptr)->tilerow = 0; */ marktime(status); for (ii = 0; ii < naxes[1]; ii++) { fpixel[1] = ii+1; fits_read_pix(infptr, TBYTE, fpixel, naxes[0], &cnull, carray, &anynull, status); } /* get elapsped times */ gettime(row_elapse, row_cpu, status); } free(carray); } else if (bitpix == SHORT_IMG) { sarray = calloc(naxes[0]*naxes[1], sizeof(short)); marktime(status); fits_read_subset(infptr, TSHORT, fpixel, lpixel, inc, &snull, sarray, &anynull, status); gettime(whole_elapse, whole_cpu, status); /* get elapsped times */ /* now read the image again, row by row */ if (row_elapse) { marktime(status); for (ii = 0; ii < naxes[1]; ii++) { fpixel[1] = ii+1; fits_read_pix(infptr, TSHORT, fpixel, naxes[0], &snull, sarray, &anynull, status); } /* get elapsped times */ gettime(row_elapse, row_cpu, status); } free(sarray); } else if (bitpix == LONG_IMG) { iarray = calloc(naxes[0]*naxes[1], sizeof(int)); marktime(status); fits_read_subset(infptr, TINT, fpixel, lpixel, inc, &inull, iarray, &anynull, status); /* get elapsped times */ gettime(whole_elapse, whole_cpu, status); /* now read the image again, row by row */ if (row_elapse) { marktime(status); for (ii = 0; ii < naxes[1]; ii++) { fpixel[1] = ii+1; fits_read_pix(infptr, TINT, fpixel, naxes[0], &inull, iarray, &anynull, status); } /* get elapsped times */ gettime(row_elapse, row_cpu, status); } free(iarray); } else if (bitpix == FLOAT_IMG) { earray = calloc(naxes[1]*naxes[0], sizeof(float)); marktime(status); fits_read_subset(infptr, TFLOAT, fpixel, lpixel, inc, &enull, earray, &anynull, status); /* get elapsped times */ gettime(whole_elapse, whole_cpu, status); /* now read the image again, row by row */ if (row_elapse) { marktime(status); for (ii = 0; ii < naxes[1]; ii++) { fpixel[1] = ii+1; fits_read_pix(infptr, TFLOAT, fpixel, naxes[0], &enull, earray, &anynull, status); } /* get elapsped times */ gettime(row_elapse, row_cpu, status); } free(earray); } else if (bitpix == DOUBLE_IMG) { darray = calloc(naxes[1]*naxes[0], sizeof(double)); marktime(status); fits_read_subset(infptr, TDOUBLE, fpixel, lpixel, inc, &dnull, darray, &anynull, status); /* get elapsped times */ gettime(whole_elapse, whole_cpu, status); /* now read the image again, row by row */ if (row_elapse) { marktime(status); for (ii = 0; ii < naxes[1]; ii++) { fpixel[1] = ii+1; fits_read_pix(infptr, TDOUBLE, fpixel, naxes[0], &dnull, darray, &anynull, status); } /* get elapsped times */ gettime(row_elapse, row_cpu, status); } free(darray); } if (whole_elapse) *whole_elapse = *whole_elapse / filesize; if (row_elapse) *row_elapse = *row_elapse / filesize; if (whole_cpu) *whole_cpu = *whole_cpu / filesize; if (row_cpu) *row_cpu = *row_cpu / filesize; return(*status); } /*--------------------------------------------------------------------------*/ int fp_test_hdu (fitsfile *infptr, fitsfile *outfptr, fitsfile *outfptr2, fpstate fpvar, int *status) { /* This routine is only used for performance testing of image HDUs. */ /* Use fp_test_table for testing binary table HDUs. */ int stat = 0, hdutype, comptype; char ctype[20], lossless[4]; long headstart, datastart, dataend; float origdata = 0., compressdata = 0.; float compratio = 0., packcpu = 0., unpackcpu = 0.; float elapse, whole_elapse, row_elapse, whole_cpu, row_cpu; unsigned long datasum1, datasum2, hdusum; if (*status) return(0); origdata = 0; compressdata = 0; compratio = 0.; lossless[0] = '\0'; fits_get_compression_type(outfptr, &comptype, &stat); if (comptype == RICE_1) strcpy(ctype, "RICE"); else if (comptype == GZIP_1) strcpy(ctype, "GZIP1"); else if (comptype == GZIP_2) strcpy(ctype, "GZIP2");/* else if (comptype == BZIP2_1) strcpy(ctype, "BZIP2"); */ else if (comptype == PLIO_1) strcpy(ctype, "PLIO"); else if (comptype == HCOMPRESS_1) strcpy(ctype, "HCOMP"); else if (comptype == NOCOMPRESS) strcpy(ctype, "NONE"); else { fp_msg ("Error: unsupported image compression type "); *status = DATA_COMPRESSION_ERR; return(0); } /* -------------- COMPRESS the image ------------------ */ marktime(&stat); fits_img_compress (infptr, outfptr, &stat); /* get elapsped times */ gettime(&elapse, &packcpu, &stat); /* get elapsed and cpu times need to read the compressed image */ fits_read_image_speed (outfptr, &whole_elapse, &whole_cpu, &row_elapse, &row_cpu, &stat); if (!stat) { /* -------------- UNCOMPRESS the image ------------------ */ /* remove any cached uncompressed tile (dangerous to directly modify the structure!) */ /* (outfptr->Fptr)->tilerow = 0; */ marktime(&stat); fits_img_decompress (outfptr, outfptr2, &stat); /* get elapsped times */ gettime(&elapse, &unpackcpu, &stat); /* ----------------------------------------------------- */ /* get sizes of original and compressed images */ fits_get_hduaddr(infptr, &headstart, &datastart, &dataend, &stat); origdata = (float) ((dataend - datastart)/1000000.); fits_get_hduaddr(outfptr, &headstart, &datastart, &dataend, &stat); compressdata = (float) ((dataend - datastart)/1000000.); if (compressdata != 0) compratio = (float) origdata / (float) compressdata; /* is this uncompressed image identical to the original? */ fits_get_chksum(infptr, &datasum1, &hdusum, &stat); fits_get_chksum(outfptr2, &datasum2, &hdusum, &stat); if ( datasum1 == datasum2) { strcpy(lossless, "Yes"); } else { strcpy(lossless, "No"); } printf(" %-5s %6.2f %7.2f ->%7.2f %7.2f %7.2f %s %5.3f %5.3f %5.3f %5.3f\n", ctype, compratio, origdata, compressdata, packcpu, unpackcpu, lossless, whole_elapse, whole_cpu, row_elapse, row_cpu); if (fpvar.outfile[0]) { fprintf(outreport," %6.3f %5.2f %5.2f %s %7.3f %7.3f %7.3f %7.3f", compratio, packcpu, unpackcpu, lossless, whole_elapse, whole_cpu, row_elapse, row_cpu); } /* delete the output HDUs to concerve disk space */ fits_delete_hdu(outfptr, &hdutype, &stat); fits_delete_hdu(outfptr2, &hdutype, &stat); } else { printf(" %-5s (unable to compress image)\n", ctype); } /* try to recover from any compression errors */ if (stat == DATA_COMPRESSION_ERR) stat = 0; *status = stat; return(0); } /*--------------------------------------------------------------------------*/ int fp_test_table (fitsfile *infptr, fitsfile *outfptr, fitsfile *outfptr2, fpstate fpvar, int *status) { /* this routine is for performance testing of the table compression methods */ int stat = 0, hdutype, tstatus = 0; char fzalgor[FLEN_VALUE]; LONGLONG headstart, datastart, dataend; float elapse, cpu; if (*status) return(0); /* check directive keyword to see if this HDU should not be compressed */ if (!fits_read_key(infptr, TSTRING, "FZALGOR", fzalgor, NULL, &tstatus) ) { if (!strcmp(fzalgor, "NONE") || !strcmp(fzalgor, "none")) { return(0); } } fits_get_hduaddrll(infptr, &headstart, &datastart, &dataend, status); /* can't compress small tables with less than 2880 bytes of data */ if (dataend - datastart <= 2880) { return(0); } marktime(&stat); stat= -999; /* set special flag value */ fits_compress_table (infptr, outfptr, &stat); /* get elapsped times */ gettime(&elapse, &cpu, &stat); fits_delete_hdu(outfptr, &hdutype, &stat); printf("\nElapsed time = %f, cpu = %f\n", elapse, cpu); fits_report_error (stderr, stat); return(0); } /*--------------------------------------------------------------------------*/ int marktime(int *status) { #if defined(unix) || defined(__unix__) || defined(__unix) struct timeval tv; /* struct timezone tz; */ /* gettimeofday (&tv, &tz); */ gettimeofday (&tv, NULL); startsec = tv.tv_sec; startmilli = tv.tv_usec/1000; scpu = clock(); #else /* don't support high timing precision on Windows machines */ startsec = 0; startmilli = 0; scpu = clock(); #endif return( *status ); } /*--------------------------------------------------------------------------*/ int gettime(float *elapse, float *elapscpu, int *status) { #if defined(unix) || defined(__unix__) || defined(__unix) struct timeval tv; /* struct timezone tz; */ int stopmilli; long stopsec; /* gettimeofday (&tv, &tz); */ gettimeofday (&tv, NULL); ecpu = clock(); stopmilli = tv.tv_usec/1000; stopsec = tv.tv_sec; *elapse = (stopsec - startsec) + (stopmilli - startmilli)/1000.; *elapscpu = (ecpu - scpu) * 1.0 / CLOCKTICKS; /* printf(" (start: %ld + %d), stop: (%ld + %d) elapse: %f\n ", startsec,startmilli,stopsec, stopmilli, *elapse); */ #else /* set the elapsed time the same as the CPU time on Windows machines */ *elapscpu = (float) ((ecpu - scpu) * 1.0 / CLOCKTICKS); *elapse = *elapscpu; #endif return( *status ); } /*--------------------------------------------------------------------------*/ int fp_i2stat(fitsfile *infptr, int naxis, long *naxes, imgstats *imagestats, int *status) { /* read the central XSAMPLE by YSAMPLE region of pixels in the int*2 image, and then compute basic statistics: min, max, mean, sigma, mean diff, etc. */ long fpixel[9] = {1,1,1,1,1,1,1,1,1}; long lpixel[9] = {1,1,1,1,1,1,1,1,1}; long inc[9] = {1,1,1,1,1,1,1,1,1}; long i1, i2, npix, ngood, nx, ny; short *intarray, minvalue, maxvalue, nullvalue; int anynul, tstatus, checknull = 1; double mean, sigma, noise1, noise2, noise3, noise5; /* select the middle XSAMPLE by YSAMPLE area of the image */ i1 = naxes[0]/2 - (XSAMPLE/2 - 1); i2 = naxes[0]/2 + (XSAMPLE/2); if (i1 < 1) i1 = 1; if (i2 > naxes[0]) i2 = naxes[0]; fpixel[0] = i1; lpixel[0] = i2; nx = i2 - i1 +1; if (naxis > 1) { i1 = naxes[1]/2 - (YSAMPLE/2 - 1); i2 = naxes[1]/2 + (YSAMPLE/2); if (i1 < 1) i1 = 1; if (i2 > naxes[1]) i2 = naxes[1]; fpixel[1] = i1; lpixel[1] = i2; } ny = i2 - i1 +1; npix = nx * ny; /* if there are higher dimensions, read the middle plane of the cube */ if (naxis > 2) { fpixel[2] = naxes[2]/2 + 1; lpixel[2] = naxes[2]/2 + 1; } intarray = calloc(npix, sizeof(short)); if (!intarray) { *status = MEMORY_ALLOCATION; return(*status); } /* turn off any scaling of the integer pixel values */ fits_set_bscale(infptr, 1.0, 0.0, status); fits_read_subset_sht(infptr, 0, naxis, naxes, fpixel, lpixel, inc, 0, intarray, &anynul, status); /* read the null value keyword (BLANK) if present */ tstatus = 0; fits_read_key(infptr, TSHORT, "BLANK", &nullvalue, 0, &tstatus); if (tstatus) { nullvalue = 0; checknull = 0; } /* compute statistics of the image */ fits_img_stats_short(intarray, nx, ny, checknull, nullvalue, &ngood, &minvalue, &maxvalue, &mean, &sigma, &noise1, &noise2, &noise3, &noise5, status); imagestats->n_nulls = npix - ngood; imagestats->minval = minvalue; imagestats->maxval = maxvalue; imagestats->mean = mean; imagestats->sigma = sigma; imagestats->noise1 = noise1; imagestats->noise2 = noise2; imagestats->noise3 = noise3; imagestats->noise5 = noise5; free(intarray); return(*status); } /*--------------------------------------------------------------------------*/ int fp_i4stat(fitsfile *infptr, int naxis, long *naxes, imgstats *imagestats, int *status) { /* read the central XSAMPLE by YSAMPLE region of pixels in the int*2 image, and then compute basic statistics: min, max, mean, sigma, mean diff, etc. */ long fpixel[9] = {1,1,1,1,1,1,1,1,1}; long lpixel[9] = {1,1,1,1,1,1,1,1,1}; long inc[9] = {1,1,1,1,1,1,1,1,1}; long i1, i2, npix, ngood, nx, ny; int *intarray, minvalue, maxvalue, nullvalue; int anynul, tstatus, checknull = 1; double mean, sigma, noise1, noise2, noise3, noise5; /* select the middle XSAMPLE by YSAMPLE area of the image */ i1 = naxes[0]/2 - (XSAMPLE/2 - 1); i2 = naxes[0]/2 + (XSAMPLE/2); if (i1 < 1) i1 = 1; if (i2 > naxes[0]) i2 = naxes[0]; fpixel[0] = i1; lpixel[0] = i2; nx = i2 - i1 +1; if (naxis > 1) { i1 = naxes[1]/2 - (YSAMPLE/2 - 1); i2 = naxes[1]/2 + (YSAMPLE/2); if (i1 < 1) i1 = 1; if (i2 > naxes[1]) i2 = naxes[1]; fpixel[1] = i1; lpixel[1] = i2; } ny = i2 - i1 +1; npix = nx * ny; /* if there are higher dimensions, read the middle plane of the cube */ if (naxis > 2) { fpixel[2] = naxes[2]/2 + 1; lpixel[2] = naxes[2]/2 + 1; } intarray = calloc(npix, sizeof(int)); if (!intarray) { *status = MEMORY_ALLOCATION; return(*status); } /* turn off any scaling of the integer pixel values */ fits_set_bscale(infptr, 1.0, 0.0, status); fits_read_subset_int(infptr, 0, naxis, naxes, fpixel, lpixel, inc, 0, intarray, &anynul, status); /* read the null value keyword (BLANK) if present */ tstatus = 0; fits_read_key(infptr, TINT, "BLANK", &nullvalue, 0, &tstatus); if (tstatus) { nullvalue = 0; checknull = 0; } /* compute statistics of the image */ fits_img_stats_int(intarray, nx, ny, checknull, nullvalue, &ngood, &minvalue, &maxvalue, &mean, &sigma, &noise1, &noise2, &noise3, &noise5, status); imagestats->n_nulls = npix - ngood; imagestats->minval = minvalue; imagestats->maxval = maxvalue; imagestats->mean = mean; imagestats->sigma = sigma; imagestats->noise1 = noise1; imagestats->noise2 = noise2; imagestats->noise3 = noise3; imagestats->noise5 = noise5; free(intarray); return(*status); } /*--------------------------------------------------------------------------*/ int fp_r4stat(fitsfile *infptr, int naxis, long *naxes, imgstats *imagestats, int *status) { /* read the central XSAMPLE by YSAMPLE region of pixels in the int*2 image, and then compute basic statistics: min, max, mean, sigma, mean diff, etc. */ long fpixel[9] = {1,1,1,1,1,1,1,1,1}; long lpixel[9] = {1,1,1,1,1,1,1,1,1}; long inc[9] = {1,1,1,1,1,1,1,1,1}; long i1, i2, npix, ngood, nx, ny; float *array, minvalue, maxvalue, nullvalue = FLOATNULLVALUE; int anynul,checknull = 1; double mean, sigma, noise1, noise2, noise3, noise5; /* select the middle XSAMPLE by YSAMPLE area of the image */ i1 = naxes[0]/2 - (XSAMPLE/2 - 1); i2 = naxes[0]/2 + (XSAMPLE/2); if (i1 < 1) i1 = 1; if (i2 > naxes[0]) i2 = naxes[0]; fpixel[0] = i1; lpixel[0] = i2; nx = i2 - i1 +1; if (naxis > 1) { i1 = naxes[1]/2 - (YSAMPLE/2 - 1); i2 = naxes[1]/2 + (YSAMPLE/2); if (i1 < 1) i1 = 1; if (i2 > naxes[1]) i2 = naxes[1]; fpixel[1] = i1; lpixel[1] = i2; } ny = i2 - i1 +1; npix = nx * ny; /* if there are higher dimensions, read the middle plane of the cube */ if (naxis > 2) { fpixel[2] = naxes[2]/2 + 1; lpixel[2] = naxes[2]/2 + 1; } array = calloc(npix, sizeof(float)); if (!array) { *status = MEMORY_ALLOCATION; return(*status); } fits_read_subset_flt(infptr, 0, naxis, naxes, fpixel, lpixel, inc, nullvalue, array, &anynul, status); /* are there any null values in the array? */ if (!anynul) { nullvalue = 0.; checknull = 0; } /* compute statistics of the image */ fits_img_stats_float(array, nx, ny, checknull, nullvalue, &ngood, &minvalue, &maxvalue, &mean, &sigma, &noise1, &noise2, &noise3, &noise5, status); imagestats->n_nulls = npix - ngood; imagestats->minval = minvalue; imagestats->maxval = maxvalue; imagestats->mean = mean; imagestats->sigma = sigma; imagestats->noise1 = noise1; imagestats->noise2 = noise2; imagestats->noise3 = noise3; imagestats->noise5 = noise5; free(array); return(*status); } /*--------------------------------------------------------------------------*/ int fp_i2rescale(fitsfile *infptr, int naxis, long *naxes, double rescale, fitsfile *outfptr, int *status) { /* divide the integer pixel values in the input file by rescale, and write back out to the output file.. */ long ii, jj, nelem = 1, nx, ny; short *intarray, nullvalue; int anynul, tstatus, checknull = 1; nx = naxes[0]; ny = 1; for (ii = 1; ii < naxis; ii++) { ny = ny * naxes[ii]; } intarray = calloc(nx, sizeof(short)); if (!intarray) { *status = MEMORY_ALLOCATION; return(*status); } /* read the null value keyword (BLANK) if present */ tstatus = 0; fits_read_key(infptr, TSHORT, "BLANK", &nullvalue, 0, &tstatus); if (tstatus) { checknull = 0; } /* turn off any scaling of the integer pixel values */ fits_set_bscale(infptr, 1.0, 0.0, status); fits_set_bscale(outfptr, 1.0, 0.0, status); for (ii = 0; ii < ny; ii++) { fits_read_img_sht(infptr, 1, nelem, nx, 0, intarray, &anynul, status); if (checknull) { for (jj = 0; jj < nx; jj++) { if (intarray[jj] != nullvalue) intarray[jj] = NSHRT( (intarray[jj] / rescale) ); } } else { for (jj = 0; jj < nx; jj++) intarray[jj] = NSHRT( (intarray[jj] / rescale) ); } fits_write_img_sht(outfptr, 1, nelem, nx, intarray, status); nelem += nx; } free(intarray); return(*status); } /*--------------------------------------------------------------------------*/ int fp_i4rescale(fitsfile *infptr, int naxis, long *naxes, double rescale, fitsfile *outfptr, int *status) { /* divide the integer pixel values in the input file by rescale, and write back out to the output file.. */ long ii, jj, nelem = 1, nx, ny; int *intarray, nullvalue; int anynul, tstatus, checknull = 1; nx = naxes[0]; ny = 1; for (ii = 1; ii < naxis; ii++) { ny = ny * naxes[ii]; } intarray = calloc(nx, sizeof(int)); if (!intarray) { *status = MEMORY_ALLOCATION; return(*status); } /* read the null value keyword (BLANK) if present */ tstatus = 0; fits_read_key(infptr, TINT, "BLANK", &nullvalue, 0, &tstatus); if (tstatus) { checknull = 0; } /* turn off any scaling of the integer pixel values */ fits_set_bscale(infptr, 1.0, 0.0, status); fits_set_bscale(outfptr, 1.0, 0.0, status); for (ii = 0; ii < ny; ii++) { fits_read_img_int(infptr, 1, nelem, nx, 0, intarray, &anynul, status); if (checknull) { for (jj = 0; jj < nx; jj++) { if (intarray[jj] != nullvalue) intarray[jj] = NINT( (intarray[jj] / rescale) ); } } else { for (jj = 0; jj < nx; jj++) intarray[jj] = NINT( (intarray[jj] / rescale) ); } fits_write_img_int(outfptr, 1, nelem, nx, intarray, status); nelem += nx; } free(intarray); return(*status); } /* ======================================================================== * Signal and error handler. */ void abort_fpack(int sig) { /* clean up by deleting temporary files */ if (tempfilename[0]) { remove(tempfilename); } if (tempfilename2[0]) { remove(tempfilename2); } if (tempfilename3[0]) { remove(tempfilename3); } exit(-1); } cfitsio-3.47/funpack.c0000644000225700000360000001107013464573432014202 0ustar cagordonlhea/* FUNPACK * R. Seaman, NOAO * uses fits_img_compress by W. Pence, HEASARC */ #include "fitsio.h" #include "fpack.h" int main (int argc, char *argv[]) { fpstate fpvar; if (argc <= 1) { fu_usage (); fu_hint (); exit (-1); } fp_init (&fpvar); fu_get_param (argc, argv, &fpvar); if (fpvar.listonly) { fp_list (argc, argv, fpvar); } else { fp_preflight (argc, argv, FUNPACK, &fpvar); fp_loop (argc, argv, FUNPACK, fpvar); } exit (0); } int fu_get_param (int argc, char *argv[], fpstate *fpptr) { int iarg; char tile[SZ_STR]; if (fpptr->initialized != FP_INIT_MAGIC) { fp_msg ("Error: internal initialization error\n"); exit (-1); } tile[0] = 0; /* by default, .fz suffix characters to be deleted from compressed file */ fpptr->delete_suffix = 1; /* flags must come first and be separately specified */ for (iarg = 1; iarg < argc; iarg++) { if (argv[iarg][0] == '-' && strlen (argv[iarg]) == 2) { if (argv[iarg][1] == 'F') { fpptr->clobber++; fpptr->delete_suffix = 0; /* no suffix in this case */ } else if (argv[iarg][1] == 'D') { fpptr->delete_input++; } else if (argv[iarg][1] == 'P') { if (++iarg >= argc) { fu_usage (); fu_hint (); exit (-1); } else { strncpy (fpptr->prefix, argv[iarg], SZ_STR-1); fpptr->prefix[SZ_STR-1] = 0; } } else if (argv[iarg][1] == 'E') { if (++iarg >= argc) { fu_usage (); fu_hint (); exit (-1); } else { strncpy (fpptr->extname, argv[iarg], SZ_STR-1); fpptr->extname[SZ_STR-1]=0; } } else if (argv[iarg][1] == 'S') { fpptr->to_stdout++; } else if (argv[iarg][1] == 'L') { fpptr->listonly++; } else if (argv[iarg][1] == 'C') { fpptr->do_checksums = 0; } else if (argv[iarg][1] == 'H') { fu_help (); exit (0); } else if (argv[iarg][1] == 'V') { fp_version (); exit (0); } else if (argv[iarg][1] == 'Z') { fpptr->do_gzip_file++; } else if (argv[iarg][1] == 'v') { fpptr->verbose = 1; } else if (argv[iarg][1] == 'O') { if (++iarg >= argc) { fu_usage (); fu_hint (); exit (-1); } else { strncpy (fpptr->outfile, argv[iarg], SZ_STR-1); fpptr->outfile[SZ_STR-1]=0; } } else { fp_msg ("Error: unknown command line flag `"); fp_msg (argv[iarg]); fp_msg ("'\n"); fu_usage (); fu_hint (); exit (-1); } } else break; } if (fpptr->extname[0] && (fpptr->clobber || fpptr->delete_input)) { fp_msg ("Error: -E option may not be used with -F or -D\n"); fu_usage (); exit (-1); } if (fpptr->to_stdout && (fpptr->outfile[0] || fpptr->prefix[0]) ) { fp_msg ("Error: -S option may not be used with -P or -O\n"); fu_usage (); exit (-1); } if (fpptr->outfile[0] && fpptr->prefix[0] ) { fp_msg ("Error: -P and -O options may not be used together\n"); fu_usage (); exit (-1); } if (iarg >= argc) { fp_msg ("Error: no FITS files to uncompress\n"); fu_usage (); exit (-1); } else fpptr->firstfile = iarg; return(0); } int fu_usage (void) { fp_msg ("usage: funpack [-E ] [-P

] [-O ] [-Z] -v \n");
        fp_msg ("more:   [-F] [-D] [-S] [-L] [-C] [-H] [-V] \n");
	return(0);
}

int fu_hint (void)
{
	fp_msg ("      `funpack -H' for help\n");
	return(0);
}

int fu_help (void)
{
fp_msg ("funpack, decompress fpacked files.  Version ");
fp_version ();
fu_usage ();
fp_msg ("\n");

fp_msg ("Flags must be separate and appear before filenames:\n");
fp_msg (" -E  Unpack only the list of HDU names or numbers in the file.\n");
fp_msg (" -P 
    Prepend 
 to create new output filenames.\n");
fp_msg (" -O    Specify full output file name.\n");
fp_msg (" -Z          Recompress the output file with host GZIP program.\n");
fp_msg (" -F          Overwrite input file by output file with same name.\n");
fp_msg (" -D          Delete input file after writing output.\n");
fp_msg (" -S          Output uncompressed file to STDOUT file stream.\n");
fp_msg (" -L          List contents, files unchanged.\n");

fp_msg (" -C          Don't update FITS checksum keywords.\n");

fp_msg (" -v          Verbose mode; list each file as it is processed.\n");
fp_msg (" -H          Show this message.\n");
fp_msg (" -V          Show version number.\n");

fp_msg (" \n       FITS files to unpack; enter '-' (a hyphen) to read from stdin.\n");
fp_msg (" Refer to the fpack User's Guide for more extensive help.\n");
	return(0);
}
cfitsio-3.47/getcolb.c0000644000225700000360000023137113464573432014202 0ustar  cagordonlhea/*  This file, getcolb.c, contains routines that read data elements from   */
/*  a FITS image or table, with unsigned char (unsigned byte) data type.   */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffgpvb( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            unsigned char nulval, /* I - value for undefined pixels          */
            unsigned char *array, /* O - array of values that are returned   */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    char cdummy;
    int nullcheck = 1;
    unsigned char nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
         nullvalue = nulval;  /* set local variable */

        fits_read_compressed_pixels(fptr, TBYTE, firstelem, nelem,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclb(fptr, 2, row, firstelem, nelem, 1, 1, nulval,
               array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpfb( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            unsigned char *array, /* O - array of values that are returned   */
            char *nularray,   /* O - array of null pixel flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Any undefined pixels in the returned array will be set = 0 and the 
  corresponding nularray value will be set = 1.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    int nullcheck = 2;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, TBYTE, firstelem, nelem,
            nullcheck, NULL, array, nularray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclb(fptr, 2, row, firstelem, nelem, 1, 2, 0,
               array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg2db(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           unsigned char nulval, /* set undefined pixels equal to this     */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           unsigned char *array, /* O - array to be filled and returned    */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    /* call the 3D reading routine, with the 3rd dimension = 1 */

    ffg3db(fptr, group, nulval, ncols, naxis2, naxis1, naxis2, 1, array, 
           anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg3db(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           unsigned char nulval, /* set undefined pixels equal to this     */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  nrows,     /* I - number of rows in each plane of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  naxis3,    /* I - FITS image NAXIS3 value                 */
           unsigned char *array, /* O - array to be filled and returned    */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 3-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    long tablerow, ii, jj;
    LONGLONG narray, nfits;
    char cdummy;
    int  nullcheck = 1;
    long inc[] = {1,1,1};
    LONGLONG fpixel[] = {1,1,1};
    LONGLONG lpixel[3];
    unsigned char nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        lpixel[0] = ncols;
        lpixel[1] = nrows;
        lpixel[2] = naxis3;
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TBYTE, fpixel, lpixel, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
       /* all the image pixels are contiguous, so read all at once */
       ffgclb(fptr, 2, tablerow, 1, naxis1 * naxis2 * naxis3, 1, 1, nulval,
               array, &cdummy, anynul, status);
       return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to read */
    narray = 0;  /* next pixel in output array to be filled */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* reading naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffgclb(fptr, 2, tablerow, nfits, naxis1, 1, 1, nulval,
          &array[narray], &cdummy, anynul, status) > 0)
          return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsvb(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           unsigned char nulval, /* I - value to set undefined pixels       */
           unsigned char *array, /* O - array to be filled and returned     */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii, i0, i1, i2, i3, i4, i5, i6, i7, i8, row, rstr, rstp, rinc;
    long str[9], stp[9], incr[9], dir[9];
    long nelem, nultyp, ninc, numcol;
    LONGLONG felem, dsize[10], blcll[9], trcll[9];
    int hdutype, anyf;
    char ldummy, msg[FLEN_ERRMSG];
    int  nullcheck = 1;
    unsigned char nullvalue;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvb is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TBYTE, blcll, trcll, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 1;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
        dir[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        if (hdutype == IMAGE_HDU)
        {
           dir[ii] = -1;
        }
        else
        {
          snprintf(msg, FLEN_ERRMSG,"ffgsvb: illegal range specified for axis %ld", ii + 1);
          ffpmsg(msg);
          return(*status = BAD_PIX_NUM);
        }
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
      dsize[ii] = dsize[ii] * dir[ii];
    }
    dsize[naxis] = dsize[naxis] * dir[naxis];

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0]*dir[0] - str[0]*dir[0]) / inc[0] + 1;
      ninc = incr[0] * dir[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]*dir[8]; i8 <= stp[8]*dir[8]; i8 += incr[8])
     {
      for (i7 = str[7]*dir[7]; i7 <= stp[7]*dir[7]; i7 += incr[7])
      {
       for (i6 = str[6]*dir[6]; i6 <= stp[6]*dir[6]; i6 += incr[6])
       {
        for (i5 = str[5]*dir[5]; i5 <= stp[5]*dir[5]; i5 += incr[5])
        {
         for (i4 = str[4]*dir[4]; i4 <= stp[4]*dir[4]; i4 += incr[4])
         {
          for (i3 = str[3]*dir[3]; i3 <= stp[3]*dir[3]; i3 += incr[3])
          {
           for (i2 = str[2]*dir[2]; i2 <= stp[2]*dir[2]; i2 += incr[2])
           {
            for (i1 = str[1]*dir[1]; i1 <= stp[1]*dir[1]; i1 += incr[1])
            {

              felem=str[0] + (i1 - dir[1]) * dsize[1] + (i2 - dir[2]) * dsize[2] + 
                             (i3 - dir[3]) * dsize[3] + (i4 - dir[4]) * dsize[4] +
                             (i5 - dir[5]) * dsize[5] + (i6 - dir[6]) * dsize[6] +
                             (i7 - dir[7]) * dsize[7] + (i8 - dir[8]) * dsize[8];

              if ( ffgclb(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &ldummy, &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsfb(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           unsigned char *array, /* O - array to be filled and returned     */
           char *flagval,  /* O - set to 1 if corresponding value is null   */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dsize[10];
    LONGLONG blcll[9], trcll[9];
    long felem, nelem, nultyp, ninc, numcol;
    int hdutype, anyf;
    unsigned char nulval = 0;
    char msg[FLEN_ERRMSG];
    int  nullcheck = 2;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvb is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        fits_read_compressed_img(fptr, TBYTE, blcll, trcll, inc,
            nullcheck, NULL, array, flagval, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 2;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvb: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgclb(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &flagval[i0], &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffggpb( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            long  firstelem,  /* I - first vector element to read (1 = 1st)  */
            long  nelem,      /* I - number of values to read                */
            unsigned char *array, /* O - array of values that are returned   */
            int  *status)     /* IO - error status                           */
/*
  Read an array of group parameters from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
*/
{
    long row;
    int idummy;
    char cdummy;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclb(fptr, 1, row, firstelem, nelem, 1, 1, 0,
               array, &cdummy, &idummy, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvb(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           unsigned char nulval, /* I - value for null pixels               */
           unsigned char *array, /* O - array of values that are read       */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgclb(fptr, colnum, firstrow, firstelem, nelem, 1, 1, nulval,
           array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfb(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           unsigned char *array, /* O - array of values that are read       */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    unsigned char dummy = 0;

    ffgclb(fptr, colnum, firstrow, firstelem, nelem, 1, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgclb( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  elemincre,  /* I - pixel increment; e.g., 2 = every other  */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
            unsigned char nulval, /* I - value for null pixels if nultyp = 1 */
            unsigned char *array, /* O - array of values that are read       */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer be a virtual column in a 1 or more grouped FITS primary
  array or image extension.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The output array of values will be converted from the datatype of the column 
  and will be scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    double scale, zero, power = 1., dtemp;
    int tcode, maxelem2, hdutype, xcode, decimals;
    long twidth, incre, ntodo;
    long ii, xwidth;
    int convert, nulcheck, readcheck = 0;
    LONGLONG repeat, startpos, elemnum, readptr, tnull;
    LONGLONG rowlen, rownum, remain, next, rowincre, maxelem;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value if reading from ASCII table  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    union u_tag {
       char charval;
       unsigned char ucharval;
    } u;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    if (anynul)
        *anynul = 0;

    if (nultyp == 2)      
       memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (elemincre < 0)
        readcheck = -1;  /* don't do range checking in this case */

    ffgcprll( fptr, colnum, firstrow, firstelem, nelem, readcheck, &scale, &zero,
         tform, &twidth, &tcode, &maxelem2, &startpos, &elemnum, &incre,
         &repeat, &rowlen, &hdutype, &tnull, snull, status);
    maxelem = maxelem2;

    /* special case */
    if (tcode == TLOGICAL && elemincre == 1)
    {
        u.ucharval = nulval;
        ffgcll(fptr, colnum, firstrow, firstelem, nelem, nultyp,
               u.charval, (char *) array, nularray, anynul, status);

        return(*status);
    }

    if (strchr(tform,'A') != NULL) 
    {
        if (*status == BAD_ELEM_NUM)
        {
            /* ignore this error message */
            *status = 0;
            ffcmsg();   /* clear error stack */
        }

        /*  interpret a 'A' ASCII column as a 'B' byte column ('8A' == '8B') */
        /*  This is an undocumented 'feature' in CFITSIO */

        /*  we have to reset some of the values returned by ffgcpr */
        
        tcode = TBYTE;
        incre = 1;         /* each element is 1 byte wide */
        repeat = twidth;   /* total no. of chars in the col */
        twidth = 1;        /* width of each element */
        scale = 1.0;       /* no scaling */
        zero  = 0.0;
        tnull = NULL_UNDEFINED;  /* don't test for nulls */
        maxelem = DBUFFSIZE;
    }

    if (*status > 0)
        return(*status);
        
    incre *= elemincre;   /* multiply incre to just get every nth pixel */

    if (tcode == TSTRING && hdutype == ASCII_TBL) /* setup for ASCII tables */
    {
      /* get the number of implied decimal places if no explicit decmal point */
      ffasfm(tform, &xcode, &xwidth, &decimals, status); 
      for(ii = 0; ii < decimals; ii++)
        power *= 10.;
    }
    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default, check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (tcode%10 == 1 &&        /* if reading an integer column, and  */ 
            tnull == NULL_UNDEFINED) /* if a null value is not defined,    */
            nulcheck = 0;            /* then do not check for null values. */

    else if (tcode == TSHORT && (tnull > SHRT_MAX || tnull < SHRT_MIN) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TBYTE && (tnull > 255 || tnull < 0) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TSTRING && snull[0] == ASCII_NULL_UNDEFINED)
         nulcheck = 0;

    /*----------------------------------------------------------------------*/
    /*  If FITS column and output data array have same datatype, then we do */
    /*  not need to use a temporary buffer to store intermediate datatype.  */
    /*----------------------------------------------------------------------*/
    convert = 1;
    if (tcode == TBYTE) /* Special Case:                        */
    {                             /* no type convertion required, so read */
                                  /* data directly into output buffer.    */

        if (nelem < (LONGLONG)INT32_MAX) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX;
        }

        if (nulcheck == 0 && scale == 1. && zero == 0.)
            convert = 0;  /* no need to scale data or find nulls */
    }

    /*---------------------------------------------------------------------*/
    /*  Now read the pixels from the FITS column. If the column does not   */
    /*  have the same datatype as the output array, then we have to read   */
    /*  the raw values into a temporary buffer (of limited size).  In      */
    /*  the case of a vector colum read only 1 vector of values at a time  */
    /*  then skip to the next row if more values need to be read.          */
    /*  After reading the raw values, then call the fffXXYY routine to (1) */
    /*  test for undefined values, (2) convert the datatype if necessary,  */
    /*  and (3) scale the values by the FITS TSCALn and TZEROn linear      */
    /*  scaling parameters.                                                */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */

    while (remain)
    {
        /* limit the number of pixels to read at one time to the number that
           will fit in the buffer or to the number of pixels that remain in
           the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);
        if (elemincre >= 0)
        {
          ntodo = (long) minvalue(ntodo, ((repeat - elemnum - 1)/elemincre +1));
        }
        else
        {
          ntodo = (long) minvalue(ntodo, (elemnum/(-elemincre) +1));
        }

        readptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * (incre / elemincre));

        switch (tcode) 
        {
            case (TBYTE):
                ffgi1b(fptr, readptr, ntodo, incre, &array[next], status);
                if (convert)
                    fffi1i1(&array[next], ntodo, scale, zero, nulcheck, 
                    (unsigned char) tnull, nulval, &nularray[next], anynul, 
                           &array[next], status);
                break;
            case (TSHORT):
                ffgi2b(fptr, readptr, ntodo, incre, (short *) buffer, status);
                fffi2i1((short  *) buffer, ntodo, scale, zero, nulcheck, 
                       (short) tnull, nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TLONG):
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) buffer,
                       status);
                fffi4i1((INT32BIT *) buffer, ntodo, scale, zero, nulcheck, 
                       (INT32BIT) tnull, nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TLONGLONG):
                ffgi8b(fptr, readptr, ntodo, incre, (long *) buffer, status);
                fffi8i1( (LONGLONG *) buffer, ntodo, scale, zero, 
                           nulcheck, tnull, nulval, &nularray[next], 
                            anynul, &array[next], status);
                break;
            case (TFLOAT):
                ffgr4b(fptr, readptr, ntodo, incre, (float  *) buffer, status);
                fffr4i1((float  *) buffer, ntodo, scale, zero, nulcheck, 
                       nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TDOUBLE):
                ffgr8b(fptr, readptr, ntodo, incre, (double *) buffer, status);
                fffr8i1((double *) buffer, ntodo, scale, zero, nulcheck, 
                          nulval, &nularray[next], anynul, 
                          &array[next], status);
                break;
            case (TSTRING):
                ffmbyt(fptr, readptr, REPORT_EOF, status);
       
                if (incre == twidth)    /* contiguous bytes */
                     ffgbyt(fptr, ntodo * twidth, buffer, status);
                else
                     ffgbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                               status);

                /* interpret the string as an ASCII formated number */
                fffstri1((char *) buffer, ntodo, scale, zero, twidth, power,
                      nulcheck, snull, nulval, &nularray[next], anynul,
                      &array[next], status);
                break;

            default:  /*  error trap for invalid column format */
                snprintf(message, FLEN_ERRMSG,
                   "Cannot read bytes from column %d which has format %s",
                    colnum, tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous read operation */
        {
	  dtemp = (double) next;
          if (hdutype > 0)
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from column %d (ffgclb).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from image (ffgclb).",
              dtemp+1., dtemp+ntodo);

         ffpmsg(message);
         return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum = elemnum + (ntodo * elemincre);

            if (elemnum >= repeat)  /* completed a row; start on later row */
            {
                rowincre = elemnum / repeat;
                rownum += rowincre;
                elemnum = elemnum - (rowincre * repeat);
            }
            else if (elemnum < 0)  /* completed a row; start on a previous row */
            {
                rowincre = (-elemnum - 1) / repeat + 1;
                rownum -= rowincre;
                elemnum = (rowincre * repeat) + elemnum;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while reading FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgextn( fitsfile *fptr,        /* I - FITS file pointer                        */
            LONGLONG  offset,      /* I - byte offset from start of extension data */
            LONGLONG  nelem,       /* I - number of elements to read               */
            void *buffer,          /* I - stream of bytes to read                  */
            int  *status)          /* IO - error status                            */
/*
  Read a stream of bytes from the current FITS HDU.  This primative routine is mainly
  for reading non-standard "conforming" extensions and should not be used
  for standard IMAGE, TABLE or BINTABLE extensions.
*/
{
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    /* rescan header if data structure is undefined */
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
        if ( ffrdef(fptr, status) > 0)               
            return(*status);

    /* move to write position */
    ffmbyt(fptr, (fptr->Fptr)->datastart+ offset, IGNORE_EOF, status);
    
    /* read the buffer */
    ffgbyt(fptr, nelem, buffer, status); 

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi1i1(unsigned char *input, /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
            unsigned char nullval,/* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            unsigned char *output,/* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {              /* this routine is normally not called in this case */
           memmove(output, input, ntodo );
        }
        else             /* must scale the data */
        {                
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UCHAR_MAX;
                }
                else
                    output[ii] = (unsigned char) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi2i1(short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            unsigned char nullval,/* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            unsigned char *output,/* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > UCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UCHAR_MAX;
                }
                else
                    output[ii] = (unsigned char) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UCHAR_MAX;
                }
                else
                    output[ii] = (unsigned char) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }

                else
                {
                    if (input[ii] < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > UCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi4i1(INT32BIT *input,          /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            unsigned char nullval,/* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            unsigned char *output,/* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > UCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UCHAR_MAX;
                }
                else
                    output[ii] = (unsigned char) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UCHAR_MAX;
                }
                else
                    output[ii] = (unsigned char) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > UCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi8i1(LONGLONG *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG tnull,       /* I - value of FITS TNULLn keyword if any */
            unsigned char nullval,/* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            unsigned char *output,/* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    ULONGLONG ulltemp;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                if (ulltemp > UCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UCHAR_MAX;
                }
                else
                    output[ii] = (unsigned char) ulltemp;
            }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > UCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UCHAR_MAX;
                }
                else
                    output[ii] = (unsigned char) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UCHAR_MAX;
                }
                else
                    output[ii] = (unsigned char) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                    if (ulltemp > UCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
		    {
                        output[ii] = (unsigned char) ulltemp;
		    }
                }
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > UCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr4i1(float *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char nullval,/* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            unsigned char *output,/* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DUCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > DUCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UCHAR_MAX;
                }
                else
                    output[ii] = (unsigned char) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UCHAR_MAX;
                }
                else
                    output[ii] = (unsigned char) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr++;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              /* use redundant boolean logic in following statement */
              /* to suppress irritating Borland compiler warning message */
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DUCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > DUCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  {
                    if (zero < DUCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (zero > DUCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr8i1(double *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char nullval,/* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            unsigned char *output,/* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DUCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > DUCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UCHAR_MAX;
                }
                else
                    output[ii] = (unsigned char) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UCHAR_MAX;
                }
                else
                    output[ii] = (unsigned char) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr += 3;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DUCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > DUCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  {
                    if (zero < DUCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (zero > DUCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UCHAR_MAX;
                    }
                    else
                        output[ii] = (unsigned char) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffstri1(char *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            long twidth,          /* I - width of each substring of chars    */
            double implipower,    /* I - power of 10 of implied decimal      */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            char  *snull,         /* I - value of FITS null string, if any   */
            unsigned char nullval, /* I - set null pixels, if nullcheck = 1  */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            unsigned char *output, /* O - array of converted pixels          */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file. Check
  for null values and do scaling if required. The nullcheck code value
  determines how any null values in the input array are treated. A null
  value is an input pixel that is equal to snull.  If nullcheck= 0, then
  no special checking for nulls is performed.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    int  nullen;
    long ii;
    double dvalue;
    char *cstring, message[FLEN_ERRMSG];
    char *cptr, *tpos;
    char tempstore, chrzero = '0';
    double val, power;
    int exponent, sign, esign, decpt;

    nullen = strlen(snull);
    cptr = input;  /* pointer to start of input string */
    for (ii = 0; ii < ntodo; ii++)
    {
      cstring = cptr;
      /* temporarily insert a null terminator at end of the string */
      tpos = cptr + twidth;
      tempstore = *tpos;
      *tpos = 0;

      /* check if null value is defined, and if the    */
      /* column string is identical to the null string */
      if (snull[0] != ASCII_NULL_UNDEFINED && 
         !strncmp(snull, cptr, nullen) )
      {
        if (nullcheck)  
        {
          *anynull = 1;    
          if (nullcheck == 1)
            output[ii] = nullval;
          else
            nullarray[ii] = 1;
        }
        cptr += twidth;
      }
      else
      {
        /* value is not the null value, so decode it */
        /* remove any embedded blank characters from the string */

        decpt = 0;
        sign = 1;
        val  = 0.;
        power = 1.;
        exponent = 0;
        esign = 1;

        while (*cptr == ' ')               /* skip leading blanks */
           cptr++;

        if (*cptr == '-' || *cptr == '+')  /* check for leading sign */
        {
          if (*cptr == '-')
             sign = -1;

          cptr++;

          while (*cptr == ' ')         /* skip blanks between sign and value */
            cptr++;
        }

        while (*cptr >= '0' && *cptr <= '9')
        {
          val = val * 10. + *cptr - chrzero;  /* accumulate the value */
          cptr++;

          while (*cptr == ' ')         /* skip embedded blanks in the value */
            cptr++;
        }

        if (*cptr == '.' || *cptr == ',')       /* check for decimal point */
        {
          decpt = 1;
          cptr++;
          while (*cptr == ' ')         /* skip any blanks */
            cptr++;

          while (*cptr >= '0' && *cptr <= '9')
          {
            val = val * 10. + *cptr - chrzero;  /* accumulate the value */
            power = power * 10.;
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks in the value */
              cptr++;
          }
        }

        if (*cptr == 'E' || *cptr == 'D')  /* check for exponent */
        {
          cptr++;
          while (*cptr == ' ')         /* skip blanks */
              cptr++;
  
          if (*cptr == '-' || *cptr == '+')  /* check for exponent sign */
          {
            if (*cptr == '-')
               esign = -1;

            cptr++;

            while (*cptr == ' ')        /* skip blanks between sign and exp */
              cptr++;
          }

          while (*cptr >= '0' && *cptr <= '9')
          {
            exponent = exponent * 10 + *cptr - chrzero;  /* accumulate exp */
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks */
              cptr++;
          }
        }

        if (*cptr  != 0)  /* should end up at the null terminator */
        {
          snprintf(message, FLEN_ERRMSG,"Cannot read number from ASCII table");
          ffpmsg(message);
          snprintf(message, FLEN_ERRMSG,"Column field = %s.", cstring);
          ffpmsg(message);
          /* restore the char that was overwritten by the null */
          *tpos = tempstore;
          return(*status = BAD_C2D);
        }

        if (!decpt)  /* if no explicit decimal, use implied */
           power = implipower;

        dvalue = (sign * val / power) * pow(10., (double) (esign * exponent));

        dvalue = dvalue * scale + zero;   /* apply the scaling */

        if (dvalue < DUCHAR_MIN)
        {
            *status = OVERFLOW_ERR;
            output[ii] = 0;
        }
        else if (dvalue > DUCHAR_MAX)
        {
            *status = OVERFLOW_ERR;
            output[ii] = UCHAR_MAX;
        }
        else
            output[ii] = (unsigned char) dvalue;
      }
      /* restore the char that was overwritten by the null */
      *tpos = tempstore;
    }
    return(*status);
}
cfitsio-3.47/getcol.c0000644000225700000360000012110613464573432014032 0ustar  cagordonlhea
/*  This file, getcol.c, contains routines that read data elements from    */
/*  a FITS image or table.  There are generic datatype routines.           */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffgpxv( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  datatype,    /* I - datatype of the value                   */
            long *firstpix,   /* I - coord of first pixel to read (1s based) */
            LONGLONG nelem,   /* I - number of values to read                */
            void *nulval,     /* I - value for undefined pixels              */
            void *array,      /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. The datatype of the
  input array is defined by the 2nd argument.  Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    LONGLONG tfirstpix[99];
    int naxis, ii;

    if (*status > 0 || nelem == 0)   /* inherit input status value if > 0 */
        return(*status);

    /* get the size of the image */
    ffgidm(fptr, &naxis, status);
    
    for (ii=0; ii < naxis; ii++)
       tfirstpix[ii] = firstpix[ii];

    ffgpxvll(fptr, datatype, tfirstpix, nelem, nulval, array, anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpxvll( fitsfile *fptr, /* I - FITS file pointer                       */
            int  datatype,    /* I - datatype of the value                   */
            LONGLONG *firstpix, /* I - coord of first pixel to read (1s based) */
            LONGLONG nelem,   /* I - number of values to read                */
            void *nulval,     /* I - value for undefined pixels              */
            void *array,      /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. The datatype of the
  input array is defined by the 2nd argument.  Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    int naxis, ii;
    char cdummy;
    int nullcheck = 1;
    LONGLONG naxes[9], trc[9]= {1,1,1,1,1,1,1,1,1};
    long inc[9]= {1,1,1,1,1,1,1,1,1};
    LONGLONG dimsize = 1, firstelem;

    if (*status > 0 || nelem == 0)   /* inherit input status value if > 0 */
        return(*status);

    /* get the size of the image */
    ffgidm(fptr, &naxis, status);

    ffgiszll(fptr, 9, naxes, status);

    if (naxis == 0 || naxes[0] == 0) {
       *status = BAD_DIMEN;
       return(*status);
    }

    /* calculate the position of the first element in the array */
    firstelem = 0;
    for (ii=0; ii < naxis; ii++)
    {
        firstelem += ((firstpix[ii] - 1) * dimsize);
        dimsize *= naxes[ii];
        trc[ii] = firstpix[ii];
    }
    firstelem++;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        /* test for special case of reading an integral number of */
        /* rows in a 2D or 3D image (which includes reading the whole image */

	if (naxis > 1 && naxis < 4 && firstpix[0] == 1 &&
            (nelem / naxes[0]) * naxes[0] == nelem) {

                /* calculate coordinate of last pixel */
		trc[0] = naxes[0];  /* reading whole rows */
		trc[1] = firstpix[1] + (nelem / naxes[0] - 1);
                while (trc[1] > naxes[1])  {
		    trc[1] = trc[1] - naxes[1];
		    trc[2] = trc[2] + 1;  /* increment to next plane of cube */
                }

                fits_read_compressed_img(fptr, datatype, firstpix, trc, inc,
                   1, nulval, array, NULL, anynul, status);

        } else {

                fits_read_compressed_pixels(fptr, datatype, firstelem,
                   nelem, nullcheck, nulval, array, NULL, anynul, status);
        }

        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (datatype == TBYTE)
    {
      if (nulval == 0)
        ffgclb(fptr, 2, 1, firstelem, nelem, 1, 1, 0,
               (unsigned char *) array, &cdummy, anynul, status);
      else
        ffgclb(fptr, 2, 1, firstelem, nelem, 1, 1, *(unsigned char *) nulval,
               (unsigned char *) array, &cdummy, anynul, status);
    }
    else if (datatype == TSBYTE)
    {
      if (nulval == 0)
        ffgclsb(fptr, 2, 1, firstelem, nelem, 1, 1, 0,
               (signed char *) array, &cdummy, anynul, status);
      else
        ffgclsb(fptr, 2, 1, firstelem, nelem, 1, 1, *(signed char *) nulval,
               (signed char *) array, &cdummy, anynul, status);
    }
    else if (datatype == TUSHORT)
    {
      if (nulval == 0)
        ffgclui(fptr, 2, 1, firstelem, nelem, 1, 1, 0,
               (unsigned short *) array, &cdummy, anynul, status);
      else
        ffgclui(fptr, 2, 1, firstelem, nelem, 1, 1, *(unsigned short *) nulval,
               (unsigned short *) array, &cdummy, anynul, status);
    }
    else if (datatype == TSHORT)
    {
      if (nulval == 0)
        ffgcli(fptr, 2, 1, firstelem, nelem, 1, 1, 0,
               (short *) array, &cdummy, anynul, status);
      else
        ffgcli(fptr, 2, 1, firstelem, nelem, 1, 1, *(short *) nulval,
               (short *) array, &cdummy, anynul, status);
    }
    else if (datatype == TUINT)
    {
      if (nulval == 0)
        ffgcluk(fptr, 2, 1, firstelem, nelem, 1, 1, 0,
               (unsigned int *) array, &cdummy, anynul, status);
      else
        ffgcluk(fptr, 2, 1, firstelem, nelem, 1, 1, *(unsigned int *) nulval,
               (unsigned int *) array, &cdummy, anynul, status);
    }
    else if (datatype == TINT)
    {
      if (nulval == 0)
        ffgclk(fptr, 2, 1, firstelem, nelem, 1, 1, 0,
               (int *) array, &cdummy, anynul, status);
      else
        ffgclk(fptr, 2, 1, firstelem, nelem, 1, 1, *(int *) nulval,
               (int *) array, &cdummy, anynul, status);
    }
    else if (datatype == TULONG)
    {
      if (nulval == 0)
        ffgcluj(fptr, 2, 1, firstelem, nelem, 1, 1, 0,
               (unsigned long *) array, &cdummy, anynul, status);
      else
        ffgcluj(fptr, 2, 1, firstelem, nelem, 1, 1, *(unsigned long *) nulval,
               (unsigned long *) array, &cdummy, anynul, status);
    }
    else if (datatype == TLONG)
    {
      if (nulval == 0)
        ffgclj(fptr, 2, 1, firstelem, nelem, 1, 1, 0,
               (long *) array, &cdummy, anynul, status);
      else
        ffgclj(fptr, 2, 1, firstelem, nelem, 1, 1, *(long *) nulval,
               (long *) array, &cdummy, anynul, status);
    }
    else if (datatype == TULONGLONG)
    {
      if (nulval == 0)
        ffgclujj(fptr, 2, 1, firstelem, nelem, 1, 1, 0,
               (ULONGLONG *) array, &cdummy, anynul, status);
      else
        ffgclujj(fptr, 2, 1, firstelem, nelem, 1, 1, *(ULONGLONG *) nulval,
               (ULONGLONG *) array, &cdummy, anynul, status);
    }
    else if (datatype == TLONGLONG)
    {
      if (nulval == 0)
        ffgcljj(fptr, 2, 1, firstelem, nelem, 1, 1, 0,
               (LONGLONG *) array, &cdummy, anynul, status);
      else
        ffgcljj(fptr, 2, 1, firstelem, nelem, 1, 1, *(LONGLONG *) nulval,
               (LONGLONG *) array, &cdummy, anynul, status);
    }
    else if (datatype == TFLOAT)
    {
      if (nulval == 0)
        ffgcle(fptr, 2, 1, firstelem, nelem, 1, 1, 0,
               (float *) array, &cdummy, anynul, status);
      else
        ffgcle(fptr, 2, 1, firstelem, nelem, 1, 1, *(float *) nulval,
               (float *) array, &cdummy, anynul, status);
    }
    else if (datatype == TDOUBLE)
    {
      if (nulval == 0)
        ffgcld(fptr, 2, 1, firstelem, nelem, 1, 1, 0,
               (double *) array, &cdummy, anynul, status);
      else
        ffgcld(fptr, 2, 1, firstelem, nelem, 1, 1, *(double *) nulval,
               (double *) array, &cdummy, anynul, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpxf( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  datatype,    /* I - datatype of the value                   */
            long *firstpix,   /* I - coord of first pixel to read (1s based) */
            LONGLONG nelem,       /* I - number of values to read            */
            void *array,      /* O - array of values that are returned       */
            char *nullarray,  /* O - returned array of null value flags      */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. The datatype of the
  input array is defined by the 2nd argument.  Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  The nullarray values will = 1 if the corresponding array value is null.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    LONGLONG tfirstpix[99];
    int naxis, ii;

    if (*status > 0 || nelem == 0)   /* inherit input status value if > 0 */
        return(*status);

    /* get the size of the image */
    ffgidm(fptr, &naxis, status);

    for (ii=0; ii < naxis; ii++)
       tfirstpix[ii] = firstpix[ii];

    ffgpxfll(fptr, datatype, tfirstpix, nelem, array, nullarray, anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpxfll( fitsfile *fptr, /* I - FITS file pointer                       */
            int  datatype,    /* I - datatype of the value                   */
            LONGLONG *firstpix, /* I - coord of first pixel to read (1s based) */
            LONGLONG nelem,       /* I - number of values to read              */
            void *array,      /* O - array of values that are returned       */
            char *nullarray,  /* O - returned array of null value flags      */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. The datatype of the
  input array is defined by the 2nd argument.  Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  The nullarray values will = 1 if the corresponding array value is null.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    int naxis, ii;
    int nullcheck = 2;
    LONGLONG naxes[9];
    LONGLONG dimsize = 1, firstelem;

    if (*status > 0 || nelem == 0)   /* inherit input status value if > 0 */
        return(*status);

    /* get the size of the image */
    ffgidm(fptr, &naxis, status);
    ffgiszll(fptr, 9, naxes, status);

    /* calculate the position of the first element in the array */
    firstelem = 0;
    for (ii=0; ii < naxis; ii++)
    {
        firstelem += ((firstpix[ii] - 1) * dimsize);
        dimsize *= naxes[ii];
    }
    firstelem++;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, datatype, firstelem, nelem,
            nullcheck, NULL, array, nullarray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (datatype == TBYTE)
    {
        ffgclb(fptr, 2, 1, firstelem, nelem, 1, 2, 0,
               (unsigned char *) array, nullarray, anynul, status);
    }
    else if (datatype == TSBYTE)
    {
        ffgclsb(fptr, 2, 1, firstelem, nelem, 1, 2, 0,
               (signed char *) array, nullarray, anynul, status);
    }
    else if (datatype == TUSHORT)
    {
        ffgclui(fptr, 2, 1, firstelem, nelem, 1, 2, 0,
               (unsigned short *) array, nullarray, anynul, status);
    }
    else if (datatype == TSHORT)
    {
        ffgcli(fptr, 2, 1, firstelem, nelem, 1, 2, 0,
               (short *) array, nullarray, anynul, status);
    }
    else if (datatype == TUINT)
    {
        ffgcluk(fptr, 2, 1, firstelem, nelem, 1, 2, 0,
               (unsigned int *) array, nullarray, anynul, status);
    }
    else if (datatype == TINT)
    {
        ffgclk(fptr, 2, 1, firstelem, nelem, 1, 2, 0,
               (int *) array, nullarray, anynul, status);
    }
    else if (datatype == TULONG)
    {
        ffgcluj(fptr, 2, 1, firstelem, nelem, 1, 2, 0,
               (unsigned long *) array, nullarray, anynul, status);
    }
    else if (datatype == TLONG)
    {
        ffgclj(fptr, 2, 1, firstelem, nelem, 1, 2, 0,
               (long *) array, nullarray, anynul, status);
    }
    else if (datatype == TULONGLONG)
    {
        ffgclujj(fptr, 2, 1, firstelem, nelem, 1, 2, 0,
               (ULONGLONG *) array, nullarray, anynul, status);
    }
    else if (datatype == TLONGLONG)
    {
        ffgcljj(fptr, 2, 1, firstelem, nelem, 1, 2, 0,
               (LONGLONG *) array, nullarray, anynul, status);
    }
    else if (datatype == TFLOAT)
    {
        ffgcle(fptr, 2, 1, firstelem, nelem, 1, 2, 0,
               (float *) array, nullarray, anynul, status);
    }
    else if (datatype == TDOUBLE)
    {
        ffgcld(fptr, 2, 1, firstelem, nelem, 1, 2, 0,
               (double *) array, nullarray, anynul, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsv(  fitsfile *fptr,   /* I - FITS file pointer                       */
            int  datatype,    /* I - datatype of the value                   */
            long *blc,        /* I - 'bottom left corner' of the subsection  */
            long *trc ,       /* I - 'top right corner' of the subsection    */
            long *inc,        /* I - increment to be applied in each dim.    */
            void *nulval,     /* I - value for undefined pixels              */
            void *array,      /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an section of values from the primary array. The datatype of the
  input array is defined by the 2nd argument.  Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    int naxis, ii;
    long naxes[9];
    LONGLONG nelem = 1;

    if (*status > 0)   /* inherit input status value if > 0 */
        return(*status);

    /* get the size of the image */
    ffgidm(fptr, &naxis, status);
    ffgisz(fptr, 9, naxes, status);

    /* test for the important special case where we are reading the whole image */
    /* this is only useful for images that are not tile-compressed */
    if (!fits_is_compressed_image(fptr, status)) {
        for (ii = 0; ii < naxis; ii++) {
            if (inc[ii] != 1 || blc[ii] !=1 || trc[ii] != naxes[ii])
                break;

            nelem = nelem * naxes[ii];
        }

        if (ii == naxis) {
            /* read the whole image more efficiently */
            ffgpxv(fptr, datatype, blc, nelem, nulval, array, anynul, status);
            return(*status);
        }
    }

    if (datatype == TBYTE)
    {
      if (nulval == 0)
        ffgsvb(fptr, 1, naxis, naxes, blc, trc, inc, 0,
               (unsigned char *) array, anynul, status);
      else
        ffgsvb(fptr, 1, naxis, naxes, blc, trc, inc, *(unsigned char *) nulval,
               (unsigned char *) array, anynul, status);
    }
    else if (datatype == TSBYTE)
    {
      if (nulval == 0)
        ffgsvsb(fptr, 1, naxis, naxes, blc, trc, inc, 0,
               (signed char *) array, anynul, status);
      else
        ffgsvsb(fptr, 1, naxis, naxes, blc, trc, inc, *(signed char *) nulval,
               (signed char *) array, anynul, status);
    }
    else if (datatype == TUSHORT)
    {
      if (nulval == 0)
        ffgsvui(fptr, 1, naxis, naxes, blc, trc, inc, 0,
               (unsigned short *) array, anynul, status);
      else
        ffgsvui(fptr, 1, naxis, naxes,blc, trc, inc, *(unsigned short *) nulval,
               (unsigned short *) array, anynul, status);
    }
    else if (datatype == TSHORT)
    {
      if (nulval == 0)
        ffgsvi(fptr, 1, naxis, naxes, blc, trc, inc, 0,
               (short *) array, anynul, status);
      else
        ffgsvi(fptr, 1, naxis, naxes, blc, trc, inc, *(short *) nulval,
               (short *) array, anynul, status);
    }
    else if (datatype == TUINT)
    {
      if (nulval == 0)
        ffgsvuk(fptr, 1, naxis, naxes, blc, trc, inc, 0,
               (unsigned int *) array, anynul, status);
      else
        ffgsvuk(fptr, 1, naxis, naxes, blc, trc, inc, *(unsigned int *) nulval,
               (unsigned int *) array, anynul, status);
    }
    else if (datatype == TINT)
    {
      if (nulval == 0)
        ffgsvk(fptr, 1, naxis, naxes, blc, trc, inc, 0,
               (int *) array, anynul, status);
      else
        ffgsvk(fptr, 1, naxis, naxes, blc, trc, inc, *(int *) nulval,
               (int *) array, anynul, status);
    }
    else if (datatype == TULONG)
    {
      if (nulval == 0)
        ffgsvuj(fptr, 1, naxis, naxes, blc, trc, inc, 0,
               (unsigned long *) array, anynul, status);
      else
        ffgsvuj(fptr, 1, naxis, naxes, blc, trc, inc, *(unsigned long *) nulval,
               (unsigned long *) array, anynul, status);
    }
    else if (datatype == TLONG)
    {
      if (nulval == 0)
        ffgsvj(fptr, 1, naxis, naxes, blc, trc, inc, 0,
               (long *) array, anynul, status);
      else
        ffgsvj(fptr, 1, naxis, naxes, blc, trc, inc, *(long *) nulval,
               (long *) array, anynul, status);
    }
    else if (datatype == TULONGLONG)
    {
      if (nulval == 0)
        ffgsvujj(fptr, 1, naxis, naxes, blc, trc, inc, 0,
               (ULONGLONG *) array, anynul, status);
      else
        ffgsvujj(fptr, 1, naxis, naxes, blc, trc, inc, *(ULONGLONG *) nulval,
               (ULONGLONG *) array, anynul, status);
    }
    else if (datatype == TLONGLONG)
    {
      if (nulval == 0)
        ffgsvjj(fptr, 1, naxis, naxes, blc, trc, inc, 0,
               (LONGLONG *) array, anynul, status);
      else
        ffgsvjj(fptr, 1, naxis, naxes, blc, trc, inc, *(LONGLONG *) nulval,
               (LONGLONG *) array, anynul, status);
    }
    else if (datatype == TFLOAT)
    {
      if (nulval == 0)
        ffgsve(fptr, 1, naxis, naxes, blc, trc, inc, 0,
               (float *) array, anynul, status);
      else
        ffgsve(fptr, 1, naxis, naxes, blc, trc, inc, *(float *) nulval,
               (float *) array, anynul, status);
    }
    else if (datatype == TDOUBLE)
    {
      if (nulval == 0)
        ffgsvd(fptr, 1, naxis, naxes, blc, trc, inc, 0,
               (double *) array, anynul, status);
      else
        ffgsvd(fptr, 1, naxis, naxes, blc, trc, inc, *(double *) nulval,
               (double *) array, anynul, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpv(  fitsfile *fptr,   /* I - FITS file pointer                       */
            int  datatype,    /* I - datatype of the value                   */
            LONGLONG firstelem,   /* I - first vector element to read (1 = 1st)  */
            LONGLONG nelem,       /* I - number of values to read                */
            void *nulval,     /* I - value for undefined pixels              */
            void *array,      /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. The datatype of the
  input array is defined by the 2nd argument.  Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{

    if (*status > 0 || nelem == 0)   /* inherit input status value if > 0 */
        return(*status);

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (datatype == TBYTE)
    {
      if (nulval == 0)
        ffgpvb(fptr, 1, firstelem, nelem, 0,
               (unsigned char *) array, anynul, status);
      else
        ffgpvb(fptr, 1, firstelem, nelem, *(unsigned char *) nulval,
               (unsigned char *) array, anynul, status);
    }
    else if (datatype == TSBYTE)
    {
      if (nulval == 0)
        ffgpvsb(fptr, 1, firstelem, nelem, 0,
               (signed char *) array, anynul, status);
      else
        ffgpvsb(fptr, 1, firstelem, nelem, *(signed char *) nulval,
               (signed char *) array, anynul, status);
    }
    else if (datatype == TUSHORT)
    {
      if (nulval == 0)
        ffgpvui(fptr, 1, firstelem, nelem, 0,
               (unsigned short *) array, anynul, status);
      else
        ffgpvui(fptr, 1, firstelem, nelem, *(unsigned short *) nulval,
               (unsigned short *) array, anynul, status);
    }
    else if (datatype == TSHORT)
    {
      if (nulval == 0)
        ffgpvi(fptr, 1, firstelem, nelem, 0,
               (short *) array, anynul, status);
      else
        ffgpvi(fptr, 1, firstelem, nelem, *(short *) nulval,
               (short *) array, anynul, status);
    }
    else if (datatype == TUINT)
    {
      if (nulval == 0)
        ffgpvuk(fptr, 1, firstelem, nelem, 0,
               (unsigned int *) array, anynul, status);
      else
        ffgpvuk(fptr, 1, firstelem, nelem, *(unsigned int *) nulval,
               (unsigned int *) array, anynul, status);
    }
    else if (datatype == TINT)
    {
      if (nulval == 0)
        ffgpvk(fptr, 1, firstelem, nelem, 0,
               (int *) array, anynul, status);
      else
        ffgpvk(fptr, 1, firstelem, nelem, *(int *) nulval,
               (int *) array, anynul, status);
    }
    else if (datatype == TULONG)
    {
      if (nulval == 0)
        ffgpvuj(fptr, 1, firstelem, nelem, 0,
               (unsigned long *) array, anynul, status);
      else
        ffgpvuj(fptr, 1, firstelem, nelem, *(unsigned long *) nulval,
               (unsigned long *) array, anynul, status);
    }
    else if (datatype == TLONG)
    {
      if (nulval == 0)
        ffgpvj(fptr, 1, firstelem, nelem, 0,
               (long *) array, anynul, status);
      else
        ffgpvj(fptr, 1, firstelem, nelem, *(long *) nulval,
               (long *) array, anynul, status);
    }
    else if (datatype == TULONGLONG)
    {
      if (nulval == 0)
        ffgpvujj(fptr, 1, firstelem, nelem, 0,
               (ULONGLONG *) array, anynul, status);
      else
        ffgpvujj(fptr, 1, firstelem, nelem, *(ULONGLONG *) nulval,
               (ULONGLONG *) array, anynul, status);
    }
    else if (datatype == TLONGLONG)
    {
      if (nulval == 0)
        ffgpvjj(fptr, 1, firstelem, nelem, 0,
               (LONGLONG *) array, anynul, status);
      else
        ffgpvjj(fptr, 1, firstelem, nelem, *(LONGLONG *) nulval,
               (LONGLONG *) array, anynul, status);
    }
    else if (datatype == TFLOAT)
    {
      if (nulval == 0)
        ffgpve(fptr, 1, firstelem, nelem, 0,
               (float *) array, anynul, status);
      else
        ffgpve(fptr, 1, firstelem, nelem, *(float *) nulval,
               (float *) array, anynul, status);
    }
    else if (datatype == TDOUBLE)
    {
      if (nulval == 0)
        ffgpvd(fptr, 1, firstelem, nelem, 0,
               (double *) array, anynul, status);
      else
      {
        ffgpvd(fptr, 1, firstelem, nelem, *(double *) nulval,
               (double *) array, anynul, status);
      }
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpf(  fitsfile *fptr,   /* I - FITS file pointer                       */
            int  datatype,    /* I - datatype of the value                   */
            LONGLONG firstelem,   /* I - first vector element to read (1 = 1st)  */
            LONGLONG nelem,       /* I - number of values to read                */
            void *array,      /* O - array of values that are returned       */
            char *nullarray,  /* O - array of null value flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. The datatype of the
  input array is defined by the 2nd argument.  Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  The nullarray values will = 1 if the corresponding array value is null.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{

    if (*status > 0 || nelem == 0)   /* inherit input status value if > 0 */
        return(*status);

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (datatype == TBYTE)
    {
        ffgpfb(fptr, 1, firstelem, nelem, 
               (unsigned char *) array, nullarray, anynul, status);
    }
    else if (datatype == TSBYTE)
    {
        ffgpfsb(fptr, 1, firstelem, nelem, 
               (signed char *) array, nullarray, anynul, status);
    }
    else if (datatype == TUSHORT)
    {
        ffgpfui(fptr, 1, firstelem, nelem, 
               (unsigned short *) array, nullarray, anynul, status);
    }
    else if (datatype == TSHORT)
    {
        ffgpfi(fptr, 1, firstelem, nelem, 
               (short *) array, nullarray, anynul, status);
    }
    else if (datatype == TUINT)
    {
        ffgpfuk(fptr, 1, firstelem, nelem, 
               (unsigned int *) array, nullarray, anynul, status);
    }
    else if (datatype == TINT)
    {
        ffgpfk(fptr, 1, firstelem, nelem, 
               (int *) array, nullarray, anynul, status);
    }
    else if (datatype == TULONG)
    {
        ffgpfuj(fptr, 1, firstelem, nelem, 
               (unsigned long *) array, nullarray, anynul, status);
    }
    else if (datatype == TLONG)
    {
        ffgpfj(fptr, 1, firstelem, nelem,
               (long *) array, nullarray, anynul, status);
    }
    else if (datatype == TULONGLONG)
    {
        ffgpfujj(fptr, 1, firstelem, nelem,
               (ULONGLONG *) array, nullarray, anynul, status);
    }
    else if (datatype == TLONGLONG)
    {
        ffgpfjj(fptr, 1, firstelem, nelem,
               (LONGLONG *) array, nullarray, anynul, status);
    }
    else if (datatype == TFLOAT)
    {
        ffgpfe(fptr, 1, firstelem, nelem, 
               (float *) array, nullarray, anynul, status);
    }
    else if (datatype == TDOUBLE)
    {
        ffgpfd(fptr, 1, firstelem, nelem,
               (double *) array, nullarray, anynul, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcv(  fitsfile *fptr,   /* I - FITS file pointer                       */
            int  datatype,    /* I - datatype of the value                   */
            int  colnum,      /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,   /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG nelem,       /* I - number of values to read                */
            void *nulval,     /* I - value for undefined pixels              */
            void *array,      /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a table column. The datatype of the
  input array is defined by the 2nd argument.  Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of true if any pixels are undefined.
*/
{
    char cdummy[2];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (datatype == TBIT)
    {
      ffgcx(fptr, colnum, firstrow, firstelem, nelem, (char *) array, status);
    }
    else if (datatype == TBYTE)
    {
      if (nulval == 0)
        ffgclb(fptr, colnum, firstrow, firstelem, nelem, 1, 1, 0,
              (unsigned char *) array, cdummy, anynul, status);
      else
       ffgclb(fptr, colnum, firstrow, firstelem, nelem, 1, 1, *(unsigned char *)
              nulval, (unsigned char *) array, cdummy, anynul, status);
    }
    else if (datatype == TSBYTE)
    {
      if (nulval == 0)
        ffgclsb(fptr, colnum, firstrow, firstelem, nelem, 1, 1, 0,
              (signed char *) array, cdummy, anynul, status);
      else
       ffgclsb(fptr, colnum, firstrow, firstelem, nelem, 1, 1, *(signed char *)
              nulval, (signed char *) array, cdummy, anynul, status);
    }
    else if (datatype == TUSHORT)
    {
      if (nulval == 0)
        ffgclui(fptr, colnum, firstrow, firstelem, nelem, 1, 1, 0,
               (unsigned short *) array, cdummy, anynul, status);
      else
        ffgclui(fptr, colnum, firstrow, firstelem, nelem, 1, 1,
               *(unsigned short *) nulval,
               (unsigned short *) array, cdummy, anynul, status);
    }
    else if (datatype == TSHORT)
    {
      if (nulval == 0)
        ffgcli(fptr, colnum, firstrow, firstelem, nelem, 1, 1, 0,
              (short *) array, cdummy, anynul, status);
      else
        ffgcli(fptr, colnum, firstrow, firstelem, nelem, 1, 1, *(short *)
              nulval, (short *) array, cdummy, anynul, status);
    }
    else if (datatype == TUINT)
    {
      if (nulval == 0)
        ffgcluk(fptr, colnum, firstrow, firstelem, nelem, 1, 1, 0,
              (unsigned int *) array, cdummy, anynul, status);
      else
        ffgcluk(fptr, colnum, firstrow, firstelem, nelem, 1, 1,
         *(unsigned int *) nulval, (unsigned int *) array, cdummy, anynul,
         status);
    }
    else if (datatype == TINT)
    {
      if (nulval == 0)
        ffgclk(fptr, colnum, firstrow, firstelem, nelem, 1, 1, 0,
              (int *) array, cdummy, anynul, status);
      else
        ffgclk(fptr, colnum, firstrow, firstelem, nelem, 1, 1, *(int *)
            nulval, (int *) array, cdummy, anynul, status);
    }
    else if (datatype == TULONG)
    {
      if (nulval == 0)
        ffgcluj(fptr, colnum, firstrow, firstelem, nelem, 1, 1, 0,
               (unsigned long *) array, cdummy, anynul, status);
      else
        ffgcluj(fptr, colnum, firstrow, firstelem, nelem, 1, 1,
               *(unsigned long *) nulval, 
               (unsigned long *) array, cdummy, anynul, status);
    }
    else if (datatype == TLONG)
    {
      if (nulval == 0)
        ffgclj(fptr, colnum, firstrow, firstelem, nelem, 1, 1, 0,
              (long *) array, cdummy, anynul, status);
      else
        ffgclj(fptr, colnum, firstrow, firstelem, nelem, 1, 1, *(long *)
              nulval, (long *) array, cdummy, anynul, status);
    }
    else if (datatype == TULONGLONG)
    {
      if (nulval == 0)
        ffgclujj(fptr, colnum, firstrow, firstelem, nelem, 1, 1, 0,
              (ULONGLONG *) array, cdummy, anynul, status);
      else
        ffgclujj(fptr, colnum, firstrow, firstelem, nelem, 1, 1, *(ULONGLONG *)
              nulval, (ULONGLONG *) array, cdummy, anynul, status);
    }
    else if (datatype == TLONGLONG)
    {
      if (nulval == 0)
        ffgcljj(fptr, colnum, firstrow, firstelem, nelem, 1, 1, 0,
              (LONGLONG *) array, cdummy, anynul, status);
      else
        ffgcljj(fptr, colnum, firstrow, firstelem, nelem, 1, 1, *(LONGLONG *)
              nulval, (LONGLONG *) array, cdummy, anynul, status);
    }
    else if (datatype == TFLOAT)
    {
      if (nulval == 0)
        ffgcle(fptr, colnum, firstrow, firstelem, nelem, 1, 1, 0.,
              (float *) array, cdummy, anynul, status);
      else
      ffgcle(fptr, colnum, firstrow, firstelem, nelem, 1, 1, *(float *)
               nulval,(float *) array, cdummy, anynul, status);
    }
    else if (datatype == TDOUBLE)
    {
      if (nulval == 0)
        ffgcld(fptr, colnum, firstrow, firstelem, nelem, 1, 1, 0.,
              (double *) array, cdummy, anynul, status);
      else
        ffgcld(fptr, colnum, firstrow, firstelem, nelem, 1, 1, *(double *)
              nulval, (double *) array, cdummy, anynul, status);
    }
    else if (datatype == TCOMPLEX)
    {
      if (nulval == 0)
        ffgcle(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2,
           1, 1, 0., (float *) array, cdummy, anynul, status);
      else
        ffgcle(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2,
           1, 1, *(float *) nulval, (float *) array, cdummy, anynul, status);
    }
    else if (datatype == TDBLCOMPLEX)
    {
      if (nulval == 0)
        ffgcld(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2, 
         1, 1, 0., (double *) array, cdummy, anynul, status);
      else
        ffgcld(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2, 
         1, 1, *(double *) nulval, (double *) array, cdummy, anynul, status);
    }

    else if (datatype == TLOGICAL)
    {
      if (nulval == 0)
        ffgcll(fptr, colnum, firstrow, firstelem, nelem, 1, 0,
          (char *) array, cdummy, anynul, status);
      else
        ffgcll(fptr, colnum, firstrow, firstelem, nelem, 1, *(char *) nulval,
          (char *) array, cdummy, anynul, status);
    }
    else if (datatype == TSTRING)
    {
      if (nulval == 0)
      {
        cdummy[0] = '\0';
        ffgcls(fptr, colnum, firstrow, firstelem, nelem, 1, 
             cdummy, (char **) array, cdummy, anynul, status);
      }
      else
        ffgcls(fptr, colnum, firstrow, firstelem, nelem, 1, (char *)
             nulval, (char **) array, cdummy, anynul, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcf(  fitsfile *fptr,   /* I - FITS file pointer                       */
            int  datatype,    /* I - datatype of the value                   */
            int  colnum,      /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,   /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG nelem,       /* I - number of values to read                */
            void *array,      /* O - array of values that are returned       */
            char *nullarray,  /* O - array of null value flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a table column. The datatype of the
  input array is defined by the 2nd argument.  Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  ANYNUL is returned with a value of true if any pixels are undefined.
*/
{
    double nulval = 0.;
    char cnulval[2];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (datatype == TBIT)
    {
      ffgcx(fptr, colnum, firstrow, firstelem, nelem, (char *) array, status);
    }
    else if (datatype == TBYTE)
    {
       ffgclb(fptr, colnum, firstrow, firstelem, nelem, 1, 2, (unsigned char )
              nulval, (unsigned char *) array, nullarray, anynul, status);
    }
    else if (datatype == TSBYTE)
    {
       ffgclsb(fptr, colnum, firstrow, firstelem, nelem, 1, 2, (signed char )
              nulval, (signed char *) array, nullarray, anynul, status);
    }
    else if (datatype == TUSHORT)
    {
        ffgclui(fptr, colnum, firstrow, firstelem, nelem, 1, 2,
               (unsigned short ) nulval,
               (unsigned short *) array, nullarray, anynul, status);
    }
    else if (datatype == TSHORT)
    {
        ffgcli(fptr, colnum, firstrow, firstelem, nelem, 1, 2, (short )
              nulval, (short *) array, nullarray, anynul, status);
    }
    else if (datatype == TUINT)
    {
        ffgcluk(fptr, colnum, firstrow, firstelem, nelem, 1, 2,
         (unsigned int ) nulval, (unsigned int *) array, nullarray, anynul,
         status);
    }
    else if (datatype == TINT)
    {
        ffgclk(fptr, colnum, firstrow, firstelem, nelem, 1, 2, (int )
            nulval, (int *) array, nullarray, anynul, status);
    }
    else if (datatype == TULONG)
    {
        ffgcluj(fptr, colnum, firstrow, firstelem, nelem, 1, 2,
               (unsigned long ) nulval, 
               (unsigned long *) array, nullarray, anynul, status);
    }
    else if (datatype == TLONG)
    {
        ffgclj(fptr, colnum, firstrow, firstelem, nelem, 1, 2, (long )
              nulval, (long *) array, nullarray, anynul, status);
    }
    else if (datatype == TULONGLONG)
    {
        ffgclujj(fptr, colnum, firstrow, firstelem, nelem, 1, 2, (ULONGLONG )
              nulval, (ULONGLONG *) array, nullarray, anynul, status);
    }
    else if (datatype == TLONGLONG)
    {
        ffgcljj(fptr, colnum, firstrow, firstelem, nelem, 1, 2, (LONGLONG )
              nulval, (LONGLONG *) array, nullarray, anynul, status);
    }
    else if (datatype == TFLOAT)
    {
      ffgcle(fptr, colnum, firstrow, firstelem, nelem, 1, 2, (float )
               nulval,(float *) array, nullarray, anynul, status);
    }
    else if (datatype == TDOUBLE)
    {
        ffgcld(fptr, colnum, firstrow, firstelem, nelem, 1, 2, 
              nulval, (double *) array, nullarray, anynul, status);
    }
    else if (datatype == TCOMPLEX)
    {
        ffgcfc(fptr, colnum, firstrow, firstelem, nelem,
           (float *) array, nullarray, anynul, status);
    }
    else if (datatype == TDBLCOMPLEX)
    {
        ffgcfm(fptr, colnum, firstrow, firstelem, nelem, 
           (double *) array, nullarray, anynul, status);
    }

    else if (datatype == TLOGICAL)
    {
        ffgcll(fptr, colnum, firstrow, firstelem, nelem, 2, (char ) nulval,
          (char *) array, nullarray, anynul, status);
    }
    else if (datatype == TSTRING)
    {
        ffgcls(fptr, colnum, firstrow, firstelem, nelem, 2, 
             cnulval, (char **) array, nullarray, anynul, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}

cfitsio-3.47/getcold.c0000644000225700000360000020633613464573432014207 0ustar  cagordonlhea/*  This file, getcold.c, contains routines that read data elements from   */
/*  a FITS image or table, with double datatype.                           */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffgpvd( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            double nulval,    /* I - value for undefined pixels              */
            double *array,    /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    char cdummy;
    int nullcheck = 1;
    double nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
         nullvalue = nulval;  /* set local variable */

        fits_read_compressed_pixels(fptr, TDOUBLE, firstelem, nelem,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcld(fptr, 2, row, firstelem, nelem, 1, 1, nulval,
               array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpfd( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            double *array,    /* O - array of values that are returned       */
            char *nularray,   /* O - array of null pixel flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Any undefined pixels in the returned array will be set = 0 and the 
  corresponding nularray value will be set = 1.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    int nullcheck = 2;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, TDOUBLE, firstelem, nelem,
            nullcheck, NULL, array, nularray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcld(fptr, 2, row, firstelem, nelem, 1, 2, 0.,
               array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg2dd(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           double nulval,   /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           double *array,   /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    /* call the 3D reading routine, with the 3rd dimension = 1 */

    ffg3dd(fptr, group, nulval, ncols, naxis2, naxis1, naxis2, 1, array, 
           anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg3dd(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           double nulval,   /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  nrows,     /* I - number of rows in each plane of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  naxis3,    /* I - FITS image NAXIS3 value                 */
           double *array,   /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 3-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    LONGLONG nfits, narray;
    long tablerow, ii, jj;
    char cdummy;
    int nullcheck = 1;
    long inc[] = {1,1,1};
    LONGLONG fpixel[] = {1,1,1};
    LONGLONG lpixel[3];
    double nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        lpixel[0] =  (long) ncols;
        lpixel[1] = (long) nrows;
        lpixel[2] = (long) naxis3;
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TDOUBLE, fpixel, lpixel, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
       /* all the image pixels are contiguous, so read all at once */
       ffgcld(fptr, 2, tablerow, 1, naxis1 * naxis2 * naxis3, 1, 1, nulval,
               array, &cdummy, anynul, status);
       return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to read */
    narray = 0;  /* next pixel in output array to be filled */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* reading naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffgcld(fptr, 2, tablerow, nfits, naxis1, 1, 1, nulval,
          &array[narray], &cdummy, anynul, status) > 0)
          return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsvd(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           double nulval,  /* I - value to set undefined pixels             */
           double *array,  /* O - array to be filled and returned           */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dir[9];
    long nelem, nultyp, ninc, numcol;
    LONGLONG felem, dsize[10], blcll[9], trcll[9];
    int hdutype, anyf;
    char ldummy, msg[FLEN_ERRMSG];
    int nullcheck = 1;
    double nullvalue;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvd is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TDOUBLE, blcll, trcll, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 1;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
        dir[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        if (hdutype == IMAGE_HDU)
        {
           dir[ii] = -1;
        }
        else
        {
          snprintf(msg, FLEN_ERRMSG,"ffgsvd: illegal range specified for axis %ld", ii + 1);
          ffpmsg(msg);
          return(*status = BAD_PIX_NUM);
        }
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
      dsize[ii] = dsize[ii] * dir[ii];
    }
    dsize[naxis] = dsize[naxis] * dir[naxis];

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0]*dir[0] - str[0]*dir[0]) / inc[0] + 1;
      ninc = incr[0] * dir[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]*dir[8]; i8 <= stp[8]*dir[8]; i8 += incr[8])
     {
      for (i7 = str[7]*dir[7]; i7 <= stp[7]*dir[7]; i7 += incr[7])
      {
       for (i6 = str[6]*dir[6]; i6 <= stp[6]*dir[6]; i6 += incr[6])
       {
        for (i5 = str[5]*dir[5]; i5 <= stp[5]*dir[5]; i5 += incr[5])
        {
         for (i4 = str[4]*dir[4]; i4 <= stp[4]*dir[4]; i4 += incr[4])
         {
          for (i3 = str[3]*dir[3]; i3 <= stp[3]*dir[3]; i3 += incr[3])
          {
           for (i2 = str[2]*dir[2]; i2 <= stp[2]*dir[2]; i2 += incr[2])
           {
            for (i1 = str[1]*dir[1]; i1 <= stp[1]*dir[1]; i1 += incr[1])
            {

              felem=str[0] + (i1 - dir[1]) * dsize[1] + (i2 - dir[2]) * dsize[2] + 
                             (i3 - dir[3]) * dsize[3] + (i4 - dir[4]) * dsize[4] +
                             (i5 - dir[5]) * dsize[5] + (i6 - dir[6]) * dsize[6] +
                             (i7 - dir[7]) * dsize[7] + (i8 - dir[8]) * dsize[8];

              if ( ffgcld(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &ldummy, &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsfd(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           double *array,  /* O - array to be filled and returned           */
           char *flagval,  /* O - set to 1 if corresponding value is null   */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dsize[10];
    LONGLONG blcll[9], trcll[9];
    long felem, nelem, nultyp, ninc, numcol;
    int hdutype, anyf;
    double nulval = 0;
    char msg[FLEN_ERRMSG];
    int nullcheck = 2;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg,FLEN_ERRMSG, "NAXIS = %d in call to ffgsvd is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        fits_read_compressed_img(fptr, TDOUBLE, blcll, trcll, inc,
            nullcheck, NULL, array, flagval, anynul, status);
        return(*status);
    }
/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 2;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvd: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgcld(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &flagval[i0], &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffggpd( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            long  firstelem,  /* I - first vector element to read (1 = 1st)  */
            long  nelem,      /* I - number of values to read                */
            double *array,    /* O - array of values that are returned       */
            int  *status)     /* IO - error status                           */
/*
  Read an array of group parameters from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
*/
{
    long row;
    int idummy;
    char cdummy;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcld(fptr, 1, row, firstelem, nelem, 1, 1, 0.,
               array, &cdummy, &idummy, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvd(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           double nulval,    /* I - value for null pixels                   */
           double *array,    /* O - array of values that are read           */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgcld(fptr, colnum, firstrow, firstelem, nelem, 1, 1, nulval,
           array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvm(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           double nulval,    /* I - value for null pixels                   */
           double *array,    /* O - array of values that are read           */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.

  TSCAL and ZERO should not be used with complex values. 
*/
{
    char cdummy;

    /* a complex double value is interpreted as a pair of double values,   */
    /* thus need to multiply the first element and number of elements by 2 */

    ffgcld(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2,
        1, 1, nulval, array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfd(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           double *array,    /* O - array of values that are read           */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    double dummy = 0;

    ffgcld(fptr, colnum, firstrow, firstelem, nelem, 1, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfm(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           double *array,    /* O - array of values that are read           */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.

  TSCAL and ZERO should not be used with complex values. 
*/
{
    LONGLONG ii, jj;
    float dummy = 0;
    char *carray;

    /* a complex double value is interpreted as a pair of double values,   */
    /* thus need to multiply the first element and number of elements by 2 */

    /* allocate temporary array */
    carray = (char *) calloc( (size_t) (nelem * 2), 1); 

    ffgcld(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2,
     1, 2, dummy, array, carray, anynul, status);

    for (ii = 0, jj = 0; jj < nelem; ii += 2, jj++)
    {
       if (carray[ii] || carray[ii + 1])
          nularray[jj] = 1;
       else
          nularray[jj] = 0;
    }

    free(carray);    
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcld( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  elemincre,  /* I - pixel increment; e.g., 2 = every other  */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
            double nulval,    /* I - value for null pixels if nultyp = 1     */
            double *array,    /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer be a virtual column in a 1 or more grouped FITS primary
  array or image extension.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The output array of values will be converted from the datatype of the column
  and will be scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    double scale, zero, power = 1, dtemp;
    int tcode, hdutype, xcode, decimals, maxelem2;
    long twidth, incre;
    long ii, xwidth, ntodo;
    int convert, nulcheck, readcheck = 0;
    LONGLONG repeat, startpos, elemnum, readptr, tnull;
    LONGLONG rowlen, rownum, remain, next, rowincre, maxelem;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value if reading from ASCII table  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    if (anynul)
        *anynul = 0;

    if (nultyp == 2)
        memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (elemincre < 0)
        readcheck = -1;  /* don't do range checking in this case */

    if ( ffgcprll( fptr, colnum, firstrow, firstelem, nelem, readcheck, &scale, &zero,
         tform, &twidth, &tcode, &maxelem2, &startpos, &elemnum, &incre,
         &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0 )
         return(*status);
    maxelem = maxelem2;

    incre *= elemincre;   /* multiply incre to just get every nth pixel */

    if (tcode == TSTRING)    /* setup for ASCII tables */
    {
      /* get the number of implied decimal places if no explicit decmal point */
      ffasfm(tform, &xcode, &xwidth, &decimals, status); 
      for(ii = 0; ii < decimals; ii++)
        power *= 10.;
    }

    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (tcode%10 == 1 &&        /* if reading an integer column, and  */ 
            tnull == NULL_UNDEFINED) /* if a null value is not defined,    */
            nulcheck = 0;            /* then do not check for null values. */

    else if (tcode == TSHORT && (tnull > SHRT_MAX || tnull < SHRT_MIN) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TBYTE && (tnull > 255 || tnull < 0) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TSTRING && snull[0] == ASCII_NULL_UNDEFINED)
         nulcheck = 0;

    /*----------------------------------------------------------------------*/
    /*  If FITS column and output data array have same datatype, then we do */
    /*  not need to use a temporary buffer to store intermediate datatype.  */
    /*----------------------------------------------------------------------*/
    convert = 1;
    if (tcode == TDOUBLE) /* Special Case:                        */
    {                              /* no type convertion required, so read */
                                  /* data directly into output buffer.    */

        if (nelem < (LONGLONG)INT32_MAX/8) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/8;
        }

        if (nulcheck == 0 && scale == 1. && zero == 0.)
            convert = 0;  /* no need to scale data or find nulls */
    }

    /*---------------------------------------------------------------------*/
    /*  Now read the pixels from the FITS column. If the column does not   */
    /*  have the same datatype as the output array, then we have to read   */
    /*  the raw values into a temporary buffer (of limited size).  In      */
    /*  the case of a vector colum read only 1 vector of values at a time  */
    /*  then skip to the next row if more values need to be read.          */
    /*  After reading the raw values, then call the fffXXYY routine to (1) */
    /*  test for undefined values, (2) convert the datatype if necessary,  */
    /*  and (3) scale the values by the FITS TSCALn and TZEROn linear      */
    /*  scaling parameters.                                                */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */

    while (remain)
    {
        /* limit the number of pixels to read at one time to the number that
           will fit in the buffer or to the number of pixels that remain in
           the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);
        if (elemincre >= 0)
        {
          ntodo = (long) minvalue(ntodo, ((repeat - elemnum - 1)/elemincre +1));
        }
        else
        {
          ntodo = (long) minvalue(ntodo, (elemnum/(-elemincre) +1));
        }

        readptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * (incre / elemincre));

        switch (tcode) 
        {
            case (TDOUBLE):
                ffgr8b(fptr, readptr, ntodo, incre, &array[next], status);
                if (convert)
                    fffr8r8(&array[next], ntodo, scale, zero, nulcheck, 
                           nulval, &nularray[next], anynul, 
                           &array[next], status);
                break;
            case (TBYTE):
                ffgi1b(fptr, readptr, ntodo, incre, (unsigned char *) buffer,
                       status);
                fffi1r8((unsigned char *) buffer, ntodo, scale, zero, nulcheck, 
                   (unsigned char) tnull, nulval, &nularray[next], anynul, 
                   &array[next], status);
                break;
            case (TSHORT):
                ffgi2b(fptr, readptr, ntodo, incre, (short  *) buffer, status);
                fffi2r8((short  *) buffer, ntodo, scale, zero, nulcheck, 
                    (short) tnull, nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TLONG):
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) buffer,
                       status);
                fffi4r8((INT32BIT *) buffer, ntodo, scale, zero, nulcheck, 
                       (INT32BIT) tnull, nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TLONGLONG):
                ffgi8b(fptr, readptr, ntodo, incre, (long *) buffer, status);
                fffi8r8( (LONGLONG *) buffer, ntodo, scale, zero, 
                           nulcheck, tnull, nulval, &nularray[next], 
                            anynul, &array[next], status);
                break;
            case (TFLOAT):
                ffgr4b(fptr, readptr, ntodo, incre, (float  *) buffer, status);
                fffr4r8((float  *) buffer, ntodo, scale, zero, nulcheck, 
                          nulval, &nularray[next], anynul, 
                          &array[next], status);
                break;
            case (TSTRING):
                ffmbyt(fptr, readptr, REPORT_EOF, status);
       
                if (incre == twidth)    /* contiguous bytes */
                     ffgbyt(fptr, ntodo * twidth, buffer, status);
                else
                     ffgbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                               status);

                fffstrr8((char *) buffer, ntodo, scale, zero, twidth, power,
                     nulcheck, snull, nulval, &nularray[next], anynul,
                     &array[next], status);
                break;


            default:  /*  error trap for invalid column format */
                snprintf(message, FLEN_ERRMSG,
                   "Cannot read numbers from column %d which has format %s",
                    colnum, tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous read operation */
        {
	  dtemp = (double) next;
          if (hdutype > 0)
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from column %d (ffgcld).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from image (ffgcld).",
              dtemp+1., dtemp+ntodo);

          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum = elemnum + (ntodo * elemincre);

            if (elemnum >= repeat)  /* completed a row; start on later row */
            {
                rowincre = (long) (elemnum / repeat);
                rownum += rowincre;
                elemnum = elemnum - (rowincre * repeat);
            }
            else if (elemnum < 0)  /* completed a row; start on a previous row */
            {
                rowincre = (long) ((-elemnum - 1) / repeat + 1);
                rownum -= rowincre;
                elemnum = (rowincre * repeat) + elemnum;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while reading FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi1r8(unsigned char *input, /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
            double nullval,       /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,       /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii]; /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = input[ii] * scale + zero;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (double) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    output[ii] = input[ii] * scale + zero;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi2r8(short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            double nullval,       /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,       /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii]; /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = input[ii] * scale + zero;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (double) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    output[ii] = input[ii] * scale + zero;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi4r8(INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            double nullval,       /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,       /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii]; /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = input[ii] * scale + zero;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (double) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    output[ii] = input[ii] * scale + zero;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi8r8(LONGLONG *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG tnull,       /* I - value of FITS TNULLn keyword if any */
            double nullval,       /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,       /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    ULONGLONG ulltemp;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);
                output[ii] = (double) ulltemp;
            }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
	    {
                output[ii] = (double) input[ii]; /* copy input to output */
            }  
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = input[ii] * scale + zero;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of subtracting 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
		{
                    ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);
                    output[ii] = (double) ulltemp;
                }
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (double) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    output[ii] = input[ii] * scale + zero;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr4r8(float *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            double nullval,       /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,       /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii]; /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = input[ii] * scale + zero;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr++;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                output[ii] = (double) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = zero;
              }
              else
                  output[ii] = input[ii] * scale + zero;
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr8r8(double *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            double nullval,       /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,       /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            memmove(output, input, ntodo * sizeof(double) );
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = input[ii] * scale + zero;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr += 3;       /* point to MSBs */
#endif

        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                    {
                        nullarray[ii] = 1;
                       /* explicitly set value in case output contains a NaN */
                        output[ii] = DOUBLENULLVALUE;
                    }
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                  output[ii] = input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                    {
                        nullarray[ii] = 1;
                       /* explicitly set value in case output contains a NaN */
                        output[ii] = DOUBLENULLVALUE;
                    }
                  }
                  else            /* it's an underflow */
                     output[ii] = zero;
              }
              else
                  output[ii] = input[ii] * scale + zero;
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffstrr8(char *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            long twidth,          /* I - width of each substring of chars    */
            double implipower,    /* I - power of 10 of implied decimal      */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            char  *snull,         /* I - value of FITS null string, if any   */
            double nullval,       /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,       /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file. Check
  for null values and do scaling if required. The nullcheck code value
  determines how any null values in the input array are treated. A null
  value is an input pixel that is equal to snull.  If nullcheck= 0, then
  no special checking for nulls is performed.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    int nullen;
    long ii;
    double dvalue;
    char *cstring, message[FLEN_ERRMSG];
    char *cptr, *tpos;
    char tempstore, chrzero = '0';
    double val, power;
    int exponent, sign, esign, decpt;

    nullen = strlen(snull);
    cptr = input;  /* pointer to start of input string */
    for (ii = 0; ii < ntodo; ii++)
    {
      cstring = cptr;
      /* temporarily insert a null terminator at end of the string */
      tpos = cptr + twidth;
      tempstore = *tpos;
      *tpos = 0;

      /* check if null value is defined, and if the    */
      /* column string is identical to the null string */
      if (snull[0] != ASCII_NULL_UNDEFINED && 
         !strncmp(snull, cptr, nullen) )
      {
        if (nullcheck)  
        {
          *anynull = 1;    
          if (nullcheck == 1)
            output[ii] = nullval;
          else
            nullarray[ii] = 1;
        }
        cptr += twidth;
      }
      else
      {
        /* value is not the null value, so decode it */
        /* remove any embedded blank characters from the string */

        decpt = 0;
        sign = 1;
        val  = 0.;
        power = 1.;
        exponent = 0;
        esign = 1;

        while (*cptr == ' ')               /* skip leading blanks */
           cptr++;

        if (*cptr == '-' || *cptr == '+')  /* check for leading sign */
        {
          if (*cptr == '-')
             sign = -1;

          cptr++;

          while (*cptr == ' ')         /* skip blanks between sign and value */
            cptr++;
        }

        while (*cptr >= '0' && *cptr <= '9')
        {
          val = val * 10. + *cptr - chrzero;  /* accumulate the value */
          cptr++;

          while (*cptr == ' ')         /* skip embedded blanks in the value */
            cptr++;
        }

        if (*cptr == '.' || *cptr == ',')              /* check for decimal point */
        {
          decpt = 1;       /* set flag to show there was a decimal point */
          cptr++;
          while (*cptr == ' ')         /* skip any blanks */
            cptr++;

          while (*cptr >= '0' && *cptr <= '9')
          {
            val = val * 10. + *cptr - chrzero;  /* accumulate the value */
            power = power * 10.;
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks in the value */
              cptr++;
          }
        }

        if (*cptr == 'E' || *cptr == 'D')  /* check for exponent */
        {
          cptr++;
          while (*cptr == ' ')         /* skip blanks */
              cptr++;
  
          if (*cptr == '-' || *cptr == '+')  /* check for exponent sign */
          {
            if (*cptr == '-')
               esign = -1;

            cptr++;

            while (*cptr == ' ')        /* skip blanks between sign and exp */
              cptr++;
          }

          while (*cptr >= '0' && *cptr <= '9')
          {
            exponent = exponent * 10 + *cptr - chrzero;  /* accumulate exp */
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks */
              cptr++;
          }
        }

        if (*cptr  != 0)  /* should end up at the null terminator */
        {
          snprintf(message, FLEN_ERRMSG,"Cannot read number from ASCII table");
          ffpmsg(message);
          snprintf(message,FLEN_ERRMSG, "Column field = %s.", cstring);
          ffpmsg(message);
          /* restore the char that was overwritten by the null */
          *tpos = tempstore;
          return(*status = BAD_C2D);
        }

        if (!decpt)  /* if no explicit decimal, use implied */
           power = implipower;

        dvalue = (sign * val / power) * pow(10., (double) (esign * exponent));

        output[ii] = (dvalue * scale + zero);   /* apply the scaling */
      }
      /* restore the char that was overwritten by the null */
      *tpos = tempstore;
    }
    return(*status);
}
cfitsio-3.47/getcole.c0000644000225700000360000020651413464573432014206 0ustar  cagordonlhea/*  This file, getcole.c, contains routines that read data elements from   */
/*  a FITS image or table, with float datatype                             */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffgpve( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            float nulval,     /* I - value for undefined pixels              */
            float *array,     /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    char cdummy;
    int nullcheck = 1;
    float nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
         nullvalue = nulval;  /* set local variable */

        fits_read_compressed_pixels(fptr, TFLOAT, firstelem, nelem,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcle(fptr, 2, row, firstelem, nelem, 1, 1, nulval,
               array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpfe( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            float *array,     /* O - array of values that are returned       */
            char *nularray,   /* O - array of null pixel flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Any undefined pixels in the returned array will be set = 0 and the 
  corresponding nularray value will be set = 1.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    int nullcheck = 2;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, TFLOAT, firstelem, nelem,
            nullcheck, NULL, array, nularray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcle(fptr, 2, row, firstelem, nelem, 1, 2, 0.F,
               array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg2de(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           float nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           float *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    /* call the 3D reading routine, with the 3rd dimension = 1 */

    ffg3de(fptr, group, nulval, ncols, naxis2, naxis1, naxis2, 1, array, 
           anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg3de(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           float nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  nrows,     /* I - number of rows in each plane of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  naxis3,    /* I - FITS image NAXIS3 value                 */
           float *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 3-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    long tablerow;
    LONGLONG narray, nfits, ii, jj;
    char cdummy;
    int nullcheck = 1;
    long inc[] = {1,1,1};
    LONGLONG fpixel[] = {1,1,1};
    LONGLONG lpixel[3];
    float nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        lpixel[0] = ncols;
        lpixel[1] = nrows;
        lpixel[2] = naxis3;
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TFLOAT, fpixel, lpixel, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
       /* all the image pixels are contiguous, so read all at once */
       ffgcle(fptr, 2, tablerow, 1, naxis1 * naxis2 * naxis3, 1, 1, nulval,
               array, &cdummy, anynul, status);
       return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to read */
    narray = 0;  /* next pixel in output array to be filled */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* reading naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffgcle(fptr, 2, tablerow, nfits, naxis1, 1, 1, nulval,
          &array[narray], &cdummy, anynul, status) > 0)
          return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsve(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           float nulval,   /* I - value to set undefined pixels             */
           float *array,   /* O - array to be filled and returned           */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dir[9];
    long nelem, nultyp, ninc, numcol;
    LONGLONG felem, dsize[10], blcll[9], trcll[9];
    int hdutype, anyf;
    char ldummy, msg[FLEN_ERRMSG];
    int nullcheck = 1;
    float nullvalue;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsve is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TFLOAT, blcll, trcll, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 1;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
        dir[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        if (hdutype == IMAGE_HDU)
        {
           dir[ii] = -1;
        }
        else
        {
          snprintf(msg, FLEN_ERRMSG,"ffgsve: illegal range specified for axis %ld", ii + 1);
          ffpmsg(msg);
          return(*status = BAD_PIX_NUM);
        }
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
      dsize[ii] = dsize[ii] * dir[ii];
    }
    dsize[naxis] = dsize[naxis] * dir[naxis];

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0]*dir[0] - str[0]*dir[0]) / inc[0] + 1;
      ninc = incr[0] * dir[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]*dir[8]; i8 <= stp[8]*dir[8]; i8 += incr[8])
     {
      for (i7 = str[7]*dir[7]; i7 <= stp[7]*dir[7]; i7 += incr[7])
      {
       for (i6 = str[6]*dir[6]; i6 <= stp[6]*dir[6]; i6 += incr[6])
       {
        for (i5 = str[5]*dir[5]; i5 <= stp[5]*dir[5]; i5 += incr[5])
        {
         for (i4 = str[4]*dir[4]; i4 <= stp[4]*dir[4]; i4 += incr[4])
         {
          for (i3 = str[3]*dir[3]; i3 <= stp[3]*dir[3]; i3 += incr[3])
          {
           for (i2 = str[2]*dir[2]; i2 <= stp[2]*dir[2]; i2 += incr[2])
           {
            for (i1 = str[1]*dir[1]; i1 <= stp[1]*dir[1]; i1 += incr[1])
            {

              felem=str[0] + (i1 - dir[1]) * dsize[1] + (i2 - dir[2]) * dsize[2] + 
                             (i3 - dir[3]) * dsize[3] + (i4 - dir[4]) * dsize[4] +
                             (i5 - dir[5]) * dsize[5] + (i6 - dir[6]) * dsize[6] +
                             (i7 - dir[7]) * dsize[7] + (i8 - dir[8]) * dsize[8];

              if ( ffgcle(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &ldummy, &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsfe(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           float *array,   /* O - array to be filled and returned           */
           char *flagval,  /* O - set to 1 if corresponding value is null   */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dsize[10];
    LONGLONG blcll[9], trcll[9];
    long felem, nelem, nultyp, ninc, numcol;
    int hdutype, anyf;
    float nulval = 0;
    char msg[FLEN_ERRMSG];
    int nullcheck = 2;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsve is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        fits_read_compressed_img(fptr, TFLOAT, blcll, trcll, inc,
            nullcheck, NULL, array, flagval, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 2;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsve: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgcle(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &flagval[i0], &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffggpe( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            long  firstelem,  /* I - first vector element to read (1 = 1st)  */
            long  nelem,      /* I - number of values to read                */
            float *array,     /* O - array of values that are returned       */
            int  *status)     /* IO - error status                           */
/*
  Read an array of group parameters from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
*/
{
    long row;
    int idummy;
    char cdummy;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcle(fptr, 1, row, firstelem, nelem, 1, 1, 0.F,
               array, &cdummy, &idummy, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcve(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           float nulval,     /* I - value for null pixels                   */
           float *array,     /* O - array of values that are read           */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgcle(fptr, colnum, firstrow, firstelem, nelem, 1, 1, nulval,
           array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvc(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           float nulval,     /* I - value for null pixels                   */
           float *array,     /* O - array of values that are read           */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.

  TSCAL and ZERO should not be used with complex values. 
*/
{
    char cdummy;

    /* a complex value is interpreted as a pair of float values, thus */
    /* need to multiply the first element and number of elements by 2 */

    ffgcle(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem *2,
           1, 1, nulval, array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfe(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           float *array,     /* O - array of values that are read           */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    float dummy = 0;

    ffgcle(fptr, colnum, firstrow, firstelem, nelem, 1, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfc(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           float *array,     /* O - array of values that are read           */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.

  TSCAL and ZERO should not be used with complex values. 
*/
{
    LONGLONG ii, jj;
    float dummy = 0;
    char *carray;

    /* a complex value is interpreted as a pair of float values, thus */
    /* need to multiply the first element and number of elements by 2 */
    
    /* allocate temporary array */
    carray = (char *) calloc( (size_t) (nelem * 2), 1); 

    ffgcle(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2,
           1, 2, dummy, array, carray, anynul, status);

    for (ii = 0, jj = 0; jj < nelem; ii += 2, jj++)
    {
       if (carray[ii] || carray[ii + 1])
          nularray[jj] = 1;
       else
          nularray[jj] = 0;
    }

    free(carray);    
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcle( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  elemincre,  /* I - pixel increment; e.g., 2 = every other  */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
            float nulval,     /* I - value for null pixels if nultyp = 1     */
            float *array,     /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer be a virtual column in a 1 or more grouped FITS primary
  array or image extension.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The output array of values will be converted from the datatype of the column 
  and will be scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    double scale, zero, power = 1., dtemp;
    int tcode, maxelem2, hdutype, xcode, decimals;
    long twidth, incre;
    long ii, xwidth, ntodo;
    int convert, nulcheck, readcheck = 0;
    LONGLONG repeat, startpos, elemnum, readptr, tnull;
    LONGLONG rowlen, rownum, remain, next, rowincre, maxelem;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value if reading from ASCII table  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    if (anynul)
       *anynul = 0;

    if (nultyp == 2)
        memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (elemincre < 0)
        readcheck = -1;  /* don't do range checking in this case */

    if ( ffgcprll( fptr, colnum, firstrow, firstelem, nelem, readcheck, &scale, &zero,
         tform, &twidth, &tcode, &maxelem2, &startpos, &elemnum, &incre,
         &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0 )
         return(*status);
    maxelem = maxelem2;

    incre *= elemincre;   /* multiply incre to just get every nth pixel */

    if (tcode == TSTRING)    /* setup for ASCII tables */
    {
      /* get the number of implied decimal places if no explicit decmal point */
      ffasfm(tform, &xcode, &xwidth, &decimals, status); 
      for(ii = 0; ii < decimals; ii++)
        power *= 10.;
    }

    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (tcode%10 == 1 &&        /* if reading an integer column, and  */ 
            tnull == NULL_UNDEFINED) /* if a null value is not defined,    */
            nulcheck = 0;            /* then do not check for null values. */

    else if (tcode == TSHORT && (tnull > SHRT_MAX || tnull < SHRT_MIN) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TBYTE && (tnull > 255 || tnull < 0) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TSTRING && snull[0] == ASCII_NULL_UNDEFINED)
         nulcheck = 0;

    /*----------------------------------------------------------------------*/
    /*  If FITS column and output data array have same datatype, then we do */
    /*  not need to use a temporary buffer to store intermediate datatype.  */
    /*----------------------------------------------------------------------*/
    convert = 1;
    if (tcode == TFLOAT) /* Special Case:                        */
    {                             /* no type convertion required, so read */
                                  /* data directly into output buffer.    */

        if (nelem < (LONGLONG)INT32_MAX/4) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/4;
        }

        if (nulcheck == 0 && scale == 1. && zero == 0.)
            convert = 0;  /* no need to scale data or find nulls */
    }

    /*---------------------------------------------------------------------*/
    /*  Now read the pixels from the FITS column. If the column does not   */
    /*  have the same datatype as the output array, then we have to read   */
    /*  the raw values into a temporary buffer (of limited size).  In      */
    /*  the case of a vector colum read only 1 vector of values at a time  */
    /*  then skip to the next row if more values need to be read.          */
    /*  After reading the raw values, then call the fffXXYY routine to (1) */
    /*  test for undefined values, (2) convert the datatype if necessary,  */
    /*  and (3) scale the values by the FITS TSCALn and TZEROn linear      */
    /*  scaling parameters.                                                */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */

    while (remain)
    {
        /* limit the number of pixels to read at one time to the number that
           will fit in the buffer or to the number of pixels that remain in
           the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);
        if (elemincre >= 0)
        {
          ntodo = (long) minvalue(ntodo, ((repeat - elemnum - 1)/elemincre +1));
        }
        else
        {
          ntodo = (long) minvalue(ntodo, (elemnum/(-elemincre) +1));
        }

        readptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * (incre / elemincre));

        switch (tcode) 
        {
            case (TFLOAT):
                ffgr4b(fptr, readptr, ntodo, incre, &array[next], status);
                if (convert)
                    fffr4r4(&array[next], ntodo, scale, zero, nulcheck, 
                           nulval, &nularray[next], anynul, 
                           &array[next], status);
                break;
            case (TBYTE):
                ffgi1b(fptr, readptr, ntodo, incre, (unsigned char *) buffer,
                       status);
                fffi1r4((unsigned char *) buffer, ntodo, scale, zero, nulcheck, 
                    (unsigned char) tnull, nulval, &nularray[next], anynul, 
                     &array[next], status);
                break;
            case (TSHORT):
                ffgi2b(fptr, readptr, ntodo, incre, (short  *) buffer, status);
                fffi2r4((short  *) buffer, ntodo, scale, zero, nulcheck, 
                       (short) tnull, nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TLONG):
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) buffer,
                       status);
                fffi4r4((INT32BIT *) buffer, ntodo, scale, zero, nulcheck, 
                       (INT32BIT) tnull, nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;

            case (TLONGLONG):
                ffgi8b(fptr, readptr, ntodo, incre, (long *) buffer, status);
                fffi8r4( (LONGLONG *) buffer, ntodo, scale, zero, 
                           nulcheck, tnull, nulval, &nularray[next], 
                            anynul, &array[next], status);
                break;
            case (TDOUBLE):
                ffgr8b(fptr, readptr, ntodo, incre, (double *) buffer, status);
                fffr8r4((double *) buffer, ntodo, scale, zero, nulcheck, 
                          nulval, &nularray[next], anynul, 
                          &array[next], status);
                break;
            case (TSTRING):
                ffmbyt(fptr, readptr, REPORT_EOF, status);
       
                if (incre == twidth)    /* contiguous bytes */
                     ffgbyt(fptr, ntodo * twidth, buffer, status);
                else
                     ffgbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                               status);

                fffstrr4((char *) buffer, ntodo, scale, zero, twidth, power,
                     nulcheck, snull, nulval, &nularray[next], anynul,
                     &array[next], status);
                break;


            default:  /*  error trap for invalid column format */
                snprintf(message, FLEN_ERRMSG,
                   "Cannot read numbers from column %d which has format %s",
                    colnum, tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous read operation */
        {
	  dtemp = (double) next;
          if (hdutype > 0)
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from column %d (ffgcle).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from image (ffgcle).",
              dtemp+1., dtemp+ntodo);

          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum = elemnum + (ntodo * elemincre);

            if (elemnum >= repeat)  /* completed a row; start on later row */
            {
                rowincre = elemnum / repeat;
                rownum += rowincre;
                elemnum = elemnum - (rowincre * repeat);
            }
            else if (elemnum < 0)  /* completed a row; start on a previous row */
            {
                rowincre = (-elemnum - 1) / repeat + 1;
                rownum -= rowincre;
                elemnum = (rowincre * repeat) + elemnum;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while reading FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi1r4(unsigned char *input, /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];  /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = (float) (( (double) input[ii] ) * scale + zero);
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (float) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    output[ii] = (float) (( (double) input[ii] ) * scale + zero);
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi2r4(short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];  /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = (float) (input[ii] * scale + zero);
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (float) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    output[ii] = (float) (input[ii] * scale + zero);
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi4r4(INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];  /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = (float) (input[ii] * scale + zero);
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (float) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    output[ii] = (float) (input[ii] * scale + zero);
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi8r4(LONGLONG *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG tnull,       /* I - value of FITS TNULLn keyword if any */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    ULONGLONG ulltemp;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);
                output[ii] = (float) ulltemp;
            }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = (float) input[ii];  /* copy input to output */
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = (float) (input[ii] * scale + zero);
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of subtracting 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
		{
                    ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);
                    output[ii] = (float) ulltemp;
                }
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (float) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    output[ii] = (float) (input[ii] * scale + zero);
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr4r4(float *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            memmove(output, input, ntodo * sizeof(float) );
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = (float) (input[ii] * scale + zero);
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr++;       /* point to MSBs */
#endif

        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                    {
                        nullarray[ii] = 1;
                       /* explicitly set value in case output contains a NaN */
                        output[ii] = FLOATNULLVALUE;
                    }
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                output[ii] = input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                    {
                        nullarray[ii] = 1;
                       /* explicitly set value in case output contains a NaN */
                        output[ii] = FLOATNULLVALUE;
                    }
                  }
                  else            /* it's an underflow */
                     output[ii] = (float) zero;
              }
              else
                  output[ii] = (float) (input[ii] * scale + zero);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr8r4(double *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii]; /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] = (float) (input[ii] * scale + zero);
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr += 3;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                  output[ii] = (float) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = (float) zero;
              }
              else
                  output[ii] = (float) (input[ii] * scale + zero);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffstrr4(char *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            long twidth,          /* I - width of each substring of chars    */
            double implipower,    /* I - power of 10 of implied decimal      */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            char  *snull,         /* I - value of FITS null string, if any   */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file. Check
  for null values and do scaling if required. The nullcheck code value
  determines how any null values in the input array are treated. A null
  value is an input pixel that is equal to snull.  If nullcheck= 0, then
  no special checking for nulls is performed.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    int nullen;
    long ii;
    double dvalue;
    char *cstring, message[FLEN_ERRMSG];
    char *cptr, *tpos;
    char tempstore, chrzero = '0';
    double val, power;
    int exponent, sign, esign, decpt;

    nullen = strlen(snull);
    cptr = input;  /* pointer to start of input string */
    for (ii = 0; ii < ntodo; ii++)
    {
      cstring = cptr;
      /* temporarily insert a null terminator at end of the string */
      tpos = cptr + twidth;
      tempstore = *tpos;
      *tpos = 0;

      /* check if null value is defined, and if the    */
      /* column string is identical to the null string */
      if (snull[0] != ASCII_NULL_UNDEFINED && 
         !strncmp(snull, cptr, nullen) )
      {
        if (nullcheck)  
        {
          *anynull = 1;    
          if (nullcheck == 1)
            output[ii] = nullval;
          else
            nullarray[ii] = 1;
        }
        cptr += twidth;
      }
      else
      {
        /* value is not the null value, so decode it */
        /* remove any embedded blank characters from the string */

        decpt = 0;
        sign = 1;
        val  = 0.;
        power = 1.;
        exponent = 0;
        esign = 1;

        while (*cptr == ' ')               /* skip leading blanks */
           cptr++;

        if (*cptr == '-' || *cptr == '+')  /* check for leading sign */
        {
          if (*cptr == '-')
             sign = -1;

          cptr++;

          while (*cptr == ' ')         /* skip blanks between sign and value */
            cptr++;
        }

        while (*cptr >= '0' && *cptr <= '9')
        {
          val = val * 10. + *cptr - chrzero;  /* accumulate the value */
          cptr++;

          while (*cptr == ' ')         /* skip embedded blanks in the value */
            cptr++;
        }

        if (*cptr == '.' || *cptr == ',')       /* check for decimal point */
        {
          decpt = 1;       /* set flag to show there was a decimal point */
          cptr++;
          while (*cptr == ' ')         /* skip any blanks */
            cptr++;

          while (*cptr >= '0' && *cptr <= '9')
          {
            val = val * 10. + *cptr - chrzero;  /* accumulate the value */
            power = power * 10.;
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks in the value */
              cptr++;
          }
        }

        if (*cptr == 'E' || *cptr == 'D')  /* check for exponent */
        {
          cptr++;
          while (*cptr == ' ')         /* skip blanks */
              cptr++;
  
          if (*cptr == '-' || *cptr == '+')  /* check for exponent sign */
          {
            if (*cptr == '-')
               esign = -1;

            cptr++;

            while (*cptr == ' ')        /* skip blanks between sign and exp */
              cptr++;
          }

          while (*cptr >= '0' && *cptr <= '9')
          {
            exponent = exponent * 10 + *cptr - chrzero;  /* accumulate exp */
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks */
              cptr++;
          }
        }

        if (*cptr  != 0)  /* should end up at the null terminator */
        {
          snprintf(message, FLEN_ERRMSG,"Cannot read number from ASCII table");
          ffpmsg(message);
          snprintf(message, FLEN_ERRMSG, "Column field = %s.", cstring);
          ffpmsg(message);
          /* restore the char that was overwritten by the null */
          *tpos = tempstore;
          return(*status = BAD_C2D);
        }

        if (!decpt)  /* if no explicit decimal, use implied */
           power = implipower;

        dvalue = (sign * val / power) * pow(10., (double) (esign * exponent));

        output[ii] = (float) (dvalue * scale + zero);   /* apply the scaling */

      }
      /* restore the char that was overwritten by the null */
      *tpos = tempstore;
    }
    return(*status);
}
cfitsio-3.47/getcoli.c0000644000225700000360000022220513464573432014205 0ustar  cagordonlhea/*  This file, getcoli.c, contains routines that read data elements from   */
/*  a FITS image or table, with short datatype.                            */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffgpvi( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            short nulval,     /* I - value for undefined pixels              */
            short *array,     /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    char cdummy;
    int nullcheck = 1;
    short nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
         nullvalue = nulval;  /* set local variable */
        fits_read_compressed_pixels(fptr, TSHORT, firstelem, nelem,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcli(fptr, 2, row, firstelem, nelem, 1, 1, nulval,
               array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpfi( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            short *array,     /* O - array of values that are returned       */
            char *nularray,   /* O - array of null pixel flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Any undefined pixels in the returned array will be set = 0 and the 
  corresponding nularray value will be set = 1.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    int nullcheck = 2;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, TSHORT, firstelem, nelem,
            nullcheck, NULL, array, nularray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcli(fptr, 2, row, firstelem, nelem, 1, 2, 0,
               array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg2di(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           short nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           short *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    /* call the 3D reading routine, with the 3rd dimension = 1 */

    ffg3di(fptr, group, nulval, ncols, naxis2, naxis1, naxis2, 1, array, 
           anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg3di(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           short nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  nrows,     /* I - number of rows in each plane of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  naxis3,    /* I - FITS image NAXIS3 value                 */
           short *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 3-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    long tablerow, ii, jj;
    LONGLONG nfits, narray;
    char cdummy;
    int nullcheck = 1;
    long inc[] = {1,1,1};
    LONGLONG fpixel[] = {1,1,1};
    LONGLONG lpixel[3];
    short nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        lpixel[0] = ncols;
        lpixel[1] = nrows;
        lpixel[2] = naxis3;
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TSHORT, fpixel, lpixel, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
       /* all the image pixels are contiguous, so read all at once */
       ffgcli(fptr, 2, tablerow, 1, naxis1 * naxis2 * naxis3, 1, 1, nulval,
               array, &cdummy, anynul, status);
       return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to read */
    narray = 0;  /* next pixel in output array to be filled */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* reading naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffgcli(fptr, 2, tablerow, nfits, naxis1, 1, 1, nulval,
          &array[narray], &cdummy, anynul, status) > 0)
          return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsvi(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           short nulval,   /* I - value to set undefined pixels             */
           short *array,   /* O - array to be filled and returned           */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dir[9];
    long nelem, nultyp, ninc, numcol;
    LONGLONG felem, dsize[10], blcll[9], trcll[9];
    int hdutype, anyf;
    char ldummy, msg[FLEN_ERRMSG];
    int nullcheck = 1;
    short nullvalue;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg,FLEN_ERRMSG, "NAXIS = %d in call to ffgsvi is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TSHORT, blcll, trcll, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);

        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 1;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
        dir[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        if (hdutype == IMAGE_HDU)
        {
           dir[ii] = -1;
        }
        else
        {
          snprintf(msg, FLEN_ERRMSG,"ffgsvi: illegal range specified for axis %ld", ii + 1);
          ffpmsg(msg);
          return(*status = BAD_PIX_NUM);
        }
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
      dsize[ii] = dsize[ii] * dir[ii];
    }
    dsize[naxis] = dsize[naxis] * dir[naxis];

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0]*dir[0] - str[0]*dir[0]) / inc[0] + 1;
      ninc = incr[0] * dir[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]*dir[8]; i8 <= stp[8]*dir[8]; i8 += incr[8])
     {
      for (i7 = str[7]*dir[7]; i7 <= stp[7]*dir[7]; i7 += incr[7])
      {
       for (i6 = str[6]*dir[6]; i6 <= stp[6]*dir[6]; i6 += incr[6])
       {
        for (i5 = str[5]*dir[5]; i5 <= stp[5]*dir[5]; i5 += incr[5])
        {
         for (i4 = str[4]*dir[4]; i4 <= stp[4]*dir[4]; i4 += incr[4])
         {
          for (i3 = str[3]*dir[3]; i3 <= stp[3]*dir[3]; i3 += incr[3])
          {
           for (i2 = str[2]*dir[2]; i2 <= stp[2]*dir[2]; i2 += incr[2])
           {
            for (i1 = str[1]*dir[1]; i1 <= stp[1]*dir[1]; i1 += incr[1])
            {

              felem=str[0] + (i1 - dir[1]) * dsize[1] + (i2 - dir[2]) * dsize[2] + 
                             (i3 - dir[3]) * dsize[3] + (i4 - dir[4]) * dsize[4] +
                             (i5 - dir[5]) * dsize[5] + (i6 - dir[6]) * dsize[6] +
                             (i7 - dir[7]) * dsize[7] + (i8 - dir[8]) * dsize[8];

              if ( ffgcli(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &ldummy, &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsfi(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           short *array,   /* O - array to be filled and returned           */
           char *flagval,  /* O - set to 1 if corresponding value is null   */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dsize[10];
    LONGLONG blcll[9], trcll[9];
    long felem, nelem, nultyp, ninc, numcol;
    int hdutype, anyf;
    short nulval = 0;
    char msg[FLEN_ERRMSG];
    int nullcheck = 2;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvi is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        fits_read_compressed_img(fptr, TSHORT, blcll, trcll, inc,
            nullcheck, NULL, array, flagval, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 2;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvi: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgcli(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &flagval[i0], &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffggpi( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            long  firstelem,  /* I - first vector element to read (1 = 1st)  */
            long  nelem,      /* I - number of values to read                */
            short *array,     /* O - array of values that are returned       */
            int  *status)     /* IO - error status                           */
/*
  Read an array of group parameters from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
*/
{
    long row;
    int idummy;
    char cdummy;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcli(fptr, 1, row, firstelem, nelem, 1, 1, 0,
               array, &cdummy, &idummy, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvi(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           short nulval,     /* I - value for null pixels                   */
           short *array,     /* O - array of values that are read           */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgcli(fptr, colnum, firstrow, firstelem, nelem, 1, 1, nulval,
           array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfi(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           short *array,     /* O - array of values that are read           */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    short dummy = 0;

    ffgcli(fptr, colnum, firstrow, firstelem, nelem, 1, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcli( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG  firstelem, /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  elemincre,  /* I - pixel increment; e.g., 2 = every other  */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
            short nulval,     /* I - value for null pixels if nultyp = 1     */
            short *array,     /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer be a virtual column in a 1 or more grouped FITS primary
  array or image extension.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The output array of values will be converted from the datatype of the column 
  and will be scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    double scale, zero, power = 1., dtemp;
    int tcode, maxelem2, hdutype, xcode, decimals;
    long twidth, incre;
    long ii, xwidth, ntodo;
    int convert, nulcheck, readcheck = 0;
    LONGLONG repeat, startpos, elemnum, readptr, tnull;
    LONGLONG rowlen, rownum, remain, next, rowincre, maxelem;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value if reading from ASCII table  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    if (anynul)
        *anynul = 0;

    if (nultyp == 2)
        memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (elemincre < 0)
        readcheck = -1;  /* don't do range checking in this case */

    if ( ffgcprll( fptr, colnum, firstrow, firstelem, nelem, readcheck, &scale, &zero,
         tform, &twidth, &tcode, &maxelem2, &startpos, &elemnum, &incre,
         &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0 )
         return(*status);
    maxelem = maxelem2;

    incre *= elemincre;   /* multiply incre to just get every nth pixel */

    if (tcode == TSTRING)    /* setup for ASCII tables */
    {
      /* get the number of implied decimal places if no explicit decmal point */
      ffasfm(tform, &xcode, &xwidth, &decimals, status); 
      for(ii = 0; ii < decimals; ii++)
        power *= 10.;
    }
    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (tcode%10 == 1 &&        /* if reading an integer column, and  */ 
            tnull == NULL_UNDEFINED) /* if a null value is not defined,    */
            nulcheck = 0;            /* then do not check for null values. */

    else if (tcode == TSHORT && (tnull > SHRT_MAX || tnull < SHRT_MIN) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TBYTE && (tnull > 255 || tnull < 0) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TSTRING && snull[0] == ASCII_NULL_UNDEFINED)
         nulcheck = 0;

    /*----------------------------------------------------------------------*/
    /*  If FITS column and output data array have same datatype, then we do */
    /*  not need to use a temporary buffer to store intermediate datatype.  */
    /*----------------------------------------------------------------------*/
    convert = 1;
    if (tcode == TSHORT) /* Special Case:                        */
    {                             /* no type convertion required, so read */
                                  /* data directly into output buffer.    */

        if (nelem < (LONGLONG)INT32_MAX/2) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/2;
        }

        if (nulcheck == 0 && scale == 1. && zero == 0.)
            convert = 0;  /* no need to scale data or find nulls */
    }

    /*---------------------------------------------------------------------*/
    /*  Now read the pixels from the FITS column. If the column does not   */
    /*  have the same datatype as the output array, then we have to read   */
    /*  the raw values into a temporary buffer (of limited size).  In      */
    /*  the case of a vector colum read only 1 vector of values at a time  */
    /*  then skip to the next row if more values need to be read.          */
    /*  After reading the raw values, then call the fffXXYY routine to (1) */
    /*  test for undefined values, (2) convert the datatype if necessary,  */
    /*  and (3) scale the values by the FITS TSCALn and TZEROn linear      */
    /*  scaling parameters.                                                */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */

    while (remain)
    {
        /* limit the number of pixels to read at one time to the number that
           will fit in the buffer or to the number of pixels that remain in
           the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);
        if (elemincre >= 0)
        {
          ntodo = (long) minvalue(ntodo, ((repeat - elemnum - 1)/elemincre +1));
        }
        else
        {
          ntodo = (long) minvalue(ntodo, (elemnum/(-elemincre) +1));
        }

        readptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * (incre / elemincre));

        switch (tcode) 
        {
            case (TSHORT):
                ffgi2b(fptr, readptr, ntodo, incre, &array[next], status);
                if (convert)
                    fffi2i2(&array[next], ntodo, scale, zero, nulcheck, 
                           (short) tnull, nulval, &nularray[next], anynul, 
                           &array[next], status);
                break;
            case (TLONGLONG):

                ffgi8b(fptr, readptr, ntodo, incre, (long *) buffer, status);
                fffi8i2( (LONGLONG *) buffer, ntodo, scale, zero, 
                           nulcheck, tnull, nulval, &nularray[next], 
                            anynul, &array[next], status);
                break;
            case (TBYTE):
                ffgi1b(fptr, readptr, ntodo, incre, (unsigned char *) buffer,
                      status);
                fffi1i2((unsigned char *) buffer, ntodo, scale, zero, nulcheck, 
                    (unsigned char) tnull, nulval, &nularray[next], anynul, 
                    &array[next], status);
                break;
            case (TLONG):
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) buffer,
                       status);
                fffi4i2((INT32BIT *) buffer, ntodo, scale, zero, nulcheck, 
                       (INT32BIT) tnull, nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TFLOAT):
                ffgr4b(fptr, readptr, ntodo, incre, (float  *) buffer, status);
                fffr4i2((float  *) buffer, ntodo, scale, zero, nulcheck, 
                       nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TDOUBLE):
                ffgr8b(fptr, readptr, ntodo, incre, (double *) buffer, status);
                fffr8i2((double *) buffer, ntodo, scale, zero, nulcheck, 
                          nulval, &nularray[next], anynul, 
                          &array[next], status);
                break;
            case (TSTRING):
                ffmbyt(fptr, readptr, REPORT_EOF, status);
       
                if (incre == twidth)    /* contiguous bytes */
                     ffgbyt(fptr, ntodo * twidth, buffer, status);
                else
                     ffgbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                               status);

                fffstri2((char *) buffer, ntodo, scale, zero, twidth, power,
                     nulcheck, snull, nulval, &nularray[next], anynul,
                     &array[next], status);
                break;

            default:  /*  error trap for invalid column format */
                snprintf(message, FLEN_ERRMSG,
                   "Cannot read numbers from column %d which has format %s",
                    colnum, tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous read operation */
        {
	  dtemp = (double) next;
          if (hdutype > 0)
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from column %d (ffgcli).",
              dtemp+1, dtemp+ntodo, colnum);
          else
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from image (ffgcli).",
              dtemp+1, dtemp+ntodo);

          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum = elemnum + (ntodo * elemincre);

            if (elemnum >= repeat)  /* completed a row; start on later row */
            {
                rowincre = elemnum / repeat;
                rownum += rowincre;
                elemnum = elemnum - (rowincre * repeat);
            }
            else if (elemnum < 0) /* completed a row; start on a previous row */
            {
                rowincre = (-elemnum - 1) / repeat + 1;
                rownum -= rowincre;
                elemnum = (rowincre * repeat) + elemnum;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while reading FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi1i2(unsigned char *input, /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
            short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (short) input[ii];  /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MIN;
                }
                else if (dvalue > DSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MAX;
                }
                else
                    output[ii] = (short) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (short) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MIN;
                    }
                    else if (dvalue > DSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
                        output[ii] = (short) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi2i2(short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            memmove(output, input, ntodo * sizeof(short) );
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MIN;
                }
                else if (dvalue > DSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MAX;
                }
                else
                    output[ii] = (short) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MIN;
                    }
                    else if (dvalue > DSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
                        output[ii] = (short) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi4i2(INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < SHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MIN;
                }
                else if (input[ii] > SHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MAX;
                }
                else
                    output[ii] = (short) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MIN;
                }
                else if (dvalue > DSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MAX;
                }
                else
                    output[ii] = (short) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < SHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MIN;
                    }
                    else if (input[ii] > SHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
                        output[ii] = (short) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MIN;
                    }
                    else if (dvalue > DSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
                        output[ii] = (short) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi8i2(LONGLONG *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG tnull,       /* I - value of FITS TNULLn keyword if any */
            short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    ULONGLONG ulltemp;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                if (ulltemp > SHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MAX;
                }
                else
		{
                    output[ii] = (short) ulltemp;
		}
            }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < SHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MIN;
                }
                else if (input[ii] > SHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MAX;
                }
                else
                    output[ii] = (short) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MIN;
                }
                else if (dvalue > DSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MAX;
                }
                else
                    output[ii] = (short) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of subtracting 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
		{
                    ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                    if (ulltemp > SHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
		    {
                        output[ii] = (short) ulltemp;
		    }
                }
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < SHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MIN;
                    }
                    else if (input[ii] > SHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
                        output[ii] = (short) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MIN;
                    }
                    else if (dvalue > DSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
                        output[ii] = (short) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr4i2(float *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MIN;
                }
                else if (input[ii] > DSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MAX;
                }
                else
                    output[ii] = (short) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MIN;
                }
                else if (dvalue > DSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MAX;
                }
                else
                    output[ii] = (short) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr++;       /* point to MSBs */
#endif

        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MIN;
                    }
                    else if (input[ii] > DSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
                        output[ii] = (short) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  {
                    if (zero < DSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MIN;
                    }
                    else if (zero > DSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
                        output[ii] = (short) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MIN;
                    }
                    else if (dvalue > DSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
                        output[ii] = (short) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr8i2(double *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MIN;
                }
                else if (input[ii] > DSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MAX;
                }
                else
                    output[ii] = (short) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MIN;
                }
                else if (dvalue > DSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = SHRT_MAX;
                }
                else
                    output[ii] = (short) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr += 3;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MIN;
                    }
                    else if (input[ii] > DSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
                        output[ii] = (short) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  {
                    if (zero < DSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MIN;
                    }
                    else if (zero > DSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
                        output[ii] = (short) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MIN;
                    }
                    else if (dvalue > DSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = SHRT_MAX;
                    }
                    else
                        output[ii] = (short) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffstri2(char *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            long twidth,          /* I - width of each substring of chars    */
            double implipower,    /* I - power of 10 of implied decimal      */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            char  *snull,         /* I - value of FITS null string, if any   */
            short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file. Check
  for null values and do scaling if required. The nullcheck code value
  determines how any null values in the input array are treated. A null
  value is an input pixel that is equal to snull.  If nullcheck= 0, then
  no special checking for nulls is performed.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    int nullen;
    long ii;
    double dvalue;
    char *cstring, message[FLEN_ERRMSG];
    char *cptr, *tpos;
    char tempstore, chrzero = '0';
    double val, power;
    int exponent, sign, esign, decpt;

    nullen = strlen(snull);
    cptr = input;  /* pointer to start of input string */
    for (ii = 0; ii < ntodo; ii++)
    {
      cstring = cptr;
      /* temporarily insert a null terminator at end of the string */
      tpos = cptr + twidth;
      tempstore = *tpos;
      *tpos = 0;

      /* check if null value is defined, and if the    */
      /* column string is identical to the null string */
      if (snull[0] != ASCII_NULL_UNDEFINED && 
         !strncmp(snull, cptr, nullen) )
      {
        if (nullcheck)  
        {
          *anynull = 1;    
          if (nullcheck == 1)
            output[ii] = nullval;
          else
            nullarray[ii] = 1;
        }
        cptr += twidth;
      }
      else
      {
        /* value is not the null value, so decode it */
        /* remove any embedded blank characters from the string */

        decpt = 0;
        sign = 1;
        val  = 0.;
        power = 1.;
        exponent = 0;
        esign = 1;

        while (*cptr == ' ')               /* skip leading blanks */
           cptr++;

        if (*cptr == '-' || *cptr == '+')  /* check for leading sign */
        {
          if (*cptr == '-')
             sign = -1;

          cptr++;

          while (*cptr == ' ')         /* skip blanks between sign and value */
            cptr++;
        }

        while (*cptr >= '0' && *cptr <= '9')
        {
          val = val * 10. + *cptr - chrzero;  /* accumulate the value */
          cptr++;

          while (*cptr == ' ')         /* skip embedded blanks in the value */
            cptr++;
        }

        if (*cptr == '.' || *cptr == ',')       /* check for decimal point */
        {
          decpt = 1;       /* set flag to show there was a decimal point */
          cptr++;
          while (*cptr == ' ')         /* skip any blanks */
            cptr++;

          while (*cptr >= '0' && *cptr <= '9')
          {
            val = val * 10. + *cptr - chrzero;  /* accumulate the value */
            power = power * 10.;
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks in the value */
              cptr++;
          }
        }

        if (*cptr == 'E' || *cptr == 'D')  /* check for exponent */
        {
          cptr++;
          while (*cptr == ' ')         /* skip blanks */
              cptr++;
  
          if (*cptr == '-' || *cptr == '+')  /* check for exponent sign */
          {
            if (*cptr == '-')
               esign = -1;

            cptr++;

            while (*cptr == ' ')        /* skip blanks between sign and exp */
              cptr++;
          }

          while (*cptr >= '0' && *cptr <= '9')
          {
            exponent = exponent * 10 + *cptr - chrzero;  /* accumulate exp */
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks */
              cptr++;
          }
        }

        if (*cptr  != 0)  /* should end up at the null terminator */
        {
          snprintf(message, FLEN_ERRMSG,"Cannot read number from ASCII table");
          ffpmsg(message);
          snprintf(message, FLEN_ERRMSG,"Column field = %s.", cstring);
          ffpmsg(message);
          /* restore the char that was overwritten by the null */
          *tpos = tempstore;
          return(*status = BAD_C2D);
        }

        if (!decpt)  /* if no explicit decimal, use implied */
           power = implipower;

        dvalue = (sign * val / power) * pow(10., (double) (esign * exponent));

        dvalue = dvalue * scale + zero;   /* apply the scaling */

        if (dvalue < DSHRT_MIN)
        {
            *status = OVERFLOW_ERR;
            output[ii] = SHRT_MIN;
        }
        else if (dvalue > DSHRT_MAX)
        {
            *status = OVERFLOW_ERR;
            output[ii] = SHRT_MAX;
        }
        else
            output[ii] = (short) dvalue;
      }
      /* restore the char that was overwritten by the null */
      *tpos = tempstore;
    }
    return(*status);
}
cfitsio-3.47/getcolj.c0000644000225700000360000044140113464573432014207 0ustar  cagordonlhea/*  This file, getcolj.c, contains routines that read data elements from   */
/*  a FITS image or table, with long data type.                            */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffgpvj( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  nulval,     /* I - value for undefined pixels              */
            long  *array,     /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    char cdummy;
    int nullcheck = 1;
    long nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
         nullvalue = nulval;  /* set local variable */

        fits_read_compressed_pixels(fptr, TLONG, firstelem, nelem,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclj(fptr, 2, row, firstelem, nelem, 1, 1, nulval,
               array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpfj( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  *array,     /* O - array of values that are returned       */
            char *nularray,   /* O - array of null pixel flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Any undefined pixels in the returned array will be set = 0 and the 
  corresponding nularray value will be set = 1.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    int nullcheck = 2;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, TLONG, firstelem, nelem,
            nullcheck, NULL, array, nularray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclj(fptr, 2, row, firstelem, nelem, 1, 2, 0L,
               array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg2dj(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           long  nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           long  *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    /* call the 3D reading routine, with the 3rd dimension = 1 */

    ffg3dj(fptr, group, nulval, ncols, naxis2, naxis1, naxis2, 1, array, 
           anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg3dj(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           long  nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  nrows,     /* I - number of rows in each plane of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  naxis3,    /* I - FITS image NAXIS3 value                 */
           long  *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 3-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    long tablerow, ii, jj;
    char cdummy;
    int nullcheck = 1;
    long inc[] = {1,1,1};
    LONGLONG fpixel[] = {1,1,1}, nfits, narray;
    LONGLONG lpixel[3], nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        lpixel[0] = ncols;
        lpixel[1] = nrows;
        lpixel[2] = naxis3;
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TLONG, fpixel, lpixel, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
       /* all the image pixels are contiguous, so read all at once */
       ffgclj(fptr, 2, tablerow, 1, naxis1 * naxis2 * naxis3, 1, 1, nulval,
               array, &cdummy, anynul, status);
       return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to read */
    narray = 0;  /* next pixel in output array to be filled */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* reading naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffgclj(fptr, 2, tablerow, nfits, naxis1, 1, 1, nulval,
          &array[narray], &cdummy, anynul, status) > 0)
          return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsvj(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           long nulval,    /* I - value to set undefined pixels             */
           long *array,    /* O - array to be filled and returned           */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dir[9];
    long nelem, nultyp, ninc, numcol;
    LONGLONG felem, dsize[10], blcll[9], trcll[9];
    int hdutype, anyf;
    char ldummy, msg[FLEN_ERRMSG];
    int nullcheck = 1;
    long nullvalue;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvj is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TLONG, blcll, trcll, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 1;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
        dir[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        if (hdutype == IMAGE_HDU)
        {
           dir[ii] = -1;
        }
        else
        {
          snprintf(msg, FLEN_ERRMSG,"ffgsvj: illegal range specified for axis %ld", ii + 1);
          ffpmsg(msg);
          return(*status = BAD_PIX_NUM);
        }
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
      dsize[ii] = dsize[ii] * dir[ii];
    }
    dsize[naxis] = dsize[naxis] * dir[naxis];

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0]*dir[0] - str[0]*dir[0]) / inc[0] + 1;
      ninc = incr[0] * dir[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]*dir[8]; i8 <= stp[8]*dir[8]; i8 += incr[8])
     {
      for (i7 = str[7]*dir[7]; i7 <= stp[7]*dir[7]; i7 += incr[7])
      {
       for (i6 = str[6]*dir[6]; i6 <= stp[6]*dir[6]; i6 += incr[6])
       {
        for (i5 = str[5]*dir[5]; i5 <= stp[5]*dir[5]; i5 += incr[5])
        {
         for (i4 = str[4]*dir[4]; i4 <= stp[4]*dir[4]; i4 += incr[4])
         {
          for (i3 = str[3]*dir[3]; i3 <= stp[3]*dir[3]; i3 += incr[3])
          {
           for (i2 = str[2]*dir[2]; i2 <= stp[2]*dir[2]; i2 += incr[2])
           {
            for (i1 = str[1]*dir[1]; i1 <= stp[1]*dir[1]; i1 += incr[1])
            {

              felem=str[0] + (i1 - dir[1]) * dsize[1] + (i2 - dir[2]) * dsize[2] + 
                             (i3 - dir[3]) * dsize[3] + (i4 - dir[4]) * dsize[4] +
                             (i5 - dir[5]) * dsize[5] + (i6 - dir[6]) * dsize[6] +
                             (i7 - dir[7]) * dsize[7] + (i8 - dir[8]) * dsize[8];

              if ( ffgclj(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &ldummy, &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsfj(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           long *array,    /* O - array to be filled and returned           */
           char *flagval,  /* O - set to 1 if corresponding value is null   */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dsize[10];
    LONGLONG blcll[9], trcll[9];
    long felem, nelem, nultyp, ninc, numcol;
    long nulval = 0;
    int hdutype, anyf;
    char msg[FLEN_ERRMSG];
    int nullcheck = 2;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvj is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        fits_read_compressed_img(fptr, TLONG, blcll, trcll, inc,
            nullcheck, NULL, array, flagval, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 2;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvj: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgclj(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &flagval[i0], &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffggpj( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            long  firstelem,  /* I - first vector element to read (1 = 1st)  */
            long  nelem,      /* I - number of values to read                */
            long  *array,     /* O - array of values that are returned       */
            int  *status)     /* IO - error status                           */
/*
  Read an array of group parameters from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
*/
{
    long row;
    int idummy;
    char cdummy;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclj(fptr, 1, row, firstelem, nelem, 1, 1, 0L,
               array, &cdummy, &idummy, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvj(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           long  nulval,     /* I - value for null pixels                   */
           long *array,      /* O - array of values that are read           */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgclj(fptr, colnum, firstrow, firstelem, nelem, 1, 1, nulval,
           array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfj(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           long  *array,     /* O - array of values that are read           */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    long dummy = 0;

    ffgclj(fptr, colnum, firstrow, firstelem, nelem, 1, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgclj( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  elemincre,  /* I - pixel increment; e.g., 2 = every other  */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
            long  nulval,     /* I - value for null pixels if nultyp = 1     */
            long  *array,     /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer be a virtual column in a 1 or more grouped FITS primary
  array or image extension.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The output array of values will be converted from the datatype of the column 
  and will be scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    double scale, zero, power = 1., dtemp;
    int tcode, maxelem2, hdutype, xcode, decimals;
    long twidth, incre;
    long ii, xwidth, ntodo;
    int convert, nulcheck, readcheck = 0;
    LONGLONG repeat, startpos, elemnum, readptr, tnull;
    LONGLONG rowlen, rownum, remain, next, rowincre, maxelem;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value if reading from ASCII table  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    if (anynul)
        *anynul = 0;

    if (nultyp == 2)
        memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (elemincre < 0)
        readcheck = -1;  /* don't do range checking in this case */

    if (ffgcprll(fptr, colnum, firstrow, firstelem, nelem, readcheck, &scale, &zero,
         tform, &twidth, &tcode, &maxelem2, &startpos, &elemnum, &incre,
         &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0 )
         return(*status);
    maxelem = maxelem2;

    incre *= elemincre;   /* multiply incre to just get every nth pixel */

    if (tcode == TSTRING)    /* setup for ASCII tables */
    {
      /* get the number of implied decimal places if no explicit decmal point */
      ffasfm(tform, &xcode, &xwidth, &decimals, status); 
      for(ii = 0; ii < decimals; ii++)
        power *= 10.;
    }
    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (tcode%10 == 1 &&        /* if reading an integer column, and  */ 
            tnull == NULL_UNDEFINED) /* if a null value is not defined,    */
            nulcheck = 0;            /* then do not check for null values. */

    else if (tcode == TSHORT && (tnull > SHRT_MAX || tnull < SHRT_MIN) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TBYTE && (tnull > 255 || tnull < 0) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TSTRING && snull[0] == ASCII_NULL_UNDEFINED)
         nulcheck = 0;

    /*----------------------------------------------------------------------*/
    /*  If FITS column and output data array have same datatype, then we do */
    /*  not need to use a temporary buffer to store intermediate datatype.  */
    /*----------------------------------------------------------------------*/
    convert = 1;
    if ((tcode == TLONG) && (LONGSIZE == 32))  /* Special Case:                        */
    {                             /* no type convertion required, so read */
                                  /* data directly into output buffer.    */

        if (nelem < (LONGLONG)INT32_MAX/4) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/4;   
        }

        if (nulcheck == 0 && scale == 1. && zero == 0. )
            convert = 0;  /* no need to scale data or find nulls */
    }

    /*---------------------------------------------------------------------*/
    /*  Now read the pixels from the FITS column. If the column does not   */
    /*  have the same datatype as the output array, then we have to read   */
    /*  the raw values into a temporary buffer (of limited size).  In      */
    /*  the case of a vector colum read only 1 vector of values at a time  */
    /*  then skip to the next row if more values need to be read.          */
    /*  After reading the raw values, then call the fffXXYY routine to (1) */
    /*  test for undefined values, (2) convert the datatype if necessary,  */
    /*  and (3) scale the values by the FITS TSCALn and TZEROn linear      */
    /*  scaling parameters.                                                */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */

    while (remain)
    {
        /* limit the number of pixels to read at one time to the number that
           will fit in the buffer or to the number of pixels that remain in
           the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);
        if (elemincre >= 0)
        {
          ntodo = (long) minvalue(ntodo, ((repeat - elemnum - 1)/elemincre +1));
        }
        else
        {
          ntodo = (long) minvalue(ntodo, (elemnum/(-elemincre) +1));
        }

        readptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * (incre / elemincre));

        switch (tcode) 
        {
            case (TLONG):
	      if (LONGSIZE == 32) {
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) &array[next],
                       status);
                if (convert)
                    fffi4i4((INT32BIT *) &array[next], ntodo, scale, zero, 
                           nulcheck, (INT32BIT) tnull, nulval, &nularray[next], 
                            anynul, &array[next], status);
	      } else { /* case where sizeof(long) = 8 */
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) buffer,
                       status);
                if (convert)
                    fffi4i4((INT32BIT *) buffer, ntodo, scale, zero, 
                           nulcheck, (INT32BIT) tnull, nulval, &nularray[next], 
                            anynul, &array[next], status);
	      }

                break;
            case (TLONGLONG):
                ffgi8b(fptr, readptr, ntodo, incre, (long *) buffer, status);
                fffi8i4((LONGLONG *) buffer, ntodo, scale, zero, 
                           nulcheck, tnull, nulval, &nularray[next], 
                            anynul, &array[next], status);
                break;
            case (TBYTE):
                ffgi1b(fptr, readptr, ntodo, incre, (unsigned char *) buffer,
                       status);
                fffi1i4((unsigned char *) buffer, ntodo, scale, zero, nulcheck, 
                     (unsigned char) tnull, nulval, &nularray[next], anynul, 
                     &array[next], status);
                break;
            case (TSHORT):
                ffgi2b(fptr, readptr, ntodo, incre, (short  *) buffer, status);
                fffi2i4((short  *) buffer, ntodo, scale, zero, nulcheck, 
                      (short) tnull, nulval, &nularray[next], anynul, 
                      &array[next], status);
                break;
            case (TFLOAT):
                ffgr4b(fptr, readptr, ntodo, incre, (float  *) buffer, status);
                fffr4i4((float  *) buffer, ntodo, scale, zero, nulcheck, 
                       nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TDOUBLE):
                ffgr8b(fptr, readptr, ntodo, incre, (double *) buffer, status);
                fffr8i4((double *) buffer, ntodo, scale, zero, nulcheck, 
                          nulval, &nularray[next], anynul, 
                          &array[next], status);
                break;
            case (TSTRING):
                ffmbyt(fptr, readptr, REPORT_EOF, status);
       
                if (incre == twidth)    /* contiguous bytes */
                     ffgbyt(fptr, ntodo * twidth, buffer, status);
                else
                     ffgbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                               status);

                fffstri4((char *) buffer, ntodo, scale, zero, twidth, power,
                     nulcheck, snull, nulval, &nularray[next], anynul,
                     &array[next], status);
                break;

            default:  /*  error trap for invalid column format */
                snprintf(message, FLEN_ERRMSG,
                   "Cannot read numbers from column %d which has format %s",
                    colnum, tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous read operation */
        {
	  dtemp = (double) next;
          if (hdutype > 0)
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from column %d (ffgclj).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from image (ffgclj).",
              dtemp+1., dtemp+ntodo);

          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum = elemnum + (ntodo * elemincre);

            if (elemnum >= repeat)  /* completed a row; start on later row */
            {
                rowincre = elemnum / repeat;
                rownum += rowincre;
                elemnum = elemnum - (rowincre * repeat);
            }
            else if (elemnum < 0)  /* completed a row; start on a previous row */
            {
                rowincre = (-elemnum - 1) / repeat + 1;
                rownum -= rowincre;
                elemnum = (rowincre * repeat) + elemnum;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while reading FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi1i4(unsigned char *input, /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
            long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (long) input[ii];  /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MIN;
                }
                else if (dvalue > DLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MAX;
                }
                else
                    output[ii] = (long) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (long) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MIN;
                    }
                    else if (dvalue > DLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MAX;
                    }
                    else
                        output[ii] = (long) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi2i4(short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (long) input[ii];   /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MIN;
                }
                else if (dvalue > DLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MAX;
                }
                else
                    output[ii] = (long) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (long) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MIN;
                    }
                    else if (dvalue > DLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MAX;
                    }
                    else
                        output[ii] = (long) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi4i4(INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++) { 
                 output[ii] = (long) input[ii];   /* copy input to output */
	    }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MIN;
                }
                else if (dvalue > DLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MAX;
                }
                else
                    output[ii] = (long) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MIN;
                    }
                    else if (dvalue > DLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MAX;
                    }
                    else
                        output[ii] = (long) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi8i4(LONGLONG *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG tnull,       /* I - value of FITS TNULLn keyword if any */
            long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    ULONGLONG ulltemp;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                if (ulltemp > LONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MAX;
                }
                else
		{
                    output[ii] = (long) ulltemp;
		}
            }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < LONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MIN;
                }
                else if (input[ii] > LONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MAX;
                }
                else
                    output[ii] = (long) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MIN;
                }
                else if (dvalue > DLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MAX;
                }
                else
                    output[ii] = (long) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of subtracting 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
		{
                    ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                    if (ulltemp > LONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MAX;
                    }
                    else
		    {
                        output[ii] = (long) ulltemp;
		    }
                }
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < LONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MIN;
                    }
                    else if (input[ii] > LONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MAX;
                    }
                    else
                        output[ii] = (long) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MIN;
                    }
                    else if (dvalue > DLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MAX;
                    }
                    else
                        output[ii] = (long) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr4i4(float *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MIN;
                }
                else if (input[ii] > DLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MAX;
                }
                else
                    output[ii] = (long) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MIN;
                }
                else if (dvalue > DLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MAX;
                }
                else
                    output[ii] = (long) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr++;       /* point to MSBs */
#endif

        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MIN;
                    }
                    else if (input[ii] > DLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MAX;
                    }
                    else
                        output[ii] = (long) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  {
                    if (zero < DLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MIN;
                    }
                    else if (zero > DLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MAX;
                    }
                    else
                        output[ii] = (long) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MIN;
                    }
                    else if (dvalue > DLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MAX;
                    }
                    else
                        output[ii] = (long) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr8i4(double *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MIN;
                }
                else if (input[ii] > DLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MAX;
                }
                else
                    output[ii] = (long) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MIN;
                }
                else if (dvalue > DLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONG_MAX;
                }
                else
                    output[ii] = (long) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr += 3;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MIN;
                    }
                    else if (input[ii] > DLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MAX;
                    }
                    else
                        output[ii] = (long) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  {
                    if (zero < DLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MIN;
                    }
                    else if (zero > DLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MAX;
                    }
                    else
                        output[ii] = (long) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MIN;
                    }
                    else if (dvalue > DLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONG_MAX;
                    }
                    else
                        output[ii] = (long) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffstri4(char *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            long twidth,          /* I - width of each substring of chars    */
            double implipower,    /* I - power of 10 of implied decimal      */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            char  *snull,         /* I - value of FITS null string, if any   */
            long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file. Check
  for null values and do scaling if required. The nullcheck code value
  determines how any null values in the input array are treated. A null
  value is an input pixel that is equal to snull.  If nullcheck= 0, then
  no special checking for nulls is performed.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    int nullen;
    long ii;
    double dvalue;
    char *cstring, message[FLEN_ERRMSG];
    char *cptr, *tpos;
    char tempstore, chrzero = '0';
    double val, power;
    int exponent, sign, esign, decpt;

    nullen = strlen(snull);
    cptr = input;  /* pointer to start of input string */
    for (ii = 0; ii < ntodo; ii++)
    {
      cstring = cptr;
      /* temporarily insert a null terminator at end of the string */
      tpos = cptr + twidth;
      tempstore = *tpos;
      *tpos = 0;

      /* check if null value is defined, and if the    */
      /* column string is identical to the null string */
      if (snull[0] != ASCII_NULL_UNDEFINED && 
         !strncmp(snull, cptr, nullen) )
      {
        if (nullcheck)  
        {
          *anynull = 1;    
          if (nullcheck == 1)
            output[ii] = nullval;
          else
            nullarray[ii] = 1;
        }
        cptr += twidth;
      }
      else
      {
        /* value is not the null value, so decode it */
        /* remove any embedded blank characters from the string */

        decpt = 0;
        sign = 1;
        val  = 0.;
        power = 1.;
        exponent = 0;
        esign = 1;

        while (*cptr == ' ')               /* skip leading blanks */
           cptr++;

        if (*cptr == '-' || *cptr == '+')  /* check for leading sign */
        {
          if (*cptr == '-')
             sign = -1;

          cptr++;

          while (*cptr == ' ')         /* skip blanks between sign and value */
            cptr++;
        }

        while (*cptr >= '0' && *cptr <= '9')
        {
          val = val * 10. + *cptr - chrzero;  /* accumulate the value */
          cptr++;

          while (*cptr == ' ')         /* skip embedded blanks in the value */
            cptr++;
        }

        if (*cptr == '.' || *cptr == ',')    /* check for decimal point */
        {
          decpt = 1;       /* set flag to show there was a decimal point */
          cptr++;
          while (*cptr == ' ')         /* skip any blanks */
            cptr++;

          while (*cptr >= '0' && *cptr <= '9')
          {
            val = val * 10. + *cptr - chrzero;  /* accumulate the value */
            power = power * 10.;
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks in the value */
              cptr++;
          }
        }

        if (*cptr == 'E' || *cptr == 'D')  /* check for exponent */
        {
          cptr++;
          while (*cptr == ' ')         /* skip blanks */
              cptr++;
  
          if (*cptr == '-' || *cptr == '+')  /* check for exponent sign */
          {
            if (*cptr == '-')
               esign = -1;

            cptr++;

            while (*cptr == ' ')        /* skip blanks between sign and exp */
              cptr++;
          }

          while (*cptr >= '0' && *cptr <= '9')
          {
            exponent = exponent * 10 + *cptr - chrzero;  /* accumulate exp */
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks */
              cptr++;
          }
        }

        if (*cptr  != 0)  /* should end up at the null terminator */
        {
          snprintf(message, FLEN_ERRMSG,"Cannot read number from ASCII table");
          ffpmsg(message);
          snprintf(message, FLEN_ERRMSG,"Column field = %s.", cstring);
          ffpmsg(message);
          /* restore the char that was overwritten by the null */
          *tpos = tempstore;
          return(*status = BAD_C2D);
        }

        if (!decpt)  /* if no explicit decimal, use implied */
           power = implipower;

        dvalue = (sign * val / power) * pow(10., (double) (esign * exponent));

        dvalue = dvalue * scale + zero;   /* apply the scaling */

        if (dvalue < DLONG_MIN)
        {
            *status = OVERFLOW_ERR;
            output[ii] = LONG_MIN;
        }
        else if (dvalue > DLONG_MAX)
        {
            *status = OVERFLOW_ERR;
            output[ii] = LONG_MAX;
        }
        else
            output[ii] = (long) dvalue;
      }
      /* restore the char that was overwritten by the null */
      *tpos = tempstore;
    }
    return(*status);
}

/* ======================================================================== */
/*      the following routines support the 'long long' data type            */
/* ======================================================================== */

/*--------------------------------------------------------------------------*/
int ffgpvjj(fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            LONGLONG  nulval, /* I - value for undefined pixels              */
            LONGLONG  *array, /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    char cdummy;
    int nullcheck = 1;
    LONGLONG nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
         nullvalue = nulval;  /* set local variable */

        fits_read_compressed_pixels(fptr, TLONGLONG, firstelem, nelem,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcljj(fptr, 2, row, firstelem, nelem, 1, 1, nulval,
               array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpfjj(fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            LONGLONG  *array, /* O - array of values that are returned       */
            char *nularray,   /* O - array of null pixel flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Any undefined pixels in the returned array will be set = 0 and the 
  corresponding nularray value will be set = 1.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    int nullcheck = 2;
    LONGLONG dummy = 0;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, TLONGLONG, firstelem, nelem,
            nullcheck, NULL, array, nularray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcljj(fptr, 2, row, firstelem, nelem, 1, 2, dummy,
               array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg2djj(fitsfile *fptr, /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           LONGLONG nulval ,/* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  *array,/* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    /* call the 3D reading routine, with the 3rd dimension = 1 */

    ffg3djj(fptr, group, nulval, ncols, naxis2, naxis1, naxis2, 1, array, 
           anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg3djj(fitsfile *fptr, /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           LONGLONG nulval, /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  nrows,     /* I - number of rows in each plane of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  naxis3,    /* I - FITS image NAXIS3 value                 */
           LONGLONG  *array,/* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 3-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    long tablerow, ii, jj;
    char cdummy;
    int nullcheck = 1;
    long inc[] = {1,1,1};
    LONGLONG fpixel[] = {1,1,1}, nfits, narray;
    LONGLONG lpixel[3];
    LONGLONG nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        lpixel[0] = ncols;
        lpixel[1] = nrows;
        lpixel[2] = naxis3;
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TLONGLONG, fpixel, lpixel, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
       /* all the image pixels are contiguous, so read all at once */
       ffgcljj(fptr, 2, tablerow, 1, naxis1 * naxis2 * naxis3, 1, 1, nulval,
               array, &cdummy, anynul, status);
       return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to read */
    narray = 0;  /* next pixel in output array to be filled */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* reading naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffgcljj(fptr, 2, tablerow, nfits, naxis1, 1, 1, nulval,
          &array[narray], &cdummy, anynul, status) > 0)
          return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsvjj(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           LONGLONG nulval,/* I - value to set undefined pixels             */
           LONGLONG *array,/* O - array to be filled and returned           */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dir[9];
    long nelem, nultyp, ninc, numcol;
    LONGLONG felem, dsize[10], blcll[9], trcll[9];
    int hdutype, anyf;
    char ldummy, msg[FLEN_ERRMSG];
    int nullcheck = 1;
    LONGLONG nullvalue;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvj is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TLONGLONG, blcll, trcll, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 1;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
        dir[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        if (hdutype == IMAGE_HDU)
        {
           dir[ii] = -1;
        }
        else
        {
          snprintf(msg, FLEN_ERRMSG,"ffgsvj: illegal range specified for axis %ld", ii + 1);
          ffpmsg(msg);
          return(*status = BAD_PIX_NUM);
        }
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
      dsize[ii] = dsize[ii] * dir[ii];
    }
    dsize[naxis] = dsize[naxis] * dir[naxis];

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0]*dir[0] - str[0]*dir[0]) / inc[0] + 1;
      ninc = incr[0] * dir[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]*dir[8]; i8 <= stp[8]*dir[8]; i8 += incr[8])
     {
      for (i7 = str[7]*dir[7]; i7 <= stp[7]*dir[7]; i7 += incr[7])
      {
       for (i6 = str[6]*dir[6]; i6 <= stp[6]*dir[6]; i6 += incr[6])
       {
        for (i5 = str[5]*dir[5]; i5 <= stp[5]*dir[5]; i5 += incr[5])
        {
         for (i4 = str[4]*dir[4]; i4 <= stp[4]*dir[4]; i4 += incr[4])
         {
          for (i3 = str[3]*dir[3]; i3 <= stp[3]*dir[3]; i3 += incr[3])
          {
           for (i2 = str[2]*dir[2]; i2 <= stp[2]*dir[2]; i2 += incr[2])
           {
            for (i1 = str[1]*dir[1]; i1 <= stp[1]*dir[1]; i1 += incr[1])
            {

              felem=str[0] + (i1 - dir[1]) * dsize[1] + (i2 - dir[2]) * dsize[2] + 
                             (i3 - dir[3]) * dsize[3] + (i4 - dir[4]) * dsize[4] +
                             (i5 - dir[5]) * dsize[5] + (i6 - dir[6]) * dsize[6] +
                             (i7 - dir[7]) * dsize[7] + (i8 - dir[8]) * dsize[8];

              if ( ffgcljj(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &ldummy, &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsfjj(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           LONGLONG *array,/* O - array to be filled and returned           */
           char *flagval,  /* O - set to 1 if corresponding value is null   */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dsize[10];
    LONGLONG blcll[9], trcll[9];
    long felem, nelem, nultyp, ninc, numcol;
    LONGLONG nulval = 0;
    int hdutype, anyf;
    char msg[FLEN_ERRMSG];
    int nullcheck = 2;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvj is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

         fits_read_compressed_img(fptr, TLONGLONG, blcll, trcll, inc,
            nullcheck, NULL, array, flagval, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 2;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvj: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgcljj(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &flagval[i0], &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffggpjj(fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            long  firstelem,  /* I - first vector element to read (1 = 1st)  */
            long  nelem,      /* I - number of values to read                */
            LONGLONG  *array, /* O - array of values that are returned       */
            int  *status)     /* IO - error status                           */
/*
  Read an array of group parameters from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
*/
{
    long row;
    int idummy;
    char cdummy;
    LONGLONG dummy = 0;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcljj(fptr, 1, row, firstelem, nelem, 1, 1, dummy,
               array, &cdummy, &idummy, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvjj(fitsfile *fptr,  /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           LONGLONG  nulval, /* I - value for null pixels                   */
           LONGLONG *array,  /* O - array of values that are read           */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgcljj(fptr, colnum, firstrow, firstelem, nelem, 1, 1, nulval,
           array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfjj(fitsfile *fptr,  /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           LONGLONG  *array, /* O - array of values that are read           */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    LONGLONG dummy = 0;

    ffgcljj(fptr, colnum, firstrow, firstelem, nelem, 1, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcljj( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  elemincre,  /* I - pixel increment; e.g., 2 = every other  */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
            LONGLONG  nulval, /* I - value for null pixels if nultyp = 1     */
            LONGLONG  *array, /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer be a virtual column in a 1 or more grouped FITS primary
  array or image extension.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The output array of values will be converted from the datatype of the column 
  and will be scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    double scale, zero, power = 1., dtemp;
    int tcode, maxelem2, hdutype, xcode, decimals;
    long twidth, incre;
    long ii, xwidth, ntodo;
    int convert, nulcheck, readcheck = 0;
    LONGLONG repeat, startpos, elemnum, readptr, tnull;
    LONGLONG rowlen, rownum, remain, next, rowincre, maxelem;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value if reading from ASCII table  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    if (anynul)
        *anynul = 0;

    if (nultyp == 2)
        memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (elemincre < 0)
        readcheck = -1;  /* don't do range checking in this case */

    if (ffgcprll(fptr, colnum, firstrow, firstelem, nelem, readcheck, &scale, &zero,
         tform, &twidth, &tcode, &maxelem2, &startpos, &elemnum, &incre,
         &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0 )
         return(*status);
    maxelem = maxelem2;

    incre *= elemincre;   /* multiply incre to just get every nth pixel */

    if (tcode == TSTRING)    /* setup for ASCII tables */
    {
      /* get the number of implied decimal places if no explicit decmal point */
      ffasfm(tform, &xcode, &xwidth, &decimals, status); 
      for(ii = 0; ii < decimals; ii++)
        power *= 10.;
    }
    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (tcode%10 == 1 &&        /* if reading an integer column, and  */ 
            tnull == NULL_UNDEFINED) /* if a null value is not defined,    */
            nulcheck = 0;            /* then do not check for null values. */

    else if (tcode == TSHORT && (tnull > SHRT_MAX || tnull < SHRT_MIN) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TBYTE && (tnull > 255 || tnull < 0) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TSTRING && snull[0] == ASCII_NULL_UNDEFINED)
         nulcheck = 0;

    /*----------------------------------------------------------------------*/
    /*  If FITS column and output data array have same datatype, then we do */
    /*  not need to use a temporary buffer to store intermediate datatype.  */
    /*----------------------------------------------------------------------*/
    convert = 1;
    if (tcode == TLONGLONG)  /* Special Case:                        */
    {                             /* no type convertion required, so read */
                                  /* data directly into output buffer.    */

        if (nelem < (LONGLONG)INT32_MAX/8) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/8;
        }

        if (nulcheck == 0 && scale == 1. && zero == 0.)
            convert = 0;  /* no need to scale data or find nulls */
    }

    /*---------------------------------------------------------------------*/
    /*  Now read the pixels from the FITS column. If the column does not   */
    /*  have the same datatype as the output array, then we have to read   */
    /*  the raw values into a temporary buffer (of limited size).  In      */
    /*  the case of a vector colum read only 1 vector of values at a time  */
    /*  then skip to the next row if more values need to be read.          */
    /*  After reading the raw values, then call the fffXXYY routine to (1) */
    /*  test for undefined values, (2) convert the datatype if necessary,  */
    /*  and (3) scale the values by the FITS TSCALn and TZEROn linear      */
    /*  scaling parameters.                                                */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */

    while (remain)
    {
        /* limit the number of pixels to read at one time to the number that
           will fit in the buffer or to the number of pixels that remain in
           the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);
        if (elemincre >= 0)
        {
          ntodo = (long) minvalue(ntodo, ((repeat - elemnum - 1)/elemincre +1));
        }
        else
        {
          ntodo = (long) minvalue(ntodo, (elemnum/(-elemincre) +1));
        }

        readptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * (incre / elemincre));

        switch (tcode) 
        {
            case (TLONGLONG):
                ffgi8b(fptr, readptr, ntodo, incre, (long *) &array[next],
                       status);
                if (convert)
                    fffi8i8((LONGLONG *) &array[next], ntodo, scale, zero, 
                           nulcheck, tnull, nulval, &nularray[next], 
                           anynul, &array[next], status);
                break;
            case (TLONG):
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) buffer,
                       status);
                fffi4i8((INT32BIT *) buffer, ntodo, scale, zero, 
                        nulcheck, (INT32BIT) tnull, nulval, &nularray[next], 
                        anynul, &array[next], status);
                break;
            case (TBYTE):
                ffgi1b(fptr, readptr, ntodo, incre, (unsigned char *) buffer,
                       status);
                fffi1i8((unsigned char *) buffer, ntodo, scale, zero, nulcheck, 
                     (unsigned char) tnull, nulval, &nularray[next], anynul, 
                     &array[next], status);
                break;
            case (TSHORT):
                ffgi2b(fptr, readptr, ntodo, incre, (short  *) buffer, status);
                fffi2i8((short  *) buffer, ntodo, scale, zero, nulcheck, 
                      (short) tnull, nulval, &nularray[next], anynul, 
                      &array[next], status);
                break;
            case (TFLOAT):
                ffgr4b(fptr, readptr, ntodo, incre, (float  *) buffer, status);
                fffr4i8((float  *) buffer, ntodo, scale, zero, nulcheck, 
                       nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TDOUBLE):
                ffgr8b(fptr, readptr, ntodo, incre, (double *) buffer, status);
                fffr8i8((double *) buffer, ntodo, scale, zero, nulcheck, 
                          nulval, &nularray[next], anynul, 
                          &array[next], status);
                break;
            case (TSTRING):
                ffmbyt(fptr, readptr, REPORT_EOF, status);
       
                if (incre == twidth)    /* contiguous bytes */
                     ffgbyt(fptr, ntodo * twidth, buffer, status);
                else
                     ffgbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                               status);

                fffstri8((char *) buffer, ntodo, scale, zero, twidth, power,
                     nulcheck, snull, nulval, &nularray[next], anynul,
                     &array[next], status);
                break;

            default:  /*  error trap for invalid column format */
                snprintf(message,FLEN_ERRMSG, 
                   "Cannot read numbers from column %d which has format %s",
                    colnum, tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous read operation */
        {
	  dtemp = (double) next;
          if (hdutype > 0)
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from column %d (ffgclj).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from image (ffgclj).",
              dtemp+1., dtemp+ntodo);

          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum = elemnum + (ntodo * elemincre);

            if (elemnum >= repeat)  /* completed a row; start on later row */
            {
                rowincre = elemnum / repeat;
                rownum += rowincre;
                elemnum = elemnum - (rowincre * repeat);
            }
            else if (elemnum < 0)  /* completed a row; start on a previous row */
            {
                rowincre = (-elemnum - 1) / repeat + 1;
                rownum -= rowincre;
                elemnum = (rowincre * repeat) + elemnum;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while reading FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi1i8(unsigned char *input, /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
            LONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            LONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (LONGLONG) input[ii];  /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONGLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MIN;
                }
                else if (dvalue > DLONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MAX;
                }
                else
                    output[ii] = (LONGLONG) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (LONGLONG) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONGLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MIN;
                    }
                    else if (dvalue > DLONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MAX;
                    }
                    else
                        output[ii] = (LONGLONG) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi2i8(short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            LONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            LONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (LONGLONG) input[ii];   /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONGLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MIN;
                }
                else if (dvalue > DLONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MAX;
                }
                else
                    output[ii] = (LONGLONG) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (LONGLONG) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONGLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MIN;
                    }
                    else if (dvalue > DLONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MAX;
                    }
                    else
                        output[ii] = (LONGLONG) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi4i8(INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            LONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            LONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (LONGLONG) input[ii];   /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONGLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MIN;
                }
                else if (dvalue > DLONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MAX;
                }
                else
                    output[ii] = (LONGLONG) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (LONGLONG) input[ii];

            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONGLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MIN;
                    }
                    else if (dvalue > DLONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MAX;
                    }
                    else
                        output[ii] = (LONGLONG) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi8i8(LONGLONG *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG tnull,       /* I - value of FITS TNULLn keyword if any */
            LONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            LONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    ULONGLONG ulltemp;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                if (ulltemp > LONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MAX;
                }
                else
		{
                    output[ii] = (LONGLONG) ulltemp;
		}
            }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                output[ii] =  input[ii];   /* copy input to output */
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONGLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MIN;
                }
                else if (dvalue > DLONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MAX;
                }
                else
                    output[ii] = (LONGLONG) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of subtracting 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) { 
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
		{
                    ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                    if (ulltemp > LONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MAX;
                    }
                    else
		    {
                        output[ii] = (LONGLONG) ulltemp;
		    }
                }
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = input[ii];

            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONGLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MIN;
                    }
                    else if (dvalue > DLONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MAX;
                    }
                    else
                        output[ii] = (LONGLONG) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr4i8(float *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            LONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DLONGLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MIN;
                }
                else if (input[ii] > DLONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MAX;
                }
                else
                    output[ii] = (LONGLONG) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONGLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MIN;
                }
                else if (dvalue > DLONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MAX;
                }
                else
                    output[ii] = (LONGLONG) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr++;       /* point to MSBs */
#endif

        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DLONGLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MIN;
                    }
                    else if (input[ii] > DLONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MAX;
                    }
                    else
                        output[ii] = (LONGLONG) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  {
                    if (zero < DLONGLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MIN;
                    }
                    else if (zero > DLONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MAX;
                    }
                    else
                        output[ii] = (LONGLONG) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONGLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MIN;
                    }
                    else if (dvalue > DLONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MAX;
                    }
                    else
                        output[ii] = (LONGLONG) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr8i8(double *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            LONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DLONGLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MIN;
                }
                else if (input[ii] > DLONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MAX;
                }
                else
                    output[ii] = (LONGLONG) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONGLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MIN;
                }
                else if (dvalue > DLONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MAX;
                }
                else
                    output[ii] = (LONGLONG) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr += 3;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DLONGLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MIN;
                    }
                    else if (input[ii] > DLONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MAX;
                    }
                    else
                        output[ii] = (LONGLONG) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  {
                    if (zero < DLONGLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MIN;
                    }
                    else if (zero > DLONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MAX;
                    }
                    else
                        output[ii] = (LONGLONG) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONGLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MIN;
                    }
                    else if (dvalue > DLONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MAX;
                    }
                    else
                        output[ii] = (LONGLONG) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffstri8(char *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            long twidth,          /* I - width of each substring of chars    */
            double implipower,    /* I - power of 10 of implied decimal      */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            char  *snull,         /* I - value of FITS null string, if any   */
            LONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            LONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file. Check
  for null values and do scaling if required. The nullcheck code value
  determines how any null values in the input array are treated. A null
  value is an input pixel that is equal to snull.  If nullcheck= 0, then
  no special checking for nulls is performed.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    int nullen;
    long ii;
    double dvalue;
    char *cstring, message[FLEN_ERRMSG];
    char *cptr, *tpos;
    char tempstore, chrzero = '0';
    double val, power;
    int exponent, sign, esign, decpt;

    nullen = strlen(snull);
    cptr = input;  /* pointer to start of input string */
    for (ii = 0; ii < ntodo; ii++)
    {
      cstring = cptr;
      /* temporarily insert a null terminator at end of the string */
      tpos = cptr + twidth;
      tempstore = *tpos;
      *tpos = 0;

      /* check if null value is defined, and if the    */
      /* column string is identical to the null string */
      if (snull[0] != ASCII_NULL_UNDEFINED && 
         !strncmp(snull, cptr, nullen) )
      {
        if (nullcheck)  
        {
          *anynull = 1;    
          if (nullcheck == 1)
            output[ii] = nullval;
          else
            nullarray[ii] = 1;
        }
        cptr += twidth;
      }
      else
      {
        /* value is not the null value, so decode it */
        /* remove any embedded blank characters from the string */

        decpt = 0;
        sign = 1;
        val  = 0.;
        power = 1.;
        exponent = 0;
        esign = 1;

        while (*cptr == ' ')               /* skip leading blanks */
           cptr++;

        if (*cptr == '-' || *cptr == '+')  /* check for leading sign */
        {
          if (*cptr == '-')
             sign = -1;

          cptr++;

          while (*cptr == ' ')         /* skip blanks between sign and value */
            cptr++;
        }

        while (*cptr >= '0' && *cptr <= '9')
        {
          val = val * 10. + *cptr - chrzero;  /* accumulate the value */
          cptr++;

          while (*cptr == ' ')         /* skip embedded blanks in the value */
            cptr++;
        }

        if (*cptr == '.' || *cptr == ',')    /* check for decimal point */
        {
          decpt = 1;       /* set flag to show there was a decimal point */
          cptr++;
          while (*cptr == ' ')         /* skip any blanks */
            cptr++;

          while (*cptr >= '0' && *cptr <= '9')
          {
            val = val * 10. + *cptr - chrzero;  /* accumulate the value */
            power = power * 10.;
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks in the value */
              cptr++;
          }
        }

        if (*cptr == 'E' || *cptr == 'D')  /* check for exponent */
        {
          cptr++;
          while (*cptr == ' ')         /* skip blanks */
              cptr++;
  
          if (*cptr == '-' || *cptr == '+')  /* check for exponent sign */
          {
            if (*cptr == '-')
               esign = -1;

            cptr++;

            while (*cptr == ' ')        /* skip blanks between sign and exp */
              cptr++;
          }

          while (*cptr >= '0' && *cptr <= '9')
          {
            exponent = exponent * 10 + *cptr - chrzero;  /* accumulate exp */
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks */
              cptr++;
          }
        }

        if (*cptr  != 0)  /* should end up at the null terminator */
        {
          snprintf(message, FLEN_ERRMSG, "Cannot read number from ASCII table");
          ffpmsg(message);
          snprintf(message, FLEN_ERRMSG,"Column field = %s.", cstring);
          ffpmsg(message);
          /* restore the char that was overwritten by the null */
          *tpos = tempstore;
          return(*status = BAD_C2D);
        }

        if (!decpt)  /* if no explicit decimal, use implied */
           power = implipower;

        dvalue = (sign * val / power) * pow(10., (double) (esign * exponent));

        dvalue = dvalue * scale + zero;   /* apply the scaling */

        if (dvalue < DLONGLONG_MIN)
        {
            *status = OVERFLOW_ERR;
            output[ii] = LONGLONG_MIN;
        }
        else if (dvalue > DLONGLONG_MAX)
        {
            *status = OVERFLOW_ERR;
            output[ii] = LONGLONG_MAX;
        }
        else
            output[ii] = (LONGLONG) dvalue;
      }
      /* restore the char that was overwritten by the null */
      *tpos = tempstore;
    }
    return(*status);
}
cfitsio-3.47/getcolk.c0000644000225700000360000022177713464573432014224 0ustar  cagordonlhea/*  This file, getcolk.c, contains routines that read data elements from   */
/*  a FITS image or table, with 'int' data type.                           */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffgpvk( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            int   nulval,     /* I - value for undefined pixels              */
            int   *array,     /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    char cdummy;
    int nullcheck = 1;
    int nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
         nullvalue = nulval;  /* set local variable */

        fits_read_compressed_pixels(fptr, TINT, firstelem, nelem,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclk(fptr, 2, row, firstelem, nelem, 1, 1, nulval,
               array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpfk( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            int   *array,     /* O - array of values that are returned       */
            char *nularray,   /* O - array of null pixel flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Any undefined pixels in the returned array will be set = 0 and the 
  corresponding nularray value will be set = 1.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    int nullcheck = 2;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, TINT, firstelem, nelem,
            nullcheck, NULL, array, nularray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclk(fptr, 2, row, firstelem, nelem, 1, 2, 0L,
               array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg2dk(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           int  nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           int  *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    /* call the 3D reading routine, with the 3rd dimension = 1 */

    ffg3dk(fptr, group, nulval, ncols, naxis2, naxis1, naxis2, 1, array, 
           anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg3dk(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           int   nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  nrows,     /* I - number of rows in each plane of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  naxis3,    /* I - FITS image NAXIS3 value                 */
           int   *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 3-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    long tablerow, ii, jj;
    char cdummy;
    int nullcheck = 1;
    long inc[] = {1,1,1};
    LONGLONG fpixel[] = {1,1,1}, nfits, narray;
    LONGLONG lpixel[3];
    int nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        lpixel[0] = ncols;
        lpixel[1] = nrows;
        lpixel[2] = naxis3;
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TINT, fpixel, lpixel, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
       /* all the image pixels are contiguous, so read all at once */
       ffgclk(fptr, 2, tablerow, 1, naxis1 * naxis2 * naxis3, 1, 1, nulval,
               array, &cdummy, anynul, status);
       return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to read */
    narray = 0;  /* next pixel in output array to be filled */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* reading naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffgclk(fptr, 2, tablerow, nfits, naxis1, 1, 1, nulval,
          &array[narray], &cdummy, anynul, status) > 0)
          return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsvk(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           int  nulval,    /* I - value to set undefined pixels             */
           int  *array,    /* O - array to be filled and returned           */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dir[9];
    long nelem, nultyp, ninc, numcol;
    LONGLONG felem, dsize[10], blcll[9], trcll[9];
    int hdutype, anyf;
    char ldummy, msg[FLEN_ERRMSG];
    int nullcheck = 1;
    int nullvalue;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvj is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TINT, blcll, trcll, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 1;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
        dir[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        if (hdutype == IMAGE_HDU)
        {
           dir[ii] = -1;
        }
        else
        {
          snprintf(msg, FLEN_ERRMSG,"ffgsvk: illegal range specified for axis %ld", ii + 1);
          ffpmsg(msg);
          return(*status = BAD_PIX_NUM);
        }
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
      dsize[ii] = dsize[ii] * dir[ii];
    }
    dsize[naxis] = dsize[naxis] * dir[naxis];

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0]*dir[0] - str[0]*dir[0]) / inc[0] + 1;
      ninc = incr[0] * dir[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]*dir[8]; i8 <= stp[8]*dir[8]; i8 += incr[8])
     {
      for (i7 = str[7]*dir[7]; i7 <= stp[7]*dir[7]; i7 += incr[7])
      {
       for (i6 = str[6]*dir[6]; i6 <= stp[6]*dir[6]; i6 += incr[6])
       {
        for (i5 = str[5]*dir[5]; i5 <= stp[5]*dir[5]; i5 += incr[5])
        {
         for (i4 = str[4]*dir[4]; i4 <= stp[4]*dir[4]; i4 += incr[4])
         {
          for (i3 = str[3]*dir[3]; i3 <= stp[3]*dir[3]; i3 += incr[3])
          {
           for (i2 = str[2]*dir[2]; i2 <= stp[2]*dir[2]; i2 += incr[2])
           {
            for (i1 = str[1]*dir[1]; i1 <= stp[1]*dir[1]; i1 += incr[1])
            {

              felem=str[0] + (i1 - dir[1]) * dsize[1] + (i2 - dir[2]) * dsize[2] + 
                             (i3 - dir[3]) * dsize[3] + (i4 - dir[4]) * dsize[4] +
                             (i5 - dir[5]) * dsize[5] + (i6 - dir[6]) * dsize[6] +
                             (i7 - dir[7]) * dsize[7] + (i8 - dir[8]) * dsize[8];

              if ( ffgclk(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &ldummy, &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsfk(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           int  *array,    /* O - array to be filled and returned           */
           char *flagval,  /* O - set to 1 if corresponding value is null   */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dsize[10];
    LONGLONG blcll[9], trcll[9];
    long felem, nelem, nultyp, ninc, numcol;
    long nulval = 0;
    int hdutype, anyf;
    char msg[FLEN_ERRMSG];
    int nullcheck = 2;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvj is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        fits_read_compressed_img(fptr, TINT, blcll, trcll, inc,
            nullcheck, NULL, array, flagval, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 2;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvj: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgclk(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &flagval[i0], &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffggpk( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            long  firstelem,  /* I - first vector element to read (1 = 1st)  */
            long  nelem,      /* I - number of values to read                */
            int  *array,     /* O - array of values that are returned       */
            int  *status)     /* IO - error status                           */
/*
  Read an array of group parameters from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
*/
{
    long row;
    int idummy;
    char cdummy;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclk(fptr, 1, row, firstelem, nelem, 1, 1, 0L,
               array, &cdummy, &idummy, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvk(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           int   nulval,     /* I - value for null pixels                   */
           int  *array,      /* O - array of values that are read           */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgclk(fptr, colnum, firstrow, firstelem, nelem, 1, 1, nulval,
           array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfk(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           int   *array,     /* O - array of values that are read           */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    int dummy = 0;

    ffgclk(fptr, colnum, firstrow, firstelem, nelem, 1, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgclk( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  elemincre,  /* I - pixel increment; e.g., 2 = every other  */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
            int   nulval,     /* I - value for null pixels if nultyp = 1     */
            int  *array,      /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer be a virtual column in a 1 or more grouped FITS primary
  array or image extension.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The output array of values will be converted from the datatype of the column 
  and will be scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    double scale, zero, power, dtemp;
    int tcode, maxelem2, hdutype, xcode, decimals;
    long twidth, incre;
    long ii, xwidth, ntodo;
    int convert, nulcheck, readcheck = 0;
    LONGLONG repeat, startpos, elemnum, readptr, tnull;
    LONGLONG rowlen, rownum, remain, next, rowincre, maxelem;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value if reading from ASCII table  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    /* call the 'short' or 'long' version of this routine, if possible */
    if (sizeof(int) == sizeof(short))
        ffgcli(fptr, colnum, firstrow, firstelem, nelem, elemincre, nultyp,
              (short) nulval, (short *) array, nularray, anynul, status);
    else if (sizeof(int) == sizeof(long))
        ffgclj(fptr, colnum, firstrow, firstelem, nelem, elemincre, nultyp,
              (long) nulval, (long *) array, nularray, anynul, status);
    else
    {
    /*
      This is a special case: sizeof(int) is not equal to sizeof(short) or
      sizeof(long).  This occurs on Alpha OSF systems where short = 2 bytes,
      int = 4 bytes, and long = 8 bytes.
    */

    buffer = cbuff;
    power = 1.;

    if (anynul)
        *anynul = 0;

    if (nultyp == 2)
        memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (elemincre < 0)
        readcheck = -1;  /* don't do range checking in this case */

    if ( ffgcprll( fptr, colnum, firstrow, firstelem, nelem, readcheck, &scale, &zero,
         tform, &twidth, &tcode, &maxelem2, &startpos, &elemnum, &incre,
         &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0 )
         return(*status);
    maxelem = maxelem2;

    incre *= elemincre;   /* multiply incre to just get every nth pixel */

    if (tcode == TSTRING)    /* setup for ASCII tables */
    {
      /* get the number of implied decimal places if no explicit decmal point */
      ffasfm(tform, &xcode, &xwidth, &decimals, status); 
      for(ii = 0; ii < decimals; ii++)
        power *= 10.;
    }
    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (tcode%10 == 1 &&        /* if reading an integer column, and  */ 
            tnull == NULL_UNDEFINED) /* if a null value is not defined,    */
            nulcheck = 0;            /* then do not check for null values. */

    else if (tcode == TSHORT && (tnull > SHRT_MAX || tnull < SHRT_MIN) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TBYTE && (tnull > 255 || tnull < 0) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TSTRING && snull[0] == ASCII_NULL_UNDEFINED)
         nulcheck = 0;

    /*----------------------------------------------------------------------*/
    /*  If FITS column and output data array have same datatype, then we do */
    /*  not need to use a temporary buffer to store intermediate datatype.  */
    /*----------------------------------------------------------------------*/
    convert = 1;
    if (tcode == TLONG)           /* Special Case:                        */
    {                             /* no type convertion required, so read */
                                  /* data directly into output buffer.    */

        if (nelem < (LONGLONG)INT32_MAX/4) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/4;
        }

        if (nulcheck == 0 && scale == 1. && zero == 0.)
            convert = 0;  /* no need to scale data or find nulls */
    }

    /*---------------------------------------------------------------------*/
    /*  Now read the pixels from the FITS column. If the column does not   */
    /*  have the same datatype as the output array, then we have to read   */
    /*  the raw values into a temporary buffer (of limited size).  In      */
    /*  the case of a vector colum read only 1 vector of values at a time  */
    /*  then skip to the next row if more values need to be read.          */
    /*  After reading the raw values, then call the fffXXYY routine to (1) */
    /*  test for undefined values, (2) convert the datatype if necessary,  */
    /*  and (3) scale the values by the FITS TSCALn and TZEROn linear      */
    /*  scaling parameters.                                                */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */

    while (remain)
    {
        /* limit the number of pixels to read at one time to the number that
           will fit in the buffer or to the number of pixels that remain in
           the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);
        if (elemincre >= 0)
        {
          ntodo = (long) minvalue(ntodo, ((repeat - elemnum - 1)/elemincre +1));
        }
        else
        {
          ntodo = (long) minvalue(ntodo, (elemnum/(-elemincre) +1));
        }

        readptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * (incre / elemincre));

        switch (tcode) 
        {
            case (TLONG):
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) &array[next],
                       status);
                if (convert)
                    fffi4int((INT32BIT *) &array[next], ntodo, scale, zero, 
                             nulcheck, (INT32BIT) tnull, nulval,
                             &nularray[next], anynul, &array[next], status);
                break;
            case (TLONGLONG):

                ffgi8b(fptr, readptr, ntodo, incre, (long *) buffer, status);
                fffi8int( (LONGLONG *) buffer, ntodo, scale, zero, 
                           nulcheck, tnull, nulval, &nularray[next], 
                            anynul, &array[next], status);
                break;
            case (TBYTE):
                ffgi1b(fptr, readptr, ntodo, incre, (unsigned char *) buffer,
                       status);
                fffi1int((unsigned char *) buffer, ntodo, scale, zero, nulcheck,
                     (unsigned char) tnull, nulval, &nularray[next], anynul, 
                     &array[next], status);
                break;
            case (TSHORT):
                ffgi2b(fptr, readptr, ntodo, incre, (short  *) buffer, status);
                fffi2int((short  *) buffer, ntodo, scale, zero, nulcheck, 
                      (short) tnull, nulval, &nularray[next], anynul, 
                      &array[next], status);
                break;
            case (TFLOAT):
                ffgr4b(fptr, readptr, ntodo, incre, (float  *) buffer, status);
                fffr4int((float  *) buffer, ntodo, scale, zero, nulcheck, 
                       nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TDOUBLE):
                ffgr8b(fptr, readptr, ntodo, incre, (double *) buffer, status);
                fffr8int((double *) buffer, ntodo, scale, zero, nulcheck, 
                          nulval, &nularray[next], anynul, 
                          &array[next], status);
                break;
            case (TSTRING):
                ffmbyt(fptr, readptr, REPORT_EOF, status);
       
                if (incre == twidth)    /* contiguous bytes */
                     ffgbyt(fptr, ntodo * twidth, buffer, status);
                else
                     ffgbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                               status);

                fffstrint((char *) buffer, ntodo, scale, zero, twidth, power,
                     nulcheck, snull, nulval, &nularray[next], anynul,
                     &array[next], status);
                break;

            default:  /*  error trap for invalid column format */
                snprintf(message, FLEN_ERRMSG,
                   "Cannot read numbers from column %d which has format %s",
                    colnum, tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous read operation */
        {
	  dtemp = (double) next;
          if (hdutype > 0)
            snprintf(message, FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from column %d (ffgclk).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            snprintf(message, FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from image (ffgclk).",
              dtemp+1., dtemp+ntodo);

          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum = elemnum + (ntodo * elemincre);

            if (elemnum >= repeat)  /* completed a row; start on later row */
            {
                rowincre = elemnum / repeat;
                rownum += rowincre;
                elemnum = elemnum - (rowincre * repeat);
            }
            else if (elemnum < 0)  /* completed a row; start on a previous row */
            {
                rowincre = (-elemnum - 1) / repeat + 1;
                rownum -= rowincre;
                elemnum = (rowincre * repeat) + elemnum;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while reading FITS data.");
        *status = NUM_OVERFLOW;
    }

    }  /* end of DEC Alpha special case */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi1int(unsigned char *input,/* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
            int  nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            int  *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (int) input[ii];  /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MIN;
                }
                else if (dvalue > DINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MAX;
                }
                else
                    output[ii] = (int) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (int) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MIN;
                    }
                    else if (dvalue > DINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MAX;
                    }
                    else
                        output[ii] = (int) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi2int(short *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            int  nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            int  *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (int) input[ii];   /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MIN;
                }
                else if (dvalue > DINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MAX;
                }
                else
                    output[ii] = (int) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (int) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MIN;
                    }
                    else if (dvalue > DINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MAX;
                    }
                    else
                        output[ii] = (int) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi4int(INT32BIT *input,     /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            int  nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            int  *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (int) input[ii];   /* copy input to output */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MIN;
                }
                else if (dvalue > DINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MAX;
                }
                else
                    output[ii] = (int) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (int) input[ii];

            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MIN;
                    }
                    else if (dvalue > DINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MAX;
                    }
                    else
                        output[ii] = (int) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi8int(LONGLONG *input,     /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG tnull,       /* I - value of FITS TNULLn keyword if any */
            int  nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            int  *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    ULONGLONG ulltemp;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                if (ulltemp > INT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MAX;
                }
                else
		{
                    output[ii] = (int) ulltemp;
		}
            }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < INT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MIN;
                }
                else if (input[ii] > INT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MAX;
                }
                else
                    output[ii] = (int) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MIN;
                }
                else if (dvalue > DINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MAX;
                }
                else
                    output[ii] = (int) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of subtracting 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
		{
                    ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                    if (ulltemp > INT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MAX;
                    }
                    else
		    {
                        output[ii] = (int) ulltemp;
		    }
                }
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < INT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MIN;
                    }
                    else if (input[ii] > INT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MAX;
                    }
                    else
                        output[ii] = (int) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MIN;
                    }
                    else if (dvalue > DINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MAX;
                    }
                    else
                        output[ii] = (int) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr4int(float *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            int  nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            int  *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MIN;
                }
                else if (input[ii] > DINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MAX;
                }
                else
                    output[ii] = (int) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MIN;
                }
                else if (dvalue > DINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MAX;
                }
                else
                    output[ii] = (int) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr++;       /* point to MSBs */
#endif

        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MIN;
                    }
                    else if (input[ii] > DINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MAX;
                    }
                    else
                        output[ii] = (int) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  { 
                    if (zero < DINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MIN;
                    }
                    else if (zero > DINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MAX;
                    }
                    else
                      output[ii] = (int) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MIN;
                    }
                    else if (dvalue > DINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MAX;
                    }
                    else
                        output[ii] = (int) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr8int(double *input,       /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            int  nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            int  *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MIN;
                }
                else if (input[ii] > DINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MAX;
                }
                else
                    output[ii] = (int) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MIN;
                }
                else if (dvalue > DINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = INT_MAX;
                }
                else
                    output[ii] = (int) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr += 3;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MIN;
                    }
                    else if (input[ii] > DINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MAX;
                    }
                    else
                        output[ii] = (int) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  { 
                    if (zero < DINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MIN;
                    }
                    else if (zero > DINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MAX;
                    }
                    else
                      output[ii] = (int) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MIN;
                    }
                    else if (dvalue > DINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = INT_MAX;
                    }
                    else
                        output[ii] = (int) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffstrint(char *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            long twidth,          /* I - width of each substring of chars    */
            double implipower,    /* I - power of 10 of implied decimal      */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            char  *snull,         /* I - value of FITS null string, if any   */
            int nullval,          /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            int *output,          /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file. Check
  for null values and do scaling if required. The nullcheck code value
  determines how any null values in the input array are treated. A null
  value is an input pixel that is equal to snull.  If nullcheck= 0, then
  no special checking for nulls is performed.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    int nullen;
    long ii;
    double dvalue;
    char *cstring, message[FLEN_ERRMSG];
    char *cptr, *tpos;
    char tempstore, chrzero = '0';
    double val, power;
    int exponent, sign, esign, decpt;

    nullen = strlen(snull);
    cptr = input;  /* pointer to start of input string */
    for (ii = 0; ii < ntodo; ii++)
    {
      cstring = cptr;
      /* temporarily insert a null terminator at end of the string */
      tpos = cptr + twidth;
      tempstore = *tpos;
      *tpos = 0;

      /* check if null value is defined, and if the    */
      /* column string is identical to the null string */
      if (snull[0] != ASCII_NULL_UNDEFINED && 
         !strncmp(snull, cptr, nullen) )
      {
        if (nullcheck)  
        {
          *anynull = 1;    
          if (nullcheck == 1)
            output[ii] = nullval;
          else
            nullarray[ii] = 1;
        }
        cptr += twidth;
      }
      else
      {
        /* value is not the null value, so decode it */
        /* remove any embedded blank characters from the string */

        decpt = 0;
        sign = 1;
        val  = 0.;
        power = 1.;
        exponent = 0;
        esign = 1;

        while (*cptr == ' ')               /* skip leading blanks */
           cptr++;

        if (*cptr == '-' || *cptr == '+')  /* check for leading sign */
        {
          if (*cptr == '-')
             sign = -1;

          cptr++;

          while (*cptr == ' ')         /* skip blanks between sign and value */
            cptr++;
        }

        while (*cptr >= '0' && *cptr <= '9')
        {
          val = val * 10. + *cptr - chrzero;  /* accumulate the value */
          cptr++;

          while (*cptr == ' ')         /* skip embedded blanks in the value */
            cptr++;
        }

        if (*cptr == '.' || *cptr == ',')       /* check for decimal point */
        {
          decpt = 1;       /* set flag to show there was a decimal point */
          cptr++;
          while (*cptr == ' ')         /* skip any blanks */
            cptr++;

          while (*cptr >= '0' && *cptr <= '9')
          {
            val = val * 10. + *cptr - chrzero;  /* accumulate the value */
            power = power * 10.;
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks in the value */
              cptr++;
          }
        }

        if (*cptr == 'E' || *cptr == 'D')  /* check for exponent */
        {
          cptr++;
          while (*cptr == ' ')         /* skip blanks */
              cptr++;
  
          if (*cptr == '-' || *cptr == '+')  /* check for exponent sign */
          {
            if (*cptr == '-')
               esign = -1;

            cptr++;

            while (*cptr == ' ')        /* skip blanks between sign and exp */
              cptr++;
          }

          while (*cptr >= '0' && *cptr <= '9')
          {
            exponent = exponent * 10 + *cptr - chrzero;  /* accumulate exp */
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks */
              cptr++;
          }
        }

        if (*cptr  != 0)  /* should end up at the null terminator */
        {
          snprintf(message, FLEN_ERRMSG,"Cannot read number from ASCII table");
          ffpmsg(message);
          snprintf(message, FLEN_ERRMSG,"Column field = %s.", cstring);
          ffpmsg(message);
          /* restore the char that was overwritten by the null */
          *tpos = tempstore;
          return(*status = BAD_C2D);
        }

        if (!decpt)  /* if no explicit decimal, use implied */
           power = implipower;

        dvalue = (sign * val / power) * pow(10., (double) (esign * exponent));

        dvalue = dvalue * scale + zero;   /* apply the scaling */

        if (dvalue < DINT_MIN)
        {
            *status = OVERFLOW_ERR;
            output[ii] = INT_MIN;
        }
        else if (dvalue > DINT_MAX)
        {
            *status = OVERFLOW_ERR;
            output[ii] = INT_MAX;
        }
        else
            output[ii] = (long) dvalue;
      }
      /* restore the char that was overwritten by the null */
      *tpos = tempstore;
    }
    return(*status);
}
cfitsio-3.47/getcoll.c0000644000225700000360000005540213464573432014213 0ustar  cagordonlhea/*  This file, getcoll.c, contains routines that read data elements from   */
/*  a FITS image or table, with logical datatype.                          */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include "fitsio2.h"
/*--------------------------------------------------------------------------*/
int ffgcvl( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            char  nulval,     /* I - value for null pixels                   */
            char *array,      /* O - array of values                         */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of logical values from a column in the current FITS HDU.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgcll( fptr, colnum, firstrow, firstelem, nelem, 1, nulval, array,
            &cdummy, anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcl(  fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            char *array,      /* O - array of values                         */
            int  *status)     /* IO - error status                           */
/*
  !!!! THIS ROUTINE IS DEPRECATED AND SHOULD NOT BE USED !!!!!!
                  !!!! USE ffgcvl INSTEAD  !!!!!!
  Read an array of logical values from a column in the current FITS HDU.
  No checking for null values will be performed.
*/
{
    char nulval = 0;
    int anynul;

    ffgcvl( fptr, colnum, firstrow, firstelem, nelem, nulval, array,
            &anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfl( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            char *array,      /* O - array of values                         */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of logical values from a column in the current FITS HDU.
*/
{
    char nulval = 0;

    ffgcll( fptr, colnum, firstrow, firstelem, nelem, 2, nulval, array,
            nularray, anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcll( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG  firstelem, /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
            char nulval,      /* I - value for null pixels if nultyp = 1     */
            char *array,      /* O - array of values                         */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of logical values from a column in the current FITS HDU.
*/
{
    double dtemp;
    int tcode, maxelem, hdutype, ii, nulcheck;
    long twidth, incre;
    long ntodo;
    LONGLONG repeat, startpos, elemnum, readptr, tnull, rowlen, rownum, remain, next;
    double scale, zero;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value  */
    unsigned char buffer[DBUFFSIZE], *buffptr;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    if (anynul)
       *anynul = 0;

    if (nultyp == 2)      
       memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 0, &scale, &zero,
        tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

    if (tcode != TLOGICAL)   
        return(*status = NOT_LOGICAL_COL);
 
    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default, check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    /*---------------------------------------------------------------------*/
    /*  Now read the logical values from the FITS column.                  */
    /*---------------------------------------------------------------------*/

    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */
    ntodo = (long) remain;           /* max number of elements to read at one time */

    while (ntodo)
    {
      /*
         limit the number of pixels to read at one time to the number that
         remain in the current vector.    
      */
      ntodo = (long) minvalue(ntodo, maxelem);      
      ntodo = (long) minvalue(ntodo, (repeat - elemnum));

      readptr = startpos + (rowlen * rownum) + (elemnum * incre);

      ffgi1b(fptr, readptr, ntodo, incre, buffer, status);

      /* convert from T or F to 1 or 0 */
      buffptr = buffer;
      for (ii = 0; ii < ntodo; ii++, next++, buffptr++)
      {
        if (*buffptr == 'T')
          array[next] = 1;
        else if (*buffptr =='F') 
          array[next] = 0;
        else if (*buffptr == 0)
        {
          array[next] = nulval;  /* set null values to input nulval */
          if (anynul)
              *anynul = 1;

          if (nulcheck == 2)
          {
            nularray[next] = 1;  /* set null flags */
          }
        }
        else  /* some other illegal character; return the char value */
        {
          if (*buffptr == 1) {
            /* this is an unfortunate case where the illegal value is the same
               as what we set True values to, so set the value to the character '1'
               instead, which has ASCII value 49.  */
            array[next] = 49;
          } else {
            array[next] = (char) *buffptr;
          }
        }
      }

      if (*status > 0)  /* test for error during previous read operation */
      {
	dtemp = (double) next;
        snprintf(message,FLEN_ERRMSG,
          "Error reading elements %.0f thruough %.0f of logical array (ffgcl).",
           dtemp+1., dtemp + ntodo);
        ffpmsg(message);
        return(*status);
      }

      /*--------------------------------------------*/
      /*  increment the counters for the next loop  */
      /*--------------------------------------------*/
      remain -= ntodo;
      if (remain)
      {
        elemnum += ntodo;

        if (elemnum == repeat)  /* completed a row; start on later row */
          {
            elemnum = 0;
            rownum++;
          }
      }
      ntodo = (long) remain;  /* this is the maximum number to do in next loop */

    }  /*  End of main while Loop  */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcx(  fitsfile *fptr,  /* I - FITS file pointer                       */
            int   colnum,    /* I - number of column to write (1 = 1st col) */
            LONGLONG  frow,      /* I - first row to write (1 = 1st row)        */
            LONGLONG  fbit,      /* I - first bit to write (1 = 1st)            */
            LONGLONG  nbit,      /* I - number of bits to write                 */
            char *larray,    /* O - array of logicals corresponding to bits */
            int  *status)    /* IO - error status                           */
/*
  read an array of logical values from a specified bit or byte
  column of the binary table.    larray is set = TRUE, if the corresponding
  bit = 1, otherwise it is set to FALSE.
  The binary table column being read from must have datatype 'B' or 'X'. 
*/
{
    LONGLONG bstart;
    long offset, ndone, ii, repeat, bitloc, fbyte;
    LONGLONG  rstart, estart;
    int tcode, descrp;
    unsigned char cbuff;
    static unsigned char onbit[8] = {128,  64,  32,  16,   8,   4,   2,   1};
    tcolumn *colptr;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /*  check input parameters */
    if (nbit < 1)
        return(*status);
    else if (frow < 1)
        return(*status = BAD_ROW_NUM);
    else if (fbit < 1)
        return(*status = BAD_ELEM_NUM);

    /* position to the correct HDU */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    /* rescan header if data structure is undefined */
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
        if ( ffrdef(fptr, status) > 0)               
            return(*status);

    fbyte = (long) ((fbit + 7) / 8);
    bitloc = (long) (fbit - 1 - ((fbit - 1) / 8 * 8));
    ndone = 0;
    rstart = frow - 1;
    estart = fbyte - 1;

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode = colptr->tdatatype;

    if (abs(tcode) > TBYTE)
        return(*status = NOT_LOGICAL_COL); /* not correct datatype column */

    if (tcode > 0)
    {
        descrp = FALSE;  /* not a variable length descriptor column */
        /* N.B: REPEAT is the number of bytes, not number of bits */
        repeat = (long) colptr->trepeat;

        if (tcode == TBIT)
            repeat = (repeat + 7) / 8;  /* convert from bits to bytes */

        if (fbyte > repeat)
            return(*status = BAD_ELEM_NUM);

        /* calc the i/o pointer location to start of sequence of pixels */
        bstart = (fptr->Fptr)->datastart + ((fptr->Fptr)->rowlength * rstart) +
               colptr->tbcol + estart;
    }
    else
    {
        descrp = TRUE;  /* a variable length descriptor column */
        /* only bit arrays (tform = 'X') are supported for variable */
        /* length arrays.  REPEAT is the number of BITS in the array. */

        ffgdes(fptr, colnum, frow, &repeat, &offset, status);

        if (tcode == -TBIT)
            repeat = (repeat + 7) / 8;

        if ((fbit + nbit + 6) / 8 > repeat)
            return(*status = BAD_ELEM_NUM);

        /* calc the i/o pointer location to start of sequence of pixels */
        bstart = (fptr->Fptr)->datastart + offset + (fptr->Fptr)->heapstart + estart;
    }

    /* move the i/o pointer to the start of the pixel sequence */
    if (ffmbyt(fptr, bstart, REPORT_EOF, status) > 0)
        return(*status);

    /* read the next byte */
    while (1)
    {
      if (ffgbyt(fptr, 1, &cbuff, status) > 0)
        return(*status);

      for (ii = bitloc; (ii < 8) && (ndone < nbit); ii++, ndone++)
      {
        if(cbuff & onbit[ii])       /* test if bit is set */
          larray[ndone] = TRUE;
        else
          larray[ndone] = FALSE;
      }

      if (ndone == nbit)   /* finished all the bits */
        return(*status);

      /* not done, so get the next byte */
      if (!descrp)
      {
        estart++;
        if (estart == repeat) 
        {
          /* move the i/o pointer to the next row of pixels */
          estart = 0;
          rstart = rstart + 1;
          bstart = (fptr->Fptr)->datastart + ((fptr->Fptr)->rowlength * rstart) +
               colptr->tbcol;

          ffmbyt(fptr, bstart, REPORT_EOF, status);
        }
      }
      bitloc = 0;
    }
}
/*--------------------------------------------------------------------------*/
int ffgcxui(fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG  nrows,      /* I - no. of rows to read                     */
            long  input_first_bit, /* I - first bit to read (1 = 1st)        */
            int   input_nbits,     /* I - number of bits to read (<= 32)     */
            unsigned short *array, /* O - array of integer values            */
            int  *status)     /* IO - error status                           */
/*
  Read a consecutive string of bits from an 'X' or 'B' column and
  interprete them as an unsigned integer.  The number of bits must be
  less than or equal to 16 or the total number of bits in the column, 
  which ever is less.
*/
{
    int ii, firstbit, nbits, bytenum, startbit, numbits, endbit;
    int firstbyte, lastbyte, nbytes, rshift, lshift;
    unsigned short colbyte[5];
    tcolumn *colptr;
    char message[FLEN_ERRMSG];

    if (*status > 0 || nrows == 0)
        return(*status);

    /*  check input parameters */
    if (firstrow < 1)
    {
          snprintf(message,FLEN_ERRMSG, "Starting row number is less than 1: %ld (ffgcxui)",
                (long) firstrow);
          ffpmsg(message);
          return(*status = BAD_ROW_NUM);
    }
    else if (input_first_bit < 1)
    {
          snprintf(message,FLEN_ERRMSG, "Starting bit number is less than 1: %ld (ffgcxui)",
                input_first_bit);
          ffpmsg(message);
          return(*status = BAD_ELEM_NUM);
    }
    else if (input_nbits > 16)
    {
          snprintf(message, FLEN_ERRMSG,"Number of bits to read is > 16: %d (ffgcxui)",
                input_nbits);
          ffpmsg(message);
          return(*status = BAD_ELEM_NUM);
    }

    /* position to the correct HDU */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    /* rescan header if data structure is undefined */
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
        if ( ffrdef(fptr, status) > 0)               
            return(*status);

    if ((fptr->Fptr)->hdutype != BINARY_TBL)
    {
        ffpmsg("This is not a binary table extension (ffgcxui)");
        return(*status = NOT_BTABLE);
    }

    if (colnum > (fptr->Fptr)->tfield)
    {
      snprintf(message, FLEN_ERRMSG,"Specified column number is out of range: %d (ffgcxui)",
                colnum);
        ffpmsg(message);
        snprintf(message, FLEN_ERRMSG,"  There are %d columns in this table.",
                (fptr->Fptr)->tfield );
        ffpmsg(message);

        return(*status = BAD_COL_NUM);
    }       

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    if (abs(colptr->tdatatype) > TBYTE)
    {
        ffpmsg("Can only read bits from X or B type columns. (ffgcxui)");
        return(*status = NOT_LOGICAL_COL); /* not correct datatype column */
    }

    firstbyte = (input_first_bit - 1              ) / 8 + 1;
    lastbyte  = (input_first_bit + input_nbits - 2) / 8 + 1;
    nbytes = lastbyte - firstbyte + 1;

    if (colptr->tdatatype == TBIT && 
        input_first_bit + input_nbits - 1 > (long) colptr->trepeat)
    {
        ffpmsg("Too many bits. Tried to read past width of column (ffgcxui)");
        return(*status = BAD_ELEM_NUM);
    }
    else if (colptr->tdatatype == TBYTE && lastbyte > (long) colptr->trepeat)
    {
        ffpmsg("Too many bits. Tried to read past width of column (ffgcxui)");
        return(*status = BAD_ELEM_NUM);
    }

    for (ii = 0; ii < nrows; ii++)
    {
        /* read the relevant bytes from the row */
        if (ffgcvui(fptr, colnum, firstrow+ii, firstbyte, nbytes, 0, 
               colbyte, NULL, status) > 0)
        {
             ffpmsg("Error reading bytes from column (ffgcxui)");
             return(*status);
        }

        firstbit = (input_first_bit - 1) % 8; /* modulus operator */
        nbits = input_nbits;

        array[ii] = 0;

        /* select and shift the bits from each byte into the output word */
        while(nbits)
        {
            bytenum = firstbit / 8;

            startbit = firstbit % 8;  
            numbits = minvalue(nbits, 8 - startbit);
            endbit = startbit + numbits - 1;

            rshift = 7 - endbit;
            lshift = nbits - numbits;

            array[ii] = ((colbyte[bytenum] >> rshift) << lshift) | array[ii];

            nbits -= numbits;
            firstbit += numbits;
        }
    }

    return(*status);
}

/*--------------------------------------------------------------------------*/
int ffgcxuk(fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG  nrows,      /* I - no. of rows to read                     */
            long  input_first_bit, /* I - first bit to read (1 = 1st)        */
            int   input_nbits,     /* I - number of bits to read (<= 32)     */
            unsigned int *array,   /* O - array of integer values            */
            int  *status)     /* IO - error status                           */
/*
  Read a consecutive string of bits from an 'X' or 'B' column and
  interprete them as an unsigned integer.  The number of bits must be
  less than or equal to 32 or the total number of bits in the column, 
  which ever is less.
*/
{
    int ii, firstbit, nbits, bytenum, startbit, numbits, endbit;
    int firstbyte, lastbyte, nbytes, rshift, lshift;
    unsigned int colbyte[5];
    tcolumn *colptr;
    char message[FLEN_ERRMSG];

    if (*status > 0 || nrows == 0)
        return(*status);

    /*  check input parameters */
    if (firstrow < 1)
    {
          snprintf(message, FLEN_ERRMSG,"Starting row number is less than 1: %ld (ffgcxuk)",
                (long) firstrow);
          ffpmsg(message);
          return(*status = BAD_ROW_NUM);
    }
    else if (input_first_bit < 1)
    {
          snprintf(message, FLEN_ERRMSG,"Starting bit number is less than 1: %ld (ffgcxuk)",
                input_first_bit);
          ffpmsg(message);
          return(*status = BAD_ELEM_NUM);
    }
    else if (input_nbits > 32)
    {
          snprintf(message, FLEN_ERRMSG,"Number of bits to read is > 32: %d (ffgcxuk)",
                input_nbits);
          ffpmsg(message);
          return(*status = BAD_ELEM_NUM);
    }

    /* position to the correct HDU */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    /* rescan header if data structure is undefined */
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
        if ( ffrdef(fptr, status) > 0)               
            return(*status);

    if ((fptr->Fptr)->hdutype != BINARY_TBL)
    {
        ffpmsg("This is not a binary table extension (ffgcxuk)");
        return(*status = NOT_BTABLE);
    }

    if (colnum > (fptr->Fptr)->tfield)
    {
      snprintf(message, FLEN_ERRMSG,"Specified column number is out of range: %d (ffgcxuk)",
                colnum);
        ffpmsg(message);
        snprintf(message, FLEN_ERRMSG,"  There are %d columns in this table.",
                (fptr->Fptr)->tfield );
        ffpmsg(message);

        return(*status = BAD_COL_NUM);
    }       

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    if (abs(colptr->tdatatype) > TBYTE)
    {
        ffpmsg("Can only read bits from X or B type columns. (ffgcxuk)");
        return(*status = NOT_LOGICAL_COL); /* not correct datatype column */
    }

    firstbyte = (input_first_bit - 1              ) / 8 + 1;
    lastbyte  = (input_first_bit + input_nbits - 2) / 8 + 1;
    nbytes = lastbyte - firstbyte + 1;

    if (colptr->tdatatype == TBIT && 
        input_first_bit + input_nbits - 1 > (long) colptr->trepeat)
    {
        ffpmsg("Too many bits. Tried to read past width of column (ffgcxuk)");
        return(*status = BAD_ELEM_NUM);
    }
    else if (colptr->tdatatype == TBYTE && lastbyte > (long) colptr->trepeat)
    {
        ffpmsg("Too many bits. Tried to read past width of column (ffgcxuk)");
        return(*status = BAD_ELEM_NUM);
    }

    for (ii = 0; ii < nrows; ii++)
    {
        /* read the relevant bytes from the row */
        if (ffgcvuk(fptr, colnum, firstrow+ii, firstbyte, nbytes, 0, 
               colbyte, NULL, status) > 0)
        {
             ffpmsg("Error reading bytes from column (ffgcxuk)");
             return(*status);
        }

        firstbit = (input_first_bit - 1) % 8; /* modulus operator */
        nbits = input_nbits;

        array[ii] = 0;

        /* select and shift the bits from each byte into the output word */
        while(nbits)
        {
            bytenum = firstbit / 8;

            startbit = firstbit % 8;  
            numbits = minvalue(nbits, 8 - startbit);
            endbit = startbit + numbits - 1;

            rshift = 7 - endbit;
            lshift = nbits - numbits;

            array[ii] = ((colbyte[bytenum] >> rshift) << lshift) | array[ii];

            nbits -= numbits;
            firstbit += numbits;
        }
    }

    return(*status);
}
cfitsio-3.47/getcolsb.c0000644000225700000360000022704313464573432014366 0ustar  cagordonlhea/*  This file, getcolsb.c, contains routines that read data elements from   */
/*  a FITS image or table, with signed char (signed byte) data type.        */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffgpvsb(fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            signed char nulval, /* I - value for undefined pixels            */
            signed char *array, /* O - array of values that are returned     */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    char cdummy;
    int nullcheck = 1;
    signed char nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
         nullvalue = nulval;  /* set local variable */

        fits_read_compressed_pixels(fptr, TSBYTE, firstelem, nelem,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclsb(fptr, 2, row, firstelem, nelem, 1, 1, nulval,
               array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpfsb(fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            signed char *array, /* O - array of values that are returned     */
            char *nularray,   /* O - array of null pixel flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Any undefined pixels in the returned array will be set = 0 and the 
  corresponding nularray value will be set = 1.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    int nullcheck = 2;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, TSBYTE, firstelem, nelem,
            nullcheck, NULL, array, nularray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclsb(fptr, 2, row, firstelem, nelem, 1, 2, 0,
               array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg2dsb(fitsfile *fptr, /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           signed char nulval,   /* set undefined pixels equal to this     */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           signed char *array,   /* O - array to be filled and returned    */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    /* call the 3D reading routine, with the 3rd dimension = 1 */

    ffg3dsb(fptr, group, nulval, ncols, naxis2, naxis1, naxis2, 1, array, 
           anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg3dsb(fitsfile *fptr, /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           signed char nulval,   /* set undefined pixels equal to this     */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  nrows,     /* I - number of rows in each plane of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  naxis3,    /* I - FITS image NAXIS3 value                 */
           signed char *array,   /* O - array to be filled and returned    */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 3-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    long tablerow, ii, jj;
    LONGLONG  nfits, narray;
    char cdummy;
    int  nullcheck = 1;
    long inc[] = {1,1,1};
    LONGLONG fpixel[] = {1,1,1};
    LONGLONG lpixel[3];
    signed char nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        lpixel[0] = ncols;
        lpixel[1] = nrows;
        lpixel[2] = naxis3;
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TSBYTE, fpixel, lpixel, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
       /* all the image pixels are contiguous, so read all at once */
       ffgclsb(fptr, 2, tablerow, 1, naxis1 * naxis2 * naxis3, 1, 1, nulval,
               array, &cdummy, anynul, status);
       return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to read */
    narray = 0;  /* next pixel in output array to be filled */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* reading naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffgclsb(fptr, 2, tablerow, nfits, naxis1, 1, 1, nulval,
          &array[narray], &cdummy, anynul, status) > 0)
          return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsvsb(fitsfile *fptr, /* I - FITS file pointer                        */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           signed char nulval, /* I - value to set undefined pixels         */
           signed char *array, /* O - array to be filled and returned       */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii, i0, i1, i2, i3, i4, i5, i6, i7, i8, row, rstr, rstp, rinc;
    long str[9], stp[9], incr[9], dir[9];
    long nelem, nultyp, ninc, numcol;
    LONGLONG felem, dsize[10], blcll[9], trcll[9];
    int hdutype, anyf;
    char ldummy, msg[FLEN_ERRMSG];
    int  nullcheck = 1;
    signed char nullvalue;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvsb is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TSBYTE, blcll, trcll, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 1;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
        dir[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        if (hdutype == IMAGE_HDU)
        {
           dir[ii] = -1;
        }
        else
        {
          snprintf(msg, FLEN_ERRMSG,"ffgsvsb: illegal range specified for axis %ld", ii + 1);
          ffpmsg(msg);
          return(*status = BAD_PIX_NUM);
        }
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
      dsize[ii] = dsize[ii] * dir[ii];
    }
    dsize[naxis] = dsize[naxis] * dir[naxis];

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0]*dir[0] - str[0]*dir[0]) / inc[0] + 1;
      ninc = incr[0] * dir[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]*dir[8]; i8 <= stp[8]*dir[8]; i8 += incr[8])
     {
      for (i7 = str[7]*dir[7]; i7 <= stp[7]*dir[7]; i7 += incr[7])
      {
       for (i6 = str[6]*dir[6]; i6 <= stp[6]*dir[6]; i6 += incr[6])
       {
        for (i5 = str[5]*dir[5]; i5 <= stp[5]*dir[5]; i5 += incr[5])
        {
         for (i4 = str[4]*dir[4]; i4 <= stp[4]*dir[4]; i4 += incr[4])
         {
          for (i3 = str[3]*dir[3]; i3 <= stp[3]*dir[3]; i3 += incr[3])
          {
           for (i2 = str[2]*dir[2]; i2 <= stp[2]*dir[2]; i2 += incr[2])
           {
            for (i1 = str[1]*dir[1]; i1 <= stp[1]*dir[1]; i1 += incr[1])
            {

              felem=str[0] + (i1 - dir[1]) * dsize[1] + (i2 - dir[2]) * dsize[2] + 
                             (i3 - dir[3]) * dsize[3] + (i4 - dir[4]) * dsize[4] +
                             (i5 - dir[5]) * dsize[5] + (i6 - dir[6]) * dsize[6] +
                             (i7 - dir[7]) * dsize[7] + (i8 - dir[8]) * dsize[8];

              if ( ffgclsb(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &ldummy, &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsfsb(fitsfile *fptr, /* I - FITS file pointer                        */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           signed char *array,   /* O - array to be filled and returned     */
           char *flagval,  /* O - set to 1 if corresponding value is null   */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dsize[10];
    LONGLONG blcll[9], trcll[9];
    long felem, nelem, nultyp, ninc, numcol;
    int hdutype, anyf;
    signed char nulval = 0;
    char msg[FLEN_ERRMSG];
    int  nullcheck = 2;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvsb is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        fits_read_compressed_img(fptr, TSBYTE, blcll, trcll, inc,
            nullcheck, NULL, array, flagval, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 2;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvsb: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgclsb(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &flagval[i0], &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffggpsb( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            long  firstelem,  /* I - first vector element to read (1 = 1st)  */
            long  nelem,      /* I - number of values to read                */
            signed char *array,   /* O - array of values that are returned   */
            int  *status)     /* IO - error status                           */
/*
  Read an array of group parameters from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
*/
{
    long row;
    int idummy;
    char cdummy;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclsb(fptr, 1, row, firstelem, nelem, 1, 1, 0,
               array, &cdummy, &idummy, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvsb(fitsfile *fptr,  /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           signed char nulval,   /* I - value for null pixels               */
           signed char *array,   /* O - array of values that are read       */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgclsb(fptr, colnum, firstrow, firstelem, nelem, 1, 1, nulval,
           array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfsb(fitsfile *fptr,  /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           signed char *array,   /* O - array of values that are read       */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    signed char dummy = 0;

    ffgclsb(fptr, colnum, firstrow, firstelem, nelem, 1, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgclsb(fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  elemincre,  /* I - pixel increment; e.g., 2 = every other  */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
            signed char nulval,   /* I - value for null pixels if nultyp = 1 */
            signed char *array,   /* O - array of values that are read       */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer be a virtual column in a 1 or more grouped FITS primary
  array or image extension.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The output array of values will be converted from the datatype of the column 
  and will be scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    double scale, zero, power = 1., dtemp;
    int tcode, maxelem, hdutype, xcode, decimals;
    long twidth, incre;
    long ii, xwidth, ntodo;
    int nulcheck, readcheck = 0;
    LONGLONG repeat, startpos, elemnum, readptr, tnull;
    LONGLONG rowlen, rownum, remain, next, rowincre;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value if reading from ASCII table  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    union u_tag {
       char charval;
       signed char scharval;
    } u;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    if (anynul)
        *anynul = 0;

    if (nultyp == 2)      
       memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (elemincre < 0)
        readcheck = -1;  /* don't do range checking in this case */

    ffgcprll( fptr, colnum, firstrow, firstelem, nelem, readcheck, &scale, &zero,
         tform, &twidth, &tcode, &maxelem, &startpos, &elemnum, &incre,
         &repeat, &rowlen, &hdutype, &tnull, snull, status);

    /* special case: read column of T/F logicals */
    if (tcode == TLOGICAL && elemincre == 1)
    {
        u.scharval = nulval;
        ffgcll(fptr, colnum, firstrow, firstelem, nelem, nultyp,
               u.charval, (char *) array, nularray, anynul, status);

        return(*status);
    }

    if (strchr(tform,'A') != NULL) 
    {
        if (*status == BAD_ELEM_NUM)
        {
            /* ignore this error message */
            *status = 0;
            ffcmsg();   /* clear error stack */
        }

        /*  interpret a 'A' ASCII column as a 'B' byte column ('8A' == '8B') */
        /*  This is an undocumented 'feature' in CFITSIO */

        /*  we have to reset some of the values returned by ffgcpr */
        
        tcode = TBYTE;
        incre = 1;         /* each element is 1 byte wide */
        repeat = twidth;   /* total no. of chars in the col */
        twidth = 1;        /* width of each element */
        scale = 1.0;       /* no scaling */
        zero  = 0.0;
        tnull = NULL_UNDEFINED;  /* don't test for nulls */
        maxelem = DBUFFSIZE;
    }

    if (*status > 0)
        return(*status);
        
    incre *= elemincre;   /* multiply incre to just get every nth pixel */

    if (tcode == TSTRING && hdutype == ASCII_TBL) /* setup for ASCII tables */
    {
      /* get the number of implied decimal places if no explicit decmal point */
      ffasfm(tform, &xcode, &xwidth, &decimals, status); 
      for(ii = 0; ii < decimals; ii++)
        power *= 10.;
    }
    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default, check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (tcode%10 == 1 &&        /* if reading an integer column, and  */ 
            tnull == NULL_UNDEFINED) /* if a null value is not defined,    */
            nulcheck = 0;            /* then do not check for null values. */

    else if (tcode == TSHORT && (tnull > SHRT_MAX || tnull < SHRT_MIN) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TBYTE && (tnull > 255 || tnull < 0) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TSTRING && snull[0] == ASCII_NULL_UNDEFINED)
         nulcheck = 0;

    /*---------------------------------------------------------------------*/
    /*  Now read the pixels from the FITS column. If the column does not   */
    /*  have the same datatype as the output array, then we have to read   */
    /*  the raw values into a temporary buffer (of limited size).  In      */
    /*  the case of a vector colum read only 1 vector of values at a time  */
    /*  then skip to the next row if more values need to be read.          */
    /*  After reading the raw values, then call the fffXXYY routine to (1) */
    /*  test for undefined values, (2) convert the datatype if necessary,  */
    /*  and (3) scale the values by the FITS TSCALn and TZEROn linear      */
    /*  scaling parameters.                                                */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */

    while (remain)
    {
        /* limit the number of pixels to read at one time to the number that
           will fit in the buffer or to the number of pixels that remain in
           the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);
        if (elemincre >= 0)
        {
          ntodo = (long) minvalue(ntodo, ((repeat - elemnum - 1)/elemincre +1));
        }
        else
        {
          ntodo = (long) minvalue(ntodo, (elemnum/(-elemincre) +1));
        }

        readptr = startpos + (rownum * rowlen) + (elemnum * (incre / elemincre));

        switch (tcode) 
        {
            case (TBYTE):
                ffgi1b(fptr, readptr, ntodo, incre, (unsigned char *) &array[next], status);
                fffi1s1((unsigned char *)&array[next], ntodo, scale, zero,
                        nulcheck, (unsigned char) tnull, nulval, &nularray[next], 
                        anynul, &array[next], status);
                break;
            case (TSHORT):
                ffgi2b(fptr, readptr, ntodo, incre, (short *) buffer, status);
                fffi2s1((short  *) buffer, ntodo, scale, zero, nulcheck, 
                       (short) tnull, nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TLONG):
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) buffer,
                       status);
                fffi4s1((INT32BIT *) buffer, ntodo, scale, zero, nulcheck, 
                       (INT32BIT) tnull, nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TLONGLONG):
                ffgi8b(fptr, readptr, ntodo, incre, (long *) buffer, status);
                fffi8s1( (LONGLONG *) buffer, ntodo, scale, zero, 
                           nulcheck, tnull, nulval, &nularray[next], 
                            anynul, &array[next], status);
                break;
            case (TFLOAT):
                ffgr4b(fptr, readptr, ntodo, incre, (float  *) buffer, status);
                fffr4s1((float  *) buffer, ntodo, scale, zero, nulcheck, 
                       nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TDOUBLE):
                ffgr8b(fptr, readptr, ntodo, incre, (double *) buffer, status);
                fffr8s1((double *) buffer, ntodo, scale, zero, nulcheck, 
                          nulval, &nularray[next], anynul, 
                          &array[next], status);
                break;
            case (TSTRING):
                ffmbyt(fptr, readptr, REPORT_EOF, status);
       
                if (incre == twidth)    /* contiguous bytes */
                     ffgbyt(fptr, ntodo * twidth, buffer, status);
                else
                     ffgbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                               status);

                /* interpret the string as an ASCII formated number */
                fffstrs1((char *) buffer, ntodo, scale, zero, twidth, power,
                      nulcheck, snull, nulval, &nularray[next], anynul,
                      &array[next], status);
                break;

            default:  /*  error trap for invalid column format */
                snprintf(message, FLEN_ERRMSG,
                   "Cannot read bytes from column %d which has format %s",
                    colnum, tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous read operation */
        {
	  dtemp = (double) next;
          if (hdutype > 0)
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from column %d (ffgclsb).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from image (ffgclsb).",
              dtemp+1., dtemp+ntodo);

         ffpmsg(message);
         return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum = elemnum + (ntodo * elemincre);

            if (elemnum >= repeat)  /* completed a row; start on later row */
            {
                rowincre = elemnum / repeat;
                rownum += rowincre;
                elemnum = elemnum - (rowincre * repeat);
            }
            else if (elemnum < 0)  /* completed a row; start on a previous row */
            {
                rowincre = (-elemnum - 1) / repeat + 1;
                rownum -= rowincre;
                elemnum = (rowincre * repeat) + elemnum;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while reading FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi1s1(unsigned char *input, /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
            signed char nullval,  /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            signed char *output,  /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == -128.)
        {
            /* Instead of subtracting 128, it is more efficient */
            /* to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++)
                 output[ii] =  ( *(signed char *) &input[ii] ) ^ 0x80;
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        { 
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] > 127)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
                    output[ii] = (signed char) input[ii]; /* copy input */
            }
        }
        else             /* must scale the data */
        {                
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DSCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = -128;
                }
                else if (dvalue > DSCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
                    output[ii] = (signed char) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == -128.)
        {
            /* Instead of subtracting 128, it is more efficient */
            /* to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] =  ( *(signed char *) &input[ii] ) ^ 0x80;
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (signed char) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DSCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (dvalue > DSCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi2s1(short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            signed char nullval,  /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            signed char *output,  /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < -128)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = -128;
                }
                else if (input[ii] > 127)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
                    output[ii] = (signed char) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DSCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = -128;
                }
                else if (dvalue > DSCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
                    output[ii] = (signed char) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }

                else
                {
                    if (input[ii] < -128)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (input[ii] > 127)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DSCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (dvalue > DSCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi4s1(INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            signed char nullval,  /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            signed char *output,  /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < -128)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = -128;
                }
                else if (input[ii] > 127)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
                    output[ii] = (signed char) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DSCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = -128;
                }
                else if (dvalue > DSCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
                    output[ii] = (signed char) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < -128)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (input[ii] > 127)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DSCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (dvalue > DSCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi8s1(LONGLONG *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG tnull,       /* I - value of FITS TNULLn keyword if any */
            signed char nullval,  /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            signed char *output,  /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    ULONGLONG ulltemp;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                if (ulltemp > 127)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
		{
                    output[ii] = (short) ulltemp;
		}
            }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < -128)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = -128;
                }
                else if (input[ii] > 127)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
                    output[ii] = (signed char) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DSCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = -128;
                }
                else if (dvalue > DSCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
                    output[ii] = (signed char) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of subtracting 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
		{
                    ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                    if (ulltemp > 127)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
		    {
                        output[ii] = (short) ulltemp;
		    }
                }
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < -128)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (input[ii] > 127)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DSCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (dvalue > DSCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr4s1(float *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            signed char nullval,  /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            signed char *output,  /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DSCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = -128;
                }
                else if (input[ii] > DSCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
                    output[ii] = (signed char) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DSCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = -128;
                }
                else if (dvalue > DSCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
                    output[ii] = (signed char) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr++;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              /* use redundant boolean logic in following statement */
              /* to suppress irritating Borland compiler warning message */
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DSCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (input[ii] > DSCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  {
                    if (zero < DSCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (zero > DSCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DSCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (dvalue > DSCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr8s1(double *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            signed char nullval,  /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            signed char *output,  /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DSCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = -128;
                }
                else if (input[ii] > DSCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
                    output[ii] = (signed char) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DSCHAR_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = -128;
                }
                else if (dvalue > DSCHAR_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 127;
                }
                else
                    output[ii] = (signed char) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr += 3;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DSCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (input[ii] > DSCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  {
                    if (zero < DSCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (zero > DSCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DSCHAR_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = -128;
                    }
                    else if (dvalue > DSCHAR_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 127;
                    }
                    else
                        output[ii] = (signed char) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffstrs1(char *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            long twidth,          /* I - width of each substring of chars    */
            double implipower,    /* I - power of 10 of implied decimal      */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            char  *snull,         /* I - value of FITS null string, if any   */
            signed char nullval,  /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            signed char *output,  /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file. Check
  for null values and do scaling if required. The nullcheck code value
  determines how any null values in the input array are treated. A null
  value is an input pixel that is equal to snull.  If nullcheck= 0, then
  no special checking for nulls is performed.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    int  nullen;
    long ii;
    double dvalue;
    char *cstring, message[FLEN_ERRMSG];
    char *cptr, *tpos;
    char tempstore, chrzero = '0';
    double val, power;
    int exponent, sign, esign, decpt;

    nullen = strlen(snull);
    cptr = input;  /* pointer to start of input string */
    for (ii = 0; ii < ntodo; ii++)
    {
      cstring = cptr;
      /* temporarily insert a null terminator at end of the string */
      tpos = cptr + twidth;
      tempstore = *tpos;
      *tpos = 0;

      /* check if null value is defined, and if the    */
      /* column string is identical to the null string */
      if (snull[0] != ASCII_NULL_UNDEFINED && 
         !strncmp(snull, cptr, nullen) )
      {
        if (nullcheck)  
        {
          *anynull = 1;    
          if (nullcheck == 1)
            output[ii] = nullval;
          else
            nullarray[ii] = 1;
        }
        cptr += twidth;
      }
      else
      {
        /* value is not the null value, so decode it */
        /* remove any embedded blank characters from the string */

        decpt = 0;
        sign = 1;
        val  = 0.;
        power = 1.;
        exponent = 0;
        esign = 1;

        while (*cptr == ' ')               /* skip leading blanks */
           cptr++;

        if (*cptr == '-' || *cptr == '+')  /* check for leading sign */
        {
          if (*cptr == '-')
             sign = -1;

          cptr++;

          while (*cptr == ' ')         /* skip blanks between sign and value */
            cptr++;
        }

        while (*cptr >= '0' && *cptr <= '9')
        {
          val = val * 10. + *cptr - chrzero;  /* accumulate the value */
          cptr++;

          while (*cptr == ' ')         /* skip embedded blanks in the value */
            cptr++;
        }

        if (*cptr == '.' || *cptr == ',')       /* check for decimal point */
        {
          decpt = 1;
          cptr++;
          while (*cptr == ' ')         /* skip any blanks */
            cptr++;

          while (*cptr >= '0' && *cptr <= '9')
          {
            val = val * 10. + *cptr - chrzero;  /* accumulate the value */
            power = power * 10.;
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks in the value */
              cptr++;
          }
        }

        if (*cptr == 'E' || *cptr == 'D')  /* check for exponent */
        {
          cptr++;
          while (*cptr == ' ')         /* skip blanks */
              cptr++;
  
          if (*cptr == '-' || *cptr == '+')  /* check for exponent sign */
          {
            if (*cptr == '-')
               esign = -1;

            cptr++;

            while (*cptr == ' ')        /* skip blanks between sign and exp */
              cptr++;
          }

          while (*cptr >= '0' && *cptr <= '9')
          {
            exponent = exponent * 10 + *cptr - chrzero;  /* accumulate exp */
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks */
              cptr++;
          }
        }

        if (*cptr  != 0)  /* should end up at the null terminator */
        {
          snprintf(message, FLEN_ERRMSG,"Cannot read number from ASCII table");
          ffpmsg(message);
          snprintf(message, FLEN_ERRMSG,"Column field = %s.", cstring);
          ffpmsg(message);
          /* restore the char that was overwritten by the null */
          *tpos = tempstore;
          return(*status = BAD_C2D);
        }

        if (!decpt)  /* if no explicit decimal, use implied */
           power = implipower;

        dvalue = (sign * val / power) * pow(10., (double) (esign * exponent));

        dvalue = dvalue * scale + zero;   /* apply the scaling */

        if (dvalue < DSCHAR_MIN)
        {
            *status = OVERFLOW_ERR;
            output[ii] = -128;
        }
        else if (dvalue > DSCHAR_MAX)
        {
            *status = OVERFLOW_ERR;
            output[ii] = 127;
        }
        else
            output[ii] = (signed char) dvalue;
      }
      /* restore the char that was overwritten by the null */
      *tpos = tempstore;
    }
    return(*status);
}
cfitsio-3.47/getcols.c0000644000225700000360000007643613464573432014234 0ustar  cagordonlhea/*  This file, getcols.c, contains routines that read data elements from   */
/*  a FITS image or table, with a character string datatype.               */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
/* stddef.h is apparently needed to define size_t */
#include 
#include 
#include "fitsio2.h"
/*--------------------------------------------------------------------------*/
int ffgcvs( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of strings to read               */
            char *nulval,     /* I - string for null pixels                  */
            char **array,     /* O - array of values that are read           */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of string values from a column in the current FITS HDU.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = null in which case no checks for undefined pixels will be made.
*/
{
    char cdummy[2];

    ffgcls(fptr, colnum, firstrow, firstelem, nelem, 1, nulval,
           array, cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfs( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col) */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)        */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st) */
            LONGLONG  nelem,      /* I - number of strings to read              */
            char **array,     /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of string values from a column in the current FITS HDU.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    char dummy[2];

    ffgcls(fptr, colnum, firstrow, firstelem, nelem, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcls( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col) */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)        */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st) */
            LONGLONG  nelem,      /* I - number of strings to read              */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
            char  *nulval,    /* I - value for null pixels if nultyp = 1     */
            char **array,     /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of string values from a column in the current FITS HDU.
  Returns a formated string value, regardless of the datatype of the column
*/
{
    int tcode, hdutype, tstatus, scaled, intcol, dwidth, nulwidth, ll, dlen;
    int equivtype;
    long ii, jj;
    tcolumn *colptr;
    char message[FLEN_ERRMSG], *carray, keyname[FLEN_KEYWORD];
    char cform[20], dispfmt[20], tmpstr[400], *flgarray, tmpnull[80];
    unsigned char byteval;
    float *earray;
    double *darray, tscale = 1.0;
    LONGLONG *llarray;
    ULONGLONG *ullarray;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    /* rescan header if data structure is undefined */
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
        if ( ffrdef(fptr, status) > 0)               
            return(*status);

    if (colnum < 1 || colnum > (fptr->Fptr)->tfield)
    {
        snprintf(message, FLEN_ERRMSG,"Specified column number is out of range: %d",
                colnum);
        ffpmsg(message);
        return(*status = BAD_COL_NUM);
    }

    /* get equivalent dataype of column (only needed for TLONGLONG columns) */
    ffeqtyll(fptr, colnum, &equivtype, NULL, NULL, status);
    if (equivtype < 0) equivtype = abs(equivtype);
    
    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */
    tcode = abs(colptr->tdatatype);

    if (tcode == TSTRING)
    {
      /* simply call the string column reading routine */
      ffgcls2(fptr, colnum, firstrow, firstelem, nelem, nultyp, nulval,
           array, nularray, anynul, status);
    }
    else if (tcode == TLOGICAL)
    {
      /* allocate memory for the array of logical values */
      carray = (char *) malloc((size_t) nelem);

      /*  call the logical column reading routine */
      ffgcll(fptr, colnum, firstrow, firstelem, nelem, nultyp, *nulval,
           carray, nularray, anynul, status); 

      if (*status <= 0)
      {
         /* convert logical values to "T", "F", or "N" (Null) */
         for (ii = 0; ii < nelem; ii++)
         {
           if (carray[ii] == 1)
              strcpy(array[ii], "T");
           else if (carray[ii] == 0)
              strcpy(array[ii], "F");
           else  /* undefined values = 2 */
              strcpy(array[ii],"N");
         }
      }

      free(carray);  /* free the memory */
    }
    else if (tcode == TCOMPLEX)
    {
      /* allocate memory for the array of double values */
      earray = (float *) calloc((size_t) (nelem * 2), sizeof(float) );
      
      ffgcle(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2,
        1, 1, FLOATNULLVALUE, earray, nularray, anynul, status);

      if (*status <= 0)
      {

         /* determine the format for the output strings */

         ffgcdw(fptr, colnum, &dwidth, status);
         dwidth = (dwidth - 3) / 2;
 
         /* use the TDISPn keyword if it exists */
         ffkeyn("TDISP", colnum, keyname, status);
         tstatus = 0;
         cform[0] = '\0';

         if (ffgkys(fptr, keyname, dispfmt, NULL, &tstatus) == 0)
         {
             /* convert the Fortran style format to a C style format */
             ffcdsp(dispfmt, cform);
         }

         if (!cform[0])
             strcpy(cform, "%14.6E");

         /* write the formated string for each value:  "(real,imag)" */
         jj = 0;
         for (ii = 0; ii < nelem; ii++)
         {
           strcpy(array[ii], "(");

           /* test for null value */
           if (earray[jj] == FLOATNULLVALUE)
           {
             strcpy(tmpstr, "NULL");
             if (nultyp == 2)
                nularray[ii] = 1;
           }
           else
             snprintf(tmpstr, 400,cform, earray[jj]);

           strncat(array[ii], tmpstr, dwidth);
           strcat(array[ii], ",");
           jj++;

           /* test for null value */
           if (earray[jj] == FLOATNULLVALUE)
           {
             strcpy(tmpstr, "NULL");
             if (nultyp == 2)
                nularray[ii] = 1;
           }
           else
             snprintf(tmpstr, 400,cform, earray[jj]);

           strncat(array[ii], tmpstr, dwidth);
           strcat(array[ii], ")");
           jj++;
         }
      }

      free(earray);  /* free the memory */
    }
    else if (tcode == TDBLCOMPLEX)
    {
      /* allocate memory for the array of double values */
      darray = (double *) calloc((size_t) (nelem * 2), sizeof(double) );
      
      ffgcld(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2,
        1, 1, DOUBLENULLVALUE, darray, nularray, anynul, status);

      if (*status <= 0)
      {
         /* determine the format for the output strings */

         ffgcdw(fptr, colnum, &dwidth, status);
         dwidth = (dwidth - 3) / 2;

         /* use the TDISPn keyword if it exists */
         ffkeyn("TDISP", colnum, keyname, status);
         tstatus = 0;
         cform[0] = '\0';
 
         if (ffgkys(fptr, keyname, dispfmt, NULL, &tstatus) == 0)
         {
             /* convert the Fortran style format to a C style format */
             ffcdsp(dispfmt, cform);
         }

         if (!cform[0])
            strcpy(cform, "%23.15E");

         /* write the formated string for each value:  "(real,imag)" */
         jj = 0;
         for (ii = 0; ii < nelem; ii++)
         {
           strcpy(array[ii], "(");

           /* test for null value */
           if (darray[jj] == DOUBLENULLVALUE)
           {
             strcpy(tmpstr, "NULL");
             if (nultyp == 2)
                nularray[ii] = 1;
           }
           else
             snprintf(tmpstr, 400,cform, darray[jj]);

           strncat(array[ii], tmpstr, dwidth);
           strcat(array[ii], ",");
           jj++;

           /* test for null value */
           if (darray[jj] == DOUBLENULLVALUE)
           {
             strcpy(tmpstr, "NULL");
             if (nultyp == 2)
                nularray[ii] = 1;
           }
           else
             snprintf(tmpstr, 400,cform, darray[jj]);

           strncat(array[ii], tmpstr, dwidth);
           strcat(array[ii], ")");
           jj++;
         }
      }

      free(darray);  /* free the memory */
    }
    else if (tcode == TLONGLONG && equivtype == TLONGLONG)
    {
      /* allocate memory for the array of LONGLONG values */
      llarray = (LONGLONG *) calloc((size_t) nelem, sizeof(LONGLONG) );
      flgarray = (char *) calloc((size_t) nelem, sizeof(char) );
      dwidth = 20;  /* max width of displayed long long integer value */

      if (ffgcfjj(fptr, colnum, firstrow, firstelem, nelem,
            llarray, flgarray, anynul, status) > 0)
      {
         free(flgarray);
         free(llarray);
         return(*status);
      }

      /* write the formated string for each value */
      if (nulval) {
          strncpy(tmpnull, nulval,79);
          tmpnull[79]='\0'; /* In case len(nulval) >= 79 */
          nulwidth = strlen(tmpnull);
      } else {
          strcpy(tmpnull, " ");
          nulwidth = 1;
      }

      for (ii = 0; ii < nelem; ii++)
      {
           if ( flgarray[ii] )
           {
              *array[ii] = '\0';
              if (dwidth < nulwidth)
                  strncat(array[ii], tmpnull, dwidth);
              else
                  sprintf(array[ii],"%*s",dwidth,tmpnull);
		  
              if (nultyp == 2)
	          nularray[ii] = 1;
           }
           else
           {	   

#if defined(_MSC_VER)
    /* Microsoft Visual C++ 6.0 uses '%I64d' syntax  for 8-byte integers */
        snprintf(tmpstr, 400,"%20I64d", llarray[ii]);
#elif (USE_LL_SUFFIX == 1)
        snprintf(tmpstr, 400,"%20lld", llarray[ii]);
#else
        snprintf(tmpstr, 400,"%20ld", llarray[ii]);
#endif
              *array[ii] = '\0';
              strncat(array[ii], tmpstr, 20);
           }
      }

      free(flgarray);
      free(llarray);  /* free the memory */

    }
    else if (tcode == TLONGLONG && equivtype == TULONGLONG)
    {
      /* allocate memory for the array of ULONGLONG values */
      ullarray = (ULONGLONG *) calloc((size_t) nelem, sizeof(ULONGLONG) );
      flgarray = (char *) calloc((size_t) nelem, sizeof(char) );
      dwidth = 20;  /* max width of displayed unsigned long long integer value */

      if (ffgcfujj(fptr, colnum, firstrow, firstelem, nelem,
            ullarray, flgarray, anynul, status) > 0)
      {
         free(flgarray);
         free(ullarray);
         return(*status);
      }

      /* write the formated string for each value */
      if (nulval) {
          strncpy(tmpnull, nulval, 79);
          tmpnull[79]='\0'; /* In case len(nulval) >= 79 */
          nulwidth = strlen(tmpnull);
      } else {
          strcpy(tmpnull, " ");
          nulwidth = 1;
      }

      for (ii = 0; ii < nelem; ii++)
      {
           if ( flgarray[ii] )
           {
              *array[ii] = '\0';
              if (dwidth < nulwidth)
                  strncat(array[ii], tmpnull, dwidth);
              else
                  sprintf(array[ii],"%*s",dwidth,tmpnull);
		  
              if (nultyp == 2)
	          nularray[ii] = 1;
           }
           else
           {	   

#if defined(_MSC_VER)
    /* Microsoft Visual C++ 6.0 uses '%I64d' syntax  for 8-byte integers */
        snprintf(tmpstr, 400, "%20I64u", ullarray[ii]); 
#elif (USE_LL_SUFFIX == 1)
        snprintf(tmpstr, 400, "%20llu", ullarray[ii]);
#else
        snprintf(tmpstr, 400, "%20lu", ullarray[ii]);
#endif
              *array[ii] = '\0';
              strncat(array[ii], tmpstr, 20);
           }
      }

      free(flgarray);
      free(ullarray);  /* free the memory */

    }
    else
    {
      /* allocate memory for the array of double values */
      darray = (double *) calloc((size_t) nelem, sizeof(double) );
      
      /* read all other numeric type columns as doubles */
      if (ffgcld(fptr, colnum, firstrow, firstelem, nelem, 1, nultyp, 
           DOUBLENULLVALUE, darray, nularray, anynul, status) > 0)
      {
         free(darray);
         return(*status);
      }

      /* determine the format for the output strings */

      ffgcdw(fptr, colnum, &dwidth, status);

      /* check if  column is scaled */
      ffkeyn("TSCAL", colnum, keyname, status);
      tstatus = 0;
      scaled = 0;
      if (ffgkyd(fptr, keyname, &tscale, NULL, &tstatus) == 0)
      {
            if (tscale != 1.0)
                scaled = 1;    /* yes, this is a scaled column */
      }

      intcol = 0;
      if (tcode <= TLONG && !scaled)
             intcol = 1;   /* this is an unscaled integer column */

      /* use the TDISPn keyword if it exists */
      ffkeyn("TDISP", colnum, keyname, status);
      tstatus = 0;
      cform[0] = '\0';

      if (ffgkys(fptr, keyname, dispfmt, NULL, &tstatus) == 0)
      {
           /* convert the Fortran style TDISPn to a C style format */
           ffcdsp(dispfmt, cform);
      }

      if (!cform[0])
      {
            /* no TDISPn keyword; use TFORMn instead */

            ffkeyn("TFORM", colnum, keyname, status);
            ffgkys(fptr, keyname, dispfmt, NULL, status);

            if (scaled && tcode <= TSHORT)
            {
                  /* scaled short integer column == float */
                  strcpy(cform, "%#14.6G");
            }
            else if (scaled && tcode == TLONG)
            {
                  /* scaled long integer column == double */
                  strcpy(cform, "%#23.15G");
            }
            else if (scaled && tcode == TLONGLONG)
            {
                  /* scaled long long integer column == double */
                  strcpy(cform, "%#23.15G");
            }
            else
            {
               ffghdt(fptr, &hdutype, status);
               if (hdutype == ASCII_TBL)
               {
                  /* convert the Fortran style TFORMn to a C style format */
                  ffcdsp(dispfmt, cform);
               }
               else
               {
                 /* this is a binary table, need to convert the format */
                  if (tcode == TBIT) {            /* 'X' */
                     strcpy(cform, "%4d");
                  } else if (tcode == TBYTE) {    /* 'B' */
                     strcpy(cform, "%4d");
                  } else if (tcode == TSHORT) {   /* 'I' */
                     strcpy(cform, "%6d");
                  } else if (tcode == TLONG) {    /* 'J' */
                     strcpy(cform, "%11.0f");
                     intcol = 0;  /* needed to support unsigned int */
                  } else if (tcode == TFLOAT) {   /* 'E' */
                     strcpy(cform, "%#14.6G");
                  } else if (tcode == TDOUBLE) {  /* 'D' */
                     strcpy(cform, "%#23.15G");
                  }
               }
            }
      } 

      if (nulval) {
          strncpy(tmpnull, nulval,79);
          tmpnull[79]='\0';
          nulwidth = strlen(tmpnull);
      } else {
          strcpy(tmpnull, " ");
          nulwidth = 1;
      }

      /* write the formated string for each value */
      for (ii = 0; ii < nelem; ii++)
      {
           if (tcode == TBIT)
           {
               byteval = (char) darray[ii];

               for (ll=0; ll < 8; ll++)
               {
                   if ( ((unsigned char) (byteval << ll)) >> 7 )
                       *(array[ii] + ll) = '1';
                   else
                       *(array[ii] + ll) = '0';
               }
               *(array[ii] + 8) = '\0';
           }
           /* test for null value */
           else if ( (nultyp == 1 && darray[ii] == DOUBLENULLVALUE) ||
                (nultyp == 2 && nularray[ii]) )
           {
              *array[ii] = '\0';
              if (dwidth < nulwidth)
                  strncat(array[ii], tmpnull, dwidth);
              else
                  sprintf(array[ii],"%*s",dwidth,tmpnull);
           }
           else
           {	   
              if (intcol) {
                snprintf(tmpstr, 400,cform, (int) darray[ii]);
              } else {
                snprintf(tmpstr, 400,cform, darray[ii]);
              }
	      
              /* fill field with '*' if number is too wide */
              dlen = strlen(tmpstr);
	      if (dlen > dwidth) {
	         memset(tmpstr, '*', dwidth);
              }

              *array[ii] = '\0';
              strncat(array[ii], tmpstr, dwidth);
           }
      }

      free(darray);  /* free the memory */
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcdw( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column (1 = 1st col)      */
            int  *width,      /* O - display width                       */
            int  *status)     /* IO - error status                           */
/*
  Get Column Display Width.
*/
{
    tcolumn *colptr;
    char *cptr;
    char message[FLEN_ERRMSG], keyname[FLEN_KEYWORD], dispfmt[20];
    int tcode, hdutype, tstatus, scaled;
    double tscale;

    if (*status > 0)  /* inherit input status value if > 0 */
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if (colnum < 1 || colnum > (fptr->Fptr)->tfield)
    {
        snprintf(message, FLEN_ERRMSG,"Specified column number is out of range: %d",
                colnum);
        ffpmsg(message);
        return(*status = BAD_COL_NUM);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */
    tcode = abs(colptr->tdatatype);

    /* use the TDISPn keyword if it exists */
    ffkeyn("TDISP", colnum, keyname, status);

    *width = 0;
    tstatus = 0;
    if (ffgkys(fptr, keyname, dispfmt, NULL, &tstatus) == 0)
    {
          /* parse TDISPn get the display width */
          cptr = dispfmt;
          while(*cptr == ' ') /* skip leading blanks */
              cptr++;

          if (*cptr == 'A' || *cptr == 'a' ||
              *cptr == 'I' || *cptr == 'i' ||
              *cptr == 'O' || *cptr == 'o' ||
              *cptr == 'Z' || *cptr == 'z' ||
              *cptr == 'F' || *cptr == 'f' ||
              *cptr == 'E' || *cptr == 'e' ||
              *cptr == 'D' || *cptr == 'd' ||
              *cptr == 'G' || *cptr == 'g')
          {

            while(!isdigit((int) *cptr) && *cptr != '\0') /* find 1st digit */
              cptr++;

            *width = atoi(cptr);
            if (tcode >= TCOMPLEX)
              *width = (2 * (*width)) + 3;
          }
    }

    if (*width == 0)
    {
        /* no valid TDISPn keyword; use TFORMn instead */

        ffkeyn("TFORM", colnum, keyname, status);
        ffgkys(fptr, keyname, dispfmt, NULL, status);

        /* check if  column is scaled */
        ffkeyn("TSCAL", colnum, keyname, status);
        tstatus = 0;
        scaled = 0;

        if (ffgkyd(fptr, keyname, &tscale, NULL, &tstatus) == 0)
        {
            if (tscale != 1.0)
                scaled = 1;    /* yes, this is a scaled column */
        }

        if (scaled && tcode <= TSHORT)
        {
            /* scaled short integer col == float; default format is 14.6G */
            *width = 14;
        }
        else if (scaled && tcode == TLONG)
        {
            /* scaled long integer col == double; default format is 23.15G */
            *width = 23;
        }
        else if (scaled && tcode == TLONGLONG)
        {
            /* scaled long long integer col == double; default format is 23.15G */
            *width = 23;
        }

        else
        {
           ffghdt(fptr, &hdutype, status);  /* get type of table */
           if (hdutype == ASCII_TBL)
           {
              /* parse TFORMn get the display width */
              cptr = dispfmt;
              while(!isdigit((int) *cptr) && *cptr != '\0') /* find 1st digit */
                 cptr++;

              *width = atoi(cptr);
           }
           else
           {
                 /* this is a binary table */
                  if (tcode == TBIT)           /* 'X' */
                     *width = 8;
                  else if (tcode == TBYTE)     /* 'B' */
                     *width = 4;
                  else if (tcode == TSHORT)    /* 'I' */
                     *width = 6;
                  else if (tcode == TLONG)     /* 'J' */
                     *width = 11;
                  else if (tcode == TLONGLONG) /* 'K' */
                     *width = 20;
                  else if (tcode == TFLOAT)    /* 'E' */
                     *width = 14;
                  else if (tcode == TDOUBLE)   /* 'D' */
                     *width = 23;
                  else if (tcode == TCOMPLEX)  /* 'C' */
                     *width = 31;
                  else if (tcode == TDBLCOMPLEX)  /* 'M' */
                     *width = 49;
                  else if (tcode == TLOGICAL)  /* 'L' */
                     *width = 1;
                  else if (tcode == TSTRING)   /* 'A' */
                  {
		    int typecode;
		    long int repeat = 0, rwidth = 0;
		    int gstatus = 0;

		    /* Deal with possible vector string with repeat / width  by parsing
		       the TFORM=rAw keyword */
		    if (ffgtcl(fptr, colnum, &typecode, &repeat, &rwidth, &gstatus) == 0 &&
			rwidth >= 1 && rwidth < repeat) {
		      *width = rwidth;

		    } else {
		      
		      /* Hmmm, we couldn't parse the TFORM keyword by standard, so just do
			 simple parsing */
		      cptr = dispfmt;
		      while(!isdigit((int) *cptr) && *cptr != '\0') 
			cptr++;
		      
		      *width = atoi(cptr);
		    }

                    if (*width < 1)
                         *width = 1;  /* default is at least 1 column */
                  }
            }
        }
    } 
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcls2 ( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col) */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)        */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st) */
            LONGLONG  nelem,      /* I - number of strings to read              */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
            char  *nulval,    /* I - value for null pixels if nultyp = 1     */
            char **array,     /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of string values from a column in the current FITS HDU.
*/
{
    double dtemp;
    long nullen; 
    int tcode, maxelem, hdutype, nulcheck;
    long twidth, incre;
    long ii, jj, ntodo;
    LONGLONG repeat, startpos, elemnum, readptr, tnull, rowlen, rownum, remain, next;
    double scale, zero;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value  */
    tcolumn *colptr;

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    char *buffer, *arrayptr;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if (anynul)
        *anynul = 0;

    if (nultyp == 2)
        memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (colnum < 1 || colnum > (fptr->Fptr)->tfield)
    {
        snprintf(message, FLEN_ERRMSG,"Specified column number is out of range: %d",
                colnum);
        ffpmsg(message);
        return(*status = BAD_COL_NUM);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */
    tcode = colptr->tdatatype;

    if (tcode == -TSTRING) /* variable length column in a binary table? */
    {
      /* only read a single string; ignore value of firstelem */

      if (ffgcprll( fptr, colnum, firstrow, 1, 1, 0, &scale, &zero,
        tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

      remain = 1;
      twidth = (long) repeat;  
    }
    else if (tcode == TSTRING)
    {
      if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 0, &scale, &zero,
        tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

      /* if string length is greater than a FITS block (2880 char) then must */
      /* only read 1 string at a time, to force reading by ffgbyt instead of */
      /* ffgbytoff (ffgbytoff can't handle this case) */
      if (twidth > IOBUFLEN) {
        maxelem = 1;
        incre = twidth;
        repeat = 1;
      }   

      remain = nelem;
    }
    else
        return(*status = NOT_ASCII_COL);

    nullen = strlen(snull);   /* length of the undefined pixel string */
    if (nullen == 0)
        nullen = 1;
 
    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (nultyp == 1 && nulval && nulval[0] == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (snull[0] == ASCII_NULL_UNDEFINED)
       nulcheck = 0;   /* null value string in ASCII table not defined */

    else if (nullen > twidth)
       nulcheck = 0;   /* null value string is longer than width of column  */
                       /* thus impossible for any column elements to = null */

    /*---------------------------------------------------------------------*/
    /*  Now read the strings one at a time from the FITS column.           */
    /*---------------------------------------------------------------------*/
    next = 0;                 /* next element in array to be read  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
      /* limit the number of pixels to process at one time to the number that
         will fit in the buffer space or to the number of pixels that remain
         in the current vector, which ever is smaller.
      */
      ntodo = (long) minvalue(remain, maxelem);      
      ntodo = (long) minvalue(ntodo, (repeat - elemnum));

      readptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);
      ffmbyt(fptr, readptr, REPORT_EOF, status);  /* move to read position */

      /* read the array of strings from the FITS file into the buffer */

      if (incre == twidth)
         ffgbyt(fptr, ntodo * twidth, cbuff, status);
      else
         ffgbytoff(fptr, twidth, ntodo, incre - twidth, cbuff, status);

      /* copy from the buffer into the user's array of strings */
      /* work backwards from last char of last string to 1st char of 1st */

      buffer = ((char *) cbuff) + (ntodo * twidth) - 1;

      for (ii = (long) (next + ntodo - 1); ii >= next; ii--)
      {
         arrayptr = array[ii] + twidth - 1;

         for (jj = twidth - 1; jj > 0; jj--)  /* ignore trailing blanks */
         {
            if (*buffer == ' ')
            {
              buffer--;
              arrayptr--;
            }
            else
              break;
         }
         *(arrayptr + 1) = 0;  /* write the string terminator */
         
         for (; jj >= 0; jj--)    /* copy the string itself */
         {
           *arrayptr = *buffer;
           buffer--;
           arrayptr--;
         }

         /* check if null value is defined, and if the   */
         /* column string is identical to the null string */
         if (nulcheck && !strncmp(snull, array[ii], nullen) )
         {
           *anynul = 1;   /* this is a null value */
           if (nultyp == 1) {
	   
	     if (nulval)
                strcpy(array[ii], nulval);
	     else
	        strcpy(array[ii], " ");
	     
           } else
             nularray[ii] = 1;
         }
      }
    
      if (*status > 0)  /* test for error during previous read operation */
      {
         dtemp = (double) next;
         snprintf(message,FLEN_ERRMSG,
          "Error reading elements %.0f thru %.0f of data array (ffpcls).",
             dtemp+1., dtemp+ntodo);

         ffpmsg(message);
         return(*status);
      }

      /*--------------------------------------------*/
      /*  increment the counters for the next loop  */
      /*--------------------------------------------*/
      next += ntodo;
      remain -= ntodo;
      if (remain)
      {
          elemnum += ntodo;
          if (elemnum == repeat)  /* completed a row; start on next row */
          {
              elemnum = 0;
              rownum++;
          }
      }
    }  /*  End of main while Loop  */

    return(*status);
}

cfitsio-3.47/getcolui.c0000644000225700000360000022302213464573432014370 0ustar  cagordonlhea/*  This file, getcolui.c, contains routines that read data elements from   */
/*  a FITS image or table, with unsigned short datatype.                    */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffgpvui( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
   unsigned short nulval,     /* I - value for undefined pixels              */
   unsigned short *array,     /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    char cdummy;
    int nullcheck = 1;
    unsigned short nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
         nullvalue = nulval;  /* set local variable */

        fits_read_compressed_pixels(fptr, TUSHORT, firstelem, nelem,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclui(fptr, 2, row, firstelem, nelem, 1, 1, nulval,
               array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpfui( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
   unsigned short *array,     /* O - array of values that are returned       */
            char *nularray,   /* O - array of null pixel flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Any undefined pixels in the returned array will be set = 0 and the 
  corresponding nularray value will be set = 1.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    int nullcheck = 2;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, TUSHORT, firstelem, nelem,
            nullcheck, NULL, array, nularray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclui(fptr, 2, row, firstelem, nelem, 1, 2, 0,
               array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg2dui(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
  unsigned short nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
  unsigned short *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    /* call the 3D reading routine, with the 3rd dimension = 1 */

    ffg3dui(fptr, group, nulval, ncols, naxis2, naxis1, naxis2, 1, array, 
           anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg3dui(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
  unsigned short nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  nrows,     /* I - number of rows in each plane of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  naxis3,    /* I - FITS image NAXIS3 value                 */
  unsigned short *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 3-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    long tablerow, ii, jj;
    char cdummy;
    int nullcheck = 1;
    long inc[] = {1,1,1};
    LONGLONG fpixel[] = {1,1,1}, nfits, narray;
    LONGLONG lpixel[3];
    unsigned short nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        lpixel[0] = ncols;
        lpixel[1] = nrows;
        lpixel[2] = naxis3;
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TUSHORT, fpixel, lpixel, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
       /* all the image pixels are contiguous, so read all at once */
       ffgclui(fptr, 2, tablerow, 1, naxis1 * naxis2 * naxis3, 1, 1, nulval,
               array, &cdummy, anynul, status);
       return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to read */
    narray = 0;  /* next pixel in output array to be filled */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* reading naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffgclui(fptr, 2, tablerow, nfits, naxis1, 1, 1, nulval,
          &array[narray], &cdummy, anynul, status) > 0)
          return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsvui(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
  unsigned short nulval,   /* I - value to set undefined pixels             */
  unsigned short *array,   /* O - array to be filled and returned           */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9];
    long nelem, nultyp, ninc, numcol;
    LONGLONG felem, dsize[10], blcll[9], trcll[9];
    int hdutype, anyf;
    char ldummy, msg[FLEN_ERRMSG];
    int nullcheck = 1;
    unsigned short nullvalue;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvui is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TUSHORT, blcll, trcll, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 1;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvui: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];
              if ( ffgclui(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &ldummy, &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsfui(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
  unsigned short *array,   /* O - array to be filled and returned           */
           char *flagval,  /* O - set to 1 if corresponding value is null   */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dsize[10];
    LONGLONG blcll[9], trcll[9];
    long felem, nelem, nultyp, ninc, numcol;
    int hdutype, anyf;
    unsigned short nulval = 0;
    char msg[FLEN_ERRMSG];
    int nullcheck = 2;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvi is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        fits_read_compressed_img(fptr, TUSHORT, blcll, trcll, inc,
            nullcheck, NULL, array, flagval, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 2;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvi: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgclui(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &flagval[i0], &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffggpui( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            long  firstelem,  /* I - first vector element to read (1 = 1st)  */
            long  nelem,      /* I - number of values to read                */
   unsigned short *array,     /* O - array of values that are returned       */
            int  *status)     /* IO - error status                           */
/*
  Read an array of group parameters from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
*/
{
    long row;
    int idummy;
    char cdummy;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclui(fptr, 1, row, firstelem, nelem, 1, 1, 0,
               array, &cdummy, &idummy, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvui(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
  unsigned short nulval,     /* I - value for null pixels                   */
  unsigned short *array,     /* O - array of values that are read           */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgclui(fptr, colnum, firstrow, firstelem, nelem, 1, 1, nulval,
           array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfui(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
  unsigned short *array,     /* O - array of values that are read           */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    unsigned short dummy = 0;

    ffgclui(fptr, colnum, firstrow, firstelem, nelem, 1, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgclui( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  elemincre,  /* I - pixel increment; e.g., 2 = every other  */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
   unsigned short nulval,     /* I - value for null pixels if nultyp = 1     */
   unsigned short *array,     /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer be a virtual column in a 1 or more grouped FITS primary
  array or image extension.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The output array of values will be converted from the datatype of the column 
  and will be scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    double scale, zero, power = 1., dtemp;
    int tcode, maxelem2, hdutype, xcode, decimals;
    long twidth, incre;
    long ii, xwidth, ntodo;
    int nulcheck;
    LONGLONG repeat, startpos, elemnum, readptr, tnull;
    LONGLONG rowlen, rownum, remain, next, rowincre, maxelem;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value if reading from ASCII table  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    if (anynul)
        *anynul = 0;

    if (nultyp == 2)
        memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if ( ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 0, &scale, &zero,
         tform, &twidth, &tcode, &maxelem2, &startpos, &elemnum, &incre,
         &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0 )
         return(*status);
    maxelem = maxelem2;

    incre *= elemincre;   /* multiply incre to just get every nth pixel */

    if (tcode == TSTRING)    /* setup for ASCII tables */
    {
      /* get the number of implied decimal places if no explicit decmal point */
      ffasfm(tform, &xcode, &xwidth, &decimals, status); 
      for(ii = 0; ii < decimals; ii++)
        power *= 10.;
    }
    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (tcode%10 == 1 &&        /* if reading an integer column, and  */ 
            tnull == NULL_UNDEFINED) /* if a null value is not defined,    */
            nulcheck = 0;            /* then do not check for null values. */

    else if (tcode == TSHORT && (tnull > SHRT_MAX || tnull < SHRT_MIN) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TBYTE && (tnull > 255 || tnull < 0) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TSTRING && snull[0] == ASCII_NULL_UNDEFINED)
         nulcheck = 0;

    /*----------------------------------------------------------------------*/
    /*  If FITS column and output data array have same datatype, then we do */
    /*  not need to use a temporary buffer to store intermediate datatype.  */
    /*----------------------------------------------------------------------*/
    if (tcode == TSHORT) /* Special Case:                        */
    {                             /* no type convertion required, so read */
                                  /* data directly into output buffer.    */

        if (nelem < (LONGLONG)INT32_MAX/2) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/2;
        }
    }

    /*---------------------------------------------------------------------*/
    /*  Now read the pixels from the FITS column. If the column does not   */
    /*  have the same datatype as the output array, then we have to read   */
    /*  the raw values into a temporary buffer (of limited size).  In      */
    /*  the case of a vector colum read only 1 vector of values at a time  */
    /*  then skip to the next row if more values need to be read.          */
    /*  After reading the raw values, then call the fffXXYY routine to (1) */
    /*  test for undefined values, (2) convert the datatype if necessary,  */
    /*  and (3) scale the values by the FITS TSCALn and TZEROn linear      */
    /*  scaling parameters.                                                */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */

    while (remain)
    {
        /* limit the number of pixels to read at one time to the number that
           will fit in the buffer or to the number of pixels that remain in
           the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, ((repeat - elemnum - 1)/elemincre +1));

        readptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * (incre / elemincre));

        switch (tcode) 
        {
            case (TSHORT):
                ffgi2b(fptr, readptr, ntodo, incre,
                       (short *) &array[next], status);
                fffi2u2((short *) &array[next], ntodo, scale,
                       zero, nulcheck, (short) tnull, nulval, &nularray[next],
                       anynul, &array[next], status);
                break;
            case (TLONGLONG):

                ffgi8b(fptr, readptr, ntodo, incre, (long *) buffer, status);
                fffi8u2( (LONGLONG *) buffer, ntodo, scale, zero, 
                           nulcheck, tnull, nulval, &nularray[next], 
                            anynul, &array[next], status);
                break;
            case (TBYTE):
                ffgi1b(fptr, readptr, ntodo, incre, (unsigned char *) buffer,
                      status);
                fffi1u2((unsigned char *) buffer, ntodo, scale, zero, nulcheck, 
                    (unsigned char) tnull, nulval, &nularray[next], anynul, 
                    &array[next], status);
                break;
            case (TLONG):
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) buffer,
                       status);
                fffi4u2((INT32BIT *) buffer, ntodo, scale, zero, nulcheck, 
                       (INT32BIT) tnull, nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TFLOAT):
                ffgr4b(fptr, readptr, ntodo, incre, (float  *) buffer, status);
                fffr4u2((float  *) buffer, ntodo, scale, zero, nulcheck, 
                       nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TDOUBLE):
                ffgr8b(fptr, readptr, ntodo, incre, (double *) buffer, status);
                fffr8u2((double *) buffer, ntodo, scale, zero, nulcheck, 
                          nulval, &nularray[next], anynul, 
                          &array[next], status);
                break;
            case (TSTRING):
                ffmbyt(fptr, readptr, REPORT_EOF, status);
       
                if (incre == twidth)    /* contiguous bytes */
                     ffgbyt(fptr, ntodo * twidth, buffer, status);
                else
                     ffgbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                               status);

                fffstru2((char *) buffer, ntodo, scale, zero, twidth, power,
                     nulcheck, snull, nulval, &nularray[next], anynul,
                     &array[next], status);
                break;

            default:  /*  error trap for invalid column format */
                snprintf(message, FLEN_ERRMSG, 
                   "Cannot read numbers from column %d which has format %s",
                    colnum, tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous read operation */
        {
	  dtemp = (double) next;
          if (hdutype > 0)
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from column %d (ffgclui).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from image (ffgclui).",
              dtemp+1., dtemp+ntodo);

          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum = elemnum + (ntodo * elemincre);

            if (elemnum >= repeat)  /* completed a row; start on later row */
            {
                rowincre = elemnum / repeat;
                rownum += rowincre;
                elemnum = elemnum - (rowincre * repeat);
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while reading FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi1u2(unsigned char *input, /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
   unsigned short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (unsigned short) input[ii]; /* copy input */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = USHRT_MAX;
                }
                else
                    output[ii] = (unsigned short) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (unsigned short) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
                        output[ii] = (unsigned short) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi2u2(short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
   unsigned short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 32768.) 
        {       
           /* Instead of adding 32768, it is more efficient */
           /* to just flip the sign bit with the XOR operator */

           for (ii = 0; ii < ntodo; ii++)
              output[ii] =  ( *(unsigned short *) &input[ii] ) ^ 0x8000;
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else
                    output[ii] = (unsigned short) input[ii]; /* copy input */
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = USHRT_MAX;
                }
                else
                    output[ii] = (unsigned short) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 32768.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] =  ( *(unsigned short *) &input[ii] ) ^ 0x8000;
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else
                    output[ii] = (unsigned short) input[ii]; /* copy input */
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
                        output[ii] = (unsigned short) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi4u2(INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
   unsigned short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > USHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = USHRT_MAX;
                }
                else
                    output[ii] = (unsigned short) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = USHRT_MAX;
                }
                else
                    output[ii] = (unsigned short) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > USHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
                        output[ii] = (unsigned short) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
                        output[ii] = (unsigned short) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi8u2(LONGLONG *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG tnull,       /* I - value of FITS TNULLn keyword if any */
   unsigned short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    ULONGLONG ulltemp;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                if (ulltemp > USHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = USHRT_MAX;
                }
                else
                    output[ii] = (unsigned short) ulltemp;

            }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > USHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = USHRT_MAX;
                }
                else
                    output[ii] = (unsigned short) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = USHRT_MAX;
                }
                else
                    output[ii] = (unsigned short) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                    if (ulltemp > USHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
		    {
                        output[ii] = (unsigned short) ulltemp;
		    }
                }
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > USHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
                        output[ii] = (unsigned short) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
                        output[ii] = (unsigned short) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr4u2(float *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
   unsigned short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DUSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > DUSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = USHRT_MAX;
                }
                else
                    output[ii] = (unsigned short) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = USHRT_MAX;
                }
                else
                    output[ii] = (unsigned short) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr++;       /* point to MSBs */
#endif

        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )   /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DUSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > DUSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
                        output[ii] = (unsigned short) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  { 
                    if (zero < DUSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (zero > DUSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
                      output[ii] = (unsigned short) zero;
                  }
              }
              else
              {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
                        output[ii] = (unsigned short) dvalue;
              }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr8u2(double *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
   unsigned short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DUSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > DUSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = USHRT_MAX;
                }
                else
                    output[ii] = (unsigned short) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUSHRT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUSHRT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = USHRT_MAX;
                }
                else
                    output[ii] = (unsigned short) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr += 3;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DUSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > DUSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
                        output[ii] = (unsigned short) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  { 
                    if (zero < DUSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (zero > DUSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
                      output[ii] = (unsigned short) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUSHRT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUSHRT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = USHRT_MAX;
                    }
                    else
                        output[ii] = (unsigned short) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffstru2(char *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            long twidth,          /* I - width of each substring of chars    */
            double implipower,    /* I - power of 10 of implied decimal      */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            char  *snull,         /* I - value of FITS null string, if any   */
   unsigned short nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned short *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file. Check
  for null values and do scaling if required. The nullcheck code value
  determines how any null values in the input array are treated. A null
  value is an input pixel that is equal to snull.  If nullcheck= 0, then
  no special checking for nulls is performed.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    int nullen;
    long ii;
    double dvalue;
    char *cstring, message[FLEN_ERRMSG];
    char *cptr, *tpos;
    char tempstore, chrzero = '0';
    double val, power;
    int exponent, sign, esign, decpt;

    nullen = strlen(snull);
    cptr = input;  /* pointer to start of input string */
    for (ii = 0; ii < ntodo; ii++)
    {
      cstring = cptr;
      /* temporarily insert a null terminator at end of the string */
      tpos = cptr + twidth;
      tempstore = *tpos;
      *tpos = 0;

      /* check if null value is defined, and if the    */
      /* column string is identical to the null string */
      if (snull[0] != ASCII_NULL_UNDEFINED && 
         !strncmp(snull, cptr, nullen) )
      {
        if (nullcheck)  
        {
          *anynull = 1;    
          if (nullcheck == 1)
            output[ii] = nullval;
          else
            nullarray[ii] = 1;
        }
        cptr += twidth;
      }
      else
      {
        /* value is not the null value, so decode it */
        /* remove any embedded blank characters from the string */

        decpt = 0;
        sign = 1;
        val  = 0.;
        power = 1.;
        exponent = 0;
        esign = 1;

        while (*cptr == ' ')               /* skip leading blanks */
           cptr++;

        if (*cptr == '-' || *cptr == '+')  /* check for leading sign */
        {
          if (*cptr == '-')
             sign = -1;

          cptr++;

          while (*cptr == ' ')         /* skip blanks between sign and value */
            cptr++;
        }

        while (*cptr >= '0' && *cptr <= '9')
        {
          val = val * 10. + *cptr - chrzero;  /* accumulate the value */
          cptr++;

          while (*cptr == ' ')         /* skip embedded blanks in the value */
            cptr++;
        }

        if (*cptr == '.' || *cptr == ',')       /* check for decimal point */
        {
          decpt = 1;       /* set flag to show there was a decimal point */
          cptr++;
          while (*cptr == ' ')         /* skip any blanks */
            cptr++;

          while (*cptr >= '0' && *cptr <= '9')
          {
            val = val * 10. + *cptr - chrzero;  /* accumulate the value */
            power = power * 10.;
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks in the value */
              cptr++;
          }
        }

        if (*cptr == 'E' || *cptr == 'D')  /* check for exponent */
        {
          cptr++;
          while (*cptr == ' ')         /* skip blanks */
              cptr++;
  
          if (*cptr == '-' || *cptr == '+')  /* check for exponent sign */
          {
            if (*cptr == '-')
               esign = -1;

            cptr++;

            while (*cptr == ' ')        /* skip blanks between sign and exp */
              cptr++;
          }

          while (*cptr >= '0' && *cptr <= '9')
          {
            exponent = exponent * 10 + *cptr - chrzero;  /* accumulate exp */
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks */
              cptr++;
          }
        }

        if (*cptr  != 0)  /* should end up at the null terminator */
        {
          snprintf(message,FLEN_ERRMSG, "Cannot read number from ASCII table");
          ffpmsg(message);
          snprintf(message, FLEN_ERRMSG,"Column field = %s.", cstring);
          ffpmsg(message);
          /* restore the char that was overwritten by the null */
          *tpos = tempstore;
          return(*status = BAD_C2D);
        }

        if (!decpt)  /* if no explicit decimal, use implied */
           power = implipower;

        dvalue = (sign * val / power) * pow(10., (double) (esign * exponent));

        dvalue = dvalue * scale + zero;   /* apply the scaling */

        if (dvalue < DUSHRT_MIN)
        {
            *status = OVERFLOW_ERR;
            output[ii] = 0;
        }
        else if (dvalue > DUSHRT_MAX)
        {
            *status = OVERFLOW_ERR;
            output[ii] = USHRT_MAX;
        }
        else
            output[ii] = (unsigned short) dvalue;
      }
      /* restore the char that was overwritten by the null */
      *tpos = tempstore;
    }
    return(*status);
}
cfitsio-3.47/getcoluj.c0000644000225700000360000044147113464573432014403 0ustar  cagordonlhea/*  This file, getcoluj.c, contains routines that read data elements from  */
/*  a FITS image or table, with unsigned long data type.                   */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffgpvuj(fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
   unsigned long  nulval,     /* I - value for undefined pixels              */
   unsigned long  *array,     /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    char cdummy;
    int nullcheck = 1;
    unsigned long nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_pixels(fptr, TULONG, firstelem, nelem,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcluj(fptr, 2, row, firstelem, nelem, 1, 1, nulval,
               array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpfuj(fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
   unsigned long  *array,     /* O - array of values that are returned       */
            char *nularray,   /* O - array of null pixel flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Any undefined pixels in the returned array will be set = 0 and the 
  corresponding nularray value will be set = 1.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    int nullcheck = 2;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, TULONG, firstelem, nelem,
            nullcheck, NULL, array, nularray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcluj(fptr, 2, row, firstelem, nelem, 1, 2, 0L,
               array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg2duj(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
  unsigned long  nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
  unsigned long  *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    /* call the 3D reading routine, with the 3rd dimension = 1 */

    ffg3duj(fptr, group, nulval, ncols, naxis2, naxis1, naxis2, 1, array, 
           anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg3duj(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
  unsigned long  nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  nrows,     /* I - number of rows in each plane of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  naxis3,    /* I - FITS image NAXIS3 value                 */
  unsigned long  *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 3-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    long tablerow, ii, jj;
    char cdummy;
    int nullcheck = 1;
    long inc[] = {1,1,1};
    LONGLONG fpixel[] = {1,1,1}, nfits, narray;
    LONGLONG lpixel[3];
    unsigned long nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        lpixel[0] = ncols;
        lpixel[1] = nrows;
        lpixel[2] = naxis3;
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TULONG, fpixel, lpixel, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
       /* all the image pixels are contiguous, so read all at once */
       ffgcluj(fptr, 2, tablerow, 1, naxis1 * naxis2 * naxis3, 1, 1, nulval,
               array, &cdummy, anynul, status);
       return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to read */
    narray = 0;  /* next pixel in output array to be filled */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* reading naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffgcluj(fptr, 2, tablerow, nfits, naxis1, 1, 1, nulval,
          &array[narray], &cdummy, anynul, status) > 0)
          return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsvuj(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
  unsigned long nulval,    /* I - value to set undefined pixels             */
  unsigned long *array,    /* O - array to be filled and returned           */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9];
    long nelem, nultyp, ninc, numcol;
    LONGLONG felem, dsize[10], blcll[9], trcll[9];
    int hdutype, anyf;
    char ldummy, msg[FLEN_ERRMSG];
    int nullcheck = 1;
    unsigned long nullvalue;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvuj is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TULONG, blcll, trcll, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 1;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvuj: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgcluj(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &ldummy, &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsfuj(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
  unsigned long *array,    /* O - array to be filled and returned           */
           char *flagval,  /* O - set to 1 if corresponding value is null   */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dsize[10];
    LONGLONG blcll[9], trcll[9];
    long felem, nelem, nultyp, ninc, numcol;
    unsigned long nulval = 0;
    int hdutype, anyf;
    char msg[FLEN_ERRMSG];
    int nullcheck = 2;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvj is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        fits_read_compressed_img(fptr, TULONG, blcll, trcll, inc,
            nullcheck, NULL, array, flagval, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 2;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvj: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgcluj(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &flagval[i0], &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffggpuj(fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            long  firstelem,  /* I - first vector element to read (1 = 1st)  */
            long  nelem,      /* I - number of values to read                */
   unsigned long  *array,     /* O - array of values that are returned       */
            int  *status)     /* IO - error status                           */
/*
  Read an array of group parameters from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
*/
{
    long row;
    int idummy;
    char cdummy;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcluj(fptr, 1, row, firstelem, nelem, 1, 1, 0L,
               array, &cdummy, &idummy, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvuj(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
  unsigned long  nulval,     /* I - value for null pixels                   */
  unsigned long *array,      /* O - array of values that are read           */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgcluj(fptr, colnum, firstrow, firstelem, nelem, 1, 1, nulval,
           array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfuj(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
  unsigned long  *array,     /* O - array of values that are read           */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    unsigned long dummy = 0;

    ffgcluj(fptr, colnum, firstrow, firstelem, nelem, 1, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcluj(fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG  firstelem, /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  elemincre,  /* I - pixel increment; e.g., 2 = every other  */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
   unsigned long  nulval,     /* I - value for null pixels if nultyp = 1     */
   unsigned long  *array,     /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer be a virtual column in a 1 or more grouped FITS primary
  array or image extension.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The output array of values will be converted from the datatype of the column 
  and will be scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    double scale, zero, power = 1., dtemp;
    int tcode, maxelem2, hdutype, xcode, decimals;
    long twidth, incre;
    long ii, xwidth, ntodo;
    int nulcheck;
    LONGLONG repeat, startpos, elemnum, readptr, tnull;
    LONGLONG rowlen, rownum, remain, next, rowincre, maxelem;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value if reading from ASCII table  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    if (anynul)
        *anynul = 0;

    if (nultyp == 2)
        memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if ( ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 0, &scale, &zero,
         tform, &twidth, &tcode, &maxelem2, &startpos, &elemnum, &incre,
         &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0 )
         return(*status);
    maxelem = maxelem2;

    incre *= elemincre;   /* multiply incre to just get every nth pixel */

    if (tcode == TSTRING)    /* setup for ASCII tables */
    {
      /* get the number of implied decimal places if no explicit decmal point */
      ffasfm(tform, &xcode, &xwidth, &decimals, status); 
      for(ii = 0; ii < decimals; ii++)
        power *= 10.;
    }
    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (tcode%10 == 1 &&        /* if reading an integer column, and  */ 
            tnull == NULL_UNDEFINED) /* if a null value is not defined,    */
            nulcheck = 0;            /* then do not check for null values. */

    else if (tcode == TSHORT && (tnull > SHRT_MAX || tnull < SHRT_MIN) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TBYTE && (tnull > 255 || tnull < 0) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TSTRING && snull[0] == ASCII_NULL_UNDEFINED)
         nulcheck = 0;

    /*----------------------------------------------------------------------*/
    /*  If FITS column and output data array have same datatype, then we do */
    /*  not need to use a temporary buffer to store intermediate datatype.  */
    /*----------------------------------------------------------------------*/
    if ((tcode == TLONG) && (LONGSIZE == 32))  /* Special Case:                        */
    {                             /* no type convertion required, so read */
                                  /* data directly into output buffer.    */

        if (nelem < (LONGLONG)INT32_MAX/4) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/4;
        }
    }

    /*---------------------------------------------------------------------*/
    /*  Now read the pixels from the FITS column. If the column does not   */
    /*  have the same datatype as the output array, then we have to read   */
    /*  the raw values into a temporary buffer (of limited size).  In      */
    /*  the case of a vector colum read only 1 vector of values at a time  */
    /*  then skip to the next row if more values need to be read.          */
    /*  After reading the raw values, then call the fffXXYY routine to (1) */
    /*  test for undefined values, (2) convert the datatype if necessary,  */
    /*  and (3) scale the values by the FITS TSCALn and TZEROn linear      */
    /*  scaling parameters.                                                */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */

    while (remain)
    {
        /* limit the number of pixels to read at one time to the number that
           will fit in the buffer or to the number of pixels that remain in
           the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, ((repeat - elemnum - 1)/elemincre +1));

        readptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * (incre / elemincre));

        switch (tcode) 
        {
            case (TLONG):
	      if (LONGSIZE == 32) {
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) &array[next],
                       status);
                fffi4u4((INT32BIT *) &array[next], ntodo, scale, zero,
                         nulcheck, (INT32BIT) tnull, nulval, &nularray[next],
                         anynul, &array[next], status);
	      } else { /* case where sizeof(long) = 8 */
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) buffer,
                       status);
                fffi4u4((INT32BIT *) buffer, ntodo, scale, zero,
                         nulcheck, (INT32BIT) tnull, nulval, &nularray[next],
                         anynul, &array[next], status);
	      }


                break;
            case (TLONGLONG):

                ffgi8b(fptr, readptr, ntodo, incre, (long *) buffer, status);
                fffi8u4( (LONGLONG *) buffer, ntodo, scale, zero, 
                           nulcheck, tnull, nulval, &nularray[next], 
                            anynul, &array[next], status);
                break;
            case (TBYTE):
                ffgi1b(fptr, readptr, ntodo, incre, (unsigned char *) buffer,
                       status);
                fffi1u4((unsigned char *) buffer, ntodo, scale, zero, nulcheck, 
                     (unsigned char) tnull, nulval, &nularray[next], anynul, 
                     &array[next], status);
                break;
            case (TSHORT):
                ffgi2b(fptr, readptr, ntodo, incre, (short  *) buffer, status);
                fffi2u4((short  *) buffer, ntodo, scale, zero, nulcheck, 
                      (short) tnull, nulval, &nularray[next], anynul, 
                      &array[next], status);
                break;
            case (TFLOAT):
                ffgr4b(fptr, readptr, ntodo, incre, (float  *) buffer, status);
                fffr4u4((float  *) buffer, ntodo, scale, zero, nulcheck, 
                       nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TDOUBLE):
                ffgr8b(fptr, readptr, ntodo, incre, (double *) buffer, status);
                fffr8u4((double *) buffer, ntodo, scale, zero, nulcheck, 
                          nulval, &nularray[next], anynul, 
                          &array[next], status);
                break;
            case (TSTRING):
                ffmbyt(fptr, readptr, REPORT_EOF, status);
       
                if (incre == twidth)    /* contiguous bytes */
                     ffgbyt(fptr, ntodo * twidth, buffer, status);
                else
                     ffgbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                               status);

                fffstru4((char *) buffer, ntodo, scale, zero, twidth, power,
                     nulcheck, snull, nulval, &nularray[next], anynul,
                     &array[next], status);
                break;

            default:  /*  error trap for invalid column format */
                snprintf(message,FLEN_ERRMSG, 
                   "Cannot read numbers from column %d which has format %s",
                    colnum, tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous read operation */
        {
	  dtemp = (double) next;
          if (hdutype > 0)
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from column %d (ffgcluj).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from image (ffgcluj).",
              dtemp+1., dtemp+ntodo);

          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum = elemnum + (ntodo * elemincre);

            if (elemnum >= repeat)  /* completed a row; start on later row */
            {
                rowincre = elemnum / repeat;
                rownum += rowincre;
                elemnum = elemnum - (rowincre * repeat);
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while reading FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi1u4(unsigned char *input, /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
   unsigned long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (unsigned long) input[ii];  /* copy input */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DULONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DULONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = ULONG_MAX;
                }
                else
                    output[ii] = (unsigned long) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (unsigned long) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DULONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DULONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = ULONG_MAX;
                    }
                    else
                        output[ii] = (unsigned long) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi2u4(short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
   unsigned long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else
                    output[ii] = (unsigned long) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DULONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DULONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = ULONG_MAX;
                }
                else
                    output[ii] = (unsigned long) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else
                        output[ii] = (unsigned long) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DULONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DULONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = ULONG_MAX;
                    }
                    else
                        output[ii] = (unsigned long) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi4u4(INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
   unsigned long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 2147483648.)
        {       
           /* Instead of adding 2147483648, it is more efficient */
           /* to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
               output[ii] =  ( *(unsigned int *) &input[ii] ) ^ 0x80000000;
	    }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else
                    output[ii] = (unsigned long) input[ii]; /* copy input */
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DULONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DULONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = ULONG_MAX;
                }
                else
                    output[ii] = (unsigned long) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 2147483648.) 
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                   output[ii] =  ( *(unsigned int *) &input[ii] ) ^ 0x80000000;
            }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else
                    output[ii] = (unsigned long) input[ii]; /* copy input */
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DULONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DULONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = ULONG_MAX;
                    }
                    else
                        output[ii] = (unsigned long) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi8u4(LONGLONG *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG tnull,       /* I - value of FITS TNULLn keyword if any */
   unsigned long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    ULONGLONG ulltemp;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                if (ulltemp > ULONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = ULONG_MAX;
                }
                else
                    output[ii] = (unsigned long) ulltemp;
            }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > ULONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = ULONG_MAX;
                }
                else
                    output[ii] = (unsigned long) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DULONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DULONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = ULONG_MAX;
                }
                else
                    output[ii] = (unsigned long) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                    if (ulltemp > ULONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = ULONG_MAX;
                    }
                    else
		    {
                        output[ii] = (unsigned long) ulltemp;
		    }
                }
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > ULONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = ULONG_MAX;
                    }
                    else
                        output[ii] = (unsigned long) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DULONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DULONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = ULONG_MAX;
                    }
                    else
                        output[ii] = (unsigned long) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr4u4(float *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
   unsigned long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DULONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > DULONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = ULONG_MAX;
                }
                else
                    output[ii] = (unsigned long) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DULONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DULONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = ULONG_MAX;
                }
                else
                    output[ii] = (unsigned long) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr++;       /* point to MSBs */
#endif

        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DULONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > DULONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = ULONG_MAX;
                    }
                    else
                        output[ii] = (unsigned long) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  { 
                    if (zero < DULONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (zero > DULONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = ULONG_MAX;
                    }
                    else
                      output[ii] = (unsigned long) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DULONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DULONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = ULONG_MAX;
                    }
                    else
                        output[ii] = (unsigned long) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr8u4(double *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
   unsigned long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DULONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > DULONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = ULONG_MAX;
                }
                else
                    output[ii] = (unsigned long) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DULONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DULONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = ULONG_MAX;
                }
                else
                    output[ii] = (unsigned long) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr += 3;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DULONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > DULONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = ULONG_MAX;
                    }
                    else
                        output[ii] = (unsigned long) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  { 
                    if (zero < DULONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (zero > DULONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = ULONG_MAX;
                    }
                    else
                      output[ii] = (unsigned long) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DULONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DULONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = ULONG_MAX;
                    }
                    else
                        output[ii] = (unsigned long) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffstru4(char *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            long twidth,          /* I - width of each substring of chars    */
            double implipower,    /* I - power of 10 of implied decimal      */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            char  *snull,         /* I - value of FITS null string, if any   */
   unsigned long nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned long *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file. Check
  for null values and do scaling if required. The nullcheck code value
  determines how any null values in the input array are treated. A null
  value is an input pixel that is equal to snull.  If nullcheck= 0, then
  no special checking for nulls is performed.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    int nullen;
    long ii;
    double dvalue;
    char *cstring, message[FLEN_ERRMSG];
    char *cptr, *tpos;
    char tempstore, chrzero = '0';
    double val, power;
    int exponent, sign, esign, decpt;

    nullen = strlen(snull);
    cptr = input;  /* pointer to start of input string */
    for (ii = 0; ii < ntodo; ii++)
    {
      cstring = cptr;
      /* temporarily insert a null terminator at end of the string */
      tpos = cptr + twidth;
      tempstore = *tpos;
      *tpos = 0;

      /* check if null value is defined, and if the    */
      /* column string is identical to the null string */
      if (snull[0] != ASCII_NULL_UNDEFINED && 
         !strncmp(snull, cptr, nullen) )
      {
        if (nullcheck)  
        {
          *anynull = 1;    
          if (nullcheck == 1)
            output[ii] = nullval;
          else
            nullarray[ii] = 1;
        }
        cptr += twidth;
      }
      else
      {
        /* value is not the null value, so decode it */
        /* remove any embedded blank characters from the string */

        decpt = 0;
        sign = 1;
        val  = 0.;
        power = 1.;
        exponent = 0;
        esign = 1;

        while (*cptr == ' ')               /* skip leading blanks */
           cptr++;

        if (*cptr == '-' || *cptr == '+')  /* check for leading sign */
        {
          if (*cptr == '-')
             sign = -1;

          cptr++;

          while (*cptr == ' ')         /* skip blanks between sign and value */
            cptr++;
        }

        while (*cptr >= '0' && *cptr <= '9')
        {
          val = val * 10. + *cptr - chrzero;  /* accumulate the value */
          cptr++;

          while (*cptr == ' ')         /* skip embedded blanks in the value */
            cptr++;
        }

        if (*cptr == '.' || *cptr == ',')       /* check for decimal point */
        {
          decpt = 1;       /* set flag to show there was a decimal point */
          cptr++;
          while (*cptr == ' ')         /* skip any blanks */
            cptr++;

          while (*cptr >= '0' && *cptr <= '9')
          {
            val = val * 10. + *cptr - chrzero;  /* accumulate the value */
            power = power * 10.;
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks in the value */
              cptr++;
          }
        }

        if (*cptr == 'E' || *cptr == 'D')  /* check for exponent */
        {
          cptr++;
          while (*cptr == ' ')         /* skip blanks */
              cptr++;
  
          if (*cptr == '-' || *cptr == '+')  /* check for exponent sign */
          {
            if (*cptr == '-')
               esign = -1;

            cptr++;

            while (*cptr == ' ')        /* skip blanks between sign and exp */
              cptr++;
          }

          while (*cptr >= '0' && *cptr <= '9')
          {
            exponent = exponent * 10 + *cptr - chrzero;  /* accumulate exp */
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks */
              cptr++;
          }
        }

        if (*cptr  != 0)  /* should end up at the null terminator */
        {
          snprintf(message, FLEN_ERRMSG,"Cannot read number from ASCII table");
          ffpmsg(message);
          snprintf(message, FLEN_ERRMSG,"Column field = %s.", cstring);
          ffpmsg(message);
          /* restore the char that was overwritten by the null */
          *tpos = tempstore;
          return(*status = BAD_C2D);
        }

        if (!decpt)  /* if no explicit decimal, use implied */
           power = implipower;

        dvalue = (sign * val / power) * pow(10., (double) (esign * exponent));

        dvalue = dvalue * scale + zero;   /* apply the scaling */

        if (dvalue < DULONG_MIN)
        {
            *status = OVERFLOW_ERR;
            output[ii] = 0;
        }
        else if (dvalue > DULONG_MAX)
        {
            *status = OVERFLOW_ERR;
            output[ii] = ULONG_MAX;
        }
        else
            output[ii] = (unsigned long) dvalue;
      }
      /* restore the char that was overwritten by the null */
      *tpos = tempstore;
    }
    return(*status);
}

/* ======================================================================== */
/*      the following routines support the 'long long' data type            */
/* ======================================================================== */

/*--------------------------------------------------------------------------*/
int ffgpvujj(fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            ULONGLONG  nulval, /* I - value for undefined pixels              */
            ULONGLONG  *array, /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    char cdummy;
    int nullcheck = 1;
    ULONGLONG nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
         nullvalue = nulval;  /* set local variable */

        fits_read_compressed_pixels(fptr, TULONGLONG, firstelem, nelem,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclujj(fptr, 2, row, firstelem, nelem, 1, 1, nulval,
               array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpfujj(fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            ULONGLONG  *array, /* O - array of values that are returned       */
            char *nularray,   /* O - array of null pixel flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Any undefined pixels in the returned array will be set = 0 and the 
  corresponding nularray value will be set = 1.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    int nullcheck = 2;
    ULONGLONG dummy = 0;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, TULONGLONG, firstelem, nelem,
            nullcheck, NULL, array, nularray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclujj(fptr, 2, row, firstelem, nelem, 1, 2, dummy,
               array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg2dujj(fitsfile *fptr, /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           ULONGLONG nulval ,/* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           ULONGLONG  *array,/* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    /* call the 3D reading routine, with the 3rd dimension = 1 */

    ffg3dujj(fptr, group, nulval, ncols, naxis2, naxis1, naxis2, 1, array, 
           anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg3dujj(fitsfile *fptr, /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
           ULONGLONG nulval, /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  nrows,     /* I - number of rows in each plane of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  naxis3,    /* I - FITS image NAXIS3 value                 */
           ULONGLONG  *array,/* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 3-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    long tablerow, ii, jj;
    char cdummy;
    int nullcheck = 1;
    long inc[] = {1,1,1};
    LONGLONG fpixel[] = {1,1,1}, nfits, narray;
    LONGLONG lpixel[3];
    ULONGLONG nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        lpixel[0] = ncols;
        lpixel[1] = nrows;
        lpixel[2] = naxis3;
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TULONGLONG, fpixel, lpixel, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
       /* all the image pixels are contiguous, so read all at once */
       ffgclujj(fptr, 2, tablerow, 1, naxis1 * naxis2 * naxis3, 1, 1, nulval,
               array, &cdummy, anynul, status);
       return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to read */
    narray = 0;  /* next pixel in output array to be filled */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* reading naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffgclujj(fptr, 2, tablerow, nfits, naxis1, 1, 1, nulval,
          &array[narray], &cdummy, anynul, status) > 0)
          return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsvujj(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           ULONGLONG nulval,/* I - value to set undefined pixels             */
           ULONGLONG *array,/* O - array to be filled and returned           */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dir[9];
    long nelem, nultyp, ninc, numcol;
    LONGLONG felem, dsize[10], blcll[9], trcll[9];
    int hdutype, anyf;
    char ldummy, msg[FLEN_ERRMSG];
    int nullcheck = 1;
    ULONGLONG nullvalue;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG, "NAXIS = %d in call to ffgsvj is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TULONGLONG, blcll, trcll, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 1;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
        dir[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        if (hdutype == IMAGE_HDU)
        {
           dir[ii] = -1;
        }
        else
        {
          snprintf(msg, FLEN_ERRMSG,"ffgsvj: illegal range specified for axis %ld", ii + 1);
          ffpmsg(msg);
          return(*status = BAD_PIX_NUM);
        }
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
      dsize[ii] = dsize[ii] * dir[ii];
    }
    dsize[naxis] = dsize[naxis] * dir[naxis];

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0]*dir[0] - str[0]*dir[0]) / inc[0] + 1;
      ninc = incr[0] * dir[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]*dir[8]; i8 <= stp[8]*dir[8]; i8 += incr[8])
     {
      for (i7 = str[7]*dir[7]; i7 <= stp[7]*dir[7]; i7 += incr[7])
      {
       for (i6 = str[6]*dir[6]; i6 <= stp[6]*dir[6]; i6 += incr[6])
       {
        for (i5 = str[5]*dir[5]; i5 <= stp[5]*dir[5]; i5 += incr[5])
        {
         for (i4 = str[4]*dir[4]; i4 <= stp[4]*dir[4]; i4 += incr[4])
         {
          for (i3 = str[3]*dir[3]; i3 <= stp[3]*dir[3]; i3 += incr[3])
          {
           for (i2 = str[2]*dir[2]; i2 <= stp[2]*dir[2]; i2 += incr[2])
           {
            for (i1 = str[1]*dir[1]; i1 <= stp[1]*dir[1]; i1 += incr[1])
            {

              felem=str[0] + (i1 - dir[1]) * dsize[1] + (i2 - dir[2]) * dsize[2] + 
                             (i3 - dir[3]) * dsize[3] + (i4 - dir[4]) * dsize[4] +
                             (i5 - dir[5]) * dsize[5] + (i6 - dir[6]) * dsize[6] +
                             (i7 - dir[7]) * dsize[7] + (i8 - dir[8]) * dsize[8];

              if ( ffgclujj(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &ldummy, &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsfujj(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
           ULONGLONG *array,/* O - array to be filled and returned           */
           char *flagval,  /* O - set to 1 if corresponding value is null   */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dsize[10];
    LONGLONG blcll[9], trcll[9];
    long felem, nelem, nultyp, ninc, numcol;
    ULONGLONG nulval = 0;
    int hdutype, anyf;
    char msg[FLEN_ERRMSG];
    int nullcheck = 2;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvj is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

         fits_read_compressed_img(fptr, TULONGLONG, blcll, trcll, inc,
            nullcheck, NULL, array, flagval, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 2;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvujj: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgclujj(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &flagval[i0], &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffggpujj(fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            long  firstelem,  /* I - first vector element to read (1 = 1st)  */
            long  nelem,      /* I - number of values to read                */
            ULONGLONG  *array, /* O - array of values that are returned       */
            int  *status)     /* IO - error status                           */
/*
  Read an array of group parameters from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
*/
{
    long row;
    int idummy;
    char cdummy;
    ULONGLONG dummy = 0;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgclujj(fptr, 1, row, firstelem, nelem, 1, 1, dummy,
               array, &cdummy, &idummy, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvujj(fitsfile *fptr,  /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           ULONGLONG  nulval, /* I - value for null pixels                   */
           ULONGLONG *array,  /* O - array of values that are read           */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgclujj(fptr, colnum, firstrow, firstelem, nelem, 1, 1, nulval,
           array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfujj(fitsfile *fptr,  /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
           ULONGLONG  *array, /* O - array of values that are read           */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    ULONGLONG dummy = 0;

    ffgclujj(fptr, colnum, firstrow, firstelem, nelem, 1, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgclujj( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  elemincre,  /* I - pixel increment; e.g., 2 = every other  */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
            ULONGLONG  nulval, /* I - value for null pixels if nultyp = 1     */
            ULONGLONG  *array, /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer be a virtual column in a 1 or more grouped FITS primary
  array or image extension.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The output array of values will be converted from the datatype of the column 
  and will be scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    double scale, zero, power = 1., dtemp;
    int tcode, maxelem2, hdutype, xcode, decimals;
    long twidth, incre;
    long ii, xwidth, ntodo;
    int convert, nulcheck, readcheck = 0;
    LONGLONG repeat, startpos, elemnum, readptr, tnull;
    LONGLONG rowlen, rownum, remain, next, rowincre, maxelem;
    char tform[20];
    char message[81];
    char snull[20];   /*  the FITS null value if reading from ASCII table  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    if (anynul)
        *anynul = 0;

    if (nultyp == 2)
        memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (elemincre < 0)
        readcheck = -1;  /* don't do range checking in this case */

    if (ffgcprll(fptr, colnum, firstrow, firstelem, nelem, readcheck, &scale, &zero,
         tform, &twidth, &tcode, &maxelem2, &startpos, &elemnum, &incre,
         &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0 )
         return(*status);
    maxelem = maxelem2;

    incre *= elemincre;   /* multiply incre to just get every nth pixel */

    if (tcode == TSTRING)    /* setup for ASCII tables */
    {
      /* get the number of implied decimal places if no explicit decmal point */
      ffasfm(tform, &xcode, &xwidth, &decimals, status); 
      for(ii = 0; ii < decimals; ii++)
        power *= 10.;
    }
    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (tcode%10 == 1 &&        /* if reading an integer column, and  */ 
            tnull == NULL_UNDEFINED) /* if a null value is not defined,    */
            nulcheck = 0;            /* then do not check for null values. */

    else if (tcode == TSHORT && (tnull > SHRT_MAX || tnull < SHRT_MIN) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TBYTE && (tnull > 255 || tnull < 0) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TSTRING && snull[0] == ASCII_NULL_UNDEFINED)
         nulcheck = 0;

    convert = 1;

    /*---------------------------------------------------------------------*/
    /*  Now read the pixels from the FITS column. If the column does not   */
    /*  have the same datatype as the output array, then we have to read   */
    /*  the raw values into a temporary buffer (of limited size).  In      */
    /*  the case of a vector colum read only 1 vector of values at a time  */
    /*  then skip to the next row if more values need to be read.          */
    /*  After reading the raw values, then call the fffXXYY routine to (1) */
    /*  test for undefined values, (2) convert the datatype if necessary,  */
    /*  and (3) scale the values by the FITS TSCALn and TZEROn linear      */
    /*  scaling parameters.                                                */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */

    while (remain)
    {
        /* limit the number of pixels to read at one time to the number that
           will fit in the buffer or to the number of pixels that remain in
           the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);
        if (elemincre >= 0)
        {
          ntodo = (long) minvalue(ntodo, ((repeat - elemnum - 1)/elemincre +1));
        }
        else
        {
          ntodo = (long) minvalue(ntodo, (elemnum/(-elemincre) +1));
        }

        readptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * (incre / elemincre));

        switch (tcode) 
        {
            case (TLONGLONG):
                ffgi8b(fptr, readptr, ntodo, incre, (long *) &array[next],
                       status);
                fffi8u8((LONGLONG *) &array[next], ntodo, scale, zero, 
                           nulcheck, tnull, nulval, &nularray[next], 
                           anynul, &array[next], status);
                break;
            case (TLONG):
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) buffer,
                       status);
                fffi4u8((INT32BIT *) buffer, ntodo, scale, zero, 
                        nulcheck, (INT32BIT) tnull, nulval, &nularray[next], 
                        anynul, &array[next], status);
                break;
            case (TBYTE):
                ffgi1b(fptr, readptr, ntodo, incre, (unsigned char *) buffer,
                       status);
                fffi1u8((unsigned char *) buffer, ntodo, scale, zero, nulcheck, 
                     (unsigned char) tnull, nulval, &nularray[next], anynul, 
                     &array[next], status);
                break;
            case (TSHORT):
                ffgi2b(fptr, readptr, ntodo, incre, (short  *) buffer, status);
                fffi2u8((short  *) buffer, ntodo, scale, zero, nulcheck, 
                      (short) tnull, nulval, &nularray[next], anynul, 
                      &array[next], status);
                break;
            case (TFLOAT):
                ffgr4b(fptr, readptr, ntodo, incre, (float  *) buffer, status);
                fffr4u8((float  *) buffer, ntodo, scale, zero, nulcheck, 
                       nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TDOUBLE):
                ffgr8b(fptr, readptr, ntodo, incre, (double *) buffer, status);
                fffr8u8((double *) buffer, ntodo, scale, zero, nulcheck, 
                          nulval, &nularray[next], anynul, 
                          &array[next], status);
                break;
            case (TSTRING):
                ffmbyt(fptr, readptr, REPORT_EOF, status);
       
                if (incre == twidth)    /* contiguous bytes */
                     ffgbyt(fptr, ntodo * twidth, buffer, status);
                else
                     ffgbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                               status);

                fffstru8((char *) buffer, ntodo, scale, zero, twidth, power,
                     nulcheck, snull, nulval, &nularray[next], anynul,
                     &array[next], status);
                break;

            default:  /*  error trap for invalid column format */
                snprintf(message, 81, 
                   "Cannot read numbers from column %d which has format %s",
                    colnum, tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous read operation */
        {
	  dtemp = (double) next;
          if (hdutype > 0)
            snprintf(message, 81,
            "Error reading elements %.0f thru %.0f from column %d (ffgclj).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            snprintf(message, 81,
            "Error reading elements %.0f thru %.0f from image (ffgclj).",
              dtemp+1., dtemp+ntodo);

          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum = elemnum + (ntodo * elemincre);

            if (elemnum >= repeat)  /* completed a row; start on later row */
            {
                rowincre = elemnum / repeat;
                rownum += rowincre;
                elemnum = elemnum - (rowincre * repeat);
            }
            else if (elemnum < 0)  /* completed a row; start on a previous row */
            {
                rowincre = (-elemnum - 1) / repeat + 1;
                rownum -= rowincre;
                elemnum = (rowincre * repeat) + elemnum;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while reading FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi1u8(unsigned char *input, /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
            ULONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            ULONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
	    {
	        if (input[ii] < 0) 
		{
                   *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
		else
		{
                    output[ii] = (ULONGLONG) input[ii];  /* copy input to output */
		}
	    }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DULONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT64_MAX;
                }
                else
                    output[ii] = (ULONGLONG) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else if (input[ii] < 0) 
		{
                   *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
		else
                    output[ii] = (ULONGLONG) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DULONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT64_MAX;
                    }
                    else
                        output[ii] = (ULONGLONG) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi2u8(short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            ULONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            ULONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
	    {
	        if (input[ii] < 0) 
		{
                   *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
		else
		{
                    output[ii] = (ULONGLONG) input[ii];   /* copy input to output */
                }
	    }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DLONGLONG_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MIN;
                }
                else if (dvalue > DLONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = LONGLONG_MAX;
                }
                else
                    output[ii] = (LONGLONG) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (LONGLONG) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DLONGLONG_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MIN;
                    }
                    else if (dvalue > DLONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = LONGLONG_MAX;
                    }
                    else
                        output[ii] = (LONGLONG) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi4u8(INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            ULONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            ULONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
	    {
	        if (input[ii] < 0) 
		{
                   *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
		else
		{
                   output[ii] = (ULONGLONG) input[ii];   /* copy input to output */
		}
	    }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DULONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT64_MAX;
                }
                else
                    output[ii] = (LONGLONG) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
	        else if (input[ii] < 0) 
		{
                   *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else
		{
                    output[ii] = (ULONGLONG) input[ii];
		}
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DULONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT64_MAX;
                    }
                    else
                        output[ii] = (ULONGLONG) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi8u8(LONGLONG *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG tnull,       /* I - value of FITS TNULLn keyword if any */
            ULONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            ULONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
                output[ii] = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);
            }
        }
        else        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
	    {
	    	if (input[ii] < 0) 
		{
                   *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
		else
		{
                    output[ii] =  input[ii];   /* copy input to output */
		}
	    }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DULONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT64_MAX;
                }
                else
                    output[ii] = (ULONGLONG) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {

                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                   output[ii] = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);
                }
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
		{
 	    	    if (input[ii] < 0) 
		    {
                       *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
		    else
		    {
                        output[ii] =  input[ii];   /* copy input to output */
		    }
		}
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DULONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT64_MAX;
                    }
                    else
                        output[ii] = (ULONGLONG) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr4u8(float *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            ULONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            ULONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > DULONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT64_MAX;
                }
                else
                    output[ii] = (ULONGLONG) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DULONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT64_MAX;
                }
                else
                    output[ii] = (ULONGLONG) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr++;       /* point to MSBs */
#endif

        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > DULONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT64_MAX;
                    }
                    else
                        output[ii] = (ULONGLONG) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  {
                    if (zero < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (zero > DULONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT64_MAX;
                    }
                    else
                        output[ii] = (ULONGLONG) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DULONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT64_MAX;
                    }
                    else
                        output[ii] = (ULONGLONG) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr8u8(double *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            ULONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            ULONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > DULONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT64_MAX;
                }
                else
                    output[ii] = (ULONGLONG) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DULONGLONG_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT64_MAX;
                }
                else
                    output[ii] = (ULONGLONG) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr += 3;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > DULONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT64_MAX;
                    }
                    else
                        output[ii] = (ULONGLONG) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  {
                    if (zero < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (zero > DULONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT64_MAX;
                    }
                    else
                        output[ii] = (ULONGLONG) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DULONGLONG_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT64_MAX;
                    }
                    else
                        output[ii] = (ULONGLONG) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffstru8(char *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            long twidth,          /* I - width of each substring of chars    */
            double implipower,    /* I - power of 10 of implied decimal      */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            char  *snull,         /* I - value of FITS null string, if any   */
            ULONGLONG nullval,     /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            ULONGLONG *output,     /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file. Check
  for null values and do scaling if required. The nullcheck code value
  determines how any null values in the input array are treated. A null
  value is an input pixel that is equal to snull.  If nullcheck= 0, then
  no special checking for nulls is performed.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    int nullen;
    long ii;
    double dvalue;
    char *cstring, message[81];
    char *cptr, *tpos;
    char tempstore, chrzero = '0';
    double val, power;
    int exponent, sign, esign, decpt;

    nullen = strlen(snull);
    cptr = input;  /* pointer to start of input string */
    for (ii = 0; ii < ntodo; ii++)
    {
      cstring = cptr;
      /* temporarily insert a null terminator at end of the string */
      tpos = cptr + twidth;
      tempstore = *tpos;
      *tpos = 0;

      /* check if null value is defined, and if the    */
      /* column string is identical to the null string */
      if (snull[0] != ASCII_NULL_UNDEFINED && 
         !strncmp(snull, cptr, nullen) )
      {
        if (nullcheck)  
        {
          *anynull = 1;    
          if (nullcheck == 1)
            output[ii] = nullval;
          else
            nullarray[ii] = 1;
        }
        cptr += twidth;
      }
      else
      {
        /* value is not the null value, so decode it */
        /* remove any embedded blank characters from the string */

        decpt = 0;
        sign = 1;
        val  = 0.;
        power = 1.;
        exponent = 0;
        esign = 1;

        while (*cptr == ' ')               /* skip leading blanks */
           cptr++;

        if (*cptr == '-' || *cptr == '+')  /* check for leading sign */
        {
          if (*cptr == '-')
             sign = -1;

          cptr++;

          while (*cptr == ' ')         /* skip blanks between sign and value */
            cptr++;
        }

        while (*cptr >= '0' && *cptr <= '9')
        {
          val = val * 10. + *cptr - chrzero;  /* accumulate the value */
          cptr++;

          while (*cptr == ' ')         /* skip embedded blanks in the value */
            cptr++;
        }

        if (*cptr == '.' || *cptr == ',')    /* check for decimal point */
        {
          decpt = 1;       /* set flag to show there was a decimal point */
          cptr++;
          while (*cptr == ' ')         /* skip any blanks */
            cptr++;

          while (*cptr >= '0' && *cptr <= '9')
          {
            val = val * 10. + *cptr - chrzero;  /* accumulate the value */
            power = power * 10.;
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks in the value */
              cptr++;
          }
        }

        if (*cptr == 'E' || *cptr == 'D')  /* check for exponent */
        {
          cptr++;
          while (*cptr == ' ')         /* skip blanks */
              cptr++;
  
          if (*cptr == '-' || *cptr == '+')  /* check for exponent sign */
          {
            if (*cptr == '-')
               esign = -1;

            cptr++;

            while (*cptr == ' ')        /* skip blanks between sign and exp */
              cptr++;
          }

          while (*cptr >= '0' && *cptr <= '9')
          {
            exponent = exponent * 10 + *cptr - chrzero;  /* accumulate exp */
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks */
              cptr++;
          }
        }

        if (*cptr  != 0)  /* should end up at the null terminator */
        {
          sprintf(message, "Cannot read number from ASCII table");
          ffpmsg(message);
          snprintf(message, 81, "Column field = %s.", cstring);
          ffpmsg(message);
          /* restore the char that was overwritten by the null */
          *tpos = tempstore;
          return(*status = BAD_C2D);
        }

        if (!decpt)  /* if no explicit decimal, use implied */
           power = implipower;

        dvalue = (sign * val / power) * pow(10., (double) (esign * exponent));

        dvalue = dvalue * scale + zero;   /* apply the scaling */

        if (dvalue < 0)
        {
            *status = OVERFLOW_ERR;
            output[ii] = 0;
        }
        else if (dvalue > DULONGLONG_MAX)
        {
            *status = OVERFLOW_ERR;
            output[ii] = UINT64_MAX;
        }
        else
            output[ii] = (ULONGLONG) dvalue;
      }
      /* restore the char that was overwritten by the null */
      *tpos = tempstore;
    }
    return(*status);
}
cfitsio-3.47/getcoluk.c0000644000225700000360000022334513464573432014402 0ustar  cagordonlhea/*  This file, getcolk.c, contains routines that read data elements from   */
/*  a FITS image or table, with 'unsigned int' data type.                  */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffgpvuk( fitsfile *fptr,   /* I - FITS file pointer                      */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
   unsigned int   nulval,     /* I - value for undefined pixels              */
   unsigned int   *array,     /* O - array of values that are returned       */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Undefined elements will be set equal to NULVAL, unless NULVAL=0
  in which case no checking for undefined values will be performed.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    char cdummy;
    int nullcheck = 1;
    unsigned int nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
         nullvalue = nulval;  /* set local variable */

        fits_read_compressed_pixels(fptr, TUINT, firstelem, nelem,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcluk(fptr, 2, row, firstelem, nelem, 1, 1, nulval,
               array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgpfuk(fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
   unsigned int   *array,     /* O - array of values that are returned       */
            char *nularray,   /* O - array of null pixel flags               */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
  Any undefined pixels in the returned array will be set = 0 and the 
  corresponding nularray value will be set = 1.
  ANYNUL is returned with a value of .true. if any pixels are undefined.
*/
{
    long row;
    int nullcheck = 2;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_read_compressed_pixels(fptr, TUINT, firstelem, nelem,
            nullcheck, NULL, array, nularray, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcluk(fptr, 2, row, firstelem, nelem, 1, 2, 0L,
               array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg2duk(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
  unsigned int  nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
  unsigned int  *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    /* call the 3D reading routine, with the 3rd dimension = 1 */

    ffg3duk(fptr, group, nulval, ncols, naxis2, naxis1, naxis2, 1, array, 
           anynul, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffg3duk(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,     /* I - group to read (1 = 1st group)           */
  unsigned int   nulval,    /* set undefined pixels equal to this          */
           LONGLONG  ncols,     /* I - number of pixels in each row of array   */
           LONGLONG  nrows,     /* I - number of rows in each plane of array   */
           LONGLONG  naxis1,    /* I - FITS image NAXIS1 value                 */
           LONGLONG  naxis2,    /* I - FITS image NAXIS2 value                 */
           LONGLONG  naxis3,    /* I - FITS image NAXIS3 value                 */
  unsigned int   *array,    /* O - array to be filled and returned         */
           int  *anynul,    /* O - set to 1 if any values are null; else 0 */
           int  *status)    /* IO - error status                           */
/*
  Read an entire 3-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being read).  Any null
  values in the array will be set equal to the value of nulval, unless
  nulval = 0 in which case no null checking will be performed.
*/
{
    long tablerow, ii, jj;
    char cdummy;
    int nullcheck = 1;
    long inc[] = {1,1,1};
    LONGLONG fpixel[] = {1,1,1}, nfits, narray;
    LONGLONG lpixel[3];
    unsigned int nullvalue;

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        lpixel[0] = ncols;
        lpixel[1] = nrows;
        lpixel[2] = naxis3;
        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TUINT, fpixel, lpixel, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
       /* all the image pixels are contiguous, so read all at once */
       ffgcluk(fptr, 2, tablerow, 1, naxis1 * naxis2 * naxis3, 1, 1, nulval,
               array, &cdummy, anynul, status);
       return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to read */
    narray = 0;  /* next pixel in output array to be filled */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* reading naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffgcluk(fptr, 2, tablerow, nfits, naxis1, 1, 1, nulval,
          &array[narray], &cdummy, anynul, status) > 0)
          return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsvuk(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
  unsigned int  nulval,    /* I - value to set undefined pixels             */
  unsigned int  *array,    /* O - array to be filled and returned           */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9];
    long nelem, nultyp, ninc, numcol;
    LONGLONG felem, dsize[10], blcll[9], trcll[9];
    int hdutype, anyf;
    char ldummy, msg[FLEN_ERRMSG];
    int nullcheck = 1;
    unsigned int nullvalue;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvuk is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        nullvalue = nulval;  /* set local variable */

        fits_read_compressed_img(fptr, TUINT, blcll, trcll, inc,
            nullcheck, &nullvalue, array, NULL, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 1;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvuk: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgcluk(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &ldummy, &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsfuk(fitsfile *fptr, /* I - FITS file pointer                         */
           int  colnum,    /* I - number of the column to read (1 = 1st)    */
           int naxis,      /* I - number of dimensions in the FITS array    */
           long  *naxes,   /* I - size of each dimension                    */
           long  *blc,     /* I - 'bottom left corner' of the subsection    */
           long  *trc,     /* I - 'top right corner' of the subsection      */
           long  *inc,     /* I - increment to be applied in each dimension */
  unsigned int  *array,    /* O - array to be filled and returned           */
           char *flagval,  /* O - set to 1 if corresponding value is null   */
           int  *anynul,   /* O - set to 1 if any values are null; else 0   */
           int  *status)   /* IO - error status                             */
/*
  Read a subsection of data values from an image or a table column.
  This routine is set up to handle a maximum of nine dimensions.
*/
{
    long ii,i0, i1,i2,i3,i4,i5,i6,i7,i8,row,rstr,rstp,rinc;
    long str[9],stp[9],incr[9],dsize[10];
    LONGLONG blcll[9], trcll[9];
    long felem, nelem, nultyp, ninc, numcol;
    long nulval = 0;
    int hdutype, anyf;
    char msg[FLEN_ERRMSG];
    int nullcheck = 2;

    if (naxis < 1 || naxis > 9)
    {
        snprintf(msg, FLEN_ERRMSG,"NAXIS = %d in call to ffgsvj is out of range", naxis);
        ffpmsg(msg);
        return(*status = BAD_DIMEN);
    }

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        for (ii=0; ii < naxis; ii++) {
	    blcll[ii] = blc[ii];
	    trcll[ii] = trc[ii];
	}

        fits_read_compressed_img(fptr, TUINT, blcll, trcll, inc,
            nullcheck, NULL, array, flagval, anynul, status);
        return(*status);
    }

/*
    if this is a primary array, then the input COLNUM parameter should
    be interpreted as the row number, and we will alway read the image
    data from column 2 (any group parameters are in column 1).
*/
    if (ffghdt(fptr, &hdutype, status) > 0)
        return(*status);

    if (hdutype == IMAGE_HDU)
    {
        /* this is a primary array, or image extension */
        if (colnum == 0)
        {
            rstr = 1;
            rstp = 1;
        }
        else
        {
            rstr = colnum;
            rstp = colnum;
        }
        rinc = 1;
        numcol = 2;
    }
    else
    {
        /* this is a table, so the row info is in the (naxis+1) elements */
        rstr = blc[naxis];
        rstp = trc[naxis];
        rinc = inc[naxis];
        numcol = colnum;
    }

    nultyp = 2;
    if (anynul)
        *anynul = FALSE;

    i0 = 0;
    for (ii = 0; ii < 9; ii++)
    {
        str[ii] = 1;
        stp[ii] = 1;
        incr[ii] = 1;
        dsize[ii] = 1;
    }

    for (ii = 0; ii < naxis; ii++)
    {
      if (trc[ii] < blc[ii])
      {
        snprintf(msg, FLEN_ERRMSG,"ffgsvj: illegal range specified for axis %ld", ii + 1);
        ffpmsg(msg);
        return(*status = BAD_PIX_NUM);
      }

      str[ii] = blc[ii];
      stp[ii] = trc[ii];
      incr[ii] = inc[ii];
      dsize[ii + 1] = dsize[ii] * naxes[ii];
    }

    if (naxis == 1 && naxes[0] == 1)
    {
      /* This is not a vector column, so read all the rows at once */
      nelem = (rstp - rstr) / rinc + 1;
      ninc = rinc;
      rstp = rstr;
    }
    else
    {
      /* have to read each row individually, in all dimensions */
      nelem = (stp[0] - str[0]) / inc[0] + 1;
      ninc = incr[0];
    }

    for (row = rstr; row <= rstp; row += rinc)
    {
     for (i8 = str[8]; i8 <= stp[8]; i8 += incr[8])
     {
      for (i7 = str[7]; i7 <= stp[7]; i7 += incr[7])
      {
       for (i6 = str[6]; i6 <= stp[6]; i6 += incr[6])
       {
        for (i5 = str[5]; i5 <= stp[5]; i5 += incr[5])
        {
         for (i4 = str[4]; i4 <= stp[4]; i4 += incr[4])
         {
          for (i3 = str[3]; i3 <= stp[3]; i3 += incr[3])
          {
           for (i2 = str[2]; i2 <= stp[2]; i2 += incr[2])
           {
            for (i1 = str[1]; i1 <= stp[1]; i1 += incr[1])
            {
              felem=str[0] + (i1 - 1) * dsize[1] + (i2 - 1) * dsize[2] + 
                             (i3 - 1) * dsize[3] + (i4 - 1) * dsize[4] +
                             (i5 - 1) * dsize[5] + (i6 - 1) * dsize[6] +
                             (i7 - 1) * dsize[7] + (i8 - 1) * dsize[8];

              if ( ffgcluk(fptr, numcol, row, felem, nelem, ninc, nultyp,
                   nulval, &array[i0], &flagval[i0], &anyf, status) > 0)
                   return(*status);

              if (anyf && anynul)
                  *anynul = TRUE;

              i0 += nelem;
            }
           }
          }
         }
        }
       }
      }
     }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffggpuk( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to read (1 = 1st group)           */
            long  firstelem,  /* I - first vector element to read (1 = 1st)  */
            long  nelem,      /* I - number of values to read                */
   unsigned int  *array,     /* O - array of values that are returned       */
            int  *status)     /* IO - error status                           */
/*
  Read an array of group parameters from the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being read).
*/
{
    long row;
    int idummy;
    char cdummy;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffgcluk(fptr, 1, row, firstelem, nelem, 1, 1, 0L,
               array, &cdummy, &idummy, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcvuk(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
  unsigned int   nulval,     /* I - value for null pixels                   */
  unsigned int  *array,      /* O - array of values that are read           */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Any undefined pixels will be set equal to the value of 'nulval' unless
  nulval = 0 in which case no checks for undefined pixels will be made.
*/
{
    char cdummy;

    ffgcluk(fptr, colnum, firstrow, firstelem, nelem, 1, 1, nulval,
           array, &cdummy, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcfuk(fitsfile *fptr,   /* I - FITS file pointer                       */
           int  colnum,      /* I - number of column to read (1 = 1st col)  */
           LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
           LONGLONG  firstelem,  /* I - first vector element to read (1 = 1st)  */
           LONGLONG  nelem,      /* I - number of values to read                */
  unsigned int   *array,     /* O - array of values that are read           */
           char *nularray,   /* O - array of flags: 1 if null pixel; else 0 */
           int  *anynul,     /* O - set to 1 if any values are null; else 0 */
           int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU. Automatic
  datatype conversion will be performed if the datatype of the column does not
  match the datatype of the array parameter. The output values will be scaled 
  by the FITS TSCALn and TZEROn values if these values have been defined.
  Nularray will be set = 1 if the corresponding array pixel is undefined, 
  otherwise nularray will = 0.
*/
{
    int dummy = 0;

    ffgcluk(fptr, colnum, firstrow, firstelem, nelem, 1, 2, dummy,
           array, nularray, anynul, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcluk( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to read (1 = 1st col)  */
            LONGLONG  firstrow,   /* I - first row to read (1 = 1st row)         */
            LONGLONG firstelem,  /* I - first vector element to read (1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to read                */
            long  elemincre,  /* I - pixel increment; e.g., 2 = every other  */
            int   nultyp,     /* I - null value handling code:               */
                              /*     1: set undefined pixels = nulval        */
                              /*     2: set nularray=1 for undefined pixels  */
   unsigned int   nulval,     /* I - value for null pixels if nultyp = 1     */
   unsigned int  *array,      /* O - array of values that are read           */
            char *nularray,   /* O - array of flags = 1 if nultyp = 2        */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
  Read an array of values from a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer be a virtual column in a 1 or more grouped FITS primary
  array or image extension.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The output array of values will be converted from the datatype of the column 
  and will be scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    double scale, zero, power = 1., dtemp;
    int tcode, maxelem2, hdutype, xcode, decimals;
    long twidth, incre;
    long ii, xwidth, ntodo;
    int nulcheck;
    LONGLONG repeat, startpos, elemnum, readptr, tnull;
    LONGLONG rowlen, rownum, remain, next, rowincre, maxelem;
    char tform[20];
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value if reading from ASCII table  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0 || nelem == 0)  /* inherit input status value if > 0 */
        return(*status);

    /* call the 'short' or 'long' version of this routine, if possible */
    if (sizeof(int) == sizeof(short))
        ffgclui(fptr, colnum, firstrow, firstelem, nelem, elemincre, nultyp,
          (unsigned short) nulval, (unsigned short *) array, nularray, anynul,
           status);
    else if (sizeof(int) == sizeof(long))
        ffgcluj(fptr, colnum, firstrow, firstelem, nelem, elemincre, nultyp,
          (unsigned long) nulval, (unsigned long *) array, nularray, anynul,
          status);
    else
    {
    /*
      This is a special case: sizeof(int) is not equal to sizeof(short) or
      sizeof(long).  This occurs on Alpha OSF systems where short = 2 bytes,
      int = 4 bytes, and long = 8 bytes.
    */

    buffer = cbuff;

    if (anynul)
        *anynul = 0;

    if (nultyp == 2)
        memset(nularray, 0, (size_t) nelem);   /* initialize nullarray */

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if ( ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 0, &scale, &zero,
         tform, &twidth, &tcode, &maxelem2, &startpos, &elemnum, &incre,
         &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0 )
         return(*status);
    maxelem = maxelem2;

    incre *= elemincre;   /* multiply incre to just get every nth pixel */

    if (tcode == TSTRING)    /* setup for ASCII tables */
    {
      /* get the number of implied decimal places if no explicit decmal point */
      ffasfm(tform, &xcode, &xwidth, &decimals, status); 
      for(ii = 0; ii < decimals; ii++)
        power *= 10.;
    }
    /*------------------------------------------------------------------*/
    /*  Decide whether to check for null values in the input FITS file: */
    /*------------------------------------------------------------------*/
    nulcheck = nultyp; /* by default check for null values in the FITS file */

    if (nultyp == 1 && nulval == 0)
       nulcheck = 0;    /* calling routine does not want to check for nulls */

    else if (tcode%10 == 1 &&        /* if reading an integer column, and  */ 
            tnull == NULL_UNDEFINED) /* if a null value is not defined,    */
            nulcheck = 0;            /* then do not check for null values. */

    else if (tcode == TSHORT && (tnull > SHRT_MAX || tnull < SHRT_MIN) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TBYTE && (tnull > 255 || tnull < 0) )
            nulcheck = 0;            /* Impossible null value */

    else if (tcode == TSTRING && snull[0] == ASCII_NULL_UNDEFINED)
         nulcheck = 0;

    /*----------------------------------------------------------------------*/
    /*  If FITS column and output data array have same datatype, then we do */
    /*  not need to use a temporary buffer to store intermediate datatype.  */
    /*----------------------------------------------------------------------*/
    if (tcode == TLONG)  /* Special Case: */
    {                             /* data are 4-bytes long, so read       */
                                  /* data directly into output buffer.    */

        if (nelem < (LONGLONG)INT32_MAX/4) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/4;
        }
    }

    /*---------------------------------------------------------------------*/
    /*  Now read the pixels from the FITS column. If the column does not   */
    /*  have the same datatype as the output array, then we have to read   */
    /*  the raw values into a temporary buffer (of limited size).  In      */
    /*  the case of a vector colum read only 1 vector of values at a time  */
    /*  then skip to the next row if more values need to be read.          */
    /*  After reading the raw values, then call the fffXXYY routine to (1) */
    /*  test for undefined values, (2) convert the datatype if necessary,  */
    /*  and (3) scale the values by the FITS TSCALn and TZEROn linear      */
    /*  scaling parameters.                                                */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to read */
    next = 0;                 /* next element in array to be read   */
    rownum = 0;               /* row number, relative to firstrow   */

    while (remain)
    {
        /* limit the number of pixels to read at one time to the number that
           will fit in the buffer or to the number of pixels that remain in
           the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, ((repeat - elemnum - 1)/elemincre +1));

        readptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * (incre / elemincre));

        switch (tcode) 
        {
            case (TLONG):
                ffgi4b(fptr, readptr, ntodo, incre, (INT32BIT *) &array[next],
                       status);
                    fffi4uint((INT32BIT *) &array[next], ntodo, scale, zero, 
                           nulcheck, (INT32BIT) tnull, nulval, &nularray[next],
                           anynul, &array[next], status);
                break;
            case (TLONGLONG):

                ffgi8b(fptr, readptr, ntodo, incre, (long *) buffer, status);
                fffi8uint( (LONGLONG *) buffer, ntodo, scale, zero, 
                           nulcheck, tnull, nulval, &nularray[next], 
                            anynul, &array[next], status);
                break;
            case (TBYTE):
                ffgi1b(fptr, readptr, ntodo, incre, (unsigned char *) buffer,
                       status);
                fffi1uint((unsigned char *) buffer, ntodo, scale, zero,nulcheck,
                     (unsigned char) tnull, nulval, &nularray[next], anynul, 
                     &array[next], status);
                break;
            case (TSHORT):
                ffgi2b(fptr, readptr, ntodo, incre, (short  *) buffer, status);
                fffi2uint((short  *) buffer, ntodo, scale, zero, nulcheck, 
                      (short) tnull, nulval, &nularray[next], anynul, 
                      &array[next], status);
                break;
            case (TFLOAT):
                ffgr4b(fptr, readptr, ntodo, incre, (float  *) buffer, status);
                fffr4uint((float  *) buffer, ntodo, scale, zero, nulcheck, 
                       nulval, &nularray[next], anynul, 
                       &array[next], status);
                break;
            case (TDOUBLE):
                ffgr8b(fptr, readptr, ntodo, incre, (double *) buffer, status);
                fffr8uint((double *) buffer, ntodo, scale, zero, nulcheck, 
                          nulval, &nularray[next], anynul, 
                          &array[next], status);
                break;
            case (TSTRING):
                ffmbyt(fptr, readptr, REPORT_EOF, status);
       
                if (incre == twidth)    /* contiguous bytes */
                     ffgbyt(fptr, ntodo * twidth, buffer, status);
                else
                     ffgbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                               status);

                fffstruint((char *) buffer, ntodo, scale, zero, twidth, power,
                     nulcheck, snull, nulval, &nularray[next], anynul,
                     &array[next], status);
                break;

            default:  /*  error trap for invalid column format */
                snprintf(message, FLEN_ERRMSG,
                   "Cannot read numbers from column %d which has format %s",
                    colnum, tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous read operation */
        {
	  dtemp = (double) next;
          if (hdutype > 0)
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from column %d (ffgcluk).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            snprintf(message,FLEN_ERRMSG,
            "Error reading elements %.0f thru %.0f from image (ffgcluk).",
              dtemp+1., dtemp+ntodo);

          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum = elemnum + (ntodo * elemincre);

            if (elemnum >= repeat)  /* completed a row; start on later row */
            {
                rowincre = elemnum / repeat;
                rownum += rowincre;
                elemnum = elemnum - (rowincre * repeat);
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while reading FITS data.");
        *status = NUM_OVERFLOW;
    }

    }  /* end of DEC Alpha special case */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi1uint(unsigned char *input,/* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
   unsigned int  nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned int  *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
                output[ii] = (unsigned int) input[ii];  /* copy input */
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT_MAX;
                }
                else
                    output[ii] = (unsigned int) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                    output[ii] = (unsigned int) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT_MAX;
                    }
                    else
                        output[ii] = (unsigned int) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi2uint(short *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
   unsigned int  nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned int  *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else
                    output[ii] = (unsigned int) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT_MAX;
                }
                else
                    output[ii] = (unsigned int) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else
                        output[ii] = (unsigned int) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT_MAX;
                    }
                    else
                        output[ii] = (unsigned int) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi4uint(INT32BIT *input,    /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
   unsigned int  nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned int  *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 2147483648.)
        {       
           /* Instead of adding 2147483648, it is more efficient */
           /* to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++)
               output[ii] =  ( *(unsigned int *) &input[ii] ) ^ 0x80000000;
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else
                    output[ii] = (unsigned int) input[ii]; /* copy to output */
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT_MAX;
                }
                else
                    output[ii] = (unsigned int) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero == 2147483648.) 
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                   output[ii] =  ( *(unsigned int *) &input[ii] ) ^ 0x80000000;
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else
                    output[ii] = (unsigned int) input[ii];
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT_MAX;
                    }
                    else
                        output[ii] = (unsigned int) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffi8uint(LONGLONG *input,    /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            LONGLONG tnull,       /* I - value of FITS TNULLn keyword if any */
   unsigned int  nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned int  *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to tnull.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    ULONGLONG ulltemp;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                if (ulltemp > UINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT_MAX;
                }
                else
                    output[ii] = (unsigned int) ulltemp;
            }
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < 0)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > UINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT_MAX;
                }
                else
                    output[ii] = (unsigned int) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT_MAX;
                }
                else
                    output[ii] = (unsigned int) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        if (scale == 1. && zero ==  9223372036854775808.)
        {       
            /* The column we read contains unsigned long long values. */
            /* Instead of adding 9223372036854775808, it is more efficient */
            /* and more precise to just flip the sign bit with the XOR operator */

            for (ii = 0; ii < ntodo; ii++) {
 
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    ulltemp = (ULONGLONG) (((LONGLONG) input[ii]) ^ 0x8000000000000000);

                    if (ulltemp > UINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT_MAX;
                    }
                    else
		    {
                        output[ii] = (unsigned int) ulltemp;
		    }
                }
            }
        }
        else if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (input[ii] < 0)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > UINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT_MAX;
                    }
                    else
                        output[ii] = (unsigned int) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT_MAX;
                    }
                    else
                        output[ii] = (unsigned int) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr4uint(float *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
   unsigned int  nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned int  *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DUINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > DUINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT_MAX;
                }
                else
                    output[ii] = (unsigned int) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT_MAX;
                }
                else
                    output[ii] = (unsigned int) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr++;       /* point to MSBs */
#endif

        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DUINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > DUINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT_MAX;
                    }
                    else
                        output[ii] = (unsigned int) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 2)
            {
              if (0 != (iret = fnan(*sptr) ) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  { 
                    if (zero < DUINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (zero > DUINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT_MAX;
                    }
                    else
                      output[ii] = (unsigned int) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT_MAX;
                    }
                    else
                        output[ii] = (unsigned int) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffr8uint(double *input,       /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
   unsigned int  nullval,         /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned int  *output,         /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file.
  Check for null values and do datatype conversion and scaling if required.
  The nullcheck code value determines how any null values in the input array
  are treated.  A null value is an input pixel that is equal to NaN.  If 
  nullcheck = 0, then no checking for nulls is performed and any null values
  will be transformed just like any other pixel.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    long ii;
    double dvalue;
    short *sptr, iret;

    if (nullcheck == 0)     /* no null checking required */
    {
        if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] < DUINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (input[ii] > DUINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT_MAX;
                }
                else
                    output[ii] = (unsigned int) input[ii];
            }
        }
        else             /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++)
            {
                dvalue = input[ii] * scale + zero;

                if (dvalue < DUINT_MIN)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = 0;
                }
                else if (dvalue > DUINT_MAX)
                {
                    *status = OVERFLOW_ERR;
                    output[ii] = UINT_MAX;
                }
                else
                    output[ii] = (unsigned int) dvalue;
            }
        }
    }
    else        /* must check for null values */
    {
        sptr = (short *) input;

#if BYTESWAPPED && MACHINE != VAXVMS && MACHINE != ALPHAVMS
        sptr += 3;       /* point to MSBs */
#endif
        if (scale == 1. && zero == 0.)  /* no scaling */
        {       
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                     output[ii] = 0;
              }
              else
                {
                    if (input[ii] < DUINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (input[ii] > DUINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT_MAX;
                    }
                    else
                        output[ii] = (unsigned int) input[ii];
                }
            }
        }
        else                  /* must scale the data */
        {
            for (ii = 0; ii < ntodo; ii++, sptr += 4)
            {
              if (0 != (iret = dnan(*sptr)) )  /* test for NaN or underflow */
              {
                  if (iret == 1)  /* is it a NaN? */
                  {  
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                  }
                  else            /* it's an underflow */
                  { 
                    if (zero < DUINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (zero > DUINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT_MAX;
                    }
                    else
                      output[ii] = (unsigned int) zero;
                  }
              }
              else
                {
                    dvalue = input[ii] * scale + zero;

                    if (dvalue < DUINT_MIN)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = 0;
                    }
                    else if (dvalue > DUINT_MAX)
                    {
                        *status = OVERFLOW_ERR;
                        output[ii] = UINT_MAX;
                    }
                    else
                        output[ii] = (unsigned int) dvalue;
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffstruint(char *input,        /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            long twidth,          /* I - width of each substring of chars    */
            double implipower,    /* I - power of 10 of implied decimal      */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            char  *snull,         /* I - value of FITS null string, if any   */
   unsigned int nullval,          /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
   unsigned int *output,          /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
  Copy input to output following reading of the input from a FITS file. Check
  for null values and do scaling if required. The nullcheck code value
  determines how any null values in the input array are treated. A null
  value is an input pixel that is equal to snull.  If nullcheck= 0, then
  no special checking for nulls is performed.  If nullcheck = 1, then the
  output pixel will be set = nullval if the corresponding input pixel is null.
  If nullcheck = 2, then if the pixel is null then the corresponding value of
  nullarray will be set to 1; the value of nullarray for non-null pixels 
  will = 0.  The anynull parameter will be set = 1 if any of the returned
  pixels are null, otherwise anynull will be returned with a value = 0;
*/
{
    int nullen;
    long ii;
    double dvalue;
    char *cstring, message[FLEN_ERRMSG];
    char *cptr, *tpos;
    char tempstore, chrzero = '0';
    double val, power;
    int exponent, sign, esign, decpt;

    nullen = strlen(snull);
    cptr = input;  /* pointer to start of input string */
    for (ii = 0; ii < ntodo; ii++)
    {
      cstring = cptr;
      /* temporarily insert a null terminator at end of the string */
      tpos = cptr + twidth;
      tempstore = *tpos;
      *tpos = 0;

      /* check if null value is defined, and if the    */
      /* column string is identical to the null string */
      if (snull[0] != ASCII_NULL_UNDEFINED && 
         !strncmp(snull, cptr, nullen) )
      {
        if (nullcheck)  
        {
          *anynull = 1;    
          if (nullcheck == 1)
            output[ii] = nullval;
          else
            nullarray[ii] = 1;
        }
        cptr += twidth;
      }
      else
      {
        /* value is not the null value, so decode it */
        /* remove any embedded blank characters from the string */

        decpt = 0;
        sign = 1;
        val  = 0.;
        power = 1.;
        exponent = 0;
        esign = 1;

        while (*cptr == ' ')               /* skip leading blanks */
           cptr++;

        if (*cptr == '-' || *cptr == '+')  /* check for leading sign */
        {
          if (*cptr == '-')
             sign = -1;

          cptr++;

          while (*cptr == ' ')         /* skip blanks between sign and value */
            cptr++;
        }

        while (*cptr >= '0' && *cptr <= '9')
        {
          val = val * 10. + *cptr - chrzero;  /* accumulate the value */
          cptr++;

          while (*cptr == ' ')         /* skip embedded blanks in the value */
            cptr++;
        }

        if (*cptr == '.' || *cptr == ',')       /* check for decimal point */
        {
          decpt = 1;       /* set flag to show there was a decimal point */
          cptr++;
          while (*cptr == ' ')         /* skip any blanks */
            cptr++;

          while (*cptr >= '0' && *cptr <= '9')
          {
            val = val * 10. + *cptr - chrzero;  /* accumulate the value */
            power = power * 10.;
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks in the value */
              cptr++;
          }
        }

        if (*cptr == 'E' || *cptr == 'D')  /* check for exponent */
        {
          cptr++;
          while (*cptr == ' ')         /* skip blanks */
              cptr++;
  
          if (*cptr == '-' || *cptr == '+')  /* check for exponent sign */
          {
            if (*cptr == '-')
               esign = -1;

            cptr++;

            while (*cptr == ' ')        /* skip blanks between sign and exp */
              cptr++;
          }

          while (*cptr >= '0' && *cptr <= '9')
          {
            exponent = exponent * 10 + *cptr - chrzero;  /* accumulate exp */
            cptr++;

            while (*cptr == ' ')         /* skip embedded blanks */
              cptr++;
          }
        }

        if (*cptr  != 0)  /* should end up at the null terminator */
        {
          snprintf(message, FLEN_ERRMSG,"Cannot read number from ASCII table");
          ffpmsg(message);
          snprintf(message, FLEN_ERRMSG,"Column field = %s.", cstring);
          ffpmsg(message);
          /* restore the char that was overwritten by the null */
          *tpos = tempstore;
          return(*status = BAD_C2D);
        }

        if (!decpt)  /* if no explicit decimal, use implied */
           power = implipower;

        dvalue = (sign * val / power) * pow(10., (double) (esign * exponent));

        dvalue = dvalue * scale + zero;   /* apply the scaling */

        if (dvalue < DUINT_MIN)
        {
            *status = OVERFLOW_ERR;
            output[ii] = 0;
        }
        else if (dvalue > DUINT_MAX)
        {
            *status = OVERFLOW_ERR;
            output[ii] = UINT_MAX;
        }
        else
            output[ii] = (long) dvalue;
      }
      /* restore the char that was overwritten by the null */
      *tpos = tempstore;
    }
    return(*status);
}
cfitsio-3.47/getkey.c0000644000225700000360000036544113464573432014061 0ustar  cagordonlhea/*  This file, getkey.c, contains routines that read keywords from         */
/*  a FITS header.                                                         */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include 
/* stddef.h is apparently needed to define size_t */
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffghsp(fitsfile *fptr,  /* I - FITS file pointer                     */
           int *nexist,     /* O - number of existing keywords in header */
           int *nmore,      /* O - how many more keywords will fit       */
           int *status)     /* IO - error status                         */
/*
  returns the number of existing keywords (not counting the END keyword)
  and the number of more keyword that will fit in the current header 
  without having to insert more FITS blocks.
*/
{
    if (*status > 0)
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if (nexist)
        *nexist = (int) (( ((fptr->Fptr)->headend) - 
                ((fptr->Fptr)->headstart[(fptr->Fptr)->curhdu]) ) / 80);

    if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
      if (nmore)
        *nmore = -1;   /* data not written yet, so room for any keywords */
    }
    else
    {
      /* calculate space available between the data and the END card */
      if (nmore)
        *nmore = (int) (((fptr->Fptr)->datastart - (fptr->Fptr)->headend) / 80 - 1);
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffghps(fitsfile *fptr, /* I - FITS file pointer                     */
          int *nexist,     /* O - number of existing keywords in header */
          int *position,   /* O - position of next keyword to be read   */
          int *status)     /* IO - error status                         */
/*
  return the number of existing keywords and the position of the next
  keyword that will be read.
*/
{
    if (*status > 0)
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if (nexist)
      *nexist = (int) (( ((fptr->Fptr)->headend) - ((fptr->Fptr)->headstart[(fptr->Fptr)->curhdu]) ) / 80);

    if (position)
      *position = (int) (( ((fptr->Fptr)->nextkey) - ((fptr->Fptr)->headstart[(fptr->Fptr)->curhdu]) ) / 80 + 1);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffnchk(fitsfile *fptr,  /* I - FITS file pointer                     */
           int *status)     /* IO - error status                         */
/*
  function returns the position of the first null character (ASCII 0), if
  any, in the current header.  Null characters are illegal, but the other
  CFITSIO routines that read the header will not detect this error, because
  the null gets interpreted as a normal end of string character.
*/
{
    long ii, nblock;
    LONGLONG bytepos;
    int length, nullpos;
    char block[2881];
    
    if (*status > 0)
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        return(0);  /* Don't check a file that is just being created.  */
                    /* It cannot contain nulls since CFITSIO wrote it. */
    }
    else
    {
        /* calculate number of blocks in the header */
        nblock = (long) (( (fptr->Fptr)->datastart - 
                   (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] ) / 2880);
    }

    bytepos = (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu];
    ffmbyt(fptr, bytepos, REPORT_EOF, status);  /* move to read pos. */

    block[2880] = '\0';
    for (ii = 0; ii < nblock; ii++)
    {
        if (ffgbyt(fptr, 2880, block, status) > 0)
            return(0);   /* read error of some sort */

        length = strlen(block);
        if (length != 2880)
        {
            nullpos = (ii * 2880) + length + 1;
            return(nullpos);
        }
    }

    return(0);
}
/*--------------------------------------------------------------------------*/
int ffmaky(fitsfile *fptr,    /* I - FITS file pointer                    */
          int nrec,           /* I - one-based keyword number to move to  */
          int *status)        /* IO - error status                        */
{
/*
  move pointer to the specified absolute keyword position.  E.g. this keyword 
  will then be read by the next call to ffgnky.
*/
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    (fptr->Fptr)->nextkey = (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] + ( (nrec - 1) * 80);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmrky(fitsfile *fptr,    /* I - FITS file pointer                   */
          int nmove,          /* I - relative number of keywords to move */
          int *status)        /* IO - error status                       */
{
/*
  move pointer to the specified keyword position relative to the current
  position.  E.g. this keyword  will then be read by the next call to ffgnky.
*/

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    (fptr->Fptr)->nextkey += (nmove * 80);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgnky(fitsfile *fptr,  /* I - FITS file pointer     */
           char *card,      /* O - card string           */
           int *status)     /* IO - error status         */
/*
  read the next keyword from the header - used internally by cfitsio
*/
{
    int jj, nrec;
    LONGLONG bytepos, endhead;
    char message[FLEN_ERRMSG];

    if (*status > 0)
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    card[0] = '\0';  /* make sure card is terminated, even affer read error */

/*
  Check that nextkey points to a legal keyword position.  Note that headend
  is the current end of the header, i.e., the position where a new keyword
  would be appended, however, if there are more than 1 FITS block worth of
  blank keywords at the end of the header (36 keywords per 2880 byte block)
  then the actual physical END card must be located at a starting position
  which is just 2880 bytes prior to the start of the data unit.
*/

    bytepos = (fptr->Fptr)->nextkey;
    endhead = maxvalue( ((fptr->Fptr)->headend), ((fptr->Fptr)->datastart - 2880) );

    /* nextkey must be < endhead and > than  headstart */
    if (bytepos > endhead ||  
        bytepos < (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] ) 
    {
        nrec= (int) ((bytepos - (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu]) / 80 + 1);
        snprintf(message, FLEN_ERRMSG,"Cannot get keyword number %d.  It does not exist.",
                nrec);
        ffpmsg(message);
        return(*status = KEY_OUT_BOUNDS);
    }
      
    ffmbyt(fptr, bytepos, REPORT_EOF, status);  /* move to read pos. */

    card[80] = '\0';  /* make sure card is terminate, even if ffgbyt fails */

    if (ffgbyt(fptr, 80, card, status) <= 0) 
    {
        (fptr->Fptr)->nextkey += 80;   /* increment pointer to next keyword */

        /* strip off trailing blanks with terminated string */
        jj = 79;
        while (jj >= 0 && card[jj] == ' ')
               jj--;

        card[jj + 1] = '\0';
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgnxk( fitsfile *fptr,     /* I - FITS file pointer              */
            char **inclist,     /* I - list of included keyword names */
            int ninc,           /* I - number of names in inclist     */
            char **exclist,     /* I - list of excluded keyword names */
            int nexc,           /* I - number of names in exclist     */
            char *card,         /* O - first matching keyword         */
            int  *status)       /* IO - error status                  */
/*
    Return the next keyword that matches one of the names in inclist
    but does not match any of the names in exclist.  The search
    goes from the current position to the end of the header, only.
    Wild card characters may be used in the name lists ('*', '?' and '#').
*/
{
    int casesn, match, exact, namelen;
    long ii, jj;
    char keybuf[FLEN_CARD], keyname[FLEN_KEYWORD];

    card[0] = '\0';
    if (*status > 0)
        return(*status);

    casesn = FALSE;

    /* get next card, and return with an error if hit end of header */
    while( ffgcrd(fptr, "*", keybuf, status) <= 0)
    {
        ffgknm(keybuf, keyname, &namelen, status); /* get the keyword name */
        
        /* does keyword match any names in the include list? */
        for (ii = 0; ii < ninc; ii++)
        {
            ffcmps(inclist[ii], keyname, casesn, &match, &exact);
            if (match)
            {
                /* does keyword match any names in the exclusion list? */
                jj = -1;
                while ( ++jj < nexc )
                {
                    ffcmps(exclist[jj], keyname, casesn, &match, &exact);
                    if (match)
                        break;
                }

                if (jj >= nexc)
                {
                    /* not in exclusion list, so return this keyword */
                    strcat(card, keybuf);
                    return(*status);
                }
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgky( fitsfile *fptr,     /* I - FITS file pointer        */
           int  datatype,      /* I - datatype of the value    */
           const char *keyname,      /* I - name of keyword to read  */
           void *value,        /* O - keyword value            */
           char *comm,         /* O - keyword comment          */
           int  *status)       /* IO - error status            */
/*
  Read (get) the keyword value and comment from the FITS header.
  Reads a keyword value with the datatype specified by the 2nd argument.
*/
{
    LONGLONG longval;
    double doubleval;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (datatype == TSTRING)
    {
        ffgkys(fptr, keyname, (char *) value, comm, status);
    }
    else if (datatype == TBYTE)
    {
        if (ffgkyjj(fptr, keyname, &longval, comm, status) <= 0)
        {
            if (longval > UCHAR_MAX || longval < 0)
                *status = NUM_OVERFLOW;
            else
                *(unsigned char *) value = (unsigned char) longval;
        }
    }
    else if (datatype == TSBYTE)
    {
        if (ffgkyjj(fptr, keyname, &longval, comm, status) <= 0)
        {
            if (longval > 127 || longval < -128)
                *status = NUM_OVERFLOW;
            else
                *(signed char *) value = (signed char) longval;
        }
    }
    else if (datatype == TUSHORT)
    {
        if (ffgkyjj(fptr, keyname, &longval, comm, status) <= 0)
        {
            if (longval > (long) USHRT_MAX || longval < 0)
                *status = NUM_OVERFLOW;
            else
                *(unsigned short *) value = (unsigned short) longval;
        }
    }
    else if (datatype == TSHORT)
    {
        if (ffgkyjj(fptr, keyname, &longval, comm, status) <= 0)
        {
            if (longval > SHRT_MAX || longval < SHRT_MIN)
                *status = NUM_OVERFLOW;
            else
                *(short *) value = (short) longval;
        }
    }
    else if (datatype == TUINT)
    {
        if (ffgkyjj(fptr, keyname, &longval, comm, status) <= 0)
        {
            if (longval > (long) UINT_MAX || longval < 0)
                *status = NUM_OVERFLOW;
            else
                *(unsigned int *) value = longval;
        }
    }
    else if (datatype == TINT)
    {
        if (ffgkyjj(fptr, keyname, &longval, comm, status) <= 0)
        {
            if (longval > INT_MAX || longval < INT_MIN)
                *status = NUM_OVERFLOW;
            else
                *(int *) value = longval;
        }
    }
    else if (datatype == TLOGICAL)
    {
        ffgkyl(fptr, keyname, (int *) value, comm, status);
    }
    else if (datatype == TULONG)
    {
        if (ffgkyjj(fptr, keyname, &longval, comm, status) <= 0)
        {
            if (longval > ULONG_MAX || longval < 0)
                *status = NUM_OVERFLOW;
            else
                 *(unsigned long *) value = longval;
        }
    }
    else if (datatype == TLONG)
    {
        if (ffgkyjj(fptr, keyname, &longval, comm, status) <= 0)
        {
            if (longval > LONG_MAX || longval < LONG_MIN)
                *status = NUM_OVERFLOW;
            else
                *(int *) value = longval;
        }
        ffgkyj(fptr, keyname, (long *) value, comm, status);
    }
    else if (datatype == TULONGLONG)
    {
        ffgkyujj(fptr, keyname, (ULONGLONG *) value, comm, status);
    }
    else if (datatype == TLONGLONG)
    {
        ffgkyjj(fptr, keyname, (LONGLONG *) value, comm, status);
    }
    else if (datatype == TFLOAT)
    {
        ffgkye(fptr, keyname, (float *) value, comm, status);
    }
    else if (datatype == TDOUBLE)
    {
        ffgkyd(fptr, keyname, (double *) value, comm, status);
    }
    else if (datatype == TCOMPLEX)
    {
        ffgkyc(fptr, keyname, (float *) value, comm, status);
    }
    else if (datatype == TDBLCOMPLEX)
    {
        ffgkym(fptr, keyname, (double *) value, comm, status);
    }
    else
        *status = BAD_DATATYPE;

    return(*status);
} 
/*--------------------------------------------------------------------------*/
int ffgkey( fitsfile *fptr,     /* I - FITS file pointer        */
            const char *keyname,      /* I - name of keyword to read  */
            char *keyval,       /* O - keyword value            */
            char *comm,         /* O - keyword comment          */
            int  *status)       /* IO - error status            */
/*
  Read (get) the named keyword, returning the keyword value and comment.
  The value is just the literal string of characters in the value field
  of the keyword.  In the case of a string valued keyword, the returned
  value includes the leading and closing quote characters.  The value may be
  up to 70 characters long, and the comment may be up to 72 characters long.
  If the keyword has no value (no equal sign in column 9) then a null value
  is returned.
*/
{
    char card[FLEN_CARD];

    keyval[0] = '\0';
    if (comm)
       comm[0] = '\0';

    if (*status > 0)
        return(*status);

    if (ffgcrd(fptr, keyname, card, status) > 0)    /* get the 80-byte card */
        return(*status);

    ffpsvc(card, keyval, comm, status);      /* parse the value and comment */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgrec( fitsfile *fptr,     /* I - FITS file pointer          */
            int nrec,           /* I - number of keyword to read  */
            char *card,         /* O - keyword card               */
            int  *status)       /* IO - error status              */
/*
  Read (get) the nrec-th keyword, returning the entire keyword card up to
  80 characters long.  The first keyword in the header has nrec = 1, not 0.
  The returned card value is null terminated with any trailing blank 
  characters removed.  If nrec = 0, then this routine simply moves the
  current header pointer to the top of the header.
*/
{
    if (*status > 0)
        return(*status);

    if (nrec == 0)
    {
        ffmaky(fptr, 1, status);  /* simply move to beginning of header */
        if (card)
            card[0] = '\0';           /* and return null card */
    }
    else if (nrec > 0)
    {
        ffmaky(fptr, nrec, status);
        ffgnky(fptr, card, status);
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgcrd( fitsfile *fptr,     /* I - FITS file pointer        */
            const char *name,         /* I - name of keyword to read  */
            char *card,         /* O - keyword card             */
            int  *status)       /* IO - error status            */
/*
  Read (get) the named keyword, returning the entire keyword card up to
  80 characters long.  
  The returned card value is null terminated with any trailing blank 
  characters removed.

  If the input name contains wild cards ('?' matches any single char
  and '*' matches any sequence of chars, # matches any string of decimal
  digits) then the search ends once the end of header is reached and does 
  not automatically resume from the top of the header.
*/
{
    int nkeys, nextkey, ntodo, namelen, namelen_limit, namelenminus1, cardlen;
    int ii = 0, jj, kk, wild, match, exact, hier = 0;
    char keyname[FLEN_KEYWORD], cardname[FLEN_KEYWORD];
    char *ptr1, *ptr2, *gotstar;

    if (*status > 0)
        return(*status);

    *keyname = '\0';
    
    while (name[ii] == ' ')  /* skip leading blanks in name */
        ii++;

    strncat(keyname, &name[ii], FLEN_KEYWORD - 1);

    namelen = strlen(keyname);

    while (namelen > 0 && keyname[namelen - 1] == ' ')
         namelen--;            /* ignore trailing blanks in name */

    keyname[namelen] = '\0';  /* terminate the name */

    for (ii=0; ii < namelen; ii++)       
        keyname[ii] = toupper(keyname[ii]);    /*  make upper case  */

    if (FSTRNCMP("HIERARCH", keyname, 8) == 0)
    {
        if (namelen == 8)
        {
            /* special case: just looking for any HIERARCH keyword */
            hier = 1;
        }
        else
        {
            /* ignore the leading HIERARCH and look for the 'real' name */
            /* starting with first non-blank character following HIERARCH */
            ptr1 = keyname;
            ptr2 = &keyname[8];

            while(*ptr2 == ' ')
                ptr2++;

            namelen = 0;
            while(*ptr2)
            {
                *ptr1 = *ptr2;
                 ptr1++;
                 ptr2++;
                 namelen++;
            }
            *ptr1 = '\0';
        }
    }

    /* does input name contain wild card chars?  ('?',  '*', or '#') */
    /* wild cards are currently not supported with HIERARCH keywords */

    namelen_limit = namelen;
    gotstar = 0;
    if (namelen < 9 && 
       (strchr(keyname,'?') || (gotstar = strchr(keyname,'*')) || 
        strchr(keyname,'#')) )
    {
        wild = 1;

        /* if we found a '*' wild card in the name, there might be */
        /* more than one.  Support up to 2 '*' in the template. */
        /* Thus we need to compare keywords whose names have at least */
        /* namelen - 2 characters.                                   */
        if (gotstar)
           namelen_limit -= 2;           
    }
    else
        wild = 0;

    ffghps(fptr, &nkeys, &nextkey, status); /* get no. keywords and position */

    namelenminus1 = maxvalue(namelen - 1, 1);
    ntodo = nkeys - nextkey + 1;  /* first, read from next keyword to end */
    for (jj=0; jj < 2; jj++)
    {
      for (kk = 0; kk < ntodo; kk++)
      {
        ffgnky(fptr, card, status);     /* get next keyword */

        if (hier)
        {
           if (FSTRNCMP("HIERARCH", card, 8) == 0)
                return(*status);  /* found a HIERARCH keyword */
        }
        else
        {
          ffgknm(card, cardname, &cardlen, status); /* get the keyword name */

          if (cardlen >= namelen_limit)  /* can't match if card < name */
          { 
            /* if there are no wild cards, lengths must be the same */
            if (!( !wild && cardlen != namelen) )
            {
              for (ii=0; ii < cardlen; ii++)
              {    
                /* make sure keyword is in uppercase */
                if (cardname[ii] > 96)
                {
                  /* This assumes the ASCII character set in which */
                  /* upper case characters start at ASCII(97)  */
                  /* Timing tests showed that this is 20% faster */
                  /* than calling the isupper function.          */

                  cardname[ii] = toupper(cardname[ii]);  /* make upper case */
                }
              }

              if (wild)
              {
                ffcmps(keyname, cardname, 1, &match, &exact);
                if (match)
                    return(*status); /* found a matching keyword */
              }
              else if (keyname[namelenminus1] == cardname[namelenminus1])
              {
                /* test the last character of the keyword name first, on */
                /* the theory that it is less likely to match then the first */
                /* character since many keywords begin with 'T', for example */

                if (FSTRNCMP(keyname, cardname, namelenminus1) == 0)
                {
                  return(*status);   /* found the matching keyword */
                }
              }
	      else if (namelen == 0 && cardlen == 0)
	      {
	         /* matched a blank keyword */
		 return(*status);
	      }
            }
          }
        }
      }

      if (wild || jj == 1)
            break;  /* stop at end of header if template contains wildcards */

      ffmaky(fptr, 1, status);  /* reset pointer to beginning of header */
      ntodo = nextkey - 1;      /* number of keyword to read */ 
    }

    return(*status = KEY_NO_EXIST);  /* couldn't find the keyword */
}
/*--------------------------------------------------------------------------*/
int ffgstr( fitsfile *fptr,     /* I - FITS file pointer        */
            const char *string, /* I - string to match  */
            char *card,         /* O - keyword card             */
            int  *status)       /* IO - error status            */
/*
  Read (get) the next keyword record that contains the input character string,
  returning the entire keyword card up to 80 characters long.
  The returned card value is null terminated with any trailing blank 
  characters removed.
*/
{
    int nkeys, nextkey, ntodo, stringlen;
    int jj, kk;

    if (*status > 0)
        return(*status);

    stringlen = strlen(string);
    if (stringlen > 80) {
        return(*status = KEY_NO_EXIST);  /* matching string is too long to exist */
    }

    ffghps(fptr, &nkeys, &nextkey, status); /* get no. keywords and position */
    ntodo = nkeys - nextkey + 1;  /* first, read from next keyword to end */

    for (jj=0; jj < 2; jj++)
    {
      for (kk = 0; kk < ntodo; kk++)
      {
        ffgnky(fptr, card, status);     /* get next keyword */
        if (strstr(card, string) != 0) {
            return(*status);   /* found the matching string */
        }
      }

      ffmaky(fptr, 1, status);  /* reset pointer to beginning of header */
      ntodo = nextkey - 1;      /* number of keyword to read */ 
    }

    return(*status = KEY_NO_EXIST);  /* couldn't find the keyword */
}
/*--------------------------------------------------------------------------*/
int ffgknm( char *card,         /* I - keyword card                   */
            char *name,         /* O - name of the keyword            */
            int *length,        /* O - length of the keyword name     */
            int  *status)       /* IO - error status                  */

/*
  Return the name of the keyword, and the name length.  This supports the
  ESO HIERARCH convention where keyword names may be > 8 characters long.
*/
{
    char *ptr1, *ptr2;
    int ii, namelength;

    namelength = FLEN_KEYWORD - 1;
    *name = '\0';
    *length = 0;

    /* support for ESO HIERARCH keywords; find the '=' */
    if (FSTRNCMP(card, "HIERARCH ", 9) == 0)
    {
        ptr2 = strchr(card, '=');

        if (!ptr2)   /* no value indicator ??? */
        {
            /* this probably indicates an error, so just return FITS name */
            strcat(name, "HIERARCH");
            *length = 8;
            return(*status);
        }

        /* find the start and end of the HIERARCH name */
        ptr1 = &card[9];
        while (*ptr1 == ' ')   /* skip spaces */
            ptr1++;

        strncat(name, ptr1, ptr2 - ptr1);
        ii = ptr2 - ptr1;

        while (ii > 0 && name[ii - 1] == ' ')  /* remove trailing spaces */
            ii--;

        name[ii] = '\0';
        *length = ii;
    }
    else
    {
        for (ii = 0; ii < namelength; ii++)
        {
           /* look for string terminator, or a blank */
           if (*(card+ii) != ' ' && *(card+ii) != '=' && *(card+ii) !='\0')
           {
               *(name+ii) = *(card+ii);
           }
           else
           {
               name[ii] = '\0';
               *length = ii;
               return(*status);
           }
        }

        /* if we got here, keyword is namelength characters long */
        name[namelength] = '\0';
        *length = namelength;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgunt( fitsfile *fptr,     /* I - FITS file pointer         */
            const char *keyname,      /* I - name of keyword to read   */
            char *unit,         /* O - keyword units             */
            int  *status)       /* IO - error status             */
/*
    Read (get) the units string from the comment field of the existing
    keyword. This routine uses a local FITS convention (not defined in the
    official FITS standard) in which the units are enclosed in 
    square brackets following the '/' comment field delimiter, e.g.:

    KEYWORD =                   12 / [kpc] comment string goes here
*/
{
    char valstring[FLEN_VALUE];
    char comm[FLEN_COMMENT];
    char *loc;

    if (*status > 0)
        return(*status);

    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */

    if (comm[0] == '[')
    {
        loc = strchr(comm, ']');   /*  find the closing bracket */
        if (loc)
            *loc = '\0';           /*  terminate the string */

        strcpy(unit, &comm[1]);    /*  copy the string */
     }
     else
        unit[0] = '\0';
 
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkys( fitsfile *fptr,     /* I - FITS file pointer         */
            const char *keyname,      /* I - name of keyword to read   */
            char *value,        /* O - keyword value             */
            char *comm,         /* O - keyword comment           */
            int  *status)       /* IO - error status             */
/*
  Get KeYword with a String value:
  Read (get) a simple string valued keyword.  The returned value may be up to 
  68 chars long ( + 1 null terminator char).  The routine does not support the
  HEASARC convention for continuing long string values over multiple keywords.
  The ffgkls routine may be used to read long continued strings. The returned
  comment string may be up to 69 characters long (including null terminator).
*/
{
    char valstring[FLEN_VALUE];

    if (*status > 0)
        return(*status);

    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */
    value[0] = '\0';
    ffc2s(valstring, value, status);   /* remove quotes from string */
 
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgksl( fitsfile *fptr,     /* I - FITS file pointer             */
           const char *keyname, /* I - name of keyword to read       */
           int *length,         /* O - length of the string value    */
           int  *status)        /* IO - error status                 */
/*
  Get the length of the keyword value string.
  This routine explicitly supports the CONTINUE convention for long string values.
*/
{
    char valstring[FLEN_VALUE], value[FLEN_VALUE];
    int position, contin, len;
    
    if (*status > 0)
        return(*status);

    ffgkey(fptr, keyname, valstring, NULL, status);  /* read the keyword */

    if (*status > 0)
        return(*status);

    ffghps(fptr, NULL,  &position, status); /* save the current header position */
    
    if (!valstring[0])  { /* null value string? */
        *length = 0;
    } else {
      ffc2s(valstring, value, status);  /* in case string contains "/" char  */
      *length = strlen(value);

      /* If last character is a & then value may be continued on next keyword */
      contin = 1;
      while (contin)  
      {
        len = strlen(value);

        if (len && *(value+len-1) == '&')  /*  is last char an anpersand?  */
        {
            ffgcnt(fptr, value, NULL, status);
            if (*value)    /* a null valstring indicates no continuation */
            {
               *length += strlen(value) - 1;
            }
            else
	    {
                contin = 0;
            }
        }
        else
	{
            contin = 0;
	}
      }
    }

    ffmaky(fptr, position - 1, status); /* reset header pointer to the keyword */
                                        /* since in many cases the program will read */
					/* the string value after getting the length */
    
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkls( fitsfile *fptr,     /* I - FITS file pointer             */
           const char *keyname, /* I - name of keyword to read       */
           char **value,        /* O - pointer to keyword value      */
           char *comm,          /* O - keyword comment (may be NULL) */
           int  *status)        /* IO - error status                 */
/*
  This is the original routine for reading long string keywords that use
  the CONTINUE keyword convention.  In 2016 a new routine called
  ffgsky / fits_read_string_key was added, which may provide a more 
  convenient user interface  for most applications.

  Get Keyword with possible Long String value:
  Read (get) the named keyword, returning the value and comment.
  The returned value string may be arbitrarily long (by using the HEASARC
  convention for continuing long string values over multiple keywords) so
  this routine allocates the required memory for the returned string value.
  It is up to the calling routine to free the memory once it is finished
  with the value string.  The returned comment string may be up to 69
  characters long.
*/
{
    char valstring[FLEN_VALUE], nextcomm[FLEN_COMMENT];
    int contin, commspace = 0;
    size_t len;

    if (*status > 0)
        return(*status);

    *value = NULL;  /* initialize a null pointer in case of error */

    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */

    if (*status > 0)
        return(*status);

    if (comm)
    {
        /* remaining space in comment string */
        commspace = FLEN_COMMENT - strlen(comm) - 2;
    }
    
    if (!valstring[0])   /* null value string? */
    {
      *value = (char *) malloc(1);  /* allocate and return a null string */
      **value = '\0';
    }
    else
    {
      /* allocate space,  plus 1 for null */
      *value = (char *) malloc(strlen(valstring) + 1);

      ffc2s(valstring, *value, status);   /* convert string to value */
      len = strlen(*value);

      /* If last character is a & then value may be continued on next keyword */
      contin = 1;
      while (contin)  
      {
        if (len && *(*value+len-1) == '&')  /*  is last char an ampersand?  */
        {
            ffgcnt(fptr, valstring, nextcomm, status);
            if (*valstring)    /* a null valstring indicates no continuation */
            {
               *(*value+len-1) = '\0';         /* erase the trailing & char */
               len += strlen(valstring) - 1;
               *value = (char *) realloc(*value, len + 1); /* increase size */
               strcat(*value, valstring);     /* append the continued chars */
            }
            else
	    {
                contin = 0;
                /* Without this, for case of a last CONTINUE statement ending
                   with a '&', nextcomm would retain the same string from 
                   from the previous loop iteration and the comment
                   would get concantenated twice. */
                nextcomm[0] = 0;
            }

            /* concantenate comment strings (if any) */
	    if ((commspace > 0) && (*nextcomm != 0)) 
	    {
                strcat(comm, " ");
		strncat(comm, nextcomm, commspace);
                commspace = FLEN_COMMENT - strlen(comm) - 2;
            }
        }
        else
	{
            contin = 0;
	}
      }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsky( fitsfile *fptr,     /* I - FITS file pointer             */
           const char *keyname, /* I - name of keyword to read       */
           int firstchar,       /* I - first character of string to return */
           int maxchar,         /* I - maximum length of string to return */
	                        /*    (string will be null terminated)  */      
           char *value,         /* O - pointer to keyword value      */
           int *valuelen,       /* O - total length of the keyword value string */
                                /*     The returned 'value' string may only */
				/*     contain a piece of the total string, depending */
				/*     on the value of firstchar and maxchar */
           char *comm,          /* O - keyword comment (may be NULL) */
           int  *status)        /* IO - error status                 */
/*
  Read and return the value of the specified string-valued keyword.
  
  This new routine was added in 2016 to provide a more convenient user
  interface than the older ffgkls routine.

  Read a string keyword, returning up to 'naxchars' characters of the value
  starting with the 'firstchar' character.
  The input 'value' string must be allocated at least 1 char bigger to
  allow for the terminating null character.
  
  This routine may be used to read continued string keywords that use 
  the CONTINUE keyword convention, as well as normal string keywords
  that are contained within a single header record.
  
  This routine differs from the ffkls routine in that it does not
  internally allocate memory for the returned value string, and consequently
  the calling routine does not need to call fffree to free the memory.
*/
{
    char valstring[FLEN_VALUE], nextcomm[FLEN_COMMENT];
    char *tempstring;
    int contin, commspace = 0;
    size_t len;

    if (*status > 0)
        return(*status);

    tempstring = NULL;  /* initialize in case of error */
    *value = '\0';
    if (valuelen) *valuelen = 0;
    
    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */

    if (*status > 0)
        return(*status);

    if (comm)
    {
        /* remaining space in comment string */
        commspace = FLEN_COMMENT - strlen(comm) - 2;
    }
    
    if (!valstring[0])   /* null value string? */
    {
      tempstring = (char *) malloc(1);  /* allocate and return a null string */
      *tempstring = '\0';
    }
    else
    {
      /* allocate space,  plus 1 for null */
      tempstring = (char *) malloc(strlen(valstring) + 1);

      ffc2s(valstring, tempstring, status);   /* convert string to value */
      len = strlen(tempstring);

      /* If last character is a & then value may be continued on next keyword */
      contin = 1;
      while (contin && *status <= 0)  
      {
        if (len && *(tempstring+len-1) == '&')  /*  is last char an anpersand?  */
        {
            ffgcnt(fptr, valstring, nextcomm, status);
            if (*valstring)    /* a null valstring indicates no continuation */
            {
               *(tempstring+len-1) = '\0';         /* erase the trailing & char */
               len += strlen(valstring) - 1;
               tempstring = (char *) realloc(tempstring, len + 1); /* increase size */
               strcat(tempstring, valstring);     /* append the continued chars */
            }
            else
	    {
                contin = 0;
                /* Without this, for case of a last CONTINUE statement ending
                   with a '&', nextcomm would retain the same string from 
                   from the previous loop iteration and the comment
                   would get concantenated twice. */
                nextcomm[0] = 0;
            }

            /* concantenate comment strings (if any) */
	    if ((commspace > 0) && (*nextcomm != 0)) 
	    {
                strcat(comm, " ");
		strncat(comm, nextcomm, commspace);
                commspace = FLEN_COMMENT - strlen(comm) - 2;
            }
        }
        else
	{
            contin = 0;
	}
      }
    }
    
    if (tempstring) 
    {
        len = strlen(tempstring);
	if (firstchar <= len)
            strncat(value, tempstring + (firstchar - 1), maxchar);
        free(tempstring);
	if (valuelen) *valuelen = len;  /* total length of the keyword value */
    }
    
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fffree( void *value,       /* I - pointer to keyword value  */
            int  *status)      /* IO - error status             */
/*
  Free the memory that was previously allocated by CFITSIO, 
  such as by ffgkls or fits_hdr2str
*/
{
    if (*status > 0)
        return(*status);

    if (value)
        free(value);

    return(*status);
}
 /*--------------------------------------------------------------------------*/
int ffgcnt( fitsfile *fptr,     /* I - FITS file pointer         */
            char *value,        /* O - continued string value    */
            char *comm,         /* O - continued comment string  */
            int  *status)       /* IO - error status             */
/*
  Attempt to read the next keyword, returning the string value
  if it is a continuation of the previous string keyword value.
  This uses the HEASARC convention for continuing long string values
  over multiple keywords.  Each continued string is terminated with a
  backslash character, and the continuation follows on the next keyword
  which must have the name CONTINUE without an equal sign in column 9
  of the card.  If the next card is not a continuation, then the returned
  value string will be null.
*/
{
    int tstatus;
    char card[FLEN_CARD], strval[FLEN_VALUE];

    if (*status > 0)
        return(*status);

    tstatus = 0;
    value[0] = '\0';

    if (ffgnky(fptr, card, &tstatus) > 0)  /*  read next keyword  */
        return(*status);                   /*  hit end of header  */

    if (strncmp(card, "CONTINUE  ", 10) == 0)  /* a continuation card? */
    {
        strncpy(card, "D2345678=  ", 10); /* overwrite a dummy keyword name */
        ffpsvc(card, strval, comm, &tstatus);  /*  get the string value & comment */
        ffc2s(strval, value, &tstatus);    /* remove the surrounding quotes */

        if (tstatus)       /*  return null if error status was returned  */
           value[0] = '\0';
    }
    else
        ffmrky(fptr, -1, status);  /* reset the keyword pointer */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkyl( fitsfile *fptr,     /* I - FITS file pointer         */
            const char *keyname,      /* I - name of keyword to read   */
            int  *value,        /* O - keyword value             */
            char *comm,         /* O - keyword comment           */
            int  *status)       /* IO - error status             */
/*
  Read (get) the named keyword, returning the value and comment.
  The returned value = 1 if the keyword is true, else = 0 if false.
  The comment may be up to 69 characters long.
*/
{
    char valstring[FLEN_VALUE];

    if (*status > 0)
        return(*status);

    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */
    ffc2l(valstring, value, status);   /* convert string to value */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkyj( fitsfile *fptr,     /* I - FITS file pointer         */
            const char *keyname,      /* I - name of keyword to read   */
            long *value,        /* O - keyword value             */
            char *comm,         /* O - keyword comment           */
            int  *status)       /* IO - error status             */
/*
  Read (get) the named keyword, returning the value and comment.
  The value will be implicitly converted to a (long) integer if it not
  already of this datatype.  The comment may be up to 69 characters long.
*/
{
    char valstring[FLEN_VALUE];

    if (*status > 0)
        return(*status);

    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */
    ffc2i(valstring, value, status);   /* convert string to value */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkyjj( fitsfile *fptr,     /* I - FITS file pointer         */
            const char *keyname,      /* I - name of keyword to read   */
            LONGLONG *value,    /* O - keyword value             */
            char *comm,         /* O - keyword comment           */
            int  *status)       /* IO - error status             */
/*
  Read (get) the named keyword, returning the value and comment.
  The value will be implicitly converted to a (LONGLONG) integer if it not
  already of this datatype.  The comment may be up to 69 characters long.
*/
{
    char valstring[FLEN_VALUE];

    if (*status > 0)
        return(*status);

    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */
    ffc2j(valstring, value, status);   /* convert string to value */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkyujj( fitsfile *fptr,     /* I - FITS file pointer         */
            const char *keyname,      /* I - name of keyword to read   */
            ULONGLONG *value,    /* O - keyword value             */
            char *comm,         /* O - keyword comment           */
            int  *status)       /* IO - error status             */
/*
  Read (get) the named keyword, returning the value and comment.
  The value will be implicitly converted to a (ULONGLONG) integer if it not
  already of this datatype.  The comment may be up to 69 characters long.
*/
{
    char valstring[FLEN_VALUE];

    if (*status > 0)
        return(*status);

    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */
    ffc2uj(valstring, value, status);   /* convert string to value */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkye( fitsfile *fptr,     /* I - FITS file pointer         */
            const char  *keyname,     /* I - name of keyword to read   */
            float *value,       /* O - keyword value             */
            char  *comm,        /* O - keyword comment           */
            int   *status)      /* IO - error status             */
/*
  Read (get) the named keyword, returning the value and comment.
  The value will be implicitly converted to a float if it not
  already of this datatype.  The comment may be up to 69 characters long.
*/
{
    char valstring[FLEN_VALUE];

    if (*status > 0)
        return(*status);

    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */
    ffc2r(valstring, value, status);   /* convert string to value */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkyd( fitsfile *fptr,      /* I - FITS file pointer         */
            const char   *keyname,     /* I - name of keyword to read   */
            double *value,       /* O - keyword value             */
            char   *comm,        /* O - keyword comment           */
            int    *status)      /* IO - error status             */
/*
  Read (get) the named keyword, returning the value and comment.
  The value will be implicitly converted to a double if it not
  already of this datatype.  The comment may be up to 69 characters long.
*/
{
    char valstring[FLEN_VALUE];

    if (*status > 0)
        return(*status);

    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */
    ffc2d(valstring, value, status);   /* convert string to value */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkyc( fitsfile *fptr,     /* I - FITS file pointer         */
            const char  *keyname,     /* I - name of keyword to read   */
            float *value,       /* O - keyword value (real,imag) */
            char  *comm,        /* O - keyword comment           */
            int   *status)      /* IO - error status             */
/*
  Read (get) the named keyword, returning the value and comment.
  The keyword must have a complex value. No implicit data conversion
  will be performed.
*/
{
    char valstring[FLEN_VALUE], message[FLEN_ERRMSG];
    int len;

    if (*status > 0)
        return(*status);

    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */

    if (valstring[0] != '(' )   /* test that this is a complex keyword */
    {
      snprintf(message, FLEN_ERRMSG, "keyword %s does not have a complex value (ffgkyc):",
              keyname);
      ffpmsg(message);
      ffpmsg(valstring);
      return(*status = BAD_C2F);
    }

    valstring[0] = ' ';            /* delete the opening parenthesis */
    len = strcspn(valstring, ")" );  
    valstring[len] = '\0';         /* delete the closing parenthesis */

    len = strcspn(valstring, ",");
    valstring[len] = '\0';

    ffc2r(valstring, &value[0], status);       /* convert the real part */
    ffc2r(&valstring[len + 1], &value[1], status); /* convert imag. part */
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkym( fitsfile *fptr,     /* I - FITS file pointer         */
            const char  *keyname,     /* I - name of keyword to read   */
            double *value,      /* O - keyword value (real,imag) */
            char  *comm,        /* O - keyword comment           */
            int   *status)      /* IO - error status             */
/*
  Read (get) the named keyword, returning the value and comment.
  The keyword must have a complex value. No implicit data conversion
  will be performed.
*/
{
    char valstring[FLEN_VALUE], message[FLEN_ERRMSG];
    int len;

    if (*status > 0)
        return(*status);

    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */

    if (valstring[0] != '(' )   /* test that this is a complex keyword */
    {
      snprintf(message, FLEN_ERRMSG, "keyword %s does not have a complex value (ffgkym):",
              keyname);
      ffpmsg(message);
      ffpmsg(valstring);
      return(*status = BAD_C2D);
    }

    valstring[0] = ' ';            /* delete the opening parenthesis */
    len = strcspn(valstring, ")" );  
    valstring[len] = '\0';         /* delete the closing parenthesis */

    len = strcspn(valstring, ",");
    valstring[len] = '\0';

    ffc2d(valstring, &value[0], status);        /* convert the real part */
    ffc2d(&valstring[len + 1], &value[1], status);  /* convert the imag. part */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkyt( fitsfile *fptr,      /* I - FITS file pointer                 */
            const char   *keyname,     /* I - name of keyword to read           */
            long   *ivalue,      /* O - integer part of keyword value     */
            double *fraction,    /* O - fractional part of keyword value  */
            char   *comm,        /* O - keyword comment                   */
            int    *status)      /* IO - error status                     */
/*
  Read (get) the named keyword, returning the value and comment.
  The integer and fractional parts of the value are returned in separate
  variables, to allow more numerical precision to be passed.  This
  effectively passes a 'triple' precision value, with a 4-byte integer
  and an 8-byte fraction.  The comment may be up to 69 characters long.
*/
{
    char valstring[FLEN_VALUE];
    char *loc;

    if (*status > 0)
        return(*status);

    ffgkey(fptr, keyname, valstring, comm, status);  /* read the keyword */

    /*  read the entire value string as a double, to get the integer part */
    ffc2d(valstring, fraction, status);

    *ivalue = (long) *fraction;

    *fraction = *fraction - *ivalue;

    /* see if we need to read the fractional part again with more precision */
    /* look for decimal point, without an exponential E or D character */

    loc = strchr(valstring, '.');
    if (loc)
    {
        if (!strchr(valstring, 'E') && !strchr(valstring, 'D'))
            ffc2d(loc, fraction, status);
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkyn( fitsfile *fptr,      /* I - FITS file pointer             */
            int    nkey,         /* I - number of the keyword to read */
            char   *keyname,     /* O - name of the keyword           */
            char   *value,       /* O - keyword value                 */
            char   *comm,        /* O - keyword comment               */
            int    *status)      /* IO - error status                 */
/*
  Read (get) the nkey-th keyword returning the keyword name, value and comment.
  The value is just the literal string of characters in the value field
  of the keyword.  In the case of a string valued keyword, the returned
  value includes the leading and closing quote characters.  The value may be
  up to 70 characters long, and the comment may be up to 72 characters long.
  If the keyword has no value (no equal sign in column 9) then a null value
  is returned.  If comm = NULL, then do not return the comment string.
*/
{
    char card[FLEN_CARD], sbuff[FLEN_CARD];
    int namelen;

    keyname[0] = '\0';
    value[0] = '\0';
    if (comm)
        comm[0] = '\0';

    if (*status > 0)
        return(*status);

    if (ffgrec(fptr, nkey, card, status) > 0 )  /* get the 80-byte card */
        return(*status);

    ffgknm(card, keyname, &namelen, status); /* get the keyword name */

    if (ffpsvc(card, value, comm, status) > 0)   /* parse value and comment */
        return(*status);

    if (fftrec(keyname, status) > 0)  /* test keyword name; catches no END */
    {
     snprintf(sbuff, FLEN_CARD, "Name of keyword no. %d contains illegal character(s): %s",
              nkey, keyname);
     ffpmsg(sbuff);

     if (nkey % 36 == 0)  /* test if at beginning of 36-card FITS record */
            ffpmsg("  (This may indicate a missing END keyword).");
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkns( fitsfile *fptr,     /* I - FITS file pointer                    */
            const char *keyname,      /* I - root name of keywords to read        */
            int  nstart,        /* I - starting index number                */
            int  nmax,          /* I - maximum number of keywords to return */
            char *value[],      /* O - array of pointers to keyword values  */
            int  *nfound,       /* O - number of values that were returned  */
            int  *status)       /* IO - error status                        */
/*
  Read (get) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NMAX -1) inclusive.  
  This routine does NOT support the HEASARC long string convention.
*/
{
    int nend, lenroot, ii, nkeys, mkeys, tstatus, undefinedval;
    long ival;
    char keyroot[FLEN_KEYWORD], keyindex[8], card[FLEN_CARD];
    char svalue[FLEN_VALUE], comm[FLEN_COMMENT], *equalssign;

    if (*status > 0)
        return(*status);

    *nfound = 0;
    nend = nstart + nmax - 1;

    keyroot[0] = '\0';
    strncat(keyroot, keyname, FLEN_KEYWORD - 1);
     
    lenroot = strlen(keyroot);
    
    if (lenroot == 0)     /*  root must be at least 1 char long  */
        return(*status);

    for (ii=0; ii < lenroot; ii++)           /*  make sure upper case  */
        keyroot[ii] = toupper(keyroot[ii]);

    ffghps(fptr, &nkeys, &mkeys, status);  /*  get the number of keywords  */

    undefinedval = FALSE;
    for (ii=3; ii <= nkeys; ii++)  
    {
       if (ffgrec(fptr, ii, card, status) > 0)     /*  get next keyword  */
           return(*status);

       if (strncmp(keyroot, card, lenroot) == 0)  /* see if keyword matches */
       {
          keyindex[0] = '\0';
          equalssign = strchr(card, '=');
	  if (equalssign == 0) continue;  /* keyword has no value */

          if (equalssign - card - lenroot > 7)
          {
             return (*status=BAD_KEYCHAR);
          }
          strncat(keyindex, &card[lenroot], equalssign - card  - lenroot);  /*  copy suffix  */
          tstatus = 0;
          if (ffc2ii(keyindex, &ival, &tstatus) <= 0)     /*  test suffix  */
          {
             if (ival <= nend && ival >= nstart)
             {
                ffpsvc(card, svalue, comm, status);  /*  parse the value */
                ffc2s(svalue, value[ival-nstart], status); /* convert */
                if (ival - nstart + 1 > *nfound)
                      *nfound = ival - nstart + 1;  /*  max found */ 

                if (*status == VALUE_UNDEFINED)
                {
                   undefinedval = TRUE;
                   *status = 0;  /* reset status to read remaining values */
                }
             }
          }
       }
    }
    if (undefinedval && (*status <= 0) )
        *status = VALUE_UNDEFINED;  /* report at least 1 value undefined */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgknl( fitsfile *fptr,     /* I - FITS file pointer                    */
            const char *keyname,      /* I - root name of keywords to read        */
            int  nstart,        /* I - starting index number                */
            int  nmax,          /* I - maximum number of keywords to return */
            int  *value,        /* O - array of keyword values              */
            int  *nfound,       /* O - number of values that were returned  */
            int  *status)       /* IO - error status                        */
/*
  Read (get) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NMAX -1) inclusive.  
  The returned value = 1 if the keyword is true, else = 0 if false.
*/
{
    int nend, lenroot, ii, nkeys, mkeys, tstatus, undefinedval;
    long ival;
    char keyroot[FLEN_KEYWORD], keyindex[8], card[FLEN_CARD];
    char svalue[FLEN_VALUE], comm[FLEN_COMMENT], *equalssign;

    if (*status > 0)
        return(*status);

    *nfound = 0;
    nend = nstart + nmax - 1;

    keyroot[0] = '\0';
    strncat(keyroot, keyname, FLEN_KEYWORD - 1);

    lenroot = strlen(keyroot);
    
    if (lenroot == 0)     /*  root must be at least 1 char long  */
        return(*status);
 
    for (ii=0; ii < lenroot; ii++)           /*  make sure upper case  */
        keyroot[ii] = toupper(keyroot[ii]);

    ffghps(fptr, &nkeys, &mkeys, status);  /*  get the number of keywords  */

    ffmaky(fptr, 3, status);  /* move to 3rd keyword (skip 1st 2 keywords) */

    undefinedval = FALSE;
    for (ii=3; ii <= nkeys; ii++)  
    {
       if (ffgnky(fptr, card, status) > 0)     /*  get next keyword  */
           return(*status);

       if (strncmp(keyroot, card, lenroot) == 0)  /* see if keyword matches */
       {
          keyindex[0] = '\0';
          equalssign = strchr(card, '=');
	  if (equalssign == 0) continue;  /* keyword has no value */

          if (equalssign - card - lenroot > 7)
          {
             return (*status=BAD_KEYCHAR);
          }
          strncat(keyindex, &card[lenroot], equalssign - card  - lenroot);  /*  copy suffix  */

          tstatus = 0;
          if (ffc2ii(keyindex, &ival, &tstatus) <= 0)    /*  test suffix  */
          {
             if (ival <= nend && ival >= nstart)
             {
                ffpsvc(card, svalue, comm, status);   /*  parse the value */
                ffc2l(svalue, &value[ival-nstart], status); /* convert*/
                if (ival - nstart + 1 > *nfound)
                      *nfound = ival - nstart + 1;  /*  max found */ 

                if (*status == VALUE_UNDEFINED)
                {
                    undefinedval = TRUE;
                   *status = 0;  /* reset status to read remaining values */
                }
             }
          }
       }
    }
    if (undefinedval && (*status <= 0) )
        *status = VALUE_UNDEFINED;  /* report at least 1 value undefined */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgknj( fitsfile *fptr,     /* I - FITS file pointer                    */
            const char *keyname,      /* I - root name of keywords to read        */
            int  nstart,        /* I - starting index number                */
            int  nmax,          /* I - maximum number of keywords to return */
            long *value,        /* O - array of keyword values              */
            int  *nfound,       /* O - number of values that were returned  */
            int  *status)       /* IO - error status                        */
/*
  Read (get) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NMAX -1) inclusive.  
*/
{
    int nend, lenroot, ii, nkeys, mkeys, tstatus, undefinedval;
    long ival;
    char keyroot[FLEN_KEYWORD], keyindex[8], card[FLEN_CARD];
    char svalue[FLEN_VALUE], comm[FLEN_COMMENT], *equalssign;

    if (*status > 0)
        return(*status);

    *nfound = 0;
    nend = nstart + nmax - 1;

    keyroot[0] = '\0';
    strncat(keyroot, keyname, FLEN_KEYWORD - 1);

    lenroot = strlen(keyroot);
    
    if (lenroot == 0)     /*  root must be at least 1 char long  */
        return(*status);
 
    for (ii=0; ii < lenroot; ii++)           /*  make sure upper case  */
        keyroot[ii] = toupper(keyroot[ii]);

    ffghps(fptr, &nkeys, &mkeys, status);  /*  get the number of keywords  */

    ffmaky(fptr, 3, status);  /* move to 3rd keyword (skip 1st 2 keywords) */

    undefinedval = FALSE;
    for (ii=3; ii <= nkeys; ii++)  
    {
       if (ffgnky(fptr, card, status) > 0)     /*  get next keyword  */
           return(*status);

       if (strncmp(keyroot, card, lenroot) == 0)  /* see if keyword matches */
       {
          keyindex[0] = '\0';
          equalssign = strchr(card, '=');
	  if (equalssign == 0) continue;  /* keyword has no value */

          if (equalssign - card - lenroot > 7)
          {
             return (*status=BAD_KEYCHAR);
          }
          strncat(keyindex, &card[lenroot], equalssign - card  - lenroot);  /*  copy suffix  */

          tstatus = 0;
          if (ffc2ii(keyindex, &ival, &tstatus) <= 0)     /*  test suffix  */
          {
             if (ival <= nend && ival >= nstart)
             {
                ffpsvc(card, svalue, comm, status);   /*  parse the value */
                ffc2i(svalue, &value[ival-nstart], status);  /* convert */
                if (ival - nstart + 1 > *nfound)
                      *nfound = ival - nstart + 1;  /*  max found */ 

                if (*status == VALUE_UNDEFINED)
                {
                    undefinedval = TRUE;
                   *status = 0;  /* reset status to read remaining values */
                }
             }
          }
       }
    }
    if (undefinedval && (*status <= 0) )
        *status = VALUE_UNDEFINED;  /* report at least 1 value undefined */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgknjj( fitsfile *fptr,    /* I - FITS file pointer                    */
            const char *keyname,      /* I - root name of keywords to read        */
            int  nstart,        /* I - starting index number                */
            int  nmax,          /* I - maximum number of keywords to return */
            LONGLONG *value,    /* O - array of keyword values              */
            int  *nfound,       /* O - number of values that were returned  */
            int  *status)       /* IO - error status                        */
/*
  Read (get) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NMAX -1) inclusive.  
*/
{
    int nend, lenroot, ii, nkeys, mkeys, tstatus, undefinedval;
    long ival;
    char keyroot[FLEN_KEYWORD], keyindex[8], card[FLEN_CARD];
    char svalue[FLEN_VALUE], comm[FLEN_COMMENT], *equalssign;

    if (*status > 0)
        return(*status);

    *nfound = 0;
    nend = nstart + nmax - 1;

    keyroot[0] = '\0';
    strncat(keyroot, keyname, FLEN_KEYWORD - 1);

    lenroot = strlen(keyroot);
    
    if (lenroot == 0)     /*  root must be at least 1 char long  */
        return(*status);

    for (ii=0; ii < lenroot; ii++)           /*  make sure upper case  */
        keyroot[ii] = toupper(keyroot[ii]);

    ffghps(fptr, &nkeys, &mkeys, status);  /*  get the number of keywords  */

    ffmaky(fptr, 3, status);  /* move to 3rd keyword (skip 1st 2 keywords) */

    undefinedval = FALSE;
    for (ii=3; ii <= nkeys; ii++)  
    {
       if (ffgnky(fptr, card, status) > 0)     /*  get next keyword  */
           return(*status);

       if (strncmp(keyroot, card, lenroot) == 0)  /* see if keyword matches */
       {
          keyindex[0] = '\0';
          equalssign = strchr(card, '=');
	  if (equalssign == 0) continue;  /* keyword has no value */

          if (equalssign - card - lenroot > 7)
          {
             return (*status=BAD_KEYCHAR);
          }
          strncat(keyindex, &card[lenroot], equalssign - card  - lenroot);  /*  copy suffix  */

          tstatus = 0;
          if (ffc2ii(keyindex, &ival, &tstatus) <= 0)     /*  test suffix  */
          {
             if (ival <= nend && ival >= nstart)
             {
                ffpsvc(card, svalue, comm, status);   /*  parse the value */
                ffc2j(svalue, &value[ival-nstart], status);  /* convert */
                if (ival - nstart + 1 > *nfound)
                      *nfound = ival - nstart + 1;  /*  max found */ 

                if (*status == VALUE_UNDEFINED)
                {
                    undefinedval = TRUE;
                   *status = 0;  /* reset status to read remaining values */
                }
             }
          }
       }
    }
    if (undefinedval && (*status <= 0) )
        *status = VALUE_UNDEFINED;  /* report at least 1 value undefined */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgkne( fitsfile *fptr,     /* I - FITS file pointer                    */
            const char *keyname,      /* I - root name of keywords to read        */
            int  nstart,        /* I - starting index number                */
            int  nmax,          /* I - maximum number of keywords to return */
            float *value,       /* O - array of keyword values              */
            int  *nfound,       /* O - number of values that were returned  */
            int  *status)       /* IO - error status                        */
/*
  Read (get) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NMAX -1) inclusive.  
*/
{
    int nend, lenroot, ii, nkeys, mkeys, tstatus, undefinedval;
    long ival;
    char keyroot[FLEN_KEYWORD], keyindex[8], card[FLEN_CARD];
    char svalue[FLEN_VALUE], comm[FLEN_COMMENT], *equalssign;

    if (*status > 0)
        return(*status);

    *nfound = 0;
    nend = nstart + nmax - 1;

    keyroot[0] = '\0';
    strncat(keyroot, keyname, FLEN_KEYWORD - 1);

    lenroot = strlen(keyroot);
    
    if (lenroot == 0)     /*  root must be at least 1 char long  */
        return(*status);

    for (ii=0; ii < lenroot; ii++)           /*  make sure upper case  */
        keyroot[ii] = toupper(keyroot[ii]);

    ffghps(fptr, &nkeys, &mkeys, status);  /*  get the number of keywords  */

    ffmaky(fptr, 3, status);  /* move to 3rd keyword (skip 1st 2 keywords) */

    undefinedval = FALSE;
    for (ii=3; ii <= nkeys; ii++)  
    {
       if (ffgnky(fptr, card, status) > 0)     /*  get next keyword  */
           return(*status);

       if (strncmp(keyroot, card, lenroot) == 0)  /* see if keyword matches */
       {
          keyindex[0] = '\0';
          equalssign = strchr(card, '=');
	  if (equalssign == 0) continue;  /* keyword has no value */

          if (equalssign - card - lenroot > 7)
          {
             return (*status=BAD_KEYCHAR);
          }
          strncat(keyindex, &card[lenroot], equalssign - card  - lenroot);  /*  copy suffix  */

          tstatus = 0;
          if (ffc2ii(keyindex, &ival, &tstatus) <= 0)     /*  test suffix  */
          {
             if (ival <= nend && ival >= nstart)
             {
                ffpsvc(card, svalue, comm, status);   /*  parse the value */
                ffc2r(svalue, &value[ival-nstart], status); /* convert */
                if (ival - nstart + 1 > *nfound)
                      *nfound = ival - nstart + 1;  /*  max found */ 

                if (*status == VALUE_UNDEFINED)
                {
                    undefinedval = TRUE;
                   *status = 0;  /* reset status to read remaining values */
                }
             }
          }
       }
    }
    if (undefinedval && (*status <= 0) )
        *status = VALUE_UNDEFINED;  /* report at least 1 value undefined */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgknd( fitsfile *fptr,     /* I - FITS file pointer                    */
            const char *keyname,      /* I - root name of keywords to read        */
            int  nstart,        /* I - starting index number                */
            int  nmax,          /* I - maximum number of keywords to return */
            double *value,      /* O - array of keyword values              */
            int  *nfound,       /* O - number of values that were returned  */
            int  *status)       /* IO - error status                        */
/*
  Read (get) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NMAX -1) inclusive.  
*/
{
    int nend, lenroot, ii, nkeys, mkeys, tstatus, undefinedval;
    long ival;
    char keyroot[FLEN_KEYWORD], keyindex[8], card[FLEN_CARD];
    char svalue[FLEN_VALUE], comm[FLEN_COMMENT], *equalssign;

    if (*status > 0)
        return(*status);

    *nfound = 0;
    nend = nstart + nmax - 1;

    keyroot[0] = '\0';
    strncat(keyroot, keyname, FLEN_KEYWORD - 1);

    lenroot = strlen(keyroot);

    if (lenroot == 0)     /*  root must be at least 1 char long  */
        return(*status);

    for (ii=0; ii < lenroot; ii++)           /*  make sure upper case  */
        keyroot[ii] = toupper(keyroot[ii]);

    ffghps(fptr, &nkeys, &mkeys, status);  /*  get the number of keywords  */

    ffmaky(fptr, 3, status);  /* move to 3rd keyword (skip 1st 2 keywords) */

    undefinedval = FALSE;
    for (ii=3; ii <= nkeys; ii++)  
    {
       if (ffgnky(fptr, card, status) > 0)     /*  get next keyword  */
           return(*status);
       if (strncmp(keyroot, card, lenroot) == 0)   /* see if keyword matches */
       {
          keyindex[0] = '\0';
          equalssign = strchr(card, '=');
	  if (equalssign == 0) continue;  /* keyword has no value */

          if (equalssign - card - lenroot > 7)
          {
             return (*status=BAD_KEYCHAR);
          }
          strncat(keyindex, &card[lenroot], equalssign - card  - lenroot);  /*  copy suffix  */
          tstatus = 0;
          if (ffc2ii(keyindex, &ival, &tstatus) <= 0)      /*  test suffix */
          {
             if (ival <= nend && ival >= nstart) /* is index within range? */
             {
                ffpsvc(card, svalue, comm, status);   /*  parse the value */
                ffc2d(svalue, &value[ival-nstart], status); /* convert */
                if (ival - nstart + 1 > *nfound)
                      *nfound = ival - nstart + 1;  /*  max found */ 

                if (*status == VALUE_UNDEFINED)
                {
                    undefinedval = TRUE;
                   *status = 0;  /* reset status to read remaining values */
                }
             }
          }
       }
    }
    if (undefinedval && (*status <= 0) )
        *status = VALUE_UNDEFINED;  /* report at least 1 value undefined */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgtdm(fitsfile *fptr,  /* I - FITS file pointer                        */
           int colnum,      /* I - number of the column to read             */
           int maxdim,      /* I - maximum no. of dimensions to read;       */
           int *naxis,      /* O - number of axes in the data array         */
           long naxes[],    /* O - length of each data axis                 */
           int *status)     /* IO - error status                            */
/*
  read and parse the TDIMnnn keyword to get the dimensionality of a column
*/
{
    int tstatus = 0;
    char keyname[FLEN_KEYWORD], tdimstr[FLEN_VALUE];

    if (*status > 0)
        return(*status);

    ffkeyn("TDIM", colnum, keyname, status);      /* construct keyword name */

    ffgkys(fptr, keyname, tdimstr, NULL, &tstatus); /* try reading keyword */

    ffdtdm(fptr, tdimstr, colnum, maxdim,naxis, naxes, status); /* decode it */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgtdmll(fitsfile *fptr,  /* I - FITS file pointer                      */
           int colnum,      /* I - number of the column to read             */
           int maxdim,      /* I - maximum no. of dimensions to read;       */
           int *naxis,      /* O - number of axes in the data array         */
           LONGLONG naxes[], /* O - length of each data axis                 */
           int *status)     /* IO - error status                            */
/*
  read and parse the TDIMnnn keyword to get the dimensionality of a column
*/
{
    int tstatus = 0;
    char keyname[FLEN_KEYWORD], tdimstr[FLEN_VALUE];

    if (*status > 0)
        return(*status);

    ffkeyn("TDIM", colnum, keyname, status);      /* construct keyword name */

    ffgkys(fptr, keyname, tdimstr, NULL, &tstatus); /* try reading keyword */

    ffdtdmll(fptr, tdimstr, colnum, maxdim,naxis, naxes, status); /* decode it */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffdtdm(fitsfile *fptr,  /* I - FITS file pointer                        */
           char *tdimstr,   /* I - TDIMn keyword value string. e.g. (10,10) */
           int colnum,      /* I - number of the column             */
           int maxdim,      /* I - maximum no. of dimensions to read;       */
           int *naxis,      /* O - number of axes in the data array         */
           long naxes[],    /* O - length of each data axis                 */
           int *status)     /* IO - error status                            */
/*
  decode the TDIMnnn keyword to get the dimensionality of a column.
  Check that the value is legal and consistent with the TFORM value.
  If colnum = 0, then the validity checking is disabled.
*/
{
    long dimsize, totalpix = 1;
    char *loc, *lastloc, message[FLEN_ERRMSG];
    tcolumn *colptr = 0;

    if (*status > 0)
        return(*status);

    if (colnum != 0) {
        if (fptr->HDUposition != (fptr->Fptr)->curhdu)
            ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

        if (colnum < 1 || colnum > (fptr->Fptr)->tfield)
            return(*status = BAD_COL_NUM);

        colptr = (fptr->Fptr)->tableptr;   /* set pointer to the first column */
        colptr += (colnum - 1);    /* increment to the correct column */

        if (!tdimstr[0])   /* TDIMn keyword doesn't exist? */
        {
            *naxis = 1;                   /* default = 1 dimensional */
            if (maxdim > 0)
                naxes[0] = (long) colptr->trepeat; /* default length = repeat */

            return(*status);
        }
    }

    *naxis = 0;

    loc = strchr(tdimstr, '(' );  /* find the opening quote */
    if (!loc)
    {
            snprintf(message, FLEN_ERRMSG, "Illegal dimensions format: %s", tdimstr);
            return(*status = BAD_TDIM);
    }

    while (loc)
    {
            loc++;
            dimsize = strtol(loc, &loc, 10);  /* read size of next dimension */
            if (*naxis < maxdim)
                naxes[*naxis] = dimsize;

            if (dimsize < 0)
            {
                ffpmsg("one or more dimension are less than 0 (ffdtdm)");
                ffpmsg(tdimstr);
                return(*status = BAD_TDIM);
            }

            totalpix *= dimsize;
            (*naxis)++;
            lastloc = loc;
            loc = strchr(loc, ',');  /* look for comma before next dimension */
    }

    loc = strchr(lastloc, ')' );  /* check for the closing quote */
    if (!loc)
    {
            snprintf(message, FLEN_ERRMSG, "Illegal dimensions format: %s", tdimstr);
            return(*status = BAD_TDIM);
    }

    if (colnum != 0) {
        if ((colptr->tdatatype > 0) && ((long) colptr->trepeat != totalpix))
        {
          snprintf(message, FLEN_ERRMSG,
          "column vector length, %ld, does not equal TDIMn array size, %ld",
          (long) colptr->trepeat, totalpix);
          ffpmsg(message);
          ffpmsg(tdimstr);
          return(*status = BAD_TDIM);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffdtdmll(fitsfile *fptr,  /* I - FITS file pointer                        */
           char *tdimstr,   /* I - TDIMn keyword value string. e.g. (10,10) */
           int colnum,      /* I - number of the column             */
           int maxdim,      /* I - maximum no. of dimensions to read;       */
           int *naxis,      /* O - number of axes in the data array         */
           LONGLONG naxes[],    /* O - length of each data axis                 */
           int *status)     /* IO - error status                            */
/*
  decode the TDIMnnn keyword to get the dimensionality of a column.
  Check that the value is legal and consistent with the TFORM value.
*/
{
    LONGLONG dimsize;
    LONGLONG totalpix = 1;
    char *loc, *lastloc, message[FLEN_ERRMSG];
    tcolumn *colptr;
    double doublesize;

    if (*status > 0)
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if (colnum < 1 || colnum > (fptr->Fptr)->tfield)
        return(*status = BAD_COL_NUM);

    colptr = (fptr->Fptr)->tableptr;   /* set pointer to the first column */
    colptr += (colnum - 1);    /* increment to the correct column */

    if (!tdimstr[0])   /* TDIMn keyword doesn't exist? */
    {
        *naxis = 1;                   /* default = 1 dimensional */
        if (maxdim > 0)
            naxes[0] = colptr->trepeat; /* default length = repeat */
    }
    else
    {
        *naxis = 0;

        loc = strchr(tdimstr, '(' );  /* find the opening quote */
        if (!loc)
        {
            snprintf(message, FLEN_ERRMSG, "Illegal TDIM keyword value: %s", tdimstr);
            return(*status = BAD_TDIM);
        }

        while (loc)
        {
            loc++;

    /* Read value as a double because the string to 64-bit int function is  */
    /* platform dependent (strtoll, strtol, _atoI64).  This still gives     */
    /* about 48 bits of precision, which is plenty for this purpose.        */

            doublesize = strtod(loc, &loc);
            dimsize = (LONGLONG) (doublesize + 0.1);

            if (*naxis < maxdim)
                naxes[*naxis] = dimsize;

            if (dimsize < 0)
            {
                ffpmsg("one or more TDIM values are less than 0 (ffdtdm)");
                ffpmsg(tdimstr);
                return(*status = BAD_TDIM);
            }

            totalpix *= dimsize;
            (*naxis)++;
            lastloc = loc;
            loc = strchr(loc, ',');  /* look for comma before next dimension */
        }

        loc = strchr(lastloc, ')' );  /* check for the closing quote */
        if (!loc)
        {
            snprintf(message, FLEN_ERRMSG, "Illegal TDIM keyword value: %s", tdimstr);
            return(*status = BAD_TDIM);
        }

        if ((colptr->tdatatype > 0) && (colptr->trepeat != totalpix))
        {
          snprintf(message, FLEN_ERRMSG,
          "column vector length, %.0f, does not equal TDIMn array size, %.0f",
          (double) (colptr->trepeat), (double) totalpix);
          ffpmsg(message);
          ffpmsg(tdimstr);
          return(*status = BAD_TDIM);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffghpr(fitsfile *fptr,  /* I - FITS file pointer                        */
           int maxdim,      /* I - maximum no. of dimensions to read;       */
           int *simple,     /* O - does file conform to FITS standard? 1/0  */
           int *bitpix,     /* O - number of bits per data value pixel      */
           int *naxis,      /* O - number of axes in the data array         */
           long naxes[],    /* O - length of each data axis                 */
           long *pcount,    /* O - number of group parameters (usually 0)   */
           long *gcount,    /* O - number of random groups (usually 1 or 0) */
           int *extend,     /* O - may FITS file haave extensions?          */
           int *status)     /* IO - error status                            */
/*
  Get keywords from the Header of the PRimary array:
  Check that the keywords conform to the FITS standard and return the
  parameters which determine the size and structure of the primary array
  or IMAGE extension.
*/
{
    int idummy, ii;
    LONGLONG lldummy;
    double ddummy;
    LONGLONG tnaxes[99];

    ffgphd(fptr, maxdim, simple, bitpix, naxis, tnaxes, pcount, gcount, extend,
          &ddummy, &ddummy, &lldummy, &idummy, status);
	  
    if (naxis && naxes) {
         for (ii = 0; (ii < *naxis) && (ii < maxdim); ii++)
	     naxes[ii] = (long) tnaxes[ii];
    } else if (naxes) {
         for (ii = 0; ii < maxdim; ii++)
	     naxes[ii] = (long) tnaxes[ii];
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffghprll(fitsfile *fptr,  /* I - FITS file pointer                        */
           int maxdim,      /* I - maximum no. of dimensions to read;       */
           int *simple,     /* O - does file conform to FITS standard? 1/0  */
           int *bitpix,     /* O - number of bits per data value pixel      */
           int *naxis,      /* O - number of axes in the data array         */
           LONGLONG naxes[],    /* O - length of each data axis                 */
           long *pcount,    /* O - number of group parameters (usually 0)   */
           long *gcount,    /* O - number of random groups (usually 1 or 0) */
           int *extend,     /* O - may FITS file haave extensions?          */
           int *status)     /* IO - error status                            */
/*
  Get keywords from the Header of the PRimary array:
  Check that the keywords conform to the FITS standard and return the
  parameters which determine the size and structure of the primary array
  or IMAGE extension.
*/
{
    int idummy;
    LONGLONG lldummy;
    double ddummy;

    ffgphd(fptr, maxdim, simple, bitpix, naxis, naxes, pcount, gcount, extend,
          &ddummy, &ddummy, &lldummy, &idummy, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffghtb(fitsfile *fptr,  /* I - FITS file pointer                        */
           int maxfield,    /* I - maximum no. of columns to read;          */
           long *naxis1,    /* O - length of table row in bytes             */
           long *naxis2,    /* O - number of rows in the table              */
           int *tfields,    /* O - number of columns in the table           */
           char **ttype,    /* O - name of each column                      */
           long *tbcol,     /* O - byte offset in row to each column        */
           char **tform,    /* O - value of TFORMn keyword for each column  */
           char **tunit,    /* O - value of TUNITn keyword for each column  */
           char *extnm,   /* O - value of EXTNAME keyword, if any         */
           int *status)     /* IO - error status                            */
/*
  Get keywords from the Header of the ASCII TaBle:
  Check that the keywords conform to the FITS standard and return the
  parameters which describe the table.
*/
{
    int ii, maxf, nfound, tstatus;
    long fields;
    char name[FLEN_KEYWORD], value[FLEN_VALUE], comm[FLEN_COMMENT];
    char xtension[FLEN_VALUE], message[FLEN_ERRMSG];
    LONGLONG llnaxis1, llnaxis2, pcount;

    if (*status > 0)
        return(*status);

    /* read the first keyword of the extension */
    ffgkyn(fptr, 1, name, value, comm, status);

    if (!strcmp(name, "XTENSION"))
    {
            if (ffc2s(value, xtension, status) > 0)  /* get the value string */
            {
                ffpmsg("Bad value string for XTENSION keyword:");
                ffpmsg(value);
                return(*status);
            }

            /* allow the quoted string value to begin in any column and */
            /* allow any number of trailing blanks before the closing quote */
            if ( (value[0] != '\'')   ||  /* first char must be a quote */
                 ( strcmp(xtension, "TABLE") ) )
            {
                snprintf(message, FLEN_ERRMSG,
                "This is not a TABLE extension: %s", value);
                ffpmsg(message);
                return(*status = NOT_ATABLE);
            }
    }

    else  /* error: 1st keyword of extension != XTENSION */
    {
        snprintf(message, FLEN_ERRMSG,
        "First keyword of the extension is not XTENSION: %s", name);
        ffpmsg(message);
        return(*status = NO_XTENSION);
    }

    if (ffgttb(fptr, &llnaxis1, &llnaxis2, &pcount, &fields, status) > 0)
        return(*status);

    if (naxis1)
       *naxis1 = (long) llnaxis1;

    if (naxis2)
       *naxis2 = (long) llnaxis2;

    if (pcount != 0)
    {
       snprintf(message, FLEN_ERRMSG, "PCOUNT = %.0f is illegal in ASCII table; must = 0",
               (double) pcount);
       ffpmsg(message);
       return(*status = BAD_PCOUNT);
    }

    if (tfields)
       *tfields = fields;

    if (maxfield < 0)
        maxf = fields;
    else
        maxf = minvalue(maxfield, fields);

    if (maxf > 0)
    {
        for (ii = 0; ii < maxf; ii++)
        {   /* initialize optional keyword values */
            if (ttype)
                *ttype[ii] = '\0';   

            if (tunit)
                *tunit[ii] = '\0';
        }

   
        if (ttype)
            ffgkns(fptr, "TTYPE", 1, maxf, ttype, &nfound, status);

        if (tunit)
            ffgkns(fptr, "TUNIT", 1, maxf, tunit, &nfound, status);

        if (*status > 0)
            return(*status);

        if (tbcol)
        {
            ffgknj(fptr, "TBCOL", 1, maxf, tbcol, &nfound, status);

            if (*status > 0 || nfound != maxf)
            {
                ffpmsg(
        "Required TBCOL keyword(s) not found in ASCII table header (ffghtb).");
                return(*status = NO_TBCOL);
            }
        }

        if (tform)
        {
            ffgkns(fptr, "TFORM", 1, maxf, tform, &nfound, status);

            if (*status > 0 || nfound != maxf)
            {
                ffpmsg(
        "Required TFORM keyword(s) not found in ASCII table header (ffghtb).");
                return(*status = NO_TFORM);
            }
        }
    }

    if (extnm)
    {
        extnm[0] = '\0';

        tstatus = *status;
        ffgkys(fptr, "EXTNAME", extnm, comm, status);

        if (*status == KEY_NO_EXIST)
            *status = tstatus;  /* keyword not required, so ignore error */
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffghtbll(fitsfile *fptr, /* I - FITS file pointer                        */
           int maxfield,    /* I - maximum no. of columns to read;          */
           LONGLONG *naxis1, /* O - length of table row in bytes             */
           LONGLONG *naxis2, /* O - number of rows in the table              */
           int *tfields,    /* O - number of columns in the table           */
           char **ttype,    /* O - name of each column                      */
           LONGLONG *tbcol, /* O - byte offset in row to each column        */
           char **tform,    /* O - value of TFORMn keyword for each column  */
           char **tunit,    /* O - value of TUNITn keyword for each column  */
           char *extnm,     /* O - value of EXTNAME keyword, if any         */
           int *status)     /* IO - error status                            */
/*
  Get keywords from the Header of the ASCII TaBle:
  Check that the keywords conform to the FITS standard and return the
  parameters which describe the table.
*/
{
    int ii, maxf, nfound, tstatus;
    long fields;
    char name[FLEN_KEYWORD], value[FLEN_VALUE], comm[FLEN_COMMENT];
    char xtension[FLEN_VALUE], message[FLEN_ERRMSG];
    LONGLONG llnaxis1, llnaxis2, pcount;

    if (*status > 0)
        return(*status);

    /* read the first keyword of the extension */
    ffgkyn(fptr, 1, name, value, comm, status);

    if (!strcmp(name, "XTENSION"))
    {
            if (ffc2s(value, xtension, status) > 0)  /* get the value string */
            {
                ffpmsg("Bad value string for XTENSION keyword:");
                ffpmsg(value);
                return(*status);
            }

            /* allow the quoted string value to begin in any column and */
            /* allow any number of trailing blanks before the closing quote */
            if ( (value[0] != '\'')   ||  /* first char must be a quote */
                 ( strcmp(xtension, "TABLE") ) )
            {
                snprintf(message, FLEN_ERRMSG,
                "This is not a TABLE extension: %s", value);
                ffpmsg(message);
                return(*status = NOT_ATABLE);
            }
    }

    else  /* error: 1st keyword of extension != XTENSION */
    {
        snprintf(message, FLEN_ERRMSG,
        "First keyword of the extension is not XTENSION: %s", name);
        ffpmsg(message);
        return(*status = NO_XTENSION);
    }

    if (ffgttb(fptr, &llnaxis1, &llnaxis2, &pcount, &fields, status) > 0)
        return(*status);

    if (naxis1)
       *naxis1 = llnaxis1;

    if (naxis2)
       *naxis2 = llnaxis2;

    if (pcount != 0)
    {
       snprintf(message, FLEN_ERRMSG, "PCOUNT = %.0f is illegal in ASCII table; must = 0",
             (double) pcount);
       ffpmsg(message);
       return(*status = BAD_PCOUNT);
    }

    if (tfields)
       *tfields = fields;

    if (maxfield < 0)
        maxf = fields;
    else
        maxf = minvalue(maxfield, fields);

    if (maxf > 0)
    {
        for (ii = 0; ii < maxf; ii++)
        {   /* initialize optional keyword values */
            if (ttype)
                *ttype[ii] = '\0';   

            if (tunit)
                *tunit[ii] = '\0';
        }

   
        if (ttype)
            ffgkns(fptr, "TTYPE", 1, maxf, ttype, &nfound, status);

        if (tunit)
            ffgkns(fptr, "TUNIT", 1, maxf, tunit, &nfound, status);

        if (*status > 0)
            return(*status);

        if (tbcol)
        {
            ffgknjj(fptr, "TBCOL", 1, maxf, tbcol, &nfound, status);

            if (*status > 0 || nfound != maxf)
            {
                ffpmsg(
        "Required TBCOL keyword(s) not found in ASCII table header (ffghtbll).");
                return(*status = NO_TBCOL);
            }
        }

        if (tform)
        {
            ffgkns(fptr, "TFORM", 1, maxf, tform, &nfound, status);

            if (*status > 0 || nfound != maxf)
            {
                ffpmsg(
        "Required TFORM keyword(s) not found in ASCII table header (ffghtbll).");
                return(*status = NO_TFORM);
            }
        }
    }

    if (extnm)
    {
        extnm[0] = '\0';

        tstatus = *status;
        ffgkys(fptr, "EXTNAME", extnm, comm, status);

        if (*status == KEY_NO_EXIST)
            *status = tstatus;  /* keyword not required, so ignore error */
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffghbn(fitsfile *fptr,  /* I - FITS file pointer                        */
           int maxfield,    /* I - maximum no. of columns to read;          */
           long *naxis2,    /* O - number of rows in the table              */
           int *tfields,    /* O - number of columns in the table           */
           char **ttype,    /* O - name of each column                      */
           char **tform,    /* O - TFORMn value for each column             */
           char **tunit,    /* O - TUNITn value for each column             */
           char *extnm,     /* O - value of EXTNAME keyword, if any         */
           long *pcount,    /* O - value of PCOUNT keyword                  */
           int *status)     /* IO - error status                            */
/*
  Get keywords from the Header of the BiNary table:
  Check that the keywords conform to the FITS standard and return the
  parameters which describe the table.
*/
{
    int ii, maxf, nfound, tstatus;
    long  fields;
    char name[FLEN_KEYWORD], value[FLEN_VALUE], comm[FLEN_COMMENT];
    char xtension[FLEN_VALUE], message[FLEN_ERRMSG];
    LONGLONG naxis1ll, naxis2ll, pcountll;

    if (*status > 0)
        return(*status);

    /* read the first keyword of the extension */
    ffgkyn(fptr, 1, name, value, comm, status);

    if (!strcmp(name, "XTENSION"))
    {
            if (ffc2s(value, xtension, status) > 0)  /* get the value string */
            {
                ffpmsg("Bad value string for XTENSION keyword:");
                ffpmsg(value);
                return(*status);
            }

            /* allow the quoted string value to begin in any column and */
            /* allow any number of trailing blanks before the closing quote */
            if ( (value[0] != '\'')   ||  /* first char must be a quote */
                 ( strcmp(xtension, "BINTABLE") &&
                   strcmp(xtension, "A3DTABLE") &&
                   strcmp(xtension, "3DTABLE")
                 ) )
            {
                snprintf(message, FLEN_ERRMSG,
                "This is not a BINTABLE extension: %s", value);
                ffpmsg(message);
                return(*status = NOT_BTABLE);
            }
    }

    else  /* error: 1st keyword of extension != XTENSION */
    {
        snprintf(message, FLEN_ERRMSG,
        "First keyword of the extension is not XTENSION: %s", name);
        ffpmsg(message);
        return(*status = NO_XTENSION);
    }

    if (ffgttb(fptr, &naxis1ll, &naxis2ll, &pcountll, &fields, status) > 0)
        return(*status);

    if (naxis2)
       *naxis2 = (long) naxis2ll;

    if (pcount)
       *pcount = (long) pcountll;

    if (tfields)
        *tfields = fields;

    if (maxfield < 0)
        maxf = fields;
    else
        maxf = minvalue(maxfield, fields);

    if (maxf > 0)
    {
        for (ii = 0; ii < maxf; ii++)
        {   /* initialize optional keyword values */
            if (ttype)
                *ttype[ii] = '\0';   

            if (tunit)
                *tunit[ii] = '\0';
        }

        if (ttype)
            ffgkns(fptr, "TTYPE", 1, maxf, ttype, &nfound, status);

        if (tunit)
            ffgkns(fptr, "TUNIT", 1, maxf, tunit, &nfound, status);

        if (*status > 0)
            return(*status);

        if (tform)
        {
            ffgkns(fptr, "TFORM", 1, maxf, tform, &nfound, status);

            if (*status > 0 || nfound != maxf)
            {
                ffpmsg(
        "Required TFORM keyword(s) not found in binary table header (ffghbn).");
                return(*status = NO_TFORM);
            }
        }
    }

    if (extnm)
    {
        extnm[0] = '\0';

        tstatus = *status;
        ffgkys(fptr, "EXTNAME", extnm, comm, status);

        if (*status == KEY_NO_EXIST)
          *status = tstatus;  /* keyword not required, so ignore error */
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffghbnll(fitsfile *fptr,  /* I - FITS file pointer                        */
           int maxfield,    /* I - maximum no. of columns to read;          */
           LONGLONG *naxis2,    /* O - number of rows in the table              */
           int *tfields,    /* O - number of columns in the table           */
           char **ttype,    /* O - name of each column                      */
           char **tform,    /* O - TFORMn value for each column             */
           char **tunit,    /* O - TUNITn value for each column             */
           char *extnm,     /* O - value of EXTNAME keyword, if any         */
           LONGLONG *pcount,    /* O - value of PCOUNT keyword                  */
           int *status)     /* IO - error status                            */
/*
  Get keywords from the Header of the BiNary table:
  Check that the keywords conform to the FITS standard and return the
  parameters which describe the table.
*/
{
    int ii, maxf, nfound, tstatus;
    long  fields;
    char name[FLEN_KEYWORD], value[FLEN_VALUE], comm[FLEN_COMMENT];
    char xtension[FLEN_VALUE], message[FLEN_ERRMSG];
    LONGLONG naxis1ll, naxis2ll, pcountll;

    if (*status > 0)
        return(*status);

    /* read the first keyword of the extension */
    ffgkyn(fptr, 1, name, value, comm, status);

    if (!strcmp(name, "XTENSION"))
    {
            if (ffc2s(value, xtension, status) > 0)  /* get the value string */
            {
                ffpmsg("Bad value string for XTENSION keyword:");
                ffpmsg(value);
                return(*status);
            }

            /* allow the quoted string value to begin in any column and */
            /* allow any number of trailing blanks before the closing quote */
            if ( (value[0] != '\'')   ||  /* first char must be a quote */
                 ( strcmp(xtension, "BINTABLE") &&
                   strcmp(xtension, "A3DTABLE") &&
                   strcmp(xtension, "3DTABLE")
                 ) )
            {
                snprintf(message, FLEN_ERRMSG,
                "This is not a BINTABLE extension: %s", value);
                ffpmsg(message);
                return(*status = NOT_BTABLE);
            }
    }

    else  /* error: 1st keyword of extension != XTENSION */
    {
        snprintf(message, FLEN_ERRMSG,
        "First keyword of the extension is not XTENSION: %s", name);
        ffpmsg(message);
        return(*status = NO_XTENSION);
    }

    if (ffgttb(fptr, &naxis1ll, &naxis2ll, &pcountll, &fields, status) > 0)
        return(*status);

    if (naxis2)
       *naxis2 = naxis2ll;

    if (pcount)
       *pcount = pcountll;

    if (tfields)
        *tfields = fields;

    if (maxfield < 0)
        maxf = fields;
    else
        maxf = minvalue(maxfield, fields);

    if (maxf > 0)
    {
        for (ii = 0; ii < maxf; ii++)
        {   /* initialize optional keyword values */
            if (ttype)
                *ttype[ii] = '\0';   

            if (tunit)
                *tunit[ii] = '\0';
        }

        if (ttype)
            ffgkns(fptr, "TTYPE", 1, maxf, ttype, &nfound, status);

        if (tunit)
            ffgkns(fptr, "TUNIT", 1, maxf, tunit, &nfound, status);

        if (*status > 0)
            return(*status);

        if (tform)
        {
            ffgkns(fptr, "TFORM", 1, maxf, tform, &nfound, status);

            if (*status > 0 || nfound != maxf)
            {
                ffpmsg(
        "Required TFORM keyword(s) not found in binary table header (ffghbn).");
                return(*status = NO_TFORM);
            }
        }
    }

    if (extnm)
    {
        extnm[0] = '\0';

        tstatus = *status;
        ffgkys(fptr, "EXTNAME", extnm, comm, status);

        if (*status == KEY_NO_EXIST)
          *status = tstatus;  /* keyword not required, so ignore error */
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgphd(fitsfile *fptr,  /* I - FITS file pointer                        */
           int maxdim,      /* I - maximum no. of dimensions to read;       */
           int *simple,     /* O - does file conform to FITS standard? 1/0  */
           int *bitpix,     /* O - number of bits per data value pixel      */
           int *naxis,      /* O - number of axes in the data array         */
           LONGLONG naxes[],    /* O - length of each data axis                 */
           long *pcount,    /* O - number of group parameters (usually 0)   */
           long *gcount,    /* O - number of random groups (usually 1 or 0) */
           int *extend,     /* O - may FITS file haave extensions?          */
           double *bscale,  /* O - array pixel linear scaling factor        */
           double *bzero,   /* O - array pixel linear scaling zero point    */
           LONGLONG *blank, /* O - value used to represent undefined pixels */
           int *nspace,     /* O - number of blank keywords prior to END    */
           int *status)     /* IO - error status                            */
{
/*
  Get the Primary HeaDer parameters.  Check that the keywords conform to
  the FITS standard and return the parameters which determine the size and
  structure of the primary array or IMAGE extension.
*/
    int unknown, found_end, tstatus, ii, nextkey, namelen;
    long longbitpix, longnaxis;
    LONGLONG axislen;
    char message[FLEN_ERRMSG], keyword[FLEN_KEYWORD];
    char card[FLEN_CARD];
    char name[FLEN_KEYWORD], value[FLEN_VALUE], comm[FLEN_COMMENT];
    char xtension[FLEN_VALUE];

    if (*status > 0)
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if (simple)
       *simple = 1;

    unknown = 0;

    /*--------------------------------------------------------------------*/
    /*  Get 1st keyword of HDU and test whether it is SIMPLE or XTENSION  */
    /*--------------------------------------------------------------------*/
    ffgkyn(fptr, 1, name, value, comm, status);

    if ((fptr->Fptr)->curhdu == 0) /* Is this the beginning of the FITS file? */
    {
        if (!strcmp(name, "SIMPLE"))
        {
            if (value[0] == 'F')
            {
                if (simple)
                    *simple=0;          /* not a simple FITS file */
            }
            else if (value[0] != 'T')
                return(*status = BAD_SIMPLE);
        }

        else
        {
            snprintf(message, FLEN_ERRMSG,
                   "First keyword of the file is not SIMPLE: %s", name);
            ffpmsg(message);
            return(*status = NO_SIMPLE);
        }
    }

    else    /* not beginning of the file, so presumably an IMAGE extension */
    {       /* or it could be a compressed image in a binary table */

        if (!strcmp(name, "XTENSION"))
        {
            if (ffc2s(value, xtension, status) > 0)  /* get the value string */
            {
                ffpmsg("Bad value string for XTENSION keyword:");
                ffpmsg(value);
                return(*status);
            }

            /* allow the quoted string value to begin in any column and */
            /* allow any number of trailing blanks before the closing quote */
            if ( (value[0] != '\'')   ||  /* first char must be a quote */
                  ( strcmp(xtension, "IMAGE")  &&
                    strcmp(xtension, "IUEIMAGE") ) )
            {
                unknown = 1;  /* unknown type of extension; press on anyway */
                snprintf(message, FLEN_ERRMSG,
                   "This is not an IMAGE extension: %s", value);
                ffpmsg(message);
            }
        }

        else  /* error: 1st keyword of extension != XTENSION */
        {
            snprintf(message, FLEN_ERRMSG,
            "First keyword of the extension is not XTENSION: %s", name);
            ffpmsg(message);
            return(*status = NO_XTENSION);
        }
    }

    if (unknown && (fptr->Fptr)->compressimg)
    {
        /* this is a compressed image, so read ZBITPIX, ZNAXIS keywords */
        unknown = 0;  /* reset flag */
        ffxmsg(3, message); /* clear previous spurious error message */

        if (bitpix)
        {
            ffgidt(fptr, bitpix, status); /* get bitpix value */

            if (*status > 0)
            {
                ffpmsg("Error reading BITPIX value of compressed image");
                return(*status);
            }
        }

        if (naxis)
        {
            ffgidm(fptr, naxis, status); /* get NAXIS value */

            if (*status > 0)
            {
                ffpmsg("Error reading NAXIS value of compressed image");
                return(*status);
            }
        }

        if (naxes)
        {
            ffgiszll(fptr, maxdim, naxes, status);  /* get NAXISn value */

            if (*status > 0)
            {
                ffpmsg("Error reading NAXISn values of compressed image");
                return(*status);
            }
        }

        nextkey = 9; /* skip required table keywords in the following search */
    }
    else
    {

        /*----------------------------------------------------------------*/
        /*  Get 2nd keyword;  test whether it is BITPIX with legal value  */
        /*----------------------------------------------------------------*/
        ffgkyn(fptr, 2, name, value, comm, status);  /* BITPIX = 2nd keyword */

        if (strcmp(name, "BITPIX"))
        {
            snprintf(message, FLEN_ERRMSG,
            "Second keyword of the extension is not BITPIX: %s", name);
            ffpmsg(message);
            return(*status = NO_BITPIX);
        }

        if (ffc2ii(value,  &longbitpix, status) > 0)
        {
            snprintf(message, FLEN_ERRMSG,
            "Value of BITPIX keyword is not an integer: %s", value);
            ffpmsg(message);
            return(*status = BAD_BITPIX);
        }
        else if (longbitpix != BYTE_IMG && longbitpix != SHORT_IMG &&
             longbitpix != LONG_IMG && longbitpix != LONGLONG_IMG &&
             longbitpix != FLOAT_IMG && longbitpix != DOUBLE_IMG)
        {
            snprintf(message, FLEN_ERRMSG,
            "Illegal value for BITPIX keyword: %s", value);
            ffpmsg(message);
            return(*status = BAD_BITPIX);
        }
        if (bitpix)
            *bitpix = longbitpix;  /* do explicit type conversion */

        /*---------------------------------------------------------------*/
        /*  Get 3rd keyword;  test whether it is NAXIS with legal value  */
        /*---------------------------------------------------------------*/
        ffgtkn(fptr, 3, "NAXIS",  &longnaxis, status);

        if (*status == BAD_ORDER)
            return(*status = NO_NAXIS);
        else if (*status == NOT_POS_INT || longnaxis > 999)
        {
            snprintf(message,FLEN_ERRMSG,"NAXIS = %ld is illegal", longnaxis);
            ffpmsg(message);
            return(*status = BAD_NAXIS);
        }
        else
            if (naxis)
                 *naxis = longnaxis;  /* do explicit type conversion */

        /*---------------------------------------------------------*/
        /*  Get the next NAXISn keywords and test for legal values */
        /*---------------------------------------------------------*/
        for (ii=0, nextkey=4; ii < longnaxis; ii++, nextkey++)
        {
            ffkeyn("NAXIS", ii+1, keyword, status);
            ffgtknjj(fptr, 4+ii, keyword, &axislen, status);

            if (*status == BAD_ORDER)
                return(*status = NO_NAXES);
            else if (*status == NOT_POS_INT)
                return(*status = BAD_NAXES);
            else if (ii < maxdim)
                if (naxes)
                    naxes[ii] = axislen;
        }
    }

    /*---------------------------------------------------------*/
    /*  now look for other keywords of interest:               */
    /*  BSCALE, BZERO, BLANK, PCOUNT, GCOUNT, EXTEND, and END  */
    /*---------------------------------------------------------*/

    /*  initialize default values in case keyword is not present */
    if (bscale)
        *bscale = 1.0;
    if (bzero)
        *bzero  = 0.0;
    if (pcount)
        *pcount = 0;
    if (gcount)
        *gcount = 1;
    if (extend)
        *extend = 0;
    if (blank)
      *blank = NULL_UNDEFINED; /* no default null value for BITPIX=8,16,32 */

    *nspace = 0;
    found_end = 0;
    tstatus = *status;

    for (; !found_end; nextkey++)  
    {
      /* get next keyword */
      /* don't use ffgkyn here because it trys to parse the card to read */
      /* the value string, thus failing to read the file just because of */
      /* minor syntax errors in optional keywords.                       */

      if (ffgrec(fptr, nextkey, card, status) > 0 )  /* get the 80-byte card */
      {
        if (*status == KEY_OUT_BOUNDS)
        {
          found_end = 1;  /* simply hit the end of the header */
          *status = tstatus;  /* reset error status */
        }
        else          
        {
          ffpmsg("Failed to find the END keyword in header (ffgphd).");
        }
      }
      else /* got the next keyword without error */
      {
        ffgknm(card, name, &namelen, status); /* get the keyword name */

        if (fftrec(name, status) > 0)  /* test keyword name; catches no END */
        {
          snprintf(message, FLEN_ERRMSG,
              "Name of keyword no. %d contains illegal character(s): %s",
              nextkey, name);
          ffpmsg(message);

          if (nextkey % 36 == 0) /* test if at beginning of 36-card record */
            ffpmsg("  (This may indicate a missing END keyword).");
        }

        if (!strcmp(name, "BSCALE") && bscale)
        {
            *nspace = 0;  /* reset count of blank keywords */
            ffpsvc(card, value, comm, status); /* parse value and comment */

            if (ffc2dd(value, bscale, status) > 0) /* convert to double */
            {
                /* reset error status and continue, but still issue warning */
                *status = tstatus;
                *bscale = 1.0;

                snprintf(message, FLEN_ERRMSG,
                "Error reading BSCALE keyword value as a double: %s", value);
                ffpmsg(message);
            }
        }

        else if (!strcmp(name, "BZERO") && bzero)
        {
            *nspace = 0;  /* reset count of blank keywords */
            ffpsvc(card, value, comm, status); /* parse value and comment */

            if (ffc2dd(value, bzero, status) > 0) /* convert to double */
            {
                /* reset error status and continue, but still issue warning */
                *status = tstatus;
                *bzero = 0.0;

                snprintf(message, FLEN_ERRMSG,
                "Error reading BZERO keyword value as a double: %s", value);
                ffpmsg(message);
            }
        }

        else if (!strcmp(name, "BLANK") && blank)
        {
            *nspace = 0;  /* reset count of blank keywords */
            ffpsvc(card, value, comm, status); /* parse value and comment */

            if (ffc2jj(value, blank, status) > 0) /* convert to LONGLONG */
            {
                /* reset error status and continue, but still issue warning */
                *status = tstatus;
                *blank = NULL_UNDEFINED;

                snprintf(message, FLEN_ERRMSG,
                "Error reading BLANK keyword value as an integer: %s", value);
                ffpmsg(message);
            }
        }

        else if (!strcmp(name, "PCOUNT") && pcount)
        {
            *nspace = 0;  /* reset count of blank keywords */
            ffpsvc(card, value, comm, status); /* parse value and comment */

            if (ffc2ii(value, pcount, status) > 0) /* convert to long */
            {
                snprintf(message, FLEN_ERRMSG,
                "Error reading PCOUNT keyword value as an integer: %s", value);
                ffpmsg(message);
            }
        }

        else if (!strcmp(name, "GCOUNT") && gcount)
        {
            *nspace = 0;  /* reset count of blank keywords */
            ffpsvc(card, value, comm, status); /* parse value and comment */

            if (ffc2ii(value, gcount, status) > 0) /* convert to long */
            {
                snprintf(message, FLEN_ERRMSG,
                "Error reading GCOUNT keyword value as an integer: %s", value);
                ffpmsg(message);
            }
        }

        else if (!strcmp(name, "EXTEND") && extend)
        {
            *nspace = 0;  /* reset count of blank keywords */
            ffpsvc(card, value, comm, status); /* parse value and comment */

            if (ffc2ll(value, extend, status) > 0) /* convert to logical */
            {
                /* reset error status and continue, but still issue warning */
                *status = tstatus;
                *extend = 0;

                snprintf(message, FLEN_ERRMSG,
                "Error reading EXTEND keyword value as a logical: %s", value);
                ffpmsg(message);
            }
        }

        else if (!strcmp(name, "END"))
            found_end = 1;

        else if (!card[0] )
            *nspace = *nspace + 1;  /* this is a blank card in the header */

        else
            *nspace = 0;  /* reset count of blank keywords immediately
                            before the END keyword to zero   */
      }

      if (*status > 0)  /* exit on error after writing error message */
      {
        if ((fptr->Fptr)->curhdu == 0)
            ffpmsg(
            "Failed to read the required primary array header keywords.");
        else
            ffpmsg(
            "Failed to read the required image extension header keywords.");

        return(*status);
      }
    }

    if (unknown)
       *status = NOT_IMAGE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgttb(fitsfile *fptr,      /* I - FITS file pointer*/
           LONGLONG *rowlen,        /* O - length of a table row, in bytes */
           LONGLONG *nrows,         /* O - number of rows in the table */
           LONGLONG *pcount,    /* O - value of PCOUNT keyword */
           long *tfields,       /* O - number of fields in the table */
           int *status)         /* IO - error status    */
{
/*
  Get and Test TaBle;
  Test that this is a legal ASCII or binary table and get some keyword values.
  We assume that the calling routine has already tested the 1st keyword
  of the extension to ensure that this is really a table extension.
*/
    if (*status > 0)
        return(*status);

    if (fftkyn(fptr, 2, "BITPIX", "8", status) == BAD_ORDER) /* 2nd keyword */
        return(*status = NO_BITPIX);  /* keyword not BITPIX */
    else if (*status == NOT_POS_INT)
        return(*status = BAD_BITPIX); /* value != 8 */

    if (fftkyn(fptr, 3, "NAXIS", "2", status) == BAD_ORDER) /* 3rd keyword */
        return(*status = NO_NAXIS);  /* keyword not NAXIS */
    else if (*status == NOT_POS_INT)
        return(*status = BAD_NAXIS); /* value != 2 */

    if (ffgtknjj(fptr, 4, "NAXIS1", rowlen, status) == BAD_ORDER) /* 4th key */
        return(*status = NO_NAXES);  /* keyword not NAXIS1 */
    else if (*status == NOT_POS_INT)
        return(*status == BAD_NAXES); /* bad NAXIS1 value */

    if (ffgtknjj(fptr, 5, "NAXIS2", nrows, status) == BAD_ORDER) /* 5th key */
        return(*status = NO_NAXES);  /* keyword not NAXIS2 */
    else if (*status == NOT_POS_INT)
        return(*status == BAD_NAXES); /* bad NAXIS2 value */

    if (ffgtknjj(fptr, 6, "PCOUNT", pcount, status) == BAD_ORDER) /* 6th key */
        return(*status = NO_PCOUNT);  /* keyword not PCOUNT */
    else if (*status == NOT_POS_INT)
        return(*status = BAD_PCOUNT); /* bad PCOUNT value */

    if (fftkyn(fptr, 7, "GCOUNT", "1", status) == BAD_ORDER) /* 7th keyword */
        return(*status = NO_GCOUNT);  /* keyword not GCOUNT */
    else if (*status == NOT_POS_INT)
        return(*status = BAD_GCOUNT); /* value != 1 */

    if (ffgtkn(fptr, 8, "TFIELDS", tfields, status) == BAD_ORDER) /* 8th key*/
        return(*status = NO_TFIELDS);  /* keyword not TFIELDS */
    else if (*status == NOT_POS_INT || *tfields > 999)
        return(*status == BAD_TFIELDS); /* bad TFIELDS value */


    if (*status > 0)
       ffpmsg(
       "Error reading required keywords in the table header (FTGTTB).");

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgtkn(fitsfile *fptr,  /* I - FITS file pointer              */
           int numkey,      /* I - number of the keyword to read  */
           char *name,      /* I - expected name of the keyword   */
           long *value,     /* O - integer value of the keyword   */
           int *status)     /* IO - error status                  */
{
/*
  test that keyword number NUMKEY has the expected name and get the
  integer value of the keyword.  Return an error if the keyword
  name does not match the input name, or if the value of the
  keyword is not a positive integer.
*/
    char keyname[FLEN_KEYWORD], valuestring[FLEN_VALUE];
    char comm[FLEN_COMMENT], message[FLEN_ERRMSG];
   
    if (*status > 0)
        return(*status);
    
    keyname[0] = '\0';
    valuestring[0] = '\0';

    if (ffgkyn(fptr, numkey, keyname, valuestring, comm, status) <= 0)
    {
        if (strcmp(keyname, name) )
            *status = BAD_ORDER;  /* incorrect keyword name */

        else
        {
            ffc2ii(valuestring, value, status);  /* convert to integer */

            if (*status > 0 || *value < 0 )
               *status = NOT_POS_INT;
        }

        if (*status > 0)
        {
            snprintf(message, FLEN_ERRMSG,
              "ffgtkn found unexpected keyword or value for keyword no. %d.",
              numkey);
            ffpmsg(message);

            snprintf(message, FLEN_ERRMSG,
              " Expected positive integer keyword %s, but instead", name);
            ffpmsg(message);

            snprintf(message, FLEN_ERRMSG,
              " found keyword %s with value %s", keyname, valuestring);
            ffpmsg(message);
        }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgtknjj(fitsfile *fptr,  /* I - FITS file pointer              */
           int numkey,      /* I - number of the keyword to read  */
           char *name,      /* I - expected name of the keyword   */
           LONGLONG *value, /* O - integer value of the keyword   */
           int *status)     /* IO - error status                  */
{
/*
  test that keyword number NUMKEY has the expected name and get the
  integer value of the keyword.  Return an error if the keyword
  name does not match the input name, or if the value of the
  keyword is not a positive integer.
*/
    char keyname[FLEN_KEYWORD], valuestring[FLEN_VALUE];
    char comm[FLEN_COMMENT], message[FLEN_ERRMSG];
   
    if (*status > 0)
        return(*status);
    
    keyname[0] = '\0';
    valuestring[0] = '\0';

    if (ffgkyn(fptr, numkey, keyname, valuestring, comm, status) <= 0)
    {
        if (strcmp(keyname, name) )
            *status = BAD_ORDER;  /* incorrect keyword name */

        else
        {
            ffc2jj(valuestring, value, status);  /* convert to integer */

            if (*status > 0 || *value < 0 )
               *status = NOT_POS_INT;
        }

        if (*status > 0)
        {
            snprintf(message, FLEN_ERRMSG,
              "ffgtknjj found unexpected keyword or value for keyword no. %d.",
              numkey);
            ffpmsg(message);

            snprintf(message, FLEN_ERRMSG,
              " Expected positive integer keyword %s, but instead", name);
            ffpmsg(message);

            snprintf(message, FLEN_ERRMSG,
              " found keyword %s with value %s", keyname, valuestring);
            ffpmsg(message);
        }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fftkyn(fitsfile *fptr,  /* I - FITS file pointer              */
           int numkey,      /* I - number of the keyword to read  */
           char *name,      /* I - expected name of the keyword   */
           char *value,     /* I - expected value of the keyword  */
           int *status)     /* IO - error status                  */
{
/*
  test that keyword number NUMKEY has the expected name and the
  expected value string.
*/
    char keyname[FLEN_KEYWORD], valuestring[FLEN_VALUE];
    char comm[FLEN_COMMENT], message[FLEN_ERRMSG];
   
    if (*status > 0)
        return(*status);
    
    keyname[0] = '\0';
    valuestring[0] = '\0';

    if (ffgkyn(fptr, numkey, keyname, valuestring, comm, status) <= 0)
    {
        if (strcmp(keyname, name) )
            *status = BAD_ORDER;  /* incorrect keyword name */

        if (strcmp(value, valuestring) )
            *status = NOT_POS_INT;  /* incorrect keyword value */
    }

    if (*status > 0)
    {
        snprintf(message, FLEN_ERRMSG,
          "fftkyn found unexpected keyword or value for keyword no. %d.",
          numkey);
        ffpmsg(message);

        snprintf(message, FLEN_ERRMSG,
          " Expected keyword %s with value %s, but", name, value);
        ffpmsg(message);

        snprintf(message, FLEN_ERRMSG,
          " found keyword %s with value %s", keyname, valuestring);
        ffpmsg(message);
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffh2st(fitsfile *fptr,   /* I - FITS file pointer           */
           char **header,    /* O - returned header string      */
           int  *status)     /* IO - error status               */

/*
  read header keywords into a long string of chars.  This routine allocates
  memory for the string, so the calling routine must eventually free the
  memory when it is not needed any more.
*/
{
    int nkeys;
    long nrec;
    LONGLONG headstart;

    if (*status > 0)
        return(*status);

    /* get number of keywords in the header (doesn't include END) */
    if (ffghsp(fptr, &nkeys, NULL, status) > 0)
        return(*status);

    nrec = (nkeys / 36 + 1);

    /* allocate memory for all the keywords (multiple of 2880 bytes) */
    *header = (char *) calloc ( nrec * 2880 + 1, 1);
    if (!(*header))
    {
         *status = MEMORY_ALLOCATION;
         ffpmsg("failed to allocate memory to hold all the header keywords");
         return(*status);
    }

    ffghadll(fptr, &headstart, NULL, NULL, status); /* get header address */
    ffmbyt(fptr, headstart, REPORT_EOF, status);   /* move to header */
    ffgbyt(fptr, nrec * 2880, *header, status);     /* copy header */
    *(*header + (nrec * 2880)) = '\0';

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffhdr2str( fitsfile *fptr,  /* I - FITS file pointer                    */
            int exclude_comm,   /* I - if TRUE, exclude commentary keywords */
            char **exclist,     /* I - list of excluded keyword names       */
            int nexc,           /* I - number of names in exclist           */
            char **header,      /* O - returned header string               */
            int *nkeys,         /* O - returned number of 80-char keywords  */
            int  *status)       /* IO - error status                        */
/*
  read header keywords into a long string of chars.  This routine allocates
  memory for the string, so the calling routine must eventually free the
  memory when it is not needed any more.  If exclude_comm is TRUE, then all 
  the COMMENT, HISTORY, and  keywords will be excluded from the output
  string of keywords.  Any other list of keywords to be excluded may be
  specified with the exclist parameter.
*/
{
    int casesn, match, exact, totkeys;
    long ii, jj;
    char keybuf[162], keyname[FLEN_KEYWORD], *headptr;

    *nkeys = 0;

    if (*status > 0)
        return(*status);

    /* get number of keywords in the header (doesn't include END) */
    if (ffghsp(fptr, &totkeys, NULL, status) > 0)
        return(*status);

    /* allocate memory for all the keywords */
    /* (will reallocate it later to minimize the memory size) */
    
    *header = (char *) calloc ( (totkeys + 1) * 80 + 1, 1);
    if (!(*header))
    {
         *status = MEMORY_ALLOCATION;
         ffpmsg("failed to allocate memory to hold all the header keywords");
         return(*status);
    }

    headptr = *header;
    casesn = FALSE;

    /* read every keyword */
    for (ii = 1; ii <= totkeys; ii++) 
    {
        ffgrec(fptr, ii, keybuf, status);
        /* pad record with blanks so that it is at least 80 chars long */
        strcat(keybuf,
    "                                                                                ");

        keyname[0] = '\0';
        strncat(keyname, keybuf, 8); /* copy the keyword name */
        
        if (exclude_comm)
        {
            if (!FSTRCMP("COMMENT ", keyname) ||
                !FSTRCMP("HISTORY ", keyname) ||
                !FSTRCMP("        ", keyname) )
              continue;  /* skip this commentary keyword */
        }

        /* does keyword match any names in the exclusion list? */
        for (jj = 0; jj < nexc; jj++ )
        {
            ffcmps(exclist[jj], keyname, casesn, &match, &exact);
                 if (match)
                     break;
        }

        if (jj == nexc)
        {
            /* not in exclusion list, add this keyword to the string */
            strcpy(headptr, keybuf);
            headptr += 80;
            (*nkeys)++;
        }
    }

    /* add the END keyword */
    strcpy(headptr,
    "END                                                                             ");
    headptr += 80;
    (*nkeys)++;

    *headptr = '\0';   /* terminate the header string */
    /* minimize the allocated memory */
    *header = (char *) realloc(*header, (*nkeys *80) + 1);  

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffcnvthdr2str( fitsfile *fptr,  /* I - FITS file pointer                    */
            int exclude_comm,   /* I - if TRUE, exclude commentary keywords */
            char **exclist,     /* I - list of excluded keyword names       */
            int nexc,           /* I - number of names in exclist           */
            char **header,      /* O - returned header string               */
            int *nkeys,         /* O - returned number of 80-char keywords  */
            int  *status)       /* IO - error status                        */
/*
  Same as ffhdr2str, except that if the input HDU is a tile compressed image
  (stored in a binary table) then it will first convert that header back
  to that of a normal uncompressed FITS image before concatenating the header
  keyword records.
*/
{
    fitsfile *tempfptr;
    
    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status) )
    {
        /* this is a tile compressed image, so need to make an uncompressed */
	/* copy of the image header in memory before concatenating the keywords */
        if (fits_create_file(&tempfptr, "mem://", status) > 0) {
	    return(*status);
	}

	if (fits_img_decompress_header(fptr, tempfptr, status) > 0) {
	    fits_delete_file(tempfptr, status);
	    return(*status);
	}

	ffhdr2str(tempfptr, exclude_comm, exclist, nexc, header, nkeys, status);
	fits_close_file(tempfptr, status);

    } else {
        ffhdr2str(fptr, exclude_comm, exclist, nexc, header, nkeys, status);
    }

    return(*status);
}
cfitsio-3.47/group.c0000644000225700000360000055233613464573432013726 0ustar  cagordonlhea/*  This file, group.c, contains the grouping convention suport routines.  */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */
/*                                                                         */
/*  The group.c module of CFITSIO was written by Donald G. Jennings of     */
/*  the INTEGRAL Science Data Centre (ISDC) under NASA contract task       */
/*  66002J6. The above copyright laws apply. Copyright guidelines of The   */
/*  University of Geneva might also apply.                                 */

/*  The following routines are designed to create, read, and manipulate    */
/*  FITS Grouping Tables as defined in the FITS Grouping Convention paper  */
/*  by Jennings, Pence, Folk and Schlesinger. The development of the       */
/*  grouping structure was partially funded under the NASA AISRP Program.  */ 
    
#include "fitsio2.h"
#include "group.h"
#include 
#include 
#include 

#if defined(WIN32) || defined(__WIN32__)
#include    /* defines the getcwd function on Windows PCs */
#endif

#if defined(unix) || defined(__unix__)  || defined(__unix) || defined(HAVE_UNISTD_H)
#include   /* needed for getcwd prototype on unix machines */
#endif

#define HEX_ESCAPE '%'

/*---------------------------------------------------------------------------
 Change record:

D. Jennings, 18/06/98, version 1.0 of group module delivered to B. Pence for
                       integration into CFITSIO 2.005

D. Jennings, 17/11/98, fixed bug in ffgtcpr(). Now use fits_find_nextkey()
                       correctly and insert auxiliary keyword records 
		       directly before the TTYPE1 keyword in the copied
		       group table.

D. Jennings, 22/01/99, ffgmop() now looks for relative file paths when 
                       the MEMBER_LOCATION information is given in a 
		       grouping table.

D. Jennings, 01/02/99, ffgtop() now looks for relatve file paths when 
                       the GRPLCn keyword value is supplied in the member
		       HDU header.

D. Jennings, 01/02/99, ffgtam() now trys to construct relative file paths
                       from the member's file to the group table's file
		       (and visa versa) when both the member's file and
		       group table file are of access type FILE://.

D. Jennings, 05/05/99, removed the ffgtcn() function; made obsolete by
                       fits_get_url().

D. Jennings, 05/05/99, updated entire module to handle partial URLs and
                       absolute URLs more robustly. Host dependent directory
		       paths are now converted to true URLs before being
		       read from/written to grouping tables.

D. Jennings, 05/05/99, added the following new functions (note, none of these
                       are directly callable by the application)

		       int fits_path2url()
		       int fits_url2path()
		       int fits_get_cwd()
		       int fits_get_url()
		       int fits_clean_url()
		       int fits_relurl2url()
		       int fits_encode_url()
		       int fits_unencode_url()
		       int fits_is_url_absolute()

-----------------------------------------------------------------------------*/

/*---------------------------------------------------------------------------*/
int ffgtcr(fitsfile *fptr,      /* FITS file pointer                         */
	   char    *grpname,    /* name of the grouping table                */
	   int      grouptype,  /* code specifying the type of
				   grouping table information:
				   GT_ID_ALL_URI  0 ==> defualt (all columns)
				   GT_ID_REF      1 ==> ID by reference
				   GT_ID_POS      2 ==> ID by position
				   GT_ID_ALL      3 ==> ID by ref. and position
				   GT_ID_REF_URI 11 ==> (1) + URI info 
				   GT_ID_POS_URI 12 ==> (2) + URI info       */
	   int      *status    )/* return status code                        */

/* 
   create a grouping table at the end of the current FITS file. This
   function makes the last HDU in the file the CHDU, then calls the
   fits_insert_group() function to actually create the new grouping table.
*/

{
  int hdutype;
  int hdunum;


  if(*status != 0) return(*status);


  *status = fits_get_num_hdus(fptr,&hdunum,status);

  /* If hdunum is 0 then we are at the beginning of the file and
     we actually haven't closed the first header yet, so don't do
     anything more */

  if (0 != hdunum) {

      *status = fits_movabs_hdu(fptr,hdunum,&hdutype,status);
  }

  /* Now, the whole point of the above two fits_ calls was to get to
     the end of file.  Let's ignore errors at this point and keep
     going since any error is likely to mean that we are already at the 
     EOF, or the file is fatally corrupted.  If we are at the EOF then
     the next fits_ call will be ok.  If it's corrupted then the
     next call will fail, but that's not big deal at this point.
  */

  if (0 != *status ) *status = 0;

  *status = fits_insert_group(fptr,grpname,grouptype,status);

  return(*status);
}

/*---------------------------------------------------------------------------*/
int ffgtis(fitsfile *fptr,      /* FITS file pointer                         */
	   char    *grpname,    /* name of the grouping table                */
	   int      grouptype,  /* code specifying the type of
				   grouping table information:
				   GT_ID_ALL_URI  0 ==> defualt (all columns)
				   GT_ID_REF      1 ==> ID by reference
				   GT_ID_POS      2 ==> ID by position
				   GT_ID_ALL      3 ==> ID by ref. and position
				   GT_ID_REF_URI 11 ==> (1) + URI info 
				   GT_ID_POS_URI 12 ==> (2) + URI info       */
	   int      *status)     /* return status code                       */
	   
/* 
   insert a grouping table just after the current HDU of the current FITS file.
   This is the same as fits_create_group() only it allows the user to select
   the place within the FITS file to add the grouping table.
*/

{

  int tfields  = 0;
  int hdunum   = 0;
  int hdutype  = 0;
  int extver;
  int i;
  
  long pcount  = 0;

  char *ttype[6];
  char *tform[6];

  char ttypeBuff[102];  
  char tformBuff[54];  

  char  extname[] = "GROUPING";
  char  keyword[FLEN_KEYWORD];
  char  keyvalue[FLEN_VALUE];
  char  comment[FLEN_COMMENT];
    
  do
    {

      /* set up the ttype and tform character buffers */

      for(i = 0; i < 6; ++i)
	{
	  ttype[i] = ttypeBuff+(i*17);
	  tform[i] = tformBuff+(i*9);
	}

      /* define the columns required according to the grouptype parameter */

      *status = ffgtdc(grouptype,0,0,0,0,0,0,ttype,tform,&tfields,status);

      /* create the grouping table using the columns defined above */

      *status = fits_insert_btbl(fptr,0,tfields,ttype,tform,NULL,
				 NULL,pcount,status);

      if(*status != 0) continue;

      /*
	 retrieve the hdu position of the new grouping table for
	 future use
      */

      fits_get_hdu_num(fptr,&hdunum);

      /*
	 add the EXTNAME and EXTVER keywords to the HDU just after the 
	 TFIELDS keyword; for now the EXTVER value is set to 0, it will be 
	 set to the correct value later on
      */

      fits_read_keyword(fptr,"TFIELDS",keyvalue,comment,status);

      fits_insert_key_str(fptr,"EXTNAME",extname,
			  "HDU contains a Grouping Table",status);
      fits_insert_key_lng(fptr,"EXTVER",0,"Grouping Table vers. (this file)",
			  status);

      /* 
	 if the grpname parameter value was defined (Non NULL and non zero
	 length) then add the GRPNAME keyword and value
      */

      if(grpname != NULL && strlen(grpname) > 0)
	fits_insert_key_str(fptr,"GRPNAME",grpname,"Grouping Table name",
			    status);

      /* 
	 add the TNULL keywords and values for each integer column defined;
	 integer null values are zero (0) for the MEMBER_POSITION and 
	 MEMBER_VERSION columns.
      */

      for(i = 0; i < tfields && *status == 0; ++i)
	{	  
	  if(fits_strcasecmp(ttype[i],"MEMBER_POSITION") == 0 ||
	     fits_strcasecmp(ttype[i],"MEMBER_VERSION")  == 0)
	    {
	      snprintf(keyword,FLEN_KEYWORD,"TFORM%d",i+1);
	      *status = fits_read_key_str(fptr,keyword,keyvalue,comment,
					  status);
	 
	      snprintf(keyword,FLEN_KEYWORD,"TNULL%d",i+1);

	      *status = fits_insert_key_lng(fptr,keyword,0,"Column Null Value",
					    status);
	    }
	}

      /*
	 determine the correct EXTVER value for the new grouping table
	 by finding the highest numbered grouping table EXTVER value
	 the currently exists
      */

      for(extver = 1;
	  (fits_movnam_hdu(fptr,ANY_HDU,"GROUPING",extver,status)) == 0; 
	  ++extver);

      if(*status == BAD_HDU_NUM) *status = 0;

      /*
	 move back to the new grouping table HDU and update the EXTVER
	 keyword value
      */

      fits_movabs_hdu(fptr,hdunum,&hdutype,status);

      fits_modify_key_lng(fptr,"EXTVER",extver,"&",status);

    }while(0);


  return(*status);
}

/*---------------------------------------------------------------------------*/
int ffgtch(fitsfile *gfptr,     /* FITS pointer to group                     */
	   int       grouptype, /* code specifying the type of
				   grouping table information:
				   GT_ID_ALL_URI  0 ==> defualt (all columns)
				   GT_ID_REF      1 ==> ID by reference
				   GT_ID_POS      2 ==> ID by position
				   GT_ID_ALL      3 ==> ID by ref. and position
				   GT_ID_REF_URI 11 ==> (1) + URI info 
				   GT_ID_POS_URI 12 ==> (2) + URI info       */
	   int      *status)     /* return status code                       */


/* 
   Change the grouping table structure of the grouping table pointed to by
   gfptr. The grouptype code specifies the new structure of the table. This
   operation only adds or removes grouping table columns, it does not add
   or delete group members (i.e., table rows). If the grouping table already
   has the desired structure then no operations are performed and function   
   simply returns with a (0) success status code. If the requested structure
   change creates new grouping table columns, then the column values for all
   existing members will be filled with the appropriate null values.
*/

{
  int xtensionCol, extnameCol, extverCol, positionCol, locationCol, uriCol;
  int ncols    = 0;
  int colnum   = 0;
  int nrows    = 0;
  int grptype  = 0;
  int i,j;

  long intNull  = 0;
  long tfields  = 0;
  
  char *tform[6];
  char *ttype[6];

  unsigned char  charNull[1] = {'\0'};

  char ttypeBuff[102];  
  char tformBuff[54];  

  char  keyword[FLEN_KEYWORD];
  char  keyvalue[FLEN_VALUE];
  char  comment[FLEN_COMMENT];


  if(*status != 0) return(*status);

  do
    {
      /* set up the ttype and tform character buffers */

      for(i = 0; i < 6; ++i)
	{
	  ttype[i] = ttypeBuff+(i*17);
	  tform[i] = tformBuff+(i*9);
	}

      /* retrieve positions of all Grouping table reserved columns */

      *status = ffgtgc(gfptr,&xtensionCol,&extnameCol,&extverCol,&positionCol,
		       &locationCol,&uriCol,&grptype,status);

      if(*status != 0) continue;

      /* determine the total number of grouping table columns */

      *status = fits_read_key_lng(gfptr,"TFIELDS",&tfields,comment,status);

      /* define grouping table columns to be added to the configuration */

      *status = ffgtdc(grouptype,xtensionCol,extnameCol,extverCol,positionCol,
		       locationCol,uriCol,ttype,tform,&ncols,status);

      /*
	delete any grouping tables columns that exist but do not belong to
	new desired configuration; note that we delete before creating new
	columns for (file size) efficiency reasons
      */

      switch(grouptype)
	{

	case GT_ID_ALL_URI:

	  /* no columns to be deleted in this case */

	  break;

	case GT_ID_REF:

	  if(positionCol != 0) 
	    {
	      *status = fits_delete_col(gfptr,positionCol,status);
	      --tfields;
	      if(uriCol      > positionCol)  --uriCol;
	      if(locationCol > positionCol) --locationCol;
	    }
	  if(uriCol      != 0)
	    { 
	    *status = fits_delete_col(gfptr,uriCol,status);
	      --tfields;
	      if(locationCol > uriCol) --locationCol;
	    }
	  if(locationCol != 0) 
	    *status = fits_delete_col(gfptr,locationCol,status);

	  break;

	case  GT_ID_POS:

	  if(xtensionCol != 0) 
	    {
	      *status = fits_delete_col(gfptr,xtensionCol,status);
	      --tfields;
	      if(extnameCol  > xtensionCol)  --extnameCol;
	      if(extverCol   > xtensionCol)  --extverCol;
	      if(uriCol      > xtensionCol)  --uriCol;
	      if(locationCol > xtensionCol)  --locationCol;
	    }
	  if(extnameCol  != 0) 
	    {
	      *status = fits_delete_col(gfptr,extnameCol,status);
	      --tfields;
	      if(extverCol   > extnameCol)  --extverCol;
	      if(uriCol      > extnameCol)  --uriCol;
	      if(locationCol > extnameCol)  --locationCol;
	    }
	  if(extverCol   != 0)
	    { 
	      *status = fits_delete_col(gfptr,extverCol,status);
	      --tfields;
	      if(uriCol      > extverCol)  --uriCol;
	      if(locationCol > extverCol)  --locationCol;
	    }
	  if(uriCol      != 0)
	    { 
	      *status = fits_delete_col(gfptr,uriCol,status);
	      --tfields;
	      if(locationCol > uriCol)  --locationCol;
	    }
	  if(locationCol != 0)
	    { 
	      *status = fits_delete_col(gfptr,locationCol,status);
	      --tfields;
	    }
	  
	  break;

	case  GT_ID_ALL:

	  if(uriCol      != 0) 
	    {
	      *status = fits_delete_col(gfptr,uriCol,status);
	      --tfields;
	      if(locationCol > uriCol)  --locationCol;
	    }
	  if(locationCol != 0)
	    { 
	      *status = fits_delete_col(gfptr,locationCol,status);
	      --tfields;
	    }

	  break;

	case GT_ID_REF_URI:

	  if(positionCol != 0)
	    { 
	      *status = fits_delete_col(gfptr,positionCol,status);
	      --tfields;
	    }

	  break;

	case  GT_ID_POS_URI:

	  if(xtensionCol != 0) 
	    {
	      *status = fits_delete_col(gfptr,xtensionCol,status);
	      --tfields;
	      if(extnameCol > xtensionCol)  --extnameCol;
	      if(extverCol  > xtensionCol)  --extverCol;
	    }
	  if(extnameCol  != 0)
	    { 
	      *status = fits_delete_col(gfptr,extnameCol,status);
	      --tfields;
	      if(extverCol > extnameCol)  --extverCol;
	    }
	  if(extverCol   != 0)
	    { 
	      *status = fits_delete_col(gfptr,extverCol,status);
	      --tfields;
	    }

	  break;

	default:

	  *status = BAD_OPTION;
	  ffpmsg("Invalid value for grouptype parameter specified (ffgtch)");
	  break;

	}

      /*
	add all the new grouping table columns that were not there
	previously but are called for by the grouptype parameter
      */

      for(i = 0; i < ncols && *status == 0; ++i)
	*status = fits_insert_col(gfptr,tfields+i+1,ttype[i],tform[i],status);

      /* 
	 add the TNULL keywords and values for each new integer column defined;
	 integer null values are zero (0) for the MEMBER_POSITION and 
	 MEMBER_VERSION columns. Insert a null ("/0") into each new string
	 column defined: MEMBER_XTENSION, MEMBER_NAME, MEMBER_URI_TYPE and
	 MEMBER_LOCATION. Note that by convention a null string is the
	 TNULL value for character fields so no TNULL is required.
      */

      for(i = 0; i < ncols && *status == 0; ++i)
	{	  
	  if(fits_strcasecmp(ttype[i],"MEMBER_POSITION") == 0 ||
	     fits_strcasecmp(ttype[i],"MEMBER_VERSION")  == 0)
	    {
	      /* col contains int data; set TNULL and insert 0 for each col */

	      *status = fits_get_colnum(gfptr,CASESEN,ttype[i],&colnum,
					status);
	      
	      snprintf(keyword,FLEN_KEYWORD,"TFORM%d",colnum);

	      *status = fits_read_key_str(gfptr,keyword,keyvalue,comment,
					  status);
	 
	      snprintf(keyword,FLEN_KEYWORD,"TNULL%d",colnum);

	      *status = fits_insert_key_lng(gfptr,keyword,0,
					    "Column Null Value",status);

	      for(j = 1; j <= nrows && *status == 0; ++j)
		*status = fits_write_col_lng(gfptr,colnum,j,1,1,&intNull,
					     status);
	    }
	  else if(fits_strcasecmp(ttype[i],"MEMBER_XTENSION") == 0 ||
		  fits_strcasecmp(ttype[i],"MEMBER_NAME")     == 0 ||
		  fits_strcasecmp(ttype[i],"MEMBER_URI_TYPE") == 0 ||
		  fits_strcasecmp(ttype[i],"MEMBER_LOCATION") == 0)
	    {

	      /* new col contains character data; insert NULLs into each col */

	      *status = fits_get_colnum(gfptr,CASESEN,ttype[i],&colnum,
					status);

	      for(j = 1; j <= nrows && *status == 0; ++j)
	    /* WILL THIS WORK FOR VAR LENTH CHAR COLS??????*/
		*status = fits_write_col_byt(gfptr,colnum,j,1,1,charNull,
					     status);
	    }
	}

    }while(0);

  return(*status);
}

/*---------------------------------------------------------------------------*/
int ffgtrm(fitsfile *gfptr,  /* FITS file pointer to group                   */
	   int       rmopt,  /* code specifying if member
				elements are to be deleted:
				OPT_RM_GPT ==> remove only group table
				OPT_RM_ALL ==> recursively remove members
				and their members (if groups)                */
	   int      *status) /* return status code                           */
	    
/*
  remove a grouping table, and optionally all its members. Any groups 
  containing the grouping table are updated, and all members (if not 
  deleted) have their GRPIDn and GRPLCn keywords updated accordingly. 
  If the (deleted) members are members of another grouping table then those
  tables are also updated. The CHDU of the FITS file pointed to by gfptr must 
  be positioned to the grouping table to be deleted.
*/

{
  int hdutype;

  long i;
  long nmembers = 0;

  HDUtracker HDU;
  

  if(*status != 0) return(*status);

  /*
     remove the grouping table depending upon the rmopt parameter
  */

  switch(rmopt)
    {

    case OPT_RM_GPT:

      /*
	 for this option, the grouping table is deleted, but the member
	 HDUs remain; in this case we only have to remove each member from
	 the grouping table by calling fits_remove_member() with the
	 OPT_RM_ENTRY option
      */

      /* get the number of members contained by this table */

      *status = fits_get_num_members(gfptr,&nmembers,status);

      /* loop over all grouping table members and remove them */

      for(i = nmembers; i > 0 && *status == 0; --i)
	*status = fits_remove_member(gfptr,i,OPT_RM_ENTRY,status);
      
	break;

    case OPT_RM_ALL:

      /*
	for this option the entire Group is deleted -- this includes all
	members and their members (if grouping tables themselves). Call 
	the recursive form of this function to perform the removal.
      */

      /* add the current grouping table to the HDUtracker struct */

      HDU.nHDU = 0;

      *status = fftsad(gfptr,&HDU,NULL,NULL);

      /* call the recursive group remove function */

      *status = ffgtrmr(gfptr,&HDU,status);

      /* free the memory allocated to the HDUtracker struct */

      for(i = 0; i < HDU.nHDU; ++i)
	{
	  free(HDU.filename[i]);
	  free(HDU.newFilename[i]);
	}

      break;

    default:
      
      *status = BAD_OPTION;
      ffpmsg("Invalid value for the rmopt parameter specified (ffgtrm)");
      break;

     }

  /*
     if all went well then unlink and delete the grouping table HDU
  */

  *status = ffgmul(gfptr,0,status);

  *status = fits_delete_hdu(gfptr,&hdutype,status);
      
  return(*status);
}

/*---------------------------------------------------------------------------*/
int ffgtcp(fitsfile *infptr,  /* input FITS file pointer                     */
	   fitsfile *outfptr, /* output FITS file pointer                    */
	   int        cpopt,  /* code specifying copy options:
				OPT_GCP_GPT (0) ==> copy only grouping table
				OPT_GCP_ALL (2) ==> recusrively copy members 
				                    and their members (if 
						    groups)                  */
	   int      *status)  /* return status code                          */

/*
  copy a grouping table, and optionally all its members, to a new FITS file.
  If the cpopt is set to OPT_GCP_GPT (copy grouping table only) then the 
  existing members have their GRPIDn and GRPLCn keywords updated to reflect 
  the existance of the new group, since they now belong to another group. If 
  cpopt is set to OPT_GCP_ALL (copy grouping table and members recursively) 
  then the original members are not updated; the new grouping table is 
  modified to include only the copied member HDUs and not the original members.

  Note that the recursive version of this function, ffgtcpr(), is called
  to perform the group table copy. In the case of cpopt == OPT_GCP_GPT
  ffgtcpr() does not actually use recursion.
*/

{
  int i;

  HDUtracker HDU;


  if(*status != 0) return(*status);

  /* make sure infptr and outfptr are not the same pointer */

  if(infptr == outfptr) *status = IDENTICAL_POINTERS;
  else
    {

      /* initialize the HDUtracker struct */
      
      HDU.nHDU = 0;
      
      *status = fftsad(infptr,&HDU,NULL,NULL);
      
      /* 
	 call the recursive form of this function to copy the grouping table. 
	 If the cpopt is OPT_GCP_GPT then there is actually no recursion
	 performed
      */

      *status = ffgtcpr(infptr,outfptr,cpopt,&HDU,status);
  
      /* free memory allocated for the HDUtracker struct */

      for(i = 0; i < HDU.nHDU; ++i) 
	{
	  free(HDU.filename[i]);
	  free(HDU.newFilename[i]);
	}
    }

  return(*status);
}

/*---------------------------------------------------------------------------*/
int ffgtmg(fitsfile *infptr,  /* FITS file ptr to source grouping table      */
	   fitsfile *outfptr, /* FITS file ptr to target grouping table      */
	   int       mgopt,   /* code specifying merge options:
				 OPT_MRG_COPY (0) ==> copy members to target
				                      group, leaving source 
						      group in place
				 OPT_MRG_MOV  (1) ==> move members to target
				                      group, source group is
						      deleted after merge    */
	   int      *status)   /* return status code                         */
     

/*
  merge two grouping tables by combining their members into a single table. 
  The source grouping table must be the CHDU of the fitsfile pointed to by 
  infptr, and the target grouping table must be the CHDU of the fitsfile to by 
  outfptr. All members of the source grouping table shall be copied to the
  target grouping table. If the mgopt parameter is OPT_MRG_COPY then the source
  grouping table continues to exist after the merge. If the mgopt parameter
  is OPT_MRG_MOV then the source grouping table is deleted after the merge, 
  and all member HDUs are updated accordingly.
*/
{
  long i ;
  long nmembers = 0;

  fitsfile *tmpfptr = NULL;


  if(*status != 0) return(*status);

  do
    {

      *status = fits_get_num_members(infptr,&nmembers,status);

      for(i = 1; i <= nmembers && *status == 0; ++i)
	{
	  *status = fits_open_member(infptr,i,&tmpfptr,status);
	  *status = fits_add_group_member(outfptr,tmpfptr,0,status);

	  if(*status == HDU_ALREADY_MEMBER) *status = 0;

	  if(tmpfptr != NULL)
	    {
	      fits_close_file(tmpfptr,status);
	      tmpfptr = NULL;
	    }
	}

      if(*status != 0) continue;

      if(mgopt == OPT_MRG_MOV) 
	*status = fits_remove_group(infptr,OPT_RM_GPT,status);

    }while(0);

  if(tmpfptr != NULL)
    {
      fits_close_file(tmpfptr,status);
    }

  return(*status);
}

/*---------------------------------------------------------------------------*/
int ffgtcm(fitsfile *gfptr,  /* FITS file pointer to grouping table          */
	   int       cmopt,  /* code specifying compact options
				OPT_CMT_MBR      (1) ==> compact only direct 
			                                 members (if groups)
				OPT_CMT_MBR_DEL (11) ==> (1) + delete all 
				                         compacted groups    */
	   int      *status) /* return status code                           */
    
/*
  "Compact" a group pointed to by the FITS file pointer gfptr. This 
  is achieved by flattening the tree structure of a group and its 
  (grouping table) members. All members HDUs of a grouping table which is 
  itself a member of the grouping table gfptr are added to gfptr. Optionally,
  the grouping tables which are "compacted" are deleted. If the grouping 
  table contains no members that are themselves grouping tables then this 
  function performs a NOOP.
*/

{
  long i;
  long nmembers = 0;

  char keyvalue[FLEN_VALUE];
  char comment[FLEN_COMMENT];

  fitsfile *mfptr = NULL;


  if(*status != 0) return(*status);

  do
    {
      if(cmopt != OPT_CMT_MBR && cmopt != OPT_CMT_MBR_DEL)
	{
	  *status = BAD_OPTION;
	  ffpmsg("Invalid value for cmopt parameter specified (ffgtcm)");
	  continue;
	}

      /* reteive the number of grouping table members */

      *status = fits_get_num_members(gfptr,&nmembers,status);

      /*
	loop over all the grouping table members; if the member is a 
	grouping table then merge its members with the parent grouping 
	table 
      */

      for(i = 1; i <= nmembers && *status == 0; ++i)
	{
	  *status = fits_open_member(gfptr,i,&mfptr,status);

	  if(*status != 0) continue;

	  *status = fits_read_key_str(mfptr,"EXTNAME",keyvalue,comment,status);

	  /* if no EXTNAME keyword then cannot be a grouping table */

	  if(*status == KEY_NO_EXIST) 
	    {
	      *status = 0;
	      continue;
	    }
	  prepare_keyvalue(keyvalue);

	  if(*status != 0) continue;

	  /* if EXTNAME == "GROUPING" then process member as grouping table */

	  if(fits_strcasecmp(keyvalue,"GROUPING") == 0)
	    {
	      /* merge the member (grouping table) into the grouping table */

	      *status = fits_merge_groups(mfptr,gfptr,OPT_MRG_COPY,status);

	      *status = fits_close_file(mfptr,status);
	      mfptr = NULL;

	      /* 
		 remove the member from the grouping table now that all of
		 its members have been transferred; if cmopt is set to
		 OPT_CMT_MBR_DEL then remove and delete the member
	      */

	      if(cmopt == OPT_CMT_MBR)
		*status = fits_remove_member(gfptr,i,OPT_RM_ENTRY,status);
	      else
		*status = fits_remove_member(gfptr,i,OPT_RM_MBR,status);
	    }
	  else
	    {
	      /* not a grouping table; just close the opened member */

	      *status = fits_close_file(mfptr,status);
	      mfptr = NULL;
	    }
	}

    }while(0);

  return(*status);
}

/*--------------------------------------------------------------------------*/
int ffgtvf(fitsfile *gfptr,       /* FITS file pointer to group             */
	   long     *firstfailed, /* Member ID (if positive) of first failed
				     member HDU verify check or GRPID index
				     (if negitive) of first failed group
				     link verify check.                     */
	   int      *status)      /* return status code                     */

/*
 check the integrity of a grouping table to make sure that all group members 
 are accessible and all the links to other grouping tables are valid. The
 firstfailed parameter returns the member ID of the first member HDU to fail
 verification if positive or the first group link to fail if negative; 
 otherwise firstfailed contains a return value of 0.
*/

{
  long i;
  long nmembers = 0;
  long ngroups  = 0;

  char errstr[FLEN_VALUE];

  fitsfile *fptr = NULL;


  if(*status != 0) return(*status);

  *firstfailed = 0;

  do
    {
      /*
	attempt to open all the members of the grouping table. We stop
	at the first member which cannot be opened (which implies that it
	cannot be located)
      */

      *status = fits_get_num_members(gfptr,&nmembers,status);

      for(i = 1; i <= nmembers && *status == 0; ++i)
	{
	  *status = fits_open_member(gfptr,i,&fptr,status);
	  fits_close_file(fptr,status);
	}

      /*
	if the status is non-zero from the above loop then record the
	member index that caused the error
      */

      if(*status != 0)
	{
	  *firstfailed = i;
	  snprintf(errstr,FLEN_VALUE,"Group table verify failed for member %ld (ffgtvf)",
		  i);
	  ffpmsg(errstr);
	  continue;
	}

      /*
	attempt to open all the groups linked to this grouping table. We stop
	at the first group which cannot be opened (which implies that it
	cannot be located)
      */

      *status = fits_get_num_groups(gfptr,&ngroups,status);

      for(i = 1; i <= ngroups && *status == 0; ++i)
	{
	  *status = fits_open_group(gfptr,i,&fptr,status);
	  fits_close_file(fptr,status);
	}

      /*
	if the status from the above loop is non-zero, then record the
	GRPIDn index of the group that caused the failure
      */

      if(*status != 0)
	{
	  *firstfailed = -1*i;
	  snprintf(errstr,FLEN_VALUE,
		  "Group table verify failed for GRPID index %ld (ffgtvf)",i);
	  ffpmsg(errstr);
	  continue;
	}

    }while(0);

  return(*status);
}

/*---------------------------------------------------------------------------*/
int ffgtop(fitsfile *mfptr,  /* FITS file pointer to the member HDU          */
	   int       grpid,  /* group ID (GRPIDn index) within member HDU    */
	   fitsfile **gfptr, /* FITS file pointer to grouping table HDU      */
	   int      *status) /* return status code                           */

/*
  open the grouping table that contains the member HDU. The member HDU must
  be the CHDU of the FITS file pointed to by mfptr, and the grouping table
  is identified by the Nth index number of the GRPIDn keywords specified in 
  the member HDU's header. The fitsfile gfptr pointer is positioned with the
  appropriate FITS file with the grouping table as the CHDU. If the group
  grouping table resides in a file other than the member then an attempt
  is first made to open the file readwrite, and failing that readonly.
 
  Note that it is possible for the GRPIDn/GRPLCn keywords in a member 
  header to be non-continuous, e.g., GRPID1, GRPID2, GRPID5, GRPID6. In 
  such cases, the grpid index value specified in the function call shall
  identify the (grpid)th GRPID value. In the above example, if grpid == 3,
  then the group specified by GRPID5 would be opened.
*/
{
  int i;
  int found;

  long ngroups   = 0;
  long grpExtver = 0;

  char keyword[FLEN_KEYWORD];
  char keyvalue[FLEN_FILENAME];
  char *tkeyvalue;
  char location[FLEN_FILENAME];
  char location1[FLEN_FILENAME];
  char location2[FLEN_FILENAME];
  char comment[FLEN_COMMENT];

  char *url[2];


  if(*status != 0) return(*status);

  do
    {
      /* set the grouping table pointer to NULL for error checking later */

      *gfptr = NULL;

      /*
	make sure that the group ID requested is valid ==> cannot be
	larger than the number of GRPIDn keywords in the member HDU header
      */

      *status = fits_get_num_groups(mfptr,&ngroups,status);

      if(grpid > ngroups)
	{
	  *status = BAD_GROUP_ID;
	  snprintf(comment,FLEN_COMMENT,
		  "GRPID index %d larger total GRPID keywords %ld (ffgtop)",
		  grpid,ngroups);
	  ffpmsg(comment);
	  continue;
	}

      /*
	find the (grpid)th group that the member HDU belongs to and read
	the value of the GRPID(grpid) keyword; fits_get_num_groups()
	automatically re-enumerates the GRPIDn/GRPLCn keywords to fill in
	any gaps
      */

      snprintf(keyword,FLEN_KEYWORD,"GRPID%d",grpid);

      *status = fits_read_key_lng(mfptr,keyword,&grpExtver,comment,status);

      if(*status != 0) continue;

      /*
	if the value of the GRPIDn keyword is positive then the member is
	in the same FITS file as the grouping table and we only have to
	reopen the current FITS file. Else the member and grouping table
	HDUs reside in different files and another FITS file must be opened
	as specified by the corresponding GRPLCn keyword
	
	The DO WHILE loop only executes once and is used to control the
	file opening logic.
      */

      do
	{
	  if(grpExtver > 0) 
	    {
	      /*
		the member resides in the same file as the grouping
		 table, so just reopen the grouping table file
	      */

	      *status = fits_reopen_file(mfptr,gfptr,status);
	      continue;
	    }

	  else if(grpExtver == 0)
	    {
	      /* a GRPIDn value of zero (0) is undefined */

	      *status = BAD_GROUP_ID;
	      snprintf(comment,FLEN_COMMENT,"Invalid value of %ld for GRPID%d (ffgtop)",
		      grpExtver,grpid);
	      ffpmsg(comment);
	      continue;
	    }

	  /* 
	     The GRPLCn keyword value is negative, which implies that
	     the grouping table must reside in another FITS file;
	     search for the corresponding GRPLCn keyword 
	  */
	  
	  /* set the grpExtver value positive */
  
	  grpExtver = -1*grpExtver;

	  /* read the GRPLCn keyword value */

	  snprintf(keyword,FLEN_KEYWORD,"GRPLC%d",grpid);
	  /* SPR 1738 */
	  *status = fits_read_key_longstr(mfptr,keyword,&tkeyvalue,comment,
				      status);
	  if (0 == *status) {
	    strcpy(keyvalue,tkeyvalue);
	    free(tkeyvalue);
	  }
	  

	  /* if the GRPLCn keyword was not found then there is a problem */

	  if(*status == KEY_NO_EXIST)
	    {
	      *status = BAD_GROUP_ID;

	      snprintf(comment,FLEN_COMMENT,"Cannot find GRPLC%d keyword (ffgtop)",
		      grpid);
	      ffpmsg(comment);

	      continue;
	    }

	  prepare_keyvalue(keyvalue);

	  /*
	    if the GRPLCn keyword value specifies an absolute URL then
	    try to open the file; we cannot attempt any relative URL
	    or host-dependent file path reconstruction
	  */

	  if(fits_is_url_absolute(keyvalue))
	    {
	      ffpmsg("Try to open group table file as absolute URL (ffgtop)");

	      *status = fits_open_file(gfptr,keyvalue,READWRITE,status);

	      /* if the open was successful then continue */

	      if(*status == 0) continue;

	      /* if READWRITE failed then try opening it READONLY */

	      ffpmsg("OK, try open group table file as READONLY (ffgtop)");
	      
	      *status = 0;
	      *status = fits_open_file(gfptr,keyvalue,READONLY,status);

	      /* continue regardless of the outcome */

	      continue;
	    }

	  /*
	    see if the URL gives a file path that is absolute on the
	    host machine 
	  */

	  *status = fits_url2path(keyvalue,location1,status);

	  *status = fits_open_file(gfptr,location1,READWRITE,status);

	  /* if the file opened then continue */

	  if(*status == 0) continue;

	  /* if READWRITE failed then try opening it READONLY */

	  ffpmsg("OK, try open group table file as READONLY (ffgtop)");
	  
	  *status = 0;
	  *status = fits_open_file(gfptr,location1,READONLY,status);

	  /* if the file opened then continue */

	  if(*status == 0) continue;

	  /*
	    the grouping table location given by GRPLCn must specify a 
	    relative URL. We assume that this URL is relative to the 
	    member HDU's FITS file. Try to construct a full URL location 
	    for the grouping table's FITS file and then open it
	  */

	  *status = 0;
		  
	  /* retrieve the URL information for the member HDU's file */
		  
	  url[0] = location1; url[1] = location2;
		  
	  *status = fits_get_url(mfptr,url[0],url[1],NULL,NULL,NULL,status);

	  /*
	    It is possible that the member HDU file has an initial
	    URL it was opened with and a real URL that the file actually
	    exists at (e.g., an HTTP accessed file copied to a local
	    file). For each possible URL try to construct a
	  */
		  
	  for(i = 0, found = 0, *gfptr = NULL; i < 2 && !found; ++i)
	    {
	      
	      /* the url string could be empty */
	      
	      if(*url[i] == 0) continue;
	      
	      /* 
		 create a full URL from the partial and the member
		 HDU file URL
	      */
	      
	      *status = fits_relurl2url(url[i],keyvalue,location,status);
	      
	      /* if an error occured then contniue */
	      
	      if(*status != 0) 
		{
		  *status = 0;
		  continue;
		}
	      
	      /*
		if the location does not specify an access method
		then turn it into a host dependent path
	      */

	      if(! fits_is_url_absolute(location))
		{
		  *status = fits_url2path(location,url[i],status);
		  strcpy(location,url[i]);
		}
	      
	      /* try to open the grouping table file READWRITE */
	      
	      *status = fits_open_file(gfptr,location,READWRITE,status);
	      
	      if(*status != 0)
		{    
		  /* try to open the grouping table file READONLY */
		  
		  ffpmsg("opening file as READWRITE failed (ffgtop)");
		  ffpmsg("OK, try to open file as READONLY (ffgtop)");
		  *status = 0;
		  *status = fits_open_file(gfptr,location,READONLY,status);
		}
	      
	      /* either set the found flag or reset the status flag */
	      
	      if(*status == 0) 
		found = 1;
	      else
		*status = 0;
	    }

	}while(0); /* end of file opening loop */

      /* if an error occured with the file opening then exit */

      if(*status != 0) continue;
  
      if(*gfptr == NULL)
	{
	  ffpmsg("Cannot open or find grouping table FITS file (ffgtop)");
	  *status = GROUP_NOT_FOUND;
	  continue;
	}

      /* search for the grouping table in its FITS file */

      *status = fits_movnam_hdu(*gfptr,ANY_HDU,"GROUPING",(int)grpExtver,
				status);

      if(*status != 0) *status = GROUP_NOT_FOUND;

    }while(0);

  if(*status != 0 && *gfptr != NULL) 
    {
      fits_close_file(*gfptr,status);
      *gfptr = NULL;
    }

  return(*status);
}
/*---------------------------------------------------------------------------*/
int ffgtam(fitsfile *gfptr,   /* FITS file pointer to grouping table HDU     */
	   fitsfile *mfptr,   /* FITS file pointer to member HDU             */
	   int       hdupos,  /* member HDU position IF in the same file as
			         the grouping table AND mfptr == NULL        */
	   int      *status)  /* return status code                          */
 
/*
  add a member HDU to an existing grouping table. The fitsfile pointer gfptr
  must be positioned with the grouping table as the CHDU. The member HDU
  may either be identifed with the fitsfile *mfptr (which must be positioned
  to the member HDU) or the hdupos parameter (the HDU number of the member 
  HDU) if both reside in the same FITS file. The hdupos value is only used
  if the mfptr parameter has a value of NULL (0). The new member HDU shall 
  have the appropriate GRPIDn and GRPLCn keywords created in its header.

  Note that if the member HDU to be added to the grouping table is already
  a member of the group then it will not be added a sceond time.
*/

{
  int xtensionCol,extnameCol,extverCol,positionCol,locationCol,uriCol;
  int memberPosition = 0;
  int grptype        = 0;
  int hdutype        = 0;
  int useLocation    = 0;
  int nkeys          = 6;
  int found;
  int i;

  int memberIOstate;
  int groupIOstate;
  int iomode;

  long memberExtver = 0;
  long groupExtver  = 0;
  long memberID     = 0;
  long nmembers     = 0;
  long ngroups      = 0;
  long grpid        = 0;

  char memberAccess1[FLEN_VALUE];
  char memberAccess2[FLEN_VALUE];
  char memberFileName[FLEN_FILENAME];
  char memberLocation[FLEN_FILENAME];
  char grplc[FLEN_FILENAME];
  char *tgrplc;
  char memberHDUtype[FLEN_VALUE];
  char memberExtname[FLEN_VALUE];
  char memberURI[] = "URL";

  char groupAccess1[FLEN_VALUE];
  char groupAccess2[FLEN_VALUE];
  char groupFileName[FLEN_FILENAME];
  char groupLocation[FLEN_FILENAME];
  char tmprootname[FLEN_FILENAME], grootname[FLEN_FILENAME];
  char cwd[FLEN_FILENAME];

  char *keys[] = {"GRPNAME","EXTVER","EXTNAME","TFIELDS","GCOUNT","EXTEND"};
  char *tmpPtr[1];

  char keyword[FLEN_KEYWORD];
  char card[FLEN_CARD];

  unsigned char charNull[]  = {'\0'};

  fitsfile *tmpfptr = NULL;

  int parentStatus = 0;

  if(*status != 0) return(*status);

  do
    {
      /*
	make sure the grouping table can be modified before proceeding
      */

      fits_file_mode(gfptr,&iomode,status);

      if(iomode != READWRITE)
	{
	  ffpmsg("cannot modify grouping table (ffgtam)");
	  *status = BAD_GROUP_ATTACH;
	  continue;
	}

      /*
	 if the calling function supplied the HDU position of the member
	 HDU instead of fitsfile pointer then get a fitsfile pointer
      */

      if(mfptr == NULL)
	{
	  *status = fits_reopen_file(gfptr,&tmpfptr,status);
	  *status = fits_movabs_hdu(tmpfptr,hdupos,&hdutype,status);

	  if(*status != 0) continue;
	}
      else
	tmpfptr = mfptr;

      /*
	 determine all the information about the member HDU that will
	 be needed later; note that we establish the default values for
	 all information values that are not explicitly found
      */

      *status = fits_read_key_str(tmpfptr,"XTENSION",memberHDUtype,card,
				  status);

      if(*status == KEY_NO_EXIST) 
	{
	  strcpy(memberHDUtype,"PRIMARY");
	  *status = 0;
	}
      prepare_keyvalue(memberHDUtype);

      *status = fits_read_key_lng(tmpfptr,"EXTVER",&memberExtver,card,status);

      if(*status == KEY_NO_EXIST) 
	{
	  memberExtver = 1;
	  *status      = 0;
	}

      *status = fits_read_key_str(tmpfptr,"EXTNAME",memberExtname,card,
				  status);

      if(*status == KEY_NO_EXIST) 
	{
	  memberExtname[0] = 0;
	  *status          = 0;
	}
      prepare_keyvalue(memberExtname);

      fits_get_hdu_num(tmpfptr,&memberPosition);

      /*
	Determine if the member HDU's FITS file location needs to be
	taken into account when building its grouping table reference

	If the member location needs to be used (==> grouping table and member
	HDU reside in different files) then create an appropriate URL for
	the member HDU's file and grouping table's file. Note that the logic
	for this is rather complicated
      */

      /* SPR 3463, don't do this 
	 if(tmpfptr->Fptr == gfptr->Fptr)
	 {  */
	  /*
	    member HDU and grouping table reside in the same file, no need
	    to use the location information */
	  
      /* printf ("same file\n");
	   
	   useLocation     = 0;
	   memberIOstate   = 1;
	   *memberFileName = 0;
	}
      else
      { */ 
	  /*
	     the member HDU and grouping table FITS file location information 
	     must be used.

	     First determine the correct driver and file name for the group
	     table and member HDU files. If either are disk files then
	     construct an absolute file path for them. Finally, if both are
	     disk files construct relative file paths from the group(member)
	     file to the member(group) file.

	  */

	  /* set the USELOCATION flag to true */

	  useLocation = 1;

	  /* 
	     get the location, access type and iostate (RO, RW) of the
	     member HDU file
	  */

	  *status = fits_get_url(tmpfptr,memberFileName,memberLocation,
				 memberAccess1,memberAccess2,&memberIOstate,
				 status);

	  /*
	     if the memberFileName string is empty then use the values of
	     the memberLocation string. This corresponds to a file where
	     the "real" file is a temporary memory file, and we must assume
	     the the application really wants the original file to be the
	     group member
	   */

	  if(strlen(memberFileName) == 0)
	    {
	      strcpy(memberFileName,memberLocation);
	      strcpy(memberAccess1,memberAccess2);
	    }

	  /* 
	     get the location, access type and iostate (RO, RW) of the
	     grouping table file
	  */

	  *status = fits_get_url(gfptr,groupFileName,groupLocation,
				 groupAccess1,groupAccess2,&groupIOstate,
				 status);
	  
	  if(*status != 0) continue;

	  /*
	    the grouping table file must be writable to continue
	  */

	  if(groupIOstate == 0)
	    {
	      ffpmsg("cannot modify grouping table (ffgtam)");
	      *status = BAD_GROUP_ATTACH;
	      continue;
	    }

	  /*
	    determine how to construct the resulting URLs for the member and
	    group files
	  */

	  if(fits_strcasecmp(groupAccess1,"file://")  &&
	                                   fits_strcasecmp(memberAccess1,"file://"))
	    {
              *cwd = 0;
	      /* 
		 nothing to do in this case; both the member and group files
		 must be of an access type that already gives valid URLs;
		 i.e., URLs that we can pass directly to the file drivers
	      */
	    }
	  else
	    {
	      /*
		 retrieve the Current Working Directory as a Unix-like
		 URL standard string
	      */

	      *status = fits_get_cwd(cwd,status);

	      /*
		 create full file path for the member HDU FITS file URL
		 if it is of access type file://
	      */
	      
	      if(fits_strcasecmp(memberAccess1,"file://") == 0)
		{
		  if(*memberFileName == '/')
		    {
		      strcpy(memberLocation,memberFileName);
		    }
		  else
		    {
		      strcpy(memberLocation,cwd);
                      if (strlen(memberLocation)+strlen(memberFileName)+1 > 
                                FLEN_FILENAME-1)
                      {
                         ffpmsg("member path and filename is too long (ffgtam)");
                         *status = URL_PARSE_ERROR;
                         continue;
                      }
		      strcat(memberLocation,"/");
		      strcat(memberLocation,memberFileName);
		    }
		  
		  *status = fits_clean_url(memberLocation,memberFileName,
					   status);
		}

	      /*
		 create full file path for the grouping table HDU FITS file URL
		 if it is of access type file://
	      */

	      if(fits_strcasecmp(groupAccess1,"file://") == 0)
		{
		  if(*groupFileName == '/')
		    {
		      strcpy(groupLocation,groupFileName);
		    }
		  else
		    {
		      strcpy(groupLocation,cwd);
                      if (strlen(groupLocation)+strlen(groupFileName)+1 > 
                                FLEN_FILENAME-1)
                      {
                         ffpmsg("group path and filename is too long (ffgtam)");
                         *status = URL_PARSE_ERROR;
                         continue;
                      }
                      
		      strcat(groupLocation,"/");
		      strcat(groupLocation,groupFileName);
		    }
		  
		  *status = fits_clean_url(groupLocation,groupFileName,status);
		}

	      /*
		if both the member and group files are disk files then 
		create a relative path (relative URL) strings with 
		respect to the grouping table's file and the grouping table's 
		file with respect to the member HDU's file
	      */
	      
	      if(fits_strcasecmp(groupAccess1,"file://") == 0 &&
		                      fits_strcasecmp(memberAccess1,"file://") == 0)
		{
		  fits_url2relurl(memberFileName,groupFileName,
				                  groupLocation,status);
		  fits_url2relurl(groupFileName,memberFileName,
				                  memberLocation,status);

		  /*
		     copy the resulting partial URL strings to the
		     memberFileName and groupFileName variables for latter
		     use in the function
		   */
		    
		  strcpy(memberFileName,memberLocation);
		  strcpy(groupFileName,groupLocation);		  
		}
	    }
	  /* beo done */
	  /* }  */
      

      /* retrieve the grouping table's EXTVER value */

      *status = fits_read_key_lng(gfptr,"EXTVER",&groupExtver,card,status);

      /* 
	 if useLocation is true then make the group EXTVER value negative
	 for the subsequent GRPIDn/GRPLCn matching
      */
      /* SPR 3463 change test;  WDP added test for same filename */
      /* Now, if either the Fptr values are the same, or the root filenames
         are the same, then assume these refer to the same file.
      */
      fits_parse_rootname(tmpfptr->Fptr->filename, tmprootname, status);
      fits_parse_rootname(gfptr->Fptr->filename, grootname, status);

      if((tmpfptr->Fptr != gfptr->Fptr) && 
          strncmp(tmprootname, grootname, FLEN_FILENAME))
	   groupExtver = -1*groupExtver;

      /* retrieve the number of group members */

      *status = fits_get_num_members(gfptr,&nmembers,status);
	      
    do {

      /*
	 make sure the member HDU is not already an entry in the
	 grouping table before adding it
      */

      *status = ffgmf(gfptr,memberHDUtype,memberExtname,memberExtver,
		      memberPosition,memberFileName,&memberID,status);

      if(*status == MEMBER_NOT_FOUND) *status = 0;
      else if(*status == 0)
	{  
	  parentStatus = HDU_ALREADY_MEMBER;
    ffpmsg("Specified HDU is already a member of the Grouping table (ffgtam)");
	  continue;
	}
      else continue;

      /*
	 if the member HDU is not already recorded in the grouping table
	 then add it 
      */

      /* add a new row to the grouping table */

      *status = fits_insert_rows(gfptr,nmembers,1,status);
      ++nmembers;

      /* retrieve the grouping table column IDs and structure type */

      *status = ffgtgc(gfptr,&xtensionCol,&extnameCol,&extverCol,&positionCol,
		       &locationCol,&uriCol,&grptype,status);

      /* fill in the member HDU data in the new grouping table row */

      *tmpPtr = memberHDUtype; 

      if(xtensionCol != 0)
	fits_write_col_str(gfptr,xtensionCol,nmembers,1,1,tmpPtr,status);

      *tmpPtr = memberExtname; 

      if(extnameCol  != 0)
	{
	  if(strlen(memberExtname) != 0)
	    fits_write_col_str(gfptr,extnameCol,nmembers,1,1,tmpPtr,status);
	  else
	    /* WILL THIS WORK FOR VAR LENTH CHAR COLS??????*/
	    fits_write_col_byt(gfptr,extnameCol,nmembers,1,1,charNull,status);
	}

      if(extverCol   != 0)
	fits_write_col_lng(gfptr,extverCol,nmembers,1,1,&memberExtver,
			   status);

      if(positionCol != 0)
	fits_write_col_int(gfptr,positionCol,nmembers,1,1,
			   &memberPosition,status);

      *tmpPtr = memberFileName; 

      if(locationCol != 0)
	{
	  /* Change the test for SPR 3463 */
	  /* Now, if either the Fptr values are the same, or the root filenames
	     are the same, then assume these refer to the same file.
	  */
	  fits_parse_rootname(tmpfptr->Fptr->filename, tmprootname, status);
	  fits_parse_rootname(gfptr->Fptr->filename, grootname, status);

	  if((tmpfptr->Fptr != gfptr->Fptr) && 
	          strncmp(tmprootname, grootname, FLEN_FILENAME))
	    fits_write_col_str(gfptr,locationCol,nmembers,1,1,tmpPtr,status);
	  else
	    /* WILL THIS WORK FOR VAR LENTH CHAR COLS??????*/
	    fits_write_col_byt(gfptr,locationCol,nmembers,1,1,charNull,status);
	}

      *tmpPtr = memberURI;

      if(uriCol      != 0)
	{

	  /* Change the test for SPR 3463 */
	  /* Now, if either the Fptr values are the same, or the root filenames
	     are the same, then assume these refer to the same file.
	  */
	  fits_parse_rootname(tmpfptr->Fptr->filename, tmprootname, status);
	  fits_parse_rootname(gfptr->Fptr->filename, grootname, status);

	  if((tmpfptr->Fptr != gfptr->Fptr) && 
	          strncmp(tmprootname, grootname, FLEN_FILENAME))
	    fits_write_col_str(gfptr,uriCol,nmembers,1,1,tmpPtr,status);
	  else
	    /* WILL THIS WORK FOR VAR LENTH CHAR COLS??????*/
	    fits_write_col_byt(gfptr,uriCol,nmembers,1,1,charNull,status);
	}
    } while(0);

      if(0 != *status) continue;
      /*
	 add GRPIDn/GRPLCn keywords to the member HDU header to link
	 it to the grouing table if the they do not already exist and
	 the member file is RW
      */

      fits_file_mode(tmpfptr,&iomode,status);
 
     if(memberIOstate == 0 || iomode != READWRITE) 
	{
	  ffpmsg("cannot add GRPID/LC keywords to member HDU: (ffgtam)");
	  ffpmsg(memberFileName);
	  continue;
	}

      *status = fits_get_num_groups(tmpfptr,&ngroups,status);

      /* 
	 look for the GRPID/LC keywords in the member HDU; if the keywords
	 for the back-link to the grouping table already exist then no
	 need to add them again
       */

      for(i = 1, found = 0; i <= ngroups && !found && *status == 0; ++i)
	{
	  snprintf(keyword,FLEN_KEYWORD,"GRPID%d",(int)ngroups);
	  *status = fits_read_key_lng(tmpfptr,keyword,&grpid,card,status);

	  if(grpid == groupExtver)
	    {
	      if(grpid < 0)
		{

		  /* have to make sure the GRPLCn keyword matches too */

		  snprintf(keyword,FLEN_KEYWORD,"GRPLC%d",(int)ngroups);
		  /* SPR 1738 */
		  *status = fits_read_key_longstr(mfptr,keyword,&tgrplc,card,
						  status);
		  if (0 == *status) {
		    strcpy(grplc,tgrplc);
		    free(tgrplc);
		  }
		  
		  /*
		     always compare files using absolute paths
                     the presence of a non-empty cwd indicates
                     that the file names may require conversion
                     to absolute paths
                  */

                  if(0 < strlen(cwd)) {
                    /* temp buffer for use in assembling abs. path(s) */
                    char tmp[FLEN_FILENAME];

                    /* make grplc absolute if necessary */
                    if(!fits_is_url_absolute(grplc)) {
		      fits_path2url(grplc,FLEN_FILENAME,groupLocation,status);

		      if(groupLocation[0] != '/')
			{
			  strcpy(tmp, cwd);
                          if (strlen(tmp)+strlen(groupLocation)+1 > 
                                    FLEN_FILENAME-1)
                          {
                             ffpmsg("path and group location is too long (ffgtam)");
                             *status = URL_PARSE_ERROR;
                             continue;
                          }
			  strcat(tmp,"/");
			  strcat(tmp,groupLocation);
			  fits_clean_url(tmp,grplc,status);
			}
                    }

                    /* make groupFileName absolute if necessary */
                    if(!fits_is_url_absolute(groupFileName)) {
		      fits_path2url(groupFileName,FLEN_FILENAME,groupLocation,status);

		      if(groupLocation[0] != '/')
			{
			  strcpy(tmp, cwd);
                          if (strlen(tmp)+strlen(groupLocation)+1 > 
                                    FLEN_FILENAME-1)
                          {
                             ffpmsg("path and group location is too long (ffgtam)");
                             *status = URL_PARSE_ERROR;
                             continue;
                          }
			  strcat(tmp,"/");
			  strcat(tmp,groupLocation);
                          /*
                             note: use groupLocation (which is not used
                             below this block), to store the absolute
                             file name instead of using groupFileName.
                             The latter may be needed unaltered if the
                             GRPLC is written below
                          */

			  fits_clean_url(tmp,groupLocation,status);
			}
                    }
                  }
		  /*
		    see if the grplc value and the group file name match
		  */

		  if(strcmp(grplc,groupLocation) == 0) found = 1;
		}
	      else
		{
		  /* the match is found with GRPIDn alone */
		  found = 1;
		}
	    }
	}

      /*
	 if FOUND is true then no need to continue
      */

      if(found)
	{
	  ffpmsg("HDU already has GRPID/LC keywords for group table (ffgtam)");
	  continue;
	}

      /*
	 add the GRPID/LC keywords to the member header for this grouping
	 table
	 
	 If NGROUPS == 0 then we must position the header pointer to the
	 record where we want to insert the GRPID/LC keywords (the pointer
	 is already correctly positioned if the above search loop activiated)
      */

      if(ngroups == 0)
	{
	  /* 
	     no GRPIDn/GRPLCn keywords currently exist in header so try
	     to position the header pointer to a desirable position
	  */
	  
	  for(i = 0, *status = KEY_NO_EXIST; 
	                       i < nkeys && *status == KEY_NO_EXIST; ++i)
	    {
	      *status = 0;
	      *status = fits_read_card(tmpfptr,keys[i],card,status);
	    }
	      
	  /* all else fails: move write pointer to end of header */
	      
	  if(*status == KEY_NO_EXIST)
	    {
	      *status = 0;
	      fits_get_hdrspace(tmpfptr,&nkeys,&i,status);
	      ffgrec(tmpfptr,nkeys,card,status);
	    }
	  
	  /* any other error status then abort */
	  
	  if(*status != 0) continue;
	}
      
      /* 
	 now that the header pointer is positioned for the GRPID/LC 
	 keyword insertion increment the number of group links counter for 
	 the member HDU 
      */

      ++ngroups;

      /*
	 if the member HDU and grouping table reside in the same FITS file
	 then there is no need to add a GRPLCn keyword
      */
      /* SPR 3463 change test */
      /* Now, if either the Fptr values are the same, or the root filenames
	 are the same, then assume these refer to the same file.
      */
      fits_parse_rootname(tmpfptr->Fptr->filename, tmprootname, status);
      fits_parse_rootname(gfptr->Fptr->filename, grootname, status);

      if((tmpfptr->Fptr == gfptr->Fptr) || 
	          strncmp(tmprootname, grootname, FLEN_FILENAME) == 0)
	{
	  /* add the GRPIDn keyword only */

	  snprintf(keyword,FLEN_KEYWORD,"GRPID%d",(int)ngroups);
	  fits_insert_key_lng(tmpfptr,keyword,groupExtver,
			      "EXTVER of Group containing this HDU",status);
	}
      else 
	{
	  /* add the GRPIDn and GRPLCn keywords */

	  snprintf(keyword,FLEN_KEYWORD,"GRPID%d",(int)ngroups);
	  fits_insert_key_lng(tmpfptr,keyword,groupExtver,
			      "EXTVER of Group containing this HDU",status);

	  snprintf(keyword,FLEN_KEYWORD,"GRPLC%d",(int)ngroups);
	  /* SPR 1738 */
	  fits_insert_key_longstr(tmpfptr,keyword,groupFileName,
			      "URL of file containing Group",status);
	  fits_write_key_longwarn(tmpfptr,status);

	}

    }while(0);

  /* close the tmpfptr pointer if it was opened in this function */

  if(mfptr == NULL)
    {
      *status = fits_close_file(tmpfptr,status);
    }

  *status = 0 == *status ? parentStatus : *status;

  return(*status);
}

/*---------------------------------------------------------------------------*/
int ffgtnm(fitsfile *gfptr,    /* FITS file pointer to grouping table        */
	   long     *nmembers, /* member count  of the groping table         */
	   int      *status)   /* return status code                         */

/*
  return the number of member HDUs in a grouping table. The fitsfile pointer
  gfptr must be positioned with the grouping table as the CHDU. The number
  of grouping table member HDUs is just the NAXIS2 value of the grouping
  table.
*/

{
  char keyvalue[FLEN_VALUE];
  char comment[FLEN_COMMENT];
  

  if(*status != 0) return(*status);

  *status = fits_read_keyword(gfptr,"EXTNAME",keyvalue,comment,status);
  
  if(*status == KEY_NO_EXIST)
    *status = NOT_GROUP_TABLE;
  else
    {
      prepare_keyvalue(keyvalue);

      if(fits_strcasecmp(keyvalue,"GROUPING") != 0)
	{
	  *status = NOT_GROUP_TABLE;
	  ffpmsg("Specified HDU is not a Grouping table (ffgtnm)");
	}

      *status = fits_read_key_lng(gfptr,"NAXIS2",nmembers,comment,status);
    }

  return(*status);
}

/*--------------------------------------------------------------------------*/
int ffgmng(fitsfile *mfptr,   /* FITS file pointer to member HDU            */
	   long     *ngroups, /* total number of groups linked to HDU       */
	   int      *status)  /* return status code                         */

/*
  return the number of groups to which a HDU belongs, as defined by the number
  of GRPIDn/GRPLCn keyword records that appear in the HDU header. The 
  fitsfile pointer mfptr must be positioned with the member HDU as the CHDU. 
  Each time this function is called, the indicies of the GRPIDn/GRPLCn
  keywords are checked to make sure they are continuous (ie no gaps) and
  are re-enumerated to eliminate gaps if gaps are found to be present.
*/

{
  int offset;
  int index;
  int newIndex;
  int i;
  
  long grpid;

  char *inclist[] = {"GRPID#"};
  char keyword[FLEN_KEYWORD];
  char newKeyword[FLEN_KEYWORD];
  char card[FLEN_CARD];
  char comment[FLEN_COMMENT];
  char *tkeyvalue;

  if(*status != 0) return(*status);

  *ngroups = 0;

  /* reset the member HDU keyword counter to the beginning */

  *status = ffgrec(mfptr,0,card,status);
  
  /*
    search for the number of GRPIDn keywords in the member HDU header
    and count them with the ngroups variable
  */
  
  while(*status == 0)
    {
      /* read the next GRPIDn keyword in the series */

      *status = fits_find_nextkey(mfptr,inclist,1,NULL,0,card,status);
      
      if(*status != 0) continue;
      
      ++(*ngroups);
    }

  if(*status == KEY_NO_EXIST) *status = 0;
      
  /*
     read each GRPIDn/GRPLCn keyword and adjust their index values so that
     there are no gaps in the index count
  */

  for(index = 1, offset = 0, i = 1; i <= *ngroups && *status == 0; ++index)
    {	  
      snprintf(keyword,FLEN_KEYWORD,"GRPID%d",index);

      /* try to read the next GRPIDn keyword in the series */

      *status = fits_read_key_lng(mfptr,keyword,&grpid,card,status);

      /* if not found then increment the offset counter and continue */

      if(*status == KEY_NO_EXIST) 
	{
	  *status = 0;
	  ++offset;
	}
      else
	{
	  /* 
	     increment the number_keys_found counter and see if the index
	     of the keyword needs to be updated
	  */

	  ++i;

	  if(offset > 0)
	    {
	      /* compute the new index for the GRPIDn/GRPLCn keywords */
	      newIndex = index - offset;

	      /* update the GRPIDn keyword index */

	      snprintf(newKeyword,FLEN_KEYWORD,"GRPID%d",newIndex);
	      fits_modify_name(mfptr,keyword,newKeyword,status);

	      /* If present, update the GRPLCn keyword index */

	      snprintf(keyword,FLEN_KEYWORD,"GRPLC%d",index);
	      snprintf(newKeyword,FLEN_KEYWORD,"GRPLC%d",newIndex);
	      /* SPR 1738 */
	      *status = fits_read_key_longstr(mfptr,keyword,&tkeyvalue,comment,
					      status);
	      if (0 == *status) {
		fits_delete_key(mfptr,keyword,status);
		fits_insert_key_longstr(mfptr,newKeyword,tkeyvalue,comment,status);
		fits_write_key_longwarn(mfptr,status);
		free(tkeyvalue);
	      }
	      

	      if(*status == KEY_NO_EXIST) *status = 0;
	    }
	}
    }

  return(*status);
}

/*---------------------------------------------------------------------------*/
int ffgmop(fitsfile *gfptr,  /* FITS file pointer to grouping table          */
	   long      member, /* member ID (row num) within grouping table    */
	   fitsfile **mfptr, /* FITS file pointer to member HDU              */
	   int      *status) /* return status code                           */

/*
  open a grouping table member, returning a pointer to the member's FITS file
  with the CHDU set to the member HDU. The grouping table must be the CHDU of
  the FITS file pointed to by gfptr. The member to open is identified by its
  row number within the grouping table (first row/member == 1).

  If the member resides in a FITS file different from the grouping
  table the member file is first opened readwrite and if this fails then
  it is opened readonly. For access type of FILE:// the member file is
  searched for assuming (1) an absolute path is given, (2) a path relative
  to the CWD is given, and (3) a path relative to the grouping table file
  but not relative to the CWD is given. If all of these fail then the
  error FILE_NOT_FOUND is returned.
*/

{
  int xtensionCol,extnameCol,extverCol,positionCol,locationCol,uriCol;
  int grptype,hdutype;
  int dummy;

  long hdupos = 0;
  long extver = 0;

  char  xtension[FLEN_VALUE];
  char  extname[FLEN_VALUE];
  char  uri[FLEN_VALUE];
  char  grpLocation1[FLEN_FILENAME];
  char  grpLocation2[FLEN_FILENAME];
  char  mbrLocation1[FLEN_FILENAME];
  char  mbrLocation2[FLEN_FILENAME];
  char  mbrLocation3[FLEN_FILENAME];
  char  cwd[FLEN_FILENAME];
  char  card[FLEN_CARD];
  char  nstr[] = {'\0'};
  char *tmpPtr[1];


  if(*status != 0) return(*status);

  do
    {
      /*
	retrieve the Grouping Convention reserved column positions within
	the grouping table
      */

      *status = ffgtgc(gfptr,&xtensionCol,&extnameCol,&extverCol,&positionCol,
		       &locationCol,&uriCol,&grptype,status);

      if(*status != 0) continue;
      
      /* verify the column formats */
      
      *status = ffvcfm(gfptr,xtensionCol,extnameCol,extverCol,positionCol,
		       locationCol,uriCol,status);

      if(*status != 0) continue;
      
      /*
	 extract the member information from grouping table
      */

      tmpPtr[0] = xtension;

      if(xtensionCol != 0)
	{

	  *status = fits_read_col_str(gfptr,xtensionCol,member,1,1,nstr,
				      tmpPtr,&dummy,status);

	  /* convert the xtension string to a hdutype code */

	  if(fits_strcasecmp(xtension,"PRIMARY")       == 0) hdutype = IMAGE_HDU; 
	  else if(fits_strcasecmp(xtension,"IMAGE")    == 0) hdutype = IMAGE_HDU; 
	  else if(fits_strcasecmp(xtension,"TABLE")    == 0) hdutype = ASCII_TBL; 
	  else if(fits_strcasecmp(xtension,"BINTABLE") == 0) hdutype = BINARY_TBL; 
	  else hdutype = ANY_HDU; 
	}

      tmpPtr[0] = extname;

      if(extnameCol  != 0)
	  *status = fits_read_col_str(gfptr,extnameCol,member,1,1,nstr,
				      tmpPtr,&dummy,status);

      if(extverCol   != 0)
	  *status = fits_read_col_lng(gfptr,extverCol,member,1,1,0,
				      (long*)&extver,&dummy,status);

      if(positionCol != 0)
	  *status = fits_read_col_lng(gfptr,positionCol,member,1,1,0,
				      (long*)&hdupos,&dummy,status);

      tmpPtr[0] = mbrLocation1;

      if(locationCol != 0)
	*status = fits_read_col_str(gfptr,locationCol,member,1,1,nstr,
				    tmpPtr,&dummy,status);
      tmpPtr[0] = uri;

      if(uriCol != 0)
	*status = fits_read_col_str(gfptr,uriCol,member,1,1,nstr,
				    tmpPtr,&dummy,status);

      if(*status != 0) continue;

      /* 
	 decide what FITS file the member HDU resides in and open the file
	 using the fitsfile* pointer mfptr; note that this logic is rather
	 complicated and is based primiarly upon if a URL specifier is given
	 for the member file in the grouping table
      */

      switch(grptype)
	{

	case GT_ID_POS:
	case GT_ID_REF:
	case GT_ID_ALL:

	  /*
	     no location information is given so we must assume that the
	     member HDU resides in the same FITS file as the grouping table;
	     if the grouping table was incorrectly constructed then this
	     assumption will be false, but there is nothing to be done about
	     it at this point
	  */

	  *status = fits_reopen_file(gfptr,mfptr,status);
	  
	  break;

	case GT_ID_REF_URI:
	case GT_ID_POS_URI:
	case GT_ID_ALL_URI:

	  /*
	    The member location column exists. Determine if the member 
	    resides in the same file as the grouping table or in a
	    separate file; open the member file in either case
	  */

	  if(strlen(mbrLocation1) == 0)
	    {
	      /*
		 since no location information was given we must assume
		 that the member is in the same FITS file as the grouping
		 table
	      */

	      *status = fits_reopen_file(gfptr,mfptr,status);
	    }
	  else
	    {
	      /*
		make sure the location specifiation is "URL"; we cannot
		decode any other URI types at this time
	      */

	      if(fits_strcasecmp(uri,"URL") != 0)
		{
		  *status = FILE_NOT_OPENED;
		  snprintf(card,FLEN_CARD,
		  "Cannot open member HDU file with URI type %s (ffgmop)",
			  uri);
		  ffpmsg(card);

		  continue;
		}

	      /*
		The location string for the member is not NULL, so it 
		does not necessially reside in the same FITS file as the
		grouping table. 

		Three cases are attempted for opening the member's file
		in the following order:

		1. The URL given for the member's file is absolute (i.e.,
		access method supplied); try to open the member

		2. The URL given for the member's file is not absolute but
		is an absolute file path; try to open the member as a file
		after the file path is converted to a host-dependent form

		3. The URL given for the member's file is not absolute
	        and is given as a relative path to the location of the 
		grouping table's file. Create an absolute URL using the 
		grouping table's file URL and try to open the member.
		
		If all three cases fail then an error is returned. In each
		case the file is first opened in read/write mode and failing
		that readonly mode.
		
		The following DO loop is only used as a mechanism to break
		(continue) when the proper file opening method is found
	       */

	      do
		{
		  /*
		     CASE 1:

		     See if the member URL is absolute (i.e., includes a
		     access directive) and if so open the file
		   */

		  if(fits_is_url_absolute(mbrLocation1))
		    {
		      /*
			 the URL must specify an access method, which 
			 implies that its an absolute reference
			 
			 regardless of the access method, pass the whole
			 URL to the open function for processing
		       */
		      
		      ffpmsg("member URL is absolute, try open R/W (ffgmop)");

		      *status = fits_open_file(mfptr,mbrLocation1,READWRITE,
					       status);

		      if(*status == 0) continue;

		      *status = 0;

		      /* 
			 now try to open file using full URL specs in 
			 readonly mode 
		      */ 

		      ffpmsg("OK, now try to open read-only (ffgmop)");

		      *status = fits_open_file(mfptr,mbrLocation1,READONLY,
					       status);

		      /* break from DO loop regardless of status */

		      continue;
		    }

		  /*
		     CASE 2:

		     If we got this far then the member URL location 
		     has no access type ==> FILE:// Try to open the member 
		     file using the URL as is, i.e., assume that it is given 
		     as absolute, if it starts with a '/' character
		   */

		  ffpmsg("Member URL is of type FILE (ffgmop)");

		  if(*mbrLocation1 == '/')
		    {
		      ffpmsg("Member URL specifies abs file path (ffgmop)");

		      /* 
			 convert the URL path to a host dependent path
		      */

		      *status = fits_url2path(mbrLocation1,mbrLocation2,
					      status);

		      ffpmsg("Try to open member URL in R/W mode (ffgmop)");

		      *status = fits_open_file(mfptr,mbrLocation2,READWRITE,
					       status);

		      if(*status == 0) continue;

		      *status = 0;

		      /* 
			 now try to open file using the URL as an absolute 
			 path in readonly mode 
		      */
 
		      ffpmsg("OK, now try to open read-only (ffgmop)");

		      *status = fits_open_file(mfptr,mbrLocation2,READONLY,
					       status);

		      /* break from the Do loop regardless of the status */

		      continue;
		    }
		  
		  /* 
		     CASE 3:

		     If we got this far then the URL does not specify an
		     absoulte file path or URL with access method. Since 
		     the path to the group table's file is (obviously) valid 
		     for the CWD, create a full location string for the
		     member HDU using the grouping table URL as a basis

		     The only problem is that the grouping table file might
		     have two URLs, the original one used to open it and
		     the one that points to the real file being accessed
		     (i.e., a file accessed via HTTP but transferred to a
		     local disk file). Have to attempt to build a URL to
		     the member HDU file using both of these URLs if
		     defined.
		  */

		  ffpmsg("Try to open member file as relative URL (ffgmop)");

		  /* get the URL information for the grouping table file */

		  *status = fits_get_url(gfptr,grpLocation1,grpLocation2,
					 NULL,NULL,NULL,status);

		  /* 
		     if the "real" grouping table file URL is defined then
		     build a full url for the member HDU file using it
		     and try to open the member HDU file
		  */

		  if(*grpLocation1)
		    {
		      /* make sure the group location is absolute */

		      if(! fits_is_url_absolute(grpLocation1) &&
			                              *grpLocation1 != '/')
			{
			  fits_get_cwd(cwd,status);
			  strcat(cwd,"/");
                          if (strlen(cwd)+strlen(grpLocation1)+1 > 
                                    FLEN_FILENAME-1)
                          {
                             ffpmsg("cwd and group location1 is too long (ffgmop)");
                             *status = URL_PARSE_ERROR;
                             continue;
                          }
			  strcat(cwd,grpLocation1);
			  strcpy(grpLocation1,cwd);
			}

		      /* create a full URL for the member HDU file */

		      *status = fits_relurl2url(grpLocation1,mbrLocation1,
						mbrLocation2,status);

		      if(*status != 0) continue;

		      /*
			if the URL does not have an access method given then
			translate it into a host dependent file path
		      */

		      if(! fits_is_url_absolute(mbrLocation2))
			{
			  *status = fits_url2path(mbrLocation2,mbrLocation3,
						  status);
			  strcpy(mbrLocation2,mbrLocation3);
			}

		      /* try to open the member file READWRITE */

		      *status = fits_open_file(mfptr,mbrLocation2,READWRITE,
					       status);

		      if(*status == 0) continue;

		      *status = 0;
		  
		      /* now try to open in readonly mode */ 

		      ffpmsg("now try to open file as READONLY (ffgmop)");

		      *status = fits_open_file(mfptr,mbrLocation2,READONLY,
					       status);

		      if(*status == 0) continue;

		      *status = 0;
		    }

		  /* 
		     if we got this far then either the "real" grouping table
		     file URL was not defined or all attempts to open the
		     resulting member HDU file URL failed.

		     if the "original" grouping table file URL is defined then
		     build a full url for the member HDU file using it
		     and try to open the member HDU file
		  */

		  if(*grpLocation2)
		    {
		      /* make sure the group location is absolute */

		      if(! fits_is_url_absolute(grpLocation2) &&
			                              *grpLocation2 != '/')
			{
			  fits_get_cwd(cwd,status);
                          if (strlen(cwd)+strlen(grpLocation2)+1 > 
                                    FLEN_FILENAME-1)
                          {
                             ffpmsg("cwd and group location2 is too long (ffgmop)");
                             *status = URL_PARSE_ERROR;
                             continue;
                          }
			  strcat(cwd,"/");
			  strcat(cwd,grpLocation2);
			  strcpy(grpLocation2,cwd);
			}

		      /* create an absolute URL for the member HDU file */

		      *status = fits_relurl2url(grpLocation2,mbrLocation1,
						mbrLocation2,status);
		      if(*status != 0) continue;

		      /*
			if the URL does not have an access method given then
			translate it into a host dependent file path
		      */

		      if(! fits_is_url_absolute(mbrLocation2))
			{
			  *status = fits_url2path(mbrLocation2,mbrLocation3,
						  status);
			  strcpy(mbrLocation2,mbrLocation3);
			}

		      /* try to open the member file READWRITE */

		      *status = fits_open_file(mfptr,mbrLocation2,READWRITE,
					       status);

		      if(*status == 0) continue;

		      *status = 0;
		  
		      /* now try to open in readonly mode */ 

		      ffpmsg("now try to open file as READONLY (ffgmop)");

		      *status = fits_open_file(mfptr,mbrLocation2,READONLY,
					       status);

		      if(*status == 0) continue;

		      *status = 0;
		    }

		  /*
		     if we got this far then the member HDU file could not
		     be opened using any method. Log the error.
		  */

		  ffpmsg("Cannot open member HDU FITS file (ffgmop)");
		  *status = MEMBER_NOT_FOUND;
		  
		}while(0);
	    }

	  break;

	default:

	  /* no default action */
	  
	  break;
	}
	  
      if(*status != 0) continue;

      /*
	 attempt to locate the member HDU within its FITS file as determined
	 and opened above
      */

      switch(grptype)
	{

	case GT_ID_POS:
	case GT_ID_POS_URI:

	  /*
	    try to find the member hdu in the the FITS file pointed to
	    by mfptr based upon its HDU posistion value. Note that is 
	    impossible to verify if the HDU is actually the correct HDU due 
	    to a lack of information.
	  */
	  
	  *status = fits_movabs_hdu(*mfptr,(int)hdupos,&hdutype,status);

	  break;

	case GT_ID_REF:
	case GT_ID_REF_URI:

	  /*
	     try to find the member hdu in the FITS file pointed to
	     by mfptr based upon its XTENSION, EXTNAME and EXTVER keyword 
	     values
	  */

	  *status = fits_movnam_hdu(*mfptr,hdutype,extname,extver,status);

	  if(*status == BAD_HDU_NUM) 
	    {
	      *status = MEMBER_NOT_FOUND;
	      ffpmsg("Cannot find specified member HDU (ffgmop)");
	    }

	  /*
	     if the above function returned without error then the
	     mfptr is pointed to the member HDU
	  */

	  break;

	case GT_ID_ALL:
	case GT_ID_ALL_URI:

	  /*
	     if the member entry has reference information then use it
             (ID by reference is safer than ID by position) else use
	     the position information
	  */

	  if(strlen(xtension) > 0 && strlen(extname) > 0 && extver > 0)
	    {
	      /* valid reference info exists so use it */
	      
	      /* try to find the member hdu in the grouping table's file */

	      *status = fits_movnam_hdu(*mfptr,hdutype,extname,extver,status);

	      if(*status == BAD_HDU_NUM) 
		{
		  *status = MEMBER_NOT_FOUND;
		  ffpmsg("Cannot find specified member HDU (ffgmop)");
		}
	    }
	  else
	      {
		  *status = fits_movabs_hdu(*mfptr,(int)hdupos,&hdutype,
					    status);
		  if(*status == END_OF_FILE) *status = MEMBER_NOT_FOUND;
	      }

	  /*
	     if the above function returned without error then the
	     mfptr is pointed to the member HDU
	  */

	  break;

	default:

	  /* no default action */

	  break;
	}
      
    }while(0);

  if(*status != 0 && *mfptr != NULL) 
    {
      fits_close_file(*mfptr,status);
    }

  return(*status);
}

/*---------------------------------------------------------------------------*/
int ffgmcp(fitsfile *gfptr,  /* FITS file pointer to group                   */
	   fitsfile *mfptr,  /* FITS file pointer to new member
				FITS file                                    */
	   long      member, /* member ID (row num) within grouping table    */
	   int       cpopt,  /* code specifying copy options:
				OPT_MCP_ADD  (0) ==> add copied member to the
 				                     grouping table
				OPT_MCP_NADD (1) ==> do not add member copy to
				                     the grouping table
				OPT_MCP_REPL (2) ==> replace current member
				                     entry with member copy  */
	   int      *status) /* return status code                           */
	   
/*
  copy a member HDU of a grouping table to a new FITS file. The grouping table
  must be the CHDU of the FITS file pointed to by gfptr. The copy of the
  group member shall be appended to the end of the FITS file pointed to by
  mfptr. If the cpopt parameter is set to OPT_MCP_ADD then the copy of the 
  member is added to the grouping table as a new member, if OPT_MCP_NADD 
  then the copied member is not added to the grouping table, and if 
  OPT_MCP_REPL then the copied member is used to replace the original member.
  The copied member HDU also has its EXTVER value updated so that its
  combination of XTENSION, EXTNAME and EXVTER is unique within its new
  FITS file.
*/

{
  int numkeys = 0;
  int keypos  = 0;
  int hdunum  = 0;
  int hdutype = 0;
  int i;
  
  char *incList[] = {"GRPID#","GRPLC#"};
  char  extname[FLEN_VALUE];
  char  card[FLEN_CARD];
  char  comment[FLEN_COMMENT];
  char  keyname[FLEN_CARD];
  char  value[FLEN_CARD];

  fitsfile *tmpfptr = NULL;


  if(*status != 0) return(*status);

  do
    {
      /* open the member HDU to be copied */

      *status = fits_open_member(gfptr,member,&tmpfptr,status);

      if(*status != 0) continue;

      /*
	if the member is a grouping table then copy it with a call to
	fits_copy_group() using the "copy only the grouping table" option

	if it is not a grouping table then copy the hdu with fits_copy_hdu()
	remove all GRPIDn and GRPLCn keywords, and update the EXTVER keyword
	value
      */

      /* get the member HDU's EXTNAME value */

      *status = fits_read_key_str(tmpfptr,"EXTNAME",extname,comment,status);

      /* if no EXTNAME value was found then set the extname to a null string */

      if(*status == KEY_NO_EXIST) 
	{
	  extname[0] = 0;
	  *status    = 0;
	}
      else if(*status != 0) continue;

      prepare_keyvalue(extname);

      /* if a grouping table then copy with fits_copy_group() */

      if(fits_strcasecmp(extname,"GROUPING") == 0)
	*status = fits_copy_group(tmpfptr,mfptr,OPT_GCP_GPT,status);
      else
	{
	  /* copy the non-grouping table HDU the conventional way */

	  *status = fits_copy_hdu(tmpfptr,mfptr,0,status);

	  ffgrec(mfptr,0,card,status);

	  /* delete all the GRPIDn and GRPLCn keywords in the copied HDU */

	  while(*status == 0)
	    {
	      *status = fits_find_nextkey(mfptr,incList,2,NULL,0,card,status);
	      *status = fits_get_hdrpos(mfptr,&numkeys,&keypos,status);  
	      /* SPR 1738 */
	      *status = fits_read_keyn(mfptr,keypos-1,keyname,value,
				       comment,status);
	      *status = fits_read_record(mfptr,keypos-1,card,status);
	      *status = fits_delete_key(mfptr,keyname,status);
	    }

	  if(*status == KEY_NO_EXIST) *status = 0;
	  if(*status != 0) continue;
	}

      /* 
	 if the member HDU does not have an EXTNAME keyword then add one
	 with a default value
      */

      if(strlen(extname) == 0)
	{
	  if(fits_get_hdu_num(tmpfptr,&hdunum) == 1)
	    {
	      strcpy(extname,"PRIMARY");
	      *status = fits_write_key_str(mfptr,"EXTNAME",extname,
					   "HDU was Formerly a Primary Array",
					   status);
	    }
	  else
	    {
	      strcpy(extname,"DEFAULT");
	      *status = fits_write_key_str(mfptr,"EXTNAME",extname,
					   "default EXTNAME set by CFITSIO",
					   status);
	    }
	}

      /* 
	 update the member HDU's EXTVER value (add it if not present)
      */

      fits_get_hdu_num(mfptr,&hdunum);
      fits_get_hdu_type(mfptr,&hdutype,status);

      /* set the EXTVER value to 0 for now */

      *status = fits_modify_key_lng(mfptr,"EXTVER",0,NULL,status);

      /* if the EXTVER keyword was not found then add it */

      if(*status == KEY_NO_EXIST)
	{
	  *status = 0;
	  *status = fits_read_key_str(mfptr,"EXTNAME",extname,comment,
				      status);
	  *status = fits_insert_key_lng(mfptr,"EXTVER",0,
					"Extension version ID",status);
	}

      if(*status != 0) continue;

      /* find the first available EXTVER value for the copied HDU */
 
      for(i = 1; fits_movnam_hdu(mfptr,hdutype,extname,i,status) == 0; ++i);

      *status = 0;

      fits_movabs_hdu(mfptr,hdunum,&hdutype,status);

      /* reset the copied member HDUs EXTVER value */

      *status = fits_modify_key_lng(mfptr,"EXTVER",(long)i,NULL,status);    

      /*
	perform member copy operations that are dependent upon the cpopt
	parameter value
      */

      switch(cpopt)
	{
	case OPT_MCP_ADD:

	  /*
	    add the copied member to the grouping table, leaving the
	    entry for the original member in place
	  */

	  *status = fits_add_group_member(gfptr,mfptr,0,status);

	  break;

	case OPT_MCP_NADD:

	  /*
	    nothing to do for this copy option
	  */

	  break;

	case OPT_MCP_REPL:

	  /*
	    remove the original member from the grouping table and add the
	    copied member in its place
	  */

	  *status = fits_remove_member(gfptr,member,OPT_RM_ENTRY,status);
	  *status = fits_add_group_member(gfptr,mfptr,0,status);

	  break;

	default:

	  *status = BAD_OPTION;
	  ffpmsg("Invalid value specified for the cmopt parameter (ffgmcp)");

	  break;
	}

    }while(0);
      
  if(tmpfptr != NULL) 
    {
      fits_close_file(tmpfptr,status);
    }

  return(*status);
}		     

/*---------------------------------------------------------------------------*/
int ffgmtf(fitsfile *infptr,   /* FITS file pointer to source grouping table */
	   fitsfile *outfptr,  /* FITS file pointer to target grouping table */
	   long      member,   /* member ID within source grouping table     */
	   int       tfopt,    /* code specifying transfer opts:
				  OPT_MCP_ADD (0) ==> copy member to dest.
				  OPT_MCP_MOV (3) ==> move member to dest.   */
	   int      *status)   /* return status code                         */

/*
  transfer a group member from one grouping table to another. The source
  grouping table must be the CHDU of the fitsfile pointed to by infptr, and 
  the destination grouping table must be the CHDU of the fitsfile to by 
  outfptr. If the tfopt parameter is OPT_MCP_ADD then the member is made a 
  member of the target group and remains a member of the source group. If
  the tfopt parameter is OPT_MCP_MOV then the member is deleted from the 
  source group after the transfer to the destination group. The member to be
  transfered is identified by its row number within the source grouping table.
*/

{
  fitsfile *mfptr = NULL;


  if(*status != 0) return(*status);

  if(tfopt != OPT_MCP_MOV && tfopt != OPT_MCP_ADD)
    {
      *status = BAD_OPTION;
      ffpmsg("Invalid value specified for the tfopt parameter (ffgmtf)");
    }
  else
    {
      /* open the member of infptr to be transfered */

      *status = fits_open_member(infptr,member,&mfptr,status);
      
      /* add the member to the outfptr grouping table */
      
      *status = fits_add_group_member(outfptr,mfptr,0,status);
      
      /* close the member HDU */
      
      *status = fits_close_file(mfptr,status);
      
      /* 
	 if the tfopt is "move member" then remove it from the infptr 
	 grouping table
      */

      if(tfopt == OPT_MCP_MOV)
	*status = fits_remove_member(infptr,member,OPT_RM_ENTRY,status);
    }
  
  return(*status);
}

/*---------------------------------------------------------------------------*/
int ffgmrm(fitsfile *gfptr,  /* FITS file pointer to group table             */
	   long      member, /* member ID (row num) in the group             */
	   int       rmopt,  /* code specifying the delete option:
				OPT_RM_ENTRY ==> delete the member entry
				OPT_RM_MBR   ==> delete entry and member HDU */
	   int      *status)  /* return status code                          */

/*
  remove a member HDU from a grouping table. The fitsfile pointer gfptr must
  be positioned with the grouping table as the CHDU, and the member to 
  delete is identified by its row number in the table (first member == 1).
  The rmopt parameter determines if the member entry is deleted from the
  grouping table (in which case GRPIDn and GRPLCn keywords in the member 
  HDU's header shall be updated accordingly) or if the member HDU shall 
  itself be removed from its FITS file.
*/

{
  int found;
  int hdutype   = 0;
  int index;
  int iomode    = 0;

  long i;
  long ngroups      = 0;
  long nmembers     = 0;
  long groupExtver  = 0;
  long grpid        = 0;

  char grpLocation1[FLEN_FILENAME];
  char grpLocation2[FLEN_FILENAME];
  char grpLocation3[FLEN_FILENAME];
  char cwd[FLEN_FILENAME];
  char keyword[FLEN_KEYWORD];
  /* SPR 1738 This can now be longer */
  char grplc[FLEN_FILENAME];
  char *tgrplc;
  char keyvalue[FLEN_VALUE];
  char card[FLEN_CARD];
  char *editLocation;
  char mrootname[FLEN_FILENAME], grootname[FLEN_FILENAME];

  fitsfile *mfptr  = NULL;


  if(*status != 0) return(*status);

  do
    {
      /*
	make sure the grouping table can be modified before proceeding
      */

      fits_file_mode(gfptr,&iomode,status);

      if(iomode != READWRITE)
	{
	  ffpmsg("cannot modify grouping table (ffgtam)");
	  *status = BAD_GROUP_DETACH;
	  continue;
	}

      /* open the group member to be deleted and get its IOstatus*/

      *status = fits_open_member(gfptr,member,&mfptr,status);
      *status = fits_file_mode(mfptr,&iomode,status);

      /*
	 if the member HDU is to be deleted then call fits_unlink_member()
	 to remove it from all groups to which it belongs (including
	 this one) and then delete it. Note that if the member is a
	 grouping table then we have to recursively call fits_remove_member()
	 for each member of the member before we delete the member itself.
      */

      if(rmopt == OPT_RM_MBR)
	{
	    /* cannot delete a PHDU */
	    if(fits_get_hdu_num(mfptr,&hdutype) == 1)
		{
		    *status = BAD_HDU_NUM;
		    continue;
		}

	  /* determine if the member HDU is itself a grouping table */

	  *status = fits_read_key_str(mfptr,"EXTNAME",keyvalue,card,status);

	  /* if no EXTNAME is found then the HDU cannot be a grouping table */ 

	  if(*status == KEY_NO_EXIST) 
	    {
	      keyvalue[0] = 0;
	      *status = 0;
	    }
	  prepare_keyvalue(keyvalue);

	  /* Any other error is a reason to abort */

	  if(*status != 0) continue;

	  /* if the EXTNAME == GROUPING then the member is a grouping table */
	  
	  if(fits_strcasecmp(keyvalue,"GROUPING") == 0)
	    {
	      /* remove each of the grouping table members */
	      
	      *status = fits_get_num_members(mfptr,&nmembers,status);
	      
	      for(i = nmembers; i > 0 && *status == 0; --i)
		*status = fits_remove_member(mfptr,i,OPT_RM_ENTRY,status);
	      
	      if(*status != 0) continue;
	    }

	  /* unlink the member HDU from all groups that contain it */

	  *status = ffgmul(mfptr,0,status);

	  if(*status != 0) continue;
 
	  /* reset the grouping table HDU struct */

	  fits_set_hdustruc(gfptr,status);

	  /* delete the member HDU */

	  if(iomode != READONLY)
	    *status = fits_delete_hdu(mfptr,&hdutype,status);
	}
      else if(rmopt == OPT_RM_ENTRY)
	{
	  /* 
	     The member HDU is only to be removed as an entry from this
	     grouping table. Actions are (1) find the GRPIDn/GRPLCn 
	     keywords that link the member to the grouping table, (2)
	     remove the GRPIDn/GRPLCn keyword from the member HDU header
	     and (3) remove the member entry from the grouping table
	  */

	  /*
	    there is no need to seach for and remove the GRPIDn/GRPLCn
	    keywords from the member HDU if it has not been opened
	    in READWRITE mode
	  */

	  if(iomode == READWRITE)
	    {	  	      
	      /* 
		 determine the group EXTVER value of the grouping table; if
		 the member HDU and grouping table HDU do not reside in the 
		 same file then set the groupExtver value to its negative 
	      */
	      
	      *status = fits_read_key_lng(gfptr,"EXTVER",&groupExtver,card,
					  status);
	      /* Now, if either the Fptr values are the same, or the root filenames
	         are the same, then assume these refer to the same file.
	      */
	      fits_parse_rootname(mfptr->Fptr->filename, mrootname, status);
	      fits_parse_rootname(gfptr->Fptr->filename, grootname, status);

	      if((mfptr->Fptr != gfptr->Fptr) && 
	          strncmp(mrootname, grootname, FLEN_FILENAME))
                       groupExtver = -1*groupExtver;
	      
	      /*
		retrieve the URLs for the grouping table; note that it is 
		possible that the grouping table file has two URLs, the 
		one used to open it and the "real" one pointing to the 
		actual file being accessed
	      */
	      
	      *status = fits_get_url(gfptr,grpLocation1,grpLocation2,NULL,
				     NULL,NULL,status);
	      
	      if(*status != 0) continue;
	      
	      /*
		if either of the group location strings specify a relative
		file path then convert them into absolute file paths
	      */

	      *status = fits_get_cwd(cwd,status);
	      
	      if(*grpLocation1 != 0 && *grpLocation1 != '/' &&
		 !fits_is_url_absolute(grpLocation1))
		{
		  strcpy(grpLocation3,cwd);
                  if (strlen(grpLocation3)+strlen(grpLocation1)+1 > 
                            FLEN_FILENAME-1)
                  {
                     ffpmsg("group locations are too long (ffgmrm)");
                     *status = URL_PARSE_ERROR;
                     continue;
                  }
		  strcat(grpLocation3,"/");
		  strcat(grpLocation3,grpLocation1);
		  fits_clean_url(grpLocation3,grpLocation1,status);
		}
	      
	      if(*grpLocation2 != 0 && *grpLocation2 != '/' &&
		 !fits_is_url_absolute(grpLocation2))
		{
		  strcpy(grpLocation3,cwd);
                  if (strlen(grpLocation3)+strlen(grpLocation2)+1 > 
                            FLEN_FILENAME-1)
                  {
                     ffpmsg("group locations are too long (ffgmrm)");
                     *status = URL_PARSE_ERROR;
                     continue;
                  }
		  strcat(grpLocation3,"/");
		  strcat(grpLocation3,grpLocation2);
		  fits_clean_url(grpLocation3,grpLocation2,status);
		}
	      
	      /*
		determine the number of groups to which the member HDU 
		belongs
	      */
	      
	      *status = fits_get_num_groups(mfptr,&ngroups,status);
	      
	      /* reset the HDU keyword position counter to the beginning */
	      
	      *status = ffgrec(mfptr,0,card,status);
	      
	      /*
		loop over all the GRPIDn keywords in the member HDU header 
		and find the appropriate GRPIDn and GRPLCn keywords that 
		identify it as belonging to the group
	      */
	      
	      for(index = 1, found = 0; index <= ngroups && *status == 0 && 
		    !found; ++index)
		{	  
		  /* read the next GRPIDn keyword in the series */
		  
		  snprintf(keyword,FLEN_KEYWORD,"GRPID%d",index);
		  
		  *status = fits_read_key_lng(mfptr,keyword,&grpid,card,
					      status);
		  if(*status != 0) continue;
		  
		  /* 
		     grpid value == group EXTVER value then we could have a 
		     match
		  */
		  
		  if(grpid == groupExtver && grpid > 0)
		    {
		      /*
			if GRPID is positive then its a match because 
			both the member HDU and grouping table HDU reside
			in the same FITS file
		      */
		      
		      found = index;
		    }
		  else if(grpid == groupExtver && grpid < 0)
		    {
		      /* 
			 have to look at the GRPLCn value to determine a 
			 match because the member HDU and grouping table 
			 HDU reside in different FITS files
		      */
		      
		      snprintf(keyword,FLEN_KEYWORD,"GRPLC%d",index);
		      
		      /* SPR 1738 */
		      *status = fits_read_key_longstr(mfptr,keyword,&tgrplc,
						      card, status);
		      if (0 == *status) {
			strcpy(grplc,tgrplc);
			free(tgrplc);
		      }
		      		      
		      if(*status == KEY_NO_EXIST)
			{
			  /* 
			     no GRPLCn keyword value found ==> grouping
			     convention not followed; nothing we can do 
			     about it, so just continue
			  */
			  
			  snprintf(card,FLEN_CARD,"No GRPLC%d found for GRPID%d",
				  index,index);
			  ffpmsg(card);
			  *status = 0;
			  continue;
			}
		      else if (*status != 0) continue;
		      
		      /* construct the URL for the GRPLCn value */
		      
		      prepare_keyvalue(grplc);
		      
		      /*
			if the grplc value specifies a relative path then
			turn it into a absolute file path for comparison
			purposes
		      */
		      
		      if(*grplc != 0 && !fits_is_url_absolute(grplc) &&
			 *grplc != '/')
			{
			    /* No, wrong, 
			       strcpy(grpLocation3,cwd);
			       should be */
			    *status = fits_file_name(mfptr,grpLocation3,status);
			    /* Remove everything after the last / */
			    if (NULL != (editLocation = strrchr(grpLocation3,'/'))) {
				*editLocation = '\0';
			    }
				
                          if (strlen(grpLocation3)+strlen(grplc)+1 > 
                                    FLEN_FILENAME-1)
                          {
                             ffpmsg("group locations are too long (ffgmrm)");
                             *status = URL_PARSE_ERROR;
                             continue;
                          }
			  strcat(grpLocation3,"/");
			  strcat(grpLocation3,grplc);
			  *status = fits_clean_url(grpLocation3,grplc,
						   status);
			}
		      
		      /*
			if the absolute value of GRPIDn is equal to the
			EXTVER value of the grouping table and (one of the 
			possible two) grouping table file URL matches the
			GRPLCn keyword value then we hava a match
		      */
		      
		      if(strcmp(grplc,grpLocation1) == 0  || 
			 strcmp(grplc,grpLocation2) == 0) 
			found = index; 
		    }
		}

	      /*
		if found == 0 (false) after the above search then we assume 
		that it is due to an inpromper updating of the GRPIDn and 
		GRPLCn keywords in the member header ==> nothing to delete 
		in the header. Else delete the GRPLCn and GRPIDn keywords 
		that identify the member HDU with the group HDU and 
		re-enumerate the remaining GRPIDn and GRPLCn keywords
	      */

	      if(found != 0)
		{
		  snprintf(keyword,FLEN_KEYWORD,"GRPID%d",found);
		  *status = fits_delete_key(mfptr,keyword,status);
		  
		  snprintf(keyword,FLEN_KEYWORD,"GRPLC%d",found);
		  *status = fits_delete_key(mfptr,keyword,status);
		  
		  *status = 0;
		  
		  /* call fits_get_num_groups() to re-enumerate the GRPIDn */
		  
		  *status = fits_get_num_groups(mfptr,&ngroups,status);
		} 
	    }

	  /*
	     finally, remove the member entry from the current grouping table
	     pointed to by gfptr
	  */

	  *status = fits_delete_rows(gfptr,member,1,status);
	}
      else
	{
	  *status = BAD_OPTION;
	  ffpmsg("Invalid value specified for the rmopt parameter (ffgmrm)");
	}

    }while(0);

  if(mfptr != NULL) 
    {
      fits_close_file(mfptr,status);
    }

  return(*status);
}

/*---------------------------------------------------------------------------
                 Grouping Table support functions
  ---------------------------------------------------------------------------*/
int ffgtgc(fitsfile *gfptr,  /* pointer to the grouping table                */
	   int *xtensionCol, /* column ID of the MEMBER_XTENSION column      */
	   int *extnameCol,  /* column ID of the MEMBER_NAME column          */
	   int *extverCol,   /* column ID of the MEMBER_VERSION column       */
	   int *positionCol, /* column ID of the MEMBER_POSITION column      */
	   int *locationCol, /* column ID of the MEMBER_LOCATION column      */
	   int *uriCol,      /* column ID of the MEMBER_URI_TYPE column      */
	   int *grptype,     /* group structure type code specifying the
				grouping table columns that are defined:
				GT_ID_ALL_URI  (0) ==> all columns defined   
				GT_ID_REF      (1) ==> reference cols only   
				GT_ID_POS      (2) ==> position col only     
				GT_ID_ALL      (3) ==> ref & pos cols        
				GT_ID_REF_URI (11) ==> ref & loc cols        
				GT_ID_POS_URI (12) ==> pos & loc cols        */
	   int *status)      /* return status code                           */
/*
   examine the grouping table pointed to by gfptr and determine the column
   index ID of each possible grouping column. If a column is not found then
   an index of 0 is returned. the grptype parameter returns the structure
   of the grouping table ==> what columns are defined.
*/

{

  char keyvalue[FLEN_VALUE];
  char comment[FLEN_COMMENT];


  if(*status != 0) return(*status);

  do
    {
      /*
	if the HDU does not have an extname of "GROUPING" then it is not
	a grouping table
      */

      *status = fits_read_key_str(gfptr,"EXTNAME",keyvalue,comment,status);
  
      if(*status == KEY_NO_EXIST) 
	{
	  *status = NOT_GROUP_TABLE;
	  ffpmsg("Specified HDU is not a Grouping Table (ffgtgc)");
	}
      if(*status != 0) continue;

      prepare_keyvalue(keyvalue);

      if(fits_strcasecmp(keyvalue,"GROUPING") != 0)
	{
	  *status = NOT_GROUP_TABLE;
	  continue;
	}

      /*
        search for the MEMBER_XTENSION, MEMBER_NAME, MEMBER_VERSION,
	MEMBER_POSITION, MEMBER_LOCATION and MEMBER_URI_TYPE columns
	and determine their column index ID
      */

      *status = fits_get_colnum(gfptr,CASESEN,"MEMBER_XTENSION",xtensionCol,
				status);

      if(*status == COL_NOT_FOUND)
	{
	  *status      = 0;
 	  *xtensionCol = 0;
	}

      if(*status != 0) continue;

      *status = fits_get_colnum(gfptr,CASESEN,"MEMBER_NAME",extnameCol,status);

      if(*status == COL_NOT_FOUND)
	{
	  *status     = 0;
	  *extnameCol = 0;
	}

      if(*status != 0) continue;

      *status = fits_get_colnum(gfptr,CASESEN,"MEMBER_VERSION",extverCol,
				status);

      if(*status == COL_NOT_FOUND)
	{
	  *status    = 0;
	  *extverCol = 0;
	}

      if(*status != 0) continue;

      *status = fits_get_colnum(gfptr,CASESEN,"MEMBER_POSITION",positionCol,
				status);

      if(*status == COL_NOT_FOUND)
	{
	  *status      = 0;
	  *positionCol = 0;
	}

      if(*status != 0) continue;

      *status = fits_get_colnum(gfptr,CASESEN,"MEMBER_LOCATION",locationCol,
				status);

      if(*status == COL_NOT_FOUND)
	{
	  *status      = 0;
	  *locationCol = 0;
	}

      if(*status != 0) continue;

      *status = fits_get_colnum(gfptr,CASESEN,"MEMBER_URI_TYPE",uriCol,
				status);

      if(*status == COL_NOT_FOUND)
	{
	  *status = 0;
	  *uriCol = 0;
	}

      if(*status != 0) continue;

      /*
	 determine the type of grouping table structure used by this
	 grouping table and record it in the grptype parameter
      */

      if(*xtensionCol && *extnameCol && *extverCol && *positionCol &&
	 *locationCol && *uriCol) 
	*grptype = GT_ID_ALL_URI;
      
      else if(*xtensionCol && *extnameCol && *extverCol &&
	      *locationCol && *uriCol) 
	*grptype = GT_ID_REF_URI;

      else if(*xtensionCol && *extnameCol && *extverCol && *positionCol)
	*grptype = GT_ID_ALL;
      
      else if(*xtensionCol && *extnameCol && *extverCol)
	*grptype = GT_ID_REF;
      
      else if(*positionCol && *locationCol && *uriCol) 
	*grptype = GT_ID_POS_URI;
      
      else if(*positionCol)
	*grptype = GT_ID_POS;
      
      else
	*status = NOT_GROUP_TABLE;
      
    }while(0);

  /*
    if the table contained more than one column with a reserved name then
    this cannot be considered a vailid grouping table
  */

  if(*status == COL_NOT_UNIQUE) 
    {
      *status = NOT_GROUP_TABLE;
      ffpmsg("Specified HDU has multipule Group table cols defined (ffgtgc)");
    }

  return(*status);
}

/*****************************************************************************/
int ffvcfm(fitsfile *gfptr, int xtensionCol, int extnameCol, int extverCol,
	   int positionCol, int locationCol, int uriCol, int *status)
{
/*
   Perform validation on column formats to ensure this matches the grouping
   format the get functions expect.  Particularly want to check widths of
   string columns.
*/

   int typecode=0;
   long repeat=0, width=0;
   
   if (*status != 0) return (*status);
   
   do {
       if (xtensionCol)
       {
          fits_get_coltype(gfptr, xtensionCol, &typecode, &repeat, &width, status);
          if (*status || typecode != TSTRING || repeat != width || repeat > 8)
          {
             if (*status==0) *status=NOT_GROUP_TABLE;
             ffpmsg("Wrong format for Grouping xtension col. (ffvcfm)");
             continue;
          }          
       }
       if (extnameCol)
       {
          fits_get_coltype(gfptr, extnameCol, &typecode, &repeat, &width, status);
          if (*status || typecode != TSTRING || repeat != width || repeat > 32)
          {
             if (*status==0) *status=NOT_GROUP_TABLE;
             ffpmsg("Wrong format for Grouping name col. (ffvcfm)");
             continue;
          }          
       }
       if (extverCol)
       {
          fits_get_coltype(gfptr, extverCol, &typecode, &repeat, &width, status);
          if (*status || typecode != TINT32BIT ||  repeat > 1)
          {
             if (*status==0) *status=NOT_GROUP_TABLE;
             ffpmsg("Wrong format for Grouping version col. (ffvcfm)");
             continue;
          }          
       }
       if (positionCol)
       {
          fits_get_coltype(gfptr, positionCol, &typecode, &repeat, &width, status);
          if (*status || typecode != TINT32BIT ||  repeat > 1)
          {
             if (*status==0) *status=NOT_GROUP_TABLE;
             ffpmsg("Wrong format for Grouping position col. (ffvcfm)");
             continue;
          }          
       }
       if (locationCol)
       {
          fits_get_coltype(gfptr, locationCol, &typecode, &repeat, &width, status);
          if (*status || typecode != TSTRING || repeat != width || repeat > 256)
          {
             if (*status==0) *status=NOT_GROUP_TABLE;
             ffpmsg("Wrong format for Grouping location col. (ffvcfm)");
             continue;
          }          
       }
       if (uriCol)
       {
          fits_get_coltype(gfptr, uriCol, &typecode, &repeat, &width, status);
          if (*status || typecode != TSTRING || repeat != width || repeat > 3)
          {
             if (*status==0) *status=NOT_GROUP_TABLE;
             ffpmsg("Wrong format for Grouping URI col. (ffvcfm)");
             continue;
          }          
       }
   } while (0);
   return (*status);
}


/*****************************************************************************/
int ffgtdc(int   grouptype,     /* code specifying the type of
				   grouping table information:
				   GT_ID_ALL_URI  0 ==> defualt (all columns)
				   GT_ID_REF      1 ==> ID by reference
				   GT_ID_POS      2 ==> ID by position
				   GT_ID_ALL      3 ==> ID by ref. and position
				   GT_ID_REF_URI 11 ==> (1) + URI info 
				   GT_ID_POS_URI 12 ==> (2) + URI info       */
	   int   xtensioncol, /* does MEMBER_XTENSION already exist?         */
	   int   extnamecol,  /* does MEMBER_NAME aleady exist?              */
	   int   extvercol,   /* does MEMBER_VERSION already exist?          */
	   int   positioncol, /* does MEMBER_POSITION already exist?         */
	   int   locationcol, /* does MEMBER_LOCATION already exist?         */
	   int   uricol,      /* does MEMBER_URI_TYPE aleardy exist?         */
	   char *ttype[],     /* array of grouping table column TTYPE names
				 to define (if *col var false)               */
	   char *tform[],     /* array of grouping table column TFORM values
				 to define (if*col variable false)           */
	   int  *ncols,       /* number of TTYPE and TFORM values returned   */
	   int  *status)      /* return status code                          */

/*
  create the TTYPE and TFORM values for the grouping table according to the
  value of the grouptype parameter and the values of the *col flags. The
  resulting TTYPE and TFORM are returned in ttype[] and tform[] respectively.
  The number of TTYPE and TFORMs returned is given by ncols. Both the TTYPE[]
  and TTFORM[] arrays must contain enough pre-allocated strings to hold
  the returned information.
*/

{

  int i = 0;

  char  xtension[]  = "MEMBER_XTENSION";
  char  xtenTform[] = "8A";
  
  char  name[]      = "MEMBER_NAME";
  char  nameTform[] = "32A";

  char  version[]   = "MEMBER_VERSION";
  char  verTform[]  = "1J";
  
  char  position[]  = "MEMBER_POSITION";
  char  posTform[]  = "1J";

  char  URI[]       = "MEMBER_URI_TYPE";
  char  URITform[]  = "3A";

  char  location[]  = "MEMBER_LOCATION";
  /* SPR 01720, move from 160A to 256A */
  char  locTform[]  = "256A";


  if(*status != 0) return(*status);

  switch(grouptype)
    {
      
    case GT_ID_ALL_URI:

      if(xtensioncol == 0)
	{
	  strcpy(ttype[i],xtension);
	  strcpy(tform[i],xtenTform);
	  ++i;
	}
      if(extnamecol == 0)
	{
	  strcpy(ttype[i],name);
	  strcpy(tform[i],nameTform);
	  ++i;
	}
      if(extvercol == 0)
	{
	  strcpy(ttype[i],version);
	  strcpy(tform[i],verTform);
	  ++i;
	}
      if(positioncol == 0)
	{
	  strcpy(ttype[i],position);
	  strcpy(tform[i],posTform);
	  ++i;
	}
      if(locationcol == 0)
	{
	  strcpy(ttype[i],location);
	  strcpy(tform[i],locTform);
	  ++i;
	}
      if(uricol == 0)
	{
	  strcpy(ttype[i],URI);
	  strcpy(tform[i],URITform);
	  ++i;
	}
      break;
      
    case GT_ID_REF:
      
      if(xtensioncol == 0)
	{
	  strcpy(ttype[i],xtension);
	  strcpy(tform[i],xtenTform);
	  ++i;
	}
      if(extnamecol == 0)
	{
	  strcpy(ttype[i],name);
	  strcpy(tform[i],nameTform);
	  ++i;
	}
      if(extvercol == 0)
	{
	  strcpy(ttype[i],version);
	  strcpy(tform[i],verTform);
	  ++i;
	}
      break;
      
    case GT_ID_POS:
      
      if(positioncol == 0)
	{
	  strcpy(ttype[i],position);
	  strcpy(tform[i],posTform);
	  ++i;
	}	  
      break;
      
    case GT_ID_ALL:
      
      if(xtensioncol == 0)
	{
	  strcpy(ttype[i],xtension);
	  strcpy(tform[i],xtenTform);
	  ++i;
	}
      if(extnamecol == 0)
	{
	  strcpy(ttype[i],name);
	  strcpy(tform[i],nameTform);
	  ++i;
	}
      if(extvercol == 0)
	{
	  strcpy(ttype[i],version);
	  strcpy(tform[i],verTform);
	  ++i;
	}
      if(positioncol == 0)
	{
	  strcpy(ttype[i],position);
	  strcpy(tform[i], posTform);
	  ++i;
	}	  
      
      break;
      
    case GT_ID_REF_URI:
      
      if(xtensioncol == 0)
	{
	  strcpy(ttype[i],xtension);
	  strcpy(tform[i],xtenTform);
	  ++i;
	}
      if(extnamecol == 0)
	{
	  strcpy(ttype[i],name);
	  strcpy(tform[i],nameTform);
	  ++i;
	}
      if(extvercol == 0)
	{
	  strcpy(ttype[i],version);
	  strcpy(tform[i],verTform);
	  ++i;
	}
      if(locationcol == 0)
	{
	  strcpy(ttype[i],location);
	  strcpy(tform[i],locTform);
	  ++i;
	}
      if(uricol == 0)
	{
	  strcpy(ttype[i],URI);
	  strcpy(tform[i],URITform);
	  ++i;
	}
      break;
      
    case GT_ID_POS_URI:
      
      if(positioncol == 0)
	{
	  strcpy(ttype[i],position);
	  strcpy(tform[i],posTform);
	  ++i;
	}
      if(locationcol == 0)
	{
	  strcpy(ttype[i],location);
	  strcpy(tform[i],locTform);
	  ++i;
	}
      if(uricol == 0)
	{
	  strcpy(ttype[i],URI);
	  strcpy(tform[i],URITform);
	  ++i;
	}
      break;
      
    default:
      
      *status = BAD_OPTION;
      ffpmsg("Invalid value specified for the grouptype parameter (ffgtdc)");

      break;

    }

  *ncols = i;
  
  return(*status);
}

/*****************************************************************************/
int ffgmul(fitsfile *mfptr,   /* pointer to the grouping table member HDU    */
           int       rmopt,   /* 0 ==> leave GRPIDn/GRPLCn keywords,
				 1 ==> remove GRPIDn/GRPLCn keywords         */
	   int      *status) /* return status code                          */

/*
   examine all the GRPIDn and GRPLCn keywords in the member HDUs header
   and remove the member from the grouping tables referenced; This
   effectively "unlinks" the member from all of its groups. The rmopt 
   specifies if the GRPIDn/GRPLCn keywords are to be removed from the
   member HDUs header after the unlinking.
*/

{
  int memberPosition = 0;
  int iomode;

  long index;
  long ngroups      = 0;
  long memberExtver = 0;
  long memberID     = 0;

  char mbrLocation1[FLEN_FILENAME];
  char mbrLocation2[FLEN_FILENAME];
  char memberHDUtype[FLEN_VALUE];
  char memberExtname[FLEN_VALUE];
  char keyword[FLEN_KEYWORD];
  char card[FLEN_CARD];

  fitsfile *gfptr = NULL;


  if(*status != 0) return(*status);

  do
    {
      /* 
	 determine location parameters of the member HDU; note that
	 default values are supplied if the expected keywords are not
	 found
      */

      *status = fits_read_key_str(mfptr,"XTENSION",memberHDUtype,card,status);

      if(*status == KEY_NO_EXIST) 
	{
	  strcpy(memberHDUtype,"PRIMARY");
	  *status = 0;
	}
      prepare_keyvalue(memberHDUtype);

      *status = fits_read_key_lng(mfptr,"EXTVER",&memberExtver,card,status);

      if(*status == KEY_NO_EXIST) 
	{
	  memberExtver = 1;
	  *status      = 0;
	}

      *status = fits_read_key_str(mfptr,"EXTNAME",memberExtname,card,status);

      if(*status == KEY_NO_EXIST) 
	{
	  memberExtname[0] = 0;
	  *status          = 0;
	}
      prepare_keyvalue(memberExtname);

      fits_get_hdu_num(mfptr,&memberPosition);

      *status = fits_get_url(mfptr,mbrLocation1,mbrLocation2,NULL,NULL,
			     NULL,status);

      if(*status != 0) continue;

      /*
	 open each grouping table linked to this HDU and remove the member 
	 from the grouping tables
      */

      *status = fits_get_num_groups(mfptr,&ngroups,status);

      /* loop over each group linked to the member HDU */

      for(index = 1; index <= ngroups && *status == 0; ++index)
	{
	  /* open the (index)th group linked to the member HDU */ 

	  *status = fits_open_group(mfptr,index,&gfptr,status);

	  /* if the group could not be opened then just skip it */

	  if(*status != 0)
	    {
	      *status = 0;
	      snprintf(card,FLEN_CARD,"Cannot open the %dth group table (ffgmul)",
		      (int)index);
	      ffpmsg(card);
	      continue;
	    }

	  /*
	    make sure the grouping table can be modified before proceeding
	  */
	  
	  fits_file_mode(gfptr,&iomode,status);

	  if(iomode != READWRITE)
	    {
	      snprintf(card,FLEN_CARD,"The %dth group cannot be modified (ffgtam)",
		      (int)index);
	      ffpmsg(card);
	      continue;
	    }

	  /* 
	     try to find the member's row within the grouping table; first 
	     try using the member HDU file's "real" URL string then try
	     using its originally opened URL string if either string exist
	   */
	     
	  memberID = 0;
 
	  if(strlen(mbrLocation1) != 0)
	    {
	      *status = ffgmf(gfptr,memberHDUtype,memberExtname,memberExtver,
			      memberPosition,mbrLocation1,&memberID,status);
	    }

	  if(*status == MEMBER_NOT_FOUND && strlen(mbrLocation2) != 0)
	    {
	      *status = 0;
	      *status = ffgmf(gfptr,memberHDUtype,memberExtname,memberExtver,
			      memberPosition,mbrLocation2,&memberID,status);
	    }

	  /* if the member was found then delete it from the grouping table */

	  if(*status == 0)
	    *status = fits_delete_rows(gfptr,memberID,1,status);

	  /*
	     continue the loop over all member groups even if an error
	     was generated
	  */

	  if(*status == MEMBER_NOT_FOUND)
	    {
	      ffpmsg("cannot locate member's entry in group table (ffgmul)");
	    }
	  *status = 0;

	  /*
	     close the file pointed to by gfptr if it is non NULL to
	     prepare for the next loop iterration
	  */

	  if(gfptr != NULL)
	    {
	      fits_close_file(gfptr,status);
	      gfptr = NULL;
	    }
	}

      if(*status != 0) continue;

      /*
	 if rmopt is non-zero then find and delete the GRPIDn/GRPLCn 
	 keywords from the member HDU header
      */

      if(rmopt != 0)
	{
	  fits_file_mode(mfptr,&iomode,status);

	  if(iomode == READONLY)
	    {
	      ffpmsg("Cannot modify member HDU, opened READONLY (ffgmul)");
	      continue;
	    }

	  /* delete all the GRPIDn/GRPLCn keywords */

	  for(index = 1; index <= ngroups && *status == 0; ++index)
	    {
	      snprintf(keyword,FLEN_KEYWORD,"GRPID%d",(int)index);
	      fits_delete_key(mfptr,keyword,status);
	      
	      snprintf(keyword,FLEN_KEYWORD,"GRPLC%d",(int)index);
	      fits_delete_key(mfptr,keyword,status);

	      if(*status == KEY_NO_EXIST) *status = 0;
	    }
	}
    }while(0);

  /* make sure the gfptr has been closed */

  if(gfptr != NULL)
    { 
      fits_close_file(gfptr,status);
    }

return(*status);
}

/*--------------------------------------------------------------------------*/
int ffgmf(fitsfile *gfptr, /* pointer to grouping table HDU to search       */
	   char *xtension,  /* XTENSION value for member HDU                */
	   char *extname,   /* EXTNAME value for member HDU                 */
	   int   extver,    /* EXTVER value for member HDU                  */
	   int   position,  /* HDU position value for member HDU            */
	   char *location,  /* FITS file location value for member HDU      */
	   long *member,    /* member HDU ID within group table (if found)  */
	   int  *status)    /* return status code                           */

/*
   try to find the entry for the member HDU defined by the xtension, extname,
   extver, position, and location parameters within the grouping table
   pointed to by gfptr. If the member HDU is found then its ID (row number)
   within the grouping table is returned in the member variable; if not
   found then member is returned with a value of 0 and the status return
   code will be set to MEMBER_NOT_FOUND.

   Note that the member HDU postion information is used to obtain a member
   match only if the grouping table type is GT_ID_POS_URI or GT_ID_POS. This
   is because the position information can become invalid much more
   easily then the reference information for a group member.
*/

{
  int xtensionCol,extnameCol,extverCol,positionCol,locationCol,uriCol;
  int mposition = 0;
  int grptype;
  int dummy;
  int i;

  long nmembers = 0;
  long mextver  = 0;
 
  char  charBuff1[FLEN_FILENAME];
  char  charBuff2[FLEN_FILENAME];
  char  tmpLocation[FLEN_FILENAME];
  char  mbrLocation1[FLEN_FILENAME];
  char  mbrLocation2[FLEN_FILENAME];
  char  mbrLocation3[FLEN_FILENAME];
  char  grpLocation1[FLEN_FILENAME];
  char  grpLocation2[FLEN_FILENAME];
  char  cwd[FLEN_FILENAME];

  char  nstr[] = {'\0'};
  char *tmpPtr[2];

  if(*status != 0) return(*status);

  *member = 0;

  tmpPtr[0] = charBuff1;
  tmpPtr[1] = charBuff2;


  if(*status != 0) return(*status);

  /*
    if the passed LOCATION value is not an absolute URL then turn it
    into an absolute path
  */

  if(location == NULL)
    {
      *tmpLocation = 0;
    }

  else if(*location == 0)
    {
      *tmpLocation = 0;
    }

  else if(!fits_is_url_absolute(location))
    {
      fits_path2url(location,FLEN_FILENAME,tmpLocation,status);

      if(*tmpLocation != '/')
	{
	  fits_get_cwd(cwd,status);
          if (strlen(cwd)+strlen(tmpLocation)+1 > 
                    FLEN_FILENAME-1)
          {
             ffpmsg("cwd and location are too long (ffgmf)");
             return (*status = URL_PARSE_ERROR);
          }
	  strcat(cwd,"/");
	  strcat(cwd,tmpLocation);
	  fits_clean_url(cwd,tmpLocation,status);
	}
    }

  else
    strcpy(tmpLocation,location);

  /*
     retrieve the Grouping Convention reserved column positions within
     the grouping table
  */

  *status = ffgtgc(gfptr,&xtensionCol,&extnameCol,&extverCol,&positionCol,
		   &locationCol,&uriCol,&grptype,status);

  /* retrieve the number of group members */

  *status = fits_get_num_members(gfptr,&nmembers,status);
	      
  /* 
     loop over all grouping table rows until the member HDU is found 
  */

  for(i = 1; i <= nmembers && *member == 0 && *status == 0; ++i)
    {
      if(xtensionCol != 0)
	{
	  fits_read_col_str(gfptr,xtensionCol,i,1,1,nstr,tmpPtr,&dummy,status);
	  if(fits_strcasecmp(tmpPtr[0],xtension) != 0) continue;
	}
	  
      if(extnameCol  != 0)
	{
	  fits_read_col_str(gfptr,extnameCol,i,1,1,nstr,tmpPtr,&dummy,status);
	  if(fits_strcasecmp(tmpPtr[0],extname) != 0) continue;
	}
	  
      if(extverCol   != 0)
	{
	  fits_read_col_lng(gfptr,extverCol,i,1,1,0,
			    (long*)&mextver,&dummy,status);
	  if(extver != mextver) continue;
	}
      
      /* note we only use postionCol if we have to */

      if(positionCol != 0 && 
	            (grptype == GT_ID_POS || grptype == GT_ID_POS_URI))
	{
	  fits_read_col_int(gfptr,positionCol,i,1,1,0,
			    &mposition,&dummy,status);
	  if(position != mposition) continue;
	}
      
      /*
	if no location string was passed to the function then assume that
	the calling application does not wish to use it as a comparision
	critera ==> if we got this far then we have a match
      */

      if(location == NULL)
	{
	  ffpmsg("NULL Location string given ==> ingore location (ffgmf)");
	  *member = i;
	  continue;
	}

      /*
	if the grouping table MEMBER_LOCATION column exists then read the
	location URL for the member, else set the location string to
	a zero-length string for subsequent comparisions
      */

      if(locationCol != 0)
	{
	  fits_read_col_str(gfptr,locationCol,i,1,1,nstr,tmpPtr,&dummy,status);
	  strcpy(mbrLocation1,tmpPtr[0]);
	  *mbrLocation2 = 0;
	}
      else
	*mbrLocation1 = 0;

      /* 
	 if the member location string from the grouping table is zero 
	 length (either implicitly or explicitly) then assume that the 
	 member HDU is in the same file as the grouping table HDU; retrieve
	 the possible URL values of the grouping table HDU file 
       */

      if(*mbrLocation1 == 0)
	{
	  /* retrieve the possible URLs of the grouping table file */
	  *status = fits_get_url(gfptr,mbrLocation1,mbrLocation2,NULL,NULL,
				 NULL,status);

	  /* if non-NULL, make sure the first URL is absolute or a full path */
	  if(*mbrLocation1 != 0 && !fits_is_url_absolute(mbrLocation1) &&
	     *mbrLocation1 != '/')
	    {
	      fits_get_cwd(cwd,status);
              if (strlen(cwd)+strlen(mbrLocation1)+1 > 
                        FLEN_FILENAME-1)
              {
                 ffpmsg("cwd and member locations are too long (ffgmf)");
                 *status = URL_PARSE_ERROR;
                 continue;
              }
	      strcat(cwd,"/");
	      strcat(cwd,mbrLocation1);
	      fits_clean_url(cwd,mbrLocation1,status);
	    }

	  /* if non-NULL, make sure the first URL is absolute or a full path */
	  if(*mbrLocation2 != 0 && !fits_is_url_absolute(mbrLocation2) &&
	     *mbrLocation2 != '/')
	    {
	      fits_get_cwd(cwd,status);
              if (strlen(cwd)+strlen(mbrLocation2)+1 > 
                        FLEN_FILENAME-1)
              {
                 ffpmsg("cwd and member locations are too long (ffgmf)");
                 *status = URL_PARSE_ERROR;
                 continue;
              }
	      strcat(cwd,"/");
	      strcat(cwd,mbrLocation2);
	      fits_clean_url(cwd,mbrLocation2,status);
	    }
	}

      /*
	if the member location was specified, then make sure that it is
	either an absolute URL or specifies a full path
      */

      else if(!fits_is_url_absolute(mbrLocation1) && *mbrLocation1 != '/')
	{
	  strcpy(mbrLocation2,mbrLocation1);

	  /* get the possible URLs for the grouping table file */
	  *status = fits_get_url(gfptr,grpLocation1,grpLocation2,NULL,NULL,
				 NULL,status);
	  
	  if(*grpLocation1 != 0)
	    {
	      /* make sure the first grouping table URL is absolute */
	      if(!fits_is_url_absolute(grpLocation1) && *grpLocation1 != '/')
		{
		  fits_get_cwd(cwd,status);
                  if (strlen(cwd)+strlen(grpLocation1)+1 > 
                            FLEN_FILENAME-1)
                  {
                     ffpmsg("cwd and group locations are too long (ffgmf)");
                     *status = URL_PARSE_ERROR;
                     continue;
                  }
		  strcat(cwd,"/");
		  strcat(cwd,grpLocation1);
		  fits_clean_url(cwd,grpLocation1,status);
		}
	      
	      /* create an absoute URL for the member */

	      fits_relurl2url(grpLocation1,mbrLocation1,mbrLocation3,status);
	      
	      /* 
		 if URL construction succeeded then copy it to the
		 first location string; else set the location string to 
		 empty
	      */

	      if(*status == 0)
		{
		  strcpy(mbrLocation1,mbrLocation3);
		}

	      else if(*status == URL_PARSE_ERROR)
		{
		  *status       = 0;
		  *mbrLocation1 = 0;
		}
	    }
	  else
	    *mbrLocation1 = 0;

	  if(*grpLocation2 != 0)
	    {
	      /* make sure the second grouping table URL is absolute */
	      if(!fits_is_url_absolute(grpLocation2) && *grpLocation2 != '/')
		{
		  fits_get_cwd(cwd,status);
                  if (strlen(cwd)+strlen(grpLocation2)+1 > 
                            FLEN_FILENAME-1)
                  {
                     ffpmsg("cwd and group locations are too long (ffgmf)");
                     *status = URL_PARSE_ERROR;
                     continue;
                  }
		  strcat(cwd,"/");
		  strcat(cwd,grpLocation2);
		  fits_clean_url(cwd,grpLocation2,status);
		}
	      
	      /* create an absolute URL for the member */

	      fits_relurl2url(grpLocation2,mbrLocation2,mbrLocation3,status);
	      
	      /* 
		 if URL construction succeeded then copy it to the
		 second location string; else set the location string to 
		 empty
	      */

	      if(*status == 0)
		{
		  strcpy(mbrLocation2,mbrLocation3);
		}

	      else if(*status == URL_PARSE_ERROR)
		{
		  *status       = 0;
		  *mbrLocation2 = 0;
		}
	    }
	  else
	    *mbrLocation2 = 0;
	}

      /*
	compare the passed member HDU file location string with the
	(possibly two) member location strings to see if there is a match
       */

      if(strcmp(mbrLocation1,tmpLocation) != 0 && 
	 strcmp(mbrLocation2,tmpLocation) != 0   ) continue;
  
      /* if we made it this far then a match to the member HDU was found */
      
      *member = i;
    }

  /* if a match was not found then set the return status code */

  if(*member == 0 && *status == 0) 
    {
      *status = MEMBER_NOT_FOUND;
      ffpmsg("Cannot find specified member HDU (ffgmf)");
    }

  return(*status);
}

/*--------------------------------------------------------------------------
                        Recursive Group Functions
  --------------------------------------------------------------------------*/
int ffgtrmr(fitsfile   *gfptr,  /* FITS file pointer to group               */
	    HDUtracker *HDU,    /* list of processed HDUs                   */
	    int        *status) /* return status code                       */
	    
/*
  recursively remove a grouping table and all its members. Each member of
  the grouping table pointed to by gfptr it processed. If the member is itself
  a grouping table then ffgtrmr() is recursively called to process all
  of its members. The HDUtracker struct *HDU is used to make sure a member
  is not processed twice, thus avoiding an infinite loop (e.g., a grouping
  table contains itself as a member).
*/

{
  int i;
  int hdutype;

  long nmembers = 0;

  char keyvalue[FLEN_VALUE];
  char comment[FLEN_COMMENT];
  
  fitsfile *mfptr = NULL;


  if(*status != 0) return(*status);

  /* get the number of members contained by this grouping table */

  *status = fits_get_num_members(gfptr,&nmembers,status);

  /* loop over all group members and delete them */

  for(i = nmembers; i > 0 && *status == 0; --i)
    {
      /* open the member HDU */

      *status = fits_open_member(gfptr,i,&mfptr,status);

      /* if the member cannot be opened then just skip it and continue */

      if(*status == MEMBER_NOT_FOUND) 
	{
	  *status = 0;
	  continue;
	}

      /* Any other error is a reason to abort */
      
      if(*status != 0) continue;

      /* add the member HDU to the HDUtracker struct */

      *status = fftsad(mfptr,HDU,NULL,NULL);

      /* status == HDU_ALREADY_TRACKED ==> HDU has already been processed */

      if(*status == HDU_ALREADY_TRACKED) 
	{
	  *status = 0;
	  fits_close_file(mfptr,status);
	  continue;
	}
      else if(*status != 0) continue;

      /* determine if the member HDU is itself a grouping table */

      *status = fits_read_key_str(mfptr,"EXTNAME",keyvalue,comment,status);

      /* if no EXTNAME is found then the HDU cannot be a grouping table */ 

      if(*status == KEY_NO_EXIST) 
	{
	  *status     = 0;
	  keyvalue[0] = 0;
	}
      prepare_keyvalue(keyvalue);

      /* Any other error is a reason to abort */
      
      if(*status != 0) continue;

      /* 
	 if the EXTNAME == GROUPING then the member is a grouping table 
	 and we must call ffgtrmr() to process its members
      */

      if(fits_strcasecmp(keyvalue,"GROUPING") == 0)
	  *status = ffgtrmr(mfptr,HDU,status);  

      /* 
	 unlink all the grouping tables that contain this HDU as a member 
	 and then delete the HDU (if not a PHDU)
      */

      if(fits_get_hdu_num(mfptr,&hdutype) == 1)
	      *status = ffgmul(mfptr,1,status);
      else
	  {
	      *status = ffgmul(mfptr,0,status);
	      *status = fits_delete_hdu(mfptr,&hdutype,status);
	  }

      /* close the fitsfile pointer */

      fits_close_file(mfptr,status);
    }

  return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgtcpr(fitsfile   *infptr,  /* input FITS file pointer                 */
	    fitsfile   *outfptr, /* output FITS file pointer                */
	    int         cpopt,   /* code specifying copy options:
				    OPT_GCP_GPT (0) ==> cp only grouping table
				    OPT_GCP_ALL (2) ==> recusrively copy 
				    members and their members (if groups)   */
	    HDUtracker *HDU,     /* list of already copied HDUs             */
	    int        *status)  /* return status code                      */

/*
  copy a Group to a new FITS file. If the cpopt parameter is set to 
  OPT_GCP_GPT (copy grouping table only) then the existing members have their 
  GRPIDn and GRPLCn keywords updated to reflect the existance of the new group,
  since they now belong to another group. If cpopt is set to OPT_GCP_ALL 
  (copy grouping table and members recursively) then the original members are 
  not updated; the new grouping table is modified to include only the copied 
  member HDUs and not the original members.

  Note that this function is recursive. When copt is OPT_GCP_ALL it will call
  itself whenever a member HDU of the current grouping table is itself a
  grouping table (i.e., EXTNAME = 'GROUPING').
*/

{

  int i;
  int nexclude     = 8;
  int hdutype      = 0;
  int groupHDUnum  = 0;
  int numkeys      = 0;
  int keypos       = 0;
  int startSearch  = 0;
  int newPosition  = 0;

  long nmembers    = 0;
  long tfields     = 0;
  long newTfields  = 0;

  char keyword[FLEN_KEYWORD];
  char keyvalue[FLEN_VALUE];
  char card[FLEN_CARD];
  char comment[FLEN_CARD];
  char *tkeyvalue;

  char *includeList[] = {"*"};
  char *excludeList[] = {"EXTNAME","EXTVER","GRPNAME","GRPID#","GRPLC#",
			 "THEAP","TDIM#","T????#"};

  fitsfile *mfptr = NULL;


  if(*status != 0) return(*status);

  do
    {
      /*
	create a new grouping table in the FITS file pointed to by outptr
      */

      *status = fits_get_num_members(infptr,&nmembers,status);

      *status = fits_read_key_str(infptr,"GRPNAME",keyvalue,card,status);

      if(*status == KEY_NO_EXIST)
	{
	  keyvalue[0] = 0;
	  *status     = 0;
	}
      prepare_keyvalue(keyvalue);

      *status = fits_create_group(outfptr,keyvalue,GT_ID_ALL_URI,status);
     
      /* save the new grouping table's HDU position for future use */

      fits_get_hdu_num(outfptr,&groupHDUnum);

      /* update the HDUtracker struct with the grouping table's new position */
      
      *status = fftsud(infptr,HDU,groupHDUnum,NULL);

      /*
	Now populate the copied grouping table depending upon the 
	copy option parameter value
      */

      switch(cpopt)
	{

	  /*
	    for the "copy grouping table only" option we only have to
	    add the members of the original grouping table to the new
	    grouping table
	  */

	case OPT_GCP_GPT:

	  for(i = 1; i <= nmembers && *status == 0; ++i)
	    {
	      *status = fits_open_member(infptr,i,&mfptr,status);
	      *status = fits_add_group_member(outfptr,mfptr,0,status);

	      fits_close_file(mfptr,status);
	      mfptr = NULL;
	    }

	  break;

	case OPT_GCP_ALL:
      
	  /*
	    for the "copy the entire group" option
 	  */

	  /* loop over all the grouping table members */

	  for(i = 1; i <= nmembers && *status == 0; ++i)
	    {
	      /* open the ith member */

	      *status = fits_open_member(infptr,i,&mfptr,status);

	      if(*status != 0) continue;

	      /* add it to the HDUtracker struct */

	      *status = fftsad(mfptr,HDU,&newPosition,NULL);

	      /* if already copied then just add the member to the group */

	      if(*status == HDU_ALREADY_TRACKED)
		{
		  *status = 0;
		  *status = fits_add_group_member(outfptr,NULL,newPosition,
						  status);
		  fits_close_file(mfptr,status);
                  mfptr = NULL;
		  continue;
		}
	      else if(*status != 0) continue;

	      /* see if the member is a grouping table */

	      *status = fits_read_key_str(mfptr,"EXTNAME",keyvalue,card,
					  status);

	      if(*status == KEY_NO_EXIST)
		{
		  keyvalue[0] = 0;
		  *status     = 0;
		}
	      prepare_keyvalue(keyvalue);

	      /*
		if the member is a grouping table then copy it and all of
		its members using ffgtcpr(), else copy it using
		fits_copy_member(); the outptr will point to the newly
		copied member upon return from both functions
	      */

	      if(fits_strcasecmp(keyvalue,"GROUPING") == 0)
		*status = ffgtcpr(mfptr,outfptr,OPT_GCP_ALL,HDU,status);
	      else
		*status = fits_copy_member(infptr,outfptr,i,OPT_MCP_NADD,
					   status);

	      /* retrieve the position of the newly copied member */

	      fits_get_hdu_num(outfptr,&newPosition);

	      /* update the HDUtracker struct with member's new position */
	      
	      if(fits_strcasecmp(keyvalue,"GROUPING") != 0)
		*status = fftsud(mfptr,HDU,newPosition,NULL);

	      /* move the outfptr back to the copied grouping table HDU */

	      *status = fits_movabs_hdu(outfptr,groupHDUnum,&hdutype,status);

	      /* add the copied member HDU to the copied grouping table */

	      *status = fits_add_group_member(outfptr,NULL,newPosition,status);

	      /* close the mfptr pointer */

	      fits_close_file(mfptr,status);
	      mfptr = NULL;
	    }

	  break;

	default:
	  
	  *status = BAD_OPTION;
	  ffpmsg("Invalid value specified for cmopt parameter (ffgtcpr)");
	  break;
	}

      if(*status != 0) continue; 

      /* 
	 reposition the outfptr to the grouping table so that the grouping
	 table is the CHDU upon return to the calling function
      */

      fits_movabs_hdu(outfptr,groupHDUnum,&hdutype,status);

      /*
	 copy all auxiliary keyword records from the original grouping table
	 to the new grouping table; they are copied in their original order
	 and inserted just before the TTYPE1 keyword record
      */

      *status = fits_read_card(outfptr,"TTYPE1",card,status);
      *status = fits_get_hdrpos(outfptr,&numkeys,&keypos,status);
      --keypos;

      startSearch = 8;

      while(*status == 0)
	{
	  ffgrec(infptr,startSearch,card,status);

	  *status = fits_find_nextkey(infptr,includeList,1,excludeList,
				      nexclude,card,status);

	  *status = fits_get_hdrpos(infptr,&numkeys,&startSearch,status);

	  --startSearch;
	  /* SPR 1738 */
	  if (strncmp(card,"GRPLC",5)) {
	    /* Not going to be a long string so we're ok */
	    *status = fits_insert_record(outfptr,keypos,card,status);
	  } else {
	    /* We could have a long string */
	    *status = fits_read_record(infptr,startSearch,card,status);
	    card[9] = '\0';
	    *status = fits_read_key_longstr(infptr,card,&tkeyvalue,comment,
					    status);
	    if (0 == *status) {
	      fits_insert_key_longstr(outfptr,card,tkeyvalue,comment,status);
	      fits_write_key_longwarn(outfptr,status);
	      free(tkeyvalue);
	    }
	  }
	  
	  ++keypos;
	}
      
	  
      if(*status == KEY_NO_EXIST) 
	*status = 0;
      else if(*status != 0) continue;

      /*
	 search all the columns of the original grouping table and copy
	 those to the new grouping table that were not part of the grouping
	 convention. Note that is legal to have additional columns in a
	 grouping table. Also note that the order of the columns may
	 not be the same in the original and copied grouping table.
      */

      /* retrieve the number of columns in the original and new group tables */

      *status = fits_read_key_lng(infptr,"TFIELDS",&tfields,card,status);
      *status = fits_read_key_lng(outfptr,"TFIELDS",&newTfields,card,status);

      for(i = 1; i <= tfields; ++i)
	{
	  snprintf(keyword,FLEN_KEYWORD,"TTYPE%d",i);
	  *status = fits_read_key_str(infptr,keyword,keyvalue,card,status);
	  
	  if(*status == KEY_NO_EXIST)
	    {
	      *status = 0;
              keyvalue[0] = 0;
	    }
	  prepare_keyvalue(keyvalue);

	  if(fits_strcasecmp(keyvalue,"MEMBER_XTENSION") != 0 &&
	     fits_strcasecmp(keyvalue,"MEMBER_NAME")     != 0 &&
	     fits_strcasecmp(keyvalue,"MEMBER_VERSION")  != 0 &&
	     fits_strcasecmp(keyvalue,"MEMBER_POSITION") != 0 &&
	     fits_strcasecmp(keyvalue,"MEMBER_LOCATION") != 0 &&
	     fits_strcasecmp(keyvalue,"MEMBER_URI_TYPE") != 0   )
	    {
 
	      /* SPR 3956, add at the end of the table */
	      *status = fits_copy_col(infptr,outfptr,i,newTfields+1,1,status);
	      ++newTfields;
	    }
	}

    }while(0);

  if(mfptr != NULL) 
    {
      fits_close_file(mfptr,status);
    }

  return(*status);
}

/*--------------------------------------------------------------------------
                HDUtracker struct manipulation functions
  --------------------------------------------------------------------------*/
int fftsad(fitsfile   *mfptr,       /* pointer to an member HDU             */
	   HDUtracker *HDU,         /* pointer to an HDU tracker struct     */
	   int        *newPosition, /* new HDU position of the member HDU   */
	   char       *newFileName) /* file containing member HDU           */

/*
  add an HDU to the HDUtracker struct pointed to by HDU. The HDU is only 
  added if it does not already reside in the HDUtracker. If it already
  resides in the HDUtracker then the new HDU postion and file name are
  returned in  newPosition and newFileName (if != NULL)
*/

{
  int i;
  int hdunum;
  int status = 0;

  char filename1[FLEN_FILENAME];
  char filename2[FLEN_FILENAME];

  do
    {
      /* retrieve the HDU's position within the FITS file */

      fits_get_hdu_num(mfptr,&hdunum);
      
      /* retrieve the HDU's file name */
      
      status = fits_file_name(mfptr,filename1,&status);
      
      /* parse the file name and construct the "standard" URL for it */
      
      status = ffrtnm(filename1,filename2,&status);
      
      /* 
	 examine all the existing HDUs in the HDUtracker an see if this HDU
	 has already been registered
      */

      for(i = 0; 
       i < HDU->nHDU &&  !(HDU->position[i] == hdunum 
			   && strcmp(HDU->filename[i],filename2) == 0);
	  ++i);

      if(i != HDU->nHDU) 
	{
	  status = HDU_ALREADY_TRACKED;
	  if(newPosition != NULL) *newPosition = HDU->newPosition[i];
	  if(newFileName != NULL) strcpy(newFileName,HDU->newFilename[i]);
	  continue;
	}

      if(HDU->nHDU == MAX_HDU_TRACKER) 
	{
	  status = TOO_MANY_HDUS_TRACKED;
	  continue;
	}

      HDU->filename[i] = (char*) malloc(FLEN_FILENAME * sizeof(char));

      if(HDU->filename[i] == NULL)
	{
	  status = MEMORY_ALLOCATION;
	  continue;
	}

      HDU->newFilename[i] = (char*) malloc(FLEN_FILENAME * sizeof(char));

      if(HDU->newFilename[i] == NULL)
	{
	  status = MEMORY_ALLOCATION;
	  free(HDU->filename[i]);
	  continue;
	}

      HDU->position[i]    = hdunum;
      HDU->newPosition[i] = hdunum;

      strcpy(HDU->filename[i],filename2);
      strcpy(HDU->newFilename[i],filename2);
 
       ++(HDU->nHDU);

    }while(0);

  return(status);
}
/*--------------------------------------------------------------------------*/
int fftsud(fitsfile   *mfptr,       /* pointer to an member HDU             */
	   HDUtracker *HDU,         /* pointer to an HDU tracker struct     */
	   int         newPosition, /* new HDU position of the member HDU   */
	   char       *newFileName) /* file containing member HDU           */

/*
  update the HDU information in the HDUtracker struct pointed to by HDU. The 
  HDU to update is pointed to by mfptr. If non-zero, the value of newPosition
  is used to update the HDU->newPosition[] value for the mfptr, and if
  non-NULL the newFileName value is used to update the HDU->newFilename[]
  value for mfptr.
*/

{
  int i;
  int hdunum;
  int status = 0;

  char filename1[FLEN_FILENAME];
  char filename2[FLEN_FILENAME];


  /* retrieve the HDU's position within the FITS file */
  
  fits_get_hdu_num(mfptr,&hdunum);
  
  /* retrieve the HDU's file name */
  
  status = fits_file_name(mfptr,filename1,&status);
  
  /* parse the file name and construct the "standard" URL for it */
      
  status = ffrtnm(filename1,filename2,&status);

  /* 
     examine all the existing HDUs in the HDUtracker an see if this HDU
     has already been registered
  */

  for(i = 0; i < HDU->nHDU && 
      !(HDU->position[i] == hdunum && strcmp(HDU->filename[i],filename2) == 0);
      ++i);

  /* if previously registered then change newPosition and newFileName */

  if(i != HDU->nHDU) 
    {
      if(newPosition  != 0) HDU->newPosition[i] = newPosition;
      if(newFileName  != NULL) 
	{
	  strcpy(HDU->newFilename[i],newFileName);
	}
    }
  else
    status = MEMBER_NOT_FOUND;
 
  return(status);
}

/*---------------------------------------------------------------------------*/

void prepare_keyvalue(char *keyvalue) /* string containing keyword value     */

/*
  strip off all single quote characters "'" and blank spaces from a keyword
  value retrieved via fits_read_key*() routines

  this is necessary so that a standard comparision of keyword values may
  be made
*/

{

  int i;
  int length;

  /*
    strip off any leading or trailing single quotes (`) and (') from
    the keyword value
  */

  length = strlen(keyvalue) - 1;

  if(keyvalue[0] == '\'' && keyvalue[length] == '\'')
    {
      for(i = 0; i < length - 1; ++i) keyvalue[i] = keyvalue[i+1];
      keyvalue[length-1] = 0;
    }
  
  /*
    strip off any trailing blanks from the keyword value; note that if the
    keyvalue consists of nothing but blanks then no blanks are stripped
  */

  length = strlen(keyvalue) - 1;

  for(i = 0; i < length && keyvalue[i] == ' '; ++i);

  if(i != length)
    {
      for(i = length; i >= 0 && keyvalue[i] == ' '; --i) keyvalue[i] = '\0';
    }
}

/*---------------------------------------------------------------------------
        Host dependent directory path to/from URL functions
  --------------------------------------------------------------------------*/
int fits_path2url(char *inpath,  /* input file path string                  */
                  int maxlength, /* I max number of chars that can be written
                             to output, including terminating NULL */
		  char *outpath, /* output file path string                 */
		  int  *status)
  /*
     convert a file path into its Unix-style equivelent for URL 
     purposes. Note that this process is platform dependent. This
     function supports Unix, MSDOS/WIN32, VMS and Macintosh platforms. 
     The plaform dependant code is conditionally compiled depending upon
     the setting of the appropriate C preprocessor macros.
   */
{
  char buff[FLEN_FILENAME];

#if defined(WINNT) || defined(__WINNT__)

  /*
    Microsoft Windows NT case. We assume input file paths of the form:

    //disk/path/filename

     All path segments may be null, so that a single file name is the
     simplist case.

     The leading "//" becomes a single "/" if present. If no "//" is present,
     then make sure the resulting URL path is relative, i.e., does not
     begin with a "/". In other words, the only way that an absolute URL
     file path may be generated is if the drive specification is given.
  */

  if(*status > 0) return(*status);

  if(inpath[0] == '/')
    {
      strcpy(buff,inpath+1);
    }
  else
    {
      strcpy(buff,inpath);
    }

#elif defined(MSDOS) || defined(__WIN32__) || defined(WIN32)

  /*
     MSDOS or Microsoft windows/NT case. The assumed form of the
     input path is:

     disk:\path\filename

     All path segments may be null, so that a single file name is the
     simplist case.

     All back-slashes '\' become slashes '/'; if the path starts with a
     string of the form "X:" then it is replaced with "/X/"
  */

  int i,j,k;
  int size;
  if(*status > 0) return(*status);

  for(i = 0, j = 0, size = strlen(inpath), buff[0] = 0; 
                                           i < size; j = strlen(buff))
    {
      switch(inpath[i])
	{

	case ':':

	  /*
	     must be a disk desiginator; add a slash '/' at the start of
	     outpath to designate that the path is absolute, then change
	     the colon ':' to a slash '/'
	   */

	  for(k = j; k >= 0; --k) buff[k+1] = buff[k];
	  buff[0] = '/';
	  strcat(buff,"/");
	  ++i;
	  
	  break;

	case '\\':

	  /* just replace the '\' with a '/' IF its not the first character */

	  if(i != 0 && buff[(j == 0 ? 0 : j-1)] != '/')
	    {
	      buff[j] = '/';
	      buff[j+1] = 0;
	    }

	  ++i;

	  break;

	default:

	  /* copy the character from inpath to buff as is */

	  buff[j]   = inpath[i];
	  buff[j+1] = 0;
	  ++i;

	  break;
	}
    }

#elif defined(VMS) || defined(vms) || defined(__vms)

  /*
     VMS case. Assumed format of the input path is:

     node::disk:[path]filename.ext;version

     Any part of the file path may be missing, so that in the simplist
     case a single file name/extension is given.

     all brackets "[", "]" and dots "." become "/"; dashes "-" become "..", 
     all single colons ":" become ":/", all double colons "::" become
     "FILE://"
   */

  int i,j,k;
  int done;
  int size;

  if(*status > 0) return(*status);
     
  /* see if inpath contains a directory specification */

  if(strchr(inpath,']') == NULL) 
    done = 1;
  else
    done = 0;

  for(i = 0, j = 0, size = strlen(inpath), buff[0] = 0; 
                           i < size && j < FLEN_FILENAME - 8; j = strlen(buff))
    {
      switch(inpath[i])
	{

	case ':':

	  /*
	     must be a logical/symbol separator or (in the case of a double
	     colon "::") machine node separator
	   */

	  if(inpath[i+1] == ':')
	    {
	      /* insert a "FILE://" at the start of buff ==> machine given */

	      for(k = j; k >= 0; --k) buff[k+7] = buff[k];
	      strncpy(buff,"FILE://",7);
	      i += 2;
	    }
	  else if(strstr(buff,"FILE://") == NULL)
	    {
	      /* insert a "/" at the start of buff ==> absolute path */

	      for(k = j; k >= 0; --k) buff[k+1] = buff[k];
	      buff[0] = '/';
	      ++i;
	    }
	  else
	    ++i;

	  /* a colon always ==> path separator */

	  strcat(buff,"/");

	  break;
  
	case ']':

	  /* end of directory spec, file name spec begins after this */

	  done = 1;

	  buff[j]   = '/';
	  buff[j+1] = 0;
	  ++i;

	  break;

	case '[':

	  /* 
	     begin directory specification; add a '/' only if the last char 
	     is not '/' 
	  */

	  if(i != 0 && buff[(j == 0 ? 0 : j-1)] != '/')
	    {
	      buff[j]   = '/';
	      buff[j+1] = 0;
	    }

	  ++i;

	  break;

	case '.':

	  /* 
	     directory segment separator or file name/extension separator;
	     we decide which by looking at the value of done
	  */

	  if(!done)
	    {
	    /* must be a directory segment separator */
	      if(inpath[i-1] == '[')
		{
		  strcat(buff,"./");
		  ++j;
		}
	      else
		buff[j] = '/';
	    }
	  else
	    /* must be a filename/extension separator */
	    buff[j] = '.';

	  buff[j+1] = 0;

	  ++i;

	  break;

	case '-':

	  /* 
	     a dash is the same as ".." in Unix speak, but lets make sure
	     that its not part of the file name first!
	   */

	  if(!done)
	    /* must be part of the directory path specification */
	    strcat(buff,"..");
	  else
	    {
	      /* the dash is part of the filename, so just copy it as is */
	      buff[j] = '-';
	      buff[j+1] = 0;
	    }

	  ++i;

	  break;

	default:

	  /* nothing special, just copy the character as is */

	  buff[j]   = inpath[i];
	  buff[j+1] = 0;

	  ++i;

	  break;

	}
    }

  if(j > FLEN_FILENAME - 8)
    {
      *status = URL_PARSE_ERROR;
      ffpmsg("resulting path to URL conversion too big (fits_path2url)");
    }

#elif defined(macintosh)

  /*
     MacOS case. The assumed form of the input path is:

     disk:path:filename

     It is assumed that all paths are absolute with disk and path specified,
     unless no colons ":" are supplied with the string ==> a single file name
     only. All colons ":" become slashes "/", and if one or more colon is 
     encountered then the path is specified as absolute.
  */

  int i,j,k;
  int firstColon;
  int size;

  if(*status > 0) return(*status);

  for(i = 0, j = 0, firstColon = 1, size = strlen(inpath), buff[0] = 0; 
                                                   i < size; j = strlen(buff))
    {
      switch(inpath[i])
	{

	case ':':

	  /*
	     colons imply path separators. If its the first colon encountered
	     then assume that its the disk designator and add a slash to the
	     beginning of the buff string
	   */
	  
	  if(firstColon)
	    {
	      firstColon = 0;

	      for(k = j; k >= 0; --k) buff[k+1] = buff[k];
	      buff[0] = '/';
	    }

	  /* all colons become slashes */

	  strcat(buff,"/");

	  ++i;
	  
	  break;

	default:

	  /* copy the character from inpath to buff as is */

	  buff[j]   = inpath[i];
	  buff[j+1] = 0;

	  ++i;

	  break;
	}
    }

#else 

  /*
     Default Unix case.

     Nothing special to do here except to remove the double or more // and 
     replace them with single /
   */

  int ii = 0;
  int jj = 0;

  if(*status > 0) return(*status);

  while (inpath[ii]) {
      if (inpath[ii] == '/' && inpath[ii+1] == '/') {
	  /* do nothing */
      } else {
	  buff[jj] = inpath[ii];
	  jj++;
      }
      ii++;
  }
  buff[jj] = '\0';
  /* printf("buff is %s\ninpath is %s\n",buff,inpath); */
  /* strcpy(buff,inpath); */

#endif

  /*
    encode all "unsafe" and "reserved" URL characters
  */

  *status = fits_encode_url(buff,maxlength,outpath,status);

  return(*status);
}

/*---------------------------------------------------------------------------*/
int fits_url2path(char *inpath,  /* input file path string  */
		  char *outpath, /* output file path string */
		  int  *status)
  /*
     convert a Unix-style URL into a platform dependent directory path. 
     Note that this process is platform dependent. This
     function supports Unix, MSDOS/WIN32, VMS and Macintosh platforms. Each
     platform dependent code segment is conditionally compiled depending 
     upon the setting of the appropriate C preprocesser macros.
   */
{
  char buff[FLEN_FILENAME];
  int absolute;

#if defined(MSDOS) || defined(__WIN32__) || defined(WIN32)
  char *tmpStr, *saveptr;
#elif defined(VMS) || defined(vms) || defined(__vms)
  int i;
  char *tmpStr, *saveptr;
#elif defined(macintosh)
  char *tmpStr, *saveptr;
#endif

  if(*status != 0) return(*status);

  /*
    make a copy of the inpath so that we can manipulate it
  */

  strcpy(buff,inpath);

  /*
    convert any encoded characters to their unencoded values
  */

  *status = fits_unencode_url(inpath,buff,status);

  /*
    see if the URL is given as absolute w.r.t. the "local" file system
  */

  if(buff[0] == '/') 
    absolute = 1;
  else
    absolute = 0;

#if defined(WINNT) || defined(__WINNT__)

  /*
    Microsoft Windows NT case. We create output paths of the form

    //disk/path/filename

     All path segments but the last may be null, so that a single file name 
     is the simplist case.     
  */

  if(absolute)
    {
      strcpy(outpath,"/");
      strcat(outpath,buff);
    }
  else
    {
      strcpy(outpath,buff);
    }

#elif defined(MSDOS) || defined(__WIN32__) || defined(WIN32)

  /*
     MSDOS or Microsoft windows/NT case. The output path will be of the
     form

     disk:\path\filename

     All path segments but the last may be null, so that a single file name 
     is the simplist case.
  */

  /*
    separate the URL into tokens at each slash '/' and process until
    all tokens have been examined
  */

  for(tmpStr = ffstrtok(buff,"/",&saveptr), outpath[0] = 0;
                                 tmpStr != NULL; tmpStr = ffstrtok(NULL,"/",&saveptr))
    {
      strcat(outpath,tmpStr);

      /* 
	 if the absolute flag is set then process the token as a disk 
	 specification; else just process it as a directory path or filename
      */

      if(absolute)
	{
	  strcat(outpath,":\\");
	  absolute = 0;
	}
      else
	strcat(outpath,"\\");
    }

  /* remove the last "\" from the outpath, it does not belong there */

  outpath[strlen(outpath)-1] = 0;

#elif defined(VMS) || defined(vms) || defined(__vms)

  /*
     VMS case. The output path will be of the form:

     node::disk:[path]filename.ext;version

     Any part of the file path may be missing execpt filename.ext, so that in 
     the simplist case a single file name/extension is given.

     if the path is specified as relative starting with "./" then the first
     part of the VMS path is "[.". If the path is relative and does not start
     with "./" (e.g., "a/b/c") then the VMS path is constructed as
     "[a.b.c]"
   */
     
  /*
    separate the URL into tokens at each slash '/' and process until
    all tokens have been examined
  */

  for(tmpStr = ffstrtok(buff,"/",&saveptr), outpath[0] = 0; 
                                 tmpStr != NULL; tmpStr = ffstrtok(NULL,"/",&saveptr))
    {

      if(fits_strcasecmp(tmpStr,"FILE:") == 0)
	{
	  /* the next token should contain the DECnet machine name */

	  tmpStr = ffstrtok(NULL,"/",&saveptr);
	  if(tmpStr == NULL) continue;

	  strcat(outpath,tmpStr);
	  strcat(outpath,"::");

	  /* set the absolute flag to true for the next token */
	  absolute = 1;
	}

      else if(strcmp(tmpStr,"..") == 0)
	{
	  /* replace all Unix-like ".." with VMS "-" */

	  if(strlen(outpath) == 0) strcat(outpath,"[");
	  strcat(outpath,"-.");
	}

      else if(strcmp(tmpStr,".") == 0 && strlen(outpath) == 0)
	{
	  /*
	    must indicate a relative path specifier
	  */

	  strcat(outpath,"[.");
	}
  
      else if(strchr(tmpStr,'.') != NULL)
	{
	  /* 
	     must be up to the file name; turn the last "." path separator
	     into a "]" and then add the file name to the outpath
	  */
	  
	  i = strlen(outpath);
	  if(i > 0 && outpath[i-1] == '.') outpath[i-1] = ']';

	  strcat(outpath,tmpStr);
	}

      else
	{
	  /*
	    process the token as a a directory path segement
	  */

	  if(absolute)
	    {
	      /* treat the token as a disk specifier */
	      absolute = 0;
	      strcat(outpath,tmpStr);
	      strcat(outpath,":[");
	    }
	  else if(strlen(outpath) == 0)
	    {
	      /* treat the token as the first directory path specifier */
	      strcat(outpath,"[");
	      strcat(outpath,tmpStr);
	      strcat(outpath,".");
	    }
	  else
	    {
	      /* treat the token as an imtermediate path specifier */
	      strcat(outpath,tmpStr);
	      strcat(outpath,".");
	    }
	}
    }

#elif defined(macintosh)

  /*
     MacOS case. The output path will be of the form

     disk:path:filename

     All path segments but the last may be null, so that a single file name 
     is the simplist case.
  */

  /*
    separate the URL into tokens at each slash '/' and process until
    all tokens have been examined
  */

  for(tmpStr = ffstrtok(buff,"/",&saveptr), outpath[0] = 0;
                                 tmpStr != NULL; tmpStr = ffstrtok(NULL,"/",&saveptr))
    {
      strcat(outpath,tmpStr);
      strcat(outpath,":");
    }

  /* remove the last ":" from the outpath, it does not belong there */

  outpath[strlen(outpath)-1] = 0;

#else

  /*
     Default Unix case.

     Nothing special to do here
   */

  strcpy(outpath,buff);

#endif

  return(*status);
}

/****************************************************************************/
int fits_get_cwd(char *cwd,  /* IO current working directory string */
		 int  *status)
  /*
     retrieve the string containing the current working directory absolute
     path in Unix-like URL standard notation. It is assumed that the CWD
     string has a size of at least FLEN_FILENAME.

     Note that this process is platform dependent. This
     function supports Unix, MSDOS/WIN32, VMS and Macintosh platforms. Each
     platform dependent code segment is conditionally compiled depending 
     upon the setting of the appropriate C preprocesser macros.
   */
{

  char buff[FLEN_FILENAME];


  if(*status != 0) return(*status);

#if defined(macintosh)

  /*
     MacOS case. Currently unknown !!!!
  */

  *buff = 0;

#else
  /*
    Good old getcwd() seems to work with all other platforms
  */

  if (!getcwd(buff,FLEN_FILENAME))
  {
     cwd[0]=0;
     ffpmsg("Path and file name too long (fits_get_cwd)");
     return (*status=URL_PARSE_ERROR);
  }

#endif

  /*
    convert the cwd string to a URL standard path string
  */

  fits_path2url(buff,FLEN_FILENAME,cwd,status);

  return(*status);
}

/*---------------------------------------------------------------------------*/
int  fits_get_url(fitsfile *fptr,       /* I ptr to FITS file to evaluate    */
		  char     *realURL,    /* O URL of real FITS file           */
		  char     *startURL,   /* O URL of starting FITS file       */
		  char     *realAccess, /* O true access method of FITS file */
		  char     *startAccess,/* O "official" access of FITS file  */
		  int      *iostate,    /* O can this file be modified?      */
		  int      *status)
/*
  For grouping convention purposes, determine the URL of the FITS file
  associated with the fitsfile pointer fptr. The true access type (file://,
  mem://, shmem://, root://), starting "official" access type, and iostate 
  (0 ==> readonly, 1 ==> readwrite) are also returned.

  It is assumed that the url string has enough room to hold the resulting
  URL, and the the accessType string has enough room to hold the access type.
*/
{
  int i;
  int tmpIOstate = 0;

  char infile[FLEN_FILENAME];
  char outfile[FLEN_FILENAME];
  char tmpStr1[FLEN_FILENAME];
  char tmpStr2[FLEN_FILENAME];
  char tmpStr3[FLEN_FILENAME];
  char tmpStr4[FLEN_FILENAME];
  char *tmpPtr;


  if(*status != 0) return(*status);

  do
    {
      /* 
	 retrieve the member HDU's file name as opened by ffopen() 
	 and parse it into its constitutent pieces; get the currently
	 active driver token too
       */
	  
      *tmpStr1 = *tmpStr2 = *tmpStr3 = *tmpStr4 = 0;

      *status = fits_file_name(fptr,tmpStr1,status);

      *status = ffiurl(tmpStr1,NULL,infile,outfile,NULL,tmpStr2,tmpStr3,
		       tmpStr4,status);

      if((*tmpStr2) || (*tmpStr3) || (*tmpStr4)) tmpIOstate = -1;
 
      *status = ffurlt(fptr,tmpStr3,status);

      strcpy(tmpStr4,tmpStr3);

      *status = ffrtnm(tmpStr1,tmpStr2,status);
      strcpy(tmpStr1,tmpStr2);

      /*
	for grouping convention purposes (only) determine the URL of the
	actual FITS file being used for the given fptr, its true access 
	type (file://, mem://, shmem://, root://) and its iostate (0 ==>
	read only, 1 ==> readwrite)
      */

      /*
	The first set of access types are "simple" in that they do not
	use any redirection to temporary memory or outfiles
       */

      /* standard disk file driver is in use */
      
      if(fits_strcasecmp(tmpStr3,"file://")              == 0)         
	{
	  tmpIOstate = 1;
	  
	  if(strlen(outfile)) strcpy(tmpStr1,outfile);
	  else *tmpStr2 = 0;

	  /*
	    make sure no FILE:// specifier is given in the tmpStr1
	    or tmpStr2 strings; the convention calls for local files
	    to have no access specification
	  */

	  if((tmpPtr = strstr(tmpStr1,"://")) != NULL)
	    {
	      strcpy(infile,tmpPtr+3);
	      strcpy(tmpStr1,infile);
	    }

	  if((tmpPtr = strstr(tmpStr2,"://")) != NULL)
	    {
	      strcpy(infile,tmpPtr+3);
	      strcpy(tmpStr2,infile);
	    }
	}

      /* file stored in conventional memory */
	  
      else if(fits_strcasecmp(tmpStr3,"mem://")          == 0)          
	{
	  if(tmpIOstate < 0)
	    {
	      /* file is a temp mem file only */
	      ffpmsg("cannot make URL from temp MEM:// file (fits_get_url)");
	      *status = URL_PARSE_ERROR;
	    }
	  else
	    {
	      /* file is a "perminate" mem file for this process */
	      tmpIOstate = 1;
	      *tmpStr2 = 0;
	    }
	}

      /* file stored in conventional memory */
 
     else if(fits_strcasecmp(tmpStr3,"memkeep://")      == 0)      
	{
	  strcpy(tmpStr3,"mem://");
	  *tmpStr4 = 0;
	  *tmpStr2 = 0;
	  tmpIOstate = 1;
	}

      /* file residing in shared memory */

      else if(fits_strcasecmp(tmpStr3,"shmem://")        == 0)        
	{
	  *tmpStr4   = 0;
	  *tmpStr2   = 0;
	  tmpIOstate = 1;
	}
      
      /* file accessed via the ROOT network protocol */

      else if(fits_strcasecmp(tmpStr3,"root://")         == 0)         
	{
	  *tmpStr4   = 0;
	  *tmpStr2   = 0;
	  tmpIOstate = 1;
	}
  
      /*
	the next set of access types redirect the contents of the original
	file to an special outfile because the original could not be
	directly modified (i.e., resides on the network, was compressed).
	In these cases the URL string takes on the value of the OUTFILE,
	the access type becomes file://, and the iostate is set to 1 (can
	read/write to the file).
      */

      /* compressed file uncompressed and written to disk */

      else if(fits_strcasecmp(tmpStr3,"compressfile://") == 0) 
	{
	  strcpy(tmpStr1,outfile);
	  strcpy(tmpStr2,infile);
	  strcpy(tmpStr3,"file://");
	  strcpy(tmpStr4,"file://");
	  tmpIOstate = 1;
	}

      /* HTTP accessed file written locally to disk */

      else if(fits_strcasecmp(tmpStr3,"httpfile://")     == 0)     
	{
	  strcpy(tmpStr1,outfile);
	  strcpy(tmpStr3,"file://");
	  strcpy(tmpStr4,"http://");
	  tmpIOstate = 1;
	}
      
      /* FTP accessd file written locally to disk */

      else if(fits_strcasecmp(tmpStr3,"ftpfile://")      == 0)      
	{
	  strcpy(tmpStr1,outfile);
	  strcpy(tmpStr3,"file://");
	  strcpy(tmpStr4,"ftp://");
	  tmpIOstate = 1;
	}
      
      /* file from STDIN written to disk */

      else if(fits_strcasecmp(tmpStr3,"stdinfile://")    == 0)    
	{
	  strcpy(tmpStr1,outfile);
	  strcpy(tmpStr3,"file://");
	  strcpy(tmpStr4,"stdin://");
	  tmpIOstate = 1;
	}

      /* 
	 the following access types use memory resident files as temporary
	 storage; they cannot be modified or be made group members for 
	 grouping conventions purposes, but their original files can be.
	 Thus, their tmpStr3s are reset to mem://, their iostate
	 values are set to 0 (for no-modification), and their URL string
	 values remain set to their original values
       */

      /* compressed disk file uncompressed into memory */

      else if(fits_strcasecmp(tmpStr3,"compress://")     == 0)     
	{
	  *tmpStr1 = 0;
	  strcpy(tmpStr2,infile);
	  strcpy(tmpStr3,"mem://");
	  strcpy(tmpStr4,"file://");
	  tmpIOstate = 0;
	}
      
      /* HTTP accessed file transferred into memory */

      else if(fits_strcasecmp(tmpStr3,"http://")         == 0)         
	{
	  *tmpStr1 = 0;
	  strcpy(tmpStr3,"mem://");
	  strcpy(tmpStr4,"http://");
	  tmpIOstate = 0;
	}
      
      /* HTTP accessed compressed file transferred into memory */

      else if(fits_strcasecmp(tmpStr3,"httpcompress://") == 0) 
	{
	  *tmpStr1 = 0;
	  strcpy(tmpStr3,"mem://");
	  strcpy(tmpStr4,"http://");
	  tmpIOstate = 0;
	}
      
      /* FTP accessed file transferred into memory */
      
      else if(fits_strcasecmp(tmpStr3,"ftp://")          == 0)          
	{
	  *tmpStr1 = 0;
	  strcpy(tmpStr3,"mem://");
	  strcpy(tmpStr4,"ftp://");
	  tmpIOstate = 0;
	}
      
      /* FTP accessed compressed file transferred into memory */

      else if(fits_strcasecmp(tmpStr3,"ftpcompress://")  == 0)  
	{
	  *tmpStr1 = 0;
	  strcpy(tmpStr3,"mem://");
	  strcpy(tmpStr4,"ftp://");
	  tmpIOstate = 0;
	}	
      
      /*
	The last set of access types cannot be used to make a meaningful URL 
	strings from; thus an error is generated
       */

      else if(fits_strcasecmp(tmpStr3,"stdin://")        == 0)        
	{
	  *status = URL_PARSE_ERROR;
	  ffpmsg("cannot make vaild URL from stdin:// (fits_get_url)");
	  *tmpStr1 = *tmpStr2 = 0;
	}

      else if(fits_strcasecmp(tmpStr3,"stdout://")       == 0)       
	{
	  *status = URL_PARSE_ERROR;
	  ffpmsg("cannot make vaild URL from stdout:// (fits_get_url)");
	  *tmpStr1 = *tmpStr2 = 0;
	}

      else if(fits_strcasecmp(tmpStr3,"irafmem://")      == 0)      
	{
	  *status = URL_PARSE_ERROR;
	  ffpmsg("cannot make vaild URL from irafmem:// (fits_get_url)");
	  *tmpStr1 = *tmpStr2 = 0;
	}

      if(*status != 0) continue;

      /*
	 assign values to the calling parameters if they are non-NULL
      */

      if(realURL != NULL)
	{
	  if(strlen(tmpStr1) == 0)
	    *realURL = 0;
	  else
	    {
	      if((tmpPtr = strstr(tmpStr1,"://")) != NULL)
		{
		  tmpPtr += 3;
		  i = (long)tmpPtr - (long)tmpStr1;
		  strncpy(realURL,tmpStr1,i);
		}
	      else
		{
		  tmpPtr = tmpStr1;
		  i = 0;
		}

	      *status = fits_path2url(tmpPtr,FLEN_FILENAME-i,realURL+i,status);
	    }
	}

      if(startURL != NULL)
	{
	  if(strlen(tmpStr2) == 0)
	    *startURL = 0;
	  else
	    {
	      if((tmpPtr = strstr(tmpStr2,"://")) != NULL)
		{
		  tmpPtr += 3;
		  i = (long)tmpPtr - (long)tmpStr2;
		  strncpy(startURL,tmpStr2,i);
		}
	      else
		{
		  tmpPtr = tmpStr2;
		  i = 0;
		}

	      *status = fits_path2url(tmpPtr,FLEN_FILENAME-i,startURL+i,status);
	    }
	}

      if(realAccess  != NULL)  strcpy(realAccess,tmpStr3);
      if(startAccess != NULL)  strcpy(startAccess,tmpStr4);
      if(iostate     != NULL) *iostate = tmpIOstate;

    }while(0);

  return(*status);
}

/*--------------------------------------------------------------------------
                           URL parse support functions
  --------------------------------------------------------------------------*/

/* simple push/pop/shift/unshift string stack for use by fits_clean_url */
typedef char* grp_stack_data; /* type of data held by grp_stack */

typedef struct grp_stack_item_struct {
  grp_stack_data data; /* value of this stack item */
  struct grp_stack_item_struct* next; /* next stack item */
  struct grp_stack_item_struct* prev; /* previous stack item */
} grp_stack_item;

typedef struct grp_stack_struct {
  size_t stack_size; /* number of items on stack */
  grp_stack_item* top; /* top item */
} grp_stack;

static char* grp_stack_default = NULL; /* initial value for new instances
                                          of grp_stack_data */

/* the following functions implement the group string stack grp_stack */
static void delete_grp_stack(grp_stack** mystack);
static grp_stack_item* grp_stack_append(
  grp_stack_item* last, grp_stack_data data
);
static grp_stack_data grp_stack_remove(grp_stack_item* last);
static grp_stack* new_grp_stack(void);
static grp_stack_data pop_grp_stack(grp_stack* mystack);
static void push_grp_stack(grp_stack* mystack, grp_stack_data data);
static grp_stack_data shift_grp_stack(grp_stack* mystack);
/* static void unshift_grp_stack(grp_stack* mystack, grp_stack_data data); */

int fits_clean_url(char *inURL,  /* I input URL string                      */
		   char *outURL, /* O output URL string                     */
		   int  *status)
/*
  clean the URL by eliminating any ".." or "." specifiers in the inURL
  string, and write the output to the outURL string.

  Note that this function must have a valid Unix-style URL as input; platform
  dependent path strings are not allowed.
 */
{
  grp_stack* mystack; /* stack to hold pieces of URL */
  char* tmp;
  char *saveptr;

  if(*status) return *status;

  mystack = new_grp_stack();
  *outURL = 0;

  do {
    /* handle URL scheme and domain if they exist */
    tmp = strstr(inURL, "://");
    if(tmp) {
      /* there is a URL scheme, so look for the end of the domain too */
      tmp = strchr(tmp + 3, '/');
      if(tmp) {
        /* tmp is now the end of the domain, so
         * copy URL scheme and domain as is, and terminate by hand */
        size_t string_size = (size_t) (tmp - inURL);
        strncpy(outURL, inURL, string_size);
        outURL[string_size] = 0;

        /* now advance the input pointer to just after the domain and go on */
        inURL = tmp;
      } else {
        /* '/' was not found, which means there are no path-like
         * portions, so copy whole inURL to outURL and we're done */
        strcpy(outURL, inURL);
        continue; /* while(0) */
      }
    }

    /* explicitly copy a leading / (absolute path) */
    if('/' == *inURL) strcat(outURL, "/");

    /* now clean the remainder of the inURL. push URL segments onto
     * stack, dealing with .. and . as we go */
    tmp = ffstrtok(inURL, "/",&saveptr); /* finds first / */
    while(tmp) {
      if(!strcmp(tmp, "..")) {
        /* discard previous URL segment, if there was one. if not,
         * add the .. to the stack if this is *not* an absolute path
         * (for absolute paths, leading .. has no effect, so skip it) */
        if(0 < mystack->stack_size) pop_grp_stack(mystack);
        else if('/' != *inURL) push_grp_stack(mystack, tmp);
      } else {
        /* always just skip ., but otherwise add segment to stack */
        if(strcmp(tmp, ".")) push_grp_stack(mystack, tmp);
      }
      tmp = ffstrtok(NULL, "/",&saveptr); /* get the next segment */
    }

    /* stack now has pieces of cleaned URL, so just catenate them
     * onto output string until stack is empty */
    while(0 < mystack->stack_size) {
      tmp = shift_grp_stack(mystack);
      if (strlen(outURL) + strlen(tmp) + 1 > FLEN_FILENAME-1)
      {
         outURL[0]=0;
         ffpmsg("outURL is too long (fits_clean_url)");
         *status = URL_PARSE_ERROR;
         delete_grp_stack(&mystack);
         return *status;         
      }
      strcat(outURL, tmp);
      strcat(outURL, "/");
    }
    outURL[strlen(outURL) - 1] = 0; /* blank out trailing / */
  } while(0);
  delete_grp_stack(&mystack);
  return *status;
}

/* free all stack contents using pop_grp_stack before freeing the
 * grp_stack itself */
static void delete_grp_stack(grp_stack** mystack) {
  if(!mystack || !*mystack) return;
  while((*mystack)->stack_size) pop_grp_stack(*mystack);
  free(*mystack);
  *mystack = NULL;
}

/* append an item to the stack, handling the special case of the first
 * item appended */
static grp_stack_item* grp_stack_append(
  grp_stack_item* last, grp_stack_data data
) {
  /* first create a new stack item, and copy data to it */
  grp_stack_item* new_item = (grp_stack_item*) malloc(sizeof(grp_stack_item));
  new_item->data = data;
  if(last) {
    /* attach this item between the "last" item and its "next" item */
    new_item->next = last->next;
    new_item->prev = last;
    last->next->prev = new_item;
    last->next = new_item;
  } else {
    /* stack is empty, so "next" and "previous" both point back to it */
    new_item->next = new_item;
    new_item->prev = new_item;
  }
  return new_item;
}

/* remove an item from the stack, handling the special case of the last
 * item removed */
static grp_stack_data grp_stack_remove(grp_stack_item* last) {
  grp_stack_data retval = last->data;
  last->prev->next = last->next;
  last->next->prev = last->prev;
  free(last);
  return retval;
}

/* create new stack dynamically, and give it valid initial values */
static grp_stack* new_grp_stack(void) {
  grp_stack* retval = (grp_stack*) malloc(sizeof(grp_stack));
  if(retval) {
    retval->stack_size = 0;
    retval->top = NULL;
  }
  return retval;
}

/* return the value at the top of the stack and remove it, updating
 * stack_size. top->prev becomes the new "top" */
static grp_stack_data pop_grp_stack(grp_stack* mystack) {
  grp_stack_data retval = grp_stack_default;
  if(mystack && mystack->top) {
    grp_stack_item* newtop = mystack->top->prev;
    retval = grp_stack_remove(mystack->top);
    mystack->top = newtop;
    if(0 == --mystack->stack_size) mystack->top = NULL;
  }
  return retval;
}

/* add to the stack after the top element. the added element becomes
 * the new "top" */
static void push_grp_stack(grp_stack* mystack, grp_stack_data data) {
  if(!mystack) return;
  mystack->top = grp_stack_append(mystack->top, data);
  ++mystack->stack_size;
  return;
}

/* return the value at the bottom of the stack and remove it, updating
 * stack_size. "top" pointer is unaffected */
static grp_stack_data shift_grp_stack(grp_stack* mystack) {
  grp_stack_data retval = grp_stack_default;
  if(mystack && mystack->top) {
    retval = grp_stack_remove(mystack->top->next); /* top->next == bottom */
    if(0 == --mystack->stack_size) mystack->top = NULL;
  }
  return retval;
}

/* add to the stack after the top element. "top" is unaffected, except
 * in the special case of an initially empty stack */
/* static void unshift_grp_stack(grp_stack* mystack, grp_stack_data data) {
   if(!mystack) return;
   if(mystack->top) grp_stack_append(mystack->top, data);
   else mystack->top = grp_stack_append(NULL, data);
   ++mystack->stack_size;
   return;
   } */

/*--------------------------------------------------------------------------*/
int fits_url2relurl(char     *refURL, /* I reference URL string             */
		    char     *absURL, /* I absoulute URL string to process  */
		    char     *relURL, /* O resulting relative URL string    */
		    int      *status)
/*
  create a relative URL to the file referenced by absURL with respect to the
  reference URL refURL. The relative URL is returned in relURL.

  Both refURL and absURL must be absolute URL strings; i.e. either begin
  with an access method specification "XXX://" or with a '/' character
  signifiying that they are absolute file paths.

  Note that it is possible to make a relative URL from two input URLs
  (absURL and refURL) that are not compatable. This function does not
  check to see if the resulting relative URL makes any sence. For instance,
  it is impossible to make a relative URL from the following two inputs:

  absURL = ftp://a.b.c.com/x/y/z/foo.fits
  refURL = /a/b/c/ttt.fits

  The resulting relURL will be:

  ../../../ftp://a.b.c.com/x/y/z/foo.fits 

  Which is syntically correct but meaningless. The problem is that a file
  with an access method of ftp:// cannot be expressed a a relative URL to
  a local disk file.
*/

{
  int i,j;
  int refcount,abscount;
  int refsize,abssize;
  int done;


  if(*status != 0) return(*status);

  /* initialize the relative URL string */
  relURL[0] = 0;

  do
    {
      /*
	refURL and absURL must be absolute to process
      */

      if(!(fits_is_url_absolute(refURL) || *refURL == '/') ||
	 !(fits_is_url_absolute(absURL) || *absURL == '/'))
	{
	  *status = URL_PARSE_ERROR;
	  ffpmsg("Cannot make rel. URL from non abs. URLs (fits_url2relurl)");
	  continue;
	}

      /* determine the size of the refURL and absURL strings */

      refsize = strlen(refURL);
      abssize = strlen(absURL);

      /* process the two URL strings and build the relative URL between them */
		

      for(done = 0, refcount = 0, abscount = 0; 
	  !done && refcount < refsize && abscount < abssize; 
	  ++refcount, ++abscount)
	{
	  for(; abscount < abssize && absURL[abscount] == '/'; ++abscount);
	  for(; refcount < refsize && refURL[refcount] == '/'; ++refcount);

	  /* find the next path segment in absURL */ 
	  for(i = abscount; absURL[i] != '/' && i < abssize; ++i);
	  
	  /* find the next path segment in refURL */
	  for(j = refcount; refURL[j] != '/' && j < refsize; ++j);
	  
	  /* do the two path segments match? */
	  if(i == j && 
	     strncmp(absURL+abscount, refURL+refcount,i-refcount) == 0)
	    {
	      /* they match, so ignore them and continue */
	      abscount = i; refcount = j;
	      continue;
	    }
	  
	  /* We found a difference in the paths in refURL and absURL.
	     For every path segment remaining in the refURL string, append
	     a "../" path segment to the relataive URL relURL.
	  */

	  for(j = refcount; j < refsize; ++j)
	    if(refURL[j] == '/') 
            {
               if (strlen(relURL)+3 > FLEN_FILENAME-1)
               {
	          *status = URL_PARSE_ERROR;
	          ffpmsg("relURL too long (fits_url2relurl)");
	          return (*status);
               }
               strcat(relURL,"../");
            }
	  
	  /* copy all remaining characters of absURL to the output relURL */

          if (strlen(relURL) + strlen(absURL+abscount) > FLEN_FILENAME-1)
          {
	     *status = URL_PARSE_ERROR;
	     ffpmsg("relURL too long (fits_url2relurl)");
	     return (*status);
          }
	  strcat(relURL,absURL+abscount);
	  
	  /* we are done building the relative URL */
	  done = 1;
	}

    }while(0);

  return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_relurl2url(char     *refURL, /* I reference URL string             */
		    char     *relURL, /* I relative URL string to process   */
		    char     *absURL, /* O absolute URL string              */
		    int      *status)
/*
  create an absolute URL from a relative url and a reference URL. The 
  reference URL is given by the FITS file pointed to by fptr.

  The construction of the absolute URL from the partial and reference URl
  is performed using the rules set forth in:
 
  http://www.w3.org/Addressing/URL/URL_TOC.html
  and
  http://www.w3.org/Addressing/URL/4_3_Partial.html

  Note that the relative URL string relURL must conform to the Unix-like
  URL syntax; host dependent partial URL strings are not allowed.
*/
{
  int i;

  char tmpStr[FLEN_FILENAME];

  char *tmpStr1, *tmpStr2;


  if(*status != 0) return(*status);
  
  do
    {

      /*
	make a copy of the reference URL string refURL for parsing purposes
      */

      if (strlen(refURL) > FLEN_FILENAME-1)
      {
         absURL[0]=0;
         ffpmsg("ref URL is too long (fits_relurl2url)");
         *status = URL_PARSE_ERROR;
         continue;
      }
      strcpy(tmpStr,refURL);

      /*
	if the reference file has an access method of mem:// or shmem://
	then we cannot use it as the basis of an absolute URL construction
	for a partial URL
      */
	  
      if(fits_strncasecmp(tmpStr,"MEM:",4)   == 0 ||
                	                fits_strncasecmp(tmpStr,"SHMEM:",6) == 0)
	{
	  ffpmsg("ref URL has access mem:// or shmem:// (fits_relurl2url)");
	  ffpmsg("   cannot construct full URL from a partial URL and ");
	  ffpmsg("   MEM/SHMEM base URL");
	  *status = URL_PARSE_ERROR;
	  continue;
	}

      if(relURL[0] != '/')
	{
	  /*
	    just append the relative URL string to the reference URL
	    string (minus the reference URL file name) to form the 
	    absolute URL string
	  */
	      
	  tmpStr1 = strrchr(tmpStr,'/');
	  
	  if(tmpStr1 != NULL) tmpStr1[1] = 0;
	  else                tmpStr[0]  = 0;
	  
          if (strlen(tmpStr)+strlen(relURL) > FLEN_FILENAME-1)
          {
              absURL[0]=0;
              ffpmsg("rel + ref URL is too long (fits_relurl2url)");
              *status = URL_PARSE_ERROR;
              continue;
          }
	  strcat(tmpStr,relURL);
	}
      else
	{
	  /*
	    have to parse the refURL string for the first occurnace of the 
	    same number of '/' characters as contained in the beginning of
	    location that is not followed by a greater number of consective 
	    '/' charaters (yes, that is a confusing statement); this is the 
	    location in the refURL string where the relURL string is to
	    be appended to form the new absolute URL string
	   */
	  
	  /*
	    first, build up a slash pattern string that has one more
	    slash in it than the starting slash pattern of the
	    relURL string
	  */
	  
	  strcpy(absURL,"/");
	  
	  for(i = 0; relURL[i] == '/'; ++i) 
          {
             if (strlen(absURL) + 1 > FLEN_FILENAME-1)
             {
                 absURL[0]=0;
                 ffpmsg("abs URL is too long (fits_relurl2url)");
                 *status = URL_PARSE_ERROR;
                 return (*status);
             }
             strcat(absURL,"/");
          }
	  
	  /*
	    loop over the refURL string until the slash pattern stored
	    in absURL is no longer found
	  */

	  for(tmpStr1 = tmpStr, i = strlen(absURL); 
	      (tmpStr2 = strstr(tmpStr1,absURL)) != NULL;
	      tmpStr1 = tmpStr2 + i);
	  
	  /* reduce the slash pattern string by one slash */
	  
	  absURL[i-1] = 0;
	  
	  /* 
	     search for the slash pattern in the remaining portion
	     of the refURL string
	  */

	  tmpStr2 = strstr(tmpStr1,absURL);
	  
	  /* if no slash pattern match was found */
	  
	  if(tmpStr2 == NULL)
	    {
	      /* just strip off the file name from the refURL  */
	      
	      tmpStr2 = strrchr(tmpStr1,'/');
	      
	      if(tmpStr2 != NULL) tmpStr2[0] = 0;
	      else                tmpStr[0]  = 0;
	    }
	  else
	    {
	      /* set a string terminator at the slash pattern match */
	      
	      *tmpStr2 = 0;
	    }
	  
	  /* 
	    conatenate the relURL string to the refURL string to form
	    the absURL
	   */

          if (strlen(tmpStr)+strlen(relURL) > FLEN_FILENAME-1)
          {
              absURL[0]=0;
              ffpmsg("rel + ref URL is too long (fits_relurl2url)");
              *status = URL_PARSE_ERROR;
              continue;
          }
	  strcat(tmpStr,relURL);
	}

      /*
	normalize the absURL by removing any ".." or "." specifiers
	in the string
      */

      *status = fits_clean_url(tmpStr,absURL,status);

    }while(0);

  return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_encode_url(char *inpath,  /* I URL  to be encoded                  */
                    int maxlength, /* I max number of chars that may be copied
                               to outpath, including terminating NULL. */ 
		    char *outpath, /* O output encoded URL                  */
		    int *status)
     /*
       encode all URL "unsafe" and "reserved" characters using the "%XX"
       convention, where XX stand for the two hexidecimal digits of the
       encode character's ASCII code.

       Note that the outpath length, as specified by the maxlength argument,
       should be at least as large as inpath and preferably larger (to hold
       any characters that need encoding).  If more than maxlength chars are 
       required for outpath, including the terminating NULL, outpath will
       be set to size 0 and an error status will be returned.
       
       This function was adopted from code in the libwww.a library available
       via the W3 consortium 
     */
{
  unsigned char a;
  
  char *p;
  char *q;
  char *hex = "0123456789ABCDEF";
  int iout=0;
  
unsigned const char isAcceptable[96] =
{/* 0x0 0x1 0x2 0x3 0x4 0x5 0x6 0x7 0x8 0x9 0xA 0xB 0xC 0xD 0xE 0xF */
  
    0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0xF,0xE,0x0,0xF,0xF,0xC, 
                                           /* 2x  !"#$%&'()*+,-./   */
    0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0x8,0x0,0x0,0x0,0x0,0x0,
                                           /* 3x 0123456789:;<=>?   */
    0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF, 
                                           /* 4x @ABCDEFGHIJKLMNO   */
    0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0x0,0x0,0x0,0x0,0xF,
                                           /* 5X PQRSTUVWXYZ[\]^_   */
    0x0,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,
                                           /* 6x `abcdefghijklmno   */
    0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0xF,0x0,0x0,0x0,0x0,0x0  
                                           /* 7X pqrstuvwxyz{\}~DEL */
};

  if(*status != 0) return(*status);
  
  /* loop over all characters in inpath until '\0' is encountered */

  for(q = outpath, p = inpath; *p && (iout < maxlength-1) ; p++)
    {
      a = (unsigned char)*p;

      /* if the charcter requires encoding then process it */

      if(!( a>=32 && a<128 && (isAcceptable[a-32])))
	{
           if (iout+2 < maxlength-1)
           {
	     /* add a '%' character to the outpath */
	     *q++ = HEX_ESCAPE;
	     /* add the most significant ASCII code hex value */
	     *q++ = hex[a >> 4];
	     /* add the least significant ASCII code hex value */
	     *q++ = hex[a & 15];
             iout += 3;
           }
           else
           {
              ffpmsg("URL input is too long to encode (fits_encode_url)");
              *status = URL_PARSE_ERROR;
              outpath[0] = 0;
              return (*status);
           }
	}
      /* else just copy the character as is */
      else 
      {
         *q++ = *p;
         iout++;
      }
    }

  /* null terminate the outpath string */

  if (*p && (iout == maxlength-1))
  {
     ffpmsg("URL input is too long to encode (fits_encode_url)");
     *status = URL_PARSE_ERROR;
     outpath[0] = 0;
     return (*status);
  }
  *q++ = 0; 
  
  return(*status);
}

/*---------------------------------------------------------------------------*/
int fits_unencode_url(char *inpath,  /* I input URL with encoding            */
		      char *outpath, /* O unencoded URL                      */
		      int  *status)
     /*
       unencode all URL "unsafe" and "reserved" characters to their actual
       ASCII representation. All tokens of the form "%XX" where XX is the
       hexidecimal code for an ASCII character, are searched for and
       translated into the actuall ASCII character (so three chars become
       1 char).

       It is assumed that OUTPATH has enough room to hold the unencoded
       URL.

       This function was adopted from code in the libwww.a library available
       via the W3 consortium 
     */

{
    char *p;
    char *q;
    char  c;

    if(*status != 0) return(*status);

    p = inpath;
    q = outpath;

    /* 
       loop over all characters in the inpath looking for the '%' escape
       character; if found the process the escape sequence
    */

    while(*p != 0) 
      {
	/* 
	   if the character is '%' then unencode the sequence, else
	   just copy the character from inpath to outpath
        */

        if (*p == HEX_ESCAPE)
	  {
            if((c = *(++p)) != 0)
	      { 
		*q = (
		      (c >= '0' && c <= '9') ?
		      (c - '0') : ((c >= 'A' && c <= 'F') ?
				   (c - 'A' + 10) : (c - 'a' + 10))
		      )*16;

		if((c = *(++p)) != 0)
		  {
		    *q = *q + (
			       (c >= '0' && c <= '9') ? 
		               (c - '0') : ((c >= 'A' && c <= 'F') ? 
					    (c - 'A' + 10) : (c - 'a' + 10))
			       );
		    p++, q++;
		  }
	      }
	  } 
	else
	  *q++ = *p++; 
      }
 
    /* terminate the outpath */
    *q = 0;

    return(*status);   
}
/*---------------------------------------------------------------------------*/

int fits_is_url_absolute(char *url)
/*
  Return a True (1) or False (0) value indicating whether or not the passed
  URL string contains an access method specifier or not. Note that this is
  a boolean function and it neither reads nor returns the standard error
  status parameter
*/
{
  char *tmpStr1, *tmpStr2;

  char reserved[] = {':',';','/','?','@','&','=','+','$',','};

  /*
    The rule for determing if an URL is relative or absolute is that it (1)
    must have a colon ":" and (2) that the colon must appear before any other
    reserved URL character in the URL string. We first see if a colon exists,
    get its position in the string, and then check to see if any of the other
    reserved characters exists and if their position in the string is greater
    than that of the colons. 
   */

  if( (tmpStr1 = strchr(url,reserved[0])) != NULL                       &&
     ((tmpStr2 = strchr(url,reserved[1])) == NULL || tmpStr2 > tmpStr1) &&
     ((tmpStr2 = strchr(url,reserved[2])) == NULL || tmpStr2 > tmpStr1) &&
     ((tmpStr2 = strchr(url,reserved[3])) == NULL || tmpStr2 > tmpStr1) &&
     ((tmpStr2 = strchr(url,reserved[4])) == NULL || tmpStr2 > tmpStr1) &&
     ((tmpStr2 = strchr(url,reserved[5])) == NULL || tmpStr2 > tmpStr1) &&
     ((tmpStr2 = strchr(url,reserved[6])) == NULL || tmpStr2 > tmpStr1) &&
     ((tmpStr2 = strchr(url,reserved[7])) == NULL || tmpStr2 > tmpStr1) &&
     ((tmpStr2 = strchr(url,reserved[8])) == NULL || tmpStr2 > tmpStr1) &&
     ((tmpStr2 = strchr(url,reserved[9])) == NULL || tmpStr2 > tmpStr1)   )
    {
      return(1);
    }
  else
    {
      return(0);
    }
}
cfitsio-3.47/group.h0000644000225700000360000000406113464573432013716 0ustar  cagordonlhea#define MAX_HDU_TRACKER 1000

typedef struct _HDUtracker HDUtracker;

struct _HDUtracker
{
  int nHDU;

  char *filename[MAX_HDU_TRACKER];
  int  position[MAX_HDU_TRACKER];

  char *newFilename[MAX_HDU_TRACKER];
  int  newPosition[MAX_HDU_TRACKER];
};

/* functions used internally in the grouping convention module */

int ffgtdc(int grouptype, int xtensioncol, int extnamecol, int extvercol,
	   int positioncol, int locationcol, int uricol, char *ttype[],
	   char *tform[], int *ncols, int  *status);

int ffgtgc(fitsfile *gfptr, int *xtensionCol, int *extnameCol, int *extverCol,
	   int *positionCol, int *locationCol, int *uriCol, int *grptype,
	   int *status);

int ffvcfm(fitsfile *gfptr, int xtensionCol, int extnameCol, int extverCol,
	   int positionCol, int locationCol, int uriCol, int *status);

int ffgmul(fitsfile *mfptr, int rmopt, int *status);

int ffgmf(fitsfile *gfptr, char *xtension, char *extname, int extver,	   
	  int position,	char *location,	long *member, int *status);

int ffgtrmr(fitsfile *gfptr, HDUtracker *HDU, int *status);

int ffgtcpr(fitsfile *infptr, fitsfile *outfptr, int cpopt, HDUtracker *HDU,
	    int *status);

int fftsad(fitsfile *mfptr, HDUtracker *HDU, int *newPosition, 
	   char *newFileName);

int fftsud(fitsfile *mfptr, HDUtracker *HDU, int newPosition, 
	   char *newFileName);

void prepare_keyvalue(char *keyvalue);

int fits_path2url(char *inpath, int maxlength, char *outpath, int  *status);

int fits_url2path(char *inpath, char *outpath, int  *status);

int fits_get_cwd(char *cwd, int *status);

int fits_get_url(fitsfile *fptr, char *realURL, char *startURL, 
		 char *realAccess, char *startAccess, int *iostate, 
		 int *status);

int fits_clean_url(char *inURL, char *outURL, int *status);

int fits_relurl2url(char *refURL, char *relURL, char *absURL, int *status);

int fits_url2relurl(char *refURL, char *absURL, char *relURL, int *status);

int fits_encode_url(char *inpath, int maxlength, char *outpath, int *status);

int fits_unencode_url(char *inpath, char *outpath, int *status);

int fits_is_url_absolute(char *url);

cfitsio-3.47/grparser.c0000644000225700000360000013173013464573432014406 0ustar  cagordonlhea/*		T E M P L A T E   P A R S E R
		=============================

		by Jerzy.Borkowski@obs.unige.ch

		Integral Science Data Center
		ch. d'Ecogia 16
		1290 Versoix
		Switzerland

14-Oct-98: initial release
16-Oct-98: code cleanup, #include  included, now gcc -Wall prints no
		warnings during compilation. Bugfix: now one can specify additional
		columns in group HDU. Autoindexing also works in this situation
		(colunms are number from 7 however).
17-Oct-98: bugfix: complex keywords were incorrectly written (was TCOMPLEX should
		be TDBLCOMPLEX).
20-Oct-98: bugfix: parser was writing EXTNAME twice, when first HDU in template is
		defined with XTENSION IMAGE then parser creates now dummy PHDU,
		SIMPLE T is now allowed only at most once and in first HDU only.
		WARNING: one should not define EXTNAME keyword for GROUP HDUs, as
		they have them already defined by parser (EXTNAME = GROUPING).
		Parser accepts EXTNAME oin GROUP HDU definition, but in this
		case multiple EXTNAME keywords will present in HDU header.
23-Oct-98: bugfix: unnecessary space was written to FITS file for blank
		keywords.
24-Oct-98: syntax change: empty lines and lines with only whitespaces are 
		written to FITS files as blank keywords (if inside group/hdu
		definition). Previously lines had to have at least 8 spaces.
		Please note, that due to pecularities of CFITSIO if the
		last keyword(s) defined for given HDU are blank keywords
		consisting of only 80 spaces, then (some of) those keywords
		may be silently deleted by CFITSIO.
13-Nov-98: bugfix: parser was writing GRPNAME twice. Parser still creates
                GRPNAME keywords for GROUP HDU's which do not specify them.
                However, values (of form DEFAULT_GROUP_XXX) are assigned
                not necessarily in order HDUs appear in template file, but
                rather in order parser completes their creation in FITS
                file. Also, when including files, if fopen fails, parser
                tries to open file with a name = directory_of_top_level
                file + name of file to be included, as long as name
                of file to be included does not specify absolute pathname.
16-Nov-98: bugfix to bugfix from 13-Nov-98
19-Nov-98: EXTVER keyword is now automatically assigned value by parser.
17-Dev-98: 2 new things added: 1st: CFITSIO_INCLUDE_FILES environment
		variable can contain a colon separated list of directories
		to look for when looking for template include files (and master
		template also). 2nd: it is now possible to append template
		to nonempty FITS. file. fitsfile *ff no longer needs to point
		to an empty FITS file with 0 HDUs in it. All data written by
		parser will simple be appended at the end of file.
22-Jan-99: changes to parser: when in append mode parser initially scans all
		existing HDUs to built a list of already used EXTNAME/EXTVERs
22-Jan-99: Bruce O'Neel, bugfix : TLONG should always reference long type
		variable on OSF/Alpha and on 64-bit archs in general
20-Jun-2002 Wm Pence, added support for the HIERARCH keyword convention in
                which keyword names can effectively be longer than 8 characters.
                Example:
                HIERARCH  LongKeywordName = 'value' / comment
30-Jan-2003 Wm Pence, bugfix: ngp_read_xtension was testing for "ASCIITABLE" 
                instead of "TABLE" as the XTENSION value of an ASCII table,
                and it did not allow for optional trailing spaces in the
                "IMAGE" or "TABLE" string. 
16-Dec-2003 James Peachey: ngp_keyword_all_write was modified to apply
                comments from the template file to the output file in
                the case of reserved keywords (e.g. tform#, ttype# etcetera).
*/


#include 
#include 

#ifdef sparc
#include 
#include 
#endif

#include 
#include "fitsio2.h"
#include "grparser.h"

NGP_RAW_LINE	ngp_curline = { NULL, NULL, NULL, NGP_TTYPE_UNKNOWN, NULL, NGP_FORMAT_OK, 0 };
NGP_RAW_LINE	ngp_prevline = { NULL, NULL, NULL, NGP_TTYPE_UNKNOWN, NULL, NGP_FORMAT_OK, 0 };

int		ngp_inclevel = 0;		/* number of included files, 1 - means mean file */
int		ngp_grplevel = 0;		/* group nesting level, 0 - means no grouping */

FILE		*ngp_fp[NGP_MAX_INCLUDE];	/* stack of included file handles */
int		ngp_keyidx = NGP_TOKEN_UNKNOWN;	/* index of token in current line */
NGP_TOKEN	ngp_linkey;			/* keyword after line analyze */

char            ngp_master_dir[NGP_MAX_FNAME];  /* directory of top level include file */

NGP_TKDEF	ngp_tkdef[] = 			/* tokens recognized by parser */
      { {	"\\INCLUDE",	NGP_TOKEN_INCLUDE },
	{	"\\GROUP",	NGP_TOKEN_GROUP },
	{	"\\END",	NGP_TOKEN_END },
	{	"XTENSION",	NGP_TOKEN_XTENSION },
	{	"SIMPLE",	NGP_TOKEN_SIMPLE },
	{	NULL,		NGP_TOKEN_UNKNOWN }
      };

int	master_grp_idx = 1;			/* current unnamed group in object */

int		ngp_extver_tab_size = 0;
NGP_EXTVER_TAB	*ngp_extver_tab = NULL;


int	ngp_get_extver(char *extname, int *version)
 { NGP_EXTVER_TAB *p;
   char 	*p2;
   int		i;

   if ((NULL == extname) || (NULL == version)) return(NGP_BAD_ARG);
   if ((NULL == ngp_extver_tab) && (ngp_extver_tab_size > 0)) return(NGP_BAD_ARG);
   if ((NULL != ngp_extver_tab) && (ngp_extver_tab_size <= 0)) return(NGP_BAD_ARG);

   for (i=0; i 0)) return(NGP_BAD_ARG);
   if ((NULL != ngp_extver_tab) && (ngp_extver_tab_size <= 0)) return(NGP_BAD_ARG);

   for (i=0; i ngp_extver_tab[i].version)  ngp_extver_tab[i].version = version;
          return(NGP_OK);
        }
    }

   if (NULL == ngp_extver_tab)
     { p = (NGP_EXTVER_TAB *)ngp_alloc(sizeof(NGP_EXTVER_TAB)); }
   else
     { p = (NGP_EXTVER_TAB *)ngp_realloc(ngp_extver_tab, (ngp_extver_tab_size + 1) * sizeof(NGP_EXTVER_TAB)); }

   if (NULL == p) return(NGP_NO_MEMORY);

   p2 = ngp_alloc(strlen(extname) + 1);
   if (NULL == p2)
     { ngp_free(p);
       return(NGP_NO_MEMORY);
     }

   strcpy(p2, extname);
   ngp_extver_tab = p;
   ngp_extver_tab[ngp_extver_tab_size].extname = p2;
   ngp_extver_tab[ngp_extver_tab_size].version = version;

   ngp_extver_tab_size++;

   return(NGP_OK);
 }


int	ngp_delete_extver_tab(void)
 { int i;

   if ((NULL == ngp_extver_tab) && (ngp_extver_tab_size > 0)) return(NGP_BAD_ARG);
   if ((NULL != ngp_extver_tab) && (ngp_extver_tab_size <= 0)) return(NGP_BAD_ARG);
   if ((NULL == ngp_extver_tab) && (0 == ngp_extver_tab_size)) return(NGP_OK);

   for (i=0; i allocsize)
        { p2 = (char *)ngp_realloc(*p, alen);	/* realloc buffer, if there is need */
          if (NULL == p2)
            { r = NGP_NO_MEMORY;
              break;
            }
	  *p = p2;
          allocsize = alen;
        }
      (*p)[llen - 1] = c;			/* copy character to buffer */
    }

   llen++;					/* place for terminating \0 */
   if (llen != allocsize)
     { p2 = (char *)ngp_realloc(*p, llen);
       if (NULL == p2) r = NGP_NO_MEMORY;
       else
         { *p = p2;
           (*p)[llen - 1] = 0;			/* copy \0 to buffer */
         }         
     }
   else
     { (*p)[llen - 1] = 0;			/* necessary when line read was empty */
     }

   if ((NGP_EOF != r) && (NGP_OK != r))		/* in case of errors free resources */
     { ngp_free(*p);
       *p = NULL;
     }
   
   return(r);					/* return  status code */
 }

	/* free current line structure */

int	ngp_free_line(void)
 {
   if (NULL != ngp_curline.line)
     { ngp_free(ngp_curline.line);
       ngp_curline.line = NULL;
       ngp_curline.name = NULL;
       ngp_curline.value = NULL;
       ngp_curline.comment = NULL;
       ngp_curline.type = NGP_TTYPE_UNKNOWN;
       ngp_curline.format = NGP_FORMAT_OK;
       ngp_curline.flags = 0;
     }
   return(NGP_OK);
 }

	/* free cached line structure */

int	ngp_free_prevline(void)
 {
   if (NULL != ngp_prevline.line)
     { ngp_free(ngp_prevline.line);
       ngp_prevline.line = NULL;
       ngp_prevline.name = NULL;
       ngp_prevline.value = NULL;
       ngp_prevline.comment = NULL;
       ngp_prevline.type = NGP_TTYPE_UNKNOWN;
       ngp_prevline.format = NGP_FORMAT_OK;
       ngp_prevline.flags = 0;
     }
   return(NGP_OK);
 }

	/* read one line */

int	ngp_read_line_buffered(FILE *fp)
 {
   ngp_free_line();				/* first free current line (if any) */
   
   if (NULL != ngp_prevline.line)		/* if cached, return cached line */
     { ngp_curline = ngp_prevline;
       ngp_prevline.line = NULL;
       ngp_prevline.name = NULL;
       ngp_prevline.value = NULL;
       ngp_prevline.comment = NULL;
       ngp_prevline.type = NGP_TTYPE_UNKNOWN;
       ngp_prevline.format = NGP_FORMAT_OK;
       ngp_prevline.flags = 0;
       ngp_curline.flags = NGP_LINE_REREAD;
       return(NGP_OK);
     }

   ngp_curline.flags = 0;   			/* if not cached really read line from file */
   return(ngp_line_from_file(fp, &(ngp_curline.line)));
 }

	/* unread line */

int	ngp_unread_line(void)
 {
   if (NULL == ngp_curline.line)		/* nothing to unread */
     return(NGP_EMPTY_CURLINE);

   if (NULL != ngp_prevline.line)		/* we cannot unread line twice */
     return(NGP_UNREAD_QUEUE_FULL);

   ngp_prevline = ngp_curline;
   ngp_curline.line = NULL;
   return(NGP_OK);
 }

	/* a first guess line decomposition */

int	ngp_extract_tokens(NGP_RAW_LINE *cl)
 { char *p, *s;
   int	cl_flags, i;

   p = cl->line;				/* start from beginning of line */
   if (NULL == p) return(NGP_NUL_PTR);

   cl->name = cl->value = cl->comment = NULL;
   cl->type = NGP_TTYPE_UNKNOWN;
   cl->format = NGP_FORMAT_OK;

   cl_flags = 0;

   for (i=0;; i++)				/* if 8 spaces at beginning then line is comment */
    { if ((0 == *p) || ('\n' == *p))
        {					/* if line has only blanks -> write blank keyword */
          cl->line[0] = 0;			/* create empty name (0 length string) */
          cl->comment = cl->name = cl->line;
	  cl->type = NGP_TTYPE_RAW;		/* signal write unformatted to FITS file */
          return(NGP_OK);
        }
      if ((' ' != *p) && ('\t' != *p)) break;
      if (i >= 7)
        { 
          cl->comment = p + 1;
          for (s = cl->comment;; s++)		/* filter out any EOS characters in comment */
           { if ('\n' == *s) *s = 0;
	     if (0 == *s) break;
           }
          cl->line[0] = 0;			/* create empty name (0 length string) */
          cl->name = cl->line;
	  cl->type = NGP_TTYPE_RAW;
          return(NGP_OK);
        }
      p++;
    }

   cl->name = p;

   for (;;)					/* we need to find 1st whitespace */
    { if ((0 == *p) || ('\n' == *p))
        { *p = 0;
          break;
        }

      /*
        from Richard Mathar, 2002-05-03, add 10 lines:
        if upper/lowercase HIERARCH followed also by an equal sign...
      */
      if( fits_strncasecmp("HIERARCH",p,strlen("HIERARCH")) == 0 )
      {
           char * const eqsi=strchr(p,'=') ;
           if( eqsi )
           {
              cl_flags |= NGP_FOUND_EQUAL_SIGN ;
              p=eqsi ;
              break ;
           }
      }

      if ((' ' == *p) || ('\t' == *p)) break;
      if ('=' == *p)
        { cl_flags |= NGP_FOUND_EQUAL_SIGN;
          break;
        }

      p++;
    }

   if (*p) *(p++) = 0;				/* found end of keyname so terminate string with zero */

   if ((!fits_strcasecmp("HISTORY", cl->name))
    || (!fits_strcasecmp("COMMENT", cl->name))
    || (!fits_strcasecmp("CONTINUE", cl->name)))
     { cl->comment = p;
       for (s = cl->comment;; s++)		/* filter out any EOS characters in comment */
        { if ('\n' == *s) *s = 0;
	  if (0 == *s) break;
        }
       cl->type = NGP_TTYPE_RAW;
       return(NGP_OK);
     }

   if (!fits_strcasecmp("\\INCLUDE", cl->name))
     {
       for (;; p++)  if ((' ' != *p) && ('\t' != *p)) break; /* skip whitespace */

       cl->value = p;
       for (s = cl->value;; s++)		/* filter out any EOS characters */
        { if ('\n' == *s) *s = 0;
	  if (0 == *s) break;
        }
       cl->type = NGP_TTYPE_UNKNOWN;
       return(NGP_OK);
     }
       
   for (;; p++)
    { if ((0 == *p) || ('\n' == *p))  return(NGP_OK);	/* test if at end of string */
      if ((' ' == *p) || ('\t' == *p)) continue; /* skip whitespace */
      if (cl_flags & NGP_FOUND_EQUAL_SIGN) break;
      if ('=' != *p) break;			/* ignore initial equal sign */
      cl_flags |= NGP_FOUND_EQUAL_SIGN;
    }
      
   if ('/' == *p)				/* no value specified, comment only */
     { p++;
       if ((' ' == *p) || ('\t' == *p)) p++;
       cl->comment = p;
       for (s = cl->comment;; s++)		/* filter out any EOS characters in comment */
        { if ('\n' == *s) *s = 0;
	  if (0 == *s) break;
        }
       return(NGP_OK);
     }

   if ('\'' == *p)				/* we have found string within quotes */
     { cl->value = s = ++p;			/* set pointer to beginning of that string */
       cl->type = NGP_TTYPE_STRING;		/* signal that it is of string type */

       for (;;)					/* analyze it */
        { if ((0 == *p) || ('\n' == *p))	/* end of line -> end of string */
            { *s = 0; return(NGP_OK); }

          if ('\'' == *p)			/* we have found doublequote */
            { if ((0 == p[1]) || ('\n' == p[1]))/* doublequote is the last character in line */
                { *s = 0; return(NGP_OK); }
              if (('\t' == p[1]) || (' ' == p[1])) /* duoblequote was string terminator */
                { *s = 0; p++; break; }
              if ('\'' == p[1]) p++;		/* doublequote is inside string, convert "" -> " */ 
            }

          *(s++) = *(p++);			/* compact string in place, necess. by "" -> " conversion */
        }
     }
   else						/* regular token */
     { 
       cl->value = p;				/* set pointer to token */
       cl->type = NGP_TTYPE_UNKNOWN;		/* we dont know type at the moment */
       for (;; p++)				/* we need to find 1st whitespace */
        { if ((0 == *p) || ('\n' == *p))
            { *p = 0; return(NGP_OK); }
          if ((' ' == *p) || ('\t' == *p)) break;
        }
       if (*p)  *(p++) = 0;			/* found so terminate string with zero */
     }
       
   for (;; p++)
    { if ((0 == *p) || ('\n' == *p))  return(NGP_OK);	/* test if at end of string */
      if ((' ' != *p) && ('\t' != *p)) break;	/* skip whitespace */
    }
      
   if ('/' == *p)				/* no value specified, comment only */
     { p++;
       if ((' ' == *p) || ('\t' == *p)) p++;
       cl->comment = p;
       for (s = cl->comment;; s++)		/* filter out any EOS characters in comment */
        { if ('\n' == *s) *s = 0;
	  if (0 == *s) break;
        }
       return(NGP_OK);
     }

   cl->format = NGP_FORMAT_ERROR;
   return(NGP_OK);				/* too many tokens ... */
 }

/*      try to open include file. If open fails and fname
        does not specify absolute pathname, try to open fname
        in any directory specified in CFITSIO_INCLUDE_FILES
        environment variable. Finally try to open fname
        relative to ngp_master_dir, which is directory of top
        level include file
*/

int	ngp_include_file(char *fname)		/* try to open include file */
 { char *p, *p2, *cp, *envar, envfiles[NGP_MAX_ENVFILES];
   char *saveptr;

   if (NULL == fname) return(NGP_NUL_PTR);

   if (ngp_inclevel >= NGP_MAX_INCLUDE)		/* too many include files */
     return(NGP_INC_NESTING);

   if (NULL == (ngp_fp[ngp_inclevel] = fopen(fname, "r")))
     {                                          /* if simple open failed .. */
       envar = getenv("CFITSIO_INCLUDE_FILES");	/* scan env. variable, and retry to open */

       if (NULL != envar)			/* is env. variable defined ? */
         { strncpy(envfiles, envar, NGP_MAX_ENVFILES - 1);
           envfiles[NGP_MAX_ENVFILES - 1] = 0;	/* copy search path to local variable, env. is fragile */

           for (p2 = ffstrtok(envfiles, ":",&saveptr); NULL != p2; p2 = ffstrtok(NULL, ":",&saveptr))
            {
	      cp = (char *)ngp_alloc(strlen(fname) + strlen(p2) + 2);
	      if (NULL == cp) return(NGP_NO_MEMORY);

	      strcpy(cp, p2);
#ifdef  MSDOS
              strcat(cp, "\\");			/* abs. pathname for MSDOS */
               
#else
              strcat(cp, "/");			/* and for unix */
#endif
	      strcat(cp, fname);
	  
	      ngp_fp[ngp_inclevel] = fopen(cp, "r");
	      ngp_free(cp);

	      if (NULL != ngp_fp[ngp_inclevel]) break;
	    }
        }
                                      
       if (NULL == ngp_fp[ngp_inclevel])	/* finally try to open relative to top level */
         {
#ifdef  MSDOS
           if ('\\' == fname[0]) return(NGP_ERR_FOPEN); /* abs. pathname for MSDOS, does not support C:\\PATH */
#else
           if ('/' == fname[0]) return(NGP_ERR_FOPEN); /* and for unix */
#endif
           if (0 == ngp_master_dir[0]) return(NGP_ERR_FOPEN);

	   p = ngp_alloc(strlen(fname) + strlen(ngp_master_dir) + 1);
           if (NULL == p) return(NGP_NO_MEMORY);

           strcpy(p, ngp_master_dir);		/* construct composite pathname */
           strcat(p, fname);			/* comp = master + fname */

           ngp_fp[ngp_inclevel] = fopen(p, "r");/* try to open composite */
           ngp_free(p);				/* we don't need buffer anymore */

           if (NULL == ngp_fp[ngp_inclevel])
             return(NGP_ERR_FOPEN);		/* fail if error */
         }
     }

   ngp_inclevel++;
   return(NGP_OK);
 }


/* read line in the intelligent way. All \INCLUDE directives are handled,
   empty and comment line skipped. If this function returns NGP_OK, than
   decomposed line (name, type, value in proper type and comment) are
   stored in ngp_linkey structure. ignore_blank_lines parameter is zero
   when parser is inside GROUP or HDU definition. Nonzero otherwise.
*/

int	ngp_read_line(int ignore_blank_lines)
 { int r, nc, savec;
   unsigned k;

   if (ngp_inclevel <= 0)		/* do some sanity checking first */
     { ngp_keyidx = NGP_TOKEN_EOF;	/* no parents, so report error */
       return(NGP_OK);	
     }
   if (ngp_inclevel > NGP_MAX_INCLUDE)  return(NGP_INC_NESTING);
   if (NULL == ngp_fp[ngp_inclevel - 1]) return(NGP_NUL_PTR);

   for (;;)
    { switch (r = ngp_read_line_buffered(ngp_fp[ngp_inclevel - 1]))
       { case NGP_EOF:
		ngp_inclevel--;			/* end of file, revert to parent */
		if (ngp_fp[ngp_inclevel])	/* we can close old file */
		  fclose(ngp_fp[ngp_inclevel]);

		ngp_fp[ngp_inclevel] = NULL;
		if (ngp_inclevel <= 0)
		  { ngp_keyidx = NGP_TOKEN_EOF;	/* no parents, so report error */
		    return(NGP_OK);	
		  }
		continue;

	 case NGP_OK:
		if (ngp_curline.flags & NGP_LINE_REREAD) return(r);
		break;
	 default:
		return(r);
       }
      
      switch (ngp_curline.line[0])
       { case 0: if (0 == ignore_blank_lines) break; /* ignore empty lines if told so */
         case '#': continue;			/* ignore comment lines */
       }
      
      r = ngp_extract_tokens(&ngp_curline);	/* analyse line, extract tokens and comment */
      if (NGP_OK != r) return(r);

      if (NULL == ngp_curline.name)  continue;	/* skip lines consisting only of whitespaces */

      for (k = 0; k < strlen(ngp_curline.name); k++)
       { if ((ngp_curline.name[k] >= 'a') && (ngp_curline.name[k] <= 'z')) 
           ngp_curline.name[k] += 'A' - 'a';	/* force keyword to be upper case */
         if (k == 7) break;  /* only first 8 chars are required to be upper case */
       }

      for (k=0;; k++)				/* find index of keyword in keyword table */
       { if (NGP_TOKEN_UNKNOWN == ngp_tkdef[k].code) break;
         if (0 == strcmp(ngp_curline.name, ngp_tkdef[k].name)) break;
       }

      ngp_keyidx = ngp_tkdef[k].code;		/* save this index, grammar parser will need this */

      if (NGP_TOKEN_INCLUDE == ngp_keyidx)	/* if this is \INCLUDE keyword, try to include file */
        { if (NGP_OK != (r = ngp_include_file(ngp_curline.value))) return(r);
	  continue;				/* and read next line */
        }

      ngp_linkey.type = NGP_TTYPE_UNKNOWN;	/* now, get the keyword type, it's a long story ... */

      if (NULL != ngp_curline.value)		/* if no value given signal it */
        { if (NGP_TTYPE_STRING == ngp_curline.type)  /* string type test */
            { ngp_linkey.type = NGP_TTYPE_STRING;
              ngp_linkey.value.s = ngp_curline.value;
            }
          if (NGP_TTYPE_UNKNOWN == ngp_linkey.type) /* bool type test */
            { if ((!fits_strcasecmp("T", ngp_curline.value)) || (!fits_strcasecmp("F", ngp_curline.value)))
                { ngp_linkey.type = NGP_TTYPE_BOOL;
                  ngp_linkey.value.b = (fits_strcasecmp("T", ngp_curline.value) ? 0 : 1);
                }
            }
          if (NGP_TTYPE_UNKNOWN == ngp_linkey.type) /* complex type test */
            { if (2 == sscanf(ngp_curline.value, "(%lg,%lg)%n", &(ngp_linkey.value.c.re), &(ngp_linkey.value.c.im), &nc))
                { if ((' ' == ngp_curline.value[nc]) || ('\t' == ngp_curline.value[nc])
                   || ('\n' == ngp_curline.value[nc]) || (0 == ngp_curline.value[nc]))
                    { ngp_linkey.type = NGP_TTYPE_COMPLEX;
                    }
                }
            }
          if (NGP_TTYPE_UNKNOWN == ngp_linkey.type) /* real type test */
            { if (strchr(ngp_curline.value, '.') && (1 == sscanf(ngp_curline.value, "%lg%n", &(ngp_linkey.value.d), &nc)))
                {
		 if ('D' == ngp_curline.value[nc]) {
		   /* test if template used a 'D' rather than an 'E' as the exponent character (added by WDP in 12/2010) */
                   savec = nc;
		   ngp_curline.value[nc] = 'E';
		   sscanf(ngp_curline.value, "%lg%n", &(ngp_linkey.value.d), &nc);
		   if ((' ' == ngp_curline.value[nc]) || ('\t' == ngp_curline.value[nc])
                    || ('\n' == ngp_curline.value[nc]) || (0 == ngp_curline.value[nc]))  {
                       ngp_linkey.type = NGP_TTYPE_REAL;
                     } else {  /* no, this is not a real value */
		       ngp_curline.value[savec] = 'D';  /* restore the original D character */
 		     }
		 } else {
		  if ((' ' == ngp_curline.value[nc]) || ('\t' == ngp_curline.value[nc])
                   || ('\n' == ngp_curline.value[nc]) || (0 == ngp_curline.value[nc]))
                    { ngp_linkey.type = NGP_TTYPE_REAL;
                    }
                 } 
                }
            }
          if (NGP_TTYPE_UNKNOWN == ngp_linkey.type) /* integer type test */
            { if (1 == sscanf(ngp_curline.value, "%d%n", &(ngp_linkey.value.i), &nc))
                { if ((' ' == ngp_curline.value[nc]) || ('\t' == ngp_curline.value[nc])
                   || ('\n' == ngp_curline.value[nc]) || (0 == ngp_curline.value[nc]))
                    { ngp_linkey.type = NGP_TTYPE_INT;
                    }
                }
            }
          if (NGP_TTYPE_UNKNOWN == ngp_linkey.type) /* force string type */
            { ngp_linkey.type = NGP_TTYPE_STRING;
              ngp_linkey.value.s = ngp_curline.value;
            }
        }
      else
        { if (NGP_TTYPE_RAW == ngp_curline.type) ngp_linkey.type = NGP_TTYPE_RAW;
	  else ngp_linkey.type = NGP_TTYPE_NULL;
	}

      if (NULL != ngp_curline.comment)
        { strncpy(ngp_linkey.comment, ngp_curline.comment, NGP_MAX_COMMENT); /* store comment */
	  ngp_linkey.comment[NGP_MAX_COMMENT - 1] = 0;
	}
      else
        { ngp_linkey.comment[0] = 0;
        }

      strncpy(ngp_linkey.name, ngp_curline.name, NGP_MAX_NAME); /* and keyword's name */
      ngp_linkey.name[NGP_MAX_NAME - 1] = 0;

      if (strlen(ngp_linkey.name) > FLEN_KEYWORD)  /* WDP: 20-Jun-2002:  mod to support HIERARCH */
        { 
           return(NGP_BAD_ARG);		/* cfitsio does not allow names > 8 chars */
        }
      
      return(NGP_OK);			/* we have valid non empty line, so return success */
    }
 }

	/* check whether keyword can be written as is */

int	ngp_keyword_is_write(NGP_TOKEN *ngp_tok)
 { int i, j, l, spc;
                        /* indexed variables not to write */

   static char *nm[] = { "NAXIS", "TFORM", "TTYPE", NULL } ;

                        /* non indexed variables not allowed to write */
  
   static char *nmni[] = { "SIMPLE", "XTENSION", "BITPIX", "NAXIS", "PCOUNT",
                           "GCOUNT", "TFIELDS", "THEAP", "EXTEND", "EXTVER",
                           NULL } ;

   if (NULL == ngp_tok) return(NGP_NUL_PTR);

   for (j = 0; ; j++)           /* first check non indexed */
    { if (NULL == nmni[j]) break;
      if (0 == strcmp(nmni[j], ngp_tok->name)) return(NGP_BAD_ARG);
    } 

   for (j = 0; ; j++)           /* now check indexed */
    { if (NULL == nm[j]) return(NGP_OK);
      l = strlen(nm[j]);
      if ((l < 1) || (l > 5)) continue;
      if (0 == strncmp(nm[j], ngp_tok->name, l)) break;
    } 

   if ((ngp_tok->name[l] < '1') || (ngp_tok->name[l] > '9')) return(NGP_OK);
   spc = 0;
   for (i = l + 1; i < 8; i++)
    { if (spc) { if (' ' != ngp_tok->name[i]) return(NGP_OK); }
      else
       { if ((ngp_tok->name[i] >= '0') && (ngp_tok->name[i] <= '9')) continue;
         if (' ' == ngp_tok->name[i]) { spc = 1; continue; }
         if (0 == ngp_tok->name[i]) break;
         return(NGP_OK);
       }
    }
   return(NGP_BAD_ARG);
 }

	/* write (almost) all keywords from given HDU to disk */

int     ngp_keyword_all_write(NGP_HDU *ngph, fitsfile *ffp, int mode)
 { int		i, r, ib;
   char		buf[200];
   long		l;


   if (NULL == ngph) return(NGP_NUL_PTR);
   if (NULL == ffp) return(NGP_NUL_PTR);
   r = NGP_OK;
   
   for (i=0; itokcnt; i++)
    { r = ngp_keyword_is_write(&(ngph->tok[i]));
      if ((NGP_REALLY_ALL & mode) || (NGP_OK == r))
        { switch (ngph->tok[i].type)
           { case NGP_TTYPE_BOOL:
			ib = ngph->tok[i].value.b;
			fits_write_key(ffp, TLOGICAL, ngph->tok[i].name, &ib, ngph->tok[i].comment, &r);
			break;
             case NGP_TTYPE_STRING:
			fits_write_key_longstr(ffp, ngph->tok[i].name, ngph->tok[i].value.s, ngph->tok[i].comment, &r);
			break;
             case NGP_TTYPE_INT:
			l = ngph->tok[i].value.i;	/* bugfix - 22-Jan-99, BO - nonalignment of OSF/Alpha */
			fits_write_key(ffp, TLONG, ngph->tok[i].name, &l, ngph->tok[i].comment, &r);
			break;
             case NGP_TTYPE_REAL:
			fits_write_key(ffp, TDOUBLE, ngph->tok[i].name, &(ngph->tok[i].value.d), ngph->tok[i].comment, &r);
			break;
             case NGP_TTYPE_COMPLEX:
			fits_write_key(ffp, TDBLCOMPLEX, ngph->tok[i].name, &(ngph->tok[i].value.c), ngph->tok[i].comment, &r);
			break;
             case NGP_TTYPE_NULL:
			fits_write_key_null(ffp, ngph->tok[i].name, ngph->tok[i].comment, &r);
			break;
             case NGP_TTYPE_RAW:
			if (0 == strcmp("HISTORY", ngph->tok[i].name))
			  { fits_write_history(ffp, ngph->tok[i].comment, &r);
			    break;
			  }
			if (0 == strcmp("COMMENT", ngph->tok[i].name))
			  { fits_write_comment(ffp, ngph->tok[i].comment, &r);
			    break;
			  }
			snprintf(buf,200, "%-8.8s%s", ngph->tok[i].name, ngph->tok[i].comment);
			fits_write_record(ffp, buf, &r);
                        break;
           }
        }
      else if (NGP_BAD_ARG == r) /* enhancement 10 dec 2003, James Peachey: template comments replace defaults */
        { r = NGP_OK;						/* update comments of special keywords like TFORM */
          if (ngph->tok[i].comment && *ngph->tok[i].comment)	/* do not update with a blank comment */
            { fits_modify_comment(ffp, ngph->tok[i].name, ngph->tok[i].comment, &r);
            }
        }
      else /* other problem, typically a blank token */
        { r = NGP_OK;						/* skip this token, but continue */
        }
      if (r) return(r);
    }
     
   fits_set_hdustruc(ffp, &r);				/* resync cfitsio */
   return(r);
 }

	/* init HDU structure */

int	ngp_hdu_init(NGP_HDU *ngph)
 { if (NULL == ngph) return(NGP_NUL_PTR);
   ngph->tok = NULL;
   ngph->tokcnt = 0;
   return(NGP_OK);
 }

	/* clear HDU structure */

int	ngp_hdu_clear(NGP_HDU *ngph)
 { int i;

   if (NULL == ngph) return(NGP_NUL_PTR);

   for (i=0; itokcnt; i++)
    { if (NGP_TTYPE_STRING == ngph->tok[i].type)
        if (NULL != ngph->tok[i].value.s)
          { ngp_free(ngph->tok[i].value.s);
            ngph->tok[i].value.s = NULL;
          }
    }

   if (NULL != ngph->tok) ngp_free(ngph->tok);

   ngph->tok = NULL;
   ngph->tokcnt = 0;

   return(NGP_OK);
 }

	/* insert new token to HDU structure */

int	ngp_hdu_insert_token(NGP_HDU *ngph, NGP_TOKEN *newtok)
 { NGP_TOKEN *tkp;
   
   if (NULL == ngph) return(NGP_NUL_PTR);
   if (NULL == newtok) return(NGP_NUL_PTR);

   if (0 == ngph->tokcnt)
     tkp = (NGP_TOKEN *)ngp_alloc((ngph->tokcnt + 1) * sizeof(NGP_TOKEN));
   else
     tkp = (NGP_TOKEN *)ngp_realloc(ngph->tok, (ngph->tokcnt + 1) * sizeof(NGP_TOKEN));

   if (NULL == tkp) return(NGP_NO_MEMORY);
       
   ngph->tok = tkp;
   ngph->tok[ngph->tokcnt] = *newtok;

   if (NGP_TTYPE_STRING == newtok->type)
     { if (NULL != newtok->value.s)
         { ngph->tok[ngph->tokcnt].value.s = (char *)ngp_alloc(1 + strlen(newtok->value.s));
           if (NULL == ngph->tok[ngph->tokcnt].value.s) return(NGP_NO_MEMORY);
           strcpy(ngph->tok[ngph->tokcnt].value.s, newtok->value.s);
         }
     }

   ngph->tokcnt++;
   return(NGP_OK);
 }


int	ngp_append_columns(fitsfile *ff, NGP_HDU *ngph, int aftercol)
 { int		r, i, j, exitflg, ngph_i;
   char 	*my_tform, *my_ttype;
   char		ngph_ctmp;


   if (NULL == ff) return(NGP_NUL_PTR);
   if (NULL == ngph) return(NGP_NUL_PTR);
   if (0 == ngph->tokcnt) return(NGP_OK);	/* nothing to do ! */

   r = NGP_OK;
   exitflg = 0;

   for (j=aftercol; jtok[i].name, "TFORM%d%c", &ngph_i, &ngph_ctmp))
           { if ((NGP_TTYPE_STRING == ngph->tok[i].type) && (ngph_i == (j + 1)))
   	    { my_tform = ngph->tok[i].value.s;
   	    }
                }
         else if (1 == sscanf(ngph->tok[i].name, "TTYPE%d%c", &ngph_i, &ngph_ctmp))
           { if ((NGP_TTYPE_STRING == ngph->tok[i].type) && (ngph_i == (j + 1)))
               { my_ttype = ngph->tok[i].value.s;
               }
           }
         
         if ((NULL != my_tform) && (my_ttype[0])) break;
         
         if (i < (ngph->tokcnt - 1)) continue;
         exitflg = 1;
         break;
       }
      if ((NGP_OK == r) && (NULL != my_tform))
        fits_insert_col(ff, j + 1, my_ttype, my_tform, &r);

      if ((NGP_OK != r) || exitflg) break;
    }
   return(r);
 }

	/* read complete HDU */

int	ngp_read_xtension(fitsfile *ff, int parent_hn, int simple_mode)
 { int		r, exflg, l, my_hn, tmp0, incrementor_index, i, j;
   int		ngph_dim, ngph_bitpix, ngph_node_type, my_version;
   char		incrementor_name[NGP_MAX_STRING], ngph_ctmp;
   char 	*ngph_extname = 0;
   long		ngph_size[NGP_MAX_ARRAY_DIM];
   NGP_HDU	ngph;
   long		lv;

   incrementor_name[0] = 0;			/* signal no keyword+'#' found yet */
   incrementor_index = 0;

   if (NGP_OK != (r = ngp_hdu_init(&ngph))) return(r);

   if (NGP_OK != (r = ngp_read_line(0))) return(r);	/* EOF always means error here */
   switch (NGP_XTENSION_SIMPLE & simple_mode)
     {
       case 0:  if (NGP_TOKEN_XTENSION != ngp_keyidx) return(NGP_TOKEN_NOT_EXPECT);
		break;
       default:	if (NGP_TOKEN_SIMPLE != ngp_keyidx) return(NGP_TOKEN_NOT_EXPECT);
		break;
     }
       	
   if (NGP_OK != (r = ngp_hdu_insert_token(&ngph, &ngp_linkey))) return(r);

   for (;;)
    { if (NGP_OK != (r = ngp_read_line(0))) return(r);	/* EOF always means error here */
      exflg = 0;
      switch (ngp_keyidx)
       { 
	 case NGP_TOKEN_SIMPLE:
	 		r = NGP_TOKEN_NOT_EXPECT;
			break;
	 		                        
	 case NGP_TOKEN_END:
         case NGP_TOKEN_XTENSION:
         case NGP_TOKEN_GROUP:
         		r = ngp_unread_line();	/* WARNING - not break here .... */
         case NGP_TOKEN_EOF:
			exflg = 1;
 			break;

         default:	l = strlen(ngp_linkey.name);
			if ((l >= 2) && (l <= 6))
			  { if ('#' == ngp_linkey.name[l - 1])
			      { if (0 == incrementor_name[0])
			          { memcpy(incrementor_name, ngp_linkey.name, l - 1);
			            incrementor_name[l - 1] = 0;
			          }
			        if (((l - 1) == (int)strlen(incrementor_name)) && (0 == memcmp(incrementor_name, ngp_linkey.name, l - 1)))
			          { incrementor_index++;
			          }
			        snprintf(ngp_linkey.name + l - 1, NGP_MAX_NAME-l+1,"%d", incrementor_index);
			      }
			  }
			r = ngp_hdu_insert_token(&ngph, &ngp_linkey);
 			break;
       }
      if ((NGP_OK != r) || exflg) break;
    }

   if (NGP_OK == r)
     { 				/* we should scan keywords, and calculate HDU's */
				/* structure ourselves .... */

       ngph_node_type = NGP_NODE_INVALID;	/* init variables */
       ngph_bitpix = 0;
       ngph_extname = NULL;
       for (i=0; i=1) && (j <= NGP_MAX_ARRAY_DIM))
		  { ngph_size[j - 1] = ngph.tok[i].value.i;
		  }
            }
        }

       switch (ngph_node_type)
        { case NGP_NODE_IMAGE:
			if (NGP_XTENSION_FIRST == ((NGP_XTENSION_FIRST | NGP_XTENSION_SIMPLE) & simple_mode))
			  { 		/* if caller signals that this is 1st HDU in file */
					/* and it is IMAGE defined with XTENSION, then we */
					/* need create dummy Primary HDU */			  
			    fits_create_img(ff, 16, 0, NULL, &r);
			  }
					/* create image */
			fits_create_img(ff, ngph_bitpix, ngph_dim, ngph_size, &r);

					/* update keywords */
			if (NGP_OK == r)  r = ngp_keyword_all_write(&ngph, ff, NGP_NON_SYSTEM_ONLY);
			break;

          case NGP_NODE_ATABLE:
          case NGP_NODE_BTABLE:
					/* create table, 0 rows and 0 columns for the moment */
			fits_create_tbl(ff, ((NGP_NODE_ATABLE == ngph_node_type)
					     ? ASCII_TBL : BINARY_TBL),
					0, 0, NULL, NULL, NULL, NULL, &r);
			if (NGP_OK != r) break;

					/* add columns ... */
			r = ngp_append_columns(ff, &ngph, 0);
			if (NGP_OK != r) break;

					/* add remaining keywords */
			r = ngp_keyword_all_write(&ngph, ff, NGP_NON_SYSTEM_ONLY);
			if (NGP_OK != r) break;

					/* if requested add rows */
			if (ngph_size[1] > 0) fits_insert_rows(ff, 0, ngph_size[1], &r);
			break;

	  default:	r = NGP_BAD_ARG;
	  		break;
	}

     }

   if ((NGP_OK == r) && (NULL != ngph_extname))
     { r = ngp_get_extver(ngph_extname, &my_version);	/* write correct ext version number */
       lv = my_version;		/* bugfix - 22-Jan-99, BO - nonalignment of OSF/Alpha */
       fits_write_key(ff, TLONG, "EXTVER", &lv, "auto assigned by template parser", &r); 
     }

   if (NGP_OK == r)
     { if (parent_hn > 0)
         { fits_get_hdu_num(ff, &my_hn);
           fits_movabs_hdu(ff, parent_hn, &tmp0, &r);	/* link us to parent */
           fits_add_group_member(ff, NULL, my_hn, &r);
           fits_movabs_hdu(ff, my_hn, &tmp0, &r);
           if (NGP_OK != r) return(r);
         }
     }

   if (NGP_OK != r)					/* in case of error - delete hdu */
     { tmp0 = 0;
       fits_delete_hdu(ff, NULL, &tmp0);
     }

   ngp_hdu_clear(&ngph);
   return(r);
 }

	/* read complete GROUP */

int	ngp_read_group(fitsfile *ff, char *grpname, int parent_hn)
 { int		r, exitflg, l, my_hn, tmp0, incrementor_index;
   char		grnm[NGP_MAX_STRING];			/* keyword holding group name */
   char		incrementor_name[NGP_MAX_STRING];
   NGP_HDU	ngph;

   incrementor_name[0] = 0;			/* signal no keyword+'#' found yet */
   incrementor_index = 6;			/* first 6 cols are used by group */

   ngp_grplevel++;
   if (NGP_OK != (r = ngp_hdu_init(&ngph))) return(r);

   r = NGP_OK;
   if (NGP_OK != (r = fits_create_group(ff, grpname, GT_ID_ALL_URI, &r))) return(r);
   fits_get_hdu_num(ff, &my_hn);
   if (parent_hn > 0)
     { fits_movabs_hdu(ff, parent_hn, &tmp0, &r);	/* link us to parent */
       fits_add_group_member(ff, NULL, my_hn, &r);
       fits_movabs_hdu(ff, my_hn, &tmp0, &r);
       if (NGP_OK != r) return(r);
     }

   for (exitflg = 0; 0 == exitflg;)
    { if (NGP_OK != (r = ngp_read_line(0))) break;	/* EOF always means error here */
      switch (ngp_keyidx)
       {
	 case NGP_TOKEN_SIMPLE:
	 case NGP_TOKEN_EOF:
			r = NGP_TOKEN_NOT_EXPECT;
			break;

         case NGP_TOKEN_END:
         		ngp_grplevel--;
			exitflg = 1;
			break;

         case NGP_TOKEN_GROUP:
			if (NGP_TTYPE_STRING == ngp_linkey.type)
			  { strncpy(grnm, ngp_linkey.value.s, NGP_MAX_STRING);
			  }
			else
			  { snprintf(grnm, NGP_MAX_STRING,"DEFAULT_GROUP_%d", master_grp_idx++);
			  }
			grnm[NGP_MAX_STRING - 1] = 0;
			r = ngp_read_group(ff, grnm, my_hn);
			break;			/* we can have many subsequent GROUP defs */

         case NGP_TOKEN_XTENSION:
         		r = ngp_unread_line();
         		if (NGP_OK != r) break;
         		r = ngp_read_xtension(ff, my_hn, 0);
			break;			/* we can have many subsequent HDU defs */

         default:	l = strlen(ngp_linkey.name);
			if ((l >= 2) && (l <= 6))
			  { if ('#' == ngp_linkey.name[l - 1])
			      { if (0 == incrementor_name[0])
			          { memcpy(incrementor_name, ngp_linkey.name, l - 1);
			            incrementor_name[l - 1] = 0;
			          }
			        if (((l - 1) == (int)strlen(incrementor_name)) && (0 == memcmp(incrementor_name, ngp_linkey.name, l - 1)))
			          { incrementor_index++;
			          }
			        snprintf(ngp_linkey.name + l - 1, NGP_MAX_NAME-l+1,"%d", incrementor_index);
			      }
			  }
         		r = ngp_hdu_insert_token(&ngph, &ngp_linkey); 
			break;			/* here we can add keyword */
       }
      if (NGP_OK != r) break;
    }

   fits_movabs_hdu(ff, my_hn, &tmp0, &r);	/* back to our HDU */

   if (NGP_OK == r)				/* create additional columns, if requested */
     r = ngp_append_columns(ff, &ngph, 6);

   if (NGP_OK == r)				/* and write keywords */
     r = ngp_keyword_all_write(&ngph, ff, NGP_NON_SYSTEM_ONLY);

   if (NGP_OK != r)			/* delete group in case of error */
     { tmp0 = 0;
       fits_remove_group(ff, OPT_RM_GPT, &tmp0);
     }

   ngp_hdu_clear(&ngph);		/* we are done with this HDU, so delete it */
   return(r);
 }

		/* top level API functions */

/* read whole template. ff should point to the opened empty fits file. */

int	fits_execute_template(fitsfile *ff, char *ngp_template, int *status)
 { int		r, exit_flg, first_extension, i, my_hn, tmp0, keys_exist, more_keys, used_ver;
   char		grnm[NGP_MAX_STRING], used_name[NGP_MAX_STRING];
   long		luv;

   if (NULL == status) return(NGP_NUL_PTR);
   if (NGP_OK != *status) return(*status);

   if ((NULL == ff) || (NULL == ngp_template))
     { *status = NGP_NUL_PTR;
       return(*status);
     }

   ngp_inclevel = 0;				/* initialize things, not all should be zero */
   ngp_grplevel = 0;
   master_grp_idx = 1;
   exit_flg = 0;
   ngp_master_dir[0] = 0;			/* this should be before 1st call to ngp_include_file */
   first_extension = 1;				/* we need to create PHDU */

   if (NGP_OK != (r = ngp_delete_extver_tab()))
     { *status = r;
       return(r);
     }

   fits_get_hdu_num(ff, &my_hn);		/* our HDU position */
   if (my_hn <= 1)				/* check whether we really need to create PHDU */
     { fits_movabs_hdu(ff, 1, &tmp0, status);
       fits_get_hdrspace(ff, &keys_exist, &more_keys, status);
       fits_movabs_hdu(ff, my_hn, &tmp0, status);
       if (NGP_OK != *status) return(*status);	/* error here means file is corrupted */
       if (keys_exist > 0) first_extension = 0;	/* if keywords exist assume PHDU already exist */
     }
   else
     { first_extension = 0;			/* PHDU (followed by 1+ extensions) exist */

       for (i = 2; i<= my_hn; i++)
        { *status = NGP_OK;
          fits_movabs_hdu(ff, 1, &tmp0, status);
          if (NGP_OK != *status) break;

          fits_read_key(ff, TSTRING, "EXTNAME", used_name, NULL, status);
          if (NGP_OK != *status)  continue;

          fits_read_key(ff, TLONG, "EXTVER", &luv, NULL, status);
          used_ver = luv;			/* bugfix - 22-Jan-99, BO - nonalignment of OSF/Alpha */
          if (VALUE_UNDEFINED == *status)
            { used_ver = 1;
              *status = NGP_OK;
            }

          if (NGP_OK == *status) *status = ngp_set_extver(used_name, used_ver);
        }

       fits_movabs_hdu(ff, my_hn, &tmp0, status);
     }
   if (NGP_OK != *status) return(*status);
                                                                          
   if (NGP_OK != (*status = ngp_include_file(ngp_template))) return(*status);

   for (i = strlen(ngp_template) - 1; i >= 0; i--) /* strlen is > 0, otherwise fopen failed */
    { 
#ifdef MSDOS
      if ('\\' == ngp_template[i]) break;
#else
      if ('/' == ngp_template[i]) break;
#endif
    } 
      
   i++;
   if (i > (NGP_MAX_FNAME - 1)) i = NGP_MAX_FNAME - 1;

   if (i > 0)
     { memcpy(ngp_master_dir, ngp_template, i);
       ngp_master_dir[i] = 0;
     }


   for (;;)
    { if (NGP_OK != (r = ngp_read_line(1))) break;	/* EOF always means error here */
      switch (ngp_keyidx)
       {
         case NGP_TOKEN_SIMPLE:
			if (0 == first_extension)	/* simple only allowed in first HDU */
			  { r = NGP_TOKEN_NOT_EXPECT;
			    break;
			  }
			if (NGP_OK != (r = ngp_unread_line())) break;
			r = ngp_read_xtension(ff, 0, NGP_XTENSION_SIMPLE | NGP_XTENSION_FIRST);
			first_extension = 0;
			break;

         case NGP_TOKEN_XTENSION:
			if (NGP_OK != (r = ngp_unread_line())) break;
			r = ngp_read_xtension(ff, 0, (first_extension ? NGP_XTENSION_FIRST : 0));
			first_extension = 0;
			break;

         case NGP_TOKEN_GROUP:
			if (NGP_TTYPE_STRING == ngp_linkey.type)
			  { strncpy(grnm, ngp_linkey.value.s, NGP_MAX_STRING); }
			else
			  { snprintf(grnm,NGP_MAX_STRING, "DEFAULT_GROUP_%d", master_grp_idx++); }
			grnm[NGP_MAX_STRING - 1] = 0;
			r = ngp_read_group(ff, grnm, 0);
			first_extension = 0;
			break;

	 case NGP_TOKEN_EOF:
			exit_flg = 1;
			break;

         default:	r = NGP_TOKEN_NOT_EXPECT;
			break;
       }
      if (exit_flg || (NGP_OK != r)) break;
    }

/* all top level HDUs up to faulty one are left intact in case of i/o error. It is up
   to the caller to call fits_close_file or fits_delete_file when this function returns
   error. */

   ngp_free_line();		/* deallocate last line (if any) */
   ngp_free_prevline();		/* deallocate cached line (if any) */
   ngp_delete_extver_tab();	/* delete extver table (if present), error ignored */
   
   *status = r;
   return(r);
 }
cfitsio-3.47/grparser.h0000644000225700000360000001313513464573432014411 0ustar  cagordonlhea/*		T E M P L A T E   P A R S E R   H E A D E R   F I L E
		=====================================================

		by Jerzy.Borkowski@obs.unige.ch

		Integral Science Data Center
		ch. d'Ecogia 16
		1290 Versoix
		Switzerland

14-Oct-98: initial release
16-Oct-98: reference to fitsio.h removed, also removed strings after #endif
		directives to make gcc -Wall not to complain
20-Oct-98: added declarations NGP_XTENSION_SIMPLE and NGP_XTENSION_FIRST
24-Oct-98: prototype of ngp_read_line() function updated.
22-Jan-99: prototype for ngp_set_extver() function added.
20-Jun-2002 Wm Pence, added support for the HIERARCH keyword convention
            (changed NGP_MAX_NAME from (20) to FLEN_KEYWORD)
*/

#ifndef	GRPARSER_H_INCLUDED
#define	GRPARSER_H_INCLUDED

#ifdef __cplusplus
extern "C" {
#endif

	/* error codes  - now defined in fitsio.h */

	/* common constants definitions */

#define	NGP_ALLOCCHUNK		(1000)
#define	NGP_MAX_INCLUDE		(10)			/* include file nesting limit */
#define	NGP_MAX_COMMENT		(80)			/* max size for comment */
#define	NGP_MAX_NAME		FLEN_KEYWORD		/* max size for KEYWORD (FITS limits it to 8 chars) */
                                                        /* except HIERARCH can have longer effective keyword names */
#define	NGP_MAX_STRING		(80)			/* max size for various strings */
#define	NGP_MAX_ARRAY_DIM	(999)			/* max. number of dimensions in array */
#define NGP_MAX_FNAME           (1000)                  /* max size of combined path+fname */
#define	NGP_MAX_ENVFILES	(10000)			/* max size of CFITSIO_INCLUDE_FILES env. variable */

#define	NGP_TOKEN_UNKNOWN	(-1)			/* token type unknown */
#define	NGP_TOKEN_INCLUDE	(0)			/* \INCLUDE token */
#define	NGP_TOKEN_GROUP		(1)			/* \GROUP token */
#define	NGP_TOKEN_END		(2)			/* \END token */
#define	NGP_TOKEN_XTENSION	(3)			/* XTENSION token */
#define	NGP_TOKEN_SIMPLE	(4)			/* SIMPLE token */
#define	NGP_TOKEN_EOF		(5)			/* End Of File pseudo token */

#define	NGP_TTYPE_UNKNOWN	(0)			/* undef (yet) token type - invalid to print/write to disk */
#define	NGP_TTYPE_BOOL		(1)			/* boolean, it is 'T' or 'F' */
#define	NGP_TTYPE_STRING	(2)			/* something withing "" or starting with letter */
#define	NGP_TTYPE_INT		(3)			/* starting with digit and not with '.' */
#define	NGP_TTYPE_REAL		(4)			/* digits + '.' */
#define	NGP_TTYPE_COMPLEX	(5)			/* 2 reals, separated with ',' */
#define	NGP_TTYPE_NULL		(6)			/* NULL token, format is : NAME = / comment */
#define	NGP_TTYPE_RAW		(7)			/* HISTORY/COMMENT/8SPACES + comment string without / */

#define	NGP_FOUND_EQUAL_SIGN	(1)			/* line contains '=' after keyword name */

#define	NGP_FORMAT_OK		(0)			/* line format OK */
#define	NGP_FORMAT_ERROR	(1)			/* line format error */

#define	NGP_NODE_INVALID	(0)			/* default node type - invalid (to catch errors) */
#define	NGP_NODE_IMAGE		(1)			/* IMAGE type */
#define	NGP_NODE_ATABLE		(2)			/* ASCII table type */
#define	NGP_NODE_BTABLE		(3)			/* BINARY table type */

#define	NGP_NON_SYSTEM_ONLY	(0)			/* save all keywords except NAXIS,BITPIX,etc.. */
#define	NGP_REALLY_ALL		(1)			/* save really all keywords */

#define	NGP_XTENSION_SIMPLE	(1)			/* HDU defined with SIMPLE T */
#define	NGP_XTENSION_FIRST	(2)			/* this is first extension in template */

#define	NGP_LINE_REREAD		(1)			/* reread line */

#define	NGP_BITPIX_INVALID	(-12345)		/* default BITPIX (to catch errors) */

	/* common macro definitions */

#ifdef	NGP_PARSER_DEBUG_MALLOC

#define	ngp_alloc(x)		dal_malloc(x)
#define	ngp_free(x)		dal_free(x)
#define	ngp_realloc(x,y)	dal_realloc(x,y)

#else

#define	ngp_alloc(x)		malloc(x)
#define	ngp_free(x)		free(x)
#define	ngp_realloc(x,y)	realloc(x,y)

#endif

	/* type definitions */

typedef struct NGP_RAW_LINE_STRUCT
      {	char	*line;
	char	*name;
	char	*value;
	int	type;
	char	*comment;
	int	format;
	int	flags;
      } NGP_RAW_LINE;


typedef union NGP_TOKVAL_UNION
      {	char	*s;		/* space allocated separately, be careful !!! */
	char	b;
	int	i;
	double	d;
	struct NGP_COMPLEX_STRUCT
	 { double re;
	   double im;
	 } c;			/* complex value */
      } NGP_TOKVAL;


typedef struct NGP_TOKEN_STRUCT
      { int		type;
        char		name[NGP_MAX_NAME];
        NGP_TOKVAL	value;
        char		comment[NGP_MAX_COMMENT];
      } NGP_TOKEN;


typedef struct NGP_HDU_STRUCT
      {	int		tokcnt;
        NGP_TOKEN	*tok;
      } NGP_HDU;


typedef struct NGP_TKDEF_STRUCT
      {	char	*name;
	int	code;
      } NGP_TKDEF;


typedef struct NGP_EXTVER_TAB_STRUCT
      {	char	*extname;
	int	version;
      } NGP_EXTVER_TAB;


	/* globally visible variables declarations */

extern	NGP_RAW_LINE	ngp_curline;
extern	NGP_RAW_LINE	ngp_prevline;

extern	int		ngp_extver_tab_size;
extern	NGP_EXTVER_TAB	*ngp_extver_tab;


	/* globally visible functions declarations */

int	ngp_get_extver(char *extname, int *version);
int	ngp_set_extver(char *extname, int version);
int	ngp_delete_extver_tab(void);
int	ngp_line_from_file(FILE *fp, char **p);
int	ngp_free_line(void);
int	ngp_free_prevline(void);
int	ngp_read_line_buffered(FILE *fp);
int	ngp_unread_line(void);
int	ngp_extract_tokens(NGP_RAW_LINE *cl);
int	ngp_include_file(char *fname);
int	ngp_read_line(int ignore_blank_lines);
int	ngp_keyword_is_write(NGP_TOKEN *ngp_tok);
int     ngp_keyword_all_write(NGP_HDU *ngph, fitsfile *ffp, int mode);
int	ngp_hdu_init(NGP_HDU *ngph);
int	ngp_hdu_clear(NGP_HDU *ngph);
int	ngp_hdu_insert_token(NGP_HDU *ngph, NGP_TOKEN *newtok);
int	ngp_append_columns(fitsfile *ff, NGP_HDU *ngph, int aftercol);
int	ngp_read_xtension(fitsfile *ff, int parent_hn, int simple_mode);
int	ngp_read_group(fitsfile *ff, char *grpname, int parent_hn);

		/* top level API function - now defined in fitsio.h */

#ifdef __cplusplus
}
#endif

#endif
cfitsio-3.47/histo.c0000644000225700000360000025143613464573432013715 0ustar  cagordonlhea/*   Globally defined histogram parameters */
#include 
#include 
#include 
#include 
#include "fitsio2.h"

typedef struct {  /*  Structure holding all the histogramming information   */
   union {        /*  the iterator work functions (ffwritehist, ffcalchist) */
      char   *b;  /*  need to do their job... passed via *userPointer.      */
      short  *i;
      int    *j;
      float  *r;
      double *d;
   } hist;

   fitsfile *tblptr;

   int   haxis, hcolnum[4], himagetype;
   long  haxis1, haxis2, haxis3, haxis4;
   double amin1, amin2, amin3, amin4;
   double maxbin1, maxbin2, maxbin3, maxbin4;
   double binsize1, binsize2, binsize3, binsize4;
   int   wtrecip, wtcolnum;
   double weight;
   char  *rowselector;

} histType;

/*--------------------------------------------------------------------------*/
int ffbins(char *binspec,   /* I - binning specification */
                   int *imagetype,      /* O - image type, TINT or TSHORT */
                   int *histaxis,       /* O - no. of axes in the histogram */
                   char colname[4][FLEN_VALUE],  /* column name for axis */
                   double *minin,        /* minimum value for each axis */
                   double *maxin,        /* maximum value for each axis */
                   double *binsizein,    /* size of bins on each axis */
                   char minname[4][FLEN_VALUE],  /* keyword name for min */
                   char maxname[4][FLEN_VALUE],  /* keyword name for max */
                   char binname[4][FLEN_VALUE],  /* keyword name for binsize */
                   double *wt,          /* weighting factor          */
                   char *wtname,        /* keyword or column name for weight */
                   int *recip,          /* the reciprocal of the weight? */
                   int *status)
{
/*
   Parse the input binning specification string, returning the binning
   parameters.  Supports up to 4 dimensions.  The binspec string has
   one of these forms:

   bin binsize                  - 2D histogram with binsize on each axis
   bin xcol                     - 1D histogram on column xcol
   bin (xcol, ycol) = binsize   - 2D histogram with binsize on each axis
   bin x=min:max:size, y=min:max:size, z..., t... 
   bin x=:max, y=::size
   bin x=size, y=min::size

   most other reasonable combinations are supported.        
*/
    int ii, slen, defaulttype;
    char *ptr, tmpname[FLEN_VALUE], *file_expr = NULL;
    double  dummy;

    if (*status > 0)
         return(*status);

    /* set the default values */
    *histaxis = 2;
    *imagetype = TINT;
    defaulttype = 1;
    *wt = 1.;
    *recip = 0;
    *wtname = '\0';

    /* set default values */
    for (ii = 0; ii < 4; ii++)
    {
        *colname[ii] = '\0';
        *minname[ii] = '\0';
        *maxname[ii] = '\0';
        *binname[ii] = '\0';
        minin[ii] = DOUBLENULLVALUE;  /* undefined values */
        maxin[ii] = DOUBLENULLVALUE;
        binsizein[ii] = DOUBLENULLVALUE;
    }

    ptr = binspec + 3;  /* skip over 'bin' */

    if (*ptr == 'i' )  /* bini */
    {
        *imagetype = TSHORT;
        defaulttype = 0;
        ptr++;
    }
    else if (*ptr == 'j' )  /* binj; same as default */
    {
        defaulttype = 0;
        ptr ++;
    }
    else if (*ptr == 'r' )  /* binr */
    {
        *imagetype = TFLOAT;
        defaulttype = 0;
        ptr ++;
    }
    else if (*ptr == 'd' )  /* bind */
    {
        *imagetype = TDOUBLE;
        defaulttype = 0;
        ptr ++;
    }
    else if (*ptr == 'b' )  /* binb */
    {
        *imagetype = TBYTE;
        defaulttype = 0;
        ptr ++;
    }

    if (*ptr == '\0')  /* use all defaults for other parameters */
        return(*status);
    else if (*ptr != ' ')  /* must be at least one blank */
    {
        ffpmsg("binning specification syntax error:");
        ffpmsg(binspec);
        return(*status = URL_PARSE_ERROR);
    }

    while (*ptr == ' ')  /* skip over blanks */
           ptr++;

    if (*ptr == '\0')   /* no other parameters; use defaults */
        return(*status);

    /* Check if need to import expression from a file */

    if( *ptr=='@' ) {
       if( ffimport_file( ptr+1, &file_expr, status ) ) return(*status);
       ptr = file_expr;
       while (*ptr == ' ')
               ptr++;       /* skip leading white space... again */
    }

    if (*ptr == '(' )
    {
        /* this must be the opening parenthesis around a list of column */
        /* names, optionally followed by a '=' and the binning spec. */

        for (ii = 0; ii < 4; ii++)
        {
            ptr++;               /* skip over the '(', ',', or ' ') */
            while (*ptr == ' ')  /* skip over blanks */
                ptr++;

            slen = strcspn(ptr, " ,)");
            strncat(colname[ii], ptr, slen); /* copy 1st column name */

            ptr += slen;
            while (*ptr == ' ')  /* skip over blanks */
                ptr++;

            if (*ptr == ')' )   /* end of the list of names */
            {
                *histaxis = ii + 1;
                break;
            }
        }

        if (ii == 4)   /* too many names in the list , or missing ')'  */
        {
            ffpmsg(
 "binning specification has too many column names or is missing closing ')':");
            ffpmsg(binspec);
	    if( file_expr ) free( file_expr );
            return(*status = URL_PARSE_ERROR);
        }

        ptr++;  /* skip over the closing parenthesis */
        while (*ptr == ' ')  /* skip over blanks */
            ptr++;

        if (*ptr == '\0') {
	    if( file_expr ) free( file_expr );
            return(*status);  /* parsed the entire string */
	}

        else if (*ptr != '=')  /* must be an equals sign now*/
        {
            ffpmsg("illegal binning specification in URL:");
            ffpmsg(" an equals sign '=' must follow the column names");
            ffpmsg(binspec);
	    if( file_expr ) free( file_expr );
            return(*status = URL_PARSE_ERROR);
        }

        ptr++;  /* skip over the equals sign */
        while (*ptr == ' ')  /* skip over blanks */
            ptr++;

        /* get the single range specification for all the columns */
        ffbinr(&ptr, tmpname, minin,
                                     maxin, binsizein, minname[0],
                                     maxname[0], binname[0], status);
        if (*status > 0)
        {
            ffpmsg("illegal binning specification in URL:");
            ffpmsg(binspec);
	    if( file_expr ) free( file_expr );
            return(*status);
        }

        for (ii = 1; ii < *histaxis; ii++)
        {
            minin[ii] = minin[0];
            maxin[ii] = maxin[0];
            binsizein[ii] = binsizein[0];
            strcpy(minname[ii], minname[0]);
            strcpy(maxname[ii], maxname[0]);
            strcpy(binname[ii], binname[0]);
        }

        while (*ptr == ' ')  /* skip over blanks */
            ptr++;

        if (*ptr == ';')
            goto getweight;   /* a weighting factor is specified */

        if (*ptr != '\0')  /* must have reached end of string */
        {
            ffpmsg("illegal syntax after binning range specification in URL:");
            ffpmsg(binspec);
	    if( file_expr ) free( file_expr );
            return(*status = URL_PARSE_ERROR);
        }

        return(*status);
    }             /* end of case with list of column names in ( )  */

    /* if we've reached this point, then the binning specification */
    /* must be of the form: XCOL = min:max:binsize, YCOL = ...     */
    /* where the column name followed by '=' are optional.         */
    /* If the column name is not specified, then use the default name */

    for (ii = 0; ii < 4; ii++) /* allow up to 4 histogram dimensions */
    {
        ffbinr(&ptr, colname[ii], &minin[ii],
                                     &maxin[ii], &binsizein[ii], minname[ii],
                                     maxname[ii], binname[ii], status);

        if (*status > 0)
        {
            ffpmsg("illegal syntax in binning range specification in URL:");
            ffpmsg(binspec);
	    if( file_expr ) free( file_expr );
            return(*status);
        }

        if (*ptr == '\0' || *ptr == ';')
            break;        /* reached the end of the string */

        if (*ptr == ' ')
        {
            while (*ptr == ' ')  /* skip over blanks */
                ptr++;

            if (*ptr == '\0' || *ptr == ';')
                break;        /* reached the end of the string */

            if (*ptr == ',')
                ptr++;  /* comma separates the next column specification */
        }
        else if (*ptr == ',')
        {          
            ptr++;  /* comma separates the next column specification */
        }
        else
        {
            ffpmsg("illegal characters following binning specification in URL:");
            ffpmsg(binspec);
	    if( file_expr ) free( file_expr );
            return(*status = URL_PARSE_ERROR);
        }
    }

    if (ii == 4)
    {
        /* there are yet more characters in the string */
        ffpmsg("illegal binning specification in URL:");
        ffpmsg("apparently greater than 4 histogram dimensions");
        ffpmsg(binspec);
        return(*status = URL_PARSE_ERROR);
    }
    else
        *histaxis = ii + 1;

    /* special case: if a single number was entered it should be      */
    /* interpreted as the binning factor for the default X and Y axes */

    if (*histaxis == 1 && *colname[0] == '\0' && 
         minin[0] == DOUBLENULLVALUE && maxin[0] == DOUBLENULLVALUE)
    {
        *histaxis = 2;
        binsizein[1] = binsizein[0];
    }

getweight:
    if (*ptr == ';')  /* looks like a weighting factor is given */
    {
        ptr++;
       
        while (*ptr == ' ')  /* skip over blanks */
            ptr++;

        recip = 0;
        if (*ptr == '/')
        {
            *recip = 1;  /* the reciprocal of the weight is entered */
            ptr++;

            while (*ptr == ' ')  /* skip over blanks */
                ptr++;
        }

        /* parse the weight as though it were a binrange. */
        /* either a column name or a numerical value will be returned */

        ffbinr(&ptr, wtname, &dummy, &dummy, wt, tmpname,
                                     tmpname, tmpname, status);

        if (*status > 0)
        {
            ffpmsg("illegal binning weight specification in URL:");
            ffpmsg(binspec);
	    if( file_expr ) free( file_expr );
            return(*status);
        }

        /* creat a float datatype histogram by default, if weight */
        /* factor is not = 1.0  */

        if ( (defaulttype && *wt != 1.0) || (defaulttype && *wtname) )
            *imagetype = TFLOAT;
    }

    while (*ptr == ' ')  /* skip over blanks */
         ptr++;

    if (*ptr != '\0')  /* should have reached the end of string */
    {
        ffpmsg("illegal syntax after binning weight specification in URL:");
        ffpmsg(binspec);
        *status = URL_PARSE_ERROR;
    }

    if( file_expr ) free( file_expr );
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffbinr(char **ptr, 
                   char *colname, 
                   double *minin,
                   double *maxin, 
                   double *binsizein,
                   char *minname,
                   char *maxname,
                   char *binname,
                   int *status)
/*
   Parse the input binning range specification string, returning 
   the column name, histogram min and max values, and bin size.
*/
{
    int slen, isanumber=0;
    char *token=0;

    if (*status > 0)
        return(*status);

    slen = fits_get_token2(ptr, " ,=:;", &token, &isanumber, status); /* get 1st token */

    if ((*status) || (slen == 0 && (**ptr == '\0' || **ptr == ',' || **ptr == ';')) )
        return(*status);   /* a null range string */
        
    if (!isanumber && **ptr != ':')
    {
        /* this looks like the column name */
        
        /* Check for case where col name string is empty but '='
           is still there (indicating a following specification string).
           Musn't enter this block as token would not have been allocated. */
        if (token)
        {
           if (strlen(token) > FLEN_VALUE-1)
           {
              ffpmsg("column name too long (ffbinr)");
              free(token);
              return(*status=PARSE_SYNTAX_ERR);
           }
           if (token[0] == '#' && isdigit((int) token[1]) )
           {
               /* omit the leading '#' in the column number */
               strcpy(colname, token+1);
           }
           else
               strcpy(colname, token);
           free(token);
           token=0;
        }
        while (**ptr == ' ')  /* skip over blanks */
             (*ptr)++;

        if (**ptr != '=')
            return(*status);  /* reached the end */
            
        (*ptr)++;   /* skip over the = sign */

        while (**ptr == ' ')  /* skip over blanks */
             (*ptr)++;

        /* get specification info */
        slen = fits_get_token2(ptr, " ,:;", &token, &isanumber, status);
        if (*status)
           return(*status);
    }

    if (**ptr != ':')
    {
        /* This is the first token, and since it is not followed by 
         a ':' this must be the binsize token. Or it could be empty. */
        if (token)
        {
           if (!isanumber)
           {
               if (strlen(token) > FLEN_VALUE-1)
               {
                  ffpmsg("binname too long (ffbinr)");
                  free(token);
                  return(*status=PARSE_SYNTAX_ERR);
               }
               strcpy(binname, token);
           }
           else
               *binsizein =  strtod(token, NULL);

           free(token);
        }
           
        return(*status);  /* reached the end */
    }
    else
    {
        /* the token contains the min value */
        if (slen)
        {
            if (!isanumber)
            {
                if (strlen(token) > FLEN_VALUE-1)
                {
                   ffpmsg("minname too long (ffbinr)");
                   free(token);
                   return(*status=PARSE_SYNTAX_ERR);
                }
                strcpy(minname, token);
            }
            else
                *minin = strtod(token, NULL);
            free(token);
            token=0;
        }
    }

    (*ptr)++;  /* skip the colon between the min and max values */
    slen = fits_get_token2(ptr, " ,:;", &token, &isanumber, status); /* get token */
    if (*status)
       return(*status);

    /* the token contains the max value */
    if (slen)
    {
        if (!isanumber)
        {
            if (strlen(token) > FLEN_VALUE-1)
            {
               ffpmsg("maxname too long (ffbinr)");
               free(token);
               return(*status=PARSE_SYNTAX_ERR);
            }
            strcpy(maxname, token);
        }
        else
            *maxin = strtod(token, NULL);
        free(token);
        token=0;
    }

    if (**ptr != ':')
    {
        free(token);
        return(*status);  /* reached the end; no binsize token */
    }

    (*ptr)++;  /* skip the colon between the max and binsize values */
    slen = fits_get_token2(ptr, " ,:;", &token, &isanumber, status); /* get token */
    if (*status)
       return(*status);

    /* the token contains the binsize value */
    if (slen)
    {
        if (!isanumber)
        {
            if (strlen(token) > FLEN_VALUE-1)
            {
               ffpmsg("binname too long (ffbinr)");
               free(token);
               return(*status=PARSE_SYNTAX_ERR);
            }
            strcpy(binname, token);
        }
        else
            *binsizein = strtod(token, NULL);
        free(token);
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffhist2(fitsfile **fptr,  /* IO - pointer to table with X and Y cols;    */
                             /*     on output, points to histogram image    */
           char *outfile,    /* I - name for the output histogram file      */
           int imagetype,    /* I - datatype for image: TINT, TSHORT, etc   */
           int naxis,        /* I - number of axes in the histogram image   */
           char colname[4][FLEN_VALUE],   /* I - column names               */
           double *minin,     /* I - minimum histogram value, for each axis */
           double *maxin,     /* I - maximum histogram value, for each axis */
           double *binsizein, /* I - bin size along each axis               */
           char minname[4][FLEN_VALUE], /* I - optional keywords for min    */
           char maxname[4][FLEN_VALUE], /* I - optional keywords for max    */
           char binname[4][FLEN_VALUE], /* I - optional keywords for binsize */
           double weightin,        /* I - binning weighting factor          */
           char wtcol[FLEN_VALUE], /* I - optional keyword or col for weight*/
           int recip,              /* I - use reciprocal of the weight?     */
           char *selectrow,        /* I - optional array (length = no. of   */
                             /* rows in the table).  If the element is true */
                             /* then the corresponding row of the table will*/
                             /* be included in the histogram, otherwise the */
                             /* row will be skipped.  Ingnored if *selectrow*/
                             /* is equal to NULL.                           */
           int *status)
{
    fitsfile *histptr;
    int   bitpix, colnum[4], wtcolnum;
    long haxes[4];
    double amin[4], amax[4], binsize[4],  weight;

    if (*status > 0)
        return(*status);

    if (naxis > 4)
    {
        ffpmsg("histogram has more than 4 dimensions");
        return(*status = BAD_DIMEN);
    }

    /* reset position to the correct HDU if necessary */
    if ((*fptr)->HDUposition != ((*fptr)->Fptr)->curhdu)
        ffmahd(*fptr, ((*fptr)->HDUposition) + 1, NULL, status);

    if (imagetype == TBYTE)
        bitpix = BYTE_IMG;
    else if (imagetype == TSHORT)
        bitpix = SHORT_IMG;
    else if (imagetype == TINT)
        bitpix = LONG_IMG;
    else if (imagetype == TFLOAT)
        bitpix = FLOAT_IMG;
    else if (imagetype == TDOUBLE)
        bitpix = DOUBLE_IMG;
    else
        return(*status = BAD_DATATYPE);

    
    /*    Calculate the binning parameters:    */
    /*   columm numbers, axes length, min values,  max values, and binsizes.  */

    if (fits_calc_binningd(
      *fptr, naxis, colname, minin, maxin, binsizein, minname, maxname, binname,
      colnum,  haxes, amin, amax, binsize, status) > 0)
    {
        ffpmsg("failed to determine binning parameters");
        return(*status);
    }
 
    /* get the histogramming weighting factor, if any */
    if (*wtcol)
    {
        /* first, look for a keyword with the weight value */
        if (ffgky(*fptr, TDOUBLE, wtcol, &weight, NULL, status) )
        {
            /* not a keyword, so look for column with this name */
            *status = 0;

            /* get the column number in the table */
            if (ffgcno(*fptr, CASEINSEN, wtcol, &wtcolnum, status) > 0)
            {
               ffpmsg(
               "keyword or column for histogram weights doesn't exist: ");
               ffpmsg(wtcol);
               return(*status);
            }

            weight = DOUBLENULLVALUE;
        }
    }
    else
        weight = (double) weightin;

    if (weight <= 0. && weight != DOUBLENULLVALUE)
    {
        ffpmsg("Illegal histogramming weighting factor <= 0.");
        return(*status = URL_PARSE_ERROR);
    }

    if (recip && weight != DOUBLENULLVALUE)
       /* take reciprocal of weight */
       weight = (double) (1.0 / weight);

    /* size of histogram is now known, so create temp output file */
    if (fits_create_file(&histptr, outfile, status) > 0)
    {
        ffpmsg("failed to create temp output file for histogram");
        return(*status);
    }

    /* create output FITS image HDU */
    if (ffcrim(histptr, bitpix, naxis, haxes, status) > 0)
    {
        ffpmsg("failed to create output histogram FITS image");
        return(*status);
    }

    /* copy header keywords, converting pixel list WCS keywords to image WCS form */
    if (fits_copy_pixlist2image(*fptr, histptr, 9, naxis, colnum, status) > 0)
    {
        ffpmsg("failed to copy pixel list keywords to new histogram header");
        return(*status);
    }

    /* if the table columns have no WCS keywords, then write default keywords */
    fits_write_keys_histo(*fptr, histptr, naxis, colnum, status);
    
    /* update the WCS keywords for the ref. pixel location, and pixel size */
    fits_rebin_wcsd(histptr, naxis, amin, binsize,  status);      
    
    /* now compute the output image by binning the column values */
    if (fits_make_histd(*fptr, histptr, bitpix, naxis, haxes, colnum, amin, amax,
        binsize, weight, wtcolnum, recip, selectrow, status) > 0)
    {
        ffpmsg("failed to calculate new histogram values");
        return(*status);
    }
              
    /* finally, close the original file and return ptr to the new image */
    ffclos(*fptr, status);
    *fptr = histptr;

    return(*status);
}
/*--------------------------------------------------------------------------*/

/* ffhist3: same as ffhist2, but does not close the original file */
/*  and/or replace the original file pointer */
fitsfile *ffhist3(fitsfile *fptr, /* I - ptr to table with X and Y cols*/
           char *outfile,    /* I - name for the output histogram file      */
           int imagetype,    /* I - datatype for image: TINT, TSHORT, etc   */
           int naxis,        /* I - number of axes in the histogram image   */
           char colname[4][FLEN_VALUE],   /* I - column names               */
           double *minin,     /* I - minimum histogram value, for each axis */
           double *maxin,     /* I - maximum histogram value, for each axis */
           double *binsizein, /* I - bin size along each axis               */
           char minname[4][FLEN_VALUE], /* I - optional keywords for min    */
           char maxname[4][FLEN_VALUE], /* I - optional keywords for max    */
           char binname[4][FLEN_VALUE], /* I - optional keywords for binsize */
           double weightin,        /* I - binning weighting factor          */
           char wtcol[FLEN_VALUE], /* I - optional keyword or col for weight*/
           int recip,              /* I - use reciprocal of the weight?     */
           char *selectrow,        /* I - optional array (length = no. of   */
                             /* rows in the table).  If the element is true */
                             /* then the corresponding row of the table will*/
                             /* be included in the histogram, otherwise the */
                             /* row will be skipped.  Ingnored if *selectrow*/
                             /* is equal to NULL.                           */
           int *status)
{
    fitsfile *histptr;
    int   bitpix, colnum[4], wtcolnum;
    long haxes[4];
    double amin[4], amax[4], binsize[4],  weight;

    if (*status > 0)
        return(NULL);

    if (naxis > 4)
    {
        ffpmsg("histogram has more than 4 dimensions");
	*status = BAD_DIMEN;
        return(NULL);
    }

    /* reset position to the correct HDU if necessary */
    if ((fptr)->HDUposition != ((fptr)->Fptr)->curhdu)
        ffmahd(fptr, ((fptr)->HDUposition) + 1, NULL, status);

    if (imagetype == TBYTE)
        bitpix = BYTE_IMG;
    else if (imagetype == TSHORT)
        bitpix = SHORT_IMG;
    else if (imagetype == TINT)
        bitpix = LONG_IMG;
    else if (imagetype == TFLOAT)
        bitpix = FLOAT_IMG;
    else if (imagetype == TDOUBLE)
        bitpix = DOUBLE_IMG;
    else{
        *status = BAD_DATATYPE;
        return(NULL);
    }
    
    /*    Calculate the binning parameters:    */
    /*   columm numbers, axes length, min values,  max values, and binsizes.  */

    if (fits_calc_binningd(
      fptr, naxis, colname, minin, maxin, binsizein, minname, maxname, binname,
      colnum, haxes, amin, amax, binsize, status) > 0)
    {
       ffpmsg("failed to determine binning parameters");
        return(NULL);
    }
 
    /* get the histogramming weighting factor, if any */
    if (*wtcol)
    {
        /* first, look for a keyword with the weight value */
        if (fits_read_key(fptr, TDOUBLE, wtcol, &weight, NULL, status) )
        {
            /* not a keyword, so look for column with this name */
            *status = 0;

            /* get the column number in the table */
            if (ffgcno(fptr, CASEINSEN, wtcol, &wtcolnum, status) > 0)
            {
               ffpmsg(
               "keyword or column for histogram weights doesn't exist: ");
               ffpmsg(wtcol);
               return(NULL);
            }

            weight = DOUBLENULLVALUE;
        }
    }
    else
        weight = (double) weightin;

    if (weight <= 0. && weight != DOUBLENULLVALUE)
    {
        ffpmsg("Illegal histogramming weighting factor <= 0.");
	*status = URL_PARSE_ERROR;
        return(NULL);
    }

    if (recip && weight != DOUBLENULLVALUE)
       /* take reciprocal of weight */
       weight = (double) (1.0 / weight);

    /* size of histogram is now known, so create temp output file */
    if (fits_create_file(&histptr, outfile, status) > 0)
    {
        ffpmsg("failed to create temp output file for histogram");
        return(NULL);
    }

    /* create output FITS image HDU */
    if (ffcrim(histptr, bitpix, naxis, haxes, status) > 0)
    {
        ffpmsg("failed to create output histogram FITS image");
        return(NULL);
    }

    /* copy header keywords, converting pixel list WCS keywords to image WCS */
    if (fits_copy_pixlist2image(fptr, histptr, 9, naxis, colnum, status) > 0)
    {
        ffpmsg("failed to copy pixel list keywords to new histogram header");
        return(NULL);
    }

    /* if the table columns have no WCS keywords, then write default keywords */
    fits_write_keys_histo(fptr, histptr, naxis, colnum, status);
    
    /* update the WCS keywords for the ref. pixel location, and pixel size */
    fits_rebin_wcsd(histptr, naxis, amin, binsize,  status);      
    
    /* now compute the output image by binning the column values */
    if (fits_make_histd(fptr, histptr, bitpix, naxis, haxes, colnum, amin, amax,
        binsize, weight, wtcolnum, recip, selectrow, status) > 0)
    {
        ffpmsg("failed to calculate new histogram values");
        return(NULL);
    }
              
    return(histptr);
}
/*--------------------------------------------------------------------------*/
int ffhist(fitsfile **fptr,  /* IO - pointer to table with X and Y cols;    */
                             /*     on output, points to histogram image    */
           char *outfile,    /* I - name for the output histogram file      */
           int imagetype,    /* I - datatype for image: TINT, TSHORT, etc   */
           int naxis,        /* I - number of axes in the histogram image   */
           char colname[4][FLEN_VALUE],   /* I - column names               */
           double *minin,     /* I - minimum histogram value, for each axis */
           double *maxin,     /* I - maximum histogram value, for each axis */
           double *binsizein, /* I - bin size along each axis               */
           char minname[4][FLEN_VALUE], /* I - optional keywords for min    */
           char maxname[4][FLEN_VALUE], /* I - optional keywords for max    */
           char binname[4][FLEN_VALUE], /* I - optional keywords for binsize */
           double weightin,        /* I - binning weighting factor          */
           char wtcol[FLEN_VALUE], /* I - optional keyword or col for weight*/
           int recip,              /* I - use reciprocal of the weight?     */
           char *selectrow,        /* I - optional array (length = no. of   */
                             /* rows in the table).  If the element is true */
                             /* then the corresponding row of the table will*/
                             /* be included in the histogram, otherwise the */
                             /* row will be skipped.  Ingnored if *selectrow*/
                             /* is equal to NULL.                           */
           int *status)
{
    int ii, datatype, repeat, imin, imax, ibin, bitpix, tstatus, use_datamax = 0;
    long haxes[4];
    fitsfile *histptr;
    char errmsg[FLEN_ERRMSG], keyname[FLEN_KEYWORD], card[FLEN_CARD];
    tcolumn *colptr;
    iteratorCol imagepars[1];
    int n_cols = 1, nkeys;
    long  offset = 0;
    long n_per_loop = -1;  /* force whole array to be passed at one time */
    histType histData;    /* Structure holding histogram info for iterator */
    
    double amin[4], amax[4], binsize[4], maxbin[4];
    double datamin = DOUBLENULLVALUE, datamax = DOUBLENULLVALUE;
    char svalue[FLEN_VALUE];
    double dvalue;
    char cpref[4][FLEN_VALUE];
    char *cptr;

    if (*status > 0)
        return(*status);

    if (naxis > 4)
    {
        ffpmsg("histogram has more than 4 dimensions");
        return(*status = BAD_DIMEN);
    }

    /* reset position to the correct HDU if necessary */
    if ((*fptr)->HDUposition != ((*fptr)->Fptr)->curhdu)
        ffmahd(*fptr, ((*fptr)->HDUposition) + 1, NULL, status);

    histData.tblptr     = *fptr;
    histData.himagetype = imagetype;
    histData.haxis      = naxis;
    histData.rowselector = selectrow;

    if (imagetype == TBYTE)
        bitpix = BYTE_IMG;
    else if (imagetype == TSHORT)
        bitpix = SHORT_IMG;
    else if (imagetype == TINT)
        bitpix = LONG_IMG;
    else if (imagetype == TFLOAT)
        bitpix = FLOAT_IMG;
    else if (imagetype == TDOUBLE)
        bitpix = DOUBLE_IMG;
    else
        return(*status = BAD_DATATYPE);

    /* The CPREF keyword, if it exists, gives the preferred columns. */
    /* Otherwise, assume "X", "Y", "Z", and "T"  */

    tstatus = 0;
    ffgky(*fptr, TSTRING, "CPREF", cpref[0], NULL, &tstatus);

    if (!tstatus)
    {
        /* Preferred column names are given;  separate them */
        cptr = cpref[0];

        /* the first preferred axis... */
        while (*cptr != ',' && *cptr != '\0')
           cptr++;

        if (*cptr != '\0')
        {
           *cptr = '\0';
           cptr++;
           while (*cptr == ' ')
               cptr++;

           strcpy(cpref[1], cptr);
           cptr = cpref[1];

          /* the second preferred axis... */
          while (*cptr != ',' && *cptr != '\0')
             cptr++;

          if (*cptr != '\0')
          {
             *cptr = '\0';
             cptr++;
             while (*cptr == ' ')
                 cptr++;

             strcpy(cpref[2], cptr);
             cptr = cpref[2];

            /* the third preferred axis... */
            while (*cptr != ',' && *cptr != '\0')
               cptr++;

            if (*cptr != '\0')
            {
               *cptr = '\0';
               cptr++;
               while (*cptr == ' ')
                   cptr++;

               strcpy(cpref[3], cptr);

            }
          }
        }
    }

    for (ii = 0; ii < naxis; ii++)
    {

      /* get the min, max, and binsize values from keywords, if specified */

      if (*minname[ii])
      {
         if (ffgky(*fptr, TDOUBLE, minname[ii], &minin[ii], NULL, status) )
         {
             ffpmsg("error reading histogramming minimum keyword");
             ffpmsg(minname[ii]);
             return(*status);
         }
      }

      if (*maxname[ii])
      {
         if (ffgky(*fptr, TDOUBLE, maxname[ii], &maxin[ii], NULL, status) )
         {
             ffpmsg("error reading histogramming maximum keyword");
             ffpmsg(maxname[ii]);
             return(*status);
         }
      }

      if (*binname[ii])
      {
         if (ffgky(*fptr, TDOUBLE, binname[ii], &binsizein[ii], NULL, status) )
         {
             ffpmsg("error reading histogramming binsize keyword");
             ffpmsg(binname[ii]);
             return(*status);
         }
      }

      if (binsizein[ii] == 0.)
      {
        ffpmsg("error: histogram binsize = 0");
        return(*status = ZERO_SCALE);
      }

      if (*colname[ii] == '\0')
      {
         strcpy(colname[ii], cpref[ii]); /* try using the preferred column */
         if (*colname[ii] == '\0')
         {
           if (ii == 0)
              strcpy(colname[ii], "X");
           else if (ii == 1)
              strcpy(colname[ii], "Y");
           else if (ii == 2)
              strcpy(colname[ii], "Z");
           else if (ii == 3)
              strcpy(colname[ii], "T");
         }
      }

      /* get the column number in the table */
      if (ffgcno(*fptr, CASEINSEN, colname[ii], histData.hcolnum+ii, status)
              > 0)
      {
        strcpy(errmsg, "column for histogram axis doesn't exist: ");
        strncat(errmsg, colname[ii], FLEN_ERRMSG-strlen(errmsg)-1);
        ffpmsg(errmsg);
        return(*status);
      }

      colptr = ((*fptr)->Fptr)->tableptr;
      colptr += (histData.hcolnum[ii] - 1);

      repeat = (int) colptr->trepeat;  /* vector repeat factor of the column */
      if (repeat > 1)
      {
        strcpy(errmsg, "Can't bin a vector column: ");
        strncat(errmsg, colname[ii],FLEN_ERRMSG-strlen(errmsg)-1);
        ffpmsg(errmsg);
        return(*status = BAD_DATATYPE);
      }

      /* get the datatype of the column */
      fits_get_coltype(*fptr, histData.hcolnum[ii], &datatype,
         NULL, NULL, status);

      if (datatype < 0 || datatype == TSTRING)
      {
        strcpy(errmsg, "Inappropriate datatype; can't bin this column: ");
        strncat(errmsg, colname[ii],FLEN_ERRMSG-strlen(errmsg)-1);
        ffpmsg(errmsg);
        return(*status = BAD_DATATYPE);
      }

      /* use TLMINn and TLMAXn keyword values if min and max were not given */
      /* else use actual data min and max if TLMINn and TLMAXn don't exist */
 
      if (minin[ii] == DOUBLENULLVALUE)
      {
        ffkeyn("TLMIN", histData.hcolnum[ii], keyname, status);
        if (ffgky(*fptr, TDOUBLE, keyname, amin+ii, NULL, status) > 0)
        {
            /* use actual data minimum value for the histogram minimum */
            *status = 0;
            if (fits_get_col_minmax(*fptr, histData.hcolnum[ii], amin+ii, &datamax, status) > 0)
            {
                strcpy(errmsg, "Error calculating datamin and datamax for column: ");
                strncat(errmsg, colname[ii],FLEN_ERRMSG-strlen(errmsg)-1);
                ffpmsg(errmsg);
                return(*status);
            }
         }
      }
      else
      {
        amin[ii] = (double) minin[ii];
      }

      if (maxin[ii] == DOUBLENULLVALUE)
      {
        ffkeyn("TLMAX", histData.hcolnum[ii], keyname, status);
        if (ffgky(*fptr, TDOUBLE, keyname, &amax[ii], NULL, status) > 0)
        {
          *status = 0;
          if(datamax != DOUBLENULLVALUE)  /* already computed max value */
          {
             amax[ii] = datamax;
          }
          else
          {
             /* use actual data maximum value for the histogram maximum */
             if (fits_get_col_minmax(*fptr, histData.hcolnum[ii], &datamin, &amax[ii], status) > 0)
             {
                 strcpy(errmsg, "Error calculating datamin and datamax for column: ");
                 strncat(errmsg, colname[ii],FLEN_ERRMSG-strlen(errmsg)-1);
                 ffpmsg(errmsg);
                 return(*status);
             }
          }
        }
        use_datamax = 1;  /* flag that the max was determined by the data values */
                          /* and not specifically set by the calling program */
      }
      else
      {
        amax[ii] = (double) maxin[ii];
      }

      /* use TDBINn keyword or else 1 if bin size is not given */
      if (binsizein[ii] == DOUBLENULLVALUE)
      {
         tstatus = 0;
         ffkeyn("TDBIN", histData.hcolnum[ii], keyname, &tstatus);

         if (ffgky(*fptr, TDOUBLE, keyname, binsizein + ii, NULL, &tstatus) > 0)
         {
	    /* make at least 10 bins */
            binsizein[ii] = (amax[ii] - amin[ii]) / 10. ;
            if (binsizein[ii] > 1.)
                binsizein[ii] = 1.;  /* use default bin size */
         }
      }

      if ( (amin[ii] > amax[ii] && binsizein[ii] > 0. ) ||
           (amin[ii] < amax[ii] && binsizein[ii] < 0. ) )
          binsize[ii] = (double) -binsizein[ii];  /* reverse the sign of binsize */
      else
          binsize[ii] =  (double) binsizein[ii];  /* binsize has the correct sign */

      ibin = (int) binsize[ii];
      imin = (int) amin[ii];
      imax = (int) amax[ii];

      /* Determine the range and number of bins in the histogram. This  */
      /* depends on whether the input columns are integer or floats, so */
      /* treat each case separately.                                    */

      if (datatype <= TLONG && (double) imin == amin[ii] &&
 	                       (double) imax == amax[ii] &&
                               (double) ibin == binsize[ii] )
      {
        /* This is an integer column and integer limits were entered. */
        /* Shift the lower and upper histogramming limits by 0.5, so that */
        /* the values fall in the center of the bin, not on the edge. */

        haxes[ii] = (imax - imin) / ibin + 1;  /* last bin may only */
                                               /* be partially full */
        maxbin[ii] = (double) (haxes[ii] + 1.);  /* add 1. instead of .5 to avoid roundoff */

        if (amin[ii] < amax[ii])
        {
          amin[ii] = (double) (amin[ii] - 0.5);
          amax[ii] = (double) (amax[ii] + 0.5);
        }
        else
        {
          amin[ii] = (double) (amin[ii] + 0.5);
          amax[ii] = (double) (amax[ii] - 0.5);
        }
      }
      else if (use_datamax)  
      {
        /* Either the column datatype and/or the limits are floating point, */
        /* and the histogram limits are being defined by the min and max */
        /* values of the array.  Add 1 to the number of histogram bins to */
        /* make sure that pixels that are equal to the maximum or are */
        /* in the last partial bin are included.  */

        maxbin[ii] = (amax[ii] - amin[ii]) / binsize[ii]; 
        haxes[ii] = (long) (maxbin[ii] + 1);
      }
      else  
      {
        /*  float datatype column and/or limits, and the maximum value to */
        /*  include in the histogram is specified by the calling program. */
        /*  The lower limit is inclusive, but upper limit is exclusive    */
        maxbin[ii] = (amax[ii] - amin[ii]) / binsize[ii];
        haxes[ii] = (long) maxbin[ii];

        if (amin[ii] < amax[ii])
        {
          if (amin[ii] + (haxes[ii] * binsize[ii]) < amax[ii])
            haxes[ii]++;   /* need to include another partial bin */
        }
        else
        {
          if (amin[ii] + (haxes[ii] * binsize[ii]) > amax[ii])
            haxes[ii]++;   /* need to include another partial bin */
        }
      }
    }

       /* get the histogramming weighting factor */
    if (*wtcol)
    {
        /* first, look for a keyword with the weight value */
        if (ffgky(*fptr, TDOUBLE, wtcol, &histData.weight, NULL, status) )
        {
            /* not a keyword, so look for column with this name */
            *status = 0;

            /* get the column number in the table */
            if (ffgcno(*fptr, CASEINSEN, wtcol, &histData.wtcolnum, status) > 0)
            {
               ffpmsg(
               "keyword or column for histogram weights doesn't exist: ");
               ffpmsg(wtcol);
               return(*status);
            }

            histData.weight = DOUBLENULLVALUE;
        }
    }
    else
        histData.weight = (double) weightin;

    if (histData.weight <= 0. && histData.weight != DOUBLENULLVALUE)
    {
        ffpmsg("Illegal histogramming weighting factor <= 0.");
        return(*status = URL_PARSE_ERROR);
    }

    if (recip && histData.weight != DOUBLENULLVALUE)
       /* take reciprocal of weight */
       histData.weight = (double) (1.0 / histData.weight);

    histData.wtrecip = recip;
        
    /* size of histogram is now known, so create temp output file */
    if (ffinit(&histptr, outfile, status) > 0)
    {
        ffpmsg("failed to create temp output file for histogram");
        return(*status);
    }

    if (ffcrim(histptr, bitpix, histData.haxis, haxes, status) > 0)
    {
        ffpmsg("failed to create primary array histogram in temp file");
        ffclos(histptr, status);
        return(*status);
    }

    /* copy all non-structural keywords from the table to the image */
    fits_get_hdrspace(*fptr, &nkeys, NULL, status);
    for (ii = 1; ii <= nkeys; ii++)
    {
       fits_read_record(*fptr, ii, card, status);
       if (fits_get_keyclass(card) >= 120)
           fits_write_record(histptr, card, status);
    }           

    /* Set global variables with histogram parameter values.    */
    /* Use separate scalar variables rather than arrays because */
    /* it is more efficient when computing the histogram.       */

    histData.amin1 = amin[0];
    histData.maxbin1 = maxbin[0];
    histData.binsize1 = binsize[0];
    histData.haxis1 = haxes[0];

    if (histData.haxis > 1)
    {
      histData.amin2 = amin[1];
      histData.maxbin2 = maxbin[1];
      histData.binsize2 = binsize[1];
      histData.haxis2 = haxes[1];

      if (histData.haxis > 2)
      {
        histData.amin3 = amin[2];
        histData.maxbin3 = maxbin[2];
        histData.binsize3 = binsize[2];
        histData.haxis3 = haxes[2];

        if (histData.haxis > 3)
        {
          histData.amin4 = amin[3];
          histData.maxbin4 = maxbin[3];
          histData.binsize4 = binsize[3];
          histData.haxis4 = haxes[3];
        }
      }
    }

    /* define parameters of image for the iterator function */
    fits_iter_set_file(imagepars, histptr);        /* pointer to image */
    fits_iter_set_datatype(imagepars, imagetype);  /* image datatype   */
    fits_iter_set_iotype(imagepars, OutputCol);    /* image is output  */

    /* call the iterator function to write out the histogram image */
    if (fits_iterate_data(n_cols, imagepars, offset, n_per_loop,
                          ffwritehisto, (void*)&histData, status) )
         return(*status);

    /* write the World Coordinate System (WCS) keywords */
    /* create default values if WCS keywords are not present in the table */
    for (ii = 0; ii < histData.haxis; ii++)
    {
     /*  CTYPEn  */
       tstatus = 0;
       ffkeyn("TCTYP", histData.hcolnum[ii], keyname, &tstatus);
       ffgky(*fptr, TSTRING, keyname, svalue, NULL, &tstatus);
       if (tstatus)
       {               /* just use column name as the type */
          tstatus = 0;
          ffkeyn("TTYPE", histData.hcolnum[ii], keyname, &tstatus);
          ffgky(*fptr, TSTRING, keyname, svalue, NULL, &tstatus);
       }

       if (!tstatus)
       {
        ffkeyn("CTYPE", ii + 1, keyname, &tstatus);
        ffpky(histptr, TSTRING, keyname, svalue, "Coordinate Type", &tstatus);
       }
       else
          tstatus = 0;

     /*  CUNITn  */
       ffkeyn("TCUNI", histData.hcolnum[ii], keyname, &tstatus);
       ffgky(*fptr, TSTRING, keyname, svalue, NULL, &tstatus);
       if (tstatus)
       {         /* use the column units */
          tstatus = 0;
          ffkeyn("TUNIT", histData.hcolnum[ii], keyname, &tstatus);
          ffgky(*fptr, TSTRING, keyname, svalue, NULL, &tstatus);
       }

       if (!tstatus)
       {
        ffkeyn("CUNIT", ii + 1, keyname, &tstatus);
        ffpky(histptr, TSTRING, keyname, svalue, "Coordinate Units", &tstatus);
       }
       else
         tstatus = 0;

     /*  CRPIXn  - Reference Pixel  */
       ffkeyn("TCRPX", histData.hcolnum[ii], keyname, &tstatus);
       ffgky(*fptr, TDOUBLE, keyname, &dvalue, NULL, &tstatus);
       if (tstatus)
       {
         dvalue = 1.0; /* choose first pixel in new image as ref. pix. */
         tstatus = 0;
       }
       else
       {
           /* calculate locate of the ref. pix. in the new image */
           dvalue = (dvalue - amin[ii]) / binsize[ii] + .5;
       }

       ffkeyn("CRPIX", ii + 1, keyname, &tstatus);
       ffpky(histptr, TDOUBLE, keyname, &dvalue, "Reference Pixel", &tstatus);

     /*  CRVALn - Value at the location of the reference pixel */
       ffkeyn("TCRVL", histData.hcolnum[ii], keyname, &tstatus);
       ffgky(*fptr, TDOUBLE, keyname, &dvalue, NULL, &tstatus);
       if (tstatus)
       {
         /* calculate value at ref. pix. location (at center of 1st pixel) */
         dvalue = amin[ii] + binsize[ii]/2.;
         tstatus = 0;
       }

       ffkeyn("CRVAL", ii + 1, keyname, &tstatus);
       ffpky(histptr, TDOUBLE, keyname, &dvalue, "Reference Value", &tstatus);

     /*  CDELTn - unit size of pixels  */
       ffkeyn("TCDLT", histData.hcolnum[ii], keyname, &tstatus);
       ffgky(*fptr, TDOUBLE, keyname, &dvalue, NULL, &tstatus);
       if (tstatus)
       {
         dvalue = 1.0;  /* use default pixel size */
         tstatus = 0;
       }

       dvalue = dvalue * binsize[ii];
       ffkeyn("CDELT", ii + 1, keyname, &tstatus);
       ffpky(histptr, TDOUBLE, keyname, &dvalue, "Pixel size", &tstatus);

     /*  CROTAn - Rotation angle (degrees CCW)  */
     /*  There should only be a CROTA2 keyword, and only for 2+ D images */
       if (ii == 1)
       {
         ffkeyn("TCROT", histData.hcolnum[ii], keyname, &tstatus);
         ffgky(*fptr, TDOUBLE, keyname, &dvalue, NULL, &tstatus);
         if (!tstatus && dvalue != 0.)  /* only write keyword if angle != 0 */
         {
           ffkeyn("CROTA", ii + 1, keyname, &tstatus);
           ffpky(histptr, TDOUBLE, keyname, &dvalue,
                 "Rotation angle", &tstatus);
         }
         else
         {
            /* didn't find CROTA for the 2nd axis, so look for one */
            /* on the first axis */
           tstatus = 0;
           ffkeyn("TCROT", histData.hcolnum[0], keyname, &tstatus);
           ffgky(*fptr, TDOUBLE, keyname, &dvalue, NULL, &tstatus);
           if (!tstatus && dvalue != 0.)  /* only write keyword if angle != 0 */
           {
             dvalue *= -1.;   /* negate the value, because mirror image */
             ffkeyn("CROTA", ii + 1, keyname, &tstatus);
             ffpky(histptr, TDOUBLE, keyname, &dvalue,
                   "Rotation angle", &tstatus);
           }
         }
       }
    }

    /* convert any TPn_k keywords to PCi_j; the value remains unchanged */
    /* also convert any TCn_k to CDi_j; the value is modified by n binning size */
    /* This is a bit of a kludge, and only works for 2D WCS */

    if (histData.haxis == 2) {

      /* PC1_1 */
      tstatus = 0;
      ffkeyn("TP", histData.hcolnum[0], card, &tstatus);
      strcat(card,"_");
      ffkeyn(card, histData.hcolnum[0], keyname, &tstatus);
      ffgky(*fptr, TDOUBLE, keyname, &dvalue, card, &tstatus);
      if (!tstatus) 
         ffpky(histptr, TDOUBLE, "PC1_1", &dvalue, card, &tstatus);

      tstatus = 0;
      keyname[1] = 'C';
      ffgky(*fptr, TDOUBLE, keyname, &dvalue, card, &tstatus);
      if (!tstatus) {
         dvalue *=  binsize[0];
         ffpky(histptr, TDOUBLE, "CD1_1", &dvalue, card, &tstatus);
      }

      /* PC1_2 */
      tstatus = 0;
      ffkeyn("TP", histData.hcolnum[0], card, &tstatus);
      strcat(card,"_");
      ffkeyn(card, histData.hcolnum[1], keyname, &tstatus);
      ffgky(*fptr, TDOUBLE, keyname, &dvalue, card, &tstatus);
      if (!tstatus) 
         ffpky(histptr, TDOUBLE, "PC1_2", &dvalue, card, &tstatus);
 
      tstatus = 0;
      keyname[1] = 'C';
      ffgky(*fptr, TDOUBLE, keyname, &dvalue, card, &tstatus);
      if (!tstatus) {
        dvalue *=  binsize[0];
        ffpky(histptr, TDOUBLE, "CD1_2", &dvalue, card, &tstatus);
      }
       
      /* PC2_1 */
      tstatus = 0;
      ffkeyn("TP", histData.hcolnum[1], card, &tstatus);
      strcat(card,"_");
      ffkeyn(card, histData.hcolnum[0], keyname, &tstatus);
      ffgky(*fptr, TDOUBLE, keyname, &dvalue, card, &tstatus);
      if (!tstatus) 
         ffpky(histptr, TDOUBLE, "PC2_1", &dvalue, card, &tstatus);
 
      tstatus = 0;
      keyname[1] = 'C';
      ffgky(*fptr, TDOUBLE, keyname, &dvalue, card, &tstatus);
      if (!tstatus) {
         dvalue *=  binsize[1];
         ffpky(histptr, TDOUBLE, "CD2_1", &dvalue, card, &tstatus);
      }
       
       /* PC2_2 */
      tstatus = 0;
      ffkeyn("TP", histData.hcolnum[1], card, &tstatus);
      strcat(card,"_");
      ffkeyn(card, histData.hcolnum[1], keyname, &tstatus);
      ffgky(*fptr, TDOUBLE, keyname, &dvalue, card, &tstatus);
      if (!tstatus) 
         ffpky(histptr, TDOUBLE, "PC2_2", &dvalue, card, &tstatus);
        
      tstatus = 0;
      keyname[1] = 'C';
      ffgky(*fptr, TDOUBLE, keyname, &dvalue, card, &tstatus);
      if (!tstatus) {
         dvalue *=  binsize[1];
         ffpky(histptr, TDOUBLE, "CD2_2", &dvalue, card, &tstatus);
      }
    }   
       
    /* finally, close the original file and return ptr to the new image */
    ffclos(*fptr, status);
    *fptr = histptr;

    return(*status);
}
/*--------------------------------------------------------------------------*/
/* Single-precision version */
int fits_calc_binning(
      fitsfile *fptr,  /* IO - pointer to table to be binned      ;       */
      int naxis,       /* I - number of axes/columns in the binned image  */
      char colname[4][FLEN_VALUE],   /* I - optional column names         */
      double *minin,     /* I - optional lower bound value for each axis  */
      double *maxin,     /* I - optional upper bound value, for each axis */
      double *binsizein, /* I - optional bin size along each axis         */
      char minname[4][FLEN_VALUE], /* I - optional keywords for min       */
      char maxname[4][FLEN_VALUE], /* I - optional keywords for max       */
      char binname[4][FLEN_VALUE], /* I - optional keywords for binsize   */

    /* The returned parameters for each axis of the n-dimensional histogram are */

      int *colnum,     /* O - column numbers, to be binned */
      long *haxes,     /* O - number of bins in each histogram axis */
      float *amin,     /* O - lower bound of the histogram axes */
      float *amax,     /* O - upper bound of the histogram axes */
      float *binsize,  /* O - width of histogram bins/pixels on each axis */
      int *status)
{
  double amind[4], amaxd[4], binsized[4];

  fits_calc_binningd(fptr, naxis, colname, minin, maxin, binsizein, minname, maxname, binname,
		     colnum, haxes, amind, amaxd, binsized, status);

  /* Copy double precision values into single precision */
  if (*status == 0) {
    int i, naxis1 = 4;
    if (naxis < naxis1) naxis1 = naxis;
    for (i=0; i 0)
        return(*status);

    if (naxis > 4)
    {
        ffpmsg("histograms with more than 4 dimensions are not supported");
        return(*status = BAD_DIMEN);
    }

    /* reset position to the correct HDU if necessary */
    if ((fptr)->HDUposition != ((fptr)->Fptr)->curhdu)
        ffmahd(fptr, ((fptr)->HDUposition) + 1, NULL, status);
    
    /* ============================================================= */
    /* The CPREF keyword, if it exists, gives the preferred columns. */
    /* Otherwise, assume "X", "Y", "Z", and "T"  */

    *cpref[0] = '\0';
    *cpref[1] = '\0';
    *cpref[2] = '\0';
    *cpref[3] = '\0';

    tstatus = 0;
    ffgky(fptr, TSTRING, "CPREF", cpref[0], NULL, &tstatus);

    if (!tstatus)
    {
        /* Preferred column names are given;  separate them */
        cptr = cpref[0];

        /* the first preferred axis... */
        while (*cptr != ',' && *cptr != '\0')
           cptr++;

        if (*cptr != '\0')
        {
           *cptr = '\0';
           cptr++;
           while (*cptr == ' ')
               cptr++;

           strcpy(cpref[1], cptr);
           cptr = cpref[1];

          /* the second preferred axis... */
          while (*cptr != ',' && *cptr != '\0')
             cptr++;

          if (*cptr != '\0')
          {
             *cptr = '\0';
             cptr++;
             while (*cptr == ' ')
                 cptr++;

             strcpy(cpref[2], cptr);
             cptr = cpref[2];

            /* the third preferred axis... */
            while (*cptr != ',' && *cptr != '\0')
               cptr++;

            if (*cptr != '\0')
            {
               *cptr = '\0';
               cptr++;
               while (*cptr == ' ')
                   cptr++;

               strcpy(cpref[3], cptr);

            }
          }
        }
    }

    /* ============================================================= */
    /* Main Loop for calculating parameters for each column          */

    for (ii = 0; ii < naxis; ii++)
    {

      /* =========================================================== */
      /* Determine column Number, based on, in order of priority,
         1  input column name, or
	 2  name given by CPREF keyword, or
	 3  assume X, Y, Z and T for the name
      */
	  
      if (*colname[ii] == '\0')
      {
         strcpy(colname[ii], cpref[ii]); /* try using the preferred column */
         if (*colname[ii] == '\0')
         {
           if (ii == 0)
              strcpy(colname[ii], "X");
           else if (ii == 1)
              strcpy(colname[ii], "Y");
           else if (ii == 2)
              strcpy(colname[ii], "Z");
           else if (ii == 3)
              strcpy(colname[ii], "T");
         }
      }

      /* get the column number in the table */
      if (ffgcno(fptr, CASEINSEN, colname[ii], colnum+ii, status)
              > 0)
      {
          strcpy(errmsg, "column for histogram axis doesn't exist: ");
          strncat(errmsg, colname[ii],FLEN_ERRMSG-strlen(errmsg)-1);
          ffpmsg(errmsg);
          return(*status);
      }

      /* ================================================================ */
      /* check tha column is not a vector or a string                     */

      colptr = ((fptr)->Fptr)->tableptr;
      colptr += (colnum[ii] - 1);

      repeat = (int) colptr->trepeat;  /* vector repeat factor of the column */
      if (repeat > 1)
      {
        strcpy(errmsg, "Can't bin a vector column: ");
        strncat(errmsg, colname[ii],FLEN_ERRMSG-strlen(errmsg)-1);
        ffpmsg(errmsg);
        return(*status = BAD_DATATYPE);
      }

      /* get the datatype of the column */
      fits_get_coltype(fptr, colnum[ii], &datatype,
         NULL, NULL, status);

      if (datatype < 0 || datatype == TSTRING)
      {
        strcpy(errmsg, "Inappropriate datatype; can't bin this column: ");
        strncat(errmsg, colname[ii],FLEN_ERRMSG-strlen(errmsg)-1);
        ffpmsg(errmsg);
        return(*status = BAD_DATATYPE);
      }

      /* ================================================================ */
      /* get the minimum value */

      datamin = DOUBLENULLVALUE;
      datamax = DOUBLENULLVALUE;
      
      if (*minname[ii])
      {
         if (ffgky(fptr, TDOUBLE, minname[ii], &minin[ii], NULL, status) )
         {
             ffpmsg("error reading histogramming minimum keyword");
             ffpmsg(minname[ii]);
             return(*status);
         }
      }

      if (minin[ii] != DOUBLENULLVALUE)
      {
        amin[ii] = (double) minin[ii];
      }
      else
      {
        ffkeyn("TLMIN", colnum[ii], keyname, status);
        if (ffgky(fptr, TDOUBLE, keyname, amin+ii, NULL, status) > 0)
        {
            /* use actual data minimum value for the histogram minimum */
            *status = 0;
            if (fits_get_col_minmax(fptr, colnum[ii], amin+ii, &datamax, status) > 0)
            {
                strcpy(errmsg, "Error calculating datamin and datamax for column: ");
                strncat(errmsg, colname[ii],FLEN_ERRMSG-strlen(errmsg)-1);
                ffpmsg(errmsg);
                return(*status);
            }
         }
      }

      /* ================================================================ */
      /* get the maximum value */

      if (*maxname[ii])
      {
         if (ffgky(fptr, TDOUBLE, maxname[ii], &maxin[ii], NULL, status) )
         {
             ffpmsg("error reading histogramming maximum keyword");
             ffpmsg(maxname[ii]);
             return(*status);
         }
      }

      if (maxin[ii] != DOUBLENULLVALUE)
      {
        amax[ii] = (double) maxin[ii];
      }
      else
      {
        ffkeyn("TLMAX", colnum[ii], keyname, status);
        if (ffgky(fptr, TDOUBLE, keyname, &amax[ii], NULL, status) > 0)
        {
          *status = 0;
          if(datamax != DOUBLENULLVALUE)  /* already computed max value */
          {
             amax[ii] = datamax;
          }
          else
          {
             /* use actual data maximum value for the histogram maximum */
             if (fits_get_col_minmax(fptr, colnum[ii], &datamin, &amax[ii], status) > 0)
             {
                 strcpy(errmsg, "Error calculating datamin and datamax for column: ");
                 strncat(errmsg, colname[ii],FLEN_ERRMSG-strlen(errmsg)-1);
                 ffpmsg(errmsg);
                 return(*status);
             }
          }
        }
        use_datamax = 1;  /* flag that the max was determined by the data values */
                          /* and not specifically set by the calling program */
      }


      /* ================================================================ */
      /* determine binning size and range                                 */

      if (*binname[ii])
      {
         if (ffgky(fptr, TDOUBLE, binname[ii], &binsizein[ii], NULL, status) )
         {
             ffpmsg("error reading histogramming binsize keyword");
             ffpmsg(binname[ii]);
             return(*status);
         }
      }

      if (binsizein[ii] == 0.)
      {
        ffpmsg("error: histogram binsize = 0");
        return(*status = ZERO_SCALE);
      }

      /* use TDBINn keyword or else 1 if bin size is not given */
      if (binsizein[ii] != DOUBLENULLVALUE)
      { 
         binsize[ii] = (double) binsizein[ii];
      }
      else
      {
         tstatus = 0;
         ffkeyn("TDBIN", colnum[ii], keyname, &tstatus);

         if (ffgky(fptr, TDOUBLE, keyname, binsizein + ii, NULL, &tstatus) > 0)
         {
	    /* make at least 10 bins */
            binsize[ii] = (amax[ii] - amin[ii]) / 10.F ;
            if (binsize[ii] > 1.)
                binsize[ii] = 1.;  /* use default bin size */
         }
      }

      /* ================================================================ */
      /* if the min is greater than the max, make the binsize negative */
      if ( (amin[ii] > amax[ii] && binsize[ii] > 0. ) ||
           (amin[ii] < amax[ii] && binsize[ii] < 0. ) )
          binsize[ii] =  -binsize[ii];  /* reverse the sign of binsize */


      ibin = (int) binsize[ii];
      imin = (int) amin[ii];
      imax = (int) amax[ii];

      /* Determine the range and number of bins in the histogram. This  */
      /* depends on whether the input columns are integer or floats, so */
      /* treat each case separately.                                    */

      if (datatype <= TLONG && (double) imin == amin[ii] &&
                               (double) imax == amax[ii] &&
                               (double) ibin == binsize[ii] )
      {
        /* This is an integer column and integer limits were entered. */
        /* Shift the lower and upper histogramming limits by 0.5, so that */
        /* the values fall in the center of the bin, not on the edge. */

        haxes[ii] = (imax - imin) / ibin + 1;  /* last bin may only */
                                               /* be partially full */
        if (amin[ii] < amax[ii])
        {
          amin[ii] = (double) (amin[ii] - 0.5);
          amax[ii] = (double) (amax[ii] + 0.5);
        }
        else
        {
          amin[ii] = (double) (amin[ii] + 0.5);
          amax[ii] = (double) (amax[ii] - 0.5);
        }
      }
      else if (use_datamax)  
      {
        /* Either the column datatype and/or the limits are floating point, */
        /* and the histogram limits are being defined by the min and max */
        /* values of the array.  Add 1 to the number of histogram bins to */
        /* make sure that pixels that are equal to the maximum or are */
        /* in the last partial bin are included.  */

        haxes[ii] = (long) (((amax[ii] - amin[ii]) / binsize[ii]) + 1.); 
      }
      else  
      {
        /*  float datatype column and/or limits, and the maximum value to */
        /*  include in the histogram is specified by the calling program. */
        /*  The lower limit is inclusive, but upper limit is exclusive    */
        haxes[ii] = (long) ((amax[ii] - amin[ii]) / binsize[ii]);

        if (amin[ii] < amax[ii])
        {
          if (amin[ii] + (haxes[ii] * binsize[ii]) < amax[ii])
            haxes[ii]++;   /* need to include another partial bin */
        }
        else
        {
          if (amin[ii] + (haxes[ii] * binsize[ii]) > amax[ii])
            haxes[ii]++;   /* need to include another partial bin */
        }
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_write_keys_histo(
      fitsfile *fptr,   /* I - pointer to table to be binned              */
      fitsfile *histptr,  /* I - pointer to output histogram image HDU      */
      int naxis,        /* I - number of axes in the histogram image      */
      int *colnum,      /* I - column numbers (array length = naxis)      */
      int *status)     
{      
   /*  Write default WCS keywords in the output histogram image header */
   /*  if the keywords do not already exist.   */

    int ii, tstatus;
    char keyname[FLEN_KEYWORD], svalue[FLEN_VALUE];
    double dvalue;
    
    if (*status > 0)
        return(*status);

    for (ii = 0; ii < naxis; ii++)
    {
     /*  CTYPEn  */
       tstatus = 0;
       ffkeyn("CTYPE", ii+1, keyname, &tstatus);
       ffgky(histptr, TSTRING, keyname, svalue, NULL, &tstatus);
       
       if (!tstatus) continue;  /* keyword already exists, so skip to next axis */
       
       /* use column name as the axis name */
       tstatus = 0;
       ffkeyn("TTYPE", colnum[ii], keyname, &tstatus);
       ffgky(fptr, TSTRING, keyname, svalue, NULL, &tstatus);

       if (!tstatus)
       {
         ffkeyn("CTYPE", ii + 1, keyname, &tstatus);
         ffpky(histptr, TSTRING, keyname, svalue, "Coordinate Type", &tstatus);
       }

       /*  CUNITn,  use the column units */
       tstatus = 0;
       ffkeyn("TUNIT", colnum[ii], keyname, &tstatus);
       ffgky(fptr, TSTRING, keyname, svalue, NULL, &tstatus);

       if (!tstatus)
       {
         ffkeyn("CUNIT", ii + 1, keyname, &tstatus);
         ffpky(histptr, TSTRING, keyname, svalue, "Coordinate Units", &tstatus);
       }

       /*  CRPIXn  - Reference Pixel choose first pixel in new image as ref. pix. */
       dvalue = 1.0;
       tstatus = 0;
       ffkeyn("CRPIX", ii + 1, keyname, &tstatus);
       ffpky(histptr, TDOUBLE, keyname, &dvalue, "Reference Pixel", &tstatus);

       /*  CRVALn - Value at the location of the reference pixel */
       dvalue = 1.0;
       tstatus = 0;
       ffkeyn("CRVAL", ii + 1, keyname, &tstatus);
       ffpky(histptr, TDOUBLE, keyname, &dvalue, "Reference Value", &tstatus);

       /*  CDELTn - unit size of pixels  */
       dvalue = 1.0;  
       tstatus = 0;
       dvalue = 1.;
       ffkeyn("CDELT", ii + 1, keyname, &tstatus);
       ffpky(histptr, TDOUBLE, keyname, &dvalue, "Pixel size", &tstatus);

    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_rebin_wcs(
      fitsfile *fptr,   /* I - pointer to table to be binned           */
      int naxis,        /* I - number of axes in the histogram image   */
      float *amin,     /* I - first pixel include in each axis        */
      float *binsize,  /* I - binning factor for each axis            */
      int *status)      
{
  double amind[4], binsized[4];

  /* Copy single precision values into double precision */
  if (*status == 0) {
    int i, naxis1 = 4;
    if (naxis < naxis1) naxis1 = naxis;
    for (i=0; i 0)
        return(*status);
  
    for (ii = 0; ii < naxis; ii++)
    {
       reset = 0;  /* flag to reset the reference pixel */
       tstatus = 0;
       ffkeyn("CRVAL", ii + 1, keyname, &tstatus);
       /* get previous (pre-binning) value */
       ffgky(fptr, TDOUBLE, keyname, &dvalue, NULL, &tstatus); 
       if (!tstatus && dvalue == 1.0)
           reset = 1;

       tstatus = 0;
       /*  CRPIXn - update location of the ref. pix. in the binned image */
       ffkeyn("CRPIX", ii + 1, keyname, &tstatus);

       /* get previous (pre-binning) value */
       ffgky(fptr, TDOUBLE, keyname, &dvalue, NULL, &tstatus); 

       if (!tstatus)
       {
           if (dvalue != 1.0)
	      reset = 0;

           /* updated value to give pixel location after binning */
           dvalue = (dvalue - amin[ii]) / ((double) binsize[ii]) + .5;  

           fits_modify_key_dbl(fptr, keyname, dvalue, -14, NULL, &tstatus);
       } else {
          reset = 0;
       }

       /*  CDELTn - update unit size of pixels  */
       tstatus = 0;
       ffkeyn("CDELT", ii + 1, keyname, &tstatus);

       /* get previous (pre-binning) value */
       ffgky(fptr, TDOUBLE, keyname, &dvalue, NULL, &tstatus); 

       if (!tstatus)
       {
           if (dvalue != 1.0)
	      reset = 0;

           /* updated to give post-binning value */
           dvalue = dvalue * binsize[ii];  

           fits_modify_key_dbl(fptr, keyname, dvalue, -14, NULL, &tstatus);
       }
       else
       {   /* no CDELTn keyword, so look for a CDij keywords */
          reset = 0;

          for (jj = 0; jj < naxis; jj++)
	  {
             tstatus = 0;
             ffkeyn("CD", jj + 1, svalue, &tstatus);
	     strcat(svalue,"_");
	     ffkeyn(svalue, ii + 1, keyname, &tstatus);

             /* get previous (pre-binning) value */
             ffgky(fptr, TDOUBLE, keyname, &dvalue, NULL, &tstatus); 

             if (!tstatus)
             {
                /* updated to give post-binning value */
               dvalue = dvalue * binsize[ii];  

               fits_modify_key_dbl(fptr, keyname, dvalue, -14, NULL, &tstatus);
             }
	  }
       }

       if (reset) {
          /* the original CRPIX, CRVAL, and CDELT keywords were all = 1.0 */
	  /* In this special case, reset the reference pixel to be the */
	  /* first pixel in the array (instead of possibly far off the array) */
 
           dvalue = 1.0;
           ffkeyn("CRPIX", ii + 1, keyname, &tstatus);
           fits_modify_key_dbl(fptr, keyname, dvalue, -14, NULL, &tstatus);

           ffkeyn("CRVAL", ii + 1, keyname, &tstatus);
	   dvalue = amin[ii] + (binsize[ii] / 2.0);	  
           fits_modify_key_dbl(fptr, keyname, dvalue, -14, NULL, &tstatus);
	}

    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
/* Single-precision version */
int fits_make_hist(fitsfile *fptr, /* IO - pointer to table with X and Y cols; */
    fitsfile *histptr, /* I - pointer to output FITS image      */
    int bitpix,       /* I - datatype for image: 16, 32, -32, etc    */
    int naxis,        /* I - number of axes in the histogram image   */
    long *naxes,      /* I - size of axes in the histogram image   */
    int *colnum,    /* I - column numbers (array length = naxis)   */
    float *amin,     /* I - minimum histogram value, for each axis */
    float *amax,     /* I - maximum histogram value, for each axis */
    float *binsize, /* I - bin size along each axis               */
    float weight,        /* I - binning weighting factor          */
    int wtcolnum, /* I - optional keyword or col for weight*/
    int recip,              /* I - use reciprocal of the weight?     */
    char *selectrow,        /* I - optional array (length = no. of   */
                             /* rows in the table).  If the element is true */
                             /* then the corresponding row of the table will*/
                             /* be included in the histogram, otherwise the */
                             /* row will be skipped.  Ingnored if *selectrow*/
                             /* is equal to NULL.                           */
    int *status)
{		  
  double amind[4], amaxd[4], binsized[4], weightd;

  /* Copy single precision values into double precision */
  if (*status == 0) {
    int i, naxis1 = 4;
    if (naxis < naxis1) naxis1 = naxis;
    for (i=0; i 0)
        return(*status);

    if (naxis > 4)
    {
        ffpmsg("histogram has more than 4 dimensions");
        return(*status = BAD_DIMEN);
    }

    if   (bitpix == BYTE_IMG)
         imagetype = TBYTE;
    else if (bitpix == SHORT_IMG)
         imagetype = TSHORT;
    else if (bitpix == LONG_IMG)
         imagetype = TINT;    
    else if (bitpix == FLOAT_IMG)
         imagetype = TFLOAT;    
    else if (bitpix == DOUBLE_IMG)
         imagetype = TDOUBLE;    
    else
        return(*status = BAD_DATATYPE);

    /* reset position to the correct HDU if necessary */
    if ((fptr)->HDUposition != ((fptr)->Fptr)->curhdu)
        ffmahd(fptr, ((fptr)->HDUposition) + 1, NULL, status);

    histData.weight     = weight;
    histData.wtcolnum   = wtcolnum;
    histData.wtrecip    = recip;
    histData.tblptr     = fptr;
    histData.himagetype = imagetype;
    histData.haxis      = naxis;
    histData.rowselector = selectrow;

    for (ii = 0; ii < naxis; ii++)
    {
      taxes[ii] = (double) naxes[ii];
      tmin[ii] = amin[ii];
      tmax[ii] = amax[ii];
      if ( (amin[ii] > amax[ii] && binsize[ii] > 0. ) ||
           (amin[ii] < amax[ii] && binsize[ii] < 0. ) )
          tbin[ii] =  -binsize[ii];  /* reverse the sign of binsize */
      else
          tbin[ii] =   binsize[ii];  /* binsize has the correct sign */
          
      imin = (long) tmin[ii];
      imax = (long) tmax[ii];
      ibin = (long) tbin[ii];
    
      /* get the datatype of the column */
      fits_get_coltype(fptr, colnum[ii], &datatype, NULL, NULL, status);

      if (datatype <= TLONG && (double) imin == tmin[ii] &&
                               (double) imax == tmax[ii] &&
                               (double) ibin == tbin[ii] )
      {
        /* This is an integer column and integer limits were entered. */
        /* Shift the lower and upper histogramming limits by 0.5, so that */
        /* the values fall in the center of the bin, not on the edge. */

        maxbin[ii] = (taxes[ii] + 1.F);  /* add 1. instead of .5 to avoid roundoff */

        if (tmin[ii] < tmax[ii])
        {
          tmin[ii] = tmin[ii] - 0.5F;
          tmax[ii] = tmax[ii] + 0.5F;
        }
        else
        {
          tmin[ii] = tmin[ii] + 0.5F;
          tmax[ii] = tmax[ii] - 0.5F;
        }
      } else {  /* not an integer column with integer limits */
          maxbin[ii] = (tmax[ii] - tmin[ii]) / tbin[ii]; 
      }
    }

    /* Set global variables with histogram parameter values.    */
    /* Use separate scalar variables rather than arrays because */
    /* it is more efficient when computing the histogram.       */

    histData.hcolnum[0]  = colnum[0];
    histData.amin1 = tmin[0];
    histData.maxbin1 = maxbin[0];
    histData.binsize1 = tbin[0];
    histData.haxis1 = (long) taxes[0];

    if (histData.haxis > 1)
    {
      histData.hcolnum[1]  = colnum[1];
      histData.amin2 = tmin[1];
      histData.maxbin2 = maxbin[1];
      histData.binsize2 = tbin[1];
      histData.haxis2 = (long) taxes[1];

      if (histData.haxis > 2)
      {
        histData.hcolnum[2]  = colnum[2];
        histData.amin3 = tmin[2];
        histData.maxbin3 = maxbin[2];
        histData.binsize3 = tbin[2];
        histData.haxis3 = (long) taxes[2];

        if (histData.haxis > 3)
        {
          histData.hcolnum[3]  = colnum[3];
          histData.amin4 = tmin[3];
          histData.maxbin4 = maxbin[3];
          histData.binsize4 = tbin[3];
          histData.haxis4 = (long) taxes[3];
        }
      }
    }

    /* define parameters of image for the iterator function */
    fits_iter_set_file(imagepars, histptr);        /* pointer to image */
    fits_iter_set_datatype(imagepars, imagetype);  /* image datatype   */
    fits_iter_set_iotype(imagepars, OutputCol);    /* image is output  */

    /* call the iterator function to write out the histogram image */
    fits_iterate_data(n_cols, imagepars, offset, n_per_loop,
                          ffwritehisto, (void*)&histData, status);
       
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_get_col_minmax(fitsfile *fptr, int colnum, double *datamin, 
			double *datamax, int *status)
/* 
   Simple utility routine to compute the min and max value in a column
*/
{
    int anynul;
    long nrows, ntodo, firstrow, ii;
    double array[1000], nulval;

    ffgky(fptr, TLONG, "NAXIS2", &nrows, NULL, status); /* no. of rows */

    firstrow = 1;
    nulval = DOUBLENULLVALUE;
    *datamin =  9.0E36;
    *datamax = -9.0E36;

    while(nrows)
    {
        ntodo = minvalue(nrows, 100);
        ffgcv(fptr, TDOUBLE, colnum, firstrow, 1, ntodo, &nulval, array,
              &anynul, status);

        for (ii = 0; ii < ntodo; ii++)
        {
            if (array[ii] != nulval)
            {
                *datamin = minvalue(*datamin, array[ii]);
                *datamax = maxvalue(*datamax, array[ii]);
            }
        }

        nrows -= ntodo;
        firstrow += ntodo;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffwritehisto(long totaln, long pixoffset, long firstn, long nvalues,
             int narrays, iteratorCol *imagepars, void *userPointer)
/*
   Interator work function that writes out the histogram.
   The histogram values are calculated by another work function, ffcalchisto.
   This work function only gets called once, and totaln = nvalues.
*/
{
    iteratorCol colpars[5];
    int ii, status = 0, ncols;
    long rows_per_loop = 0, offset = 0;
    histType *histData;

    histData = (histType *)userPointer;

    /* store pointer to the histogram array, and initialize to zero */

    switch( histData->himagetype ) {
    case TBYTE:
       histData->hist.b = (char *  ) fits_iter_get_array(imagepars);
       break;
    case TSHORT:
       histData->hist.i = (short * ) fits_iter_get_array(imagepars);
       break;
    case TINT:
       histData->hist.j = (int *   ) fits_iter_get_array(imagepars);
       break;
    case TFLOAT:
       histData->hist.r = (float * ) fits_iter_get_array(imagepars);
       break;
    case TDOUBLE:
       histData->hist.d = (double *) fits_iter_get_array(imagepars);
       break;
    }

    /* set the column parameters for the iterator function */
    for (ii = 0; ii < histData->haxis; ii++)
    {
      fits_iter_set_by_num(&colpars[ii], histData->tblptr,
			   histData->hcolnum[ii], TDOUBLE, InputCol);
    }
    ncols = histData->haxis;

    if (histData->weight == DOUBLENULLVALUE)
    {
      fits_iter_set_by_num(&colpars[histData->haxis], histData->tblptr,
			   histData->wtcolnum, TDOUBLE, InputCol);
      ncols = histData->haxis + 1;
    }

    /* call iterator function to calc the histogram pixel values */

    /* must lock this call in multithreaded environoments because */
    /* the ffcalchist work routine uses static vaiables that would */
    /* get clobbered if multiple threads were running at the same time */
    FFLOCK;
    fits_iterate_data(ncols, colpars, offset, rows_per_loop,
                          ffcalchist, (void*)histData, &status);
    FFUNLOCK;

    return(status);
}
/*--------------------------------------------------------------------------*/
int ffcalchist(long totalrows, long offset, long firstrow, long nrows,
             int ncols, iteratorCol *colpars, void *userPointer)
/*
   Interator work function that calculates values for the 2D histogram.
*/
{
    long ii, ipix, iaxisbin;
    double pix, axisbin;
    static double *col1, *col2, *col3, *col4; /* static to preserve values */
    static double *wtcol;
    static long incr2, incr3, incr4;
    static histType histData;
    static char *rowselect;

    /*  Initialization procedures: execute on the first call  */
    if (firstrow == 1)
    {

      /*  Copy input histogram data to static local variable so we */
      /*  don't have to constantly dereference it.                 */

      histData = *(histType*)userPointer;
      rowselect = histData.rowselector;

      /* assign the input array pointers to local pointers */
      col1 = (double *) fits_iter_get_array(&colpars[0]);
      if (histData.haxis > 1)
      {
        col2 = (double *) fits_iter_get_array(&colpars[1]);
        incr2 = histData.haxis1;

        if (histData.haxis > 2)
        {
          col3 = (double *) fits_iter_get_array(&colpars[2]);
          incr3 = incr2 * histData.haxis2;

          if (histData.haxis > 3)
          {
            col4 = (double *) fits_iter_get_array(&colpars[3]);
            incr4 = incr3 * histData.haxis3;
          }
        }
      }

      if (ncols > histData.haxis)  /* then weights are give in a column */
      {
        wtcol = (double *) fits_iter_get_array(&colpars[histData.haxis]);
      }
    }   /* end of Initialization procedures */

    /*  Main loop: increment the histogram at position of each event */
    for (ii = 1; ii <= nrows; ii++) 
    {
        if (rowselect)     /* if a row selector array is supplied... */
        {
           if (*rowselect)
           {
               rowselect++;   /* this row is included in the histogram */
           }
           else
           {
               rowselect++;   /* this row is excluded from the histogram */
               continue;
           }
        }

        if (col1[ii] == DOUBLENULLVALUE)  /* test for null value */
            continue;

        pix = (col1[ii] - histData.amin1) / histData.binsize1;
        ipix = (long) (pix + 1.); /* add 1 because the 1st pixel is the null value */

	/* test if bin is within range */
        if (ipix < 1 || ipix > histData.haxis1 || pix > histData.maxbin1)
            continue;

        if (histData.haxis > 1)
        {
          if (col2[ii] == DOUBLENULLVALUE)
              continue;

          axisbin = (col2[ii] - histData.amin2) / histData.binsize2;
          iaxisbin = (long) axisbin;

          if (axisbin < 0. || iaxisbin >= histData.haxis2 || axisbin > histData.maxbin2)
              continue;

          ipix += (iaxisbin * incr2);

          if (histData.haxis > 2)
          {
            if (col3[ii] == DOUBLENULLVALUE)
                continue;

            axisbin = (col3[ii] - histData.amin3) / histData.binsize3;
            iaxisbin = (long) axisbin;
            if (axisbin < 0. || iaxisbin >= histData.haxis3 || axisbin > histData.maxbin3)
                continue;

            ipix += (iaxisbin * incr3);
 
            if (histData.haxis > 3)
            {
              if (col4[ii] == DOUBLENULLVALUE)
                  continue;

              axisbin = (col4[ii] - histData.amin4) / histData.binsize4;
              iaxisbin = (long) axisbin;
              if (axisbin < 0. || iaxisbin >= histData.haxis4 || axisbin > histData.maxbin4)
                  continue;

              ipix += (iaxisbin * incr4);

            }  /* end of haxis > 3 case */
          }    /* end of haxis > 2 case */
        }      /* end of haxis > 1 case */

        /* increment the histogram pixel */
        if (histData.weight != DOUBLENULLVALUE) /* constant weight factor */
        {
            if (histData.himagetype == TINT)
              histData.hist.j[ipix] += (int) histData.weight;
            else if (histData.himagetype == TSHORT)
              histData.hist.i[ipix] += (short) histData.weight;
            else if (histData.himagetype == TFLOAT)
              histData.hist.r[ipix] += histData.weight;
            else if (histData.himagetype == TDOUBLE)
              histData.hist.d[ipix] += histData.weight;
            else if (histData.himagetype == TBYTE)
              histData.hist.b[ipix] += (char) histData.weight;
        }
        else if (histData.wtrecip) /* use reciprocal of the weight */
        {
            if (histData.himagetype == TINT)
              histData.hist.j[ipix] += (int) (1./wtcol[ii]);
            else if (histData.himagetype == TSHORT)
              histData.hist.i[ipix] += (short) (1./wtcol[ii]);
            else if (histData.himagetype == TFLOAT)
              histData.hist.r[ipix] += (float) (1./wtcol[ii]);
            else if (histData.himagetype == TDOUBLE)
              histData.hist.d[ipix] += 1./wtcol[ii];
            else if (histData.himagetype == TBYTE)
              histData.hist.b[ipix] += (char) (1./wtcol[ii]);
        }
        else   /* no weights */
        {
            if (histData.himagetype == TINT)
              histData.hist.j[ipix] += (int) wtcol[ii];
            else if (histData.himagetype == TSHORT)
              histData.hist.i[ipix] += (short) wtcol[ii];
            else if (histData.himagetype == TFLOAT)
              histData.hist.r[ipix] += wtcol[ii];
            else if (histData.himagetype == TDOUBLE)
              histData.hist.d[ipix] += wtcol[ii];
            else if (histData.himagetype == TBYTE)
              histData.hist.b[ipix] += (char) wtcol[ii];
        }

    }  /* end of main loop over all rows */

    return(0);
}

cfitsio-3.47/imcompress.c0000644000225700000360000134315313464573432014747 0ustar  cagordonlhea# include 
# include 
# include 
# include 
# include 
# include 
# include "fitsio2.h"

#define NULL_VALUE -2147483647 /* value used to represent undefined pixels */
#define ZERO_VALUE -2147483646 /* value used to represent zero-valued pixels */

/* nearest integer function */
# define NINT(x)  ((x >= 0.) ? (int) (x + 0.5) : (int) (x - 0.5))

/* special quantize level value indicates that floating point image pixels */
/* should not be quantized and instead losslessly compressed (with GZIP) */
#define NO_QUANTIZE 9999

/* string array for storing the individual column compression stats */
char results[999][30];

float *fits_rand_value = 0;

int imcomp_write_nocompress_tile(fitsfile *outfptr, long row, int datatype, 
    void *tiledata, long tilelen, int nullcheck, void *nullflagval, int *status);
int imcomp_convert_tile_tshort(fitsfile *outfptr, void *tiledata, long tilelen,
    int nullcheck, void *nullflagval, int nullval, int zbitpix, double scale,
    double zero, double actual_bzero, int *intlength, int *status);
int imcomp_convert_tile_tushort(fitsfile *outfptr, void *tiledata, long tilelen,
    int nullcheck, void *nullflagval, int nullval, int zbitpix, double scale,
    double zero, int *intlength, int *status);
int imcomp_convert_tile_tint(fitsfile *outfptr, void *tiledata, long tilelen,
    int nullcheck, void *nullflagval, int nullval, int zbitpix, double scale,
    double zero, int *intlength, int *status);
int imcomp_convert_tile_tuint(fitsfile *outfptr, void *tiledata, long tilelen,
    int nullcheck, void *nullflagval, int nullval, int zbitpix, double scale,
    double zero, int *intlength, int *status);
int imcomp_convert_tile_tbyte(fitsfile *outfptr, void *tiledata, long tilelen,
    int nullcheck, void *nullflagval, int nullval, int zbitpix, double scale,
    double zero, int *intlength, int *status);
int imcomp_convert_tile_tsbyte(fitsfile *outfptr, void *tiledata, long tilelen,
    int nullcheck, void *nullflagval, int nullval, int zbitpix, double scale,
    double zero, int *intlength, int *status);
int imcomp_convert_tile_tfloat(fitsfile *outfptr, long row, void *tiledata, long tilelen,
    long tilenx, long tileny, int nullcheck, void *nullflagval, int nullval, int zbitpix,
    double scale, double zero, int *intlength, int *flag, double *bscale, double *bzero,int *status);
int imcomp_convert_tile_tdouble(fitsfile *outfptr, long row, void *tiledata, long tilelen,
    long tilenx, long tileny, int nullcheck, void *nullflagval, int nullval, int zbitpix, 
    double scale, double zero, int *intlength, int *flag, double *bscale, double *bzero, int *status);

static int unquantize_i1r4(long row,
            unsigned char *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int dither_method,    /* I - which subtractive dither method to use */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,          /* I - value of FITS TNULLn keyword if any */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status);          /* IO - error status                       */
static int unquantize_i2r4(long row,
            short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int dither_method,    /* I - which subtractive dither method to use */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status);          /* IO - error status                       */
static int unquantize_i4r4(long row,
            INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int dither_method,    /* I - which subtractive dither method to use */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status);          /* IO - error status                       */
static int unquantize_i1r8(long row,
            unsigned char *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int dither_method,    /* I - which subtractive dither method to use */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,          /* I - value of FITS TNULLn keyword if any */
            double nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,        /* O - array of converted pixels           */
            int *status);          /* IO - error status                       */
static int unquantize_i2r8(long row,
            short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int dither_method,    /* I - which subtractive dither method to use */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            double nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,        /* O - array of converted pixels           */
            int *status);          /* IO - error status                       */
static int unquantize_i4r8(long row,
            INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int dither_method,    /* I - which subtractive dither method to use */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            double nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,        /* O - array of converted pixels           */
            int *status);          /* IO - error status                       */
static int imcomp_float2nan(float *indata, long tilelen, int *outdata,
    float nullflagval,  int *status);
static int imcomp_double2nan(double *indata, long tilelen, LONGLONG *outdata,
    double nullflagval,  int *status);    
static int fits_read_write_compressed_img(fitsfile *fptr,   /* I - FITS file pointer */
            int  datatype,  /* I - datatype of the array to be returned      */
            LONGLONG  *infpixel, /* I - 'bottom left corner' of the subsection    */
            LONGLONG  *inlpixel, /* I - 'top right corner' of the subsection      */
            long  *ininc,    /* I - increment to be applied in each dimension */
            int  nullcheck,  /* I - 0 for no null checking                   */
                              /*     1: set undefined pixels = nullval       */
            void *nullval,    /* I - value for undefined pixels              */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            fitsfile *outfptr,   /* I - FITS file pointer                    */
            int  *status);

static int fits_shuffle_8bytes(char *heap, LONGLONG length, int *status);
static int fits_shuffle_4bytes(char *heap, LONGLONG length, int *status);
static int fits_shuffle_2bytes(char *heap, LONGLONG length, int *status);
static int fits_unshuffle_8bytes(char *heap, LONGLONG length, int *status);
static int fits_unshuffle_4bytes(char *heap, LONGLONG length, int *status);
static int fits_unshuffle_2bytes(char *heap, LONGLONG length, int *status);

static int fits_int_to_longlong_inplace(int *intarray, long length, int *status);
static int fits_short_to_int_inplace(short *intarray, long length, int shift, int *status);
static int fits_ushort_to_int_inplace(unsigned short *intarray, long length, int shift, int *status);
static int fits_sbyte_to_int_inplace(signed char *intarray, long length, int *status);
static int fits_ubyte_to_int_inplace(unsigned char *intarray, long length, int *status);

static int fits_calc_tile_rows(long *tlpixel, long *tfpixel, int ndim, long *trowsize, long *ntrows, int *status); 

/* only used for diagnoitic purposes */
/* int fits_get_case(int *c1, int*c2, int*c3); */ 
/*---------------------------------------------------------------------------*/
int fits_init_randoms(void) {

/* initialize an array of random numbers */

    int ii;
    double a = 16807.0;
    double m = 2147483647.0;
    double temp, seed;

    FFLOCK;
 
    if (fits_rand_value) {
       FFUNLOCK;
       return(0);  /* array is already initialized */
    }

    /* allocate array for the random number sequence */
    /* THIS MEMORY IS NEVER FREED */
    fits_rand_value = calloc(N_RANDOM, sizeof(float));

    if (!fits_rand_value) {
        FFUNLOCK;
	return(MEMORY_ALLOCATION);
    }
		       
    /*  We need a portable algorithm that anyone can use to generate this
        exact same sequence of random number.  The C 'rand' function is not
	suitable because it is not available to Fortran or Java programmers.
	Instead, use a well known simple algorithm published here: 
	"Random number generators: good ones are hard to find", Communications of the ACM,
        Volume 31 ,  Issue 10  (October 1988) Pages: 1192 - 1201 
    */  

    /* initialize the random numbers */
    seed = 1;
    for (ii = 0; ii < N_RANDOM; ii++) {
        temp = a * seed;
	seed = temp -m * ((int) (temp / m) );
	fits_rand_value[ii] = (float) (seed / m);
    }

    FFUNLOCK;

    /* 
    IMPORTANT NOTE: the 10000th seed value must have the value 1043618065 if the 
       algorithm has been implemented correctly */
    
    if ( (int) seed != 1043618065) {
        ffpmsg("fits_init_randoms generated incorrect random number sequence");
	return(1);
    } else {
        return(0);
    }
}
/*--------------------------------------------------------------------------*/
void bz_internal_error(int errcode)
{
    /* external function declared by the bzip2 code in bzlib_private.h */
    ffpmsg("bzip2 returned an internal error");
    ffpmsg("This should never happen");
    return;
}
/*--------------------------------------------------------------------------*/
int fits_set_compression_type(fitsfile *fptr,  /* I - FITS file pointer     */
       int ctype,    /* image compression type code;                        */
                     /* allowed values: RICE_1, GZIP_1, GZIP_2, PLIO_1,     */
                     /*  HCOMPRESS_1, BZIP2_1, and NOCOMPRESS               */
       int *status)  /* IO - error status                                   */
{
/*
   This routine specifies the image compression algorithm that should be
   used when writing a FITS image.  The image is divided into tiles, and
   each tile is compressed and stored in a row of at variable length binary
   table column.
*/

    if (ctype != RICE_1 && 
        ctype != GZIP_1 && 
        ctype != GZIP_2 && 
        ctype != PLIO_1 && 
        ctype != HCOMPRESS_1 && 
        ctype != BZIP2_1 && 
        ctype != NOCOMPRESS &&
	ctype != 0)
    {
	ffpmsg("unknown compression algorithm (fits_set_compression_type)");
	*status = DATA_COMPRESSION_ERR; 
    } else {
        (fptr->Fptr)->request_compress_type = ctype;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_set_tile_dim(fitsfile *fptr,  /* I - FITS file pointer             */
           int ndim,   /* number of dimensions in the compressed image      */
           long *dims, /* size of image compression tile in each dimension  */
                      /* default tile size = (NAXIS1, 1, 1, ...)            */
           int *status)         /* IO - error status                        */
{
/*
   This routine specifies the size (dimension) of the image
   compression  tiles that should be used when writing a FITS
   image.  The image is divided into tiles, and each tile is compressed
   and stored in a row of at variable length binary table column.
*/
    int ii;

    if (ndim < 0 || ndim > MAX_COMPRESS_DIM)
    {
        *status = BAD_DIMEN;
	ffpmsg("illegal number of tile dimensions (fits_set_tile_dim)");
        return(*status);
    }

    for (ii = 0; ii < ndim; ii++)
    {
        (fptr->Fptr)->request_tilesize[ii] = dims[ii];
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_set_quantize_level(fitsfile *fptr,  /* I - FITS file pointer   */
           float qlevel,        /* floating point quantization level      */
           int *status)         /* IO - error status                */
{
/*
   This routine specifies the value of the quantization level, q,  that
   should be used when compressing floating point images.  The image is
   divided into tiles, and each tile is compressed and stored in a row
   of at variable length binary table column.
*/
    if (qlevel == 0.)
    {
        /* this means don't quantize the floating point values. Instead, */
	/* the floating point values will be losslessly compressed */
       (fptr->Fptr)->request_quantize_level = NO_QUANTIZE;
    } else {

        (fptr->Fptr)->request_quantize_level = qlevel;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_set_quantize_method(fitsfile *fptr,  /* I - FITS file pointer   */
           int method,          /* quantization method       */
           int *status)         /* IO - error status                */
{
/*
   This routine specifies what type of dithering (randomization) should
   be performed when quantizing floating point images to integer prior to
   compression.   A value of -1 means do no dithering.  A value of 0 means
   use the default SUBTRACTIVE_DITHER_1 (which is equivalent to dither = 1).
   A value of 2 means use SUBTRACTIVE_DITHER_2.
*/

    if (method < -1 || method > 2)
    {
	ffpmsg("illegal dithering value (fits_set_quantize_method)");
	*status = DATA_COMPRESSION_ERR; 
    } else {
       
        if (method == 0) method = 1;
        (fptr->Fptr)->request_quantize_method = method;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_set_quantize_dither(fitsfile *fptr,  /* I - FITS file pointer   */
           int dither,        /* dither type      */
           int *status)         /* IO - error status                */
{
/*
   the name of this routine has changed.  This is kept here only for backwards
   compatibility for any software that may be calling the old routine.
*/

    fits_set_quantize_method(fptr, dither, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_set_dither_seed(fitsfile *fptr,  /* I - FITS file pointer   */
           int seed,        /* random dithering seed value (1 to 10000) */
           int *status)         /* IO - error status                */
{
/*
   This routine specifies the value of the offset that should be applied when
   calculating the random dithering when quantizing floating point iamges.
   A random offset should be applied to each image to avoid quantization 
   effects when taking the difference of 2 images, or co-adding a set of
   images.  Without this random offset, the corresponding pixel in every image
   will have exactly the same dithering.
   
   offset = 0 means use the default random dithering based on system time
   offset = negative means randomly chose dithering based on 1st tile checksum
   offset = [1 - 10000] means use that particular dithering pattern

*/
    /* if positive, ensure that the value is in the range 1 to 10000 */
    if (seed > 10000) {
	ffpmsg("illegal dithering seed value (fits_set_dither_seed)");
	*status = DATA_COMPRESSION_ERR;
    } else {
       (fptr->Fptr)->request_dither_seed = seed; 
    }
    
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_set_dither_offset(fitsfile *fptr,  /* I - FITS file pointer   */
           int offset,        /* random dithering offset value (1 to 10000) */
           int *status)         /* IO - error status                */
{
/*
    The name of this routine has changed.  This is kept just for
    backwards compatibility with any software that calls the old name
*/

    fits_set_dither_seed(fptr, offset, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_set_noise_bits(fitsfile *fptr,  /* I - FITS file pointer   */
           int noisebits,       /* noise_bits parameter value       */
                                /* (default = 4)                    */
           int *status)         /* IO - error status                */
{
/*
   ********************************************************************
   ********************************************************************
   THIS ROUTINE IS PROVIDED ONLY FOR BACKWARDS COMPATIBILITY;
   ALL NEW SOFTWARE SHOULD CALL fits_set_quantize_level INSTEAD
   ********************************************************************
   ********************************************************************

   This routine specifies the value of the noice_bits parameter that
   should be used when compressing floating point images.  The image is
   divided into tiles, and each tile is compressed and stored in a row
   of at variable length binary table column.

   Feb 2008:  the "noisebits" parameter has been replaced with the more
   general "quantize level" parameter.
*/
    float qlevel;

    if (noisebits < 1 || noisebits > 16)
    {
        *status = DATA_COMPRESSION_ERR;
	ffpmsg("illegal number of noise bits (fits_set_noise_bits)");
        return(*status);
    }

    qlevel = (float) pow (2., (double)noisebits);
    fits_set_quantize_level(fptr, qlevel, status);
    
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_set_hcomp_scale(fitsfile *fptr,  /* I - FITS file pointer   */
           float scale,       /* hcompress scale parameter value       */
                                /* (default = 0.)                    */
           int *status)         /* IO - error status                */
{
/*
   This routine specifies the value of the hcompress scale parameter.
*/
    (fptr->Fptr)->request_hcomp_scale = scale;
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_set_hcomp_smooth(fitsfile *fptr,  /* I - FITS file pointer   */
           int smooth,       /* hcompress smooth parameter value       */
                                /* if scale > 1 and smooth != 0, then */
				/*  the image will be smoothed when it is */
				/* decompressed to remove some of the */
				/* 'blockiness' in the image produced */
				/* by the lossy compression    */
           int *status)         /* IO - error status                */
{
/*
   This routine specifies the value of the hcompress scale parameter.
*/

    (fptr->Fptr)->request_hcomp_smooth = smooth;
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_set_lossy_int(fitsfile *fptr,  /* I - FITS file pointer   */
           int lossy_int,       /* I - True (!= 0) or False (0) */
           int *status)         /* IO - error status                */
{
/*
   This routine specifies whether images with integer pixel values should
   quantized and compressed the same way float images are compressed.
   The default is to not do this, and instead apply a lossless compression
   algorithm to integer images.
*/

    (fptr->Fptr)->request_lossy_int_compress = lossy_int;
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_set_huge_hdu(fitsfile *fptr,  /* I - FITS file pointer   */
           int huge,       /* I - True (!= 0) or False (0) */
           int *status)         /* IO - error status                */
{
/*
   This routine specifies whether the HDU that is being compressed is so large
   (i.e., > 4 GB) that the 'Q' type variable length array columns should be used
   rather than the normal 'P' type.  The allows the heap pointers to be stored
   as 64-bit quantities, rather than just 32-bits.
*/

    (fptr->Fptr)->request_huge_hdu = huge;
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_get_compression_type(fitsfile *fptr,  /* I - FITS file pointer     */
       int *ctype,   /* image compression type code;                        */
                     /* allowed values:                                     */
		     /* RICE_1, GZIP_1, GZIP_2, PLIO_1, HCOMPRESS_1, BZIP2_1 */
       int *status)  /* IO - error status                                   */
{
/*
   This routine returns the image compression algorithm that should be
   used when writing a FITS image.  The image is divided into tiles, and
   each tile is compressed and stored in a row of at variable length binary
   table column.
*/
    *ctype = (fptr->Fptr)->request_compress_type;

    if (*ctype != RICE_1 && 
        *ctype != GZIP_1 && 
        *ctype != GZIP_2 && 
        *ctype != PLIO_1 && 
        *ctype != HCOMPRESS_1 && 
        *ctype != BZIP2_1 && 
        *ctype != NOCOMPRESS &&
	*ctype != 0   ) 

    {
	ffpmsg("unknown compression algorithm (fits_get_compression_type)");
	*status = DATA_COMPRESSION_ERR; 
    }
 
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_get_tile_dim(fitsfile *fptr,  /* I - FITS file pointer             */
           int ndim,   /* number of dimensions in the compressed image      */
           long *dims, /* size of image compression tile in each dimension  */
                       /* default tile size = (NAXIS1, 1, 1, ...)           */
           int *status)         /* IO - error status                        */
{
/*
   This routine returns the size (dimension) of the image
   compression  tiles that should be used when writing a FITS
   image.  The image is divided into tiles, and each tile is compressed
   and stored in a row of at variable length binary table column.
*/
    int ii;

    if (ndim < 0 || ndim > MAX_COMPRESS_DIM)
    {
        *status = BAD_DIMEN;
	ffpmsg("illegal number of tile dimensions (fits_get_tile_dim)");
        return(*status);
    }

    for (ii = 0; ii < ndim; ii++)
    {
        dims[ii] = (fptr->Fptr)->request_tilesize[ii];
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_unset_compression_param(
      fitsfile *fptr,
      int *status) 
{
    int ii;

    (fptr->Fptr)->compress_type = 0;
    (fptr->Fptr)->quantize_level = 0;
    (fptr->Fptr)->quantize_method = 0;
    (fptr->Fptr)->dither_seed = 0; 
    (fptr->Fptr)->hcomp_scale = 0;

    for (ii = 0; ii < MAX_COMPRESS_DIM; ii++)
    {
        (fptr->Fptr)->tilesize[ii] = 0;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_unset_compression_request(
      fitsfile *fptr,
      int *status) 
{
    int ii;

    (fptr->Fptr)->request_compress_type = 0;
    (fptr->Fptr)->request_quantize_level = 0;
    (fptr->Fptr)->request_quantize_method = 0;
    (fptr->Fptr)->request_dither_seed = 0; 
    (fptr->Fptr)->request_hcomp_scale = 0;
    (fptr->Fptr)->request_lossy_int_compress = 0;
    (fptr->Fptr)->request_huge_hdu = 0;

    for (ii = 0; ii < MAX_COMPRESS_DIM; ii++)
    {
        (fptr->Fptr)->request_tilesize[ii] = 0;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_set_compression_pref(
      fitsfile *infptr,
      fitsfile *outfptr,
      int *status) 
{
/*
   Set the preference for various compression options, based
   on keywords in the input file that
   provide guidance about how the HDU should be compressed when written
   to the output file.
*/

    int ii, naxis, nkeys, comptype;
    int  ivalue;
    long tiledim[6]= {1,1,1,1,1,1};
    char card[FLEN_CARD], value[FLEN_VALUE];
    double  qvalue;
    float hscale;
    LONGLONG datastart, dataend; 
    if (*status > 0)
        return(*status);

    /* check the size of the HDU that is to be compressed */
    fits_get_hduaddrll(infptr, NULL, &datastart, &dataend, status);
    if ( (LONGLONG)(dataend - datastart) > UINT32_MAX) {
       /* use 64-bit '1Q' variable length columns instead of '1P' columns */
       /* for large files, in case the heap size becomes larger than 2**32 bytes*/
       fits_set_huge_hdu(outfptr, 1, status);
    }

    fits_get_hdrspace(infptr, &nkeys, NULL, status);
 
   /* look for a image compression directive keywords (begin with 'FZ') */
    for (ii = 2; ii <= nkeys; ii++) {
        
	fits_read_record(infptr, ii, card, status);

	if (!strncmp(card, "FZ", 2) ){
	
            /* get the keyword value string */
            fits_parse_value(card, value, NULL, status);
	    
	    if      (!strncmp(card+2, "ALGOR", 5) ) {

	        /* set the desired compression algorithm */
                /* allowed values: RICE_1, GZIP_1, GZIP_2, PLIO_1,     */
                /*  HCOMPRESS_1, BZIP2_1, and NOCOMPRESS               */

                if        (!fits_strncasecmp(value, "'RICE_1", 7) ) {
		    comptype = RICE_1;
                } else if (!fits_strncasecmp(value, "'GZIP_1", 7) ) {
		    comptype = GZIP_1;
                } else if (!fits_strncasecmp(value, "'GZIP_2", 7) ) {
		    comptype = GZIP_2;
                } else if (!fits_strncasecmp(value, "'PLIO_1", 7) ) {
		    comptype = PLIO_1;
                } else if (!fits_strncasecmp(value, "'HCOMPRESS_1", 12) ) {
		    comptype = HCOMPRESS_1;
                } else if (!fits_strncasecmp(value, "'NONE", 5) ) {
		    comptype = NOCOMPRESS;
		} else {
			ffpmsg("Unknown FZALGOR keyword compression algorithm:");
			ffpmsg(value);
			return(*status = DATA_COMPRESSION_ERR);
		}  

	        fits_set_compression_type (outfptr, comptype, status);

	    } else if (!strncmp(card+2, "TILE  ", 6) ) {

                if (!fits_strncasecmp(value, "'row", 4) ) {
                   tiledim[0] = -1;
		} else if (!fits_strncasecmp(value, "'whole", 6) ) {
                   tiledim[0] = -1;
                   tiledim[1] = -1;
                   tiledim[2] = -1;
                } else {
		   ffdtdm(infptr, value, 0,6, &naxis, tiledim, status);
                }

	        /* set the desired tile size */
		fits_set_tile_dim (outfptr, 6, tiledim, status);

	    } else if (!strncmp(card+2, "QVALUE", 6) ) {

	        /* set the desired Q quantization value */
		qvalue = atof(value);
		fits_set_quantize_level (outfptr, (float) qvalue, status);

	    } else if (!strncmp(card+2, "QMETHD", 6) ) {

                    if (!fits_strncasecmp(value, "'no_dither", 10) ) {
                        ivalue = -1; /* just quantize, with no dithering */
		    } else if (!fits_strncasecmp(value, "'subtractive_dither_1", 21) ) {
                        ivalue = SUBTRACTIVE_DITHER_1; /* use subtractive dithering */
		    } else if (!fits_strncasecmp(value, "'subtractive_dither_2", 21) ) {
                        ivalue = SUBTRACTIVE_DITHER_2; /* dither, except preserve zero-valued pixels */
		    } else {
		        ffpmsg("Unknown value for FZQUANT keyword: (set_compression_pref)");
			ffpmsg(value);
                        return(*status = DATA_COMPRESSION_ERR);
		    }

		    fits_set_quantize_method(outfptr, ivalue, status);
		    
	    } else if (!strncmp(card+2, "DTHRSD", 6) ) {

                if (!fits_strncasecmp(value, "'checksum", 9) ) {
                    ivalue = -1; /* use checksum of first tile */
		} else if (!fits_strncasecmp(value, "'clock", 6) ) {
                    ivalue = 0; /* set dithering seed based on system clock */
		} else {  /* read integer value */
		    if (*value == '\'')
                        ivalue = (int) atol(value+1); /* allow for leading quote character */
                    else 
                        ivalue = (int) atol(value); 

                    if (ivalue < 1 || ivalue > 10000) {
		        ffpmsg("Invalid value for FZDTHRSD keyword: (set_compression_pref)");
			ffpmsg(value);
                        return(*status = DATA_COMPRESSION_ERR);
                    }
		}

	        /* set the desired dithering */
		fits_set_dither_seed(outfptr, ivalue, status);

	    } else if (!strncmp(card+2, "I2F", 3) ) {

	        /* set whether to convert integers to float then use lossy compression */
                if (!fits_strcasecmp(value, "t") ) {
		    fits_set_lossy_int (outfptr, 1, status);
		} else if (!fits_strcasecmp(value, "f") ) {
		    fits_set_lossy_int (outfptr, 0, status);
		} else {
		        ffpmsg("Unknown value for FZI2F keyword: (set_compression_pref)");
			ffpmsg(value);
                        return(*status = DATA_COMPRESSION_ERR);
                }

	    } else if (!strncmp(card+2, "HSCALE ", 6) ) {

	        /* set the desired Hcompress scale value */
		hscale = (float) atof(value);
		fits_set_hcomp_scale (outfptr, hscale, status);
            }
	}    
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_get_noise_bits(fitsfile *fptr,  /* I - FITS file pointer   */
           int *noisebits,       /* noise_bits parameter value       */
                                /* (default = 4)                    */
           int *status)         /* IO - error status                */
{
/*
   ********************************************************************
   ********************************************************************
   THIS ROUTINE IS PROVIDED ONLY FOR BACKWARDS COMPATIBILITY;
   ALL NEW SOFTWARE SHOULD CALL fits_set_quantize_level INSTEAD
   ********************************************************************
   ********************************************************************


   This routine returns the value of the noice_bits parameter that
   should be used when compressing floating point images.  The image is
   divided into tiles, and each tile is compressed and stored in a row
   of at variable length binary table column.

   Feb 2008: code changed to use the more general "quantize level" parameter
   rather than the "noise bits" parameter.  If quantize level is greater than
   zero, then the previous noisebits parameter is approximately given by
   
   noise bits = natural logarithm (quantize level) / natural log (2)
   
   This result is rounded to the nearest integer.
*/
    double qlevel;

    qlevel = (fptr->Fptr)->request_quantize_level;

    if (qlevel > 0. && qlevel < 65537. )
         *noisebits =  (int) ((log(qlevel) / log(2.0)) + 0.5);
    else 
        *noisebits = 0;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_get_quantize_level(fitsfile *fptr,  /* I - FITS file pointer   */
           float *qlevel,       /* quantize level parameter value       */
           int *status)         /* IO - error status                */
{
/*
   This routine returns the value of the noice_bits parameter that
   should be used when compressing floating point images.  The image is
   divided into tiles, and each tile is compressed and stored in a row
   of at variable length binary table column.
*/

    if ((fptr->Fptr)->request_quantize_level == NO_QUANTIZE) {
      *qlevel = 0;
    } else {
      *qlevel = (fptr->Fptr)->request_quantize_level;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_get_dither_seed(fitsfile *fptr,  /* I - FITS file pointer   */
           int *offset,       /* dithering offset parameter value       */
           int *status)         /* IO - error status                */
{
/*
   This routine returns the value of the dithering offset parameter that
   is used when compressing floating point images.  The image is
   divided into tiles, and each tile is compressed and stored in a row
   of at variable length binary table column.
*/

    *offset = (fptr->Fptr)->request_dither_seed;
    return(*status);
}/*--------------------------------------------------------------------------*/
int fits_get_hcomp_scale(fitsfile *fptr,  /* I - FITS file pointer   */
           float *scale,          /* Hcompress scale parameter value       */
           int *status)         /* IO - error status                */

{
/*
   This routine returns the value of the noice_bits parameter that
   should be used when compressing floating point images.  The image is
   divided into tiles, and each tile is compressed and stored in a row
   of at variable length binary table column.
*/

    *scale = (fptr->Fptr)->request_hcomp_scale;
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_get_hcomp_smooth(fitsfile *fptr,  /* I - FITS file pointer   */
           int *smooth,          /* Hcompress smooth parameter value       */
           int *status)         /* IO - error status                */

{
    *smooth = (fptr->Fptr)->request_hcomp_smooth;
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_img_compress(fitsfile *infptr, /* pointer to image to be compressed */
                 fitsfile *outfptr, /* empty HDU for output compressed image */
                 int *status)       /* IO - error status               */

/*
   This routine initializes the output table, copies all the keywords,
   and  loops through the input image, compressing the data and
   writing the compressed tiles to the output table.
   
   This is a high level routine that is called by the fpack and funpack
   FITS compression utilities.
*/
{
    int bitpix, naxis;
    long naxes[MAX_COMPRESS_DIM];
/*    int c1, c2, c3; */

    if (*status > 0)
        return(*status);


    /* get datatype and size of input image */
    if (fits_get_img_param(infptr, MAX_COMPRESS_DIM, &bitpix, 
                       &naxis, naxes, status) > 0)
        return(*status);

    if (naxis < 1 || naxis > MAX_COMPRESS_DIM)
    {
        ffpmsg("Image cannot be compressed: NAXIS out of range");
        return(*status = BAD_NAXIS);
    }

    /* create a new empty HDU in the output file now, before setting the */
    /* compression preferences.  This HDU will become a binary table that */
    /* contains the compressed image.  If necessary, create a dummy primary */
    /* array, which much precede the binary table extension. */
    
    ffcrhd(outfptr, status);  /* this does nothing if the output file is empty */

    if ((outfptr->Fptr)->curhdu == 0)  /* have to create dummy primary array */
    {
       ffcrim(outfptr, 16, 0, NULL, status);
       ffcrhd(outfptr, status);
    } else {
        /* unset any compress parameter preferences that may have been
           set when closing the previous HDU in the output file */
        fits_unset_compression_param(outfptr, status);
    }
    
    /* set any compress parameter preferences as given in the input file */
    fits_set_compression_pref(infptr, outfptr, status);

    /* special case: the quantization level is not given by a keyword in  */
    /* the HDU header, so we have to explicitly copy the requested value */
    /* to the actual value */
/* do this in imcomp_get_compressed_image_par, instead
    if ( (outfptr->Fptr)->request_quantize_level != 0.)
        (outfptr->Fptr)->quantize_level = (outfptr->Fptr)->request_quantize_level;
*/
    /* if requested, treat integer images same as a float image. */
    /* Then the pixels will be quantized (lossy algorithm) to achieve */
    /* higher amounts of compression than with lossless algorithms */

    if ( (outfptr->Fptr)->request_lossy_int_compress != 0  && bitpix > 0) 
	bitpix = FLOAT_IMG;  /* compress integer images as if float */

    /* initialize output table */
    if (imcomp_init_table(outfptr, bitpix, naxis, naxes, 0, status) > 0)
        return (*status);    

    /* Copy the image header keywords to the table header. */
    if (imcomp_copy_img2comp(infptr, outfptr, status) > 0)
	    return (*status);

    /* turn off any intensity scaling (defined by BSCALE and BZERO */
    /* keywords) so that unscaled values will be read by CFITSIO */
    /* (except if quantizing an int image, same as a float image) */
    if ( (outfptr->Fptr)->request_lossy_int_compress == 0 && bitpix > 0) 
        ffpscl(infptr, 1.0, 0.0, status);

    /* force a rescan of the output file keywords, so that */
    /* the compression parameters will be copied to the internal */
    /* fitsfile structure used by CFITSIO */
    ffrdef(outfptr, status);

    /* turn off any intensity scaling (defined by BSCALE and BZERO */
    /* keywords) so that unscaled values will be written by CFITSIO */
    /* (except if quantizing an int image, same as a float image) */
    if ( (outfptr->Fptr)->request_lossy_int_compress == 0 && bitpix > 0) 
        ffpscl(outfptr, 1.0, 0.0, status);

    /* Read each image tile, compress, and write to a table row. */
    imcomp_compress_image (infptr, outfptr, status);

    /* force another rescan of the output file keywords, to */
    /* update PCOUNT and TFORMn = '1PB(iii)' keyword values. */
    ffrdef(outfptr, status);

    /* unset any previously set compress parameter preferences */
    fits_unset_compression_request(outfptr, status);

/*
    fits_get_case(&c1, &c2, &c3);
    printf("c1, c2, c3 = %d, %d, %d\n", c1, c2, c3); 
*/

    return (*status);
}
/*--------------------------------------------------------------------------*/
int imcomp_init_table(fitsfile *outfptr,
        int inbitpix,
        int naxis,
        long *naxes,
	int writebitpix,    /* write the ZBITPIX, ZNAXIS, and ZNAXES keyword? */
        int *status)
/* 
  create a BINTABLE extension for the output compressed image.
*/
{
    char keyname[FLEN_KEYWORD], zcmptype[12];
    int ii,  remain,  ndiv, addToDim, ncols, bitpix;
    long nrows;
    char *ttype[] = {"COMPRESSED_DATA", "ZSCALE", "ZZERO"};
    char *tform[3];
    char tf0[4], tf1[4], tf2[4];
    char *tunit[] = {"\0",            "\0",            "\0"  };
    char comm[FLEN_COMMENT];
    long actual_tilesize[MAX_COMPRESS_DIM]; /* Actual size to use for tiles */
    int is_primary=0; /* Is this attempting to write to the primary? */
    int nQualifyDims=0; /* For Hcompress, number of image dimensions with required pixels. */
    int noHigherDims=1; /* Set to true if all tile dims other than x are size 1. */
    int firstDim=-1, secondDim=-1; /* Indices of first and second tiles dimensions
                                with width > 1 */
    
    if (*status > 0)
        return(*status);

    /* check for special case of losslessly compressing floating point */
    /* images.  Only compression algorithm that supports this is GZIP */
    if ( (inbitpix < 0) && ((outfptr->Fptr)->request_quantize_level == NO_QUANTIZE) ) {
       if (((outfptr->Fptr)->request_compress_type != GZIP_1) &&
           ((outfptr->Fptr)->request_compress_type != GZIP_2)) {
         ffpmsg("Lossless compression of floating point images must use GZIP (imcomp_init_table)");
         return(*status = DATA_COMPRESSION_ERR);
       }
    }
 
     /* set default compression parameter values, if undefined */
    
    if ( (outfptr->Fptr)->request_compress_type == 0) {
	/* use RICE_1 by default */
	(outfptr->Fptr)->request_compress_type = RICE_1;
    }

    if (inbitpix < 0 && (outfptr->Fptr)->request_quantize_level != NO_QUANTIZE) {  
	/* set defaults for quantizing floating point images */
	if ( (outfptr->Fptr)->request_quantize_method == 0) {
	      /* set default dithering method */
              (outfptr->Fptr)->request_quantize_method = SUBTRACTIVE_DITHER_1;
	}

	if ( (outfptr->Fptr)->request_quantize_level == 0) {
	    if ((outfptr->Fptr)->request_quantize_method == NO_DITHER) {
	        /* must use finer quantization if no dithering is done */
	        (outfptr->Fptr)->request_quantize_level = 16; 
	    } else {
	        (outfptr->Fptr)->request_quantize_level = 4; 
	    }
        }
    }

    /* special case: the quantization level is not given by a keyword in  */
    /* the HDU header, so we have to explicitly copy the requested value */
    /* to the actual value */
/* do this in imcomp_get_compressed_image_par, instead
    if ( (outfptr->Fptr)->request_quantize_level != 0.)
        (outfptr->Fptr)->quantize_level = (outfptr->Fptr)->request_quantize_level;
*/
    /* test for the 2 special cases that represent unsigned integers */
    if (inbitpix == USHORT_IMG)
        bitpix = SHORT_IMG;
    else if (inbitpix == ULONG_IMG)
        bitpix = LONG_IMG;
    else if (inbitpix == SBYTE_IMG)
        bitpix = BYTE_IMG;
    else 
        bitpix = inbitpix;

    /* reset default tile dimensions too if required */
    memcpy(actual_tilesize, outfptr->Fptr->request_tilesize, MAX_COMPRESS_DIM * sizeof(long));

    if ((outfptr->Fptr)->request_compress_type == HCOMPRESS_1) {
         
         /* Tiles must ultimately have 2 (and only 2) dimensions, each with
             at least 4 pixels. First catch the case where the image
             itself won't allow this. */
         if (naxis < 2 ) {
            ffpmsg("Hcompress cannot be used with 1-dimensional images (imcomp_init_table)");
            return(*status = DATA_COMPRESSION_ERR);
	 }
         for (ii=0; ii= 4)
               ++nQualifyDims;
         }
         if (nQualifyDims < 2)
         {
            ffpmsg("Hcompress minimum image dimension is 4 pixels (imcomp_init_table)");
            return(*status = DATA_COMPRESSION_ERR);            
         }

         /* Handle 2 special cases for backwards compatibility.
            1) If both X and Y tile dims are set to full size, ignore
               any other requested dimensions and just set their sizes to 1. 
            2) If X is full size and all the rest are size 1, attempt to
               find a reasonable size for Y. All other 1-D tile specifications
               will be rejected. */
         for (ii=1; ii 3) {
                      actual_tilesize[1] = 16;
		  } else if (naxes[1] % 24 == 0 || naxes[1] % 24 > 3) {
                      actual_tilesize[1] = 24;
		  } else if (naxes[1] % 20 == 0 || naxes[1] % 20 > 3) {
                      actual_tilesize[1] = 20;
		  } else if (naxes[1] % 30 == 0 || naxes[1] % 30 > 3) {
                      actual_tilesize[1] = 30;
		  } else if (naxes[1] % 28 == 0 || naxes[1] % 28 > 3) {
                      actual_tilesize[1] = 28;
		  } else if (naxes[1] % 26 == 0 || naxes[1] % 26 > 3) {
                      actual_tilesize[1] = 26;
		  } else if (naxes[1] % 22 == 0 || naxes[1] % 22 > 3) {
                      actual_tilesize[1] = 22;
		  } else if (naxes[1] % 18 == 0 || naxes[1] % 18 > 3) {
                      actual_tilesize[1] = 18;
		  } else if (naxes[1] % 14 == 0 || naxes[1] % 14 > 3) {
                      actual_tilesize[1] = 14;
		  } else  {
                      actual_tilesize[1] = 17;
		  }
	      }
        } else {
           if (actual_tilesize[0] <= 0)
              actual_tilesize[0] = naxes[0];
           for (ii=1; ii 1)
           {
              if (firstDim < 0)
                 firstDim = ii;
              else if (secondDim < 0)
                 secondDim = ii;
              else
              {
                 ffpmsg("Hcompress tiles can only have 2 dimensions (imcomp_init_table)");
                 return(*status = DATA_COMPRESSION_ERR);
              }
           }
        }
        if (firstDim < 0 || secondDim < 0)
        {
            ffpmsg("Hcompress tiles must have 2 dimensions (imcomp_init_table)");
            return(*status = DATA_COMPRESSION_ERR);
        }
        
        if (actual_tilesize[firstDim] < 4 || actual_tilesize[secondDim] < 4)
        {
           ffpmsg("Hcompress minimum tile dimension is 4 pixels (imcomp_init_table)");
           return (*status = DATA_COMPRESSION_ERR);
        }
	
        /* check if requested tile size causes the last tile to to have less than 4 pixels */
        remain = naxes[firstDim] % (actual_tilesize[firstDim]);  /* 1st dimension */
        if (remain > 0 && remain < 4) {
            ndiv = naxes[firstDim]/actual_tilesize[firstDim]; /* integer truncation is intentional */
            addToDim = ceil((double)remain/ndiv);
            (actual_tilesize[firstDim]) += addToDim; /* increase tile size */
	   
            remain = naxes[firstDim] % (actual_tilesize[firstDim]);
            if (remain > 0 && remain < 4) {
                ffpmsg("Last tile along 1st dimension has less than 4 pixels (imcomp_init_table)");
                return(*status = DATA_COMPRESSION_ERR);	
            }        
        }

        remain = naxes[secondDim] % (actual_tilesize[secondDim]);  /* 2nd dimension */
        if (remain > 0 && remain < 4) {
            ndiv = naxes[secondDim]/actual_tilesize[secondDim]; /* integer truncation is intentional */
            addToDim = ceil((double)remain/ndiv);
            (actual_tilesize[secondDim]) += addToDim; /* increase tile size */
	   
            remain = naxes[secondDim] % (actual_tilesize[secondDim]);
            if (remain > 0 && remain < 4) {
                ffpmsg("Last tile along 2nd dimension has less than 4 pixels (imcomp_init_table)");
                return(*status = DATA_COMPRESSION_ERR);	
            }        
        }

    } /* end, if HCOMPRESS_1 */
    
    for (ii = 0; ii < naxis; ii++) {
	if (ii == 0) { /* first axis is different */
	    if (actual_tilesize[ii] <= 0) {
                actual_tilesize[ii] = naxes[ii]; 
	    }
	} else {
	    if (actual_tilesize[ii] < 0) {
                actual_tilesize[ii] = naxes[ii];  /* negative value maean use whole length */
	    } else if (actual_tilesize[ii] == 0) {
                actual_tilesize[ii] = 1;  /* zero value means use default value = 1 */
	    }
	}
    }

    /* ---- set up array of TFORM strings -------------------------------*/
    if ( (outfptr->Fptr)->request_huge_hdu != 0) {
        strcpy(tf0, "1QB");
    } else {
        strcpy(tf0, "1PB");
    }
    strcpy(tf1, "1D");
    strcpy(tf2, "1D");

    tform[0] = tf0;
    tform[1] = tf1;
    tform[2] = tf2;

    /* calculate number of rows in output table */
    nrows = 1;
    for (ii = 0; ii < naxis; ii++)
    {
        nrows = nrows * ((naxes[ii] - 1)/ (actual_tilesize[ii]) + 1);
    }

    /* determine the default  number of columns in the output table */
    if (bitpix < 0 && (outfptr->Fptr)->request_quantize_level != NO_QUANTIZE)  
        ncols = 3;  /* quantized and scaled floating point image */
    else
        ncols = 1; /* default table has just one 'COMPRESSED_DATA' column */

    if ((outfptr->Fptr)->request_compress_type == RICE_1)
    {
        strcpy(zcmptype, "RICE_1");
    }
    else if ((outfptr->Fptr)->request_compress_type == GZIP_1)
    {
        strcpy(zcmptype, "GZIP_1");
    }
    else if ((outfptr->Fptr)->request_compress_type == GZIP_2)
    {
        strcpy(zcmptype, "GZIP_2");
    }
    else if ((outfptr->Fptr)->request_compress_type == BZIP2_1)
    {
        strcpy(zcmptype, "BZIP2_1");
    }
    else if ((outfptr->Fptr)->request_compress_type == PLIO_1)
    {
        strcpy(zcmptype, "PLIO_1");
       /* the PLIO compression algorithm outputs short integers, not bytes */
        if ( (outfptr->Fptr)->request_huge_hdu != 0) {
            strcpy(tform[0], "1QI");
        } else {
            strcpy(tform[0], "1PI");
        }
    }
    else if ((outfptr->Fptr)->request_compress_type == HCOMPRESS_1)
    {
        strcpy(zcmptype, "HCOMPRESS_1");
    }
    else if ((outfptr->Fptr)->request_compress_type == NOCOMPRESS)
    {
        strcpy(zcmptype, "NOCOMPRESS");
    }    
    else
    {
        ffpmsg("unknown compression type (imcomp_init_table)");
        return(*status = DATA_COMPRESSION_ERR);
    }

    /* If attempting to write compressed image to primary, the
       call to ffcrtb will increment Fptr->curhdu to 1.  Therefore
       we need to test now for setting is_primary */
    is_primary = (outfptr->Fptr->curhdu == 0);
    /* create the bintable extension to contain the compressed image */
    ffcrtb(outfptr, BINARY_TBL, nrows, ncols, ttype, 
                tform, tunit, 0, status);

    /* Add standard header keywords. */
    ffpkyl (outfptr, "ZIMAGE", 1, 
           "extension contains compressed image", status);  

    if (writebitpix) {
        /*  write the keywords defining the datatype and dimensions of */
	/*  the uncompressed image.  If not, these keywords will be */
        /*  copied later from the input uncompressed image  */
	
        if (is_primary)   
            ffpkyl (outfptr, "ZSIMPLE", 1,
			"file does conform to FITS standard", status);
        ffpkyj (outfptr, "ZBITPIX", bitpix,
			"data type of original image", status);
        ffpkyj (outfptr, "ZNAXIS", naxis,
			"dimension of original image", status);

        for (ii = 0;  ii < naxis;  ii++)
        {
            snprintf (keyname, FLEN_KEYWORD,"ZNAXIS%d", ii+1);
            ffpkyj (outfptr, keyname, naxes[ii],
			"length of original image axis", status);
        }
    }
                      
    for (ii = 0;  ii < naxis;  ii++)
    {
        snprintf (keyname, FLEN_KEYWORD,"ZTILE%d", ii+1);
        ffpkyj (outfptr, keyname, actual_tilesize[ii],
			"size of tiles to be compressed", status);
    }

    if (bitpix < 0) {
       
	if ((outfptr->Fptr)->request_quantize_level == NO_QUANTIZE) {
	    ffpkys(outfptr, "ZQUANTIZ", "NONE", 
	      "Lossless compression without quantization", status);
	} else {
	    
	    /* Unless dithering has been specifically turned off by setting */
	    /* request_quantize_method = -1, use dithering by default */
	    /* when quantizing floating point images. */
	
	    if ( (outfptr->Fptr)->request_quantize_method == 0) 
              (outfptr->Fptr)->request_quantize_method = SUBTRACTIVE_DITHER_1;
       
	    if ((outfptr->Fptr)->request_quantize_method == SUBTRACTIVE_DITHER_1) {
	      ffpkys(outfptr, "ZQUANTIZ", "SUBTRACTIVE_DITHER_1", 
	        "Pixel Quantization Algorithm", status);

	      /* also write the associated ZDITHER0 keyword with a default value */
	      /* which may get updated later. */
              ffpky(outfptr, TINT, "ZDITHER0", &((outfptr->Fptr)->request_dither_seed), 
	       "dithering offset when quantizing floats", status);
 
            } else if ((outfptr->Fptr)->request_quantize_method == SUBTRACTIVE_DITHER_2) {
	      ffpkys(outfptr, "ZQUANTIZ", "SUBTRACTIVE_DITHER_2", 
	        "Pixel Quantization Algorithm", status);

	      /* also write the associated ZDITHER0 keyword with a default value */
	      /* which may get updated later. */
              ffpky(outfptr, TINT, "ZDITHER0", &((outfptr->Fptr)->request_dither_seed), 
	       "dithering offset when quantizing floats", status);

	      if (!strcmp(zcmptype, "RICE_1"))  {
	        /* when using this new dithering method, change the compression type */
		/* to an alias, so that old versions of funpack will not be able to */
		/* created a corrupted uncompressed image. */
		/* ******* can remove this cludge after about June 2015, after most old versions of fpack are gone */
        	strcpy(zcmptype, "RICE_ONE");
	      }

            } else if ((outfptr->Fptr)->request_quantize_method == NO_DITHER) {
	      ffpkys(outfptr, "ZQUANTIZ", "NO_DITHER", 
	        "No dithering during quantization", status);
	    }

	}
    }

    ffpkys (outfptr, "ZCMPTYPE", zcmptype,
	          "compression algorithm", status);

    /* write any algorithm-specific keywords */
    if ((outfptr->Fptr)->request_compress_type == RICE_1)
    {
        ffpkys (outfptr, "ZNAME1", "BLOCKSIZE",
            "compression block size", status);

        /* for now at least, the block size is always 32 */
        ffpkyj (outfptr, "ZVAL1", 32,
			"pixels per block", status);

        ffpkys (outfptr, "ZNAME2", "BYTEPIX",
            "bytes per pixel (1, 2, 4, or 8)", status);

        if (bitpix == BYTE_IMG)
            ffpkyj (outfptr, "ZVAL2", 1,
			"bytes per pixel (1, 2, 4, or 8)", status);
        else if (bitpix == SHORT_IMG)
            ffpkyj (outfptr, "ZVAL2", 2,
			"bytes per pixel (1, 2, 4, or 8)", status);
        else 
            ffpkyj (outfptr, "ZVAL2", 4,
			"bytes per pixel (1, 2, 4, or 8)", status);

    }
    else if ((outfptr->Fptr)->request_compress_type == HCOMPRESS_1)
    {
        ffpkys (outfptr, "ZNAME1", "SCALE",
            "HCOMPRESS scale factor", status);
        ffpkye (outfptr, "ZVAL1", (outfptr->Fptr)->request_hcomp_scale,
		7, "HCOMPRESS scale factor", status);

        ffpkys (outfptr, "ZNAME2", "SMOOTH",
            "HCOMPRESS smooth option", status);
        ffpkyj (outfptr, "ZVAL2", (long) (outfptr->Fptr)->request_hcomp_smooth,
			"HCOMPRESS smooth option", status);
    }

    /* Write the BSCALE and BZERO keywords, if an unsigned integer image */
    if (inbitpix == USHORT_IMG)
    {
        strcpy(comm, "offset data range to that of unsigned short");
        ffpkyg(outfptr, "BZERO", 32768., 0, comm, status);
        strcpy(comm, "default scaling factor");
        ffpkyg(outfptr, "BSCALE", 1.0, 0, comm, status);
    }
    else if (inbitpix == SBYTE_IMG)
    {
        strcpy(comm, "offset data range to that of signed byte");
        ffpkyg(outfptr, "BZERO", -128., 0, comm, status);
        strcpy(comm, "default scaling factor");
        ffpkyg(outfptr, "BSCALE", 1.0, 0, comm, status);
    }
    else if (inbitpix == ULONG_IMG)
    {
        strcpy(comm, "offset data range to that of unsigned long");
        ffpkyg(outfptr, "BZERO", 2147483648., 0, comm, status);
        strcpy(comm, "default scaling factor");
        ffpkyg(outfptr, "BSCALE", 1.0, 0, comm, status);
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int imcomp_calc_max_elem (int comptype, int nx, int zbitpix, int blocksize)

/* This function returns the maximum number of bytes in a compressed
   image line.

    nx = maximum number of pixels in a tile
    blocksize is only relevant for RICE compression
*/
{    
    if (comptype == RICE_1)
    {
        if (zbitpix == 16)
            return (sizeof(short) * nx + nx / blocksize + 2 + 4);
	else
            return (sizeof(float) * nx + nx / blocksize + 2 + 4);
    }
    else if ((comptype == GZIP_1) || (comptype == GZIP_2))
    {
        /* gzip usually compressed by at least a factor of 2 for I*4 images */
        /* and somewhat less for I*2 images */
        /* If this size turns out to be too small, then the gzip */
        /* compression routine will allocate more space as required */
        /* to be on the safe size, allocate buffer same size as input */
	
        if (zbitpix == 16)
            return(nx * 2);
	else if (zbitpix == 8)
            return(nx);
	else
            return(nx * 4);
    }
    else if (comptype == BZIP2_1)
    {
        /* To guarantee that the compressed data will fit, allocate an output
	   buffer of size 1% larger than the uncompressed data, plus 600 bytes */

            return((int) (nx * 1.01 * zbitpix / 8. + 601.));
    }
     else if (comptype == HCOMPRESS_1)
    {
        /* Imperical evidence suggests in the worst case, 
	   the compressed stream could be up to 10% larger than the original
	   image.  Add 26 byte overhead, only significant for very small tiles
	   
         Possible improvement: may need to allow a larger size for 32-bit images */

        if (zbitpix == 16 || zbitpix == 8)
	
            return( (int) (nx * 2.2 + 26));   /* will be compressing 16-bit int array */
        else
            return( (int) (nx * 4.4 + 26));   /* will be compressing 32-bit int array */
    }
    else
        return(nx * sizeof(int));
}
/*--------------------------------------------------------------------------*/
int imcomp_compress_image (fitsfile *infptr, fitsfile *outfptr, int *status)

/* This routine does the following:
        - reads an image one tile at a time
        - if it is a float or double image, then it tries to quantize the pixels
          into scaled integers.
        - it then compressess the integer pixels, or if the it was not
	  possible to quantize the floating point pixels, then it losslessly
	  compresses them with gzip
	- writes the compressed byte stream to the output FITS file
*/
{
    double *tiledata;
    int anynul, gotnulls = 0, datatype;
    long ii, row;
    int naxis;
    double dummy = 0., dblnull = DOUBLENULLVALUE;
    float fltnull = FLOATNULLVALUE;
    long maxtilelen, tilelen, incre[] = {1, 1, 1, 1, 1, 1};
    long naxes[MAX_COMPRESS_DIM], fpixel[MAX_COMPRESS_DIM];
    long lpixel[MAX_COMPRESS_DIM], tile[MAX_COMPRESS_DIM];
    long tilesize[MAX_COMPRESS_DIM];
    long i0, i1, i2, i3, i4, i5, trowsize, ntrows;
    char card[FLEN_CARD];

    if (*status > 0)
        return(*status);

    maxtilelen = (outfptr->Fptr)->maxtilelen;

    /* 
     Allocate buffer to hold 1 tile of data; size depends on which compression 
     algorithm is used:

      Rice and GZIP will compress byte, short, or int arrays without conversion.
      PLIO requires 4-byte int values, so byte and short arrays must be converted to int.
      HCompress internally converts byte or short values to ints, and
         converts int values to 8-byte longlong integers.
    */
    
    if ((outfptr->Fptr)->zbitpix == FLOAT_IMG)
    {
        datatype = TFLOAT;

        if ( (outfptr->Fptr)->compress_type == HCOMPRESS_1) {
	    /* need twice as much scratch space (8 bytes per pixel) */
            tiledata = (double*) malloc (maxtilelen * 2 *sizeof (float));	
	} else {
            tiledata = (double*) malloc (maxtilelen * sizeof (float));
	}
    }
    else if ((outfptr->Fptr)->zbitpix == DOUBLE_IMG)
    {
        datatype = TDOUBLE;
        tiledata = (double*) malloc (maxtilelen * sizeof (double));
    }
    else if ((outfptr->Fptr)->zbitpix == SHORT_IMG)
    {
        datatype = TSHORT;
        if ( (outfptr->Fptr)->compress_type == RICE_1  ||
	     (outfptr->Fptr)->compress_type == GZIP_1  ||
	     (outfptr->Fptr)->compress_type == GZIP_2  ||
	     (outfptr->Fptr)->compress_type == BZIP2_1 ||
             (outfptr->Fptr)->compress_type == NOCOMPRESS) {
	    /* only need  buffer of I*2 pixels for gzip, bzip2, and Rice */

            tiledata = (double*) malloc (maxtilelen * sizeof (short));	
	} else {
 	    /*  need  buffer of I*4 pixels for Hcompress and PLIO */
            tiledata = (double*) malloc (maxtilelen * sizeof (int));
        }
    }
    else if ((outfptr->Fptr)->zbitpix == BYTE_IMG)
    {

        datatype = TBYTE;
        if ( (outfptr->Fptr)->compress_type == RICE_1  ||
	     (outfptr->Fptr)->compress_type == BZIP2_1 ||
	     (outfptr->Fptr)->compress_type == GZIP_1  ||
	     (outfptr->Fptr)->compress_type == GZIP_2) {
	    /* only need  buffer of I*1 pixels for gzip, bzip2, and Rice */

            tiledata = (double*) malloc (maxtilelen);	
	} else {
 	    /*  need  buffer of I*4 pixels for Hcompress and PLIO */
            tiledata = (double*) malloc (maxtilelen * sizeof (int));
        }
    }
    else if ((outfptr->Fptr)->zbitpix == LONG_IMG)
    {
        datatype = TINT;
        if ( (outfptr->Fptr)->compress_type == HCOMPRESS_1) {
	    /* need twice as much scratch space (8 bytes per pixel) */

            tiledata = (double*) malloc (maxtilelen * 2 * sizeof (int));	
	} else {
 	    /* only need  buffer of I*4 pixels for gzip, bzip2,  Rice, and PLIO */

            tiledata = (double*) malloc (maxtilelen * sizeof (int));
        }
    }
    else
    {
	ffpmsg("Bad image datatype. (imcomp_compress_image)");
	return (*status = MEMORY_ALLOCATION);
    }
    
    if (tiledata == NULL)
    {
	ffpmsg("Out of memory. (imcomp_compress_image)");
	return (*status = MEMORY_ALLOCATION);
    }

    /*  calculate size of tile in each dimension */
    naxis = (outfptr->Fptr)->zndim;
    for (ii = 0; ii < MAX_COMPRESS_DIM; ii++)
    {
        if (ii < naxis)
        {
             naxes[ii] = (outfptr->Fptr)->znaxis[ii];
             tilesize[ii] = (outfptr->Fptr)->tilesize[ii];
        }
        else
        {
            naxes[ii] = 1;
            tilesize[ii] = 1;
        }
    }
    row = 1;

    /* set up big loop over up to 6 dimensions */
    for (i5 = 1; i5 <= naxes[5]; i5 += tilesize[5])
    {
     fpixel[5] = i5;
     lpixel[5] = minvalue(i5 + tilesize[5] - 1, naxes[5]);
     tile[5] = lpixel[5] - fpixel[5] + 1;
     for (i4 = 1; i4 <= naxes[4]; i4 += tilesize[4])
     {
      fpixel[4] = i4;
      lpixel[4] = minvalue(i4 + tilesize[4] - 1, naxes[4]);
      tile[4] = lpixel[4] - fpixel[4] + 1;
      for (i3 = 1; i3 <= naxes[3]; i3 += tilesize[3])
      {
       fpixel[3] = i3;
       lpixel[3] = minvalue(i3 + tilesize[3] - 1, naxes[3]);
       tile[3] = lpixel[3] - fpixel[3] + 1;
       for (i2 = 1; i2 <= naxes[2]; i2 += tilesize[2])
       {
        fpixel[2] = i2;
        lpixel[2] = minvalue(i2 + tilesize[2] - 1, naxes[2]);
        tile[2] = lpixel[2] - fpixel[2] + 1;
        for (i1 = 1; i1 <= naxes[1]; i1 += tilesize[1])
        {
         fpixel[1] = i1;
         lpixel[1] = minvalue(i1 + tilesize[1] - 1, naxes[1]);
         tile[1] = lpixel[1] - fpixel[1] + 1;
         for (i0 = 1; i0 <= naxes[0]; i0 += tilesize[0])
         {
          fpixel[0] = i0;
          lpixel[0] = minvalue(i0 + tilesize[0] - 1, naxes[0]);
          tile[0] = lpixel[0] - fpixel[0] + 1;

          /* number of pixels in this tile */
          tilelen = tile[0];
          for (ii = 1; ii < naxis; ii++)
          {
             tilelen *= tile[ii];
          }

          /* read next tile of data from image */
	  anynul = 0;
          if (datatype == TFLOAT)
          {
              ffgsve(infptr, 1, naxis, naxes, fpixel, lpixel, incre, 
                  FLOATNULLVALUE, (float *) tiledata,  &anynul, status);
          }
          else if (datatype == TDOUBLE)
          {
              ffgsvd(infptr, 1, naxis, naxes, fpixel, lpixel, incre, 
                  DOUBLENULLVALUE, tiledata, &anynul, status);
          }
          else if (datatype == TINT)
          {
              ffgsvk(infptr, 1, naxis, naxes, fpixel, lpixel, incre, 
                  0, (int *) tiledata,  &anynul, status);
          }
          else if (datatype == TSHORT)
          {
              ffgsvi(infptr, 1, naxis, naxes, fpixel, lpixel, incre, 
                  0, (short *) tiledata,  &anynul, status);
          }
          else if (datatype == TBYTE)
          {
              ffgsvb(infptr, 1, naxis, naxes, fpixel, lpixel, incre, 
                  0, (unsigned char *) tiledata,  &anynul, status);
          }
          else 
          {
              ffpmsg("Error bad datatype of image tile to compress");
              free(tiledata);
              return (*status);
          }

          /* now compress the tile, and write to row of binary table */
          /*   NOTE: we don't have to worry about the presence of null values in the
	       array if it is an integer array:  the null value is simply encoded
	       in the compressed array just like any other pixel value.  
	       
	       If it is a floating point array, then we need to check for null
	       only if the anynul parameter returned a true value when reading the tile
	  */
          
          /* Collapse sizes of higher dimension tiles into 2 dimensional
             equivalents needed by the quantizing algorithms for
             floating point types */
          fits_calc_tile_rows(lpixel, fpixel, naxis, &trowsize,
                            &ntrows, status);

          if (anynul && datatype == TFLOAT) {
              imcomp_compress_tile(outfptr, row, datatype, tiledata, tilelen,
                               trowsize, ntrows, 1, &fltnull, status);
          } else if (anynul && datatype == TDOUBLE) {
              imcomp_compress_tile(outfptr, row, datatype, tiledata, tilelen,
                               trowsize, ntrows, 1, &dblnull, status);
          } else {
              imcomp_compress_tile(outfptr, row, datatype, tiledata, tilelen,
                               trowsize, ntrows, 0, &dummy, status);
          }

          /* set flag if we found any null values */
          if (anynul)
              gotnulls = 1;

          /* check for any error in the previous operations */
          if (*status > 0)
          {
              ffpmsg("Error writing compressed image to table");
              free(tiledata);
              return (*status);
          }

	  row++;
         }
        }
       }
      }
     }
    }

    free (tiledata);  /* finished with this buffer */

    /* insert ZBLANK keyword if necessary; only for TFLOAT or TDOUBLE images */
    if (gotnulls)
    {
          ffgcrd(outfptr, "ZCMPTYPE", card, status);
          ffikyj(outfptr, "ZBLANK", COMPRESS_NULL_VALUE, 
             "null value in the compressed integer array", status);
    }

    return (*status);
}
/*--------------------------------------------------------------------------*/
int imcomp_compress_tile (fitsfile *outfptr,
    long row,  /* tile number = row in the binary table that holds the compressed data */
    int datatype, 
    void *tiledata, 
    long tilelen,
    long tilenx,
    long tileny,
    int nullcheck,
    void *nullflagval,
    int *status)

/*
   This is the main compression routine.

   This routine does the following to the input tile of pixels:
        - if it is a float or double image, then it quantizes the pixels
        - compresses the integer pixel values
        - writes the compressed byte stream to the FITS file.

   If the tile cannot be quantized than the raw float or double values
   are losslessly compressed with gzip and then written to the output table.
   
   This input array may be modified by this routine.  If the array is of type TINT
   or TFLOAT, and the compression type is HCOMPRESS, then it must have been 
   allocated to be twice as large (8 bytes per pixel) to provide scratch space.

  Note that this routine does not fully support the implicit datatype conversion that
  is supported when writing to normal FITS images.  The datatype of the input array
  must have the same datatype (either signed or unsigned) as the output (compressed)
  FITS image in some cases.
*/
{
    int *idata;		/* quantized integer data */
    int cn_zblank, zbitpix, nullval;
    int flag = 1;  /* true by default; only = 0 if float data couldn't be quantized */
    int intlength;      /* size of integers to be compressed */
    double scale, zero, actual_bzero;
    long ii;
    size_t clen;		/* size of cbuf */
    short *cbuf;	/* compressed data */
    int  nelem = 0;		/* number of bytes */
    int tilecol;
    size_t gzip_nelem = 0;
    unsigned int bzlen;
    int ihcompscale;
    float hcompscale;
    double noise2, noise3, noise5;
    double bscale[1] = {1.}, bzero[1] = {0.};	/* scaling parameters */
    long  hcomp_len;
    LONGLONG *lldata;

    if (*status > 0)
        return(*status);

    /* check for special case of losslessly compressing floating point */
    /* images.  Only compression algorithm that supports this is GZIP */
    if ( (outfptr->Fptr)->quantize_level == NO_QUANTIZE) {
       if (((outfptr->Fptr)->compress_type != GZIP_1) &&
           ((outfptr->Fptr)->compress_type != GZIP_2)) {
           switch (datatype) {
            case TFLOAT:
            case TDOUBLE:
            case TCOMPLEX:
            case TDBLCOMPLEX:
              ffpmsg("Lossless compression of floating point images must use GZIP (imcomp_compress_tile)");
              return(*status = DATA_COMPRESSION_ERR);
            default:
              break;
          }
       }
    }

    /* free the previously saved tile if the input tile is for the same row */
    if ((outfptr->Fptr)->tilerow) {  /* has the tile cache been allocated? */

      /* calculate the column bin of the compressed tile */
      tilecol = (row - 1) % ((long)(((outfptr->Fptr)->znaxis[0] - 1) / ((outfptr->Fptr)->tilesize[0])) + 1);
      
      if ((outfptr->Fptr)->tilerow[tilecol] == row) {
        if (((outfptr->Fptr)->tiledata)[tilecol]) {
            free(((outfptr->Fptr)->tiledata)[tilecol]);
        }
	  
        if (((outfptr->Fptr)->tilenullarray)[tilecol]) {
            free(((outfptr->Fptr)->tilenullarray)[tilecol]);
        }

        ((outfptr->Fptr)->tiledata)[tilecol] = 0;
        ((outfptr->Fptr)->tilenullarray)[tilecol] = 0;
        (outfptr->Fptr)->tilerow[tilecol] = 0;
        (outfptr->Fptr)->tiledatasize[tilecol] = 0;
        (outfptr->Fptr)->tiletype[tilecol] = 0;
        (outfptr->Fptr)->tileanynull[tilecol] = 0;
      }
    }

    if ( (outfptr->Fptr)->compress_type == NOCOMPRESS) {
         /* Special case when using NOCOMPRESS for diagnostic purposes in fpack */
         if (imcomp_write_nocompress_tile(outfptr, row, datatype, tiledata, tilelen, 
	     nullcheck, nullflagval, status) > 0) {
             return(*status);
         }
         return(*status);
    }

    /* =========================================================================== */
    /* initialize various parameters */
    idata = (int *) tiledata;   /* may overwrite the input tiledata in place */

    /* zbitpix is the BITPIX keyword value in the uncompressed FITS image */
    zbitpix = (outfptr->Fptr)->zbitpix;

    /* if the tile/image has an integer datatype, see if a null value has */
    /* been defined (with the BLANK keyword in a normal FITS image).  */
    /* If so, and if the input tile array also contains null pixels, */
    /* (represented by pixels that have a value = nullflagval) then  */
    /* any pixels whose value = nullflagval, must be set to the value = nullval */
    /* before the pixel array is compressed.  These null pixel values must */
    /* not be inverse scaled by the BSCALE/BZERO values, if present. */

    cn_zblank = (outfptr->Fptr)->cn_zblank;
    nullval = (outfptr->Fptr)->zblank;

    if (zbitpix > 0 && cn_zblank != -1)  /* If the integer image has no defined null */
        nullcheck = 0;    /* value, then don't bother checking input array for nulls. */

    /* if the BSCALE and BZERO keywords exist, then the input values must */
    /* be inverse scaled by this factor, before the values are compressed. */
    /* (The program may have turned off scaling, which over rides the keywords) */
    
    scale = (outfptr->Fptr)->cn_bscale;
    zero  = (outfptr->Fptr)->cn_bzero;
    actual_bzero = (outfptr->Fptr)->cn_actual_bzero;

    /* =========================================================================== */
    /* prepare the tile of pixel values for compression */
    if (datatype == TSHORT) {
       imcomp_convert_tile_tshort(outfptr, tiledata, tilelen, nullcheck, nullflagval,
           nullval, zbitpix, scale, zero, actual_bzero, &intlength, status);
    } else if (datatype == TUSHORT) {
       imcomp_convert_tile_tushort(outfptr, tiledata, tilelen, nullcheck, nullflagval,
           nullval, zbitpix, scale, zero, &intlength, status);
    } else if (datatype == TBYTE) {
       imcomp_convert_tile_tbyte(outfptr, tiledata, tilelen, nullcheck, nullflagval,
           nullval, zbitpix, scale, zero,  &intlength, status);
    } else if (datatype == TSBYTE) {
       imcomp_convert_tile_tsbyte(outfptr, tiledata, tilelen, nullcheck, nullflagval,
           nullval, zbitpix, scale, zero,  &intlength, status);
    } else if (datatype == TINT) {
       imcomp_convert_tile_tint(outfptr, tiledata, tilelen, nullcheck, nullflagval,
           nullval, zbitpix, scale, zero, &intlength, status);
    } else if (datatype == TUINT) {
       imcomp_convert_tile_tuint(outfptr, tiledata, tilelen, nullcheck, nullflagval,
           nullval, zbitpix, scale, zero, &intlength, status);
    } else if (datatype == TLONG && sizeof(long) == 8) {
           ffpmsg("Integer*8 Long datatype is not supported when writing to compressed images");
           return(*status = BAD_DATATYPE);
    } else if (datatype == TULONG && sizeof(long) == 8) {
           ffpmsg("Unsigned integer*8 datatype is not supported when writing to compressed images");
           return(*status = BAD_DATATYPE);
    } else if (datatype == TFLOAT) {
        imcomp_convert_tile_tfloat(outfptr, row, tiledata, tilelen, tilenx, tileny, nullcheck,
        nullflagval, nullval, zbitpix, scale, zero, &intlength, &flag, bscale, bzero, status);
    } else if (datatype == TDOUBLE) {
       imcomp_convert_tile_tdouble(outfptr, row, tiledata, tilelen, tilenx, tileny, nullcheck,
       nullflagval, nullval, zbitpix, scale, zero, &intlength, &flag, bscale, bzero, status);
    } else {
          ffpmsg("unsupported image datatype (imcomp_compress_tile)");
          return(*status = BAD_DATATYPE);
    }

    if (*status > 0)
      return(*status);      /* return if error occurs */

    /* =========================================================================== */
    if (flag)   /* now compress the integer data array */
    {
        /* allocate buffer for the compressed tile bytes */
        clen = (outfptr->Fptr)->maxelem;
        cbuf = (short *) calloc (clen, sizeof (unsigned char));

        if (cbuf == NULL) {
            ffpmsg("Memory allocation failure. (imcomp_compress_tile)");
	    return (*status = MEMORY_ALLOCATION);
        }

        /* =========================================================================== */
        if ( (outfptr->Fptr)->compress_type == RICE_1)
        {
            if (intlength == 2) {
  	        nelem = fits_rcomp_short ((short *)idata, tilelen, (unsigned char *) cbuf,
                       clen, (outfptr->Fptr)->rice_blocksize);
            } else if (intlength == 1) {
  	        nelem = fits_rcomp_byte ((signed char *)idata, tilelen, (unsigned char *) cbuf,
                       clen, (outfptr->Fptr)->rice_blocksize);
            } else {
  	        nelem = fits_rcomp (idata, tilelen, (unsigned char *) cbuf,
                       clen, (outfptr->Fptr)->rice_blocksize);
            }

	    if (nelem < 0)  /* data compression error condition */
            {
	        free (cbuf);
                ffpmsg("error Rice compressing image tile (imcomp_compress_tile)");
                return (*status = DATA_COMPRESSION_ERR);
            }

	    /* Write the compressed byte stream. */
            ffpclb(outfptr, (outfptr->Fptr)->cn_compressed, row, 1,
                     nelem, (unsigned char *) cbuf, status);
        }

        /* =========================================================================== */
        else if ( (outfptr->Fptr)->compress_type == PLIO_1)
        {
              for (ii = 0; ii < tilelen; ii++)  {
                if (idata[ii] < 0 || idata[ii] > 16777215)
                {
                   /* plio algorithn only supports positive 24 bit ints */
                   ffpmsg("data out of range for PLIO compression (0 - 2**24)");
                   return(*status = DATA_COMPRESSION_ERR);
                }
              }

  	      nelem = pl_p2li (idata, 1, cbuf, tilelen);

	      if (nelem < 0)  /* data compression error condition */
              {
	        free (cbuf);
                ffpmsg("error PLIO compressing image tile (imcomp_compress_tile)");
                return (*status = DATA_COMPRESSION_ERR);
              }

	      /* Write the compressed byte stream. */
              ffpcli(outfptr, (outfptr->Fptr)->cn_compressed, row, 1,
                     nelem, cbuf, status);
        }

        /* =========================================================================== */
        else if ( ((outfptr->Fptr)->compress_type == GZIP_1) ||
                  ((outfptr->Fptr)->compress_type == GZIP_2) )   {

	    if ((outfptr->Fptr)->quantize_level == NO_QUANTIZE && datatype == TFLOAT) {
	      /* Special case of losslessly compressing floating point pixels with GZIP */
	      /* In this case we compress the input tile array directly */

#if BYTESWAPPED
               ffswap4((int*) tiledata, tilelen); 
#endif
               if ( (outfptr->Fptr)->compress_type == GZIP_2 )
		    fits_shuffle_4bytes((char *) tiledata, tilelen, status);

                compress2mem_from_mem((char *) tiledata, tilelen * sizeof(float),
                    (char **) &cbuf,  &clen, realloc, &gzip_nelem, status);

	    } else if ((outfptr->Fptr)->quantize_level == NO_QUANTIZE && datatype == TDOUBLE) {
	      /* Special case of losslessly compressing double pixels with GZIP */
	      /* In this case we compress the input tile array directly */

#if BYTESWAPPED
               ffswap8((double *) tiledata, tilelen); 
#endif
               if ( (outfptr->Fptr)->compress_type == GZIP_2 )
		    fits_shuffle_8bytes((char *) tiledata, tilelen, status);

                compress2mem_from_mem((char *) tiledata, tilelen * sizeof(double),
                    (char **) &cbuf,  &clen, realloc, &gzip_nelem, status);

	    } else {

	        /* compress the integer idata array */

#if BYTESWAPPED
	       if (intlength == 2)
                 ffswap2((short *) idata, tilelen); 
	       else if (intlength == 4)
                 ffswap4(idata, tilelen); 
#endif

               if (intlength == 2) {

                  if ( (outfptr->Fptr)->compress_type == GZIP_2 )
		    fits_shuffle_2bytes((char *) tiledata, tilelen, status);

                  compress2mem_from_mem((char *) idata, tilelen * sizeof(short),
                   (char **) &cbuf,  &clen, realloc, &gzip_nelem, status);

               } else if (intlength == 1) {

                  compress2mem_from_mem((char *) idata, tilelen * sizeof(unsigned char),
                   (char **) &cbuf,  &clen, realloc, &gzip_nelem, status);

               } else {

                  if ( (outfptr->Fptr)->compress_type == GZIP_2 )
		    fits_shuffle_4bytes((char *) tiledata, tilelen, status);

                  compress2mem_from_mem((char *) idata, tilelen * sizeof(int),
                   (char **) &cbuf,  &clen, realloc, &gzip_nelem, status);
               }
            }

	    /* Write the compressed byte stream. */
            ffpclb(outfptr, (outfptr->Fptr)->cn_compressed, row, 1,
                     gzip_nelem, (unsigned char *) cbuf, status);

        /* =========================================================================== */
        } else if ( (outfptr->Fptr)->compress_type == BZIP2_1) {

#if BYTESWAPPED
	   if (intlength == 2)
               ffswap2((short *) idata, tilelen); 
	   else if (intlength == 4)
               ffswap4(idata, tilelen); 
#endif

           bzlen = (unsigned int) clen;
	   
           /* call bzip2 with blocksize = 900K, verbosity = 0, and default workfactor */

/*  bzip2 is not supported in the public release.  This is only for test purposes.
           if (BZ2_bzBuffToBuffCompress( (char *) cbuf, &bzlen,
	         (char *) idata, (unsigned int) (tilelen * intlength), 9, 0, 0) ) 
*/
	   {
                   ffpmsg("bzip2 compression error");
                   return(*status = DATA_COMPRESSION_ERR);
           }

	    /* Write the compressed byte stream. */
            ffpclb(outfptr, (outfptr->Fptr)->cn_compressed, row, 1,
                     bzlen, (unsigned char *) cbuf, status);

        /* =========================================================================== */
        }  else if ( (outfptr->Fptr)->compress_type == HCOMPRESS_1)     {
	    /*
	      if hcompscale is positive, then we have to multiply
	      the value by the RMS background noise to get the 
	      absolute scale value.  If negative, then it gives the
	      absolute scale value directly.
	    */
            hcompscale = (outfptr->Fptr)->hcomp_scale;

	    if (hcompscale > 0.) {
	       fits_img_stats_int(idata, tilenx, tileny, nullcheck,
	                nullval, 0,0,0,0,0,0,&noise2,&noise3,&noise5,status);

		/* use the minimum of the 3 noise estimates */
		if (noise2 != 0. && noise2 < noise3) noise3 = noise2;
		if (noise5 != 0. && noise5 < noise3) noise3 = noise5;
		
		hcompscale = (float) (hcompscale * noise3);

	    } else if (hcompscale < 0.) {

		hcompscale = hcompscale * -1.0F;
	    }

	    ihcompscale = (int) (hcompscale + 0.5);

            hcomp_len = clen;  /* allocated size of the buffer */
	    
            if (zbitpix == BYTE_IMG || zbitpix == SHORT_IMG) {
                fits_hcompress(idata, tilenx, tileny, 
		  ihcompscale, (char *) cbuf, &hcomp_len, status);

            } else {
                 /* have to convert idata to an I*8 array, in place */
                 /* idata must have been allocated large enough to do this */

                fits_int_to_longlong_inplace(idata, tilelen, status);
                lldata = (LONGLONG *) idata;		

                fits_hcompress64(lldata, tilenx, tileny, 
		  ihcompscale, (char *) cbuf, &hcomp_len, status);
            }

	    /* Write the compressed byte stream. */
            ffpclb(outfptr, (outfptr->Fptr)->cn_compressed, row, 1,
                     hcomp_len, (unsigned char *) cbuf, status);
        }

        /* =========================================================================== */
        if ((outfptr->Fptr)->cn_zscale > 0)
        {
              /* write the linear scaling parameters for this tile */
	      ffpcld (outfptr, (outfptr->Fptr)->cn_zscale, row, 1, 1,
                      bscale, status);
	      ffpcld (outfptr, (outfptr->Fptr)->cn_zzero,  row, 1, 1,
                      bzero,  status);
        }

        free(cbuf);  /* finished with this buffer */

    /* =========================================================================== */
    } else {    /* if flag == 0., floating point data couldn't be quantized */

	 /* losslessly compress the data with gzip. */

         /* if gzip2 compressed data column doesn't exist, create it */
         if ((outfptr->Fptr)->cn_gzip_data < 1) {
              if ( (outfptr->Fptr)->request_huge_hdu != 0) {
                 fits_insert_col(outfptr, 999, "GZIP_COMPRESSED_DATA", "1QB", status);
              } else {
                 fits_insert_col(outfptr, 999, "GZIP_COMPRESSED_DATA", "1PB", status);
              }

                 if (*status <= 0)  /* save the number of this column */
                       ffgcno(outfptr, CASEINSEN, "GZIP_COMPRESSED_DATA",
                                &(outfptr->Fptr)->cn_gzip_data, status);
         }

         if (datatype == TFLOAT)  {
               /* allocate buffer for the compressed tile bytes */
	       /* make it 10% larger than the original uncompressed data */
               clen = (size_t) (tilelen * sizeof(float) * 1.1);
               cbuf = (short *) calloc (clen, sizeof (unsigned char));

               if (cbuf == NULL)
               {
                   ffpmsg("Memory allocation error. (imcomp_compress_tile)");
	           return (*status = MEMORY_ALLOCATION);
               }

	       /* convert null values to NaNs in place, if necessary */
	       if (nullcheck == 1) {
	           imcomp_float2nan((float *) tiledata, tilelen, (int *) tiledata,
	               *(float *) (nullflagval), status);
	       }

#if BYTESWAPPED
               ffswap4((int*) tiledata, tilelen); 
#endif
               compress2mem_from_mem((char *) tiledata, tilelen * sizeof(float),
                    (char **) &cbuf,  &clen, realloc, &gzip_nelem, status);

         } else {  /* datatype == TDOUBLE */

               /* allocate buffer for the compressed tile bytes */
	       /* make it 10% larger than the original uncompressed data */
               clen = (size_t) (tilelen * sizeof(double) * 1.1);
               cbuf = (short *) calloc (clen, sizeof (unsigned char));

               if (cbuf == NULL)
               {
                   ffpmsg("Memory allocation error. (imcomp_compress_tile)");
	           return (*status = MEMORY_ALLOCATION);
               }

	       /* convert null values to NaNs in place, if necessary */
	       if (nullcheck == 1) {
	           imcomp_double2nan((double *) tiledata, tilelen, (LONGLONG *) tiledata,
	               *(double *) (nullflagval), status);
	       }

#if BYTESWAPPED
               ffswap8((double*) tiledata, tilelen); 
#endif
               compress2mem_from_mem((char *) tiledata, tilelen * sizeof(double),
                    (char **) &cbuf,  &clen, realloc, &gzip_nelem, status);
        }

	/* Write the compressed byte stream. */
        ffpclb(outfptr, (outfptr->Fptr)->cn_gzip_data, row, 1,
             gzip_nelem, (unsigned char *) cbuf, status);

        free(cbuf);  /* finished with this buffer */
    }

    return(*status);
}

/*--------------------------------------------------------------------------*/
int imcomp_write_nocompress_tile(fitsfile *outfptr,
    long row,
    int datatype, 
    void *tiledata, 
    long tilelen,
    int nullcheck,
    void *nullflagval,
    int *status)
{
    char coltype[4];

    /* Write the uncompressed image tile pixels to the tile-compressed image file. */
    /* This is a special case when using NOCOMPRESS for diagnostic purposes in fpack. */ 
    /* Currently, this only supports a limited number of data types and */
    /* does not fully support null-valued pixels in the image. */

    if ((outfptr->Fptr)->cn_uncompressed < 1) {
        /* uncompressed data column doesn't exist, so append new column to table */
        if (datatype == TSHORT) {
	    strcpy(coltype, "1PI");
	} else if (datatype == TINT) {
	    strcpy(coltype, "1PJ");
	} else if (datatype == TFLOAT) {
	    strcpy(coltype, "1QE");
        } else {
	    ffpmsg("NOCOMPRESSION option only supported for int*2, int*4, and float*4 images");
            return(*status = DATA_COMPRESSION_ERR);
        }

        fits_insert_col(outfptr, 999, "UNCOMPRESSED_DATA", coltype, status); /* create column */
    }

    fits_get_colnum(outfptr, CASEINSEN, "UNCOMPRESSED_DATA",
                    &(outfptr->Fptr)->cn_uncompressed, status);  /* save col. num. */
    
    fits_write_col(outfptr, datatype, (outfptr->Fptr)->cn_uncompressed, row, 1,
                      tilelen, tiledata, status);  /* write the tile data */
    return (*status);
}
 /*--------------------------------------------------------------------------*/
int imcomp_convert_tile_tshort(
    fitsfile *outfptr,
    void *tiledata, 
    long tilelen,
    int nullcheck,
    void *nullflagval,
    int nullval,
    int zbitpix,
    double scale,
    double zero,
    double actual_bzero,
    int *intlength,
    int *status)
{
    /*  Prepare the input tile array of pixels for compression. */
    /*  Convert input integer*2 tile array in place to 4 or 8-byte ints for compression, */
    /*  If needed, convert 4 or 8-byte ints and do null value substitution. */
    /*  Note that the calling routine must have allocated the input array big enough */
    /* to be able to do this.  */

    short *sbuff;
    int flagval, *idata;
    long ii;
    
       /* We only support writing this integer*2 tile data to a FITS image with 
          BITPIX = 16 and with BZERO = 0 and BSCALE = 1.  */
	  
       if (zbitpix != SHORT_IMG || scale != 1.0 || zero != 0.0) {
           ffpmsg("Datatype conversion/scaling is not supported when writing to compressed images");
           return(*status = DATA_COMPRESSION_ERR);
       } 

       sbuff = (short *) tiledata;
       idata = (int *) tiledata;
       
       if ( (outfptr->Fptr)->compress_type == RICE_1 || (outfptr->Fptr)->compress_type == GZIP_1
         || (outfptr->Fptr)->compress_type == GZIP_2 || (outfptr->Fptr)->compress_type == BZIP2_1 ) 
       {
           /* don't have to convert to int if using gzip, bzip2 or Rice compression */
           *intlength = 2;
             
           if (nullcheck == 1) {
               /* reset pixels equal to flagval to the FITS null value, prior to compression */
               flagval = *(short *) (nullflagval);
               if (flagval != nullval) {
                  for (ii = tilelen - 1; ii >= 0; ii--) {
	            if (sbuff[ii] == (short) flagval)
		       sbuff[ii] = (short) nullval;
                  }
               }
           }
       } else if ((outfptr->Fptr)->compress_type == HCOMPRESS_1) {
           /* have to convert to int if using HCOMPRESS */
           *intlength = 4;

           if (nullcheck == 1) {
               /* reset pixels equal to flagval to the FITS null value, prior to compression */
               flagval = *(short *) (nullflagval);
               for (ii = tilelen - 1; ii >= 0; ii--) {
	            if (sbuff[ii] == (short) flagval)
		       idata[ii] = nullval;
                    else 
                       idata[ii] = (int) sbuff[ii];
               }
           } else {  /* just do the data type conversion to int */
                 /* have to convert sbuff to an I*4 array, in place */
                 /* sbuff must have been allocated large enough to do this */
                 fits_short_to_int_inplace(sbuff, tilelen, 0, status);
           }
       } else {
           /* have to convert to int if using PLIO */
           *intlength = 4;
           if (zero == 0. && actual_bzero == 32768.) {
             /* Here we are compressing unsigned 16-bit integers that have */
	     /* been offset by -32768 using the standard FITS convention. */
	     /* Since PLIO cannot deal with negative values, we must apply */
	     /* the shift of 32786 to the values to make them all positive. */
	     /* The inverse negative shift will be applied in */
	     /* imcomp_decompress_tile when reading the compressed tile. */
             if (nullcheck == 1) {
               /* reset pixels equal to flagval to the FITS null value, prior to compression */
               flagval = *(short *) (nullflagval);
               for (ii = tilelen - 1; ii >= 0; ii--) {
	            if (sbuff[ii] == (short) flagval)
		       idata[ii] = nullval;
                    else
                       idata[ii] = (int) sbuff[ii] + 32768;
               }
             } else {  
                 /* have to convert sbuff to an I*4 array, in place */
                 /* sbuff must have been allocated large enough to do this */
                 fits_short_to_int_inplace(sbuff, tilelen, 32768, status);
             }
           } else {
	     /* This is not an unsigned 16-bit integer array, so process normally */
             if (nullcheck == 1) {
               /* reset pixels equal to flagval to the FITS null value, prior to compression */
               flagval = *(short *) (nullflagval);
               for (ii = tilelen - 1; ii >= 0; ii--) {
	            if (sbuff[ii] == (short) flagval)
		       idata[ii] = nullval;
                    else
                       idata[ii] = (int) sbuff[ii];
               }
             } else {  /* just do the data type conversion to int */
                 /* have to convert sbuff to an I*4 array, in place */
                 /* sbuff must have been allocated large enough to do this */
                 fits_short_to_int_inplace(sbuff, tilelen, 0, status);
             }
           }
        }
        return(*status);
}
 /*--------------------------------------------------------------------------*/
int imcomp_convert_tile_tushort(
    fitsfile *outfptr,
    void *tiledata, 
    long tilelen,
    int nullcheck,
    void *nullflagval,
    int nullval,
    int zbitpix,
    double scale,
    double zero,
    int *intlength,
    int *status)
{
    /*  Prepare the input  tile array of pixels for compression. */
    /*  Convert input unsigned integer*2 tile array in place to 4 or 8-byte ints for compression, */
    /*  If needed, convert 4 or 8-byte ints and do null value substitution. */
    /*  Note that the calling routine must have allocated the input array big enough */
    /* to be able to do this.  */

    unsigned short *usbuff;
    short *sbuff;
    int flagval, *idata;
    long ii;
    
       /* datatype of input array is unsigned short.  We only support writing this datatype
          to a FITS image with BITPIX = 16 and with BZERO = 0 and BSCALE = 32768.  */

       if (zbitpix != SHORT_IMG || scale != 1.0 || zero != 32768.) {
           ffpmsg("Implicit datatype conversion is not supported when writing to compressed images");
           return(*status = DATA_COMPRESSION_ERR);
       } 

       usbuff = (unsigned short *) tiledata;
       sbuff = (short *) tiledata;
       idata = (int *) tiledata;

       if ((outfptr->Fptr)->compress_type == RICE_1 || (outfptr->Fptr)->compress_type == GZIP_1
        || (outfptr->Fptr)->compress_type == GZIP_2 || (outfptr->Fptr)->compress_type == BZIP2_1) 
       {
           /* don't have to convert to int if using gzip, bzip2, or Rice compression */
           *intlength = 2;

          /* offset the unsigned value by -32768 to a signed short value. */
	  /* It is more efficient to do this by just flipping the most significant of the 16 bits */

           if (nullcheck == 1) {
               /* reset pixels equal to flagval to the FITS null value, prior to compression  */
               flagval = *(unsigned short *) (nullflagval);
               for (ii = tilelen - 1; ii >= 0; ii--) {
	            if (usbuff[ii] == (unsigned short) flagval)
		       sbuff[ii] = (short) nullval;
                    else
		       usbuff[ii] =  (usbuff[ii]) ^ 0x8000;
               }
           } else {
               /* just offset the pixel values by 32768 (by flipping the MSB */
               for (ii = tilelen - 1; ii >= 0; ii--)
		       usbuff[ii] =  (usbuff[ii]) ^ 0x8000;
           }
       } else {
           /* have to convert to int if using HCOMPRESS or PLIO */
           *intlength = 4;

           if (nullcheck == 1) {
               /* offset the pixel values by 32768, and */
               /* reset pixels equal to flagval to nullval */
               flagval = *(unsigned short *) (nullflagval);
               for (ii = tilelen - 1; ii >= 0; ii--) {
	            if (usbuff[ii] == (unsigned short) flagval)
		       idata[ii] = nullval;
                    else
		       idata[ii] = ((int) usbuff[ii]) - 32768;
               }
           } else {  /* just do the data type conversion to int */
               /* for HCOMPRESS we need to simply subtract 32768 */
               /* for PLIO, have to convert usbuff to an I*4 array, in place */
               /* usbuff must have been allocated large enough to do this */

               if ((outfptr->Fptr)->compress_type == HCOMPRESS_1) {
                    fits_ushort_to_int_inplace(usbuff, tilelen, -32768, status);
               } else {
                    fits_ushort_to_int_inplace(usbuff, tilelen, 0, status);
               }
           }
        }

        return(*status);
}
 /*--------------------------------------------------------------------------*/
int imcomp_convert_tile_tint(
    fitsfile *outfptr,
    void *tiledata, 
    long tilelen,
    int nullcheck,
    void *nullflagval,
    int nullval,
    int zbitpix,
    double scale,
    double zero,
    int *intlength,
    int *status)
{
    /*  Prepare the input tile array of pixels for compression. */
    /*  Convert input integer tile array in place to 4 or 8-byte ints for compression, */
    /*  If needed, do null value substitution. */
   
    int flagval, *idata;
    long ii;
    
 
        /* datatype of input array is int.  We only support writing this datatype
           to a FITS image with BITPIX = 32 and with BZERO = 0 and BSCALE = 1.  */

       if (zbitpix != LONG_IMG || scale != 1.0 || zero != 0.) {
           ffpmsg("Implicit datatype conversion is not supported when writing to compressed images");
           return(*status = DATA_COMPRESSION_ERR);
       } 

       idata = (int *) tiledata;
       *intlength = 4;

       if (nullcheck == 1) {
               /* no datatype conversion is required for any of the compression algorithms,
	         except possibly for HCOMPRESS (to I*8), which is handled later.
		 Just reset pixels equal to flagval to the FITS null value */
               flagval = *(int *) (nullflagval);
               if (flagval != nullval) {
                  for (ii = tilelen - 1; ii >= 0; ii--) {
	            if (idata[ii] == flagval)
		       idata[ii] = nullval;
                  }
               }
       }

       return(*status);
}
 /*--------------------------------------------------------------------------*/
int imcomp_convert_tile_tuint(
    fitsfile *outfptr,
    void *tiledata, 
    long tilelen,
    int nullcheck,
    void *nullflagval,
    int nullval,
    int zbitpix,
    double scale,
    double zero,
    int *intlength,
    int *status)
{
    /*  Prepare the input tile array of pixels for compression. */
    /*  Convert input unsigned integer tile array in place to 4 or 8-byte ints for compression, */
    /*  If needed, do null value substitution. */


    int *idata;
    unsigned int *uintbuff, uintflagval;
    long ii;
 
       /* datatype of input array is unsigned int.  We only support writing this datatype
          to a FITS image with BITPIX = 32 and with BZERO = 0 and BSCALE = 2147483648.  */

       if (zbitpix != LONG_IMG || scale != 1.0 || zero != 2147483648.) {
           ffpmsg("Implicit datatype conversion is not supported when writing to compressed images");
           return(*status = DATA_COMPRESSION_ERR);
       } 

       *intlength = 4;
       idata = (int *) tiledata;
       uintbuff = (unsigned int *) tiledata;

       /* offset the unsigned value by -2147483648 to a signed int value. */
       /* It is more efficient to do this by just flipping the most significant of the 32 bits */

       if (nullcheck == 1) {
               /* reset pixels equal to flagval to nullval and */
               /* offset the other pixel values (by flipping the MSB) */
               uintflagval = *(unsigned int *) (nullflagval);
               for (ii = tilelen - 1; ii >= 0; ii--) {
	            if (uintbuff[ii] == uintflagval)
		       idata[ii] = nullval;
                    else
		       uintbuff[ii] = (uintbuff[ii]) ^ 0x80000000;
               }
       } else {
               /* just offset the pixel values (by flipping the MSB) */
               for (ii = tilelen - 1; ii >= 0; ii--)
		       uintbuff[ii] = (uintbuff[ii]) ^ 0x80000000;
       }

       return(*status);
}
 /*--------------------------------------------------------------------------*/
int imcomp_convert_tile_tbyte(
    fitsfile *outfptr,
    void *tiledata, 
    long tilelen,
    int nullcheck,
    void *nullflagval,
    int nullval,
    int zbitpix,
    double scale,
    double zero,
    int *intlength,
    int *status)
{
    /*  Prepare the input tile array of pixels for compression. */
    /*  Convert input unsigned integer*1 tile array in place to 4 or 8-byte ints for compression, */
    /*  If needed, convert 4 or 8-byte ints and do null value substitution. */
    /*  Note that the calling routine must have allocated the input array big enough */
    /* to be able to do this.  */

    int flagval, *idata;
    long ii;
    unsigned char *usbbuff;
        
       /* datatype of input array is unsigned byte.  We only support writing this datatype
          to a FITS image with BITPIX = 8 and with BZERO = 0 and BSCALE = 1.  */

       if (zbitpix != BYTE_IMG || scale != 1.0 || zero != 0.) {
           ffpmsg("Implicit datatype conversion is not supported when writing to compressed images");
           return(*status = DATA_COMPRESSION_ERR);
       } 

       idata = (int *) tiledata;
       usbbuff = (unsigned char *) tiledata;

       if ( (outfptr->Fptr)->compress_type == RICE_1 || (outfptr->Fptr)->compress_type == GZIP_1
         || (outfptr->Fptr)->compress_type == GZIP_2 || (outfptr->Fptr)->compress_type == BZIP2_1 ) 
       {
           /* don't have to convert to int if using gzip, bzip2, or Rice compression */
           *intlength = 1;
             
           if (nullcheck == 1) {
               /* reset pixels equal to flagval to the FITS null value, prior to compression */
               flagval = *(unsigned char *) (nullflagval);
               if (flagval != nullval) {
                  for (ii = tilelen - 1; ii >= 0; ii--) {
	            if (usbbuff[ii] == (unsigned char) flagval)
		       usbbuff[ii] = (unsigned char) nullval;
                    }
               }
           }
       } else {
           /* have to convert to int if using HCOMPRESS or PLIO */
           *intlength = 4;

           if (nullcheck == 1) {
               /* reset pixels equal to flagval to the FITS null value, prior to compression */
               flagval = *(unsigned char *) (nullflagval);
               for (ii = tilelen - 1; ii >= 0; ii--) {
	            if (usbbuff[ii] == (unsigned char) flagval)
		       idata[ii] = nullval;
                    else
                       idata[ii] = (int) usbbuff[ii];
               }
           } else {  /* just do the data type conversion to int */
                 /* have to convert usbbuff to an I*4 array, in place */
                 /* usbbuff must have been allocated large enough to do this */
                 fits_ubyte_to_int_inplace(usbbuff, tilelen, status);
           }
       }

       return(*status);
}
 /*--------------------------------------------------------------------------*/
int imcomp_convert_tile_tsbyte(
    fitsfile *outfptr,
    void *tiledata, 
    long tilelen,
    int nullcheck,
    void *nullflagval,
    int nullval,
    int zbitpix,
    double scale,
    double zero,
    int *intlength,
    int *status)
{
    /*  Prepare the input tile array of pixels for compression. */
    /*  Convert input integer*1 tile array in place to 4 or 8-byte ints for compression, */
    /*  If needed, convert 4 or 8-byte ints and do null value substitution. */
    /*  Note that the calling routine must have allocated the input array big enough */
    /* to be able to do this.  */

    int flagval, *idata;
    long ii;
    signed char *sbbuff;

       /* datatype of input array is signed byte.  We only support writing this datatype
          to a FITS image with BITPIX = 8 and with BZERO = 0 and BSCALE = -128.  */

       if (zbitpix != BYTE_IMG|| scale != 1.0 || zero != -128.) {
           ffpmsg("Implicit datatype conversion is not supported when writing to compressed images");
           return(*status = DATA_COMPRESSION_ERR);
       }

       idata = (int *) tiledata;
       sbbuff = (signed char *) tiledata;

       if ( (outfptr->Fptr)->compress_type == RICE_1 || (outfptr->Fptr)->compress_type == GZIP_1
         || (outfptr->Fptr)->compress_type == GZIP_2 || (outfptr->Fptr)->compress_type == BZIP2_1 ) 
       {
           /* don't have to convert to int if using gzip, bzip2 or Rice compression */
           *intlength = 1;
             
           if (nullcheck == 1) {
               /* reset pixels equal to flagval to the FITS null value, prior to compression */
               /* offset the other pixel values (by flipping the MSB) */

               flagval = *(signed char *) (nullflagval);
               for (ii = tilelen - 1; ii >= 0; ii--) {
	            if (sbbuff[ii] == (signed char) flagval)
		       sbbuff[ii] = (signed char) nullval;
                    else
		       sbbuff[ii] = (sbbuff[ii]) ^ 0x80;               }
           } else {  /* just offset the pixel values (by flipping the MSB) */
               for (ii = tilelen - 1; ii >= 0; ii--) 
		       sbbuff[ii] = (sbbuff[ii]) ^ 0x80;
           }

       } else {
           /* have to convert to int if using HCOMPRESS or PLIO */
           *intlength = 4;

           if (nullcheck == 1) {
               /* reset pixels equal to flagval to the FITS null value, prior to compression */
               flagval = *(signed char *) (nullflagval);
               for (ii = tilelen - 1; ii >= 0; ii--) {
	            if (sbbuff[ii] == (signed char) flagval)
		       idata[ii] = nullval;
                    else
                       idata[ii] = ((int) sbbuff[ii]) + 128;
               }
           } else {  /* just do the data type conversion to int */
                 /* have to convert sbbuff to an I*4 array, in place */
                 /* sbbuff must have been allocated large enough to do this */
                 fits_sbyte_to_int_inplace(sbbuff, tilelen, status);
           }
       }
 
       return(*status);
}
 /*--------------------------------------------------------------------------*/
int imcomp_convert_tile_tfloat(
    fitsfile *outfptr,
    long row,
    void *tiledata, 
    long tilelen,
    long tilenx,
    long tileny,
    int nullcheck,
    void *nullflagval,
    int nullval,
    int zbitpix,
    double scale,
    double zero,
    int *intlength,
    int *flag,
    double *bscale,
    double *bzero,
    int *status)
{
    /*  Prepare the input tile array of pixels for compression. */
    /*  Convert input float tile array in place to 4 or 8-byte ints for compression, */
    /*  If needed, convert 4 or 8-byte ints and do null value substitution. */
    /*  Note that the calling routine must have allocated the input array big enough */
    /* to be able to do this.  */

    int *idata;
    long irow, ii;
    float floatnull;
    unsigned char *usbbuff;
    unsigned long dithersum;
    int iminval = 0, imaxval = 0;  /* min and max quantized integers */

        /* datatype of input array is double.  We only support writing this datatype
           to a FITS image with BITPIX = -64 or -32, except we also support the special case where
	   BITPIX = 32 and BZERO = 0 and BSCALE = 1.  */

       if ((zbitpix != LONG_IMG && zbitpix != DOUBLE_IMG && zbitpix != FLOAT_IMG) || scale != 1.0 || zero != 0.) {
           ffpmsg("Implicit datatype conversion is not supported when writing to compressed images");
           return(*status = DATA_COMPRESSION_ERR);
       } 

           *intlength = 4;
           idata = (int *) tiledata;

          /* if the tile-compressed table contains zscale and zzero columns */
          /* then scale and quantize the input floating point data.    */

          if ((outfptr->Fptr)->cn_zscale > 0) {
	    /* quantize the float values into integers */

            if (nullcheck == 1)
	      floatnull = *(float *) (nullflagval);
	    else
	      floatnull = FLOATNULLVALUE;  /* NaNs are represented by this, by default */

            if ((outfptr->Fptr)->quantize_method == SUBTRACTIVE_DITHER_1  ||
	        (outfptr->Fptr)->quantize_method == SUBTRACTIVE_DITHER_2) {
	      
	          /* see if the dithering offset value needs to be initialized */                  
	          if ((outfptr->Fptr)->request_dither_seed == 0 && (outfptr->Fptr)->dither_seed == 0) {

		     /* This means randomly choose the dithering offset based on the system time. */
		     /* The offset will have a value between 1 and 10000, inclusive. */
		     /* The time function returns an integer value that is incremented each second. */
		     /* The clock function returns the elapsed CPU time, in integer CLOCKS_PER_SEC units. */
		     /* The CPU time returned by clock is typically (on linux PC) only good to 0.01 sec */
		     /* Summing the 2 quantities may help avoid cases where 2 executions of the program */
		     /* (perhaps in a multithreaded environoment) end up with exactly the same dither seed */
		     /* value.  The sum is incremented by the current HDU number in the file to provide */
		     /* further randomization.  This randomization is desireable if multiple compressed */
		     /* images will be summed (or differenced). In such cases, the benefits of dithering */
		     /* may be lost if all the images use exactly the same sequence of random numbers when */
		     /* calculating the dithering offsets. */	     
		     
		     (outfptr->Fptr)->dither_seed = 
		       (( (int)time(NULL) + ( (int) clock() / (int) (CLOCKS_PER_SEC / 100)) + (outfptr->Fptr)->curhdu) % 10000) + 1;
		     
                     /* update the header keyword with this new value */
		     fits_update_key(outfptr, TINT, "ZDITHER0", &((outfptr->Fptr)->dither_seed), 
	                        NULL, status);

	          } else if ((outfptr->Fptr)->request_dither_seed < 0 && (outfptr->Fptr)->dither_seed < 0) {

		     /* this means randomly choose the dithering offset based on some hash function */
		     /* of the first input tile of data to be quantized and compressed.  This ensures that */
                     /* the same offset value is used for a given image every time it is compressed. */

		     usbbuff = (unsigned char *) tiledata;
		     dithersum = 0;
		     for (ii = 0; ii < 4 * tilelen; ii++) {
		         dithersum += usbbuff[ii];  /* doesn't matter if there is an integer overflow */
	             }
		     (outfptr->Fptr)->dither_seed = ((int) (dithersum % 10000)) + 1;
		
                     /* update the header keyword with this new value */
		     fits_update_key(outfptr, TINT, "ZDITHER0", &((outfptr->Fptr)->dither_seed), 
	                        NULL, status);
		  }

                  /* subtract 1 to convert from 1-based to 0-based element number */
	          irow = row + (outfptr->Fptr)->dither_seed - 1; /* dither the quantized values */

	      } else if ((outfptr->Fptr)->quantize_method == -1) {
	          irow = 0;  /* do not dither the quantized values */
              } else {
                  ffpmsg("Unknown dithering method.");
                  ffpmsg("May need to install a newer version of CFITSIO.");
                  return(*status = DATA_COMPRESSION_ERR);
              }

              *flag = fits_quantize_float (irow, (float *) tiledata, tilenx, tileny,
                   nullcheck, floatnull, (outfptr->Fptr)->quantize_level, 
		   (outfptr->Fptr)->quantize_method, idata, bscale, bzero, &iminval, &imaxval);

              if (*flag > 1)
		   return(*status = *flag);
          }
          else if ((outfptr->Fptr)->quantize_level != NO_QUANTIZE)
	  {
	    /* if floating point pixels are not being losslessly compressed, then */
	    /* input float data is implicitly converted (truncated) to integers */
            if ((scale != 1. || zero != 0.))  /* must scale the values */
	       imcomp_nullscalefloats((float *) tiledata, tilelen, idata, scale, zero,
	           nullcheck, *(float *) (nullflagval), nullval, status);
             else
	       imcomp_nullfloats((float *) tiledata, tilelen, idata,
	           nullcheck, *(float *) (nullflagval), nullval,  status);
          }
          else if ((outfptr->Fptr)->quantize_level == NO_QUANTIZE)
	  {
	      /* just convert null values to NaNs in place, if necessary, then do lossless gzip compression */
		if (nullcheck == 1) {
	            imcomp_float2nan((float *) tiledata, tilelen, (int *) tiledata,
	                *(float *) (nullflagval), status);
		}
          }

          return(*status);
}
 /*--------------------------------------------------------------------------*/
int imcomp_convert_tile_tdouble(
    fitsfile *outfptr,
    long row,
    void *tiledata, 
    long tilelen,
    long tilenx,
    long tileny,
    int nullcheck,
    void *nullflagval,
    int nullval,
    int zbitpix,
    double scale,
    double zero,
    int *intlength,
    int *flag,
    double *bscale,
    double *bzero,
    int *status)
{
    /*  Prepare the input tile array of pixels for compression. */
    /*  Convert input double tile array in place to 4-byte ints for compression, */
    /*  If needed, convert 4 or 8-byte ints and do null value substitution. */
    /*  Note that the calling routine must have allocated the input array big enough */
    /* to be able to do this.  */

    int *idata;
    long irow, ii;
    double doublenull;
    unsigned char *usbbuff;
    unsigned long dithersum;
    int iminval = 0, imaxval = 0;  /* min and max quantized integers */

        /* datatype of input array is double.  We only support writing this datatype
           to a FITS image with BITPIX = -64 or -32, except we also support the special case where
	   BITPIX = 32 and BZERO = 0 and BSCALE = 1.  */

       if ((zbitpix != LONG_IMG && zbitpix != DOUBLE_IMG && zbitpix != FLOAT_IMG) || scale != 1.0 || zero != 0.) {
           ffpmsg("Implicit datatype conversion is not supported when writing to compressed images");
           return(*status = DATA_COMPRESSION_ERR);
       } 

           *intlength = 4;
           idata = (int *) tiledata;

          /* if the tile-compressed table contains zscale and zzero columns */
          /* then scale and quantize the input floating point data.    */
          /* Otherwise, just truncate the floats to integers.          */

          if ((outfptr->Fptr)->cn_zscale > 0)
          {
            if (nullcheck == 1)
	      doublenull = *(double *) (nullflagval);
	    else
	      doublenull = DOUBLENULLVALUE;

            /* quantize the double values into integers */
              if ((outfptr->Fptr)->quantize_method == SUBTRACTIVE_DITHER_1 ||
	          (outfptr->Fptr)->quantize_method == SUBTRACTIVE_DITHER_2) {

	          /* see if the dithering offset value needs to be initialized (see above) */                  
	          if ((outfptr->Fptr)->request_dither_seed == 0 && (outfptr->Fptr)->dither_seed == 0) {

		     (outfptr->Fptr)->dither_seed = 
		       (( (int)time(NULL) + ( (int) clock() / (int) (CLOCKS_PER_SEC / 100)) + (outfptr->Fptr)->curhdu) % 10000) + 1;
		     
                     /* update the header keyword with this new value */
		     fits_update_key(outfptr, TINT, "ZDITHER0", &((outfptr->Fptr)->dither_seed), 
	                        NULL, status);

	          } else if ((outfptr->Fptr)->request_dither_seed < 0 && (outfptr->Fptr)->dither_seed < 0) {

		     usbbuff = (unsigned char *) tiledata;
		     dithersum = 0;
		     for (ii = 0; ii < 8 * tilelen; ii++) {
		         dithersum += usbbuff[ii];
	             }
		     (outfptr->Fptr)->dither_seed = ((int) (dithersum % 10000)) + 1;
		
                     /* update the header keyword with this new value */
		     fits_update_key(outfptr, TINT, "ZDITHER0", &((outfptr->Fptr)->dither_seed), 
	                        NULL, status);
		  }

	          irow = row + (outfptr->Fptr)->dither_seed - 1; /* dither the quantized values */

	      } else if ((outfptr->Fptr)->quantize_method == -1) {
	          irow = 0;  /* do not dither the quantized values */
              } else {
                  ffpmsg("Unknown subtractive dithering method.");
                  ffpmsg("May need to install a newer version of CFITSIO.");
                  return(*status = DATA_COMPRESSION_ERR);
              }

            *flag = fits_quantize_double (irow, (double *) tiledata, tilenx, tileny,
               nullcheck, doublenull, (outfptr->Fptr)->quantize_level, 
	       (outfptr->Fptr)->quantize_method, idata,
               bscale, bzero, &iminval, &imaxval);

            if (*flag > 1)
		return(*status = *flag);
          }
          else if ((outfptr->Fptr)->quantize_level != NO_QUANTIZE)
	  {
	    /* if floating point pixels are not being losslessly compressed, then */
	    /* input float data is implicitly converted (truncated) to integers */
             if ((scale != 1. || zero != 0.))  /* must scale the values */
	       imcomp_nullscaledoubles((double *) tiledata, tilelen, idata, scale, zero,
	           nullcheck, *(double *) (nullflagval), nullval, status);
             else
	       imcomp_nulldoubles((double *) tiledata, tilelen, idata,
	           nullcheck, *(double *) (nullflagval), nullval,  status);
          }
          else if ((outfptr->Fptr)->quantize_level == NO_QUANTIZE)
	  {
	      /* just convert null values to NaNs in place, if necessary, then do lossless gzip compression */
		if (nullcheck == 1) {
	            imcomp_double2nan((double *) tiledata, tilelen, (LONGLONG *) tiledata,
	                *(double *) (nullflagval), status);
		}
          }
 
          return(*status);
}
/*---------------------------------------------------------------------------*/
int imcomp_nullscale(
     int *idata, 
     long tilelen,
     int nullflagval,
     int nullval,
     double scale,
     double zero,
     int *status)
/*
   do null value substitution AND scaling of the integer array.
   If array value = nullflagval, then set the value to nullval.
   Otherwise, inverse scale the integer value.
*/
{
    long ii;
    double dvalue;
    
    for (ii=0; ii < tilelen; ii++)
    {
        if (idata[ii] == nullflagval)
	    idata[ii] = nullval;
	else 
	{
            dvalue = (idata[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    idata[ii] = (int) (dvalue + .5);
                else
                    idata[ii] = (int) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*---------------------------------------------------------------------------*/
int imcomp_nullvalues(
     int *idata, 
     long tilelen,
     int nullflagval,
     int nullval,
     int *status)
/*
   do null value substitution.
   If array value = nullflagval, then set the value to nullval.
*/
{
    long ii;
    
    for (ii=0; ii < tilelen; ii++)
    {
        if (idata[ii] == nullflagval)
	    idata[ii] = nullval;
    }
    return(*status);
}
/*---------------------------------------------------------------------------*/
int imcomp_scalevalues(
     int *idata, 
     long tilelen,
     double scale,
     double zero,
     int *status)
/*
   do inverse scaling the integer values.
*/
{
    long ii;
    double dvalue;
    
    for (ii=0; ii < tilelen; ii++)
    {
            dvalue = (idata[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    idata[ii] = (int) (dvalue + .5);
                else
                    idata[ii] = (int) (dvalue - .5);
            }
    }
    return(*status);
}
/*---------------------------------------------------------------------------*/
int imcomp_nullscalei2(
     short *idata, 
     long tilelen,
     short nullflagval,
     short nullval,
     double scale,
     double zero,
     int *status)
/*
   do null value substitution AND scaling of the integer array.
   If array value = nullflagval, then set the value to nullval.
   Otherwise, inverse scale the integer value.
*/
{
    long ii;
    double dvalue;
    
    for (ii=0; ii < tilelen; ii++)
    {
        if (idata[ii] == nullflagval)
	    idata[ii] = nullval;
	else 
	{
            dvalue = (idata[ii] - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    idata[ii] = (int) (dvalue + .5);
                else
                    idata[ii] = (int) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*---------------------------------------------------------------------------*/
int imcomp_nullvaluesi2(
     short *idata, 
     long tilelen,
     short nullflagval,
     short nullval,
     int *status)
/*
   do null value substitution.
   If array value = nullflagval, then set the value to nullval.
*/
{
    long ii;
    
    for (ii=0; ii < tilelen; ii++)
    {
        if (idata[ii] == nullflagval)
	    idata[ii] = nullval;
    }
    return(*status);
}
/*---------------------------------------------------------------------------*/
int imcomp_scalevaluesi2(
     short *idata, 
     long tilelen,
     double scale,
     double zero,
     int *status)
/*
   do inverse scaling the integer values.
*/
{
    long ii;
    double dvalue;
    
    for (ii=0; ii < tilelen; ii++)
    {
            dvalue = (idata[ii] - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    idata[ii] = (int) (dvalue + .5);
                else
                    idata[ii] = (int) (dvalue - .5);
            }
    }
    return(*status);
}
/*---------------------------------------------------------------------------*/
int imcomp_nullfloats(
     float *fdata,
     long tilelen,
     int *idata, 
     int nullcheck,
     float nullflagval,
     int nullval,
     int *status)
/*
   do null value substitution  of the float array.
   If array value = nullflagval, then set the output value to FLOATNULLVALUE.
*/
{
    long ii;
    double dvalue;
    
    if (nullcheck == 1) /* must check for null values */
    {
      for (ii=0; ii < tilelen; ii++)
      {
        if (fdata[ii] == nullflagval)
	    idata[ii] = nullval;
	else 
	{
            dvalue = fdata[ii];

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    idata[ii] = (int) (dvalue + .5);
                else
                    idata[ii] = (int) (dvalue - .5);
            }
        }
      }
    }
    else  /* don't have to worry about null values */
    {
      for (ii=0; ii < tilelen; ii++)
      {
            dvalue = fdata[ii];

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    idata[ii] = (int) (dvalue + .5);
                else
                    idata[ii] = (int) (dvalue - .5);
            }
      }
    }
    return(*status);
}
/*---------------------------------------------------------------------------*/
int imcomp_nullscalefloats(
     float *fdata,
     long tilelen,
     int *idata, 
     double scale,
     double zero,
     int nullcheck,
     float nullflagval,
     int nullval,
     int *status)
/*
   do null value substitution  of the float array.
   If array value = nullflagval, then set the output value to FLOATNULLVALUE.
   Otherwise, inverse scale the integer value.
*/
{
    long ii;
    double dvalue;
    
    if (nullcheck == 1) /* must check for null values */
    {
      for (ii=0; ii < tilelen; ii++)
      {
        if (fdata[ii] == nullflagval)
	    idata[ii] = nullval;
	else 
	{
            dvalue = (fdata[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0.)
                    idata[ii] = (int) (dvalue + .5);
                else
                    idata[ii] = (int) (dvalue - .5);
            }
        }
      }
    }
    else  /* don't have to worry about null values */
    {
      for (ii=0; ii < tilelen; ii++)
      {
            dvalue = (fdata[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0.)
                    idata[ii] = (int) (dvalue + .5);
                else
                    idata[ii] = (int) (dvalue - .5);
            }
      }
    }
    return(*status);
}
/*---------------------------------------------------------------------------*/
int imcomp_nulldoubles(
     double *fdata,
     long tilelen,
     int *idata, 
     int nullcheck,
     double nullflagval,
     int nullval,
     int *status)
/*
   do null value substitution  of the float array.
   If array value = nullflagval, then set the output value to FLOATNULLVALUE.
   Otherwise, inverse scale the integer value.
*/
{
    long ii;
    double dvalue;
    
    if (nullcheck == 1) /* must check for null values */
    {
      for (ii=0; ii < tilelen; ii++)
      {
        if (fdata[ii] == nullflagval)
	    idata[ii] = nullval;
	else 
	{
            dvalue = fdata[ii];

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0.)
                    idata[ii] = (int) (dvalue + .5);
                else
                    idata[ii] = (int) (dvalue - .5);
            }
        }
      }
    }
    else  /* don't have to worry about null values */
    {
      for (ii=0; ii < tilelen; ii++)
      {
            dvalue = fdata[ii];

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0.)
                    idata[ii] = (int) (dvalue + .5);
                else
                    idata[ii] = (int) (dvalue - .5);
            }
      }
    }
    return(*status);
}
/*---------------------------------------------------------------------------*/
int imcomp_nullscaledoubles(
     double *fdata,
     long tilelen,
     int *idata, 
     double scale,
     double zero,
     int nullcheck,
     double nullflagval,
     int nullval,
     int *status)
/*
   do null value substitution  of the float array.
   If array value = nullflagval, then set the output value to FLOATNULLVALUE.
   Otherwise, inverse scale the integer value.
*/
{
    long ii;
    double dvalue;
    
    if (nullcheck == 1) /* must check for null values */
    {
      for (ii=0; ii < tilelen; ii++)
      {
        if (fdata[ii] == nullflagval)
	    idata[ii] = nullval;
	else 
	{
            dvalue = (fdata[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0.)
                    idata[ii] = (int) (dvalue + .5);
                else
                    idata[ii] = (int) (dvalue - .5);
            }
        }
      }
    }
    else  /* don't have to worry about null values */
    {
      for (ii=0; ii < tilelen; ii++)
      {
            dvalue = (fdata[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                idata[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0.)
                    idata[ii] = (int) (dvalue + .5);
                else
                    idata[ii] = (int) (dvalue - .5);
            }
      }
    }
    return(*status);
}
/*---------------------------------------------------------------------------*/
int fits_write_compressed_img(fitsfile *fptr,   /* I - FITS file pointer     */
            int  datatype,   /* I - datatype of the array to be written      */
            long  *infpixel, /* I - 'bottom left corner' of the subsection   */
            long  *inlpixel, /* I - 'top right corner' of the subsection     */
            int  nullcheck,  /* I - 0 for no null checking                   */
                             /*     1: pixels that are = nullval will be     */
                             /*     written with the FITS null pixel value   */
                             /*     (floating point arrays only)             */
            void *array,     /* I - array of values to be written            */
            void *nullval,   /* I - undefined pixel value                    */
            int  *status)    /* IO - error status                            */
/*
   Write a section of a compressed image.
*/
{
    int  tiledim[MAX_COMPRESS_DIM];
    long naxis[MAX_COMPRESS_DIM];
    long tilesize[MAX_COMPRESS_DIM], thistilesize[MAX_COMPRESS_DIM];
    long ftile[MAX_COMPRESS_DIM], ltile[MAX_COMPRESS_DIM];
    long tfpixel[MAX_COMPRESS_DIM], tlpixel[MAX_COMPRESS_DIM];
    long rowdim[MAX_COMPRESS_DIM], offset[MAX_COMPRESS_DIM],ntemp;
    long fpixel[MAX_COMPRESS_DIM], lpixel[MAX_COMPRESS_DIM];
    long i5, i4, i3, i2, i1, i0, irow, trowsize, ntrows;
    int ii, ndim, pixlen, tilenul;
    int  tstatus, buffpixsiz;
    void *buffer;
    char *bnullarray = 0, card[FLEN_CARD];

    if (*status > 0) 
        return(*status);

    if (!fits_is_compressed_image(fptr, status) )
    {
        ffpmsg("CHDU is not a compressed image (fits_write_compressed_img)");
        return(*status = DATA_COMPRESSION_ERR);
    }

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    /* rescan header if data structure is undefined */
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
        if ( ffrdef(fptr, status) > 0)               
            return(*status);


    /* ===================================================================== */


    if (datatype == TSHORT || datatype == TUSHORT)
    {
       pixlen = sizeof(short);
    }
    else if (datatype == TINT || datatype == TUINT)
    {
       pixlen = sizeof(int);
    }
    else if (datatype == TBYTE || datatype == TSBYTE)
    {
       pixlen = 1;
    }
    else if (datatype == TLONG || datatype == TULONG)
    {
       pixlen = sizeof(long);
    }
    else if (datatype == TFLOAT)
    {
       pixlen = sizeof(float);
    }
    else if (datatype == TDOUBLE)
    {
       pixlen = sizeof(double);
    }
    else
    {
        ffpmsg("unsupported datatype for compressing image");
        return(*status = BAD_DATATYPE);
    }

    /* ===================================================================== */

    /* allocate scratch space for processing one tile of the image */
    buffpixsiz = pixlen;  /* this is the minimum pixel size */
    
    if ( (fptr->Fptr)->compress_type == HCOMPRESS_1) { /* need 4 or 8 bytes per pixel */
        if ((fptr->Fptr)->zbitpix == BYTE_IMG ||
	    (fptr->Fptr)->zbitpix == SHORT_IMG )
                buffpixsiz = maxvalue(buffpixsiz, 4);
        else
	        buffpixsiz = 8;
    }
    else if ( (fptr->Fptr)->compress_type == PLIO_1) { /* need 4 bytes per pixel */
                buffpixsiz = maxvalue(buffpixsiz, 4);
    }
    else if ( (fptr->Fptr)->compress_type == RICE_1  ||
              (fptr->Fptr)->compress_type == GZIP_1 ||
              (fptr->Fptr)->compress_type == GZIP_2 ||
              (fptr->Fptr)->compress_type == BZIP2_1) {  /* need 1, 2, or 4 bytes per pixel */
        if ((fptr->Fptr)->zbitpix == BYTE_IMG)
            buffpixsiz = maxvalue(buffpixsiz, 1);
        else if ((fptr->Fptr)->zbitpix == SHORT_IMG)
            buffpixsiz = maxvalue(buffpixsiz, 2);
        else 
            buffpixsiz = maxvalue(buffpixsiz, 4);
    }
    else
    {
        ffpmsg("unsupported image compression algorithm");
        return(*status = BAD_DATATYPE);
    }
    
    /* cast to double to force alignment on 8-byte addresses */
    buffer = (double *) calloc ((fptr->Fptr)->maxtilelen, buffpixsiz);

    if (buffer == NULL)
    {
	    ffpmsg("Out of memory (fits_write_compress_img)");
	    return (*status = MEMORY_ALLOCATION);
    }

    /* ===================================================================== */

    /* initialize all the arrays */
    for (ii = 0; ii < MAX_COMPRESS_DIM; ii++)
    {
        naxis[ii] = 1;
        tiledim[ii] = 1;
        tilesize[ii] = 1;
        ftile[ii] = 1;
        ltile[ii] = 1;
        rowdim[ii] = 1;
    }

    ndim = (fptr->Fptr)->zndim;
    ntemp = 1;
    for (ii = 0; ii < ndim; ii++)
    {
        fpixel[ii] = infpixel[ii];
        lpixel[ii] = inlpixel[ii];

        /* calc number of tiles in each dimension, and tile containing */
        /* the first and last pixel we want to read in each dimension  */
        naxis[ii] = (fptr->Fptr)->znaxis[ii];
        if (fpixel[ii] < 1)
        {
            free(buffer);
            return(*status = BAD_PIX_NUM);
        }

        tilesize[ii] = (fptr->Fptr)->tilesize[ii];
        tiledim[ii] = (naxis[ii] - 1) / tilesize[ii] + 1;
        ftile[ii]   = (fpixel[ii] - 1)   / tilesize[ii] + 1;
        ltile[ii]   = minvalue((lpixel[ii] - 1) / tilesize[ii] + 1, 
                                tiledim[ii]);
        rowdim[ii]  = ntemp;  /* total tiles in each dimension */
        ntemp *= tiledim[ii];
    }

    /* support up to 6 dimensions for now */
    /* tfpixel and tlpixel are the first and last image pixels */
    /* along each dimension of the compression tile */
    for (i5 = ftile[5]; i5 <= ltile[5]; i5++)
    {
     tfpixel[5] = (i5 - 1) * tilesize[5] + 1;
     tlpixel[5] = minvalue(tfpixel[5] + tilesize[5] - 1, 
                            naxis[5]);
     thistilesize[5] = tlpixel[5] - tfpixel[5] + 1;
     offset[5] = (i5 - 1) * rowdim[5];
     for (i4 = ftile[4]; i4 <= ltile[4]; i4++)
     {
      tfpixel[4] = (i4 - 1) * tilesize[4] + 1;
      tlpixel[4] = minvalue(tfpixel[4] + tilesize[4] - 1, 
                            naxis[4]);
      thistilesize[4] = thistilesize[5] * (tlpixel[4] - tfpixel[4] + 1);
      offset[4] = (i4 - 1) * rowdim[4] + offset[5];
      for (i3 = ftile[3]; i3 <= ltile[3]; i3++)
      {
        tfpixel[3] = (i3 - 1) * tilesize[3] + 1;
        tlpixel[3] = minvalue(tfpixel[3] + tilesize[3] - 1, 
                              naxis[3]);
        thistilesize[3] = thistilesize[4] * (tlpixel[3] - tfpixel[3] + 1);
        offset[3] = (i3 - 1) * rowdim[3] + offset[4];
        for (i2 = ftile[2]; i2 <= ltile[2]; i2++)
        {
          tfpixel[2] = (i2 - 1) * tilesize[2] + 1;
          tlpixel[2] = minvalue(tfpixel[2] + tilesize[2] - 1, 
                                naxis[2]);
          thistilesize[2] = thistilesize[3] * (tlpixel[2] - tfpixel[2] + 1);
          offset[2] = (i2 - 1) * rowdim[2] + offset[3];
          for (i1 = ftile[1]; i1 <= ltile[1]; i1++)
          {
            tfpixel[1] = (i1 - 1) * tilesize[1] + 1;
            tlpixel[1] = minvalue(tfpixel[1] + tilesize[1] - 1, 
                                  naxis[1]);
            thistilesize[1] = thistilesize[2] * (tlpixel[1] - tfpixel[1] + 1);
            offset[1] = (i1 - 1) * rowdim[1] + offset[2];
            for (i0 = ftile[0]; i0 <= ltile[0]; i0++)
            {
              tfpixel[0] = (i0 - 1) * tilesize[0] + 1;
              tlpixel[0] = minvalue(tfpixel[0] + tilesize[0] - 1, 
                                    naxis[0]);
              thistilesize[0] = thistilesize[1] * (tlpixel[0] - tfpixel[0] + 1);
              /* calculate row of table containing this tile */
              irow = i0 + offset[1];

              /* read and uncompress this row (tile) of the table */
              /* also do type conversion and undefined pixel substitution */
              /* at this point */
              imcomp_decompress_tile(fptr, irow, thistilesize[0],
                    datatype, nullcheck, nullval, buffer, bnullarray, &tilenul,
                     status);

              if (*status == NO_COMPRESSED_TILE)
              {
                   /* tile doesn't exist, so initialize to zero */
                   memset(buffer, 0, pixlen * thistilesize[0]);
                   *status = 0;
              }

              /* copy the intersecting pixels to this tile from the input */
              imcomp_merge_overlap(buffer, pixlen, ndim, tfpixel, tlpixel, 
                     bnullarray, array, fpixel, lpixel, nullcheck, status);
                     
             /* Collapse sizes of higher dimension tiles into 2 dimensional
                equivalents needed by the quantizing algorithms for
                floating point types */
              fits_calc_tile_rows(tlpixel, tfpixel, ndim, &trowsize,
                              &ntrows, status);

              /* compress the tile again, and write it back to the FITS file */
              imcomp_compress_tile (fptr, irow, datatype, buffer, 
                                    thistilesize[0],
				    trowsize,
				    ntrows,
				    nullcheck, nullval, 
				    status);
            }
          }
        }
      }
     }
    }
    free(buffer);
    

    if ((fptr->Fptr)->zbitpix < 0 && nullcheck != 0) { 
/*
     This is a floating point FITS image with possible null values.
     It is too messy to test if any null values are actually written, so 
     just assume so.  We need to make sure that the
     ZBLANK keyword is present in the compressed image header.  If it is not
     there then we need to insert the keyword. 
*/   
        tstatus = 0;
        ffgcrd(fptr, "ZBLANK", card, &tstatus);

	if (tstatus) {   /* have to insert the ZBLANK keyword */
           ffgcrd(fptr, "ZCMPTYPE", card, status);
           ffikyj(fptr, "ZBLANK", COMPRESS_NULL_VALUE, 
                "null value in the compressed integer array", status);
	
           /* set this value into the internal structure; it is used if */
	   /* the program reads back the values from the array */
	 
          (fptr->Fptr)->zblank = COMPRESS_NULL_VALUE;
          (fptr->Fptr)->cn_zblank = -1;  /* flag for a constant ZBLANK */
        }  
    }  
    
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_write_compressed_pixels(fitsfile *fptr, /* I - FITS file pointer   */
            int  datatype,  /* I - datatype of the array to be written      */
            LONGLONG   fpixel,  /* I - 'first pixel to write          */
            LONGLONG   npixel,  /* I - number of pixels to write      */
            int  nullcheck,  /* I - 0 for no null checking                   */
                             /*     1: pixels that are = nullval will be     */
                             /*     written with the FITS null pixel value   */
                             /*     (floating point arrays only)             */
            void *array,      /* I - array of values to write                */
            void *nullval,    /* I - value used to represent undefined pixels*/
            int  *status)     /* IO - error status                           */
/*
   Write a consecutive set of pixels to a compressed image.  This routine
   interpretes the n-dimensional image as a long one-dimensional array. 
   This is actually a rather inconvenient way to write compressed images in
   general, and could be rather inefficient if the requested pixels to be
   written are located in many different image compression tiles.    

   The general strategy used here is to write the requested pixels in blocks
   that correspond to rectangular image sections.  
*/
{
    int naxis, ii, bytesperpixel;
    long naxes[MAX_COMPRESS_DIM], nread;
    LONGLONG tfirst, tlast, last0, last1, dimsize[MAX_COMPRESS_DIM];
    long nplane, firstcoord[MAX_COMPRESS_DIM], lastcoord[MAX_COMPRESS_DIM];
    char *arrayptr;

    if (*status > 0)
        return(*status);

    arrayptr = (char *) array;

    /* get size of array pixels, in bytes */
    bytesperpixel = ffpxsz(datatype);

    for (ii = 0; ii < MAX_COMPRESS_DIM; ii++)
    {
        naxes[ii] = 1;
        firstcoord[ii] = 0;
        lastcoord[ii] = 0;
    }

    /*  determine the dimensions of the image to be written */
    ffgidm(fptr, &naxis, status);
    ffgisz(fptr, MAX_COMPRESS_DIM, naxes, status);

    /* calc the cumulative number of pixels in each successive dimension */
    dimsize[0] = 1;
    for (ii = 1; ii < MAX_COMPRESS_DIM; ii++)
         dimsize[ii] = dimsize[ii - 1] * naxes[ii - 1];

    /*  determine the coordinate of the first and last pixel in the image */
    /*  Use zero based indexes here */
    tfirst = fpixel - 1;
    tlast = tfirst + npixel - 1;
    for (ii = naxis - 1; ii >= 0; ii--)
    {
        firstcoord[ii] = (long) (tfirst / dimsize[ii]);
        lastcoord[ii]  = (long) (tlast / dimsize[ii]);
        tfirst = tfirst - firstcoord[ii] * dimsize[ii];
        tlast = tlast - lastcoord[ii] * dimsize[ii];
    }

    /* to simplify things, treat 1-D, 2-D, and 3-D images as separate cases */

    if (naxis == 1)
    {
        /* Simple: just write the requested range of pixels */

        firstcoord[0] = firstcoord[0] + 1;
        lastcoord[0] = lastcoord[0] + 1;
        fits_write_compressed_img(fptr, datatype, firstcoord, lastcoord,
            nullcheck, array, nullval, status);
        return(*status);
    }
    else if (naxis == 2)
    {
        nplane = 0;  /* write 1st (and only) plane of the image */
        fits_write_compressed_img_plane(fptr, datatype, bytesperpixel,
          nplane, firstcoord, lastcoord, naxes, nullcheck,
          array, nullval, &nread, status);
    }
    else if (naxis == 3)
    {
        /* test for special case: writing an integral number of planes */
        if (firstcoord[0] == 0 && firstcoord[1] == 0 &&
            lastcoord[0] == naxes[0] - 1 && lastcoord[1] == naxes[1] - 1)
        {
            for (ii = 0; ii < MAX_COMPRESS_DIM; ii++)
            {
                /* convert from zero base to 1 base */
                (firstcoord[ii])++;
                (lastcoord[ii])++;
            }

            /* we can write the contiguous block of pixels in one go */
            fits_write_compressed_img(fptr, datatype, firstcoord, lastcoord,
                nullcheck, array, nullval, status);
            return(*status);
        }

        /* save last coordinate in temporary variables */
        last0 = lastcoord[0];
        last1 = lastcoord[1];

        if (firstcoord[2] < lastcoord[2])
        {
            /* we will write up to the last pixel in all but the last plane */
            lastcoord[0] = naxes[0] - 1;
            lastcoord[1] = naxes[1] - 1;
        }

        /* write one plane of the cube at a time, for simplicity */
        for (nplane = firstcoord[2]; nplane <= lastcoord[2]; nplane++)
        {
            if (nplane == lastcoord[2])
            {
                lastcoord[0] = (long) last0;
                lastcoord[1] = (long) last1;
            }

            fits_write_compressed_img_plane(fptr, datatype, bytesperpixel,
              nplane, firstcoord, lastcoord, naxes, nullcheck,
              arrayptr, nullval, &nread, status);

            /* for all subsequent planes, we start with the first pixel */
            firstcoord[0] = 0;
            firstcoord[1] = 0;

            /* increment pointers to next elements to be written */
            arrayptr = arrayptr + nread * bytesperpixel;
        }
    }
    else
    {
        ffpmsg("only 1D, 2D, or 3D images are currently supported");
        return(*status = DATA_COMPRESSION_ERR);
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_write_compressed_img_plane(fitsfile *fptr, /* I - FITS file    */
            int  datatype,  /* I - datatype of the array to be written    */
            int  bytesperpixel, /* I - number of bytes per pixel in array */
            long   nplane,  /* I - which plane of the cube to write      */
            long *firstcoord, /* I coordinate of first pixel to write */
            long *lastcoord,  /* I coordinate of last pixel to write */
            long *naxes,     /* I size of each image dimension */
            int  nullcheck,  /* I - 0 for no null checking                   */
                             /*     1: pixels that are = nullval will be     */
                             /*     written with the FITS null pixel value   */
                             /*     (floating point arrays only)             */
            void *array,      /* I - array of values that are written        */
            void *nullval,    /* I - value for undefined pixels              */
            long *nread,      /* O - total number of pixels written          */
            int  *status)     /* IO - error status                           */

   /*
           in general we have to write the first partial row of the image,
           followed by the middle complete rows, followed by the last
           partial row of the image.  If the first or last rows are complete,
           then write them at the same time as all the middle rows.
    */
{
    /* bottom left coord. and top right coord. */
    long blc[MAX_COMPRESS_DIM], trc[MAX_COMPRESS_DIM]; 
    char *arrayptr;

    *nread = 0;

    arrayptr = (char *) array;

    blc[2] = nplane + 1;
    trc[2] = nplane + 1;

    if (firstcoord[0] != 0)
    { 
            /* have to read a partial first row */
            blc[0] = firstcoord[0] + 1;
            blc[1] = firstcoord[1] + 1;
            trc[1] = blc[1];  
            if (lastcoord[1] == firstcoord[1])
               trc[0] = lastcoord[0] + 1; /* 1st and last pixels in same row */
            else
               trc[0] = naxes[0];  /* read entire rest of the row */

            fits_write_compressed_img(fptr, datatype, blc, trc,
                nullcheck, arrayptr, nullval, status);

            *nread = *nread + trc[0] - blc[0] + 1;

            if (lastcoord[1] == firstcoord[1])
            {
               return(*status);  /* finished */
            }

            /* set starting coord to beginning of next line */
            firstcoord[0] = 0;
            firstcoord[1] += 1;
            arrayptr = arrayptr + (trc[0] - blc[0] + 1) * bytesperpixel;
    }

    /* write contiguous complete rows of the image, if any */
    blc[0] = 1;
    blc[1] = firstcoord[1] + 1;
    trc[0] = naxes[0];

    if (lastcoord[0] + 1 == naxes[0])
    {
            /* can write the last complete row, too */
            trc[1] = lastcoord[1] + 1;
    }
    else
    {
            /* last row is incomplete; have to read it separately */
            trc[1] = lastcoord[1];
    }

    if (trc[1] >= blc[1])  /* must have at least one whole line to read */
    {
        fits_write_compressed_img(fptr, datatype, blc, trc,
                nullcheck, arrayptr, nullval, status);

        *nread = *nread + (trc[1] - blc[1] + 1) * naxes[0];

        if (lastcoord[1] + 1 == trc[1])
               return(*status);  /* finished */

        /* increment pointers for the last partial row */
        arrayptr = arrayptr + (trc[1] - blc[1] + 1) * naxes[0] * bytesperpixel;

     }

    if (trc[1] == lastcoord[1] + 1)
        return(*status);           /* all done */

    /* set starting and ending coord to last line */

    trc[0] = lastcoord[0] + 1;
    trc[1] = lastcoord[1] + 1;
    blc[1] = trc[1];

    fits_write_compressed_img(fptr, datatype, blc, trc,
                nullcheck, arrayptr, nullval, status);

    *nread = *nread + trc[0] - blc[0] + 1;

    return(*status);
}

/* ######################################################################## */
/* ###                 Image Decompression Routines                     ### */
/* ######################################################################## */

/*--------------------------------------------------------------------------*/
int fits_img_decompress (fitsfile *infptr, /* image (bintable) to uncompress */
              fitsfile *outfptr,   /* empty HDU for output uncompressed image */
              int *status)         /* IO - error status               */

/* 
  This routine decompresses the whole image and writes it to the output file.
*/

{
    int ii, datatype = 0;
    int nullcheck, anynul;
    LONGLONG fpixel[MAX_COMPRESS_DIM], lpixel[MAX_COMPRESS_DIM];
    long inc[MAX_COMPRESS_DIM];
    long imgsize;
    float *nulladdr, fnulval;
    double dnulval;

    if (fits_img_decompress_header(infptr, outfptr, status) > 0)
    {
    	return (*status);
    }

    /* force a rescan of the output header keywords, then reset the scaling */
    /* in case the BSCALE and BZERO keywords are present, so that the       */
    /* decompressed values won't be scaled when written to the output image */
    ffrdef(outfptr, status);
    ffpscl(outfptr, 1.0, 0.0, status);
    ffpscl(infptr, 1.0, 0.0, status);

    /* initialize; no null checking is needed for integer images */
    nullcheck = 0;
    nulladdr =  &fnulval;

    /* determine datatype for image */
    if ((infptr->Fptr)->zbitpix == BYTE_IMG)
    {
        datatype = TBYTE;
    }
    else if ((infptr->Fptr)->zbitpix == SHORT_IMG)
    {
        datatype = TSHORT;
    }
    else if ((infptr->Fptr)->zbitpix == LONG_IMG)
    {
        datatype = TINT;
    }
    else if ((infptr->Fptr)->zbitpix == FLOAT_IMG)
    {
        /* In the case of float images we must check for NaNs  */
        nullcheck = 1;
        fnulval = FLOATNULLVALUE;
        nulladdr =  &fnulval;
        datatype = TFLOAT;
    }
    else if ((infptr->Fptr)->zbitpix == DOUBLE_IMG)
    {
        /* In the case of double images we must check for NaNs  */
        nullcheck = 1;
        dnulval = DOUBLENULLVALUE;
        nulladdr = (float *) &dnulval;
        datatype = TDOUBLE;
    }

    /* calculate size of the image (in pixels) */
    imgsize = 1;
    for (ii = 0; ii < (infptr->Fptr)->zndim; ii++)
    {
        imgsize *= (infptr->Fptr)->znaxis[ii];
        fpixel[ii] = 1;              /* Set first and last pixel to */
        lpixel[ii] = (infptr->Fptr)->znaxis[ii]; /* include the entire image. */
        inc[ii] = 1;
    }

    /* uncompress the input image and write to output image, one tile at a time */

    fits_read_write_compressed_img(infptr, datatype, fpixel, lpixel, inc,  
            nullcheck, nulladdr, &anynul, outfptr, status);

    return (*status);
}
/*--------------------------------------------------------------------------*/
int fits_decompress_img (fitsfile *infptr, /* image (bintable) to uncompress */
              fitsfile *outfptr,   /* empty HDU for output uncompressed image */
              int *status)         /* IO - error status               */

/* 
  THIS IS AN OBSOLETE ROUTINE.  USE fits_img_decompress instead!!!
  
  This routine decompresses the whole image and writes it to the output file.
*/

{
    double *data;
    int ii, datatype = 0, byte_per_pix = 0;
    int nullcheck, anynul;
    LONGLONG fpixel[MAX_COMPRESS_DIM], lpixel[MAX_COMPRESS_DIM];
    long inc[MAX_COMPRESS_DIM];
    long imgsize, memsize;
    float *nulladdr, fnulval;
    double dnulval;

    if (*status > 0)
        return(*status);

    if (!fits_is_compressed_image(infptr, status) )
    {
        ffpmsg("CHDU is not a compressed image (fits_decompress_img)");
        return(*status = DATA_DECOMPRESSION_ERR);
    }

    /* create an empty output image with the correct dimensions */
    if (ffcrim(outfptr, (infptr->Fptr)->zbitpix, (infptr->Fptr)->zndim, 
       (infptr->Fptr)->znaxis, status) > 0)
    {
        ffpmsg("error creating output decompressed image HDU");
    	return (*status);
    }
    /* Copy the table header to the image header. */
    if (imcomp_copy_imheader(infptr, outfptr, status) > 0)
    {
        ffpmsg("error copying header of compressed image");
    	return (*status);
    }

    /* force a rescan of the output header keywords, then reset the scaling */
    /* in case the BSCALE and BZERO keywords are present, so that the       */
    /* decompressed values won't be scaled when written to the output image */
    ffrdef(outfptr, status);
    ffpscl(outfptr, 1.0, 0.0, status);
    ffpscl(infptr, 1.0, 0.0, status);

    /* initialize; no null checking is needed for integer images */
    nullcheck = 0;
    nulladdr =  &fnulval;

    /* determine datatype for image */
    if ((infptr->Fptr)->zbitpix == BYTE_IMG)
    {
        datatype = TBYTE;
        byte_per_pix = 1;
    }
    else if ((infptr->Fptr)->zbitpix == SHORT_IMG)
    {
        datatype = TSHORT;
        byte_per_pix = sizeof(short);
    }
    else if ((infptr->Fptr)->zbitpix == LONG_IMG)
    {
        datatype = TINT;
        byte_per_pix = sizeof(int);
    }
    else if ((infptr->Fptr)->zbitpix == FLOAT_IMG)
    {
        /* In the case of float images we must check for NaNs  */
        nullcheck = 1;
        fnulval = FLOATNULLVALUE;
        nulladdr =  &fnulval;
        datatype = TFLOAT;
        byte_per_pix = sizeof(float);
    }
    else if ((infptr->Fptr)->zbitpix == DOUBLE_IMG)
    {
        /* In the case of double images we must check for NaNs  */
        nullcheck = 1;
        dnulval = DOUBLENULLVALUE;
        nulladdr = (float *) &dnulval;
        datatype = TDOUBLE;
        byte_per_pix = sizeof(double);
    }

    /* calculate size of the image (in pixels) */
    imgsize = 1;
    for (ii = 0; ii < (infptr->Fptr)->zndim; ii++)
    {
        imgsize *= (infptr->Fptr)->znaxis[ii];
        fpixel[ii] = 1;              /* Set first and last pixel to */
        lpixel[ii] = (infptr->Fptr)->znaxis[ii]; /* include the entire image. */
        inc[ii] = 1;
    }
    /* Calc equivalent number of double pixels same size as whole the image. */
    /* We use double datatype to force the memory to be aligned properly */
    memsize = ((imgsize * byte_per_pix) - 1) / sizeof(double) + 1;

    /* allocate memory for the image */
    data = (double*) calloc (memsize, sizeof(double));
    if (!data)
    { 
        ffpmsg("Couldn't allocate memory for the uncompressed image");
        return(*status = MEMORY_ALLOCATION);
    }

    /* uncompress the entire image into memory */
    /* This routine should be enhanced sometime to only need enough */
    /* memory to uncompress one tile at a time.  */
    fits_read_compressed_img(infptr, datatype, fpixel, lpixel, inc,  
            nullcheck, nulladdr, data, NULL, &anynul, status);

    /* write the image to the output file */
    if (anynul)
        fits_write_imgnull(outfptr, datatype, 1, imgsize, data, nulladdr, 
                          status);
    else
        fits_write_img(outfptr, datatype, 1, imgsize, data, status);

    free(data);
    return (*status);
}
/*--------------------------------------------------------------------------*/
int fits_img_decompress_header(fitsfile *infptr, /* image (bintable) to uncompress */
              fitsfile *outfptr,   /* empty HDU for output uncompressed image */
              int *status)         /* IO - error status               */

/* 
  This routine reads the header of the input tile compressed image and 
  converts it to that of a standard uncompress FITS image.
*/

{
    int writeprime = 0;
    int hdupos, inhdupos, numkeys;
    int nullprime = 0, copyprime = 0, norec = 0, tstatus;
    char card[FLEN_CARD];
    int ii, naxis, bitpix;
    long naxes[MAX_COMPRESS_DIM];

    if (*status > 0)
        return(*status);
    else if (*status == -1) {
        *status = 0;
	writeprime = 1;
    }

    if (!fits_is_compressed_image(infptr, status) )
    {
        ffpmsg("CHDU is not a compressed image (fits_img_decompress)");
        return(*status = DATA_DECOMPRESSION_ERR);
    }

    /* get information about the state of the output file; does it already */
    /* contain any keywords and HDUs?  */
    fits_get_hdu_num(infptr, &inhdupos);  /* Get the current output HDU position */
    fits_get_hdu_num(outfptr, &hdupos);  /* Get the current output HDU position */
    fits_get_hdrspace(outfptr, &numkeys, 0, status);

    /* Was the input compressed HDU originally the primary array image? */
    tstatus = 0;
    if (!fits_read_card(infptr, "ZSIMPLE", card, &tstatus)) { 
      /* yes, input HDU was a primary array (not an IMAGE extension) */
      /* Now determine if we can uncompress it into the primary array of */
      /* the output file.  This is only possible if the output file */
      /* currently only contains a null primary array, with no addition */
      /* header keywords and with no following extension in the FITS file. */
      
      if (hdupos == 1) {  /* are we positioned at the primary array? */
            if (numkeys == 0) { /* primary HDU is completely empty */
	        nullprime = 1;
            } else {
                fits_get_img_param(outfptr, MAX_COMPRESS_DIM, &bitpix, &naxis, naxes, status);
	
	        if (naxis == 0) { /* is this a null image? */
                   nullprime = 1;

		   if (inhdupos == 2)  /* must be at the first extension */
		      copyprime = 1;
		}
           }
      }
    } 

    if (nullprime) {  
       /* We will delete the existing keywords in the null primary array
          and uncompress the input image into the primary array of the output.
	  Some of these keywords may be added back to the uncompressed image
	  header later.
       */

       for (ii = numkeys; ii > 0; ii--)
          fits_delete_record(outfptr, ii, status);

    } else  {

       /* if the ZTENSION keyword doesn't exist, then we have to 
          write the required keywords manually */
       tstatus = 0;
       if (fits_read_card(infptr, "ZTENSION", card, &tstatus)) {

          /* create an empty output image with the correct dimensions */
          if (ffcrim(outfptr, (infptr->Fptr)->zbitpix, (infptr->Fptr)->zndim, 
             (infptr->Fptr)->znaxis, status) > 0)
          {
             ffpmsg("error creating output decompressed image HDU");
    	     return (*status);
          }

	  norec = 1;  /* the required keywords have already been written */

       } else {  /* the input compressed image does have ZTENSION keyword */
       
          if (writeprime) {  /* convert the image extension to a primary array */
	      /* have to write the required keywords manually */

              /* create an empty output image with the correct dimensions */
              if (ffcrim(outfptr, (infptr->Fptr)->zbitpix, (infptr->Fptr)->zndim, 
                 (infptr->Fptr)->znaxis, status) > 0)
              {
                 ffpmsg("error creating output decompressed image HDU");
    	         return (*status);
              }

	      norec = 1;  /* the required keywords have already been written */

          } else {  /* write the input compressed image to an image extension */

              if (numkeys == 0) {  /* the output file is currently completely empty */
	  
	         /* In this case, the input is a compressed IMAGE extension. */
	         /* Since the uncompressed output file is currently completely empty, */
	         /* we need to write a null primary array before uncompressing the */
                 /* image extension */
	     
                 ffcrim(outfptr, 8, 0, naxes, status); /* naxes is not used */
	     
	         /* now create the empty extension to uncompress into */
                 if (fits_create_hdu(outfptr, status) > 0)
                 {
                      ffpmsg("error creating output decompressed image HDU");
    	              return (*status);
                 }
	  
	      } else {
                  /* just create a new empty extension, then copy all the required */
	          /* keywords into it.  */
                 fits_create_hdu(outfptr, status);
	      }
           }
       }

    }

    if (*status > 0)  {
        ffpmsg("error creating output decompressed image HDU");
    	return (*status);
    }

    /* Copy the table header to the image header. */

    if (imcomp_copy_comp2img(infptr, outfptr, norec, status) > 0)
    {
        ffpmsg("error copying header keywords from compressed image");
    }

    if (copyprime) {  
	/* append any unexpected keywords from the primary array.
	   This includes any keywords except SIMPLE, BITPIX, NAXIS,
	   EXTEND, COMMENT, HISTORY, CHECKSUM, and DATASUM.
	*/

        fits_movabs_hdu(infptr, 1, NULL, status);  /* move to primary array */
	
        /* do this so that any new keywords get written before any blank
	   keywords that may have been appended by imcomp_copy_comp2img  */
        fits_set_hdustruc(outfptr, status);

        if (imcomp_copy_prime2img(infptr, outfptr, status) > 0)
        {
            ffpmsg("error copying primary keywords from compressed file");
        }

        fits_movabs_hdu(infptr, 2, NULL, status); /* move back to where we were */
    }

    return (*status);
}
/*---------------------------------------------------------------------------*/
int fits_read_compressed_img(fitsfile *fptr,   /* I - FITS file pointer      */
            int  datatype,  /* I - datatype of the array to be returned      */
            LONGLONG  *infpixel, /* I - 'bottom left corner' of the subsection    */
            LONGLONG  *inlpixel, /* I - 'top right corner' of the subsection      */
            long  *ininc,    /* I - increment to be applied in each dimension */
            int  nullcheck,  /* I - 0 for no null checking                   */
                              /*     1: set undefined pixels = nullval       */
                              /*     2: set nullarray=1 for undefined pixels */
            void *nullval,    /* I - value for undefined pixels              */
            void *array,      /* O - array of values that are returned       */
            char *nullarray,  /* O - array of flags = 1 if nullcheck = 2     */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
   Read a section of a compressed image;  Note: lpixel may be larger than the 
   size of the uncompressed image.  Only the pixels within the image will be
   returned.
*/
{
    long naxis[MAX_COMPRESS_DIM], tiledim[MAX_COMPRESS_DIM];
    long tilesize[MAX_COMPRESS_DIM], thistilesize[MAX_COMPRESS_DIM];
    long ftile[MAX_COMPRESS_DIM], ltile[MAX_COMPRESS_DIM];
    long tfpixel[MAX_COMPRESS_DIM], tlpixel[MAX_COMPRESS_DIM];
    long rowdim[MAX_COMPRESS_DIM], offset[MAX_COMPRESS_DIM],ntemp;
    long fpixel[MAX_COMPRESS_DIM], lpixel[MAX_COMPRESS_DIM];
    long inc[MAX_COMPRESS_DIM];
    long i5, i4, i3, i2, i1, i0, irow;
    int ii, ndim, pixlen, tilenul;
    void *buffer;
    char *bnullarray = 0;
    double testnullval = 0.;

    if (*status > 0) 
        return(*status);

    if (!fits_is_compressed_image(fptr, status) )
    {
        ffpmsg("CHDU is not a compressed image (fits_read_compressed_img)");
        return(*status = DATA_DECOMPRESSION_ERR);
    }

    /* get temporary space for uncompressing one image tile */
    if (datatype == TSHORT)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (short)); 
       pixlen = sizeof(short);
       if (nullval)
           testnullval = *(short *) nullval;
    }
    else if (datatype == TINT)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (int));
       pixlen = sizeof(int);
       if (nullval)
           testnullval = *(int *) nullval;
    }
    else if (datatype == TLONG)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (long));
       pixlen = sizeof(long);
       if (nullval)
           testnullval = *(long *) nullval;
    }
    else if (datatype == TFLOAT)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (float));
       pixlen = sizeof(float);
       if (nullval)
           testnullval = *(float *) nullval;
    }
    else if (datatype == TDOUBLE)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (double));
       pixlen = sizeof(double);
       if (nullval)
           testnullval = *(double *) nullval;
    }
    else if (datatype == TUSHORT)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (unsigned short));
       pixlen = sizeof(short);
       if (nullval)
           testnullval = *(unsigned short *) nullval;
    }
    else if (datatype == TUINT)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (unsigned int));
       pixlen = sizeof(int);
       if (nullval)
           testnullval = *(unsigned int *) nullval;
    }
    else if (datatype == TULONG)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (unsigned long));
       pixlen = sizeof(long);
       if (nullval)
           testnullval = *(unsigned long *) nullval;
    }
    else if (datatype == TBYTE || datatype == TSBYTE)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (char));
       pixlen = 1;
       if (nullval)
           testnullval = *(unsigned char *) nullval;
    }
    else
    {
        ffpmsg("unsupported datatype for uncompressing image");
        return(*status = BAD_DATATYPE);
    }

    /* If nullcheck ==1 and nullval == 0, then this means that the */
    /* calling routine does not want to check for null pixels in the array */
    if (nullcheck == 1 && testnullval == 0.)
        nullcheck = 0;

    if (buffer == NULL)
    {
	    ffpmsg("Out of memory (fits_read_compress_img)");
	    return (*status = MEMORY_ALLOCATION);
    }
	
    /* allocate memory for a null flag array, if needed */
    if (nullcheck == 2)
    {
        bnullarray = calloc ((fptr->Fptr)->maxtilelen, sizeof (char));

        if (bnullarray == NULL)
        {
	    ffpmsg("Out of memory (fits_read_compress_img)");
            free(buffer);
	    return (*status = MEMORY_ALLOCATION);
        }
    }

    /* initialize all the arrays */
    for (ii = 0; ii < MAX_COMPRESS_DIM; ii++)
    {
        naxis[ii] = 1;
        tiledim[ii] = 1;
        tilesize[ii] = 1;
        ftile[ii] = 1;
        ltile[ii] = 1;
        rowdim[ii] = 1;
    }

    ndim = (fptr->Fptr)->zndim;
    ntemp = 1;
    for (ii = 0; ii < ndim; ii++)
    {
        /* support for mirror-reversed image sections */
        if (infpixel[ii] <= inlpixel[ii])
        {
           fpixel[ii] = (long) infpixel[ii];
           lpixel[ii] = (long) inlpixel[ii];
           inc[ii]    = ininc[ii];
        }
        else
        {
           fpixel[ii] = (long) inlpixel[ii];
           lpixel[ii] = (long) infpixel[ii];
           inc[ii]    = -ininc[ii];
        }

        /* calc number of tiles in each dimension, and tile containing */
        /* the first and last pixel we want to read in each dimension  */
        naxis[ii] = (fptr->Fptr)->znaxis[ii];
        if (fpixel[ii] < 1)
        {
            if (nullcheck == 2)
            {
                free(bnullarray);
            }
            free(buffer);
            return(*status = BAD_PIX_NUM);
        }

        tilesize[ii] = (fptr->Fptr)->tilesize[ii];
        tiledim[ii] = (naxis[ii] - 1) / tilesize[ii] + 1;
        ftile[ii]   = (fpixel[ii] - 1)   / tilesize[ii] + 1;
        ltile[ii]   = minvalue((lpixel[ii] - 1) / tilesize[ii] + 1, 
                                tiledim[ii]);
        rowdim[ii]  = ntemp;  /* total tiles in each dimension */
        ntemp *= tiledim[ii];
    }

    if (anynul)
       *anynul = 0;  /* initialize */

    /* support up to 6 dimensions for now */
    /* tfpixel and tlpixel are the first and last image pixels */
    /* along each dimension of the compression tile */
    for (i5 = ftile[5]; i5 <= ltile[5]; i5++)
    {
     tfpixel[5] = (i5 - 1) * tilesize[5] + 1;
     tlpixel[5] = minvalue(tfpixel[5] + tilesize[5] - 1, 
                            naxis[5]);
     thistilesize[5] = tlpixel[5] - tfpixel[5] + 1;
     offset[5] = (i5 - 1) * rowdim[5];
     for (i4 = ftile[4]; i4 <= ltile[4]; i4++)
     {
      tfpixel[4] = (i4 - 1) * tilesize[4] + 1;
      tlpixel[4] = minvalue(tfpixel[4] + tilesize[4] - 1, 
                            naxis[4]);
      thistilesize[4] = thistilesize[5] * (tlpixel[4] - tfpixel[4] + 1);
      offset[4] = (i4 - 1) * rowdim[4] + offset[5];
      for (i3 = ftile[3]; i3 <= ltile[3]; i3++)
      {
        tfpixel[3] = (i3 - 1) * tilesize[3] + 1;
        tlpixel[3] = minvalue(tfpixel[3] + tilesize[3] - 1, 
                              naxis[3]);
        thistilesize[3] = thistilesize[4] * (tlpixel[3] - tfpixel[3] + 1);
        offset[3] = (i3 - 1) * rowdim[3] + offset[4];
        for (i2 = ftile[2]; i2 <= ltile[2]; i2++)
        {
          tfpixel[2] = (i2 - 1) * tilesize[2] + 1;
          tlpixel[2] = minvalue(tfpixel[2] + tilesize[2] - 1, 
                                naxis[2]);
          thistilesize[2] = thistilesize[3] * (tlpixel[2] - tfpixel[2] + 1);
          offset[2] = (i2 - 1) * rowdim[2] + offset[3];
          for (i1 = ftile[1]; i1 <= ltile[1]; i1++)
          {
            tfpixel[1] = (i1 - 1) * tilesize[1] + 1;
            tlpixel[1] = minvalue(tfpixel[1] + tilesize[1] - 1, 
                                  naxis[1]);
            thistilesize[1] = thistilesize[2] * (tlpixel[1] - tfpixel[1] + 1);
            offset[1] = (i1 - 1) * rowdim[1] + offset[2];
            for (i0 = ftile[0]; i0 <= ltile[0]; i0++)
            {
             tfpixel[0] = (i0 - 1) * tilesize[0] + 1;
             tlpixel[0] = minvalue(tfpixel[0] + tilesize[0] - 1, 
                                    naxis[0]);
              thistilesize[0] = thistilesize[1] * (tlpixel[0] - tfpixel[0] + 1);
              /* calculate row of table containing this tile */
              irow = i0 + offset[1];

/*
printf("row %d, %d %d, %d %d, %d %d; %d\n",
              irow, tfpixel[0],tlpixel[0],tfpixel[1],tlpixel[1],tfpixel[2],tlpixel[2],
	      thistilesize[0]);
*/   
              /* test if there are any intersecting pixels in this tile and the output image */
              if (imcomp_test_overlap(ndim, tfpixel, tlpixel, 
                      fpixel, lpixel, inc, status)) {
                  /* read and uncompress this row (tile) of the table */
                  /* also do type conversion and undefined pixel substitution */
                  /* at this point */

                  imcomp_decompress_tile(fptr, irow, thistilesize[0],
                    datatype, nullcheck, nullval, buffer, bnullarray, &tilenul,
                     status);

                  if (tilenul && anynul)
                      *anynul = 1;  /* there are null pixels */
/*
printf(" pixlen=%d, ndim=%d, %d %d %d, %d %d %d, %d %d %d\n",
     pixlen, ndim, fpixel[0],lpixel[0],inc[0],fpixel[1],lpixel[1],inc[1],
     fpixel[2],lpixel[2],inc[2]);
*/
                  /* copy the intersecting pixels from this tile to the output */
                  imcomp_copy_overlap(buffer, pixlen, ndim, tfpixel, tlpixel, 
                     bnullarray, array, fpixel, lpixel, inc, nullcheck, 
                     nullarray, status);
               }
            }
          }
        }
      }
     }
    }
    if (nullcheck == 2)
    {
        free(bnullarray);
    }
    free(buffer);

    return(*status);
}
/*---------------------------------------------------------------------------*/
int fits_read_write_compressed_img(fitsfile *fptr,   /* I - FITS file pointer      */
            int  datatype,  /* I - datatype of the array to be returned      */
            LONGLONG  *infpixel, /* I - 'bottom left corner' of the subsection    */
            LONGLONG  *inlpixel, /* I - 'top right corner' of the subsection      */
            long  *ininc,    /* I - increment to be applied in each dimension */
            int  nullcheck,  /* I - 0 for no null checking                   */
                              /*     1: set undefined pixels = nullval       */
            void *nullval,    /* I - value for undefined pixels              */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            fitsfile *outfptr,   /* I - FITS file pointer                    */
            int  *status)     /* IO - error status                           */
/*
   This is similar to fits_read_compressed_img, except that it writes
   the pixels to the output image, on a tile by tile basis instead of returning
   the array.
*/
{
    long naxis[MAX_COMPRESS_DIM], tiledim[MAX_COMPRESS_DIM];
    long tilesize[MAX_COMPRESS_DIM], thistilesize[MAX_COMPRESS_DIM];
    long ftile[MAX_COMPRESS_DIM], ltile[MAX_COMPRESS_DIM];
    long tfpixel[MAX_COMPRESS_DIM], tlpixel[MAX_COMPRESS_DIM];
    long rowdim[MAX_COMPRESS_DIM], offset[MAX_COMPRESS_DIM],ntemp;
    long fpixel[MAX_COMPRESS_DIM], lpixel[MAX_COMPRESS_DIM];
    long inc[MAX_COMPRESS_DIM];
    long i5, i4, i3, i2, i1, i0, irow;
    int ii, ndim, tilenul;
    void *buffer;
    char *bnullarray = 0, *cnull;
    LONGLONG firstelem;

    if (*status > 0) 
        return(*status);

    if (!fits_is_compressed_image(fptr, status) )
    {
        ffpmsg("CHDU is not a compressed image (fits_read_compressed_img)");
        return(*status = DATA_DECOMPRESSION_ERR);
    }

    cnull = (char *) nullval;  /* used to test if the nullval = 0 */
    
    /* get temporary space for uncompressing one image tile */
    /* If nullval == 0, then this means that the */
    /* calling routine does not want to check for null pixels in the array */
    if (datatype == TSHORT)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (short)); 
       if (cnull) {
         if (cnull[0] == 0 && cnull[1] == 0 ) {
           nullcheck = 0;
	 }
       }
    }
    else if (datatype == TINT)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (int));
       if (cnull) {
         if (cnull[0] == 0 && cnull[1] == 0 && cnull[2] == 0 && cnull[3] == 0 ) {
           nullcheck = 0;
	 }
       }
    }
    else if (datatype == TLONG)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (long));
       if (cnull) {
         if (cnull[0] == 0 && cnull[1] == 0 && cnull[2] == 0 && cnull[3] == 0 ) {
           nullcheck = 0;
	 }
       }
    }
    else if (datatype == TFLOAT)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (float));
       if (cnull) {
         if (cnull[0] == 0 && cnull[1] == 0 && cnull[2] == 0 && cnull[3] == 0  ) {
           nullcheck = 0;
	 }
       }
    }
    else if (datatype == TDOUBLE)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (double));
       if (cnull) {
         if (cnull[0] == 0 && cnull[1] == 0 && cnull[2] == 0 && cnull[3] == 0 &&
	     cnull[4] == 0 && cnull[5] == 0 && cnull[6] == 0 && cnull[7] == 0 ) {
           nullcheck = 0;
	 }
       }
    }
    else if (datatype == TUSHORT)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (unsigned short));
       if (cnull) {
         if (cnull[0] == 0 && cnull[1] == 0 ){
           nullcheck = 0;
	 }
       }
    }
    else if (datatype == TUINT)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (unsigned int));
       if (cnull) {
         if (cnull[0] == 0 && cnull[1] == 0 && cnull[2] == 0 && cnull[3] == 0 ){
           nullcheck = 0;
	 }
       }
    }
    else if (datatype == TULONG)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (unsigned long));
       if (cnull) {
         if (cnull[0] == 0 && cnull[1] == 0 && cnull[2] == 0 && cnull[3] == 0 ){
           nullcheck = 0;
	 }
       }
    }
    else if (datatype == TBYTE || datatype == TSBYTE)
    {
       buffer =  malloc ((fptr->Fptr)->maxtilelen * sizeof (char));
       if (cnull) {
         if (cnull[0] == 0){
           nullcheck = 0;
	 }
       }
    }
    else
    {
        ffpmsg("unsupported datatype for uncompressing image");
        return(*status = BAD_DATATYPE);
    }

    if (buffer == NULL)
    {
	    ffpmsg("Out of memory (fits_read_compress_img)");
	    return (*status = MEMORY_ALLOCATION);
    }

    /* initialize all the arrays */
    for (ii = 0; ii < MAX_COMPRESS_DIM; ii++)
    {
        naxis[ii] = 1;
        tiledim[ii] = 1;
        tilesize[ii] = 1;
        ftile[ii] = 1;
        ltile[ii] = 1;
        rowdim[ii] = 1;
    }

    ndim = (fptr->Fptr)->zndim;
    ntemp = 1;
    for (ii = 0; ii < ndim; ii++)
    {
        /* support for mirror-reversed image sections */
        if (infpixel[ii] <= inlpixel[ii])
        {
           fpixel[ii] = (long) infpixel[ii];
           lpixel[ii] = (long) inlpixel[ii];
           inc[ii]    = ininc[ii];
        }
        else
        {
           fpixel[ii] = (long) inlpixel[ii];
           lpixel[ii] = (long) infpixel[ii];
           inc[ii]    = -ininc[ii];
        }

        /* calc number of tiles in each dimension, and tile containing */
        /* the first and last pixel we want to read in each dimension  */
        naxis[ii] = (fptr->Fptr)->znaxis[ii];
        if (fpixel[ii] < 1)
        {
            free(buffer);
            return(*status = BAD_PIX_NUM);
        }

        tilesize[ii] = (fptr->Fptr)->tilesize[ii];
        tiledim[ii] = (naxis[ii] - 1) / tilesize[ii] + 1;
        ftile[ii]   = (fpixel[ii] - 1)   / tilesize[ii] + 1;
        ltile[ii]   = minvalue((lpixel[ii] - 1) / tilesize[ii] + 1, 
                                tiledim[ii]);
        rowdim[ii]  = ntemp;  /* total tiles in each dimension */
        ntemp *= tiledim[ii];
    }

    if (anynul)
       *anynul = 0;  /* initialize */

    firstelem = 1;

    /* support up to 6 dimensions for now */
    /* tfpixel and tlpixel are the first and last image pixels */
    /* along each dimension of the compression tile */
    for (i5 = ftile[5]; i5 <= ltile[5]; i5++)
    {
     tfpixel[5] = (i5 - 1) * tilesize[5] + 1;
     tlpixel[5] = minvalue(tfpixel[5] + tilesize[5] - 1, 
                            naxis[5]);
     thistilesize[5] = tlpixel[5] - tfpixel[5] + 1;
     offset[5] = (i5 - 1) * rowdim[5];
     for (i4 = ftile[4]; i4 <= ltile[4]; i4++)
     {
      tfpixel[4] = (i4 - 1) * tilesize[4] + 1;
      tlpixel[4] = minvalue(tfpixel[4] + tilesize[4] - 1, 
                            naxis[4]);
      thistilesize[4] = thistilesize[5] * (tlpixel[4] - tfpixel[4] + 1);
      offset[4] = (i4 - 1) * rowdim[4] + offset[5];
      for (i3 = ftile[3]; i3 <= ltile[3]; i3++)
      {
        tfpixel[3] = (i3 - 1) * tilesize[3] + 1;
        tlpixel[3] = minvalue(tfpixel[3] + tilesize[3] - 1, 
                              naxis[3]);
        thistilesize[3] = thistilesize[4] * (tlpixel[3] - tfpixel[3] + 1);
        offset[3] = (i3 - 1) * rowdim[3] + offset[4];
        for (i2 = ftile[2]; i2 <= ltile[2]; i2++)
        {
          tfpixel[2] = (i2 - 1) * tilesize[2] + 1;
          tlpixel[2] = minvalue(tfpixel[2] + tilesize[2] - 1, 
                                naxis[2]);
          thistilesize[2] = thistilesize[3] * (tlpixel[2] - tfpixel[2] + 1);
          offset[2] = (i2 - 1) * rowdim[2] + offset[3];
          for (i1 = ftile[1]; i1 <= ltile[1]; i1++)
          {
            tfpixel[1] = (i1 - 1) * tilesize[1] + 1;
            tlpixel[1] = minvalue(tfpixel[1] + tilesize[1] - 1, 
                                  naxis[1]);
            thistilesize[1] = thistilesize[2] * (tlpixel[1] - tfpixel[1] + 1);
            offset[1] = (i1 - 1) * rowdim[1] + offset[2];
            for (i0 = ftile[0]; i0 <= ltile[0]; i0++)
            {
              tfpixel[0] = (i0 - 1) * tilesize[0] + 1;
              tlpixel[0] = minvalue(tfpixel[0] + tilesize[0] - 1, 
                                    naxis[0]);
              thistilesize[0] = thistilesize[1] * (tlpixel[0] - tfpixel[0] + 1);
              /* calculate row of table containing this tile */
              irow = i0 + offset[1];
 
              /* read and uncompress this row (tile) of the table */
              /* also do type conversion and undefined pixel substitution */
              /* at this point */

              imcomp_decompress_tile(fptr, irow, thistilesize[0],
                    datatype, nullcheck, nullval, buffer, bnullarray, &tilenul,
                     status);

               /* write the image to the output file */

              if (tilenul && anynul) {     
                   /* this assumes that the tiled pixels are in the same order
		      as in the uncompressed FITS image.  This is not necessarily
		      the case, but it almost alway is in practice.  
		      Note that null checking is not performed for integer images,
		      so this could only be a problem for tile compressed floating
		      point images that use an unconventional tiling pattern.
		   */
                   fits_write_imgnull(outfptr, datatype, firstelem, thistilesize[0],
		      buffer, nullval, status);
              } else {
                  fits_write_subset(outfptr, datatype, tfpixel, tlpixel, 
		      buffer, status);
              }

              firstelem += thistilesize[0];

            }
          }
        }
      }
     }
    }

    free(buffer);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_read_compressed_pixels(fitsfile *fptr, /* I - FITS file pointer    */
            int  datatype,  /* I - datatype of the array to be returned     */
            LONGLONG   fpixel, /* I - 'first pixel to read          */
            LONGLONG   npixel,  /* I - number of pixels to read      */
            int  nullcheck,  /* I - 0 for no null checking                   */
                              /*     1: set undefined pixels = nullval       */
                              /*     2: set nullarray=1 for undefined pixels */
            void *nullval,    /* I - value for undefined pixels              */
            void *array,      /* O - array of values that are returned       */
            char *nullarray,  /* O - array of flags = 1 if nullcheck = 2     */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            int  *status)     /* IO - error status                           */
/*
   Read a consecutive set of pixels from a compressed image.  This routine
   interpretes the n-dimensional image as a long one-dimensional array. 
   This is actually a rather inconvenient way to read compressed images in
   general, and could be rather inefficient if the requested pixels to be
   read are located in many different image compression tiles.    

   The general strategy used here is to read the requested pixels in blocks
   that correspond to rectangular image sections.  
*/
{
    int naxis, ii, bytesperpixel, planenul;
    long naxes[MAX_COMPRESS_DIM], nread;
    long nplane, inc[MAX_COMPRESS_DIM];
    LONGLONG tfirst, tlast, last0, last1, dimsize[MAX_COMPRESS_DIM];
    LONGLONG firstcoord[MAX_COMPRESS_DIM], lastcoord[MAX_COMPRESS_DIM];
    char *arrayptr, *nullarrayptr;

    if (*status > 0)
        return(*status);

    arrayptr = (char *) array;
    nullarrayptr = nullarray;

    /* get size of array pixels, in bytes */
    bytesperpixel = ffpxsz(datatype);

    for (ii = 0; ii < MAX_COMPRESS_DIM; ii++)
    {
        naxes[ii] = 1;
        firstcoord[ii] = 0;
        lastcoord[ii] = 0;
        inc[ii] = 1;
    }

    /*  determine the dimensions of the image to be read */
    ffgidm(fptr, &naxis, status);
    ffgisz(fptr, MAX_COMPRESS_DIM, naxes, status);

    /* calc the cumulative number of pixels in each successive dimension */
    dimsize[0] = 1;
    for (ii = 1; ii < MAX_COMPRESS_DIM; ii++)
         dimsize[ii] = dimsize[ii - 1] * naxes[ii - 1];

    /*  determine the coordinate of the first and last pixel in the image */
    /*  Use zero based indexes here */
    tfirst = fpixel - 1;
    tlast = tfirst + npixel - 1;
    for (ii = naxis - 1; ii >= 0; ii--)
    {
        firstcoord[ii] = tfirst / dimsize[ii];
        lastcoord[ii] =  tlast / dimsize[ii];
        tfirst = tfirst - firstcoord[ii] * dimsize[ii];
        tlast = tlast - lastcoord[ii] * dimsize[ii];
    }

    /* to simplify things, treat 1-D, 2-D, and 3-D images as separate cases */

    if (naxis == 1)
    {
        /* Simple: just read the requested range of pixels */

        firstcoord[0] = firstcoord[0] + 1;
        lastcoord[0] = lastcoord[0] + 1;
        fits_read_compressed_img(fptr, datatype, firstcoord, lastcoord, inc,
            nullcheck, nullval, array, nullarray, anynul, status);
        return(*status);
    }
    else if (naxis == 2)
    {
        nplane = 0;  /* read 1st (and only) plane of the image */

        fits_read_compressed_img_plane(fptr, datatype, bytesperpixel,
          nplane, firstcoord, lastcoord, inc, naxes, nullcheck, nullval,
          array, nullarray, anynul, &nread, status);
    }
    else if (naxis == 3)
    {
        /* test for special case: reading an integral number of planes */
        if (firstcoord[0] == 0 && firstcoord[1] == 0 &&
            lastcoord[0] == naxes[0] - 1 && lastcoord[1] == naxes[1] - 1)
        {
            for (ii = 0; ii < MAX_COMPRESS_DIM; ii++)
            {
                /* convert from zero base to 1 base */
                (firstcoord[ii])++;
                (lastcoord[ii])++;
            }

            /* we can read the contiguous block of pixels in one go */
            fits_read_compressed_img(fptr, datatype, firstcoord, lastcoord, inc,
                nullcheck, nullval, array, nullarray, anynul, status);

            return(*status);
        }

        if (anynul)
            *anynul = 0;  /* initialize */

        /* save last coordinate in temporary variables */
        last0 = lastcoord[0];
        last1 = lastcoord[1];

        if (firstcoord[2] < lastcoord[2])
        {
            /* we will read up to the last pixel in all but the last plane */
            lastcoord[0] = naxes[0] - 1;
            lastcoord[1] = naxes[1] - 1;
        }

        /* read one plane of the cube at a time, for simplicity */
        for (nplane = (long) firstcoord[2]; nplane <= lastcoord[2]; nplane++)
        {
            if (nplane == lastcoord[2])
            {
                lastcoord[0] = last0;
                lastcoord[1] = last1;
            }

            fits_read_compressed_img_plane(fptr, datatype, bytesperpixel,
              nplane, firstcoord, lastcoord, inc, naxes, nullcheck, nullval,
              arrayptr, nullarrayptr, &planenul, &nread, status);

            if (planenul && anynul)
               *anynul = 1;  /* there are null pixels */

            /* for all subsequent planes, we start with the first pixel */
            firstcoord[0] = 0;
            firstcoord[1] = 0;

            /* increment pointers to next elements to be read */
            arrayptr = arrayptr + nread * bytesperpixel;
            if (nullarrayptr && (nullcheck == 2) )
                nullarrayptr = nullarrayptr + nread;
        }
    }
    else
    {
        ffpmsg("only 1D, 2D, or 3D images are currently supported");
        return(*status = DATA_DECOMPRESSION_ERR);
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_read_compressed_img_plane(fitsfile *fptr, /* I - FITS file   */
            int  datatype,  /* I - datatype of the array to be returned      */
            int  bytesperpixel, /* I - number of bytes per pixel in array */
            long   nplane,  /* I - which plane of the cube to read      */
            LONGLONG *firstcoord,  /* coordinate of first pixel to read */
            LONGLONG *lastcoord,   /* coordinate of last pixel to read */
            long *inc,         /* increment of pixels to read */
            long *naxes,      /* size of each image dimension */
            int  nullcheck,  /* I - 0 for no null checking                   */
                              /*     1: set undefined pixels = nullval       */
                              /*     2: set nullarray=1 for undefined pixels */
            void *nullval,    /* I - value for undefined pixels              */
            void *array,      /* O - array of values that are returned       */
            char *nullarray,  /* O - array of flags = 1 if nullcheck = 2     */
            int  *anynul,     /* O - set to 1 if any values are null; else 0 */
            long *nread,      /* O - total number of pixels read and returned*/
            int  *status)     /* IO - error status                           */

   /*
           in general we have to read the first partial row of the image,
           followed by the middle complete rows, followed by the last
           partial row of the image.  If the first or last rows are complete,
           then read them at the same time as all the middle rows.
    */
{
     /* bottom left coord. and top right coord. */
    LONGLONG blc[MAX_COMPRESS_DIM], trc[MAX_COMPRESS_DIM]; 
    char *arrayptr, *nullarrayptr;
    int tnull;

    if (anynul)
        *anynul = 0;

    *nread = 0;

    arrayptr = (char *) array;
    nullarrayptr = nullarray;

    blc[2] = nplane + 1;
    trc[2] = nplane + 1;

    if (firstcoord[0] != 0)
    { 
            /* have to read a partial first row */
            blc[0] = firstcoord[0] + 1;
            blc[1] = firstcoord[1] + 1;
            trc[1] = blc[1];  
            if (lastcoord[1] == firstcoord[1])
               trc[0] = lastcoord[0] + 1; /* 1st and last pixels in same row */
            else
               trc[0] = naxes[0];  /* read entire rest of the row */

            fits_read_compressed_img(fptr, datatype, blc, trc, inc,
                nullcheck, nullval, arrayptr, nullarrayptr, &tnull, status);

            *nread = *nread + (long) (trc[0] - blc[0] + 1);

            if (tnull && anynul)
               *anynul = 1;  /* there are null pixels */

            if (lastcoord[1] == firstcoord[1])
            {
               return(*status);  /* finished */
            }

            /* set starting coord to beginning of next line */
            firstcoord[0] = 0;
            firstcoord[1] += 1;
            arrayptr = arrayptr + (trc[0] - blc[0] + 1) * bytesperpixel;
            if (nullarrayptr && (nullcheck == 2) )
                nullarrayptr = nullarrayptr + (trc[0] - blc[0] + 1);

    }

    /* read contiguous complete rows of the image, if any */
    blc[0] = 1;
    blc[1] = firstcoord[1] + 1;
    trc[0] = naxes[0];

    if (lastcoord[0] + 1 == naxes[0])
    {
            /* can read the last complete row, too */
            trc[1] = lastcoord[1] + 1;
    }
    else
    {
            /* last row is incomplete; have to read it separately */
            trc[1] = lastcoord[1];
    }

    if (trc[1] >= blc[1])  /* must have at least one whole line to read */
    {
        fits_read_compressed_img(fptr, datatype, blc, trc, inc,
                nullcheck, nullval, arrayptr, nullarrayptr, &tnull, status);

        *nread = *nread + (long) ((trc[1] - blc[1] + 1) * naxes[0]);

        if (tnull && anynul)
           *anynul = 1;

        if (lastcoord[1] + 1 == trc[1])
               return(*status);  /* finished */

        /* increment pointers for the last partial row */
        arrayptr = arrayptr + (trc[1] - blc[1] + 1) * naxes[0] * bytesperpixel;
        if (nullarrayptr && (nullcheck == 2) )
                nullarrayptr = nullarrayptr + (trc[1] - blc[1] + 1) * naxes[0];
     }

    if (trc[1] == lastcoord[1] + 1)
        return(*status);           /* all done */

    /* set starting and ending coord to last line */

    trc[0] = lastcoord[0] + 1;
    trc[1] = lastcoord[1] + 1;
    blc[1] = trc[1];

    fits_read_compressed_img(fptr, datatype, blc, trc, inc,
                nullcheck, nullval, arrayptr, nullarrayptr, &tnull, status);

    if (tnull && anynul)
       *anynul = 1;

    *nread = *nread + (long) (trc[0] - blc[0] + 1);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int imcomp_get_compressed_image_par(fitsfile *infptr, int *status)
 
/* 
    This routine reads keywords from a BINTABLE extension containing a
    compressed image.
*/
{
    char keyword[FLEN_KEYWORD];
    char value[FLEN_VALUE];
    int ii, tstatus, doffset;
    long expect_nrows, maxtilelen;

    if (*status > 0)
        return(*status);

    /* Copy relevant header keyword values to structure */
    if (ffgky (infptr, TSTRING, "ZCMPTYPE", value, NULL, status) > 0)
    {
        ffpmsg("required ZCMPTYPE compression keyword not found in");
        ffpmsg(" imcomp_get_compressed_image_par");
        return(*status);
    }

    (infptr->Fptr)->zcmptype[0] = '\0';
    strncat((infptr->Fptr)->zcmptype, value, 11);

    if (!FSTRCMP(value, "RICE_1") || !FSTRCMP(value, "RICE_ONE") )
        (infptr->Fptr)->compress_type = RICE_1;
    else if (!FSTRCMP(value, "HCOMPRESS_1") )
        (infptr->Fptr)->compress_type = HCOMPRESS_1;
    else if (!FSTRCMP(value, "GZIP_1") )
        (infptr->Fptr)->compress_type = GZIP_1;
    else if (!FSTRCMP(value, "GZIP_2") )
        (infptr->Fptr)->compress_type = GZIP_2;
    else if (!FSTRCMP(value, "BZIP2_1") )
        (infptr->Fptr)->compress_type = BZIP2_1;
    else if (!FSTRCMP(value, "PLIO_1") )
        (infptr->Fptr)->compress_type = PLIO_1;
    else if (!FSTRCMP(value, "NOCOMPRESS") )
        (infptr->Fptr)->compress_type = NOCOMPRESS;
    else
    {
        ffpmsg("Unknown image compression type:");
        ffpmsg(value);
	return (*status = DATA_DECOMPRESSION_ERR);
    }

    /* get the floating point to integer quantization type, if present. */
    /* FITS files produced before 2009 will not have this keyword */
    tstatus = 0;
    if (ffgky(infptr, TSTRING, "ZQUANTIZ", value, NULL, &tstatus) > 0)
    {
        (infptr->Fptr)->quantize_method = 0;
        (infptr->Fptr)->quantize_level = 0;
    } else {

        if (!FSTRCMP(value, "NONE") ) {
            (infptr->Fptr)->quantize_level = NO_QUANTIZE;
       } else if (!FSTRCMP(value, "SUBTRACTIVE_DITHER_1") )
            (infptr->Fptr)->quantize_method = SUBTRACTIVE_DITHER_1;
        else if (!FSTRCMP(value, "SUBTRACTIVE_DITHER_2") )
            (infptr->Fptr)->quantize_method = SUBTRACTIVE_DITHER_2;
        else if (!FSTRCMP(value, "NO_DITHER") )
            (infptr->Fptr)->quantize_method = NO_DITHER;
        else
            (infptr->Fptr)->quantize_method = 0;
    }

    /* get the floating point quantization dithering offset, if present. */
    /* FITS files produced before October 2009 will not have this keyword */
    tstatus = 0;
    if (ffgky(infptr, TINT, "ZDITHER0", &doffset, NULL, &tstatus) > 0)
    {
	/* by default start with 1st element of random sequence */
        (infptr->Fptr)->dither_seed = 1;  
    } else {
        (infptr->Fptr)->dither_seed = doffset;
    }

    if (ffgky (infptr, TINT,  "ZBITPIX",  &(infptr->Fptr)->zbitpix,  
               NULL, status) > 0)
    {
        ffpmsg("required ZBITPIX compression keyword not found");
        return(*status);
    }

    if (ffgky (infptr,TINT, "ZNAXIS", &(infptr->Fptr)->zndim, NULL, status) > 0)
    {
        ffpmsg("required ZNAXIS compression keyword not found");
        return(*status);
    }

    if ((infptr->Fptr)->zndim < 1)
    {
        ffpmsg("Compressed image has no data (ZNAXIS < 1)");
	return (*status = BAD_NAXIS);
    }

    if ((infptr->Fptr)->zndim > MAX_COMPRESS_DIM)
    {
        ffpmsg("Compressed image has too many dimensions");
        return(*status = BAD_NAXIS);
    }

    expect_nrows = 1;
    maxtilelen = 1;
    for (ii = 0;  ii < (infptr->Fptr)->zndim;  ii++)
    {
        /* get image size */
        snprintf (keyword, FLEN_KEYWORD,"ZNAXIS%d", ii+1);
	ffgky (infptr, TLONG,keyword, &(infptr->Fptr)->znaxis[ii],NULL,status);

        if (*status > 0)
        {
            ffpmsg("required ZNAXISn compression keyword not found");
            return(*status);
        }

        /* get compression tile size */
	snprintf (keyword, FLEN_KEYWORD,"ZTILE%d", ii+1);

        /* set default tile size in case keywords are not present */
        if (ii == 0)
            (infptr->Fptr)->tilesize[0] = (infptr->Fptr)->znaxis[0];
        else
            (infptr->Fptr)->tilesize[ii] = 1;

        tstatus = 0;
	ffgky (infptr, TLONG, keyword, &(infptr->Fptr)->tilesize[ii], NULL, 
               &tstatus);

        expect_nrows *= (((infptr->Fptr)->znaxis[ii] - 1) / 
                  (infptr->Fptr)->tilesize[ii]+ 1);
        maxtilelen *= (infptr->Fptr)->tilesize[ii];
    }

    /* check number of rows */
    if (expect_nrows != (infptr->Fptr)->numrows)
    {
        ffpmsg(
        "number of table rows != the number of tiles in compressed image");
        return (*status = DATA_DECOMPRESSION_ERR);
    }

    /* read any algorithm specific parameters */
    if ((infptr->Fptr)->compress_type == RICE_1 )
    {
        if (ffgky(infptr, TINT,"ZVAL1", &(infptr->Fptr)->rice_blocksize,
                  NULL, status) > 0)
        {
            ffpmsg("required ZVAL1 compression keyword not found");
            return(*status);
        }

        tstatus = 0;
        if (ffgky(infptr, TINT,"ZVAL2", &(infptr->Fptr)->rice_bytepix,
                  NULL, &tstatus) > 0)
        {
            (infptr->Fptr)->rice_bytepix = 4;  /* default value */
        }

        if ((infptr->Fptr)->rice_blocksize < 16 &&
	    (infptr->Fptr)->rice_bytepix > 8) {
	     /* values are reversed */
	     tstatus = (infptr->Fptr)->rice_bytepix;
	     (infptr->Fptr)->rice_bytepix = (infptr->Fptr)->rice_blocksize;
	     (infptr->Fptr)->rice_blocksize = tstatus;
        }
    } else if ((infptr->Fptr)->compress_type == HCOMPRESS_1 ) {

        if (ffgky(infptr, TFLOAT,"ZVAL1", &(infptr->Fptr)->hcomp_scale,
                  NULL, status) > 0)
        {
            ffpmsg("required ZVAL1 compression keyword not found");
            return(*status);
        }

        tstatus = 0;
        ffgky(infptr, TINT,"ZVAL2", &(infptr->Fptr)->hcomp_smooth,
                  NULL, &tstatus);
    }    

    /* store number of pixels in each compression tile, */
    /* and max size of the compressed tile buffer */
    (infptr->Fptr)->maxtilelen = maxtilelen;

    (infptr->Fptr)->maxelem = 
           imcomp_calc_max_elem ((infptr->Fptr)->compress_type, maxtilelen, 
               (infptr->Fptr)->zbitpix, (infptr->Fptr)->rice_blocksize);

    /* Get Column numbers. */
    if (ffgcno(infptr, CASEINSEN, "COMPRESSED_DATA",
         &(infptr->Fptr)->cn_compressed, status) > 0)
    {
        ffpmsg("couldn't find COMPRESSED_DATA column (fits_get_compressed_img_par)");
        return(*status = DATA_DECOMPRESSION_ERR);
    }

    ffpmrk(); /* put mark on message stack; erase any messages after this */

    tstatus = 0;
    ffgcno(infptr,CASEINSEN, "UNCOMPRESSED_DATA",
          &(infptr->Fptr)->cn_uncompressed, &tstatus);

    tstatus = 0;
    ffgcno(infptr,CASEINSEN, "GZIP_COMPRESSED_DATA",
          &(infptr->Fptr)->cn_gzip_data, &tstatus);

    tstatus = 0;
    if (ffgcno(infptr, CASEINSEN, "ZSCALE", &(infptr->Fptr)->cn_zscale,
              &tstatus) > 0)
    {
        /* CMPSCALE column doesn't exist; see if there is a keyword */
        tstatus = 0;
        if (ffgky(infptr, TDOUBLE, "ZSCALE", &(infptr->Fptr)->zscale, NULL, 
                 &tstatus) <= 0)
            (infptr->Fptr)->cn_zscale = -1;  /* flag for a constant ZSCALE */
    }

    tstatus = 0;
    if (ffgcno(infptr, CASEINSEN, "ZZERO", &(infptr->Fptr)->cn_zzero,
               &tstatus) > 0)
    {
        /* CMPZERO column doesn't exist; see if there is a keyword */
        tstatus = 0;
        if (ffgky(infptr, TDOUBLE, "ZZERO", &(infptr->Fptr)->zzero, NULL, 
                  &tstatus) <= 0)
            (infptr->Fptr)->cn_zzero = -1;  /* flag for a constant ZZERO */
    }

    tstatus = 0;
    if (ffgcno(infptr, CASEINSEN, "ZBLANK", &(infptr->Fptr)->cn_zblank,
               &tstatus) > 0)
    {
        /* ZBLANK column doesn't exist; see if there is a keyword */
        tstatus = 0;
        if (ffgky(infptr, TINT, "ZBLANK", &(infptr->Fptr)->zblank, NULL,
                  &tstatus) <= 0)  {
            (infptr->Fptr)->cn_zblank = -1;  /* flag for a constant ZBLANK */

        } else {
           /* ZBLANK keyword doesn't exist; see if there is a BLANK keyword */
           tstatus = 0;
           if (ffgky(infptr, TINT, "BLANK", &(infptr->Fptr)->zblank, NULL,
                  &tstatus) <= 0)  
              (infptr->Fptr)->cn_zblank = -1;  /* flag for a constant ZBLANK */
        }
    }

    /* read the conventional BSCALE and BZERO scaling keywords, if present */
    tstatus = 0;
    if (ffgky (infptr, TDOUBLE, "BSCALE", &(infptr->Fptr)->cn_bscale, 
        NULL, &tstatus) > 0)
    {
        (infptr->Fptr)->cn_bscale = 1.0;
    }

    tstatus = 0;
    if (ffgky (infptr, TDOUBLE, "BZERO", &(infptr->Fptr)->cn_bzero, 
        NULL, &tstatus) > 0)
    {
        (infptr->Fptr)->cn_bzero = 0.0;
        (infptr->Fptr)->cn_actual_bzero = 0.0;
    } else {
        (infptr->Fptr)->cn_actual_bzero = (infptr->Fptr)->cn_bzero;
    }

    /* special case: the quantization level is not given by a keyword in  */
    /* the HDU header, so we have to explicitly copy the requested value */
    /* to the actual value */
    if ( (infptr->Fptr)->request_quantize_level != 0.)
        (infptr->Fptr)->quantize_level = (infptr->Fptr)->request_quantize_level;

    ffcmrk();  /* clear any spurious error messages, back to the mark */
    return (*status);
}
/*--------------------------------------------------------------------------*/
int imcomp_copy_imheader(fitsfile *infptr, fitsfile *outfptr, int *status)
/*
    This routine reads the header keywords from the input image and
    copies them to the output image;  the manditory structural keywords
    and the checksum keywords are not copied. If the DATE keyword is copied,
    then it is updated with the current date and time.
*/
{
    int nkeys, ii, keyclass;
    char card[FLEN_CARD];	/* a header record */

    if (*status > 0)
        return(*status);

    ffghsp(infptr, &nkeys, NULL, status); /* get number of keywords in image */

    for (ii = 5; ii <= nkeys; ii++)  /* skip the first 4 keywords */
    {
        ffgrec(infptr, ii, card, status);

	keyclass = ffgkcl(card);  /* Get the type/class of keyword */

        /* don't copy structural keywords or checksum keywords */
        if ((keyclass <= TYP_CMPRS_KEY) || (keyclass == TYP_CKSUM_KEY))
	    continue;

        if (FSTRNCMP(card, "DATE ", 5) == 0) /* write current date */
        {
            ffpdat(outfptr, status);
        }
        else if (FSTRNCMP(card, "EXTNAME ", 8) == 0) 
        {
            /* don't copy default EXTNAME keyword from a compressed image */
            if (FSTRNCMP(card, "EXTNAME = 'COMPRESSED_IMAGE'", 28))
            {
                /* if EXTNAME keyword already exists, overwrite it */
                /* otherwise append a new EXTNAME keyword */
                ffucrd(outfptr, "EXTNAME", card, status);
            }
        }
        else
        {
            /* just copy the keyword to the output header */
	    ffprec (outfptr, card, status);
        }

        if (*status > 0)
           return (*status);
    }
    return (*status);
}
/*--------------------------------------------------------------------------*/
int imcomp_copy_img2comp(fitsfile *infptr, fitsfile *outfptr, int *status)
/*
    This routine copies the header keywords from the uncompressed input image 
    and to the compressed image (in a binary table) 
*/
{
    char card[FLEN_CARD], card2[FLEN_CARD];	/* a header record */
    int nkeys, nmore, ii, jj, tstatus, bitpix;

    /* tile compressed image keyword translation table  */
    /*                        INPUT      OUTPUT  */
    /*                       01234567   01234567 */
    char *patterns[][2] = {{"SIMPLE",  "ZSIMPLE" },  
			   {"XTENSION", "ZTENSION" },
			   {"BITPIX",  "ZBITPIX" },
			   {"NAXIS",   "ZNAXIS"  },
			   {"NAXISm",  "ZNAXISm" },
			   {"EXTEND",  "ZEXTEND" },
			   {"BLOCKED", "ZBLOCKED"},
			   {"PCOUNT",  "ZPCOUNT" },  
			   {"GCOUNT",  "ZGCOUNT" },

			   {"CHECKSUM","ZHECKSUM"},  /* save original checksums */
			   {"DATASUM", "ZDATASUM"},
			   
			   {"*",       "+"       }}; /* copy all other keywords */
    int npat;

    if (*status > 0)
        return(*status);

    /* write a default EXTNAME keyword if it doesn't exist in input file*/
    fits_read_card(infptr, "EXTNAME", card, status);
    
    if (*status) {
       *status = 0;
       strcpy(card, "EXTNAME = 'COMPRESSED_IMAGE'");
       fits_write_record(outfptr, card, status);
    }

    /* copy all the keywords from the input file to the output */
    npat = sizeof(patterns)/sizeof(patterns[0][0])/2;
    fits_translate_keywords(infptr, outfptr, 1, patterns, npat,
			    0, 0, 0, status);


    if ( (outfptr->Fptr)->request_lossy_int_compress != 0) { 

	/* request was made to compress integer images as if they had float pixels. */
	/* If input image has positive bitpix value, then reset the output ZBITPIX */
	/* value to -32. */

	fits_read_key(infptr, TINT, "BITPIX", &bitpix, NULL, status);

	if (*status <= 0 && bitpix > 0) {
	    fits_modify_key_lng(outfptr, "ZBITPIX", -32, NULL, status);

	    /* also delete the BSCALE, BZERO, and BLANK keywords */
	    tstatus = 0;
	    fits_delete_key(outfptr, "BSCALE", &tstatus);
	    tstatus = 0;
	    fits_delete_key(outfptr, "BZERO", &tstatus);
	    tstatus = 0;
	    fits_delete_key(outfptr, "BLANK", &tstatus);
	}
    }

   /*
     For compatibility with software that uses an older version of CFITSIO,
     we must make certain that the new ZQUANTIZ keyword, if it exists, must
     occur after the other peudo-required keywords (e.g., ZSIMPLE, ZBITPIX,
     etc.).  Do this by trying to delete the keyword.  If that succeeds (and
     thus the keyword did exist) then rewrite the keyword at the end of header.
     In principle this should not be necessary once all software has upgraded
     to a newer version of CFITSIO (version number greater than 3.181, newer
     than August 2009).
     
     Do the same for the new ZDITHER0 keyword.
   */

   tstatus = 0;
   if (fits_read_card(outfptr, "ZQUANTIZ", card, &tstatus) == 0)
   {
        fits_delete_key(outfptr, "ZQUANTIZ", status);

        /* rewrite the deleted keyword at the end of the header */
        fits_write_record(outfptr, card, status);

	/* write some associated HISTORY keywords */
        fits_parse_value(card, card2, NULL, status);
	if (fits_strncasecmp(card2, "'NONE", 5) ) {
	    /* the value is not 'NONE' */	
	    fits_write_history(outfptr, 
	        "Image was compressed by CFITSIO using scaled integer quantization:", status);
	    snprintf(card2, FLEN_CARD,"  q = %f / quantized level scaling parameter", 
	        (outfptr->Fptr)->request_quantize_level);
	    fits_write_history(outfptr, card2, status); 
	    fits_write_history(outfptr, card+10, status); 
	}
   }

   tstatus = 0;
   if (fits_read_card(outfptr, "ZDITHER0", card, &tstatus) == 0)
   {
        fits_delete_key(outfptr, "ZDITHER0", status);

        /* rewrite the deleted keyword at the end of the header */
        fits_write_record(outfptr, card, status);
   }


    ffghsp(infptr, &nkeys, &nmore, status); /* get number of keywords in image */

    nmore = nmore / 36;  /* how many completely empty header blocks are there? */
     
     /* preserve the same number of spare header blocks in the output header */
     
    for (jj = 0; jj < nmore; jj++)
       for (ii = 0; ii < 36; ii++)
          fits_write_record(outfptr, "    ", status);

    return (*status);
}
/*--------------------------------------------------------------------------*/
int imcomp_copy_comp2img(fitsfile *infptr, fitsfile *outfptr, 
                          int norec, int *status)
/*
    This routine copies the header keywords from the compressed input image 
    and to the uncompressed image (in a binary table) 
*/
{
    char card[FLEN_CARD];	/* a header record */
    char *patterns[40][2];
    char negative[] = "-";
    int ii,jj, npat, nreq, nsp, tstatus = 0;
    int nkeys, nmore;
    
    /* tile compressed image keyword translation table  */
    /*                        INPUT      OUTPUT  */
    /*                       01234567   01234567 */

    /*  only translate these if required keywords not already written */
    char *reqkeys[][2] = {  
			   {"ZSIMPLE",   "SIMPLE" },  
			   {"ZTENSION", "XTENSION"},
			   {"ZBITPIX",   "BITPIX" },
			   {"ZNAXIS",    "NAXIS"  },
			   {"ZNAXISm",   "NAXISm" },
			   {"ZEXTEND",   "EXTEND" },
			   {"ZBLOCKED",  "BLOCKED"},
			   {"ZPCOUNT",   "PCOUNT" },  
			   {"ZGCOUNT",   "GCOUNT" },
			   {"ZHECKSUM",  "CHECKSUM"},  /* restore original checksums */
			   {"ZDATASUM",  "DATASUM"}}; 

    /* other special keywords */
    char *spkeys[][2] = {
			   {"XTENSION", "-"      },
			   {"BITPIX",  "-"       },
			   {"NAXIS",   "-"       },
			   {"NAXISm",  "-"       },
			   {"PCOUNT",  "-"       },
			   {"GCOUNT",  "-"       },
			   {"TFIELDS", "-"       },
			   {"TTYPEm",  "-"       },
			   {"TFORMm",  "-"       },
			   {"THEAP",   "-"       },
			   {"ZIMAGE",  "-"       },
			   {"ZQUANTIZ", "-"      },
			   {"ZDITHER0", "-"      },
			   {"ZTILEm",  "-"       },
			   {"ZCMPTYPE", "-"      },
			   {"ZBLANK",  "-"       },
			   {"ZNAMEm",  "-"       },
			   {"ZVALm",   "-"       },

			   {"CHECKSUM","-"       },  /* delete checksums */
			   {"DATASUM", "-"       },
			   {"EXTNAME", "+"       },  /* we may change this, below */
			   {"*",       "+"      }};  


    if (*status > 0)
        return(*status);
	
    nreq = sizeof(reqkeys)/sizeof(reqkeys[0][0])/2;
    nsp = sizeof(spkeys)/sizeof(spkeys[0][0])/2;

    /* construct translation patterns */

    for (ii = 0; ii < nreq; ii++) {
        patterns[ii][0] = reqkeys[ii][0];
	
        if (norec) 
            patterns[ii][1] = negative;
        else
            patterns[ii][1] = reqkeys[ii][1];
    }
    
    for (ii = 0; ii < nsp; ii++) {
        patterns[ii+nreq][0] = spkeys[ii][0];
        patterns[ii+nreq][1] = spkeys[ii][1];
    }

    npat = nreq + nsp;
    
    /* see if the EXTNAME keyword should be copied or not */
    fits_read_card(infptr, "EXTNAME", card, &tstatus);

    if (tstatus == 0) {
      if (!strncmp(card, "EXTNAME = 'COMPRESSED_IMAGE'", 28)) 
        patterns[npat-2][1] = negative;
    }
    
    /* translate and copy the keywords from the input file to the output */
    fits_translate_keywords(infptr, outfptr, 1, patterns, npat,
			    0, 0, 0, status);

    ffghsp(infptr, &nkeys, &nmore, status); /* get number of keywords in image */

    nmore = nmore / 36;  /* how many completely empty header blocks are there? */
     
    /* preserve the same number of spare header blocks in the output header */
     
    for (jj = 0; jj < nmore; jj++)
       for (ii = 0; ii < 36; ii++)
          fits_write_record(outfptr, "    ", status);


    return (*status);
}
/*--------------------------------------------------------------------------*/
int imcomp_copy_prime2img(fitsfile *infptr, fitsfile *outfptr, int *status)
/*
    This routine copies any unexpected keywords from the primary array
    of the compressed input image into the header of the uncompressed image
    (which is the primary array of the output file). 
*/
{
    int  nsp;

    /* keywords that will not be copied */
    char *spkeys[][2] = {
			   {"SIMPLE", "-"      },
			   {"BITPIX",  "-"       },
			   {"NAXIS",   "-"       },
			   {"NAXISm",  "-"       },
			   {"PCOUNT",  "-"       },
			   {"EXTEND",  "-"       },
			   {"GCOUNT",  "-"       },
			   {"CHECKSUM","-"       }, 
			   {"DATASUM", "-"       },
			   {"EXTNAME", "-"       },
			   {"HISTORY", "-"       },
			   {"COMMENT", "-"       },
			   {"*",       "+"      }};  

    if (*status > 0)
        return(*status);
	
    nsp = sizeof(spkeys)/sizeof(spkeys[0][0])/2;

    /* translate and copy the keywords from the input file to the output */
    fits_translate_keywords(infptr, outfptr, 1, spkeys, nsp,
			    0, 0, 0, status);

    return (*status);
}
/*--------------------------------------------------------------------------*/
int imcomp_decompress_tile (fitsfile *infptr,
          int nrow,            /* I - row of table to read and uncompress */
          int tilelen,         /* I - number of pixels in the tile        */
          int datatype,        /* I - datatype to be returned in 'buffer' */
          int nullcheck,       /* I - 0 for no null checking */
          void *nulval,        /* I - value to be used for undefined pixels */
          void *buffer,        /* O - buffer for returned decompressed values */
          char *bnullarray,    /* O - buffer for returned null flags */
          int *anynul,         /* O - any null values returned?  */
          int *status)

/* This routine decompresses one tile of the image */
{
    int *idata = 0;
    int tiledatatype, pixlen = 0;          /* uncompressed integer data */
    size_t idatalen, tilebytesize;
    int ii, tnull;        /* value in the data which represents nulls */
    unsigned char *cbuf; /* compressed data */
    unsigned char charnull = 0;
    short snull = 0;
    int blocksize, ntilebins, tilecol = 0;
    float fnulval=0;
    float *tempfloat = 0;
    double dnulval=0;
    double bscale, bzero, actual_bzero, dummy = 0;    /* scaling parameters */
    long tilesize;      /* number of bytes */
    int smooth, nx, ny, scale;  /* hcompress parameters */
    LONGLONG nelemll = 0, offset = 0;

    if (*status > 0)
       return(*status);


    /* **************************************************************** */
    /* allocate pointers to array of cached uncompressed tiles, if not already done */
    if ((infptr->Fptr)->tilerow == 0)  {

      /* calculate number of column bins of compressed tile */
      ntilebins =  (((infptr->Fptr)->znaxis[0] - 1) / ((infptr->Fptr)->tilesize[0])) + 1;

     if ((infptr->Fptr)->znaxis[0]   != (infptr->Fptr)->tilesize[0] ||
        (infptr->Fptr)->tilesize[1] != 1 ) {   /* don't cache the tile if only single row of the image */

        (infptr->Fptr)->tilerow = (int *) calloc (ntilebins, sizeof(int));
        (infptr->Fptr)->tiledata = (void**) calloc (ntilebins, sizeof(void*));
        (infptr->Fptr)->tilenullarray = (void **) calloc (ntilebins, sizeof(char*));
        (infptr->Fptr)->tiledatasize = (long *) calloc (ntilebins, sizeof(long));
        (infptr->Fptr)->tiletype = (int *) calloc (ntilebins, sizeof(int));
        (infptr->Fptr)->tileanynull = (int *) calloc (ntilebins, sizeof(int));
      }
    }
 
    /* **************************************************************** */
    /* check if this tile was cached; if so, just copy it out */
    if ((infptr->Fptr)->tilerow)  {
      /* calculate the column bin of the compressed tile */
      tilecol = (nrow - 1) % ((long)(((infptr->Fptr)->znaxis[0] - 1) / ((infptr->Fptr)->tilesize[0])) + 1);

      if (nrow == (infptr->Fptr)->tilerow[tilecol] && datatype == (infptr->Fptr)->tiletype[tilecol] ) {

         memcpy(buffer, ((infptr->Fptr)->tiledata)[tilecol], (infptr->Fptr)->tiledatasize[tilecol]);
	 
	 if (nullcheck == 2)
             memcpy(bnullarray, (infptr->Fptr)->tilenullarray[tilecol], tilelen);

         *anynul = (infptr->Fptr)->tileanynull[tilecol];

         return(*status);
       }
    }

    /* **************************************************************** */
    /* get length of the compressed byte stream */
    ffgdesll (infptr, (infptr->Fptr)->cn_compressed, nrow, &nelemll, &offset, 
            status);

    /* EOF error here indicates that this tile has not yet been written */
    if (*status == END_OF_FILE)
           return(*status = NO_COMPRESSED_TILE);
      
    /* **************************************************************** */
    if (nelemll == 0)  /* special case: tile was not compressed normally */
    {
        if ((infptr->Fptr)->cn_uncompressed >= 1 ) {

	    /* This option of writing the uncompressed floating point data */
	    /* to the tile compressed file was used until about May 2011. */
	    /* This was replaced by the more efficient option of gzipping the */
	    /* floating point data before writing it to the tile-compressed file */
	    
            /* no compressed data, so simply read the uncompressed data */
            /* directly from the UNCOMPRESSED_DATA column */   
            ffgdesll (infptr, (infptr->Fptr)->cn_uncompressed, nrow, &nelemll,
               &offset, status);

            if (nelemll == 0 && offset == 0)  /* this should never happen */
	        return (*status = NO_COMPRESSED_TILE);

            if (nullcheck <= 1) { /* set any null values in the array = nulval */
                fits_read_col(infptr, datatype, (infptr->Fptr)->cn_uncompressed,
                  nrow, 1, (long) nelemll, nulval, buffer, anynul, status);
            } else  { /* set the bnullarray = 1 for any null values in the array */
                fits_read_colnull(infptr, datatype, (infptr->Fptr)->cn_uncompressed,
                  nrow, 1, (long) nelemll, buffer, bnullarray, anynul, status);
            }
        } else if ((infptr->Fptr)->cn_gzip_data >= 1) {

            /* This is the newer option, that was introduced in May 2011 */
            /* floating point data was not quantized,  so read the losslessly */
	    /* compressed data from the GZIP_COMPRESSED_DATA column */   

            ffgdesll (infptr, (infptr->Fptr)->cn_gzip_data, nrow, &nelemll,
               &offset, status);

            if (nelemll == 0 && offset == 0) /* this should never happen */
	        return (*status = NO_COMPRESSED_TILE);

	    /* allocate memory for the compressed tile of data */
            cbuf = (unsigned char *) malloc ((long) nelemll);  
            if (cbuf == NULL) {
	        ffpmsg("error allocating memory for gzipped tile (imcomp_decompress_tile)");
	        return (*status = MEMORY_ALLOCATION);
            }

            /* read array of compressed bytes */
            if (fits_read_col(infptr, TBYTE, (infptr->Fptr)->cn_gzip_data, nrow,
                 1, (long) nelemll, &charnull, cbuf, NULL, status) > 0) {
                ffpmsg("error reading compressed byte stream from binary table");
	        free (cbuf);
                return (*status);
            }

            /* size of the returned (uncompressed) data buffer, in bytes */
            if ((infptr->Fptr)->zbitpix == FLOAT_IMG) {
	         idatalen = tilelen * sizeof(float);
            } else if ((infptr->Fptr)->zbitpix == DOUBLE_IMG) {
	         idatalen = tilelen * sizeof(double);
            } else {
                /* this should never happen! */
                ffpmsg("incompatible data type in gzipped floating-point tile-compressed image");
                free (cbuf);
                return (*status = DATA_DECOMPRESSION_ERR);
            }

            if (datatype == TDOUBLE && (infptr->Fptr)->zbitpix == FLOAT_IMG) {  
                /*  have to allocat a temporary buffer for the uncompressed data in the */
                /*  case where a gzipped "float" tile is returned as a "double" array   */
                tempfloat = (float*) malloc (idatalen); 

                if (tempfloat == NULL) {
	            ffpmsg("Memory allocation failure for tempfloat. (imcomp_decompress_tile)");
                    free (cbuf);
	            return (*status = MEMORY_ALLOCATION);
                }

                /* uncompress the data into temp buffer */
                if (uncompress2mem_from_mem ((char *)cbuf, (long) nelemll,
                     (char **) &tempfloat, &idatalen, NULL, &tilebytesize, status)) {
                    ffpmsg("failed to gunzip the image tile");
                    free (tempfloat);
                    free (cbuf);
                    return (*status);
                }
            } else {

                /* uncompress the data directly into the output buffer in all other cases */
                if (uncompress2mem_from_mem ((char *)cbuf, (long) nelemll,
                  (char **) &buffer, &idatalen, NULL, &tilebytesize, status)) {
                    ffpmsg("failed to gunzip the image tile");
                    free (cbuf);
                    return (*status);
                }
            }

            free(cbuf);

            /* do byte swapping and null value substitution for the tile of pixels */
            if (tilebytesize == 4 * tilelen) {  /* float pixels */

#if BYTESWAPPED
                if (tempfloat)
                    ffswap4((int *) tempfloat, tilelen);
                else
                    ffswap4((int *) buffer, tilelen);
#endif
               if (datatype == TFLOAT) {
                  if (nulval) {
		    fnulval = *(float *) nulval;
  		  }

                  fffr4r4((float *) buffer, (long) tilelen, 1., 0., nullcheck,   
                        fnulval, bnullarray, anynul,
                        (float *) buffer, status);
                } else if (datatype == TDOUBLE) {
                  if (nulval) {
		    dnulval = *(double *) nulval;
		  }

                  /* note that the R*4 data are in the tempfloat array in this case */
                  fffr4r8((float *) tempfloat, (long) tilelen, 1., 0., nullcheck,   
                   dnulval, bnullarray, anynul,
                    (double *) buffer, status);            
                  free(tempfloat);

                } else {
                  ffpmsg("implicit data type conversion is not supported for gzipped image tiles");
                  return (*status = DATA_DECOMPRESSION_ERR);
                }
            } else if (tilebytesize == 8 * tilelen) { /* double pixels */

#if BYTESWAPPED
                ffswap8((double *) buffer, tilelen);
#endif
                if (datatype == TFLOAT) {
                  if (nulval) {
		    fnulval = *(float *) nulval;
  		  }

                  fffr8r4((double *) buffer, (long) tilelen, 1., 0., nullcheck,   
                        fnulval, bnullarray, anynul,
                        (float *) buffer, status);
                } else if (datatype == TDOUBLE) {
                  if (nulval) {
		    dnulval = *(double *) nulval;
		  }

                  fffr8r8((double *) buffer, (long) tilelen, 1., 0., nullcheck,   
                   dnulval, bnullarray, anynul,
                    (double *) buffer, status);            
                } else {
                  ffpmsg("implicit data type conversion is not supported in tile-compressed images");
                  return (*status = DATA_DECOMPRESSION_ERR);
                }
	    } else {
                ffpmsg("error: uncompressed tile has wrong size");
                return (*status = DATA_DECOMPRESSION_ERR);
            }

          /* end of special case of losslessly gzipping a floating-point image tile */
        } else {  /* this should never happen */
	   *status = NO_COMPRESSED_TILE;
        }

        return(*status);
    }

    /* **************************************************************** */
    /* deal with the normal case of a compressed tile of pixels */
    if (nullcheck == 2)  {
        for (ii = 0; ii < tilelen; ii++)  /* initialize the null flage array */
            bnullarray[ii] = 0;
    }

    if (anynul)
       *anynul = 0;

    /* get linear scaling and offset values, if they exist */
    actual_bzero = (infptr->Fptr)->cn_actual_bzero;
    if ((infptr->Fptr)->cn_zscale == 0) {
         /* set default scaling, if scaling is not defined */
         bscale = 1.;
         bzero = 0.;
    } else if ((infptr->Fptr)->cn_zscale == -1) {
        bscale = (infptr->Fptr)->zscale;
        bzero  = (infptr->Fptr)->zzero;
    } else {
        /* read the linear scale and offset values for this row */
	ffgcvd (infptr, (infptr->Fptr)->cn_zscale, nrow, 1, 1, 0.,
				&bscale, NULL, status);
	ffgcvd (infptr, (infptr->Fptr)->cn_zzero, nrow, 1, 1, 0.,
				&bzero, NULL, status);
        if (*status > 0)
        {
          ffpmsg("error reading scaling factor and offset for compressed tile");
          return (*status);
        }

        /* test if floating-point FITS image also has non-default BSCALE and  */
	/* BZERO keywords.  If so, we have to combine the 2 linear scaling factors. */
	
	if ( ((infptr->Fptr)->zbitpix == FLOAT_IMG || 
	      (infptr->Fptr)->zbitpix == DOUBLE_IMG )
	    &&  
	      ((infptr->Fptr)->cn_bscale != 1.0 ||
	       (infptr->Fptr)->cn_bzero  != 0.0 )    ) 
	    {
	       bscale = bscale * (infptr->Fptr)->cn_bscale;
	       bzero  = bzero  * (infptr->Fptr)->cn_bscale + (infptr->Fptr)->cn_bzero;
	    }
    }

    if (bscale == 1.0 && bzero == 0.0 ) {
      /* if no other scaling has been specified, try using the values
         given by the BSCALE and BZERO keywords, if any */

        bscale = (infptr->Fptr)->cn_bscale;
        bzero  = (infptr->Fptr)->cn_bzero;
    }

    /* ************************************************************* */
    /* get the value used to represent nulls in the int array */
    if ((infptr->Fptr)->cn_zblank == 0) {
        nullcheck = 0;  /* no null value; don't check for nulls */
    } else if ((infptr->Fptr)->cn_zblank == -1) {
        tnull = (infptr->Fptr)->zblank;  /* use the the ZBLANK keyword */
    } else {
        /* read the null value for this row */
	ffgcvk (infptr, (infptr->Fptr)->cn_zblank, nrow, 1, 1, 0,
				&tnull, NULL, status);
        if (*status > 0) {
            ffpmsg("error reading null value for compressed tile");
            return (*status);
        }
    }

    /* ************************************************************* */
    /* allocate memory for the uncompressed array of tile integers */
    /* The size depends on the datatype and the compression type. */
    
    if ((infptr->Fptr)->compress_type == HCOMPRESS_1 &&
          ((infptr->Fptr)->zbitpix != BYTE_IMG &&
	   (infptr->Fptr)->zbitpix != SHORT_IMG) ) {

           idatalen = tilelen * sizeof(LONGLONG);  /* 8 bytes per pixel */

    } else if ( (infptr->Fptr)->compress_type == RICE_1 &&
               (infptr->Fptr)->zbitpix == BYTE_IMG && 
	       (infptr->Fptr)->rice_bytepix == 1) {

           idatalen = tilelen * sizeof(char); /* 1 byte per pixel */
    } else if ( ( (infptr->Fptr)->compress_type == GZIP_1  ||
                  (infptr->Fptr)->compress_type == GZIP_2  ||
                  (infptr->Fptr)->compress_type == BZIP2_1 ) &&
               (infptr->Fptr)->zbitpix == BYTE_IMG ) {

           idatalen = tilelen * sizeof(char); /* 1 byte per pixel */
    } else if ( (infptr->Fptr)->compress_type == RICE_1 &&
               (infptr->Fptr)->zbitpix == SHORT_IMG && 
	       (infptr->Fptr)->rice_bytepix == 2) {

           idatalen = tilelen * sizeof(short); /* 2 bytes per pixel */
    } else if ( ( (infptr->Fptr)->compress_type == GZIP_1  ||
                  (infptr->Fptr)->compress_type == GZIP_2  ||
                  (infptr->Fptr)->compress_type == BZIP2_1 )  &&
               (infptr->Fptr)->zbitpix == SHORT_IMG ) {

           idatalen = tilelen * sizeof(short); /* 2 bytes per pixel */
    } else if ( ( (infptr->Fptr)->compress_type == GZIP_1  ||
                  (infptr->Fptr)->compress_type == GZIP_2  ||
                  (infptr->Fptr)->compress_type == BZIP2_1 ) &&
               (infptr->Fptr)->zbitpix == DOUBLE_IMG ) {

           idatalen = tilelen * sizeof(double); /* 8 bytes per pixel  */
    } else {
           idatalen = tilelen * sizeof(int);  /* all other cases have int pixels */
    }

    idata = (int*) malloc (idatalen); 
    if (idata == NULL) {
	    ffpmsg("Memory allocation failure for idata. (imcomp_decompress_tile)");
	    return (*status = MEMORY_ALLOCATION);
    }

    /* ************************************************************* */
    /* allocate memory for the compressed bytes */

    if ((infptr->Fptr)->compress_type == PLIO_1) {
        cbuf = (unsigned char *) malloc ((long) nelemll * sizeof (short));
    } else {
        cbuf = (unsigned char *) malloc ((long) nelemll);
    }
    if (cbuf == NULL) {
	ffpmsg("Out of memory for cbuf. (imcomp_decompress_tile)");
        free(idata);
	return (*status = MEMORY_ALLOCATION);
    }
    
    /* ************************************************************* */
    /* read the compressed bytes from the FITS file */

    if ((infptr->Fptr)->compress_type == PLIO_1) {
        fits_read_col(infptr, TSHORT, (infptr->Fptr)->cn_compressed, nrow,
             1, (long) nelemll, &snull, (short *) cbuf, NULL, status);
    } else {
       fits_read_col(infptr, TBYTE, (infptr->Fptr)->cn_compressed, nrow,
             1, (long) nelemll, &charnull, cbuf, NULL, status);
    }

    if (*status > 0) {
        ffpmsg("error reading compressed byte stream from binary table");
	free (cbuf);
        free(idata);
        return (*status);
    }

    /* ************************************************************* */
    /*  call the algorithm-specific code to uncompress the tile */

    if ((infptr->Fptr)->compress_type == RICE_1) {

        blocksize = (infptr->Fptr)->rice_blocksize;

        if ((infptr->Fptr)->rice_bytepix == 1 ) {
            *status = fits_rdecomp_byte (cbuf, (long) nelemll, (unsigned char *)idata,
                        tilelen, blocksize);
            tiledatatype = TBYTE;
        } else if ((infptr->Fptr)->rice_bytepix == 2 ) {
            *status = fits_rdecomp_short (cbuf, (long) nelemll, (unsigned short *)idata,
                        tilelen, blocksize);
            tiledatatype = TSHORT;
        } else {
            *status = fits_rdecomp (cbuf, (long) nelemll, (unsigned int *)idata,
                         tilelen, blocksize);
            tiledatatype = TINT;
        }

    /* ************************************************************* */
    } else if ((infptr->Fptr)->compress_type == HCOMPRESS_1)  {

        smooth = (infptr->Fptr)->hcomp_smooth;

        if ( ((infptr->Fptr)->zbitpix == BYTE_IMG || (infptr->Fptr)->zbitpix == SHORT_IMG)) {
            *status = fits_hdecompress(cbuf, smooth, idata, &nx, &ny,
	        &scale, status);
        } else {  /* zbitpix = LONG_IMG (32) */
            /* idata must have been allocated twice as large for this to work */
            *status = fits_hdecompress64(cbuf, smooth, (LONGLONG *) idata, &nx, &ny,
	        &scale, status);
        }       

        tiledatatype = TINT;

    /* ************************************************************* */
    } else if ((infptr->Fptr)->compress_type == PLIO_1) {

        pl_l2pi ((short *) cbuf, 1, idata, tilelen);  /* uncompress the data */
        tiledatatype = TINT;

    /* ************************************************************* */
    } else if ( ((infptr->Fptr)->compress_type == GZIP_1) ||
                ((infptr->Fptr)->compress_type == GZIP_2) ) {

        uncompress2mem_from_mem ((char *)cbuf, (long) nelemll,
             (char **) &idata, &idatalen, realloc, &tilebytesize, status);

        /* determine the data type of the uncompressed array, and */
	/*  do byte unshuffling and unswapping if needed */
	if (tilebytesize == (size_t) (tilelen * 2)) {
	    /* this is a short I*2 array */
            tiledatatype = TSHORT;

            if ( (infptr->Fptr)->compress_type == GZIP_2 )
		    fits_unshuffle_2bytes((char *) idata, tilelen, status);

#if BYTESWAPPED
            ffswap2((short *) idata, tilelen);
#endif

	} else if (tilebytesize == (size_t) (tilelen * 4)) {
	    /* this is a int I*4 array (or maybe R*4) */
            tiledatatype = TINT;

            if ( (infptr->Fptr)->compress_type == GZIP_2 )
		    fits_unshuffle_4bytes((char *) idata, tilelen, status);

#if BYTESWAPPED
            ffswap4(idata, tilelen);
#endif

	} else if (tilebytesize == (size_t) (tilelen * 8)) {
	    /* this is a R*8 double array */
            tiledatatype = TDOUBLE;

            if ( (infptr->Fptr)->compress_type == GZIP_2 )
		    fits_unshuffle_8bytes((char *) idata, tilelen, status);
#if BYTESWAPPED
            ffswap8((double *) idata, tilelen);
#endif

        } else if (tilebytesize == (size_t) tilelen) {
	    
	    /* this is an unsigned char I*1 array */
            tiledatatype = TBYTE;

        } else {
            ffpmsg("error: uncompressed tile has wrong size");
            free(idata);
            return (*status = DATA_DECOMPRESSION_ERR);
        }

    /* ************************************************************* */
    } else if ((infptr->Fptr)->compress_type == BZIP2_1) {

/*  BZIP2 is not supported in the public release; this is only for test purposes 

        if (BZ2_bzBuffToBuffDecompress ((char *) idata, &idatalen, 
		(char *)cbuf, (unsigned int) nelemll, 0, 0) )
*/
        {
            ffpmsg("bzip2 decompression error");
            free(idata);
            free (cbuf);
            return (*status = DATA_DECOMPRESSION_ERR);
        }

        if ((infptr->Fptr)->zbitpix == BYTE_IMG) {
	     tiledatatype = TBYTE;
        } else if ((infptr->Fptr)->zbitpix == SHORT_IMG) {
  	     tiledatatype = TSHORT;
#if BYTESWAPPED
            ffswap2((short *) idata, tilelen);
#endif
	} else {
  	     tiledatatype = TINT;
#if BYTESWAPPED
            ffswap4(idata, tilelen);
#endif
	}

    /* ************************************************************* */
    } else {
        ffpmsg("unknown compression algorithm");
        free(idata);
        return (*status = DATA_DECOMPRESSION_ERR);
    }

    free(cbuf);
    if (*status)  {  /* error uncompressing the tile */
            free(idata);
            return (*status);
    }

    /* ************************************************************* */
    /* copy the uncompressed tile data to the output buffer, doing */
    /* null checking, datatype conversion and linear scaling, if necessary */

    if (nulval == 0)
         nulval = &dummy;  /* set address to dummy value */

    if (datatype == TSHORT)
    {
        pixlen = sizeof(short);

	if ((infptr->Fptr)->quantize_level == NO_QUANTIZE) {
	 /* the floating point pixels were losselessly compressed with GZIP */
	 /* Just have to copy the values to the output array */
	 
          if (tiledatatype == TINT) {
              fffr4i2((float *) idata, tilelen, bscale, bzero, nullcheck,   
                *(short *) nulval, bnullarray, anynul,
                (short *) buffer, status);
          } else {
              fffr8i2((double *) idata, tilelen, bscale, bzero, nullcheck,   
                *(short *) nulval, bnullarray, anynul,
                (short *) buffer, status);
          }
        } else if (tiledatatype == TINT) {
          if ((infptr->Fptr)->compress_type == PLIO_1 && actual_bzero == 32768.) {
	    /* special case where unsigned 16-bit integers have been */
	    /* offset by +32768 when using PLIO */
            fffi4i2(idata, tilelen, bscale, bzero - 32768., nullcheck, tnull,
             *(short *) nulval, bnullarray, anynul,
            (short *) buffer, status);
          } else {
            fffi4i2(idata, tilelen, bscale, bzero, nullcheck, tnull,
             *(short *) nulval, bnullarray, anynul,
            (short *) buffer, status);

            /*
	       Hcompress is a special case:  ignore any numerical overflow
	       errors that may have occurred during the integer*4 to integer*2
	       convertion.  Overflows can happen when a lossy Hcompress algorithm
	       is invoked (with a non-zero scale factor).  The fffi4i2 routine
	       clips the returned values to be within the legal I*2 range, so
	       all we need to is to reset the error status to zero.
	    */
	       
             if ((infptr->Fptr)->compress_type == HCOMPRESS_1) {
                if ((*status == NUM_OVERFLOW) || (*status == OVERFLOW_ERR))
                        *status = 0;
             }
          }
        } else if (tiledatatype == TSHORT) {
          fffi2i2((short *)idata, tilelen, bscale, bzero, nullcheck, (short) tnull,
           *(short *) nulval, bnullarray, anynul,
          (short *) buffer, status);
        } else if (tiledatatype == TBYTE) {
          fffi1i2((unsigned char *)idata, tilelen, bscale, bzero, nullcheck, (unsigned char) tnull,
           *(short *) nulval, bnullarray, anynul,
          (short *) buffer, status);
        }
    }
    else if (datatype == TINT)
    {
        pixlen = sizeof(int);

	if ((infptr->Fptr)->quantize_level == NO_QUANTIZE) {
	 /* the floating point pixels were losselessly compressed with GZIP */
	 /* Just have to copy the values to the output array */
	 
          if (tiledatatype == TINT) {
              fffr4int((float *) idata, tilelen, bscale, bzero, nullcheck,   
                *(int *) nulval, bnullarray, anynul,
                (int *) buffer, status);
          } else {
              fffr8int((double *) idata, tilelen, bscale, bzero, nullcheck,   
                *(int *) nulval, bnullarray, anynul,
                (int *) buffer, status);
          }
        } else if (tiledatatype == TINT)
          if ((infptr->Fptr)->compress_type == PLIO_1 && actual_bzero == 32768.) {
	    /* special case where unsigned 16-bit integers have been */
	    /* offset by +32768 when using PLIO */
            fffi4int(idata, (long) tilelen, bscale, bzero - 32768., nullcheck, tnull,
             *(int *) nulval, bnullarray, anynul,
            (int *) buffer, status);
          } else {
            fffi4int(idata, (long) tilelen, bscale, bzero, nullcheck, tnull,
             *(int *) nulval, bnullarray, anynul,
            (int *) buffer, status);
          } 
        else if (tiledatatype == TSHORT)
          fffi2int((short *)idata, tilelen, bscale, bzero, nullcheck, (short) tnull,
           *(int *) nulval, bnullarray, anynul,
           (int *) buffer, status);
        else if (tiledatatype == TBYTE)
          fffi1int((unsigned char *)idata, tilelen, bscale, bzero, nullcheck, (unsigned char) tnull,
           *(int *) nulval, bnullarray, anynul,
           (int *) buffer, status);
    }
    else if (datatype == TLONG)
    {
        pixlen = sizeof(long);

	if ((infptr->Fptr)->quantize_level == NO_QUANTIZE) {
	 /* the floating point pixels were losselessly compressed with GZIP */
	 /* Just have to copy the values to the output array */
	 
          if (tiledatatype == TINT) {
              fffr4i4((float *) idata, tilelen, bscale, bzero, nullcheck,   
                *(long *) nulval, bnullarray, anynul,
                (long *) buffer, status);
          } else {
              fffr8i4((double *) idata, tilelen, bscale, bzero, nullcheck,   
                *(long *) nulval, bnullarray, anynul,
                (long *) buffer, status);
          }
        } else if (tiledatatype == TINT)
          if ((infptr->Fptr)->compress_type == PLIO_1 && actual_bzero == 32768.) {
	    /* special case where unsigned 16-bit integers have been */
	    /* offset by +32768 when using PLIO */
            fffi4i4(idata, tilelen, bscale, bzero - 32768., nullcheck, tnull,
             *(long *) nulval, bnullarray, anynul,
             (long *) buffer, status);
          } else {
            fffi4i4(idata, tilelen, bscale, bzero, nullcheck, tnull,
             *(long *) nulval, bnullarray, anynul,
              (long *) buffer, status);
          }
        else if (tiledatatype == TSHORT)
          fffi2i4((short *)idata, tilelen, bscale, bzero, nullcheck, (short) tnull,
           *(long *) nulval, bnullarray, anynul,
            (long *) buffer, status);
        else if (tiledatatype == TBYTE)
          fffi1i4((unsigned char *)idata, tilelen, bscale, bzero, nullcheck, (unsigned char) tnull,
           *(long *) nulval, bnullarray, anynul,
            (long *) buffer, status);
    }
    else if (datatype == TFLOAT)
    {
        pixlen = sizeof(float);
        if (nulval) {
	      fnulval = *(float *) nulval;
	}
 
	if ((infptr->Fptr)->quantize_level == NO_QUANTIZE) {
	 /* the floating point pixels were losselessly compressed with GZIP */
	 /* Just have to copy the values to the output array */
	 
          if (tiledatatype == TINT) {
              fffr4r4((float *) idata, tilelen, bscale, bzero, nullcheck,   
                fnulval, bnullarray, anynul,
                (float *) buffer, status);
          } else {
              fffr8r4((double *) idata, tilelen, bscale, bzero, nullcheck,   
                fnulval, bnullarray, anynul,
                (float *) buffer, status);
          }
	
        } else if ((infptr->Fptr)->quantize_method == SUBTRACTIVE_DITHER_1 ||
	           (infptr->Fptr)->quantize_method == SUBTRACTIVE_DITHER_2) {

         /* use the new dithering algorithm (introduced in July 2009) */

         if (tiledatatype == TINT)
          unquantize_i4r4(nrow + (infptr->Fptr)->dither_seed - 1, idata, 
	   tilelen, bscale, bzero, (infptr->Fptr)->quantize_method, nullcheck, tnull,
           fnulval, bnullarray, anynul,
            (float *) buffer, status);
         else if (tiledatatype == TSHORT)
          unquantize_i2r4(nrow + (infptr->Fptr)->dither_seed - 1, (short *)idata, 
	   tilelen, bscale, bzero, (infptr->Fptr)->quantize_method, nullcheck, (short) tnull,
           fnulval, bnullarray, anynul,
            (float *) buffer, status);
         else if (tiledatatype == TBYTE)
          unquantize_i1r4(nrow + (infptr->Fptr)->dither_seed - 1, (unsigned char *)idata, 
	   tilelen, bscale, bzero, (infptr->Fptr)->quantize_method, nullcheck, (unsigned char) tnull,
           fnulval, bnullarray, anynul,
            (float *) buffer, status);

        } else {  /* use the old "round to nearest level" quantization algorithm */

         if (tiledatatype == TINT)
          if ((infptr->Fptr)->compress_type == PLIO_1 && actual_bzero == 32768.) {
	    /* special case where unsigned 16-bit integers have been */
	    /* offset by +32768 when using PLIO */
            fffi4r4(idata, tilelen, bscale, bzero - 32768., nullcheck, tnull,
             fnulval, bnullarray, anynul,
             (float *) buffer, status);
          } else {
            fffi4r4(idata, tilelen, bscale, bzero, nullcheck, tnull,  
             fnulval, bnullarray, anynul,
              (float *) buffer, status);
          }
         else if (tiledatatype == TSHORT)
          fffi2r4((short *)idata, tilelen, bscale, bzero, nullcheck, (short) tnull,  
           fnulval, bnullarray, anynul,
            (float *) buffer, status);
         else if (tiledatatype == TBYTE)
          fffi1r4((unsigned char *)idata, tilelen, bscale, bzero, nullcheck, (unsigned char) tnull,
           fnulval, bnullarray, anynul,
            (float *) buffer, status);
	}
    }
    else if (datatype == TDOUBLE)
    {
        pixlen = sizeof(double);
        if (nulval) {
	     dnulval = *(double *) nulval;
	}

	if ((infptr->Fptr)->quantize_level == NO_QUANTIZE) {
	 /* the floating point pixels were losselessly compressed with GZIP */
	 /* Just have to copy the values to the output array */

          if (tiledatatype == TINT) {
              fffr4r8((float *) idata, tilelen, bscale, bzero, nullcheck,   
                dnulval, bnullarray, anynul,
                (double *) buffer, status);
          } else {
              fffr8r8((double *) idata, tilelen, bscale, bzero, nullcheck,   
                dnulval, bnullarray, anynul,
                (double *) buffer, status);
          }
	
	} else if ((infptr->Fptr)->quantize_method == SUBTRACTIVE_DITHER_1 ||
	           (infptr->Fptr)->quantize_method == SUBTRACTIVE_DITHER_2) {

         /* use the new dithering algorithm (introduced in July 2009) */
         if (tiledatatype == TINT)
          unquantize_i4r8(nrow + (infptr->Fptr)->dither_seed - 1, idata,
	   tilelen, bscale, bzero, (infptr->Fptr)->quantize_method, nullcheck, tnull,
           dnulval, bnullarray, anynul,
            (double *) buffer, status);
         else if (tiledatatype == TSHORT)
          unquantize_i2r8(nrow + (infptr->Fptr)->dither_seed - 1, (short *)idata,
	   tilelen, bscale, bzero, (infptr->Fptr)->quantize_method, nullcheck, (short) tnull,
           dnulval, bnullarray, anynul,
            (double *) buffer, status);
         else if (tiledatatype == TBYTE)
          unquantize_i1r8(nrow + (infptr->Fptr)->dither_seed - 1, (unsigned char *)idata,
	   tilelen, bscale, bzero, (infptr->Fptr)->quantize_method, nullcheck, (unsigned char) tnull,
           dnulval, bnullarray, anynul,
            (double *) buffer, status);

        } else {  /* use the old "round to nearest level" quantization algorithm */

         if (tiledatatype == TINT) {
          if ((infptr->Fptr)->compress_type == PLIO_1 && actual_bzero == 32768.) {
	    /* special case where unsigned 16-bit integers have been */
	    /* offset by +32768 when using PLIO */
            fffi4r8(idata, tilelen, bscale, bzero - 32768., nullcheck, tnull,
             dnulval, bnullarray, anynul,
             (double *) buffer, status);
          } else {
            fffi4r8(idata, tilelen, bscale, bzero, nullcheck, tnull,
             dnulval, bnullarray, anynul,
              (double *) buffer, status);
          }
         } else if (tiledatatype == TSHORT) {
          fffi2r8((short *)idata, tilelen, bscale, bzero, nullcheck, (short) tnull,
           dnulval, bnullarray, anynul,
            (double *) buffer, status);
         } else if (tiledatatype == TBYTE)
          fffi1r8((unsigned char *)idata, tilelen, bscale, bzero, nullcheck, (unsigned char) tnull,
           dnulval, bnullarray, anynul,
            (double *) buffer, status);
	}
    }
    else if (datatype == TBYTE)
    {
        pixlen = sizeof(char);
        if (tiledatatype == TINT)
          fffi4i1(idata, tilelen, bscale, bzero, nullcheck, tnull,
           *(unsigned char *) nulval, bnullarray, anynul,
            (unsigned char *) buffer, status);
        else if (tiledatatype == TSHORT)
          fffi2i1((short *)idata, tilelen, bscale, bzero, nullcheck, (short) tnull,
           *(unsigned char *) nulval, bnullarray, anynul,
            (unsigned char *) buffer, status);
        else if (tiledatatype == TBYTE)
          fffi1i1((unsigned char *)idata, tilelen, bscale, bzero, nullcheck, (unsigned char) tnull,
           *(unsigned char *) nulval, bnullarray, anynul,
            (unsigned char *) buffer, status);
    }
    else if (datatype == TSBYTE)
    {
        pixlen = sizeof(char);
        if (tiledatatype == TINT)
          fffi4s1(idata, tilelen, bscale, bzero, nullcheck, tnull,
           *(signed char *) nulval, bnullarray, anynul,
            (signed char *) buffer, status);
        else if (tiledatatype == TSHORT)
          fffi2s1((short *)idata, tilelen, bscale, bzero, nullcheck, (short) tnull,
           *(signed char *) nulval, bnullarray, anynul,
            (signed char *) buffer, status);
        else if (tiledatatype == TBYTE)
          fffi1s1((unsigned char *)idata, tilelen, bscale, bzero, nullcheck, (unsigned char) tnull,
           *(signed char *) nulval, bnullarray, anynul,
            (signed char *) buffer, status);
    }
    else if (datatype == TUSHORT)
    {
        pixlen = sizeof(short);

	if ((infptr->Fptr)->quantize_level == NO_QUANTIZE) {
	 /* the floating point pixels were losselessly compressed with GZIP */
	 /* Just have to copy the values to the output array */
	 
          if (tiledatatype == TINT) {
              fffr4u2((float *) idata, tilelen, bscale, bzero, nullcheck,   
                *(unsigned short *) nulval, bnullarray, anynul,
                (unsigned short *) buffer, status);
          } else {
              fffr8u2((double *) idata, tilelen, bscale, bzero, nullcheck,   
                *(unsigned short *) nulval, bnullarray, anynul,
                (unsigned short *) buffer, status);
          }
        } else if (tiledatatype == TINT)
          if ((infptr->Fptr)->compress_type == PLIO_1 && actual_bzero == 32768.) {
	    /* special case where unsigned 16-bit integers have been */
	    /* offset by +32768 when using PLIO */
            fffi4u2(idata, tilelen, bscale, bzero - 32768., nullcheck, tnull,
             *(unsigned short *) nulval, bnullarray, anynul,
            (unsigned short *) buffer, status);
          } else {
            fffi4u2(idata, tilelen, bscale, bzero, nullcheck, tnull,
             *(unsigned short *) nulval, bnullarray, anynul,
              (unsigned short *) buffer, status);
          }
        else if (tiledatatype == TSHORT)
          fffi2u2((short *)idata, tilelen, bscale, bzero, nullcheck, (short) tnull,
           *(unsigned short *) nulval, bnullarray, anynul,
            (unsigned short *) buffer, status);
        else if (tiledatatype == TBYTE)
          fffi1u2((unsigned char *)idata, tilelen, bscale, bzero, nullcheck, (unsigned char) tnull,
           *(unsigned short *) nulval, bnullarray, anynul,
            (unsigned short *) buffer, status);
    }
    else if (datatype == TUINT)
    {
        pixlen = sizeof(int);

	if ((infptr->Fptr)->quantize_level == NO_QUANTIZE) {
	 /* the floating point pixels were losselessly compressed with GZIP */
	 /* Just have to copy the values to the output array */
	 
          if (tiledatatype == TINT) {
              fffr4uint((float *) idata, tilelen, bscale, bzero, nullcheck,   
                *(unsigned int *) nulval, bnullarray, anynul,
                (unsigned int *) buffer, status);
          } else {
              fffr8uint((double *) idata, tilelen, bscale, bzero, nullcheck,   
                *(unsigned int *) nulval, bnullarray, anynul,
                (unsigned int *) buffer, status);
          }
        } else
         if (tiledatatype == TINT)
          if ((infptr->Fptr)->compress_type == PLIO_1 && actual_bzero == 32768.) {
	    /* special case where unsigned 16-bit integers have been */
	    /* offset by +32768 when using PLIO */
            fffi4uint(idata, tilelen, bscale, bzero - 32768., nullcheck, tnull,
             *(unsigned int *) nulval, bnullarray, anynul,
              (unsigned int *) buffer, status);
          } else {
            fffi4uint(idata, tilelen, bscale, bzero, nullcheck, tnull,
             *(unsigned int *) nulval, bnullarray, anynul,
              (unsigned int *) buffer, status);
          }
        else if (tiledatatype == TSHORT)
          fffi2uint((short *)idata, tilelen, bscale, bzero, nullcheck, (short) tnull,
           *(unsigned int *) nulval, bnullarray, anynul,
            (unsigned int *) buffer, status);
        else if (tiledatatype == TBYTE)
          fffi1uint((unsigned char *)idata, tilelen, bscale, bzero, nullcheck, (unsigned char) tnull,
           *(unsigned int *) nulval, bnullarray, anynul,
            (unsigned int *) buffer, status);
    }
    else if (datatype == TULONG)
    {
        pixlen = sizeof(long);

	if ((infptr->Fptr)->quantize_level == NO_QUANTIZE) {
	 /* the floating point pixels were losselessly compressed with GZIP */
	 /* Just have to copy the values to the output array */
	 
          if (tiledatatype == TINT) {
              fffr4u4((float *) idata, tilelen, bscale, bzero, nullcheck,   
                *(unsigned long *) nulval, bnullarray, anynul,
                (unsigned long *) buffer, status);
          } else {
              fffr8u4((double *) idata, tilelen, bscale, bzero, nullcheck,   
                *(unsigned long *) nulval, bnullarray, anynul,
                (unsigned long *) buffer, status);
          }
        } else if (tiledatatype == TINT)
          if ((infptr->Fptr)->compress_type == PLIO_1 && actual_bzero == 32768.) {
	    /* special case where unsigned 16-bit integers have been */
	    /* offset by +32768 when using PLIO */
            fffi4u4(idata, tilelen, bscale, bzero - 32768., nullcheck, tnull,
             *(unsigned long *) nulval, bnullarray, anynul,
              (unsigned long *) buffer, status);
          } else {
            fffi4u4(idata, tilelen, bscale, bzero, nullcheck, tnull,
             *(unsigned long *) nulval, bnullarray, anynul, 
              (unsigned long *) buffer, status);
          }
        else if (tiledatatype == TSHORT)
          fffi2u4((short *)idata, tilelen, bscale, bzero, nullcheck, (short) tnull,
           *(unsigned long *) nulval, bnullarray, anynul, 
            (unsigned long *) buffer, status);
        else if (tiledatatype == TBYTE)
          fffi1u4((unsigned char *)idata, tilelen, bscale, bzero, nullcheck, (unsigned char) tnull,
           *(unsigned long *) nulval, bnullarray, anynul, 
            (unsigned long *) buffer, status);
    }
    else
         *status = BAD_DATATYPE;

    free(idata);  /* don't need the uncompressed tile any more */

    /* **************************************************************** */
    /* cache the tile, in case the application wants it again  */

    /*   Don't cache the tile if tile is a single row of the image; 
         it is less likely that the cache will be used in this cases,
	 so it is not worth the time and the memory overheads.
    */
    
    if ((infptr->Fptr)->tilerow)  {  /* make sure cache has been allocated */
     if ((infptr->Fptr)->znaxis[0]   != (infptr->Fptr)->tilesize[0] ||
        (infptr->Fptr)->tilesize[1] != 1 )
     {
      tilesize = pixlen * tilelen;

      /* check that tile size/type has not changed */
      if (tilesize != (infptr->Fptr)->tiledatasize[tilecol] ||
        datatype != (infptr->Fptr)->tiletype[tilecol] )  {

        if (((infptr->Fptr)->tiledata)[tilecol]) {
            free(((infptr->Fptr)->tiledata)[tilecol]);	    
        }
	
        if (((infptr->Fptr)->tilenullarray)[tilecol]) {
            free(((infptr->Fptr)->tilenullarray)[tilecol]);
        }
	
        ((infptr->Fptr)->tilenullarray)[tilecol] = 0;
        ((infptr->Fptr)->tilerow)[tilecol] = 0;
        ((infptr->Fptr)->tiledatasize)[tilecol] = 0;
        ((infptr->Fptr)->tiletype)[tilecol] = 0;

        /* allocate new array(s) */
	((infptr->Fptr)->tiledata)[tilecol] = malloc(tilesize);

	if (((infptr->Fptr)->tiledata)[tilecol] == 0)
	   return (*status);

        if (nullcheck == 2) {  /* also need array of null pixel flags */
	    (infptr->Fptr)->tilenullarray[tilecol] = malloc(tilelen);
	    if ((infptr->Fptr)->tilenullarray[tilecol] == 0)
	        return (*status);
        }

        (infptr->Fptr)->tiledatasize[tilecol] = tilesize;
        (infptr->Fptr)->tiletype[tilecol] = datatype;
      }

      /* copy the tile array(s) into cache buffer */
      memcpy((infptr->Fptr)->tiledata[tilecol], buffer, tilesize);

      if (nullcheck == 2) {
	    if ((infptr->Fptr)->tilenullarray == 0)  {
       	      (infptr->Fptr)->tilenullarray[tilecol] = malloc(tilelen);
            }
            memcpy((infptr->Fptr)->tilenullarray[tilecol], bnullarray, tilelen);
      }

      (infptr->Fptr)->tilerow[tilecol] = nrow;
      (infptr->Fptr)->tileanynull[tilecol] = *anynul;
     }
    }
    return (*status);
}
/*--------------------------------------------------------------------------*/
int imcomp_test_overlap (
    int ndim,           /* I - number of dimension in the tile and image */
    long *tfpixel,      /* I - first pixel number in each dim. of the tile */
    long *tlpixel,      /* I - last pixel number in each dim. of the tile */
    long *fpixel,       /* I - first pixel number in each dim. of the image */
    long *lpixel,       /* I - last pixel number in each dim. of the image */
    long *ininc,        /* I - increment to be applied in each image dimen. */
    int *status)

/* 
  test if there are any intersecting pixels between this tile and the section
  of the image defined by fixel, lpixel, ininc. 
*/
{
    long imgdim[MAX_COMPRESS_DIM]; /* product of preceding dimensions in the */
                                   /* output image, allowing for inc factor */
    long tiledim[MAX_COMPRESS_DIM]; /* product of preceding dimensions in the */
                                 /* tile, array;  inc factor is not relevant */
    long imgfpix[MAX_COMPRESS_DIM]; /* 1st img pix overlapping tile: 0 base, */
                                    /*  allowing for inc factor */
    long imglpix[MAX_COMPRESS_DIM]; /* last img pix overlapping tile 0 base, */
                                    /*  allowing for inc factor */
    long tilefpix[MAX_COMPRESS_DIM]; /* 1st tile pix overlapping img 0 base, */
                                    /*  allowing for inc factor */
    long inc[MAX_COMPRESS_DIM]; /* local copy of input ininc */
    int ii;
    long tf, tl;

    if (*status > 0)
        return(*status);


    /* ------------------------------------------------------------ */
    /* calc amount of overlap in each dimension; if there is zero   */
    /* overlap in any dimension then just return  */
    /* ------------------------------------------------------------ */
    
    for (ii = 0; ii < ndim; ii++)
    {
        if (tlpixel[ii] < fpixel[ii] || tfpixel[ii] > lpixel[ii])
            return(0);  /* there are no overlapping pixels */

        inc[ii] = ininc[ii];

        /* calc dimensions of the output image section */
        imgdim[ii] = (lpixel[ii] - fpixel[ii]) / labs(inc[ii]) + 1;
        if (imgdim[ii] < 1) {
            *status = NEG_AXIS;
            return(0);
        }

        /* calc dimensions of the tile */
        tiledim[ii] = tlpixel[ii] - tfpixel[ii] + 1;
        if (tiledim[ii] < 1) {
            *status = NEG_AXIS;
            return(0);
        }

        if (ii > 0)
           tiledim[ii] *= tiledim[ii - 1];  /* product of dimensions */

        /* first and last pixels in image that overlap with the tile, 0 base */
        tf = tfpixel[ii] - 1;
        tl = tlpixel[ii] - 1;

        /* skip this plane if it falls in the cracks of the subsampled image */
        while ((tf-(fpixel[ii] - 1)) % labs(inc[ii]))
        {
           tf++;
           if (tf > tl)
             return(0);  /* no overlapping pixels */
        }

        while ((tl-(fpixel[ii] - 1)) % labs(inc[ii]))
        {
           tl--;
           if (tf > tl)
             return(0);  /* no overlapping pixels */
        }
        imgfpix[ii] = maxvalue((tf - fpixel[ii] +1) / labs(inc[ii]) , 0);
        imglpix[ii] = minvalue((tl - fpixel[ii] +1) / labs(inc[ii]) ,
                               imgdim[ii] - 1);

        /* first pixel in the tile that overlaps with the image (0 base) */
        tilefpix[ii] = maxvalue(fpixel[ii] - tfpixel[ii], 0);

        while ((tfpixel[ii] + tilefpix[ii] - fpixel[ii]) % labs(inc[ii]))
        {
           (tilefpix[ii])++;
           if (tilefpix[ii] >= tiledim[ii])
              return(0);  /* no overlapping pixels */
        }

        if (ii > 0)
           imgdim[ii] *= imgdim[ii - 1];  /* product of dimensions */
    }

    return(1);  /* there appears to be  intersecting pixels */
}
/*--------------------------------------------------------------------------*/
int imcomp_copy_overlap (
    char *tile,         /* I - multi dimensional array of tile pixels */
    int pixlen,         /* I - number of bytes in each tile or image pixel */
    int ndim,           /* I - number of dimension in the tile and image */
    long *tfpixel,      /* I - first pixel number in each dim. of the tile */
    long *tlpixel,      /* I - last pixel number in each dim. of the tile */
    char *bnullarray,   /* I - array of null flags; used if nullcheck = 2 */
    char *image,        /* O - multi dimensional output image */
    long *fpixel,       /* I - first pixel number in each dim. of the image */
    long *lpixel,       /* I - last pixel number in each dim. of the image */
    long *ininc,        /* I - increment to be applied in each image dimen. */
    int nullcheck,      /* I - 0, 1: do nothing; 2: set nullarray for nulls */
    char *nullarray, 
    int *status)

/* 
  copy the intersecting pixels from a decompressed tile to the output image. 
  Both the tile and the image must have the same number of dimensions. 
*/
{
    long imgdim[MAX_COMPRESS_DIM]; /* product of preceding dimensions in the */
                                   /* output image, allowing for inc factor */
    long tiledim[MAX_COMPRESS_DIM]; /* product of preceding dimensions in the */
                                 /* tile, array;  inc factor is not relevant */
    long imgfpix[MAX_COMPRESS_DIM]; /* 1st img pix overlapping tile: 0 base, */
                                    /*  allowing for inc factor */
    long imglpix[MAX_COMPRESS_DIM]; /* last img pix overlapping tile 0 base, */
                                    /*  allowing for inc factor */
    long tilefpix[MAX_COMPRESS_DIM]; /* 1st tile pix overlapping img 0 base, */
                                    /*  allowing for inc factor */
    long inc[MAX_COMPRESS_DIM]; /* local copy of input ininc */
    long i1, i2, i3, i4;   /* offset along each axis of the image */
    long it1, it2, it3, it4;
    long im1, im2, im3, im4;  /* offset to image pixel, allowing for inc */
    long ipos, tf, tl;
    long t2, t3, t4;   /* offset along each axis of the tile */
    long tilepix, imgpix, tilepixbyte, imgpixbyte;
    int ii, overlap_bytes, overlap_flags;

    if (*status > 0)
        return(*status);

    for (ii = 0; ii < MAX_COMPRESS_DIM; ii++)
    {
        /* set default values for higher dimensions */
        inc[ii] = 1;
        imgdim[ii] = 1;
        tiledim[ii] = 1;
        imgfpix[ii] = 0;
        imglpix[ii] = 0;
        tilefpix[ii] = 0;
    }

    /* ------------------------------------------------------------ */
    /* calc amount of overlap in each dimension; if there is zero   */
    /* overlap in any dimension then just return  */
    /* ------------------------------------------------------------ */
    
    for (ii = 0; ii < ndim; ii++)
    {
        if (tlpixel[ii] < fpixel[ii] || tfpixel[ii] > lpixel[ii])
            return(*status);  /* there are no overlapping pixels */

        inc[ii] = ininc[ii];

        /* calc dimensions of the output image section */
        imgdim[ii] = (lpixel[ii] - fpixel[ii]) / labs(inc[ii]) + 1;
        if (imgdim[ii] < 1)
            return(*status = NEG_AXIS);

        /* calc dimensions of the tile */
        tiledim[ii] = tlpixel[ii] - tfpixel[ii] + 1;
        if (tiledim[ii] < 1)
            return(*status = NEG_AXIS);

        if (ii > 0)
           tiledim[ii] *= tiledim[ii - 1];  /* product of dimensions */

        /* first and last pixels in image that overlap with the tile, 0 base */
        tf = tfpixel[ii] - 1;
        tl = tlpixel[ii] - 1;

        /* skip this plane if it falls in the cracks of the subsampled image */
        while ((tf-(fpixel[ii] - 1)) % labs(inc[ii]))
        {
           tf++;
           if (tf > tl)
             return(*status);  /* no overlapping pixels */
        }

        while ((tl-(fpixel[ii] - 1)) % labs(inc[ii]))
        {
           tl--;
           if (tf > tl)
             return(*status);  /* no overlapping pixels */
        }
        imgfpix[ii] = maxvalue((tf - fpixel[ii] +1) / labs(inc[ii]) , 0);
        imglpix[ii] = minvalue((tl - fpixel[ii] +1) / labs(inc[ii]) ,
                               imgdim[ii] - 1);

        /* first pixel in the tile that overlaps with the image (0 base) */
        tilefpix[ii] = maxvalue(fpixel[ii] - tfpixel[ii], 0);

        while ((tfpixel[ii] + tilefpix[ii] - fpixel[ii]) % labs(inc[ii]))
        {
           (tilefpix[ii])++;
           if (tilefpix[ii] >= tiledim[ii])
              return(*status);  /* no overlapping pixels */
        }
/*
printf("ii tfpixel, tlpixel %d %d %d \n",ii, tfpixel[ii], tlpixel[ii]);
printf("ii, tf, tl, imgfpix,imglpix, tilefpix %d %d %d %d %d %d\n",ii,
 tf,tl,imgfpix[ii], imglpix[ii],tilefpix[ii]);
*/
        if (ii > 0)
           imgdim[ii] *= imgdim[ii - 1];  /* product of dimensions */
    }

    /* ---------------------------------------------------------------- */
    /* calc number of pixels in each row (first dimension) that overlap */
    /* multiply by pixlen to get number of bytes to copy in each loop   */
    /* ---------------------------------------------------------------- */

    if (inc[0] != 1)
       overlap_flags = 1;  /* can only copy 1 pixel at a time */
    else
       overlap_flags = imglpix[0] - imgfpix[0] + 1;  /* can copy whole row */

    overlap_bytes = overlap_flags * pixlen;

    /* support up to 5 dimensions for now */
    for (i4 = 0, it4=0; i4 <= imglpix[4] - imgfpix[4]; i4++, it4++)
    {
     /* increment plane if it falls in the cracks of the subsampled image */
     while (ndim > 4 &&  (tfpixel[4] + tilefpix[4] - fpixel[4] + it4)
                          % labs(inc[4]) != 0)
        it4++;

       /* offset to start of hypercube */
       if (inc[4] > 0)
          im4 = (i4 + imgfpix[4]) * imgdim[3];
       else
          im4 = imgdim[4] - (i4 + 1 + imgfpix[4]) * imgdim[3];

      t4 = (tilefpix[4] + it4) * tiledim[3];
      for (i3 = 0, it3=0; i3 <= imglpix[3] - imgfpix[3]; i3++, it3++)
      {
       /* increment plane if it falls in the cracks of the subsampled image */
       while (ndim > 3 &&  (tfpixel[3] + tilefpix[3] - fpixel[3] + it3)
                            % labs(inc[3]) != 0)
          it3++;

       /* offset to start of cube */
       if (inc[3] > 0)
          im3 = (i3 + imgfpix[3]) * imgdim[2] + im4;
       else
          im3 = imgdim[3] - (i3 + 1 + imgfpix[3]) * imgdim[2] + im4;

       t3 = (tilefpix[3] + it3) * tiledim[2] + t4;

       /* loop through planes of the image */
       for (i2 = 0, it2=0; i2 <= imglpix[2] - imgfpix[2]; i2++, it2++)
       {
          /* incre plane if it falls in the cracks of the subsampled image */
          while (ndim > 2 &&  (tfpixel[2] + tilefpix[2] - fpixel[2] + it2)
                               % labs(inc[2]) != 0)
             it2++;

          /* offset to start of plane */
          if (inc[2] > 0)
             im2 = (i2 + imgfpix[2]) * imgdim[1] + im3;
          else
             im2 = imgdim[2] - (i2 + 1 + imgfpix[2]) * imgdim[1] + im3;

          t2 = (tilefpix[2] + it2) * tiledim[1] + t3;

          /* loop through rows of the image */
          for (i1 = 0, it1=0; i1 <= imglpix[1] - imgfpix[1]; i1++, it1++)
          {
             /* incre row if it falls in the cracks of the subsampled image */
             while (ndim > 1 &&  (tfpixel[1] + tilefpix[1] - fpixel[1] + it1)
                                  % labs(inc[1]) != 0)
                it1++;

             /* calc position of first pixel in tile to be copied */
             tilepix = tilefpix[0] + (tilefpix[1] + it1) * tiledim[0] + t2;

             /* offset to start of row */
             if (inc[1] > 0)
                im1 = (i1 + imgfpix[1]) * imgdim[0] + im2;
             else
                im1 = imgdim[1] - (i1 + 1 + imgfpix[1]) * imgdim[0] + im2;
/*
printf("inc = %d %d %d %d\n",inc[0],inc[1],inc[2],inc[3]);
printf("im1,im2,im3,im4 = %d %d %d %d\n",im1,im2,im3,im4);
*/
             /* offset to byte within the row */
             if (inc[0] > 0)
                imgpix = imgfpix[0] + im1;
             else
                imgpix = imgdim[0] - 1 - imgfpix[0] + im1;
/*
printf("tilefpix0,1, imgfpix1, it1, inc1, t2= %d %d %d %d %d %d\n",
       tilefpix[0],tilefpix[1],imgfpix[1],it1,inc[1], t2);
printf("i1, it1, tilepix, imgpix %d %d %d %d \n", i1, it1, tilepix, imgpix);
*/
             /* loop over pixels along one row of the image */
             for (ipos = imgfpix[0]; ipos <= imglpix[0]; ipos += overlap_flags)
             {
               if (nullcheck == 2)
               {
                   /* copy overlapping null flags from tile to image */
                   memcpy(nullarray + imgpix, bnullarray + tilepix,
                          overlap_flags);
               }

               /* convert from image pixel to byte offset */
               tilepixbyte = tilepix * pixlen;
               imgpixbyte  = imgpix  * pixlen;
/*
printf("  tilepix, tilepixbyte, imgpix, imgpixbyte= %d %d %d %d\n",
          tilepix, tilepixbyte, imgpix, imgpixbyte);
*/
               /* copy overlapping row of pixels from tile to image */
               memcpy(image + imgpixbyte, tile + tilepixbyte, overlap_bytes);

               tilepix += (overlap_flags * labs(inc[0]));
               if (inc[0] > 0)
                 imgpix += overlap_flags;
               else
                 imgpix -= overlap_flags;
            }
          }
        }
      }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int imcomp_merge_overlap (
    char *tile,         /* O - multi dimensional array of tile pixels */
    int pixlen,         /* I - number of bytes in each tile or image pixel */
    int ndim,           /* I - number of dimension in the tile and image */
    long *tfpixel,      /* I - first pixel number in each dim. of the tile */
    long *tlpixel,      /* I - last pixel number in each dim. of the tile */
    char *bnullarray,   /* I - array of null flags; used if nullcheck = 2 */
    char *image,        /* I - multi dimensional output image */
    long *fpixel,       /* I - first pixel number in each dim. of the image */
    long *lpixel,       /* I - last pixel number in each dim. of the image */
    int nullcheck,      /* I - 0, 1: do nothing; 2: set nullarray for nulls */
    int *status)

/* 
  Similar to imcomp_copy_overlap, except it copies the overlapping pixels from
  the 'image' to the 'tile'.
*/
{
    long imgdim[MAX_COMPRESS_DIM]; /* product of preceding dimensions in the */
                                   /* output image, allowing for inc factor */
    long tiledim[MAX_COMPRESS_DIM]; /* product of preceding dimensions in the */
                                 /* tile, array;  inc factor is not relevant */
    long imgfpix[MAX_COMPRESS_DIM]; /* 1st img pix overlapping tile: 0 base, */
                                    /*  allowing for inc factor */
    long imglpix[MAX_COMPRESS_DIM]; /* last img pix overlapping tile 0 base, */
                                    /*  allowing for inc factor */
    long tilefpix[MAX_COMPRESS_DIM]; /* 1st tile pix overlapping img 0 base, */
                                    /*  allowing for inc factor */
    long inc[MAX_COMPRESS_DIM]; /* local copy of input ininc */
    long i1, i2, i3, i4;   /* offset along each axis of the image */
    long it1, it2, it3, it4;
    long im1, im2, im3, im4;  /* offset to image pixel, allowing for inc */
    long ipos, tf, tl;
    long t2, t3, t4;   /* offset along each axis of the tile */
    long tilepix, imgpix, tilepixbyte, imgpixbyte;
    int ii, overlap_bytes, overlap_flags;

    if (*status > 0)
        return(*status);

    for (ii = 0; ii < MAX_COMPRESS_DIM; ii++)
    {
        /* set default values for higher dimensions */
        inc[ii] = 1;
        imgdim[ii] = 1;
        tiledim[ii] = 1;
        imgfpix[ii] = 0;
        imglpix[ii] = 0;
        tilefpix[ii] = 0;
    }

    /* ------------------------------------------------------------ */
    /* calc amount of overlap in each dimension; if there is zero   */
    /* overlap in any dimension then just return  */
    /* ------------------------------------------------------------ */
    
    for (ii = 0; ii < ndim; ii++)
    {
        if (tlpixel[ii] < fpixel[ii] || tfpixel[ii] > lpixel[ii])
            return(*status);  /* there are no overlapping pixels */

        /* calc dimensions of the output image section */
        imgdim[ii] = (lpixel[ii] - fpixel[ii]) / labs(inc[ii]) + 1;
        if (imgdim[ii] < 1)
            return(*status = NEG_AXIS);

        /* calc dimensions of the tile */
        tiledim[ii] = tlpixel[ii] - tfpixel[ii] + 1;
        if (tiledim[ii] < 1)
            return(*status = NEG_AXIS);

        if (ii > 0)
           tiledim[ii] *= tiledim[ii - 1];  /* product of dimensions */

        /* first and last pixels in image that overlap with the tile, 0 base */
        tf = tfpixel[ii] - 1;
        tl = tlpixel[ii] - 1;

        /* skip this plane if it falls in the cracks of the subsampled image */
        while ((tf-(fpixel[ii] - 1)) % labs(inc[ii]))
        {
           tf++;
           if (tf > tl)
             return(*status);  /* no overlapping pixels */
        }

        while ((tl-(fpixel[ii] - 1)) % labs(inc[ii]))
        {
           tl--;
           if (tf > tl)
             return(*status);  /* no overlapping pixels */
        }
        imgfpix[ii] = maxvalue((tf - fpixel[ii] +1) / labs(inc[ii]) , 0);
        imglpix[ii] = minvalue((tl - fpixel[ii] +1) / labs(inc[ii]) ,
                               imgdim[ii] - 1);

        /* first pixel in the tile that overlaps with the image (0 base) */
        tilefpix[ii] = maxvalue(fpixel[ii] - tfpixel[ii], 0);

        while ((tfpixel[ii] + tilefpix[ii] - fpixel[ii]) % labs(inc[ii]))
        {
           (tilefpix[ii])++;
           if (tilefpix[ii] >= tiledim[ii])
              return(*status);  /* no overlapping pixels */
        }
/*
printf("ii tfpixel, tlpixel %d %d %d \n",ii, tfpixel[ii], tlpixel[ii]);
printf("ii, tf, tl, imgfpix,imglpix, tilefpix %d %d %d %d %d %d\n",ii,
 tf,tl,imgfpix[ii], imglpix[ii],tilefpix[ii]);
*/
        if (ii > 0)
           imgdim[ii] *= imgdim[ii - 1];  /* product of dimensions */
    }

    /* ---------------------------------------------------------------- */
    /* calc number of pixels in each row (first dimension) that overlap */
    /* multiply by pixlen to get number of bytes to copy in each loop   */
    /* ---------------------------------------------------------------- */

    if (inc[0] != 1)
       overlap_flags = 1;  /* can only copy 1 pixel at a time */
    else
       overlap_flags = imglpix[0] - imgfpix[0] + 1;  /* can copy whole row */

    overlap_bytes = overlap_flags * pixlen;

    /* support up to 5 dimensions for now */
    for (i4 = 0, it4=0; i4 <= imglpix[4] - imgfpix[4]; i4++, it4++)
    {
     /* increment plane if it falls in the cracks of the subsampled image */
     while (ndim > 4 &&  (tfpixel[4] + tilefpix[4] - fpixel[4] + it4)
                          % labs(inc[4]) != 0)
        it4++;

       /* offset to start of hypercube */
       if (inc[4] > 0)
          im4 = (i4 + imgfpix[4]) * imgdim[3];
       else
          im4 = imgdim[4] - (i4 + 1 + imgfpix[4]) * imgdim[3];

      t4 = (tilefpix[4] + it4) * tiledim[3];
      for (i3 = 0, it3=0; i3 <= imglpix[3] - imgfpix[3]; i3++, it3++)
      {
       /* increment plane if it falls in the cracks of the subsampled image */
       while (ndim > 3 &&  (tfpixel[3] + tilefpix[3] - fpixel[3] + it3)
                            % labs(inc[3]) != 0)
          it3++;

       /* offset to start of cube */
       if (inc[3] > 0)
          im3 = (i3 + imgfpix[3]) * imgdim[2] + im4;
       else
          im3 = imgdim[3] - (i3 + 1 + imgfpix[3]) * imgdim[2] + im4;

       t3 = (tilefpix[3] + it3) * tiledim[2] + t4;

       /* loop through planes of the image */
       for (i2 = 0, it2=0; i2 <= imglpix[2] - imgfpix[2]; i2++, it2++)
       {
          /* incre plane if it falls in the cracks of the subsampled image */
          while (ndim > 2 &&  (tfpixel[2] + tilefpix[2] - fpixel[2] + it2)
                               % labs(inc[2]) != 0)
             it2++;

          /* offset to start of plane */
          if (inc[2] > 0)
             im2 = (i2 + imgfpix[2]) * imgdim[1] + im3;
          else
             im2 = imgdim[2] - (i2 + 1 + imgfpix[2]) * imgdim[1] + im3;

          t2 = (tilefpix[2] + it2) * tiledim[1] + t3;

          /* loop through rows of the image */
          for (i1 = 0, it1=0; i1 <= imglpix[1] - imgfpix[1]; i1++, it1++)
          {
             /* incre row if it falls in the cracks of the subsampled image */
             while (ndim > 1 &&  (tfpixel[1] + tilefpix[1] - fpixel[1] + it1)
                                  % labs(inc[1]) != 0)
                it1++;

             /* calc position of first pixel in tile to be copied */
             tilepix = tilefpix[0] + (tilefpix[1] + it1) * tiledim[0] + t2;

             /* offset to start of row */
             if (inc[1] > 0)
                im1 = (i1 + imgfpix[1]) * imgdim[0] + im2;
             else
                im1 = imgdim[1] - (i1 + 1 + imgfpix[1]) * imgdim[0] + im2;
/*
printf("inc = %d %d %d %d\n",inc[0],inc[1],inc[2],inc[3]);
printf("im1,im2,im3,im4 = %d %d %d %d\n",im1,im2,im3,im4);
*/
             /* offset to byte within the row */
             if (inc[0] > 0)
                imgpix = imgfpix[0] + im1;
             else
                imgpix = imgdim[0] - 1 - imgfpix[0] + im1;
/*
printf("tilefpix0,1, imgfpix1, it1, inc1, t2= %d %d %d %d %d %d\n",
       tilefpix[0],tilefpix[1],imgfpix[1],it1,inc[1], t2);
printf("i1, it1, tilepix, imgpix %d %d %d %d \n", i1, it1, tilepix, imgpix);
*/
             /* loop over pixels along one row of the image */
             for (ipos = imgfpix[0]; ipos <= imglpix[0]; ipos += overlap_flags)
             {
               /* convert from image pixel to byte offset */
               tilepixbyte = tilepix * pixlen;
               imgpixbyte  = imgpix  * pixlen;
/*
printf("  tilepix, tilepixbyte, imgpix, imgpixbyte= %d %d %d %d\n",
          tilepix, tilepixbyte, imgpix, imgpixbyte);
*/
               /* copy overlapping row of pixels from image to tile */
               memcpy(tile + tilepixbyte, image + imgpixbyte,  overlap_bytes);

               tilepix += (overlap_flags * labs(inc[0]));
               if (inc[0] > 0)
                 imgpix += overlap_flags;
               else
                 imgpix -= overlap_flags;
            }
          }
        }
      }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
static int unquantize_i1r4(long row, /* tile number = row number in table  */
            unsigned char *input, /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int dither_method,    /* I - dithering method to use             */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
    Unquantize byte values into the scaled floating point values
*/
{
    long ii;
    int nextrand, iseed;

    if (!fits_rand_value) 
       if (fits_init_randoms()) return(MEMORY_ALLOCATION);

    /* initialize the index to the next random number in the list */
    iseed = (int) ((row - 1) % N_RANDOM);
    nextrand = (int) (fits_rand_value[iseed] * 500);

    if (nullcheck == 0)     /* no null checking required */
    {
             for (ii = 0; ii < ntodo; ii++)
            {
/*
		if (dither_method == SUBTRACTIVE_DITHER_2 && input[ii] == ZERO_VALUE)
		    output[ii] = 0.0;
		else
*/
                    output[ii] = (float) (((double) input[ii] - fits_rand_value[nextrand] + 0.5) * scale + zero);

	        nextrand++;
	        if (nextrand == N_RANDOM) {
	            iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
		    nextrand = (int) (fits_rand_value[iseed] * 500);
	        }
            }
    }
    else        /* must check for null values */
    {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
/*
		    if (dither_method == SUBTRACTIVE_DITHER_2 && input[ii] == ZERO_VALUE)
		        output[ii] = 0.0;
		    else
*/
                        output[ii] = (float) (((double) input[ii] - fits_rand_value[nextrand] + 0.5) * scale + zero);
                } 

	        nextrand++;
	        if (nextrand == N_RANDOM) {
	            iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
	            nextrand = (int) (fits_rand_value[iseed] * 500);
                }
            }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
static int unquantize_i2r4(long row, /* seed for random values  */
            short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int dither_method,    /* I - dithering method to use             */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
    Unquantize short integer values into the scaled floating point values
*/
{
    long ii;
    int nextrand, iseed;

    if (!fits_rand_value) 
       if (fits_init_randoms()) return(MEMORY_ALLOCATION);

    /* initialize the index to the next random number in the list */
    iseed = (int) ((row - 1) % N_RANDOM);
    nextrand = (int) (fits_rand_value[iseed] * 500);

    if (nullcheck == 0)     /* no null checking required */
    {
           for (ii = 0; ii < ntodo; ii++)
            {
/*
		if (dither_method == SUBTRACTIVE_DITHER_2 && input[ii] == ZERO_VALUE)
		    output[ii] = 0.0;
		else
*/
                    output[ii] = (float) (((double) input[ii] - fits_rand_value[nextrand] + 0.5) * scale + zero);

	        nextrand++;
	        if (nextrand == N_RANDOM) {
	            iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
		    nextrand = (int) (fits_rand_value[iseed] * 500);
	        }
            }
    }
    else        /* must check for null values */
    {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
/*
                    if (dither_method == SUBTRACTIVE_DITHER_2 && input[ii] == ZERO_VALUE)
		        output[ii] = 0.0;
		    else
*/
                        output[ii] = (float) (((double) input[ii] - fits_rand_value[nextrand] + 0.5) * scale + zero);
                }

	        nextrand++;
	        if (nextrand == N_RANDOM) {
	            iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
		    nextrand = (int) (fits_rand_value[iseed] * 500);
	        }
             }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
static int unquantize_i4r4(long row, /* tile number = row number in table    */
            INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int dither_method,    /* I - dithering method to use             */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            float nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            float *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
    Unquantize int integer values into the scaled floating point values
*/
{
    long ii;
    int nextrand, iseed;

    if (fits_rand_value == 0) 
       if (fits_init_randoms()) return(MEMORY_ALLOCATION);

    /* initialize the index to the next random number in the list */
    iseed = (int) ((row - 1) % N_RANDOM);
    nextrand = (int) (fits_rand_value[iseed] * 500);

    if (nullcheck == 0)     /* no null checking required */
    {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (dither_method == SUBTRACTIVE_DITHER_2 && input[ii] == ZERO_VALUE)
		    output[ii] = 0.0;
		else
                    output[ii] = (float) (((double) input[ii] - fits_rand_value[nextrand] + 0.5) * scale + zero);

	        nextrand++;
	        if (nextrand == N_RANDOM) {
	            iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
		    nextrand = (int) (fits_rand_value[iseed] * 500);
	        }
            }
    }
    else        /* must check for null values */
    {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (dither_method == SUBTRACTIVE_DITHER_2 && input[ii] == ZERO_VALUE)
		        output[ii] = 0.0;
		    else
                        output[ii] = (float) (((double) input[ii] - fits_rand_value[nextrand] + 0.5) * scale + zero);
                }

	        nextrand++;
	        if (nextrand == N_RANDOM) {
	            iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
		    nextrand = (int) (fits_rand_value[iseed] * 500);
	        }
            }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
static int unquantize_i1r8(long row, /* tile number = row number in table  */
            unsigned char *input, /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int dither_method,    /* I - dithering method to use             */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            unsigned char tnull,  /* I - value of FITS TNULLn keyword if any */
            double nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
    Unquantize byte values into the scaled floating point values
*/
{
    long ii;
    int nextrand, iseed;

    if (!fits_rand_value) 
       if (fits_init_randoms()) return(MEMORY_ALLOCATION);

    /* initialize the index to the next random number in the list */
    iseed = (int) ((row - 1) % N_RANDOM);
    nextrand = (int) (fits_rand_value[iseed] * 500);

    if (nullcheck == 0)     /* no null checking required */
    {
            for (ii = 0; ii < ntodo; ii++)
            {
/*
                if (dither_method == SUBTRACTIVE_DITHER_2 && input[ii] == ZERO_VALUE)
		    output[ii] = 0.0;
		else
*/
                    output[ii] = (double) (((double) input[ii] - fits_rand_value[nextrand] + 0.5) * scale + zero);

	        nextrand++;
	        if (nextrand == N_RANDOM) {
	            iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
		    nextrand = (int) (fits_rand_value[iseed] * 500);
	        }
            }
    }
    else        /* must check for null values */
    {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
/*
                    if (dither_method == SUBTRACTIVE_DITHER_2 && input[ii] == ZERO_VALUE)
		        output[ii] = 0.0;
		    else
*/
                        output[ii] = (double) (((double) input[ii] - fits_rand_value[nextrand] + 0.5) * scale + zero);
                }

	        nextrand++;
	        if (nextrand == N_RANDOM) {
	            iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
		    nextrand = (int) (fits_rand_value[iseed] * 500);
	        }
            }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
static int unquantize_i2r8(long row, /* tile number = row number in table  */
            short *input,         /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int dither_method,    /* I - dithering method to use             */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            short tnull,          /* I - value of FITS TNULLn keyword if any */
            double nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
    Unquantize short integer values into the scaled floating point values
*/
{
    long ii;
    int nextrand, iseed;

    if (!fits_rand_value) 
       if (fits_init_randoms()) return(MEMORY_ALLOCATION);

    /* initialize the index to the next random number in the list */
    iseed = (int) ((row - 1) % N_RANDOM);
    nextrand = (int) (fits_rand_value[iseed] * 500);

    if (nullcheck == 0)     /* no null checking required */
    {
           for (ii = 0; ii < ntodo; ii++)
            {
/*
                if (dither_method == SUBTRACTIVE_DITHER_2 && input[ii] == ZERO_VALUE)
		    output[ii] = 0.0;
		else
*/
                    output[ii] = (double) (((double) input[ii] - fits_rand_value[nextrand] + 0.5) * scale + zero);

	        nextrand++;
	        if (nextrand == N_RANDOM) {
	            iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
		    nextrand = (int) (fits_rand_value[iseed] * 500);
	        }
            }
    }
    else        /* must check for null values */
    {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
/*                    if (dither_method == SUBTRACTIVE_DITHER_2 && input[ii] == ZERO_VALUE)
		        output[ii] = 0.0;
		    else
*/
                        output[ii] = (double) (((double) input[ii] - fits_rand_value[nextrand] + 0.5) * scale + zero);
                }

	        nextrand++;
	        if (nextrand == N_RANDOM) {
	            iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
		    nextrand = (int) (fits_rand_value[iseed] * 500);
	        }
            }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
static int unquantize_i4r8(long row, /* tile number = row number in table    */
            INT32BIT *input,      /* I - array of values to be converted     */
            long ntodo,           /* I - number of elements in the array     */
            double scale,         /* I - FITS TSCALn or BSCALE value         */
            double zero,          /* I - FITS TZEROn or BZERO  value         */
            int dither_method,    /* I - dithering method to use             */
            int nullcheck,        /* I - null checking code; 0 = don't check */
                                  /*     1:set null pixels = nullval         */
                                  /*     2: if null pixel, set nullarray = 1 */
            INT32BIT tnull,       /* I - value of FITS TNULLn keyword if any */
            double nullval,        /* I - set null pixels, if nullcheck = 1   */
            char *nullarray,      /* I - bad pixel array, if nullcheck = 2   */
            int  *anynull,        /* O - set to 1 if any pixels are null     */
            double *output,        /* O - array of converted pixels           */
            int *status)          /* IO - error status                       */
/*
    Unquantize int integer values into the scaled floating point values
*/
{
    long ii;
    int nextrand, iseed;

    if (fits_rand_value == 0) 
       if (fits_init_randoms()) return(MEMORY_ALLOCATION);

    /* initialize the index to the next random number in the list */
    iseed = (int) ((row - 1) % N_RANDOM);
    nextrand = (int) (fits_rand_value[iseed] * 500);

    if (nullcheck == 0)     /* no null checking required */
    {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (dither_method == SUBTRACTIVE_DITHER_2 && input[ii] == ZERO_VALUE)
		    output[ii] = 0.0;
		else
                    output[ii] = (double) (((double) input[ii] - fits_rand_value[nextrand] + 0.5) * scale + zero);

	        nextrand++;
	        if (nextrand == N_RANDOM) {
	            iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
		    nextrand = (int) (fits_rand_value[iseed] * 500);
	        }
            }
    }
    else        /* must check for null values */
    {
            for (ii = 0; ii < ntodo; ii++)
            {
                if (input[ii] == tnull)
                {
                    *anynull = 1;
                    if (nullcheck == 1)
                        output[ii] = nullval;
                    else
                        nullarray[ii] = 1;
                }
                else
                {
                    if (dither_method == SUBTRACTIVE_DITHER_2 && input[ii] == ZERO_VALUE)
		        output[ii] = 0.0;
		    else
                        output[ii] = (double) (((double) input[ii] - fits_rand_value[nextrand] + 0.5) * scale + zero);
                }

	        nextrand++;
	        if (nextrand == N_RANDOM) {
	            iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
		    nextrand = (int) (fits_rand_value[iseed] * 500);
	        }
            }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
static int imcomp_float2nan(float *indata, 
    long tilelen,
    int *outdata,
    float nullflagval, 
    int *status)
/*
  convert pixels that are equal to nullflag to NaNs.
  Note that indata and outdata point to the same location.
*/
{
    int ii;
    
    for (ii = 0; ii < tilelen; ii++) {

      if (indata[ii] == nullflagval)
        outdata[ii] = -1;  /* integer -1 has the same bit pattern as a real*4 NaN */
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
static int imcomp_double2nan(double *indata, 
    long tilelen,
    LONGLONG *outdata,
    double nullflagval, 
    int *status)
/*
  convert pixels that are equal to nullflag to NaNs.
  Note that indata and outdata point to the same location.
*/
{
    int ii;
    
    for (ii = 0; ii < tilelen; ii++) {

      if (indata[ii] == nullflagval)
        outdata[ii] = -1;  /* integer -1 has the same bit pattern as a real*8 NaN */
    }

    return(*status);
}

/* ======================================================================= */
/*    TABLE COMPRESSION ROUTINES                                           */
/* =-====================================================================== */

/*--------------------------------------------------------------------------*/
int fits_compress_table(fitsfile *infptr, fitsfile *outfptr, int *status)

/*
  Compress the input FITS Binary Table.
  
  First divide the table into equal sized chunks (analogous to image tiles) where all
  the contain the same number of rows (except perhaps for the last chunk
  which may contain fewer rows).   The chunks should not be too large to copy into memory
  (currently, about 100 MB max seems a reasonable size).
  
  Then, on a chunk by piece basis, do the following:
  
  1. Transpose the table from its original row-major order, into column-major order.
  All the bytes for each column are then continuous.  In addition, the bytes within
  each table element may be shuffled so that the most significant
  byte of every element occurs first in the array, followed by the next most
  significant byte, and so on to the least significant byte.  Byte shuffling often
  improves the gzip compression of floating-point arrays.
   
  2. Compress the contiguous array of bytes in each column using the specified
  compression method.  If no method is specifed, then a default method for that
  data type is chosen. 
  
  3. Store the compressed stream of bytes into a column that has the same name
  as in the input table, but which has a variable-length array data type (1QB).
  The output table will contain one row for each piece of the original table.
  
  4. If the input table contain variable-length arrays, then each VLA
  is compressed individually, and written to the heap in the output table.
  Note that the output table will contain 2 sets of pointers for each VLA column.  
  The first set contains the pointers to the uncompressed VLAs from the input table
  and the second is the set of pointers to the compressed VLAs in the output table.
  The latter set of pointers is used to reconstruct table when it is uncompressed,
  so that the heap has exactly the same structure as in the original file.  The 2
  sets of pointers are concatinated together, compressed with gzip, and written to
  the output table.  When reading the compressed table, the only VLA that is directly
  visible is this compressed array of descriptors.  One has to uncompress this array
  to be able to to read all the descriptors to the individual VLAs in the column.  
*/
{ 
    long maxchunksize = 10000000; /* default value for the size of each chunk of the table */

    char *cm_buffer;  /* memory buffer for the transposed, Column-Major, chunk of the table */ 
    LONGLONG cm_colstart[1000];  /* starting offset of each column in the cm_buffer */
    LONGLONG rm_repeat[1000];    /* repeat count of each column in the input row-major table */
    LONGLONG rm_colwidth[999];   /* width in bytes of each column in the input row-major table */
    LONGLONG cm_repeat[999];  /* total number of elements in each column of the transposed column-major table */

    int coltype[999];         /* data type code for each column */
    int compalgor[999], default_algor = 0;       /* compression algorithm to be applied to each column */
    float cratio[999];        /* compression ratio for each column (for diagnostic purposes) */

    float compressed_size, uncompressed_size, tot_compressed_size, tot_uncompressed_size;
    LONGLONG nrows, firstrow;
    LONGLONG headstart, datastart, dataend, startbyte, jj, kk, naxis1;
    LONGLONG vlalen, vlamemlen, vlastart, bytepos;
    long repeat, width, nchunks, rowspertile, lastrows;
    int ii, ll, ncols, hdutype, ltrue = 1, print_report = 0, tstatus;
    char *cptr, keyname[9], tform[40], *cdescript;
    char comm[FLEN_COMMENT], keyvalue[FLEN_VALUE], *cvlamem, tempstring[FLEN_VALUE], card[FLEN_CARD];

    LONGLONG *descriptors, *outdescript, *vlamem;
    int *pdescriptors;
    size_t dlen, datasize, compmemlen;

    /* ================================================================================== */
    /* perform initial sanity checks */
    /* ================================================================================== */
    
    /* special input flag value that means print out diagnostics */
    if (*status == -999) {
       print_report = 1;
       *status = 0;
    }

    if (*status > 0)
        return(*status);
    
    fits_get_hdu_type(infptr, &hdutype, status);
    if (hdutype != BINARY_TBL) {
        *status = NOT_BTABLE;
        return(*status);
    }

    if (infptr == outfptr) {
        ffpmsg("Cannot compress table 'in place' (fits_compress_table)");
        ffpmsg(" outfptr cannot be the same as infptr.");
        *status = DATA_COMPRESSION_ERR;
        return(*status);
    }

    /* get dimensions of the table */
    fits_get_num_rowsll(infptr, &nrows, status);
    fits_get_num_cols(infptr, &ncols, status);
    fits_read_key(infptr, TLONGLONG, "NAXIS1", &naxis1, NULL, status);
    /* get offset to the start of the data and total size of the table (including the heap) */
    fits_get_hduaddrll(infptr, &headstart, &datastart, &dataend, status);

    if (*status > 0)
        return(*status);

    tstatus = 0;
    if (!fits_read_key(infptr, TSTRING, "FZALGOR", tempstring, NULL, &tstatus)) {

	    if (!fits_strcasecmp(tempstring, "NONE")) {
	            default_algor = NOCOMPRESS;
	    } else if (!fits_strcasecmp(tempstring, "GZIP") || !fits_strcasecmp(tempstring, "GZIP_1")) {
	            default_algor = GZIP_1;
	    } else if (!fits_strcasecmp(tempstring, "GZIP_2")) {
	            default_algor = GZIP_2;
 	    } else if (!fits_strcasecmp(tempstring, "RICE_1")) {
	            default_algor = RICE_1;
 	    } else {
 	        ffpmsg("FZALGOR specifies unsupported table compression algorithm:");
		ffpmsg(tempstring);
	        *status = DATA_COMPRESSION_ERR;
	        return(*status);
	    }
    }

     /* just copy the HDU verbatim if the table has 0 columns or rows or if the table */
    /* is less than 5760 bytes (2 blocks) in size, or compression directive keyword = "NONE" */
    if (nrows < 1  || ncols < 1 || (dataend - datastart) < 5760  || default_algor == NOCOMPRESS) {
	fits_copy_hdu (infptr, outfptr, 0, status);
	return(*status);
    }
   
    /* Check if the chunk size has been specified with the FZTILELN keyword. */
    /* If not, calculate a default number of rows per chunck, */

    tstatus = 0;
    if (fits_read_key(infptr, TLONG, "FZTILELN", &rowspertile, NULL, &tstatus)) {
	rowspertile = (long) (maxchunksize / naxis1);
    }

    if (rowspertile < 1) rowspertile = 1;  
    if (rowspertile > nrows) rowspertile = (long) nrows;
    
    nchunks = (long) ((nrows - 1) / rowspertile + 1);  /* total number of chunks */
    lastrows = (long) (nrows - ((nchunks - 1) * rowspertile)); /* number of rows in last chunk */

    /* allocate space for the transposed, column-major chunk of the table */
    cm_buffer = calloc((size_t) naxis1, (size_t) rowspertile);
    if (!cm_buffer) {
        ffpmsg("Could not allocate cm_buffer for transposed table");
        *status = MEMORY_ALLOCATION;
        return(*status);
    }

    /* ================================================================================== */
    /*  Construct the header of the output compressed table  */
    /* ================================================================================== */
    fits_copy_header(infptr, outfptr, status);  /* start with verbatim copy of the input header */

    fits_write_key(outfptr, TLOGICAL, "ZTABLE", <rue, "this is a compressed table", status);
    fits_write_key(outfptr, TLONG, "ZTILELEN", &rowspertile, "number of rows in each tile", status);

    fits_read_card(outfptr, "NAXIS1", card, status); /* copy NAXIS1 to ZNAXIS1 */
    strncpy(card, "ZNAXIS1", 7);
    fits_write_record(outfptr, card, status);
    
    fits_read_card(outfptr, "NAXIS2", card, status); /* copy NAXIS2 to ZNAXIS2 */
    strncpy(card, "ZNAXIS2", 7);
    fits_write_record(outfptr, card, status);

    fits_read_card(outfptr, "PCOUNT", card, status); /* copy PCOUNT to ZPCOUNT */
    strncpy(card, "ZPCOUNT", 7);
    fits_write_record(outfptr, card, status);

    fits_modify_key_lng(outfptr, "NAXIS2", nchunks, "&", status);  /* 1 row per chunk */
    fits_modify_key_lng(outfptr, "NAXIS1", ncols * 16, "&", status); /* 16 bytes for each 1QB column */
    fits_modify_key_lng(outfptr, "PCOUNT", 0L, "&", status); /* reset PCOUNT to 0 */
    
    /* rename the Checksum keywords, if they exist */
    tstatus = 0;
    fits_modify_name(outfptr, "CHECKSUM", "ZHECKSUM", &tstatus);
    tstatus = 0;
    fits_modify_name(outfptr, "DATASUM", "ZDATASUM", &tstatus);

    /* ================================================================================== */
    /*  Now loop over each column of the input table: write the column-specific keywords */
    /*  and determine which compression algorithm to use.     */
    /*  Also calculate various offsets to the start of the column data in both the */
    /*  original row-major table and in the transposed column-major form of the table.  */
    /* ================================================================================== */

    cm_colstart[0] = 0;
    for (ii = 0; ii < ncols; ii++) {  

 	/* get the structural parameters of the original uncompressed column */
	fits_make_keyn("TFORM", ii+1, keyname, status);
	fits_read_key(outfptr, TSTRING, keyname, tform, comm, status);
        fits_binary_tform(tform, coltype+ii, &repeat, &width, status); /* get the repeat count and the width */

	/* preserve the original TFORM value and comment string in a ZFORMn keyword */
	fits_read_card(outfptr, keyname, card, status); 
	card[0] = 'Z';
	fits_write_record(outfptr, card, status);
 
        /* All columns in the compressed table will have a variable-length array type. */
	fits_modify_key_str(outfptr, keyname, "1QB", "&", status);  /* Use 'Q' pointers (64-bit) */ 

	/* deal with special cases: bit, string, and variable length array columns */
	if (coltype[ii] == TBIT) {
	    repeat = (repeat + 7) / 8;  /* convert from bits to equivalent number of bytes */
	} else if (coltype[ii] == TSTRING) {
	    width = 1;  /* ignore the optional 'w' in 'rAw' format */
	} else if (coltype[ii] < 0) {  /* pointer to variable length array */
	    if (strchr(tform,'Q') ) {
	        width = 16;  /* 'Q' descriptor has 64-bit pointers */
	    } else {
	        width = 8;  /* 'P' descriptor has 32-bit pointers */
 	    }
	    repeat = 1;
	}

	rm_repeat[ii] = repeat;   
	rm_colwidth[ii] = repeat * width; /* column width (in bytes)in the input table */
	
	/* starting offset of each field in the OUTPUT transposed column-major table */
	cm_colstart[ii + 1] = cm_colstart[ii] + rm_colwidth[ii] * rowspertile;
	/* total number of elements in each column of the transposed column-major table */
	cm_repeat[ii] = rm_repeat[ii] * rowspertile;

	compalgor[ii] = default_algor;  /* initialize the column compression algorithm to the default */
	
	/*  check if a compression method has been specified for this column */
	fits_make_keyn("FZALG", ii+1, keyname, status);
	tstatus = 0;
	if (!fits_read_key(outfptr, TSTRING, keyname, tempstring, NULL, &tstatus)) {

	    if (!fits_strcasecmp(tempstring, "GZIP") || !fits_strcasecmp(tempstring, "GZIP_1")) {
	            compalgor[ii] = GZIP_1;
	    } else if (!fits_strcasecmp(tempstring, "GZIP_2")) {
	            compalgor[ii] = GZIP_2;
	    } else if (!fits_strcasecmp(tempstring, "RICE_1")) {
	            compalgor[ii] = RICE_1;
	    } else {
	        ffpmsg("Unsupported table compression algorithm specification.");
		ffpmsg(keyname);
		ffpmsg(tempstring);
	        *status = DATA_COMPRESSION_ERR;
		free(cm_buffer);
	        return(*status);
	    }
	}

	/* do sanity check of the requested algorithm and override if necessary */
	if ( abs(coltype[ii]) == TLOGICAL || abs(coltype[ii]) == TBIT || abs(coltype[ii]) == TSTRING) {
	        if (compalgor[ii] != GZIP_1) {
			compalgor[ii] = GZIP_1;
		}
	} else if ( abs(coltype[ii]) == TCOMPLEX || abs(coltype[ii]) == TDBLCOMPLEX ||
	                abs(coltype[ii]) == TFLOAT   || abs(coltype[ii]) == TDOUBLE ||
			abs(coltype[ii]) == TLONGLONG ) {
	        if (compalgor[ii] != GZIP_1 && compalgor[ii] != GZIP_2) {
			compalgor[ii] = GZIP_2;  /* gzip_2 usually works better gzip_1 */
		}
	} else if ( abs(coltype[ii]) == TSHORT ) {
	        if (compalgor[ii] != GZIP_1 && compalgor[ii] != GZIP_2 && compalgor[ii] != RICE_1) {
			compalgor[ii] = GZIP_2;  /* gzip_2 usually works better rice_1 */
		 }
	} else if (  abs(coltype[ii]) == TLONG	) {
	        if (compalgor[ii] != GZIP_1 && compalgor[ii] != GZIP_2 && compalgor[ii] != RICE_1) {
			compalgor[ii] = RICE_1;
		}
	} else if ( abs(coltype[ii]) == TBYTE ) {
	        if (compalgor[ii] != GZIP_1 && compalgor[ii] != RICE_1 ) {
			compalgor[ii] = GZIP_1;
		}
	}
    }  /* end of loop over columns */

    /* ================================================================================== */
    /*    now process each chunk of the table, in turn          */
    /* ================================================================================== */

    tot_uncompressed_size = 0.;
    tot_compressed_size = 0;
    firstrow = 1;
    for (ll = 0; ll < nchunks; ll++) {

        if (ll == nchunks - 1) {  /* the last chunk may have fewer rows */
	    rowspertile = lastrows; 
            for (ii = 0; ii < ncols; ii++) { 
		cm_colstart[ii + 1] = cm_colstart[ii] + (rm_colwidth[ii] * rowspertile);
		cm_repeat[ii] = rm_repeat[ii] * rowspertile;
	    }
	}

        /* move to the start of the chunk in the input table */
        ffmbyt(infptr, datastart, 0, status);

        /* ================================================================================*/
        /*  First, transpose this chunck from row-major order to column-major order  */
	/*  At the same time, shuffle the bytes in each datum, if doing GZIP_2 compression */
        /* ================================================================================*/

        for (jj = 0; jj < rowspertile; jj++)   {    /* loop over rows */
          for (ii = 0; ii < ncols; ii++) {  /* loop over columns */
      
           if (rm_repeat[ii] > 0) {  /*  skip virtual columns that have 0 elements */

	    kk = 0;	

	     /* if the  GZIP_2 compression algorithm is used, shuffle the bytes */
	    if (coltype[ii] == TSHORT && compalgor[ii] == GZIP_2) {
	      while(kk < rm_colwidth[ii]) {
	        cptr = cm_buffer + (cm_colstart[ii] + (jj * rm_repeat[ii]) + kk/2);  
	        ffgbyt(infptr, 1, cptr, status);  /* get 1st byte */
	        cptr += cm_repeat[ii];  
	        ffgbyt(infptr, 1, cptr, status);  /* get 2nd byte */
	        kk += 2;
	      }
	    } else if ((coltype[ii] == TFLOAT || coltype[ii] == TLONG) && compalgor[ii] == GZIP_2) {
	      while(kk < rm_colwidth[ii]) {
	        cptr = cm_buffer + (cm_colstart[ii] + (jj * rm_repeat[ii]) + kk/4);  
	        ffgbyt(infptr, 1, cptr, status);  /* get 1st byte */
	        cptr += cm_repeat[ii];  
	        ffgbyt(infptr, 1, cptr, status);  /* get 2nd byte */
	        cptr += cm_repeat[ii];  
	        ffgbyt(infptr, 1, cptr, status);  /* get 3rd byte */
	        cptr += cm_repeat[ii];  
	        ffgbyt(infptr, 1, cptr, status);  /* get 4th byte */
	        kk += 4;
	      }
	    } else if ( (coltype[ii] == TDOUBLE || coltype[ii] == TLONGLONG) && compalgor[ii] == GZIP_2) {
	      while(kk < rm_colwidth[ii]) {
	        cptr = cm_buffer + (cm_colstart[ii] + (jj * rm_repeat[ii]) + kk/8);  
	        ffgbyt(infptr, 1, cptr, status);  /* get 1st byte */
	        cptr += cm_repeat[ii];  
	        ffgbyt(infptr, 1, cptr, status);  /* get 2nd byte */
	        cptr += cm_repeat[ii];  
	        ffgbyt(infptr, 1, cptr, status);  /* get 3rd byte */
	        cptr += cm_repeat[ii];  
	        ffgbyt(infptr, 1, cptr, status);  /* get 4th byte */
	        cptr += cm_repeat[ii];  
	        ffgbyt(infptr, 1, cptr, status);  /* get 5th byte */
	        cptr += cm_repeat[ii];  
	        ffgbyt(infptr, 1, cptr, status);  /* get 6th byte */
	        cptr += cm_repeat[ii];  
	        ffgbyt(infptr, 1, cptr, status);  /* get 7th byte */
	        cptr += cm_repeat[ii];  
	        ffgbyt(infptr, 1, cptr, status);  /* get 8th byte */
	        kk += 8;
	      }
	    } else  { /* all other cases: don't shuffle the bytes; simply transpose the column */
	        cptr = cm_buffer + (cm_colstart[ii] + (jj * rm_colwidth[ii]));   /* addr to copy to */
	        startbyte = (infptr->Fptr)->bytepos;  /* save the starting byte location */
	        ffgbyt(infptr, rm_colwidth[ii], cptr, status);  /* copy all the bytes */

	        if (rm_colwidth[ii] >= MINDIRECT) { /* have to explicitly move to next byte */
	  	    ffmbyt(infptr, startbyte + rm_colwidth[ii], 0, status);
	        }
	    }  /* end of test of coltypee */

           }  /* end of not virtual column */
          }  /* end of loop over columns */
        }  /* end of loop over rows */

        /* ================================================================================*/
        /*  now compress each column in the transposed chunk of the table    */
        /* ================================================================================*/

        fits_set_hdustruc(outfptr, status);  /* initialize structures in the output table */
    
        for (ii = 0; ii < ncols; ii++) {  /* loop over columns */
	  /* initialize the diagnostic compression results string */
	  snprintf(results[ii],30,"%3d %3d %3d ", ii+1, coltype[ii], compalgor[ii]);  
          cratio[ii] = 0;
	  
          if (rm_repeat[ii] > 0) {  /* skip virtual columns with zero width */

	    if (coltype[ii] < 0)  {  /* this is a variable length array (VLA) column */

		/*=========================================================================*/	    
	        /* variable-length array columns are a complicated special case  */
		/*=========================================================================*/

		/* allocate memory to hold all the VLA descriptors from the input table, plus */
		/* room to hold the descriptors to the compressed VLAs in the output table */
		/* In total, there will be 2 descriptors for each row in this chunk */

		uncompressed_size = 0.;
		compressed_size = 0;
		
		datasize = (size_t) (cm_colstart[ii + 1] - cm_colstart[ii]); /* size of input descriptors */

		cdescript =  calloc(datasize + (rowspertile * 16), 1); /* room for both descriptors */
		if (!cdescript) {
                    ffpmsg("Could not allocate buffer for descriptors");
                    *status = MEMORY_ALLOCATION;
		    free(cm_buffer);
	            return(*status);
		}

		/* copy the input descriptors to this array */
		memcpy(cdescript, &cm_buffer[cm_colstart[ii]], datasize);
#if BYTESWAPPED
		/* byte-swap the integer values into the native machine representation */
		if (rm_colwidth[ii] == 16) {
		    ffswap8((double *) cdescript,  rowspertile * 2);
		} else {
		    ffswap4((int *) cdescript,  rowspertile * 2);
		}
#endif
		descriptors = (LONGLONG *) cdescript;  /* use this for Q type descriptors */
		pdescriptors = (int *) cdescript;     /* use this instead for or P type descriptors */
		/* pointer to the 2nd set of descriptors */
		outdescript = (LONGLONG *) (cdescript + datasize);  /* this is a LONGLONG pointer */
		
		for (jj = 0; jj < rowspertile; jj++)   {    /* loop to compress each VLA in turn */

		  if (rm_colwidth[ii] == 16) { /* if Q pointers */
			vlalen = descriptors[jj * 2];
			vlastart = descriptors[(jj * 2) + 1];
		  } else {  /* if P pointers */
			vlalen = (LONGLONG) pdescriptors[jj * 2];
			vlastart = (LONGLONG) pdescriptors[(jj * 2) + 1];
		  }

		  if (vlalen > 0) {  /* skip zero-length VLAs */

		    vlamemlen = vlalen * (int) (-coltype[ii] / 10);
		    vlamem = (LONGLONG *) malloc((size_t) vlamemlen); /* memory for the input uncompressed VLA */
		    if (!vlamem) {
			ffpmsg("Could not allocate buffer for VLA");
			*status = MEMORY_ALLOCATION;
			free(cdescript); free(cm_buffer);
			return(*status);
		    }

		    compmemlen = (size_t) (vlalen * ((LONGLONG) (-coltype[ii] / 10)) * 1.5);
		    if (compmemlen < 100) compmemlen = 100;
		    cvlamem = malloc(compmemlen);  /* memory for the output compressed VLA */
		    if (!cvlamem) {
			ffpmsg("Could not allocate buffer for compressed data");
			*status = MEMORY_ALLOCATION;
			free(vlamem); free(cdescript); free(cm_buffer);
			return(*status);
		    }

		    /* read the raw bytes directly from the heap, without any byte-swapping or null value detection */
		    bytepos = (infptr->Fptr)->datastart + (infptr->Fptr)->heapstart + vlastart;
		    ffmbyt(infptr, bytepos, REPORT_EOF, status);
		    ffgbyt(infptr, vlamemlen, vlamem, status);  /* read the bytes */
		    uncompressed_size += vlamemlen;  /* total size of the uncompressed VLAs */
		    tot_uncompressed_size += vlamemlen;  /* total size of the uncompressed file */

		    /* compress the VLA with the appropriate algorithm */
	    	    if (compalgor[ii] == RICE_1) {

		        if (-coltype[ii] == TSHORT) {
#if BYTESWAPPED
			  ffswap2((short *) (vlamem),  (long) vlalen); 
#endif
			  dlen = fits_rcomp_short ((short *)(vlamem), (int) vlalen, (unsigned char *) cvlamem,
			   (int) compmemlen, 32);
		        } else if (-coltype[ii] == TLONG) {
#if BYTESWAPPED
			  ffswap4((int *) (vlamem),  (long) vlalen); 
#endif
			  dlen = fits_rcomp ((int *)(vlamem), (int) vlalen, (unsigned char *) cvlamem,
                           (int) compmemlen, 32);
		        } else if (-coltype[ii] == TBYTE) {
			  dlen = fits_rcomp_byte ((signed char *)(vlamem), (int) vlalen, (unsigned char *) cvlamem,
                           (int) compmemlen, 32);
		        } else {
			  /* this should not happen */
			  ffpmsg(" Error: cannot compress this column type with the RICE algorthm");
			  free(vlamem); free(cdescript); free(cm_buffer); free(cvlamem);
			  *status = DATA_COMPRESSION_ERR;
			  return(*status);
		        }  
		    } else if (compalgor[ii] == GZIP_1 || compalgor[ii] == GZIP_2){  
		       if (compalgor[ii] == GZIP_2 ) {  /* shuffle the bytes before gzipping them */
			   if ( (int) (-coltype[ii] / 10) == 2) {
			       fits_shuffle_2bytes((char *) vlamem, vlalen, status);
			   } else if ( (int) (-coltype[ii] / 10) == 4) {
			       fits_shuffle_4bytes((char *) vlamem, vlalen, status);
			   } else if ( (int) (-coltype[ii] / 10) == 8) {
			       fits_shuffle_8bytes((char *) vlamem, vlalen, status);
			   }
		        }
		        /*: gzip compress the array of bytes */
		        compress2mem_from_mem( (char *) vlamem, (size_t) vlamemlen,
	    		    &cvlamem,  &compmemlen, realloc, &dlen, status);        
		    } else {
			  /* this should not happen */
			  ffpmsg(" Error: unknown compression algorthm");
			  free(vlamem); free(cdescript); free(cm_buffer); free(cvlamem);
			  *status = DATA_COMPRESSION_ERR;
			  return(*status);
		    }  

		    /* write the compressed array to the output table, but... */
		    /* We use a trick of always writing the array to the same row of the output table */
		    /* and then copy the descriptor into the array of descriptors that we allocated. */
		     
		    /* First, reset the descriptor */
		    fits_write_descript(outfptr, ii+1, ll+1, 0, 0, status);

		    /* write the compressed VLA if it is smaller than the original, else write */
		    /* the uncompressed array */
		    fits_set_tscale(outfptr, ii + 1, 1.0, 0.0, status);  /* turn off any data scaling, first */
		    if (dlen < vlamemlen) {
		        fits_write_col(outfptr, TBYTE, ii + 1, ll+1, 1, dlen, cvlamem, status);
		        compressed_size += dlen;  /* total size of the compressed VLAs */
		        tot_compressed_size += dlen;  /* total size of the compressed file */
		    } else {
			if ( -coltype[ii] != TBYTE && compalgor[ii] != GZIP_1) {
			    /* it is probably faster to reread the raw bytes, rather than unshuffle or unswap them */
			    bytepos = (infptr->Fptr)->datastart + (infptr->Fptr)->heapstart + vlastart;
			    ffmbyt(infptr, bytepos, REPORT_EOF, status);
			    ffgbyt(infptr, vlamemlen, vlamem, status);  /* read the bytes */
			}
		        fits_write_col(outfptr, TBYTE, ii + 1, ll+1, 1, vlamemlen, vlamem, status);
		        compressed_size += vlamemlen;  /* total size of the compressed VLAs */
		        tot_compressed_size += vlamemlen;  /* total size of the compressed file */
		    }

		    /* read back the descriptor and save it in the array of descriptors */
		    fits_read_descriptll(outfptr, ii + 1, ll + 1, outdescript+(jj*2), outdescript+(jj*2)+1, status);
		    free(cvlamem);  free(vlamem);

		  } /* end of vlalen > 0 */
		}  /* end of loop over rows */

		if (compressed_size != 0)
		    cratio[ii] = uncompressed_size / compressed_size;

		snprintf(tempstring,FLEN_VALUE," r=%6.2f",cratio[ii]);
		strncat(results[ii],tempstring, 29-strlen(results[ii]));

		/* now we just have to compress the array of descriptors (both input and output) */
		/* and write them to the output table. */

		/* allocate memory for the compressed descriptors */
		cvlamem = malloc(datasize + (rowspertile * 16) );
		if (!cvlamem) {
		    ffpmsg("Could not allocate buffer for compressed data");
		    *status = MEMORY_ALLOCATION;
		    free(cdescript); free(cm_buffer);
		    return(*status);
		}

#if BYTESWAPPED
		/* byte swap the input and output descriptors */
		if (rm_colwidth[ii] == 16) {
		    ffswap8((double *) cdescript,  rowspertile * 2);
		} else {
		    ffswap4((int *) cdescript,  rowspertile * 2);
		}
		ffswap8((double *) outdescript,  rowspertile * 2);
#endif
		/* compress the array contain both sets of descriptors */
		compress2mem_from_mem((char *) cdescript, datasize + (rowspertile * 16),
	    		&cvlamem,  &datasize, realloc, &dlen, status);        

		free(cdescript);

		/* write the compressed descriptors to the output column */
		fits_set_tscale(outfptr, ii + 1, 1.0, 0.0, status);  /* turn off any data scaling, first */
		fits_write_descript(outfptr, ii+1, ll+1, 0, 0, status); /* First, reset the descriptor */
		fits_write_col(outfptr, TBYTE, ii + 1, ll+1, 1, dlen, cvlamem, status);
		free(cvlamem); 

		if (ll == 0) {  /* only write the ZCTYPn keyword once, while processing the first column */
			fits_make_keyn("ZCTYP", ii+1, keyname, status);

			if (compalgor[ii] == RICE_1) {
			     strcpy(keyvalue, "RICE_1");
			} else if (compalgor[ii] == GZIP_2) {
			     strcpy(keyvalue, "GZIP_2");
			} else {
			     strcpy(keyvalue, "GZIP_1");
			}

			fits_write_key(outfptr, TSTRING, keyname, keyvalue,
			"compression algorithm for column", status);
		}

	        continue;  /* jump to end of loop, to go to next column */
	    }  /* end of VLA case */

	    /* ================================================================================*/
	    /* deal with all the normal fixed-length columns here */
	    /* ================================================================================*/

	    /* allocate memory for the compressed data */
	    datasize = (size_t) (cm_colstart[ii + 1] - cm_colstart[ii]);
	    cvlamem = malloc(datasize*2);
	    tot_uncompressed_size += datasize;
	    
	    if (!cvlamem) {
                ffpmsg("Could not allocate buffer for compressed data");
                *status = MEMORY_ALLOCATION;
		free(cm_buffer);
	        return(*status);
	    }

	    if (compalgor[ii] == RICE_1) {
	        if (coltype[ii] == TSHORT) {
#if BYTESWAPPED
                    ffswap2((short *) (cm_buffer + cm_colstart[ii]),  datasize / 2); 
#endif
  	            dlen = fits_rcomp_short ((short *)(cm_buffer + cm_colstart[ii]), datasize / 2, (unsigned char *) cvlamem,
                       datasize * 2, 32);

	        } else if (coltype[ii] == TLONG) {
#if BYTESWAPPED
                    ffswap4((int *) (cm_buffer + cm_colstart[ii]),  datasize / 4); 
#endif
   	            dlen = fits_rcomp ((int *)(cm_buffer + cm_colstart[ii]), datasize / 4, (unsigned char *) cvlamem,
                       datasize * 2, 32);

	        } else if (coltype[ii] == TBYTE) {

  	            dlen = fits_rcomp_byte ((signed char *)(cm_buffer + cm_colstart[ii]), datasize, (unsigned char *) cvlamem,
                       datasize * 2, 32);
	        } else {  /* this should not happen */
                    ffpmsg(" Error: cannot compress this column type with the RICE algorthm");
		    free(cvlamem);  free(cm_buffer);
	            *status = DATA_COMPRESSION_ERR;
	            return(*status);
	        }
	    } else {
	    	/* all other cases: gzip compress the column (bytes may have been shuffled previously) */
		compress2mem_from_mem(cm_buffer + cm_colstart[ii], datasize,
	    		&cvlamem,  &datasize, realloc, &dlen, status);        
	    }

	    if (ll == 0) {  /* only write the ZCTYPn keyword once, while processing the first column */
		fits_make_keyn("ZCTYP", ii+1, keyname, status);

		if (compalgor[ii] == RICE_1) {
		     strcpy(keyvalue, "RICE_1");
		} else if (compalgor[ii] == GZIP_2) {
		     strcpy(keyvalue, "GZIP_2");
		} else {
		     strcpy(keyvalue, "GZIP_1");
		}

		fits_write_key(outfptr, TSTRING, keyname, keyvalue,
		"compression algorithm for column", status);
	    }

	    /* write the compressed data to the output column */
	    fits_set_tscale(outfptr, ii + 1, 1.0, 0.0, status);  /* turn off any data scaling, first */
	    fits_write_col(outfptr, TBYTE, ii + 1, ll+1, 1, dlen, cvlamem, status);
	    tot_compressed_size += dlen;

	    free(cvlamem);   /* don't need the compressed data any more */

            /* create diagnostic messages */
	    if (dlen != 0)
	       cratio[ii] = (float) datasize / (float) dlen;  /* compression ratio of the column */

	    snprintf(tempstring,FLEN_VALUE," r=%6.2f",cratio[ii]);
	    strncat(results[ii],tempstring,29-strlen(results[ii]));
 
          }  /* end of not a virtual column */
        }  /* end of loop over columns */

        datastart += (rowspertile * naxis1);   /* increment to start of next chunk */
        firstrow += rowspertile;  /* increment first row in next chunk */

       if (print_report) {
	  printf("\nChunk = %d\n",ll+1);
	  for (ii = 0; ii < ncols; ii++) {  
		printf("%s\n", results[ii]);
	  }
	}
	
    }  /* end of loop over chunks of the table */

    /* =================================================================================*/
    /*  all done; just clean up and return  */
    /* ================================================================================*/

    free(cm_buffer);
    fits_set_hdustruc(outfptr, status);  /* reset internal structures */
       	
    if (print_report) {

       if (tot_compressed_size != 0)
           printf("\nTotal data size (MB) %.3f -> %.3f, ratio = %.3f\n", tot_uncompressed_size/1000000., 
	     tot_compressed_size/1000000., tot_uncompressed_size/tot_compressed_size);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_uncompress_table(fitsfile *infptr, fitsfile *outfptr, int *status)

/*
  Uncompress the table that was compressed with fits_compress_table
*/
{ 
    char colcode[999];  /* column data type code character */
    char coltype[999];  /* column data type numeric code value */
    char *cm_buffer;   /* memory buffer for the transposed, Column-Major, chunk of the table */ 
    char *rm_buffer;   /* memory buffer for the original, Row-Major, chunk of the table */ 
    LONGLONG nrows, rmajor_colwidth[999], rmajor_colstart[1000], cmajor_colstart[1000];
    LONGLONG cmajor_repeat[999], rmajor_repeat[999], cmajor_bytespan[999], kk;
    LONGLONG headstart, datastart = 0, dataend, rowsremain, *descript, *qdescript = 0;
    LONGLONG rowstart, cvlalen, cvlastart, vlalen, vlastart;
    long repeat, width, vla_repeat, vla_address, rowspertile, ntile;
    int  ncols, hdutype, inttype, anynull, tstatus, zctype[999], addspace = 0, *pdescript = 0;
    char *cptr, keyname[9], tform[40];
    long  pcount, zheapptr, naxis1, naxis2, ii, jj;
    char *ptr, comm[FLEN_COMMENT], zvalue[FLEN_VALUE], *uncompressed_vla = 0, *compressed_vla;
    char card[FLEN_CARD];
    size_t dlen, fullsize, cm_size, bytepos, vlamemlen;

    /* ================================================================================== */
    /* perform initial sanity checks */
    /* ================================================================================== */
    if (*status > 0)
        return(*status);
     
    fits_get_hdu_type(infptr, &hdutype, status);
    if (hdutype != BINARY_TBL) {
        ffpmsg("This is not a binary table, so cannot uncompress it!");
        *status = NOT_BTABLE;
        return(*status);
    }

    if (fits_read_key(infptr, TLOGICAL, "ZTABLE", &tstatus, NULL, status)) {
	/* just copy the HDU if the table is not compressed */
	if (infptr != outfptr) { 
		fits_copy_hdu (infptr, outfptr, 0, status);
	}
	return(*status);
    }
 
    fits_get_num_rowsll(infptr, &nrows, status);
    fits_get_num_cols(infptr, &ncols, status);

    if ((ncols < 1)) {
	/* just copy the HDU if the table does not have  more than 0 columns */
	if (infptr != outfptr) { 
		fits_copy_hdu (infptr, outfptr, 0, status);
	}
	return(*status);
    }

    fits_read_key(infptr, TLONG, "ZTILELEN", &rowspertile, comm, status);
    if (*status > 0) {
        ffpmsg("Could not find the required ZTILELEN keyword");
        *status = DATA_DECOMPRESSION_ERR;
        return(*status);
    }

    /**** get size of the uncompressed table */
    fits_read_key(infptr, TLONG, "ZNAXIS1", &naxis1, comm, status);
    if (*status > 0) {
        ffpmsg("Could not find the required ZNAXIS1 keyword");
        *status = DATA_DECOMPRESSION_ERR;
        return(*status);
    }

    fits_read_key(infptr, TLONG, "ZNAXIS2", &naxis2, comm, status);
    if (*status > 0) {
        ffpmsg("Could not find the required ZNAXIS2 keyword");
        *status = DATA_DECOMPRESSION_ERR;
        return(*status);
    }

    /* silently ignore illegal ZTILELEN value if too large */
    if (rowspertile > naxis2) rowspertile = naxis2;

    fits_read_key(infptr, TLONG, "ZPCOUNT", &pcount, comm, status);
    if (*status > 0) {
        ffpmsg("Could not find the required ZPCOUNT keyword");
        *status = DATA_DECOMPRESSION_ERR;
        return(*status);
    }

    tstatus = 0;
    fits_read_key(infptr, TLONG, "ZHEAPPTR", &zheapptr, comm, &tstatus);
    if (tstatus > 0) {
        zheapptr = 0;  /* uncompressed table has no heap */
    }

    /* ================================================================================== */
    /* copy of the input header, then recreate the uncompressed table keywords */
    /* ================================================================================== */
    fits_copy_header(infptr, outfptr, status);

    /* reset the NAXIS1, NAXIS2. and PCOUNT keywords to the original */
    fits_read_card(outfptr, "ZNAXIS1", card, status);
    strncpy(card, "NAXIS1 ", 7);
    fits_update_card(outfptr, "NAXIS1", card, status);
    
    fits_read_card(outfptr, "ZNAXIS2", card, status);
    strncpy(card, "NAXIS2 ", 7);
    fits_update_card(outfptr, "NAXIS2", card, status);
    
    fits_read_card(outfptr, "ZPCOUNT", card, status);
    strncpy(card, "PCOUNT ", 7);
    fits_update_card(outfptr, "PCOUNT", card, status);

    fits_delete_key(outfptr, "ZTABLE", status);
    fits_delete_key(outfptr, "ZTILELEN", status);
    fits_delete_key(outfptr, "ZNAXIS1", status);
    fits_delete_key(outfptr, "ZNAXIS2", status);
    fits_delete_key(outfptr, "ZPCOUNT", status);
    tstatus = 0;
    fits_delete_key(outfptr, "CHECKSUM", &tstatus); 
    tstatus = 0;
    fits_delete_key(outfptr, "DATASUM", &tstatus); 
    /* restore the Checksum keywords, if they exist */
    tstatus = 0;
    fits_modify_name(outfptr, "ZHECKSUM", "CHECKSUM", &tstatus);
    tstatus = 0;
    fits_modify_name(outfptr, "ZDATASUM", "DATASUM", &tstatus);

    /* ================================================================================== */
    /* determine compression paramters for each column and write column-specific keywords */
    /* ================================================================================== */
    for (ii = 0; ii < ncols; ii++) {

	/* get the original column type, repeat count, and unit width */
	fits_make_keyn("ZFORM", ii+1, keyname, status);
	fits_read_key(infptr, TSTRING, keyname, tform, comm, status);

	/* restore the original TFORM value and comment */
	fits_read_card(outfptr, keyname, card, status);
	card[0] = 'T';
	keyname[0] = 'T';
	fits_update_card(outfptr, keyname, card, status);

	/* now delete the ZFORM keyword */
        keyname[0] = 'Z';
	fits_delete_key(outfptr, keyname, status);

	cptr = tform;
	while(isdigit(*cptr)) cptr++;
	colcode[ii] = *cptr; /* save the column type code */

        fits_binary_tform(tform, &inttype, &repeat, &width, status);
        coltype[ii] = inttype;

	/* deal with special cases */
	if (abs(coltype[ii]) == TBIT) { 
	        repeat = (repeat + 7) / 8 ;   /* convert from bits to bytes */
	} else if (abs(coltype[ii]) == TSTRING) {
	        width = 1;
	} else if (coltype[ii] < 0) {  /* pointer to variable length array */
	        if (colcode[ii] == 'P')
	           width = 8;  /* this is a 'P' column */
	        else
	           width = 16;  /* this is a 'Q' not a 'P' column */

                addspace += 16; /* need space for a second set of Q pointers for this column */
	}

	rmajor_repeat[ii] = repeat;

	/* width (in bytes) of each field in the row-major table */
	rmajor_colwidth[ii] = rmajor_repeat[ii] * width;

	/* construct the ZCTYPn keyword name then read the keyword */
	fits_make_keyn("ZCTYP", ii+1, keyname, status);
	tstatus = 0;
        fits_read_key(infptr, TSTRING, keyname, zvalue, NULL, &tstatus);
	if (tstatus) {
           zctype[ii] = GZIP_2;
	} else {
	   if (!strcmp(zvalue, "GZIP_2")) {
               zctype[ii] = GZIP_2;
	   } else if (!strcmp(zvalue, "GZIP_1")) {
               zctype[ii] = GZIP_1;
	   } else if (!strcmp(zvalue, "RICE_1")) {
               zctype[ii] = RICE_1;
	   } else {
	       ffpmsg("Unrecognized ZCTYPn keyword compression code:");
	       ffpmsg(zvalue);
	       *status = DATA_DECOMPRESSION_ERR;
	       return(*status);
	   }
	   
	   /* delete this keyword from the uncompressed header */
	   fits_delete_key(outfptr, keyname, status);
	}
    }

    /* rescan header keywords to reset internal table structure parameters */
    fits_set_hdustruc(outfptr, status);

    /* ================================================================================== */
    /* allocate memory for the transposed and untransposed tile of the table */
    /* ================================================================================== */

    fullsize = naxis1 * rowspertile;
    cm_size = fullsize + (addspace * rowspertile);

    cm_buffer = malloc(cm_size);
    if (!cm_buffer) {
        ffpmsg("Could not allocate buffer for transformed column-major table");
        *status = MEMORY_ALLOCATION;
        return(*status);
    }

    rm_buffer = malloc(fullsize);
    if (!rm_buffer) {
        ffpmsg("Could not allocate buffer for untransformed row-major table");
        *status = MEMORY_ALLOCATION;
        free(cm_buffer);
        return(*status);
    }

    /* ================================================================================== */
    /* Main loop over all the tiles */
    /* ================================================================================== */

    rowsremain = naxis2;
    rowstart = 1;
    ntile = 0;

    while(rowsremain) {

        /* ================================================================================== */
        /* loop over each column: read and uncompress the bytes */
        /* ================================================================================== */
        ntile++;
        rmajor_colstart[0] = 0;
        cmajor_colstart[0] = 0;
        for (ii = 0; ii < ncols; ii++) {

	    cmajor_repeat[ii] = rmajor_repeat[ii] * rowspertile;

	    /* starting offset of each field in the column-major table */
            if (coltype[ii] > 0) {  /* normal fixed length column */
	          cmajor_colstart[ii + 1] = cmajor_colstart[ii] + rmajor_colwidth[ii] * rowspertile;
	    } else { /* VLA column: reserve space for the 2nd set of Q pointers */
	          cmajor_colstart[ii + 1] = cmajor_colstart[ii] + (rmajor_colwidth[ii] + 16) * rowspertile;
	    }
	    /* length of each sequence of bytes, after sorting them in signicant order */
	    cmajor_bytespan[ii] = (rmajor_repeat[ii] * rowspertile);

	    /* starting offset of each field in the  row-major table */
	    rmajor_colstart[ii + 1] = rmajor_colstart[ii] + rmajor_colwidth[ii];

            if (rmajor_repeat[ii] > 0) { /* ignore columns with 0 elements */
	
	        /* read compressed bytes from input table */
	        fits_read_descript(infptr, ii + 1, ntile, &vla_repeat, &vla_address, status);
	
	        /* allocate memory and read in the compressed bytes */
	        ptr = malloc(vla_repeat);
	        if (!ptr) {
                   ffpmsg("Could not allocate buffer for uncompressed bytes");
                   *status = MEMORY_ALLOCATION;
                   free(rm_buffer);  free(cm_buffer);
                   return(*status);
	        }

	        fits_set_tscale(infptr, ii + 1, 1.0, 0.0, status);  /* turn off any data scaling, first */
	        fits_read_col_byt(infptr, ii + 1, ntile, 1, vla_repeat, 0, (unsigned char *) ptr, &anynull, status);
                cptr = cm_buffer + cmajor_colstart[ii];
	
		/* size in bytes of the uncompressed column of bytes */
	        fullsize = (size_t) (cmajor_colstart[ii+1] - cmajor_colstart[ii]);

	        switch (colcode[ii]) {

	        case 'I':

	          if (zctype[ii] == RICE_1) {
   	             dlen = fits_rdecomp_short((unsigned char *)ptr, vla_repeat, (unsigned short *)cptr, 
		       fullsize / 2, 32);
#if BYTESWAPPED
                     ffswap2((short *) cptr, fullsize / 2); 
#endif
	          } else { /* gunzip the data into the correct location */
	             uncompress2mem_from_mem(ptr, vla_repeat, &cptr, &fullsize, realloc, &dlen, status);        
	          }
	          break;

	        case 'J':

	          if (zctype[ii] == RICE_1) {
   	              dlen = fits_rdecomp ((unsigned char *) ptr, vla_repeat, (unsigned int *)cptr, 
		        fullsize / 4, 32);
#if BYTESWAPPED
                      ffswap4((int *) cptr,  fullsize / 4); 
#endif
	          } else { /* gunzip the data into the correct location */
	             uncompress2mem_from_mem(ptr, vla_repeat, &cptr, &fullsize, realloc, &dlen, status);        
	          }
	          break;

	        case 'B':

	          if (zctype[ii] == RICE_1) {
   	              dlen = fits_rdecomp_byte ((unsigned char *) ptr, vla_repeat, (unsigned char *)cptr, 
		        fullsize, 32);
	          } else { /* gunzip the data into the correct location */
	             uncompress2mem_from_mem(ptr, vla_repeat, &cptr, &fullsize, realloc, &dlen, status);        
	          }
	          break;

	        default: 
		  /* all variable length array columns are included in this case */
	          /* gunzip the data into the correct location in the full table buffer */
	          uncompress2mem_from_mem(ptr, vla_repeat,
	              &cptr,  &fullsize, realloc, &dlen, status);              

	        } /* end of switch block */

	        free(ptr);
	  }  /* end of rmajor_repeat > 0 */
      }  /* end of loop over columns */
      
      /* now transpose the rows and columns (from cm_buffer to rm_buffer) */
      /* move each byte, in turn, from the cm_buffer to the appropriate place in the rm_buffer */
      for (ii = 0; ii < ncols; ii++) {  /* loop over columns */
	 ptr = (char *) (cm_buffer + cmajor_colstart[ii]);  /* initialize ptr to start of the column in the cm_buffer */
         if (rmajor_repeat[ii] > 0) {  /* skip columns with zero elements */
             if (coltype[ii] > 0) {  /* normal fixed length array columns */
                 if (zctype[ii] == GZIP_2) {  /*  need to unshuffle the bytes */

	             /* recombine the byte planes for the 2-byte, 4-byte, and 8-byte numeric columns */
	             switch (colcode[ii]) {
	
		     case 'I':
		         /* get the 1st byte of each I*2 value */
	                 for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		             cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]));  
		             for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		                 *cptr = *ptr;  /* copy 1 byte */
		                 ptr++;
		                 cptr += 2;  
			     }
			 }
		         /* get the 2nd byte of each I*2 value */
	                 for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		            cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]) + 1);  
		            for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		                *cptr = *ptr;  /* copy 1 byte */
		                ptr++;
		                cptr += 2;  
		            }
		         }
		         break;

		   case 'J':
		   case 'E':
		       /* get the 1st byte of each 4-byte value */
	               for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		         cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]));  
		         for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		           *cptr = *ptr;  /* copy 1 byte */
		           ptr++;
		           cptr += 4;  
		         }
		       }
		       /* get the 2nd byte  */
	               for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		         cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]) + 1);  
		          for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		            *cptr = *ptr;  /* copy 1 byte */
		            ptr++;
		            cptr += 4;  
		          }
		       }
		       /* get the 3rd byte  */
	               for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		         cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]) + 2);  
		         for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		           *cptr = *ptr;  /* copy 1 byte */
		           ptr++;
		           cptr += 4;  
		         }
		       }
		       /* get the 4th byte  */
	               for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		         cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]) + 3);  
		         for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		           *cptr = *ptr;  /* copy 1 byte */
		           ptr++;
		           cptr += 4;  
		         }
		       }
		       break;

		 case 'D':
		 case 'K':
		       /* get the 1st byte of each 8-byte value */
 	              for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		         cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]));  
		         for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		           *cptr = *ptr;  /* copy 1 byte */
		           ptr++;
		           cptr += 8;  
		         }
		       }
		       /* get the 2nd byte  */
	               for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		         cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]) + 1);  
		         for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		           *cptr = *ptr;  /* copy 1 byte */
		           ptr++;
		           cptr += 8;  
		         }
		       }
		       /* get the 3rd byte  */
	               for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		         cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]) + 2);  
		         for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		           *cptr = *ptr;  /* copy 1 byte */
		           ptr++;
		           cptr += 8;  
		         }
		       }
		       /* get the 4th byte  */
	  	       for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		         cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]) + 3);  
		         for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		           *cptr = *ptr;  /* copy 1 byte */
		           ptr++;
		           cptr += 8;  
		         }
		       }
		       /* get the 5th byte */
	               for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		         cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]) + 4);  
		         for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		           *cptr = *ptr;  /* copy 1 byte */
		           ptr++;
		           cptr += 8;  
		         }
		       }
		       /* get the 6th byte  */
	               for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		         cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]) + 5);  
		         for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		           *cptr = *ptr;  /* copy 1 byte */
		           ptr++;
		           cptr += 8;  
		         }
		       }
		       /* get the 7th byte  */
	               for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		         cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]) + 6);  
		         for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		           *cptr = *ptr;  /* copy 1 byte */
		           ptr++;
		           cptr += 8;  
		         }
		       }
		       /* get the 8th byte  */
	               for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		         cptr = rm_buffer + (rmajor_colstart[ii] + (jj * rmajor_colstart[ncols]) + 7);  
		         for (kk = 0; kk < rmajor_repeat[ii]; kk++) {
		           *cptr = *ptr;  /* copy 1 byte */
		           ptr++;
		           cptr += 8;  
		         }
		       }
		       break;

		default: /*  should never get here */
	            ffpmsg("Error: unexpected attempt to use GZIP_2 to compress a column unsuitable data type");
		    *status = DATA_DECOMPRESSION_ERR;
                    free(rm_buffer);  free(cm_buffer);
	            return(*status);

	        }  /* end of switch  for shuffling the bytes*/

            } else {  /* not GZIP_2, don't have to shuffle bytes, so just transpose the rows and columns */

	         for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output table */
		     cptr = rm_buffer + (rmajor_colstart[ii] + jj * rmajor_colstart[ncols]);   /* addr to copy to */
		     memcpy(cptr, ptr, (size_t) rmajor_colwidth[ii]);
	 
		     ptr += (rmajor_colwidth[ii]);
		 }
	    }
        } else {  /* transpose the variable length array pointers */

              for (jj = 0; jj < rowspertile; jj++) {  /* loop over number of rows in the output uncompressed table */
	        cptr = rm_buffer + (rmajor_colstart[ii] + jj * rmajor_colstart[ncols]);   /* addr to copy to */
	        memcpy(cptr, ptr, (size_t) rmajor_colwidth[ii]);
	 
	        ptr += (rmajor_colwidth[ii]);
	      }

	      if (rmajor_colwidth[ii] == 8 ) {  /* these are P-type descriptors */
	           pdescript = (int *) (cm_buffer + cmajor_colstart[ii]);
#if BYTESWAPPED
	           ffswap4((int *) pdescript,  rowspertile * 2);  /* byte-swap the descriptor */
#endif
	      } else if (rmajor_colwidth[ii] == 16 ) {  /* these are Q-type descriptors */
	           qdescript = (LONGLONG *) (cm_buffer + cmajor_colstart[ii]);
#if BYTESWAPPED
	           ffswap8((double *) qdescript,  rowspertile * 2); /* byte-swap the descriptor */
#endif
	      } else { /* this should never happen */
	            ffpmsg("Error: Descriptor column is neither 8 nor 16 bytes wide");
                    free(rm_buffer);  free(cm_buffer);
		    *status = DATA_DECOMPRESSION_ERR;
	            return(*status);
	      }	
	      	
	      /* First, set pointer to the Q descriptors, and byte-swap them, if needed */
	      descript = (LONGLONG*) (cm_buffer + cmajor_colstart[ii] + (rmajor_colwidth[ii] * rowspertile));
#if BYTESWAPPED
	      /* byte-swap the descriptor */
	      ffswap8((double *) descript,  rowspertile * 2);
#endif

	      /* now uncompress all the individual VLAs, and */
	      /* write them to their original location in the uncompressed file */

	      for (jj = 0; jj < rowspertile; jj++)   {    /* loop over rows */
                    /* get the size and location of the compressed VLA in the compressed table */
		    cvlalen = descript[jj * 2];
		    cvlastart = descript[(jj * 2) + 1]; 
		    if (cvlalen > 0 ) {

			/* get the size and location to write the uncompressed VLA in the uncompressed table */
			if (rmajor_colwidth[ii] == 8 ) { 
			    vlalen = pdescript[jj * 2];
			    vlastart = pdescript[(jj * 2) + 1];
			} else  {
			    vlalen = qdescript[jj * 2];
			    vlastart = qdescript[(jj * 2) + 1];
			}			
			vlamemlen = (size_t) (vlalen * (-coltype[ii] / 10));  /* size of the uncompressed VLA, in bytes */

			/* allocate memory for the compressed vla */
			compressed_vla = malloc( (size_t) cvlalen);
			if (!compressed_vla) {
			    ffpmsg("Could not allocate buffer for compressed VLA");
			    free(rm_buffer);  free(cm_buffer);
			    *status = MEMORY_ALLOCATION;
			    return(*status);
			}

			/* read the compressed VLA from the heap in the input compressed table */
			bytepos = (size_t) ((infptr->Fptr)->datastart + (infptr->Fptr)->heapstart + cvlastart);
			ffmbyt(infptr, bytepos, REPORT_EOF, status);
			ffgbyt(infptr, cvlalen, compressed_vla, status);  /* read the bytes */
			/* if the VLA couldn't be compressed, just copy it directly to the output uncompressed table */
			if (cvlalen   == vlamemlen ) {
			    bytepos = (size_t) ((outfptr->Fptr)->datastart + (outfptr->Fptr)->heapstart + vlastart);
			    ffmbyt(outfptr, bytepos, IGNORE_EOF, status);
			    ffpbyt(outfptr, cvlalen, compressed_vla, status);  /* write the bytes */
			} else {  /* uncompress the VLA  */
		  
			    /* allocate memory for the uncompressed VLA */
			    uncompressed_vla =  malloc(vlamemlen);
			    if (!uncompressed_vla) {
				ffpmsg("Could not allocate buffer for uncompressed VLA");
				*status = MEMORY_ALLOCATION;
			        free(compressed_vla); free(rm_buffer);  free(cm_buffer);
				return(*status);
			    }
			    /* uncompress the VLA with the appropriate algorithm */
			    if (zctype[ii] == RICE_1) {

				if (-coltype[ii] == TSHORT) {
				    dlen = fits_rdecomp_short((unsigned char *) compressed_vla, (int) cvlalen, (unsigned short *)uncompressed_vla, 
					(int) vlalen, 32);
#if BYTESWAPPED
				   ffswap2((short *) uncompressed_vla, (long) vlalen); 
#endif
				} else if (-coltype[ii] == TLONG) {
				    dlen = fits_rdecomp((unsigned char *) compressed_vla, (int) cvlalen, (unsigned int *)uncompressed_vla, 
					(int) vlalen, 32);
#if BYTESWAPPED
				   ffswap4((int *) uncompressed_vla, (long) vlalen); 
#endif
 				} else if (-coltype[ii] == TBYTE) {
				    dlen = fits_rdecomp_byte((unsigned char *) compressed_vla, (int) cvlalen, (unsigned char *) uncompressed_vla, 
					(int) vlalen, 32);
				} else {
				    /* this should not happen */
				    ffpmsg(" Error: cannot uncompress this column type with the RICE algorthm");

				    *status = DATA_DECOMPRESSION_ERR;
			            free(uncompressed_vla); free(compressed_vla); free(rm_buffer);  free(cm_buffer);
				    return(*status);
				}  

			    } else if (zctype[ii] == GZIP_1 || zctype[ii] == GZIP_2){  

			       /*: gzip uncompress the array of bytes */
			       uncompress2mem_from_mem( compressed_vla, (size_t) cvlalen, &uncompressed_vla, &vlamemlen, realloc, &vlamemlen, status);

			       if (zctype[ii] == GZIP_2 ) {
				  /* unshuffle the bytes after ungzipping them */
				  if ( (int) (-coltype[ii] / 10) == 2) {
				    fits_unshuffle_2bytes((char *) uncompressed_vla, vlalen, status);
				  } else if ( (int) (-coltype[ii] / 10) == 4) {
				    fits_unshuffle_4bytes((char *) uncompressed_vla, vlalen, status);
				  } else if ( (int) (-coltype[ii] / 10) == 8) {
				    fits_unshuffle_8bytes((char *) uncompressed_vla, vlalen, status);
				  }
			       }

			    } else {
				/* this should not happen */
				ffpmsg(" Error: unknown compression algorthm");
			        free(uncompressed_vla); free(compressed_vla); free(rm_buffer);  free(cm_buffer);
				*status = DATA_COMPRESSION_ERR;
				return(*status);
			    }  		     

			    bytepos = (size_t) ((outfptr->Fptr)->datastart + (outfptr->Fptr)->heapstart + vlastart);
			    ffmbyt(outfptr, bytepos, IGNORE_EOF, status);
			    ffpbyt(outfptr, vlamemlen, uncompressed_vla, status);  /* write the bytes */
			    
			     free(uncompressed_vla);
			}  /* end of uncompress VLA */

		        free(compressed_vla);

		  } /* end of vlalen > 0 */
		} /* end of loop over rowspertile */

              } /* end of variable length array section*/
           }  /* end of if column repeat > 0 */
        }  /* end of ncols loop */

        /* copy the buffer of data to the output data unit */

        if (datastart == 0) fits_get_hduaddrll(outfptr, &headstart, &datastart, &dataend, status);        

        ffmbyt(outfptr, datastart, 1, status);
        ffpbyt(outfptr, naxis1 * rowspertile, rm_buffer, status);

	/* increment pointers for next tile */
	rowstart += rowspertile;
        rowsremain -= rowspertile;
	datastart += (naxis1 * rowspertile);
	if (rowspertile > rowsremain) rowspertile = (long) rowsremain;

    }  /* end of while rows still remain */

    free(rm_buffer);
    free(cm_buffer);
	
    /* reset internal table structure parameters */
    fits_set_hdustruc(outfptr, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
static int fits_shuffle_2bytes(char *heap, LONGLONG length, int *status)

/* shuffle the bytes in an array of 2-byte integers in the heap */

{
    LONGLONG ii;
    char *ptr, *cptr, *heapptr;
    
    ptr = malloc((size_t) (length * 2));
    heapptr = heap;
    cptr = ptr;
    
    for (ii = 0; ii < length; ii++) {
       *cptr = *heapptr;
       heapptr++;
       *(cptr + length) = *heapptr;
       heapptr++;
       cptr++;
    }
         
    memcpy(heap, ptr, (size_t) (length * 2));
    free(ptr);
    return(*status);
}
/*--------------------------------------------------------------------------*/
static int fits_shuffle_4bytes(char *heap, LONGLONG length, int *status)

/* shuffle the bytes in an array of 4-byte integers or floats  */

{
    LONGLONG ii;
    char *ptr, *cptr, *heapptr;
    
    ptr = malloc((size_t) (length * 4));
    if (!ptr) {
      ffpmsg("malloc failed\n");
      return(*status);
    }

    heapptr = heap;
    cptr = ptr;
 
    for (ii = 0; ii < length; ii++) {
       *cptr = *heapptr;
       heapptr++;
       *(cptr + length) = *heapptr;
       heapptr++;
       *(cptr + (length * 2)) = *heapptr;
       heapptr++;
       *(cptr + (length * 3)) = *heapptr;
       heapptr++;
       cptr++;
    }
        
    memcpy(heap, ptr, (size_t) (length * 4));
    free(ptr);

    return(*status);
}
/*--------------------------------------------------------------------------*/
static int fits_shuffle_8bytes(char *heap, LONGLONG length, int *status)

/* shuffle the bytes in an array of 8-byte integers or doubles in the heap */

{
    LONGLONG ii;
    char *ptr, *cptr, *heapptr;
    
    ptr = calloc(1, (size_t) (length * 8));
    heapptr = heap;
    
/* for some bizarre reason this loop fails to compile under OpenSolaris using
   the proprietary SunStudioExpress C compiler;  use the following equivalent
   loop instead.
   
    cptr = ptr;

    for (ii = 0; ii < length; ii++) {
       *cptr = *heapptr;
       heapptr++;
       *(cptr + length) = *heapptr;
       heapptr++;
       *(cptr + (length * 2)) = *heapptr;
       heapptr++;
       *(cptr + (length * 3)) = *heapptr;
       heapptr++;
       *(cptr + (length * 4)) = *heapptr;
       heapptr++;
       *(cptr + (length * 5)) = *heapptr;
       heapptr++;
       *(cptr + (length * 6)) = *heapptr;
       heapptr++;
       *(cptr + (length * 7)) = *heapptr;
       heapptr++;
       cptr++;
     }
*/
     for (ii = 0; ii < length; ii++) {
        cptr = ptr + ii;

        *cptr = *heapptr;

        heapptr++;
        cptr += length;
        *cptr = *heapptr;

        heapptr++;
        cptr += length;
        *cptr = *heapptr;

        heapptr++;
        cptr += length;
        *cptr = *heapptr;

        heapptr++;
        cptr += length;
        *cptr = *heapptr;

        heapptr++;
        cptr += length;
        *cptr = *heapptr;

        heapptr++;
        cptr += length;
        *cptr = *heapptr;

        heapptr++;
        cptr += length;
        *cptr = *heapptr;

        heapptr++;
     }
        
    memcpy(heap, ptr, (size_t) (length * 8));
    free(ptr);
 
    return(*status);
}
/*--------------------------------------------------------------------------*/
static int fits_unshuffle_2bytes(char *heap, LONGLONG length, int *status)

/* unshuffle the bytes in an array of 2-byte integers */

{
    LONGLONG ii;
    char *ptr, *cptr, *heapptr;
    
    ptr = malloc((size_t) (length * 2));
    heapptr = heap + (2 * length) - 1;
    cptr = ptr + (2 * length) - 1;
    
    for (ii = 0; ii < length; ii++) {
       *cptr = *heapptr;
       cptr--;
       *cptr = *(heapptr - length);
       cptr--;
       heapptr--;
    }
         
    memcpy(heap, ptr, (size_t) (length * 2));
    free(ptr);
    return(*status);
}
/*--------------------------------------------------------------------------*/
static int fits_unshuffle_4bytes(char *heap, LONGLONG length, int *status)

/* unshuffle the bytes in an array of 4-byte integers or floats */

{
    LONGLONG ii;
    char *ptr, *cptr, *heapptr;
    
    ptr = malloc((size_t) (length * 4));
    heapptr = heap + (4 * length) -1;
    cptr = ptr + (4 * length) -1;
 
    for (ii = 0; ii < length; ii++) {
       *cptr = *heapptr;
       cptr--;
       *cptr = *(heapptr - length);
       cptr--;
       *cptr = *(heapptr - (2 * length));
       cptr--;
       *cptr = *(heapptr - (3 * length));
       cptr--;
       heapptr--;
    }
        
    memcpy(heap, ptr, (size_t) (length * 4));
    free(ptr);
    return(*status);
}
/*--------------------------------------------------------------------------*/
static int fits_unshuffle_8bytes(char *heap, LONGLONG length, int *status)

/* unshuffle the bytes in an array of 8-byte integers or doubles */

{
    LONGLONG ii;
    char *ptr, *cptr, *heapptr;
    
    ptr = malloc((size_t) (length * 8));
    heapptr = heap + (8 * length) - 1;
    cptr = ptr + (8 * length)  -1;
    
    for (ii = 0; ii < length; ii++) {
       *cptr = *heapptr;
       cptr--;
       *cptr = *(heapptr - length);
       cptr--;
       *cptr = *(heapptr - (2 * length));
       cptr--;
       *cptr = *(heapptr - (3 * length));
       cptr--;
       *cptr = *(heapptr - (4 * length));
       cptr--;
       *cptr = *(heapptr - (5 * length));
       cptr--;
       *cptr = *(heapptr - (6 * length));
       cptr--;
       *cptr = *(heapptr - (7 * length));
       cptr--;
       heapptr--;
    }
       
    memcpy(heap, ptr, (size_t) (length * 8));
    free(ptr);
    return(*status);
}
/*--------------------------------------------------------------------------*/
static int fits_int_to_longlong_inplace(int *intarray, long length, int *status)

/* convert the input array of 32-bit integers into an array of 64-bit integers,
in place. This will overwrite the input array with the new longer array starting
at the same memory location.  

Note that aliasing the same memory location with pointers of different datatypes is
not allowed in strict ANSI C99, however it is  used here for efficency. In principle,
one could simply copy the input array in reverse order to the output array,
but this only works if the compiler performs the operation in strict order.  Certain
compiler optimization techniques may vioate this assumption.  Therefore, we first
copy a section of the input array to a temporary intermediate array, before copying
the longer datatype values back to the original array.
*/

{
    LONGLONG *longlongarray, *aliasarray;
    long ii, ntodo, firstelem, nmax = 10000;
    
    if (*status > 0) 
        return(*status);

    ntodo = nmax;
    if (length < nmax) ntodo = length;
    
    firstelem = length - ntodo;  /* first element to be converted */
    
    longlongarray = (LONGLONG *) malloc(ntodo * sizeof(LONGLONG));
    
    if (longlongarray == NULL)
    {
	ffpmsg("Out of memory. (fits_int_to_longlong_inplace)");
	return (*status = MEMORY_ALLOCATION);
    }

    aliasarray = (LONGLONG *) intarray; /* alias pointer to the input array */

    while (ntodo > 0) {
    
	/* do datatype conversion into temp array */
        for (ii = 0; ii < ntodo; ii++) { 
	    longlongarray[ii] = intarray[ii + firstelem];
        }

        /* copy temp array back to alias */
        memcpy(&(aliasarray[firstelem]), longlongarray, ntodo * 8);
	
        if (firstelem == 0) {  /* we are all done */
	    ntodo = 0;   
	} else {  /* recalculate ntodo and firstelem for next loop */
	    if (firstelem > nmax) {
	        firstelem -= nmax;
	    } else {
	        ntodo = firstelem;
	        firstelem = 0;
	    }
	}
    }

    free(longlongarray);
    return(*status);
}
/*--------------------------------------------------------------------------*/
static int fits_short_to_int_inplace(short *shortarray, long length, int shift, int *status)

/* convert the input array of 16-bit integers into an array of 32-bit integers,
in place. This will overwrite the input array with the new longer array starting
at the same memory location.  

Note that aliasing the same memory location with pointers of different datatypes is
not allowed in strict ANSI C99, however it is  used here for efficency. In principle,
one could simply copy the input array in reverse order to the output array,
but this only works if the compiler performs the operation in strict order.  Certain
compiler optimization techniques may vioate this assumption.  Therefore, we first
copy a section of the input array to a temporary intermediate array, before copying
the longer datatype values back to the original array.
*/

{
    int *intarray, *aliasarray;
    long ii, ntodo, firstelem, nmax = 10000;
    
    if (*status > 0) 
        return(*status);

    ntodo = nmax;
    if (length < nmax) ntodo = length;
    
    firstelem = length - ntodo;  /* first element to be converted */
    
    intarray = (int *) malloc(ntodo * sizeof(int));
    
    if (intarray == NULL)
    {
	ffpmsg("Out of memory. (fits_short_to_int_inplace)");
	return (*status = MEMORY_ALLOCATION);
    }

    aliasarray = (int *) shortarray; /* alias pointer to the input array */

    while (ntodo > 0) {
    
	/* do datatype conversion into temp array */
        for (ii = 0; ii < ntodo; ii++) { 
	    intarray[ii] = (int)(shortarray[ii + firstelem]) + shift;
        }

        /* copy temp array back to alias */
        memcpy(&(aliasarray[firstelem]), intarray, ntodo * 4);
	
        if (firstelem == 0) {  /* we are all done */
	    ntodo = 0;   
	} else {  /* recalculate ntodo and firstelem for next loop */
	    if (firstelem > nmax) {
	        firstelem -= nmax;
	    } else {
	        ntodo = firstelem;
	        firstelem = 0;
	    }
	}
    }

    free(intarray);
    return(*status);
}
/*--------------------------------------------------------------------------*/
static int fits_ushort_to_int_inplace(unsigned short *ushortarray, long length, 
                                      int shift, int *status)

/* convert the input array of 16-bit unsigned integers into an array of 32-bit integers,
in place. This will overwrite the input array with the new longer array starting
at the same memory location.  

Note that aliasing the same memory location with pointers of different datatypes is
not allowed in strict ANSI C99, however it is  used here for efficency. In principle,
one could simply copy the input array in reverse order to the output array,
but this only works if the compiler performs the operation in strict order.  Certain
compiler optimization techniques may vioate this assumption.  Therefore, we first
copy a section of the input array to a temporary intermediate array, before copying
the longer datatype values back to the original array.
*/

{
    int *intarray, *aliasarray;
    long ii, ntodo, firstelem, nmax = 10000;
    
    if (*status > 0) 
        return(*status);

    ntodo = nmax;
    if (length < nmax) ntodo = length;
    
    firstelem = length - ntodo;  /* first element to be converted */
    
    intarray = (int *) malloc(ntodo * sizeof(int));
    
    if (intarray == NULL)
    {
	ffpmsg("Out of memory. (fits_ushort_to_int_inplace)");
	return (*status = MEMORY_ALLOCATION);
    }

    aliasarray = (int *) ushortarray; /* alias pointer to the input array */

    while (ntodo > 0) {
    
	/* do datatype conversion into temp array */
        for (ii = 0; ii < ntodo; ii++) { 
	    intarray[ii] = (int)(ushortarray[ii + firstelem]) + shift;
        }

        /* copy temp array back to alias */
        memcpy(&(aliasarray[firstelem]), intarray, ntodo * 4);
	
        if (firstelem == 0) {  /* we are all done */
	    ntodo = 0;   
	} else {  /* recalculate ntodo and firstelem for next loop */
	    if (firstelem > nmax) {
	        firstelem -= nmax;
	    } else {
	        ntodo = firstelem;
	        firstelem = 0;
	    }
	}
    }

    free(intarray);
    return(*status);
}
/*--------------------------------------------------------------------------*/
static int fits_ubyte_to_int_inplace(unsigned char *ubytearray, long length, 
                                      int *status)

/* convert the input array of 8-bit unsigned integers into an array of 32-bit integers,
in place. This will overwrite the input array with the new longer array starting
at the same memory location.  

Note that aliasing the same memory location with pointers of different datatypes is
not allowed in strict ANSI C99, however it is  used here for efficency. In principle,
one could simply copy the input array in reverse order to the output array,
but this only works if the compiler performs the operation in strict order.  Certain
compiler optimization techniques may vioate this assumption.  Therefore, we first
copy a section of the input array to a temporary intermediate array, before copying
the longer datatype values back to the original array.
*/

{
    int *intarray, *aliasarray;
    long ii, ntodo, firstelem, nmax = 10000;
    
    if (*status > 0) 
        return(*status);

    ntodo = nmax;
    if (length < nmax) ntodo = length;
    
    firstelem = length - ntodo;  /* first element to be converted */
    
    intarray = (int *) malloc(ntodo * sizeof(int));
    
    if (intarray == NULL)
    {
	ffpmsg("Out of memory. (fits_ubyte_to_int_inplace)");
	return (*status = MEMORY_ALLOCATION);
    }

    aliasarray = (int *) ubytearray; /* alias pointer to the input array */

    while (ntodo > 0) {
    
	/* do datatype conversion into temp array */
        for (ii = 0; ii < ntodo; ii++) { 
	    intarray[ii] = ubytearray[ii + firstelem];
        }

        /* copy temp array back to alias */
        memcpy(&(aliasarray[firstelem]), intarray, ntodo * 4);
	
        if (firstelem == 0) {  /* we are all done */
	    ntodo = 0;   
	} else {  /* recalculate ntodo and firstelem for next loop */
	    if (firstelem > nmax) {
	        firstelem -= nmax;
	    } else {
	        ntodo = firstelem;
	        firstelem = 0;
	    }
	}
    }

    free(intarray);
    return(*status);
}
/*--------------------------------------------------------------------------*/
static int fits_sbyte_to_int_inplace(signed char *sbytearray, long length, 
                                      int *status)

/* convert the input array of 8-bit signed integers into an array of 32-bit integers,
in place. This will overwrite the input array with the new longer array starting
at the same memory location.  

Note that aliasing the same memory location with pointers of different datatypes is
not allowed in strict ANSI C99, however it is  used here for efficency. In principle,
one could simply copy the input array in reverse order to the output array,
but this only works if the compiler performs the operation in strict order.  Certain
compiler optimization techniques may vioate this assumption.  Therefore, we first
copy a section of the input array to a temporary intermediate array, before copying
the longer datatype values back to the original array.
*/

/*
!!!!!!!!!!!!!!!!!
NOTE THAT THIS IS A SPECIALIZED ROUTINE THAT ADDS AN OFFSET OF 128 TO THE ARRAY VALUES
!!!!!!!!!!!!!!!!!
*/

{
    int *intarray, *aliasarray;
    long ii, ntodo, firstelem, nmax = 10000;
    
    if (*status > 0) 
        return(*status);

    ntodo = nmax;
    if (length < nmax) ntodo = length;
    
    firstelem = length - ntodo;  /* first element to be converted */
    
    intarray = (int *) malloc(ntodo * sizeof(int));
    
    if (intarray == NULL)
    {
	ffpmsg("Out of memory. (fits_sbyte_to_int_inplace)");
	return (*status = MEMORY_ALLOCATION);
    }

    aliasarray = (int *) sbytearray; /* alias pointer to the input array */

    while (ntodo > 0) {
    
	/* do datatype conversion into temp array */
        for (ii = 0; ii < ntodo; ii++) { 
	    intarray[ii] = sbytearray[ii + firstelem] + 128;  /* !! Note the offset !! */
        }

        /* copy temp array back to alias */
        memcpy(&(aliasarray[firstelem]), intarray, ntodo * 4);
	
        if (firstelem == 0) {  /* we are all done */
	    ntodo = 0;   
	} else {  /* recalculate ntodo and firstelem for next loop */
	    if (firstelem > nmax) {
	        firstelem -= nmax;
	    } else {
	        ntodo = firstelem;
	        firstelem = 0;
	    }
	}
    }

    free(intarray);
    return(*status);
}

int fits_calc_tile_rows(long *tlpixel, long *tfpixel, int ndim, long *trowsize, long *ntrows, int *status)
{

   /*  The quantizing algorithms treat all N-dimensional tiles as if they
       were 2 dimensions (trowsize * ntrows).  This sets trowsize to the
       first dimensional size encountered that's > 1 (typically the X dimension).
       ntrows will then be the product of the remaining dimensional sizes.
       
       Examples:  Tile = (5,4,1,3):  trowsize=5, ntrows=12
                  Tile = (1,1,5):  trowsize=5, ntrows=1
   */

   int ii;
   long np;
   
   if (*status)
      return (*status);
    
   *trowsize = 0; 
   *ntrows = 1;  
   for (ii=0; ii 1)
      {
         if (!(*trowsize))
            *trowsize = np;
         else
            *ntrows *= np;
      }
   }
   if (!(*trowsize))
   {
      /* Should only get here for the unusual case of all tile dimensions 
         having size = 1  */
      *trowsize = 1;
   }  
      
   return (*status);
}
cfitsio-3.47/imcopy.c0000644000225700000360000002223013464573432014053 0ustar  cagordonlhea#include 
#include 
#include 
#include "fitsio.h"

int main(int argc, char *argv[])
{
    fitsfile *infptr, *outfptr;   /* FITS file pointers defined in fitsio.h */
    int status = 0, tstatus, ii = 1, iteration = 0, single = 0, hdupos;
    int hdutype, bitpix, bytepix, naxis = 0, nkeys, datatype = 0, anynul;
    long naxes[9] = {1, 1, 1, 1, 1, 1, 1, 1, 1};
    long first, totpix = 0, npix;
    double *array, bscale = 1.0, bzero = 0.0, nulval = 0.;
    char card[81];

    if (argc != 3)
    {
 printf("\n");
 printf("Usage:  imcopy inputImage outputImage[compress]\n");
 printf("\n");
 printf("Copy an input image to an output image, optionally compressing\n");
 printf("or uncompressing the image in the process.  If the [compress]\n");
 printf("qualifier is appended to the output file name then the input image\n");
 printf("will be compressed using the tile-compressed format.  In this format,\n");
 printf("the image is divided into rectangular tiles and each tile of pixels\n");
 printf("is compressed and stored in a variable-length row of a binary table.\n");
 printf("If the [compress] qualifier is omitted, and the input image is\n");
 printf("in tile-compressed format, then the output image will be uncompressed.\n");
 printf("\n");
 printf("If an extension name or number is appended to the input file name, \n");
 printf("enclosed in square brackets, then only that single extension will be\n");
 printf("copied to the output file.  Otherwise, every extension in the input file\n");
 printf("will be processed in turn and copied to the output file.\n");
 printf("\n");
 printf("Examples:\n");
 printf("\n");
 printf("1)  imcopy image.fit 'cimage.fit[compress]'\n");
 printf("\n");
 printf("    This compresses the input image using the default parameters, i.e.,\n");
 printf("    using the Rice compression algorithm and using row by row tiles.\n");
 printf("\n");
 printf("2)  imcopy cimage.fit image2.fit\n");
 printf("\n");
 printf("    This uncompresses the image created in the first example.\n");
 printf("    image2.fit should be identical to image.fit if the image\n");
 printf("    has an integer datatype.  There will be small differences\n");
 printf("    in the pixel values if it is a floating point image.\n");
 printf("\n");
 printf("3)  imcopy image.fit 'cimage.fit[compress GZIP 100,100;q 16]'\n");
 printf("\n");
 printf("    This compresses the input image using the following parameters:\n");
 printf("         GZIP compression algorithm;\n");
 printf("         100 X 100 pixel compression tiles;\n");
 printf("         quantization level = 16 (only used with floating point images)\n");
 printf("\n");
 printf("The full syntax of the compression qualifier is:\n");
 printf("    [compress ALGORITHM TDIM1,TDIM2,...; q QLEVEL s SCALE]\n");
 printf("where the allowed ALGORITHM values are:\n");
 printf("      Rice, HCOMPRESS, HSCOMPRESS, GZIP, or PLIO. \n");
 printf("       (HSCOMPRESS is a variant of HCOMPRESS in which a small\n");
 printf("        amount of smoothing is applied to the uncompressed image\n");
 printf("        to help suppress blocky compression artifacts in the image\n");
 printf("        when using large values for the 'scale' parameter).\n");
 printf("TDIMn is the size of the compression tile in each dimension,\n");
 printf("\n");
 printf("QLEVEL specifies the quantization level when converting a floating\n");
 printf("point image into integers, prior to compressing the image.  The\n");
 printf("default value = 16, which means the image will be quantized into\n");
 printf("integer levels that are spaced at intervals of sigma/16., where \n");
 printf("sigma is the estimated noise level in background areas of the image.\n");
 printf("If QLEVEL is negative, this means use the absolute value for the\n");
 printf("quantization spacing (e.g. 'q -0.005' means quantize the floating\n");
 printf("point image such that the scaled integers represent steps of 0.005\n");
 printf("in the original image).\n");
 printf("\n");
 printf("SCALE is the integer scale factor that only applies to the HCOMPRESS\n");
 printf("algorithm.  The default value SCALE = 0 forces the image to be\n");
 printf("losslessly compressed; Greater amounts of lossy compression (resulting\n");
 printf("in smaller compressed files) can be specified with larger SCALE values.\n");
 printf("\n");
 printf("\n");
 printf("Note that it may be necessary to enclose the file names\n");
 printf("in single quote characters on the Unix command line.\n");
      return(0);
    }

    /* Open the input file and create output file */
    fits_open_file(&infptr, argv[1], READONLY, &status);
    fits_create_file(&outfptr, argv[2], &status);

    if (status != 0) {    
        fits_report_error(stderr, status);
        return(status);
    }

    fits_get_hdu_num(infptr, &hdupos);  /* Get the current HDU position */

    /* Copy only a single HDU if a specific extension was given */ 
    if (hdupos != 1 || strchr(argv[1], '[')) single = 1;

    for (; !status; hdupos++)  /* Main loop through each extension */
    {

      fits_get_hdu_type(infptr, &hdutype, &status);

      if (hdutype == IMAGE_HDU) {

          /* get image dimensions and total number of pixels in image */
          for (ii = 0; ii < 9; ii++)
              naxes[ii] = 1;

          fits_get_img_param(infptr, 9, &bitpix, &naxis, naxes, &status);

          totpix = naxes[0] * naxes[1] * naxes[2] * naxes[3] * naxes[4]
             * naxes[5] * naxes[6] * naxes[7] * naxes[8];
      }

      if (hdutype != IMAGE_HDU || naxis == 0 || totpix == 0) { 

          /* just copy tables and null images */
          fits_copy_hdu(infptr, outfptr, 0, &status);

      } else {

          /* Explicitly create new image, to support compression */
          fits_create_img(outfptr, bitpix, naxis, naxes, &status);
          if (status) {
                 fits_report_error(stderr, status);
                 return(status);
          }

          if (fits_is_compressed_image(outfptr, &status)) {
              /* write default EXTNAME keyword if it doesn't already exist */
	      tstatus = 0;
              fits_read_card(infptr, "EXTNAME", card, &tstatus);
	      if (tstatus) {
	         strcpy(card, "EXTNAME = 'COMPRESSED_IMAGE'   / name of this binary table extension");
	         fits_write_record(outfptr, card, &status);
	      }
          }
	  	    
          /* copy all the user keywords (not the structural keywords) */
          fits_get_hdrspace(infptr, &nkeys, NULL, &status); 

          for (ii = 1; ii <= nkeys; ii++) {
              fits_read_record(infptr, ii, card, &status);
              if (fits_get_keyclass(card) > TYP_CMPRS_KEY)
                  fits_write_record(outfptr, card, &status);
          }

              /* delete default EXTNAME keyword if it exists */
/*
          if (!fits_is_compressed_image(outfptr, &status)) {
	      tstatus = 0;
              fits_read_key(outfptr, TSTRING, "EXTNAME", card, NULL, &tstatus);
	      if (!tstatus) {
	         if (strcmp(card, "COMPRESSED_IMAGE") == 0)
	            fits_delete_key(outfptr, "EXTNAME", &status);
	      }
          }
*/
	  
          switch(bitpix) {
              case BYTE_IMG:
                  datatype = TBYTE;
                  break;
              case SHORT_IMG:
                  datatype = TSHORT;
                  break;
              case LONG_IMG:
                  datatype = TINT;
                  break;
              case FLOAT_IMG:
                  datatype = TFLOAT;
                  break;
              case DOUBLE_IMG:
                  datatype = TDOUBLE;
                  break;
          }

          bytepix = abs(bitpix) / 8;

          npix = totpix;
          iteration = 0;

          /* try to allocate memory for the entire image */
          /* use double type to force memory alignment */
          array = (double *) calloc(npix, bytepix);

          /* if allocation failed, divide size by 2 and try again */
          while (!array && iteration < 10)  {
              iteration++;
              npix = npix / 2;
              array = (double *) calloc(npix, bytepix);
          }

          if (!array)  {
              printf("Memory allocation error\n");
              return(0);
          }

          /* turn off any scaling so that we copy the raw pixel values */
          fits_set_bscale(infptr,  bscale, bzero, &status);
          fits_set_bscale(outfptr, bscale, bzero, &status);

          first = 1;
          while (totpix > 0 && !status)
          {
             /* read all or part of image then write it back to the output file */
             fits_read_img(infptr, datatype, first, npix, 
                     &nulval, array, &anynul, &status);

             fits_write_img(outfptr, datatype, first, npix, array, &status);
             totpix = totpix - npix;
             first  = first  + npix;
          }
          free(array);
      }

      if (single) break;  /* quit if only copying a single HDU */
      fits_movrel_hdu(infptr, 1, NULL, &status);  /* try to move to next HDU */
    }

    if (status == END_OF_FILE)  status = 0; /* Reset after normal error */

    fits_close_file(outfptr,  &status);
    fits_close_file(infptr, &status);

    /* if error occurred, print out error message */
    if (status)
       fits_report_error(stderr, status);
    return(status);
}
cfitsio-3.47/install-sh0000755000225700000360000003471713464573432014430 0ustar  cagordonlhea#!/bin/sh
# install - install a program, script, or datafile

scriptversion=2017-09-23.17; # UTC

# This originates from X11R5 (mit/util/scripts/install.sh), which was
# later released in X11R6 (xc/config/util/install.sh) with the
# following copyright and license.
#
# Copyright (C) 1994 X Consortium
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to
# deal in the Software without restriction, including without limitation the
# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
# sell copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in
# all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC-
# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
#
# Except as contained in this notice, the name of the X Consortium shall not
# be used in advertising or otherwise to promote the sale, use or other deal-
# ings in this Software without prior written authorization from the X Consor-
# tium.
#
#
# FSF changes to this file are in the public domain.
#
# Calling this script install-sh is preferred over install.sh, to prevent
# 'make' implicit rules from creating a file called install from it
# when there is no Makefile.
#
# This script is compatible with the BSD install script, but was written
# from scratch.

tab='	'
nl='
'
IFS=" $tab$nl"

# Set DOITPROG to "echo" to test this script.

doit=${DOITPROG-}
doit_exec=${doit:-exec}

# Put in absolute file names if you don't have them in your path;
# or use environment vars.

chgrpprog=${CHGRPPROG-chgrp}
chmodprog=${CHMODPROG-chmod}
chownprog=${CHOWNPROG-chown}
cmpprog=${CMPPROG-cmp}
cpprog=${CPPROG-cp}
mkdirprog=${MKDIRPROG-mkdir}
mvprog=${MVPROG-mv}
rmprog=${RMPROG-rm}
stripprog=${STRIPPROG-strip}

posix_mkdir=

# Desired mode of installed file.
mode=0755

chgrpcmd=
chmodcmd=$chmodprog
chowncmd=
mvcmd=$mvprog
rmcmd="$rmprog -f"
stripcmd=

src=
dst=
dir_arg=
dst_arg=

copy_on_change=false
is_target_a_directory=possibly

usage="\
Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE
   or: $0 [OPTION]... SRCFILES... DIRECTORY
   or: $0 [OPTION]... -t DIRECTORY SRCFILES...
   or: $0 [OPTION]... -d DIRECTORIES...

In the 1st form, copy SRCFILE to DSTFILE.
In the 2nd and 3rd, copy all SRCFILES to DIRECTORY.
In the 4th, create DIRECTORIES.

Options:
     --help     display this help and exit.
     --version  display version info and exit.

  -c            (ignored)
  -C            install only if different (preserve the last data modification time)
  -d            create directories instead of installing files.
  -g GROUP      $chgrpprog installed files to GROUP.
  -m MODE       $chmodprog installed files to MODE.
  -o USER       $chownprog installed files to USER.
  -s            $stripprog installed files.
  -t DIRECTORY  install into DIRECTORY.
  -T            report an error if DSTFILE is a directory.

Environment variables override the default commands:
  CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG
  RMPROG STRIPPROG
"

while test $# -ne 0; do
  case $1 in
    -c) ;;

    -C) copy_on_change=true;;

    -d) dir_arg=true;;

    -g) chgrpcmd="$chgrpprog $2"
        shift;;

    --help) echo "$usage"; exit $?;;

    -m) mode=$2
        case $mode in
          *' '* | *"$tab"* | *"$nl"* | *'*'* | *'?'* | *'['*)
            echo "$0: invalid mode: $mode" >&2
            exit 1;;
        esac
        shift;;

    -o) chowncmd="$chownprog $2"
        shift;;

    -s) stripcmd=$stripprog;;

    -t)
        is_target_a_directory=always
        dst_arg=$2
        # Protect names problematic for 'test' and other utilities.
        case $dst_arg in
          -* | [=\(\)!]) dst_arg=./$dst_arg;;
        esac
        shift;;

    -T) is_target_a_directory=never;;

    --version) echo "$0 $scriptversion"; exit $?;;

    --) shift
        break;;

    -*) echo "$0: invalid option: $1" >&2
        exit 1;;

    *)  break;;
  esac
  shift
done

# We allow the use of options -d and -T together, by making -d
# take the precedence; this is for compatibility with GNU install.

if test -n "$dir_arg"; then
  if test -n "$dst_arg"; then
    echo "$0: target directory not allowed when installing a directory." >&2
    exit 1
  fi
fi

if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then
  # When -d is used, all remaining arguments are directories to create.
  # When -t is used, the destination is already specified.
  # Otherwise, the last argument is the destination.  Remove it from $@.
  for arg
  do
    if test -n "$dst_arg"; then
      # $@ is not empty: it contains at least $arg.
      set fnord "$@" "$dst_arg"
      shift # fnord
    fi
    shift # arg
    dst_arg=$arg
    # Protect names problematic for 'test' and other utilities.
    case $dst_arg in
      -* | [=\(\)!]) dst_arg=./$dst_arg;;
    esac
  done
fi

if test $# -eq 0; then
  if test -z "$dir_arg"; then
    echo "$0: no input file specified." >&2
    exit 1
  fi
  # It's OK to call 'install-sh -d' without argument.
  # This can happen when creating conditional directories.
  exit 0
fi

if test -z "$dir_arg"; then
  if test $# -gt 1 || test "$is_target_a_directory" = always; then
    if test ! -d "$dst_arg"; then
      echo "$0: $dst_arg: Is not a directory." >&2
      exit 1
    fi
  fi
fi

if test -z "$dir_arg"; then
  do_exit='(exit $ret); exit $ret'
  trap "ret=129; $do_exit" 1
  trap "ret=130; $do_exit" 2
  trap "ret=141; $do_exit" 13
  trap "ret=143; $do_exit" 15

  # Set umask so as not to create temps with too-generous modes.
  # However, 'strip' requires both read and write access to temps.
  case $mode in
    # Optimize common cases.
    *644) cp_umask=133;;
    *755) cp_umask=22;;

    *[0-7])
      if test -z "$stripcmd"; then
        u_plus_rw=
      else
        u_plus_rw='% 200'
      fi
      cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;;
    *)
      if test -z "$stripcmd"; then
        u_plus_rw=
      else
        u_plus_rw=,u+rw
      fi
      cp_umask=$mode$u_plus_rw;;
  esac
fi

for src
do
  # Protect names problematic for 'test' and other utilities.
  case $src in
    -* | [=\(\)!]) src=./$src;;
  esac

  if test -n "$dir_arg"; then
    dst=$src
    dstdir=$dst
    test -d "$dstdir"
    dstdir_status=$?
  else

    # Waiting for this to be detected by the "$cpprog $src $dsttmp" command
    # might cause directories to be created, which would be especially bad
    # if $src (and thus $dsttmp) contains '*'.
    if test ! -f "$src" && test ! -d "$src"; then
      echo "$0: $src does not exist." >&2
      exit 1
    fi

    if test -z "$dst_arg"; then
      echo "$0: no destination specified." >&2
      exit 1
    fi
    dst=$dst_arg

    # If destination is a directory, append the input filename.
    if test -d "$dst"; then
      if test "$is_target_a_directory" = never; then
        echo "$0: $dst_arg: Is a directory" >&2
        exit 1
      fi
      dstdir=$dst
      dstbase=`basename "$src"`
      case $dst in
	*/) dst=$dst$dstbase;;
	*)  dst=$dst/$dstbase;;
      esac
      dstdir_status=0
    else
      dstdir=`dirname "$dst"`
      test -d "$dstdir"
      dstdir_status=$?
    fi
  fi

  case $dstdir in
    */) dstdirslash=$dstdir;;
    *)  dstdirslash=$dstdir/;;
  esac

  obsolete_mkdir_used=false

  if test $dstdir_status != 0; then
    case $posix_mkdir in
      '')
        # Create intermediate dirs using mode 755 as modified by the umask.
        # This is like FreeBSD 'install' as of 1997-10-28.
        umask=`umask`
        case $stripcmd.$umask in
          # Optimize common cases.
          *[2367][2367]) mkdir_umask=$umask;;
          .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;;

          *[0-7])
            mkdir_umask=`expr $umask + 22 \
              - $umask % 100 % 40 + $umask % 20 \
              - $umask % 10 % 4 + $umask % 2
            `;;
          *) mkdir_umask=$umask,go-w;;
        esac

        # With -d, create the new directory with the user-specified mode.
        # Otherwise, rely on $mkdir_umask.
        if test -n "$dir_arg"; then
          mkdir_mode=-m$mode
        else
          mkdir_mode=
        fi

        posix_mkdir=false
        case $umask in
          *[123567][0-7][0-7])
            # POSIX mkdir -p sets u+wx bits regardless of umask, which
            # is incompatible with FreeBSD 'install' when (umask & 300) != 0.
            ;;
          *)
            tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$
            trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0

            if (umask $mkdir_umask &&
                exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1
            then
              if test -z "$dir_arg" || {
                   # Check for POSIX incompatibilities with -m.
                   # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or
                   # other-writable bit of parent directory when it shouldn't.
                   # FreeBSD 6.1 mkdir -m -p sets mode of existing directory.
                   ls_ld_tmpdir=`ls -ld "$tmpdir"`
                   case $ls_ld_tmpdir in
                     d????-?r-*) different_mode=700;;
                     d????-?--*) different_mode=755;;
                     *) false;;
                   esac &&
                   $mkdirprog -m$different_mode -p -- "$tmpdir" && {
                     ls_ld_tmpdir_1=`ls -ld "$tmpdir"`
                     test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1"
                   }
                 }
              then posix_mkdir=:
              fi
              rmdir "$tmpdir/d" "$tmpdir"
            else
              # Remove any dirs left behind by ancient mkdir implementations.
              rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null
            fi
            trap '' 0;;
        esac;;
    esac

    if
      $posix_mkdir && (
        umask $mkdir_umask &&
        $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir"
      )
    then :
    else

      # The umask is ridiculous, or mkdir does not conform to POSIX,
      # or it failed possibly due to a race condition.  Create the
      # directory the slow way, step by step, checking for races as we go.

      case $dstdir in
        /*) prefix='/';;
        [-=\(\)!]*) prefix='./';;
        *)  prefix='';;
      esac

      oIFS=$IFS
      IFS=/
      set -f
      set fnord $dstdir
      shift
      set +f
      IFS=$oIFS

      prefixes=

      for d
      do
        test X"$d" = X && continue

        prefix=$prefix$d
        if test -d "$prefix"; then
          prefixes=
        else
          if $posix_mkdir; then
            (umask=$mkdir_umask &&
             $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break
            # Don't fail if two instances are running concurrently.
            test -d "$prefix" || exit 1
          else
            case $prefix in
              *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;;
              *) qprefix=$prefix;;
            esac
            prefixes="$prefixes '$qprefix'"
          fi
        fi
        prefix=$prefix/
      done

      if test -n "$prefixes"; then
        # Don't fail if two instances are running concurrently.
        (umask $mkdir_umask &&
         eval "\$doit_exec \$mkdirprog $prefixes") ||
          test -d "$dstdir" || exit 1
        obsolete_mkdir_used=true
      fi
    fi
  fi

  if test -n "$dir_arg"; then
    { test -z "$chowncmd" || $doit $chowncmd "$dst"; } &&
    { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } &&
    { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false ||
      test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1
  else

    # Make a couple of temp file names in the proper directory.
    dsttmp=${dstdirslash}_inst.$$_
    rmtmp=${dstdirslash}_rm.$$_

    # Trap to clean up those temp files at exit.
    trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0

    # Copy the file name to the temp name.
    (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") &&

    # and set any options; do chmod last to preserve setuid bits.
    #
    # If any of these fail, we abort the whole thing.  If we want to
    # ignore errors from any of these, just make sure not to ignore
    # errors from the above "$doit $cpprog $src $dsttmp" command.
    #
    { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } &&
    { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } &&
    { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } &&
    { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } &&

    # If -C, don't bother to copy if it wouldn't change the file.
    if $copy_on_change &&
       old=`LC_ALL=C ls -dlL "$dst"     2>/dev/null` &&
       new=`LC_ALL=C ls -dlL "$dsttmp"  2>/dev/null` &&
       set -f &&
       set X $old && old=:$2:$4:$5:$6 &&
       set X $new && new=:$2:$4:$5:$6 &&
       set +f &&
       test "$old" = "$new" &&
       $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1
    then
      rm -f "$dsttmp"
    else
      # Rename the file to the real destination.
      $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null ||

      # The rename failed, perhaps because mv can't rename something else
      # to itself, or perhaps because mv is so ancient that it does not
      # support -f.
      {
        # Now remove or move aside any old file at destination location.
        # We try this two ways since rm can't unlink itself on some
        # systems and the destination file might be busy for other
        # reasons.  In this case, the final cleanup might fail but the new
        # file should still install successfully.
        {
          test ! -f "$dst" ||
          $doit $rmcmd -f "$dst" 2>/dev/null ||
          { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null &&
            { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; }
          } ||
          { echo "$0: cannot unlink or rename $dst" >&2
            (exit 1); exit 1
          }
        } &&

        # Now rename the file to the real destination.
        $doit $mvcmd "$dsttmp" "$dst"
      }
    fi || exit 1

    trap '' 0
  fi
done

# Local variables:
# eval: (add-hook 'write-file-hooks 'time-stamp)
# time-stamp-start: "scriptversion="
# time-stamp-format: "%:y-%02m-%02d.%02H"
# time-stamp-time-zone: "UTC0"
# time-stamp-end: "; # UTC"
# End:
cfitsio-3.47/iraffits.c0000644000225700000360000016066113464573432014375 0ustar  cagordonlhea/*------------------------------------------------------------------------*/
/*                                                                        */
/*  These routines have been modified by William Pence for use by CFITSIO */
/*        The original files were provided by Doug Mink                   */
/*------------------------------------------------------------------------*/

/* File imhfile.c
 * August 6, 1998
 * By Doug Mink, based on Mike VanHilst's readiraf.c

 * Module:      imhfile.c (IRAF .imh image file reading and writing)
 * Purpose:     Read and write IRAF image files (and translate headers)
 * Subroutine:  irafrhead (filename, lfhead, fitsheader, lihead)
 *              Read IRAF image header
 * Subroutine:  irafrimage (fitsheader)
 *              Read IRAF image pixels (call after irafrhead)
 * Subroutine:	same_path (pixname, hdrname)
 *		Put filename and header path together
 * Subroutine:	iraf2fits (hdrname, irafheader, nbiraf, nbfits)
 *		Convert IRAF image header to FITS image header
 * Subroutine:  irafgeti4 (irafheader, offset)
 *		Get 4-byte integer from arbitrary part of IRAF header
 * Subroutine:  irafgetc2 (irafheader, offset)
 *		Get character string from arbitrary part of IRAF v.1 header
 * Subroutine:  irafgetc (irafheader, offset)
 *		Get character string from arbitrary part of IRAF header
 * Subroutine:  iraf2str (irafstring, nchar)
 * 		Convert 2-byte/char IRAF string to 1-byte/char string
 * Subroutine:	irafswap (bitpix,string,nbytes)
 *		Swap bytes in string in place, with FITS bits/pixel code
 * Subroutine:	irafswap2 (string,nbytes)
 *		Swap bytes in string in place
 * Subroutine	irafswap4 (string,nbytes)
 *		Reverse bytes of Integer*4 or Real*4 vector in place
 * Subroutine	irafswap8 (string,nbytes)
 *		Reverse bytes of Real*8 vector in place


 * Copyright:   2000 Smithsonian Astrophysical Observatory
 *              You may do anything you like with this file except remove
 *              this copyright.  The Smithsonian Astrophysical Observatory
 *              makes no representations about the suitability of this
 *              software for any purpose.  It is provided "as is" without
 *              express or implied warranty.
 */

#include "fitsio2.h"
#include 		/* define stderr, FD, and NULL */
#include 
#include   /* stddef.h is apparently needed to define size_t */
#include 

#define FILE_NOT_OPENED 104

/* Parameters from iraf/lib/imhdr.h for IRAF version 1 images */
#define SZ_IMPIXFILE	 79		/* name of pixel storage file */
#define SZ_IMHDRFILE	 79   		/* length of header storage file */
#define SZ_IMTITLE	 79		/* image title string */
#define LEN_IMHDR	2052		/* length of std header */

/* Parameters from iraf/lib/imhdr.h for IRAF version 2 images */
#define	SZ_IM2PIXFILE	255		/* name of pixel storage file */
#define	SZ_IM2HDRFILE	255		/* name of header storage file */
#define	SZ_IM2TITLE	383		/* image title string */
#define LEN_IM2HDR	2046		/* length of std header */

/* Offsets into header in bytes for parameters in IRAF version 1 images */
#define IM_HDRLEN	 12		/* Length of header in 4-byte ints */
#define IM_PIXTYPE       16             /* Datatype of the pixels */
#define IM_NDIM          20             /* Number of dimensions */
#define IM_LEN           24             /* Length (as stored) */
#define IM_PHYSLEN       52             /* Physical length (as stored) */
#define IM_PIXOFF        88             /* Offset of the pixels */
#define IM_CTIME        108             /* Time of image creation */
#define IM_MTIME        112             /* Time of last modification */
#define IM_LIMTIME      116             /* Time of min,max computation */
#define IM_MAX          120             /* Maximum pixel value */
#define IM_MIN          124             /* Maximum pixel value */
#define IM_PIXFILE      412             /* Name of pixel storage file */
#define IM_HDRFILE      572             /* Name of header storage file */
#define IM_TITLE        732             /* Image name string */

/* Offsets into header in bytes for parameters in IRAF version 2 images */
#define IM2_HDRLEN	  6		/* Length of header in 4-byte ints */
#define IM2_PIXTYPE      10             /* Datatype of the pixels */
#define IM2_SWAPPED      14             /* Pixels are byte swapped */
#define IM2_NDIM         18             /* Number of dimensions */
#define IM2_LEN          22             /* Length (as stored) */
#define IM2_PHYSLEN      50             /* Physical length (as stored) */
#define IM2_PIXOFF       86             /* Offset of the pixels */
#define IM2_CTIME       106             /* Time of image creation */
#define IM2_MTIME       110             /* Time of last modification */
#define IM2_LIMTIME     114             /* Time of min,max computation */
#define IM2_MAX         118             /* Maximum pixel value */
#define IM2_MIN         122             /* Maximum pixel value */
#define IM2_PIXFILE     126             /* Name of pixel storage file */
#define IM2_HDRFILE     382             /* Name of header storage file */
#define IM2_TITLE       638             /* Image name string */

/* Codes from iraf/unix/hlib/iraf.h */
#define	TY_CHAR		2
#define	TY_SHORT	3
#define	TY_INT		4
#define	TY_LONG		5
#define	TY_REAL		6
#define	TY_DOUBLE	7
#define	TY_COMPLEX	8
#define TY_POINTER      9
#define TY_STRUCT       10
#define TY_USHORT       11
#define TY_UBYTE        12

#define LEN_PIXHDR	1024
#define MAXINT  2147483647 /* Biggest number that can fit in long */

static int isirafswapped(char *irafheader, int offset);
static int irafgeti4(char *irafheader, int offset);
static char *irafgetc2(char *irafheader, int offset, int nc);
static char *irafgetc(char *irafheader,	int offset, int	nc);
static char *iraf2str(char *irafstring, int nchar);
static char *irafrdhead(const char *filename, int *lihead);
static int irafrdimage (char **buffptr, size_t *buffsize,
    size_t *filesize, int *status);
static int iraftofits (char *hdrname, char *irafheader, int nbiraf,
    char **buffptr, size_t *nbfits, size_t *fitssize, int *status);
static char *same_path(char *pixname, const char *hdrname);

static int swaphead=0;	/* =1 to swap data bytes of IRAF header values */
static int swapdata=0;  /* =1 to swap bytes in IRAF data pixels */

static void irafswap(int bitpix, char *string, int nbytes);
static void irafswap2(char *string, int nbytes);
static void irafswap4(char *string, int nbytes);
static void irafswap8(char *string, int nbytes);
static int pix_version (char *irafheader);
static int irafncmp (char *irafheader, char *teststring, int nc);
static int machswap(void);
static int head_version (char *irafheader);
static int hgeti4(char* hstring, char* keyword, int* val);
static int hgets(char* hstring, char* keyword, int lstr, char* string);
static char* hgetc(char* hstring, char* keyword);
static char* ksearch(char* hstring, char* keyword);
static char *blsearch (char* hstring, char* keyword);	
static char *strsrch (char* s1,	char* s2);
static char *strnsrch (	char* s1,char* s2,int ls1);
static void hputi4(char* hstring,char* keyword,	int ival);
static void hputs(char* hstring,char* keyword,char* cval);
static void hputcom(char* hstring,char* keyword,char* comment);
static void hputl(char* hstring,char* keyword,int lval);
static void hputc(char* hstring,char* keyword,char* cval);
static int getirafpixname (const char *hdrname, char *irafheader, char *pixfilename, int *status);
int iraf2mem(char *filename, char **buffptr, size_t *buffsize, 
      size_t *filesize, int *status);

void ffpmsg(const char *err_message);

/* CFITS_API is defined below for use on Windows systems.  */
/* It is used to identify the public functions which should be exported. */
/* This has no effect on non-windows platforms where "WIN32" is not defined */

/* this is only needed to export the "fits_delete_iraf_file" symbol, which */
/* is called in fpackutil.c (and perhaps in other applications programs) */

#if defined (WIN32)
  #if defined(cfitsio_EXPORTS)
    #define CFITS_API __declspec(dllexport)
  #else
    #define CFITS_API //__declspec(dllimport)
  #endif /* CFITS_API */
#else /* defined (WIN32) */
 #define CFITS_API
#endif

int CFITS_API fits_delete_iraf_file(const char *filename, int *status);


/*--------------------------------------------------------------------------*/
int fits_delete_iraf_file(const char *filename,  /* name of input file      */
             int *status)                        /* IO - error status       */

/*
   Delete the iraf .imh header file and the associated .pix data file
*/
{
    char *irafheader;
    int lenirafhead;

    char pixfilename[SZ_IM2PIXFILE+1];

    /* read IRAF header into dynamically created char array (free it later!) */
    irafheader = irafrdhead(filename, &lenirafhead);

    if (!irafheader)
    {
	return(*status = FILE_NOT_OPENED);
    }

    getirafpixname (filename, irafheader, pixfilename, status);

    /* don't need the IRAF header any more */
    free(irafheader);

    if (*status > 0)
       return(*status);

    remove(filename);
    remove(pixfilename);
    
    return(*status);
}

/*--------------------------------------------------------------------------*/
int iraf2mem(char *filename,     /* name of input file                 */
             char **buffptr,     /* O - memory pointer (initially NULL)    */
             size_t *buffsize,   /* O - size of mem buffer, in bytes        */
             size_t *filesize,   /* O - size of FITS file, in bytes         */
             int *status)        /* IO - error status                       */

/*
   Driver routine that reads an IRAF image into memory, also converting
   it into FITS format.
*/
{
    char *irafheader;
    int lenirafhead;

    *buffptr = NULL;
    *buffsize = 0;
    *filesize = 0;

    /* read IRAF header into dynamically created char array (free it later!) */
    irafheader = irafrdhead(filename, &lenirafhead);

    if (!irafheader)
    {
	return(*status = FILE_NOT_OPENED);
    }

    /* convert IRAF header to FITS header in memory */
    iraftofits(filename, irafheader, lenirafhead, buffptr, buffsize, filesize,
               status);

    /* don't need the IRAF header any more */
    free(irafheader);

    if (*status > 0)
       return(*status);

    *filesize = (((*filesize - 1) / 2880 ) + 1 ) * 2880; /* multiple of 2880 */

    /* append the image data onto the FITS header */
    irafrdimage(buffptr, buffsize, filesize, status);

    return(*status);
}

/*--------------------------------------------------------------------------*/
/* Subroutine:	irafrdhead  (was irafrhead in D. Mink's original code)
 * Purpose:	Open and read the iraf .imh file.
 * Returns:	NULL if failure, else pointer to IRAF .imh image header
 * Notes:	The imhdr format is defined in iraf/lib/imhdr.h, some of
 *		which defines or mimicked, above.
 */

static char *irafrdhead (
    const char *filename,  /* Name of IRAF header file */
    int *lihead)           /* Length of IRAF image header in bytes (returned) */
{
    FILE *fd;
    int nbr;
    char *irafheader;
    char errmsg[FLEN_ERRMSG];
    long nbhead;
    int nihead;

    *lihead = 0;

    /* open the image header file */
    fd = fopen (filename, "rb");
    if (fd == NULL) {
        ffpmsg("unable to open IRAF header file:");
        ffpmsg(filename);
	return (NULL);
	}

    /* Find size of image header file */
    if (fseek(fd, 0, 2) != 0)  /* move to end of the file */
    {
        ffpmsg("IRAFRHEAD: cannot seek in file:");
        ffpmsg(filename);
        return(NULL);
    }

    nbhead = ftell(fd);     /* position = size of file */
    if (nbhead < 0)
    {
        ffpmsg("IRAFRHEAD: cannot get pos. in file:");
        ffpmsg(filename);
        return(NULL);
    }

    if (fseek(fd, 0, 0) != 0) /* move back to beginning */
    {
        ffpmsg("IRAFRHEAD: cannot seek to beginning of file:");
        ffpmsg(filename);
        return(NULL);
    }

    /* allocate initial sized buffer */
    nihead = nbhead + 5000;
    irafheader = (char *) calloc (1, nihead);
    if (irafheader == NULL) {
	snprintf(errmsg, FLEN_ERRMSG,"IRAFRHEAD Cannot allocate %d-byte header",
		      nihead);
        ffpmsg(errmsg);
        ffpmsg(filename);
	return (NULL);
	}
    *lihead = nihead;

    /* Read IRAF header */
    nbr = fread (irafheader, 1, nbhead, fd);
    fclose (fd);

    /* Reject if header less than minimum length */
    if (nbr < LEN_PIXHDR) {
	snprintf(errmsg, FLEN_ERRMSG,"IRAFRHEAD header file: %d / %d bytes read.",
		      nbr,LEN_PIXHDR);
        ffpmsg(errmsg);
        ffpmsg(filename);
	free (irafheader);
	return (NULL);
	}

    return (irafheader);
}
/*--------------------------------------------------------------------------*/
static int irafrdimage (
    char **buffptr,	/* FITS image header (filled) */
    size_t *buffsize,      /* allocated size of the buffer */
    size_t *filesize,      /* actual size of the FITS file */
    int *status)
{
    FILE *fd;
    char *bang;
    int nax = 1, naxis1 = 1, naxis2 = 1, naxis3 = 1, naxis4 = 1, npaxis1 = 1, npaxis2;
    int bitpix, bytepix, i;
    char *fitsheader, *image;
    int nbr, nbimage, nbaxis, nbl, nbdiff;
    char *pixheader;
    char *linebuff;
    int imhver, lpixhead = 0;
    char pixname[SZ_IM2PIXFILE+1];
    char errmsg[FLEN_ERRMSG];
    size_t newfilesize;
 
    fitsheader = *buffptr;           /* pointer to start of header */

    /* Convert pixel file name to character string */
    hgets (fitsheader, "PIXFILE", SZ_IM2PIXFILE, pixname);
    hgeti4 (fitsheader, "PIXOFF", &lpixhead);

    /* Open pixel file, ignoring machine name if present */
    if ((bang = strchr (pixname, '!')) != NULL )
	fd = fopen (bang + 1, "rb");
    else
	fd = fopen (pixname, "rb");

    /* Print error message and exit if pixel file is not found */
    if (!fd) {
        ffpmsg("IRAFRIMAGE: Cannot open IRAF pixel file:");
        ffpmsg(pixname);
	return (*status = FILE_NOT_OPENED);
	}

    /* Read pixel header */
    pixheader = (char *) calloc (lpixhead, 1);
    if (pixheader == NULL) {
            ffpmsg("IRAFRIMAGE: Cannot alloc memory for pixel header");
            ffpmsg(pixname);
            fclose (fd);
	    return (*status = FILE_NOT_OPENED);
	}
    nbr = fread (pixheader, 1, lpixhead, fd);

    /* Check size of pixel header */
    if (nbr < lpixhead) {
	snprintf(errmsg, FLEN_ERRMSG,"IRAF pixel file: %d / %d bytes read.",
		      nbr,LEN_PIXHDR);
        ffpmsg(errmsg);
	free (pixheader);
	fclose (fd);
	return (*status = FILE_NOT_OPENED);
	}

    /* check pixel header magic word */
    imhver = pix_version (pixheader);
    if (imhver < 1) {
        ffpmsg("File not valid IRAF pixel file:");
        ffpmsg(pixname);
	free (pixheader);
	fclose (fd);
	return (*status = FILE_NOT_OPENED);
	}
    free (pixheader);

    /* Find number of bytes to read */
    hgeti4 (fitsheader,"NAXIS",&nax);
    hgeti4 (fitsheader,"NAXIS1",&naxis1);
    hgeti4 (fitsheader,"NPAXIS1",&npaxis1);
    if (nax > 1) {
        hgeti4 (fitsheader,"NAXIS2",&naxis2);
        hgeti4 (fitsheader,"NPAXIS2",&npaxis2);
	}
    if (nax > 2)
        hgeti4 (fitsheader,"NAXIS3",&naxis3);
    if (nax > 3)
        hgeti4 (fitsheader,"NAXIS4",&naxis4);

    hgeti4 (fitsheader,"BITPIX",&bitpix);
    if (bitpix < 0)
	bytepix = -bitpix / 8;
    else
	bytepix = bitpix / 8;

    nbimage = naxis1 * naxis2 * naxis3 * naxis4 * bytepix;
    
    newfilesize = *filesize + nbimage;  /* header + data */
    newfilesize = (((newfilesize - 1) / 2880 ) + 1 ) * 2880;

    if (newfilesize > *buffsize)   /* need to allocate more memory? */
    {
      fitsheader =  (char *) realloc (*buffptr, newfilesize);
      if (fitsheader == NULL) {
	snprintf(errmsg, FLEN_ERRMSG,"IRAFRIMAGE Cannot allocate %d-byte image buffer",
		(int) (*filesize));
        ffpmsg(errmsg);
        ffpmsg(pixname);
	fclose (fd);
	return (*status = FILE_NOT_OPENED);
	}
    }

    *buffptr = fitsheader;
    *buffsize = newfilesize;

    image = fitsheader + *filesize;
    *filesize = newfilesize;

    /* Read IRAF image all at once if physical and image dimensions are the same */
    if (npaxis1 == naxis1)
	nbr = fread (image, 1, nbimage, fd);

    /* Read IRAF image one line at a time if physical and image dimensions differ */
    else {
	nbdiff = (npaxis1 - naxis1) * bytepix;
	nbaxis = naxis1 * bytepix;
	linebuff = image;
	nbr = 0;
	if (naxis2 == 1 && naxis3 > 1)
	    naxis2 = naxis3;
	for (i = 0; i < naxis2; i++) {
	    nbl = fread (linebuff, 1, nbaxis, fd);
	    nbr = nbr + nbl;
	    fseek (fd, nbdiff, 1);
	    linebuff = linebuff + nbaxis;
	    }
	}
    fclose (fd);

    /* Check size of image */
    if (nbr < nbimage) {
	snprintf(errmsg, FLEN_ERRMSG,"IRAF pixel file: %d / %d bytes read.",
		      nbr,nbimage);
        ffpmsg(errmsg);
        ffpmsg(pixname);
	return (*status = FILE_NOT_OPENED);
	}

    /* Byte-reverse image, if necessary */
    if (swapdata)
	irafswap (bitpix, image, nbimage);

    return (*status);
}
/*--------------------------------------------------------------------------*/
/* Return IRAF image format version number from magic word in IRAF header*/

static int head_version (
    char *irafheader)	/* IRAF image header from file */

{

    /* Check header file magic word */
    if (irafncmp (irafheader, "imhdr", 5) != 0 ) {
	if (strncmp (irafheader, "imhv2", 5) != 0)
	    return (0);
	else
	    return (2);
	}
    else
	return (1);
}

/*--------------------------------------------------------------------------*/
/* Return IRAF image format version number from magic word in IRAF pixel file */

static int pix_version (
    char *irafheader)   /* IRAF image header from file */
{

    /* Check pixel file header magic word */
    if (irafncmp (irafheader, "impix", 5) != 0) {
	if (strncmp (irafheader, "impv2", 5) != 0)
	    return (0);
	else
	    return (2);
	}
    else
	return (1);
}

/*--------------------------------------------------------------------------*/
/* Verify that file is valid IRAF imhdr or impix by checking first 5 chars
 * Returns:	0 on success, 1 on failure */

static int irafncmp (

char	*irafheader,	/* IRAF image header from file */
char	*teststring,	/* C character string to compare */
int	nc)		/* Number of characters to compate */

{
    char *line;

    if ((line = iraf2str (irafheader, nc)) == NULL)
	return (1);
    if (strncmp (line, teststring, nc) == 0) {
	free (line);
	return (0);
	}
    else {
	free (line);
	return (1);
	}
}
/*--------------------------------------------------------------------------*/

/* Convert IRAF image header to FITS image header, returning FITS header */

static int iraftofits (
    char    *hdrname,  /* IRAF header file name (may be path) */
    char    *irafheader,  /* IRAF image header */
    int	    nbiraf,	  /* Number of bytes in IRAF header */
    char    **buffptr,    /* pointer to the FITS header  */
    size_t  *nbfits,      /* allocated size of the FITS header buffer */
    size_t  *fitssize,  /* Number of bytes in FITS header (returned) */
                        /*  = number of bytes to the end of the END keyword */
    int     *status)
{
    char *objname;	/* object name from FITS file */
    int lstr, i, j, k, ib, nax, nbits;
    char *pixname, *newpixname, *bang, *chead;
    char *fitsheader;
    int nblock, nlines;
    char *fhead, *fhead1, *fp, endline[81];
    char irafchar;
    char fitsline[81];
    int pixtype;
    int imhver, n, imu, pixoff, impixoff;
/*    int immax, immin, imtime;  */
    int imndim, imlen, imphyslen, impixtype;
    char errmsg[FLEN_ERRMSG];

    /* Set up last line of FITS header */
    (void)strncpy (endline,"END", 3);
    for (i = 3; i < 80; i++)
	endline[i] = ' ';
    endline[80] = 0;

    /* Check header magic word */
    imhver = head_version (irafheader);
    if (imhver < 1) {
	ffpmsg("File not valid IRAF image header");
        ffpmsg(hdrname);
	return(*status = FILE_NOT_OPENED);
	}
    if (imhver == 2) {
	nlines = 24 + ((nbiraf - LEN_IM2HDR) / 81);
	imndim = IM2_NDIM;
	imlen = IM2_LEN;
	imphyslen = IM2_PHYSLEN;
	impixtype = IM2_PIXTYPE;
	impixoff = IM2_PIXOFF;
/*	imtime = IM2_MTIME; */
/*	immax = IM2_MAX;  */
/*	immin = IM2_MIN; */
	}
    else {
	nlines = 24 + ((nbiraf - LEN_IMHDR) / 162);
	imndim = IM_NDIM;
	imlen = IM_LEN;
	imphyslen = IM_PHYSLEN;
	impixtype = IM_PIXTYPE;
	impixoff = IM_PIXOFF;
/*	imtime = IM_MTIME; */
/*	immax = IM_MAX; */
/*	immin = IM_MIN; */
	}

    /*  Initialize FITS header */
    nblock = (nlines * 80) / 2880;
    *nbfits = (nblock + 5) * 2880 + 4;
    fitsheader = (char *) calloc (*nbfits, 1);
    if (fitsheader == NULL) {
	snprintf(errmsg, FLEN_ERRMSG,"IRAF2FITS Cannot allocate %d-byte FITS header",
		(int) (*nbfits));
        ffpmsg(hdrname);
	return (*status = FILE_NOT_OPENED);
	}

    fhead = fitsheader;
    *buffptr = fitsheader;
    (void)strncpy (fitsheader, endline, 80);
    hputl (fitsheader, "SIMPLE", 1);
    fhead = fhead + 80;

    /*  check if the IRAF file is in big endian (sun) format (= 0) or not. */
    /*  This is done by checking the 4 byte integer in the header that     */
    /*  represents the iraf pixel type.  This 4-byte word is guaranteed to */
    /*  have the least sig byte != 0 and the most sig byte = 0,  so if the */
    /*  first byte of the word != 0, then the file in little endian format */
    /*  like on an Alpha machine.                                          */

    swaphead = isirafswapped(irafheader, impixtype);
    if (imhver == 1)
        swapdata = swaphead; /* vers 1 data has same swapness as header */
    else
        swapdata = irafgeti4 (irafheader, IM2_SWAPPED); 

    /*  Set pixel size in FITS header */
    pixtype = irafgeti4 (irafheader, impixtype);
    switch (pixtype) {
	case TY_CHAR:
	    nbits = 8;
	    break;
	case TY_UBYTE:
	    nbits = 8;
	    break;
	case TY_SHORT:
	    nbits = 16;
	    break;
	case TY_USHORT:
	    nbits = -16;
	    break;
	case TY_INT:
	case TY_LONG:
	    nbits = 32;
	    break;
	case TY_REAL:
	    nbits = -32;
	    break;
	case TY_DOUBLE:
	    nbits = -64;
	    break;
	default:
	    snprintf(errmsg,FLEN_ERRMSG,"Unsupported IRAF data type: %d", pixtype);
            ffpmsg(errmsg);
            ffpmsg(hdrname);
	    return (*status = FILE_NOT_OPENED);
	}
    hputi4 (fitsheader,"BITPIX",nbits);
    hputcom (fitsheader,"BITPIX", "IRAF .imh pixel type");
    fhead = fhead + 80;

    /*  Set image dimensions in FITS header */
    nax = irafgeti4 (irafheader, imndim);
    hputi4 (fitsheader,"NAXIS",nax);
    hputcom (fitsheader,"NAXIS", "IRAF .imh naxis");
    fhead = fhead + 80;

    n = irafgeti4 (irafheader, imlen);
    hputi4 (fitsheader, "NAXIS1", n);
    hputcom (fitsheader,"NAXIS1", "IRAF .imh image naxis[1]");
    fhead = fhead + 80;

    if (nax > 1) {
	n = irafgeti4 (irafheader, imlen+4);
	hputi4 (fitsheader, "NAXIS2", n);
	hputcom (fitsheader,"NAXIS2", "IRAF .imh image naxis[2]");
        fhead = fhead + 80;
	}
    if (nax > 2) {
	n = irafgeti4 (irafheader, imlen+8);
	hputi4 (fitsheader, "NAXIS3", n);
	hputcom (fitsheader,"NAXIS3", "IRAF .imh image naxis[3]");
	fhead = fhead + 80;
	}
    if (nax > 3) {
	n = irafgeti4 (irafheader, imlen+12);
	hputi4 (fitsheader, "NAXIS4", n);
	hputcom (fitsheader,"NAXIS4", "IRAF .imh image naxis[4]");
	fhead = fhead + 80;
	}

    /* Set object name in FITS header */
    if (imhver == 2)
	objname = irafgetc (irafheader, IM2_TITLE, SZ_IM2TITLE);
    else
	objname = irafgetc2 (irafheader, IM_TITLE, SZ_IMTITLE);
    if ((lstr = strlen (objname)) < 8) {
	for (i = lstr; i < 8; i++)
	    objname[i] = ' ';
	objname[8] = 0;
	}
    hputs (fitsheader,"OBJECT",objname);
    hputcom (fitsheader,"OBJECT", "IRAF .imh title");
    free (objname);
    fhead = fhead + 80;

    /* Save physical axis lengths so image file can be read */
    n = irafgeti4 (irafheader, imphyslen);
    hputi4 (fitsheader, "NPAXIS1", n);
    hputcom (fitsheader,"NPAXIS1", "IRAF .imh physical naxis[1]");
    fhead = fhead + 80;
    if (nax > 1) {
	n = irafgeti4 (irafheader, imphyslen+4);
	hputi4 (fitsheader, "NPAXIS2", n);
	hputcom (fitsheader,"NPAXIS2", "IRAF .imh physical naxis[2]");
	fhead = fhead + 80;
	}
    if (nax > 2) {
	n = irafgeti4 (irafheader, imphyslen+8);
	hputi4 (fitsheader, "NPAXIS3", n);
	hputcom (fitsheader,"NPAXIS3", "IRAF .imh physical naxis[3]");
	fhead = fhead + 80;
	}
    if (nax > 3) {
	n = irafgeti4 (irafheader, imphyslen+12);
	hputi4 (fitsheader, "NPAXIS4", n);
	hputcom (fitsheader,"NPAXIS4", "IRAF .imh physical naxis[4]");
	fhead = fhead + 80;
	}

    /* Save image header filename in header */
    hputs (fitsheader,"IMHFILE",hdrname);
    hputcom (fitsheader,"IMHFILE", "IRAF header file name");
    fhead = fhead + 80;

    /* Save image pixel file pathname in header */
    if (imhver == 2)
	pixname = irafgetc (irafheader, IM2_PIXFILE, SZ_IM2PIXFILE);
    else
	pixname = irafgetc2 (irafheader, IM_PIXFILE, SZ_IMPIXFILE);
    if (strncmp(pixname, "HDR", 3) == 0 ) {
	newpixname = same_path (pixname, hdrname);
        if (newpixname) {
          free (pixname);
          pixname = newpixname;
	  }
	}
    if (strchr (pixname, '/') == NULL && strchr (pixname, '$') == NULL) {
	newpixname = same_path (pixname, hdrname);
        if (newpixname) {
          free (pixname);
          pixname = newpixname;
	  }
	}
	
    if ((bang = strchr (pixname, '!')) != NULL )
	hputs (fitsheader,"PIXFILE",bang+1);
    else
	hputs (fitsheader,"PIXFILE",pixname);
    free (pixname);
    hputcom (fitsheader,"PIXFILE", "IRAF .pix pixel file");
    fhead = fhead + 80;

    /* Save image offset from star of pixel file */
    pixoff = irafgeti4 (irafheader, impixoff);
    pixoff = (pixoff - 1) * 2;
    hputi4 (fitsheader, "PIXOFF", pixoff);
    hputcom (fitsheader,"PIXOFF", "IRAF .pix pixel offset (Do not change!)");
    fhead = fhead + 80;

    /* Save IRAF file format version in header */
    hputi4 (fitsheader,"IMHVER",imhver);
    hputcom (fitsheader,"IMHVER", "IRAF .imh format version (1 or 2)");
    fhead = fhead + 80;

    /* Save flag as to whether to swap IRAF data for this file and machine */
    if (swapdata)
	hputl (fitsheader, "PIXSWAP", 1);
    else
	hputl (fitsheader, "PIXSWAP", 0);
    hputcom (fitsheader,"PIXSWAP", "IRAF pixels, FITS byte orders differ if T");
    fhead = fhead + 80;

    /* Add user portion of IRAF header to FITS header */
    fitsline[80] = 0;
    if (imhver == 2) {
	imu = LEN_IM2HDR;
	chead = irafheader;
	j = 0;
	for (k = 0; k < 80; k++)
	    fitsline[k] = ' ';
	for (i = imu; i < nbiraf; i++) {
	    irafchar = chead[i];
	    if (irafchar == 0)
		break;
	    else if (irafchar == 10) {
		(void)strncpy (fhead, fitsline, 80);
		/* fprintf (stderr,"%80s\n",fitsline); */
		if (strncmp (fitsline, "OBJECT ", 7) != 0) {
		    fhead = fhead + 80;
		    }
		for (k = 0; k < 80; k++)
		    fitsline[k] = ' ';
		j = 0;
		}
	    else {
		if (j > 80) {
		    if (strncmp (fitsline, "OBJECT ", 7) != 0) {
			(void)strncpy (fhead, fitsline, 80);
			/* fprintf (stderr,"%80s\n",fitsline); */
			j = 9;
			fhead = fhead + 80;
			}
		    for (k = 0; k < 80; k++)
			fitsline[k] = ' ';
		    }
		if (irafchar > 32 && irafchar < 127)
		    fitsline[j] = irafchar;
		j++;
		}
	    }
	}
    else {
	imu = LEN_IMHDR;
	chead = irafheader;
	if (swaphead == 1)
	    ib = 0;
	else
	    ib = 1;
	for (k = 0; k < 80; k++)
	    fitsline[k] = ' ';
	j = 0;
	for (i = imu; i < nbiraf; i=i+2) {
	    irafchar = chead[i+ib];
	    if (irafchar == 0)
		break;
	    else if (irafchar == 10) {
		if (strncmp (fitsline, "OBJECT ", 7) != 0) {
		    (void)strncpy (fhead, fitsline, 80);
		    fhead = fhead + 80;
		    }
		/* fprintf (stderr,"%80s\n",fitsline); */
		j = 0;
		for (k = 0; k < 80; k++)
		    fitsline[k] = ' ';
		}
	    else {
		if (j > 80) {
		    if (strncmp (fitsline, "OBJECT ", 7) != 0) {
			(void)strncpy (fhead, fitsline, 80);
			j = 9;
			fhead = fhead + 80;
			}
		    /* fprintf (stderr,"%80s\n",fitsline); */
		    for (k = 0; k < 80; k++)
			fitsline[k] = ' ';
		    }
		if (irafchar > 32 && irafchar < 127)
		    fitsline[j] = irafchar;
		j++;
		}
	    }
	}

    /* Add END to last line */
    (void)strncpy (fhead, endline, 80);

    /* Find end of last 2880-byte block of header */
    fhead = ksearch (fitsheader, "END") + 80;
    nblock = *nbfits / 2880;
    fhead1 = fitsheader + (nblock * 2880);
    *fitssize = fhead - fitsheader;  /* no. of bytes to end of END keyword */

    /* Pad rest of header with spaces */
    strncpy (endline,"   ",3);
    for (fp = fhead; fp < fhead1; fp = fp + 80) {
	(void)strncpy (fp, endline,80);
	}

    return (*status);
}
/*--------------------------------------------------------------------------*/

/* get the IRAF pixel file name */

static int getirafpixname (
    const char *hdrname,  /* IRAF header file name (may be path) */
    char    *irafheader,  /* IRAF image header */
    char    *pixfilename,     /* IRAF pixel file name */
    int     *status)
{
    int imhver;
    char *pixname, *newpixname, *bang;

    /* Check header magic word */
    imhver = head_version (irafheader);
    if (imhver < 1) {
	ffpmsg("File not valid IRAF image header");
        ffpmsg(hdrname);
	return(*status = FILE_NOT_OPENED);
	}

    /* get image pixel file pathname in header */
    if (imhver == 2)
	pixname = irafgetc (irafheader, IM2_PIXFILE, SZ_IM2PIXFILE);
    else
	pixname = irafgetc2 (irafheader, IM_PIXFILE, SZ_IMPIXFILE);

    if (strncmp(pixname, "HDR", 3) == 0 ) {
	newpixname = same_path (pixname, hdrname);
        if (newpixname) {
          free (pixname);
          pixname = newpixname;
	  }
	}

    if (strchr (pixname, '/') == NULL && strchr (pixname, '$') == NULL) {
	newpixname = same_path (pixname, hdrname);
        if (newpixname) {
          free (pixname);
          pixname = newpixname;
	  }
	}
	
    if ((bang = strchr (pixname, '!')) != NULL )
	strcpy(pixfilename,bang+1);
    else
	strcpy(pixfilename,pixname);

    free (pixname);

    return (*status);
}

/*--------------------------------------------------------------------------*/
/* Put filename and header path together */

static char *same_path (

char	*pixname,	/* IRAF pixel file pathname */
const char	*hdrname)	/* IRAF image header file pathname */

{
    int len;
    char *newpixname;

/*  WDP - 10/16/2007 - increased allocation to avoid possible overflow */
/*    newpixname = (char *) calloc (SZ_IM2PIXFILE, sizeof (char)); */

    newpixname = (char *) calloc (2*SZ_IM2PIXFILE+1, sizeof (char));
    if (newpixname == NULL) {
            ffpmsg("iraffits same_path: Cannot alloc memory for newpixname");
	    return (NULL);
	}

    /* Pixel file is in same directory as header */
    if (strncmp(pixname, "HDR$", 4) == 0 ) {
	(void)strncpy (newpixname, hdrname, SZ_IM2PIXFILE);

	/* find the end of the pathname */
	len = strlen (newpixname);
#ifndef VMS
	while( (len > 0) && (newpixname[len-1] != '/') )
#else
	while( (len > 0) && (newpixname[len-1] != ']') && (newpixname[len-1] != ':') )
#endif
	    len--;

	/* add name */
	newpixname[len] = '\0';
	(void)strncat (newpixname, &pixname[4], SZ_IM2PIXFILE);
	}

    /* Bare pixel file with no path is assumed to be same as HDR$filename */
    else if (strchr (pixname, '/') == NULL && strchr (pixname, '$') == NULL) {
	(void)strncpy (newpixname, hdrname, SZ_IM2PIXFILE);

	/* find the end of the pathname */
	len = strlen (newpixname);
#ifndef VMS
	while( (len > 0) && (newpixname[len-1] != '/') )
#else
	while( (len > 0) && (newpixname[len-1] != ']') && (newpixname[len-1] != ':') )
#endif
	    len--;

	/* add name */
	newpixname[len] = '\0';
	(void)strncat (newpixname, pixname, SZ_IM2PIXFILE);
	}

    /* Pixel file has same name as header file, but with .pix extension */
    else if (strncmp (pixname, "HDR", 3) == 0) {

	/* load entire header name string into name buffer */
	(void)strncpy (newpixname, hdrname, SZ_IM2PIXFILE);
	len = strlen (newpixname);
	newpixname[len-3] = 'p';
	newpixname[len-2] = 'i';
	newpixname[len-1] = 'x';
	}

    return (newpixname);
}

/*--------------------------------------------------------------------------*/
static int isirafswapped (

char	*irafheader,	/* IRAF image header */
int	offset)		/* Number of bytes to skip before number */

    /*  check if the IRAF file is in big endian (sun) format (= 0) or not */
    /*  This is done by checking the 4 byte integer in the header that */
    /*  represents the iraf pixel type.  This 4-byte word is guaranteed to */
    /*  have the least sig byte != 0 and the most sig byte = 0,  so if the */
    /*  first byte of the word != 0, then the file in little endian format */
    /*  like on an Alpha machine.                                          */

{
    int  swapped;

    if (irafheader[offset] != 0)
	swapped = 1;
    else
	swapped = 0;

    return (swapped);
}
/*--------------------------------------------------------------------------*/
static int irafgeti4 (

char	*irafheader,	/* IRAF image header */
int	offset)		/* Number of bytes to skip before number */

{
    char *ctemp, *cheader;
    int  temp;

    cheader = irafheader;
    ctemp = (char *) &temp;

    if (machswap() != swaphead) {
	ctemp[3] = cheader[offset];
	ctemp[2] = cheader[offset+1];
	ctemp[1] = cheader[offset+2];
	ctemp[0] = cheader[offset+3];
	}
    else {
	ctemp[0] = cheader[offset];
	ctemp[1] = cheader[offset+1];
	ctemp[2] = cheader[offset+2];
	ctemp[3] = cheader[offset+3];
	}
    return (temp);
}

/*--------------------------------------------------------------------------*/
/* IRAFGETC2 -- Get character string from arbitrary part of v.1 IRAF header */

static char *irafgetc2 (

char	*irafheader,	/* IRAF image header */
int	offset,		/* Number of bytes to skip before string */
int	nc)		/* Maximum number of characters in string */

{
    char *irafstring, *string;

    irafstring = irafgetc (irafheader, offset, 2*(nc+1));
    string = iraf2str (irafstring, nc);
    free (irafstring);

    return (string);
}

/*--------------------------------------------------------------------------*/
/* IRAFGETC -- Get character string from arbitrary part of IRAF header */

static char *irafgetc (

char	*irafheader,	/* IRAF image header */
int	offset,		/* Number of bytes to skip before string */
int	nc)		/* Maximum number of characters in string */

{
    char *ctemp, *cheader;
    int i;

    cheader = irafheader;
    ctemp = (char *) calloc (nc+1, 1);
    if (ctemp == NULL) {
	ffpmsg("IRAFGETC Cannot allocate memory for string variable");
	return (NULL);
	}
    for (i = 0; i < nc; i++) {
	ctemp[i] = cheader[offset+i];
	if (ctemp[i] > 0 && ctemp[i] < 32)
	    ctemp[i] = ' ';
	}

    return (ctemp);
}

/*--------------------------------------------------------------------------*/
/* Convert IRAF 2-byte/char string to 1-byte/char string */

static char *iraf2str (

char	*irafstring,	/* IRAF 2-byte/character string */
int	nchar)		/* Number of characters in string */
{
    char *string;
    int i, j;

    string = (char *) calloc (nchar+1, 1);
    if (string == NULL) {
	ffpmsg("IRAF2STR Cannot allocate memory for string variable");
	return (NULL);
	}

    /* the chars are in bytes 1, 3, 5, ... if bigendian format (SUN) */
    /* else in bytes 0, 2, 4, ... if little endian format (Alpha)    */

    if (irafstring[0] != 0)
	j = 0;
    else
	j = 1;

    /* Convert appropriate byte of input to output character */
    for (i = 0; i < nchar; i++) {
	string[i] = irafstring[j];
	j = j + 2;
	}

    return (string);
}

/*--------------------------------------------------------------------------*/
/* IRAFSWAP -- Reverse bytes of any type of vector in place */

static void irafswap (

int	bitpix,		/* Number of bits per pixel */
			/*  16 = short, -16 = unsigned short, 32 = int */
			/* -32 = float, -64 = double */
char	*string,	/* Address of starting point of bytes to swap */
int	nbytes)		/* Number of bytes to swap */

{
    switch (bitpix) {

	case 16:
	    if (nbytes < 2) return;
	    irafswap2 (string,nbytes);
	    break;

	case 32:
	    if (nbytes < 4) return;
	    irafswap4 (string,nbytes);
	    break;

	case -16:
	    if (nbytes < 2) return;
	    irafswap2 (string,nbytes);
	    break;

	case -32:
	    if (nbytes < 4) return;
	    irafswap4 (string,nbytes);
	    break;

	case -64:
	    if (nbytes < 8) return;
	    irafswap8 (string,nbytes);
	    break;

	}
    return;
}

/*--------------------------------------------------------------------------*/
/* IRAFSWAP2 -- Swap bytes in string in place */

static void irafswap2 (

char *string,	/* Address of starting point of bytes to swap */
int nbytes)	/* Number of bytes to swap */

{
    char *sbyte, temp, *slast;

    slast = string + nbytes;
    sbyte = string;
    while (sbyte < slast) {
	temp = sbyte[0];
	sbyte[0] = sbyte[1];
	sbyte[1] = temp;
	sbyte= sbyte + 2;
	}
    return;
}

/*--------------------------------------------------------------------------*/
/* IRAFSWAP4 -- Reverse bytes of Integer*4 or Real*4 vector in place */

static void irafswap4 (

char *string,	/* Address of Integer*4 or Real*4 vector */
int nbytes)	/* Number of bytes to reverse */

{
    char *sbyte, *slast;
    char temp0, temp1, temp2, temp3;

    slast = string + nbytes;
    sbyte = string;
    while (sbyte < slast) {
	temp3 = sbyte[0];
	temp2 = sbyte[1];
	temp1 = sbyte[2];
	temp0 = sbyte[3];
	sbyte[0] = temp0;
	sbyte[1] = temp1;
	sbyte[2] = temp2;
	sbyte[3] = temp3;
	sbyte = sbyte + 4;
	}

    return;
}

/*--------------------------------------------------------------------------*/
/* IRAFSWAP8 -- Reverse bytes of Real*8 vector in place */

static void irafswap8 (

char *string,	/* Address of Real*8 vector */
int nbytes)	/* Number of bytes to reverse */

{
    char *sbyte, *slast;
    char temp[8];

    slast = string + nbytes;
    sbyte = string;
    while (sbyte < slast) {
	temp[7] = sbyte[0];
	temp[6] = sbyte[1];
	temp[5] = sbyte[2];
	temp[4] = sbyte[3];
	temp[3] = sbyte[4];
	temp[2] = sbyte[5];
	temp[1] = sbyte[6];
	temp[0] = sbyte[7];
	sbyte[0] = temp[0];
	sbyte[1] = temp[1];
	sbyte[2] = temp[2];
	sbyte[3] = temp[3];
	sbyte[4] = temp[4];
	sbyte[5] = temp[5];
	sbyte[6] = temp[6];
	sbyte[7] = temp[7];
	sbyte = sbyte + 8;
	}
    return;
}

/*--------------------------------------------------------------------------*/
static int
machswap (void)

{
    char *ctest;
    int itest;

    itest = 1;
    ctest = (char *)&itest;
    if (*ctest)
	return (1);
    else
	return (0);
}

/*--------------------------------------------------------------------------*/
/*             the following routines were originally in hget.c             */
/*--------------------------------------------------------------------------*/


static int lhead0 = 0;

/*--------------------------------------------------------------------------*/

/* Extract long value for variable from FITS header string */

static int
hgeti4 (hstring,keyword,ival)

char *hstring;	/* character string containing FITS header information
		   in the format =  {/ } */
char *keyword;	/* character string containing the name of the keyword
		   the value of which is returned.  hget searches for a
		   line beginning with this string.  if "[n]" is present,
		   the n'th token in the value is returned.
		   (the first 8 characters must be unique) */
int *ival;
{
char *value;
double dval;
int minint;
char val[30]; 

/* Get value and comment from header string */
	value = hgetc (hstring,keyword);

/* Translate value from ASCII to binary */
	if (value != NULL) {
	    minint = -MAXINT - 1;
            if (strlen(value) > 29)
               return(0);
	    strcpy (val, value);
	    dval = atof (val);
	    if (dval+0.001 > MAXINT)
		*ival = MAXINT;
	    else if (dval >= 0)
		*ival = (int) (dval + 0.001);
	    else if (dval-0.001 < minint)
		*ival = minint;
	    else
		*ival = (int) (dval - 0.001);
	    return (1);
	    }
	else {
	    return (0);
	    }
}

/*-------------------------------------------------------------------*/
/* Extract string value for variable from FITS header string */

static int
hgets (hstring, keyword, lstr, str)

char *hstring;	/* character string containing FITS header information
		   in the format =  {/ } */
char *keyword;	/* character string containing the name of the keyword
		   the value of which is returned.  hget searches for a
		   line beginning with this string.  if "[n]" is present,
		   the n'th token in the value is returned.
		   (the first 8 characters must be unique) */
int lstr;	/* Size of str in characters */
char *str;	/* String (returned) */
{
	char *value;
	int lval;

/* Get value and comment from header string */
	value = hgetc (hstring,keyword);

	if (value != NULL) {
	    lval = strlen (value);
	    if (lval < lstr)
		strcpy (str, value);
	    else if (lstr > 1) {
		strncpy (str, value, lstr-1);
                str[lstr-1]=0;
            }
	    else {
		str[0] = value[0];
            }
	    return (1);
	    }
	else
	    return (0);
}

/*-------------------------------------------------------------------*/
/* Extract character value for variable from FITS header string */

static char *
hgetc (hstring,keyword0)

char *hstring;	/* character string containing FITS header information
		   in the format =  {/ } */
char *keyword0;	/* character string containing the name of the keyword
		   the value of which is returned.  hget searches for a
		   line beginning with this string.  if "[n]" is present,
		   the n'th token in the value is returned.
		   (the first 8 characters must be unique) */
{
	static char cval[80];
	char *value;
	char cwhite[2];
	char squot[2], dquot[2], lbracket[2], rbracket[2], slash[2], comma[2];
	char keyword[81]; /* large for ESO hierarchical keywords */
	char line[100];
	char *vpos, *cpar = NULL;
	char *q1, *q2 = NULL, *v1, *v2, *c1, *brack1, *brack2;
        char *saveptr;
	int ipar, i;

	squot[0] = 39;
	squot[1] = 0;
	dquot[0] = 34;
	dquot[1] = 0;
	lbracket[0] = 91;
	lbracket[1] = 0;
	comma[0] = 44;
	comma[1] = 0;
	rbracket[0] = 93;
	rbracket[1] = 0;
	slash[0] = 47;
	slash[1] = 0;

/* Find length of variable name */
	strncpy (keyword,keyword0, sizeof(keyword)-1);
        keyword[80]=0;
	brack1 = strsrch (keyword,lbracket);
	if (brack1 == NULL)
	    brack1 = strsrch (keyword,comma);
	if (brack1 != NULL) {
	    *brack1 = '\0';
	    brack1++;
	    }

/* Search header string for variable name */
	vpos = ksearch (hstring,keyword);

/* Exit if not found */
	if (vpos == NULL) {
	    return (NULL);
	    }

/* Initialize line to nulls */
	 for (i = 0; i < 100; i++)
	    line[i] = 0;

/* In standard FITS, data lasts until 80th character */

/* Extract entry for this variable from the header */
	strncpy (line,vpos,80);

/* check for quoted value */
	q1 = strsrch (line,squot);
	c1 = strsrch (line,slash);
	if (q1 != NULL) {
	    if (c1 != NULL && q1 < c1)
		q2 = strsrch (q1+1,squot);
	    else if (c1 == NULL)
		q2 = strsrch (q1+1,squot);
	    else
		q1 = NULL;
	    }
	else {
	    q1 = strsrch (line,dquot);
	    if (q1 != NULL) {
		if (c1 != NULL && q1 < c1)
		    q2 = strsrch (q1+1,dquot);
		else if (c1 == NULL)
		    q2 = strsrch (q1+1,dquot);
		else
		    q1 = NULL;
		}
	    else {
		q1 = NULL;
		q2 = line + 10;
		}
	    }

/* Extract value and remove excess spaces */
	if (q1 != NULL) {
	    v1 = q1 + 1;
	    v2 = q2;
	    c1 = strsrch (q2,"/");
	    }
	else {
	    v1 = strsrch (line,"=") + 1;
	    c1 = strsrch (line,"/");
	    if (c1 != NULL)
		v2 = c1;
	    else
		v2 = line + 79;
	    }

/* Ignore leading spaces */
	while (*v1 == ' ' && v1 < v2) {
	    v1++;
	    }

/* Drop trailing spaces */
	*v2 = '\0';
	v2--;
	while (*v2 == ' ' && v2 > v1) {
	    *v2 = '\0';
	    v2--;
	    }

	if (!strcmp (v1, "-0"))
	    v1++;
	strcpy (cval,v1);
	value = cval;

/* If keyword has brackets, extract appropriate token from value */
	if (brack1 != NULL) {
	    brack2 = strsrch (brack1,rbracket);
	    if (brack2 != NULL)
		*brack2 = '\0';
	    ipar = atoi (brack1);
	    if (ipar > 0) {
		cwhite[0] = ' ';
		cwhite[1] = '\0';
		for (i = 1; i <= ipar; i++) {
		    cpar = ffstrtok (v1,cwhite,&saveptr);
		    v1 = NULL;
		    }
		if (cpar != NULL) {
		    strcpy (cval,cpar);
		    }
		else
		    value = NULL;
		}
	    }

	return (value);
}


/*-------------------------------------------------------------------*/
/* Find beginning of fillable blank line before FITS header keyword line */

static char *
blsearch (hstring,keyword)

/* Find entry for keyword keyword in FITS header string hstring.
   (the keyword may have a maximum of eight letters)
   NULL is returned if the keyword is not found */

char *hstring;	/* character string containing fits-style header
		information in the format =  {/ }
		the default is that each entry is 80 characters long;
		however, lines may be of arbitrary length terminated by
		nulls, carriage returns or linefeeds, if packed is true.  */
char *keyword;	/* character string containing the name of the variable
		to be returned.  ksearch searches for a line beginning
		with this string.  The string may be a character
		literal or a character variable terminated by a null
		or '$'.  it is truncated to 8 characters. */
{
    char *loc, *headnext, *headlast, *pval, *lc, *line;
    char *bval;
    int icol, nextchar, lkey, nleft, lhstr;

    pval = 0;

    /* Search header string for variable name */
    if (lhead0)
	lhstr = lhead0;
    else {
	lhstr = 0;
	while (lhstr < 57600 && hstring[lhstr] != 0)
	    lhstr++;
	}
    headlast = hstring + lhstr;
    headnext = hstring;
    pval = NULL;
    while (headnext < headlast) {
	nleft = headlast - headnext;
	loc = strnsrch (headnext, keyword, nleft);

	/* Exit if keyword is not found */
	if (loc == NULL) {
	    break;
	    }

	icol = (loc - hstring) % 80;
	lkey = strlen (keyword);
	nextchar = (int) *(loc + lkey);

	/* If this is not in the first 8 characters of a line, keep searching */
	if (icol > 7)
	    headnext = loc + 1;

	/* If parameter name in header is longer, keep searching */
	else if (nextchar != 61 && nextchar > 32 && nextchar < 127)
	    headnext = loc + 1;

	/* If preceeding characters in line are not blanks, keep searching */
	else {
	    line = loc - icol;
	    for (lc = line; lc < loc; lc++) {
		if (*lc != ' ')
		    headnext = loc + 1;
		}

	/* Return pointer to start of line if match */
	    if (loc >= headnext) {
		pval = line;
		break;
		}
	    }
	}

    /* Return NULL if keyword is found at start of FITS header string */
    if (pval == NULL)
	return (pval);

    /* Return NULL if  found the first keyword in the header */
    if (pval == hstring)
        return (NULL);

    /* Find last nonblank line before requested keyword */
    bval = pval - 80;
    while (!strncmp (bval,"        ",8))
	bval = bval - 80;
    bval = bval + 80;

    /* Return pointer to calling program if blank lines found */
    if (bval < pval)
	return (bval);
    else
	return (NULL);
}


/*-------------------------------------------------------------------*/
/* Find FITS header line containing specified keyword */

static char *ksearch (hstring,keyword)

/* Find entry for keyword keyword in FITS header string hstring.
   (the keyword may have a maximum of eight letters)
   NULL is returned if the keyword is not found */

char *hstring;	/* character string containing fits-style header
		information in the format =  {/ }
		the default is that each entry is 80 characters long;
		however, lines may be of arbitrary length terminated by
		nulls, carriage returns or linefeeds, if packed is true.  */
char *keyword;	/* character string containing the name of the variable
		to be returned.  ksearch searches for a line beginning
		with this string.  The string may be a character
		literal or a character variable terminated by a null
		or '$'.  it is truncated to 8 characters. */
{
    char *loc, *headnext, *headlast, *pval, *lc, *line;
    int icol, nextchar, lkey, nleft, lhstr;

    pval = 0;

/* Search header string for variable name */
    if (lhead0)
	lhstr = lhead0;
    else {
	lhstr = 0;
	while (lhstr < 57600 && hstring[lhstr] != 0)
	    lhstr++;
	}
    headlast = hstring + lhstr;
    headnext = hstring;
    pval = NULL;
    while (headnext < headlast) {
	nleft = headlast - headnext;
	loc = strnsrch (headnext, keyword, nleft);

	/* Exit if keyword is not found */
	if (loc == NULL) {
	    break;
	    }

	icol = (loc - hstring) % 80;
	lkey = strlen (keyword);
	nextchar = (int) *(loc + lkey);

	/* If this is not in the first 8 characters of a line, keep searching */
	if (icol > 7)
	    headnext = loc + 1;

	/* If parameter name in header is longer, keep searching */
	else if (nextchar != 61 && nextchar > 32 && nextchar < 127)
	    headnext = loc + 1;

	/* If preceeding characters in line are not blanks, keep searching */
	else {
	    line = loc - icol;
	    for (lc = line; lc < loc; lc++) {
		if (*lc != ' ')
		    headnext = loc + 1;
		}

	/* Return pointer to start of line if match */
	    if (loc >= headnext) {
		pval = line;
		break;
		}
	    }
	}

/* Return pointer to calling program */
	return (pval);

}

/*-------------------------------------------------------------------*/
/* Find string s2 within null-terminated string s1 */

static char *
strsrch (s1, s2)

char *s1;	/* String to search */
char *s2;	/* String to look for */

{
    int ls1;
    ls1 = strlen (s1);
    return (strnsrch (s1, s2, ls1));
}

/*-------------------------------------------------------------------*/
/* Find string s2 within string s1 */

static char *
strnsrch (s1, s2, ls1)

char	*s1;	/* String to search */
char	*s2;	/* String to look for */
int	ls1;	/* Length of string being searched */

{
    char *s,*s1e;
    char cfirst,clast;
    int i,ls2;

    /* Return null string if either pointer is NULL */
    if (s1 == NULL || s2 == NULL)
	return (NULL);

    /* A zero-length pattern is found in any string */
    ls2 = strlen (s2);
    if (ls2 ==0)
	return (s1);

    /* Only a zero-length string can be found in a zero-length string */
    if (ls1 ==0)
	return (NULL);

    cfirst = s2[0];
    clast = s2[ls2-1];
    s1e = s1 + ls1 - ls2 + 1;
    s = s1;
    while (s < s1e) { 

	/* Search for first character in pattern string */
	if (*s == cfirst) {

	    /* If single character search, return */
	    if (ls2 == 1)
		return (s);

	    /* Search for last character in pattern string if first found */
	    if (s[ls2-1] == clast) {

		/* If two-character search, return */
		if (ls2 == 2)
		    return (s);

		/* If 3 or more characters, check for rest of search string */
		i = 1;
		while (i < ls2 && s[i] == s2[i])
		    i++;

		/* If entire string matches, return */
		if (i >= ls2)
		    return (s);
		}
	    }
	s++;
	}
    return (NULL);
}

/*-------------------------------------------------------------------*/
/*             the following routines were originally in hget.c      */
/*-------------------------------------------------------------------*/
/*  HPUTI4 - Set int keyword = ival in FITS header string */

static void
hputi4 (hstring,keyword,ival)

  char *hstring;	/* character string containing FITS-style header
			   information in the format
			   =  {/ }
			   each entry is padded with spaces to 80 characters */

  char *keyword;		/* character string containing the name of the variable
			   to be returned.  hput searches for a line beginning
			   with this string, and if there isn't one, creates one.
		   	   The first 8 characters of keyword must be unique. */
  int ival;		/* int number */
{
    char value[30];

    /* Translate value from binary to ASCII */
    snprintf (value,30,"%d",ival);

    /* Put value into header string */
    hputc (hstring,keyword,value);

    /* Return to calling program */
    return;
}

/*-------------------------------------------------------------------*/

/*  HPUTL - Set keyword = F if lval=0, else T, in FITS header string */

static void
hputl (hstring, keyword,lval)

char *hstring;		/* FITS header */
char *keyword;		/* Keyword name */
int lval;		/* logical variable (0=false, else true) */
{
    char value[8];

    /* Translate value from binary to ASCII */
    if (lval)
	strcpy (value, "T");
    else
	strcpy (value, "F");

    /* Put value into header string */
    hputc (hstring,keyword,value);

    /* Return to calling program */
    return;
}

/*-------------------------------------------------------------------*/

/*  HPUTS - Set character string keyword = 'cval' in FITS header string */

static void
hputs (hstring,keyword,cval)

char *hstring;	/* FITS header */
char *keyword;	/* Keyword name */
char *cval;	/* character string containing the value for variable
		   keyword.  trailing and leading blanks are removed.  */
{
    char squot = 39;
    char value[70];
    int lcval;

    /*  find length of variable string */

    lcval = strlen (cval);
    if (lcval > 67)
	lcval = 67;

    /* Put quotes around string */
    value[0] = squot;
    strncpy (&value[1],cval,lcval);
    value[lcval+1] = squot;
    value[lcval+2] = 0;

    /* Put value into header string */
    hputc (hstring,keyword,value);

    /* Return to calling program */
    return;
}

/*---------------------------------------------------------------------*/
/*  HPUTC - Set character string keyword = value in FITS header string */

static void
hputc (hstring,keyword,value)

char *hstring;
char *keyword;
char *value;	/* character string containing the value for variable
		   keyword.  trailing and leading blanks are removed.  */
{
    char squot = 39;
    char line[100];
    char newcom[50];
    char blank[80];
    char *v, *vp, *v1, *v2, *q1, *q2, *c1, *ve;
    int lkeyword, lcom, lval, lc, i;

    for (i = 0; i < 80; i++)
	blank[i] = ' ';

    /*  find length of keyword and value */
    lkeyword = strlen (keyword);
    lval = strlen (value);

    /*  If COMMENT or HISTORY, always add it just before the END */
    if (lkeyword == 7 && (strncmp (keyword,"COMMENT",7) == 0 ||
	strncmp (keyword,"HISTORY",7) == 0)) {

	/* Find end of header */
	v1 = ksearch (hstring,"END");
	v2 = v1 + 80;

	/* Move END down one line */
	strncpy (v2, v1, 80);

	/* Insert keyword */
	strncpy (v1,keyword,7);

	/* Pad with spaces */
	for (vp = v1+lkeyword; vp < v2; vp++)
	    *vp = ' ';

	/* Insert comment */
	strncpy (v1+9,value,lval);
	return;
	}

    /* Otherwise search for keyword */
    else
	v1 = ksearch (hstring,keyword);

    /*  If parameter is not found, find a place to put it */
    if (v1 == NULL) {
	
	/* First look for blank lines before END */
        v1 = blsearch (hstring, "END");
    
	/*  Otherwise, create a space for it at the end of the header */
	if (v1 == NULL) {
	    ve = ksearch (hstring,"END");
	    v1 = ve;
	    v2 = v1 + 80;
	    strncpy (v2, ve, 80);
	    }
	else
	    v2 = v1 + 80;
	lcom = 0;
	newcom[0] = 0;
	}

    /*  Otherwise, extract the entry for this keyword from the header */
    else {
	strncpy (line, v1, 80);
	line[80] = 0;
	v2 = v1 + 80;

	/*  check for quoted value */
	q1 = strchr (line, squot);
	if (q1 != NULL)
	    q2 = strchr (q1+1,squot);
	else
	    q2 = line;

	/*  extract comment and remove trailing spaces */

	c1 = strchr (q2,'/');
	if (c1 != NULL) {
	    lcom = 80 - (c1 - line);
	    strncpy (newcom, c1+1, lcom);
	    vp = newcom + lcom - 1;
	    while (vp-- > newcom && *vp == ' ')
		*vp = 0;
	    lcom = strlen (newcom);
	    }
	else {
	    newcom[0] = 0;
	    lcom = 0;
	    }
	}

    /* Fill new entry with spaces */
    for (vp = v1; vp < v2; vp++)
	*vp = ' ';

    /*  Copy keyword to new entry */
    strncpy (v1, keyword, lkeyword);

    /*  Add parameter value in the appropriate place */
    vp = v1 + 8;
    *vp = '=';
    vp = v1 + 9;
    *vp = ' ';
    vp = vp + 1;
    if (*value == squot) {
	strncpy (vp, value, lval);
	if (lval+12 > 31)
	    lc = lval + 12;
	else
	    lc = 30;
	}
    else {
	vp = v1 + 30 - lval;
	strncpy (vp, value, lval);
	lc = 30;
	}

    /* Add comment in the appropriate place */
	if (lcom > 0) {
	    if (lc+2+lcom > 80)
		lcom = 78 - lc;
	    vp = v1 + lc + 2;     /* Jul 16 1997: was vp = v1 + lc * 2 */
	    *vp = '/';
	    vp = vp + 1;
	    strncpy (vp, newcom, lcom);
	    for (v = vp + lcom; v < v2; v++)
		*v = ' ';
	    }

	return;
}

/*-------------------------------------------------------------------*/
/*  HPUTCOM - Set comment for keyword or on line in FITS header string */

static void
hputcom (hstring,keyword,comment)

  char *hstring;
  char *keyword;
  char *comment;
{
	char squot;
	char line[100];
	int lkeyword, lcom;
	char *vp, *v1, *v2, *c0 = NULL, *c1, *q1, *q2;

	squot = 39;

/*  Find length of variable name */
	lkeyword = strlen (keyword);

/*  If COMMENT or HISTORY, always add it just before the END */
	if (lkeyword == 7 && (strncmp (keyword,"COMMENT",7) == 0 ||
	    strncmp (keyword,"HISTORY",7) == 0)) {

	/* Find end of header */
	    v1 = ksearch (hstring,"END");
	    v2 = v1 + 80;
	    strncpy (v2, v1, 80);

	/*  blank out new line and insert keyword */
	    for (vp = v1; vp < v2; vp++)
		*vp = ' ';
	    strncpy (v1, keyword, lkeyword);
	    }

/* search header string for variable name */
	else {
	    v1 = ksearch (hstring,keyword);
	    v2 = v1 + 80;

	/* if parameter is not found, return without doing anything */
	    if (v1 == NULL) {
		return;
		}

	/* otherwise, extract entry for this variable from the header */
	    strncpy (line, v1, 80);

	/* check for quoted value */
	    q1 = strchr (line,squot);
	    if (q1 != NULL)
		q2 = strchr (q1+1,squot);
	    else
		q2 = NULL;

	    if (q2 == NULL || q2-line < 31)
		c0 = v1 + 31;
	    else
		c0 = v1 + (q2-line) + 2; /* allan: 1997-09-30, was c0=q2+2 */

	    strncpy (c0, "/ ",2);
	    }

/* create new entry */
	lcom = strlen (comment);

	if (lcom > 0) {
	    c1 = c0 + 2;
	    if (c1+lcom > v2)
		lcom = v2 - c1;
	    strncpy (c1, comment, lcom);
	    }

}
cfitsio-3.47/iter_a.c0000644000225700000360000001220513464573432014017 0ustar  cagordonlhea#include 
#include 
#include 
#include "fitsio.h"

/*
  This program illustrates how to use the CFITSIO iterator function.
  It reads and modifies the input 'iter_a.fit' file by computing a
  value for the 'rate' column as a function of the values in the other
  'counts' and 'time' columns.
*/
main()
{
    extern flux_rate(); /* external work function is passed to the iterator */
    fitsfile *fptr;
    iteratorCol cols[3];  /* structure used by the iterator function */
    int n_cols;
    long rows_per_loop, offset;

    int status, nkeys, keypos, hdutype, ii, jj;
    char filename[]  = "iter_a.fit";     /* name of rate FITS file */

    status = 0; 

    fits_open_file(&fptr, filename, READWRITE, &status); /* open file */

    /* move to the desired binary table extension */
    if (fits_movnam_hdu(fptr, BINARY_TBL, "RATE", 0, &status) )
        fits_report_error(stderr, status);    /* print out error messages */

    n_cols  = 3;   /* number of columns */

    /* define input column structure members for the iterator function */
    fits_iter_set_by_name(&cols[0], fptr, "COUNTS", TLONG,  InputCol);
    fits_iter_set_by_name(&cols[1], fptr, "TIME",   TFLOAT, InputCol);
    fits_iter_set_by_name(&cols[2], fptr, "RATE",   TFLOAT, OutputCol);

    rows_per_loop = 0;  /* use default optimum number of rows */
    offset = 0;         /* process all the rows */

    /* apply the rate function to each row of the table */
    printf("Calling iterator function...%d\n", status);

    fits_iterate_data(n_cols, cols, offset, rows_per_loop,
                      flux_rate, 0L, &status);

    fits_close_file(fptr, &status);      /* all done */

    if (status)
        fits_report_error(stderr, status);  /* print out error messages */

    return(status);
}
/*--------------------------------------------------------------------------*/
int flux_rate(long totalrows, long offset, long firstrow, long nrows,
             int ncols, iteratorCol *cols, void *user_strct ) 

/*
   Sample iterator function that calculates the output flux 'rate' column
   by dividing the input 'counts' by the 'time' column.
   It also applies a constant deadtime correction factor if the 'deadtime'
   keyword exists.  Finally, this creates or updates the 'LIVETIME'
   keyword with the sum of all the individual integration times.
*/
{
    int ii, status = 0;

    /* declare variables static to preserve their values between calls */
    static long *counts;
    static float *interval;
    static float *rate;
    static float deadtime, livetime; /* must preserve values between calls */

    /*--------------------------------------------------------*/
    /*  Initialization procedures: execute on the first call  */
    /*--------------------------------------------------------*/
    if (firstrow == 1)
    {
       if (ncols != 3)
           return(-1);  /* number of columns incorrect */

       if (fits_iter_get_datatype(&cols[0]) != TLONG  ||
           fits_iter_get_datatype(&cols[1]) != TFLOAT ||
           fits_iter_get_datatype(&cols[2]) != TFLOAT )
           return(-2);  /* bad data type */

       /* assign the input pointers to the appropriate arrays and null ptrs*/
       counts       = (long *)  fits_iter_get_array(&cols[0]);
       interval     = (float *) fits_iter_get_array(&cols[1]);
       rate         = (float *) fits_iter_get_array(&cols[2]);

       livetime = 0;  /* initialize the total integration time */

       /* try to get the deadtime keyword value */
       fits_read_key(cols[0].fptr, TFLOAT, "DEADTIME", &deadtime, '\0',
                     &status);
       if (status)
       {
           deadtime = 1.0;  /* default deadtime if keyword doesn't exist */
       }
       else if (deadtime < 0. || deadtime > 1.0)
       {
           return(-1);    /* bad deadtime value */
       }

       printf("deadtime = %f\n", deadtime);
    }

    /*--------------------------------------------*/
    /*  Main loop: process all the rows of data */
    /*--------------------------------------------*/

    /*  NOTE: 1st element of array is the null pixel value!  */
    /*  Loop from 1 to nrows, not 0 to nrows - 1.  */

    /* this version tests for null values */
    rate[0] = DOUBLENULLVALUE;   /* define the value that represents null */

    for (ii = 1; ii <= nrows; ii++)
    {
       if (counts[ii] == counts[0])   /*  undefined counts value? */
       {
           rate[ii] = DOUBLENULLVALUE;
       }
       else if (interval[ii] > 0.)
       {
           rate[ii] = counts[ii] / interval[ii] / deadtime;
           livetime += interval[ii];  /* accumulate total integration time */
       }
       else
           return(-2);  /* bad integration time */
    }

    /*-------------------------------------------------------*/
    /*  Clean up procedures:  after processing all the rows  */
    /*-------------------------------------------------------*/

    if (firstrow + nrows - 1 == totalrows)
    {
        /*  update the LIVETIME keyword value */

        fits_update_key(cols[0].fptr, TFLOAT, "LIVETIME", &livetime, 
                 "total integration time", &status);
        printf("livetime = %f\n", livetime);
   }
    return(0);  /* return successful status */
}
cfitsio-3.47/iter_a.f0000644000225700000360000001533213464573432014026 0ustar  cagordonlhea      program f77iterate_a

      external flux_rate
      integer ncols
      parameter (ncols=3)
      integer units(ncols), colnum(ncols), datatype(ncols)
      integer iotype(ncols), offset, rows_per_loop, status
      character*70 colname(ncols)
      integer iunit, blocksize
      character*80 fname

C     include f77.inc -------------------------------------
C     Codes for FITS extension types
      integer IMAGE_HDU, ASCII_TBL, BINARY_TBL
      parameter (
     &     IMAGE_HDU  = 0,
     &     ASCII_TBL  = 1,
     &     BINARY_TBL = 2  )

C     Codes for FITS table data types

      integer TBIT,TBYTE,TLOGICAL,TSTRING,TSHORT,TINT
      integer TFLOAT,TDOUBLE,TCOMPLEX,TDBLCOMPLEX
      parameter (
     &     TBIT        =   1,
     &     TBYTE       =  11,
     &     TLOGICAL    =  14,
     &     TSTRING     =  16,
     &     TSHORT      =  21,
     &     TINT        =  31,
     &     TFLOAT      =  42,
     &     TDOUBLE     =  82,
     &     TCOMPLEX    =  83,
     &     TDBLCOMPLEX = 163  )

C     Codes for iterator column types

      integer InputCol, InputOutputCol, OutputCol
      parameter (
     &     InputCol       = 0,
     &     InputOutputCol = 1,
     &     OutputCol      = 2  )
C     End of f77.inc -------------------------------------


      iunit = 15

      units(1) = iunit
      units(2) = iunit
      units(3) = iunit

C open the file
      fname = 'iter_a.fit'
      call ftopen(iunit,fname,1,blocksize,status)

C move to the HDU containing the rate table
      call ftmnhd(iunit, BINARY_TBL, 'RATE', 0, status)

C Select iotypes for column data
      iotype(1) = InputCol
      iotype(2) = InputCol
      iotype(3) = OutputCol

C Select desired datatypes for column data
      datatype(1) = TINT
      datatype(2) = TFLOAT
      datatype(3) = TFLOAT

C find the column number corresponding to each column
      call ftgcno( iunit, 0, 'counts', colnum(1), status )
      call ftgcno( iunit, 0, 'time', colnum(2), status )
      call ftgcno( iunit, 0, 'rate', colnum(3), status )

C use default optimum number of rows
      rows_per_loop = 0
      offset = 0

C apply the rate function to each row of the table
      print *, 'Calling iterator function...', status

C although colname is not being used, still need to send a string
C array in the function
      call ftiter( ncols, units, colnum, colname, datatype, iotype,
     &      offset, rows_per_loop, flux_rate, 3, status )

      call ftclos(iunit, status)
      stop
      end

C***************************************************************************
C   Sample iterator function that calculates the output flux 'rate' column
C   by dividing the input 'counts' by the 'time' column.
C   It also applies a constant deadtime correction factor if the 'deadtime'
C   keyword exists.  Finally, this creates or updates the 'LIVETIME'
C   keyword with the sum of all the individual integration times.
C***************************************************************************
      subroutine flux_rate(totalrows, offset, firstrow, nrows, ncols,
     &     units, colnum, datatype, iotype, repeat, status, userData,
     &     counts, interval, rate )

      integer totalrows, offset, firstrow, nrows, ncols
      integer units(ncols), colnum(ncols), datatype(ncols)
      integer iotype(ncols), repeat(ncols)
      integer userData

C     include f77.inc -------------------------------------
C     Codes for FITS extension types
      integer IMAGE_HDU, ASCII_TBL, BINARY_TBL
      parameter (
     &     IMAGE_HDU  = 0,
     &     ASCII_TBL  = 1,
     &     BINARY_TBL = 2  )

C     Codes for FITS table data types

      integer TBIT,TBYTE,TLOGICAL,TSTRING,TSHORT,TINT
      integer TFLOAT,TDOUBLE,TCOMPLEX,TDBLCOMPLEX
      parameter (
     &     TBIT        =   1,
     &     TBYTE       =  11,
     &     TLOGICAL    =  14,
     &     TSTRING     =  16,
     &     TSHORT      =  21,
     &     TINT        =  31,
     &     TFLOAT      =  42,
     &     TDOUBLE     =  82,
     &     TCOMPLEX    =  83,
     &     TDBLCOMPLEX = 163  )

C     Codes for iterator column types

      integer InputCol, InputOutputCol, OutputCol
      parameter (
     &     InputCol       = 0,
     &     InputOutputCol = 1,
     &     OutputCol      = 2  )
C     End of f77.inc -------------------------------------

      integer counts(*)
      real interval(*),rate(*)

      integer ii, status
      character*80 comment

C**********************************************************************
C  must preserve these values between calls
      real deadtime, livetime
      common /fluxblock/ deadtime, livetime
C**********************************************************************

      if (status .ne. 0) return

C    --------------------------------------------------------
C      Initialization procedures: execute on the first call  
C    --------------------------------------------------------
      if (firstrow .eq. 1) then
         if (ncols .ne. 3) then
C     wrong number of columns
            status = -1
            return
         endif

         if (datatype(1).ne.TINT .or. datatype(2).ne.TFLOAT .or.
     &        datatype(3).ne.TFLOAT ) then
C     bad data type
            status = -2
            return
         endif

C     try to get the deadtime keyword value
         call ftgkye( units(1), 'DEADTIME', deadtime, comment, status )

         if (status.ne.0) then
C     default deadtime if keyword doesn't exist
            deadtime = 1.0
            status = 0
         elseif (deadtime .lt. 0.0 .or. deadtime .gt. 1.0) then
C     bad deadtime value
            status = -3
            return
         endif

         print *, 'deadtime = ', deadtime

         livetime = 0.0
      endif

C    --------------------------------------------
C      Main loop: process all the rows of data
C    --------------------------------------------
      
C     NOTE: 1st element of array is the null pixel value!
C     Loop over elements 2 to nrows+1, not 1 to nrows.
      
C     this version ignores null values

C     set the output null value to zero to ignore nulls */
      rate(1) = 0.0
      do 10 ii = 2,nrows+1
         if ( interval(ii) .gt. 0.0) then
           rate(ii) = counts(ii) / interval(ii) / deadtime
           livetime = livetime + interval(ii)
        else
C     Nonsensical negative time interval
           status = -3
           return
        endif
 10   continue

C    -------------------------------------------------------
C      Clean up procedures:  after processing all the rows  
C    -------------------------------------------------------

      if (firstrow + nrows - 1 .eq. totalrows) then
C     update the LIVETIME keyword value

         call ftukye( units(1),'LIVETIME', livetime, 3,
     &        'total integration time', status )
         print *,'livetime = ', livetime

      endif
 
      return
      end
cfitsio-3.47/iter_a.fit0000644000225700000360000037510013464573432014365 0ustar  cagordonlheaSIMPLE  =                    T / file does conform to FITS standard             BITPIX  =                   16 / number of bits per data pixel                  NAXIS   =                    0 / number of data axes                            EXTEND  =                    T / FITS dataset may contain extensions            COMMENT   FITS (Flexible Image Transport System) format defined in Astronomy andCOMMENT   Astrophysics Supplement Series v44/p363, v44/p371, v73/p359, v73/p365.COMMENT   Contact the NASA Science Office of Standards and Technology for the   COMMENT   FITS Definition document #100 and other FITS information.             HISTORY    TASK:FMERGE on file ratefile.fits                                    HISTORY   fmerge3.1c at 29/12/97 16:1:37.                                       HISTORY    TASK:FMERGE on file m1.fits                                          HISTORY   fmerge3.1c at 29/12/97 16:2:30.                                       HISTORY    TASK:FMERGE on file m3.fits                                          HISTORY   fmerge3.1c at 29/12/97 16:3:38.                                       HISTORY    TASK:FMERGE on file m5.fits                                          HISTORY   fmerge3.1c at 29/12/97 16:4:15.                                       HISTORY    TASK:FMERGE on file m7.fits                                          HISTORY   fmerge3.1c at 29/12/97 16:5:1.0                                       HISTORY    TASK:FMERGE on file m9.fits                                          HISTORY   fmerge3.1c at 29/12/97 16:6:48.                                       END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             XTENSION= 'BINTABLE'           / binary table extension                         BITPIX  =                    8 / 8-bit bytes                                    NAXIS   =                    2 / 2-dimensional binary table                     NAXIS1  =                   12 / width of table in bytes                        NAXIS2  =                10000 / number of rows in table                        PCOUNT  =                    0 / size of special data area                      GCOUNT  =                    1 / one data group (required keyword)              TFIELDS =                    3 / number of fields in each row                   TTYPE1  = 'Counts  '           / label for field   1                            TFORM1  = 'J       '           / data format of field: 4-byte INTEGER           TTYPE2  = 'Time    '           / label for field   2                            TFORM2  = 'E       '           / data format of field: 4-byte REAL              TTYPE3  = 'Rate    '           / label for field   3                            TFORM3  = 'E       '           / data format of field: 4-byte REAL              EXTNAME = 'rate    '           / name of this binary table extension            DEADTIME=                  1.0                                                  HISTORY   This FITS file was created by the FCREATE task.                       HISTORY   fcreate3.1 at 29/12/97                                                HISTORY   File modified by user 'pence' with fv  on 97-12-29T15:45:06           HISTORY   File modified by user 'pence' with fv  on 97-12-29T15:54:30           LIVETIME=              30554.5 / total integration time                         HISTORY    TASK:FMERGE copied   26924 rows from file ratefile.fits              HISTORY    TASK:FMERGE appended   26924 rows from file r2.fits                  HISTORY    TASK:FMERGE copied   53848 rows from file m1.fits                    HISTORY    TASK:FMERGE appended   53848 rows from file m2.fits                  HISTORY    TASK:FMERGE copied  107696 rows from file m3.fits                    HISTORY    TASK:FMERGE appended  107696 rows from file m4.fits                  HISTORY    TASK:FMERGE copied  215392 rows from file m5.fits                    HISTORY    TASK:FMERGE appended  215392 rows from file m6.fits                  HISTORY    TASK:FMERGE copied  430784 rows from file m7.fits                    HISTORY    TASK:FMERGE appended  430784 rows from file m8.fits                  HISTORY    TASK:FMERGE copied  861568 rows from file m9.fits                    HISTORY    TASK:FMERGE appended  861568 rows from file m10.fits                 HISTORY   File modified by user 'pence' with fv  on 97-12-30T10:44:37           HISTORY   File modified by user 'pence' with fv  on 97-12-30T10:51:44           HISTORY   ftabcopy V4.0a copied columns from ratefile.fits                      HISTORY   ftabcopy V4.0a at 5/1/98 23:10:24                                     END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À@@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À@@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ ?€@ÀdA A ?€@ ?€@@@AUU-@ð@À
?€A @@°?€@ cfitsio-3.47/iter_b.c0000644000225700000360000000716613464573432014032 0ustar  cagordonlhea#include 
#include 
#include 
#include "fitsio.h"

/*
  This program illustrates how to use the CFITSIO iterator function.
  It simply prints out the values in a character string and a logical
  type column in a table, and toggles the value in the logical column
  so that T -> F and F -> T.
*/
main()
{
    extern str_iter(); /* external work function is passed to the iterator */
    fitsfile *fptr;
    iteratorCol cols[2];
    int n_cols;
    long rows_per_loop, offset;
    int status = 0;
    char filename[]  = "iter_b.fit";     /* name of rate FITS file */

    /* open the file and move to the correct extension */
    fits_open_file(&fptr, filename, READWRITE, &status);
    fits_movnam_hdu(fptr, BINARY_TBL, "iter_test", 0, &status);

    /* define input column structure members for the iterator function */
    n_cols  = 2;   /* number of columns */

    /* define input column structure members for the iterator function */
    fits_iter_set_by_name(&cols[0], fptr, "Avalue", TSTRING,  InputOutputCol);
    fits_iter_set_by_name(&cols[1], fptr, "Lvalue", TLOGICAL, InputOutputCol);

    rows_per_loop = 0;  /* use default optimum number of rows */
    offset = 0;         /* process all the rows */

    /* apply the  function to each row of the table */
    printf("Calling iterator function...%d\n", status);

    fits_iterate_data(n_cols, cols, offset, rows_per_loop,
                      str_iter, 0L, &status);

    fits_close_file(fptr, &status);      /* all done */

    if (status)
       fits_report_error(stderr, status); /* print out error messages */

    return(status);
}
/*--------------------------------------------------------------------------*/
int str_iter(long totalrows, long offset, long firstrow, long nrows,
             int ncols, iteratorCol *cols, void *user_strct )

/*
   Sample iterator function.
*/
{
    int ii;

    /* declare variables static to preserve their values between calls */
    static char **stringvals;
    static char *logicalvals;

    /*--------------------------------------------------------*/
    /*  Initialization procedures: execute on the first call  */
    /*--------------------------------------------------------*/
    if (firstrow == 1)
    {
       if (ncols != 2)
           return(-1);  /* number of columns incorrect */

       if (fits_iter_get_datatype(&cols[0]) != TSTRING ||
           fits_iter_get_datatype(&cols[1]) != TLOGICAL )
           return(-2);  /* bad data type */

       /* assign the input pointers to the appropriate arrays */
       stringvals       = (char **) fits_iter_get_array(&cols[0]);
       logicalvals      = (char *)  fits_iter_get_array(&cols[1]);

       printf("Total rows, No. rows = %d %d\n",totalrows, nrows);
    }

    /*------------------------------------------*/
    /*  Main loop: process all the rows of data */
    /*------------------------------------------*/

    /*  NOTE: 1st element of array is the null pixel value!  */
    /*  Loop from 1 to nrows, not 0 to nrows - 1.  */
   
    for (ii = 1; ii <= nrows; ii++)
    {
      printf("%s %d\n", stringvals[ii], logicalvals[ii]);
      if (logicalvals[ii])
      {
         logicalvals[ii] = FALSE;
         strcpy(stringvals[ii], "changed to false");
      }
      else
      {
         logicalvals[ii] = TRUE;
         strcpy(stringvals[ii], "changed to true");
      }
    }

    /*-------------------------------------------------------*/
    /*  Clean up procedures:  after processing all the rows  */
    /*-------------------------------------------------------*/

    if (firstrow + nrows - 1 == totalrows)
    {
      /* no action required in this case */
    }
 
    return(0);
}
cfitsio-3.47/iter_b.f0000644000225700000360000001305713464573432014031 0ustar  cagordonlhea      program f77iterate_b

C     external work function is passed to the iterator
      external str_iter

      integer ncols
      parameter (ncols=2)
      integer units(ncols), colnum(ncols), datatype(ncols)
      integer iotype(ncols), offset, rows_per_loop, status
      character*70 colname(ncols)

      integer iunit, blocksize
      character*80 fname

C     include f77.inc -------------------------------------
C     Codes for FITS extension types
      integer IMAGE_HDU, ASCII_TBL, BINARY_TBL
      parameter (
     &     IMAGE_HDU  = 0,
     &     ASCII_TBL  = 1,
     &     BINARY_TBL = 2  )

C     Codes for FITS table data types

      integer TBIT,TBYTE,TLOGICAL,TSTRING,TSHORT,TINT
      integer TFLOAT,TDOUBLE,TCOMPLEX,TDBLCOMPLEX
      parameter (
     &     TBIT        =   1,
     &     TBYTE       =  11,
     &     TLOGICAL    =  14,
     &     TSTRING     =  16,
     &     TSHORT      =  21,
     &     TINT        =  31,
     &     TFLOAT      =  42,
     &     TDOUBLE     =  82,
     &     TCOMPLEX    =  83,
     &     TDBLCOMPLEX = 163  )

C     Codes for iterator column types

      integer InputCol, InputOutputCol, OutputCol
      parameter (
     &     InputCol       = 0,
     &     InputOutputCol = 1,
     &     OutputCol      = 2  )
C     End of f77.inc -------------------------------------

      status = 0

      fname = 'iter_b.fit'
      iunit = 15

C     both columns are in the same FITS file
      units(1) = iunit
      units(2) = iunit

C     open the file and move to the correct extension
      call ftopen(iunit,fname,1,blocksize,status)
      call ftmnhd(iunit, BINARY_TBL, 'iter_test', 0, status)

C     define the desired columns by name
      colname(1) = 'Avalue'
      colname(2) = 'Lvalue'

C     leave column numbers undefined
      colnum(1) = 0
      colnum(2) = 0  

C     define the desired datatype for each column: TSTRING & TLOGICAL
      datatype(1) = TSTRING
      datatype(2) = TLOGICAL

C     define whether columns are input, input/output, or output only
C     Both in/out
      iotype(1) = InputOutputCol
      iotype(2) = InputOutputCol
 
C     use default optimum number of rows and process all the rows
      rows_per_loop = 0
      offset = 0

C     apply the  function to each row of the table
      print *,'Calling iterator function...', status

      call ftiter( ncols, units, colnum, colname, datatype, iotype,
     &      offset, rows_per_loop, str_iter, 0, status )

      call ftclos(iunit, status)

C     print out error messages if problem
      if (status.ne.0) call ftrprt('STDERR', status)
      stop
      end

C--------------------------------------------------------------------------
C
C   Sample iterator function.
C
C--------------------------------------------------------------------------
      subroutine str_iter(totalrows, offset, firstrow, nrows, ncols,
     &     units, colnum, datatype, iotype, repeat, status, 
     &     userData, stringCol, logicalCol )

      integer totalrows,offset,firstrow,nrows,ncols,status
      integer units(*),colnum(*),datatype(*),iotype(*),repeat(*)
      integer userData
      character*(*) stringCol(*)
      logical logicalCol(*)

      integer ii

C     include f77.inc -------------------------------------
C     Codes for FITS extension types
      integer IMAGE_HDU, ASCII_TBL, BINARY_TBL
      parameter (
     &     IMAGE_HDU  = 0,
     &     ASCII_TBL  = 1,
     &     BINARY_TBL = 2  )

C     Codes for FITS table data types

      integer TBIT,TBYTE,TLOGICAL,TSTRING,TSHORT,TINT
      integer TFLOAT,TDOUBLE,TCOMPLEX,TDBLCOMPLEX
      parameter (
     &     TBIT        =   1,
     &     TBYTE       =  11,
     &     TLOGICAL    =  14,
     &     TSTRING     =  16,
     &     TSHORT      =  21,
     &     TINT        =  31,
     &     TFLOAT      =  42,
     &     TDOUBLE     =  82,
     &     TCOMPLEX    =  83,
     &     TDBLCOMPLEX = 163  )

C     Codes for iterator column types

      integer InputCol, InputOutputCol, OutputCol
      parameter (
     &     InputCol       = 0,
     &     InputOutputCol = 1,
     &     OutputCol      = 2  )
C     End of f77.inc -------------------------------------

      if (status .ne. 0) return

C    --------------------------------------------------------
C      Initialization procedures: execute on the first call  
C    --------------------------------------------------------
      if (firstrow .eq. 1) then
         if (ncols .ne. 2) then
            status = -1
            return
         endif
         
         if (datatype(1).ne.TSTRING .or. datatype(2).ne.TLOGICAL) then
            status = -2
            return
         endif
         
         print *,'Total rows, No. rows = ',totalrows, nrows
         
      endif
      
C     -------------------------------------------
C       Main loop: process all the rows of data 
C     -------------------------------------------
      
C     NOTE: 1st element of array is the null pixel value!
C     Loop over elements 2 to nrows+1, not 1 to nrows.
      
      do 10 ii=2,nrows+1
         print *, stringCol(ii), logicalCol(ii)
         if( logicalCol(ii) ) then
            logicalCol(ii) = .false.
            stringCol(ii) = 'changed to false'
         else
            logicalCol(ii) = .true.
            stringCol(ii) = 'changed to true'
         endif
 10   continue
      
C     -------------------------------------------------------
C     Clean up procedures:  after processing all the rows  
C     -------------------------------------------------------
      
      if (firstrow + nrows - 1 .eq. totalrows) then
C     no action required in this case
      endif
      
      return
      end
      
cfitsio-3.47/iter_b.fit0000644000225700000360000143660013464573432014372 0ustar  cagordonlheaSIMPLE  =                    T / file does conform to FITS standard             BITPIX  =                   16 / number of bits per data pixel                  NAXIS   =                    0 / number of data axes                            EXTEND  =                    T / FITS dataset may contain extensions            COMMENT   FITS (Flexible Image Transport System) format defined in Astronomy andCOMMENT   Astrophysics Supplement Series v44/p363, v44/p371, v73/p359, v73/p365.COMMENT   Contact the NASA Science Office of Standards and Technology for the   COMMENT   FITS Definition document #100 and other FITS information.             END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             XTENSION= 'BINTABLE'           / binary table extension                         BITPIX  =                    8 / 8-bit bytes                                    NAXIS   =                    2 / 2-dimensional binary table                     NAXIS1  =                 4021 / width of table in bytes                        NAXIS2  =                  100 / number of rows in table                        PCOUNT  =                    0 / size of special data area                      GCOUNT  =                    1 / one data group (required keyword)              TFIELDS =                    3 / number of fields in each row                   TTYPE1  = 'Avalue  '           / label for field   1                            TFORM1  = '20A     '           / data format of field: ASCII Character          TTYPE2  = 'Lvalue  '           / label for field   2                            TFORM2  = '1L      '           / data format of field: 1-byte LOGICAL           TUNIT2  = 'm**2    '           / physical unit of field                         TTYPE3  = 'Evalue  '           / label for field   3                            TFORM3  = '1000E   '           / data format of field: 4-byte REAL              TUNIT3  = 'cm      '           / physical unit of field                         EXTNAME = 'iter_test'          / name of this binary table extension            END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             changed to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to false    Fchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tchanged to true     Tcfitsio-3.47/iter_c.c0000644000225700000360000001356713464573432014035 0ustar  cagordonlhea#include 
#include 
#include 
#include "fitsio.h"

/*
    This example program illustrates how to use the CFITSIO iterator function.

    This program creates a 2D histogram of the X and Y columns of an event
    list.  The 'main' routine just creates the empty new image, then executes
    the 'writehisto' work function by calling the CFITSIO iterator function.

    'writehisto' opens the FITS event list that contains the X and Y columns.
    It then calls a second work function, calchisto, (by recursively calling
    the CFITSIO iterator function) which actually computes the 2D histogram.
*/

/*   Globally defined parameters */

long xsize = 480; /* size of the histogram image */
long ysize = 480;
long xbinsize = 32;
long ybinsize = 32;

main()
{
    extern writehisto();  /* external work function passed to the iterator */
    extern long xsize, ysize;  /* size of image */

    fitsfile *fptr;
    iteratorCol cols[1];
    int n_cols, status = 0;
    long n_per_loop, offset, naxes[2];
    char filename[]  = "histoimg.fit";     /* name of FITS image */

    remove(filename);   /* delete previous version of the file if it exists */
    fits_create_file(&fptr, filename, &status);  /* create new output image */

    naxes[0] = xsize;
    naxes[1] = ysize;
    fits_create_img(fptr, LONG_IMG, 2, naxes, &status); /* create primary HDU */

    n_cols  = 1;   /* number of columns */

    /* define input column structure members for the iterator function */
    fits_iter_set_by_name(&cols[0], fptr, " ", TLONG, OutputCol);

    n_per_loop = -1;  /* force whole array to be passed at one time */
    offset = 0;       /* don't skip over any pixels */

    /* execute the function to create and write the 2D histogram */
    printf("Calling writehisto iterator work function... %d\n", status);

    fits_iterate_data(n_cols, cols, offset, n_per_loop,
                      writehisto, 0L, &status);

    fits_close_file(fptr, &status);      /* all done; close the file */

    if (status)
        fits_report_error(stderr, status);  /* print out error messages */
    else
        printf("Program completed successfully.\n");

    return(status);
}
/*--------------------------------------------------------------------------*/
int writehisto(long totaln, long offset, long firstn, long nvalues,
             int narrays, iteratorCol *histo, void *userPointer)
/*
   Iterator work function that writes out the 2D histogram.
   The histogram values are calculated by another work function, calchisto.

   This routine is executed only once since nvalues was forced to = totaln.
*/
{
    extern calchisto();  /* external function called by the iterator */
    long *histogram;
    fitsfile *tblptr;
    iteratorCol cols[2];
    int n_cols, status = 0;
    long rows_per_loop, rowoffset;
    char filename[]  = "iter_c.fit";     /* name of FITS table */

    /* do sanity checking of input values */
    if (totaln != nvalues)
        return(-1);  /* whole image must be passed at one time */

    if (narrays != 1)
        return(-2);  /* number of images is incorrect */

    if (fits_iter_get_datatype(&histo[0]) != TLONG)
        return(-3);  /* input array has wrong data type */

    /* assign the FITS array pointer to the global histogram pointer */
    histogram = (long *) fits_iter_get_array(&histo[0]);

    /* open the file and move to the table containing the X and Y columns */
    fits_open_file(&tblptr, filename, READONLY, &status);
    fits_movnam_hdu(tblptr, BINARY_TBL, "EVENTS", 0, &status);
    if (status)
       return(status);
   
    n_cols = 2; /* number of columns */

    /* define input column structure members for the iterator function */
    fits_iter_set_by_name(&cols[0], tblptr, "X", TLONG,  InputCol);
    fits_iter_set_by_name(&cols[1], tblptr, "Y", TLONG, InputCol);

    rows_per_loop = 0;  /* take default number of rows per interation */
    rowoffset = 0;     

    /* calculate the histogram */
    printf("Calling calchisto iterator work function... %d\n", status);

    fits_iterate_data(n_cols, cols, rowoffset, rows_per_loop,
                      calchisto, histogram, &status);

    fits_close_file(tblptr, &status);      /* all done */
    return(status);
}
/*--------------------------------------------------------------------------*/
int calchisto(long totalrows, long offset, long firstrow, long nrows,
             int ncols, iteratorCol *cols, void *userPointer)

/*
   Interator work function that calculates values for the 2D histogram.
*/
{
    extern long xsize, ysize, xbinsize, ybinsize;
    long ii, ihisto, xbin, ybin;
    static long *xcol, *ycol, *histogram;  /* static to preserve values */

    /*--------------------------------------------------------*/
    /*  Initialization procedures: execute on the first call  */
    /*--------------------------------------------------------*/
    if (firstrow == 1)
    {
        /* do sanity checking of input values */
       if (ncols != 2)
         return(-3);  /* number of arrays is incorrect */

       if (fits_iter_get_datatype(&cols[0]) != TLONG ||
           fits_iter_get_datatype(&cols[1]) != TLONG)
         return(-4);  /* wrong datatypes */

       /* assign the input array points to the X and Y arrays */
       xcol = (long *) fits_iter_get_array(&cols[0]);
       ycol = (long *) fits_iter_get_array(&cols[1]);
       histogram = (long *) userPointer;

       /* initialize the histogram image pixels = 0 */
       for (ii = 0; ii <= xsize * ysize; ii++)
           histogram[ii] = 0L;
    }

    /*------------------------------------------------------------------*/
    /*  Main loop: increment the 2D histogram at position of each event */
    /*------------------------------------------------------------------*/

    for (ii = 1; ii <= nrows; ii++) 
    {
        xbin = xcol[ii] / xbinsize;
        ybin = ycol[ii] / ybinsize;

        ihisto = ( ybin * xsize ) + xbin + 1;
        histogram[ihisto]++;
    }

    return(0);
}

cfitsio-3.47/iter_c.f0000644000225700000360000002443513464573432014034 0ustar  cagordonlhea      program f77iterate_c
C
C    This example program illustrates how to use the CFITSIO iterator function.
C
C    This program creates a 2D histogram of the X and Y columns of an event
C    list.  The 'main' routine just creates the empty new image, then executes
C    the 'writehisto' work function by calling the CFITSIO iterator function.
C
C    'writehisto' opens the FITS event list that contains the X and Y columns.
C    It then calls a second work function, calchisto, (by recursively calling
C    the CFITSIO iterator function) which actually computes the 2D histogram.

C     external work function to be passed to the iterator
      external writehisto

      integer ncols
      parameter (ncols=1)
      integer units(ncols), colnum(ncols), datatype(ncols)
      integer iotype(ncols), offset, n_per_loop, status
      character*70 colname(ncols)

      integer naxes(2), ounit, blocksize
      character*80 fname
      logical exists

C     include f77.inc -------------------------------------
C     Codes for FITS extension types
      integer IMAGE_HDU, ASCII_TBL, BINARY_TBL
      parameter (
     &     IMAGE_HDU  = 0,
     &     ASCII_TBL  = 1,
     &     BINARY_TBL = 2  )

C     Codes for FITS table data types

      integer TBIT,TBYTE,TLOGICAL,TSTRING,TSHORT,TINT
      integer TFLOAT,TDOUBLE,TCOMPLEX,TDBLCOMPLEX
      parameter (
     &     TBIT        =   1,
     &     TBYTE       =  11,
     &     TLOGICAL    =  14,
     &     TSTRING     =  16,
     &     TSHORT      =  21,
     &     TINT        =  31,
     &     TFLOAT      =  42,
     &     TDOUBLE     =  82,
     &     TCOMPLEX    =  83,
     &     TDBLCOMPLEX = 163  )

C     Codes for iterator column types

      integer InputCol, InputOutputCol, OutputCol
      parameter (
     &     InputCol       = 0,
     &     InputOutputCol = 1,
     &     OutputCol      = 2  )
C     End of f77.inc -------------------------------------

C**********************************************************************
C     Need to make these variables available to the 2 work functions
      integer xsize,ysize,xbinsize,ybinsize
      common /histcomm/ xsize,ysize,xbinsize,ybinsize
C**********************************************************************

      status = 0

      xsize = 480
      ysize = 480
      xbinsize = 32
      ybinsize = 32

      fname = 'histoimg.fit'
      ounit = 15

C     delete previous version of the file if it exists
      inquire(file=fname,exist=exists)
      if( exists ) then
         open(ounit,file=fname,status='old')
         close(ounit,status='delete')
      endif
 99   blocksize = 2880

C     create new output image
      call ftinit(ounit,fname,blocksize,status)

      naxes(1) = xsize
      naxes(2) = ysize

C     create primary HDU
      call ftiimg(ounit,32,2,naxes,status)

      units(1) = ounit

C     Define column as TINT and Output
      datatype(1) = TINT
      iotype(1) = OutputCol

C     force whole array to be passed at one time
      n_per_loop = -1
      offset = 0

C     execute the function to create and write the 2D histogram
      print *,'Calling writehisto iterator work function... ',status

      call ftiter( ncols, units, colnum, colname, datatype, iotype,
     &      offset, n_per_loop, writehisto, 0, status )

      call ftclos(ounit, status)

C     print out error messages if problem
      if (status.ne.0) then
         call ftrprt('STDERR', status)
      else
        print *,'Program completed successfully.'
      endif

      stop
      end

C--------------------------------------------------------------------------
C
C   Sample iterator function.
C
C   Iterator work function that writes out the 2D histogram.
C   The histogram values are calculated by another work function, calchisto.
C
C--------------------------------------------------------------------------
      subroutine writehisto(totaln, offset, firstn, nvalues, narrays,
     &     units_out, colnum_out, datatype_out, iotype_out, repeat,
     &     status, userData, histogram )

      integer totaln,offset,firstn,nvalues,narrays,status
      integer units_out(narrays),colnum_out(narrays)
      integer datatype_out(narrays),iotype_out(narrays)
      integer repeat(narrays)
      integer histogram(*), userData

      external calchisto
      integer ncols
      parameter (ncols=2)
      integer units(ncols), colnum(ncols), datatype(ncols)
      integer iotype(ncols), rowoffset, rows_per_loop
      character*70 colname(ncols)

      integer iunit, blocksize
      character*80 fname

C     include f77.inc -------------------------------------
C     Codes for FITS extension types
      integer IMAGE_HDU, ASCII_TBL, BINARY_TBL
      parameter (
     &     IMAGE_HDU  = 0,
     &     ASCII_TBL  = 1,
     &     BINARY_TBL = 2  )

C     Codes for FITS table data types

      integer TBIT,TBYTE,TLOGICAL,TSTRING,TSHORT,TINT
      integer TFLOAT,TDOUBLE,TCOMPLEX,TDBLCOMPLEX
      parameter (
     &     TBIT        =   1,
     &     TBYTE       =  11,
     &     TLOGICAL    =  14,
     &     TSTRING     =  16,
     &     TSHORT      =  21,
     &     TINT        =  31,
     &     TFLOAT      =  42,
     &     TDOUBLE     =  82,
     &     TCOMPLEX    =  83,
     &     TDBLCOMPLEX = 163  )

C     Codes for iterator column types

      integer InputCol, InputOutputCol, OutputCol
      parameter (
     &     InputCol       = 0,
     &     InputOutputCol = 1,
     &     OutputCol      = 2  )
C     End of f77.inc -------------------------------------

C**********************************************************************
C     Need to make these variables available to the 2 work functions
      integer xsize,ysize,xbinsize,ybinsize
      common /histcomm/ xsize,ysize,xbinsize,ybinsize
C**********************************************************************

      if (status .ne. 0) return

C     name of FITS table
      fname = 'iter_c.fit'
      iunit = 16

C     do sanity checking of input values
      if (totaln .ne. nvalues) then
C     whole image must be passed at one time
         status = -1
         return
      endif

      if (narrays .ne. 1) then
C     number of images is incorrect
         status = -2
         return
      endif

      if (datatype_out(1) .ne. TINT) then
C     input array has wrong data type
         status = -3
         return
      endif

C     open the file and move to the table containing the X and Y columns
      call ftopen(iunit,fname,0,blocksize,status)
      call ftmnhd(iunit, BINARY_TBL, 'EVENTS', 0, status)
      if (status) return
   
C     both the columns are in the same FITS file
      units(1) = iunit
      units(2) = iunit

C     desired datatype for each column: TINT
      datatype(1) = TINT
      datatype(2) = TINT

C     names of the columns
      colname(1) = 'X'
      colname(2) = 'Y'

C     leave column numbers undefined
      colnum(1) = 0
      colnum(2) = 0

C     define whether columns are input, input/output, or output only
C     Both input
      iotype(1) = InputCol
      iotype(1) = InputCol
 
C     take default number of rows per iteration
      rows_per_loop = 0
      rowoffset = 0

C     calculate the histogram
      print *,'Calling calchisto iterator work function... ', status

      call ftiter( ncols, units, colnum, colname, datatype, iotype,
     &      rowoffset, rows_per_loop, calchisto, histogram, status )

      call ftclos(iunit,status)
      return
      end

C--------------------------------------------------------------------------
C
C   Iterator work function that calculates values for the 2D histogram.
C
C--------------------------------------------------------------------------
      subroutine calchisto(totalrows, offset, firstrow, nrows, ncols,
     &     units, colnum, datatype, iotype, repeat, status, 
     &     histogram, xcol, ycol )

      integer totalrows,offset,firstrow,nrows,ncols,status
      integer units(ncols),colnum(ncols),datatype(ncols)
      integer iotype(ncols),repeat(ncols)
      integer histogram(*),xcol(*),ycol(*)
C     include f77.inc -------------------------------------
C     Codes for FITS extension types
      integer IMAGE_HDU, ASCII_TBL, BINARY_TBL
      parameter (
     &     IMAGE_HDU  = 0,
     &     ASCII_TBL  = 1,
     &     BINARY_TBL = 2  )

C     Codes for FITS table data types

      integer TBIT,TBYTE,TLOGICAL,TSTRING,TSHORT,TINT
      integer TFLOAT,TDOUBLE,TCOMPLEX,TDBLCOMPLEX
      parameter (
     &     TBIT        =   1,
     &     TBYTE       =  11,
     &     TLOGICAL    =  14,
     &     TSTRING     =  16,
     &     TSHORT      =  21,
     &     TINT        =  31,
     &     TFLOAT      =  42,
     &     TDOUBLE     =  82,
     &     TCOMPLEX    =  83,
     &     TDBLCOMPLEX = 163  )

C     Codes for iterator column types

      integer InputCol, InputOutputCol, OutputCol
      parameter (
     &     InputCol       = 0,
     &     InputOutputCol = 1,
     &     OutputCol      = 2  )
C     End of f77.inc -------------------------------------

      integer ii, ihisto, xbin, ybin

C**********************************************************************
C     Need to make these variables available to the 2 work functions
      integer xsize,ysize,xbinsize,ybinsize
      common /histcomm/ xsize,ysize,xbinsize,ybinsize
C**********************************************************************

      if (status .ne. 0) return

C    --------------------------------------------------------
C      Initialization procedures: execute on the first call  
C    --------------------------------------------------------
      if (firstrow .eq. 1) then
C     do sanity checking of input values

         if (ncols .ne. 2) then
C     number of arrays is incorrect
            status = -4
            return
         endif

         if (datatype(1).ne.TINT .or. datatype(2).ne.TINT) then
C     wrong datatypes
            status = -5
            return
         endif

C     initialize the histogram image pixels = 0, including null value
         do 10 ii = 1, xsize * ysize + 1
            histogram(ii) = 0
 10     continue

      endif

C     ------------------------------------------------------------------
C       Main loop: increment the 2D histogram at position of each event 
C     ------------------------------------------------------------------

      do 20 ii=2,nrows+1
        xbin = xcol(ii) / xbinsize
        ybin = ycol(ii) / ybinsize

        ihisto = ( ybin * xsize ) + xbin + 2
        histogram(ihisto) = histogram(ihisto) + 1
 20   continue

      return
      end

cfitsio-3.47/iter_c.fit0000644000225700000360000026400013464573432014363 0ustar  cagordonlheaSIMPLE  =                    T / file does conform to FITS standard             BITPIX  =                   32 / number of bits per data pixel                  NAXIS   =                    0 / number of data axes                            EXTEND  =                    T / FITS dataset may contain extensions            COMMENT   FITS (Flexible Image Transport System) format defined in Astronomy andCOMMENT   Astrophysics Supplement Series v44/p363, v44/p371, v73/p359, v73/p365.COMMENT   Contact the NASA Science Office of Standards and Technology for the   COMMENT   FITS Definition document #100 and other FITS information.             END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             XTENSION= 'BINTABLE'  /  FITS 3D BINARY TABLE                                   BITPIX  =                    8  /  Binary data                                  NAXIS   =                    2  /  Table is a matrix                            NAXIS1  =                   16 /  Width of table in bytes                       NAXIS2  =                 5000 /  Number of entries in table                    PCOUNT  =                    0  /  Random parameter count                       GCOUNT  =                    1  /  Group count                                  TFIELDS =                    5 /  Number of fields in each row                  EXTNAME = 'EVENTS  '  /  Table name                                             EXTVER  =                    1  /  Version number of table                      TFORM1  = '1I      '  /  Data type for field                                    TTYPE1  = 'X       '  /  Label for field                                        TUNIT1  = '        '  /  Physical units for field                               TFORM2  = '1I      '  /  Data type for field                                    TTYPE2  = 'Y       '  /  Label for field                                        TUNIT2  = '        '  /  Physical units for field                               TFORM3  = '1I      '  /  Data type for field                                    TTYPE3  = 'PHA     '  /  Label for field                                        TUNIT3  = '        '  /  Physical units for field                               TFORM4  = '1D      '  /  Data type for field                                    TTYPE4  = 'TIME    '  /  Label for field                                        TUNIT4  = '        '  /  Physical units for field                               TFORM5  = '1I      '  /  Data type for field                                    TTYPE5  = 'DY      '  /  Label for field                                        TUNIT5  = '        '  /  Physical units for field                               TLMIN1  =                    1                                                  TLMAX1  =                15360                                                  TLMIN2  =                    1                                                  TLMAX2  =                15360                                                  NAXLEN  =                    2  /  Number of QPOE axes                          AXLEN1  =                15360  /  Dim. of qpoe axis 1                          AXLEN2  =                15360  /  Dim. of qpoe axis 2                          TELESCOP= 'ROSAT   '  /  telescope (mission) name                               INSTRUME= 'PSPC    '  /  instrument (detector) name                             RADECSYS= 'FK5     '  /  WCS for this file (e.g. Fk4)                           EQUINOX =           2.000000E3  /  equinox (epoch) for WCS                      CTYPE1  = 'RA---TAN'  /  axis type for dim. 1 (e.g. RA---TAN)                   CTYPE2  = 'DEC--TAN'  /  axis type for dim. 2 (e.g. DEC--TAN)                   CRVAL1  =           8.588000E1  /  sky coord of 1st axis (deg.)                 CRVAL2  =           6.926986E1  /  sky coord of 2nd axis (deg.)                 CDELT1  =         -1.388889E-4  /  x degrees per pixel                          CDELT2  =          1.388889E-4  /  y degrees per pixel                          CRPIX1  =           7.680000E3  /  x pixel of tangent plane direction           CRPIX2  =           7.680000E3  /  y pixel of tangent plane direction           CROTA2  =           0.000000E0  /  rotation angle (degrees)                     MJD-OBS =           4.905444E4  /  MJD of start of obs.                         DATE-OBS= '08/03/93'  /  date of observation start                              TIME-OBS= '10:30:32'  /  time of observation start                              DATE-END= '11/03/93'  /  date of observation end                                TIME-END= '05:02:18'  /  time of observation end                                XS-OBSID= 'US800282P.N1    '  /  observation ID                                 XS-SEQPI= 'ROTS, DR., ARNOLD,H.                                           '  /  XS-SUBIN=                    2  /  subinstrument id                             XS-OBSV =               800282  /  observer id                                  XS-CNTRY= 'USA     '  /  country where data was processed                       XS-FILTR=                    0  /  filter id: 0=none, 1=PSPC boron              XS-MODE =                    1  /  pointing mode: 1=point,2=slew,3=scan         XS-DANG =           0.000000E0  /  detector roll angle (degrees)                XS-MJDRD=                48043  /  integer portion of mjd for SC clock start    XS-MJDRF= 8.797453703700740E-1  /  fractional portion of mjd for SC clock start XS-EVREF=                    0  /  day offset from mjdrday to evenr start times XS-TBASE=  0.000000000000000E0  /  seconds from s/c clock start to obs start    XS-ONTI =  1.476600000000000E4  /  on time (seconds)                            XS-LIVTI=  1.476600000000000E4  /  live time (seconds)                          XS-DTCOR=           1.000000E0  /  dead time correction                         XS-BKDEN=           0.000000E0  /  bkgd density cts/arcmin**2                   XS-MINLT=           0.000000E0  /  min live time factor                         XS-MAXLT=           0.000000E0  /  max live time factor                         XS-XAOPT=           0.000000E0  /  avg. opt. axis x in degrees from tangent planXS-YAOPT=           0.000000E0  /  avg. opt. axis y in degrees from tangent planXS-XAOFF=           0.000000E0  /  avg x aspect offset (degrees)                XS-YAOFF=           0.000000E0  /  avg y aspect offset (degrees)                XS-RAROT=           0.000000E0  /  avg aspect rotation (degrees)                XS-XARMS=           0.000000E0  /  avg x aspect RMS (arcsec)                    XS-YARMS=           0.000000E0  /  avg y aspect RMS (arcsec)                    XS-RARMS=           0.000000E0  /  avg aspect rotation RMS (degrees)            XS-RAPT =           8.588000E1  /  nominal right ascension (degrees)            XS-DECPT=           6.926986E1  /  nominal declination (degrees)                XS-XPT  =                 4096  /  target pointing direction (pixels)           XS-YPT  =                 4096  /  target pointing direction (pixels)           XS-XDET =                 8192  /  x dimen. of detector                         XS-YDET =                 8192  /  y dimen. of detector                         XS-FOV  =                    0  /  field of view (degrees)                      XS-INPXX=          2.595021E-4  /  original degrees per pixel                   XS-INPXY=          2.595021E-4  /  original degrees per pixel                   XS-XDOPT=           4.119000E3  /  detector opt. axis x in detector pixels      XS-YDOPT=           3.929000E3  /  detector opt. axis y in detector pixels      XS-CHANS=                  256  /  pha channels                                 TDISP4  = 'I12     '                                                            HISTORY   modified by pence on Thu Apr 24 15:04:08 EDT 1997                     HISTORY   modified by pence on Thu Apr 24 15:07:24 EDT 1997                     TDISP5  = 'I4      '                                                            HISTORY   modified by pence on Thu Apr 24 16:06:08 EDT 1997                     HISTORY   File modified by user 'pence' with fv  on 97-11-25T14:34:58           HISTORY   File modified by user 'pence' with fv  on 98-01-12T14:03:09           HISTORY   File modified by user 'pence' with fv  on 98-02-06T15:18:24           END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             óµA”ÑU=àq1±&ØA”ÑUAÀ	=#t6A”ÑVo€ö(²RA”ÑX/@¸)P#½FA”ÑX‰@Y[	ƒA”ÑXÕÀê
,~A”ÑY” @ SÁ?A”ÑZ¢ W^A”ÑZÄ€Ó},ŸaA”ÑZï@¨LzA”Ñ[":$÷A”Ñ^àNr€A”Ñ_MÀuëA”Ñ_†@˜'êìnA”Ñ`g@
÷ 	NA”Ñ`§àç$þA”Ñaƒ@ª°*Ÿ	A”Ña¡¢+91í2A”Ña¦À©%	¢A”Ñb tB( A”ÑbD@	Ñ*vhA”ÑbÐ I X,4A”ÑbÛ@O¤®A”Ñc7e$¬.+A”Ñc] 3	OA”ÑdW2+ý©
A”Ñd†€¹*2ÊIA”Ñd¦ C	é )A”Ñd×`ö[#A”Ñf$à™&•^A”Ñf® M
ƒA”ÑgoÀÙ“ÑxA”ÑgÀ å!%ÚA”ÑjS-`hA”ÑkàÄ\×
A”Ñk|À"0ç$SA”Ñl€@
Œ?-aTA”Ñl×@à f)ü
A”Ñm~às1\#âA”Ñm¨`
Á äA”Ñmà`-V%ÍA”Ñnü œ
½¿A”Ñq×`¶5í	A”Ñr{€©Ê“-A”ÑrÆàæ#*)ë
A”ÑrÛ Ps	€A”Ñsg€›'Ú 
A”ÑtìÅyA”Ñu@ PwXA”Ñv`à#cA”Ñyã@3+ËKA”Ñ{/ §!” \/A”Ñ{Q@
u,D
bA”Ñ{`÷
Ä:
A”Ñ{ó@g"Ç'*%A”Ñ|À	ÄM*¨SA”Ñ} 	'2^Q
A”Ñ}s f ›“A”Ñ~0`×"0YA”Ñ~ØÀêŠ
eA”ÑÀë%ÄDIA”Ñ`!v3A”Ñ}ÀT"»-A”Ñ­€½î*¼	A”Ñ€þ X,AN
A”Ñ„¿`ƒ($_A”Ñ„Éà
î¬éOA”Ñ„Ü`ëi:A”Ñ…Ï v*¦-DA”ц´€
 ç0A”цï Ûy	A”чÀš§	A”чL ƒ$¨)oA”ч™À)¢-bA”чæ@
ÝA”шâà(
Z(A”Ñ‹&@+ A”ÑŒý 	¬#±kA”Ñ/91Ö
A”ÑŽh ‚¥¹4A”ÑŽo 'ASA”Ñ޾,/B%vA”Ñ–à	íÙ3œA”Ñji!?åA”Ѥ€ë{+×A”ÑÀf."D:A”Ñê ¼l3A”Ñõ€üP'×	A”Ñ‘®`
Ð1°
A”Ñ’k DÝzA”Ñ”&…=A”Ñ•‹ vy# 
A”Ñ–@
Q3&A”Ñ–ˆÀ	h'À3&0A”Ñ–À
á(A”Ñ™àA/ÑÄA”Ñš€¡ï! ~A”Ñš: 
Öˆ‹A”Ñš¬@èSA”Ñ›& ˜	V2A”Ñžy *Ì&8A”ÑŸ‘@ØÍZA”Ñ v`#
YÁ¡A”Ñ£L€”S×A”Ñ£a@çA”Ѥ€Í1,PA”Ѥn ’/3xwA”ѤÉÍ7 PA”ѥ꠿*E	A”Ѧ« <3ŠëA”ѧ ¸ÊpA”ѧ=`?&ÒA”ѧÝ@zÊ–A”Ѩ\€h0¢¥A”ѨŒ 
õ“#ë?A”Ѩɠ
(U+DA”Ñ©b*:BA”Ñ©Ýà¢$$A”Ñ©à-3DÙA”ѪLÔ*[3'
A”Ѫ¡Ú³}zA”ÑÃl`
$s
ØA”Ñŵà—Ÿ.Å^A”ÑÅØà
§$_'A”ÑÈç mF1A”ÑÊ’€žÿ+ŠA”ÑË`O&¿A”ÑËÖ s
ã7A”ÑËýà×"™A”ÑÍJ@/ P4ˆEA”ÑÍ»`ì
¸
A”ÑÎÀàË+à
A”ÑÎá`×þ'È
A”ÑÏú€
Û/Ù
A”ÑЛÀÐÍA”ÑÑh ð#
A”ÑÒàß+Ì"SEA”ÑÒ ©©A”ÑÒ« ø/Ž 35A”ÑÒÂÀ•	¾)7ÛA”ÑÓïà	áÐ4¦A”ÑÔ4 ®ln	A”ÑÔ:@2%åõ
A”ÑÔZ 
?aÄFA”ÑÔi€”.]´FA”ÑÕ*€

 JA”ÑÕn`äÚ-§
A”ÑÖ`æ+ŠXA”ÑÖU`¥v A”ÑÖìW ŠA”Ñ×,à4`!A”Ñ©@"ÝdA”Ñ« C(ØjA”ѰÀ%,·&¨A”Ñæ€	>¤%L
Aӄo@
¿¥AA”ÑÀ"!!®#A”Ѳ
3$À
A”Ñý`H/™&XA”Ñ 	h(-3ŠA”Ñ- ¢-øA”Ñ[À“,˜A”Ñc`+%$A”ÑúÀÇ4ïSA”Ñ-zâ3â
A”ÑË 0(Õ%A”ÑÛÀ
J	]{A”Ñ €y!7ÂA”Ñ‘ \'È
A”ÑÌ`	}&ø&|A”Ñù 	¥&,Ô	A”Ñ	ë`eç9A”Ñ
—`d%x.A”Ñà"±*WA”Ñp€Õˆ}A”Ñ5`õâ(ÛA”ÑO€È+ÌŠ9A”ÑXÀ|"rAA”Ñy€Å\'«„A”Ñ7@	ÿÁ%
Aӄ
€^
™
8A”Ñe ‚)0ñA”Ѽ ÷31«A”ѯWA”Ñ‚ 
ó"
ØA”Ѱ€¤
RÕA”Ñ€<°s-A”ÑÃ`A °cA”Ñ`L2‹ªA”Ñ@
,º'B@A”Ñ?à,	ðA”ÑÄ`uþ(-A”Ñ×@
…;A”ÑûIãwA”ÑC !% A”Ñmq%§,d+A”Ñq –÷
A”Ñè ,1{—
A”ÑÕ`xv-tA”Ñk@k'£*ÒA”Ñ4`Pc-sA”Ñ ò m!IŸSA”Ñ!¼àh!ü`
A”Ñ!í`÷CÖA”Ñ!òÂ$ÖÔA”Ñ"Š¢%,
+A”Ñ#PÀkó;1A”Ñ$.€æ"¼6A”Ñ$•àl!H
A”Ñ&- g%àA”Ñ'ý@
‡4`PA”Ñ(Z@Ú_¨A”Ñ(È )-(”%A”Ñ)P€	¶	…A”Ñ)w,)œ¶A”Ñ)ì`
ª>ŒA”Ñ*A ©±¦A”Ñ,*@f€°
A”Ñ-I#ê{]A”Ñ-í@_t÷
A”Ñ.Ö yçn;A”Ñ/O Šb6œ	A”Ñ/‹ ….'A”Ñ/öü4²vA”Ñ4S`†·/A”Ñ5€ú%;A”Ñ5à
Ôû¾4A”Ñ5./«ëA”Ñ5¹ ¤%{­A”Ñ6ˆ`¹!A”Ñ6ï`
R×3ÏA”Ñ7_ÿ0r
A”Ñ7µàûr!mA”Ñ8@
Ü>iA”Ñ9ƒ`Û/ŒÞWA”Ñ:f W·fA”Ñ;" y Ç"A”Ñ;:€ñé
‹
A”Ñ;S ³.b!Ð"A”Ñ;c`Æþ )eA”Ñ>@
ç)î"t{A”Ñ>à°íÑ-A”Ñ?=`ù	N&D5A”Ñ?g xb§0A”Ñ?å @Eï	A”Ñ?ùÀ¿Ü PA”Ñ@'à‰Ç$üTA”Ñ@V Ù.þVOA”Ñ@à Ë¢•
A”Ñ@ú`ˆ×ÓA”ÑAW`s!È·A”ÑBÖ e,£s*A”ÑCX wæ1Ù
A”ÑCi€ñ$ùZ$A”ÑC— D
_(UA”ÑDî€
QJëA”ÑE& —wA”ÑFÙ(%Ü'A”ÑF÷ b
1)Õ2A”ÑG
à	^
^nA”ÑG;à¹-+§A”ÑHÀ¢ÎÎA”ÑJ€àóþ–GA”ÑJ› ®#$ÑA”ÑJ±@h1"%œ
A”ÑJú@	¡0"sA”ÑMo 
€3à›A”ÑNq ÏÜA”ÑOø’/ñjA”ÑPc D#;(e
A”ÑQ@ïâ-¡A”ÑQ¨à\4d
A”ÑQþ |eA”ÑR)`G
èA”ÑR- “8,dA”ÑR3$x­3A”ÑTÉàŽ&¸&A”ÑV‚ 
*È
BAA”ÑWdÀù£× A”ÑW@óù3ëjA”ÑY8àÇ1m ¼A”ÑYóÀ?!ÃÎ
A”Ñ\÷ (4Ì	A”Ñ]Π³FPTA”Ñ^+Àû4È	A”Ñ^é@)1¹* 	A”Ñ_“`ú)*¥>A”Ñ`¾àF.ö{OA”Ñ`àëæ#¬JA”ÑaŽ*˜7A”Ñb÷*4^ƒA”Ñb,`š,ã4A”Ñb¯@W´A”Ñeà¢Z'Ý&A”Ñeà
–ªf§A”Ñe1À}!ø'jA”Ñe¸€	“
”
A”Ñeá ™1Ö+ˆA”ÑfAà'~A”ÑfI÷!w	A”ÑfrÌ“õA”Ñgˆ†(mA”Ñh@	u	-¯EA”ÑhD¡.‚©6A”ÑiÀ
	ÂØA”Ñjj€À~ÜA”Ñjí #lÁPA”Ñjô³(›"jHA”Ñk â*~JA”ÑkáÀ‚!ù1`A”Ñkè@Jð#\8A”Ñlà
\Ü1A”ÑlH@.ë%A”ÑnÜ€y/’/
A”Ño@Á%C#²A”Ño3`eA$»rA”ÑpSXöA”Ñq€0÷ænA”Ñq5À)I	’A”Ñq“@Ä2A”Ñr2Àü6:A”Ñr·à[Äâ™A”ÑtÀ’%û+VA”Ñt¡N3žA”Ñtì ©
A”Ñu’@ýG Š
A”Ñu•€í'–!ô{A”Ñvg 7A”Ñv€-!Ë7A”Ñv­ —í%tA”Ñx뀫'å4 A”Ñy“@ˆ¥1-A”Ñzl`&) ¦A”Ñz­
t#¿A”ÑzÇ Ç(Ÿ3A”ÑzàÀm"Ô*A”Ñ{>À&BA”Ñ{lÀê6‚	A”Ñ}ïÀ(„"iA”Ñ~àÿ%€_	A”Ñ~@Û)i%QA”Ñ~æ 
Yª4pA”Ñ~þ :&ûA”Ñ€‘@!:÷	A”Ñ€˜à¹Á)‹A”Ñà	ù1ý!A”ÑL?Þ3A”Ñ €™
.	A”Ñ‚BàÖA”Ñ‚Àý$Ÿ1f7A”Ñ‚á`2'“ùA”уI€UØ>A”у €$ž!A”Ñ…{À
üÁLA”Ñ…” ÛA4JLA”Ñ…ä ¾sA”цNàdK?A”ц»€Ð
ë,|LA”ш5ÀA2ú(†A”ÑŒá&.!ç,A”ÑŒîà1gA”Ñ*@¨!’6–A”ÑŽU ¢
<A”ÑŽàÈ 3A”ÑQ ¡--f
A”Ñ‹ ä&˜E
A”Ñ£àI2V(ÈA”Ѩ2±%ÛA”Ñ‘µ€	™$C5Ê
A”Ñ’ÿ ìÎìA”Ñ“D M-!WA”Ñ”‰ 
Š6~ A”Ñ”ýy¤	A”Ñ–Iì!=9A”Ñ–‹ 1¬ÓA”Ñ–½ 
ò©
m
A”Ñ™a€
+ðA”Ñ™÷ à |mA”Ñš~`
÷'¦³A”Ñšé€<HjA”Ñœo Ì 4ÓA”щ€±ÍA”Ñšà(×!© A”ÑÝ 
Ú&2"vA”Ñž¿ !)˜$ýA”Ñžå 
™-ˆA”ÑžúàTÔ
A”ÑŸC ´°A”Ñ¢Y€ÏA”Ñ¢mÀÆËA”Ñ¢™€dY.òA”Ñ£
 }]A”Ñ£
à5ÓtA”Ñ£¬@¨A”Ѥ–@ï,˜ìA”Ñ¥ A-¦&f	A”Ñ¥£à	£'œ0ž	A”Ñ¥Ë@ˆYA”ѦʀtÖ#¹A”Ѧí 
Tò!A”ѧ¢
†4!	A”ѧ½ «1ì!Y	A”Ѩ$àL#¬A”ѨC
s'y#UA”Ѩ{@Ÿ,
NA”Ñ©|`±s
Ñ
A”Ñ©àÛ´&×A”Ѫà
÷ Ä6A”Ñ«ààSR":A”Ѭ 
+#Ó3A”Ѭ¬€my·A”Ñ¬Ü )åõA”Ѭú 6v"‘%A”Ñ­ 
4"Â#2A”Ñ®€÷çüA”Ñ®tÀÁ}("ŠA”Ñ®àÀ	°A”ѱdŽbB
A”Ѳ„ <.IÃSA”ѲÜlî|A”Ñ´°À£í)A”Ñ´ú jÌn
A”ѵ6@m.™A”ѵj §
÷
A”ѵØ`BØA”ѵí`|¤hA”Ѷ#à“Úa&A”ѹ Œ‹ÁA”ѹ !÷5ÄA”ѹ£à&'–3QA”Ѻò %.xÍ
A”Ѽ‰`{(ú¢VA”ѽpà5š%˜A”ѽè`	®	“{ A”ѽö ’ª%y-A”ѾO¯)ŽbA”ѾS€0*f'
PA”ÑÀ:€	‰,6VA”ÑÃDÀÉ@(A”ÑßÀ&œA”ÑÅÓ`!2æ!r	A”ÑÆ'`-^/5A”ÑÇkÀ
''-A”ÑÈ	 
Ôs	íA”ÑÉ â_$K[A”ÑÉž“	ŽÂA”ÑÉ·`ë%5 A”ÑÉÍ`
‰B5ßA”ÑÊ3€ò“!A”ÑÊe 
¦4û-A”ÑÊàŒŒA”ÑËÀ
œ%LA”ÑϧB†MA”ÑÐ`Ø&˜õA”ÑÐ]€©k)A”ÑÑÖ€Y, A”ÑÓiÀ
9-åA”ÑÓûà1—9A”ÑÕ Î;)»A”ÑÕÜ@	‹x A”ÑÖ¸àí ÿ	A”ÑÖð`6´!A”Ñ×T :©A”Ñ×\ 7t(A”ÑØXÀȬ!´	A”ÑØ•`’é–A”ÑØï€$
1)VA”ÑÙ`
&bpA”ÑÙÿ@z0z+A”ÑÚ\à##èA”ÑÜS@«",6HŸA”ÑÜ~€ð#;.#A”ÑÜÚ 73¦m%A”ÑÝž`Tj$©A”ÑÝÊ@@) 
A”ÑÞX€
e˜ |
A”ÑÞƒà
¾ÇA”ÑÞ¨à€`4!-A”ÑÞÌ`! ûàoA”Ñ߀ëp.A”Ñß @mú#˜A”Ñái@
X"§*A”Ñ㈠¤!9!OA”Ñå9 
J-~1FA”Ñåg`ü»
D.A”Ñåà®u1jA”ÑåìÀ?)’!–'A”Ñæ€ŽÒñ
A”ÑæKà‘†Ñ	A”Ñæ™à*(ó&¦A”Ñç¶`	å™6ã%A”ÑêJ F!Ê$¿
A”Ñì€P3¤ºA”ÑíJ€åA”Ñî( Q5*2A”ÑîŽA]A”Ñ𢠌ü6A”ÑñÀ@0
‰,÷A”ÑñÏ€<4î‡A”ÑôÝ€
ž¡A”Ñôà (­%oA”Ñ÷i€u!E5ò+A”Ñ÷p`3L	Õ	A”Ñø5@Ú!A”Ñø|@
ã™-­A”Ñù`T^A”ÑùßL.[)A	A”ÑûWÀ<  *
A”Ñü§ —[ÕA”ÑüÀàÞ'Ë
Ê
A”Ñþ;àѧ!5A”ÑþýÀ
ò¯5e:A”ÑÿI`–Ä‡A”Ñ #@¬#V+uA”Ñ ­@­¼*A”Ñ Ï "ÄPA”Ñ ê Ó!	=A”Ñ è ’""VRA”Ñ 4@
S
–#¶A”Ñ 	â€
.¬þ6A”Ñ 
s€œ§îIA”Ñ Š %7|=A”Ñ Ÿ C/

A”Ñ ¼`ô.8€
A”Ñ Ú 
caA”Ñ âàÆ,.A”Ñ 
ÓàuM&¢A”Ñ 
ý &	û*8A”Ñ € 	ºç
A”Ñ  €àXA”Ñ ¬à§&¿DA”Ñ ®à | A”Ñ Là–½A”Ñ Mà[(®"5A”Ñ ÛàS õA”Ñ ® ´,¯CA”Ñ ¬ ¬
"Ï~A”Ñ ³
î3úB5A”Ñ ´`¹îÇDA”Ñ Å€¡U!¾
A”Ñ   §0é.éA”Ñ 3@s!A”Ñ `@
¢#ô&A”Ñ ÂkSè
A”Ñ è ?QÆA”Ñ ñà
‡1òA”Ñ  >0ŸŸ	A”Ñ hà˜©$[A”Ñ Æ`ܸ'(A”Ñ C5ËA”Ñ U Ç)È
[A”Ñ ¾ù,$ýA”Ñ ú!ÚA”Ñ O€¤(2¡A”Ñ !­“«A”Ñ #Àu("A”Ñ #`
”]A”Ñ %Ý`¡Ä5Ÿ	A”Ñ &ÞÀ æíA”Ñ 't€=!ýÏA”Ñ ' ¦‡A”Ñ (€	*©eAA”Ñ (:`¹(E  A”Ñ (‚`
7*«A”Ñ (§àÞ'»UA”Ñ )
+!EA”Ñ +€ 
¥ávjA”Ñ +±j#}$A”Ñ +À op6A”Ñ +Ð § ø6¾
A”Ñ ,*`Ü',@A”Ñ ,Å@Q$1ÓA”Ñ -`?'a1KA”Ñ -Y h1ò±A”Ñ .b`”AÎ~A”Ñ .`Ñ!å
=A”Ñ .Ÿ ï‰A”Ñ /# þÄ	A”Ñ /Ë*£ú'A”Ñ 0Ä ƒ%’A”Ñ 1;€MÊ‚KA”Ñ 2:@>']ÎA”Ñ 3SÀ	%&VA”Ñ 3Œ@
Ã? NA”Ñ 3”à~ª:A”Ñ 4¡@ª%Ž(uFA”Ñ 4¹ 	:—+A”Ñ 4àÀœ ÔYA”Ñ 8Àz6C6A”Ñ 8}X@&
A”Ñ :îÀ
Þ]¼AA”Ñ <á`Ç0h,oA”Ñ >? ˆö ¾A”Ñ ? r.–A”Ñ A7 ó+uGA”Ñ AÆ Z$ª&w
Aӄ BG 
_9
©PA”Ñ C€Óv@A”Ñ Cµ@åa„A”Ñ D„€¢&¿úA”Ñ E1ú™#Š>A”Ñ H* 
¹
#A”Ñ HeÀ³»øA”Ñ J{À¢ŸxA”Ñ JÔ@*%jZA”Ñ K­`§%¡-^*A”Ñ MÎ`«W4æÜA”Ñ Mã É][A”Ñ N`j­¢A”Ñ N? 5¿ãA”Ñ NX@|
Ã*£A”Ñ P`	rŒ&È`A”Ñ Q˜ .Z¨JA”Ñ R™=
R7A”Ñ S@¥\.÷A”Ñ S¯`e$?SA”Ñ TÛ Äì6W>A”Ñ TçÀÕKÎ
A”Ñ TéÀLÑA”Ñ U2 ç»_A”Ñ V¾ 2 [.{SA”Ñ Wàbó qA”Ñ X Ì£EA”Ñ X  ÷ú/TA”Ñ Y€½ A”Ñ Z
`gù,ŒA”Ñ Z—€SZ ÞA”Ñ \c€À6JA”Ñ ]`ÔH}A”Ñ ]€˜	ÕäA”Ñ _%`Ä%
A”Ñ _–@`?EA”Ñ `FÀ0)f	A”Ñ `³²Ü(A”Ñ b,@¶2¢$m*A”Ñ cŸ
¾0¢«A”Ñ da ü
Z1A”Ñ eSà?
‰!A”Ñ e» 
K°A”Ñ e ?-ž±0A”Ñ eîð$CpA”Ñ g4ÀÞ$¤ùA”Ñ gˆà
æ+ÆA”Ñ h p:­A”Ñ h¢€'/ô!¯A”Ñ iÀ]ç5¶)A”Ñ iÀ4
›öA”Ñ jJ o"j4òA”Ñ kÓ Þ!zA”Ñ kØq]KÞA”Ñ l  Ë#ƒ0NA”Ñ mÌÀH)PY
A”Ñ n€·*£¤A”Ñ pÒ`I‹-ZJA”Ñ qØ@–&I/A”Ñ r+@s!o2õ(A”Ñ rÀ,5A”Ñ uÀà
ü	‚&„.A”Ñ uß õ' 	A”Ñ v8€ÇƒuÎA”Ñ v· ‚f¶
A”Ñ vÙî“"ŠdA”Ñ w˜à
h+™e°A”Ñ w¸ù  $?A”Ñ yÍÀë¢(éA”Ñ {
€
¾3f?A”Ñ {à 
„$Õ
A”Ñ |Ÿ€6Ä©A”Ñ €“`a&Ð'*A”Ñ >@
(J a*A”Ñ ‚.`
‹-¦)wA”Ñ ƒ`i
Î*ÅA”Ñ ƒ>€	|%$³A”Ñ „H 
2I#òA”Ñ „Œà—ð
™A”Ñ †k€‘!T4­A”Ñ ‡l@"óA”Ñ ˆàA”Ñ ‰íÙ
HA”Ñ Š- Y3KA”Ñ ŠI *(|.`"A”Ñ ‹äàΦA”Ñ ŒTO
g(CA”Ñ ŒÖ ÿ.`A”Ñ ¯àè"É4-A”Ñ Ž†@U£ÚA”Ñ Žú@¤¾ñ®A”Ñ !À%ó‘A”Ñ ‘Z`ì0q	,A”Ñ ‘ëàà_8A”Ñ ’*`H2™+­
A”Ñ ”ÍàþÏ(áSA”Ñ •÷ 	ê'f$¸A”Ñ –vàR"îA”Ñ –à
&V6iA”Ñ –÷àv-×A”Ñ —Ò j	¿A”Ñ ™`Ì+)5A”Ñ ™à
H"´	+A”Ñ œ`I>#ŸA”Ñ œ0 ]"þsA”Ñ œæ |"$A”Ñ `öJA”Ñ ;`›+
“A”Ñ A 0/¥
A”Ñ Ÿl€F%£*ÅvA”Ñ ¡* 7ÓáA”Ñ ¡Ä@¦r/v
A”Ñ £¥àþGA”Ñ £Î §!½OA”Ñ ¥±à½&—4â A”Ñ ¥Ó Ês"Y1A”Ñ ¥í@

#Ë
A”Ñ ¦Àµ!Oe
A”Ñ ¦m
@
QA”Ñ ¦è ¿'@+gA”Ñ §àÍ+þ&—Ê*DA”Ñ ©º 	úàA”Ñ ©È@}2Iœ	A”Ñ ©ðàe€"A”Ñ ªÀ
ž-ÚÝA”Ñ ª—à’!àˆA”Ñ ¬Öàî9-	A”Ñ ¬í€ç5d#A”Ñ ®€­('.˜A”Ñ ¯Z ï%ÁA”Ñ ¯jÀt"¢ _A”Ñ ¯Ñ
ó5PA”Ñ ¯ú@
}ŽE
A”Ñ °§ÀTh„A”Ñ ±X@
Ð!'A”Ñ ²=À±)Ñ!#)A”Ñ ³và
&&‚(%A”Ñ ´ 	›ÿ0%7A”Ñ ´U€RÂ
•!A”Ñ ´{f!TA”Ñ ´Œ 
®&¶ê0A”Ñ ´•€<ò/A”Ñ ¶`àÎ`3A”Ñ ¶kà0Œ$D A”Ñ ¶s
,Š2x	A”Ñ ¸ûÀÈ‹¢FA”Ñ ¹%à®f	/A”Ñ ¹+€'ƒA”Ñ ¹êÀFr(ï	A”Ñ º÷à
ú&yµA”Ñ ¼€ã6ššFA”Ñ ¼Làß*›
A”Ñ ½?àY¿
ÝRA”Ñ ½ºÀÃ0‰A”Ñ ½ý µõ#hA”Ñ ¾nà
 bA”Ñ ¾¶`N0ú";A”Ñ ¿øà2%5E$A”Ñ ÂéàÒ5A”Ñ ÂïÀ„1µ)šA”Ñ ÃQÀ= ¸
?CA”Ñ ÃÂ`G.‚!ŸvA”Ñ Å† « ×!Z4A”Ñ Åº@
’,A$A”Ñ ÆPÀ`†%%
A”Ñ ÆW@Y¨"A”Ñ Æéà
IP=A”Ñ Èp ¢ oó9A”Ñ Êq U/MøA”Ñ Ë©`,'%A”Ñ ËÑ@‹lÃA”Ñ Ì@#-¸,.
A”Ñ Ì„`"t	ç{A”Ñ ÌÌ€ù-v9A”Ñ ÎÒ D*p:A”Ñ ÏÈ/¦9A”Ñ Ð@` ˜!ÍA”Ñ ÐF€
Î1¦(ÙA”Ñ Ðþ@ªDA”Ñ Óq N!fXA”Ñ ÓŠ@`"r÷A”Ñ Óª N&u*lA”Ñ Ô³ u,)U	A”Ñ ÕÃ`	Ž#=hA”Ñ ×'àl)A”Ñ ×ë€ó4õA”Ñ Ù¹@£ô*¡A”Ñ Ú€Ó$hA”Ñ Û€ò/êë
A”Ñ ÜÉ C™]A”Ñ Üò`!;¨A”Ñ Ý(@#.*ÁtA”Ñ Ý¸€ß2"A”Ñ Þ@Iö
A”Ñ Þt`ð Ž-A”Ñ Þžj2…"
A”Ñ Þ¯ :	È5A”Ñ ß4ÖÍA”Ñ àV 1!Ô!
A”Ñ à†à
ºO
§@A”Ñ á±àæ'	'A”Ñ á² 3: âA”Ñ â`Ù4û+l
A”Ñ ä~%0J ËA”Ñ æ?À
©"‚`A”Ñ ç­À
°)È¢A”Ñ çÁ•0!A”Ñ èç _nôÕA”Ñ ê5ê!£	A”Ñ ê4P–!WA”Ñ êKÀ§ O8A”Ñ ë5 Ãá
A”Ñ ì³@Ú#'HA”Ñ ìµ€w
1‹
A”Ñ ìí*ë	vA”Ñ ín Í$o4A”Ñ î­ t3?A”Ñ îâ`rŒgA”Ñ ïG‰ê(¡A”Ñ ïOÀ
6³A”Ñ ñ;À4->?A”Ñ ñ@àyð02QA”Ñ ñ‹à¡æ(¬A”Ñ ñ`	êÐ(=
A”Ñ óä@
ï	'yA”Ñ óø ¸6Ã#A”Ñ õL ê#†ÄA”Ñ õ’À
ðÉ,¾1A”Ñ ÷Œ ï$A”Ñ øà
)â-A”Ñ ù5 
91/ÜA”Ñ ú`ò1à$¥@A”Ñ ú}€
ù)?/ñA”Ñ û p&—*ÌA”Ñ û] S(þXA”Ñ û¨às]ÙCA”Ñ üH`!(Ô%ÿA”Ñ üÚ€
Â:1¢A”Ñ ý[ ß"è£)A”Ñ ýs€Ø*ú5¯A”Ñ þ@JH1TA”Ñ þy@%A6}KA”Ñ þÔàõ(…A”Ñ þÖ@͇ݧA”Ñ ÿ¯@v	3~
A”Ñ ÿü ‘T1/A”Ñ!c â*îA”Ñ!¨ Ã~
A”Ñ!Ê 5Æ65A”Ñ!jàôT19
A”Ñ!Í`þ•/i=A”Ñ!
@séŠ1A”Ñ!F 0t*A”Ñ!ä`	$\
A”Ñ!	Tа'A”Ñ!	à/(ç)A”Ñ!mÀßðA”Ñ!ñ@·%€Ú=A”Ñ!þà	4ï ¨A”Ñ! ùɶA”Ñ!™ÀŸé(ê;A”Ñ!@
)	ŠA”Ñ!Àó ŽÄ
A”Ñ!ý?‹ÌA”Ñ! ¶%Ç,ê
A”Ñ!Y@L,‹~A”Ñ!7ÀÕ(×_A”Ñ!-€:+ÁA”Ñ!> ™$A”Ñ!V ‹0×DA”Ñ!î€
ËöÕA”Ñ!
@Y
E
Ö
A”Ñ!NÀÍF!	A”Ñ!Å€¶ô5(A”Ñ!-@&)A”Ñ!6@	^*4æA”Ñ!UàÒU!œ
A”Ñ!m¾-§ó	A”Ñ!mà
Ç4ŠåA”Ñ!кúIA”Ñ! Š`Û6žN%A”Ñ!!àó+è3–A”Ñ!!R`mG)\A”Ñ!"SàIr2vA”Ñ!"Ç€Æc ×A”Ñ!"È`¨5:	A”Ñ!#3 }¥lA”Ñ!'	€.½8A”Ñ!'- jˆ‰NA”Ñ!'½À·58A”Ñ!(c Y
#$A”Ñ!)= 
è%¢&ñA”Ñ!)F€
…0‘
SA”Ñ!*, .Ód
A”Ñ!-+~+¢A”Ñ!-¦|"
A”Ñ!-á`¡-o)	A”Ñ!.Šàóß.A”Ñ!.®€€)¦/«	A”Ñ!/Àª0ñ#ýA”Ñ!0zÑ"A”Ñ!1.@!1–
A”Ñ!1=À×s*A”Ñ!1øà½"†?RA”Ñ!2<V›A”Ñ!2Ë T#~A”Ñ!3 
€.Ó%A”Ñ!3¶ òÁ3ÐA”Ñ!4N@ô	)A”Ñ!4l1ñ%-
A”Ñ!4Ðà
Ì$$!cA”Ñ!4ñ 
”ÐÉA”Ñ!5‘`E¹.%QA”Ñ!5×€¥s2&GA”Ñ!6\Àù (kA”Ñ!6Ž
l],A”Ñ!6±@Á)(
A”Ñ!7R–8F
A”Ñ!8@ýÞ7&	A”Ñ!8m€Ú&ù6A”Ñ!8³`*Ê$àA”Ñ!8Ê 1zA”Ñ!9ÿ@à!ç,kA”Ñ!:u@Ø/F33A”Ñ!:—~2.4A”Ñ!:á 'Ú0Ú
A”Ñ!;$@# Z‰A”Ñ!< )ŠÁgA”Ñ!<þàÁ&d7]A”Ñ!=e Æ.jV	A”Ñ!=ˆ
*5A”Ñ!=ûá#"L	A”Ñ!?…€
-¸"–
A”Ñ!@M€
5¯àA”Ñ!@Áàö-Î
A”Ñ!@Ò å0ÚA”Ñ!AGà));îA”Ñ!D ]!J	¼A”Ñ!DŸ€\ÑüA”Ñ!DÙ`Ô/!@A”Ñ!F` V"2A”Ñ!FÂàF#+#0OA”Ñ!G(¶ Z\A”Ñ!GE`K((RA”Ñ!HEâA”Ñ!H’ ã.‚7	A”Ñ!I /H¨RA”Ñ!J
@4E1¸A”Ñ!J9À]	á,/A”Ñ!L d$,QA”Ñ!LSàQ!7òA”Ñ!Ld€ò%b!A”Ñ!L} 
¶qÚTA”Ñ!M@.*µ•…A”Ñ!M¿ J%(-wA”Ñ!Nfà%õ
A”Ñ!N›K1ÂãA”Ñ!Ov½R1VA”Ñ!Q Ì!‰2A”Ñ!Qh ì#I'£
A”Ñ!Sz€
[:	µA”Ñ!V# L3Ë úA”Ñ!V þ,
:A”Ñ!WzÀ1!(…A”Ñ!W©	 )¯5A”Ñ!WÏ@¢7ê ‘A”Ñ!W÷€ü­ MA”Ñ!X4€Ú3“µA”Ñ!YÀ¿)û#!'A”Ñ!Z€e4--ç
A”Ñ!Zu`!Ÿ
°A”Ñ![FœA”Ñ![À2£âA”Ñ!\)àïÍ-õ	A”Ñ!]a P0erA”Ñ!]r î(A”Ñ!^aÀ,W,dA”Ñ!^q@X"	A”Ñ!^¨`à'@A”Ñ!a.€
ã&2»A”Ñ!a8@ÑOfaA”Ñ!a³@‹
˜zA”Ñ!aú r]Ó	A”Ñ!c8Àh5ñˆA”Ñ!cOÀÜ- zA”Ñ!cd€‰-ÁA”Ñ!d ÏŒ$ÁA”Ñ!dÆ
•'²5ÂA”Ñ!e¤¡4Á%ŸA”Ñ!f!À
%Ñ+•sA”Ñ!fÔ@'
`#|	Aӄ!g|`
Ñè*˜A”Ñ!gªÀf) $;A”Ñ!gÉ Û%ÞM®A”Ñ!güÀ5Þ-/A”Ñ!h¡ zØPA”Ñ!háàv6à]A”Ñ!ià6ö6A”Ñ!iE œ!EŽA”Ñ!j
àš-„‘A”Ñ!j7 Rˆ1ô"A”Ñ!j:€(‘)‡
A”Ñ!ji@	!Z,?A”Ñ!jÀ
! !A”Ñ!krà„Çð	A”Ñ!k÷[V=A”Ñ!mµ-‚FA”Ñ!m@à“
Ÿ
A”Ñ!mgàï!EŠA”Ñ!m €Z‡A”Ñ!o`Àº„øBA”Ñ!o†#3Ž DA”Ñ!o´`
mLõA”Ñ!rbÀØð,«A”Ñ!r@)ÍPA”Ñ!rî %6A”Ñ!s B±3A”Ñ!sT€S!ã!/3A”Ñ!s‘ 
í6ù£A”Ñ!tŠ 
•	h$ÂA”Ñ!uâ`
b='&(A”Ñ!vî@gS,%
A”Ñ!w€h#c/ÞA”Ñ!y`	ÉA”Ñ!y=€'%a8
A”Ñ!yØ`Š(çA”Ñ!z,€djú#A”Ñ!zr Ï
)43A”Ñ!{.à
Ì·
aAӄ!~
 õLKA”Ñ!~— þ0\ã
A”Ñ! ^µ	A”Ñ!1`«,çA”Ñ!n@yP
ÉA”Ñ!Èy5-'A”Ñ!€“À—2êNA”Ñ!
 
º*A%ÖBA”Ñ!#l1û
A”Ñ!3ÀA7¿$ô6A”Ñ!A 
»1SA”Ñ!Ð@•  FA”Ñ!‚‡“
ãA”Ñ!„UÀÁ+,€A”Ñ!„Á´#XA”Ñ!†C`
§	(MA”Ñ!†œ€
Ô«"¥A”Ñ!†ê±xíA”Ñ!ˆJÀ{ï3]A”Ñ!ˆ› »ØC0A”Ñ!ˆ«€70¶^A”Ñ!ˆÓ_$Ó¦A”Ñ!‰1@½.hÜ A”Ñ!ŠJ #7
ŠA”Ñ!ŠkÀôsÓ`A”Ñ!Š… 3.R%}A”Ñ!Šþ
þ*@(A”Ñ!‹y`@2Î"Ö	A”Ñ!‹¯@(#ï8]	A”Ñ!ŒzÀ…0Ô13A”Ñ!ŒÚàŸ(ª1íA”Ñ!
 °XS
A”Ñ!x@„mìA”Ñ!“ v" A”Ñ!Ž:Àk'sÖA”Ñ!Ža€ü/¶bCA”Ñ!%À8^A”Ñ!@!"ÝA”Ñ!‘ àØ3-¦A”Ñ!“S@K
A”Ñ!”–@ò,½á]A”Ñ!”˜`®3A”Ñ!”€ð†!öA”Ñ!–#
ÒJ7“A”Ñ!—›@G#µ/,A”Ñ!—è 6!wA”Ñ!—ò€µM7A”Ñ!˜8àuf*-A”Ñ!˜Ü@	á’4¹ÇA”Ñ!™ œ9"5A”Ñ!™Ëb-L#¼A”Ñ!™ïT
»	A”Ñ!šV@¶"qA”Ñ!šz@Ã0‹F
A”Ñ!šîà‰¬xA”Ñ!µe Œ&66ÏA”Ñ!¶ŠQ"íO2A”Ñ!¶‹ D*B!²A”Ñ!¶È 
UÐA”Ñ!¶Ï`lðBA”Ñ!·Àÿ@A”Ñ!·x€¶A”Ñ!·™à
Ÿ&×IA”Ñ!·þÀ/( $A”Ñ!¸XÐ
˜
A”Ñ!¹ W,Ô,9A”Ñ!º Ì÷*ÃFA”Ñ!º‡`
#%0fA”Ñ!º¶@ÍÇ­A”Ñ!¼?ÀF2*yA”Ñ!¼ÿ€Z
$"ÉA”Ñ!½@@b£…A”Ñ!ÀjÍÃA”Ñ!À¶ ÃÍ£lA”Ñ!ÚÀ'¹­A”Ñ!Ä?`ÿjA”Ñ!Äd Î"ÚlA”Ñ!Ä÷ 
ü/sA”Ñ!Å`«6+ &(A”Ñ!ÆVÀ
ˆ1ï-H¼A”Ñ!Ç> Ç!sA”Ñ!È+àõ~»)]-A”Ñ!Ü_ 
R-¦,žA”Ñ!Ü›€g IöA”Ñ!Üà G8A”Ñ!Ý ?#CJA”Ñ!Ý^@Ú+2A”Ñ!ÞÞ@X AA”Ñ!áµ ‚à¥A”Ñ!áÁà>1
A”Ñ!â>@4¼y ÛÞ	A”Ñ!ëP ¸%.THA”Ñ!ì#àø-qA”Ñ!ì© ‹+
qZA”Ñ!ì¬àb2çùA”Ñ!ìÚàÛ+/.¡1A”Ñ!î]@€µ"áA”Ñ!îÏÀ4«$íA”Ñ!îØ€$&¢ÝA”Ñ!ïY h½8ÑA”Ñ!ñs`Æ%³	ÓA”Ñ!ñéÀgÞ
Ï9A”Ñ!òO@Ц,A”Ñ!ò’`¯?*iA”Ñ!òž	À,X+	A”Ñ!óA@Q+¨ã
A”Ñ!óΠû*p¢
A”Ñ!óï »"	%o|A”Ñ!ô ês,çA”Ñ!ö“`	%,	A”Ñ!ùt@EÉ5A”Ñ!ú×€Q©,@A”Ñ!û
à	& ë8áÇA”Ñ!û†`£
o7A”Ñ!û‹À½6aBA”Ñ!û˜€Î
*q
A”Ñ!üé 	nÚª
A”Ñ!ý<@ü2ØA”Ñ!ý¦@­0¹ ˜¤A”Ñ!ýæ@
²+`!˜A”Ñ!ÿÕ 
vÃ$ùA”Ñ"i 
”	±åA”Ñ"€7.è	A”Ñ"Ÿ'«!=-A”Ñ"W
Û
/‚A”Ñ"Šà¼êjA”Ñ"À€u4bA”Ñ"ZàÔ& ¥2A”Ñ"¨€F'ñA”Ñ"
Ô®*¨NA”Ñ"	/`	[
VA”Ñ"	 (ê/‰	A”Ñ"
C@1
Ð'(A”Ñ"
8 _:"ŽA”Ñ"
w@ˆ-™(~A”Ñ"
È 	°ƒ,º
A”Ñ" b1ì”+A”Ñ"M…&¹*A”Ñ"+ ã.Ÿ(cA”Ñ"Ô	±6¹$õkA”Ñ"|8.‡A”Ñ"¦`Ç.ç&
A”Ñ"Û€tô
GNA”Ñ"Ä q!µYA”Ñ"@&$F7¾
A”Ñ"ï »RA”Ñ"tÀ
*wA”Ñ"ð@Ó/f(vA”Ñ"h 	ŸLA”Ñ"¯Àç3›A”Ñ"À%f(þ&A”Ñ"& 	æ!‹çA”Ñ"j |˜1åA”Ñ"{`´¤‰A”Ñ"‡@ݵ(c
Aӄ"@	%8
ÆA”Ñ"§f ©kA”Ñ" ?  8A”Ñ"ÝÀéö6ìA”Ñ" Wñ}A”Ñ"˜àv.50A”Ñ") )YÀ
A”Ñ"Ç`(\ A”Ñ"Ê Ì'áA”Ñ" é€{)i&hA”Ñ"#*€ÔwMA”Ñ"$= ;5ù^A”Ñ"$ O<k	A”Ñ"$¦àà& 
A”Ñ"%4$K93A”Ñ"%æ`ç¼+ÆA”Ñ"%ë€	>
$~	Aӄ"&R
 ƒ
A”Ñ"&r`Õ+ÓL	A”Ñ"&é q4¿)ìA”Ñ"'‚ ‘73EA”Ñ"'«€"ÑsA”Ñ"'þÀóf+›JA”Ñ"(	°3g"]A”Ñ"(-à>(ƒ4EYA”Ñ"(‹½j&A”Ñ"(Ò ú%¸7è
A”Ñ"(Ó@õ	*$[*`â$ö)DA”Ñ">Á ({q
A”Ñ">Äà¢ûA”Ñ"?µÃ%>-A”Ñ"@oà€Ý
+OA”Ñ"Bàk*#3A”Ñ"BYà**H0A”Ñ"CÀà)Ü^"A”Ñ"C¶`ƒ"bA”Ñ"D@ $÷5'5A”Ñ"D†ƒÂ"˜DA”Ñ"DÐ@Jù'eA”Ñ"F@T
A/(A”Ñ"GÈ`&ÒÏA”Ñ"HÀç#±:A”Ñ"Inàf!?!CA”Ñ"IÛàa`!A”Ñ"K€ 7)·A”Ñ"K 
çÎÅ/A”Ñ"LW ±& ˜A”Ñ"M4 R ø¾KA”Ñ"M¶ r+,+qA”Ñ"NàC-t2GA”Ñ"NŒ ,v2'A”Ñ"P1Á4ðA”Ñ"QV€/Ÿ=]A”Ñ"Q¸ÀŽ"ï3^A”Ñ"Rã}!8fA”Ñ"T 1+çGA”Ñ"UÀ@	›3"³A”Ñ"V€–&*A”Ñ"Vl€ý™)AA”Ñ"V­à
›¶LJA”Ñ"WqÀ_^0Í	A”Ñ"X<€)á7„A”Ñ"Xœ â
­0$EA”Ñ"Y[€_3+A”Ñ"Z"Àž,{5m…A”Ñ"ZÕ@Ùä6Ä
A”Ñ"[Ý@Ô*¤)3A”Ñ"]·€	sl»\A”Ñ"^Þ@•#gA”Ñ"_‘
zq'_A”Ñ"`€ %!„$r^A”Ñ"`€z'a_3A”Ñ"` )5F:
A”Ñ"`© k!>F$A”Ñ"a3à!šiA”Ñ"aø@Rÿ"†A”Ñ"b4 M)½ËA”Ñ"bs`Ñ/›šA”Ñ"c&@ÉU7A”Ñ"c4`÷Ux6A”Ñ"dãÀ[$R
A”Ñ"e@å) ÕA”Ñ"e *}'lcA”Ñ"ežÀ·ú/d
A”Ñ"fX`c0Ð
A”Ñ"gQ@Qc‰A”Ñ"h
iO0›A”Ñ"h€€%¦0Q#A”Ñ"h! ê»!!_A”Ñ"h³ ~jA”Ñ"hΠ¿'\y	A”Ñ"hÏQ(Ü	âA”Ñ"jCÀ0£A”Ñ"n\àn
¢ ÀA”Ñ"oà~%÷
A”Ñ"ob 2ìë-A”Ñ"oŸ`&2°IA”Ñ"o°`Ö

!A”Ñ"puû"Í7×A”Ñ"q£ 	…^A”Ñ"rÆ (eŠA”Ñ"r×àAß6
A”Ñ"u{ N+H þA”Ñ"vd 
¶Î…MA”Ñ"vÐà@÷7áA”Ñ"w!@n:6A”Ñ"y€r35A”Ñ"z` õS½
A”Ñ"~Xà‡|3ŠjA”Ñ"p€“ÄA”Ñ"  >$FëA”Ñ"€-Ï=A”Ñ"‚4ÀþêA”Ñ"ƒˆ€ÖäÇA”Ñ"ƒ— 	âÛA”Ñ"ƒµÀž&ø*eA”Ñ"…æ`æ'š.3(Ëì{A”Ñ"¡•@¯ôìA”Ñ"¢ê .
A”Ñ"£ø õ2±­>A”Ñ"¤àÝ Î'A”Ñ"¤.€
ëBqA”Ñ"§FÀ¦0`&H
A”Ñ"§K@
{ ¶bA”Ñ"ªKà5è%/gA”Ñ"ªV€¿
BA”Ñ"¬& †ÖŠ6A”Ñ"®ÓÀT4ç¦7A”Ñ"¯l w0“$9
A”Ñ"¯¬€‹8SA”Ñ"°A@G%ÎA”Ñ"°Œ (''Ï,A”Ñ"°Ë¸
˜àA”Ñ"±*`t3)>A”Ñ"±µ
â'àA”Ñ"²d`¢<.õ1A”Ñ"²ß È/"ù+A”Ñ"³§àI+ÒaA”Ñ"³Ìæ(O,á	A”Ñ"´» aÂ+oJA”Ñ"µ‹ 	I BCA”Ñ"·	Àa0NA”Ñ"·`9!ƒ$ÕA”Ñ"·à	6zÒ A”Ñ"·@ U'¨ìA”Ñ"¸ p²	A”Ñ"¸-€Â7"ýA”Ñ"¸ÿ
²CƒA”Ñ"¹Î€‚
if
A”Ñ"º`¼"])B	A”Ñ"»L@	 1RA”Ñ"¼Ý@}0|(9
A”Ñ"½ÍÀ	c+S	ZA”Ñ"¾K`‰9A”Ñ"¾„HjÖA”Ñ"¾™ P-7TA”Ñ"¿g`j!èTA”Ñ"Àx`…$
.QA”Ñ"À‘@Ó3<
A”Ñ"ÀÄ`h »¾A”Ñ"Á«€õ‹¼A”Ñ"Áó ô5|mA”Ñ"Ä2À
Æ ¼A”Ñ"ÄÊ`é4{!I
A”Ñ"ÄÜ€×û.,TA”Ñ"Å› 3í"A”Ñ"Æ+€o )œA”Ñ"Ær¡ ¢&ûA”Ñ"Æç`
ç%7{LA”Ñ"Çá€(\ì
A”Ñ"ÈEàÑ&±|	A”Ñ"ÉþÀ&/ø*†A”Ñ"Ê' )ö2(A”Ñ"Ê@`n(̺A”Ñ"Êt[%ß	A”Ñ"Ê~  ªŸA”Ñ"Ê„€Ð%t:A”Ñ"Ê¢ B&®1A”Ñ"ʹ`:
åA”Ñ"Ëà#ÚZA”Ñ"ÌÑÀK4VWA”Ñ"Í@—­-
A”Ñ"Ï?À) ¡A”Ñ"Ïø ô
}ËRA”Ñ"Ѐì<#ÊA”Ñ"Ñ 
DëëA”Ñ"Ñ|Ž0i
A”Ñ"Ñ­€PëÂA”Ñ"Ò9´$»S*A”Ñ"Òú ¹4H)ŽA”Ñ"Óœ j™i@A”Ñ"Õ›¹ŽA”Ñ"Ö1 „
ÙTA”Ñ"Ö@îÝ
JA”Ñ"×ÂÀí
GA”Ñ"ׯ@χ’$A”Ñ"Ø+àvçä8A”Ñ"ذ`.+A”Ñ"Øþ i(ÈmA”Ñ"Ù‚ÀÁ÷(ÐA”Ñ"Ú

%)¯ëDA”Ñ"Úý¦!‘A”Ñ"Û·àÅ%€àA”Ñ"Ûäào"à<A”Ñ"Ü`àOP)A”Ñ"Üm 	;6A”Ñ"Ü–€tæRCA”Ñ"ß)A”Ñ"á@iaúA”Ñ"á ü(É427A”Ñ"åš@YVŽA”Ñ"æÛ@¤/V'ÀA”Ñ"æã 	›!Þ
A”Ñ"çä2,+A”Ñ"ë5à	ÓΣA”Ñ"ëV e"j
PA”Ñ"ì÷àbŸqA”Ñ"í€ú&( ³A”Ñ"î¯à
Úæ.A”Ñ"îâ(Ã
W	A”Ñ"îïÀtð5¼A”Ñ"ï< *"ö!1A”Ñ"ï¥à
“p
A”Ñ"ðÇ@_!
h
A”Ñ"ñä@_$EâA”Ñ"ò—¡# Z-A”Ñ"õ€¿/‘6A”Ñ"ø} /‹ÁA”Ñ"øƒÀv7±A”Ñ"øøà€(ï
A”Ñ"øû€i! CA”Ñ"ùŒà103A”Ñ"ù¨`É%ìA”Ñ"ùÅÀ<AA”Ñ"ùüà$0/Ê
A”Ñ"úç%3&FA”Ñ"ú¸€=)»A”Ñ"û€O0H1ÈWA”Ñ"ûAà,(;A”Ñ"û×à
Ü"ú
;A”Ñ"üL`öïA”Ñ"üj 1/B>A”Ñ"ýk@9-¡&46A”Ñ"ýäà
z)/#jA”Ñ"ÿ‘ 5+?A”Ñ#œ /A”Ñ#c@Æ"×
A”Ñ#]à
2ª5×+A”Ñ#í@##ÝŒ5A”Ñ#|@Y=A”Ñ#â@Ù°
ÕA”Ñ#á€éú+A”Ñ#Ä€	ÀéA”Ñ#	O@âs4bA”Ñ#	o@w_ÐA”Ñ#	ð€ù%A”Ñ#
kÀGA”Ñ#`aª)àNA”Ñ#9`
`"¢3èšA”Ñ#NàÃ¥ƒA”Ñ#5àú0ùA”Ñ#°@÷#«2ZA”Ñ#>`ˆ…‚pA”Ñ#P š%ÍA”Ñ#|*úA”Ñ#à9 @ Ç	A”Ñ#.DsA”Ñ# 
þ"(A”Ñ#j@
Æ)£)A”Ñ#¯`ö(™
A”Ñ#Å ÞL2/	A”Ñ#Àæy;
A”Ñ#iÀýš)A”Ñ#@	¿,0ÃA”Ñ#1€ä#õ'IA”Ñ#t
b^7ÐA”Ñ#À€V«ž"A”Ñ#/à½2±^A”Ñ#H€<(ÀÆA”Ñ#)`	#qê‰A”Ñ#“ Ð0²#A”Ñ#n Ò%×5A”Ñ#†@
ñ
ÈA”Ñ#—€ÆB&ý'A”Ñ#o`
öU4ýA”Ñ#ï@V\:A”Ñ#ñÀ6× A”Ñ#öÀ
ð ,A”Ñ# ä ž1P)ôA”Ñ# ñÀ6+S2L€A”Ñ#!
.‡áA”Ñ#!~@×
05A”Ñ#"NÀý-/XVA”Ñ#"`’,q0A”Ñ#"À>ã
š.A”Ñ##
R$X#$AA”Ñ##€ $i‹
A”Ñ#$ʽ67A”Ñ#$’€5+ÙWA”Ñ#$éà±Q%™A”Ñ#'“@1k%
A”Ñ#(ä@
Ê$A”Ñ#*ìz Ý01
A”Ñ#,eàÇ(O×
A”Ñ#-ßB-Ç(^‚A”Ñ#.À	8%=#A”Ñ#/F`À£A”Ñ#/p`ª1$ðA”Ñ#0Å`
Ý#‘1É
A”Ñ#1 Å0#:A”Ñ#1èÀÌï'4€‚'È-Ê
A”Ñ#>½À¡0â
AA”Ñ#?€r#7	A”Ñ#@_ g¢2ûA”Ñ#@b Š#­5"A”Ñ#BÂàñïú
A”Ñ#BØàŒÒ A”Ñ#C´&ÍA”Ñ#D  
Òi. A”Ñ#FgÀ.3ç¨PA”Ñ#Fˆ€ˆ,Æ,þA”Ñ#F Ãe![0A”Ñ#FÇÀ¤1$A”Ñ#G?MÇ…A”Ñ#Gý`¸*A”Ñ#H±àM-@$=
A”Ñ#J`d!J wA”Ñ#Jm@0pA”Ñ#K@è3)%A”Ñ#Kcà	Ç“2ÏA”Ñ#L£ Ž+ä*A”Ñ#Mr26ûA”Ñ#Mx€¡»A”Ñ#M” ¯¿2A”Ñ#N×€Ü6„ì¶A”Ñ#O©à%`×A”Ñ#Oéœ#qþuA”Ñ#Oñ@·.µÁ2A”Ñ#P¥ š3ñùA”Ñ#Qh 
F H'µA”Ñ#Q`
?á+Æ
A”Ñ#R@E#A	A”Ñ#Tà
µÐöA”Ñ#T7`&#cA”Ñ#TE€Q/«*êA”Ñ#T¬`¯05þ"A”Ñ#T®`+'Å	A”Ñ#Uhà	œ*>)A”Ñ#Uš @Ì(Ø A”Ñ#U¶À
› ­
§A”Ñ#V  ÒM3A”Ñ#VßàFà	A”Ñ#WÂ`S(Ÿ
 1A”Ñ#X3 §z/ÈA”Ñ#Xvë/y
A”Ñ#XÍà,)é&ƒ†A”Ñ#YV 
U
”A”Ñ#]¶ ik—.A”Ñ#_€Ã2÷%ÒA”Ñ#_À
1#o'…A”Ñ#_Æ 
%ÏéA”Ñ#`qà0N++A”Ñ#`Ë |xµA”Ñ#aù€%o–A”Ñ#b¿ Ë$©+»	A”Ñ#c¸ ÔT#AA”Ñ#cÎà¬"í}A”Ñ#dà8	™(JA”Ñ#fù€(&…">
A”Ñ#h•àÅuA”Ñ#hº€b!c!eA”Ñ#iTà
'"A”Ñ#kà	ý%‡vA”Ñ#l¦—‹ÈA”Ñ#l±m$BRA”Ñ#m…Ú%rºKA”Ñ#m™8 òA”Ñ#n® –ÊA”Ñ#oMàÄ,÷ ¾A”Ñ#oŽ`
2¦%Ç
A”Ñ#pR $2¶¶A”Ñ#p•YA”Ñ#q!`Ï)¸-A”Ñ#s`ÈnŒÌA”Ñ#sz@H¹7d
A”Ñ#tp j¤mA”Ñ#u1€"âA”Ñ#u„€>}$xA”Ñ#u¥ò-*[7A”Ñ#uÛ€³÷!Á
Aӄ#v
 Ü4‡+A”Ñ#x?@d"8 aA”Ñ#xvà7m#vGA”Ñ#x©à'"Ú6Ã
A”Ñ#y€!— ;A”Ñ#y-€(*ÐA”Ñ#y‡`	\,Î7A”Ñ#yËÀ#
¶#A”Ñ#z´
­-æ1¡^A”Ñ#|P`"ñ*ÏA”Ñ# àˆ)mWA”Ñ# Õ/!MA”Ñ#yÀÁò$30A”Ñ#‚”à%:.ªA”Ñ#‚¢à.…
A”Ñ#‚¶À£d*	A”Ñ#ƒ`	£5ìA”Ñ#ƒf@ 0E"^A”Ñ#ƒl€èœA”Ñ#„A@>.H(2A”Ñ#…`õ%1ÐOA”Ñ#‡ž`r0(~A”Ñ#‡¥€ç
8/A”Ñ#ˆ@	7;`
A”Ñ#ˆ¨à	_
A”Ñ#‰[ ¯"(ÝA”Ñ#‰¥ 	n+å8A”Ñ#‹CÀG.·#
A”Ñ#‹P@û/A”Ñ#‹Ú@C!Ÿ2A”Ñ#Œe Ô'2ºA”Ñ#ŒÉ€‡Ÿ(’A”Ñ#Œÿà	ò.8+úA”Ñ#6€ã
A”Ñ#ñ ¢3!6A”Ñ#E€ž/Ÿ
A”Ñ#m Ò(~ãA”Ñ#“H`¢®\A”Ñ#•À.äA”Ñ#•²@ð
•A”Ñ#•ßËF5ZA”Ñ#–†`OG"A”Ñ#—o€
n!@&R
A”Ñ#˜•@
Î'Ë&fÖA”Ñ#™/`
f	Ù9A”Ñ#™Æ@£"*ÄA”Ñ#šR€	x¼A”Ñ#›Ò@”¸ÅA”Ñ#›ð@îýrA”Ñ#œÀ¿^A”Ñ#œûÀV.àA”Ñ#a ;1¬A”Ñ#Ô ë/!Ã:A”Ñ#ž n!ÑÜA”Ñ#ž]`$º0Ö.A”Ñ#žº€&¿A”Ñ#Ÿ@W’|A”Ñ#Ÿ¦@Ð3*SA”Ñ#ŸÜÀ	(
)¯qA”Ñ#¡2ÀŸ*
A”Ñ#¢Høp-[A”Ñ#¢‡@ˆ
[+ºA”Ñ#¢Ó@	.R/Ä
A”Ñ#£| A/*Î6A”Ñ#¤5 ¢!0A”Ñ#¤ËÀS/ƒß
A”Ñ#¥“ÀÐ	Œw
A”Ñ#§Ý ¾¢@A”Ñ#ª!@D+%
A”Ñ#«Ù 
â^À²A”Ñ#¬Nà7eáA”Ñ#¬d »0AA”Ñ#¬n ÿ-´›A”Ñ#­ô ·3Úô
A”Ñ#¯@¤0–ØA”Ñ#°, ®øýA”Ñ#±1€oi’	A”Ñ#±j€¤)Ã+A”Ñ#²‡ÀÉ/A”Ñ#´š«%»7‚èA”Ñ#µ®À\Ý5:A”Ñ#¶, I¶ëA”Ñ#¶Ù `V4°A”Ñ#¶ý anA”Ñ#ºI€Žf	-A”Ñ#º”àm
ŠA”Ñ#¼È 3(ÔA”Ñ#¼÷àô.ËŸ
A”Ñ#½D Y"ô(A”Ñ#¾É€	²æ&;.A”Ñ#¿‚ 
Ý!ù,å
A”Ñ#¿¡€3h"ïA”Ñ#Á¤ 
]"Ë7A”Ñ#Áä`Â6%heA”Ñ#Â2àdaãA”Ñ#Ã,À)feA”Ñ#ÄWæ1òA”Ñ#Å^€Uí0Ñ	A”Ñ#ÅÞ`þÁA”Ñ#ǽàäX6A”Ñ#Ê
Àí)¬A.A”Ñ#Ê- *W%%
A”Ñ#ʘà
Ø£2#}A”Ñ#ËJ 0¶pXA”Ñ#ËWÀpΆ
A”Ñ#Ë£b‰µ
A”Ñ#Ì~à”)ðŸA”Ñ#ÌÕx	A”Ñ#Ìê ,‘-ÚA”Ñ#ÍÀ%b	,
A”Ñ#Í× #Y+mA”Ñ#Î2 â–#;(A”Ñ#Îå»ÙqâA”Ñ#Ï ¦F)‰PA”Ñ#Ïpà
+++Ç
A”Ñ#ÏàE3•ÖA”Ñ#ÐQ ¾-daA”Ñ#ÑN@–Q·A”Ñ#ÑÄ`ÞÉ1Ü
A”Ñ#Ò# ´1æA”Ñ#Ò¡½!xA”Ñ#Ò¤ 
ïþA”Ñ#ÓŽ€Þ*À3V	A”Ñ#Ô<€@y·+A”Ñ#Ô¶ %2¡A”Ñ#Ø.àï"µ}A”Ñ#Ømàs
ù±'A”Ñ#Øœ7·
A”Ñ#Øä Ò-9²A”Ñ#Úd i{º×A”Ñ#ÛDÀ‡†*
A”Ñ#Û¦1Â-~'A”Ñ#Ý€,'(:A”Ñ#ÞI@	Q¥ ®A”Ñ#ßÀS.¸A”Ñ#à-`³¨$ÇA”Ñ#àrÀÜ5¥$|A”Ñ#â°`
Å	•(xA”Ñ#âúà
Ö(:$‰A”Ñ#âý;¿%|$A”Ñ#ã+ £€¦A”Ñ#ãjÀæ*'PA”Ñ#㜠	¦%̶A”Ñ#äkµxÔA”Ñ#åË@ë•%A”Ñ#ç¤À°5	¥+A”Ñ#ç­`	)ò®A”Ñ#èë 
´)Ì •-A”Ñ#é7€
;5A”Ñ#é[X°A”Ñ#éÕ@œÙŒ]A”Ñ#ë…@	
ÚÌA”Ñ#ëžÀOk0A”Ñ#ëÄ`&		!Ò
A”Ñ#ì+@a&ü
žXA”Ñ#ìE &Ã[A”Ñ#ìq`c* A”Ñ#íD
8$Ë1?
A”Ñ#íÙ  "£7
A”Ñ#îÆ §é$XA”Ñ#ïà
6tÛA”Ñ#ðS@€)0£A”Ñ#ñYµ2eAA”Ñ#ñz€x!€A”Ñ#ñÿ@'Þ!ùA”Ñ#ò.À”[A”Ñ#ò® Ú8ßGA”Ñ#óÙ"«A”Ñ#óý*qA”Ñ#ôÝ 	©+…$ïA”Ñ#ôÞ€
Ë$HÈA”Ñ#ôö`S,ž&{*A”Ñ#ö 	è(ˆ
Ÿ
A”Ñ#öq ]×™A”Ñ$˜  y+Ä@A”Ñ$ÊÀ² 
¦A”Ñ$ÀXVŽ2A”Ñ$ÀË6DA”Ñ$f€
!6PXA”Ñ$ª ~0Ç"ÞA”Ñ$œ@ˆGÙA”Ñ$`.-!
A”Ñ$¢àn‚4A”Ñ$ðý¨&AAA”ÑS´` 
ò
OA”ÑSµ/ X³ ŸA”ÑSµh <%P7 -A”ÑSµÜ@É4¹%%A”ÑS·'
È*! A”ÑS·8 Ö›YA”ÑS·§ Çö-Š
A”ÑS¸@Ù&—3A”ÑS¸–À ú§PA”ÑS¸ü@¼,4	A”ÑSº_€T+?QA”ÑS»Sà¯Q!uA”ÑS»‘`7À2A”ÑS¼eÀ:'·?A”ÑS¼o 
âíA”ÑS¼¯@†&{"A”ÑS½ü@ú"ÌvA”ÑS¿J`ë>AA”ÑS¿yàÔ±&k
A”ÑS¿í`r-ŽA”ÑS¿òÀ	±.ÝA”ÑSÀ !Ë0ÙA”ÑS #Ö‡A”ÑSÊ 'ö4¥jA”ÑSá€@7Š

A”ÑSÄ@Ó$
A”ÑSÅ@©Ï–7A”ÑSÆ€œ/æ1GA”ÑSÆÙÀ±	ÛþA”ÑSÇ> AtýOA”ÑSÇ•`'
•%¼
A”ÑSÇÄ Ö8ÒÍA”ÑSÈ1 
iÏA”ÑSÊB€7pA”ÑSËÀŽ3Î'ö)A”ÑSÌ®à	Zîq
A”ÑSÍ´ -D#b
A”ÑSÎë (Ù²#A”ÑSÐà÷@A”ÑSÐo`
+H&WA”ÑSе`
±Û„A”ÑSÐà@w19"A”ÑSÑ–ÀGA”ÑSÓN@V3"TA”ÑSÓd`f!lA”ÑSÓoÀõ'Ì:A”ÑSÓ ®D NA”ÑSÔ CÉ"‚A”ÑSÔ=€
Õm"-A”ÑSÕŠ 
ÝŒ HA”ÑT.! U{	"
A”ÑT.I€Õ#è"{A”ÑT/ýà
PTóA”ÑT1/Š$`÷A”ÑT1F ­ï|A”ÑT2”àržk
A”ÑT37@`"Ð,ï
A”ÑT3`Ðwè|A”ÑT3¶@RvÑ/A”ÑT5°à.+Ä2A”ÑT5Ý —
@$®A”ÑT6³@
•"´é%A”ÑT6³à)f —ƒA”ÑT7ªÀ1XlA”ÑT7åÀÄ ¸A”ÑT9 š(	Š?A”ÑT9c ]ö	A”ÑT9| äŸ#%TA”ÑT:
á/¯9
A”ÑT:{@A(|/bA”ÑT:½€3?+$A”ÑT:ÖàÝ•"ÍlA”ÑT=×`
õ“ØA”ÑT=ã#‡A”ÑT=õ€.@1è	A”ÑT>š@¨&à
A”ÑT>· F¹"ZA”ÑT?À
é~]A”ÑT?ÏÀi$*ÄA”ÑT?éàê!A”ÑT@Ê@‰ñ1˜A”ÑTC¿@‚ü
A”ÑTD] ÊH(A”ÑTEÌà½(Ô *eA”ÑTEáÀL2(ä
A”ÑTFÌà×$– ¼A”ÑTG& ;4÷zA”ÑTGà¶6f&×RA”ÑTG»@	ü¿-kA”ÑTGãÀ¥åÕ*A”ÑTHÀ+ÊA”ÑTH€€_$XÎ
A”ÑTI€@½ö%¯A”ÑTIò`j-Û%×	A”ÑTJÀ
ÿS7¾LA”ÑTJŒàVÜ21 A”ÑTJ§ ŠÏ—A”ÑTK: Ñc	A”ÑTKU § î"A”ÑTK^€
º
Õ½A”ÑTKë ½	—Š>A”ÑTKë@“".4A”ÑTMj 7C0MA”ÑTN? ÜÝ60çA”ÑTQ\àÑ*!
A”ÑTRƒàq#øŽ	A”ÑTR¤`Ä2ˆ%¸A”ÑTSYÀ
Ñ%5ZA”ÑTSå~(¼
AӄTTO@
ë5a	A”ÑTTÈ`é1“A”ÑTUˆ@;..1A”ÑTVÀàG"‚íA”ÑTW.€ÍŸö
A”ÑTW?€ûd]A”ÑTWo I4Ö]A”ÑTW—`V4¡<A”ÑTWÜ %5wÂA”ÑTX¹ ÷'ðA”ÑTXÆ@%59¼A”ÑTXÛ /Ì!]A”ÑTYJ`£4.6A”ÑTYP ø r—A”ÑTYu@Óø&·[A”ÑTYx`U*ÏŒA”ÑTZ`˜WúQA”ÑT[7àè.|%¬	A”ÑT[ù2ÕA”ÑT\n˜T%ÐA”ÑT\ò`œ+¡5A”ÑT]N`é§/A”ÑT]©àKŸ/A”ÑT^’ Ý,•ØA”ÑT^¶ ®1÷œ'A”ÑT^ÕG!ßA”ÑT_kM1A”ÑT_‡¼4±-AA”ÑTbÀ´$þ#œA”ÑTbk`·ú5‹GA”ÑTb´@3\¡
A”ÑTcàã#.-Â)A”ÑTc¬ jÝ*1A”ÑTcЀ	Ç'ö(;A”ÑTcß`
‹žIA”ÑTdÈ@ÅA”ÑTe.`®ÙËA”ÑTe<@(•
á-A”ÑTe@‚$iA”ÑTeà
¨&«&Œ
A”ÑTf0#A”ÑTfa2|C¬A”ÑTgŽ ¹‡VA”ÑThç ó!‰A”ÑTi³F&ø8g
A”ÑTiä`‹(â#:
A”ÑTj­àµ+'‹mA”ÑTjÑ ƒ+º$1	A”ÑTjØ`	,t.˜A”ÑTkG u'hOA”ÑTk À3&FA”ÑTlÎÀV&Ø)|	A”ÑTm@	~$ÈA”ÑTm!àQ3$) 2A”ÑTm5@ÿs£A”ÑTn4àÄ $ÕA”ÑTnÐ »ä=A”ÑTo	àP
´A”ÑTpâÀu
|.fA”ÑTqR@JÒÒ1A”ÑTqUÀЏ4A”ÑTrË@.&	Ý	A”ÑTrÑÀê#A”ÑTs%À¢%ö	±A”ÑTsâ€v6W!5A”ÑTt‹à
.1 ¿A”ÑTt 
»	!&öOA”ÑTtø`~%šA”ÑTvvײ*ôA”ÑTv— 	ª/î
A”ÑTy³ 7¬Â:A”ÑTyÓ b&A”ÑTz<àÓ'µxA”ÑTz¯àÄ-xA”ÑT~+E5‡&iA”ÑT~Ñ€
La1ø
A”ÑT a ßA”ÑT€ö à+A”ÑT¯€	öÝ%A”ÑT‚ÇŸA”ÑT‚äàñU(aNA”ÑT„ _	‚
A”ÑT„o 
/5ä5A”ÑT„ç)«#ÉA”ÑT…^ 
v14$×A”ÑT…b€]w zA”ÑT†­0öW
A”ÑT‡Ñ@D#ˆA”ÑTˆÕ€
+sð[A”ÑTŠ
Àe4ç-]'A”ÑTŠyÀ[zA”ÑTŠ¡€áY	Ã/A”ÑT‹Š 6+ßA”ÑT‹Ã€	X!8'XA”ÑTŒ*`
é5SédA”ÑTŒ2 »¾+zA”ÑTŒô€	Ú0•%,A”ÑT™€4*îlA”ÑT¶@”19
¼A”ÑTÊ£!Ç"’2A”ÑT‘«`
hg2lA”ÑT’Ààšd'öA”ÑT“e,ˆ!	A”ÑT“£à
•‚/qA”ÑT•9à=i
“A”ÑT•=àb.ÈFKA”ÑT•K@J¤®mA”ÑT•á@‰1gA”ÑT–K€˜;,p&A”ÑT–u Y«FA”ÑT–úÀû$…A”ÑT—ÀŸ5ÌA”ÑT—à'.-¬	A”ÑT™[€/!ŠA”ÑT™ÃÀ°
¡gA”ÑTšøàD!Ñ-ÑA”ÑT›( g‹ÑA”ÑT›/ .,“!A”ÑT›\@al)ÃA”ÑTœ4 
#(¹/s
A”ÑTœÄ`%(x7A”ÑT« !*‹$A”ÑTž
C+RA”ÑTŸš`ߨ!Ó@A”ÑT jÀ
ã%é
cA”ÑT ½`Ä'Ð-A”ÑT Ì5!¼$A”ÑT¡w #ûA”ÑT¢d
tCiA”ÑT£Ò€£2âA”ÑT£Ó ÆvNA”ÑT£ýàØ2|6A”ÑT¤÷`N4ì%HA”ÑT¥Ì@
Ü9%.A”ÑT¦À
("6A”ÑT§– Ÿ+øˆA”ÑT§ÛÀ&'A”ÑT¨8 Io
A”ÑT¨Uà~#÷$E
A”ÑT¨€X]P	A”ÑT¨”Ào³!ü=A”ÑT¨Ÿ †E#3A”ÑT¨Ú€
;4ñÓA”ÑT©ž'?/ÿbA”ÑT©C€ë,XxEA”ÑTª
8i&™&A”ÑTª)àÍê	.EA”ÑTª’ ¶‚+HA”ÑTª¯ 	•	.ðA”ÑTªéàpÐ)A”ÑT­€žÈ¸oA”ÑT®|Àì"ò7A”ÑT®Ö 
í
Þ"DGA”ÑT¯“ÀË"A”ÑT°« ¦2ïJPA”ÑT± /„æA”ÑT³` É%­ƒA”ÑT³‘ÀÁ%ÞËTA”ÑT³ç`¸!Â&A”ÑT´Uàh0*š
A”ÑT´`1-åBA”ÑT´°@²!ãµA”ÑT´ì€¶#r#lA”ÑTµ8ÀË
ÂA”ÑT¶€é)úA”ÑT¶X`	Žö"vHA”ÑT¶{À¦ LA”ÑT¸9`Å×}*A”ÑT¸|àK'ÿ8FA”ÑT¸¥HÁA”ÑT»å Bµ®A”ÑT¼~`s0ÌA”ÑT½À
ó$ûCA”ÑT¾È€³,"	²
A”ÑT¿~Àü0»`A”ÑT¿ù€‚5)Y?A”ÑTÂC E*Ê0
A”ÑTÂä`™*°cA”ÑTÃ`,¤&ÊA”ÑTÅŽ %6~A”ÑTÆ6 ß#5qA”ÑTÈ æ½#žA”ÑTÈ'`
	ÀA”ÑTȨ€Œf+KNA”ÑTÈ÷@	1H,ÙA”ÑTÌ `z#*
A”ÑTÍ!
ºk&ÛA”ÑTÍK@â1¸A”ÑTÎÄ@Fð¿A”ÑTÏ 10€äA”ÑTÐ{@£&¶
X!A”ÑTЀ€TÀ!A”ÑTÒªÀFÓ¾A”ÑTÒÉ€£.#"W
A”ÑTÓJà½(É0…MA”ÑTÓl€}&™	åA”ÑTÔ,`+-2#Ú:A”ÑTÔ  ü8!à7A”ÑTÔÂ`™.s²,A”ÑTÕyàs]6QA”ÑTÕ€`5½-€7A”ÑTÖe€¶‡#Á	A”ÑTÖ´€
£Ý3A”ÑTÖØigßA”ÑT×/ 2±3A”ÑT×/@r*·ÝPA”ÑT×çÀ*òA”ÑT×ñ@Ó46´A”ÑTØ\€.1-,hA”ÑTÙ6‚#¡A”ÑTÙw 
¦5` A”ÑTÛ™À
†}$ûA”ÑTÛë`
Š–õA”ÑTܱ ¦î)A”ÑTÜù€øƒ0ÏA”ÑTÝD  $OL5A”ÑTÝ–àâ Œ+A”ÑTÞ¦À¤4#•A”ÑTß`¼
ù(bA”ÑTßE€á
´+ùA”ÑTßX€	”/3A”ÑTáÎÀö0ÚEA”ÑTáÝ15;‡A”ÑTâä9'ØA”ÑTãh 
öw5¹A”ÑTãØ€9o;A”ÑTäšà¤³.A”ÑTä­€:!û-ÀA”ÑTäæÀS)î(ÊA”ÑTæ¸	…3ÝÀA”ÑT盀*“,Ú A”ÑTçû QÝIA”ÑTèÀH)(Þ
A”ÑTê		„(h!ƒ
A”ÑTê
x5+PA”ÑTê@	6,å‚A”ÑTë/€áÔ"Ú
A”ÑTíS ®˜-KA”ÑTí¡@w#9-
A”ÑTíò <|"IA”ÑTîL`\a%OA”ÑTîÆ`84ó#H#A”ÑTðÀÐ*Á!¶
A”ÑTð‚@
8	0"A”ÑTðê ß%'’	A”ÑTðñ 
j.ZVA”ÑTñ| »)À	A”ÑTó2à	¤{78,A”ÑTó¢ ¬´-0
A”ÑTôG@Æ.z
¹A”ÑTôc@=¿Ñ9A”ÑTôêàùŸ °A”ÑTþ`

†OA”ÑTþoTjN	A”ÑTþp`ø%*A”ÑTþw 5Ô{A”ÑTÿ}À”+?!ì/A”ÑTÿÜà
&ý$A”ÑTÿñ Vð
*A”ÑUA@Ã-á¯,A”ÑU€$CA”ÑU& Ð+’ê
A”ÑUp #«,£\A”ÑUœ Â#q7.PA”ÑUt ( ’$Æ
A”ÑU„:…A”ÑUb`XA”ÑUiàu
­-æA”ÑUÀOÁVA”ÑUß ©éÄsA”ÑU«Ã&¸µA”ÑU	à;Ç(øA”ÑU	|À
\_»A”ÑU
.๥
AӄU
:`E$N'AӄU
Ë î	`'¦A”ÑU ÜÈ#¾
A”ÑUSÀ
#)<%A”ÑU€yRŒA”ÑULG!1	A”ÑUÛÀ&*A”ÑU
à˰ž4A”ÑU
. %"ã#ò5A”ÑU
w g!9NAӄU
¦Àü@+A”ÑU
Î`ô5ïø
A”ÑU@`®1/
A”ÑUŠ	Ý
†A”ÑUÕ€6ló
A”ÑU¡ ‡	ScA”ÑUGàù,”–
A”ÑUŒÀ0ñA”ÑU, Ñ/SÐBA”ÑUÊj»/FA”ÑU{Àí+ðóA”ÑUØ€A%d#efA”ÑUð ‹¬.ðA”ÑU„Æ'Ë(JA”ÑU 	ͺÁA”ÑU=Å ŠæjA”ÑUg`—+œ2$A”ÑUÅ W ,A”ÑUÑÛ˜ò(A”ÑU>€±²$éA”ÑU­`5.;A”ÑUà@ä7,4A”ÑU$¿G(A”ÑU‘`ª8"l¦A”ÑUÍÀ
ó-2ò
A”ÑU,`6~Ô	A”ÑU	@m%V.A”ÑUr`
7Ç6d
A”ÑU`.'=ÎA”ÑU:€Þ(q©rA”ÑUjÀ3&¢" sA”ÑUã@
"#èÙA”ÑU8à )ê/üA”ÑU’+ZA”ÑUó 	€¸A”ÑU!³à<®)A”ÑU!ôà*)©!ºA”ÑU"UÀ
*§)WA”ÑU#	 
V€(ÀA”ÑU#`
a è18A”ÑU#Š€g4€B
A”ÑU#±©v2ƒ!A”ÑU#ð v!0ŠA”ÑU%ËvR*A”ÑU%ÀHÅ8¼A”ÑU%ò`".R*OA”ÑU%õ`S!T/8A”ÑU&n lÜ)S
A”ÑU(6 	Ã.øü	A”ÑU(ƒ’#O"‰A”ÑU*'
¶/A”ÑU*Ò€?.+5A”ÑU+£Àë­ÛA”ÑU,. J€!A”ÑU,6G6s7A”ÑU,O
ª&ñ÷A”ÑU,à}
@A”ÑU- ù,ÂA”ÑU-=àì @7À@A”ÑU-¤Àñ¶;A”ÑU.! óB-ñA”ÑU05àS)VA”ÑU0—À
$	ÅfA”ÑU0Ú@H&dµA”ÑU2>€*)Wß
A”ÑU2UÝ7'•
A”ÑU2Ö ¶Éo	A”ÑU3] x*16NA”ÑU4	 %žBA”ÑU5KàBÈ"A”ÑU5V€
Œ"§A”ÑU5Ï€a% A”ÑU6:@Ó£)dA”ÑU7¤`
p*>ÏA”ÑU7ÄÁ,û)0A”ÑU8:À÷+‡2†A”ÑU8l )”A”ÑU9Ê`J$’)ÒA”ÑU:ÿÀ	8A”ÑU;%À1ÆL
A”ÑU<š€x$&àA”ÑU=ˆ`
§-˜A”ÑU>Tà˜‡*ÏA”ÑU?) ä
~A”ÑU?CŒ'?
A”ÑU?… DÄ
QA”ÑU?¤ %Ñ)Ó A”ÑU?¯	-ý$àA”ÑU?Ç€/%„A”ÑU?ꀪ!32 8A”ÑU@à×,â(ÓaA”ÑUA4 	#,õ1TA”ÑUBI`›#Æ A”ÑUBËÀeÎúA”ÑUC- /ÒmGA”ÑUC©àÔ(¨'©
A”ÑUCÔ€	ý:.
A”ÑUCí )ê	mA”ÑUGŒÀèZ:"A”ÑUGà>80…A”ÑUH@
µ,ÈA”ÑUH÷ í{%.A”ÑUI$À[8-,A”ÑUI2À(uÃA”ÑUI>à˜[A”ÑUIZàÜ[
A”ÑUI[ S™
A”ÑUJ, É0ª*P	A”ÑUJ¸ 3 !'A”ÑUJ¿ ÜÊ+tA”ÑUKy`‚-ÝŒxA”ÑUL®™ü#=A”ÑUM 
‰ pWRA”ÑUM Ç2ßUA”ÑUM-ÀZê¢lA”ÑUMÔ@¢4)ÌA”ÑUN¿+ !{A”ÑUO] £#7}&A”ÑUOÜ`n3|	A”ÑUPk`…Dô/A”ÑUQ
 °EšAA”ÑUQ†à9
$ª'A”ÑUQž€Š3b!”A”ÑUQ¯`š%°˜*A”ÑUR`à5Ðy(A”ÑUR¦`$#8A”ÑUSC é, _qA”ÑUSï ÂJ™$A”ÑUTËÜ"w&§A”ÑUTÜà
×P{0A”ÑUU ô¼&º
A”ÑUUˆ ­W5#A”ÑUU¸ý/DsA”ÑUV€¯ —
A”ÑUVFÌ—l4A”ÑUWªà1!…"<	A”ÑUXV€
=˜+'A”ÑUXy	!2S*A”ÑUX¶ ¦(4$A”ÑUX ß"2A”ÑUYÖ€m e2‹
A”ÑU[là.è­A”ÑU[Ë`é"ØA”ÑU\àH.ÃñA”ÑU\­`$|1Œ
A”ÑU\å`ê	I%}fA”ÑU\ó@Ù&
©/¬#‘|A”ÑU^ò€º
Q,;A”ÑU^ó 		ÛA”ÑU_4À5¼2©
A”ÑU_‡ @5
SA”ÑU_ð€71Æ[A”ÑUat 
&éQ8A”ÑUaìÀË"j
½A”ÑUc8 ¬,È\A”ÑUc”àØ3($ 
A”ÑUdSà
õ0¯¤A”ÑUdsÀ¼
ïUA”ÑUdÖ€!×30!A”ÑUe ,²æA”ÑUeà !Ï!$)A”ÑUe- 
Ç©AA”ÑUfT Ñy4)A”ÑUfm s
Ç
§6A”ÑUgWD
ÐÝA”ÑUh(`KV*²A”ÑUho 	â7ñ ˜
A”ÑUix Ô)%	/A”ÑUjK`!Ê&J
A”ÑUjß '2pbA”ÑUlZ %@A”ÑUloà¸é'NA”ÑUluà
í3ã¦
A”ÑUm4 °8¤NOA”ÑU©A 	&µÊ(A”ÑUª„àÏ
ÖHA”ÑUªÊà,2¹
A”ÑU«AŸ/@ßA”ÑU«JÀÍÜ(µA”ÑU«Ç@	ÜTMAA”ÑU¬úàÅ7&†A”ÑU­Ž2Ó+)A”ÑU®@SÃ
.A”ÑU®Ú@u©%8A”ÑU¯Ðàô4m@5A”ÑU°-À³ó*KA”ÑU°Ã€	¹IA”ÑU±¨€lYA”ÑU²€“.ÿA”ÑU³ÀkA”ÑU³`y&d ÎA”ÑU³a
…3ð,f	A”ÑU´F —ú$¬A”ÑU¶Ô`˜
A”ÑU·z@»Å
"A”ÑU¸?èF/`	A”ÑU¹L`C-C"­
A”ÑU¹y !{;A”ÑU¹„ [OåRA”ÑU¹ÆV‹"b8A”ÑUºS`
)ûÑA”ÑUº¬ ¿
A”ÑUºÝ`i 0ûA”ÑU¼OÀÒ L5A”ÑU¼œ@o¹
A”ÑU¼· ì
1?A”ÑU½ï`7
sª^A”ÑU¾Ü ( ( 	A”ÑU¿À
Û
¹0É?A”ÑU¿ÀÀ]*o
A”ÑU¿ÏɃ5†A”ÑUÀ¡àZ€*=	A”ÑUÂJ@	±q2—A”ÑUà ”
±A”ÑUÃn`!”A”ÑUæ Ä#A5–A”ÑUÃÔÀš1¸aMA”ÑUÄ« 
ž³2%A”ÑUÆ /-D3A”ÑUÆH`ŽŽ$PA”ÑUÇIÀ;(Ÿ+mA”ÑUǼ@µ!	îA”ÑUÈàq!×,Ú	A”ÑUÈq€S6_&N	A”ÑUÈÒ`	ª*âç(A”ÑUÉp`}Ë#·A”ÑUÊ 
¿
‘A”ÑUÊ@9=!^YA”ÑUÊ6€j p*àA”ÑUË sœ'6FA”ÑUË< 
ä.à(pA”ÑU˯Àñ«³	A”ÑUËÜ ¥Î$UA”ÑUÌyà!$ý˜3A”ÑUÌ× p‚%ÚA”ÑUÌà H5kjA”ÑUÍñÀ‘$ÊA”ÑU·@ßBÐ
A”ÑU΢€¾&Ü’A”ÑUÎÊÀàq0A”ÑUÎï Ø--"VA”ÑUÏY G«)ÄA”ÑUÏÈà
w/ˆO7A”ÑUÏÔ`2r+JA”ÑUÐÀ7
|ÂA”ÑUÑs€Í*kÙA”ÑUÑ… j,/tA”ÑUÑŒ€Z+%_A”ÑUÑÖða')=A”ÑUÒ’€
yÕ0=A”ÑUÓÌ	´¡ A”ÑUÓ~`{½%¾8A”ÑUÓ¡`
p 'A”ÑUÕ-à3:;6A”ÑUÕ2àCÏ0A”ÑUÕHà.2Ù A”ÑUÕo@¸
ýçA”ÑU×±à7ÌA”ÑUØ€äWB?A”ÑUÙ·à5
A”ÑUÚN`9ç6qfA”ÑUÚˆ Û†
ïA”ÑUÛC€Â†Z&A”ÑUÜ8 Ô0üSA”ÑUßr@p!ä1³ÑA”ÑUß÷À´ ´3ˆA”ÑUàí Ì$P#ÏA”ÑUã‚`öíA”ÑUåРG<UA”ÑUåë€Á*Ù
`
A”ÑUç{ˆ!û"­A”ÑUç®`°Á2A”ÑUçÿ`Í$¯/A”ÑUè®à¶
ÊA”ÑUé©`»Y%l	A”ÑUêôÑ#—4`	A”ÑUê÷@,(ùAA”ÑUëº
(èRGA”ÑUë¿à܉¸ÁA”ÑUí'	[ A”ÑUíÀÎ¹G	A”ÑUí> ÿ2­"
A”ÑUíEæYA”ÑUíÂ`Œ
‹)AA”ÑUî„ 
Q#M0"A”ÑUñ q!A”ÑUòÐ '›1A”ÑUóV`f4fÃWA”ÑUõ@†!ªùRA”ÑUõx`…CÃA”ÑU÷Z MA”ÑUùxÀBø`1A”ÑUûØ€m+;
A”ÑUüO€sÅ.µ‚A”ÑUüÍ9 ®-	
A”ÑUüæ€:"ïiA”ÑUüñÀk$A”ÑUýB
HðHA”ÑUÿ«€ñ0HA”ÑUÿÚ€V
A”ÑUÿÝ€ØRñA”ÑVg Çù6ˆA”ÑVå —*¾H	A”ÑV'@(þ,_A”ÑV° (ó.B	A”ÑV÷À

A”ÑVÁ@cƒ$dA”ÑVÇ@©,+
4A”ÑVn›¸ ‹1A”ÑV`ÝmÕA”ÑV¶ ›c2A”ÑVô Õ
µ)Ñ
A”ÑVøÀ	û Æ£ÔA”ÑV	
€t/7bA”ÑV	³—*l/äA”ÑV
˜ &"I6A”ÑV
Õ`
1*O"ó	A”ÑV„@-Q·A”ÑV³Àü¥'A”ÑVú ±è-I	A”ÑV
q`I‘
AӄV
ª`0I)!A”ÑV@0§(
A”ÑVh€
m ½(WA”ÑVl 	Ò+»1A”ÑV®`? ·A”ÑVC %3,N1A”ÑVX€XœñA”ÑVö`iîAlA”ÑVÀŽå&ñA”ÑV¥ 
Ä
ü$A”ÑVª 
-#¥A”ÑVœà
½*—7A”ÑV@€»wö
A”ÑV)`'7	òA”ÑV¸ „-é ‹6A”ÑV‡ 
#B©A”ÑV]à)2´'cA”ÑVd@	4!M-A”ÑVЀ$߯MA”ÑVZ€~!7ò;A”ÑV¯€%e	*A”ÑV	½>4A”ÑVe€X/AA”ÑVÀ¦'€2,.A”ÑV[1A”ÑV3`!&Ã#b@A”ÑVƒàþ(1ùA”ÑV·€'0’{A”ÑV³§SA”ÑVé J5gA”ÑVÿà8(jA”ÑVF`X÷A”ÑVa`…/È óA”ÑV¯`É$ò%_A”ÑVð /ëAA”ÑV ã@w#2èA”ÑV ûÀíü|ÜA”ÑV!:`À|¿KA”ÑV"I^%[(œA”ÑV"‹À	H÷"'?A”ÑV$* 
¡»'¥A”ÑV$ 
F$œ
A”ÑV%Dào©$^	A”ÑV%tà;"JA”ÑV%‚À
Š'¥$
‡A”ÑV%ûÀ”1´	A”ÑV&À‹e'±âA”ÑV'O`
`3P]A”ÑV(Àߤ5¦A”ÑV)P@Q¬,A”ÑV)e Çô4¯A”ÑV)³à¥+àeA”ÑV*yà»(1wA”ÑV*«àaP{A”ÑV+J€#$§”A”ÑV+ò€¥Ÿ%A”ÑV,-@܇3ÓÀA”ÑV,ˆà¼tA”ÑV,Õ@J&"ÀA”ÑV-C€
;º4ó
A”ÑV.U ;òÊ-A”ÑV/«àü 
éA”ÑV0€][-*A”ÑV0¹ ŒºA”ÑV1˜`
‘A”ÑV2: ·"£â:A”ÑV2? 
z$œ	A”ÑV2dáâ¸?A”ÑV3 P.þÌA”ÑV3¸ í¥1A”ÑV3ÿàÎ'½Y
A”ÑV4vÀO_A”ÑV5Ò`
Î#¢A”ÑV5ëÀü	g®	A”ÑV6Š,ÿNA”ÑV8àŸ11&ÖA”ÑV9«€	…–
õA”ÑV9ßà3*ùA”ÑV:.	n$K2§	A”ÑV:2€ò"	A”ÑV:Ô Ð$&
A”ÑV;· ;0Ù"Æ6A”ÑV;Éà²!L%ìA”ÑV;ó 
â-+¸´A”ÑV<ð€$*›æA”ÑV>@¼)DA”ÑV>¶ 	¡ý B
A”ÑV?é»#ÿ!A”ÑV?À`¬,A”ÑV?% x-N0€	A”ÑV?kÀ“YA”ÑV?
$­
A”ÑV?×`í
èA”ÑV@&@d)à3•A”ÑV@eQ	šPA”ÑV@Ì@!fwUA”ÑV@ßànú-Ü	A”ÑVA@@p#ÿ$A”ÑVB@:-wA”ÑVB-`x
LA”ÑVB@€t?m+A”ÑVCEÀ(³"ëA”ÑVCË@(Q+KA”ÑVDÐ œ+1LA”ÑVE€B¾HA”ÑVEÀàrq3LA”ÑVEø "
‚A”ÑVF´`f.ÍA”ÑVGÄ€“+ó
’A”ÑVGù€Ï'2"lA”ÑVH `›*?A”ÑVJÄ »#>=A”ÑVK´@
#„
ÇA”ÑVL!@%
¾A”ÑVLk á<c-A”ÑVMZÀ¬&,A”ÑVO=`I&L3A-A”ÑVO¸ n*Ê.U
A”ÑVOø€ÌÕ&òA”ÑVP~@,p
-A”ÑVQ	@["k0A”ÑVQ2`J>.ÃA”ÑVQQ@š*2A”ÑVQãÀ	5%!îA”ÑVST`Ïà*{A”ÑVUQ 	Ä"s)A”ÑVVÿ 	«"I	A”ÑVWÀÌ¿0A”ÑVWr@ê¢A”ÑVW¹ µ"(•A”ÑVWÉ º ·A”ÑVX2à
õEJ.A”ÑVXÛ@0%A”ÑVY ^œÊ,A”ÑVZaÀìNA”ÑVZË ©)Ã$ÈA”ÑV[=`
ã6&²A”ÑV[ô€	.@îA”ÑV\@[ã*;NA”ÑV\ð€£Ò!WA”ÑV]; 
t*Â*'A”ÑV]>@öþ_A”ÑV^à&&*@A”ÑV^k€	bþbA”ÑV^{ E…†CA”ÑV^» Ô.¹A”ÑV^¿e0÷/—	A”ÑV_ÐÀµ Ý3A”ÑV`VÉh=A”ÑV`´€X\ü7A”ÑVaK M+Ã,eTA”ÑVa‡ °“$jA”ÑVa”à
Ï"iA”ÑVbRÀ
Žð.A”ÑVbs`-!K Ú4A”ÑVc
h?:A”ÑVc} ƒ)u2/
A”ÑVcй;l
AӄVe
ÀÎ(",gA”ÑVe0 Þ&˜¹A”ÑVfàq^A”ÑVfà”'ÞÔ‘A”ÑVf[À*'ÎöA”ÑVftôq&A”ÑVf¨ ™@6	A”ÑVh[à²	¢ù	A”ÑVh… 6##1A
A”ÑVh™ ‹ø
rA”ÑViŸ`%A”ÑVj«€gÉ2ÙA”ÑVj½À˜1-,›A”ÑVjÄ@:2D u;A”ÑVk,à¢0ÎA”ÑVkc`âë’A”ÑVkº`¥3A”ÑVl¡àC')&A”ÑVl´ 	ÿ"&lA”ÑVnK@
Q…A”ÑVn¨@²A”ÑVo€%ïz
A”ÑVp 7"D ›A”ÑVpÊ
i;)?"A”ÑVpÎà	B¥ 1+A”ÑVqLàã.ÂpA”ÑVr1@
U/¹‘A”ÑVr× Î1m*ò	A”ÑVuU`
„(ZA”ÑVuà
l‚A
A”ÑVuÄ Ò2vA”ÑVv~àd¥*"‰A”ÑVwm 	!ï).
A”ÑVxä 	¹2:%5A”ÑVz 
"I,[A”ÑVz„`G1¼1A”ÑVz˜À{#ì5´	A”ÑV{Và

Á'A”ÑV{÷ 
6A”ÑV|4 j%W	•UA”ÑV|F€u.”kA”ÑV~	 ü.7yêA”ÑV~ã ˆo aA”ÑV~øÀ³ ¢!
A”ÑV€ú Ä.Ä49A”ÑV€ü d#d+Ð[A”ÑVŒ`S(ø	A”ÑVÀ5!©
?
A”ÑV‚ J4tIMA”ÑVƒIM$9$È0A”ÑVªØ€©"s’*A”ÑV¬T@ïV)¹A”ÑV¬tÀ	¥ /dA”ÑV® ‡m31A”ÑV®«€íÑ!“JA”ÑV®±
º
éA”ÑV¯àŸ!FA”ÑV°Z€
*ª®A”ÑV±&à€)v
A”ÑV²€	‰e¼DA”ÑV²`@€0A”ÑV³ŽÀ@/d ÁA”ÑV´£Àtô#'A”ÑV´Ñ 
P!˜RA”ÑVµdÀ*ûdA”ÑVµà`3GÕA”ÑVµú 
BzšA”ÑV¶q €*a1	A”ÑV¶æ`IÞA”ÑV·!€P£:A”ÑV·² ö¡ªA”ÑV·³ÀX¬2»A”ÑV¹³À'JA”ÑV»Ê2ü'
A”ÑV½,àj&o%ž
A”ÑVÀS€
W)[jA”ÑVÀ…Àwä1¿:A”ÑVÀÁ #á	A”ÑVÁNà("î0qA”ÑVÁl@ÆmóA”ÑVÁ¾@ª
•ÞA”ÑVÂë€tkA”ÑVÃ^€$4c":A”ÑVÃg^	×,A”ÑVì CÄòA”ÑVÄ´€¥Ä+šA”ÑVŘ`¢ mA”ÑVÅ¥à¡4Ä$PA”ÑVÅñ 
à‹E€A”ÑVƆ@>)l1
A”ÑVÆÛ`
d‰A”ÑVÇ€'
Øð2A”ÑVÇX€s̺DA”ÑVÈ¡@.F$A”ÑVÉ`
¶0Ê5AA”ÑVÌ4ÀF-0³A”ÑVÍ,`(,,½A”ÑVÝŽ€MêúA”ÑVÞL
·5‚$ÛeA”ÑVÞt	Ü%ÃâA”ÑVÞé`^Û0A”ÑVß¹à%0Õ%’2A”ÑVßÉà	½5)¤A”ÑVຠÔ A”ÑVàÔcVA”ÑVá`¶,,ý
A”ÑVáÒ@{6yºA”ÑVâ
 Ð
ýŒ)A”ÑVâ„à¤h4ÄA”ÑVã, +h0×A”ÑVã™à´N$#A”ÑVä§`"üA”ÑVäÛ tÏäA”ÑVäö v)+A”ÑVå µ¸-¶A”ÑVå|àõ–RA”ÑVæ3~J•¤A”ÑVæÕàrºî¾A”ÑVç(àÜ!a$²A”ÑVç„à
'†èA”ÑV甀C"
A”ÑVçõ`ø/æ#A\A”ÑVèÀ!ßXA”ÑVé, Bè¸	A”ÑWm`š!Ø31*A”ÑWàB"91
AӄWY@E
V"m?A”ÑW¾
}%DA”ÑWÜÀÐ"Í
A”ÑW™ "B	A”ÑW :)I+nA”ÑWfàø0÷)%A”ÑW˜@È4qéA”ÑWÌ`f13ÇA”ÑW€
C2£ÈA”ÑW@@Rû&ÃA”ÑWB€
”!ØA”ÑW  ¡±2A”ÑWþ±¾)H8A”ÑW5 ¢B1A”ÑWn ]Z!?A”ÑWÌ 
'•Ö	A”ÑWï j 7
žA”ÑWj@U.À+ÛOA”ÑWÀm¥*;7A”ÑW 	…öj'A”ÑWg Ž$ÈH
A”ÑW¯@Q"=,lA”ÑWöÑÒ	}A”ÑWz ¨µc
A”ÑW @Ë(LƒÜA”ÑWË`$ô	ñA”ÑWãà)ÛA”ÑW €é#"³!A”ÑW!Lê+%ÔA”ÑW#­`R3
µA”ÑW& $!%0?A”ÑW&- Ô°5¡A”ÑW&†€D
F
ìA”ÑW'¶@÷^4’
A”ÑW'ôÀ-µuA”ÑW)ûà.+Õ
A”ÑW*HÀ°Ñ)¹3A”ÑW+ìàÀ/!NA”ÑW,i&©÷A”ÑW--÷DI6A”ÑW-Î;$9šA”ÑW/D !Ö%îA”ÑW0ê
B,kK(A”ÑW1 f4i}A”ÑW2- ú A”ÑW2‘(Š19A”ÑW3`ßÏ”A”ÑW3 Ã,o÷A”ÑW3¢ Ã%j.«?A”ÑW4¯Àf Ç"9A”ÑW4´@b3˜(ÄA”ÑW5@Áˆ3	A”ÑW5ëàêä!ú"A”ÑW6@ ¯/°	A”ÑW6Ó ‚3öLA”ÑW7; /$·AA”ÑW7Œà´Æ	…;A”ÑW8‡`Š!T;=A”ÑW8à
ÖÓ:YA”ÑW;û`¢0Ó"ÕgA”ÑW<Ó 
54úwA”ÑW=þ€¦¿AA”ÑW>q0-Ã	A”ÑW>N@E ³A”ÑW>œ€×Y)q3A”ÑW@a ÆÚ)PA”ÑW@…@	í²0Ï8A”ÑW@µ@Uº~A”ÑWA8 Gþ2¬A”ÑWA<ào&ï$'	A”ÑWAe
ã$BÖA”ÑWAo ¨$kA”ÑWAË<¤%,A”ÑWB½ 1 c B	A”ÑWBð`
R6A”ÑWCŒ o'£/Ø
A”ÑWDyàž	ãLA”ÑWDÈ 
ì&|(A”ÑWDúà0u,gA”ÑWE€õ*WäA”ÑWEw€ŽªA”ÑWE¾ ï	KA”ÑWEê`"4QA”ÑWF`Š"!e&A”ÑWFê@œ&	*ƒA”ÑWG@Š/;ŸA”ÑWH4I=A”ÑWHœ`
Ï*#>A”ÑWHý@()ÐÊ?A”ÑWI§ ó%>A”ÑWJ3`º+A%JA”ÑWJ>àl+á(¡$A”ÑWJç 5Å4åA”ÑWJì ¡ÜsA”ÑWLt`˜+>+ÌA”ÑWMàŽ¼#¸5A”ÑWN`~3ž JIA”ÑWNË€6P!4A”ÑWNÛÀ
wŠXA”ÑWOj@¶ñ4Q}A”ÑWPdÀÎ$9~9A”ÑWQ0 F ÃA”ÑWQr€ç+0
b.A”ÑWQw@¼#ª´A”ÑWRƒµ&,ÕqA”ÑWR¯@
¹ò"aA”ÑWSA ð
)ðA”ÑWTC	+‚ŠBA”ÑWU|`3¹A”ÑWWÙ 4"ç+A”ÑWX&€iZ£A”ÑWX=@ïzÃkA”ÑWX«À
ÇÍA”ÑWX¬ —”)üYA”ÑWY!À‡B"vA”ÑWZ9
~)Â9A”ÑW[€˜ H'EvA”ÑW[!@	Š'(r
A”ÑW\€ˆ"9Õ	A”ÑW\ ×$$÷A”ÑW\¬à
!þ–A”ÑW]¿ s&ZA”ÑW^è`D­,Ï*A”ÑW^þ`È oHA”ÑW`L`Y&##A”ÑWa g3%Ó.A”ÑWaÉ@ä2A”ÑWe¾€*‚ÂA”ÑWfÆ€S¯=A”ÑWg`µ"ô7A”ÑWgX øÓ,§-A”ÑWg`às%™!ê	A”ÑWh»À
$
A”ÑWhï Ü,rGA”ÑWi*ßvA”ÑWiË`¸öµ(A”ÑWjcà&,	$UA”ÑWjx`)&]£A”ÑWk(€Á"*"A”ÑWkŸ•Ü	TwA”ÑWlø v}!CA”ÑWp 
4z%à1A”ÑWpü๯
Ä#A”ÑWq
  Ã?8A”ÑWrK Ì
G$MA”ÑWs¨@)-¥A”ÑWt@1fA”ÑWt( $RTwA”ÑWtM›!#ÇA”ÑWtš@LB*A”ÑWu ‰C	Ã@A”ÑWu Z}÷A”ÑWv@¤ TãQA”ÑWw|Àˆ*ýÔA”ÑWw÷`Âa5A”ÑWy€ i'ÔÞ3A”ÑWy‹ÀÔ®A”ÑWy¦ ÖE
A”ÑWy€~4-7A”ÑWyì $!Ø]A”ÑW{L@
Ϫ;A”ÑW{àÀ
¾òA”ÑW{óà1V%^$A”ÑW|Ï@	ˆ$ÂsA”ÑW}x€Å û
-
A”ÑW~ QŠ"GA”ÑWÿ 
~1ü'Õ	A”ÑW€ .ì
AGA”ÑW€o cÂÃA”ÑW€ÿ€[	­)EA”ÑW 	§&Ô{A”ÑWFà
Ç	k+»A”ÑW„@Y,¯0n%A”ÑW„, ã"2&n;A”ÑW„Y 	Ë-&A”ÑW†PÀ«V08A”ÑW†ãŸ!'=iA”ÑW†û€	mù,Å
A”ÑW‡” `+$A”ÑW‡½@¹.5
¨A”ÑW‡îé¼vA”ÑWˆÁà¨-XåA”ÑW‰› a'tE $Ò­A”ÑW¬£@+'A”ÑW­€è+Ê1/
A”ÑW®
Œ"×ýA”ÑW®G P$e2.	A”ÑW®§@nˆ×YA”ÑW®½ ‚~
A”ÑW¯ã ˜2râA”ÑW°Ÿ@/"fáA”ÑW²G@{ó*3A”ÑW³*ÀÛ-
[´A”ÑW´Í€Ñß&l
A”ÑWµe 9åA”ÑWµÁ 0|…A”ÑWµÓ€°+ˆ(átA”ÑW¶@ÿ”+¢
A”ÑW¶i ÜFA”ÑW·€ÂÚ4WA”ÑW¸ç`)
FÐA”ÑW»1€hê£FA”ÑW¼añÝ5‡A”ÑW¼„44íS$A”ÑW¼´`ÖÝ1ˆA”ÑW½ÀqcMA”ÑW½VÀ„f«A”ÑW½` œòí±A”ÑW½eàŠüÐA”ÑW¿ÉÒ‹A”ÑWÀ@ÿ$¢.MA”ÑWÀàƒÎlA”ÑWÀb`T,é©
A”ÑWÀ²`Õ#h! A”ÑWÀå˜™™ A”ÑWÁaàZ”- &A”ÑWÁÓ}-f'4A”ÑWÀ±w1lA”ÑWÃÏà1î‘A”ÑWÃß 9bÇA”ÑWÄ)@@^ÕA”ÑWÅ`²™ÿ
A”ÑWÆ]€è¶A”ÑWÆØàk*s#A”ÑWÇ'@èI
+
A”ÑWÈI@G•6A”ÑWÊc@že#Ã\A”ÑWÊe@""³A”ÑWËÂà
q0Š*kA”ÑWÌY`ð Ï,Î6A”ÑWÍF€Šˆ"ÎHA”ÑWÍÏ
}û™fA”ÑWÎ!@x£)eA”ÑWÏE ¥¥+RA”ÑWÏË`	íA”ÑWÏå€M F%>FA”ÑWÐÑ 
™
].w	A”ÑWÒ/ è"‘2—	A”ÑWÒ5€^2Œ1,A”ÑWÒqàh!ÚX0A”ÑWÒïÀ!®0zrA”ÑWÓ÷ Œq(EA”ÑWÔ€	˜-D.—A”ÑWÔàèe 3
A”ÑWÔ9`
äª!’.A”ÑWÔ€ 
^
˜A”ÑWÕ ‹2…ËA”ÑWÕAà‹IZA”ÑWÖ@çŸ(^
A”ÑWÖ:`	Ð'¸5A”ÑWÖ‡ C3QA”ÑWÖÃD2
$îA”ÑW×\à	Ê'H2"A”ÑW×zÀdDA”ÑW×Þ@å¹%	
A”ÑW×ø€
Ï5±-A”ÑWØ·`
03
‡'A”ÑWÙ
“)Æ+kA”ÑWÙ1`Í/%
A”ÑWÙU 	â"Ÿ1†A”ÑWÙ” ó}/B	A”ÑWÚ )
Þ›
A”ÑWÚÚƒ.A”ÑWÜr€
W
A”ÑWÜrÀ#
6DA”ÑWÝN€íÔA”ÑWÝn@° 64ÒA”ÑWÞæ`V/¡,«0A”ÑWß Ò/ 
A”ÑWà3à0Ú‹5A”ÑWàïÀÅ1J,>A”ÑWá@ö.\A”ÑWá”
DŠA”ÑWâMàŠ£A”ÑWâU ÷*.r
A”ÑWâð2©2âdA”ÑWãp@è*1<A”ÑWãs ¬*áWqA”ÑWä"@s%+"qA”ÑWäK`Ûõ×A”ÑWå9À£ƒ2ºA”ÑWæŽàû+>A”ÑWæ™à÷³™
A”ÑWæ¯`*;$¢2A”ÑWæ×à±+ºZ
A”ÑWé9¿ã
ªA”ÑWê@äV<	A”ÑWê˜àÙ%­bA”ÑWë°ÀÝ$D'¾	A”ÑWí
	kA”ÑWí$ ´»´A”ÑWí5`(â3U	A”ÑWíVà¯'•-E
A”ÑWíu ü(¢2'	A”ÑWí“ TÏ*ÒA”ÑWî Ç'¾¯:A”ÑWîš
¾sñA”ÑWï@€"-mA”ÑWïÉà7$°RA”ÑWñwÀ¿Ë
83A”ÑWñ–@~ã‰pA”ÑWòr¿-å
A”ÑWôSàpüA”ÑWô”`i*?A”ÑWõ* Û"e4™0A”ÑWõI€d'Ÿ%A”ÑWö˜#JA”ÑW÷»`5	Ò"ëA”ÑWø 
+!3ÒA”ÑWùàŒƒJ.A”ÑWù Ð-Ò¼/A”ÑWù†`³%ÌFA”ÑWùâ€
îž\A”ÑWý¢ V°%VA”ÑWýÄ`[*À*A”ÑWþÌà
æ/ñ A”ÑX¼àJ)êA”ÑX+`
›ù7A”ÑXl€–583A”ÑX£`È&{ÚA”ÑXô æ/ÈX9A”ÑXÿ Ý2w"*A”ÑX \†áA”ÑXl`½P A”ÑX¯ ²e÷A”ÑXè »1ÞA”ÑX	 E,B1Œ
A”ÑX	¨ ˆ1(yA”ÑX
­ ê
A”ÑXp #–	”SA”ÑX
- (P+ØA”ÑX
õÀÎ&gA”ÑX ™ž&A”ÑX†@äÊ&ÚA”ÑXH 
›YJA”ÑXz v{+ŽA”ÑX’ »*œ.¥A”ÑX³@1ï%;A”ÑXö@>ó"	A”ÑX5àwÌõ
A”ÑXbà²âA”ÑXl€ß<*Ÿ	A”ÑX–€•'Œ"#EA”ÑXÓ@&º&—A”ÑX"À	µq
C\A”ÑXK á"§$A”ÑXi`R0dA”ÑX±à	«)ÀA”ÑX²àm¥A”ÑXùÀŸ*“"A”ÑX3àE™ÍA”ÑX @³	
oA”ÑX®œx#A”ÑX¾ h
YWA”ÑX€l%S
AӄXc
Ü 7A”ÑXg ±!gh*A”ÑX®Àé2ù²sA”ÑX\ÀÙ4@
A”ÑXn@’#v('A”ÑXx€	5w¥A”ÑXª€ï ³2A”ÑXá€ÿ)Ç)^A”ÑXç +"æ'Q
A”ÑXÖ`	‘#˜
A”ÑX'`~z7UÃA”ÑX~JÀ(PA”ÑX°@°N–	A”ÑX“ Lç+?³A”ÑX×`5÷¶BA”ÑX ½`âu³$A”ÑX à ­¬'E_A”ÑX! 
¼#îs	A”ÑX"ñ@Ré.ñA”ÑX# ¥
h‰
A”ÑX#¾`0¹%׃A”ÑX%W ¥1A”ÑX%ñ@¯1ª$¨#A”ÑX&x
4%-ÌA”ÑX&£ ú!K}A”ÑX&®€(—GA”ÑX&Þ`	k+S	A”ÑX(và	$R! A”ÑX(‡ ‹-‡UA”ÑX(ŽàÓ–»A”ÑX)× Ö0O'–2A”ÑX+ð€½
I.ÚnA”ÑX,} ü',1¡A”ÑX,ËÀèÃ!
A”ÑX-@© ’
BA”ÑX- ŸèxA”ÑX.@è$( ÑA”ÑX0L€
Vû	A”ÑX0V€% yA”ÑX0²€u‰#ñ^A”ÑX2M¾
+âA”ÑX2S &
-A”ÑX3s,˜!-
A”ÑX3–`b#ƒ–A”ÑX3À
¼§£A”ÑX4I@´$åA”ÑX4›@µ#º4:A”ÑX4¶€¾.“-yA”ÑX5À¼ëA”ÑX5Aä.í¬A”ÑX5~fpÁ1A”ÑX5–`îê7éÖA”ÑX7ï@Ä3åA”ÑX8^	,jA”ÑX8W@¹"B$A”ÑX8Z 3 Þ5A”ÑX93@€,¢çA”ÑX9Æ€%·"A”ÑX:g Ò%åA”ÑX=z@´ ·
˜	A”ÑX=‚sfA”ÑX>c ›DÙA”ÑX?»ð›&ÇA”ÑXA (j
°'A”ÑXAV€¢-¬A”ÑXAg`>Þ¶A”ÑXDGàä)
A”ÑXEw€U‹'yA”ÑXF˜'O4?·A”ÑXG6Œ
A”ÑXG$`ý÷0LA”ÑXGm ¨
©+‚
A”ÑXGùÖ*\Y
AӄXI
€*_5*A”ÑXI– ½#QA”ÑXJÑà
lß1^NA”ÑXKH V!A”ÑXKJ`
<EA”ÑXKz (hA”ÑXLœ€\
n(dA”ÑXLº@
Z)3IA”ÑXLÖ /!A”ÑXM6Àl&î!A”ÑXMÕ w#>&ªA”ÑXN`
!(î
A”ÑXN•€û¸
7A”ÑXOjÀ™1:ÿA”ÑXQ`Ã
RéA”ÑXQ5¬
	A”ÑXQL¿ŽA
A”ÑXR/À‰"°ÜA”ÑXRD€-#ÙA”ÑXRvÀÄ#Ò&‹,A”ÑXRê`
î.A”ÑXTºy ;A”ÑXTâ@E3rA”ÑXU ð 7nA”ÑXU“`!.åA”ÑXVÏÀl/1'
A”ÑXXÁdüÃA”ÑXZ™€P"4#A”ÑX[ w%. A”ÑX[¦À¿"õ0A”ÑX\(à1!9UA”ÑX\{@8*£1ÅA”ÑX]5`Ä2¾è?A”ÑX]ñÀž n+oA”ÑX^Š€µ4b#¦A”ÑX^ÂÀ
¾3
2A”ÑX^Ø`°2Ã%ÏA”ÑX_h@	¯&	„LA”ÑX_Î@t5ÁA”ÑX`~@Å
Â¥A”ÑX`ˆÐ)Ö!¦A”ÑX`–@e{*â
A”ÑXbAÀò2)SA”ÑXb`v)Ø1&>#u$A”ÑXo®à£íA”ÑXpÁýì)ˆA”ÑXtY	z!Ó!:A”ÑXu6@
$ÏvA”ÑXu¼àq_A”ÑXvàÿøÚ1A”ÑXw= ‹	Z±ÔA”ÑXwµ Ø'Y$v
A”ÑXx=€.kA”ÑXylÀ5˜Æ-A”ÑXyø@|YèA”ÑXz`/q$,A”ÑXz À
¿*Î
A”ÑXz¡à	u%¬dA”ÑXzÍ 5¸ oA”ÑXzúŽT^A”ÑX|c é EA”ÑX|‡€f¤2¿A”ÑX}ä`$3Ê	A”ÑX~
 k"’#<
A”ÑX~ž€õa,@ZA”ÑX~¼@«,˜³A”ÑX~È ¼fyA”ÑX~ìÀNd2pA”ÑX"@¯~ ŸA”ÑX€Àà=@ŠA”ÑXàâØA”ÑXd &™A”ÑX‚À‚
¯*!A”ÑX‚†	œhAA”ÑXƒÇ =xbjA”ÑXƒÕÀtô .A”ÑXƒÛÀ*%{4A”ÑXƒë J#H(ŠA”ÑX„@	*P-ÏA”ÑX„f@ä)â
A”ÑX„Û`ÈŸÖA”ÑX…€%$"FA”ÑX…`ÙA”ÑX… ±9+~A”ÑX†À®2"µA”ÑXˆ†@ø4‹ [A”ÑX‰o`z2÷
A”ÑXŠl€íA”ÑX‹@S&vÙA”ÑX‹©)žfA”ÑXŒ 	B}üA”ÑXŒ+`ÛÌÑ A”ÑXŒlàb?70A”ÑXŒ¼ N4'LŒA”ÑXŽl`Ì3PTA”ÑXŽƒ`*+{A”ÑXŽñ€˜%þ^A”ÑXŽùà
Ú"A”ÑX@Ã4^"A”ÑX ~ÙA”ÑX$ ‚Ž*A”ÑX-@÷!”Æ7A”ÑX¦ààºþ,A”ÑX‘ ÇÜ#¦/A”ÑX‘ 
?	`'bA”ÑX’8àÑ2ÎA”ÑX’Ú`<.dÜA”ÑX“{àBF)BA”ÑX“ `	a+ò"A”ÑX”½”'FA”ÑX”’à
Š"HA”ÑX”ܶ)K>A”ÑX•)€û
Í
"	A”ÑX– š*	ÐFA”ÑX– `O
&ßA”ÑX–$ ÷x,ð#A”ÑX˜@ûûeOA”ÑXš}àr+þ!|A”ÑXšàS,tO	A”ÑX›ø€?3

A”ÑXÏ€õ-VAA”ÑXžàæ’3IKA”ÑXž( ]"}.CA”ÑXŸX ;7{	A”ÑXŸr€Šc05,A”ÑX X`<·/Ý
A”ÑX¡€Ê`
>BA”ÑX¡— Ë…6u-A”ÑX£AÀ-e—
A”ÑX£[€’ý_KA”ÑX£‚ ‡!Hn1A”ÑX£Š`Üjƒ
A”ÑX¥-@/!ÃtXA”ÑX¥I€Ò,•é3A”ÑX¥V@úü~A”ÑX¥c€áO“A”ÑX¥† Å%ª%å5A”ÑX¥à€
R4úA”ÑX§ö D*7¸ÎA”ÑX¨µ@\1Õ„A”ÑXª,¹A”ÑX­aÀ-¼YA”ÑX­iµ=-
A”ÑX®Ç Èç2zA”ÑX¯#À­"âA”ÑX¯ƒ`Ó+ÅñA”ÑX±"à;b	×	A”ÑX±H T~ÚA”ÑX´1À>"ä3*A”ÑX´Jàn)­$¸A”ÑX´œ
¿Â‹A”ÑX´Ä Á¼
‰
A”ÑXµƒ ’ô,=4A”ÑXµ£@ÉŽ€
A”ÑXµÉ ©¹A”ÑX¶ Ä¥/$A”ÑX¶` *:Û	A”ÑXºÚàÖ¸1€A”ÑX»3 ..WsA”ÑX»¬b1è A”ÑX»ïà-u c	A”ÑX¼[ÀÝ¡ÊA”ÑX¼gŒ"&û
A”ÑX¼ôà	ýÍ.ÂA”ÑX½@¤£
úA”ÑX½ÂÀŒ'Ž+”àA”ÑXŹ =í=CA”ÑXÇÀ`»èA”ÑXÇø ”&)íA”ÑXÉ&À: Ü73¬A”ÑXÊT€t«*æHA”ÑXʪà	uNËA”ÑXÊÊ Q*•"nA”ÑXË`C¢
A”ÑXÌ8 +
ñÿAA”ÑXÌD@`+"A”ÑX̨`\0$"+A”ÑXÌÜ Ð)þA”ÑXÍ &·WA”ÑXÎî`Ÿ"ç!A”ÑXÏG à$q4'A”ÑXÐ/`å0§.n	A”ÑXЪD,±A”ÑXÑâ`A(¾A”ÑXÒ
€	b¡
A”ÑXÔ‡€
'/‰A”ÑXÖ€:*qA”ÑXÖh _5z%?>A”ÑXÖw 	èh"A”ÑX×)`
"#³'ÃNA”ÑXØ	#Ó..A”ÑXØ7 7‹j	A”ÑXØ_@'Ð-KA”ÑXØÖ`q'<™A”ÑXØðÀ”)àþA”ÑXÙ-À!@A”ÑXÙA@O%å-«A”ÑXÚ Lf‡ÏA”ÑXÚaŒ&˜lA”ÑXÚÙq(|<A”ÑXÛ(‘¸&+A”ÑXÛ‹`j6«ÁA”ÑXÛ±€	…ÒA”ÑXܨ ->,A”ÑXÜï@'L$NA”ÑXÜøÀ6,“.§?A”ÑXÝP`i.ŸÂ
A”ÑXݵ ä„1äA”ÑXÝñ€1%lA”ÑXÞn`˜ðYA”ÑXÞ¦À)!•#ëA”ÑXߞྨ%>A”ÑXß° Á§A”ÑXßÓ€’2üA”ÑXßéÀì!_A”ÑXàC@Ür€A”ÑXàf Ö ¥61A”ÑXá¤À àw"A”ÑXã*`:–‹&A”ÑXãV ¥
'ÃjA”ÑXã©€ž#_r
A”ÑXäà;2&#€A”ÑXä #2m	A”ÑXä6 ô
ÍA”ÑXä: s
®ìA”ÑXäZ@zê#A”ÑXä@¤%ÐA”ÑXå#€##9A”ÑXåÁ€a6ýA”ÑXåú`³3¦A”ÑXç  7=1|A”ÑXè@:Ž$A”ÑXèvà3Ý"A”ÑXèÉ€(-Û/ÓA”ÑXêoàÀ"CcA”ÑXêÄà#&,3¡A”ÑXêÝà'³2e
A”ÑXëÀRy;A”ÑXìnÀa';A”ÑXí• —ÅA”ÑXíïà_«3ÙA”ÑXî* è «=A”ÑXïf „,JA”ÑXïÑ€é+]A”ÑXðÀµ†AA”ÑXðµ€´Û$¡A”ÑXñ4@QA”ÑXó> ûž&A”ÑXó¬`ì
*	A”ÑXôÀ	—‘
A”ÑXöÀó"ƒ7A”ÑXöNÀ… HA”ÑXöi`/6€JZA”ÑXö’`
 8Þ?A”ÑX÷a (î!A”ÑX÷Öà2#!‰7A”ÑXù‘Àü)î%A”ÑXùö
¸*"ª	A”ÑXûÔ N%A”ÑXþ Ö
&A”ÑXþ6 ü0;'×A”ÑXþP€ép
A”ÑXÿ@õÚ30	A”ÑYB	#^)A”ÑYë!DA”ÑY ‘¸OA”ÑY—@}¨
¹A”ÑY× ¿´,{A”ÑY<àµ
c0A”ÑYL"XA”ÑY	D`µQ H
A”ÑY	zÀ2}RA”ÑY
= k1%6A”ÑY
Ó€
M\FA”ÑYGÞ]èeA”ÑYè`T(H
AӄY
n`9ÓA”ÑY
Ý ×
,/ A”ÑY`Ã+()1A”ÑYà
.&£A”ÑYpð%$'A”ÑY‡ ¾$Û7¼A”ÑY÷@z
 'pTA”ÑY–À!#1QA”ÑY9@§+šA”ÑY‰@•“iA”ÑYÅ`ƒ$¿=A”ÑYóਠÊA”ÑY
ô)'3eA”ÑYö@7$Á*AA”ÑY{€2+i&bA”ÑYâ@
þ%™%A”ÑY=w)
ÞA”ÑY¶ Í$ê!ì8A”ÑYíÃ3A”ÑY[@ù:
?A”ÑYÊàº+)ÂA”ÑYG@BEPA”ÑY)`í8A”ÑYFàÕ¢+’A”ÑYª`|
0 0QA”ÑY,€ )1A”ÑYR 
4
é,ó
A”ÑYº@0'¯âA”ÑYÅ ]4	)ûA”ÑYÒ@¨®‘A”ÑY" ª3W
A”ÑY"™`S%¢ A”ÑY#`m‡A”ÑY$:Àu*EA”ÑY$Èà	€$»2A”ÑY$Í 9!•A”ÑY%¬ %„	›A”ÑY%Ïà´È75A”ÑY%ç`)zMA”ÑY&=€ÿ!/'èA”ÑY&è 	ј2—&A”ÑY&õ c)45qA”ÑY' +sø
A”ÑY' Á$† »
AӄY'f
t›-°A”ÑY(ÀÇ2˜'A”ÑY)`	H%*!w¿A”ÑY)! 
	W&#A”ÑY)nà´„]ÏA”ÑY*­ …=aA”ÑY,€€ò11-oA”ÑY-Q@!VÁ+A”ÑY-ÿ@ !(
A”ÑY/¤à
…+,¿1A”ÑY1f mÂA”ÑY1 ¹	þ[A”ÑY1Ü`èA”ÑY2“@24¸
AӄY3
 2 A”ÑY3' ”~*A”ÑY3¹ 	
" 	A”ÑY4.@Ô©÷A”ÑY4¡À
7¸^
A”ÑY6œ@
¯I!½A”ÑY7~ 
x¨6ÙcA”ÑY7‰wôA”ÑY7­`ó
É,Î
A”ÑY8·€ŸA”ÑY9¢ .+ôJA”ÑY:»@O![,A”ÑY;`<ÿ'#A”ÑY;xàgÛRA”ÑY;Š÷Î
A”ÑY;¬€¹s#‹A”ÑY<¯@¼!S·A”ÑY<ÐÀr$™6PA”ÑY=y )#rA”ÑY=€ Ð8,DA”ÑY=ê Û0v+QA”ÑY>ôà7-)@A”ÑY?B 	ˆ#ž#A”ÑY?t€¼î)A”ÑY?ì€lá!¢A”ÑY@þ@
hÁ&8A”ÑYAZ@À-ðA”ÑYC0Àh+rA”ÑYC@þÊ8A”ÑYC…çŽÛ`A”ÑYD C!f‘-A”ÑYDÁ`,%¥FA”ÑYEJàâ(Ý1
A”ÑYF ž(tŽA”ÑYFYÀt`A”ÑYF¹ ¢±½QA”ÑYF퀛ä!ÅIA”ÑYG€I’)A”ÑYHh#
,­A”ÑYHÛ€B1²(ÕA”ÑYI~¾4ÍA”ÑYI`s•#A”ÑYI¯ #,ˆA”ÑYJó`Wï	A”ÑYK]€	Ù2A”ÑYLs`N	yA”ÑYM„ ðþ,A”ÑYP`Z%·É)A”ÑYQPà:"1,A”ÑYQ“ 7Þ'A”ÑYR·@(/?"-A”ÑYRé /ëé)A”ÑYS`ðó!¨LA”ÑYSÀ Ý&n=
A”ÑYT°@e;5lËA”ÑY™ O'7A”ÑY™ éµA”ÑY™ì ÃÍA”ÑYšˆQi+OA”ÑY›%‰yA”ÑY›@Y'-–vA”ÑY›Ú`µ`/dA”ÑYP`XB/A”ÑY^€Í4-A”ÑYž rÜÃ.A”ÑYžøà//-šA”ÑYŸI€±½¸A”ÑYŸ•€ô6ç#Á
A”ÑY úàDêA”ÑY¡Aà‰)×3	A”ÑY¡†àz$Î6ƒ6A”ÑY¡Ý tÞ
A”ÑY¡îaGA”ÑY¢K ÂË&A”ÑY£Ê$ãQA”ÑY£ÿ ¾#ƒA”ÑY¤€ÓA”ÑY¥)ÀžºA”ÑY¥;/‚!ÈA”ÑY¥‰`
z¯iwA”ÑY¦y µ.².3
A”ÑY¦Ÿ@ù.A.øA”ÑY¦¡€–T$v-A”ÑY¦ª@
s²%
A”ÑY§ 
!c 
A”ÑY§Àº
j(}
A”ÑY§9æ&/
A”ÑY§d€+4é+ª A”ÑY¨®€ú ¼ÂA”ÑY©1`²("«,A”ÑY©‹ î+ŠA”ÑYª;@R&É5OA”ÑYªi€¡%HÝA”ÑY«d€2	óg
A”ÑY¬QÀä+øéA”ÑY¬³`—
ô%¶HA”ÑY¬ò P\ E
A”ÑY®`”°+ÆA”ÑY¯´ â©!ÌEA”ÑY¯Þà¢ÔªA”ÑY°¢à}ÃÂ]A”ÑY±þ`Â
-(A”ÑY²~àB(A”ÑY³u ßË/A”ÑY´
 ps(SA”ÑY´, 
“@-Æ>A”ÑY´Ü@3ØMA”ÑYµå€^íŠA”ÑY¶XÀ3)9¿A”ÑY· ‡%ï!A”ÑY·±:Å$Í	A”ÑY¸Î`ã3â?A”ÑY¸ûàS/	-RA”ÑY¹  ÷%.5QA”ÑY¹’‰6K(ËA”ÑY¹ý v$öA”ÑY½`“%A¦5A”ÑY¾"àH A”ÑY¿= ™%!µ	A”ÑYÀ
3#D(A”ÑYà  	ì#øA”ÑYÃåÀ
k*ÚA”ÑYÃó Û
Ñ,(A”ÑYÄ5€ñIŽA”ÑYÄâ@rÎÅ A”ÑYÄëÀè »°
A”ÑYÆ) !0¼RA”ÑYÆV Z	'A”ÑYÆÆ@©-2)A”ÑYÇ`t1ârA”ÑYÇ Á.|àA”ÑYǹÀ
¬Ì7:A”ÑYȳ +!
-A”ÑYÈ÷Ú
ú/4A”ÑYÈþ`QîaA”ÑYÉ.@؈A”ÑYÉV¨a6cA”ÑYÊJ 2*ö¡	A”ÑYÊç§'Ò´A”ÑY˵ ËÓA”ÑYÌ ¿y*:A”ÑY̱ 
!
Å/¯
AӄY폈?
/.A”ÑYÌê þ5*Ñ:A”ÑYÍm€~)’!kA”ÑY̓â'ràA”ÑYÍ„ «dªA”ÑYÍ»€Û'HiA”ÑYÎK@aø)üLA”ÑYÏ#`	q d^A”ÑYÏe Ú")lA”ÑYω 5î A”ÑYÏ“ êe.'A”ÑY϶àÁ_$œA”ÑYÑs «,ÓA”ÑYÒd ô
,KA”ÑYÓðÙ%mA”ÑYÓaà

Q!¶A”ÑYÔPàB&íÌA”ÑYÔ`f$Ú¢A”ÑYÕC@ÒLcA”ÑYÕ²¦4÷A”ÑYÖ[`ÆA”ÑYÖeÀŠ<Ð
A”ÑYÖÞ€Ø+$
ØA”ÑYÖá }Z8/A”ÑYØù@Ó3;‰0A”ÑYÙ%€).\"à‘A”ÑYÙ{€	A”ÑYÚ Â
ò
„A”ÑYÚMÀãü2A”ÑYÜ5€û)jA”ÑYÝ<`	â;"×A”ÑYÞQà
µu,mlA”ÑYÞÕ&‘5»A”ÑYßB€UBý6A”ÑY߸@Ñ"دA”ÑYà@Ç%$ÚA”ÑYá+€›ÄA”ÑYá\ ·"½ß!A”ÑYã: Y%¡A”ÑYä¯t)ƒòA”ÑYäÀ³Ã#F/A”ÑYäÅÀ
>*AA”ÑYç#`o.œ=qA”ÑYç- þ )ÀA”ÑYçz 	H—³A”ÑYèM&•@-A”ÑYè} „-ð	A”ÑYê#à&&]A”ÑYê… ¤%¡ÐA”ÑYê¯àº÷ª
A”ÑYêÅ!Ü)–	A”ÑYë 	0,¢A”ÑYìàßý,ŠæA”ÑYì
Þ/0´A”ÑYì)$ `*g%A”ÑYîÀï8"oA”ÑYîÇ 
w/&Ù:A”ÑYïs ¬3!x)A”ÑY3*«
YA”ÑYï¾`Õ"±,Õ2A”ÑYðÄ@…
øgA”ÑYðüà¶	€	A”ÑYñbà
“4A”ÑYñl $&ÆH
A”ÑYñ«Õ!¼A”ÑYñÊ hßA”ÑYñØh ­&¨
A”ÑYñïà
ì†x"A”ÑYò@A"¨
â=A”ÑYó瀚£-A”ÑYõÍ@† –A”ÑYö16
á,]UA”ÑYöSÀï$r(îŽA”ÑYøH 	ƒ)DA”ÑYø`1î HuA”ÑYù^ %§*NA”ÑYùæ	âÍ8KA”ÑYù÷À	A”ÑYúË@—ÄËA”ÑYûz€_u$A”ÑYû”À	sñ	A”ÑYü‚àg$ÆA”ÑYýKÏX"¸A”ÑYýTÀ
V‡	A”ÑYþˆàX±/)A”ÑYþâÀ×g/…A”ÑYÿƒÀ0)Æ#¦
A”ÑYÿÉ€—'ôA”ÑYÿÿÀ
ü6*%A”ÑZS€­
^A”ÑZJ‡*A”ÑZgÀ
S„ødA”ÑZ`Àˆ*JW
A”ÑZÁ@û`xA”ÑZo€óÝA”ÑZUÀU5w!),A”ÑZœ »3A”ÑZ ?e2ë
A”ÑZ›À€á-A”ÑZ	W`£æ BA”ÑZ	Š€Ú!$UA”ÑZ	¬€	C)õIA”ÑZ
™€
V°A”ÑZ
Ä@9#Å4¶A”ÑZ`@O4Ø
AӄZiێ
4“A”ÑZé@›$c2
A”ÑZôl&v+‚A”ÑZ
ê@‰#VRA”ÑZþ
"6™÷A”ÑZ ´,@áA”ÑZ"tè
u4A”ÑZb`n„*dµA”ÑZ˜@	7+ëƒA”ÑZ¸`¯ù!hA”ÑZc€5 J åA”ÑZ˜À¸!ñA”ÑZ0
í##¶A”ÑZv`Á L%3DA”ÑZ
@Æ4ï9
A”ÑZÀš )NA”ÑZ,À¥!v×A”ÑZ• "9§¬A”ÑZ®ÀY3%SA”ÑZ"`E •èA”ÑZ¸[*«
A”ÑZš·#†#ìA”ÑZøHG&A”ÑZ; i!–)0	A”ÑZ\à	–½´äA”ÑZg Kì7îA”ÑZx€(öÍA”ÑZ}€Æ$:.c!A”ÑZÆ­(¤ß}A”ÑZí ó1J.‘	A”ÑZÝÀÜ/Ž2Õ-A”ÑZ€¯7	™A”ÑZ: /NÇ
A”ÑZœàè.®	A”ÑZÎ »"ëíA”ÑZO3¶øA”ÑZ®Â+
4V A”ÑZé`$ÊO!A”ÑZú€Én0A”ÑZ€ÉIaA”ÑZ 
àSs1¨A”ÑZ SÀD$9'I9A”ÑZ"à
y,h+A”ÑZ"ÀÀ)Á.JiA”ÑZ"§@q%ûB2A”ÑZ"ÍàÄ'L	’A”ÑZ#Cà HÄA”ÑZ#Ô`÷!#½FA”ÑZ$
m5¶A”ÑZ&Ô ‚CŸ	A”ÑZ(äóq39A”ÑZ)yæ*	-A”ÑZ)Þ@3•lA”ÑZ*R€C
f!A”ÑZ*º€C
î#p7A”ÑZ+` 
É
[A”ÑZ+{À¼»"l\A”ÑZ+© ÖÖ1ZtA”ÑZ,ý òøA”ÑZ-@Ï*¨—A”ÑZ-g éõ#e
A”ÑZ.˜
Š	1)¢A”ÑZ/Z 
ÃHÅA”ÑZ1QÀs  7A”ÑZ5| Z*Ÿ1¿	A”ÑZ5øà›&¥A”ÑZ6àLg
|A”ÑZ6‹àIÑ)­A”ÑZ6›À
d0DA”ÑZ7” Ñ
1A”ÑZ7í`&×!¶A”ÑZ8!Û 89eŠA”ÑZ8OÀþ9A”ÑZ8– ®*¦à1A”ÑZ8è@1	9%²A”ÑZ9`âc+l8A”ÑZ9V@â0Ó¶A”ÑZ9ö(~A”ÑZ:Àc$¢+©A”ÑZ;V 2#¼>FA”ÑZ;’ !“…A”ÑZÀ.Ü+VA”ÑZA	 Ñ2K!LA”ÑZAk`ù*ä´%A”ÑZA«€#Ì
ÉA”ÑZB¼à+(. A”ÑZCï@1#A”ÑZDþà!H)«A”ÑZG/`ªÎ\A”ÑZGª@)^|A”ÑZH.`ØÚ)/aA”ÑZH’à	ý'éèA”ÑZH•À<2+ÂA”ÑZH÷àG)66{A”ÑZI,à:"ä1õA”ÑZI“ üÅ–A”ÑZK“ E-,ÅA”ÑZKÎ`+8#Ò
A”ÑZLF ê'A”ÑZLNàí¿A”ÑZN! ö&O#¤A”ÑZN[@nÈåA”ÑZN ¦ }7—A”ÑZQF$”+ÖA”ÑZR¥`	4ÁA”ÑZRø€-$3óA”ÑZS_`Å"Ü5UA”ÑZS£ 8/.2ÖƒA”ÑZTl€Þ*/~‚A”ÑZUà
3~¿ A”ÑZV:@u7/sfA”ÑZVFà¬à1OA”ÑZVXà‰&A–	A”ÑZWU€7™A”ÑZW»@Ö	E#A”ÑZWÃÀ‰Ÿ$ú
A”ÑZWä $¥fA”ÑZX `¬
ÕØA”ÑZX3 +9ÅBA”ÑZXÕ€î&ŠA”ÑZY³€r#1/ðA”ÑZYÁ€_	XA”ÑZYÅ€¹L2[A”ÑZZ* j.2&A”ÑZ[b Þƒ-—8A”ÑZ[k/ÍÏ4A”ÑZ[  ¦-Û
UAӄZ\ʊ#d
A”ÑZ\”À
=#^
A”ÑZ\²Àj
Ý%j
A”ÑZ]M ã2$LA”ÑZ]xÀz
œ>A”ÑZ]Ê€ê(&„A”ÑZ]Êà
Ò&Ç;A”ÑZ]Ö Ý!ê+ÿ A”ÑZ^ F'¼(xfA”ÑZ_Þ€	ÖÃ/§
A”ÑZ`iàY3z*[A”ÑZaf`1/ŒA”ÑZa¡ R¹Ò­A”ÑZb#@üzärA”ÑZbÍ@DKWA”ÑZcoà¥4L'ŽA”ÑZcƒ	¤M8™:A”ÑZd'`Ø™SA”ÑZde@Ê]A”ÑZdh )A”ÑZdž@þ
»(ÊRA”ÑZdÓ {$'
A”ÑZdû
¸#¥œ
A”ÑZe« Q*F*‰
A”ÑZf)àžÐ,v}A”ÑZfßàI*«
A”ÑZh€ó%S¸"A”ÑZh– R S'A”ÑZi ¡4&­	A”ÑZiÇ b!iÄdA”ÑZjtB*P#A”ÑZjC€	y#ùˆA”ÑZjZàø$·8A”ÑZjÅ€À$C6;+A”ÑZk ¾ÎA”ÑZk* Ê(»
A”ÑZkHà+ô#œ	A”ÑZk¢à;¹»æA”ÑZl< „"A”ÑZmö eÓ%>A”ÑZo á53˜A”ÑZoÀä01
A”ÑZoâ Øu,áA”ÑZpH€ž&	ÈA”ÑZp`€5'fGA”ÑZq9@íPHA”ÑZquà*m4S
A”ÑZr׎3í&A”ÑZsd`
„/áJ	A”ÑZt ñËDA”ÑZuxÀV$Q$6A”ÑZv?€›)Ó÷VA”ÑZvKàTÉ¿A”ÑZv_†“#¶A”ÑZvË 
½Œ
A”ÑZw7@úž/`A”ÑZxD@¥+Ô;A”ÑZy% Ñ T,cA”ÑZyÊ`B//CA”ÑZyæ â0«+‘A”ÑZz-@Ê!Q*ËA”ÑZ{F 	5A4A”ÑZ|I4
1˜A”ÑZ|\cº+oA”ÑZ|î`	•8²!·A”ÑZ}R ˜)N!èA”ÑZ}lÀ
YICA”ÑZ}v`.sÑA”ÑZ~™ ›	O, A”ÑZ7`	°$`,znA”ÑZ­à$ü¡¡A”ÑZ·ÀÛQÃA”ÑZçÀ¤!ædA”ÑZ€SÀöï3A”ÑZ€§€sй	A”ÑZ‚ÚàÈhA”ÑZ„k€á5"W?A”ÑZ„Ï AÍ%,A”ÑZ„çÀŒ*ú/mA”ÑZ…fŸ' A”ÑZ…`0þ…
A”ÑZ…Â@×$"ÓA”ÑZ†E€
-
Œ%'$A”ÑZ†nÀ
[AwA”ÑZ‡ #ú#Ž5A”ÑZ‡qà
…+Œ'þA”ÑZˆÀ
ÑwA”ÑZŠî€¨šA”ÑZ‹ð@ó'Ä04A”ÑZŒ ÞÞéA”ÑZŒí@Êì'~A”ÑZ¯@Ž^#L
A”ÑZa€
pà8¼A”ÑZ¢à*$âA”ÑZÆ`J#(&òA”ÑZNàÒA”ÑZ”; 3$±+÷A”ÑZ”\ÀSß1ŠA”ÑZ–—`Z9?gA”ÑZ—ZÀ¡/‚%A”ÑZ˜ {›ãA”ÑZ˜]À(Ï(ÔA”ÑZ™·@	È®)
A”ÑZšàD¸¡A”ÑZš™à>"ý0A”ÑZ›ª@_•¼A”ÑZœ_À	+O¹A”ÑZœ‰/˜+ñ	A”ÑZœ¶ Â
Ø)sA”ÑZœí€ "(œ	A”ÑZ†€%
ZA”ÑZÃàš/ç>A”ÑZž*2¬¦A”ÑZŸ® îLVA”ÑZ¡Ë€É½n-A”ÑZ¢ ¹)ø#ÓA”ÑZ¢p€h&&A”ÑZ¢½ i	é)¦9A”ÑZ¢ãÚ'A”ÑZ£U A-¸A”ÑZ£…À³ß%y	A”ÑZ£ù`ß¼bOA”ÑZ¤UÀõ3´PA”ÑZ¤©à‰&Á$œA”ÑZ¥-
5UA”ÑZ¥´ ™$×
A”ÑZ§‰@,Ë@
A”ÑZ¨F@'*ë
A”ÑZ¨H`E4N,.A”ÑZ¨ƒ@fs&×A”ÑZ¨‘€ô&ÿA”ÑZ©] ´5Ø#
A”ÑZ©j ,%0<
A”ÑZª# 
p.b1A”ÑZ«EÀŽ•)ÄA”ÑZ¬ªà	ç"â/A”ÑZ¬Ö@Ó%¼0QA”ÑZ­ !Â!9}A”ÑZ®u@G‹#|
A”ÑZ®Š 
y)b%A”ÑZ®£@ФlA”ÑZ®ñ€Û!7iA”ÑZ°ZS/&)A”ÑZ± è0=2ó&A”ÑZ²+@"Mg#A”ÑZ²àV'‘ÿA”ÑZ²å€
àÝA”ÑZ³_à¤
A”ÑZ³z€I7A”ÑZ³¤È'î*L	A”ÑZµ9@	(‚ _A”ÑZ¶?À^1EA”ÑZ¸Œ 6Šh!A”ÑZ¹Ù`-,ÒÊ=A”ÑZ¹ù Å#ÿ'yA”ÑZº_ 
Ø7eëA”ÑZº€"­JA”ÑZº’ 
'±7?A”ÑZ»cÀ>
¢$¥A”ÑZ»Ë€
—0(ÆA”ÑZ¼ƒ`‡t8ïA”ÑZ½)À¯
èA”ÑZ½²@Î- 	A”ÑZ½åÀs™›A”ÑZ¾V€h„A”ÑZ¿tiA”ÑZ¿Ëà•`+vA”ÑZÁ7 	³% þèA”ÑZÁ…à=9;~	A”ÑZÁ“ ”+$ÎA”ÑZÁ¢ ß³!ü“A”ÑZÁð « odA”ÑZ‚ÀÜ!\Â
A”ÑZÂ…@Â'y,¨A”ÑZ¬àäGaA”ÑZÃïàÑæ*r
A”ÑZÄnÀ	î'!
	A”ÑZÄÍÀï1ºuA”ÑZÄ× ÿ0 Y
A”ÑZÆ*` ë3¢EA”ÑZƪ`	F
A”ÑZÈEàcfitsio-3.47/iter_image.c0000644000225700000360000000600413464573432014661 0ustar  cagordonlhea#include 
#include 
#include 
#include "fitsio.h"

/*
  This program illustrates how to use the CFITSIO iterator function.
  It reads and modifies the input 'iter_image.fit' image file by setting
  all the pixel values to zero (DESTROYING THE ORIGINAL IMAGE!!!)
*/
main()
{
    extern zero_image(); /* external work function is passed to the iterator */
    fitsfile *fptr;
    iteratorCol cols[3];  /* structure used by the iterator function */
    int n_cols;
    long rows_per_loop, offset;

    int status, nkeys, keypos, hdutype, ii, jj;
    char filename[]  = "iter_image.fit";     /* name of rate FITS file */

    status = 0; 

    fits_open_file(&fptr, filename, READWRITE, &status); /* open file */


    n_cols = 1;

    /* define input column structure members for the iterator function */
    fits_iter_set_file(&cols[0], fptr);
    fits_iter_set_iotype(&cols[0], InputOutputCol);
    fits_iter_set_datatype(&cols[0], 0);

    rows_per_loop = 0;  /* use default optimum number of rows */
    offset = 0;         /* process all the rows */

    /* apply the rate function to each row of the table */
    printf("Calling iterator function...%d\n", status);

    fits_iterate_data(n_cols, cols, offset, rows_per_loop,
                      zero_image, 0L, &status);

    fits_close_file(fptr, &status);      /* all done */

    if (status)
        fits_report_error(stderr, status);  /* print out error messages */

    return(status);
}
/*--------------------------------------------------------------------------*/
int zero_image(long totalrows, long offset, long firstrow, long nrows,
             int ncols, iteratorCol *cols, void *user_strct ) 

/*
   Sample iterator function that calculates the output flux 'rate' column
   by dividing the input 'counts' by the 'time' column.
   It also applies a constant deadtime correction factor if the 'deadtime'
   keyword exists.  Finally, this creates or updates the 'LIVETIME'
   keyword with the sum of all the individual integration times.
*/
{
    int ii, status = 0;

    /* declare variables static to preserve their values between calls */
    static int *counts;

    /*--------------------------------------------------------*/
    /*  Initialization procedures: execute on the first call  */
    /*--------------------------------------------------------*/
    if (firstrow == 1)
    {
       if (ncols != 1)
           return(-1);  /* number of columns incorrect */

       /* assign the input pointers to the appropriate arrays and null ptrs*/
       counts       = (int *)  fits_iter_get_array(&cols[0]);
    }

    /*--------------------------------------------*/
    /*  Main loop: process all the rows of data */
    /*--------------------------------------------*/

    /*  NOTE: 1st element of array is the null pixel value!  */
    /*  Loop from 1 to nrows, not 0 to nrows - 1.  */

    for (ii = 1; ii <= nrows; ii++)
    {
       counts[ii] = 1.;
    }
    printf("firstrows, nrows = %d %d\n", firstrow, nrows);
    
    return(0);  /* return successful status */
}
cfitsio-3.47/iter_var.c0000644000225700000360000000636713464573432014403 0ustar  cagordonlhea#include 
#include 
#include 
#include "fitsio.h"

/*
  This program illustrates how to use the CFITSIO iterator function.
  It reads and modifies the input 'iter_a.fit' file by computing a
  value for the 'rate' column as a function of the values in the other
  'counts' and 'time' columns.
*/
main()
{
    extern flux_rate(); /* external work function is passed to the iterator */
    fitsfile *fptr;
    iteratorCol cols[3];  /* structure used by the iterator function */
    int n_cols;
    long rows_per_loop, offset;

    int status, nkeys, keypos, hdutype, ii, jj;
    char filename[]  = "vari.fits";     /* name of rate FITS file */

    status = 0; 

    fits_open_file(&fptr, filename, READWRITE, &status); /* open file */

    /* move to the desired binary table extension */
    if (fits_movnam_hdu(fptr, BINARY_TBL, "COMPRESSED_IMAGE", 0, &status) )
        fits_report_error(stderr, status);    /* print out error messages */

    n_cols  = 1;   /* number of columns */

    /* define input column structure members for the iterator function */
    fits_iter_set_by_name(&cols[0], fptr, "COMPRESSED_DATA", 0,  InputCol);

    rows_per_loop = 0;  /* use default optimum number of rows */
    offset = 0;         /* process all the rows */

    /* apply the rate function to each row of the table */
    printf("Calling iterator function...%d\n", status);

    fits_iterate_data(n_cols, cols, offset, rows_per_loop,
                      flux_rate, 0L, &status);

    fits_close_file(fptr, &status);      /* all done */

    if (status)
        fits_report_error(stderr, status);  /* print out error messages */

    return(status);
}
/*--------------------------------------------------------------------------*/
int flux_rate(long totalrows, long offset, long firstrow, long nrows,
             int ncols, iteratorCol *cols, void *user_strct ) 

/*
   Sample iterator function that calculates the output flux 'rate' column
   by dividing the input 'counts' by the 'time' column.
   It also applies a constant deadtime correction factor if the 'deadtime'
   keyword exists.  Finally, this creates or updates the 'LIVETIME'
   keyword with the sum of all the individual integration times.
*/
{
    int ii, status = 0;
    long repeat;

    /* declare variables static to preserve their values between calls */
    static unsigned char *counts;

    /*--------------------------------------------------------*/
    /*  Initialization procedures: execute on the first call  */
    /*--------------------------------------------------------*/
    if (firstrow == 1)
    {

printf("Datatype of column = %d\n",fits_iter_get_datatype(&cols[0]));

       /* assign the input pointers to the appropriate arrays and null ptrs*/
       counts       = (long *)  fits_iter_get_array(&cols[0]);

    }

    /*--------------------------------------------*/
    /*  Main loop: process all the rows of data */
    /*--------------------------------------------*/

    /*  NOTE: 1st element of array is the null pixel value!  */
    /*  Loop from 1 to nrows, not 0 to nrows - 1.  */


    for (ii = 1; ii <= nrows; ii++)
    {
       repeat = fits_iter_get_repeat(&cols[0]);
       printf ("repeat = %d, %d\n",repeat, counts[1]);
       
    }


    return(0);  /* return successful status */
}
cfitsio-3.47/License.txt0000644000225700000360000000260213464573432014533 0ustar  cagordonlheaCopyright (Unpublished--all rights reserved under the copyright laws of
the United States), U.S. Government as represented by the Administrator
of the National Aeronautics and Space Administration.  No copyright is
claimed in the United States under Title 17, U.S. Code.

Permission to freely use, copy, modify, and distribute this software
and its documentation without fee is hereby granted, provided that this
copyright notice and disclaimer of warranty appears in all copies.

DISCLAIMER:

THE SOFTWARE IS PROVIDED 'AS IS' WITHOUT ANY WARRANTY OF ANY KIND,
EITHER EXPRESSED, IMPLIED, OR STATUTORY, INCLUDING, BUT NOT LIMITED TO,
ANY WARRANTY THAT THE SOFTWARE WILL CONFORM TO SPECIFICATIONS, ANY
IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
PURPOSE, AND FREEDOM FROM INFRINGEMENT, AND ANY WARRANTY THAT THE
DOCUMENTATION WILL CONFORM TO THE SOFTWARE, OR ANY WARRANTY THAT THE
SOFTWARE WILL BE ERROR FREE.  IN NO EVENT SHALL NASA BE LIABLE FOR ANY
DAMAGES, INCLUDING, BUT NOT LIMITED TO, DIRECT, INDIRECT, SPECIAL OR
CONSEQUENTIAL DAMAGES, ARISING OUT OF, RESULTING FROM, OR IN ANY WAY
CONNECTED WITH THIS SOFTWARE, WHETHER OR NOT BASED UPON WARRANTY,
CONTRACT, TORT , OR OTHERWISE, WHETHER OR NOT INJURY WAS SUSTAINED BY
PERSONS OR PROPERTY OR OTHERWISE, AND WHETHER OR NOT LOSS WAS SUSTAINED
FROM, OR AROSE OUT OF THE RESULTS OF, OR USE OF, THE SOFTWARE OR
SERVICES PROVIDED HEREUNDER.
cfitsio-3.47/longnam.h0000644000225700000360000005236513464573432014227 0ustar  cagordonlhea#ifndef _LONGNAME_H
#define _LONGNAME_H

#define fits_parse_input_url ffiurl
#define fits_parse_input_filename ffifile
#define fits_parse_rootname ffrtnm
#define fits_file_exists    ffexist
#define fits_parse_output_url ffourl
#define fits_parse_extspec  ffexts
#define fits_parse_extnum   ffextn
#define fits_parse_binspec  ffbins
#define fits_parse_binrange ffbinr
#define fits_parse_range    ffrwrg
#define fits_parse_rangell    ffrwrgll
#define fits_open_memfile   ffomem

/* 
   use the following special macro to test that the fitsio.h include file
   that was used to build the CFITSIO library is compatible with the version
   as included when compiling the application program
*/
#define fits_open_file(A, B, C, D)  ffopentest( CFITSIO_SONAME, A, B, C, D)

#define fits_open_data      ffdopn
#define fits_open_extlist   ffeopn
#define fits_open_table     fftopn
#define fits_open_image     ffiopn
#define fits_open_diskfile  ffdkopn
#define fits_reopen_file    ffreopen
#define fits_create_file    ffinit
#define fits_create_diskfile ffdkinit
#define fits_create_memfile ffimem
#define fits_create_template fftplt
#define fits_flush_file     ffflus
#define fits_flush_buffer   ffflsh
#define fits_close_file     ffclos
#define fits_delete_file    ffdelt
#define fits_file_name      ffflnm
#define fits_file_mode      ffflmd
#define fits_url_type       ffurlt

#define fits_get_version    ffvers
#define fits_uppercase      ffupch
#define fits_get_errstatus  ffgerr
#define fits_write_errmsg   ffpmsg
#define fits_write_errmark  ffpmrk
#define fits_read_errmsg    ffgmsg
#define fits_clear_errmsg   ffcmsg
#define fits_clear_errmark  ffcmrk
#define fits_report_error   ffrprt
#define fits_compare_str    ffcmps
#define fits_test_keyword   fftkey
#define fits_test_record    fftrec
#define fits_null_check     ffnchk
#define fits_make_keyn      ffkeyn
#define fits_make_nkey      ffnkey
#define fits_make_key       ffmkky
#define fits_get_keyclass   ffgkcl
#define fits_get_keytype    ffdtyp
#define fits_get_inttype    ffinttyp
#define fits_parse_value    ffpsvc
#define fits_get_keyname    ffgknm
#define fits_parse_template ffgthd
#define fits_ascii_tform    ffasfm
#define fits_binary_tform   ffbnfm
#define fits_binary_tformll   ffbnfmll
#define fits_get_tbcol      ffgabc
#define fits_get_rowsize    ffgrsz
#define fits_get_col_display_width    ffgcdw

#define fits_write_record       ffprec
#define fits_write_key          ffpky
#define fits_write_key_unit     ffpunt
#define fits_write_comment      ffpcom
#define fits_write_history      ffphis 
#define fits_write_date         ffpdat
#define fits_get_system_time    ffgstm
#define fits_get_system_date    ffgsdt
#define fits_date2str           ffdt2s
#define fits_time2str           fftm2s
#define fits_str2date           ffs2dt
#define fits_str2time           ffs2tm
#define fits_write_key_longstr  ffpkls
#define fits_write_key_longwarn ffplsw
#define fits_write_key_null     ffpkyu
#define fits_write_key_str      ffpkys
#define fits_write_key_log      ffpkyl
#define fits_write_key_lng      ffpkyj
#define fits_write_key_ulng     ffpkyuj
#define fits_write_key_fixflt   ffpkyf
#define fits_write_key_flt      ffpkye
#define fits_write_key_fixdbl   ffpkyg
#define fits_write_key_dbl      ffpkyd
#define fits_write_key_fixcmp   ffpkfc
#define fits_write_key_cmp      ffpkyc
#define fits_write_key_fixdblcmp ffpkfm
#define fits_write_key_dblcmp   ffpkym
#define fits_write_key_triple   ffpkyt
#define fits_write_tdim         ffptdm
#define fits_write_tdimll       ffptdmll
#define fits_write_keys_str     ffpkns
#define fits_write_keys_log     ffpknl
#define fits_write_keys_lng     ffpknj
#define fits_write_keys_fixflt  ffpknf
#define fits_write_keys_flt     ffpkne
#define fits_write_keys_fixdbl  ffpkng
#define fits_write_keys_dbl     ffpknd
#define fits_copy_key           ffcpky
#define fits_write_imghdr       ffphps
#define fits_write_imghdrll     ffphpsll
#define fits_write_grphdr       ffphpr
#define fits_write_grphdrll     ffphprll
#define fits_write_atblhdr      ffphtb
#define fits_write_btblhdr      ffphbn
#define fits_write_exthdr       ffphext
#define fits_write_key_template ffpktp

#define fits_get_hdrspace      ffghsp
#define fits_get_hdrpos        ffghps
#define fits_movabs_key        ffmaky
#define fits_movrel_key        ffmrky
#define fits_find_nextkey      ffgnxk

#define fits_read_record       ffgrec
#define fits_read_card         ffgcrd
#define fits_read_str          ffgstr
#define fits_read_key_unit     ffgunt
#define fits_read_keyn         ffgkyn
#define fits_read_key          ffgky
#define fits_read_keyword      ffgkey
#define fits_read_key_str      ffgkys
#define fits_read_key_log      ffgkyl
#define fits_read_key_lng      ffgkyj
#define fits_read_key_lnglng   ffgkyjj
#define fits_read_key_ulnglng  ffgkyujj
#define fits_read_key_flt      ffgkye
#define fits_read_key_dbl      ffgkyd
#define fits_read_key_cmp      ffgkyc
#define fits_read_key_dblcmp   ffgkym
#define fits_read_key_triple   ffgkyt
#define fits_get_key_strlen    ffgksl
#define fits_read_key_longstr  ffgkls
#define fits_read_string_key   ffgsky
#define fits_free_memory       fffree
#define fits_read_tdim         ffgtdm
#define fits_read_tdimll       ffgtdmll
#define fits_decode_tdim       ffdtdm
#define fits_decode_tdimll     ffdtdmll
#define fits_read_keys_str     ffgkns
#define fits_read_keys_log     ffgknl
#define fits_read_keys_lng     ffgknj
#define fits_read_keys_lnglng  ffgknjj
#define fits_read_keys_flt     ffgkne
#define fits_read_keys_dbl     ffgknd
#define fits_read_imghdr       ffghpr
#define fits_read_imghdrll     ffghprll
#define fits_read_atblhdr      ffghtb
#define fits_read_btblhdr      ffghbn
#define fits_read_atblhdrll    ffghtbll
#define fits_read_btblhdrll    ffghbnll
#define fits_hdr2str           ffhdr2str
#define fits_convert_hdr2str   ffcnvthdr2str

#define fits_update_card       ffucrd
#define fits_update_key        ffuky
#define fits_update_key_null   ffukyu
#define fits_update_key_str    ffukys
#define fits_update_key_longstr    ffukls
#define fits_update_key_log    ffukyl
#define fits_update_key_lng    ffukyj
#define fits_update_key_fixflt ffukyf
#define fits_update_key_flt    ffukye
#define fits_update_key_fixdbl ffukyg
#define fits_update_key_dbl    ffukyd
#define fits_update_key_fixcmp ffukfc
#define fits_update_key_cmp    ffukyc
#define fits_update_key_fixdblcmp ffukfm
#define fits_update_key_dblcmp ffukym

#define fits_modify_record     ffmrec
#define fits_modify_card       ffmcrd
#define fits_modify_name       ffmnam
#define fits_modify_comment    ffmcom
#define fits_modify_key_null   ffmkyu
#define fits_modify_key_str    ffmkys
#define fits_modify_key_longstr    ffmkls
#define fits_modify_key_log    ffmkyl
#define fits_modify_key_lng    ffmkyj
#define fits_modify_key_fixflt ffmkyf
#define fits_modify_key_flt    ffmkye
#define fits_modify_key_fixdbl ffmkyg
#define fits_modify_key_dbl    ffmkyd
#define fits_modify_key_fixcmp ffmkfc
#define fits_modify_key_cmp    ffmkyc
#define fits_modify_key_fixdblcmp ffmkfm
#define fits_modify_key_dblcmp ffmkym

#define fits_insert_record     ffirec
#define fits_insert_card       ffikey
#define fits_insert_key_null   ffikyu
#define fits_insert_key_str    ffikys
#define fits_insert_key_longstr    ffikls
#define fits_insert_key_log    ffikyl
#define fits_insert_key_lng    ffikyj
#define fits_insert_key_fixflt ffikyf
#define fits_insert_key_flt    ffikye
#define fits_insert_key_fixdbl ffikyg
#define fits_insert_key_dbl    ffikyd
#define fits_insert_key_fixcmp ffikfc
#define fits_insert_key_cmp    ffikyc
#define fits_insert_key_fixdblcmp ffikfm
#define fits_insert_key_dblcmp ffikym

#define fits_delete_key     ffdkey
#define fits_delete_str     ffdstr
#define fits_delete_record  ffdrec
#define fits_get_hdu_num    ffghdn
#define fits_get_hdu_type   ffghdt
#define fits_get_hduaddr    ffghad
#define fits_get_hduaddrll    ffghadll
#define fits_get_hduoff     ffghof

#define fits_get_img_param  ffgipr
#define fits_get_img_paramll  ffgiprll

#define fits_get_img_type   ffgidt
#define fits_get_img_equivtype   ffgiet
#define fits_get_img_dim    ffgidm
#define fits_get_img_size   ffgisz
#define fits_get_img_sizell   ffgiszll

#define fits_movabs_hdu     ffmahd
#define fits_movrel_hdu     ffmrhd
#define fits_movnam_hdu     ffmnhd
#define fits_get_num_hdus   ffthdu
#define fits_create_img     ffcrim
#define fits_create_imgll   ffcrimll
#define fits_create_tbl     ffcrtb
#define fits_create_hdu     ffcrhd
#define fits_insert_img     ffiimg
#define fits_insert_imgll   ffiimgll
#define fits_insert_atbl    ffitab
#define fits_insert_btbl    ffibin
#define fits_resize_img     ffrsim
#define fits_resize_imgll   ffrsimll

#define fits_delete_hdu     ffdhdu
#define fits_copy_hdu       ffcopy
#define fits_copy_file      ffcpfl
#define fits_copy_header    ffcphd
#define fits_copy_data      ffcpdt
#define fits_write_hdu      ffwrhdu

#define fits_set_hdustruc   ffrdef
#define fits_set_hdrsize    ffhdef
#define fits_write_theap    ffpthp

#define fits_encode_chksum  ffesum
#define fits_decode_chksum  ffdsum
#define fits_write_chksum   ffpcks
#define fits_update_chksum  ffupck
#define fits_verify_chksum  ffvcks
#define fits_get_chksum     ffgcks

#define fits_set_bscale     ffpscl
#define fits_set_tscale     fftscl
#define fits_set_imgnull    ffpnul
#define fits_set_btblnull   fftnul
#define fits_set_atblnull   ffsnul

#define fits_get_colnum     ffgcno
#define fits_get_colname    ffgcnn
#define fits_get_coltype    ffgtcl
#define fits_get_coltypell  ffgtclll
#define fits_get_eqcoltype  ffeqty
#define fits_get_eqcoltypell ffeqtyll
#define fits_get_num_rows   ffgnrw
#define fits_get_num_rowsll   ffgnrwll
#define fits_get_num_cols   ffgncl
#define fits_get_acolparms  ffgacl
#define fits_get_bcolparms  ffgbcl
#define fits_get_bcolparmsll  ffgbclll

#define fits_iterate_data   ffiter

#define fits_read_grppar_byt  ffggpb
#define fits_read_grppar_sbyt  ffggpsb
#define fits_read_grppar_usht  ffggpui
#define fits_read_grppar_ulng  ffggpuj
#define fits_read_grppar_ulnglng  ffggpujj
#define fits_read_grppar_sht  ffggpi
#define fits_read_grppar_lng  ffggpj
#define fits_read_grppar_lnglng  ffggpjj
#define fits_read_grppar_int  ffggpk
#define fits_read_grppar_uint  ffggpuk
#define fits_read_grppar_flt  ffggpe
#define fits_read_grppar_dbl  ffggpd

#define fits_read_pix         ffgpxv
#define fits_read_pixll       ffgpxvll
#define fits_read_pixnull     ffgpxf
#define fits_read_pixnullll   ffgpxfll
#define fits_read_img         ffgpv
#define fits_read_imgnull     ffgpf
#define fits_read_img_byt     ffgpvb
#define fits_read_img_sbyt     ffgpvsb
#define fits_read_img_usht     ffgpvui
#define fits_read_img_ulng     ffgpvuj
#define fits_read_img_sht     ffgpvi
#define fits_read_img_lng     ffgpvj
#define fits_read_img_ulnglng     ffgpvujj
#define fits_read_img_lnglng     ffgpvjj
#define fits_read_img_uint     ffgpvuk
#define fits_read_img_int     ffgpvk
#define fits_read_img_flt     ffgpve
#define fits_read_img_dbl     ffgpvd

#define fits_read_imgnull_byt ffgpfb
#define fits_read_imgnull_sbyt ffgpfsb
#define fits_read_imgnull_usht ffgpfui
#define fits_read_imgnull_ulng ffgpfuj
#define fits_read_imgnull_sht ffgpfi
#define fits_read_imgnull_lng ffgpfj
#define fits_read_imgnull_ulnglng ffgpfujj
#define fits_read_imgnull_lnglng ffgpfjj
#define fits_read_imgnull_uint ffgpfuk
#define fits_read_imgnull_int ffgpfk
#define fits_read_imgnull_flt ffgpfe
#define fits_read_imgnull_dbl ffgpfd

#define fits_read_2d_byt      ffg2db
#define fits_read_2d_sbyt     ffg2dsb
#define fits_read_2d_usht      ffg2dui
#define fits_read_2d_ulng      ffg2duj
#define fits_read_2d_sht      ffg2di
#define fits_read_2d_lng      ffg2dj
#define fits_read_2d_ulnglng      ffg2dujj
#define fits_read_2d_lnglng      ffg2djj
#define fits_read_2d_uint      ffg2duk
#define fits_read_2d_int      ffg2dk
#define fits_read_2d_flt      ffg2de
#define fits_read_2d_dbl      ffg2dd

#define fits_read_3d_byt      ffg3db
#define fits_read_3d_sbyt      ffg3dsb
#define fits_read_3d_usht      ffg3dui
#define fits_read_3d_ulng      ffg3duj
#define fits_read_3d_sht      ffg3di
#define fits_read_3d_lng      ffg3dj
#define fits_read_3d_ulnglng      ffg3dujj
#define fits_read_3d_lnglng      ffg3djj
#define fits_read_3d_uint      ffg3duk
#define fits_read_3d_int      ffg3dk
#define fits_read_3d_flt      ffg3de
#define fits_read_3d_dbl      ffg3dd

#define fits_read_subset      ffgsv
#define fits_read_subset_byt  ffgsvb
#define fits_read_subset_sbyt  ffgsvsb
#define fits_read_subset_usht  ffgsvui
#define fits_read_subset_ulng  ffgsvuj
#define fits_read_subset_sht  ffgsvi
#define fits_read_subset_lng  ffgsvj
#define fits_read_subset_ulnglng  ffgsvujj
#define fits_read_subset_lnglng  ffgsvjj
#define fits_read_subset_uint  ffgsvuk
#define fits_read_subset_int  ffgsvk
#define fits_read_subset_flt  ffgsve
#define fits_read_subset_dbl  ffgsvd

#define fits_read_subsetnull_byt ffgsfb
#define fits_read_subsetnull_sbyt ffgsfsb
#define fits_read_subsetnull_usht ffgsfui
#define fits_read_subsetnull_ulng ffgsfuj
#define fits_read_subsetnull_sht ffgsfi
#define fits_read_subsetnull_lng ffgsfj
#define fits_read_subsetnull_ulnglng ffgsfujj
#define fits_read_subsetnull_lnglng ffgsfjj
#define fits_read_subsetnull_uint ffgsfuk
#define fits_read_subsetnull_int ffgsfk
#define fits_read_subsetnull_flt ffgsfe
#define fits_read_subsetnull_dbl ffgsfd

#define ffcpimg fits_copy_image_section
#define fits_compress_img fits_comp_img
#define fits_decompress_img fits_decomp_img

#define fits_read_col        ffgcv
#define fits_read_colnull    ffgcf
#define fits_read_col_str    ffgcvs
#define fits_read_col_log    ffgcvl
#define fits_read_col_byt    ffgcvb
#define fits_read_col_sbyt    ffgcvsb
#define fits_read_col_usht    ffgcvui
#define fits_read_col_ulng    ffgcvuj
#define fits_read_col_sht    ffgcvi
#define fits_read_col_lng    ffgcvj
#define fits_read_col_ulnglng    ffgcvujj
#define fits_read_col_lnglng    ffgcvjj
#define fits_read_col_uint    ffgcvuk
#define fits_read_col_int    ffgcvk
#define fits_read_col_flt    ffgcve
#define fits_read_col_dbl    ffgcvd
#define fits_read_col_cmp    ffgcvc
#define fits_read_col_dblcmp ffgcvm
#define fits_read_col_bit    ffgcx
#define fits_read_col_bit_usht ffgcxui
#define fits_read_col_bit_uint ffgcxuk

#define fits_read_colnull_str    ffgcfs
#define fits_read_colnull_log    ffgcfl
#define fits_read_colnull_byt    ffgcfb
#define fits_read_colnull_sbyt    ffgcfsb
#define fits_read_colnull_usht    ffgcfui
#define fits_read_colnull_ulng    ffgcfuj
#define fits_read_colnull_sht    ffgcfi
#define fits_read_colnull_lng    ffgcfj
#define fits_read_colnull_ulnglng    ffgcfujj
#define fits_read_colnull_lnglng    ffgcfjj
#define fits_read_colnull_uint    ffgcfuk
#define fits_read_colnull_int    ffgcfk
#define fits_read_colnull_flt    ffgcfe
#define fits_read_colnull_dbl    ffgcfd
#define fits_read_colnull_cmp    ffgcfc
#define fits_read_colnull_dblcmp ffgcfm

#define fits_read_descript ffgdes
#define fits_read_descriptll ffgdesll
#define fits_read_descripts ffgdess
#define fits_read_descriptsll ffgdessll
#define fits_read_tblbytes    ffgtbb

#define fits_write_grppar_byt ffpgpb
#define fits_write_grppar_sbyt ffpgpsb
#define fits_write_grppar_usht ffpgpui
#define fits_write_grppar_ulng ffpgpuj
#define fits_write_grppar_sht ffpgpi
#define fits_write_grppar_lng ffpgpj
#define fits_write_grppar_ulnglng ffpgpujj
#define fits_write_grppar_lnglng ffpgpjj
#define fits_write_grppar_uint ffpgpuk
#define fits_write_grppar_int ffpgpk
#define fits_write_grppar_flt ffpgpe
#define fits_write_grppar_dbl ffpgpd

#define fits_write_pix        ffppx
#define fits_write_pixll      ffppxll
#define fits_write_pixnull    ffppxn
#define fits_write_pixnullll  ffppxnll
#define fits_write_img        ffppr
#define fits_write_img_byt    ffpprb
#define fits_write_img_sbyt    ffpprsb
#define fits_write_img_usht    ffpprui
#define fits_write_img_ulng    ffppruj
#define fits_write_img_sht    ffppri
#define fits_write_img_lng    ffpprj
#define fits_write_img_ulnglng    ffpprujj
#define fits_write_img_lnglng    ffpprjj
#define fits_write_img_uint    ffppruk
#define fits_write_img_int    ffpprk
#define fits_write_img_flt    ffppre
#define fits_write_img_dbl    ffpprd

#define fits_write_imgnull     ffppn
#define fits_write_imgnull_byt ffppnb
#define fits_write_imgnull_sbyt ffppnsb
#define fits_write_imgnull_usht ffppnui
#define fits_write_imgnull_ulng ffppnuj
#define fits_write_imgnull_sht ffppni
#define fits_write_imgnull_lng ffppnj
#define fits_write_imgnull_ulnglng ffppnujj
#define fits_write_imgnull_lnglng ffppnjj
#define fits_write_imgnull_uint ffppnuk
#define fits_write_imgnull_int ffppnk
#define fits_write_imgnull_flt ffppne
#define fits_write_imgnull_dbl ffppnd

#define fits_write_img_null ffppru
#define fits_write_null_img ffpprn

#define fits_write_2d_byt   ffp2db
#define fits_write_2d_sbyt   ffp2dsb
#define fits_write_2d_usht   ffp2dui
#define fits_write_2d_ulng   ffp2duj
#define fits_write_2d_sht   ffp2di
#define fits_write_2d_lng   ffp2dj
#define fits_write_2d_ulnglng   ffp2dujj
#define fits_write_2d_lnglng   ffp2djj
#define fits_write_2d_uint   ffp2duk
#define fits_write_2d_int   ffp2dk
#define fits_write_2d_flt   ffp2de
#define fits_write_2d_dbl   ffp2dd

#define fits_write_3d_byt   ffp3db
#define fits_write_3d_sbyt   ffp3dsb
#define fits_write_3d_usht   ffp3dui
#define fits_write_3d_ulng   ffp3duj
#define fits_write_3d_sht   ffp3di
#define fits_write_3d_lng   ffp3dj
#define fits_write_3d_ulnglng   ffp3dujj
#define fits_write_3d_lnglng   ffp3djj
#define fits_write_3d_uint   ffp3duk
#define fits_write_3d_int   ffp3dk
#define fits_write_3d_flt   ffp3de
#define fits_write_3d_dbl   ffp3dd

#define fits_write_subset  ffpss
#define fits_write_subset_byt  ffpssb
#define fits_write_subset_sbyt  ffpsssb
#define fits_write_subset_usht  ffpssui
#define fits_write_subset_ulng  ffpssuj
#define fits_write_subset_sht  ffpssi
#define fits_write_subset_lng  ffpssj
#define fits_write_subset_ulnglng  ffpssujj
#define fits_write_subset_lnglng  ffpssjj
#define fits_write_subset_uint  ffpssuk
#define fits_write_subset_int  ffpssk
#define fits_write_subset_flt  ffpsse
#define fits_write_subset_dbl  ffpssd

#define fits_write_col         ffpcl
#define fits_write_col_str     ffpcls
#define fits_write_col_log     ffpcll
#define fits_write_col_byt     ffpclb
#define fits_write_col_sbyt     ffpclsb
#define fits_write_col_usht     ffpclui
#define fits_write_col_ulng     ffpcluj
#define fits_write_col_sht     ffpcli
#define fits_write_col_lng     ffpclj
#define fits_write_col_ulnglng     ffpclujj
#define fits_write_col_lnglng     ffpcljj
#define fits_write_col_uint     ffpcluk
#define fits_write_col_int     ffpclk
#define fits_write_col_flt     ffpcle
#define fits_write_col_dbl     ffpcld
#define fits_write_col_cmp     ffpclc
#define fits_write_col_dblcmp  ffpclm
#define fits_write_col_null    ffpclu
#define fits_write_col_bit     ffpclx
#define fits_write_nulrows     ffprwu
#define fits_write_nullrows    ffprwu

#define fits_write_colnull ffpcn
#define fits_write_colnull_str ffpcns
#define fits_write_colnull_log ffpcnl
#define fits_write_colnull_byt ffpcnb
#define fits_write_colnull_sbyt ffpcnsb
#define fits_write_colnull_usht ffpcnui
#define fits_write_colnull_ulng ffpcnuj
#define fits_write_colnull_sht ffpcni
#define fits_write_colnull_lng ffpcnj
#define fits_write_colnull_ulnglng ffpcnujj
#define fits_write_colnull_lnglng ffpcnjj
#define fits_write_colnull_uint ffpcnuk
#define fits_write_colnull_int ffpcnk
#define fits_write_colnull_flt ffpcne
#define fits_write_colnull_dbl ffpcnd

#define fits_write_ext ffpextn
#define fits_read_ext  ffgextn

#define fits_write_descript  ffpdes
#define fits_compress_heap   ffcmph
#define fits_test_heap   fftheap

#define fits_write_tblbytes  ffptbb
#define fits_insert_rows  ffirow
#define fits_delete_rows  ffdrow
#define fits_delete_rowrange ffdrrg
#define fits_delete_rowlist ffdrws
#define fits_delete_rowlistll ffdrwsll
#define fits_insert_col   fficol
#define fits_insert_cols  fficls
#define fits_delete_col   ffdcol
#define fits_copy_col     ffcpcl
#define fits_copy_cols    ffccls
#define fits_copy_rows    ffcprw
#define fits_modify_vector_len  ffmvec

#define fits_read_img_coord ffgics
#define fits_read_img_coord_version ffgicsa
#define fits_read_tbl_coord ffgtcs
#define fits_pix_to_world ffwldp
#define fits_world_to_pix ffxypx

#define fits_get_image_wcs_keys ffgiwcs
#define fits_get_table_wcs_keys ffgtwcs

#define fits_find_rows          fffrow
#define fits_find_first_row     ffffrw
#define fits_find_rows_cmp      fffrwc
#define fits_select_rows        ffsrow
#define fits_calc_rows          ffcrow
#define fits_calculator         ffcalc
#define fits_calculator_rng     ffcalc_rng
#define fits_test_expr          fftexp

#define fits_create_group       ffgtcr 
#define fits_insert_group       ffgtis 
#define fits_change_group       ffgtch 
#define fits_remove_group       ffgtrm 
#define fits_copy_group         ffgtcp 
#define fits_merge_groups       ffgtmg 
#define fits_compact_group      ffgtcm 
#define fits_verify_group       ffgtvf 
#define fits_open_group         ffgtop 
#define fits_add_group_member   ffgtam 
#define fits_get_num_members    ffgtnm 

#define fits_get_num_groups     ffgmng 
#define fits_open_member        ffgmop 
#define fits_copy_member        ffgmcp 
#define fits_transfer_member    ffgmtf 
#define fits_remove_member      ffgmrm

#define fits_init_https         ffihtps
#define fits_cleanup_https      ffchtps
#define fits_verbose_https      ffvhtps

#define fits_show_download_progress  ffshdwn
#define fits_get_timeout        ffgtmo
#define fits_set_timeout        ffstmo

#endif
cfitsio-3.47/makefile.bc0000644000225700000360000003072213464573432014477 0ustar  cagordonlhea#
# Borland C++ IDE generated makefile
# Generated 10/12/99 at 1:24:11 PM 
#
.AUTODEPEND


#
# Borland C++ tools
#
IMPLIB  = Implib
BCC32   = Bcc32 +BccW32.cfg 
BCC32I  = Bcc32i +BccW32.cfg 
TLINK32 = TLink32
ILINK32 = Ilink32
TLIB    = TLib
BRC32   = Brc32
TASM32  = Tasm32
#
# IDE macros
#


#
# Options
#
IDE_LinkFLAGS32 =  -LD:\BC5\LIB
LinkerLocalOptsAtC32_cfitsiodlib =  -Tpd -ap -c
ResLocalOptsAtC32_cfitsiodlib = 
BLocalOptsAtC32_cfitsiodlib = 
CompInheritOptsAt_cfitsiodlib = -ID:\BC5\INCLUDE -D_RTLDLL -DWIN32;
LinkerInheritOptsAt_cfitsiodlib = -x
LinkerOptsAt_cfitsiodlib = $(LinkerLocalOptsAtC32_cfitsiodlib)
ResOptsAt_cfitsiodlib = $(ResLocalOptsAtC32_cfitsiodlib)
BOptsAt_cfitsiodlib = $(BLocalOptsAtC32_cfitsiodlib)

#
# Dependency List
#
Dep_cfitsio = \
   cfitsio.lib

cfitsio : BccW32.cfg $(Dep_cfitsio)
  echo MakeNode

cfitsio.lib : cfitsio.dll
  $(IMPLIB) $@ cfitsio.dll


Dep_cfitsioddll = \
   listhead.obj\
   imcompress.obj\
   quantize.obj\
   ricecomp.obj\
   pliocomp.obj\
   iraffits.obj\
   wcsutil.obj\
   histo.obj\
   scalnull.obj\
   region.obj\
   putkey.obj\
   putcoluk.obj\
   putcoluj.obj\
   putcolui.obj\
   putcolu.obj\
   putcols.obj\
   putcoll.obj\
   putcolk.obj\
   putcolj.obj\
   putcoli.obj\
   putcole.obj\
   putcold.obj\
   putcolb.obj\
   putcolsb.obj\
   putcol.obj\
   modkey.obj\
   swapproc.obj\
   getcol.obj\
   group.obj\
   getkey.obj\
   getcoluk.obj\
   getcoluj.obj\
   getcolui.obj\
   getcols.obj\
   getcoll.obj\
   getcolk.obj\
   getcolj.obj\
   getcoli.obj\
   getcole.obj\
   getcold.obj\
   getcolb.obj\
   getcolsb.obj\
   grparser.obj\
   fitscore.obj\
   f77_wrap1.obj\
   f77_wrap2.obj\
   f77_wrap3.obj\
   f77_wrap4.obj\
   eval_y.obj\
   eval_l.obj\
   eval_f.obj\
   edithdu.obj\
   editcol.obj\
   drvrmem.obj\
   drvrfile.obj\
   checksum.obj\
   cfileio.obj\
   buffers.obj\
   fits_hcompress.obj\
   fits_hdecompress.obj\
   zuncompress.obj\
   zcompress.obj\
   adler32.obj\
   crc32.obj\
   inffast.obj\
   inftrees.obj\
   trees.obj\
   zutil.obj\
   deflate.obj\
   infback.obj\
   inflate.obj\
   uncompr.obj

cfitsio.dll : $(Dep_cfitsioddll) cfitsio.def
  $(ILINK32) @&&|
 /v $(IDE_LinkFLAGS32) $(LinkerOptsAt_cfitsiodlib) $(LinkerInheritOptsAt_cfitsiodlib) +
D:\BC5\LIB\c0d32.obj+
listhead.obj+
imcompress.obj+
quantize.obj+
ricecomp.obj+
pliocomp.obj+
iraffits.obj+
wcsutil.obj+
histo.obj+
iraffits.obj+
scalnull.obj+
region.obj+
putkey.obj+
putcoluk.obj+
putcoluj.obj+
putcolui.obj+
putcolu.obj+
putcols.obj+
putcoll.obj+
putcolk.obj+
putcolj.obj+
putcoli.obj+
putcole.obj+
putcold.obj+
putcolb.obj+
putcolsb.obj+
putcol.obj+
modkey.obj+
swapproc.obj+
getcol.obj+
group.obj+
getkey.obj+
getcoluk.obj+
getcoluj.obj+
getcolui.obj+
getcols.obj+
getcoll.obj+
getcolk.obj+
getcolj.obj+
getcoli.obj+
getcole.obj+
getcold.obj+
getcolb.obj+
getcolsb.obj+
grparser.obj+
fitscore.obj+
f77_wrap1.obj+
f77_wrap2.obj+
f77_wrap3.obj+
f77_wrap4.obj+
eval_y.obj+
eval_l.obj+
eval_f.obj+
edithdu.obj+
editcol.obj+
drvrmem.obj+
drvrfile.obj+
checksum.obj+
cfileio.obj+
buffers.obj+
fits_hcompress.obj+
fits_hdecompress.obj+
zuncompress.obj+
zcompress.obj+
adler32.obj+
crc32.obj+
inffast.obj+
inftrees.obj+
trees.obj+
zutil.obj+
deflate.obj+
infback.obj+
inflate.obj+
uncompr.obj
$<,$*
D:\BC5\LIB\import32.lib+
D:\BC5\LIB\cw32i.lib
cfitsio.def


|
wcsutil.obj :  wcsutil.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ wcsutil.c
|
iraffits.obj :  iraffits.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ iraffits.c
|
histo.obj :  histo.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ histo.c
|

scalnull.obj :  scalnull.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ scalnull.c
|

region.obj :  region.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ region.c
|

putkey.obj :  putkey.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putkey.c
|

putcoluk.obj :  putcoluk.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcoluk.c
|

putcoluj.obj :  putcoluj.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcoluj.c
|

putcolui.obj :  putcolui.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcolui.c
|

putcolu.obj :  putcolu.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcolu.c
|

putcols.obj :  putcols.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcols.c
|

putcoll.obj :  putcoll.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcoll.c
|

putcolk.obj :  putcolk.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcolk.c
|

putcolj.obj :  putcolj.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcolj.c
|

putcoli.obj :  putcoli.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcoli.c
|

putcole.obj :  putcole.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcole.c
|

putcold.obj :  putcold.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcold.c
|

putcolb.obj :  putcolb.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcolb.c
|

putcolsb.obj :  putcolsb.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcolsb.c
|

putcol.obj :  putcol.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ putcol.c
|

modkey.obj :  modkey.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ modkey.c
|

swapproc.obj :  swapproc.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ swapproc.c
|

getcol.obj :  getcol.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcol.c
|

group.obj :  group.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ group.c
|

getkey.obj :  getkey.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getkey.c
|

getcoluk.obj :  getcoluk.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcoluk.c
|

getcoluj.obj :  getcoluj.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcoluj.c
|

getcolui.obj :  getcolui.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcolui.c
|

getcols.obj :  getcols.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcols.c
|

getcoll.obj :  getcoll.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcoll.c
|

getcolk.obj :  getcolk.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcolk.c
|

getcolj.obj :  getcolj.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcolj.c
|

getcoli.obj :  getcoli.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcoli.c
|

getcole.obj :  getcole.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcole.c
|

getcold.obj :  getcold.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcold.c
|

getcolb.obj :  getcolb.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcolb.c
|
getcolsb.obj :  getcolsb.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ getcolsb.c
|

grparser.obj :  grparser.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ grparser.c
|

fitscore.obj :  fitscore.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ fitscore.c
|

f77_wrap1.obj :  f77_wrap1.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ f77_wrap1.c
|

f77_wrap2.obj :  f77_wrap2.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ f77_wrap2.c
|

f77_wrap3.obj :  f77_wrap3.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ f77_wrap3.c
|

f77_wrap4.obj :  f77_wrap4.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ f77_wrap4.c
|

eval_y.obj :  eval_y.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ eval_y.c
|

eval_l.obj :  eval_l.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ eval_l.c
|

eval_f.obj :  eval_f.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ eval_f.c
|

edithdu.obj :  edithdu.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ edithdu.c
|

editcol.obj :  editcol.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ editcol.c
|

drvrmem.obj :  drvrmem.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ drvrmem.c
|

drvrfile.obj :  drvrfile.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ drvrfile.c
|

checksum.obj :  checksum.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ checksum.c
|

cfileio.obj :  cfileio.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ cfileio.c
|

listhead.obj :  listhead.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ listhead.c
|

imcompress.obj :  imcompress.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ imcompress.c
|

quantize.obj :  quantize.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ quantize.c
|

ricecomp.obj :  ricecomp.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ ricecomp.c
|

pliocomp.obj :  pliocomp.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ pliocomp.c
|

buffers.obj :  buffers.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ buffers.c
|

fits_hcompress.obj :  fits_hcompress.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ fits_hcompress.c
|

fits_hdecompress.obj :  fits_hdecompress.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ fits_hdecompress.c
|

zuncompress.obj :  zuncompress.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ zuncompress.c
|

zcompress.obj :  zcompress.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ zcompress.c
|

adler32.obj :  adler32.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ adler32.c
|

crc32.obj :  crc32.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ crc32.c
|

inffast.obj :  inffast.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ inffast.c
|

inftrees.obj :  inftrees.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ inftrees.c
|

trees.obj :  trees.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ trees.c
|

zutil.obj :  zutil.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ zutil.c
|

deflate.obj :  deflate.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ deflate.c
|

infback.obj :  infback.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ infback.c
|

inflate.obj :  inflate.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ inflate.c
|

uncompr.obj :  uncompr.c
  $(BCC32) -P- -c @&&|
 $(CompOptsAt_cfitsiodlib) $(CompInheritOptsAt_cfitsiodlib) -o$@ uncompr.c
|


windumpexts.exe :  windumpexts.c
  bcc32 windumpexts.c


cfitsio.def: windumpexts.exe
	windumpexts -o cfitsio.def cfitsio.dll @&&|
		$(Dep_cfitsioddll)
|

# Compiler configuration file
BccW32.cfg : 
   Copy &&|
-w
-R
-v
-WM-
-vi
-H
-H=cfitsio.csm
-WCD
| $@


cfitsio-3.47/Makefile.in0000644000225700000360000001407113464573432014460 0ustar  cagordonlhea#
# Makefile for cfitsio library:
#
# Oct-96 : original version by 
#
#       JDD/WDP
#       NASA GSFC
#       Oct 1996
#
# 25-Jan-01 : removed conditional drvrsmem.c compilation because this
#             is now handled within the source file itself.
# 09-Mar-98 : modified to conditionally compile drvrsmem.c. Also
# changes to target all (deleted clean), added DEFS, LIBS, added
# DEFS to .c.o, added SOURCES_SHMEM and MY_SHMEM, expanded getcol*
# and putcol* in SOURCES, modified OBJECTS, mv changed to /bin/mv
# (to bypass aliasing), cp changed to /bin/cp, add smem and
# testprog targets. See also changes and comments in configure.in


# Default library name:
PACKAGE		= cfitsio

# CFITSIO version numbers:
CFITSIO_MAJOR	= @CFITSIO_MAJOR@
CFITSIO_MINOR	= @CFITSIO_MINOR@
CFITSIO_SONAME	= @CFITSIO_SONAME@

prefix		= @prefix@
exec_prefix	= @exec_prefix@
CFITSIO_BIN	= ${DESTDIR}@bindir@
CFITSIO_LIB	= ${DESTDIR}@libdir@
CFITSIO_INCLUDE	= ${DESTDIR}@includedir@
INSTALL_DIRS	= @INSTALL_ROOT@ ${CFITSIO_INCLUDE} ${CFITSIO_LIB} ${CFITSIO_LIB}/pkgconfig


SHELL =		/bin/sh
ARCHIVE =	@ARCHIVE@
RANLIB =	@RANLIB@
CC =		@CC@
CFLAGS =	@CFLAGS@
CPPFLAGS =	@CPPFLAGS@
SSE_FLAGS =	@SSE_FLAGS@
FC =		@FC@
LDFLAGS =	@LDFLAGS@
LDFLAGS_BIN =	@LDFLAGS_BIN@
DEFS =		@DEFS@
LIBS =		@LIBS@
LIBS_CURL =	@LIBS_CURL@
FLEX =		flex
BISON =		bison

SHLIB_LD =	@SHLIB_LD@
SHLIB_SUFFIX =	@SHLIB_SUFFIX@
CFITSIO_SHLIB =	@CFITSIO_SHLIB@
CFITSIO_SHLIB_SONAME = @CFITSIO_SHLIB_SONAME@


CORE_SOURCES = 	buffers.c cfileio.c checksum.c drvrfile.c drvrmem.c \
		drvrnet.c drvrsmem.c editcol.c edithdu.c eval_l.c \
		eval_y.c eval_f.c fitscore.c getcol.c getcolb.c getcold.c getcole.c \
		getcoli.c getcolj.c getcolk.c getcoll.c getcols.c getcolsb.c \
		getcoluk.c getcolui.c getcoluj.c getkey.c group.c grparser.c \
		histo.c iraffits.c \
		modkey.c putcol.c putcolb.c putcold.c putcole.c putcoli.c \
		putcolj.c putcolk.c putcoluk.c putcoll.c putcols.c putcolsb.c \
		putcolu.c putcolui.c putcoluj.c putkey.c region.c scalnull.c \
		swapproc.c wcssub.c wcsutil.c imcompress.c quantize.c ricecomp.c \
		pliocomp.c fits_hcompress.c fits_hdecompress.c \
		simplerng.c @GSIFTP_SRC@

ZLIB_SOURCES =	zlib/adler32.c zlib/crc32.c zlib/deflate.c zlib/infback.c \
		zlib/inffast.c zlib/inflate.c zlib/inftrees.c zlib/trees.c \
		zlib/uncompr.c zlib/zcompress.c zlib/zuncompress.c zlib/zutil.c

SOURCES = ${CORE_SOURCES} ${ZLIB_SOURCES} @F77_WRAPPERS@

OBJECTS = 	${SOURCES:.c=.o}

CORE_OBJECTS = 	${CORE_SOURCES:.c=.o} ${ZLIB_SOURCES:.c=.o}


FITSIO_SRC =	f77_wrap1.c f77_wrap2.c f77_wrap3.c f77_wrap4.c

# ============ description of all targets =============
#       -  <<-- ignore error code

all:
		@if [ "x${FC}" = x ]; then \
			${MAKE} all-nofitsio; \
		else \
			${MAKE} stand_alone; \
		fi

all-nofitsio:
		${MAKE} stand_alone "FITSIO_SRC="

stand_alone:	lib${PACKAGE}.a shared

lib${PACKAGE}.a:	${OBJECTS}
		${ARCHIVE} $@ ${OBJECTS}; \
		${RANLIB} $@;

shared: lib${PACKAGE}${SHLIB_SUFFIX}

lib${PACKAGE}${SHLIB_SUFFIX}: ${OBJECTS}
		${SHLIB_LD} ${LDFLAGS} -o ${CFITSIO_SHLIB} ${OBJECTS} -lm ${LIBS_CURL} ${LIBS}
		@if [ "x${CFITSIO_SHLIB_SONAME}" != x ]; then \
			ln -sf ${CFITSIO_SHLIB} ${CFITSIO_SHLIB_SONAME}; \
			ln -sf ${CFITSIO_SHLIB_SONAME} $@; \
		fi

install:	lib${PACKAGE}.a ${INSTALL_DIRS}
		@for lib in lib${PACKAGE}.a lib${PACKAGE}${SHLIB_SUFFIX} \
				${CFITSIO_SHLIB} ${CFITSIO_SHLIB_SONAME}; do \
		    if [ -f $$lib ]; then \
			echo "/bin/cp -a $$lib ${CFITSIO_LIB}"; \
			/bin/cp -a $$lib ${CFITSIO_LIB}; \
		    fi; \
		done
		/bin/cp fitsio.h fitsio2.h longnam.h drvrsmem.h ${CFITSIO_INCLUDE}
		/bin/cp cfitsio.pc ${CFITSIO_LIB}/pkgconfig
		@for task in ${FPACK_UTILS} ${UTILS}; do \
		    if [ -f $$task ]; then \
			if [ ! -d ${CFITSIO_BIN} ]; then mkdir -p ${CFITSIO_BIN}; fi; \
			echo "/bin/cp $$task ${CFITSIO_BIN}"; \
			/bin/cp $$task ${CFITSIO_BIN}; \
		    fi; \
		done

.c.o:
		${CC} -c -o ${ eval_l.c1
		# Note workaround for yyfree=fffree conflict
		/bin/sed -e 's/yy/ff/g' -e 's/YY/FF/g' eval_l.c1 -e 's/fffree/yyfffree/g' > eval_l.c
		/bin/rm -f eval_l.c1
		${BISON} -d -v -y eval.y
		/bin/sed -e 's/yy/ff/g' -e 's/YY/FF/g' y.tab.c > eval_y.c
		/bin/sed -e 's/yy/ff/g' -e 's/YY/FF/g' y.tab.h > eval_tab.h
		/bin/rm -f y.tab.c y.tab.h

clean:
	-	/bin/rm -rf *.o zlib/*.o *.dSYM lib${PACKAGE}* y.output so_locations \
		${UTILS} ${FPACK_UTILS} testprog.fit

distclean:	clean
	-	/bin/rm -f Makefile cfitsio.pc config.log config.status configure.lineno

# Make target which outputs the list of the .o contained in the cfitsio lib
# usefull to build a single big shared library containing Tcl/Tk and other
# extensions.  used for the Tcl Plugin. 

cfitsioLibObjs:
	@echo ${CORE_OBJECTS}

cfitsioLibSrcs:
	@echo ${SOURCES}

# This target actually builds the objects needed for the lib in the above
# case
objs: ${CORE_OBJECTS}

${INSTALL_DIRS}:
	@if [ ! -d $@ ]; then mkdir -p $@; fi
cfitsio-3.47/makefile.vcc0000644000225700000360000004317013464573432014667 0ustar  cagordonlhea# Microsoft Developer Studio Generated NMAKE File, Based on cfitsio.dsp
!IF "$(CFG)" == ""
CFG=Win32 Release
!MESSAGE No configuration specified. Defaulting to Win32 Release.
!ENDIF 

!IF "$(CFG)" != "Win32 Release" && "$(CFG)" != "Win32 Debug"
!MESSAGE Invalid configuration "$(CFG)" specified.
!MESSAGE You can specify a configuration when running NMAKE
!MESSAGE by defining the macro CFG on the command line. For example:
!MESSAGE 
!MESSAGE NMAKE /f "cfitsio.mak" CFG="Win32 Debug"
!MESSAGE 
!MESSAGE Possible choices for configuration are:
!MESSAGE 
!MESSAGE "Win32 Release" (based on "Win32 (x86) Dynamic-Link Library")
!MESSAGE "Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library")
!MESSAGE 
!ERROR An invalid configuration is specified.
!ENDIF 

!IF "$(OS)" == "Windows_NT"
NULL=
!ELSE 
NULL=nul
!ENDIF 

CPP=cl.exe
MTL=midl.exe
RSC=rc.exe

!IF  "$(CFG)" == "Win32 Release"

OUTDIR=.
INTDIR=.\Release
# Begin Custom Macros
OutDir=.
# End Custom Macros

ALL : "$(OUTDIR)\cfitsio.dll"


CLEAN :
	-@erase "$(INTDIR)\buffers.obj"
	-@erase "$(INTDIR)\cfileio.obj"
	-@erase "$(INTDIR)\checksum.obj"
	-@erase "$(INTDIR)\drvrfile.obj"
	-@erase "$(INTDIR)\drvrmem.obj"
	-@erase "$(INTDIR)\editcol.obj"
	-@erase "$(INTDIR)\edithdu.obj"
	-@erase "$(INTDIR)\eval_f.obj"
	-@erase "$(INTDIR)\eval_l.obj"
	-@erase "$(INTDIR)\eval_y.obj"
	-@erase "$(INTDIR)\fitscore.obj"
	-@erase "$(INTDIR)\f77_wrap1.obj"
	-@erase "$(INTDIR)\f77_wrap2.obj"
	-@erase "$(INTDIR)\f77_wrap3.obj"
	-@erase "$(INTDIR)\f77_wrap4.obj"
	-@erase "$(INTDIR)\getcol.obj"
	-@erase "$(INTDIR)\getcolb.obj"
	-@erase "$(INTDIR)\getcolsb.obj"
	-@erase "$(INTDIR)\getcold.obj"
	-@erase "$(INTDIR)\getcole.obj"
	-@erase "$(INTDIR)\getcoli.obj"
	-@erase "$(INTDIR)\getcolj.obj"
	-@erase "$(INTDIR)\getcolk.obj"
	-@erase "$(INTDIR)\getcoll.obj"
	-@erase "$(INTDIR)\getcols.obj"
	-@erase "$(INTDIR)\getcolui.obj"
	-@erase "$(INTDIR)\getcoluj.obj"
	-@erase "$(INTDIR)\getcoluk.obj"
	-@erase "$(INTDIR)\getkey.obj"
	-@erase "$(INTDIR)\group.obj"
	-@erase "$(INTDIR)\grparser.obj"
	-@erase "$(INTDIR)\histo.obj"
	-@erase "$(INTDIR)\iraffits.obj"
	-@erase "$(INTDIR)\modkey.obj"
	-@erase "$(INTDIR)\putcol.obj"
	-@erase "$(INTDIR)\putcolb.obj"
	-@erase "$(INTDIR)\putcolsb.obj"
	-@erase "$(INTDIR)\putcold.obj"
	-@erase "$(INTDIR)\putcole.obj"
	-@erase "$(INTDIR)\putcoli.obj"
	-@erase "$(INTDIR)\putcolj.obj"
	-@erase "$(INTDIR)\putcolk.obj"
	-@erase "$(INTDIR)\putcoll.obj"
	-@erase "$(INTDIR)\putcols.obj"
	-@erase "$(INTDIR)\putcolu.obj"
	-@erase "$(INTDIR)\putcolui.obj"
	-@erase "$(INTDIR)\putcoluj.obj"
	-@erase "$(INTDIR)\putcoluk.obj"
	-@erase "$(INTDIR)\putkey.obj"
	-@erase "$(INTDIR)\region.obj"
	-@erase "$(INTDIR)\scalnull.obj"
	-@erase "$(INTDIR)\swapproc.obj"
	-@erase "$(INTDIR)\wcssub.obj"
	-@erase "$(INTDIR)\wcsutil.obj"
	-@erase "$(INTDIR)\imcompress.obj"
	-@erase "$(INTDIR)\ricecomp.obj"
	-@erase "$(INTDIR)\quantize.obj"
	-@erase "$(INTDIR)\pliocomp.obj"
	-@erase "$(INTDIR)\fits_hcompress.obj"
	-@erase "$(INTDIR)\fits_hdecompress.obj"
	-@erase "$(INTDIR)\zuncompress.obj"
	-@erase "$(INTDIR)\zcompress.obj"
	-@erase "$(INTDIR)\adler32.obj"
	-@erase "$(INTDIR)\crc32.obj"
	-@erase "$(INTDIR)\inffast.obj"
	-@erase "$(INTDIR)\inftrees.obj"
	-@erase "$(INTDIR)\trees.obj"
	-@erase "$(INTDIR)\zutil.obj"
	-@erase "$(INTDIR)\deflate.obj"
	-@erase "$(INTDIR)\infback.obj"
	-@erase "$(INTDIR)\inflate.obj"
	-@erase "$(INTDIR)\uncompr.obj"
	-@erase "$(INTDIR)\vc60.idb"
	-@erase "$(OUTDIR)\cfitsio.dll"
	-@erase "$(OUTDIR)\cfitsio.exp"
	-@erase "$(OUTDIR)\cfitsio.lib"

"$(OUTDIR)" :
    if not exist "$(OUTDIR)/$(NULL)" mkdir "$(OUTDIR)"

"$(INTDIR)" :
    if not exist "$(INTDIR)/$(NULL)" mkdir "$(INTDIR)"

CPP_PROJ=/nologo /MD /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "CFITSIO_EXPORTS" /D "_CRT_SECURE_NO_DEPRECATE" /Fp"$(INTDIR)\cfitsio.pch" /YX /Fo"$(INTDIR)\\" /Fd"$(INTDIR)\\" /FD /c 
MTL_PROJ=/nologo /D "NDEBUG" /mktyplib203 /win32 
BSC32=bscmake.exe
BSC32_FLAGS=/nologo /o"$(OUTDIR)\cfitsio.bsc" 
BSC32_SBRS= \
	
LINK32=link.exe
LINK32_FLAGS=kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:no /pdb:"$(OUTDIR)\cfitsio.pdb" /machine:I386 /def:".\cfitsio.def" /out:"$(OUTDIR)\cfitsio.dll" /implib:"$(OUTDIR)\cfitsio.lib" 
DEF_FILE= ".\cfitsio.def"
LINK32_OBJS= \
	"$(INTDIR)\buffers.obj" \
	"$(INTDIR)\cfileio.obj" \
	"$(INTDIR)\checksum.obj" \
	"$(INTDIR)\drvrfile.obj" \
	"$(INTDIR)\drvrmem.obj" \
	"$(INTDIR)\editcol.obj" \
	"$(INTDIR)\edithdu.obj" \
	"$(INTDIR)\eval_f.obj" \
	"$(INTDIR)\eval_l.obj" \
	"$(INTDIR)\eval_y.obj" \
	"$(INTDIR)\fitscore.obj" \
	"$(INTDIR)\f77_wrap1.obj" \
	"$(INTDIR)\f77_wrap2.obj" \
	"$(INTDIR)\f77_wrap3.obj" \
	"$(INTDIR)\f77_wrap4.obj" \
	"$(INTDIR)\getcol.obj" \
	"$(INTDIR)\getcolb.obj" \
	"$(INTDIR)\getcolsb.obj" \
	"$(INTDIR)\getcold.obj" \
	"$(INTDIR)\getcole.obj" \
	"$(INTDIR)\getcoli.obj" \
	"$(INTDIR)\getcolj.obj" \
	"$(INTDIR)\getcolk.obj" \
	"$(INTDIR)\getcoll.obj" \
	"$(INTDIR)\getcols.obj" \
	"$(INTDIR)\getcolui.obj" \
	"$(INTDIR)\getcoluj.obj" \
	"$(INTDIR)\getcoluk.obj" \
	"$(INTDIR)\getkey.obj" \
	"$(INTDIR)\group.obj" \
	"$(INTDIR)\grparser.obj" \
	"$(INTDIR)\histo.obj" \
	"$(INTDIR)\iraffits.obj" \
	"$(INTDIR)\modkey.obj" \
	"$(INTDIR)\putcol.obj" \
	"$(INTDIR)\putcolb.obj" \
	"$(INTDIR)\putcolsb.obj" \
	"$(INTDIR)\putcold.obj" \
	"$(INTDIR)\putcole.obj" \
	"$(INTDIR)\putcoli.obj" \
	"$(INTDIR)\putcolj.obj" \
	"$(INTDIR)\putcolk.obj" \
	"$(INTDIR)\putcoll.obj" \
	"$(INTDIR)\putcols.obj" \
	"$(INTDIR)\putcolu.obj" \
	"$(INTDIR)\putcolui.obj" \
	"$(INTDIR)\putcoluj.obj" \
	"$(INTDIR)\putcoluk.obj" \
	"$(INTDIR)\putkey.obj" \
	"$(INTDIR)\region.obj" \
	"$(INTDIR)\scalnull.obj" \
	"$(INTDIR)\swapproc.obj" \
	"$(INTDIR)\wcssub.obj"  \
	"$(INTDIR)\wcsutil.obj" \
	"$(INTDIR)\imcompress.obj" \
	"$(INTDIR)\ricecomp.obj" \
	"$(INTDIR)\quantize.obj" \
	"$(INTDIR)\pliocomp.obj" \
	"$(INTDIR)\fits_hcompress.obj" \
	"$(INTDIR)\fits_hdecompress.obj" \
	"$(INTDIR)\zuncompress.obj" \
	"$(INTDIR)\zcompress.obj" \
	"$(INTDIR)\adler32.obj" \
	"$(INTDIR)\crc32.obj" \
	"$(INTDIR)\inffast.obj" \
	"$(INTDIR)\inftrees.obj" \
	"$(INTDIR)\trees.obj" \
	"$(INTDIR)\zutil.obj" \
	"$(INTDIR)\deflate.obj" \
	"$(INTDIR)\infback.obj" \
	"$(INTDIR)\inflate.obj" \
	"$(INTDIR)\uncompr.obj" 

"$(OUTDIR)\cfitsio.dll" : $(LINK32_OBJS) WINDUMP
	windumpexts -o $(DEF_FILE) cfitsio.dll $(LINK32_OBJS)
	$(LINK32) @<<
  $(LINK32_FLAGS) $(LINK32_OBJS)
<<

!ELSEIF  "$(CFG)" == "Win32 Debug"

OUTDIR=.
INTDIR=.\Debug
# Begin Custom Macros
OutDir=.
# End Custom Macros

ALL : "$(OUTDIR)\cfitsio.dll"


CLEAN :
	-@erase "$(INTDIR)\buffers.obj"
	-@erase "$(INTDIR)\cfileio.obj"
	-@erase "$(INTDIR)\checksum.obj"
	-@erase "$(INTDIR)\drvrfile.obj"
	-@erase "$(INTDIR)\drvrmem.obj"
	-@erase "$(INTDIR)\editcol.obj"
	-@erase "$(INTDIR)\edithdu.obj"
	-@erase "$(INTDIR)\eval_f.obj"
	-@erase "$(INTDIR)\eval_l.obj"
	-@erase "$(INTDIR)\eval_y.obj"
	-@erase "$(INTDIR)\fitscore.obj"
	-@erase "$(INTDIR)\f77_wrap1.obj"
	-@erase "$(INTDIR)\f77_wrap2.obj"
	-@erase "$(INTDIR)\f77_wrap3.obj"
	-@erase "$(INTDIR)\f77_wrap4.obj"
	-@erase "$(INTDIR)\getcol.obj"
	-@erase "$(INTDIR)\getcolb.obj"
	-@erase "$(INTDIR)\getcolsb.obj"
	-@erase "$(INTDIR)\getcold.obj"
	-@erase "$(INTDIR)\getcole.obj"
	-@erase "$(INTDIR)\getcoli.obj"
	-@erase "$(INTDIR)\getcolj.obj"
	-@erase "$(INTDIR)\getcolk.obj"
	-@erase "$(INTDIR)\getcoll.obj"
	-@erase "$(INTDIR)\getcols.obj"
	-@erase "$(INTDIR)\getcolui.obj"
	-@erase "$(INTDIR)\getcoluj.obj"
	-@erase "$(INTDIR)\getcoluk.obj"
	-@erase "$(INTDIR)\getkey.obj"
	-@erase "$(INTDIR)\group.obj"
	-@erase "$(INTDIR)\grparser.obj"
	-@erase "$(INTDIR)\histo.obj"
	-@erase "$(INTDIR)\iraffits.obj"
	-@erase "$(INTDIR)\modkey.obj"
	-@erase "$(INTDIR)\putcol.obj"
	-@erase "$(INTDIR)\putcolb.obj"
	-@erase "$(INTDIR)\putcolsb.obj"
	-@erase "$(INTDIR)\putcold.obj"
	-@erase "$(INTDIR)\putcole.obj"
	-@erase "$(INTDIR)\putcoli.obj"
	-@erase "$(INTDIR)\putcolj.obj"
	-@erase "$(INTDIR)\putcolk.obj"
	-@erase "$(INTDIR)\putcoll.obj"
	-@erase "$(INTDIR)\putcols.obj"
	-@erase "$(INTDIR)\putcolu.obj"
	-@erase "$(INTDIR)\putcolui.obj"
	-@erase "$(INTDIR)\putcoluj.obj"
	-@erase "$(INTDIR)\putcoluk.obj"
	-@erase "$(INTDIR)\putkey.obj"
	-@erase "$(INTDIR)\region.obj"
	-@erase "$(INTDIR)\scalnull.obj"
	-@erase "$(INTDIR)\swapproc.obj"
	-@erase "$(INTDIR)\vc60.idb"
	-@erase "$(INTDIR)\vc60.pdb"
	-@erase "$(INTDIR)\wcssub.obj"
	-@erase "$(INTDIR)\wcsutil.obj"
	-@erase "$(INTDIR)\imcompress.obj"
	-@erase "$(INTDIR)\ricecomp.obj"
	-@erase "$(INTDIR)\quantize.obj"
	-@erase "$(INTDIR)\pliocomp.obj"
	-@erase "$(INTDIR)\fits_hcompress.obj"
	-@erase "$(INTDIR)\fits_hdecompress.obj"
	-@erase "$(INTDIR)\zuncompress.obj"
	-@erase "$(INTDIR)\zcompress.obj"
	-@erase "$(INTDIR)\adler32.obj"
	-@erase "$(INTDIR)\crc32.obj"
	-@erase "$(INTDIR)\inffast.obj"
	-@erase "$(INTDIR)\inftrees.obj"
	-@erase "$(INTDIR)\trees.obj"
	-@erase "$(INTDIR)\zutil.obj"
	-@erase "$(INTDIR)\deflate.obj"
	-@erase "$(INTDIR)\infback.obj"
	-@erase "$(INTDIR)\inflate.obj"
	-@erase "$(INTDIR)\uncompr.obj"
	-@erase "$(OUTDIR)\cfitsio.dll"
	-@erase "$(OUTDIR)\cfitsio.exp"
	-@erase "$(OUTDIR)\cfitsio.ilk"
	-@erase "$(OUTDIR)\cfitsio.lib"
	-@erase "$(OUTDIR)\cfitsio.pdb"

"$(OUTDIR)" :
    if not exist "$(OUTDIR)/$(NULL)" mkdir "$(OUTDIR)"

"$(INTDIR)" :
    if not exist "$(INTDIR)/$(NULL)" mkdir "$(INTDIR)"

CPP_PROJ=/nologo /MDd /W3 /Gm /GX /ZI /Od /D "__WIN32__" /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "CFITSIO_EXPORTS" /D "_CRT_SECURE_NO_DEPRECATE" /Fp"$(INTDIR)\cfitsio.pch" /YX /Fo"$(INTDIR)\\" /Fd"$(INTDIR)\\" /FD /GZ /c 
MTL_PROJ=/nologo /D "_DEBUG" /mktyplib203 /win32 
BSC32=bscmake.exe
BSC32_FLAGS=/nologo /o"$(OUTDIR)\cfitsio.bsc" 
BSC32_SBRS= \
	
LINK32=link.exe
LINK32_FLAGS=kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"$(OUTDIR)\cfitsio.pdb" /debug /machine:I386 /def:".\cfitsio.def" /out:"$(OUTDIR)\cfitsio.dll" /implib:"$(OUTDIR)\cfitsio.lib" /pdbtype:sept 
DEF_FILE= ".\cfitsio.def"
LINK32_OBJS= \
	"$(INTDIR)\buffers.obj" \
	"$(INTDIR)\cfileio.obj" \
	"$(INTDIR)\checksum.obj" \
	"$(INTDIR)\drvrfile.obj" \
	"$(INTDIR)\drvrmem.obj" \
	"$(INTDIR)\editcol.obj" \
	"$(INTDIR)\edithdu.obj" \
	"$(INTDIR)\eval_f.obj" \
	"$(INTDIR)\eval_l.obj" \
	"$(INTDIR)\eval_y.obj" \
	"$(INTDIR)\fitscore.obj" \
	"$(INTDIR)\f77_wrap1.obj" \
	"$(INTDIR)\f77_wrap2.obj" \
	"$(INTDIR)\f77_wrap3.obj" \
	"$(INTDIR)\f77_wrap4.obj" \
	"$(INTDIR)\getcol.obj" \
	"$(INTDIR)\getcolb.obj" \
	"$(INTDIR)\getcolsb.obj" \
	"$(INTDIR)\getcold.obj" \
	"$(INTDIR)\getcole.obj" \
	"$(INTDIR)\getcoli.obj" \
	"$(INTDIR)\getcolj.obj" \
	"$(INTDIR)\getcolk.obj" \
	"$(INTDIR)\getcoll.obj" \
	"$(INTDIR)\getcols.obj" \
	"$(INTDIR)\getcolui.obj" \
	"$(INTDIR)\getcoluj.obj" \
	"$(INTDIR)\getcoluk.obj" \
	"$(INTDIR)\getkey.obj" \
	"$(INTDIR)\group.obj" \
	"$(INTDIR)\grparser.obj" \
	"$(INTDIR)\histo.obj" \
	"$(INTDIR)\iraffits.obj" \
	"$(INTDIR)\modkey.obj" \
	"$(INTDIR)\putcol.obj" \
	"$(INTDIR)\putcolb.obj" \
	"$(INTDIR)\putcolsb.obj" \
	"$(INTDIR)\putcold.obj" \
	"$(INTDIR)\putcole.obj" \
	"$(INTDIR)\putcoli.obj" \
	"$(INTDIR)\putcolj.obj" \
	"$(INTDIR)\putcolk.obj" \
	"$(INTDIR)\putcoll.obj" \
	"$(INTDIR)\putcols.obj" \
	"$(INTDIR)\putcolu.obj" \
	"$(INTDIR)\putcolui.obj" \
	"$(INTDIR)\putcoluj.obj" \
	"$(INTDIR)\putcoluk.obj" \
	"$(INTDIR)\putkey.obj" \
	"$(INTDIR)\region.obj" \
	"$(INTDIR)\scalnull.obj" \
	"$(INTDIR)\swapproc.obj" \
	"$(INTDIR)\wcssub.obj" \
	"$(INTDIR)\wcsutil.obj" \
	"$(INTDIR)\imcompress.obj" \
	"$(INTDIR)\ricecomp.obj" \
	"$(INTDIR)\quantize.obj" \
	"$(INTDIR)\pliocomp.obj" \
	"$(INTDIR)\fits_hcompress.obj" \
	"$(INTDIR)\fits_hdecompress.obj" \
	"$(INTDIR)\zuncompress.obj" \
	"$(INTDIR)\zcompress.obj" \
	"$(INTDIR)\adler32.obj" \
	"$(INTDIR)\crc32.obj" \
	"$(INTDIR)\inffast.obj" \
	"$(INTDIR)\inftrees.obj" \
	"$(INTDIR)\trees.obj" \
	"$(INTDIR)\zutil.obj" \
	"$(INTDIR)\deflate.obj" \
	"$(INTDIR)\infback.obj" \
	"$(INTDIR)\inflate.obj" \
	"$(INTDIR)\uncompr.obj" 

"$(OUTDIR)\cfitsio.dll" : $(LINK32_OBJS) WINDUMP
	windumpexts -o $(DEF_FILE) cfitsio.dll $(LINK32_OBJS)    
	$(LINK32) @<<
	$(LINK32_FLAGS) $(LINK32_OBJS)
<<

!ENDIF 

.c{$(INTDIR)}.obj::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.cpp{$(INTDIR)}.obj::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.cxx{$(INTDIR)}.obj::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.c{$(INTDIR)}.sbr::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.cpp{$(INTDIR)}.sbr::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.cxx{$(INTDIR)}.sbr::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<


!IF "$(NO_EXTERNAL_DEPS)" != "1"
!IF EXISTS("cfitsio.dep")
!INCLUDE "cfitsio.dep"
!ELSE 
!MESSAGE Warning: cannot find "cfitsio.dep"
!ENDIF 
!ENDIF 


!IF "$(CFG)" == "Win32 Release" || "$(CFG)" == "Win32 Debug"
SOURCE=.\buffers.c

"$(INTDIR)\buffers.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\cfileio.c

"$(INTDIR)\cfileio.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\checksum.c

"$(INTDIR)\checksum.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\drvrfile.c

"$(INTDIR)\drvrfile.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\drvrmem.c

"$(INTDIR)\drvrmem.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\editcol.c

"$(INTDIR)\editcol.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\edithdu.c

"$(INTDIR)\edithdu.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\eval_f.c

"$(INTDIR)\eval_f.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\eval_l.c

"$(INTDIR)\eval_l.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\eval_y.c

"$(INTDIR)\eval_y.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\fitscore.c

"$(INTDIR)\fitscore.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\f77_wrap1.c

"$(INTDIR)\f77_wrap1.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\f77_wrap2.c

"$(INTDIR)\f77_wrap2.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\f77_wrap3.c

"$(INTDIR)\f77_wrap3.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\f77_wrap4.c

"$(INTDIR)\f77_wrap4.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcol.c

"$(INTDIR)\getcol.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcolb.c

"$(INTDIR)\getcolb.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcolsb.c

"$(INTDIR)\getcolsb.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcold.c

"$(INTDIR)\getcold.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcole.c

"$(INTDIR)\getcole.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcoli.c

"$(INTDIR)\getcoli.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcolj.c

"$(INTDIR)\getcolj.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcolk.c

"$(INTDIR)\getcolk.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcoll.c

"$(INTDIR)\getcoll.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcols.c

"$(INTDIR)\getcols.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcolui.c

"$(INTDIR)\getcolui.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcoluj.c

"$(INTDIR)\getcoluj.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getcoluk.c

"$(INTDIR)\getcoluk.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\getkey.c

"$(INTDIR)\getkey.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\group.c

"$(INTDIR)\group.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\grparser.c

"$(INTDIR)\grparser.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\histo.c

"$(INTDIR)\histo.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\iraffits.c

"$(INTDIR)\iraffits.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\modkey.c

"$(INTDIR)\modkey.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcol.c

"$(INTDIR)\putcol.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcolb.c

"$(INTDIR)\putcolb.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcolsb.c

"$(INTDIR)\putcolsb.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcold.c

"$(INTDIR)\putcold.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcole.c

"$(INTDIR)\putcole.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcoli.c

"$(INTDIR)\putcoli.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcolj.c

"$(INTDIR)\putcolj.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcolk.c

"$(INTDIR)\putcolk.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcoll.c

"$(INTDIR)\putcoll.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcols.c

"$(INTDIR)\putcols.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcolu.c

"$(INTDIR)\putcolu.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcolui.c

"$(INTDIR)\putcolui.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcoluj.c

"$(INTDIR)\putcoluj.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putcoluk.c

"$(INTDIR)\putcoluk.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\putkey.c

"$(INTDIR)\putkey.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\region.c

"$(INTDIR)\region.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\scalnull.c

"$(INTDIR)\scalnull.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\swapproc.c

"$(INTDIR)\swapproc.obj" : $(SOURCE) "$(INTDIR)"


SOURCE=.\wcssub.c

"$(INTDIR)\wcssub.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=.\wcsutil.c

"$(INTDIR)\wcsutil.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=imcompress.c

"$(INTDIR)\imcompress.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=ricecomp.c

"$(INTDIR)\ricecomp.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=quantize.c

"$(INTDIR)\quantize.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=pliocomp.c

"$(INTDIR)\pliocomp.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=fits_hcompress.c

"$(INTDIR)\fits_hcompress.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=fits_hdecompress.c

"$(INTDIR)\fits_hdecompress.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=zuncompress.c

"$(INTDIR)\zuncompress.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=zcompress.c

"$(INTDIR)\zcompress.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=adler32.c

"$(INTDIR)\adler32.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=crc32.c

"$(INTDIR)\crc32.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=inffast.c

"$(INTDIR)\inffast.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=inftrees.c

"$(INTDIR)\inftrees.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=trees.c

"$(INTDIR)\trees.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=zutil.c

"$(INTDIR)\zutil.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=deflate.c

"$(INTDIR)\deflate.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=infback.c

"$(INTDIR)\infback.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=inflate.c

"$(INTDIR)\inflate.obj" : $(SOURCE) "$(INTDIR)"

SOURCE=uncompr.c

"$(INTDIR)\uncompr.obj" : $(SOURCE) "$(INTDIR)"

!ENDIF 

$(DEF_FILE):  



WINDUMP:
	nmake -f winDumpExts.mak
cfitsio-3.47/makepc.bat0000644000225700000360000000440313464573432014341 0ustar  cagordonlhearem:  this batch file builds the cfitsio library 
rem:  using the Borland C++ v4.5 or new free v5.5 compiler
rem:
bcc32 -c buffers.c
bcc32 -c cfileio.c
bcc32 -c checksum.c
bcc32 -c drvrfile.c
bcc32 -c drvrmem.c
bcc32 -c editcol.c
bcc32 -c edithdu.c
bcc32 -c eval_l.c
bcc32 -c eval_y.c
bcc32 -c eval_f.c
bcc32 -c fitscore.c
bcc32 -c getcol.c
bcc32 -c getcolb.c
bcc32 -c getcolsb.c
bcc32 -c getcoli.c
bcc32 -c getcolj.c
bcc32 -c getcolui.c
bcc32 -c getcoluj.c
bcc32 -c getcoluk.c
bcc32 -c getcolk.c
bcc32 -c getcole.c
bcc32 -c getcold.c
bcc32 -c getcoll.c
bcc32 -c getcols.c
bcc32 -c getkey.c
bcc32 -c group.c
bcc32 -c grparser.c
bcc32 -c histo.c
bcc32 -c iraffits.c
bcc32 -c modkey.c
bcc32 -c putcol.c
bcc32 -c putcolb.c
bcc32 -c putcolsb.c
bcc32 -c putcoli.c
bcc32 -c putcolj.c
bcc32 -c putcolui.c
bcc32 -c putcoluj.c
bcc32 -c putcoluk.c
bcc32 -c putcolk.c
bcc32 -c putcole.c
bcc32 -c putcold.c
bcc32 -c putcols.c
bcc32 -c putcoll.c
bcc32 -c putcolu.c
bcc32 -c putkey.c
bcc32 -c region.c
bcc32 -c scalnull.c
bcc32 -c swapproc.c
bcc32 -c wcsutil.c
bcc32 -c wcssub.c
bcc32 -c imcompress.c
bcc32 -c quantize.c
bcc32 -c ricecomp.c
bcc32 -c pliocomp.c
bcc32 -c fits_hcompress.c
bcc32 -c fits_hdecompress.c
bcc32 -c zuncompress.c
bcc32 -c zcompress.c
bcc32 -c adler32.c
bcc32 -c crc32.c
bcc32 -c inffast.c
bcc32 -c inftrees.c
bcc32 -c trees.c
bcc32 -c zutil.c
bcc32 -c deflate.c
bcc32 -c infback.c
bcc32 -c inflate.c
bcc32 -c uncompr.c
del cfitsio.lib
tlib cfitsio +buffers +cfileio +checksum +drvrfile +drvrmem 
tlib cfitsio +editcol +edithdu +eval_l +eval_y +eval_f +fitscore
tlib cfitsio +getcol +getcolb +getcolsb +getcoli +getcolj +getcolk +getcoluk 
tlib cfitsio +getcolui +getcoluj +getcole +getcold +getcoll +getcols
tlib cfitsio +getkey +group +grparser +histo +iraffits +modkey +putkey 
tlib cfitsio +putcol  +putcolb +putcoli +putcolj +putcolk +putcole +putcold
tlib cfitsio +putcoll +putcols +putcolu +putcolui +putcoluj +putcoluk
tlib cfitsio +region +scalnull +swapproc +wcsutil +wcssub +putcolsb
tlib cfitsio +imcompress +quantize +ricecomp +pliocomp
tlib cfitsio +fits_hcompress +fits_hdecompress
tlib cfitsio +zuncompress +zcompress +adler32 +crc32 +inffast
tlib cfitsio +inftrees +trees +zutil +deflate +infback +inflate +uncompr
bcc32 -f testprog.c cfitsio.lib
bcc32 -f cookbook.c cfitsio.lib

cfitsio-3.47/modkey.c0000644000225700000360000020324113464573432014046 0ustar  cagordonlhea/*  This file, modkey.c, contains routines that modify, insert, or update  */
/*  keywords in a FITS header.                                             */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
/* stddef.h is apparently needed to define size_t */
#include 
#include 
#include 
#include "fitsio2.h"
/*--------------------------------------------------------------------------*/
int ffuky( fitsfile *fptr,     /* I - FITS file pointer        */
           int  datatype,      /* I - datatype of the value    */
           const char *keyname,/* I - name of keyword to write */
           void *value,        /* I - keyword value            */
           const char *comm,   /* I - keyword comment          */
           int  *status)       /* IO - error status            */
/*
  Update the keyword, value and comment in the FITS header.
  The datatype is specified by the 2nd argument.
*/
{
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (datatype == TSTRING)
    {
        ffukys(fptr, keyname, (char *) value, comm, status);
    }
    else if (datatype == TBYTE)
    {
        ffukyj(fptr, keyname, (LONGLONG) *(unsigned char *) value, comm, status);
    }
    else if (datatype == TSBYTE)
    {
        ffukyj(fptr, keyname, (LONGLONG) *(signed char *) value, comm, status);
    }
    else if (datatype == TUSHORT)
    {
        ffukyj(fptr, keyname, (LONGLONG) *(unsigned short *) value, comm, status);
    }
    else if (datatype == TSHORT)
    {
        ffukyj(fptr, keyname, (LONGLONG) *(short *) value, comm, status);
    }
    else if (datatype == TINT)
    {
        ffukyj(fptr, keyname, (LONGLONG) *(int *) value, comm, status);
    }
    else if (datatype == TUINT)
    {
        ffukyg(fptr, keyname, (double) *(unsigned int *) value, 0,
               comm, status);
    }
    else if (datatype == TLOGICAL)
    {
        ffukyl(fptr, keyname, *(int *) value, comm, status);
    }
    else if (datatype == TULONG)
    {
        ffukyg(fptr, keyname, (double) *(unsigned long *) value, 0,
               comm, status);
    }
    else if (datatype == TLONG)
    {
        ffukyj(fptr, keyname, (LONGLONG) *(long *) value, comm, status);
    }
    else if (datatype == TLONGLONG)
    {
        ffukyj(fptr, keyname, *(LONGLONG *) value, comm, status);
    }
    else if (datatype == TFLOAT)
    {
        ffukye(fptr, keyname, *(float *) value, -7, comm, status);
    }
    else if (datatype == TDOUBLE)
    {
        ffukyd(fptr, keyname, *(double *) value, -15, comm, status);
    }
    else if (datatype == TCOMPLEX)
    {
        ffukyc(fptr, keyname, (float *) value, -7, comm, status);
    }
    else if (datatype == TDBLCOMPLEX)
    {
        ffukym(fptr, keyname, (double *) value, -15, comm, status);
    }
    else
        *status = BAD_DATATYPE;

    return(*status);
} 
/*--------------------------------------------------------------------------*/
int ffukyu(fitsfile *fptr,      /* I - FITS file pointer  */
           const char *keyname, /* I - keyword name       */
           const char *comm,    /* I - keyword comment    */
           int *status)         /* IO - error status      */
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkyu(fptr, keyname, comm, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffpkyu(fptr, keyname, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffukys(fitsfile *fptr,       /* I - FITS file pointer  */
           const char *keyname,  /* I - keyword name       */
           const char *value,    /* I - keyword value      */
           const char *comm,     /* I - keyword comment    */
           int *status)          /* IO - error status      */ 
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkys(fptr, keyname, value, comm, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffpkys(fptr, keyname, value, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffukls(fitsfile *fptr,      /* I - FITS file pointer  */
           const char *keyname, /* I - keyword name       */
           const char *value,   /* I - keyword value      */
           const char *comm,    /* I - keyword comment    */
           int *status)         /* IO - error status      */ 
{
    /* update a long string keyword */

    int tstatus;
    char junk[FLEN_ERRMSG];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkls(fptr, keyname, value, comm, status) == KEY_NO_EXIST)
    {
        /* since the ffmkls call failed, it wrote a bogus error message */
        fits_read_errmsg(junk);  /* clear the error message */
	
        *status = tstatus;
        ffpkls(fptr, keyname, value, comm, status);
    }
    return(*status);
}/*--------------------------------------------------------------------------*/
int ffukyl(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           int value,          /* I - keyword value      */
           const char *comm,   /* I - keyword comment    */
           int *status)        /* IO - error status      */
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkyl(fptr, keyname, value, comm, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffpkyl(fptr, keyname, value, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffukyj(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           LONGLONG value,     /* I - keyword value      */
           const char *comm,   /* I - keyword comment    */
           int *status)        /* IO - error status      */
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkyj(fptr, keyname, value, comm, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffpkyj(fptr, keyname, value, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffukyf(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           float value,        /* I - keyword value      */
           int decim,          /* I - no of decimals     */         
           const char *comm,   /* I - keyword comment    */
           int *status)        /* IO - error status      */
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkyf(fptr, keyname, value, decim, comm, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffpkyf(fptr, keyname, value, decim, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffukye(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           float value,        /* I - keyword value      */
           int decim,          /* I - no of decimals     */
           const char *comm,   /* I - keyword comment    */
           int *status)        /* IO - error status      */
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkye(fptr, keyname, value, decim, comm, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffpkye(fptr, keyname, value, decim, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffukyg(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           double value,       /* I - keyword value      */
           int decim,          /* I - no of decimals     */
           const char *comm,   /* I - keyword comment    */
           int *status)        /* IO - error status      */
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkyg(fptr, keyname, value, decim, comm, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffpkyg(fptr, keyname, value, decim, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffukyd(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           double value,       /* I - keyword value      */
           int decim,          /* I - no of decimals     */
           const char *comm,   /* I - keyword comment    */
           int *status)        /* IO - error status      */
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkyd(fptr, keyname, value, decim, comm, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffpkyd(fptr, keyname, value, decim, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffukfc(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           float *value,       /* I - keyword value      */
           int decim,          /* I - no of decimals     */         
           const char *comm,   /* I - keyword comment    */
           int *status)        /* IO - error status      */
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkfc(fptr, keyname, value, decim, comm, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffpkfc(fptr, keyname, value, decim, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffukyc(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           float *value,       /* I - keyword value      */
           int decim,          /* I - no of decimals     */
           const char *comm,   /* I - keyword comment    */
           int *status)        /* IO - error status      */
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkyc(fptr, keyname, value, decim, comm, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffpkyc(fptr, keyname, value, decim, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffukfm(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           double *value,      /* I - keyword value      */
           int decim,          /* I - no of decimals     */
           const char *comm,   /* I - keyword comment    */
           int *status)        /* IO - error status      */
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkfm(fptr, keyname, value, decim, comm, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffpkfm(fptr, keyname, value, decim, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffukym(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           double *value,      /* I - keyword value      */
           int decim,          /* I - no of decimals     */
           const char *comm,   /* I - keyword comment    */
           int *status)        /* IO - error status      */
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmkym(fptr, keyname, value, decim, comm, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffpkym(fptr, keyname, value, decim, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffucrd(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           const char *card,   /* I - card string value  */
           int *status)        /* IO - error status      */
{
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = *status;

    if (ffmcrd(fptr, keyname, card, status) == KEY_NO_EXIST)
    {
        *status = tstatus;
        ffprec(fptr, card, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmrec(fitsfile *fptr,    /* I - FITS file pointer               */
           int nkey,          /* I - number of the keyword to modify */
           const char *card,  /* I - card string value               */
           int *status)       /* IO - error status                   */
{
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffmaky(fptr, nkey+1, status);
    ffmkey(fptr, card, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmcrd(fitsfile *fptr,      /* I - FITS file pointer  */
           const char *keyname, /* I - keyword name       */
           const char *card,    /* I - card string value  */
           int *status)         /* IO - error status      */
{
    char tcard[FLEN_CARD], valstring[FLEN_CARD], comm[FLEN_CARD], value[FLEN_CARD];
    char nextcomm[FLEN_COMMENT];
    int keypos, len;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgcrd(fptr, keyname, tcard, status) > 0)
        return(*status);

    ffmkey(fptr, card, status);

    /* calc position of keyword in header */
    keypos = (int) ((((fptr->Fptr)->nextkey) - ((fptr->Fptr)->headstart[(fptr->Fptr)->curhdu])) / 80) + 1;

    ffpsvc(tcard, valstring, comm, status);

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* check for string value which may be continued over multiple keywords */
    ffpmrk(); /* put mark on message stack; erase any messages after this */
    ffc2s(valstring, value, status);   /* remove quotes and trailing spaces */

    if (*status == VALUE_UNDEFINED) {
       ffcmrk();  /* clear any spurious error messages, back to the mark */
       *status = 0;
    } else {
 
      len = strlen(value);

      while (len && value[len - 1] == '&')  /* ampersand used as continuation char */
      {
        ffgcnt(fptr, value, nextcomm, status);
        if (*value)
        {
            ffdrec(fptr, keypos, status);  /* delete the keyword */
            len = strlen(value);
        }
        else   /* a null valstring indicates no continuation */
            len = 0;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmnam(fitsfile *fptr,     /* I - FITS file pointer     */
           const char *oldname,/* I - existing keyword name */
           const char *newname,/* I - new name for keyword  */
           int *status)        /* IO - error status         */
{
    char comm[FLEN_COMMENT];
    char value[FLEN_VALUE];
    char card[FLEN_CARD];
 
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, oldname, value, comm, status) > 0)
        return(*status);

    ffmkky(newname, value, comm, card, status);  /* construct the card */
    ffmkey(fptr, card, status);  /* rewrite with new name */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmcom(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           const char *comm,   /* I - keyword comment    */
           int *status)        /* IO - error status      */
{
    char oldcomm[FLEN_COMMENT];
    char value[FLEN_VALUE];
    char card[FLEN_CARD];
 
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, value, oldcomm, status) > 0)
        return(*status);

    ffmkky(keyname, value, comm, card, status);  /* construct the card */
    ffmkey(fptr, card, status);  /* rewrite with new comment */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpunt(fitsfile *fptr,     /* I - FITS file pointer   */
           const char *keyname,/* I - keyword name        */
           const char *unit,   /* I - keyword unit string */
           int *status)        /* IO - error status       */
/*
    Write (put) the units string into the comment field of the existing keyword.
    This routine uses a  FITS convention  in which the units are enclosed in 
    square brackets following the '/' comment field delimiter, e.g.:

    KEYWORD =                   12 / [kpc] comment string goes here
*/
{
    char oldcomm[FLEN_COMMENT];
    char newcomm[FLEN_COMMENT];
    char value[FLEN_VALUE];
    char card[FLEN_CARD];
    char *loc;
    size_t len;
 
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, value, oldcomm, status) > 0)
        return(*status);

    /* copy the units string to the new comment string if not null */
    if (*unit)
    {
        strcpy(newcomm, "[");
        strncat(newcomm, unit, 45);  /* max allowed length is about 45 chars */
        strcat(newcomm, "] ");
        len = strlen(newcomm);  
        len = FLEN_COMMENT - len - 1;  /* amount of space left in the field */
    }
    else
    {
        newcomm[0] = '\0';
        len = FLEN_COMMENT - 1;
    }

    if (oldcomm[0] == '[')  /* check for existing units field */
    {
        loc = strchr(oldcomm, ']');  /* look for the closing bracket */
        if (loc)
        {
            loc++;
            while (*loc == ' ')   /* skip any blank spaces */
               loc++;

            strncat(newcomm, loc, len);  /* concat remainder of comment */
        }
        else
        {
            strncat(newcomm, oldcomm, len);  /* append old comment onto new */
        }
    }
    else
    {
        strncat(newcomm, oldcomm, len);
    }

    ffmkky(keyname, value, newcomm, card, status);  /* construct the card */
    ffmkey(fptr, card, status);  /* rewrite with new units string */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkyu(fitsfile *fptr,     /* I - FITS file pointer  */
           const char *keyname,/* I - keyword name       */
           const char *comm,   /* I - keyword comment    */
           int *status)        /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char oldcomm[FLEN_COMMENT];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, valstring, oldcomm, status) > 0)
        return(*status);                               /* get old comment */

    strcpy(valstring," ");  /* create a dummy value string */

    if (!comm || comm[0] == '&')  /* preserve the current comment string */
        ffmkky(keyname, valstring, oldcomm, card, status);
    else
        ffmkky(keyname, valstring, comm, card, status);

    ffmkey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkys(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           const char *value,       /* I - keyword value      */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
  /* NOTE: This routine does not support long continued strings */
  /*  It will correctly overwrite an existing long continued string, */
  /*  but it will not write a new long string.  */

    char oldval[FLEN_VALUE], valstring[FLEN_VALUE];
    char oldcomm[FLEN_COMMENT];
    char card[FLEN_CARD], nextcomm[FLEN_COMMENT];
    int len, keypos;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, oldval, oldcomm, status) > 0)
        return(*status);                               /* get old comment */

    ffs2c(value, valstring, status);   /* convert value to a string */

    if (!comm || comm[0] == '&')  /* preserve the current comment string */
        ffmkky(keyname, valstring, oldcomm, card, status);
    else
        ffmkky(keyname, valstring, comm, card, status);

    ffmkey(fptr, card, status); /* overwrite the previous keyword */

    keypos = (int) (((((fptr->Fptr)->nextkey) - ((fptr->Fptr)->headstart[(fptr->Fptr)->curhdu])) / 80) + 1);

    if (*status > 0)           
        return(*status);

    /* check if old string value was continued over multiple keywords */
    ffpmrk(); /* put mark on message stack; erase any messages after this */
    ffc2s(oldval, valstring, status); /* remove quotes and trailing spaces */

    if (*status == VALUE_UNDEFINED) {
       ffcmrk();  /* clear any spurious error messages, back to the mark */
       *status = 0;
    } else {
        
      len = strlen(valstring);

      while (len && valstring[len - 1] == '&')  /* ampersand is continuation char */
      {
        ffgcnt(fptr, valstring, nextcomm, status);
        if (*valstring)
        {
            ffdrec(fptr, keypos, status);  /* delete the continuation */
            len = strlen(valstring);
        }
        else   /* a null valstring indicates no continuation */
            len = 0;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkls( fitsfile *fptr,           /* I - FITS file pointer        */
            const char *keyname,      /* I - name of keyword to write */
            const char *value,        /* I - keyword value            */
            const char *incomm,       /* I - keyword comment          */
            int  *status)             /* IO - error status            */
/*
  Modify the value and optionally the comment of a long string keyword.
  This routine supports the
  HEASARC long string convention and can modify arbitrarily long string
  keyword values.  The value is continued over multiple keywords that
  have the name COMTINUE without an equal sign in column 9 of the card.
  This routine also supports simple string keywords which are less than
  69 characters in length.

  This routine is not very efficient, so it should be used sparingly.
*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD], tmpkeyname[FLEN_CARD];
    char comm[FLEN_COMMENT];
    char tstring[FLEN_VALUE], *cptr;
    char *longval;
    int next, remain, vlen, nquote, nchar, namelen, contin, tstatus = -1;
    int nkeys, keypos;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (!incomm || incomm[0] == '&')  /* preserve the old comment string */
    {
        ffghps(fptr, &nkeys, &keypos, status); /* save current position */

        if (ffgkls(fptr, keyname, &longval, comm, status) > 0)
            return(*status);            /* keyword doesn't exist */

        free(longval);  /* don't need the old value */

        /* move back to previous position to ensure that we delete */
        /* the right keyword in case there are more than one keyword */
        /* with this same name. */
        ffgrec(fptr, keypos - 1, card, status); 
    } else {
        /* copy the input comment string */
        strncpy(comm, incomm, FLEN_COMMENT-1);
        comm[FLEN_COMMENT-1] = '\0';
    }

    /* delete the old keyword */
    if (ffdkey(fptr, keyname, status) > 0)
        return(*status);            /* keyword doesn't exist */

    ffghps(fptr, &nkeys, &keypos, status); /* save current position */

    /* now construct the new keyword, and insert into header */
    remain = strlen(value);    /* number of characters to write out */
    next = 0;                  /* pointer to next character to write */
    
    /* count the number of single quote characters in the string */
    nquote = 0;
    cptr = strchr(value, '\'');   /* search for quote character */

    while (cptr)  /* search for quote character */
    {
        nquote++;            /*  increment no. of quote characters  */
        cptr++;              /*  increment pointer to next character */
        cptr = strchr(cptr, '\'');  /* search for another quote char */
    }

    strncpy(tmpkeyname, keyname, 80);
    tmpkeyname[80] = '\0';
    
    cptr = tmpkeyname;
    while(*cptr == ' ')   /* skip over leading spaces in name */
        cptr++;

    /* determine the number of characters that will fit on the line */
    /* Note: each quote character is expanded to 2 quotes */

    namelen = strlen(cptr);
    if (namelen <= 8 && (fftkey(cptr, &tstatus) <= 0) )
    {
        /* This a normal 8-character FITS keyword */
        nchar = 68 - nquote; /*  max of 68 chars fit in a FITS string value */
    }
    else
    {
	nchar = 80 - nquote - namelen - 5;
    }

    contin = 0;
    while (remain > 0)
    {
        if (nchar > FLEN_VALUE-1)
        {
           ffpmsg("longstr keyword value is too long (ffmkls)");
           return (*status=BAD_KEYCHAR);
        }
        strncpy(tstring, &value[next], nchar); /* copy string to temp buff */
        tstring[nchar] = '\0';
        ffs2c(tstring, valstring, status);  /* put quotes around the string */

        if (remain > nchar)   /* if string is continued, put & as last char */
        {
            vlen = strlen(valstring);
            nchar -= 1;        /* outputting one less character now */

            if (valstring[vlen-2] != '\'')
                valstring[vlen-2] = '&';  /*  over write last char with &  */
            else
            { /* last char was a pair of single quotes, so over write both */
                valstring[vlen-3] = '&';
                valstring[vlen-1] = '\0';
            }
        }

        if (contin)           /* This is a CONTINUEd keyword */
        {
           ffmkky("CONTINUE", valstring, comm, card, status); /* make keyword */
           strncpy(&card[8], "   ",  2);  /* overwrite the '=' */
        }
        else
        {
           ffmkky(keyname, valstring, comm, card, status);  /* make keyword */
        }

        ffirec(fptr, keypos, card, status);  /* insert the keyword */
       
        keypos++;        /* next insert position */
        contin = 1;
        remain -= nchar;
        next  += nchar;
        nchar = 68 - nquote;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkyl(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           int value,               /* I - keyword value      */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char oldcomm[FLEN_COMMENT];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, valstring, oldcomm, status) > 0)
        return(*status);                               /* get old comment */

    ffl2c(value, valstring, status);   /* convert value to a string */

    if (!comm || comm[0] == '&')  /* preserve the current comment string */
        ffmkky(keyname, valstring, oldcomm, card, status);
    else
        ffmkky(keyname, valstring, comm, card, status);

    ffmkey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkyj(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           LONGLONG value,          /* I - keyword value      */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char oldcomm[FLEN_COMMENT];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, valstring, oldcomm, status) > 0)
        return(*status);                               /* get old comment */

    ffi2c(value, valstring, status);   /* convert value to a string */

    if (!comm || comm[0] == '&')  /* preserve the current comment string */
        ffmkky(keyname, valstring, oldcomm, card, status);
    else
        ffmkky(keyname, valstring, comm, card, status);

    ffmkey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkyf(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           float value,             /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char oldcomm[FLEN_COMMENT];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, valstring, oldcomm, status) > 0)
        return(*status);                               /* get old comment */

    ffr2f(value, decim, valstring, status);   /* convert value to a string */

    if (!comm || comm[0] == '&')  /* preserve the current comment string */
        ffmkky(keyname, valstring, oldcomm, card, status);
    else
        ffmkky(keyname, valstring, comm, card, status);

    ffmkey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkye(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           float value,             /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char oldcomm[FLEN_COMMENT];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, valstring, oldcomm, status) > 0)
        return(*status);                               /* get old comment */

    ffr2e(value, decim, valstring, status);   /* convert value to a string */

    if (!comm || comm[0] == '&')  /* preserve the current comment string */
        ffmkky(keyname, valstring, oldcomm, card, status);
    else
        ffmkky(keyname, valstring, comm, card, status);

    ffmkey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkyg(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           double value,            /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char oldcomm[FLEN_COMMENT];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, valstring, oldcomm, status) > 0)
        return(*status);                               /* get old comment */

    ffd2f(value, decim, valstring, status);   /* convert value to a string */

    if (!comm || comm[0] == '&')  /* preserve the current comment string */
        ffmkky(keyname, valstring, oldcomm, card, status);
    else
        ffmkky(keyname, valstring, comm, card, status);

    ffmkey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkyd(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           double value,            /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char oldcomm[FLEN_COMMENT];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, valstring, oldcomm, status) > 0)
        return(*status);                               /* get old comment */

    ffd2e(value, decim, valstring, status);   /* convert value to a string */

    if (!comm || comm[0] == '&')  /* preserve the current comment string */
        ffmkky(keyname, valstring, oldcomm, card, status);
    else
        ffmkky(keyname, valstring, comm, card, status);

    ffmkey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkfc(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           float *value,            /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE], tmpstring[FLEN_VALUE];
    char oldcomm[FLEN_COMMENT];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, valstring, oldcomm, status) > 0)
        return(*status);                               /* get old comment */

    strcpy(valstring, "(" );
    ffr2f(value[0], decim, tmpstring, status); /* convert to string */
    if (strlen(tmpstring)+3 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffmkfc)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffr2f(value[1], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring) + strlen(tmpstring)+1 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffmkfc)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ")");

    if (!comm || comm[0] == '&')  /* preserve the current comment string */
        ffmkky(keyname, valstring, oldcomm, card, status);
    else
        ffmkky(keyname, valstring, comm, card, status);

    ffmkey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkyc(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           float *value,            /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE], tmpstring[FLEN_VALUE];
    char oldcomm[FLEN_COMMENT];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, valstring, oldcomm, status) > 0)
        return(*status);                               /* get old comment */

    strcpy(valstring, "(" );
    ffr2e(value[0], decim, tmpstring, status); /* convert to string */
    if (strlen(tmpstring)+3 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffmkyc)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffr2e(value[1], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring) + strlen(tmpstring)+1 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffmkyc)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ")");

    if (!comm || comm[0] == '&')  /* preserve the current comment string */
        ffmkky(keyname, valstring, oldcomm, card, status);
    else
        ffmkky(keyname, valstring, comm, card, status);

    ffmkey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkfm(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           double *value,           /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE], tmpstring[FLEN_VALUE];
    char oldcomm[FLEN_COMMENT];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, valstring, oldcomm, status) > 0)
        return(*status);                               /* get old comment */

    strcpy(valstring, "(" );
    ffd2f(value[0], decim, tmpstring, status); /* convert to string */
    if (strlen(tmpstring)+3 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffmkfm)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffd2f(value[1], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring) + strlen(tmpstring)+1 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffmkfm)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ")");

    if (!comm || comm[0] == '&')  /* preserve the current comment string */
        ffmkky(keyname, valstring, oldcomm, card, status);
    else
        ffmkky(keyname, valstring, comm, card, status);

    ffmkey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffmkym(fitsfile *fptr,    /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           double *value,     /* I - keyword value      */
           int decim,         /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */
           int *status)       /* IO - error status      */
{
    char valstring[FLEN_VALUE], tmpstring[FLEN_VALUE];
    char oldcomm[FLEN_COMMENT];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, valstring, oldcomm, status) > 0)
        return(*status);                               /* get old comment */

    strcpy(valstring, "(" );
    ffd2e(value[0], decim, tmpstring, status); /* convert to string */
    if (strlen(tmpstring)+3 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffmkym)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffd2e(value[1], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring) + strlen(tmpstring)+1 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffmkym)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ")");

    if (!comm || comm[0] == '&')  /* preserve the current comment string */
        ffmkky(keyname, valstring, oldcomm, card, status);
    else
        ffmkky(keyname, valstring, comm, card, status);

    ffmkey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikyu(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
/*
  Insert a null-valued keyword and comment into the FITS header.  
*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    strcpy(valstring," ");  /* create a dummy value string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffikey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikys(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           const char *value,       /* I - keyword value      */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffs2c(value, valstring, status);   /* put quotes around the string */

    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffikey(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikls( fitsfile *fptr,           /* I - FITS file pointer        */
            const char *keyname,      /* I - name of keyword to write */
            const char *value,        /* I - keyword value            */
            const char *comm,         /* I - keyword comment          */
            int  *status)             /* IO - error status            */
/*
  Insert a long string keyword.  This routine supports the
  HEASARC long string convention and can insert arbitrarily long string
  keyword values.  The value is continued over multiple keywords that
  have the name COMTINUE without an equal sign in column 9 of the card.
  This routine also supports simple string keywords which are less than
  69 characters in length.
*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD], tmpkeyname[FLEN_CARD];
    char tstring[FLEN_VALUE], *cptr;
    int next, remain, vlen, nquote, nchar, namelen, contin, tstatus = -1;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /*  construct the new keyword, and insert into header */
    remain = strlen(value);    /* number of characters to write out */
    next = 0;                  /* pointer to next character to write */
    
    /* count the number of single quote characters in the string */
    nquote = 0;
    cptr = strchr(value, '\'');   /* search for quote character */

    while (cptr)  /* search for quote character */
    {
        nquote++;            /*  increment no. of quote characters  */
        cptr++;              /*  increment pointer to next character */
        cptr = strchr(cptr, '\'');  /* search for another quote char */
    }


    strncpy(tmpkeyname, keyname, 80);
    tmpkeyname[80] = '\0';
    
    cptr = tmpkeyname;
    while(*cptr == ' ')   /* skip over leading spaces in name */
        cptr++;

    /* determine the number of characters that will fit on the line */
    /* Note: each quote character is expanded to 2 quotes */

    namelen = strlen(cptr);
    if (namelen <= 8 && (fftkey(cptr, &tstatus) <= 0) )
    {
        /* This a normal 8-character FITS keyword */
        nchar = 68 - nquote; /*  max of 68 chars fit in a FITS string value */
    }
    else
    {
	nchar = 80 - nquote - namelen - 5;
    }

    contin = 0;
    while (remain > 0)
    {
        if (nchar > FLEN_VALUE-1)
        {
           ffpmsg("longstr keyword value is too long (ffikls)");
           return (*status=BAD_KEYCHAR);
        }
        strncpy(tstring, &value[next], nchar); /* copy string to temp buff */
        tstring[nchar] = '\0';
        ffs2c(tstring, valstring, status);  /* put quotes around the string */

        if (remain > nchar)   /* if string is continued, put & as last char */
        {
            vlen = strlen(valstring);
            nchar -= 1;        /* outputting one less character now */

            if (valstring[vlen-2] != '\'')
                valstring[vlen-2] = '&';  /*  over write last char with &  */
            else
            { /* last char was a pair of single quotes, so over write both */
                valstring[vlen-3] = '&';
                valstring[vlen-1] = '\0';
            }
        }

        if (contin)           /* This is a CONTINUEd keyword */
        {
           ffmkky("CONTINUE", valstring, comm, card, status); /* make keyword */
           strncpy(&card[8], "   ",  2);  /* overwrite the '=' */
        }
        else
        {
           ffmkky(keyname, valstring, comm, card, status);  /* make keyword */
        }

        ffikey(fptr, card, status);  /* insert the keyword */
       
        contin = 1;
        remain -= nchar;
        next  += nchar;
        nchar = 68 - nquote;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikyl(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           int value,               /* I - keyword value      */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffl2c(value, valstring, status);   /* convert logical to 'T' or 'F' */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffikey(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikyj(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           LONGLONG value,          /* I - keyword value      */
           const char *comm,        /* I - keyword comment    */
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffi2c(value, valstring, status);   /* convert to formatted string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffikey(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikyf(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           float value,             /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */ 
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffr2f(value, decim, valstring, status);   /* convert to formatted string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffikey(fptr, card, status);  /* write the keyword*/

    return(*status); 
}
/*--------------------------------------------------------------------------*/
int ffikye(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           float value,             /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */ 
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffr2e(value, decim, valstring, status);   /* convert to formatted string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffikey(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikyg(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           double value,            /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */ 
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffd2f(value, decim, valstring, status);   /* convert to formatted string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffikey(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikyd(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           double value,            /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */ 
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffd2e(value, decim, valstring, status);   /* convert to formatted string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffikey(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikfc(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           float *value,            /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */ 
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE], tmpstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    strcpy(valstring, "(" );
    ffr2f(value[0], decim, tmpstring, status); /* convert to string */
    if (strlen(tmpstring)+3 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffikfc)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffr2f(value[1], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring) + strlen(tmpstring)+1 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffikfc)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ")");

    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffikey(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikyc(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           float *value,            /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */ 
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE], tmpstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    strcpy(valstring, "(" );
    ffr2e(value[0], decim, tmpstring, status); /* convert to string */
    if (strlen(tmpstring)+3 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffikyc)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffr2e(value[1], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring) + strlen(tmpstring)+1 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffikyc)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ")");

    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffikey(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikfm(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           double *value,           /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */ 
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE], tmpstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);


    strcpy(valstring, "(" );
    ffd2f(value[0], decim, tmpstring, status); /* convert to string */
    if (strlen(tmpstring)+3 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffikfm)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffd2f(value[1], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring) + strlen(tmpstring)+1 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffikfm)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ")");

    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffikey(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikym(fitsfile *fptr,          /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           double *value,           /* I - keyword value      */
           int decim,               /* I - no of decimals     */
           const char *comm,        /* I - keyword comment    */ 
           int *status)             /* IO - error status      */
{
    char valstring[FLEN_VALUE], tmpstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    strcpy(valstring, "(" );
    ffd2e(value[0], decim, tmpstring, status); /* convert to string */
    if (strlen(tmpstring)+3 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffikym)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffd2e(value[1], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring) + strlen(tmpstring)+1 > FLEN_VALUE-1)
    {
       ffpmsg("complex key value too long (ffikym)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ")");

    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffikey(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffirec(fitsfile *fptr,    /* I - FITS file pointer              */
           int nkey,          /* I - position to insert new keyword */
           const char *card,  /* I - card string value              */
           int *status)       /* IO - error status                  */
{
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffmaky(fptr, nkey, status);  /* move to insert position */
    ffikey(fptr, card, status);  /* insert the keyword card */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffikey(fitsfile *fptr,    /* I - FITS file pointer  */
           const char *card,  /* I - card string value  */
           int *status)       /* IO - error status      */
/*
  insert a keyword at the position of (fptr->Fptr)->nextkey
*/
{
    int ii, len, nshift, keylength;
    long nblocks;
    LONGLONG bytepos;
    char *inbuff, *outbuff, *tmpbuff, buff1[FLEN_CARD], buff2[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if ( ((fptr->Fptr)->datastart - (fptr->Fptr)->headend) == 80) /* only room for END card */
    {
        nblocks = 1;
        if (ffiblk(fptr, nblocks, 0, status) > 0) /* add new 2880-byte block*/
            return(*status);  
    }

    /* no. keywords to shift */
    nshift= (int) (( (fptr->Fptr)->headend - (fptr->Fptr)->nextkey ) / 80); 

    strncpy(buff2, card, 80);     /* copy card to output buffer */
    buff2[80] = '\0';

    len = strlen(buff2);

    /* silently replace any illegal characters with a space */
    for (ii=0; ii < len; ii++)   
        if (buff2[ii] < ' ' || buff2[ii] > 126) buff2[ii] = ' ';

    for (ii=len; ii < 80; ii++)   /* fill buffer with spaces if necessary */
        buff2[ii] = ' ';

    keylength = strcspn(buff2, "=");
    if (keylength == 80) keylength = 8;
    
    /* test for the common commentary keywords which by definition have 8-char names */
    if ( !fits_strncasecmp( "COMMENT ", buff2, 8) || !fits_strncasecmp( "HISTORY ", buff2, 8) ||
         !fits_strncasecmp( "        ", buff2, 8) || !fits_strncasecmp( "CONTINUE", buff2, 8) )
	 keylength = 8;

    for (ii=0; ii < keylength; ii++)       /* make sure keyword name is uppercase */
        buff2[ii] = toupper(buff2[ii]);

    fftkey(buff2, status);        /* test keyword name contains legal chars */

/*  no need to do this any more, since any illegal characters have been removed
    fftrec(buff2, status);  */      /* test rest of keyword for legal chars   */

    inbuff = buff1;
    outbuff = buff2;

    bytepos = (fptr->Fptr)->nextkey;           /* pointer to next keyword in header */
    ffmbyt(fptr, bytepos, REPORT_EOF, status);

    for (ii = 0; ii < nshift; ii++) /* shift each keyword down one position */
    {
        ffgbyt(fptr, 80, inbuff, status);   /* read the current keyword */

        ffmbyt(fptr, bytepos, REPORT_EOF, status); /* move back */
        ffpbyt(fptr, 80, outbuff, status);  /* overwrite with other buffer */

        tmpbuff = inbuff;   /* swap input and output buffers */
        inbuff = outbuff;
        outbuff = tmpbuff;

        bytepos += 80;
    }

    ffpbyt(fptr, 80, outbuff, status);  /* write the final keyword */

    (fptr->Fptr)->headend += 80; /* increment the position of the END keyword */
    (fptr->Fptr)->nextkey += 80; /* increment the pointer to next keyword */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffdkey(fitsfile *fptr,    /* I - FITS file pointer  */
           const char *keyname,     /* I - keyword name       */
           int *status)       /* IO - error status      */
/*
  delete a specified header keyword
*/
{
    int keypos, len;
    char valstring[FLEN_VALUE], comm[FLEN_COMMENT], value[FLEN_VALUE];
    char message[FLEN_ERRMSG], nextcomm[FLEN_COMMENT];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgkey(fptr, keyname, valstring, comm, status) > 0) /* read keyword */
    {
        snprintf(message, FLEN_ERRMSG,"Could not find the %s keyword to delete (ffdkey)",
                keyname);
        ffpmsg(message);
        return(*status);
    }

    /* calc position of keyword in header */
    keypos = (int) ((((fptr->Fptr)->nextkey) - ((fptr->Fptr)->headstart[(fptr->Fptr)->curhdu])) / 80);

    ffdrec(fptr, keypos, status);  /* delete the keyword */

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* check for string value which may be continued over multiple keywords */
    ffpmrk(); /* put mark on message stack; erase any messages after this */
    ffc2s(valstring, value, status);   /* remove quotes and trailing spaces */

    if (*status == VALUE_UNDEFINED) {
       ffcmrk();  /* clear any spurious error messages, back to the mark */
       *status = 0;
    } else {
 
      len = strlen(value);

      while (len && value[len - 1] == '&')  /* ampersand used as continuation char */
      {
        ffgcnt(fptr, value, nextcomm, status);
        if (*value)
        {
            ffdrec(fptr, keypos, status);  /* delete the keyword */
            len = strlen(value);
        }
        else   /* a null valstring indicates no continuation */
            len = 0;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffdstr(fitsfile *fptr,    /* I - FITS file pointer  */
           const char *string,     /* I - keyword name       */
           int *status)       /* IO - error status      */
/*
  delete a specified header keyword containing the input string
*/
{
    int keypos, len;
    char valstring[FLEN_VALUE], comm[FLEN_COMMENT], value[FLEN_VALUE];
    char card[FLEN_CARD], message[FLEN_ERRMSG], nextcomm[FLEN_COMMENT];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (ffgstr(fptr, string, card, status) > 0) /* read keyword */
    {
        snprintf(message, FLEN_ERRMSG,"Could not find the %s keyword to delete (ffdkey)",
                string);
        ffpmsg(message);
        return(*status);
    }

    /* calc position of keyword in header */
    keypos = (int) ((((fptr->Fptr)->nextkey) - ((fptr->Fptr)->headstart[(fptr->Fptr)->curhdu])) / 80);

    ffdrec(fptr, keypos, status);  /* delete the keyword */

    /* check for string value which may be continued over multiple keywords */
    ffpsvc(card, valstring, comm, status);

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* check for string value which may be continued over multiple keywords */
    ffpmrk(); /* put mark on message stack; erase any messages after this */
    ffc2s(valstring, value, status);   /* remove quotes and trailing spaces */

    if (*status == VALUE_UNDEFINED) {
       ffcmrk();  /* clear any spurious error messages, back to the mark */
       *status = 0;
    } else {
 
      len = strlen(value);

      while (len && value[len - 1] == '&')  /* ampersand used as continuation char */
      {
        ffgcnt(fptr, value, nextcomm, status);
        if (*value)
        {
            ffdrec(fptr, keypos, status);  /* delete the keyword */
            len = strlen(value);
        }
        else   /* a null valstring indicates no continuation */
            len = 0;
      }
    }

    return(*status);
}/*--------------------------------------------------------------------------*/
int ffdrec(fitsfile *fptr,   /* I - FITS file pointer  */
           int keypos,       /* I - position in header of keyword to delete */
           int *status)      /* IO - error status      */
/*
  Delete a header keyword at position keypos. The 1st keyword is at keypos=1.
*/
{
    int ii, nshift;
    LONGLONG bytepos;
    char *inbuff, *outbuff, *tmpbuff, buff1[81], buff2[81];
    char message[FLEN_ERRMSG];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if (keypos < 1 ||
        keypos > (fptr->Fptr)->headend - (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] / 80 )
        return(*status = KEY_OUT_BOUNDS);

    (fptr->Fptr)->nextkey = (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] + (keypos - 1) * 80;

    nshift=(int) (( (fptr->Fptr)->headend - (fptr->Fptr)->nextkey ) / 80); /* no. keywords to shift */

    if (nshift <= 0)
    {
        snprintf(message, FLEN_ERRMSG,"Cannot delete keyword number %d.  It does not exist.",
                keypos);
        ffpmsg(message);
        return(*status = KEY_OUT_BOUNDS);
    }

    bytepos = (fptr->Fptr)->headend - 80;  /* last keyword in header */  

    /* construct a blank keyword */
    strcpy(buff2, "                                        ");
    strcat(buff2, "                                        ");
    inbuff  = buff1;
    outbuff = buff2;
    for (ii = 0; ii < nshift; ii++) /* shift each keyword up one position */
    {

        ffmbyt(fptr, bytepos, REPORT_EOF, status);
        ffgbyt(fptr, 80, inbuff, status);   /* read the current keyword */

        ffmbyt(fptr, bytepos, REPORT_EOF, status);
        ffpbyt(fptr, 80, outbuff, status);  /* overwrite with next keyword */

        tmpbuff = inbuff;   /* swap input and output buffers */
        inbuff = outbuff;
        outbuff = tmpbuff;

        bytepos -= 80;
    }

    (fptr->Fptr)->headend -= 80; /* decrement the position of the END keyword */
    return(*status);
}

cfitsio-3.47/pliocomp.c0000644000225700000360000001563313464573432014406 0ustar  cagordonlhea/* stdlib is needed for the abs function */
#include 
/*
   The following prototype code was provided by Doug Tody, NRAO, for
   performing conversion between pixel arrays and line lists.  The
   compression technique is used in IRAF.
*/
int pl_p2li (int *pxsrc, int xs, short *lldst, int npix);
int pl_l2pi (short *ll_src, int xs, int *px_dst, int npix);


/*
 * PL_P2L -- Convert a pixel array to a line list.  The length of the list is
 * returned as the function value.
 *
 * Translated from the SPP version using xc -f, f2c.  8Sep99 DCT.
 */

#ifndef min
#define min(a,b)        (((a)<(b))?(a):(b))
#endif
#ifndef max
#define max(a,b)        (((a)>(b))?(a):(b))
#endif

int pl_p2li (int *pxsrc, int xs, short *lldst, int npix)
/* int *pxsrc;                      input pixel array */
/* int xs;                          starting index in pxsrc (?) */
/* short *lldst;                    encoded line list */
/* int npix;                        number of pixels to convert */
{
    /* System generated locals */
    int ret_val, i__1, i__2, i__3;

    /* Local variables */
    int zero, v, x1, hi, ip, dv, xe, np, op, iz, nv = 0, pv, nz;

    /* Parameter adjustments */
    --lldst;
    --pxsrc;

    /* Function Body */
    if (! (npix <= 0)) {
        goto L110;
    }
    ret_val = 0;
    goto L100;
L110:
    lldst[3] = -100;
    lldst[2] = 7;
    lldst[1] = 0;
    lldst[6] = 0;
    lldst[7] = 0;
    xe = xs + npix - 1;
    op = 8;
    zero = 0;
/* Computing MAX */
    i__1 = zero, i__2 = pxsrc[xs];
    pv = max(i__1,i__2);
    x1 = xs;
    iz = xs;
    hi = 1;
    i__1 = xe;
    for (ip = xs; ip <= i__1; ++ip) {
        if (! (ip < xe)) {
            goto L130;
        }
/* Computing MAX */
        i__2 = zero, i__3 = pxsrc[ip + 1];
        nv = max(i__2,i__3);
        if (! (nv == pv)) {
            goto L140;
        }
        goto L120;
L140:
        if (! (pv == 0)) {
            goto L150;
        }
        pv = nv;
        x1 = ip + 1;
        goto L120;
L150:
        goto L131;
L130:
        if (! (pv == 0)) {
            goto L160;
        }
        x1 = xe + 1;
L160:
L131:
        np = ip - x1 + 1;
        nz = x1 - iz;
        if (! (pv > 0)) {
            goto L170;
        }
        dv = pv - hi;
        if (! (dv != 0)) {
            goto L180;
        }
        hi = pv;
        if (! (abs(dv) > 4095)) {
            goto L190;
        }
        lldst[op] = (short) ((pv & 4095) + 4096);
        ++op;
        lldst[op] = (short) (pv / 4096);
        ++op;
        goto L191;
L190:
        if (! (dv < 0)) {
            goto L200;
        }
        lldst[op] = (short) (-dv + 12288);
        goto L201;
L200:
        lldst[op] = (short) (dv + 8192);
L201:
        ++op;
        if (! (np == 1 && nz == 0)) {
            goto L210;
        }
        v = lldst[op - 1];
        lldst[op - 1] = (short) (v | 16384);
        goto L91;
L210:
L191:
L180:
L170:
        if (! (nz > 0)) {
            goto L220;
        }
L230:
        if (! (nz > 0)) {
            goto L232;
        }
        lldst[op] = (short) min(4095,nz);
        ++op;
/* L231: */
        nz += -4095;
        goto L230;
L232:
        if (! (np == 1 && pv > 0)) {
            goto L240;
        }
        lldst[op - 1] = (short) (lldst[op - 1] + 20481);
        goto L91;
L240:
L220:
L250:
        if (! (np > 0)) {
            goto L252;
        }
        lldst[op] = (short) (min(4095,np) + 16384);
        ++op;
/* L251: */
        np += -4095;
        goto L250;
L252:
L91:
        x1 = ip + 1;
        iz = x1;
        pv = nv;
L120:
        ;
    }
/* L121: */
    lldst[4] = (short) ((op - 1) % 32768);
    lldst[5] = (short) ((op - 1) / 32768);
    ret_val = op - 1;
    goto L100;
L100:
    return ret_val;
} /* plp2li_ */

/*
 * PL_L2PI -- Translate a PLIO line list into an integer pixel array.
 * The number of pixels output (always npix) is returned as the function
 * value.
 *
 * Translated from the SPP version using xc -f, f2c.  8Sep99 DCT.
 */

int pl_l2pi (short *ll_src, int xs, int *px_dst, int npix)
/* short *ll_src;                   encoded line list */
/* int xs;                          starting index in ll_src */
/* int *px_dst;                    output pixel array */
/* int npix;                       number of pixels to convert */
{
    /* System generated locals */
    int ret_val, i__1, i__2;

    /* Local variables */
    int data, sw0001, otop, i__, lllen, i1, i2, x1, x2, ip, xe, np,
             op, pv, opcode, llfirt;
    int skipwd;

    /* Parameter adjustments */
    --px_dst;
    --ll_src;

    /* Function Body */
    if (! (ll_src[3] > 0)) {
        goto L110;
    }
    lllen = ll_src[3];
    llfirt = 4;
    goto L111;
L110:
    lllen = (ll_src[5] << 15) + ll_src[4];
    llfirt = ll_src[2] + 1;
L111:
    if (! (npix <= 0 || lllen <= 0)) {
        goto L120;
    }
    ret_val = 0;
    goto L100;
L120:
    xe = xs + npix - 1;
    skipwd = 0;
    op = 1;
    x1 = 1;
    pv = 1;
    i__1 = lllen;
    for (ip = llfirt; ip <= i__1; ++ip) {
        if (! skipwd) {
            goto L140;
        }
        skipwd = 0;
        goto L130;
L140:
        opcode = ll_src[ip] / 4096;
        data = ll_src[ip] & 4095;
        sw0001 = opcode;
        goto L150;
L160:
        x2 = x1 + data - 1;
        i1 = max(x1,xs);
        i2 = min(x2,xe);
        np = i2 - i1 + 1;
        if (! (np > 0)) {
            goto L170;
        }
        otop = op + np - 1;
        if (! (opcode == 4)) {
            goto L180;
        }
        i__2 = otop;
        for (i__ = op; i__ <= i__2; ++i__) {
            px_dst[i__] = pv;
/* L190: */
        }
/* L191: */
        goto L181;
L180:
        i__2 = otop;
        for (i__ = op; i__ <= i__2; ++i__) {
            px_dst[i__] = 0;
/* L200: */
        }
/* L201: */
        if (! (opcode == 5 && i2 == x2)) {
            goto L210;
        }
        px_dst[otop] = pv;
L210:
L181:
        op = otop + 1;
L170:
        x1 = x2 + 1;
        goto L151;
L220:
        pv = (ll_src[ip + 1] << 12) + data;
        skipwd = 1;
        goto L151;
L230:
        pv += data;
        goto L151;
L240:
        pv -= data;
        goto L151;
L250:
        pv += data;
        goto L91;
L260:
        pv -= data;
L91:
        if (! (x1 >= xs && x1 <= xe)) {
            goto L270;
        }
        px_dst[op] = pv;
        ++op;
L270:
        ++x1;
        goto L151;
L150:
        ++sw0001;
        if (sw0001 < 1 || sw0001 > 8) {
            goto L151;
        }
        switch ((int)sw0001) {
            case 1:  goto L160;
            case 2:  goto L220;
            case 3:  goto L230;
            case 4:  goto L240;
            case 5:  goto L160;
            case 6:  goto L160;
            case 7:  goto L250;
            case 8:  goto L260;
        }
L151:
        if (! (x1 > xe)) {
            goto L280;
        }
        goto L131;
L280:
L130:
        ;
    }
L131:
    i__1 = npix;
    for (i__ = op; i__ <= i__1; ++i__) {
        px_dst[i__] = 0;
/* L290: */
    }
/* L291: */
    ret_val = npix;
    goto L100;
L100:
    return ret_val;
} /* pll2pi_ */

cfitsio-3.47/putcolb.c0000644000225700000360000011051713464573432014231 0ustar  cagordonlhea/*  This file, putcolb.c, contains routines that write data elements to    */
/*  a FITS image or table with char (byte) datatype.                       */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffpprb( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            unsigned char *array, /* I - array of values that are written   */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;
    unsigned char nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_pixels(fptr, TBYTE, firstelem, nelem,
            0, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpclb(fptr, 2, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppnb( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            unsigned char *array, /* I - array of values that are written   */
            unsigned char nulval, /* I - undefined pixel value              */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).  Any array values
  that are equal to the value of nulval will be replaced with the null
  pixel value that is appropriate for this column.
*/
{
    long row;
    unsigned char nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */


        nullvalue = nulval;  /* set local variable */
        fits_write_compressed_pixels(fptr, TBYTE, firstelem, nelem,
            1, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcnb(fptr, 2, row, firstelem, nelem, array, nulval, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp2db(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           unsigned char *array, /* I - array to be written               */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    /* call the 3D writing routine, with the 3rd dimension = 1 */

    ffp3db(fptr, group, ncols, naxis2, naxis1, naxis2, 1, array, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp3db(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  nrows,      /* I - number of rows in each plane of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  naxis3,     /* I - FITS image NAXIS3 value               */
           unsigned char *array, /* I - array to be written               */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 3-D cube of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    long tablerow, ii, jj;
    LONGLONG nfits, narray;
    long fpixel[3]= {1,1,1}, lpixel[3];
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
           
    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
        lpixel[0] = (long) ncols;
        lpixel[1] = (long) nrows;
        lpixel[2] = (long) naxis3;
       
        fits_write_compressed_img(fptr, TBYTE, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
      /* all the image pixels are contiguous, so write all at once */
      ffpclb(fptr, 2, tablerow, 1L, naxis1 * naxis2 * naxis3, array, status);
      return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to write to */
    narray = 0;  /* next pixel in input array to be written */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* writing naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffpclb(fptr, 2, tablerow, nfits, naxis1,&array[narray],status) > 0)
         return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpssb(fitsfile *fptr,   /* I - FITS file pointer                       */
           long  group,      /* I - group to write(1 = 1st group)           */
           long  naxis,      /* I - number of data axes in array            */
           long  *naxes,     /* I - size of each FITS axis                  */
           long  *fpixel,    /* I - 1st pixel in each axis to write (1=1st) */
           long  *lpixel,    /* I - last pixel in each axis to write        */
           unsigned char *array, /* I - array to be written                 */
           int  *status)     /* IO - error status                           */
/*
  Write a subsection of pixels to the primary array or image.
  A subsection is defined to be any contiguous rectangular
  array of pixels within the n-dimensional FITS data file.
  Data conversion and scaling will be performed if necessary 
  (e.g, if the datatype of the FITS array is not the same as
  the array being written).
*/
{
    long tablerow;
    LONGLONG fpix[7], dimen[7], astart, pstart;
    LONGLONG off2, off3, off4, off5, off6, off7;
    LONGLONG st10, st20, st30, st40, st50, st60, st70;
    LONGLONG st1, st2, st3, st4, st5, st6, st7;
    long ii, i1, i2, i3, i4, i5, i6, i7, irange[7];

    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_img(fptr, TBYTE, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    if (naxis < 1 || naxis > 7)
      return(*status = BAD_DIMEN);

    tablerow=maxvalue(1,group);

     /* calculate the size and number of loops to perform in each dimension */
    for (ii = 0; ii < 7; ii++)
    {
      fpix[ii]=1;
      irange[ii]=1;
      dimen[ii]=1;
    }

    for (ii = 0; ii < naxis; ii++)
    {    
      fpix[ii]=fpixel[ii];
      irange[ii]=lpixel[ii]-fpixel[ii]+1;
      dimen[ii]=naxes[ii];
    }

    i1=irange[0];

    /* compute the pixel offset between each dimension */
    off2 =     dimen[0];
    off3 = off2 * dimen[1];
    off4 = off3 * dimen[2];
    off5 = off4 * dimen[3];
    off6 = off5 * dimen[4];
    off7 = off6 * dimen[5];

    st10 = fpix[0];
    st20 = (fpix[1] - 1) * off2;
    st30 = (fpix[2] - 1) * off3;
    st40 = (fpix[3] - 1) * off4;
    st50 = (fpix[4] - 1) * off5;
    st60 = (fpix[5] - 1) * off6;
    st70 = (fpix[6] - 1) * off7;

    /* store the initial offset in each dimension */
    st1 = st10;
    st2 = st20;
    st3 = st30;
    st4 = st40;
    st5 = st50;
    st6 = st60;
    st7 = st70;

    astart = 0;

    for (i7 = 0; i7 < irange[6]; i7++)
    {
     for (i6 = 0; i6 < irange[5]; i6++)
     {
      for (i5 = 0; i5 < irange[4]; i5++)
      {
       for (i4 = 0; i4 < irange[3]; i4++)
       {
        for (i3 = 0; i3 < irange[2]; i3++)
        {
         pstart = st1 + st2 + st3 + st4 + st5 + st6 + st7;

         for (i2 = 0; i2 < irange[1]; i2++)
         {
           if (ffpclb(fptr, 2, tablerow, pstart, i1, &array[astart],
              status) > 0)
              return(*status);

           astart += i1;
           pstart += off2;
         }
         st2 = st20;
         st3 = st3+off3;    
        }
        st3 = st30;
        st4 = st4+off4;
       }
       st4 = st40;
       st5 = st5+off5;
      }
      st5 = st50;
      st6 = st6+off6;
     }
     st6 = st60;
     st7 = st7+off7;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpgpb( fitsfile *fptr,   /* I - FITS file pointer                      */
            long  group,      /* I - group to write(1 = 1st group)          */
            long  firstelem,  /* I - first vector element to write(1 = 1st) */
            long  nelem,      /* I - number of values to write              */
            unsigned char *array, /* I - array of values that are written   */
            int  *status)     /* IO - error status                          */
/*
  Write an array of group parameters to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffpclb(fptr, 1L, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpclb( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            unsigned char *array, /* I - array of values to write           */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table with
  2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    int tcode, maxelem2, hdutype, writeraw;
    long twidth, incre;
    long  ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull, maxelem;
    double scale, zero;
    char tform[20], cform[20];
    char message[FLEN_ERRMSG];

    char snull[20];   /*  the FITS null value  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem2, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);
    maxelem = maxelem2;

    if (tcode == TSTRING)   
         ffcfmt(tform, cform);     /* derive C format for writing strings */

    /*
      if there is no scaling 
      then we can simply write the raw data bytes into the FITS file if the
      datatype of the FITS column is the same as the input values.  Otherwise,
      we must convert the raw values into the scaled and/or machine dependent
      format in a temporary buffer that has been allocated for this purpose.
    */
    if (scale == 1. && zero == 0. && tcode == TBYTE)
    {
        writeraw = 1;
        if (nelem < (LONGLONG)INT32_MAX) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX;
        }
     }
    else
        writeraw = 0;

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*  First call the ffXXfYY routine to  (1) convert the datatype        */
    /*  if necessary, and (2) scale the values by the FITS TSCALn and      */
    /*  TZEROn linear scaling parameters into a temporary buffer.          */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
        /* limit the number of pixels to process a one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, (repeat - elemnum));

        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);
        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TBYTE):
              if (writeraw)
              {
                /* write raw input bytes without conversion */
                ffpi1b(fptr, ntodo, incre, &array[next], status);
              }
              else
              {
                /* convert the raw data before writing to FITS file */
                ffi1fi1(&array[next], ntodo, scale, zero,
                        (unsigned char *) buffer, status);
                ffpi1b(fptr, ntodo, incre, (unsigned char *) buffer, status);
              }

              break;

            case (TLONGLONG):

                ffi1fi8(&array[next], ntodo, scale, zero,
                        (LONGLONG *) buffer, status);
                ffpi8b(fptr, ntodo, incre, (long *) buffer, status);
                break;

            case (TSHORT):
 
                ffi1fi2(&array[next], ntodo, scale, zero,
                        (short *) buffer, status);
                ffpi2b(fptr, ntodo, incre, (short *) buffer, status);
                break;

            case (TLONG):

                ffi1fi4(&array[next], ntodo, scale, zero,
                        (INT32BIT *) buffer, status);
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) buffer, status);
                break;

            case (TFLOAT):

                ffi1fr4(&array[next], ntodo, scale, zero,
                        (float *)  buffer, status);
                ffpr4b(fptr, ntodo, incre, (float *) buffer, status);
                break;

            case (TDOUBLE):
                ffi1fr8(&array[next], ntodo, scale, zero,
                        (double *) buffer, status);
                ffpr8b(fptr, ntodo, incre, (double *) buffer, status);
                break;

            case (TSTRING):  /* numerical column in an ASCII table */

                if (strchr(tform,'A'))
                {
                    /* write raw input bytes without conversion        */
                    /* This case is a hack to let users write a stream */
                    /* of bytes directly to the 'A' format column      */

                    if (incre == twidth)
                        ffpbyt(fptr, ntodo, &array[next], status);
                    else
                        ffpbytoff(fptr, twidth, ntodo/twidth, incre - twidth, 
                                &array[next], status);
                    break;
                }
                else if (cform[1] != 's')  /*  "%s" format is a string */
                {
                  ffi1fstr(&array[next], ntodo, scale, zero, cform,
                          twidth, (char *) buffer, status);

                  if (incre == twidth)    /* contiguous bytes */
                     ffpbyt(fptr, ntodo * twidth, buffer, status);
                  else
                     ffpbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                            status);
                  break;
                }
                /* can't write to string column, so fall thru to default: */

            default:  /*  error trap  */
                snprintf(message, FLEN_ERRMSG,
                       "Cannot write numbers to column %d which has format %s",
                        colnum,tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
          snprintf(message,FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpclb).",
              (double) (next+1), (double) (next+ntodo));
          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
      ffpmsg(
      "Numerical overflow during type conversion while writing FITS data.");
      *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcnb( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            unsigned char *array,   /* I - array of values to write         */
            unsigned char nulvalue, /* I - flag for undefined pixels        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels equal to the value of nulvalue will be replaced by the appropriate
  null value in the output FITS file. 

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode, overflow = 0;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    /* if variable length array, first write the whole input vector, 
       then go back and fill in the nulls */
    if (tcode < 0) {
      if (ffpclb(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0) {
        if (*status == NUM_OVERFLOW) 
	{
	  /* ignore overflows, which are possibly the null pixel values */
	  /*  overflow = 1;   */
	  *status = 0;
	} else { 
          return(*status);
	}
      }
    }

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (ffpclu(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood + 1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (tcode > 0) {  /* variable length arrays have already been written */
              if (ffpclb(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0) {
		if (*status == NUM_OVERFLOW) 
		{
		  overflow = 1;
		  *status = 0;
		} else { 
                  return(*status);
		}
	      }
	    }
            ngood=0;
         }

         nbad = nbad + 1;  /* the consecutive number of bad pixels */
      }
    }
    
    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      if (tcode > 0) {  /* variable length arrays have already been written */
        ffpclb(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
      }
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpclu(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    if (*status <= 0) {
      if (overflow) {
        *status = NUM_OVERFLOW;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpextn( fitsfile *fptr,        /* I - FITS file pointer                        */
            LONGLONG  offset,      /* I - byte offset from start of extension data */
            LONGLONG  nelem,       /* I - number of elements to write              */
            void *buffer,          /* I - stream of bytes to write                 */
            int  *status)          /* IO - error status                            */
/*
  Write a stream of bytes to the current FITS HDU.  This primative routine is mainly
  for writing non-standard "conforming" extensions and should not be used
  for standard IMAGE, TABLE or BINTABLE extensions.
*/
{
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    /* rescan header if data structure is undefined */
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
        if ( ffrdef(fptr, status) > 0)               
            return(*status);

    /* move to write position */
    ffmbyt(fptr, (fptr->Fptr)->datastart+ offset, IGNORE_EOF, status);
    
    /* write the buffer */
    ffpbyt(fptr, nelem, buffer, status); 

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi1fi1(unsigned char *input,  /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            unsigned char *output, /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        memcpy(output, input, ntodo); /* just copy input to output */
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = ( ((double) input[ii]) - zero) / scale;

            if (dvalue < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (dvalue > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) (dvalue + .5);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi1fi2(unsigned char *input,  /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            short *output,         /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = input[ii];   /* just copy input to output */
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (((double) input[ii]) - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (short) (dvalue + .5);
                else
                    output[ii] = (short) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi1fi4(unsigned char *input,  /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            INT32BIT *output,      /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (INT32BIT) input[ii];   /* copy input to output */
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (((double) input[ii]) - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (INT32BIT) (dvalue + .5);
                else
                    output[ii] = (INT32BIT) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi1fi8(unsigned char *input, /* I - array of values to be converted  */
            long ntodo,           /* I - number of elements in the array  */
            double scale,         /* I - FITS TSCALn or BSCALE value      */
            double zero,          /* I - FITS TZEROn or BZERO  value      */
            LONGLONG *output,     /* O - output array of converted values */
            int *status)          /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero ==  9223372036854775808.)
    {       
        /* Writing to unsigned long long column. */
        /* Instead of subtracting 9223372036854775808, it is more efficient */
        /* and more precise to just flip the sign bit with the XOR operator */

        /* no need to check range limits because all unsigned char values */
	/* are valid ULONGLONG values. */

        for (ii = 0; ii < ntodo; ii++) {
             output[ii] =  ((LONGLONG) input[ii]) ^ 0x8000000000000000;
        }
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (dvalue > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (LONGLONG) (dvalue + .5);
                else
                    output[ii] = (LONGLONG) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi1fr4(unsigned char *input,  /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            float *output,         /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (float) (( ( (double) input[ii] ) - zero) / scale);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi1fr8(unsigned char *input,  /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            double *output,        /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = ( ( (double) input[ii] ) - zero) / scale;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi1fstr(unsigned char *input, /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            char *cform,       /* I - format for output string values  */
            long twidth,       /* I - width of each field, in chars    */
            char *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do scaling if required.
*/
{
    long ii;
    double dvalue;
    char *cptr;

    cptr = output;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
           sprintf(output, cform, (double) input[ii]);
           output += twidth;

           if (*output)  /* if this char != \0, then overflow occurred */
              *status = OVERFLOW_ERR;
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
          dvalue = ((double) input[ii] - zero) / scale;
          sprintf(output, cform, dvalue);
          output += twidth;

          if (*output)  /* if this char != \0, then overflow occurred */
            *status = OVERFLOW_ERR;
        }
    }

    /* replace any commas with periods (e.g., in French locale) */
    while ((cptr = strchr(cptr, ','))) *cptr = '.';
    
    return(*status);
}
cfitsio-3.47/putcol.c0000644000225700000360000020433113464573432014065 0ustar  cagordonlhea/*  This file, putcol.c, contains routines that write data elements to     */
/*  a FITS image or table. These are the generic routines.                 */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffppx(  fitsfile *fptr,  /* I - FITS file pointer                       */
            int  datatype,   /* I - datatype of the value                   */
            long  *firstpix, /* I - coord of  first pixel to write(1 based) */
            LONGLONG  nelem,     /* I - number of values to write               */
            void  *array,    /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of pixels to the primary array.  The datatype of the
  input array is defined by the 2nd argument. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written). 
  
  This routine is simillar to ffppr, except it supports writing to 
  large images with more than 2**31 pixels.
*/
{
    int naxis, ii;
    long group = 1;
    LONGLONG firstelem, dimsize = 1, naxes[9];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* get the size of the image */
    ffgidm(fptr, &naxis, status);
    ffgiszll(fptr, 9, naxes, status);

    firstelem = 0;
    for (ii=0; ii < naxis; ii++)
    {
        firstelem += ((firstpix[ii] - 1) * dimsize);
        dimsize *= naxes[ii];
    }
    firstelem++;

    if (datatype == TBYTE)
    {
      ffpprb(fptr, group, firstelem, nelem, (unsigned char *) array, status);
    }
    else if (datatype == TSBYTE)
    {
      ffpprsb(fptr, group, firstelem, nelem, (signed char *) array, status);
    }
    else if (datatype == TUSHORT)
    {
      ffpprui(fptr, group, firstelem, nelem, (unsigned short *) array,
              status);
    }
    else if (datatype == TSHORT)
    {
      ffppri(fptr, group, firstelem, nelem, (short *) array, status);
    }
    else if (datatype == TUINT)
    {
      ffppruk(fptr, group, firstelem, nelem, (unsigned int *) array, status);
    }
    else if (datatype == TINT)
    {
      ffpprk(fptr, group, firstelem, nelem, (int *) array, status);
    }
    else if (datatype == TULONG)
    {
      ffppruj(fptr, group, firstelem, nelem, (unsigned long *) array, status);
    }
    else if (datatype == TLONG)
    {
      ffpprj(fptr, group, firstelem, nelem, (long *) array, status);
    }
    else if (datatype == TULONGLONG)
    {
      ffpprujj(fptr, group, firstelem, nelem, (ULONGLONG *) array, status);
    }
    else if (datatype == TLONGLONG)
    {
      ffpprjj(fptr, group, firstelem, nelem, (LONGLONG *) array, status);
    }
    else if (datatype == TFLOAT)
    {
      ffppre(fptr, group, firstelem, nelem, (float *) array, status);
    }
    else if (datatype == TDOUBLE)
    {
      ffpprd(fptr, group, firstelem, nelem, (double *) array, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppxll(  fitsfile *fptr,  /* I - FITS file pointer                       */
            int  datatype,   /* I - datatype of the value                   */
            LONGLONG  *firstpix, /* I - coord of  first pixel to write(1 based) */
            LONGLONG  nelem,     /* I - number of values to write               */
            void  *array,    /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of pixels to the primary array.  The datatype of the
  input array is defined by the 2nd argument. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written). 
  
  This routine is simillar to ffppr, except it supports writing to 
  large images with more than 2**31 pixels.
*/
{
    int naxis, ii;
    long group = 1;
    LONGLONG firstelem, dimsize = 1, naxes[9];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* get the size of the image */
    ffgidm(fptr, &naxis, status);
    ffgiszll(fptr, 9, naxes, status);

    firstelem = 0;
    for (ii=0; ii < naxis; ii++)
    {
        firstelem += ((firstpix[ii] - 1) * dimsize);
        dimsize *= naxes[ii];
    }
    firstelem++;

    if (datatype == TBYTE)
    {
      ffpprb(fptr, group, firstelem, nelem, (unsigned char *) array, status);
    }
    else if (datatype == TSBYTE)
    {
      ffpprsb(fptr, group, firstelem, nelem, (signed char *) array, status);
    }
    else if (datatype == TUSHORT)
    {
      ffpprui(fptr, group, firstelem, nelem, (unsigned short *) array,
              status);
    }
    else if (datatype == TSHORT)
    {
      ffppri(fptr, group, firstelem, nelem, (short *) array, status);
    }
    else if (datatype == TUINT)
    {
      ffppruk(fptr, group, firstelem, nelem, (unsigned int *) array, status);
    }
    else if (datatype == TINT)
    {
      ffpprk(fptr, group, firstelem, nelem, (int *) array, status);
    }
    else if (datatype == TULONG)
    {
      ffppruj(fptr, group, firstelem, nelem, (unsigned long *) array, status);
    }
    else if (datatype == TLONG)
    {
      ffpprj(fptr, group, firstelem, nelem, (long *) array, status);
    }
    else if (datatype == TULONGLONG)
    {
      ffpprujj(fptr, group, firstelem, nelem, (ULONGLONG *) array, status);
    }
    else if (datatype == TLONGLONG)
    {
      ffpprjj(fptr, group, firstelem, nelem, (LONGLONG *) array, status);
    }
    else if (datatype == TFLOAT)
    {
      ffppre(fptr, group, firstelem, nelem, (float *) array, status);
    }
    else if (datatype == TDOUBLE)
    {
      ffpprd(fptr, group, firstelem, nelem, (double *) array, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppxn(  fitsfile *fptr,  /* I - FITS file pointer                       */
            int  datatype,   /* I - datatype of the value                   */
            long  *firstpix, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            void  *array,    /* I - array of values that are written        */
            void  *nulval,   /* I - pointer to the null value               */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array.  The datatype of the
  input array is defined by the 2nd argument. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).

  This routine supports writing to large images with
  more than 2**31 pixels.
*/
{
    int naxis, ii;
    long group = 1;
    LONGLONG firstelem, dimsize = 1, naxes[9];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (nulval == NULL)  /* null value not defined? */
    {
        ffppx(fptr, datatype, firstpix, nelem, array, status);
        return(*status);
    }

    /* get the size of the image */
    ffgidm(fptr, &naxis, status);
    ffgiszll(fptr, 9, naxes, status);

    firstelem = 0;
    for (ii=0; ii < naxis; ii++)
    {
        firstelem += ((firstpix[ii] - 1) * dimsize);
        dimsize *= naxes[ii];
    }
    firstelem++;

    if (datatype == TBYTE)
    {
      ffppnb(fptr, group, firstelem, nelem, (unsigned char *) array, 
             *(unsigned char *) nulval, status);
    }
    else if (datatype == TSBYTE)
    {
      ffppnsb(fptr, group, firstelem, nelem, (signed char *) array, 
             *(signed char *) nulval, status);
    }
    else if (datatype == TUSHORT)
    {
      ffppnui(fptr, group, firstelem, nelem, (unsigned short *) array,
              *(unsigned short *) nulval,status);
    }
    else if (datatype == TSHORT)
    {
      ffppni(fptr, group, firstelem, nelem, (short *) array,
             *(short *) nulval, status);
    }
    else if (datatype == TUINT)
    {
      ffppnuk(fptr, group, firstelem, nelem, (unsigned int *) array,
             *(unsigned int *) nulval, status);
    }
    else if (datatype == TINT)
    {
      ffppnk(fptr, group, firstelem, nelem, (int *) array,
             *(int *) nulval, status);
    }
    else if (datatype == TULONG)
    {
      ffppnuj(fptr, group, firstelem, nelem, (unsigned long *) array,
              *(unsigned long *) nulval,status);
    }
    else if (datatype == TLONG)
    {
      ffppnj(fptr, group, firstelem, nelem, (long *) array,
             *(long *) nulval, status);
    }
    else if (datatype == TULONGLONG)
    {
      ffppnujj(fptr, group, firstelem, nelem, (ULONGLONG *) array,
             *(ULONGLONG *) nulval, status);
    }
    else if (datatype == TLONGLONG)
    {
      ffppnjj(fptr, group, firstelem, nelem, (LONGLONG *) array,
             *(LONGLONG *) nulval, status);
    }
    else if (datatype == TFLOAT)
    {
      ffppne(fptr, group, firstelem, nelem, (float *) array,
             *(float *) nulval, status);
    }
    else if (datatype == TDOUBLE)
    {
      ffppnd(fptr, group, firstelem, nelem, (double *) array,
             *(double *) nulval, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppxnll(  fitsfile *fptr,  /* I - FITS file pointer                       */
            int  datatype,   /* I - datatype of the value                   */
            LONGLONG  *firstpix, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            void  *array,    /* I - array of values that are written        */
            void  *nulval,   /* I - pointer to the null value               */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array.  The datatype of the
  input array is defined by the 2nd argument. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).

  This routine supports writing to large images with
  more than 2**31 pixels.
*/
{
    int naxis, ii;
    long  group = 1;
    LONGLONG firstelem, dimsize = 1, naxes[9];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (nulval == NULL)  /* null value not defined? */
    {
        ffppxll(fptr, datatype, firstpix, nelem, array, status);
        return(*status);
    }

    /* get the size of the image */
    ffgidm(fptr, &naxis, status);
    ffgiszll(fptr, 9, naxes, status);

    firstelem = 0;
    for (ii=0; ii < naxis; ii++)
    {
        firstelem += ((firstpix[ii] - 1) * dimsize);
        dimsize *= naxes[ii];
    }
    firstelem++;

    if (datatype == TBYTE)
    {
      ffppnb(fptr, group, firstelem, nelem, (unsigned char *) array, 
             *(unsigned char *) nulval, status);
    }
    else if (datatype == TSBYTE)
    {
      ffppnsb(fptr, group, firstelem, nelem, (signed char *) array, 
             *(signed char *) nulval, status);
    }
    else if (datatype == TUSHORT)
    {
      ffppnui(fptr, group, firstelem, nelem, (unsigned short *) array,
              *(unsigned short *) nulval,status);
    }
    else if (datatype == TSHORT)
    {
      ffppni(fptr, group, firstelem, nelem, (short *) array,
             *(short *) nulval, status);
    }
    else if (datatype == TUINT)
    {
      ffppnuk(fptr, group, firstelem, nelem, (unsigned int *) array,
             *(unsigned int *) nulval, status);
    }
    else if (datatype == TINT)
    {
      ffppnk(fptr, group, firstelem, nelem, (int *) array,
             *(int *) nulval, status);
    }
    else if (datatype == TULONG)
    {
      ffppnuj(fptr, group, firstelem, nelem, (unsigned long *) array,
              *(unsigned long *) nulval,status);
    }
    else if (datatype == TLONG)
    {
      ffppnj(fptr, group, firstelem, nelem, (long *) array,
             *(long *) nulval, status);
    }
    else if (datatype == TULONGLONG)
    {
      ffppnujj(fptr, group, firstelem, nelem, (ULONGLONG *) array,
             *(ULONGLONG *) nulval, status);
    }
    else if (datatype == TLONGLONG)
    {
      ffppnjj(fptr, group, firstelem, nelem, (LONGLONG *) array,
             *(LONGLONG *) nulval, status);
    }
    else if (datatype == TFLOAT)
    {
      ffppne(fptr, group, firstelem, nelem, (float *) array,
             *(float *) nulval, status);
    }
    else if (datatype == TDOUBLE)
    {
      ffppnd(fptr, group, firstelem, nelem, (double *) array,
             *(double *) nulval, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppr(  fitsfile *fptr,  /* I - FITS file pointer                       */
            int  datatype,   /* I - datatype of the value                   */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            void  *array,    /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array.  The datatype of the
  input array is defined by the 2nd argument. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).

*/
{
    long group = 1;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (datatype == TBYTE)
    {
      ffpprb(fptr, group, firstelem, nelem, (unsigned char *) array, status);
    }
    else if (datatype == TSBYTE)
    {
      ffpprsb(fptr, group, firstelem, nelem, (signed char *) array, status);
    }
    else if (datatype == TUSHORT)
    {
      ffpprui(fptr, group, firstelem, nelem, (unsigned short *) array,
              status);
    }
    else if (datatype == TSHORT)
    {
      ffppri(fptr, group, firstelem, nelem, (short *) array, status);
    }
    else if (datatype == TUINT)
    {
      ffppruk(fptr, group, firstelem, nelem, (unsigned int *) array, status);
    }
    else if (datatype == TINT)
    {
      ffpprk(fptr, group, firstelem, nelem, (int *) array, status);
    }
    else if (datatype == TULONG)
    {
      ffppruj(fptr, group, firstelem, nelem, (unsigned long *) array, status);
    }
    else if (datatype == TLONG)
    {
      ffpprj(fptr, group, firstelem, nelem, (long *) array, status);
    }
    else if (datatype == TULONGLONG)
    {
      ffpprujj(fptr, group, firstelem, nelem, (ULONGLONG *) array, status);
    }
    else if (datatype == TLONGLONG)
    {
      ffpprjj(fptr, group, firstelem, nelem, (LONGLONG *) array, status);
    }
    else if (datatype == TFLOAT)
    {
      ffppre(fptr, group, firstelem, nelem, (float *) array, status);
    }
    else if (datatype == TDOUBLE)
    {
      ffpprd(fptr, group, firstelem, nelem, (double *) array, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppn(  fitsfile *fptr,  /* I - FITS file pointer                       */
            int  datatype,   /* I - datatype of the value                   */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            void  *array,    /* I - array of values that are written        */
            void  *nulval,   /* I - pointer to the null value               */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array.  The datatype of the
  input array is defined by the 2nd argument. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).

*/
{
    long group = 1;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (nulval == NULL)  /* null value not defined? */
    {
        ffppr(fptr, datatype, firstelem, nelem, array, status);
        return(*status);
    }

    if (datatype == TBYTE)
    {
      ffppnb(fptr, group, firstelem, nelem, (unsigned char *) array, 
             *(unsigned char *) nulval, status);
    }
    else if (datatype == TSBYTE)
    {
      ffppnsb(fptr, group, firstelem, nelem, (signed char *) array, 
             *(signed char *) nulval, status);
    }
    else if (datatype == TUSHORT)
    {
      ffppnui(fptr, group, firstelem, nelem, (unsigned short *) array,
              *(unsigned short *) nulval,status);
    }
    else if (datatype == TSHORT)
    {
      ffppni(fptr, group, firstelem, nelem, (short *) array,
             *(short *) nulval, status);
    }
    else if (datatype == TUINT)
    {
      ffppnuk(fptr, group, firstelem, nelem, (unsigned int *) array,
             *(unsigned int *) nulval, status);
    }
    else if (datatype == TINT)
    {
      ffppnk(fptr, group, firstelem, nelem, (int *) array,
             *(int *) nulval, status);
    }
    else if (datatype == TULONG)
    {
      ffppnuj(fptr, group, firstelem, nelem, (unsigned long *) array,
              *(unsigned long *) nulval,status);
    }
    else if (datatype == TLONG)
    {
      ffppnj(fptr, group, firstelem, nelem, (long *) array,
             *(long *) nulval, status);
    }
    else if (datatype == TULONGLONG)
    {
      ffppnujj(fptr, group, firstelem, nelem, (ULONGLONG *) array,
             *(ULONGLONG *) nulval, status);
    }
    else if (datatype == TLONGLONG)
    {
      ffppnjj(fptr, group, firstelem, nelem, (LONGLONG *) array,
             *(LONGLONG *) nulval, status);
    }
    else if (datatype == TFLOAT)
    {
      ffppne(fptr, group, firstelem, nelem, (float *) array,
             *(float *) nulval, status);
    }
    else if (datatype == TDOUBLE)
    {
      ffppnd(fptr, group, firstelem, nelem, (double *) array,
             *(double *) nulval, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpss(  fitsfile *fptr,   /* I - FITS file pointer                       */
            int  datatype,    /* I - datatype of the value                   */
            long *blc,        /* I - 'bottom left corner' of the subsection  */
            long *trc ,       /* I - 'top right corner' of the subsection    */
            void *array,      /* I - array of values that are written        */
            int  *status)     /* IO - error status                           */
/*
  Write a section of values to the primary array. The datatype of the
  input array is defined by the 2nd argument.  Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).

  This routine supports writing to large images with
  more than 2**31 pixels.
*/
{
    int naxis;
    long naxes[9];

    if (*status > 0)   /* inherit input status value if > 0 */
        return(*status);

    /* get the size of the image */
    ffgidm(fptr, &naxis, status);
    ffgisz(fptr, 9, naxes, status);

    if (datatype == TBYTE)
    {
        ffpssb(fptr, 1, naxis, naxes, blc, trc,
               (unsigned char *) array, status);
    }
    else if (datatype == TSBYTE)
    {
        ffpsssb(fptr, 1, naxis, naxes, blc, trc,
               (signed char *) array, status);
    }
    else if (datatype == TUSHORT)
    {
        ffpssui(fptr, 1, naxis, naxes, blc, trc,
               (unsigned short *) array, status);
    }
    else if (datatype == TSHORT)
    {
        ffpssi(fptr, 1, naxis, naxes, blc, trc,
               (short *) array, status);
    }
    else if (datatype == TUINT)
    {
        ffpssuk(fptr, 1, naxis, naxes, blc, trc,
               (unsigned int *) array, status);
    }
    else if (datatype == TINT)
    {
        ffpssk(fptr, 1, naxis, naxes, blc, trc,
               (int *) array, status);
    }
    else if (datatype == TULONG)
    {
        ffpssuj(fptr, 1, naxis, naxes, blc, trc,
               (unsigned long *) array, status);
    }
    else if (datatype == TLONG)
    {
        ffpssj(fptr, 1, naxis, naxes, blc, trc,
               (long *) array, status);
    }
    else if (datatype == TULONGLONG)
    {
        ffpssujj(fptr, 1, naxis, naxes, blc, trc,
               (ULONGLONG *) array, status);
    }
    else if (datatype == TLONGLONG)
    {
        ffpssjj(fptr, 1, naxis, naxes, blc, trc,
               (LONGLONG *) array, status);
    }    
    else if (datatype == TFLOAT)
    {
        ffpsse(fptr, 1, naxis, naxes, blc, trc,
               (float *) array, status);
    }
    else if (datatype == TDOUBLE)
    {
        ffpssd(fptr, 1, naxis, naxes, blc, trc,
               (double *) array, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcl(  fitsfile *fptr,  /* I - FITS file pointer                       */
            int  datatype,   /* I - datatype of the value                   */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of elements to write             */
            void  *array,    /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a table column.  The datatype of the
  input array is defined by the 2nd argument. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS column is not the same as the array being written).

*/
{
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (datatype == TBIT)
    {
      ffpclx(fptr, colnum, firstrow, (long) firstelem, (long) nelem, (char *) array, 
             status);
    }
    else if (datatype == TBYTE)
    {
      ffpclb(fptr, colnum, firstrow, firstelem, nelem, (unsigned char *) array,
             status);
    }
    else if (datatype == TSBYTE)
    {
      ffpclsb(fptr, colnum, firstrow, firstelem, nelem, (signed char *) array,
             status);
    }
    else if (datatype == TUSHORT)
    {
      ffpclui(fptr, colnum, firstrow, firstelem, nelem, 
             (unsigned short *) array, status);
    }
    else if (datatype == TSHORT)
    {
      ffpcli(fptr, colnum, firstrow, firstelem, nelem, (short *) array,
             status);
    }
    else if (datatype == TUINT)
    {
      ffpcluk(fptr, colnum, firstrow, firstelem, nelem, (unsigned int *) array,
               status);
    }
    else if (datatype == TINT)
    {
      ffpclk(fptr, colnum, firstrow, firstelem, nelem, (int *) array,
               status);
    }
    else if (datatype == TULONG)
    {
      ffpcluj(fptr, colnum, firstrow, firstelem, nelem, (unsigned long *) array,
              status);
    }
    else if (datatype == TLONG)
    {
      ffpclj(fptr, colnum, firstrow, firstelem, nelem, (long *) array,
             status);
    }
    else if (datatype == TULONGLONG)
    {
      ffpclujj(fptr, colnum, firstrow, firstelem, nelem, (ULONGLONG *) array,
             status);
    }
    else if (datatype == TLONGLONG)
    {
      ffpcljj(fptr, colnum, firstrow, firstelem, nelem, (LONGLONG *) array,
             status);
    }
    else if (datatype == TFLOAT)
    {
      ffpcle(fptr, colnum, firstrow, firstelem, nelem, (float *) array,
             status);
    }
    else if (datatype == TDOUBLE)
    {
      ffpcld(fptr, colnum, firstrow, firstelem, nelem, (double *) array,
             status);
    }
    else if (datatype == TCOMPLEX)
    {
      ffpcle(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2,
             (float *) array, status);
    }
    else if (datatype == TDBLCOMPLEX)
    {
      ffpcld(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2,
             (double *) array, status);
    }
    else if (datatype == TLOGICAL)
    {
      ffpcll(fptr, colnum, firstrow, firstelem, nelem, (char *) array,
             status);
    }
    else if (datatype == TSTRING)
    {
      ffpcls(fptr, colnum, firstrow, firstelem, nelem, (char **) array,
             status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcn(  fitsfile *fptr,  /* I - FITS file pointer                       */
            int  datatype,   /* I - datatype of the value                   */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of elements to write             */
            void  *array,    /* I - array of values that are written        */
            void  *nulval,   /* I - pointer to the null value               */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a table column.  The datatype of the
  input array is defined by the 2nd argument. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS column is not the same as the array being written).

*/
{
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (nulval == NULL)  /* null value not defined? */
    {
        ffpcl(fptr, datatype, colnum, firstrow, firstelem, nelem, array,
              status);
        return(*status);
    }

    if (datatype == TBYTE)
    {
      ffpcnb(fptr, colnum, firstrow, firstelem, nelem, (unsigned char *) array,
            *(unsigned char *) nulval, status);
    }
    else if (datatype == TSBYTE)
    {
      ffpcnsb(fptr, colnum, firstrow, firstelem, nelem, (signed char *) array,
            *(signed char *) nulval, status);
    }
    else if (datatype == TUSHORT)
    {
     ffpcnui(fptr, colnum, firstrow, firstelem, nelem, (unsigned short *) array,
             *(unsigned short *) nulval, status);
    }
    else if (datatype == TSHORT)
    {
      ffpcni(fptr, colnum, firstrow, firstelem, nelem, (short *) array,
             *(unsigned short *) nulval, status);
    }
    else if (datatype == TUINT)
    {
      ffpcnuk(fptr, colnum, firstrow, firstelem, nelem, (unsigned int *) array,
             *(unsigned int *) nulval, status);
    }
    else if (datatype == TINT)
    {
      ffpcnk(fptr, colnum, firstrow, firstelem, nelem, (int *) array,
             *(int *) nulval, status);
    }
    else if (datatype == TULONG)
    {
      ffpcnuj(fptr, colnum, firstrow, firstelem, nelem, (unsigned long *) array,
              *(unsigned long *) nulval, status);
    }
    else if (datatype == TLONG)
    {
      ffpcnj(fptr, colnum, firstrow, firstelem, nelem, (long *) array,
             *(long *) nulval, status);
    }
    else if (datatype == TULONGLONG)
    {
      ffpcnujj(fptr, colnum, firstrow, firstelem, nelem, (ULONGLONG *) array,
             *(ULONGLONG *) nulval, status);
    }
    else if (datatype == TLONGLONG)
    {
      ffpcnjj(fptr, colnum, firstrow, firstelem, nelem, (LONGLONG *) array,
             *(LONGLONG *) nulval, status);
    }
    else if (datatype == TFLOAT)
    {
      ffpcne(fptr, colnum, firstrow, firstelem, nelem, (float *) array,
             *(float *) nulval, status);
    }
    else if (datatype == TDOUBLE)
    {
      ffpcnd(fptr, colnum, firstrow, firstelem, nelem, (double *) array,
             *(double *) nulval, status);
    }
    else if (datatype == TCOMPLEX)
    {
      ffpcne(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2,
             (float *) array, *(float *) nulval, status);
    }
    else if (datatype == TDBLCOMPLEX)
    {
      ffpcnd(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, nelem * 2,
             (double *) array, *(double *) nulval, status);
    }
    else if (datatype == TLOGICAL)
    {
      ffpcnl(fptr, colnum, firstrow, firstelem, nelem, (char *) array,
             *(char *) nulval, status);
    }
    else if (datatype == TSTRING)
    {
      ffpcns(fptr, colnum, firstrow, firstelem, nelem, (char **) array,
             (char *) nulval, status);
    }
    else
      *status = BAD_DATATYPE;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_iter_set_by_name(iteratorCol *col, /* I - iterator col structure */
           fitsfile *fptr,  /* I - FITS file pointer                      */
           char *colname,   /* I - column name                            */
           int datatype,    /* I - column datatype                        */
           int iotype)      /* I - InputCol, InputOutputCol, or OutputCol */
/*
  set all the parameters for an iterator column, by column name
*/
{
    col->fptr = fptr;
    strncpy(col->colname, colname,69);
    col->colname[69]=0;
    col->colnum = 0;  /* set column number undefined since name is given */
    col->datatype = datatype;
    col->iotype = iotype;
    return(0);
}
/*--------------------------------------------------------------------------*/
int fits_iter_set_by_num(iteratorCol *col, /* I - iterator column structure */
           fitsfile *fptr,  /* I - FITS file pointer                      */
           int colnum,      /* I - column number                          */
           int datatype,    /* I - column datatype                        */
           int iotype)      /* I - InputCol, InputOutputCol, or OutputCol */
/*
  set all the parameters for an iterator column, by column number
*/
{
    col->fptr = fptr;
    col->colnum = colnum; 
    col->datatype = datatype;
    col->iotype = iotype;
    return(0);
}
/*--------------------------------------------------------------------------*/
int fits_iter_set_file(iteratorCol *col, /* I - iterator column structure   */
           fitsfile *fptr)   /* I - FITS file pointer                      */
/*
  set iterator column parameter
*/
{
    col->fptr = fptr;
    return(0);
}
/*--------------------------------------------------------------------------*/
int fits_iter_set_colname(iteratorCol *col, /* I - iterator col structure  */
           char *colname)    /* I - column name                            */
/*
  set iterator column parameter
*/
{
    strncpy(col->colname, colname,69);
    col->colname[69]=0;
    col->colnum = 0;  /* set column number undefined since name is given */
    return(0);
}
/*--------------------------------------------------------------------------*/
int fits_iter_set_colnum(iteratorCol *col, /* I - iterator column structure */
           int colnum)       /* I - column number                          */
/*
  set iterator column parameter
*/
{
    col->colnum = colnum; 
    return(0);
}
/*--------------------------------------------------------------------------*/
int fits_iter_set_datatype(iteratorCol *col, /* I - iterator col structure */
           int datatype)    /* I - column datatype                        */
/*
  set iterator column parameter
*/
{
    col->datatype = datatype;
    return(0);
}
/*--------------------------------------------------------------------------*/
int fits_iter_set_iotype(iteratorCol *col, /* I - iterator column structure */
           int iotype)       /* I - InputCol, InputOutputCol, or OutputCol */
/*
  set iterator column parameter
*/
{
    col->iotype = iotype;
    return(0);
}
/*--------------------------------------------------------------------------*/
fitsfile * fits_iter_get_file(iteratorCol *col) /* I -iterator col structure */
/*
  get iterator column parameter
*/
{
     return(col->fptr);
}
/*--------------------------------------------------------------------------*/
char * fits_iter_get_colname(iteratorCol *col) /* I -iterator col structure */
/*
  get iterator column parameter
*/
{
    return(col->colname);
}
/*--------------------------------------------------------------------------*/
int fits_iter_get_colnum(iteratorCol *col) /* I - iterator column structure */
/*
  get iterator column parameter
*/
{
    return(col->colnum);
}
/*--------------------------------------------------------------------------*/
int fits_iter_get_datatype(iteratorCol *col) /* I - iterator col structure */
/*
  get iterator column parameter
*/
{
    return(col->datatype);
}
/*--------------------------------------------------------------------------*/
int fits_iter_get_iotype(iteratorCol *col) /* I - iterator column structure */
/*
  get iterator column parameter
*/
{
     return(col->iotype);
}
/*--------------------------------------------------------------------------*/
void * fits_iter_get_array(iteratorCol *col) /* I - iterator col structure */
/*
  get iterator column parameter
*/
{
     return(col->array);
}
/*--------------------------------------------------------------------------*/
long fits_iter_get_tlmin(iteratorCol *col) /* I - iterator column structure */
/*
  get iterator column parameter
*/
{
     return(col->tlmin);
}
/*--------------------------------------------------------------------------*/
long fits_iter_get_tlmax(iteratorCol *col) /* I - iterator column structure */
/*
  get iterator column parameter
*/
{
     return(col->tlmax);
}
/*--------------------------------------------------------------------------*/
long fits_iter_get_repeat(iteratorCol *col) /* I - iterator col structure */
/*
  get iterator column parameter
*/
{
     return(col->repeat);
}
/*--------------------------------------------------------------------------*/
char * fits_iter_get_tunit(iteratorCol *col) /* I - iterator col structure */
/*
  get iterator column parameter
*/
{
    return(col->tunit);
}
/*--------------------------------------------------------------------------*/
char * fits_iter_get_tdisp(iteratorCol *col) /* I -iterator col structure   */
/*
  get iterator column parameter
*/
{
    return(col->tdisp);
}
/*--------------------------------------------------------------------------*/
int ffiter(int n_cols,
           iteratorCol *cols,
           long offset,
           long n_per_loop,
           int (*work_fn)(long total_n,
                          long offset,
                          long first_n,
                          long n_values,
                          int n_cols,
                          iteratorCol *cols,
                          void *userPointer),
           void *userPointer,
           int *status)
/*
   The iterator function.  This function will pass the specified
   columns from a FITS table or pixels from a FITS image to the 
   user-supplied function.  Depending on the size of the table
   or image, only a subset of the rows or pixels may be passed to the
   function on each call, in which case the function will be called
   multiple times until all the rows or pixels have been processed.
*/
{
    typedef struct  /* structure to store the column null value */
    {  
        int      nullsize;    /* length of the null value, in bytes */
        union {   /*  default null value for the column */
            char   *stringnull;
            unsigned char   charnull;
            signed char scharnull;
            int    intnull;
            short  shortnull;
            long   longnull;
            unsigned int   uintnull;
            unsigned short ushortnull;
            unsigned long  ulongnull;
            float  floatnull;
            double doublenull;
	    LONGLONG longlongnull;
        } null;
    } colNulls;

    void *dataptr, *defaultnull;
    colNulls *col;
    int ii, jj, tstatus, naxis, bitpix;
    int typecode, hdutype, jtype, type, anynul, nfiles, nbytes;
    long totaln, nleft, frow, felement, n_optimum, i_optimum, ntodo;
    long rept, rowrept, width, tnull, naxes[9] = {1,1,1,1,1,1,1,1,1}, groups;
    double zeros = 0.;
    char message[FLEN_ERRMSG], keyname[FLEN_KEYWORD], nullstr[FLEN_VALUE];
    char **stringptr, *nullptr, *cptr;

    if (*status > 0)
        return(*status);

    if (n_cols  < 0 || n_cols > 999 )
    {
        ffpmsg("Illegal number of columms (ffiter)");
        return(*status = BAD_COL_NUM);  /* negative number of columns */
    }

    /*------------------------------------------------------------*/
    /* Make sure column numbers and datatypes are in legal range  */
    /* and column numbers and datatypes are legal.                */ 
    /* Also fill in other parameters in the column structure.     */
    /*------------------------------------------------------------*/

    ffghdt(cols[0].fptr, &hdutype, status);  /* type of first HDU */

    for (jj = 0; jj < n_cols; jj++)
    {
        /* check that output datatype code value is legal */
        type = cols[jj].datatype;  

        /* Allow variable length arrays for InputCol and InputOutputCol columns,
	   but not for OutputCol columns.  Variable length arrays have a
	   negative type code value. */

        if ((cols[jj].iotype != OutputCol) && (type<0)) {
            type*=-1;
        }

        if (type != 0      && type != TBYTE  &&
            type != TSBYTE && type != TLOGICAL && type != TSTRING &&
            type != TSHORT && type != TINT     && type != TLONG && 
            type != TFLOAT && type != TDOUBLE  && type != TCOMPLEX &&
            type != TULONG && type != TUSHORT  && type != TDBLCOMPLEX &&
	    type != TLONGLONG )
        {
	    if (type < 0) {
	      snprintf(message,FLEN_ERRMSG,
              "Variable length array not allowed for output column number %d (ffiter)",
                    jj + 1);
	    } else {
            snprintf(message,FLEN_ERRMSG,
                   "Illegal datatype for column number %d: %d  (ffiter)",
                    jj + 1, cols[jj].datatype);
	    }
	    
            ffpmsg(message);
            return(*status = BAD_DATATYPE);
        }

        /* initialize TLMINn, TLMAXn, column name, and display format */
        cols[jj].tlmin = 0;
        cols[jj].tlmax = 0;
        cols[jj].tunit[0] = '\0';
        cols[jj].tdisp[0] = '\0';

        ffghdt(cols[jj].fptr, &jtype, status);  /* get HDU type */

        if (hdutype == IMAGE_HDU) /* operating on FITS images */
        {
            if (jtype != IMAGE_HDU)
            {
                snprintf(message,FLEN_ERRMSG,
                "File %d not positioned to an image extension (ffiter)",
                    jj + 1);
                return(*status = NOT_IMAGE);
            }

            /* since this is an image, set a dummy column number = 0 */
            cols[jj].colnum = 0;
            strcpy(cols[jj].colname, "IMAGE");  /* dummy name for images */

            tstatus = 0;
            ffgkys(cols[jj].fptr, "BUNIT", cols[jj].tunit, 0, &tstatus);
        }
        else  /* operating on FITS tables */
        {
            if (jtype == IMAGE_HDU)
            {
                snprintf(message,FLEN_ERRMSG,
                "File %d not positioned to a table extension (ffiter)",
                    jj + 1);
                return(*status = NOT_TABLE);
            }

            if (cols[jj].colnum < 1)
            {
                /* find the column number for the named column */
                if (ffgcno(cols[jj].fptr, CASEINSEN, cols[jj].colname,
                           &cols[jj].colnum, status) )
                {
                    snprintf(message,FLEN_ERRMSG,
                      "Column '%s' not found for column number %d  (ffiter)",
                       cols[jj].colname, jj + 1);
                    ffpmsg(message);
                    return(*status);
                }
            }

            /* check that the column number is valid */
            if (cols[jj].colnum < 1 || 
                cols[jj].colnum > ((cols[jj].fptr)->Fptr)->tfield)
            {
                snprintf(message,FLEN_ERRMSG,
                  "Column %d has illegal table position number: %d  (ffiter)",
                    jj + 1, cols[jj].colnum);
                ffpmsg(message);
                return(*status = BAD_COL_NUM);
            }

            /* look for column description keywords and update structure */
            tstatus = 0;
            ffkeyn("TLMIN", cols[jj].colnum, keyname, &tstatus);
            ffgkyj(cols[jj].fptr, keyname, &cols[jj].tlmin, 0, &tstatus);

            tstatus = 0;
            ffkeyn("TLMAX", cols[jj].colnum, keyname, &tstatus);
            ffgkyj(cols[jj].fptr, keyname, &cols[jj].tlmax, 0, &tstatus);

            tstatus = 0;
            ffkeyn("TTYPE", cols[jj].colnum, keyname, &tstatus);
            ffgkys(cols[jj].fptr, keyname, cols[jj].colname, 0, &tstatus);
            if (tstatus)
                cols[jj].colname[0] = '\0';

            tstatus = 0;
            ffkeyn("TUNIT", cols[jj].colnum, keyname, &tstatus);
            ffgkys(cols[jj].fptr, keyname, cols[jj].tunit, 0, &tstatus);

            tstatus = 0;
            ffkeyn("TDISP", cols[jj].colnum, keyname, &tstatus);
            ffgkys(cols[jj].fptr, keyname, cols[jj].tdisp, 0, &tstatus);
        }
    }  /* end of loop over all columns */

    /*-----------------------------------------------------------------*/
    /* use the first file to set the total number of values to process */
    /*-----------------------------------------------------------------*/

    offset = maxvalue(offset, 0L);  /* make sure offset is legal */

    if (hdutype == IMAGE_HDU)   /* get total number of pixels in the image */
    {
      fits_get_img_dim(cols[0].fptr, &naxis, status);
      fits_get_img_size(cols[0].fptr, 9, naxes, status);

      tstatus = 0;
      ffgkyj(cols[0].fptr, "GROUPS", &groups, NULL, &tstatus);
      if (!tstatus && groups && (naxis > 1) && (naxes[0] == 0) )
      {
         /* this is a random groups file, with NAXIS1 = 0 */
         /* Use GCOUNT, the number of groups, as the first multiplier  */
         /* to calculate the total number of pixels in all the groups. */
         ffgkyj(cols[0].fptr, "GCOUNT", &totaln, NULL, status);

      }  else {
         totaln = naxes[0];
      }

      for (ii = 1; ii < naxis; ii++)
          totaln *= naxes[ii];

      frow = 1;
      felement = 1 + offset;
    }
    else   /* get total number or rows in the table */
    {
      ffgkyj(cols[0].fptr, "NAXIS2", &totaln, 0, status);
      frow = 1 + offset;
      felement = 1;
    }

    /*  adjust total by the input starting offset value */
    totaln -= offset;
    totaln = maxvalue(totaln, 0L);   /* don't allow negative number */

    /*------------------------------------------------------------------*/
    /* Determine number of values to pass to work function on each loop */
    /*------------------------------------------------------------------*/

    if (n_per_loop == 0)
    {
        /* Determine optimum number of values for each iteration.    */
        /* Look at all the fitsfile pointers to determine the number */
        /* of unique files.                                          */

        nfiles = 1;
        ffgrsz(cols[0].fptr, &n_optimum, status);

        for (jj = 1; jj < n_cols; jj++)
        {
            for (ii = 0; ii < jj; ii++)
            {
                if (cols[ii].fptr == cols[jj].fptr)
                   break;
            }

            if (ii == jj)  /* this is a new file */
            {
                nfiles++;
                ffgrsz(cols[jj].fptr, &i_optimum, status);
                n_optimum = minvalue(n_optimum, i_optimum);
            }
        }

        /* divid n_optimum by the number of files that will be processed */
        n_optimum = n_optimum / nfiles;
        n_optimum = maxvalue(n_optimum, 1);
    }
    else if (n_per_loop < 0)  /* must pass all the values at one time */
    {
        n_optimum = totaln;
    }
    else /* calling routine specified how many values to pass at a time */
    {
        n_optimum = minvalue(n_per_loop, totaln);
    }

    /*--------------------------------------*/
    /* allocate work arrays for each column */
    /* and determine the null pixel value   */
    /*--------------------------------------*/

    col = calloc(n_cols, sizeof(colNulls) ); /* memory for the null values */
    if (!col)
    {
        ffpmsg("ffiter failed to allocate memory for null values");
        *status = MEMORY_ALLOCATION;  /* memory allocation failed */
        return(*status);
    }

    for (jj = 0; jj < n_cols; jj++)
    {
        /* get image or column datatype and vector length */
        if (hdutype == IMAGE_HDU)   /* get total number of pixels in the image */
        {
           fits_get_img_type(cols[jj].fptr, &bitpix, status);
           switch(bitpix) {
             case BYTE_IMG:
                 typecode = TBYTE;
                 break;
             case SHORT_IMG:
                 typecode = TSHORT;
                 break;
             case LONG_IMG:
                 typecode = TLONG;
                 break;
             case FLOAT_IMG:
                 typecode = TFLOAT;
                 break;
             case DOUBLE_IMG:
                 typecode = TDOUBLE;
                 break;
             case LONGLONG_IMG:
                 typecode = TLONGLONG;
                 break;
            }
        }
        else
        {
            if (ffgtcl(cols[jj].fptr, cols[jj].colnum, &typecode, &rept,
                  &width, status) > 0)
                goto cleanup;
		
	    if (typecode < 0) {  /* if any variable length arrays, then the */ 
	        n_optimum = 1;   /* must process the table 1 row at a time */
		
              /* Allow variable length arrays for InputCol and InputOutputCol columns,
	       but not for OutputCol columns.  Variable length arrays have a
	       negative type code value. */

              if (cols[jj].iotype == OutputCol) {
 	        snprintf(message,FLEN_ERRMSG,
                "Variable length array not allowed for output column number %d (ffiter)",
                    jj + 1);
                ffpmsg(message);
                return(*status = BAD_DATATYPE);
              }
	   }
        }

        /* special case where sizeof(long) = 8: use TINT instead of TLONG */
        if (abs(typecode) == TLONG && sizeof(long) == 8 && sizeof(int) == 4) {
		if(typecode<0) {
			typecode = -TINT;
		} else {
			typecode = TINT;
		}
        }

        /* Special case: interprete 'X' column as 'B' */
        if (abs(typecode) == TBIT)
        {
            typecode  = typecode / TBIT * TBYTE;
            rept = (rept + 7) / 8;
        }

        if (cols[jj].datatype == 0)    /* output datatype not specified? */
        {
            /* special case if sizeof(long) = 8: use TINT instead of TLONG */
            if (abs(typecode) == TLONG && sizeof(long) == 8 && sizeof(int) == 4)
                cols[jj].datatype = TINT;
            else
                cols[jj].datatype = abs(typecode);
        }

        /* calc total number of elements to do on each iteration */
        if (hdutype == IMAGE_HDU || cols[jj].datatype == TSTRING)
        {
            ntodo = n_optimum; 
            cols[jj].repeat = 1;

            /* get the BLANK keyword value, if it exists */
            if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG
                || abs(typecode) == TINT || abs(typecode) == TLONGLONG)
            {
                tstatus = 0;
                ffgkyj(cols[jj].fptr, "BLANK", &tnull, 0, &tstatus);
                if (tstatus)
                {
                    tnull = 0L;  /* no null values */
                }
            }
        }
        else
        {
	    if (typecode < 0) 
	    {
              /* get max size of the variable length vector; dont't trust the value
	         given by the TFORM keyword  */
	      rept = 1;
	      for (ii = 0; ii < totaln; ii++) {
		ffgdes(cols[jj].fptr, cols[jj].colnum, frow + ii, &rowrept, NULL, status);
		
		rept = maxvalue(rept, rowrept);
	      }
            }
	    
            ntodo = n_optimum * rept;   /* vector columns */
            cols[jj].repeat = rept;

            /* get the TNULL keyword value, if it exists */
            if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG
                || abs(typecode) == TINT || abs(typecode) == TLONGLONG)
            {
                tstatus = 0;
                if (hdutype == ASCII_TBL) /* TNULLn value is a string */
                {
                    ffkeyn("TNULL", cols[jj].colnum, keyname, &tstatus);
                    ffgkys(cols[jj].fptr, keyname, nullstr, 0, &tstatus);
                    if (tstatus)
                    {
                        tnull = 0L; /* keyword doesn't exist; no null values */
                    }
                    else
                    {
                        cptr = nullstr;
                        while (*cptr == ' ')  /* skip over leading blanks */
                           cptr++;

                        if (*cptr == '\0')  /* TNULLn is all blanks? */
                            tnull = LONG_MIN;
                        else
                        {                                                
                            /* attempt to read TNULLn string as an integer */
                            ffc2ii(nullstr, &tnull, &tstatus);

                            if (tstatus)
                                tnull = LONG_MIN;  /* choose smallest value */
                        }                          /* to represent nulls */
                    }
                }
                else  /* Binary table; TNULLn value is an integer */
                {
                    ffkeyn("TNULL", cols[jj].colnum, keyname, &tstatus);
                    ffgkyj(cols[jj].fptr, keyname, &tnull, 0, &tstatus);
                    if (tstatus)
                    {
                        tnull = 0L; /* keyword doesn't exist; no null values */
                    }
                    else if (tnull == 0)
                    {
                        /* worst possible case: a value of 0 is used to   */
                        /* represent nulls in the FITS file.  We have to  */
                        /* use a non-zero null value here (zero is used to */
                        /* mean there are no null values in the array) so we */
                        /* will use the smallest possible integer instead. */

                        tnull = LONG_MIN;  /* choose smallest possible value */
                    }
                }
            }
        }

        /* Note that the data array starts with 2nd element;  */
        /* 1st element of the array gives the null data value */

        switch (cols[jj].datatype)
        {
         case TBYTE:
          cols[jj].array = calloc(ntodo + 1, sizeof(char));
          col[jj].nullsize  = sizeof(char);  /* number of bytes per value */

          if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG
              || abs(typecode) == TINT || abs(typecode) == TLONGLONG)
          {
              tnull = minvalue(tnull, 255);
              tnull = maxvalue(tnull, 0);
              col[jj].null.charnull = (unsigned char) tnull;
          }
          else
          {
              col[jj].null.charnull = (unsigned char) 255; /* use 255 as null */
          }
          break;

         case TSBYTE:
          cols[jj].array = calloc(ntodo + 1, sizeof(char));
          col[jj].nullsize  = sizeof(char);  /* number of bytes per value */

          if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG
              || abs(typecode) == TINT || abs(typecode) == TLONGLONG)
          {
              tnull = minvalue(tnull, 127);
              tnull = maxvalue(tnull, -128);
              col[jj].null.scharnull = (signed char) tnull;
          }
          else
          {
              col[jj].null.scharnull = (signed char) -128; /* use -128  null */
          }
          break;

         case TSHORT:
          cols[jj].array = calloc(ntodo + 1, sizeof(short));
          col[jj].nullsize  = sizeof(short);  /* number of bytes per value */

          if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG
              || abs(typecode) == TINT || abs(typecode) == TLONGLONG)
          {
              tnull = minvalue(tnull, SHRT_MAX);
              tnull = maxvalue(tnull, SHRT_MIN);
              col[jj].null.shortnull = (short) tnull;
          }
          else
          {
              col[jj].null.shortnull = SHRT_MIN;  /* use minimum as null */
          }
          break;

         case TUSHORT:
          cols[jj].array = calloc(ntodo + 1, sizeof(unsigned short));
          col[jj].nullsize  = sizeof(unsigned short);  /* bytes per value */

          if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG
               || abs(typecode) == TINT || abs(typecode) == TLONGLONG)
          {
              tnull = minvalue(tnull, (long) USHRT_MAX);
              tnull = maxvalue(tnull, 0);  /* don't allow negative value */
              col[jj].null.ushortnull = (unsigned short) tnull;
          }
          else
          {
              col[jj].null.ushortnull = USHRT_MAX;   /* use maximum null */
          }
          break;

         case TINT:
          cols[jj].array = calloc(sizeof(int), ntodo + 1);
          col[jj].nullsize  = sizeof(int);  /* number of bytes per value */

          if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG
               || abs(typecode) == TINT || abs(typecode) == TLONGLONG)
          {
              tnull = minvalue(tnull, INT_MAX);
              tnull = maxvalue(tnull, INT_MIN);
              col[jj].null.intnull = (int) tnull;
          }
          else
          {
              col[jj].null.intnull = INT_MIN;  /* use minimum as null */
          }
          break;

         case TUINT:
          cols[jj].array = calloc(ntodo + 1, sizeof(unsigned int));
          col[jj].nullsize  = sizeof(unsigned int);  /* bytes per value */

          if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG
               || abs(typecode) == TINT || abs(typecode) == TLONGLONG)
          {
              tnull = minvalue(tnull, INT32_MAX);
              tnull = maxvalue(tnull, 0);
              col[jj].null.uintnull = (unsigned int) tnull;
          }
          else
          {
              col[jj].null.uintnull = UINT_MAX;  /* use maximum as null */
          }
          break;

         case TLONG:
          cols[jj].array = calloc(ntodo + 1, sizeof(long));
          col[jj].nullsize  = sizeof(long);  /* number of bytes per value */

          if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG
               || abs(typecode) == TINT || abs(typecode) == TLONGLONG)
          {
              col[jj].null.longnull = tnull;
          }
          else
          {
              col[jj].null.longnull = LONG_MIN;   /* use minimum as null */
          }
          break;

         case TULONG:
          cols[jj].array = calloc(ntodo + 1, sizeof(unsigned long));
          col[jj].nullsize  = sizeof(unsigned long);  /* bytes per value */

          if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG
               || abs(typecode) == TINT || abs(typecode) == TLONGLONG)
          {
              if (tnull < 0)  /* can't use a negative null value */
                  col[jj].null.ulongnull = LONG_MAX;
              else
                  col[jj].null.ulongnull = (unsigned long) tnull;
          }
          else
          {
              col[jj].null.ulongnull = LONG_MAX;   /* use maximum as null */
          }
          break;

         case TFLOAT:
          cols[jj].array = calloc(ntodo + 1, sizeof(float));
          col[jj].nullsize  = sizeof(float);  /* number of bytes per value */

          if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG
               || abs(typecode) == TINT || abs(typecode) == TLONGLONG)
          {
              col[jj].null.floatnull = (float) tnull;
          }
          else
          {
              col[jj].null.floatnull = FLOATNULLVALUE;  /* special value */
          }
          break;

         case TCOMPLEX:
          cols[jj].array = calloc((ntodo * 2) + 1, sizeof(float));
          col[jj].nullsize  = sizeof(float);  /* number of bytes per value */
          col[jj].null.floatnull = FLOATNULLVALUE;  /* special value */
          break;

         case TDOUBLE:
          cols[jj].array = calloc(ntodo + 1, sizeof(double));
          col[jj].nullsize  = sizeof(double);  /* number of bytes per value */

          if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG
               || abs(typecode) == TINT || abs(typecode) == TLONGLONG)
          {
              col[jj].null.doublenull = (double) tnull;
          }
          else
          {
              col[jj].null.doublenull = DOUBLENULLVALUE;  /* special value */
          }
          break;

         case TDBLCOMPLEX:
          cols[jj].array = calloc((ntodo * 2) + 1, sizeof(double));
          col[jj].nullsize  = sizeof(double);  /* number of bytes per value */
          col[jj].null.doublenull = DOUBLENULLVALUE;  /* special value */
          break;

         case TSTRING:
          /* allocate array of pointers to all the strings  */
	  if( hdutype==ASCII_TBL ) rept = width;
          stringptr = calloc((ntodo + 1) , sizeof(stringptr));
          cols[jj].array = stringptr;
          col[jj].nullsize  = rept + 1;  /* number of bytes per value */

          if (stringptr)
          {
            /* allocate string to store the null string value */
            col[jj].null.stringnull = calloc(rept + 1, sizeof(char) );
            col[jj].null.stringnull[1] = 1; /* to make sure string != 0 */

            /* allocate big block for the array of table column strings */
            stringptr[0] = calloc((ntodo + 1) * (rept + 1), sizeof(char) );

            if (stringptr[0])
            {
              for (ii = 1; ii <= ntodo; ii++)
              {   /* pointer to each string */
                stringptr[ii] = stringptr[ii - 1] + (rept + 1);
              }

              /* get the TNULL keyword value, if it exists */
              tstatus = 0;
              ffkeyn("TNULL", cols[jj].colnum, keyname, &tstatus);
              ffgkys(cols[jj].fptr, keyname, nullstr, 0, &tstatus);
              if (!tstatus)
                  strncat(col[jj].null.stringnull, nullstr, rept);
            }
            else
            {
              ffpmsg("ffiter failed to allocate memory arrays");
              *status = MEMORY_ALLOCATION;  /* memory allocation failed */
              goto cleanup;
            }
          }
          break;

         case TLOGICAL:

          cols[jj].array = calloc(ntodo + 1, sizeof(char));
          col[jj].nullsize  = sizeof(char);  /* number of bytes per value */

          /* use value = 2 to flag null values in logical columns */
          col[jj].null.charnull = 2;
          break;

         case TLONGLONG:
          cols[jj].array = calloc(ntodo + 1, sizeof(LONGLONG));
          col[jj].nullsize  = sizeof(LONGLONG);  /* number of bytes per value */

          if (abs(typecode) == TBYTE || abs(typecode) == TSHORT || abs(typecode) == TLONG ||
	      abs(typecode) == TLONGLONG || abs(typecode) == TINT)
          {
              col[jj].null.longlongnull = tnull;
          }
          else
          {
              col[jj].null.longlongnull = LONGLONG_MIN;   /* use minimum as null */
          }
          break;

         default:
          snprintf(message,FLEN_ERRMSG,
                  "Column %d datatype currently not supported: %d:  (ffiter)",
                   jj + 1, cols[jj].datatype);
          ffpmsg(message);
          *status = BAD_DATATYPE;
          goto cleanup;

        }   /* end of switch block */

        /* check that all the arrays were allocated successfully */
        if (!cols[jj].array)
        {
            ffpmsg("ffiter failed to allocate memory arrays");
            *status = MEMORY_ALLOCATION;  /* memory allocation failed */
            goto cleanup;
        }
    }

    /*--------------------------------------------------*/
    /* main loop while there are values left to process */
    /*--------------------------------------------------*/

    nleft = totaln;

    while (nleft)
    {
      ntodo = minvalue(nleft, n_optimum); /* no. of values for this loop */

      /*  read input columns from FITS file(s)  */
      for (jj = 0; jj < n_cols; jj++)
      {
        if (cols[jj].iotype != OutputCol)
        {
          if (cols[jj].datatype == TSTRING)
          {
            stringptr = cols[jj].array;
            dataptr = stringptr + 1;
            defaultnull = col[jj].null.stringnull; /* ptr to the null value */
          }
          else
          {
            dataptr = (char *) cols[jj].array + col[jj].nullsize;
            defaultnull = &col[jj].null.charnull; /* ptr to the null value */
          }

          if (hdutype == IMAGE_HDU)   
          {
              if (ffgpv(cols[jj].fptr, cols[jj].datatype,
                    felement, cols[jj].repeat * ntodo, defaultnull,
                    dataptr,  &anynul, status) > 0)
              {
                 break;
              }
          }
          else
          {
	      if (ffgtcl(cols[jj].fptr, cols[jj].colnum, &typecode, &rept,&width, status) > 0)
	          goto cleanup;
		  
	      if (typecode<0)
	      {
	        /* get size of the variable length vector */
		ffgdes(cols[jj].fptr, cols[jj].colnum, frow,&cols[jj].repeat, NULL,status);
	      }
		
              if (ffgcv(cols[jj].fptr, cols[jj].datatype, cols[jj].colnum,
                    frow, felement, cols[jj].repeat * ntodo, defaultnull,
                    dataptr,  &anynul, status) > 0)
              {
                 break;
              }
          }

          /* copy the appropriate null value into first array element */

          if (anynul)   /* are there any nulls in the data? */
          {   
            if (cols[jj].datatype == TSTRING)
            {
              stringptr = cols[jj].array;
              memcpy(*stringptr, col[jj].null.stringnull, col[jj].nullsize);
            }
            else
            {
              memcpy(cols[jj].array, defaultnull, col[jj].nullsize);
            }
          }
          else /* no null values so copy zero into first element */
          {
            if (cols[jj].datatype == TSTRING)
            {
              stringptr = cols[jj].array;
              memset(*stringptr, 0, col[jj].nullsize);  
            }
            else
            {
              memset(cols[jj].array, 0, col[jj].nullsize);  
            }
          }
        }
      }

      if (*status > 0) 
         break;   /* looks like an error occurred; quit immediately */

      /* call work function */

      if (hdutype == IMAGE_HDU) 
          *status = work_fn(totaln, offset, felement, ntodo, n_cols, cols,
                    userPointer);
      else
          *status = work_fn(totaln, offset, frow, ntodo, n_cols, cols,
                    userPointer);

      if (*status > 0 || *status < -1 ) 
         break;   /* looks like an error occurred; quit immediately */

      /*  write output columns  before quiting if status = -1 */
      tstatus = 0;
      for (jj = 0; jj < n_cols; jj++)
      {
        if (cols[jj].iotype != InputCol)
        {
          if (cols[jj].datatype == TSTRING)
          {
            stringptr = cols[jj].array;
            dataptr = stringptr + 1;
            nullptr = *stringptr;
            nbytes = 2;
          }
          else
          {
            dataptr = (char *) cols[jj].array + col[jj].nullsize;
            nullptr = (char *) cols[jj].array;
            nbytes = col[jj].nullsize;
          }

          if (memcmp(nullptr, &zeros, nbytes) ) 
          {
            /* null value flag not zero; must check for and write nulls */
            if (hdutype == IMAGE_HDU)   
            {
                if (ffppn(cols[jj].fptr, cols[jj].datatype, 
                      felement, cols[jj].repeat * ntodo, dataptr,
                      nullptr, &tstatus) > 0)
                break;
            }
            else
            {
	    	if (ffgtcl(cols[jj].fptr, cols[jj].colnum, &typecode, &rept,&width, status) > 0)
		    goto cleanup;
		    
		if (typecode<0)  /* variable length array colum */
		{
		   ffgdes(cols[jj].fptr, cols[jj].colnum, frow,&cols[jj].repeat, NULL,status);
		}

                if (ffpcn(cols[jj].fptr, cols[jj].datatype, cols[jj].colnum, frow,
                      felement, cols[jj].repeat * ntodo, dataptr,
                      nullptr, &tstatus) > 0)
                break;
            }
          }
          else
          { 
            /* no null values; just write the array */
            if (hdutype == IMAGE_HDU)   
            {
                if (ffppr(cols[jj].fptr, cols[jj].datatype,
                      felement, cols[jj].repeat * ntodo, dataptr,
                      &tstatus) > 0)
                break;
            }
            else
            {
	    	if (ffgtcl(cols[jj].fptr, cols[jj].colnum, &typecode, &rept,&width, status) > 0)
		    goto cleanup;
		    
		if (typecode<0)  /* variable length array column */
		{
		   ffgdes(cols[jj].fptr, cols[jj].colnum, frow,&cols[jj].repeat, NULL,status);
		}

                 if (ffpcl(cols[jj].fptr, cols[jj].datatype, cols[jj].colnum, frow,
                      felement, cols[jj].repeat * ntodo, dataptr,
                      &tstatus) > 0)
                break;
            }
          }
        }
      }

      if (*status == 0)
         *status = tstatus;   /* propagate any error status from the writes */

      if (*status) 
         break;   /* exit on any error */

      nleft -= ntodo;

      if (hdutype == IMAGE_HDU)
          felement += ntodo;
      else
          frow  += ntodo;
    }

cleanup:

    /*----------------------------------*/
    /* free work arrays for the columns */
    /*----------------------------------*/

    for (jj = 0; jj < n_cols; jj++)
    {
        if (cols[jj].datatype == TSTRING)
        {
            if (cols[jj].array)
            {
                stringptr = cols[jj].array;
                free(*stringptr);     /* free the block of strings */
                free(col[jj].null.stringnull); /* free the null string */
            }
        }
        if (cols[jj].array)
            free(cols[jj].array); /* memory for the array of values from the col */
    }
    free(col);   /* the structure containing the null values */
    return(*status);
}

cfitsio-3.47/putcold.c0000644000225700000360000011350213464573432014230 0ustar  cagordonlhea/*  This file, putcold.c, contains routines that write data elements to    */
/*  a FITS image or table, with double datatype.                           */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffpprd( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            double *array,   /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;
    double nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_pixels(fptr, TDOUBLE, firstelem, nelem,
            0, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcld(fptr, 2, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppnd( fitsfile *fptr,   /* I - FITS file pointer                       */
            long  group,      /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem,  /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,      /* I - number of values to write               */
            double *array,    /* I - array of values that are written        */
            double nulval,    /* I - undefined pixel value                   */
            int  *status)     /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).  Any array values
  that are equal to the value of nulval will be replaced with the null
  pixel value that is appropriate for this column.
*/
{
    long row;
    double nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        nullvalue = nulval;  /* set local variable */
        fits_write_compressed_pixels(fptr, TDOUBLE, firstelem, nelem,
            1, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcnd(fptr, 2, row, firstelem, nelem, array, nulval, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp2dd(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           double *array,    /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    /* call the 3D writing routine, with the 3rd dimension = 1 */

    ffp3dd(fptr, group, ncols, naxis2, naxis1, naxis2, 1, array, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp3dd(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  nrows,      /* I - number of rows in each plane of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  naxis3,     /* I - FITS image NAXIS3 value               */
           double *array,    /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 3-D cube of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    long tablerow, ii, jj;
    long fpixel[3]= {1,1,1}, lpixel[3];
    LONGLONG nfits, narray;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
        lpixel[0] = (long) ncols;
        lpixel[1] = (long) nrows;
        lpixel[2] = (long) naxis3;

        fits_write_compressed_img(fptr, TDOUBLE, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
      /* all the image pixels are contiguous, so write all at once */
      ffpcld(fptr, 2, tablerow, 1L, naxis1 * naxis2 * naxis3, array, status);
      return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to write to */
    narray = 0;  /* next pixel in input array to be written */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* writing naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffpcld(fptr, 2, tablerow, nfits, naxis1,&array[narray],status) > 0)
         return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpssd(fitsfile *fptr,   /* I - FITS file pointer                       */
           long  group,      /* I - group to write(1 = 1st group)           */
           long  naxis,      /* I - number of data axes in array            */
           long  *naxes,     /* I - size of each FITS axis                  */
           long  *fpixel,    /* I - 1st pixel in each axis to write (1=1st) */
           long  *lpixel,    /* I - last pixel in each axis to write        */
           double *array,    /* I - array to be written                     */
           int  *status)     /* IO - error status                           */
/*
  Write a subsection of pixels to the primary array or image.
  A subsection is defined to be any contiguous rectangular
  array of pixels within the n-dimensional FITS data file.
  Data conversion and scaling will be performed if necessary 
  (e.g, if the datatype of the FITS array is not the same as
  the array being written).
*/
{
    long tablerow;
    LONGLONG fpix[7], dimen[7], astart, pstart;
    LONGLONG off2, off3, off4, off5, off6, off7;
    LONGLONG st10, st20, st30, st40, st50, st60, st70;
    LONGLONG st1, st2, st3, st4, st5, st6, st7;
    long ii, i1, i2, i3, i4, i5, i6, i7, irange[7];

    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_img(fptr, TDOUBLE, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    if (naxis < 1 || naxis > 7)
      return(*status = BAD_DIMEN);

    tablerow=maxvalue(1,group);

     /* calculate the size and number of loops to perform in each dimension */
    for (ii = 0; ii < 7; ii++)
    {
      fpix[ii]=1;
      irange[ii]=1;
      dimen[ii]=1;
    }

    for (ii = 0; ii < naxis; ii++)
    {    
      fpix[ii]=fpixel[ii];
      irange[ii]=lpixel[ii]-fpixel[ii]+1;
      dimen[ii]=naxes[ii];
    }

    i1=irange[0];

    /* compute the pixel offset between each dimension */
    off2 =     dimen[0];
    off3 = off2 * dimen[1];
    off4 = off3 * dimen[2];
    off5 = off4 * dimen[3];
    off6 = off5 * dimen[4];
    off7 = off6 * dimen[5];

    st10 = fpix[0];
    st20 = (fpix[1] - 1) * off2;
    st30 = (fpix[2] - 1) * off3;
    st40 = (fpix[3] - 1) * off4;
    st50 = (fpix[4] - 1) * off5;
    st60 = (fpix[5] - 1) * off6;
    st70 = (fpix[6] - 1) * off7;

    /* store the initial offset in each dimension */
    st1 = st10;
    st2 = st20;
    st3 = st30;
    st4 = st40;
    st5 = st50;
    st6 = st60;
    st7 = st70;

    astart = 0;

    for (i7 = 0; i7 < irange[6]; i7++)
    {
     for (i6 = 0; i6 < irange[5]; i6++)
     {
      for (i5 = 0; i5 < irange[4]; i5++)
      {
       for (i4 = 0; i4 < irange[3]; i4++)
       {
        for (i3 = 0; i3 < irange[2]; i3++)
        {
         pstart = st1 + st2 + st3 + st4 + st5 + st6 + st7;

         for (i2 = 0; i2 < irange[1]; i2++)
         {
           if (ffpcld(fptr, 2, tablerow, pstart, i1, &array[astart],
              status) > 0)
              return(*status);

           astart += i1;
           pstart += off2;
         }
         st2 = st20;
         st3 = st3+off3;    
        }
        st3 = st30;
        st4 = st4+off4;
       }
       st4 = st40;
       st5 = st5+off5;
      }
      st5 = st50;
      st6 = st6+off6;
     }
     st6 = st60;
     st7 = st7+off7;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpgpd( fitsfile *fptr,   /* I - FITS file pointer                      */
            long  group,      /* I - group to write(1 = 1st group)          */
            long  firstelem,  /* I - first vector element to write(1 = 1st) */
            long  nelem,      /* I - number of values to write              */
            double *array,    /* I - array of values that are written       */
            int  *status)     /* IO - error status                          */
/*
  Write an array of group parameters to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffpcld(fptr, 1L, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcld( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            double *array,   /* I - array of values to write                */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    int tcode, maxelem2, hdutype, writeraw;
    long twidth, incre;
    long ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull, maxelem;
    double scale, zero;
    char tform[20], cform[20];
    char message[FLEN_ERRMSG];

    char snull[20];   /*  the FITS null value  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem2, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);
    maxelem = maxelem2;

    if (tcode == TSTRING)   
         ffcfmt(tform, cform);     /* derive C format for writing strings */

    /*
      if there is no scaling and the native machine format is not byteswapped,
      then we can simply write the raw data bytes into the FITS file if the
      datatype of the FITS column is the same as the input values.  Otherwise,
      we must convert the raw values into the scaled and/or machine dependent
      format in a temporary buffer that has been allocated for this purpose.
    */
    if (scale == 1. && zero == 0. && 
       MACHINE == NATIVE && tcode == TDOUBLE)
    {
        writeraw = 1;
        if (nelem < (LONGLONG)INT32_MAX) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/8;
        }
     }
    else
        writeraw = 0;

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*  First call the ffXXfYY routine to  (1) convert the datatype        */
    /*  if necessary, and (2) scale the values by the FITS TSCALn and      */
    /*  TZEROn linear scaling parameters into a temporary buffer.          */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
        /* limit the number of pixels to process a one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, (repeat - elemnum));

        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);

        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TDOUBLE):
              if (writeraw)
              {
                /* write raw input bytes without conversion */
                ffpr8b(fptr, ntodo, incre, &array[next], status);
              }
              else
              {
                /* convert the raw data before writing to FITS file */
                ffr8fr8(&array[next], ntodo, scale, zero,
                        (double *) buffer, status);
                ffpr8b(fptr, ntodo, incre, (double *) buffer, status);
              }

              break;

            case (TLONGLONG):

                ffr8fi8(&array[next], ntodo, scale, zero,
                        (LONGLONG *) buffer, status);
                ffpi8b(fptr, ntodo, incre, (long *) buffer, status);
                break;

            case (TBYTE):
 
                ffr8fi1(&array[next], ntodo, scale, zero, 
                        (unsigned char *) buffer, status);
                ffpi1b(fptr, ntodo, incre, (unsigned char *) buffer, status);
                break;

            case (TSHORT):

                ffr8fi2(&array[next], ntodo, scale, zero, 
                       (short *) buffer, status);
                ffpi2b(fptr, ntodo, incre, (short *) buffer, status);
                break;

            case (TLONG):

                ffr8fi4(&array[next], ntodo, scale, zero,
                        (INT32BIT *) buffer, status);
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) buffer, status);
                break;

            case (TFLOAT):
                ffr8fr4(&array[next], ntodo, scale, zero,
                        (float *) buffer, status);
                ffpr4b(fptr, ntodo, incre, (float *) buffer, status);
                break;

            case (TSTRING):  /* numerical column in an ASCII table */

                if (cform[1] != 's')  /*  "%s" format is a string */
                {
                  ffr8fstr(&array[next], ntodo, scale, zero, cform,
                          twidth, (char *) buffer, status);

                  if (incre == twidth)    /* contiguous bytes */
                     ffpbyt(fptr, ntodo * twidth, buffer, status);
                  else
                     ffpbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                            status);

                  break;
                }
                /* can't write to string column, so fall thru to default: */

            default:  /*  error trap  */
                snprintf(message, FLEN_ERRMSG,
                      "Cannot write numbers to column %d which has format %s",
                       colnum,tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
          snprintf(message,FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpcld).",
              (double) (next+1), (double) (next+ntodo));
         ffpmsg(message);
         return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while writing FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpclm( fitsfile *fptr,   /* I - FITS file pointer                       */
            int  colnum,      /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,   /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem,  /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,      /* I - number of values to write               */
            double *array,    /* I - array of values to write                */
            int  *status)     /* IO - error status                           */
/*
  Write an array of double complex values to a column in the current FITS HDU.
  Each complex number if interpreted as a pair of float values.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column
  if necessary, but normally complex values should only be written to a binary
  table with TFORMn = 'rM' where r is an optional repeat count. The TSCALn and
  TZERO keywords should not be used with complex numbers because mathmatically
  the scaling should only be applied to the real (first) component of the
  complex value.
*/
{
    /* simply multiply the number of elements by 2, and call ffpcld */

    ffpcld(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1, 
            nelem * 2, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcnd( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            double *array,   /* I - array of values to write                */
            double nulvalue, /* I - value used to flag undefined pixels     */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels equal to the value of nulvalue will be replaced by the appropriate
  null value in the output FITS file. 

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode, overflow = 0;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    if (abs(tcode) >= TCOMPLEX)
    { /* treat complex columns as pairs of numbers */
        repeat *= 2;
    }

    /* if variable length array, first write the whole input vector, 
       then go back and fill in the nulls */
    if (tcode < 0) {
      if (ffpcld(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0) {
	if (*status == NUM_OVERFLOW) 
	{
	  /* ignore overflows, which are possibly the null pixel values */
	  /*  overflow = 1;   */
	  *status = 0;
	} else { 
          return(*status);
	}
      }
    }

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            /* call ffpcluc, not ffpclu, in case we are writing to a
	       complex ('C') binary table column */
            if (ffpcluc(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood +1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (tcode > 0) {  /* variable length arrays have already been written */
              if (ffpcld(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0) {
		if (*status == NUM_OVERFLOW) 
		{
		  overflow = 1;
		  *status = 0;
		} else {
                  return(*status);
		}
	      }
            }
            ngood=0;
         }

         nbad = nbad +1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      if (tcode > 0) {  /* variable length arrays have already been written */
        ffpcld(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
      }
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */
      ffpcluc(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    if (*status <= 0) {
      if (overflow) {
        *status = NUM_OVERFLOW;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr8fi1(double *input,         /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            unsigned char *output, /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (input[ii] > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (dvalue > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) (dvalue + .5);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr8fi2(double *input,     /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            short *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (input[ii] > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
                output[ii] = (short) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (short) (dvalue + .5);
                else
                    output[ii] = (short) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr8fi4(double *input,     /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            INT32BIT *output,  /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (input[ii] > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
                output[ii] = (INT32BIT) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (INT32BIT) (dvalue + .5);
                else
                    output[ii] = (INT32BIT) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr8fi8(double *input,     /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            LONGLONG *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero ==  9223372036854775808.)
    {       
        /* Writing to unsigned long long column. Input values must not be negative */
        /* Instead of subtracting 9223372036854775808, it is more efficient */
        /* and more precise to just flip the sign bit with the XOR operator */

        for (ii = 0; ii < ntodo; ii++) {
            if (input[ii] < -0.49) {
              *status = OVERFLOW_ERR;
              output[ii] = LONGLONG_MIN;
            }
	    else if (input[ii] > 2.* DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            } else {
              output[ii] =  ((LONGLONG) input[ii]) ^ 0x8000000000000000;
            }
        }
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (input[ii] > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
                output[ii] = (LONGLONG) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (dvalue > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (LONGLONG) (dvalue + .5);
                else
                    output[ii] = (LONGLONG) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr8fr4(double *input,     /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            float *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (float) ((input[ii] - zero) / scale);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr8fr8(double *input,     /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            double *output,    /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
      memcpy(output, input, ntodo * sizeof(double) ); /* copy input to output */
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (input[ii] - zero) / scale;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr8fstr(double *input,     /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            char *cform,       /* I - format for output string values  */
            long twidth,       /* I - width of each field, in chars    */
            char *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do scaling if required.
*/
{
    long ii;
    double dvalue;
    char *cptr;
    
    cptr = output;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
           sprintf(output, cform, input[ii]);
           output += twidth;

           if (*output)  /* if this char != \0, then overflow occurred */
              *status = OVERFLOW_ERR;
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
          dvalue = (input[ii] - zero) / scale;
          sprintf(output, cform, dvalue);
          output += twidth;

          if (*output)  /* if this char != \0, then overflow occurred */
            *status = OVERFLOW_ERR;
        }
    }

    /* replace any commas with periods (e.g., in French locale) */
    while ((cptr = strchr(cptr, ','))) *cptr = '.';
    
    return(*status);
}
cfitsio-3.47/putcole.c0000644000225700000360000011457413464573432014243 0ustar  cagordonlhea/*  This file, putcole.c, contains routines that write data elements to    */
/*  a FITS image or table, with float datatype.                            */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffppre( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG nelem,     /* I - number of values to write               */
            float *array,    /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).

  This routine cannot be called directly by users to write to large
  arrays with > 2**31 pixels (although CFITSIO can do so by passing
  the firstelem thru a LONGLONG sized global variable)
*/
{
    long row;
    float nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_pixels(fptr, TFLOAT, firstelem, nelem,
            0, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcle(fptr, 2, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppne( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG nelem,     /* I - number of values to write               */
            float *array,    /* I - array of values that are written        */
            float nulval,    /* I - undefined pixel value                   */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).  Any array values
  that are equal to the value of nulval will be replaced with the null
  pixel value that is appropriate for this column.

  This routine cannot be called directly by users to write to large
  arrays with > 2**31 pixels (although CFITSIO can do so by passing
  the firstelem thru a LONGLONG sized global variable)
*/
{
    long row;
    float nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        nullvalue = nulval;  /* set local variable */
        fits_write_compressed_pixels(fptr, TFLOAT, firstelem, nelem,
            1, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcne(fptr, 2, row, firstelem, nelem, array, nulval, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp2de(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           float *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).

  This routine does not support writing to large images with
  more than 2**31 pixels.
*/
{
    /* call the 3D writing routine, with the 3rd dimension = 1 */

    ffp3de(fptr, group, ncols, naxis2, naxis1, naxis2, 1, array, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp3de(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  nrows,      /* I - number of rows in each plane of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  naxis3,     /* I - FITS image NAXIS3 value               */
           float *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 3-D cube of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).

  This routine does not support writing to large images with
  more than 2**31 pixels.
*/
{
    long tablerow, ii, jj;
    long fpixel[3]= {1,1,1}, lpixel[3];
    LONGLONG nfits, narray;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
           
    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
        lpixel[0] = (long) ncols;
        lpixel[1] = (long) nrows;
        lpixel[2] = (long) naxis3;
       
        fits_write_compressed_img(fptr, TFLOAT, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
      /* all the image pixels are contiguous, so write all at once */
      ffpcle(fptr, 2, tablerow, 1L, naxis1 * naxis2 * naxis3, array, status);
      return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to write to */
    narray = 0;  /* next pixel in input array to be written */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* writing naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffpcle(fptr, 2, tablerow, nfits, naxis1,&array[narray],status) > 0)
         return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpsse(fitsfile *fptr,   /* I - FITS file pointer                       */
           long  group,      /* I - group to write(1 = 1st group)           */
           long  naxis,      /* I - number of data axes in array            */
           long  *naxes,     /* I - size of each FITS axis                  */
           long  *fpixel,    /* I - 1st pixel in each axis to write (1=1st) */
           long  *lpixel,    /* I - last pixel in each axis to write        */
           float *array,     /* I - array to be written                     */
           int  *status)     /* IO - error status                           */
/*
  Write a subsection of pixels to the primary array or image.
  A subsection is defined to be any contiguous rectangular
  array of pixels within the n-dimensional FITS data file.
  Data conversion and scaling will be performed if necessary 
  (e.g, if the datatype of the FITS array is not the same as
  the array being written).
*/
{
    long tablerow;
    LONGLONG fpix[7], dimen[7], astart, pstart;
    LONGLONG off2, off3, off4, off5, off6, off7;
    LONGLONG st10, st20, st30, st40, st50, st60, st70;
    LONGLONG st1, st2, st3, st4, st5, st6, st7;
    long ii, i1, i2, i3, i4, i5, i6, i7, irange[7];

    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_img(fptr, TFLOAT, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    if (naxis < 1 || naxis > 7)
      return(*status = BAD_DIMEN);

    tablerow=maxvalue(1,group);

     /* calculate the size and number of loops to perform in each dimension */
    for (ii = 0; ii < 7; ii++)
    {
      fpix[ii]=1;
      irange[ii]=1;
      dimen[ii]=1;
    }

    for (ii = 0; ii < naxis; ii++)
    {    
      fpix[ii]=fpixel[ii];
      irange[ii]=lpixel[ii]-fpixel[ii]+1;
      dimen[ii]=naxes[ii];
    }

    i1=irange[0];

    /* compute the pixel offset between each dimension */
    off2 =     dimen[0];
    off3 = off2 * dimen[1];
    off4 = off3 * dimen[2];
    off5 = off4 * dimen[3];
    off6 = off5 * dimen[4];
    off7 = off6 * dimen[5];

    st10 = fpix[0];
    st20 = (fpix[1] - 1) * off2;
    st30 = (fpix[2] - 1) * off3;
    st40 = (fpix[3] - 1) * off4;
    st50 = (fpix[4] - 1) * off5;
    st60 = (fpix[5] - 1) * off6;
    st70 = (fpix[6] - 1) * off7;

    /* store the initial offset in each dimension */
    st1 = st10;
    st2 = st20;
    st3 = st30;
    st4 = st40;
    st5 = st50;
    st6 = st60;
    st7 = st70;

    astart = 0;

    for (i7 = 0; i7 < irange[6]; i7++)
    {
     for (i6 = 0; i6 < irange[5]; i6++)
     {
      for (i5 = 0; i5 < irange[4]; i5++)
      {
       for (i4 = 0; i4 < irange[3]; i4++)
       {
        for (i3 = 0; i3 < irange[2]; i3++)
        {
         pstart = st1 + st2 + st3 + st4 + st5 + st6 + st7;

         for (i2 = 0; i2 < irange[1]; i2++)
         {
           if (ffpcle(fptr, 2, tablerow, pstart, i1, &array[astart],
              status) > 0)
              return(*status);

           astart += i1;
           pstart += off2;
         }
         st2 = st20;
         st3 = st3+off3;    
        }
        st3 = st30;
        st4 = st4+off4;
       }
       st4 = st40;
       st5 = st5+off5;
      }
      st5 = st50;
      st6 = st6+off6;
     }
     st6 = st60;
     st7 = st7+off7;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpgpe( fitsfile *fptr,   /* I - FITS file pointer                      */
            long  group,      /* I - group to write(1 = 1st group)          */
            long  firstelem,  /* I - first vector element to write(1 = 1st) */
            long  nelem,      /* I - number of values to write              */
            float *array,     /* I - array of values that are written       */
            int  *status)     /* IO - error status                          */
/*
  Write an array of group parameters to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffpcle(fptr, 1L, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcle( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            float *array,    /* I - array of values to write                */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    int tcode, maxelem2, hdutype, writeraw;
    long twidth, incre;
    long ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull, maxelem;
    double scale, zero;
    char tform[20], cform[20];
    char message[FLEN_ERRMSG];

    char snull[20];   /*  the FITS null value  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem2, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);
    maxelem = maxelem2;

    if (tcode == TSTRING)   
         ffcfmt(tform, cform);     /* derive C format for writing strings */

    /*
       if there is no scaling and the native machine format is not byteswapped
       then we can simply write the raw data bytes into the FITS file if the
       datatype of the FITS column is the same as the input values.  Otherwise,
       we must convert the raw values into the scaled and/or machine dependent
       format in a temporary buffer that has been allocated for this purpose.
    */
    if (scale == 1. && zero == 0. && 
       MACHINE == NATIVE && tcode == TFLOAT)
    {
        writeraw = 1;
        if (nelem < (LONGLONG)INT32_MAX) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/4;
        }
     }
    else
        writeraw = 0;

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*  First call the ffXXfYY routine to  (1) convert the datatype        */
    /*  if necessary, and (2) scale the values by the FITS TSCALn and      */
    /*  TZEROn linear scaling parameters into a temporary buffer.          */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
        /* limit the number of pixels to process a one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, (repeat - elemnum));

        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);

        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TFLOAT):
              if (writeraw)
              {
                /* write raw input bytes without conversion */
                ffpr4b(fptr, ntodo, incre, &array[next], status);
              }
              else
              {
                /* convert the raw data before writing to FITS file */
                ffr4fr4(&array[next], ntodo, scale, zero,
                        (float *) buffer, status);
                ffpr4b(fptr, ntodo, incre, (float *) buffer, status);
              }

              break;

            case (TLONGLONG):

                ffr4fi8(&array[next], ntodo, scale, zero,
                        (LONGLONG *) buffer, status);
                ffpi8b(fptr, ntodo, incre, (long *) buffer, status);
                break;

            case (TBYTE):
 
                ffr4fi1(&array[next], ntodo, scale, zero, 
                        (unsigned char *) buffer, status);
                ffpi1b(fptr, ntodo, incre, (unsigned char *) buffer, status);
                break;

            case (TSHORT):

                ffr4fi2(&array[next], ntodo, scale, zero,
                        (short *) buffer, status);
                ffpi2b(fptr, ntodo, incre, (short *) buffer, status);
                break;

            case (TLONG):

                ffr4fi4(&array[next], ntodo, scale, zero,
                        (INT32BIT *) buffer, status);
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) buffer, status);
                break;

            case (TDOUBLE):
                ffr4fr8(&array[next], ntodo, scale, zero,
                       (double *) buffer, status);
                ffpr8b(fptr, ntodo, incre, (double *) buffer, status);
                break;

            case (TSTRING):  /* numerical column in an ASCII table */

                if (cform[1] != 's')  /*  "%s" format is a string */
                {
                  ffr4fstr(&array[next], ntodo, scale, zero, cform,
                          twidth, (char *) buffer, status);

                  if (incre == twidth)    /* contiguous bytes */
                     ffpbyt(fptr, ntodo * twidth, buffer, status);
                  else
                     ffpbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                            status);

                  break;
                }
                /* can't write to string column, so fall thru to default: */

            default:  /*  error trap  */
                snprintf(message, FLEN_ERRMSG, 
                       "Cannot write numbers to column %d which has format %s",
                        colnum,tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
          snprintf(message,FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpcle).",
             (double) (next+1), (double) (next+ntodo));
         ffpmsg(message);
         return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while writing FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpclc( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            float *array,    /* I - array of values to write                */
            int  *status)    /* IO - error status                           */
/*
  Write an array of complex values to a column in the current FITS HDU.
  Each complex number if interpreted as a pair of float values.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column
  if necessary, but normally complex values should only be written to a binary
  table with TFORMn = 'rC' where r is an optional repeat count. The TSCALn and
  TZERO keywords should not be used with complex numbers because mathmatically
  the scaling should only be applied to the real (first) component of the
  complex value.
*/
{
    /* simply multiply the number of elements by 2, and call ffpcle */

    ffpcle(fptr, colnum, firstrow, (firstelem - 1) * 2 + 1,
            nelem * 2, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcne( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            float *array,    /* I - array of values to write                */
            float  nulvalue, /* I - value used to flag undefined pixels     */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels equal to the value of nulvalue will be replaced by the appropriate
  null value in the output FITS file. 

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode, overflow = 0;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    if (abs(tcode) >= TCOMPLEX)
    { /* treat complex columns as pairs of numbers */
        repeat *= 2;
    }
    
    /* if variable length array, first write the whole input vector, 
       then go back and fill in the nulls */
    if (tcode < 0) {
      if (ffpcle(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0) {
        if (*status == NUM_OVERFLOW) 
	{
	  /* ignore overflows, which are possibly the null pixel values */
	  /*  overflow = 1;   */
	  *status = 0;
	} else { 
          return(*status);
	}
      }
    }

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            /* call ffpcluc, not ffpclu, in case we are writing to a
	       complex ('C') binary table column */
            if (ffpcluc(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood +1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (tcode > 0) {  /* variable length arrays have already been written */
              if (ffpcle(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0) {
		if (*status == NUM_OVERFLOW) 
		{
		  overflow = 1;
		  *status = 0;
		} else { 
                  return(*status);
		}
              }
	    }
            ngood=0;
         }

         nbad = nbad +1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      if (tcode > 0) {  /* variable length arrays have already been written */
        ffpcle(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
      }
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */
      ffpcluc(fptr, colnum, fstrow, fstelm, nbad, status);
    }
    
    if (*status <= 0) {
      if (overflow) {
        *status = NUM_OVERFLOW;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr4fi1(float *input,          /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            unsigned char *output, /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (input[ii] > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (dvalue > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) (dvalue + .5);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr4fi2(float *input,      /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            short *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {           
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (input[ii] > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
                output[ii] = (short) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (short) (dvalue + .5);
                else
                    output[ii] = (short) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr4fi4(float *input,      /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            INT32BIT *output,  /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (input[ii] > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
                output[ii] = (INT32BIT) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (INT32BIT) (dvalue + .5);
                else
                    output[ii] = (INT32BIT) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr4fi8(float *input,      /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            LONGLONG *output,  /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero ==  9223372036854775808.)
    {       
        /* Writing to unsigned long long column. Input values must not be negative */
        /* Instead of subtracting 9223372036854775808, it is more efficient */
        /* and more precise to just flip the sign bit with the XOR operator */

        for (ii = 0; ii < ntodo; ii++) {
            if (input[ii] < -0.49) {
              *status = OVERFLOW_ERR;
              output[ii] = LONGLONG_MIN;
            }
	    else if (input[ii] > 2.* DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            } else {
              output[ii] =  ((LONGLONG) input[ii]) ^ 0x8000000000000000;
            }
        }
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (input[ii] > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
                output[ii] = (long) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (dvalue > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (LONGLONG) (dvalue + .5);
                else
                    output[ii] = (LONGLONG) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr4fr4(float *input,      /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            float *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
      memcpy(output, input, ntodo * sizeof(float) ); /* copy input to output */
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (float) ((input[ii] - zero) / scale);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr4fr8(float *input,      /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            double *output,    /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (input[ii] - zero) / scale;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr4fstr(float *input,     /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            char *cform,       /* I - format for output string values  */
            long twidth,       /* I - width of each field, in chars    */
            char *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do scaling if required.
*/
{
    long ii;
    double dvalue;
    char *cptr;
    
    cptr = output;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
           sprintf(output, cform, (double) input[ii]);
           output += twidth;

           if (*output)  /* if this char != \0, then overflow occurred */
              *status = OVERFLOW_ERR;
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
          dvalue = (input[ii] - zero) / scale;
          sprintf(output, cform, dvalue);
          output += twidth;

          if (*output)  /* if this char != \0, then overflow occurred */
            *status = OVERFLOW_ERR;
        }
    }

    /* replace any commas with periods (e.g., in French locale) */
    while ((cptr = strchr(cptr, ','))) *cptr = '.';
    
    return(*status);
}
cfitsio-3.47/putcoli.c0000644000225700000360000010515713464573432014244 0ustar  cagordonlhea/*  This file, putcoli.c, contains routines that write data elements to    */
/*  a FITS image or table, with short datatype.                            */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffppri( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write (1 = 1st group)          */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            short *array,    /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;
    short nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */


        fits_write_compressed_pixels(fptr, TSHORT, firstelem, nelem,
            0, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcli(fptr, 2, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppni( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            short *array,    /* I - array of values that are written        */
            short nulval,    /* I - undefined pixel value                   */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).  Any array values
  that are equal to the value of nulval will be replaced with the null
  pixel value that is appropriate for this column.
*/
{
    long row;
    short nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        nullvalue = nulval;  /* set local variable */
        fits_write_compressed_pixels(fptr, TSHORT, firstelem, nelem,
            1, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcni(fptr, 2, row, firstelem, nelem, array, nulval, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp2di(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           short *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    /* call the 3D writing routine, with the 3rd dimension = 1 */

    ffp3di(fptr, group, ncols, naxis2, naxis1, naxis2, 1, array, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp3di(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  nrows,      /* I - number of rows in each plane of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  naxis3,     /* I - FITS image NAXIS3 value               */
           short *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 3-D cube of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    long tablerow, ii, jj;
    long fpixel[3]= {1,1,1}, lpixel[3];
    LONGLONG nfits, narray;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
           
    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
        lpixel[0] = (long) ncols;
        lpixel[1] = (long) nrows;
        lpixel[2] = (long) naxis3;
       
        fits_write_compressed_img(fptr, TSHORT, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
      /* all the image pixels are contiguous, so write all at once */
      ffpcli(fptr, 2, tablerow, 1L, naxis1 * naxis2 * naxis3, array, status);
      return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to write to */
    narray = 0;  /* next pixel in input array to be written */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* writing naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffpcli(fptr, 2, tablerow, nfits, naxis1,&array[narray],status) > 0)
         return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpssi(fitsfile *fptr,   /* I - FITS file pointer                       */
           long  group,      /* I - group to write(1 = 1st group)           */
           long  naxis,      /* I - number of data axes in array            */
           long  *naxes,     /* I - size of each FITS axis                  */
           long  *fpixel,    /* I - 1st pixel in each axis to write (1=1st) */
           long  *lpixel,    /* I - last pixel in each axis to write        */
           short *array,     /* I - array to be written                     */
           int  *status)     /* IO - error status                           */
/*
  Write a subsection of pixels to the primary array or image.
  A subsection is defined to be any contiguous rectangular
  array of pixels within the n-dimensional FITS data file.
  Data conversion and scaling will be performed if necessary 
  (e.g, if the datatype of the FITS array is not the same as
  the array being written).
*/
{
    long tablerow;
    LONGLONG fpix[7], dimen[7], astart, pstart;
    LONGLONG off2, off3, off4, off5, off6, off7;
    LONGLONG st10, st20, st30, st40, st50, st60, st70;
    LONGLONG st1, st2, st3, st4, st5, st6, st7;
    long ii, i1, i2, i3, i4, i5, i6, i7, irange[7];

    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_img(fptr, TSHORT, fpixel, lpixel,
            0,  array, NULL, status);

        return(*status);
    }

    if (naxis < 1 || naxis > 7)
      return(*status = BAD_DIMEN);

    tablerow=maxvalue(1,group);

     /* calculate the size and number of loops to perform in each dimension */
    for (ii = 0; ii < 7; ii++)
    {
      fpix[ii]=1;
      irange[ii]=1;
      dimen[ii]=1;
    }

    for (ii = 0; ii < naxis; ii++)
    {    
      fpix[ii]=fpixel[ii];
      irange[ii]=lpixel[ii]-fpixel[ii]+1;
      dimen[ii]=naxes[ii];
    }

    i1=irange[0];

    /* compute the pixel offset between each dimension */
    off2 =     dimen[0];
    off3 = off2 * dimen[1];
    off4 = off3 * dimen[2];
    off5 = off4 * dimen[3];
    off6 = off5 * dimen[4];
    off7 = off6 * dimen[5];

    st10 = fpix[0];
    st20 = (fpix[1] - 1) * off2;
    st30 = (fpix[2] - 1) * off3;
    st40 = (fpix[3] - 1) * off4;
    st50 = (fpix[4] - 1) * off5;
    st60 = (fpix[5] - 1) * off6;
    st70 = (fpix[6] - 1) * off7;

    /* store the initial offset in each dimension */
    st1 = st10;
    st2 = st20;
    st3 = st30;
    st4 = st40;
    st5 = st50;
    st6 = st60;
    st7 = st70;

    astart = 0;

    for (i7 = 0; i7 < irange[6]; i7++)
    {
     for (i6 = 0; i6 < irange[5]; i6++)
     {
      for (i5 = 0; i5 < irange[4]; i5++)
      {
       for (i4 = 0; i4 < irange[3]; i4++)
       {
        for (i3 = 0; i3 < irange[2]; i3++)
        {
         pstart = st1 + st2 + st3 + st4 + st5 + st6 + st7;

         for (i2 = 0; i2 < irange[1]; i2++)
         {
           if (ffpcli(fptr, 2, tablerow, pstart, i1, &array[astart],
              status) > 0)
              return(*status);

           astart += i1;
           pstart += off2;
         }
         st2 = st20;
         st3 = st3+off3;    
        }
        st3 = st30;
        st4 = st4+off4;
       }
       st4 = st40;
       st5 = st5+off5;
      }
      st5 = st50;
      st6 = st6+off6;
     }
     st6 = st60;
     st7 = st7+off7;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpgpi( fitsfile *fptr,   /* I - FITS file pointer                      */
            long  group,      /* I - group to write(1 = 1st group)          */
            long  firstelem,  /* I - first vector element to write(1 = 1st) */
            long  nelem,      /* I - number of values to write              */
            short *array,     /* I - array of values that are written       */
            int  *status)     /* IO - error status                          */
/*
  Write an array of group parameters to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffpcli(fptr, 1L, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcli( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            short *array,    /* I - array of values to write                */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table with
  2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    int tcode, maxelem2, hdutype, writeraw;
    long twidth, incre;
    long ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull, maxelem;
    double scale, zero;
    char tform[20], cform[20];
    char message[FLEN_ERRMSG];

    char snull[20];   /*  the FITS null value  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem2, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);
    maxelem = maxelem2;

    if (tcode == TSTRING)   
         ffcfmt(tform, cform);     /* derive C format for writing strings */

    /*
      if there is no scaling and the native machine format is not byteswapped,
      then we can simply write the raw data bytes into the FITS file if the
      datatype of the FITS column is the same as the input values.  Otherwise,
      we must convert the raw values into the scaled and/or machine dependent
      format in a temporary buffer that has been allocated for this purpose.
    */
    if (scale == 1. && zero == 0. &&
       MACHINE == NATIVE && tcode == TSHORT)
    {
        writeraw = 1;
        if (nelem < (LONGLONG)INT32_MAX) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/2;
        }
    }
    else
        writeraw = 0;

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*  First call the ffXXfYY routine to  (1) convert the datatype        */
    /*  if necessary, and (2) scale the values by the FITS TSCALn and      */
    /*  TZEROn linear scaling parameters into a temporary buffer.          */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
        /* limit the number of pixels to process a one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, (repeat - elemnum));

        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);

        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TSHORT):
              if (writeraw)
              {
                /* write raw input bytes without conversion */
                ffpi2b(fptr, ntodo, incre, &array[next], status);
              }
              else
              {
                /* convert the raw data before writing to FITS file */
                ffi2fi2(&array[next], ntodo, scale, zero,
                        (short *) buffer, status);
                ffpi2b(fptr, ntodo, incre, (short *) buffer, status);
              }

              break;

            case (TLONGLONG):

                ffi2fi8(&array[next], ntodo, scale, zero,
                        (LONGLONG *) buffer, status);
                ffpi8b(fptr, ntodo, incre, (long *) buffer, status);
                break;

             case (TBYTE):

                ffi2fi1(&array[next], ntodo, scale, zero,
                        (unsigned char *) buffer, status);
                ffpi1b(fptr, ntodo, incre, (unsigned char *) buffer, status);
                break;

            case (TLONG):

                ffi2fi4(&array[next], ntodo, scale, zero,
                        (INT32BIT *) buffer, status);
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) buffer, status);
                break;

            case (TFLOAT):

                ffi2fr4(&array[next], ntodo, scale, zero,
                        (float *) buffer, status);
                ffpr4b(fptr, ntodo, incre, (float *) buffer, status);
                break;

            case (TDOUBLE):
                ffi2fr8(&array[next], ntodo, scale, zero,
                        (double *) buffer, status);
                ffpr8b(fptr, ntodo, incre, (double *) buffer, status);
                break;

            case (TSTRING):  /* numerical column in an ASCII table */

                if (cform[1] != 's')  /*  "%s" format is a string */
                {
                  ffi2fstr(&array[next], ntodo, scale, zero, cform,
                          twidth, (char *) buffer, status);


                  if (incre == twidth)    /* contiguous bytes */
                     ffpbyt(fptr, ntodo * twidth, buffer, status);
                  else
                     ffpbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                            status);

                  break;
                }
                /* can't write to string column, so fall thru to default: */

            default:  /*  error trap  */
                snprintf(message,FLEN_ERRMSG, 
                    "Cannot write numbers to column %d which has format %s",
                      colnum,tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
         snprintf(message,FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpcli).",
             (double) (next+1), (double) (next+ntodo));
         ffpmsg(message);
         return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
       ffpmsg(
       "Numerical overflow during type conversion while writing FITS data.");
       *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcni( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            short *array,    /* I - array of values to write                */
            short  nulvalue, /* I - value used to flag undefined pixels     */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels equal to the value of nulvalue will be replaced by the appropriate
  null value in the output FITS file. 

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode, overflow = 0;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    /* if variable length array, first write the whole input vector, 
       then go back and fill in the nulls */
    if (tcode < 0) {
      if (ffpcli(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0) {
        if (*status == NUM_OVERFLOW) 
	{
	  /* ignore overflows, which are possibly the null pixel values */
	  /*  overflow = 1;   */
	  *status = 0;
	} else { 
          return(*status);
	}
      }
    }

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (ffpclu(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood +1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (tcode > 0) {  /* variable length arrays have already been written */
              if (ffpcli(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0) {
		if (*status == NUM_OVERFLOW) 
		{
		  overflow = 1;
		  *status = 0;
		} else { 
                  return(*status);
		}
	      }
	    }
            ngood=0;
         }

         nbad = nbad +1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      if (tcode > 0) {  /* variable length arrays have already been written */
        ffpcli(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
      }
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpclu(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    if (*status <= 0) {
      if (overflow) {
        *status = NUM_OVERFLOW;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi2fi1(short *input,          /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            unsigned char *output, /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < 0)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (input[ii] > UCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (dvalue > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) (dvalue + .5);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi2fi2(short *input,       /* I - array of values to be converted  */
            long ntodo,         /* I - number of elements in the array  */
            double scale,       /* I - FITS TSCALn or BSCALE value      */
            double zero,        /* I - FITS TZEROn or BZERO  value      */
            short *output,      /* O - output array of converted values */
            int *status)        /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        memcpy(output, input, ntodo * sizeof(short) );
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (short) (dvalue + .5);
                else
                    output[ii] = (short) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi2fi4(short *input,      /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            INT32BIT *output,  /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (INT32BIT) input[ii];   /* just copy input to output */
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (INT32BIT) (dvalue + .5);
                else
                    output[ii] = (INT32BIT) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi2fi8(short *input,      /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            LONGLONG *output,  /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero ==  9223372036854775808.)
    {       
        /* Writing to unsigned long long column. Input values must not be negative */
        /* Instead of subtracting 9223372036854775808, it is more efficient */
        /* and more precise to just flip the sign bit with the XOR operator */

        for (ii = 0; ii < ntodo; ii++) {
           if (input[ii] < 0) {
              *status = OVERFLOW_ERR;
              output[ii] = LONGLONG_MIN;
           } else {
              output[ii] =  ((LONGLONG) input[ii]) ^ 0x8000000000000000;
           }
        }
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (dvalue > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (LONGLONG) (dvalue + .5);
                else
                    output[ii] = (LONGLONG) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi2fr4(short *input,      /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            float *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (float) ((input[ii] - zero) / scale);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi2fr8(short *input,      /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            double *output,    /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (input[ii] - zero) / scale;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi2fstr(short *input,     /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            char *cform,       /* I - format for output string values  */
            long twidth,       /* I - width of each field, in chars    */
            char *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do scaling if required.
*/
{
    long ii;
    double dvalue;
    char *cptr;
    
    cptr = output;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
           sprintf(output, cform, (double) input[ii]);
           output += twidth;

           if (*output)  /* if this char != \0, then overflow occurred */
              *status = OVERFLOW_ERR;
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
          dvalue = (input[ii] - zero) / scale;
          sprintf(output, cform, dvalue);
          output += twidth;

          if (*output)  /* if this char != \0, then overflow occurred */
            *status = OVERFLOW_ERR;
        }
    }

    /* replace any commas with periods (e.g., in French locale) */
    while ((cptr = strchr(cptr, ','))) *cptr = '.';

    return(*status);
}
cfitsio-3.47/putcolj.c0000644000225700000360000021340513464573432014241 0ustar  cagordonlhea/*  This file, putcolj.c, contains routines that write data elements to    */
/*  a FITS image or table, with long datatype.                             */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffpprj( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            long  *array,    /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;
    long nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_pixels(fptr, TLONG, firstelem, nelem,
            0, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpclj(fptr, 2, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppnj( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            long  *array,    /* I - array of values that are written        */
            long  nulval,    /* I - undefined pixel value                   */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).  Any array values
  that are equal to the value of nulval will be replaced with the null
  pixel value that is appropriate for this column.
*/
{
    long row;
    long nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        nullvalue = nulval;  /* set local variable */
        fits_write_compressed_pixels(fptr, TLONG, firstelem, nelem,
            1, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcnj(fptr, 2, row, firstelem, nelem, array, nulval, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp2dj(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           long  *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{

    /* call the 3D writing routine, with the 3rd dimension = 1 */

    ffp3dj(fptr, group, ncols, naxis2, naxis1, naxis2, 1, array, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp3dj(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  nrows,      /* I - number of rows in each plane of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  naxis3,     /* I - FITS image NAXIS3 value               */
           long  *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 3-D cube of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    long tablerow, ii, jj;
    long fpixel[3]= {1,1,1}, lpixel[3];
    LONGLONG nfits, narray;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
           
    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
        lpixel[0] = (long) ncols;
        lpixel[1] = (long) nrows;
        lpixel[2] = (long) naxis3;
       
        fits_write_compressed_img(fptr, TLONG, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
      /* all the image pixels are contiguous, so write all at once */
      ffpclj(fptr, 2, tablerow, 1L, naxis1 * naxis2 * naxis3, array, status);
      return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to write to */
    narray = 0;  /* next pixel in input array to be written */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* writing naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffpclj(fptr, 2, tablerow, nfits, naxis1,&array[narray],status) > 0)
         return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpssj(fitsfile *fptr,   /* I - FITS file pointer                       */
           long  group,      /* I - group to write(1 = 1st group)           */
           long  naxis,      /* I - number of data axes in array            */
           long  *naxes,     /* I - size of each FITS axis                  */
           long  *fpixel,    /* I - 1st pixel in each axis to write (1=1st) */
           long  *lpixel,    /* I - last pixel in each axis to write        */
           long *array,      /* I - array to be written                     */
           int  *status)     /* IO - error status                           */
/*
  Write a subsection of pixels to the primary array or image.
  A subsection is defined to be any contiguous rectangular
  array of pixels within the n-dimensional FITS data file.
  Data conversion and scaling will be performed if necessary 
  (e.g, if the datatype of the FITS array is not the same as
  the array being written).
*/
{
    long tablerow;
    LONGLONG fpix[7], dimen[7], astart, pstart;
    LONGLONG off2, off3, off4, off5, off6, off7;
    LONGLONG st10, st20, st30, st40, st50, st60, st70;
    LONGLONG st1, st2, st3, st4, st5, st6, st7;
    long ii, i1, i2, i3, i4, i5, i6, i7, irange[7];

    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_img(fptr, TLONG, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    if (naxis < 1 || naxis > 7)
      return(*status = BAD_DIMEN);

    tablerow=maxvalue(1,group);

     /* calculate the size and number of loops to perform in each dimension */
    for (ii = 0; ii < 7; ii++)
    {
      fpix[ii]=1;
      irange[ii]=1;
      dimen[ii]=1;
    }

    for (ii = 0; ii < naxis; ii++)
    {    
      fpix[ii]=fpixel[ii];
      irange[ii]=lpixel[ii]-fpixel[ii]+1;
      dimen[ii]=naxes[ii];
    }

    i1=irange[0];

    /* compute the pixel offset between each dimension */
    off2 =     dimen[0];
    off3 = off2 * dimen[1];
    off4 = off3 * dimen[2];
    off5 = off4 * dimen[3];
    off6 = off5 * dimen[4];
    off7 = off6 * dimen[5];

    st10 = fpix[0];
    st20 = (fpix[1] - 1) * off2;
    st30 = (fpix[2] - 1) * off3;
    st40 = (fpix[3] - 1) * off4;
    st50 = (fpix[4] - 1) * off5;
    st60 = (fpix[5] - 1) * off6;
    st70 = (fpix[6] - 1) * off7;

    /* store the initial offset in each dimension */
    st1 = st10;
    st2 = st20;
    st3 = st30;
    st4 = st40;
    st5 = st50;
    st6 = st60;
    st7 = st70;

    astart = 0;

    for (i7 = 0; i7 < irange[6]; i7++)
    {
     for (i6 = 0; i6 < irange[5]; i6++)
     {
      for (i5 = 0; i5 < irange[4]; i5++)
      {
       for (i4 = 0; i4 < irange[3]; i4++)
       {
        for (i3 = 0; i3 < irange[2]; i3++)
        {
         pstart = st1 + st2 + st3 + st4 + st5 + st6 + st7;

         for (i2 = 0; i2 < irange[1]; i2++)
         {
           if (ffpclj(fptr, 2, tablerow, pstart, i1, &array[astart],
              status) > 0)
              return(*status);

           astart += i1;
           pstart += off2;
         }
         st2 = st20;
         st3 = st3+off3;    
        }
        st3 = st30;
        st4 = st4+off4;
       }
       st4 = st40;
       st5 = st5+off5;
      }
      st5 = st50;
      st6 = st6+off6;
     }
     st6 = st60;
     st7 = st7+off7;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpgpj( fitsfile *fptr,   /* I - FITS file pointer                      */
            long  group,      /* I - group to write(1 = 1st group)          */
            long  firstelem,  /* I - first vector element to write(1 = 1st) */
            long  nelem,      /* I - number of values to write              */
            long  *array,     /* I - array of values that are written       */
            int  *status)     /* IO - error status                          */
/*
  Write an array of group parameters to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffpclj(fptr, 1L, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpclj( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            long  *array,    /* I - array of values to write                */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    int tcode, maxelem2, hdutype, writeraw;
    long twidth, incre;
    long ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull, maxelem;
    double scale, zero;
    char tform[20], cform[20];
    char message[FLEN_ERRMSG];

    char snull[20];   /*  the FITS null value  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem2, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);
    maxelem = maxelem2;

    if (tcode == TSTRING)   
         ffcfmt(tform, cform);     /* derive C format for writing strings */

    /*
       if there is no scaling and the native machine format is not byteswapped
       then we can simply write the raw data bytes into the FITS file if the
       datatype of the FITS column is the same as the input values.  Otherwise
       we must convert the raw values into the scaled and/or machine dependent
       format in a temporary buffer that has been allocated for this purpose.
    */
    if (scale == 1. && zero == 0. && 
       MACHINE == NATIVE && tcode == TLONG && LONGSIZE == 32)
    {
        writeraw = 1;
        if (nelem < (LONGLONG)INT32_MAX) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/8;
        }
    }
    else
        writeraw = 0;

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*  First call the ffXXfYY routine to  (1) convert the datatype        */
    /*  if necessary, and (2) scale the values by the FITS TSCALn and      */
    /*  TZEROn linear scaling parameters into a temporary buffer.          */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
        /* limit the number of pixels to process a one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, (repeat - elemnum));

        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);

        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TLONG):
              if (writeraw)
              {
                /* write raw input bytes without conversion */
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) &array[next], status);
              }
              else
              {
                /* convert the raw data before writing to FITS file */
                ffi4fi4(&array[next], ntodo, scale, zero,
                        (INT32BIT *) buffer, status);
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) buffer, status);
              }

              break;

            case (TLONGLONG):

                ffi4fi8(&array[next], ntodo, scale, zero,
                        (LONGLONG *) buffer, status);
                ffpi8b(fptr, ntodo, incre, (long *) buffer, status);
                break;

            case (TBYTE):
 
                ffi4fi1(&array[next], ntodo, scale, zero,
                        (unsigned char *) buffer, status);
                ffpi1b(fptr, ntodo, incre, (unsigned char *) buffer, status);
                break;

            case (TSHORT):

                ffi4fi2(&array[next], ntodo, scale, zero,
                        (short *) buffer, status);
                ffpi2b(fptr, ntodo, incre, (short *) buffer, status);
                break;

            case (TFLOAT):

                ffi4fr4(&array[next], ntodo, scale, zero,
                        (float *) buffer, status);
                ffpr4b(fptr, ntodo, incre, (float *) buffer, status);
                break;

            case (TDOUBLE):
                ffi4fr8(&array[next], ntodo, scale, zero,
                       (double *) buffer, status);
                ffpr8b(fptr, ntodo, incre, (double *) buffer, status);
                break;

            case (TSTRING):  /* numerical column in an ASCII table */

                if (cform[1] != 's')  /*  "%s" format is a string */
                {
                  ffi4fstr(&array[next], ntodo, scale, zero, cform,
                          twidth, (char *) buffer, status);

                  if (incre == twidth)    /* contiguous bytes */
                     ffpbyt(fptr, ntodo * twidth, buffer, status);
                  else
                     ffpbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                            status);

                  break;
                }
                /* can't write to string column, so fall thru to default: */

            default:  /*  error trap  */
                snprintf(message, FLEN_ERRMSG,
                     "Cannot write numbers to column %d which has format %s",
                      colnum,tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
          snprintf(message,FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpclj).",
              (double) (next+1), (double) (next+ntodo));
          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while writing FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcnj( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            long  *array,    /* I - array of values to write                */
            long   nulvalue, /* I - value used to flag undefined pixels     */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels equal to the value of nulvalue will be replaced by the appropriate
  null value in the output FITS file. 

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode, overflow = 0;
 
    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    /* if variable length array, first write the whole input vector, 
       then go back and fill in the nulls */
    if (tcode < 0) {
      if (ffpclj(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0) {
        if (*status == NUM_OVERFLOW) 
	{
	  /* ignore overflows, which are possibly the null pixel values */
	  /*  overflow = 1;   */
	  *status = 0;
	} else { 
          return(*status);
	}
      }
    }

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */
	  
            if (ffpclu(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood + 1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (tcode > 0) {  /* variable length arrays have already been written */
              if (ffpclj(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0) {
		if (*status == NUM_OVERFLOW) 
		{
		  overflow = 1;
		  *status = 0;
		} else { 
                  return(*status);
		}
	      }
	    }
            ngood=0;
         }

         nbad = nbad +1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      if (tcode > 0) {  /* variable length arrays have already been written */
        ffpclj(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
      }
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpclu(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    if (*status <= 0) {
      if (overflow) {
        *status = NUM_OVERFLOW;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi4fi1(long *input,           /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            unsigned char *output, /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < 0)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (input[ii] > UCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (dvalue > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) (dvalue + .5);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi4fi2(long *input,       /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            short *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < SHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (input[ii] > SHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
                output[ii] = (short) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (short) (dvalue + .5);
                else
                    output[ii] = (short) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi4fi4(long *input,       /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            INT32BIT *output,  /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (INT32BIT) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (INT32BIT) (dvalue + .5);
                else
                    output[ii] = (INT32BIT) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi4fi8(long *input,       /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            LONGLONG *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero ==  9223372036854775808.)
    {       
        /* Writing to unsigned long long column. Input values must not be negative */
        /* Instead of subtracting 9223372036854775808, it is more efficient */
        /* and more precise to just flip the sign bit with the XOR operator */

        for (ii = 0; ii < ntodo; ii++) {
           if (input[ii] < 0) {
              *status = OVERFLOW_ERR;
              output[ii] = LONGLONG_MIN;
           } else {
              output[ii] =  ((LONGLONG) input[ii]) ^ 0x8000000000000000;
           }
        }
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (dvalue > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (LONGLONG) (dvalue + .5);
                else
                    output[ii] = (LONGLONG) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi4fr4(long *input,       /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            float *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (float) ((input[ii] - zero) / scale);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi4fr8(long *input,       /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            double *output,    /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (input[ii] - zero) / scale;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi4fstr(long *input,      /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            char *cform,       /* I - format for output string values  */
            long twidth,       /* I - width of each field, in chars    */
            char *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do scaling if required.
*/
{
    long ii;
    double dvalue;
    char *cptr;

    cptr = output;
    
    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
           sprintf(output, cform, (double) input[ii]);
           output += twidth;

           if (*output)  /* if this char != \0, then overflow occurred */
              *status = OVERFLOW_ERR;
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
          dvalue = (input[ii] - zero) / scale;
          sprintf(output, cform, dvalue);
          output += twidth;

          if (*output)  /* if this char != \0, then overflow occurred */
            *status = OVERFLOW_ERR;
        }
    }

    /* replace any commas with periods (e.g., in French locale) */
    while ((cptr = strchr(cptr, ','))) *cptr = '.';

    return(*status);
}

/* ======================================================================== */
/*      the following routines support the 'long long' data type            */
/* ======================================================================== */

/*--------------------------------------------------------------------------*/
int ffpprjj(fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            LONGLONG  *array, /* I - array of values that are written       */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        ffpmsg("writing TLONGLONG to compressed image is not supported");

        return(*status = DATA_COMPRESSION_ERR);
    }

    row=maxvalue(1,group);

    ffpcljj(fptr, 2, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppnjj(fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            LONGLONG  *array, /* I - array of values that are written       */
            LONGLONG  nulval,    /* I - undefined pixel value                   */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).  Any array values
  that are equal to the value of nulval will be replaced with the null
  pixel value that is appropriate for this column.
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        ffpmsg("writing TLONGLONG to compressed image is not supported");

        return(*status = DATA_COMPRESSION_ERR);
    }

    row=maxvalue(1,group);

    ffpcnjj(fptr, 2, row, firstelem, nelem, array, nulval, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp2djj(fitsfile *fptr,  /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  *array, /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{

    /* call the 3D writing routine, with the 3rd dimension = 1 */

    ffp3djj(fptr, group, ncols, naxis2, naxis1, naxis2, 1, array, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp3djj(fitsfile *fptr,  /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  nrows,      /* I - number of rows in each plane of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  naxis3,     /* I - FITS image NAXIS3 value               */
           LONGLONG  *array, /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 3-D cube of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    long tablerow, ii, jj;
    LONGLONG nfits, narray;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        ffpmsg("writing TLONGLONG to compressed image is not supported");

        return(*status = DATA_COMPRESSION_ERR);
    }

    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
      /* all the image pixels are contiguous, so write all at once */
      ffpcljj(fptr, 2, tablerow, 1L, naxis1 * naxis2 * naxis3, array, status);
      return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to write to */
    narray = 0;  /* next pixel in input array to be written */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* writing naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffpcljj(fptr, 2, tablerow, nfits, naxis1,&array[narray],status) > 0)
         return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpssjj(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,      /* I - group to write(1 = 1st group)           */
           long  naxis,      /* I - number of data axes in array            */
           long  *naxes,     /* I - size of each FITS axis                  */
           long  *fpixel,    /* I - 1st pixel in each axis to write (1=1st) */
           long  *lpixel,    /* I - last pixel in each axis to write        */
           LONGLONG *array,  /* I - array to be written                     */
           int  *status)     /* IO - error status                           */
/*
  Write a subsection of pixels to the primary array or image.
  A subsection is defined to be any contiguous rectangular
  array of pixels within the n-dimensional FITS data file.
  Data conversion and scaling will be performed if necessary 
  (e.g, if the datatype of the FITS array is not the same as
  the array being written).
*/
{
    long tablerow;
    LONGLONG fpix[7], dimen[7], astart, pstart;
    LONGLONG off2, off3, off4, off5, off6, off7;
    LONGLONG st10, st20, st30, st40, st50, st60, st70;
    LONGLONG st1, st2, st3, st4, st5, st6, st7;
    long ii, i1, i2, i3, i4, i5, i6, i7, irange[7];

    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        ffpmsg("writing TLONGLONG to compressed image is not supported");

        return(*status = DATA_COMPRESSION_ERR);
    }

    if (naxis < 1 || naxis > 7)
      return(*status = BAD_DIMEN);

    tablerow=maxvalue(1,group);

     /* calculate the size and number of loops to perform in each dimension */
    for (ii = 0; ii < 7; ii++)
    {
      fpix[ii]=1;
      irange[ii]=1;
      dimen[ii]=1;
    }

    for (ii = 0; ii < naxis; ii++)
    {    
      fpix[ii]=fpixel[ii];
      irange[ii]=lpixel[ii]-fpixel[ii]+1;
      dimen[ii]=naxes[ii];
    }

    i1=irange[0];

    /* compute the pixel offset between each dimension */
    off2 =     dimen[0];
    off3 = off2 * dimen[1];
    off4 = off3 * dimen[2];
    off5 = off4 * dimen[3];
    off6 = off5 * dimen[4];
    off7 = off6 * dimen[5];

    st10 = fpix[0];
    st20 = (fpix[1] - 1) * off2;
    st30 = (fpix[2] - 1) * off3;
    st40 = (fpix[3] - 1) * off4;
    st50 = (fpix[4] - 1) * off5;
    st60 = (fpix[5] - 1) * off6;
    st70 = (fpix[6] - 1) * off7;

    /* store the initial offset in each dimension */
    st1 = st10;
    st2 = st20;
    st3 = st30;
    st4 = st40;
    st5 = st50;
    st6 = st60;
    st7 = st70;

    astart = 0;

    for (i7 = 0; i7 < irange[6]; i7++)
    {
     for (i6 = 0; i6 < irange[5]; i6++)
     {
      for (i5 = 0; i5 < irange[4]; i5++)
      {
       for (i4 = 0; i4 < irange[3]; i4++)
       {
        for (i3 = 0; i3 < irange[2]; i3++)
        {
         pstart = st1 + st2 + st3 + st4 + st5 + st6 + st7;

         for (i2 = 0; i2 < irange[1]; i2++)
         {
           if (ffpcljj(fptr, 2, tablerow, pstart, i1, &array[astart],
              status) > 0)
              return(*status);

           astart += i1;
           pstart += off2;
         }
         st2 = st20;
         st3 = st3+off3;    
        }
        st3 = st30;
        st4 = st4+off4;
       }
       st4 = st40;
       st5 = st5+off5;
      }
      st5 = st50;
      st6 = st6+off6;
     }
     st6 = st60;
     st7 = st7+off7;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpgpjj(fitsfile *fptr,   /* I - FITS file pointer                      */
            long  group,      /* I - group to write(1 = 1st group)          */
            long  firstelem,  /* I - first vector element to write(1 = 1st) */
            long  nelem,      /* I - number of values to write              */
            LONGLONG  *array, /* I - array of values that are written       */
            int  *status)     /* IO - error status                          */
/*
  Write an array of group parameters to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffpcljj(fptr, 1L, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcljj(fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            LONGLONG  *array, /* I - array of values to write               */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    int tcode, maxelem2, hdutype, writeraw;
    long twidth, incre;
    long  ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull, maxelem;
    double scale, zero;
    char tform[20], cform[20];
    char message[FLEN_ERRMSG];

    char snull[20];   /*  the FITS null value  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem2, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);
    maxelem = maxelem2;

    if (tcode == TSTRING)   
         ffcfmt(tform, cform);     /* derive C format for writing strings */

    /*
       if there is no scaling and the native machine format is not byteswapped
       then we can simply write the raw data bytes into the FITS file if the
       datatype of the FITS column is the same as the input values.  Otherwise
       we must convert the raw values into the scaled and/or machine dependent
       format in a temporary buffer that has been allocated for this purpose.
    */
    if (scale == 1. && zero == 0. && 
       MACHINE == NATIVE && tcode == TLONGLONG)
    {
        writeraw = 1;
        if (nelem < (LONGLONG)INT32_MAX/8) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/8;
        }
    }
    else
        writeraw = 0;

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*  First call the ffXXfYY routine to  (1) convert the datatype        */
    /*  if necessary, and (2) scale the values by the FITS TSCALn and      */
    /*  TZEROn linear scaling parameters into a temporary buffer.          */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
        /* limit the number of pixels to process a one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, (repeat - elemnum));

        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);

        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TLONGLONG):
              if (writeraw)
              {
                /* write raw input bytes without conversion */
                ffpi8b(fptr, ntodo, incre, (long *) &array[next], status);
              }
              else
              {
                /* convert the raw data before writing to FITS file */
                ffi8fi8(&array[next], ntodo, scale, zero,
                        (LONGLONG *) buffer, status);
                ffpi8b(fptr, ntodo, incre, (long *) buffer, status);
              }

              break;

            case (TLONG):

                ffi8fi4(&array[next], ntodo, scale, zero,
                        (INT32BIT *) buffer, status);
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) buffer, status);
                break;

            case (TBYTE):
 
                ffi8fi1(&array[next], ntodo, scale, zero,
                        (unsigned char *) buffer, status);
                ffpi1b(fptr, ntodo, incre, (unsigned char *) buffer, status);
                break;

            case (TSHORT):

                ffi8fi2(&array[next], ntodo, scale, zero,
                        (short *) buffer, status);
                ffpi2b(fptr, ntodo, incre, (short *) buffer, status);
                break;

            case (TFLOAT):

                ffi8fr4(&array[next], ntodo, scale, zero,
                        (float *) buffer, status);
                ffpr4b(fptr, ntodo, incre, (float *) buffer, status);
                break;

            case (TDOUBLE):
                ffi8fr8(&array[next], ntodo, scale, zero,
                       (double *) buffer, status);
                ffpr8b(fptr, ntodo, incre, (double *) buffer, status);
                break;

            case (TSTRING):  /* numerical column in an ASCII table */

                if (cform[1] != 's')  /*  "%s" format is a string */
                {
                  ffi8fstr(&array[next], ntodo, scale, zero, cform,
                          twidth, (char *) buffer, status);

                  if (incre == twidth)    /* contiguous bytes */
                     ffpbyt(fptr, ntodo * twidth, buffer, status);
                  else
                     ffpbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                            status);

                  break;
                }
                /* can't write to string column, so fall thru to default: */

            default:  /*  error trap  */
                snprintf(message, FLEN_ERRMSG,
                     "Cannot write numbers to column %d which has format %s",
                      colnum,tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
          snprintf(message,FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpclj).",
              (double) (next+1), (double) (next+ntodo));
          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while writing FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcnjj(fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            LONGLONG *array,     /* I - array of values to write                */
            LONGLONG nulvalue,   /* I - value used to flag undefined pixels   */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels equal to the value of nulvalue will be replaced by the appropriate
  null value in the output FITS file. 

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode, overflow = 0;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    /* if variable length array, first write the whole input vector, 
       then go back and fill in the nulls */
    if (tcode < 0) {
      if (ffpcljj(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0) {
        if (*status == NUM_OVERFLOW) 
	{
	  /* ignore overflows, which are possibly the null pixel values */
	  /*  overflow = 1;   */
	  *status = 0;
	} else { 
          return(*status);
	}
      }
    }

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (ffpclu(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood +1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (tcode > 0) {  /* variable length arrays have already been written */
              if (ffpcljj(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0) {
		if (*status == NUM_OVERFLOW) 
		{
		  overflow = 1;
		  *status = 0;
		} else { 
                  return(*status);
		}
	      }
	    }
            ngood=0;
         }

         nbad = nbad +1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      if (tcode > 0) {  /* variable length arrays have already been written */
        ffpcljj(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
      }
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpclu(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    if (*status <= 0) {
      if (overflow) {
        *status = NUM_OVERFLOW;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi8fi1(LONGLONG *input,       /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            unsigned char *output, /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < 0)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (input[ii] > UCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (dvalue > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) (dvalue + .5);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi8fi2(LONGLONG *input,   /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            short *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < SHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (input[ii] > SHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
                output[ii] = (short) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (short) (dvalue + .5);
                else
                    output[ii] = (short) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi8fi4(LONGLONG *input,   /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            INT32BIT *output,  /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < INT32_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (input[ii] > INT32_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
                output[ii] = (INT32BIT) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (INT32BIT) (dvalue + .5);
                else
                    output[ii] = (INT32BIT) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi8fi8(LONGLONG *input,   /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            LONGLONG *output,  /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero ==  9223372036854775808.)
    {       
        /* Writing to unsigned long long column. Input values must not be negative */
        /* Instead of subtracting 9223372036854775808, it is more efficient */
        /* and more precise to just flip the sign bit with the XOR operator */

        for (ii = 0; ii < ntodo; ii++) {
           if (input[ii] < 0) {
              *status = OVERFLOW_ERR;
              output[ii] = LONGLONG_MIN;
           } else {
              output[ii] =  (input[ii]) ^ 0x8000000000000000;
           }
        }
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (dvalue > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (LONGLONG) (dvalue + .5);
                else
                    output[ii] = (LONGLONG) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi8fr4(LONGLONG *input,   /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            float *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (float) ((input[ii] - zero) / scale);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi8fr8(LONGLONG *input,       /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            double *output,    /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (input[ii] - zero) / scale;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi8fstr(LONGLONG *input,  /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            char *cform,       /* I - format for output string values  */
            long twidth,       /* I - width of each field, in chars    */
            char *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do scaling if required.
*/
{
    long ii;
    double dvalue;
    char *cptr;
    
    cptr = output;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
           sprintf(output, cform, (double) input[ii]);
           output += twidth;

           if (*output)  /* if this char != \0, then overflow occurred */
              *status = OVERFLOW_ERR;
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
          dvalue = (input[ii] - zero) / scale;
          sprintf(output, cform, dvalue);
          output += twidth;

          if (*output)  /* if this char != \0, then overflow occurred */
            *status = OVERFLOW_ERR;
        }
    }

    /* replace any commas with periods (e.g., in French locale) */
    while ((cptr = strchr(cptr, ','))) *cptr = '.';
    
    return(*status);
}
cfitsio-3.47/putcolk.c0000644000225700000360000010704613464573432014245 0ustar  cagordonlhea/*  This file, putcolk.c, contains routines that write data elements to    */
/*  a FITS image or table, with 'int' datatype.                            */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffpprk( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            int   *array,    /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;
    int nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_pixels(fptr, TINT, firstelem, nelem,
            0, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpclk(fptr, 2, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppnk( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            int   *array,    /* I - array of values that are written        */
            int   nulval,    /* I - undefined pixel value                   */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).  Any array values
  that are equal to the value of nulval will be replaced with the null
  pixel value that is appropriate for this column.
*/
{
    long row;
    int nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        nullvalue = nulval;  /* set local variable */
        fits_write_compressed_pixels(fptr, TINT, firstelem, nelem,
            1, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcnk(fptr, 2, row, firstelem, nelem, array, nulval, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp2dk(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           int   *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    /* call the 3D writing routine, with the 3rd dimension = 1 */

    ffp3dk(fptr, group, ncols, naxis2, naxis1, naxis2, 1, array, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp3dk(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  nrows,      /* I - number of rows in each plane of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  naxis3,     /* I - FITS image NAXIS3 value               */
           int   *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 3-D cube of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    long tablerow, ii, jj;
    long fpixel[3]= {1,1,1}, lpixel[3];
    LONGLONG nfits, narray;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
           
    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
        lpixel[0] = (long) ncols;
        lpixel[1] = (long) nrows;
        lpixel[2] = (long) naxis3;
       
        fits_write_compressed_img(fptr, TINT, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
      /* all the image pixels are contiguous, so write all at once */
      ffpclk(fptr, 2, tablerow, 1L, naxis1 * naxis2 * naxis3, array, status);
      return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to write to */
    narray = 0;  /* next pixel in input array to be written */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* writing naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffpclk(fptr, 2, tablerow, nfits, naxis1,&array[narray],status) > 0)
         return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpssk(fitsfile *fptr,   /* I - FITS file pointer                       */
           long  group,      /* I - group to write(1 = 1st group)           */
           long  naxis,      /* I - number of data axes in array            */
           long  *naxes,     /* I - size of each FITS axis                  */
           long  *fpixel,    /* I - 1st pixel in each axis to write (1=1st) */
           long  *lpixel,    /* I - last pixel in each axis to write        */
           int *array,      /* I - array to be written                     */
           int  *status)     /* IO - error status                           */
/*
  Write a subsection of pixels to the primary array or image.
  A subsection is defined to be any contiguous rectangular
  array of pixels within the n-dimensional FITS data file.
  Data conversion and scaling will be performed if necessary 
  (e.g, if the datatype of the FITS array is not the same as
  the array being written).
*/
{
    long tablerow;
    LONGLONG fpix[7], dimen[7], astart, pstart;
    LONGLONG off2, off3, off4, off5, off6, off7;
    LONGLONG st10, st20, st30, st40, st50, st60, st70;
    LONGLONG st1, st2, st3, st4, st5, st6, st7;
    long ii, i1, i2, i3, i4, i5, i6, i7, irange[7];

    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_img(fptr, TINT, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    if (naxis < 1 || naxis > 7)
      return(*status = BAD_DIMEN);

    tablerow=maxvalue(1,group);

     /* calculate the size and number of loops to perform in each dimension */
    for (ii = 0; ii < 7; ii++)
    {
      fpix[ii]=1;
      irange[ii]=1;
      dimen[ii]=1;
    }

    for (ii = 0; ii < naxis; ii++)
    {    
      fpix[ii]=fpixel[ii];
      irange[ii]=lpixel[ii]-fpixel[ii]+1;
      dimen[ii]=naxes[ii];
    }

    i1=irange[0];

    /* compute the pixel offset between each dimension */
    off2 =     dimen[0];
    off3 = off2 * dimen[1];
    off4 = off3 * dimen[2];
    off5 = off4 * dimen[3];
    off6 = off5 * dimen[4];
    off7 = off6 * dimen[5];

    st10 = fpix[0];
    st20 = (fpix[1] - 1) * off2;
    st30 = (fpix[2] - 1) * off3;
    st40 = (fpix[3] - 1) * off4;
    st50 = (fpix[4] - 1) * off5;
    st60 = (fpix[5] - 1) * off6;
    st70 = (fpix[6] - 1) * off7;

    /* store the initial offset in each dimension */
    st1 = st10;
    st2 = st20;
    st3 = st30;
    st4 = st40;
    st5 = st50;
    st6 = st60;
    st7 = st70;

    astart = 0;

    for (i7 = 0; i7 < irange[6]; i7++)
    {
     for (i6 = 0; i6 < irange[5]; i6++)
     {
      for (i5 = 0; i5 < irange[4]; i5++)
      {
       for (i4 = 0; i4 < irange[3]; i4++)
       {
        for (i3 = 0; i3 < irange[2]; i3++)
        {
         pstart = st1 + st2 + st3 + st4 + st5 + st6 + st7;

         for (i2 = 0; i2 < irange[1]; i2++)
         {
           if (ffpclk(fptr, 2, tablerow, pstart, i1, &array[astart],
              status) > 0)
              return(*status);

           astart += i1;
           pstart += off2;
         }
         st2 = st20;
         st3 = st3+off3;    
        }
        st3 = st30;
        st4 = st4+off4;
       }
       st4 = st40;
       st5 = st5+off5;
      }
      st5 = st50;
      st6 = st6+off6;
     }
     st6 = st60;
     st7 = st7+off7;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpgpk( fitsfile *fptr,   /* I - FITS file pointer                      */
            long  group,      /* I - group to write(1 = 1st group)          */
            long  firstelem,  /* I - first vector element to write(1 = 1st) */
            long  nelem,      /* I - number of values to write              */
            int   *array,     /* I - array of values that are written       */
            int  *status)     /* IO - error status                          */
/*
  Write an array of group parameters to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffpclk(fptr, 1L, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpclk( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            int   *array,    /* I - array of values to write                */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    int tcode, maxelem2, hdutype, writeraw;
    long twidth, incre;
    long ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull, maxelem;
    double scale, zero;
    char tform[20], cform[20];
    char message[FLEN_ERRMSG];

    char snull[20];   /*  the FITS null value  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* call the 'short' or 'long' version of this routine, if possible */
    if (sizeof(int) == sizeof(short))
        ffpcli(fptr, colnum, firstrow, firstelem, nelem, 
              (short *) array, status);
    else if (sizeof(int) == sizeof(long))
        ffpclj(fptr, colnum, firstrow, firstelem, nelem, 
              (long *) array, status);
    else
    {
    /*
      This is a special case: sizeof(int) is not equal to sizeof(short) or
      sizeof(long).  This occurs on Alpha OSF systems where short = 2 bytes,
      int = 4 bytes, and long = 8 bytes.
    */

    buffer = cbuff;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem2, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);
    maxelem = maxelem2;

    if (tcode == TSTRING)   
         ffcfmt(tform, cform);     /* derive C format for writing strings */

    /*
       if there is no scaling and the native machine format is not byteswapped
       then we can simply write the raw data bytes into the FITS file if the
       datatype of the FITS column is the same as the input values.  Otherwise
       we must convert the raw values into the scaled and/or machine dependent
       format in a temporary buffer that has been allocated for this purpose.
    */
    if (scale == 1. && zero == 0. && 
       MACHINE == NATIVE && tcode == TLONG)
    {
        writeraw = 1;
        if (nelem < (LONGLONG)INT32_MAX) {
            maxelem = nelem;
        } else {
            maxelem = INT32_MAX/4;
        }
    }
    else
        writeraw = 0;

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*  First call the ffXXfYY routine to  (1) convert the datatype        */
    /*  if necessary, and (2) scale the values by the FITS TSCALn and      */
    /*  TZEROn linear scaling parameters into a temporary buffer.          */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
        /* limit the number of pixels to process a one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, (repeat - elemnum));

        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);

        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TLONG):
              if (writeraw)
              {
                /* write raw input bytes without conversion */
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) &array[next], status);
              }
              else
              {
                /* convert the raw data before writing to FITS file */
                ffintfi4(&array[next], ntodo, scale, zero,
                        (INT32BIT *) buffer, status);
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) buffer, status);
              }

                break;

            case (TLONGLONG):

                ffintfi8(&array[next], ntodo, scale, zero,
                        (LONGLONG *) buffer, status);
                ffpi8b(fptr, ntodo, incre, (long *) buffer, status);
                break;

            case (TBYTE):
 
                ffintfi1(&array[next], ntodo, scale, zero,
                        (unsigned char *) buffer, status);
                ffpi1b(fptr, ntodo, incre, (unsigned char *) buffer, status);
                break;

            case (TSHORT):

                ffintfi2(&array[next], ntodo, scale, zero,
                        (short *) buffer, status);
                ffpi2b(fptr, ntodo, incre, (short *) buffer, status);
                break;

            case (TFLOAT):

                ffintfr4(&array[next], ntodo, scale, zero,
                        (float *) buffer, status);
                ffpr4b(fptr, ntodo, incre, (float *) buffer, status);
                break;

            case (TDOUBLE):
                ffintfr8(&array[next], ntodo, scale, zero,
                       (double *) buffer, status);
                ffpr8b(fptr, ntodo, incre, (double *) buffer, status);
                break;

            case (TSTRING):  /* numerical column in an ASCII table */

                if (cform[1] != 's')  /*  "%s" format is a string */
                {
                  ffintfstr(&array[next], ntodo, scale, zero, cform,
                          twidth, (char *) buffer, status);

                  if (incre == twidth)    /* contiguous bytes */
                     ffpbyt(fptr, ntodo * twidth, buffer, status);
                  else
                     ffpbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                            status);

                  break;
                }
                /* can't write to string column, so fall thru to default: */

            default:  /*  error trap  */
                snprintf(message, FLEN_ERRMSG,
                     "Cannot write numbers to column %d which has format %s",
                      colnum,tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
          snprintf(message,FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpclk).",
              (double) (next+1), (double) (next+ntodo));
          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while writing FITS data.");
        *status = NUM_OVERFLOW;
    }

    }   /* end of Dec ALPHA special case */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcnk( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            int   *array,    /* I - array of values to write                */
            int    nulvalue, /* I - value used to flag undefined pixels     */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels equal to the value of nulvalue will be replaced by the appropriate
  null value in the output FITS file. 

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode, overflow = 0;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    /* if variable length array, first write the whole input vector, 
       then go back and fill in the nulls */
    if (tcode < 0) {
      if (ffpclk(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0) {
        if (*status == NUM_OVERFLOW) 
	{
	  /* ignore overflows, which are possibly the null pixel values */
	  /*  overflow = 1;   */
	  *status = 0;
	} else { 
          return(*status);
	}
      }
    }

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (ffpclu(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood +1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (tcode > 0) {  /* variable length arrays have already been written */
              if (ffpclk(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0)  {
		if (*status == NUM_OVERFLOW) 
		{
		  overflow = 1;
		  *status = 0;
		} else { 
                  return(*status);
		}
	      }
	    }
            ngood=0;
         }

         nbad = nbad +1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      if (tcode > 0) {  /* variable length arrays have already been written */
        ffpclk(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
      }
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpclu(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    if (*status <= 0) {
      if (overflow) {
        *status = NUM_OVERFLOW;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffintfi1(int *input,           /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            unsigned char *output, /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < 0)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (input[ii] > UCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (dvalue > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) (dvalue + .5);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffintfi2(int *input,       /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            short *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < SHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (input[ii] > SHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
                output[ii] = input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (short) (dvalue + .5);
                else
                    output[ii] = (short) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffintfi4(int *input,       /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            INT32BIT *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)  
    {       
        memcpy(output, input, ntodo * sizeof(int) );
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (INT32BIT) (dvalue + .5);
                else
                    output[ii] = (INT32BIT) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffintfi8(int *input,  /* I - array of values to be converted  */
            long ntodo,             /* I - number of elements in the array  */
            double scale,           /* I - FITS TSCALn or BSCALE value      */
            double zero,            /* I - FITS TZEROn or BZERO  value      */
            LONGLONG *output,       /* O - output array of converted values */
            int *status)            /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero ==  9223372036854775808.)
    {       
        /* Writing to unsigned long long column. Input values must not be negative */
        /* Instead of subtracting 9223372036854775808, it is more efficient */
        /* and more precise to just flip the sign bit with the XOR operator */

        for (ii = 0; ii < ntodo; ii++) {
           if (input[ii] < 0) {
              *status = OVERFLOW_ERR;
              output[ii] = LONGLONG_MIN;
           } else {
              output[ii] =  ((LONGLONG) input[ii]) ^ 0x8000000000000000;
           }
        }
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++) {
                output[ii] = input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (dvalue > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (LONGLONG) (dvalue + .5);
                else
                    output[ii] = (LONGLONG) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffintfr4(int *input,       /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            float *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (float) ((input[ii] - zero) / scale);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffintfr8(int *input,       /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            double *output,    /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (input[ii] - zero) / scale;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffintfstr(int *input,      /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            char *cform,       /* I - format for output string values  */
            long twidth,       /* I - width of each field, in chars    */
            char *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do scaling if required.
*/
{
    long ii;
    double dvalue;
    char *cptr;
    
    cptr = output;


    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
           sprintf(output, cform, (double) input[ii]);
           output += twidth;

           if (*output)  /* if this char != \0, then overflow occurred */
              *status = OVERFLOW_ERR;
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
          dvalue = (input[ii] - zero) / scale;
          sprintf(output, cform, dvalue);
          output += twidth;

          if (*output)  /* if this char != \0, then overflow occurred */
            *status = OVERFLOW_ERR;
        }
    }

    /* replace any commas with periods (e.g., in French locale) */
    while ((cptr = strchr(cptr, ','))) *cptr = '.';
    
    return(*status);
}
cfitsio-3.47/putcoll.c0000644000225700000360000003315513464573432014245 0ustar  cagordonlhea/*  This file, putcoll.c, contains routines that write data elements to    */
/*  a FITS image or table, with logical datatype.                          */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffpcll( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            char *array,     /* I - array of values to write                */
            int  *status)    /* IO - error status                           */
/*
  Write an array of logical values to a column in the current FITS HDU.
*/
{
    int tcode, maxelem, hdutype;
    long twidth, incre;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull;
    double scale, zero;
    char tform[20], ctrue = 'T', cfalse = 'F';
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value  */

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

    if (tcode != TLOGICAL)   
        return(*status = NOT_LOGICAL_COL);

    /*---------------------------------------------------------------------*/
    /*  Now write the logical values one at a time to the FITS column.     */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
      wrtptr = startpos + (rowlen * rownum) + (elemnum * incre);

      ffmbyt(fptr, wrtptr, IGNORE_EOF, status);  /* move to write position */

      if (array[next])
         ffpbyt(fptr, 1, &ctrue, status);
      else
         ffpbyt(fptr, 1, &cfalse, status);

      if (*status > 0)  /* test for error during previous write operation */
      {
        snprintf(message,FLEN_ERRMSG,
           "Error writing element %.0f of input array of logicals (ffpcll).",
            (double) (next+1));
        ffpmsg(message);
        return(*status);
      }

      /*--------------------------------------------*/
      /*  increment the counters for the next loop  */
      /*--------------------------------------------*/
      remain--;
      if (remain)
      {
        next++;
        elemnum++;
        if (elemnum == repeat)  /* completed a row; start on next row */
        {
           elemnum = 0;
           rownum++;
        }
      }

    }  /*  End of main while Loop  */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcnl( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            char  *array,    /* I - array of values to write                */
            char  nulvalue,  /* I - array flagging undefined pixels if true */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels flagged as null will be replaced by the appropriate
  null value in the output FITS file. 
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    /* first write the whole input vector, then go back and fill in the nulls */
    if (ffpcll(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0)
          return(*status);

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (ffpclu(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood +1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

/*  good values have already been written
            if (ffpcll(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0)
                return(*status);
*/
            ngood=0;
         }

         nbad = nbad +1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

/*  these have already been written
      ffpcll(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
*/
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpclu(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpclx( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  frow,      /* I - first row to write (1 = 1st row)        */
            long  fbit,      /* I - first bit to write (1 = 1st)            */
            long  nbit,      /* I - number of bits to write                 */
            char *larray,    /* I - array of logicals corresponding to bits */
            int  *status)    /* IO - error status                           */
/*
  write an array of logical values to a specified bit or byte
  column of the binary table.   If larray is TRUE, then the corresponding
  bit is set to 1, otherwise it is set to 0.
  The binary table column being written to must have datatype 'B' or 'X'. 
*/
{
    LONGLONG offset, bstart, repeat, rowlen, elemnum, rstart, estart, tnull;
    long fbyte, lbyte, nbyte, bitloc, ndone;
    long ii, twidth, incre;
    int tcode, descrp, maxelem, hdutype;
    double dummyd;
    char tform[12], snull[12];
    unsigned char cbuff;
    static unsigned char onbit[8] = {128,  64,  32,  16,   8,   4,   2,   1};
    static unsigned char offbit[8] = {127, 191, 223, 239, 247, 251, 253, 254};
    LONGLONG heapoffset, lrepeat;
    tcolumn *colptr;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /*  check input parameters */
    if (nbit < 1)
        return(*status);
    else if (frow < 1)
        return(*status = BAD_ROW_NUM);
    else if (fbit < 1)
        return(*status = BAD_ELEM_NUM);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    /* rescan header if data structure is undefined */
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
        if ( ffrdef(fptr, status) > 0)               
            return(*status);

    fbyte = (fbit + 7) / 8;
    lbyte = (fbit + nbit + 6) / 8;
    nbyte = lbyte - fbyte +1;

    /* Save the current heapsize; ffgcprll will increment the value if */
    /* we are writing to a variable length column. */
    offset = (fptr->Fptr)->heapsize;

    /* call ffgcprll in case we are writing beyond the current end of   */
    /* the table; it will allocate more space and shift any following */
    /* HDU's.  Otherwise, we have little use for most of the returned */
    /* parameters, therefore just use dummy parameters.               */

    if (ffgcprll( fptr, colnum, frow, fbyte, nbyte, 1, &dummyd, &dummyd,
        tform, &twidth, &tcode, &maxelem, &bstart, &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

    bitloc = fbit - 1 - ((fbit - 1) / 8 * 8);
    ndone = 0;
    rstart = frow - 1;
    estart = fbyte - 1;

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode = colptr->tdatatype;

    if (abs(tcode) > TBYTE)
        return(*status = NOT_LOGICAL_COL); /* not correct datatype column */

    if (tcode > 0)
    {
        descrp = FALSE;  /* not a variable length descriptor column */
        repeat = colptr->trepeat;

        if (tcode == TBIT)
            repeat = (repeat + 7) / 8; /* convert from bits to bytes */

        if (fbyte > repeat)
            return(*status = BAD_ELEM_NUM);

        /* calc the i/o pointer location to start of sequence of pixels */
        bstart = (fptr->Fptr)->datastart + ((fptr->Fptr)->rowlength * rstart) +
               colptr->tbcol + estart;
    }
    else
    {
        descrp = TRUE;  /* a variable length descriptor column */
        /* only bit arrays (tform = 'X') are supported for variable */
        /* length arrays.  REPEAT is the number of BITS in the array. */

        repeat = fbit + nbit -1;

        /* write the number of elements and the starting offset.    */
        /* Note: ffgcprll previous wrote the descripter, but with the */
        /* wrong repeat value  (gave bytes instead of bits).        */
        /* Make sure to not change the current heap offset value!  */

        if (tcode == -TBIT) {
            ffgdesll(fptr, colnum, frow, &lrepeat, &heapoffset, status);
            ffpdes(  fptr, colnum, frow, (long) repeat, heapoffset, status);
	}

        /* Calc the i/o pointer location to start of sequence of pixels.   */
        /* ffgcprll has already calculated a value for bstart that         */
        /* points to the first element of the vector; we just have to      */
        /* increment it to point to the first element we want to write to. */
        /* Note: ffgcprll also already updated the size of the heap, so we */
        /* don't have to do that again here.                               */

        bstart += estart;
    }

    /* move the i/o pointer to the start of the pixel sequence */
    ffmbyt(fptr, bstart, IGNORE_EOF, status);

    /* read the next byte (we may only be modifying some of the bits) */
    while (1)
    {
      if (ffgbyt(fptr, 1, &cbuff, status) == END_OF_FILE)
      {
        /* hit end of file trying to read the byte, so just set byte = 0 */
        *status = 0;
        cbuff = 0;
      }

      /* move back, to be able to overwrite the byte */
      ffmbyt(fptr, bstart, IGNORE_EOF, status);
 
      for (ii = bitloc; (ii < 8) && (ndone < nbit); ii++, ndone++)
      {
        if(larray[ndone])
          cbuff = cbuff | onbit[ii];
        else
          cbuff = cbuff & offbit[ii];
      }

      ffpbyt(fptr, 1, &cbuff, status); /* write the modified byte */
      if (ndone == nbit)  /* finished all the bits */
        return(*status);

      /* not done, so get the next byte */
      bstart++;
      if (!descrp)
      {
        estart++;
        if (estart == repeat)
        {
          /* move the i/o pointer to the next row of pixels */
          estart = 0;
          rstart = rstart + 1;
          bstart = (fptr->Fptr)->datastart + ((fptr->Fptr)->rowlength * rstart) +
               colptr->tbcol;

          ffmbyt(fptr, bstart, IGNORE_EOF, status);
        }
      }
      bitloc = 0;
    }
}

cfitsio-3.47/putcolsb.c0000644000225700000360000010521213464573432014410 0ustar  cagordonlhea/*  This file, putcolsb.c, contains routines that write data elements to   */
/*  a FITS image or table with signed char (signed byte) datatype.         */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffpprsb( fitsfile *fptr,  /* I - FITS file pointer                      */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            signed char *array, /* I - array of values that are written     */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;
    signed char nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_pixels(fptr, TSBYTE, firstelem, nelem,
            0, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpclsb(fptr, 2, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppnsb( fitsfile *fptr,  /* I - FITS file pointer                      */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            signed char *array, /* I - array of values that are written     */
            signed char nulval, /* I - undefined pixel value                */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).  Any array values
  that are equal to the value of nulval will be replaced with the null
  pixel value that is appropriate for this column.
*/
{
    long row;
    signed char nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        nullvalue = nulval;  /* set local variable */
        fits_write_compressed_pixels(fptr, TSBYTE, firstelem, nelem,
            1, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcnsb(fptr, 2, row, firstelem, nelem, array, nulval, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp2dsb(fitsfile *fptr,   /* I - FITS file pointer                    */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           signed char *array, /* I - array to be written                 */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    /* call the 3D writing routine, with the 3rd dimension = 1 */

    ffp3dsb(fptr, group, ncols, naxis2, naxis1, naxis2, 1, array, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp3dsb(fitsfile *fptr,   /* I - FITS file pointer                    */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  nrows,      /* I - number of rows in each plane of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  naxis3,     /* I - FITS image NAXIS3 value               */
           signed char *array, /* I - array to be written                 */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 3-D cube of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    long tablerow, ii, jj;
    long fpixel[3]= {1,1,1}, lpixel[3];
    LONGLONG nfits, narray;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
           
    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
        lpixel[0] = (long) ncols;
        lpixel[1] = (long) nrows;
        lpixel[2] = (long) naxis3;
       
        fits_write_compressed_img(fptr, TSBYTE, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
      /* all the image pixels are contiguous, so write all at once */
      ffpclsb(fptr, 2, tablerow, 1L, naxis1 * naxis2 * naxis3, array, status);
      return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to write to */
    narray = 0;  /* next pixel in input array to be written */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* writing naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffpclsb(fptr, 2, tablerow, nfits, naxis1,&array[narray],status) > 0)
         return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpsssb(fitsfile *fptr,   /* I - FITS file pointer                      */
           long  group,      /* I - group to write(1 = 1st group)           */
           long  naxis,      /* I - number of data axes in array            */
           long  *naxes,     /* I - size of each FITS axis                  */
           long  *fpixel,    /* I - 1st pixel in each axis to write (1=1st) */
           long  *lpixel,    /* I - last pixel in each axis to write        */
           signed char *array, /* I - array to be written                   */
           int  *status)     /* IO - error status                           */
/*
  Write a subsection of pixels to the primary array or image.
  A subsection is defined to be any contiguous rectangular
  array of pixels within the n-dimensional FITS data file.
  Data conversion and scaling will be performed if necessary 
  (e.g, if the datatype of the FITS array is not the same as
  the array being written).
*/
{
    long tablerow;
    LONGLONG fpix[7], dimen[7], astart, pstart;
    LONGLONG off2, off3, off4, off5, off6, off7;
    LONGLONG st10, st20, st30, st40, st50, st60, st70;
    LONGLONG st1, st2, st3, st4, st5, st6, st7;
    long ii, i1, i2, i3, i4, i5, i6, i7, irange[7];

    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_img(fptr, TSBYTE, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    if (naxis < 1 || naxis > 7)
      return(*status = BAD_DIMEN);

    tablerow=maxvalue(1,group);

     /* calculate the size and number of loops to perform in each dimension */
    for (ii = 0; ii < 7; ii++)
    {
      fpix[ii]=1;
      irange[ii]=1;
      dimen[ii]=1;
    }

    for (ii = 0; ii < naxis; ii++)
    {    
      fpix[ii]=fpixel[ii];
      irange[ii]=lpixel[ii]-fpixel[ii]+1;
      dimen[ii]=naxes[ii];
    }

    i1=irange[0];

    /* compute the pixel offset between each dimension */
    off2 =     dimen[0];
    off3 = off2 * dimen[1];
    off4 = off3 * dimen[2];
    off5 = off4 * dimen[3];
    off6 = off5 * dimen[4];
    off7 = off6 * dimen[5];

    st10 = fpix[0];
    st20 = (fpix[1] - 1) * off2;
    st30 = (fpix[2] - 1) * off3;
    st40 = (fpix[3] - 1) * off4;
    st50 = (fpix[4] - 1) * off5;
    st60 = (fpix[5] - 1) * off6;
    st70 = (fpix[6] - 1) * off7;

    /* store the initial offset in each dimension */
    st1 = st10;
    st2 = st20;
    st3 = st30;
    st4 = st40;
    st5 = st50;
    st6 = st60;
    st7 = st70;

    astart = 0;

    for (i7 = 0; i7 < irange[6]; i7++)
    {
     for (i6 = 0; i6 < irange[5]; i6++)
     {
      for (i5 = 0; i5 < irange[4]; i5++)
      {
       for (i4 = 0; i4 < irange[3]; i4++)
       {
        for (i3 = 0; i3 < irange[2]; i3++)
        {
         pstart = st1 + st2 + st3 + st4 + st5 + st6 + st7;

         for (i2 = 0; i2 < irange[1]; i2++)
         {
           if (ffpclsb(fptr, 2, tablerow, pstart, i1, &array[astart],
              status) > 0)
              return(*status);

           astart += i1;
           pstart += off2;
         }
         st2 = st20;
         st3 = st3+off3;    
        }
        st3 = st30;
        st4 = st4+off4;
       }
       st4 = st40;
       st5 = st5+off5;
      }
      st5 = st50;
      st6 = st6+off6;
     }
     st6 = st60;
     st7 = st7+off7;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpgpsb( fitsfile *fptr,   /* I - FITS file pointer                     */
            long  group,      /* I - group to write(1 = 1st group)          */
            long  firstelem,  /* I - first vector element to write(1 = 1st) */
            long  nelem,      /* I - number of values to write              */
            signed char *array, /* I - array of values that are written     */
            int  *status)     /* IO - error status                          */
/*
  Write an array of group parameters to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffpclsb(fptr, 1L, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpclsb( fitsfile *fptr,  /* I - FITS file pointer                      */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            signed char *array, /* I - array of values to write             */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table with
  2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    int tcode, maxelem, hdutype;
    long twidth, incre;
    long ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull;
    double scale, zero;
    char tform[20], cform[20];
    char message[FLEN_ERRMSG];

    char snull[20];   /*  the FITS null value  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

    if (tcode == TSTRING)   
         ffcfmt(tform, cform);     /* derive C format for writing strings */

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*  First call the ffXXfYY routine to  (1) convert the datatype        */
    /*  if necessary, and (2) scale the values by the FITS TSCALn and      */
    /*  TZEROn linear scaling parameters into a temporary buffer.          */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
        /* limit the number of pixels to process a one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, (repeat - elemnum));

        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);
        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TBYTE):

                /* convert the raw data before writing to FITS file */
                ffs1fi1(&array[next], ntodo, scale, zero,
                        (unsigned char *) buffer, status);
                ffpi1b(fptr, ntodo, incre, (unsigned char *) buffer, status);

              break;

            case (TLONGLONG):

                ffs1fi8(&array[next], ntodo, scale, zero,
                        (LONGLONG *) buffer, status);
                ffpi8b(fptr, ntodo, incre, (long *) buffer, status);
                break;

            case (TSHORT):
 
                ffs1fi2(&array[next], ntodo, scale, zero,
                        (short *) buffer, status);
                ffpi2b(fptr, ntodo, incre, (short *) buffer, status);
                break;

            case (TLONG):

                ffs1fi4(&array[next], ntodo, scale, zero,
                        (INT32BIT *) buffer, status);
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) buffer, status);
                break;

            case (TFLOAT):

                ffs1fr4(&array[next], ntodo, scale, zero,
                        (float *)  buffer, status);
                ffpr4b(fptr, ntodo, incre, (float *) buffer, status);
                break;

            case (TDOUBLE):
                ffs1fr8(&array[next], ntodo, scale, zero,
                        (double *) buffer, status);
                ffpr8b(fptr, ntodo, incre, (double *) buffer, status);
                break;

            case (TSTRING):  /* numerical column in an ASCII table */

                if (strchr(tform,'A'))
                {
                    /* write raw input bytes without conversion        */
                    /* This case is a hack to let users write a stream */
                    /* of bytes directly to the 'A' format column      */

                    if (incre == twidth)
                        ffpbyt(fptr, ntodo, &array[next], status);
                    else
                        ffpbytoff(fptr, twidth, ntodo/twidth, incre - twidth, 
                                &array[next], status);
                    break;
                }
                else if (cform[1] != 's')  /*  "%s" format is a string */
                {
                  ffs1fstr(&array[next], ntodo, scale, zero, cform,
                          twidth, (char *) buffer, status);

                  if (incre == twidth)    /* contiguous bytes */
                     ffpbyt(fptr, ntodo * twidth, buffer, status);
                  else
                     ffpbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                            status);
                  break;
                }
                /* can't write to string column, so fall thru to default: */

            default:  /*  error trap  */
                snprintf(message, FLEN_ERRMSG,
                       "Cannot write numbers to column %d which has format %s",
                        colnum,tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
          snprintf(message,FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpclsb).",
              (double) (next+1), (double) (next+ntodo));
          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
      ffpmsg(
      "Numerical overflow during type conversion while writing FITS data.");
      *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcnsb( fitsfile *fptr,  /* I - FITS file pointer                      */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            signed char *array,   /* I - array of values to write           */
            signed char nulvalue, /* I - flag for undefined pixels          */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels equal to the value of nulvalue will be replaced by the appropriate
  null value in the output FITS file. 

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode, overflow = 0;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    /* if variable length array, first write the whole input vector, 
       then go back and fill in the nulls */
    if (tcode < 0) {
      if (ffpclsb(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0) {
        if (*status == NUM_OVERFLOW) 
	{
	  /* ignore overflows, which are possibly the null pixel values */
	  /*  overflow = 1;   */
	  *status = 0;
	} else { 
          return(*status);
	}
      }
    }

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (ffpclu(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood + 1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (tcode > 0) {  /* variable length arrays have already been written */
              if (ffpclsb(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0) {
		if (*status == NUM_OVERFLOW) 
		{
		  overflow = 1;
		  *status = 0;
		} else { 
                  return(*status);
		}
	      }
	    }
            ngood=0;
         }

         nbad = nbad + 1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      if (tcode > 0) {  /* variable length arrays have already been written */
        ffpclsb(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
      }
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpclu(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    if (*status <= 0) {
      if (overflow) {
        *status = NUM_OVERFLOW;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffs1fi1(signed char *input,    /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            unsigned char *output, /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == -128.)
    {
        /* Instead of adding 128, it is more efficient */
        /* to just flip the sign bit with the XOR operator */

        for (ii = 0; ii < ntodo; ii++)
             output[ii] =  ( *(unsigned char *) &input[ii] ) ^ 0x80;
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] < 0)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else
                output[ii] = (unsigned char) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = ( ((double) input[ii]) - zero) / scale;

            if (dvalue < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (dvalue > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) (dvalue + .5);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffs1fi2(signed char *input,    /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            short *output,         /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = input[ii];   /* just copy input to output */
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (((double) input[ii]) - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (short) (dvalue + .5);
                else
                    output[ii] = (short) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffs1fi4(signed char *input,    /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            INT32BIT *output,      /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (INT32BIT) input[ii];   /* copy input to output */
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (((double) input[ii]) - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (INT32BIT) (dvalue + .5);
                else
                    output[ii] = (INT32BIT) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffs1fi8(signed char *input,   /* I - array of values to be converted  */
            long ntodo,           /* I - number of elements in the array  */
            double scale,         /* I - FITS TSCALn or BSCALE value      */
            double zero,          /* I - FITS TZEROn or BZERO  value      */
            LONGLONG *output,     /* O - output array of converted values */
            int *status)          /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero ==  9223372036854775808.)
    {       
        /* Writing to unsigned long long column. Input values must not be negative */
        /* Instead of subtracting 9223372036854775808, it is more efficient */
        /* and more precise to just flip the sign bit with the XOR operator */

        for (ii = 0; ii < ntodo; ii++) {
           if (input[ii] < 0) {
              *status = OVERFLOW_ERR;
              output[ii] = LONGLONG_MIN;
           } else {
              output[ii] =  ((LONGLONG) input[ii]) ^ 0x8000000000000000;
           }
        }
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (dvalue > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (LONGLONG) (dvalue + .5);
                else
                    output[ii] = (LONGLONG) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffs1fr4(signed char *input,    /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            float *output,         /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (float) (( ( (double) input[ii] ) - zero) / scale);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffs1fr8(signed char *input,    /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            double *output,        /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = ( ( (double) input[ii] ) - zero) / scale;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffs1fstr(signed char *input, /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            char *cform,       /* I - format for output string values  */
            long twidth,       /* I - width of each field, in chars    */
            char *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do scaling if required.
*/
{
    long ii;
    double dvalue;
    char *cptr;
    
    cptr = output;


    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
           sprintf(output, cform, (double) input[ii]);
           output += twidth;

           if (*output)  /* if this char != \0, then overflow occurred */
              *status = OVERFLOW_ERR;
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
          dvalue = ((double) input[ii] - zero) / scale;
          sprintf(output, cform, dvalue);
          output += twidth;

          if (*output)  /* if this char != \0, then overflow occurred */
            *status = OVERFLOW_ERR;
        }
    }

    /* replace any commas with periods (e.g., in French locale) */
    while ((cptr = strchr(cptr, ','))) *cptr = '.';
    
    return(*status);
}
cfitsio-3.47/putcols.c0000644000225700000360000002530013464573432014245 0ustar  cagordonlhea/*  This file, putcols.c, contains routines that write data elements to    */
/*  a FITS image or table, of type character string.                       */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include "fitsio2.h"
/*--------------------------------------------------------------------------*/
int ffpcls( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of strings to write              */
            char  **array,   /* I - array of pointers to strings            */
            int  *status)    /* IO - error status                           */
/*
  Write an array of string values to a column in the current FITS HDU.
*/
{
    int tcode, maxelem, hdutype, nchar;
    long twidth, incre;
    long ii, jj, ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull;
    double scale, zero;
    char tform[20], *blanks;
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value  */
    tcolumn *colptr;

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    char *buffer, *arrayptr;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (colnum < 1 || colnum > (fptr->Fptr)->tfield)
    {
        snprintf(message, FLEN_ERRMSG,"Specified column number is out of range: %d",
                colnum);
        ffpmsg(message);
        return(*status = BAD_COL_NUM);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */
    tcode = colptr->tdatatype;

    if (tcode == -TSTRING) /* variable length column in a binary table? */
    {
      /* only write a single string; ignore value of firstelem */
      nchar = maxvalue(1,strlen(array[0])); /* will write at least 1 char */
                                          /* even if input string is null */

      if (ffgcprll( fptr, colnum, firstrow, 1, nchar, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);
	
      /* simply move to write position, then write the string */
      ffmbyt(fptr, startpos, IGNORE_EOF, status); 
      ffpbyt(fptr, nchar, array[0], status);

      if (*status > 0)  /* test for error during previous write operation */
      {
         snprintf(message,FLEN_ERRMSG,
          "Error writing to variable length string column (ffpcls).");
         ffpmsg(message);
      }

      return(*status);
    }
    else if (tcode == TSTRING)
    {
      if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

      /* if string length is greater than a FITS block (2880 char) then must */
      /* only write 1 string at a time, to force writein by ffpbyt instead of */
      /* ffpbytoff (ffpbytoff can't handle this case) */
      if (twidth > IOBUFLEN) {
        maxelem = 1;
        incre = twidth;
        repeat = 1;
      }   

      blanks = (char *) malloc(twidth); /* string for blank fill values */
      if (!blanks)
      {
        ffpmsg("Could not allocate memory for string (ffpcls)");
        return(*status = ARRAY_TOO_BIG);
      }

      for (ii = 0; ii < twidth; ii++)
          blanks[ii] = ' ';          /* fill string with blanks */

      remain = nelem;           /* remaining number of values to write  */
    }
    else 
      return(*status = NOT_ASCII_COL);
 
    /*-------------------------------------------------------*/
    /*  Now write the strings to the FITS column.            */
    /*-------------------------------------------------------*/

    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
      /* limit the number of pixels to process at one time to the number that
         will fit in the buffer space or to the number of pixels that remain
         in the current vector, which ever is smaller.
      */
      ntodo = (long) minvalue(remain, maxelem);      
      ntodo = (long) minvalue(ntodo, (repeat - elemnum));

      wrtptr = startpos + (rownum * rowlen) + (elemnum * incre);
      ffmbyt(fptr, wrtptr, IGNORE_EOF, status);  /* move to write position */

      buffer = (char *) cbuff;

      /* copy the user's strings into the buffer */
      for (ii = 0; ii < ntodo; ii++)
      {
         arrayptr = array[next];

         for (jj = 0; jj < twidth; jj++)  /*  copy the string, char by char */
         {
            if (*arrayptr)
            {
              *buffer = *arrayptr;
              buffer++;
              arrayptr++;
            }
            else
              break;
         }

         for (;jj < twidth; jj++)    /* fill field with blanks, if needed */
         {
           *buffer = ' ';
           buffer++;
         }

         next++;
      }

      /* write the buffer full of strings to the FITS file */
      if (incre == twidth)
         ffpbyt(fptr, ntodo * twidth, cbuff, status);
      else
         ffpbytoff(fptr, twidth, ntodo, incre - twidth, cbuff, status);

      if (*status > 0)  /* test for error during previous write operation */
      {
         snprintf(message,FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpcls).",
             (double) (next+1), (double) (next+ntodo));
         ffpmsg(message);

         if (blanks)
           free(blanks);

         return(*status);
      }

      /*--------------------------------------------*/
      /*  increment the counters for the next loop  */
      /*--------------------------------------------*/
      remain -= ntodo;
      if (remain)
      {
          elemnum += ntodo;
          if (elemnum == repeat)  /* completed a row; start on next row */
          {
              elemnum = 0;
              rownum++;
          }
       }
    }  /*  End of main while Loop  */

    if (blanks)
      free(blanks);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcns( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            char  **array,   /* I - array of values to write                */
            char  *nulvalue, /* I - string representing a null value        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels flagged as null will be replaced by the appropriate
  null value in the output FITS file. 
*/
{
    long repeat, width;
    LONGLONG ngood = 0, nbad = 0, ii;
    LONGLONG first, fstelm, fstrow;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    /* get the vector repeat length of the column */
    ffgtcl(fptr, colnum, NULL, &repeat, &width, status);

    if ((fptr->Fptr)->hdutype == BINARY_TBL)
        repeat = repeat / width;    /* convert from chars to unit strings */

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (strcmp(nulvalue, array[ii]))  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (ffpclu(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);
            nbad=0;
         }

         ngood = ngood +1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (ffpcls(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0)
                return(*status);

            ngood=0;
         }

         nbad = nbad +1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpcls(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpclu(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    return(*status);
}
cfitsio-3.47/putcolu.c0000644000225700000360000005206313464573432014255 0ustar  cagordonlhea/*  This file, putcolu.c, contains routines that write data elements to    */
/*  a FITS image or table.  Writes null values.                            */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffppru( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,      /* I - group to write(1 = 1st group)          */
            LONGLONG  firstelem,  /* I - first vector element to write(1 = 1st) */
            LONGLONG  nelem,      /* I - number of values to write              */
            int  *status)     /* IO - error status                          */
/*
  Write null values to the primary array.

*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        ffpmsg("writing to compressed image is not supported");

        return(*status = DATA_COMPRESSION_ERR);
    }

    row=maxvalue(1,group);

    ffpclu(fptr, 2, row, firstelem, nelem, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpprn( fitsfile *fptr,  /* I - FITS file pointer                       */
            LONGLONG  firstelem,  /* I - first vector element to write(1 = 1st) */
            LONGLONG  nelem,      /* I - number of values to write              */
            int  *status)     /* IO - error status                          */
/*
  Write null values to the primary array. (Doesn't support groups).

*/
{
    long row = 1;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        ffpmsg("writing to compressed image is not supported");

        return(*status = DATA_COMPRESSION_ERR);
    }

    ffpclu(fptr, 2, row, firstelem, nelem, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpclu( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelempar,     /* I - number of values to write               */
            int  *status)    /* IO - error status                           */
/*
  Set elements of a table column to the appropriate null value for the column
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.
  
  This routine support COMPLEX and DOUBLE COMPLEX binary table columns, and
  sets both the real and imaginary components of the element to a NaN.
*/
{
    int tcode, maxelem, hdutype, writemode = 2, leng;
    short i2null;
    INT32BIT i4null;
    long twidth, incre;
    LONGLONG ii;
    LONGLONG largeelem, nelem, tnull, i8null;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, ntodo;
    double scale, zero;
    unsigned char i1null, lognul = 0;
    char tform[20], *cstring = 0;
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value  */
    long   jbuff[2] = { -1, -1};  /* all bits set is equivalent to a NaN */
    size_t buffsize;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    nelem = nelempar;
    
    largeelem = firstelem;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/

    /* note that writemode = 2 by default (not 1), so that the returned */
    /* repeat and incre values will be the actual values for this column. */

    /* If writing nulls to a variable length column then dummy data values  */
    /* must have already been written to the heap. */
    /* We just have to overwrite the previous values with null values. */
    /* Set writemode = 0 in this case, to test that values have been written */

    fits_get_coltype(fptr, colnum, &tcode, NULL, NULL, status);
    if (tcode < 0)
         writemode = 0;  /* this is a variable length column */

    if (abs(tcode) >= TCOMPLEX)
    { /* treat complex columns as pairs of numbers */
      largeelem = (largeelem - 1) * 2 + 1;
      nelem *= 2;
    }

    if (ffgcprll( fptr, colnum, firstrow, largeelem, nelem, writemode, &scale,
       &zero, tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

    if (tcode == TSTRING)
    {
      if (snull[0] == ASCII_NULL_UNDEFINED)
      {
        ffpmsg(
        "Null value string for ASCII table column is not defined (FTPCLU).");
        return(*status = NO_NULL);
      }

      /* allocate buffer to hold the null string.  Must write the entire */
      /* width of the column (twidth bytes) to avoid possible problems */
      /* with uninitialized FITS blocks, in case the field spans blocks */

      buffsize = maxvalue(20, twidth);
      cstring = (char *) malloc(buffsize);
      if (!cstring)
         return(*status = MEMORY_ALLOCATION);

      memset(cstring, ' ', buffsize);  /* initialize  with blanks */

      leng = strlen(snull);
      if (hdutype == BINARY_TBL)
         leng++;        /* copy the terminator too in binary tables */

      strncpy(cstring, snull, leng);  /* copy null string to temp buffer */
    }
    else if ( tcode == TBYTE  ||
              tcode == TSHORT ||
              tcode == TLONG  ||
              tcode == TLONGLONG) 
    {
      if (tnull == NULL_UNDEFINED)
      {
        ffpmsg(
        "Null value for integer table column is not defined (FTPCLU).");
        return(*status = NO_NULL);
      }

      if (tcode == TBYTE)
         i1null = (unsigned char) tnull;
      else if (tcode == TSHORT)
      {
         i2null = (short) tnull;
#if BYTESWAPPED
         ffswap2(&i2null, 1); /* reverse order of bytes */
#endif
      }
      else if (tcode == TLONG)
      {
         i4null = (INT32BIT) tnull;
#if BYTESWAPPED
         ffswap4(&i4null, 1); /* reverse order of bytes */
#endif
      }
      else
      {
         i8null = tnull;
#if BYTESWAPPED
         ffswap8((double *)(&i8null), 1);  /* reverse order of bytes */
#endif
      }
    }

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */
    ntodo = remain;           /* number of elements to write at one time */

    while (ntodo)
    {
        /* limit the number of pixels to process at one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = minvalue(ntodo, (repeat - elemnum));
        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);

        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TBYTE):
 
                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 1,  &i1null, status);
                break;

            case (TSHORT):

                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 2, &i2null, status);
                break;

            case (TLONG):

                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 4, &i4null, status);
                break;

            case (TLONGLONG):

                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 8, &i8null, status);
                break;

            case (TFLOAT):

                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 4, jbuff, status);
                break;

            case (TDOUBLE):

                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 8, jbuff, status);
                break;

            case (TLOGICAL):
 
                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 1, &lognul, status);
                break;

            case (TSTRING):  /* an ASCII table column */
                /* repeat always = 1, so ntodo is also guaranteed to = 1 */
                ffpbyt(fptr, twidth, cstring, status);
                break;

            default:  /*  error trap  */
                snprintf(message,FLEN_ERRMSG, 
                   "Cannot write null value to column %d which has format %s",
                     colnum,tform);
                ffpmsg(message);
                return(*status);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
           snprintf(message,FLEN_ERRMSG,
             "Error writing %.0f thru %.0f of null values (ffpclu).",
              (double) (next+1), (double) (next+ntodo));
           ffpmsg(message);

           if (cstring)
              free(cstring);

           return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
        ntodo = remain;  /* this is the maximum number to do in next loop */

    }  /*  End of main while Loop  */

    if (cstring)
       free(cstring);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcluc( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            int  *status)    /* IO - error status                           */
/*
  Set elements of a table column to the appropriate null value for the column
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.
  
  This routine does not do anything special in the case of COMPLEX table columns
  (unlike the similar ffpclu routine).  This routine is mainly for use by
  ffpcne which already compensates for the effective doubling of the number of 
  elements in a complex column.
*/
{
    int tcode, maxelem, hdutype, writemode = 2, leng;
    short i2null;
    INT32BIT i4null;
    long twidth, incre;
    LONGLONG ii;
    LONGLONG tnull, i8null;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, ntodo;
    double scale, zero;
    unsigned char i1null, lognul = 0;
    char tform[20], *cstring = 0;
    char message[FLEN_ERRMSG];
    char snull[20];   /*  the FITS null value  */
    long   jbuff[2] = { -1, -1};  /* all bits set is equivalent to a NaN */
    size_t buffsize;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/

    /* note that writemode = 2 by default (not 1), so that the returned */
    /* repeat and incre values will be the actual values for this column. */

    /* If writing nulls to a variable length column then dummy data values  */
    /* must have already been written to the heap. */
    /* We just have to overwrite the previous values with null values. */
    /* Set writemode = 0 in this case, to test that values have been written */

    fits_get_coltype(fptr, colnum, &tcode, NULL, NULL, status);
    if (tcode < 0)
         writemode = 0;  /* this is a variable length column */
    
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, writemode, &scale,
       &zero, tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

    if (tcode == TSTRING)
    {
      if (snull[0] == ASCII_NULL_UNDEFINED)
      {
        ffpmsg(
        "Null value string for ASCII table column is not defined (FTPCLU).");
        return(*status = NO_NULL);
      }

      /* allocate buffer to hold the null string.  Must write the entire */
      /* width of the column (twidth bytes) to avoid possible problems */
      /* with uninitialized FITS blocks, in case the field spans blocks */

      buffsize = maxvalue(20, twidth);
      cstring = (char *) malloc(buffsize);
      if (!cstring)
         return(*status = MEMORY_ALLOCATION);

      memset(cstring, ' ', buffsize);  /* initialize  with blanks */

      leng = strlen(snull);
      if (hdutype == BINARY_TBL)
         leng++;        /* copy the terminator too in binary tables */

      strncpy(cstring, snull, leng);  /* copy null string to temp buffer */

    }
    else if ( tcode == TBYTE  ||
              tcode == TSHORT ||
              tcode == TLONG  ||
              tcode == TLONGLONG) 
    {
      if (tnull == NULL_UNDEFINED)
      {
        ffpmsg(
        "Null value for integer table column is not defined (FTPCLU).");
        return(*status = NO_NULL);
      }

      if (tcode == TBYTE)
         i1null = (unsigned char) tnull;
      else if (tcode == TSHORT)
      {
         i2null = (short) tnull;
#if BYTESWAPPED
         ffswap2(&i2null, 1); /* reverse order of bytes */
#endif
      }
      else if (tcode == TLONG)
      {
         i4null = (INT32BIT) tnull;
#if BYTESWAPPED
         ffswap4(&i4null, 1); /* reverse order of bytes */
#endif
      }
      else
      {
         i8null = tnull;
#if BYTESWAPPED
         ffswap8((double *)(&i8null), 1);  /* reverse order of bytes */
#endif
      }
    }

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */
    ntodo = remain;           /* number of elements to write at one time */

    while (ntodo)
    {
        /* limit the number of pixels to process at one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = minvalue(ntodo, (repeat - elemnum));
        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);

        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TBYTE):
 
                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 1,  &i1null, status);
                break;

            case (TSHORT):

                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 2, &i2null, status);
                break;

            case (TLONG):

                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 4, &i4null, status);
                break;

            case (TLONGLONG):

                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 8, &i8null, status);
                break;

            case (TFLOAT):

                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 4, jbuff, status);
                break;

            case (TDOUBLE):

                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 8, jbuff, status);
                break;

            case (TLOGICAL):
 
                for (ii = 0; ii < ntodo; ii++)
                  ffpbyt(fptr, 1, &lognul, status);
                break;

            case (TSTRING):  /* an ASCII table column */
                /* repeat always = 1, so ntodo is also guaranteed to = 1 */
                ffpbyt(fptr, twidth, cstring, status);
                break;

            default:  /*  error trap  */
                snprintf(message, FLEN_ERRMSG,
                   "Cannot write null value to column %d which has format %s",
                     colnum,tform);
                ffpmsg(message);
                return(*status);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
           snprintf(message,FLEN_ERRMSG,
             "Error writing %.0f thru %.0f of null values (ffpclu).",
              (double) (next+1), (double) (next+ntodo));
           ffpmsg(message);

           if (cstring)
              free(cstring);

           return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
        ntodo = remain;  /* this is the maximum number to do in next loop */

    }  /*  End of main while Loop  */

    if (cstring)
       free(cstring);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffprwu(fitsfile *fptr,
           LONGLONG firstrow,
           LONGLONG nrows, 
           int *status)

/* 
 * fits_write_nullrows / ffprwu - write TNULLs to all columns in one or more rows
 *
 * fitsfile *fptr - pointer to FITS HDU opened for read/write
 * long int firstrow - first table row to set to null. (firstrow >= 1)
 * long int nrows - total number or rows to set to null. (nrows >= 1)
 * int *status - upon return, *status contains CFITSIO status code
 *
 * RETURNS: CFITSIO status code
 *
 * written by Craig Markwardt, GSFC 
 */
{
  LONGLONG ntotrows;
  int ncols, i;
  int typecode = 0;
  LONGLONG repeat = 0, width = 0;
  int nullstatus;

  if (*status > 0) return *status;

  if ((firstrow <= 0) || (nrows <= 0)) return (*status = BAD_ROW_NUM);

  fits_get_num_rowsll(fptr, &ntotrows, status);

  if (firstrow + nrows - 1 > ntotrows) return (*status = BAD_ROW_NUM);
  
  fits_get_num_cols(fptr, &ncols, status);
  if (*status) return *status;


  /* Loop through each column and write nulls */
  for (i=1; i <= ncols; i++) {
    repeat = 0;  typecode = 0;  width = 0;
    fits_get_coltypell(fptr, i, &typecode, &repeat, &width, status);
    if (*status) break;

    /* NOTE: data of TSTRING type must not write the total repeat
       count, since the repeat count is the *character* count, not the
       nstring count.  Divide by string width to get number of
       strings. */
    
    if (typecode == TSTRING) repeat /= width;

    /* Write NULLs */
    nullstatus = 0;
    fits_write_col_null(fptr, i, firstrow, 1, repeat*nrows, &nullstatus);

    /* ignore error if no null value is defined for the column */
    if (nullstatus && nullstatus != NO_NULL) return (*status = nullstatus);
    
  }
    
  return *status;
}

cfitsio-3.47/putcolui.c0000644000225700000360000010402513464573432014422 0ustar  cagordonlhea/*  This file, putcolui.c, contains routines that write data elements to    */
/*  a FITS image or table, with unsigned short datatype.                            */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffpprui(fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write (1 = 1st group)          */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
   unsigned short *array,    /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;
    unsigned short nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_pixels(fptr, TUSHORT, firstelem, nelem,
            0, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpclui(fptr, 2, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppnui(fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
   unsigned short *array,    /* I - array of values that are written        */
   unsigned short nulval,    /* I - undefined pixel value                   */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).  Any array values
  that are equal to the value of nulval will be replaced with the null
  pixel value that is appropriate for this column.
*/
{
    long row;
    unsigned short nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        nullvalue = nulval;  /* set local variable */
        fits_write_compressed_pixels(fptr, TUSHORT, firstelem, nelem,
            1, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcnui(fptr, 2, row, firstelem, nelem, array, nulval, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp2dui(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
  unsigned short *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    /* call the 3D writing routine, with the 3rd dimension = 1 */

    ffp3dui(fptr, group, ncols, naxis2, naxis1, naxis2, 1, array, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp3dui(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  nrows,      /* I - number of rows in each plane of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  naxis3,     /* I - FITS image NAXIS3 value               */
  unsigned short *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 3-D cube of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    long tablerow, ii, jj;
    long fpixel[3]= {1,1,1}, lpixel[3];
    LONGLONG nfits, narray;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
           
    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
        lpixel[0] = (long) ncols;
        lpixel[1] = (long) nrows;
        lpixel[2] = (long) naxis3;
       
        fits_write_compressed_img(fptr, TUSHORT, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
      /* all the image pixels are contiguous, so write all at once */
      ffpclui(fptr, 2, tablerow, 1L, naxis1 * naxis2 * naxis3, array, status);
      return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to write to */
    narray = 0;  /* next pixel in input array to be written */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* writing naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffpclui(fptr, 2, tablerow, nfits, naxis1,&array[narray],status) > 0)
         return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpssui(fitsfile *fptr,   /* I - FITS file pointer                       */
           long  group,      /* I - group to write(1 = 1st group)           */
           long  naxis,      /* I - number of data axes in array            */
           long  *naxes,     /* I - size of each FITS axis                  */
           long  *fpixel,    /* I - 1st pixel in each axis to write (1=1st) */
           long  *lpixel,    /* I - last pixel in each axis to write        */
  unsigned short *array,     /* I - array to be written                     */
           int  *status)     /* IO - error status                           */
/*
  Write a subsection of pixels to the primary array or image.
  A subsection is defined to be any contiguous rectangular
  array of pixels within the n-dimensional FITS data file.
  Data conversion and scaling will be performed if necessary 
  (e.g, if the datatype of the FITS array is not the same as
  the array being written).
*/
{
    long tablerow;
    LONGLONG fpix[7], dimen[7], astart, pstart;
    LONGLONG off2, off3, off4, off5, off6, off7;
    LONGLONG st10, st20, st30, st40, st50, st60, st70;
    LONGLONG st1, st2, st3, st4, st5, st6, st7;
    long ii, i1, i2, i3, i4, i5, i6, i7, irange[7];

    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_img(fptr, TUSHORT, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    if (naxis < 1 || naxis > 7)
      return(*status = BAD_DIMEN);

    tablerow=maxvalue(1,group);

     /* calculate the size and number of loops to perform in each dimension */
    for (ii = 0; ii < 7; ii++)
    {
      fpix[ii]=1;
      irange[ii]=1;
      dimen[ii]=1;
    }

    for (ii = 0; ii < naxis; ii++)
    {    
      fpix[ii]=fpixel[ii];
      irange[ii]=lpixel[ii]-fpixel[ii]+1;
      dimen[ii]=naxes[ii];
    }

    i1=irange[0];

    /* compute the pixel offset between each dimension */
    off2 =     dimen[0];
    off3 = off2 * dimen[1];
    off4 = off3 * dimen[2];
    off5 = off4 * dimen[3];
    off6 = off5 * dimen[4];
    off7 = off6 * dimen[5];

    st10 = fpix[0];
    st20 = (fpix[1] - 1) * off2;
    st30 = (fpix[2] - 1) * off3;
    st40 = (fpix[3] - 1) * off4;
    st50 = (fpix[4] - 1) * off5;
    st60 = (fpix[5] - 1) * off6;
    st70 = (fpix[6] - 1) * off7;

    /* store the initial offset in each dimension */
    st1 = st10;
    st2 = st20;
    st3 = st30;
    st4 = st40;
    st5 = st50;
    st6 = st60;
    st7 = st70;

    astart = 0;

    for (i7 = 0; i7 < irange[6]; i7++)
    {
     for (i6 = 0; i6 < irange[5]; i6++)
     {
      for (i5 = 0; i5 < irange[4]; i5++)
      {
       for (i4 = 0; i4 < irange[3]; i4++)
       {
        for (i3 = 0; i3 < irange[2]; i3++)
        {
         pstart = st1 + st2 + st3 + st4 + st5 + st6 + st7;

         for (i2 = 0; i2 < irange[1]; i2++)
         {
           if (ffpclui(fptr, 2, tablerow, pstart, i1, &array[astart],
              status) > 0)
              return(*status);

           astart += i1;
           pstart += off2;
         }
         st2 = st20;
         st3 = st3+off3;    
        }
        st3 = st30;
        st4 = st4+off4;
       }
       st4 = st40;
       st5 = st5+off5;
      }
      st5 = st50;
      st6 = st6+off6;
     }
     st6 = st60;
     st7 = st7+off7;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpgpui( fitsfile *fptr,   /* I - FITS file pointer                      */
            long  group,      /* I - group to write(1 = 1st group)          */
            long  firstelem,  /* I - first vector element to write(1 = 1st) */
            long  nelem,      /* I - number of values to write              */
   unsigned short *array,     /* I - array of values that are written       */
            int  *status)     /* IO - error status                          */
/*
  Write an array of group parameters to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffpclui(fptr, 1L, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpclui( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
   unsigned short *array,    /* I - array of values to write                */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table with
  2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    int tcode, maxelem, hdutype;
    long twidth, incre;
    long ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull;
    double scale, zero;
    char tform[20], cform[20];
    char message[FLEN_ERRMSG];

    char snull[20];   /*  the FITS null value  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

    if (tcode == TSTRING)   
         ffcfmt(tform, cform);     /* derive C format for writing strings */

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*  First call the ffXXfYY routine to  (1) convert the datatype        */
    /*  if necessary, and (2) scale the values by the FITS TSCALn and      */
    /*  TZEROn linear scaling parameters into a temporary buffer.          */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
        /* limit the number of pixels to process a one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, (repeat - elemnum));

        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);

        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TSHORT):

              ffu2fi2(&array[next], ntodo, scale, zero,
                      (short *) buffer, status);
              ffpi2b(fptr, ntodo, incre, (short *) buffer, status);
              break;

            case (TLONGLONG):

                ffu2fi8(&array[next], ntodo, scale, zero,
                        (LONGLONG *) buffer, status);
                ffpi8b(fptr, ntodo, incre, (long *) buffer, status);
                break;

            case (TBYTE):
 
                ffu2fi1(&array[next], ntodo, scale, zero,
                        (unsigned char *) buffer, status);
                ffpi1b(fptr, ntodo, incre, (unsigned char *) buffer, status);
                break;

            case (TLONG):

                ffu2fi4(&array[next], ntodo, scale, zero,
                        (INT32BIT *) buffer, status);
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) buffer, status);
                break;

            case (TFLOAT):

                ffu2fr4(&array[next], ntodo, scale, zero,
                        (float *) buffer, status);
                ffpr4b(fptr, ntodo, incre, (float *) buffer, status);
                break;

            case (TDOUBLE):
                ffu2fr8(&array[next], ntodo, scale, zero,
                        (double *) buffer, status);
                ffpr8b(fptr, ntodo, incre, (double *) buffer, status);
                break;

            case (TSTRING):  /* numerical column in an ASCII table */

                if (cform[1] != 's')  /*  "%s" format is a string */
                {
                  ffu2fstr(&array[next], ntodo, scale, zero, cform,
                          twidth, (char *) buffer, status);


                  if (incre == twidth)    /* contiguous bytes */
                     ffpbyt(fptr, ntodo * twidth, buffer, status);
                  else
                     ffpbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                            status);

                  break;
                }
                /* can't write to string column, so fall thru to default: */

            default:  /*  error trap  */
                snprintf(message,FLEN_ERRMSG, 
                    "Cannot write numbers to column %d which has format %s",
                      colnum,tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
         snprintf(message,FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpclui).",
             (double) (next+1), (double) (next+ntodo));
         ffpmsg(message);
         return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
       ffpmsg(
       "Numerical overflow during type conversion while writing FITS data.");
       *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcnui(fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
   unsigned short *array,    /* I - array of values to write                */
   unsigned short  nulvalue, /* I - value used to flag undefined pixels     */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels equal to the value of nulvalue will be replaced by the appropriate
  null value in the output FITS file. 

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode, overflow = 0;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    /* if variable length array, first write the whole input vector, 
       then go back and fill in the nulls */
    if (tcode < 0) {
      if (ffpclui(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0) {
        if (*status == NUM_OVERFLOW) 
	{
	  /* ignore overflows, which are possibly the null pixel values */
	  /*  overflow = 1;   */
	  *status = 0;
	} else { 
          return(*status);
	}
      }
    }

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (ffpclu(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood +1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (tcode > 0) {  /* variable length arrays have already been written */
              if (ffpclui(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0) {
		if (*status == NUM_OVERFLOW) 
		{
		  overflow = 1;
		  *status = 0;
		} else { 
                  return(*status);
		}
	      }
	    }
            ngood=0;
         }

         nbad = nbad +1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      if (tcode > 0) {  /* variable length arrays have already been written */
        ffpclui(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
      }
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpclu(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    if (*status <= 0) {
      if (overflow) {
        *status = NUM_OVERFLOW;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu2fi1(unsigned short *input, /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            unsigned char *output, /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] > UCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = ((double) input[ii] - zero) / scale;

            if (dvalue < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (dvalue > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) (dvalue + .5);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu2fi2(unsigned short *input, /* I - array of values to be converted */
            long ntodo,         /* I - number of elements in the array  */
            double scale,       /* I - FITS TSCALn or BSCALE value      */
            double zero,        /* I - FITS TZEROn or BZERO  value      */
            short *output,      /* O - output array of converted values */
            int *status)        /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 32768.)
    {
        /* Instead of subtracting 32768, it is more efficient */
        /* to just flip the sign bit with the XOR operator */

        for (ii = 0; ii < ntodo; ii++)
             output[ii] =  ( *(short *) &input[ii] ) ^ 0x8000;
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] > SHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
                output[ii] = input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = ((double) input[ii] - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (short) (dvalue + .5);
                else
                    output[ii] = (short) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu2fi4(unsigned short *input, /* I - array of values to be converted */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            INT32BIT *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (INT32BIT) input[ii];   /* copy input to output */
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = ((double) input[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (INT32BIT) (dvalue + .5);
                else
                    output[ii] = (INT32BIT) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu2fi8(unsigned short *input,  /* I - array of values to be converted  */
            long ntodo,             /* I - number of elements in the array  */
            double scale,           /* I - FITS TSCALn or BSCALE value      */
            double zero,            /* I - FITS TZEROn or BZERO  value      */
            LONGLONG *output,       /* O - output array of converted values */
            int *status)            /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero ==  9223372036854775808.)
    {       
        /* Writing to unsigned long long column. */
        /* Instead of subtracting 9223372036854775808, it is more efficient */
        /* and more precise to just flip the sign bit with the XOR operator */

        /* no need to check range limits because all unsigned short values */
	/* are valid ULONGLONG values. */

        for (ii = 0; ii < ntodo; ii++) {
             output[ii] =  ((LONGLONG) input[ii]) ^ 0x8000000000000000;
        }
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (dvalue > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (LONGLONG) (dvalue + .5);
                else
                    output[ii] = (LONGLONG) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu2fr4(unsigned short *input, /* I - array of values to be converted */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            float *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (float) (((double) input[ii] - zero) / scale);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu2fr8(unsigned short *input, /* I - array of values to be converted */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            double *output,    /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = ((double) input[ii] - zero) / scale;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu2fstr(unsigned short *input, /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            char *cform,       /* I - format for output string values  */
            long twidth,       /* I - width of each field, in chars    */
            char *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do scaling if required.
*/
{
    long ii;
    double dvalue;
    char *cptr;
    
    cptr = output;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
           sprintf(output, cform, (double) input[ii]);
           output += twidth;

           if (*output)  /* if this char != \0, then overflow occurred */
              *status = OVERFLOW_ERR;
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
          dvalue = ((double) input[ii] - zero) / scale;
          sprintf(output, cform, dvalue);
          output += twidth;

          if (*output)  /* if this char != \0, then overflow occurred */
            *status = OVERFLOW_ERR;
        }
    }

    /* replace any commas with periods (e.g., in French locale) */
    while ((cptr = strchr(cptr, ','))) *cptr = '.';
    
    return(*status);
}
cfitsio-3.47/putcoluj.c0000644000225700000360000020740213464573432014426 0ustar  cagordonlhea/*  This file, putcoluj.c, contains routines that write data elements to   */
/*  a FITS image or table, with unsigned long datatype.                             */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffppruj( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
   unsigned long  *array,    /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;
    unsigned long nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_pixels(fptr, TULONG, firstelem, nelem,
            0, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcluj(fptr, 2, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppnuj( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
   unsigned long  *array,    /* I - array of values that are written        */
   unsigned long  nulval,    /* I - undefined pixel value                   */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).  Any array values
  that are equal to the value of nulval will be replaced with the null
  pixel value that is appropriate for this column.
*/
{
    long row;
    unsigned long nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        nullvalue = nulval;  /* set local variable */
        fits_write_compressed_pixels(fptr, TULONG, firstelem, nelem,
            1, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcnuj(fptr, 2, row, firstelem, nelem, array, nulval, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp2duj(fitsfile *fptr,   /* I - FITS file pointer                    */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
  unsigned long  *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    /* call the 3D writing routine, with the 3rd dimension = 1 */

    ffp3duj(fptr, group, ncols, naxis2, naxis1, naxis2, 1, array, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp3duj(fitsfile *fptr,   /* I - FITS file pointer                    */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  nrows,      /* I - number of rows in each plane of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  naxis3,     /* I - FITS image NAXIS3 value               */
  unsigned long  *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 3-D cube of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    long tablerow, ii, jj;
    long fpixel[3]= {1,1,1}, lpixel[3];
    LONGLONG nfits, narray;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
           
    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
        lpixel[0] = (long) ncols;
        lpixel[1] = (long) nrows;
        lpixel[2] = (long) naxis3;
       
        fits_write_compressed_img(fptr, TULONG, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
      /* all the image pixels are contiguous, so write all at once */
      ffpcluj(fptr, 2, tablerow, 1L, naxis1 * naxis2 * naxis3, array, status);
      return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to write to */
    narray = 0;  /* next pixel in input array to be written */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* writing naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffpcluj(fptr, 2, tablerow, nfits, naxis1,&array[narray],status) > 0)
         return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpssuj(fitsfile *fptr,   /* I - FITS file pointer                       */
           long  group,      /* I - group to write(1 = 1st group)           */
           long  naxis,      /* I - number of data axes in array            */
           long  *naxes,     /* I - size of each FITS axis                  */
           long  *fpixel,    /* I - 1st pixel in each axis to write (1=1st) */
           long  *lpixel,    /* I - last pixel in each axis to write        */
  unsigned long *array,      /* I - array to be written                     */
           int  *status)     /* IO - error status                           */
/*
  Write a subsection of pixels to the primary array or image.
  A subsection is defined to be any contiguous rectangular
  array of pixels within the n-dimensional FITS data file.
  Data conversion and scaling will be performed if necessary 
  (e.g, if the datatype of the FITS array is not the same as
  the array being written).
*/
{
    long tablerow;
    LONGLONG fpix[7], dimen[7], astart, pstart;
    LONGLONG off2, off3, off4, off5, off6, off7;
    LONGLONG st10, st20, st30, st40, st50, st60, st70;
    LONGLONG st1, st2, st3, st4, st5, st6, st7;
    long ii, i1, i2, i3, i4, i5, i6, i7, irange[7];

    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_img(fptr, TULONG, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    if (naxis < 1 || naxis > 7)
      return(*status = BAD_DIMEN);

    tablerow=maxvalue(1,group);

     /* calculate the size and number of loops to perform in each dimension */
    for (ii = 0; ii < 7; ii++)
    {
      fpix[ii]=1;
      irange[ii]=1;
      dimen[ii]=1;
    }

    for (ii = 0; ii < naxis; ii++)
    {    
      fpix[ii]=fpixel[ii];
      irange[ii]=lpixel[ii]-fpixel[ii]+1;
      dimen[ii]=naxes[ii];
    }

    i1=irange[0];

    /* compute the pixel offset between each dimension */
    off2 =     dimen[0];
    off3 = off2 * dimen[1];
    off4 = off3 * dimen[2];
    off5 = off4 * dimen[3];
    off6 = off5 * dimen[4];
    off7 = off6 * dimen[5];

    st10 = fpix[0];
    st20 = (fpix[1] - 1) * off2;
    st30 = (fpix[2] - 1) * off3;
    st40 = (fpix[3] - 1) * off4;
    st50 = (fpix[4] - 1) * off5;
    st60 = (fpix[5] - 1) * off6;
    st70 = (fpix[6] - 1) * off7;

    /* store the initial offset in each dimension */
    st1 = st10;
    st2 = st20;
    st3 = st30;
    st4 = st40;
    st5 = st50;
    st6 = st60;
    st7 = st70;

    astart = 0;

    for (i7 = 0; i7 < irange[6]; i7++)
    {
     for (i6 = 0; i6 < irange[5]; i6++)
     {
      for (i5 = 0; i5 < irange[4]; i5++)
      {
       for (i4 = 0; i4 < irange[3]; i4++)
       {
        for (i3 = 0; i3 < irange[2]; i3++)
        {
         pstart = st1 + st2 + st3 + st4 + st5 + st6 + st7;

         for (i2 = 0; i2 < irange[1]; i2++)
         {
           if (ffpcluj(fptr, 2, tablerow, pstart, i1, &array[astart],
              status) > 0)
              return(*status);

           astart += i1;
           pstart += off2;
         }
         st2 = st20;
         st3 = st3+off3;    
        }
        st3 = st30;
        st4 = st4+off4;
       }
       st4 = st40;
       st5 = st5+off5;
      }
      st5 = st50;
      st6 = st6+off6;
     }
     st6 = st60;
     st7 = st7+off7;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpgpuj( fitsfile *fptr,   /* I - FITS file pointer                      */
            long  group,      /* I - group to write(1 = 1st group)          */
            long  firstelem,  /* I - first vector element to write(1 = 1st) */
            long  nelem,      /* I - number of values to write              */
   unsigned long  *array,     /* I - array of values that are written       */
            int  *status)     /* IO - error status                          */
/*
  Write an array of group parameters to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffpcluj(fptr, 1L, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcluj( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
   unsigned long  *array,    /* I - array of values to write                */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    int tcode, maxelem, hdutype;
    long twidth, incre;
    long ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull;
    double scale, zero;
    char tform[20], cform[20];
    char message[FLEN_ERRMSG];

    char snull[20];   /*  the FITS null value  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

    if (tcode == TSTRING)   
         ffcfmt(tform, cform);     /* derive C format for writing strings */

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*  First call the ffXXfYY routine to  (1) convert the datatype        */
    /*  if necessary, and (2) scale the values by the FITS TSCALn and      */
    /*  TZEROn linear scaling parameters into a temporary buffer.          */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
        /* limit the number of pixels to process a one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, (repeat - elemnum));

        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);

        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TLONG):

                ffu4fi4(&array[next], ntodo, scale, zero,
                      (INT32BIT *) buffer, status);
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) buffer, status);
                break;

            case (TLONGLONG):

                ffu4fi8(&array[next], ntodo, scale, zero,
                        (LONGLONG *) buffer, status);
                ffpi8b(fptr, ntodo, incre, (long *) buffer, status);
                break;

            case (TBYTE):
 
                ffu4fi1(&array[next], ntodo, scale, zero,
                        (unsigned char *) buffer, status);
                ffpi1b(fptr, ntodo, incre, (unsigned char *) buffer, status);
                break;

            case (TSHORT):

                ffu4fi2(&array[next], ntodo, scale, zero,
                        (short *) buffer, status);
                ffpi2b(fptr, ntodo, incre, (short *) buffer, status);
                break;

            case (TFLOAT):

                ffu4fr4(&array[next], ntodo, scale, zero,
                        (float *) buffer, status);
                ffpr4b(fptr, ntodo, incre, (float *) buffer, status);
                break;

            case (TDOUBLE):
                ffu4fr8(&array[next], ntodo, scale, zero,
                       (double *) buffer, status);
                ffpr8b(fptr, ntodo, incre, (double *) buffer, status);
                break;

            case (TSTRING):  /* numerical column in an ASCII table */

                if (cform[1] != 's')  /*  "%s" format is a string */
                {
                  ffu4fstr(&array[next], ntodo, scale, zero, cform,
                          twidth, (char *) buffer, status);

                  if (incre == twidth)    /* contiguous bytes */
                     ffpbyt(fptr, ntodo * twidth, buffer, status);
                  else
                     ffpbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                            status);

                  break;
                }
                /* can't write to string column, so fall thru to default: */

            default:  /*  error trap  */
                snprintf(message,FLEN_ERRMSG, 
                     "Cannot write numbers to column %d which has format %s",
                      colnum,tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
          snprintf(message,FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpcluj).",
              (double) (next+1), (double) (next+ntodo));
          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while writing FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcnuj( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
   unsigned long  *array,    /* I - array of values to write                */
   unsigned long   nulvalue, /* I - value used to flag undefined pixels     */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels equal to the value of nulvalue will be replaced by the appropriate
  null value in the output FITS file. 

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode, overflow = 0;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    /* if variable length array, first write the whole input vector, 
       then go back and fill in the nulls */
    if (tcode < 0) {
      if (ffpcluj(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0) {
        if (*status == NUM_OVERFLOW) 
	{
	  /* ignore overflows, which are possibly the null pixel values */
	  /*  overflow = 1;   */
	  *status = 0;
	} else { 
          return(*status);
	}
      }
    }

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (ffpclu(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood +1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (tcode > 0) {  /* variable length arrays have already been written */
              if (ffpcluj(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0) {
		if (*status == NUM_OVERFLOW) 
		{
		  overflow = 1;
		  *status = 0;
		} else { 
                  return(*status);
		}
	      }
	    }
            ngood=0;
         }

         nbad = nbad +1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      if (tcode > 0) {  /* variable length arrays have already been written */
        ffpcluj(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
      }
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpclu(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    if (*status <= 0) {
      if (overflow) {
        *status = NUM_OVERFLOW;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu4fi1(unsigned long *input,  /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            unsigned char *output, /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] > UCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (dvalue > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) (dvalue + .5);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu4fi2(unsigned long *input, /* I - array of values to be converted */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            short *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] > SHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
                output[ii] = (short) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (short) (dvalue + .5);
                else
                    output[ii] = (short) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu4fi4(unsigned long *input, /* I - array of values to be converted */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            INT32BIT *output,  /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 2147483648. && sizeof(long) == 4)
    {       
        /* Instead of subtracting 2147483648, it is more efficient */
        /* to just flip the sign bit with the XOR operator */

        for (ii = 0; ii < ntodo; ii++)
             output[ii] =  ( *(long *) &input[ii] ) ^ 0x80000000;
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] > INT32_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
                output[ii] = input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (INT32BIT) (dvalue + .5);
                else
                    output[ii] = (INT32BIT) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu4fi8(unsigned long *input,  /* I - array of values to be converted  */
            long ntodo,             /* I - number of elements in the array  */
            double scale,           /* I - FITS TSCALn or BSCALE value      */
            double zero,            /* I - FITS TZEROn or BZERO  value      */
            LONGLONG *output,       /* O - output array of converted values */
            int *status)            /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero ==  9223372036854775808.)
    {       
        /* Writing to unsigned long long column. */
        /* Instead of subtracting 9223372036854775808, it is more efficient */
        /* and more precise to just flip the sign bit with the XOR operator */

        /* no need to check range limits because all unsigned long values */
	/* are valid ULONGLONG values. */

        for (ii = 0; ii < ntodo; ii++) {
             output[ii] =  ((LONGLONG) input[ii]) ^ 0x8000000000000000;
        }
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (dvalue > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (LONGLONG) (dvalue + .5);
                else
                    output[ii] = (LONGLONG) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu4fr4(unsigned long *input, /* I - array of values to be converted */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            float *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (float) ((input[ii] - zero) / scale);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu4fr8(unsigned long *input, /* I - array of values to be converted */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            double *output,    /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (input[ii] - zero) / scale;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu4fstr(unsigned long *input, /* I - array of values to be converted */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            char *cform,       /* I - format for output string values  */
            long twidth,       /* I - width of each field, in chars    */
            char *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do scaling if required.
*/
{
    long ii;
    double dvalue;
    char *cptr;
    
    cptr = output;


    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
           sprintf(output, cform, (double) input[ii]);
           output += twidth;

           if (*output)  /* if this char != \0, then overflow occurred */
              *status = OVERFLOW_ERR;
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
          dvalue = (input[ii] - zero) / scale;
          sprintf(output, cform, dvalue);
          output += twidth;

          if (*output)  /* if this char != \0, then overflow occurred */
            *status = OVERFLOW_ERR;
        }
    }

    /* replace any commas with periods (e.g., in French locale) */
    while ((cptr = strchr(cptr, ','))) *cptr = '.';
    
    return(*status);
}

/* ======================================================================== */
/*      the following routines support the 'unsigned long long' data type            */
/* ======================================================================== */

/*--------------------------------------------------------------------------*/
int ffpprujj( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            ULONGLONG *array,    /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;
    unsigned long nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        ffpmsg("writing TULONGLONG to compressed image is not supported");

        return(*status = DATA_COMPRESSION_ERR);
    }

    row=maxvalue(1,group);

    ffpclujj(fptr, 2, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppnujj( fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
            ULONGLONG *array,    /* I - array of values that are written        */
            ULONGLONG  nulval,    /* I - undefined pixel value                   */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).  Any array values
  that are equal to the value of nulval will be replaced with the null
  pixel value that is appropriate for this column.
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        ffpmsg("writing TULONGLONG to compressed image is not supported");

        return(*status = DATA_COMPRESSION_ERR);
    }

    row=maxvalue(1,group);

    ffpcnujj(fptr, 2, row, firstelem, nelem, array, nulval, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp2dujj(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)           */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           ULONGLONG  *array,     /* I - array to be written                  */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    /* call the 3D writing routine, with the 3rd dimension = 1 */

    ffp3dujj(fptr, group, ncols, naxis2, naxis1, naxis2, 1, array, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp3dujj(fitsfile *fptr,   /* I - FITS file pointer                    */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  nrows,      /* I - number of rows in each plane of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  naxis3,     /* I - FITS image NAXIS3 value               */
           ULONGLONG  *array,    /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 3-D cube of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    long tablerow, ii, jj;
    long fpixel[3]= {1,1,1}, lpixel[3];
    LONGLONG nfits, narray;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
           
    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        ffpmsg("writing TULONGLONG to compressed image is not supported");

        return(*status = DATA_COMPRESSION_ERR);
    }

    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
      /* all the image pixels are contiguous, so write all at once */
      ffpclujj(fptr, 2, tablerow, 1L, naxis1 * naxis2 * naxis3, array, status);
      return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to write to */
    narray = 0;  /* next pixel in input array to be written */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* writing naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffpclujj(fptr, 2, tablerow, nfits, naxis1,&array[narray],status) > 0)
         return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpssujj(fitsfile *fptr,   /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)           */
           long  naxis,      /* I - number of data axes in array            */
           long  *naxes,     /* I - size of each FITS axis                  */
           long  *fpixel,    /* I - 1st pixel in each axis to write (1=1st) */
           long  *lpixel,    /* I - last pixel in each axis to write        */
           ULONGLONG *array,      /* I - array to be written                     */
           int  *status)     /* IO - error status                           */
/*
  Write a subsection of pixels to the primary array or image.
  A subsection is defined to be any contiguous rectangular
  array of pixels within the n-dimensional FITS data file.
  Data conversion and scaling will be performed if necessary 
  (e.g, if the datatype of the FITS array is not the same as
  the array being written).
*/
{
    long tablerow;
    LONGLONG fpix[7], dimen[7], astart, pstart;
    LONGLONG off2, off3, off4, off5, off6, off7;
    LONGLONG st10, st20, st30, st40, st50, st60, st70;
    LONGLONG st1, st2, st3, st4, st5, st6, st7;
    long ii, i1, i2, i3, i4, i5, i6, i7, irange[7];

    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        ffpmsg("writing TULONGLONG to compressed image is not supported");

        return(*status = DATA_COMPRESSION_ERR);
    }

    if (naxis < 1 || naxis > 7)
      return(*status = BAD_DIMEN);

    tablerow=maxvalue(1,group);

     /* calculate the size and number of loops to perform in each dimension */
    for (ii = 0; ii < 7; ii++)
    {
      fpix[ii]=1;
      irange[ii]=1;
      dimen[ii]=1;
    }

    for (ii = 0; ii < naxis; ii++)
    {    
      fpix[ii]=fpixel[ii];
      irange[ii]=lpixel[ii]-fpixel[ii]+1;
      dimen[ii]=naxes[ii];
    }

    i1=irange[0];

    /* compute the pixel offset between each dimension */
    off2 =     dimen[0];
    off3 = off2 * dimen[1];
    off4 = off3 * dimen[2];
    off5 = off4 * dimen[3];
    off6 = off5 * dimen[4];
    off7 = off6 * dimen[5];

    st10 = fpix[0];
    st20 = (fpix[1] - 1) * off2;
    st30 = (fpix[2] - 1) * off3;
    st40 = (fpix[3] - 1) * off4;
    st50 = (fpix[4] - 1) * off5;
    st60 = (fpix[5] - 1) * off6;
    st70 = (fpix[6] - 1) * off7;

    /* store the initial offset in each dimension */
    st1 = st10;
    st2 = st20;
    st3 = st30;
    st4 = st40;
    st5 = st50;
    st6 = st60;
    st7 = st70;

    astart = 0;

    for (i7 = 0; i7 < irange[6]; i7++)
    {
     for (i6 = 0; i6 < irange[5]; i6++)
     {
      for (i5 = 0; i5 < irange[4]; i5++)
      {
       for (i4 = 0; i4 < irange[3]; i4++)
       {
        for (i3 = 0; i3 < irange[2]; i3++)
        {
         pstart = st1 + st2 + st3 + st4 + st5 + st6 + st7;

         for (i2 = 0; i2 < irange[1]; i2++)
         {
           if (ffpclujj(fptr, 2, tablerow, pstart, i1, &array[astart],
              status) > 0)
              return(*status);

           astart += i1;
           pstart += off2;
         }
         st2 = st20;
         st3 = st3+off3;    
        }
        st3 = st30;
        st4 = st4+off4;
       }
       st4 = st40;
       st5 = st5+off5;
      }
      st5 = st50;
      st6 = st6+off6;
     }
     st6 = st60;
     st7 = st7+off7;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpgpujj( fitsfile *fptr,   /* I - FITS file pointer                    */
            long  group,      /* I - group to write(1 = 1st group)          */
            long  firstelem,  /* I - first vector element to write(1 = 1st) */
            long  nelem,      /* I - number of values to write              */
            ULONGLONG  *array,     /* I - array of values that are written  */
            int  *status)     /* IO - error status                          */
/*
  Write an array of group parameters to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffpclujj(fptr, 1L, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpclujj( fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            ULONGLONG  *array,    /* I - array of values to write                */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    int tcode, maxelem, hdutype;
    long twidth, incre;
    long ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull;
    double scale, zero;
    char tform[20], cform[20];
    char message[FLEN_ERRMSG];

    char snull[20];   /*  the FITS null value  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    buffer = cbuff;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

    if (tcode == TSTRING)   
         ffcfmt(tform, cform);     /* derive C format for writing strings */

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*  First call the ffXXfYY routine to  (1) convert the datatype        */
    /*  if necessary, and (2) scale the values by the FITS TSCALn and      */
    /*  TZEROn linear scaling parameters into a temporary buffer.          */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
        /* limit the number of pixels to process a one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, (repeat - elemnum));

        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);

        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TLONGLONG):

                ffu8fi8(&array[next], ntodo, scale, zero,
                        (LONGLONG *) buffer, status);
                ffpi8b(fptr, ntodo, incre, (long *) buffer, status);
                break;

            case (TLONG):

                ffu8fi4(&array[next], ntodo, scale, zero,
                      (INT32BIT *) buffer, status);
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) buffer, status);
                break;

            case (TBYTE):
 
                ffu8fi1(&array[next], ntodo, scale, zero,
                        (unsigned char *) buffer, status);
                ffpi1b(fptr, ntodo, incre, (unsigned char *) buffer, status);
                break;

            case (TSHORT):

                ffu8fi2(&array[next], ntodo, scale, zero,
                        (short *) buffer, status);
                ffpi2b(fptr, ntodo, incre, (short *) buffer, status);
                break;

            case (TFLOAT):

                ffu8fr4(&array[next], ntodo, scale, zero,
                        (float *) buffer, status);
                ffpr4b(fptr, ntodo, incre, (float *) buffer, status);
                break;

            case (TDOUBLE):
                ffu8fr8(&array[next], ntodo, scale, zero,
                       (double *) buffer, status);
                ffpr8b(fptr, ntodo, incre, (double *) buffer, status);
                break;

            case (TSTRING):  /* numerical column in an ASCII table */

                if (cform[1] != 's')  /*  "%s" format is a string */
                {
                  ffu8fstr(&array[next], ntodo, scale, zero, cform,
                          twidth, (char *) buffer, status);

                  if (incre == twidth)    /* contiguous bytes */
                     ffpbyt(fptr, ntodo * twidth, buffer, status);
                  else
                     ffpbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                            status);

                  break;
                }
                /* can't write to string column, so fall thru to default: */

            default:  /*  error trap  */
                snprintf(message, FLEN_ERRMSG,
                     "Cannot write numbers to column %d which has format %s",
                      colnum,tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
          snprintf(message, FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpcluj).",
              (double) (next+1), (double) (next+ntodo));
          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while writing FITS data.");
        *status = NUM_OVERFLOW;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcnujj( fitsfile *fptr,  /* I - FITS file pointer                     */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
            ULONGLONG *array,    /* I - array of values to write                */
            ULONGLONG nulvalue,  /* I - value used to flag undefined pixels     */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels equal to the value of nulvalue will be replaced by the appropriate
  null value in the output FITS file. 

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode, overflow = 0;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    /* if variable length array, first write the whole input vector, 
       then go back and fill in the nulls */
    if (tcode < 0) {
      if (ffpclujj(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0) {
        if (*status == NUM_OVERFLOW) 
	{
	  /* ignore overflows, which are possibly the null pixel values */
	  /*  overflow = 1;   */
	  *status = 0;
	} else { 
          return(*status);
	}
      }
    }

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (ffpclu(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood +1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (tcode > 0) {  /* variable length arrays have already been written */
              if (ffpclujj(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0) {
		if (*status == NUM_OVERFLOW) 
		{
		  overflow = 1;
		  *status = 0;
		} else { 
                  return(*status);
		}
	      }
	    }
            ngood=0;
         }

         nbad = nbad +1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      if (tcode > 0) {  /* variable length arrays have already been written */
        ffpclujj(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
      }
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpclu(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    if (*status <= 0) {
      if (overflow) {
        *status = NUM_OVERFLOW;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu8fi1(ULONGLONG *input,      /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            unsigned char *output, /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] > UCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (dvalue > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) (dvalue + .5);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu8fi2(ULONGLONG *input,  /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            short *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] > SHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
                output[ii] = (short) input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (short) (dvalue + .5);
                else
                    output[ii] = (short) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu8fi4(ULONGLONG *input,  /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            INT32BIT *output,  /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] > INT32_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
                output[ii] = input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (INT32BIT) (dvalue + .5);
                else
                    output[ii] = (INT32BIT) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu8fi8(ULONGLONG *input,       /* I - array of values to be converted  */
            long ntodo,             /* I - number of elements in the array  */
            double scale,           /* I - FITS TSCALn or BSCALE value      */
            double zero,            /* I - FITS TZEROn or BZERO  value      */
            LONGLONG *output,       /* O - output array of converted values */
            int *status)            /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero ==  9223372036854775808.)
    {       
        /* Writing to unsigned long long column. */
        /* Instead of subtracting 9223372036854775808, it is more efficient */
        /* and more precise to just flip the sign bit with the XOR operator */

        /* no need to check range limits because all input values */
	/* are valid ULONGLONG values. */

        for (ii = 0; ii < ntodo; ii++) {
             output[ii] =  ((LONGLONG) input[ii]) ^ 0x8000000000000000;
        }
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++) {
            if (input[ii] > LONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
	        output[ii] = input[ii];
	    }
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (dvalue > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (LONGLONG) (dvalue + .5);
                else
                    output[ii] = (LONGLONG) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu8fr4(ULONGLONG *input , /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            float *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (float) ((input[ii] - zero) / scale);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu8fr8(ULONGLONG *input,  /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            double *output,    /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (input[ii] - zero) / scale;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu8fstr(ULONGLONG *input, /* I - array of values to be converted */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            char *cform,       /* I - format for output string values  */
            long twidth,       /* I - width of each field, in chars    */
            char *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do scaling if required.
*/
{
    long ii;
    double dvalue;
    char *cptr;
    
    cptr = output;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
           sprintf(output, cform, (double) input[ii]);
           output += twidth;

           if (*output)  /* if this char != \0, then overflow occurred */
              *status = OVERFLOW_ERR;
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
          dvalue = (input[ii] - zero) / scale;
          sprintf(output, cform, dvalue);
          output += twidth;

          if (*output)  /* if this char != \0, then overflow occurred */
            *status = OVERFLOW_ERR;
        }
    }

    /* replace any commas with periods (e.g., in French locale) */
    while ((cptr = strchr(cptr, ','))) *cptr = '.';
    
    return(*status);
}
cfitsio-3.47/putcoluk.c0000644000225700000360000010550513464573432014430 0ustar  cagordonlhea/*  This file, putcolk.c, contains routines that write data elements to    */
/*  a FITS image or table, with 'unsigned int' datatype.                   */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffppruk(fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
   unsigned int   *array,    /* I - array of values that are written        */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;
    unsigned int nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_pixels(fptr, TUINT, firstelem, nelem,
            0, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcluk(fptr, 2, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffppnuk(fitsfile *fptr,  /* I - FITS file pointer                       */
            long  group,     /* I - group to write(1 = 1st group)           */
            LONGLONG  firstelem, /* I - first vector element to write(1 = 1st)  */
            LONGLONG  nelem,     /* I - number of values to write               */
   unsigned int   *array,    /* I - array of values that are written        */
   unsigned int   nulval,    /* I - undefined pixel value                   */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).  Any array values
  that are equal to the value of nulval will be replaced with the null
  pixel value that is appropriate for this column.
*/
{
    long row;
    unsigned int nullvalue;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        nullvalue = nulval;  /* set local variable */
        fits_write_compressed_pixels(fptr, TUINT, firstelem, nelem,
            1, array, &nullvalue, status);
        return(*status);
    }

    row=maxvalue(1,group);

    ffpcnuk(fptr, 2, row, firstelem, nelem, array, nulval, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp2duk(fitsfile *fptr,  /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
  unsigned int   *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 2-D array of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    /* call the 3D writing routine, with the 3rd dimension = 1 */

    ffp3duk(fptr, group, ncols, naxis2, naxis1, naxis2, 1, array, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffp3duk(fitsfile *fptr,  /* I - FITS file pointer                     */
           long  group,      /* I - group to write(1 = 1st group)         */
           LONGLONG  ncols,      /* I - number of pixels in each row of array */
           LONGLONG  nrows,      /* I - number of rows in each plane of array */
           LONGLONG  naxis1,     /* I - FITS image NAXIS1 value               */
           LONGLONG  naxis2,     /* I - FITS image NAXIS2 value               */
           LONGLONG  naxis3,     /* I - FITS image NAXIS3 value               */
  unsigned int   *array,     /* I - array to be written                   */
           int  *status)     /* IO - error status                         */
/*
  Write an entire 3-D cube of values to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of the
  FITS array is not the same as the array being written).
*/
{
    long tablerow, ii, jj;
    long fpixel[3]= {1,1,1}, lpixel[3];
    LONGLONG nfits, narray;
    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */
           
    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */
        lpixel[0] = (long) ncols;
        lpixel[1] = (long) nrows;
        lpixel[2] = (long) naxis3;
       
        fits_write_compressed_img(fptr, TUINT, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    tablerow=maxvalue(1,group);

    if (ncols == naxis1 && nrows == naxis2)  /* arrays have same size? */
    {
      /* all the image pixels are contiguous, so write all at once */
      ffpcluk(fptr, 2, tablerow, 1L, naxis1 * naxis2 * naxis3, array, status);
      return(*status);
    }

    if (ncols < naxis1 || nrows < naxis2)
       return(*status = BAD_DIMEN);

    nfits = 1;   /* next pixel in FITS image to write to */
    narray = 0;  /* next pixel in input array to be written */

    /* loop over naxis3 planes in the data cube */
    for (jj = 0; jj < naxis3; jj++)
    {
      /* loop over the naxis2 rows in the FITS image, */
      /* writing naxis1 pixels to each row            */

      for (ii = 0; ii < naxis2; ii++)
      {
       if (ffpcluk(fptr, 2, tablerow, nfits, naxis1,&array[narray],status) > 0)
         return(*status);

       nfits += naxis1;
       narray += ncols;
      }
      narray += (nrows - naxis2) * ncols;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpssuk(fitsfile *fptr,  /* I - FITS file pointer                       */
           long  group,      /* I - group to write(1 = 1st group)           */
           long  naxis,      /* I - number of data axes in array            */
           long  *naxes,     /* I - size of each FITS axis                  */
           long  *fpixel,    /* I - 1st pixel in each axis to write (1=1st) */
           long  *lpixel,    /* I - last pixel in each axis to write        */
  unsigned int  *array,      /* I - array to be written                     */
           int  *status)     /* IO - error status                           */
/*
  Write a subsection of pixels to the primary array or image.
  A subsection is defined to be any contiguous rectangular
  array of pixels within the n-dimensional FITS data file.
  Data conversion and scaling will be performed if necessary 
  (e.g, if the datatype of the FITS array is not the same as
  the array being written).
*/
{
    long tablerow;
    LONGLONG fpix[7], dimen[7], astart, pstart;
    LONGLONG off2, off3, off4, off5, off6, off7;
    LONGLONG st10, st20, st30, st40, st50, st60, st70;
    LONGLONG st1, st2, st3, st4, st5, st6, st7;
    long ii, i1, i2, i3, i4, i5, i6, i7, irange[7];

    if (*status > 0)
        return(*status);

    if (fits_is_compressed_image(fptr, status))
    {
        /* this is a compressed image in a binary table */

        fits_write_compressed_img(fptr, TUINT, fpixel, lpixel,
            0,  array, NULL, status);
    
        return(*status);
    }

    if (naxis < 1 || naxis > 7)
      return(*status = BAD_DIMEN);

    tablerow=maxvalue(1,group);

     /* calculate the size and number of loops to perform in each dimension */
    for (ii = 0; ii < 7; ii++)
    {
      fpix[ii]=1;
      irange[ii]=1;
      dimen[ii]=1;
    }

    for (ii = 0; ii < naxis; ii++)
    {    
      fpix[ii]=fpixel[ii];
      irange[ii]=lpixel[ii]-fpixel[ii]+1;
      dimen[ii]=naxes[ii];
    }

    i1=irange[0];

    /* compute the pixel offset between each dimension */
    off2 =     dimen[0];
    off3 = off2 * dimen[1];
    off4 = off3 * dimen[2];
    off5 = off4 * dimen[3];
    off6 = off5 * dimen[4];
    off7 = off6 * dimen[5];

    st10 = fpix[0];
    st20 = (fpix[1] - 1) * off2;
    st30 = (fpix[2] - 1) * off3;
    st40 = (fpix[3] - 1) * off4;
    st50 = (fpix[4] - 1) * off5;
    st60 = (fpix[5] - 1) * off6;
    st70 = (fpix[6] - 1) * off7;

    /* store the initial offset in each dimension */
    st1 = st10;
    st2 = st20;
    st3 = st30;
    st4 = st40;
    st5 = st50;
    st6 = st60;
    st7 = st70;

    astart = 0;

    for (i7 = 0; i7 < irange[6]; i7++)
    {
     for (i6 = 0; i6 < irange[5]; i6++)
     {
      for (i5 = 0; i5 < irange[4]; i5++)
      {
       for (i4 = 0; i4 < irange[3]; i4++)
       {
        for (i3 = 0; i3 < irange[2]; i3++)
        {
         pstart = st1 + st2 + st3 + st4 + st5 + st6 + st7;

         for (i2 = 0; i2 < irange[1]; i2++)
         {
           if (ffpcluk(fptr, 2, tablerow, pstart, i1, &array[astart],
              status) > 0)
              return(*status);

           astart += i1;
           pstart += off2;
         }
         st2 = st20;
         st3 = st3+off3;    
        }
        st3 = st30;
        st4 = st4+off4;
       }
       st4 = st40;
       st5 = st5+off5;
      }
      st5 = st50;
      st6 = st6+off6;
     }
     st6 = st60;
     st7 = st7+off7;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpgpuk(fitsfile *fptr,   /* I - FITS file pointer                      */
            long  group,      /* I - group to write(1 = 1st group)          */
            long  firstelem,  /* I - first vector element to write(1 = 1st) */
            long  nelem,      /* I - number of values to write              */
   unsigned int   *array,     /* I - array of values that are written       */
            int  *status)     /* IO - error status                          */
/*
  Write an array of group parameters to the primary array. Data conversion
  and scaling will be performed if necessary (e.g, if the datatype of
  the FITS array is not the same as the array being written).
*/
{
    long row;

    /*
      the primary array is represented as a binary table:
      each group of the primary array is a row in the table,
      where the first column contains the group parameters
      and the second column contains the image itself.
    */

    row=maxvalue(1,group);

    ffpcluk(fptr, 1L, row, firstelem, nelem, array, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcluk(fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
   unsigned int   *array,    /* I - array of values to write                */
            int  *status)    /* IO - error status                           */
/*
  Write an array of values to a column in the current FITS HDU.
  The column number may refer to a real column in an ASCII or binary table, 
  or it may refer to a virtual column in a 1 or more grouped FITS primary
  array.  FITSIO treats a primary array as a binary table
  with 2 vector columns: the first column contains the group parameters (often
  with length = 0) and the second column contains the array of image pixels.
  Each row of the table represents a group in the case of multigroup FITS
  images.

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary.
*/
{
    int tcode, maxelem, hdutype;
    long twidth, incre;
    long ntodo;
    LONGLONG repeat, startpos, elemnum, wrtptr, rowlen, rownum, remain, next, tnull;
    double scale, zero;
    char tform[20], cform[20];
    char message[FLEN_ERRMSG];

    char snull[20];   /*  the FITS null value  */

    double cbuff[DBUFFSIZE / sizeof(double)]; /* align cbuff on word boundary */
    void *buffer;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* call the 'short' or 'long' version of this routine, if possible */
    if (sizeof(int) == sizeof(short))
        ffpclui(fptr, colnum, firstrow, firstelem, nelem, 
              (unsigned short *) array, status);
    else if (sizeof(int) == sizeof(long))
        ffpcluj(fptr, colnum, firstrow, firstelem, nelem, 
              (unsigned long *) array, status);
    else
    {
    /*
      This is a special case: sizeof(int) is not equal to sizeof(short) or
      sizeof(long).  This occurs on Alpha OSF systems where short = 2 bytes,
      int = 4 bytes, and long = 8 bytes.
    */

    buffer = cbuff;

    /*---------------------------------------------------*/
    /*  Check input and get parameters about the column: */
    /*---------------------------------------------------*/
    if (ffgcprll( fptr, colnum, firstrow, firstelem, nelem, 1, &scale, &zero,
        tform, &twidth, &tcode, &maxelem, &startpos,  &elemnum, &incre,
        &repeat, &rowlen, &hdutype, &tnull, snull, status) > 0)
        return(*status);

    if (tcode == TSTRING)   
         ffcfmt(tform, cform);     /* derive C format for writing strings */

    /*---------------------------------------------------------------------*/
    /*  Now write the pixels to the FITS column.                           */
    /*  First call the ffXXfYY routine to  (1) convert the datatype        */
    /*  if necessary, and (2) scale the values by the FITS TSCALn and      */
    /*  TZEROn linear scaling parameters into a temporary buffer.          */
    /*---------------------------------------------------------------------*/
    remain = nelem;           /* remaining number of values to write  */
    next = 0;                 /* next element in array to be written  */
    rownum = 0;               /* row number, relative to firstrow     */

    while (remain)
    {
        /* limit the number of pixels to process a one time to the number that
           will fit in the buffer space or to the number of pixels that remain
           in the current vector, which ever is smaller.
        */
        ntodo = (long) minvalue(remain, maxelem);      
        ntodo = (long) minvalue(ntodo, (repeat - elemnum));

        wrtptr = startpos + ((LONGLONG)rownum * rowlen) + (elemnum * incre);

        ffmbyt(fptr, wrtptr, IGNORE_EOF, status); /* move to write position */

        switch (tcode) 
        {
            case (TLONG):
                /* convert the raw data before writing to FITS file */
                ffuintfi4(&array[next], ntodo, scale, zero,
                        (INT32BIT *) buffer, status);
                ffpi4b(fptr, ntodo, incre, (INT32BIT *) buffer, status);
                break;

            case (TLONGLONG):

                ffuintfi8(&array[next], ntodo, scale, zero,
                        (LONGLONG *) buffer, status);
                ffpi8b(fptr, ntodo, incre, (long *) buffer, status);
                break;

            case (TBYTE):
 
                ffuintfi1(&array[next], ntodo, scale, zero,
                        (unsigned char *) buffer, status);
                ffpi1b(fptr, ntodo, incre, (unsigned char *) buffer, status);
                break;

            case (TSHORT):

                ffuintfi2(&array[next], ntodo, scale, zero,
                        (short *) buffer, status);
                ffpi2b(fptr, ntodo, incre, (short *) buffer, status);
                break;

            case (TFLOAT):

                ffuintfr4(&array[next], ntodo, scale, zero,
                        (float *) buffer, status);
                ffpr4b(fptr, ntodo, incre, (float *) buffer, status);
                break;

            case (TDOUBLE):
                ffuintfr8(&array[next], ntodo, scale, zero,
                       (double *) buffer, status);
                ffpr8b(fptr, ntodo, incre, (double *) buffer, status);
                break;

            case (TSTRING):  /* numerical column in an ASCII table */

                if (cform[1] != 's')  /*  "%s" format is a string */
                {
                  ffuintfstr(&array[next], ntodo, scale, zero, cform,
                          twidth, (char *) buffer, status);

                  if (incre == twidth)    /* contiguous bytes */
                     ffpbyt(fptr, ntodo * twidth, buffer, status);
                  else
                     ffpbytoff(fptr, twidth, ntodo, incre - twidth, buffer,
                            status);

                  break;
                }
                /* can't write to string column, so fall thru to default: */

            default:  /*  error trap  */
                snprintf(message,FLEN_ERRMSG, 
                     "Cannot write numbers to column %d which has format %s",
                      colnum,tform);
                ffpmsg(message);
                if (hdutype == ASCII_TBL)
                    return(*status = BAD_ATABLE_FORMAT);
                else
                    return(*status = BAD_BTABLE_FORMAT);

        } /* End of switch block */

        /*-------------------------*/
        /*  Check for fatal error  */
        /*-------------------------*/
        if (*status > 0)  /* test for error during previous write operation */
        {
          snprintf(message,FLEN_ERRMSG,
          "Error writing elements %.0f thru %.0f of input data array (ffpcluk).",
              (double) (next+1), (double) (next+ntodo));
          ffpmsg(message);
          return(*status);
        }

        /*--------------------------------------------*/
        /*  increment the counters for the next loop  */
        /*--------------------------------------------*/
        remain -= ntodo;
        if (remain)
        {
            next += ntodo;
            elemnum += ntodo;
            if (elemnum == repeat)  /* completed a row; start on next row */
            {
                elemnum = 0;
                rownum++;
            }
        }
    }  /*  End of main while Loop  */


    /*--------------------------------*/
    /*  check for numerical overflow  */
    /*--------------------------------*/
    if (*status == OVERFLOW_ERR)
    {
        ffpmsg(
        "Numerical overflow during type conversion while writing FITS data.");
        *status = NUM_OVERFLOW;
    }

    }   /* end of Dec ALPHA special case */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpcnuk(fitsfile *fptr,  /* I - FITS file pointer                       */
            int  colnum,     /* I - number of column to write (1 = 1st col) */
            LONGLONG  firstrow,  /* I - first row to write (1 = 1st row)        */
            LONGLONG  firstelem, /* I - first vector element to write (1 = 1st) */
            LONGLONG  nelem,     /* I - number of values to write               */
   unsigned int   *array,    /* I - array of values to write                */
   unsigned int    nulvalue, /* I - value used to flag undefined pixels     */
            int  *status)    /* IO - error status                           */
/*
  Write an array of elements to the specified column of a table.  Any input
  pixels equal to the value of nulvalue will be replaced by the appropriate
  null value in the output FITS file. 

  The input array of values will be converted to the datatype of the column 
  and will be inverse-scaled by the FITS TSCALn and TZEROn values if necessary
*/
{
    tcolumn *colptr;
    LONGLONG  ngood = 0, nbad = 0, ii;
    LONGLONG repeat, first, fstelm, fstrow;
    int tcode, overflow = 0;

    if (*status > 0)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
    {
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    }
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
    {
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);
    }

    colptr  = (fptr->Fptr)->tableptr;   /* point to first column */
    colptr += (colnum - 1);     /* offset to correct column structure */

    tcode  = colptr->tdatatype;

    if (tcode > 0)
       repeat = colptr->trepeat;  /* repeat count for this column */
    else
       repeat = firstelem -1 + nelem;  /* variable length arrays */

    /* if variable length array, first write the whole input vector, 
       then go back and fill in the nulls */
    if (tcode < 0) {
      if (ffpcluk(fptr, colnum, firstrow, firstelem, nelem, array, status) > 0) {
        if (*status == NUM_OVERFLOW) 
	{
	  /* ignore overflows, which are possibly the null pixel values */
	  /*  overflow = 1;   */
	  *status = 0;
	} else { 
          return(*status);
	}
      }
    }

    /* absolute element number in the column */
    first = (firstrow - 1) * repeat + firstelem;

    for (ii = 0; ii < nelem; ii++)
    {
      if (array[ii] != nulvalue)  /* is this a good pixel? */
      {
         if (nbad)  /* write previous string of bad pixels */
         {
            fstelm = ii - nbad + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (ffpclu(fptr, colnum, fstrow, fstelm, nbad, status) > 0)
                return(*status);

            nbad=0;
         }

         ngood = ngood +1;  /* the consecutive number of good pixels */
      }
      else
      {
         if (ngood)  /* write previous string of good pixels */
         {
            fstelm = ii - ngood + first;  /* absolute element number */
            fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
            fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

            if (tcode > 0) {  /* variable length arrays have already been written */
              if (ffpcluk(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood],
                status) > 0) {
		if (*status == NUM_OVERFLOW) 
		{
		  overflow = 1;
		  *status = 0;
		} else { 
                  return(*status);
		}
	      }
	    }
            ngood=0;
         }

         nbad = nbad +1;  /* the consecutive number of bad pixels */
      }
    }

    /* finished loop;  now just write the last set of pixels */

    if (ngood)  /* write last string of good pixels */
    {
      fstelm = ii - ngood + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      if (tcode > 0) {  /* variable length arrays have already been written */
        ffpcluk(fptr, colnum, fstrow, fstelm, ngood, &array[ii-ngood], status);
      }
    }
    else if (nbad) /* write last string of bad pixels */
    {
      fstelm = ii - nbad + first;  /* absolute element number */
      fstrow = (fstelm - 1) / repeat + 1;  /* starting row number */
      fstelm = fstelm - (fstrow - 1) * repeat;  /* relative number */

      ffpclu(fptr, colnum, fstrow, fstelm, nbad, status);
    }

    if (*status <= 0) {
      if (overflow) {
        *status = NUM_OVERFLOW;
      }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffuintfi1(unsigned int *input, /* I - array of values to be converted  */
            long ntodo,            /* I - number of elements in the array  */
            double scale,          /* I - FITS TSCALn or BSCALE value      */
            double zero,           /* I - FITS TZEROn or BZERO  value      */
            unsigned char *output, /* O - output array of converted values */
            int *status)           /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] > UCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DUCHAR_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = 0;
            }
            else if (dvalue > DUCHAR_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = UCHAR_MAX;
            }
            else
                output[ii] = (unsigned char) (dvalue + .5);
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffuintfi2(unsigned int *input,  /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            short *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] > SHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
                output[ii] = input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DSHRT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MIN;
            }
            else if (dvalue > DSHRT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = SHRT_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (short) (dvalue + .5);
                else
                    output[ii] = (short) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffuintfi4(unsigned int *input,  /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            INT32BIT *output,  /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero == 2147483648.)
    {       
        /* Instead of subtracting 2147483648, it is more efficient */
        /* to just flip the sign bit with the XOR operator */

        for (ii = 0; ii < ntodo; ii++)
             output[ii] =  ( *(int *) &input[ii] ) ^ 0x80000000;
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
            if (input[ii] > INT32_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
                output[ii] = input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DINT_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MIN;
            }
            else if (dvalue > DINT_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = INT32_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (INT32BIT) (dvalue + .5);
                else
                    output[ii] = (INT32BIT) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffuintfi8(unsigned int *input,  /* I - array of values to be converted  */
            long ntodo,             /* I - number of elements in the array  */
            double scale,           /* I - FITS TSCALn or BSCALE value      */
            double zero,            /* I - FITS TZEROn or BZERO  value      */
            LONGLONG *output,       /* O - output array of converted values */
            int *status)            /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required
*/
{
    long ii;
    double dvalue;

    if (scale == 1. && zero ==  9223372036854775808.)
    {       
        /* Writing to unsigned long long column. */
        /* Instead of subtracting 9223372036854775808, it is more efficient */
        /* and more precise to just flip the sign bit with the XOR operator */

        /* no need to check range limits because all unsigned int values */
	/* are valid ULONGLONG values. */

        for (ii = 0; ii < ntodo; ii++) {
             output[ii] =  ((LONGLONG) input[ii]) ^ 0x8000000000000000;
        }
    }
    else if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++) {
                output[ii] = input[ii];
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
            dvalue = (input[ii] - zero) / scale;

            if (dvalue < DLONGLONG_MIN)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MIN;
            }
            else if (dvalue > DLONGLONG_MAX)
            {
                *status = OVERFLOW_ERR;
                output[ii] = LONGLONG_MAX;
            }
            else
            {
                if (dvalue >= 0)
                    output[ii] = (LONGLONG) (dvalue + .5);
                else
                    output[ii] = (LONGLONG) (dvalue - .5);
            }
        }
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffuintfr4(unsigned int *input,  /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            float *output,     /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (float) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (float) ((input[ii] - zero) / scale);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffuintfr8(unsigned int *input,  /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            double *output,    /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do datatype conversion and scaling if required.
*/
{
    long ii;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
                output[ii] = (double) input[ii];
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
            output[ii] = (input[ii] - zero) / scale;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffuintfstr(unsigned int *input, /* I - array of values to be converted  */
            long ntodo,        /* I - number of elements in the array  */
            double scale,      /* I - FITS TSCALn or BSCALE value      */
            double zero,       /* I - FITS TZEROn or BZERO  value      */
            char *cform,       /* I - format for output string values  */
            long twidth,       /* I - width of each field, in chars    */
            char *output,      /* O - output array of converted values */
            int *status)       /* IO - error status                    */
/*
  Copy input to output prior to writing output to a FITS file.
  Do scaling if required.
*/
{
    long ii;
    double dvalue;
    char *cptr;
    
    cptr = output;

    if (scale == 1. && zero == 0.)
    {       
        for (ii = 0; ii < ntodo; ii++)
        {
           sprintf(output, cform, (double) input[ii]);
           output += twidth;

           if (*output)  /* if this char != \0, then overflow occurred */
              *status = OVERFLOW_ERR;
        }
    }
    else
    {
        for (ii = 0; ii < ntodo; ii++)
        {
          dvalue = (input[ii] - zero) / scale;
          sprintf(output, cform, dvalue);
          output += twidth;

          if (*output)  /* if this char != \0, then overflow occurred */
            *status = OVERFLOW_ERR;
        }
    }

    /* replace any commas with periods (e.g., in French locale) */
    while ((cptr = strchr(cptr, ','))) *cptr = '.';
    
    return(*status);
}
cfitsio-3.47/putkey.c0000644000225700000360000034056113464573432014106 0ustar  cagordonlhea/*  This file, putkey.c, contains routines that write keywords to          */
/*  a FITS header.                                                         */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include 
#include 
#include 
/* stddef.h is apparently needed to define size_t */
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int ffcrim(fitsfile *fptr,      /* I - FITS file pointer           */
           int bitpix,          /* I - bits per pixel              */
           int naxis,           /* I - number of axes in the array */
           long *naxes,         /* I - size of each axis           */
           int *status)         /* IO - error status               */
/*
  create an IMAGE extension following the current HDU. If the
  current HDU is empty (contains no header keywords), then simply
  write the required image (or primary array) keywords to the current
  HDU. 
*/
{
    if (*status > 0)
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    /* create new extension if current header is not empty */
    if ((fptr->Fptr)->headend != (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] )
        ffcrhd(fptr, status);

    /* write the required header keywords */
    ffphpr(fptr, TRUE, bitpix, naxis, naxes, 0, 1, TRUE, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffcrimll(fitsfile *fptr,    /* I - FITS file pointer           */
           int bitpix,          /* I - bits per pixel              */
           int naxis,           /* I - number of axes in the array */
           LONGLONG *naxes,     /* I - size of each axis           */
           int *status)         /* IO - error status               */
/*
  create an IMAGE extension following the current HDU. If the
  current HDU is empty (contains no header keywords), then simply
  write the required image (or primary array) keywords to the current
  HDU. 
*/
{
    if (*status > 0)
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    /* create new extension if current header is not empty */
    if ((fptr->Fptr)->headend != (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] )
        ffcrhd(fptr, status);

    /* write the required header keywords */
    ffphprll(fptr, TRUE, bitpix, naxis, naxes, 0, 1, TRUE, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffcrtb(fitsfile *fptr,  /* I - FITS file pointer                        */
           int tbltype,     /* I - type of table to create                  */
           LONGLONG naxis2, /* I - number of rows in the table              */
           int tfields,     /* I - number of columns in the table           */
           char **ttype,    /* I - name of each column                      */
           char **tform,    /* I - value of TFORMn keyword for each column  */
           char **tunit,    /* I - value of TUNITn keyword for each column  */
           const char *extnm, /* I - value of EXTNAME keyword, if any         */
           int *status)     /* IO - error status                            */
/*
  Create a table extension in a FITS file. 
*/
{
    LONGLONG naxis1 = 0;
    long *tbcol = 0;

    if (*status > 0)
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    /* create new extension if current header is not empty */
    if ((fptr->Fptr)->headend != (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] )
        ffcrhd(fptr, status);

    if ((fptr->Fptr)->curhdu == 0)  /* have to create dummy primary array */
    {
       ffcrim(fptr, 16, 0, tbcol, status);
       ffcrhd(fptr, status);
    }
    
    if (tbltype == BINARY_TBL)
    {
      /* write the required header keywords. This will write PCOUNT = 0 */
      ffphbn(fptr, naxis2, tfields, ttype, tform, tunit, extnm, 0, status);
    }
    else if (tbltype == ASCII_TBL)
    {
      /* write the required header keywords */
      /* default values for naxis1 and tbcol will be calculated */
      ffphtb(fptr, naxis1, naxis2, tfields, ttype, tbcol, tform, tunit,
             extnm, status);
    }
    else
      *status = NOT_TABLE;

    return(*status);
}
/*-------------------------------------------------------------------------*/
int ffpktp(fitsfile *fptr,       /* I - FITS file pointer       */
           const char *filename, /* I - name of template file   */
           int *status)          /* IO - error status           */
/*
  read keywords from template file and append to the FITS file
*/
{
    FILE *diskfile;
    char card[FLEN_CARD], template[161];
    char keyname[FLEN_KEYWORD], newname[FLEN_KEYWORD];
    int keytype;
    size_t slen;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    diskfile = fopen(filename,"r"); 
    if (!diskfile)          /* couldn't open file */
    {
            ffpmsg("ffpktp could not open the following template file:");
            ffpmsg(filename);
            return(*status = FILE_NOT_OPENED); 
    }

    while (fgets(template, 160, diskfile) )  /* get next template line */
    {
      template[160] = '\0';      /* make sure string is terminated */
      slen = strlen(template);   /* get string length */
      template[slen - 1] = '\0';  /* over write the 'newline' char */

      if (ffgthd(template, card, &keytype, status) > 0) /* parse template */
         break;

      strncpy(keyname, card, 8);
      keyname[8] = '\0';

      if (keytype == -2)            /* rename the card */
      {
         strncpy(newname, &card[40], 8);
         newname[8] = '\0';

         ffmnam(fptr, keyname, newname, status); 
      }
      else if (keytype == -1)      /* delete the card */
      {
         ffdkey(fptr, keyname, status);
      }
      else if (keytype == 0)       /* update the card */
      {
         ffucrd(fptr, keyname, card, status);
      }
      else if (keytype == 1)      /* append the card */
      {
         ffprec(fptr, card, status);
      }
      else    /* END card; stop here */
      {
         break; 
      }
    }

    fclose(diskfile);   /* close the template file */
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpky( fitsfile *fptr,     /* I - FITS file pointer        */
           int  datatype,      /* I - datatype of the value    */
           const char *keyname,/* I - name of keyword to write */
           void *value,        /* I - keyword value            */
           const char *comm,   /* I - keyword comment          */
           int  *status)       /* IO - error status            */
/*
  Write (put) the keyword, value and comment into the FITS header.
  Writes a keyword value with the datatype specified by the 2nd argument.
*/
{
    char errmsg[FLEN_ERRMSG];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (datatype == TSTRING)
    {
        ffpkys(fptr, keyname, (char *) value, comm, status);
    }
    else if (datatype == TBYTE)
    {
        ffpkyj(fptr, keyname, (LONGLONG) *(unsigned char *) value, comm, status);
    }
    else if (datatype == TSBYTE)
    {
        ffpkyj(fptr, keyname, (LONGLONG) *(signed char *) value, comm, status);
    }
    else if (datatype == TUSHORT)
    {
        ffpkyj(fptr, keyname, (LONGLONG) *(unsigned short *) value, comm, status);
    }
    else if (datatype == TSHORT)
    {
        ffpkyj(fptr, keyname, (LONGLONG) *(short *) value, comm, status);
    }
    else if (datatype == TUINT)
    {
        ffpkyg(fptr, keyname, (double) *(unsigned int *) value, 0,
               comm, status);
    }
    else if (datatype == TINT)
    {
        ffpkyj(fptr, keyname, (LONGLONG) *(int *) value, comm, status);
    }
    else if (datatype == TLOGICAL)
    {
        ffpkyl(fptr, keyname, *(int *) value, comm, status);
    }
    else if (datatype == TULONG)
    {
        ffpkyuj(fptr, keyname, (ULONGLONG) *(unsigned long *) value,
               comm, status);
    }
    else if (datatype == TULONGLONG)
    {
        ffpkyuj(fptr, keyname, (ULONGLONG) *(ULONGLONG *) value,
               comm, status);
    }
    else if (datatype == TLONG)
    {
        ffpkyj(fptr, keyname, (LONGLONG) *(long *) value, comm, status);
    }
    else if (datatype == TLONGLONG)
    {
        ffpkyj(fptr, keyname, *(LONGLONG *) value, comm, status);
    }
    else if (datatype == TFLOAT)
    {
        ffpkye(fptr, keyname, *(float *) value, -7, comm, status);
    }
    else if (datatype == TDOUBLE)
    {
        ffpkyd(fptr, keyname, *(double *) value, -15, comm, status);
    }
    else if (datatype == TCOMPLEX)
    {
        ffpkyc(fptr, keyname, (float *) value, -7, comm, status);
    }
    else if (datatype == TDBLCOMPLEX)
    {
        ffpkym(fptr, keyname, (double *) value, -15, comm, status);
    }
    else
    {
        snprintf(errmsg, FLEN_ERRMSG,"Bad keyword datatype code: %d (ffpky)", datatype);
        ffpmsg(errmsg);
        *status = BAD_DATATYPE;
    }

    return(*status);
} 
/*-------------------------------------------------------------------------*/
int ffprec(fitsfile *fptr,     /* I - FITS file pointer        */
           const char *card,   /* I - string to be written     */
           int *status)        /* IO - error status            */
/*
  write a keyword record (80 bytes long) to the end of the header
*/
{
    char tcard[FLEN_CARD];
    size_t len, ii;
    long nblocks;
    int keylength;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if ( ((fptr->Fptr)->datastart - (fptr->Fptr)->headend) == 80) /* no room */
    {
        nblocks = 1;
        if (ffiblk(fptr, nblocks, 0, status) > 0) /* insert 2880-byte block */
            return(*status);  
    }

    strncpy(tcard,card,80);
    tcard[80] = '\0';

    len = strlen(tcard);

    /* silently replace any illegal characters with a space */
    for (ii=0; ii < len; ii++)   
        if (tcard[ii] < ' ' || tcard[ii] > 126) tcard[ii] = ' ';

    for (ii=len; ii < 80; ii++)    /* fill card with spaces if necessary */
        tcard[ii] = ' ';

    keylength = strcspn(tcard, "=");   /* support for free-format keywords */
    if (keylength == 80) keylength = 8;
    
    /* test for the common commentary keywords which by definition have 8-char names */
    if ( !fits_strncasecmp( "COMMENT ", tcard, 8) || !fits_strncasecmp( "HISTORY ", tcard, 8) ||
         !fits_strncasecmp( "        ", tcard, 8) || !fits_strncasecmp( "CONTINUE", tcard, 8) )
	 keylength = 8;

    for (ii=0; ii < keylength; ii++)       /* make sure keyword name is uppercase */
        tcard[ii] = toupper(tcard[ii]);

    fftkey(tcard, status);        /* test keyword name contains legal chars */

/*  no need to do this any more, since any illegal characters have been removed
    fftrec(tcard, status);  */        /* test rest of keyword for legal chars */

    ffmbyt(fptr, (fptr->Fptr)->headend, IGNORE_EOF, status); /* move to end */

    ffpbyt(fptr, 80, tcard, status);   /* write the 80 byte card */

    if (*status <= 0)
       (fptr->Fptr)->headend += 80;    /* update end-of-header position */

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkyu( fitsfile *fptr,     /* I - FITS file pointer        */
            const char *keyname,/* I - name of keyword to write */
            const char *comm,   /* I - keyword comment          */
            int  *status)       /* IO - error status            */
/*
  Write (put) a null-valued keyword and comment into the FITS header.  
*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    strcpy(valstring," ");  /* create a dummy value string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword */
    ffprec(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkys( fitsfile *fptr,     /* I - FITS file pointer        */
            const char *keyname,/* I - name of keyword to write */
            const char *value,  /* I - keyword value            */
            const char *comm,   /* I - keyword comment          */
            int  *status)       /* IO - error status            */
/*
  Write (put) the keyword, value and comment into the FITS header.
  The value string will be truncated at 68 characters which is the
  maximum length that will fit on a single FITS keyword.
*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffs2c(value, valstring, status);   /* put quotes around the string */

    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword */
    ffprec(fptr, card, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkls( fitsfile *fptr,     /* I - FITS file pointer        */
            const char *keyname,/* I - name of keyword to write */
            const char *value,  /* I - keyword value            */
            const char *comm,   /* I - keyword comment          */
            int  *status)       /* IO - error status            */
/*
  Write (put) the keyword, value and comment into the FITS header.
  This routine is a modified version of ffpkys which supports the
  HEASARC long string convention and can write arbitrarily long string
  keyword values.  The value is continued over multiple keywords that
  have the name COMTINUE without an equal sign in column 9 of the card.
  This routine also supports simple string keywords which are less than
  69 characters in length.
*/
{
    char valstring[FLEN_CARD];
    char card[FLEN_CARD], tmpkeyname[FLEN_CARD];
    char tstring[FLEN_CARD], *cptr;
    int next, remain, vlen, nquote, nchar, namelen, contin, tstatus = -1;
    int commlen=0, nocomment = 0;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    remain = maxvalue(strlen(value), 1); /* no. of chars to write (at least 1) */  
    if (comm) { 
       commlen = strlen(comm);
       if (commlen > 47) commlen = 47;  /* only guarantee preserving the first 47 characters */
    }

    /* count the number of single quote characters are in the string */
    tstring[0] = '\0';
    strncat(tstring, value, 68); /* copy 1st part of string to temp buff */
    nquote = 0;
    cptr = strchr(tstring, '\'');   /* search for quote character */
    while (cptr)  /* search for quote character */
    {
        nquote++;            /*  increment no. of quote characters  */
        cptr++;              /*  increment pointer to next character */
        cptr = strchr(cptr, '\'');  /* search for another quote char */
    }

    strncpy(tmpkeyname, keyname, 80);
    tmpkeyname[80] = '\0';
    
    cptr = tmpkeyname;
    while(*cptr == ' ')   /* skip over leading spaces in name */
        cptr++;

    /* determine the number of characters that will fit on the line */
    /* Note: each quote character is expanded to 2 quotes */

    namelen = strlen(cptr);
    if (namelen <= 8 && (fftkey(cptr, &tstatus) <= 0) )
    {
        /* This a normal 8-character FITS keyword */
        nchar = 68 - nquote; /*  max of 68 chars fit in a FITS string value */
    }
    else
    {
	   nchar = 80 - nquote - namelen - 5;
    }

    contin = 0;
    next = 0;                  /* pointer to next character to write */

    while (remain > 0)
    {
        tstring[0] = '\0';
        strncat(tstring, &value[next], nchar); /* copy string to temp buff */
        ffs2c(tstring, valstring, status);  /* expand quotes, and put quotes around the string */

        if (remain > nchar)   /* if string is continued, put & as last char */
        {
            vlen = strlen(valstring);
            nchar -= 1;        /* outputting one less character now */

            if (valstring[vlen-2] != '\'')
                valstring[vlen-2] = '&';  /*  over write last char with &  */
            else
            { /* last char was a pair of single quotes, so over write both */
                valstring[vlen-3] = '&';
                valstring[vlen-1] = '\0';
            }
        }

        if (contin)           /* This is a CONTINUEd keyword */
        {
           if (nocomment) {
               ffmkky("CONTINUE", valstring, NULL, card, status); /* make keyword w/o comment */
           } else {
               ffmkky("CONTINUE", valstring, comm, card, status); /* make keyword */
	   }
           strncpy(&card[8], "   ",  2);  /* overwrite the '=' */
        }
        else
        {
           ffmkky(keyname, valstring, comm, card, status);  /* make keyword */
        }

        ffprec(fptr, card, status);  /* write the keyword */

        contin = 1;
        remain -= nchar;
        next  += nchar;
        nocomment = 0;

        if (remain > 0) 
        {
           /* count the number of single quote characters in next section */
           tstring[0] = '\0';
           strncat(tstring, &value[next], 68); /* copy next part of string */
           nquote = 0;
           cptr = strchr(tstring, '\'');   /* search for quote character */
           while (cptr)  /* search for quote character */
           {
               nquote++;            /*  increment no. of quote characters  */
               cptr++;              /*  increment pointer to next character */
               cptr = strchr(cptr, '\'');  /* search for another quote char */
           }
           nchar = 68 - nquote;  /* max number of chars to write this time */
        }

        /* make adjustment if necessary to allow reasonable room for a comment on last CONTINUE card 
	   only need to do this if 
	     a) there is a comment string, and
	     b) the remaining value string characters could all fit on the next CONTINUE card, and
	     c) there is not enough room on the next CONTINUE card for both the remaining value
	        characters, and at least 47 characters of the comment string.
	*/
	
        if (commlen > 0 && remain + nquote < 69 && remain + nquote + commlen > 65) 
	{
            if (nchar > 18) { /* only false if there are a rediculous number of quotes in the string */
	        nchar = remain - 15;  /* force continuation onto another card, so that */
		                      /* there is room for a comment up to 47 chara long */
                nocomment = 1;  /* don't write the comment string this time */
            }
	}
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffplsw( fitsfile *fptr,     /* I - FITS file pointer  */
            int  *status)       /* IO - error status       */
/*
  Write the LONGSTRN keyword and a series of related COMMENT keywords
  which document that this FITS header may contain long string keyword
  values which are continued over multiple keywords using the HEASARC
  long string keyword convention.  If the LONGSTRN keyword already exists
  then this routine simple returns without doing anything.
*/
{
    char valstring[FLEN_VALUE], comm[FLEN_COMMENT];
    int tstatus;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    tstatus = 0;
    if (ffgkys(fptr, "LONGSTRN", valstring, comm, &tstatus) == 0)
        return(*status);     /* keyword already exists, so just return */

    ffpkys(fptr, "LONGSTRN", "OGIP 1.0", 
       "The HEASARC Long String Convention may be used.", status);

    ffpcom(fptr,
    "  This FITS file may contain long string keyword values that are", status);

    ffpcom(fptr,
    "  continued over multiple keywords.  The HEASARC convention uses the &",
    status);

    ffpcom(fptr,
    "  character at the end of each substring which is then continued", status);

    ffpcom(fptr,
    "  on the next keyword which has the name CONTINUE.", status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkyl( fitsfile *fptr,     /* I - FITS file pointer        */
            const char *keyname,/* I - name of keyword to write */
            int  value,         /* I - keyword value            */
            const char *comm,   /* I - keyword comment          */
            int  *status)       /* IO - error status            */
/*
  Write (put) the keyword, value and comment into the FITS header.
  Values equal to 0 will result in a False FITS keyword; any other
  non-zero value will result in a True FITS keyword.
*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffl2c(value, valstring, status);   /* convert to formatted string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffprec(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkyj( fitsfile *fptr,     /* I - FITS file pointer        */
            const char *keyname,/* I - name of keyword to write */
            LONGLONG value,     /* I - keyword value            */
            const char *comm,   /* I - keyword comment          */
            int  *status)       /* IO - error status            */
/*
  Write (put) the keyword, value and comment into the FITS header.
  Writes an integer keyword value.
*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffi2c(value, valstring, status);   /* convert to formatted string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffprec(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkyuj( fitsfile *fptr,     /* I - FITS file pointer        */
            const char *keyname,/* I - name of keyword to write */
            ULONGLONG value,     /* I - keyword value            */
            const char *comm,   /* I - keyword comment          */
            int  *status)       /* IO - error status            */
/*
  Write (put) the keyword, value and comment into the FITS header.
  Writes an integer keyword value.
*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffu2c(value, valstring, status);   /* convert to formatted string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffprec(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkyf( fitsfile *fptr,      /* I - FITS file pointer                   */
            const char  *keyname,/* I - name of keyword to write            */
            float value,         /* I - keyword value                       */
            int   decim,         /* I - number of decimal places to display */
            const char  *comm,   /* I - keyword comment                     */
            int   *status)       /* IO - error status                       */
/*
  Write (put) the keyword, value and comment into the FITS header.
  Writes a fixed float keyword value.
*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffr2f(value, decim, valstring, status);   /* convert to formatted string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffprec(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkye( fitsfile *fptr,      /* I - FITS file pointer                   */
            const char  *keyname,/* I - name of keyword to write            */
            float value,         /* I - keyword value                       */
            int   decim,         /* I - number of decimal places to display */
            const char  *comm,   /* I - keyword comment                     */
            int   *status)       /* IO - error status                       */
/*
  Write (put) the keyword, value and comment into the FITS header.
  Writes an exponential float keyword value.
*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffr2e(value, decim, valstring, status);   /* convert to formatted string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffprec(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkyg( fitsfile *fptr,      /* I - FITS file pointer                   */
            const char  *keyname,/* I - name of keyword to write            */
            double value,        /* I - keyword value                       */
            int   decim,         /* I - number of decimal places to display */
            const char  *comm,   /* I - keyword comment                     */
            int   *status)       /* IO - error status                       */
/*
  Write (put) the keyword, value and comment into the FITS header.
  Writes a fixed double keyword value.*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffd2f(value, decim, valstring, status);  /* convert to formatted string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffprec(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkyd( fitsfile *fptr,      /* I - FITS file pointer                   */
            const char  *keyname,/* I - name of keyword to write            */
            double value,        /* I - keyword value                       */
            int   decim,         /* I - number of decimal places to display */
            const char  *comm,   /* I - keyword comment                     */
            int   *status)       /* IO - error status                       */
/*
  Write (put) the keyword, value and comment into the FITS header.
  Writes an exponential double keyword value.*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffd2e(value, decim, valstring, status);  /* convert to formatted string */
    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffprec(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkyc( fitsfile *fptr,      /* I - FITS file pointer                   */
            const char  *keyname,/* I - name of keyword to write            */
            float *value,        /* I - keyword value (real, imaginary)     */
            int   decim,         /* I - number of decimal places to display */
            const char  *comm,   /* I - keyword comment                     */
            int   *status)       /* IO - error status                       */
/*
  Write (put) the keyword, value and comment into the FITS header.
  Writes an complex float keyword value. Format = (realvalue, imagvalue)
*/
{
    char valstring[FLEN_VALUE], tmpstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    strcpy(valstring, "(" );
    ffr2e(value[0], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring)+strlen(tmpstring)+2 > FLEN_VALUE-1)
    {
       ffpmsg("Error converting complex to string (ffpkyc)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffr2e(value[1], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring)+strlen(tmpstring)+1 > FLEN_VALUE-1)
    {
       ffpmsg("Error converting complex to string (ffpkyc)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ")");

    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffprec(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkym( fitsfile *fptr,      /* I - FITS file pointer                   */
            const char  *keyname,/* I - name of keyword to write            */
            double *value,       /* I - keyword value (real, imaginary)     */
            int   decim,         /* I - number of decimal places to display */
            const char  *comm,   /* I - keyword comment                     */
            int   *status)       /* IO - error status                       */
/*
  Write (put) the keyword, value and comment into the FITS header.
  Writes an complex double keyword value. Format = (realvalue, imagvalue)
*/
{
    char valstring[FLEN_VALUE], tmpstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    strcpy(valstring, "(" );
    ffd2e(value[0], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring)+strlen(tmpstring)+2 > FLEN_VALUE-1)
    {
       ffpmsg("Error converting complex to string (ffpkym)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffd2e(value[1], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring)+strlen(tmpstring)+1 > FLEN_VALUE-1)
    {
       ffpmsg("Error converting complex to string (ffpkym)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ")");

    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffprec(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkfc( fitsfile *fptr,      /* I - FITS file pointer                   */
            const char  *keyname,/* I - name of keyword to write            */
            float *value,        /* I - keyword value (real, imaginary)     */
            int   decim,         /* I - number of decimal places to display */
            const char  *comm,   /* I - keyword comment                     */
            int   *status)       /* IO - error status                       */
/*
  Write (put) the keyword, value and comment into the FITS header.
  Writes an complex float keyword value. Format = (realvalue, imagvalue)
*/
{
    char valstring[FLEN_VALUE], tmpstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    strcpy(valstring, "(" );
    ffr2f(value[0], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring)+strlen(tmpstring)+2 > FLEN_VALUE-1)
    {
       ffpmsg("Error converting complex to string (ffpkfc)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffr2f(value[1], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring)+strlen(tmpstring)+1 > FLEN_VALUE-1)
    {
       ffpmsg("Error converting complex to string (ffpkfc)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ")");

    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffprec(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkfm( fitsfile *fptr,      /* I - FITS file pointer                   */
            const char  *keyname,/* I - name of keyword to write            */
            double *value,       /* I - keyword value (real, imaginary)     */
            int   decim,         /* I - number of decimal places to display */
            const char  *comm,   /* I - keyword comment                     */
            int   *status)       /* IO - error status                       */
/*
  Write (put) the keyword, value and comment into the FITS header.
  Writes an complex double keyword value. Format = (realvalue, imagvalue)
*/
{
    char valstring[FLEN_VALUE], tmpstring[FLEN_VALUE];
    char card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    strcpy(valstring, "(" );
    ffd2f(value[0], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring)+strlen(tmpstring)+2 > FLEN_VALUE-1)
    {
       ffpmsg("Error converting complex to string (ffpkfm)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffd2f(value[1], decim, tmpstring, status); /* convert to string */
    if (strlen(valstring)+strlen(tmpstring)+1 > FLEN_VALUE-1)
    {
       ffpmsg("Error converting complex to string (ffpkfm)");
       return(*status=BAD_F2C);
    }
    strcat(valstring, tmpstring);
    strcat(valstring, ")");

    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffprec(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkyt( fitsfile *fptr,      /* I - FITS file pointer        */
            const char  *keyname,/* I - name of keyword to write */
            long  intval,        /* I - integer part of value    */
            double fraction,     /* I - fractional part of value */
            const char  *comm,   /* I - keyword comment          */
            int   *status)       /* IO - error status            */
/*
  Write (put) a 'triple' precision keyword where the integer and
  fractional parts of the value are passed in separate parameters to
  increase the total amount of numerical precision.
*/
{
    char valstring[FLEN_VALUE];
    char card[FLEN_CARD];
    char fstring[20], *cptr;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (fraction > 1. || fraction < 0.)
    {
        ffpmsg("fraction must be between 0. and 1. (ffpkyt)");
        return(*status = BAD_F2C);
    }

    ffi2c(intval, valstring, status);  /* convert integer to string */
    ffd2f(fraction, 16, fstring, status);  /* convert to 16 decimal string */

    cptr = strchr(fstring, '.');    /* find the decimal point */
    if (strlen(valstring)+strlen(cptr) > FLEN_VALUE-1)
    {
       ffpmsg("converted numerical string too long");
       return(*status=BAD_F2C);
    }
    strcat(valstring, cptr);    /* append the fraction to the integer */

    ffmkky(keyname, valstring, comm, card, status);  /* construct the keyword*/
    ffprec(fptr, card, status);  /* write the keyword*/

    return(*status);
}
/*-----------------------------------------------------------------*/
int ffpcom( fitsfile *fptr,      /* I - FITS file pointer   */
            const char  *comm,   /* I - comment string      */
            int   *status)       /* IO - error status       */
/*
  Write 1 or more COMMENT keywords.  If the comment string is too
  long to fit on a single keyword (72 chars) then it will automatically
  be continued on multiple CONTINUE keywords.
*/
{
    char card[FLEN_CARD];
    int len, ii;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    len = strlen(comm);
    ii = 0;

    for (; len > 0; len -= 72)
    {
        strcpy(card, "COMMENT ");
        strncat(card, &comm[ii], 72);
        ffprec(fptr, card, status);
        ii += 72;
    }

    return(*status);
}
/*-----------------------------------------------------------------*/
int ffphis( fitsfile *fptr,      /* I - FITS file pointer  */
            const char *history, /* I - history string     */
            int   *status)       /* IO - error status      */
/*
  Write 1 or more HISTORY keywords.  If the history string is too
  long to fit on a single keyword (72 chars) then it will automatically
  be continued on multiple HISTORY keywords.
*/
{
    char card[FLEN_CARD];
    int len, ii;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    len = strlen(history);
    ii = 0;

    for (; len > 0; len -= 72)
    {
        strcpy(card, "HISTORY ");
        strncat(card, &history[ii], 72);
        ffprec(fptr, card, status);
        ii += 72;
    }

    return(*status);
}
/*-----------------------------------------------------------------*/
int ffpdat( fitsfile *fptr,      /* I - FITS file pointer  */
            int   *status)       /* IO - error status      */
/*
  Write the DATE keyword into the FITS header.  If the keyword already
  exists then the date will simply be updated in the existing keyword.
*/
{
    int timeref;
    char date[30], tmzone[10], card[FLEN_CARD];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    ffgstm(date, &timeref, status);

    if (timeref)           /* GMT not available on this machine */
        strcpy(tmzone, " Local");    
    else
        strcpy(tmzone, " UT");    

    strcpy(card, "DATE    = '");
    strcat(card, date);
    strcat(card, "' / file creation date (YYYY-MM-DDThh:mm:ss");
    strcat(card, tmzone);
    strcat(card, ")");

    ffucrd(fptr, "DATE", card, status);

    return(*status);
}
/*-------------------------------------------------------------------*/
int ffverifydate(int year,          /* I - year (0 - 9999)           */
                 int month,         /* I - month (1 - 12)            */
                 int day,           /* I - day (1 - 31)              */
                 int   *status)     /* IO - error status             */
/*
  Verify that the date is valid
*/
{
    int ndays[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
    char errmsg[FLEN_ERRMSG];
    

    if (year < 0 || year > 9999)
    {
       snprintf(errmsg, FLEN_ERRMSG,
       "input year value = %d is out of range 0 - 9999", year);
       ffpmsg(errmsg);
       return(*status = BAD_DATE);
    }
    else if (month < 1 || month > 12)
    {
       snprintf(errmsg, FLEN_ERRMSG,
       "input month value = %d is out of range 1 - 12", month);
       ffpmsg(errmsg);
       return(*status = BAD_DATE);
    }
    
    if (ndays[month] == 31) {
        if (day < 1 || day > 31)
        {
           snprintf(errmsg, FLEN_ERRMSG,
           "input day value = %d is out of range 1 - 31 for month %d", day, month);
           ffpmsg(errmsg);
           return(*status = BAD_DATE);
        }
    } else if (ndays[month] == 30) {
        if (day < 1 || day > 30)
        {
           snprintf(errmsg, FLEN_ERRMSG,
           "input day value = %d is out of range 1 - 30 for month %d", day, month);
           ffpmsg(errmsg);
           return(*status = BAD_DATE);
        }
    } else {
        if (day < 1 || day > 28)
        {
            if (day == 29)
            {
	      /* year is a leap year if it is divisible by 4 but not by 100,
	         except years divisible by 400 are leap years
	      */
	        if ((year % 4 == 0 && year % 100 != 0 ) || year % 400 == 0)
		   return (*status);
		   
 	        snprintf(errmsg, FLEN_ERRMSG,
           "input day value = %d is out of range 1 - 28 for February %d (not leap year)", day, year);
                ffpmsg(errmsg);
	    } else {
                snprintf(errmsg, FLEN_ERRMSG,
                "input day value = %d is out of range 1 - 28 (or 29) for February", day);
                ffpmsg(errmsg);
	    }
	    
            return(*status = BAD_DATE);
        }
    }
    return(*status);
}
/*-----------------------------------------------------------------*/
int ffgstm( char *timestr,   /* O  - returned system date and time string  */
            int  *timeref,   /* O - GMT = 0, Local time = 1  */
            int   *status)   /* IO - error status      */
/*
  Returns the current date and time in format 'yyyy-mm-ddThh:mm:ss'.
*/
{
    time_t tp;
    struct tm *ptr;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    time(&tp);
    ptr = gmtime(&tp);         /* get GMT (= UTC) time */

    if (timeref)
    {
        if (ptr)
            *timeref = 0;   /* returning GMT */
        else
            *timeref = 1;   /* returning local time */
    }

    if (!ptr)                  /* GMT not available on this machine */
        ptr = localtime(&tp); 

    strftime(timestr, 25, "%Y-%m-%dT%H:%M:%S", ptr);

    return(*status);
}
/*-----------------------------------------------------------------*/
int ffdt2s(int year,          /* I - year (0 - 9999)           */
           int month,         /* I - month (1 - 12)            */
           int day,           /* I - day (1 - 31)              */
           char *datestr,     /* O - date string: "YYYY-MM-DD" */
           int   *status)     /* IO - error status             */
/*
  Construct a date character string
*/
{
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    *datestr = '\0';
    
    if (ffverifydate(year, month, day, status) > 0)
    {
        ffpmsg("invalid date (ffdt2s)");
        return(*status);
    }

    if (year >= 1900 && year <= 1998)  /* use old 'dd/mm/yy' format */
        sprintf(datestr, "%.2d/%.2d/%.2d", day, month, year - 1900);

    else  /* use the new 'YYYY-MM-DD' format */
        sprintf(datestr, "%.4d-%.2d-%.2d", year, month, day);

    return(*status);
}
/*-----------------------------------------------------------------*/
int ffs2dt(char *datestr,   /* I - date string: "YYYY-MM-DD" or "dd/mm/yy" */
           int *year,       /* O - year (0 - 9999)                         */
           int *month,      /* O - month (1 - 12)                          */
           int *day,        /* O - day (1 - 31)                            */
           int   *status)   /* IO - error status                           */
/*
  Parse a date character string into year, month, and day values
*/
{
    int slen, lyear, lmonth, lday;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (year)
        *year = 0;
    if (month)
        *month = 0;
    if (day)
        *day   = 0;

    if (!datestr)
    {
        ffpmsg("error: null input date string (ffs2dt)");
        return(*status = BAD_DATE);   /* Null datestr pointer ??? */
    }

    slen = strlen(datestr);

    if (slen == 8 && datestr[2] == '/' && datestr[5] == '/')
    {
        if (isdigit((int) datestr[0]) && isdigit((int) datestr[1])
         && isdigit((int) datestr[3]) && isdigit((int) datestr[4])
         && isdigit((int) datestr[6]) && isdigit((int) datestr[7]) )
        {
            /* this is an old format string: "dd/mm/yy" */
            lyear  = atoi(&datestr[6]) + 1900;
            lmonth = atoi(&datestr[3]);
	    lday   = atoi(datestr);
	    
            if (year)
                *year = lyear;
            if (month)
                *month = lmonth;
            if (day)
                *day   = lday;
        }
        else
        {
            ffpmsg("input date string has illegal format (ffs2dt):");
            ffpmsg(datestr);
            return(*status = BAD_DATE);
        }
    }
    else if (slen >= 10 && datestr[4] == '-' && datestr[7] == '-')
        {
        if (isdigit((int) datestr[0]) && isdigit((int) datestr[1])
         && isdigit((int) datestr[2]) && isdigit((int) datestr[3])
         && isdigit((int) datestr[5]) && isdigit((int) datestr[6])
         && isdigit((int) datestr[8]) && isdigit((int) datestr[9]) )
        {
            if (slen > 10 && datestr[10] != 'T')
            {
                ffpmsg("input date string has illegal format (ffs2dt):");
                ffpmsg(datestr);
                return(*status = BAD_DATE);
            }

            /* this is a new format string: "yyyy-mm-dd" */
            lyear  = atoi(datestr);
            lmonth = atoi(&datestr[5]);
            lday   = atoi(&datestr[8]);

            if (year)
               *year  = lyear;
            if (month)
               *month = lmonth;
            if (day)
               *day   = lday;
        }
        else
        {
                ffpmsg("input date string has illegal format (ffs2dt):");
                ffpmsg(datestr);
                return(*status = BAD_DATE);
        }
    }
    else
    {
                ffpmsg("input date string has illegal format (ffs2dt):");
                ffpmsg(datestr);
                return(*status = BAD_DATE);
    }


    if (ffverifydate(lyear, lmonth, lday, status) > 0)
    {
        ffpmsg("invalid date (ffs2dt)");
    }

    return(*status);
}
/*-----------------------------------------------------------------*/
int fftm2s(int year,          /* I - year (0 - 9999)           */
           int month,         /* I - month (1 - 12)            */
           int day,           /* I - day (1 - 31)              */
           int hour,          /* I - hour (0 - 23)             */
           int minute,        /* I - minute (0 - 59)           */
           double second,     /* I - second (0. - 60.9999999)  */
           int decimals,      /* I - number of decimal points to write      */
           char *datestr,     /* O - date string: "YYYY-MM-DDThh:mm:ss.ddd" */
                              /*   or "hh:mm:ss.ddd" if year, month day = 0 */
           int   *status)     /* IO - error status             */
/*
  Construct a date and time character string
*/
{
    int width;
    char errmsg[FLEN_ERRMSG];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    *datestr='\0';

    if (year != 0 || month != 0 || day !=0)
    { 
        if (ffverifydate(year, month, day, status) > 0)
	{
            ffpmsg("invalid date (fftm2s)");
            return(*status);
        }
    }

    if (hour < 0 || hour > 23)
    {
       snprintf(errmsg, FLEN_ERRMSG,
       "input hour value is out of range 0 - 23: %d (fftm2s)", hour);
       ffpmsg(errmsg);
       return(*status = BAD_DATE);
    }
    else if (minute < 0 || minute > 59)
    {
       snprintf(errmsg, FLEN_ERRMSG,
       "input minute value is out of range 0 - 59: %d (fftm2s)", minute);
       ffpmsg(errmsg);
       return(*status = BAD_DATE);
    }
    else if (second < 0. || second >= 61)
    {
       snprintf(errmsg, FLEN_ERRMSG,
       "input second value is out of range 0 - 60.999: %f (fftm2s)", second);
       ffpmsg(errmsg);
       return(*status = BAD_DATE);
    }
    else if (decimals > 25)
    {
       snprintf(errmsg, FLEN_ERRMSG,
       "input decimals value is out of range 0 - 25: %d (fftm2s)", decimals);
       ffpmsg(errmsg);
       return(*status = BAD_DATE);
    }

    if (decimals == 0)
       width = 2;
    else
       width = decimals + 3;

    if (decimals < 0)
    {
        /* a negative decimals value means return only the date, not time */
        sprintf(datestr, "%.4d-%.2d-%.2d", year, month, day);
    }
    else if (year == 0 && month == 0 && day == 0)
    {
        /* return only the time, not the date */
        sprintf(datestr, "%.2d:%.2d:%0*.*f",
            hour, minute, width, decimals, second);
    }
    else
    {
        /* return both the time and date */
        sprintf(datestr, "%.4d-%.2d-%.2dT%.2d:%.2d:%0*.*f",
            year, month, day, hour, minute, width, decimals, second);
    }
    return(*status);
}
/*-----------------------------------------------------------------*/
int ffs2tm(char *datestr,     /* I - date string: "YYYY-MM-DD"    */
                              /*     or "YYYY-MM-DDThh:mm:ss.ddd" */
                              /*     or "dd/mm/yy"                */
           int *year,         /* O - year (0 - 9999)              */
           int *month,        /* O - month (1 - 12)               */
           int *day,          /* O - day (1 - 31)                 */
           int *hour,          /* I - hour (0 - 23)                */
           int *minute,        /* I - minute (0 - 59)              */
           double *second,     /* I - second (0. - 60.9999999)     */
           int   *status)     /* IO - error status                */
/*
  Parse a date character string into date and time values
*/
{
    int slen;
    char errmsg[FLEN_ERRMSG];

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (year)
       *year   = 0;
    if (month)
       *month  = 0;
    if (day)
       *day    = 0;
    if (hour)
       *hour   = 0;
    if (minute)
       *minute = 0;
    if (second)
       *second = 0.;

    if (!datestr)
    {
        ffpmsg("error: null input date string (ffs2tm)");
        return(*status = BAD_DATE);   /* Null datestr pointer ??? */
    }

    if (datestr[2] == '/' || datestr[4] == '-')
    {
        /*  Parse the year, month, and date */
        if (ffs2dt(datestr, year, month, day, status) > 0)
            return(*status);

        slen = strlen(datestr);
        if (slen == 8 || slen == 10)
            return(*status);               /* OK, no time fields */
        else if (slen < 19) 
        {
            ffpmsg("input date string has illegal format:");
            ffpmsg(datestr);
            return(*status = BAD_DATE);
        }

        else if (datestr[10] == 'T' && datestr[13] == ':' && datestr[16] == ':')
        {
          if (isdigit((int) datestr[11]) && isdigit((int) datestr[12])
           && isdigit((int) datestr[14]) && isdigit((int) datestr[15])
           && isdigit((int) datestr[17]) && isdigit((int) datestr[18]) )
            {
                if (slen > 19 && datestr[19] != '.')
                {
                  ffpmsg("input date string has illegal format:");
                  ffpmsg(datestr);
                  return(*status = BAD_DATE);
                }

                /* this is a new format string: "yyyy-mm-ddThh:mm:ss.dddd" */
                if (hour)
                    *hour   = atoi(&datestr[11]);

                if (minute)
                    *minute = atoi(&datestr[14]);

                if (second)
                    *second = atof(&datestr[17]);
            }
            else
            {
                  ffpmsg("input date string has illegal format:");
                  ffpmsg(datestr);
                  return(*status = BAD_DATE);
            }

        }
    }
    else   /* no date fields */
    {
        if (datestr[2] == ':' && datestr[5] == ':')   /* time string */
        {
            if (isdigit((int) datestr[0]) && isdigit((int) datestr[1])
             && isdigit((int) datestr[3]) && isdigit((int) datestr[4])
             && isdigit((int) datestr[6]) && isdigit((int) datestr[7]) )
            {
                 /* this is a time string: "hh:mm:ss.dddd" */
                 if (hour)
                    *hour   = atoi(&datestr[0]);

                 if (minute)
                    *minute = atoi(&datestr[3]);

                if (second)
                    *second = atof(&datestr[6]);
            }
            else
            {
                  ffpmsg("input date string has illegal format:");
                  ffpmsg(datestr);
                  return(*status = BAD_DATE);
            }

        }
        else
        {
                  ffpmsg("input date string has illegal format:");
                  ffpmsg(datestr);
                  return(*status = BAD_DATE);
        }

    }

    if (hour)
       if (*hour < 0 || *hour > 23)
       {
          snprintf(errmsg,FLEN_ERRMSG, 
          "hour value is out of range 0 - 23: %d (ffs2tm)", *hour);
          ffpmsg(errmsg);
          return(*status = BAD_DATE);
       }

    if (minute)
       if (*minute < 0 || *minute > 59)
       {
          snprintf(errmsg, FLEN_ERRMSG,
          "minute value is out of range 0 - 59: %d (ffs2tm)", *minute);
          ffpmsg(errmsg);
          return(*status = BAD_DATE);
       }

    if (second)
       if (*second < 0 || *second >= 61.)
       {
          snprintf(errmsg, FLEN_ERRMSG,
          "second value is out of range 0 - 60.9999: %f (ffs2tm)", *second);
          ffpmsg(errmsg);
          return(*status = BAD_DATE);
       }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgsdt( int *day, int *month, int *year, int *status )
{  
/*
      This routine is included for backward compatibility
            with the Fortran FITSIO library.

   ffgsdt : Get current System DaTe (GMT if available)

      Return integer values of the day, month, and year

         Function parameters:
            day      Day of the month
            month    Numerical month (1=Jan, etc.)
            year     Year (1999, 2000, etc.)
            status   output error status

*/
   time_t now;
   struct tm *date;

   now = time( NULL );
   date = gmtime(&now);         /* get GMT (= UTC) time */

   if (!date)                  /* GMT not available on this machine */
   {
       date = localtime(&now); 
   }

   *day = date->tm_mday;
   *month = date->tm_mon + 1;
   *year = date->tm_year + 1900;  /* tm_year is defined as years since 1900 */
   return( *status );
}
/*--------------------------------------------------------------------------*/
int ffpkns( fitsfile *fptr,     /* I - FITS file pointer                    */
            const char *keyroot,      /* I - root name of keywords to write       */
            int  nstart,        /* I - starting index number                */
            int  nkey,          /* I - number of keywords to write          */
            char *value[],      /* I - array of pointers to keyword values  */
            char *comm[],       /* I - array of pointers to keyword comment */
            int  *status)       /* IO - error status                        */
/*
  Write (put) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NKEY -1) inclusive.  Writes string keywords.
  The value strings will be truncated at 68 characters, and the HEASARC
  long string keyword convention is not supported by this routine.
*/
{
    char keyname[FLEN_KEYWORD], tcomment[FLEN_COMMENT];
    int ii, jj, repeat, len;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* check if first comment string is to be repeated for all the keywords */
    /* by looking to see if the last non-blank character is a '&' char      */

    repeat = 0;

    if (comm)
    {
      len = strlen(comm[0]);

      while (len > 0  && comm[0][len - 1] == ' ')
        len--;                               /* ignore trailing blanks */

      if (comm[0][len - 1] == '&')
      {
        len = minvalue(len, FLEN_COMMENT);
        tcomment[0] = '\0';
        strncat(tcomment, comm[0], len-1); /* don't copy the final '&' char */
        repeat = 1;
      }
    }
    else
    {
      repeat = 1;
      tcomment[0] = '\0';
    }

    for (ii=0, jj=nstart; ii < nkey; ii++, jj++)
    {
        ffkeyn(keyroot, jj, keyname, status);
        if (repeat)
            ffpkys(fptr, keyname, value[ii], tcomment, status);
        else
            ffpkys(fptr, keyname, value[ii], comm[ii], status);

        if (*status > 0)
            return(*status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpknl( fitsfile *fptr,     /* I - FITS file pointer                    */
            const char *keyroot,      /* I - root name of keywords to write       */
            int  nstart,        /* I - starting index number                */
            int  nkey,          /* I - number of keywords to write          */
            int  *value,        /* I - array of keyword values              */
            char *comm[],       /* I - array of pointers to keyword comment */
            int  *status)       /* IO - error status                        */
/*
  Write (put) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NKEY -1) inclusive.  Writes logical keywords
  Values equal to zero will be written as a False FITS keyword value; any
  other non-zero value will result in a True FITS keyword.
*/
{
    char keyname[FLEN_KEYWORD], tcomment[FLEN_COMMENT];
    int ii, jj, repeat, len;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* check if first comment string is to be repeated for all the keywords */
    /* by looking to see if the last non-blank character is a '&' char      */

    repeat = 0;
    if (comm)
    {
      len = strlen(comm[0]);

      while (len > 0  && comm[0][len - 1] == ' ')
        len--;                               /* ignore trailing blanks */

      if (comm[0][len - 1] == '&')
      {
        len = minvalue(len, FLEN_COMMENT);
        tcomment[0] = '\0';
        strncat(tcomment, comm[0], len-1); /* don't copy the final '&' char */
        repeat = 1;
      }
    }
    else
    {
      repeat = 1;
      tcomment[0] = '\0';
    }


    for (ii=0, jj=nstart; ii < nkey; ii++, jj++)
    {
        ffkeyn(keyroot, jj, keyname, status);

        if (repeat)
            ffpkyl(fptr, keyname, value[ii], tcomment, status);
        else
            ffpkyl(fptr, keyname, value[ii], comm[ii], status);

        if (*status > 0)
            return(*status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpknj( fitsfile *fptr,     /* I - FITS file pointer                    */
            const char *keyroot,      /* I - root name of keywords to write       */
            int  nstart,        /* I - starting index number                */
            int  nkey,          /* I - number of keywords to write          */
            long *value,        /* I - array of keyword values              */
            char *comm[],       /* I - array of pointers to keyword comment */
            int  *status)       /* IO - error status                        */
/*
  Write (put) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NKEY -1) inclusive.  Write integer keywords
*/
{
    char keyname[FLEN_KEYWORD], tcomment[FLEN_COMMENT];
    int ii, jj, repeat, len;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* check if first comment string is to be repeated for all the keywords */
    /* by looking to see if the last non-blank character is a '&' char      */

    repeat = 0;

    if (comm)
    {
      len = strlen(comm[0]);

      while (len > 0  && comm[0][len - 1] == ' ')
        len--;                               /* ignore trailing blanks */

      if (comm[0][len - 1] == '&')
      {
        len = minvalue(len, FLEN_COMMENT);
        tcomment[0] = '\0';
        strncat(tcomment, comm[0], len-1); /* don't copy the final '&' char */
        repeat = 1;
      }
    }
    else
    {
      repeat = 1;
      tcomment[0] = '\0';
    }

    for (ii=0, jj=nstart; ii < nkey; ii++, jj++)
    {
        ffkeyn(keyroot, jj, keyname, status);
        if (repeat)
            ffpkyj(fptr, keyname, value[ii], tcomment, status);
        else
            ffpkyj(fptr, keyname, value[ii], comm[ii], status);

        if (*status > 0)
            return(*status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpknjj( fitsfile *fptr,    /* I - FITS file pointer                    */
            const char *keyroot,      /* I - root name of keywords to write       */
            int  nstart,        /* I - starting index number                */
            int  nkey,          /* I - number of keywords to write          */
            LONGLONG *value,    /* I - array of keyword values              */
            char *comm[],       /* I - array of pointers to keyword comment */
            int  *status)       /* IO - error status                        */
/*
  Write (put) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NKEY -1) inclusive.  Write integer keywords
*/
{
    char keyname[FLEN_KEYWORD], tcomment[FLEN_COMMENT];
    int ii, jj, repeat, len;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* check if first comment string is to be repeated for all the keywords */
    /* by looking to see if the last non-blank character is a '&' char      */

    repeat = 0;

    if (comm)
    {
      len = strlen(comm[0]);

      while (len > 0  && comm[0][len - 1] == ' ')
        len--;                               /* ignore trailing blanks */

      if (comm[0][len - 1] == '&')
      {
        len = minvalue(len, FLEN_COMMENT);
        tcomment[0] = '\0';
        strncat(tcomment, comm[0], len-1); /* don't copy the final '&' char */
        repeat = 1;
      }
    }
    else
    {
      repeat = 1;
      tcomment[0] = '\0';
    }

    for (ii=0, jj=nstart; ii < nkey; ii++, jj++)
    {
        ffkeyn(keyroot, jj, keyname, status);
        if (repeat)
            ffpkyj(fptr, keyname, value[ii], tcomment, status);
        else
            ffpkyj(fptr, keyname, value[ii], comm[ii], status);

        if (*status > 0)
            return(*status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpknf( fitsfile *fptr,     /* I - FITS file pointer                    */
            const char *keyroot,      /* I - root name of keywords to write       */
            int  nstart,        /* I - starting index number                */
            int  nkey,          /* I - number of keywords to write          */
            float *value,       /* I - array of keyword values              */
            int decim,          /* I - number of decimals to display        */
            char *comm[],       /* I - array of pointers to keyword comment */
            int  *status)       /* IO - error status                        */
/*
  Write (put) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NKEY -1) inclusive.  Writes fixed float values.
*/
{
    char keyname[FLEN_KEYWORD], tcomment[FLEN_COMMENT];
    int ii, jj, repeat, len;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* check if first comment string is to be repeated for all the keywords */
    /* by looking to see if the last non-blank character is a '&' char      */

    repeat = 0;

    if (comm)
    {
      len = strlen(comm[0]);

      while (len > 0  && comm[0][len - 1] == ' ')
        len--;                               /* ignore trailing blanks */

      if (comm[0][len - 1] == '&')
      {
        len = minvalue(len, FLEN_COMMENT);
        tcomment[0] = '\0';
        strncat(tcomment, comm[0], len-1); /* don't copy the final '&' char */
        repeat = 1;
      }
    }
    else
    {
      repeat = 1;
      tcomment[0] = '\0';
    }

    for (ii=0, jj=nstart; ii < nkey; ii++, jj++)
    {
        ffkeyn(keyroot, jj, keyname, status);
        if (repeat)
            ffpkyf(fptr, keyname, value[ii], decim, tcomment, status);
        else
            ffpkyf(fptr, keyname, value[ii], decim, comm[ii], status);

        if (*status > 0)
            return(*status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkne( fitsfile *fptr,     /* I - FITS file pointer                    */
            const char *keyroot,      /* I - root name of keywords to write       */
            int  nstart,        /* I - starting index number                */
            int  nkey,          /* I - number of keywords to write          */
            float *value,       /* I - array of keyword values              */
            int decim,          /* I - number of decimals to display        */
            char *comm[],       /* I - array of pointers to keyword comment */
            int  *status)       /* IO - error status                        */
/*
  Write (put) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NKEY -1) inclusive.  Writes exponential float values.
*/
{
    char keyname[FLEN_KEYWORD], tcomment[FLEN_COMMENT];
    int ii, jj, repeat, len;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* check if first comment string is to be repeated for all the keywords */
    /* by looking to see if the last non-blank character is a '&' char      */

    repeat = 0;

    if (comm)
    {
      len = strlen(comm[0]);

      while (len > 0  && comm[0][len - 1] == ' ')
        len--;                               /* ignore trailing blanks */

      if (comm[0][len - 1] == '&')
      {
        len = minvalue(len, FLEN_COMMENT);
        tcomment[0] = '\0';
        strncat(tcomment, comm[0], len-1); /* don't copy the final '&' char */
        repeat = 1;
      }
    }
    else
    {
      repeat = 1;
      tcomment[0] = '\0';
    }

    for (ii=0, jj=nstart; ii < nkey; ii++, jj++)
    {
        ffkeyn(keyroot, jj, keyname, status);
        if (repeat)
            ffpkye(fptr, keyname, value[ii], decim, tcomment, status);
        else
            ffpkye(fptr, keyname, value[ii], decim, comm[ii], status);

        if (*status > 0)
            return(*status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpkng( fitsfile *fptr,     /* I - FITS file pointer                    */
            const char *keyroot,      /* I - root name of keywords to write       */
            int  nstart,        /* I - starting index number                */
            int  nkey,          /* I - number of keywords to write          */
            double *value,      /* I - array of keyword values              */
            int decim,          /* I - number of decimals to display        */
            char *comm[],       /* I - array of pointers to keyword comment */
            int  *status)       /* IO - error status                        */
/*
  Write (put) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NKEY -1) inclusive.  Writes fixed double values.
*/
{
    char keyname[FLEN_KEYWORD], tcomment[FLEN_COMMENT];
    int ii, jj, repeat, len;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* check if first comment string is to be repeated for all the keywords */
    /* by looking to see if the last non-blank character is a '&' char      */

    repeat = 0;

    if (comm)
    {
      len = strlen(comm[0]);

      while (len > 0  && comm[0][len - 1] == ' ')
        len--;                               /* ignore trailing blanks */

      if (comm[0][len - 1] == '&')
      {
        len = minvalue(len, FLEN_COMMENT);
        tcomment[0] = '\0';
        strncat(tcomment, comm[0], len-1); /* don't copy the final '&' char */
        repeat = 1;
      }
    }
    else
    {
      repeat = 1;
      tcomment[0] = '\0';
    }

    for (ii=0, jj=nstart; ii < nkey; ii++, jj++)
    {
        ffkeyn(keyroot, jj, keyname, status);
        if (repeat)
            ffpkyg(fptr, keyname, value[ii], decim, tcomment, status);
        else
            ffpkyg(fptr, keyname, value[ii], decim, comm[ii], status);

        if (*status > 0)
            return(*status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpknd( fitsfile *fptr,     /* I - FITS file pointer                    */
            const char *keyroot,      /* I - root name of keywords to write       */
            int  nstart,        /* I - starting index number                */
            int  nkey,          /* I - number of keywords to write          */
            double *value,      /* I - array of keyword values              */
            int decim,          /* I - number of decimals to display        */
            char *comm[],       /* I - array of pointers to keyword comment */
            int  *status)       /* IO - error status                        */
/*
  Write (put) an indexed array of keywords with index numbers between
  NSTART and (NSTART + NKEY -1) inclusive.  Writes exponential double values.
*/
{
    char keyname[FLEN_KEYWORD], tcomment[FLEN_COMMENT];
    int ii, jj, repeat, len;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    /* check if first comment string is to be repeated for all the keywords */
    /* by looking to see if the last non-blank character is a '&' char      */

    repeat = 0;

    if (comm)
    {
      len = strlen(comm[0]);

      while (len > 0  && comm[0][len - 1] == ' ')
        len--;                               /* ignore trailing blanks */

      if (comm[0][len - 1] == '&')
      {
        len = minvalue(len, FLEN_COMMENT);
        tcomment[0] = '\0';
        strncat(tcomment, comm[0], len-1); /* don't copy the final '&' char */
        repeat = 1;
      }
    }
    else
    {
      repeat = 1;
      tcomment[0] = '\0';
    }

    for (ii=0, jj=nstart; ii < nkey; ii++, jj++)
    {
        ffkeyn(keyroot, jj, keyname, status);
        if (repeat)
            ffpkyd(fptr, keyname, value[ii], decim, tcomment, status);
        else
            ffpkyd(fptr, keyname, value[ii], decim, comm[ii], status);

        if (*status > 0)
            return(*status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffptdm( fitsfile *fptr, /* I - FITS file pointer                        */
            int colnum,     /* I - column number                            */
            int naxis,      /* I - number of axes in the data array         */
            long naxes[],   /* I - length of each data axis                 */
            int *status)    /* IO - error status                            */
/*
  write the TDIMnnn keyword describing the dimensionality of a column
*/
{
    char keyname[FLEN_KEYWORD], tdimstr[FLEN_VALUE], comm[FLEN_COMMENT];
    char value[80], message[FLEN_ERRMSG];
    int ii;
    long totalpix = 1, repeat;
    tcolumn *colptr;

    if (*status > 0)
        return(*status);

    if (colnum < 1 || colnum > 999)
    {
        ffpmsg("column number is out of range 1 - 999 (ffptdm)");
        return(*status = BAD_COL_NUM);
    }

    if (naxis < 1)
    {
        ffpmsg("naxis is less than 1 (ffptdm)");
        return(*status = BAD_DIMEN);
    }

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);

    if ( (fptr->Fptr)->hdutype != BINARY_TBL)
    {
       ffpmsg(
    "Error: The TDIMn keyword is only allowed in BINTABLE extensions (ffptdm)");
       return(*status = NOT_BTABLE);
    }

    strcpy(tdimstr, "(");            /* start constructing the TDIM value */   

    for (ii = 0; ii < naxis; ii++)
    {
        if (ii > 0)
            strcat(tdimstr, ",");   /* append the comma separator */

        if (naxes[ii] < 0)
        {
            ffpmsg("one or more TDIM values are less than 0 (ffptdm)");
            return(*status = BAD_TDIM);
        }

        snprintf(value, 80,"%ld", naxes[ii]);
        /* This will either be followed by a ',' or ')'. */
        if (strlen(tdimstr)+strlen(value)+1 > FLEN_VALUE-1)
        {
            ffpmsg("TDIM string too long (ffptdm)");
            return(*status = BAD_TDIM);
        }
        strcat(tdimstr, value);     /* append the axis size */

        totalpix *= naxes[ii];
    }

    colptr = (fptr->Fptr)->tableptr;  /* point to first column structure */
    colptr += (colnum - 1);      /* point to the specified column number */

    if ((long) colptr->trepeat != totalpix)
    {
      /* There is an apparent inconsistency between TDIMn and TFORMn. */
      /* The colptr->trepeat value may be out of date, so re-read     */
      /* the TFORMn keyword to be sure.                               */

      ffkeyn("TFORM", colnum, keyname, status);   /* construct TFORMn name  */
      ffgkys(fptr, keyname, value, NULL, status); /* read TFORMn keyword    */
      ffbnfm(value, NULL, &repeat, NULL, status); /* parse the repeat count */

      if (*status > 0 || repeat != totalpix)
      {
        snprintf(message,FLEN_ERRMSG,
        "column vector length, %ld, does not equal TDIMn array size, %ld",
        (long) colptr->trepeat, totalpix);
        ffpmsg(message);
        return(*status = BAD_TDIM);
      }
    }

    strcat(tdimstr, ")" );            /* append the closing parenthesis */

    strcpy(comm, "size of the multidimensional array");
    ffkeyn("TDIM", colnum, keyname, status);      /* construct TDIMn name */
    ffpkys(fptr, keyname, tdimstr, comm, status);  /* write the keyword */
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffptdmll( fitsfile *fptr, /* I - FITS file pointer                      */
            int colnum,     /* I - column number                            */
            int naxis,      /* I - number of axes in the data array         */
            LONGLONG naxes[], /* I - length of each data axis               */
            int *status)    /* IO - error status                            */
/*
  write the TDIMnnn keyword describing the dimensionality of a column
*/
{
    char keyname[FLEN_KEYWORD], tdimstr[FLEN_VALUE], comm[FLEN_COMMENT];
    char value[80], message[81];
    int ii;
    LONGLONG totalpix = 1, repeat;
    tcolumn *colptr;

    if (*status > 0)
        return(*status);

    if (colnum < 1 || colnum > 999)
    {
        ffpmsg("column number is out of range 1 - 999 (ffptdm)");
        return(*status = BAD_COL_NUM);
    }

    if (naxis < 1)
    {
        ffpmsg("naxis is less than 1 (ffptdm)");
        return(*status = BAD_DIMEN);
    }

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);
    else if ((fptr->Fptr)->datastart == DATA_UNDEFINED)
        if ( ffrdef(fptr, status) > 0)               /* rescan header */
            return(*status);

    if ( (fptr->Fptr)->hdutype != BINARY_TBL)
    {
       ffpmsg(
    "Error: The TDIMn keyword is only allowed in BINTABLE extensions (ffptdm)");
       return(*status = NOT_BTABLE);
    }

    strcpy(tdimstr, "(");            /* start constructing the TDIM value */   

    for (ii = 0; ii < naxis; ii++)
    {
        if (ii > 0)
            strcat(tdimstr, ",");   /* append the comma separator */

        if (naxes[ii] < 0)
        {
            ffpmsg("one or more TDIM values are less than 0 (ffptdm)");
            return(*status = BAD_TDIM);
        }

        /* cast to double because the 64-bit int conversion character in */
        /* sprintf is platform dependent ( %lld, %ld, %I64d )            */

        snprintf(value, 80, "%.0f", (double) naxes[ii]);
        
        if (strlen(tdimstr)+strlen(value)+1 > FLEN_VALUE-1)
        {
            ffpmsg("TDIM string too long (ffptdmll)");
            return(*status = BAD_TDIM);
        }
        strcat(tdimstr, value);     /* append the axis size */

        totalpix *= naxes[ii];
    }

    colptr = (fptr->Fptr)->tableptr;  /* point to first column structure */
    colptr += (colnum - 1);      /* point to the specified column number */

    if ( colptr->trepeat != totalpix)
    {
      /* There is an apparent inconsistency between TDIMn and TFORMn. */
      /* The colptr->trepeat value may be out of date, so re-read     */
      /* the TFORMn keyword to be sure.                               */

      ffkeyn("TFORM", colnum, keyname, status);   /* construct TFORMn name  */
      ffgkys(fptr, keyname, value, NULL, status); /* read TFORMn keyword    */
      ffbnfmll(value, NULL, &repeat, NULL, status); /* parse the repeat count */

      if (*status > 0 || repeat != totalpix)
      {
        snprintf(message,FLEN_ERRMSG,
        "column vector length, %.0f, does not equal TDIMn array size, %.0f",
        (double) (colptr->trepeat), (double) totalpix);
        ffpmsg(message);
        return(*status = BAD_TDIM);
      }
    }

    strcat(tdimstr, ")" );            /* append the closing parenthesis */

    strcpy(comm, "size of the multidimensional array");
    ffkeyn("TDIM", colnum, keyname, status);      /* construct TDIMn name */
    ffpkys(fptr, keyname, tdimstr, comm, status);  /* write the keyword */
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffphps( fitsfile *fptr, /* I - FITS file pointer                        */
            int bitpix,     /* I - number of bits per data value pixel      */
            int naxis,      /* I - number of axes in the data array         */
            long naxes[],   /* I - length of each data axis                 */
            int *status)    /* IO - error status                            */
/*
  write STANDARD set of required primary header keywords
*/
{
    int simple = 1;     /* does file conform to FITS standard? 1/0  */
    long pcount = 0;    /* number of group parameters (usually 0)   */
    long gcount = 1;    /* number of random groups (usually 1 or 0) */
    int extend = 1;     /* may FITS file have extensions?           */

    ffphpr(fptr, simple, bitpix, naxis, naxes, pcount, gcount, extend, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffphpsll( fitsfile *fptr, /* I - FITS file pointer                        */
            int bitpix,     /* I - number of bits per data value pixel      */
            int naxis,      /* I - number of axes in the data array         */
            LONGLONG naxes[],   /* I - length of each data axis                 */
            int *status)    /* IO - error status                            */
/*
  write STANDARD set of required primary header keywords
*/
{
    int simple = 1;     /* does file conform to FITS standard? 1/0  */
    LONGLONG pcount = 0;    /* number of group parameters (usually 0)   */
    LONGLONG gcount = 1;    /* number of random groups (usually 1 or 0) */
    int extend = 1;     /* may FITS file have extensions?           */

    ffphprll(fptr, simple, bitpix, naxis, naxes, pcount, gcount, extend, status);
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffphpr( fitsfile *fptr, /* I - FITS file pointer                        */
            int simple,     /* I - does file conform to FITS standard? 1/0  */
            int bitpix,     /* I - number of bits per data value pixel      */
            int naxis,      /* I - number of axes in the data array         */
            long naxes[],   /* I - length of each data axis                 */
            LONGLONG pcount, /* I - number of group parameters (usually 0)   */
            LONGLONG gcount, /* I - number of random groups (usually 1 or 0) */
            int extend,     /* I - may FITS file have extensions?           */
            int *status)    /* IO - error status                            */
/*
  write required primary header keywords
*/
{
    int ii;
    LONGLONG naxesll[20];
   
    for (ii = 0; (ii < naxis) && (ii < 20); ii++)
       naxesll[ii] = naxes[ii];

    ffphprll(fptr, simple, bitpix, naxis, naxesll, pcount, gcount,
             extend, status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffphprll( fitsfile *fptr, /* I - FITS file pointer                        */
            int simple,     /* I - does file conform to FITS standard? 1/0  */
            int bitpix,     /* I - number of bits per data value pixel      */
            int naxis,      /* I - number of axes in the data array         */
            LONGLONG naxes[], /* I - length of each data axis                 */
            LONGLONG pcount,  /* I - number of group parameters (usually 0)   */
            LONGLONG gcount,  /* I - number of random groups (usually 1 or 0) */
            int extend,     /* I - may FITS file have extensions?           */
            int *status)    /* IO - error status                            */
/*
  write required primary header keywords
*/
{
    int ii;
    long longbitpix, tnaxes[20];
    char name[FLEN_KEYWORD], comm[FLEN_COMMENT], message[FLEN_ERRMSG];
    char card[FLEN_CARD];

    if (*status > 0)
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if ((fptr->Fptr)->headend != (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] )
        return(*status = HEADER_NOT_EMPTY);

    if (naxis != 0)   /* never try to compress a null image */
    {
      if ( (fptr->Fptr)->request_compress_type )
      {
      
       for (ii = 0; ii < naxis; ii++)
           tnaxes[ii] = (long) naxes[ii];
	   
        /* write header for a compressed image */
        imcomp_init_table(fptr, bitpix, naxis, tnaxes, 1, status);
        return(*status);
      }
    }  

    if ((fptr->Fptr)->curhdu == 0)
    {                /* write primary array header */
        if (simple)
            strcpy(comm, "file does conform to FITS standard");
        else
            strcpy(comm, "file does not conform to FITS standard");

        ffpkyl(fptr, "SIMPLE", simple, comm, status);
    }
    else
    {               /* write IMAGE extension header */
        strcpy(comm, "IMAGE extension");
        ffpkys(fptr, "XTENSION", "IMAGE", comm, status);
    }

    longbitpix = bitpix;

    /* test for the 3 special cases that represent unsigned integers */
    if (longbitpix == USHORT_IMG)
        longbitpix = SHORT_IMG;
    else if (longbitpix == ULONG_IMG)
        longbitpix = LONG_IMG;
    else if (longbitpix == ULONGLONG_IMG)
        longbitpix = LONGLONG_IMG;
    else if (longbitpix == SBYTE_IMG)
        longbitpix = BYTE_IMG;

    if (longbitpix != BYTE_IMG && longbitpix != SHORT_IMG && 
        longbitpix != LONG_IMG && longbitpix != LONGLONG_IMG &&
        longbitpix != FLOAT_IMG && longbitpix != DOUBLE_IMG)
    {
        snprintf(message,FLEN_ERRMSG,
        "Illegal value for BITPIX keyword: %d", bitpix);
        ffpmsg(message);
        return(*status = BAD_BITPIX);
    }

    strcpy(comm, "number of bits per data pixel");
    if (ffpkyj(fptr, "BITPIX", longbitpix, comm, status) > 0)
        return(*status);

    if (naxis < 0 || naxis > 999)
    {
        snprintf(message,FLEN_ERRMSG,
        "Illegal value for NAXIS keyword: %d", naxis);
        ffpmsg(message);
        return(*status = BAD_NAXIS);
    }

    strcpy(comm, "number of data axes");
    ffpkyj(fptr, "NAXIS", naxis, comm, status);

    strcpy(comm, "length of data axis ");
    for (ii = 0; ii < naxis; ii++)
    {
        if (naxes[ii] < 0)
        {
            snprintf(message,FLEN_ERRMSG,
            "Illegal negative value for NAXIS%d keyword: %.0f", ii + 1, (double) (naxes[ii]));
            ffpmsg(message);
            return(*status = BAD_NAXES);
        }

        snprintf(&comm[20], FLEN_COMMENT-20,"%d", ii + 1);
        ffkeyn("NAXIS", ii + 1, name, status);
        ffpkyj(fptr, name, naxes[ii], comm, status);
    }

    if ((fptr->Fptr)->curhdu == 0)  /* the primary array */
    {
        if (extend)
        {
            /* only write EXTEND keyword if value = true */
            strcpy(comm, "FITS dataset may contain extensions");
            ffpkyl(fptr, "EXTEND", extend, comm, status);
        }

        if (pcount < 0)
        {
            ffpmsg("pcount value is less than 0");
            return(*status = BAD_PCOUNT);
        }

        else if (gcount < 1)
        {
            ffpmsg("gcount value is less than 1");
            return(*status = BAD_GCOUNT);
        }

        else if (pcount > 0 || gcount > 1)
        {
            /* only write these keyword if non-standard values */
            strcpy(comm, "random group records are present");
            ffpkyl(fptr, "GROUPS", 1, comm, status);

            strcpy(comm, "number of random group parameters");
            ffpkyj(fptr, "PCOUNT", pcount, comm, status);
  
            strcpy(comm, "number of random groups");
            ffpkyj(fptr, "GCOUNT", gcount, comm, status);
        }

      /* write standard block of self-documentating comments */
      ffprec(fptr,
      "COMMENT   FITS (Flexible Image Transport System) format is defined in 'Astronomy",
      status);
      ffprec(fptr,
      "COMMENT   and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H",
      status);
    }

    else  /* an IMAGE extension */

    {   /* image extension; cannot have random groups */
        if (pcount != 0)
        {
            ffpmsg("image extensions must have pcount = 0");
            *status = BAD_PCOUNT;
        }

        else if (gcount != 1)
        {
            ffpmsg("image extensions must have gcount = 1");
            *status = BAD_GCOUNT;
        }

        else
        {
            strcpy(comm, "required keyword; must = 0");
            ffpkyj(fptr, "PCOUNT", 0, comm, status);
  
            strcpy(comm, "required keyword; must = 1");
            ffpkyj(fptr, "GCOUNT", 1, comm, status);
        }
    }

    /* Write the BSCALE and BZERO keywords, if an unsigned integer image */
    if (bitpix == USHORT_IMG)
    {
        strcpy(comm, "offset data range to that of unsigned short");
        ffpkyg(fptr, "BZERO", 32768., 0, comm, status);
        strcpy(comm, "default scaling factor");
        ffpkyg(fptr, "BSCALE", 1.0, 0, comm, status);
    }
    else if (bitpix == ULONG_IMG)
    {
        strcpy(comm, "offset data range to that of unsigned long");
        ffpkyg(fptr, "BZERO", 2147483648., 0, comm, status);
        strcpy(comm, "default scaling factor");
        ffpkyg(fptr, "BSCALE", 1.0, 0, comm, status);
    }
    else if (bitpix == ULONGLONG_IMG)
    {
        strcpy(card,"BZERO   =  9223372036854775808 / offset data range to that of unsigned long long");
        ffprec(fptr, card, status);
        strcpy(comm, "default scaling factor");
        ffpkyg(fptr, "BSCALE", 1.0, 0, comm, status);
    }
    else if (bitpix == SBYTE_IMG)
    {
        strcpy(comm, "offset data range to that of signed byte");
        ffpkyg(fptr, "BZERO", -128., 0, comm, status);
        strcpy(comm, "default scaling factor");
        ffpkyg(fptr, "BSCALE", 1.0, 0, comm, status);
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffphtb(fitsfile *fptr,  /* I - FITS file pointer                        */
           LONGLONG naxis1,     /* I - width of row in the table                */
           LONGLONG naxis2,     /* I - number of rows in the table              */
           int tfields,     /* I - number of columns in the table           */
           char **ttype,    /* I - name of each column                      */
           long *tbcol,     /* I - byte offset in row to each column        */
           char **tform,    /* I - value of TFORMn keyword for each column  */
           char **tunit,    /* I - value of TUNITn keyword for each column  */
           const char *extnmx,   /* I - value of EXTNAME keyword, if any         */
           int *status)     /* IO - error status                            */
/*
  Put required Header keywords into the ASCII TaBle:
*/
{
    int ii, ncols, gotmem = 0;
    long rowlen; /* must be 'long' because it is passed to ffgabc */
    char tfmt[30], name[FLEN_KEYWORD], comm[FLEN_COMMENT], extnm[FLEN_VALUE];

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if (*status > 0)
        return(*status);
    else if ((fptr->Fptr)->headend != (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] )
        return(*status = HEADER_NOT_EMPTY);
    else if (naxis1 < 0)
        return(*status = NEG_WIDTH);
    else if (naxis2 < 0)
        return(*status = NEG_ROWS);
    else if (tfields < 0 || tfields > 999)
        return(*status = BAD_TFIELDS);
    
    extnm[0] = '\0';
    if (extnmx)
        strncat(extnm, extnmx, FLEN_VALUE-1);

    rowlen = (long) naxis1;

    if (!tbcol || !tbcol[0] || (!naxis1 && tfields)) /* spacing not defined? */
    {
      /* allocate mem for tbcol; malloc can have problems allocating small */
      /* arrays, so allocate at least 20 bytes */

      ncols = maxvalue(5, tfields);
      tbcol = (long *) calloc(ncols, sizeof(long));

      if (tbcol)
      {
        gotmem = 1;

        /* calculate width of a row and starting position of each column. */
        /* Each column will be separated by 1 blank space */
        ffgabc(tfields, tform, 1, &rowlen, tbcol, status);
      }
    }
    ffpkys(fptr, "XTENSION", "TABLE", "ASCII table extension", status);
    ffpkyj(fptr, "BITPIX", 8, "8-bit ASCII characters", status);
    ffpkyj(fptr, "NAXIS", 2, "2-dimensional ASCII table", status);
    ffpkyj(fptr, "NAXIS1", rowlen, "width of table in characters", status);
    ffpkyj(fptr, "NAXIS2", naxis2, "number of rows in table", status);
    ffpkyj(fptr, "PCOUNT", 0, "no group parameters (required keyword)", status);
    ffpkyj(fptr, "GCOUNT", 1, "one data group (required keyword)", status);
    ffpkyj(fptr, "TFIELDS", tfields, "number of fields in each row", status);

    for (ii = 0; ii < tfields; ii++) /* loop over every column */
    {
        if ( *(ttype[ii]) )  /* optional TTYPEn keyword */
        {
          snprintf(comm, FLEN_COMMENT,"label for field %3d", ii + 1);
          ffkeyn("TTYPE", ii + 1, name, status);
          ffpkys(fptr, name, ttype[ii], comm, status);
        }

        if (tbcol[ii] < 1 || tbcol[ii] > rowlen)
           *status = BAD_TBCOL;

        snprintf(comm, FLEN_COMMENT,"beginning column of field %3d", ii + 1);
        ffkeyn("TBCOL", ii + 1, name, status);
        ffpkyj(fptr, name, tbcol[ii], comm, status);

        if (strlen(tform[ii]) > 29)
        {
          ffpmsg("Error: ASCII table TFORM code is too long (ffphtb)");
          *status = BAD_TFORM;
          break;
        }
        strcpy(tfmt, tform[ii]);  /* required TFORMn keyword */
        ffupch(tfmt);
        ffkeyn("TFORM", ii + 1, name, status);
        ffpkys(fptr, name, tfmt, "Fortran-77 format of field", status);

        if (tunit)
        {
         if (tunit[ii] && *(tunit[ii]) )  /* optional TUNITn keyword */
         {
          ffkeyn("TUNIT", ii + 1, name, status);
          ffpkys(fptr, name, tunit[ii], "physical unit of field", status) ;
         }
        }

        if (*status > 0)
            break;       /* abort loop on error */
    }

    if (extnm[0])       /* optional EXTNAME keyword */
        ffpkys(fptr, "EXTNAME", extnm,
               "name of this ASCII table extension", status);

    if (*status > 0)
        ffpmsg("Failed to write ASCII table header keywords (ffphtb)");

    if (gotmem)
        free(tbcol); 

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffphbn(fitsfile *fptr,  /* I - FITS file pointer                        */
           LONGLONG naxis2,     /* I - number of rows in the table              */
           int tfields,     /* I - number of columns in the table           */
           char **ttype,    /* I - name of each column                      */
           char **tform,    /* I - value of TFORMn keyword for each column  */
           char **tunit,    /* I - value of TUNITn keyword for each column  */
           const char *extnmx,   /* I - value of EXTNAME keyword, if any         */
           LONGLONG pcount,     /* I - size of the variable length heap area    */
           int *status)     /* IO - error status                            */
/*
  Put required Header keywords into the Binary Table:
*/
{
    int ii, datatype, iread = 0;
    long repeat, width;
    LONGLONG naxis1;

    char tfmt[30], name[FLEN_KEYWORD], comm[FLEN_COMMENT], extnm[FLEN_VALUE];
    char *cptr, card[FLEN_CARD];
    tcolumn *colptr;

    if (*status > 0)
        return(*status);

    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if ((fptr->Fptr)->headend != (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] )
        return(*status = HEADER_NOT_EMPTY);
    else if (naxis2 < 0)
        return(*status = NEG_ROWS);
    else if (pcount < 0)
        return(*status = BAD_PCOUNT);
    else if (tfields < 0 || tfields > 999)
        return(*status = BAD_TFIELDS);

    extnm[0] = '\0';
    if (extnmx)
        strncat(extnm, extnmx, FLEN_VALUE-1);

    ffpkys(fptr, "XTENSION", "BINTABLE", "binary table extension", status);
    ffpkyj(fptr, "BITPIX", 8, "8-bit bytes", status);
    ffpkyj(fptr, "NAXIS", 2, "2-dimensional binary table", status);

    naxis1 = 0;
    for (ii = 0; ii < tfields; ii++)  /* sum the width of each field */
    {
        ffbnfm(tform[ii], &datatype, &repeat, &width, status);

        if (datatype == TSTRING)
            naxis1 += repeat;   /* one byte per char */
        else if (datatype == TBIT)
            naxis1 += (repeat + 7) / 8;
        else if (datatype > 0)
            naxis1 += repeat * (datatype / 10);
        else if (tform[ii][0] == 'P' || tform[ii][1] == 'P'||
                 tform[ii][0] == 'p' || tform[ii][1] == 'p')
           /* this is a 'P' variable length descriptor (neg. datatype) */
            naxis1 += 8;
        else
           /* this is a 'Q' variable length descriptor (neg. datatype) */
            naxis1 += 16;

        if (*status > 0)
            break;       /* abort loop on error */
    }

    ffpkyj(fptr, "NAXIS1", naxis1, "width of table in bytes", status);
    ffpkyj(fptr, "NAXIS2", naxis2, "number of rows in table", status);

    /*
      the initial value of PCOUNT (= size of the variable length array heap)
      should always be zero.  If any variable length data is written, then
      the value of PCOUNT will be updated when the HDU is closed
    */
    ffpkyj(fptr, "PCOUNT", 0, "size of special data area", status);
    ffpkyj(fptr, "GCOUNT", 1, "one data group (required keyword)", status);
    ffpkyj(fptr, "TFIELDS", tfields, "number of fields in each row", status);

    for (ii = 0; ii < tfields; ii++) /* loop over every column */
    {
        if ( *(ttype[ii]) )  /* optional TTYPEn keyword */
        {
          snprintf(comm, FLEN_COMMENT,"label for field %3d", ii + 1);
          ffkeyn("TTYPE", ii + 1, name, status);
          ffpkys(fptr, name, ttype[ii], comm, status);
        }

        if (strlen(tform[ii]) > 29)
        {
          ffpmsg("Error: BIN table TFORM code is too long (ffphbn)");
          *status = BAD_TFORM;
          break;
        }
        strcpy(tfmt, tform[ii]);  /* required TFORMn keyword */
        ffupch(tfmt);

        ffkeyn("TFORM", ii + 1, name, status);
        strcpy(comm, "data format of field");

        ffbnfm(tfmt, &datatype, &repeat, &width, status);

        if (datatype == TSTRING)
        {
            strcat(comm, ": ASCII Character");

            /* Do sanity check to see if an ASCII table format was used,  */
            /* e.g., 'A8' instead of '8A', or a bad unit width eg '8A9'.  */
            /* Don't want to return an error status, so write error into  */
            /* the keyword comment.  */

            cptr = strchr(tfmt,'A');
            cptr++;

            if (cptr)
               iread = sscanf(cptr,"%ld", &width);

            if (iread == 1 && (width > repeat)) 
            {
              if (repeat == 1)
                strcpy(comm, "ERROR??  USING ASCII TABLE SYNTAX BY MISTAKE??");
              else
                strcpy(comm, "rAw FORMAT ERROR! UNIT WIDTH w > COLUMN WIDTH r");
            }
        }
        else if (datatype == TBIT)
           strcat(comm, ": BIT");
        else if (datatype == TBYTE)
           strcat(comm, ": BYTE");
        else if (datatype == TLOGICAL)
           strcat(comm, ": 1-byte LOGICAL");
        else if (datatype == TSHORT)
           strcat(comm, ": 2-byte INTEGER");
        else if (datatype == TUSHORT)
           strcat(comm, ": 2-byte INTEGER");
        else if (datatype == TLONG)
           strcat(comm, ": 4-byte INTEGER");
        else if (datatype == TLONGLONG)
           strcat(comm, ": 8-byte INTEGER");
        else if (datatype == TULONG)
           strcat(comm, ": 4-byte INTEGER");
        else if (datatype == TULONGLONG)
           strcat(comm, ": 8-byte INTEGER");
        else if (datatype == TFLOAT)
           strcat(comm, ": 4-byte REAL");
        else if (datatype == TDOUBLE)
           strcat(comm, ": 8-byte DOUBLE");
        else if (datatype == TCOMPLEX)
           strcat(comm, ": COMPLEX");
        else if (datatype == TDBLCOMPLEX)
           strcat(comm, ": DOUBLE COMPLEX");
        else if (datatype < 0)
           strcat(comm, ": variable length array");

        if (abs(datatype) == TSBYTE) /* signed bytes */
        {
           /* Replace the 'S' with an 'B' in the TFORMn code */
           cptr = tfmt;
           while (*cptr != 'S') 
              cptr++;

           *cptr = 'B';
           ffpkys(fptr, name, tfmt, comm, status);

           /* write the TZEROn and TSCALn keywords */
           ffkeyn("TZERO", ii + 1, name, status);
           strcpy(comm, "offset for signed bytes");

           ffpkyg(fptr, name, -128., 0, comm, status);

           ffkeyn("TSCAL", ii + 1, name, status);
           strcpy(comm, "data are not scaled");
           ffpkyg(fptr, name, 1., 0, comm, status);
        }
        else if (abs(datatype) == TUSHORT) 
        {
           /* Replace the 'U' with an 'I' in the TFORMn code */
           cptr = tfmt;
           while (*cptr != 'U') 
              cptr++;

           *cptr = 'I';
           ffpkys(fptr, name, tfmt, comm, status);

           /* write the TZEROn and TSCALn keywords */
           ffkeyn("TZERO", ii + 1, name, status);
           strcpy(comm, "offset for unsigned integers");

           ffpkyg(fptr, name, 32768., 0, comm, status);

           ffkeyn("TSCAL", ii + 1, name, status);
           strcpy(comm, "data are not scaled");
           ffpkyg(fptr, name, 1., 0, comm, status);
        }
        else if (abs(datatype) == TULONG) 
        {
           /* Replace the 'V' with an 'J' in the TFORMn code */
           cptr = tfmt;
           while (*cptr != 'V') 
              cptr++;

           *cptr = 'J';
           ffpkys(fptr, name, tfmt, comm, status);

           /* write the TZEROn and TSCALn keywords */
           ffkeyn("TZERO", ii + 1, name, status);
           strcpy(comm, "offset for unsigned integers");

           ffpkyg(fptr, name, 2147483648., 0, comm, status);

           ffkeyn("TSCAL", ii + 1, name, status);
           strcpy(comm, "data are not scaled");
           ffpkyg(fptr, name, 1., 0, comm, status);
        }
        else if (abs(datatype) == TULONGLONG) 
        {	   
           /* Replace the 'W' with an 'K' in the TFORMn code */
           cptr = tfmt;
           while (*cptr != 'W') 
              cptr++;

           *cptr = 'K';
           ffpkys(fptr, name, tfmt, comm, status);

           /* write the TZEROn and TSCALn keywords */
           ffkeyn("TZERO", ii + 1, card, status);
           strcat(card, "     ");  /* make sure name is >= 8 chars long */
           *(card+8) = '\0';
	   strcat(card, "=  9223372036854775808 / offset for unsigned integers");
	   fits_write_record(fptr, card, status);

           ffkeyn("TSCAL", ii + 1, name, status);
           strcpy(comm, "data are not scaled");
           ffpkyg(fptr, name, 1., 0, comm, status);
        }
        else
        {
           ffpkys(fptr, name, tfmt, comm, status);
        }

        if (tunit)
        {
         if (tunit[ii] && *(tunit[ii]) ) /* optional TUNITn keyword */
         {
          ffkeyn("TUNIT", ii + 1, name, status);
          ffpkys(fptr, name, tunit[ii],
             "physical unit of field", status);
         }
        }

        if (*status > 0)
            break;       /* abort loop on error */
    }

    if (extnm[0])       /* optional EXTNAME keyword */
        ffpkys(fptr, "EXTNAME", extnm,
               "name of this binary table extension", status);

    if (*status > 0)
        ffpmsg("Failed to write binary table header keywords (ffphbn)");

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffphext(fitsfile *fptr,  /* I - FITS file pointer                       */
           const char *xtensionx,   /* I - value for the XTENSION keyword          */
           int bitpix,       /* I - value for the BIXPIX keyword            */
           int naxis,        /* I - value for the NAXIS keyword             */
           long naxes[],     /* I - value for the NAXISn keywords           */
           LONGLONG pcount,  /* I - value for the PCOUNT keyword            */
           LONGLONG gcount,  /* I - value for the GCOUNT keyword            */
           int *status)      /* IO - error status                           */
/*
  Put required Header keywords into a conforming extension:
*/
{
    char message[FLEN_ERRMSG],comm[81], name[20], xtension[FLEN_VALUE];
    int ii;
 
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    if (*status > 0)
        return(*status);
    else if ((fptr->Fptr)->headend != (fptr->Fptr)->headstart[(fptr->Fptr)->curhdu] )
        return(*status = HEADER_NOT_EMPTY);

    if (naxis < 0 || naxis > 999)
    {
        snprintf(message,FLEN_ERRMSG,
        "Illegal value for NAXIS keyword: %d", naxis);
        ffpmsg(message);
        return(*status = BAD_NAXIS);
    }

    xtension[0] = '\0';
    strncat(xtension, xtensionx, FLEN_VALUE-1);

    ffpkys(fptr, "XTENSION", xtension, "extension type", status);
    ffpkyj(fptr, "BITPIX",   bitpix,   "number of bits per data pixel", status);
    ffpkyj(fptr, "NAXIS",    naxis,    "number of data axes", status);

    strcpy(comm, "length of data axis ");
    for (ii = 0; ii < naxis; ii++)
    {
        if (naxes[ii] < 0)
        {
            snprintf(message,FLEN_ERRMSG,
            "Illegal negative value for NAXIS%d keyword: %.0f", ii + 1, (double) (naxes[ii]));
            ffpmsg(message);
            return(*status = BAD_NAXES);
        }

        snprintf(&comm[20], 61, "%d", ii + 1);
        ffkeyn("NAXIS", ii + 1, name, status);
        ffpkyj(fptr, name, naxes[ii], comm, status);
    }


    ffpkyj(fptr, "PCOUNT", pcount, " ", status);
    ffpkyj(fptr, "GCOUNT", gcount, " ", status);

    if (*status > 0)
        ffpmsg("Failed to write extension header keywords (ffphext)");

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffi2c(LONGLONG ival,  /* I - value to be converted to a string */
          char *cval,     /* O - character string representation of the value */
          int *status)    /* IO - error status */
/*
  convert  value to a null-terminated formatted string.
*/
{
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    cval[0] = '\0';

#if defined(_MSC_VER)
    /* Microsoft Visual C++ 6.0 uses '%I64d' syntax  for 8-byte integers */
    if (sprintf(cval, "%I64d", ival) < 0)

#elif (USE_LL_SUFFIX == 1)
    if (sprintf(cval, "%lld", ival) < 0)
#else
    if (sprintf(cval, "%ld", ival) < 0)
#endif
    {
        ffpmsg("Error in ffi2c converting integer to string");
        *status = BAD_I2C;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffu2c(ULONGLONG ival,  /* I - value to be converted to a string */
          char *cval,     /* O - character string representation of the value */
          int *status)    /* IO - error status */
/*
  convert  value to a null-terminated formatted string.
*/
{
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    cval[0] = '\0';

#if defined(_MSC_VER)
    /* Microsoft Visual C++ 6.0 uses '%I64d' syntax  for 8-byte integers */
    if (sprintf(cval, "%I64u", ival) < 0)

#elif (USE_LL_SUFFIX == 1)
    if (sprintf(cval, "%llu", ival) < 0)
#else
    if (sprintf(cval, "%lu", ival) < 0)
#endif
    {
        ffpmsg("Error in ffu2c converting integer to string");
        *status = BAD_I2C;
    }
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffl2c(int lval,    /* I - value to be converted to a string */
          char *cval,  /* O - character string representation of the value */
          int *status) /* IO - error status ) */
/*
  convert logical value to a null-terminated formatted string.  If the
  input value == 0, then the output character is the letter F, else
  the output character is the letter T.  The output string is null terminated.
*/
{
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (lval)
        strcpy(cval,"T");
    else
        strcpy(cval,"F");

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffs2c(const char *instr, /* I - null terminated input string  */
          char *outstr,      /* O - null terminated quoted output string */
          int *status)       /* IO - error status */
/*
  convert an input string to a quoted string. Leading spaces 
  are significant.  FITS string keyword values must be at least 
  8 chars long so pad out string with spaces if necessary.
      Example:   km/s ==> 'km/s    '
  Single quote characters in the input string will be replace by
  two single quote characters. e.g., o'brian ==> 'o''brian'
*/
{
    size_t len, ii, jj;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    if (!instr)            /* a null input pointer?? */
    {
       strcpy(outstr, "''");   /* a null FITS string */
       return(*status);
    }

    outstr[0] = '\'';      /* start output string with a quote */

    len = strlen(instr);
    if (len > 68)
        len = 68;    /* limit input string to 68 chars */

    for (ii=0, jj=1; ii < len && jj < 69; ii++, jj++)
    {
        outstr[jj] = instr[ii];  /* copy each char from input to output */
        if (instr[ii] == '\'')
        {
            jj++;
            outstr[jj]='\'';   /* duplicate any apostrophies in the input */
        }
    }

    for (; jj < 9; jj++)       /* pad string so it is at least 8 chars long */
        outstr[jj] = ' ';

    if (jj == 70)   /* only occurs if the last char of string was a quote */
        outstr[69] = '\0';
    else
    {
        outstr[jj] = '\'';         /* append closing quote character */
        outstr[jj+1] = '\0';          /* terminate the string */
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr2f(float fval,   /* I - value to be converted to a string */
          int  decim,   /* I - number of decimal places to display */
          char *cval,   /* O - character string representation of the value */
          int  *status) /* IO - error status */
/*
  convert float value to a null-terminated F format string
*/
{
    char *cptr;
        
    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    cval[0] = '\0';

    if (decim < 0)
    {
        ffpmsg("Error in ffr2f:  no. of decimal places < 0");
        return(*status = BAD_DECIM);
    }

    if (snprintf(cval, FLEN_VALUE,"%.*f", decim, fval) < 0)
    {
        ffpmsg("Error in ffr2f converting float to string");
        *status = BAD_F2C;
    }

    /* replace comma with a period (e.g. in French locale) */
    if ( (cptr = strchr(cval, ','))) *cptr = '.';

    /* test if output string is 'NaN', 'INDEF', or 'INF' */
    if (strchr(cval, 'N'))
    {
        ffpmsg("Error in ffr2f: float value is a NaN or INDEF");
        *status = BAD_F2C;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffr2e(float fval,  /* I - value to be converted to a string */
         int decim,    /* I - number of decimal places to display */
         char *cval,   /* O - character string representation of the value */
         int *status)  /* IO - error status */
/*
  convert float value to a null-terminated exponential format string
*/
{
    char *cptr;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    cval[0] = '\0';

    if (decim < 0)
    {   /* use G format if decim is negative */
        if ( snprintf(cval, FLEN_VALUE,"%.*G", -decim, fval) < 0)
        {
            ffpmsg("Error in ffr2e converting float to string");
            *status = BAD_F2C;
        }
        else
        {
            /* test if E format was used, and there is no displayed decimal */
            if ( !strchr(cval, '.') && strchr(cval,'E') )
            {
                /* reformat value with a decimal point and single zero */
                if ( snprintf(cval, FLEN_VALUE,"%.1E", fval) < 0)
                {
                    ffpmsg("Error in ffr2e converting float to string");
                    *status = BAD_F2C;
                }

                return(*status);  
            }
        }
    }
    else
    {
        if ( snprintf(cval, FLEN_VALUE,"%.*E", decim, fval) < 0)
        {
            ffpmsg("Error in ffr2e converting float to string");
            *status = BAD_F2C;
        }
    }

    if (*status <= 0)
    {
        /* replace comma with a period (e.g. in French locale) */
        if ( (cptr = strchr(cval, ','))) *cptr = '.';

        /* test if output string is 'NaN', 'INDEF', or 'INF' */
        if (strchr(cval, 'N'))
        {
            ffpmsg("Error in ffr2e: float value is a NaN or INDEF");
            *status = BAD_F2C;
        }
        else if ( !strchr(cval, '.') && !strchr(cval,'E') && strlen(cval) < FLEN_VALUE-1 )
        {
            /* add decimal point if necessary to distinquish from integer */
            strcat(cval, ".");
        }
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffd2f(double dval,  /* I - value to be converted to a string */
          int decim,    /* I - number of decimal places to display */
          char *cval,   /* O - character string representation of the value */
          int *status)  /* IO - error status */
/*
  convert double value to a null-terminated F format string
*/
{
    char *cptr;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    cval[0] = '\0';

    if (decim < 0)
    {
        ffpmsg("Error in ffd2f:  no. of decimal places < 0");
        return(*status = BAD_DECIM);
    }

    if (snprintf(cval, FLEN_VALUE,"%.*f", decim, dval) < 0)
    {
        ffpmsg("Error in ffd2f converting double to string");
        *status = BAD_F2C;
    }

    /* replace comma with a period (e.g. in French locale) */
    if ( (cptr = strchr(cval, ','))) *cptr = '.';

    /* test if output string is 'NaN', 'INDEF', or 'INF' */
    if (strchr(cval, 'N'))
    {
        ffpmsg("Error in ffd2f: double value is a NaN or INDEF");
        *status = BAD_F2C;
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffd2e(double dval,  /* I - value to be converted to a string */
          int decim,    /* I - number of decimal places to display */
          char *cval,   /* O - character string representation of the value */
          int *status)  /* IO - error status */
/*
  convert double value to a null-terminated exponential format string.
*/
{
    char *cptr;

    if (*status > 0)           /* inherit input status value if > 0 */
        return(*status);

    cval[0] = '\0';

    if (decim < 0)
    {   /* use G format if decim is negative */
        if ( snprintf(cval, FLEN_VALUE,"%.*G", -decim, dval) < 0)
        {
            ffpmsg("Error in ffd2e converting float to string");
            *status = BAD_F2C;
        }
        else
        {
            /* test if E format was used, and there is no displayed decimal */
            if ( !strchr(cval, '.') && strchr(cval,'E') )
            {
                /* reformat value with a decimal point and single zero */
                if ( snprintf(cval, FLEN_VALUE,"%.1E", dval) < 0)
                {
                    ffpmsg("Error in ffd2e converting float to string");
                    *status = BAD_F2C;
                }

                return(*status);  
            }
        }
    }
    else
    {
        if ( snprintf(cval, FLEN_VALUE,"%.*E", decim, dval) < 0)
        {
            ffpmsg("Error in ffd2e converting float to string");
            *status = BAD_F2C;
        }
    }

    if (*status <= 0)
    {
        /* replace comma with a period (e.g. in French locale) */
        if ( (cptr = strchr(cval, ','))) *cptr = '.';

        /* test if output string is 'NaN', 'INDEF', or 'INF' */
        if (strchr(cval, 'N'))
        {
            ffpmsg("Error in ffd2e: double value is a NaN or INDEF");
            *status = BAD_F2C;
        }
        else if ( !strchr(cval, '.') && !strchr(cval,'E') && strlen(cval) < FLEN_VALUE-1)
        {
            /* add decimal point if necessary to distinquish from integer */
            strcat(cval, ".");
        }
    }

    return(*status);
}

cfitsio-3.47/quantize.c0000644000225700000360000035031113464573432014417 0ustar  cagordonlhea/*
  The following code is based on algorithms written by Richard White at STScI and made
  available for use in CFITSIO in July 1999 and updated in January 2008. 
*/

# include 
# include 
# include 
# include 
# include 

#include "fitsio2.h"

/* nearest integer function */
# define NINT(x)  ((x >= 0.) ? (int) (x + 0.5) : (int) (x - 0.5))

#define NULL_VALUE -2147483647 /* value used to represent undefined pixels */
#define ZERO_VALUE -2147483646 /* value used to represent zero-valued pixels */
#define N_RESERVED_VALUES 10   /* number of reserved values, starting with */
                               /* and including NULL_VALUE.  These values */
                               /* may not be used to represent the quantized */
                               /* and scaled floating point pixel values */
			       /* If lossy Hcompression is used, and the */
			       /* array contains null values, then it is also */
			       /* possible for the compressed values to slightly */
			       /* exceed the range of the actual (lossless) values */
			       /* so we must reserve a little more space */
			       
/* more than this many standard deviations from the mean is an outlier */
# define SIGMA_CLIP     5.
# define NITER          3	/* number of sigma-clipping iterations */

static int FnMeanSigma_short(short *array, long npix, int nullcheck, 
  short nullvalue, long *ngoodpix, double *mean, double *sigma, int *status);       
static int FnMeanSigma_int(int *array, long npix, int nullcheck,
  int nullvalue, long *ngoodpix, double *mean, double *sigma, int *status);       
static int FnMeanSigma_float(float *array, long npix, int nullcheck,
  float nullvalue, long *ngoodpix, double *mean, double *sigma, int *status);       
static int FnMeanSigma_double(double *array, long npix, int nullcheck,
  double nullvalue, long *ngoodpix, double *mean, double *sigma, int *status);       

static int FnNoise5_short(short *array, long nx, long ny, int nullcheck, 
   short nullvalue, long *ngood, short *minval, short *maxval, 
   double *n2, double *n3, double *n5, int *status);   
static int FnNoise5_int(int *array, long nx, long ny, int nullcheck, 
   int nullvalue, long *ngood, int *minval, int *maxval, 
   double *n2, double *n3, double *n5, int *status);   
static int FnNoise5_float(float *array, long nx, long ny, int nullcheck, 
   float nullvalue, long *ngood, float *minval, float *maxval, 
   double *n2, double *n3, double *n5, int *status);   
static int FnNoise5_double(double *array, long nx, long ny, int nullcheck, 
   double nullvalue, long *ngood, double *minval, double *maxval, 
   double *n2, double *n3, double *n5, int *status);   

static int FnNoise3_short(short *array, long nx, long ny, int nullcheck, 
   short nullvalue, long *ngood, short *minval, short *maxval, double *noise, int *status);       
static int FnNoise3_int(int *array, long nx, long ny, int nullcheck, 
   int nullvalue, long *ngood, int *minval, int *maxval, double *noise, int *status);          
static int FnNoise3_float(float *array, long nx, long ny, int nullcheck, 
   float nullvalue, long *ngood, float *minval, float *maxval, double *noise, int *status);        
static int FnNoise3_double(double *array, long nx, long ny, int nullcheck, 
   double nullvalue, long *ngood, double *minval, double *maxval, double *noise, int *status);        

static int FnNoise1_short(short *array, long nx, long ny, 
   int nullcheck, short nullvalue, double *noise, int *status);       
static int FnNoise1_int(int *array, long nx, long ny, 
   int nullcheck, int nullvalue, double *noise, int *status);       
static int FnNoise1_float(float *array, long nx, long ny, 
   int nullcheck, float nullvalue, double *noise, int *status);       
static int FnNoise1_double(double *array, long nx, long ny, 
   int nullcheck, double nullvalue, double *noise, int *status);       

static int FnCompare_short (const void *, const void *);
static int FnCompare_int (const void *, const void *);
static int FnCompare_float (const void *, const void *);
static int FnCompare_double (const void *, const void *);
static float quick_select_float(float arr[], int n);
static short quick_select_short(short arr[], int n);
static int quick_select_int(int arr[], int n);
static LONGLONG quick_select_longlong(LONGLONG arr[], int n);
static double quick_select_double(double arr[], int n);

/*---------------------------------------------------------------------------*/
int fits_quantize_float (long row, float fdata[], long nxpix, long nypix, int nullcheck, 
	float in_null_value, float qlevel, int dither_method, int idata[], double *bscale,
	double *bzero, int *iminval, int *imaxval) {

/* arguments:
long row            i: if positive, used to calculate random dithering seed value
                       (this is only used when dithering the quantized values)
float fdata[]       i: array of image pixels to be compressed
long nxpix          i: number of pixels in each row of fdata
long nypix          i: number of rows in fdata
nullcheck           i: check for nullvalues in fdata?
float in_null_value i: value used to represent undefined pixels in fdata
float qlevel        i: quantization level
int dither_method   i; which dithering method to use
int idata[]         o: values of fdata after applying bzero and bscale
double bscale       o: scale factor
double bzero        o: zero offset
int iminval         o: minimum quantized value that is returned
int imaxval         o: maximum quantized value that is returned

The function value will be one if the input fdata were copied to idata;
in this case the parameters bscale and bzero can be used to convert back to
nearly the original floating point values:  fdata ~= idata * bscale + bzero.
If the function value is zero, the data were not copied to idata.
*/

	int status, iseed = 0;
	long i, nx, ngood = 0;
	double stdev, noise2, noise3, noise5;	/* MAD 2nd, 3rd, and 5th order noise values */
	float minval = 0., maxval = 0.;  /* min & max of fdata */
	double delta;		/* bscale, 1 in idata = delta in fdata */
	double zeropt;	        /* bzero */
	double temp;
        int nextrand = 0;
	extern float *fits_rand_value; /* this is defined in imcompress.c */
	LONGLONG iqfactor;

	nx = nxpix * nypix;
	if (nx <= 1) {
	    *bscale = 1.;
	    *bzero  = 0.;
	    return (0);
	}

        if (qlevel >= 0.) {

	    /* estimate background noise using MAD pixel differences */
	    FnNoise5_float(fdata, nxpix, nypix, nullcheck, in_null_value, &ngood,
	        &minval, &maxval, &noise2, &noise3, &noise5, &status);      

	    if (nullcheck && ngood == 0) {   /* special case of an image filled with Nulls */
	        /* set parameters to dummy values, which are not used */
		minval = 0.;
		maxval = 1.;
		stdev = 1;
	    } else {

	        /* use the minimum of noise2, noise3, and noise5 as the best noise value */
	        stdev = noise3;
	        if (noise2 != 0. && noise2 < stdev) stdev = noise2;
	        if (noise5 != 0. && noise5 < stdev) stdev = noise5;
            }

	    if (qlevel == 0.)
	        delta = stdev / 4.;  /* default quantization */
	    else
	        delta = stdev / qlevel;

	    if (delta == 0.) 
	        return (0);			/* don't quantize */

	} else {
	    /* negative value represents the absolute quantization level */
	    delta = -qlevel;

	    /* only nned to calculate the min and max values */
	    FnNoise3_float(fdata, nxpix, nypix, nullcheck, in_null_value, &ngood,
	        &minval, &maxval, 0, &status);      
 	}

        /* check that the range of quantized levels is not > range of int */
	if ((maxval - minval) / delta > 2. * 2147483647. - N_RESERVED_VALUES )
	    return (0);			/* don't quantize */

        if (row > 0) { /* we need to dither the quantized values */
            if (!fits_rand_value) 
	        if (fits_init_randoms()) return(MEMORY_ALLOCATION);

	    /* initialize the index to the next random number in the list */
            iseed = (int) ((row - 1) % N_RANDOM);
	    nextrand = (int) (fits_rand_value[iseed] * 500.);
	}

        if (ngood == nx) {   /* don't have to check for nulls */
            /* return all positive values, if possible since some */
            /* compression algorithms either only work for positive integers, */
            /* or are more efficient.  */

            if (dither_method == SUBTRACTIVE_DITHER_2)
	    {
                /* shift the range to be close to the value used to represent zeros */
                zeropt = minval - delta * (NULL_VALUE + N_RESERVED_VALUES);
            }
	    else if ((maxval - minval) / delta < 2147483647. - N_RESERVED_VALUES )
            {
                zeropt = minval;
		/* fudge the zero point so it is an integer multiple of delta */
		/* This helps to ensure the same scaling will be performed if the */
		/* file undergoes multiple fpack/funpack cycles */
		iqfactor = (LONGLONG) (zeropt/delta  + 0.5);
		zeropt = iqfactor * delta;               
            }
            else
            {
                /* center the quantized levels around zero */
                zeropt = (minval + maxval) / 2.;
            }

            if (row > 0) {  /* dither the values when quantizing */
              for (i = 0;  i < nx;  i++) {
	    
		if (dither_method == SUBTRACTIVE_DITHER_2 && fdata[i] == 0.0) {
		   idata[i] = ZERO_VALUE;
		} else {
		   idata[i] =  NINT((((double) fdata[i] - zeropt) / delta) + fits_rand_value[nextrand] - 0.5);
		}

                nextrand++;
		if (nextrand == N_RANDOM) {
		    iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
	            nextrand = (int) (fits_rand_value[iseed] * 500);
                }
              }
            } else {  /* do not dither the values */

       	        for (i = 0;  i < nx;  i++) {
	            idata[i] = NINT ((fdata[i] - zeropt) / delta);
                }
            } 
        }
        else {
            /* data contains null values; shift the range to be */
            /* close to the value used to represent null values */
            zeropt = minval - delta * (NULL_VALUE + N_RESERVED_VALUES);

            if (row > 0) {  /* dither the values */
	      for (i = 0;  i < nx;  i++) {
                if (fdata[i] != in_null_value) {
		    if (dither_method == SUBTRACTIVE_DITHER_2 && fdata[i] == 0.0) {
		       idata[i] = ZERO_VALUE;
		    } else {
		       idata[i] =  NINT((((double) fdata[i] - zeropt) / delta) + fits_rand_value[nextrand] - 0.5);
		    }
                } else {
                    idata[i] = NULL_VALUE;
                }

                /* increment the random number index, regardless */
                nextrand++;
		if (nextrand == N_RANDOM) {
		    iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
	            nextrand = (int) (fits_rand_value[iseed] * 500);
                }
              }
            } else {  /* do not dither the values */
	       for (i = 0;  i < nx;  i++) {
 
                 if (fdata[i] != in_null_value) {
		    idata[i] =  NINT((fdata[i] - zeropt) / delta);
                 } else { 
                    idata[i] = NULL_VALUE;
                 }
               }
            }
	}

        /* calc min and max values */
        temp = (minval - zeropt) / delta;
        *iminval =  NINT (temp);
        temp = (maxval - zeropt) / delta;
        *imaxval =  NINT (temp);

	*bscale = delta;
	*bzero = zeropt;
	return (1);			/* yes, data have been quantized */
}
/*---------------------------------------------------------------------------*/
int fits_quantize_double (long row, double fdata[], long nxpix, long nypix, int nullcheck, 
	double in_null_value, float qlevel, int dither_method, int idata[], double *bscale,
	double *bzero, int *iminval, int *imaxval) {

/* arguments:
long row            i: tile number = row number in the binary table
                       (this is only used when dithering the quantized values)
double fdata[]      i: array of image pixels to be compressed
long nxpix          i: number of pixels in each row of fdata
long nypix          i: number of rows in fdata
nullcheck           i: check for nullvalues in fdata?
double in_null_value i: value used to represent undefined pixels in fdata
float qlevel        i: quantization level
int dither_method   i; which dithering method to use
int idata[]         o: values of fdata after applying bzero and bscale
double bscale       o: scale factor
double bzero        o: zero offset
int iminval         o: minimum quantized value that is returned
int imaxval         o: maximum quantized value that is returned

The function value will be one if the input fdata were copied to idata;
in this case the parameters bscale and bzero can be used to convert back to
nearly the original floating point values:  fdata ~= idata * bscale + bzero.
If the function value is zero, the data were not copied to idata.
*/

	int status, iseed = 0;
	long i, nx, ngood = 0;
	double stdev, noise2 = 0., noise3 = 0., noise5 = 0.;	/* MAD 2nd, 3rd, and 5th order noise values */
	double minval = 0., maxval = 0.;  /* min & max of fdata */
	double delta;		/* bscale, 1 in idata = delta in fdata */
	double zeropt;	        /* bzero */
	double temp;
        int nextrand = 0;
	extern float *fits_rand_value;
	LONGLONG iqfactor;

	nx = nxpix * nypix;
	if (nx <= 1) {
	    *bscale = 1.;
	    *bzero  = 0.;
	    return (0);
	}

        if (qlevel >= 0.) {

	    /* estimate background noise using MAD pixel differences */
	    FnNoise5_double(fdata, nxpix, nypix, nullcheck, in_null_value, &ngood,
	        &minval, &maxval, &noise2, &noise3, &noise5, &status);      

	    if (nullcheck && ngood == 0) {   /* special case of an image filled with Nulls */
	        /* set parameters to dummy values, which are not used */
		minval = 0.;
		maxval = 1.;
		stdev = 1;
	    } else {

	        /* use the minimum of noise2, noise3, and noise5 as the best noise value */
	        stdev = noise3;
	        if (noise2 != 0. && noise2 < stdev) stdev = noise2;
	        if (noise5 != 0. && noise5 < stdev) stdev = noise5;
            }

	    if (qlevel == 0.)
	        delta = stdev / 4.;  /* default quantization */
	    else
	        delta = stdev / qlevel;

	    if (delta == 0.) 
	        return (0);			/* don't quantize */

	} else {
	    /* negative value represents the absolute quantization level */
	    delta = -qlevel;

	    /* only nned to calculate the min and max values */
	    FnNoise3_double(fdata, nxpix, nypix, nullcheck, in_null_value, &ngood,
	        &minval, &maxval, 0, &status);      
 	}

        /* check that the range of quantized levels is not > range of int */
	if ((maxval - minval) / delta > 2. * 2147483647. - N_RESERVED_VALUES )
	    return (0);			/* don't quantize */

        if (row > 0) { /* we need to dither the quantized values */
            if (!fits_rand_value) 
	       if (fits_init_randoms()) return(MEMORY_ALLOCATION);

	    /* initialize the index to the next random number in the list */
            iseed = (int) ((row - 1) % N_RANDOM);
	    nextrand = (int) (fits_rand_value[iseed] * 500);
	}

        if (ngood == nx) {   /* don't have to check for nulls */
            /* return all positive values, if possible since some */
            /* compression algorithms either only work for positive integers, */
            /* or are more efficient.  */

            if (dither_method == SUBTRACTIVE_DITHER_2)
	    {
                /* shift the range to be close to the value used to represent zeros */
                zeropt = minval - delta * (NULL_VALUE + N_RESERVED_VALUES);
            }
	    else if ((maxval - minval) / delta < 2147483647. - N_RESERVED_VALUES )
            {
                zeropt = minval;
		/* fudge the zero point so it is an integer multiple of delta */
		/* This helps to ensure the same scaling will be performed if the */
		/* file undergoes multiple fpack/funpack cycles */
		iqfactor = (LONGLONG) (zeropt/delta  + 0.5);
		zeropt = iqfactor * delta;               
            }
            else
            {
                /* center the quantized levels around zero */
                zeropt = (minval + maxval) / 2.;
            }

            if (row > 0) {  /* dither the values when quantizing */
       	      for (i = 0;  i < nx;  i++) {

		if (dither_method == SUBTRACTIVE_DITHER_2 && fdata[i] == 0.0) {
		   idata[i] = ZERO_VALUE;
		} else {
		   idata[i] =  NINT((((double) fdata[i] - zeropt) / delta) + fits_rand_value[nextrand] - 0.5);
		}

                nextrand++;
		if (nextrand == N_RANDOM) {
                    iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
	            nextrand = (int) (fits_rand_value[iseed] * 500);
                }
              }
            } else {  /* do not dither the values */

       	        for (i = 0;  i < nx;  i++) {
	            idata[i] = NINT ((fdata[i] - zeropt) / delta);
                }
            } 
        }
        else {
            /* data contains null values; shift the range to be */
            /* close to the value used to represent null values */
            zeropt = minval - delta * (NULL_VALUE + N_RESERVED_VALUES);

            if (row > 0) {  /* dither the values */
	      for (i = 0;  i < nx;  i++) {
                if (fdata[i] != in_null_value) {
		    if (dither_method == SUBTRACTIVE_DITHER_2 && fdata[i] == 0.0) {
		       idata[i] = ZERO_VALUE;
		    } else {
		       idata[i] =  NINT((((double) fdata[i] - zeropt) / delta) + fits_rand_value[nextrand] - 0.5);
		    }
                } else {
                    idata[i] = NULL_VALUE;
                }

                /* increment the random number index, regardless */
                nextrand++;
		if (nextrand == N_RANDOM) {
		    iseed++;
		    if (iseed == N_RANDOM) iseed = 0;
	            nextrand = (int) (fits_rand_value[iseed] * 500);
                }
              }
            } else {  /* do not dither the values */
	       for (i = 0;  i < nx;  i++) {
                 if (fdata[i] != in_null_value)
		    idata[i] =  NINT((fdata[i] - zeropt) / delta);
                 else 
                    idata[i] = NULL_VALUE;
               }
            }
	}

        /* calc min and max values */
        temp = (minval - zeropt) / delta;
        *iminval =  NINT (temp);
        temp = (maxval - zeropt) / delta;
        *imaxval =  NINT (temp);

	*bscale = delta;
	*bzero = zeropt;

	return (1);			/* yes, data have been quantized */
}
/*--------------------------------------------------------------------------*/
int fits_img_stats_short(short *array, /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
	long ny,            /* number of rows in the image */
	                    /* (if this is a 3D image, then ny should be the */
			    /* product of the no. of rows times the no. of planes) */
	int nullcheck,      /* check for null values, if true */
	short nullvalue,    /* value of null pixels, if nullcheck is true */

   /* returned parameters (if the pointer is not null)  */
	long *ngoodpix,     /* number of non-null pixels in the image */
	short *minvalue,    /* returned minimum non-null value in the array */
	short *maxvalue,    /* returned maximum non-null value in the array */
	double *mean,       /* returned mean value of all non-null pixels */
	double *sigma,      /* returned R.M.S. value of all non-null pixels */
	double *noise1,     /* 1st order estimate of noise in image background level */
	double *noise2,     /* 2nd order estimate of noise in image background level */
	double *noise3,     /* 3rd order estimate of noise in image background level */
	double *noise5,     /* 5th order estimate of noise in image background level */
	int *status)        /* error status */

/*
    Compute statistics of the input short integer image.
*/
{
	long ngood;
	short minval = 0, maxval = 0;
	double xmean = 0., xsigma = 0., xnoise = 0., xnoise2 = 0., xnoise3 = 0., xnoise5 = 0.;

	/* need to calculate mean and/or sigma and/or limits? */
	if (mean || sigma ) {
		FnMeanSigma_short(array, nx * ny, nullcheck, nullvalue, 
			&ngood, &xmean, &xsigma, status);

	    if (ngoodpix) *ngoodpix = ngood;
	    if (mean)     *mean = xmean;
	    if (sigma)    *sigma = xsigma;
	}

	if (noise1) {
		FnNoise1_short(array, nx, ny, nullcheck, nullvalue, 
		  &xnoise, status);

		*noise1  = xnoise;
	}

	if (minvalue || maxvalue || noise3) {
		FnNoise5_short(array, nx, ny, nullcheck, nullvalue, 
			&ngood, &minval, &maxval, &xnoise2, &xnoise3, &xnoise5, status);

		if (ngoodpix) *ngoodpix = ngood;
		if (minvalue) *minvalue= minval;
		if (maxvalue) *maxvalue = maxval;
		if (noise2) *noise2  = xnoise2;
		if (noise3) *noise3  = xnoise3;
		if (noise5) *noise5  = xnoise5;
	}
	return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_img_stats_int(int *array, /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
	long ny,            /* number of rows in the image */
	                    /* (if this is a 3D image, then ny should be the */
			    /* product of the no. of rows times the no. of planes) */
	int nullcheck,      /* check for null values, if true */
	int nullvalue,    /* value of null pixels, if nullcheck is true */

   /* returned parameters (if the pointer is not null)  */
	long *ngoodpix,     /* number of non-null pixels in the image */
	int *minvalue,    /* returned minimum non-null value in the array */
	int *maxvalue,    /* returned maximum non-null value in the array */
	double *mean,       /* returned mean value of all non-null pixels */
	double *sigma,      /* returned R.M.S. value of all non-null pixels */
	double *noise1,     /* 1st order estimate of noise in image background level */
	double *noise2,     /* 2nd order estimate of noise in image background level */
	double *noise3,     /* 3rd order estimate of noise in image background level */
	double *noise5,     /* 5th order estimate of noise in image background level */
	int *status)        /* error status */

/*
    Compute statistics of the input integer image.
*/
{
	long ngood;
	int minval = 0, maxval = 0;
	double xmean = 0., xsigma = 0., xnoise = 0., xnoise2 = 0., xnoise3 = 0., xnoise5 = 0.;

	/* need to calculate mean and/or sigma and/or limits? */
	if (mean || sigma ) {
		FnMeanSigma_int(array, nx * ny, nullcheck, nullvalue, 
			&ngood, &xmean, &xsigma, status);

	    if (ngoodpix) *ngoodpix = ngood;
	    if (mean)     *mean = xmean;
	    if (sigma)    *sigma = xsigma;
	}

	if (noise1) {
		FnNoise1_int(array, nx, ny, nullcheck, nullvalue, 
		  &xnoise, status);

		*noise1  = xnoise;
	}

	if (minvalue || maxvalue || noise3) {
		FnNoise5_int(array, nx, ny, nullcheck, nullvalue, 
			&ngood, &minval, &maxval, &xnoise2, &xnoise3, &xnoise5, status);

		if (ngoodpix) *ngoodpix = ngood;
		if (minvalue) *minvalue= minval;
		if (maxvalue) *maxvalue = maxval;
		if (noise2) *noise2  = xnoise2;
		if (noise3) *noise3  = xnoise3;
		if (noise5) *noise5  = xnoise5;
	}
	return(*status);
}
/*--------------------------------------------------------------------------*/
int fits_img_stats_float(float *array, /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
	long ny,            /* number of rows in the image */
	                    /* (if this is a 3D image, then ny should be the */
			    /* product of the no. of rows times the no. of planes) */
	int nullcheck,      /* check for null values, if true */
	float nullvalue,    /* value of null pixels, if nullcheck is true */

   /* returned parameters (if the pointer is not null)  */
	long *ngoodpix,     /* number of non-null pixels in the image */
	float *minvalue,    /* returned minimum non-null value in the array */
	float *maxvalue,    /* returned maximum non-null value in the array */
	double *mean,       /* returned mean value of all non-null pixels */
	double *sigma,      /* returned R.M.S. value of all non-null pixels */
	double *noise1,     /* 1st order estimate of noise in image background level */
	double *noise2,     /* 2nd order estimate of noise in image background level */
	double *noise3,     /* 3rd order estimate of noise in image background level */
	double *noise5,     /* 5th order estimate of noise in image background level */
	int *status)        /* error status */

/*
    Compute statistics of the input float image.
*/
{
	long ngood;
	float minval, maxval;
	double xmean = 0., xsigma = 0., xnoise = 0., xnoise2 = 0., xnoise3 = 0., xnoise5 = 0.;

	/* need to calculate mean and/or sigma and/or limits? */
	if (mean || sigma ) {
		FnMeanSigma_float(array, nx * ny, nullcheck, nullvalue, 
			&ngood, &xmean, &xsigma, status);

	    if (ngoodpix) *ngoodpix = ngood;
	    if (mean)     *mean = xmean;
	    if (sigma)    *sigma = xsigma;
	}

	if (noise1) {
		FnNoise1_float(array, nx, ny, nullcheck, nullvalue, 
		  &xnoise, status);

		*noise1  = xnoise;
	}

	if (minvalue || maxvalue || noise3) {
		FnNoise5_float(array, nx, ny, nullcheck, nullvalue, 
			&ngood, &minval, &maxval, &xnoise2, &xnoise3, &xnoise5, status);

		if (ngoodpix) *ngoodpix = ngood;
		if (minvalue) *minvalue= minval;
		if (maxvalue) *maxvalue = maxval;
		if (noise2) *noise2  = xnoise2;
		if (noise3) *noise3  = xnoise3;
		if (noise5) *noise5  = xnoise5;
	}
	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnMeanSigma_short
       (short *array,       /*  2 dimensional array of image pixels */
        long npix,          /* number of pixels in the image */
	int nullcheck,      /* check for null values, if true */
	short nullvalue,    /* value of null pixels, if nullcheck is true */

   /* returned parameters */
   
	long *ngoodpix,     /* number of non-null pixels in the image */
	double *mean,       /* returned mean value of all non-null pixels */
	double *sigma,      /* returned R.M.S. value of all non-null pixels */
	int *status)        /* error status */

/*
Compute mean and RMS sigma of the non-null pixels in the input array.
*/
{
	long ii, ngood = 0;
	short *value;
	double sum = 0., sum2 = 0., xtemp;

	value = array;
	    
	if (nullcheck) {
	        for (ii = 0; ii < npix; ii++, value++) {
		    if (*value != nullvalue) {
		        ngood++;
		        xtemp = (double) *value;
		        sum += xtemp;
		        sum2 += (xtemp * xtemp);
		    }
		}
	} else {
	        ngood = npix;
	        for (ii = 0; ii < npix; ii++, value++) {
		        xtemp = (double) *value;
		        sum += xtemp;
		        sum2 += (xtemp * xtemp);
		}
	}

	if (ngood > 1) {
		if (ngoodpix) *ngoodpix = ngood;
		xtemp = sum / ngood;
		if (mean)     *mean = xtemp;
		if (sigma)    *sigma = sqrt((sum2 / ngood) - (xtemp * xtemp));
	} else if (ngood == 1){
		if (ngoodpix) *ngoodpix = 1;
		if (mean)     *mean = sum;
		if (sigma)    *sigma = 0.0;
	} else {
		if (ngoodpix) *ngoodpix = 0;
	        if (mean)     *mean = 0.;
		if (sigma)    *sigma = 0.;
	}	    
	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnMeanSigma_int
       (int *array,       /*  2 dimensional array of image pixels */
        long npix,          /* number of pixels in the image */
	int nullcheck,      /* check for null values, if true */
	int nullvalue,    /* value of null pixels, if nullcheck is true */

   /* returned parameters */
   
	long *ngoodpix,     /* number of non-null pixels in the image */
	double *mean,       /* returned mean value of all non-null pixels */
	double *sigma,      /* returned R.M.S. value of all non-null pixels */
	int *status)        /* error status */

/*
Compute mean and RMS sigma of the non-null pixels in the input array.
*/
{
	long ii, ngood = 0;
	int *value;
	double sum = 0., sum2 = 0., xtemp;

	value = array;
	    
	if (nullcheck) {
	        for (ii = 0; ii < npix; ii++, value++) {
		    if (*value != nullvalue) {
		        ngood++;
		        xtemp = (double) *value;
		        sum += xtemp;
		        sum2 += (xtemp * xtemp);
		    }
		}
	} else {
	        ngood = npix;
	        for (ii = 0; ii < npix; ii++, value++) {
		        xtemp = (double) *value;
		        sum += xtemp;
		        sum2 += (xtemp * xtemp);
		}
	}

	if (ngood > 1) {
		if (ngoodpix) *ngoodpix = ngood;
		xtemp = sum / ngood;
		if (mean)     *mean = xtemp;
		if (sigma)    *sigma = sqrt((sum2 / ngood) - (xtemp * xtemp));
	} else if (ngood == 1){
		if (ngoodpix) *ngoodpix = 1;
		if (mean)     *mean = sum;
		if (sigma)    *sigma = 0.0;
	} else {
		if (ngoodpix) *ngoodpix = 0;
	        if (mean)     *mean = 0.;
		if (sigma)    *sigma = 0.;
	}	    
	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnMeanSigma_float
       (float *array,       /*  2 dimensional array of image pixels */
        long npix,          /* number of pixels in the image */
	int nullcheck,      /* check for null values, if true */
	float nullvalue,    /* value of null pixels, if nullcheck is true */

   /* returned parameters */
   
	long *ngoodpix,     /* number of non-null pixels in the image */
	double *mean,       /* returned mean value of all non-null pixels */
	double *sigma,      /* returned R.M.S. value of all non-null pixels */
	int *status)        /* error status */

/*
Compute mean and RMS sigma of the non-null pixels in the input array.
*/
{
	long ii, ngood = 0;
	float *value;
	double sum = 0., sum2 = 0., xtemp;

	value = array;
	    
	if (nullcheck) {
	        for (ii = 0; ii < npix; ii++, value++) {
		    if (*value != nullvalue) {
		        ngood++;
		        xtemp = (double) *value;
		        sum += xtemp;
		        sum2 += (xtemp * xtemp);
		    }
		}
	} else {
	        ngood = npix;
	        for (ii = 0; ii < npix; ii++, value++) {
		        xtemp = (double) *value;
		        sum += xtemp;
		        sum2 += (xtemp * xtemp);
		}
	}

	if (ngood > 1) {
		if (ngoodpix) *ngoodpix = ngood;
		xtemp = sum / ngood;
		if (mean)     *mean = xtemp;
		if (sigma)    *sigma = sqrt((sum2 / ngood) - (xtemp * xtemp));
	} else if (ngood == 1){
		if (ngoodpix) *ngoodpix = 1;
		if (mean)     *mean = sum;
		if (sigma)    *sigma = 0.0;
	} else {
		if (ngoodpix) *ngoodpix = 0;
	        if (mean)     *mean = 0.;
		if (sigma)    *sigma = 0.;
	}	    
	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnMeanSigma_double
       (double *array,       /*  2 dimensional array of image pixels */
        long npix,          /* number of pixels in the image */
	int nullcheck,      /* check for null values, if true */
	double nullvalue,    /* value of null pixels, if nullcheck is true */

   /* returned parameters */
   
	long *ngoodpix,     /* number of non-null pixels in the image */
	double *mean,       /* returned mean value of all non-null pixels */
	double *sigma,      /* returned R.M.S. value of all non-null pixels */
	int *status)        /* error status */

/*
Compute mean and RMS sigma of the non-null pixels in the input array.
*/
{
	long ii, ngood = 0;
	double *value;
	double sum = 0., sum2 = 0., xtemp;

	value = array;
	    
	if (nullcheck) {
	        for (ii = 0; ii < npix; ii++, value++) {
		    if (*value != nullvalue) {
		        ngood++;
		        xtemp = *value;
		        sum += xtemp;
		        sum2 += (xtemp * xtemp);
		    }
		}
	} else {
	        ngood = npix;
	        for (ii = 0; ii < npix; ii++, value++) {
		        xtemp = *value;
		        sum += xtemp;
		        sum2 += (xtemp * xtemp);
		}
	}

	if (ngood > 1) {
		if (ngoodpix) *ngoodpix = ngood;
		xtemp = sum / ngood;
		if (mean)     *mean = xtemp;
		if (sigma)    *sigma = sqrt((sum2 / ngood) - (xtemp * xtemp));
	} else if (ngood == 1){
		if (ngoodpix) *ngoodpix = 1;
		if (mean)     *mean = sum;
		if (sigma)    *sigma = 0.0;
	} else {
		if (ngoodpix) *ngoodpix = 0;
	        if (mean)     *mean = 0.;
		if (sigma)    *sigma = 0.;
	}	    
	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnNoise5_short
       (short *array,       /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
        long ny,            /* number of rows in the image */
	int nullcheck,      /* check for null values, if true */
	short nullvalue,    /* value of null pixels, if nullcheck is true */
   /* returned parameters */   
	long *ngood,        /* number of good, non-null pixels? */
	short *minval,    /* minimum non-null value */
	short *maxval,    /* maximum non-null value */
	double *noise2,      /* returned 2nd order MAD of all non-null pixels */
	double *noise3,      /* returned 3rd order MAD of all non-null pixels */
	double *noise5,      /* returned 5th order MAD of all non-null pixels */
	int *status)        /* error status */

/*
Estimate the median and background noise in the input image using 2nd, 3rd and 5th
order Median Absolute Differences.

The noise in the background of the image is calculated using the MAD algorithms 
developed for deriving the signal to noise ratio in spectra
(see issue #42 of the ST-ECF newsletter, http://www.stecf.org/documents/newsletter/)

3rd order:  noise = 1.482602 / sqrt(6) * median (abs(2*flux(i) - flux(i-2) - flux(i+2)))

The returned estimates are the median of the values that are computed for each 
row of the image.
*/
{
	long ii, jj, nrows = 0, nrows2 = 0, nvals, nvals2, ngoodpix = 0;
	int *differences2, *differences3, *differences5;
	short *rowpix, v1, v2, v3, v4, v5, v6, v7, v8, v9;
	short xminval = SHRT_MAX, xmaxval = SHRT_MIN;
	int do_range = 0;
	double *diffs2, *diffs3, *diffs5; 
	double xnoise2 = 0, xnoise3 = 0, xnoise5 = 0;
	
	if (nx < 9) {
		/* treat entire array as an image with a single row */
		nx = nx * ny;
		ny = 1;
	}

	/* rows must have at least 9 pixels */
	if (nx < 9) {

		for (ii = 0; ii < nx; ii++) {
		    if (nullcheck && array[ii] == nullvalue)
		        continue;
		    else {
			if (array[ii] < xminval) xminval = array[ii];
			if (array[ii] > xmaxval) xmaxval = array[ii];
			ngoodpix++;
		    }
		}
		if (minval) *minval = xminval;
		if (maxval) *maxval = xmaxval;
		if (ngood) *ngood = ngoodpix;
		if (noise2) *noise2 = 0.;
		if (noise3) *noise3 = 0.;
		if (noise5) *noise5 = 0.;
		return(*status);
	}

	/* do we need to compute the min and max value? */
	if (minval || maxval) do_range = 1;
	
        /* allocate arrays used to compute the median and noise estimates */
	differences2 = calloc(nx, sizeof(int));
	if (!differences2) {
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}
	differences3 = calloc(nx, sizeof(int));
	if (!differences3) {
		free(differences2);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}
	differences5 = calloc(nx, sizeof(int));
	if (!differences5) {
		free(differences2);
		free(differences3);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs2 = calloc(ny, sizeof(double));
	if (!diffs2) {
		free(differences2);
		free(differences3);
		free(differences5);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs3 = calloc(ny, sizeof(double));
	if (!diffs3) {
		free(differences2);
		free(differences3);
		free(differences5);
		free(diffs2);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs5 = calloc(ny, sizeof(double));
	if (!diffs5) {
		free(differences2);
		free(differences3);
		free(differences5);
		free(diffs2);
		free(diffs3);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	/* loop over each row of the image */
	for (jj=0; jj < ny; jj++) {

                rowpix = array + (jj * nx); /* point to first pixel in the row */

		/***** find the first valid pixel in row */
		ii = 0;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v1 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v1 < xminval) xminval = v1;
			if (v1 > xmaxval) xmaxval = v1;
		}

		/***** find the 2nd valid pixel in row (which we will skip over) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v2 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;
		
		if (do_range) {
			if (v2 < xminval) xminval = v2;
			if (v2 > xmaxval) xmaxval = v2;
		}

		/***** find the 3rd valid pixel in row */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v3 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v3 < xminval) xminval = v3;
			if (v3 > xmaxval) xmaxval = v3;
		}
				
		/* find the 4nd valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v4 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v4 < xminval) xminval = v4;
			if (v4 > xmaxval) xmaxval = v4;
		}
			
		/* find the 5th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v5 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v5 < xminval) xminval = v5;
			if (v5 > xmaxval) xmaxval = v5;
		}
				
		/* find the 6th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v6 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v6 < xminval) xminval = v6;
			if (v6 > xmaxval) xmaxval = v6;
		}
				
		/* find the 7th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v7 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v7 < xminval) xminval = v7;
			if (v7 > xmaxval) xmaxval = v7;
		}
				
		/* find the 8th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v8 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v8 < xminval) xminval = v8;
			if (v8 > xmaxval) xmaxval = v8;
		}
		/* now populate the differences arrays */
		/* for the remaining pixels in the row */
		nvals = 0;
		nvals2 = 0;
		for (ii++; ii < nx; ii++) {

		    /* find the next valid pixel in row */
                    if (nullcheck)
		        while (ii < nx && rowpix[ii] == nullvalue) ii++;
		     
		    if (ii == nx) break;  /* hit end of row */
		    v9 = rowpix[ii];  /* store the good pixel value */

		    if (do_range) {
			if (v9 < xminval) xminval = v9;
			if (v9 > xmaxval) xmaxval = v9;
		    }

		    /* construct array of absolute differences */

		    if (!(v5 == v6 && v6 == v7) ) {
		        differences2[nvals2] =  abs((int) v5 - (int) v7);
			nvals2++;
		    }

		    if (!(v3 == v4 && v4 == v5 && v5 == v6 && v6 == v7) ) {
		        differences3[nvals] =  abs((2 * (int) v5) - (int) v3 - (int) v7);
		        differences5[nvals] =  abs((6 * (int) v5) - (4 * (int) v3) - (4 * (int) v7) + (int) v1 + (int) v9);
		        nvals++;  
		    } else {
		        /* ignore constant background regions */
			ngoodpix++;
		    }

		    /* shift over 1 pixel */
		    v1 = v2;
		    v2 = v3;
		    v3 = v4;
		    v4 = v5;
		    v5 = v6;
		    v6 = v7;
		    v7 = v8;
		    v8 = v9;
	        }  /* end of loop over pixels in the row */

		/* compute the median diffs */
		/* Note that there are 8 more pixel values than there are diffs values. */
		ngoodpix += nvals;

		if (nvals == 0) {
		    continue;  /* cannot compute medians on this row */
		} else if (nvals == 1) {
		    if (nvals2 == 1) {
		        diffs2[nrows2] = differences2[0];
			nrows2++;
		    }
		        
		    diffs3[nrows] = differences3[0];
		    diffs5[nrows] = differences5[0];
		} else {
                    /* quick_select returns the median MUCH faster than using qsort */
		    if (nvals2 > 1) {
                        diffs2[nrows2] = quick_select_int(differences2, nvals);
			nrows2++;
		    }

                    diffs3[nrows] = quick_select_int(differences3, nvals);
                    diffs5[nrows] = quick_select_int(differences5, nvals);
		}

		nrows++;
	}  /* end of loop over rows */

	    /* compute median of the values for each row */
	if (nrows == 0) { 
	       xnoise3 = 0;
	       xnoise5 = 0;
	} else if (nrows == 1) {
	       xnoise3 = diffs3[0];
	       xnoise5 = diffs5[0];
	} else {	    
	       qsort(diffs3, nrows, sizeof(double), FnCompare_double);
	       qsort(diffs5, nrows, sizeof(double), FnCompare_double);
	       xnoise3 =  (diffs3[(nrows - 1)/2] + diffs3[nrows/2]) / 2.;
	       xnoise5 =  (diffs5[(nrows - 1)/2] + diffs5[nrows/2]) / 2.;
	}

	if (nrows2 == 0) { 
	       xnoise2 = 0;
	} else if (nrows2 == 1) {
	       xnoise2 = diffs2[0];
	} else {	    
	       qsort(diffs2, nrows2, sizeof(double), FnCompare_double);
	       xnoise2 =  (diffs2[(nrows2 - 1)/2] + diffs2[nrows2/2]) / 2.;
	}

	if (ngood)  *ngood  = ngoodpix;
	if (minval) *minval = xminval;
	if (maxval) *maxval = xmaxval;
	if (noise2)  *noise2  = 1.0483579 * xnoise2;
	if (noise3)  *noise3  = 0.6052697 * xnoise3;
	if (noise5)  *noise5  = 0.1772048 * xnoise5;

	free(diffs5);
	free(diffs3);
	free(diffs2);
	free(differences5);
	free(differences3);
	free(differences2);

	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnNoise5_int
       (int *array,       /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
        long ny,            /* number of rows in the image */
	int nullcheck,      /* check for null values, if true */
	int nullvalue,    /* value of null pixels, if nullcheck is true */
   /* returned parameters */   
	long *ngood,        /* number of good, non-null pixels? */
	int *minval,    /* minimum non-null value */
	int *maxval,    /* maximum non-null value */
	double *noise2,      /* returned 2nd order MAD of all non-null pixels */
	double *noise3,      /* returned 3rd order MAD of all non-null pixels */
	double *noise5,      /* returned 5th order MAD of all non-null pixels */
	int *status)        /* error status */

/*
Estimate the median and background noise in the input image using 2nd, 3rd and 5th
order Median Absolute Differences.

The noise in the background of the image is calculated using the MAD algorithms 
developed for deriving the signal to noise ratio in spectra
(see issue #42 of the ST-ECF newsletter, http://www.stecf.org/documents/newsletter/)

3rd order:  noise = 1.482602 / sqrt(6) * median (abs(2*flux(i) - flux(i-2) - flux(i+2)))

The returned estimates are the median of the values that are computed for each 
row of the image.
*/
{
	long ii, jj, nrows = 0, nrows2 = 0, nvals, nvals2, ngoodpix = 0;
	LONGLONG *differences2, *differences3, *differences5, tdiff;
	int *rowpix, v1, v2, v3, v4, v5, v6, v7, v8, v9;
	int xminval = INT_MAX, xmaxval = INT_MIN;
	int do_range = 0;
	double *diffs2, *diffs3, *diffs5; 
	double xnoise2 = 0, xnoise3 = 0, xnoise5 = 0;
	
	if (nx < 9) {
		/* treat entire array as an image with a single row */
		nx = nx * ny;
		ny = 1;
	}

	/* rows must have at least 9 pixels */
	if (nx < 9) {

		for (ii = 0; ii < nx; ii++) {
		    if (nullcheck && array[ii] == nullvalue)
		        continue;
		    else {
			if (array[ii] < xminval) xminval = array[ii];
			if (array[ii] > xmaxval) xmaxval = array[ii];
			ngoodpix++;
		    }
		}
		if (minval) *minval = xminval;
		if (maxval) *maxval = xmaxval;
		if (ngood) *ngood = ngoodpix;
		if (noise2) *noise2 = 0.;
		if (noise3) *noise3 = 0.;
		if (noise5) *noise5 = 0.;
		return(*status);
	}

	/* do we need to compute the min and max value? */
	if (minval || maxval) do_range = 1;
	
        /* allocate arrays used to compute the median and noise estimates */
	differences2 = calloc(nx, sizeof(LONGLONG));
	if (!differences2) {
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}
	differences3 = calloc(nx, sizeof(LONGLONG));
	if (!differences3) {
		free(differences2);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}
	differences5 = calloc(nx, sizeof(LONGLONG));
	if (!differences5) {
		free(differences2);
		free(differences3);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs2 = calloc(ny, sizeof(double));
	if (!diffs2) {
		free(differences2);
		free(differences3);
		free(differences5);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs3 = calloc(ny, sizeof(double));
	if (!diffs3) {
		free(differences2);
		free(differences3);
		free(differences5);
		free(diffs2);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs5 = calloc(ny, sizeof(double));
	if (!diffs5) {
		free(differences2);
		free(differences3);
		free(differences5);
		free(diffs2);
		free(diffs3);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	/* loop over each row of the image */
	for (jj=0; jj < ny; jj++) {

                rowpix = array + (jj * nx); /* point to first pixel in the row */

		/***** find the first valid pixel in row */
		ii = 0;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v1 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v1 < xminval) xminval = v1;
			if (v1 > xmaxval) xmaxval = v1;
		}

		/***** find the 2nd valid pixel in row (which we will skip over) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v2 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;
		
		if (do_range) {
			if (v2 < xminval) xminval = v2;
			if (v2 > xmaxval) xmaxval = v2;
		}

		/***** find the 3rd valid pixel in row */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v3 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v3 < xminval) xminval = v3;
			if (v3 > xmaxval) xmaxval = v3;
		}
				
		/* find the 4nd valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v4 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v4 < xminval) xminval = v4;
			if (v4 > xmaxval) xmaxval = v4;
		}
			
		/* find the 5th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v5 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v5 < xminval) xminval = v5;
			if (v5 > xmaxval) xmaxval = v5;
		}
				
		/* find the 6th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v6 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v6 < xminval) xminval = v6;
			if (v6 > xmaxval) xmaxval = v6;
		}
				
		/* find the 7th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v7 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v7 < xminval) xminval = v7;
			if (v7 > xmaxval) xmaxval = v7;
		}
				
		/* find the 8th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v8 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v8 < xminval) xminval = v8;
			if (v8 > xmaxval) xmaxval = v8;
		}
		/* now populate the differences arrays */
		/* for the remaining pixels in the row */
		nvals = 0;
		nvals2 = 0;
		for (ii++; ii < nx; ii++) {

		    /* find the next valid pixel in row */
                    if (nullcheck)
		        while (ii < nx && rowpix[ii] == nullvalue) ii++;
		     
		    if (ii == nx) break;  /* hit end of row */
		    v9 = rowpix[ii];  /* store the good pixel value */

		    if (do_range) {
			if (v9 < xminval) xminval = v9;
			if (v9 > xmaxval) xmaxval = v9;
		    }

		    /* construct array of absolute differences */

		    if (!(v5 == v6 && v6 == v7) ) {
		        tdiff =  (LONGLONG) v5 - (LONGLONG) v7;
			if (tdiff < 0)
		            differences2[nvals2] =  -1 * tdiff;
			else
		            differences2[nvals2] =  tdiff;

			nvals2++;
		    }

		    if (!(v3 == v4 && v4 == v5 && v5 == v6 && v6 == v7) ) {
		        tdiff =  (2 * (LONGLONG) v5) - (LONGLONG) v3 - (LONGLONG) v7;
			if (tdiff < 0)
		            differences3[nvals] =  -1 * tdiff;
			else
		            differences3[nvals] =  tdiff;

		        tdiff =  (6 * (LONGLONG) v5) - (4 * (LONGLONG) v3) - (4 * (LONGLONG) v7) + (LONGLONG) v1 + (LONGLONG) v9;
			if (tdiff < 0)
		            differences5[nvals] =  -1 * tdiff;
			else
		            differences5[nvals] =  tdiff;

		        nvals++;  
		    } else {
		        /* ignore constant background regions */
			ngoodpix++;
		    }

		    /* shift over 1 pixel */
		    v1 = v2;
		    v2 = v3;
		    v3 = v4;
		    v4 = v5;
		    v5 = v6;
		    v6 = v7;
		    v7 = v8;
		    v8 = v9;
	        }  /* end of loop over pixels in the row */

		/* compute the median diffs */
		/* Note that there are 8 more pixel values than there are diffs values. */
		ngoodpix += nvals;

		if (nvals == 0) {
		    continue;  /* cannot compute medians on this row */
		} else if (nvals == 1) {
		    if (nvals2 == 1) {
		        diffs2[nrows2] = (double) differences2[0];
			nrows2++;
		    }
		        
		    diffs3[nrows] = (double) differences3[0];
		    diffs5[nrows] = (double) differences5[0];
		} else {
                    /* quick_select returns the median MUCH faster than using qsort */
		    if (nvals2 > 1) {
                        diffs2[nrows2] = (double) quick_select_longlong(differences2, nvals);
			nrows2++;
		    }

                    diffs3[nrows] = (double) quick_select_longlong(differences3, nvals);
                    diffs5[nrows] = (double) quick_select_longlong(differences5, nvals);
		}

		nrows++;
	}  /* end of loop over rows */

	    /* compute median of the values for each row */
	if (nrows == 0) { 
	       xnoise3 = 0;
	       xnoise5 = 0;
	} else if (nrows == 1) {
	       xnoise3 = diffs3[0];
	       xnoise5 = diffs5[0];
	} else {	    
	       qsort(diffs3, nrows, sizeof(double), FnCompare_double);
	       qsort(diffs5, nrows, sizeof(double), FnCompare_double);
	       xnoise3 =  (diffs3[(nrows - 1)/2] + diffs3[nrows/2]) / 2.;
	       xnoise5 =  (diffs5[(nrows - 1)/2] + diffs5[nrows/2]) / 2.;
	}

	if (nrows2 == 0) { 
	       xnoise2 = 0;
	} else if (nrows2 == 1) {
	       xnoise2 = diffs2[0];
	} else {	    
	       qsort(diffs2, nrows2, sizeof(double), FnCompare_double);
	       xnoise2 =  (diffs2[(nrows2 - 1)/2] + diffs2[nrows2/2]) / 2.;
	}

	if (ngood)  *ngood  = ngoodpix;
	if (minval) *minval = xminval;
	if (maxval) *maxval = xmaxval;
	if (noise2)  *noise2  = 1.0483579 * xnoise2;
	if (noise3)  *noise3  = 0.6052697 * xnoise3;
	if (noise5)  *noise5  = 0.1772048 * xnoise5;

	free(diffs5);
	free(diffs3);
	free(diffs2);
	free(differences5);
	free(differences3);
	free(differences2);

	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnNoise5_float
       (float *array,       /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
        long ny,            /* number of rows in the image */
	int nullcheck,      /* check for null values, if true */
	float nullvalue,    /* value of null pixels, if nullcheck is true */
   /* returned parameters */   
	long *ngood,        /* number of good, non-null pixels? */
	float *minval,    /* minimum non-null value */
	float *maxval,    /* maximum non-null value */
	double *noise2,      /* returned 2nd order MAD of all non-null pixels */
	double *noise3,      /* returned 3rd order MAD of all non-null pixels */
	double *noise5,      /* returned 5th order MAD of all non-null pixels */
	int *status)        /* error status */

/*
Estimate the median and background noise in the input image using 2nd, 3rd and 5th
order Median Absolute Differences.

The noise in the background of the image is calculated using the MAD algorithms 
developed for deriving the signal to noise ratio in spectra
(see issue #42 of the ST-ECF newsletter, http://www.stecf.org/documents/newsletter/)

3rd order:  noise = 1.482602 / sqrt(6) * median (abs(2*flux(i) - flux(i-2) - flux(i+2)))

The returned estimates are the median of the values that are computed for each 
row of the image.
*/
{
	long ii, jj, nrows = 0, nrows2 = 0, nvals, nvals2, ngoodpix = 0;
	float *differences2, *differences3, *differences5;
	float *rowpix, v1, v2, v3, v4, v5, v6, v7, v8, v9;
	float xminval = FLT_MAX, xmaxval = -FLT_MAX;
	int do_range = 0;
	double *diffs2, *diffs3, *diffs5; 
	double xnoise2 = 0, xnoise3 = 0, xnoise5 = 0;
	
	if (nx < 9) {
		/* treat entire array as an image with a single row */
		nx = nx * ny;
		ny = 1;
	}

	/* rows must have at least 9 pixels */
	if (nx < 9) {

		for (ii = 0; ii < nx; ii++) {
		    if (nullcheck && array[ii] == nullvalue)
		        continue;
		    else {
			if (array[ii] < xminval) xminval = array[ii];
			if (array[ii] > xmaxval) xmaxval = array[ii];
			ngoodpix++;
		    }
		}
		if (minval) *minval = xminval;
		if (maxval) *maxval = xmaxval;
		if (ngood) *ngood = ngoodpix;
		if (noise2) *noise2 = 0.;
		if (noise3) *noise3 = 0.;
		if (noise5) *noise5 = 0.;
		return(*status);
	}

	/* do we need to compute the min and max value? */
	if (minval || maxval) do_range = 1;
	
        /* allocate arrays used to compute the median and noise estimates */
	differences2 = calloc(nx, sizeof(float));
	if (!differences2) {
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}
	differences3 = calloc(nx, sizeof(float));
	if (!differences3) {
		free(differences2);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}
	differences5 = calloc(nx, sizeof(float));
	if (!differences5) {
		free(differences2);
		free(differences3);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs2 = calloc(ny, sizeof(double));
	if (!diffs2) {
		free(differences2);
		free(differences3);
		free(differences5);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs3 = calloc(ny, sizeof(double));
	if (!diffs3) {
		free(differences2);
		free(differences3);
		free(differences5);
		free(diffs2);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs5 = calloc(ny, sizeof(double));
	if (!diffs5) {
		free(differences2);
		free(differences3);
		free(differences5);
		free(diffs2);
		free(diffs3);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	/* loop over each row of the image */
	for (jj=0; jj < ny; jj++) {

                rowpix = array + (jj * nx); /* point to first pixel in the row */

		/***** find the first valid pixel in row */
		ii = 0;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v1 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v1 < xminval) xminval = v1;
			if (v1 > xmaxval) xmaxval = v1;
		}

		/***** find the 2nd valid pixel in row (which we will skip over) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v2 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;
		
		if (do_range) {
			if (v2 < xminval) xminval = v2;
			if (v2 > xmaxval) xmaxval = v2;
		}

		/***** find the 3rd valid pixel in row */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v3 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v3 < xminval) xminval = v3;
			if (v3 > xmaxval) xmaxval = v3;
		}
				
		/* find the 4nd valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v4 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v4 < xminval) xminval = v4;
			if (v4 > xmaxval) xmaxval = v4;
		}
			
		/* find the 5th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v5 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v5 < xminval) xminval = v5;
			if (v5 > xmaxval) xmaxval = v5;
		}
				
		/* find the 6th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v6 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v6 < xminval) xminval = v6;
			if (v6 > xmaxval) xmaxval = v6;
		}
				
		/* find the 7th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v7 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v7 < xminval) xminval = v7;
			if (v7 > xmaxval) xmaxval = v7;
		}
				
		/* find the 8th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v8 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v8 < xminval) xminval = v8;
			if (v8 > xmaxval) xmaxval = v8;
		}
		/* now populate the differences arrays */
		/* for the remaining pixels in the row */
		nvals = 0;
		nvals2 = 0;
		for (ii++; ii < nx; ii++) {

		    /* find the next valid pixel in row */
                    if (nullcheck)
		        while (ii < nx && rowpix[ii] == nullvalue) ii++;
		     
		    if (ii == nx) break;  /* hit end of row */
		    v9 = rowpix[ii];  /* store the good pixel value */

		    if (do_range) {
			if (v9 < xminval) xminval = v9;
			if (v9 > xmaxval) xmaxval = v9;
		    }

		    /* construct array of absolute differences */

		    if (!(v5 == v6 && v6 == v7) ) {
		        differences2[nvals2] = (float) fabs(v5 - v7);
			nvals2++;
		    }

		    if (!(v3 == v4 && v4 == v5 && v5 == v6 && v6 == v7) ) {
		        differences3[nvals] = (float) fabs((2 * v5) - v3 - v7);
		        differences5[nvals] = (float) fabs((6 * v5) - (4 * v3) - (4 * v7) + v1 + v9);
		        nvals++;  
		    } else {
		        /* ignore constant background regions */
			ngoodpix++;
		    }

		    /* shift over 1 pixel */
		    v1 = v2;
		    v2 = v3;
		    v3 = v4;
		    v4 = v5;
		    v5 = v6;
		    v6 = v7;
		    v7 = v8;
		    v8 = v9;
	        }  /* end of loop over pixels in the row */

		/* compute the median diffs */
		/* Note that there are 8 more pixel values than there are diffs values. */
		ngoodpix += nvals;

		if (nvals == 0) {
		    continue;  /* cannot compute medians on this row */
		} else if (nvals == 1) {
		    if (nvals2 == 1) {
		        diffs2[nrows2] = differences2[0];
			nrows2++;
		    }
		        
		    diffs3[nrows] = differences3[0];
		    diffs5[nrows] = differences5[0];
		} else {
                    /* quick_select returns the median MUCH faster than using qsort */
		    if (nvals2 > 1) {
                        diffs2[nrows2] = quick_select_float(differences2, nvals);
			nrows2++;
		    }

                    diffs3[nrows] = quick_select_float(differences3, nvals);
                    diffs5[nrows] = quick_select_float(differences5, nvals);
		}

		nrows++;
	}  /* end of loop over rows */

	    /* compute median of the values for each row */
	if (nrows == 0) { 
	       xnoise3 = 0;
	       xnoise5 = 0;
	} else if (nrows == 1) {
	       xnoise3 = diffs3[0];
	       xnoise5 = diffs5[0];
	} else {	    
	       qsort(diffs3, nrows, sizeof(double), FnCompare_double);
	       qsort(diffs5, nrows, sizeof(double), FnCompare_double);
	       xnoise3 =  (diffs3[(nrows - 1)/2] + diffs3[nrows/2]) / 2.;
	       xnoise5 =  (diffs5[(nrows - 1)/2] + diffs5[nrows/2]) / 2.;
	}

	if (nrows2 == 0) { 
	       xnoise2 = 0;
	} else if (nrows2 == 1) {
	       xnoise2 = diffs2[0];
	} else {	    
	       qsort(diffs2, nrows2, sizeof(double), FnCompare_double);
	       xnoise2 =  (diffs2[(nrows2 - 1)/2] + diffs2[nrows2/2]) / 2.;
	}

	if (ngood)  *ngood  = ngoodpix;
	if (minval) *minval = xminval;
	if (maxval) *maxval = xmaxval;
	if (noise2)  *noise2  = 1.0483579 * xnoise2;
	if (noise3)  *noise3  = 0.6052697 * xnoise3;
	if (noise5)  *noise5  = 0.1772048 * xnoise5;

	free(diffs5);
	free(diffs3);
	free(diffs2);
	free(differences5);
	free(differences3);
	free(differences2);

	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnNoise5_double
       (double *array,       /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
        long ny,            /* number of rows in the image */
	int nullcheck,      /* check for null values, if true */
	double nullvalue,    /* value of null pixels, if nullcheck is true */
   /* returned parameters */   
	long *ngood,        /* number of good, non-null pixels? */
	double *minval,    /* minimum non-null value */
	double *maxval,    /* maximum non-null value */
	double *noise2,      /* returned 2nd order MAD of all non-null pixels */
	double *noise3,      /* returned 3rd order MAD of all non-null pixels */
	double *noise5,      /* returned 5th order MAD of all non-null pixels */
	int *status)        /* error status */

/*
Estimate the median and background noise in the input image using 2nd, 3rd and 5th
order Median Absolute Differences.

The noise in the background of the image is calculated using the MAD algorithms 
developed for deriving the signal to noise ratio in spectra
(see issue #42 of the ST-ECF newsletter, http://www.stecf.org/documents/newsletter/)

3rd order:  noise = 1.482602 / sqrt(6) * median (abs(2*flux(i) - flux(i-2) - flux(i+2)))

The returned estimates are the median of the values that are computed for each 
row of the image.
*/
{
	long ii, jj, nrows = 0, nrows2 = 0, nvals, nvals2, ngoodpix = 0;
	double *differences2, *differences3, *differences5;
	double *rowpix, v1, v2, v3, v4, v5, v6, v7, v8, v9;
	double xminval = DBL_MAX, xmaxval = -DBL_MAX;
	int do_range = 0;
	double *diffs2, *diffs3, *diffs5; 
	double xnoise2 = 0, xnoise3 = 0, xnoise5 = 0;
	
	if (nx < 9) {
		/* treat entire array as an image with a single row */
		nx = nx * ny;
		ny = 1;
	}

	/* rows must have at least 9 pixels */
	if (nx < 9) {

		for (ii = 0; ii < nx; ii++) {
		    if (nullcheck && array[ii] == nullvalue)
		        continue;
		    else {
			if (array[ii] < xminval) xminval = array[ii];
			if (array[ii] > xmaxval) xmaxval = array[ii];
			ngoodpix++;
		    }
		}
		if (minval) *minval = xminval;
		if (maxval) *maxval = xmaxval;
		if (ngood) *ngood = ngoodpix;
		if (noise2) *noise2 = 0.;
		if (noise3) *noise3 = 0.;
		if (noise5) *noise5 = 0.;
		return(*status);
	}

	/* do we need to compute the min and max value? */
	if (minval || maxval) do_range = 1;
	
        /* allocate arrays used to compute the median and noise estimates */
	differences2 = calloc(nx, sizeof(double));
	if (!differences2) {
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}
	differences3 = calloc(nx, sizeof(double));
	if (!differences3) {
		free(differences2);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}
	differences5 = calloc(nx, sizeof(double));
	if (!differences5) {
		free(differences2);
		free(differences3);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs2 = calloc(ny, sizeof(double));
	if (!diffs2) {
		free(differences2);
		free(differences3);
		free(differences5);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs3 = calloc(ny, sizeof(double));
	if (!diffs3) {
		free(differences2);
		free(differences3);
		free(differences5);
		free(diffs2);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs5 = calloc(ny, sizeof(double));
	if (!diffs5) {
		free(differences2);
		free(differences3);
		free(differences5);
		free(diffs2);
		free(diffs3);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	/* loop over each row of the image */
	for (jj=0; jj < ny; jj++) {

                rowpix = array + (jj * nx); /* point to first pixel in the row */

		/***** find the first valid pixel in row */
		ii = 0;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v1 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v1 < xminval) xminval = v1;
			if (v1 > xmaxval) xmaxval = v1;
		}

		/***** find the 2nd valid pixel in row (which we will skip over) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v2 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;
		
		if (do_range) {
			if (v2 < xminval) xminval = v2;
			if (v2 > xmaxval) xmaxval = v2;
		}

		/***** find the 3rd valid pixel in row */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v3 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v3 < xminval) xminval = v3;
			if (v3 > xmaxval) xmaxval = v3;
		}
				
		/* find the 4nd valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v4 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v4 < xminval) xminval = v4;
			if (v4 > xmaxval) xmaxval = v4;
		}
			
		/* find the 5th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v5 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v5 < xminval) xminval = v5;
			if (v5 > xmaxval) xmaxval = v5;
		}
				
		/* find the 6th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v6 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v6 < xminval) xminval = v6;
			if (v6 > xmaxval) xmaxval = v6;
		}
				
		/* find the 7th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v7 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v7 < xminval) xminval = v7;
			if (v7 > xmaxval) xmaxval = v7;
		}
				
		/* find the 8th valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v8 = rowpix[ii];  /* store the good pixel value */
		ngoodpix++;

		if (do_range) {
			if (v8 < xminval) xminval = v8;
			if (v8 > xmaxval) xmaxval = v8;
		}
		/* now populate the differences arrays */
		/* for the remaining pixels in the row */
		nvals = 0;
		nvals2 = 0;
		for (ii++; ii < nx; ii++) {

		    /* find the next valid pixel in row */
                    if (nullcheck)
		        while (ii < nx && rowpix[ii] == nullvalue) ii++;
		     
		    if (ii == nx) break;  /* hit end of row */
		    v9 = rowpix[ii];  /* store the good pixel value */

		    if (do_range) {
			if (v9 < xminval) xminval = v9;
			if (v9 > xmaxval) xmaxval = v9;
		    }

		    /* construct array of absolute differences */

		    if (!(v5 == v6 && v6 == v7) ) {
		        differences2[nvals2] =  fabs(v5 - v7);
			nvals2++;
		    }

		    if (!(v3 == v4 && v4 == v5 && v5 == v6 && v6 == v7) ) {
		        differences3[nvals] =  fabs((2 * v5) - v3 - v7);
		        differences5[nvals] =  fabs((6 * v5) - (4 * v3) - (4 * v7) + v1 + v9);
		        nvals++;  
		    } else {
		        /* ignore constant background regions */
			ngoodpix++;
		    }

		    /* shift over 1 pixel */
		    v1 = v2;
		    v2 = v3;
		    v3 = v4;
		    v4 = v5;
		    v5 = v6;
		    v6 = v7;
		    v7 = v8;
		    v8 = v9;
	        }  /* end of loop over pixels in the row */

		/* compute the median diffs */
		/* Note that there are 8 more pixel values than there are diffs values. */
		ngoodpix += nvals;

		if (nvals == 0) {
		    continue;  /* cannot compute medians on this row */
		} else if (nvals == 1) {
		    if (nvals2 == 1) {
		        diffs2[nrows2] = differences2[0];
			nrows2++;
		    }
		        
		    diffs3[nrows] = differences3[0];
		    diffs5[nrows] = differences5[0];
		} else {
                    /* quick_select returns the median MUCH faster than using qsort */
		    if (nvals2 > 1) {
                        diffs2[nrows2] = quick_select_double(differences2, nvals);
			nrows2++;
		    }

                    diffs3[nrows] = quick_select_double(differences3, nvals);
                    diffs5[nrows] = quick_select_double(differences5, nvals);
		}

		nrows++;
	}  /* end of loop over rows */

	    /* compute median of the values for each row */
	if (nrows == 0) { 
	       xnoise3 = 0;
	       xnoise5 = 0;
	} else if (nrows == 1) {
	       xnoise3 = diffs3[0];
	       xnoise5 = diffs5[0];
	} else {	    
	       qsort(diffs3, nrows, sizeof(double), FnCompare_double);
	       qsort(diffs5, nrows, sizeof(double), FnCompare_double);
	       xnoise3 =  (diffs3[(nrows - 1)/2] + diffs3[nrows/2]) / 2.;
	       xnoise5 =  (diffs5[(nrows - 1)/2] + diffs5[nrows/2]) / 2.;
	}

	if (nrows2 == 0) { 
	       xnoise2 = 0;
	} else if (nrows2 == 1) {
	       xnoise2 = diffs2[0];
	} else {	    
	       qsort(diffs2, nrows2, sizeof(double), FnCompare_double);
	       xnoise2 =  (diffs2[(nrows2 - 1)/2] + diffs2[nrows2/2]) / 2.;
	}

	if (ngood)  *ngood  = ngoodpix;
	if (minval) *minval = xminval;
	if (maxval) *maxval = xmaxval;
	if (noise2)  *noise2  = 1.0483579 * xnoise2;
	if (noise3)  *noise3  = 0.6052697 * xnoise3;
	if (noise5)  *noise5  = 0.1772048 * xnoise5;

	free(diffs5);
	free(diffs3);
	free(diffs2);
	free(differences5);
	free(differences3);
	free(differences2);

	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnNoise3_short
       (short *array,       /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
        long ny,            /* number of rows in the image */
	int nullcheck,      /* check for null values, if true */
	short nullvalue,    /* value of null pixels, if nullcheck is true */
   /* returned parameters */   
	long *ngood,        /* number of good, non-null pixels? */
	short *minval,    /* minimum non-null value */
	short *maxval,    /* maximum non-null value */
	double *noise,      /* returned R.M.S. value of all non-null pixels */
	int *status)        /* error status */

/*
Estimate the median and background noise in the input image using 3rd order differences.

The noise in the background of the image is calculated using the 3rd order algorithm 
developed for deriving the signal to noise ratio in spectra
(see issue #42 of the ST-ECF newsletter, http://www.stecf.org/documents/newsletter/)

  noise = 1.482602 / sqrt(6) * median (abs(2*flux(i) - flux(i-2) - flux(i+2)))

The returned estimates are the median of the values that are computed for each 
row of the image.
*/
{
	long ii, jj, nrows = 0, nvals, ngoodpix = 0;
	short *differences, *rowpix, v1, v2, v3, v4, v5;
	short xminval = SHRT_MAX, xmaxval = SHRT_MIN, do_range = 0;
	double *diffs, xnoise = 0, sigma;

	if (nx < 5) {
		/* treat entire array as an image with a single row */
		nx = nx * ny;
		ny = 1;
	}

	/* rows must have at least 5 pixels */
	if (nx < 5) {

		for (ii = 0; ii < nx; ii++) {
		    if (nullcheck && array[ii] == nullvalue)
		        continue;
		    else {
			if (array[ii] < xminval) xminval = array[ii];
			if (array[ii] > xmaxval) xmaxval = array[ii];
			ngoodpix++;
		    }
		}
		if (minval) *minval = xminval;
		if (maxval) *maxval = xmaxval;
		if (ngood) *ngood = ngoodpix;
		if (noise) *noise = 0.;
		return(*status);
	}

	/* do we need to compute the min and max value? */
	if (minval || maxval) do_range = 1;
	
        /* allocate arrays used to compute the median and noise estimates */
	differences = calloc(nx, sizeof(short));
	if (!differences) {
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs = calloc(ny, sizeof(double));
	if (!diffs) {
		free(differences);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	/* loop over each row of the image */
	for (jj=0; jj < ny; jj++) {

                rowpix = array + (jj * nx); /* point to first pixel in the row */

		/***** find the first valid pixel in row */
		ii = 0;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v1 = rowpix[ii];  /* store the good pixel value */

		if (do_range) {
			if (v1 < xminval) xminval = v1;
			if (v1 > xmaxval) xmaxval = v1;
		}

		/***** find the 2nd valid pixel in row (which we will skip over) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v2 = rowpix[ii];  /* store the good pixel value */
		
		if (do_range) {
			if (v2 < xminval) xminval = v2;
			if (v2 > xmaxval) xmaxval = v2;
		}

		/***** find the 3rd valid pixel in row */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v3 = rowpix[ii];  /* store the good pixel value */

		if (do_range) {
			if (v3 < xminval) xminval = v3;
			if (v3 > xmaxval) xmaxval = v3;
		}
				
		/* find the 4nd valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v4 = rowpix[ii];  /* store the good pixel value */

		if (do_range) {
			if (v4 < xminval) xminval = v4;
			if (v4 > xmaxval) xmaxval = v4;
		}
		
		/* now populate the differences arrays */
		/* for the remaining pixels in the row */
		nvals = 0;
		for (ii++; ii < nx; ii++) {

		    /* find the next valid pixel in row */
                    if (nullcheck)
		        while (ii < nx && rowpix[ii] == nullvalue) ii++;
		     
		    if (ii == nx) break;  /* hit end of row */
		    v5 = rowpix[ii];  /* store the good pixel value */

		    if (do_range) {
			if (v5 < xminval) xminval = v5;
			if (v5 > xmaxval) xmaxval = v5;
		    }

		    /* construct array of 3rd order absolute differences */
		    if (!(v1 == v2 && v2 == v3 && v3 == v4 && v4 == v5)) {
		        differences[nvals] = abs((2 * v3) - v1 - v5);
		        nvals++;  
		    } else {
		        /* ignore constant background regions */
			ngoodpix++;
		    }


		    /* shift over 1 pixel */
		    v1 = v2;
		    v2 = v3;
		    v3 = v4;
		    v4 = v5;
	        }  /* end of loop over pixels in the row */

		/* compute the 3rd order diffs */
		/* Note that there are 4 more pixel values than there are diffs values. */
		ngoodpix += (nvals + 4);

		if (nvals == 0) {
		    continue;  /* cannot compute medians on this row */
		} else if (nvals == 1) {
		    diffs[nrows] = differences[0];
		} else {
                    /* quick_select returns the median MUCH faster than using qsort */
                    diffs[nrows] = quick_select_short(differences, nvals);
		}

		nrows++;
	}  /* end of loop over rows */

	    /* compute median of the values for each row */
	if (nrows == 0) { 
	       xnoise = 0;
	} else if (nrows == 1) {
	       xnoise = diffs[0];
	} else {	    


	       qsort(diffs, nrows, sizeof(double), FnCompare_double);
	       xnoise =  (diffs[(nrows - 1)/2] + diffs[nrows/2]) / 2.;

              FnMeanSigma_double(diffs, nrows, 0, 0.0, 0, &xnoise, &sigma, status); 

	      /* do a 4.5 sigma rejection of outliers */
	      jj = 0;
	      sigma = 4.5 * sigma;
	      for (ii = 0; ii < nrows; ii++) {
		if ( fabs(diffs[ii] - xnoise) <= sigma)	 {
		   if (jj != ii)
		       diffs[jj] = diffs[ii];
		   jj++;
	        } 
	      }
	      if (ii != jj)
                FnMeanSigma_double(diffs, jj, 0, 0.0, 0, &xnoise, &sigma, status); 
	}

	if (ngood)  *ngood  = ngoodpix;
	if (minval) *minval = xminval;
	if (maxval) *maxval = xmaxval;
	if (noise)  *noise  = 0.6052697 * xnoise;

	free(diffs);
	free(differences);

	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnNoise3_int
       (int *array,       /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
        long ny,            /* number of rows in the image */
	int nullcheck,      /* check for null values, if true */
	int nullvalue,    /* value of null pixels, if nullcheck is true */
   /* returned parameters */   
	long *ngood,        /* number of good, non-null pixels? */
	int *minval,    /* minimum non-null value */
	int *maxval,    /* maximum non-null value */
	double *noise,      /* returned R.M.S. value of all non-null pixels */
	int *status)        /* error status */

/*
Estimate the background noise in the input image using 3rd order differences.

The noise in the background of the image is calculated using the 3rd order algorithm 
developed for deriving the signal to noise ratio in spectra
(see issue #42 of the ST-ECF newsletter, http://www.stecf.org/documents/newsletter/)

  noise = 1.482602 / sqrt(6) * median (abs(2*flux(i) - flux(i-2) - flux(i+2)))

The returned estimates are the median of the values that are computed for each 
row of the image.
*/
{
	long ii, jj, nrows = 0, nvals, ngoodpix = 0;
	int *differences, *rowpix, v1, v2, v3, v4, v5;
	int xminval = INT_MAX, xmaxval = INT_MIN, do_range = 0;
	double *diffs, xnoise = 0, sigma;
	
	if (nx < 5) {
		/* treat entire array as an image with a single row */
		nx = nx * ny;
		ny = 1;
	}

	/* rows must have at least 5 pixels */
	if (nx < 5) {

		for (ii = 0; ii < nx; ii++) {
		    if (nullcheck && array[ii] == nullvalue)
		        continue;
		    else {
			if (array[ii] < xminval) xminval = array[ii];
			if (array[ii] > xmaxval) xmaxval = array[ii];
			ngoodpix++;
		    }
		}
		if (minval) *minval = xminval;
		if (maxval) *maxval = xmaxval;
		if (ngood) *ngood = ngoodpix;
		if (noise) *noise = 0.;
		return(*status);
	}

	/* do we need to compute the min and max value? */
	if (minval || maxval) do_range = 1;
	
        /* allocate arrays used to compute the median and noise estimates */
	differences = calloc(nx, sizeof(int));
	if (!differences) {
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs = calloc(ny, sizeof(double));
	if (!diffs) {
		free(differences);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	/* loop over each row of the image */
	for (jj=0; jj < ny; jj++) {

                rowpix = array + (jj * nx); /* point to first pixel in the row */

		/***** find the first valid pixel in row */
		ii = 0;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v1 = rowpix[ii];  /* store the good pixel value */

		if (do_range) {
			if (v1 < xminval) xminval = v1;
			if (v1 > xmaxval) xmaxval = v1;
		}

		/***** find the 2nd valid pixel in row (which we will skip over) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v2 = rowpix[ii];  /* store the good pixel value */
		
		if (do_range) {
			if (v2 < xminval) xminval = v2;
			if (v2 > xmaxval) xmaxval = v2;
		}

		/***** find the 3rd valid pixel in row */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v3 = rowpix[ii];  /* store the good pixel value */

		if (do_range) {
			if (v3 < xminval) xminval = v3;
			if (v3 > xmaxval) xmaxval = v3;
		}
				
		/* find the 4nd valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v4 = rowpix[ii];  /* store the good pixel value */

		if (do_range) {
			if (v4 < xminval) xminval = v4;
			if (v4 > xmaxval) xmaxval = v4;
		}
		
		/* now populate the differences arrays */
		/* for the remaining pixels in the row */
		nvals = 0;
		for (ii++; ii < nx; ii++) {

		    /* find the next valid pixel in row */
                    if (nullcheck)
		        while (ii < nx && rowpix[ii] == nullvalue) ii++;
		     
		    if (ii == nx) break;  /* hit end of row */
		    v5 = rowpix[ii];  /* store the good pixel value */

		    if (do_range) {
			if (v5 < xminval) xminval = v5;
			if (v5 > xmaxval) xmaxval = v5;
		    }

		    /* construct array of 3rd order absolute differences */
		    if (!(v1 == v2 && v2 == v3 && v3 == v4 && v4 == v5)) {
		        differences[nvals] = abs((2 * v3) - v1 - v5);
		        nvals++;  
		    } else {
		        /* ignore constant background regions */
			ngoodpix++;
		    }

		    /* shift over 1 pixel */
		    v1 = v2;
		    v2 = v3;
		    v3 = v4;
		    v4 = v5;
	        }  /* end of loop over pixels in the row */

		/* compute the 3rd order diffs */
		/* Note that there are 4 more pixel values than there are diffs values. */
		ngoodpix += (nvals + 4);

		if (nvals == 0) {
		    continue;  /* cannot compute medians on this row */
		} else if (nvals == 1) {
		    diffs[nrows] = differences[0];
		} else {
                    /* quick_select returns the median MUCH faster than using qsort */
                    diffs[nrows] = quick_select_int(differences, nvals);
		}

		nrows++;
	}  /* end of loop over rows */

	    /* compute median of the values for each row */
	if (nrows == 0) { 
	       xnoise = 0;
	} else if (nrows == 1) {
	       xnoise = diffs[0];
	} else {	    

	       qsort(diffs, nrows, sizeof(double), FnCompare_double);
	       xnoise =  (diffs[(nrows - 1)/2] + diffs[nrows/2]) / 2.;

              FnMeanSigma_double(diffs, nrows, 0, 0.0, 0, &xnoise, &sigma, status); 

	      /* do a 4.5 sigma rejection of outliers */
	      jj = 0;
	      sigma = 4.5 * sigma;
	      for (ii = 0; ii < nrows; ii++) {
		if ( fabs(diffs[ii] - xnoise) <= sigma)	 {
		   if (jj != ii)
		       diffs[jj] = diffs[ii];
		   jj++;
	        }
	      }
	      if (ii != jj)
                FnMeanSigma_double(diffs, jj, 0, 0.0, 0, &xnoise, &sigma, status); 
	}

	if (ngood)  *ngood  = ngoodpix;
	if (minval) *minval = xminval;
	if (maxval) *maxval = xmaxval;
	if (noise)  *noise  = 0.6052697 * xnoise;

	free(diffs);
	free(differences);

	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnNoise3_float
       (float *array,       /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
        long ny,            /* number of rows in the image */
	int nullcheck,      /* check for null values, if true */
	float nullvalue,    /* value of null pixels, if nullcheck is true */
   /* returned parameters */   
	long *ngood,        /* number of good, non-null pixels? */
	float *minval,    /* minimum non-null value */
	float *maxval,    /* maximum non-null value */
	double *noise,      /* returned R.M.S. value of all non-null pixels */
	int *status)        /* error status */

/*
Estimate the median and background noise in the input image using 3rd order differences.

The noise in the background of the image is calculated using the 3rd order algorithm 
developed for deriving the signal to noise ratio in spectra
(see issue #42 of the ST-ECF newsletter, http://www.stecf.org/documents/newsletter/)

  noise = 1.482602 / sqrt(6) * median (abs(2*flux(i) - flux(i-2) - flux(i+2)))

The returned estimates are the median of the values that are computed for each 
row of the image.
*/
{
	long ii, jj, nrows = 0, nvals, ngoodpix = 0;
	float *differences, *rowpix, v1, v2, v3, v4, v5;
	float xminval = FLT_MAX, xmaxval = -FLT_MAX;
	int do_range = 0;
	double *diffs, xnoise = 0;

	if (nx < 5) {
		/* treat entire array as an image with a single row */
		nx = nx * ny;
		ny = 1;
	}

	/* rows must have at least 5 pixels to calc noise, so just calc min, max, ngood */
	if (nx < 5) {

		for (ii = 0; ii < nx; ii++) {
		    if (nullcheck && array[ii] == nullvalue)
		        continue;
		    else {
			if (array[ii] < xminval) xminval = array[ii];
			if (array[ii] > xmaxval) xmaxval = array[ii];
			ngoodpix++;
		    }
		}
		if (minval) *minval = xminval;
		if (maxval) *maxval = xmaxval;
		if (ngood) *ngood = ngoodpix;
		if (noise) *noise = 0.;
		return(*status);
	}

	/* do we need to compute the min and max value? */
	if (minval || maxval) do_range = 1;
	
        /* allocate arrays used to compute the median and noise estimates */
	if (noise) {
	    differences = calloc(nx, sizeof(float));
	    if (!differences) {
        	*status = MEMORY_ALLOCATION;
		return(*status);
	    }

	    diffs = calloc(ny, sizeof(double));
	    if (!diffs) {
		free(differences);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	    }
	}

	/* loop over each row of the image */
	for (jj=0; jj < ny; jj++) {

                rowpix = array + (jj * nx); /* point to first pixel in the row */

		/***** find the first valid pixel in row */
		ii = 0;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v1 = rowpix[ii];  /* store the good pixel value */

		if (do_range) {
			if (v1 < xminval) xminval = v1;
			if (v1 > xmaxval) xmaxval = v1;
		}

		/***** find the 2nd valid pixel in row (which we will skip over) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v2 = rowpix[ii];  /* store the good pixel value */
		
		if (do_range) {
			if (v2 < xminval) xminval = v2;
			if (v2 > xmaxval) xmaxval = v2;
		}

		/***** find the 3rd valid pixel in row */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v3 = rowpix[ii];  /* store the good pixel value */

		if (do_range) {
			if (v3 < xminval) xminval = v3;
			if (v3 > xmaxval) xmaxval = v3;
		}
				
		/* find the 4nd valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v4 = rowpix[ii];  /* store the good pixel value */

		if (do_range) {
			if (v4 < xminval) xminval = v4;
			if (v4 > xmaxval) xmaxval = v4;
		}
		
		/* now populate the differences arrays */
		/* for the remaining pixels in the row */
		nvals = 0;
		for (ii++; ii < nx; ii++) {

		    /* find the next valid pixel in row */
                    if (nullcheck)
		        while (ii < nx && rowpix[ii] == nullvalue) {
			  ii++;
		        }
			
		    if (ii == nx) break;  /* hit end of row */
		    v5 = rowpix[ii];  /* store the good pixel value */

		    if (do_range) {
			if (v5 < xminval) xminval = v5;
			if (v5 > xmaxval) xmaxval = v5;
		    }

		    /* construct array of 3rd order absolute differences */
		    if (noise) {
		        if (!(v1 == v2 && v2 == v3 && v3 == v4 && v4 == v5)) {

		            differences[nvals] = (float) fabs((2. * v3) - v1 - v5);
		            nvals++;  
		       } else {
		            /* ignore constant background regions */
			    ngoodpix++;
		       }
		    } else {
		       /* just increment the number of non-null pixels */
		       ngoodpix++;
		    }

		    /* shift over 1 pixel */
		    v1 = v2;
		    v2 = v3;
		    v3 = v4;
		    v4 = v5;
	        }  /* end of loop over pixels in the row */

		/* compute the 3rd order diffs */
		/* Note that there are 4 more pixel values than there are diffs values. */
		ngoodpix += (nvals + 4);

		if (noise) {
		    if (nvals == 0) {
		        continue;  /* cannot compute medians on this row */
		    } else if (nvals == 1) {
		        diffs[nrows] = differences[0];
		    } else {
                        /* quick_select returns the median MUCH faster than using qsort */
                        diffs[nrows] = quick_select_float(differences, nvals);
		    }
		}
		nrows++;
	}  /* end of loop over rows */

	    /* compute median of the values for each row */
	if (noise) {
	    if (nrows == 0) { 
	       xnoise = 0;
	    } else if (nrows == 1) {
	       xnoise = diffs[0];
	    } else {	    
	       qsort(diffs, nrows, sizeof(double), FnCompare_double);
	       xnoise =  (diffs[(nrows - 1)/2] + diffs[nrows/2]) / 2.;
	    }
	}

	if (ngood)  *ngood  = ngoodpix;
	if (minval) *minval = xminval;
	if (maxval) *maxval = xmaxval;
	if (noise) {
		*noise  = 0.6052697 * xnoise;
		free(diffs);
		free(differences);
	}

	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnNoise3_double
       (double *array,       /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
        long ny,            /* number of rows in the image */
	int nullcheck,      /* check for null values, if true */
	double nullvalue,    /* value of null pixels, if nullcheck is true */
   /* returned parameters */   
	long *ngood,        /* number of good, non-null pixels? */
	double *minval,    /* minimum non-null value */
	double *maxval,    /* maximum non-null value */
	double *noise,      /* returned R.M.S. value of all non-null pixels */
	int *status)        /* error status */

/*
Estimate the median and background noise in the input image using 3rd order differences.

The noise in the background of the image is calculated using the 3rd order algorithm 
developed for deriving the signal to noise ratio in spectra
(see issue #42 of the ST-ECF newsletter, http://www.stecf.org/documents/newsletter/)

  noise = 1.482602 / sqrt(6) * median (abs(2*flux(i) - flux(i-2) - flux(i+2)))

The returned estimates are the median of the values that are computed for each 
row of the image.
*/
{
	long ii, jj, nrows = 0, nvals, ngoodpix = 0;
	double *differences, *rowpix, v1, v2, v3, v4, v5;
	double xminval = DBL_MAX, xmaxval = -DBL_MAX;
	int do_range = 0;
	double *diffs, xnoise = 0;
	
	if (nx < 5) {
		/* treat entire array as an image with a single row */
		nx = nx * ny;
		ny = 1;
	}

	/* rows must have at least 5 pixels */
	if (nx < 5) {

		for (ii = 0; ii < nx; ii++) {
		    if (nullcheck && array[ii] == nullvalue)
		        continue;
		    else {
			if (array[ii] < xminval) xminval = array[ii];
			if (array[ii] > xmaxval) xmaxval = array[ii];
			ngoodpix++;
		    }
		}
		if (minval) *minval = xminval;
		if (maxval) *maxval = xmaxval;
		if (ngood) *ngood = ngoodpix;
		if (noise) *noise = 0.;
		return(*status);
	}

	/* do we need to compute the min and max value? */
	if (minval || maxval) do_range = 1;
	
        /* allocate arrays used to compute the median and noise estimates */
	if (noise) {
	    differences = calloc(nx, sizeof(double));
	    if (!differences) {
        	*status = MEMORY_ALLOCATION;
		return(*status);
	    }

	    diffs = calloc(ny, sizeof(double));
	    if (!diffs) {
		free(differences);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	    }
	}

	/* loop over each row of the image */
	for (jj=0; jj < ny; jj++) {

                rowpix = array + (jj * nx); /* point to first pixel in the row */

		/***** find the first valid pixel in row */
		ii = 0;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v1 = rowpix[ii];  /* store the good pixel value */

		if (do_range) {
			if (v1 < xminval) xminval = v1;
			if (v1 > xmaxval) xmaxval = v1;
		}

		/***** find the 2nd valid pixel in row (which we will skip over) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v2 = rowpix[ii];  /* store the good pixel value */
		
		if (do_range) {
			if (v2 < xminval) xminval = v2;
			if (v2 > xmaxval) xmaxval = v2;
		}

		/***** find the 3rd valid pixel in row */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v3 = rowpix[ii];  /* store the good pixel value */

		if (do_range) {
			if (v3 < xminval) xminval = v3;
			if (v3 > xmaxval) xmaxval = v3;
		}
				
		/* find the 4nd valid pixel in row (to be skipped) */
		ii++;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v4 = rowpix[ii];  /* store the good pixel value */

		if (do_range) {
			if (v4 < xminval) xminval = v4;
			if (v4 > xmaxval) xmaxval = v4;
		}
		
		/* now populate the differences arrays */
		/* for the remaining pixels in the row */
		nvals = 0;
		for (ii++; ii < nx; ii++) {

		    /* find the next valid pixel in row */
                    if (nullcheck)
		        while (ii < nx && rowpix[ii] == nullvalue) ii++;
		     
		    if (ii == nx) break;  /* hit end of row */
		    v5 = rowpix[ii];  /* store the good pixel value */

		    if (do_range) {
			if (v5 < xminval) xminval = v5;
			if (v5 > xmaxval) xmaxval = v5;
		    }

		    /* construct array of 3rd order absolute differences */
		    if (noise) {
		        if (!(v1 == v2 && v2 == v3 && v3 == v4 && v4 == v5)) {

		            differences[nvals] = fabs((2. * v3) - v1 - v5);
		            nvals++;  
		        } else {
		            /* ignore constant background regions */
			    ngoodpix++;
		        }
		    } else {
		       /* just increment the number of non-null pixels */
		       ngoodpix++;
		    }

		    /* shift over 1 pixel */
		    v1 = v2;
		    v2 = v3;
		    v3 = v4;
		    v4 = v5;
	        }  /* end of loop over pixels in the row */

		/* compute the 3rd order diffs */
		/* Note that there are 4 more pixel values than there are diffs values. */
		ngoodpix += (nvals + 4);

		if (noise) {
		    if (nvals == 0) {
		        continue;  /* cannot compute medians on this row */
		    } else if (nvals == 1) {
		        diffs[nrows] = differences[0];
		    } else {
                        /* quick_select returns the median MUCH faster than using qsort */
                        diffs[nrows] = quick_select_double(differences, nvals);
		    }
		}
		nrows++;
	}  /* end of loop over rows */

	    /* compute median of the values for each row */
	if (noise) {
	    if (nrows == 0) { 
	       xnoise = 0;
	    } else if (nrows == 1) {
	       xnoise = diffs[0];
	    } else {	    
	       qsort(diffs, nrows, sizeof(double), FnCompare_double);
	       xnoise =  (diffs[(nrows - 1)/2] + diffs[nrows/2]) / 2.;
	    }
	}

	if (ngood)  *ngood  = ngoodpix;
	if (minval) *minval = xminval;
	if (maxval) *maxval = xmaxval;
	if (noise) {
		*noise  = 0.6052697 * xnoise;
		free(diffs);
		free(differences);
	}

	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnNoise1_short
       (short *array,       /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
        long ny,            /* number of rows in the image */
	int nullcheck,      /* check for null values, if true */
	short nullvalue,    /* value of null pixels, if nullcheck is true */
   /* returned parameters */   
	double *noise,      /* returned R.M.S. value of all non-null pixels */
	int *status)        /* error status */
/*
Estimate the background noise in the input image using sigma of 1st order differences.

  noise = 1.0 / sqrt(2) * rms of (flux[i] - flux[i-1])

The returned estimate is the median of the values that are computed for each 
row of the image.
*/
{
	int iter;
	long ii, jj, kk, nrows = 0, nvals;
	short *differences, *rowpix, v1;
	double  *diffs, xnoise, mean, stdev;

	/* rows must have at least 3 pixels to estimate noise */
	if (nx < 3) {
		*noise = 0;
		return(*status);
	}
	
        /* allocate arrays used to compute the median and noise estimates */
	differences = calloc(nx, sizeof(short));
	if (!differences) {
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs = calloc(ny, sizeof(double));
	if (!diffs) {
		free(differences);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	/* loop over each row of the image */
	for (jj=0; jj < ny; jj++) {

                rowpix = array + (jj * nx); /* point to first pixel in the row */

		/***** find the first valid pixel in row */
		ii = 0;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v1 = rowpix[ii];  /* store the good pixel value */

		/* now continue populating the differences arrays */
		/* for the remaining pixels in the row */
		nvals = 0;
		for (ii++; ii < nx; ii++) {

		    /* find the next valid pixel in row */
                    if (nullcheck)
		        while (ii < nx && rowpix[ii] == nullvalue) ii++;
		     
		    if (ii == nx) break;  /* hit end of row */
		
		    /* construct array of 1st order differences */
		    differences[nvals] = v1 - rowpix[ii];

		    nvals++;  
		    /* shift over 1 pixel */
		    v1 = rowpix[ii];
	        }  /* end of loop over pixels in the row */

		if (nvals < 2)
		   continue;
		else {

		    FnMeanSigma_short(differences, nvals, 0, 0, 0, &mean, &stdev, status);

		    if (stdev > 0.) {
		        for (iter = 0;  iter < NITER;  iter++) {
		            kk = 0;
		            for (ii = 0;  ii < nvals;  ii++) {
		                if (fabs (differences[ii] - mean) < SIGMA_CLIP * stdev) {
			            if (kk < ii)
			                differences[kk] = differences[ii];
			            kk++;
		                }
		            }
		            if (kk == nvals) break;

		            nvals = kk;
		            FnMeanSigma_short(differences, nvals, 0, 0, 0, &mean, &stdev, status);
	              }
		   }

		   diffs[nrows] = stdev;
		   nrows++;
		}
	}  /* end of loop over rows */

	/* compute median of the values for each row */
	if (nrows == 0) { 
	       xnoise = 0;
	} else if (nrows == 1) {
	       xnoise = diffs[0];
	} else {
	       qsort(diffs, nrows, sizeof(double), FnCompare_double);
	       xnoise =  (diffs[(nrows - 1)/2] + diffs[nrows/2]) / 2.;
	}

	*noise = .70710678 * xnoise;

	free(diffs);
	free(differences);

	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnNoise1_int
       (int *array,       /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
        long ny,            /* number of rows in the image */
	int nullcheck,      /* check for null values, if true */
	int nullvalue,    /* value of null pixels, if nullcheck is true */
   /* returned parameters */   
	double *noise,      /* returned R.M.S. value of all non-null pixels */
	int *status)        /* error status */
/*
Estimate the background noise in the input image using sigma of 1st order differences.

  noise = 1.0 / sqrt(2) * rms of (flux[i] - flux[i-1])

The returned estimate is the median of the values that are computed for each 
row of the image.
*/
{
	int iter;
	long ii, jj, kk, nrows = 0, nvals;
	int *differences, *rowpix, v1;
	double  *diffs, xnoise, mean, stdev;

	/* rows must have at least 3 pixels to estimate noise */
	if (nx < 3) {
		*noise = 0;
		return(*status);
	}
	
        /* allocate arrays used to compute the median and noise estimates */
	differences = calloc(nx, sizeof(int));
	if (!differences) {
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs = calloc(ny, sizeof(double));
	if (!diffs) {
		free(differences);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	/* loop over each row of the image */
	for (jj=0; jj < ny; jj++) {

                rowpix = array + (jj * nx); /* point to first pixel in the row */

		/***** find the first valid pixel in row */
		ii = 0;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v1 = rowpix[ii];  /* store the good pixel value */

		/* now continue populating the differences arrays */
		/* for the remaining pixels in the row */
		nvals = 0;
		for (ii++; ii < nx; ii++) {

		    /* find the next valid pixel in row */
                    if (nullcheck)
		        while (ii < nx && rowpix[ii] == nullvalue) ii++;
		     
		    if (ii == nx) break;  /* hit end of row */
		
		    /* construct array of 1st order differences */
		    differences[nvals] = v1 - rowpix[ii];

		    nvals++;  
		    /* shift over 1 pixel */
		    v1 = rowpix[ii];
	        }  /* end of loop over pixels in the row */

		if (nvals < 2)
		   continue;
		else {

		    FnMeanSigma_int(differences, nvals, 0, 0, 0, &mean, &stdev, status);

		    if (stdev > 0.) {
		        for (iter = 0;  iter < NITER;  iter++) {
		            kk = 0;
		            for (ii = 0;  ii < nvals;  ii++) {
		                if (fabs (differences[ii] - mean) < SIGMA_CLIP * stdev) {
			            if (kk < ii)
			                differences[kk] = differences[ii];
			            kk++;
		                }
		            }
		            if (kk == nvals) break;

		            nvals = kk;
		            FnMeanSigma_int(differences, nvals, 0, 0, 0, &mean, &stdev, status);
	              }
		   }

		   diffs[nrows] = stdev;
		   nrows++;
		}
	}  /* end of loop over rows */

	/* compute median of the values for each row */
	if (nrows == 0) { 
	       xnoise = 0;
	} else if (nrows == 1) {
	       xnoise = diffs[0];
	} else {
	       qsort(diffs, nrows, sizeof(double), FnCompare_double);
	       xnoise =  (diffs[(nrows - 1)/2] + diffs[nrows/2]) / 2.;
	}

	*noise = .70710678 * xnoise;

	free(diffs);
	free(differences);

	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnNoise1_float
       (float *array,       /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
        long ny,            /* number of rows in the image */
	int nullcheck,      /* check for null values, if true */
	float nullvalue,    /* value of null pixels, if nullcheck is true */
   /* returned parameters */   
	double *noise,      /* returned R.M.S. value of all non-null pixels */
	int *status)        /* error status */
/*
Estimate the background noise in the input image using sigma of 1st order differences.

  noise = 1.0 / sqrt(2) * rms of (flux[i] - flux[i-1])

The returned estimate is the median of the values that are computed for each 
row of the image.
*/
{
	int iter;
	long ii, jj, kk, nrows = 0, nvals;
	float *differences, *rowpix, v1;
	double  *diffs, xnoise, mean, stdev;

	/* rows must have at least 3 pixels to estimate noise */
	if (nx < 3) {
		*noise = 0;
		return(*status);
	}
	
        /* allocate arrays used to compute the median and noise estimates */
	differences = calloc(nx, sizeof(float));
	if (!differences) {
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs = calloc(ny, sizeof(double));
	if (!diffs) {
		free(differences);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	/* loop over each row of the image */
	for (jj=0; jj < ny; jj++) {

                rowpix = array + (jj * nx); /* point to first pixel in the row */

		/***** find the first valid pixel in row */
		ii = 0;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v1 = rowpix[ii];  /* store the good pixel value */

		/* now continue populating the differences arrays */
		/* for the remaining pixels in the row */
		nvals = 0;
		for (ii++; ii < nx; ii++) {

		    /* find the next valid pixel in row */
                    if (nullcheck)
		        while (ii < nx && rowpix[ii] == nullvalue) ii++;
		     
		    if (ii == nx) break;  /* hit end of row */
		
		    /* construct array of 1st order differences */
		    differences[nvals] = v1 - rowpix[ii];

		    nvals++;  
		    /* shift over 1 pixel */
		    v1 = rowpix[ii];
	        }  /* end of loop over pixels in the row */

		if (nvals < 2)
		   continue;
		else {

		    FnMeanSigma_float(differences, nvals, 0, 0, 0, &mean, &stdev, status);

		    if (stdev > 0.) {
		        for (iter = 0;  iter < NITER;  iter++) {
		            kk = 0;
		            for (ii = 0;  ii < nvals;  ii++) {
		                if (fabs (differences[ii] - mean) < SIGMA_CLIP * stdev) {
			            if (kk < ii)
			                differences[kk] = differences[ii];
			            kk++;
		                }
		            }
		            if (kk == nvals) break;

		            nvals = kk;
		            FnMeanSigma_float(differences, nvals, 0, 0, 0, &mean, &stdev, status);
	              }
		   }

		   diffs[nrows] = stdev;
		   nrows++;
		}
	}  /* end of loop over rows */

	/* compute median of the values for each row */
	if (nrows == 0) { 
	       xnoise = 0;
	} else if (nrows == 1) {
	       xnoise = diffs[0];
	} else {
	       qsort(diffs, nrows, sizeof(double), FnCompare_double);
	       xnoise =  (diffs[(nrows - 1)/2] + diffs[nrows/2]) / 2.;
	}

	*noise = .70710678 * xnoise;

	free(diffs);
	free(differences);

	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnNoise1_double
       (double *array,       /*  2 dimensional array of image pixels */
        long nx,            /* number of pixels in each row of the image */
        long ny,            /* number of rows in the image */
	int nullcheck,      /* check for null values, if true */
	double nullvalue,    /* value of null pixels, if nullcheck is true */
   /* returned parameters */   
	double *noise,      /* returned R.M.S. value of all non-null pixels */
	int *status)        /* error status */
/*
Estimate the background noise in the input image using sigma of 1st order differences.

  noise = 1.0 / sqrt(2) * rms of (flux[i] - flux[i-1])

The returned estimate is the median of the values that are computed for each 
row of the image.
*/
{
	int iter;
	long ii, jj, kk, nrows = 0, nvals;
	double *differences, *rowpix, v1;
	double  *diffs, xnoise, mean, stdev;

	/* rows must have at least 3 pixels to estimate noise */
	if (nx < 3) {
		*noise = 0;
		return(*status);
	}
	
        /* allocate arrays used to compute the median and noise estimates */
	differences = calloc(nx, sizeof(double));
	if (!differences) {
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	diffs = calloc(ny, sizeof(double));
	if (!diffs) {
		free(differences);
        	*status = MEMORY_ALLOCATION;
		return(*status);
	}

	/* loop over each row of the image */
	for (jj=0; jj < ny; jj++) {

                rowpix = array + (jj * nx); /* point to first pixel in the row */

		/***** find the first valid pixel in row */
		ii = 0;
		if (nullcheck)
		    while (ii < nx && rowpix[ii] == nullvalue) ii++;

		if (ii == nx) continue;  /* hit end of row */
		v1 = rowpix[ii];  /* store the good pixel value */

		/* now continue populating the differences arrays */
		/* for the remaining pixels in the row */
		nvals = 0;
		for (ii++; ii < nx; ii++) {

		    /* find the next valid pixel in row */
                    if (nullcheck)
		        while (ii < nx && rowpix[ii] == nullvalue) ii++;
		     
		    if (ii == nx) break;  /* hit end of row */
		
		    /* construct array of 1st order differences */
		    differences[nvals] = v1 - rowpix[ii];

		    nvals++;  
		    /* shift over 1 pixel */
		    v1 = rowpix[ii];
	        }  /* end of loop over pixels in the row */

		if (nvals < 2)
		   continue;
		else {

		    FnMeanSigma_double(differences, nvals, 0, 0, 0, &mean, &stdev, status);

		    if (stdev > 0.) {
		        for (iter = 0;  iter < NITER;  iter++) {
		            kk = 0;
		            for (ii = 0;  ii < nvals;  ii++) {
		                if (fabs (differences[ii] - mean) < SIGMA_CLIP * stdev) {
			            if (kk < ii)
			                differences[kk] = differences[ii];
			            kk++;
		                }
		            }
		            if (kk == nvals) break;

		            nvals = kk;
		            FnMeanSigma_double(differences, nvals, 0, 0, 0, &mean, &stdev, status);
	              }
		   }

		   diffs[nrows] = stdev;
		   nrows++;
		}
	}  /* end of loop over rows */

	/* compute median of the values for each row */
	if (nrows == 0) { 
	       xnoise = 0;
	} else if (nrows == 1) {
	       xnoise = diffs[0];
	} else {
	       qsort(diffs, nrows, sizeof(double), FnCompare_double);
	       xnoise =  (diffs[(nrows - 1)/2] + diffs[nrows/2]) / 2.;
	}

	*noise = .70710678 * xnoise;

	free(diffs);
	free(differences);

	return(*status);
}
/*--------------------------------------------------------------------------*/
static int FnCompare_short(const void *v1, const void *v2)
{
   const short *i1 = v1;
   const short *i2 = v2;
   
   if (*i1 < *i2)
     return(-1);
   else if (*i1 > *i2)
     return(1);
   else
     return(0);
}
/*--------------------------------------------------------------------------*/
static int FnCompare_int(const void *v1, const void *v2)
{
   const int *i1 = v1;
   const int *i2 = v2;
   
   if (*i1 < *i2)
     return(-1);
   else if (*i1 > *i2)
     return(1);
   else
     return(0);
}
/*--------------------------------------------------------------------------*/
static int FnCompare_float(const void *v1, const void *v2)
{
   const float *i1 = v1;
   const float *i2 = v2;
   
   if (*i1 < *i2)
     return(-1);
   else if (*i1 > *i2)
     return(1);
   else
     return(0);
}
/*--------------------------------------------------------------------------*/
static int FnCompare_double(const void *v1, const void *v2)
{
   const double *i1 = v1;
   const double *i2 = v2;
   
   if (*i1 < *i2)
     return(-1);
   else if (*i1 > *i2)
     return(1);
   else
     return(0);
}
/*--------------------------------------------------------------------------*/

/*
 *  These Quickselect routines are based on the algorithm described in
 *  "Numerical recipes in C", Second Edition,
 *  Cambridge University Press, 1992, Section 8.5, ISBN 0-521-43108-5
 *  This code by Nicolas Devillard - 1998. Public domain.
 */

/*--------------------------------------------------------------------------*/

#define ELEM_SWAP(a,b) { register float t=(a);(a)=(b);(b)=t; }

static float quick_select_float(float arr[], int n) 
{
    int low, high ;
    int median;
    int middle, ll, hh;

    low = 0 ; high = n-1 ; median = (low + high) / 2;
    for (;;) {
        if (high <= low) /* One element only */
            return arr[median] ;

        if (high == low + 1) {  /* Two elements only */
            if (arr[low] > arr[high])
                ELEM_SWAP(arr[low], arr[high]) ;
            return arr[median] ;
        }

    /* Find median of low, middle and high items; swap into position low */
    middle = (low + high) / 2;
    if (arr[middle] > arr[high])    ELEM_SWAP(arr[middle], arr[high]) ;
    if (arr[low] > arr[high])       ELEM_SWAP(arr[low], arr[high]) ;
    if (arr[middle] > arr[low])     ELEM_SWAP(arr[middle], arr[low]) ;

    /* Swap low item (now in position middle) into position (low+1) */
    ELEM_SWAP(arr[middle], arr[low+1]) ;

    /* Nibble from each end towards middle, swapping items when stuck */
    ll = low + 1;
    hh = high;
    for (;;) {
        do ll++; while (arr[low] > arr[ll]) ;
        do hh--; while (arr[hh]  > arr[low]) ;

        if (hh < ll)
        break;

        ELEM_SWAP(arr[ll], arr[hh]) ;
    }

    /* Swap middle item (in position low) back into correct position */
    ELEM_SWAP(arr[low], arr[hh]) ;

    /* Re-set active partition */
    if (hh <= median)
        low = ll;
        if (hh >= median)
        high = hh - 1;
    }
}

#undef ELEM_SWAP

/*--------------------------------------------------------------------------*/

#define ELEM_SWAP(a,b) { register short t=(a);(a)=(b);(b)=t; }

static short quick_select_short(short arr[], int n) 
{
    int low, high ;
    int median;
    int middle, ll, hh;

    low = 0 ; high = n-1 ; median = (low + high) / 2;
    for (;;) {
        if (high <= low) /* One element only */
            return arr[median] ;

        if (high == low + 1) {  /* Two elements only */
            if (arr[low] > arr[high])
                ELEM_SWAP(arr[low], arr[high]) ;
            return arr[median] ;
        }

    /* Find median of low, middle and high items; swap into position low */
    middle = (low + high) / 2;
    if (arr[middle] > arr[high])    ELEM_SWAP(arr[middle], arr[high]) ;
    if (arr[low] > arr[high])       ELEM_SWAP(arr[low], arr[high]) ;
    if (arr[middle] > arr[low])     ELEM_SWAP(arr[middle], arr[low]) ;

    /* Swap low item (now in position middle) into position (low+1) */
    ELEM_SWAP(arr[middle], arr[low+1]) ;

    /* Nibble from each end towards middle, swapping items when stuck */
    ll = low + 1;
    hh = high;
    for (;;) {
        do ll++; while (arr[low] > arr[ll]) ;
        do hh--; while (arr[hh]  > arr[low]) ;

        if (hh < ll)
        break;

        ELEM_SWAP(arr[ll], arr[hh]) ;
    }

    /* Swap middle item (in position low) back into correct position */
    ELEM_SWAP(arr[low], arr[hh]) ;

    /* Re-set active partition */
    if (hh <= median)
        low = ll;
        if (hh >= median)
        high = hh - 1;
    }
}

#undef ELEM_SWAP

/*--------------------------------------------------------------------------*/

#define ELEM_SWAP(a,b) { register int t=(a);(a)=(b);(b)=t; }

static int quick_select_int(int arr[], int n) 
{
    int low, high ;
    int median;
    int middle, ll, hh;

    low = 0 ; high = n-1 ; median = (low + high) / 2;
    for (;;) {
        if (high <= low) /* One element only */
            return arr[median] ;

        if (high == low + 1) {  /* Two elements only */
            if (arr[low] > arr[high])
                ELEM_SWAP(arr[low], arr[high]) ;
            return arr[median] ;
        }

    /* Find median of low, middle and high items; swap into position low */
    middle = (low + high) / 2;
    if (arr[middle] > arr[high])    ELEM_SWAP(arr[middle], arr[high]) ;
    if (arr[low] > arr[high])       ELEM_SWAP(arr[low], arr[high]) ;
    if (arr[middle] > arr[low])     ELEM_SWAP(arr[middle], arr[low]) ;

    /* Swap low item (now in position middle) into position (low+1) */
    ELEM_SWAP(arr[middle], arr[low+1]) ;

    /* Nibble from each end towards middle, swapping items when stuck */
    ll = low + 1;
    hh = high;
    for (;;) {
        do ll++; while (arr[low] > arr[ll]) ;
        do hh--; while (arr[hh]  > arr[low]) ;

        if (hh < ll)
        break;

        ELEM_SWAP(arr[ll], arr[hh]) ;
    }

    /* Swap middle item (in position low) back into correct position */
    ELEM_SWAP(arr[low], arr[hh]) ;

    /* Re-set active partition */
    if (hh <= median)
        low = ll;
        if (hh >= median)
        high = hh - 1;
    }
}

#undef ELEM_SWAP

/*--------------------------------------------------------------------------*/

#define ELEM_SWAP(a,b) { register LONGLONG  t=(a);(a)=(b);(b)=t; }

static LONGLONG quick_select_longlong(LONGLONG arr[], int n) 
{
    int low, high ;
    int median;
    int middle, ll, hh;

    low = 0 ; high = n-1 ; median = (low + high) / 2;
    for (;;) {
        if (high <= low) /* One element only */
            return arr[median] ;

        if (high == low + 1) {  /* Two elements only */
            if (arr[low] > arr[high])
                ELEM_SWAP(arr[low], arr[high]) ;
            return arr[median] ;
        }

    /* Find median of low, middle and high items; swap into position low */
    middle = (low + high) / 2;
    if (arr[middle] > arr[high])    ELEM_SWAP(arr[middle], arr[high]) ;
    if (arr[low] > arr[high])       ELEM_SWAP(arr[low], arr[high]) ;
    if (arr[middle] > arr[low])     ELEM_SWAP(arr[middle], arr[low]) ;

    /* Swap low item (now in position middle) into position (low+1) */
    ELEM_SWAP(arr[middle], arr[low+1]) ;

    /* Nibble from each end towards middle, swapping items when stuck */
    ll = low + 1;
    hh = high;
    for (;;) {
        do ll++; while (arr[low] > arr[ll]) ;
        do hh--; while (arr[hh]  > arr[low]) ;

        if (hh < ll)
        break;

        ELEM_SWAP(arr[ll], arr[hh]) ;
    }

    /* Swap middle item (in position low) back into correct position */
    ELEM_SWAP(arr[low], arr[hh]) ;

    /* Re-set active partition */
    if (hh <= median)
        low = ll;
        if (hh >= median)
        high = hh - 1;
    }
}

#undef ELEM_SWAP

/*--------------------------------------------------------------------------*/

#define ELEM_SWAP(a,b) { register double t=(a);(a)=(b);(b)=t; }

static double quick_select_double(double arr[], int n) 
{
    int low, high ;
    int median;
    int middle, ll, hh;

    low = 0 ; high = n-1 ; median = (low + high) / 2;
    for (;;) {
        if (high <= low) /* One element only */
            return arr[median] ;

        if (high == low + 1) {  /* Two elements only */
            if (arr[low] > arr[high])
                ELEM_SWAP(arr[low], arr[high]) ;
            return arr[median] ;
        }

    /* Find median of low, middle and high items; swap into position low */
    middle = (low + high) / 2;
    if (arr[middle] > arr[high])    ELEM_SWAP(arr[middle], arr[high]) ;
    if (arr[low] > arr[high])       ELEM_SWAP(arr[low], arr[high]) ;
    if (arr[middle] > arr[low])     ELEM_SWAP(arr[middle], arr[low]) ;

    /* Swap low item (now in position middle) into position (low+1) */
    ELEM_SWAP(arr[middle], arr[low+1]) ;

    /* Nibble from each end towards middle, swapping items when stuck */
    ll = low + 1;
    hh = high;
    for (;;) {
        do ll++; while (arr[low] > arr[ll]) ;
        do hh--; while (arr[hh]  > arr[low]) ;

        if (hh < ll)
        break;

        ELEM_SWAP(arr[ll], arr[hh]) ;
    }

    /* Swap middle item (in position low) back into correct position */
    ELEM_SWAP(arr[low], arr[hh]) ;

    /* Re-set active partition */
    if (hh <= median)
        low = ll;
        if (hh >= median)
        high = hh - 1;
    }
}

#undef ELEM_SWAP


cfitsio-3.47/README0000644000225700000360000001066013464573432013273 0ustar  cagordonlhea                   CFITSIO Interface Library

CFITSIO is a library of ANSI C routines for reading and writing FITS
format data files.  A set of Fortran-callable wrapper routines are also
included for the convenience of Fortran programmers.  This README file
gives a brief summary of how to build and test CFITSIO, but the CFITSIO
User's Guide, found in the files cfitsio.doc (plain text), cfitsio.tex
(LaTeX source file), cfitsio.ps, or cfitsio.pdf should be
referenced for the latest and most complete information.

BUILDING CFITSIO
----------------

The CFITSIO code is contained in about 40 *.c source files and several *.h
header files.  CFITSIO should compile and run on most Unix platforms without
modification, except that Cray supercomputers computers are currently not
supported.  The CFITSIO library is built on Unix systems by typing:

 >  ./configure [--prefix=/target/installation/path]
 >  make          (or  'make shared')
 >  make install  (this step is optional)

at the operating system prompt.  The configure command customizes the
Makefile for the particular system, then the `make' command compiles the
source files and builds the library.  Type `./configure' and not simply
`configure' to ensure that the configure script in the current directory
is run and not some other system-wide configure script.  The optional
'prefix' argument to configure gives the path to the directory where
the CFITSIO library and include files should be installed via the later
'make install' command. For example,

   > ./configure --prefix=/usr1/local

will cause the 'make install' command to copy the CFITSIO libcfitsio file 
to /usr1/local/lib and the necessary include files to /usr1/local/include
(assuming of course that the  process has permission to write to these 
directories).

All the available configure options can be seen by entering the command

   > ./configure --help

On VAX/VMS and ALPHA/VMS systems the make.com command file may be used
to build the cfitsio.olb object library using the default G-floating
point option for double variables.  The make\_dfloat.com and make\_ieee.com
files may be used instead to build the library with the other floating
point options.

A precompiled DLL version of CFITSIO is available for IBM-PC users of
the Borland or Microsoft Visual C++ compilers in the files
cfitsiodll_xxxx_borland.zip and cfitsiodll_xxxx_vcc.zip, where 'xxxx'
represents the current release number.  These zip archives also
contains other files and instructions on how to use the CFITSIO DLL
library. The CFITSIO library may also be built from the source code
using the makefile.bc or makefile.vcc  files.  Finally, the makepc.bat
file gives an example of  building CFITSIO with the Borland C++ v4.5
compiler using simpler DOS commands.

Instructions for building CFITSIO on Mac OS can be found in
the README.MacOS file.

TESTING CFITSIO
---------------

The CFITSIO library should be tested by building and running
the testprog.c program that is included with the release. 
On Unix systems, type:
-
    % make testprog
    % testprog > testprog.lis
    % diff testprog.lis testprog.out
    % cmp testprog.fit testprog.std
-
 On VMS systems,
(assuming cc is the name of the C compiler command), type:
-
    $ cc testprog.c
    $ link testprog, cfitsio/lib
    $ run testprog
-
The testprog program should produce a FITS file called `testprog.fit'
that is identical to the testprog.std FITS file included in this
release.  The diagnostic messages (which were piped to the file
testprog.lis in the Unix example) should be identical to the listing
contained in the file testprog.out.  The 'diff' and 'cmp' commands
shown above should not report any differences in the files.

USING CFITSIO
-------------

The CFITSIO User's Guide, contained in the files cfitsio.doc (plain
text file) and cfitsio.ps (postscript file), provides detailed
documentation about how to build and use the CFITSIO library.
It contains a description of every user-callable routine in the
CFITSIO interface.

The cookbook.c file provides some sample routines for performing common
operations on various types of FITS files.  Programmers are urged to
examine these routines for recommended programming practices when using
CFITSIO.  Users are free to copy or modify these routines for their own
purposes.

Any problem reports or suggestions for
improvements are welcome and should be sent to the HEASARC
help desk.

-------------------------------------------------------------------------
William D. Pence
HEASARC, NASA/GSFC
cfitsio-3.47/README.MacOS0000644000225700000360000000467513464573432014245 0ustar  cagordonlheaBy default, the CFITSIO library will be a "Universal Binary" (i.e.
32- and 64-bit compatible) under Mac OS X when built in the standard
way, i.e.

- tar xzf cfitsio3370.tar.gz (or whatever version this is)
- cd cfitsio/

- ./configure
- make
- make install

---------------------------------------------------------------------
To install CFITSIO using MacPorts:
---------------------------------------------------------------------

If you have MacPorts installed, you may install CFITSIO simply with
the command

  $ sudo port install cfitsio +universal

For more information, please visit:

http://macports.org
https://trac.macports.org/browser/trunk/dports/science/cfitsio/Portfile

---------------------------------------------------------------------
To install CFITSIO using Homebrew:
---------------------------------------------------------------------

If you have Homebrew installed, you may install CFITSIO simply with
the command

  $ brew install cfitsio

For more information, please visit:

http://brew.sh
http://brewformulas.org/Cfitsio

---------------------------------------------------------------------
To build CFITSIO using the XCode GUI:
---------------------------------------------------------------------

- tar xzf cfitsio3370.tar.gz (or whatever version this is)
- cd cfitsio/

- Start Xcode and open cfitsio.xcodeproj/project.pbxproj,
  or just "open" the file from a terminal command line,

   $ open cfitsio.xcodeproj/project.pbxproj

  and this will start up XCode for you.

- Press the Build (or "Play") button in the upper left
  corner of the GUI.

---------------------------------------------------------------------
---------------------------------------------------------------------

Below, are the old (and now obsolete) instructions for building CFITSIO
on classic Mac OS-9 or earlier versions:

1. Un binhex and unstuff cfitsio_mac.sit.hqx
2. put CFitsioPPC.mcp in the cfitsio directory.
2. Load CFitsioPPC.mcp into CodeWarrior Pro 5 and make.
   This builds the cfitsio library for PPC.  There are also targets for both 
   the test program and the speed test program.

To use the MacOS port you can add Cfitsio PPC.lib to your Codewarrior Pro 5
project.  Note that this only has been tested for the PPC. It probably
won't work on 68k macs.  Also note that the fortran bindings aren't
included.  I haven't worked with the codewarrior f2c plugin so I don't know
how these would work.  If one is interested, please write and I can look
into this.

cfitsio-3.47/README_OLD.win0000644000225700000360000000671613464573432014574 0ustar  cagordonlhea===============================================================================
===============================================================================
= NOTE:  This is the old version of the README.win32 file that was distributed
= with CFITSIO up until version 3.35 in 2013.  These instruction may still work
= with more recent versions of CFITSIO, however, users are strongly urged to 
= use the CMake procedures that are now documented in the new README.win32 file.
===============================================================================
===============================================================================

     Instructions on using CFITSIO on Windows platforms for C programmers

These instructions use a simple DOS-style command window. It is also possible
to build and use CFITSIO within a GUI programming environment such as Visual
Studio, but this is not supported here.

===============================================================================
1.  Build the CFITSIO dll library  

This step will create the cfitsio.def, cfitsio.dll, and cfitsio.lib files.
(If you downloaded the CFITSIO .zip file that contains the pre-built binary
.dll file, then SKIP THIS STEP).

  A. With Microsoft Visual C++:

      1. Open a DOS command window and execute the vcvars32.bat file that 
         is distributed with older versions of Visual C++, or simply open 
         the Visual C++ command window (e.g., when using Visual Studio 2010).

      2. Unpack the CFITSIO source files (cfitxxxx.zip) into a new empty directory

      3. In the DOS command window, cd to that directory and enter the 
         following commands:

		nmake winDumpExts.mak
		nmake makefile.vcc
			(ignore the compiler warning messages)

  B: With  Borland C++:

     First, follow the instructions provided by Borland to set up
     the proper environment variables and configure files for the compiler.
   
     Unpack the cfitsio.zip source file distribution into a suitable directory.
   
     In a DOS command window, cd to that directory and then execute the 
     makepc.bat batch file on the command line to build the CFITSIO library, 
     and the testprog and cookbook sample programs.

===============================================================================
2.  Test the CFITSIO library with Visual C++

     Compile and link the testprog.c test program.  When using Visual Studio,
     the command is:

		cl /MD testprog.c cfitsio.lib


     This will create the testprog.exe executable program.  Running this
     program should print out a long series of diagnostic messages
     that should end with "Status = 0; OK - no error"

===============================================================================
3.  Compile and link an application program that calls CFITSIO routines
    with Visual C++

	Include the fitsio.h and longnam.h header files in the C source code.

	Link the program with the cfitsio.lib file:

		cl /MD your_program.c cfitsio.lib


	NOTE: The /MD command line switch must be specified on the cl
	command line to force the compiler/linker to use the
	appropriete runtime library.   If this switch is omitted, then
	the fits_report_error function in CFITSIO will likely crash.  

	When building programs in the Visual Studio environment, one
	can force the equivalent of the /MD switch by selecting
	'Settings...' under the 'Project' menu, then click on the C/C++
	tab and select the 'Code Generator' category.  Then under 'User
	Run-time Library' select 'Multithreaded DLL'.

cfitsio-3.47/README.win0000644000225700000360000001376613464573432014101 0ustar  cagordonlheaInstructions on building and using CFITSIO on Windows platforms 
for C programmers using Microsoft Visual Studio or Borland C++.

These instructions for building the CFITSIO library under Windows use the
CMake build system that is available from http://www.cmake.org.

===============================================================================

1.  Build the CFITSIO dll library  

This step will create the cfitsio.dll, and cfitsio.lib files.  If you have 
downloaded the CFITSIO DLL .zip file that already contains the pre-built 
versions of these files, then SKIP THIS STEP.

  a. If CMAKE is not already installed on your machine, download it from 
     http://www.cmake.org.  It is recommended that you choose the 
     "Add CMake to the system PATH for current user" option during the 
     installation setup process for convenience when running CMake later on.

  b. Unzip the CFITSIO .zip file (e.g. cfit3360.zip) that was obtained from 
     the CFITSIO Web site (http://heasarc.gsfc.nasa.gov/fitsio/). This will 
     create a new \cfitsio subdirectory that contains the source code and
     documentation files.  It should also contain a CMakeLists.txt file that
     will be used during the CMake build process.
         
  c. Open the Visual Studio Command Prompt window, likely using a
     desktop icon with this same name, (or the equivalent Borland command window)
     and CD (change directory) into the parent directory that is one level
     above the directory containing the CFITSIO source files that was created
     in the previous step.

  d. Create a new "cfitsio.build" subdirectory, and CD into it with the
     following commands:

     mkdir cfitsio.build
     cd cfitsio.build

     When using Visual Studio, all the files that are generated during the 
     CMake process will be created in or under this subdirectory.   
    
  e. Decide which CMake Generator you will want to use in the following step.
     This depends on which C/C++ compiler you are using and will likely have
     a name such as: 

     "Visual Studio 10"
     "Visual Studio 10 Win64" (for 64-bit builds)
     "Visual Studio 11"
     "Visual Studio 11 Win64" (for 64-bit builds)
     "Visual Studio 12"
     "Visual Studio 12 Win64" (for 64-bit builds)
     "Borland Makefiles"
     "NMake Makefiles"

      You can see a list of all the available CMake Generators by executing
      the command

         cmake.exe /?

      Note that these names are case-sensitive and must be entered in the
      following step exactly as displayed.

  f.  Execute the following commands to build the CFITSIO library:
 
      cmake.exe -G "" ..\cfitsio
      cmake.exe --build . --config Release
     
      Where the string  is the string that was selected
      in step e.  Note that the "..\cfitsio" argument in the first command
      gives the path to the directory that contains the CFITSIO source files
      and the CMakeLists.txt file.  The "." argument in the second command
      (following --build) tells CMake to build the files in the current 
      directory (i.e., the cfitsio.build directory).
      
      If this process completes successfully, you should find the CFITSIO
      library files that were created in the "cfitsio.build\Release"
      subdirectory. To verify that CFITSIO is working correctly, execute the
      testprog.exe file (in that Release directory).  This should generate
      a long stream of diagnostic messages ending with the line "Status = 0:
      OK - no error".

   g. Other CMake options.

      CMake has many other build options that may be useful in some
      situations. Refer to the CMake documentation for more
      information.  

      For example, one can build a 'debug' version of the CFITSIO library
      by executing the command "cmake.exe --build ." instead of the 2nd
      command listed above in section f.

      One can also make a thread safe version of CFITSIO using the
      pthread library with the following procedure:

      a. Download the precompiled files from the pthread-win32 project 
      (http://sourceware.org/pthreads-win32/). Put the files for your
      specific  platform (.h, .lib, .dll) into a folder 'pthread',
      parallel to the  cfitsio source folder.

      b. For the compilation of cfitsio follow the cmake steps, but use
      this  change as a replacement for the commands in step f:
      
      cmake.exe -G "" ..\cfitsio -DUSE_PTHREADS=1 
       -DCMAKE_INCLUDE_PATH=..\pthread -DCMAKE_LIBRARY_PATH=..\pthread

      cmake.exe --build . --config Release 
      
      You may need to adapt the paths for the source directory and 
      the pthread library.

============================================================================

2.  Using CFITSIO when compiling and linking application programs 

First, depending on your particular programming environment, it may be
necessary to copy the cfitsio.lib and cfitsio.dll files into another
directory where your compiler expects to find them.  Or equivalently, you
may need to specify the directory path to the location of the CFITSIO
library files when creating a project that uses them.  You may also need to
copy the fitsio.h and longnam.h include files from the \cfitsio source file
directory to a standard 'include' directory on your system.

When using the Visual Studio command line window, application programs can
be compiled and linked with CFITSIO using the following command:

		cl /MD your_program.c cfitsio.lib

The /MD command line switch must be specified to force the compiler/linker
to use the appropriate runtime library.   If this switch is omitted, then
the fits_report_error function in CFITSIO will likely crash.  

When building programs in the Visual Studio graphical environment, one can
force the equivalent of the /MD switch by selecting 'Settings...' under the
'Project' menu, then click on the C/C++ tab and select the 'Code Generator'
category.  Then under 'User Run-time Library' select 'Multithreaded DLL'.

===============================================================================
cfitsio-3.47/region.c0000644000225700000360000015500313464573432014043 0ustar  cagordonlhea#include 
#include 
#include 
#include 
#include 
#include "fitsio2.h"
#include "region.h"
static int Pt_in_Poly( double x, double y, int nPts, double *Pts );

/*---------------------------------------------------------------------------*/
int fits_read_rgnfile( const char *filename,
            WCSdata    *wcs,
            SAORegion  **Rgn,
            int        *status )
/*  Read regions from either a FITS or ASCII region file and return the information     */
/*  in the "SAORegion" structure.  If it is nonNULL, use wcs to convert the  */
/*  region coordinates to pixels.  Return an error if region is in degrees   */
/*  but no WCS data is provided.                                             */
/*---------------------------------------------------------------------------*/
{
  fitsfile *fptr;
  int tstatus = 0;

  if( *status ) return( *status );

  /* try to open as a FITS file - if that doesn't work treat as an ASCII file */

  fits_write_errmark();
  if ( ffopen(&fptr, filename, READONLY, &tstatus) ) {
    fits_clear_errmark();
    fits_read_ascii_region(filename, wcs, Rgn, status);
  } else {
    fits_read_fits_region(fptr, wcs, Rgn, status);
  }

  return(*status);

}
/*---------------------------------------------------------------------------*/
int fits_read_ascii_region( const char *filename,
			    WCSdata    *wcs,
			    SAORegion  **Rgn,
			    int        *status )
/*  Read regions from a SAO-style region file and return the information     */
/*  in the "SAORegion" structure.  If it is nonNULL, use wcs to convert the  */
/*  region coordinates to pixels.  Return an error if region is in degrees   */
/*  but no WCS data is provided.                                             */
/*---------------------------------------------------------------------------*/
{
   char     *currLine;
   char     *namePtr, *paramPtr, *currLoc;
   char     *pX, *pY, *endp;
   long     allocLen, lineLen, hh, mm, dd;
   double   *coords, X, Y, x, y, ss, div, xsave= 0., ysave= 0.;
   int      nParams, nCoords, negdec;
   int      i, done;
   FILE     *rgnFile;
   coordFmt cFmt;
   SAORegion *aRgn;
   RgnShape *newShape, *tmpShape;

   if( *status ) return( *status );

   aRgn = (SAORegion *)malloc( sizeof(SAORegion) );
   if( ! aRgn ) {
      ffpmsg("Couldn't allocate memory to hold Region file contents.");
      return(*status = MEMORY_ALLOCATION );
   }
   aRgn->nShapes    =    0;
   aRgn->Shapes     = NULL;
   if( wcs && wcs->exists )
      aRgn->wcs = *wcs;
   else
      aRgn->wcs.exists = 0;

   cFmt = pixel_fmt; /* set default format */

   /*  Allocate Line Buffer  */

   allocLen = 512;
   currLine = (char *)malloc( allocLen * sizeof(char) );
   if( !currLine ) {
      free( aRgn );
      ffpmsg("Couldn't allocate memory to hold Region file contents.");
      return(*status = MEMORY_ALLOCATION );
   }

   /*  Open Region File  */

   if( (rgnFile = fopen( filename, "r" ))==NULL ) {
      snprintf(currLine,allocLen,"Could not open Region file %s.",filename);
      ffpmsg( currLine );
      free( currLine );
      free( aRgn );
      return( *status = FILE_NOT_OPENED );
   }
   
   /*  Read in file, line by line  */
   /*  First, set error status in case file is empty */ 
   *status = FILE_NOT_OPENED;

   while( fgets(currLine,allocLen,rgnFile) != NULL ) {

      /* reset status if we got here */
      *status = 0;

      /*  Make sure we have a full line of text  */

      lineLen = strlen(currLine);
      while( lineLen==allocLen-1 && currLine[lineLen-1]!='\n' ) {
         currLoc = (char *)realloc( currLine, 2 * allocLen * sizeof(char) );
         if( !currLoc ) {
            ffpmsg("Couldn't allocate memory to hold Region file contents.");
            *status = MEMORY_ALLOCATION;
            goto error;
         } else {
            currLine = currLoc;
         }
         fgets( currLine+lineLen, allocLen+1, rgnFile );
         allocLen += allocLen;
         lineLen  += strlen(currLine+lineLen);
      }

      currLoc = currLine;
      if( *currLoc == '#' ) {

         /*  Look to see if it is followed by a format statement...  */
         /*  if not skip line                                        */

         currLoc++;
         while( isspace(*currLoc) ) currLoc++;
         if( !fits_strncasecmp( currLoc, "format:", 7 ) ) {
            if( aRgn->nShapes ) {
               ffpmsg("Format code encountered after reading 1 or more shapes.");
               *status = PARSE_SYNTAX_ERR;
               goto error;
            }
            currLoc += 7;
            while( isspace(*currLoc) ) currLoc++;
            if( !fits_strncasecmp( currLoc, "pixel", 5 ) ) {
               cFmt = pixel_fmt;
            } else if( !fits_strncasecmp( currLoc, "degree", 6 ) ) {
               cFmt = degree_fmt;
            } else if( !fits_strncasecmp( currLoc, "hhmmss", 6 ) ) {
               cFmt = hhmmss_fmt;
            } else if( !fits_strncasecmp( currLoc, "hms", 3 ) ) {
               cFmt = hhmmss_fmt;
            } else {
               ffpmsg("Unknown format code encountered in region file.");
               *status = PARSE_SYNTAX_ERR;
               goto error;
            }
         }

      } else if( !fits_strncasecmp( currLoc, "glob", 4 ) ) {
		  /* skip lines that begin with the word 'global' */

      } else {

         while( *currLoc != '\0' ) {

            namePtr  = currLoc;
            paramPtr = NULL;
            nParams  = 1;

            /*  Search for closing parenthesis  */

            done = 0;
            while( !done && !*status && *currLoc ) {
               switch (*currLoc) {
               case '(':
                  *currLoc = '\0';
                  currLoc++;
                  if( paramPtr )   /* Can't have two '(' in a region! */
                     *status = 1;
                  else
                     paramPtr = currLoc;
                  break;
               case ')':
                  *currLoc = '\0';
                  currLoc++;
                  if( !paramPtr )  /* Can't have a ')' without a '(' first */
                     *status = 1;
                  else
                     done = 1;
                  break;
               case '#':
               case '\n':
                  *currLoc = '\0';
                  if( !paramPtr )  /* Allow for a blank line */
                     done = 1;
                  break;
               case ':':  
                  currLoc++;
                  if ( paramPtr ) cFmt = hhmmss_fmt; /* set format if parameter has : */
                  break;
               case 'd':
                  currLoc++;
                  if ( paramPtr ) cFmt = degree_fmt; /* set format if parameter has d */  
                  break;
               case ',':
                  nParams++;  /* Fall through to default */
               default:
                  currLoc++;
                  break;
               }
            }
            if( *status || !done ) {
               ffpmsg( "Error reading Region file" );
               *status = PARSE_SYNTAX_ERR;
               goto error;
            }

            /*  Skip white space in region name  */

            while( isspace(*namePtr) ) namePtr++;

            /*  Was this a blank line? Or the end of the current one  */

            if( ! *namePtr && ! paramPtr ) continue;

            /*  Check for format code at beginning of the line */

            if( !fits_strncasecmp( namePtr, "image;", 6 ) ) {
				namePtr += 6;
				cFmt = pixel_fmt;
            } else if( !fits_strncasecmp( namePtr, "physical;", 9 ) ) {
                                namePtr += 9;
                                cFmt = pixel_fmt;
            } else if( !fits_strncasecmp( namePtr, "linear;", 7 ) ) {
                                namePtr += 7;
                                cFmt = pixel_fmt;
            } else if( !fits_strncasecmp( namePtr, "fk4;", 4 ) ) {
				namePtr += 4;
				cFmt = degree_fmt;
            } else if( !fits_strncasecmp( namePtr, "fk5;", 4 ) ) {
				namePtr += 4;
				cFmt = degree_fmt;
            } else if( !fits_strncasecmp( namePtr, "icrs;", 5 ) ) {
				namePtr += 5;
				cFmt = degree_fmt;

            /* the following 5 cases support region files created by POW 
	       (or ds9 Version 4.x) which
               may have lines containing  only a format code, not followed
               by a ';' (and with no region specifier on the line).  We use
               the 'continue' statement to jump to the end of the loop and
               then continue reading the next line of the region file. */

            } else if( !fits_strncasecmp( namePtr, "fk5", 3 ) ) {
				cFmt = degree_fmt;
                                continue;  /* supports POW region file format */
            } else if( !fits_strncasecmp( namePtr, "fk4", 3 ) ) {
				cFmt = degree_fmt;
                                continue;  /* supports POW region file format */
            } else if( !fits_strncasecmp( namePtr, "icrs", 4 ) ) {
				cFmt = degree_fmt;
                                continue;  /* supports POW region file format */
            } else if( !fits_strncasecmp( namePtr, "image", 5 ) ) {
				cFmt = pixel_fmt;
                                continue;  /* supports POW region file format */
            } else if( !fits_strncasecmp( namePtr, "physical", 8 ) ) {
				cFmt = pixel_fmt;
                                continue;  /* supports POW region file format */


            } else if( !fits_strncasecmp( namePtr, "galactic;", 9 ) ) {
               ffpmsg( "Galactic region coordinates not supported" );
               ffpmsg( namePtr );
               *status = PARSE_SYNTAX_ERR;
               goto error;
            } else if( !fits_strncasecmp( namePtr, "ecliptic;", 9 ) ) {
               ffpmsg( "ecliptic region coordinates not supported" );
               ffpmsg( namePtr );
               *status = PARSE_SYNTAX_ERR;
               goto error;
            }

            /**************************************************/
            /*  We've apparently found a region... Set it up  */
            /**************************************************/

            if( !(aRgn->nShapes % 10) ) {
               if( aRgn->Shapes )
                  tmpShape = (RgnShape *)realloc( aRgn->Shapes,
                                                  (10+aRgn->nShapes)
                                                  * sizeof(RgnShape) );
               else
                  tmpShape = (RgnShape *) malloc( 10 * sizeof(RgnShape) );
               if( tmpShape ) {
                  aRgn->Shapes = tmpShape;
               } else {
                  ffpmsg( "Failed to allocate memory for Region data");
                  *status = MEMORY_ALLOCATION;
                  goto error;
               }

            }
            newShape        = &aRgn->Shapes[aRgn->nShapes++];
            newShape->sign  = 1;
            newShape->shape = point_rgn;
	    for (i=0; i<8; i++) newShape->param.gen.p[i] = 0.0;
	    newShape->param.gen.a = 0.0;
	    newShape->param.gen.b = 0.0;
	    newShape->param.gen.sinT = 0.0;
	    newShape->param.gen.cosT = 0.0;

            while( isspace(*namePtr) ) namePtr++;
            
			/*  Check for the shape's sign  */

            if( *namePtr=='+' ) {
               namePtr++;
            } else if( *namePtr=='-' ) {
               namePtr++;
               newShape->sign = 0;
            }

            /* Skip white space in region name */

            while( isspace(*namePtr) ) namePtr++;
            if( *namePtr=='\0' ) {
               ffpmsg( "Error reading Region file" );
               *status = PARSE_SYNTAX_ERR;
               goto error;
            }
            lineLen = strlen( namePtr ) - 1;
            while( isspace(namePtr[lineLen]) ) namePtr[lineLen--] = '\0';

            /*  Now identify the region  */

            if(        !fits_strcasecmp( namePtr, "circle"  ) ) {
               newShape->shape = circle_rgn;
               if( nParams != 3 )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = 2;
            } else if( !fits_strcasecmp( namePtr, "annulus" ) ) {
               newShape->shape = annulus_rgn;
               if( nParams != 4 )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = 2;
            } else if( !fits_strcasecmp( namePtr, "ellipse" ) ) {
               if( nParams < 4 || nParams > 8 ) {
                  *status = PARSE_SYNTAX_ERR;
	       } else if ( nParams < 6 ) {
		 newShape->shape = ellipse_rgn;
		 newShape->param.gen.p[4] = 0.0;
	       } else {
		 newShape->shape = elliptannulus_rgn;
		 newShape->param.gen.p[6] = 0.0;
		 newShape->param.gen.p[7] = 0.0;
	       }
               nCoords = 2;
            } else if( !fits_strcasecmp( namePtr, "elliptannulus" ) ) {
               newShape->shape = elliptannulus_rgn;
               if( !( nParams==8 || nParams==6 ) )
                  *status = PARSE_SYNTAX_ERR;
               newShape->param.gen.p[6] = 0.0;
               newShape->param.gen.p[7] = 0.0;
               nCoords = 2;
            } else if( !fits_strcasecmp( namePtr, "box"    ) 
                    || !fits_strcasecmp( namePtr, "rotbox" ) ) {
	       if( nParams < 4 || nParams > 8 ) {
		 *status = PARSE_SYNTAX_ERR;
	       } else if ( nParams < 6 ) {
		 newShape->shape = box_rgn;
		 newShape->param.gen.p[4] = 0.0;
	       } else {
		  newShape->shape = boxannulus_rgn;
		  newShape->param.gen.p[6] = 0.0;
		  newShape->param.gen.p[7] = 0.0;
	       }
	       nCoords = 2;
            } else if( !fits_strcasecmp( namePtr, "rectangle"    )
                    || !fits_strcasecmp( namePtr, "rotrectangle" ) ) {
               newShape->shape = rectangle_rgn;
               if( nParams < 4 || nParams > 5 )
                  *status = PARSE_SYNTAX_ERR;
               newShape->param.gen.p[4] = 0.0;
               nCoords = 4;
            } else if( !fits_strcasecmp( namePtr, "diamond"    )
                    || !fits_strcasecmp( namePtr, "rotdiamond" )
                    || !fits_strcasecmp( namePtr, "rhombus"    )
                    || !fits_strcasecmp( namePtr, "rotrhombus" ) ) {
               newShape->shape = diamond_rgn;
               if( nParams < 4 || nParams > 5 )
                  *status = PARSE_SYNTAX_ERR;
               newShape->param.gen.p[4] = 0.0;
               nCoords = 2;
            } else if( !fits_strcasecmp( namePtr, "sector"  )
                    || !fits_strcasecmp( namePtr, "pie"     ) ) {
               newShape->shape = sector_rgn;
               if( nParams != 4 )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = 2;
            } else if( !fits_strcasecmp( namePtr, "point"   ) ) {
               newShape->shape = point_rgn;
               if( nParams != 2 )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = 2;
            } else if( !fits_strcasecmp( namePtr, "line"    ) ) {
               newShape->shape = line_rgn;
               if( nParams != 4 )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = 4;
            } else if( !fits_strcasecmp( namePtr, "polygon" ) ) {
               newShape->shape = poly_rgn;
               if( nParams < 6 || (nParams&1) )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = nParams;
            } else if( !fits_strcasecmp( namePtr, "panda" ) ) {
               newShape->shape = panda_rgn;
               if( nParams != 8 )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = 2;
            } else if( !fits_strcasecmp( namePtr, "epanda" ) ) {
               newShape->shape = epanda_rgn;
               if( nParams < 10 || nParams > 11 )
                  *status = PARSE_SYNTAX_ERR;
               newShape->param.gen.p[10] = 0.0;
               nCoords = 2;
            } else if( !fits_strcasecmp( namePtr, "bpanda" ) ) {
               newShape->shape = bpanda_rgn;
               if( nParams < 10 || nParams > 11 )
                  *status = PARSE_SYNTAX_ERR;
               newShape->param.gen.p[10] = 0.0;
               nCoords = 2;
            } else {
               ffpmsg( "Unrecognized region found in region file:" );
               ffpmsg( namePtr );
               *status = PARSE_SYNTAX_ERR;
               goto error;
            }
            if( *status ) {
               ffpmsg( "Wrong number of parameters found for region" );
               ffpmsg( namePtr );
               goto error;
            }

            /*  Parse Parameter string... convert to pixels if necessary  */

            if( newShape->shape==poly_rgn ) {
               newShape->param.poly.Pts = (double *)malloc( nParams
                                                            * sizeof(double) );
               if( !newShape->param.poly.Pts ) {
                  ffpmsg(
                      "Could not allocate memory to hold polygon parameters" );
                  *status = MEMORY_ALLOCATION;
                  goto error;
               }
               newShape->param.poly.nPts = nParams;
               coords = newShape->param.poly.Pts;
            } else
               coords = newShape->param.gen.p;

            /*  Parse the initial "WCS?" coordinates  */
            for( i=0; iexists ) {
                     ffpmsg("WCS information needed to convert region coordinates.");
                     *status = NO_WCS_KEY;
                     goto error;
                  }
                  
                  if( ffxypx(  X,  Y, wcs->xrefval, wcs->yrefval,
                                      wcs->xrefpix, wcs->yrefpix,
                                      wcs->xinc,    wcs->yinc,
                                      wcs->rot,     wcs->type,
                              &x, &y, status ) ) {
                     ffpmsg("Error converting region to pixel coordinates.");
                     goto error;
                  }
                  X = x; Y = y;
               }
               coords[i]   = X;
               coords[i+1] = Y;

            }

            /*  Read in remaining parameters...  */

            for( ; ixrefval, wcs->yrefval,
			       wcs->xrefpix, wcs->yrefpix,
			       wcs->xinc,    wcs->yinc,
			       wcs->rot,     wcs->type,
                               &x, &y, status ) ) {
		     ffpmsg("Error converting region to pixel coordinates.");
		     goto error;
		  }
		 
		  coords[i] = sqrt( pow(x-coords[0],2) + pow(y-coords[1],2) );

               }
            }

	    /* special case for elliptannulus and boxannulus if only one angle
	       was given */

	    if ( (newShape->shape == elliptannulus_rgn || 
		  newShape->shape == boxannulus_rgn ) && nParams == 7 ) {
	      coords[7] = coords[6];
	    }

            /* Also, correct the position angle for any WCS rotation:  */
            /*    If regions are specified in WCS coordintes, then the angles */
            /*    are relative to the WCS system, not the pixel X,Y system */

	    if( cFmt!=pixel_fmt ) {	    
	      switch( newShape->shape ) {
	      case sector_rgn:
	      case panda_rgn:
		coords[2] += (wcs->rot);
		coords[3] += (wcs->rot);
		break;
	      case box_rgn:
	      case rectangle_rgn:
	      case diamond_rgn:
	      case ellipse_rgn:
		coords[4] += (wcs->rot);
		break;
	      case boxannulus_rgn:
	      case elliptannulus_rgn:
		coords[6] += (wcs->rot);
		coords[7] += (wcs->rot);
		break;
	      case epanda_rgn:
	      case bpanda_rgn:
		coords[2] += (wcs->rot);
		coords[3] += (wcs->rot);
		coords[10] += (wcs->rot);
              default:
                break;
	      }
	    }

	    /* do some precalculations to speed up tests */

	    fits_setup_shape(newShape);

         }  /* End of while( *currLoc ) */
/*
  if (coords)printf("%.8f %.8f %.8f %.8f %.8f\n",
   coords[0],coords[1],coords[2],coords[3],coords[4]); 
*/
      }  /* End of if...else parse line */
   }   /* End of while( fgets(rgnFile) ) */

   /* set up component numbers */

   fits_set_region_components( aRgn );

error:

   if( *status ) {
      fits_free_region( aRgn );
   } else {
      *Rgn = aRgn;
   }

   fclose( rgnFile );
   free( currLine );

   return( *status );
}

/*---------------------------------------------------------------------------*/
int fits_in_region( double    X,
            double    Y,
            SAORegion *Rgn )
/*  Test if the given point is within the region described by Rgn.  X and    */
/*  Y are in pixel coordinates.                                              */
/*---------------------------------------------------------------------------*/
{
   double x, y, dx, dy, xprime, yprime, r, th;
   RgnShape *Shapes;
   int i, cur_comp;
   int result, comp_result;

   Shapes = Rgn->Shapes;

   result = 0;
   comp_result = 0;
   cur_comp = Rgn->Shapes[0].comp;

   for( i=0; inShapes; i++, Shapes++ ) {

     /* if this region has a different component number to the last one  */
     /*	then replace the accumulated selection logical with the union of */
     /*	the current logical and the total logical. Reinitialize the      */
     /* temporary logical.                                               */

     if ( i==0 || Shapes->comp != cur_comp ) {
       result = result || comp_result;
       cur_comp = Shapes->comp;
       /* if an excluded region is given first, then implicitly   */
       /* assume a previous shape that includes the entire image. */
       comp_result = !Shapes->sign;
     }

    /* only need to test if  */
    /*   the point is not already included and this is an include region, */
    /* or the point is included and this is an excluded region */

    if ( (!comp_result && Shapes->sign) || (comp_result && !Shapes->sign) ) { 

      comp_result = 1;

      switch( Shapes->shape ) {

      case box_rgn:
         /*  Shift origin to center of region  */
         xprime = X - Shapes->param.gen.p[0];
         yprime = Y - Shapes->param.gen.p[1];

         /*  Rotate point to region's orientation  */
         x =  xprime * Shapes->param.gen.cosT + yprime * Shapes->param.gen.sinT;
         y = -xprime * Shapes->param.gen.sinT + yprime * Shapes->param.gen.cosT;

         dx = 0.5 * Shapes->param.gen.p[2];
         dy = 0.5 * Shapes->param.gen.p[3];
         if( (x < -dx) || (x > dx) || (y < -dy) || (y > dy) )
            comp_result = 0;
         break;

      case boxannulus_rgn:
         /*  Shift origin to center of region  */
         xprime = X - Shapes->param.gen.p[0];
         yprime = Y - Shapes->param.gen.p[1];

         /*  Rotate point to region's orientation  */
         x =  xprime * Shapes->param.gen.cosT + yprime * Shapes->param.gen.sinT;
         y = -xprime * Shapes->param.gen.sinT + yprime * Shapes->param.gen.cosT;

         dx = 0.5 * Shapes->param.gen.p[4];
         dy = 0.5 * Shapes->param.gen.p[5];
         if( (x < -dx) || (x > dx) || (y < -dy) || (y > dy) ) {
	   comp_result = 0;
	 } else {
	   /* Repeat test for inner box */
	   x =  xprime * Shapes->param.gen.b + yprime * Shapes->param.gen.a;
	   y = -xprime * Shapes->param.gen.a + yprime * Shapes->param.gen.b;
	   
	   dx = 0.5 * Shapes->param.gen.p[2];
	   dy = 0.5 * Shapes->param.gen.p[3];
	   if( (x >= -dx) && (x <= dx) && (y >= -dy) && (y <= dy) )
	     comp_result = 0;
	 }
         break;

      case rectangle_rgn:
         /*  Shift origin to center of region  */
         xprime = X - Shapes->param.gen.p[5];
         yprime = Y - Shapes->param.gen.p[6];

         /*  Rotate point to region's orientation  */
         x =  xprime * Shapes->param.gen.cosT + yprime * Shapes->param.gen.sinT;
         y = -xprime * Shapes->param.gen.sinT + yprime * Shapes->param.gen.cosT;

         dx = Shapes->param.gen.a;
         dy = Shapes->param.gen.b;
         if( (x < -dx) || (x > dx) || (y < -dy) || (y > dy) )
            comp_result = 0;
         break;

      case diamond_rgn:
         /*  Shift origin to center of region  */
         xprime = X - Shapes->param.gen.p[0];
         yprime = Y - Shapes->param.gen.p[1];

         /*  Rotate point to region's orientation  */
         x =  xprime * Shapes->param.gen.cosT + yprime * Shapes->param.gen.sinT;
         y = -xprime * Shapes->param.gen.sinT + yprime * Shapes->param.gen.cosT;

         dx = 0.5 * Shapes->param.gen.p[2];
         dy = 0.5 * Shapes->param.gen.p[3];
         r  = fabs(x/dx) + fabs(y/dy);
         if( r > 1 )
            comp_result = 0;
         break;

      case circle_rgn:
         /*  Shift origin to center of region  */
         x = X - Shapes->param.gen.p[0];
         y = Y - Shapes->param.gen.p[1];

         r  = x*x + y*y;
         if ( r > Shapes->param.gen.a )
            comp_result = 0;
         break;

      case annulus_rgn:
         /*  Shift origin to center of region  */
         x = X - Shapes->param.gen.p[0];
         y = Y - Shapes->param.gen.p[1];

         r = x*x + y*y;
         if ( r < Shapes->param.gen.a || r > Shapes->param.gen.b )
            comp_result = 0;
         break;

      case sector_rgn:
         /*  Shift origin to center of region  */
         x = X - Shapes->param.gen.p[0];
         y = Y - Shapes->param.gen.p[1];

         if( x || y ) {
            r = atan2( y, x ) * RadToDeg;
            if( Shapes->param.gen.p[2] <= Shapes->param.gen.p[3] ) {
               if( r < Shapes->param.gen.p[2] || r > Shapes->param.gen.p[3] )
                  comp_result = 0;
            } else {
               if( r < Shapes->param.gen.p[2] && r > Shapes->param.gen.p[3] )
                  comp_result = 0;
            }
         }
         break;

      case ellipse_rgn:
         /*  Shift origin to center of region  */
         xprime = X - Shapes->param.gen.p[0];
         yprime = Y - Shapes->param.gen.p[1];

         /*  Rotate point to region's orientation  */
         x =  xprime * Shapes->param.gen.cosT + yprime * Shapes->param.gen.sinT;
         y = -xprime * Shapes->param.gen.sinT + yprime * Shapes->param.gen.cosT;

         x /= Shapes->param.gen.p[2];
         y /= Shapes->param.gen.p[3];
         r = x*x + y*y;
         if( r>1.0 )
            comp_result = 0;
         break;

      case elliptannulus_rgn:
         /*  Shift origin to center of region  */
         xprime = X - Shapes->param.gen.p[0];
         yprime = Y - Shapes->param.gen.p[1];

         /*  Rotate point to outer ellipse's orientation  */
         x =  xprime * Shapes->param.gen.cosT + yprime * Shapes->param.gen.sinT;
         y = -xprime * Shapes->param.gen.sinT + yprime * Shapes->param.gen.cosT;

         x /= Shapes->param.gen.p[4];
         y /= Shapes->param.gen.p[5];
         r = x*x + y*y;
         if( r>1.0 )
            comp_result = 0;
         else {
            /*  Repeat test for inner ellipse  */
            x =  xprime * Shapes->param.gen.b + yprime * Shapes->param.gen.a;
            y = -xprime * Shapes->param.gen.a + yprime * Shapes->param.gen.b;

            x /= Shapes->param.gen.p[2];
            y /= Shapes->param.gen.p[3];
            r = x*x + y*y;
            if( r<1.0 )
               comp_result = 0;
         }
         break;

      case line_rgn:
         /*  Shift origin to first point of line  */
         xprime = X - Shapes->param.gen.p[0];
         yprime = Y - Shapes->param.gen.p[1];

         /*  Rotate point to line's orientation  */
         x =  xprime * Shapes->param.gen.cosT + yprime * Shapes->param.gen.sinT;
         y = -xprime * Shapes->param.gen.sinT + yprime * Shapes->param.gen.cosT;

         if( (y < -0.5) || (y >= 0.5) || (x < -0.5)
             || (x >= Shapes->param.gen.a) )
            comp_result = 0;
         break;

      case point_rgn:
         /*  Shift origin to center of region  */
         x = X - Shapes->param.gen.p[0];
         y = Y - Shapes->param.gen.p[1];

         if ( (x<-0.5) || (x>=0.5) || (y<-0.5) || (y>=0.5) )
            comp_result = 0;
         break;

      case poly_rgn:
         if( Xxmin || X>Shapes->xmax
             || Yymin || Y>Shapes->ymax )
            comp_result = 0;
         else
            comp_result = Pt_in_Poly( X, Y, Shapes->param.poly.nPts,
                                       Shapes->param.poly.Pts );
         break;

      case panda_rgn:
         /*  Shift origin to center of region  */
         x = X - Shapes->param.gen.p[0];
         y = Y - Shapes->param.gen.p[1];

         r = x*x + y*y;
         if ( r < Shapes->param.gen.a || r > Shapes->param.gen.b ) {
	   comp_result = 0;
	 } else {
	   if( x || y ) {
	     th = atan2( y, x ) * RadToDeg;
	     if( Shapes->param.gen.p[2] <= Shapes->param.gen.p[3] ) {
               if( th < Shapes->param.gen.p[2] || th > Shapes->param.gen.p[3] )
		 comp_result = 0;
	     } else {
               if( th < Shapes->param.gen.p[2] && th > Shapes->param.gen.p[3] )
		 comp_result = 0;
	     }
	   }
         }
         break;

      case epanda_rgn:
         /*  Shift origin to center of region  */
         xprime = X - Shapes->param.gen.p[0];
         yprime = Y - Shapes->param.gen.p[1];

         /*  Rotate point to region's orientation  */
         x =  xprime * Shapes->param.gen.cosT + yprime * Shapes->param.gen.sinT;
         y = -xprime * Shapes->param.gen.sinT + yprime * Shapes->param.gen.cosT;
	 xprime = x;
	 yprime = y;

	 /* outer region test */
         x = xprime/Shapes->param.gen.p[7];
         y = yprime/Shapes->param.gen.p[8];
         r = x*x + y*y;
	 if ( r>1.0 )
	   comp_result = 0;
	 else {
	   /* inner region test */
	   x = xprime/Shapes->param.gen.p[5];
	   y = yprime/Shapes->param.gen.p[6];
	   r = x*x + y*y;
	   if ( r<1.0 )
	     comp_result = 0;
	   else {
	     /* angle test */
	     if( xprime || yprime ) {
	       th = atan2( yprime, xprime ) * RadToDeg;
	       if( Shapes->param.gen.p[2] <= Shapes->param.gen.p[3] ) {
		 if( th < Shapes->param.gen.p[2] || th > Shapes->param.gen.p[3] )
		   comp_result = 0;
	       } else {
		 if( th < Shapes->param.gen.p[2] && th > Shapes->param.gen.p[3] )
		   comp_result = 0;
	       }
	     }
	   }
	 }
         break;

      case bpanda_rgn:
         /*  Shift origin to center of region  */
         xprime = X - Shapes->param.gen.p[0];
         yprime = Y - Shapes->param.gen.p[1];

         /*  Rotate point to region's orientation  */
         x =  xprime * Shapes->param.gen.cosT + yprime * Shapes->param.gen.sinT;
         y = -xprime * Shapes->param.gen.sinT + yprime * Shapes->param.gen.cosT;

	 /* outer box test */
         dx = 0.5 * Shapes->param.gen.p[7];
         dy = 0.5 * Shapes->param.gen.p[8];
         if( (x < -dx) || (x > dx) || (y < -dy) || (y > dy) )
	   comp_result = 0;
	 else {
	   /* inner box test */
	   dx = 0.5 * Shapes->param.gen.p[5];
	   dy = 0.5 * Shapes->param.gen.p[6];
	   if( (x >= -dx) && (x <= dx) && (y >= -dy) && (y <= dy) )
	     comp_result = 0;
	   else {
	     /* angle test */
	     if( x || y ) {
	       th = atan2( y, x ) * RadToDeg;
	       if( Shapes->param.gen.p[2] <= Shapes->param.gen.p[3] ) {
		 if( th < Shapes->param.gen.p[2] || th > Shapes->param.gen.p[3] )
		   comp_result = 0;
	       } else {
		 if( th < Shapes->param.gen.p[2] && th > Shapes->param.gen.p[3] )
		   comp_result = 0;
	       }
	     }
	   }
	 }
         break;
      }

      if( !Shapes->sign ) comp_result = !comp_result;

     } 

   }

   result = result || comp_result;
   
   return( result );
}

/*---------------------------------------------------------------------------*/
void fits_free_region( SAORegion *Rgn )
/*   Free up memory allocated to hold the region data.                       */
/*---------------------------------------------------------------------------*/
{
   int i;

   for( i=0; inShapes; i++ )
      if( Rgn->Shapes[i].shape == poly_rgn )
         free( Rgn->Shapes[i].param.poly.Pts );
   if( Rgn->Shapes )
      free( Rgn->Shapes );
   free( Rgn );
}

/*---------------------------------------------------------------------------*/
static int Pt_in_Poly( double x,
                       double y,
                       int nPts,
                       double *Pts )
/*  Internal routine for testing whether the coordinate x,y is within the    */
/*  polygon region traced out by the array Pts.                              */
/*---------------------------------------------------------------------------*/
{
   int i, j, flag=0;
   double prevX, prevY;
   double nextX, nextY;
   double dx, dy, Dy;

   nextX = Pts[nPts-2];
   nextY = Pts[nPts-1];

   for( i=0; iprevY && y>=nextY) || (yprevX && x>=nextX) )
         continue;
      
      /* Check to see if x,y lies right on the segment */

      if( x>=prevX || x>nextX ) {
         dy = y - prevY;
         Dy = nextY - prevY;

         if( fabs(Dy)<1e-10 ) {
            if( fabs(dy)<1e-10 )
               return( 1 );
            else
               continue;
         }

         dx = prevX + ( (nextX-prevX)/(Dy) ) * dy - x;
         if( dx < -1e-10 )
            continue;
         if( dx <  1e-10 )
            return( 1 );
      }

      /* There is an intersection! Make sure it isn't a V point.  */

      if( y != prevY ) {
         flag = 1 - flag;
      } else {
         j = i+1;  /* Point to Y component */
         do {
            if( j>1 )
               j -= 2;
            else
               j = nPts-1;
         } while( y == Pts[j] );

         if( (nextY-y)*(y-Pts[j]) > 0 )
            flag = 1-flag;
      }

   }
   return( flag );
}
/*---------------------------------------------------------------------------*/
void fits_set_region_components ( SAORegion *aRgn )
{
/* 
   Internal routine to turn a collection of regions read from an ascii file into
   the more complex structure that is allowed by the FITS REGION extension with
   multiple components. Regions are anded within components and ored between them
   ie for a pixel to be selected it must be selected by at least one component
   and to be selected by a component it must be selected by all that component's
   shapes.

   The algorithm is to replicate every exclude region after every include
   region before it in the list. eg reg1, reg2, -reg3, reg4, -reg5 becomes
   (reg1, -reg3, -reg5), (reg2, -reg5, -reg3), (reg4, -reg5) where the
   parentheses designate components.
*/

  int i, j, k, icomp;

/* loop round shapes */

  i = 0;
  while ( inShapes ) {

    /* first do the case of an exclude region */

    if ( !aRgn->Shapes[i].sign ) {

      /* we need to run back through the list copying the current shape as
	 required. start by findin the first include shape before this exclude */

      j = i-1;
      while ( j > 0 && !aRgn->Shapes[j].sign ) j--;

      /* then go back one more shape */

      j--;

      /* and loop back through the regions */

      while ( j >= 0 ) {

	/* if this is an include region then insert a copy of the exclude
	   region immediately after it */

	if ( aRgn->Shapes[j].sign ) {

	  aRgn->Shapes = (RgnShape *) realloc (aRgn->Shapes,(1+aRgn->nShapes)*sizeof(RgnShape));
	  aRgn->nShapes++;
	  for (k=aRgn->nShapes-1; k>j+1; k--) aRgn->Shapes[k] = aRgn->Shapes[k-1];

	  i++;
	  aRgn->Shapes[j+1] = aRgn->Shapes[i];

	}

	j--;

      }

    }

    i++;

  }

  /* now set the component numbers */

  icomp = 0;
  for ( i=0; inShapes; i++ ) {
    if ( aRgn->Shapes[i].sign ) icomp++;
    aRgn->Shapes[i].comp = icomp;

    /*
    printf("i = %d, shape = %d, sign = %d, comp = %d\n", i, aRgn->Shapes[i].shape, aRgn->Shapes[i].sign, aRgn->Shapes[i].comp);
    */

  }

  return;

}

/*---------------------------------------------------------------------------*/
void fits_setup_shape ( RgnShape *newShape)
{
/* Perform some useful calculations now to speed up filter later             */

  double X, Y, R;
  double *coords;
  int i;

  if ( newShape->shape == poly_rgn ) {
    coords = newShape->param.poly.Pts;
  } else {
    coords = newShape->param.gen.p;
  }

  switch( newShape->shape ) {
  case circle_rgn:
    newShape->param.gen.a = coords[2] * coords[2];
    break;
  case annulus_rgn:
    newShape->param.gen.a = coords[2] * coords[2];
    newShape->param.gen.b = coords[3] * coords[3];
    break;
  case sector_rgn:
    while( coords[2]> 180.0 ) coords[2] -= 360.0;
    while( coords[2]<=-180.0 ) coords[2] += 360.0;
    while( coords[3]> 180.0 ) coords[3] -= 360.0;
    while( coords[3]<=-180.0 ) coords[3] += 360.0;
    break;
  case ellipse_rgn:
    newShape->param.gen.sinT = sin( myPI * (coords[4] / 180.0) );
    newShape->param.gen.cosT = cos( myPI * (coords[4] / 180.0) );
    break;
  case elliptannulus_rgn:
    newShape->param.gen.a    = sin( myPI * (coords[6] / 180.0) );
    newShape->param.gen.b    = cos( myPI * (coords[6] / 180.0) );
    newShape->param.gen.sinT = sin( myPI * (coords[7] / 180.0) );
    newShape->param.gen.cosT = cos( myPI * (coords[7] / 180.0) );
    break;
  case box_rgn:
    newShape->param.gen.sinT = sin( myPI * (coords[4] / 180.0) );
    newShape->param.gen.cosT = cos( myPI * (coords[4] / 180.0) );
    break;
  case boxannulus_rgn:
    newShape->param.gen.a    = sin( myPI * (coords[6] / 180.0) );
    newShape->param.gen.b    = cos( myPI * (coords[6] / 180.0) );
    newShape->param.gen.sinT = sin( myPI * (coords[7] / 180.0) );
    newShape->param.gen.cosT = cos( myPI * (coords[7] / 180.0) );
    break;
  case rectangle_rgn:
    newShape->param.gen.sinT = sin( myPI * (coords[4] / 180.0) );
    newShape->param.gen.cosT = cos( myPI * (coords[4] / 180.0) );
    X = 0.5 * ( coords[2]-coords[0] );
    Y = 0.5 * ( coords[3]-coords[1] );
    newShape->param.gen.a = fabs( X * newShape->param.gen.cosT
				  + Y * newShape->param.gen.sinT );
    newShape->param.gen.b = fabs( Y * newShape->param.gen.cosT
				  - X * newShape->param.gen.sinT );
    newShape->param.gen.p[5] = 0.5 * ( coords[2]+coords[0] );
    newShape->param.gen.p[6] = 0.5 * ( coords[3]+coords[1] );
    break;
  case diamond_rgn:
    newShape->param.gen.sinT = sin( myPI * (coords[4] / 180.0) );
    newShape->param.gen.cosT = cos( myPI * (coords[4] / 180.0) );
    break;
  case line_rgn:
    X = coords[2] - coords[0];
    Y = coords[3] - coords[1];
    R = sqrt( X*X + Y*Y );
    newShape->param.gen.sinT = ( R ? Y/R : 0.0 );
    newShape->param.gen.cosT = ( R ? X/R : 1.0 );
    newShape->param.gen.a    = R + 0.5;
    break;
  case panda_rgn:
    while( coords[2]> 180.0 ) coords[2] -= 360.0;
    while( coords[2]<=-180.0 ) coords[2] += 360.0;
    while( coords[3]> 180.0 ) coords[3] -= 360.0;
    while( coords[3]<=-180.0 ) coords[3] += 360.0;
    newShape->param.gen.a = newShape->param.gen.p[5]*newShape->param.gen.p[5];
    newShape->param.gen.b = newShape->param.gen.p[6]*newShape->param.gen.p[6];
    break;
  case epanda_rgn:
  case bpanda_rgn:
    while( coords[2]> 180.0 ) coords[2] -= 360.0;
    while( coords[2]<=-180.0 ) coords[2] += 360.0;
    while( coords[3]> 180.0 ) coords[3] -= 360.0;
    while( coords[3]<=-180.0 ) coords[3] += 360.0;
    newShape->param.gen.sinT = sin( myPI * (coords[10] / 180.0) );
    newShape->param.gen.cosT = cos( myPI * (coords[10] / 180.0) );
    break;
  default:
    break;
  }

  /*  Set the xmin, xmax, ymin, ymax elements of the RgnShape structure */

  /* For everything which has first two parameters as center position just */
  /* find a circle that encompasses the region and use it to set the       */
  /* bounding box                                                          */

  R = -1.0;

  switch ( newShape->shape ) {

  case circle_rgn:
    R = coords[2];
    break;

  case annulus_rgn:
    R = coords[3];
    break;

  case ellipse_rgn:
    if ( coords[2] > coords[3] ) {
      R = coords[2];
    } else {
      R = coords[3];
    }
    break;

  case elliptannulus_rgn:
    if ( coords[4] > coords[5] ) {
      R = coords[4];
    } else {
      R = coords[5];
    }
    break;

  case box_rgn:
    R = sqrt(coords[2]*coords[2]+
	     coords[3]*coords[3])/2.0;
    break;

  case boxannulus_rgn:
    R = sqrt(coords[4]*coords[5]+
	     coords[4]*coords[5])/2.0;
    break;

  case diamond_rgn:
    if ( coords[2] > coords[3] ) {
      R = coords[2]/2.0;
    } else {
      R = coords[3]/2.0;
    }
    break;
    
  case point_rgn:
    R = 1.0;
    break;

  case panda_rgn:
    R = coords[6];
    break;

  case epanda_rgn:
    if ( coords[7] > coords[8] ) {
      R = coords[7];
    } else {
      R = coords[8];
    }
    break;

  case bpanda_rgn:
    R = sqrt(coords[7]*coords[8]+
	     coords[7]*coords[8])/2.0;
    break;

  default:
    break;
  }

  if ( R > 0.0 ) {

    newShape->xmin = coords[0] - R;
    newShape->xmax = coords[0] + R;
    newShape->ymin = coords[1] - R;
    newShape->ymax = coords[1] + R;

    return;

  }

  /* Now do the rest of the shapes that require individual methods */

  switch ( newShape->shape ) {

  case rectangle_rgn:
    R = sqrt((coords[5]-coords[0])*(coords[5]-coords[0])+
	     (coords[6]-coords[1])*(coords[6]-coords[1]));
    newShape->xmin = coords[5] - R;
    newShape->xmax = coords[5] + R;
    newShape->ymin = coords[6] - R;
    newShape->ymax = coords[6] + R;
    break;

  case poly_rgn:
    newShape->xmin = coords[0];
    newShape->xmax = coords[0];
    newShape->ymin = coords[1];
    newShape->ymax = coords[1];
    for( i=2; i < newShape->param.poly.nPts; ) {
      if( newShape->xmin > coords[i] ) /* Min X */
	newShape->xmin = coords[i];
      if( newShape->xmax < coords[i] ) /* Max X */
	newShape->xmax = coords[i];
      i++;
      if( newShape->ymin > coords[i] ) /* Min Y */
	newShape->ymin = coords[i];
      if( newShape->ymax < coords[i] ) /* Max Y */
	newShape->ymax = coords[i];
      i++;
    }
    break;

  case line_rgn:
    if ( coords[0] > coords[2] ) {
      newShape->xmin = coords[2];
      newShape->xmax = coords[0];
    } else {
      newShape->xmin = coords[0];
      newShape->xmax = coords[2];
    }
    if ( coords[1] > coords[3] ) {
      newShape->ymin = coords[3];
      newShape->ymax = coords[1];
    } else {
      newShape->ymin = coords[1];
      newShape->ymax = coords[3];
    }

    break;

    /* sector doesn't have min and max so indicate by setting max < min */

  case sector_rgn:
    newShape->xmin = 1.0;
    newShape->xmax = -1.0;
    newShape->ymin = 1.0;
    newShape->ymax = -1.0;
    break;

  default:
    break;
  }

  return;

}

/*---------------------------------------------------------------------------*/
int fits_read_fits_region ( fitsfile *fptr, 
			    WCSdata *wcs, 
			    SAORegion **Rgn, 
			    int *status)
/*  Read regions from a FITS region extension and return the information     */
/*  in the "SAORegion" structure.  If it is nonNULL, use wcs to convert the  */
/*  region coordinates to pixels.  Return an error if region is in degrees   */
/*  but no WCS data is provided.                                             */
/*---------------------------------------------------------------------------*/
{

  int i, j, icol[6], idum, anynul, npos;
  int dotransform, got_component = 1, tstatus;
  long icsize[6];
  double X, Y, Theta, Xsave = 0, Ysave = 0, Xpos, Ypos;
  double *coords;
  char *cvalue, *cvalue2;
  char comment[FLEN_COMMENT];
  char colname[6][FLEN_VALUE] = {"X", "Y", "SHAPE", "R", "ROTANG", "COMPONENT"};
  char shapename[17][FLEN_VALUE] = {"POINT","CIRCLE","ELLIPSE","ANNULUS",
				    "ELLIPTANNULUS","BOX","ROTBOX","BOXANNULUS",
				    "RECTANGLE","ROTRECTANGLE","POLYGON","PIE",
				    "SECTOR","DIAMOND","RHOMBUS","ROTDIAMOND",
				    "ROTRHOMBUS"};
  int shapetype[17] = {point_rgn, circle_rgn, ellipse_rgn, annulus_rgn, 
		       elliptannulus_rgn, box_rgn, box_rgn, boxannulus_rgn, 
		       rectangle_rgn, rectangle_rgn, poly_rgn, sector_rgn, 
		       sector_rgn, diamond_rgn, diamond_rgn, diamond_rgn, 
		       diamond_rgn};
  SAORegion *aRgn;
  RgnShape *newShape;
  WCSdata *regwcs = 0;

  if ( *status ) return( *status );

  aRgn = (SAORegion *)malloc( sizeof(SAORegion) );
  if( ! aRgn ) {
    ffpmsg("Couldn't allocate memory to hold Region file contents.");
    return(*status = MEMORY_ALLOCATION );
  }
  aRgn->nShapes    =    0;
  aRgn->Shapes     = NULL;
  if( wcs && wcs->exists )
    aRgn->wcs = *wcs;
  else
    aRgn->wcs.exists = 0;

  /* See if we are already positioned to a region extension, else */
  /* move to the REGION extension (file is already open). */

  tstatus = 0;
  for (i=0; i<5; i++) {
    ffgcno(fptr, CASEINSEN, colname[i], &icol[i], &tstatus);
  }

  if (tstatus) {
    /* couldn't find the required columns, so search for "REGION" extension */
    if ( ffmnhd(fptr, BINARY_TBL, "REGION", 1, status) ) {
      ffpmsg("Could not move to REGION extension.");
      goto error;
    }
  }

  /* get the number of shapes and allocate memory */

  if ( ffgky(fptr, TINT, "NAXIS2", &aRgn->nShapes, comment, status) ) {
    ffpmsg("Could not read NAXIS2 keyword.");
    goto error;
  }

  aRgn->Shapes = (RgnShape *) malloc(aRgn->nShapes * sizeof(RgnShape));
  if ( !aRgn->Shapes ) {
    ffpmsg( "Failed to allocate memory for Region data");
    *status = MEMORY_ALLOCATION;
    goto error;
  }

  /* get the required column numbers */

  for (i=0; i<5; i++) {
    if ( ffgcno(fptr, CASEINSEN, colname[i], &icol[i], status) ) {
      ffpmsg("Could not find column.");
      goto error;
    }
  }

  /* try to get the optional column numbers */

  if ( ffgcno(fptr, CASEINSEN, colname[5], &icol[5], status) ) {
       got_component = 0;
  }

  /* if there was input WCS then read the WCS info for the region in case they */
  /* are different and we have to transform */

  dotransform = 0;
  if ( aRgn->wcs.exists ) {
    regwcs = (WCSdata *) malloc ( sizeof(WCSdata) );
    if ( !regwcs ) {
      ffpmsg( "Failed to allocate memory for Region WCS data");
      *status = MEMORY_ALLOCATION;
      goto error;
    }

    regwcs->exists = 1;
    if ( ffgtcs(fptr, icol[0], icol[1], ®wcs->xrefval,  ®wcs->yrefval,
		®wcs->xrefpix, ®wcs->yrefpix, ®wcs->xinc, ®wcs->yinc,
		®wcs->rot, regwcs->type, status) ) {
      regwcs->exists = 0;
      *status = 0;
    }

    if ( regwcs->exists && wcs->exists ) {
      if ( fabs(regwcs->xrefval-wcs->xrefval) > 1.0e-6 ||
	   fabs(regwcs->yrefval-wcs->yrefval) > 1.0e-6 ||
	   fabs(regwcs->xrefpix-wcs->xrefpix) > 1.0e-6 ||
	   fabs(regwcs->yrefpix-wcs->yrefpix) > 1.0e-6 ||
	   fabs(regwcs->xinc-wcs->xinc) > 1.0e-6 ||
	   fabs(regwcs->yinc-wcs->yinc) > 1.0e-6 ||
	   fabs(regwcs->rot-wcs->rot) > 1.0e-6 ||
	   !strcmp(regwcs->type,wcs->type) ) dotransform = 1;
    }
  }

  /* get the sizes of the X, Y, R, and ROTANG vectors */

  for (i=0; i<6; i++) {
    if ( ffgtdm(fptr, icol[i], 1, &idum, &icsize[i], status) ) {
      ffpmsg("Could not find vector size of column.");
      goto error;
    }
  }

  cvalue = (char *) malloc ((FLEN_VALUE+1)*sizeof(char));

  /* loop over the shapes - note 1-based counting for rows in FITS files */

  for (i=1; i<=aRgn->nShapes; i++) {

    newShape = &aRgn->Shapes[i-1];
    for (j=0; j<8; j++) newShape->param.gen.p[j] = 0.0;
    newShape->param.gen.a = 0.0;
    newShape->param.gen.b = 0.0;
    newShape->param.gen.sinT = 0.0;
    newShape->param.gen.cosT = 0.0;

    /* get the shape */

    if ( ffgcvs(fptr, icol[2], i, 1, 1, " ", &cvalue, &anynul, status) ) {
      ffpmsg("Could not read shape.");
      goto error;
    }

    /* set include or exclude */

    newShape->sign = 1;
    cvalue2 = cvalue;
    if ( !strncmp(cvalue,"!",1) ) {
      newShape->sign = 0;
      cvalue2++;
    }

    /* set the shape type */

    for (j=0; j<17; j++) {
      if ( !strcmp(cvalue2, shapename[j]) ) newShape->shape = shapetype[j];
    }

    /* allocate memory for polygon case and set coords pointer */

    if ( newShape->shape == poly_rgn ) {
      newShape->param.poly.Pts = (double *) calloc (2*icsize[0], sizeof(double));
      if ( !newShape->param.poly.Pts ) {
	ffpmsg("Could not allocate memory to hold polygon parameters" );
	*status = MEMORY_ALLOCATION;
	goto error;
      }
      newShape->param.poly.nPts = 2*icsize[0];
      coords = newShape->param.poly.Pts;
    } else {
      coords = newShape->param.gen.p;
    }


  /* read X and Y. Polygon and Rectangle require special cases */

    npos = 1;
    if ( newShape->shape == poly_rgn ) npos = newShape->param.poly.nPts/2;
    if ( newShape->shape == rectangle_rgn ) npos = 2;

    for (j=0; jparam.poly.nPts = npos * 2;
	break;
      }
      coords++;
      
      if ( ffgcvd(fptr, icol[1], i, j+1, 1, DOUBLENULLVALUE, coords, &anynul, status) ) {
	ffpmsg("Failed to read Y column for polygon region");
	goto error;
      }
      if (*coords == DOUBLENULLVALUE) { /* check for null value end of array marker */
        npos = j;
	newShape->param.poly.nPts = npos * 2;
        coords--;
	break;
      }
      coords++;
 
      if (j == 0) {  /* save the first X and Y coordinate */
        Xsave = *(coords - 2);
	Ysave = *(coords - 1);
      } else if ((Xsave == *(coords - 2)) && (Ysave == *(coords - 1)) ) {
        /* if point has same coordinate as first point, this marks the end of the array */
        npos = j + 1;
	newShape->param.poly.nPts = npos * 2;
	break;
      }
    }

    /* transform positions if the region and input wcs differ */

    if ( dotransform ) {

      coords -= npos*2;
      Xsave = coords[0];
      Ysave = coords[1];
      for (j=0; jxrefval, regwcs->yrefval, regwcs->xrefpix,
	       regwcs->yrefpix, regwcs->xinc, regwcs->yinc, regwcs->rot,
	       regwcs->type, &Xpos, &Ypos, status);
	ffxypx(Xpos, Ypos, wcs->xrefval, wcs->yrefval, wcs->xrefpix,
	       wcs->yrefpix, wcs->xinc, wcs->yinc, wcs->rot,
	       wcs->type, &coords[2*j], &coords[2*j+1], status);
	if ( *status ) {
	  ffpmsg("Failed to transform coordinates");
	  goto error;
	}
      }
      coords += npos*2;
    }

  /* read R. Circle requires one number; Box, Diamond, Ellipse, Annulus, Sector 
     and Panda two; Boxannulus and Elliptannulus four; Point, Rectangle and 
     Polygon none. */

    npos = 0;
    switch ( newShape->shape ) {
    case circle_rgn: 
      npos = 1;
      break;
    case box_rgn:
    case diamond_rgn:
    case ellipse_rgn:
    case annulus_rgn:
    case sector_rgn:
      npos = 2;
      break;
    case boxannulus_rgn:
    case elliptannulus_rgn:
      npos = 4;
      break;
    default:
      break;
    }

    if ( npos > 0 ) {
      if ( ffgcvd(fptr, icol[3], i, 1, npos, 0.0, coords, &anynul, status) ) {
	ffpmsg("Failed to read R column for region");
	goto error;
      }

    /* transform lengths if the region and input wcs differ */

      if ( dotransform ) {
	for (j=0; jxrefval, regwcs->yrefval, regwcs->xrefpix,
		 regwcs->yrefpix, regwcs->xinc, regwcs->yinc, regwcs->rot,
		 regwcs->type, &Xpos, &Ypos, status);
	  ffxypx(Xpos, Ypos, wcs->xrefval, wcs->yrefval, wcs->xrefpix,
		 wcs->yrefpix, wcs->xinc, wcs->yinc, wcs->rot,
		 wcs->type, &X, &Y, status);
	  if ( *status ) {
	    ffpmsg("Failed to transform coordinates");
	    goto error;
	  }
	  *(coords++) = sqrt(pow(X-newShape->param.gen.p[0],2)+pow(Y-newShape->param.gen.p[1],2));
	}
      } else {
	coords += npos;
      }
    }

  /* read ROTANG. Requires two values for Boxannulus, Elliptannulus, Sector, 
     Panda; one for Box, Diamond, Ellipse; and none for Circle, Point, Annulus, 
     Rectangle, Polygon */

    npos = 0;
    switch ( newShape->shape ) {
    case box_rgn:
    case diamond_rgn:
    case ellipse_rgn:
      npos = 1;
      break;
    case boxannulus_rgn:
    case elliptannulus_rgn:
    case sector_rgn:
      npos = 2;
      break;
    default:
     break;
    }

    if ( npos > 0 ) {
      if ( ffgcvd(fptr, icol[4], i, 1, npos, 0.0, coords, &anynul, status) ) {
	ffpmsg("Failed to read ROTANG column for region");
	goto error;
      }

    /* transform angles if the region and input wcs differ */

      if ( dotransform ) {
	Theta = (wcs->rot) - (regwcs->rot);
	for (j=0; jcomp, &anynul, status) ) {
        ffpmsg("Failed to read COMPONENT column for region");
        goto error;
      }
    } else {
      newShape->comp = 1;
    }


    /* do some precalculations to speed up tests */

    fits_setup_shape(newShape);

    /* end loop over shapes */

  }

error:

   if( *status )
      fits_free_region( aRgn );
   else
      *Rgn = aRgn;

   ffclos(fptr, status);

   return( *status );
}

cfitsio-3.47/region.h0000644000225700000360000000415513464573432014051 0ustar  cagordonlhea/***************************************************************/
/*                   REGION STUFF                              */
/***************************************************************/

#include "fitsio.h"
#define myPI  3.1415926535897932385
#define RadToDeg 180.0/myPI

typedef struct {
   int    exists;
   double xrefval, yrefval;
   double xrefpix, yrefpix;
   double xinc,    yinc;
   double rot;
   char   type[6];
} WCSdata;

typedef enum {
   point_rgn,
   line_rgn,
   circle_rgn,
   annulus_rgn,
   ellipse_rgn,
   elliptannulus_rgn,
   box_rgn,
   boxannulus_rgn,
   rectangle_rgn,
   diamond_rgn,
   sector_rgn,
   poly_rgn,
   panda_rgn,
   epanda_rgn,
   bpanda_rgn
} shapeType;

typedef enum { pixel_fmt, degree_fmt, hhmmss_fmt } coordFmt;
   
typedef struct {
   char      sign;        /*  Include or exclude?        */
   shapeType shape;       /*  Shape of this region       */
   int       comp;        /*  Component number for this region */

   double xmin,xmax;       /*  bounding box    */
   double ymin,ymax;

   union {                /*  Parameters - In pixels     */

      /****   Generic Shape Data   ****/

      struct {
	 double p[11];       /*  Region parameters       */
	 double sinT, cosT;  /*  For rotated shapes      */
	 double a, b;        /*  Extra scratch area      */
      } gen;

      /****      Polygon Data      ****/

      struct {
         int    nPts;        /*  Number of Polygon pts   */
         double *Pts;        /*  Polygon points          */
      } poly;

   } param;

} RgnShape;

typedef struct {
   int       nShapes;
   RgnShape  *Shapes;
   WCSdata   wcs;
} SAORegion;

/*  SAO region file routines */
int  fits_read_rgnfile( const char *filename, WCSdata *wcs, SAORegion **Rgn, int *status );
int  fits_in_region( double X, double Y, SAORegion *Rgn );
void fits_free_region( SAORegion *Rgn );
void fits_set_region_components ( SAORegion *Rgn );
void fits_setup_shape ( RgnShape *shape);
int fits_read_fits_region ( fitsfile *fptr, WCSdata * wcs, SAORegion **Rgn, int *status);
int fits_read_ascii_region ( const char *filename, WCSdata * wcs, SAORegion **Rgn, int *status);


cfitsio-3.47/ricecomp.c0000644000225700000360000010462213464573432014362 0ustar  cagordonlhea/*
  The following code was written by Richard White at STScI and made
  available for use in CFITSIO in July 1999.  These routines were
  originally contained in 2 source files: rcomp.c and rdecomp.c,
  and the 'include' file now called ricecomp.h was originally called buffer.h.
*/

/*----------------------------------------------------------*/
/*                                                          */
/*    START OF SOURCE FILE ORIGINALLY CALLED rcomp.c        */
/*                                                          */
/*----------------------------------------------------------*/
/* @(#) rcomp.c 1.5 99/03/01 12:40:27 */
/* rcomp.c	Compress image line using
 *		(1) Difference of adjacent pixels
 *		(2) Rice algorithm coding
 *
 * Returns number of bytes written to code buffer or
 * -1 on failure
 */

#include 
#include 
#include 

/*
 * nonzero_count is lookup table giving number of bits in 8-bit values not including
 * leading zeros used in fits_rdecomp, fits_rdecomp_short and fits_rdecomp_byte
 */
static const int nonzero_count[256] = {
0, 
1, 
2, 2, 
3, 3, 3, 3, 
4, 4, 4, 4, 4, 4, 4, 4, 
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 
6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 
6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8};

typedef unsigned char Buffer_t;

typedef struct {
	int bitbuffer;		/* bit buffer			*/
	int bits_to_go;		/* bits to go in buffer		*/
	Buffer_t *start;	/* start of buffer		*/
	Buffer_t *current;	/* current position in buffer	*/
	Buffer_t *end;		/* end of buffer		*/
} Buffer;

#define putcbuf(c,mf) 	((*(mf->current)++ = c), 0)

#include "fitsio2.h"

static void start_outputing_bits(Buffer *buffer);
static int done_outputing_bits(Buffer *buffer);
static int output_nbits(Buffer *buffer, int bits, int n);

/*  only used for diagnoistics
static int case1, case2, case3;
int fits_get_case(int *c1, int*c2, int*c3) {

  *c1 = case1;
  *c2 = case2;
  *c3 = case3;
  return(0);
}
*/

/* this routine used to be called 'rcomp'  (WDP)  */
/*---------------------------------------------------------------------------*/

int fits_rcomp(int a[],		/* input array			*/
	  int nx,		/* number of input pixels	*/
	  unsigned char *c,	/* output buffer		*/
	  int clen,		/* max length of output		*/
	  int nblock)		/* coding block size		*/
{
Buffer bufmem, *buffer = &bufmem;
/* int bsize;  */
int i, j, thisblock;
int lastpix, nextpix, pdiff;
int v, fs, fsmask, top, fsmax, fsbits, bbits;
int lbitbuffer, lbits_to_go;
unsigned int psum;
double pixelsum, dpsum;
unsigned int *diff;

    /*
     * Original size of each pixel (bsize, bytes) and coding block
     * size (nblock, pixels)
     * Could make bsize a parameter to allow more efficient
     * compression of short & byte images.
     */
/*    bsize = 4;   */

/*    nblock = 32; now an input parameter*/
    /*
     * From bsize derive:
     * FSBITS = # bits required to store FS
     * FSMAX = maximum value for FS
     * BBITS = bits/pixel for direct coding
     */

/*
    switch (bsize) {
    case 1:
	fsbits = 3;
	fsmax = 6;
	break;
    case 2:
	fsbits = 4;
	fsmax = 14;
	break;
    case 4:
	fsbits = 5;
	fsmax = 25;
	break;
    default:
        ffpmsg("rdecomp: bsize must be 1, 2, or 4 bytes");
	return(-1);
    }
*/

    /* move out of switch block, to tweak performance */
    fsbits = 5;
    fsmax = 25;

    bbits = 1<start = c;
    buffer->current = c;
    buffer->end = c+clen;
    buffer->bits_to_go = 8;
    /*
     * array for differences mapped to non-negative values
     */
    diff = (unsigned int *) malloc(nblock*sizeof(unsigned int));
    if (diff == (unsigned int *) NULL) {
        ffpmsg("fits_rcomp: insufficient memory");
	return(-1);
    }
    /*
     * Code in blocks of nblock pixels
     */
    start_outputing_bits(buffer);

    /* write out first int value to the first 4 bytes of the buffer */
    if (output_nbits(buffer, a[0], 32) == EOF) {
        ffpmsg("rice_encode: end of buffer");
        free(diff);
        return(-1);
    }

    lastpix = a[0];  /* the first difference will always be zero */

    thisblock = nblock;
    for (i=0; i> 1;
	for (fs = 0; psum>0; fs++) psum >>= 1;

	/*
	 * write the codes
	 * fsbits ID bits used to indicate split level
	 */
	if (fs >= fsmax) {
	    /* Special high entropy case when FS >= fsmax
	     * Just write pixel difference values directly, no Rice coding at all.
	     */
	    if (output_nbits(buffer, fsmax+1, fsbits) == EOF) {
                ffpmsg("rice_encode: end of buffer");
                free(diff);
		return(-1);
	    }
	    for (j=0; jbitbuffer;
	    lbits_to_go = buffer->bits_to_go;
	    for (j=0; j> fs;
		/*
		 * top is coded by top zeros + 1
		 */
		if (lbits_to_go >= top+1) {
		    lbitbuffer <<= top+1;
		    lbitbuffer |= 1;
		    lbits_to_go -= top+1;
		} else {
		    lbitbuffer <<= lbits_to_go;
		    putcbuf(lbitbuffer & 0xff,buffer);

		    for (top -= lbits_to_go; top>=8; top -= 8) {
			putcbuf(0, buffer);
		    }
		    lbitbuffer = 1;
		    lbits_to_go = 7-top;
		}
		/*
		 * bottom FS bits are written without coding
		 * code is output_nbits, moved into this routine to reduce overheads
		 * This code potentially breaks if FS>24, so I am limiting
		 * FS to 24 by choice of FSMAX above.
		 */
		if (fs > 0) {
		    lbitbuffer <<= fs;
		    lbitbuffer |= v & fsmask;
		    lbits_to_go -= fs;
		    while (lbits_to_go <= 0) {
			putcbuf((lbitbuffer>>(-lbits_to_go)) & 0xff,buffer);
			lbits_to_go += 8;
		    }
		}
	    }

	    /* check if overflowed output buffer */
	    if (buffer->current > buffer->end) {
                 ffpmsg("rice_encode: end of buffer");
                 free(diff);
		 return(-1);
	    }
	    buffer->bitbuffer = lbitbuffer;
	    buffer->bits_to_go = lbits_to_go;
	}
    }
    done_outputing_bits(buffer);
    free(diff);
    /*
     * return number of bytes used
     */
    return(buffer->current - buffer->start);
}
/*---------------------------------------------------------------------------*/

int fits_rcomp_short(
	  short a[],		/* input array			*/
	  int nx,		/* number of input pixels	*/
	  unsigned char *c,	/* output buffer		*/
	  int clen,		/* max length of output		*/
	  int nblock)		/* coding block size		*/
{
Buffer bufmem, *buffer = &bufmem;
/* int bsize;  */
int i, j, thisblock;

/* 
NOTE: in principle, the following 2 variable could be declared as 'short'
but in fact the code runs faster (on 32-bit Linux at least) as 'int'
*/
int lastpix, nextpix;
/* int pdiff; */
short pdiff; 
int v, fs, fsmask, top, fsmax, fsbits, bbits;
int lbitbuffer, lbits_to_go;
/* unsigned int psum; */
unsigned short psum;
double pixelsum, dpsum;
unsigned int *diff;

    /*
     * Original size of each pixel (bsize, bytes) and coding block
     * size (nblock, pixels)
     * Could make bsize a parameter to allow more efficient
     * compression of short & byte images.
     */
/*    bsize = 2; */

/*    nblock = 32; now an input parameter */
    /*
     * From bsize derive:
     * FSBITS = # bits required to store FS
     * FSMAX = maximum value for FS
     * BBITS = bits/pixel for direct coding
     */

/*
    switch (bsize) {
    case 1:
	fsbits = 3;
	fsmax = 6;
	break;
    case 2:
	fsbits = 4;
	fsmax = 14;
	break;
    case 4:
	fsbits = 5;
	fsmax = 25;
	break;
    default:
        ffpmsg("rdecomp: bsize must be 1, 2, or 4 bytes");
	return(-1);
    }
*/

    /* move these out of switch block to further tweak performance */
    fsbits = 4;
    fsmax = 14;
    
    bbits = 1<start = c;
    buffer->current = c;
    buffer->end = c+clen;
    buffer->bits_to_go = 8;
    /*
     * array for differences mapped to non-negative values
     */
    diff = (unsigned int *) malloc(nblock*sizeof(unsigned int));
    if (diff == (unsigned int *) NULL) {
        ffpmsg("fits_rcomp: insufficient memory");
	return(-1);
    }
    /*
     * Code in blocks of nblock pixels
     */
    start_outputing_bits(buffer);

    /* write out first short value to the first 2 bytes of the buffer */
    if (output_nbits(buffer, a[0], 16) == EOF) {
        ffpmsg("rice_encode: end of buffer");
        free(diff);
        return(-1);
    }

    lastpix = a[0];  /* the first difference will always be zero */

    thisblock = nblock;
    for (i=0; i> 1; */
	psum = ((unsigned short) dpsum ) >> 1;
	for (fs = 0; psum>0; fs++) psum >>= 1;

	/*
	 * write the codes
	 * fsbits ID bits used to indicate split level
	 */
	if (fs >= fsmax) {
/* case3++; */
	    /* Special high entropy case when FS >= fsmax
	     * Just write pixel difference values directly, no Rice coding at all.
	     */
	    if (output_nbits(buffer, fsmax+1, fsbits) == EOF) {
                ffpmsg("rice_encode: end of buffer");
                free(diff);
		return(-1);
	    }
	    for (j=0; jbitbuffer;
	    lbits_to_go = buffer->bits_to_go;
	    for (j=0; j> fs;
		/*
		 * top is coded by top zeros + 1
		 */
		if (lbits_to_go >= top+1) {
		    lbitbuffer <<= top+1;
		    lbitbuffer |= 1;
		    lbits_to_go -= top+1;
		} else {
		    lbitbuffer <<= lbits_to_go;
		    putcbuf(lbitbuffer & 0xff,buffer);
		    for (top -= lbits_to_go; top>=8; top -= 8) {
			putcbuf(0, buffer);
		    }
		    lbitbuffer = 1;
		    lbits_to_go = 7-top;
		}
		/*
		 * bottom FS bits are written without coding
		 * code is output_nbits, moved into this routine to reduce overheads
		 * This code potentially breaks if FS>24, so I am limiting
		 * FS to 24 by choice of FSMAX above.
		 */
		if (fs > 0) {
		    lbitbuffer <<= fs;
		    lbitbuffer |= v & fsmask;
		    lbits_to_go -= fs;
		    while (lbits_to_go <= 0) {
			putcbuf((lbitbuffer>>(-lbits_to_go)) & 0xff,buffer);
			lbits_to_go += 8;
		    }
		}
	    }
	    /* check if overflowed output buffer */
	    if (buffer->current > buffer->end) {
                 ffpmsg("rice_encode: end of buffer");
                 free(diff);
		 return(-1);
	    }
	    buffer->bitbuffer = lbitbuffer;
	    buffer->bits_to_go = lbits_to_go;
	}
    }
    done_outputing_bits(buffer);
    free(diff);
    /*
     * return number of bytes used
     */
    return(buffer->current - buffer->start);
}
/*---------------------------------------------------------------------------*/

int fits_rcomp_byte(
	  signed char a[],		/* input array			*/
	  int nx,		/* number of input pixels	*/
	  unsigned char *c,	/* output buffer		*/
	  int clen,		/* max length of output		*/
	  int nblock)		/* coding block size		*/
{
Buffer bufmem, *buffer = &bufmem;
/* int bsize; */
int i, j, thisblock;

/* 
NOTE: in principle, the following 2 variable could be declared as 'short'
but in fact the code runs faster (on 32-bit Linux at least) as 'int'
*/
int lastpix, nextpix;
/* int pdiff; */
signed char pdiff; 
int v, fs, fsmask, top, fsmax, fsbits, bbits;
int lbitbuffer, lbits_to_go;
/* unsigned int psum; */
unsigned char psum;
double pixelsum, dpsum;
unsigned int *diff;

    /*
     * Original size of each pixel (bsize, bytes) and coding block
     * size (nblock, pixels)
     * Could make bsize a parameter to allow more efficient
     * compression of short & byte images.
     */
/*    bsize = 1;  */

/*    nblock = 32; now an input parameter */
    /*
     * From bsize derive:
     * FSBITS = # bits required to store FS
     * FSMAX = maximum value for FS
     * BBITS = bits/pixel for direct coding
     */

/*
    switch (bsize) {
    case 1:
	fsbits = 3;
	fsmax = 6;
	break;
    case 2:
	fsbits = 4;
	fsmax = 14;
	break;
    case 4:
	fsbits = 5;
	fsmax = 25;
	break;
    default:
        ffpmsg("rdecomp: bsize must be 1, 2, or 4 bytes");
	return(-1);
    }
*/

    /* move these out of switch block to further tweak performance */
    fsbits = 3;
    fsmax = 6;
    bbits = 1<start = c;
    buffer->current = c;
    buffer->end = c+clen;
    buffer->bits_to_go = 8;
    /*
     * array for differences mapped to non-negative values
     */
    diff = (unsigned int *) malloc(nblock*sizeof(unsigned int));
    if (diff == (unsigned int *) NULL) {
        ffpmsg("fits_rcomp: insufficient memory");
	return(-1);
    }
    /*
     * Code in blocks of nblock pixels
     */
    start_outputing_bits(buffer);

    /* write out first byte value to the first  byte of the buffer */
    if (output_nbits(buffer, a[0], 8) == EOF) {
        ffpmsg("rice_encode: end of buffer");
        free(diff);
        return(-1);
    }

    lastpix = a[0];  /* the first difference will always be zero */

    thisblock = nblock;
    for (i=0; i> 1; */
	psum = ((unsigned char) dpsum ) >> 1;
	for (fs = 0; psum>0; fs++) psum >>= 1;

	/*
	 * write the codes
	 * fsbits ID bits used to indicate split level
	 */
	if (fs >= fsmax) {
	    /* Special high entropy case when FS >= fsmax
	     * Just write pixel difference values directly, no Rice coding at all.
	     */
	    if (output_nbits(buffer, fsmax+1, fsbits) == EOF) {
                ffpmsg("rice_encode: end of buffer");
                free(diff);
		return(-1);
	    }
	    for (j=0; jbitbuffer;
	    lbits_to_go = buffer->bits_to_go;
	    for (j=0; j> fs;
		/*
		 * top is coded by top zeros + 1
		 */
		if (lbits_to_go >= top+1) {
		    lbitbuffer <<= top+1;
		    lbitbuffer |= 1;
		    lbits_to_go -= top+1;
		} else {
		    lbitbuffer <<= lbits_to_go;
		    putcbuf(lbitbuffer & 0xff,buffer);
		    for (top -= lbits_to_go; top>=8; top -= 8) {
			putcbuf(0, buffer);
		    }
		    lbitbuffer = 1;
		    lbits_to_go = 7-top;
		}
		/*
		 * bottom FS bits are written without coding
		 * code is output_nbits, moved into this routine to reduce overheads
		 * This code potentially breaks if FS>24, so I am limiting
		 * FS to 24 by choice of FSMAX above.
		 */
		if (fs > 0) {
		    lbitbuffer <<= fs;
		    lbitbuffer |= v & fsmask;
		    lbits_to_go -= fs;
		    while (lbits_to_go <= 0) {
			putcbuf((lbitbuffer>>(-lbits_to_go)) & 0xff,buffer);
			lbits_to_go += 8;
		    }
		}
	    }
	    /* check if overflowed output buffer */
	    if (buffer->current > buffer->end) {
                 ffpmsg("rice_encode: end of buffer");
                 free(diff);
		 return(-1);
	    }
	    buffer->bitbuffer = lbitbuffer;
	    buffer->bits_to_go = lbits_to_go;
	}
    }
    done_outputing_bits(buffer);
    free(diff);
    /*
     * return number of bytes used
     */
    return(buffer->current - buffer->start);
}
/*---------------------------------------------------------------------------*/
/* bit_output.c
 *
 * Bit output routines
 * Procedures return zero on success, EOF on end-of-buffer
 *
 * Programmer: R. White     Date: 20 July 1998
 */

/* Initialize for bit output */

static void start_outputing_bits(Buffer *buffer)
{
    /*
     * Buffer is empty to start with
     */
    buffer->bitbuffer = 0;
    buffer->bits_to_go = 8;
}

/*---------------------------------------------------------------------------*/
/* Output N bits (N must be <= 32) */

static int output_nbits(Buffer *buffer, int bits, int n)
{
/* local copies */
int lbitbuffer;
int lbits_to_go;
    /* AND mask for the right-most n bits */
    static unsigned int mask[33] = 
         {0,
	  0x1,       0x3,       0x7,       0xf,       0x1f,       0x3f,       0x7f,       0xff,
	  0x1ff,     0x3ff,     0x7ff,     0xfff,     0x1fff,     0x3fff,     0x7fff,     0xffff,
	  0x1ffff,   0x3ffff,   0x7ffff,   0xfffff,   0x1fffff,   0x3fffff,   0x7fffff,   0xffffff,
	  0x1ffffff, 0x3ffffff, 0x7ffffff, 0xfffffff, 0x1fffffff, 0x3fffffff, 0x7fffffff, 0xffffffff};

    /*
     * insert bits at end of bitbuffer
     */
    lbitbuffer = buffer->bitbuffer;
    lbits_to_go = buffer->bits_to_go;
    if (lbits_to_go+n > 32) {
	/*
	 * special case for large n: put out the top lbits_to_go bits first
	 * note that 0 < lbits_to_go <= 8
	 */
	lbitbuffer <<= lbits_to_go;
/*	lbitbuffer |= (bits>>(n-lbits_to_go)) & ((1<>(n-lbits_to_go)) & *(mask+lbits_to_go);
	putcbuf(lbitbuffer & 0xff,buffer);
	n -= lbits_to_go;
	lbits_to_go = 8;
    }
    lbitbuffer <<= n;
/*    lbitbuffer |= ( bits & ((1<>(-lbits_to_go)) & 0xff,buffer);
	lbits_to_go += 8;
    }
    buffer->bitbuffer = lbitbuffer;
    buffer->bits_to_go = lbits_to_go;
    return(0);
}
/*---------------------------------------------------------------------------*/
/* Flush out the last bits */

static int done_outputing_bits(Buffer *buffer)
{
    if(buffer->bits_to_go < 8) {
	putcbuf(buffer->bitbuffer<bits_to_go,buffer);
	
/*	if (putcbuf(buffer->bitbuffer<bits_to_go,buffer) == EOF)
	    return(EOF);
*/
    }
    return(0);
}
/*---------------------------------------------------------------------------*/
/*----------------------------------------------------------*/
/*                                                          */
/*    START OF SOURCE FILE ORIGINALLY CALLED rdecomp.c      */
/*                                                          */
/*----------------------------------------------------------*/

/* @(#) rdecomp.c 1.4 99/03/01 12:38:41 */
/* rdecomp.c	Decompress image line using
 *		(1) Difference of adjacent pixels
 *		(2) Rice algorithm coding
 *
 * Returns 0 on success or 1 on failure
 */

/*    moved these 'includes' to the beginning of the file (WDP)
#include 
#include 
*/

/*---------------------------------------------------------------------------*/
/* this routine used to be called 'rdecomp'  (WDP)  */

int fits_rdecomp (unsigned char *c,		/* input buffer			*/
	     int clen,			/* length of input		*/
	     unsigned int array[],	/* output array			*/
	     int nx,			/* number of output pixels	*/
	     int nblock)		/* coding block size		*/
{
/* int bsize;  */
int i, k, imax;
int nbits, nzero, fs;
unsigned char *cend, bytevalue;
unsigned int b, diff, lastpix;
int fsmax, fsbits, bbits;
extern const int nonzero_count[];

   /*
     * Original size of each pixel (bsize, bytes) and coding block
     * size (nblock, pixels)
     * Could make bsize a parameter to allow more efficient
     * compression of short & byte images.
     */
/*    bsize = 4; */

/*    nblock = 32; now an input parameter */
    /*
     * From bsize derive:
     * FSBITS = # bits required to store FS
     * FSMAX = maximum value for FS
     * BBITS = bits/pixel for direct coding
     */

/*
    switch (bsize) {
    case 1:
	fsbits = 3;
	fsmax = 6;
	break;
    case 2:
	fsbits = 4;
	fsmax = 14;
	break;
    case 4:
	fsbits = 5;
	fsmax = 25;
	break;
    default:
        ffpmsg("rdecomp: bsize must be 1, 2, or 4 bytes");
	return 1;
    }
*/

    /* move out of switch block, to tweak performance */
    fsbits = 5;
    fsmax = 25;

    bbits = 1<> nbits) - 1;

	b &= (1< nx) imax = nx;
	if (fs<0) {
	    /* low-entropy case, all zero differences */
	    for ( ; i= 0; k -= 8) {
		    b = *c++;
		    diff |= b<0) {
		    b = *c++;
		    diff |= b>>(-k);
		    b &= (1<>1;
		} else {
		    diff = ~(diff>>1);
		}
		array[i] = diff+lastpix;
		lastpix = array[i];
	    }
	} else {
	    /* normal case, Rice coding */
	    for ( ; i>nbits);
		b &= (1<>1;
		} else {
		    diff = ~(diff>>1);
		}
		array[i] = diff+lastpix;
		lastpix = array[i];
	    }
	}
	if (c > cend) {
            ffpmsg("decompression error: hit end of compressed byte stream");
	    return 1;
	}
    }
    if (c < cend) {
        ffpmsg("decompression warning: unused bytes at end of compressed buffer");
    }
    return 0;
}
/*---------------------------------------------------------------------------*/
/* this routine used to be called 'rdecomp'  (WDP)  */

int fits_rdecomp_short (unsigned char *c,		/* input buffer			*/
	     int clen,			/* length of input		*/
	     unsigned short array[],  	/* output array			*/
	     int nx,			/* number of output pixels	*/
	     int nblock)		/* coding block size		*/
{
int i, imax;
/* int bsize; */
int k;
int nbits, nzero, fs;
unsigned char *cend, bytevalue;
unsigned int b, diff, lastpix;
int fsmax, fsbits, bbits;
extern const int nonzero_count[];

   /*
     * Original size of each pixel (bsize, bytes) and coding block
     * size (nblock, pixels)
     * Could make bsize a parameter to allow more efficient
     * compression of short & byte images.
     */

/*    bsize = 2; */
    
/*    nblock = 32; now an input parameter */
    /*
     * From bsize derive:
     * FSBITS = # bits required to store FS
     * FSMAX = maximum value for FS
     * BBITS = bits/pixel for direct coding
     */

/*
    switch (bsize) {
    case 1:
	fsbits = 3;
	fsmax = 6;
	break;
    case 2:
	fsbits = 4;
	fsmax = 14;
	break;
    case 4:
	fsbits = 5;
	fsmax = 25;
	break;
    default:
        ffpmsg("rdecomp: bsize must be 1, 2, or 4 bytes");
	return 1;
    }
*/

    /* move out of switch block, to tweak performance */
    fsbits = 4;
    fsmax = 14;

    bbits = 1<> nbits) - 1;

	b &= (1< nx) imax = nx;
	if (fs<0) {
	    /* low-entropy case, all zero differences */
	    for ( ; i= 0; k -= 8) {
		    b = *c++;
		    diff |= b<0) {
		    b = *c++;
		    diff |= b>>(-k);
		    b &= (1<>1;
		} else {
		    diff = ~(diff>>1);
		}
		array[i] = diff+lastpix;
		lastpix = array[i];
	    }
	} else {
	    /* normal case, Rice coding */
	    for ( ; i>nbits);
		b &= (1<>1;
		} else {
		    diff = ~(diff>>1);
		}
		array[i] = diff+lastpix;
		lastpix = array[i];
	    }
	}
	if (c > cend) {
            ffpmsg("decompression error: hit end of compressed byte stream");
	    return 1;
	}
    }
    if (c < cend) {
        ffpmsg("decompression warning: unused bytes at end of compressed buffer");
    }
    return 0;
}
/*---------------------------------------------------------------------------*/
/* this routine used to be called 'rdecomp'  (WDP)  */

int fits_rdecomp_byte (unsigned char *c,		/* input buffer			*/
	     int clen,			/* length of input		*/
	     unsigned char array[],  	/* output array			*/
	     int nx,			/* number of output pixels	*/
	     int nblock)		/* coding block size		*/
{
int i, imax;
/* int bsize; */
int k;
int nbits, nzero, fs;
unsigned char *cend;
unsigned int b, diff, lastpix;
int fsmax, fsbits, bbits;
extern const int nonzero_count[];

   /*
     * Original size of each pixel (bsize, bytes) and coding block
     * size (nblock, pixels)
     * Could make bsize a parameter to allow more efficient
     * compression of short & byte images.
     */

/*    bsize = 1; */
    
/*    nblock = 32; now an input parameter */
    /*
     * From bsize derive:
     * FSBITS = # bits required to store FS
     * FSMAX = maximum value for FS
     * BBITS = bits/pixel for direct coding
     */

/*
    switch (bsize) {
    case 1:
	fsbits = 3;
	fsmax = 6;
	break;
    case 2:
	fsbits = 4;
	fsmax = 14;
	break;
    case 4:
	fsbits = 5;
	fsmax = 25;
	break;
    default:
        ffpmsg("rdecomp: bsize must be 1, 2, or 4 bytes");
	return 1;
    }
*/

    /* move out of switch block, to tweak performance */
    fsbits = 3;
    fsmax = 6;

    bbits = 1<> nbits) - 1;

	b &= (1< nx) imax = nx;
	if (fs<0) {
	    /* low-entropy case, all zero differences */
	    for ( ; i= 0; k -= 8) {
		    b = *c++;
		    diff |= b<0) {
		    b = *c++;
		    diff |= b>>(-k);
		    b &= (1<>1;
		} else {
		    diff = ~(diff>>1);
		}
		array[i] = diff+lastpix;
		lastpix = array[i];
	    }
	} else {
	    /* normal case, Rice coding */
	    for ( ; i>nbits);
		b &= (1<>1;
		} else {
		    diff = ~(diff>>1);
		}
		array[i] = diff+lastpix;
		lastpix = array[i];
	    }
	}
	if (c > cend) {
            ffpmsg("decompression error: hit end of compressed byte stream");
	    return 1;
	}
    }
    if (c < cend) {
        ffpmsg("decompression warning: unused bytes at end of compressed buffer");
    }
    return 0;
}
cfitsio-3.47/sample.tpl0000644000225700000360000000677513464573432014431 0ustar  cagordonlhea# sample template - create 9 HDUs in one FITS file

# syntax :

# everything which starts with a hashmark is ignored
# the same for empty lines

# one can use \include filename to include other files
# equal sign after keyword name is optional
# \group must be terminated by \end
# xtension is terminated by \group, xtension or EOF
# First HDU of type image may be defined using "SIMPLE T"
# group may contain other groups and xtensions
# keywords may be indented, but indentation is limited to max 7chars.

# template parser processes all keywords, makes substitutions
# when necessary (hashmarks -> index), converts keyword names
# to uppercase and writes keywords to file.
# For string keywords, parser uses CFITSIO long string routines
# to store string values longer than 72 characters. Parser can
# read/process lines of any length, as long as there is enough memory.
# For a very limited set of keywords (like NAXIS1 for binary tables)
# template parser ignores values specified in template file
# (one should not specify NAXIS1 for binary tables) and computes and
# writes values respective to table structure.
# number of rows in binary/ascii tables can be specified with NAXIS2

# if the 1st HDU is not defined with "SIMPLE T" and is defined with
# xtension image/asciitable/bintable then dummy primary HDU is
# created by parser.

simple	t
 bitpix		16
 naxis		1
 naxis1		10
COMMENT
 comment  
 sdsdf / keyword without value (null type)
        if line begins with 8+ spaces everything is a comment

xtension image
 bitpix		16
 naxis		1
 naxis1		10
 QWERW		F / dfg dfgsd fg - boolean keyword
 FFFSDS45	3454345 /integer_or_real keyword
 SSSDFS34	32345.453   / real keyword
 adsfd34	(234234.34,2342342.3) / complex keyword - no space between ()
 SDFDF#		adfasdfasdfdfcvxccvzxcvcvcxv / autoindexed keyword, here idx=1
 SDFD#		'asf dfa dfad df dfad f ad fadfdaf dfdfa df loooooong keyyywoooord - reaaalllly verrrrrrrrrryy loooooooooong' / comment is max 80 chars
 history        history record, spaces (all but 1st) after keyname are copied
 SDFDF#		strg_value_without_spaces / autoindexed keyword, here idx=2
 comment        comment record, spaces (all but 1st) after keyname are copied
 strg45		'sdfasdfadfffdfasdfasdfasdf &'
 continue   'sdfsdfsdfsd fsdf' / 3 spaces must follow CONTINUE keyword


xtension image
 bitpix		16
 naxis		1
 naxis1		10

\group
 
 xtension image
  bitpix	16
  naxis		1
  naxis1	10

# create group inside group

 \group

# one can specify additional columns in group HDU. The first column
# specified will have index 7 however, since the first 6 columns are occupied
# by grouping table itself.
# Please note, that it is not allowed to specify EXTNAME keyword as an
# additional keyword for group HDU, since parser automatically writes
# EXTNAME = GROUPING keyword.

  TFORM#	13A
  TTYPE#	ADDIT_COL_IN_GRP_HDU
  TFORM#	1E
  TTYPE#	REAL_COLUMN
  COMMENT sure, there is always place for comments

# the following specifies empty ascii table (0 cols / 0 rows)

  xtension asciitable

 \end
 
\end

# one do not have to specify all NAXISn keywords. If not specified
# NAXISn equals zero.

xtension image
 bitpix	16
 naxis	1
# naxis1	10

# the following tells how to set number of rows in binary table
# note also that the last line in template file does not have to
# have LineFeed character as the last one.

xtension bintable
naxis2	 10
EXTNAME	asdjfhsdkf
TTYPE#   MEMBER_XTENSION
TFORM#   8A
TTYPE#   MEMBER_2
TFORM#   8U
TTYPE#   MEMBER_3
TFORM#   8V
TTYPE#   MEMBER_NAME
TFORM#   32A
TDIM#	 '(8,4)'
TTYPE#   MEMBER_VERSION
TFORM#   1J
TNULL#   0cfitsio-3.47/scalnull.c0000644000225700000360000002141513464573432014374 0ustar  cagordonlhea/*  This file, scalnull.c, contains the FITSIO routines used to define     */
/*  the starting heap address, the value scaling and the null values.      */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

#include 
#include "fitsio2.h"
/*--------------------------------------------------------------------------*/
int ffpthp(fitsfile *fptr,      /* I - FITS file pointer */
           long theap,          /* I - starting addrss for the heap */
           int *status)         /* IO - error status     */
/*
  Define the starting address for the heap for a binary table.
  The default address is NAXIS1 * NAXIS2.  It is in units of
  bytes relative to the beginning of the regular binary table data.
  This routine also writes the appropriate THEAP keyword to the
  FITS header.
*/
{
    if (*status > 0 || theap < 1)
        return(*status);

    /* reset position to the correct HDU if necessary */
    if (fptr->HDUposition != (fptr->Fptr)->curhdu)
        ffmahd(fptr, (fptr->HDUposition) + 1, NULL, status);

    (fptr->Fptr)->heapstart = theap;

    ffukyj(fptr, "THEAP", theap, "byte offset to heap area", status);

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpscl(fitsfile *fptr,      /* I - FITS file pointer               */
           double scale,        /* I - scaling factor: value of BSCALE */
           double zero,         /* I - zero point: value of BZERO      */
           int *status)         /* IO - error status                   */
/*
  Define the linear scaling factor for the primary array or image extension
  pixel values. This routine overrides the scaling values given by the
  BSCALE and BZERO keywords if present.  Note that this routine does not
  write or modify the BSCALE and BZERO keywords, but instead only modifies
  the values temporarily in the internal buffer.  Thus, a subsequent call to
  the ffrdef routine will reset the scaling back to the BSCALE and BZERO
  keyword values (or 1. and 0. respectively if the keywords are not present).
*/
{
    tcolumn *colptr;
    int hdutype;

    if (*status > 0)
        return(*status);

    if (scale == 0)
        return(*status = ZERO_SCALE);  /* zero scale value is illegal */

    if (ffghdt(fptr, &hdutype, status) > 0)  /* get HDU type */
        return(*status);

    if (hdutype != IMAGE_HDU)
        return(*status = NOT_IMAGE);         /* not proper HDU type */

    if (fits_is_compressed_image(fptr, status)) /* compressed images */
    {
        (fptr->Fptr)->cn_bscale = scale;
        (fptr->Fptr)->cn_bzero  = zero;
        return(*status);
    }

    /* set pointer to the first 'column' (contains group parameters if any) */
    colptr = (fptr->Fptr)->tableptr; 

    colptr++;   /* increment to the 2nd 'column' pointer  (the image itself) */

    colptr->tscale = scale;
    colptr->tzero = zero;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffpnul(fitsfile *fptr,      /* I - FITS file pointer                */
           LONGLONG nulvalue,   /* I - null pixel value: value of BLANK */
           int *status)         /* IO - error status                    */
/*
  Define the value used to represent undefined pixels in the primary array or
  image extension. This only applies to integer image pixel (i.e. BITPIX > 0).
  This routine overrides the null pixel value given by the BLANK keyword
  if present.  Note that this routine does not write or modify the BLANK
  keyword, but instead only modifies the value temporarily in the internal
  buffer. Thus, a subsequent call to the ffrdef routine will reset the null
  value back to the BLANK  keyword value (or not defined if the keyword is not
  present).
*/
{
    tcolumn *colptr;
    int hdutype;

    if (*status > 0)
        return(*status);

    if (ffghdt(fptr, &hdutype, status) > 0)  /* get HDU type */
        return(*status);

    if (hdutype != IMAGE_HDU)
        return(*status = NOT_IMAGE);         /* not proper HDU type */

    if (fits_is_compressed_image(fptr, status)) /* ignore compressed images */
        return(*status);

    /* set pointer to the first 'column' (contains group parameters if any) */
    colptr = (fptr->Fptr)->tableptr; 

    colptr++;   /* increment to the 2nd 'column' pointer  (the image itself) */

    colptr->tnull = nulvalue;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fftscl(fitsfile *fptr,      /* I - FITS file pointer */
           int colnum,          /* I - column number to apply scaling to */
           double scale,        /* I - scaling factor: value of TSCALn   */
           double zero,         /* I - zero point: value of TZEROn       */
           int *status)         /* IO - error status     */
/*
  Define the linear scaling factor for the TABLE or BINTABLE extension
  column values. This routine overrides the scaling values given by the
  TSCALn and TZEROn keywords if present.  Note that this routine does not
  write or modify the TSCALn and TZEROn keywords, but instead only modifies
  the values temporarily in the internal buffer.  Thus, a subsequent call to
  the ffrdef routine will reset the scaling back to the TSCALn and TZEROn
  keyword values (or 1. and 0. respectively if the keywords are not present).
*/
{
    tcolumn *colptr;
    int hdutype;

    if (*status > 0)
        return(*status);

    if (scale == 0)
        return(*status = ZERO_SCALE);  /* zero scale value is illegal */

    if (ffghdt(fptr, &hdutype, status) > 0)  /* get HDU type */
        return(*status);

    if (hdutype == IMAGE_HDU)
        return(*status = NOT_TABLE);         /* not proper HDU type */

    colptr = (fptr->Fptr)->tableptr;   /* set pointer to the first column */
    colptr += (colnum - 1);     /* increment to the correct column */

    colptr->tscale = scale;
    colptr->tzero = zero;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int fftnul(fitsfile *fptr,      /* I - FITS file pointer                  */
           int colnum,          /* I - column number to apply nulvalue to */
           LONGLONG nulvalue,   /* I - null pixel value: value of TNULLn  */
           int *status)         /* IO - error status                      */
/*
  Define the value used to represent undefined pixels in the BINTABLE column.
  This only applies to integer datatype columns (TFORM = B, I, or J).
  This routine overrides the null pixel value given by the TNULLn keyword
  if present.  Note that this routine does not write or modify the TNULLn
  keyword, but instead only modifies the value temporarily in the internal
  buffer. Thus, a subsequent call to the ffrdef routine will reset the null
  value back to the TNULLn  keyword value (or not defined if the keyword is not
  present).
*/
{
    tcolumn *colptr;
    int hdutype;

    if (*status > 0)
        return(*status);

    if (ffghdt(fptr, &hdutype, status) > 0)  /* get HDU type */
        return(*status);

    if (hdutype != BINARY_TBL)
        return(*status = NOT_BTABLE);        /* not proper HDU type */
 
    colptr = (fptr->Fptr)->tableptr;   /* set pointer to the first column */
    colptr += (colnum - 1);    /* increment to the correct column */

    colptr->tnull = nulvalue;

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffsnul(fitsfile *fptr,      /* I - FITS file pointer                  */
           int colnum,          /* I - column number to apply nulvalue to */
           char *nulstring,     /* I - null pixel value: value of TNULLn  */
           int *status)         /* IO - error status                      */
/*
  Define the string used to represent undefined pixels in the ASCII TABLE
  column. This routine overrides the null  value given by the TNULLn keyword
  if present.  Note that this routine does not write or modify the TNULLn
  keyword, but instead only modifies the value temporarily in the internal
  buffer. Thus, a subsequent call to the ffrdef routine will reset the null
  value back to the TNULLn keyword value (or not defined if the keyword is not
  present).
*/
{
    tcolumn *colptr;
    int hdutype;

    if (*status > 0)
        return(*status);

    if (ffghdt(fptr, &hdutype, status) > 0)  /* get HDU type */
        return(*status);

    if (hdutype != ASCII_TBL)
        return(*status = NOT_ATABLE);        /* not proper HDU type */
 
    colptr = (fptr->Fptr)->tableptr;   /* set pointer to the first column */
    colptr += (colnum - 1);    /* increment to the correct column */

    colptr->strnull[0] = '\0';
    strncat(colptr->strnull, nulstring, 19);  /* limit string to 19 chars */

    return(*status);
}
cfitsio-3.47/simplerng.c0000644000225700000360000003314513464573432014562 0ustar  cagordonlhea/* 
   Simple Random Number Generators
       - getuniform - uniform deviate [0,1]
       - getnorm    - gaussian (normal) deviate (mean=0, stddev=1)
       - getpoisson - poisson deviate for given expected mean lambda

   This code is adapted from SimpleRNG by John D Cook, which is
   provided in the public domain.

   The original C++ code is found here:
   http://www.johndcook.com/cpp_random_number_generation.html

   This code has been modified in the following ways compared to the
   original.
     1. convert to C from C++
     2. keep only uniform, gaussian and poisson deviates
     3. state variables are module static instead of class variables
     4. provide an srand() equivalent to initialize the state
*/
#include 
#include 

#define PI 3.1415926535897932384626433832795

/* Use the standard system rand() library routine if it provides
   enough bits of information, since it probably has better randomness
   than the toy algorithm in this module. */
#if defined(RAND_MAX) && RAND_MAX > 1000000000
#define USE_SYSTEM_RAND
#endif

int simplerng_poisson_small(double lambda);
int simplerng_poisson_large(double lambda);
double simplerng_getuniform_pr(unsigned int *u, unsigned int *v);
unsigned int simplerng_getuint_pr(unsigned int *u, unsigned int *v);
double simplerng_logfactorial(int n);

/*
  These values are not magical, just the default values Marsaglia used.
  Any unit should work.
*/
static unsigned int m_u = 521288629, m_v = 362436069;

/* Set u and v state variables */
void simplerng_setstate(unsigned int u, unsigned int v)
{
    m_u = u;
    m_v = v;
}

/* Retrieve u and v state variables */
void simplerng_getstate(unsigned int *u, unsigned int *v)
{
    *u = m_u;
    *v = m_v;
}

/* srand() equivalent to seed the two state variables */
void simplerng_srand(unsigned int seed)
{
#ifdef USE_SYSTEM_RAND
  srand(seed);
#else
  simplerng_setstate(seed ^ 521288629, seed ^ 362436069);
#endif
}

/* Private routine to get uniform deviate */
double simplerng_getuniform_pr(unsigned int *u, unsigned int *v)
{
  /* 0 <= u <= 2^32 */
  unsigned int z = simplerng_getuint_pr(u, v);
  /* The magic number is 1/(2^32) and so result is positive and less than 1. */
  return z*2.328306435996595e-10;
}

/* Private routine to get unsigned integer */
/* Marsaglia multiply-with-carry algorithm (MWC) */
unsigned int simplerng_getuint_pr(unsigned int *u, unsigned int *v)
{
  *v = 36969*((*v) & 65535) + ((*v) >> 16);
  *u = 18000*((*u) & 65535) + ((*u) >> 16);
  return ((*v) << 16) + (*u);
}

/* Get uniform deviate [0,1] */
double simplerng_getuniform(void)
{
#ifdef USE_SYSTEM_RAND
  return rand()*(1.0 / ((double)RAND_MAX + 1));
#else
  return simplerng_getuniform_pr(&m_u, &m_v);
#endif
}

/* Get unsigned integer [0, UINT_MAX] */
unsigned int simplerng_getuint()
{
  /* WARNING: no option for calling rand() here.  Will need to provide
     a scalar to make the uint in the [0,UINT_MAX] range */
  return simplerng_getuint_pr(&m_u, &m_v);
}
    
/* Get normal (Gaussian) random sample with mean=0, stddev=1 */
double simplerng_getnorm()
{
  double u1, u2, r, theta;
  static int saved = 0;
  static double y;

  /* Since you get two deviates for "free" with each calculation, save
     one of them for later */

  if (saved == 0) {
    /* Use Box-Muller algorithm */
    u1 = simplerng_getuniform();
    u2 = simplerng_getuniform();
    r = sqrt( -2.0*log(u1) );
    theta = 2.0*PI*u2;
    /* save second value for next call */
    y = r*cos(theta);
    saved = 1;
    return r*sin(theta);

  } else {
    /* We already saved a value from the last call so use it */
    saved = 0;
    return y;
  }
}

/* Poisson deviate for expected mean value lambda.
   lambda should be in the range [0, infinity]
   
   For small lambda, a simple rejection method is used
   For large lambda, an approximation is used
*/
int simplerng_getpoisson(double lambda)
{
  if (lambda < 0) lambda = 0;
  return ((lambda < 15.0) 
	  ? simplerng_poisson_small(lambda) 
	  : simplerng_poisson_large(lambda));
}

int simplerng_poisson_small(double lambda)
{
  /* Algorithm due to Donald Knuth, 1969. */
  double p = 1.0, L = exp(-lambda);
  int k = 0;
  do {
    k++;
    p *= simplerng_getuniform();
  }
  while (p > L);
  return k - 1;
}

int simplerng_poisson_large(double lambda)
{
  /* "Rejection method PA" from "The Computer Generation of Poisson Random Variables" by A. C. Atkinson
     Journal of the Royal Statistical Society Series C (Applied Statistics) Vol. 28, No. 1. (1979)
     The article is on pages 29-35. The algorithm given here is on page 32. */
  static double beta, alpha, k;
  static double old_lambda = -999999.;

  if (lambda != old_lambda) {
    double c = 0.767 - 3.36/lambda;
    beta = PI/sqrt(3.0*lambda);
    alpha = beta*lambda;
    k = log(c) - lambda - log(beta);
    old_lambda = lambda;
  }

  for(;;) { /* forever */
    double u, x, v, y, temp, lhs, rhs;
    int n;

    u = simplerng_getuniform();
    x = (alpha - log((1.0 - u)/u))/beta;
    n = (int) floor(x + 0.5);
    if (n < 0) continue;

    v = simplerng_getuniform();
    y = alpha - beta*x;
    temp = 1.0 + exp(y);
    lhs = y + log(v/(temp*temp));
    rhs = k + n*log(lambda) - simplerng_logfactorial(n);
    if (lhs <= rhs) return n;
  }

}

/* Lookup table for log-gamma function */
static double lf[] = {
            0.000000000000000,
            0.000000000000000,
            0.693147180559945,
            1.791759469228055,
            3.178053830347946,
            4.787491742782046,
            6.579251212010101,
            8.525161361065415,
            10.604602902745251,
            12.801827480081469,
            15.104412573075516,
            17.502307845873887,
            19.987214495661885,
            22.552163853123421,
            25.191221182738683,
            27.899271383840894,
            30.671860106080675,
            33.505073450136891,
            36.395445208033053,
            39.339884187199495,
            42.335616460753485,
            45.380138898476908,
            48.471181351835227,
            51.606675567764377,
            54.784729398112319,
            58.003605222980518,
            61.261701761002001,
            64.557538627006323,
            67.889743137181526,
            71.257038967168000,
            74.658236348830158,
            78.092223553315307,
            81.557959456115029,
            85.054467017581516,
            88.580827542197682,
            92.136175603687079,
            95.719694542143202,
            99.330612454787428,
            102.968198614513810,
            106.631760260643450,
            110.320639714757390,
            114.034211781461690,
            117.771881399745060,
            121.533081515438640,
            125.317271149356880,
            129.123933639127240,
            132.952575035616290,
            136.802722637326350,
            140.673923648234250,
            144.565743946344900,
            148.477766951773020,
            152.409592584497350,
            156.360836303078800,
            160.331128216630930,
            164.320112263195170,
            168.327445448427650,
            172.352797139162820,
            176.395848406997370,
            180.456291417543780,
            184.533828861449510,
            188.628173423671600,
            192.739047287844900,
            196.866181672889980,
            201.009316399281570,
            205.168199482641200,
            209.342586752536820,
            213.532241494563270,
            217.736934113954250,
            221.956441819130360,
            226.190548323727570,
            230.439043565776930,
            234.701723442818260,
            238.978389561834350,
            243.268849002982730,
            247.572914096186910,
            251.890402209723190,
            256.221135550009480,
            260.564940971863220,
            264.921649798552780,
            269.291097651019810,
            273.673124285693690,
            278.067573440366120,
            282.474292687630400,
            286.893133295426990,
            291.323950094270290,
            295.766601350760600,
            300.220948647014100,
            304.686856765668720,
            309.164193580146900,
            313.652829949878990,
            318.152639620209300,
            322.663499126726210,
            327.185287703775200,
            331.717887196928470,
            336.261181979198450,
            340.815058870798960,
            345.379407062266860,
            349.954118040770250,
            354.539085519440790,
            359.134205369575340,
            363.739375555563470,
            368.354496072404690,
            372.979468885689020,
            377.614197873918670,
            382.258588773060010,
            386.912549123217560,
            391.575988217329610,
            396.248817051791490,
            400.930948278915760,
            405.622296161144900,
            410.322776526937280,
            415.032306728249580,
            419.750805599544780,
            424.478193418257090,
            429.214391866651570,
            433.959323995014870,
            438.712914186121170,
            443.475088120918940,
            448.245772745384610,
            453.024896238496130,
            457.812387981278110,
            462.608178526874890,
            467.412199571608080,
            472.224383926980520,
            477.044665492585580,
            481.872979229887900,
            486.709261136839360,
            491.553448223298010,
            496.405478487217580,
            501.265290891579240,
            506.132825342034830,
            511.008022665236070,
            515.890824587822520,
            520.781173716044240,
            525.679013515995050,
            530.584288294433580,
            535.496943180169520,
            540.416924105997740,
            545.344177791154950,
            550.278651724285620,
            555.220294146894960,
            560.169054037273100,
            565.124881094874350,
            570.087725725134190,
            575.057539024710200,
            580.034272767130800,
            585.017879388839220,
            590.008311975617860,
            595.005524249382010,
            600.009470555327430,
            605.020105849423770,
            610.037385686238740,
            615.061266207084940,
            620.091704128477430,
            625.128656730891070,
            630.172081847810200,
            635.221937855059760,
            640.278183660408100,
            645.340778693435030,
            650.409682895655240,
            655.484856710889060,
            660.566261075873510,
            665.653857411105950,
            670.747607611912710,
            675.847474039736880,
            680.953419513637530,
            686.065407301994010,
            691.183401114410800,
            696.307365093814040,
            701.437263808737160,
            706.573062245787470,
            711.714725802289990,
            716.862220279103440,
            722.015511873601330,
            727.174567172815840,
            732.339353146739310,
            737.509837141777440,
            742.685986874351220,
            747.867770424643370,
            753.055156230484160,
            758.248113081374300,
            763.446610112640200,
            768.650616799717000,
            773.860102952558460,
            779.075038710167410,
            784.295394535245690,
            789.521141208958970,
            794.752249825813460,
            799.988691788643450,
            805.230438803703120,
            810.477462875863580,
            815.729736303910160,
            820.987231675937890,
            826.249921864842800,
            831.517780023906310,
            836.790779582469900,
            842.068894241700490,
            847.352097970438420,
            852.640365001133090,
            857.933669825857460,
            863.231987192405430,
            868.535292100464630,
            873.843559797865740,
            879.156765776907600,
            884.474885770751830,
            889.797895749890240,
            895.125771918679900,
            900.458490711945270,
            905.796028791646340,
            911.138363043611210,
            916.485470574328820,
            921.837328707804890,
            927.193914982476710,
            932.555207148186240,
            937.921183163208070,
            943.291821191335660,
            948.667099599019820,
            954.046996952560450,
            959.431492015349480,
            964.820563745165940,
            970.214191291518320,
            975.612353993036210,
            981.015031374908400,
            986.422203146368590,
            991.833849198223450,
            997.249949600427840,
            1002.670484599700300,
            1008.095434617181700,
            1013.524780246136200,
            1018.958502249690200,
            1024.396581558613400,
            1029.838999269135500,
            1035.285736640801600,
            1040.736775094367400,
            1046.192096209724900,
            1051.651681723869200,
            1057.115513528895000,
            1062.583573670030100,
            1068.055844343701400,
            1073.532307895632800,
            1079.012946818975000,
            1084.497743752465600,
            1089.986681478622400,
            1095.479742921962700,
            1100.976911147256000,
            1106.478169357800900,
            1111.983500893733000,
            1117.492889230361000,
            1123.006317976526100,
            1128.523770872990800,
            1134.045231790853000,
            1139.570684729984800,
            1145.100113817496100,
            1150.633503306223700,
            1156.170837573242400,
};

double simplerng_logfactorial(int n)
{
  if (n < 0) return 0;
  if (n > 254) {
    double x = n + 1;
    return (x - 0.5)*log(x) - x + 0.5*log(2*PI) + 1.0/(12.0*x);
  }
  return lf[n];
}
cfitsio-3.47/simplerng.h0000644000225700000360000000206613464573432014565 0ustar  cagordonlhea/* 
   Simple Random Number Generators
       - getuniform - uniform deviate [0,1]
       - getnorm    - gaussian (normal) deviate (mean=0, stddev=1)
       - getpoisson - poisson deviate for given expected mean lambda

   This code is adapted from SimpleRNG by John D Cook, which is
   provided in the public domain.

   The original C++ code is found here:
   http://www.johndcook.com/cpp_random_number_generation.html

   This code has been modified in the following ways compared to the
   original.
     1. convert to C from C++
     2. keep only uniform, gaussian and poisson deviates
     3. state variables are module static instead of class variables
     4. provide an srand() equivalent to initialize the state
*/

extern void simplerng_setstate(unsigned int u, unsigned int v);
extern void simplerng_getstate(unsigned int *u, unsigned int *v);
extern void simplerng_srand(unsigned int seed);
extern double simplerng_getuniform(void);
extern double simplerng_getnorm(void);
extern int simplerng_getpoisson(double lambda);
extern double simplerng_logfactorial(int n);
cfitsio-3.47/smem.c0000644000225700000360000000500413464573432013514 0ustar  cagordonlhea#include 
#include 
#include 
#ifdef __APPLE__
#include 
#else
#include 
#endif
#include "fitsio.h"     /* needed to define LONGLONG */
#include "drvrsmem.h"   /* uses LONGLONG */

int	main(int argc, char **argv)
{ int cmdok, listmode, longlistmode, recovermode, deletemode, id;
int status;
char *address;

listmode = longlistmode = recovermode = deletemode = 0;
id = -1;
cmdok = 1;

switch (argc)
 { case 1:	listmode = 1;
		break;
   case 2:
		if (0 == strcmp("-l", argv[1])) longlistmode = 1;
		else if (0 == strcmp("-r", argv[1])) recovermode = 1;
		else if (0 == strcmp("-d", argv[1])) deletemode = 1;
		else cmdok = 0;
		break;
   case 3:
		if (0 == strcmp("-r", argv[1])) recovermode = 1;
		else if (0 == strcmp("-d", argv[1])) deletemode = 1;
		else
		 { cmdok = 0;		/* signal invalid cmd line syntax */
		   break;
		 }
		if (1 != sscanf(argv[2], "%d", &id)) cmdok = 0;
		break;
   default:
		cmdok = 0;
		break;
 }

if (0 == cmdok)
  { printf("usage :\n\n");
    printf("smem            - list all shared memory segments\n");
    printf("\t!\tcouldn't obtain RDONLY lock - info unreliable\n");
    printf("\tIdx\thandle of shared memory segment (visible by application)\n");
    printf("\tKey\tcurrent system key of shared memory segment. Key\n");
    printf("\t\tchanges whenever shmem segment is reallocated. Use\n");
    printf("\t\tipcs (or ipcs -a) to view all shmem segments\n");
    printf("\tNproc\tnumber of processes attached to segment\n");
    printf("\tSize\tsize of shmem segment in bytes\n");
    printf("\tFlags\tRESIZABLE - realloc allowed, PERSIST - segment is not\n");
    printf("\t\tdeleted after shared_free called by last process attached\n");
    printf("\t\tto it.\n");
    printf("smem -d         - delete all shared memory segments (may block)\n");
    printf("smem -d id      - delete specific shared memory segment (may block)\n");
    printf("smem -r         - unconditionally reset all shared memory segments\n\t\t(does not block, recovers zombie handles left by kill -9)\n");
    printf("smem -r id      - unconditionally reset specific shared memory segment\n");
  }

if (shared_init(0))
  { printf("couldn't initialize shared memory, aborting ...\n");
    return(10);
  }

if (listmode) shared_list(id);
else if (recovermode) shared_recover(id);
else if (deletemode) shared_uncond_delete(id);

for (id = 0; id <16; id++) {
  status = shared_getaddr(id, &address);
  if (!status)printf("id, status, address %d %d %ld %.30s\n", id, status, address, address);
}
return(0);
}
cfitsio-3.47/speed.c0000644000225700000360000003614313464573432013663 0ustar  cagordonlhea#include 
#include 
#include 
#include 
#include 

/*
  Every program which uses the CFITSIO interface must include the
  the fitsio.h header file.  This contains the prototypes for all
  the routines and defines the error status values and other symbolic
  constants used in the interface.  
*/
#include "fitsio.h"

#define minvalue(A,B) ((A) < (B) ? (A) : (B))

/* size of the image */
#define XSIZE 3000
#define YSIZE 3000

/* size of data buffer */
#define SHTSIZE 20000
static long sarray[ SHTSIZE ] = {SHTSIZE * 0};

/* no. of rows in binary table */
#define BROWS 2500000

/* no. of rows in ASCII table */
#define AROWS 400000

/*  CLOCKS_PER_SEC should be defined by most compilers */
#if defined(CLOCKS_PER_SEC)
#define CLOCKTICKS CLOCKS_PER_SEC
#else
/* on SUN OS machine, CLOCKS_PER_SEC is not defined, so set its value */
#define CLOCKTICKS 1000000
#define difftime(A,B) ((double) A - (double) B)
#endif

/* define variables for measuring elapsed time */
clock_t scpu, ecpu;
time_t start, finish;
long startsec;   /* start of elapsed time interval */
int startmilli;  /* start of elapsed time interval */

int writeimage(fitsfile *fptr, int *status);
int writebintable(fitsfile *fptr, int *status);
int writeasctable(fitsfile *fptr, int *status);
int readimage(fitsfile *fptr, int *status);
int readatable(fitsfile *fptr, int *status);
int readbtable(fitsfile *fptr, int *status);
void printerror( int status);
int marktime(int *status);
int gettime(double *elapse, float *elapscpu, int *status);
int main(void);

int main()
{
/*************************************************************************
    This program tests the speed of writing/reading FITS files with cfitsio
**************************************************************************/

    FILE *diskfile;
    fitsfile *fptr;        /* pointer to the FITS file, defined in fitsio.h */
    int status, ii;
    long rawloop;
    char filename[] = "speedcc.fit";           /* name for new FITS file */
    char buffer[2880] = {2880 * 0};
    time_t tbegin, tend;
    float rate, size, elapcpu, cpufrac;
    double elapse;

    tbegin = time(0);

    remove(filename);               /* Delete old file if it already exists */

    diskfile =  fopen(filename,"w+b");
    rawloop = XSIZE * YSIZE / 720;

    printf("                                                ");
    printf(" SIZE / ELAPSE(%%CPU) = RATE\n");
    printf("RAW fwrite (2880 bytes/loop)...                 ");
    marktime(&status);

    for (ii = 0; ii < rawloop; ii++)
      if (fwrite(buffer, 1, 2880, diskfile) != 2880)
        printf("write error \n");

    gettime(&elapse, &elapcpu, &status);

    cpufrac = elapcpu / elapse * 100.;
    size = 2880. * rawloop / 1000000.;
    rate = size / elapse;
    printf(" %4.1fMB/%6.3fs(%3.0f) = %5.2fMB/s\n", size, elapse, cpufrac,rate);

    /* read back the binary records */
    fseek(diskfile, 0, 0);

    printf("RAW fread  (2880 bytes/loop)...                 ");
    marktime(&status);

    for (ii = 0; ii < rawloop; ii++)
      if (fread(buffer, 1, 2880, diskfile) != 2880)
        printf("read error \n");

    gettime(&elapse, &elapcpu, &status);

    cpufrac = elapcpu / elapse * 100.;
    size = 2880. * rawloop / 1000000.;
    rate = size / elapse;
    printf(" %4.1fMB/%6.3fs(%3.0f) = %5.2fMB/s\n", size, elapse, cpufrac,rate);

    fclose(diskfile);
    remove(filename);

    status = 0;     
    fptr = 0;

    if (fits_create_file(&fptr, filename, &status)) /* create new FITS file */
       printerror( status);          
   
    if (writeimage(fptr, &status))
       printerror( status);     

    if (writebintable(fptr, &status))
       printerror( status);     

    if (writeasctable(fptr, &status))
       printerror( status);     

    if (readimage(fptr, &status))
       printerror( status);     

    if (readbtable(fptr, &status))
       printerror( status);     

    if (readatable(fptr, &status))
       printerror( status);     

    if (fits_close_file(fptr, &status))     
         printerror( status );

    tend = time(0);
    elapse = difftime(tend, tbegin) + 0.5;
    printf("Total elapsed time = %.3fs, status = %d\n",elapse, status);
    return(0);
}
/*--------------------------------------------------------------------------*/
int writeimage(fitsfile *fptr, int *status)

    /**************************************************/
    /* write the primary array containing a 2-D image */
    /**************************************************/
{
    long  nremain, ii;
    float rate, size, elapcpu, cpufrac;
    double elapse;

    /* initialize FITS image parameters */
    int bitpix   =  32;   /* 32-bit  signed integer pixel values       */
    long naxis    =   2;  /* 2-dimensional image                            */    
    long naxes[2] = {XSIZE, YSIZE }; /* image size */

    /* write the required keywords for the primary array image */
    if ( fits_create_img(fptr, bitpix, naxis, naxes, status) )
         printerror( *status );          

    printf("\nWrite %dx%d I*4 image, %d pixels/loop:   ",XSIZE,YSIZE,SHTSIZE);
    marktime(status);

    nremain = XSIZE * YSIZE;
    for (ii = 1; ii <= nremain; ii += SHTSIZE)
    {
      ffpprj(fptr, 0, ii, SHTSIZE, sarray, status);
    }

    ffflus(fptr, status);  /* flush all buffers to disk */

    gettime(&elapse, &elapcpu, status);

    cpufrac = elapcpu / elapse * 100.;
    size = XSIZE * 4. * YSIZE / 1000000.;
    rate = size / elapse;
    printf(" %4.1fMB/%6.3fs(%3.0f) = %5.2fMB/s\n", size, elapse, cpufrac,rate);

    return( *status );
}
/*--------------------------------------------------------------------------*/
int writebintable (fitsfile *fptr, int *status)

    /*********************************************************/
    /* Create a binary table extension containing 3 columns  */
    /*********************************************************/
{
    int tfields = 2;
    long nremain, ntodo, firstrow = 1, firstelem = 1, nrows;
    float rate, size, elapcpu, cpufrac;
    double elapse;

    char extname[] = "Speed_Test";           /* extension name */

    /* define the name, datatype, and physical units for the columns */
    char *ttype[] = { "first", "second" };
    char *tform[] = {"1J",       "1J"   };
    char *tunit[] = { " ",       " "    };

    /* append a new empty binary table onto the FITS file */

    if ( fits_create_tbl( fptr, BINARY_TBL, BROWS, tfields, ttype, tform,
                tunit, extname, status) )
         printerror( *status );

    /* get table row size and optimum number of rows to write per loop */
    fits_get_rowsize(fptr, &nrows, status);
    nrows = minvalue(nrows, SHTSIZE);
    nremain = BROWS;

    printf("Write %7drow x %dcol bintable %4ld rows/loop:", BROWS, tfields,
       nrows);
    marktime(status);

    while(nremain)
    {
      ntodo = minvalue(nrows, nremain);
      ffpclj(fptr, 1, firstrow, firstelem, ntodo, sarray, status);
      ffpclj(fptr, 2, firstrow, firstelem, ntodo, sarray, status);
      firstrow += ntodo;
      nremain -= ntodo;
    }

    ffflus(fptr, status);  /* flush all buffers to disk */

    gettime(&elapse, &elapcpu, status);

    cpufrac = elapcpu / elapse * 100.;
    size = BROWS * 8. / 1000000.;
    rate = size / elapse;
    printf(" %4.1fMB/%6.3fs(%3.0f) = %5.2fMB/s\n", size, elapse, cpufrac,rate);

    return( *status );
}
/*--------------------------------------------------------------------------*/
int writeasctable (fitsfile *fptr, int *status)

    /*********************************************************/
    /* Create an ASCII table extension containing 2 columns  */
    /*********************************************************/
{
    int tfields = 2;
    long nremain, ntodo, firstrow = 1, firstelem = 1;
    long nrows;
    float rate, size, elapcpu, cpufrac;
    double elapse;

    char extname[] = "Speed_Test";           /* extension name */

    /* define the name, datatype, and physical units for the columns */
    char *ttype[] = { "first", "second" };
    char *tform[] = {"I6",       "I6"   };
    char *tunit[] = { " ",      " "     };

    /* append a new empty ASCII table onto the FITS file */
    if ( fits_create_tbl( fptr, ASCII_TBL, AROWS, tfields, ttype, tform,
                tunit, extname, status) )
         printerror( *status );

    /* get table row size and optimum number of rows to write per loop */
    fits_get_rowsize(fptr, &nrows, status);
    nrows = minvalue(nrows, SHTSIZE);
    nremain = AROWS;

    printf("Write %7drow x %dcol asctable %4ld rows/loop:", AROWS, tfields,
           nrows);
    marktime(status);

    while(nremain)
    {
      ntodo = minvalue(nrows, nremain);
      ffpclj(fptr, 1, firstrow, firstelem, ntodo, sarray, status);
      ffpclj(fptr, 2, firstrow, firstelem, ntodo, sarray, status);
      firstrow += ntodo;
      nremain -= ntodo;
    }

    ffflus(fptr, status);  /* flush all buffers to disk */

    gettime(&elapse, &elapcpu, status);

    cpufrac = elapcpu / elapse * 100.;
    size = AROWS * 13. / 1000000.;
    rate = size / elapse;
    printf(" %4.1fMB/%6.3fs(%3.0f) = %5.2fMB/s\n", size, elapse, cpufrac,rate);

    return( *status );
}
/*--------------------------------------------------------------------------*/
int readimage( fitsfile *fptr, int *status )

    /*********************/
    /* Read a FITS image */
    /*********************/
{
    int anynull, hdutype;
    long nremain, ii;
    long longnull = 0;
    float rate, size, elapcpu, cpufrac;
    double elapse;

    /* move to the primary array */
    if ( fits_movabs_hdu(fptr, 1, &hdutype, status) ) 
         printerror( *status );

    printf("\nRead back image                                 ");
    marktime(status);

    nremain = XSIZE * YSIZE;
    for (ii=1; ii <= nremain; ii += SHTSIZE)
    {
      ffgpvj(fptr, 0, ii, SHTSIZE, longnull, sarray, &anynull, status);
    }

    gettime(&elapse, &elapcpu, status);

    cpufrac = elapcpu / elapse * 100.;
    size = XSIZE * 4. * YSIZE / 1000000.;
    rate = size / elapse;
    printf(" %4.1fMB/%6.3fs(%3.0f) = %5.2fMB/s\n", size, elapse, cpufrac,rate);

    return( *status );
}
/*--------------------------------------------------------------------------*/
int readbtable( fitsfile *fptr, int *status )

    /************************************************************/
    /* read and print data values from the binary table */
    /************************************************************/
{
    int hdutype, anynull;
    long nremain, ntodo, firstrow = 1, firstelem = 1;
    long nrows;
    long lnull = 0;
    float rate, size, elapcpu, cpufrac;
    double elapse;

    /* move to the table */
    if ( fits_movrel_hdu(fptr, 1, &hdutype, status) ) 
           printerror( *status );

    /* get table row size and optimum number of rows to read per loop */
    fits_get_rowsize(fptr, &nrows, status);
    nrows = minvalue(nrows, SHTSIZE);
    
    /*  read the columns */  
    nremain = BROWS;

    printf("Read back BINTABLE                              ");
    marktime(status);

    while(nremain)
    {
      ntodo = minvalue(nrows, nremain);
      ffgcvj(fptr, 1, firstrow, firstelem, ntodo,
                     lnull, sarray, &anynull, status);
      ffgcvj(fptr, 2, firstrow, firstelem, ntodo,
                     lnull, sarray, &anynull, status);
      firstrow += ntodo; 
      nremain  -= ntodo;
    }

    gettime(&elapse, &elapcpu, status);

    cpufrac = elapcpu / elapse * 100.;
    size = BROWS * 8. / 1000000.;
    rate = size / elapse;
    printf(" %4.1fMB/%6.3fs(%3.0f) = %5.2fMB/s\n", size, elapse, cpufrac,rate);

    return( *status );
}
/*--------------------------------------------------------------------------*/
int readatable( fitsfile *fptr, int *status )

    /************************************************************/
    /* read and print data values from an ASCII or binary table */
    /************************************************************/
{
    int hdutype, anynull;
    long nremain, ntodo, firstrow = 1, firstelem = 1;
    long nrows;
    long lnull = 0;
    float rate, size, elapcpu, cpufrac;
    double elapse;

    /* move to the table */
    if ( fits_movrel_hdu(fptr, 1, &hdutype, status) ) 
           printerror( *status );

    /* get table row size and optimum number of rows to read per loop */
    fits_get_rowsize(fptr, &nrows, status);
    nrows = minvalue(nrows, SHTSIZE);
 
    /*  read the columns */  
    nremain = AROWS;

    printf("Read back ASCII Table                           ");
    marktime(status);

    while(nremain)
    {
      ntodo = minvalue(nrows, nremain);
      ffgcvj(fptr, 1, firstrow, firstelem, ntodo,
                     lnull, sarray, &anynull, status);
      ffgcvj(fptr, 2, firstrow, firstelem, ntodo,
                     lnull, sarray, &anynull, status);
      firstrow += ntodo;
      nremain  -= ntodo;
    }

    gettime(&elapse, &elapcpu, status);

    cpufrac = elapcpu / elapse * 100.;
    size = AROWS * 13. / 1000000.;
    rate = size / elapse;
    printf(" %4.1fMB/%6.3fs(%3.0f) = %5.2fMB/s\n", size, elapse, cpufrac,rate);

    return( *status );
}
/*--------------------------------------------------------------------------*/
void printerror( int status)
{
    /*****************************************************/
    /* Print out cfitsio error messages and exit program */
    /*****************************************************/

    char status_str[FLEN_STATUS], errmsg[FLEN_ERRMSG];
  
    if (status)
      fprintf(stderr, "\n*** Error occurred during program execution ***\n");

    fits_get_errstatus(status, status_str);   /* get the error description */
    fprintf(stderr, "\nstatus = %d: %s\n", status, status_str);

    /* get first message; null if stack is empty */
    if ( fits_read_errmsg(errmsg) ) 
    {
         fprintf(stderr, "\nError message stack:\n");
         fprintf(stderr, " %s\n", errmsg);

         while ( fits_read_errmsg(errmsg) )  /* get remaining messages */
             fprintf(stderr, " %s\n", errmsg);
    }

    exit( status );       /* terminate the program, returning error status */
}
/*--------------------------------------------------------------------------*/
int marktime( int *status)
{
    double telapse;
    time_t temp;
    struct  timeval tv;

    temp = time(0);

    /* Since elapsed time is only measured to the nearest second */
    /* keep getting the time until the seconds tick just changes. */
    /* This provides more consistent timing measurements since the */
    /* intervals all start on an integer seconds. */

    telapse = 0.;

        scpu = clock();
        start = time(0);
/*
    while (telapse == 0.)
    {
        scpu = clock();
        start = time(0);
        telapse = difftime( start, temp );
    }
*/
        gettimeofday (&tv, NULL);

	startsec = tv.tv_sec;
        startmilli = tv.tv_usec/1000;

    return( *status );
}
/*--------------------------------------------------------------------------*/
int gettime(double *elapse, float *elapscpu, int *status)
{
        struct  timeval tv;
	int stopmilli;
	long stopsec;


        gettimeofday (&tv, NULL);
    ecpu = clock();
    finish = time(0);

        stopmilli = tv.tv_usec/1000;
	stopsec = tv.tv_sec;
	

	*elapse = (stopsec - startsec) + (stopmilli - startmilli)/1000.;

/*    *elapse = difftime(finish, start) + 0.5; */
    *elapscpu = (ecpu - scpu) * 1.0 / CLOCKTICKS;

    return( *status );
}
cfitsio-3.47/swapproc.c0000644000225700000360000001702713464573432014421 0ustar  cagordonlhea/*  This file, swapproc.c, contains general utility routines that are      */
/*  used by other FITSIO routines to swap bytes.                           */

/*  The FITSIO software was written by William Pence at the High Energy    */
/*  Astrophysic Science Archive Research Center (HEASARC) at the NASA      */
/*  Goddard Space Flight Center.                                           */

/* The fast SSE2 and SSSE3 functions were provided by Julian Taylor, ESO */

#include 
#include 
#include "fitsio2.h"

/* bswap builtin is available since GCC 4.3 */
#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 3)
#define HAVE_BSWAP
#endif

#ifdef __SSSE3__
#include 
/* swap 16 bytes according to mask, values must be 16 byte aligned */
static inline void swap_ssse3(char * values, __m128i mask)
{
    __m128i v = _mm_load_si128((__m128i *)values);
    __m128i s = _mm_shuffle_epi8(v, mask);
    _mm_store_si128((__m128i*)values, s);
}
#endif
#ifdef __SSE2__
#include 
/* swap 8 shorts, values must be 16 byte aligned
 * faster than ssse3 variant for shorts */
static inline void swap2_sse2(char * values)
{
    __m128i r1 = _mm_load_si128((__m128i *)values);
    __m128i r2 = r1;
    r1 = _mm_srli_epi16(r1, 8);
    r2 = _mm_slli_epi16(r2, 8);
    r1 = _mm_or_si128(r1, r2);
    _mm_store_si128((__m128i*)values, r1);
}
/* the three shuffles required for 4 and 8 byte variants make
 * SSE2 slower than bswap */


/* get number of elements to peel to reach alignment */
static inline size_t get_peel(void * addr, size_t esize, size_t nvals,
                              size_t alignment)
{
    const size_t offset = (size_t)addr % alignment;
    size_t peel = offset ? (alignment - offset) / esize : 0;
    peel = nvals < peel ? nvals : peel;
    return peel;
}
#endif

/*--------------------------------------------------------------------------*/
static void ffswap2_slow(short *svalues, long nvals)
{
    register long ii;
    unsigned short * usvalues;

    usvalues = (unsigned short *) svalues;

    for (ii = 0; ii < nvals; ii++)
    {
        usvalues[ii] = (usvalues[ii]>>8) | (usvalues[ii]<<8);
    }
}
/*--------------------------------------------------------------------------*/
#if __SSE2__
void ffswap2(short *svalues,  /* IO - pointer to shorts to be swapped    */
             long nvals)     /* I  - number of shorts to be swapped     */
/*
  swap the bytes in the input short integers: ( 0 1 -> 1 0 )
*/
{
    if ((long)svalues % 2 != 0) { /* should not happen */
        ffswap2_slow(svalues, nvals);
        return;
    }

    long ii;
    size_t peel = get_peel((void*)&svalues[0], sizeof(svalues[0]), nvals, 16);

    ffswap2_slow(svalues, peel);
    for (ii = peel; ii < (nvals - peel - (nvals - peel) % 8); ii+=8) {
        swap2_sse2((char*)&svalues[ii]);
    }
    ffswap2_slow(&svalues[ii], nvals - ii);
}
#else
void ffswap2(short *svalues,  /* IO - pointer to shorts to be swapped    */
             long nvals)     /* I  - number of shorts to be swapped     */
/*
  swap the bytes in the input 4-byte integer: ( 0 1 2 3 -> 3 2 1 0 )
*/
{
    ffswap2_slow(svalues, nvals);
}
#endif
/*--------------------------------------------------------------------------*/
static void ffswap4_slow(INT32BIT *ivalues, long nvals)
{
    register long ii;

#if defined(HAVE_BSWAP)
    for (ii = 0; ii < nvals; ii++)
    {
        ivalues[ii] = __builtin_bswap32(ivalues[ii]);
    }
#elif defined(_MSC_VER) && (_MSC_VER >= 1400)
    /* intrinsic byte swapping function in Microsoft Visual C++ 8.0 and later */
    unsigned int* uivalues = (unsigned int *) ivalues;

    /* intrinsic byte swapping function in Microsoft Visual C++ */
    for (ii = 0; ii < nvals; ii++)
    {
        uivalues[ii] = _byteswap_ulong(uivalues[ii]);
    }
#else
    char *cvalues, tmp;

    for (ii = 0; ii < nvals; ii++)
    {
        cvalues = (char *)&ivalues[ii];
        tmp = cvalues[0];
        cvalues[0] = cvalues[3];
        cvalues[3] = tmp;
        tmp = cvalues[1];
        cvalues[1] = cvalues[2];
        cvalues[2] = tmp;
    }
#endif
}
/*--------------------------------------------------------------------------*/
#ifdef __SSSE3__
void ffswap4(INT32BIT *ivalues,  /* IO - pointer to INT*4 to be swapped    */
                 long nvals)     /* I  - number of floats to be swapped     */
/*
  swap the bytes in the input 4-byte integer: ( 0 1 2 3 -> 3 2 1 0 )
*/
{
    if ((long)ivalues % 4 != 0) { /* should not happen */
        ffswap4_slow(ivalues, nvals);
        return;
    }

    long ii;
    const __m128i cmask4 = _mm_set_epi8(12, 13, 14, 15,
                                        8, 9, 10, 11,
                                        4, 5, 6, 7,
                                        0, 1, 2 ,3);
    size_t peel = get_peel((void*)&ivalues[0], sizeof(ivalues[0]), nvals, 16);
    ffswap4_slow(ivalues, peel);
    for (ii = peel; ii < (nvals - peel - (nvals - peel) % 4); ii+=4) {
        swap_ssse3((char*)&ivalues[ii], cmask4);
    }
    ffswap4_slow(&ivalues[ii], nvals - ii);
}
#else
void ffswap4(INT32BIT *ivalues,  /* IO - pointer to INT*4 to be swapped    */
                 long nvals)     /* I  - number of floats to be swapped     */
/*
  swap the bytes in the input 4-byte integer: ( 0 1 2 3 -> 3 2 1 0 )
*/
{
    ffswap4_slow(ivalues, nvals);
}
#endif
/*--------------------------------------------------------------------------*/
static void ffswap8_slow(double *dvalues, long nvals)
{
    register long ii;
#ifdef HAVE_BSWAP
    LONGLONG * llvalues = (LONGLONG*)dvalues;

    for (ii = 0; ii < nvals; ii++) {
        llvalues[ii] = __builtin_bswap64(llvalues[ii]);
    }
#elif defined(_MSC_VER) && (_MSC_VER >= 1400)
    /* intrinsic byte swapping function in Microsoft Visual C++ 8.0 and later */
    unsigned __int64 * llvalues = (unsigned __int64 *) dvalues;

    for (ii = 0; ii < nvals; ii++)
    {
        llvalues[ii] = _byteswap_uint64(llvalues[ii]);
    }
#else
    register char *cvalues;
    register char temp;

    cvalues = (char *) dvalues;      /* copy the pointer value */

    for (ii = 0; ii < nvals*8; ii += 8)
    {
        temp = cvalues[ii];
        cvalues[ii] = cvalues[ii+7];
        cvalues[ii+7] = temp;

        temp = cvalues[ii+1];
        cvalues[ii+1] = cvalues[ii+6];
        cvalues[ii+6] = temp;

        temp = cvalues[ii+2];
        cvalues[ii+2] = cvalues[ii+5];
        cvalues[ii+5] = temp;

        temp = cvalues[ii+3];
        cvalues[ii+3] = cvalues[ii+4];
        cvalues[ii+4] = temp;
    }
#endif
}
/*--------------------------------------------------------------------------*/
#ifdef __SSSE3__
void ffswap8(double *dvalues,  /* IO - pointer to doubles to be swapped     */
             long nvals)       /* I  - number of doubles to be swapped      */
/*
  swap the bytes in the input doubles: ( 01234567  -> 76543210 )
*/
{
    if ((long)dvalues % 8 != 0) { /* should not happen on amd64 */
        ffswap8_slow(dvalues, nvals);
        return;
    }

    long ii;
    const __m128i cmask8 = _mm_set_epi8(8, 9, 10, 11, 12, 13, 14, 15,
                                        0, 1, 2 ,3, 4, 5, 6, 7);
    size_t peel = get_peel((void*)&dvalues[0], sizeof(dvalues[0]), nvals, 16);
    ffswap8_slow(dvalues, peel);
    for (ii = peel; ii < (nvals - peel - (nvals - peel) % 2); ii+=2) {
        swap_ssse3((char*)&dvalues[ii], cmask8);
    }
    ffswap8_slow(&dvalues[ii], nvals - ii);
}
#else
void ffswap8(double *dvalues,  /* IO - pointer to doubles to be swapped     */
             long nvals)       /* I  - number of doubles to be swapped      */
/*
  swap the bytes in the input doubles: ( 01234567  -> 76543210 )
*/
{
    ffswap8_slow(dvalues, nvals);
}
#endif
cfitsio-3.47/testf77.f0000644000225700000360000023441413464573432014072 0ustar  cagordonlheaC     This is a big and complicated program that tests most of
C     the fitsio routines.  This code does not represent
C     the most efficient method of reading or writing FITS files 
C     because this code is primarily designed to stress the fitsio
C     library routines.

      character asciisum*17
      character*3 cval
      character*1 xinarray(21), binarray(21), boutarray(21), bnul
      character colname*70, tdisp*40, nulstr*40
      character oskey*15
      character iskey*21
      character lstr*200   
      character  comm*73
      character*30 inskey(21)
      character*30 onskey(3)
      character filename*40, card*78, card2*78
      character keyword*8
      character value*68, comment*72
      character uchars*78
      character*15 ttype(10), tform(10), tunit(10)
      character*15 tblname
      character*15 binname
      character errmsg*75
      character*8  inclist(2),exclist(2)
      character*8 xctype,yctype,ctype
      character*18 kunit

      logical simple,extend,larray(42), larray2(42)
      logical olkey, ilkey, onlkey(3), inlkey(3), anynull

      integer*2 imgarray(19,30), imgarray2(10,20)
      integer*2         iinarray(21), ioutarray(21), inul

      integer naxes(3), pcount, gcount, npixels, nrows, rowlen
      integer existkeys, morekeys, keynum
      integer datastatus, hdustatus
      integer status, bitpix, naxis, block
      integer ii, jj, jjj, hdutype, hdunum, tfields
      integer nkeys, nfound, colnum, typecode, signval,nmsg
      integer repeat, offset, width, jnulval
      integer kinarray(21), koutarray(21), knul
      integer jinarray(21), joutarray(21), jnul
      integer ojkey, ijkey, otint
      integer onjkey(3), injkey(3)
      integer tbcol(5)
      integer iunit, tmpunit
      integer fpixels(2), lpixels(2), inc(2)

      real estatus, vers
      real einarray(21), eoutarray(21), enul, cinarray(42)
      real ofkey, oekey, iekey, onfkey(3),onekey(3), inekey(3)

      double precision dinarray(21),doutarray(21),dnul, minarray(42)
      double precision scale, zero
      double precision ogkey, odkey, idkey, otfrac, ongkey(3)
      double precision ondkey(3), indkey(3)
      double precision checksum, datsum
      double precision xrval,yrval,xrpix,yrpix,xinc,yinc,rot
      double precision xpos,ypos,xpix,ypix

      tblname = 'Test-ASCII'
      binname = 'Test-BINTABLE'
      onskey(1) = 'first string'
      onskey(2) = 'second string'
      onskey(3) = '        '
      oskey = 'value_string'
      inclist(1)='key*'
      inclist(2)='newikys'
      exclist(1)='key_pr*'
      exclist(2)='key_pkls'
      xctype='RA---TAN'
      yctype='DEC--TAN'

      olkey = .true.
      ojkey = 11
      otint = 12345678
      ofkey = 12.121212
      oekey = 13.131313
      ogkey = 14.1414141414141414D+00
      odkey = 15.1515151515151515D+00
      otfrac = .1234567890123456D+00
      onlkey(1) = .true.
      onlkey(2) = .false.
      onlkey(3) = .true.
      onjkey(1) = 11
      onjkey(2) = 12
      onjkey(3) = 13
      onfkey(1) = 12.121212
      onfkey(2) = 13.131313
      onfkey(3) = 14.141414
      onekey(1) = 13.131313
      onekey(2) = 14.141414
      onekey(3) = 15.151515
      ongkey(1) = 14.1414141414141414D+00
      ongkey(2) = 15.1515151515151515D+00
      ongkey(3) = 16.1616161616161616D+00
      ondkey(1) = 15.1515151515151515D+00
      ondkey(2) = 16.1616161616161616D+00
      ondkey(3) = 17.1717171717171717D+00

      tbcol(1) = 1
      tbcol(2) =  17
      tbcol(3) =  28
      tbcol(4) =  43
      tbcol(5) =  56
      status = 0

      call ftvers(vers)
      write(*,'(1x,A)') 'FITSIO TESTPROG'
      write(*, '(1x,A)')' '

      iunit = 15
      tmpunit = 16

      write(*,'(1x,A)') 'Try opening then closing a nonexistent file: '
      call ftopen(iunit, 'tq123x.kjl', 1, block, status)
      write(*,'(1x,A,2i4)')'  ftopen iunit, status (expect an error) ='
     & ,iunit, status
      call ftclos(iunit, status)
      write(*,'(1x,A,i4)')'  ftclos status = ', status
      write(*,'(1x,A)')' '

      call ftcmsg
      status = 0

      filename = 'testf77.fit'

C delete previous version of the file, if it exists 

      call ftopen(iunit, filename, 1, block, status)
      if (status .eq. 0)then
         call ftdelt(iunit, status)
      else
C        clear the error message stack
         call ftcmsg
      end if

      status = 0

C
C        #####################
C        #  create FITS file #
C        #####################
      

      call ftinit(iunit, filename, 1, status)
      write(*,'(1x,A,i4)')'ftinit create new file status = ', status
      write(*,'(1x,A)')' '

      if (status .ne. 0)go to 999

      simple = .true.
      bitpix = 32
      naxis = 2
      naxes(1) = 10
      naxes(2) = 2
      npixels = 20
      pcount = 0
      gcount = 1
      extend = .true.
      
C        ############################
C        #  write single keywords   #
C        ############################
      
      call ftphpr(iunit,simple, bitpix, naxis, naxes, 
     & 0,1,extend,status)

      call ftprec(iunit, 
     &'key_prec= ''This keyword was written by fxprec'' / '//
     & 'comment goes here',  status)

      write(*,'(1x,A)') 'test writing of long string keywords: '
      card = '1234567890123456789012345678901234567890'//
     & '12345678901234567890123456789012345'
      call ftpkys(iunit, 'card1', card, ' ', status)
      call ftgkey(iunit, 'card1', card2, comment, status)

      write(*,'(1x,A)') card
      write(*,'(1x,A)') card2
      
      card = '1234567890123456789012345678901234567890'//
     &  '123456789012345678901234''6789012345'
      call ftpkys(iunit, 'card2', card, ' ', status)
      call ftgkey(iunit, 'card2', card2, comment, status)
      write(*,'(1x,A)') card
      write(*,'(1x,A)') card2
      
      card = '1234567890123456789012345678901234567890'//
     &  '123456789012345678901234''''789012345'
      call ftpkys(iunit, 'card3', card, ' ', status)
      call ftgkey(iunit, 'card3', card2, comment, status)
      write(*,'(1x,A)') card
      write(*,'(1x,A)') card2
      
      card = '1234567890123456789012345678901234567890'//
     & '123456789012345678901234567''9012345'
      call ftpkys(iunit, 'card4', card, ' ', status)
      call ftgkey(iunit, 'card4', card2, comment, status)
      write(*,'(1x,A)') card
      write(*,'(1x,A)') card2

      call ftpkys(iunit, 'key_pkys', oskey, 'fxpkys comment', status)
      call ftpkyl(iunit, 'key_pkyl', olkey, 'fxpkyl comment', status)
      call ftpkyj(iunit, 'key_pkyj', ojkey, 'fxpkyj comment', status)
      call ftpkyf(iunit,'key_pkyf',ofkey,5, 'fxpkyf comment', status)
      call ftpkye(iunit,'key_pkye',oekey,6, 'fxpkye comment', status)
      call ftpkyg(iunit,'key_pkyg',ogkey,14, 'fxpkyg comment',status)
      call ftpkyd(iunit,'key_pkyd',odkey,14, 'fxpkyd comment',status)

      lstr='This is a very long string '//
     &   'value that is continued over more than one keyword.'

      call ftpkls(iunit,'key_pkls',lstr,'fxpkls comment',status)

      call ftplsw(iunit, status)
      call ftpkyt(iunit,'key_pkyt',otint,otfrac,'fxpkyt comment',
     & status)
      call ftpcom(iunit, 'This keyword was written by fxpcom.',
     &  status)
      call ftphis(iunit, 
     &'  This keyword written by fxphis (w/ 2 leading spaces).',
     &    status)

      call ftpdat(iunit, status)
      
      if (status .gt. 0)go to 999   

C
C        ###############################
C        #  write arrays of keywords   #
C        ###############################
      
      nkeys = 3

      comm = 'fxpkns comment&'
      call ftpkns(iunit, 'ky_pkns', 1, nkeys, onskey, comm, status)
      comm = 'fxpknl comment&'
      call ftpknl(iunit, 'ky_pknl', 1, nkeys, onlkey, comm, status)

      comm = 'fxpknj comment&'
      call ftpknj(iunit, 'ky_pknj', 1, nkeys, onjkey, comm, status)

      comm = 'fxpknf comment&'
      call ftpknf(iunit, 'ky_pknf', 1, nkeys, onfkey,5,comm,status)

      comm = 'fxpkne comment&'
      call ftpkne(iunit, 'ky_pkne', 1, nkeys, onekey,6,comm,status)

      comm = 'fxpkng comment&'
      call ftpkng(iunit, 'ky_pkng', 1, nkeys, ongkey,13,comm,status)

      comm = 'fxpknd comment&'
      call ftpknd(iunit, 'ky_pknd', 1, nkeys, ondkey,14,comm,status)
      
      if (status .gt. 0)go to 999
      
C        ############################
C        #  write generic keywords  #
C        ############################
      

      oskey = '1'
      call ftpkys(iunit, 'tstring', oskey, 'tstring comment',status)

      olkey = .true.
      call ftpkyl(iunit, 'tlogical', olkey, 'tlogical comment',
     &    status)

      ojkey = 11
      call ftpkyj(iunit, 'tbyte', ojkey, 'tbyte comment', status)

      ojkey = 21
      call ftpkyj(iunit, 'tshort', ojkey, 'tshort comment', status)

      ojkey = 31
      call ftpkyj(iunit, 'tint', ojkey, 'tint comment', status)

      ojkey = 41
      call ftpkyj(iunit, 'tlong', ojkey, 'tlong comment', status)

      oekey = 42
      call ftpkye(iunit, 'tfloat', oekey, 6,'tfloat comment', status)

      odkey = 82.D+00
      call ftpkyd(iunit, 'tdouble', odkey, 14, 'tdouble comment',
     &          status)

      if (status .gt. 0)go to 999
      write(*,'(1x,A)') 'Wrote all Keywords successfully '


C        ############################
C        #  write data              #
C        ############################
      
      
C define the null value (must do this before writing any data) 
      call ftpkyj(iunit,'BLANK',-99,
     & 'value to use for undefined pixels',   status)
      
C initialize arrays of values to write to primary array 
      do ii = 1, npixels
          boutarray(ii) = char(ii)
          ioutarray(ii) = ii
          joutarray(ii) = ii
          eoutarray(ii) = ii
          doutarray(ii) = ii
      end do      

C write a few pixels with each datatype 
C set the last value in each group of 4 as undefined 
      call ftpprb(iunit, 1,  1, 2, boutarray(1),  status)
      call ftppri(iunit, 1,  5, 2, ioutarray(5),  status)
      call ftpprj(iunit, 1,  9, 2, joutarray(9),  status)
      call ftppre(iunit, 1, 13, 2, eoutarray(13), status)
      call ftpprd(iunit, 1, 17, 2, doutarray(17), status)
      bnul = char(4)
      call ftppnb(iunit, 1,  3, 2, boutarray(3),   bnul, status)
      inul = 8
      call ftppni(iunit, 1,  7, 2, ioutarray(7),  inul, status)
      call ftppnj(iunit, 1, 11, 2, joutarray(11),  12, status)
      call ftppne(iunit, 1, 15, 2, eoutarray(15), 16., status)
      dnul = 20.
      call ftppnd(iunit, 1, 19, 2, doutarray(19), dnul, status)
      call ftppru(iunit, 1, 1, 1, status)

      if (status .gt. 0)then
          write(*,'(1x,A,I4)')'ftppnx status = ', status
          goto 999
      end if

      call ftflus(iunit, status)   
C flush all data to the disk file  
      write(*,'(1x,A,I4)')'ftflus status = ', status
      write(*,'(1x,A)')' '

      call ftghdn(iunit, hdunum)
      write(*,'(1x,A,I4)')'HDU number = ', hdunum

C        ############################
C        #  read data               #
C        ############################
      
     
C read back the data, setting null values = 99 
      write(*,'(1x,A)')
     &   'Values read back from primary array (99 = null pixel)'
      write(*,'(1x,A)') 
     &  'The 1st, and every 4th pixel should be undefined: '

      anynull = .false.
      bnul = char(99)
      call ftgpvb(iunit, 1,  1, 10, bnul, binarray, anynull, status)
      call ftgpvb(iunit, 1, 11, 10, bnul, binarray(11),anynull,status)

      do ii = 1,npixels
           iinarray(ii) = ichar(binarray(ii))
      end do

      write(*,1101) (iinarray(ii), ii = 1, npixels), anynull,
     &  ' (ftgpvb) '
1101  format(1x,20i3,l3,a)

      inul = 99
      call ftgpvi(iunit, 1, 1, npixels, inul, iinarray,anynull,status)

      write(*,1101) (iinarray(ii), ii = 1, npixels), anynull,
     &  ' (ftgpvi) '

      call ftgpvj(iunit, 1, 1, npixels, 99,  jinarray,anynull,status)

      write(*,1101) (jinarray(ii), ii = 1, npixels), anynull,
     &  ' (ftgpvj) '

      call ftgpve(iunit, 1, 1, npixels, 99., einarray,anynull,status)

      write(*,1102) (einarray(ii), ii = 1, npixels), anynull,
     &  ' (ftgpve) '

1102  format(2x,20f3.0,l2,a)

      dnul = 99.
      call ftgpvd(iunit, 1,  1, 10, dnul,  dinarray, anynull, status)
      call ftgpvd(iunit, 1, 11, 10, dnul,dinarray(11),anynull,status)

      write(*,1102) (dinarray(ii), ii = 1, npixels), anynull,
     &  ' (ftgpvd) '

      if (status .gt. 0)then
          write(*,'(1x,A,I4)')'ERROR: ftgpv_ status = ', status
          goto 999
      end if
      
      if (.not. anynull)then
         write(*,'(1x,A)') 'ERROR: ftgpv_ did not detect null values '
         go to 999
      end if
      
C reset the output null value to the expected input value 

      do ii = 4, npixels, 4      
          boutarray(ii) = char(99)
          ioutarray(ii) = 99
          joutarray(ii) = 99
          eoutarray(ii) = 99.
          doutarray(ii) = 99.
      end do

          ii = 1
          boutarray(ii) = char(99)
          ioutarray(ii) = 99
          joutarray(ii) = 99
          eoutarray(ii) = 99.
          doutarray(ii) = 99.

      
C compare the output with the input flag any differences 
      do ii = 1, npixels
     
         if (boutarray(ii) .ne. binarray(ii))then
             write(*,'(1x,A,2A2)') 'bout != bin ', boutarray(ii), 
     &      binarray(ii)
         end if

         if (ioutarray(ii) .ne. iinarray(ii))then
             write(*,'(1x,A,2I8)') 'bout != bin ', ioutarray(ii), 
     &      iinarray(ii)
         end if

         if (joutarray(ii) .ne. jinarray(ii))then
             write(*,'(1x,A,2I12)') 'bout != bin ', joutarray(ii), 
     &       jinarray(ii)
         end if

         if (eoutarray(ii) .ne. einarray(ii))then
             write(*,'(1x,A,2E15.3)') 'bout != bin ', eoutarray(ii),
     &       einarray(ii)
         end if
    
         if (doutarray(ii) .ne. dinarray(ii))then
             write(*,'(1x,A,2D20.6)') 'bout != bin ', doutarray(ii), 
     &       dinarray(ii)
         end if
      end do

      do ii = 1, npixels
        binarray(ii) = char(0)
        iinarray(ii) = 0
        jinarray(ii) = 0
        einarray(ii) = 0.
        dinarray(ii) = 0.
      end do      

      anynull = .false.
      call ftgpfb(iunit, 1,  1, 10, binarray, larray, anynull,status)
      call ftgpfb(iunit, 1, 11, 10, binarray(11), larray(11),
     & anynull, status)

      do ii = 1, npixels
        if (larray(ii))binarray(ii) = char(0)
      end do

      do ii = 1,npixels
           iinarray(ii) = ichar(binarray(ii))
      end do

      write(*,1101)(iinarray(ii),ii = 1,npixels),anynull,' (ftgpfb)'

      call ftgpfi(iunit, 1, 1, npixels, iinarray, larray, anynull,
     & status)

      do ii = 1, npixels
        if (larray(ii))iinarray(ii) = 0
      end do

      write(*,1101)(iinarray(ii),ii = 1,npixels),anynull,' (ftgpfi)'

      call ftgpfj(iunit, 1, 1, npixels, jinarray, larray, anynull,
     & status)

      do ii = 1, npixels
        if (larray(ii))jinarray(ii) = 0
      end do

      write(*,1101)(jinarray(ii),ii = 1,npixels),anynull,' (ftgpfj)'

      call ftgpfe(iunit, 1, 1, npixels, einarray, larray, anynull,
     & status)

      do ii = 1, npixels
        if (larray(ii))einarray(ii) = 0.
      end do

      write(*,1102)(einarray(ii),ii = 1,npixels),anynull,' (ftgpfe)'

      call ftgpfd(iunit, 1,  1, 10, dinarray, larray, anynull,status)
      call ftgpfd(iunit, 1, 11, 10, dinarray(11), larray(11),
     & anynull, status)

      do ii = 1, npixels
        if (larray(ii))dinarray(ii) = 0.
      end do

      write(*,1102)(dinarray(ii),ii = 1,npixels),anynull,' (ftgpfd)'

      if (status .gt. 0)then
          write(*,'(1x,A,I4)')'ERROR: ftgpf_ status = ', status
          go to 999
      end if

      if (.not. anynull)then
         write(*,'(1x,A)') 'ERROR: ftgpf_ did not detect null values'
         go to 999
      end if


C        ##########################################
C        #  close and reopen file multiple times  #
C        ##########################################
      

      do ii = 1, 10
         call ftclos(iunit, status)
        
         if (status .gt. 0)then
            write(*,'(1x,A,I4)')'ERROR in ftclos (1) = ', status
            go to 999
         end if

         call ftopen(iunit, filename, 1, block, status)

         if (status .gt. 0)then
            write(*,'(1x,A,I4)')'ERROR: ftopen open file status = ',
     &      status
            go to 999
         end if
      end do
      
      write(*,'(1x,A)') ' '
      write(*,'(1x,A)') 'Closed then reopened the FITS file 10 times.'
      write(*,'(1x,A)')' '

      call ftghdn(iunit, hdunum)
      write(*,'(1x,A,I4)')'HDU number = ', hdunum


C        ############################
C        #  read single keywords    #
C        ############################
      

      simple = .false.
      bitpix = 0
      naxis = 0
      naxes(1) = 0
      naxes(2) = 0
      pcount = -99
      gcount =  -99
      extend = .false.
      write(*,'(1x,A)') 'Read back keywords: '
      call ftghpr(iunit, 3, simple, bitpix, naxis, naxes, pcount,
     &       gcount, extend, status)
      write(*,'(1x,A,L4,4I4)')'simple, bitpix, naxis, naxes = ',
     &       simple, bitpix, naxis, naxes(1), naxes(2)
      write(*,'(1x,A,2I4,L4)')'  pcount, gcount, extend = ',
     &           pcount, gcount, extend

      call ftgrec(iunit, 9, card, status)
      write(*,'(1x,A)') card
      if (card(1:15) .ne. 'KEY_PREC= ''This')
     &    write(*,'(1x,A)') 'ERROR in ftgrec '

      call ftgkyn(iunit, 9, keyword, value, comment, status)
      write(*,'(1x,5A)') keyword,' ', value(1:35),' ', comment(1:20)

      if (keyword(1:8) .ne. 'KEY_PREC' )
     &    write(*,'(1x,2A)') 'ERROR in ftgkyn: ', keyword

      call ftgcrd(iunit, keyword, card, status)
      write(*,'(1x,A)') card

      if (keyword(1:8) .ne.  card(1:8) )
     &    write(*,'(1x,2A)') 'ERROR in ftgcrd: ', keyword

      call ftgkey(iunit, 'KY_PKNS1', value, comment, status)
      write(*,'(1x,5A)') 'KY_PKNS1 ',':', value(1:15),':', comment(1:16)

      if (value(1:14) .ne. '''first string''')
     &  write(*,'(1x,2A)') 'ERROR in ftgkey: ', value

      call ftgkys(iunit, 'key_pkys', iskey, comment, status)
      write(*,'(1x,5A,I4)')'KEY_PKYS ',':',iskey,':',comment(1:16),
     & status

      call ftgkyl(iunit, 'key_pkyl', ilkey, comment, status)
      write(*,'(1x,2A,L4,2A,I4)') 'KEY_PKYL ',':', ilkey,':', 
     &comment(1:16), status

      call ftgkyj(iunit, 'KEY_PKYJ', ijkey, comment, status)
      write(*,'(1x,2A,I4,2A,I4)') 'KEY_PKYJ ',':',ijkey,':', 
     &  comment(1:16), status

      call ftgkye(iunit, 'KEY_PKYJ', iekey, comment, status)
      write(*,'(1x,2A,f12.5,2A,I4)') 'KEY_PKYE ',':',iekey,':',
     & comment(1:16), status

      call ftgkyd(iunit, 'KEY_PKYJ', idkey, comment, status)
      write(*,'(1x,2A,F12.5,2A,I4)') 'KEY_PKYD ',':',idkey,':', 
     & comment(1:16), status

      if (ijkey .ne. 11 .or. iekey .ne. 11. .or. idkey .ne. 11.)
     &   write(*,'(1x,A,I4,2F5.1)') 'ERROR in ftgky(jed): ',
     & ijkey, iekey, idkey

      iskey= ' '
      call ftgkys(iunit, 'key_pkys', iskey, comment, status)
      write(*,'(1x,5A,I4)') 'KEY_PKYS ',':', iskey,':', comment(1:16),
     &  status

      ilkey = .false.
      call ftgkyl(iunit, 'key_pkyl', ilkey, comment, status)
      write(*,'(1x,2A,L4,2A,I4)') 'KEY_PKYL ',':', ilkey,':',
     &  comment(1:16), status

      ijkey = 0
      call ftgkyj(iunit, 'KEY_PKYJ', ijkey, comment, status)
      write(*,'(1x,2A,I4,2A,I4)') 'KEY_PKYJ ',':',ijkey,':', 
     & comment(1:16), status

      iekey = 0
      call ftgkye(iunit, 'KEY_PKYE', iekey, comment, status)
      write(*,'(1x,2A,f12.5,2A,I4)') 'KEY_PKYE ',':',iekey,':', 
     & comment(1:16), status

      idkey = 0
      call ftgkyd(iunit, 'KEY_PKYD', idkey, comment, status)
      write(*,'(1x,2A,F12.5,2A,I4)') 'KEY_PKYD ',':',idkey,':',
     & comment(1:16), status

      iekey = 0
      call ftgkye(iunit, 'KEY_PKYF', iekey, comment, status)
      write(*,'(1x,2A,f12.5,2A,I4)') 'KEY_PKYF ',':',iekey,':',
     & comment(1:16), status

      iekey = 0
      call ftgkye(iunit, 'KEY_PKYE', iekey, comment, status)
      write(*,'(1x,2A,f12.5,2A,I4)') 'KEY_PKYE ',':',iekey,':', 
     & comment(1:16), status

      idkey = 0
      call ftgkyd(iunit, 'KEY_PKYG', idkey, comment, status)
      write(*,'(1x,2A,f16.12,2A,I4)') 'KEY_PKYG ',':',idkey,':',
     & comment(1:16), status

      idkey = 0
      call ftgkyd(iunit, 'KEY_PKYD', idkey, comment, status)
      write(*,'(1x,2A,f16.12,2A,I4)') 'KEY_PKYD ',':',idkey,':', 
     & comment(1:16), status

      call ftgkyt(iunit, 'KEY_PKYT', ijkey, idkey, comment, status)
      write(*,'(1x,2A,i10,A,f16.14,A,I4)') 'KEY_PKYT  ',':',
     & ijkey,':', idkey, comment(1:16), status

      call ftpunt(iunit, 'KEY_PKYJ', 'km/s/Mpc', status)
      ijkey = 0
      call ftgkyj(iunit, 'KEY_PKYJ', ijkey, comment, status)
      write(*,'(1x,2A,I4,2A,I4)') 'KEY_PKYJ ',':',ijkey,':', 
     & comment(1:38), status
      call ftgunt(iunit,'KEY_PKYJ',kunit,status)
      write(*,'(1x,2A)') 'keyword unit=', kunit

      call ftpunt(iunit, 'KEY_PKYJ', ' ', status)
      ijkey = 0
      call ftgkyj(iunit, 'KEY_PKYJ', ijkey, comment, status)
      write(*,'(1x,2A,I4,2A,I4)') 'KEY_PKYJ ',':',ijkey,':', 
     & comment(1:38), status
      call ftgunt(iunit,'KEY_PKYJ',kunit,status)
      write(*,'(1x,2A)') 'keyword unit=', kunit

      call ftpunt(iunit, 'KEY_PKYJ', 'feet/second/second', status)
      ijkey = 0
      call ftgkyj(iunit, 'KEY_PKYJ', ijkey, comment, status)
      write(*,'(1x,2A,I4,2A,I4)') 'KEY_PKYJ ',':',ijkey,':', 
     & comment(1:38), status
      call ftgunt(iunit,'KEY_PKYJ',kunit,status)
      write(*,'(1x,2A)') 'keyword unit=', kunit

      call ftgkys(iunit, 'key_pkls', lstr, comment, status)
      write(*,'(1x,2A)') 'KEY_PKLS long string value = ', lstr(1:50)
      write(*,'(1x,A)')lstr(51:120)

C get size and position in header 
      call ftghps(iunit, existkeys, keynum, status)
      write(*,'(1x,A,I4,A,I4)') 'header contains ', existkeys,
     & ' keywords; located at keyword ', keynum

C        ############################
C        #  read array keywords     #
C        ############################
      
      call ftgkns(iunit, 'ky_pkns', 1, 3, inskey, nfound, status)
      write(*,'(1x,4A)') 'ftgkns: ', inskey(1)(1:14), inskey(2)(1:14),
     &  inskey(3)(1:14)
      if (nfound .ne. 3 .or. status .gt. 0)
     &   write(*,'(1x,A,2I4)') ' ERROR in ftgkns ', nfound, status

      call ftgknl(iunit, 'ky_pknl', 1, 3, inlkey, nfound, status)
      write(*,'(1x,A,3L4)') 'ftgknl: ', inlkey(1), inlkey(2), inlkey(3)
      if (nfound .ne. 3 .or. status .gt. 0)
     &   write(*,'(1x,A,2I4)') ' ERROR in ftgknl ', nfound, status

      call ftgknj(iunit, 'ky_pknj', 1, 3, injkey, nfound, status)
      write(*,'(1x,A,3I4)') 'ftgknj: ', injkey(1), injkey(2), injkey(3)
      if (nfound .ne. 3 .or. status .gt. 0)
     &   write(*,'(1x,A,2I4)') ' ERROR in ftgknj ', nfound, status

      call ftgkne(iunit, 'ky_pkne', 1, 3, inekey, nfound, status)
      write(*,'(1x,A,3F10.5)') 'ftgkne: ',inekey(1),inekey(2),inekey(3)
      if (nfound .ne. 3 .or. status .gt. 0)
     &   write(*,'(1x,A,2I4)') ' ERROR in ftgkne ', nfound, status

      call ftgknd(iunit, 'ky_pknd', 1, 3, indkey, nfound, status)
      write(*,'(1x,A,3F10.5)') 'ftgknd: ',indkey(1),indkey(2),indkey(3)
      if (nfound .ne. 3 .or. status .gt. 0)
     &   write(*,'(1x,A,2I4)') ' ERROR in ftgknd ', nfound, status

      write(*,'(1x,A)')' '
      write(*,'(1x,A)')
     & 'Before deleting the HISTORY and DATE keywords...'
      do ii = 29, 32     
          call ftgrec(iunit, ii, card, status)
          write(*,'(1x,A)') card(1:8)
      end do

C don't print date value, so that 
C the output will always be the same 
      

C        ############################
C        #  delete keywords         #
C        ############################
      

      call ftdrec(iunit, 30, status)
      call ftdkey(iunit, 'DATE', status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'After deleting the keywords... '
      do ii = 29, 30            
          call ftgrec(iunit, ii, card, status)
          write(*,'(1x,A)') card
      end do      

      if (status .gt. 0)
     &   write(*,'(1x,A)') ' ERROR deleting keywords '
      

C        ############################
C        #  insert keywords         #
C        ############################
      
      call ftirec(iunit,26,
     & 'KY_IREC = ''This keyword inserted by fxirec''',
     &   status)
      call ftikys(iunit, 'KY_IKYS', 'insert_value_string',
     &  'ikys comment', status)
      call ftikyj(iunit, 'KY_IKYJ', 49, 'ikyj comment', status)
      call ftikyl(iunit, 'KY_IKYL', .true., 'ikyl comment', status)
      call ftikye(iunit, 'KY_IKYE',12.3456,4,'ikye comment',status)
      odkey = 12.345678901234567D+00
      call ftikyd(iunit, 'KY_IKYD', odkey, 14,
     &  'ikyd comment', status)
      call ftikyf(iunit, 'KY_IKYF', 12.3456, 4, 'ikyf comment',
     & status)
      call ftikyg(iunit, 'KY_IKYG', odkey, 13,
     & 'ikyg comment', status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'After inserting the keywords... '
      do ii = 25, 34
          call ftgrec(iunit, ii, card, status)
          write(*,'(1x,A)') card
      end do

      if (status .gt. 0)
     &   write(*,'(1x,A)') ' ERROR inserting keywords '
      

C        ############################
C        #  modify keywords         #
C        ############################
      
      call ftmrec(iunit, 25,
     & 'COMMENT   This keyword was modified by fxmrec', status)
      call ftmcrd(iunit, 'KY_IREC', 
     & 'KY_MREC = ''This keyword was modified by fxmcrd''', status)
      call ftmnam(iunit, 'KY_IKYS', 'NEWIKYS', status)

      call ftmcom(iunit,'KY_IKYJ','This is a modified comment',
     & status)
      call ftmkyj(iunit, 'KY_IKYJ', 50, '&', status)
      call ftmkyl(iunit, 'KY_IKYL', .false., '&', status)
      call ftmkys(iunit, 'NEWIKYS', 'modified_string', '&', status)
      call ftmkye(iunit, 'KY_IKYE', -12.3456, 4, '&', status)
      odkey = -12.345678901234567D+00

      call ftmkyd(iunit, 'KY_IKYD', odkey, 14, 
     & 'modified comment', status)
      call ftmkyf(iunit, 'KY_IKYF', -12.3456, 4, '&', status)
      call ftmkyg(iunit,'KY_IKYG', odkey,13,'&',status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'After modifying the keywords... '
      do ii = 25, 34
          call ftgrec(iunit, ii, card, status)
          write(*,'(1x,A)') card
      end do
      
      if (status .gt. 0)then
         write(*,'(1x,A)') ' ERROR modifying keywords '
         go to 999
      end if
      
C        ############################
C        #  update keywords         #
C        ############################
      
      call ftucrd(iunit, 'KY_MREC', 
     & 'KY_UCRD = ''This keyword was updated by fxucrd''',
     &         status)

      call ftukyj(iunit, 'KY_IKYJ', 51, '&', status)
      call ftukyl(iunit, 'KY_IKYL', .true., '&', status)
      call ftukys(iunit, 'NEWIKYS', 'updated_string', '&', status)
      call ftukye(iunit, 'KY_IKYE', -13.3456, 4, '&', status)
      odkey = -13.345678901234567D+00

      call ftukyd(iunit, 'KY_IKYD',odkey , 14, 
     & 'modified comment', status)
      call ftukyf(iunit, 'KY_IKYF', -13.3456, 4, '&', status)
      call ftukyg(iunit, 'KY_IKYG', odkey, 13, '&', status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'After updating the keywords... '
      do ii = 25, 34
          call ftgrec(iunit, ii, card, status)
          write(*,'(1x,A)') card
      end do

      if (status .gt. 0)then
         write(*,'(1x,A)') ' ERROR modifying keywords '
         go to 999
      end if

C     move to top of header and find keywords using wild cards 
      call ftgrec(iunit, 0, card, status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)')
     &  'Keywords found using wildcard search (should be 9)...'
      nfound = -1
91    nfound = nfound +1
      call ftgnxk(iunit, inclist, 2, exclist, 2, card, status)
      if (status .eq. 0)then
          write(*,'(1x,A)') card
          go to 91
      end if

      if (nfound .ne. 9)then
          write(*,'(1x,A)')
     &    'ERROR reading keywords using wildcards (ftgnxk)'
         go to 999
      end if
      status = 0

C        ############################
C        #  create binary table     #
C        ############################
      
      tform(1) = '15A'
      tform(2) = '1L'
      tform(3) = '16X'
      tform(4) = '1B'
      tform(5) = '1I'
      tform(6) = '1J'
      tform(7) = '1E'
      tform(8) = '1D'
      tform(9) = '1C'
      tform(10)= '1M'

      ttype(1) = 'Avalue'
      ttype(2) = 'Lvalue'
      ttype(3) = 'Xvalue'
      ttype(4) = 'Bvalue'
      ttype(5) = 'Ivalue'
      ttype(6) = 'Jvalue'
      ttype(7) = 'Evalue'
      ttype(8) = 'Dvalue'
      ttype(9) = 'Cvalue'
      ttype(10)= 'Mvalue'

      tunit(1) = ' '
      tunit(2) = 'm**2'
      tunit(3) = 'cm'
      tunit(4) = 'erg/s'
      tunit(5) = 'km/s'
      tunit(6) = ' '
      tunit(7) = ' '
      tunit(8) = ' '
      tunit(9) = ' '
      tunit(10)= ' '

      nrows = 21
      tfields = 10
      pcount = 0

      call ftibin(iunit, nrows, tfields, ttype, tform, tunit, 
     & binname, pcount, status)
      write(*,'(1x,A)')' '
      write(*,'(1x,A,I4)') 'ftibin status = ', status
      call ftghdn(iunit, hdunum)
      write(*,'(1x,A,I4)') 'HDU number = ', hdunum

C get size and position in header, and reserve space for more keywords 
      call ftghps(iunit, existkeys, keynum, status)
      write(*,'(1x,A,I4,A,I4)') 'header contains ',existkeys,
     & ' keywords located at keyword ', keynum

      morekeys = 40
      call fthdef(iunit, morekeys, status)
      call ftghsp(iunit, existkeys, morekeys, status)
      write(*,'(1x,A,I4,A,I4,A)') 'header contains ', existkeys,
     &' keywords with room for ', morekeys,' more'

C define null value for int cols 
      call fttnul(iunit, 4, 99, status)   
      call fttnul(iunit, 5, 99, status)
      call fttnul(iunit, 6, 99, status)

      call ftpkyj(iunit, 'TNULL4', 99, 'value for undefined pixels',
     &  status)
      call ftpkyj(iunit, 'TNULL5', 99, 'value for undefined pixels',
     &  status)
      call ftpkyj(iunit, 'TNULL6', 99, 'value for undefined pixels',
     & status)

      naxis = 3
      naxes(1) = 1
      naxes(2) = 2
      naxes(3) = 8
      call ftptdm(iunit, 3, naxis, naxes, status)

      naxis = 0
      naxes(1) = 0
      naxes(2) = 0
      naxes(3) = 0
      call ftgtdm(iunit, 3, 3, naxis, naxes, status)
      call ftgkys(iunit, 'TDIM3', iskey, comment, status)
      write(*,'(1x,2A,4I4)') 'TDIM3 = ', iskey, naxis, naxes(1),
     &      naxes(2), naxes(3)

C force header to be scanned (not required) 
      call ftrdef(iunit, status)  
    
C        ############################
C        #  write data to columns   #
C        ############################
         
C initialize arrays of values to write to table 
      signval = -1
      do ii = 1, 21
          signval = signval * (-1)
          boutarray(ii) = char(ii)
          ioutarray(ii) = (ii) * signval
          joutarray(ii) = (ii) * signval
          koutarray(ii) = (ii) * signval
          eoutarray(ii) = (ii) * signval
          doutarray(ii) = (ii) * signval
      end do

      call ftpcls(iunit, 1, 1, 1, 3, onskey, status)  
C write string values 
      call ftpclu(iunit, 1, 4, 1, 1, status)  
C write null value 

      larray(1) = .false.
      larray(2) =.true.
      larray(3) = .false.
      larray(4) = .false.
      larray(5) =.true.
      larray(6) =.true.
      larray(7) = .false.
      larray(8) = .false.
      larray(9) = .false.
      larray(10) =.true.
      larray(11) =.true.
      larray(12) = .true.
      larray(13) = .false.
      larray(14) = .false.
      larray(15) =.false.
      larray(16) =.false.
      larray(17) = .true.
      larray(18) = .true.
      larray(19) = .true.
      larray(20) = .true.
      larray(21) =.false.
      larray(22) =.false.
      larray(23) =.false.
      larray(24) =.false.
      larray(25) =.false.
      larray(26) = .true.
      larray(27) = .true.
      larray(28) = .true.
      larray(29) = .true.
      larray(30) = .true.
      larray(31) =.false.
      larray(32) =.false.
      larray(33) =.false.
      larray(34) =.false.
      larray(35) =.false.
      larray(36) =.false.

C write bits
      call ftpclx(iunit, 3, 1, 1, 36, larray, status) 

C loop over cols 4 - 8 
      do ii = 4, 8   
          call ftpclb(iunit, ii, 1, 1, 2, boutarray, status)
          if (status .eq. 412) status = 0

          call ftpcli(iunit, ii, 3, 1, 2, ioutarray(3), status) 
          if (status .eq. 412) status = 0

          call ftpclj(iunit, ii, 5, 1, 2, koutarray(5), status) 
          if (status .eq. 412) status = 0

          call ftpcle(iunit, ii, 7, 1, 2, eoutarray(7), status)
          if (status .eq. 412)status = 0

          call ftpcld(iunit, ii, 9, 1, 2, doutarray(9), status)
          if (status .eq. 412)status = 0

C write null value 
          call ftpclu(iunit, ii, 11, 1, 1, status)  
      end do

      call ftpclc(iunit,  9, 1, 1, 10, eoutarray, status)
      call ftpclm(iunit, 10, 1, 1, 10, doutarray, status)

C loop over cols 4 - 8 
      do ii = 4, 8
          bnul = char(13)
          call ftpcnb(iunit, ii, 12, 1, 2, boutarray(12),bnul,status)
          if (status .eq. 412) status = 0
          inul=15
          call ftpcni(iunit, ii, 14, 1, 2, ioutarray(14),inul,status) 
          if (status .eq. 412) status = 0
          call ftpcnj(iunit, ii, 16, 1, 2, koutarray(16), 17, status) 
          if (status .eq. 412) status = 0
          call ftpcne(iunit, ii, 18, 1, 2, eoutarray(18), 19.,status)
          if (status .eq. 412) status = 0
          dnul = 21.
          call ftpcnd(iunit, ii, 20, 1, 2, doutarray(20),dnul,status)
          if (status .eq. 412) status = 0
      end do
      
C write logicals
      call ftpcll(iunit, 2, 1, 1, 21, larray, status) 
C write null value 
      call ftpclu(iunit, 2, 11, 1, 1, status)  
      write(*,'(1x,A,I4)') 'ftpcl_ status = ', status
      if (status .gt. 0)go to 999
      
C        #########################################
C        #  get information about the columns    #
C        #########################################
      
      write(*,'(1x,A)')' '
      write(*,'(1x,A)')
     & 'Find the column numbers a returned status value'//
     & ' of 237 is'
      write(*,'(1x,A)') 
     & 'expected and indicates that more than one column'//
     & ' name matches'
      write(*,'(1x,A)')'the input column name template.'//
     & '  Status = 219 indicates that'
      write(*,'(1x,A)') 'there was no matching column name.'

      call ftgcno(iunit, 0, 'Xvalue', colnum, status)
      write(*,'(1x,A,I4,A,I4)') 'Column Xvalue is number', colnum,
     &' status =',status

219   continue
      if (status .ne. 219)then
        call ftgcnn(iunit, 1, '*ue', colname, colnum, status)
        write(*,'(1x,3A,I4,A,I4)') 'Column ',colname(1:6),' is number', 
     &   colnum,' status = ',  status
        go to 219
      end if

      status = 0

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'Information about each column: '

      do ii = 1, tfields
        call ftgtcl(iunit, ii, typecode, repeat, width, status)
        call ftgbcl(iunit,ii,ttype,tunit,cval,repeat,scale,
     &        zero, jnulval, tdisp, status)

        write(*,'(1x,A,3I4,5A,2F8.2,I12,A)')
     &  tform(ii)(1:3), typecode, repeat, width,' ',
     &  ttype(1)(1:6),' ',tunit(1)(1:6), cval, scale, zero, jnulval,
     &  tdisp(1:8)
      end do

      write(*,'(1x,A)') ' '

C        ###############################################
C        #  insert ASCII table before the binary table #
C        ###############################################

      call ftmrhd(iunit, -1, hdutype, status)
      if (status .gt. 0)goto 999

      tform(1) = 'A15'
      tform(2) = 'I10'
      tform(3) = 'F14.6'
      tform(4) = 'E12.5'
      tform(5) = 'D21.14'

      ttype(1) = 'Name'
      ttype(2) = 'Ivalue'
      ttype(3) = 'Fvalue'
      ttype(4) = 'Evalue'
      ttype(5) = 'Dvalue'

      tunit(1) = ' '
      tunit(2) = 'm**2'
      tunit(3) = 'cm'
      tunit(4) = 'erg/s'
      tunit(5) = 'km/s'

      rowlen = 76
      nrows = 11
      tfields = 5

      call ftitab(iunit, rowlen, nrows, tfields, ttype, tbcol, 
     & tform, tunit, tblname, status)
      write(*,'(1x,A,I4)') 'ftitab status = ', status
      call ftghdn(iunit, hdunum)
      write(*,'(1x,A,I4)') 'HDU number = ', hdunum

C define null value for int cols 
      call ftsnul(iunit, 1, 'null1', status)   
      call ftsnul(iunit, 2, 'null2', status)
      call ftsnul(iunit, 3, 'null3', status)
      call ftsnul(iunit, 4, 'null4', status)
      call ftsnul(iunit, 5, 'null5', status)
 
      call ftpkys(iunit, 'TNULL1', 'null1',
     & 'value for undefined pixels', status)
      call ftpkys(iunit, 'TNULL2', 'null2',
     & 'value for undefined pixels', status)
      call ftpkys(iunit, 'TNULL3', 'null3',
     & 'value for undefined pixels', status)
      call ftpkys(iunit, 'TNULL4', 'null4',
     & 'value for undefined pixels', status)
      call ftpkys(iunit, 'TNULL5', 'null5',
     & 'value for undefined pixels', status)

      if (status .gt. 0) goto 999
      
C        ############################
C        #  write data to columns   #
C        ############################
           
C initialize arrays of values to write to table 
      do ii = 1,21     
          boutarray(ii) = char(ii)
          ioutarray(ii) = ii
          joutarray(ii) = ii
          eoutarray(ii) = ii
          doutarray(ii) = ii
      end do      

C write string values 
      call ftpcls(iunit, 1, 1, 1, 3, onskey, status)  
C write null value 
      call ftpclu(iunit, 1, 4, 1, 1, status)  

      do ii = 2,5 
C loop over cols 2 - 5       
          call ftpclb(iunit, ii, 1, 1, 2, boutarray, status)  
C char array 
          if (status .eq. 412) status = 0
             
          call ftpcli(iunit, ii, 3, 1, 2, ioutarray(3), status)  
C short array 
          if (status .eq. 412) status = 0
             
          call ftpclj(iunit, ii, 5, 1, 2, joutarray(5), status)  
C long array 
          if (status .eq. 412)status = 0
              
          call ftpcle(iunit, ii, 7, 1, 2, eoutarray(7), status)  
C float array 
          if (status .eq. 412) status = 0
             
          call ftpcld(iunit, ii, 9, 1, 2, doutarray(9), status)  
C double array 
          if (status .eq. 412) status = 0

          call ftpclu(iunit, ii, 11, 1, 1, status)  
C write null value 
      end do
      write(*,'(1x,A,I4)') 'ftpcl_ status = ', status
      write(*,'(1x,A)')' '

C        ################################
C        #  read data from ASCII table  #
C        ################################
      
      call ftghtb(iunit, 99, rowlen, nrows, tfields, ttype, tbcol, 
     &       tform, tunit, tblname, status)

      write(*,'(1x,A,3I3,2A)')
     & 'ASCII table: rowlen, nrows, tfields, extname:',
     & rowlen, nrows, tfields,' ',tblname

      do ii = 1,tfields
        write(*,'(1x,A,I4,3A)') 
     & ttype(ii)(1:7), tbcol(ii),' ',tform(ii)(1:7), tunit(ii)(1:7)
      end do

      nrows = 11
      call ftgcvs(iunit, 1, 1, 1, nrows, 'UNDEFINED', inskey,
     &   anynull, status)
      bnul = char(99)
      call ftgcvb(iunit, 2, 1, 1, nrows, bnul, binarray,
     & anynull, status)
      inul = 99
      call ftgcvi(iunit, 2, 1, 1, nrows, inul, iinarray,
     & anynull, status)
      call ftgcvj(iunit, 3, 1, 1, nrows, 99, jinarray,
     & anynull, status)
      call ftgcve(iunit, 4, 1, 1, nrows, 99., einarray,
     & anynull, status)
      dnul = 99.
      call ftgcvd(iunit, 5, 1, 1, nrows, dnul, dinarray,
     & anynull, status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'Data values read from ASCII table: '
      do ii = 1, nrows
        jj = ichar(binarray(ii))
        write(*,1011) inskey(ii), jj,
     &   iinarray(ii), jinarray(ii), einarray(ii), dinarray(ii)
1011    format(1x,a15,3i3,1x,2f3.0)
      end do

      call ftgtbs(iunit, 1, 20, 78, uchars, status)
      write(*,'(1x,A)')' '
      write(*,'(1x,A)') uchars
      call ftptbs(iunit, 1, 20, 78, uchars, status)
      
C        #########################################
C        #  get information about the columns    #
C        #########################################

      call ftgcno(iunit, 0, 'name', colnum, status)
      write(*,'(1x,A)')' '
      write(*,'(1x,A,I4,A,I4)')
     &  'Column name is number',colnum,' status = ', status

2190  continue
      if (status .ne. 219)then
        if (status .gt. 0 .and. status .ne. 237)go to 999

        call ftgcnn(iunit, 1, '*ue', colname, colnum, status)
        write(*,'(1x,3A,I4,A,I4)')
     & 'Column ',colname(1:6),' is number',colnum,' status = ',status
        go to 2190
      end if
   
      status = 0

      do ii = 1, tfields       
        call ftgtcl(iunit, ii, typecode, repeat, width, status)
        call ftgacl(iunit, ii, ttype, tbcol,tunit,tform, 
     &   scale,zero, nulstr, tdisp, status)

        write(*,'(1x,A,3I4,2A,I4,2A,2F10.2,3A)')
     & tform(ii)(1:7), typecode, repeat, width,' ',
     &  ttype(1)(1:6), tbcol(1), ' ',tunit(1)(1:5),
     &  scale, zero, ' ', nulstr(1:6), tdisp(1:2)

      end do

      write(*,'(1x,A)') ' '

C        ###############################################
C        #  test the insert/delete row/column routines #
C        ###############################################
      
      call ftirow(iunit, 2, 3, status)
      if (status .gt. 0) goto 999

      nrows = 14
      call ftgcvs(iunit, 1, 1, 1, nrows, 'UNDEFINED',
     & inskey,   anynull, status)
      call ftgcvb(iunit, 2, 1, 1, nrows, bnul, binarray,
     & anynull, status)
      call ftgcvi(iunit, 2, 1, 1, nrows, inul, iinarray,
     & anynull, status)
      call ftgcvj(iunit, 3, 1, 1, nrows, 99, jinarray,
     & anynull, status)
      call ftgcve(iunit, 4, 1, 1, nrows, 99., einarray,
     & anynull, status)
      call ftgcvd(iunit, 5, 1, 1, nrows, dnul, dinarray,
     & anynull, status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)')'Data values after inserting 3 rows after row 2:'
      do ii = 1, nrows     
        jj = ichar(binarray(ii))
        write(*,1011) inskey(ii), jj,
     &   iinarray(ii), jinarray(ii), einarray(ii), dinarray(ii)
      end do

      call ftdrow(iunit, 10, 2, status)

      nrows = 12
      call ftgcvs(iunit, 1, 1, 1, nrows, 'UNDEFINED', inskey,  
     & anynull, status)
      call ftgcvb(iunit, 2, 1, 1, nrows, bnul, binarray, anynull,
     & status)
      call ftgcvi(iunit, 2, 1, 1, nrows, inul, iinarray, anynull,
     & status)
      call ftgcvj(iunit, 3, 1, 1, nrows, 99, jinarray, anynull,
     & status)
      call ftgcve(iunit, 4, 1, 1, nrows, 99., einarray, anynull,
     & status)
      call ftgcvd(iunit, 5, 1, 1, nrows, dnul, dinarray, anynull,
     & status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'Data values after deleting 2 rows at row 10: '
      do ii = 1, nrows    
        jj = ichar(binarray(ii))
        write(*,1011)  inskey(ii), jj,
     &       iinarray(ii), jinarray(ii), einarray(ii), dinarray(ii)
      end do
      call ftdcol(iunit, 3, status)

      call ftgcvs(iunit, 1, 1, 1, nrows, 'UNDEFINED', inskey, 
     &  anynull, status)
      call ftgcvb(iunit, 2, 1, 1, nrows, bnul, binarray, anynull,
     & status)
      call ftgcvi(iunit, 2, 1, 1, nrows, inul, iinarray, anynull,
     & status)
      call ftgcve(iunit, 3, 1, 1, nrows, 99., einarray, anynull,
     & status)
      call ftgcvd(iunit, 4, 1, 1, nrows, dnul, dinarray, anynull,
     & status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'Data values after deleting column 3: '
      do ii = 1,nrows
        jj = ichar(binarray(ii))
        write(*,1012) inskey(ii), jj,
     &       iinarray(ii), einarray(ii), dinarray(ii)
1012    format(1x,a15,2i3,1x,2f3.0)

      end do

      call fticol(iunit, 5, 'INSERT_COL', 'F14.6', status)

      call ftgcvs(iunit, 1, 1, 1, nrows, 'UNDEFINED', inskey,
     &   anynull, status)
      call ftgcvb(iunit, 2, 1, 1, nrows, bnul, binarray, anynull,
     & status)
      call ftgcvi(iunit, 2, 1, 1, nrows, inul, iinarray, anynull,
     & status)
      call ftgcve(iunit, 3, 1, 1, nrows, 99., einarray, anynull,
     & status)
      call ftgcvd(iunit, 4, 1, 1, nrows, dnul, dinarray, anynull,
     & status)
      call ftgcvj(iunit, 5, 1, 1, nrows, 99, jinarray, anynull,
     & status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') ' Data values after inserting column 5: '
      do ii = 1, nrows
        jj = ichar(binarray(ii))
        write(*,1013) inskey(ii), jj,
     &       iinarray(ii), einarray(ii), dinarray(ii) , jinarray(ii)
1013    format(1x,a15,2i3,1x,2f3.0,i2)

      end do

C        ################################
C        #  read data from binary table #
C        ################################
      

      call ftmrhd(iunit, 1, hdutype, status)
      if (status .gt. 0)go to 999
      call ftghdn(iunit, hdunum)
      write(*,'(1x,A,I4)') 'HDU number = ', hdunum

      call ftghsp(iunit, existkeys, morekeys, status)
      write(*,'(1x,A)')' '
      write(*,'(1x,A)')'Moved to binary table'
      write(*,'(1x,A,I4,A,I4,A)') 'header contains ',existkeys,
     & ' keywords with room for ',morekeys,' more '

      call ftghbn(iunit, 99, nrows, tfields, ttype, 
     &        tform, tunit, binname, pcount, status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A,2I4,A,I4)') 
     & 'Binary table: nrows, tfields, extname, pcount:',
     &        nrows, tfields, binname, pcount

      do ii = 1,tfields
        write(*,'(1x,3A)') ttype(ii), tform(ii), tunit(ii)
      end do

      do ii = 1, 40
          larray(ii) = .false.
      end do

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'Data values read from binary table: '
      write(*,'(1x,A)') ' Bit column (X) data values:   '

      call ftgcx(iunit, 3, 1, 1, 36, larray, status)
      write(*,1014) (larray(ii), ii = 1,40)
1014  format(1x,8l1,' ',8l1,' ',8l1,' ',8l1,' ',8l1)

      nrows = 21
      do ii = 1, nrows
        larray(ii) = .false.
        xinarray(ii) = ' '
        binarray(ii) = ' '
        iinarray(ii) = 0 
        kinarray(ii) = 0
        einarray(ii) = 0. 
        dinarray(ii) = 0.
        cinarray(ii * 2 -1) = 0. 
        minarray(ii * 2 -1) = 0.
        cinarray(ii * 2 ) = 0. 
        minarray(ii * 2 ) = 0.
      end do      

      write(*,'(1x,A)') '  '
      call ftgcvs(iunit, 1, 4, 1, 1, ' ',  inskey,   anynull,status)
      if (ichar(inskey(1)(1:1)) .eq. 0)inskey(1)=' '
      write(*,'(1x,2A)') 'null string column value (should be blank):',
     &        inskey(1)

      call ftgcvs(iunit, 1, 1, 1, nrows, 'NOT DEFINED',  inskey,
     &   anynull, status)
      call ftgcl( iunit, 2, 1, 1, nrows, larray, status)
      bnul = char(98)
      call ftgcvb(iunit, 3, 1, 1,nrows,bnul, xinarray,anynull,status)
      call ftgcvb(iunit, 4, 1, 1,nrows,bnul, binarray,anynull,status)
      inul = 98
      call ftgcvi(iunit, 5, 1, 1,nrows,inul, iinarray,anynull,status)
      call ftgcvj(iunit, 6, 1, 1, nrows, 98, kinarray,anynull,status)
      call ftgcve(iunit, 7, 1, 1, nrows, 98.,einarray,anynull,status)
      dnul = 98.
      call ftgcvd(iunit, 8, 1, 1, nrows,dnul,dinarray,anynull,status)
      call ftgcvc(iunit, 9, 1, 1, nrows, 98.,cinarray,anynull,status)
      call ftgcvm(iunit,10, 1, 1, nrows,dnul,minarray,anynull,status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'Read columns with ftgcv_: '
      do ii = 1,nrows
        jj = ichar(xinarray(ii))
        jjj = ichar(binarray(ii))
      write(*,1201)inskey(ii),larray(ii),jj,jjj,iinarray(ii),
     & kinarray(ii), einarray(ii), dinarray(ii), cinarray(ii * 2 -1), 
     &cinarray(ii * 2 ), minarray(ii * 2 -1), minarray(ii * 2 )
      end do
1201  format(1x,a14,l4,4i4,6f5.0)

      do ii = 1, nrows
        larray(ii) = .false.
        xinarray(ii) = ' '
        binarray(ii) = ' '
        iinarray(ii) = 0 
        kinarray(ii) = 0
        einarray(ii) = 0. 
        dinarray(ii) = 0.
        cinarray(ii * 2 -1) = 0. 
        minarray(ii * 2 -1) = 0.
        cinarray(ii * 2 ) = 0. 
        minarray(ii * 2 ) = 0.
      end do      

      call ftgcfs(iunit, 1, 1, 1, nrows, inskey,   larray2, anynull,
     & status)
C     put blanks in strings if they are undefined.  (contain nulls)
      do ii = 1, nrows
         if (larray2(ii))inskey(ii) = ' '
      end do

      call ftgcfl(iunit, 2, 1, 1, nrows, larray,   larray2, anynull,
     & status)
      call ftgcfb(iunit, 3, 1, 1, nrows, xinarray, larray2, anynull,
     & status)
      call ftgcfb(iunit, 4, 1, 1, nrows, binarray, larray2, anynull,
     & status)
      call ftgcfi(iunit, 5, 1, 1, nrows, iinarray, larray2, anynull,
     & status)
      call ftgcfj(iunit, 6, 1, 1, nrows, kinarray, larray2, anynull,
     & status)
      call ftgcfe(iunit, 7, 1, 1, nrows, einarray, larray2, anynull,
     & status)
      call ftgcfd(iunit, 8, 1, 1, nrows, dinarray, larray2, anynull,
     & status)
      call ftgcfc(iunit, 9, 1, 1, nrows, cinarray, larray2, anynull,
     & status)
      call ftgcfm(iunit, 10,1, 1, nrows, minarray, larray2, anynull,
     & status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') ' Read columns with ftgcf_: '
      do ii = 1, 10
        jj = ichar(xinarray(ii))
        jjj = ichar(binarray(ii))
      write(*,1201)
     & inskey(ii),larray(ii),jj,jjj,iinarray(ii),
     & kinarray(ii), einarray(ii), dinarray(ii), cinarray(ii * 2 -1), 
     & cinarray(ii * 2 ), minarray(ii * 2 -1), minarray(ii * 2)
      end do

      do ii = 11, 21
C don't try to print the NaN values 
        jj = ichar(xinarray(ii))
        jjj = ichar(binarray(ii))
        write(*,1201) inskey(ii), larray(ii), jj,
     &    jjj, iinarray(ii)
      end do
      
      call ftprec(iunit,'key_prec= '// 
     &'''This keyword was written by f_prec'' / comment here',
     & status)

C        ###############################################
C        #  test the insert/delete row/column routines #
C        ###############################################
      
      call ftirow(iunit, 2, 3, status)
         if (status .gt. 0) go to 999

      nrows = 14
      call ftgcvs(iunit, 1, 1, 1, nrows, 'NOT DEFINED',  inskey,
     & anynull, status)
      call ftgcvb(iunit, 4, 1, 1, nrows,bnul,binarray,anynull,status)
      call ftgcvi(iunit, 5, 1, 1, nrows,inul,iinarray,anynull,status)
      call ftgcvj(iunit, 6, 1, 1, nrows, 98, jinarray,anynull,status)
      call ftgcve(iunit, 7, 1, 1, nrows, 98.,einarray,anynull,status)
      call ftgcvd(iunit, 8, 1, 1, nrows,dnul,dinarray,anynull,status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)')'Data values after inserting 3 rows after row 2:'
      do ii = 1, nrows
        jj = ichar(binarray(ii))
        write(*,1202)  inskey(ii), jj,
     &      iinarray(ii), jinarray(ii), einarray(ii), dinarray(ii)
      end do      
1202  format(1x,a14,3i4,2f5.0)

      call ftdrow(iunit, 10, 2, status)
          if (status .gt. 0)goto 999

      nrows = 12
      call ftgcvs(iunit, 1, 1, 1, nrows, 'NOT DEFINED',  inskey,
     &   anynull, status)
      call ftgcvb(iunit, 4, 1, 1, nrows,bnul,binarray,anynull,status)
      call ftgcvi(iunit, 5, 1, 1, nrows,inul,iinarray,anynull,status)
      call ftgcvj(iunit, 6, 1, 1, nrows, 98,jinarray,anynull,status)
      call ftgcve(iunit, 7, 1, 1, nrows, 98.,einarray,anynull,status)
      call ftgcvd(iunit, 8, 1, 1, nrows,dnul,dinarray,anynull,status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'Data values after deleting 2 rows at row 10: '
      do ii = 1, nrows
        jj = ichar(binarray(ii))
        write(*,1202) inskey(ii), jj,
     &       iinarray(ii), jinarray(ii), einarray(ii), dinarray(ii)
      end do

      call ftdcol(iunit, 6, status)

      call ftgcvs(iunit, 1, 1, 1, nrows, 'NOT DEFINED',  inskey,
     &   anynull, status)
      call ftgcvb(iunit, 4, 1, 1, nrows,bnul,binarray,anynull,status)
      call ftgcvi(iunit, 5, 1, 1, nrows,inul,iinarray,anynull,status)
      call ftgcve(iunit, 6, 1, 1, nrows, 98.,einarray,anynull,status)
      call ftgcvd(iunit, 7, 1, 1, nrows,dnul,dinarray,anynull,status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'Data values after deleting column 6: '
      do ii = 1, nrows
        jj = ichar(binarray(ii))      
        write(*,1203) inskey(ii), jj,
     &       iinarray(ii), einarray(ii), dinarray(ii)
1203  format(1x,a14,2i4,2f5.0)

      end do
      call fticol(iunit, 8, 'INSERT_COL', '1E', status)

      call ftgcvs(iunit, 1, 1, 1, nrows, 'NOT DEFINED',  inskey,
     &   anynull, status)
      call ftgcvb(iunit, 4, 1, 1, nrows,bnul,binarray,anynull,status)
      call ftgcvi(iunit, 5, 1, 1, nrows,inul,iinarray,anynull,status)
      call ftgcve(iunit, 6, 1, 1, nrows, 98.,einarray,anynull,status)
      call ftgcvd(iunit, 7, 1, 1, nrows,dnul,dinarray,anynull,status)
      call ftgcvj(iunit, 8, 1, 1, nrows, 98,jinarray,anynull,status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 'Data values after inserting column 8: '
      do ii = 1, nrows
        jj = ichar(binarray(ii))
        write(*,1204) inskey(ii), jj,
     &    iinarray(ii), einarray(ii), dinarray(ii) , jinarray(ii)
1204  format(1x,a14,2i4,2f5.0,i3)
      end do
      call ftpclu(iunit, 8, 1, 1, 10, status)

      call ftgcvs(iunit, 1, 1, 1, nrows, 'NOT DEFINED',  inskey,
     &   anynull, status)
      call ftgcvb(iunit, 4,1,1,nrows,bnul,binarray,anynull,status)
      call ftgcvi(iunit, 5,1,1,nrows,inul,iinarray,anynull,status)
      call ftgcve(iunit, 6,1,1,nrows,98., einarray,anynull,status)
      call ftgcvd(iunit, 7,1,1,nrows,dnul, dinarray,anynull,status)
      call ftgcvj(iunit, 8,1,1,nrows,98, jinarray,anynull, status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)') 
     &  'Values after setting 1st 10 elements in column 8 = null: '
      do ii = 1, nrows
        jj = ichar(binarray(ii))
        write(*,1204) inskey(ii), jj,
     &      iinarray(ii), einarray(ii), dinarray(ii) , jinarray(ii)
      end do      

C        ####################################################
C        #  insert binary table following the primary array #
C        ####################################################
   
      call ftmahd(iunit,  1, hdutype, status)

      tform(1) = '15A'
      tform(2) = '1L'
      tform(3) = '16X'
      tform(4) = '1B'
      tform(5) = '1I'
      tform(6) = '1J'
      tform(7) = '1E'
      tform(8) = '1D'
      tform(9) = '1C'
      tform(10)= '1M'

      ttype(1) = 'Avalue'
      ttype(2) = 'Lvalue'
      ttype(3) = 'Xvalue'
      ttype(4) = 'Bvalue'
      ttype(5) = 'Ivalue'
      ttype(6) = 'Jvalue'
      ttype(7) = 'Evalue'
      ttype(8) = 'Dvalue'
      ttype(9) = 'Cvalue'
      ttype(10)= 'Mvalue'

      tunit(1)= ' '
      tunit(2)= 'm**2'
      tunit(3)= 'cm'
      tunit(4)= 'erg/s'
      tunit(5)= 'km/s'
      tunit(6)= ' '
      tunit(7)= ' '
      tunit(8)= ' '
      tunit(9)= ' '
      tunit(10)= ' '

      nrows = 20
      tfields = 10
      pcount = 0

      call ftibin(iunit, nrows, tfields, ttype, tform, tunit, 
     & binname, pcount, status)
      write(*,'(1x,A)')' '
      write(*,'(1x,A,I4)') 'ftibin status = ', status
      call ftghdn(iunit, hdunum)
      write(*,'(1x,A,I4)') 'HDU number = ', hdunum

      call ftpkyj(iunit, 'TNULL4', 77, 
     & 'value for undefined pixels', status)
      call ftpkyj(iunit, 'TNULL5', 77, 
     & 'value for undefined pixels', status)
      call ftpkyj(iunit, 'TNULL6', 77, 
     & 'value for undefined pixels', status)

      call ftpkyj(iunit, 'TSCAL4', 1000, 'scaling factor', status)
      call ftpkyj(iunit, 'TSCAL5', 1, 'scaling factor', status)
      call ftpkyj(iunit, 'TSCAL6', 100, 'scaling factor', status)

      call ftpkyj(iunit, 'TZERO4', 0, 'scaling offset', status)
      call ftpkyj(iunit, 'TZERO5', 32768, 'scaling offset', status)
      call ftpkyj(iunit, 'TZERO6', 100, 'scaling offset', status)

      call fttnul(iunit, 4, 77, status)   
C define null value for int cols 
      call fttnul(iunit, 5, 77, status)
      call fttnul(iunit, 6, 77, status)
      
C set scaling 
      scale=1000.
      zero = 0.
      call fttscl(iunit, 4, scale, zero, status)   
      scale=1.
      zero = 32768.
      call fttscl(iunit, 5, scale, zero, status)
      scale=100.
      zero = 100.
      call fttscl(iunit, 6, scale, zero, status)

C  for some reason, it is still necessary to call ftrdef at this point
      call ftrdef(iunit,status)

C        ############################
C        #  write data to columns   #
C        ############################
           
C initialize arrays of values to write to table 
 
      joutarray(1) = 0
      joutarray(2) = 1000
      joutarray(3) = 10000
      joutarray(4) = 32768
      joutarray(5) = 65535


      do ii = 4,6
      
          call ftpclj(iunit, ii, 1, 1, 5, joutarray, status) 
          if (status .eq. 412)then
              write(*,'(1x,A,I4)') 'Overflow writing to column  ', ii
              status = 0
          end if

          call ftpclu(iunit, ii, 6, 1, 1, status)  
C write null value 
      end do

      do jj = 4,6  
        call ftgcvj(iunit, jj, 1,1,6, -999,jinarray,anynull,status)
        write(*,'(1x,6I6)') (jinarray(ii), ii=1,6)
      end do

      write(*,'(1x,A)') ' '
      
C turn off scaling, and read the unscaled values 
      scale = 1.
      zero = 0.
      call fttscl(iunit, 4, scale, zero, status)   
      call fttscl(iunit, 5, scale, zero, status)
      call fttscl(iunit, 6, scale, zero, status)

      do jj = 4,6
        call ftgcvj(iunit, jj,1,1,6,-999,jinarray,anynull,status)       
            write(*,'(1x,6I6)') (jinarray(ii), ii = 1,6)
      end do

      if (status .gt. 0)go to 999

C        ######################################################
C        #  insert image extension following the binary table #
C        ######################################################
      
      bitpix = -32
      naxis = 2
      naxes(1) = 15
      naxes(2) = 25
      call ftiimg(iunit, bitpix, naxis, naxes, status)
      write(*,'(1x,A)')' '
      write(*,'(1x,A,I4)') 
     & ' Create image extension: ftiimg status = ', status
      call ftghdn(iunit, hdunum)
      write(*,'(1x,A,I4)') 'HDU number = ', hdunum

      do jj = 0,29
        do ii = 0,18
          imgarray(ii+1,jj+1) = (jj * 10) + ii
        end do
      end do

      call ftp2di(iunit, 1, 19, naxes(1),naxes(2),imgarray,status)
      write(*,'(1x,A)') ' '
      write(*,'(1x,A,I4)')'Wrote whole 2D array: ftp2di status =',
     &      status

      do jj =1, 30
        do ii = 1, 19
          imgarray(ii,jj) = 0
        end do        
      end do
      
      call ftg2di(iunit,1,0,19,naxes(1),naxes(2),imgarray,anynull,
     &       status)
      write(*,'(1x,A)')' '
      write(*,'(1x,A,I4)')'Read whole 2D array: ftg2di status =',status

      do jj =1, 30
        write (*,1301)(imgarray(ii,jj),ii=1,19)
1301    format(1x,19I4)
      end do

        write(*,'(1x,A)') ' '
      

      do jj =1, 30
        do ii = 1, 19
          imgarray(ii,jj) = 0
        end do        
      end do
      
      do jj =0, 19
        do ii = 0, 9
          imgarray2(ii+1,jj+1) = (jj * (-10)) - ii
        end do        
      end do

      fpixels(1) = 5
      fpixels(2) = 5
      lpixels(1) = 14
      lpixels(2) = 14
      call ftpssi(iunit, 1, naxis, naxes, fpixels, lpixels, 
     &     imgarray2, status)
      write(*,'(1x,A)')' '
      write(*,'(1x,A,I4)')'Wrote subset 2D array: ftpssi status =',
     & status

      call ftg2di(iunit,1,0,19,naxes(1), naxes(2),imgarray,anynull,
     &        status)
      write(*,'(1x,A)')' '
      write(*,'(1x,A,I4)')'Read whole 2D array: ftg2di status =',status

      do jj =1, 30
        write (*,1301)(imgarray(ii,jj),ii=1,19)
      end do
      write(*,'(1x,A)') ' '


      fpixels(1) = 2
      fpixels(2) = 5
      lpixels(1) = 10
      lpixels(2) = 8
      inc(1) = 2
      inc(2) = 3

      do jj = 1,30    
        do ii = 1, 19
          imgarray(ii,jj) = 0
        end do
      end do
      
      call ftgsvi(iunit, 1, naxis, naxes, fpixels, lpixels, inc, 0,
     &       imgarray, anynull, status)
      write(*,'(1x,A)')' '
      write(*,'(1x,A,I4)')
     & 'Read subset of 2D array: ftgsvi status = ',status

      write(*,'(1x,10I5)')(imgarray(ii,1),ii = 1,10)

      
C        ###########################################################
C        #  insert another image extension                         #
C        #  copy the image extension to primary array of tmp file. #
C        #  then delete the tmp file, and the image extension      #
C        ###########################################################
      
      bitpix = 16
      naxis = 2
      naxes(1) = 15
      naxes(2) = 25
      call ftiimg(iunit, bitpix, naxis, naxes, status)
      write(*,'(1x,A)') ' '
      write(*,'(1x,A,I4)')'Create image extension: ftiimg status =',
     &   status
      call ftrdef(iunit, status)
      call ftghdn(iunit, hdunum)
      write(*,'(1x,A,I4)') 'HDU number = ', hdunum


      filename = 't1q2s3v4.tmp'
      call ftinit(tmpunit, filename, 1, status)
      write(*,'(1x,A,I4)')'Create temporary file: ftinit status = ',
     & status

      call ftcopy(iunit, tmpunit, 0, status)
      write(*,'(1x,A)') 
     &  'Copy image extension to primary array of tmp file.'
      write(*,'(1x,A,I4)')'ftcopy status = ',status


      call ftgrec(tmpunit, 1, card, status)
      write(*,'(1x,A)')  card
      call ftgrec(tmpunit, 2, card, status)
      write(*,'(1x,A)')  card
      call ftgrec(tmpunit, 3, card, status)
      write(*,'(1x,A)')  card
      call ftgrec(tmpunit, 4, card, status)
      write(*,'(1x,A)')  card
      call ftgrec(tmpunit, 5, card, status)
      write(*,'(1x,A)')  card
      call ftgrec(tmpunit, 6, card, status)
      write(*,'(1x,A)')  card

      call ftdelt(tmpunit, status)
      write(*,'(1x,A,I4)')'Delete the tmp file: ftdelt status =',status
      call ftdhdu(iunit, hdutype, status)
      write(*,'(1x,A,2I4)')
     &  'Delete the image extension hdutype, status =',
     &         hdutype, status
      call ftghdn(iunit, hdunum)
      write(*,'(1x,A,I4)') 'HDU number = ', hdunum

      
C        ###########################################################
C        #  append bintable extension with variable length columns #
C        ###########################################################
      
      call ftcrhd(iunit, status)
      write(*,'(1x,A,I4)') 'ftcrhd status = ', status

      tform(1)= '1PA'
      tform(2)= '1PL'
      tform(3)= '1PB' 
C Fortran FITSIO doesn't support  1PX 
      tform(4)= '1PB'
      tform(5)= '1PI'
      tform(6)= '1PJ'
      tform(7)= '1PE'
      tform(8)= '1PD'
      tform(9)= '1PC'
      tform(10)= '1PM'

      ttype(1)= 'Avalue'
      ttype(2)= 'Lvalue'
      ttype(3)= 'Xvalue'
      ttype(4)= 'Bvalue'
      ttype(5)= 'Ivalue'
      ttype(6)= 'Jvalue'
      ttype(7)= 'Evalue'
      ttype(8)= 'Dvalue'
      ttype(9)= 'Cvalue'
      ttype(10)= 'Mvalue'

      tunit(1)= ' '
      tunit(2)= 'm**2'
      tunit(3)= 'cm'
      tunit(4)= 'erg/s'
      tunit(5)= 'km/s'
      tunit(6)= ' '
      tunit(7)= ' '
      tunit(8)= ' '
      tunit(9)= ' '
      tunit(10)= ' '

      nrows = 20
      tfields = 10
      pcount = 0

      call ftphbn(iunit, nrows, tfields, ttype, tform, 
     & tunit, binname, pcount, status)
      write(*,'(1x,A,I4)')'Variable length arrays: ftphbn status =',
     & status
      call ftpkyj(iunit, 'TNULL4', 88, 'value for undefined pixels',
     & status)
      call ftpkyj(iunit, 'TNULL5', 88, 'value for undefined pixels',
     & status)
      call ftpkyj(iunit, 'TNULL6', 88, 'value for undefined pixels',
     & status)

C        ############################
C        #  write data to columns   #
C        ############################
            
C initialize arrays of values to write to table 
      iskey='abcdefghijklmnopqrst'

      do ii = 1, 20
      
          boutarray(ii) = char(ii)
          ioutarray(ii) = ii
          joutarray(ii) = ii
          eoutarray(ii) = ii
          doutarray(ii) = ii
      end do

      larray(1) = .false.
      larray(2) = .true.
      larray(3) = .false.
      larray(4) = .false.
      larray(5) = .true.
      larray(6) = .true.
      larray(7) = .false.
      larray(8) = .false.
      larray(9) = .false.
      larray(10) = .true.
      larray(11) = .true.
      larray(12) = .true.
      larray(13) = .false.
      larray(14) = .false.
      larray(15) = .false.
      larray(16) = .false.
      larray(17) = .true.
      larray(18) = .true.
      larray(19) = .true.
      larray(20) = .true.

C      inskey(1) = iskey(1:1)
      inskey(1) = ' '

        call ftpcls(iunit, 1, 1, 1, 1, inskey, status)  
C write string values 
        call ftpcll(iunit, 2, 1, 1, 1, larray, status)  
C write logicals 
        call ftpclx(iunit, 3, 1, 1, 1, larray, status)  
C write bits 
        call ftpclb(iunit, 4, 1, 1, 1, boutarray, status)
        call ftpcli(iunit, 5, 1, 1, 1, ioutarray, status) 
        call ftpclj(iunit, 6, 1, 1, 1, joutarray, status) 
        call ftpcle(iunit, 7, 1, 1, 1, eoutarray, status)
        call ftpcld(iunit, 8, 1, 1, 1, doutarray, status)

      do ii = 2, 20   
C loop over rows 1 - 20 
      
        inskey(1) =  iskey(1:ii)
        call ftpcls(iunit, 1, ii, 1, ii, inskey, status)  
C write string values 

        call ftpcll(iunit, 2, ii, 1, ii, larray, status)  
C write logicals 
        call ftpclu(iunit, 2, ii, ii-1, 1, status)

        call ftpclx(iunit, 3, ii, 1, ii, larray, status)  
C write bits 

        call ftpclb(iunit, 4, ii, 1, ii, boutarray, status)
        call ftpclu(iunit, 4, ii, ii-1, 1, status)

        call ftpcli(iunit, 5, ii, 1, ii, ioutarray, status) 
        call ftpclu(iunit, 5, ii, ii-1, 1, status)

        call ftpclj(iunit, 6, ii, 1, ii, joutarray, status) 
        call ftpclu(iunit, 6, ii, ii-1, 1, status)

        call ftpcle(iunit, 7, ii, 1, ii, eoutarray, status)
        call ftpclu(iunit, 7, ii, ii-1, 1, status)

        call ftpcld(iunit, 8, ii, 1, ii, doutarray, status)
        call ftpclu(iunit, 8, ii, ii-1, 1, status)
      end do

C     it is no longer necessary to update the PCOUNT keyword;
C     FITSIO now does this automatically when the HDU is closed.
C     call ftmkyj(iunit,'PCOUNT',4446, '&',status)
      write(*,'(1x,A,I4)') 'ftpcl_ status = ', status

C        #################################
C        #  close then reopen this HDU   #
C        #################################

       call ftmrhd(iunit, -1, hdutype, status)
       call ftmrhd(iunit,  1, hdutype, status)

C        #############################
C        #  read data from columns   #
C        #############################
      

      call ftgkyj(iunit, 'PCOUNT', pcount, comm, status)
      write(*,'(1x,A,I4)') 'PCOUNT = ', pcount
      
C initialize the variables to be read 
      inskey(1) =' '
      iskey = ' '

      do jj = 1, ii
          larray(jj) = .false.
          boutarray(jj) = char(0)
          ioutarray(jj) = 0
          joutarray(jj) = 0
          eoutarray(jj) = 0
          doutarray(jj) = 0
      end do      

      call ftghdn(iunit, hdunum)
      write(*,'(1x,A,I4)') 'HDU number = ', hdunum

      do ii = 1, 20   
C loop over rows 1 - 20 
      
        do jj = 1, ii
          larray(jj) = .false.
          boutarray(jj) = char(0)
          ioutarray(jj) = 0
          joutarray(jj) = 0
          eoutarray(jj) = 0
          doutarray(jj) = 0
        end do      

        call ftgcvs(iunit, 1, ii, 1,1,iskey,inskey,anynull,status)
        write(*,'(1x,2A,I4)') 'A  ', inskey(1), status

        call ftgcl( iunit, 2, ii, 1, ii, larray, status) 
        write(*,1400)'L',status,(larray(jj),jj=1,ii)
1400    format(1x,a1,i3,20l3)
1401    format(1x,a1,21i3)

        call ftgcx(iunit, 3, ii, 1, ii, larray, status)
        write(*,1400)'X',status,(larray(jj),jj=1,ii)

        bnul = char(99)
        call ftgcvb(iunit, 4, ii, 1,ii,bnul,boutarray,anynull,status)
        do jj = 1,ii
          jinarray(jj) = ichar(boutarray(jj))
        end do
        write(*,1401)'B',(jinarray(jj),jj=1,ii),status

        inul = 99
        call ftgcvi(iunit, 5, ii, 1,ii,inul,ioutarray,anynull,status)
        write(*,1401)'I',(ioutarray(jj),jj=1,ii),status

        call ftgcvj(iunit, 6, ii, 1, ii,99,joutarray,anynull,status)
        write(*,1401)'J',(joutarray(jj),jj=1,ii),status

        call ftgcve(iunit, 7, ii, 1,ii,99.,eoutarray,anynull,status)
        estatus=status
        write(*,1402)'E',(eoutarray(jj),jj=1,ii),estatus
1402    format(1x,a1,1x,21f3.0)

        dnul = 99.
        call ftgcvd(iunit, 8, ii,1,ii,dnul,doutarray,anynull,status)
        estatus=status
        write(*,1402)'D',(doutarray(jj),jj=1,ii),estatus

        call ftgdes(iunit, 8, ii, repeat, offset, status)
        write(*,'(1x,A,2I5)')'Column 8 repeat and offset =',
     &       repeat,offset
      end do

C        #####################################
C        #  create another image extension   #
C        #####################################
      

      bitpix = 32
      naxis = 2
      naxes(1) = 10
      naxes(2) = 2
      npixels = 20
 
      call ftiimg(iunit, bitpix, naxis, naxes, status)
      write(*,'(1x,A)')' '
      write(*,'(1x,A,I4)')'Create image extension: ftiimg status =',
     &       status
      
C initialize arrays of values to write to primary array 
      do ii = 1, npixels
          boutarray(ii) = char(ii * 2 -2)
          ioutarray(ii) = ii * 2 -2
          joutarray(ii) = ii * 2 -2
          koutarray(ii) = ii * 2 -2
          eoutarray(ii) = ii * 2 -2
          doutarray(ii) = ii * 2 -2
      end do      

C write a few pixels with each datatype 
      call ftpprb(iunit, 1, 1,  2, boutarray(1),  status)
      call ftppri(iunit, 1, 3,  2, ioutarray(3),  status)
      call ftpprj(iunit, 1, 5,  2, koutarray(5),  status)
      call ftppri(iunit, 1, 7,  2, ioutarray(7),  status)
      call ftpprj(iunit, 1, 9,  2, joutarray(9),  status)
      call ftppre(iunit, 1, 11, 2, eoutarray(11), status)
      call ftpprd(iunit, 1, 13, 2, doutarray(13), status)
      write(*,'(1x,A,I4)') 'ftppr status = ', status

      
C read back the pixels with each datatype 
      bnul = char(0)
      inul = 0
      knul = 0
      jnul = 0
      enul = 0.
      dnul = 0.

      call ftgpvb(iunit, 1,  1,  14, bnul, binarray, anynull, status)
      call ftgpvi(iunit, 1,  1,  14, inul, iinarray, anynull, status)
      call ftgpvj(iunit, 1,  1,  14, knul, kinarray, anynull, status)
      call ftgpvj(iunit, 1,  1,  14, jnul, jinarray, anynull, status)
      call ftgpve(iunit, 1,  1,  14, enul, einarray, anynull, status)
      call ftgpvd(iunit, 1,  1,  14, dnul, dinarray, anynull, status)

      write(*,'(1x,A)')' '
      write(*,'(1x,A)')
     &   'Image values written with ftppr and read with ftgpv:'
      npixels = 14
      do jj = 1,ii
          joutarray(jj) = ichar(binarray(jj))
      end do

      write(*,1501)(joutarray(ii),ii=1,npixels),anynull,'(byte)'
1501  format(1x,14i3,l3,1x,a)
      write(*,1501)(iinarray(ii),ii=1,npixels),anynull,'(short)'
      write(*,1501)(kinarray(ii),ii=1,npixels),anynull,'(int)'
      write(*,1501)(jinarray(ii),ii=1,npixels),anynull,'(long)'
      write(*,1502)(einarray(ii),ii=1,npixels),anynull,'(float)'
      write(*,1502)(dinarray(ii),ii=1,npixels),anynull,'(double)'
1502  format(2x,14f3.0,l2,1x,a)

C      ##########################################
C      #  test world coordinate system routines #
C      ##########################################

      xrval = 45.83D+00
      yrval =  63.57D+00
      xrpix =  256.D+00
      yrpix =  257.D+00
      xinc =   -.00277777D+00
      yinc =   .00277777D+00

C     write the WCS keywords 
C     use example values from the latest WCS document 
      call ftpkyd(iunit, 'CRVAL1', xrval, 10, 'comment', status)
      call ftpkyd(iunit, 'CRVAL2', yrval, 10, 'comment', status)
      call ftpkyd(iunit, 'CRPIX1', xrpix, 10, 'comment', status)
      call ftpkyd(iunit, 'CRPIX2', yrpix, 10, 'comment', status)
      call ftpkyd(iunit, 'CDELT1', xinc, 10, 'comment', status)
      call ftpkyd(iunit, 'CDELT2', yinc, 10, 'comment', status)
C     call ftpkyd(iunit, 'CROTA2', rot, 10, 'comment', status) 
      call ftpkys(iunit, 'CTYPE1', xctype, 'comment', status)
      call ftpkys(iunit, 'CTYPE2', yctype, 'comment', status)
      write(*,'(1x,A)')' '
      write(*,'(1x,A,I4)')'Wrote WCS keywords status =', status

C     reset value, to make sure they are reread correctly
      xrval =  0.D+00
      yrval =  0.D+00
      xrpix =  0.D+00
      yrpix =  0.D+00
      xinc =   0.D+00
      yinc =   0.D+00
      rot =    67.D+00

      call ftgics(iunit, xrval, yrval, xrpix,
     &      yrpix, xinc, yinc, rot, ctype, status)
      write(*,'(1x,A,I4)')'Read WCS keywords with ftgics status =',
     &  status

      xpix = 0.5D+00
      ypix = 0.5D+00

      call ftwldp(xpix,ypix,xrval,yrval,xrpix,yrpix,xinc,yinc,
     &     rot,ctype, xpos, ypos,status)

      write(*,'(1x,A,2f8.3)')'  CRVAL1, CRVAL2 =', xrval,yrval
      write(*,'(1x,A,2f8.3)')'  CRPIX1, CRPIX2 =', xrpix,yrpix
      write(*,'(1x,A,2f12.8)')'  CDELT1, CDELT2 =', xinc,yinc
      write(*,'(1x,A,f8.3,2A)')'  Rotation =',rot,' CTYPE =',ctype
      write(*,'(1x,A,I4)')'Calculated sky coord. with ftwldp status =',
     &   status
      write(*,6501)xpix,ypix,xpos,ypos
6501  format('  Pixels (',f10.6,f10.6,') --> (',f10.6,f10.6,') Sky')

      call ftxypx(xpos,ypos,xrval,yrval,xrpix,yrpix,xinc,yinc,
     &     rot,ctype, xpix, ypix,status)
      write(*,'(1x,A,I4)')
     & 'Calculated pixel coord. with ftxypx status =', status
      write(*,6502)xpos,ypos,xpix,ypix
6502  format('  Sky (',f10.6,f10.6,') --> (',f10.6,f10.6,') Pixels')

     
C        ######################################
C        #  append another ASCII table        #
C        ######################################
      

      tform(1)= 'A15'
      tform(2)= 'I11'
      tform(3)= 'F15.6'
      tform(4)= 'E13.5'
      tform(5)= 'D22.14'

      tbcol(1)= 1
      tbcol(2)= 17
      tbcol(3)= 29
      tbcol(4)= 45
      tbcol(5)= 59
      rowlen = 80

      ttype(1)= 'Name'
      ttype(2)= 'Ivalue'
      ttype(3)= 'Fvalue'
      ttype(4)= 'Evalue'
      ttype(5)= 'Dvalue'

      tunit(1)= ' '
      tunit(2)= 'm**2'
      tunit(3)= 'cm'
      tunit(4)= 'erg/s'
      tunit(5)= 'km/s'

      nrows = 11
      tfields = 5
      tblname = 'new_table'

      call ftitab(iunit, rowlen, nrows, tfields, ttype, tbcol, 
     & tform, tunit, tblname, status)
      write(*,'(1x,A)') ' '
      write(*,'(1x,A,I4)') 'ftitab status = ', status

      call ftpcls(iunit, 1, 1, 1, 3, onskey, status)  
C write string values 

C initialize arrays of values to write to primary array 
      
      do ii = 1,npixels
          boutarray(ii) = char(ii * 3 -3)
          ioutarray(ii) = ii * 3 -3
          joutarray(ii) = ii * 3 -3
          koutarray(ii) = ii * 3 -3
          eoutarray(ii) = ii * 3 -3
          doutarray(ii) = ii * 3 -3
      end do

      do ii = 2,5 
C loop over cols 2 - 5 
      
          call ftpclb(iunit,  ii, 1, 1, 2, boutarray,  status) 
          call ftpcli(iunit,  ii, 3, 1, 2,ioutarray(3),status)
          call ftpclj(iunit,  ii, 5, 1, 2,joutarray(5),status)
          call ftpcle(iunit,  ii, 7, 1, 2,eoutarray(7),status)
          call ftpcld(iunit,  ii, 9, 1, 2,doutarray(9),status)
      end do
      write(*,'(1x,A,I4)') 'ftpcl status = ', status
      
C read back the pixels with each datatype 
      call ftgcvb(iunit,   2, 1, 1, 10, bnul, binarray,anynull,
     & status)
      call ftgcvi(iunit,  2, 1, 1, 10, inul, iinarray,anynull,
     & status)
      call ftgcvj(iunit,    3, 1, 1, 10, knul, kinarray,anynull,
     & status)
      call ftgcvj(iunit,    3, 1, 1, 10, jnul, jinarray,anynull,
     & status)
      call ftgcve(iunit,   4, 1, 1, 10, enul, einarray,anynull,
     & status)
      call ftgcvd(iunit, 5, 1, 1, 10, dnul, dinarray,anynull,
     & status)

      write(*,'(1x,A)') 
     &'Column values written with ftpcl and read with ftgcl: '
      npixels = 10
      do ii = 1,npixels
         joutarray(ii) = ichar(binarray(ii))
      end do
      write(*,1601)(joutarray(ii),ii = 1, npixels),anynull,'(byte) '
      write(*,1601)(iinarray(ii),ii = 1, npixels),anynull,'(short) '
      write(*,1601)(kinarray(ii),ii = 1, npixels),anynull,'(int) '
      write(*,1601)(jinarray(ii),ii = 1, npixels),anynull,'(long) '
      write(*,1602)(einarray(ii),ii = 1, npixels),anynull,'(float) '
      write(*,1602)(dinarray(ii),ii = 1, npixels),anynull,'(double) '
1601  format(1x,10i3,l3,1x,a)
1602  format(2x,10f3.0,l2,1x,a)
      
C        ###########################################################
C        #  perform stress test by cycling thru all the extensions #
C        ###########################################################
      write(*,'(1x,A)')' '
      write(*,'(1x,A)')'Repeatedly move to the 1st 4 HDUs of the file: '

      do ii = 1,10
        call ftmahd(iunit,  1, hdutype, status)
        call ftghdn(iunit, hdunum)
        call ftmrhd(iunit,  1, hdutype, status)
        call ftghdn(iunit, hdunum)
        call ftmrhd(iunit,  1, hdutype, status)
        call ftghdn(iunit, hdunum)
        call ftmrhd(iunit,  1, hdutype, status)
        call ftghdn(iunit, hdunum)
        call ftmrhd(iunit, -1, hdutype, status)
        call ftghdn(iunit, hdunum)
        if (status .gt. 0) go to 999
      end do
      
      write(*,'(1x,A)') ' '

      checksum = 1234567890.D+00
      call ftesum(checksum, .false., asciisum)
      write(*,'(1x,A,F13.1,2A)')'Encode checksum: ',checksum,' -> ',
     &  asciisum
      checksum = 0
      call ftdsum(asciisum, 0, checksum)
      write(*,'(1x,3A,F13.1)') 'Decode checksum: ',asciisum,' -> ',
     & checksum

      call ftpcks(iunit, status)

C         don't print the CHECKSUM value because it is different every day
C         because the current date is in the comment field.

         call ftgcrd(iunit, 'CHECKSUM', card, status)
C         write(*,'(1x,A)') card

      call ftgcrd(iunit, 'DATASUM', card, status)
      write(*,'(1x,A)') card(1:22)

      call ftgcks(iunit, datsum, checksum, status)
      write(*,'(1x,A,F13.1,I4)') 'ftgcks data checksum, status = ',
     &         datsum, status

      call ftvcks(iunit, datastatus, hdustatus, status) 
      write(*,'(1x,A,3I4)')'ftvcks datastatus, hdustatus, status =  ',
     &          datastatus, hdustatus, status
 
      call ftprec(iunit,
     & 'new_key = ''written by fxprec'' / to change checksum',status)
      call ftucks(iunit, status)
      write(*,'(1x,A,I4)') 'ftupck status = ', status

      call ftgcrd(iunit, 'DATASUM', card, status)
      write(*,'(1x,A)') card(1:22)
      call ftvcks(iunit, datastatus, hdustatus, status) 
      write(*,'(1x,A,3I4)') 'ftvcks datastatus, hdustatus, status =  ',
     &          datastatus, hdustatus, status
 
C        delete the checksum keywords, so that the FITS file is always
C        the same, regardless of the date of when testprog is run.
      
      call ftdkey(iunit, 'CHECKSUM', status)
      call ftdkey(iunit, 'DATASUM',  status)


C        ############################
C        #  close file and quit     #
C        ############################
      

999   continue  
C jump here on error 

      call ftclos(iunit, status) 
      write(*,'(1x,A,I4)') 'ftclos status = ', status
      write(*,'(1x,A)')' '

      write(*,'(1x,A)')
     &  'Normally, there should be 8 error messages on the'
      write(*,'(1x,A)') 'stack all regarding ''numerical overflows'':'

      call ftgmsg(errmsg)
      nmsg = 0

998   continue
      if (errmsg .ne. ' ')then      
          write(*,'(1x,A)') errmsg
          nmsg = nmsg + 1
          call ftgmsg(errmsg)
          go to 998
      end if

      if (nmsg .ne. 8)write(*,'(1x,A)')
     & ' WARNING: Did not find the expected 8 error messages!'

      call ftgerr(status, errmsg)
      write(*,'(1x,A)')' '
      write(*,'(1x,A,I4,2A)') 'Status =', status,': ', errmsg(1:50)
      end
cfitsio-3.47/testf77.out0000644000225700000360000010122313464573432014443 0ustar  cagordonlhea FITSIO TESTPROG
  
 Try opening then closing a nonexistent file: 
   ftopen iunit, status (expect an error) =  15 104
   ftclos status =  104
  
 ftinit create new file status =    0
  
 test writing of long string keywords: 
 123456789012345678901234567890123456789012345678901234567890123456789012345   
 '12345678901234567890123456789012345678901234567890123456789012345678'        
 1234567890123456789012345678901234567890123456789012345678901234'6789012345   
 '1234567890123456789012345678901234567890123456789012345678901234''67'        
 1234567890123456789012345678901234567890123456789012345678901234''789012345   
 '1234567890123456789012345678901234567890123456789012345678901234'''''        
 1234567890123456789012345678901234567890123456789012345678901234567'9012345   
 '1234567890123456789012345678901234567890123456789012345678901234567'         
 Wrote all Keywords successfully 
 ftflus status =    0
  
 HDU number =    1
 Values read back from primary array (99 = null pixel)
 The 1st, and every 4th pixel should be undefined: 
  99  2  3 99  5  6  7 99  9 10 11 99 13 14 15 99 17 18 19 99  T (ftgpvb) 
  99  2  3 99  5  6  7 99  9 10 11 99 13 14 15 99 17 18 19 99  T (ftgpvi) 
  99  2  3 99  5  6  7 99  9 10 11 99 13 14 15 99 17 18 19 99  T (ftgpvj) 
  99. 2. 3.99. 5. 6. 7.99. 9.10.11.99.13.14.15.99.17.18.19.99. T (ftgpve) 
  99. 2. 3.99. 5. 6. 7.99. 9.10.11.99.13.14.15.99.17.18.19.99. T (ftgpvd) 
   0  2  3  0  5  6  7  0  9 10 11  0 13 14 15  0 17 18 19  0  T (ftgpfb)
   0  2  3  0  5  6  7  0  9 10 11  0 13 14 15  0 17 18 19  0  T (ftgpfi)
   0  2  3  0  5  6  7  0  9 10 11  0 13 14 15  0 17 18 19  0  T (ftgpfj)
   0. 2. 3. 0. 5. 6. 7. 0. 9.10.11. 0.13.14.15. 0.17.18.19. 0. T (ftgpfe)
   0. 2. 3. 0. 5. 6. 7. 0. 9.10.11. 0.13.14.15. 0.17.18.19. 0. T (ftgpfd)
  
 Closed then reopened the FITS file 10 times.
  
 HDU number =    1
 Read back keywords: 
 simple, bitpix, naxis, naxes =    T  32   2  10   2
   pcount, gcount, extend =    0   1   T
 KEY_PREC= 'This keyword was written by fxprec' / comment goes here            
 KEY_PREC 'This keyword was written by fxprec comment goes here   
 KEY_PREC= 'This keyword was written by fxprec' / comment goes here            
 KY_PKNS1 :'first string' :fxpkns comment  
 KEY_PKYS :value_string         :fxpkys comment     0
 KEY_PKYL :   T:fxpkyl comment     0
 KEY_PKYJ :  11:fxpkyj comment     0
 KEY_PKYE :    11.00000:fxpkyj comment     0
 KEY_PKYD :    11.00000:fxpkyj comment     0
 KEY_PKYS :value_string         :fxpkys comment     0
 KEY_PKYL :   T:fxpkyl comment     0
 KEY_PKYJ :  11:fxpkyj comment     0
 KEY_PKYE :    13.13131:fxpkye comment     0
 KEY_PKYD :    15.15152:fxpkyd comment     0
 KEY_PKYF :    12.12121:fxpkyf comment     0
 KEY_PKYE :    13.13131:fxpkye comment     0
 KEY_PKYG : 14.141414141414:fxpkyg comment     0
 KEY_PKYD : 15.151515151515:fxpkyd comment     0
 KEY_PKYT  :  12345678:0.12345678901235fxpkyt comment     0
 KEY_PKYJ :  11:[km/s/Mpc] fxpkyj comment                0
 keyword unit=km/s/Mpc          
 KEY_PKYJ :  11:fxpkyj comment                           0
 keyword unit=                  
 KEY_PKYJ :  11:[feet/second/second] fxpkyj comment      0
 keyword unit=feet/second/second
 KEY_PKLS long string value = This is a very long string value that is continued
  over more than one keyword.                                          
 header contains   61 keywords; located at keyword   23
 ftgkns: first string  second string               
 ftgknl:    T   F   T
 ftgknj:   11  12  13
 ftgkne:   13.13131  14.14141  15.15152
 ftgknd:   15.15152  16.16162  17.17172
  
 Before deleting the HISTORY and DATE keywords...
 COMMENT 
 HISTORY 
 DATE    
 KY_PKNS1
  
 After deleting the keywords... 
 COMMENT This keyword was written by fxpcom.                                   
 KY_PKNS1= 'first string'       / fxpkns comment                               
  
 After inserting the keywords... 
 COMMENT   continued over multiple keywords.  The HEASARC convention uses the &
 KY_IREC = 'This keyword inserted by fxirec'                                   
 KY_IKYS = 'insert_value_string' / ikys comment                                
 KY_IKYJ =                   49 / ikyj comment                                 
 KY_IKYL =                    T / ikyl comment                                 
 KY_IKYE =           1.2346E+01 / ikye comment                                 
 KY_IKYD = 1.23456789012346E+01 / ikyd comment                                 
 KY_IKYF =              12.3456 / ikyf comment                                 
 KY_IKYG =     12.3456789012346 / ikyg comment                                 
 COMMENT   character at the end of each substring which is then continued      
  
 After modifying the keywords... 
 COMMENT   This keyword was modified by fxmrec                                 
 KY_MREC = 'This keyword was modified by fxmcrd'                               
 NEWIKYS = 'modified_string'    / ikys comment                                 
 KY_IKYJ =                   50 / This is a modified comment                   
 KY_IKYL =                    F / ikyl comment                                 
 KY_IKYE =          -1.2346E+01 / ikye comment                                 
 KY_IKYD = -1.23456789012346E+01 / modified comment                            
 KY_IKYF =             -12.3456 / ikyf comment                                 
 KY_IKYG =    -12.3456789012346 / ikyg comment                                 
 COMMENT   character at the end of each substring which is then continued      
  
 After updating the keywords... 
 COMMENT   This keyword was modified by fxmrec                                 
 KY_UCRD = 'This keyword was updated by fxucrd'                                
 NEWIKYS = 'updated_string'     / ikys comment                                 
 KY_IKYJ =                   51 / This is a modified comment                   
 KY_IKYL =                    T / ikyl comment                                 
 KY_IKYE =          -1.3346E+01 / ikye comment                                 
 KY_IKYD = -1.33456789012346E+01 / modified comment                            
 KY_IKYF =             -13.3456 / ikyf comment                                 
 KY_IKYG =    -13.3456789012346 / ikyg comment                                 
 COMMENT   character at the end of each substring which is then continued      
  
 Keywords found using wildcard search (should be 9)...
 KEY_PKYS= 'value_string'       / fxpkys comment                               
 KEY_PKYL=                    T / fxpkyl comment                               
 KEY_PKYJ=                   11 / [feet/second/second] fxpkyj comment          
 KEY_PKYF=             12.12121 / fxpkyf comment                               
 KEY_PKYE=         1.313131E+01 / fxpkye comment                               
 KEY_PKYG=    14.14141414141414 / fxpkyg comment                               
 KEY_PKYD= 1.51515151515152E+01 / fxpkyd comment                               
 NEWIKYS = 'updated_string'     / ikys comment                                 
 KEY_PKYT= 12345678.1234567890123456 / fxpkyt comment                          
  
 ftibin status =    0
 HDU number =    2
 header contains   33 keywords located at keyword    1
 header contains   33 keywords with room for   74 more
 TDIM3 = (1,2,8)                 3   1   2   8
 ftpcl_ status =    0
  
 Find the column numbers a returned status value of 237 is
 expected and indicates that more than one column name matches
 the input column name template.  Status = 219 indicates that
 there was no matching column name.
 Column Xvalue is number   3 status =   0
 Column Avalue is number   1 status =  237
 Column Lvalue is number   2 status =  237
 Column Xvalue is number   3 status =  237
 Column Bvalue is number   4 status =  237
 Column Ivalue is number   5 status =  237
 Column Jvalue is number   6 status =  237
 Column Evalue is number   7 status =  237
 Column Dvalue is number   8 status =  237
 Column Cvalue is number   9 status =  237
 Column Mvalue is number  10 status =  237
 Column        is number   0 status =  219
  
 Information about each column: 
 15A  16  15  15 Avalue       A      1.00    0.00  1234554321        
 1L   14   1   1 Lvalue m**2  L      1.00    0.00  1234554321        
 16X   1  16   1 Xvalue cm    X      1.00    0.00  1234554321        
 1B   11   1   1 Bvalue erg/s B      1.00    0.00          99        
 1I   21   1   2 Ivalue km/s  I      1.00    0.00          99        
 1J   41   1   4 Jvalue       J      1.00    0.00          99        
 1E   42   1   4 Evalue       E      1.00    0.00  1234554321        
 1D   82   1   8 Dvalue       D      1.00    0.00  1234554321        
 1C   83   1   8 Cvalue       C      1.00    0.00  1234554321        
 1M  163   1  16 Mvalue       M      1.00    0.00  1234554321        
  
 ftitab status =    0
 HDU number =    2
 ftpcl_ status =    0
  
 ASCII table: rowlen, nrows, tfields, extname: 76 11  5 Test-ASCII     
 Name      1 A15           
 Ivalue   17 I10    m**2   
 Fvalue   28 F14.6  cm     
 Evalue   43 E12.5  erg/s  
 Dvalue   56 D21.14 km/s   
  
 Data values read from ASCII table: 
 first string     1  1  1  1. 1.
 second string    2  2  2  2. 2.
                  3  3  3  3. 3.
 UNDEFINED        4  4  4  4. 4.
                  5  5  5  5. 5.
                  6  6  6  6. 6.
                  7  7  7  7. 7.
                  8  8  8  8. 8.
                  9  9  9  9. 9.
                 10 10 10 10.10.
                 99 99 99 99.99.
  
       1       1.000000  1.00000E+00  1.00000000000000E+00second string        
  
 Column name is number   1 status =    0
 Column Ivalue is number   2 status =  237
 Column Fvalue is number   3 status =  237
 Column Evalue is number   4 status =  237
 Column Dvalue is number   5 status =  237
 Column        is number   0 status =  219
 A15      16   1  15 Name     1            1.00      0.00 null1   
 I10      41   1  10 Ivalue  17 m**2       1.00      0.00 null2   
 F14.6    82   1  14 Fvalue  28 cm         1.00      0.00 null3   
 E12.5    42   1  12 Evalue  43 erg/s      1.00      0.00 null4   
 D21.14   82   1  21 Dvalue  56 km/s       1.00      0.00 null5   
  
  
 Data values after inserting 3 rows after row 2:
 first string     1  1  1  1. 1.
 second string    2  2  2  2. 2.
                  0  0  0  0. 0.
                  0  0  0  0. 0.
                  0  0  0  0. 0.
                  3  3  3  3. 3.
 UNDEFINED        4  4  4  4. 4.
                  5  5  5  5. 5.
                  6  6  6  6. 6.
                  7  7  7  7. 7.
                  8  8  8  8. 8.
                  9  9  9  9. 9.
                 10 10 10 10.10.
                 99 99 99 99.99.
  
 Data values after deleting 2 rows at row 10: 
 first string     1  1  1  1. 1.
 second string    2  2  2  2. 2.
                  0  0  0  0. 0.
                  0  0  0  0. 0.
                  0  0  0  0. 0.
                  3  3  3  3. 3.
 UNDEFINED        4  4  4  4. 4.
                  5  5  5  5. 5.
                  6  6  6  6. 6.
                  9  9  9  9. 9.
                 10 10 10 10.10.
                 99 99 99 99.99.
  
 Data values after deleting column 3: 
 first string     1  1  1. 1.
 second string    2  2  2. 2.
                  0  0  0. 0.
                  0  0  0. 0.
                  0  0  0. 0.
                  3  3  3. 3.
 UNDEFINED        4  4  4. 4.
                  5  5  5. 5.
                  6  6  6. 6.
                  9  9  9. 9.
                 10 10 10.10.
                 99 99 99.99.
  
  Data values after inserting column 5: 
 first string     1  1  1. 1. 0
 second string    2  2  2. 2. 0
                  0  0  0. 0. 0
                  0  0  0. 0. 0
                  0  0  0. 0. 0
                  3  3  3. 3. 0
 UNDEFINED        4  4  4. 4. 0
                  5  5  5. 5. 0
                  6  6  6. 6. 0
                  9  9  9. 9. 0
                 10 10 10.10. 0
                 99 99 99.99. 0
 HDU number =    3
  
 Moved to binary table
 header contains   37 keywords with room for   70 more 
  
 Binary table: nrows, tfields, extname, pcount:  21  10Test-BINTABLE     0
 Avalue         15A                           
 Lvalue         1L             m**2           
 Xvalue         16X            cm             
 Bvalue         1B             erg/s          
 Ivalue         1I             km/s           
 Jvalue         1J                            
 Evalue         1E                            
 Dvalue         1D                            
 Cvalue         1C                            
 Mvalue         1M                            
  
 Data values read from binary table: 
  Bit column (X) data values:   
 FTFFTTFF FTTTFFFF TTTTFFFF FTTTTTFF FFFFFFFF
   
 null string column value (should be blank):                              
  
 Read columns with ftgcv_: 
 first string     F  76   1   1   1   1.   1.   1.  -2.   1.  -2.
 second string    T 112   2   2   2   2.   2.   3.  -4.   3.  -4.
                  F 240   3   3   3   3.   3.   5.  -6.   5.  -6.
 NOT DEFINED      F 124   0  -4  -4  -4.  -4.   7.  -8.   7.  -8.
 NOT DEFINED      T   0   5   5   5   5.   5.   9. -10.   9. -10.
 NOT DEFINED      T   0   0  -6  -6  -6.  -6.  11. -12.  11. -12.
 NOT DEFINED      F   0   7   7   7   7.   7.  13. -14.  13. -14.
 NOT DEFINED      F   0   0  -8  -8  -8.  -8.  15. -16.  15. -16.
 NOT DEFINED      F   0   9   9   9   9.   9.  17. -18.  17. -18.
 NOT DEFINED      T   0   0 -10 -10 -10. -10.  19. -20.  19. -20.
 NOT DEFINED      F   0  98  98  98  98.  98.   0.   0.   0.   0.
 NOT DEFINED      T   0  12  12  12  12.  12.   0.   0.   0.   0.
 NOT DEFINED      F   0  98  98  98  98.  98.   0.   0.   0.   0.
 NOT DEFINED      F   0   0 -14 -14 -14. -14.   0.   0.   0.   0.
 NOT DEFINED      F   0  98  98  98  98.  98.   0.   0.   0.   0.
 NOT DEFINED      F   0   0 -16 -16 -16. -16.   0.   0.   0.   0.
 NOT DEFINED      T   0  98  98  98  98.  98.   0.   0.   0.   0.
 NOT DEFINED      T   0   0 -18 -18 -18. -18.   0.   0.   0.   0.
 NOT DEFINED      T   0  98  98  98  98.  98.   0.   0.   0.   0.
 NOT DEFINED      T   0   0 -20 -20 -20. -20.   0.   0.   0.   0.
 NOT DEFINED      F   0  98  98  98  98.  98.   0.   0.   0.   0.
  
  Read columns with ftgcf_: 
 first string     F  76   1   1   1   1.   1.   1.  -2.   1.  -2.
 second string    T 112   2   2   2   2.   2.   3.  -4.   3.  -4.
                  F 240   3   3   3   3.   3.   5.  -6.   5.  -6.
                  F 124   0  -4  -4  -4.  -4.   7.  -8.   7.  -8.
                  T   0   5   5   5   5.   5.   9. -10.   9. -10.
                  T   0   0  -6  -6  -6.  -6.  11. -12.  11. -12.
                  F   0   7   7   7   7.   7.  13. -14.  13. -14.
                  F   0   0  -8  -8  -8.  -8.  15. -16.  15. -16.
                  F   0   9   9   9   9.   9.  17. -18.  17. -18.
                  T   0   0 -10 -10 -10. -10.  19. -20.  19. -20.
                  F   0  99  99
                  T   0  12  12
                  F   0  99  99
                  F   0   0 -14
                  F   0  99  99
                  F   0   0 -16
                  T   0  99  99
                  T   0   0 -18
                  T   0  99  99
                  T   0   0 -20
                  F   0  99  99
  
 Data values after inserting 3 rows after row 2:
 first string     1   1   1   1.   1.
 second string    2   2   2   2.   2.
 NOT DEFINED      0   0   0   0.   0.
 NOT DEFINED      0   0   0   0.   0.
 NOT DEFINED      0   0   0   0.   0.
                  3   3   3   3.   3.
 NOT DEFINED      0  -4  -4  -4.  -4.
 NOT DEFINED      5   5   5   5.   5.
 NOT DEFINED      0  -6  -6  -6.  -6.
 NOT DEFINED      7   7   7   7.   7.
 NOT DEFINED      0  -8  -8  -8.  -8.
 NOT DEFINED      9   9   9   9.   9.
 NOT DEFINED      0 -10 -10 -10. -10.
 NOT DEFINED     98  98  98  98.  98.
  
 Data values after deleting 2 rows at row 10: 
 first string     1   1   1   1.   1.
 second string    2   2   2   2.   2.
 NOT DEFINED      0   0   0   0.   0.
 NOT DEFINED      0   0   0   0.   0.
 NOT DEFINED      0   0   0   0.   0.
                  3   3   3   3.   3.
 NOT DEFINED      0  -4  -4  -4.  -4.
 NOT DEFINED      5   5   5   5.   5.
 NOT DEFINED      0  -6  -6  -6.  -6.
 NOT DEFINED      9   9   9   9.   9.
 NOT DEFINED      0 -10 -10 -10. -10.
 NOT DEFINED     98  98  98  98.  98.
  
 Data values after deleting column 6: 
 first string     1   1   1.   1.
 second string    2   2   2.   2.
 NOT DEFINED      0   0   0.   0.
 NOT DEFINED      0   0   0.   0.
 NOT DEFINED      0   0   0.   0.
                  3   3   3.   3.
 NOT DEFINED      0  -4  -4.  -4.
 NOT DEFINED      5   5   5.   5.
 NOT DEFINED      0  -6  -6.  -6.
 NOT DEFINED      9   9   9.   9.
 NOT DEFINED      0 -10 -10. -10.
 NOT DEFINED     98  98  98.  98.
  
 Data values after inserting column 8: 
 first string     1   1   1.   1.  0
 second string    2   2   2.   2.  0
 NOT DEFINED      0   0   0.   0.  0
 NOT DEFINED      0   0   0.   0.  0
 NOT DEFINED      0   0   0.   0.  0
                  3   3   3.   3.  0
 NOT DEFINED      0  -4  -4.  -4.  0
 NOT DEFINED      5   5   5.   5.  0
 NOT DEFINED      0  -6  -6.  -6.  0
 NOT DEFINED      9   9   9.   9.  0
 NOT DEFINED      0 -10 -10. -10.  0
 NOT DEFINED     98  98  98.  98.  0
  
 Values after setting 1st 10 elements in column 8 = null: 
 first string     1   1   1.   1. 98
 second string    2   2   2.   2. 98
 NOT DEFINED      0   0   0.   0. 98
 NOT DEFINED      0   0   0.   0. 98
 NOT DEFINED      0   0   0.   0. 98
                  3   3   3.   3. 98
 NOT DEFINED      0  -4  -4.  -4. 98
 NOT DEFINED      5   5   5.   5. 98
 NOT DEFINED      0  -6  -6.  -6. 98
 NOT DEFINED      9   9   9.   9. 98
 NOT DEFINED      0 -10 -10. -10.  0
 NOT DEFINED     98  98  98.  98.  0
  
 ftibin status =    0
 HDU number =    2
      0  1000 10000 33000 66000  -999
      0  1000 10000 32768 65535  -999
      0  1000 10000 32800 65500  -999
  
      0     1    10    33    66  -999
 -32768-31768-22768     0 32767  -999
     -1     9    99   327   654  -999
  
  Create image extension: ftiimg status =    0
 HDU number =    3
  
 Wrote whole 2D array: ftp2di status =   0
  
 Read whole 2D array: ftg2di status =   0
    0   1   2   3   4   5   6   7   8   9  10  11  12  13  14   0   0   0   0
   10  11  12  13  14  15  16  17  18  19  20  21  22  23  24   0   0   0   0
   20  21  22  23  24  25  26  27  28  29  30  31  32  33  34   0   0   0   0
   30  31  32  33  34  35  36  37  38  39  40  41  42  43  44   0   0   0   0
   40  41  42  43  44  45  46  47  48  49  50  51  52  53  54   0   0   0   0
   50  51  52  53  54  55  56  57  58  59  60  61  62  63  64   0   0   0   0
   60  61  62  63  64  65  66  67  68  69  70  71  72  73  74   0   0   0   0
   70  71  72  73  74  75  76  77  78  79  80  81  82  83  84   0   0   0   0
   80  81  82  83  84  85  86  87  88  89  90  91  92  93  94   0   0   0   0
   90  91  92  93  94  95  96  97  98  99 100 101 102 103 104   0   0   0   0
  100 101 102 103 104 105 106 107 108 109 110 111 112 113 114   0   0   0   0
  110 111 112 113 114 115 116 117 118 119 120 121 122 123 124   0   0   0   0
  120 121 122 123 124 125 126 127 128 129 130 131 132 133 134   0   0   0   0
  130 131 132 133 134 135 136 137 138 139 140 141 142 143 144   0   0   0   0
  140 141 142 143 144 145 146 147 148 149 150 151 152 153 154   0   0   0   0
  150 151 152 153 154 155 156 157 158 159 160 161 162 163 164   0   0   0   0
  160 161 162 163 164 165 166 167 168 169 170 171 172 173 174   0   0   0   0
  170 171 172 173 174 175 176 177 178 179 180 181 182 183 184   0   0   0   0
  180 181 182 183 184 185 186 187 188 189 190 191 192 193 194   0   0   0   0
  190 191 192 193 194 195 196 197 198 199 200 201 202 203 204   0   0   0   0
  200 201 202 203 204 205 206 207 208 209 210 211 212 213 214   0   0   0   0
  210 211 212 213 214 215 216 217 218 219 220 221 222 223 224   0   0   0   0
  220 221 222 223 224 225 226 227 228 229 230 231 232 233 234   0   0   0   0
  230 231 232 233 234 235 236 237 238 239 240 241 242 243 244   0   0   0   0
  240 241 242 243 244 245 246 247 248 249 250 251 252 253 254   0   0   0   0
    0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
    0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
    0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
    0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
    0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
  
  
 Wrote subset 2D array: ftpssi status =   0
  
 Read whole 2D array: ftg2di status =   0
    0   1   2   3   4   5   6   7   8   9  10  11  12  13  14   0   0   0   0
   10  11  12  13  14  15  16  17  18  19  20  21  22  23  24   0   0   0   0
   20  21  22  23  24  25  26  27  28  29  30  31  32  33  34   0   0   0   0
   30  31  32  33  34  35  36  37  38  39  40  41  42  43  44   0   0   0   0
   40  41  42  43   0  -1  -2  -3  -4  -5  -6  -7  -8  -9  54   0   0   0   0
   50  51  52  53 -10 -11 -12 -13 -14 -15 -16 -17 -18 -19  64   0   0   0   0
   60  61  62  63 -20 -21 -22 -23 -24 -25 -26 -27 -28 -29  74   0   0   0   0
   70  71  72  73 -30 -31 -32 -33 -34 -35 -36 -37 -38 -39  84   0   0   0   0
   80  81  82  83 -40 -41 -42 -43 -44 -45 -46 -47 -48 -49  94   0   0   0   0
   90  91  92  93 -50 -51 -52 -53 -54 -55 -56 -57 -58 -59 104   0   0   0   0
  100 101 102 103 -60 -61 -62 -63 -64 -65 -66 -67 -68 -69 114   0   0   0   0
  110 111 112 113 -70 -71 -72 -73 -74 -75 -76 -77 -78 -79 124   0   0   0   0
  120 121 122 123 -80 -81 -82 -83 -84 -85 -86 -87 -88 -89 134   0   0   0   0
  130 131 132 133 -90 -91 -92 -93 -94 -95 -96 -97 -98 -99 144   0   0   0   0
  140 141 142 143 144 145 146 147 148 149 150 151 152 153 154   0   0   0   0
  150 151 152 153 154 155 156 157 158 159 160 161 162 163 164   0   0   0   0
  160 161 162 163 164 165 166 167 168 169 170 171 172 173 174   0   0   0   0
  170 171 172 173 174 175 176 177 178 179 180 181 182 183 184   0   0   0   0
  180 181 182 183 184 185 186 187 188 189 190 191 192 193 194   0   0   0   0
  190 191 192 193 194 195 196 197 198 199 200 201 202 203 204   0   0   0   0
  200 201 202 203 204 205 206 207 208 209 210 211 212 213 214   0   0   0   0
  210 211 212 213 214 215 216 217 218 219 220 221 222 223 224   0   0   0   0
  220 221 222 223 224 225 226 227 228 229 230 231 232 233 234   0   0   0   0
  230 231 232 233 234 235 236 237 238 239 240 241 242 243 244   0   0   0   0
  240 241 242 243 244 245 246 247 248 249 250 251 252 253 254   0   0   0   0
    0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
    0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
    0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
    0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
    0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
  
  
 Read subset of 2D array: ftgsvi status =    0
    41   43   -1   -3   -5   71   73  -31  -33  -35
  
 Create image extension: ftiimg status =   0
 HDU number =    4
 Create temporary file: ftinit status =    0
 Copy image extension to primary array of tmp file.
 ftcopy status =    0
 SIMPLE  =                    T / file does conform to FITS standard           
 BITPIX  =                   16 / number of bits per data pixel                
 NAXIS   =                    2 / number of data axes                          
 NAXIS1  =                   15 / length of data axis 1                        
 NAXIS2  =                   25 / length of data axis 2                        
 EXTEND  =                    T / FITS dataset may contain extensions          
 Delete the tmp file: ftdelt status =   0
 Delete the image extension hdutype, status =   1   0
 HDU number =    4
 ftcrhd status =    0
 Variable length arrays: ftphbn status =   0
 ftpcl_ status =    0
 PCOUNT = 4446
 HDU number =    6
 A                                   0
 L  0  F
 X  0  F
 B  1  0
 I  1  0
 J  1  0
 E  1. 0.
 D  1. 0.
 Column 8 repeat and offset =    1   14
 A  ab                               0
 L  0  F  T
 X  0  F  T
 B 99  2  0
 I 99  2  0
 J 99  2  0
 E 99. 2. 0.
 D 99. 2. 0.
 Column 8 repeat and offset =    2   49
 A  abc                              0
 L  0  F  F  F
 X  0  F  T  F
 B  1 99  3  0
 I  1 99  3  0
 J  1 99  3  0
 E  1.99. 3. 0.
 D  1.99. 3. 0.
 Column 8 repeat and offset =    3  105
 A  abcd                             0
 L  0  F  T  F  F
 X  0  F  T  F  F
 B  1  2 99  4  0
 I  1  2 99  4  0
 J  1  2 99  4  0
 E  1. 2.99. 4. 0.
 D  1. 2.99. 4. 0.
 Column 8 repeat and offset =    4  182
 A  abcde                            0
 L  0  F  T  F  F  T
 X  0  F  T  F  F  T
 B  1  2  3 99  5  0
 I  1  2  3 99  5  0
 J  1  2  3 99  5  0
 E  1. 2. 3.99. 5. 0.
 D  1. 2. 3.99. 5. 0.
 Column 8 repeat and offset =    5  280
 A  abcdef                           0
 L  0  F  T  F  F  F  T
 X  0  F  T  F  F  T  T
 B  1  2  3  4 99  6  0
 I  1  2  3  4 99  6  0
 J  1  2  3  4 99  6  0
 E  1. 2. 3. 4.99. 6. 0.
 D  1. 2. 3. 4.99. 6. 0.
 Column 8 repeat and offset =    6  399
 A  abcdefg                          0
 L  0  F  T  F  F  T  F  F
 X  0  F  T  F  F  T  T  F
 B  1  2  3  4  5 99  7  0
 I  1  2  3  4  5 99  7  0
 J  1  2  3  4  5 99  7  0
 E  1. 2. 3. 4. 5.99. 7. 0.
 D  1. 2. 3. 4. 5.99. 7. 0.
 Column 8 repeat and offset =    7  539
 A  abcdefgh                         0
 L  0  F  T  F  F  T  T  F  F
 X  0  F  T  F  F  T  T  F  F
 B  1  2  3  4  5  6 99  8  0
 I  1  2  3  4  5  6 99  8  0
 J  1  2  3  4  5  6 99  8  0
 E  1. 2. 3. 4. 5. 6.99. 8. 0.
 D  1. 2. 3. 4. 5. 6.99. 8. 0.
 Column 8 repeat and offset =    8  700
 A  abcdefghi                        0
 L  0  F  T  F  F  T  T  F  F  F
 X  0  F  T  F  F  T  T  F  F  F
 B  1  2  3  4  5  6  7 99  9  0
 I  1  2  3  4  5  6  7 99  9  0
 J  1  2  3  4  5  6  7 99  9  0
 E  1. 2. 3. 4. 5. 6. 7.99. 9. 0.
 D  1. 2. 3. 4. 5. 6. 7.99. 9. 0.
 Column 8 repeat and offset =    9  883
 A  abcdefghij                       0
 L  0  F  T  F  F  T  T  F  F  F  T
 X  0  F  T  F  F  T  T  F  F  F  T
 B  1  2  3  4  5  6  7  8 99 10  0
 I  1  2  3  4  5  6  7  8 99 10  0
 J  1  2  3  4  5  6  7  8 99 10  0
 E  1. 2. 3. 4. 5. 6. 7. 8.99.10. 0.
 D  1. 2. 3. 4. 5. 6. 7. 8.99.10. 0.
 Column 8 repeat and offset =   10 1087
 A  abcdefghijk                      0
 L  0  F  T  F  F  T  T  F  F  F  F  T
 X  0  F  T  F  F  T  T  F  F  F  T  T
 B  1  2  3  4  5  6  7  8  9 99 11  0
 I  1  2  3  4  5  6  7  8  9 99 11  0
 J  1  2  3  4  5  6  7  8  9 99 11  0
 E  1. 2. 3. 4. 5. 6. 7. 8. 9.99.11. 0.
 D  1. 2. 3. 4. 5. 6. 7. 8. 9.99.11. 0.
 Column 8 repeat and offset =   11 1312
 A  abcdefghijkl                     0
 L  0  F  T  F  F  T  T  F  F  F  T  F  T
 X  0  F  T  F  F  T  T  F  F  F  T  T  T
 B  1  2  3  4  5  6  7  8  9 10 99 12  0
 I  1  2  3  4  5  6  7  8  9 10 99 12  0
 J  1  2  3  4  5  6  7  8  9 10 99 12  0
 E  1. 2. 3. 4. 5. 6. 7. 8. 9.10.99.12. 0.
 D  1. 2. 3. 4. 5. 6. 7. 8. 9.10.99.12. 0.
 Column 8 repeat and offset =   12 1558
 A  abcdefghijklm                    0
 L  0  F  T  F  F  T  T  F  F  F  T  T  F  F
 X  0  F  T  F  F  T  T  F  F  F  T  T  T  F
 B  1  2  3  4  5  6  7  8  9 10 11 99 13  0
 I  1  2  3  4  5  6  7  8  9 10 11 99 13  0
 J  1  2  3  4  5  6  7  8  9 10 11 99 13  0
 E  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.99.13. 0.
 D  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.99.13. 0.
 Column 8 repeat and offset =   13 1825
 A  abcdefghijklmn                   0
 L  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F
 X  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F
 B  1  2  3  4  5  6  7  8  9 10 11 12 99 14  0
 I  1  2  3  4  5  6  7  8  9 10 11 12 99 14  0
 J  1  2  3  4  5  6  7  8  9 10 11 12 99 14  0
 E  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.99.14. 0.
 D  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.99.14. 0.
 Column 8 repeat and offset =   14 2113
 A  abcdefghijklmno                  0
 L  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F  F
 X  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F  F
 B  1  2  3  4  5  6  7  8  9 10 11 12 13 99 15  0
 I  1  2  3  4  5  6  7  8  9 10 11 12 13 99 15  0
 J  1  2  3  4  5  6  7  8  9 10 11 12 13 99 15  0
 E  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.13.99.15. 0.
 D  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.13.99.15. 0.
 Column 8 repeat and offset =   15 2422
 A  abcdefghijklmnop                 0
 L  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F  F  F
 X  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F  F  F
 B  1  2  3  4  5  6  7  8  9 10 11 12 13 14 99 16  0
 I  1  2  3  4  5  6  7  8  9 10 11 12 13 14 99 16  0
 J  1  2  3  4  5  6  7  8  9 10 11 12 13 14 99 16  0
 E  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.13.14.99.16. 0.
 D  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.13.14.99.16. 0.
 Column 8 repeat and offset =   16 2752
 A  abcdefghijklmnopq                0
 L  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F  F  F  T
 X  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F  F  F  T
 B  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 99 17  0
 I  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 99 17  0
 J  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 99 17  0
 E  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.13.14.15.99.17. 0.
 D  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.13.14.15.99.17. 0.
 Column 8 repeat and offset =   17 3104
 A  abcdefghijklmnopqr               0
 L  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F  F  F  F  T
 X  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F  F  F  T  T
 B  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 99 18  0
 I  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 99 18  0
 J  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 99 18  0
 E  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.13.14.15.16.99.18. 0.
 D  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.13.14.15.16.99.18. 0.
 Column 8 repeat and offset =   18 3477
 A  abcdefghijklmnopqrs              0
 L  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F  F  F  T  F  T
 X  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F  F  F  T  T  T
 B  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 99 19  0
 I  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 99 19  0
 J  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 99 19  0
 E  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.13.14.15.16.17.99.19. 0.
 D  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.13.14.15.16.17.99.19. 0.
 Column 8 repeat and offset =   19 3871
 A  abcdefghijklmnopqrst             0
 L  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F  F  F  T  T  F  T
 X  0  F  T  F  F  T  T  F  F  F  T  T  T  F  F  F  F  T  T  T  T
 B  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 99 20  0
 I  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 99 20  0
 J  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 99 20  0
 E  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.13.14.15.16.17.18.99.20. 0.
 D  1. 2. 3. 4. 5. 6. 7. 8. 9.10.11.12.13.14.15.16.17.18.99.20. 0.
 Column 8 repeat and offset =   20 4286
  
 Create image extension: ftiimg status =   0
 ftppr status =    0
  
 Image values written with ftppr and read with ftgpv:
   0  2  4  6  8 10 12 14 16 18 20 22 24 26  F (byte)
   0  2  4  6  8 10 12 14 16 18 20 22 24 26  F (short)
   0  2  4  6  8 10 12 14 16 18 20 22 24 26  F (int)
   0  2  4  6  8 10 12 14 16 18 20 22 24 26  F (long)
   0. 2. 4. 6. 8.10.12.14.16.18.20.22.24.26. F (float)
   0. 2. 4. 6. 8.10.12.14.16.18.20.22.24.26. F (double)
  
 Wrote WCS keywords status =   0
 Read WCS keywords with ftgics status =   0
   CRVAL1, CRVAL2 =  45.830  63.570
   CRPIX1, CRPIX2 = 256.000 257.000
   CDELT1, CDELT2 = -0.00277777  0.00277777
   Rotation =   0.000 CTYPE =-TAN    
 Calculated sky coord. with ftwldp status =   0
  Pixels (  0.500000  0.500000) --> ( 47.385204 62.848968) Sky
 Calculated pixel coord. with ftxypx status =   0
  Sky ( 47.385204 62.848968) --> (  0.500000  0.500000) Pixels
  
 ftitab status =    0
 ftpcl status =    0
 Column values written with ftpcl and read with ftgcl: 
   0  3  6  9 12 15 18 21 24 27  F (byte) 
   0  3  6  9 12 15 18 21 24 27  F (short) 
   0  3  6  9 12 15 18 21 24 27  F (int) 
   0  3  6  9 12 15 18 21 24 27  F (long) 
   0. 3. 6. 9.12.15.18.21.24.27. F (float) 
   0. 3. 6. 9.12.15.18.21.24.27. F (double) 
  
 Repeatedly move to the 1st 4 HDUs of the file: 
  
 Encode checksum:  1234567890.0 -> dCW2fBU0dBU0dBU0 
 Decode checksum: dCW2fBU0dBU0dBU0  ->  1234567890.0
 DATASUM = '2338390162'
 ftgcks data checksum, status =  2338390162.0   0
 ftvcks datastatus, hdustatus, status =     1   1   0
 ftupck status =    0
 DATASUM = '2338390162'
 ftvcks datastatus, hdustatus, status =     1   1   0
 ftclos status =    0
  
 Normally, there should be 8 error messages on the
 stack all regarding 'numerical overflows':
 Numerical overflow during type conversion while writing FITS data.         
 Numerical overflow during type conversion while writing FITS data.         
 Numerical overflow during type conversion while writing FITS data.         
 Numerical overflow during type conversion while writing FITS data.         
 Numerical overflow during type conversion while writing FITS data.         
 Numerical overflow during type conversion while writing FITS data.         
 Numerical overflow during type conversion while writing FITS data.         
 Numerical overflow during type conversion while writing FITS data.         
  
 Status =   0: OK - no error                                     
cfitsio-3.47/testf77.std0000644000225700000360000020130013464573432014423 0ustar  cagordonlheaSIMPLE  =                    T / file does conform to FITS standard             BITPIX  =                   32 / number of bits per data pixel                  NAXIS   =                    2 / number of data axes                            NAXIS1  =                   10 / length of data axis 1                          NAXIS2  =                    2 / length of data axis 2                          EXTEND  =                    T / FITS dataset may contain extensions            COMMENT   FITS (Flexible Image Transport System) format is defined in 'AstronomyCOMMENT   and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H KEY_PREC= 'This keyword was written by fxprec' / comment goes here              CARD1   = '12345678901234567890123456789012345678901234567890123456789012345678'CARD2   = '1234567890123456789012345678901234567890123456789012345678901234''67'CARD3   = '1234567890123456789012345678901234567890123456789012345678901234'''''CARD4   = '1234567890123456789012345678901234567890123456789012345678901234567' KEY_PKYS= 'value_string'       / fxpkys comment                                 KEY_PKYL=                    T / fxpkyl comment                                 KEY_PKYJ=                   11 / [feet/second/second] fxpkyj comment            KEY_PKYF=             12.12121 / fxpkyf comment                                 KEY_PKYE=         1.313131E+01 / fxpkye comment                                 KEY_PKYG=    14.14141414141414 / fxpkyg comment                                 KEY_PKYD= 1.51515151515152E+01 / fxpkyd comment                                 KEY_PKLS= 'This is a very long string value that is continued over more than o&'CONTINUE  'ne keyword.'        / fxpkls comment                                 LONGSTRN= 'OGIP 1.0'           / The HEASARC Long String Convention may be used.COMMENT   This FITS file may contain long string keyword values that are        COMMENT   This keyword was modified by fxmrec                                   KY_UCRD = 'This keyword was updated by fxucrd'                                  NEWIKYS = 'updated_string'     / ikys comment                                   KY_IKYJ =                   51 / This is a modified comment                     KY_IKYL =                    T / ikyl comment                                   KY_IKYE =          -1.3346E+01 / ikye comment                                   KY_IKYD = -1.33456789012346E+01 / modified comment                              KY_IKYF =             -13.3456 / ikyf comment                                   KY_IKYG =    -13.3456789012346 / ikyg comment                                   COMMENT   character at the end of each substring which is then continued        COMMENT   on the next keyword which has the name CONTINUE.                      KEY_PKYT= 12345678.1234567890123456 / fxpkyt comment                            COMMENT This keyword was written by fxpcom.                                     KY_PKNS1= 'first string'       / fxpkns comment                                 KY_PKNS2= 'second string'      / fxpkns comment                                 KY_PKNS3= '        '           / fxpkns comment                                 KY_PKNL1=                    T / fxpknl comment                                 KY_PKNL2=                    F / fxpknl comment                                 KY_PKNL3=                    T / fxpknl comment                                 KY_PKNJ1=                   11 / fxpknj comment                                 KY_PKNJ2=                   12 / fxpknj comment                                 KY_PKNJ3=                   13 / fxpknj comment                                 KY_PKNF1=             12.12121 / fxpknf comment                                 KY_PKNF2=             13.13131 / fxpknf comment                                 KY_PKNF3=             14.14141 / fxpknf comment                                 KY_PKNE1=         1.313131E+01 / fxpkne comment                                 KY_PKNE2=         1.414141E+01 / fxpkne comment                                 KY_PKNE3=         1.515152E+01 / fxpkne comment                                 KY_PKNG1=     14.1414141414141 / fxpkng comment                                 KY_PKNG2=     15.1515151515152 / fxpkng comment                                 KY_PKNG3=     16.1616161616162 / fxpkng comment                                 KY_PKND1= 1.51515151515152E+01 / fxpknd comment                                 KY_PKND2= 1.61616161616162E+01 / fxpknd comment                                 KY_PKND3= 1.71717171717172E+01 / fxpknd comment                                 TSTRING = '1       '           / tstring comment                                TLOGICAL=                    T / tlogical comment                               TBYTE   =                   11 / tbyte comment                                  TSHORT  =                   21 / tshort comment                                 TINT    =                   31 / tint comment                                   TLONG   =                   41 / tlong comment                                  TFLOAT  =         4.200000E+01 / tfloat comment                                 TDOUBLE = 8.20000000000000E+01 / tdouble comment                                BLANK   =                  -99 / value to use for undefined pixels              END                                                                                                                                                                                                                                                                                                                                                                                                             ÿÿÿÿÿÿÿÿÿ	
ÿÿÿ
ÿÿÿÿÿÿXTENSION= 'BINTABLE'           / binary table extension                         BITPIX  =                    8 / 8-bit bytes                                    NAXIS   =                    2 / 2-dimensional binary table                     NAXIS1  =                   61 / width of table in bytes                        NAXIS2  =                   20 / number of rows in table                        PCOUNT  =                    0 / size of special data area                      GCOUNT  =                    1 / one data group (required keyword)              TFIELDS =                   10 / number of fields in each row                   TTYPE1  = 'Avalue  '           / label for field   1                            TFORM1  = '15A     '           / data format of field: ASCII Character          TTYPE2  = 'Lvalue  '           / label for field   2                            TFORM2  = '1L      '           / data format of field: 1-byte LOGICAL           TUNIT2  = 'm**2    '           / physical unit of field                         TTYPE3  = 'Xvalue  '           / label for field   3                            TFORM3  = '16X     '           / data format of field: BIT                      TUNIT3  = 'cm      '           / physical unit of field                         TTYPE4  = 'Bvalue  '           / label for field   4                            TFORM4  = '1B      '           / data format of field: BYTE                     TUNIT4  = 'erg/s   '           / physical unit of field                         TTYPE5  = 'Ivalue  '           / label for field   5                            TFORM5  = '1I      '           / data format of field: 2-byte INTEGER           TUNIT5  = 'km/s    '           / physical unit of field                         TTYPE6  = 'Jvalue  '           / label for field   6                            TFORM6  = '1J      '           / data format of field: 4-byte INTEGER           TTYPE7  = 'Evalue  '           / label for field   7                            TFORM7  = '1E      '           / data format of field: 4-byte REAL              TTYPE8  = 'Dvalue  '           / label for field   8                            TFORM8  = '1D      '           / data format of field: 8-byte DOUBLE            TTYPE9  = 'Cvalue  '           / label for field   9                            TFORM9  = '1C      '           / data format of field: COMPLEX                  TTYPE10 = 'Mvalue  '           / label for field  10                            TFORM10 = '1M      '           / data format of field: DOUBLE COMPLEX           EXTNAME = 'Test-BINTABLE'      / name of this binary table extension            TNULL4  =                   77 / value for undefined pixels                     TNULL5  =                   77 / value for undefined pixels                     TNULL6  =                   77 / value for undefined pixels                     TSCAL4  =                 1000 / scaling factor                                 TSCAL5  =                    1 / scaling factor                                 TSCAL6  =                  100 / scaling factor                                 TZERO4  =                    0 / scaling offset                                 TZERO5  =                32768 / scaling offset                                 TZERO6  =                  100 / scaling offset                                 END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             €ÿÿÿÿƒè	
§c!GBÿŽMMMXTENSION= 'IMAGE   '           / IMAGE extension                                BITPIX  =                  -32 / number of bits per data pixel                  NAXIS   =                    2 / number of data axes                            NAXIS1  =                   15 / length of data axis 1                          NAXIS2  =                   25 / length of data axis 2                          PCOUNT  =                    0 / required keyword; must = 0                     GCOUNT  =                    1 / required keyword; must = 1                     NEW_KEY = 'written by fxprec' / to change checksum                              END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             ?€@@@@€@ @À@àAAA A0A@APA`A A0A@APA`ApA€AˆAA˜A A¨A°A¸AÀA A¨A°A¸AÀAÈAÐAØAàAèAðAøBBBAðAøBBBBBBBBB B$B(B,B0B B$B(B,¿€ÀÀ@À€À ÀÀÀàÁÁBXBHBLBPBTÁ Á0Á@ÁPÁ`ÁpÁ€ÁˆÁÁ˜B€BpBtBxB|Á Á¨Á°Á¸ÁÀÁÈÁÐÁØÁàÁèB”BŒBŽBB’ÁðÁøÂÂÂÂÂÂÂÂB¨B B¢B¤B¦Â Â$Â(Â,Â0Â4Â8Â<Â@ÂDB¼B´B¶B¸BºÂHÂLÂPÂTÂXÂ\Â`ÂdÂhÂlBÐBÈBÊBÌBÎÂpÂtÂxÂ|€‚„†ˆŠBäBÜBÞBàB⌎’”–˜šœžBøBðBòBôBö ¢¤¦¨ª¬®°²CCCCC´¶¸º¼¾ÂÀÂÂÂÄÂÆCCC
CCCCCCCCCCCCCCCCCCCCCCCC C!C"C#C$C C!C"C#C$C%C&C'C(C)C*C+C,C-C.C*C+C,C-C.C/C0C1C2C3C4C5C6C7C8C4C5C6C7C8C9C:C;C<C=C>C?C@CACBC>C?C@CACBCCCDCECFCGCHCICJCKCLCHCICJCKCLCMCNCOCPCQCRCSCTCUCVCRCSCTCUCVCWCXCYCZC[C\C]C^C_C`C\C]C^C_C`CaCbCcCdCeCfCgChCiCjCfCgChCiCjCkClCmCnCoCpCqCrCsCtCpCqCrCsCtCuCvCwCxCyCzC{C|C}C~XTENSION= 'TABLE   '           / ASCII table extension                          BITPIX  =                    8 / 8-bit ASCII characters                         NAXIS   =                    2 / 2-dimensional ASCII table                      NAXIS1  =                   76 / width of table in characters                   NAXIS2  =                   12 / number of rows in table                        PCOUNT  =                    0 / no group parameters (required keyword)         GCOUNT  =                    1 / one data group (required keyword)              TFIELDS =                    5 / number of fields in each row                   TTYPE1  = 'Name    '           / label for field   1                            TBCOL1  =                    1 / beginning column of field   1                  TFORM1  = 'A15     '           / Fortran-77 format of field                     TTYPE2  = 'Ivalue  '           / label for field   2                            TBCOL2  =                   17 / beginning column of field   2                  TFORM2  = 'I10     '           / Fortran-77 format of field                     TUNIT2  = 'm**2    '           / physical unit of field                         TTYPE3  = 'Evalue  '           / label for field   4                            TBCOL3  =                   28 / beginning column of field   4                  TFORM3  = 'E12.5   '           / Fortran-77 format of field                     TUNIT3  = 'erg/s   '           / physical unit of field                         TTYPE4  = 'Dvalue  '           / label for field   5                            TBCOL4  =                   41 / beginning column of field   5                  TFORM4  = 'D21.14  '           / Fortran-77 format of field                     TUNIT4  = 'km/s    '           / physical unit of field                         EXTNAME = 'Test-ASCII'         / name of this ASCII table extension             TNULL1  = 'null1   '           / value for undefined pixels                     TNULL2  = 'null2   '           / value for undefined pixels                     TNULL3  = 'null4   '           / value for undefined pixels                     TNULL4  = 'null5   '           / value for undefined pixels                     TTYPE5  = 'INSERT_COL'         / label for field                                TFORM5  = 'F14.6   '           / format of field                                TBCOL5  =                   63 / beginning column of field                      END                                                                                                                                                                                                                                                                                                                                                                                                             first string             1  1.00000E+00  1.00000000000000E+00               second string            2  2.00000E+00  2.00000000000000E+00                                                                                                                                                                                                                                                                            3  3.00000E+00  3.00000000000000E+00               null1                    4  4.00000E+00  4.00000000000000E+00                                        5  5.00000E+00  5.00000000000000E+00                                        6  6.00000E+00  6.00000000000000E+00                                        9  9.00000E+00  9.00000000000000E+00                                       10  1.00000E+01  1.00000000000000E+01                               null2      null4        null5                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                               XTENSION= 'BINTABLE'           / binary table extension                         BITPIX  =                    8 / 8-bit bytes                                    NAXIS   =                    2 / 2-dimensional binary table                     NAXIS1  =                   61 / width of table in bytes                        NAXIS2  =                   22 / number of rows in table                        PCOUNT  =                    0 / size of special data area                      GCOUNT  =                    1 / one data group (required keyword)              TFIELDS =                   10 / number of fields in each row                   TTYPE1  = 'Avalue  '           / label for field   1                            TFORM1  = '15A     '           / data format of field: ASCII Character          TTYPE2  = 'Lvalue  '           / label for field   2                            TFORM2  = '1L      '           / data format of field: 1-byte LOGICAL           TUNIT2  = 'm**2    '           / physical unit of field                         TTYPE3  = 'Xvalue  '           / label for field   3                            TFORM3  = '16X     '           / data format of field: BIT                      TUNIT3  = 'cm      '           / physical unit of field                         TTYPE4  = 'Bvalue  '           / label for field   4                            TFORM4  = '1B      '           / data format of field: BYTE                     TUNIT4  = 'erg/s   '           / physical unit of field                         TTYPE5  = 'Ivalue  '           / label for field   5                            TFORM5  = '1I      '           / data format of field: 2-byte INTEGER           TUNIT5  = 'km/s    '           / physical unit of field                         TTYPE6  = 'Evalue  '           / label for field   7                            TFORM6  = '1E      '           / data format of field: 4-byte REAL              TTYPE7  = 'Dvalue  '           / label for field   8                            TFORM7  = '1D      '           / data format of field: 8-byte DOUBLE            TTYPE9  = 'Cvalue  '           / label for field   9                            TFORM9  = '1C      '           / data format of field: COMPLEX                  TTYPE10 = 'Mvalue  '           / label for field  10                            TFORM10 = '1M      '           / data format of field: DOUBLE COMPLEX           EXTNAME = 'Test-BINTABLE'      / name of this binary table extension            TNULL4  =                   99 / value for undefined pixels                     TNULL5  =                   99 / value for undefined pixels                     TDIM3   = '(1,2,8) '           / size of the multidimensional array             KEY_PREC= 'This keyword was written by f_prec' / comment here                   TTYPE8  = 'INSERT_COL'         / label for field                                TFORM8  = '1E      '           / format of field                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             first string   FLp?€?ðÿÿÿÿ?€À?ðÀsecond string  Tð|@@ÿÿÿÿ@@À€@Àÿÿÿÿÿÿÿÿÿÿÿÿ               F@@@ÿÿÿÿ@ ÀÀ@À              FÿüÀ€Àÿÿÿÿ@àÁ@À T@ @ÿÿÿÿAÁ @"À$TÿúÀÀÀÿÿÿÿA0Á@@&À(F		A@"ÿÿÿÿAˆÁ@1À2TÿöÁ À$A˜Á @3À4ccÿÿÿÿÿÿÿÿÿÿÿÿTA@@(FccÿÿÿÿÿÿÿÿÿÿÿÿFÿòÁ`À,FccÿÿÿÿÿÿÿÿÿÿÿÿFÿðÁ€À0TccÿÿÿÿÿÿÿÿÿÿÿÿTÿîÁÀ2TccÿÿÿÿÿÿÿÿÿÿÿÿTÿìÁ À4FccÿÿÿÿÿÿÿÿÿÿÿÿXTENSION= 'BINTABLE'           / binary table extension                         BITPIX  =                    8 / 8-bit bytes                                    NAXIS   =                    2 / 2-dimensional binary table                     NAXIS1  =                   80 / width of table in bytes                        NAXIS2  =                   20 / number of rows in table                        PCOUNT  =                 4446 / size of special data area                      GCOUNT  =                    1 / one data group (required keyword)              TFIELDS =                   10 / number of fields in each row                   TTYPE1  = 'Avalue  '           / label for field   1                            TFORM1  = '1PA(20) '           / data format of field: variable length array    TTYPE2  = 'Lvalue  '           / label for field   2                            TFORM2  = '1PL(20) '           / data format of field: variable length array    TUNIT2  = 'm**2    '           / physical unit of field                         TTYPE3  = 'Xvalue  '           / label for field   3                            TFORM3  = '1PB(3)  '           / data format of field: variable length array    TUNIT3  = 'cm      '           / physical unit of field                         TTYPE4  = 'Bvalue  '           / label for field   4                            TFORM4  = '1PB(20) '           / data format of field: variable length array    TUNIT4  = 'erg/s   '           / physical unit of field                         TTYPE5  = 'Ivalue  '           / label for field   5                            TFORM5  = '1PI(20) '           / data format of field: variable length array    TUNIT5  = 'km/s    '           / physical unit of field                         TTYPE6  = 'Jvalue  '           / label for field   6                            TFORM6  = '1PJ(20) '           / data format of field: variable length array    TTYPE7  = 'Evalue  '           / label for field   7                            TFORM7  = '1PE(20) '           / data format of field: variable length array    TTYPE8  = 'Dvalue  '           / label for field   8                            TFORM8  = '1PD(20) '           / data format of field: variable length array    TTYPE9  = 'Cvalue  '           / label for field   9                            TFORM9  = '1PC(0)  '           / data format of field: variable length array    TTYPE10 = 'Mvalue  '           / label for field  10                            TFORM10 = '1PM(0)  '           / data format of field: variable length array    EXTNAME = 'Test-BINTABLE'      / name of this binary table extension            TNULL4  =                   88 / value for undefined pixels                     TNULL5  =                   88 / value for undefined pixels                     TNULL6  =                   88 / value for undefined pixels                     END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             
!)1ADGHKQ]i…‰ŠŽ–¦¶ÖÛàáæð@FLMS_w¿ÆÍÎÕãÿS[cdl|œ¼	ü				+	O	s
»
ÅÏ
Ñ
Û
ï

?𥧲Èô x„’ž¶æ
v
ƒ
’
Ÿ
¹
í
!‰—¥§µÑ	A±ÀÏÑàþ	:	v	î	þ


 
@
€
À@Qbev˜Ü ¨ºÌÏá

M
•%8KNa‡Ó·Ëßâön¾F?€?ðabT@XXXÿÿÿÿ@ÿÿÿÿÿÿÿÿ@abcFF@XXX?€ÿÿÿÿ@@?ðÿÿÿÿÿÿÿÿ@abcdFTF@XXX?€@ÿÿÿÿ@€?ð@ÿÿÿÿÿÿÿÿ@abcdeFTFTHXXX?€@@@ÿÿÿÿ@ ?ð@@ÿÿÿÿÿÿÿÿ@abcdefFTFFTLXXX?€@@@@€ÿÿÿÿ@À?ð@@@ÿÿÿÿÿÿÿÿ@abcdefgFTFFTFLXXX?€@@@@€@ ÿÿÿÿ@à?ð@@@@ÿÿÿÿÿÿÿÿ@abcdefghFTFFTTFLXXX?€@@@@€@ @ÀÿÿÿÿA?ð@@@@@ÿÿÿÿÿÿÿÿ@ abcdefghiFTFFTTFFLX	X	X	?€@@@@€@ @À@àÿÿÿÿA?ð@@@@@@ÿÿÿÿÿÿÿÿ@"abcdefghijFTFFTTFFTL@X
X
X
?€@@@@€@ @À@àAÿÿÿÿA ?ð@@@@@@@ ÿÿÿÿÿÿÿÿ@$abcdefghijkFTFFTTFFFTL`	X	X	X?€@@@@€@ @À@àAAÿÿÿÿA0?ð@@@@@@@ @"ÿÿÿÿÿÿÿÿ@&abcdefghijklFTFFTTFFFTTLp	
X	
X	
X?€@@@@€@ @À@àAAA ÿÿÿÿA@?ð@@@@@@@ @"@$ÿÿÿÿÿÿÿÿ@(abcdefghijklmFTFFTTFFFTTFLp	
X
	
X
	
X
?€@@@@€@ @À@àAAA A0ÿÿÿÿAP?ð@@@@@@@ @"@$@&ÿÿÿÿÿÿÿÿ@*abcdefghijklmnFTFFTTFFFTTTFLp	
X	
X	
X?€@@@@€@ @À@àAAA A0A@ÿÿÿÿA`?ð@@@@@@@ @"@$@&@(ÿÿÿÿÿÿÿÿ@,abcdefghijklmnoFTFFTTFFFTTTFFLp	

X	

X	

X?€@@@@€@ @À@àAAA A0A@APÿÿÿÿAp?ð@@@@@@@ @"@$@&@(@*ÿÿÿÿÿÿÿÿ@.abcdefghijklmnopFTFFTTFFFTTTFFFLp	

X	

X	

X?€@@@@€@ @À@àAAA A0A@APA`ÿÿÿÿA€?ð@@@@@@@ @"@$@&@(@*@,ÿÿÿÿÿÿÿÿ@0abcdefghijklmnopqFTFFTTFFFTTTFFFTLp€	

X	

X	

X?€@@@@€@ @À@àAAA A0A@APA`ApÿÿÿÿAˆ?ð@@@@@@@ @"@$@&@(@*@,@.ÿÿÿÿÿÿÿÿ@1abcdefghijklmnopqrFTFFTTFFFTTTFFFFTLpÀ	

X	

X	

X?€@@@@€@ @À@àAAA A0A@APA`ApA€ÿÿÿÿA?ð@@@@@@@ @"@$@&@(@*@,@.@0ÿÿÿÿÿÿÿÿ@2abcdefghijklmnopqrsFTFFTTFFFTTTFFFFTTLpà	

X	

X	

X?€@@@@€@ @À@àAAA A0A@APA`ApA€AˆÿÿÿÿA˜?ð@@@@@@@ @"@$@&@(@*@,@.@0@1ÿÿÿÿÿÿÿÿ@3abcdefghijklmnopqrstFTFFTTFFFTTTFFFFTTTLpð	

X	

X	

X?€@@@@€@ @À@àAAA A0A@APA`ApA€AˆAÿÿÿÿA ?ð@@@@@@@ @"@$@&@(@*@,@.@0@1@2ÿÿÿÿÿÿÿÿ@4XTENSION= 'IMAGE   '           / IMAGE extension                                BITPIX  =                   32 / number of bits per data pixel                  NAXIS   =                    2 / number of data axes                            NAXIS1  =                   10 / length of data axis 1                          NAXIS2  =                    2 / length of data axis 2                          PCOUNT  =                    0 / required keyword; must = 0                     GCOUNT  =                    1 / required keyword; must = 1                     CRVAL1  =     4.5830000000E+01 / comment                                        CRVAL2  =     6.3570000000E+01 / comment                                        CRPIX1  =     2.5600000000E+02 / comment                                        CRPIX2  =     2.5700000000E+02 / comment                                        CDELT1  =    -2.7777700000E-03 / comment                                        CDELT2  =     2.7777700000E-03 / comment                                        CTYPE1  = 'RA---TAN'           / comment                                        CTYPE2  = 'DEC--TAN'           / comment                                        END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             
XTENSION= 'TABLE   '           / ASCII table extension                          BITPIX  =                    8 / 8-bit ASCII characters                         NAXIS   =                    2 / 2-dimensional ASCII table                      NAXIS1  =                   80 / width of table in characters                   NAXIS2  =                   11 / number of rows in table                        PCOUNT  =                    0 / no group parameters (required keyword)         GCOUNT  =                    1 / one data group (required keyword)              TFIELDS =                    5 / number of fields in each row                   TTYPE1  = 'Name    '           / label for field   1                            TBCOL1  =                    1 / beginning column of field   1                  TFORM1  = 'A15     '           / Fortran-77 format of field                     TTYPE2  = 'Ivalue  '           / label for field   2                            TBCOL2  =                   17 / beginning column of field   2                  TFORM2  = 'I11     '           / Fortran-77 format of field                     TUNIT2  = 'm**2    '           / physical unit of field                         TTYPE3  = 'Fvalue  '           / label for field   3                            TBCOL3  =                   29 / beginning column of field   3                  TFORM3  = 'F15.6   '           / Fortran-77 format of field                     TUNIT3  = 'cm      '           / physical unit of field                         TTYPE4  = 'Evalue  '           / label for field   4                            TBCOL4  =                   45 / beginning column of field   4                  TFORM4  = 'E13.5   '           / Fortran-77 format of field                     TUNIT4  = 'erg/s   '           / physical unit of field                         TTYPE5  = 'Dvalue  '           / label for field   5                            TBCOL5  =                   59 / beginning column of field   5                  TFORM5  = 'D22.14  '           / Fortran-77 format of field                     TUNIT5  = 'km/s    '           / physical unit of field                         EXTNAME = 'new_table'          / name of this ASCII table extension             END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             first string              0        0.000000   0.00000E+00   0.00000000000000E+00second string             3        3.000000   3.00000E+00   3.00000000000000E+00                          6        6.000000   6.00000E+00   6.00000000000000E+00                          9        9.000000   9.00000E+00   9.00000000000000E+00                         12       12.000000   1.20000E+01   1.20000000000000E+01                         15       15.000000   1.50000E+01   1.50000000000000E+01                         18       18.000000   1.80000E+01   1.80000000000000E+01                         21       21.000000   2.10000E+01   2.10000000000000E+01                         24       24.000000   2.40000E+01   2.40000000000000E+01                         27       27.000000   2.70000E+01   2.70000000000000E+01                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                cfitsio-3.47/testprog.c0000644000225700000360000024765613464573432014447 0ustar  cagordonlhea#include 
#include 
#include "fitsio.h"
int main(void);

int main()
{
/*  
    This is a big and complicated program that tests most of
    the cfitsio routines.  This code does not represent
    the most efficient method of reading or writing FITS files 
    because this code is primarily designed to stress the cfitsio
    library routines.
*/
    char asciisum[17];
    unsigned long checksum, datsum;
    int datastatus, hdustatus, filemode;
    int status, simple, bitpix, naxis, extend, hdutype, hdunum, tfields;
    long ii, jj, extvers;
    int nkeys, nfound, colnum, typecode, signval,nmsg;
    char cval, cvalstr[2];
    long repeat, offset, width, jnulval;
    int anynull;
/*    float vers;   */
    unsigned char xinarray[21], binarray[21], boutarray[21], bnul;
    short         iinarray[21], ioutarray[21], inul;
    int           kinarray[21], koutarray[21], knul;
    long          jinarray[21], joutarray[21], jnul;
    float         einarray[21], eoutarray[21], enul, cinarray[42];
    double        dinarray[21], doutarray[21], dnul, minarray[42];
    double scale, zero;
    long naxes[3], pcount, gcount, npixels, nrows, rowlen, firstpix[3];
    int existkeys, morekeys, keynum;

    char larray[42], larray2[42], colname[70], tdisp[40], nulstr[40];
    char oskey[] = "value_string";
    char iskey[21];
    int olkey = 1;
    int ilkey;
    short oshtkey, ishtkey;
    long ojkey = 11, ijkey;
    long otint = 12345678;
    float ofkey = 12.121212f;
    float oekey = 13.131313f, iekey;
    double ogkey = 14.1414141414141414;
    double odkey = 15.1515151515151515, idkey;
    double otfrac = .1234567890123456;

    double xrval,yrval,xrpix,yrpix,xinc,yinc,rot,xpos,ypos,xpix,ypix;
    char xcoordtype[] = "RA---TAN";
    char ycoordtype[] = "DEC--TAN";
    char ctype[5];

    char *lsptr;    /* pointer to long string value */
    char  comm[73];
    char *comms[3];
    char *inskey[21];
    char *onskey[3] = {"first string", "second string", "        "};
    char *inclist[2] = {"key*", "newikys"};
    char *exclist[2] = {"key_pr*", "key_pkls"};

    int   onlkey[3] = {1, 0, 1}, inlkey[3];
    long  onjkey[3] = {11, 12, 13}, injkey[3];
    float onfkey[3] = {12.121212f, 13.131313f, 14.141414f};
    float onekey[3] = {13.131313f, 14.141414f, 15.151515f}, inekey[3];
    double ongkey[3] = {14.1414141414141414, 15.1515151515151515,
           16.1616161616161616};
    double ondkey[3] = {15.1515151515151515, 16.1616161616161616,
           17.1717171717171717}, indkey[3];

    long tbcol[5] = {1, 17, 28, 43, 56};

    char filename[40], card[FLEN_CARD], card2[FLEN_CARD];
    char keyword[FLEN_KEYWORD];
    char value[FLEN_VALUE], comment[FLEN_COMMENT];
    unsigned char uchars[80];

    fitsfile *fptr, *tmpfptr;
    char *ttype[10], *tform[10], *tunit[10];
    char tblname[40];
    char binname[] = "Test-BINTABLE";
    char templt[] = "testprog.tpt";
    char errmsg[FLEN_ERRMSG];
    short imgarray[30][19], imgarray2[20][10];
    long fpixels[2], lpixels[2], inc[2];

    status = 0;
    strcpy(tblname, "Test-ASCII");

/*    ffvers(&vers); 
    printf("CFITSIO TESTPROG, v%.3f\n\n",vers);
*/
    printf("CFITSIO TESTPROG\n\n");
    printf("Try opening then closing a nonexistent file:\n");
    fits_open_file(&fptr, "tq123x.kjl", READWRITE, &status);
    printf("  ffopen fptr, status  = %lu %d (expect an error)\n", 
           (unsigned long) fptr, status);
    ffclos(fptr, &status);
    printf("  ffclos status = %d\n\n", status);
    ffcmsg();
    status = 0;

    for (ii = 0; ii < 21; ii++)  /* allocate space for string column value */
        inskey[ii] = (char *) malloc(21);   

    for (ii = 0; ii < 10; ii++)
    {
      ttype[ii] = (char *) malloc(20);
      tform[ii] = (char *) malloc(20);
      tunit[ii] = (char *) malloc(20);
    }

    comms[0] = comm;

    /* delete previous version of the file, if it exists (with ! prefix) */
    strcpy(filename, "!testprog.fit");

    status = 0;

    /*
      #####################
      #  create FITS file #
      #####################
    */

    ffinit(&fptr, filename, &status);
    printf("ffinit create new file status = %d\n", status);
    if (status)
        goto errstatus;

    filename[0] = '\0';
    ffflnm(fptr, filename, &status);

    ffflmd(fptr, &filemode, &status);
    printf("Name of file = %s, I/O mode = %d\n", filename, filemode);
    simple = 1;
    bitpix = 32;
    naxis = 2;
    naxes[0] = 10;
    naxes[1] = 2;
    npixels = 20;
    pcount = 0;
    gcount = 1;
    extend = 1;
    /*
      ############################
      #  write single keywords   #
      ############################
    */

    if (ffphps(fptr, bitpix, naxis, naxes, &status) > 0)
        printf("ffphps status = %d\n", status);

    if (ffprec(fptr, 
    "key_prec= 'This keyword was written by fxprec' / comment goes here", 
     &status) > 0 )
        printf("ffprec status = %d\n", status);

    printf("\ntest writing of long string keywords:\n");
    strcpy(card, "1234567890123456789012345678901234567890");
    strcat(card, "12345678901234567890123456789012345");
    ffpkys(fptr, "card1", card, "", &status);
    ffgkey(fptr, "card1", card2, comment, &status);
    printf(" %s\n%s\n", card, card2);
    
    strcpy(card, "1234567890123456789012345678901234567890");
    strcat(card, "123456789012345678901234'6789012345");
    ffpkys(fptr, "card2", card, "", &status);
    ffgkey(fptr, "card2", card2, comment, &status);
    printf(" %s\n%s\n", card, card2);
    
    strcpy(card, "1234567890123456789012345678901234567890");
    strcat(card, "123456789012345678901234''789012345");
    ffpkys(fptr, "card3", card, "", &status);
    ffgkey(fptr, "card3", card2, comment, &status);
    printf(" %s\n%s\n", card, card2);
    
    strcpy(card, "1234567890123456789012345678901234567890");
    strcat(card, "123456789012345678901234567'9012345");
    ffpkys(fptr, "card4", card, "", &status);
    ffgkey(fptr, "card4", card2, comment, &status);
    printf(" %s\n%s\n", card, card2);
    
    if (ffpkys(fptr, "key_pkys", oskey, "fxpkys comment", &status) > 0)
        printf("ffpkys status = %d\n", status);

    if (ffpkyl(fptr, "key_pkyl", olkey, "fxpkyl comment", &status) > 0)
        printf("ffpkyl status = %d\n", status);

    if (ffpkyj(fptr, "key_pkyj", ojkey, "fxpkyj comment", &status) > 0)
        printf("ffpkyj status = %d\n", status);

    if (ffpkyf(fptr, "key_pkyf", ofkey, 5, "fxpkyf comment", &status) > 0)
        printf("ffpkyf status = %d\n", status);

    if (ffpkye(fptr, "key_pkye", oekey, 6, "fxpkye comment", &status) > 0)
        printf("ffpkye status = %d\n", status);

    if (ffpkyg(fptr, "key_pkyg", ogkey, 14, "fxpkyg comment", &status) > 0)
        printf("ffpkyg status = %d\n", status);

    if (ffpkyd(fptr, "key_pkyd", odkey, 14, "fxpkyd comment", &status) > 0)
        printf("ffpkyd status = %d\n", status);

    if (ffpkyc(fptr, "key_pkyc", onekey, 6, "fxpkyc comment", &status) > 0)
        printf("ffpkyc status = %d\n", status);

    if (ffpkym(fptr, "key_pkym", ondkey, 14, "fxpkym comment", &status) > 0)
        printf("ffpkym status = %d\n", status);

    if (ffpkfc(fptr, "key_pkfc", onekey, 6, "fxpkfc comment", &status) > 0)
        printf("ffpkfc status = %d\n", status);

    if (ffpkfm(fptr, "key_pkfm", ondkey, 14, "fxpkfm comment", &status) > 0)
        printf("ffpkfm status = %d\n", status);

    if (ffpkls(fptr, "key_pkls", 
"This is a very long string value that is continued over more than one keyword.",
     "fxpkls comment", &status) > 0)
        printf("ffpkls status = %d\n", status);

    if (ffplsw(fptr, &status) > 0 )
        printf("ffplsw status = %d\n", status);

    if (ffpkyt(fptr, "key_pkyt", otint, otfrac, "fxpkyt comment", &status) > 0)
        printf("ffpkyt status = %d\n", status);

    if (ffpcom(fptr, "  This keyword was written by fxpcom.", &status) > 0)
        printf("ffpcom status = %d\n", status);

    if (ffphis(fptr, "    This keyword written by fxphis (w/ 2 leading spaces).",
        &status) > 0)
        printf("ffphis status = %d\n", status);

    if (ffpdat(fptr, &status) > 0)
    {
        printf("ffpdat status = %d\n", status);
        goto errstatus;
    }

    /*
      ###############################
      #  write arrays of keywords   #
      ###############################
    */
    nkeys = 3;

    comms[0] = comm;  /* use the inskey array of pointers for the comments */

    strcpy(comm, "fxpkns comment&");
    if (ffpkns(fptr, "ky_pkns", 1, nkeys, onskey, comms, &status) > 0)
        printf("ffpkns status = %d\n", status);

    strcpy(comm, "fxpknl comment&");
    if (ffpknl(fptr, "ky_pknl", 1, nkeys, onlkey, comms, &status) > 0)
        printf("ffpknl status = %d\n", status);

    strcpy(comm, "fxpknj comment&");
    if (ffpknj(fptr, "ky_pknj", 1, nkeys, onjkey, comms, &status) > 0)
        printf("ffpknj status = %d\n", status);

    strcpy(comm, "fxpknf comment&");
    if (ffpknf(fptr, "ky_pknf", 1, nkeys, onfkey, 5, comms, &status) > 0)
        printf("ffpknf status = %d\n", status);

    strcpy(comm, "fxpkne comment&");
    if (ffpkne(fptr, "ky_pkne", 1, nkeys, onekey, 6, comms, &status) > 0)
        printf("ffpkne status = %d\n", status);

    strcpy(comm, "fxpkng comment&");
    if (ffpkng(fptr, "ky_pkng", 1, nkeys, ongkey, 13, comms, &status) > 0)
        printf("ffpkng status = %d\n", status);

    strcpy(comm, "fxpknd comment&");
    if (ffpknd(fptr, "ky_pknd", 1, nkeys, ondkey, 14, comms, &status) > 0)
    {
        printf("ffpknd status = %d\n", status);
        goto errstatus;
    }
    /*
      ############################
      #  write generic keywords  #
      ############################
    */

    strcpy(oskey, "1");
    if (ffpky(fptr, TSTRING, "tstring", oskey, "tstring comment", &status) > 0)
        printf("ffpky status = %d\n", status);

    olkey = TLOGICAL;
    if (ffpky(fptr, TLOGICAL, "tlogical", &olkey, "tlogical comment",
        &status) > 0)
        printf("ffpky status = %d\n", status);

    cval = TBYTE;
    if (ffpky(fptr, TBYTE, "tbyte", &cval, "tbyte comment", &status) > 0)
        printf("ffpky status = %d\n", status);

    oshtkey = TSHORT;
    if (ffpky(fptr, TSHORT, "tshort", &oshtkey, "tshort comment", &status) > 0)
        printf("ffpky status = %d\n", status);

    olkey = TINT;
    if (ffpky(fptr, TINT, "tint", &olkey, "tint comment", &status) > 0)
        printf("ffpky status = %d\n", status);

    ojkey = TLONG;
    if (ffpky(fptr, TLONG, "tlong", &ojkey, "tlong comment", &status) > 0)
        printf("ffpky status = %d\n", status);

    oekey = TFLOAT;
    if (ffpky(fptr, TFLOAT, "tfloat", &oekey, "tfloat comment", &status) > 0)
        printf("ffpky status = %d\n", status);

    odkey = TDOUBLE;
    if (ffpky(fptr, TDOUBLE, "tdouble", &odkey, "tdouble comment",
              &status) > 0)
        printf("ffpky status = %d\n", status);

    /*
      ############################
      #  write data              #
      ############################
    */
    /* define the null value (must do this before writing any data) */
    if (ffpkyj(fptr, "BLANK", -99, "value to use for undefined pixels",
       &status) > 0)
        printf("BLANK keyword status = %d\n", status);

    /* initialize arrays of values to write to primary array */
    for (ii = 0; ii < npixels; ii++)
    {
        boutarray[ii] = (unsigned char) (ii + 1);
        ioutarray[ii] = (short) (ii + 1);
        joutarray[ii] = ii + 1;
        eoutarray[ii] = (float) (ii + 1);
        doutarray[ii] = ii + 1;
    }

    /* write a few pixels with each datatype */
    /* set the last value in each group of 4 as undefined */

/*
    ffpprb(fptr, 1,  1, 2, &boutarray[0],  &status);
    ffppri(fptr, 1,  5, 2, &ioutarray[4],  &status);
    ffpprj(fptr, 1,  9, 2, &joutarray[8],  &status);
    ffppre(fptr, 1, 13, 2, &eoutarray[12], &status);
    ffpprd(fptr, 1, 17, 2, &doutarray[16], &status);
*/

/*  test the newer ffpx routine, instead of the older ffppr_ routines */
    firstpix[0]=1;
    firstpix[1]=1;
    ffppx(fptr, TBYTE, firstpix, 2, &boutarray[0],  &status);
    firstpix[0]=5;
    ffppx(fptr, TSHORT, firstpix, 2, &ioutarray[4],  &status);
    firstpix[0]=9;
    ffppx(fptr, TLONG, firstpix, 2, &joutarray[8],  &status);
    firstpix[0]=3;
    firstpix[1]=2;
    ffppx(fptr, TFLOAT, firstpix, 2, &eoutarray[12],  &status);
    firstpix[0]=7;
    ffppx(fptr, TDOUBLE, firstpix, 2, &doutarray[16],  &status);

/*
    ffppnb(fptr, 1,  3, 2, &boutarray[2],   4, &status);
    ffppni(fptr, 1,  7, 2, &ioutarray[6],   8, &status);
    ffppnj(fptr, 1, 11, 2, &joutarray[10],  12, &status);
    ffppne(fptr, 1, 15, 2, &eoutarray[14], 16., &status);
    ffppnd(fptr, 1, 19, 2, &doutarray[18], 20., &status);
*/
    firstpix[0]=3;
    firstpix[1]=1;
    bnul = 4;
    ffppxn(fptr, TBYTE, firstpix, 2, &boutarray[2], &bnul,  &status);
    firstpix[0]=7;
    inul = 8;
    ffppxn(fptr, TSHORT, firstpix, 2, &ioutarray[6], &inul, &status);
    firstpix[0]=1;
    firstpix[1]=2;
    jnul = 12;
    ffppxn(fptr, TLONG, firstpix, 2, &joutarray[10], &jnul, &status);
    firstpix[0]=5;
    enul = 16.;
    ffppxn(fptr, TFLOAT, firstpix, 2, &eoutarray[14], &enul,  &status);
    firstpix[0]=9;
    dnul = 20.;
    ffppxn(fptr, TDOUBLE, firstpix, 2, &doutarray[18], &dnul, &status);

    ffppru(fptr, 1, 1, 1, &status);


    if (status > 0)
    {
        printf("ffppnx status = %d\n", status);
        goto errstatus;
    }

    ffflus(fptr, &status);   /* flush all data to the disk file */ 
    printf("ffflus status = %d\n", status);
    printf("HDU number = %d\n", ffghdn(fptr, &hdunum));

    /*
      ############################
      #  read data               #
      ############################
    */
    /* read back the data, setting null values = 99 */
    printf("\nValues read back from primary array (99 = null pixel)\n");
    printf("The 1st, and every 4th pixel should be undefined:\n");

    anynull = 0;
    ffgpvb(fptr, 1,  1, 10, 99, binarray, &anynull, &status); 

    ffgpvb(fptr, 1, 11, 10, 99, &binarray[10], &anynull, &status);

    for (ii = 0; ii < npixels; ii++)
        printf(" %2d", binarray[ii]);
    printf("  %d (ffgpvb)\n", anynull);  

    ffgpvi(fptr, 1, 1, npixels, 99,   iinarray, &anynull, &status);

    for (ii = 0; ii < npixels; ii++)
        printf(" %2d", iinarray[ii]);
    printf("  %d (ffgpvi)\n", anynull);  

    ffgpvj(fptr, 1, 1, npixels, 99,  jinarray, &anynull, &status);

    for (ii = 0; ii < npixels; ii++)
        printf(" %2ld", jinarray[ii]);
    printf("  %d (ffgpvj)\n", anynull);  

    ffgpve(fptr, 1, 1, npixels, 99., einarray, &anynull, &status);

    for (ii = 0; ii < npixels; ii++)
        printf(" %2.0f", einarray[ii]);
    printf("  %d (ffgpve)\n", anynull);  

    ffgpvd(fptr, 1,  1, 10, 99.,  dinarray, &anynull, &status);
    ffgpvd(fptr, 1, 11, 10, 99.,  &dinarray[10], &anynull, &status);

    for (ii = 0; ii < npixels; ii++)
        printf(" %2.0f", dinarray[ii]);
    printf("  %d (ffgpvd)\n", anynull);  

    if (status > 0)
    {
        printf("ERROR: ffgpv_ status = %d\n", status);
        goto errstatus;
    }
    if (anynull == 0)
       printf("ERROR: ffgpv_ did not detect null values\n");

    /* reset the output null value to the expected input value */
    for (ii = 3; ii < npixels; ii += 4)
    {
        boutarray[ii] = 99;
        ioutarray[ii] = 99;
        joutarray[ii] = 99;
        eoutarray[ii] = 99.;
        doutarray[ii] = 99.;
    }
        ii = 0;
        boutarray[ii] = 99;
        ioutarray[ii] = 99;
        joutarray[ii] = 99;
        eoutarray[ii] = 99.;
        doutarray[ii] = 99.;

    /* compare the output with the input; flag any differences */
    for (ii = 0; ii < npixels; ii++)
    {
       if (boutarray[ii] != binarray[ii])
           printf("bout != bin = %u %u \n", boutarray[ii], binarray[ii]);

       if (ioutarray[ii] != iinarray[ii])
           printf("iout != iin = %d %d \n", ioutarray[ii], iinarray[ii]);

       if (joutarray[ii] != jinarray[ii])
           printf("jout != jin = %ld %ld \n", joutarray[ii], jinarray[ii]);

       if (eoutarray[ii] != einarray[ii])
           printf("eout != ein = %f %f \n", eoutarray[ii], einarray[ii]);

       if (doutarray[ii] != dinarray[ii])
           printf("dout != din = %f %f \n", doutarray[ii], dinarray[ii]);
    }

    for (ii = 0; ii < npixels; ii++)
    {
      binarray[ii] = 0;
      iinarray[ii] = 0;
      jinarray[ii] = 0;
      einarray[ii] = 0.;
      dinarray[ii] = 0.;
    }

    anynull = 0;
    ffgpfb(fptr, 1,  1, 10, binarray, larray, &anynull, &status);
    ffgpfb(fptr, 1, 11, 10, &binarray[10], &larray[10], &anynull, &status);

    for (ii = 0; ii < npixels; ii++)
      if (larray[ii])
        printf("  *");
      else
        printf(" %2d", binarray[ii]);
    printf("  %d (ffgpfb)\n", anynull);  

    ffgpfi(fptr, 1, 1, npixels, iinarray, larray, &anynull, &status);

    for (ii = 0; ii < npixels; ii++)
      if (larray[ii])
        printf("  *");
      else
        printf(" %2d", iinarray[ii]);
    printf("  %d (ffgpfi)\n", anynull);  

    ffgpfj(fptr, 1, 1, npixels, jinarray, larray, &anynull, &status);

    for (ii = 0; ii < npixels; ii++)
      if (larray[ii])
        printf("  *");
      else
        printf(" %2ld", jinarray[ii]);
    printf("  %d (ffgpfj)\n", anynull);  

    ffgpfe(fptr, 1, 1, npixels, einarray, larray, &anynull, &status);

    for (ii = 0; ii < npixels; ii++)
      if (larray[ii])
        printf("  *");
      else
        printf(" %2.0f", einarray[ii]);
    printf("  %d (ffgpfe)\n", anynull);  

    ffgpfd(fptr, 1,  1, 10, dinarray, larray, &anynull, &status);
    ffgpfd(fptr, 1, 11, 10, &dinarray[10], &larray[10], &anynull, &status);

    for (ii = 0; ii < npixels; ii++)
      if (larray[ii])
        printf("  *");
      else
        printf(" %2.0f", dinarray[ii]);
    printf("  %d (ffgpfd)\n", anynull);  

    if (status > 0)
    {
        printf("ERROR: ffgpf_ status = %d\n", status);
        goto errstatus;
    }
    if (anynull == 0)
       printf("ERROR: ffgpf_ did not detect null values\n");


    /*
      ##########################################
      #  close and reopen file multiple times  #
      ##########################################
    */

    for (ii = 0; ii < 10; ii++)
    {
      if (ffclos(fptr, &status) > 0)
      {
        printf("ERROR in ftclos (1) = %d", status);
        goto errstatus;
      }

      if (fits_open_file(&fptr, filename, READWRITE, &status) > 0)
      {
        printf("ERROR: ffopen open file status = %d\n", status);
        goto errstatus;
      }
    }
    printf("\nClosed then reopened the FITS file 10 times.\n");
    printf("HDU number = %d\n", ffghdn(fptr, &hdunum));

    filename[0] = '\0';
    ffflnm(fptr, filename, &status);

    ffflmd(fptr, &filemode, &status);
    printf("Name of file = %s, I/O mode = %d\n", filename, filemode);

    /*
      ############################
      #  read single keywords    #
      ############################
    */

    simple = 0;
    bitpix = 0;
    naxis = 0;
    naxes[0] = 0;
    naxes[1] = 0;
    pcount = -99;
    gcount =  -99;
    extend = -99;
    printf("\nRead back keywords:\n");
    ffghpr(fptr, 99, &simple, &bitpix, &naxis, naxes, &pcount,
           &gcount, &extend, &status);
    printf("simple = %d, bitpix = %d, naxis = %d, naxes = (%ld, %ld)\n",
           simple, bitpix, naxis, naxes[0], naxes[1]);
    printf("  pcount = %ld, gcount = %ld, extend = %d\n",
               pcount, gcount, extend);

    ffgrec(fptr, 9, card, &status);
    printf("%s\n", card);
    if (strncmp(card, "KEY_PREC= 'This", 15) )
       printf("ERROR in ffgrec\n");

    ffgkyn(fptr, 9, keyword, value, comment, &status);
    printf("%s : %s : %s :\n",keyword, value, comment);
    if (strncmp(keyword, "KEY_PREC", 8) )
       printf("ERROR in ffgkyn: %s\n", keyword);

    ffgcrd(fptr, keyword, card, &status);
    printf("%s\n", card);

    if (strncmp(keyword, card, 8) )
       printf("ERROR in ffgcrd: %s\n", keyword);

    ffgkey(fptr, "KY_PKNS1", value, comment, &status);
    printf("KY_PKNS1 : %s : %s :\n", value, comment);

    if (strncmp(value, "'first string'", 14) )
       printf("ERROR in ffgkey: %s\n", value);

    ffgkys(fptr, "key_pkys", iskey, comment, &status);
    printf("KEY_PKYS %s %s %d\n", iskey, comment, status);

    ffgkyl(fptr, "key_pkyl", &ilkey, comment, &status);
    printf("KEY_PKYL %d %s %d\n", ilkey, comment, status);

    ffgkyj(fptr, "KEY_PKYJ", &ijkey, comment, &status);
    printf("KEY_PKYJ %ld %s %d\n",ijkey, comment, status);

    ffgkye(fptr, "KEY_PKYJ", &iekey, comment, &status);
    printf("KEY_PKYJ %f %s %d\n",iekey, comment, status);

    ffgkyd(fptr, "KEY_PKYJ", &idkey, comment, &status);
    printf("KEY_PKYJ %f %s %d\n",idkey, comment, status);

    if (ijkey != 11 || iekey != 11. || idkey != 11.)
       printf("ERROR in ffgky[jed]: %ld, %f, %f\n",ijkey, iekey, idkey);

    iskey[0] = '\0';
    ffgky(fptr, TSTRING, "key_pkys", iskey, comment, &status);
    printf("KEY_PKY S %s %s %d\n", iskey, comment, status);

    ilkey = 0;
    ffgky(fptr, TLOGICAL, "key_pkyl", &ilkey, comment, &status);
    printf("KEY_PKY L %d %s %d\n", ilkey, comment, status);

    ffgky(fptr, TBYTE, "KEY_PKYJ", &cval, comment, &status);
    printf("KEY_PKY BYTE %d %s %d\n",cval, comment, status);

    ffgky(fptr, TSHORT, "KEY_PKYJ", &ishtkey, comment, &status);
    printf("KEY_PKY SHORT %d %s %d\n",ishtkey, comment, status);

    ffgky(fptr, TINT, "KEY_PKYJ", &ilkey, comment, &status);
    printf("KEY_PKY INT %d %s %d\n",ilkey, comment, status);

    ijkey = 0;
    ffgky(fptr, TLONG, "KEY_PKYJ", &ijkey, comment, &status);
    printf("KEY_PKY J %ld %s %d\n",ijkey, comment, status);

    iekey = 0;
    ffgky(fptr, TFLOAT, "KEY_PKYE", &iekey, comment, &status);
    printf("KEY_PKY E %f %s %d\n",iekey, comment, status);

    idkey = 0;
    ffgky(fptr, TDOUBLE, "KEY_PKYD", &idkey, comment, &status);
    printf("KEY_PKY D %f %s %d\n",idkey, comment, status);

    ffgkyd(fptr, "KEY_PKYF", &idkey, comment, &status);
    printf("KEY_PKYF %f %s %d\n",idkey, comment, status);

    ffgkyd(fptr, "KEY_PKYE", &idkey, comment, &status);
    printf("KEY_PKYE %f %s %d\n",idkey, comment, status);

    ffgkyd(fptr, "KEY_PKYG", &idkey, comment, &status);
    printf("KEY_PKYG %.14f %s %d\n",idkey, comment, status);

    ffgkyd(fptr, "KEY_PKYD", &idkey, comment, &status);
    printf("KEY_PKYD %.14f %s %d\n",idkey, comment, status);

    ffgkyc(fptr, "KEY_PKYC", inekey, comment, &status);
    printf("KEY_PKYC %f %f %s %d\n",inekey[0], inekey[1], comment, status);

    ffgkyc(fptr, "KEY_PKFC", inekey, comment, &status);
    printf("KEY_PKFC %f %f %s %d\n",inekey[0], inekey[1], comment, status);

    ffgkym(fptr, "KEY_PKYM", indkey, comment, &status);
    printf("KEY_PKYM %f %f %s %d\n",indkey[0], indkey[1], comment, status);

    ffgkym(fptr, "KEY_PKFM", indkey, comment, &status);
    printf("KEY_PKFM %f %f %s %d\n",indkey[0], indkey[1], comment, status);

    ffgkyt(fptr, "KEY_PKYT", &ijkey, &idkey, comment, &status);
    printf("KEY_PKYT %ld %.14f %s %d\n",ijkey, idkey, comment, status);

    ffpunt(fptr, "KEY_PKYJ", "km/s/Mpc", &status);
    ijkey = 0;
    ffgky(fptr, TLONG, "KEY_PKYJ", &ijkey, comment, &status);
    printf("KEY_PKY J %ld %s %d\n",ijkey, comment, status);
    ffgunt(fptr,"KEY_PKYJ", comment, &status);
    printf("KEY_PKY units = %s\n",comment);

    ffpunt(fptr, "KEY_PKYJ", "", &status);
    ijkey = 0;
    ffgky(fptr, TLONG, "KEY_PKYJ", &ijkey, comment, &status);
    printf("KEY_PKY J %ld %s %d\n",ijkey, comment, status);
    ffgunt(fptr,"KEY_PKYJ", comment, &status);
    printf("KEY_PKY units = %s\n",comment);

    ffpunt(fptr, "KEY_PKYJ", "feet/second/second", &status);
    ijkey = 0;
    ffgky(fptr, TLONG, "KEY_PKYJ", &ijkey, comment, &status);
    printf("KEY_PKY J %ld %s %d\n",ijkey, comment, status);
    ffgunt(fptr,"KEY_PKYJ", comment, &status);
    printf("KEY_PKY units = %s\n",comment);

    ffgkls(fptr, "key_pkls", &lsptr, comment, &status);
    printf("KEY_PKLS long string value = \n%s\n", lsptr);

    /* free the memory for the long string value */
    fits_free_memory(lsptr, &status);

    /* get size and position in header */
    ffghps(fptr, &existkeys, &keynum, &status);
    printf("header contains %d keywords; located at keyword %d \n",existkeys,
            keynum);

    /*
      ############################
      #  read array keywords     #
      ############################
    */
    ffgkns(fptr, "ky_pkns", 1, 3, inskey, &nfound, &status);
    printf("ffgkns:  %s, %s, %s\n", inskey[0], inskey[1], inskey[2]);
    if (nfound != 3 || status > 0)
       printf("\nERROR in ffgkns %d, %d\n", nfound, status);

    ffgknl(fptr, "ky_pknl", 1, 3, inlkey, &nfound, &status);
    printf("ffgknl:  %d, %d, %d\n", inlkey[0], inlkey[1], inlkey[2]);
    if (nfound != 3 || status > 0)
       printf("\nERROR in ffgknl %d, %d\n", nfound, status);

    ffgknj(fptr, "ky_pknj", 1, 3, injkey, &nfound, &status);
    printf("ffgknj:  %ld, %ld, %ld\n", injkey[0], injkey[1], injkey[2]);
    if (nfound != 3 || status > 0)
       printf("\nERROR in ffgknj %d, %d\n", nfound, status);

    ffgkne(fptr, "ky_pkne", 1, 3, inekey, &nfound, &status);
    printf("ffgkne:  %f, %f, %f\n", inekey[0], inekey[1], inekey[2]);
    if (nfound != 3 || status > 0)
       printf("\nERROR in ffgkne %d, %d\n", nfound, status);

    ffgknd(fptr, "ky_pknd", 1, 3, indkey, &nfound, &status);
    printf("ffgknd:  %f, %f, %f\n", indkey[0], indkey[1], indkey[2]);
    if (nfound != 3 || status > 0)
       printf("\nERROR in ffgknd %d, %d\n", nfound, status);

    /* get position of HISTORY keyword for subsequent deletes and inserts */
    ffgcrd(fptr, "HISTORY", card, &status);
    ffghps(fptr, &existkeys, &keynum, &status);
    keynum -= 2;

    printf("\nBefore deleting the HISTORY and DATE keywords...\n");
    for (ii = keynum; ii <= keynum + 3; ii++)
    {
        ffgrec(fptr, ii, card, &status);
        printf("%.8s\n", card);  /* don't print date value, so that */
    }                            /* the output will always be the same */
    /*
      ############################
      #  delete keywords         #
      ############################
    */

    ffdrec(fptr, keynum + 1, &status);
    ffdkey(fptr, "DATE", &status);

    printf("\nAfter deleting the keywords...\n");
    for (ii = keynum; ii <= keynum + 1; ii++)
    {
        ffgrec(fptr, ii, card, &status);
        printf("%s\n", card);
    }

    if (status > 0)
       printf("\nERROR deleting keywords\n");
    /*
      ############################
      #  insert keywords         #
      ############################
    */
    keynum += 4;
    ffirec(fptr, keynum - 3, "KY_IREC = 'This keyword inserted by fxirec'",
           &status);
    ffikys(fptr, "KY_IKYS", "insert_value_string", "ikys comment", &status);
    ffikyj(fptr, "KY_IKYJ", 49, "ikyj comment", &status);
    ffikyl(fptr, "KY_IKYL", 1, "ikyl comment", &status);
    ffikye(fptr, "KY_IKYE", 12.3456f, 4, "ikye comment", &status);
    ffikyd(fptr, "KY_IKYD", 12.345678901234567, 14, "ikyd comment", &status);
    ffikyf(fptr, "KY_IKYF", 12.3456f, 4, "ikyf comment", &status);
    ffikyg(fptr, "KY_IKYG", 12.345678901234567, 13, "ikyg comment", &status);

    printf("\nAfter inserting the keywords...\n");
    for (ii = keynum - 4; ii <= keynum + 5; ii++)
    {
        ffgrec(fptr, ii, card, &status);
        printf("%s\n", card);
    }

    if (status > 0)
       printf("\nERROR inserting keywords\n");
    /*
      ############################
      #  modify keywords         #
      ############################
    */
    ffmrec(fptr, keynum - 4, "COMMENT   This keyword was modified by fxmrec", &status);
    ffmcrd(fptr, "KY_IREC", "KY_MREC = 'This keyword was modified by fxmcrd'",
            &status);
    ffmnam(fptr, "KY_IKYS", "NEWIKYS", &status);

    ffmcom(fptr, "KY_IKYJ","This is a modified comment", &status);
    ffmkyj(fptr, "KY_IKYJ", 50, "&", &status);
    ffmkyl(fptr, "KY_IKYL", 0, "&", &status);
    ffmkys(fptr, "NEWIKYS", "modified_string", "&", &status);
    ffmkye(fptr, "KY_IKYE", -12.3456f, 4, "&", &status);
    ffmkyd(fptr, "KY_IKYD", -12.345678901234567, 14, "modified comment",
            &status);
    ffmkyf(fptr, "KY_IKYF", -12.3456f, 4, "&", &status);
    ffmkyg(fptr, "KY_IKYG", -12.345678901234567, 13, "&", &status);

    printf("\nAfter modifying the keywords...\n");
    for (ii = keynum - 4; ii <= keynum + 5; ii++)
    {
        ffgrec(fptr, ii, card, &status);
        printf("%s\n", card);
    }
    if (status > 0)
       printf("\nERROR modifying keywords\n");

    /*
      ############################
      #  update keywords         #
      ############################
    */
    ffucrd(fptr, "KY_MREC", "KY_UCRD = 'This keyword was updated by fxucrd'",
            &status);

    ffukyj(fptr, "KY_IKYJ", 51, "&", &status);
    ffukyl(fptr, "KY_IKYL", 1, "&", &status);
    ffukys(fptr, "NEWIKYS", "updated_string", "&", &status);
    ffukye(fptr, "KY_IKYE", -13.3456f, 4, "&", &status);
    ffukyd(fptr, "KY_IKYD", -13.345678901234567, 14, "modified comment",
            &status);
    ffukyf(fptr, "KY_IKYF", -13.3456f, 4, "&", &status);
    ffukyg(fptr, "KY_IKYG", -13.345678901234567, 13, "&", &status);

    printf("\nAfter updating the keywords...\n");
    for (ii = keynum - 4; ii <= keynum + 5; ii++)
    {
        ffgrec(fptr, ii, card, &status);
        printf("%s\n", card);
    }
    if (status > 0)
       printf("\nERROR modifying keywords\n");

    /* move to top of header and find keywords using wild cards */
    ffgrec(fptr, 0, card, &status);

    printf("\nKeywords found using wildcard search (should be 13)...\n");
    nfound = 0;
    while (!ffgnxk(fptr,inclist, 2, exclist, 2, card, &status))
    {
        nfound++;
        printf("%s\n", card);
    }
    if (nfound != 13)
    {
       printf("\nERROR reading keywords using wildcards (ffgnxk)\n");
       goto errstatus;
    }
    status = 0;

    /*
      ############################
      #  copy index keyword      #
      ############################
    */
    ffcpky(fptr, fptr, 1, 4, "KY_PKNE", &status);
    ffgkne(fptr, "ky_pkne", 2, 4, inekey, &nfound, &status);
    printf("\nCopied keyword: ffgkne:  %f, %f, %f\n", inekey[0], inekey[1],
           inekey[2]);

    if (status > 0)
    {
       printf("\nERROR in ffgkne %d, %d\n", nfound, status);
       goto errstatus;
    }

    /*
      ######################################
      #  modify header using template file #
      ######################################
    */
    if (ffpktp(fptr, templt, &status))
    {
       printf("\nERROR returned by ffpktp:\n");
       printf("Could not open or process the file 'testprog.tpt'.\n");
       printf("  This file is included with the CFITSIO distribution\n");
       printf("  and should be copied into the current directory\n");
       printf("  before running the testprog program.\n");
       status = 0;
    }
    printf("Updated header using template file (ffpktp)\n");
    /*
      ############################
      #  create binary table     #
      ############################
    */

    strcpy(tform[0], "15A");
    strcpy(tform[1], "1L");
    strcpy(tform[2], "16X");
    strcpy(tform[3], "1B");
    strcpy(tform[4], "1I");
    strcpy(tform[5], "1J");
    strcpy(tform[6], "1E");
    strcpy(tform[7], "1D");
    strcpy(tform[8], "1C");
    strcpy(tform[9], "1M");

    strcpy(ttype[0], "Avalue");
    strcpy(ttype[1], "Lvalue");
    strcpy(ttype[2], "Xvalue");
    strcpy(ttype[3], "Bvalue");
    strcpy(ttype[4], "Ivalue");
    strcpy(ttype[5], "Jvalue");
    strcpy(ttype[6], "Evalue");
    strcpy(ttype[7], "Dvalue");
    strcpy(ttype[8], "Cvalue");
    strcpy(ttype[9], "Mvalue");

    strcpy(tunit[0], "");
    strcpy(tunit[1], "m**2");
    strcpy(tunit[2], "cm");
    strcpy(tunit[3], "erg/s");
    strcpy(tunit[4], "km/s");
    strcpy(tunit[5], "");
    strcpy(tunit[6], "");
    strcpy(tunit[7], "");
    strcpy(tunit[8], "");
    strcpy(tunit[9], "");

    nrows = 21;
    tfields = 10;
    pcount = 0;

/*
    ffcrtb(fptr, BINARY_TBL, nrows, tfields, ttype, tform, tunit, binname,
            &status);
*/
    ffibin(fptr, nrows, tfields, ttype, tform, tunit, binname, 0L,
            &status);

    printf("\nffibin status = %d\n", status);
    printf("HDU number = %d\n", ffghdn(fptr, &hdunum));

    /* get size and position in header, and reserve space for more keywords */
    ffghps(fptr, &existkeys, &keynum, &status);
    printf("header contains %d keywords; located at keyword %d \n",existkeys,
            keynum);

    morekeys = 40;
    ffhdef(fptr, morekeys, &status);
    ffghsp(fptr, &existkeys, &morekeys, &status);
    printf("header contains %d keywords with room for %d more\n",existkeys,
            morekeys);

    fftnul(fptr, 4, 99, &status);   /* define null value for int cols */
    fftnul(fptr, 5, 99, &status);
    fftnul(fptr, 6, 99, &status);

    extvers = 1;
    ffpkyj(fptr, "EXTVER", extvers, "extension version number", &status);
    ffpkyj(fptr, "TNULL4", 99, "value for undefined pixels", &status);
    ffpkyj(fptr, "TNULL5", 99, "value for undefined pixels", &status);
    ffpkyj(fptr, "TNULL6", 99, "value for undefined pixels", &status);

    naxis = 3;
    naxes[0] = 1;
    naxes[1] = 2;
    naxes[2] = 8;
    ffptdm(fptr, 3, naxis, naxes, &status);

    naxis = 0;
    naxes[0] = 0;
    naxes[1] = 0;
    naxes[2] = 0;
    ffgtdm(fptr, 3, 3, &naxis, naxes, &status);
    ffgkys(fptr, "TDIM3", iskey, comment, &status);
    printf("TDIM3 = %s, %d, %ld, %ld, %ld\n", iskey, naxis, naxes[0],
         naxes[1], naxes[2]);

    ffrdef(fptr, &status);  /* force header to be scanned (not required) */

    /*
      ############################
      #  write data to columns   #
      ############################
    */

    /* initialize arrays of values to write to table */
    signval = -1;
    for (ii = 0; ii < 21; ii++)
    {
        signval *= -1;
        boutarray[ii] = (unsigned char) (ii + 1);
        ioutarray[ii] = (short) ((ii + 1) * signval);
        joutarray[ii] = (ii + 1) * signval;
        koutarray[ii] = (ii + 1) * signval;
        eoutarray[ii] = (float) ((ii + 1) * signval);
        doutarray[ii] = (ii + 1) * signval;
    }

    ffpcls(fptr, 1, 1, 1, 3, onskey, &status);  /* write string values */
    ffpclu(fptr, 1, 4, 1, 1, &status);  /* write null value */

    larray[0] = 0;
    larray[1] = 1;
    larray[2] = 0;
    larray[3] = 0;
    larray[4] = 1;
    larray[5] = 1;
    larray[6] = 0;
    larray[7] = 0;
    larray[8] = 0;
    larray[9] = 1;
    larray[10] = 1;
    larray[11] = 1;
    larray[12] = 0;
    larray[13] = 0;
    larray[14] = 0;
    larray[15] = 0;
    larray[16] = 1;
    larray[17] = 1;
    larray[18] = 1;
    larray[19] = 1;
    larray[20] = 0;
    larray[21] = 0;
    larray[22] = 0;
    larray[23] = 0;
    larray[24] = 0;
    larray[25] = 1;
    larray[26] = 1;
    larray[27] = 1;
    larray[28] = 1;
    larray[29] = 1;
    larray[30] = 0;
    larray[31] = 0;
    larray[32] = 0;
    larray[33] = 0;
    larray[34] = 0;
    larray[35] = 0;


    ffpclx(fptr, 3, 1, 1, 36, larray, &status); /*write bits*/

    for (ii = 4; ii < 9; ii++)   /* loop over cols 4 - 8 */
    {
        ffpclb(fptr, ii, 1, 1, 2, boutarray, &status);
        if (status == NUM_OVERFLOW)
            status = 0;
        ffpcli(fptr, ii, 3, 1, 2, &ioutarray[2], &status); 
        if (status == NUM_OVERFLOW)
            status = 0;
        ffpclk(fptr, ii, 5, 1, 2, &koutarray[4], &status); 
        if (status == NUM_OVERFLOW)
            status = 0;
        ffpcle(fptr, ii, 7, 1, 2, &eoutarray[6], &status);
        if (status == NUM_OVERFLOW)
            status = 0;
        ffpcld(fptr, ii, 9, 1, 2, &doutarray[8], &status);
        if (status == NUM_OVERFLOW)
            status = 0;

        ffpclu(fptr, ii, 11, 1, 1, &status);  /* write null value */
    }

    ffpclc(fptr, 9, 1, 1, 10, eoutarray, &status);
    ffpclm(fptr, 10, 1, 1, 10, doutarray, &status);

    for (ii = 4; ii < 9; ii++)   /* loop over cols 4 - 8 */
    {
        ffpcnb(fptr, ii, 12, 1, 2, &boutarray[11], 13, &status);
        if (status == NUM_OVERFLOW)
            status = 0;
        ffpcni(fptr, ii, 14, 1, 2, &ioutarray[13], 15, &status); 
        if (status == NUM_OVERFLOW)
            status = 0;
        ffpcnk(fptr, ii, 16, 1, 2, &koutarray[15], 17, &status); 
        if (status == NUM_OVERFLOW)
            status = 0;
        ffpcne(fptr, ii, 18, 1, 2, &eoutarray[17], 19., &status);
        if (status == NUM_OVERFLOW)
            status = 0;
        ffpcnd(fptr, ii, 20, 1, 2, &doutarray[19], 21., &status);
        if (status == NUM_OVERFLOW)
            status = 0;

    }
    ffpcll(fptr, 2, 1, 1, 21, larray, &status); /*write logicals*/
    ffpclu(fptr, 2, 11, 1, 1, &status);  /* write null value */
    printf("ffpcl_ status = %d\n", status);

    /*
      #########################################
      #  get information about the columns    #
      #########################################
    */

    printf("\nFind the column numbers; a returned status value of 237 is");
    printf("\nexpected and indicates that more than one column name matches");
    printf("\nthe input column name template.  Status = 219 indicates that");
    printf("\nthere was no matching column name.");

    ffgcno(fptr, 0, "Xvalue", &colnum, &status);
    printf("\nColumn Xvalue is number %d; status = %d.\n", colnum, status);

    while (status != COL_NOT_FOUND)
    {
      ffgcnn(fptr, 1, "*ue", colname, &colnum, &status);
      printf("Column %s is number %d; status = %d.\n", 
           colname, colnum, status);
    }
    status = 0;

    printf("\nInformation about each column:\n");

    for (ii = 0; ii < tfields; ii++)
    {
      ffgtcl(fptr, ii + 1, &typecode, &repeat, &width, &status);
      printf("%4s %3d %2ld %2ld", tform[ii], typecode, repeat, width);
      ffgbcl(fptr, ii + 1, ttype[0], tunit[0], cvalstr, &repeat, &scale,
           &zero, &jnulval, tdisp, &status);
      printf(" %s, %s, %c, %ld, %f, %f, %ld, %s.\n",
         ttype[0], tunit[0], cvalstr[0], repeat, scale, zero, jnulval, tdisp);
    }

    printf("\n");

    /*
      ###############################################
      #  insert ASCII table before the binary table #
      ###############################################
    */

    if (ffmrhd(fptr, -1, &hdutype, &status) > 0)
        goto errstatus;

    strcpy(tform[0], "A15");
    strcpy(tform[1], "I10");
    strcpy(tform[2], "F14.6");
    strcpy(tform[3], "E12.5");
    strcpy(tform[4], "D21.14");

    strcpy(ttype[0], "Name");
    strcpy(ttype[1], "Ivalue");
    strcpy(ttype[2], "Fvalue");
    strcpy(ttype[3], "Evalue");
    strcpy(ttype[4], "Dvalue");

    strcpy(tunit[0], "");
    strcpy(tunit[1], "m**2");
    strcpy(tunit[2], "cm");
    strcpy(tunit[3], "erg/s");
    strcpy(tunit[4], "km/s");

    rowlen = 76;
    nrows = 11;
    tfields = 5;

    ffitab(fptr, rowlen, nrows, tfields, ttype, tbcol, tform, tunit, tblname,
            &status);
    printf("ffitab status = %d\n", status);
    printf("HDU number = %d\n", ffghdn(fptr, &hdunum));

    ffsnul(fptr, 1, "null1", &status);   /* define null value for int cols */
    ffsnul(fptr, 2, "null2", &status);
    ffsnul(fptr, 3, "null3", &status);
    ffsnul(fptr, 4, "null4", &status);
    ffsnul(fptr, 5, "null5", &status);
 
    extvers = 2;
    ffpkyj(fptr, "EXTVER", extvers, "extension version number", &status);

    ffpkys(fptr, "TNULL1", "null1", "value for undefined pixels", &status);
    ffpkys(fptr, "TNULL2", "null2", "value for undefined pixels", &status);
    ffpkys(fptr, "TNULL3", "null3", "value for undefined pixels", &status);
    ffpkys(fptr, "TNULL4", "null4", "value for undefined pixels", &status);
    ffpkys(fptr, "TNULL5", "null5", "value for undefined pixels", &status);

    if (status > 0)
        goto errstatus;

    /*
      ############################
      #  write data to columns   #
      ############################
    */

    /* initialize arrays of values to write to table */
    for (ii = 0; ii < 21; ii++)
    {
        boutarray[ii] = (unsigned char) (ii + 1);
        ioutarray[ii] = (short) (ii + 1);
        joutarray[ii] = ii + 1;
        eoutarray[ii] = (float) (ii + 1);
        doutarray[ii] = ii + 1;
    }

    ffpcls(fptr, 1, 1, 1, 3, onskey, &status);  /* write string values */
    ffpclu(fptr, 1, 4, 1, 1, &status);  /* write null value */

    for (ii = 2; ii < 6; ii++)   /* loop over cols 2 - 5 */
    {
        ffpclb(fptr, ii, 1, 1, 2, boutarray, &status);  /* char array */
        if (status == NUM_OVERFLOW)
            status = 0;
        ffpcli(fptr, ii, 3, 1, 2, &ioutarray[2], &status);  /* short array */
        if (status == NUM_OVERFLOW)
            status = 0;
        ffpclj(fptr, ii, 5, 1, 2, &joutarray[4], &status);  /* long array */
        if (status == NUM_OVERFLOW)
            status = 0;
        ffpcle(fptr, ii, 7, 1, 2, &eoutarray[6], &status);  /* float array */
        if (status == NUM_OVERFLOW)
            status = 0;
        ffpcld(fptr, ii, 9, 1, 2, &doutarray[8], &status);  /* double array */
        if (status == NUM_OVERFLOW)
            status = 0;

        ffpclu(fptr, ii, 11, 1, 1, &status);  /* write null value */
    }
    printf("ffpcl_ status = %d\n", status);

    /*
      ################################
      #  read data from ASCII table  #
      ################################
    */
    ffghtb(fptr, 99, &rowlen, &nrows, &tfields, ttype, tbcol, 
           tform, tunit, tblname, &status);

    printf("\nASCII table: rowlen, nrows, tfields, extname: %ld %ld %d %s\n",
           rowlen, nrows, tfields, tblname);

    for (ii = 0; ii < tfields; ii++)
      printf("%8s %3ld %8s %8s \n", ttype[ii], tbcol[ii], 
                                   tform[ii], tunit[ii]);

    nrows = 11;
    ffgcvs(fptr, 1, 1, 1, nrows, "UNDEFINED", inskey,   &anynull, &status);
    ffgcvb(fptr, 2, 1, 1, nrows, 99, binarray, &anynull, &status);
    ffgcvi(fptr, 2, 1, 1, nrows, 99, iinarray, &anynull, &status);
    ffgcvj(fptr, 3, 1, 1, nrows, 99, jinarray, &anynull, &status);
    ffgcve(fptr, 4, 1, 1, nrows, 99., einarray, &anynull, &status);
    ffgcvd(fptr, 5, 1, 1, nrows, 99., dinarray, &anynull, &status);

    printf("\nData values read from ASCII table:\n");
    for (ii = 0; ii < nrows; ii++)
    {
      printf("%15s %2d %2d %2ld %4.1f %4.1f\n", inskey[ii], binarray[ii],
           iinarray[ii], jinarray[ii], einarray[ii], dinarray[ii]); 
    }

    ffgtbb(fptr, 1, 20, 78, uchars, &status);
    uchars[78] = '\0';
    printf("\n%s\n", uchars);
    ffptbb(fptr, 1, 20, 78, uchars, &status);

    /*
      #########################################
      #  get information about the columns    #
      #########################################
    */

    ffgcno(fptr, 0, "name", &colnum, &status);
    printf("\nColumn name is number %d; status = %d.\n", colnum, status);

    while (status != COL_NOT_FOUND)
    {
      ffgcnn(fptr, 1, "*ue", colname, &colnum, &status);
      printf("Column %s is number %d; status = %d.\n", 
           colname, colnum, status);
    }
    status = 0;

    for (ii = 0; ii < tfields; ii++)
    {
      ffgtcl(fptr, ii + 1, &typecode, &repeat, &width, &status);
      printf("%4s %3d %2ld %2ld", tform[ii], typecode, repeat, width);
      ffgacl(fptr, ii + 1, ttype[0], tbcol, tunit[0], tform[0], &scale,
           &zero, nulstr, tdisp, &status);
      printf(" %s, %ld, %s, %s, %f, %f, %s, %s.\n",
         ttype[0], tbcol[0], tunit[0], tform[0], scale, zero,
         nulstr, tdisp);
    }

    printf("\n");

    /*
      ###############################################
      #  test the insert/delete row/column routines #
      ###############################################
    */

    if (ffirow(fptr, 2, 3, &status) > 0)
        goto errstatus;

    nrows = 14;
    ffgcvs(fptr, 1, 1, 1, nrows, "UNDEFINED", inskey,   &anynull, &status);
    ffgcvb(fptr, 2, 1, 1, nrows, 99, binarray, &anynull, &status);
    ffgcvi(fptr, 2, 1, 1, nrows, 99, iinarray, &anynull, &status);
    ffgcvj(fptr, 3, 1, 1, nrows, 99, jinarray, &anynull, &status);
    ffgcve(fptr, 4, 1, 1, nrows, 99., einarray, &anynull, &status);
    ffgcvd(fptr, 5, 1, 1, nrows, 99., dinarray, &anynull, &status);


    printf("\nData values after inserting 3 rows after row 2:\n");
    for (ii = 0; ii < nrows; ii++)
    {
      printf("%15s %2d %2d %2ld %4.1f %4.1f\n",  inskey[ii], binarray[ii],
          iinarray[ii], jinarray[ii], einarray[ii], dinarray[ii]);
    }

    if (ffdrow(fptr, 10, 2, &status) > 0)
        goto errstatus;

    nrows = 12;
    ffgcvs(fptr, 1, 1, 1, nrows, "UNDEFINED", inskey,   &anynull, &status);
    ffgcvb(fptr, 2, 1, 1, nrows, 99, binarray, &anynull, &status);
    ffgcvi(fptr, 2, 1, 1, nrows, 99, iinarray, &anynull, &status);
    ffgcvj(fptr, 3, 1, 1, nrows, 99, jinarray, &anynull, &status);
    ffgcve(fptr, 4, 1, 1, nrows, 99., einarray, &anynull, &status);
    ffgcvd(fptr, 5, 1, 1, nrows, 99., dinarray, &anynull, &status);

    printf("\nData values after deleting 2 rows at row 10:\n");
    for (ii = 0; ii < nrows; ii++)
    {
      printf("%15s %2d %2d %2ld %4.1f %4.1f\n",  inskey[ii], binarray[ii],
          iinarray[ii], jinarray[ii], einarray[ii], dinarray[ii]);
    }
    if (ffdcol(fptr, 3, &status) > 0)
        goto errstatus;

    ffgcvs(fptr, 1, 1, 1, nrows, "UNDEFINED", inskey,   &anynull, &status);
    ffgcvb(fptr, 2, 1, 1, nrows, 99, binarray, &anynull, &status);
    ffgcvi(fptr, 2, 1, 1, nrows, 99, iinarray, &anynull, &status);
    ffgcve(fptr, 3, 1, 1, nrows, 99., einarray, &anynull, &status);
    ffgcvd(fptr, 4, 1, 1, nrows, 99., dinarray, &anynull, &status);

    printf("\nData values after deleting column 3:\n");
    for (ii = 0; ii < nrows; ii++)
    {
      printf("%15s %2d %2d %4.1f %4.1f\n", inskey[ii], binarray[ii],
          iinarray[ii], einarray[ii], dinarray[ii]);
    }

    if (fficol(fptr, 5, "INSERT_COL", "F14.6", &status) > 0)
        goto errstatus;

    ffgcvs(fptr, 1, 1, 1, nrows, "UNDEFINED", inskey,   &anynull, &status);
    ffgcvb(fptr, 2, 1, 1, nrows, 99, binarray, &anynull, &status);
    ffgcvi(fptr, 2, 1, 1, nrows, 99, iinarray, &anynull, &status);
    ffgcve(fptr, 3, 1, 1, nrows, 99., einarray, &anynull, &status);
    ffgcvd(fptr, 4, 1, 1, nrows, 99., dinarray, &anynull, &status);
    ffgcvj(fptr, 5, 1, 1, nrows, 99, jinarray, &anynull, &status);

    printf("\nData values after inserting column 5:\n");
    for (ii = 0; ii < nrows; ii++)
    {
      printf("%15s %2d %2d %4.1f %4.1f %ld\n", inskey[ii], binarray[ii],
          iinarray[ii], einarray[ii], dinarray[ii] , jinarray[ii]);
    }

    /*
      ############################################################
      #  create a temporary file and copy the ASCII table to it, #
      #  column by column.                                       #
      ############################################################
    */
    bitpix = 16;
    naxis = 0;

    strcpy(filename, "!t1q2s3v6.tmp");
    ffinit(&tmpfptr, filename, &status);
    printf("Create temporary file: ffinit status = %d\n", status);

    ffiimg(tmpfptr, bitpix, naxis, naxes, &status);
    printf("\nCreate null primary array: ffiimg status = %d\n", status);

    /* create an empty table with 12 rows and 0 columns */
    nrows = 12;
    tfields = 0;
    rowlen = 0;
    ffitab(tmpfptr, rowlen, nrows, tfields, ttype, tbcol, tform, tunit,
           tblname, &status);
    printf("\nCreate ASCII table with 0 columns: ffitab status = %d\n",
           status);

    /* copy columns from one table to the other */
    ffcpcl(fptr, tmpfptr, 4, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);
    ffcpcl(fptr, tmpfptr, 3, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);
    ffcpcl(fptr, tmpfptr, 2, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);
    ffcpcl(fptr, tmpfptr, 1, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);

    /* now repeat by copying ASCII input to Binary output table */
    ffibin(tmpfptr, nrows, tfields, ttype, tform, tunit,
           tblname,  0L, &status);
    printf("\nCreate Binary table with 0 columns: ffibin status = %d\n",
           status);

    /* copy columns from one table to the other */
    ffcpcl(fptr, tmpfptr, 4, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);
    ffcpcl(fptr, tmpfptr, 3, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);
    ffcpcl(fptr, tmpfptr, 2, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);
    ffcpcl(fptr, tmpfptr, 1, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);


/*
    ffclos(tmpfptr, &status);
    printf("Close the tmp file: ffclos status = %d\n", status);
*/

    ffdelt(tmpfptr, &status);  
    printf("Delete the tmp file: ffdelt status = %d\n", status);

    if (status > 0)
    {
        goto errstatus;
    }

    /*
      ################################
      #  read data from binary table #
      ################################
    */

    if (ffmrhd(fptr, 1, &hdutype, &status) > 0)
        goto errstatus;

    printf("HDU number = %d\n", ffghdn(fptr, &hdunum));

    ffghsp(fptr, &existkeys, &morekeys, &status);
    printf("header contains %d keywords with room for %d more\n",existkeys,
            morekeys);

    ffghbn(fptr, 99, &nrows, &tfields, ttype, 
           tform, tunit, binname, &pcount, &status);

    printf("\nBinary table: nrows, tfields, extname, pcount: %ld %d %s %ld\n",
           nrows, tfields, binname, pcount);

    for (ii = 0; ii < tfields; ii++)
      printf("%8s %8s %8s \n", ttype[ii], tform[ii], tunit[ii]);

    for (ii = 0; ii < 40; ii++)
        larray[ii] = 0;

    printf("\nData values read from binary table:\n");
    printf("  Bit column (X) data values: \n\n");

    ffgcx(fptr, 3, 1, 1, 36, larray, &status);
    for (jj = 0; jj < 5; jj++)
    {
      for (ii = 0; ii < 8; ii++)
        printf("%1d",larray[jj * 8 + ii]);
      printf(" ");
    }

    for (ii = 0; ii < nrows; ii++)
    {
      larray[ii] = 0;
      xinarray[ii] = 0;
      binarray[ii] = 0;
      iinarray[ii] = 0; 
      kinarray[ii] = 0;
      einarray[ii] = 0.; 
      dinarray[ii] = 0.;
      cinarray[ii * 2] = 0.; 
      minarray[ii * 2] = 0.;
      cinarray[ii * 2 + 1] = 0.; 
      minarray[ii * 2 + 1] = 0.;
    }

    printf("\n\n");
    ffgcvs(fptr, 1, 4, 1, 1, "",  inskey,   &anynull, &status);
    printf("null string column value = -%s- (should be --)\n",inskey[0]);

    nrows = 21;
    ffgcvs(fptr, 1, 1, 1, nrows, "NOT DEFINED",  inskey,   &anynull, &status);
    ffgcl( fptr, 2, 1, 1, nrows, larray, &status);
    ffgcvb(fptr, 3, 1, 1, nrows, 98, xinarray, &anynull, &status);
    ffgcvb(fptr, 4, 1, 1, nrows, 98, binarray, &anynull, &status);
    ffgcvi(fptr, 5, 1, 1, nrows, 98, iinarray, &anynull, &status);
    ffgcvk(fptr, 6, 1, 1, nrows, 98, kinarray, &anynull, &status);
    ffgcve(fptr, 7, 1, 1, nrows, 98., einarray, &anynull, &status);
    ffgcvd(fptr, 8, 1, 1, nrows, 98., dinarray, &anynull, &status);
    ffgcvc(fptr, 9, 1, 1, nrows, 98., cinarray, &anynull, &status);
    ffgcvm(fptr, 10, 1, 1, nrows, 98., minarray, &anynull, &status);

    printf("\nRead columns with ffgcv_:\n");
    for (ii = 0; ii < nrows; ii++)
    {
  printf("%15s %d %3d %2d %3d %3d %5.1f %5.1f (%5.1f,%5.1f) (%5.1f,%5.1f) \n",
        inskey[ii], larray[ii], xinarray[ii], binarray[ii], iinarray[ii], 
        kinarray[ii], einarray[ii], dinarray[ii], cinarray[ii * 2], 
        cinarray[ii * 2 + 1], minarray[ii * 2], minarray[ii * 2 + 1]);
    }

    for (ii = 0; ii < nrows; ii++)
    {
      larray[ii] = 0;
      xinarray[ii] = 0;
      binarray[ii] = 0;
      iinarray[ii] = 0; 
      kinarray[ii] = 0;
      einarray[ii] = 0.; 
      dinarray[ii] = 0.;
      cinarray[ii * 2] = 0.; 
      minarray[ii * 2] = 0.;
      cinarray[ii * 2 + 1] = 0.; 
      minarray[ii * 2 + 1] = 0.;
    }

    ffgcfs(fptr, 1, 1, 1, nrows, inskey,   larray2, &anynull, &status);
    ffgcfl(fptr, 2, 1, 1, nrows, larray,   larray2, &anynull, &status);
    ffgcfb(fptr, 3, 1, 1, nrows, xinarray, larray2, &anynull, &status);
    ffgcfb(fptr, 4, 1, 1, nrows, binarray, larray2, &anynull, &status);
    ffgcfi(fptr, 5, 1, 1, nrows, iinarray, larray2, &anynull, &status);
    ffgcfk(fptr, 6, 1, 1, nrows, kinarray, larray2, &anynull, &status);
    ffgcfe(fptr, 7, 1, 1, nrows, einarray, larray2, &anynull, &status);
    ffgcfd(fptr, 8, 1, 1, nrows, dinarray, larray2, &anynull, &status);
    ffgcfc(fptr, 9, 1, 1, nrows, cinarray, larray2, &anynull, &status);
    ffgcfm(fptr, 10, 1, 1, nrows, minarray, larray2, &anynull, &status);

    printf("\nRead columns with ffgcf_:\n");
    for (ii = 0; ii < 10; ii++)
    {
    
    printf("%15s %d %3d %2d %3d %3d %5.1f %5.1f (%5.1f,%5.1f) (%5.1f,%5.1f)\n",
        inskey[ii], larray[ii], xinarray[ii], binarray[ii], iinarray[ii], 
        kinarray[ii], einarray[ii], dinarray[ii], cinarray[ii * 2], 
        cinarray[ii * 2 + 1], minarray[ii * 2], minarray[ii * 2 + 1]);
    }
    for (ii = 10; ii < nrows; ii++)
    {
      /* don't try to print the NaN values */
      printf("%15s %d %3d %2d %3d \n",
        inskey[ii], larray[ii], xinarray[ii], binarray[ii], iinarray[ii]);
    }
    ffprec(fptr, 
    "key_prec= 'This keyword was written by f_prec' / comment here", &status);

    /*
      ###############################################
      #  test the insert/delete row/column routines #
      ###############################################
    */
    if (ffirow(fptr, 2, 3, &status) > 0)
        goto errstatus;

    nrows = 14;
    ffgcvs(fptr, 1, 1, 1, nrows, "NOT DEFINED",  inskey,   &anynull, &status);
    ffgcvb(fptr, 4, 1, 1, nrows, 98, binarray, &anynull, &status);
    ffgcvi(fptr, 5, 1, 1, nrows, 98, iinarray, &anynull, &status);
    ffgcvj(fptr, 6, 1, 1, nrows, 98, jinarray, &anynull, &status);
    ffgcve(fptr, 7, 1, 1, nrows, 98., einarray, &anynull, &status);
    ffgcvd(fptr, 8, 1, 1, nrows, 98., dinarray, &anynull, &status);

    printf("\nData values after inserting 3 rows after row 2:\n");
    for (ii = 0; ii < nrows; ii++)
    {
      printf("%15s %2d %3d %3ld %5.1f %5.1f\n",  inskey[ii], binarray[ii],
          iinarray[ii], jinarray[ii], einarray[ii], dinarray[ii]);
    }

    if (ffdrow(fptr, 10, 2, &status) > 0)
        goto errstatus;

    nrows = 12;
    ffgcvs(fptr, 1, 1, 1, nrows, "NOT DEFINED",  inskey,   &anynull, &status);
    ffgcvb(fptr, 4, 1, 1, nrows, 98, binarray, &anynull, &status);
    ffgcvi(fptr, 5, 1, 1, nrows, 98, iinarray, &anynull, &status);
    ffgcvj(fptr, 6, 1, 1, nrows, 98, jinarray, &anynull, &status);
    ffgcve(fptr, 7, 1, 1, nrows, 98., einarray, &anynull, &status);
    ffgcvd(fptr, 8, 1, 1, nrows, 98., dinarray, &anynull, &status);

    printf("\nData values after deleting 2 rows at row 10:\n");
    for (ii = 0; ii < nrows; ii++)
    {
      printf("%15s %2d %3d %3ld %5.1f %5.1f\n",  inskey[ii], binarray[ii],
          iinarray[ii], jinarray[ii], einarray[ii], dinarray[ii]);
    }

    if (ffdcol(fptr, 6, &status) > 0)
        goto errstatus;

    ffgcvs(fptr, 1, 1, 1, nrows, "NOT DEFINED",  inskey,   &anynull, &status);
    ffgcvb(fptr, 4, 1, 1, nrows, 98, binarray, &anynull, &status);
    ffgcvi(fptr, 5, 1, 1, nrows, 98, iinarray, &anynull, &status);
    ffgcve(fptr, 6, 1, 1, nrows, 98., einarray, &anynull, &status);
    ffgcvd(fptr, 7, 1, 1, nrows, 98., dinarray, &anynull, &status);

    printf("\nData values after deleting column 6:\n");
    for (ii = 0; ii < nrows; ii++)
    {
      printf("%15s %2d %3d %5.1f %5.1f\n", inskey[ii], binarray[ii],
          iinarray[ii], einarray[ii], dinarray[ii]);
    }

    if (fficol(fptr, 8, "INSERT_COL", "1E", &status) > 0)
        goto errstatus;

    ffgcvs(fptr, 1, 1, 1, nrows, "NOT DEFINED",  inskey,   &anynull, &status);
    ffgcvb(fptr, 4, 1, 1, nrows, 98, binarray, &anynull, &status);
    ffgcvi(fptr, 5, 1, 1, nrows, 98, iinarray, &anynull, &status);
    ffgcve(fptr, 6, 1, 1, nrows, 98., einarray, &anynull, &status);
    ffgcvd(fptr, 7, 1, 1, nrows, 98., dinarray, &anynull, &status);
    ffgcvj(fptr, 8, 1, 1, nrows, 98, jinarray, &anynull, &status);

    printf("\nData values after inserting column 8:\n");
    for (ii = 0; ii < nrows; ii++)
    {
      printf("%15s %2d %3d %5.1f %5.1f %ld\n", inskey[ii], binarray[ii],
          iinarray[ii], einarray[ii], dinarray[ii] , jinarray[ii]);
    }

    ffpclu(fptr, 8, 1, 1, 10, &status);

    ffgcvs(fptr, 1, 1, 1, nrows, "NOT DEFINED",  inskey,   &anynull, &status);
    ffgcvb(fptr, 4, 1, 1, nrows, 98, binarray, &anynull, &status);
    ffgcvi(fptr, 5, 1, 1, nrows, 98, iinarray, &anynull, &status);
    ffgcve(fptr, 6, 1, 1, nrows, 98., einarray, &anynull, &status);
    ffgcvd(fptr, 7, 1, 1, nrows, 98., dinarray, &anynull, &status);
    ffgcvj(fptr, 8, 1, 1, nrows, 98, jinarray, &anynull, &status);

    printf("\nValues after setting 1st 10 elements in column 8 = null:\n");
    for (ii = 0; ii < nrows; ii++)
    {
      printf("%15s %2d %3d %5.1f %5.1f %ld\n", inskey[ii], binarray[ii],
          iinarray[ii], einarray[ii], dinarray[ii] , jinarray[ii]);
    }

    /*
      ############################################################
      #  create a temporary file and copy the binary table to it,#
      #  column by column.                                       #
      ############################################################
    */
    bitpix = 16;
    naxis = 0;

    strcpy(filename, "!t1q2s3v5.tmp");
    ffinit(&tmpfptr, filename, &status);
    printf("Create temporary file: ffinit status = %d\n", status);

    ffiimg(tmpfptr, bitpix, naxis, naxes, &status);
    printf("\nCreate null primary array: ffiimg status = %d\n", status);

    /* create an empty table with 22 rows and 0 columns */
    nrows = 22;
    tfields = 0;
    ffibin(tmpfptr, nrows, tfields, ttype, tform, tunit, binname, 0L,
            &status);
    printf("\nCreate binary table with 0 columns: ffibin status = %d\n",
           status);

    /* copy columns from one table to the other */
    ffcpcl(fptr, tmpfptr, 7, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);
    ffcpcl(fptr, tmpfptr, 6, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);
    ffcpcl(fptr, tmpfptr, 5, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);
    ffcpcl(fptr, tmpfptr, 4, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);
    ffcpcl(fptr, tmpfptr, 3, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);
    ffcpcl(fptr, tmpfptr, 2, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);
    ffcpcl(fptr, tmpfptr, 1, 1, TRUE, &status);
    printf("copy column, ffcpcl status = %d\n", status);

/*
    ffclos(tmpfptr, &status);
    printf("Close the tmp file: ffclos status = %d\n", status);
*/

    ffdelt(tmpfptr, &status);
    printf("Delete the tmp file: ffdelt status = %d\n", status);
    if (status > 0)
    {
        goto errstatus;
    }
    /*
      ####################################################
      #  insert binary table following the primary array #
      ####################################################
    */

    ffmahd(fptr,  1, &hdutype, &status);

    strcpy(tform[0], "15A");
    strcpy(tform[1], "1L");
    strcpy(tform[2], "16X");
    strcpy(tform[3], "1B");
    strcpy(tform[4], "1I");
    strcpy(tform[5], "1J");
    strcpy(tform[6], "1E");
    strcpy(tform[7], "1D");
    strcpy(tform[8], "1C");
    strcpy(tform[9], "1M");

    strcpy(ttype[0], "Avalue");
    strcpy(ttype[1], "Lvalue");
    strcpy(ttype[2], "Xvalue");
    strcpy(ttype[3], "Bvalue");
    strcpy(ttype[4], "Ivalue");
    strcpy(ttype[5], "Jvalue");
    strcpy(ttype[6], "Evalue");
    strcpy(ttype[7], "Dvalue");
    strcpy(ttype[8], "Cvalue");
    strcpy(ttype[9], "Mvalue");

    strcpy(tunit[0], "");
    strcpy(tunit[1], "m**2");
    strcpy(tunit[2], "cm");
    strcpy(tunit[3], "erg/s");
    strcpy(tunit[4], "km/s");
    strcpy(tunit[5], "");
    strcpy(tunit[6], "");
    strcpy(tunit[7], "");
    strcpy(tunit[8], "");
    strcpy(tunit[9], "");

    nrows = 20;
    tfields = 10;
    pcount = 0;

    ffibin(fptr, nrows, tfields, ttype, tform, tunit, binname, pcount,
            &status);
    printf("ffibin status = %d\n", status);
    printf("HDU number = %d\n", ffghdn(fptr, &hdunum));

    extvers = 3;
    ffpkyj(fptr, "EXTVER", extvers, "extension version number", &status);


    ffpkyj(fptr, "TNULL4", 77, "value for undefined pixels", &status);
    ffpkyj(fptr, "TNULL5", 77, "value for undefined pixels", &status);
    ffpkyj(fptr, "TNULL6", 77, "value for undefined pixels", &status);

    ffpkyj(fptr, "TSCAL4", 1000, "scaling factor", &status);
    ffpkyj(fptr, "TSCAL5", 1, "scaling factor", &status);
    ffpkyj(fptr, "TSCAL6", 100, "scaling factor", &status);

    ffpkyj(fptr, "TZERO4", 0, "scaling offset", &status);
    ffpkyj(fptr, "TZERO5", 32768, "scaling offset", &status);
    ffpkyj(fptr, "TZERO6", 100, "scaling offset", &status);

    fftnul(fptr, 4, 77, &status);   /* define null value for int cols */
    fftnul(fptr, 5, 77, &status);
    fftnul(fptr, 6, 77, &status);
    /* set scaling */
    fftscl(fptr, 4, 1000., 0., &status);   
    fftscl(fptr, 5, 1., 32768., &status);
    fftscl(fptr, 6, 100., 100., &status);

    /*
      ############################
      #  write data to columns   #
      ############################
    */

    /* initialize arrays of values to write to table */
 
    joutarray[0] = 0;
    joutarray[1] = 1000;
    joutarray[2] = 10000;
    joutarray[3] = 32768;
    joutarray[4] = 65535;


    for (ii = 4; ii < 7; ii++)
    {
        ffpclj(fptr, ii, 1, 1, 5, joutarray, &status); 
        if (status == NUM_OVERFLOW)
        {
            printf("Overflow writing to column %ld\n", ii);
            status = 0;
        }

        ffpclu(fptr, ii, 6, 1, 1, &status);  /* write null value */
    }

    for (jj = 4; jj < 7; jj++)
    {
      ffgcvj(fptr, jj, 1, 1, 6, -999, jinarray, &anynull, &status);
      for (ii = 0; ii < 6; ii++)
      {
        printf(" %6ld", jinarray[ii]);
      }
      printf("\n");
    }

    printf("\n");
    /* turn off scaling, and read the unscaled values */
    fftscl(fptr, 4, 1., 0., &status);   
    fftscl(fptr, 5, 1., 0., &status);
    fftscl(fptr, 6, 1., 0., &status);

    for (jj = 4; jj < 7; jj++)
    {
      ffgcvj(fptr, jj, 1, 1, 6, -999, jinarray, &anynull, &status);
      for (ii = 0; ii < 6; ii++)
      {
        printf(" %6ld", jinarray[ii]);
      }
      printf("\n");
    }
    /*
      ######################################################
      #  insert image extension following the binary table #
      ######################################################
    */

    bitpix = -32;
    naxis = 2;
    naxes[0] = 15;
    naxes[1] = 25;
    ffiimg(fptr, bitpix, naxis, naxes, &status);
    printf("\nCreate image extension: ffiimg status = %d\n", status);
    printf("HDU number = %d\n", ffghdn(fptr, &hdunum));

    for (jj = 0; jj < 30; jj++)
    {
      for (ii = 0; ii < 19; ii++)
      {
        imgarray[jj][ii] = (short) ((jj * 10) + ii);
      }
    }

    ffp2di(fptr, 1, 19, naxes[0], naxes[1], imgarray[0], &status);
    printf("\nWrote whole 2D array: ffp2di status = %d\n", status);

    for (jj = 0; jj < 30; jj++)
    {
      for (ii = 0; ii < 19; ii++)
      {
        imgarray[jj][ii] = 0;
      }
    }
    
    ffg2di(fptr, 1, 0, 19, naxes[0], naxes[1], imgarray[0], &anynull,
           &status);
    printf("\nRead whole 2D array: ffg2di status = %d\n", status);

    for (jj = 0; jj < 30; jj++)
    {
      for (ii = 0; ii < 19; ii++)
      {
        printf(" %3d", imgarray[jj][ii]);
      }
      printf("\n");
    }

    for (jj = 0; jj < 30; jj++)
    {
      for (ii = 0; ii < 19; ii++)
      {
        imgarray[jj][ii] = 0;
      }
    }
    
    for (jj = 0; jj < 20; jj++)
    {
      for (ii = 0; ii < 10; ii++)
      {
        imgarray2[jj][ii] = (short) ((jj * -10) - ii);
      }
    }

    fpixels[0] = 5;
    fpixels[1] = 5;
    lpixels[0] = 14;
    lpixels[1] = 14;
    ffpssi(fptr, 1, naxis, naxes, fpixels, lpixels, 
         imgarray2[0], &status);
    printf("\nWrote subset 2D array: ffpssi status = %d\n", status);

    ffg2di(fptr, 1, 0, 19, naxes[0], naxes[1], imgarray[0], &anynull,
           &status);
    printf("\nRead whole 2D array: ffg2di status = %d\n", status);

    for (jj = 0; jj < 30; jj++)
    {
      for (ii = 0; ii < 19; ii++)
      {
        printf(" %3d", imgarray[jj][ii]);
      }
      printf("\n");
    }

    fpixels[0] = 2;
    fpixels[1] = 5;
    lpixels[0] = 10;
    lpixels[1] = 8;
    inc[0] = 2;
    inc[1] = 3;

    for (jj = 0; jj < 30; jj++)
    {
      for (ii = 0; ii < 19; ii++)
      {
        imgarray[jj][ii] = 0;
      }
    }
    
    ffgsvi(fptr, 1, naxis, naxes, fpixels, lpixels, inc, 0,
          imgarray[0], &anynull, &status);
    printf("\nRead subset of 2D array: ffgsvi status = %d\n", status);

    for (ii = 0; ii < 10; ii++)
    {
        printf(" %3d", imgarray[0][ii]);
    }
    printf("\n");

    /*
      ###########################################################
      #  insert another image extension                         #
      #  copy the image extension to primary array of tmp file. #
      #  then delete the tmp file, and the image extension      #
      ###########################################################
    */
    bitpix = 16;
    naxis = 2;
    naxes[0] = 15;
    naxes[1] = 25;
    ffiimg(fptr, bitpix, naxis, naxes, &status);
    printf("\nCreate image extension: ffiimg status = %d\n", status);
    printf("HDU number = %d\n", ffghdn(fptr, &hdunum));

    strcpy(filename, "t1q2s3v4.tmp");
    ffinit(&tmpfptr, filename, &status);
    printf("Create temporary file: ffinit status = %d\n", status);

    ffcopy(fptr, tmpfptr, 0, &status);
    printf("Copy image extension to primary array of tmp file.\n");
    printf("ffcopy status = %d\n", status);

    ffgrec(tmpfptr, 1, card, &status);
    printf("%s\n", card);
    ffgrec(tmpfptr, 2, card, &status);
    printf("%s\n", card);
    ffgrec(tmpfptr, 3, card, &status);
    printf("%s\n", card);
    ffgrec(tmpfptr, 4, card, &status);
    printf("%s\n", card);
    ffgrec(tmpfptr, 5, card, &status);
    printf("%s\n", card);
    ffgrec(tmpfptr, 6, card, &status);
    printf("%s\n", card);

    ffdelt(tmpfptr, &status);
    printf("Delete the tmp file: ffdelt status = %d\n", status);

    ffdhdu(fptr, &hdutype, &status);
    printf("Delete the image extension; hdutype, status = %d %d\n",
             hdutype, status);
    printf("HDU number = %d\n", ffghdn(fptr, &hdunum));

    /*
      ###########################################################
      #  append bintable extension with variable length columns #
      ###########################################################
    */

    ffcrhd(fptr, &status);
    printf("ffcrhd status = %d\n", status);

    strcpy(tform[0], "1PA");
    strcpy(tform[1], "1PL");
    strcpy(tform[2], "1PB"); /* Fortran FITSIO doesn't support  1PX */
    strcpy(tform[3], "1PB");
    strcpy(tform[4], "1PI");
    strcpy(tform[5], "1PJ");
    strcpy(tform[6], "1PE");
    strcpy(tform[7], "1PD");
    strcpy(tform[8], "1PC");
    strcpy(tform[9], "1PM");

    strcpy(ttype[0], "Avalue");
    strcpy(ttype[1], "Lvalue");
    strcpy(ttype[2], "Xvalue");
    strcpy(ttype[3], "Bvalue");
    strcpy(ttype[4], "Ivalue");
    strcpy(ttype[5], "Jvalue");
    strcpy(ttype[6], "Evalue");
    strcpy(ttype[7], "Dvalue");
    strcpy(ttype[8], "Cvalue");
    strcpy(ttype[9], "Mvalue");

    strcpy(tunit[0], "");
    strcpy(tunit[1], "m**2");
    strcpy(tunit[2], "cm");
    strcpy(tunit[3], "erg/s");
    strcpy(tunit[4], "km/s");
    strcpy(tunit[5], "");
    strcpy(tunit[6], "");
    strcpy(tunit[7], "");
    strcpy(tunit[8], "");
    strcpy(tunit[9], "");

    nrows = 20;
    tfields = 10;
    pcount = 0;

    ffphbn(fptr, nrows, tfields, ttype, tform, tunit, binname, pcount,
            &status);
    printf("Variable length arrays: ffphbn status = %d\n", status);


    extvers = 4;
    ffpkyj(fptr, "EXTVER", extvers, "extension version number", &status);

    ffpkyj(fptr, "TNULL4", 88, "value for undefined pixels", &status);
    ffpkyj(fptr, "TNULL5", 88, "value for undefined pixels", &status);
    ffpkyj(fptr, "TNULL6", 88, "value for undefined pixels", &status);

    /*
      ############################
      #  write data to columns   #
      ############################
    */

    /* initialize arrays of values to write to table */
    strcpy(iskey,"abcdefghijklmnopqrst");

    for (ii = 0; ii < 20; ii++)
    {
        boutarray[ii] = (unsigned char) (ii + 1);
        ioutarray[ii] = (short) (ii + 1);
        joutarray[ii] = ii + 1;
        eoutarray[ii] = (float) (ii + 1);
        doutarray[ii] = ii + 1;
    }

    larray[0] = 0;
    larray[1] = 1;
    larray[2] = 0;
    larray[3] = 0;
    larray[4] = 1;
    larray[5] = 1;
    larray[6] = 0;
    larray[7] = 0;
    larray[8] = 0;
    larray[9] = 1;
    larray[10] = 1;
    larray[11] = 1;
    larray[12] = 0;
    larray[13] = 0;
    larray[14] = 0;
    larray[15] = 0;
    larray[16] = 1;
    larray[17] = 1;
    larray[18] = 1;
    larray[19] = 1;

    /* write values in 1st row */
    /*  strncpy(inskey[0], iskey, 1); */
      inskey[0][0] = '\0';  /* write a null string (i.e., a blank) */
      ffpcls(fptr, 1, 1, 1, 1, inskey, &status);  /* write string values */
      ffpcll(fptr, 2, 1, 1, 1, larray, &status);  /* write logicals */
      ffpclx(fptr, 3, 1, 1, 1, larray, &status);  /* write bits */
      ffpclb(fptr, 4, 1, 1, 1, boutarray, &status);
      ffpcli(fptr, 5, 1, 1, 1, ioutarray, &status); 
      ffpclj(fptr, 6, 1, 1, 1, joutarray, &status); 
      ffpcle(fptr, 7, 1, 1, 1, eoutarray, &status);
      ffpcld(fptr, 8, 1, 1, 1, doutarray, &status);

    for (ii = 2; ii <= 20; ii++)   /* loop over rows 1 - 20 */
    {
      strncpy(inskey[0], iskey, ii);
      inskey[0][ii] = '\0';
      ffpcls(fptr, 1, ii, 1, 1, inskey, &status);  /* write string values */

      ffpcll(fptr, 2, ii, 1, ii, larray, &status);  /* write logicals */
      ffpclu(fptr, 2, ii, ii-1, 1, &status);

      ffpclx(fptr, 3, ii, 1, ii, larray, &status);  /* write bits */

      ffpclb(fptr, 4, ii, 1, ii, boutarray, &status);
      ffpclu(fptr, 4, ii, ii-1, 1, &status);

      ffpcli(fptr, 5, ii, 1, ii, ioutarray, &status); 
      ffpclu(fptr, 5, ii, ii-1, 1, &status);

      ffpclj(fptr, 6, ii, 1, ii, joutarray, &status); 
      ffpclu(fptr, 6, ii, ii-1, 1, &status);

      ffpcle(fptr, 7, ii, 1, ii, eoutarray, &status);
      ffpclu(fptr, 7, ii, ii-1, 1, &status);

      ffpcld(fptr, 8, ii, 1, ii, doutarray, &status);
      ffpclu(fptr, 8, ii, ii-1, 1, &status);
    }
    printf("ffpcl_ status = %d\n", status);

    /*
      #################################
      #  close then reopen this HDU   #
      #################################
    */


     ffmrhd(fptr, -1, &hdutype, &status);
     ffmrhd(fptr,  1, &hdutype, &status);

    /*
      #############################
      #  read data from columns   #
      #############################
    */

    ffgkyj(fptr, "PCOUNT", &pcount, comm, &status);
    printf("PCOUNT = %ld\n", pcount);

    /* initialize the variables to be read */
    strcpy(inskey[0]," ");
    strcpy(iskey," ");


    printf("HDU number = %d\n", ffghdn(fptr, &hdunum));
    for (ii = 1; ii <= 20; ii++)   /* loop over rows 1 - 20 */
    {
      for (jj = 0; jj < ii; jj++)
      {
        larray[jj] = 0;
        boutarray[jj] = 0;
        ioutarray[jj] = 0;
        joutarray[jj] = 0;
        eoutarray[jj] = 0;
        doutarray[jj] = 0;
      }

      ffgcvs(fptr, 1, ii, 1, 1, iskey, inskey, &anynull, &status);  
      printf("A %s %d\nL", inskey[0], status);

      ffgcl( fptr, 2, ii, 1, ii, larray, &status); 
      for (jj = 0; jj < ii; jj++)
        printf(" %2d", larray[jj]);
      printf(" %d\nX", status);

      ffgcx(fptr, 3, ii, 1, ii, larray, &status);
      for (jj = 0; jj < ii; jj++)
        printf(" %2d", larray[jj]);
      printf(" %d\nB", status);

      ffgcvb(fptr, 4, ii, 1, ii, 99, boutarray, &anynull, &status);
      for (jj = 0; jj < ii; jj++)
        printf(" %2d", boutarray[jj]);
      printf(" %d\nI", status);

      ffgcvi(fptr, 5, ii, 1, ii, 99, ioutarray, &anynull, &status); 
      for (jj = 0; jj < ii; jj++)
        printf(" %2d", ioutarray[jj]);
      printf(" %d\nJ", status);

      ffgcvj(fptr, 6, ii, 1, ii, 99, joutarray, &anynull, &status); 
      for (jj = 0; jj < ii; jj++)
        printf(" %2ld", joutarray[jj]);
      printf(" %d\nE", status);

      ffgcve(fptr, 7, ii, 1, ii, 99., eoutarray, &anynull, &status);
      for (jj = 0; jj < ii; jj++)
        printf(" %2.0f", eoutarray[jj]);
      printf(" %d\nD", status);

      ffgcvd(fptr, 8, ii, 1, ii, 99., doutarray, &anynull, &status);
      for (jj = 0; jj < ii; jj++)
        printf(" %2.0f", doutarray[jj]);
      printf(" %d\n", status);

      ffgdes(fptr, 8, ii, &repeat, &offset, &status);
      printf("Column 8 repeat and offset = %ld %ld\n", repeat, offset);
    }

    /*
      #####################################
      #  create another image extension   #
      #####################################
    */

    bitpix = 32;
    naxis = 2;
    naxes[0] = 10;
    naxes[1] = 2;
    npixels = 20;
 
/*    ffcrim(fptr, bitpix, naxis, naxes, &status); */
    ffiimg(fptr, bitpix, naxis, naxes, &status);
    printf("\nffcrim status = %d\n", status);

    /* initialize arrays of values to write to primary array */
    for (ii = 0; ii < npixels; ii++)
    {
        boutarray[ii] = (unsigned char) (ii * 2);
        ioutarray[ii] = (short) (ii * 2);
        joutarray[ii] = ii * 2;
        koutarray[ii] = ii * 2;
        eoutarray[ii] = (float) (ii * 2);
        doutarray[ii] = ii * 2;
    }

    /* write a few pixels with each datatype */
    ffppr(fptr, TBYTE,   1,  2, &boutarray[0],  &status);
    ffppr(fptr, TSHORT,  3,  2, &ioutarray[2],  &status);
    ffppr(fptr, TINT,    5,  2, &koutarray[4],  &status);
    ffppr(fptr, TSHORT,  7,  2, &ioutarray[6],  &status);
    ffppr(fptr, TLONG,   9,  2, &joutarray[8],  &status);
    ffppr(fptr, TFLOAT,  11, 2, &eoutarray[10], &status);
    ffppr(fptr, TDOUBLE, 13, 2, &doutarray[12], &status);
    printf("ffppr status = %d\n", status);

    /* read back the pixels with each datatype */
    bnul = 0;
    inul = 0;
    knul = 0;
    jnul = 0;
    enul = 0.;
    dnul = 0.;

    ffgpv(fptr, TBYTE,   1,  14, &bnul, binarray, &anynull, &status);
    ffgpv(fptr, TSHORT,  1,  14, &inul, iinarray, &anynull, &status);
    ffgpv(fptr, TINT,    1,  14, &knul, kinarray, &anynull, &status);
    ffgpv(fptr, TLONG,   1,  14, &jnul, jinarray, &anynull, &status);
    ffgpv(fptr, TFLOAT,  1,  14, &enul, einarray, &anynull, &status);
    ffgpv(fptr, TDOUBLE, 1,  14, &dnul, dinarray, &anynull, &status);

    printf("\nImage values written with ffppr and read with ffgpv:\n");
    npixels = 14;
    for (ii = 0; ii < npixels; ii++)
        printf(" %2d", binarray[ii]);
    printf("  %d (byte)\n", anynull);  
    for (ii = 0; ii < npixels; ii++)
        printf(" %2d", iinarray[ii]);
    printf("  %d (short)\n", anynull);  
    for (ii = 0; ii < npixels; ii++)
        printf(" %2d", kinarray[ii]);
    printf("  %d (int)\n", anynull); 
    for (ii = 0; ii < npixels; ii++)
        printf(" %2ld", jinarray[ii]);
    printf("  %d (long)\n", anynull); 
    for (ii = 0; ii < npixels; ii++)
        printf(" %2.0f", einarray[ii]);
    printf("  %d (float)\n", anynull);
    for (ii = 0; ii < npixels; ii++)
        printf(" %2.0f", dinarray[ii]);
    printf("  %d (double)\n", anynull);

    /*
      ##########################################
      #  test world coordinate system routines #
      ##########################################
    */

    xrval = 45.83;
    yrval =  63.57;
    xrpix =  256.;
    yrpix =  257.;
    xinc =   -.00277777;
    yinc =   .00277777;

    /* write the WCS keywords */
    /* use example values from the latest WCS document */
    ffpkyd(fptr, "CRVAL1", xrval, 10, "comment", &status);
    ffpkyd(fptr, "CRVAL2", yrval, 10, "comment", &status);
    ffpkyd(fptr, "CRPIX1", xrpix, 10, "comment", &status);
    ffpkyd(fptr, "CRPIX2", yrpix, 10, "comment", &status);
    ffpkyd(fptr, "CDELT1", xinc, 10, "comment", &status);
    ffpkyd(fptr, "CDELT2", yinc, 10, "comment", &status);
 /*   ffpkyd(fptr, "CROTA2", rot, 10, "comment", &status); */
    ffpkys(fptr, "CTYPE1", xcoordtype, "comment", &status);
    ffpkys(fptr, "CTYPE2", ycoordtype, "comment", &status);
    printf("\nWrote WCS keywords status = %d\n",status);

    xrval =  0.;
    yrval =  0.;
    xrpix =  0.;
    yrpix =  0.;
    xinc =   0.;
    yinc =   0.;
    rot =    0.;

    ffgics(fptr, &xrval, &yrval, &xrpix,
           &yrpix, &xinc, &yinc, &rot, ctype, &status);
    printf("Read WCS keywords with ffgics status = %d\n",status);

    xpix = 0.5;
    ypix = 0.5;

    ffwldp(xpix,ypix,xrval,yrval,xrpix,yrpix,xinc,yinc,rot,ctype,
           &xpos, &ypos,&status);

    printf("  CRVAL1, CRVAL2 = %16.12f, %16.12f\n", xrval,yrval);
    printf("  CRPIX1, CRPIX2 = %16.12f, %16.12f\n", xrpix,yrpix);
    printf("  CDELT1, CDELT2 = %16.12f, %16.12f\n", xinc,yinc);
    printf("  Rotation = %10.3f, CTYPE = %s\n", rot, ctype);
    printf("Calculated sky coordinate with ffwldp status = %d\n",status);
    printf("  Pixels (%8.4f,%8.4f) --> (%11.6f, %11.6f) Sky\n",
            xpix,ypix,xpos,ypos);
    ffxypx(xpos,ypos,xrval,yrval,xrpix,yrpix,xinc,yinc,rot,ctype,
           &xpix, &ypix,&status);
    printf("Calculated pixel coordinate with ffxypx status = %d\n",status);
    printf("  Sky (%11.6f, %11.6f) --> (%8.4f,%8.4f) Pixels\n",
            xpos,ypos,xpix,ypix);
    /*
      ######################################
      #  append another ASCII table        #
      ######################################
    */

    strcpy(tform[0], "A15");
    strcpy(tform[1], "I11");
    strcpy(tform[2], "F15.6");
    strcpy(tform[3], "E13.5");
    strcpy(tform[4], "D22.14");

    strcpy(ttype[0], "Name");
    strcpy(ttype[1], "Ivalue");
    strcpy(ttype[2], "Fvalue");
    strcpy(ttype[3], "Evalue");
    strcpy(ttype[4], "Dvalue");

    strcpy(tunit[0], "");
    strcpy(tunit[1], "m**2");
    strcpy(tunit[2], "cm");
    strcpy(tunit[3], "erg/s");
    strcpy(tunit[4], "km/s");

    nrows = 11;
    tfields = 5;
    strcpy(tblname, "new_table");

    ffcrtb(fptr, ASCII_TBL, nrows, tfields, ttype, tform, tunit, tblname,
            &status);
    printf("\nffcrtb status = %d\n", status);

    extvers = 5;
    ffpkyj(fptr, "EXTVER", extvers, "extension version number", &status);

    ffpcl(fptr, TSTRING, 1, 1, 1, 3, onskey, &status);  /* write string values */

    /* initialize arrays of values to write */
    
    for (ii = 0; ii < npixels; ii++)
    {
        boutarray[ii] = (unsigned char) (ii * 3);
        ioutarray[ii] = (short) (ii * 3);
        joutarray[ii] = ii * 3;
        koutarray[ii] = ii * 3;
        eoutarray[ii] = (float) (ii * 3);
        doutarray[ii] = ii * 3;
    }

    for (ii = 2; ii < 6; ii++)   /* loop over cols 2 - 5 */
    {
        ffpcl(fptr, TBYTE,   ii, 1, 1, 2, boutarray,     &status); 
        ffpcl(fptr, TSHORT,  ii, 3, 1, 2, &ioutarray[2], &status);  
        ffpcl(fptr, TLONG,   ii, 5, 1, 2, &joutarray[4], &status);  
        ffpcl(fptr, TFLOAT,  ii, 7, 1, 2, &eoutarray[6], &status);
        ffpcl(fptr, TDOUBLE, ii, 9, 1, 2, &doutarray[8], &status); 
    }
    printf("ffpcl status = %d\n", status);

    /* read back the pixels with each datatype */
    ffgcv(fptr, TBYTE,   2, 1, 1, 10, &bnul, binarray, &anynull, &status);
    ffgcv(fptr, TSHORT,  2, 1, 1, 10, &inul, iinarray, &anynull, &status);
    ffgcv(fptr, TINT,    3, 1, 1, 10, &knul, kinarray, &anynull, &status);
    ffgcv(fptr, TLONG,   3, 1, 1, 10, &jnul, jinarray, &anynull, &status);
    ffgcv(fptr, TFLOAT,  4, 1, 1, 10, &enul, einarray, &anynull, &status);
    ffgcv(fptr, TDOUBLE, 5, 1, 1, 10, &dnul, dinarray, &anynull, &status);

    printf("\nColumn values written with ffpcl and read with ffgcl:\n");
    npixels = 10;
    for (ii = 0; ii < npixels; ii++)
        printf(" %2d", binarray[ii]);
    printf("  %d (byte)\n", anynull);  
    for (ii = 0; ii < npixels; ii++)
        printf(" %2d", iinarray[ii]);
    printf("  %d (short)\n", anynull);

    for (ii = 0; ii < npixels; ii++)
        printf(" %2d", kinarray[ii]);
    printf("  %d (int)\n", anynull); 

    for (ii = 0; ii < npixels; ii++)
        printf(" %2ld", jinarray[ii]);
    printf("  %d (long)\n", anynull); 
    for (ii = 0; ii < npixels; ii++)
        printf(" %2.0f", einarray[ii]);
    printf("  %d (float)\n", anynull);
    for (ii = 0; ii < npixels; ii++)
        printf(" %2.0f", dinarray[ii]);
    printf("  %d (double)\n", anynull);

    /*
      ###########################################################
      #  perform stress test by cycling thru all the extensions #
      ###########################################################
    */
    printf("\nRepeatedly move to the 1st 4 HDUs of the file:\n");
    for (ii = 0; ii < 10; ii++)
    {
      ffmahd(fptr,  1, &hdutype, &status);
      printf("%d", ffghdn(fptr, &hdunum));
      ffmrhd(fptr,  1, &hdutype, &status);
      printf("%d", ffghdn(fptr, &hdunum));
      ffmrhd(fptr,  1, &hdutype, &status);
      printf("%d", ffghdn(fptr, &hdunum));
      ffmrhd(fptr,  1, &hdutype, &status);
      printf("%d", ffghdn(fptr, &hdunum));
      ffmrhd(fptr, -1, &hdutype, &status);
      printf("%d", ffghdn(fptr, &hdunum));
      if (status > 0)
         break;
    }
    printf("\n");

    printf("Move to extensions by name and version number: (ffmnhd)\n");
    extvers = 1;
    ffmnhd(fptr, ANY_HDU, binname, (int) extvers, &status);
    ffghdn(fptr, &hdunum);
    printf(" %s, %ld = hdu %d, %d\n", binname, extvers, hdunum, status);
    extvers = 3;
    ffmnhd(fptr, ANY_HDU, binname, (int) extvers, &status);
    ffghdn(fptr, &hdunum);
    printf(" %s, %ld = hdu %d, %d\n", binname, extvers, hdunum, status);
    extvers = 4;
    ffmnhd(fptr, ANY_HDU, binname, (int) extvers, &status);
    ffghdn(fptr, &hdunum);
    printf(" %s, %ld = hdu %d, %d\n", binname, extvers, hdunum, status);


    strcpy(tblname, "Test-ASCII");
    extvers = 2;
    ffmnhd(fptr, ANY_HDU, tblname, (int) extvers, &status);
    ffghdn(fptr, &hdunum);
    printf(" %s, %ld = hdu %d, %d\n", tblname, extvers, hdunum, status);

    strcpy(tblname, "new_table");
    extvers = 5;
    ffmnhd(fptr, ANY_HDU, tblname, (int) extvers, &status);
    ffghdn(fptr, &hdunum);
    printf(" %s, %ld = hdu %d, %d\n", tblname, extvers, hdunum, status);
    extvers = 0;
    ffmnhd(fptr, ANY_HDU, binname, (int) extvers, &status);
    ffghdn(fptr, &hdunum);
    printf(" %s, %ld = hdu %d, %d\n", binname, extvers, hdunum, status);
    extvers = 17;
    ffmnhd(fptr, ANY_HDU, binname, (int) extvers, &status);
    ffghdn(fptr, &hdunum);
    printf(" %s, %ld = hdu %d, %d", binname, extvers, hdunum, status);
    printf (" (expect a 301 error status here)\n");
    status = 0;

    ffthdu(fptr, &hdunum, &status);
    printf("Total number of HDUs in the file = %d\n", hdunum);
    /*
      ########################
      #  checksum tests      #
      ########################
    */
    checksum = 1234567890;
    ffesum(checksum, 0, asciisum);
    printf("\nEncode checksum: %lu -> %s\n", checksum, asciisum);
    checksum = 0;
    ffdsum(asciisum, 0, &checksum);
    printf("Decode checksum: %s -> %lu\n", asciisum, checksum);

    ffpcks(fptr, &status);

    /*
       don't print the CHECKSUM value because it is different every day
       because the current date is in the comment field.

       ffgcrd(fptr, "CHECKSUM", card, &status);
       printf("%s\n", card);
    */

    ffgcrd(fptr, "DATASUM", card, &status);
    printf("%.30s\n", card);

    ffgcks(fptr, &datsum, &checksum, &status);
    printf("ffgcks data checksum, status = %lu, %d\n",
            datsum, status);

    ffvcks(fptr, &datastatus, &hdustatus, &status); 
    printf("ffvcks datastatus, hdustatus, status = %d %d %d\n",
              datastatus, hdustatus, status);
 
    ffprec(fptr,
    "new_key = 'written by fxprec' / to change checksum", &status);
    ffupck(fptr, &status);
    printf("ffupck status = %d\n", status);

    ffgcrd(fptr, "DATASUM", card, &status);
    printf("%.30s\n", card);
    ffvcks(fptr, &datastatus, &hdustatus, &status); 
    printf("ffvcks datastatus, hdustatus, status = %d %d %d\n",
              datastatus, hdustatus, status);
 
    /*
      delete the checksum keywords, so that the FITS file is always
      the same, regardless of the date of when testprog is run.
    */

    ffdkey(fptr, "CHECKSUM", &status);
    ffdkey(fptr, "DATASUM",  &status);

    /*
      ############################
      #  close file and quit     #
      ############################
    */

 errstatus:  /* jump here on error */

    ffclos(fptr, &status); 
    printf("ffclos status = %d\n", status);

    printf("\nNormally, there should be 8 error messages on the stack\n");
    printf("all regarding 'numerical overflows':\n");

    ffgmsg(errmsg);
    nmsg = 0;

    while (errmsg[0])
    {
        printf(" %s\n", errmsg);
        nmsg++;
        ffgmsg(errmsg);
    }

    if (nmsg != 8)
        printf("\nWARNING: Did not find the expected 8 error messages!\n");

    ffgerr(status, errmsg);
    printf("\nStatus = %d: %s\n", status, errmsg);

    /* free the allocated memory */
    for (ii = 0; ii < 21; ii++) 
        free(inskey[ii]);   
    for (ii = 0; ii < 10; ii++)
    {
      free(ttype[ii]);
      free(tform[ii]);
      free(tunit[ii]);
    }

    return(status);
}

cfitsio-3.47/testprog.out0000644000225700000360000007673713464573432015034 0ustar  cagordonlheaCFITSIO TESTPROG

Try opening then closing a nonexistent file:
  ffopen fptr, status  = 0 104 (expect an error)
  ffclos status = 115

ffinit create new file status = 0
Name of file = testprog.fit, I/O mode = 1

test writing of long string keywords:
 123456789012345678901234567890123456789012345678901234567890123456789012345
'12345678901234567890123456789012345678901234567890123456789012345678'
 1234567890123456789012345678901234567890123456789012345678901234'6789012345
'1234567890123456789012345678901234567890123456789012345678901234''67'
 1234567890123456789012345678901234567890123456789012345678901234''789012345
'1234567890123456789012345678901234567890123456789012345678901234'''''
 1234567890123456789012345678901234567890123456789012345678901234567'9012345
'1234567890123456789012345678901234567890123456789012345678901234567'
ffflus status = 0
HDU number = 1

Values read back from primary array (99 = null pixel)
The 1st, and every 4th pixel should be undefined:
 99  2  3 99  5  6  7 99  9 10 11 99 13 14 15 99 17 18 19 99  1 (ffgpvb)
 99  2  3 99  5  6  7 99  9 10 11 99 13 14 15 99 17 18 19 99  1 (ffgpvi)
 99  2  3 99  5  6  7 99  9 10 11 99 13 14 15 99 17 18 19 99  1 (ffgpvj)
 99  2  3 99  5  6  7 99  9 10 11 99 13 14 15 99 17 18 19 99  1 (ffgpve)
 99  2  3 99  5  6  7 99  9 10 11 99 13 14 15 99 17 18 19 99  1 (ffgpvd)
  *  2  3  *  5  6  7  *  9 10 11  * 13 14 15  * 17 18 19  *  1 (ffgpfb)
  *  2  3  *  5  6  7  *  9 10 11  * 13 14 15  * 17 18 19  *  1 (ffgpfi)
  *  2  3  *  5  6  7  *  9 10 11  * 13 14 15  * 17 18 19  *  1 (ffgpfj)
  *  2  3  *  5  6  7  *  9 10 11  * 13 14 15  * 17 18 19  *  1 (ffgpfe)
  *  2  3  *  5  6  7  *  9 10 11  * 13 14 15  * 17 18 19  *  1 (ffgpfd)

Closed then reopened the FITS file 10 times.
HDU number = 1
Name of file = testprog.fit, I/O mode = 1

Read back keywords:
simple = 1, bitpix = 32, naxis = 2, naxes = (10, 2)
  pcount = 0, gcount = 1, extend = 1
KEY_PREC= 'This keyword was written by fxprec' / comment goes here
KEY_PREC : 'This keyword was written by fxprec' : comment goes here :
KEY_PREC= 'This keyword was written by fxprec' / comment goes here
KY_PKNS1 : 'first string' : fxpkns comment :
KEY_PKYS value_string fxpkys comment 0
KEY_PKYL 1 fxpkyl comment 0
KEY_PKYJ 11 fxpkyj comment 0
KEY_PKYJ 11.000000 fxpkyj comment 0
KEY_PKYJ 11.000000 fxpkyj comment 0
KEY_PKY S value_string fxpkys comment 0
KEY_PKY L 1 fxpkyl comment 0
KEY_PKY BYTE 11 fxpkyj comment 0
KEY_PKY SHORT 11 fxpkyj comment 0
KEY_PKY INT 11 fxpkyj comment 0
KEY_PKY J 11 fxpkyj comment 0
KEY_PKY E 13.131310 fxpkye comment 0
KEY_PKY D 15.151515 fxpkyd comment 0
KEY_PKYF 12.121210 fxpkyf comment 0
KEY_PKYE 13.131310 fxpkye comment 0
KEY_PKYG 14.14141414141414 fxpkyg comment 0
KEY_PKYD 15.15151515151520 fxpkyd comment 0
KEY_PKYC 13.131310 14.141410 fxpkyc comment 0
KEY_PKFC 13.131313 14.141414 fxpkfc comment 0
KEY_PKYM 15.151515 16.161616 fxpkym comment 0
KEY_PKFM 15.151515 16.161616 fxpkfm comment 0
KEY_PKYT 12345678 0.12345678901235 fxpkyt comment 0
KEY_PKY J 11 [km/s/Mpc] fxpkyj comment 0
KEY_PKY units = km/s/Mpc
KEY_PKY J 11 fxpkyj comment 0
KEY_PKY units = 
KEY_PKY J 11 [feet/second/second] fxpkyj comment 0
KEY_PKY units = feet/second/second
KEY_PKLS long string value = 
This is a very long string value that is continued over more than one keyword.
header contains 65 keywords; located at keyword 27 
ffgkns:  first string, second string, 
ffgknl:  1, 0, 1
ffgknj:  11, 12, 13
ffgkne:  13.131310, 14.141410, 15.151520
ffgknd:  15.151515, 16.161616, 17.171717

Before deleting the HISTORY and DATE keywords...
COMMENT 
HISTORY 
DATE    
KY_PKNS1

After deleting the keywords...
COMMENT   This keyword was written by fxpcom.
KY_PKNS1= 'first string'       / fxpkns comment

After inserting the keywords...
COMMENT   This keyword was written by fxpcom.
KY_IREC = 'This keyword inserted by fxirec'
KY_IKYS = 'insert_value_string' / ikys comment
KY_IKYJ =                   49 / ikyj comment
KY_IKYL =                    T / ikyl comment
KY_IKYE =           1.2346E+01 / ikye comment
KY_IKYD = 1.23456789012346E+01 / ikyd comment
KY_IKYF =              12.3456 / ikyf comment
KY_IKYG =     12.3456789012346 / ikyg comment
KY_PKNS1= 'first string'       / fxpkns comment

After modifying the keywords...
COMMENT   This keyword was modified by fxmrec
KY_MREC = 'This keyword was modified by fxmcrd'
NEWIKYS = 'modified_string'    / ikys comment
KY_IKYJ =                   50 / This is a modified comment
KY_IKYL =                    F / ikyl comment
KY_IKYE =          -1.2346E+01 / ikye comment
KY_IKYD = -1.23456789012346E+01 / modified comment
KY_IKYF =             -12.3456 / ikyf comment
KY_IKYG =    -12.3456789012346 / ikyg comment
KY_PKNS1= 'first string'       / fxpkns comment

After updating the keywords...
COMMENT   This keyword was modified by fxmrec
KY_UCRD = 'This keyword was updated by fxucrd'
NEWIKYS = 'updated_string'     / ikys comment
KY_IKYJ =                   51 / This is a modified comment
KY_IKYL =                    T / ikyl comment
KY_IKYE =          -1.3346E+01 / ikye comment
KY_IKYD = -1.33456789012346E+01 / modified comment
KY_IKYF =             -13.3456 / ikyf comment
KY_IKYG =    -13.3456789012346 / ikyg comment
KY_PKNS1= 'first string'       / fxpkns comment

Keywords found using wildcard search (should be 13)...
KEY_PKYS= 'value_string'       / fxpkys comment
KEY_PKYL=                    T / fxpkyl comment
KEY_PKYJ=                   11 / [feet/second/second] fxpkyj comment
KEY_PKYF=             12.12121 / fxpkyf comment
KEY_PKYE=         1.313131E+01 / fxpkye comment
KEY_PKYG=    14.14141414141414 / fxpkyg comment
KEY_PKYD= 1.51515151515152E+01 / fxpkyd comment
KEY_PKYC= (1.313131E+01, 1.414141E+01) / fxpkyc comment
KEY_PKYM= (1.51515151515152E+01, 1.61616161616162E+01) / fxpkym comment
KEY_PKFC= (13.131313, 14.141414) / fxpkfc comment
KEY_PKFM= (15.15151515151515, 16.16161616161616) / fxpkfm comment
KEY_PKYT= 12345678.1234567890123456 / fxpkyt comment
NEWIKYS = 'updated_string'     / ikys comment

Copied keyword: ffgkne:  14.141410, 15.151520, 13.131310
Updated header using template file (ffpktp)

ffibin status = 0
HDU number = 2
header contains 33 keywords; located at keyword 1 
header contains 33 keywords with room for 74 more
TDIM3 = (1,2,8), 3, 1, 2, 8
ffpcl_ status = 0

Find the column numbers; a returned status value of 237 is
expected and indicates that more than one column name matches
the input column name template.  Status = 219 indicates that
there was no matching column name.
Column Xvalue is number 3; status = 0.
Column Avalue is number 1; status = 237.
Column Lvalue is number 2; status = 237.
Column Xvalue is number 3; status = 237.
Column Bvalue is number 4; status = 237.
Column Ivalue is number 5; status = 237.
Column Jvalue is number 6; status = 237.
Column Evalue is number 7; status = 237.
Column Dvalue is number 8; status = 237.
Column Cvalue is number 9; status = 237.
Column Mvalue is number 10; status = 237.
Column  is number 0; status = 219.

Information about each column:
 15A  16 15 15 Avalue, , A, 15, 1.000000, 0.000000, 1234554321, .
  1L  14  1  1 Lvalue, m**2, L, 1, 1.000000, 0.000000, 1234554321, .
 16X   1 16  1 Xvalue, cm, X, 16, 1.000000, 0.000000, 1234554321, .
  1B  11  1  1 Bvalue, erg/s, B, 1, 1.000000, 0.000000, 99, .
  1I  21  1  2 Ivalue, km/s, I, 1, 1.000000, 0.000000, 99, .
  1J  41  1  4 Jvalue, , J, 1, 1.000000, 0.000000, 99, .
  1E  42  1  4 Evalue, , E, 1, 1.000000, 0.000000, 1234554321, .
  1D  82  1  8 Dvalue, , D, 1, 1.000000, 0.000000, 1234554321, .
  1C  83  1  8 Cvalue, , C, 1, 1.000000, 0.000000, 1234554321, .
  1M 163  1 16 Mvalue, , M, 1, 1.000000, 0.000000, 1234554321, .

ffitab status = 0
HDU number = 2
ffpcl_ status = 0

ASCII table: rowlen, nrows, tfields, extname: 76 11 5 Test-ASCII
    Name   1      A15          
  Ivalue  17      I10     m**2 
  Fvalue  28    F14.6       cm 
  Evalue  43    E12.5    erg/s 
  Dvalue  56   D21.14     km/s 

Data values read from ASCII table:
   first string  1  1  1  1.0  1.0
  second string  2  2  2  2.0  2.0
                 3  3  3  3.0  3.0
      UNDEFINED  4  4  4  4.0  4.0
                 5  5  5  5.0  5.0
                 6  6  6  6.0  6.0
                 7  7  7  7.0  7.0
                 8  8  8  8.0  8.0
                 9  9  9  9.0  9.0
                10 10 10 10.0 10.0
                99 99 99 99.0 99.0

      1       1.000000  1.00000E+00  1.00000000000000E+00second string        

Column name is number 1; status = 0.
Column Ivalue is number 2; status = 237.
Column Fvalue is number 3; status = 237.
Column Evalue is number 4; status = 237.
Column Dvalue is number 5; status = 237.
Column  is number 0; status = 219.
 A15  16  1 15 Name, 1, , A15, 1.000000, 0.000000, null1, .
 I10  41  1 10 Ivalue, 17, m**2, I10, 1.000000, 0.000000, null2, .
F14.6  82  1 14 Fvalue, 28, cm, F14.6, 1.000000, 0.000000, null3, .
E12.5  42  1 12 Evalue, 43, erg/s, E12.5, 1.000000, 0.000000, null4, .
D21.14  82  1 21 Dvalue, 56, km/s, D21.14, 1.000000, 0.000000, null5, .


Data values after inserting 3 rows after row 2:
   first string  1  1  1  1.0  1.0
  second string  2  2  2  2.0  2.0
                 0  0  0  0.0  0.0
                 0  0  0  0.0  0.0
                 0  0  0  0.0  0.0
                 3  3  3  3.0  3.0
      UNDEFINED  4  4  4  4.0  4.0
                 5  5  5  5.0  5.0
                 6  6  6  6.0  6.0
                 7  7  7  7.0  7.0
                 8  8  8  8.0  8.0
                 9  9  9  9.0  9.0
                10 10 10 10.0 10.0
                99 99 99 99.0 99.0

Data values after deleting 2 rows at row 10:
   first string  1  1  1  1.0  1.0
  second string  2  2  2  2.0  2.0
                 0  0  0  0.0  0.0
                 0  0  0  0.0  0.0
                 0  0  0  0.0  0.0
                 3  3  3  3.0  3.0
      UNDEFINED  4  4  4  4.0  4.0
                 5  5  5  5.0  5.0
                 6  6  6  6.0  6.0
                 9  9  9  9.0  9.0
                10 10 10 10.0 10.0
                99 99 99 99.0 99.0

Data values after deleting column 3:
   first string  1  1  1.0  1.0
  second string  2  2  2.0  2.0
                 0  0  0.0  0.0
                 0  0  0.0  0.0
                 0  0  0.0  0.0
                 3  3  3.0  3.0
      UNDEFINED  4  4  4.0  4.0
                 5  5  5.0  5.0
                 6  6  6.0  6.0
                 9  9  9.0  9.0
                10 10 10.0 10.0
                99 99 99.0 99.0

Data values after inserting column 5:
   first string  1  1  1.0  1.0 0
  second string  2  2  2.0  2.0 0
                 0  0  0.0  0.0 0
                 0  0  0.0  0.0 0
                 0  0  0.0  0.0 0
                 3  3  3.0  3.0 0
      UNDEFINED  4  4  4.0  4.0 0
                 5  5  5.0  5.0 0
                 6  6  6.0  6.0 0
                 9  9  9.0  9.0 0
                10 10 10.0 10.0 0
                99 99 99.0 99.0 0
Create temporary file: ffinit status = 0

Create null primary array: ffiimg status = 0

Create ASCII table with 0 columns: ffitab status = 0
copy column, ffcpcl status = 0
copy column, ffcpcl status = 0
copy column, ffcpcl status = 0
copy column, ffcpcl status = 0

Create Binary table with 0 columns: ffibin status = 0
copy column, ffcpcl status = 0
copy column, ffcpcl status = 0
copy column, ffcpcl status = 0
copy column, ffcpcl status = 0
Delete the tmp file: ffdelt status = 0
HDU number = 3
header contains 38 keywords with room for 69 more

Binary table: nrows, tfields, extname, pcount: 21 10 Test-BINTABLE 0
  Avalue      15A          
  Lvalue       1L     m**2 
  Xvalue      16X       cm 
  Bvalue       1B    erg/s 
  Ivalue       1I     km/s 
  Jvalue       1J          
  Evalue       1E          
  Dvalue       1D          
  Cvalue       1C          
  Mvalue       1M          

Data values read from binary table:
  Bit column (X) data values: 

01001100 01110000 11110000 01111100 00000000 

null string column value = -- (should be --)

Read columns with ffgcv_:
   first string 0  76  1   1   1   1.0   1.0 (  1.0, -2.0) (  1.0, -2.0) 
  second string 1 112  2   2   2   2.0   2.0 (  3.0, -4.0) (  3.0, -4.0) 
                0 240  3   3   3   3.0   3.0 (  5.0, -6.0) (  5.0, -6.0) 
    NOT DEFINED 0 124  0  -4  -4  -4.0  -4.0 (  7.0, -8.0) (  7.0, -8.0) 
    NOT DEFINED 1   0  5   5   5   5.0   5.0 (  9.0,-10.0) (  9.0,-10.0) 
    NOT DEFINED 1   0  0  -6  -6  -6.0  -6.0 ( 11.0,-12.0) ( 11.0,-12.0) 
    NOT DEFINED 0   0  7   7   7   7.0   7.0 ( 13.0,-14.0) ( 13.0,-14.0) 
    NOT DEFINED 0   0  0  -8  -8  -8.0  -8.0 ( 15.0,-16.0) ( 15.0,-16.0) 
    NOT DEFINED 0   0  9   9   9   9.0   9.0 ( 17.0,-18.0) ( 17.0,-18.0) 
    NOT DEFINED 1   0  0 -10 -10 -10.0 -10.0 ( 19.0,-20.0) ( 19.0,-20.0) 
    NOT DEFINED 0   0 98  98  98  98.0  98.0 (  0.0,  0.0) (  0.0,  0.0) 
    NOT DEFINED 1   0 12  12  12  12.0  12.0 (  0.0,  0.0) (  0.0,  0.0) 
    NOT DEFINED 0   0 98  98  98  98.0  98.0 (  0.0,  0.0) (  0.0,  0.0) 
    NOT DEFINED 0   0  0 -14 -14 -14.0 -14.0 (  0.0,  0.0) (  0.0,  0.0) 
    NOT DEFINED 0   0 98  98  98  98.0  98.0 (  0.0,  0.0) (  0.0,  0.0) 
    NOT DEFINED 0   0  0 -16 -16 -16.0 -16.0 (  0.0,  0.0) (  0.0,  0.0) 
    NOT DEFINED 1   0 98  98  98  98.0  98.0 (  0.0,  0.0) (  0.0,  0.0) 
    NOT DEFINED 1   0  0 -18 -18 -18.0 -18.0 (  0.0,  0.0) (  0.0,  0.0) 
    NOT DEFINED 1   0 98  98  98  98.0  98.0 (  0.0,  0.0) (  0.0,  0.0) 
    NOT DEFINED 1   0  0 -20 -20 -20.0 -20.0 (  0.0,  0.0) (  0.0,  0.0) 
    NOT DEFINED 0   0 98  98  98  98.0  98.0 (  0.0,  0.0) (  0.0,  0.0) 

Read columns with ffgcf_:
   first string 0  76  1   1   1   1.0   1.0 (  1.0, -2.0) (  1.0, -2.0)
  second string 1 112  2   2   2   2.0   2.0 (  3.0, -4.0) (  3.0, -4.0)
                0 240  3   3   3   3.0   3.0 (  5.0, -6.0) (  5.0, -6.0)
                0 124  0  -4  -4  -4.0  -4.0 (  7.0, -8.0) (  7.0, -8.0)
                1   0  5   5   5   5.0   5.0 (  9.0,-10.0) (  9.0,-10.0)
                1   0  0  -6  -6  -6.0  -6.0 ( 11.0,-12.0) ( 11.0,-12.0)
                0   0  7   7   7   7.0   7.0 ( 13.0,-14.0) ( 13.0,-14.0)
                0   0  0  -8  -8  -8.0  -8.0 ( 15.0,-16.0) ( 15.0,-16.0)
                0   0  9   9   9   9.0   9.0 ( 17.0,-18.0) ( 17.0,-18.0)
                1   0  0 -10 -10 -10.0 -10.0 ( 19.0,-20.0) ( 19.0,-20.0)
                0   0 99  99 
                1   0 12  12 
                0   0 99  99 
                0   0  0 -14 
                0   0 99  99 
                0   0  0 -16 
                1   0 99  99 
                1   0  0 -18 
                1   0 99  99 
                1   0  0 -20 
                0   0 99  99 

Data values after inserting 3 rows after row 2:
   first string  1   1   1   1.0   1.0
  second string  2   2   2   2.0   2.0
    NOT DEFINED  0   0   0   0.0   0.0
    NOT DEFINED  0   0   0   0.0   0.0
    NOT DEFINED  0   0   0   0.0   0.0
                 3   3   3   3.0   3.0
    NOT DEFINED  0  -4  -4  -4.0  -4.0
    NOT DEFINED  5   5   5   5.0   5.0
    NOT DEFINED  0  -6  -6  -6.0  -6.0
    NOT DEFINED  7   7   7   7.0   7.0
    NOT DEFINED  0  -8  -8  -8.0  -8.0
    NOT DEFINED  9   9   9   9.0   9.0
    NOT DEFINED  0 -10 -10 -10.0 -10.0
    NOT DEFINED 98  98  98  98.0  98.0

Data values after deleting 2 rows at row 10:
   first string  1   1   1   1.0   1.0
  second string  2   2   2   2.0   2.0
    NOT DEFINED  0   0   0   0.0   0.0
    NOT DEFINED  0   0   0   0.0   0.0
    NOT DEFINED  0   0   0   0.0   0.0
                 3   3   3   3.0   3.0
    NOT DEFINED  0  -4  -4  -4.0  -4.0
    NOT DEFINED  5   5   5   5.0   5.0
    NOT DEFINED  0  -6  -6  -6.0  -6.0
    NOT DEFINED  9   9   9   9.0   9.0
    NOT DEFINED  0 -10 -10 -10.0 -10.0
    NOT DEFINED 98  98  98  98.0  98.0

Data values after deleting column 6:
   first string  1   1   1.0   1.0
  second string  2   2   2.0   2.0
    NOT DEFINED  0   0   0.0   0.0
    NOT DEFINED  0   0   0.0   0.0
    NOT DEFINED  0   0   0.0   0.0
                 3   3   3.0   3.0
    NOT DEFINED  0  -4  -4.0  -4.0
    NOT DEFINED  5   5   5.0   5.0
    NOT DEFINED  0  -6  -6.0  -6.0
    NOT DEFINED  9   9   9.0   9.0
    NOT DEFINED  0 -10 -10.0 -10.0
    NOT DEFINED 98  98  98.0  98.0

Data values after inserting column 8:
   first string  1   1   1.0   1.0 0
  second string  2   2   2.0   2.0 0
    NOT DEFINED  0   0   0.0   0.0 0
    NOT DEFINED  0   0   0.0   0.0 0
    NOT DEFINED  0   0   0.0   0.0 0
                 3   3   3.0   3.0 0
    NOT DEFINED  0  -4  -4.0  -4.0 0
    NOT DEFINED  5   5   5.0   5.0 0
    NOT DEFINED  0  -6  -6.0  -6.0 0
    NOT DEFINED  9   9   9.0   9.0 0
    NOT DEFINED  0 -10 -10.0 -10.0 0
    NOT DEFINED 98  98  98.0  98.0 0

Values after setting 1st 10 elements in column 8 = null:
   first string  1   1   1.0   1.0 98
  second string  2   2   2.0   2.0 98
    NOT DEFINED  0   0   0.0   0.0 98
    NOT DEFINED  0   0   0.0   0.0 98
    NOT DEFINED  0   0   0.0   0.0 98
                 3   3   3.0   3.0 98
    NOT DEFINED  0  -4  -4.0  -4.0 98
    NOT DEFINED  5   5   5.0   5.0 98
    NOT DEFINED  0  -6  -6.0  -6.0 98
    NOT DEFINED  9   9   9.0   9.0 98
    NOT DEFINED  0 -10 -10.0 -10.0 0
    NOT DEFINED 98  98  98.0  98.0 0
Create temporary file: ffinit status = 0

Create null primary array: ffiimg status = 0

Create binary table with 0 columns: ffibin status = 0
copy column, ffcpcl status = 0
copy column, ffcpcl status = 0
copy column, ffcpcl status = 0
copy column, ffcpcl status = 0
copy column, ffcpcl status = 0
copy column, ffcpcl status = 0
copy column, ffcpcl status = 0
Delete the tmp file: ffdelt status = 0
ffibin status = 0
HDU number = 2
      0   1000  10000  33000  66000   -999
      0   1000  10000  32768  65535   -999
      0   1000  10000  32800  65500   -999

      0      1     10     33     66   -999
 -32768 -31768 -22768      0  32767   -999
     -1      9     99    327    654   -999

Create image extension: ffiimg status = 0
HDU number = 3

Wrote whole 2D array: ffp2di status = 0

Read whole 2D array: ffg2di status = 0
   0   1   2   3   4   5   6   7   8   9  10  11  12  13  14   0   0   0   0
  10  11  12  13  14  15  16  17  18  19  20  21  22  23  24   0   0   0   0
  20  21  22  23  24  25  26  27  28  29  30  31  32  33  34   0   0   0   0
  30  31  32  33  34  35  36  37  38  39  40  41  42  43  44   0   0   0   0
  40  41  42  43  44  45  46  47  48  49  50  51  52  53  54   0   0   0   0
  50  51  52  53  54  55  56  57  58  59  60  61  62  63  64   0   0   0   0
  60  61  62  63  64  65  66  67  68  69  70  71  72  73  74   0   0   0   0
  70  71  72  73  74  75  76  77  78  79  80  81  82  83  84   0   0   0   0
  80  81  82  83  84  85  86  87  88  89  90  91  92  93  94   0   0   0   0
  90  91  92  93  94  95  96  97  98  99 100 101 102 103 104   0   0   0   0
 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114   0   0   0   0
 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124   0   0   0   0
 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134   0   0   0   0
 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144   0   0   0   0
 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154   0   0   0   0
 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164   0   0   0   0
 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174   0   0   0   0
 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184   0   0   0   0
 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194   0   0   0   0
 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204   0   0   0   0
 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214   0   0   0   0
 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224   0   0   0   0
 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234   0   0   0   0
 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244   0   0   0   0
 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254   0   0   0   0
   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0

Wrote subset 2D array: ffpssi status = 0

Read whole 2D array: ffg2di status = 0
   0   1   2   3   4   5   6   7   8   9  10  11  12  13  14   0   0   0   0
  10  11  12  13  14  15  16  17  18  19  20  21  22  23  24   0   0   0   0
  20  21  22  23  24  25  26  27  28  29  30  31  32  33  34   0   0   0   0
  30  31  32  33  34  35  36  37  38  39  40  41  42  43  44   0   0   0   0
  40  41  42  43   0  -1  -2  -3  -4  -5  -6  -7  -8  -9  54   0   0   0   0
  50  51  52  53 -10 -11 -12 -13 -14 -15 -16 -17 -18 -19  64   0   0   0   0
  60  61  62  63 -20 -21 -22 -23 -24 -25 -26 -27 -28 -29  74   0   0   0   0
  70  71  72  73 -30 -31 -32 -33 -34 -35 -36 -37 -38 -39  84   0   0   0   0
  80  81  82  83 -40 -41 -42 -43 -44 -45 -46 -47 -48 -49  94   0   0   0   0
  90  91  92  93 -50 -51 -52 -53 -54 -55 -56 -57 -58 -59 104   0   0   0   0
 100 101 102 103 -60 -61 -62 -63 -64 -65 -66 -67 -68 -69 114   0   0   0   0
 110 111 112 113 -70 -71 -72 -73 -74 -75 -76 -77 -78 -79 124   0   0   0   0
 120 121 122 123 -80 -81 -82 -83 -84 -85 -86 -87 -88 -89 134   0   0   0   0
 130 131 132 133 -90 -91 -92 -93 -94 -95 -96 -97 -98 -99 144   0   0   0   0
 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154   0   0   0   0
 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164   0   0   0   0
 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174   0   0   0   0
 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184   0   0   0   0
 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194   0   0   0   0
 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204   0   0   0   0
 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214   0   0   0   0
 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224   0   0   0   0
 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234   0   0   0   0
 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244   0   0   0   0
 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254   0   0   0   0
   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0
   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0

Read subset of 2D array: ffgsvi status = 0
  41  43  -1  -3  -5  71  73 -31 -33 -35

Create image extension: ffiimg status = 0
HDU number = 4
Create temporary file: ffinit status = 0
Copy image extension to primary array of tmp file.
ffcopy status = 0
SIMPLE  =                    T / file does conform to FITS standard
BITPIX  =                   16 / number of bits per data pixel
NAXIS   =                    2 / number of data axes
NAXIS1  =                   15 / length of data axis 1
NAXIS2  =                   25 / length of data axis 2
EXTEND  =                    T / FITS dataset may contain extensions
Delete the tmp file: ffdelt status = 0
Delete the image extension; hdutype, status = 1 0
HDU number = 4
ffcrhd status = 0
Variable length arrays: ffphbn status = 0
ffpcl_ status = 0
PCOUNT = 4446
HDU number = 6
A   0
L  0 0
X  0 0
B  1 0
I  1 0
J  1 0
E  1 0
D  1 0
Column 8 repeat and offset = 1 14
A ab 0
L  0  1 0
X  0  1 0
B 99  2 0
I 99  2 0
J 99  2 0
E 99  2 0
D 99  2 0
Column 8 repeat and offset = 2 49
A abc 0
L  0  0  0 0
X  0  1  0 0
B  1 99  3 0
I  1 99  3 0
J  1 99  3 0
E  1 99  3 0
D  1 99  3 0
Column 8 repeat and offset = 3 105
A abcd 0
L  0  1  0  0 0
X  0  1  0  0 0
B  1  2 99  4 0
I  1  2 99  4 0
J  1  2 99  4 0
E  1  2 99  4 0
D  1  2 99  4 0
Column 8 repeat and offset = 4 182
A abcde 0
L  0  1  0  0  1 0
X  0  1  0  0  1 0
B  1  2  3 99  5 0
I  1  2  3 99  5 0
J  1  2  3 99  5 0
E  1  2  3 99  5 0
D  1  2  3 99  5 0
Column 8 repeat and offset = 5 280
A abcdef 0
L  0  1  0  0  0  1 0
X  0  1  0  0  1  1 0
B  1  2  3  4 99  6 0
I  1  2  3  4 99  6 0
J  1  2  3  4 99  6 0
E  1  2  3  4 99  6 0
D  1  2  3  4 99  6 0
Column 8 repeat and offset = 6 399
A abcdefg 0
L  0  1  0  0  1  0  0 0
X  0  1  0  0  1  1  0 0
B  1  2  3  4  5 99  7 0
I  1  2  3  4  5 99  7 0
J  1  2  3  4  5 99  7 0
E  1  2  3  4  5 99  7 0
D  1  2  3  4  5 99  7 0
Column 8 repeat and offset = 7 539
A abcdefgh 0
L  0  1  0  0  1  1  0  0 0
X  0  1  0  0  1  1  0  0 0
B  1  2  3  4  5  6 99  8 0
I  1  2  3  4  5  6 99  8 0
J  1  2  3  4  5  6 99  8 0
E  1  2  3  4  5  6 99  8 0
D  1  2  3  4  5  6 99  8 0
Column 8 repeat and offset = 8 700
A abcdefghi 0
L  0  1  0  0  1  1  0  0  0 0
X  0  1  0  0  1  1  0  0  0 0
B  1  2  3  4  5  6  7 99  9 0
I  1  2  3  4  5  6  7 99  9 0
J  1  2  3  4  5  6  7 99  9 0
E  1  2  3  4  5  6  7 99  9 0
D  1  2  3  4  5  6  7 99  9 0
Column 8 repeat and offset = 9 883
A abcdefghij 0
L  0  1  0  0  1  1  0  0  0  1 0
X  0  1  0  0  1  1  0  0  0  1 0
B  1  2  3  4  5  6  7  8 99 10 0
I  1  2  3  4  5  6  7  8 99 10 0
J  1  2  3  4  5  6  7  8 99 10 0
E  1  2  3  4  5  6  7  8 99 10 0
D  1  2  3  4  5  6  7  8 99 10 0
Column 8 repeat and offset = 10 1087
A abcdefghijk 0
L  0  1  0  0  1  1  0  0  0  0  1 0
X  0  1  0  0  1  1  0  0  0  1  1 0
B  1  2  3  4  5  6  7  8  9 99 11 0
I  1  2  3  4  5  6  7  8  9 99 11 0
J  1  2  3  4  5  6  7  8  9 99 11 0
E  1  2  3  4  5  6  7  8  9 99 11 0
D  1  2  3  4  5  6  7  8  9 99 11 0
Column 8 repeat and offset = 11 1312
A abcdefghijkl 0
L  0  1  0  0  1  1  0  0  0  1  0  1 0
X  0  1  0  0  1  1  0  0  0  1  1  1 0
B  1  2  3  4  5  6  7  8  9 10 99 12 0
I  1  2  3  4  5  6  7  8  9 10 99 12 0
J  1  2  3  4  5  6  7  8  9 10 99 12 0
E  1  2  3  4  5  6  7  8  9 10 99 12 0
D  1  2  3  4  5  6  7  8  9 10 99 12 0
Column 8 repeat and offset = 12 1558
A abcdefghijklm 0
L  0  1  0  0  1  1  0  0  0  1  1  0  0 0
X  0  1  0  0  1  1  0  0  0  1  1  1  0 0
B  1  2  3  4  5  6  7  8  9 10 11 99 13 0
I  1  2  3  4  5  6  7  8  9 10 11 99 13 0
J  1  2  3  4  5  6  7  8  9 10 11 99 13 0
E  1  2  3  4  5  6  7  8  9 10 11 99 13 0
D  1  2  3  4  5  6  7  8  9 10 11 99 13 0
Column 8 repeat and offset = 13 1825
A abcdefghijklmn 0
L  0  1  0  0  1  1  0  0  0  1  1  1  0  0 0
X  0  1  0  0  1  1  0  0  0  1  1  1  0  0 0
B  1  2  3  4  5  6  7  8  9 10 11 12 99 14 0
I  1  2  3  4  5  6  7  8  9 10 11 12 99 14 0
J  1  2  3  4  5  6  7  8  9 10 11 12 99 14 0
E  1  2  3  4  5  6  7  8  9 10 11 12 99 14 0
D  1  2  3  4  5  6  7  8  9 10 11 12 99 14 0
Column 8 repeat and offset = 14 2113
A abcdefghijklmno 0
L  0  1  0  0  1  1  0  0  0  1  1  1  0  0  0 0
X  0  1  0  0  1  1  0  0  0  1  1  1  0  0  0 0
B  1  2  3  4  5  6  7  8  9 10 11 12 13 99 15 0
I  1  2  3  4  5  6  7  8  9 10 11 12 13 99 15 0
J  1  2  3  4  5  6  7  8  9 10 11 12 13 99 15 0
E  1  2  3  4  5  6  7  8  9 10 11 12 13 99 15 0
D  1  2  3  4  5  6  7  8  9 10 11 12 13 99 15 0
Column 8 repeat and offset = 15 2422
A abcdefghijklmnop 0
L  0  1  0  0  1  1  0  0  0  1  1  1  0  0  0  0 0
X  0  1  0  0  1  1  0  0  0  1  1  1  0  0  0  0 0
B  1  2  3  4  5  6  7  8  9 10 11 12 13 14 99 16 0
I  1  2  3  4  5  6  7  8  9 10 11 12 13 14 99 16 0
J  1  2  3  4  5  6  7  8  9 10 11 12 13 14 99 16 0
E  1  2  3  4  5  6  7  8  9 10 11 12 13 14 99 16 0
D  1  2  3  4  5  6  7  8  9 10 11 12 13 14 99 16 0
Column 8 repeat and offset = 16 2752
A abcdefghijklmnopq 0
L  0  1  0  0  1  1  0  0  0  1  1  1  0  0  0  0  1 0
X  0  1  0  0  1  1  0  0  0  1  1  1  0  0  0  0  1 0
B  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 99 17 0
I  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 99 17 0
J  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 99 17 0
E  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 99 17 0
D  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 99 17 0
Column 8 repeat and offset = 17 3104
A abcdefghijklmnopqr 0
L  0  1  0  0  1  1  0  0  0  1  1  1  0  0  0  0  0  1 0
X  0  1  0  0  1  1  0  0  0  1  1  1  0  0  0  0  1  1 0
B  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 99 18 0
I  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 99 18 0
J  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 99 18 0
E  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 99 18 0
D  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 99 18 0
Column 8 repeat and offset = 18 3477
A abcdefghijklmnopqrs 0
L  0  1  0  0  1  1  0  0  0  1  1  1  0  0  0  0  1  0  1 0
X  0  1  0  0  1  1  0  0  0  1  1  1  0  0  0  0  1  1  1 0
B  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 99 19 0
I  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 99 19 0
J  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 99 19 0
E  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 99 19 0
D  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 99 19 0
Column 8 repeat and offset = 19 3871
A abcdefghijklmnopqrst 0
L  0  1  0  0  1  1  0  0  0  1  1  1  0  0  0  0  1  1  0  1 0
X  0  1  0  0  1  1  0  0  0  1  1  1  0  0  0  0  1  1  1  1 0
B  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 99 20 0
I  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 99 20 0
J  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 99 20 0
E  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 99 20 0
D  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 99 20 0
Column 8 repeat and offset = 20 4286

ffcrim status = 0
ffppr status = 0

Image values written with ffppr and read with ffgpv:
  0  2  4  6  8 10 12 14 16 18 20 22 24 26  0 (byte)
  0  2  4  6  8 10 12 14 16 18 20 22 24 26  0 (short)
  0  2  4  6  8 10 12 14 16 18 20 22 24 26  0 (int)
  0  2  4  6  8 10 12 14 16 18 20 22 24 26  0 (long)
  0  2  4  6  8 10 12 14 16 18 20 22 24 26  0 (float)
  0  2  4  6  8 10 12 14 16 18 20 22 24 26  0 (double)

Wrote WCS keywords status = 0
Read WCS keywords with ffgics status = 0
  CRVAL1, CRVAL2 =  45.830000000000,  63.570000000000
  CRPIX1, CRPIX2 = 256.000000000000, 257.000000000000
  CDELT1, CDELT2 =  -0.002777770000,   0.002777770000
  Rotation =      0.000, CTYPE = -TAN
Calculated sky coordinate with ffwldp status = 0
  Pixels (  0.5000,  0.5000) --> (  47.385204,   62.848968) Sky
Calculated pixel coordinate with ffxypx status = 0
  Sky (  47.385204,   62.848968) --> (  0.5000,  0.5000) Pixels

ffcrtb status = 0
ffpcl status = 0

Column values written with ffpcl and read with ffgcl:
  0  3  6  9 12 15 18 21 24 27  0 (byte)
  0  3  6  9 12 15 18 21 24 27  0 (short)
  0  3  6  9 12 15 18 21 24 27  0 (int)
  0  3  6  9 12 15 18 21 24 27  0 (long)
  0  3  6  9 12 15 18 21 24 27  0 (float)
  0  3  6  9 12 15 18 21 24 27  0 (double)

Repeatedly move to the 1st 4 HDUs of the file:
12343123431234312343123431234312343123431234312343
Move to extensions by name and version number: (ffmnhd)
 Test-BINTABLE, 1 = hdu 5, 0
 Test-BINTABLE, 3 = hdu 2, 0
 Test-BINTABLE, 4 = hdu 6, 0
 Test-ASCII, 2 = hdu 4, 0
 new_table, 5 = hdu 8, 0
 Test-BINTABLE, 0 = hdu 2, 0
 Test-BINTABLE, 17 = hdu 2, 301 (expect a 301 error status here)
Total number of HDUs in the file = 8

Encode checksum: 1234567890 -> dCW2fBU0dBU0dBU0
Decode checksum: dCW2fBU0dBU0dBU0 -> 1234567890
DATASUM = '475248536'         
ffgcks data checksum, status = 475248536, 0
ffvcks datastatus, hdustatus, status = 1 1 0
ffupck status = 0
DATASUM = '475248536'         
ffvcks datastatus, hdustatus, status = 1 1 0
ffclos status = 0

Normally, there should be 8 error messages on the stack
all regarding 'numerical overflows':
 Numerical overflow during type conversion while writing FITS data.
 Numerical overflow during type conversion while writing FITS data.
 Numerical overflow during type conversion while writing FITS data.
 Numerical overflow during type conversion while writing FITS data.
 Numerical overflow during type conversion while writing FITS data.
 Numerical overflow during type conversion while writing FITS data.
 Numerical overflow during type conversion while writing FITS data.
 Numerical overflow during type conversion while writing FITS data.

Status = 0: OK - no error
cfitsio-3.47/testprog.std0000644000225700000360000020700013464573432014772 0ustar  cagordonlheaSIMPLE  =                    T / file does conform to FITS standard             BITPIX  =                   32 / number of bits per data pixel                  NAXIS   =                    2 / number of data axes                            NAXIS1  =                   10 / length of data axis 1                          NAXIS2  =                    2 / length of data axis 2                          EXTEND  =                    T / FITS dataset may contain extensions            COMMENT   FITS (Flexible Image Transport System) format is defined in 'AstronomyCOMMENT   and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H KEY_PREC= 'This keyword was written by fxprec' / comment goes here              CARD1   = '12345678901234567890123456789012345678901234567890123456789012345678'CARD2   = '1234567890123456789012345678901234567890123456789012345678901234''67'CARD3   = '1234567890123456789012345678901234567890123456789012345678901234'''''CARD4   = '1234567890123456789012345678901234567890123456789012345678901234567' KEY_PKYS= 'value_string'       / fxpkys comment                                 KEY_PKYL=                    T / fxpkyl comment                                 KEY_PKYJ=                   11 / [feet/second/second] fxpkyj comment            KEY_PKYF=             12.12121 / fxpkyf comment                                 KEY_PKYE=         1.313131E+01 / fxpkye comment                                 KEY_PKYG=    14.14141414141414 / fxpkyg comment                                 KEY_PKYD= 1.51515151515152E+01 / fxpkyd comment                                 KEY_PKYC= (1.313131E+01, 1.414141E+01) / fxpkyc comment                         KEY_PKYM= (1.51515151515152E+01, 1.61616161616162E+01) / fxpkym comment         KEY_PKFC= (13.131313, 14.141414) / fxpkfc comment                               KEY_PKFM= (15.15151515151515, 16.16161616161616) / fxpkfm comment               KEY_PKLS= 'This is a very long string value that is continued over more than o&'CONTINUE  'ne keyword.'        / fxpkls comment                                 LONGSTRN= 'OGIP 1.0'           / The HEASARC Long String Convention may be used.COMMENT   This FITS file may contain long string keyword values that are        COMMENT   continued over multiple keywords.  The HEASARC convention uses the &  COMMENT   character at the end of each substring which is then continued        COMMENT   on the next keyword which has the name CONTINUE.                      KEY_PKYT= 12345678.1234567890123456 / fxpkyt comment                            COMMENT   This keyword was modified by fxmrec                                   KY_UCRD = 'This keyword was updated by fxucrd'                                  NEWIKYS = 'updated_string'     / ikys comment                                   KY_IKYJ =                   51 / This is a modified comment                     KY_IKYL =                    T / ikyl comment                                   KY_IKYE =          -1.3346E+01 / ikye comment                                   KY_IKYD = -1.33456789012346E+01 / modified comment                              KY_IKYF =             -13.3456 / ikyf comment                                   KY_IKYG =    -13.3456789012346 / ikyg comment                                   KY_PKNS1= 'first string'       / fxpkns comment                                 KY_PKNS2= 'second string'      / fxpkns comment                                 KY_PKNS3= '        '           / fxpkns comment                                 KY_PKNL1=                    T / fxpknl comment                                 KY_PKNL2=                    F / fxpknl comment                                 KY_PKNL3=                    T / fxpknl comment                                 KY_PKNJ1=                   11 / fxpknj comment                                 KY_PKNJ2=                   12 / fxpknj comment                                 KY_PKNJ3=                   13 / fxpknj comment                                 KY_PKNF1=             12.12121 / fxpknf comment                                 KY_PKNF2=             13.13131 / fxpknf comment                                 KY_PKNF3=             14.14141 / fxpknf comment                                 KY_PKNE1=         1.313131E+01 / fxpkne comment                                 KY_PKNE2=         1.414141E+01 / fxpkne comment                                 KY_PKNE3=         1.515152E+01 / fxpkne comment                                 KY_PKNG1=     14.1414141414141 / fxpkng comment                                 KY_PKNG2=     15.1515151515152 / fxpkng comment                                 KY_PKNG3=     16.1616161616162 / fxpkng comment                                 KY_PKND1= 1.51515151515152E+01 / fxpknd comment                                 KY_PKND2= 1.61616161616162E+01 / fxpknd comment                                 KY_PKND3= 1.71717171717172E+01 / fxpknd comment                                 TSTRING = '1       '           / tstring comment                                TLOGICAL=                    T / tlogical comment                               TBYTE   =                   11 / tbyte comment                                  TSHORT  =                   21 / tshort comment                                 TINT    =                   31 / tint comment                                   TLONG   =                   41 / tlong comment                                  TFLOAT  =                  42. / tfloat comment                                 TDOUBLE =                  82. / tdouble comment                                BLANK   =                  -99 / value to use for undefined pixels              KY_PKNE4=         1.313131E+01 / fxpkne comment                                 TMPCARDA=                 1001 / this is the 1st template card                  TMPCARD2= 'ABCD    '           / this is the 2nd template card                  TMPCARD3=              1001.23 / this is the 3rd template card                  COMMENT this is the 5th template card                                           HISTORY this is the 6th template card                                           TMPCARD7=                      / comment for null keyword                       END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             ÿÿÿÿÿÿÿÿÿ	
ÿÿÿ
ÿÿÿÿÿÿXTENSION= 'BINTABLE'           / binary table extension                         BITPIX  =                    8 / 8-bit bytes                                    NAXIS   =                    2 / 2-dimensional binary table                     NAXIS1  =                   61 / width of table in bytes                        NAXIS2  =                   20 / number of rows in table                        PCOUNT  =                    0 / size of special data area                      GCOUNT  =                    1 / one data group (required keyword)              TFIELDS =                   10 / number of fields in each row                   TTYPE1  = 'Avalue  '           / label for field   1                            TFORM1  = '15A     '           / data format of field: ASCII Character          TTYPE2  = 'Lvalue  '           / label for field   2                            TFORM2  = '1L      '           / data format of field: 1-byte LOGICAL           TUNIT2  = 'm**2    '           / physical unit of field                         TTYPE3  = 'Xvalue  '           / label for field   3                            TFORM3  = '16X     '           / data format of field: BIT                      TUNIT3  = 'cm      '           / physical unit of field                         TTYPE4  = 'Bvalue  '           / label for field   4                            TFORM4  = '1B      '           / data format of field: BYTE                     TUNIT4  = 'erg/s   '           / physical unit of field                         TTYPE5  = 'Ivalue  '           / label for field   5                            TFORM5  = '1I      '           / data format of field: 2-byte INTEGER           TUNIT5  = 'km/s    '           / physical unit of field                         TTYPE6  = 'Jvalue  '           / label for field   6                            TFORM6  = '1J      '           / data format of field: 4-byte INTEGER           TTYPE7  = 'Evalue  '           / label for field   7                            TFORM7  = '1E      '           / data format of field: 4-byte REAL              TTYPE8  = 'Dvalue  '           / label for field   8                            TFORM8  = '1D      '           / data format of field: 8-byte DOUBLE            TTYPE9  = 'Cvalue  '           / label for field   9                            TFORM9  = '1C      '           / data format of field: COMPLEX                  TTYPE10 = 'Mvalue  '           / label for field  10                            TFORM10 = '1M      '           / data format of field: DOUBLE COMPLEX           EXTNAME = 'Test-BINTABLE'      / name of this binary table extension            EXTVER  =                    3 / extension version number                       TNULL4  =                   77 / value for undefined pixels                     TNULL5  =                   77 / value for undefined pixels                     TNULL6  =                   77 / value for undefined pixels                     TSCAL4  =                 1000 / scaling factor                                 TSCAL5  =                    1 / scaling factor                                 TSCAL6  =                  100 / scaling factor                                 TZERO4  =                    0 / scaling offset                                 TZERO5  =                32768 / scaling offset                                 TZERO6  =                  100 / scaling offset                                 NEW_KEY = 'written by fxprec' / to change checksum                              END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             €ÿÿÿÿƒè	
§c!GBÿŽMMMXTENSION= 'IMAGE   '           / IMAGE extension                                BITPIX  =                  -32 / number of bits per data pixel                  NAXIS   =                    2 / number of data axes                            NAXIS1  =                   15 / length of data axis 1                          NAXIS2  =                   25 / length of data axis 2                          PCOUNT  =                    0 / required keyword; must = 0                     GCOUNT  =                    1 / required keyword; must = 1                     END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             ?€@@@@€@ @À@àAAA A0A@APA`A A0A@APA`ApA€AˆAA˜A A¨A°A¸AÀA A¨A°A¸AÀAÈAÐAØAàAèAðAøBBBAðAøBBBBBBBBB B$B(B,B0B B$B(B,¿€ÀÀ@À€À ÀÀÀàÁÁBXBHBLBPBTÁ Á0Á@ÁPÁ`ÁpÁ€ÁˆÁÁ˜B€BpBtBxB|Á Á¨Á°Á¸ÁÀÁÈÁÐÁØÁàÁèB”BŒBŽBB’ÁðÁøÂÂÂÂÂÂÂÂB¨B B¢B¤B¦Â Â$Â(Â,Â0Â4Â8Â<Â@ÂDB¼B´B¶B¸BºÂHÂLÂPÂTÂXÂ\Â`ÂdÂhÂlBÐBÈBÊBÌBÎÂpÂtÂxÂ|€‚„†ˆŠBäBÜBÞBàB⌎’”–˜šœžBøBðBòBôBö ¢¤¦¨ª¬®°²CCCCC´¶¸º¼¾ÂÀÂÂÂÄÂÆCCC
CCCCCCCCCCCCCCCCCCCCCCCC C!C"C#C$C C!C"C#C$C%C&C'C(C)C*C+C,C-C.C*C+C,C-C.C/C0C1C2C3C4C5C6C7C8C4C5C6C7C8C9C:C;C<C=C>C?C@CACBC>C?C@CACBCCCDCECFCGCHCICJCKCLCHCICJCKCLCMCNCOCPCQCRCSCTCUCVCRCSCTCUCVCWCXCYCZC[C\C]C^C_C`C\C]C^C_C`CaCbCcCdCeCfCgChCiCjCfCgChCiCjCkClCmCnCoCpCqCrCsCtCpCqCrCsCtCuCvCwCxCyCzC{C|C}C~XTENSION= 'TABLE   '           / ASCII table extension                          BITPIX  =                    8 / 8-bit ASCII characters                         NAXIS   =                    2 / 2-dimensional ASCII table                      NAXIS1  =                   76 / width of table in characters                   NAXIS2  =                   12 / number of rows in table                        PCOUNT  =                    0 / no group parameters (required keyword)         GCOUNT  =                    1 / one data group (required keyword)              TFIELDS =                    5 / number of fields in each row                   TTYPE1  = 'Name    '           / label for field   1                            TBCOL1  =                    1 / beginning column of field   1                  TFORM1  = 'A15     '           / Fortran-77 format of field                     TTYPE2  = 'Ivalue  '           / label for field   2                            TBCOL2  =                   17 / beginning column of field   2                  TFORM2  = 'I10     '           / Fortran-77 format of field                     TUNIT2  = 'm**2    '           / physical unit of field                         TTYPE3  = 'Evalue  '           / label for field   4                            TBCOL3  =                   28 / beginning column of field   4                  TFORM3  = 'E12.5   '           / Fortran-77 format of field                     TUNIT3  = 'erg/s   '           / physical unit of field                         TTYPE4  = 'Dvalue  '           / label for field   5                            TBCOL4  =                   41 / beginning column of field   5                  TFORM4  = 'D21.14  '           / Fortran-77 format of field                     TUNIT4  = 'km/s    '           / physical unit of field                         EXTNAME = 'Test-ASCII'         / name of this ASCII table extension             EXTVER  =                    2 / extension version number                       TNULL1  = 'null1   '           / value for undefined pixels                     TNULL2  = 'null2   '           / value for undefined pixels                     TNULL3  = 'null4   '           / value for undefined pixels                     TNULL4  = 'null5   '           / value for undefined pixels                     TTYPE5  = 'INSERT_COL'         / label for field                                TFORM5  = 'F14.6   '           / format of field                                TBCOL5  =                   63 / beginning column of field                      END                                                                                                                                                                                                                                                                                                                             first string             1  1.00000E+00  1.00000000000000E+00               second string            2  2.00000E+00  2.00000000000000E+00                                                                                                                                                                                                                                                                            3  3.00000E+00  3.00000000000000E+00               null1                    4  4.00000E+00  4.00000000000000E+00                                        5  5.00000E+00  5.00000000000000E+00                                        6  6.00000E+00  6.00000000000000E+00                                        9  9.00000E+00  9.00000000000000E+00                                       10  1.00000E+01  1.00000000000000E+01                               null2      null4        null5                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                               XTENSION= 'BINTABLE'           / binary table extension                         BITPIX  =                    8 / 8-bit bytes                                    NAXIS   =                    2 / 2-dimensional binary table                     NAXIS1  =                   61 / width of table in bytes                        NAXIS2  =                   22 / number of rows in table                        PCOUNT  =                    0 / size of special data area                      GCOUNT  =                    1 / one data group (required keyword)              TFIELDS =                   10 / number of fields in each row                   TTYPE1  = 'Avalue  '           / label for field   1                            TFORM1  = '15A     '           / data format of field: ASCII Character          TTYPE2  = 'Lvalue  '           / label for field   2                            TFORM2  = '1L      '           / data format of field: 1-byte LOGICAL           TUNIT2  = 'm**2    '           / physical unit of field                         TTYPE3  = 'Xvalue  '           / label for field   3                            TFORM3  = '16X     '           / data format of field: BIT                      TUNIT3  = 'cm      '           / physical unit of field                         TTYPE4  = 'Bvalue  '           / label for field   4                            TFORM4  = '1B      '           / data format of field: BYTE                     TUNIT4  = 'erg/s   '           / physical unit of field                         TTYPE5  = 'Ivalue  '           / label for field   5                            TFORM5  = '1I      '           / data format of field: 2-byte INTEGER           TUNIT5  = 'km/s    '           / physical unit of field                         TTYPE6  = 'Evalue  '           / label for field   7                            TFORM6  = '1E      '           / data format of field: 4-byte REAL              TTYPE7  = 'Dvalue  '           / label for field   8                            TFORM7  = '1D      '           / data format of field: 8-byte DOUBLE            TTYPE9  = 'Cvalue  '           / label for field   9                            TFORM9  = '1C      '           / data format of field: COMPLEX                  TTYPE10 = 'Mvalue  '           / label for field  10                            TFORM10 = '1M      '           / data format of field: DOUBLE COMPLEX           EXTNAME = 'Test-BINTABLE'      / name of this binary table extension            EXTVER  =                    1 / extension version number                       TNULL4  =                   99 / value for undefined pixels                     TNULL5  =                   99 / value for undefined pixels                     TDIM3   = '(1,2,8) '           / size of the multidimensional array             KEY_PREC= 'This keyword was written by f_prec' / comment here                   TTYPE8  = 'INSERT_COL'         / label for field                                TFORM8  = '1E      '           / format of field                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             first string   FLp?€?ðÿÿÿÿ?€À?ðÀsecond string  Tð|@@ÿÿÿÿ@@À€@Àÿÿÿÿÿÿÿÿÿÿÿÿ               F@@@ÿÿÿÿ@ ÀÀ@À              FÿüÀ€Àÿÿÿÿ@àÁ@À T@ @ÿÿÿÿAÁ @"À$TÿúÀÀÀÿÿÿÿA0Á@@&À(F		A@"ÿÿÿÿAˆÁ@1À2TÿöÁ À$A˜Á @3À4ccÿÿÿÿÿÿÿÿÿÿÿÿTA@@(FccÿÿÿÿÿÿÿÿÿÿÿÿFÿòÁ`À,FccÿÿÿÿÿÿÿÿÿÿÿÿFÿðÁ€À0TccÿÿÿÿÿÿÿÿÿÿÿÿTÿîÁÀ2TccÿÿÿÿÿÿÿÿÿÿÿÿTÿìÁ À4FccÿÿÿÿÿÿÿÿÿÿÿÿXTENSION= 'BINTABLE'           / binary table extension                         BITPIX  =                    8 / 8-bit bytes                                    NAXIS   =                    2 / 2-dimensional binary table                     NAXIS1  =                   80 / width of table in bytes                        NAXIS2  =                   20 / number of rows in table                        PCOUNT  =                 4446 / size of special data area                      GCOUNT  =                    1 / one data group (required keyword)              TFIELDS =                   10 / number of fields in each row                   TTYPE1  = 'Avalue  '           / label for field   1                            TFORM1  = '1PA(20) '           / data format of field: variable length array    TTYPE2  = 'Lvalue  '           / label for field   2                            TFORM2  = '1PL(20) '           / data format of field: variable length array    TUNIT2  = 'm**2    '           / physical unit of field                         TTYPE3  = 'Xvalue  '           / label for field   3                            TFORM3  = '1PB(3)  '           / data format of field: variable length array    TUNIT3  = 'cm      '           / physical unit of field                         TTYPE4  = 'Bvalue  '           / label for field   4                            TFORM4  = '1PB(20) '           / data format of field: variable length array    TUNIT4  = 'erg/s   '           / physical unit of field                         TTYPE5  = 'Ivalue  '           / label for field   5                            TFORM5  = '1PI(20) '           / data format of field: variable length array    TUNIT5  = 'km/s    '           / physical unit of field                         TTYPE6  = 'Jvalue  '           / label for field   6                            TFORM6  = '1PJ(20) '           / data format of field: variable length array    TTYPE7  = 'Evalue  '           / label for field   7                            TFORM7  = '1PE(20) '           / data format of field: variable length array    TTYPE8  = 'Dvalue  '           / label for field   8                            TFORM8  = '1PD(20) '           / data format of field: variable length array    TTYPE9  = 'Cvalue  '           / label for field   9                            TFORM9  = '1PC(0)  '           / data format of field: variable length array    TTYPE10 = 'Mvalue  '           / label for field  10                            TFORM10 = '1PM(0)  '           / data format of field: variable length array    EXTNAME = 'Test-BINTABLE'      / name of this binary table extension            EXTVER  =                    4 / extension version number                       TNULL4  =                   88 / value for undefined pixels                     TNULL5  =                   88 / value for undefined pixels                     TNULL6  =                   88 / value for undefined pixels                     END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             
!)1ADGHKQ]i…‰ŠŽ–¦¶ÖÛàáæð@FLMS_w¿ÆÍÎÕãÿS[cdl|œ¼	ü				+	O	s
»
ÅÏ
Ñ
Û
ï

?𥧲Èô x„’ž¶æ
v
ƒ
’
Ÿ
¹
í
!‰—¥§µÑ	A±ÀÏÑàþ	:	v	î	þ


 
@
€
À@Qbev˜Ü ¨ºÌÏá

M
•%8KNa‡Ó·Ëßâön¾F?€?ðabT@XXXÿÿÿÿ@ÿÿÿÿÿÿÿÿ@abcFF@XXX?€ÿÿÿÿ@@?ðÿÿÿÿÿÿÿÿ@abcdFTF@XXX?€@ÿÿÿÿ@€?ð@ÿÿÿÿÿÿÿÿ@abcdeFTFTHXXX?€@@@ÿÿÿÿ@ ?ð@@ÿÿÿÿÿÿÿÿ@abcdefFTFFTLXXX?€@@@@€ÿÿÿÿ@À?ð@@@ÿÿÿÿÿÿÿÿ@abcdefgFTFFTFLXXX?€@@@@€@ ÿÿÿÿ@à?ð@@@@ÿÿÿÿÿÿÿÿ@abcdefghFTFFTTFLXXX?€@@@@€@ @ÀÿÿÿÿA?ð@@@@@ÿÿÿÿÿÿÿÿ@ abcdefghiFTFFTTFFLX	X	X	?€@@@@€@ @À@àÿÿÿÿA?ð@@@@@@ÿÿÿÿÿÿÿÿ@"abcdefghijFTFFTTFFTL@X
X
X
?€@@@@€@ @À@àAÿÿÿÿA ?ð@@@@@@@ ÿÿÿÿÿÿÿÿ@$abcdefghijkFTFFTTFFFTL`	X	X	X?€@@@@€@ @À@àAAÿÿÿÿA0?ð@@@@@@@ @"ÿÿÿÿÿÿÿÿ@&abcdefghijklFTFFTTFFFTTLp	
X	
X	
X?€@@@@€@ @À@àAAA ÿÿÿÿA@?ð@@@@@@@ @"@$ÿÿÿÿÿÿÿÿ@(abcdefghijklmFTFFTTFFFTTFLp	
X
	
X
	
X
?€@@@@€@ @À@àAAA A0ÿÿÿÿAP?ð@@@@@@@ @"@$@&ÿÿÿÿÿÿÿÿ@*abcdefghijklmnFTFFTTFFFTTTFLp	
X	
X	
X?€@@@@€@ @À@àAAA A0A@ÿÿÿÿA`?ð@@@@@@@ @"@$@&@(ÿÿÿÿÿÿÿÿ@,abcdefghijklmnoFTFFTTFFFTTTFFLp	

X	

X	

X?€@@@@€@ @À@àAAA A0A@APÿÿÿÿAp?ð@@@@@@@ @"@$@&@(@*ÿÿÿÿÿÿÿÿ@.abcdefghijklmnopFTFFTTFFFTTTFFFLp	

X	

X	

X?€@@@@€@ @À@àAAA A0A@APA`ÿÿÿÿA€?ð@@@@@@@ @"@$@&@(@*@,ÿÿÿÿÿÿÿÿ@0abcdefghijklmnopqFTFFTTFFFTTTFFFTLp€	

X	

X	

X?€@@@@€@ @À@àAAA A0A@APA`ApÿÿÿÿAˆ?ð@@@@@@@ @"@$@&@(@*@,@.ÿÿÿÿÿÿÿÿ@1abcdefghijklmnopqrFTFFTTFFFTTTFFFFTLpÀ	

X	

X	

X?€@@@@€@ @À@àAAA A0A@APA`ApA€ÿÿÿÿA?ð@@@@@@@ @"@$@&@(@*@,@.@0ÿÿÿÿÿÿÿÿ@2abcdefghijklmnopqrsFTFFTTFFFTTTFFFFTTLpà	

X	

X	

X?€@@@@€@ @À@àAAA A0A@APA`ApA€AˆÿÿÿÿA˜?ð@@@@@@@ @"@$@&@(@*@,@.@0@1ÿÿÿÿÿÿÿÿ@3abcdefghijklmnopqrstFTFFTTFFFTTTFFFFTTTLpð	

X	

X	

X?€@@@@€@ @À@àAAA A0A@APA`ApA€AˆAÿÿÿÿA ?ð@@@@@@@ @"@$@&@(@*@,@.@0@1@2ÿÿÿÿÿÿÿÿ@4XTENSION= 'IMAGE   '           / IMAGE extension                                BITPIX  =                   32 / number of bits per data pixel                  NAXIS   =                    2 / number of data axes                            NAXIS1  =                   10 / length of data axis 1                          NAXIS2  =                    2 / length of data axis 2                          PCOUNT  =                    0 / required keyword; must = 0                     GCOUNT  =                    1 / required keyword; must = 1                     CRVAL1  =     4.5830000000E+01 / comment                                        CRVAL2  =     6.3570000000E+01 / comment                                        CRPIX1  =     2.5600000000E+02 / comment                                        CRPIX2  =     2.5700000000E+02 / comment                                        CDELT1  =    -2.7777700000E-03 / comment                                        CDELT2  =     2.7777700000E-03 / comment                                        CTYPE1  = 'RA---TAN'           / comment                                        CTYPE2  = 'DEC--TAN'           / comment                                        END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             
XTENSION= 'TABLE   '           / ASCII table extension                          BITPIX  =                    8 / 8-bit ASCII characters                         NAXIS   =                    2 / 2-dimensional ASCII table                      NAXIS1  =                   80 / width of table in characters                   NAXIS2  =                   11 / number of rows in table                        PCOUNT  =                    0 / no group parameters (required keyword)         GCOUNT  =                    1 / one data group (required keyword)              TFIELDS =                    5 / number of fields in each row                   TTYPE1  = 'Name    '           / label for field   1                            TBCOL1  =                    1 / beginning column of field   1                  TFORM1  = 'A15     '           / Fortran-77 format of field                     TTYPE2  = 'Ivalue  '           / label for field   2                            TBCOL2  =                   17 / beginning column of field   2                  TFORM2  = 'I11     '           / Fortran-77 format of field                     TUNIT2  = 'm**2    '           / physical unit of field                         TTYPE3  = 'Fvalue  '           / label for field   3                            TBCOL3  =                   29 / beginning column of field   3                  TFORM3  = 'F15.6   '           / Fortran-77 format of field                     TUNIT3  = 'cm      '           / physical unit of field                         TTYPE4  = 'Evalue  '           / label for field   4                            TBCOL4  =                   45 / beginning column of field   4                  TFORM4  = 'E13.5   '           / Fortran-77 format of field                     TUNIT4  = 'erg/s   '           / physical unit of field                         TTYPE5  = 'Dvalue  '           / label for field   5                            TBCOL5  =                   59 / beginning column of field   5                  TFORM5  = 'D22.14  '           / Fortran-77 format of field                     TUNIT5  = 'km/s    '           / physical unit of field                         EXTNAME = 'new_table'          / name of this ASCII table extension             EXTVER  =                    5 / extension version number                       END                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             first string              0        0.000000   0.00000E+00   0.00000000000000E+00second string             3        3.000000   3.00000E+00   3.00000000000000E+00                          6        6.000000   6.00000E+00   6.00000000000000E+00                          9        9.000000   9.00000E+00   9.00000000000000E+00                         12       12.000000   1.20000E+01   1.20000000000000E+01                         15       15.000000   1.50000E+01   1.50000000000000E+01                         18       18.000000   1.80000E+01   1.80000000000000E+01                         21       21.000000   2.10000E+01   2.10000000000000E+01                         24       24.000000   2.40000E+01   2.40000000000000E+01                         27       27.000000   2.70000E+01   2.70000000000000E+01                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                cfitsio-3.47/testprog.tpt0000644000225700000360000000061413464573432015011 0ustar  cagordonlheatmpcard1  1001 this is the 1st template card 
tmpcard2  ABCD this is the 2nd template card
tmpcard3  1001.23 this is the 3rd template card
tmpcard4  1001.45 this is the 4rd template card
comment this is the 5th template card
history this is the 6th template card
tmpcard7 =            / comment for null keyword
-tmpcard1 tmpcarda  change the name of tmpcard1
-tmpcard4
end

junk will be ignored
cfitsio-3.47/vmsieee.c0000644000225700000360000000730613464573432014217 0ustar  cagordonlhea#include 
#include 

unsigned long CVT$CONVERT_FLOAT();

/* IEEVPAKR -- Pack a native floating point vector into an IEEE one.
*/
void ieevpr (unsigned int *native, unsigned int *ieee, int *nelem)
{
        unsigned long status;
        unsigned long options;
        unsigned int *unanval;
        int nanval = -1;
        int     i,n;

        unanval = (unsigned int *) &nanval;
        options = CVT$M_BIG_ENDIAN;
        
        n = *nelem;
        status = CVT$_NORMAL;

        for (i = 0; i < n ; i++) {

            status = CVT$CONVERT_FLOAT (&native[i], CVT$K_VAX_F,
                                        &ieee[i], CVT$K_IEEE_S, 
                                        options);
           if (status != CVT$_NORMAL) {
                 ieee[i] = *unanval;
           }
        }       

}
/* IEEVPAKD -- Pack a native double floating point vector into an IEEE one.
*/
void ieevpd (unsigned long *native, unsigned long *ieee, int *nelem)
{
        unsigned long status;
        unsigned long options;
        unsigned long *unanval;
        long nanval = -1;
        int     i,n;

        unanval = (unsigned long *) &nanval;
        options = CVT$M_BIG_ENDIAN;
        
        n = *nelem * 2;
        status = CVT$_NORMAL;

        for (i = 0; i < n ; i=i+2) {

            status = CVT$CONVERT_FLOAT (&native[i], CVT$K_VAX_D,
                                        &ieee[i], CVT$K_IEEE_T, 
                                        options);
           if (status != CVT$_NORMAL) {
                 ieee[i]   = *unanval;
                 ieee[i+1] = *unanval;
           }
        }       

}
/* IEEVUPKR -- Unpack an ieee vector into native single floating point vector.
*/
void ieevur (unsigned int *ieee, unsigned int *native, int *nelem)
{
        unsigned long status;
        unsigned long options;
        unsigned int *unanval;
        int nanval = -1;
        int     j,n;

        unanval = (unsigned int *) &nanval;
        options = CVT$M_ERR_UNDERFLOW+CVT$M_BIG_ENDIAN;
        
        n = *nelem;

        status = CVT$_NORMAL;

        for (j = 0; j < n ; j++) {
           status = CVT$CONVERT_FLOAT (&ieee[j], CVT$K_IEEE_S,
                                        &native[j], CVT$K_VAX_F, 
                                        options);
           if (status != CVT$_NORMAL)
              switch(status) {
              case CVT$_INVVAL:
              case CVT$_NEGINF:
              case CVT$_OVERFLOW:
              case CVT$_POSINF:
                 native[j]   = *unanval;
                 break;
              default:
                 native[j] = 0;             
              }
        }
}
/* IEEVUPKD -- Unpack an ieee vector into native double floating point vector.
*/
void ieevud (unsigned long *ieee, unsigned long *native, int *nelem)
{
        unsigned long status;
        unsigned long options;
        unsigned long *unanval;
        long nanval = -1;
        int     j,n;

        unanval = (unsigned long *) &nanval;
        options = CVT$M_BIG_ENDIAN + CVT$M_ERR_UNDERFLOW; 
        
        n = *nelem * 2;

        status = CVT$_NORMAL;

        for (j = 0; j < n ; j=j+2) {
           status = CVT$CONVERT_FLOAT (&ieee[j], CVT$K_IEEE_T,
                                        &native[j], CVT$K_VAX_D, 
                                        options);
           if (status != CVT$_NORMAL)
              switch(status) {
              case CVT$_INVVAL:
              case CVT$_NEGINF:
              case CVT$_OVERFLOW:
              case CVT$_POSINF:
                 native[j]   = *unanval;
                 native[j+1] = *unanval;
                 break;
              default:
                 native[j]   = 0;             
                 native[j+1] = 0;             
              }
        }
}
cfitsio-3.47/wcssub.c0000644000225700000360000010470313464573432014067 0ustar  cagordonlhea#include 
#include 
#include 
#include "fitsio2.h"

/*--------------------------------------------------------------------------*/
int fits_read_wcstab(
   fitsfile   *fptr, /* I - FITS file pointer           */
   int  nwtb,        /* Number of arrays to be read from the binary table(s) */
   wtbarr *wtb,      /* Address of the first element of an array of wtbarr
                         typedefs.  This wtbarr typedef is defined below to
                         match the wtbarr struct defined in WCSLIB.  An array
                         of such structs returned by the WCSLIB function
                         wcstab(). */
   int  *status)

/*
*   Author: Mark Calabretta, Australia Telescope National Facility
*   http://www.atnf.csiro.au/~mcalabre/index.html
*
*   fits_read_wcstab() extracts arrays from a binary table required in
*   constructing -TAB coordinates.  This helper routine is intended for
*   use by routines in the WCSLIB library when dealing with the -TAB table
*   look up WCS convention.
*/

{
   int  anynul, colnum, hdunum, iwtb, m, naxis, nostat;
   long *naxes = 0, nelem;
   wtbarr *wtbp;


   if (*status) return *status;

   if (fptr == 0) {
      return (*status = NULL_INPUT_PTR);
   }

   if (nwtb == 0) return 0;

   /* Zero the array pointers. */
   wtbp = wtb;
   for (iwtb = 0; iwtb < nwtb; iwtb++, wtbp++) {
     *wtbp->arrayp = 0x0;
   }

   /* Save HDU number so that we can move back to it later. */
   fits_get_hdu_num(fptr, &hdunum);

   wtbp = wtb;
   for (iwtb = 0; iwtb < nwtb; iwtb++, wtbp++) {
      /* Move to the required binary table extension. */
      if (fits_movnam_hdu(fptr, BINARY_TBL, (char *)(wtbp->extnam),
          wtbp->extver, status)) {
         goto cleanup;
      }

      /* Locate the table column. */
      if (fits_get_colnum(fptr, CASEINSEN, (char *)(wtbp->ttype), &colnum,
          status)) {
         goto cleanup;
      }

      /* Get the array dimensions and check for consistency. */
      if (wtbp->ndim < 1) {
         *status = NEG_AXIS;
         goto cleanup;
      }

      if (!(naxes = calloc(wtbp->ndim, sizeof(long)))) {
         *status = MEMORY_ALLOCATION;
         goto cleanup;
      }

      if (fits_read_tdim(fptr, colnum, wtbp->ndim, &naxis, naxes, status)) {
         goto cleanup;
      }

      if (naxis != wtbp->ndim) {
         if (wtbp->kind == 'c' && wtbp->ndim == 2) {
            /* Allow TDIMn to be omitted for degenerate coordinate arrays. */
            naxis = 2;
            naxes[1] = naxes[0];
            naxes[0] = 1;
         } else {
            *status = BAD_TDIM;
            goto cleanup;
         }
      }

      if (wtbp->kind == 'c') {
         /* Coordinate array; calculate the array size. */
         nelem = naxes[0];
         for (m = 0; m < naxis-1; m++) {
            *(wtbp->dimlen + m) = naxes[m+1];
            nelem *= naxes[m+1];
         }
      } else {
         /* Index vector; check length. */
         if ((nelem = naxes[0]) != *(wtbp->dimlen)) {
            /* N.B. coordinate array precedes the index vectors. */
            *status = BAD_TDIM;
            goto cleanup;
         }
      }

      free(naxes);
      naxes = 0;

      /* Allocate memory for the array. */
      if (!(*wtbp->arrayp = calloc((size_t)nelem, sizeof(double)))) {
         *status = MEMORY_ALLOCATION;
         goto cleanup;
      }

      /* Read the array from the table. */
      if (fits_read_col_dbl(fptr, colnum, wtbp->row, 1L, nelem, 0.0,
          *wtbp->arrayp, &anynul, status)) {
         goto cleanup;
      }
   }

cleanup:
   /* Move back to the starting HDU. */
   nostat = 0;
   fits_movabs_hdu(fptr, hdunum, 0, &nostat);

   /* Release allocated memory. */
   if (naxes) free(naxes);
   if (*status) {
      wtbp = wtb;
      for (iwtb = 0; iwtb < nwtb; iwtb++, wtbp++) {
         if (*wtbp->arrayp) free(*wtbp->arrayp);
      }
   }

   return *status;
}
/*--------------------------------------------------------------------------*/
int ffgiwcs(fitsfile *fptr,  /* I - FITS file pointer                    */
           char **header,   /* O - pointer to the WCS related keywords  */
           int *status)     /* IO - error status                        */
/*
  int fits_get_image_wcs_keys 
  return a string containing all the image WCS header keywords.
  This string is then used as input to the wcsinit WCSlib routine.
  
  THIS ROUTINE IS DEPRECATED. USE fits_hdr2str INSTEAD
*/
{
    int hdutype;

    if (*status > 0)
        return(*status);

    fits_get_hdu_type(fptr, &hdutype, status);
    if (hdutype != IMAGE_HDU)
    {
      ffpmsg(
     "Error in ffgiwcs. This HDU is not an image. Can't read WCS keywords");
      return(*status = NOT_IMAGE);
    }

    /* read header keywords into a long string of chars */
    if (ffh2st(fptr, header, status) > 0)
    {
        ffpmsg("error creating string of image WCS keywords (ffgiwcs)");
        return(*status);
    }

    return(*status);
}

/*--------------------------------------------------------------------------*/
int ffgics(fitsfile *fptr,    /* I - FITS file pointer           */
           double *xrval,     /* O - X reference value           */
           double *yrval,     /* O - Y reference value           */
           double *xrpix,     /* O - X reference pixel           */
           double *yrpix,     /* O - Y reference pixel           */
           double *xinc,      /* O - X increment per pixel       */
           double *yinc,      /* O - Y increment per pixel       */
           double *rot,       /* O - rotation angle (degrees)    */
           char *type,        /* O - type of projection ('-tan') */
           int *status)       /* IO - error status               */
/*
       read the values of the celestial coordinate system keywords.
       These values may be used as input to the subroutines that
       calculate celestial coordinates. (ffxypx, ffwldp)

       Modified in Nov 1999 to convert the CD matrix keywords back
       to the old CDELTn form, and to swap the axes if the dec-like
       axis is given first, and to assume default values if any of the
       keywords are not present.
*/
{
    int tstat = 0, cd_exists = 0, pc_exists = 0;
    char ctype[FLEN_VALUE];
    double cd11 = 0.0, cd21 = 0.0, cd22 = 0.0, cd12 = 0.0;
    double pc11 = 1.0, pc21 = 0.0, pc22 = 1.0, pc12 = 0.0;
    double pi =  3.1415926535897932;
    double phia, phib, temp;
    double toler = .0002;  /* tolerance for angles to agree (radians) */
                           /*   (= approximately 0.01 degrees) */

    if (*status > 0)
       return(*status);

    tstat = 0;
    if (ffgkyd(fptr, "CRVAL1", xrval, NULL, &tstat))
       *xrval = 0.;

    tstat = 0;
    if (ffgkyd(fptr, "CRVAL2", yrval, NULL, &tstat))
       *yrval = 0.;

    tstat = 0;
    if (ffgkyd(fptr, "CRPIX1", xrpix, NULL, &tstat))
        *xrpix = 0.;

    tstat = 0;
    if (ffgkyd(fptr, "CRPIX2", yrpix, NULL, &tstat))
        *yrpix = 0.;

    /* look for CDELTn first, then CDi_j keywords */
    tstat = 0;
    if (ffgkyd(fptr, "CDELT1", xinc, NULL, &tstat))
    {
        /* CASE 1: no CDELTn keyword, so look for the CD matrix */
        tstat = 0;
        if (ffgkyd(fptr, "CD1_1", &cd11, NULL, &tstat))
            tstat = 0;  /* reset keyword not found error */
        else
            cd_exists = 1;  /* found at least 1 CD_ keyword */

        if (ffgkyd(fptr, "CD2_1", &cd21, NULL, &tstat))
            tstat = 0;  /* reset keyword not found error */
        else
            cd_exists = 1;  /* found at least 1 CD_ keyword */

        if (ffgkyd(fptr, "CD1_2", &cd12, NULL, &tstat))
            tstat = 0;  /* reset keyword not found error */
        else
            cd_exists = 1;  /* found at least 1 CD_ keyword */

        if (ffgkyd(fptr, "CD2_2", &cd22, NULL, &tstat))
            tstat = 0;  /* reset keyword not found error */
        else
            cd_exists = 1;  /* found at least 1 CD_ keyword */

        if (cd_exists)  /* convert CDi_j back to CDELTn */
        {
            /* there are 2 ways to compute the angle: */
            phia = atan2( cd21, cd11);
            phib = atan2(-cd12, cd22);

            /* ensure that phia <= phib */
            temp = minvalue(phia, phib);
            phib = maxvalue(phia, phib);
            phia = temp;

            /* there is a possible 180 degree ambiguity in the angles */
            /* so add 180 degress to the smaller value if the values  */
            /* differ by more than 90 degrees = pi/2 radians.         */
            /* (Later, we may decide to take the other solution by    */
            /* subtracting 180 degrees from the larger value).        */

            if ((phib - phia) > (pi / 2.))
               phia += pi;

            if (fabs(phia - phib) > toler) 
            {
               /* angles don't agree, so looks like there is some skewness */
               /* between the axes.  Return with an error to be safe. */
               *status = APPROX_WCS_KEY;
            }
      
            phia = (phia + phib) /2.;  /* use the average of the 2 values */
            *xinc = cd11 / cos(phia);
            *yinc = cd22 / cos(phia);
            *rot = phia * 180. / pi;

            /* common usage is to have a positive yinc value.  If it is */
            /* negative, then subtract 180 degrees from rot and negate  */
            /* both xinc and yinc.  */

            if (*yinc < 0)
            {
                *xinc = -(*xinc);
                *yinc = -(*yinc);
                *rot = *rot - 180.;
            }
        }
        else   /* no CD matrix keywords either */
        {
            *xinc = 1.;

            /* there was no CDELT1 keyword, but check for CDELT2 just in case */
            tstat = 0;
            if (ffgkyd(fptr, "CDELT2", yinc, NULL, &tstat))
                *yinc = 1.;

            tstat = 0;
            if (ffgkyd(fptr, "CROTA2", rot, NULL, &tstat))
                *rot=0.;
        }
    }
    else  /* Case 2: CDELTn + optional PC matrix */
    {
        if (ffgkyd(fptr, "CDELT2", yinc, NULL, &tstat))
            *yinc = 1.;

        tstat = 0;
        if (ffgkyd(fptr, "CROTA2", rot, NULL, &tstat))
        {
            *rot=0.;

            /* no CROTA2 keyword, so look for the PC matrix */
            tstat = 0;
            if (ffgkyd(fptr, "PC1_1", &pc11, NULL, &tstat))
                tstat = 0;  /* reset keyword not found error */
            else
                pc_exists = 1;  /* found at least 1 PC_ keyword */

            if (ffgkyd(fptr, "PC2_1", &pc21, NULL, &tstat))
                tstat = 0;  /* reset keyword not found error */
            else
                pc_exists = 1;  /* found at least 1 PC_ keyword */

            if (ffgkyd(fptr, "PC1_2", &pc12, NULL, &tstat))
                tstat = 0;  /* reset keyword not found error */
            else
                pc_exists = 1;  /* found at least 1 PC_ keyword */

            if (ffgkyd(fptr, "PC2_2", &pc22, NULL, &tstat))
                tstat = 0;  /* reset keyword not found error */
            else
                pc_exists = 1;  /* found at least 1 PC_ keyword */

            if (pc_exists)  /* convert PCi_j back to CDELTn */
            {
                /* there are 2 ways to compute the angle: */
                phia = atan2( pc21, pc11);
                phib = atan2(-pc12, pc22);

                /* ensure that phia <= phib */
                temp = minvalue(phia, phib);
                phib = maxvalue(phia, phib);
                phia = temp;

                /* there is a possible 180 degree ambiguity in the angles */
                /* so add 180 degress to the smaller value if the values  */
                /* differ by more than 90 degrees = pi/2 radians.         */
                /* (Later, we may decide to take the other solution by    */
                /* subtracting 180 degrees from the larger value).        */

                if ((phib - phia) > (pi / 2.))
                   phia += pi;

                if (fabs(phia - phib) > toler) 
                {
                  /* angles don't agree, so looks like there is some skewness */
                  /* between the axes.  Return with an error to be safe. */
                  *status = APPROX_WCS_KEY;
                }
      
                phia = (phia + phib) /2.;  /* use the average of the 2 values */
                *rot = phia * 180. / pi;
            }
        }
    }

    /* get the type of projection, if any */
    tstat = 0;
    if (ffgkys(fptr, "CTYPE1", ctype, NULL, &tstat))
         type[0] = '\0';
    else
    {
        /* copy the projection type string */
        strncpy(type, &ctype[4], 4);
        type[4] = '\0';

        /* check if RA and DEC are inverted */
        if (!strncmp(ctype, "DEC-", 4) || !strncmp(ctype+1, "LAT", 3))
        {
            /* the latitudinal axis is given first, so swap them */

/*
 this case was removed on 12/9.  Apparently not correct.

            if ((*xinc / *yinc) < 0. )  
                *rot = -90. - (*rot);
            else
*/
            *rot = 90. - (*rot);

            /* Empirical tests with ds9 show the y-axis sign must be negated */
            /* and the xinc and yinc values must NOT be swapped. */
            *yinc = -(*yinc);

            temp = *xrval;
            *xrval = *yrval;
            *yrval = temp;
        }   
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgicsa(fitsfile *fptr,    /* I - FITS file pointer           */
           char version,      /* I - character code of desired version */
	                      /*     A - Z or blank */
           double *xrval,     /* O - X reference value           */
           double *yrval,     /* O - Y reference value           */
           double *xrpix,     /* O - X reference pixel           */
           double *yrpix,     /* O - Y reference pixel           */
           double *xinc,      /* O - X increment per pixel       */
           double *yinc,      /* O - Y increment per pixel       */
           double *rot,       /* O - rotation angle (degrees)    */
           char *type,        /* O - type of projection ('-tan') */
           int *status)       /* IO - error status               */
/*
       read the values of the celestial coordinate system keywords.
       These values may be used as input to the subroutines that
       calculate celestial coordinates. (ffxypx, ffwldp)

       Modified in Nov 1999 to convert the CD matrix keywords back
       to the old CDELTn form, and to swap the axes if the dec-like
       axis is given first, and to assume default values if any of the
       keywords are not present.
*/
{
    int tstat = 0, cd_exists = 0, pc_exists = 0;
    char ctype[FLEN_VALUE], keyname[FLEN_VALUE], alt[2];
    double cd11 = 0.0, cd21 = 0.0, cd22 = 0.0, cd12 = 0.0;
    double pc11 = 1.0, pc21 = 0.0, pc22 = 1.0, pc12 = 0.0;
    double pi =  3.1415926535897932;
    double phia, phib, temp;
    double toler = .0002;  /* tolerance for angles to agree (radians) */
                           /*   (= approximately 0.01 degrees) */

    if (*status > 0)
       return(*status);

    if (version == ' ') {
      ffgics(fptr, xrval, yrval, xrpix, yrpix, xinc, yinc, rot, type, status);
      return (*status);
    }

    if (version > 'Z' || version < 'A') {
      ffpmsg("ffgicsa: illegal WCS version code (must be A - Z or blank)");
      return(*status = WCS_ERROR);
    }

    alt[0] = version;
    alt[1] = '\0';
    
    tstat = 0;
    strcpy(keyname, "CRVAL1");
    strcat(keyname, alt);
    if (ffgkyd(fptr, keyname, xrval, NULL, &tstat))
       *xrval = 0.;

    tstat = 0;
    strcpy(keyname, "CRVAL2");
    strcat(keyname, alt);
    if (ffgkyd(fptr, keyname, yrval, NULL, &tstat))
       *yrval = 0.;

    tstat = 0;
    strcpy(keyname, "CRPIX1");
    strcat(keyname, alt);
    if (ffgkyd(fptr, keyname, xrpix, NULL, &tstat))
        *xrpix = 0.;

    tstat = 0;
    strcpy(keyname, "CRPIX2");
    strcat(keyname, alt);
     if (ffgkyd(fptr, keyname, yrpix, NULL, &tstat))
        *yrpix = 0.;

    /* look for CDELTn first, then CDi_j keywords */
    tstat = 0;
    strcpy(keyname, "CDELT1");
    strcat(keyname, alt);
    if (ffgkyd(fptr, keyname, xinc, NULL, &tstat))
    {
        /* CASE 1: no CDELTn keyword, so look for the CD matrix */
        tstat = 0;
        strcpy(keyname, "CD1_1");
        strcat(keyname, alt);
        if (ffgkyd(fptr, keyname, &cd11, NULL, &tstat))
            tstat = 0;  /* reset keyword not found error */
        else
            cd_exists = 1;  /* found at least 1 CD_ keyword */

        strcpy(keyname, "CD2_1");
        strcat(keyname, alt);
        if (ffgkyd(fptr, keyname, &cd21, NULL, &tstat))
            tstat = 0;  /* reset keyword not found error */
        else
            cd_exists = 1;  /* found at least 1 CD_ keyword */

        strcpy(keyname, "CD1_2");
        strcat(keyname, alt);
        if (ffgkyd(fptr, keyname, &cd12, NULL, &tstat))
            tstat = 0;  /* reset keyword not found error */
        else
            cd_exists = 1;  /* found at least 1 CD_ keyword */

        strcpy(keyname, "CD2_2");
        strcat(keyname, alt);
        if (ffgkyd(fptr, keyname, &cd22, NULL, &tstat))
            tstat = 0;  /* reset keyword not found error */
        else
            cd_exists = 1;  /* found at least 1 CD_ keyword */

        if (cd_exists)  /* convert CDi_j back to CDELTn */
        {
            /* there are 2 ways to compute the angle: */
            phia = atan2( cd21, cd11);
            phib = atan2(-cd12, cd22);

            /* ensure that phia <= phib */
            temp = minvalue(phia, phib);
            phib = maxvalue(phia, phib);
            phia = temp;

            /* there is a possible 180 degree ambiguity in the angles */
            /* so add 180 degress to the smaller value if the values  */
            /* differ by more than 90 degrees = pi/2 radians.         */
            /* (Later, we may decide to take the other solution by    */
            /* subtracting 180 degrees from the larger value).        */

            if ((phib - phia) > (pi / 2.))
               phia += pi;

            if (fabs(phia - phib) > toler) 
            {
               /* angles don't agree, so looks like there is some skewness */
               /* between the axes.  Return with an error to be safe. */
               *status = APPROX_WCS_KEY;
            }
      
            phia = (phia + phib) /2.;  /* use the average of the 2 values */
            *xinc = cd11 / cos(phia);
            *yinc = cd22 / cos(phia);
            *rot = phia * 180. / pi;

            /* common usage is to have a positive yinc value.  If it is */
            /* negative, then subtract 180 degrees from rot and negate  */
            /* both xinc and yinc.  */

            if (*yinc < 0)
            {
                *xinc = -(*xinc);
                *yinc = -(*yinc);
                *rot = *rot - 180.;
            }
        }
        else   /* no CD matrix keywords either */
        {
            *xinc = 1.;

            /* there was no CDELT1 keyword, but check for CDELT2 just in case */
            tstat = 0;
            strcpy(keyname, "CDELT2");
            strcat(keyname, alt);
            if (ffgkyd(fptr, keyname, yinc, NULL, &tstat))
                *yinc = 1.;

            tstat = 0;
            strcpy(keyname, "CROTA2");
            strcat(keyname, alt);
            if (ffgkyd(fptr, keyname, rot, NULL, &tstat))
                *rot=0.;
        }
    }
    else  /* Case 2: CDELTn + optional PC matrix */
    {
        strcpy(keyname, "CDELT2");
        strcat(keyname, alt);
        if (ffgkyd(fptr, keyname, yinc, NULL, &tstat))
            *yinc = 1.;

        tstat = 0;
        strcpy(keyname, "CROTA2");
        strcat(keyname, alt);
        if (ffgkyd(fptr, keyname, rot, NULL, &tstat))
        {
            *rot=0.;

            /* no CROTA2 keyword, so look for the PC matrix */
            tstat = 0;
            strcpy(keyname, "PC1_1");
            strcat(keyname, alt);
            if (ffgkyd(fptr, keyname, &pc11, NULL, &tstat))
                tstat = 0;  /* reset keyword not found error */
            else
                pc_exists = 1;  /* found at least 1 PC_ keyword */

            strcpy(keyname, "PC2_1");
            strcat(keyname, alt);
            if (ffgkyd(fptr, keyname, &pc21, NULL, &tstat))
                tstat = 0;  /* reset keyword not found error */
            else
                pc_exists = 1;  /* found at least 1 PC_ keyword */

            strcpy(keyname, "PC1_2");
            strcat(keyname, alt);
            if (ffgkyd(fptr, keyname, &pc12, NULL, &tstat))
                tstat = 0;  /* reset keyword not found error */
            else
                pc_exists = 1;  /* found at least 1 PC_ keyword */

            strcpy(keyname, "PC2_2");
            strcat(keyname, alt);
            if (ffgkyd(fptr, keyname, &pc22, NULL, &tstat))
                tstat = 0;  /* reset keyword not found error */
            else
                pc_exists = 1;  /* found at least 1 PC_ keyword */

            if (pc_exists)  /* convert PCi_j back to CDELTn */
            {
                /* there are 2 ways to compute the angle: */
                phia = atan2( pc21, pc11);
                phib = atan2(-pc12, pc22);

                /* ensure that phia <= phib */
                temp = minvalue(phia, phib);
                phib = maxvalue(phia, phib);
                phia = temp;

                /* there is a possible 180 degree ambiguity in the angles */
                /* so add 180 degress to the smaller value if the values  */
                /* differ by more than 90 degrees = pi/2 radians.         */
                /* (Later, we may decide to take the other solution by    */
                /* subtracting 180 degrees from the larger value).        */

                if ((phib - phia) > (pi / 2.))
                   phia += pi;

                if (fabs(phia - phib) > toler) 
                {
                  /* angles don't agree, so looks like there is some skewness */
                  /* between the axes.  Return with an error to be safe. */
                  *status = APPROX_WCS_KEY;
                }
      
                phia = (phia + phib) /2.;  /* use the average of the 2 values */
                *rot = phia * 180. / pi;
            }
        }
    }

    /* get the type of projection, if any */
    tstat = 0;
    strcpy(keyname, "CTYPE1");
    strcat(keyname, alt);
    if (ffgkys(fptr, keyname, ctype, NULL, &tstat))
         type[0] = '\0';
    else
    {
        /* copy the projection type string */
        strncpy(type, &ctype[4], 4);
        type[4] = '\0';

        /* check if RA and DEC are inverted */
        if (!strncmp(ctype, "DEC-", 4) || !strncmp(ctype+1, "LAT", 3))
        {
            /* the latitudinal axis is given first, so swap them */

            *rot = 90. - (*rot);

            /* Empirical tests with ds9 show the y-axis sign must be negated */
            /* and the xinc and yinc values must NOT be swapped. */
            *yinc = -(*yinc);

            temp = *xrval;
            *xrval = *yrval;
            *yrval = temp;
        }   
    }

    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgtcs(fitsfile *fptr,    /* I - FITS file pointer           */
           int xcol,          /* I - column containing the RA coordinate  */
           int ycol,          /* I - column containing the DEC coordinate */
           double *xrval,     /* O - X reference value           */
           double *yrval,     /* O - Y reference value           */
           double *xrpix,     /* O - X reference pixel           */
           double *yrpix,     /* O - Y reference pixel           */
           double *xinc,      /* O - X increment per pixel       */
           double *yinc,      /* O - Y increment per pixel       */
           double *rot,       /* O - rotation angle (degrees)    */
           char *type,        /* O - type of projection ('-sin') */
           int *status)       /* IO - error status               */
/*
       read the values of the celestial coordinate system keywords
       from a FITS table where the X and Y or RA and DEC coordinates
       are stored in separate column.  Do this by converting the
       table to a temporary FITS image, then reading the keywords
       from the image file.
       These values may be used as input to the subroutines that
       calculate celestial coordinates. (ffxypx, ffwldp)
*/
{
    int colnum[2];
    long naxes[2];
    fitsfile *tptr;

    if (*status > 0)
       return(*status);

    colnum[0] = xcol;
    colnum[1] = ycol;
    naxes[0] = 10;
    naxes[1] = 10;

    /* create temporary  FITS file, in memory */
    ffinit(&tptr, "mem://", status);
    
    /* create a temporary image; the datatype and size are not important */
    ffcrim(tptr, 32, 2, naxes, status);
    
    /* now copy the relevant keywords from the table to the image */
    fits_copy_pixlist2image(fptr, tptr, 9, 2, colnum, status);

    /* write default WCS keywords, if they are not present */
    fits_write_keys_histo(fptr, tptr, 2, colnum, status);

    if (*status > 0)
       return(*status);
         
    /* read the WCS keyword values from the temporary image */
    ffgics(tptr, xrval, yrval, xrpix, yrpix, xinc, yinc, rot, type, status); 

    if (*status > 0)
    {
      ffpmsg
      ("ffgtcs could not find all the celestial coordinate keywords");
      return(*status = NO_WCS_KEY); 
    }

    /* delete the temporary file */
    fits_delete_file(tptr, status);
    
    return(*status);
}
/*--------------------------------------------------------------------------*/
int ffgtwcs(fitsfile *fptr,  /* I - FITS file pointer              */
           int xcol,        /* I - column number for the X column  */
           int ycol,        /* I - column number for the Y column  */
           char **header,   /* O - string of all the WCS keywords  */
           int *status)     /* IO - error status                   */
/*
  int fits_get_table_wcs_keys
  Return string containing all the WCS keywords appropriate for the 
  pair of X and Y columns containing the coordinate
  of each event in an event list table.  This string may then be passed
  to Doug Mink's WCS library wcsinit routine, to create and initialize the
  WCS structure.  The calling routine must free the header character string
  when it is no longer needed. 

  THIS ROUTINE IS DEPRECATED. USE fits_hdr2str INSTEAD
*/
{
    int hdutype, ncols, tstatus, length;
    int naxis1 = 1, naxis2 = 1;
    long tlmin, tlmax;
    char keyname[FLEN_KEYWORD];
    char valstring[FLEN_VALUE];
    char comm[2];
    char *cptr;
    /*  construct a string of 80 blanks, for adding fill to the keywords */
                 /*  12345678901234567890123456789012345678901234567890123456789012345678901234567890 */
    char blanks[] = "                                                                                ";

    if (*status > 0)
        return(*status);

    fits_get_hdu_type(fptr, &hdutype, status);
    if (hdutype == IMAGE_HDU)
    {
        ffpmsg("Can't read table WSC keywords. This HDU is not a table");
        return(*status = NOT_TABLE);
    }

    fits_get_num_cols(fptr, &ncols, status);
    
    if (xcol < 1 || xcol > ncols)
    {
        ffpmsg("illegal X axis column number in fftwcs");
        return(*status = BAD_COL_NUM);
    }

    if (ycol < 1 || ycol > ncols)
    {
        ffpmsg("illegal Y axis column number in fftwcs");
        return(*status = BAD_COL_NUM);
    }

    /* allocate character string for all the WCS keywords */
    *header = calloc(1, 2401);  /* room for up to 30 keywords */
    if (*header == 0)
    {
        ffpmsg("error allocating memory for WCS header keywords (fftwcs)");
        return(*status = MEMORY_ALLOCATION);
    }

    cptr = *header;
    comm[0] = '\0';
    
    tstatus = 0;
    ffkeyn("TLMIN",xcol,keyname,status);
    ffgkyj(fptr,keyname, &tlmin,NULL,&tstatus);

    if (!tstatus)
    {
        ffkeyn("TLMAX",xcol,keyname,status);
        ffgkyj(fptr,keyname, &tlmax,NULL,&tstatus);
    }

    if (!tstatus)
    {
        naxis1 = tlmax - tlmin + 1;
    }

    tstatus = 0;
    ffkeyn("TLMIN",ycol,keyname,status);
    ffgkyj(fptr,keyname, &tlmin,NULL,&tstatus);

    if (!tstatus)
    {
        ffkeyn("TLMAX",ycol,keyname,status);
        ffgkyj(fptr,keyname, &tlmax,NULL,&tstatus);
    }

    if (!tstatus)
    {
        naxis2 = tlmax - tlmin + 1;
    }

    /*            123456789012345678901234567890    */
    strcat(cptr, "NAXIS   =                    2");
    strncat(cptr, blanks, 50);
    cptr += 80;

    ffi2c(naxis1, valstring, status);   /* convert to formatted string */
    ffmkky("NAXIS1", valstring, comm, cptr, status);  /* construct the keyword*/
    strncat(cptr, blanks, 50);  /* pad with blanks */
    cptr += 80;

    strcpy(keyname, "NAXIS2");
    ffi2c(naxis2, valstring, status);   /* convert to formatted string */
    ffmkky(keyname, valstring, comm, cptr, status);  /* construct the keyword*/
    strncat(cptr, blanks, 50);  /* pad with blanks */
    cptr += 80;

    /* read the required header keywords (use defaults if not found) */

    /*  CTYPE1 keyword */
    tstatus = 0;
    ffkeyn("TCTYP",xcol,keyname,status);
    if (ffgkey(fptr, keyname, valstring, NULL, &tstatus) )
       valstring[0] =  '\0';
    ffmkky("CTYPE1", valstring, comm, cptr, status);  /* construct the keyword*/
    length = strlen(cptr);
    strncat(cptr, blanks, 80 - length);  /* pad with blanks */
    cptr += 80;

    /*  CTYPE2 keyword */
    tstatus = 0;
    ffkeyn("TCTYP",ycol,keyname,status);
    if (ffgkey(fptr, keyname, valstring, NULL, &tstatus) )
       valstring[0] =  '\0';
    ffmkky("CTYPE2", valstring, comm, cptr, status);  /* construct the keyword*/
    length = strlen(cptr);
    strncat(cptr, blanks, 80 - length);  /* pad with blanks */
    cptr += 80;

    /*  CRPIX1 keyword */
    tstatus = 0;
    ffkeyn("TCRPX",xcol,keyname,status);
    if (ffgkey(fptr, keyname, valstring, NULL, &tstatus) )
       strcpy(valstring, "1");
    ffmkky("CRPIX1", valstring, comm, cptr, status);  /* construct the keyword*/
    strncat(cptr, blanks, 50);  /* pad with blanks */
    cptr += 80;

    /*  CRPIX2 keyword */
    tstatus = 0;
    ffkeyn("TCRPX",ycol,keyname,status);
    if (ffgkey(fptr, keyname, valstring, NULL, &tstatus) )
       strcpy(valstring, "1");
    ffmkky("CRPIX2", valstring, comm, cptr, status);  /* construct the keyword*/
    strncat(cptr, blanks, 50);  /* pad with blanks */
    cptr += 80;

    /*  CRVAL1 keyword */
    tstatus = 0;
    ffkeyn("TCRVL",xcol,keyname,status);
    if (ffgkey(fptr, keyname, valstring, NULL, &tstatus) )
       strcpy(valstring, "1");
    ffmkky("CRVAL1", valstring, comm, cptr, status);  /* construct the keyword*/
    strncat(cptr, blanks, 50);  /* pad with blanks */
    cptr += 80;

    /*  CRVAL2 keyword */
    tstatus = 0;
    ffkeyn("TCRVL",ycol,keyname,status);
    if (ffgkey(fptr, keyname, valstring, NULL, &tstatus) )
       strcpy(valstring, "1");
    ffmkky("CRVAL2", valstring, comm, cptr, status);  /* construct the keyword*/
    strncat(cptr, blanks, 50);  /* pad with blanks */
    cptr += 80;

    /*  CDELT1 keyword */
    tstatus = 0;
    ffkeyn("TCDLT",xcol,keyname,status);
    if (ffgkey(fptr, keyname, valstring, NULL, &tstatus) )
       strcpy(valstring, "1");
    ffmkky("CDELT1", valstring, comm, cptr, status);  /* construct the keyword*/
    strncat(cptr, blanks, 50);  /* pad with blanks */
    cptr += 80;

    /*  CDELT2 keyword */
    tstatus = 0;
    ffkeyn("TCDLT",ycol,keyname,status);
    if (ffgkey(fptr, keyname, valstring, NULL, &tstatus) )
       strcpy(valstring, "1");
    ffmkky("CDELT2", valstring, comm, cptr, status);  /* construct the keyword*/
    strncat(cptr, blanks, 50);  /* pad with blanks */
    cptr += 80;

    /* the following keywords may not exist */

    /*  CROTA2 keyword */
    tstatus = 0;
    ffkeyn("TCROT",ycol,keyname,status);
    if (ffgkey(fptr, keyname, valstring, NULL, &tstatus) == 0 )
    {
        ffmkky("CROTA2", valstring, comm, cptr, status);  /* construct keyword*/
        strncat(cptr, blanks, 50);  /* pad with blanks */
        cptr += 80;
    }

    /*  EPOCH keyword */
    tstatus = 0;
    if (ffgkey(fptr, "EPOCH", valstring, NULL, &tstatus) == 0 )
    {
        ffmkky("EPOCH", valstring, comm, cptr, status);  /* construct keyword*/
        length = strlen(cptr);
        strncat(cptr, blanks, 80 - length);  /* pad with blanks */
        cptr += 80;
    }

    /*  EQUINOX keyword */
    tstatus = 0;
    if (ffgkey(fptr, "EQUINOX", valstring, NULL, &tstatus) == 0 )
    {
        ffmkky("EQUINOX", valstring, comm, cptr, status); /* construct keyword*/
        length = strlen(cptr);
        strncat(cptr, blanks, 80 - length);  /* pad with blanks */
        cptr += 80;
    }

    /*  RADECSYS keyword */
    tstatus = 0;
    if (ffgkey(fptr, "RADECSYS", valstring, NULL, &tstatus) == 0 )
    {
        ffmkky("RADECSYS", valstring, comm, cptr, status); /*construct keyword*/
        length = strlen(cptr);
        strncat(cptr, blanks, 80 - length);  /* pad with blanks */
        cptr += 80;
    }

    /*  TELESCOPE keyword */
    tstatus = 0;
    if (ffgkey(fptr, "TELESCOP", valstring, NULL, &tstatus) == 0 )
    {
        ffmkky("TELESCOP", valstring, comm, cptr, status); 
        length = strlen(cptr);
        strncat(cptr, blanks, 80 - length);  /* pad with blanks */
        cptr += 80;
    }

    /*  INSTRUME keyword */
    tstatus = 0;
    if (ffgkey(fptr, "INSTRUME", valstring, NULL, &tstatus) == 0 )
    {
        ffmkky("INSTRUME", valstring, comm, cptr, status);  
        length = strlen(cptr);
        strncat(cptr, blanks, 80 - length);  /* pad with blanks */
        cptr += 80;
    }

    /*  DETECTOR keyword */
    tstatus = 0;
    if (ffgkey(fptr, "DETECTOR", valstring, NULL, &tstatus) == 0 )
    {
        ffmkky("DETECTOR", valstring, comm, cptr, status);  
        length = strlen(cptr);
        strncat(cptr, blanks, 80 - length);  /* pad with blanks */
        cptr += 80;
    }

    /*  MJD-OBS keyword */
    tstatus = 0;
    if (ffgkey(fptr, "MJD-OBS", valstring, NULL, &tstatus) == 0 )
    {
        ffmkky("MJD-OBS", valstring, comm, cptr, status);  
        length = strlen(cptr);
        strncat(cptr, blanks, 80 - length);  /* pad with blanks */
        cptr += 80;
    }

    /*  DATE-OBS keyword */
    tstatus = 0;
    if (ffgkey(fptr, "DATE-OBS", valstring, NULL, &tstatus) == 0 )
    {
        ffmkky("DATE-OBS", valstring, comm, cptr, status);  
        length = strlen(cptr);
        strncat(cptr, blanks, 80 - length);  /* pad with blanks */
        cptr += 80;
    }

    /*  DATE keyword */
    tstatus = 0;
    if (ffgkey(fptr, "DATE", valstring, NULL, &tstatus) == 0 )
    {
        ffmkky("DATE", valstring, comm, cptr, status);  
        length = strlen(cptr);
        strncat(cptr, blanks, 80 - length);  /* pad with blanks */
        cptr += 80;
    }

    strcat(cptr, "END");
    strncat(cptr, blanks, 77);

    return(*status);
}
cfitsio-3.47/wcsutil.c0000644000225700000360000004060113464573432014247 0ustar  cagordonlhea#include 
#include "fitsio2.h"
#define D2R 0.01745329252
#define TWOPI 6.28318530717959

/*--------------------------------------------------------------------------*/
int ffwldp(double xpix, double ypix, double xref, double yref,
      double xrefpix, double yrefpix, double xinc, double yinc, double rot,
      char *type, double *xpos, double *ypos, int *status)

/* This routine is based on the classic AIPS WCS routine. 

   It converts from pixel location to RA,Dec for 9 projective geometries:
   "-CAR", "-SIN", "-TAN", "-ARC", "-NCP", "-GLS", "-MER", "-AIT" and "-STG".
*/

/*-----------------------------------------------------------------------*/
/* routine to determine accurate position for pixel coordinates          */
/* returns 0 if successful otherwise:                                    */
/* 501 = angle too large for projection;                                 */
/* does: -CAR, -SIN, -TAN, -ARC, -NCP, -GLS, -MER, -AIT  -STG projections*/
/* Input:                                                                */
/*   f   xpix    x pixel number  (RA or long without rotation)           */
/*   f   ypiy    y pixel number  (dec or lat without rotation)           */
/*   d   xref    x reference coordinate value (deg)                      */
/*   d   yref    y reference coordinate value (deg)                      */
/*   f   xrefpix x reference pixel                                       */
/*   f   yrefpix y reference pixel                                       */
/*   f   xinc    x coordinate increment (deg)                            */
/*   f   yinc    y coordinate increment (deg)                            */
/*   f   rot     rotation (deg)  (from N through E)                      */
/*   c  *type    projection type code e.g. "-SIN";                       */
/* Output:                                                               */
/*   d   *xpos   x (RA) coordinate (deg)                                 */
/*   d   *ypos   y (dec) coordinate (deg)                                */
/*-----------------------------------------------------------------------*/
 {double cosr, sinr, dx, dy, dz, temp, x, y, z;
  double sins, coss, dect, rat, dt, l, m, mg, da, dd, cos0, sin0;
  double dec0, ra0;
  double geo1, geo2, geo3;
  double deps = 1.0e-5;
  char *cptr;
  
  if (*status > 0)
     return(*status);

/*   Offset from ref pixel  */
  dx = (xpix-xrefpix) * xinc;
  dy = (ypix-yrefpix) * yinc;

/*   Take out rotation  */
  cosr = cos(rot * D2R);
  sinr = sin(rot * D2R);
  if (rot != 0.0) {
     temp = dx * cosr - dy * sinr;
     dy = dy * cosr + dx * sinr;
     dx = temp;
  }

/* convert to radians  */
  ra0 = xref * D2R;
  dec0 = yref * D2R;

  l = dx * D2R;
  m = dy * D2R;
  sins = l*l + m*m;
  cos0 = cos(dec0);
  sin0 = sin(dec0);

  if (*type != '-') {  /* unrecognized projection code */
     return(*status = 504);
  }

    cptr = type + 1;

    if (*cptr == 'C') { /* linear -CAR */
      if (*(cptr + 1) != 'A' ||  *(cptr + 2) != 'R') {
         return(*status = 504);
      }
      rat =  ra0 + l;
      dect = dec0 + m;

    } else if (*cptr == 'T') {  /* -TAN */
      if (*(cptr + 1) != 'A' ||  *(cptr + 2) != 'N') {
         return(*status = 504);
      }
      x = cos0*cos(ra0) - l*sin(ra0) - m*cos(ra0)*sin0;
      y = cos0*sin(ra0) + l*cos(ra0) - m*sin(ra0)*sin0;
      z = sin0                       + m*         cos0;
      rat  = atan2( y, x );
      dect = atan ( z / sqrt(x*x+y*y) );

    } else if (*cptr == 'S') {

      if (*(cptr + 1) == 'I' &&  *(cptr + 2) == 'N') { /* -SIN */
          if (sins>1.0)
	    return(*status = 501);
          coss = sqrt (1.0 - sins);
          dt = sin0 * coss + cos0 * m;
          if ((dt>1.0) || (dt<-1.0))
	    return(*status = 501);
          dect = asin (dt);
          rat = cos0 * coss - sin0 * m;
          if ((rat==0.0) && (l==0.0))
	    return(*status = 501);
          rat = atan2 (l, rat) + ra0;

       } else if (*(cptr + 1) == 'T' &&  *(cptr + 2) == 'G') {  /* -STG Sterographic*/
          dz = (4.0 - sins) / (4.0 + sins);
          if (fabs(dz)>1.0)
	    return(*status = 501);
          dect = dz * sin0 + m * cos0 * (1.0+dz) / 2.0;
          if (fabs(dect)>1.0)
	    return(*status = 501);
          dect = asin (dect);
          rat = cos(dect);
          if (fabs(rat)1.0)
	    return(*status = 501);
          rat = asin (rat);
          mg = 1.0 + sin(dect) * sin0 + cos(dect) * cos0 * cos(rat);
          if (fabs(mg)deps)
	    rat = TWOPI /2.0 - rat;
          rat = ra0 + rat;
        } else  {
          return(*status = 504);
        }
 
    } else if (*cptr == 'A') {

      if (*(cptr + 1) == 'R' &&  *(cptr + 2) == 'C') { /* ARC */
          if (sins>=TWOPI*TWOPI/4.0)
	    return(*status = 501);
          sins = sqrt(sins);
          coss = cos (sins);
          if (sins!=0.0)
	    sins = sin (sins) / sins;
          else
	    sins = 1.0;
          dt = m * cos0 * sins + sin0 * coss;
          if ((dt>1.0) || (dt<-1.0))
	    return(*status = 501);
          dect = asin (dt);
          da = coss - dt * sin0;
          dt = l * sins * cos0;
          if ((da==0.0) && (dt==0.0))
	    return(*status = 501);
          rat = ra0 + atan2 (dt, da);

      } else if (*(cptr + 1) == 'I' &&  *(cptr + 2) == 'T') {  /* -AIT Aitoff */
          dt = yinc*cosr + xinc*sinr;
          if (dt==0.0)
	    dt = 1.0;
          dt = dt * D2R;
          dy = yref * D2R;
          dx = sin(dy+dt)/sqrt((1.0+cos(dy+dt))/2.0) -
	      sin(dy)/sqrt((1.0+cos(dy))/2.0);
          if (dx==0.0)
	    dx = 1.0;
          geo2 = dt / dx;
          dt = xinc*cosr - yinc* sinr;
          if (dt==0.0)
	    dt = 1.0;
          dt = dt * D2R;
          dx = 2.0 * cos(dy) * sin(dt/2.0);
          if (dx==0.0) dx = 1.0;
          geo1 = dt * sqrt((1.0+cos(dy)*cos(dt/2.0))/2.0) / dx;
          geo3 = geo2 * sin(dy) / sqrt((1.0+cos(dy))/2.0);
          rat = ra0;
          dect = dec0;
          if ((l != 0.0) || (m != 0.0)) {
            dz = 4.0 - l*l/(4.0*geo1*geo1) - ((m+geo3)/geo2)*((m+geo3)/geo2) ;
            if ((dz>4.0) || (dz<2.0)) return(*status = 501);
            dz = 0.5 * sqrt (dz);
            dd = (m+geo3) * dz / geo2;
            if (fabs(dd)>1.0) return(*status = 501);
            dd = asin (dd);
            if (fabs(cos(dd))1.0) return(*status = 501);
            da = asin (da);
            rat = ra0 + 2.0 * da;
            dect = dd;
          }
        } else  {
          return(*status = 504);
        }
 
    } else if (*cptr == 'N') { /* -NCP North celestial pole*/
      if (*(cptr + 1) != 'C' ||  *(cptr + 2) != 'P') {
         return(*status = 504);
      }
      dect = cos0 - m * sin0;
      if (dect==0.0)
        return(*status = 501);
      rat = ra0 + atan2 (l, dect);
      dt = cos (rat-ra0);
      if (dt==0.0)
        return(*status = 501);
      dect = dect / dt;
      if ((dect>1.0) || (dect<-1.0))
        return(*status = 501);
      dect = acos (dect);
      if (dec0<0.0) dect = -dect;

    } else if (*cptr == 'G') {   /* -GLS global sinusoid */
      if (*(cptr + 1) != 'L' ||  *(cptr + 2) != 'S') {
         return(*status = 504);
      }
      dect = dec0 + m;
      if (fabs(dect)>TWOPI/4.0)
        return(*status = 501);
      coss = cos (dect);
      if (fabs(l)>TWOPI*coss/2.0)
        return(*status = 501);
      rat = ra0;
      if (coss>deps) rat = rat + l / coss;

    } else if (*cptr == 'M') {  /* -MER mercator*/
      if (*(cptr + 1) != 'E' ||  *(cptr + 2) != 'R') {
         return(*status = 504);
      }
      dt = yinc * cosr + xinc * sinr;
      if (dt==0.0) dt = 1.0;
      dy = (yref/2.0 + 45.0) * D2R;
      dx = dy + dt / 2.0 * D2R;
      dy = log (tan (dy));
      dx = log (tan (dx));
      geo2 = dt * D2R / (dx - dy);
      geo3 = geo2 * dy;
      geo1 = cos (yref*D2R);
      if (geo1<=0.0) geo1 = 1.0;
      rat = l / geo1 + ra0;
      if (fabs(rat - ra0) > TWOPI)
        return(*status = 501);
      dt = 0.0;
      if (geo2!=0.0) dt = (m + geo3) / geo2;
      dt = exp (dt);
      dect = 2.0 * atan (dt) - TWOPI / 4.0;

    } else  {
      return(*status = 504);
    }

  /*  correct for RA rollover  */
  if (rat-ra0>TWOPI/2.0) rat = rat - TWOPI;
  if (rat-ra0<-TWOPI/2.0) rat = rat + TWOPI;
  if (rat < 0.0) rat += TWOPI;

  /*  convert to degrees  */
  *xpos  = rat  / D2R;
  *ypos  = dect  / D2R;
  return(*status);
} 
/*--------------------------------------------------------------------------*/
int ffxypx(double xpos, double ypos, double xref, double yref, 
      double xrefpix, double yrefpix, double xinc, double yinc, double rot,
      char *type, double *xpix, double *ypix, int *status)

/* This routine is based on the classic AIPS WCS routine. 

   It converts from RA,Dec to pixel location to for 9 projective geometries:
   "-CAR", "-SIN", "-TAN", "-ARC", "-NCP", "-GLS", "-MER", "-AIT" and "-STG".
*/
/*-----------------------------------------------------------------------*/
/* routine to determine accurate pixel coordinates for an RA and Dec     */
/* returns 0 if successful otherwise:                                    */
/* 501 = angle too large for projection;                                 */
/* 502 = bad values                                                      */
/* does: -SIN, -TAN, -ARC, -NCP, -GLS, -MER, -AIT projections            */
/* anything else is linear                                               */
/* Input:                                                                */
/*   d   xpos    x (RA) coordinate (deg)                                 */
/*   d   ypos    y (dec) coordinate (deg)                                */
/*   d   xref    x reference coordinate value (deg)                      */
/*   d   yref    y reference coordinate value (deg)                      */
/*   f   xrefpix x reference pixel                                       */
/*   f   yrefpix y reference pixel                                       */
/*   f   xinc    x coordinate increment (deg)                            */
/*   f   yinc    y coordinate increment (deg)                            */
/*   f   rot     rotation (deg)  (from N through E)                      */
/*   c  *type    projection type code e.g. "-SIN";                       */
/* Output:                                                               */
/*   f  *xpix    x pixel number  (RA or long without rotation)           */
/*   f  *ypiy    y pixel number  (dec or lat without rotation)           */
/*-----------------------------------------------------------------------*/
 {
  double dx, dy, dz, r, ra0, dec0, ra, dec, coss, sins, dt, da, dd, sint;
  double l, m, geo1, geo2, geo3, sinr, cosr, cos0, sin0;
  double deps=1.0e-5;
  char *cptr;

  if (*type != '-') {  /* unrecognized projection code */
     return(*status = 504);
  }

  cptr = type + 1;

  dt = (xpos - xref);
  if (dt >  180) xpos -= 360;
  if (dt < -180) xpos += 360;
  /* NOTE: changing input argument xpos is OK (call-by-value in C!) */

  /* default values - linear */
  dx = xpos - xref;
  dy = ypos - yref;

  /*  Correct for rotation */
  r = rot * D2R;
  cosr = cos (r);
  sinr = sin (r);
  dz = dx*cosr + dy*sinr;
  dy = dy*cosr - dx*sinr;
  dx = dz;

  /*     check axis increments - bail out if either 0 */
  if ((xinc==0.0) || (yinc==0.0)) {*xpix=0.0; *ypix=0.0;
    return(*status = 502);}

  /*     convert to pixels  */
  *xpix = dx / xinc + xrefpix;
  *ypix = dy / yinc + yrefpix;

  if (*cptr == 'C') { /* linear -CAR */
      if (*(cptr + 1) != 'A' ||  *(cptr + 2) != 'R') {
         return(*status = 504);
      }

      return(*status);  /* done if linear */
  }

  /* Non linear position */
  ra0 = xref * D2R;
  dec0 = yref * D2R;
  ra = xpos * D2R;
  dec = ypos * D2R;

  /* compute direction cosine */
  coss = cos (dec);
  sins = sin (dec);
  cos0 = cos (dec0);
  sin0 = sin (dec0);
  l = sin(ra-ra0) * coss;
  sint = sins * sin0 + coss * cos0 * cos(ra-ra0);

    /* process by case  */
    if (*cptr == 'T') {  /* -TAN tan */
         if (*(cptr + 1) != 'A' ||  *(cptr + 2) != 'N') {
           return(*status = 504);
         }

         if (sint<=0.0)
	   return(*status = 501);
         if( cos0<0.001 ) {
            /* Do a first order expansion around pole */
            m = (coss * cos(ra-ra0)) / (sins * sin0);
            m = (-m + cos0 * (1.0 + m*m)) / sin0;
         } else {
            m = ( sins/sint - sin0 ) / cos0;
         }
	 if( fabs(sin(ra0)) < 0.3 ) {
	    l  = coss*sin(ra)/sint - cos0*sin(ra0) + m*sin(ra0)*sin0;
	    l /= cos(ra0);
	 } else {
	    l  = coss*cos(ra)/sint - cos0*cos(ra0) + m*cos(ra0)*sin0;
	    l /= -sin(ra0);
	 }

    } else if (*cptr == 'S') {

      if (*(cptr + 1) == 'I' &&  *(cptr + 2) == 'N') { /* -SIN */
         if (sint<0.0)
	   return(*status = 501);
         m = sins * cos(dec0) - coss * sin(dec0) * cos(ra-ra0);

      } else if (*(cptr + 1) == 'T' &&  *(cptr + 2) == 'G') {  /* -STG Sterographic*/
         da = ra - ra0;
         if (fabs(dec)>TWOPI/4.0)
	   return(*status = 501);
         dd = 1.0 + sins * sin(dec0) + coss * cos(dec0) * cos(da);
         if (fabs(dd)1.0) m = 1.0;
         m = acos (m);
         if (m!=0) 
            m = m / sin(m);
         else
            m = 1.0;
         l = l * m;
         m = (sins * cos(dec0) - coss * sin(dec0) * cos(ra-ra0)) * m;

      } else if (*(cptr + 1) == 'I' &&  *(cptr + 2) == 'T') {  /* -AIT Aitoff */
         da = (ra - ra0) / 2.0;
         if (fabs(da)>TWOPI/4.0)
	     return(*status = 501);
         dt = yinc*cosr + xinc*sinr;
         if (dt==0.0) dt = 1.0;
         dt = dt * D2R;
         dy = yref * D2R;
         dx = sin(dy+dt)/sqrt((1.0+cos(dy+dt))/2.0) -
             sin(dy)/sqrt((1.0+cos(dy))/2.0);
         if (dx==0.0) dx = 1.0;
         geo2 = dt / dx;
         dt = xinc*cosr - yinc* sinr;
         if (dt==0.0) dt = 1.0;
         dt = dt * D2R;
         dx = 2.0 * cos(dy) * sin(dt/2.0);
         if (dx==0.0) dx = 1.0;
         geo1 = dt * sqrt((1.0+cos(dy)*cos(dt/2.0))/2.0) / dx;
         geo3 = geo2 * sin(dy) / sqrt((1.0+cos(dy))/2.0);
         dt = sqrt ((1.0 + cos(dec) * cos(da))/2.0);
         if (fabs(dt)TWOPI/4.0)
	   return(*status = 501);
         if (fabs(dec0)>TWOPI/4.0)
	   return(*status = 501);
         m = dec - dec0;
         l = dt * coss;

    } else if (*cptr == 'M') {  /* -MER mercator*/
         if (*(cptr + 1) != 'E' ||  *(cptr + 2) != 'R') {
             return(*status = 504);
         }

         dt = yinc * cosr + xinc * sinr;
         if (dt==0.0) dt = 1.0;
         dy = (yref/2.0 + 45.0) * D2R;
         dx = dy + dt / 2.0 * D2R;
         dy = log (tan (dy));
         dx = log (tan (dx));
         geo2 = dt * D2R / (dx - dy);
         geo3 = geo2 * dy;
         geo1 = cos (yref*D2R);
         if (geo1<=0.0) geo1 = 1.0;
         dt = ra - ra0;
         l = geo1 * dt;
         dt = dec / 2.0 + TWOPI / 8.0;
         dt = tan (dt);
         if (dt
#include 
#include 
#include 

#ifdef _ALPHA_
#define e_magic_number IMAGE_FILE_MACHINE_ALPHA
#else
#define e_magic_number IMAGE_FILE_MACHINE_I386
#endif

/*
 *----------------------------------------------------------------------
 * GetArgcArgv --
 * 
 *	Break up a line into argc argv
 *----------------------------------------------------------------------
 */
int
GetArgcArgv(char *s, char **argv)
{
    int quote = 0;
    int argc = 0;
    char *bp;

    bp = s;
    while (1) {
	while (isspace(*bp)) {
	    bp++;
	}
	if (*bp == '\n' || *bp == '\0') {
	    *bp = '\0';
	    return argc;
	}
	if (*bp == '\"') {
	    quote = 1;
	    bp++;
	}
	argv[argc++] = bp;

	while (*bp != '\0') {
	    if (quote) {
		if (*bp == '\"') {
		    quote = 0;
		    *bp = '\0';
		    bp++;
		    break;
		}
		bp++;
		continue;
	    }
	    if (isspace(*bp)) {
		*bp = '\0';
		bp++;
		break;
	    }
	    bp++;
	}
    }
}

/*
 *  The names of the first group of possible symbol table storage classes
 */
char * SzStorageClass1[] = {
    "NULL","AUTOMATIC","EXTERNAL","STATIC","REGISTER","EXTERNAL_DEF","LABEL",
    "UNDEFINED_LABEL","MEMBER_OF_STRUCT","ARGUMENT","STRUCT_TAG",
    "MEMBER_OF_UNION","UNION_TAG","TYPE_DEFINITION","UNDEFINED_STATIC",
    "ENUM_TAG","MEMBER_OF_ENUM","REGISTER_PARAM","BIT_FIELD"
};

/*
 * The names of the second group of possible symbol table storage classes
 */
char * SzStorageClass2[] = {
    "BLOCK","FUNCTION","END_OF_STRUCT","FILE","SECTION","WEAK_EXTERNAL"
};

/*
 *----------------------------------------------------------------------
 * GetSZStorageClass --
 *
 *	Given a symbol storage class value, return a descriptive
 *	ASCII string
 *----------------------------------------------------------------------
 */
PSTR
GetSZStorageClass(BYTE storageClass)
{
	if ( storageClass <= IMAGE_SYM_CLASS_BIT_FIELD )
		return SzStorageClass1[storageClass];
	else if ( (storageClass >= IMAGE_SYM_CLASS_BLOCK)
		      && (storageClass <= IMAGE_SYM_CLASS_WEAK_EXTERNAL) )
		return SzStorageClass2[storageClass-IMAGE_SYM_CLASS_BLOCK];
	else
		return "???";
}

/*
 *----------------------------------------------------------------------
 * GetSectionName --
 *
 *	Used by DumpSymbolTable, it gives meaningful names to
 *	the non-normal section number.
 *
 * Results:
 *	A name is returned in buffer
 *----------------------------------------------------------------------
 */
void
GetSectionName(WORD section, PSTR buffer, unsigned cbBuffer)
{
    char tempbuffer[10];
	
    switch ( (SHORT)section )
    {
      case IMAGE_SYM_UNDEFINED: strcpy(tempbuffer, "UNDEF"); break;
      case IMAGE_SYM_ABSOLUTE:  strcpy(tempbuffer, "ABS  "); break;
      case IMAGE_SYM_DEBUG:	  strcpy(tempbuffer, "DEBUG"); break;
      default: wsprintf(tempbuffer, "%-5X", section);
    }
	
    strncpy(buffer, tempbuffer, cbBuffer-1);
}

/*
 *----------------------------------------------------------------------
 * DumpSymbolTable --
 *
 *	Dumps a COFF symbol table from an EXE or OBJ.  We only use
 *	it to dump tables from OBJs.
 *----------------------------------------------------------------------
 */
void
DumpSymbolTable(PIMAGE_SYMBOL pSymbolTable, FILE *fout, unsigned cSymbols)
{
    unsigned i;
    PSTR stringTable;
    char sectionName[10];
	
    fprintf(fout, "Symbol Table - %X entries  (* = auxillary symbol)\n",
	    cSymbols);

    fprintf(fout, 
     "Indx Name                 Value    Section    cAux  Type    Storage\n"
     "---- -------------------- -------- ---------- ----- ------- --------\n");

    /*
     * The string table apparently starts right after the symbol table
     */
    stringTable = (PSTR)&pSymbolTable[cSymbols]; 
		
    for ( i=0; i < cSymbols; i++ ) {
	fprintf(fout, "%04X ", i);
	if ( pSymbolTable->N.Name.Short != 0 )
	    fprintf(fout, "%-20.8s", pSymbolTable->N.ShortName);
	else
	    fprintf(fout, "%-20s", stringTable + pSymbolTable->N.Name.Long);

	fprintf(fout, " %08X", pSymbolTable->Value);

	GetSectionName(pSymbolTable->SectionNumber, sectionName,
		       sizeof(sectionName));
	fprintf(fout, " sect:%s aux:%X type:%02X st:%s\n",
	       sectionName,
	       pSymbolTable->NumberOfAuxSymbols,
	       pSymbolTable->Type,
	       GetSZStorageClass(pSymbolTable->StorageClass) );
#if 0
	if ( pSymbolTable->NumberOfAuxSymbols )
	    DumpAuxSymbols(pSymbolTable);
#endif

	/*
	 * Take into account any aux symbols
	 */
	i += pSymbolTable->NumberOfAuxSymbols;
	pSymbolTable += pSymbolTable->NumberOfAuxSymbols;
	pSymbolTable++;
    }
}

/*
 *----------------------------------------------------------------------
 * DumpExternals --
 *
 *	Dumps a COFF symbol table from an EXE or OBJ.  We only use
 *	it to dump tables from OBJs.
 *----------------------------------------------------------------------
 */
void
DumpExternals(PIMAGE_SYMBOL pSymbolTable, FILE *fout, unsigned cSymbols)
{
    unsigned i;
    PSTR stringTable;
    char *s, *f;
    char symbol[1024];
	
    /*
     * The string table apparently starts right after the symbol table
     */
    stringTable = (PSTR)&pSymbolTable[cSymbols]; 
		
    for ( i=0; i < cSymbols; i++ ) {
	if (pSymbolTable->SectionNumber > 0 && pSymbolTable->Type == 0x20) {
	    if (pSymbolTable->StorageClass == IMAGE_SYM_CLASS_EXTERNAL) {
		if (pSymbolTable->N.Name.Short != 0) {
		    strncpy(symbol, pSymbolTable->N.ShortName, 8);
		    symbol[8] = 0;
		} else {
		    s = stringTable + pSymbolTable->N.Name.Long;
		    strncpy(symbol, s, 1023);
                    symbol[1023]=0;
		}
		s = symbol;
		f = strchr(s, '@');
		if (f) {
		    *f = 0;
		}
#if defined(_MSC_VER) && defined(_X86_)
		if (symbol[0] == '_') {
		    s = &symbol[1];
		}
#endif
		if ((stricmp(s, "DllEntryPoint") != 0) 
			&& (stricmp(s, "DllMain") != 0)) {
		    fprintf(fout, "\t%s\n", s);
		}
	    }
	}

	/*
	 * Take into account any aux symbols
	 */
	i += pSymbolTable->NumberOfAuxSymbols;
	pSymbolTable += pSymbolTable->NumberOfAuxSymbols;
	pSymbolTable++;
    }
}

/*
 *----------------------------------------------------------------------
 * DumpObjFile --
 *
 *	Dump an object file--either a full listing or just the exported
 *	symbols.
 *----------------------------------------------------------------------
 */
void
DumpObjFile(PIMAGE_FILE_HEADER pImageFileHeader, FILE *fout, int full)
{
    PIMAGE_SYMBOL PCOFFSymbolTable;
    DWORD COFFSymbolCount;
    
    PCOFFSymbolTable = (PIMAGE_SYMBOL)
	((DWORD)pImageFileHeader + pImageFileHeader->PointerToSymbolTable);
    COFFSymbolCount = pImageFileHeader->NumberOfSymbols;

    if (full) {
	DumpSymbolTable(PCOFFSymbolTable, fout, COFFSymbolCount);
    } else {
	DumpExternals(PCOFFSymbolTable, fout, COFFSymbolCount);
    }
}

/*
 *----------------------------------------------------------------------
 * SkipToNextRecord --
 *
 *	Skip over the current ROMF record and return the type of the
 *	next record.
 *----------------------------------------------------------------------
 */

BYTE
SkipToNextRecord(BYTE **ppBuffer)
{
    int length;
    (*ppBuffer)++;		/* Skip over the type.*/
    length = *((WORD*)(*ppBuffer))++; /* Retrieve the length. */
    *ppBuffer += length;	/* Skip over the rest. */
    return **ppBuffer;		/* Return the type. */
}

/*
 *----------------------------------------------------------------------
 * DumpROMFObjFile --
 *
 *	Dump a Relocatable Object Module Format file, displaying only
 *	the exported symbols.
 *----------------------------------------------------------------------
 */
void
DumpROMFObjFile(LPVOID pBuffer, FILE *fout)
{
    BYTE type, length;
    char symbol[1024], *s;

    while (1) {
	type = SkipToNextRecord(&(BYTE*)pBuffer);
	if (type == 0x90) {	/* PUBDEF */
	    if (((BYTE*)pBuffer)[4] != 0) {
		length = ((BYTE*)pBuffer)[5];
		strncpy(symbol, ((char*)pBuffer) + 6, length);
		symbol[length] = '\0';
		s = symbol;
		if ((stricmp(s, "DllEntryPoint") != 0) 
			&& (stricmp(s, "DllMain") != 0)) {
		    if (s[0] == '_') {
			s++;
			fprintf(fout, "\t_%s\n\t%s=_%s\n", s, s, s);
		    } else {
			fprintf(fout, "\t%s\n", s);
		    }
		}
	    }
	} else if (type == 0x8B || type == 0x8A) { /* MODEND */
	    break;
	}
    }
}

/*
 *----------------------------------------------------------------------
 * DumpFile --
 *
 *	Open up a file, memory map it, and call the appropriate
 *	dumping routine
 *----------------------------------------------------------------------
 */
void
DumpFile(LPSTR filename, FILE *fout, int full)
{
    HANDLE hFile;
    HANDLE hFileMapping;
    LPVOID lpFileBase;
    PIMAGE_DOS_HEADER dosHeader;
	
    hFile = CreateFile(filename, GENERIC_READ, FILE_SHARE_READ, NULL,
		       OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, 0);
					
    if (hFile == INVALID_HANDLE_VALUE) {
	fprintf(stderr, "Couldn't open file with CreateFile()\n");
	return;
    }

    hFileMapping = CreateFileMapping(hFile, NULL, PAGE_READONLY, 0, 0, NULL);
    if (hFileMapping == 0) {
	CloseHandle(hFile);
	fprintf(stderr, "Couldn't open file mapping with CreateFileMapping()\n");
	return;
    }

    lpFileBase = MapViewOfFile(hFileMapping, FILE_MAP_READ, 0, 0, 0);
    if (lpFileBase == 0) {
	CloseHandle(hFileMapping);
	CloseHandle(hFile);
	fprintf(stderr, "Couldn't map view of file with MapViewOfFile()\n");
	return;
    }

    dosHeader = (PIMAGE_DOS_HEADER)lpFileBase;
    if (dosHeader->e_magic == IMAGE_DOS_SIGNATURE) {
#if 0
	DumpExeFile( dosHeader );
#else
	fprintf(stderr, "File is an executable.  I don't dump those.\n");
	return;
#endif
    }
    /* Does it look like a i386 COFF OBJ file??? */
    else if ((dosHeader->e_magic == e_magic_number)
	    && (dosHeader->e_sp == 0)) {
	/*
	 * The two tests above aren't what they look like.  They're
	 * really checking for IMAGE_FILE_HEADER.Machine == i386 (0x14C)
	 * and IMAGE_FILE_HEADER.SizeOfOptionalHeader == 0;
	 */
	DumpObjFile((PIMAGE_FILE_HEADER) lpFileBase, fout, full);
    } else if (*((BYTE *)lpFileBase) == 0x80) {
	/*
	 * This file looks like it might be a ROMF file.
	 */
	DumpROMFObjFile(lpFileBase, fout);
    } else {
	printf("unrecognized file format\n");
    }
    UnmapViewOfFile(lpFileBase);
    CloseHandle(hFileMapping);
    CloseHandle(hFile);
}

void
main(int argc, char **argv)
{
    char *fargv[1000];
    char cmdline[10000];
    int i, arg;
    FILE *fout;
    int pos;
    int full = 0;
    char *outfile = NULL;

    if (argc < 3) {
      Usage:
	fprintf(stderr, "Usage: %s ?-o outfile? ?-f(ull)?   ..\n", argv[0]);
	exit(1);
    }

    arg = 1;
    while (argv[arg][0] == '-') {
	if (strcmp(argv[arg], "--") == 0) {
	    arg++;
	    break;
	} else if (strcmp(argv[arg], "-f") == 0) {
	    full = 1;
	} else if (strcmp(argv[arg], "-o") == 0) {
	    arg++;
	    if (arg == argc) {
		goto Usage;
	    }
	    outfile = argv[arg];
	}
	arg++;
    }
    if (arg == argc) {
	goto Usage;
    }

    if (outfile) {
	fout = fopen(outfile, "w+");
	if (fout == NULL) {
	    fprintf(stderr, "Unable to open \'%s\' for writing:\n",
		    argv[arg]);
	    perror("");
	    exit(1);
	}
    } else {
	fout = stdout;
    }
    
    if (! full) {
	char *dllname = argv[arg];
	arg++;
	if (arg == argc) {
	    goto Usage;
	}
	fprintf(fout, "LIBRARY    %s\n", dllname);
	fprintf(fout, "EXETYPE WINDOWS\n");
	fprintf(fout, "CODE PRELOAD MOVEABLE DISCARDABLE\n");
	fprintf(fout, "DATA PRELOAD MOVEABLE MULTIPLE\n\n");
	fprintf(fout, "EXPORTS\n");
    }

    for (; arg < argc; arg++) {
	if (argv[arg][0] == '@') {
	    FILE *fargs = fopen(&argv[arg][1], "r");
	    if (fargs == NULL) {
		fprintf(stderr, "Unable to open \'%s\' for reading:\n",
			argv[arg]);
		perror("");
		exit(1);
	    }
	    pos = 0;
	    for (i = 0; i < arg; i++) {
		strncpy(&cmdline[pos], argv[i], 9999-pos);
                cmdline[9999]=0;
		pos += strlen(&cmdline[pos]) + 1;
		fargv[i] = argv[i];
	    }
	    fgets(&cmdline[pos], sizeof(cmdline), fargs);
	    fprintf(stderr, "%s\n", &cmdline[pos]);
	    fclose(fargs);
	    i += GetArgcArgv(&cmdline[pos], &fargv[i]);
	    argc = i;
	    argv = fargv;
	}
	DumpFile(argv[arg], fout, full);
    }
    exit(0);
}
cfitsio-3.47/winDumpExts.mak0000644000225700000360000001024113464573432015367 0ustar  cagordonlhea# Microsoft Developer Studio Generated NMAKE File, Based on winDumpExts.dsp
!IF "$(CFG)" == ""
CFG=Win32 Debug
!MESSAGE No configuration specified. Defaulting to Win32 Debug.
!ENDIF 

!IF "$(CFG)" != "Win32 Release" && "$(CFG)" != "Win32 Debug"
!MESSAGE Invalid configuration "$(CFG)" specified.
!MESSAGE You can specify a configuration when running NMAKE
!MESSAGE by defining the macro CFG on the command line. For example:
!MESSAGE 
!MESSAGE NMAKE /f "winDumpExts.mak" CFG="Win32 Debug"
!MESSAGE 
!MESSAGE Possible choices for configuration are:
!MESSAGE 
!MESSAGE "Win32 Release" (based on "Win32 (x86) Console Application")
!MESSAGE "Win32 Debug" (based on "Win32 (x86) Console Application")
!MESSAGE 
!ERROR An invalid configuration is specified.
!ENDIF 

!IF "$(OS)" == "Windows_NT"
NULL=
!ELSE 
NULL=nul
!ENDIF 

!IF  "$(CFG)" == "Win32 Release"

OUTDIR=.\Release
INTDIR=.\Release
# Begin Custom Macros
OutDir=.\Release
# End Custom Macros

ALL : "$(OUTDIR)\winDumpExts.exe"


CLEAN :
	-@erase "$(INTDIR)\vc60.idb"
	-@erase "$(INTDIR)\winDumpExts.obj"
	-@erase "$(OUTDIR)\winDumpExts.exe"

"$(OUTDIR)" :
    if not exist "$(OUTDIR)/$(NULL)" mkdir "$(OUTDIR)"

"$(INTDIR)" :
    if not exist "$(INTDIR)/$(NULL)" mkdir "$(INTDIR)"

CPP=cl.exe
CPP_PROJ=/nologo /ML /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /Fp"$(INTDIR)\winDumpExts.pch" /YX /Fo"$(INTDIR)\\" /Fd"$(INTDIR)\\" /FD /c 

.c{$(INTDIR)}.obj::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.cpp{$(INTDIR)}.obj::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.cxx{$(INTDIR)}.obj::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.c{$(INTDIR)}.sbr::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.cpp{$(INTDIR)}.sbr::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.cxx{$(INTDIR)}.sbr::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

RSC=rc.exe
BSC32=bscmake.exe
BSC32_FLAGS=/nologo /o"$(OUTDIR)\winDumpExts.bsc" 
BSC32_SBRS= \
	
LINK32=link.exe
LINK32_FLAGS=kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /incremental:no /pdb:"$(OUTDIR)\winDumpExts.pdb" /machine:I386 /out:"$(OUTDIR)\winDumpExts.exe" 
LINK32_OBJS= \
	"$(INTDIR)\winDumpExts.obj"

"$(OUTDIR)\winDumpExts.exe" : "$(OUTDIR)" $(DEF_FILE) $(LINK32_OBJS)
    $(LINK32) @<<
  $(LINK32_FLAGS) $(LINK32_OBJS)
<<

!ELSEIF  "$(CFG)" == "Win32 Debug"

OUTDIR=.
INTDIR=.\Debug
# Begin Custom Macros
OutDir=.
# End Custom Macros

ALL : "$(OUTDIR)\winDumpExts.exe"


CLEAN :
	-@erase "$(INTDIR)\vc60.idb"
	-@erase "$(INTDIR)\vc60.pdb"
	-@erase "$(INTDIR)\winDumpExts.obj"
	-@erase "$(OUTDIR)\winDumpExts.exe"
	-@erase "$(OUTDIR)\winDumpExts.ilk"
	-@erase "$(OUTDIR)\winDumpExts.pdb"

"$(OUTDIR)" :
    if not exist "$(OUTDIR)/$(NULL)" mkdir "$(OUTDIR)"

"$(INTDIR)" :
    if not exist "$(INTDIR)/$(NULL)" mkdir "$(INTDIR)"

CPP=cl.exe
CPP_PROJ=/nologo /MLd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /Fp"$(INTDIR)\winDumpExts.pch" /YX /Fo"$(INTDIR)\\" /Fd"$(INTDIR)\\" /FD /GZ /c 

.c{$(INTDIR)}.obj::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.cpp{$(INTDIR)}.obj::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.cxx{$(INTDIR)}.obj::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.c{$(INTDIR)}.sbr::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.cpp{$(INTDIR)}.sbr::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

.cxx{$(INTDIR)}.sbr::
   $(CPP) @<<
   $(CPP_PROJ) $< 
<<

RSC=rc.exe
BSC32=bscmake.exe
BSC32_FLAGS=/nologo /o"$(OUTDIR)\winDumpExts.bsc" 
BSC32_SBRS= \
	
LINK32=link.exe
LINK32_FLAGS=kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /incremental:yes /pdb:"$(OUTDIR)\winDumpExts.pdb" /debug /machine:I386 /out:"$(OUTDIR)\winDumpExts.exe" /pdbtype:sept 
LINK32_OBJS= \
	"$(INTDIR)\winDumpExts.obj"

"$(OUTDIR)\winDumpExts.exe" : "$(OUTDIR)" $(DEF_FILE) $(LINK32_OBJS)
    $(LINK32) @<<
  $(LINK32_FLAGS) $(LINK32_OBJS)
<<

!ENDIF 


!IF "$(NO_EXTERNAL_DEPS)" != "1"
!IF EXISTS("winDumpExts.dep")
!INCLUDE "winDumpExts.dep"
!ELSE 
!MESSAGE Warning: cannot find "winDumpExts.dep"
!ENDIF 
!ENDIF 


!IF "$(CFG)" == "Win32 Release" || "$(CFG)" == "Win32 Debug"
SOURCE=.\winDumpExts.c

"$(INTDIR)\winDumpExts.obj" : $(SOURCE) "$(INTDIR)"



!ENDIF 

cfitsio-3.47/zlib/0000755000225700000360000000000013464573432013350 5ustar  cagordonlheacfitsio-3.47/zlib/adler32.c0000644000225700000360000001164713464573432014761 0ustar  cagordonlhea/* adler32.c -- compute the Adler-32 checksum of a data stream
 * Copyright (C) 1995-2007 Mark Adler
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

#include "zutil.h"

#define local static

local uLong adler32_combine_(uLong adler1, uLong adler2, z_off64_t len2);

#define BASE 65521UL    /* largest prime smaller than 65536 */
#define NMAX 5552
/* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */

#define DO1(buf,i)  {adler += (buf)[i]; sum2 += adler;}
#define DO2(buf,i)  DO1(buf,i); DO1(buf,i+1);
#define DO4(buf,i)  DO2(buf,i); DO2(buf,i+2);
#define DO8(buf,i)  DO4(buf,i); DO4(buf,i+4);
#define DO16(buf)   DO8(buf,0); DO8(buf,8);

/* use NO_DIVIDE if your processor does not do division in hardware */
#ifdef NO_DIVIDE
#  define MOD(a) \
    do { \
        if (a >= (BASE << 16)) a -= (BASE << 16); \
        if (a >= (BASE << 15)) a -= (BASE << 15); \
        if (a >= (BASE << 14)) a -= (BASE << 14); \
        if (a >= (BASE << 13)) a -= (BASE << 13); \
        if (a >= (BASE << 12)) a -= (BASE << 12); \
        if (a >= (BASE << 11)) a -= (BASE << 11); \
        if (a >= (BASE << 10)) a -= (BASE << 10); \
        if (a >= (BASE << 9)) a -= (BASE << 9); \
        if (a >= (BASE << 8)) a -= (BASE << 8); \
        if (a >= (BASE << 7)) a -= (BASE << 7); \
        if (a >= (BASE << 6)) a -= (BASE << 6); \
        if (a >= (BASE << 5)) a -= (BASE << 5); \
        if (a >= (BASE << 4)) a -= (BASE << 4); \
        if (a >= (BASE << 3)) a -= (BASE << 3); \
        if (a >= (BASE << 2)) a -= (BASE << 2); \
        if (a >= (BASE << 1)) a -= (BASE << 1); \
        if (a >= BASE) a -= BASE; \
    } while (0)
#  define MOD4(a) \
    do { \
        if (a >= (BASE << 4)) a -= (BASE << 4); \
        if (a >= (BASE << 3)) a -= (BASE << 3); \
        if (a >= (BASE << 2)) a -= (BASE << 2); \
        if (a >= (BASE << 1)) a -= (BASE << 1); \
        if (a >= BASE) a -= BASE; \
    } while (0)
#else
#  define MOD(a) a %= BASE
#  define MOD4(a) a %= BASE
#endif

/* ========================================================================= */
uLong ZEXPORT adler32(adler, buf, len)
    uLong adler;
    const Bytef *buf;
    uInt len;
{
    unsigned long sum2;
    unsigned n;

    /* split Adler-32 into component sums */
    sum2 = (adler >> 16) & 0xffff;
    adler &= 0xffff;

    /* in case user likes doing a byte at a time, keep it fast */
    if (len == 1) {
        adler += buf[0];
        if (adler >= BASE)
            adler -= BASE;
        sum2 += adler;
        if (sum2 >= BASE)
            sum2 -= BASE;
        return adler | (sum2 << 16);
    }

    /* initial Adler-32 value (deferred check for len == 1 speed) */
    if (buf == Z_NULL)
        return 1L;

    /* in case short lengths are provided, keep it somewhat fast */
    if (len < 16) {
        while (len--) {
            adler += *buf++;
            sum2 += adler;
        }
        if (adler >= BASE)
            adler -= BASE;
        MOD4(sum2);             /* only added so many BASE's */
        return adler | (sum2 << 16);
    }

    /* do length NMAX blocks -- requires just one modulo operation */
    while (len >= NMAX) {
        len -= NMAX;
        n = NMAX / 16;          /* NMAX is divisible by 16 */
        do {
            DO16(buf);          /* 16 sums unrolled */
            buf += 16;
        } while (--n);
        MOD(adler);
        MOD(sum2);
    }

    /* do remaining bytes (less than NMAX, still just one modulo) */
    if (len) {                  /* avoid modulos if none remaining */
        while (len >= 16) {
            len -= 16;
            DO16(buf);
            buf += 16;
        }
        while (len--) {
            adler += *buf++;
            sum2 += adler;
        }
        MOD(adler);
        MOD(sum2);
    }

    /* return recombined sums */
    return adler | (sum2 << 16);
}

/* ========================================================================= */
local uLong adler32_combine_(adler1, adler2, len2)
    uLong adler1;
    uLong adler2;
    z_off64_t len2;
{
    unsigned long sum1;
    unsigned long sum2;
    unsigned rem;

    /* the derivation of this formula is left as an exercise for the reader */
    rem = (unsigned)(len2 % BASE);
    sum1 = adler1 & 0xffff;
    sum2 = rem * sum1;
    MOD(sum2);
    sum1 += (adler2 & 0xffff) + BASE - 1;
    sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem;
    if (sum1 >= BASE) sum1 -= BASE;
    if (sum1 >= BASE) sum1 -= BASE;
    if (sum2 >= (BASE << 1)) sum2 -= (BASE << 1);
    if (sum2 >= BASE) sum2 -= BASE;
    return sum1 | (sum2 << 16);
}

/* ========================================================================= */
uLong ZEXPORT adler32_combine(adler1, adler2, len2)
    uLong adler1;
    uLong adler2;
    z_off_t len2;
{
    return adler32_combine_(adler1, adler2, len2);
}

uLong ZEXPORT adler32_combine64(adler1, adler2, len2)
    uLong adler1;
    uLong adler2;
    z_off64_t len2;
{
    return adler32_combine_(adler1, adler2, len2);
}
cfitsio-3.47/zlib/crc32.c0000644000225700000360000003254013464573432014434 0ustar  cagordonlhea/* crc32.c -- compute the CRC-32 of a data stream
 * Copyright (C) 1995-2006, 2010 Mark Adler
 * For conditions of distribution and use, see copyright notice in zlib.h
 *
 * Thanks to Rodney Brown  for his contribution of faster
 * CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing
 * tables for updating the shift register in one step with three exclusive-ors
 * instead of four steps with four exclusive-ors.  This results in about a
 * factor of two increase in speed on a Power PC G4 (PPC7455) using gcc -O3.
 */

/*
  Note on the use of DYNAMIC_CRC_TABLE: there is no mutex or semaphore
  protection on the static variables used to control the first-use generation
  of the crc tables.  Therefore, if you #define DYNAMIC_CRC_TABLE, you should
  first call get_crc_table() to initialize the tables before allowing more than
  one thread to use crc32().
 */

#ifdef MAKECRCH
#  include 
#  ifndef DYNAMIC_CRC_TABLE
#    define DYNAMIC_CRC_TABLE
#  endif /* !DYNAMIC_CRC_TABLE */
#endif /* MAKECRCH */

#include "zutil.h"      /* for STDC and FAR definitions */

#define local static

/* Find a four-byte integer type for crc32_little() and crc32_big(). */
#ifndef NOBYFOUR
#  ifdef STDC           /* need ANSI C limits.h to determine sizes */
#    include 
#    define BYFOUR
#    if (UINT_MAX == 0xffffffffUL)
       typedef unsigned int u4;
#    else
#      if (ULONG_MAX == 0xffffffffUL)
         typedef unsigned long u4;
#      else
#        if (USHRT_MAX == 0xffffffffUL)
           typedef unsigned short u4;
#        else
#          undef BYFOUR     /* can't find a four-byte integer type! */
#        endif
#      endif
#    endif
#  endif /* STDC */
#endif /* !NOBYFOUR */

/* Definitions for doing the crc four data bytes at a time. */
#ifdef BYFOUR
#  define REV(w) ((((w)>>24)&0xff)+(((w)>>8)&0xff00)+ \
                (((w)&0xff00)<<8)+(((w)&0xff)<<24))
   local unsigned long crc32_little OF((unsigned long,
                        const unsigned char FAR *, unsigned));
   local unsigned long crc32_big OF((unsigned long,
                        const unsigned char FAR *, unsigned));
#  define TBLS 8
#else
#  define TBLS 1
#endif /* BYFOUR */

/* Local functions for crc concatenation */
local unsigned long gf2_matrix_times OF((unsigned long *mat,
                                         unsigned long vec));
local void gf2_matrix_square OF((unsigned long *square, unsigned long *mat));
local uLong crc32_combine_(uLong crc1, uLong crc2, z_off64_t len2);


#ifdef DYNAMIC_CRC_TABLE

local volatile int crc_table_empty = 1;
local unsigned long FAR crc_table[TBLS][256];
local void make_crc_table OF((void));
#ifdef MAKECRCH
   local void write_table OF((FILE *, const unsigned long FAR *));
#endif /* MAKECRCH */
/*
  Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
  x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+1.

  Polynomials over GF(2) are represented in binary, one bit per coefficient,
  with the lowest powers in the most significant bit.  Then adding polynomials
  is just exclusive-or, and multiplying a polynomial by x is a right shift by
  one.  If we call the above polynomial p, and represent a byte as the
  polynomial q, also with the lowest power in the most significant bit (so the
  byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
  where a mod b means the remainder after dividing a by b.

  This calculation is done using the shift-register method of multiplying and
  taking the remainder.  The register is initialized to zero, and for each
  incoming bit, x^32 is added mod p to the register if the bit is a one (where
  x^32 mod p is p+x^32 = x^26+...+1), and the register is multiplied mod p by
  x (which is shifting right by one and adding x^32 mod p if the bit shifted
  out is a one).  We start with the highest power (least significant bit) of
  q and repeat for all eight bits of q.

  The first table is simply the CRC of all possible eight bit values.  This is
  all the information needed to generate CRCs on data a byte at a time for all
  combinations of CRC register values and incoming bytes.  The remaining tables
  allow for word-at-a-time CRC calculation for both big-endian and little-
  endian machines, where a word is four bytes.
*/
local void make_crc_table()
{
    unsigned long c;
    int n, k;
    unsigned long poly;                 /* polynomial exclusive-or pattern */
    /* terms of polynomial defining this crc (except x^32): */
    static volatile int first = 1;      /* flag to limit concurrent making */
    static const unsigned char p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26};

    /* See if another task is already doing this (not thread-safe, but better
       than nothing -- significantly reduces duration of vulnerability in
       case the advice about DYNAMIC_CRC_TABLE is ignored) */
    if (first) {
        first = 0;

        /* make exclusive-or pattern from polynomial (0xedb88320UL) */
        poly = 0UL;
        for (n = 0; n < sizeof(p)/sizeof(unsigned char); n++)
            poly |= 1UL << (31 - p[n]);

        /* generate a crc for every 8-bit value */
        for (n = 0; n < 256; n++) {
            c = (unsigned long)n;
            for (k = 0; k < 8; k++)
                c = c & 1 ? poly ^ (c >> 1) : c >> 1;
            crc_table[0][n] = c;
        }

#ifdef BYFOUR
        /* generate crc for each value followed by one, two, and three zeros,
           and then the byte reversal of those as well as the first table */
        for (n = 0; n < 256; n++) {
            c = crc_table[0][n];
            crc_table[4][n] = REV(c);
            for (k = 1; k < 4; k++) {
                c = crc_table[0][c & 0xff] ^ (c >> 8);
                crc_table[k][n] = c;
                crc_table[k + 4][n] = REV(c);
            }
        }
#endif /* BYFOUR */

        crc_table_empty = 0;
    }
    else {      /* not first */
        /* wait for the other guy to finish (not efficient, but rare) */
        while (crc_table_empty)
            ;
    }

#ifdef MAKECRCH
    /* write out CRC tables to crc32.h */
    {
        FILE *out;

        out = fopen("crc32.h", "w");
        if (out == NULL) return;
        fprintf(out, "/* crc32.h -- tables for rapid CRC calculation\n");
        fprintf(out, " * Generated automatically by crc32.c\n */\n\n");
        fprintf(out, "local const unsigned long FAR ");
        fprintf(out, "crc_table[TBLS][256] =\n{\n  {\n");
        write_table(out, crc_table[0]);
#  ifdef BYFOUR
        fprintf(out, "#ifdef BYFOUR\n");
        for (k = 1; k < 8; k++) {
            fprintf(out, "  },\n  {\n");
            write_table(out, crc_table[k]);
        }
        fprintf(out, "#endif\n");
#  endif /* BYFOUR */
        fprintf(out, "  }\n};\n");
        fclose(out);
    }
#endif /* MAKECRCH */
}

#ifdef MAKECRCH
local void write_table(out, table)
    FILE *out;
    const unsigned long FAR *table;
{
    int n;

    for (n = 0; n < 256; n++)
        fprintf(out, "%s0x%08lxUL%s", n % 5 ? "" : "    ", table[n],
                n == 255 ? "\n" : (n % 5 == 4 ? ",\n" : ", "));
}
#endif /* MAKECRCH */

#else /* !DYNAMIC_CRC_TABLE */
/* ========================================================================
 * Tables of CRC-32s of all single-byte values, made by make_crc_table().
 */
#include "crc32.h"
#endif /* DYNAMIC_CRC_TABLE */

/* =========================================================================
 * This function can be used by asm versions of crc32()
 */
const unsigned long FAR * ZEXPORT get_crc_table()
{
#ifdef DYNAMIC_CRC_TABLE
    if (crc_table_empty)
        make_crc_table();
#endif /* DYNAMIC_CRC_TABLE */
    return (const unsigned long FAR *)crc_table;
}

/* ========================================================================= */
#define DO1 crc = crc_table[0][((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8)
#define DO8 DO1; DO1; DO1; DO1; DO1; DO1; DO1; DO1

/* ========================================================================= */
unsigned long ZEXPORT crc32(crc, buf, len)
    unsigned long crc;
    const unsigned char FAR *buf;
    uInt len;
{
    if (buf == Z_NULL) return 0UL;

#ifdef DYNAMIC_CRC_TABLE
    if (crc_table_empty)
        make_crc_table();
#endif /* DYNAMIC_CRC_TABLE */

#ifdef BYFOUR
    if (sizeof(void *) == sizeof(ptrdiff_t)) {
        u4 endian;

        endian = 1;
        if (*((unsigned char *)(&endian)))
            return crc32_little(crc, buf, len);
        else
            return crc32_big(crc, buf, len);
    }
#endif /* BYFOUR */
    crc = crc ^ 0xffffffffUL;
    while (len >= 8) {
        DO8;
        len -= 8;
    }
    if (len) do {
        DO1;
    } while (--len);
    return crc ^ 0xffffffffUL;
}

#ifdef BYFOUR

/* ========================================================================= */
#define DOLIT4 c ^= *buf4++; \
        c = crc_table[3][c & 0xff] ^ crc_table[2][(c >> 8) & 0xff] ^ \
            crc_table[1][(c >> 16) & 0xff] ^ crc_table[0][c >> 24]
#define DOLIT32 DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4

/* ========================================================================= */
local unsigned long crc32_little(crc, buf, len)
    unsigned long crc;
    const unsigned char FAR *buf;
    unsigned len;
{
    register u4 c;
    register const u4 FAR *buf4;

    c = (u4)crc;
    c = ~c;
    while (len && ((ptrdiff_t)buf & 3)) {
        c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8);
        len--;
    }

    buf4 = (const u4 FAR *)(const void FAR *)buf;
    while (len >= 32) {
        DOLIT32;
        len -= 32;
    }
    while (len >= 4) {
        DOLIT4;
        len -= 4;
    }
    buf = (const unsigned char FAR *)buf4;

    if (len) do {
        c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8);
    } while (--len);
    c = ~c;
    return (unsigned long)c;
}

/* ========================================================================= */
#define DOBIG4 c ^= *++buf4; \
        c = crc_table[4][c & 0xff] ^ crc_table[5][(c >> 8) & 0xff] ^ \
            crc_table[6][(c >> 16) & 0xff] ^ crc_table[7][c >> 24]
#define DOBIG32 DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4

/* ========================================================================= */
local unsigned long crc32_big(crc, buf, len)
    unsigned long crc;
    const unsigned char FAR *buf;
    unsigned len;
{
    register u4 c;
    register const u4 FAR *buf4;

    c = REV((u4)crc);
    c = ~c;
    while (len && ((ptrdiff_t)buf & 3)) {
        c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8);
        len--;
    }

    buf4 = (const u4 FAR *)(const void FAR *)buf;
    buf4--;
    while (len >= 32) {
        DOBIG32;
        len -= 32;
    }
    while (len >= 4) {
        DOBIG4;
        len -= 4;
    }
    buf4++;
    buf = (const unsigned char FAR *)buf4;

    if (len) do {
        c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8);
    } while (--len);
    c = ~c;
    return (unsigned long)(REV(c));
}

#endif /* BYFOUR */

#define GF2_DIM 32      /* dimension of GF(2) vectors (length of CRC) */

/* ========================================================================= */
local unsigned long gf2_matrix_times(mat, vec)
    unsigned long *mat;
    unsigned long vec;
{
    unsigned long sum;

    sum = 0;
    while (vec) {
        if (vec & 1)
            sum ^= *mat;
        vec >>= 1;
        mat++;
    }
    return sum;
}

/* ========================================================================= */
local void gf2_matrix_square(square, mat)
    unsigned long *square;
    unsigned long *mat;
{
    int n;

    for (n = 0; n < GF2_DIM; n++)
        square[n] = gf2_matrix_times(mat, mat[n]);
}

/* ========================================================================= */
local uLong crc32_combine_(crc1, crc2, len2)
    uLong crc1;
    uLong crc2;
    z_off64_t len2;
{
    int n;
    unsigned long row;
    unsigned long even[GF2_DIM];    /* even-power-of-two zeros operator */
    unsigned long odd[GF2_DIM];     /* odd-power-of-two zeros operator */

    /* degenerate case (also disallow negative lengths) */
    if (len2 <= 0)
        return crc1;

    /* put operator for one zero bit in odd */
    odd[0] = 0xedb88320UL;          /* CRC-32 polynomial */
    row = 1;
    for (n = 1; n < GF2_DIM; n++) {
        odd[n] = row;
        row <<= 1;
    }

    /* put operator for two zero bits in even */
    gf2_matrix_square(even, odd);

    /* put operator for four zero bits in odd */
    gf2_matrix_square(odd, even);

    /* apply len2 zeros to crc1 (first square will put the operator for one
       zero byte, eight zero bits, in even) */
    do {
        /* apply zeros operator for this bit of len2 */
        gf2_matrix_square(even, odd);
        if (len2 & 1)
            crc1 = gf2_matrix_times(even, crc1);
        len2 >>= 1;

        /* if no more bits set, then done */
        if (len2 == 0)
            break;

        /* another iteration of the loop with odd and even swapped */
        gf2_matrix_square(odd, even);
        if (len2 & 1)
            crc1 = gf2_matrix_times(odd, crc1);
        len2 >>= 1;

        /* if no more bits set, then done */
    } while (len2 != 0);

    /* return combined crc */
    crc1 ^= crc2;
    return crc1;
}

/* ========================================================================= */
uLong ZEXPORT crc32_combine(crc1, crc2, len2)
    uLong crc1;
    uLong crc2;
    z_off_t len2;
{
    return crc32_combine_(crc1, crc2, len2);
}

uLong ZEXPORT crc32_combine64(crc1, crc2, len2)
    uLong crc1;
    uLong crc2;
    z_off64_t len2;
{
    return crc32_combine_(crc1, crc2, len2);
}
cfitsio-3.47/zlib/crc32.h0000644000225700000360000007355013464573432014447 0ustar  cagordonlhea/* crc32.h -- tables for rapid CRC calculation
 * Generated automatically by crc32.c
 */

local const unsigned long FAR crc_table[TBLS][256] =
{
  {
    0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
    0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
    0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
    0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
    0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
    0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
    0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
    0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
    0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
    0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
    0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
    0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
    0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
    0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
    0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
    0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
    0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
    0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
    0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
    0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
    0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
    0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
    0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
    0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
    0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
    0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
    0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
    0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
    0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
    0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
    0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
    0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
    0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
    0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
    0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
    0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
    0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
    0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
    0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
    0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
    0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
    0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
    0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
    0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
    0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
    0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
    0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
    0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
    0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
    0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
    0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
    0x2d02ef8dUL
#ifdef BYFOUR
  },
  {
    0x00000000UL, 0x191b3141UL, 0x32366282UL, 0x2b2d53c3UL, 0x646cc504UL,
    0x7d77f445UL, 0x565aa786UL, 0x4f4196c7UL, 0xc8d98a08UL, 0xd1c2bb49UL,
    0xfaefe88aUL, 0xe3f4d9cbUL, 0xacb54f0cUL, 0xb5ae7e4dUL, 0x9e832d8eUL,
    0x87981ccfUL, 0x4ac21251UL, 0x53d92310UL, 0x78f470d3UL, 0x61ef4192UL,
    0x2eaed755UL, 0x37b5e614UL, 0x1c98b5d7UL, 0x05838496UL, 0x821b9859UL,
    0x9b00a918UL, 0xb02dfadbUL, 0xa936cb9aUL, 0xe6775d5dUL, 0xff6c6c1cUL,
    0xd4413fdfUL, 0xcd5a0e9eUL, 0x958424a2UL, 0x8c9f15e3UL, 0xa7b24620UL,
    0xbea97761UL, 0xf1e8e1a6UL, 0xe8f3d0e7UL, 0xc3de8324UL, 0xdac5b265UL,
    0x5d5daeaaUL, 0x44469febUL, 0x6f6bcc28UL, 0x7670fd69UL, 0x39316baeUL,
    0x202a5aefUL, 0x0b07092cUL, 0x121c386dUL, 0xdf4636f3UL, 0xc65d07b2UL,
    0xed705471UL, 0xf46b6530UL, 0xbb2af3f7UL, 0xa231c2b6UL, 0x891c9175UL,
    0x9007a034UL, 0x179fbcfbUL, 0x0e848dbaUL, 0x25a9de79UL, 0x3cb2ef38UL,
    0x73f379ffUL, 0x6ae848beUL, 0x41c51b7dUL, 0x58de2a3cUL, 0xf0794f05UL,
    0xe9627e44UL, 0xc24f2d87UL, 0xdb541cc6UL, 0x94158a01UL, 0x8d0ebb40UL,
    0xa623e883UL, 0xbf38d9c2UL, 0x38a0c50dUL, 0x21bbf44cUL, 0x0a96a78fUL,
    0x138d96ceUL, 0x5ccc0009UL, 0x45d73148UL, 0x6efa628bUL, 0x77e153caUL,
    0xbabb5d54UL, 0xa3a06c15UL, 0x888d3fd6UL, 0x91960e97UL, 0xded79850UL,
    0xc7cca911UL, 0xece1fad2UL, 0xf5facb93UL, 0x7262d75cUL, 0x6b79e61dUL,
    0x4054b5deUL, 0x594f849fUL, 0x160e1258UL, 0x0f152319UL, 0x243870daUL,
    0x3d23419bUL, 0x65fd6ba7UL, 0x7ce65ae6UL, 0x57cb0925UL, 0x4ed03864UL,
    0x0191aea3UL, 0x188a9fe2UL, 0x33a7cc21UL, 0x2abcfd60UL, 0xad24e1afUL,
    0xb43fd0eeUL, 0x9f12832dUL, 0x8609b26cUL, 0xc94824abUL, 0xd05315eaUL,
    0xfb7e4629UL, 0xe2657768UL, 0x2f3f79f6UL, 0x362448b7UL, 0x1d091b74UL,
    0x04122a35UL, 0x4b53bcf2UL, 0x52488db3UL, 0x7965de70UL, 0x607eef31UL,
    0xe7e6f3feUL, 0xfefdc2bfUL, 0xd5d0917cUL, 0xcccba03dUL, 0x838a36faUL,
    0x9a9107bbUL, 0xb1bc5478UL, 0xa8a76539UL, 0x3b83984bUL, 0x2298a90aUL,
    0x09b5fac9UL, 0x10aecb88UL, 0x5fef5d4fUL, 0x46f46c0eUL, 0x6dd93fcdUL,
    0x74c20e8cUL, 0xf35a1243UL, 0xea412302UL, 0xc16c70c1UL, 0xd8774180UL,
    0x9736d747UL, 0x8e2de606UL, 0xa500b5c5UL, 0xbc1b8484UL, 0x71418a1aUL,
    0x685abb5bUL, 0x4377e898UL, 0x5a6cd9d9UL, 0x152d4f1eUL, 0x0c367e5fUL,
    0x271b2d9cUL, 0x3e001cddUL, 0xb9980012UL, 0xa0833153UL, 0x8bae6290UL,
    0x92b553d1UL, 0xddf4c516UL, 0xc4eff457UL, 0xefc2a794UL, 0xf6d996d5UL,
    0xae07bce9UL, 0xb71c8da8UL, 0x9c31de6bUL, 0x852aef2aUL, 0xca6b79edUL,
    0xd37048acUL, 0xf85d1b6fUL, 0xe1462a2eUL, 0x66de36e1UL, 0x7fc507a0UL,
    0x54e85463UL, 0x4df36522UL, 0x02b2f3e5UL, 0x1ba9c2a4UL, 0x30849167UL,
    0x299fa026UL, 0xe4c5aeb8UL, 0xfdde9ff9UL, 0xd6f3cc3aUL, 0xcfe8fd7bUL,
    0x80a96bbcUL, 0x99b25afdUL, 0xb29f093eUL, 0xab84387fUL, 0x2c1c24b0UL,
    0x350715f1UL, 0x1e2a4632UL, 0x07317773UL, 0x4870e1b4UL, 0x516bd0f5UL,
    0x7a468336UL, 0x635db277UL, 0xcbfad74eUL, 0xd2e1e60fUL, 0xf9ccb5ccUL,
    0xe0d7848dUL, 0xaf96124aUL, 0xb68d230bUL, 0x9da070c8UL, 0x84bb4189UL,
    0x03235d46UL, 0x1a386c07UL, 0x31153fc4UL, 0x280e0e85UL, 0x674f9842UL,
    0x7e54a903UL, 0x5579fac0UL, 0x4c62cb81UL, 0x8138c51fUL, 0x9823f45eUL,
    0xb30ea79dUL, 0xaa1596dcUL, 0xe554001bUL, 0xfc4f315aUL, 0xd7626299UL,
    0xce7953d8UL, 0x49e14f17UL, 0x50fa7e56UL, 0x7bd72d95UL, 0x62cc1cd4UL,
    0x2d8d8a13UL, 0x3496bb52UL, 0x1fbbe891UL, 0x06a0d9d0UL, 0x5e7ef3ecUL,
    0x4765c2adUL, 0x6c48916eUL, 0x7553a02fUL, 0x3a1236e8UL, 0x230907a9UL,
    0x0824546aUL, 0x113f652bUL, 0x96a779e4UL, 0x8fbc48a5UL, 0xa4911b66UL,
    0xbd8a2a27UL, 0xf2cbbce0UL, 0xebd08da1UL, 0xc0fdde62UL, 0xd9e6ef23UL,
    0x14bce1bdUL, 0x0da7d0fcUL, 0x268a833fUL, 0x3f91b27eUL, 0x70d024b9UL,
    0x69cb15f8UL, 0x42e6463bUL, 0x5bfd777aUL, 0xdc656bb5UL, 0xc57e5af4UL,
    0xee530937UL, 0xf7483876UL, 0xb809aeb1UL, 0xa1129ff0UL, 0x8a3fcc33UL,
    0x9324fd72UL
  },
  {
    0x00000000UL, 0x01c26a37UL, 0x0384d46eUL, 0x0246be59UL, 0x0709a8dcUL,
    0x06cbc2ebUL, 0x048d7cb2UL, 0x054f1685UL, 0x0e1351b8UL, 0x0fd13b8fUL,
    0x0d9785d6UL, 0x0c55efe1UL, 0x091af964UL, 0x08d89353UL, 0x0a9e2d0aUL,
    0x0b5c473dUL, 0x1c26a370UL, 0x1de4c947UL, 0x1fa2771eUL, 0x1e601d29UL,
    0x1b2f0bacUL, 0x1aed619bUL, 0x18abdfc2UL, 0x1969b5f5UL, 0x1235f2c8UL,
    0x13f798ffUL, 0x11b126a6UL, 0x10734c91UL, 0x153c5a14UL, 0x14fe3023UL,
    0x16b88e7aUL, 0x177ae44dUL, 0x384d46e0UL, 0x398f2cd7UL, 0x3bc9928eUL,
    0x3a0bf8b9UL, 0x3f44ee3cUL, 0x3e86840bUL, 0x3cc03a52UL, 0x3d025065UL,
    0x365e1758UL, 0x379c7d6fUL, 0x35dac336UL, 0x3418a901UL, 0x3157bf84UL,
    0x3095d5b3UL, 0x32d36beaUL, 0x331101ddUL, 0x246be590UL, 0x25a98fa7UL,
    0x27ef31feUL, 0x262d5bc9UL, 0x23624d4cUL, 0x22a0277bUL, 0x20e69922UL,
    0x2124f315UL, 0x2a78b428UL, 0x2bbade1fUL, 0x29fc6046UL, 0x283e0a71UL,
    0x2d711cf4UL, 0x2cb376c3UL, 0x2ef5c89aUL, 0x2f37a2adUL, 0x709a8dc0UL,
    0x7158e7f7UL, 0x731e59aeUL, 0x72dc3399UL, 0x7793251cUL, 0x76514f2bUL,
    0x7417f172UL, 0x75d59b45UL, 0x7e89dc78UL, 0x7f4bb64fUL, 0x7d0d0816UL,
    0x7ccf6221UL, 0x798074a4UL, 0x78421e93UL, 0x7a04a0caUL, 0x7bc6cafdUL,
    0x6cbc2eb0UL, 0x6d7e4487UL, 0x6f38fadeUL, 0x6efa90e9UL, 0x6bb5866cUL,
    0x6a77ec5bUL, 0x68315202UL, 0x69f33835UL, 0x62af7f08UL, 0x636d153fUL,
    0x612bab66UL, 0x60e9c151UL, 0x65a6d7d4UL, 0x6464bde3UL, 0x662203baUL,
    0x67e0698dUL, 0x48d7cb20UL, 0x4915a117UL, 0x4b531f4eUL, 0x4a917579UL,
    0x4fde63fcUL, 0x4e1c09cbUL, 0x4c5ab792UL, 0x4d98dda5UL, 0x46c49a98UL,
    0x4706f0afUL, 0x45404ef6UL, 0x448224c1UL, 0x41cd3244UL, 0x400f5873UL,
    0x4249e62aUL, 0x438b8c1dUL, 0x54f16850UL, 0x55330267UL, 0x5775bc3eUL,
    0x56b7d609UL, 0x53f8c08cUL, 0x523aaabbUL, 0x507c14e2UL, 0x51be7ed5UL,
    0x5ae239e8UL, 0x5b2053dfUL, 0x5966ed86UL, 0x58a487b1UL, 0x5deb9134UL,
    0x5c29fb03UL, 0x5e6f455aUL, 0x5fad2f6dUL, 0xe1351b80UL, 0xe0f771b7UL,
    0xe2b1cfeeUL, 0xe373a5d9UL, 0xe63cb35cUL, 0xe7fed96bUL, 0xe5b86732UL,
    0xe47a0d05UL, 0xef264a38UL, 0xeee4200fUL, 0xeca29e56UL, 0xed60f461UL,
    0xe82fe2e4UL, 0xe9ed88d3UL, 0xebab368aUL, 0xea695cbdUL, 0xfd13b8f0UL,
    0xfcd1d2c7UL, 0xfe976c9eUL, 0xff5506a9UL, 0xfa1a102cUL, 0xfbd87a1bUL,
    0xf99ec442UL, 0xf85cae75UL, 0xf300e948UL, 0xf2c2837fUL, 0xf0843d26UL,
    0xf1465711UL, 0xf4094194UL, 0xf5cb2ba3UL, 0xf78d95faUL, 0xf64fffcdUL,
    0xd9785d60UL, 0xd8ba3757UL, 0xdafc890eUL, 0xdb3ee339UL, 0xde71f5bcUL,
    0xdfb39f8bUL, 0xddf521d2UL, 0xdc374be5UL, 0xd76b0cd8UL, 0xd6a966efUL,
    0xd4efd8b6UL, 0xd52db281UL, 0xd062a404UL, 0xd1a0ce33UL, 0xd3e6706aUL,
    0xd2241a5dUL, 0xc55efe10UL, 0xc49c9427UL, 0xc6da2a7eUL, 0xc7184049UL,
    0xc25756ccUL, 0xc3953cfbUL, 0xc1d382a2UL, 0xc011e895UL, 0xcb4dafa8UL,
    0xca8fc59fUL, 0xc8c97bc6UL, 0xc90b11f1UL, 0xcc440774UL, 0xcd866d43UL,
    0xcfc0d31aUL, 0xce02b92dUL, 0x91af9640UL, 0x906dfc77UL, 0x922b422eUL,
    0x93e92819UL, 0x96a63e9cUL, 0x976454abUL, 0x9522eaf2UL, 0x94e080c5UL,
    0x9fbcc7f8UL, 0x9e7eadcfUL, 0x9c381396UL, 0x9dfa79a1UL, 0x98b56f24UL,
    0x99770513UL, 0x9b31bb4aUL, 0x9af3d17dUL, 0x8d893530UL, 0x8c4b5f07UL,
    0x8e0de15eUL, 0x8fcf8b69UL, 0x8a809decUL, 0x8b42f7dbUL, 0x89044982UL,
    0x88c623b5UL, 0x839a6488UL, 0x82580ebfUL, 0x801eb0e6UL, 0x81dcdad1UL,
    0x8493cc54UL, 0x8551a663UL, 0x8717183aUL, 0x86d5720dUL, 0xa9e2d0a0UL,
    0xa820ba97UL, 0xaa6604ceUL, 0xaba46ef9UL, 0xaeeb787cUL, 0xaf29124bUL,
    0xad6fac12UL, 0xacadc625UL, 0xa7f18118UL, 0xa633eb2fUL, 0xa4755576UL,
    0xa5b73f41UL, 0xa0f829c4UL, 0xa13a43f3UL, 0xa37cfdaaUL, 0xa2be979dUL,
    0xb5c473d0UL, 0xb40619e7UL, 0xb640a7beUL, 0xb782cd89UL, 0xb2cddb0cUL,
    0xb30fb13bUL, 0xb1490f62UL, 0xb08b6555UL, 0xbbd72268UL, 0xba15485fUL,
    0xb853f606UL, 0xb9919c31UL, 0xbcde8ab4UL, 0xbd1ce083UL, 0xbf5a5edaUL,
    0xbe9834edUL
  },
  {
    0x00000000UL, 0xb8bc6765UL, 0xaa09c88bUL, 0x12b5afeeUL, 0x8f629757UL,
    0x37def032UL, 0x256b5fdcUL, 0x9dd738b9UL, 0xc5b428efUL, 0x7d084f8aUL,
    0x6fbde064UL, 0xd7018701UL, 0x4ad6bfb8UL, 0xf26ad8ddUL, 0xe0df7733UL,
    0x58631056UL, 0x5019579fUL, 0xe8a530faUL, 0xfa109f14UL, 0x42acf871UL,
    0xdf7bc0c8UL, 0x67c7a7adUL, 0x75720843UL, 0xcdce6f26UL, 0x95ad7f70UL,
    0x2d111815UL, 0x3fa4b7fbUL, 0x8718d09eUL, 0x1acfe827UL, 0xa2738f42UL,
    0xb0c620acUL, 0x087a47c9UL, 0xa032af3eUL, 0x188ec85bUL, 0x0a3b67b5UL,
    0xb28700d0UL, 0x2f503869UL, 0x97ec5f0cUL, 0x8559f0e2UL, 0x3de59787UL,
    0x658687d1UL, 0xdd3ae0b4UL, 0xcf8f4f5aUL, 0x7733283fUL, 0xeae41086UL,
    0x525877e3UL, 0x40edd80dUL, 0xf851bf68UL, 0xf02bf8a1UL, 0x48979fc4UL,
    0x5a22302aUL, 0xe29e574fUL, 0x7f496ff6UL, 0xc7f50893UL, 0xd540a77dUL,
    0x6dfcc018UL, 0x359fd04eUL, 0x8d23b72bUL, 0x9f9618c5UL, 0x272a7fa0UL,
    0xbafd4719UL, 0x0241207cUL, 0x10f48f92UL, 0xa848e8f7UL, 0x9b14583dUL,
    0x23a83f58UL, 0x311d90b6UL, 0x89a1f7d3UL, 0x1476cf6aUL, 0xaccaa80fUL,
    0xbe7f07e1UL, 0x06c36084UL, 0x5ea070d2UL, 0xe61c17b7UL, 0xf4a9b859UL,
    0x4c15df3cUL, 0xd1c2e785UL, 0x697e80e0UL, 0x7bcb2f0eUL, 0xc377486bUL,
    0xcb0d0fa2UL, 0x73b168c7UL, 0x6104c729UL, 0xd9b8a04cUL, 0x446f98f5UL,
    0xfcd3ff90UL, 0xee66507eUL, 0x56da371bUL, 0x0eb9274dUL, 0xb6054028UL,
    0xa4b0efc6UL, 0x1c0c88a3UL, 0x81dbb01aUL, 0x3967d77fUL, 0x2bd27891UL,
    0x936e1ff4UL, 0x3b26f703UL, 0x839a9066UL, 0x912f3f88UL, 0x299358edUL,
    0xb4446054UL, 0x0cf80731UL, 0x1e4da8dfUL, 0xa6f1cfbaUL, 0xfe92dfecUL,
    0x462eb889UL, 0x549b1767UL, 0xec277002UL, 0x71f048bbUL, 0xc94c2fdeUL,
    0xdbf98030UL, 0x6345e755UL, 0x6b3fa09cUL, 0xd383c7f9UL, 0xc1366817UL,
    0x798a0f72UL, 0xe45d37cbUL, 0x5ce150aeUL, 0x4e54ff40UL, 0xf6e89825UL,
    0xae8b8873UL, 0x1637ef16UL, 0x048240f8UL, 0xbc3e279dUL, 0x21e91f24UL,
    0x99557841UL, 0x8be0d7afUL, 0x335cb0caUL, 0xed59b63bUL, 0x55e5d15eUL,
    0x47507eb0UL, 0xffec19d5UL, 0x623b216cUL, 0xda874609UL, 0xc832e9e7UL,
    0x708e8e82UL, 0x28ed9ed4UL, 0x9051f9b1UL, 0x82e4565fUL, 0x3a58313aUL,
    0xa78f0983UL, 0x1f336ee6UL, 0x0d86c108UL, 0xb53aa66dUL, 0xbd40e1a4UL,
    0x05fc86c1UL, 0x1749292fUL, 0xaff54e4aUL, 0x322276f3UL, 0x8a9e1196UL,
    0x982bbe78UL, 0x2097d91dUL, 0x78f4c94bUL, 0xc048ae2eUL, 0xd2fd01c0UL,
    0x6a4166a5UL, 0xf7965e1cUL, 0x4f2a3979UL, 0x5d9f9697UL, 0xe523f1f2UL,
    0x4d6b1905UL, 0xf5d77e60UL, 0xe762d18eUL, 0x5fdeb6ebUL, 0xc2098e52UL,
    0x7ab5e937UL, 0x680046d9UL, 0xd0bc21bcUL, 0x88df31eaUL, 0x3063568fUL,
    0x22d6f961UL, 0x9a6a9e04UL, 0x07bda6bdUL, 0xbf01c1d8UL, 0xadb46e36UL,
    0x15080953UL, 0x1d724e9aUL, 0xa5ce29ffUL, 0xb77b8611UL, 0x0fc7e174UL,
    0x9210d9cdUL, 0x2aacbea8UL, 0x38191146UL, 0x80a57623UL, 0xd8c66675UL,
    0x607a0110UL, 0x72cfaefeUL, 0xca73c99bUL, 0x57a4f122UL, 0xef189647UL,
    0xfdad39a9UL, 0x45115eccUL, 0x764dee06UL, 0xcef18963UL, 0xdc44268dUL,
    0x64f841e8UL, 0xf92f7951UL, 0x41931e34UL, 0x5326b1daUL, 0xeb9ad6bfUL,
    0xb3f9c6e9UL, 0x0b45a18cUL, 0x19f00e62UL, 0xa14c6907UL, 0x3c9b51beUL,
    0x842736dbUL, 0x96929935UL, 0x2e2efe50UL, 0x2654b999UL, 0x9ee8defcUL,
    0x8c5d7112UL, 0x34e11677UL, 0xa9362eceUL, 0x118a49abUL, 0x033fe645UL,
    0xbb838120UL, 0xe3e09176UL, 0x5b5cf613UL, 0x49e959fdUL, 0xf1553e98UL,
    0x6c820621UL, 0xd43e6144UL, 0xc68bceaaUL, 0x7e37a9cfUL, 0xd67f4138UL,
    0x6ec3265dUL, 0x7c7689b3UL, 0xc4caeed6UL, 0x591dd66fUL, 0xe1a1b10aUL,
    0xf3141ee4UL, 0x4ba87981UL, 0x13cb69d7UL, 0xab770eb2UL, 0xb9c2a15cUL,
    0x017ec639UL, 0x9ca9fe80UL, 0x241599e5UL, 0x36a0360bUL, 0x8e1c516eUL,
    0x866616a7UL, 0x3eda71c2UL, 0x2c6fde2cUL, 0x94d3b949UL, 0x090481f0UL,
    0xb1b8e695UL, 0xa30d497bUL, 0x1bb12e1eUL, 0x43d23e48UL, 0xfb6e592dUL,
    0xe9dbf6c3UL, 0x516791a6UL, 0xccb0a91fUL, 0x740cce7aUL, 0x66b96194UL,
    0xde0506f1UL
  },
  {
    0x00000000UL, 0x96300777UL, 0x2c610eeeUL, 0xba510999UL, 0x19c46d07UL,
    0x8ff46a70UL, 0x35a563e9UL, 0xa395649eUL, 0x3288db0eUL, 0xa4b8dc79UL,
    0x1ee9d5e0UL, 0x88d9d297UL, 0x2b4cb609UL, 0xbd7cb17eUL, 0x072db8e7UL,
    0x911dbf90UL, 0x6410b71dUL, 0xf220b06aUL, 0x4871b9f3UL, 0xde41be84UL,
    0x7dd4da1aUL, 0xebe4dd6dUL, 0x51b5d4f4UL, 0xc785d383UL, 0x56986c13UL,
    0xc0a86b64UL, 0x7af962fdUL, 0xecc9658aUL, 0x4f5c0114UL, 0xd96c0663UL,
    0x633d0ffaUL, 0xf50d088dUL, 0xc8206e3bUL, 0x5e10694cUL, 0xe44160d5UL,
    0x727167a2UL, 0xd1e4033cUL, 0x47d4044bUL, 0xfd850dd2UL, 0x6bb50aa5UL,
    0xfaa8b535UL, 0x6c98b242UL, 0xd6c9bbdbUL, 0x40f9bcacUL, 0xe36cd832UL,
    0x755cdf45UL, 0xcf0dd6dcUL, 0x593dd1abUL, 0xac30d926UL, 0x3a00de51UL,
    0x8051d7c8UL, 0x1661d0bfUL, 0xb5f4b421UL, 0x23c4b356UL, 0x9995bacfUL,
    0x0fa5bdb8UL, 0x9eb80228UL, 0x0888055fUL, 0xb2d90cc6UL, 0x24e90bb1UL,
    0x877c6f2fUL, 0x114c6858UL, 0xab1d61c1UL, 0x3d2d66b6UL, 0x9041dc76UL,
    0x0671db01UL, 0xbc20d298UL, 0x2a10d5efUL, 0x8985b171UL, 0x1fb5b606UL,
    0xa5e4bf9fUL, 0x33d4b8e8UL, 0xa2c90778UL, 0x34f9000fUL, 0x8ea80996UL,
    0x18980ee1UL, 0xbb0d6a7fUL, 0x2d3d6d08UL, 0x976c6491UL, 0x015c63e6UL,
    0xf4516b6bUL, 0x62616c1cUL, 0xd8306585UL, 0x4e0062f2UL, 0xed95066cUL,
    0x7ba5011bUL, 0xc1f40882UL, 0x57c40ff5UL, 0xc6d9b065UL, 0x50e9b712UL,
    0xeab8be8bUL, 0x7c88b9fcUL, 0xdf1ddd62UL, 0x492dda15UL, 0xf37cd38cUL,
    0x654cd4fbUL, 0x5861b24dUL, 0xce51b53aUL, 0x7400bca3UL, 0xe230bbd4UL,
    0x41a5df4aUL, 0xd795d83dUL, 0x6dc4d1a4UL, 0xfbf4d6d3UL, 0x6ae96943UL,
    0xfcd96e34UL, 0x468867adUL, 0xd0b860daUL, 0x732d0444UL, 0xe51d0333UL,
    0x5f4c0aaaUL, 0xc97c0dddUL, 0x3c710550UL, 0xaa410227UL, 0x10100bbeUL,
    0x86200cc9UL, 0x25b56857UL, 0xb3856f20UL, 0x09d466b9UL, 0x9fe461ceUL,
    0x0ef9de5eUL, 0x98c9d929UL, 0x2298d0b0UL, 0xb4a8d7c7UL, 0x173db359UL,
    0x810db42eUL, 0x3b5cbdb7UL, 0xad6cbac0UL, 0x2083b8edUL, 0xb6b3bf9aUL,
    0x0ce2b603UL, 0x9ad2b174UL, 0x3947d5eaUL, 0xaf77d29dUL, 0x1526db04UL,
    0x8316dc73UL, 0x120b63e3UL, 0x843b6494UL, 0x3e6a6d0dUL, 0xa85a6a7aUL,
    0x0bcf0ee4UL, 0x9dff0993UL, 0x27ae000aUL, 0xb19e077dUL, 0x44930ff0UL,
    0xd2a30887UL, 0x68f2011eUL, 0xfec20669UL, 0x5d5762f7UL, 0xcb676580UL,
    0x71366c19UL, 0xe7066b6eUL, 0x761bd4feUL, 0xe02bd389UL, 0x5a7ada10UL,
    0xcc4add67UL, 0x6fdfb9f9UL, 0xf9efbe8eUL, 0x43beb717UL, 0xd58eb060UL,
    0xe8a3d6d6UL, 0x7e93d1a1UL, 0xc4c2d838UL, 0x52f2df4fUL, 0xf167bbd1UL,
    0x6757bca6UL, 0xdd06b53fUL, 0x4b36b248UL, 0xda2b0dd8UL, 0x4c1b0aafUL,
    0xf64a0336UL, 0x607a0441UL, 0xc3ef60dfUL, 0x55df67a8UL, 0xef8e6e31UL,
    0x79be6946UL, 0x8cb361cbUL, 0x1a8366bcUL, 0xa0d26f25UL, 0x36e26852UL,
    0x95770cccUL, 0x03470bbbUL, 0xb9160222UL, 0x2f260555UL, 0xbe3bbac5UL,
    0x280bbdb2UL, 0x925ab42bUL, 0x046ab35cUL, 0xa7ffd7c2UL, 0x31cfd0b5UL,
    0x8b9ed92cUL, 0x1daede5bUL, 0xb0c2649bUL, 0x26f263ecUL, 0x9ca36a75UL,
    0x0a936d02UL, 0xa906099cUL, 0x3f360eebUL, 0x85670772UL, 0x13570005UL,
    0x824abf95UL, 0x147ab8e2UL, 0xae2bb17bUL, 0x381bb60cUL, 0x9b8ed292UL,
    0x0dbed5e5UL, 0xb7efdc7cUL, 0x21dfdb0bUL, 0xd4d2d386UL, 0x42e2d4f1UL,
    0xf8b3dd68UL, 0x6e83da1fUL, 0xcd16be81UL, 0x5b26b9f6UL, 0xe177b06fUL,
    0x7747b718UL, 0xe65a0888UL, 0x706a0fffUL, 0xca3b0666UL, 0x5c0b0111UL,
    0xff9e658fUL, 0x69ae62f8UL, 0xd3ff6b61UL, 0x45cf6c16UL, 0x78e20aa0UL,
    0xeed20dd7UL, 0x5483044eUL, 0xc2b30339UL, 0x612667a7UL, 0xf71660d0UL,
    0x4d476949UL, 0xdb776e3eUL, 0x4a6ad1aeUL, 0xdc5ad6d9UL, 0x660bdf40UL,
    0xf03bd837UL, 0x53aebca9UL, 0xc59ebbdeUL, 0x7fcfb247UL, 0xe9ffb530UL,
    0x1cf2bdbdUL, 0x8ac2bacaUL, 0x3093b353UL, 0xa6a3b424UL, 0x0536d0baUL,
    0x9306d7cdUL, 0x2957de54UL, 0xbf67d923UL, 0x2e7a66b3UL, 0xb84a61c4UL,
    0x021b685dUL, 0x942b6f2aUL, 0x37be0bb4UL, 0xa18e0cc3UL, 0x1bdf055aUL,
    0x8def022dUL
  },
  {
    0x00000000UL, 0x41311b19UL, 0x82623632UL, 0xc3532d2bUL, 0x04c56c64UL,
    0x45f4777dUL, 0x86a75a56UL, 0xc796414fUL, 0x088ad9c8UL, 0x49bbc2d1UL,
    0x8ae8effaUL, 0xcbd9f4e3UL, 0x0c4fb5acUL, 0x4d7eaeb5UL, 0x8e2d839eUL,
    0xcf1c9887UL, 0x5112c24aUL, 0x1023d953UL, 0xd370f478UL, 0x9241ef61UL,
    0x55d7ae2eUL, 0x14e6b537UL, 0xd7b5981cUL, 0x96848305UL, 0x59981b82UL,
    0x18a9009bUL, 0xdbfa2db0UL, 0x9acb36a9UL, 0x5d5d77e6UL, 0x1c6c6cffUL,
    0xdf3f41d4UL, 0x9e0e5acdUL, 0xa2248495UL, 0xe3159f8cUL, 0x2046b2a7UL,
    0x6177a9beUL, 0xa6e1e8f1UL, 0xe7d0f3e8UL, 0x2483dec3UL, 0x65b2c5daUL,
    0xaaae5d5dUL, 0xeb9f4644UL, 0x28cc6b6fUL, 0x69fd7076UL, 0xae6b3139UL,
    0xef5a2a20UL, 0x2c09070bUL, 0x6d381c12UL, 0xf33646dfUL, 0xb2075dc6UL,
    0x715470edUL, 0x30656bf4UL, 0xf7f32abbUL, 0xb6c231a2UL, 0x75911c89UL,
    0x34a00790UL, 0xfbbc9f17UL, 0xba8d840eUL, 0x79dea925UL, 0x38efb23cUL,
    0xff79f373UL, 0xbe48e86aUL, 0x7d1bc541UL, 0x3c2ade58UL, 0x054f79f0UL,
    0x447e62e9UL, 0x872d4fc2UL, 0xc61c54dbUL, 0x018a1594UL, 0x40bb0e8dUL,
    0x83e823a6UL, 0xc2d938bfUL, 0x0dc5a038UL, 0x4cf4bb21UL, 0x8fa7960aUL,
    0xce968d13UL, 0x0900cc5cUL, 0x4831d745UL, 0x8b62fa6eUL, 0xca53e177UL,
    0x545dbbbaUL, 0x156ca0a3UL, 0xd63f8d88UL, 0x970e9691UL, 0x5098d7deUL,
    0x11a9ccc7UL, 0xd2fae1ecUL, 0x93cbfaf5UL, 0x5cd76272UL, 0x1de6796bUL,
    0xdeb55440UL, 0x9f844f59UL, 0x58120e16UL, 0x1923150fUL, 0xda703824UL,
    0x9b41233dUL, 0xa76bfd65UL, 0xe65ae67cUL, 0x2509cb57UL, 0x6438d04eUL,
    0xa3ae9101UL, 0xe29f8a18UL, 0x21cca733UL, 0x60fdbc2aUL, 0xafe124adUL,
    0xeed03fb4UL, 0x2d83129fUL, 0x6cb20986UL, 0xab2448c9UL, 0xea1553d0UL,
    0x29467efbUL, 0x687765e2UL, 0xf6793f2fUL, 0xb7482436UL, 0x741b091dUL,
    0x352a1204UL, 0xf2bc534bUL, 0xb38d4852UL, 0x70de6579UL, 0x31ef7e60UL,
    0xfef3e6e7UL, 0xbfc2fdfeUL, 0x7c91d0d5UL, 0x3da0cbccUL, 0xfa368a83UL,
    0xbb07919aUL, 0x7854bcb1UL, 0x3965a7a8UL, 0x4b98833bUL, 0x0aa99822UL,
    0xc9fab509UL, 0x88cbae10UL, 0x4f5def5fUL, 0x0e6cf446UL, 0xcd3fd96dUL,
    0x8c0ec274UL, 0x43125af3UL, 0x022341eaUL, 0xc1706cc1UL, 0x804177d8UL,
    0x47d73697UL, 0x06e62d8eUL, 0xc5b500a5UL, 0x84841bbcUL, 0x1a8a4171UL,
    0x5bbb5a68UL, 0x98e87743UL, 0xd9d96c5aUL, 0x1e4f2d15UL, 0x5f7e360cUL,
    0x9c2d1b27UL, 0xdd1c003eUL, 0x120098b9UL, 0x533183a0UL, 0x9062ae8bUL,
    0xd153b592UL, 0x16c5f4ddUL, 0x57f4efc4UL, 0x94a7c2efUL, 0xd596d9f6UL,
    0xe9bc07aeUL, 0xa88d1cb7UL, 0x6bde319cUL, 0x2aef2a85UL, 0xed796bcaUL,
    0xac4870d3UL, 0x6f1b5df8UL, 0x2e2a46e1UL, 0xe136de66UL, 0xa007c57fUL,
    0x6354e854UL, 0x2265f34dUL, 0xe5f3b202UL, 0xa4c2a91bUL, 0x67918430UL,
    0x26a09f29UL, 0xb8aec5e4UL, 0xf99fdefdUL, 0x3accf3d6UL, 0x7bfde8cfUL,
    0xbc6ba980UL, 0xfd5ab299UL, 0x3e099fb2UL, 0x7f3884abUL, 0xb0241c2cUL,
    0xf1150735UL, 0x32462a1eUL, 0x73773107UL, 0xb4e17048UL, 0xf5d06b51UL,
    0x3683467aUL, 0x77b25d63UL, 0x4ed7facbUL, 0x0fe6e1d2UL, 0xccb5ccf9UL,
    0x8d84d7e0UL, 0x4a1296afUL, 0x0b238db6UL, 0xc870a09dUL, 0x8941bb84UL,
    0x465d2303UL, 0x076c381aUL, 0xc43f1531UL, 0x850e0e28UL, 0x42984f67UL,
    0x03a9547eUL, 0xc0fa7955UL, 0x81cb624cUL, 0x1fc53881UL, 0x5ef42398UL,
    0x9da70eb3UL, 0xdc9615aaUL, 0x1b0054e5UL, 0x5a314ffcUL, 0x996262d7UL,
    0xd85379ceUL, 0x174fe149UL, 0x567efa50UL, 0x952dd77bUL, 0xd41ccc62UL,
    0x138a8d2dUL, 0x52bb9634UL, 0x91e8bb1fUL, 0xd0d9a006UL, 0xecf37e5eUL,
    0xadc26547UL, 0x6e91486cUL, 0x2fa05375UL, 0xe836123aUL, 0xa9070923UL,
    0x6a542408UL, 0x2b653f11UL, 0xe479a796UL, 0xa548bc8fUL, 0x661b91a4UL,
    0x272a8abdUL, 0xe0bccbf2UL, 0xa18dd0ebUL, 0x62defdc0UL, 0x23efe6d9UL,
    0xbde1bc14UL, 0xfcd0a70dUL, 0x3f838a26UL, 0x7eb2913fUL, 0xb924d070UL,
    0xf815cb69UL, 0x3b46e642UL, 0x7a77fd5bUL, 0xb56b65dcUL, 0xf45a7ec5UL,
    0x370953eeUL, 0x763848f7UL, 0xb1ae09b8UL, 0xf09f12a1UL, 0x33cc3f8aUL,
    0x72fd2493UL
  },
  {
    0x00000000UL, 0x376ac201UL, 0x6ed48403UL, 0x59be4602UL, 0xdca80907UL,
    0xebc2cb06UL, 0xb27c8d04UL, 0x85164f05UL, 0xb851130eUL, 0x8f3bd10fUL,
    0xd685970dUL, 0xe1ef550cUL, 0x64f91a09UL, 0x5393d808UL, 0x0a2d9e0aUL,
    0x3d475c0bUL, 0x70a3261cUL, 0x47c9e41dUL, 0x1e77a21fUL, 0x291d601eUL,
    0xac0b2f1bUL, 0x9b61ed1aUL, 0xc2dfab18UL, 0xf5b56919UL, 0xc8f23512UL,
    0xff98f713UL, 0xa626b111UL, 0x914c7310UL, 0x145a3c15UL, 0x2330fe14UL,
    0x7a8eb816UL, 0x4de47a17UL, 0xe0464d38UL, 0xd72c8f39UL, 0x8e92c93bUL,
    0xb9f80b3aUL, 0x3cee443fUL, 0x0b84863eUL, 0x523ac03cUL, 0x6550023dUL,
    0x58175e36UL, 0x6f7d9c37UL, 0x36c3da35UL, 0x01a91834UL, 0x84bf5731UL,
    0xb3d59530UL, 0xea6bd332UL, 0xdd011133UL, 0x90e56b24UL, 0xa78fa925UL,
    0xfe31ef27UL, 0xc95b2d26UL, 0x4c4d6223UL, 0x7b27a022UL, 0x2299e620UL,
    0x15f32421UL, 0x28b4782aUL, 0x1fdeba2bUL, 0x4660fc29UL, 0x710a3e28UL,
    0xf41c712dUL, 0xc376b32cUL, 0x9ac8f52eUL, 0xada2372fUL, 0xc08d9a70UL,
    0xf7e75871UL, 0xae591e73UL, 0x9933dc72UL, 0x1c259377UL, 0x2b4f5176UL,
    0x72f11774UL, 0x459bd575UL, 0x78dc897eUL, 0x4fb64b7fUL, 0x16080d7dUL,
    0x2162cf7cUL, 0xa4748079UL, 0x931e4278UL, 0xcaa0047aUL, 0xfdcac67bUL,
    0xb02ebc6cUL, 0x87447e6dUL, 0xdefa386fUL, 0xe990fa6eUL, 0x6c86b56bUL,
    0x5bec776aUL, 0x02523168UL, 0x3538f369UL, 0x087faf62UL, 0x3f156d63UL,
    0x66ab2b61UL, 0x51c1e960UL, 0xd4d7a665UL, 0xe3bd6464UL, 0xba032266UL,
    0x8d69e067UL, 0x20cbd748UL, 0x17a11549UL, 0x4e1f534bUL, 0x7975914aUL,
    0xfc63de4fUL, 0xcb091c4eUL, 0x92b75a4cUL, 0xa5dd984dUL, 0x989ac446UL,
    0xaff00647UL, 0xf64e4045UL, 0xc1248244UL, 0x4432cd41UL, 0x73580f40UL,
    0x2ae64942UL, 0x1d8c8b43UL, 0x5068f154UL, 0x67023355UL, 0x3ebc7557UL,
    0x09d6b756UL, 0x8cc0f853UL, 0xbbaa3a52UL, 0xe2147c50UL, 0xd57ebe51UL,
    0xe839e25aUL, 0xdf53205bUL, 0x86ed6659UL, 0xb187a458UL, 0x3491eb5dUL,
    0x03fb295cUL, 0x5a456f5eUL, 0x6d2fad5fUL, 0x801b35e1UL, 0xb771f7e0UL,
    0xeecfb1e2UL, 0xd9a573e3UL, 0x5cb33ce6UL, 0x6bd9fee7UL, 0x3267b8e5UL,
    0x050d7ae4UL, 0x384a26efUL, 0x0f20e4eeUL, 0x569ea2ecUL, 0x61f460edUL,
    0xe4e22fe8UL, 0xd388ede9UL, 0x8a36abebUL, 0xbd5c69eaUL, 0xf0b813fdUL,
    0xc7d2d1fcUL, 0x9e6c97feUL, 0xa90655ffUL, 0x2c101afaUL, 0x1b7ad8fbUL,
    0x42c49ef9UL, 0x75ae5cf8UL, 0x48e900f3UL, 0x7f83c2f2UL, 0x263d84f0UL,
    0x115746f1UL, 0x944109f4UL, 0xa32bcbf5UL, 0xfa958df7UL, 0xcdff4ff6UL,
    0x605d78d9UL, 0x5737bad8UL, 0x0e89fcdaUL, 0x39e33edbUL, 0xbcf571deUL,
    0x8b9fb3dfUL, 0xd221f5ddUL, 0xe54b37dcUL, 0xd80c6bd7UL, 0xef66a9d6UL,
    0xb6d8efd4UL, 0x81b22dd5UL, 0x04a462d0UL, 0x33cea0d1UL, 0x6a70e6d3UL,
    0x5d1a24d2UL, 0x10fe5ec5UL, 0x27949cc4UL, 0x7e2adac6UL, 0x494018c7UL,
    0xcc5657c2UL, 0xfb3c95c3UL, 0xa282d3c1UL, 0x95e811c0UL, 0xa8af4dcbUL,
    0x9fc58fcaUL, 0xc67bc9c8UL, 0xf1110bc9UL, 0x740744ccUL, 0x436d86cdUL,
    0x1ad3c0cfUL, 0x2db902ceUL, 0x4096af91UL, 0x77fc6d90UL, 0x2e422b92UL,
    0x1928e993UL, 0x9c3ea696UL, 0xab546497UL, 0xf2ea2295UL, 0xc580e094UL,
    0xf8c7bc9fUL, 0xcfad7e9eUL, 0x9613389cUL, 0xa179fa9dUL, 0x246fb598UL,
    0x13057799UL, 0x4abb319bUL, 0x7dd1f39aUL, 0x3035898dUL, 0x075f4b8cUL,
    0x5ee10d8eUL, 0x698bcf8fUL, 0xec9d808aUL, 0xdbf7428bUL, 0x82490489UL,
    0xb523c688UL, 0x88649a83UL, 0xbf0e5882UL, 0xe6b01e80UL, 0xd1dadc81UL,
    0x54cc9384UL, 0x63a65185UL, 0x3a181787UL, 0x0d72d586UL, 0xa0d0e2a9UL,
    0x97ba20a8UL, 0xce0466aaUL, 0xf96ea4abUL, 0x7c78ebaeUL, 0x4b1229afUL,
    0x12ac6fadUL, 0x25c6adacUL, 0x1881f1a7UL, 0x2feb33a6UL, 0x765575a4UL,
    0x413fb7a5UL, 0xc429f8a0UL, 0xf3433aa1UL, 0xaafd7ca3UL, 0x9d97bea2UL,
    0xd073c4b5UL, 0xe71906b4UL, 0xbea740b6UL, 0x89cd82b7UL, 0x0cdbcdb2UL,
    0x3bb10fb3UL, 0x620f49b1UL, 0x55658bb0UL, 0x6822d7bbUL, 0x5f4815baUL,
    0x06f653b8UL, 0x319c91b9UL, 0xb48adebcUL, 0x83e01cbdUL, 0xda5e5abfUL,
    0xed3498beUL
  },
  {
    0x00000000UL, 0x6567bcb8UL, 0x8bc809aaUL, 0xeeafb512UL, 0x5797628fUL,
    0x32f0de37UL, 0xdc5f6b25UL, 0xb938d79dUL, 0xef28b4c5UL, 0x8a4f087dUL,
    0x64e0bd6fUL, 0x018701d7UL, 0xb8bfd64aUL, 0xddd86af2UL, 0x3377dfe0UL,
    0x56106358UL, 0x9f571950UL, 0xfa30a5e8UL, 0x149f10faUL, 0x71f8ac42UL,
    0xc8c07bdfUL, 0xada7c767UL, 0x43087275UL, 0x266fcecdUL, 0x707fad95UL,
    0x1518112dUL, 0xfbb7a43fUL, 0x9ed01887UL, 0x27e8cf1aUL, 0x428f73a2UL,
    0xac20c6b0UL, 0xc9477a08UL, 0x3eaf32a0UL, 0x5bc88e18UL, 0xb5673b0aUL,
    0xd00087b2UL, 0x6938502fUL, 0x0c5fec97UL, 0xe2f05985UL, 0x8797e53dUL,
    0xd1878665UL, 0xb4e03addUL, 0x5a4f8fcfUL, 0x3f283377UL, 0x8610e4eaUL,
    0xe3775852UL, 0x0dd8ed40UL, 0x68bf51f8UL, 0xa1f82bf0UL, 0xc49f9748UL,
    0x2a30225aUL, 0x4f579ee2UL, 0xf66f497fUL, 0x9308f5c7UL, 0x7da740d5UL,
    0x18c0fc6dUL, 0x4ed09f35UL, 0x2bb7238dUL, 0xc518969fUL, 0xa07f2a27UL,
    0x1947fdbaUL, 0x7c204102UL, 0x928ff410UL, 0xf7e848a8UL, 0x3d58149bUL,
    0x583fa823UL, 0xb6901d31UL, 0xd3f7a189UL, 0x6acf7614UL, 0x0fa8caacUL,
    0xe1077fbeUL, 0x8460c306UL, 0xd270a05eUL, 0xb7171ce6UL, 0x59b8a9f4UL,
    0x3cdf154cUL, 0x85e7c2d1UL, 0xe0807e69UL, 0x0e2fcb7bUL, 0x6b4877c3UL,
    0xa20f0dcbUL, 0xc768b173UL, 0x29c70461UL, 0x4ca0b8d9UL, 0xf5986f44UL,
    0x90ffd3fcUL, 0x7e5066eeUL, 0x1b37da56UL, 0x4d27b90eUL, 0x284005b6UL,
    0xc6efb0a4UL, 0xa3880c1cUL, 0x1ab0db81UL, 0x7fd76739UL, 0x9178d22bUL,
    0xf41f6e93UL, 0x03f7263bUL, 0x66909a83UL, 0x883f2f91UL, 0xed589329UL,
    0x546044b4UL, 0x3107f80cUL, 0xdfa84d1eUL, 0xbacff1a6UL, 0xecdf92feUL,
    0x89b82e46UL, 0x67179b54UL, 0x027027ecUL, 0xbb48f071UL, 0xde2f4cc9UL,
    0x3080f9dbUL, 0x55e74563UL, 0x9ca03f6bUL, 0xf9c783d3UL, 0x176836c1UL,
    0x720f8a79UL, 0xcb375de4UL, 0xae50e15cUL, 0x40ff544eUL, 0x2598e8f6UL,
    0x73888baeUL, 0x16ef3716UL, 0xf8408204UL, 0x9d273ebcUL, 0x241fe921UL,
    0x41785599UL, 0xafd7e08bUL, 0xcab05c33UL, 0x3bb659edUL, 0x5ed1e555UL,
    0xb07e5047UL, 0xd519ecffUL, 0x6c213b62UL, 0x094687daUL, 0xe7e932c8UL,
    0x828e8e70UL, 0xd49eed28UL, 0xb1f95190UL, 0x5f56e482UL, 0x3a31583aUL,
    0x83098fa7UL, 0xe66e331fUL, 0x08c1860dUL, 0x6da63ab5UL, 0xa4e140bdUL,
    0xc186fc05UL, 0x2f294917UL, 0x4a4ef5afUL, 0xf3762232UL, 0x96119e8aUL,
    0x78be2b98UL, 0x1dd99720UL, 0x4bc9f478UL, 0x2eae48c0UL, 0xc001fdd2UL,
    0xa566416aUL, 0x1c5e96f7UL, 0x79392a4fUL, 0x97969f5dUL, 0xf2f123e5UL,
    0x05196b4dUL, 0x607ed7f5UL, 0x8ed162e7UL, 0xebb6de5fUL, 0x528e09c2UL,
    0x37e9b57aUL, 0xd9460068UL, 0xbc21bcd0UL, 0xea31df88UL, 0x8f566330UL,
    0x61f9d622UL, 0x049e6a9aUL, 0xbda6bd07UL, 0xd8c101bfUL, 0x366eb4adUL,
    0x53090815UL, 0x9a4e721dUL, 0xff29cea5UL, 0x11867bb7UL, 0x74e1c70fUL,
    0xcdd91092UL, 0xa8beac2aUL, 0x46111938UL, 0x2376a580UL, 0x7566c6d8UL,
    0x10017a60UL, 0xfeaecf72UL, 0x9bc973caUL, 0x22f1a457UL, 0x479618efUL,
    0xa939adfdUL, 0xcc5e1145UL, 0x06ee4d76UL, 0x6389f1ceUL, 0x8d2644dcUL,
    0xe841f864UL, 0x51792ff9UL, 0x341e9341UL, 0xdab12653UL, 0xbfd69aebUL,
    0xe9c6f9b3UL, 0x8ca1450bUL, 0x620ef019UL, 0x07694ca1UL, 0xbe519b3cUL,
    0xdb362784UL, 0x35999296UL, 0x50fe2e2eUL, 0x99b95426UL, 0xfcdee89eUL,
    0x12715d8cUL, 0x7716e134UL, 0xce2e36a9UL, 0xab498a11UL, 0x45e63f03UL,
    0x208183bbUL, 0x7691e0e3UL, 0x13f65c5bUL, 0xfd59e949UL, 0x983e55f1UL,
    0x2106826cUL, 0x44613ed4UL, 0xaace8bc6UL, 0xcfa9377eUL, 0x38417fd6UL,
    0x5d26c36eUL, 0xb389767cUL, 0xd6eecac4UL, 0x6fd61d59UL, 0x0ab1a1e1UL,
    0xe41e14f3UL, 0x8179a84bUL, 0xd769cb13UL, 0xb20e77abUL, 0x5ca1c2b9UL,
    0x39c67e01UL, 0x80fea99cUL, 0xe5991524UL, 0x0b36a036UL, 0x6e511c8eUL,
    0xa7166686UL, 0xc271da3eUL, 0x2cde6f2cUL, 0x49b9d394UL, 0xf0810409UL,
    0x95e6b8b1UL, 0x7b490da3UL, 0x1e2eb11bUL, 0x483ed243UL, 0x2d596efbUL,
    0xc3f6dbe9UL, 0xa6916751UL, 0x1fa9b0ccUL, 0x7ace0c74UL, 0x9461b966UL,
    0xf10605deUL
#endif
  }
};
cfitsio-3.47/zlib/deflate.c0000644000225700000360000020460713464573432015131 0ustar  cagordonlhea/* deflate.c -- compress data using the deflation algorithm
 * Copyright (C) 1995-2010 Jean-loup Gailly and Mark Adler
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

/*
 *  ALGORITHM
 *
 *      The "deflation" process depends on being able to identify portions
 *      of the input text which are identical to earlier input (within a
 *      sliding window trailing behind the input currently being processed).
 *
 *      The most straightforward technique turns out to be the fastest for
 *      most input files: try all possible matches and select the longest.
 *      The key feature of this algorithm is that insertions into the string
 *      dictionary are very simple and thus fast, and deletions are avoided
 *      completely. Insertions are performed at each input character, whereas
 *      string matches are performed only when the previous match ends. So it
 *      is preferable to spend more time in matches to allow very fast string
 *      insertions and avoid deletions. The matching algorithm for small
 *      strings is inspired from that of Rabin & Karp. A brute force approach
 *      is used to find longer strings when a small match has been found.
 *      A similar algorithm is used in comic (by Jan-Mark Wams) and freeze
 *      (by Leonid Broukhis).
 *         A previous version of this file used a more sophisticated algorithm
 *      (by Fiala and Greene) which is guaranteed to run in linear amortized
 *      time, but has a larger average cost, uses more memory and is patented.
 *      However the F&G algorithm may be faster for some highly redundant
 *      files if the parameter max_chain_length (described below) is too large.
 *
 *  ACKNOWLEDGEMENTS
 *
 *      The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
 *      I found it in 'freeze' written by Leonid Broukhis.
 *      Thanks to many people for bug reports and testing.
 *
 *  REFERENCES
 *
 *      Deutsch, L.P.,"DEFLATE Compressed Data Format Specification".
 *      Available in http://www.ietf.org/rfc/rfc1951.txt
 *
 *      A description of the Rabin and Karp algorithm is given in the book
 *         "Algorithms" by R. Sedgewick, Addison-Wesley, p252.
 *
 *      Fiala,E.R., and Greene,D.H.
 *         Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595
 *
 */

#include "deflate.h"

const char deflate_copyright[] =
   " deflate 1.2.5 Copyright 1995-2010 Jean-loup Gailly and Mark Adler ";
/*
  If you use the zlib library in a product, an acknowledgment is welcome
  in the documentation of your product. If for some reason you cannot
  include such an acknowledgment, I would appreciate that you keep this
  copyright string in the executable of your product.
 */

/* ===========================================================================
 *  Function prototypes.
 */
typedef enum {
    need_more,      /* block not completed, need more input or more output */
    block_done,     /* block flush performed */
    finish_started, /* finish started, need only more output at next deflate */
    finish_done     /* finish done, accept no more input or output */
} block_state;

typedef block_state (*compress_func) OF((deflate_state *s, int flush));
/* Compression function. Returns the block state after the call. */

local void fill_window    OF((deflate_state *s));
local block_state deflate_stored OF((deflate_state *s, int flush));
local block_state deflate_fast   OF((deflate_state *s, int flush));
#ifndef FASTEST
local block_state deflate_slow   OF((deflate_state *s, int flush));
#endif
local block_state deflate_rle    OF((deflate_state *s, int flush));
local block_state deflate_huff   OF((deflate_state *s, int flush));
local void lm_init        OF((deflate_state *s));
local void putShortMSB    OF((deflate_state *s, uInt b));
local void flush_pending  OF((z_streamp strm));
local int read_buf        OF((z_streamp strm, Bytef *buf, unsigned size));
#ifdef ASMV
      void match_init OF((void)); /* asm code initialization */
      uInt longest_match  OF((deflate_state *s, IPos cur_match));
#else
local uInt longest_match  OF((deflate_state *s, IPos cur_match));
#endif

#ifdef DEBUG
local  void check_match OF((deflate_state *s, IPos start, IPos match,
                            int length));
#endif

/* ===========================================================================
 * Local data
 */

#define NIL 0
/* Tail of hash chains */

#ifndef TOO_FAR
#  define TOO_FAR 4096
#endif
/* Matches of length 3 are discarded if their distance exceeds TOO_FAR */

/* Values for max_lazy_match, good_match and max_chain_length, depending on
 * the desired pack level (0..9). The values given below have been tuned to
 * exclude worst case performance for pathological files. Better values may be
 * found for specific files.
 */
typedef struct config_s {
   ush good_length; /* reduce lazy search above this match length */
   ush max_lazy;    /* do not perform lazy search above this match length */
   ush nice_length; /* quit search above this match length */
   ush max_chain;
   compress_func func;
} config;

#ifdef FASTEST
local const config configuration_table[2] = {
/*      good lazy nice chain */
/* 0 */ {0,    0,  0,    0, deflate_stored},  /* store only */
/* 1 */ {4,    4,  8,    4, deflate_fast}}; /* max speed, no lazy matches */
#else
local const config configuration_table[10] = {
/*      good lazy nice chain */
/* 0 */ {0,    0,  0,    0, deflate_stored},  /* store only */
/* 1 */ {4,    4,  8,    4, deflate_fast}, /* max speed, no lazy matches */
/* 2 */ {4,    5, 16,    8, deflate_fast},
/* 3 */ {4,    6, 32,   32, deflate_fast},

/* 4 */ {4,    4, 16,   16, deflate_slow},  /* lazy matches */
/* 5 */ {8,   16, 32,   32, deflate_slow},
/* 6 */ {8,   16, 128, 128, deflate_slow},
/* 7 */ {8,   32, 128, 256, deflate_slow},
/* 8 */ {32, 128, 258, 1024, deflate_slow},
/* 9 */ {32, 258, 258, 4096, deflate_slow}}; /* max compression */
#endif

/* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
 * For deflate_fast() (levels <= 3) good is ignored and lazy has a different
 * meaning.
 */

#define EQUAL 0
/* result of memcmp for equal strings */

#ifndef NO_DUMMY_DECL
struct static_tree_desc_s {int dummy;}; /* for buggy compilers */
#endif

/* ===========================================================================
 * Update a hash value with the given input byte
 * IN  assertion: all calls to to UPDATE_HASH are made with consecutive
 *    input characters, so that a running hash key can be computed from the
 *    previous key instead of complete recalculation each time.
 */
#define UPDATE_HASH(s,h,c) (h = (((h)<hash_shift) ^ (c)) & s->hash_mask)


/* ===========================================================================
 * Insert string str in the dictionary and set match_head to the previous head
 * of the hash chain (the most recent string with same hash key). Return
 * the previous length of the hash chain.
 * If this file is compiled with -DFASTEST, the compression level is forced
 * to 1, and no hash chains are maintained.
 * IN  assertion: all calls to to INSERT_STRING are made with consecutive
 *    input characters and the first MIN_MATCH bytes of str are valid
 *    (except for the last MIN_MATCH-1 bytes of the input file).
 */
#ifdef FASTEST
#define INSERT_STRING(s, str, match_head) \
   (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
    match_head = s->head[s->ins_h], \
    s->head[s->ins_h] = (Pos)(str))
#else
#define INSERT_STRING(s, str, match_head) \
   (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
    match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \
    s->head[s->ins_h] = (Pos)(str))
#endif

/* ===========================================================================
 * Initialize the hash table (avoiding 64K overflow for 16 bit systems).
 * prev[] will be initialized on the fly.
 */
#define CLEAR_HASH(s) \
    s->head[s->hash_size-1] = NIL; \
    zmemzero((Bytef *)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head));

/* ========================================================================= */
int ZEXPORT deflateInit_(strm, level, version, stream_size)
    z_streamp strm;
    int level;
    const char *version;
    int stream_size;
{
    return deflateInit2_(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL,
                         Z_DEFAULT_STRATEGY, version, stream_size);
    /* To do: ignore strm->next_in if we use it as window */
}

/* ========================================================================= */
int ZEXPORT deflateInit2_(strm, level, method, windowBits, memLevel, strategy,
                  version, stream_size)
    z_streamp strm;
    int  level;
    int  method;
    int  windowBits;
    int  memLevel;
    int  strategy;
    const char *version;
    int stream_size;
{
    deflate_state *s;
    int wrap = 1;
    static const char my_version[] = ZLIB_VERSION;

    ushf *overlay;
    /* We overlay pending_buf and d_buf+l_buf. This works since the average
     * output size for (length,distance) codes is <= 24 bits.
     */

    if (version == Z_NULL || version[0] != my_version[0] ||
        stream_size != sizeof(z_stream)) {
        return Z_VERSION_ERROR;
    }
    if (strm == Z_NULL) return Z_STREAM_ERROR;

    strm->msg = Z_NULL;
    if (strm->zalloc == (alloc_func)0) {
        strm->zalloc = zcalloc;
        strm->opaque = (voidpf)0;
    }
    if (strm->zfree == (free_func)0) strm->zfree = zcfree;

#ifdef FASTEST
    if (level != 0) level = 1;
#else
    if (level == Z_DEFAULT_COMPRESSION) level = 6;
#endif

    if (windowBits < 0) { /* suppress zlib wrapper */
        wrap = 0;
        windowBits = -windowBits;
    }
#ifdef GZIP
    else if (windowBits > 15) {
        wrap = 2;       /* write gzip wrapper instead */
        windowBits -= 16;
    }
#endif
    if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED ||
        windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||
        strategy < 0 || strategy > Z_FIXED) {
        return Z_STREAM_ERROR;
    }
    if (windowBits == 8) windowBits = 9;  /* until 256-byte window bug fixed */
    s = (deflate_state *) ZALLOC(strm, 1, sizeof(deflate_state));
    if (s == Z_NULL) return Z_MEM_ERROR;
    strm->state = (struct internal_state FAR *)s;
    s->strm = strm;

    s->wrap = wrap;
    s->gzhead = Z_NULL;
    s->w_bits = windowBits;
    s->w_size = 1 << s->w_bits;
    s->w_mask = s->w_size - 1;

    s->hash_bits = memLevel + 7;
    s->hash_size = 1 << s->hash_bits;
    s->hash_mask = s->hash_size - 1;
    s->hash_shift =  ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);

    s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte));
    s->prev   = (Posf *)  ZALLOC(strm, s->w_size, sizeof(Pos));
    s->head   = (Posf *)  ZALLOC(strm, s->hash_size, sizeof(Pos));

    s->high_water = 0;      /* nothing written to s->window yet */

    s->lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */

    overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
    s->pending_buf = (uchf *) overlay;
    s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);

    if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
        s->pending_buf == Z_NULL) {
        s->status = FINISH_STATE;
        strm->msg = (char*)ERR_MSG(Z_MEM_ERROR);
        deflateEnd (strm);
        return Z_MEM_ERROR;
    }
    s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
    s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;

    s->level = level;
    s->strategy = strategy;
    s->method = (Byte)method;

    return deflateReset(strm);
}

/* ========================================================================= */
int ZEXPORT deflateSetDictionary (strm, dictionary, dictLength)
    z_streamp strm;
    const Bytef *dictionary;
    uInt  dictLength;
{
    deflate_state *s;
    uInt length = dictLength;
    uInt n;
    IPos hash_head = 0;

    if (strm == Z_NULL || strm->state == Z_NULL || dictionary == Z_NULL ||
        strm->state->wrap == 2 ||
        (strm->state->wrap == 1 && strm->state->status != INIT_STATE))
        return Z_STREAM_ERROR;

    s = strm->state;
    if (s->wrap)
        strm->adler = adler32(strm->adler, dictionary, dictLength);

    if (length < MIN_MATCH) return Z_OK;
    if (length > s->w_size) {
        length = s->w_size;
        dictionary += dictLength - length; /* use the tail of the dictionary */
    }
    zmemcpy(s->window, dictionary, length);
    s->strstart = length;
    s->block_start = (long)length;

    /* Insert all strings in the hash table (except for the last two bytes).
     * s->lookahead stays null, so s->ins_h will be recomputed at the next
     * call of fill_window.
     */
    s->ins_h = s->window[0];
    UPDATE_HASH(s, s->ins_h, s->window[1]);
    for (n = 0; n <= length - MIN_MATCH; n++) {
        INSERT_STRING(s, n, hash_head);
    }
    if (hash_head) hash_head = 0;  /* to make compiler happy */
    return Z_OK;
}

/* ========================================================================= */
int ZEXPORT deflateReset (strm)
    z_streamp strm;
{
    deflate_state *s;

    if (strm == Z_NULL || strm->state == Z_NULL ||
        strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0) {
        return Z_STREAM_ERROR;
    }

    strm->total_in = strm->total_out = 0;
    strm->msg = Z_NULL; /* use zfree if we ever allocate msg dynamically */
    strm->data_type = Z_UNKNOWN;

    s = (deflate_state *)strm->state;
    s->pending = 0;
    s->pending_out = s->pending_buf;

    if (s->wrap < 0) {
        s->wrap = -s->wrap; /* was made negative by deflate(..., Z_FINISH); */
    }
    s->status = s->wrap ? INIT_STATE : BUSY_STATE;
    strm->adler =
#ifdef GZIP
        s->wrap == 2 ? crc32(0L, Z_NULL, 0) :
#endif
        adler32(0L, Z_NULL, 0);
    s->last_flush = Z_NO_FLUSH;

    _tr_init(s);
    lm_init(s);

    return Z_OK;
}

/* ========================================================================= */
int ZEXPORT deflateSetHeader (strm, head)
    z_streamp strm;
    gz_headerp head;
{
    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
    if (strm->state->wrap != 2) return Z_STREAM_ERROR;
    strm->state->gzhead = head;
    return Z_OK;
}

/* ========================================================================= */
int ZEXPORT deflatePrime (strm, bits, value)
    z_streamp strm;
    int bits;
    int value;
{
    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
    strm->state->bi_valid = bits;
    strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
    return Z_OK;
}

/* ========================================================================= */
int ZEXPORT deflateParams(strm, level, strategy)
    z_streamp strm;
    int level;
    int strategy;
{
    deflate_state *s;
    compress_func func;
    int err = Z_OK;

    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
    s = strm->state;

#ifdef FASTEST
    if (level != 0) level = 1;
#else
    if (level == Z_DEFAULT_COMPRESSION) level = 6;
#endif
    if (level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) {
        return Z_STREAM_ERROR;
    }
    func = configuration_table[s->level].func;

    if ((strategy != s->strategy || func != configuration_table[level].func) &&
        strm->total_in != 0) {
        /* Flush the last buffer: */
        err = deflate(strm, Z_BLOCK);
    }
    if (s->level != level) {
        s->level = level;
        s->max_lazy_match   = configuration_table[level].max_lazy;
        s->good_match       = configuration_table[level].good_length;
        s->nice_match       = configuration_table[level].nice_length;
        s->max_chain_length = configuration_table[level].max_chain;
    }
    s->strategy = strategy;
    return err;
}

/* ========================================================================= */
int ZEXPORT deflateTune(strm, good_length, max_lazy, nice_length, max_chain)
    z_streamp strm;
    int good_length;
    int max_lazy;
    int nice_length;
    int max_chain;
{
    deflate_state *s;

    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
    s = strm->state;
    s->good_match = good_length;
    s->max_lazy_match = max_lazy;
    s->nice_match = nice_length;
    s->max_chain_length = max_chain;
    return Z_OK;
}

/* =========================================================================
 * For the default windowBits of 15 and memLevel of 8, this function returns
 * a close to exact, as well as small, upper bound on the compressed size.
 * They are coded as constants here for a reason--if the #define's are
 * changed, then this function needs to be changed as well.  The return
 * value for 15 and 8 only works for those exact settings.
 *
 * For any setting other than those defaults for windowBits and memLevel,
 * the value returned is a conservative worst case for the maximum expansion
 * resulting from using fixed blocks instead of stored blocks, which deflate
 * can emit on compressed data for some combinations of the parameters.
 *
 * This function could be more sophisticated to provide closer upper bounds for
 * every combination of windowBits and memLevel.  But even the conservative
 * upper bound of about 14% expansion does not seem onerous for output buffer
 * allocation.
 */
uLong ZEXPORT deflateBound(strm, sourceLen)
    z_streamp strm;
    uLong sourceLen;
{
    deflate_state *s;
    uLong complen, wraplen;
    Bytef *str;

    /* conservative upper bound for compressed data */
    complen = sourceLen +
              ((sourceLen + 7) >> 3) + ((sourceLen + 63) >> 6) + 5;

    /* if can't get parameters, return conservative bound plus zlib wrapper */
    if (strm == Z_NULL || strm->state == Z_NULL)
        return complen + 6;

    /* compute wrapper length */
    s = strm->state;
    switch (s->wrap) {
    case 0:                                 /* raw deflate */
        wraplen = 0;
        break;
    case 1:                                 /* zlib wrapper */
        wraplen = 6 + (s->strstart ? 4 : 0);
        break;
    case 2:                                 /* gzip wrapper */
        wraplen = 18;
        if (s->gzhead != Z_NULL) {          /* user-supplied gzip header */
            if (s->gzhead->extra != Z_NULL)
                wraplen += 2 + s->gzhead->extra_len;
            str = s->gzhead->name;
            if (str != Z_NULL)
                do {
                    wraplen++;
                } while (*str++);
            str = s->gzhead->comment;
            if (str != Z_NULL)
                do {
                    wraplen++;
                } while (*str++);
            if (s->gzhead->hcrc)
                wraplen += 2;
        }
        break;
    default:                                /* for compiler happiness */
        wraplen = 6;
    }

    /* if not default parameters, return conservative bound */
    if (s->w_bits != 15 || s->hash_bits != 8 + 7)
        return complen + wraplen;

    /* default settings: return tight bound for that case */
    return sourceLen + (sourceLen >> 12) + (sourceLen >> 14) +
           (sourceLen >> 25) + 13 - 6 + wraplen;
}

/* =========================================================================
 * Put a short in the pending buffer. The 16-bit value is put in MSB order.
 * IN assertion: the stream state is correct and there is enough room in
 * pending_buf.
 */
local void putShortMSB (s, b)
    deflate_state *s;
    uInt b;
{
    put_byte(s, (Byte)(b >> 8));
    put_byte(s, (Byte)(b & 0xff));
}

/* =========================================================================
 * Flush as much pending output as possible. All deflate() output goes
 * through this function so some applications may wish to modify it
 * to avoid allocating a large strm->next_out buffer and copying into it.
 * (See also read_buf()).
 */
local void flush_pending(strm)
    z_streamp strm;
{
    unsigned len = strm->state->pending;

    if (len > strm->avail_out) len = strm->avail_out;
    if (len == 0) return;

    zmemcpy(strm->next_out, strm->state->pending_out, len);
    strm->next_out  += len;
    strm->state->pending_out  += len;
    strm->total_out += len;
    strm->avail_out  -= len;
    strm->state->pending -= len;
    if (strm->state->pending == 0) {
        strm->state->pending_out = strm->state->pending_buf;
    }
}

/* ========================================================================= */
int ZEXPORT deflate (strm, flush)
    z_streamp strm;
    int flush;
{
    int old_flush; /* value of flush param for previous deflate call */
    deflate_state *s;

    if (strm == Z_NULL || strm->state == Z_NULL ||
        flush > Z_BLOCK || flush < 0) {
        return Z_STREAM_ERROR;
    }
    s = strm->state;

    if (strm->next_out == Z_NULL ||
        (strm->next_in == Z_NULL && strm->avail_in != 0) ||
        (s->status == FINISH_STATE && flush != Z_FINISH)) {
        ERR_RETURN(strm, Z_STREAM_ERROR);
    }
    if (strm->avail_out == 0) ERR_RETURN(strm, Z_BUF_ERROR);

    s->strm = strm; /* just in case */
    old_flush = s->last_flush;
    s->last_flush = flush;

    /* Write the header */
    if (s->status == INIT_STATE) {
#ifdef GZIP
        if (s->wrap == 2) {
            strm->adler = crc32(0L, Z_NULL, 0);
            put_byte(s, 31);
            put_byte(s, 139);
            put_byte(s, 8);
            if (s->gzhead == Z_NULL) {
                put_byte(s, 0);
                put_byte(s, 0);
                put_byte(s, 0);
                put_byte(s, 0);
                put_byte(s, 0);
                put_byte(s, s->level == 9 ? 2 :
                            (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?
                             4 : 0));
                put_byte(s, OS_CODE);
                s->status = BUSY_STATE;
            }
            else {
                put_byte(s, (s->gzhead->text ? 1 : 0) +
                            (s->gzhead->hcrc ? 2 : 0) +
                            (s->gzhead->extra == Z_NULL ? 0 : 4) +
                            (s->gzhead->name == Z_NULL ? 0 : 8) +
                            (s->gzhead->comment == Z_NULL ? 0 : 16)
                        );
                put_byte(s, (Byte)(s->gzhead->time & 0xff));
                put_byte(s, (Byte)((s->gzhead->time >> 8) & 0xff));
                put_byte(s, (Byte)((s->gzhead->time >> 16) & 0xff));
                put_byte(s, (Byte)((s->gzhead->time >> 24) & 0xff));
                put_byte(s, s->level == 9 ? 2 :
                            (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?
                             4 : 0));
                put_byte(s, s->gzhead->os & 0xff);
                if (s->gzhead->extra != Z_NULL) {
                    put_byte(s, s->gzhead->extra_len & 0xff);
                    put_byte(s, (s->gzhead->extra_len >> 8) & 0xff);
                }
                if (s->gzhead->hcrc)
                    strm->adler = crc32(strm->adler, s->pending_buf,
                                        s->pending);
                s->gzindex = 0;
                s->status = EXTRA_STATE;
            }
        }
        else
#endif
        {
            uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8;
            uInt level_flags;

            if (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2)
                level_flags = 0;
            else if (s->level < 6)
                level_flags = 1;
            else if (s->level == 6)
                level_flags = 2;
            else
                level_flags = 3;
            header |= (level_flags << 6);
            if (s->strstart != 0) header |= PRESET_DICT;
            header += 31 - (header % 31);

            s->status = BUSY_STATE;
            putShortMSB(s, header);

            /* Save the adler32 of the preset dictionary: */
            if (s->strstart != 0) {
                putShortMSB(s, (uInt)(strm->adler >> 16));
                putShortMSB(s, (uInt)(strm->adler & 0xffff));
            }
            strm->adler = adler32(0L, Z_NULL, 0);
        }
    }
#ifdef GZIP
    if (s->status == EXTRA_STATE) {
        if (s->gzhead->extra != Z_NULL) {
            uInt beg = s->pending;  /* start of bytes to update crc */

            while (s->gzindex < (s->gzhead->extra_len & 0xffff)) {
                if (s->pending == s->pending_buf_size) {
                    if (s->gzhead->hcrc && s->pending > beg)
                        strm->adler = crc32(strm->adler, s->pending_buf + beg,
                                            s->pending - beg);
                    flush_pending(strm);
                    beg = s->pending;
                    if (s->pending == s->pending_buf_size)
                        break;
                }
                put_byte(s, s->gzhead->extra[s->gzindex]);
                s->gzindex++;
            }
            if (s->gzhead->hcrc && s->pending > beg)
                strm->adler = crc32(strm->adler, s->pending_buf + beg,
                                    s->pending - beg);
            if (s->gzindex == s->gzhead->extra_len) {
                s->gzindex = 0;
                s->status = NAME_STATE;
            }
        }
        else
            s->status = NAME_STATE;
    }
    if (s->status == NAME_STATE) {
        if (s->gzhead->name != Z_NULL) {
            uInt beg = s->pending;  /* start of bytes to update crc */
            int val;

            do {
                if (s->pending == s->pending_buf_size) {
                    if (s->gzhead->hcrc && s->pending > beg)
                        strm->adler = crc32(strm->adler, s->pending_buf + beg,
                                            s->pending - beg);
                    flush_pending(strm);
                    beg = s->pending;
                    if (s->pending == s->pending_buf_size) {
                        val = 1;
                        break;
                    }
                }
                val = s->gzhead->name[s->gzindex++];
                put_byte(s, val);
            } while (val != 0);
            if (s->gzhead->hcrc && s->pending > beg)
                strm->adler = crc32(strm->adler, s->pending_buf + beg,
                                    s->pending - beg);
            if (val == 0) {
                s->gzindex = 0;
                s->status = COMMENT_STATE;
            }
        }
        else
            s->status = COMMENT_STATE;
    }
    if (s->status == COMMENT_STATE) {
        if (s->gzhead->comment != Z_NULL) {
            uInt beg = s->pending;  /* start of bytes to update crc */
            int val;

            do {
                if (s->pending == s->pending_buf_size) {
                    if (s->gzhead->hcrc && s->pending > beg)
                        strm->adler = crc32(strm->adler, s->pending_buf + beg,
                                            s->pending - beg);
                    flush_pending(strm);
                    beg = s->pending;
                    if (s->pending == s->pending_buf_size) {
                        val = 1;
                        break;
                    }
                }
                val = s->gzhead->comment[s->gzindex++];
                put_byte(s, val);
            } while (val != 0);
            if (s->gzhead->hcrc && s->pending > beg)
                strm->adler = crc32(strm->adler, s->pending_buf + beg,
                                    s->pending - beg);
            if (val == 0)
                s->status = HCRC_STATE;
        }
        else
            s->status = HCRC_STATE;
    }
    if (s->status == HCRC_STATE) {
        if (s->gzhead->hcrc) {
            if (s->pending + 2 > s->pending_buf_size)
                flush_pending(strm);
            if (s->pending + 2 <= s->pending_buf_size) {
                put_byte(s, (Byte)(strm->adler & 0xff));
                put_byte(s, (Byte)((strm->adler >> 8) & 0xff));
                strm->adler = crc32(0L, Z_NULL, 0);
                s->status = BUSY_STATE;
            }
        }
        else
            s->status = BUSY_STATE;
    }
#endif

    /* Flush as much pending output as possible */
    if (s->pending != 0) {
        flush_pending(strm);
        if (strm->avail_out == 0) {
            /* Since avail_out is 0, deflate will be called again with
             * more output space, but possibly with both pending and
             * avail_in equal to zero. There won't be anything to do,
             * but this is not an error situation so make sure we
             * return OK instead of BUF_ERROR at next call of deflate:
             */
            s->last_flush = -1;
            return Z_OK;
        }

    /* Make sure there is something to do and avoid duplicate consecutive
     * flushes. For repeated and useless calls with Z_FINISH, we keep
     * returning Z_STREAM_END instead of Z_BUF_ERROR.
     */
    } else if (strm->avail_in == 0 && flush <= old_flush &&
               flush != Z_FINISH) {
        ERR_RETURN(strm, Z_BUF_ERROR);
    }

    /* User must not provide more input after the first FINISH: */
    if (s->status == FINISH_STATE && strm->avail_in != 0) {
        ERR_RETURN(strm, Z_BUF_ERROR);
    }

    /* Start a new block or continue the current one.
     */
    if (strm->avail_in != 0 || s->lookahead != 0 ||
        (flush != Z_NO_FLUSH && s->status != FINISH_STATE)) {
        block_state bstate;

        bstate = s->strategy == Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :
                    (s->strategy == Z_RLE ? deflate_rle(s, flush) :
                        (*(configuration_table[s->level].func))(s, flush));

        if (bstate == finish_started || bstate == finish_done) {
            s->status = FINISH_STATE;
        }
        if (bstate == need_more || bstate == finish_started) {
            if (strm->avail_out == 0) {
                s->last_flush = -1; /* avoid BUF_ERROR next call, see above */
            }
            return Z_OK;
            /* If flush != Z_NO_FLUSH && avail_out == 0, the next call
             * of deflate should use the same flush parameter to make sure
             * that the flush is complete. So we don't have to output an
             * empty block here, this will be done at next call. This also
             * ensures that for a very small output buffer, we emit at most
             * one empty block.
             */
        }
        if (bstate == block_done) {
            if (flush == Z_PARTIAL_FLUSH) {
                _tr_align(s);
            } else if (flush != Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */
                _tr_stored_block(s, (char*)0, 0L, 0);
                /* For a full flush, this empty block will be recognized
                 * as a special marker by inflate_sync().
                 */
                if (flush == Z_FULL_FLUSH) {
                    CLEAR_HASH(s);             /* forget history */
                    if (s->lookahead == 0) {
                        s->strstart = 0;
                        s->block_start = 0L;
                    }
                }
            }
            flush_pending(strm);
            if (strm->avail_out == 0) {
              s->last_flush = -1; /* avoid BUF_ERROR at next call, see above */
              return Z_OK;
            }
        }
    }
    Assert(strm->avail_out > 0, "bug2");

    if (flush != Z_FINISH) return Z_OK;
    if (s->wrap <= 0) return Z_STREAM_END;

    /* Write the trailer */
#ifdef GZIP
    if (s->wrap == 2) {
        put_byte(s, (Byte)(strm->adler & 0xff));
        put_byte(s, (Byte)((strm->adler >> 8) & 0xff));
        put_byte(s, (Byte)((strm->adler >> 16) & 0xff));
        put_byte(s, (Byte)((strm->adler >> 24) & 0xff));
        put_byte(s, (Byte)(strm->total_in & 0xff));
        put_byte(s, (Byte)((strm->total_in >> 8) & 0xff));
        put_byte(s, (Byte)((strm->total_in >> 16) & 0xff));
        put_byte(s, (Byte)((strm->total_in >> 24) & 0xff));
    }
    else
#endif
    {
        putShortMSB(s, (uInt)(strm->adler >> 16));
        putShortMSB(s, (uInt)(strm->adler & 0xffff));
    }
    flush_pending(strm);
    /* If avail_out is zero, the application will call deflate again
     * to flush the rest.
     */
    if (s->wrap > 0) s->wrap = -s->wrap; /* write the trailer only once! */
    return s->pending != 0 ? Z_OK : Z_STREAM_END;
}

/* ========================================================================= */
int ZEXPORT deflateEnd (strm)
    z_streamp strm;
{
    int status;

    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;

    status = strm->state->status;
    if (status != INIT_STATE &&
        status != EXTRA_STATE &&
        status != NAME_STATE &&
        status != COMMENT_STATE &&
        status != HCRC_STATE &&
        status != BUSY_STATE &&
        status != FINISH_STATE) {
      return Z_STREAM_ERROR;
    }

    /* Deallocate in reverse order of allocations: */
    TRY_FREE(strm, strm->state->pending_buf);
    TRY_FREE(strm, strm->state->head);
    TRY_FREE(strm, strm->state->prev);
    TRY_FREE(strm, strm->state->window);

    ZFREE(strm, strm->state);
    strm->state = Z_NULL;

    return status == BUSY_STATE ? Z_DATA_ERROR : Z_OK;
}

/* =========================================================================
 * Copy the source state to the destination state.
 * To simplify the source, this is not supported for 16-bit MSDOS (which
 * doesn't have enough memory anyway to duplicate compression states).
 */
int ZEXPORT deflateCopy (dest, source)
    z_streamp dest;
    z_streamp source;
{
#ifdef MAXSEG_64K
    return Z_STREAM_ERROR;
#else
    deflate_state *ds;
    deflate_state *ss;
    ushf *overlay;


    if (source == Z_NULL || dest == Z_NULL || source->state == Z_NULL) {
        return Z_STREAM_ERROR;
    }

    ss = source->state;

    zmemcpy(dest, source, sizeof(z_stream));

    ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state));
    if (ds == Z_NULL) return Z_MEM_ERROR;
    dest->state = (struct internal_state FAR *) ds;
    zmemcpy(ds, ss, sizeof(deflate_state));
    ds->strm = dest;

    ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte));
    ds->prev   = (Posf *)  ZALLOC(dest, ds->w_size, sizeof(Pos));
    ds->head   = (Posf *)  ZALLOC(dest, ds->hash_size, sizeof(Pos));
    overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
    ds->pending_buf = (uchf *) overlay;

    if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||
        ds->pending_buf == Z_NULL) {
        deflateEnd (dest);
        return Z_MEM_ERROR;
    }
    /* following zmemcpy do not work for 16-bit MSDOS */
    zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte));
    zmemcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos));
    zmemcpy(ds->head, ss->head, ds->hash_size * sizeof(Pos));
    zmemcpy(ds->pending_buf, ss->pending_buf, (uInt)ds->pending_buf_size);

    ds->pending_out = ds->pending_buf + (ss->pending_out - ss->pending_buf);
    ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush);
    ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize;

    ds->l_desc.dyn_tree = ds->dyn_ltree;
    ds->d_desc.dyn_tree = ds->dyn_dtree;
    ds->bl_desc.dyn_tree = ds->bl_tree;

    return Z_OK;
#endif /* MAXSEG_64K */
}

/* ===========================================================================
 * Read a new buffer from the current input stream, update the adler32
 * and total number of bytes read.  All deflate() input goes through
 * this function so some applications may wish to modify it to avoid
 * allocating a large strm->next_in buffer and copying from it.
 * (See also flush_pending()).
 */
local int read_buf(strm, buf, size)
    z_streamp strm;
    Bytef *buf;
    unsigned size;
{
    unsigned len = strm->avail_in;

    if (len > size) len = size;
    if (len == 0) return 0;

    strm->avail_in  -= len;

    if (strm->state->wrap == 1) {
        strm->adler = adler32(strm->adler, strm->next_in, len);
    }
#ifdef GZIP
    else if (strm->state->wrap == 2) {
        strm->adler = crc32(strm->adler, strm->next_in, len);
    }
#endif
    zmemcpy(buf, strm->next_in, len);
    strm->next_in  += len;
    strm->total_in += len;

    return (int)len;
}

/* ===========================================================================
 * Initialize the "longest match" routines for a new zlib stream
 */
local void lm_init (s)
    deflate_state *s;
{
    s->window_size = (ulg)2L*s->w_size;

    CLEAR_HASH(s);

    /* Set the default configuration parameters:
     */
    s->max_lazy_match   = configuration_table[s->level].max_lazy;
    s->good_match       = configuration_table[s->level].good_length;
    s->nice_match       = configuration_table[s->level].nice_length;
    s->max_chain_length = configuration_table[s->level].max_chain;

    s->strstart = 0;
    s->block_start = 0L;
    s->lookahead = 0;
    s->match_length = s->prev_length = MIN_MATCH-1;
    s->match_available = 0;
    s->ins_h = 0;
#ifndef FASTEST
#ifdef ASMV
    match_init(); /* initialize the asm code */
#endif
#endif
}

#ifndef FASTEST
/* ===========================================================================
 * Set match_start to the longest match starting at the given string and
 * return its length. Matches shorter or equal to prev_length are discarded,
 * in which case the result is equal to prev_length and match_start is
 * garbage.
 * IN assertions: cur_match is the head of the hash chain for the current
 *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
 * OUT assertion: the match length is not greater than s->lookahead.
 */
#ifndef ASMV
/* For 80x86 and 680x0, an optimized version will be provided in match.asm or
 * match.S. The code will be functionally equivalent.
 */
local uInt longest_match(s, cur_match)
    deflate_state *s;
    IPos cur_match;                             /* current match */
{
    unsigned chain_length = s->max_chain_length;/* max hash chain length */
    register Bytef *scan = s->window + s->strstart; /* current string */
    register Bytef *match;                       /* matched string */
    register int len;                           /* length of current match */
    int best_len = s->prev_length;              /* best match length so far */
    int nice_match = s->nice_match;             /* stop if match long enough */
    IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
        s->strstart - (IPos)MAX_DIST(s) : NIL;
    /* Stop when cur_match becomes <= limit. To simplify the code,
     * we prevent matches with the string of window index 0.
     */
    Posf *prev = s->prev;
    uInt wmask = s->w_mask;

#ifdef UNALIGNED_OK
    /* Compare two bytes at a time. Note: this is not always beneficial.
     * Try with and without -DUNALIGNED_OK to check.
     */
    register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
    register ush scan_start = *(ushf*)scan;
    register ush scan_end   = *(ushf*)(scan+best_len-1);
#else
    register Bytef *strend = s->window + s->strstart + MAX_MATCH;
    register Byte scan_end1  = scan[best_len-1];
    register Byte scan_end   = scan[best_len];
#endif

    /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
     * It is easy to get rid of this optimization if necessary.
     */
    Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");

    /* Do not waste too much time if we already have a good match: */
    if (s->prev_length >= s->good_match) {
        chain_length >>= 2;
    }
    /* Do not look for matches beyond the end of the input. This is necessary
     * to make deflate deterministic.
     */
    if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;

    Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");

    do {
        Assert(cur_match < s->strstart, "no future");
        match = s->window + cur_match;

        /* Skip to next match if the match length cannot increase
         * or if the match length is less than 2.  Note that the checks below
         * for insufficient lookahead only occur occasionally for performance
         * reasons.  Therefore uninitialized memory will be accessed, and
         * conditional jumps will be made that depend on those values.
         * However the length of the match is limited to the lookahead, so
         * the output of deflate is not affected by the uninitialized values.
         */
#if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
        /* This code assumes sizeof(unsigned short) == 2. Do not use
         * UNALIGNED_OK if your compiler uses a different size.
         */
        if (*(ushf*)(match+best_len-1) != scan_end ||
            *(ushf*)match != scan_start) continue;

        /* It is not necessary to compare scan[2] and match[2] since they are
         * always equal when the other bytes match, given that the hash keys
         * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at
         * strstart+3, +5, ... up to strstart+257. We check for insufficient
         * lookahead only every 4th comparison; the 128th check will be made
         * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
         * necessary to put more guard bytes at the end of the window, or
         * to check more often for insufficient lookahead.
         */
        Assert(scan[2] == match[2], "scan[2]?");
        scan++, match++;
        do {
        } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
                 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
                 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
                 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
                 scan < strend);
        /* The funny "do {}" generates better code on most compilers */

        /* Here, scan <= window+strstart+257 */
        Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
        if (*scan == *match) scan++;

        len = (MAX_MATCH - 1) - (int)(strend-scan);
        scan = strend - (MAX_MATCH-1);

#else /* UNALIGNED_OK */

        if (match[best_len]   != scan_end  ||
            match[best_len-1] != scan_end1 ||
            *match            != *scan     ||
            *++match          != scan[1])      continue;

        /* The check at best_len-1 can be removed because it will be made
         * again later. (This heuristic is not always a win.)
         * It is not necessary to compare scan[2] and match[2] since they
         * are always equal when the other bytes match, given that
         * the hash keys are equal and that HASH_BITS >= 8.
         */
        scan += 2, match++;
        Assert(*scan == *match, "match[2]?");

        /* We check for insufficient lookahead only every 8th comparison;
         * the 256th check will be made at strstart+258.
         */
        do {
        } while (*++scan == *++match && *++scan == *++match &&
                 *++scan == *++match && *++scan == *++match &&
                 *++scan == *++match && *++scan == *++match &&
                 *++scan == *++match && *++scan == *++match &&
                 scan < strend);

        Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");

        len = MAX_MATCH - (int)(strend - scan);
        scan = strend - MAX_MATCH;

#endif /* UNALIGNED_OK */

        if (len > best_len) {
            s->match_start = cur_match;
            best_len = len;
            if (len >= nice_match) break;
#ifdef UNALIGNED_OK
            scan_end = *(ushf*)(scan+best_len-1);
#else
            scan_end1  = scan[best_len-1];
            scan_end   = scan[best_len];
#endif
        }
    } while ((cur_match = prev[cur_match & wmask]) > limit
             && --chain_length != 0);

    if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
    return s->lookahead;
}
#endif /* ASMV */

#else /* FASTEST */

/* ---------------------------------------------------------------------------
 * Optimized version for FASTEST only
 */
local uInt longest_match(s, cur_match)
    deflate_state *s;
    IPos cur_match;                             /* current match */
{
    register Bytef *scan = s->window + s->strstart; /* current string */
    register Bytef *match;                       /* matched string */
    register int len;                           /* length of current match */
    register Bytef *strend = s->window + s->strstart + MAX_MATCH;

    /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
     * It is easy to get rid of this optimization if necessary.
     */
    Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");

    Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");

    Assert(cur_match < s->strstart, "no future");

    match = s->window + cur_match;

    /* Return failure if the match length is less than 2:
     */
    if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;

    /* The check at best_len-1 can be removed because it will be made
     * again later. (This heuristic is not always a win.)
     * It is not necessary to compare scan[2] and match[2] since they
     * are always equal when the other bytes match, given that
     * the hash keys are equal and that HASH_BITS >= 8.
     */
    scan += 2, match += 2;
    Assert(*scan == *match, "match[2]?");

    /* We check for insufficient lookahead only every 8th comparison;
     * the 256th check will be made at strstart+258.
     */
    do {
    } while (*++scan == *++match && *++scan == *++match &&
             *++scan == *++match && *++scan == *++match &&
             *++scan == *++match && *++scan == *++match &&
             *++scan == *++match && *++scan == *++match &&
             scan < strend);

    Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");

    len = MAX_MATCH - (int)(strend - scan);

    if (len < MIN_MATCH) return MIN_MATCH - 1;

    s->match_start = cur_match;
    return (uInt)len <= s->lookahead ? (uInt)len : s->lookahead;
}

#endif /* FASTEST */

#ifdef DEBUG
/* ===========================================================================
 * Check that the match at match_start is indeed a match.
 */
local void check_match(s, start, match, length)
    deflate_state *s;
    IPos start, match;
    int length;
{
    /* check that the match is indeed a match */
    if (zmemcmp(s->window + match,
                s->window + start, length) != EQUAL) {
        fprintf(stderr, " start %u, match %u, length %d\n",
                start, match, length);
        do {
            fprintf(stderr, "%c%c", s->window[match++], s->window[start++]);
        } while (--length != 0);
        z_error("invalid match");
    }
    if (z_verbose > 1) {
        fprintf(stderr,"\\[%d,%d]", start-match, length);
        do { putc(s->window[start++], stderr); } while (--length != 0);
    }
}
#else
#  define check_match(s, start, match, length)
#endif /* DEBUG */

/* ===========================================================================
 * Fill the window when the lookahead becomes insufficient.
 * Updates strstart and lookahead.
 *
 * IN assertion: lookahead < MIN_LOOKAHEAD
 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
 *    At least one byte has been read, or avail_in == 0; reads are
 *    performed for at least two bytes (required for the zip translate_eol
 *    option -- not supported here).
 */
local void fill_window(s)
    deflate_state *s;
{
    register unsigned n, m;
    register Posf *p;
    unsigned more;    /* Amount of free space at the end of the window. */
    uInt wsize = s->w_size;

    do {
        more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);

        /* Deal with !@#$% 64K limit: */
        if (sizeof(int) <= 2) {
            if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
                more = wsize;

            } else if (more == (unsigned)(-1)) {
                /* Very unlikely, but possible on 16 bit machine if
                 * strstart == 0 && lookahead == 1 (input done a byte at time)
                 */
                more--;
            }
        }

        /* If the window is almost full and there is insufficient lookahead,
         * move the upper half to the lower one to make room in the upper half.
         */
        if (s->strstart >= wsize+MAX_DIST(s)) {

            zmemcpy(s->window, s->window+wsize, (unsigned)wsize);
            s->match_start -= wsize;
            s->strstart    -= wsize; /* we now have strstart >= MAX_DIST */
            s->block_start -= (long) wsize;

            /* Slide the hash table (could be avoided with 32 bit values
               at the expense of memory usage). We slide even when level == 0
               to keep the hash table consistent if we switch back to level > 0
               later. (Using level 0 permanently is not an optimal usage of
               zlib, so we don't care about this pathological case.)
             */
            n = s->hash_size;
            p = &s->head[n];
            do {
                m = *--p;
                *p = (Pos)(m >= wsize ? m-wsize : NIL);
            } while (--n);

            n = wsize;
#ifndef FASTEST
            p = &s->prev[n];
            do {
                m = *--p;
                *p = (Pos)(m >= wsize ? m-wsize : NIL);
                /* If n is not on any hash chain, prev[n] is garbage but
                 * its value will never be used.
                 */
            } while (--n);
#endif
            more += wsize;
        }
        if (s->strm->avail_in == 0) return;

        /* If there was no sliding:
         *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
         *    more == window_size - lookahead - strstart
         * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
         * => more >= window_size - 2*WSIZE + 2
         * In the BIG_MEM or MMAP case (not yet supported),
         *   window_size == input_size + MIN_LOOKAHEAD  &&
         *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
         * Otherwise, window_size == 2*WSIZE so more >= 2.
         * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
         */
        Assert(more >= 2, "more < 2");

        n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
        s->lookahead += n;

        /* Initialize the hash value now that we have some input: */
        if (s->lookahead >= MIN_MATCH) {
            s->ins_h = s->window[s->strstart];
            UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
#if MIN_MATCH != 3
            Call UPDATE_HASH() MIN_MATCH-3 more times
#endif
        }
        /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
         * but this is not important since only literal bytes will be emitted.
         */

    } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);

    /* If the WIN_INIT bytes after the end of the current data have never been
     * written, then zero those bytes in order to avoid memory check reports of
     * the use of uninitialized (or uninitialised as Julian writes) bytes by
     * the longest match routines.  Update the high water mark for the next
     * time through here.  WIN_INIT is set to MAX_MATCH since the longest match
     * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
     */
    if (s->high_water < s->window_size) {
        ulg curr = s->strstart + (ulg)(s->lookahead);
        ulg init;

        if (s->high_water < curr) {
            /* Previous high water mark below current data -- zero WIN_INIT
             * bytes or up to end of window, whichever is less.
             */
            init = s->window_size - curr;
            if (init > WIN_INIT)
                init = WIN_INIT;
            zmemzero(s->window + curr, (unsigned)init);
            s->high_water = curr + init;
        }
        else if (s->high_water < (ulg)curr + WIN_INIT) {
            /* High water mark at or above current data, but below current data
             * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up
             * to end of window, whichever is less.
             */
            init = (ulg)curr + WIN_INIT - s->high_water;
            if (init > s->window_size - s->high_water)
                init = s->window_size - s->high_water;
            zmemzero(s->window + s->high_water, (unsigned)init);
            s->high_water += init;
        }
    }
}

/* ===========================================================================
 * Flush the current block, with given end-of-file flag.
 * IN assertion: strstart is set to the end of the current match.
 */
#define FLUSH_BLOCK_ONLY(s, last) { \
   _tr_flush_block(s, (s->block_start >= 0L ? \
                   (charf *)&s->window[(unsigned)s->block_start] : \
                   (charf *)Z_NULL), \
                (ulg)((long)s->strstart - s->block_start), \
                (last)); \
   s->block_start = s->strstart; \
   flush_pending(s->strm); \
   Tracev((stderr,"[FLUSH]")); \
}

/* Same but force premature exit if necessary. */
#define FLUSH_BLOCK(s, last) { \
   FLUSH_BLOCK_ONLY(s, last); \
   if (s->strm->avail_out == 0) return (last) ? finish_started : need_more; \
}

/* ===========================================================================
 * Copy without compression as much as possible from the input stream, return
 * the current block state.
 * This function does not insert new strings in the dictionary since
 * uncompressible data is probably not useful. This function is used
 * only for the level=0 compression option.
 * NOTE: this function should be optimized to avoid extra copying from
 * window to pending_buf.
 */
local block_state deflate_stored(s, flush)
    deflate_state *s;
    int flush;
{
    /* Stored blocks are limited to 0xffff bytes, pending_buf is limited
     * to pending_buf_size, and each stored block has a 5 byte header:
     */
    ulg max_block_size = 0xffff;
    ulg max_start;

    if (max_block_size > s->pending_buf_size - 5) {
        max_block_size = s->pending_buf_size - 5;
    }

    /* Copy as much as possible from input to output: */
    for (;;) {
        /* Fill the window as much as possible: */
        if (s->lookahead <= 1) {

            Assert(s->strstart < s->w_size+MAX_DIST(s) ||
                   s->block_start >= (long)s->w_size, "slide too late");

            fill_window(s);
            if (s->lookahead == 0 && flush == Z_NO_FLUSH) return need_more;

            if (s->lookahead == 0) break; /* flush the current block */
        }
        Assert(s->block_start >= 0L, "block gone");

        s->strstart += s->lookahead;
        s->lookahead = 0;

        /* Emit a stored block if pending_buf will be full: */
        max_start = s->block_start + max_block_size;
        if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
            /* strstart == 0 is possible when wraparound on 16-bit machine */
            s->lookahead = (uInt)(s->strstart - max_start);
            s->strstart = (uInt)max_start;
            FLUSH_BLOCK(s, 0);
        }
        /* Flush if we may have to slide, otherwise block_start may become
         * negative and the data will be gone:
         */
        if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
            FLUSH_BLOCK(s, 0);
        }
    }
    FLUSH_BLOCK(s, flush == Z_FINISH);
    return flush == Z_FINISH ? finish_done : block_done;
}

/* ===========================================================================
 * Compress as much as possible from the input stream, return the current
 * block state.
 * This function does not perform lazy evaluation of matches and inserts
 * new strings in the dictionary only for unmatched strings or for short
 * matches. It is used only for the fast compression options.
 */
local block_state deflate_fast(s, flush)
    deflate_state *s;
    int flush;
{
    IPos hash_head;       /* head of the hash chain */
    int bflush;           /* set if current block must be flushed */

    for (;;) {
        /* Make sure that we always have enough lookahead, except
         * at the end of the input file. We need MAX_MATCH bytes
         * for the next match, plus MIN_MATCH bytes to insert the
         * string following the next match.
         */
        if (s->lookahead < MIN_LOOKAHEAD) {
            fill_window(s);
            if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
                return need_more;
            }
            if (s->lookahead == 0) break; /* flush the current block */
        }

        /* Insert the string window[strstart .. strstart+2] in the
         * dictionary, and set hash_head to the head of the hash chain:
         */
        hash_head = NIL;
        if (s->lookahead >= MIN_MATCH) {
            INSERT_STRING(s, s->strstart, hash_head);
        }

        /* Find the longest match, discarding those <= prev_length.
         * At this point we have always match_length < MIN_MATCH
         */
        if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
            /* To simplify the code, we prevent matches with the string
             * of window index 0 (in particular we have to avoid a match
             * of the string with itself at the start of the input file).
             */
            s->match_length = longest_match (s, hash_head);
            /* longest_match() sets match_start */
        }
        if (s->match_length >= MIN_MATCH) {
            check_match(s, s->strstart, s->match_start, s->match_length);

            _tr_tally_dist(s, s->strstart - s->match_start,
                           s->match_length - MIN_MATCH, bflush);

            s->lookahead -= s->match_length;

            /* Insert new strings in the hash table only if the match length
             * is not too large. This saves time but degrades compression.
             */
#ifndef FASTEST
            if (s->match_length <= s->max_insert_length &&
                s->lookahead >= MIN_MATCH) {
                s->match_length--; /* string at strstart already in table */
                do {
                    s->strstart++;
                    INSERT_STRING(s, s->strstart, hash_head);
                    /* strstart never exceeds WSIZE-MAX_MATCH, so there are
                     * always MIN_MATCH bytes ahead.
                     */
                } while (--s->match_length != 0);
                s->strstart++;
            } else
#endif
            {
                s->strstart += s->match_length;
                s->match_length = 0;
                s->ins_h = s->window[s->strstart];
                UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
#if MIN_MATCH != 3
                Call UPDATE_HASH() MIN_MATCH-3 more times
#endif
                /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
                 * matter since it will be recomputed at next deflate call.
                 */
            }
        } else {
            /* No match, output a literal byte */
            Tracevv((stderr,"%c", s->window[s->strstart]));
            _tr_tally_lit (s, s->window[s->strstart], bflush);
            s->lookahead--;
            s->strstart++;
        }
        if (bflush) FLUSH_BLOCK(s, 0);
    }
    FLUSH_BLOCK(s, flush == Z_FINISH);
    return flush == Z_FINISH ? finish_done : block_done;
}

#ifndef FASTEST
/* ===========================================================================
 * Same as above, but achieves better compression. We use a lazy
 * evaluation for matches: a match is finally adopted only if there is
 * no better match at the next window position.
 */
local block_state deflate_slow(s, flush)
    deflate_state *s;
    int flush;
{
    IPos hash_head;          /* head of hash chain */
    int bflush;              /* set if current block must be flushed */

    /* Process the input block. */
    for (;;) {
        /* Make sure that we always have enough lookahead, except
         * at the end of the input file. We need MAX_MATCH bytes
         * for the next match, plus MIN_MATCH bytes to insert the
         * string following the next match.
         */
        if (s->lookahead < MIN_LOOKAHEAD) {
            fill_window(s);
            if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
                return need_more;
            }
            if (s->lookahead == 0) break; /* flush the current block */
        }

        /* Insert the string window[strstart .. strstart+2] in the
         * dictionary, and set hash_head to the head of the hash chain:
         */
        hash_head = NIL;
        if (s->lookahead >= MIN_MATCH) {
            INSERT_STRING(s, s->strstart, hash_head);
        }

        /* Find the longest match, discarding those <= prev_length.
         */
        s->prev_length = s->match_length, s->prev_match = s->match_start;
        s->match_length = MIN_MATCH-1;

        if (hash_head != NIL && s->prev_length < s->max_lazy_match &&
            s->strstart - hash_head <= MAX_DIST(s)) {
            /* To simplify the code, we prevent matches with the string
             * of window index 0 (in particular we have to avoid a match
             * of the string with itself at the start of the input file).
             */
            s->match_length = longest_match (s, hash_head);
            /* longest_match() sets match_start */

            if (s->match_length <= 5 && (s->strategy == Z_FILTERED
#if TOO_FAR <= 32767
                || (s->match_length == MIN_MATCH &&
                    s->strstart - s->match_start > TOO_FAR)
#endif
                )) {

                /* If prev_match is also MIN_MATCH, match_start is garbage
                 * but we will ignore the current match anyway.
                 */
                s->match_length = MIN_MATCH-1;
            }
        }
        /* If there was a match at the previous step and the current
         * match is not better, output the previous match:
         */
        if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
            uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
            /* Do not insert strings in hash table beyond this. */

            check_match(s, s->strstart-1, s->prev_match, s->prev_length);

            _tr_tally_dist(s, s->strstart -1 - s->prev_match,
                           s->prev_length - MIN_MATCH, bflush);

            /* Insert in hash table all strings up to the end of the match.
             * strstart-1 and strstart are already inserted. If there is not
             * enough lookahead, the last two strings are not inserted in
             * the hash table.
             */
            s->lookahead -= s->prev_length-1;
            s->prev_length -= 2;
            do {
                if (++s->strstart <= max_insert) {
                    INSERT_STRING(s, s->strstart, hash_head);
                }
            } while (--s->prev_length != 0);
            s->match_available = 0;
            s->match_length = MIN_MATCH-1;
            s->strstart++;

            if (bflush) FLUSH_BLOCK(s, 0);

        } else if (s->match_available) {
            /* If there was no match at the previous position, output a
             * single literal. If there was a match but the current match
             * is longer, truncate the previous match to a single literal.
             */
            Tracevv((stderr,"%c", s->window[s->strstart-1]));
            _tr_tally_lit(s, s->window[s->strstart-1], bflush);
            if (bflush) {
                FLUSH_BLOCK_ONLY(s, 0);
            }
            s->strstart++;
            s->lookahead--;
            if (s->strm->avail_out == 0) return need_more;
        } else {
            /* There is no previous match to compare with, wait for
             * the next step to decide.
             */
            s->match_available = 1;
            s->strstart++;
            s->lookahead--;
        }
    }
    Assert (flush != Z_NO_FLUSH, "no flush?");
    if (s->match_available) {
        Tracevv((stderr,"%c", s->window[s->strstart-1]));
        _tr_tally_lit(s, s->window[s->strstart-1], bflush);
        s->match_available = 0;
    }
    FLUSH_BLOCK(s, flush == Z_FINISH);
    return flush == Z_FINISH ? finish_done : block_done;
}
#endif /* FASTEST */

/* ===========================================================================
 * For Z_RLE, simply look for runs of bytes, generate matches only of distance
 * one.  Do not maintain a hash table.  (It will be regenerated if this run of
 * deflate switches away from Z_RLE.)
 */
local block_state deflate_rle(s, flush)
    deflate_state *s;
    int flush;
{
    int bflush;             /* set if current block must be flushed */
    uInt prev;              /* byte at distance one to match */
    Bytef *scan, *strend;   /* scan goes up to strend for length of run */

    for (;;) {
        /* Make sure that we always have enough lookahead, except
         * at the end of the input file. We need MAX_MATCH bytes
         * for the longest encodable run.
         */
        if (s->lookahead < MAX_MATCH) {
            fill_window(s);
            if (s->lookahead < MAX_MATCH && flush == Z_NO_FLUSH) {
                return need_more;
            }
            if (s->lookahead == 0) break; /* flush the current block */
        }

        /* See how many times the previous byte repeats */
        s->match_length = 0;
        if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
            scan = s->window + s->strstart - 1;
            prev = *scan;
            if (prev == *++scan && prev == *++scan && prev == *++scan) {
                strend = s->window + s->strstart + MAX_MATCH;
                do {
                } while (prev == *++scan && prev == *++scan &&
                         prev == *++scan && prev == *++scan &&
                         prev == *++scan && prev == *++scan &&
                         prev == *++scan && prev == *++scan &&
                         scan < strend);
                s->match_length = MAX_MATCH - (int)(strend - scan);
                if (s->match_length > s->lookahead)
                    s->match_length = s->lookahead;
            }
        }

        /* Emit match if have run of MIN_MATCH or longer, else emit literal */
        if (s->match_length >= MIN_MATCH) {
            check_match(s, s->strstart, s->strstart - 1, s->match_length);

            _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);

            s->lookahead -= s->match_length;
            s->strstart += s->match_length;
            s->match_length = 0;
        } else {
            /* No match, output a literal byte */
            Tracevv((stderr,"%c", s->window[s->strstart]));
            _tr_tally_lit (s, s->window[s->strstart], bflush);
            s->lookahead--;
            s->strstart++;
        }
        if (bflush) FLUSH_BLOCK(s, 0);
    }
    FLUSH_BLOCK(s, flush == Z_FINISH);
    return flush == Z_FINISH ? finish_done : block_done;
}

/* ===========================================================================
 * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.
 * (It will be regenerated if this run of deflate switches away from Huffman.)
 */
local block_state deflate_huff(s, flush)
    deflate_state *s;
    int flush;
{
    int bflush;             /* set if current block must be flushed */

    for (;;) {
        /* Make sure that we have a literal to write. */
        if (s->lookahead == 0) {
            fill_window(s);
            if (s->lookahead == 0) {
                if (flush == Z_NO_FLUSH)
                    return need_more;
                break;      /* flush the current block */
            }
        }

        /* Output a literal byte */
        s->match_length = 0;
        Tracevv((stderr,"%c", s->window[s->strstart]));
        _tr_tally_lit (s, s->window[s->strstart], bflush);
        s->lookahead--;
        s->strstart++;
        if (bflush) FLUSH_BLOCK(s, 0);
    }
    FLUSH_BLOCK(s, flush == Z_FINISH);
    return flush == Z_FINISH ? finish_done : block_done;
}
cfitsio-3.47/zlib/deflate.h0000644000225700000360000003055713464573432015137 0ustar  cagordonlhea/* deflate.h -- internal compression state
 * Copyright (C) 1995-2010 Jean-loup Gailly
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

/* WARNING: this file should *not* be used by applications. It is
   part of the implementation of the compression library and is
   subject to change. Applications should only use zlib.h.
 */

#ifndef DEFLATE_H
#define DEFLATE_H

#include "zutil.h"

/* define NO_GZIP when compiling if you want to disable gzip header and
   trailer creation by deflate().  NO_GZIP would be used to avoid linking in
   the crc code when it is not needed.  For shared libraries, gzip encoding
   should be left enabled. */
#ifndef NO_GZIP
#  define GZIP
#endif

/* ===========================================================================
 * Internal compression state.
 */

#define LENGTH_CODES 29
/* number of length codes, not counting the special END_BLOCK code */

#define LITERALS  256
/* number of literal bytes 0..255 */

#define L_CODES (LITERALS+1+LENGTH_CODES)
/* number of Literal or Length codes, including the END_BLOCK code */

#define D_CODES   30
/* number of distance codes */

#define BL_CODES  19
/* number of codes used to transfer the bit lengths */

#define HEAP_SIZE (2*L_CODES+1)
/* maximum heap size */

#define MAX_BITS 15
/* All codes must not exceed MAX_BITS bits */

#define INIT_STATE    42
#define EXTRA_STATE   69
#define NAME_STATE    73
#define COMMENT_STATE 91
#define HCRC_STATE   103
#define BUSY_STATE   113
#define FINISH_STATE 666
/* Stream status */


/* Data structure describing a single value and its code string. */
typedef struct ct_data_s {
    union {
        ush  freq;       /* frequency count */
        ush  code;       /* bit string */
    } fc;
    union {
        ush  dad;        /* father node in Huffman tree */
        ush  len;        /* length of bit string */
    } dl;
} FAR ct_data;

#define Freq fc.freq
#define Code fc.code
#define Dad  dl.dad
#define Len  dl.len

typedef struct static_tree_desc_s  static_tree_desc;

typedef struct tree_desc_s {
    ct_data *dyn_tree;           /* the dynamic tree */
    int     max_code;            /* largest code with non zero frequency */
    static_tree_desc *stat_desc; /* the corresponding static tree */
} FAR tree_desc;

typedef ush Pos;
typedef Pos FAR Posf;
typedef unsigned IPos;

/* A Pos is an index in the character window. We use short instead of int to
 * save space in the various tables. IPos is used only for parameter passing.
 */

typedef struct internal_state {
    z_streamp strm;      /* pointer back to this zlib stream */
    int   status;        /* as the name implies */
    Bytef *pending_buf;  /* output still pending */
    ulg   pending_buf_size; /* size of pending_buf */
    Bytef *pending_out;  /* next pending byte to output to the stream */
    uInt   pending;      /* nb of bytes in the pending buffer */
    int   wrap;          /* bit 0 true for zlib, bit 1 true for gzip */
    gz_headerp  gzhead;  /* gzip header information to write */
    uInt   gzindex;      /* where in extra, name, or comment */
    Byte  method;        /* STORED (for zip only) or DEFLATED */
    int   last_flush;    /* value of flush param for previous deflate call */

                /* used by deflate.c: */

    uInt  w_size;        /* LZ77 window size (32K by default) */
    uInt  w_bits;        /* log2(w_size)  (8..16) */
    uInt  w_mask;        /* w_size - 1 */

    Bytef *window;
    /* Sliding window. Input bytes are read into the second half of the window,
     * and move to the first half later to keep a dictionary of at least wSize
     * bytes. With this organization, matches are limited to a distance of
     * wSize-MAX_MATCH bytes, but this ensures that IO is always
     * performed with a length multiple of the block size. Also, it limits
     * the window size to 64K, which is quite useful on MSDOS.
     * To do: use the user input buffer as sliding window.
     */

    ulg window_size;
    /* Actual size of window: 2*wSize, except when the user input buffer
     * is directly used as sliding window.
     */

    Posf *prev;
    /* Link to older string with same hash index. To limit the size of this
     * array to 64K, this link is maintained only for the last 32K strings.
     * An index in this array is thus a window index modulo 32K.
     */

    Posf *head; /* Heads of the hash chains or NIL. */

    uInt  ins_h;          /* hash index of string to be inserted */
    uInt  hash_size;      /* number of elements in hash table */
    uInt  hash_bits;      /* log2(hash_size) */
    uInt  hash_mask;      /* hash_size-1 */

    uInt  hash_shift;
    /* Number of bits by which ins_h must be shifted at each input
     * step. It must be such that after MIN_MATCH steps, the oldest
     * byte no longer takes part in the hash key, that is:
     *   hash_shift * MIN_MATCH >= hash_bits
     */

    long block_start;
    /* Window position at the beginning of the current output block. Gets
     * negative when the window is moved backwards.
     */

    uInt match_length;           /* length of best match */
    IPos prev_match;             /* previous match */
    int match_available;         /* set if previous match exists */
    uInt strstart;               /* start of string to insert */
    uInt match_start;            /* start of matching string */
    uInt lookahead;              /* number of valid bytes ahead in window */

    uInt prev_length;
    /* Length of the best match at previous step. Matches not greater than this
     * are discarded. This is used in the lazy match evaluation.
     */

    uInt max_chain_length;
    /* To speed up deflation, hash chains are never searched beyond this
     * length.  A higher limit improves compression ratio but degrades the
     * speed.
     */

    uInt max_lazy_match;
    /* Attempt to find a better match only when the current match is strictly
     * smaller than this value. This mechanism is used only for compression
     * levels >= 4.
     */
#   define max_insert_length  max_lazy_match
    /* Insert new strings in the hash table only if the match length is not
     * greater than this length. This saves time but degrades compression.
     * max_insert_length is used only for compression levels <= 3.
     */

    int level;    /* compression level (1..9) */
    int strategy; /* favor or force Huffman coding*/

    uInt good_match;
    /* Use a faster search when the previous match is longer than this */

    int nice_match; /* Stop searching when current match exceeds this */

                /* used by trees.c: */
    /* Didn't use ct_data typedef below to supress compiler warning */
    struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */
    struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
    struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */

    struct tree_desc_s l_desc;               /* desc. for literal tree */
    struct tree_desc_s d_desc;               /* desc. for distance tree */
    struct tree_desc_s bl_desc;              /* desc. for bit length tree */

    ush bl_count[MAX_BITS+1];
    /* number of codes at each bit length for an optimal tree */

    int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */
    int heap_len;               /* number of elements in the heap */
    int heap_max;               /* element of largest frequency */
    /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
     * The same heap array is used to build all trees.
     */

    uch depth[2*L_CODES+1];
    /* Depth of each subtree used as tie breaker for trees of equal frequency
     */

    uchf *l_buf;          /* buffer for literals or lengths */

    uInt  lit_bufsize;
    /* Size of match buffer for literals/lengths.  There are 4 reasons for
     * limiting lit_bufsize to 64K:
     *   - frequencies can be kept in 16 bit counters
     *   - if compression is not successful for the first block, all input
     *     data is still in the window so we can still emit a stored block even
     *     when input comes from standard input.  (This can also be done for
     *     all blocks if lit_bufsize is not greater than 32K.)
     *   - if compression is not successful for a file smaller than 64K, we can
     *     even emit a stored file instead of a stored block (saving 5 bytes).
     *     This is applicable only for zip (not gzip or zlib).
     *   - creating new Huffman trees less frequently may not provide fast
     *     adaptation to changes in the input data statistics. (Take for
     *     example a binary file with poorly compressible code followed by
     *     a highly compressible string table.) Smaller buffer sizes give
     *     fast adaptation but have of course the overhead of transmitting
     *     trees more frequently.
     *   - I can't count above 4
     */

    uInt last_lit;      /* running index in l_buf */

    ushf *d_buf;
    /* Buffer for distances. To simplify the code, d_buf and l_buf have
     * the same number of elements. To use different lengths, an extra flag
     * array would be necessary.
     */

    ulg opt_len;        /* bit length of current block with optimal trees */
    ulg static_len;     /* bit length of current block with static trees */
    uInt matches;       /* number of string matches in current block */
    int last_eob_len;   /* bit length of EOB code for last block */

#ifdef DEBUG
    ulg compressed_len; /* total bit length of compressed file mod 2^32 */
    ulg bits_sent;      /* bit length of compressed data sent mod 2^32 */
#endif

    ush bi_buf;
    /* Output buffer. bits are inserted starting at the bottom (least
     * significant bits).
     */
    int bi_valid;
    /* Number of valid bits in bi_buf.  All bits above the last valid bit
     * are always zero.
     */

    ulg high_water;
    /* High water mark offset in window for initialized bytes -- bytes above
     * this are set to zero in order to avoid memory check warnings when
     * longest match routines access bytes past the input.  This is then
     * updated to the new high water mark.
     */

} FAR deflate_state;

/* Output a byte on the stream.
 * IN assertion: there is enough room in pending_buf.
 */
#define put_byte(s, c) {s->pending_buf[s->pending++] = (c);}


#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/* Minimum amount of lookahead, except at the end of the input file.
 * See deflate.c for comments about the MIN_MATCH+1.
 */

#define MAX_DIST(s)  ((s)->w_size-MIN_LOOKAHEAD)
/* In order to simplify the code, particularly on 16 bit machines, match
 * distances are limited to MAX_DIST instead of WSIZE.
 */

#define WIN_INIT MAX_MATCH
/* Number of bytes after end of data in window to initialize in order to avoid
   memory checker errors from longest match routines */

        /* in trees.c */
void ZLIB_INTERNAL _tr_init OF((deflate_state *s));
int ZLIB_INTERNAL _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
void ZLIB_INTERNAL _tr_flush_block OF((deflate_state *s, charf *buf,
                        ulg stored_len, int last));
void ZLIB_INTERNAL _tr_align OF((deflate_state *s));
void ZLIB_INTERNAL _tr_stored_block OF((deflate_state *s, charf *buf,
                        ulg stored_len, int last));

#define d_code(dist) \
   ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
/* Mapping from a distance to a distance code. dist is the distance - 1 and
 * must not have side effects. _dist_code[256] and _dist_code[257] are never
 * used.
 */

#ifndef DEBUG
/* Inline versions of _tr_tally for speed: */

#if defined(GEN_TREES_H) || !defined(STDC)
  extern uch ZLIB_INTERNAL _length_code[];
  extern uch ZLIB_INTERNAL _dist_code[];
#else
  extern const uch ZLIB_INTERNAL _length_code[];
  extern const uch ZLIB_INTERNAL _dist_code[];
#endif

# define _tr_tally_lit(s, c, flush) \
  { uch cc = (c); \
    s->d_buf[s->last_lit] = 0; \
    s->l_buf[s->last_lit++] = cc; \
    s->dyn_ltree[cc].Freq++; \
    flush = (s->last_lit == s->lit_bufsize-1); \
   }
# define _tr_tally_dist(s, distance, length, flush) \
  { uch len = (length); \
    ush dist = (distance); \
    s->d_buf[s->last_lit] = dist; \
    s->l_buf[s->last_lit++] = len; \
    dist--; \
    s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
    s->dyn_dtree[d_code(dist)].Freq++; \
    flush = (s->last_lit == s->lit_bufsize-1); \
  }
#else
# define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c)
# define _tr_tally_dist(s, distance, length, flush) \
              flush = _tr_tally(s, distance, length)
#endif

#endif /* DEFLATE_H */
cfitsio-3.47/zlib/infback.c0000644000225700000360000005413613464573432015122 0ustar  cagordonlhea/* infback.c -- inflate using a call-back interface
 * Copyright (C) 1995-2009 Mark Adler
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

/*
   This code is largely copied from inflate.c.  Normally either infback.o or
   inflate.o would be linked into an application--not both.  The interface
   with inffast.c is retained so that optimized assembler-coded versions of
   inflate_fast() can be used with either inflate.c or infback.c.
 */

#include "zutil.h"
#include "inftrees.h"
#include "inflate.h"
#include "inffast.h"

/* function prototypes */
local void fixedtables OF((struct inflate_state FAR *state));

/*
   strm provides memory allocation functions in zalloc and zfree, or
   Z_NULL to use the library memory allocation functions.

   windowBits is in the range 8..15, and window is a user-supplied
   window and output buffer that is 2**windowBits bytes.
 */
int ZEXPORT inflateBackInit_(strm, windowBits, window, version, stream_size)
z_streamp strm;
int windowBits;
unsigned char FAR *window;
const char *version;
int stream_size;
{
    struct inflate_state FAR *state;

    if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
        stream_size != (int)(sizeof(z_stream)))
        return Z_VERSION_ERROR;
    if (strm == Z_NULL || window == Z_NULL ||
        windowBits < 8 || windowBits > 15)
        return Z_STREAM_ERROR;
    strm->msg = Z_NULL;                 /* in case we return an error */
    if (strm->zalloc == (alloc_func)0) {
        strm->zalloc = zcalloc;
        strm->opaque = (voidpf)0;
    }
    if (strm->zfree == (free_func)0) strm->zfree = zcfree;
    state = (struct inflate_state FAR *)ZALLOC(strm, 1,
                                               sizeof(struct inflate_state));
    if (state == Z_NULL) return Z_MEM_ERROR;
    Tracev((stderr, "inflate: allocated\n"));
    strm->state = (struct internal_state FAR *)state;
    state->dmax = 32768U;
    state->wbits = windowBits;
    state->wsize = 1U << windowBits;
    state->window = window;
    state->wnext = 0;
    state->whave = 0;
    return Z_OK;
}

/*
   Return state with length and distance decoding tables and index sizes set to
   fixed code decoding.  Normally this returns fixed tables from inffixed.h.
   If BUILDFIXED is defined, then instead this routine builds the tables the
   first time it's called, and returns those tables the first time and
   thereafter.  This reduces the size of the code by about 2K bytes, in
   exchange for a little execution time.  However, BUILDFIXED should not be
   used for threaded applications, since the rewriting of the tables and virgin
   may not be thread-safe.
 */
local void fixedtables(state)
struct inflate_state FAR *state;
{
#ifdef BUILDFIXED
    static int virgin = 1;
    static code *lenfix, *distfix;
    static code fixed[544];

    /* build fixed huffman tables if first call (may not be thread safe) */
    if (virgin) {
        unsigned sym, bits;
        static code *next;

        /* literal/length table */
        sym = 0;
        while (sym < 144) state->lens[sym++] = 8;
        while (sym < 256) state->lens[sym++] = 9;
        while (sym < 280) state->lens[sym++] = 7;
        while (sym < 288) state->lens[sym++] = 8;
        next = fixed;
        lenfix = next;
        bits = 9;
        inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);

        /* distance table */
        sym = 0;
        while (sym < 32) state->lens[sym++] = 5;
        distfix = next;
        bits = 5;
        inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);

        /* do this just once */
        virgin = 0;
    }
#else /* !BUILDFIXED */
#   include "inffixed.h"
#endif /* BUILDFIXED */
    state->lencode = lenfix;
    state->lenbits = 9;
    state->distcode = distfix;
    state->distbits = 5;
}

/* Macros for inflateBack(): */

/* Load returned state from inflate_fast() */
#define LOAD() \
    do { \
        put = strm->next_out; \
        left = strm->avail_out; \
        next = strm->next_in; \
        have = strm->avail_in; \
        hold = state->hold; \
        bits = state->bits; \
    } while (0)

/* Set state from registers for inflate_fast() */
#define RESTORE() \
    do { \
        strm->next_out = put; \
        strm->avail_out = left; \
        strm->next_in = next; \
        strm->avail_in = have; \
        state->hold = hold; \
        state->bits = bits; \
    } while (0)

/* Clear the input bit accumulator */
#define INITBITS() \
    do { \
        hold = 0; \
        bits = 0; \
    } while (0)

/* Assure that some input is available.  If input is requested, but denied,
   then return a Z_BUF_ERROR from inflateBack(). */
#define PULL() \
    do { \
        if (have == 0) { \
            have = in(in_desc, &next); \
            if (have == 0) { \
                next = Z_NULL; \
                ret = Z_BUF_ERROR; \
                goto inf_leave; \
            } \
        } \
    } while (0)

/* Get a byte of input into the bit accumulator, or return from inflateBack()
   with an error if there is no input available. */
#define PULLBYTE() \
    do { \
        PULL(); \
        have--; \
        hold += (unsigned long)(*next++) << bits; \
        bits += 8; \
    } while (0)

/* Assure that there are at least n bits in the bit accumulator.  If there is
   not enough available input to do that, then return from inflateBack() with
   an error. */
#define NEEDBITS(n) \
    do { \
        while (bits < (unsigned)(n)) \
            PULLBYTE(); \
    } while (0)

/* Return the low n bits of the bit accumulator (n < 16) */
#define BITS(n) \
    ((unsigned)hold & ((1U << (n)) - 1))

/* Remove n bits from the bit accumulator */
#define DROPBITS(n) \
    do { \
        hold >>= (n); \
        bits -= (unsigned)(n); \
    } while (0)

/* Remove zero to seven bits as needed to go to a byte boundary */
#define BYTEBITS() \
    do { \
        hold >>= bits & 7; \
        bits -= bits & 7; \
    } while (0)

/* Assure that some output space is available, by writing out the window
   if it's full.  If the write fails, return from inflateBack() with a
   Z_BUF_ERROR. */
#define ROOM() \
    do { \
        if (left == 0) { \
            put = state->window; \
            left = state->wsize; \
            state->whave = left; \
            if (out(out_desc, put, left)) { \
                ret = Z_BUF_ERROR; \
                goto inf_leave; \
            } \
        } \
    } while (0)

/*
   strm provides the memory allocation functions and window buffer on input,
   and provides information on the unused input on return.  For Z_DATA_ERROR
   returns, strm will also provide an error message.

   in() and out() are the call-back input and output functions.  When
   inflateBack() needs more input, it calls in().  When inflateBack() has
   filled the window with output, or when it completes with data in the
   window, it calls out() to write out the data.  The application must not
   change the provided input until in() is called again or inflateBack()
   returns.  The application must not change the window/output buffer until
   inflateBack() returns.

   in() and out() are called with a descriptor parameter provided in the
   inflateBack() call.  This parameter can be a structure that provides the
   information required to do the read or write, as well as accumulated
   information on the input and output such as totals and check values.

   in() should return zero on failure.  out() should return non-zero on
   failure.  If either in() or out() fails, than inflateBack() returns a
   Z_BUF_ERROR.  strm->next_in can be checked for Z_NULL to see whether it
   was in() or out() that caused in the error.  Otherwise,  inflateBack()
   returns Z_STREAM_END on success, Z_DATA_ERROR for an deflate format
   error, or Z_MEM_ERROR if it could not allocate memory for the state.
   inflateBack() can also return Z_STREAM_ERROR if the input parameters
   are not correct, i.e. strm is Z_NULL or the state was not initialized.
 */
int ZEXPORT inflateBack(strm, in, in_desc, out, out_desc)
z_streamp strm;
in_func in;
void FAR *in_desc;
out_func out;
void FAR *out_desc;
{
    struct inflate_state FAR *state;
    unsigned char FAR *next;    /* next input */
    unsigned char FAR *put;     /* next output */
    unsigned have, left;        /* available input and output */
    unsigned long hold;         /* bit buffer */
    unsigned bits;              /* bits in bit buffer */
    unsigned copy;              /* number of stored or match bytes to copy */
    unsigned char FAR *from;    /* where to copy match bytes from */
    code here;                  /* current decoding table entry */
    code last;                  /* parent table entry */
    unsigned len;               /* length to copy for repeats, bits to drop */
    int ret;                    /* return code */
    static const unsigned short order[19] = /* permutation of code lengths */
        {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};

    /* Check that the strm exists and that the state was initialized */
    if (strm == Z_NULL || strm->state == Z_NULL)
        return Z_STREAM_ERROR;
    state = (struct inflate_state FAR *)strm->state;

    /* Reset the state */
    strm->msg = Z_NULL;
    state->mode = TYPE;
    state->last = 0;
    state->whave = 0;
    next = strm->next_in;
    have = next != Z_NULL ? strm->avail_in : 0;
    hold = 0;
    bits = 0;
    put = state->window;
    left = state->wsize;

    /* Inflate until end of block marked as last */
    for (;;)
        switch (state->mode) {
        case TYPE:
            /* determine and dispatch block type */
            if (state->last) {
                BYTEBITS();
                state->mode = DONE;
                break;
            }
            NEEDBITS(3);
            state->last = BITS(1);
            DROPBITS(1);
            switch (BITS(2)) {
            case 0:                             /* stored block */
                Tracev((stderr, "inflate:     stored block%s\n",
                        state->last ? " (last)" : ""));
                state->mode = STORED;
                break;
            case 1:                             /* fixed block */
                fixedtables(state);
                Tracev((stderr, "inflate:     fixed codes block%s\n",
                        state->last ? " (last)" : ""));
                state->mode = LEN;              /* decode codes */
                break;
            case 2:                             /* dynamic block */
                Tracev((stderr, "inflate:     dynamic codes block%s\n",
                        state->last ? " (last)" : ""));
                state->mode = TABLE;
                break;
            case 3:
                strm->msg = (char *)"invalid block type";
                state->mode = BAD;
            }
            DROPBITS(2);
            break;

        case STORED:
            /* get and verify stored block length */
            BYTEBITS();                         /* go to byte boundary */
            NEEDBITS(32);
            if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
                strm->msg = (char *)"invalid stored block lengths";
                state->mode = BAD;
                break;
            }
            state->length = (unsigned)hold & 0xffff;
            Tracev((stderr, "inflate:       stored length %u\n",
                    state->length));
            INITBITS();

            /* copy stored block from input to output */
            while (state->length != 0) {
                copy = state->length;
                PULL();
                ROOM();
                if (copy > have) copy = have;
                if (copy > left) copy = left;
                zmemcpy(put, next, copy);
                have -= copy;
                next += copy;
                left -= copy;
                put += copy;
                state->length -= copy;
            }
            Tracev((stderr, "inflate:       stored end\n"));
            state->mode = TYPE;
            break;

        case TABLE:
            /* get dynamic table entries descriptor */
            NEEDBITS(14);
            state->nlen = BITS(5) + 257;
            DROPBITS(5);
            state->ndist = BITS(5) + 1;
            DROPBITS(5);
            state->ncode = BITS(4) + 4;
            DROPBITS(4);
#ifndef PKZIP_BUG_WORKAROUND
            if (state->nlen > 286 || state->ndist > 30) {
                strm->msg = (char *)"too many length or distance symbols";
                state->mode = BAD;
                break;
            }
#endif
            Tracev((stderr, "inflate:       table sizes ok\n"));

            /* get code length code lengths (not a typo) */
            state->have = 0;
            while (state->have < state->ncode) {
                NEEDBITS(3);
                state->lens[order[state->have++]] = (unsigned short)BITS(3);
                DROPBITS(3);
            }
            while (state->have < 19)
                state->lens[order[state->have++]] = 0;
            state->next = state->codes;
            state->lencode = (code const FAR *)(state->next);
            state->lenbits = 7;
            ret = inflate_table(CODES, state->lens, 19, &(state->next),
                                &(state->lenbits), state->work);
            if (ret) {
                strm->msg = (char *)"invalid code lengths set";
                state->mode = BAD;
                break;
            }
            Tracev((stderr, "inflate:       code lengths ok\n"));

            /* get length and distance code code lengths */
            state->have = 0;
            while (state->have < state->nlen + state->ndist) {
                for (;;) {
                    here = state->lencode[BITS(state->lenbits)];
                    if ((unsigned)(here.bits) <= bits) break;
                    PULLBYTE();
                }
                if (here.val < 16) {
                    NEEDBITS(here.bits);
                    DROPBITS(here.bits);
                    state->lens[state->have++] = here.val;
                }
                else {
                    if (here.val == 16) {
                        NEEDBITS(here.bits + 2);
                        DROPBITS(here.bits);
                        if (state->have == 0) {
                            strm->msg = (char *)"invalid bit length repeat";
                            state->mode = BAD;
                            break;
                        }
                        len = (unsigned)(state->lens[state->have - 1]);
                        copy = 3 + BITS(2);
                        DROPBITS(2);
                    }
                    else if (here.val == 17) {
                        NEEDBITS(here.bits + 3);
                        DROPBITS(here.bits);
                        len = 0;
                        copy = 3 + BITS(3);
                        DROPBITS(3);
                    }
                    else {
                        NEEDBITS(here.bits + 7);
                        DROPBITS(here.bits);
                        len = 0;
                        copy = 11 + BITS(7);
                        DROPBITS(7);
                    }
                    if (state->have + copy > state->nlen + state->ndist) {
                        strm->msg = (char *)"invalid bit length repeat";
                        state->mode = BAD;
                        break;
                    }
                    while (copy--)
                        state->lens[state->have++] = (unsigned short)len;
                }
            }

            /* handle error breaks in while */
            if (state->mode == BAD) break;

            /* check for end-of-block code (better have one) */
            if (state->lens[256] == 0) {
                strm->msg = (char *)"invalid code -- missing end-of-block";
                state->mode = BAD;
                break;
            }

            /* build code tables -- note: do not change the lenbits or distbits
               values here (9 and 6) without reading the comments in inftrees.h
               concerning the ENOUGH constants, which depend on those values */
            state->next = state->codes;
            state->lencode = (code const FAR *)(state->next);
            state->lenbits = 9;
            ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
                                &(state->lenbits), state->work);
            if (ret) {
                strm->msg = (char *)"invalid literal/lengths set";
                state->mode = BAD;
                break;
            }
            state->distcode = (code const FAR *)(state->next);
            state->distbits = 6;
            ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
                            &(state->next), &(state->distbits), state->work);
            if (ret) {
                strm->msg = (char *)"invalid distances set";
                state->mode = BAD;
                break;
            }
            Tracev((stderr, "inflate:       codes ok\n"));
            state->mode = LEN;

        case LEN:
            /* use inflate_fast() if we have enough input and output */
            if (have >= 6 && left >= 258) {
                RESTORE();
                if (state->whave < state->wsize)
                    state->whave = state->wsize - left;
                inflate_fast(strm, state->wsize);
                LOAD();
                break;
            }

            /* get a literal, length, or end-of-block code */
            for (;;) {
                here = state->lencode[BITS(state->lenbits)];
                if ((unsigned)(here.bits) <= bits) break;
                PULLBYTE();
            }
            if (here.op && (here.op & 0xf0) == 0) {
                last = here;
                for (;;) {
                    here = state->lencode[last.val +
                            (BITS(last.bits + last.op) >> last.bits)];
                    if ((unsigned)(last.bits + here.bits) <= bits) break;
                    PULLBYTE();
                }
                DROPBITS(last.bits);
            }
            DROPBITS(here.bits);
            state->length = (unsigned)here.val;

            /* process literal */
            if (here.op == 0) {
                Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
                        "inflate:         literal '%c'\n" :
                        "inflate:         literal 0x%02x\n", here.val));
                ROOM();
                *put++ = (unsigned char)(state->length);
                left--;
                state->mode = LEN;
                break;
            }

            /* process end of block */
            if (here.op & 32) {
                Tracevv((stderr, "inflate:         end of block\n"));
                state->mode = TYPE;
                break;
            }

            /* invalid code */
            if (here.op & 64) {
                strm->msg = (char *)"invalid literal/length code";
                state->mode = BAD;
                break;
            }

            /* length code -- get extra bits, if any */
            state->extra = (unsigned)(here.op) & 15;
            if (state->extra != 0) {
                NEEDBITS(state->extra);
                state->length += BITS(state->extra);
                DROPBITS(state->extra);
            }
            Tracevv((stderr, "inflate:         length %u\n", state->length));

            /* get distance code */
            for (;;) {
                here = state->distcode[BITS(state->distbits)];
                if ((unsigned)(here.bits) <= bits) break;
                PULLBYTE();
            }
            if ((here.op & 0xf0) == 0) {
                last = here;
                for (;;) {
                    here = state->distcode[last.val +
                            (BITS(last.bits + last.op) >> last.bits)];
                    if ((unsigned)(last.bits + here.bits) <= bits) break;
                    PULLBYTE();
                }
                DROPBITS(last.bits);
            }
            DROPBITS(here.bits);
            if (here.op & 64) {
                strm->msg = (char *)"invalid distance code";
                state->mode = BAD;
                break;
            }
            state->offset = (unsigned)here.val;

            /* get distance extra bits, if any */
            state->extra = (unsigned)(here.op) & 15;
            if (state->extra != 0) {
                NEEDBITS(state->extra);
                state->offset += BITS(state->extra);
                DROPBITS(state->extra);
            }
            if (state->offset > state->wsize - (state->whave < state->wsize ?
                                                left : 0)) {
                strm->msg = (char *)"invalid distance too far back";
                state->mode = BAD;
                break;
            }
            Tracevv((stderr, "inflate:         distance %u\n", state->offset));

            /* copy match from window to output */
            do {
                ROOM();
                copy = state->wsize - state->offset;
                if (copy < left) {
                    from = put + copy;
                    copy = left - copy;
                }
                else {
                    from = put - state->offset;
                    copy = left;
                }
                if (copy > state->length) copy = state->length;
                state->length -= copy;
                left -= copy;
                do {
                    *put++ = *from++;
                } while (--copy);
            } while (state->length != 0);
            break;

        case DONE:
            /* inflate stream terminated properly -- write leftover output */
            ret = Z_STREAM_END;
            if (left < state->wsize) {
                if (out(out_desc, state->window, state->wsize - left))
                    ret = Z_BUF_ERROR;
            }
            goto inf_leave;

        case BAD:
            ret = Z_DATA_ERROR;
            goto inf_leave;

        default:                /* can't happen, but makes compilers happy */
            ret = Z_STREAM_ERROR;
            goto inf_leave;
        }

    /* Return unused input */
  inf_leave:
    strm->next_in = next;
    strm->avail_in = have;
    return ret;
}

int ZEXPORT inflateBackEnd(strm)
z_streamp strm;
{
    if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
        return Z_STREAM_ERROR;
    ZFREE(strm, strm->state);
    strm->state = Z_NULL;
    Tracev((stderr, "inflate: end\n"));
    return Z_OK;
}
cfitsio-3.47/zlib/inffast.c0000644000225700000360000003217713464573432015160 0ustar  cagordonlhea/* inffast.c -- fast decoding
 * Copyright (C) 1995-2008, 2010 Mark Adler
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

#include "zutil.h"
#include "inftrees.h"
#include "inflate.h"
#include "inffast.h"

#ifndef ASMINF

/* Allow machine dependent optimization for post-increment or pre-increment.
   Based on testing to date,
   Pre-increment preferred for:
   - PowerPC G3 (Adler)
   - MIPS R5000 (Randers-Pehrson)
   Post-increment preferred for:
   - none
   No measurable difference:
   - Pentium III (Anderson)
   - M68060 (Nikl)
 */
#ifdef POSTINC
#  define OFF 0
#  define PUP(a) *(a)++
#else
#  define OFF 1
#  define PUP(a) *++(a)
#endif

/*
   Decode literal, length, and distance codes and write out the resulting
   literal and match bytes until either not enough input or output is
   available, an end-of-block is encountered, or a data error is encountered.
   When large enough input and output buffers are supplied to inflate(), for
   example, a 16K input buffer and a 64K output buffer, more than 95% of the
   inflate execution time is spent in this routine.

   Entry assumptions:

        state->mode == LEN
        strm->avail_in >= 6
        strm->avail_out >= 258
        start >= strm->avail_out
        state->bits < 8

   On return, state->mode is one of:

        LEN -- ran out of enough output space or enough available input
        TYPE -- reached end of block code, inflate() to interpret next block
        BAD -- error in block data

   Notes:

    - The maximum input bits used by a length/distance pair is 15 bits for the
      length code, 5 bits for the length extra, 15 bits for the distance code,
      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.
      Therefore if strm->avail_in >= 6, then there is enough input to avoid
      checking for available input while decoding.

    - The maximum bytes that a single length/distance pair can output is 258
      bytes, which is the maximum length that can be coded.  inflate_fast()
      requires strm->avail_out >= 258 for each loop to avoid checking for
      output space.
 */
void ZLIB_INTERNAL inflate_fast(strm, start)
z_streamp strm;
unsigned start;         /* inflate()'s starting value for strm->avail_out */
{
    struct inflate_state FAR *state;
    unsigned char FAR *in;      /* local strm->next_in */
    unsigned char FAR *last;    /* while in < last, enough input available */
    unsigned char FAR *out;     /* local strm->next_out */
    unsigned char FAR *beg;     /* inflate()'s initial strm->next_out */
    unsigned char FAR *end;     /* while out < end, enough space available */
#ifdef INFLATE_STRICT
    unsigned dmax;              /* maximum distance from zlib header */
#endif
    unsigned wsize;             /* window size or zero if not using window */
    unsigned whave;             /* valid bytes in the window */
    unsigned wnext;             /* window write index */
    unsigned char FAR *window;  /* allocated sliding window, if wsize != 0 */
    unsigned long hold;         /* local strm->hold */
    unsigned bits;              /* local strm->bits */
    code const FAR *lcode;      /* local strm->lencode */
    code const FAR *dcode;      /* local strm->distcode */
    unsigned lmask;             /* mask for first level of length codes */
    unsigned dmask;             /* mask for first level of distance codes */
    code here;                  /* retrieved table entry */
    unsigned op;                /* code bits, operation, extra bits, or */
                                /*  window position, window bytes to copy */
    unsigned len;               /* match length, unused bytes */
    unsigned dist;              /* match distance */
    unsigned char FAR *from;    /* where to copy match from */

    /* copy state to local variables */
    state = (struct inflate_state FAR *)strm->state;
    in = strm->next_in - OFF;
    last = in + (strm->avail_in - 5);
    out = strm->next_out - OFF;
    beg = out - (start - strm->avail_out);
    end = out + (strm->avail_out - 257);
#ifdef INFLATE_STRICT
    dmax = state->dmax;
#endif
    wsize = state->wsize;
    whave = state->whave;
    wnext = state->wnext;
    window = state->window;
    hold = state->hold;
    bits = state->bits;
    lcode = state->lencode;
    dcode = state->distcode;
    lmask = (1U << state->lenbits) - 1;
    dmask = (1U << state->distbits) - 1;

    /* decode literals and length/distances until end-of-block or not enough
       input data or output space */
    do {
        if (bits < 15) {
            hold += (unsigned long)(PUP(in)) << bits;
            bits += 8;
            hold += (unsigned long)(PUP(in)) << bits;
            bits += 8;
        }
        here = lcode[hold & lmask];
      dolen:
        op = (unsigned)(here.bits);
        hold >>= op;
        bits -= op;
        op = (unsigned)(here.op);
        if (op == 0) {                          /* literal */
            Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
                    "inflate:         literal '%c'\n" :
                    "inflate:         literal 0x%02x\n", here.val));
            PUP(out) = (unsigned char)(here.val);
        }
        else if (op & 16) {                     /* length base */
            len = (unsigned)(here.val);
            op &= 15;                           /* number of extra bits */
            if (op) {
                if (bits < op) {
                    hold += (unsigned long)(PUP(in)) << bits;
                    bits += 8;
                }
                len += (unsigned)hold & ((1U << op) - 1);
                hold >>= op;
                bits -= op;
            }
            Tracevv((stderr, "inflate:         length %u\n", len));
            if (bits < 15) {
                hold += (unsigned long)(PUP(in)) << bits;
                bits += 8;
                hold += (unsigned long)(PUP(in)) << bits;
                bits += 8;
            }
            here = dcode[hold & dmask];
          dodist:
            op = (unsigned)(here.bits);
            hold >>= op;
            bits -= op;
            op = (unsigned)(here.op);
            if (op & 16) {                      /* distance base */
                dist = (unsigned)(here.val);
                op &= 15;                       /* number of extra bits */
                if (bits < op) {
                    hold += (unsigned long)(PUP(in)) << bits;
                    bits += 8;
                    if (bits < op) {
                        hold += (unsigned long)(PUP(in)) << bits;
                        bits += 8;
                    }
                }
                dist += (unsigned)hold & ((1U << op) - 1);
#ifdef INFLATE_STRICT
                if (dist > dmax) {
                    strm->msg = (char *)"invalid distance too far back";
                    state->mode = BAD;
                    break;
                }
#endif
                hold >>= op;
                bits -= op;
                Tracevv((stderr, "inflate:         distance %u\n", dist));
                op = (unsigned)(out - beg);     /* max distance in output */
                if (dist > op) {                /* see if copy from window */
                    op = dist - op;             /* distance back in window */
                    if (op > whave) {
                        if (state->sane) {
                            strm->msg =
                                (char *)"invalid distance too far back";
                            state->mode = BAD;
                            break;
                        }
#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
                        if (len <= op - whave) {
                            do {
                                PUP(out) = 0;
                            } while (--len);
                            continue;
                        }
                        len -= op - whave;
                        do {
                            PUP(out) = 0;
                        } while (--op > whave);
                        if (op == 0) {
                            from = out - dist;
                            do {
                                PUP(out) = PUP(from);
                            } while (--len);
                            continue;
                        }
#endif
                    }
                    from = window - OFF;
                    if (wnext == 0) {           /* very common case */
                        from += wsize - op;
                        if (op < len) {         /* some from window */
                            len -= op;
                            do {
                                PUP(out) = PUP(from);
                            } while (--op);
                            from = out - dist;  /* rest from output */
                        }
                    }
                    else if (wnext < op) {      /* wrap around window */
                        from += wsize + wnext - op;
                        op -= wnext;
                        if (op < len) {         /* some from end of window */
                            len -= op;
                            do {
                                PUP(out) = PUP(from);
                            } while (--op);
                            from = window - OFF;
                            if (wnext < len) {  /* some from start of window */
                                op = wnext;
                                len -= op;
                                do {
                                    PUP(out) = PUP(from);
                                } while (--op);
                                from = out - dist;      /* rest from output */
                            }
                        }
                    }
                    else {                      /* contiguous in window */
                        from += wnext - op;
                        if (op < len) {         /* some from window */
                            len -= op;
                            do {
                                PUP(out) = PUP(from);
                            } while (--op);
                            from = out - dist;  /* rest from output */
                        }
                    }
                    while (len > 2) {
                        PUP(out) = PUP(from);
                        PUP(out) = PUP(from);
                        PUP(out) = PUP(from);
                        len -= 3;
                    }
                    if (len) {
                        PUP(out) = PUP(from);
                        if (len > 1)
                            PUP(out) = PUP(from);
                    }
                }
                else {
                    from = out - dist;          /* copy direct from output */
                    do {                        /* minimum length is three */
                        PUP(out) = PUP(from);
                        PUP(out) = PUP(from);
                        PUP(out) = PUP(from);
                        len -= 3;
                    } while (len > 2);
                    if (len) {
                        PUP(out) = PUP(from);
                        if (len > 1)
                            PUP(out) = PUP(from);
                    }
                }
            }
            else if ((op & 64) == 0) {          /* 2nd level distance code */
                here = dcode[here.val + (hold & ((1U << op) - 1))];
                goto dodist;
            }
            else {
                strm->msg = (char *)"invalid distance code";
                state->mode = BAD;
                break;
            }
        }
        else if ((op & 64) == 0) {              /* 2nd level length code */
            here = lcode[here.val + (hold & ((1U << op) - 1))];
            goto dolen;
        }
        else if (op & 32) {                     /* end-of-block */
            Tracevv((stderr, "inflate:         end of block\n"));
            state->mode = TYPE;
            break;
        }
        else {
            strm->msg = (char *)"invalid literal/length code";
            state->mode = BAD;
            break;
        }
    } while (in < last && out < end);

    /* return unused bytes (on entry, bits < 8, so in won't go too far back) */
    len = bits >> 3;
    in -= len;
    bits -= len << 3;
    hold &= (1U << bits) - 1;

    /* update state and return */
    strm->next_in = in + OFF;
    strm->next_out = out + OFF;
    strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
    strm->avail_out = (unsigned)(out < end ?
                                 257 + (end - out) : 257 - (out - end));
    state->hold = hold;
    state->bits = bits;
    return;
}

/*
   inflate_fast() speedups that turned out slower (on a PowerPC G3 750CXe):
   - Using bit fields for code structure
   - Different op definition to avoid & for extra bits (do & for table bits)
   - Three separate decoding do-loops for direct, window, and wnext == 0
   - Special case for distance > 1 copies to do overlapped load and store copy
   - Explicit branch predictions (based on measured branch probabilities)
   - Deferring match copy and interspersed it with decoding subsequent codes
   - Swapping literal/length else
   - Swapping window/direct else
   - Larger unrolled copy loops (three is about right)
   - Moving len -= 3 statement into middle of loop
 */

#endif /* !ASMINF */
cfitsio-3.47/zlib/inffast.h0000644000225700000360000000065313464573432015157 0ustar  cagordonlhea/* inffast.h -- header to use inffast.c
 * Copyright (C) 1995-2003, 2010 Mark Adler
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

/* WARNING: this file should *not* be used by applications. It is
   part of the implementation of the compression library and is
   subject to change. Applications should only use zlib.h.
 */

void ZLIB_INTERNAL inflate_fast OF((z_streamp strm, unsigned start));
cfitsio-3.47/zlib/inffixed.h0000644000225700000360000001430713464573432015322 0ustar  cagordonlhea    /* inffixed.h -- table for decoding fixed codes
     * Generated automatically by makefixed().
     */

    /* WARNING: this file should *not* be used by applications. It
       is part of the implementation of the compression library and
       is subject to change. Applications should only use zlib.h.
     */

    static const code lenfix[512] = {
        {96,7,0},{0,8,80},{0,8,16},{20,8,115},{18,7,31},{0,8,112},{0,8,48},
        {0,9,192},{16,7,10},{0,8,96},{0,8,32},{0,9,160},{0,8,0},{0,8,128},
        {0,8,64},{0,9,224},{16,7,6},{0,8,88},{0,8,24},{0,9,144},{19,7,59},
        {0,8,120},{0,8,56},{0,9,208},{17,7,17},{0,8,104},{0,8,40},{0,9,176},
        {0,8,8},{0,8,136},{0,8,72},{0,9,240},{16,7,4},{0,8,84},{0,8,20},
        {21,8,227},{19,7,43},{0,8,116},{0,8,52},{0,9,200},{17,7,13},{0,8,100},
        {0,8,36},{0,9,168},{0,8,4},{0,8,132},{0,8,68},{0,9,232},{16,7,8},
        {0,8,92},{0,8,28},{0,9,152},{20,7,83},{0,8,124},{0,8,60},{0,9,216},
        {18,7,23},{0,8,108},{0,8,44},{0,9,184},{0,8,12},{0,8,140},{0,8,76},
        {0,9,248},{16,7,3},{0,8,82},{0,8,18},{21,8,163},{19,7,35},{0,8,114},
        {0,8,50},{0,9,196},{17,7,11},{0,8,98},{0,8,34},{0,9,164},{0,8,2},
        {0,8,130},{0,8,66},{0,9,228},{16,7,7},{0,8,90},{0,8,26},{0,9,148},
        {20,7,67},{0,8,122},{0,8,58},{0,9,212},{18,7,19},{0,8,106},{0,8,42},
        {0,9,180},{0,8,10},{0,8,138},{0,8,74},{0,9,244},{16,7,5},{0,8,86},
        {0,8,22},{64,8,0},{19,7,51},{0,8,118},{0,8,54},{0,9,204},{17,7,15},
        {0,8,102},{0,8,38},{0,9,172},{0,8,6},{0,8,134},{0,8,70},{0,9,236},
        {16,7,9},{0,8,94},{0,8,30},{0,9,156},{20,7,99},{0,8,126},{0,8,62},
        {0,9,220},{18,7,27},{0,8,110},{0,8,46},{0,9,188},{0,8,14},{0,8,142},
        {0,8,78},{0,9,252},{96,7,0},{0,8,81},{0,8,17},{21,8,131},{18,7,31},
        {0,8,113},{0,8,49},{0,9,194},{16,7,10},{0,8,97},{0,8,33},{0,9,162},
        {0,8,1},{0,8,129},{0,8,65},{0,9,226},{16,7,6},{0,8,89},{0,8,25},
        {0,9,146},{19,7,59},{0,8,121},{0,8,57},{0,9,210},{17,7,17},{0,8,105},
        {0,8,41},{0,9,178},{0,8,9},{0,8,137},{0,8,73},{0,9,242},{16,7,4},
        {0,8,85},{0,8,21},{16,8,258},{19,7,43},{0,8,117},{0,8,53},{0,9,202},
        {17,7,13},{0,8,101},{0,8,37},{0,9,170},{0,8,5},{0,8,133},{0,8,69},
        {0,9,234},{16,7,8},{0,8,93},{0,8,29},{0,9,154},{20,7,83},{0,8,125},
        {0,8,61},{0,9,218},{18,7,23},{0,8,109},{0,8,45},{0,9,186},{0,8,13},
        {0,8,141},{0,8,77},{0,9,250},{16,7,3},{0,8,83},{0,8,19},{21,8,195},
        {19,7,35},{0,8,115},{0,8,51},{0,9,198},{17,7,11},{0,8,99},{0,8,35},
        {0,9,166},{0,8,3},{0,8,131},{0,8,67},{0,9,230},{16,7,7},{0,8,91},
        {0,8,27},{0,9,150},{20,7,67},{0,8,123},{0,8,59},{0,9,214},{18,7,19},
        {0,8,107},{0,8,43},{0,9,182},{0,8,11},{0,8,139},{0,8,75},{0,9,246},
        {16,7,5},{0,8,87},{0,8,23},{64,8,0},{19,7,51},{0,8,119},{0,8,55},
        {0,9,206},{17,7,15},{0,8,103},{0,8,39},{0,9,174},{0,8,7},{0,8,135},
        {0,8,71},{0,9,238},{16,7,9},{0,8,95},{0,8,31},{0,9,158},{20,7,99},
        {0,8,127},{0,8,63},{0,9,222},{18,7,27},{0,8,111},{0,8,47},{0,9,190},
        {0,8,15},{0,8,143},{0,8,79},{0,9,254},{96,7,0},{0,8,80},{0,8,16},
        {20,8,115},{18,7,31},{0,8,112},{0,8,48},{0,9,193},{16,7,10},{0,8,96},
        {0,8,32},{0,9,161},{0,8,0},{0,8,128},{0,8,64},{0,9,225},{16,7,6},
        {0,8,88},{0,8,24},{0,9,145},{19,7,59},{0,8,120},{0,8,56},{0,9,209},
        {17,7,17},{0,8,104},{0,8,40},{0,9,177},{0,8,8},{0,8,136},{0,8,72},
        {0,9,241},{16,7,4},{0,8,84},{0,8,20},{21,8,227},{19,7,43},{0,8,116},
        {0,8,52},{0,9,201},{17,7,13},{0,8,100},{0,8,36},{0,9,169},{0,8,4},
        {0,8,132},{0,8,68},{0,9,233},{16,7,8},{0,8,92},{0,8,28},{0,9,153},
        {20,7,83},{0,8,124},{0,8,60},{0,9,217},{18,7,23},{0,8,108},{0,8,44},
        {0,9,185},{0,8,12},{0,8,140},{0,8,76},{0,9,249},{16,7,3},{0,8,82},
        {0,8,18},{21,8,163},{19,7,35},{0,8,114},{0,8,50},{0,9,197},{17,7,11},
        {0,8,98},{0,8,34},{0,9,165},{0,8,2},{0,8,130},{0,8,66},{0,9,229},
        {16,7,7},{0,8,90},{0,8,26},{0,9,149},{20,7,67},{0,8,122},{0,8,58},
        {0,9,213},{18,7,19},{0,8,106},{0,8,42},{0,9,181},{0,8,10},{0,8,138},
        {0,8,74},{0,9,245},{16,7,5},{0,8,86},{0,8,22},{64,8,0},{19,7,51},
        {0,8,118},{0,8,54},{0,9,205},{17,7,15},{0,8,102},{0,8,38},{0,9,173},
        {0,8,6},{0,8,134},{0,8,70},{0,9,237},{16,7,9},{0,8,94},{0,8,30},
        {0,9,157},{20,7,99},{0,8,126},{0,8,62},{0,9,221},{18,7,27},{0,8,110},
        {0,8,46},{0,9,189},{0,8,14},{0,8,142},{0,8,78},{0,9,253},{96,7,0},
        {0,8,81},{0,8,17},{21,8,131},{18,7,31},{0,8,113},{0,8,49},{0,9,195},
        {16,7,10},{0,8,97},{0,8,33},{0,9,163},{0,8,1},{0,8,129},{0,8,65},
        {0,9,227},{16,7,6},{0,8,89},{0,8,25},{0,9,147},{19,7,59},{0,8,121},
        {0,8,57},{0,9,211},{17,7,17},{0,8,105},{0,8,41},{0,9,179},{0,8,9},
        {0,8,137},{0,8,73},{0,9,243},{16,7,4},{0,8,85},{0,8,21},{16,8,258},
        {19,7,43},{0,8,117},{0,8,53},{0,9,203},{17,7,13},{0,8,101},{0,8,37},
        {0,9,171},{0,8,5},{0,8,133},{0,8,69},{0,9,235},{16,7,8},{0,8,93},
        {0,8,29},{0,9,155},{20,7,83},{0,8,125},{0,8,61},{0,9,219},{18,7,23},
        {0,8,109},{0,8,45},{0,9,187},{0,8,13},{0,8,141},{0,8,77},{0,9,251},
        {16,7,3},{0,8,83},{0,8,19},{21,8,195},{19,7,35},{0,8,115},{0,8,51},
        {0,9,199},{17,7,11},{0,8,99},{0,8,35},{0,9,167},{0,8,3},{0,8,131},
        {0,8,67},{0,9,231},{16,7,7},{0,8,91},{0,8,27},{0,9,151},{20,7,67},
        {0,8,123},{0,8,59},{0,9,215},{18,7,19},{0,8,107},{0,8,43},{0,9,183},
        {0,8,11},{0,8,139},{0,8,75},{0,9,247},{16,7,5},{0,8,87},{0,8,23},
        {64,8,0},{19,7,51},{0,8,119},{0,8,55},{0,9,207},{17,7,15},{0,8,103},
        {0,8,39},{0,9,175},{0,8,7},{0,8,135},{0,8,71},{0,9,239},{16,7,9},
        {0,8,95},{0,8,31},{0,9,159},{20,7,99},{0,8,127},{0,8,63},{0,9,223},
        {18,7,27},{0,8,111},{0,8,47},{0,9,191},{0,8,15},{0,8,143},{0,8,79},
        {0,9,255}
    };

    static const code distfix[32] = {
        {16,5,1},{23,5,257},{19,5,17},{27,5,4097},{17,5,5},{25,5,1025},
        {21,5,65},{29,5,16385},{16,5,3},{24,5,513},{20,5,33},{28,5,8193},
        {18,5,9},{26,5,2049},{22,5,129},{64,5,0},{16,5,2},{23,5,385},
        {19,5,25},{27,5,6145},{17,5,7},{25,5,1537},{21,5,97},{29,5,24577},
        {16,5,4},{24,5,769},{20,5,49},{28,5,12289},{18,5,13},{26,5,3073},
        {22,5,193},{64,5,0}
    };
cfitsio-3.47/zlib/inflate.c0000644000225700000360000014661713464573432015155 0ustar  cagordonlhea/* inflate.c -- zlib decompression
 * Copyright (C) 1995-2010 Mark Adler
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

/*
 * Change history:
 *
 * 1.2.beta0    24 Nov 2002
 * - First version -- complete rewrite of inflate to simplify code, avoid
 *   creation of window when not needed, minimize use of window when it is
 *   needed, make inffast.c even faster, implement gzip decoding, and to
 *   improve code readability and style over the previous zlib inflate code
 *
 * 1.2.beta1    25 Nov 2002
 * - Use pointers for available input and output checking in inffast.c
 * - Remove input and output counters in inffast.c
 * - Change inffast.c entry and loop from avail_in >= 7 to >= 6
 * - Remove unnecessary second byte pull from length extra in inffast.c
 * - Unroll direct copy to three copies per loop in inffast.c
 *
 * 1.2.beta2    4 Dec 2002
 * - Change external routine names to reduce potential conflicts
 * - Correct filename to inffixed.h for fixed tables in inflate.c
 * - Make hbuf[] unsigned char to match parameter type in inflate.c
 * - Change strm->next_out[-state->offset] to *(strm->next_out - state->offset)
 *   to avoid negation problem on Alphas (64 bit) in inflate.c
 *
 * 1.2.beta3    22 Dec 2002
 * - Add comments on state->bits assertion in inffast.c
 * - Add comments on op field in inftrees.h
 * - Fix bug in reuse of allocated window after inflateReset()
 * - Remove bit fields--back to byte structure for speed
 * - Remove distance extra == 0 check in inflate_fast()--only helps for lengths
 * - Change post-increments to pre-increments in inflate_fast(), PPC biased?
 * - Add compile time option, POSTINC, to use post-increments instead (Intel?)
 * - Make MATCH copy in inflate() much faster for when inflate_fast() not used
 * - Use local copies of stream next and avail values, as well as local bit
 *   buffer and bit count in inflate()--for speed when inflate_fast() not used
 *
 * 1.2.beta4    1 Jan 2003
 * - Split ptr - 257 statements in inflate_table() to avoid compiler warnings
 * - Move a comment on output buffer sizes from inffast.c to inflate.c
 * - Add comments in inffast.c to introduce the inflate_fast() routine
 * - Rearrange window copies in inflate_fast() for speed and simplification
 * - Unroll last copy for window match in inflate_fast()
 * - Use local copies of window variables in inflate_fast() for speed
 * - Pull out common wnext == 0 case for speed in inflate_fast()
 * - Make op and len in inflate_fast() unsigned for consistency
 * - Add FAR to lcode and dcode declarations in inflate_fast()
 * - Simplified bad distance check in inflate_fast()
 * - Added inflateBackInit(), inflateBack(), and inflateBackEnd() in new
 *   source file infback.c to provide a call-back interface to inflate for
 *   programs like gzip and unzip -- uses window as output buffer to avoid
 *   window copying
 *
 * 1.2.beta5    1 Jan 2003
 * - Improved inflateBack() interface to allow the caller to provide initial
 *   input in strm.
 * - Fixed stored blocks bug in inflateBack()
 *
 * 1.2.beta6    4 Jan 2003
 * - Added comments in inffast.c on effectiveness of POSTINC
 * - Typecasting all around to reduce compiler warnings
 * - Changed loops from while (1) or do {} while (1) to for (;;), again to
 *   make compilers happy
 * - Changed type of window in inflateBackInit() to unsigned char *
 *
 * 1.2.beta7    27 Jan 2003
 * - Changed many types to unsigned or unsigned short to avoid warnings
 * - Added inflateCopy() function
 *
 * 1.2.0        9 Mar 2003
 * - Changed inflateBack() interface to provide separate opaque descriptors
 *   for the in() and out() functions
 * - Changed inflateBack() argument and in_func typedef to swap the length
 *   and buffer address return values for the input function
 * - Check next_in and next_out for Z_NULL on entry to inflate()
 *
 * The history for versions after 1.2.0 are in ChangeLog in zlib distribution.
 */

#include "zutil.h"
#include "inftrees.h"
#include "inflate.h"
#include "inffast.h"

#ifdef MAKEFIXED
#  ifndef BUILDFIXED
#    define BUILDFIXED
#  endif
#endif

/* function prototypes */
local void fixedtables OF((struct inflate_state FAR *state));
local int updatewindow OF((z_streamp strm, unsigned out));
#ifdef BUILDFIXED
   void makefixed OF((void));
#endif
local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
                              unsigned len));

int ZEXPORT inflateReset(strm)
z_streamp strm;
{
    struct inflate_state FAR *state;

    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
    state = (struct inflate_state FAR *)strm->state;
    strm->total_in = strm->total_out = state->total = 0;
    strm->msg = Z_NULL;
    strm->adler = 1;        /* to support ill-conceived Java test suite */
    state->mode = HEAD;
    state->last = 0;
    state->havedict = 0;
    state->dmax = 32768U;
    state->head = Z_NULL;
    state->wsize = 0;
    state->whave = 0;
    state->wnext = 0;
    state->hold = 0;
    state->bits = 0;
    state->lencode = state->distcode = state->next = state->codes;
    state->sane = 1;
    state->back = -1;
    Tracev((stderr, "inflate: reset\n"));
    return Z_OK;
}

int ZEXPORT inflateReset2(strm, windowBits)
z_streamp strm;
int windowBits;
{
    int wrap;
    struct inflate_state FAR *state;

    /* get the state */
    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
    state = (struct inflate_state FAR *)strm->state;

    /* extract wrap request from windowBits parameter */
    if (windowBits < 0) {
        wrap = 0;
        windowBits = -windowBits;
    }
    else {
        wrap = (windowBits >> 4) + 1;
#ifdef GUNZIP
        if (windowBits < 48)
            windowBits &= 15;
#endif
    }

    /* set number of window bits, free window if different */
    if (windowBits && (windowBits < 8 || windowBits > 15))
        return Z_STREAM_ERROR;
    if (state->window != Z_NULL && state->wbits != (unsigned)windowBits) {
        ZFREE(strm, state->window);
        state->window = Z_NULL;
    }

    /* update state and reset the rest of it */
    state->wrap = wrap;
    state->wbits = (unsigned)windowBits;
    return inflateReset(strm);
}

int ZEXPORT inflateInit2_(strm, windowBits, version, stream_size)
z_streamp strm;
int windowBits;
const char *version;
int stream_size;
{
    int ret;
    struct inflate_state FAR *state;

    if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
        stream_size != (int)(sizeof(z_stream)))
        return Z_VERSION_ERROR;
    if (strm == Z_NULL) return Z_STREAM_ERROR;
    strm->msg = Z_NULL;                 /* in case we return an error */
    if (strm->zalloc == (alloc_func)0) {
        strm->zalloc = zcalloc;
        strm->opaque = (voidpf)0;
    }
    if (strm->zfree == (free_func)0) strm->zfree = zcfree;
    state = (struct inflate_state FAR *)
            ZALLOC(strm, 1, sizeof(struct inflate_state));
    if (state == Z_NULL) return Z_MEM_ERROR;
    Tracev((stderr, "inflate: allocated\n"));
    strm->state = (struct internal_state FAR *)state;
    state->window = Z_NULL;
    ret = inflateReset2(strm, windowBits);
    if (ret != Z_OK) {
        ZFREE(strm, state);
        strm->state = Z_NULL;
    }
    return ret;
}

int ZEXPORT inflateInit_(strm, version, stream_size)
z_streamp strm;
const char *version;
int stream_size;
{
    return inflateInit2_(strm, DEF_WBITS, version, stream_size);
}

int ZEXPORT inflatePrime(strm, bits, value)
z_streamp strm;
int bits;
int value;
{
    struct inflate_state FAR *state;

    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
    state = (struct inflate_state FAR *)strm->state;
    if (bits < 0) {
        state->hold = 0;
        state->bits = 0;
        return Z_OK;
    }
    if (bits > 16 || state->bits + bits > 32) return Z_STREAM_ERROR;
    value &= (1L << bits) - 1;
    state->hold += value << state->bits;
    state->bits += bits;
    return Z_OK;
}

/*
   Return state with length and distance decoding tables and index sizes set to
   fixed code decoding.  Normally this returns fixed tables from inffixed.h.
   If BUILDFIXED is defined, then instead this routine builds the tables the
   first time it's called, and returns those tables the first time and
   thereafter.  This reduces the size of the code by about 2K bytes, in
   exchange for a little execution time.  However, BUILDFIXED should not be
   used for threaded applications, since the rewriting of the tables and virgin
   may not be thread-safe.
 */
local void fixedtables(state)
struct inflate_state FAR *state;
{
#ifdef BUILDFIXED
    static int virgin = 1;
    static code *lenfix, *distfix;
    static code fixed[544];

    /* build fixed huffman tables if first call (may not be thread safe) */
    if (virgin) {
        unsigned sym, bits;
        static code *next;

        /* literal/length table */
        sym = 0;
        while (sym < 144) state->lens[sym++] = 8;
        while (sym < 256) state->lens[sym++] = 9;
        while (sym < 280) state->lens[sym++] = 7;
        while (sym < 288) state->lens[sym++] = 8;
        next = fixed;
        lenfix = next;
        bits = 9;
        inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);

        /* distance table */
        sym = 0;
        while (sym < 32) state->lens[sym++] = 5;
        distfix = next;
        bits = 5;
        inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);

        /* do this just once */
        virgin = 0;
    }
#else /* !BUILDFIXED */
#   include "inffixed.h"
#endif /* BUILDFIXED */
    state->lencode = lenfix;
    state->lenbits = 9;
    state->distcode = distfix;
    state->distbits = 5;
}

#ifdef MAKEFIXED
#include 

/*
   Write out the inffixed.h that is #include'd above.  Defining MAKEFIXED also
   defines BUILDFIXED, so the tables are built on the fly.  makefixed() writes
   those tables to stdout, which would be piped to inffixed.h.  A small program
   can simply call makefixed to do this:

    void makefixed(void);

    int main(void)
    {
        makefixed();
        return 0;
    }

   Then that can be linked with zlib built with MAKEFIXED defined and run:

    a.out > inffixed.h
 */
void makefixed()
{
    unsigned low, size;
    struct inflate_state state;

    fixedtables(&state);
    puts("    /* inffixed.h -- table for decoding fixed codes");
    puts("     * Generated automatically by makefixed().");
    puts("     */");
    puts("");
    puts("    /* WARNING: this file should *not* be used by applications.");
    puts("       It is part of the implementation of this library and is");
    puts("       subject to change. Applications should only use zlib.h.");
    puts("     */");
    puts("");
    size = 1U << 9;
    printf("    static const code lenfix[%u] = {", size);
    low = 0;
    for (;;) {
        if ((low % 7) == 0) printf("\n        ");
        printf("{%u,%u,%d}", state.lencode[low].op, state.lencode[low].bits,
               state.lencode[low].val);
        if (++low == size) break;
        putchar(',');
    }
    puts("\n    };");
    size = 1U << 5;
    printf("\n    static const code distfix[%u] = {", size);
    low = 0;
    for (;;) {
        if ((low % 6) == 0) printf("\n        ");
        printf("{%u,%u,%d}", state.distcode[low].op, state.distcode[low].bits,
               state.distcode[low].val);
        if (++low == size) break;
        putchar(',');
    }
    puts("\n    };");
}
#endif /* MAKEFIXED */

/*
   Update the window with the last wsize (normally 32K) bytes written before
   returning.  If window does not exist yet, create it.  This is only called
   when a window is already in use, or when output has been written during this
   inflate call, but the end of the deflate stream has not been reached yet.
   It is also called to create a window for dictionary data when a dictionary
   is loaded.

   Providing output buffers larger than 32K to inflate() should provide a speed
   advantage, since only the last 32K of output is copied to the sliding window
   upon return from inflate(), and since all distances after the first 32K of
   output will fall in the output data, making match copies simpler and faster.
   The advantage may be dependent on the size of the processor's data caches.
 */
local int updatewindow(strm, out)
z_streamp strm;
unsigned out;
{
    struct inflate_state FAR *state;
    unsigned copy, dist;

    state = (struct inflate_state FAR *)strm->state;

    /* if it hasn't been done already, allocate space for the window */
    if (state->window == Z_NULL) {
        state->window = (unsigned char FAR *)
                        ZALLOC(strm, 1U << state->wbits,
                               sizeof(unsigned char));
        if (state->window == Z_NULL) return 1;
    }

    /* if window not in use yet, initialize */
    if (state->wsize == 0) {
        state->wsize = 1U << state->wbits;
        state->wnext = 0;
        state->whave = 0;
    }

    /* copy state->wsize or less output bytes into the circular window */
    copy = out - strm->avail_out;
    if (copy >= state->wsize) {
        zmemcpy(state->window, strm->next_out - state->wsize, state->wsize);
        state->wnext = 0;
        state->whave = state->wsize;
    }
    else {
        dist = state->wsize - state->wnext;
        if (dist > copy) dist = copy;
        zmemcpy(state->window + state->wnext, strm->next_out - copy, dist);
        copy -= dist;
        if (copy) {
            zmemcpy(state->window, strm->next_out - copy, copy);
            state->wnext = copy;
            state->whave = state->wsize;
        }
        else {
            state->wnext += dist;
            if (state->wnext == state->wsize) state->wnext = 0;
            if (state->whave < state->wsize) state->whave += dist;
        }
    }
    return 0;
}

/* Macros for inflate(): */

/* check function to use adler32() for zlib or crc32() for gzip */
#ifdef GUNZIP
#  define UPDATE(check, buf, len) \
    (state->flags ? crc32(check, buf, len) : adler32(check, buf, len))
#else
#  define UPDATE(check, buf, len) adler32(check, buf, len)
#endif

/* check macros for header crc */
#ifdef GUNZIP
#  define CRC2(check, word) \
    do { \
        hbuf[0] = (unsigned char)(word); \
        hbuf[1] = (unsigned char)((word) >> 8); \
        check = crc32(check, hbuf, 2); \
    } while (0)

#  define CRC4(check, word) \
    do { \
        hbuf[0] = (unsigned char)(word); \
        hbuf[1] = (unsigned char)((word) >> 8); \
        hbuf[2] = (unsigned char)((word) >> 16); \
        hbuf[3] = (unsigned char)((word) >> 24); \
        check = crc32(check, hbuf, 4); \
    } while (0)
#endif

/* Load registers with state in inflate() for speed */
#define LOAD() \
    do { \
        put = strm->next_out; \
        left = strm->avail_out; \
        next = strm->next_in; \
        have = strm->avail_in; \
        hold = state->hold; \
        bits = state->bits; \
    } while (0)

/* Restore state from registers in inflate() */
#define RESTORE() \
    do { \
        strm->next_out = put; \
        strm->avail_out = left; \
        strm->next_in = next; \
        strm->avail_in = have; \
        state->hold = hold; \
        state->bits = bits; \
    } while (0)

/* Clear the input bit accumulator */
#define INITBITS() \
    do { \
        hold = 0; \
        bits = 0; \
    } while (0)

/* Get a byte of input into the bit accumulator, or return from inflate()
   if there is no input available. */
#define PULLBYTE() \
    do { \
        if (have == 0) goto inf_leave; \
        have--; \
        hold += (unsigned long)(*next++) << bits; \
        bits += 8; \
    } while (0)

/* Assure that there are at least n bits in the bit accumulator.  If there is
   not enough available input to do that, then return from inflate(). */
#define NEEDBITS(n) \
    do { \
        while (bits < (unsigned)(n)) \
            PULLBYTE(); \
    } while (0)

/* Return the low n bits of the bit accumulator (n < 16) */
#define BITS(n) \
    ((unsigned)hold & ((1U << (n)) - 1))

/* Remove n bits from the bit accumulator */
#define DROPBITS(n) \
    do { \
        hold >>= (n); \
        bits -= (unsigned)(n); \
    } while (0)

/* Remove zero to seven bits as needed to go to a byte boundary */
#define BYTEBITS() \
    do { \
        hold >>= bits & 7; \
        bits -= bits & 7; \
    } while (0)

/* Reverse the bytes in a 32-bit value */
#define REVERSE(q) \
    ((((q) >> 24) & 0xff) + (((q) >> 8) & 0xff00) + \
     (((q) & 0xff00) << 8) + (((q) & 0xff) << 24))

/*
   inflate() uses a state machine to process as much input data and generate as
   much output data as possible before returning.  The state machine is
   structured roughly as follows:

    for (;;) switch (state) {
    ...
    case STATEn:
        if (not enough input data or output space to make progress)
            return;
        ... make progress ...
        state = STATEm;
        break;
    ...
    }

   so when inflate() is called again, the same case is attempted again, and
   if the appropriate resources are provided, the machine proceeds to the
   next state.  The NEEDBITS() macro is usually the way the state evaluates
   whether it can proceed or should return.  NEEDBITS() does the return if
   the requested bits are not available.  The typical use of the BITS macros
   is:

        NEEDBITS(n);
        ... do something with BITS(n) ...
        DROPBITS(n);

   where NEEDBITS(n) either returns from inflate() if there isn't enough
   input left to load n bits into the accumulator, or it continues.  BITS(n)
   gives the low n bits in the accumulator.  When done, DROPBITS(n) drops
   the low n bits off the accumulator.  INITBITS() clears the accumulator
   and sets the number of available bits to zero.  BYTEBITS() discards just
   enough bits to put the accumulator on a byte boundary.  After BYTEBITS()
   and a NEEDBITS(8), then BITS(8) would return the next byte in the stream.

   NEEDBITS(n) uses PULLBYTE() to get an available byte of input, or to return
   if there is no input available.  The decoding of variable length codes uses
   PULLBYTE() directly in order to pull just enough bytes to decode the next
   code, and no more.

   Some states loop until they get enough input, making sure that enough
   state information is maintained to continue the loop where it left off
   if NEEDBITS() returns in the loop.  For example, want, need, and keep
   would all have to actually be part of the saved state in case NEEDBITS()
   returns:

    case STATEw:
        while (want < need) {
            NEEDBITS(n);
            keep[want++] = BITS(n);
            DROPBITS(n);
        }
        state = STATEx;
    case STATEx:

   As shown above, if the next state is also the next case, then the break
   is omitted.

   A state may also return if there is not enough output space available to
   complete that state.  Those states are copying stored data, writing a
   literal byte, and copying a matching string.

   When returning, a "goto inf_leave" is used to update the total counters,
   update the check value, and determine whether any progress has been made
   during that inflate() call in order to return the proper return code.
   Progress is defined as a change in either strm->avail_in or strm->avail_out.
   When there is a window, goto inf_leave will update the window with the last
   output written.  If a goto inf_leave occurs in the middle of decompression
   and there is no window currently, goto inf_leave will create one and copy
   output to the window for the next call of inflate().

   In this implementation, the flush parameter of inflate() only affects the
   return code (per zlib.h).  inflate() always writes as much as possible to
   strm->next_out, given the space available and the provided input--the effect
   documented in zlib.h of Z_SYNC_FLUSH.  Furthermore, inflate() always defers
   the allocation of and copying into a sliding window until necessary, which
   provides the effect documented in zlib.h for Z_FINISH when the entire input
   stream available.  So the only thing the flush parameter actually does is:
   when flush is set to Z_FINISH, inflate() cannot return Z_OK.  Instead it
   will return Z_BUF_ERROR if it has not reached the end of the stream.
 */

int ZEXPORT inflate(strm, flush)
z_streamp strm;
int flush;
{
    struct inflate_state FAR *state;
    unsigned char FAR *next;    /* next input */
    unsigned char FAR *put;     /* next output */
    unsigned have, left;        /* available input and output */
    unsigned long hold;         /* bit buffer */
    unsigned bits;              /* bits in bit buffer */
    unsigned in, out;           /* save starting available input and output */
    unsigned copy;              /* number of stored or match bytes to copy */
    unsigned char FAR *from;    /* where to copy match bytes from */
    code here;                  /* current decoding table entry */
    code last;                  /* parent table entry */
    unsigned len;               /* length to copy for repeats, bits to drop */
    int ret;                    /* return code */
#ifdef GUNZIP
    unsigned char hbuf[4];      /* buffer for gzip header crc calculation */
#endif
    static const unsigned short order[19] = /* permutation of code lengths */
        {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};

    if (strm == Z_NULL || strm->state == Z_NULL || strm->next_out == Z_NULL ||
        (strm->next_in == Z_NULL && strm->avail_in != 0))
        return Z_STREAM_ERROR;

    state = (struct inflate_state FAR *)strm->state;
    if (state->mode == TYPE) state->mode = TYPEDO;      /* skip check */
    LOAD();
    in = have;
    out = left;
    ret = Z_OK;
    for (;;)
        switch (state->mode) {
        case HEAD:
            if (state->wrap == 0) {
                state->mode = TYPEDO;
                break;
            }
            NEEDBITS(16);
#ifdef GUNZIP
            if ((state->wrap & 2) && hold == 0x8b1f) {  /* gzip header */
                state->check = crc32(0L, Z_NULL, 0);
                CRC2(state->check, hold);
                INITBITS();
                state->mode = FLAGS;
                break;
            }
            state->flags = 0;           /* expect zlib header */
            if (state->head != Z_NULL)
                state->head->done = -1;
            if (!(state->wrap & 1) ||   /* check if zlib header allowed */
#else
            if (
#endif
                ((BITS(8) << 8) + (hold >> 8)) % 31) {
                strm->msg = (char *)"incorrect header check";
                state->mode = BAD;
                break;
            }
            if (BITS(4) != Z_DEFLATED) {
                strm->msg = (char *)"unknown compression method";
                state->mode = BAD;
                break;
            }
            DROPBITS(4);
            len = BITS(4) + 8;
            if (state->wbits == 0)
                state->wbits = len;
            else if (len > state->wbits) {
                strm->msg = (char *)"invalid window size";
                state->mode = BAD;
                break;
            }
            state->dmax = 1U << len;
            Tracev((stderr, "inflate:   zlib header ok\n"));
            strm->adler = state->check = adler32(0L, Z_NULL, 0);
            state->mode = hold & 0x200 ? DICTID : TYPE;
            INITBITS();
            break;
#ifdef GUNZIP
        case FLAGS:
            NEEDBITS(16);
            state->flags = (int)(hold);
            if ((state->flags & 0xff) != Z_DEFLATED) {
                strm->msg = (char *)"unknown compression method";
                state->mode = BAD;
                break;
            }
            if (state->flags & 0xe000) {
                strm->msg = (char *)"unknown header flags set";
                state->mode = BAD;
                break;
            }
            if (state->head != Z_NULL)
                state->head->text = (int)((hold >> 8) & 1);
            if (state->flags & 0x0200) CRC2(state->check, hold);
            INITBITS();
            state->mode = TIME;
        case TIME:
            NEEDBITS(32);
            if (state->head != Z_NULL)
                state->head->time = hold;
            if (state->flags & 0x0200) CRC4(state->check, hold);
            INITBITS();
            state->mode = OS;
        case OS:
            NEEDBITS(16);
            if (state->head != Z_NULL) {
                state->head->xflags = (int)(hold & 0xff);
                state->head->os = (int)(hold >> 8);
            }
            if (state->flags & 0x0200) CRC2(state->check, hold);
            INITBITS();
            state->mode = EXLEN;
        case EXLEN:
            if (state->flags & 0x0400) {
                NEEDBITS(16);
                state->length = (unsigned)(hold);
                if (state->head != Z_NULL)
                    state->head->extra_len = (unsigned)hold;
                if (state->flags & 0x0200) CRC2(state->check, hold);
                INITBITS();
            }
            else if (state->head != Z_NULL)
                state->head->extra = Z_NULL;
            state->mode = EXTRA;
        case EXTRA:
            if (state->flags & 0x0400) {
                copy = state->length;
                if (copy > have) copy = have;
                if (copy) {
                    if (state->head != Z_NULL &&
                        state->head->extra != Z_NULL) {
                        len = state->head->extra_len - state->length;
                        zmemcpy(state->head->extra + len, next,
                                len + copy > state->head->extra_max ?
                                state->head->extra_max - len : copy);
                    }
                    if (state->flags & 0x0200)
                        state->check = crc32(state->check, next, copy);
                    have -= copy;
                    next += copy;
                    state->length -= copy;
                }
                if (state->length) goto inf_leave;
            }
            state->length = 0;
            state->mode = NAME;
        case NAME:
            if (state->flags & 0x0800) {
                if (have == 0) goto inf_leave;
                copy = 0;
                do {
                    len = (unsigned)(next[copy++]);
                    if (state->head != Z_NULL &&
                            state->head->name != Z_NULL &&
                            state->length < state->head->name_max)
                        state->head->name[state->length++] = len;
                } while (len && copy < have);
                if (state->flags & 0x0200)
                    state->check = crc32(state->check, next, copy);
                have -= copy;
                next += copy;
                if (len) goto inf_leave;
            }
            else if (state->head != Z_NULL)
                state->head->name = Z_NULL;
            state->length = 0;
            state->mode = COMMENT;
        case COMMENT:
            if (state->flags & 0x1000) {
                if (have == 0) goto inf_leave;
                copy = 0;
                do {
                    len = (unsigned)(next[copy++]);
                    if (state->head != Z_NULL &&
                            state->head->comment != Z_NULL &&
                            state->length < state->head->comm_max)
                        state->head->comment[state->length++] = len;
                } while (len && copy < have);
                if (state->flags & 0x0200)
                    state->check = crc32(state->check, next, copy);
                have -= copy;
                next += copy;
                if (len) goto inf_leave;
            }
            else if (state->head != Z_NULL)
                state->head->comment = Z_NULL;
            state->mode = HCRC;
        case HCRC:
            if (state->flags & 0x0200) {
                NEEDBITS(16);
                if (hold != (state->check & 0xffff)) {
                    strm->msg = (char *)"header crc mismatch";
                    state->mode = BAD;
                    break;
                }
                INITBITS();
            }
            if (state->head != Z_NULL) {
                state->head->hcrc = (int)((state->flags >> 9) & 1);
                state->head->done = 1;
            }
            strm->adler = state->check = crc32(0L, Z_NULL, 0);
            state->mode = TYPE;
            break;
#endif
        case DICTID:
            NEEDBITS(32);
            strm->adler = state->check = REVERSE(hold);
            INITBITS();
            state->mode = DICT;
        case DICT:
            if (state->havedict == 0) {
                RESTORE();
                return Z_NEED_DICT;
            }
            strm->adler = state->check = adler32(0L, Z_NULL, 0);
            state->mode = TYPE;
        case TYPE:
            if (flush == Z_BLOCK || flush == Z_TREES) goto inf_leave;
        case TYPEDO:
            if (state->last) {
                BYTEBITS();
                state->mode = CHECK;
                break;
            }
            NEEDBITS(3);
            state->last = BITS(1);
            DROPBITS(1);
            switch (BITS(2)) {
            case 0:                             /* stored block */
                Tracev((stderr, "inflate:     stored block%s\n",
                        state->last ? " (last)" : ""));
                state->mode = STORED;
                break;
            case 1:                             /* fixed block */
                fixedtables(state);
                Tracev((stderr, "inflate:     fixed codes block%s\n",
                        state->last ? " (last)" : ""));
                state->mode = LEN_;             /* decode codes */
                if (flush == Z_TREES) {
                    DROPBITS(2);
                    goto inf_leave;
                }
                break;
            case 2:                             /* dynamic block */
                Tracev((stderr, "inflate:     dynamic codes block%s\n",
                        state->last ? " (last)" : ""));
                state->mode = TABLE;
                break;
            case 3:
                strm->msg = (char *)"invalid block type";
                state->mode = BAD;
            }
            DROPBITS(2);
            break;
        case STORED:
            BYTEBITS();                         /* go to byte boundary */
            NEEDBITS(32);
            if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
                strm->msg = (char *)"invalid stored block lengths";
                state->mode = BAD;
                break;
            }
            state->length = (unsigned)hold & 0xffff;
            Tracev((stderr, "inflate:       stored length %u\n",
                    state->length));
            INITBITS();
            state->mode = COPY_;
            if (flush == Z_TREES) goto inf_leave;
        case COPY_:
            state->mode = COPY;
        case COPY:
            copy = state->length;
            if (copy) {
                if (copy > have) copy = have;
                if (copy > left) copy = left;
                if (copy == 0) goto inf_leave;
                zmemcpy(put, next, copy);
                have -= copy;
                next += copy;
                left -= copy;
                put += copy;
                state->length -= copy;
                break;
            }
            Tracev((stderr, "inflate:       stored end\n"));
            state->mode = TYPE;
            break;
        case TABLE:
            NEEDBITS(14);
            state->nlen = BITS(5) + 257;
            DROPBITS(5);
            state->ndist = BITS(5) + 1;
            DROPBITS(5);
            state->ncode = BITS(4) + 4;
            DROPBITS(4);
#ifndef PKZIP_BUG_WORKAROUND
            if (state->nlen > 286 || state->ndist > 30) {
                strm->msg = (char *)"too many length or distance symbols";
                state->mode = BAD;
                break;
            }
#endif
            Tracev((stderr, "inflate:       table sizes ok\n"));
            state->have = 0;
            state->mode = LENLENS;
        case LENLENS:
            while (state->have < state->ncode) {
                NEEDBITS(3);
                state->lens[order[state->have++]] = (unsigned short)BITS(3);
                DROPBITS(3);
            }
            while (state->have < 19)
                state->lens[order[state->have++]] = 0;
            state->next = state->codes;
            state->lencode = (code const FAR *)(state->next);
            state->lenbits = 7;
            ret = inflate_table(CODES, state->lens, 19, &(state->next),
                                &(state->lenbits), state->work);
            if (ret) {
                strm->msg = (char *)"invalid code lengths set";
                state->mode = BAD;
                break;
            }
            Tracev((stderr, "inflate:       code lengths ok\n"));
            state->have = 0;
            state->mode = CODELENS;
        case CODELENS:
            while (state->have < state->nlen + state->ndist) {
                for (;;) {
                    here = state->lencode[BITS(state->lenbits)];
                    if ((unsigned)(here.bits) <= bits) break;
                    PULLBYTE();
                }
                if (here.val < 16) {
                    NEEDBITS(here.bits);
                    DROPBITS(here.bits);
                    state->lens[state->have++] = here.val;
                }
                else {
                    if (here.val == 16) {
                        NEEDBITS(here.bits + 2);
                        DROPBITS(here.bits);
                        if (state->have == 0) {
                            strm->msg = (char *)"invalid bit length repeat";
                            state->mode = BAD;
                            break;
                        }
                        len = state->lens[state->have - 1];
                        copy = 3 + BITS(2);
                        DROPBITS(2);
                    }
                    else if (here.val == 17) {
                        NEEDBITS(here.bits + 3);
                        DROPBITS(here.bits);
                        len = 0;
                        copy = 3 + BITS(3);
                        DROPBITS(3);
                    }
                    else {
                        NEEDBITS(here.bits + 7);
                        DROPBITS(here.bits);
                        len = 0;
                        copy = 11 + BITS(7);
                        DROPBITS(7);
                    }
                    if (state->have + copy > state->nlen + state->ndist) {
                        strm->msg = (char *)"invalid bit length repeat";
                        state->mode = BAD;
                        break;
                    }
                    while (copy--)
                        state->lens[state->have++] = (unsigned short)len;
                }
            }

            /* handle error breaks in while */
            if (state->mode == BAD) break;

            /* check for end-of-block code (better have one) */
            if (state->lens[256] == 0) {
                strm->msg = (char *)"invalid code -- missing end-of-block";
                state->mode = BAD;
                break;
            }

            /* build code tables -- note: do not change the lenbits or distbits
               values here (9 and 6) without reading the comments in inftrees.h
               concerning the ENOUGH constants, which depend on those values */
            state->next = state->codes;
            state->lencode = (code const FAR *)(state->next);
            state->lenbits = 9;
            ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
                                &(state->lenbits), state->work);
            if (ret) {
                strm->msg = (char *)"invalid literal/lengths set";
                state->mode = BAD;
                break;
            }
            state->distcode = (code const FAR *)(state->next);
            state->distbits = 6;
            ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
                            &(state->next), &(state->distbits), state->work);
            if (ret) {
                strm->msg = (char *)"invalid distances set";
                state->mode = BAD;
                break;
            }
            Tracev((stderr, "inflate:       codes ok\n"));
            state->mode = LEN_;
            if (flush == Z_TREES) goto inf_leave;
        case LEN_:
            state->mode = LEN;
        case LEN:
            if (have >= 6 && left >= 258) {
                RESTORE();
                inflate_fast(strm, out);
                LOAD();
                if (state->mode == TYPE)
                    state->back = -1;
                break;
            }
            state->back = 0;
            for (;;) {
                here = state->lencode[BITS(state->lenbits)];
                if ((unsigned)(here.bits) <= bits) break;
                PULLBYTE();
            }
            if (here.op && (here.op & 0xf0) == 0) {
                last = here;
                for (;;) {
                    here = state->lencode[last.val +
                            (BITS(last.bits + last.op) >> last.bits)];
                    if ((unsigned)(last.bits + here.bits) <= bits) break;
                    PULLBYTE();
                }
                DROPBITS(last.bits);
                state->back += last.bits;
            }
            DROPBITS(here.bits);
            state->back += here.bits;
            state->length = (unsigned)here.val;
            if ((int)(here.op) == 0) {
                Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
                        "inflate:         literal '%c'\n" :
                        "inflate:         literal 0x%02x\n", here.val));
                state->mode = LIT;
                break;
            }
            if (here.op & 32) {
                Tracevv((stderr, "inflate:         end of block\n"));
                state->back = -1;
                state->mode = TYPE;
                break;
            }
            if (here.op & 64) {
                strm->msg = (char *)"invalid literal/length code";
                state->mode = BAD;
                break;
            }
            state->extra = (unsigned)(here.op) & 15;
            state->mode = LENEXT;
        case LENEXT:
            if (state->extra) {
                NEEDBITS(state->extra);
                state->length += BITS(state->extra);
                DROPBITS(state->extra);
                state->back += state->extra;
            }
            Tracevv((stderr, "inflate:         length %u\n", state->length));
            state->was = state->length;
            state->mode = DIST;
        case DIST:
            for (;;) {
                here = state->distcode[BITS(state->distbits)];
                if ((unsigned)(here.bits) <= bits) break;
                PULLBYTE();
            }
            if ((here.op & 0xf0) == 0) {
                last = here;
                for (;;) {
                    here = state->distcode[last.val +
                            (BITS(last.bits + last.op) >> last.bits)];
                    if ((unsigned)(last.bits + here.bits) <= bits) break;
                    PULLBYTE();
                }
                DROPBITS(last.bits);
                state->back += last.bits;
            }
            DROPBITS(here.bits);
            state->back += here.bits;
            if (here.op & 64) {
                strm->msg = (char *)"invalid distance code";
                state->mode = BAD;
                break;
            }
            state->offset = (unsigned)here.val;
            state->extra = (unsigned)(here.op) & 15;
            state->mode = DISTEXT;
        case DISTEXT:
            if (state->extra) {
                NEEDBITS(state->extra);
                state->offset += BITS(state->extra);
                DROPBITS(state->extra);
                state->back += state->extra;
            }
#ifdef INFLATE_STRICT
            if (state->offset > state->dmax) {
                strm->msg = (char *)"invalid distance too far back";
                state->mode = BAD;
                break;
            }
#endif
            Tracevv((stderr, "inflate:         distance %u\n", state->offset));
            state->mode = MATCH;
        case MATCH:
            if (left == 0) goto inf_leave;
            copy = out - left;
            if (state->offset > copy) {         /* copy from window */
                copy = state->offset - copy;
                if (copy > state->whave) {
                    if (state->sane) {
                        strm->msg = (char *)"invalid distance too far back";
                        state->mode = BAD;
                        break;
                    }
#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
                    Trace((stderr, "inflate.c too far\n"));
                    copy -= state->whave;
                    if (copy > state->length) copy = state->length;
                    if (copy > left) copy = left;
                    left -= copy;
                    state->length -= copy;
                    do {
                        *put++ = 0;
                    } while (--copy);
                    if (state->length == 0) state->mode = LEN;
                    break;
#endif
                }
                if (copy > state->wnext) {
                    copy -= state->wnext;
                    from = state->window + (state->wsize - copy);
                }
                else
                    from = state->window + (state->wnext - copy);
                if (copy > state->length) copy = state->length;
            }
            else {                              /* copy from output */
                from = put - state->offset;
                copy = state->length;
            }
            if (copy > left) copy = left;
            left -= copy;
            state->length -= copy;
            do {
                *put++ = *from++;
            } while (--copy);
            if (state->length == 0) state->mode = LEN;
            break;
        case LIT:
            if (left == 0) goto inf_leave;
            *put++ = (unsigned char)(state->length);
            left--;
            state->mode = LEN;
            break;
        case CHECK:
            if (state->wrap) {
                NEEDBITS(32);
                out -= left;
                strm->total_out += out;
                state->total += out;
                if (out)
                    strm->adler = state->check =
                        UPDATE(state->check, put - out, out);
                out = left;
                if ((
#ifdef GUNZIP
                     state->flags ? hold :
#endif
                     REVERSE(hold)) != state->check) {
                    strm->msg = (char *)"incorrect data check";
                    state->mode = BAD;
                    break;
                }
                INITBITS();
                Tracev((stderr, "inflate:   check matches trailer\n"));
            }
#ifdef GUNZIP
            state->mode = LENGTH;
        case LENGTH:
            if (state->wrap && state->flags) {
                NEEDBITS(32);
                if (hold != (state->total & 0xffffffffUL)) {
                    strm->msg = (char *)"incorrect length check";
                    state->mode = BAD;
                    break;
                }
                INITBITS();
                Tracev((stderr, "inflate:   length matches trailer\n"));
            }
#endif
            state->mode = DONE;
        case DONE:
            ret = Z_STREAM_END;
            goto inf_leave;
        case BAD:
            ret = Z_DATA_ERROR;
            goto inf_leave;
        case MEM:
            return Z_MEM_ERROR;
        case SYNC:
        default:
            return Z_STREAM_ERROR;
        }

    /*
       Return from inflate(), updating the total counts and the check value.
       If there was no progress during the inflate() call, return a buffer
       error.  Call updatewindow() to create and/or update the window state.
       Note: a memory error from inflate() is non-recoverable.
     */
  inf_leave:
    RESTORE();
    if (state->wsize || (state->mode < CHECK && out != strm->avail_out))
        if (updatewindow(strm, out)) {
            state->mode = MEM;
            return Z_MEM_ERROR;
        }
    in -= strm->avail_in;
    out -= strm->avail_out;
    strm->total_in += in;
    strm->total_out += out;
    state->total += out;
    if (state->wrap && out)
        strm->adler = state->check =
            UPDATE(state->check, strm->next_out - out, out);
    strm->data_type = state->bits + (state->last ? 64 : 0) +
                      (state->mode == TYPE ? 128 : 0) +
                      (state->mode == LEN_ || state->mode == COPY_ ? 256 : 0);
    if (((in == 0 && out == 0) || flush == Z_FINISH) && ret == Z_OK)
        ret = Z_BUF_ERROR;
    return ret;
}

int ZEXPORT inflateEnd(strm)
z_streamp strm;
{
    struct inflate_state FAR *state;
    if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
        return Z_STREAM_ERROR;
    state = (struct inflate_state FAR *)strm->state;
    if (state->window != Z_NULL) ZFREE(strm, state->window);
    ZFREE(strm, strm->state);
    strm->state = Z_NULL;
    Tracev((stderr, "inflate: end\n"));
    return Z_OK;
}

int ZEXPORT inflateSetDictionary(strm, dictionary, dictLength)
z_streamp strm;
const Bytef *dictionary;
uInt dictLength;
{
    struct inflate_state FAR *state;
    unsigned long id;

    /* check state */
    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
    state = (struct inflate_state FAR *)strm->state;
    if (state->wrap != 0 && state->mode != DICT)
        return Z_STREAM_ERROR;

    /* check for correct dictionary id */
    if (state->mode == DICT) {
        id = adler32(0L, Z_NULL, 0);
        id = adler32(id, dictionary, dictLength);
        if (id != state->check)
            return Z_DATA_ERROR;
    }

    /* copy dictionary to window */
    if (updatewindow(strm, strm->avail_out)) {
        state->mode = MEM;
        return Z_MEM_ERROR;
    }
    if (dictLength > state->wsize) {
        zmemcpy(state->window, dictionary + dictLength - state->wsize,
                state->wsize);
        state->whave = state->wsize;
    }
    else {
        zmemcpy(state->window + state->wsize - dictLength, dictionary,
                dictLength);
        state->whave = dictLength;
    }
    state->havedict = 1;
    Tracev((stderr, "inflate:   dictionary set\n"));
    return Z_OK;
}

int ZEXPORT inflateGetHeader(strm, head)
z_streamp strm;
gz_headerp head;
{
    struct inflate_state FAR *state;

    /* check state */
    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
    state = (struct inflate_state FAR *)strm->state;
    if ((state->wrap & 2) == 0) return Z_STREAM_ERROR;

    /* save header structure */
    state->head = head;
    head->done = 0;
    return Z_OK;
}

/*
   Search buf[0..len-1] for the pattern: 0, 0, 0xff, 0xff.  Return when found
   or when out of input.  When called, *have is the number of pattern bytes
   found in order so far, in 0..3.  On return *have is updated to the new
   state.  If on return *have equals four, then the pattern was found and the
   return value is how many bytes were read including the last byte of the
   pattern.  If *have is less than four, then the pattern has not been found
   yet and the return value is len.  In the latter case, syncsearch() can be
   called again with more data and the *have state.  *have is initialized to
   zero for the first call.
 */
local unsigned syncsearch(have, buf, len)
unsigned FAR *have;
unsigned char FAR *buf;
unsigned len;
{
    unsigned got;
    unsigned next;

    got = *have;
    next = 0;
    while (next < len && got < 4) {
        if ((int)(buf[next]) == (got < 2 ? 0 : 0xff))
            got++;
        else if (buf[next])
            got = 0;
        else
            got = 4 - got;
        next++;
    }
    *have = got;
    return next;
}

int ZEXPORT inflateSync(strm)
z_streamp strm;
{
    unsigned len;               /* number of bytes to look at or looked at */
    unsigned long in, out;      /* temporary to save total_in and total_out */
    unsigned char buf[4];       /* to restore bit buffer to byte string */
    struct inflate_state FAR *state;

    /* check parameters */
    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
    state = (struct inflate_state FAR *)strm->state;
    if (strm->avail_in == 0 && state->bits < 8) return Z_BUF_ERROR;

    /* if first time, start search in bit buffer */
    if (state->mode != SYNC) {
        state->mode = SYNC;
        state->hold <<= state->bits & 7;
        state->bits -= state->bits & 7;
        len = 0;
        while (state->bits >= 8) {
            buf[len++] = (unsigned char)(state->hold);
            state->hold >>= 8;
            state->bits -= 8;
        }
        state->have = 0;
        syncsearch(&(state->have), buf, len);
    }

    /* search available input */
    len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
    strm->avail_in -= len;
    strm->next_in += len;
    strm->total_in += len;

    /* return no joy or set up to restart inflate() on a new block */
    if (state->have != 4) return Z_DATA_ERROR;
    in = strm->total_in;  out = strm->total_out;
    inflateReset(strm);
    strm->total_in = in;  strm->total_out = out;
    state->mode = TYPE;
    return Z_OK;
}

/*
   Returns true if inflate is currently at the end of a block generated by
   Z_SYNC_FLUSH or Z_FULL_FLUSH. This function is used by one PPP
   implementation to provide an additional safety check. PPP uses
   Z_SYNC_FLUSH but removes the length bytes of the resulting empty stored
   block. When decompressing, PPP checks that at the end of input packet,
   inflate is waiting for these length bytes.
 */
int ZEXPORT inflateSyncPoint(strm)
z_streamp strm;
{
    struct inflate_state FAR *state;

    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
    state = (struct inflate_state FAR *)strm->state;
    return state->mode == STORED && state->bits == 0;
}

int ZEXPORT inflateCopy(dest, source)
z_streamp dest;
z_streamp source;
{
    struct inflate_state FAR *state;
    struct inflate_state FAR *copy;
    unsigned char FAR *window;
    unsigned wsize;

    /* check input */
    if (dest == Z_NULL || source == Z_NULL || source->state == Z_NULL ||
        source->zalloc == (alloc_func)0 || source->zfree == (free_func)0)
        return Z_STREAM_ERROR;
    state = (struct inflate_state FAR *)source->state;

    /* allocate space */
    copy = (struct inflate_state FAR *)
           ZALLOC(source, 1, sizeof(struct inflate_state));
    if (copy == Z_NULL) return Z_MEM_ERROR;
    window = Z_NULL;
    if (state->window != Z_NULL) {
        window = (unsigned char FAR *)
                 ZALLOC(source, 1U << state->wbits, sizeof(unsigned char));
        if (window == Z_NULL) {
            ZFREE(source, copy);
            return Z_MEM_ERROR;
        }
    }

    /* copy state */
    zmemcpy(dest, source, sizeof(z_stream));
    zmemcpy(copy, state, sizeof(struct inflate_state));
    if (state->lencode >= state->codes &&
        state->lencode <= state->codes + ENOUGH - 1) {
        copy->lencode = copy->codes + (state->lencode - state->codes);
        copy->distcode = copy->codes + (state->distcode - state->codes);
    }
    copy->next = copy->codes + (state->next - state->codes);
    if (window != Z_NULL) {
        wsize = 1U << state->wbits;
        zmemcpy(window, state->window, wsize);
    }
    copy->window = window;
    dest->state = (struct internal_state FAR *)copy;
    return Z_OK;
}

int ZEXPORT inflateUndermine(strm, subvert)
z_streamp strm;
int subvert;
{
    struct inflate_state FAR *state;

    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
    state = (struct inflate_state FAR *)strm->state;
    state->sane = !subvert;
#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
    return Z_OK;
#else
    state->sane = 1;
    return Z_DATA_ERROR;
#endif
}

long ZEXPORT inflateMark(strm)
z_streamp strm;
{
    struct inflate_state FAR *state;

    if (strm == Z_NULL || strm->state == Z_NULL) return -1L << 16;
    state = (struct inflate_state FAR *)strm->state;
    return ((long)(state->back) << 16) +
        (state->mode == COPY ? state->length :
            (state->mode == MATCH ? state->was - state->length : 0));
}
cfitsio-3.47/zlib/inflate.h0000644000225700000360000001437713464573432015157 0ustar  cagordonlhea/* inflate.h -- internal inflate state definition
 * Copyright (C) 1995-2009 Mark Adler
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

/* WARNING: this file should *not* be used by applications. It is
   part of the implementation of the compression library and is
   subject to change. Applications should only use zlib.h.
 */

/* define NO_GZIP when compiling if you want to disable gzip header and
   trailer decoding by inflate().  NO_GZIP would be used to avoid linking in
   the crc code when it is not needed.  For shared libraries, gzip decoding
   should be left enabled. */
#ifndef NO_GZIP
#  define GUNZIP
#endif

/* Possible inflate modes between inflate() calls */
typedef enum {
    HEAD,       /* i: waiting for magic header */
    FLAGS,      /* i: waiting for method and flags (gzip) */
    TIME,       /* i: waiting for modification time (gzip) */
    OS,         /* i: waiting for extra flags and operating system (gzip) */
    EXLEN,      /* i: waiting for extra length (gzip) */
    EXTRA,      /* i: waiting for extra bytes (gzip) */
    NAME,       /* i: waiting for end of file name (gzip) */
    COMMENT,    /* i: waiting for end of comment (gzip) */
    HCRC,       /* i: waiting for header crc (gzip) */
    DICTID,     /* i: waiting for dictionary check value */
    DICT,       /* waiting for inflateSetDictionary() call */
        TYPE,       /* i: waiting for type bits, including last-flag bit */
        TYPEDO,     /* i: same, but skip check to exit inflate on new block */
        STORED,     /* i: waiting for stored size (length and complement) */
        COPY_,      /* i/o: same as COPY below, but only first time in */
        COPY,       /* i/o: waiting for input or output to copy stored block */
        TABLE,      /* i: waiting for dynamic block table lengths */
        LENLENS,    /* i: waiting for code length code lengths */
        CODELENS,   /* i: waiting for length/lit and distance code lengths */
            LEN_,       /* i: same as LEN below, but only first time in */
            LEN,        /* i: waiting for length/lit/eob code */
            LENEXT,     /* i: waiting for length extra bits */
            DIST,       /* i: waiting for distance code */
            DISTEXT,    /* i: waiting for distance extra bits */
            MATCH,      /* o: waiting for output space to copy string */
            LIT,        /* o: waiting for output space to write literal */
    CHECK,      /* i: waiting for 32-bit check value */
    LENGTH,     /* i: waiting for 32-bit length (gzip) */
    DONE,       /* finished check, done -- remain here until reset */
    BAD,        /* got a data error -- remain here until reset */
    MEM,        /* got an inflate() memory error -- remain here until reset */
    SYNC        /* looking for synchronization bytes to restart inflate() */
} inflate_mode;

/*
    State transitions between above modes -

    (most modes can go to BAD or MEM on error -- not shown for clarity)

    Process header:
        HEAD -> (gzip) or (zlib) or (raw)
        (gzip) -> FLAGS -> TIME -> OS -> EXLEN -> EXTRA -> NAME -> COMMENT ->
                  HCRC -> TYPE
        (zlib) -> DICTID or TYPE
        DICTID -> DICT -> TYPE
        (raw) -> TYPEDO
    Read deflate blocks:
            TYPE -> TYPEDO -> STORED or TABLE or LEN_ or CHECK
            STORED -> COPY_ -> COPY -> TYPE
            TABLE -> LENLENS -> CODELENS -> LEN_
            LEN_ -> LEN
    Read deflate codes in fixed or dynamic block:
                LEN -> LENEXT or LIT or TYPE
                LENEXT -> DIST -> DISTEXT -> MATCH -> LEN
                LIT -> LEN
    Process trailer:
        CHECK -> LENGTH -> DONE
 */

/* state maintained between inflate() calls.  Approximately 10K bytes. */
struct inflate_state {
    inflate_mode mode;          /* current inflate mode */
    int last;                   /* true if processing last block */
    int wrap;                   /* bit 0 true for zlib, bit 1 true for gzip */
    int havedict;               /* true if dictionary provided */
    int flags;                  /* gzip header method and flags (0 if zlib) */
    unsigned dmax;              /* zlib header max distance (INFLATE_STRICT) */
    unsigned long check;        /* protected copy of check value */
    unsigned long total;        /* protected copy of output count */
    gz_headerp head;            /* where to save gzip header information */
        /* sliding window */
    unsigned wbits;             /* log base 2 of requested window size */
    unsigned wsize;             /* window size or zero if not using window */
    unsigned whave;             /* valid bytes in the window */
    unsigned wnext;             /* window write index */
    unsigned char FAR *window;  /* allocated sliding window, if needed */
        /* bit accumulator */
    unsigned long hold;         /* input bit accumulator */
    unsigned bits;              /* number of bits in "in" */
        /* for string and stored block copying */
    unsigned length;            /* literal or length of data to copy */
    unsigned offset;            /* distance back to copy string from */
        /* for table and code decoding */
    unsigned extra;             /* extra bits needed */
        /* fixed and dynamic code tables */
    code const FAR *lencode;    /* starting table for length/literal codes */
    code const FAR *distcode;   /* starting table for distance codes */
    unsigned lenbits;           /* index bits for lencode */
    unsigned distbits;          /* index bits for distcode */
        /* dynamic table building */
    unsigned ncode;             /* number of code length code lengths */
    unsigned nlen;              /* number of length code lengths */
    unsigned ndist;             /* number of distance code lengths */
    unsigned have;              /* number of code lengths in lens[] */
    code FAR *next;             /* next available space in codes[] */
    unsigned short lens[320];   /* temporary storage for code lengths */
    unsigned short work[288];   /* work area for code table building */
    code codes[ENOUGH];         /* space for code tables */
    int sane;                   /* if false, allow invalid distance too far */
    int back;                   /* bits back of last unprocessed length/lit */
    unsigned was;               /* initial length of match */
};
cfitsio-3.47/zlib/inftrees.c0000644000225700000360000003271113464573432015337 0ustar  cagordonlhea/* inftrees.c -- generate Huffman trees for efficient decoding
 * Copyright (C) 1995-2010 Mark Adler
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

#include "zutil.h"
#include "inftrees.h"

#define MAXBITS 15

const char inflate_copyright[] =
   " inflate 1.2.5 Copyright 1995-2010 Mark Adler ";
/*
  If you use the zlib library in a product, an acknowledgment is welcome
  in the documentation of your product. If for some reason you cannot
  include such an acknowledgment, I would appreciate that you keep this
  copyright string in the executable of your product.
 */

/*
   Build a set of tables to decode the provided canonical Huffman code.
   The code lengths are lens[0..codes-1].  The result starts at *table,
   whose indices are 0..2^bits-1.  work is a writable array of at least
   lens shorts, which is used as a work area.  type is the type of code
   to be generated, CODES, LENS, or DISTS.  On return, zero is success,
   -1 is an invalid code, and +1 means that ENOUGH isn't enough.  table
   on return points to the next available entry's address.  bits is the
   requested root table index bits, and on return it is the actual root
   table index bits.  It will differ if the request is greater than the
   longest code or if it is less than the shortest code.
 */
int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work)
codetype type;
unsigned short FAR *lens;
unsigned codes;
code FAR * FAR *table;
unsigned FAR *bits;
unsigned short FAR *work;
{
    unsigned len;               /* a code's length in bits */
    unsigned sym;               /* index of code symbols */
    unsigned min, max;          /* minimum and maximum code lengths */
    unsigned root;              /* number of index bits for root table */
    unsigned curr;              /* number of index bits for current table */
    unsigned drop;              /* code bits to drop for sub-table */
    int left;                   /* number of prefix codes available */
    unsigned used;              /* code entries in table used */
    unsigned huff;              /* Huffman code */
    unsigned incr;              /* for incrementing code, index */
    unsigned fill;              /* index for replicating entries */
    unsigned low;               /* low bits for current root entry */
    unsigned mask;              /* mask for low root bits */
    code here;                  /* table entry for duplication */
    code FAR *next;             /* next available space in table */
    const unsigned short FAR *base;     /* base value table to use */
    const unsigned short FAR *extra;    /* extra bits table to use */
    int end;                    /* use base and extra for symbol > end */
    unsigned short count[MAXBITS+1];    /* number of codes of each length */
    unsigned short offs[MAXBITS+1];     /* offsets in table for each length */
    static const unsigned short lbase[31] = { /* Length codes 257..285 base */
        3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
        35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};
    static const unsigned short lext[31] = { /* Length codes 257..285 extra */
        16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
        19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 73, 195};
    static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
        1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
        257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
        8193, 12289, 16385, 24577, 0, 0};
    static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
        16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,
        23, 23, 24, 24, 25, 25, 26, 26, 27, 27,
        28, 28, 29, 29, 64, 64};

    /*
       Process a set of code lengths to create a canonical Huffman code.  The
       code lengths are lens[0..codes-1].  Each length corresponds to the
       symbols 0..codes-1.  The Huffman code is generated by first sorting the
       symbols by length from short to long, and retaining the symbol order
       for codes with equal lengths.  Then the code starts with all zero bits
       for the first code of the shortest length, and the codes are integer
       increments for the same length, and zeros are appended as the length
       increases.  For the deflate format, these bits are stored backwards
       from their more natural integer increment ordering, and so when the
       decoding tables are built in the large loop below, the integer codes
       are incremented backwards.

       This routine assumes, but does not check, that all of the entries in
       lens[] are in the range 0..MAXBITS.  The caller must assure this.
       1..MAXBITS is interpreted as that code length.  zero means that that
       symbol does not occur in this code.

       The codes are sorted by computing a count of codes for each length,
       creating from that a table of starting indices for each length in the
       sorted table, and then entering the symbols in order in the sorted
       table.  The sorted table is work[], with that space being provided by
       the caller.

       The length counts are used for other purposes as well, i.e. finding
       the minimum and maximum length codes, determining if there are any
       codes at all, checking for a valid set of lengths, and looking ahead
       at length counts to determine sub-table sizes when building the
       decoding tables.
     */

    /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
    for (len = 0; len <= MAXBITS; len++)
        count[len] = 0;
    for (sym = 0; sym < codes; sym++)
        count[lens[sym]]++;

    /* bound code lengths, force root to be within code lengths */
    root = *bits;
    for (max = MAXBITS; max >= 1; max--)
        if (count[max] != 0) break;
    if (root > max) root = max;
    if (max == 0) {                     /* no symbols to code at all */
        here.op = (unsigned char)64;    /* invalid code marker */
        here.bits = (unsigned char)1;
        here.val = (unsigned short)0;
        *(*table)++ = here;             /* make a table to force an error */
        *(*table)++ = here;
        *bits = 1;
        return 0;     /* no symbols, but wait for decoding to report error */
    }
    for (min = 1; min < max; min++)
        if (count[min] != 0) break;
    if (root < min) root = min;

    /* check for an over-subscribed or incomplete set of lengths */
    left = 1;
    for (len = 1; len <= MAXBITS; len++) {
        left <<= 1;
        left -= count[len];
        if (left < 0) return -1;        /* over-subscribed */
    }
    if (left > 0 && (type == CODES || max != 1))
        return -1;                      /* incomplete set */

    /* generate offsets into symbol table for each length for sorting */
    offs[1] = 0;
    for (len = 1; len < MAXBITS; len++)
        offs[len + 1] = offs[len] + count[len];

    /* sort symbols by length, by symbol order within each length */
    for (sym = 0; sym < codes; sym++)
        if (lens[sym] != 0) work[offs[lens[sym]]++] = (unsigned short)sym;

    /*
       Create and fill in decoding tables.  In this loop, the table being
       filled is at next and has curr index bits.  The code being used is huff
       with length len.  That code is converted to an index by dropping drop
       bits off of the bottom.  For codes where len is less than drop + curr,
       those top drop + curr - len bits are incremented through all values to
       fill the table with replicated entries.

       root is the number of index bits for the root table.  When len exceeds
       root, sub-tables are created pointed to by the root entry with an index
       of the low root bits of huff.  This is saved in low to check for when a
       new sub-table should be started.  drop is zero when the root table is
       being filled, and drop is root when sub-tables are being filled.

       When a new sub-table is needed, it is necessary to look ahead in the
       code lengths to determine what size sub-table is needed.  The length
       counts are used for this, and so count[] is decremented as codes are
       entered in the tables.

       used keeps track of how many table entries have been allocated from the
       provided *table space.  It is checked for LENS and DIST tables against
       the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in
       the initial root table size constants.  See the comments in inftrees.h
       for more information.

       sym increments through all symbols, and the loop terminates when
       all codes of length max, i.e. all codes, have been processed.  This
       routine permits incomplete codes, so another loop after this one fills
       in the rest of the decoding tables with invalid code markers.
     */

    /* set up for code type */
    switch (type) {
    case CODES:
        base = extra = work;    /* dummy value--not used */
        end = 19;
        break;
    case LENS:
        base = lbase;
        base -= 257;
        extra = lext;
        extra -= 257;
        end = 256;
        break;
    default:            /* DISTS */
        base = dbase;
        extra = dext;
        end = -1;
    }

    /* initialize state for loop */
    huff = 0;                   /* starting code */
    sym = 0;                    /* starting code symbol */
    len = min;                  /* starting code length */
    next = *table;              /* current table to fill in */
    curr = root;                /* current table index bits */
    drop = 0;                   /* current bits to drop from code for index */
    low = (unsigned)(-1);       /* trigger new sub-table when len > root */
    used = 1U << root;          /* use root table entries */
    mask = used - 1;            /* mask for comparing low */

    /* check available table space */
    if ((type == LENS && used >= ENOUGH_LENS) ||
        (type == DISTS && used >= ENOUGH_DISTS))
        return 1;

    /* process all codes and make table entries */
    for (;;) {
        /* create table entry */
        here.bits = (unsigned char)(len - drop);
        if ((int)(work[sym]) < end) {
            here.op = (unsigned char)0;
            here.val = work[sym];
        }
        else if ((int)(work[sym]) > end) {
            here.op = (unsigned char)(extra[work[sym]]);
            here.val = base[work[sym]];
        }
        else {
            here.op = (unsigned char)(32 + 64);         /* end of block */
            here.val = 0;
        }

        /* replicate for those indices with low len bits equal to huff */
        incr = 1U << (len - drop);
        fill = 1U << curr;
        min = fill;                 /* save offset to next table */
        do {
            fill -= incr;
            next[(huff >> drop) + fill] = here;
        } while (fill != 0);

        /* backwards increment the len-bit code huff */
        incr = 1U << (len - 1);
        while (huff & incr)
            incr >>= 1;
        if (incr != 0) {
            huff &= incr - 1;
            huff += incr;
        }
        else
            huff = 0;

        /* go to next symbol, update count, len */
        sym++;
        if (--(count[len]) == 0) {
            if (len == max) break;
            len = lens[work[sym]];
        }

        /* create new sub-table if needed */
        if (len > root && (huff & mask) != low) {
            /* if first time, transition to sub-tables */
            if (drop == 0)
                drop = root;

            /* increment past last table */
            next += min;            /* here min is 1 << curr */

            /* determine length of next table */
            curr = len - drop;
            left = (int)(1 << curr);
            while (curr + drop < max) {
                left -= count[curr + drop];
                if (left <= 0) break;
                curr++;
                left <<= 1;
            }

            /* check for enough space */
            used += 1U << curr;
            if ((type == LENS && used >= ENOUGH_LENS) ||
                (type == DISTS && used >= ENOUGH_DISTS))
                return 1;

            /* point entry in root table to sub-table */
            low = huff & mask;
            (*table)[low].op = (unsigned char)curr;
            (*table)[low].bits = (unsigned char)root;
            (*table)[low].val = (unsigned short)(next - *table);
        }
    }

    /*
       Fill in rest of table for incomplete codes.  This loop is similar to the
       loop above in incrementing huff for table indices.  It is assumed that
       len is equal to curr + drop, so there is no loop needed to increment
       through high index bits.  When the current sub-table is filled, the loop
       drops back to the root table to fill in any remaining entries there.
     */
    here.op = (unsigned char)64;                /* invalid code marker */
    here.bits = (unsigned char)(len - drop);
    here.val = (unsigned short)0;
    while (huff != 0) {
        /* when done with sub-table, drop back to root table */
        if (drop != 0 && (huff & mask) != low) {
            drop = 0;
            len = root;
            next = *table;
            here.bits = (unsigned char)len;
        }

        /* put invalid code marker in table */
        next[huff >> drop] = here;

        /* backwards increment the len-bit code huff */
        incr = 1U << (len - 1);
        while (huff & incr)
            incr >>= 1;
        if (incr != 0) {
            huff &= incr - 1;
            huff += incr;
        }
        else
            huff = 0;
    }

    /* set return parameters */
    *table += used;
    *bits = root;
    return 0;
}
cfitsio-3.47/zlib/inftrees.h0000644000225700000360000000556013464573432015346 0ustar  cagordonlhea/* inftrees.h -- header to use inftrees.c
 * Copyright (C) 1995-2005, 2010 Mark Adler
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

/* WARNING: this file should *not* be used by applications. It is
   part of the implementation of the compression library and is
   subject to change. Applications should only use zlib.h.
 */

/* Structure for decoding tables.  Each entry provides either the
   information needed to do the operation requested by the code that
   indexed that table entry, or it provides a pointer to another
   table that indexes more bits of the code.  op indicates whether
   the entry is a pointer to another table, a literal, a length or
   distance, an end-of-block, or an invalid code.  For a table
   pointer, the low four bits of op is the number of index bits of
   that table.  For a length or distance, the low four bits of op
   is the number of extra bits to get after the code.  bits is
   the number of bits in this code or part of the code to drop off
   of the bit buffer.  val is the actual byte to output in the case
   of a literal, the base length or distance, or the offset from
   the current table to the next table.  Each entry is four bytes. */
typedef struct {
    unsigned char op;           /* operation, extra bits, table bits */
    unsigned char bits;         /* bits in this part of the code */
    unsigned short val;         /* offset in table or code value */
} code;

/* op values as set by inflate_table():
    00000000 - literal
    0000tttt - table link, tttt != 0 is the number of table index bits
    0001eeee - length or distance, eeee is the number of extra bits
    01100000 - end of block
    01000000 - invalid code
 */

/* Maximum size of the dynamic table.  The maximum number of code structures is
   1444, which is the sum of 852 for literal/length codes and 592 for distance
   codes.  These values were found by exhaustive searches using the program
   examples/enough.c found in the zlib distribtution.  The arguments to that
   program are the number of symbols, the initial root table size, and the
   maximum bit length of a code.  "enough 286 9 15" for literal/length codes
   returns returns 852, and "enough 30 6 15" for distance codes returns 592.
   The initial root table size (9 or 6) is found in the fifth argument of the
   inflate_table() calls in inflate.c and infback.c.  If the root table size is
   changed, then these maximum sizes would be need to be recalculated and
   updated. */
#define ENOUGH_LENS 852
#define ENOUGH_DISTS 592
#define ENOUGH (ENOUGH_LENS+ENOUGH_DISTS)

/* Type of code to build for inflate_table() */
typedef enum {
    CODES,
    LENS,
    DISTS
} codetype;

int ZLIB_INTERNAL inflate_table OF((codetype type, unsigned short FAR *lens,
                             unsigned codes, code FAR * FAR *table,
                             unsigned FAR *bits, unsigned short FAR *work));
cfitsio-3.47/zlib/trees.c0000644000225700000360000013025113464573432014640 0ustar  cagordonlhea/* trees.c -- output deflated data using Huffman coding
 * Copyright (C) 1995-2010 Jean-loup Gailly
 * detect_data_type() function provided freely by Cosmin Truta, 2006
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

/*
 *  ALGORITHM
 *
 *      The "deflation" process uses several Huffman trees. The more
 *      common source values are represented by shorter bit sequences.
 *
 *      Each code tree is stored in a compressed form which is itself
 * a Huffman encoding of the lengths of all the code strings (in
 * ascending order by source values).  The actual code strings are
 * reconstructed from the lengths in the inflate process, as described
 * in the deflate specification.
 *
 *  REFERENCES
 *
 *      Deutsch, L.P.,"'Deflate' Compressed Data Format Specification".
 *      Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc
 *
 *      Storer, James A.
 *          Data Compression:  Methods and Theory, pp. 49-50.
 *          Computer Science Press, 1988.  ISBN 0-7167-8156-5.
 *
 *      Sedgewick, R.
 *          Algorithms, p290.
 *          Addison-Wesley, 1983. ISBN 0-201-06672-6.
 */

/* #define GEN_TREES_H */

#include "deflate.h"

#ifdef DEBUG
#  include 
#endif

/* ===========================================================================
 * Constants
 */

#define MAX_BL_BITS 7
/* Bit length codes must not exceed MAX_BL_BITS bits */

#define END_BLOCK 256
/* end of block literal code */

#define REP_3_6      16
/* repeat previous bit length 3-6 times (2 bits of repeat count) */

#define REPZ_3_10    17
/* repeat a zero length 3-10 times  (3 bits of repeat count) */

#define REPZ_11_138  18
/* repeat a zero length 11-138 times  (7 bits of repeat count) */

local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
   = {0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0};

local const int extra_dbits[D_CODES] /* extra bits for each distance code */
   = {0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13};

local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
   = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7};

local const uch bl_order[BL_CODES]
   = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15};
/* The lengths of the bit length codes are sent in order of decreasing
 * probability, to avoid transmitting the lengths for unused bit length codes.
 */

#define Buf_size (8 * 2*sizeof(char))
/* Number of bits used within bi_buf. (bi_buf might be implemented on
 * more than 16 bits on some systems.)
 */

/* ===========================================================================
 * Local data. These are initialized only once.
 */

#define DIST_CODE_LEN  512 /* see definition of array dist_code below */

#if defined(GEN_TREES_H) || !defined(STDC)
/* non ANSI compilers may not accept trees.h */

local ct_data static_ltree[L_CODES+2];
/* The static literal tree. Since the bit lengths are imposed, there is no
 * need for the L_CODES extra codes used during heap construction. However
 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
 * below).
 */

local ct_data static_dtree[D_CODES];
/* The static distance tree. (Actually a trivial tree since all codes use
 * 5 bits.)
 */

uch _dist_code[DIST_CODE_LEN];
/* Distance codes. The first 256 values correspond to the distances
 * 3 .. 258, the last 256 values correspond to the top 8 bits of
 * the 15 bit distances.
 */

uch _length_code[MAX_MATCH-MIN_MATCH+1];
/* length code for each normalized match length (0 == MIN_MATCH) */

local int base_length[LENGTH_CODES];
/* First normalized length for each code (0 = MIN_MATCH) */

local int base_dist[D_CODES];
/* First normalized distance for each code (0 = distance of 1) */

#else
#  include "trees.h"
#endif /* GEN_TREES_H */

struct static_tree_desc_s {
    const ct_data *static_tree;  /* static tree or NULL */
    const intf *extra_bits;      /* extra bits for each code or NULL */
    int     extra_base;          /* base index for extra_bits */
    int     elems;               /* max number of elements in the tree */
    int     max_length;          /* max bit length for the codes */
};

local static_tree_desc  static_l_desc =
{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};

local static_tree_desc  static_d_desc =
{static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS};

local static_tree_desc  static_bl_desc =
{(const ct_data *)0, extra_blbits, 0,   BL_CODES, MAX_BL_BITS};

/* ===========================================================================
 * Local (static) routines in this file.
 */

local void tr_static_init OF((void));
local void init_block     OF((deflate_state *s));
local void pqdownheap     OF((deflate_state *s, ct_data *tree, int k));
local void gen_bitlen     OF((deflate_state *s, tree_desc *desc));
local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
local void build_tree     OF((deflate_state *s, tree_desc *desc));
local void scan_tree      OF((deflate_state *s, ct_data *tree, int max_code));
local void send_tree      OF((deflate_state *s, ct_data *tree, int max_code));
local int  build_bl_tree  OF((deflate_state *s));
local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,
                              int blcodes));
local void compress_block OF((deflate_state *s, ct_data *ltree,
                              ct_data *dtree));
local int  detect_data_type OF((deflate_state *s));
local unsigned bi_reverse OF((unsigned value, int length));
local void bi_windup      OF((deflate_state *s));
local void bi_flush       OF((deflate_state *s));
local void copy_block     OF((deflate_state *s, charf *buf, unsigned len,
                              int header));

#ifdef GEN_TREES_H
local void gen_trees_header OF((void));
#endif

#ifndef DEBUG
#  define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
   /* Send a code of the given tree. c and tree must not have side effects */

#else /* DEBUG */
#  define send_code(s, c, tree) \
     { if (z_verbose>2) fprintf(stderr,"\ncd %3d ",(c)); \
       send_bits(s, tree[c].Code, tree[c].Len); }
#endif

/* ===========================================================================
 * Output a short LSB first on the stream.
 * IN assertion: there is enough room in pendingBuf.
 */
#define put_short(s, w) { \
    put_byte(s, (uch)((w) & 0xff)); \
    put_byte(s, (uch)((ush)(w) >> 8)); \
}

/* ===========================================================================
 * Send a value on a given number of bits.
 * IN assertion: length <= 16 and value fits in length bits.
 */
#ifdef DEBUG
local void send_bits      OF((deflate_state *s, int value, int length));

local void send_bits(s, value, length)
    deflate_state *s;
    int value;  /* value to send */
    int length; /* number of bits */
{
    Tracevv((stderr," l %2d v %4x ", length, value));
    Assert(length > 0 && length <= 15, "invalid length");
    s->bits_sent += (ulg)length;

    /* If not enough room in bi_buf, use (valid) bits from bi_buf and
     * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))
     * unused bits in value.
     */
    if (s->bi_valid > (int)Buf_size - length) {
        s->bi_buf |= (ush)value << s->bi_valid;
        put_short(s, s->bi_buf);
        s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
        s->bi_valid += length - Buf_size;
    } else {
        s->bi_buf |= (ush)value << s->bi_valid;
        s->bi_valid += length;
    }
}
#else /* !DEBUG */

#define send_bits(s, value, length) \
{ int len = length;\
  if (s->bi_valid > (int)Buf_size - len) {\
    int val = value;\
    s->bi_buf |= (ush)val << s->bi_valid;\
    put_short(s, s->bi_buf);\
    s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
    s->bi_valid += len - Buf_size;\
  } else {\
    s->bi_buf |= (ush)(value) << s->bi_valid;\
    s->bi_valid += len;\
  }\
}
#endif /* DEBUG */


/* the arguments must not have side effects */

/* ===========================================================================
 * Initialize the various 'constant' tables.
 */
local void tr_static_init()
{
#if defined(GEN_TREES_H) || !defined(STDC)
    static int static_init_done = 0;
    int n;        /* iterates over tree elements */
    int bits;     /* bit counter */
    int length;   /* length value */
    int code;     /* code value */
    int dist;     /* distance index */
    ush bl_count[MAX_BITS+1];
    /* number of codes at each bit length for an optimal tree */

    if (static_init_done) return;

    /* For some embedded targets, global variables are not initialized: */
#ifdef NO_INIT_GLOBAL_POINTERS
    static_l_desc.static_tree = static_ltree;
    static_l_desc.extra_bits = extra_lbits;
    static_d_desc.static_tree = static_dtree;
    static_d_desc.extra_bits = extra_dbits;
    static_bl_desc.extra_bits = extra_blbits;
#endif

    /* Initialize the mapping length (0..255) -> length code (0..28) */
    length = 0;
    for (code = 0; code < LENGTH_CODES-1; code++) {
        base_length[code] = length;
        for (n = 0; n < (1< dist code (0..29) */
    dist = 0;
    for (code = 0 ; code < 16; code++) {
        base_dist[code] = dist;
        for (n = 0; n < (1<>= 7; /* from now on, all distances are divided by 128 */
    for ( ; code < D_CODES; code++) {
        base_dist[code] = dist << 7;
        for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {
            _dist_code[256 + dist++] = (uch)code;
        }
    }
    Assert (dist == 256, "tr_static_init: 256+dist != 512");

    /* Construct the codes of the static literal tree */
    for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
    n = 0;
    while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
    while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
    while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
    while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
    /* Codes 286 and 287 do not exist, but we must include them in the
     * tree construction to get a canonical Huffman tree (longest code
     * all ones)
     */
    gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);

    /* The static distance tree is trivial: */
    for (n = 0; n < D_CODES; n++) {
        static_dtree[n].Len = 5;
        static_dtree[n].Code = bi_reverse((unsigned)n, 5);
    }
    static_init_done = 1;

#  ifdef GEN_TREES_H
    gen_trees_header();
#  endif
#endif /* defined(GEN_TREES_H) || !defined(STDC) */
}

/* ===========================================================================
 * Genererate the file trees.h describing the static trees.
 */
#ifdef GEN_TREES_H
#  ifndef DEBUG
#    include 
#  endif

#  define SEPARATOR(i, last, width) \
      ((i) == (last)? "\n};\n\n" :    \
       ((i) % (width) == (width)-1 ? ",\n" : ", "))

void gen_trees_header()
{
    FILE *header = fopen("trees.h", "w");
    int i;

    Assert (header != NULL, "Can't open trees.h");
    fprintf(header,
            "/* header created automatically with -DGEN_TREES_H */\n\n");

    fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
    for (i = 0; i < L_CODES+2; i++) {
        fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code,
                static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
    }

    fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n");
    for (i = 0; i < D_CODES; i++) {
        fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code,
                static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
    }

    fprintf(header, "const uch ZLIB_INTERNAL _dist_code[DIST_CODE_LEN] = {\n");
    for (i = 0; i < DIST_CODE_LEN; i++) {
        fprintf(header, "%2u%s", _dist_code[i],
                SEPARATOR(i, DIST_CODE_LEN-1, 20));
    }

    fprintf(header,
        "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
    for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
        fprintf(header, "%2u%s", _length_code[i],
                SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
    }

    fprintf(header, "local const int base_length[LENGTH_CODES] = {\n");
    for (i = 0; i < LENGTH_CODES; i++) {
        fprintf(header, "%1u%s", base_length[i],
                SEPARATOR(i, LENGTH_CODES-1, 20));
    }

    fprintf(header, "local const int base_dist[D_CODES] = {\n");
    for (i = 0; i < D_CODES; i++) {
        fprintf(header, "%5u%s", base_dist[i],
                SEPARATOR(i, D_CODES-1, 10));
    }

    fclose(header);
}
#endif /* GEN_TREES_H */

/* ===========================================================================
 * Initialize the tree data structures for a new zlib stream.
 */
void ZLIB_INTERNAL _tr_init(s)
    deflate_state *s;
{
    tr_static_init();

    s->l_desc.dyn_tree = s->dyn_ltree;
    s->l_desc.stat_desc = &static_l_desc;

    s->d_desc.dyn_tree = s->dyn_dtree;
    s->d_desc.stat_desc = &static_d_desc;

    s->bl_desc.dyn_tree = s->bl_tree;
    s->bl_desc.stat_desc = &static_bl_desc;

    s->bi_buf = 0;
    s->bi_valid = 0;
    s->last_eob_len = 8; /* enough lookahead for inflate */
#ifdef DEBUG
    s->compressed_len = 0L;
    s->bits_sent = 0L;
#endif

    /* Initialize the first block of the first file: */
    init_block(s);
}

/* ===========================================================================
 * Initialize a new block.
 */
local void init_block(s)
    deflate_state *s;
{
    int n; /* iterates over tree elements */

    /* Initialize the trees. */
    for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
    for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
    for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;

    s->dyn_ltree[END_BLOCK].Freq = 1;
    s->opt_len = s->static_len = 0L;
    s->last_lit = s->matches = 0;
}

#define SMALLEST 1
/* Index within the heap array of least frequent node in the Huffman tree */


/* ===========================================================================
 * Remove the smallest element from the heap and recreate the heap with
 * one less element. Updates heap and heap_len.
 */
#define pqremove(s, tree, top) \
{\
    top = s->heap[SMALLEST]; \
    s->heap[SMALLEST] = s->heap[s->heap_len--]; \
    pqdownheap(s, tree, SMALLEST); \
}

/* ===========================================================================
 * Compares to subtrees, using the tree depth as tie breaker when
 * the subtrees have equal frequency. This minimizes the worst case length.
 */
#define smaller(tree, n, m, depth) \
   (tree[n].Freq < tree[m].Freq || \
   (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))

/* ===========================================================================
 * Restore the heap property by moving down the tree starting at node k,
 * exchanging a node with the smallest of its two sons if necessary, stopping
 * when the heap property is re-established (each father smaller than its
 * two sons).
 */
local void pqdownheap(s, tree, k)
    deflate_state *s;
    ct_data *tree;  /* the tree to restore */
    int k;               /* node to move down */
{
    int v = s->heap[k];
    int j = k << 1;  /* left son of k */
    while (j <= s->heap_len) {
        /* Set j to the smallest of the two sons: */
        if (j < s->heap_len &&
            smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
            j++;
        }
        /* Exit if v is smaller than both sons */
        if (smaller(tree, v, s->heap[j], s->depth)) break;

        /* Exchange v with the smallest son */
        s->heap[k] = s->heap[j];  k = j;

        /* And continue down the tree, setting j to the left son of k */
        j <<= 1;
    }
    s->heap[k] = v;
}

/* ===========================================================================
 * Compute the optimal bit lengths for a tree and update the total bit length
 * for the current block.
 * IN assertion: the fields freq and dad are set, heap[heap_max] and
 *    above are the tree nodes sorted by increasing frequency.
 * OUT assertions: the field len is set to the optimal bit length, the
 *     array bl_count contains the frequencies for each bit length.
 *     The length opt_len is updated; static_len is also updated if stree is
 *     not null.
 */
local void gen_bitlen(s, desc)
    deflate_state *s;
    tree_desc *desc;    /* the tree descriptor */
{
    ct_data *tree        = desc->dyn_tree;
    int max_code         = desc->max_code;
    const ct_data *stree = desc->stat_desc->static_tree;
    const intf *extra    = desc->stat_desc->extra_bits;
    int base             = desc->stat_desc->extra_base;
    int max_length       = desc->stat_desc->max_length;
    int h;              /* heap index */
    int n, m;           /* iterate over the tree elements */
    int bits;           /* bit length */
    int xbits;          /* extra bits */
    ush f;              /* frequency */
    int overflow = 0;   /* number of elements with bit length too large */

    for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;

    /* In a first pass, compute the optimal bit lengths (which may
     * overflow in the case of the bit length tree).
     */
    tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */

    for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
        n = s->heap[h];
        bits = tree[tree[n].Dad].Len + 1;
        if (bits > max_length) bits = max_length, overflow++;
        tree[n].Len = (ush)bits;
        /* We overwrite tree[n].Dad which is no longer needed */

        if (n > max_code) continue; /* not a leaf node */

        s->bl_count[bits]++;
        xbits = 0;
        if (n >= base) xbits = extra[n-base];
        f = tree[n].Freq;
        s->opt_len += (ulg)f * (bits + xbits);
        if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
    }
    if (overflow == 0) return;

    Trace((stderr,"\nbit length overflow\n"));
    /* This happens for example on obj2 and pic of the Calgary corpus */

    /* Find the first bit length which could increase: */
    do {
        bits = max_length-1;
        while (s->bl_count[bits] == 0) bits--;
        s->bl_count[bits]--;      /* move one leaf down the tree */
        s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
        s->bl_count[max_length]--;
        /* The brother of the overflow item also moves one step up,
         * but this does not affect bl_count[max_length]
         */
        overflow -= 2;
    } while (overflow > 0);

    /* Now recompute all bit lengths, scanning in increasing frequency.
     * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
     * lengths instead of fixing only the wrong ones. This idea is taken
     * from 'ar' written by Haruhiko Okumura.)
     */
    for (bits = max_length; bits != 0; bits--) {
        n = s->bl_count[bits];
        while (n != 0) {
            m = s->heap[--h];
            if (m > max_code) continue;
            if ((unsigned) tree[m].Len != (unsigned) bits) {
                Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
                s->opt_len += ((long)bits - (long)tree[m].Len)
                              *(long)tree[m].Freq;
                tree[m].Len = (ush)bits;
            }
            n--;
        }
    }
}

/* ===========================================================================
 * Generate the codes for a given tree and bit counts (which need not be
 * optimal).
 * IN assertion: the array bl_count contains the bit length statistics for
 * the given tree and the field len is set for all tree elements.
 * OUT assertion: the field code is set for all tree elements of non
 *     zero code length.
 */
local void gen_codes (tree, max_code, bl_count)
    ct_data *tree;             /* the tree to decorate */
    int max_code;              /* largest code with non zero frequency */
    ushf *bl_count;            /* number of codes at each bit length */
{
    ush next_code[MAX_BITS+1]; /* next code value for each bit length */
    ush code = 0;              /* running code value */
    int bits;                  /* bit index */
    int n;                     /* code index */

    /* The distribution counts are first used to generate the code values
     * without bit reversal.
     */
    for (bits = 1; bits <= MAX_BITS; bits++) {
        next_code[bits] = code = (code + bl_count[bits-1]) << 1;
    }
    /* Check that the bit counts in bl_count are consistent. The last code
     * must be all ones.
     */
    Assert (code + bl_count[MAX_BITS]-1 == (1<dyn_tree;
    const ct_data *stree  = desc->stat_desc->static_tree;
    int elems             = desc->stat_desc->elems;
    int n, m;          /* iterate over heap elements */
    int max_code = -1; /* largest code with non zero frequency */
    int node;          /* new node being created */

    /* Construct the initial heap, with least frequent element in
     * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
     * heap[0] is not used.
     */
    s->heap_len = 0, s->heap_max = HEAP_SIZE;

    for (n = 0; n < elems; n++) {
        if (tree[n].Freq != 0) {
            s->heap[++(s->heap_len)] = max_code = n;
            s->depth[n] = 0;
        } else {
            tree[n].Len = 0;
        }
    }

    /* The pkzip format requires that at least one distance code exists,
     * and that at least one bit should be sent even if there is only one
     * possible code. So to avoid special checks later on we force at least
     * two codes of non zero frequency.
     */
    while (s->heap_len < 2) {
        node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
        tree[node].Freq = 1;
        s->depth[node] = 0;
        s->opt_len--; if (stree) s->static_len -= stree[node].Len;
        /* node is 0 or 1 so it does not have extra bits */
    }
    desc->max_code = max_code;

    /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
     * establish sub-heaps of increasing lengths:
     */
    for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);

    /* Construct the Huffman tree by repeatedly combining the least two
     * frequent nodes.
     */
    node = elems;              /* next internal node of the tree */
    do {
        pqremove(s, tree, n);  /* n = node of least frequency */
        m = s->heap[SMALLEST]; /* m = node of next least frequency */

        s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
        s->heap[--(s->heap_max)] = m;

        /* Create a new node father of n and m */
        tree[node].Freq = tree[n].Freq + tree[m].Freq;
        s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
                                s->depth[n] : s->depth[m]) + 1);
        tree[n].Dad = tree[m].Dad = (ush)node;
#ifdef DUMP_BL_TREE
        if (tree == s->bl_tree) {
            fprintf(stderr,"\nnode %d(%d), sons %d(%d) %d(%d)",
                    node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
        }
#endif
        /* and insert the new node in the heap */
        s->heap[SMALLEST] = node++;
        pqdownheap(s, tree, SMALLEST);

    } while (s->heap_len >= 2);

    s->heap[--(s->heap_max)] = s->heap[SMALLEST];

    /* At this point, the fields freq and dad are set. We can now
     * generate the bit lengths.
     */
    gen_bitlen(s, (tree_desc *)desc);

    /* The field len is now set, we can generate the bit codes */
    gen_codes ((ct_data *)tree, max_code, s->bl_count);
}

/* ===========================================================================
 * Scan a literal or distance tree to determine the frequencies of the codes
 * in the bit length tree.
 */
local void scan_tree (s, tree, max_code)
    deflate_state *s;
    ct_data *tree;   /* the tree to be scanned */
    int max_code;    /* and its largest code of non zero frequency */
{
    int n;                     /* iterates over all tree elements */
    int prevlen = -1;          /* last emitted length */
    int curlen;                /* length of current code */
    int nextlen = tree[0].Len; /* length of next code */
    int count = 0;             /* repeat count of the current code */
    int max_count = 7;         /* max repeat count */
    int min_count = 4;         /* min repeat count */

    if (nextlen == 0) max_count = 138, min_count = 3;
    tree[max_code+1].Len = (ush)0xffff; /* guard */

    for (n = 0; n <= max_code; n++) {
        curlen = nextlen; nextlen = tree[n+1].Len;
        if (++count < max_count && curlen == nextlen) {
            continue;
        } else if (count < min_count) {
            s->bl_tree[curlen].Freq += count;
        } else if (curlen != 0) {
            if (curlen != prevlen) s->bl_tree[curlen].Freq++;
            s->bl_tree[REP_3_6].Freq++;
        } else if (count <= 10) {
            s->bl_tree[REPZ_3_10].Freq++;
        } else {
            s->bl_tree[REPZ_11_138].Freq++;
        }
        count = 0; prevlen = curlen;
        if (nextlen == 0) {
            max_count = 138, min_count = 3;
        } else if (curlen == nextlen) {
            max_count = 6, min_count = 3;
        } else {
            max_count = 7, min_count = 4;
        }
    }
}

/* ===========================================================================
 * Send a literal or distance tree in compressed form, using the codes in
 * bl_tree.
 */
local void send_tree (s, tree, max_code)
    deflate_state *s;
    ct_data *tree; /* the tree to be scanned */
    int max_code;       /* and its largest code of non zero frequency */
{
    int n;                     /* iterates over all tree elements */
    int prevlen = -1;          /* last emitted length */
    int curlen;                /* length of current code */
    int nextlen = tree[0].Len; /* length of next code */
    int count = 0;             /* repeat count of the current code */
    int max_count = 7;         /* max repeat count */
    int min_count = 4;         /* min repeat count */

    /* tree[max_code+1].Len = -1; */  /* guard already set */
    if (nextlen == 0) max_count = 138, min_count = 3;

    for (n = 0; n <= max_code; n++) {
        curlen = nextlen; nextlen = tree[n+1].Len;
        if (++count < max_count && curlen == nextlen) {
            continue;
        } else if (count < min_count) {
            do { send_code(s, curlen, s->bl_tree); } while (--count != 0);

        } else if (curlen != 0) {
            if (curlen != prevlen) {
                send_code(s, curlen, s->bl_tree); count--;
            }
            Assert(count >= 3 && count <= 6, " 3_6?");
            send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);

        } else if (count <= 10) {
            send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);

        } else {
            send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
        }
        count = 0; prevlen = curlen;
        if (nextlen == 0) {
            max_count = 138, min_count = 3;
        } else if (curlen == nextlen) {
            max_count = 6, min_count = 3;
        } else {
            max_count = 7, min_count = 4;
        }
    }
}

/* ===========================================================================
 * Construct the Huffman tree for the bit lengths and return the index in
 * bl_order of the last bit length code to send.
 */
local int build_bl_tree(s)
    deflate_state *s;
{
    int max_blindex;  /* index of last bit length code of non zero freq */

    /* Determine the bit length frequencies for literal and distance trees */
    scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
    scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);

    /* Build the bit length tree: */
    build_tree(s, (tree_desc *)(&(s->bl_desc)));
    /* opt_len now includes the length of the tree representations, except
     * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
     */

    /* Determine the number of bit length codes to send. The pkzip format
     * requires that at least 4 bit length codes be sent. (appnote.txt says
     * 3 but the actual value used is 4.)
     */
    for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
        if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
    }
    /* Update opt_len to include the bit length tree and counts */
    s->opt_len += 3*(max_blindex+1) + 5+5+4;
    Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",
            s->opt_len, s->static_len));

    return max_blindex;
}

/* ===========================================================================
 * Send the header for a block using dynamic Huffman trees: the counts, the
 * lengths of the bit length codes, the literal tree and the distance tree.
 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
 */
local void send_all_trees(s, lcodes, dcodes, blcodes)
    deflate_state *s;
    int lcodes, dcodes, blcodes; /* number of codes for each tree */
{
    int rank;                    /* index in bl_order */

    Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
    Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
            "too many codes");
    Tracev((stderr, "\nbl counts: "));
    send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */
    send_bits(s, dcodes-1,   5);
    send_bits(s, blcodes-4,  4); /* not -3 as stated in appnote.txt */
    for (rank = 0; rank < blcodes; rank++) {
        Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
        send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
    }
    Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));

    send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
    Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));

    send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
    Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));
}

/* ===========================================================================
 * Send a stored block
 */
void ZLIB_INTERNAL _tr_stored_block(s, buf, stored_len, last)
    deflate_state *s;
    charf *buf;       /* input block */
    ulg stored_len;   /* length of input block */
    int last;         /* one if this is the last block for a file */
{
    send_bits(s, (STORED_BLOCK<<1)+last, 3);    /* send block type */
#ifdef DEBUG
    s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;
    s->compressed_len += (stored_len + 4) << 3;
#endif
    copy_block(s, buf, (unsigned)stored_len, 1); /* with header */
}

/* ===========================================================================
 * Send one empty static block to give enough lookahead for inflate.
 * This takes 10 bits, of which 7 may remain in the bit buffer.
 * The current inflate code requires 9 bits of lookahead. If the
 * last two codes for the previous block (real code plus EOB) were coded
 * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode
 * the last real code. In this case we send two empty static blocks instead
 * of one. (There are no problems if the previous block is stored or fixed.)
 * To simplify the code, we assume the worst case of last real code encoded
 * on one bit only.
 */
void ZLIB_INTERNAL _tr_align(s)
    deflate_state *s;
{
    send_bits(s, STATIC_TREES<<1, 3);
    send_code(s, END_BLOCK, static_ltree);
#ifdef DEBUG
    s->compressed_len += 10L; /* 3 for block type, 7 for EOB */
#endif
    bi_flush(s);
    /* Of the 10 bits for the empty block, we have already sent
     * (10 - bi_valid) bits. The lookahead for the last real code (before
     * the EOB of the previous block) was thus at least one plus the length
     * of the EOB plus what we have just sent of the empty static block.
     */
    if (1 + s->last_eob_len + 10 - s->bi_valid < 9) {
        send_bits(s, STATIC_TREES<<1, 3);
        send_code(s, END_BLOCK, static_ltree);
#ifdef DEBUG
        s->compressed_len += 10L;
#endif
        bi_flush(s);
    }
    s->last_eob_len = 7;
}

/* ===========================================================================
 * Determine the best encoding for the current block: dynamic trees, static
 * trees or store, and output the encoded block to the zip file.
 */
void ZLIB_INTERNAL _tr_flush_block(s, buf, stored_len, last)
    deflate_state *s;
    charf *buf;       /* input block, or NULL if too old */
    ulg stored_len;   /* length of input block */
    int last;         /* one if this is the last block for a file */
{
    ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
    int max_blindex = 0;  /* index of last bit length code of non zero freq */

    /* Build the Huffman trees unless a stored block is forced */
    if (s->level > 0) {

        /* Check if the file is binary or text */
        if (s->strm->data_type == Z_UNKNOWN)
            s->strm->data_type = detect_data_type(s);

        /* Construct the literal and distance trees */
        build_tree(s, (tree_desc *)(&(s->l_desc)));
        Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len,
                s->static_len));

        build_tree(s, (tree_desc *)(&(s->d_desc)));
        Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len,
                s->static_len));
        /* At this point, opt_len and static_len are the total bit lengths of
         * the compressed block data, excluding the tree representations.
         */

        /* Build the bit length tree for the above two trees, and get the index
         * in bl_order of the last bit length code to send.
         */
        max_blindex = build_bl_tree(s);

        /* Determine the best encoding. Compute the block lengths in bytes. */
        opt_lenb = (s->opt_len+3+7)>>3;
        static_lenb = (s->static_len+3+7)>>3;

        Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ",
                opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,
                s->last_lit));

        if (static_lenb <= opt_lenb) opt_lenb = static_lenb;

    } else {
        Assert(buf != (char*)0, "lost buf");
        opt_lenb = static_lenb = stored_len + 5; /* force a stored block */
    }

#ifdef FORCE_STORED
    if (buf != (char*)0) { /* force stored block */
#else
    if (stored_len+4 <= opt_lenb && buf != (char*)0) {
                       /* 4: two words for the lengths */
#endif
        /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
         * Otherwise we can't have processed more than WSIZE input bytes since
         * the last block flush, because compression would have been
         * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
         * transform a block into a stored block.
         */
        _tr_stored_block(s, buf, stored_len, last);

#ifdef FORCE_STATIC
    } else if (static_lenb >= 0) { /* force static trees */
#else
    } else if (s->strategy == Z_FIXED || static_lenb == opt_lenb) {
#endif
        send_bits(s, (STATIC_TREES<<1)+last, 3);
        compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);
#ifdef DEBUG
        s->compressed_len += 3 + s->static_len;
#endif
    } else {
        send_bits(s, (DYN_TREES<<1)+last, 3);
        send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,
                       max_blindex+1);
        compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
#ifdef DEBUG
        s->compressed_len += 3 + s->opt_len;
#endif
    }
    Assert (s->compressed_len == s->bits_sent, "bad compressed size");
    /* The above check is made mod 2^32, for files larger than 512 MB
     * and uLong implemented on 32 bits.
     */
    init_block(s);

    if (last) {
        bi_windup(s);
#ifdef DEBUG
        s->compressed_len += 7;  /* align on byte boundary */
#endif
    }
    Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3,
           s->compressed_len-7*last));
}

/* ===========================================================================
 * Save the match info and tally the frequency counts. Return true if
 * the current block must be flushed.
 */
int ZLIB_INTERNAL _tr_tally (s, dist, lc)
    deflate_state *s;
    unsigned dist;  /* distance of matched string */
    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */
{
    s->d_buf[s->last_lit] = (ush)dist;
    s->l_buf[s->last_lit++] = (uch)lc;
    if (dist == 0) {
        /* lc is the unmatched char */
        s->dyn_ltree[lc].Freq++;
    } else {
        s->matches++;
        /* Here, lc is the match length - MIN_MATCH */
        dist--;             /* dist = match distance - 1 */
        Assert((ush)dist < (ush)MAX_DIST(s) &&
               (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
               (ush)d_code(dist) < (ush)D_CODES,  "_tr_tally: bad match");

        s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
        s->dyn_dtree[d_code(dist)].Freq++;
    }

#ifdef TRUNCATE_BLOCK
    /* Try to guess if it is profitable to stop the current block here */
    if ((s->last_lit & 0x1fff) == 0 && s->level > 2) {
        /* Compute an upper bound for the compressed length */
        ulg out_length = (ulg)s->last_lit*8L;
        ulg in_length = (ulg)((long)s->strstart - s->block_start);
        int dcode;
        for (dcode = 0; dcode < D_CODES; dcode++) {
            out_length += (ulg)s->dyn_dtree[dcode].Freq *
                (5L+extra_dbits[dcode]);
        }
        out_length >>= 3;
        Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ",
               s->last_lit, in_length, out_length,
               100L - out_length*100L/in_length));
        if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1;
    }
#endif
    return (s->last_lit == s->lit_bufsize-1);
    /* We avoid equality with lit_bufsize because of wraparound at 64K
     * on 16 bit machines and because stored blocks are restricted to
     * 64K-1 bytes.
     */
}

/* ===========================================================================
 * Send the block data compressed using the given Huffman trees
 */
local void compress_block(s, ltree, dtree)
    deflate_state *s;
    ct_data *ltree; /* literal tree */
    ct_data *dtree; /* distance tree */
{
    unsigned dist;      /* distance of matched string */
    int lc;             /* match length or unmatched char (if dist == 0) */
    unsigned lx = 0;    /* running index in l_buf */
    unsigned code;      /* the code to send */
    int extra;          /* number of extra bits to send */

    if (s->last_lit != 0) do {
        dist = s->d_buf[lx];
        lc = s->l_buf[lx++];
        if (dist == 0) {
            send_code(s, lc, ltree); /* send a literal byte */
            Tracecv(isgraph(lc), (stderr," '%c' ", lc));
        } else {
            /* Here, lc is the match length - MIN_MATCH */
            code = _length_code[lc];
            send_code(s, code+LITERALS+1, ltree); /* send the length code */
            extra = extra_lbits[code];
            if (extra != 0) {
                lc -= base_length[code];
                send_bits(s, lc, extra);       /* send the extra length bits */
            }
            dist--; /* dist is now the match distance - 1 */
            code = d_code(dist);
            Assert (code < D_CODES, "bad d_code");

            send_code(s, code, dtree);       /* send the distance code */
            extra = extra_dbits[code];
            if (extra != 0) {
                dist -= base_dist[code];
                send_bits(s, dist, extra);   /* send the extra distance bits */
            }
        } /* literal or match pair ? */

        /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */
        Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,
               "pendingBuf overflow");

    } while (lx < s->last_lit);

    send_code(s, END_BLOCK, ltree);
    s->last_eob_len = ltree[END_BLOCK].Len;
}

/* ===========================================================================
 * Check if the data type is TEXT or BINARY, using the following algorithm:
 * - TEXT if the two conditions below are satisfied:
 *    a) There are no non-portable control characters belonging to the
 *       "black list" (0..6, 14..25, 28..31).
 *    b) There is at least one printable character belonging to the
 *       "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).
 * - BINARY otherwise.
 * - The following partially-portable control characters form a
 *   "gray list" that is ignored in this detection algorithm:
 *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).
 * IN assertion: the fields Freq of dyn_ltree are set.
 */
local int detect_data_type(s)
    deflate_state *s;
{
    /* black_mask is the bit mask of black-listed bytes
     * set bits 0..6, 14..25, and 28..31
     * 0xf3ffc07f = binary 11110011111111111100000001111111
     */
    unsigned long black_mask = 0xf3ffc07fUL;
    int n;

    /* Check for non-textual ("black-listed") bytes. */
    for (n = 0; n <= 31; n++, black_mask >>= 1)
        if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
            return Z_BINARY;

    /* Check for textual ("white-listed") bytes. */
    if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
            || s->dyn_ltree[13].Freq != 0)
        return Z_TEXT;
    for (n = 32; n < LITERALS; n++)
        if (s->dyn_ltree[n].Freq != 0)
            return Z_TEXT;

    /* There are no "black-listed" or "white-listed" bytes:
     * this stream either is empty or has tolerated ("gray-listed") bytes only.
     */
    return Z_BINARY;
}

/* ===========================================================================
 * Reverse the first len bits of a code, using straightforward code (a faster
 * method would use a table)
 * IN assertion: 1 <= len <= 15
 */
local unsigned bi_reverse(code, len)
    unsigned code; /* the value to invert */
    int len;       /* its bit length */
{
    register unsigned res = 0;
    do {
        res |= code & 1;
        code >>= 1, res <<= 1;
    } while (--len > 0);
    return res >> 1;
}

/* ===========================================================================
 * Flush the bit buffer, keeping at most 7 bits in it.
 */
local void bi_flush(s)
    deflate_state *s;
{
    if (s->bi_valid == 16) {
        put_short(s, s->bi_buf);
        s->bi_buf = 0;
        s->bi_valid = 0;
    } else if (s->bi_valid >= 8) {
        put_byte(s, (Byte)s->bi_buf);
        s->bi_buf >>= 8;
        s->bi_valid -= 8;
    }
}

/* ===========================================================================
 * Flush the bit buffer and align the output on a byte boundary
 */
local void bi_windup(s)
    deflate_state *s;
{
    if (s->bi_valid > 8) {
        put_short(s, s->bi_buf);
    } else if (s->bi_valid > 0) {
        put_byte(s, (Byte)s->bi_buf);
    }
    s->bi_buf = 0;
    s->bi_valid = 0;
#ifdef DEBUG
    s->bits_sent = (s->bits_sent+7) & ~7;
#endif
}

/* ===========================================================================
 * Copy a stored block, storing first the length and its
 * one's complement if requested.
 */
local void copy_block(s, buf, len, header)
    deflate_state *s;
    charf    *buf;    /* the input data */
    unsigned len;     /* its length */
    int      header;  /* true if block header must be written */
{
    bi_windup(s);        /* align on byte boundary */
    s->last_eob_len = 8; /* enough lookahead for inflate */

    if (header) {
        put_short(s, (ush)len);
        put_short(s, (ush)~len);
#ifdef DEBUG
        s->bits_sent += 2*16;
#endif
    }
#ifdef DEBUG
    s->bits_sent += (ulg)len<<3;
#endif
    while (len--) {
        put_byte(s, *buf++);
    }
}
cfitsio-3.47/zlib/trees.h0000644000225700000360000002043013464573432014642 0ustar  cagordonlhea/* header created automatically with -DGEN_TREES_H */

local const ct_data static_ltree[L_CODES+2] = {
{{ 12},{  8}}, {{140},{  8}}, {{ 76},{  8}}, {{204},{  8}}, {{ 44},{  8}},
{{172},{  8}}, {{108},{  8}}, {{236},{  8}}, {{ 28},{  8}}, {{156},{  8}},
{{ 92},{  8}}, {{220},{  8}}, {{ 60},{  8}}, {{188},{  8}}, {{124},{  8}},
{{252},{  8}}, {{  2},{  8}}, {{130},{  8}}, {{ 66},{  8}}, {{194},{  8}},
{{ 34},{  8}}, {{162},{  8}}, {{ 98},{  8}}, {{226},{  8}}, {{ 18},{  8}},
{{146},{  8}}, {{ 82},{  8}}, {{210},{  8}}, {{ 50},{  8}}, {{178},{  8}},
{{114},{  8}}, {{242},{  8}}, {{ 10},{  8}}, {{138},{  8}}, {{ 74},{  8}},
{{202},{  8}}, {{ 42},{  8}}, {{170},{  8}}, {{106},{  8}}, {{234},{  8}},
{{ 26},{  8}}, {{154},{  8}}, {{ 90},{  8}}, {{218},{  8}}, {{ 58},{  8}},
{{186},{  8}}, {{122},{  8}}, {{250},{  8}}, {{  6},{  8}}, {{134},{  8}},
{{ 70},{  8}}, {{198},{  8}}, {{ 38},{  8}}, {{166},{  8}}, {{102},{  8}},
{{230},{  8}}, {{ 22},{  8}}, {{150},{  8}}, {{ 86},{  8}}, {{214},{  8}},
{{ 54},{  8}}, {{182},{  8}}, {{118},{  8}}, {{246},{  8}}, {{ 14},{  8}},
{{142},{  8}}, {{ 78},{  8}}, {{206},{  8}}, {{ 46},{  8}}, {{174},{  8}},
{{110},{  8}}, {{238},{  8}}, {{ 30},{  8}}, {{158},{  8}}, {{ 94},{  8}},
{{222},{  8}}, {{ 62},{  8}}, {{190},{  8}}, {{126},{  8}}, {{254},{  8}},
{{  1},{  8}}, {{129},{  8}}, {{ 65},{  8}}, {{193},{  8}}, {{ 33},{  8}},
{{161},{  8}}, {{ 97},{  8}}, {{225},{  8}}, {{ 17},{  8}}, {{145},{  8}},
{{ 81},{  8}}, {{209},{  8}}, {{ 49},{  8}}, {{177},{  8}}, {{113},{  8}},
{{241},{  8}}, {{  9},{  8}}, {{137},{  8}}, {{ 73},{  8}}, {{201},{  8}},
{{ 41},{  8}}, {{169},{  8}}, {{105},{  8}}, {{233},{  8}}, {{ 25},{  8}},
{{153},{  8}}, {{ 89},{  8}}, {{217},{  8}}, {{ 57},{  8}}, {{185},{  8}},
{{121},{  8}}, {{249},{  8}}, {{  5},{  8}}, {{133},{  8}}, {{ 69},{  8}},
{{197},{  8}}, {{ 37},{  8}}, {{165},{  8}}, {{101},{  8}}, {{229},{  8}},
{{ 21},{  8}}, {{149},{  8}}, {{ 85},{  8}}, {{213},{  8}}, {{ 53},{  8}},
{{181},{  8}}, {{117},{  8}}, {{245},{  8}}, {{ 13},{  8}}, {{141},{  8}},
{{ 77},{  8}}, {{205},{  8}}, {{ 45},{  8}}, {{173},{  8}}, {{109},{  8}},
{{237},{  8}}, {{ 29},{  8}}, {{157},{  8}}, {{ 93},{  8}}, {{221},{  8}},
{{ 61},{  8}}, {{189},{  8}}, {{125},{  8}}, {{253},{  8}}, {{ 19},{  9}},
{{275},{  9}}, {{147},{  9}}, {{403},{  9}}, {{ 83},{  9}}, {{339},{  9}},
{{211},{  9}}, {{467},{  9}}, {{ 51},{  9}}, {{307},{  9}}, {{179},{  9}},
{{435},{  9}}, {{115},{  9}}, {{371},{  9}}, {{243},{  9}}, {{499},{  9}},
{{ 11},{  9}}, {{267},{  9}}, {{139},{  9}}, {{395},{  9}}, {{ 75},{  9}},
{{331},{  9}}, {{203},{  9}}, {{459},{  9}}, {{ 43},{  9}}, {{299},{  9}},
{{171},{  9}}, {{427},{  9}}, {{107},{  9}}, {{363},{  9}}, {{235},{  9}},
{{491},{  9}}, {{ 27},{  9}}, {{283},{  9}}, {{155},{  9}}, {{411},{  9}},
{{ 91},{  9}}, {{347},{  9}}, {{219},{  9}}, {{475},{  9}}, {{ 59},{  9}},
{{315},{  9}}, {{187},{  9}}, {{443},{  9}}, {{123},{  9}}, {{379},{  9}},
{{251},{  9}}, {{507},{  9}}, {{  7},{  9}}, {{263},{  9}}, {{135},{  9}},
{{391},{  9}}, {{ 71},{  9}}, {{327},{  9}}, {{199},{  9}}, {{455},{  9}},
{{ 39},{  9}}, {{295},{  9}}, {{167},{  9}}, {{423},{  9}}, {{103},{  9}},
{{359},{  9}}, {{231},{  9}}, {{487},{  9}}, {{ 23},{  9}}, {{279},{  9}},
{{151},{  9}}, {{407},{  9}}, {{ 87},{  9}}, {{343},{  9}}, {{215},{  9}},
{{471},{  9}}, {{ 55},{  9}}, {{311},{  9}}, {{183},{  9}}, {{439},{  9}},
{{119},{  9}}, {{375},{  9}}, {{247},{  9}}, {{503},{  9}}, {{ 15},{  9}},
{{271},{  9}}, {{143},{  9}}, {{399},{  9}}, {{ 79},{  9}}, {{335},{  9}},
{{207},{  9}}, {{463},{  9}}, {{ 47},{  9}}, {{303},{  9}}, {{175},{  9}},
{{431},{  9}}, {{111},{  9}}, {{367},{  9}}, {{239},{  9}}, {{495},{  9}},
{{ 31},{  9}}, {{287},{  9}}, {{159},{  9}}, {{415},{  9}}, {{ 95},{  9}},
{{351},{  9}}, {{223},{  9}}, {{479},{  9}}, {{ 63},{  9}}, {{319},{  9}},
{{191},{  9}}, {{447},{  9}}, {{127},{  9}}, {{383},{  9}}, {{255},{  9}},
{{511},{  9}}, {{  0},{  7}}, {{ 64},{  7}}, {{ 32},{  7}}, {{ 96},{  7}},
{{ 16},{  7}}, {{ 80},{  7}}, {{ 48},{  7}}, {{112},{  7}}, {{  8},{  7}},
{{ 72},{  7}}, {{ 40},{  7}}, {{104},{  7}}, {{ 24},{  7}}, {{ 88},{  7}},
{{ 56},{  7}}, {{120},{  7}}, {{  4},{  7}}, {{ 68},{  7}}, {{ 36},{  7}},
{{100},{  7}}, {{ 20},{  7}}, {{ 84},{  7}}, {{ 52},{  7}}, {{116},{  7}},
{{  3},{  8}}, {{131},{  8}}, {{ 67},{  8}}, {{195},{  8}}, {{ 35},{  8}},
{{163},{  8}}, {{ 99},{  8}}, {{227},{  8}}
};

local const ct_data static_dtree[D_CODES] = {
{{ 0},{ 5}}, {{16},{ 5}}, {{ 8},{ 5}}, {{24},{ 5}}, {{ 4},{ 5}},
{{20},{ 5}}, {{12},{ 5}}, {{28},{ 5}}, {{ 2},{ 5}}, {{18},{ 5}},
{{10},{ 5}}, {{26},{ 5}}, {{ 6},{ 5}}, {{22},{ 5}}, {{14},{ 5}},
{{30},{ 5}}, {{ 1},{ 5}}, {{17},{ 5}}, {{ 9},{ 5}}, {{25},{ 5}},
{{ 5},{ 5}}, {{21},{ 5}}, {{13},{ 5}}, {{29},{ 5}}, {{ 3},{ 5}},
{{19},{ 5}}, {{11},{ 5}}, {{27},{ 5}}, {{ 7},{ 5}}, {{23},{ 5}}
};

const uch ZLIB_INTERNAL _dist_code[DIST_CODE_LEN] = {
 0,  1,  2,  3,  4,  4,  5,  5,  6,  6,  6,  6,  7,  7,  7,  7,  8,  8,  8,  8,
 8,  8,  8,  8,  9,  9,  9,  9,  9,  9,  9,  9, 10, 10, 10, 10, 10, 10, 10, 10,
10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13,
13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13,
13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,  0,  0, 16, 17,
18, 18, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22,
23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,
26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27,
27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27,
27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29
};

const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
 0,  1,  2,  3,  4,  5,  6,  7,  8,  8,  9,  9, 10, 10, 11, 11, 12, 12, 12, 12,
13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16,
17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19,
19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22,
22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26,
26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,
26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27,
27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28
};

local const int base_length[LENGTH_CODES] = {
0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56,
64, 80, 96, 112, 128, 160, 192, 224, 0
};

local const int base_dist[D_CODES] = {
    0,     1,     2,     3,     4,     6,     8,    12,    16,    24,
   32,    48,    64,    96,   128,   192,   256,   384,   512,   768,
 1024,  1536,  2048,  3072,  4096,  6144,  8192, 12288, 16384, 24576
};

cfitsio-3.47/zlib/uncompr.c0000644000225700000360000000367113464573432015206 0ustar  cagordonlhea/* uncompr.c -- decompress a memory buffer
 * Copyright (C) 1995-2003, 2010 Jean-loup Gailly.
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

#define ZLIB_INTERNAL
#include "zlib.h"

/* ===========================================================================
     Decompresses the source buffer into the destination buffer.  sourceLen is
   the byte length of the source buffer. Upon entry, destLen is the total
   size of the destination buffer, which must be large enough to hold the
   entire uncompressed data. (The size of the uncompressed data must have
   been saved previously by the compressor and transmitted to the decompressor
   by some mechanism outside the scope of this compression library.)
   Upon exit, destLen is the actual size of the compressed buffer.

     uncompress returns Z_OK if success, Z_MEM_ERROR if there was not
   enough memory, Z_BUF_ERROR if there was not enough room in the output
   buffer, or Z_DATA_ERROR if the input data was corrupted.
*/
int ZEXPORT uncompress (dest, destLen, source, sourceLen)
    Bytef *dest;
    uLongf *destLen;
    const Bytef *source;
    uLong sourceLen;
{
    z_stream stream;
    int err;

    stream.next_in = (Bytef*)source;
    stream.avail_in = (uInt)sourceLen;
    /* Check for source > 64K on 16-bit machine: */
    if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR;

    stream.next_out = dest;
    stream.avail_out = (uInt)*destLen;
    if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR;

    stream.zalloc = (alloc_func)0;
    stream.zfree = (free_func)0;

    err = inflateInit(&stream);
    if (err != Z_OK) return err;

    err = inflate(&stream, Z_FINISH);
    if (err != Z_STREAM_END) {
        inflateEnd(&stream);
        if (err == Z_NEED_DICT || (err == Z_BUF_ERROR && stream.avail_in == 0))
            return Z_DATA_ERROR;
        return err;
    }
    *destLen = stream.total_out;

    err = inflateEnd(&stream);
    return err;
}
cfitsio-3.47/zlib/zcompress.c0000644000225700000360000004500213464573432015542 0ustar  cagordonlhea#include 
#include 
#include 
#include 
#include 
#include "zlib.h"  

#define GZBUFSIZE 115200    /* 40 FITS blocks */
#define BUFFINCR   28800    /* 10 FITS blocks */

/* prototype for the following functions */
int uncompress2mem(char *filename, 
             FILE *diskfile, 
             char **buffptr, 
             size_t *buffsize, 
             void *(*mem_realloc)(void *p, size_t newsize),
             size_t *filesize,
             int *status);

int uncompress2mem_from_mem(                                                
             char *inmemptr,     
             size_t inmemsize, 
             char **buffptr,  
             size_t *buffsize,  
             void *(*mem_realloc)(void *p, size_t newsize), 
             size_t *filesize,  
             int *status);

int uncompress2file(char *filename, 
             FILE *indiskfile, 
             FILE *outdiskfile, 
             int *status);


int compress2mem_from_mem(                                                
             char *inmemptr,     
             size_t inmemsize, 
             char **buffptr,  
             size_t *buffsize,  
             void *(*mem_realloc)(void *p, size_t newsize), 
             size_t *filesize,  
             int *status);

int compress2file_from_mem(                                                
             char *inmemptr,     
             size_t inmemsize, 
             FILE *outdiskfile, 
             size_t *filesize,   /* O - size of file, in bytes              */
             int *status);


/*--------------------------------------------------------------------------*/
int uncompress2mem(char *filename,  /* name of input file                 */
             FILE *diskfile,     /* I - file pointer                        */
             char **buffptr,   /* IO - memory pointer                     */
             size_t *buffsize,   /* IO - size of buffer, in bytes           */
             void *(*mem_realloc)(void *p, size_t newsize), /* function     */
             size_t *filesize,   /* O - size of file, in bytes              */
             int *status)        /* IO - error status                       */

/*
  Uncompress the disk file into memory.  Fill whatever amount of memory has
  already been allocated, then realloc more memory, using the supplied
  input function, if necessary.
*/
{
    int err, len;
    char *filebuff;
    z_stream d_stream;   /* decompression stream */
    /* Input args buffptr and buffsize may refer to a block of memory
        larger than the 2^32 4 byte limit.  If so, must be broken
        up into "pages" when assigned to d_stream.  
        (d_stream.avail_out is a uInt type, which might be smaller
        than buffsize's size_t type.)
    */
    const uLong nPages = (uLong)(*buffsize)/(uLong)UINT_MAX;
    uLong iPage=0;
    uInt outbuffsize = (nPages > 0) ? UINT_MAX : (uInt)(*buffsize);
    

    if (*status > 0) 
        return(*status); 

    /* Allocate memory to hold compressed bytes read from the file. */
    filebuff = (char*)malloc(GZBUFSIZE);
    if (!filebuff) return(*status = 113); /* memory error */

    d_stream.zalloc = (alloc_func)0;
    d_stream.zfree = (free_func)0;
    d_stream.opaque = (voidpf)0;
    d_stream.next_out = (unsigned char*) *buffptr;
    d_stream.avail_out = outbuffsize;

    /* Initialize the decompression.  The argument (15+16) tells the
       decompressor that we are to use the gzip algorithm */

    err = inflateInit2(&d_stream, (15+16));
    if (err != Z_OK) return(*status = 414);

    /* loop through the file, reading a buffer and uncompressing it */
    for (;;)
    {
        len = fread(filebuff, 1, GZBUFSIZE, diskfile);
	if (ferror(diskfile)) {
              inflateEnd(&d_stream);
              free(filebuff);
              return(*status = 414);
	}

        if (len == 0) break;  /* no more data */

        d_stream.next_in = (unsigned char*)filebuff;
        d_stream.avail_in = len;

        for (;;) {
            /* uncompress as much of the input as will fit in the output */
            err = inflate(&d_stream, Z_NO_FLUSH);

            if (err == Z_STREAM_END ) { /* We reached the end of the input */
	        break; 
            } else if (err == Z_OK ) { 

                if (!d_stream.avail_in) break; /* need more input */
		
                /* need more space in output buffer */
                /* First check if more memory is available above the
                    4Gb limit in the originally input buffptr array */
                if (iPage < nPages)
                {
                   ++iPage;
                   d_stream.next_out = (unsigned char*)(*buffptr + iPage*(uLong)UINT_MAX);
                   if (iPage < nPages)
                      d_stream.avail_out = UINT_MAX;
                   else
                      d_stream.avail_out = (uInt)((uLong)(*buffsize) % (uLong)UINT_MAX);
                }
                else if (mem_realloc) {   
                    *buffptr = mem_realloc(*buffptr,*buffsize + BUFFINCR);
                    if (*buffptr == NULL){
                        inflateEnd(&d_stream);
                        free(filebuff);
                        return(*status = 414);  /* memory allocation failed */
                    }

                    d_stream.avail_out = BUFFINCR;
                    d_stream.next_out = (unsigned char*) (*buffptr + *buffsize);
                    *buffsize = *buffsize + BUFFINCR;
                } else  { /* error: no realloc function available */
                    inflateEnd(&d_stream);
                    free(filebuff);
                    return(*status = 414);
                }
            } else {  /* some other error */
                inflateEnd(&d_stream);
                free(filebuff);
                return(*status = 414);
            }
        }
	
	if (feof(diskfile))  break;
/*     
        These settings for next_out and avail_out appear to be redundant,
        as the inflate() function should already be re-setting these.
        For case where *buffsize < 4Gb this did not matter, but for
        > 4Gb it would produce the wrong value in the avail_out assignment.
        (C. Gordon Jul 2016)
        d_stream.next_out = (unsigned char*) (*buffptr + d_stream.total_out);
        d_stream.avail_out = *buffsize - d_stream.total_out;
*/    }

    /* Set the output file size to be the total output data */
    *filesize = d_stream.total_out;
    
    free(filebuff); /* free temporary output data buffer */
    
    err = inflateEnd(&d_stream); /* End the decompression */
    if (err != Z_OK) return(*status = 414);
  
    return(*status);
}
/*--------------------------------------------------------------------------*/
int uncompress2mem_from_mem(                                                
             char *inmemptr,     /* I - memory pointer to compressed bytes */
             size_t inmemsize,   /* I - size of input compressed file      */
             char **buffptr,   /* IO - memory pointer                      */
             size_t *buffsize,   /* IO - size of buffer, in bytes           */
             void *(*mem_realloc)(void *p, size_t newsize), /* function     */
             size_t *filesize,   /* O - size of file, in bytes              */
             int *status)        /* IO - error status                       */

/*
  Uncompress the file in memory into memory.  Fill whatever amount of memory has
  already been allocated, then realloc more memory, using the supplied
  input function, if necessary.
*/
{
    int err; 
    z_stream d_stream;   /* decompression stream */

    if (*status > 0) 
        return(*status); 

    d_stream.zalloc = (alloc_func)0;
    d_stream.zfree = (free_func)0;
    d_stream.opaque = (voidpf)0;

    /* Initialize the decompression.  The argument (15+16) tells the
       decompressor that we are to use the gzip algorithm */
    err = inflateInit2(&d_stream, (15+16));
    if (err != Z_OK) return(*status = 414);

    d_stream.next_in = (unsigned char*)inmemptr;
    d_stream.avail_in = inmemsize;

    d_stream.next_out = (unsigned char*) *buffptr;
    d_stream.avail_out = *buffsize;

    for (;;) {
        /* uncompress as much of the input as will fit in the output */
        err = inflate(&d_stream, Z_NO_FLUSH);

        if (err == Z_STREAM_END) { /* We reached the end of the input */
	    break; 
        } else if (err == Z_OK ) { /* need more space in output buffer */

            if (mem_realloc) {   
                *buffptr = mem_realloc(*buffptr,*buffsize + BUFFINCR);
                if (*buffptr == NULL){
                    inflateEnd(&d_stream);
                    return(*status = 414);  /* memory allocation failed */
                }

                d_stream.avail_out = BUFFINCR;
                d_stream.next_out = (unsigned char*) (*buffptr + *buffsize);
                *buffsize = *buffsize + BUFFINCR;

            } else  { /* error: no realloc function available */
                inflateEnd(&d_stream);
                return(*status = 414);
            }
        } else {  /* some other error */
            inflateEnd(&d_stream);
            return(*status = 414);
        }
    }

    /* Set the output file size to be the total output data */
    if (filesize) *filesize = d_stream.total_out;

    /* End the decompression */
    err = inflateEnd(&d_stream);

    if (err != Z_OK) return(*status = 414);
    
    return(*status);
}
/*--------------------------------------------------------------------------*/
int uncompress2file(char *filename,  /* name of input file                  */
             FILE *indiskfile,     /* I - input file pointer                */
             FILE *outdiskfile,    /* I - output file pointer               */
             int *status)        /* IO - error status                       */
/*
  Uncompress the file into another file. 
*/
{
    int err, len;
    unsigned long bytes_out = 0;
    char *infilebuff, *outfilebuff;
    z_stream d_stream;   /* decompression stream */

    if (*status > 0) 
        return(*status); 

    /* Allocate buffers to hold compressed and uncompressed */
    infilebuff = (char*)malloc(GZBUFSIZE);
    if (!infilebuff) return(*status = 113); /* memory error */

    outfilebuff = (char*)malloc(GZBUFSIZE);
    if (!outfilebuff) return(*status = 113); /* memory error */

    d_stream.zalloc = (alloc_func)0;
    d_stream.zfree = (free_func)0;
    d_stream.opaque = (voidpf)0;

    d_stream.next_out = (unsigned char*) outfilebuff;
    d_stream.avail_out = GZBUFSIZE;

    /* Initialize the decompression.  The argument (15+16) tells the
       decompressor that we are to use the gzip algorithm */

    err = inflateInit2(&d_stream, (15+16));
    if (err != Z_OK) return(*status = 414);

    /* loop through the file, reading a buffer and uncompressing it */
    for (;;)
    {
        len = fread(infilebuff, 1, GZBUFSIZE, indiskfile);
	if (ferror(indiskfile)) {
              inflateEnd(&d_stream);
              free(infilebuff);
              free(outfilebuff);
              return(*status = 414);
	}

        if (len == 0) break;  /* no more data */

        d_stream.next_in = (unsigned char*)infilebuff;
        d_stream.avail_in = len;

        for (;;) {
            /* uncompress as much of the input as will fit in the output */
            err = inflate(&d_stream, Z_NO_FLUSH);

            if (err == Z_STREAM_END ) { /* We reached the end of the input */
	        break; 
            } else if (err == Z_OK ) { 

                if (!d_stream.avail_in) break; /* need more input */
		
                /* flush out the full output buffer */
                if ((int)fwrite(outfilebuff, 1, GZBUFSIZE, outdiskfile) != GZBUFSIZE) {
                    inflateEnd(&d_stream);
                    free(infilebuff);
                    free(outfilebuff);
                    return(*status = 414);
                }
                bytes_out += GZBUFSIZE;
                d_stream.next_out = (unsigned char*) outfilebuff;
                d_stream.avail_out = GZBUFSIZE;

            } else {  /* some other error */
                inflateEnd(&d_stream);
                free(infilebuff);
                free(outfilebuff);
                return(*status = 414);
            }
        }
	
	if (feof(indiskfile))  break;
    }

    /* write out any remaining bytes in the buffer */
    if (d_stream.total_out > bytes_out) {
        if ((int)fwrite(outfilebuff, 1, (d_stream.total_out - bytes_out), outdiskfile) 
	    != (d_stream.total_out - bytes_out)) {
            inflateEnd(&d_stream);
            free(infilebuff);
            free(outfilebuff);
            return(*status = 414);
        }
    }

    free(infilebuff); /* free temporary output data buffer */
    free(outfilebuff); /* free temporary output data buffer */

    err = inflateEnd(&d_stream); /* End the decompression */
    if (err != Z_OK) return(*status = 414);
  
    return(*status);
}
/*--------------------------------------------------------------------------*/
int compress2mem_from_mem(                                                
             char *inmemptr,     /* I - memory pointer to uncompressed bytes */
             size_t inmemsize,   /* I - size of input uncompressed file      */
             char **buffptr,   /* IO - memory pointer for compressed file    */
             size_t *buffsize,   /* IO - size of buffer, in bytes           */
             void *(*mem_realloc)(void *p, size_t newsize), /* function     */
             size_t *filesize,   /* O - size of file, in bytes              */
             int *status)        /* IO - error status                       */

/*
  Compress the file into memory.  Fill whatever amount of memory has
  already been allocated, then realloc more memory, using the supplied
  input function, if necessary.
*/
{
    int err;
    z_stream c_stream;  /* compression stream */

    if (*status > 0)
        return(*status);

    c_stream.zalloc = (alloc_func)0;
    c_stream.zfree = (free_func)0;
    c_stream.opaque = (voidpf)0;

    /* Initialize the compression.  The argument (15+16) tells the 
       compressor that we are to use the gzip algorythm.
       Also use Z_BEST_SPEED for maximum speed with very minor loss
       in compression factor. */
    err = deflateInit2(&c_stream, Z_BEST_SPEED, Z_DEFLATED,
                       (15+16), 8, Z_DEFAULT_STRATEGY);

    if (err != Z_OK) return(*status = 413);

    c_stream.next_in = (unsigned char*)inmemptr;
    c_stream.avail_in = inmemsize;

    c_stream.next_out = (unsigned char*) *buffptr;
    c_stream.avail_out = *buffsize;

    for (;;) {
        /* compress as much of the input as will fit in the output */
        err = deflate(&c_stream, Z_FINISH);

        if (err == Z_STREAM_END) {  /* We reached the end of the input */
	   break;
        } else if (err == Z_OK ) { /* need more space in output buffer */

            if (mem_realloc) {   
                *buffptr = mem_realloc(*buffptr,*buffsize + BUFFINCR);
                if (*buffptr == NULL){
                    deflateEnd(&c_stream);
                    return(*status = 413);  /* memory allocation failed */
                }

                c_stream.avail_out = BUFFINCR;
                c_stream.next_out = (unsigned char*) (*buffptr + *buffsize);
                *buffsize = *buffsize + BUFFINCR;

            } else  { /* error: no realloc function available */
                deflateEnd(&c_stream);
                return(*status = 413);
            }
        } else {  /* some other error */
            deflateEnd(&c_stream);
            return(*status = 413);
        }
    }

    /* Set the output file size to be the total output data */
    if (filesize) *filesize = c_stream.total_out;

    /* End the compression */
    err = deflateEnd(&c_stream);

    if (err != Z_OK) return(*status = 413);
     
    return(*status);
}
/*--------------------------------------------------------------------------*/
int compress2file_from_mem(                                                
             char *inmemptr,     /* I - memory pointer to uncompressed bytes */
             size_t inmemsize,   /* I - size of input uncompressed file      */
             FILE *outdiskfile, 
             size_t *filesize,   /* O - size of file, in bytes              */
             int *status)

/*
  Compress the memory file into disk file. 
*/
{
    int err;
    unsigned long bytes_out = 0;
    char  *outfilebuff;
    z_stream c_stream;  /* compression stream */

    if (*status > 0)
        return(*status);

    /* Allocate buffer to hold compressed bytes */
    outfilebuff = (char*)malloc(GZBUFSIZE);
    if (!outfilebuff) return(*status = 113); /* memory error */

    c_stream.zalloc = (alloc_func)0;
    c_stream.zfree = (free_func)0;
    c_stream.opaque = (voidpf)0;

    /* Initialize the compression.  The argument (15+16) tells the 
       compressor that we are to use the gzip algorythm.
       Also use Z_BEST_SPEED for maximum speed with very minor loss
       in compression factor. */
    err = deflateInit2(&c_stream, Z_BEST_SPEED, Z_DEFLATED,
                       (15+16), 8, Z_DEFAULT_STRATEGY);

    if (err != Z_OK) return(*status = 413);

    c_stream.next_in = (unsigned char*)inmemptr;
    c_stream.avail_in = inmemsize;

    c_stream.next_out = (unsigned char*) outfilebuff;
    c_stream.avail_out = GZBUFSIZE;

    for (;;) {
        /* compress as much of the input as will fit in the output */
        err = deflate(&c_stream, Z_FINISH);

        if (err == Z_STREAM_END) {  /* We reached the end of the input */
	   break;
        } else if (err == Z_OK ) { /* need more space in output buffer */

            /* flush out the full output buffer */
            if ((int)fwrite(outfilebuff, 1, GZBUFSIZE, outdiskfile) != GZBUFSIZE) {
                deflateEnd(&c_stream);
                free(outfilebuff);
                return(*status = 413);
            }
            bytes_out += GZBUFSIZE;
            c_stream.next_out = (unsigned char*) outfilebuff;
            c_stream.avail_out = GZBUFSIZE;


        } else {  /* some other error */
            deflateEnd(&c_stream);
            free(outfilebuff);
            return(*status = 413);
        }
    }

    /* write out any remaining bytes in the buffer */
    if (c_stream.total_out > bytes_out) {
        if ((int)fwrite(outfilebuff, 1, (c_stream.total_out - bytes_out), outdiskfile) 
	    != (c_stream.total_out - bytes_out)) {
            deflateEnd(&c_stream);
            free(outfilebuff);
            return(*status = 413);
        }
    }

    free(outfilebuff); /* free temporary output data buffer */

    /* Set the output file size to be the total output data */
    if (filesize) *filesize = c_stream.total_out;

    /* End the compression */
    err = deflateEnd(&c_stream);

    if (err != Z_OK) return(*status = 413);
     
    return(*status);
}
cfitsio-3.47/zlib/zconf.h0000644000225700000360000003205113464573432014641 0ustar  cagordonlhea/* zconf.h -- configuration of the zlib compression library
 * Copyright (C) 1995-2010 Jean-loup Gailly.
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

#ifndef ZCONF_H
#define ZCONF_H

/*
 * If you *really* need a unique prefix for all types and library functions,
 * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it.
 * Even better than compiling with -DZ_PREFIX would be to use configure to set
 * this permanently in zconf.h using "./configure --zprefix".
 */
#ifdef Z_PREFIX     /* may be set to #if 1 by ./configure */

/* all linked symbols */
#  define _dist_code            z__dist_code
#  define _length_code          z__length_code
#  define _tr_align             z__tr_align
#  define _tr_flush_block       z__tr_flush_block
#  define _tr_init              z__tr_init
#  define _tr_stored_block      z__tr_stored_block
#  define _tr_tally             z__tr_tally
#  define adler32               z_adler32
#  define adler32_combine       z_adler32_combine
#  define adler32_combine64     z_adler32_combine64
#  define compress              z_compress
#  define compress2             z_compress2
#  define compressBound         z_compressBound
#  define crc32                 z_crc32
#  define crc32_combine         z_crc32_combine
#  define crc32_combine64       z_crc32_combine64
#  define deflate               z_deflate
#  define deflateBound          z_deflateBound
#  define deflateCopy           z_deflateCopy
#  define deflateEnd            z_deflateEnd
#  define deflateInit2_         z_deflateInit2_
#  define deflateInit_          z_deflateInit_
#  define deflateParams         z_deflateParams
#  define deflatePrime          z_deflatePrime
#  define deflateReset          z_deflateReset
#  define deflateSetDictionary  z_deflateSetDictionary
#  define deflateSetHeader      z_deflateSetHeader
#  define deflateTune           z_deflateTune
#  define deflate_copyright     z_deflate_copyright
#  define get_crc_table         z_get_crc_table
#  define gz_error              z_gz_error
#  define gz_intmax             z_gz_intmax
#  define gz_strwinerror        z_gz_strwinerror
#  define gzbuffer              z_gzbuffer
#  define gzclearerr            z_gzclearerr
#  define gzclose               z_gzclose
#  define gzclose_r             z_gzclose_r
#  define gzclose_w             z_gzclose_w
#  define gzdirect              z_gzdirect
#  define gzdopen               z_gzdopen
#  define gzeof                 z_gzeof
#  define gzerror               z_gzerror
#  define gzflush               z_gzflush
#  define gzgetc                z_gzgetc
#  define gzgets                z_gzgets
#  define gzoffset              z_gzoffset
#  define gzoffset64            z_gzoffset64
#  define gzopen                z_gzopen
#  define gzopen64              z_gzopen64
#  define gzprintf              z_gzprintf
#  define gzputc                z_gzputc
#  define gzputs                z_gzputs
#  define gzread                z_gzread
#  define gzrewind              z_gzrewind
#  define gzseek                z_gzseek
#  define gzseek64              z_gzseek64
#  define gzsetparams           z_gzsetparams
#  define gztell                z_gztell
#  define gztell64              z_gztell64
#  define gzungetc              z_gzungetc
#  define gzwrite               z_gzwrite
#  define inflate               z_inflate
#  define inflateBack           z_inflateBack
#  define inflateBackEnd        z_inflateBackEnd
#  define inflateBackInit_      z_inflateBackInit_
#  define inflateCopy           z_inflateCopy
#  define inflateEnd            z_inflateEnd
#  define inflateGetHeader      z_inflateGetHeader
#  define inflateInit2_         z_inflateInit2_
#  define inflateInit_          z_inflateInit_
#  define inflateMark           z_inflateMark
#  define inflatePrime          z_inflatePrime
#  define inflateReset          z_inflateReset
#  define inflateReset2         z_inflateReset2
#  define inflateSetDictionary  z_inflateSetDictionary
#  define inflateSync           z_inflateSync
#  define inflateSyncPoint      z_inflateSyncPoint
#  define inflateUndermine      z_inflateUndermine
#  define inflate_copyright     z_inflate_copyright
#  define inflate_fast          z_inflate_fast
#  define inflate_table         z_inflate_table
#  define uncompress            z_uncompress
#  define zError                z_zError
#  define zcalloc               z_zcalloc
#  define zcfree                z_zcfree
#  define zlibCompileFlags      z_zlibCompileFlags
#  define zlibVersion           z_zlibVersion

/* all zlib typedefs in zlib.h and zconf.h */
#  define Byte                  z_Byte
#  define Bytef                 z_Bytef
#  define alloc_func            z_alloc_func
#  define charf                 z_charf
#  define free_func             z_free_func
#  define gzFile                z_gzFile
#  define gz_header             z_gz_header
#  define gz_headerp            z_gz_headerp
#  define in_func               z_in_func
#  define intf                  z_intf
#  define out_func              z_out_func
#  define uInt                  z_uInt
#  define uIntf                 z_uIntf
#  define uLong                 z_uLong
#  define uLongf                z_uLongf
#  define voidp                 z_voidp
#  define voidpc                z_voidpc
#  define voidpf                z_voidpf

/* all zlib structs in zlib.h and zconf.h */
#  define gz_header_s           z_gz_header_s
#  define internal_state        z_internal_state

#endif

#if defined(__MSDOS__) && !defined(MSDOS)
#  define MSDOS
#endif
#if (defined(OS_2) || defined(__OS2__)) && !defined(OS2)
#  define OS2
#endif
#if defined(_WINDOWS) && !defined(WINDOWS)
#  define WINDOWS
#endif
#if defined(_WIN32) || defined(_WIN32_WCE) || defined(__WIN32__)
#  ifndef WIN32
#    define WIN32
#  endif
#endif
#if (defined(MSDOS) || defined(OS2) || defined(WINDOWS)) && !defined(WIN32)
#  if !defined(__GNUC__) && !defined(__FLAT__) && !defined(__386__)
#    ifndef SYS16BIT
#      define SYS16BIT
#    endif
#  endif
#endif

/*
 * Compile with -DMAXSEG_64K if the alloc function cannot allocate more
 * than 64k bytes at a time (needed on systems with 16-bit int).
 */
#ifdef SYS16BIT
#  define MAXSEG_64K
#endif
#ifdef MSDOS
#  define UNALIGNED_OK
#endif

#ifdef __STDC_VERSION__
#  ifndef STDC
#    define STDC
#  endif
#  if __STDC_VERSION__ >= 199901L
#    ifndef STDC99
#      define STDC99
#    endif
#  endif
#endif
#if !defined(STDC) && (defined(__STDC__) || defined(__cplusplus))
#  define STDC
#endif
#if !defined(STDC) && (defined(__GNUC__) || defined(__BORLANDC__))
#  define STDC
#endif
#if !defined(STDC) && (defined(MSDOS) || defined(WINDOWS) || defined(WIN32))
#  define STDC
#endif
#if !defined(STDC) && (defined(OS2) || defined(__HOS_AIX__))
#  define STDC
#endif

#if defined(__OS400__) && !defined(STDC)    /* iSeries (formerly AS/400). */
#  define STDC
#endif

#ifndef STDC
#  ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */
#    define const       /* note: need a more gentle solution here */
#  endif
#endif

/* Some Mac compilers merge all .h files incorrectly: */
#if defined(__MWERKS__)||defined(applec)||defined(THINK_C)||defined(__SC__)
#  define NO_DUMMY_DECL
#endif

/* Maximum value for memLevel in deflateInit2 */
#ifndef MAX_MEM_LEVEL
#  ifdef MAXSEG_64K
#    define MAX_MEM_LEVEL 8
#  else
#    define MAX_MEM_LEVEL 9
#  endif
#endif

/* Maximum value for windowBits in deflateInit2 and inflateInit2.
 * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files
 * created by gzip. (Files created by minigzip can still be extracted by
 * gzip.)
 */
#ifndef MAX_WBITS
#  define MAX_WBITS   15 /* 32K LZ77 window */
#endif

/* The memory requirements for deflate are (in bytes):
            (1 << (windowBits+2)) +  (1 << (memLevel+9))
 that is: 128K for windowBits=15  +  128K for memLevel = 8  (default values)
 plus a few kilobytes for small objects. For example, if you want to reduce
 the default memory requirements from 256K to 128K, compile with
     make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"
 Of course this will generally degrade compression (there's no free lunch).

   The memory requirements for inflate are (in bytes) 1 << windowBits
 that is, 32K for windowBits=15 (default value) plus a few kilobytes
 for small objects.
*/

                        /* Type declarations */

#ifndef OF /* function prototypes */
#  ifdef STDC
#    define OF(args)  args
#  else
#    define OF(args)  ()
#  endif
#endif

/* The following definitions for FAR are needed only for MSDOS mixed
 * model programming (small or medium model with some far allocations).
 * This was tested only with MSC; for other MSDOS compilers you may have
 * to define NO_MEMCPY in zutil.h.  If you don't need the mixed model,
 * just define FAR to be empty.
 */
#ifdef SYS16BIT
#  if defined(M_I86SM) || defined(M_I86MM)
     /* MSC small or medium model */
#    define SMALL_MEDIUM
#    ifdef _MSC_VER
#      define FAR _far
#    else
#      define FAR far
#    endif
#  endif
#  if (defined(__SMALL__) || defined(__MEDIUM__))
     /* Turbo C small or medium model */
#    define SMALL_MEDIUM
#    ifdef __BORLANDC__
#      define FAR _far
#    else
#      define FAR far
#    endif
#  endif
#endif

#if defined(WINDOWS) || defined(WIN32)
   /* If building or using zlib as a DLL, define ZLIB_DLL.
    * This is not mandatory, but it offers a little performance increase.
    */
#  ifdef ZLIB_DLL
#    if defined(WIN32) && (!defined(__BORLANDC__) || (__BORLANDC__ >= 0x500))
#      ifdef ZLIB_INTERNAL
#        define ZEXTERN extern __declspec(dllexport)
#      else
#        define ZEXTERN extern __declspec(dllimport)
#      endif
#    endif
#  endif  /* ZLIB_DLL */
   /* If building or using zlib with the WINAPI/WINAPIV calling convention,
    * define ZLIB_WINAPI.
    * Caution: the standard ZLIB1.DLL is NOT compiled using ZLIB_WINAPI.
    */
#  ifdef ZLIB_WINAPI
#    ifdef FAR
#      undef FAR
#    endif
#    include 
     /* No need for _export, use ZLIB.DEF instead. */
     /* For complete Windows compatibility, use WINAPI, not __stdcall. */
#    define ZEXPORT WINAPI
#    ifdef WIN32
#      define ZEXPORTVA WINAPIV
#    else
#      define ZEXPORTVA FAR CDECL
#    endif
#  endif
#endif

#if defined (__BEOS__)
#  ifdef ZLIB_DLL
#    ifdef ZLIB_INTERNAL
#      define ZEXPORT   __declspec(dllexport)
#      define ZEXPORTVA __declspec(dllexport)
#    else
#      define ZEXPORT   __declspec(dllimport)
#      define ZEXPORTVA __declspec(dllimport)
#    endif
#  endif
#endif

#ifndef ZEXTERN
#  define ZEXTERN extern
#endif
#ifndef ZEXPORT
#  define ZEXPORT
#endif
#ifndef ZEXPORTVA
#  define ZEXPORTVA
#endif

#ifndef FAR
#  define FAR
#endif

#if !defined(__MACTYPES__)
typedef unsigned char  Byte;  /* 8 bits */
#endif
typedef unsigned int   uInt;  /* 16 bits or more */
typedef unsigned long  uLong; /* 32 bits or more */

#ifdef SMALL_MEDIUM
   /* Borland C/C++ and some old MSC versions ignore FAR inside typedef */
#  define Bytef Byte FAR
#else
   typedef Byte  FAR Bytef;
#endif
typedef char  FAR charf;
typedef int   FAR intf;
typedef uInt  FAR uIntf;
typedef uLong FAR uLongf;

#ifdef STDC
   typedef void const *voidpc;
   typedef void FAR   *voidpf;
   typedef void       *voidp;
#else
   typedef Byte const *voidpc;
   typedef Byte FAR   *voidpf;
   typedef Byte       *voidp;
#endif

#if !defined(MSDOS) && !defined(WINDOWS) && !defined(WIN32)
#  define Z_HAVE_UNISTD_H
#endif

#ifdef STDC
#  include     /* for off_t */
#endif

/* a little trick to accommodate both "#define _LARGEFILE64_SOURCE" and
 * "#define _LARGEFILE64_SOURCE 1" as requesting 64-bit operations, (even
 * though the former does not conform to the LFS document), but considering
 * both "#undef _LARGEFILE64_SOURCE" and "#define _LARGEFILE64_SOURCE 0" as
 * equivalently requesting no 64-bit operations
 */
#if -_LARGEFILE64_SOURCE - -1 == 1
#  undef _LARGEFILE64_SOURCE
#endif

#if defined(Z_HAVE_UNISTD_H) || defined(_LARGEFILE64_SOURCE)
#  include        /* for SEEK_* and off_t */
#  ifdef VMS
#    include      /* for off_t */
#  endif
#  ifndef z_off_t
#    define z_off_t off_t
#  endif
#endif

#ifndef SEEK_SET
#  define SEEK_SET        0       /* Seek from beginning of file.  */
#  define SEEK_CUR        1       /* Seek from current position.  */
#  define SEEK_END        2       /* Set file pointer to EOF plus "offset" */
#endif

#ifndef z_off_t
#  define z_off_t long
#endif

#if defined(_LARGEFILE64_SOURCE) && _LFS64_LARGEFILE-0
#  define z_off64_t off64_t
#else
#  define z_off64_t z_off_t
#endif

#if defined(__OS400__)
#  define NO_vsnprintf
#endif

#if defined(__MVS__)
#  define NO_vsnprintf
#endif

/* MVS linker does not support external names larger than 8 bytes */
#if defined(__MVS__)
  #pragma map(deflateInit_,"DEIN")
  #pragma map(deflateInit2_,"DEIN2")
  #pragma map(deflateEnd,"DEEND")
  #pragma map(deflateBound,"DEBND")
  #pragma map(inflateInit_,"ININ")
  #pragma map(inflateInit2_,"ININ2")
  #pragma map(inflateEnd,"INEND")
  #pragma map(inflateSync,"INSY")
  #pragma map(inflateSetDictionary,"INSEDI")
  #pragma map(compressBound,"CMBND")
  #pragma map(inflate_table,"INTABL")
  #pragma map(inflate_fast,"INFA")
  #pragma map(inflate_copyright,"INCOPY")
#endif

#endif /* ZCONF_H */
cfitsio-3.47/zlib/zlib.h0000644000225700000360000023331413464573432014467 0ustar  cagordonlhea/* zlib.h -- interface of the 'zlib' general purpose compression library
  version 1.2.5, April 19th, 2010

  Copyright (C) 1995-2010 Jean-loup Gailly and Mark Adler

  This software is provided 'as-is', without any express or implied
  warranty.  In no event will the authors be held liable for any damages
  arising from the use of this software.

  Permission is granted to anyone to use this software for any purpose,
  including commercial applications, and to alter it and redistribute it
  freely, subject to the following restrictions:

  1. The origin of this software must not be misrepresented; you must not
     claim that you wrote the original software. If you use this software
     in a product, an acknowledgment in the product documentation would be
     appreciated but is not required.
  2. Altered source versions must be plainly marked as such, and must not be
     misrepresented as being the original software.
  3. This notice may not be removed or altered from any source distribution.

  Jean-loup Gailly        Mark Adler
  jloup@gzip.org          madler@alumni.caltech.edu


  The data format used by the zlib library is described by RFCs (Request for
  Comments) 1950 to 1952 in the files http://www.ietf.org/rfc/rfc1950.txt
  (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format).
*/

#ifndef ZLIB_H
#define ZLIB_H

#include "zconf.h"

#ifdef __cplusplus
extern "C" {
#endif

#define ZLIB_VERSION "1.2.5"
#define ZLIB_VERNUM 0x1250
#define ZLIB_VER_MAJOR 1
#define ZLIB_VER_MINOR 2
#define ZLIB_VER_REVISION 5
#define ZLIB_VER_SUBREVISION 0

/*
    The 'zlib' compression library provides in-memory compression and
  decompression functions, including integrity checks of the uncompressed data.
  This version of the library supports only one compression method (deflation)
  but other algorithms will be added later and will have the same stream
  interface.

    Compression can be done in a single step if the buffers are large enough,
  or can be done by repeated calls of the compression function.  In the latter
  case, the application must provide more input and/or consume the output
  (providing more output space) before each call.

    The compressed data format used by default by the in-memory functions is
  the zlib format, which is a zlib wrapper documented in RFC 1950, wrapped
  around a deflate stream, which is itself documented in RFC 1951.

    The library also supports reading and writing files in gzip (.gz) format
  with an interface similar to that of stdio using the functions that start
  with "gz".  The gzip format is different from the zlib format.  gzip is a
  gzip wrapper, documented in RFC 1952, wrapped around a deflate stream.

    This library can optionally read and write gzip streams in memory as well.

    The zlib format was designed to be compact and fast for use in memory
  and on communications channels.  The gzip format was designed for single-
  file compression on file systems, has a larger header than zlib to maintain
  directory information, and uses a different, slower check method than zlib.

    The library does not install any signal handler.  The decoder checks
  the consistency of the compressed data, so the library should never crash
  even in case of corrupted input.
*/

typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size));
typedef void   (*free_func)  OF((voidpf opaque, voidpf address));

struct internal_state;

typedef struct z_stream_s {
    Bytef    *next_in;  /* next input byte */
    uInt     avail_in;  /* number of bytes available at next_in */
    uLong    total_in;  /* total nb of input bytes read so far */

    Bytef    *next_out; /* next output byte should be put there */
    uInt     avail_out; /* remaining free space at next_out */
    uLong    total_out; /* total nb of bytes output so far */

    char     *msg;      /* last error message, NULL if no error */
    struct internal_state FAR *state; /* not visible by applications */

    alloc_func zalloc;  /* used to allocate the internal state */
    free_func  zfree;   /* used to free the internal state */
    voidpf     opaque;  /* private data object passed to zalloc and zfree */

    int     data_type;  /* best guess about the data type: binary or text */
    uLong   adler;      /* adler32 value of the uncompressed data */
    uLong   reserved;   /* reserved for future use */
} z_stream;

typedef z_stream FAR *z_streamp;

/*
     gzip header information passed to and from zlib routines.  See RFC 1952
  for more details on the meanings of these fields.
*/
typedef struct gz_header_s {
    int     text;       /* true if compressed data believed to be text */
    uLong   time;       /* modification time */
    int     xflags;     /* extra flags (not used when writing a gzip file) */
    int     os;         /* operating system */
    Bytef   *extra;     /* pointer to extra field or Z_NULL if none */
    uInt    extra_len;  /* extra field length (valid if extra != Z_NULL) */
    uInt    extra_max;  /* space at extra (only when reading header) */
    Bytef   *name;      /* pointer to zero-terminated file name or Z_NULL */
    uInt    name_max;   /* space at name (only when reading header) */
    Bytef   *comment;   /* pointer to zero-terminated comment or Z_NULL */
    uInt    comm_max;   /* space at comment (only when reading header) */
    int     hcrc;       /* true if there was or will be a header crc */
    int     done;       /* true when done reading gzip header (not used
                           when writing a gzip file) */
} gz_header;

typedef gz_header FAR *gz_headerp;

/*
     The application must update next_in and avail_in when avail_in has dropped
   to zero.  It must update next_out and avail_out when avail_out has dropped
   to zero.  The application must initialize zalloc, zfree and opaque before
   calling the init function.  All other fields are set by the compression
   library and must not be updated by the application.

     The opaque value provided by the application will be passed as the first
   parameter for calls of zalloc and zfree.  This can be useful for custom
   memory management.  The compression library attaches no meaning to the
   opaque value.

     zalloc must return Z_NULL if there is not enough memory for the object.
   If zlib is used in a multi-threaded application, zalloc and zfree must be
   thread safe.

     On 16-bit systems, the functions zalloc and zfree must be able to allocate
   exactly 65536 bytes, but will not be required to allocate more than this if
   the symbol MAXSEG_64K is defined (see zconf.h).  WARNING: On MSDOS, pointers
   returned by zalloc for objects of exactly 65536 bytes *must* have their
   offset normalized to zero.  The default allocation function provided by this
   library ensures this (see zutil.c).  To reduce memory requirements and avoid
   any allocation of 64K objects, at the expense of compression ratio, compile
   the library with -DMAX_WBITS=14 (see zconf.h).

     The fields total_in and total_out can be used for statistics or progress
   reports.  After compression, total_in holds the total size of the
   uncompressed data and may be saved for use in the decompressor (particularly
   if the decompressor wants to decompress everything in a single step).
*/

                        /* constants */

#define Z_NO_FLUSH      0
#define Z_PARTIAL_FLUSH 1
#define Z_SYNC_FLUSH    2
#define Z_FULL_FLUSH    3
#define Z_FINISH        4
#define Z_BLOCK         5
#define Z_TREES         6
/* Allowed flush values; see deflate() and inflate() below for details */

#define Z_OK            0
#define Z_STREAM_END    1
#define Z_NEED_DICT     2
#define Z_ERRNO        (-1)
#define Z_STREAM_ERROR (-2)
#define Z_DATA_ERROR   (-3)
#define Z_MEM_ERROR    (-4)
#define Z_BUF_ERROR    (-5)
#define Z_VERSION_ERROR (-6)
/* Return codes for the compression/decompression functions. Negative values
 * are errors, positive values are used for special but normal events.
 */

#define Z_NO_COMPRESSION         0
#define Z_BEST_SPEED             1
#define Z_BEST_COMPRESSION       9
#define Z_DEFAULT_COMPRESSION  (-1)
/* compression levels */

#define Z_FILTERED            1
#define Z_HUFFMAN_ONLY        2
#define Z_RLE                 3
#define Z_FIXED               4
#define Z_DEFAULT_STRATEGY    0
/* compression strategy; see deflateInit2() below for details */

#define Z_BINARY   0
#define Z_TEXT     1
#define Z_ASCII    Z_TEXT   /* for compatibility with 1.2.2 and earlier */
#define Z_UNKNOWN  2
/* Possible values of the data_type field (though see inflate()) */

#define Z_DEFLATED   8
/* The deflate compression method (the only one supported in this version) */

#define Z_NULL  0  /* for initializing zalloc, zfree, opaque */

#define zlib_version zlibVersion()
/* for compatibility with versions < 1.0.2 */


                        /* basic functions */

ZEXTERN const char * ZEXPORT zlibVersion OF((void));
/* The application can compare zlibVersion and ZLIB_VERSION for consistency.
   If the first character differs, the library code actually used is not
   compatible with the zlib.h header file used by the application.  This check
   is automatically made by deflateInit and inflateInit.
 */

/*
ZEXTERN int ZEXPORT deflateInit OF((z_streamp strm, int level));

     Initializes the internal stream state for compression.  The fields
   zalloc, zfree and opaque must be initialized before by the caller.  If
   zalloc and zfree are set to Z_NULL, deflateInit updates them to use default
   allocation functions.

     The compression level must be Z_DEFAULT_COMPRESSION, or between 0 and 9:
   1 gives best speed, 9 gives best compression, 0 gives no compression at all
   (the input data is simply copied a block at a time).  Z_DEFAULT_COMPRESSION
   requests a default compromise between speed and compression (currently
   equivalent to level 6).

     deflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough
   memory, Z_STREAM_ERROR if level is not a valid compression level, or
   Z_VERSION_ERROR if the zlib library version (zlib_version) is incompatible
   with the version assumed by the caller (ZLIB_VERSION).  msg is set to null
   if there is no error message.  deflateInit does not perform any compression:
   this will be done by deflate().
*/


ZEXTERN int ZEXPORT deflate OF((z_streamp strm, int flush));
/*
    deflate compresses as much data as possible, and stops when the input
  buffer becomes empty or the output buffer becomes full.  It may introduce
  some output latency (reading input without producing any output) except when
  forced to flush.

    The detailed semantics are as follows.  deflate performs one or both of the
  following actions:

  - Compress more input starting at next_in and update next_in and avail_in
    accordingly.  If not all input can be processed (because there is not
    enough room in the output buffer), next_in and avail_in are updated and
    processing will resume at this point for the next call of deflate().

  - Provide more output starting at next_out and update next_out and avail_out
    accordingly.  This action is forced if the parameter flush is non zero.
    Forcing flush frequently degrades the compression ratio, so this parameter
    should be set only when necessary (in interactive applications).  Some
    output may be provided even if flush is not set.

    Before the call of deflate(), the application should ensure that at least
  one of the actions is possible, by providing more input and/or consuming more
  output, and updating avail_in or avail_out accordingly; avail_out should
  never be zero before the call.  The application can consume the compressed
  output when it wants, for example when the output buffer is full (avail_out
  == 0), or after each call of deflate().  If deflate returns Z_OK and with
  zero avail_out, it must be called again after making room in the output
  buffer because there might be more output pending.

    Normally the parameter flush is set to Z_NO_FLUSH, which allows deflate to
  decide how much data to accumulate before producing output, in order to
  maximize compression.

    If the parameter flush is set to Z_SYNC_FLUSH, all pending output is
  flushed to the output buffer and the output is aligned on a byte boundary, so
  that the decompressor can get all input data available so far.  (In
  particular avail_in is zero after the call if enough output space has been
  provided before the call.) Flushing may degrade compression for some
  compression algorithms and so it should be used only when necessary.  This
  completes the current deflate block and follows it with an empty stored block
  that is three bits plus filler bits to the next byte, followed by four bytes
  (00 00 ff ff).

    If flush is set to Z_PARTIAL_FLUSH, all pending output is flushed to the
  output buffer, but the output is not aligned to a byte boundary.  All of the
  input data so far will be available to the decompressor, as for Z_SYNC_FLUSH.
  This completes the current deflate block and follows it with an empty fixed
  codes block that is 10 bits long.  This assures that enough bytes are output
  in order for the decompressor to finish the block before the empty fixed code
  block.

    If flush is set to Z_BLOCK, a deflate block is completed and emitted, as
  for Z_SYNC_FLUSH, but the output is not aligned on a byte boundary, and up to
  seven bits of the current block are held to be written as the next byte after
  the next deflate block is completed.  In this case, the decompressor may not
  be provided enough bits at this point in order to complete decompression of
  the data provided so far to the compressor.  It may need to wait for the next
  block to be emitted.  This is for advanced applications that need to control
  the emission of deflate blocks.

    If flush is set to Z_FULL_FLUSH, all output is flushed as with
  Z_SYNC_FLUSH, and the compression state is reset so that decompression can
  restart from this point if previous compressed data has been damaged or if
  random access is desired.  Using Z_FULL_FLUSH too often can seriously degrade
  compression.

    If deflate returns with avail_out == 0, this function must be called again
  with the same value of the flush parameter and more output space (updated
  avail_out), until the flush is complete (deflate returns with non-zero
  avail_out).  In the case of a Z_FULL_FLUSH or Z_SYNC_FLUSH, make sure that
  avail_out is greater than six to avoid repeated flush markers due to
  avail_out == 0 on return.

    If the parameter flush is set to Z_FINISH, pending input is processed,
  pending output is flushed and deflate returns with Z_STREAM_END if there was
  enough output space; if deflate returns with Z_OK, this function must be
  called again with Z_FINISH and more output space (updated avail_out) but no
  more input data, until it returns with Z_STREAM_END or an error.  After
  deflate has returned Z_STREAM_END, the only possible operations on the stream
  are deflateReset or deflateEnd.

    Z_FINISH can be used immediately after deflateInit if all the compression
  is to be done in a single step.  In this case, avail_out must be at least the
  value returned by deflateBound (see below).  If deflate does not return
  Z_STREAM_END, then it must be called again as described above.

    deflate() sets strm->adler to the adler32 checksum of all input read
  so far (that is, total_in bytes).

    deflate() may update strm->data_type if it can make a good guess about
  the input data type (Z_BINARY or Z_TEXT).  In doubt, the data is considered
  binary.  This field is only for information purposes and does not affect the
  compression algorithm in any manner.

    deflate() returns Z_OK if some progress has been made (more input
  processed or more output produced), Z_STREAM_END if all input has been
  consumed and all output has been produced (only when flush is set to
  Z_FINISH), Z_STREAM_ERROR if the stream state was inconsistent (for example
  if next_in or next_out was Z_NULL), Z_BUF_ERROR if no progress is possible
  (for example avail_in or avail_out was zero).  Note that Z_BUF_ERROR is not
  fatal, and deflate() can be called again with more input and more output
  space to continue compressing.
*/


ZEXTERN int ZEXPORT deflateEnd OF((z_streamp strm));
/*
     All dynamically allocated data structures for this stream are freed.
   This function discards any unprocessed input and does not flush any pending
   output.

     deflateEnd returns Z_OK if success, Z_STREAM_ERROR if the
   stream state was inconsistent, Z_DATA_ERROR if the stream was freed
   prematurely (some input or output was discarded).  In the error case, msg
   may be set but then points to a static string (which must not be
   deallocated).
*/


/*
ZEXTERN int ZEXPORT inflateInit OF((z_streamp strm));

     Initializes the internal stream state for decompression.  The fields
   next_in, avail_in, zalloc, zfree and opaque must be initialized before by
   the caller.  If next_in is not Z_NULL and avail_in is large enough (the
   exact value depends on the compression method), inflateInit determines the
   compression method from the zlib header and allocates all data structures
   accordingly; otherwise the allocation will be deferred to the first call of
   inflate.  If zalloc and zfree are set to Z_NULL, inflateInit updates them to
   use default allocation functions.

     inflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough
   memory, Z_VERSION_ERROR if the zlib library version is incompatible with the
   version assumed by the caller, or Z_STREAM_ERROR if the parameters are
   invalid, such as a null pointer to the structure.  msg is set to null if
   there is no error message.  inflateInit does not perform any decompression
   apart from possibly reading the zlib header if present: actual decompression
   will be done by inflate().  (So next_in and avail_in may be modified, but
   next_out and avail_out are unused and unchanged.) The current implementation
   of inflateInit() does not process any header information -- that is deferred
   until inflate() is called.
*/


ZEXTERN int ZEXPORT inflate OF((z_streamp strm, int flush));
/*
    inflate decompresses as much data as possible, and stops when the input
  buffer becomes empty or the output buffer becomes full.  It may introduce
  some output latency (reading input without producing any output) except when
  forced to flush.

  The detailed semantics are as follows.  inflate performs one or both of the
  following actions:

  - Decompress more input starting at next_in and update next_in and avail_in
    accordingly.  If not all input can be processed (because there is not
    enough room in the output buffer), next_in is updated and processing will
    resume at this point for the next call of inflate().

  - Provide more output starting at next_out and update next_out and avail_out
    accordingly.  inflate() provides as much output as possible, until there is
    no more input data or no more space in the output buffer (see below about
    the flush parameter).

    Before the call of inflate(), the application should ensure that at least
  one of the actions is possible, by providing more input and/or consuming more
  output, and updating the next_* and avail_* values accordingly.  The
  application can consume the uncompressed output when it wants, for example
  when the output buffer is full (avail_out == 0), or after each call of
  inflate().  If inflate returns Z_OK and with zero avail_out, it must be
  called again after making room in the output buffer because there might be
  more output pending.

    The flush parameter of inflate() can be Z_NO_FLUSH, Z_SYNC_FLUSH, Z_FINISH,
  Z_BLOCK, or Z_TREES.  Z_SYNC_FLUSH requests that inflate() flush as much
  output as possible to the output buffer.  Z_BLOCK requests that inflate()
  stop if and when it gets to the next deflate block boundary.  When decoding
  the zlib or gzip format, this will cause inflate() to return immediately
  after the header and before the first block.  When doing a raw inflate,
  inflate() will go ahead and process the first block, and will return when it
  gets to the end of that block, or when it runs out of data.

    The Z_BLOCK option assists in appending to or combining deflate streams.
  Also to assist in this, on return inflate() will set strm->data_type to the
  number of unused bits in the last byte taken from strm->next_in, plus 64 if
  inflate() is currently decoding the last block in the deflate stream, plus
  128 if inflate() returned immediately after decoding an end-of-block code or
  decoding the complete header up to just before the first byte of the deflate
  stream.  The end-of-block will not be indicated until all of the uncompressed
  data from that block has been written to strm->next_out.  The number of
  unused bits may in general be greater than seven, except when bit 7 of
  data_type is set, in which case the number of unused bits will be less than
  eight.  data_type is set as noted here every time inflate() returns for all
  flush options, and so can be used to determine the amount of currently
  consumed input in bits.

    The Z_TREES option behaves as Z_BLOCK does, but it also returns when the
  end of each deflate block header is reached, before any actual data in that
  block is decoded.  This allows the caller to determine the length of the
  deflate block header for later use in random access within a deflate block.
  256 is added to the value of strm->data_type when inflate() returns
  immediately after reaching the end of the deflate block header.

    inflate() should normally be called until it returns Z_STREAM_END or an
  error.  However if all decompression is to be performed in a single step (a
  single call of inflate), the parameter flush should be set to Z_FINISH.  In
  this case all pending input is processed and all pending output is flushed;
  avail_out must be large enough to hold all the uncompressed data.  (The size
  of the uncompressed data may have been saved by the compressor for this
  purpose.) The next operation on this stream must be inflateEnd to deallocate
  the decompression state.  The use of Z_FINISH is never required, but can be
  used to inform inflate that a faster approach may be used for the single
  inflate() call.

     In this implementation, inflate() always flushes as much output as
  possible to the output buffer, and always uses the faster approach on the
  first call.  So the only effect of the flush parameter in this implementation
  is on the return value of inflate(), as noted below, or when it returns early
  because Z_BLOCK or Z_TREES is used.

     If a preset dictionary is needed after this call (see inflateSetDictionary
  below), inflate sets strm->adler to the adler32 checksum of the dictionary
  chosen by the compressor and returns Z_NEED_DICT; otherwise it sets
  strm->adler to the adler32 checksum of all output produced so far (that is,
  total_out bytes) and returns Z_OK, Z_STREAM_END or an error code as described
  below.  At the end of the stream, inflate() checks that its computed adler32
  checksum is equal to that saved by the compressor and returns Z_STREAM_END
  only if the checksum is correct.

    inflate() can decompress and check either zlib-wrapped or gzip-wrapped
  deflate data.  The header type is detected automatically, if requested when
  initializing with inflateInit2().  Any information contained in the gzip
  header is not retained, so applications that need that information should
  instead use raw inflate, see inflateInit2() below, or inflateBack() and
  perform their own processing of the gzip header and trailer.

    inflate() returns Z_OK if some progress has been made (more input processed
  or more output produced), Z_STREAM_END if the end of the compressed data has
  been reached and all uncompressed output has been produced, Z_NEED_DICT if a
  preset dictionary is needed at this point, Z_DATA_ERROR if the input data was
  corrupted (input stream not conforming to the zlib format or incorrect check
  value), Z_STREAM_ERROR if the stream structure was inconsistent (for example
  next_in or next_out was Z_NULL), Z_MEM_ERROR if there was not enough memory,
  Z_BUF_ERROR if no progress is possible or if there was not enough room in the
  output buffer when Z_FINISH is used.  Note that Z_BUF_ERROR is not fatal, and
  inflate() can be called again with more input and more output space to
  continue decompressing.  If Z_DATA_ERROR is returned, the application may
  then call inflateSync() to look for a good compression block if a partial
  recovery of the data is desired.
*/


ZEXTERN int ZEXPORT inflateEnd OF((z_streamp strm));
/*
     All dynamically allocated data structures for this stream are freed.
   This function discards any unprocessed input and does not flush any pending
   output.

     inflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state
   was inconsistent.  In the error case, msg may be set but then points to a
   static string (which must not be deallocated).
*/


                        /* Advanced functions */

/*
    The following functions are needed only in some special applications.
*/

/*
ZEXTERN int ZEXPORT deflateInit2 OF((z_streamp strm,
                                     int  level,
                                     int  method,
                                     int  windowBits,
                                     int  memLevel,
                                     int  strategy));

     This is another version of deflateInit with more compression options.  The
   fields next_in, zalloc, zfree and opaque must be initialized before by the
   caller.

     The method parameter is the compression method.  It must be Z_DEFLATED in
   this version of the library.

     The windowBits parameter is the base two logarithm of the window size
   (the size of the history buffer).  It should be in the range 8..15 for this
   version of the library.  Larger values of this parameter result in better
   compression at the expense of memory usage.  The default value is 15 if
   deflateInit is used instead.

     windowBits can also be -8..-15 for raw deflate.  In this case, -windowBits
   determines the window size.  deflate() will then generate raw deflate data
   with no zlib header or trailer, and will not compute an adler32 check value.

     windowBits can also be greater than 15 for optional gzip encoding.  Add
   16 to windowBits to write a simple gzip header and trailer around the
   compressed data instead of a zlib wrapper.  The gzip header will have no
   file name, no extra data, no comment, no modification time (set to zero), no
   header crc, and the operating system will be set to 255 (unknown).  If a
   gzip stream is being written, strm->adler is a crc32 instead of an adler32.

     The memLevel parameter specifies how much memory should be allocated
   for the internal compression state.  memLevel=1 uses minimum memory but is
   slow and reduces compression ratio; memLevel=9 uses maximum memory for
   optimal speed.  The default value is 8.  See zconf.h for total memory usage
   as a function of windowBits and memLevel.

     The strategy parameter is used to tune the compression algorithm.  Use the
   value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data produced by a
   filter (or predictor), Z_HUFFMAN_ONLY to force Huffman encoding only (no
   string match), or Z_RLE to limit match distances to one (run-length
   encoding).  Filtered data consists mostly of small values with a somewhat
   random distribution.  In this case, the compression algorithm is tuned to
   compress them better.  The effect of Z_FILTERED is to force more Huffman
   coding and less string matching; it is somewhat intermediate between
   Z_DEFAULT_STRATEGY and Z_HUFFMAN_ONLY.  Z_RLE is designed to be almost as
   fast as Z_HUFFMAN_ONLY, but give better compression for PNG image data.  The
   strategy parameter only affects the compression ratio but not the
   correctness of the compressed output even if it is not set appropriately.
   Z_FIXED prevents the use of dynamic Huffman codes, allowing for a simpler
   decoder for special applications.

     deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
   memory, Z_STREAM_ERROR if any parameter is invalid (such as an invalid
   method), or Z_VERSION_ERROR if the zlib library version (zlib_version) is
   incompatible with the version assumed by the caller (ZLIB_VERSION).  msg is
   set to null if there is no error message.  deflateInit2 does not perform any
   compression: this will be done by deflate().
*/

ZEXTERN int ZEXPORT deflateSetDictionary OF((z_streamp strm,
                                             const Bytef *dictionary,
                                             uInt  dictLength));
/*
     Initializes the compression dictionary from the given byte sequence
   without producing any compressed output.  This function must be called
   immediately after deflateInit, deflateInit2 or deflateReset, before any call
   of deflate.  The compressor and decompressor must use exactly the same
   dictionary (see inflateSetDictionary).

     The dictionary should consist of strings (byte sequences) that are likely
   to be encountered later in the data to be compressed, with the most commonly
   used strings preferably put towards the end of the dictionary.  Using a
   dictionary is most useful when the data to be compressed is short and can be
   predicted with good accuracy; the data can then be compressed better than
   with the default empty dictionary.

     Depending on the size of the compression data structures selected by
   deflateInit or deflateInit2, a part of the dictionary may in effect be
   discarded, for example if the dictionary is larger than the window size
   provided in deflateInit or deflateInit2.  Thus the strings most likely to be
   useful should be put at the end of the dictionary, not at the front.  In
   addition, the current implementation of deflate will use at most the window
   size minus 262 bytes of the provided dictionary.

     Upon return of this function, strm->adler is set to the adler32 value
   of the dictionary; the decompressor may later use this value to determine
   which dictionary has been used by the compressor.  (The adler32 value
   applies to the whole dictionary even if only a subset of the dictionary is
   actually used by the compressor.) If a raw deflate was requested, then the
   adler32 value is not computed and strm->adler is not set.

     deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a
   parameter is invalid (e.g.  dictionary being Z_NULL) or the stream state is
   inconsistent (for example if deflate has already been called for this stream
   or if the compression method is bsort).  deflateSetDictionary does not
   perform any compression: this will be done by deflate().
*/

ZEXTERN int ZEXPORT deflateCopy OF((z_streamp dest,
                                    z_streamp source));
/*
     Sets the destination stream as a complete copy of the source stream.

     This function can be useful when several compression strategies will be
   tried, for example when there are several ways of pre-processing the input
   data with a filter.  The streams that will be discarded should then be freed
   by calling deflateEnd.  Note that deflateCopy duplicates the internal
   compression state which can be quite large, so this strategy is slow and can
   consume lots of memory.

     deflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not
   enough memory, Z_STREAM_ERROR if the source stream state was inconsistent
   (such as zalloc being Z_NULL).  msg is left unchanged in both source and
   destination.
*/

ZEXTERN int ZEXPORT deflateReset OF((z_streamp strm));
/*
     This function is equivalent to deflateEnd followed by deflateInit,
   but does not free and reallocate all the internal compression state.  The
   stream will keep the same compression level and any other attributes that
   may have been set by deflateInit2.

     deflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source
   stream state was inconsistent (such as zalloc or state being Z_NULL).
*/

ZEXTERN int ZEXPORT deflateParams OF((z_streamp strm,
                                      int level,
                                      int strategy));
/*
     Dynamically update the compression level and compression strategy.  The
   interpretation of level and strategy is as in deflateInit2.  This can be
   used to switch between compression and straight copy of the input data, or
   to switch to a different kind of input data requiring a different strategy.
   If the compression level is changed, the input available so far is
   compressed with the old level (and may be flushed); the new level will take
   effect only at the next call of deflate().

     Before the call of deflateParams, the stream state must be set as for
   a call of deflate(), since the currently available input may have to be
   compressed and flushed.  In particular, strm->avail_out must be non-zero.

     deflateParams returns Z_OK if success, Z_STREAM_ERROR if the source
   stream state was inconsistent or if a parameter was invalid, Z_BUF_ERROR if
   strm->avail_out was zero.
*/

ZEXTERN int ZEXPORT deflateTune OF((z_streamp strm,
                                    int good_length,
                                    int max_lazy,
                                    int nice_length,
                                    int max_chain));
/*
     Fine tune deflate's internal compression parameters.  This should only be
   used by someone who understands the algorithm used by zlib's deflate for
   searching for the best matching string, and even then only by the most
   fanatic optimizer trying to squeeze out the last compressed bit for their
   specific input data.  Read the deflate.c source code for the meaning of the
   max_lazy, good_length, nice_length, and max_chain parameters.

     deflateTune() can be called after deflateInit() or deflateInit2(), and
   returns Z_OK on success, or Z_STREAM_ERROR for an invalid deflate stream.
 */

ZEXTERN uLong ZEXPORT deflateBound OF((z_streamp strm,
                                       uLong sourceLen));
/*
     deflateBound() returns an upper bound on the compressed size after
   deflation of sourceLen bytes.  It must be called after deflateInit() or
   deflateInit2(), and after deflateSetHeader(), if used.  This would be used
   to allocate an output buffer for deflation in a single pass, and so would be
   called before deflate().
*/

ZEXTERN int ZEXPORT deflatePrime OF((z_streamp strm,
                                     int bits,
                                     int value));
/*
     deflatePrime() inserts bits in the deflate output stream.  The intent
   is that this function is used to start off the deflate output with the bits
   leftover from a previous deflate stream when appending to it.  As such, this
   function can only be used for raw deflate, and must be used before the first
   deflate() call after a deflateInit2() or deflateReset().  bits must be less
   than or equal to 16, and that many of the least significant bits of value
   will be inserted in the output.

     deflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source
   stream state was inconsistent.
*/

ZEXTERN int ZEXPORT deflateSetHeader OF((z_streamp strm,
                                         gz_headerp head));
/*
     deflateSetHeader() provides gzip header information for when a gzip
   stream is requested by deflateInit2().  deflateSetHeader() may be called
   after deflateInit2() or deflateReset() and before the first call of
   deflate().  The text, time, os, extra field, name, and comment information
   in the provided gz_header structure are written to the gzip header (xflag is
   ignored -- the extra flags are set according to the compression level).  The
   caller must assure that, if not Z_NULL, name and comment are terminated with
   a zero byte, and that if extra is not Z_NULL, that extra_len bytes are
   available there.  If hcrc is true, a gzip header crc is included.  Note that
   the current versions of the command-line version of gzip (up through version
   1.3.x) do not support header crc's, and will report that it is a "multi-part
   gzip file" and give up.

     If deflateSetHeader is not used, the default gzip header has text false,
   the time set to zero, and os set to 255, with no extra, name, or comment
   fields.  The gzip header is returned to the default state by deflateReset().

     deflateSetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source
   stream state was inconsistent.
*/

/*
ZEXTERN int ZEXPORT inflateInit2 OF((z_streamp strm,
                                     int  windowBits));

     This is another version of inflateInit with an extra parameter.  The
   fields next_in, avail_in, zalloc, zfree and opaque must be initialized
   before by the caller.

     The windowBits parameter is the base two logarithm of the maximum window
   size (the size of the history buffer).  It should be in the range 8..15 for
   this version of the library.  The default value is 15 if inflateInit is used
   instead.  windowBits must be greater than or equal to the windowBits value
   provided to deflateInit2() while compressing, or it must be equal to 15 if
   deflateInit2() was not used.  If a compressed stream with a larger window
   size is given as input, inflate() will return with the error code
   Z_DATA_ERROR instead of trying to allocate a larger window.

     windowBits can also be zero to request that inflate use the window size in
   the zlib header of the compressed stream.

     windowBits can also be -8..-15 for raw inflate.  In this case, -windowBits
   determines the window size.  inflate() will then process raw deflate data,
   not looking for a zlib or gzip header, not generating a check value, and not
   looking for any check values for comparison at the end of the stream.  This
   is for use with other formats that use the deflate compressed data format
   such as zip.  Those formats provide their own check values.  If a custom
   format is developed using the raw deflate format for compressed data, it is
   recommended that a check value such as an adler32 or a crc32 be applied to
   the uncompressed data as is done in the zlib, gzip, and zip formats.  For
   most applications, the zlib format should be used as is.  Note that comments
   above on the use in deflateInit2() applies to the magnitude of windowBits.

     windowBits can also be greater than 15 for optional gzip decoding.  Add
   32 to windowBits to enable zlib and gzip decoding with automatic header
   detection, or add 16 to decode only the gzip format (the zlib format will
   return a Z_DATA_ERROR).  If a gzip stream is being decoded, strm->adler is a
   crc32 instead of an adler32.

     inflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
   memory, Z_VERSION_ERROR if the zlib library version is incompatible with the
   version assumed by the caller, or Z_STREAM_ERROR if the parameters are
   invalid, such as a null pointer to the structure.  msg is set to null if
   there is no error message.  inflateInit2 does not perform any decompression
   apart from possibly reading the zlib header if present: actual decompression
   will be done by inflate().  (So next_in and avail_in may be modified, but
   next_out and avail_out are unused and unchanged.) The current implementation
   of inflateInit2() does not process any header information -- that is
   deferred until inflate() is called.
*/

ZEXTERN int ZEXPORT inflateSetDictionary OF((z_streamp strm,
                                             const Bytef *dictionary,
                                             uInt  dictLength));
/*
     Initializes the decompression dictionary from the given uncompressed byte
   sequence.  This function must be called immediately after a call of inflate,
   if that call returned Z_NEED_DICT.  The dictionary chosen by the compressor
   can be determined from the adler32 value returned by that call of inflate.
   The compressor and decompressor must use exactly the same dictionary (see
   deflateSetDictionary).  For raw inflate, this function can be called
   immediately after inflateInit2() or inflateReset() and before any call of
   inflate() to set the dictionary.  The application must insure that the
   dictionary that was used for compression is provided.

     inflateSetDictionary returns Z_OK if success, Z_STREAM_ERROR if a
   parameter is invalid (e.g.  dictionary being Z_NULL) or the stream state is
   inconsistent, Z_DATA_ERROR if the given dictionary doesn't match the
   expected one (incorrect adler32 value).  inflateSetDictionary does not
   perform any decompression: this will be done by subsequent calls of
   inflate().
*/

ZEXTERN int ZEXPORT inflateSync OF((z_streamp strm));
/*
     Skips invalid compressed data until a full flush point (see above the
   description of deflate with Z_FULL_FLUSH) can be found, or until all
   available input is skipped.  No output is provided.

     inflateSync returns Z_OK if a full flush point has been found, Z_BUF_ERROR
   if no more input was provided, Z_DATA_ERROR if no flush point has been
   found, or Z_STREAM_ERROR if the stream structure was inconsistent.  In the
   success case, the application may save the current current value of total_in
   which indicates where valid compressed data was found.  In the error case,
   the application may repeatedly call inflateSync, providing more input each
   time, until success or end of the input data.
*/

ZEXTERN int ZEXPORT inflateCopy OF((z_streamp dest,
                                    z_streamp source));
/*
     Sets the destination stream as a complete copy of the source stream.

     This function can be useful when randomly accessing a large stream.  The
   first pass through the stream can periodically record the inflate state,
   allowing restarting inflate at those points when randomly accessing the
   stream.

     inflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not
   enough memory, Z_STREAM_ERROR if the source stream state was inconsistent
   (such as zalloc being Z_NULL).  msg is left unchanged in both source and
   destination.
*/

ZEXTERN int ZEXPORT inflateReset OF((z_streamp strm));
/*
     This function is equivalent to inflateEnd followed by inflateInit,
   but does not free and reallocate all the internal decompression state.  The
   stream will keep attributes that may have been set by inflateInit2.

     inflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source
   stream state was inconsistent (such as zalloc or state being Z_NULL).
*/

ZEXTERN int ZEXPORT inflateReset2 OF((z_streamp strm,
                                      int windowBits));
/*
     This function is the same as inflateReset, but it also permits changing
   the wrap and window size requests.  The windowBits parameter is interpreted
   the same as it is for inflateInit2.

     inflateReset2 returns Z_OK if success, or Z_STREAM_ERROR if the source
   stream state was inconsistent (such as zalloc or state being Z_NULL), or if
   the windowBits parameter is invalid.
*/

ZEXTERN int ZEXPORT inflatePrime OF((z_streamp strm,
                                     int bits,
                                     int value));
/*
     This function inserts bits in the inflate input stream.  The intent is
   that this function is used to start inflating at a bit position in the
   middle of a byte.  The provided bits will be used before any bytes are used
   from next_in.  This function should only be used with raw inflate, and
   should be used before the first inflate() call after inflateInit2() or
   inflateReset().  bits must be less than or equal to 16, and that many of the
   least significant bits of value will be inserted in the input.

     If bits is negative, then the input stream bit buffer is emptied.  Then
   inflatePrime() can be called again to put bits in the buffer.  This is used
   to clear out bits leftover after feeding inflate a block description prior
   to feeding inflate codes.

     inflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source
   stream state was inconsistent.
*/

ZEXTERN long ZEXPORT inflateMark OF((z_streamp strm));
/*
     This function returns two values, one in the lower 16 bits of the return
   value, and the other in the remaining upper bits, obtained by shifting the
   return value down 16 bits.  If the upper value is -1 and the lower value is
   zero, then inflate() is currently decoding information outside of a block.
   If the upper value is -1 and the lower value is non-zero, then inflate is in
   the middle of a stored block, with the lower value equaling the number of
   bytes from the input remaining to copy.  If the upper value is not -1, then
   it is the number of bits back from the current bit position in the input of
   the code (literal or length/distance pair) currently being processed.  In
   that case the lower value is the number of bytes already emitted for that
   code.

     A code is being processed if inflate is waiting for more input to complete
   decoding of the code, or if it has completed decoding but is waiting for
   more output space to write the literal or match data.

     inflateMark() is used to mark locations in the input data for random
   access, which may be at bit positions, and to note those cases where the
   output of a code may span boundaries of random access blocks.  The current
   location in the input stream can be determined from avail_in and data_type
   as noted in the description for the Z_BLOCK flush parameter for inflate.

     inflateMark returns the value noted above or -1 << 16 if the provided
   source stream state was inconsistent.
*/

ZEXTERN int ZEXPORT inflateGetHeader OF((z_streamp strm,
                                         gz_headerp head));
/*
     inflateGetHeader() requests that gzip header information be stored in the
   provided gz_header structure.  inflateGetHeader() may be called after
   inflateInit2() or inflateReset(), and before the first call of inflate().
   As inflate() processes the gzip stream, head->done is zero until the header
   is completed, at which time head->done is set to one.  If a zlib stream is
   being decoded, then head->done is set to -1 to indicate that there will be
   no gzip header information forthcoming.  Note that Z_BLOCK or Z_TREES can be
   used to force inflate() to return immediately after header processing is
   complete and before any actual data is decompressed.

     The text, time, xflags, and os fields are filled in with the gzip header
   contents.  hcrc is set to true if there is a header CRC.  (The header CRC
   was valid if done is set to one.) If extra is not Z_NULL, then extra_max
   contains the maximum number of bytes to write to extra.  Once done is true,
   extra_len contains the actual extra field length, and extra contains the
   extra field, or that field truncated if extra_max is less than extra_len.
   If name is not Z_NULL, then up to name_max characters are written there,
   terminated with a zero unless the length is greater than name_max.  If
   comment is not Z_NULL, then up to comm_max characters are written there,
   terminated with a zero unless the length is greater than comm_max.  When any
   of extra, name, or comment are not Z_NULL and the respective field is not
   present in the header, then that field is set to Z_NULL to signal its
   absence.  This allows the use of deflateSetHeader() with the returned
   structure to duplicate the header.  However if those fields are set to
   allocated memory, then the application will need to save those pointers
   elsewhere so that they can be eventually freed.

     If inflateGetHeader is not used, then the header information is simply
   discarded.  The header is always checked for validity, including the header
   CRC if present.  inflateReset() will reset the process to discard the header
   information.  The application would need to call inflateGetHeader() again to
   retrieve the header from the next gzip stream.

     inflateGetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source
   stream state was inconsistent.
*/

/*
ZEXTERN int ZEXPORT inflateBackInit OF((z_streamp strm, int windowBits,
                                        unsigned char FAR *window));

     Initialize the internal stream state for decompression using inflateBack()
   calls.  The fields zalloc, zfree and opaque in strm must be initialized
   before the call.  If zalloc and zfree are Z_NULL, then the default library-
   derived memory allocation routines are used.  windowBits is the base two
   logarithm of the window size, in the range 8..15.  window is a caller
   supplied buffer of that size.  Except for special applications where it is
   assured that deflate was used with small window sizes, windowBits must be 15
   and a 32K byte window must be supplied to be able to decompress general
   deflate streams.

     See inflateBack() for the usage of these routines.

     inflateBackInit will return Z_OK on success, Z_STREAM_ERROR if any of
   the paramaters are invalid, Z_MEM_ERROR if the internal state could not be
   allocated, or Z_VERSION_ERROR if the version of the library does not match
   the version of the header file.
*/

typedef unsigned (*in_func) OF((void FAR *, unsigned char FAR * FAR *));
typedef int (*out_func) OF((void FAR *, unsigned char FAR *, unsigned));

ZEXTERN int ZEXPORT inflateBack OF((z_streamp strm,
                                    in_func in, void FAR *in_desc,
                                    out_func out, void FAR *out_desc));
/*
     inflateBack() does a raw inflate with a single call using a call-back
   interface for input and output.  This is more efficient than inflate() for
   file i/o applications in that it avoids copying between the output and the
   sliding window by simply making the window itself the output buffer.  This
   function trusts the application to not change the output buffer passed by
   the output function, at least until inflateBack() returns.

     inflateBackInit() must be called first to allocate the internal state
   and to initialize the state with the user-provided window buffer.
   inflateBack() may then be used multiple times to inflate a complete, raw
   deflate stream with each call.  inflateBackEnd() is then called to free the
   allocated state.

     A raw deflate stream is one with no zlib or gzip header or trailer.
   This routine would normally be used in a utility that reads zip or gzip
   files and writes out uncompressed files.  The utility would decode the
   header and process the trailer on its own, hence this routine expects only
   the raw deflate stream to decompress.  This is different from the normal
   behavior of inflate(), which expects either a zlib or gzip header and
   trailer around the deflate stream.

     inflateBack() uses two subroutines supplied by the caller that are then
   called by inflateBack() for input and output.  inflateBack() calls those
   routines until it reads a complete deflate stream and writes out all of the
   uncompressed data, or until it encounters an error.  The function's
   parameters and return types are defined above in the in_func and out_func
   typedefs.  inflateBack() will call in(in_desc, &buf) which should return the
   number of bytes of provided input, and a pointer to that input in buf.  If
   there is no input available, in() must return zero--buf is ignored in that
   case--and inflateBack() will return a buffer error.  inflateBack() will call
   out(out_desc, buf, len) to write the uncompressed data buf[0..len-1].  out()
   should return zero on success, or non-zero on failure.  If out() returns
   non-zero, inflateBack() will return with an error.  Neither in() nor out()
   are permitted to change the contents of the window provided to
   inflateBackInit(), which is also the buffer that out() uses to write from.
   The length written by out() will be at most the window size.  Any non-zero
   amount of input may be provided by in().

     For convenience, inflateBack() can be provided input on the first call by
   setting strm->next_in and strm->avail_in.  If that input is exhausted, then
   in() will be called.  Therefore strm->next_in must be initialized before
   calling inflateBack().  If strm->next_in is Z_NULL, then in() will be called
   immediately for input.  If strm->next_in is not Z_NULL, then strm->avail_in
   must also be initialized, and then if strm->avail_in is not zero, input will
   initially be taken from strm->next_in[0 ..  strm->avail_in - 1].

     The in_desc and out_desc parameters of inflateBack() is passed as the
   first parameter of in() and out() respectively when they are called.  These
   descriptors can be optionally used to pass any information that the caller-
   supplied in() and out() functions need to do their job.

     On return, inflateBack() will set strm->next_in and strm->avail_in to
   pass back any unused input that was provided by the last in() call.  The
   return values of inflateBack() can be Z_STREAM_END on success, Z_BUF_ERROR
   if in() or out() returned an error, Z_DATA_ERROR if there was a format error
   in the deflate stream (in which case strm->msg is set to indicate the nature
   of the error), or Z_STREAM_ERROR if the stream was not properly initialized.
   In the case of Z_BUF_ERROR, an input or output error can be distinguished
   using strm->next_in which will be Z_NULL only if in() returned an error.  If
   strm->next_in is not Z_NULL, then the Z_BUF_ERROR was due to out() returning
   non-zero.  (in() will always be called before out(), so strm->next_in is
   assured to be defined if out() returns non-zero.) Note that inflateBack()
   cannot return Z_OK.
*/

ZEXTERN int ZEXPORT inflateBackEnd OF((z_streamp strm));
/*
     All memory allocated by inflateBackInit() is freed.

     inflateBackEnd() returns Z_OK on success, or Z_STREAM_ERROR if the stream
   state was inconsistent.
*/

ZEXTERN uLong ZEXPORT zlibCompileFlags OF((void));
/* Return flags indicating compile-time options.

    Type sizes, two bits each, 00 = 16 bits, 01 = 32, 10 = 64, 11 = other:
     1.0: size of uInt
     3.2: size of uLong
     5.4: size of voidpf (pointer)
     7.6: size of z_off_t

    Compiler, assembler, and debug options:
     8: DEBUG
     9: ASMV or ASMINF -- use ASM code
     10: ZLIB_WINAPI -- exported functions use the WINAPI calling convention
     11: 0 (reserved)

    One-time table building (smaller code, but not thread-safe if true):
     12: BUILDFIXED -- build static block decoding tables when needed
     13: DYNAMIC_CRC_TABLE -- build CRC calculation tables when needed
     14,15: 0 (reserved)

    Library content (indicates missing functionality):
     16: NO_GZCOMPRESS -- gz* functions cannot compress (to avoid linking
                          deflate code when not needed)
     17: NO_GZIP -- deflate can't write gzip streams, and inflate can't detect
                    and decode gzip streams (to avoid linking crc code)
     18-19: 0 (reserved)

    Operation variations (changes in library functionality):
     20: PKZIP_BUG_WORKAROUND -- slightly more permissive inflate
     21: FASTEST -- deflate algorithm with only one, lowest compression level
     22,23: 0 (reserved)

    The sprintf variant used by gzprintf (zero is best):
     24: 0 = vs*, 1 = s* -- 1 means limited to 20 arguments after the format
     25: 0 = *nprintf, 1 = *printf -- 1 means gzprintf() not secure!
     26: 0 = returns value, 1 = void -- 1 means inferred string length returned

    Remainder:
     27-31: 0 (reserved)
 */


                        /* utility functions */

/*
     The following utility functions are implemented on top of the basic
   stream-oriented functions.  To simplify the interface, some default options
   are assumed (compression level and memory usage, standard memory allocation
   functions).  The source code of these utility functions can be modified if
   you need special options.
*/

ZEXTERN int ZEXPORT compress OF((Bytef *dest,   uLongf *destLen,
                                 const Bytef *source, uLong sourceLen));
/*
     Compresses the source buffer into the destination buffer.  sourceLen is
   the byte length of the source buffer.  Upon entry, destLen is the total size
   of the destination buffer, which must be at least the value returned by
   compressBound(sourceLen).  Upon exit, destLen is the actual size of the
   compressed buffer.

     compress returns Z_OK if success, Z_MEM_ERROR if there was not
   enough memory, Z_BUF_ERROR if there was not enough room in the output
   buffer.
*/

ZEXTERN int ZEXPORT compress2 OF((Bytef *dest,   uLongf *destLen,
                                  const Bytef *source, uLong sourceLen,
                                  int level));
/*
     Compresses the source buffer into the destination buffer.  The level
   parameter has the same meaning as in deflateInit.  sourceLen is the byte
   length of the source buffer.  Upon entry, destLen is the total size of the
   destination buffer, which must be at least the value returned by
   compressBound(sourceLen).  Upon exit, destLen is the actual size of the
   compressed buffer.

     compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
   memory, Z_BUF_ERROR if there was not enough room in the output buffer,
   Z_STREAM_ERROR if the level parameter is invalid.
*/

ZEXTERN uLong ZEXPORT compressBound OF((uLong sourceLen));
/*
     compressBound() returns an upper bound on the compressed size after
   compress() or compress2() on sourceLen bytes.  It would be used before a
   compress() or compress2() call to allocate the destination buffer.
*/

ZEXTERN int ZEXPORT uncompress OF((Bytef *dest,   uLongf *destLen,
                                   const Bytef *source, uLong sourceLen));
/*
     Decompresses the source buffer into the destination buffer.  sourceLen is
   the byte length of the source buffer.  Upon entry, destLen is the total size
   of the destination buffer, which must be large enough to hold the entire
   uncompressed data.  (The size of the uncompressed data must have been saved
   previously by the compressor and transmitted to the decompressor by some
   mechanism outside the scope of this compression library.) Upon exit, destLen
   is the actual size of the uncompressed buffer.

     uncompress returns Z_OK if success, Z_MEM_ERROR if there was not
   enough memory, Z_BUF_ERROR if there was not enough room in the output
   buffer, or Z_DATA_ERROR if the input data was corrupted or incomplete.
*/


                        /* gzip file access functions */

/*
     This library supports reading and writing files in gzip (.gz) format with
   an interface similar to that of stdio, using the functions that start with
   "gz".  The gzip format is different from the zlib format.  gzip is a gzip
   wrapper, documented in RFC 1952, wrapped around a deflate stream.
*/

typedef voidp gzFile;       /* opaque gzip file descriptor */

/*
ZEXTERN gzFile ZEXPORT gzopen OF((const char *path, const char *mode));

     Opens a gzip (.gz) file for reading or writing.  The mode parameter is as
   in fopen ("rb" or "wb") but can also include a compression level ("wb9") or
   a strategy: 'f' for filtered data as in "wb6f", 'h' for Huffman-only
   compression as in "wb1h", 'R' for run-length encoding as in "wb1R", or 'F'
   for fixed code compression as in "wb9F".  (See the description of
   deflateInit2 for more information about the strategy parameter.) Also "a"
   can be used instead of "w" to request that the gzip stream that will be
   written be appended to the file.  "+" will result in an error, since reading
   and writing to the same gzip file is not supported.

     gzopen can be used to read a file which is not in gzip format; in this
   case gzread will directly read from the file without decompression.

     gzopen returns NULL if the file could not be opened, if there was
   insufficient memory to allocate the gzFile state, or if an invalid mode was
   specified (an 'r', 'w', or 'a' was not provided, or '+' was provided).
   errno can be checked to determine if the reason gzopen failed was that the
   file could not be opened.
*/

ZEXTERN gzFile ZEXPORT gzdopen OF((int fd, const char *mode));
/*
     gzdopen associates a gzFile with the file descriptor fd.  File descriptors
   are obtained from calls like open, dup, creat, pipe or fileno (if the file
   has been previously opened with fopen).  The mode parameter is as in gzopen.

     The next call of gzclose on the returned gzFile will also close the file
   descriptor fd, just like fclose(fdopen(fd, mode)) closes the file descriptor
   fd.  If you want to keep fd open, use fd = dup(fd_keep); gz = gzdopen(fd,
   mode);.  The duplicated descriptor should be saved to avoid a leak, since
   gzdopen does not close fd if it fails.

     gzdopen returns NULL if there was insufficient memory to allocate the
   gzFile state, if an invalid mode was specified (an 'r', 'w', or 'a' was not
   provided, or '+' was provided), or if fd is -1.  The file descriptor is not
   used until the next gz* read, write, seek, or close operation, so gzdopen
   will not detect if fd is invalid (unless fd is -1).
*/

ZEXTERN int ZEXPORT gzbuffer OF((gzFile file, unsigned size));
/*
     Set the internal buffer size used by this library's functions.  The
   default buffer size is 8192 bytes.  This function must be called after
   gzopen() or gzdopen(), and before any other calls that read or write the
   file.  The buffer memory allocation is always deferred to the first read or
   write.  Two buffers are allocated, either both of the specified size when
   writing, or one of the specified size and the other twice that size when
   reading.  A larger buffer size of, for example, 64K or 128K bytes will
   noticeably increase the speed of decompression (reading).

     The new buffer size also affects the maximum length for gzprintf().

     gzbuffer() returns 0 on success, or -1 on failure, such as being called
   too late.
*/

ZEXTERN int ZEXPORT gzsetparams OF((gzFile file, int level, int strategy));
/*
     Dynamically update the compression level or strategy.  See the description
   of deflateInit2 for the meaning of these parameters.

     gzsetparams returns Z_OK if success, or Z_STREAM_ERROR if the file was not
   opened for writing.
*/

ZEXTERN int ZEXPORT gzread OF((gzFile file, voidp buf, unsigned len));
/*
     Reads the given number of uncompressed bytes from the compressed file.  If
   the input file was not in gzip format, gzread copies the given number of
   bytes into the buffer.

     After reaching the end of a gzip stream in the input, gzread will continue
   to read, looking for another gzip stream, or failing that, reading the rest
   of the input file directly without decompression.  The entire input file
   will be read if gzread is called until it returns less than the requested
   len.

     gzread returns the number of uncompressed bytes actually read, less than
   len for end of file, or -1 for error.
*/

ZEXTERN int ZEXPORT gzwrite OF((gzFile file,
                                voidpc buf, unsigned len));
/*
     Writes the given number of uncompressed bytes into the compressed file.
   gzwrite returns the number of uncompressed bytes written or 0 in case of
   error.
*/

ZEXTERN int ZEXPORTVA gzprintf OF((gzFile file, const char *format, ...));
/*
     Converts, formats, and writes the arguments to the compressed file under
   control of the format string, as in fprintf.  gzprintf returns the number of
   uncompressed bytes actually written, or 0 in case of error.  The number of
   uncompressed bytes written is limited to 8191, or one less than the buffer
   size given to gzbuffer().  The caller should assure that this limit is not
   exceeded.  If it is exceeded, then gzprintf() will return an error (0) with
   nothing written.  In this case, there may also be a buffer overflow with
   unpredictable consequences, which is possible only if zlib was compiled with
   the insecure functions sprintf() or vsprintf() because the secure snprintf()
   or vsnprintf() functions were not available.  This can be determined using
   zlibCompileFlags().
*/

ZEXTERN int ZEXPORT gzputs OF((gzFile file, const char *s));
/*
     Writes the given null-terminated string to the compressed file, excluding
   the terminating null character.

     gzputs returns the number of characters written, or -1 in case of error.
*/

ZEXTERN char * ZEXPORT gzgets OF((gzFile file, char *buf, int len));
/*
     Reads bytes from the compressed file until len-1 characters are read, or a
   newline character is read and transferred to buf, or an end-of-file
   condition is encountered.  If any characters are read or if len == 1, the
   string is terminated with a null character.  If no characters are read due
   to an end-of-file or len < 1, then the buffer is left untouched.

     gzgets returns buf which is a null-terminated string, or it returns NULL
   for end-of-file or in case of error.  If there was an error, the contents at
   buf are indeterminate.
*/

ZEXTERN int ZEXPORT gzputc OF((gzFile file, int c));
/*
     Writes c, converted to an unsigned char, into the compressed file.  gzputc
   returns the value that was written, or -1 in case of error.
*/

ZEXTERN int ZEXPORT gzgetc OF((gzFile file));
/*
     Reads one byte from the compressed file.  gzgetc returns this byte or -1
   in case of end of file or error.
*/

ZEXTERN int ZEXPORT gzungetc OF((int c, gzFile file));
/*
     Push one character back onto the stream to be read as the first character
   on the next read.  At least one character of push-back is allowed.
   gzungetc() returns the character pushed, or -1 on failure.  gzungetc() will
   fail if c is -1, and may fail if a character has been pushed but not read
   yet.  If gzungetc is used immediately after gzopen or gzdopen, at least the
   output buffer size of pushed characters is allowed.  (See gzbuffer above.)
   The pushed character will be discarded if the stream is repositioned with
   gzseek() or gzrewind().
*/

ZEXTERN int ZEXPORT gzflush OF((gzFile file, int flush));
/*
     Flushes all pending output into the compressed file.  The parameter flush
   is as in the deflate() function.  The return value is the zlib error number
   (see function gzerror below).  gzflush is only permitted when writing.

     If the flush parameter is Z_FINISH, the remaining data is written and the
   gzip stream is completed in the output.  If gzwrite() is called again, a new
   gzip stream will be started in the output.  gzread() is able to read such
   concatented gzip streams.

     gzflush should be called only when strictly necessary because it will
   degrade compression if called too often.
*/

/*
ZEXTERN z_off_t ZEXPORT gzseek OF((gzFile file,
                                   z_off_t offset, int whence));

     Sets the starting position for the next gzread or gzwrite on the given
   compressed file.  The offset represents a number of bytes in the
   uncompressed data stream.  The whence parameter is defined as in lseek(2);
   the value SEEK_END is not supported.

     If the file is opened for reading, this function is emulated but can be
   extremely slow.  If the file is opened for writing, only forward seeks are
   supported; gzseek then compresses a sequence of zeroes up to the new
   starting position.

     gzseek returns the resulting offset location as measured in bytes from
   the beginning of the uncompressed stream, or -1 in case of error, in
   particular if the file is opened for writing and the new starting position
   would be before the current position.
*/

ZEXTERN int ZEXPORT    gzrewind OF((gzFile file));
/*
     Rewinds the given file. This function is supported only for reading.

     gzrewind(file) is equivalent to (int)gzseek(file, 0L, SEEK_SET)
*/

/*
ZEXTERN z_off_t ZEXPORT    gztell OF((gzFile file));

     Returns the starting position for the next gzread or gzwrite on the given
   compressed file.  This position represents a number of bytes in the
   uncompressed data stream, and is zero when starting, even if appending or
   reading a gzip stream from the middle of a file using gzdopen().

     gztell(file) is equivalent to gzseek(file, 0L, SEEK_CUR)
*/

/*
ZEXTERN z_off_t ZEXPORT gzoffset OF((gzFile file));

     Returns the current offset in the file being read or written.  This offset
   includes the count of bytes that precede the gzip stream, for example when
   appending or when using gzdopen() for reading.  When reading, the offset
   does not include as yet unused buffered input.  This information can be used
   for a progress indicator.  On error, gzoffset() returns -1.
*/

ZEXTERN int ZEXPORT gzeof OF((gzFile file));
/*
     Returns true (1) if the end-of-file indicator has been set while reading,
   false (0) otherwise.  Note that the end-of-file indicator is set only if the
   read tried to go past the end of the input, but came up short.  Therefore,
   just like feof(), gzeof() may return false even if there is no more data to
   read, in the event that the last read request was for the exact number of
   bytes remaining in the input file.  This will happen if the input file size
   is an exact multiple of the buffer size.

     If gzeof() returns true, then the read functions will return no more data,
   unless the end-of-file indicator is reset by gzclearerr() and the input file
   has grown since the previous end of file was detected.
*/

ZEXTERN int ZEXPORT gzdirect OF((gzFile file));
/*
     Returns true (1) if file is being copied directly while reading, or false
   (0) if file is a gzip stream being decompressed.  This state can change from
   false to true while reading the input file if the end of a gzip stream is
   reached, but is followed by data that is not another gzip stream.

     If the input file is empty, gzdirect() will return true, since the input
   does not contain a gzip stream.

     If gzdirect() is used immediately after gzopen() or gzdopen() it will
   cause buffers to be allocated to allow reading the file to determine if it
   is a gzip file.  Therefore if gzbuffer() is used, it should be called before
   gzdirect().
*/

ZEXTERN int ZEXPORT    gzclose OF((gzFile file));
/*
     Flushes all pending output if necessary, closes the compressed file and
   deallocates the (de)compression state.  Note that once file is closed, you
   cannot call gzerror with file, since its structures have been deallocated.
   gzclose must not be called more than once on the same file, just as free
   must not be called more than once on the same allocation.

     gzclose will return Z_STREAM_ERROR if file is not valid, Z_ERRNO on a
   file operation error, or Z_OK on success.
*/

ZEXTERN int ZEXPORT gzclose_r OF((gzFile file));
ZEXTERN int ZEXPORT gzclose_w OF((gzFile file));
/*
     Same as gzclose(), but gzclose_r() is only for use when reading, and
   gzclose_w() is only for use when writing or appending.  The advantage to
   using these instead of gzclose() is that they avoid linking in zlib
   compression or decompression code that is not used when only reading or only
   writing respectively.  If gzclose() is used, then both compression and
   decompression code will be included the application when linking to a static
   zlib library.
*/

ZEXTERN const char * ZEXPORT gzerror OF((gzFile file, int *errnum));
/*
     Returns the error message for the last error which occurred on the given
   compressed file.  errnum is set to zlib error number.  If an error occurred
   in the file system and not in the compression library, errnum is set to
   Z_ERRNO and the application may consult errno to get the exact error code.

     The application must not modify the returned string.  Future calls to
   this function may invalidate the previously returned string.  If file is
   closed, then the string previously returned by gzerror will no longer be
   available.

     gzerror() should be used to distinguish errors from end-of-file for those
   functions above that do not distinguish those cases in their return values.
*/

ZEXTERN void ZEXPORT gzclearerr OF((gzFile file));
/*
     Clears the error and end-of-file flags for file.  This is analogous to the
   clearerr() function in stdio.  This is useful for continuing to read a gzip
   file that is being written concurrently.
*/


                        /* checksum functions */

/*
     These functions are not related to compression but are exported
   anyway because they might be useful in applications using the compression
   library.
*/

ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len));
/*
     Update a running Adler-32 checksum with the bytes buf[0..len-1] and
   return the updated checksum.  If buf is Z_NULL, this function returns the
   required initial value for the checksum.

     An Adler-32 checksum is almost as reliable as a CRC32 but can be computed
   much faster.

   Usage example:

     uLong adler = adler32(0L, Z_NULL, 0);

     while (read_buffer(buffer, length) != EOF) {
       adler = adler32(adler, buffer, length);
     }
     if (adler != original_adler) error();
*/

/*
ZEXTERN uLong ZEXPORT adler32_combine OF((uLong adler1, uLong adler2,
                                          z_off_t len2));

     Combine two Adler-32 checksums into one.  For two sequences of bytes, seq1
   and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for
   each, adler1 and adler2.  adler32_combine() returns the Adler-32 checksum of
   seq1 and seq2 concatenated, requiring only adler1, adler2, and len2.
*/

ZEXTERN uLong ZEXPORT crc32   OF((uLong crc, const Bytef *buf, uInt len));
/*
     Update a running CRC-32 with the bytes buf[0..len-1] and return the
   updated CRC-32.  If buf is Z_NULL, this function returns the required
   initial value for the for the crc.  Pre- and post-conditioning (one's
   complement) is performed within this function so it shouldn't be done by the
   application.

   Usage example:

     uLong crc = crc32(0L, Z_NULL, 0);

     while (read_buffer(buffer, length) != EOF) {
       crc = crc32(crc, buffer, length);
     }
     if (crc != original_crc) error();
*/

/*
ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, z_off_t len2));

     Combine two CRC-32 check values into one.  For two sequences of bytes,
   seq1 and seq2 with lengths len1 and len2, CRC-32 check values were
   calculated for each, crc1 and crc2.  crc32_combine() returns the CRC-32
   check value of seq1 and seq2 concatenated, requiring only crc1, crc2, and
   len2.
*/


                        /* various hacks, don't look :) */

/* deflateInit and inflateInit are macros to allow checking the zlib version
 * and the compiler's view of z_stream:
 */
ZEXTERN int ZEXPORT deflateInit_ OF((z_streamp strm, int level,
                                     const char *version, int stream_size));
ZEXTERN int ZEXPORT inflateInit_ OF((z_streamp strm,
                                     const char *version, int stream_size));
ZEXTERN int ZEXPORT deflateInit2_ OF((z_streamp strm, int  level, int  method,
                                      int windowBits, int memLevel,
                                      int strategy, const char *version,
                                      int stream_size));
ZEXTERN int ZEXPORT inflateInit2_ OF((z_streamp strm, int  windowBits,
                                      const char *version, int stream_size));
ZEXTERN int ZEXPORT inflateBackInit_ OF((z_streamp strm, int windowBits,
                                         unsigned char FAR *window,
                                         const char *version,
                                         int stream_size));
#define deflateInit(strm, level) \
        deflateInit_((strm), (level),       ZLIB_VERSION, sizeof(z_stream))
#define inflateInit(strm) \
        inflateInit_((strm),                ZLIB_VERSION, sizeof(z_stream))
#define deflateInit2(strm, level, method, windowBits, memLevel, strategy) \
        deflateInit2_((strm),(level),(method),(windowBits),(memLevel),\
                      (strategy),           ZLIB_VERSION, sizeof(z_stream))
#define inflateInit2(strm, windowBits) \
        inflateInit2_((strm), (windowBits), ZLIB_VERSION, sizeof(z_stream))
#define inflateBackInit(strm, windowBits, window) \
        inflateBackInit_((strm), (windowBits), (window), \
                                            ZLIB_VERSION, sizeof(z_stream))

/* provide 64-bit offset functions if _LARGEFILE64_SOURCE defined, and/or
 * change the regular functions to 64 bits if _FILE_OFFSET_BITS is 64 (if
 * both are true, the application gets the *64 functions, and the regular
 * functions are changed to 64 bits) -- in case these are set on systems
 * without large file support, _LFS64_LARGEFILE must also be true
 */
#if defined(_LARGEFILE64_SOURCE) && _LFS64_LARGEFILE-0
   ZEXTERN gzFile ZEXPORT gzopen64 OF((const char *, const char *));
   ZEXTERN z_off64_t ZEXPORT gzseek64 OF((gzFile, z_off64_t, int));
   ZEXTERN z_off64_t ZEXPORT gztell64 OF((gzFile));
   ZEXTERN z_off64_t ZEXPORT gzoffset64 OF((gzFile));
   ZEXTERN uLong ZEXPORT adler32_combine64 OF((uLong, uLong, z_off64_t));
   ZEXTERN uLong ZEXPORT crc32_combine64 OF((uLong, uLong, z_off64_t));
#endif

#if !defined(ZLIB_INTERNAL) && _FILE_OFFSET_BITS-0 == 64 && _LFS64_LARGEFILE-0
#  define gzopen gzopen64
#  define gzseek gzseek64
#  define gztell gztell64
#  define gzoffset gzoffset64
#  define adler32_combine adler32_combine64
#  define crc32_combine crc32_combine64
#  ifdef _LARGEFILE64_SOURCE
     ZEXTERN gzFile ZEXPORT gzopen64 OF((const char *, const char *));
     ZEXTERN z_off_t ZEXPORT gzseek64 OF((gzFile, z_off_t, int));
     ZEXTERN z_off_t ZEXPORT gztell64 OF((gzFile));
     ZEXTERN z_off_t ZEXPORT gzoffset64 OF((gzFile));
     ZEXTERN uLong ZEXPORT adler32_combine64 OF((uLong, uLong, z_off_t));
     ZEXTERN uLong ZEXPORT crc32_combine64 OF((uLong, uLong, z_off_t));
#  endif
#else
   ZEXTERN gzFile ZEXPORT gzopen OF((const char *, const char *));
   ZEXTERN z_off_t ZEXPORT gzseek OF((gzFile, z_off_t, int));
   ZEXTERN z_off_t ZEXPORT gztell OF((gzFile));
   ZEXTERN z_off_t ZEXPORT gzoffset OF((gzFile));
   ZEXTERN uLong ZEXPORT adler32_combine OF((uLong, uLong, z_off_t));
   ZEXTERN uLong ZEXPORT crc32_combine OF((uLong, uLong, z_off_t));
#endif

/* hack for buggy compilers */
#if !defined(ZUTIL_H) && !defined(NO_DUMMY_DECL)
    struct internal_state {int dummy;};
#endif

/* undocumented functions */
ZEXTERN const char   * ZEXPORT zError           OF((int));
ZEXTERN int            ZEXPORT inflateSyncPoint OF((z_streamp));
ZEXTERN const uLongf * ZEXPORT get_crc_table    OF((void));
ZEXTERN int            ZEXPORT inflateUndermine OF((z_streamp, int));

#ifdef __cplusplus
}
#endif

#endif /* ZLIB_H */
cfitsio-3.47/zlib/zuncompress.c0000644000225700000360000004005113464573432016104 0ustar  cagordonlhea/* gzcompress.h -- definitions for the .Z decompression routine used in CFITSIO */

#include 
#include 
#include 
#include 

#define get_char() get_byte()

/* gzip.h -- common declarations for all gzip modules  */

#define OF(args)  args
typedef void *voidp;

#define memzero(s, n)     memset ((voidp)(s), 0, (n))

typedef unsigned char  uch;
typedef unsigned short ush;
typedef unsigned long  ulg;

/* private version of MIN function */
#define MINZIP(a,b) ((a) <= (b) ? (a) : (b))

/* Return codes from gzip */
#define OK      0
#define ERROR   1
#define COMPRESSED  1
#define DEFLATED    8
#define INBUFSIZ  0x8000    /* input buffer size */
#define INBUF_EXTRA  64     /* required by unlzw() */
#define OUTBUFSIZ  16384    /* output buffer size */
#define OUTBUF_EXTRA 2048   /* required by unlzw() */
#define DIST_BUFSIZE 0x8000 /* buffer for distances, see trees.c */
#define WSIZE 0x8000        /* window size--must be a power of two, and */
#define DECLARE(type, array, size)  type array[size]
#define tab_suffix window
#define tab_prefix prev    /* hash link (see deflate.c) */
#define head (prev+WSIZE)  /* hash head (see deflate.c) */
#define	LZW_MAGIC      "\037\235" /* Magic header for lzw files, 1F 9D */
#define get_byte()  (inptr < insize ? inbuf[inptr++] : fill_inbuf(0))

/* Diagnostic functions */
#  define Assert(cond,msg)
#  define Trace(x)
#  define Tracev(x)
#  define Tracevv(x)
#  define Tracec(c,x)
#  define Tracecv(c,x)

/* lzw.h -- define the lzw functions. */

#ifndef BITS
#  define BITS 16
#endif
#define INIT_BITS 9              /* Initial number of bits per code */
#define BIT_MASK    0x1f /* Mask for 'number of compression bits' */
#define BLOCK_MODE  0x80
#define LZW_RESERVED 0x60 /* reserved bits */
#define	CLEAR  256       /* flush the dictionary */
#define FIRST  (CLEAR+1) /* first free entry */

/* prototypes */

#define local static
void ffpmsg(const char *err_message);

local int  fill_inbuf    OF((int eof_ok));
local void write_buf     OF((voidp buf, unsigned cnt));
local void error         OF((char *m));
local int unlzw  OF((FILE *in, FILE *out));

typedef int file_t;     /* Do not use stdio */

int (*work) OF((FILE *infile, FILE *outfile)) = unlzw; /* function to call */

local void error         OF((char *m));

		/* global buffers */

static DECLARE(uch, inbuf,  INBUFSIZ +INBUF_EXTRA);
static DECLARE(uch, outbuf, OUTBUFSIZ+OUTBUF_EXTRA);
static DECLARE(ush, d_buf,  DIST_BUFSIZE);
static DECLARE(uch, window, 2L*WSIZE);

#ifndef MAXSEG_64K
    static DECLARE(ush, tab_prefix, 1L< 0)
        return(*status);

    /*  save input parameters into global variables */
    ifname[0] = '\0';
    strncat(ifname, filename, 127);
    ifd = indiskfile;
    memptr = (void **) buffptr;
    memsize = buffsize;
    realloc_fn = mem_realloc;

    /* clear input and output buffers */

    insize = inptr = 0;
    bytes_in = bytes_out = 0L;

    magic[0] = (char)get_byte();
    magic[1] = (char)get_byte();

    if (memcmp(magic, LZW_MAGIC, 2) != 0) {
      error("ERROR: input .Z file is in unrecognized compression format.\n");
      return(-1);
    }

    work = unlzw;
    method = COMPRESSED;
    last_member = 1;

    /* do the uncompression */
    if ((*work)(ifd, ofd) != OK) {
        method = -1; /* force cleanup */
        *status = 414;    /* report some sort of decompression error */
    }

    if (filesize)  *filesize = bytes_out;

    return(*status);
}
/*=========================================================================*/
/*=========================================================================*/
/* this marks the begining of the original file 'unlzw.c'                  */
/*=========================================================================*/
/*=========================================================================*/

/* unlzw.c -- decompress files in LZW format.
 * The code in this file is directly derived from the public domain 'compress'
 * written by Spencer Thomas, Joe Orost, James Woods, Jim McKie, Steve Davies,
 * Ken Turkowski, Dave Mack and Peter Jannesen.
 */

typedef	unsigned char	char_type;
typedef          long   code_int;
typedef unsigned long 	count_int;
typedef unsigned short	count_short;
typedef unsigned long 	cmp_code_int;

#define MAXCODE(n)	(1L << (n))
    
#ifndef	REGISTERS
#	define	REGISTERS	2
#endif
#define	REG1	
#define	REG2	
#define	REG3	
#define	REG4	
#define	REG5	
#define	REG6	
#define	REG7	
#define	REG8	
#define	REG9	
#define	REG10
#define	REG11	
#define	REG12	
#define	REG13
#define	REG14
#define	REG15
#define	REG16
#if REGISTERS >= 1
#	undef	REG1
#	define	REG1	register
#endif
#if REGISTERS >= 2
#	undef	REG2
#	define	REG2	register
#endif
#if REGISTERS >= 3
#	undef	REG3
#	define	REG3	register
#endif
#if REGISTERS >= 4
#	undef	REG4
#	define	REG4	register
#endif
#if REGISTERS >= 5
#	undef	REG5
#	define	REG5	register
#endif
#if REGISTERS >= 6
#	undef	REG6
#	define	REG6	register
#endif
#if REGISTERS >= 7
#	undef	REG7
#	define	REG7	register
#endif
#if REGISTERS >= 8
#	undef	REG8
#	define	REG8	register
#endif
#if REGISTERS >= 9
#	undef	REG9
#	define	REG9	register
#endif
#if REGISTERS >= 10
#	undef	REG10
#	define	REG10	register
#endif
#if REGISTERS >= 11
#	undef	REG11
#	define	REG11	register
#endif
#if REGISTERS >= 12
#	undef	REG12
#	define	REG12	register
#endif
#if REGISTERS >= 13
#	undef	REG13
#	define	REG13	register
#endif
#if REGISTERS >= 14
#	undef	REG14
#	define	REG14	register
#endif
#if REGISTERS >= 15
#	undef	REG15
#	define	REG15	register
#endif
#if REGISTERS >= 16
#	undef	REG16
#	define	REG16	register
#endif
    
#ifndef	BYTEORDER
#	define	BYTEORDER	0000
#endif
	
#ifndef	NOALLIGN
#	define	NOALLIGN	0
#endif


union	bytes {
    long  word;
    struct {
#if BYTEORDER == 4321
	char_type	b1;
	char_type	b2;
	char_type	b3;
	char_type	b4;
#else
#if BYTEORDER == 1234
	char_type	b4;
	char_type	b3;
	char_type	b2;
	char_type	b1;
#else
#	undef	BYTEORDER
	int  dummy;
#endif
#endif
    } bytes;
};

#if BYTEORDER == 4321 && NOALLIGN == 1
#  define input(b,o,c,n,m){ \
     (c) = (*(long *)(&(b)[(o)>>3])>>((o)&0x7))&(m); \
     (o) += (n); \
   }
#else
#  define input(b,o,c,n,m){ \
     REG1 char_type *p = &(b)[(o)>>3]; \
     (c) = ((((long)(p[0]))|((long)(p[1])<<8)| \
     ((long)(p[2])<<16))>>((o)&0x7))&(m); \
     (o) += (n); \
   }
#endif

#ifndef MAXSEG_64K
   /* DECLARE(ush, tab_prefix, (1<>1]
#  define clear_tab_prefixof()	\
      memzero(tab_prefix0, 128), \
      memzero(tab_prefix1, 128);
#endif
#define de_stack        ((char_type *)(&d_buf[DIST_BUFSIZE-1]))
#define tab_suffixof(i) tab_suffix[i]

int block_mode = BLOCK_MODE; /* block compress mode -C compatible with 2.0 */

/* ============================================================================
 * Decompress in to out.  This routine adapts to the codes in the
 * file building the "string" table on-the-fly; requiring no table to
 * be stored in the compressed file.
 * IN assertions: the buffer inbuf contains already the beginning of
 *   the compressed data, from offsets iptr to insize-1 included.
 *   The magic header has already been checked and skipped.
 *   bytes_in and bytes_out have been initialized.
 */
local int unlzw(FILE *in, FILE *out) 
    /* input and output file descriptors */
{
    REG2   char_type  *stackp;
    REG3   code_int   code;
    REG4   int        finchar;
    REG5   code_int   oldcode;
    REG6   code_int   incode;
    REG7   long       inbits;
    REG8   long       posbits;
    REG9   int        outpos;
/*  REG10  int        insize; (global) */
    REG11  unsigned   bitmask;
    REG12  code_int   free_ent;
    REG13  code_int   maxcode;
    REG14  code_int   maxmaxcode;
    REG15  int        n_bits;
    REG16  int        rsize;
    
    ofd = out;

#ifdef MAXSEG_64K
    tab_prefix[0] = tab_prefix0;
    tab_prefix[1] = tab_prefix1;
#endif
    maxbits = get_byte();
    block_mode = maxbits & BLOCK_MODE;
    if ((maxbits & LZW_RESERVED) != 0) {
	error( "warning, unknown flags in unlzw decompression");
    }
    maxbits &= BIT_MASK;
    maxmaxcode = MAXCODE(maxbits);
    
    if (maxbits > BITS) {
	error("compressed with too many bits; cannot handle file");
	exit_code = ERROR;
	return ERROR;
    }
    rsize = insize;
    maxcode = MAXCODE(n_bits = INIT_BITS)-1;
    bitmask = (1<= 0 ; --code) {
	tab_suffixof(code) = (char_type)code;
    }
    do {
	REG1 int i;
	int  e;
	int  o;
	
    resetbuf:
	e = insize-(o = (posbits>>3));
	
	for (i = 0 ; i < e ; ++i) {
	    inbuf[i] = inbuf[i+o];
	}
	insize = e;
	posbits = 0;
	
	if (insize < INBUF_EXTRA) {
/*  modified to use fread instead of read - WDP 10/22/97  */
/*	    if ((rsize = read(in, (char*)inbuf+insize, INBUFSIZ)) == EOF) { */

	    if ((rsize = fread((char*)inbuf+insize, 1, INBUFSIZ, in)) == EOF) {
		error("unexpected end of file");
	        exit_code = ERROR;
                return ERROR;
	    }
	    insize += rsize;
	    bytes_in += (ulg)rsize;
	}
	inbits = ((rsize != 0) ? ((long)insize - insize%n_bits)<<3 : 
		  ((long)insize<<3)-(n_bits-1));
	
	while (inbits > posbits) {
	    if (free_ent > maxcode) {
		posbits = ((posbits-1) +
			   ((n_bits<<3)-(posbits-1+(n_bits<<3))%(n_bits<<3)));
		++n_bits;
		if (n_bits == maxbits) {
		    maxcode = maxmaxcode;
		} else {
		    maxcode = MAXCODE(n_bits)-1;
		}
		bitmask = (1<= 256) {
                    error("corrupt input.");
	            exit_code = ERROR;
                    return ERROR;
                }

		outbuf[outpos++] = (char_type)(finchar = (int)(oldcode=code));
		continue;
	    }
	    if (code == CLEAR && block_mode) {
		clear_tab_prefixof();
		free_ent = FIRST - 1;
		posbits = ((posbits-1) +
			   ((n_bits<<3)-(posbits-1+(n_bits<<3))%(n_bits<<3)));
		maxcode = MAXCODE(n_bits = INIT_BITS)-1;
		bitmask = (1<= free_ent) { /* Special case for KwKwK string. */
		if (code > free_ent) {
		    if (outpos > 0) {
			write_buf((char*)outbuf, outpos);
			bytes_out += (ulg)outpos;
		    }
		    error("corrupt input.");
	            exit_code = ERROR;
                    return ERROR;

		}
		*--stackp = (char_type)finchar;
		code = oldcode;
	    }

	    while ((cmp_code_int)code >= (cmp_code_int)256) {
		/* Generate output characters in reverse order */
		*--stackp = tab_suffixof(code);
		code = tab_prefixof(code);
	    }
	    *--stackp =	(char_type)(finchar = tab_suffixof(code));
	    
	    /* And put them out in forward order */
	    {
	/*	REG1 int	i;   already defined above (WDP) */
	    
		if (outpos+(i = (de_stack-stackp)) >= OUTBUFSIZ) {
		    do {
			if (i > OUTBUFSIZ-outpos) i = OUTBUFSIZ-outpos;

			if (i > 0) {
			    memcpy(outbuf+outpos, stackp, i);
			    outpos += i;
			}
			if (outpos >= OUTBUFSIZ) {
			    write_buf((char*)outbuf, outpos);
			    bytes_out += (ulg)outpos;
			    outpos = 0;
			}
			stackp+= i;
		    } while ((i = (de_stack-stackp)) > 0);
		} else {
		    memcpy(outbuf+outpos, stackp, i);
		    outpos += i;
		}
	    }

	    if ((code = free_ent) < maxmaxcode) { /* Generate the new entry. */

		tab_prefixof(code) = (unsigned short)oldcode;
		tab_suffixof(code) = (char_type)finchar;
		free_ent = code+1;
	    } 
	    oldcode = incode;	/* Remember previous code.	*/
	}
    } while (rsize != 0);
    
    if (outpos > 0) {
	write_buf((char*)outbuf, outpos);
	bytes_out += (ulg)outpos;
    }
    return OK;
}
/* ========================================================================*/
/* this marks the start of the code from 'util.c'  */

local int fill_inbuf(int eof_ok)
         /* set if EOF acceptable as a result */
{
    int len;

      /* Read as much as possible from file */
      insize = 0;
      do {
        len = fread((char*)inbuf+insize, 1, INBUFSIZ-insize, ifd);
        if (len == 0 || len == EOF) break;
	insize += len;
      } while (insize < INBUFSIZ);

    if (insize == 0) {
	if (eof_ok) return EOF;
	error("unexpected end of file");
        exit_code = ERROR;
        return ERROR;
    }

    bytes_in += (ulg)insize;
    inptr = 1;
    return inbuf[0];
}
/* =========================================================================== */
local void write_buf(voidp buf, unsigned cnt)
/*              copy buffer into memory; allocate more memory if required*/
{
    if (!realloc_fn)
    {
      /* append buffer to file */
      /* added 'unsigned' to get rid of compiler warning (WDP 1/1/99) */
      if ((unsigned long) fwrite(buf, 1, cnt, ofd) != cnt)
      {
          error
          ("failed to write buffer to uncompressed output file (write_buf)");
          exit_code = ERROR;
          return;
      }
    }
    else
    {
      /* get more memory if current buffer is too small */
      if (bytes_out + cnt > *memsize)
      {
        *memptr = realloc_fn(*memptr, bytes_out + cnt);
        *memsize = bytes_out + cnt;  /* new memory buffer size */

        if (!(*memptr))
        {
            error("malloc failed while uncompressing (write_buf)");
            exit_code = ERROR;
            return;
        }  
      }
      /* copy  into memory buffer */
      memcpy((char *) *memptr + bytes_out, (char *) buf, cnt);
    }
}
/* ======================================================================== */
local void error(char *m)
/*                Error handler */
{
    ffpmsg(ifname);
    ffpmsg(m);
}
cfitsio-3.47/zlib/zutil.c0000644000225700000360000001620013464573432014662 0ustar  cagordonlhea/* zutil.c -- target dependent utility functions for the compression library
 * Copyright (C) 1995-2005, 2010 Jean-loup Gailly.
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

#include "zutil.h"

#ifndef NO_DUMMY_DECL
struct internal_state      {int dummy;}; /* for buggy compilers */
#endif

const char * const z_errmsg[10] = {
"need dictionary",     /* Z_NEED_DICT       2  */
"stream end",          /* Z_STREAM_END      1  */
"",                    /* Z_OK              0  */
"file error",          /* Z_ERRNO         (-1) */
"stream error",        /* Z_STREAM_ERROR  (-2) */
"data error",          /* Z_DATA_ERROR    (-3) */
"insufficient memory", /* Z_MEM_ERROR     (-4) */
"buffer error",        /* Z_BUF_ERROR     (-5) */
"incompatible version",/* Z_VERSION_ERROR (-6) */
""};


const char * ZEXPORT zlibVersion()
{
    return ZLIB_VERSION;
}

uLong ZEXPORT zlibCompileFlags()
{
    uLong flags;

    flags = 0;
    switch ((int)(sizeof(uInt))) {
    case 2:     break;
    case 4:     flags += 1;     break;
    case 8:     flags += 2;     break;
    default:    flags += 3;
    }
    switch ((int)(sizeof(uLong))) {
    case 2:     break;
    case 4:     flags += 1 << 2;        break;
    case 8:     flags += 2 << 2;        break;
    default:    flags += 3 << 2;
    }
    switch ((int)(sizeof(voidpf))) {
    case 2:     break;
    case 4:     flags += 1 << 4;        break;
    case 8:     flags += 2 << 4;        break;
    default:    flags += 3 << 4;
    }
    switch ((int)(sizeof(z_off_t))) {
    case 2:     break;
    case 4:     flags += 1 << 6;        break;
    case 8:     flags += 2 << 6;        break;
    default:    flags += 3 << 6;
    }
#ifdef DEBUG
    flags += 1 << 8;
#endif
#if defined(ASMV) || defined(ASMINF)
    flags += 1 << 9;
#endif
#ifdef ZLIB_WINAPI
    flags += 1 << 10;
#endif
#ifdef BUILDFIXED
    flags += 1 << 12;
#endif
#ifdef DYNAMIC_CRC_TABLE
    flags += 1 << 13;
#endif
#ifdef NO_GZCOMPRESS
    flags += 1L << 16;
#endif
#ifdef NO_GZIP
    flags += 1L << 17;
#endif
#ifdef PKZIP_BUG_WORKAROUND
    flags += 1L << 20;
#endif
#ifdef FASTEST
    flags += 1L << 21;
#endif
#ifdef STDC
#  ifdef NO_vsnprintf
        flags += 1L << 25;
#    ifdef HAS_vsprintf_void
        flags += 1L << 26;
#    endif
#  else
#    ifdef HAS_vsnprintf_void
        flags += 1L << 26;
#    endif
#  endif
#else
        flags += 1L << 24;
#  ifdef NO_snprintf
        flags += 1L << 25;
#    ifdef HAS_sprintf_void
        flags += 1L << 26;
#    endif
#  else
#    ifdef HAS_snprintf_void
        flags += 1L << 26;
#    endif
#  endif
#endif
    return flags;
}

#ifdef DEBUG

#  ifndef verbose
#    define verbose 0
#  endif
int ZLIB_INTERNAL z_verbose = verbose;

void ZLIB_INTERNAL z_error (m)
    char *m;
{
    fprintf(stderr, "%s\n", m);
    exit(1);
}
#endif

/* exported to allow conversion of error code to string for compress() and
 * uncompress()
 */
const char * ZEXPORT zError(err)
    int err;
{
    return ERR_MSG(err);
}

#if defined(_WIN32_WCE)
    /* The Microsoft C Run-Time Library for Windows CE doesn't have
     * errno.  We define it as a global variable to simplify porting.
     * Its value is always 0 and should not be used.
     */
    int errno = 0;
#endif

#ifndef HAVE_MEMCPY

void ZLIB_INTERNAL zmemcpy(dest, source, len)
    Bytef* dest;
    const Bytef* source;
    uInt  len;
{
    if (len == 0) return;
    do {
        *dest++ = *source++; /* ??? to be unrolled */
    } while (--len != 0);
}

int ZLIB_INTERNAL zmemcmp(s1, s2, len)
    const Bytef* s1;
    const Bytef* s2;
    uInt  len;
{
    uInt j;

    for (j = 0; j < len; j++) {
        if (s1[j] != s2[j]) return 2*(s1[j] > s2[j])-1;
    }
    return 0;
}

void ZLIB_INTERNAL zmemzero(dest, len)
    Bytef* dest;
    uInt  len;
{
    if (len == 0) return;
    do {
        *dest++ = 0;  /* ??? to be unrolled */
    } while (--len != 0);
}
#endif


#ifdef SYS16BIT

#ifdef __TURBOC__
/* Turbo C in 16-bit mode */

#  define MY_ZCALLOC

/* Turbo C malloc() does not allow dynamic allocation of 64K bytes
 * and farmalloc(64K) returns a pointer with an offset of 8, so we
 * must fix the pointer. Warning: the pointer must be put back to its
 * original form in order to free it, use zcfree().
 */

#define MAX_PTR 10
/* 10*64K = 640K */

local int next_ptr = 0;

typedef struct ptr_table_s {
    voidpf org_ptr;
    voidpf new_ptr;
} ptr_table;

local ptr_table table[MAX_PTR];
/* This table is used to remember the original form of pointers
 * to large buffers (64K). Such pointers are normalized with a zero offset.
 * Since MSDOS is not a preemptive multitasking OS, this table is not
 * protected from concurrent access. This hack doesn't work anyway on
 * a protected system like OS/2. Use Microsoft C instead.
 */

voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, unsigned items, unsigned size)
{
    voidpf buf = opaque; /* just to make some compilers happy */
    ulg bsize = (ulg)items*size;

    /* If we allocate less than 65520 bytes, we assume that farmalloc
     * will return a usable pointer which doesn't have to be normalized.
     */
    if (bsize < 65520L) {
        buf = farmalloc(bsize);
        if (*(ush*)&buf != 0) return buf;
    } else {
        buf = farmalloc(bsize + 16L);
    }
    if (buf == NULL || next_ptr >= MAX_PTR) return NULL;
    table[next_ptr].org_ptr = buf;

    /* Normalize the pointer to seg:0 */
    *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
    *(ush*)&buf = 0;
    table[next_ptr++].new_ptr = buf;
    return buf;
}

void ZLIB_INTERNAL zcfree (voidpf opaque, voidpf ptr)
{
    int n;
    if (*(ush*)&ptr != 0) { /* object < 64K */
        farfree(ptr);
        return;
    }
    /* Find the original pointer */
    for (n = 0; n < next_ptr; n++) {
        if (ptr != table[n].new_ptr) continue;

        farfree(table[n].org_ptr);
        while (++n < next_ptr) {
            table[n-1] = table[n];
        }
        next_ptr--;
        return;
    }
    ptr = opaque; /* just to make some compilers happy */
    Assert(0, "zcfree: ptr not found");
}

#endif /* __TURBOC__ */


#ifdef M_I86
/* Microsoft C in 16-bit mode */

#  define MY_ZCALLOC

#if (!defined(_MSC_VER) || (_MSC_VER <= 600))
#  define _halloc  halloc
#  define _hfree   hfree
#endif

voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, uInt items, uInt size)
{
    if (opaque) opaque = 0; /* to make compiler happy */
    return _halloc((long)items, size);
}

void ZLIB_INTERNAL zcfree (voidpf opaque, voidpf ptr)
{
    if (opaque) opaque = 0; /* to make compiler happy */
    _hfree(ptr);
}

#endif /* M_I86 */

#endif /* SYS16BIT */


#ifndef MY_ZCALLOC /* Any system without a special alloc function */

#ifndef STDC
extern voidp  malloc OF((uInt size));
extern voidp  calloc OF((uInt items, uInt size));
extern void   free   OF((voidpf ptr));
#endif

voidpf ZLIB_INTERNAL zcalloc (opaque, items, size)
    voidpf opaque;
    unsigned items;
    unsigned size;
{
    if (opaque) items += size - size; /* make compiler happy */
    return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) :
                              (voidpf)calloc(items, size);
}

void ZLIB_INTERNAL zcfree (opaque, ptr)
    voidpf opaque;
    voidpf ptr;
{
    free(ptr);
    if (opaque) return; /* make compiler happy */
}

#endif /* MY_ZCALLOC */
cfitsio-3.47/zlib/zutil.h0000644000225700000360000001574013464573432014677 0ustar  cagordonlhea/* zutil.h -- internal interface and configuration of the compression library
 * Copyright (C) 1995-2010 Jean-loup Gailly.
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

/* WARNING: this file should *not* be used by applications. It is
   part of the implementation of the compression library and is
   subject to change. Applications should only use zlib.h.
 */

#ifndef ZUTIL_H
#define ZUTIL_H

#if ((__GNUC__-0) * 10 + __GNUC_MINOR__-0 >= 33) && !defined(NO_VIZ)
#  define ZLIB_INTERNAL __attribute__((visibility ("hidden")))
#else
#  define ZLIB_INTERNAL
#endif

#include "zlib.h"

#ifdef STDC
#  if !(defined(_WIN32_WCE) && defined(_MSC_VER))
#    include 
#  endif
#  include 
#  include 
#endif

#ifndef local
#  define local static
#endif
/* compile with -Dlocal if your debugger can't find static symbols */

typedef unsigned char  uch;
typedef uch FAR uchf;
typedef unsigned short ush;
typedef ush FAR ushf;
typedef unsigned long  ulg;

extern const char * const z_errmsg[10]; /* indexed by 2-zlib_error */
/* (size given to avoid silly warnings with Visual C++) */

#define ERR_MSG(err) z_errmsg[Z_NEED_DICT-(err)]

#define ERR_RETURN(strm,err) \
  return (strm->msg = (char*)ERR_MSG(err), (err))
/* To be used only when the state is known to be valid */

        /* common constants */

#ifndef DEF_WBITS
#  define DEF_WBITS MAX_WBITS
#endif
/* default windowBits for decompression. MAX_WBITS is for compression only */

#if MAX_MEM_LEVEL >= 8
#  define DEF_MEM_LEVEL 8
#else
#  define DEF_MEM_LEVEL  MAX_MEM_LEVEL
#endif
/* default memLevel */

#define STORED_BLOCK 0
#define STATIC_TREES 1
#define DYN_TREES    2
/* The three kinds of block type */

#define MIN_MATCH  3
#define MAX_MATCH  258
/* The minimum and maximum match lengths */

#define PRESET_DICT 0x20 /* preset dictionary flag in zlib header */

        /* target dependencies */

#if defined(MSDOS) || (defined(WINDOWS) && !defined(WIN32))
#  define OS_CODE  0x00
#  if defined(__TURBOC__) || defined(__BORLANDC__)
#    if (__STDC__ == 1) && (defined(__LARGE__) || defined(__COMPACT__))
       /* Allow compilation with ANSI keywords only enabled */
       void _Cdecl farfree( void *block );
       void *_Cdecl farmalloc( unsigned long nbytes );
#    else
#      include 
#    endif
#  else /* MSC or DJGPP */
#    include 
#  endif
#endif

#ifdef AMIGA
#  define OS_CODE  0x01
#endif

#if defined(VAXC) || defined(VMS)
#  define OS_CODE  0x02
#  define F_OPEN(name, mode) \
     fopen((name), (mode), "mbc=60", "ctx=stm", "rfm=fix", "mrs=512")
#endif

#if defined(ATARI) || defined(atarist)
#  define OS_CODE  0x05
#endif

#ifdef OS2
#  define OS_CODE  0x06
#  ifdef M_I86
#    include 
#  endif
#endif

#if defined(MACOS) || defined(TARGET_OS_MAC)
#  define OS_CODE  0x07
#  if defined(__MWERKS__) && __dest_os != __be_os && __dest_os != __win32_os
#    include  /* for fdopen */
#  else
#    ifndef fdopen
#      define fdopen(fd,mode) NULL /* No fdopen() */
#    endif
#  endif
#endif

#ifdef TOPS20
#  define OS_CODE  0x0a
#endif

#ifdef WIN32
#  ifndef __CYGWIN__  /* Cygwin is Unix, not Win32 */
#    define OS_CODE  0x0b
#  endif
#endif

#ifdef __50SERIES /* Prime/PRIMOS */
#  define OS_CODE  0x0f
#endif

#if defined(_BEOS_) || defined(RISCOS)
#  define fdopen(fd,mode) NULL /* No fdopen() */
#endif

#if (defined(_MSC_VER) && (_MSC_VER > 600)) && !defined __INTERIX
#  if defined(_WIN32_WCE)
#    define fdopen(fd,mode) NULL /* No fdopen() */
#    ifndef _PTRDIFF_T_DEFINED
       typedef int ptrdiff_t;
#      define _PTRDIFF_T_DEFINED
#    endif
#  else
#    define fdopen(fd,type)  _fdopen(fd,type)
#  endif
#endif

#if defined(__BORLANDC__)
  #pragma warn -8004
  #pragma warn -8008
  #pragma warn -8066
#endif

/* provide prototypes for these when building zlib without LFS */
#if !defined(_LARGEFILE64_SOURCE) || _LFS64_LARGEFILE-0 == 0
    ZEXTERN uLong ZEXPORT adler32_combine64 OF((uLong, uLong, z_off_t));
    ZEXTERN uLong ZEXPORT crc32_combine64 OF((uLong, uLong, z_off_t));
#endif

        /* common defaults */

#ifndef OS_CODE
#  define OS_CODE  0x03  /* assume Unix */
#endif

#ifndef F_OPEN
#  define F_OPEN(name, mode) fopen((name), (mode))
#endif

         /* functions */

#if defined(STDC99) || (defined(__TURBOC__) && __TURBOC__ >= 0x550)
#  ifndef HAVE_VSNPRINTF
#    define HAVE_VSNPRINTF
#  endif
#endif
#if defined(__CYGWIN__)
#  ifndef HAVE_VSNPRINTF
#    define HAVE_VSNPRINTF
#  endif
#endif
#ifndef HAVE_VSNPRINTF
#  ifdef MSDOS
     /* vsnprintf may exist on some MS-DOS compilers (DJGPP?),
        but for now we just assume it doesn't. */
#    define NO_vsnprintf
#  endif
#  ifdef __TURBOC__
#    define NO_vsnprintf
#  endif
#  ifdef WIN32
     /* In Win32, vsnprintf is available as the "non-ANSI" _vsnprintf. */
#    if !defined(vsnprintf) && !defined(NO_vsnprintf)
#      if !defined(_MSC_VER) || ( defined(_MSC_VER) && _MSC_VER < 1500 )
#         define vsnprintf _vsnprintf
#      endif
#    endif
#  endif
#  ifdef __SASC
#    define NO_vsnprintf
#  endif
#endif
#ifdef VMS
#  define NO_vsnprintf
#endif

#if defined(pyr)
#  define NO_MEMCPY
#endif
#if defined(SMALL_MEDIUM) && !defined(_MSC_VER) && !defined(__SC__)
 /* Use our own functions for small and medium model with MSC <= 5.0.
  * You may have to use the same strategy for Borland C (untested).
  * The __SC__ check is for Symantec.
  */
#  define NO_MEMCPY
#endif
#if defined(STDC) && !defined(HAVE_MEMCPY) && !defined(NO_MEMCPY)
#  define HAVE_MEMCPY
#endif
#ifdef HAVE_MEMCPY
#  ifdef SMALL_MEDIUM /* MSDOS small or medium model */
#    define zmemcpy _fmemcpy
#    define zmemcmp _fmemcmp
#    define zmemzero(dest, len) _fmemset(dest, 0, len)
#  else
#    define zmemcpy memcpy
#    define zmemcmp memcmp
#    define zmemzero(dest, len) memset(dest, 0, len)
#  endif
#else
   void ZLIB_INTERNAL zmemcpy OF((Bytef* dest, const Bytef* source, uInt len));
   int ZLIB_INTERNAL zmemcmp OF((const Bytef* s1, const Bytef* s2, uInt len));
   void ZLIB_INTERNAL zmemzero OF((Bytef* dest, uInt len));
#endif

/* Diagnostic functions */
#ifdef DEBUG
#  include 
   extern int ZLIB_INTERNAL z_verbose;
   extern void ZLIB_INTERNAL z_error OF((char *m));
#  define Assert(cond,msg) {if(!(cond)) z_error(msg);}
#  define Trace(x) {if (z_verbose>=0) fprintf x ;}
#  define Tracev(x) {if (z_verbose>0) fprintf x ;}
#  define Tracevv(x) {if (z_verbose>1) fprintf x ;}
#  define Tracec(c,x) {if (z_verbose>0 && (c)) fprintf x ;}
#  define Tracecv(c,x) {if (z_verbose>1 && (c)) fprintf x ;}
#else
#  define Assert(cond,msg)
#  define Trace(x)
#  define Tracev(x)
#  define Tracevv(x)
#  define Tracec(c,x)
#  define Tracecv(c,x)
#endif


voidpf ZLIB_INTERNAL zcalloc OF((voidpf opaque, unsigned items,
                        unsigned size));
void ZLIB_INTERNAL zcfree  OF((voidpf opaque, voidpf ptr));

#define ZALLOC(strm, items, size) \
           (*((strm)->zalloc))((strm)->opaque, (items), (size))
#define ZFREE(strm, addr)  (*((strm)->zfree))((strm)->opaque, (voidpf)(addr))
#define TRY_FREE(s, p) {if (p) ZFREE(s, p);}

#endif /* ZUTIL_H */

ËxÑ ¼< Ø2qØŠ+ö¯8QHjÍ8QÏD“–ù‘PÈÝaîáN(1®û>oþ¾ Ʀ™ØD[‹ÔÂ,LG‹ý'œað¹‘×aw\b%e‚.ôo ˆ u€Y÷Õ º{L0ØÐÏ 7ØâT‹nât×øœ0>9-Q­Laºš=aÁžfpÄ,~bqίîÊ¿Þ]Ô¦š_ü÷0  °ðïâ…äY÷»:‹S ‹n"#ìØšû¿×Z»š–¢ÒºJ+9Q³Ë!ÂH†÷ $¼H¶ 9…yú0x‹ùmáßXŒ©2:ˆ'Ź‚¤|K=Ï2ULS»|éJoÙº¤‚H+”†Ð7ð ªÕïÓ Ž<ú?*t)öŒÜçc£¤Jš¸’Ég]ùîr­§a~›ƒ’‘Ò%‹çDŠýÝ“eJ¤JÏDyLeX±8 <,Ðeß®æÇÀ:'ëfº·uÔFˆØ?“,ãâ#C·/F̬¥7~8YB®ù)x•G‰¼1š¢ÚÛ£‘^ô1[þ8¬€ß÷KQg­ƒ:­àF T’œ=¢·`£Ü~ñ~¤FcNÌ€ÜduL…ɳ޸_ jàÛåBïÎÍ<èJo^¨æì¸ŠÓ"3%ynéqêØÜ¸\”‡ò33óSÕß:÷,£j¤ßùf¹°AÓ™ƒë YH”+M‰Ü¬ƒCú–Õ”ªRQQ'Ÿ|fä“;L|² R„øn‘*“P¸‘OêÐejTŠ ˜‹&Zå†Ë„]ÝãzG‚îïJÐ?N±îH~ë zõ;àc:-j®õr-Ü9 &vðÃ'Þ÷º‹޹ÛÉJ«‘Z½!z}`ÈtÔ0ˆÔõ*ÝóGf 6P˜þ=J«ÿ úÞ—¨ŽKÌÚÝXZ^XsyŠ˜·`Ç‡ÜÆñ&>ó·ŽëÅ&,×I[WiÀ%éRɤwÌ…dƒxæö“gÏ?ÁBKzðévyάi2_Z/7Cÿ|dÅÆ;WL$±0t‘°Ë°øÂù˰ã²UíÅPOùüâÚ[CEÿŒ9,c7¸œ8{áèÑ3ço߸ÎÙy?̓MM> iFÌÓÛ·Úêµá5¼&·"-O¥(ËFLQynmyhý†è­JÏ|DŽGÉÄ|°lѬE^¡¼SÑŠ`ßaÈ#_œµØ }‚¢™™¯WÃ`üºõ»¦°S›«¹È —²iˆYNÇ¢H›b`QùÑùÊR”‚ÒRòÓ²苯°ã9ZœÕÐPÊWf¡Ûˆi 4ÓyÑÎñê‰×ü³gÌÃ<[P„JÔÒýÑe|l^ؾ¸¼£ÅÅY÷ÕçЗè8ó÷Ék@ªNyv|JbfT*$´v0¬e½éiHZsNq]GçP ú:ûdÞù²Ò§¨ Õ„çØgm&ÛÚ€°›T,ÛöÈZQ TIMËÃPh‚*)5¡³Åu”· ƒšéÂqÖpŠò©á…ƒÕïÀ!ùÿrPóÿ8¦1*ý-BÈŠc;‹®”´–˜J0éýôèšm[ÖNå—ÒàèÍ~ÑT¢E‡˜ï>À}8¼üÿÇ‹½hÑ©{„»×¡ÿ²Œ\=ò-ñ.ò­‰Ø‡˜+_hBÑ„¯û*ùØä=áþèøÙ+(SQÎEÕJ4òœîÚºÿ Ü^¬ ö=ƒVý0Ö¨ùFõ¨ ÜŠûõHø“¦„E‹^ê“Ík‚ËüýƒƒýýË‚kjÊÊj¸®Þ`uæ^s»f˜¼ªÙšøo¥èCfÓÎ5óý·¦Uïâ\ª+‹•EÊbïNy…­;ôU™:¿!‹;諸JôsëqÛU÷ÃQy¼ëÁ€Œ‹Ñ˹Å.¹nè„Íéæ“7¡OÁ>j.58'¾´K/Y5^B¸o,çÚ¸!׉$–Ù¢ù³>=n÷mÑxiÊç’ü$¦ç‰#N¶ÁÐW¼Ö›w»b:ÝÝF`Hû4 Gnn>„ú¡¨Y ¤”ÁÔHŠB$Áá~ A‡`ì~°¼Ê‰žé{§wŒP¥XwI ëwhááï83±i—oêqú°øßD±±eö%-³W‹f²0„=ÈädˆÆ³ð$ xm\ÐÞ;Ííò­=”Wí½õ>ýÍÒ¦OJ;\ÓÇ4½Ý­?îê ÚÝÿ¦?ØÝÿHÛÚmÚ´ÑþÌ?9ø±ÎÀ‰ß5êWx4åÅ‹GOa÷ï:ì˿ƪ£t‡Æö¸~Ð4†,ŒÕØ]±^f´¯ƒ¨Ök\VƒùøRäÆÐ…q; Ì®1±HÑ4AocÝø·‘ûIºµe»¢ZdSJPVSw9j­Î¶@_ÃËp'Ðe“ë¤( 1Þ¦·ãV¡{Hg;ylôdrçᡨ¹íЉCåùáö– C»zÎÝ¿ ú?‡$r ôt_×ÈÝþœlŸ±bD÷½‘¯<(˜éðÐÁJ­ G¯4Óûwät1çù=:팿]·IéOu;lUªå¤ OŠbˆÄÛŽ·'8úˆÒ•%qç6ém{òàùFQƒ²x}«½4Ý£‚ˆ9›,ÂβKS3ÎAdÚA"õÒœÎá0Ur†¸ eç(½Ñ`ãlÍ[I©¤7HÄßgsQ£‡òˆâþ\(ŒB¨1·31Hâ¹ µ:³//²ŠØø$g b‰ƒ§Fª_ÕICý9¬ /þùWZŽ_Eß0`9î.îûÌŸ3kOMt‘¦¼¨&7!O‘Á?Q1¾Þ1cùÖµvŽt™­…S†WW^bQ :¶©v[Õª4Ä„“H–$’Üã’‘;òbðL!ÚUà}D²Þ;y;Jdð !i!îxl2/"6=ú©ô~¯R£S¨†y"DûQÁþÂý'U„Ì«KÕuAª>H…{¥$·tž3¥\6œ½mû¬ t»H÷z®7ƒGlËþš èsgÉ—Xˆ-—o[áU)/5ì'?>;)•«¯¿iл×O¹;ùÊ<‚yï@q²{òºDB~Œè7CÑsÇé_OºvõúUSw-È9ȧ§g*Ý}<0ýùZÒZ†~÷ô'zŽnn¿dWg°I–ö׬ÁoCEßéíô_±…²Âˆèø„ø8Î×?0BN²%6+272OªñDÈ?B.•ù£0&¢ ¢0G®Îàêjª óQ6¬¼¨¼ÈÒ}¨Õ–•Ô–¡âÎꢴúÞ¥‚Ú n1;I¬"’È*)ã•WÏA:¦zà秦a?°ù0òÇÑ>Tž@¾â‰ ƒŠ¥U•¥EuÍîç&àaä_?ìĉ^ã0_ò+~y–@Ïhý8‘~ÚîäÊ€->ÄÚ£ÝÍRm²Z©NV3)ÓùRe!tÊr´2#¹ˆ \ëåS_Ý?ûéâ™vë–v˜¥Ñ7iGuH‹ïGz^ŒWyâ„{1räÕXT”SË¥C|K´—J‹SRP>cð‡¿¥ã à ç'ž(8”wéD·#6¾x¨Ñ$•îñ ®é[Ù³®i …kâFÏt<%ʼnS¹¢Ý)®ªÀ*".÷£ÔÌ”ƒ)çT×TçTgÒΣ³L{îà#¢…¤Ptކ“~Ãiás(€vv‰Ã±–3-'ÿqï¶M뜗ðÿða¿©>ÖŒ.0fÝÃ}±åGóç®;¾åœè·E!+×,6áÙ VO?¿ki±†›ØÙv-:íÅ+?<½°jõ »õ³ îà Á¿¨ÈËÔO~2ûuï_”þ*›zÂ33…"¿èTç<ìl­’¥†Ô J”^¬*2¤ÒÎÿ}„q3sZ¡‰äƒnSDÞ3Ôü¨bcðÀß›HÚ±»*¤0-=]M´rEXi Xîë]¼ŒkR°ƒ`+IˆÇfºIØlÜl’!ôãé@âùt¦èØ!IcçnüòΣ›-·ŽÔH¤…|•Wîf"’•É(%¤E ã¸aÝìŽxi`Ô wF• õ[Íô½à#ö+:—4äFÅÛÑÅ0Îâ¤é†Âô¦ l²ñA‰~Ê(îg=æwÐQ¤É{4¢\þK: ³Øjºñ9 D¤dÂòÃ5õ©µ¹)\!ô·øí÷ñR.¿uÌ0¦ƒ$/ØÁ l‡AfpOoÎ6ùVy»‰}|öÔ6¨¬¯çð%ó¿Ý뀡KÚ;Áña+Éi«‹WW¶}§ýõÎÊ«CEjà8Ô²_DqB›Ñf§í+£™ÕÁb™ÐIíZ&;­NËÎDåLMP‘TីcöÅÀDs{ „·¾Ur„пäô÷èjöÿ­fDÿ}v ÷&ž’nމMˆB‘ a™ÕšŠÜ¦¯oá>Ù\SÍõAâÎMˆ{E®\ˆ£ 5¦`¾sÃ|]öÆýè4:yò`k6cTlÐǸw+ÃÞ×\2|lòÎý‹ž­i7g#7¸…Êbã“äq(‚‘„•ý|Ì¿ðmpsô÷ô/òhîpJ+Œj…¤VÝ*hlimyC¾ÍôKßbÓ²SÒIë(–IƒâB£8\õçòĘägZQR‘Qœ“ÆÁw¿³wö\Ú²eϚŋ›Öœ:Õté÷á26*´úèÑ’êÜÜ’gçЀ(oÐßcïínÙ¶Õmí¢?_²ùÀŻƑ5G×ååûº:‡úGʯE£w.´è§>Ü`s2ò2Q Sš¡HR*ä~€w)â#cQ¨ ŠÌŒÎŽƒï±›u¾"UI±°$·¼„ÜÍàñA°³0VÝm- Ñ jtê–‡-`M¶ø‘žfëMX2¥‹0ñ˼flŒÔ¸^‘ž{ù]"׆|µl˧ñ;3ÖkVq±±kW&+Cƒ"<Ðfብ_9Ôp ž+ =²™Åµ×Oî DÉÉ |¢shdڃ܎+r5¥Ç³+¼ &°²3ʳ(“¹XUU¶/åS…_˜û–õœ›³%^ù’²Ý銢 =ÝäˆqйR}2'÷ęޯ´éƃ‚zG3½¼`s÷’Ò܃ä<¡Ùò=¤¼ö’ò‚×x›ßDžx‘¢ÅÐQ^äIa–† ÎkB u<À®ÖéG}<ûõž&W¯°À €RI]Fº ¥piHš´tþ>6!&äPX‘<¿â¬¸¿Fhé_YjC„P^lNLþܬåYI*b"B£$¡än±&ßÑqa“”Df¥ª²ò “ÍѼ "°±ØðaÔÄ¥…åâw€ sôâð0ì‡ÂœŒ4TÀd&”úáØgá¾Ç§5náÎ.¹»ž¬ªôÒL¾…àw­UkÛñÓ¾yÓø!žE' /<;][ØT‹Î0MâGØÜj·Þ»B¦1’Åì5WYs"ãsļúÜÛ'08*4†Çcç¡éh³E¬ËVï#Å•—°ïªÎ]ì'Œò5F }w<ñ8µñö¢– Ĉ㥱²œ¸ô$fcAžIdÿø=˜ÇçÊH@2&V-­¬…¤ÑgŽOk¡Žümù¡–“”£c“R:$À<û™Ø÷½1÷Nóχañ5xâ¡øSü ôÇ6`ûäá…Úž„bbxo·hO"¥© @Á(xÿå«ßjŽÅ¬.çWâ›ìv—Ë÷?øØÑµsç:­ÛipäMˆ~)~v\¹Yju]o¥_ ý75«õÜSzÃ¥:"e"¦4¯¸ (*+YÅ‹‹>Ù˜Ô%ëÜŒ¼ R²i¨v‡.M©R}j‰`Øëå…¼~*»”@SWäYÉ(ÙH#Ãd¡9ñy$Mk0µ&*.2Im‘ßAÞJTÚ!?òÚ»íͪU~‘\ÕѼ´oG/&yóÙÛ~¬‰ÇÙyÜŸ+…>ê˜}Øõ“ÞŽ6àÈ} ||té¨`a” éð(Mw <v£ŒÂ£éžÂŨo.ê'™Áà·SØ„ìØ¢`ÄHeáa±i1©ñ<<üó“ô˜Ìð2dSZPTœ™˜¤î<„ "> endobj 5 0 obj <>endobj 1816 0 obj <>stream dvips + GPL Ghostscript 9.07 () 2019-05-08T10:27:17-04:00 2019-05-08T10:27:17-04:00 LaTeX with hyperref package ()()() endstream endobj 2 0 obj <>endobj xref 0 1817 0000000000 65535 f 0000812611 00000 n 0001006607 00000 n 0000810881 00000 n 0000771430 00000 n 0000989455 00000 n 0000812553 00000 n 0000813215 00000 n 0000812807 00000 n 0000812898 00000 n 0000813025 00000 n 0000813128 00000 n 0000814436 00000 n 0000813730 00000 n 0000813337 00000 n 0000813431 00000 n 0000813529 00000 n 0000813635 00000 n 0000813864 00000 n 0000813973 00000 n 0000814092 00000 n 0000814226 00000 n 0000814344 00000 n 0000814589 00000 n 0000816269 00000 n 0000814691 00000 n 0000814787 00000 n 0000814910 00000 n 0000815037 00000 n 0000815173 00000 n 0000815293 00000 n 0000815412 00000 n 0000815514 00000 n 0000815635 00000 n 0000815772 00000 n 0000815902 00000 n 0000816030 00000 n 0000816167 00000 n 0000818717 00000 n 0000816418 00000 n 0000816524 00000 n 0000816639 00000 n 0000816960 00000 n 0000816748 00000 n 0000816854 00000 n 0000817121 00000 n 0000817256 00000 n 0000818094 00000 n 0000817363 00000 n 0000817461 00000 n 0000817583 00000 n 0000817710 00000 n 0000817840 00000 n 0000817972 00000 n 0000818587 00000 n 0000818252 00000 n 0000818356 00000 n 0000818481 00000 n 0000819338 00000 n 0000818874 00000 n 0000818977 00000 n 0000819095 00000 n 0000819227 00000 n 0000819585 00000 n 0000819493 00000 n 0000819941 00000 n 0000819743 00000 n 0000819843 00000 n 0000822435 00000 n 0000820298 00000 n 0000820097 00000 n 0000820190 00000 n 0000820437 00000 n 0000821360 00000 n 0000820546 00000 n 0000820655 00000 n 0000820786 00000 n 0000820903 00000 n 0000821021 00000 n 0000821137 00000 n 0000821255 00000 n 0000821522 00000 n 0000821662 00000 n 0000822273 00000 n 0000821814 00000 n 0000821919 00000 n 0000822045 00000 n 0000822166 00000 n 0000825632 00000 n 0000822599 00000 n 0000823432 00000 n 0000822685 00000 n 0000822798 00000 n 0000822932 00000 n 0000823066 00000 n 0000823193 00000 n 0000823318 00000 n 0000823568 00000 n 0000823672 00000 n 0000823809 00000 n 0000823944 00000 n 0000824073 00000 n 0000824193 00000 n 0000824300 00000 n 0000824417 00000 n 0000825351 00000 n 0000824554 00000 n 0000824655 00000 n 0000824765 00000 n 0000824880 00000 n 0000824991 00000 n 0000825120 00000 n 0000825245 00000 n 0000825512 00000 n 0000826445 00000 n 0000825787 00000 n 0000825897 00000 n 0000826017 00000 n 0000826138 00000 n 0000826255 00000 n 0000826356 00000 n 0000827320 00000 n 0000826589 00000 n 0000826690 00000 n 0000826812 00000 n 0000826954 00000 n 0000827070 00000 n 0000827211 00000 n 0000827687 00000 n 0000827474 00000 n 0000827583 00000 n 0000827838 00000 n 0000827947 00000 n 0000989351 00000 n 0000000015 00000 n 0000000887 00000 n 0000828060 00000 n 0000943953 00000 n 0000969536 00000 n 0000943614 00000 n 0000967112 00000 n 0000942886 00000 n 0000957024 00000 n 0000828103 00000 n 0000828138 00000 n 0000771594 00000 n 0000000908 00000 n 0000001076 00000 n 0000828199 00000 n 0000828234 00000 n 0000771760 00000 n 0000001096 00000 n 0000002954 00000 n 0000828269 00000 n 0000942326 00000 n 0000951131 00000 n 0000828402 00000 n 0000828537 00000 n 0000828671 00000 n 0000828806 00000 n 0000828941 00000 n 0000829074 00000 n 0000829209 00000 n 0000829349 00000 n 0000829489 00000 n 0000829628 00000 n 0000829767 00000 n 0000829902 00000 n 0000830034 00000 n 0000830169 00000 n 0000830304 00000 n 0000830439 00000 n 0000830572 00000 n 0000830705 00000 n 0000830840 00000 n 0000830975 00000 n 0000831110 00000 n 0000831244 00000 n 0000831379 00000 n 0000831414 00000 n 0000772118 00000 n 0000002976 00000 n 0000005473 00000 n 0000942006 00000 n 0000946286 00000 n 0000831475 00000 n 0000831610 00000 n 0000831745 00000 n 0000831880 00000 n 0000832015 00000 n 0000832151 00000 n 0000832287 00000 n 0000832423 00000 n 0000832558 00000 n 0000832691 00000 n 0000832826 00000 n 0000832961 00000 n 0000833096 00000 n 0000833231 00000 n 0000833368 00000 n 0000833508 00000 n 0000833643 00000 n 0000833778 00000 n 0000833912 00000 n 0000834052 00000 n 0000834191 00000 n 0000834331 00000 n 0000834471 00000 n 0000834611 00000 n 0000834751 00000 n 0000834886 00000 n 0000835026 00000 n 0000835166 00000 n 0000835306 00000 n 0000835439 00000 n 0000835574 00000 n 0000835706 00000 n 0000835841 00000 n 0000835876 00000 n 0000772548 00000 n 0000005495 00000 n 0000007804 00000 n 0000835937 00000 n 0000836072 00000 n 0000836205 00000 n 0000836340 00000 n 0000836473 00000 n 0000836605 00000 n 0000836739 00000 n 0000836872 00000 n 0000837007 00000 n 0000837147 00000 n 0000837287 00000 n 0000837422 00000 n 0000837557 00000 n 0000837697 00000 n 0000837837 00000 n 0000837977 00000 n 0000838117 00000 n 0000838257 00000 n 0000838397 00000 n 0000838537 00000 n 0000838672 00000 n 0000838807 00000 n 0000838941 00000 n 0000839081 00000 n 0000839221 00000 n 0000839361 00000 n 0000839501 00000 n 0000839632 00000 n 0000839768 00000 n 0000839904 00000 n 0000840045 00000 n 0000840080 00000 n 0000772962 00000 n 0000007826 00000 n 0000010063 00000 n 0000840141 00000 n 0000840282 00000 n 0000840423 00000 n 0000840564 00000 n 0000840705 00000 n 0000840846 00000 n 0000840982 00000 n 0000841118 00000 n 0000841254 00000 n 0000841390 00000 n 0000841526 00000 n 0000841662 00000 n 0000841798 00000 n 0000841935 00000 n 0000842072 00000 n 0000842214 00000 n 0000842355 00000 n 0000842497 00000 n 0000842639 00000 n 0000842781 00000 n 0000842922 00000 n 0000843064 00000 n 0000843201 00000 n 0000843334 00000 n 0000843470 00000 n 0000843605 00000 n 0000843741 00000 n 0000843877 00000 n 0000844013 00000 n 0000844149 00000 n 0000844283 00000 n 0000844419 00000 n 0000844555 00000 n 0000844590 00000 n 0000773392 00000 n 0000010085 00000 n 0000011198 00000 n 0000844651 00000 n 0000844787 00000 n 0000844923 00000 n 0000845059 00000 n 0000845195 00000 n 0000845329 00000 n 0000845465 00000 n 0000845601 00000 n 0000845734 00000 n 0000845868 00000 n 0000846002 00000 n 0000846037 00000 n 0000773646 00000 n 0000011220 00000 n 0000011446 00000 n 0000846098 00000 n 0000846133 00000 n 0000773812 00000 n 0000011467 00000 n 0000015457 00000 n 0000846181 00000 n 0000846216 00000 n 0000773978 00000 n 0000015479 00000 n 0000020564 00000 n 0000945671 00000 n 0000980572 00000 n 0000846264 00000 n 0000846299 00000 n 0000774144 00000 n 0000020586 00000 n 0000026207 00000 n 0000846373 00000 n 0000846408 00000 n 0000774318 00000 n 0000026229 00000 n 0000029223 00000 n 0000846456 00000 n 0000846491 00000 n 0000774484 00000 n 0000029245 00000 n 0000032412 00000 n 0000846552 00000 n 0000846587 00000 n 0000774650 00000 n 0000032434 00000 n 0000037025 00000 n 0000846648 00000 n 0000846683 00000 n 0000774824 00000 n 0000037047 00000 n 0000041282 00000 n 0000846744 00000 n 0000846779 00000 n 0000774998 00000 n 0000041304 00000 n 0000045417 00000 n 0000846853 00000 n 0000846888 00000 n 0000775172 00000 n 0000045439 00000 n 0000050447 00000 n 0000846949 00000 n 0000846984 00000 n 0000775346 00000 n 0000050469 00000 n 0000054315 00000 n 0000847058 00000 n 0000847093 00000 n 0000775520 00000 n 0000054337 00000 n 0000055287 00000 n 0000847167 00000 n 0000847202 00000 n 0000775686 00000 n 0000055308 00000 n 0000055624 00000 n 0000847263 00000 n 0000847298 00000 n 0000775852 00000 n 0000055645 00000 n 0000059348 00000 n 0000945209 00000 n 0000979634 00000 n 0000847346 00000 n 0000847381 00000 n 0000776018 00000 n 0000059370 00000 n 0000063969 00000 n 0000847455 00000 n 0000847490 00000 n 0000776184 00000 n 0000063991 00000 n 0000067433 00000 n 0000847564 00000 n 0000847599 00000 n 0000776358 00000 n 0000067455 00000 n 0000069888 00000 n 0000847660 00000 n 0000847695 00000 n 0000776524 00000 n 0000069910 00000 n 0000071725 00000 n 0000847756 00000 n 0000847791 00000 n 0000776690 00000 n 0000071747 00000 n 0000076045 00000 n 0000847852 00000 n 0000847887 00000 n 0000776856 00000 n 0000076067 00000 n 0000080821 00000 n 0000847961 00000 n 0000847996 00000 n 0000777030 00000 n 0000080843 00000 n 0000086185 00000 n 0000848057 00000 n 0000848092 00000 n 0000777204 00000 n 0000086207 00000 n 0000090158 00000 n 0000848166 00000 n 0000848201 00000 n 0000777378 00000 n 0000090180 00000 n 0000094622 00000 n 0000848262 00000 n 0000848297 00000 n 0000777552 00000 n 0000094644 00000 n 0000099167 00000 n 0000848371 00000 n 0000848406 00000 n 0000777726 00000 n 0000099189 00000 n 0000104828 00000 n 0000848493 00000 n 0000848528 00000 n 0000777900 00000 n 0000104850 00000 n 0000110263 00000 n 0000848602 00000 n 0000848637 00000 n 0000778074 00000 n 0000110285 00000 n 0000116183 00000 n 0000848711 00000 n 0000848746 00000 n 0000778248 00000 n 0000116205 00000 n 0000121538 00000 n 0000848794 00000 n 0000848829 00000 n 0000778422 00000 n 0000121560 00000 n 0000127658 00000 n 0000848903 00000 n 0000848938 00000 n 0000778596 00000 n 0000127680 00000 n 0000130789 00000 n 0000848999 00000 n 0000849034 00000 n 0000778770 00000 n 0000130811 00000 n 0000131115 00000 n 0000849095 00000 n 0000849130 00000 n 0000778936 00000 n 0000131136 00000 n 0000135039 00000 n 0000945052 00000 n 0000979004 00000 n 0000849178 00000 n 0000849213 00000 n 0000779102 00000 n 0000135061 00000 n 0000137865 00000 n 0000849300 00000 n 0000849335 00000 n 0000779276 00000 n 0000137887 00000 n 0000144111 00000 n 0000849422 00000 n 0000849457 00000 n 0000779450 00000 n 0000144133 00000 n 0000149273 00000 n 0000849518 00000 n 0000849553 00000 n 0000779616 00000 n 0000149295 00000 n 0000154254 00000 n 0000849627 00000 n 0000849662 00000 n 0000779790 00000 n 0000154276 00000 n 0000157916 00000 n 0000849749 00000 n 0000849784 00000 n 0000779964 00000 n 0000157938 00000 n 0000162582 00000 n 0000849858 00000 n 0000849893 00000 n 0000780138 00000 n 0000162604 00000 n 0000167144 00000 n 0000849980 00000 n 0000850015 00000 n 0000780312 00000 n 0000167166 00000 n 0000171665 00000 n 0000850102 00000 n 0000850137 00000 n 0000780486 00000 n 0000171687 00000 n 0000176258 00000 n 0000850211 00000 n 0000850246 00000 n 0000780660 00000 n 0000176280 00000 n 0000179666 00000 n 0000850333 00000 n 0000850368 00000 n 0000780826 00000 n 0000179688 00000 n 0000182931 00000 n 0000850442 00000 n 0000850477 00000 n 0000780992 00000 n 0000182953 00000 n 0000188226 00000 n 0000850551 00000 n 0000850586 00000 n 0000781166 00000 n 0000188248 00000 n 0000191692 00000 n 0000850673 00000 n 0000850708 00000 n 0000781332 00000 n 0000191714 00000 n 0000195667 00000 n 0000850782 00000 n 0000850817 00000 n 0000781506 00000 n 0000195689 00000 n 0000199668 00000 n 0000850891 00000 n 0000850926 00000 n 0000781672 00000 n 0000199690 00000 n 0000205808 00000 n 0000851000 00000 n 0000851035 00000 n 0000781846 00000 n 0000205830 00000 n 0000212215 00000 n 0000851109 00000 n 0000851144 00000 n 0000782012 00000 n 0000212237 00000 n 0000216890 00000 n 0000851192 00000 n 0000851227 00000 n 0000782186 00000 n 0000216912 00000 n 0000221613 00000 n 0000851288 00000 n 0000851323 00000 n 0000782360 00000 n 0000221635 00000 n 0000224920 00000 n 0000851384 00000 n 0000851419 00000 n 0000782526 00000 n 0000224942 00000 n 0000229358 00000 n 0000851480 00000 n 0000851515 00000 n 0000782700 00000 n 0000229380 00000 n 0000233592 00000 n 0000851602 00000 n 0000851637 00000 n 0000782874 00000 n 0000233614 00000 n 0000238590 00000 n 0000851724 00000 n 0000851759 00000 n 0000783048 00000 n 0000238612 00000 n 0000242114 00000 n 0000851820 00000 n 0000851855 00000 n 0000783222 00000 n 0000242136 00000 n 0000245922 00000 n 0000851942 00000 n 0000851977 00000 n 0000783396 00000 n 0000245944 00000 n 0000250131 00000 n 0000852051 00000 n 0000852086 00000 n 0000783562 00000 n 0000250153 00000 n 0000255363 00000 n 0000852173 00000 n 0000852208 00000 n 0000783728 00000 n 0000255385 00000 n 0000259750 00000 n 0000852282 00000 n 0000852317 00000 n 0000783902 00000 n 0000259772 00000 n 0000264236 00000 n 0000852404 00000 n 0000852439 00000 n 0000784076 00000 n 0000264258 00000 n 0000269021 00000 n 0000852513 00000 n 0000852548 00000 n 0000784250 00000 n 0000269043 00000 n 0000273100 00000 n 0000852635 00000 n 0000852670 00000 n 0000784416 00000 n 0000273122 00000 n 0000276227 00000 n 0000852744 00000 n 0000852779 00000 n 0000784582 00000 n 0000276249 00000 n 0000280751 00000 n 0000852853 00000 n 0000852888 00000 n 0000784748 00000 n 0000280773 00000 n 0000284928 00000 n 0000852975 00000 n 0000853010 00000 n 0000784922 00000 n 0000284950 00000 n 0000288616 00000 n 0000853097 00000 n 0000853132 00000 n 0000785088 00000 n 0000288638 00000 n 0000292955 00000 n 0000853219 00000 n 0000853254 00000 n 0000785262 00000 n 0000292977 00000 n 0000296988 00000 n 0000853328 00000 n 0000853363 00000 n 0000785428 00000 n 0000297010 00000 n 0000300311 00000 n 0000853437 00000 n 0000853472 00000 n 0000785594 00000 n 0000300333 00000 n 0000304624 00000 n 0000853546 00000 n 0000853581 00000 n 0000785760 00000 n 0000304646 00000 n 0000309431 00000 n 0000853655 00000 n 0000853690 00000 n 0000785934 00000 n 0000309453 00000 n 0000313446 00000 n 0000853764 00000 n 0000853799 00000 n 0000786100 00000 n 0000313468 00000 n 0000317731 00000 n 0000853873 00000 n 0000853908 00000 n 0000786274 00000 n 0000317753 00000 n 0000320266 00000 n 0000853969 00000 n 0000854004 00000 n 0000786440 00000 n 0000320288 00000 n 0000324748 00000 n 0000854078 00000 n 0000854113 00000 n 0000786606 00000 n 0000324770 00000 n 0000326297 00000 n 0000854187 00000 n 0000854222 00000 n 0000786780 00000 n 0000326319 00000 n 0000330426 00000 n 0000854296 00000 n 0000854331 00000 n 0000786954 00000 n 0000330448 00000 n 0000335038 00000 n 0000854392 00000 n 0000854427 00000 n 0000787120 00000 n 0000335060 00000 n 0000339931 00000 n 0000854514 00000 n 0000854549 00000 n 0000787286 00000 n 0000339953 00000 n 0000344673 00000 n 0000854610 00000 n 0000854645 00000 n 0000787452 00000 n 0000344695 00000 n 0000350100 00000 n 0000854732 00000 n 0000854767 00000 n 0000787626 00000 n 0000350122 00000 n 0000355200 00000 n 0000854841 00000 n 0000854876 00000 n 0000787792 00000 n 0000355222 00000 n 0000357028 00000 n 0000854963 00000 n 0000854998 00000 n 0000787958 00000 n 0000357050 00000 n 0000357368 00000 n 0000855072 00000 n 0000855107 00000 n 0000788124 00000 n 0000357389 00000 n 0000361665 00000 n 0000855155 00000 n 0000855190 00000 n 0000788298 00000 n 0000361687 00000 n 0000366908 00000 n 0000855264 00000 n 0000855299 00000 n 0000788472 00000 n 0000366930 00000 n 0000370703 00000 n 0000855386 00000 n 0000855421 00000 n 0000788646 00000 n 0000370725 00000 n 0000371395 00000 n 0000855495 00000 n 0000855530 00000 n 0000788812 00000 n 0000371416 00000 n 0000376021 00000 n 0000944559 00000 n 0000976079 00000 n 0000855591 00000 n 0000855626 00000 n 0000788986 00000 n 0000376043 00000 n 0000381357 00000 n 0000855687 00000 n 0000855722 00000 n 0000789160 00000 n 0000381379 00000 n 0000386535 00000 n 0000855809 00000 n 0000855844 00000 n 0000789334 00000 n 0000386557 00000 n 0000390689 00000 n 0000855918 00000 n 0000855953 00000 n 0000789500 00000 n 0000390711 00000 n 0000394757 00000 n 0000856040 00000 n 0000856075 00000 n 0000789674 00000 n 0000394779 00000 n 0000396440 00000 n 0000856149 00000 n 0000856184 00000 n 0000789848 00000 n 0000396462 00000 n 0000400676 00000 n 0000856258 00000 n 0000856293 00000 n 0000790022 00000 n 0000400698 00000 n 0000405661 00000 n 0000856354 00000 n 0000856389 00000 n 0000790196 00000 n 0000405683 00000 n 0000410190 00000 n 0000856463 00000 n 0000856498 00000 n 0000790370 00000 n 0000410212 00000 n 0000415058 00000 n 0000856585 00000 n 0000856620 00000 n 0000790544 00000 n 0000415080 00000 n 0000418862 00000 n 0000856694 00000 n 0000856729 00000 n 0000790718 00000 n 0000418884 00000 n 0000423458 00000 n 0000856816 00000 n 0000856851 00000 n 0000790892 00000 n 0000423480 00000 n 0000428277 00000 n 0000856938 00000 n 0000856973 00000 n 0000791066 00000 n 0000428299 00000 n 0000432573 00000 n 0000857047 00000 n 0000857082 00000 n 0000791240 00000 n 0000432595 00000 n 0000437033 00000 n 0000857169 00000 n 0000857204 00000 n 0000791414 00000 n 0000437055 00000 n 0000440160 00000 n 0000857278 00000 n 0000857313 00000 n 0000791588 00000 n 0000440182 00000 n 0000444539 00000 n 0000857400 00000 n 0000857435 00000 n 0000791762 00000 n 0000444561 00000 n 0000448525 00000 n 0000857509 00000 n 0000857544 00000 n 0000791936 00000 n 0000448547 00000 n 0000451937 00000 n 0000857631 00000 n 0000857666 00000 n 0000792102 00000 n 0000451959 00000 n 0000455504 00000 n 0000857753 00000 n 0000857788 00000 n 0000792276 00000 n 0000455526 00000 n 0000459440 00000 n 0000857862 00000 n 0000857897 00000 n 0000792442 00000 n 0000459462 00000 n 0000462939 00000 n 0000857984 00000 n 0000858019 00000 n 0000792608 00000 n 0000462961 00000 n 0000467245 00000 n 0000858106 00000 n 0000858141 00000 n 0000792774 00000 n 0000467267 00000 n 0000473589 00000 n 0000858228 00000 n 0000858263 00000 n 0000792948 00000 n 0000473611 00000 n 0000477242 00000 n 0000858337 00000 n 0000858372 00000 n 0000793122 00000 n 0000477264 00000 n 0000479695 00000 n 0000858446 00000 n 0000858481 00000 n 0000793288 00000 n 0000479717 00000 n 0000483322 00000 n 0000858555 00000 n 0000858590 00000 n 0000793454 00000 n 0000483344 00000 n 0000487323 00000 n 0000858677 00000 n 0000858712 00000 n 0000793620 00000 n 0000487345 00000 n 0000490780 00000 n 0000858786 00000 n 0000858821 00000 n 0000793786 00000 n 0000490802 00000 n 0000496063 00000 n 0000858908 00000 n 0000858943 00000 n 0000793960 00000 n 0000496085 00000 n 0000500208 00000 n 0000859030 00000 n 0000859065 00000 n 0000794134 00000 n 0000500230 00000 n 0000505024 00000 n 0000859139 00000 n 0000859174 00000 n 0000794300 00000 n 0000505046 00000 n 0000508399 00000 n 0000859248 00000 n 0000859283 00000 n 0000794474 00000 n 0000508421 00000 n 0000508764 00000 n 0000859357 00000 n 0000859392 00000 n 0000794640 00000 n 0000508785 00000 n 0000512394 00000 n 0000859440 00000 n 0000859475 00000 n 0000794806 00000 n 0000512416 00000 n 0000517519 00000 n 0000859536 00000 n 0000859571 00000 n 0000794972 00000 n 0000517541 00000 n 0000522260 00000 n 0000859645 00000 n 0000859680 00000 n 0000795138 00000 n 0000522282 00000 n 0000526295 00000 n 0000859754 00000 n 0000859789 00000 n 0000795304 00000 n 0000526317 00000 n 0000531220 00000 n 0000859863 00000 n 0000859898 00000 n 0000795478 00000 n 0000531242 00000 n 0000536270 00000 n 0000859972 00000 n 0000860007 00000 n 0000795644 00000 n 0000536292 00000 n 0000540862 00000 n 0000860081 00000 n 0000860116 00000 n 0000795818 00000 n 0000540884 00000 n 0000543805 00000 n 0000860190 00000 n 0000860225 00000 n 0000795984 00000 n 0000543827 00000 n 0000548821 00000 n 0000860286 00000 n 0000860321 00000 n 0000796158 00000 n 0000548843 00000 n 0000554051 00000 n 0000860395 00000 n 0000860430 00000 n 0000796324 00000 n 0000554073 00000 n 0000559561 00000 n 0000860491 00000 n 0000860526 00000 n 0000796490 00000 n 0000559583 00000 n 0000564373 00000 n 0000860600 00000 n 0000860635 00000 n 0000796656 00000 n 0000564395 00000 n 0000569305 00000 n 0000860709 00000 n 0000860744 00000 n 0000796830 00000 n 0000569327 00000 n 0000574840 00000 n 0000860818 00000 n 0000860853 00000 n 0000796996 00000 n 0000574862 00000 n 0000579139 00000 n 0000860914 00000 n 0000860950 00000 n 0000797165 00000 n 0000579162 00000 n 0000583623 00000 n 0000861025 00000 n 0000861061 00000 n 0000797335 00000 n 0000583646 00000 n 0000588567 00000 n 0000861136 00000 n 0000861172 00000 n 0000797505 00000 n 0000588590 00000 n 0000593734 00000 n 0000861260 00000 n 0000861296 00000 n 0000797675 00000 n 0000593757 00000 n 0000598563 00000 n 0000861371 00000 n 0000861407 00000 n 0000797845 00000 n 0000598586 00000 n 0000602481 00000 n 0000861495 00000 n 0000861531 00000 n 0000798015 00000 n 0000602504 00000 n 0000607886 00000 n 0000861606 00000 n 0000861642 00000 n 0000798185 00000 n 0000607909 00000 n 0000613161 00000 n 0000861730 00000 n 0000861766 00000 n 0000798355 00000 n 0000613184 00000 n 0000617468 00000 n 0000861828 00000 n 0000861864 00000 n 0000798533 00000 n 0000617491 00000 n 0000621425 00000 n 0000861939 00000 n 0000861975 00000 n 0000798703 00000 n 0000621448 00000 n 0000627044 00000 n 0000862063 00000 n 0000862099 00000 n 0000798873 00000 n 0000627067 00000 n 0000632166 00000 n 0000862174 00000 n 0000862210 00000 n 0000799043 00000 n 0000632189 00000 n 0000637824 00000 n 0000862285 00000 n 0000862321 00000 n 0000799213 00000 n 0000637847 00000 n 0000642917 00000 n 0000862396 00000 n 0000862432 00000 n 0000799383 00000 n 0000642940 00000 n 0000646121 00000 n 0000862494 00000 n 0000862530 00000 n 0000799553 00000 n 0000646144 00000 n 0000650192 00000 n 0000862605 00000 n 0000862641 00000 n 0000799723 00000 n 0000650215 00000 n 0000654781 00000 n 0000862716 00000 n 0000862752 00000 n 0000799893 00000 n 0000654804 00000 n 0000658350 00000 n 0000862814 00000 n 0000862850 00000 n 0000800063 00000 n 0000658373 00000 n 0000662487 00000 n 0000862912 00000 n 0000862948 00000 n 0000800241 00000 n 0000662510 00000 n 0000667117 00000 n 0000863010 00000 n 0000863046 00000 n 0000800411 00000 n 0000667140 00000 n 0000670692 00000 n 0000863121 00000 n 0000863157 00000 n 0000800581 00000 n 0000670715 00000 n 0000673851 00000 n 0000863232 00000 n 0000863268 00000 n 0000800759 00000 n 0000673874 00000 n 0000676255 00000 n 0000863343 00000 n 0000863379 00000 n 0000800929 00000 n 0000676278 00000 n 0000676561 00000 n 0000863441 00000 n 0000863477 00000 n 0000801099 00000 n 0000676583 00000 n 0000680825 00000 n 0000863526 00000 n 0000863562 00000 n 0000801277 00000 n 0000680848 00000 n 0000685492 00000 n 0000863611 00000 n 0000863647 00000 n 0000801455 00000 n 0000685515 00000 n 0000690889 00000 n 0000863709 00000 n 0000863745 00000 n 0000801633 00000 n 0000690912 00000 n 0000696494 00000 n 0000863820 00000 n 0000863856 00000 n 0000801811 00000 n 0000696517 00000 n 0000698037 00000 n 0000863931 00000 n 0000863967 00000 n 0000801981 00000 n 0000698060 00000 n 0000698362 00000 n 0000864016 00000 n 0000864052 00000 n 0000802151 00000 n 0000698384 00000 n 0000702802 00000 n 0000864101 00000 n 0000864137 00000 n 0000802321 00000 n 0000702825 00000 n 0000708423 00000 n 0000864186 00000 n 0000864222 00000 n 0000802499 00000 n 0000708446 00000 n 0000714437 00000 n 0000864297 00000 n 0000864333 00000 n 0000802677 00000 n 0000714460 00000 n 0000720787 00000 n 0000864395 00000 n 0000864431 00000 n 0000802855 00000 n 0000720810 00000 n 0000723293 00000 n 0000864480 00000 n 0000864516 00000 n 0000803033 00000 n 0000723316 00000 n 0000723616 00000 n 0000864565 00000 n 0000864601 00000 n 0000803203 00000 n 0000723638 00000 n 0000728280 00000 n 0000864650 00000 n 0000864787 00000 n 0000864929 00000 n 0000865071 00000 n 0000865213 00000 n 0000865355 00000 n 0000865497 00000 n 0000865639 00000 n 0000865776 00000 n 0000865918 00000 n 0000866055 00000 n 0000866192 00000 n 0000866329 00000 n 0000866466 00000 n 0000866608 00000 n 0000866750 00000 n 0000866892 00000 n 0000867027 00000 n 0000867164 00000 n 0000867306 00000 n 0000867448 00000 n 0000867585 00000 n 0000867722 00000 n 0000867859 00000 n 0000867996 00000 n 0000868133 00000 n 0000868270 00000 n 0000868407 00000 n 0000868549 00000 n 0000868686 00000 n 0000868828 00000 n 0000868970 00000 n 0000869107 00000 n 0000869244 00000 n 0000869381 00000 n 0000869518 00000 n 0000869655 00000 n 0000869797 00000 n 0000869939 00000 n 0000870081 00000 n 0000870223 00000 n 0000870365 00000 n 0000870507 00000 n 0000870649 00000 n 0000870786 00000 n 0000870923 00000 n 0000871065 00000 n 0000871207 00000 n 0000871349 00000 n 0000871491 00000 n 0000871633 00000 n 0000871775 00000 n 0000871917 00000 n 0000872059 00000 n 0000872196 00000 n 0000872333 00000 n 0000872475 00000 n 0000872617 00000 n 0000872759 00000 n 0000872901 00000 n 0000873043 00000 n 0000873185 00000 n 0000873327 00000 n 0000873469 00000 n 0000873611 00000 n 0000873753 00000 n 0000873895 00000 n 0000874037 00000 n 0000874179 00000 n 0000874321 00000 n 0000874458 00000 n 0000874600 00000 n 0000874737 00000 n 0000874879 00000 n 0000875021 00000 n 0000875158 00000 n 0000875295 00000 n 0000875432 00000 n 0000875569 00000 n 0000875706 00000 n 0000875843 00000 n 0000875980 00000 n 0000876117 00000 n 0000876254 00000 n 0000876396 00000 n 0000876538 00000 n 0000876680 00000 n 0000876822 00000 n 0000876964 00000 n 0000877101 00000 n 0000877243 00000 n 0000877380 00000 n 0000877517 00000 n 0000877654 00000 n 0000877796 00000 n 0000877938 00000 n 0000878080 00000 n 0000878222 00000 n 0000878359 00000 n 0000878395 00000 n 0000804271 00000 n 0000728303 00000 n 0000734888 00000 n 0000878444 00000 n 0000878586 00000 n 0000878728 00000 n 0000878870 00000 n 0000879005 00000 n 0000879147 00000 n 0000879284 00000 n 0000879421 00000 n 0000879563 00000 n 0000879705 00000 n 0000879842 00000 n 0000879979 00000 n 0000880121 00000 n 0000880263 00000 n 0000880405 00000 n 0000880547 00000 n 0000880689 00000 n 0000880826 00000 n 0000880968 00000 n 0000881110 00000 n 0000881252 00000 n 0000881394 00000 n 0000881531 00000 n 0000881673 00000 n 0000881815 00000 n 0000881957 00000 n 0000882099 00000 n 0000882241 00000 n 0000882383 00000 n 0000882525 00000 n 0000882662 00000 n 0000882799 00000 n 0000882936 00000 n 0000883078 00000 n 0000883215 00000 n 0000883352 00000 n 0000883489 00000 n 0000883626 00000 n 0000883763 00000 n 0000883900 00000 n 0000884037 00000 n 0000884174 00000 n 0000884316 00000 n 0000884458 00000 n 0000884600 00000 n 0000884742 00000 n 0000884884 00000 n 0000885026 00000 n 0000885168 00000 n 0000885310 00000 n 0000885447 00000 n 0000885584 00000 n 0000885721 00000 n 0000885863 00000 n 0000886005 00000 n 0000886147 00000 n 0000886289 00000 n 0000886431 00000 n 0000886573 00000 n 0000886715 00000 n 0000886857 00000 n 0000886999 00000 n 0000887141 00000 n 0000887278 00000 n 0000887415 00000 n 0000887552 00000 n 0000887689 00000 n 0000887826 00000 n 0000887963 00000 n 0000888105 00000 n 0000888242 00000 n 0000888379 00000 n 0000888521 00000 n 0000888663 00000 n 0000888805 00000 n 0000888947 00000 n 0000889089 00000 n 0000889231 00000 n 0000889373 00000 n 0000889515 00000 n 0000889652 00000 n 0000889789 00000 n 0000889931 00000 n 0000890073 00000 n 0000890215 00000 n 0000890352 00000 n 0000890489 00000 n 0000890631 00000 n 0000890768 00000 n 0000890910 00000 n 0000891047 00000 n 0000891189 00000 n 0000891331 00000 n 0000891466 00000 n 0000891608 00000 n 0000891745 00000 n 0000891882 00000 n 0000892024 00000 n 0000892161 00000 n 0000892298 00000 n 0000892440 00000 n 0000892582 00000 n 0000892724 00000 n 0000892861 00000 n 0000892998 00000 n 0000893135 00000 n 0000893272 00000 n 0000893414 00000 n 0000893551 00000 n 0000893688 00000 n 0000893825 00000 n 0000893962 00000 n 0000894104 00000 n 0000894241 00000 n 0000894383 00000 n 0000894525 00000 n 0000894667 00000 n 0000894809 00000 n 0000894951 00000 n 0000895093 00000 n 0000895235 00000 n 0000895377 00000 n 0000895519 00000 n 0000895656 00000 n 0000895798 00000 n 0000895940 00000 n 0000896082 00000 n 0000896224 00000 n 0000896366 00000 n 0000896508 00000 n 0000896650 00000 n 0000896792 00000 n 0000896929 00000 n 0000897071 00000 n 0000897213 00000 n 0000897350 00000 n 0000897487 00000 n 0000897624 00000 n 0000897761 00000 n 0000897903 00000 n 0000898045 00000 n 0000898187 00000 n 0000898329 00000 n 0000898471 00000 n 0000898613 00000 n 0000898755 00000 n 0000898897 00000 n 0000899039 00000 n 0000899075 00000 n 0000805780 00000 n 0000734911 00000 n 0000736712 00000 n 0000899124 00000 n 0000899266 00000 n 0000899408 00000 n 0000899550 00000 n 0000899687 00000 n 0000899829 00000 n 0000899966 00000 n 0000900108 00000 n 0000900250 00000 n 0000900387 00000 n 0000900524 00000 n 0000900666 00000 n 0000900803 00000 n 0000900940 00000 n 0000901077 00000 n 0000901219 00000 n 0000901356 00000 n 0000901493 00000 n 0000901635 00000 n 0000901777 00000 n 0000901919 00000 n 0000902061 00000 n 0000902203 00000 n 0000902345 00000 n 0000902487 00000 n 0000902629 00000 n 0000902771 00000 n 0000902913 00000 n 0000903050 00000 n 0000903192 00000 n 0000903329 00000 n 0000903466 00000 n 0000903608 00000 n 0000903745 00000 n 0000903882 00000 n 0000904024 00000 n 0000904166 00000 n 0000904308 00000 n 0000904344 00000 n 0000806299 00000 n 0000736735 00000 n 0000740381 00000 n 0000904380 00000 n 0000904522 00000 n 0000904664 00000 n 0000904806 00000 n 0000904948 00000 n 0000905090 00000 n 0000905227 00000 n 0000905369 00000 n 0000905511 00000 n 0000905648 00000 n 0000905785 00000 n 0000905922 00000 n 0000906064 00000 n 0000906201 00000 n 0000906338 00000 n 0000906475 00000 n 0000906612 00000 n 0000906754 00000 n 0000906896 00000 n 0000907033 00000 n 0000907170 00000 n 0000907312 00000 n 0000907454 00000 n 0000907596 00000 n 0000907733 00000 n 0000907870 00000 n 0000908012 00000 n 0000908149 00000 n 0000908286 00000 n 0000908423 00000 n 0000908565 00000 n 0000908707 00000 n 0000908849 00000 n 0000908991 00000 n 0000909133 00000 n 0000909275 00000 n 0000909417 00000 n 0000909559 00000 n 0000909701 00000 n 0000909838 00000 n 0000909980 00000 n 0000910122 00000 n 0000910264 00000 n 0000910406 00000 n 0000910548 00000 n 0000910685 00000 n 0000910822 00000 n 0000910964 00000 n 0000911106 00000 n 0000911248 00000 n 0000911390 00000 n 0000911532 00000 n 0000911669 00000 n 0000911806 00000 n 0000911948 00000 n 0000912090 00000 n 0000912232 00000 n 0000912374 00000 n 0000912516 00000 n 0000912658 00000 n 0000912800 00000 n 0000912942 00000 n 0000913084 00000 n 0000913226 00000 n 0000913368 00000 n 0000913510 00000 n 0000913652 00000 n 0000913794 00000 n 0000913936 00000 n 0000914073 00000 n 0000914210 00000 n 0000914347 00000 n 0000914484 00000 n 0000914626 00000 n 0000914763 00000 n 0000914900 00000 n 0000915042 00000 n 0000915184 00000 n 0000915326 00000 n 0000915468 00000 n 0000915605 00000 n 0000915742 00000 n 0000915879 00000 n 0000916016 00000 n 0000916153 00000 n 0000916290 00000 n 0000916432 00000 n 0000916574 00000 n 0000916716 00000 n 0000916858 00000 n 0000917000 00000 n 0000917142 00000 n 0000917284 00000 n 0000917426 00000 n 0000917568 00000 n 0000917710 00000 n 0000917847 00000 n 0000917984 00000 n 0000918121 00000 n 0000918258 00000 n 0000918395 00000 n 0000918532 00000 n 0000918674 00000 n 0000918816 00000 n 0000918958 00000 n 0000919095 00000 n 0000919232 00000 n 0000919369 00000 n 0000919506 00000 n 0000919643 00000 n 0000919780 00000 n 0000919922 00000 n 0000920064 00000 n 0000920206 00000 n 0000920343 00000 n 0000920485 00000 n 0000920627 00000 n 0000920769 00000 n 0000920911 00000 n 0000921048 00000 n 0000921185 00000 n 0000921327 00000 n 0000921464 00000 n 0000921606 00000 n 0000921743 00000 n 0000921885 00000 n 0000922022 00000 n 0000922159 00000 n 0000922296 00000 n 0000922433 00000 n 0000922575 00000 n 0000922717 00000 n 0000922854 00000 n 0000922991 00000 n 0000923133 00000 n 0000923270 00000 n 0000923407 00000 n 0000923544 00000 n 0000923681 00000 n 0000923823 00000 n 0000923965 00000 n 0000924102 00000 n 0000924244 00000 n 0000924386 00000 n 0000924528 00000 n 0000924670 00000 n 0000924807 00000 n 0000924949 00000 n 0000925091 00000 n 0000925233 00000 n 0000925375 00000 n 0000925512 00000 n 0000925654 00000 n 0000925791 00000 n 0000925933 00000 n 0000926075 00000 n 0000926212 00000 n 0000926349 00000 n 0000926491 00000 n 0000926633 00000 n 0000926770 00000 n 0000926912 00000 n 0000927054 00000 n 0000927196 00000 n 0000927338 00000 n 0000927480 00000 n 0000927622 00000 n 0000927764 00000 n 0000927901 00000 n 0000928043 00000 n 0000928180 00000 n 0000928322 00000 n 0000928464 00000 n 0000928606 00000 n 0000928748 00000 n 0000928885 00000 n 0000929022 00000 n 0000929159 00000 n 0000929301 00000 n 0000929443 00000 n 0000929585 00000 n 0000929727 00000 n 0000929869 00000 n 0000930011 00000 n 0000930153 00000 n 0000930295 00000 n 0000930437 00000 n 0000930579 00000 n 0000930716 00000 n 0000930853 00000 n 0000930995 00000 n 0000931137 00000 n 0000931279 00000 n 0000931421 00000 n 0000931563 00000 n 0000931705 00000 n 0000931847 00000 n 0000931989 00000 n 0000932131 00000 n 0000932273 00000 n 0000932415 00000 n 0000932557 00000 n 0000932699 00000 n 0000932841 00000 n 0000932978 00000 n 0000933120 00000 n 0000933257 00000 n 0000933394 00000 n 0000933531 00000 n 0000933668 00000 n 0000933805 00000 n 0000933942 00000 n 0000934079 00000 n 0000934216 00000 n 0000934353 00000 n 0000934495 00000 n 0000934637 00000 n 0000934774 00000 n 0000934911 00000 n 0000935048 00000 n 0000935190 00000 n 0000935332 00000 n 0000935474 00000 n 0000935616 00000 n 0000935758 00000 n 0000935895 00000 n 0000936037 00000 n 0000936174 00000 n 0000936311 00000 n 0000936453 00000 n 0000936595 00000 n 0000936737 00000 n 0000936879 00000 n 0000937021 00000 n 0000937158 00000 n 0000937300 00000 n 0000937442 00000 n 0000937584 00000 n 0000937721 00000 n 0000937863 00000 n 0000938005 00000 n 0000938147 00000 n 0000938284 00000 n 0000938320 00000 n 0000808663 00000 n 0000740404 00000 n 0000740964 00000 n 0000938382 00000 n 0000938519 00000 n 0000938661 00000 n 0000938803 00000 n 0000938940 00000 n 0000939082 00000 n 0000939224 00000 n 0000939366 00000 n 0000939508 00000 n 0000939650 00000 n 0000939792 00000 n 0000939934 00000 n 0000940071 00000 n 0000940213 00000 n 0000940355 00000 n 0000940497 00000 n 0000940634 00000 n 0000940771 00000 n 0000940908 00000 n 0000940944 00000 n 0000809011 00000 n 0000740986 00000 n 0000741273 00000 n 0000940980 00000 n 0000941016 00000 n 0000809181 00000 n 0000741295 00000 n 0000744269 00000 n 0000941065 00000 n 0000941101 00000 n 0000809351 00000 n 0000744292 00000 n 0000748137 00000 n 0000941163 00000 n 0000941199 00000 n 0000809521 00000 n 0000748160 00000 n 0000751768 00000 n 0000941261 00000 n 0000941297 00000 n 0000809691 00000 n 0000751791 00000 n 0000755192 00000 n 0000941346 00000 n 0000941382 00000 n 0000809861 00000 n 0000755215 00000 n 0000758842 00000 n 0000941444 00000 n 0000941480 00000 n 0000810031 00000 n 0000758865 00000 n 0000760854 00000 n 0000941529 00000 n 0000941565 00000 n 0000810201 00000 n 0000760877 00000 n 0000763476 00000 n 0000941627 00000 n 0000941663 00000 n 0000810371 00000 n 0000763499 00000 n 0000766161 00000 n 0000941725 00000 n 0000941761 00000 n 0000810541 00000 n 0000766184 00000 n 0000768715 00000 n 0000941823 00000 n 0000941859 00000 n 0000810711 00000 n 0000768738 00000 n 0000771407 00000 n 0000941908 00000 n 0000941944 00000 n 0000946622 00000 n 0000951505 00000 n 0000957628 00000 n 0000967398 00000 n 0000969956 00000 n 0000976346 00000 n 0000979227 00000 n 0000979882 00000 n 0000981246 00000 n 0000942800 00000 n 0000943443 00000 n 0000944456 00000 n 0000944966 00000 n 0000945548 00000 n 0000946192 00000 n 0001004976 00000 n trailer << /Size 1817 /Root 1 0 R /Info 2 0 R /ID [<32AA9321C995E4FE1CBA7DB7C802DA80><32AA9321C995E4FE1CBA7DB7C802DA80>] >> startxref 1006818 %%EOF cfitsio-3.47/docs/cfitsio.ps0000644000225700000360000521100213464573431015344 0ustar cagordonlhea%!PS-Adobe-2.0 %%Creator: dvips(k) 5.993 Copyright 2013 Radical Eye Software %%Title: cfitsio.dvi %%CreationDate: Wed May 8 10:27:03 2019 %%Pages: 196 %%PageOrder: Ascend %%BoundingBox: 0 0 612 792 %%DocumentFonts: CMBX12 CMR12 CMR10 CMBX10 CMSL10 CMTT10 CMSY10 CMMI10 %%+ CMTI10 %%DocumentPaperSizes: Letter %%EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSCommandLine: dvips -o cfitsio.ps cfitsio.dvi %DVIPSParameters: dpi=600 %DVIPSSource: TeX output 2019.05.08:1026 %%BeginProcSet: tex.pro 0 0 %! /TeXDict 300 dict def TeXDict begin/N{def}def/B{bind def}N/S{exch}N/X{S N}B/A{dup}B/TR{translate}N/isls false N/vsize 11 72 mul N/hsize 8.5 72 mul N/landplus90{false}def/@rigin{isls{[0 landplus90{1 -1}{-1 1}ifelse 0 0 0]concat}if 72 Resolution div 72 VResolution div neg scale isls{ landplus90{VResolution 72 div vsize mul 0 exch}{Resolution -72 div hsize mul 0}ifelse TR}if Resolution VResolution vsize -72 div 1 add mul TR[ matrix currentmatrix{A A round sub abs 0.00001 lt{round}if}forall round exch round exch]setmatrix}N/@landscape{/isls true N}B/@manualfeed{ statusdict/manualfeed true put}B/@copies{/#copies X}B/FMat[1 0 0 -1 0 0] N/FBB[0 0 0 0]N/nn 0 N/IEn 0 N/ctr 0 N/df-tail{/nn 8 dict N nn begin /FontType 3 N/FontMatrix fntrx N/FontBBox FBB N string/base X array /BitMaps X/BuildChar{CharBuilder}N/Encoding IEn N end A{/foo setfont}2 array copy cvx N load 0 nn put/ctr 0 N[}B/sf 0 N/df{/sf 1 N/fntrx FMat N df-tail}B/dfs{div/sf X/fntrx[sf 0 0 sf neg 0 0]N df-tail}B/E{pop nn A definefont setfont}B/Cw{Cd A length 5 sub get}B/Ch{Cd A length 4 sub get }B/Cx{128 Cd A length 3 sub get sub}B/Cy{Cd A length 2 sub get 127 sub} B/Cdx{Cd A length 1 sub get}B/Ci{Cd A type/stringtype ne{ctr get/ctr ctr 1 add N}if}B/CharBuilder{save 3 1 roll S A/base get 2 index get S /BitMaps get S get/Cd X pop/ctr 0 N Cdx 0 Cx Cy Ch sub Cx Cw add Cy setcachedevice Cw Ch true[1 0 0 -1 -.1 Cx sub Cy .1 sub]{Ci}imagemask restore}B/D{/cc X A type/stringtype ne{]}if nn/base get cc ctr put nn /BitMaps get S ctr S sf 1 ne{A A length 1 sub A 2 index S get sf div put }if put/ctr ctr 1 add N}B/I{cc 1 add D}B/bop{userdict/bop-hook known{ bop-hook}if/SI save N @rigin 0 0 moveto/V matrix currentmatrix A 1 get A mul exch 0 get A mul add .99 lt{/QV}{/RV}ifelse load def pop pop}N/eop{ SI restore userdict/eop-hook known{eop-hook}if showpage}N/@start{ userdict/start-hook known{start-hook}if pop/VResolution X/Resolution X 1000 div/DVImag X/IEn 256 array N 2 string 0 1 255{IEn S A 360 add 36 4 index cvrs cvn put}for pop 65781.76 div/vsize X 65781.76 div/hsize X}N /dir 0 def/dyy{/dir 0 def}B/dyt{/dir 1 def}B/dty{/dir 2 def}B/dtt{/dir 3 def}B/p{dir 2 eq{-90 rotate show 90 rotate}{dir 3 eq{-90 rotate show 90 rotate}{show}ifelse}ifelse}N/RMat[1 0 0 -1 0 0]N/BDot 260 string N/Rx 0 N/Ry 0 N/V{}B/RV/v{/Ry X/Rx X V}B statusdict begin/product where{pop false[(Display)(NeXT)(LaserWriter 16/600)]{A length product length le{A length product exch 0 exch getinterval eq{pop true exit}if}{pop}ifelse} forall}{false}ifelse end{{gsave TR -.1 .1 TR 1 1 scale Rx Ry false RMat{ BDot}imagemask grestore}}{{gsave TR -.1 .1 TR Rx Ry scale 1 1 false RMat {BDot}imagemask grestore}}ifelse B/QV{gsave newpath transform round exch round exch itransform moveto Rx 0 rlineto 0 Ry neg rlineto Rx neg 0 rlineto fill grestore}B/a{moveto}B/delta 0 N/tail{A/delta X 0 rmoveto}B /M{S p delta add tail}B/b{S p tail}B/c{-4 M}B/d{-3 M}B/e{-2 M}B/f{-1 M} B/g{0 M}B/h{1 M}B/i{2 M}B/j{3 M}B/k{4 M}B/w{0 rmoveto}B/l{p -4 w}B/m{p -3 w}B/n{p -2 w}B/o{p -1 w}B/q{p 1 w}B/r{p 2 w}B/s{p 3 w}B/t{p 4 w}B/x{ 0 S rmoveto}B/y{3 2 roll p a}B/bos{/SS save N}B/eos{SS restore}B end %%EndProcSet %%BeginProcSet: texps.pro 0 0 %! TeXDict begin/rf{findfont dup length 1 add dict begin{1 index/FID ne 2 index/UniqueID ne and{def}{pop pop}ifelse}forall[1 index 0 6 -1 roll exec 0 exch 5 -1 roll VResolution Resolution div mul neg 0 0]FontType 0 ne{/Metrics exch def dict begin Encoding{exch dup type/integertype ne{ pop pop 1 sub dup 0 le{pop}{[}ifelse}{FontMatrix 0 get div Metrics 0 get div def}ifelse}forall Metrics/Metrics currentdict end def}{{1 index type /nametype eq{exit}if exch pop}loop}ifelse[2 index currentdict end definefont 3 -1 roll makefont/setfont cvx]cvx def}def/ObliqueSlant{dup sin S cos div neg}B/SlantFont{4 index mul add}def/ExtendFont{3 -1 roll mul exch}def/ReEncodeFont{CharStrings rcheck{/Encoding false def dup[ exch{dup CharStrings exch known not{pop/.notdef/Encoding true def}if} forall Encoding{]exch pop}{cleartomark}ifelse}if/Encoding exch def}def end %%EndProcSet %%BeginProcSet: special.pro 0 0 %! TeXDict begin/SDict 200 dict N SDict begin/@SpecialDefaults{/hs 612 N /vs 792 N/ho 0 N/vo 0 N/hsc 1 N/vsc 1 N/ang 0 N/CLIP 0 N/rwiSeen false N /rhiSeen false N/letter{}N/note{}N/a4{}N/legal{}N}B/@scaleunit 100 N /@hscale{@scaleunit div/hsc X}B/@vscale{@scaleunit div/vsc X}B/@hsize{ /hs X/CLIP 1 N}B/@vsize{/vs X/CLIP 1 N}B/@clip{/CLIP 2 N}B/@hoffset{/ho X}B/@voffset{/vo X}B/@angle{/ang X}B/@rwi{10 div/rwi X/rwiSeen true N}B /@rhi{10 div/rhi X/rhiSeen true N}B/@llx{/llx X}B/@lly{/lly X}B/@urx{ /urx X}B/@ury{/ury X}B/magscale true def end/@MacSetUp{userdict/md known {userdict/md get type/dicttype eq{userdict begin md length 10 add md maxlength ge{/md md dup length 20 add dict copy def}if end md begin /letter{}N/note{}N/legal{}N/od{txpose 1 0 mtx defaultmatrix dtransform S atan/pa X newpath clippath mark{transform{itransform moveto}}{transform{ itransform lineto}}{6 -2 roll transform 6 -2 roll transform 6 -2 roll transform{itransform 6 2 roll itransform 6 2 roll itransform 6 2 roll curveto}}{{closepath}}pathforall newpath counttomark array astore/gc xdf pop ct 39 0 put 10 fz 0 fs 2 F/|______Courier fnt invertflag{PaintBlack} if}N/txpose{pxs pys scale ppr aload pop por{noflips{pop S neg S TR pop 1 -1 scale}if xflip yflip and{pop S neg S TR 180 rotate 1 -1 scale ppr 3 get ppr 1 get neg sub neg ppr 2 get ppr 0 get neg sub neg TR}if xflip yflip not and{pop S neg S TR pop 180 rotate ppr 3 get ppr 1 get neg sub neg 0 TR}if yflip xflip not and{ppr 1 get neg ppr 0 get neg TR}if}{ noflips{TR pop pop 270 rotate 1 -1 scale}if xflip yflip and{TR pop pop 90 rotate 1 -1 scale ppr 3 get ppr 1 get neg sub neg ppr 2 get ppr 0 get neg sub neg TR}if xflip yflip not and{TR pop pop 90 rotate ppr 3 get ppr 1 get neg sub neg 0 TR}if yflip xflip not and{TR pop pop 270 rotate ppr 2 get ppr 0 get neg sub neg 0 S TR}if}ifelse scaleby96{ppr aload pop 4 -1 roll add 2 div 3 1 roll add 2 div 2 copy TR .96 dup scale neg S neg S TR}if}N/cp{pop pop showpage pm restore}N end}if}if}N/normalscale{ Resolution 72 div VResolution 72 div neg scale magscale{DVImag dup scale }if 0 setgray}N/psfts{S 65781.76 div N}N/startTexFig{/psf$SavedState save N userdict maxlength dict begin/magscale true def normalscale currentpoint TR/psf$ury psfts/psf$urx psfts/psf$lly psfts/psf$llx psfts /psf$y psfts/psf$x psfts currentpoint/psf$cy X/psf$cx X/psf$sx psf$x psf$urx psf$llx sub div N/psf$sy psf$y psf$ury psf$lly sub div N psf$sx psf$sy scale psf$cx psf$sx div psf$llx sub psf$cy psf$sy div psf$ury sub TR/showpage{}N/erasepage{}N/setpagedevice{pop}N/copypage{}N/p 3 def @MacSetUp}N/doclip{psf$llx psf$lly psf$urx psf$ury currentpoint 6 2 roll newpath 4 copy 4 2 roll moveto 6 -1 roll S lineto S lineto S lineto closepath clip newpath moveto}N/endTexFig{end psf$SavedState restore}N /@beginspecial{SDict begin/SpecialSave save N gsave normalscale currentpoint TR @SpecialDefaults count/ocount X/dcount countdictstack N} N/@setspecial{CLIP 1 eq{newpath 0 0 moveto hs 0 rlineto 0 vs rlineto hs neg 0 rlineto closepath clip}if ho vo TR hsc vsc scale ang rotate rwiSeen{rwi urx llx sub div rhiSeen{rhi ury lly sub div}{dup}ifelse scale llx neg lly neg TR}{rhiSeen{rhi ury lly sub div dup scale llx neg lly neg TR}if}ifelse CLIP 2 eq{newpath llx lly moveto urx lly lineto urx ury lineto llx ury lineto closepath clip}if/showpage{}N/erasepage{}N /setpagedevice{pop}N/copypage{}N newpath}N/@endspecial{count ocount sub{ pop}repeat countdictstack dcount sub{end}repeat grestore SpecialSave restore end}N/@defspecial{SDict begin}N/@fedspecial{end}B/li{lineto}B /rl{rlineto}B/rc{rcurveto}B/np{/SaveX currentpoint/SaveY X N 1 setlinecap newpath}N/st{stroke SaveX SaveY moveto}N/fil{fill SaveX SaveY moveto}N/ellipse{/endangle X/startangle X/yrad X/xrad X/savematrix matrix currentmatrix N TR xrad yrad scale 0 0 1 startangle endangle arc savematrix setmatrix}N end %%EndProcSet TeXDict begin @defspecial systemdict /pdfmark known{userdict /?pdfmark systemdict /exec get put}{userdict /?pdfmark systemdict /pop get put userdict /pdfmark systemdict /cleartomark get put}ifelse /DvipsToPDF{72.27 mul Resolution div} def/PDFToDvips{72.27 div Resolution mul} def/BPToDvips{72 div Resolution mul}def/BorderArrayPatch{[exch{dup dup type/integertype eq exch type/realtype eq or{BPToDvips}if}forall]}def/HyperBorder {1 PDFToDvips} def/H.V {pdf@hoff pdf@voff null} def/H.B {/Rect[pdf@llx pdf@lly pdf@urx pdf@ury]} def/H.S {currentpoint HyperBorder add /pdf@lly exch def dup DvipsToPDF 72 add /pdf@hoff exch def HyperBorder sub /pdf@llx exch def} def/H.L {2 sub dup/HyperBasePt exch def PDFToDvips /HyperBaseDvips exch def currentpoint HyperBaseDvips sub /pdf@ury exch def/pdf@urx exch def} def/H.A {H.L currentpoint exch pop vsize 72 sub exch DvipsToPDF HyperBasePt sub sub /pdf@voff exch def} def/H.R {currentpoint HyperBorder sub /pdf@ury exch def HyperBorder add /pdf@urx exch def currentpoint exch pop vsize 72 sub exch DvipsToPDF sub /pdf@voff exch def} def @fedspecial end %%BeginFont: CMTI10 %!PS-AdobeFont-1.0: CMTI10 003.002 %%Title: CMTI10 %Version: 003.002 %%CreationDate: Mon Jul 13 16:17:00 2009 %%Creator: David M. Jones %Copyright: Copyright (c) 1997, 2009 American Mathematical Society %Copyright: (), with Reserved Font Name CMTI10. % This Font Software is licensed under the SIL Open Font License, Version 1.1. % This license is in the accompanying file OFL.txt, and is also % available with a FAQ at: http://scripts.sil.org/OFL. %%EndComments FontDirectory/CMTI10 known{/CMTI10 findfont dup/UniqueID known{dup /UniqueID get 5000828 eq exch/FontType get 1 eq and}{pop false}ifelse {save true}{false}ifelse}{false}ifelse 11 dict begin /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0 ]readonly def /FontName /CMTI10 def /FontBBox {-35 -250 1124 750 }readonly def /UniqueID 5000828 def /PaintType 0 def /FontInfo 9 dict dup begin /version (003.002) readonly def /Notice (Copyright \050c\051 1997, 2009 American Mathematical Society \050\051, with Reserved Font Name CMTI10.) readonly def /FullName (CMTI10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle -14.04 def /isFixedPitch false def /UnderlinePosition -100 def /UnderlineThickness 50 def end readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 12 /fi put dup 68 /D put dup 72 /H put dup 85 /U put dup 97 /a put dup 98 /b put dup 101 /e put dup 103 /g put dup 105 /i put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 122 /z put readonly def currentdict end currentfile eexec D9D66F633B846AB284BCF8B0411B772DE5CE32340DC6F28AF40857E4451976E7 5182433CF9F333A38BD841C0D4E68BF9E012EB32A8FFB76B5816306B5EDF7C99 8B3A16D9B4BC056662E32C7CD0123DFAEB734C7532E64BBFBF5A60336E646716 EFB852C877F440D329172C71F1E5D59CE9473C26B8AEF7AD68EF0727B6EC2E0C 02CE8D8B07183838330C0284BD419CBDAE42B141D3D4BE492473F240CEED931D 46E9F999C5CB3235E2C6DAAA2C0169E1991BEAEA0D704BF49CEA3E98E8C2361A 4B60D020D325E4C2450F3BCF59223103D20DB6943DE1B57C5FD29DA32D34C95E 2AB2ADB3F60EEB0600C8ADE15A2380DE10AC5AAD585FBD13097B1A7E8E210D4A EE96785449E07F0C8EBC2EC5EFBFD0897DFDC15E5BFAC9584D8DE95C5AB288CD 8AD8B9BEF0B8E5F887B3B0B331542FC8184DCCB753DB6ACEEF98B85756B988DF CAF1AE0DBE7D37D5F44A2E760AAE3A5197C27B15E32275A64946C3E4D0476FD2 7FDE148C788DD2106F7C825E270588AC05B57E625AB17BDD02306F9E5FC851DC 32A5A6EDC43C770A71419B2C0C8074EF3F222C8A2097CD81A91F333A521B3A09 482A4FE1CB231CE344AD126AA284C3280AAC3AD162CF0EE241BFB4C8F20502FF 118507F5D1B5FD898571015E73E5CF2281085072E00D401F6F59761EEC3E8381 1F26F75DB66C504AB6BABA87D121B1E7040A07AA2FE01F80DBC246CC03C4B2DC C2A715980C52B7F96BC1A78FCC7F4F52EEED5F705E08FC1E5BBFCAD121FA88AA 8EBE58172C162AF409DBB0728F14923ED02A65EA24E5D52B6AD07777455A70A4 61833D3789C719BA92E901232599767E423D5AD9C807670BE0E7B5CFF8256A20 C7BF7214FFE0342809570F5966A2C43E784F35015D9040BA34FEAB6A6F089504 3A40A9E9D711A2721D3F4998371430FB3C94BFC619559B97D49627BB630F4B70 9D0A8FE4E916235335C3962F3CFDB04C4A3CF714DB5E260F4E66FFF2F27CEF2A D4AA26BBCAED23B8BDC98F8F453BA27AD7758537561E766B82DC3032E92A9EB0 125D98A22C5466AF069BF72A9BFA052A8628FEC6A6AD0B711DFFEDE3AA2D7CE8 34EA487038EF50F953B8B4471CBA6FC3C53877EC1BC94582B1123EDF44B4056A 30F49394BDE22CDAD7F01951C7013D26979277D18EFA594E8F4F2B5E615187D9 39E842EC28461B9ABA52020A127D2CB9002A673A435B13C10602EEFDBBA6BD49 9DDEAB9E68D655443A5C2492BA061C1391A51592BA8C353A6F6A0708E8860184 2B5D031D2CAB87D618E9F6F7A0BF3F66B3FD5A25BB91F7F1F5F99CFF56EFF4FF 0A35C55658001ED2E97B26C869292F6274D433A5443179DBB8EE987196306348 3F9E87C6422AFFDD30080C9AC4EE7FE5E2DCBFEE4974331F4AAE479FD8806D4D 9C2B85FC69EB0453AD827A1E767E5C484BDFBF5C8D6E2B3C96298B390F22D757 802643A79D5E29CF3AEDF0E12CFBECA4663444FC87F2027571DBA9ECF688BF28 FF0DDB3AEDBA0FB28447CB4B5D5205F40C1E7A525FD7373392EEFFD910AC82D0 98E71660A1B3227C4A2592F3E853CA4CDF64DF19A52582E167234F4036FAAAB9 5446BE102DE2BF43E82F0112C2A20F15A3F92C6571AC761665A905362C4F8BDF AC8705519C99862CD9C0D75113C4AB5FBB83C880E46B82715B5628890D9103AD A2329638B95D93C4DECDC5E6C588C9D5183EE6FC28FAF9825F02DCA567306D93 5440987A81B51EE7291107A08F201C609FEF91A8F0587E8B13D4BAF74A5A6815 DE9E4441F46AF8E1DDDFA2D611C889614040B144A5EC064DEE4638C04EAB2E37 4CA8F50FB8C4D65BB296DCCCD39F1F554CFBED96670A91F515CA10EF896874BC 8EF48C6447752C70FF5A06F928DB55586354076773BFF7E94C4C3A7A1C1F421B A9B4E3936EC26E0C19BBBFC90F021E877F54B62108F6DD1C7F6D5B8E64FC9362 E173F01BF2904B7E5A08B3543611562C2714099DE7D4FA330DB148B560A9601F 42A84452811CE213DCE782A0D7809CFD954D6BC1EBF2BA4D1B18F50FA8174C96 3E0120E266AD5DDB40B3F6798AC28CDC5C3C4BC34583528F5B5DC8A222B80B59 A3A93DC715D061EC6915E6E6E21A25425C25E8747C60F170D61047108826F96F 7830E220C108B441B6EA3198E33C49BAD8D43086E49F5A2BC7958A1A8CD011C4 49045193394696EC3DDD0BE084E8F2E9F0B9496F035C0DEC1CE11409DF566428 D50043CFF5CDD1092F6E0807E660B68163BCA738E8D98FC6EE3F713164CD204C 0BA84FFF4F33F47BC31750B448603D7ADB9AE92FA91AEBBBEC0DCD66980E6955 CEB425ED07115B24E40F53B29B9D840842EAC691B4F591F866DF27556474B485 1C6F53DD72499847109B16C7093984A6B8487D4F3870DD517945CD90E648C1BB 8A6861E540FCF9D75B984B5009B5CC760CBE297042C240DD624111670B703388 6FE6FC0E89C6B4C88F51DFF3913D0CC1FB4770C8CBEADD4B86393605C0B6C468 83CA5594754411B6FC331EF56D7CD6D247FAE42E966583C29239A8F862348D29 60B177984B6B957E733DB4D275015691D91443BBB13C2DA96097A29733CDB284 42F89C85A7A743338C9DD3BBC4EE53F695E5163E6E1ABE5791ABF100B198B9B2 1C21E2FA2FB4AFE7F9BB2D381260CDD3A2CC05BF513AA1E80ED69FA27BC5ED5A 21445BF00BC2F997B356D94AF13736C6D3B0613EB6F4CD96A685FEB672661DCA 206105EDC3CA07900676EB2FAB37F48D2E8207BDE1463894DA3C5B1488AC1EE9 D39DAF691648048F5D7A384B8927F8DA2BE3602669F71D80686E427F395134E7 7ADCC611BA91AD4B7A0237213C60CF2C905359C90795230344FC3C50A22BD44B 55B2044792509F50F5C21F53D9F9E9F063ADBED3AB99E2613B23334FE8DF70B4 6120F2EDF69F50BE793EE145B9FF9C73179DE640FC2ACEB5C6617F918CEEB762 4CD81E665B2E544864D13230B058717B207D3CC5D6647D5343DB4D0356082392 871EFFA896631A7E0D6477942B632074A9A4EF7B09D4701B1639BAAB4E03A40E 9B54A7A4F845CD63F88831EBFA4FB847847CB98F3455CB5957F2E0A0F5623645 DBB5C5564C7F8B117D6E27E65C0F3EA81AE67B4AE4B201E7C4FB0A8364FE53F5 41A7CE8F834C2C4B322809B353A5E63BBA7BF3B7DC1A85EA700BD287C2BD3FC8 2832B0BB4695FC937FF5EF06FCD87DCE6DE793C2B1EE10E6450352C17726155F 220D550B1759E15AB2C1D5968E52C8080CD280E99D3CCC0E80C2EF8BBFD96001 A226FEED7311EFB4B67F424B557A877379A15BCA54780F0CD2CCA00400B9B39D 981C6B552AFD2506D1B23618FA9AE6D8143CD7198A8482CB416CCE62B992347F 337D505A4078713BBD91E5535BD58EF0351EBDCD749CC24D4AD39F8CECD7D6C8 139756680A4C03A58B3374CEC658D30160AE4863A3938A891BB59CBE02BB451B 1BA4B2B6E68AB61DEB85F95E3C909B8B66E220B9F18280161C279F10F7093CDC 100A53D542F071CC0A5AF834DC1D18738F5DD62A5573E884E1FFD22BD810828A 1EA47F8218C15A2E97CBC609927DA3CC2B802EA4A0D7EB57627C135E3B065905 F97597D818A2C5CC6F328AD25AD11FA50F1E4FE637980B7474D6F85A521892FB 72989AABEBE02A2D0EFE88A6F67AC29F5D8DDFEDAAF465C439983C6B84389FF7 A6434462BEB7B07DBE4BBA61ACD4A60C55B5C0AAE527DE381DFECA2E6BAFDC8D 310364ECB42CAFF72BA93C067B2F02D1CA7C34AE7CDC46787A0E234C8BE8A928 7A6F3DDE0338FAD532A9886E8E3525B85DD39364AB03EC4C0DD25DC179CC1989 1BE232E387E857C78332D834679195E10F1E7B87B7966DA3B2238F53D1E13FE2 8F55ED6A92A750C7250C9B91E29796621E7E9520373214D7DA81B2875A986D33 80382AFF6DE1F829F048E57664D9C4ACE91E4684A51023943A4964AB5657D610 3A5405EFD4CFD1EBA684243E15093C9667797BB47617B66054EE02C41FFEC45C C1BAE8AD56B00D323FCB1D2744F061FA16E161988741A319B1564E04BA210996 4F9F02A3268CABE450D166A763F5284954564A1C86B76544C5F5ACDFE0D758DB 865A1CFCF9FE8CD5F9C3B2998C56468FD52DF8EE60C6935A3D221EAEC7714E3B 301371C7DDA0B03A2416238F2B47BAD3A2C5021C886DF51C695AF9C87A864B48 3BB3FE0B355EED5454B59B25A0D8A1B8CBD356C24F64D9B55E16C30C011365C9 1E0380753BA3EDC0868788D5F50B9353D0227BCEE1BE36998B2622C0759BD66B E4444250589F9CEDE766D8B940770CB6B89503E925B35C00CBEC2873D2DC4A29 0823FB7A3717B69A7DEDBAAECC067949932728E89BEECAA91DE3AF9BF070B9C0 30EEFA8C0A55C8388CAA2F0515915C98E67FA095BB98967D14B0DCAFA9622E4E 2E0EBFC768D80585ACDF28D8A5C2B6EE2FE7AAF62FFB90F569F84A0903996DF0 C1D5723366C436E4088F3E2BB9B47F9789052A71CF5C49908CDC1DDA194BFB89 14D7E3D7D4D72A150FD6FFD8303E9DE5A97A71B808B8BDF2AE466F31BF5D7A4A 44F81230BBE2B456A221E2F72A8B59F8FEA8D31F8A005A5BD93B9F49CFDC3DCC CE2B67090460F632271C7157BDC2F05BC2749FD562FC28682A616A52D1B67654 DF78B7843A9EC26A7DE2EB168F874904C2915B97534B2D4D9F74A9573A771D34 9F7BC855E8F794621BF6AD471BCC347E2DF5F620F5C209E33A4CBF1EA85AEA87 4492A77342DD33EF615FF34037D660B713C908786D9022051B825226545827A3 2AD1B05D654DB6E6D261B4E8AF0933AD1F0FCFC7201E1A7C1B4199F160C38676 21ABA2DDF1CEB655B3EC3226E0B122976EEA998F7A5241F062E54AD1DFD6ED26 47C99A439E0AE95415059179867CDD3F0FF751F3141309F40E00A6C7C28433E4 F649BCD5DAA64177580E05C495EE7BCBCC5FBF104DAF360CC2711386655B26F9 D349D887EEB32ADE595241560FD5924A1745A22E6A01DB9C285EF14596EBFF0F 03F36EB2E0A7C3864F819EF7B0855121292D49482F046A55CD7271FE03F02EA5 886864D9D8EC22A68C23089EAEFFF03DED6484D8C341861EF8B6FD3C5BDF5AC8 352DA4E13A1E30D0CB71E090E9CFB9AB2CAFD0CA7C34AE7D8E3B2EB4666834BD 9CCD1AC2108348AFEF6071796F4BB2FFA4A67ED917E76A109FA2DC2A30D744A0 9AE653A748C1D18FB52595D84E87F1C1FB6B2F32667FE203262C66627AEFFED3 92B23861E5EB238BB4EDCE09DAE1C65BAFC198CDD1B45D42CDF93E16BB82D35F 821E9E49067E966AFAB2AB52928F8DD6359984071FC37AA652FB834A09E5BD93 3AFAE161140E74C6531E413E8FBBFC42BFE8A464B71EB1D8CAA93B33D7BCC3B0 47C7EEFCD3E9FCF26FF9441DD9BDE68D77AD7251C06BBB9A2103049E8827CAF0 F26BEF33F656A690235DEEC623CC519AFA82DE2AE16FB99F780FD7D8290DA40B 9B604AEF36B529FD184239E7D50561A07428D28E51B55546590A1AEAD4B7F2B1 AB8C5B9022C1FA03E33F8F409B24911AB8BFCF6EF4A8E415263C789F89063E71 C0910DC20347469380B7FC1EEB87D4CED7F4A361E58B61C91AFCABA35C03F978 B9FB5257C31657EE48504C355CE893FE3C553274C641DBC4004F5D5B879CC5ED D3F21F867F6DF054127067DE86189F0B59A1B90FDABCDFEE61423609D888EEFD F4A1367129962110C651D9481CEDDB8C5C2576A59AED64E95F7ED042AEAE2F7E 81AC0C408E593DC30DCAC334EDE9EE27D932B98F040DDCD195D6155607DD2038 970EB78221A94C52BD4F0EAC65F1FC10E5DAA93C17266F351669CAE56F42B68C 6D01E1EA03AE554D63CE76D800FDD9CFD89F80A241EAEFF7EDFA41794EA25CE7 97BD5028464D2CD45B53834B4AEF8BF0B9E7C6ECDEACEC887E8790A47A93F668 A9095E5FA1116A122C0E5B74E2226C654D3187C6CFD8807917820423DA3EC1DE AA020EEEF2280C44A15209EE2F3FC1776875308CEAD38571E7BF889F287E4594 971A83605E0B4169D4A23EE790515223DF8724054EDAD905F57918FC0BC64F96 514B4BF7DC9BA79E763C22C977FB6146B10D26FEA1BAA7BAF21312F78D1625A7 8E242D743471DB5821408AB786E4A7EA9D35E30E85533C617689F95758FB2C7C 392E759C299DCCE36689686DE0C4DCE32649493650BA194A6208C5EAB670B170 3F2C70BF0EF0E3BE2FB0A79224FF4ECECD6BB3388C6D06867A0E5E3DB93C1B2F 464C23E44D3132E7D4086E3B59B1D13F49EB4772DEDF8EDC4F603217233FB7BE C13C28648E9AA51D53F11FB896839F97AEDD8834BCA53CB0021AE91FD8E95E2E F8A094093AF556B9639F508A401542B06821FF9DE1A745FE9AC5CACD5E8E1053 911442FC15CA5333751ABFE2C617D38FA1DC332BFEF44AE569DC631C93EC54D6 261583A695F5A392867A57F59B741EFCD2DCFECBC55D1EA5F2317601C9DFE9ED D1EA466210FFA905A8F85BD58B98991BEA58DFD1CDED5C9B086D42CCE632DADA 147941917B879139E016B0DDEB8446BA017FC8EE5A354533D667B0835F5D027D C2D580C16B80B3D05CC92C0465CAE077729F0A15B2DAFC89DCD349B3F81D0516 C65526EB5C10E45A8A85D716EE35FB9AB201FD7C89ADE5AD925A174169DA20FB 61E96C73A143DF964C20589EF24A0FCFE6195317F2FA0D2249C0D8E649C3D9AD FF13332EA2E4C9CD36D8443EC8F027B61CEF92C6A6B72DD4ACBACC16E429A9A3 F5F29C1631360E32F8C1C93ACB22F810B86D2969A7480F486F62F8488BEEC74C 2C1AF13BB92BC578E8CD30BEA6BC8CB68ED730F54CED0167605FA76AD7B7E88C 7AE7688E598F91C471BD65A542E96D64B1EAF19FB4F1234308C48C2DC86E2193 11ABDB4C6189C6F201627C693691A86DD07FF55C30FDB3F72381E09C6080FD7C 9182762E5001E30F52A216E0B71E4D2D4E2F3B20F95DF3A11FDB2D2B5B5FAA66 C46226D5E0C77066349770514E5675550FAC9394FB27CD2C2F974F1FD58C04A3 1EF53A8AB3B2202CCA1CEFA66228E1480A0709436C44BD3319C40CF888AE4692 5DBBB52B15CF3A518F627F672135A24D5DB9B2EBEF04C860AECF231EBB5A3BF5 6DCCD5E72FE4B6DD29E896691868A7DE4120AD06AC573F5608B8449B38E71CA0 EB5CDA3F942482EA7973661170F81DC88D54DD5B92323F46F833DFA757107E9E F62A47CC50FAA1B68ED535C3E0E1073532A05ED339C8D70B3B9864808ABACD23 AA95E9FDA43D54C66A675FA074E0A5B8777D3C07850A09087F36852B5351F35D 8BC4DDFCA35CF29CD5E3DE118A741FAC4DED36847F2E2C6CFE08669301722D94 376F540982958074E7F1383C409652F6C99DA39FE90B38221E75BC1ECB93ABF6 B00F410A0C5651DB418566AB350FDA1789AFD88286AF3BCB42B98386F7BC144B 02DEB8940D20A6B3062F0C4244EABC50923390064F1D027A8BACC3DE45156E56 4A942D1B87F1C4A76B0D4D6801AE792CCAE3009BF25368B31B6AD5476FBD3BFF 9759EF463EF5E78E10B7BF64005B2ABE0E8813950A08A1808587A98E0021D0DD 751AD515E8278F1A0759E85D8A084490BBB0F8206484AA36388B1013643D3198 3509078847BDAE08E76FA5BF3E3A73C323CE093DCC148E3C02C2DE1E26C94D5A 40EC8308ECB02FF7DD04EC1005A2A0DC74D4E587F10A3EF349E828F69FD38962 2F0C74D5DAB3ED6CC9F97008ACCE74C086A503948DEF1AAF58FC8BEC703CD360 D32098A56AC776B1BD08442052A2A4EF6C8798F7CDC102AF1A2009657254762A 0793F79A39DCD6ADBAA5EC84A7ED6018BBE727E5D477893D84F157074B24C13E 8D4881C7DF8ADC13EBA0D89745EF93B7616EC5355600BB0D2B630AABA3CF2946 AFFD0B2B724EF0F28393F3CB6A4DCBBA655E3D6E27F87E6D8BE12A15D35E1E75 D36532B9C5000C06A58822444593A1038EEB23C7AFC9EEE3907DF8232322B09B 230015E014F1B4CEB866234266440AD3686E30ABD086CF9C0926E711F0757925 5DEB3D39C8E6D6F0C05A364A0DBF90F6E32CD28887F7E237E04093E07A94C973 462254BC1B1586AAC29FC7F15A80FB5993ED22E79A0FB5BF0F7362CFA24BB2F3 D4EF7D39E1902C53053C27E2AA49C4DE54A05AFB1AA6C7CCFBD9F72150DE259A BEBFCA5C7E828BE667E9C72222B84C4C79C2DEB885A69861DDB635B02814BAAD 9672A14E50D6A2A236AB35C6DCBFA1165F47F8F52B0787EB4B70BFE3CAA8B511 A630E8148A51C1394C7C321156CF52EE7BFE07B6C354CB65782464D2BE42C0D8 14EAFBE88DA3D5C90614F22E02626ABD343F3AC0A9698AE84CB97F1CC421D34F 98B69FF4C335B95F4222A8BAB77662B4A57A4B574265A679334D5EBCB073FF69 66BD9322B1C2253AE85AB38889B26761BA509C7F638C6CBC4BBCDBBBF4BFE1AE 855973129978F707C87462B67509FE6EEFB5E0949674C34768F001827F12F1BA 77AE866711077C30DC0E40C2D8A6EF4D85355E596E26B675E8D223D4E55C3580 5B79260E90985DA5E5B2F43DE7713D5E67080D2843D44A3585E078615BEA476C 88233D241D3A427F9B1AD26ECD535E46C137084A835CD816CCA936D0011C53E7 B33D5B50ED7BF3F41289F48E394BDC963EB1AFD6F14F0C146E0F13B03E76B389 8AD8E81E41F14D1682A113D8BA1482D9DDFDE71208AFC351B62E028C3D50BE01 FC9CD5D5F36E28DADB469201F41E9F39098B65E43FD1227A26F6FF812CE452F8 B5476C28FC1B1B3E5FEF3A3B94CD552E29288AB0A3ABCEAAEACBD2D5E9001579 738029B0E7F635C6C4962340187558084D9CD408EF7FDCE23F465AFCAA8EAAC4 8855BF64EC9BC75371A98095CB51BE7FF107E4C6C21079571957B2AC35ABF77E 9DCBD599C549D3B40A36AB846859C7BD9F87A2FBC724621FC7B305F02742A66E F2BBB6B21671FF62D682982C4E8F6645EA4A7D875E03774474BD86F76AFD4053 61E9AF3C9B374D730501BE61106AFFF8A463406722AD2C14D1A81C08C2A31E60 42DBCDBFFE4056E6AEF59CA261835523196A8921D1BE0013F8B3D6F05793FD18 3E767E98289DA6CA9DC9E2EF9E697998D2367E45AA87B3E75A57F64021FAB21A A480FE7095000C29AB92E6D299B2E5EA7AE1997A6B23E1F90549334F62417196 89BF7E9F62484C2816CF5FC2ECB7DEFBB11E63D70CA13D96BF3DB3B95F39A41D 2E0C84ABD2FFD86525323ACE4A85A8944601CEE9D157445312EE9EB81873DD63 A1BF3256BD697289C32D8598046EF6F6646629A7C29D5B1C5855CDB95882C2D7 73536D20BEEF480B4213C0F02826D89B76300F6BF3ECC9C1DF3AA2C91CBF7D8C 2862CB42FE32A3715855D8B7B30FF83EAD80181F8034395A1ECCCE5BDE7A2C9A 124900DD8F1732791A32ED4820F93BE8D15A5B5960F824BD17A8455F537A947B 9726CDB5DBA4107593EDBBEFF3B140B7CF51BD51B099045DB94A946271DC6C00 24F77C781DBE53479E423426F3FE3004F4282816CB898B570C171FF63B4FC904 8D716F6B7F3BC9AABBFBF1DDF2779CDD19CBBB60DDA40D5DFC85ACDD2A0FD2D7 6402B7768E5B1D7CAACE9241F5891F922CD586255D1D9DDAF0910E14F3A2F8A4 631394010C96EB7EB6E3009591E12C0C80F511D1FF14AAF65FD0A74E56361BF7 07826E5FDC23C1AC2A50347CA313AFA7CDFA9E41F567AAD4784BDB4D1AEFB4BB 108438507C49652C2D62EE498B0DC3082DBE1386640593C9BBE665F0194AA415 8DC8F707C23921E5BDD170408D11B9228F00CCC5EA45F51C5AE792704EE9BAAC 9A4B9479972534CC6BFD9187AE53773CD4EBFE893D981C973FFF2BBE03070EEB 729BBA16875115DDBB97E62EDD4FABB2953D18E492210C07AF48EF4AF406C1E4 A15DFA3553E619D7C50740304B50D01E03AB8F52A2A0B4E5AB6A8EB244E1DDA7 7B4B60BC0FA3C2DBB142C3B07C82C1A49A7698C173FD336643FC71CC1AD0A157 FEA076C61C85EEBA233B836FAE739A19B4E2E01E2CDDC937A766D77FC8B21BF9 FC22DCF7B1A82791D0622F063017AEBA2D7F5C23E886A052725A6A32FE07C847 40EAE70970BC5497AF0C9B4DE429BC5FB83999046A714F7526D225EC3AED5937 9655B968A287C71465C2B6DFE0B817C1E91891A77C647A6DFCBE5BF85F907B2D 89A524F0525AB4B180D08264A30FC33F7330CF479780B57AAEF15F065FD94206 AC9C16FE4356740797B5BC11E83ABE058CFF063AAF6064349BF631E98CF062AA 948CC961BF1309CFA9BCABF604ACA0995C3D822C04EF947AEDE6EC09EAD88146 D7209248A0E9BE60A511EA78E45EF4B1FC459988D7F4AB483139E4882C89FE36 E53F25FBA01E2F476B322B43D601DA18059CB07C04BE96C7FCB279E3A10A2794 38D54D208C9408CBA31360E0B7BF377E0B98B105D9A833FA7C56F76FE1A034B2 2BA0F76CAD724D164FD310FFDE6952D66EA2C2DA00284AAF569C74982E38EB3F B9E4BFBDB1AF88D98D7DBBAEB302A70AD014CD2A1D8ECA99BD1F8D94C1E5C0EF 5141C116ADCCD43509D25ABFC8A78534D291E0269364E81734455F5D714EEDAA B57F6EBCC8D11C839495D3CF474E4765926BAFAE5AD115E4729B21E856D17E8C 73E348B0F0AC05B19C24C965E4FA9EED419104AC058A019A91A15CD6B19C9E92 51806541FDA27700AB879107D6FC22F4108AB175E82B73732E2754D9831A26D4 A1E37D57FFF6EFFBD31B9F0C468C4A426268E5A2A1A2968B7464EFAA60076797 12A1990B46F8A0AD088B9C3F452A1949B2EEEE0BF77AA8A8F467EBCE59B03D81 5192C53954D6693AC154D19C78023B403983A3CA52ADA1940CEBF4ECBE86F8F9 4F948E64E9C0DA0C7DE830EEE10925367F597D584789528FAF547E2B57C19187 33F36DAC93B4CF7CE2CE6991C178C8B67501FA1FF266194A020D9FDD06B9BF3D 12A818C817FE1E4FD3FEDFF16CB766DA527A114B8386B257FD4249362F0D60A3 183DC1E55A6EE803D8B62AC292D085355748A16826328B8602E5559D6CA7F29C 624083A8D0AE8CAFDB63045E9DAB86126A2D31C02CC945FF2F528CCFBCC87513 04799B17802E254160AC84A87F8E802FF41A590EC51D7543DF2F8691A88A928C E20768D57C67888FB6375F02D35EB778D2D7D7EBEA0F58D5745710A876DBFF87 C80E421454612ACE12AE7EFC44920C30A1B54D49574286A495E382C35CDC1457 533363B3E06C5617E26797CE5EF25188BED52AD9DC2835D6E413B4E7F02571E4 9402F96A2326BC707B343704C83631E2757B0FE3A0CBADAAB4C8972121A43087 9B7D8F71D630F8DAE7E913B6701DC5BFDFB598C5FF58FBE8583049D9EB6E6A1B C908FC1052BBDEBD70971490B27189D226DA6B27563CEF2B305A519DC8F70E8A 4D42C98BDF026827BF4B4F8488E5B283D9FCC5B5BDEB0F1ECB8CB713F7E2F81A BA0382BC6F5F2A1FE20B11CC94A7C7BF296DA9883C4FB2FF977BA4D39F6828B0 3EFE328CAD711D55242029E183833C6E904E1AF61133B33258A8ABBEDF324F0C 61C407443A50C827397359B042F37AC130F7E59B359F40D72F74D40F725DBC1F 35C1AE093B74A454F11A056B37541E0E6D3CBF0A472B5D89920A82796C55A074 4285020DB6E372928B769A5B8B85C3655360271EBA2EB6C5A9CC88B245DF7850 0C2543362DDDB90D9EA05A3BC56A59103E33390C89ABC2DAC18FD75D3E91F965 8F7786D76766273AC6E2339FD1F0DC62EFBCA9872A4B56C72E2EC3AF1212B464 393ABF4FCB0593B1EB1B955D5B7D1A744549CD361CFEFF44B1714A5F3B70F921 EB359FF93C0C91AA56C1E0AC03FAC195CD40E20EF73E7CAE75DE9AE457EF670B 551E6A1CDBADC4D747EBC5D70AAD371E93696238119E879090A74F811B712A09 2C50AD774FB3D1472DA1698BF66E23F64283F5A44F44B46F2136A37832AAE303 18029035AB98F8EE4DAD4EC11FD6C135A5BEA7E7A315FF5B109328D6AC1B2C1F 12AFC8C01BC24F100874753CAA7C9B2E1ACA85FEC0DE1CD9CD3FA3C6596DF25A 9D714C0A0E2CC989BA3E13B9937BE6851091083D13E96192FD1AE01EE8266966 42D749AAA750EB754BFD5D63746D0225D674A193E8732ED95CADBD514D930EA9 501C4B5C861CC73EBDA7CF0867E7FA56E5E8A8021DEA03476947D6CE7A4B1C22 BD2F3F2707D2E8DAAE4756C45A4D5C7DDA84D4FBF771492F489FB17B8F376A73 A11BC921FFF304F712E0C55AD8C7F89B184D876B47A34FDC662A1B4921A65AF5 0FB9FB8C30200CEA65ECF23E13301EB7CAFBD8736B04F0AE0354A749DDC15C7A 56AC528411F70EB8B855144BFF6965F99BD684C4706D264296F79A740637DEB3 7815680D5E43CE3170BC024B97C252DF6F2867C814D94A996DB26A6F5886A4D4 FF35CBFAE4961802E87AD786E1EB4B4683B5C4176E88F0ECC412025CEBA52738 BC8E48FC9F9A9415CA1F44AA34E1B613F034DD9E7666FAFC856875A1B4BD6EAD 0E267A5DDCF5BB138C07FA99E20779E6599F7990CB63C9DFAF7C3EB7A1463B97 F6C774AB136A759DAEDE71EE90CC007C22809CAA42547BBA42E4EB20BA4E9945 275DBAE7958CA89F44423F8DA7A080646636ABF7B0B675FF213204DD8FC8D6CD C6A609D0BD65D46A345A14AA8E5E7AAC0723442B1C4ECC676DB91750385BEC07 C622DC7F1D1FB8C7EA81BA35BB2DC3D98FC009CB73ED40EE0776024E8E5903D9 E27078DC9DAE4F92F5AB6695646FB0ACCBD3FA4B84146E459DB1EF3DDB7A256B A2F485ADB0D6FFB3B0892CE7A30D3D8404E37935B6A3E96433E542C810E071DF 095A09E541F326B6D4DEA649C1D73062C6DF8066424B20F3EB2835043C1625C4 9CAD1B0F7FFCB5ED4B4A58942716F289A5AE174964E161AC1668F8619F1BDA05 0E4737E3C88BBFA7B7CB2C03943E6F169043806A34982D706BB5455F27AF2CBC 52AED4F88B0E347C0C5D656457A5C941BE9E96CCE3E24D41A38BB59EADFF2758 E1F2C9A4B6613B2853AA5986395B32EAF358067946D06760C4B29574AA4FC902 7A635421BE44390C4981895C31B2E9E7133EBB71E454E17F76144B832EF57692 916536AF614AA0F7A22E0D7FD888FEBBD918AE33719F42635DFC97AC4064D13F C234927530EDF9646A5110B1DE674496B5D250CFA823AB14FB3F541A8B236F1E 0431CDEFE83AE501BA55CC3BAC2C281AC52668D6CF03A2FFDCD0CFE61CFB7DB3 B9391F64FFDB13E1D9765E3EF9A452D9FAB99DB9BDEDAD7A0A142EE25C5F078F A55C8377D763835C874D684D87E0AD8C4A9BE2DDA3F3A31F152C2C114CA200A4 D7A119BA4A1998E2E208E4A45FF765B947062D7B650644FFFD53ABAF7ED90440 0881167110D57E5D7F159EB0D1A019CFAE2E3405E0325CC7E1054D5A294D8357 4A0EF6E6ED863D6FD761507CC208303EB0894AA8055E11F8A6003C62E3457680 F95C8DFC7F6D84E68EA1A52ECBAB6B5002A29D2A740134D41F98C27F902329DC 7AB9BA8A53E97F41AB48F77FAE2039F97ACEFB9E9300DDEDD69A0C9D3D658AA5 9E0478CAED8CC949091746923DE8E2BFC410952C12E2C1FF605C8AE6055EB455 7B817F83DC64C51B7F25DBE06B551FF78594BABD05978378CD614A708887BA8B F54D72A339C600818BDFE9EA4B5BF63AD6C465F58B6D4B98BB1E0BAE8AD63AD1 E6A06BD7806FB0672459E515DCF93CCABB2363E8A6748561CAB8769511672F64 273857823503C62D6C29F17FCE16343E4EAA64BEB54E33C267CC6F91929C92D1 2218A56B10D99152D2C0DC9B7ECD40CD80286A5A642C9986FE095EA6EF3ADD28 41EC7CFABAAABB2FC6F2CC562E4131D82729D416714AC160F2E87433FABAB57A 0180E4943F6B201BAB120F8F3A8E42134FCE40E92383684E5856E91F12F11578 E00876D791F467933241746448D028690D5BF025639A393B2B273CCEB48749C2 925B8E231CB29D4FAFAF2590E649BD0B70EE46A053E27D5DB5927A52A5072A24 07402125FC775FCB04325FAF1816456BDFC9EDFC73E6D40E14AEFE711C698C45 28BAD2117271ED582504965871517D388714B7A602A797EECE522BBB50DB624B 0AD24BC457D79D425A10514B120472AC822B35140F575C718BD176B97DFF8C14 DC5EC096D6357D70D2969BF691BCB42D7892ABC7163E22894AC7BDBD71E4AC32 DA05C1AC63B8429F12606D89676D697A55AD87A8B59F32D145F9D251CAE9D5E9 54CA2135B75ACC211C234D823EB429693559C944B1993AF31AD0EF0CA046B1BC 99F974204BA9FC43038E3A45BD375B4CC99A003A51553E480DABDA3D0939A252 2F8D6CB3BFB57FF96F873B432E64FA3837669372304A25F4B290F0883E860E70 AE7C9F4E7650DE66E1FBFE707F737DECB2F63F19941DC474672A47842D464D36 6324D6E4B599EF9120520A5E2CC3ECD66767C0F4B3071771BE5760E0E2F7ADA2 03B111F0A36B79D86FDC3D14B7C1643A0AB9AC2254F68EE2B3DB067C976C9461 2F6FF5254ABE6CB0F5D76B63B31BD2D3E13F02654ECB6AD360E7DF52207AB680 CE94822223FEEB833720C7AB3D8C99CDEEBA7DDA000815A356FC07D98CF925C5 60016C7C8E55903BD13F03F1F9541A24D42AD7C96ED88AA20227AA0D3E01503B 60947656FCAFCBF15276F1B7C3C980ABFA5A9A74F49C912EE6CF381509BEE6A8 EB8E6E2BB6902B62D7558AA2D259ED01D14C0C47D74C2126A7B7DBCC8C73A753 D5C2CD60B4D6A27DBAFDB57FB3A89E4A39FD56CA30E0C6AC26787AD9D5B4EC56 CB05A2CA7ECD0DBC930D302EB390759FC26A8A03F3FCD1D9CDF2A9B76533FD78 69B13E25902AD368AEE4E6BE6909BA17189D3BB09AF77B0319A7686502E7065F 58C965D66210AB3DD4A2FC739B342EEB632D7DE7D851DBD0B1EA0117AD8656F0 13CF0A0436758B49D90C35BF4640F9A453113B38C5E2FF74BC1C1C1F9F238ED2 E301E1794F17FA7E89E3B3FF6D5A81DC08EFB95563E8DC89DF286A765C9B4886 4D2965096873CF97A9D7875A3F9C53BB7EB56BB82F8FDAF8725C8DA4A0E9E9BE 57A9F9DDB560B3052D2F36C52A49769B6AB8ED82C5DCD3E2CB029D5EC2EAFD43 366B4234AA0070B8E11628AFC07FC26FA44A5240554DECDD0DF8C2A518720007 7DB6011E853CBBC1CC58567DDA88FA5FE72E06FBC2BA706ACA205919095E9206 C176E3EF415F34733F33FE356C6AE44FB6662118848290E6F3B5309562E6166D E23BC05E16B62AEC365CF01D16703429F1F268686B7C49DE27D06D34DB09BA11 FB8F47 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark {restore}if %%EndFont %%BeginFont: CMMI10 %!PS-AdobeFont-1.0: CMMI10 003.002 %%Title: CMMI10 %Version: 003.002 %%CreationDate: Mon Jul 13 16:17:00 2009 %%Creator: David M. Jones %Copyright: Copyright (c) 1997, 2009 American Mathematical Society %Copyright: (), with Reserved Font Name CMMI10. % This Font Software is licensed under the SIL Open Font License, Version 1.1. % This license is in the accompanying file OFL.txt, and is also % available with a FAQ at: http://scripts.sil.org/OFL. %%EndComments FontDirectory/CMMI10 known{/CMMI10 findfont dup/UniqueID known{dup /UniqueID get 5087385 eq exch/FontType get 1 eq and}{pop false}ifelse {save true}{false}ifelse}{false}ifelse 11 dict begin /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0 ]readonly def /FontName /CMMI10 def /FontBBox {-32 -250 1048 750 }readonly def /UniqueID 5087385 def /PaintType 0 def /FontInfo 10 dict dup begin /version (003.002) readonly def /Notice (Copyright \050c\051 1997, 2009 American Mathematical Society \050\051, with Reserved Font Name CMMI10.) readonly def /FullName (CMMI10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle -14.04 def /isFixedPitch false def /UnderlinePosition -100 def /UnderlineThickness 50 def /ascent 750 def end readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 62 /greater put readonly def currentdict end currentfile eexec D9D66F633B846AB284BCF8B0411B772DE5CE3C05EF98F858322DCEA45E0874C5 45D25FE192539D9CDA4BAA46D9C431465E6ABF4E4271F89EDED7F37BE4B31FB4 7934F62D1F46E8671F6290D6FFF601D4937BF71C22D60FB800A15796421E3AA7 72C500501D8B10C0093F6467C553250F7C27B2C3D893772614A846374A85BC4E BEC0B0A89C4C161C3956ECE25274B962C854E535F418279FE26D8F83E38C5C89 974E9A224B3CBEF90A9277AF10E0C7CAC8DC11C41DC18B814A7682E5F0248674 11453BC81C443407AF41AF8A831A85A700CFC65E2181BCBFBC7878DFBD546AC2 1EF6CC527FEEA044B7C8E686367E920F575AD585387358FFF41BCB212922791C 7B0BD3BED7C6D8F3D9D52D0F181CD4D164E75851D04F64309D810A0DEA1E257B 0D7633CEFE93FEF9D2FB7901453A46F8ACA007358D904E0189AE7B7221545085 EDD3D5A3CEACD6023861F13C8A345A68115425E94B8FDCCEC1255454EC3E7A37 404F6C00A3BCCF851B929D4FE66B6D8FD1C0C80130541609759F18EF07BCD133 78CBC4A0D8A796A2574260C6A952CA73D9EB5C28356F5C90D1A59DC788762BFF A1B6F0614958D09751C0DB2309406F6B4489125B31C5DD365B2F140CB5E42CEE 88BE11C7176E6BBC90D24E40956279FBDC9D89A6C4A1F4D27EC57F496602FBC4 C854143903A53EF1188D117C49F8B6F2498B4698C25F2C5E8D8BD833206F88FC BD5B495EB993A26B6055BD0BBA2B3DDFD462C39E022D4A1760C845EA448DED88 98C44BAAB85CD0423E00154C4741240EB3A2290B67144A4C80C88BE3D59AD760 E553DAC4E8BA00B06398B1D0DFE96FB89449D4AE18CE8B27AFE75D2B84EFDB44 143FD887F8FB364D000651912E40B0BAEDDA5AD57A3BC0E411E1AD908C77DCE3 981985F98E258A9BB3A1B845FC4A21BCC54559E51BC0E6C22F0C38540F8C9490 88A0E23EA504FA79F8960CC9D58611C519D3ACDC63FB2FBCAE6674357D7F2285 4BCC9F54D3DA421D744D3A341DA3B494BB526C0734E1A8FC71501745399F7683 FD17EC3044419A88C3979FD2ABA5B0130907B145A8462AAF0A9B511D2C8A7C7F 347FF6AC057E6512902BFD2918E2CD31DE615F5D643764E900B60287670AE18F FDE15545D8BC69591A8CBBB275AFFC9B14BD68DF0AAB32268FB84844D4DBC7BB C591C1AC5102C50A9C7BAAA848DA88B0519F0F5F0813BF055CF0E3C86F633A04 B779D2E8E656DB1E09A66A85FE21CA8BA5523F472A229E83F2C4E91ABA46C733 F3C7B5775B06C97782BC225C46385BEBDC61572458EFC5CF4190AB7A9C1C92DA 29F84BAACF552089195966E3AD9E57CC914D20B6962BE80429A16D4DF1ECAA66 36C4343FADF0B2B48F12E2EB8443C4AA29D00949255F3968617F98B8ABD4CC12 048B838EE243A21AC808BD295195E4AE9027005F52258BFCA915C8D9AED9A2C0 80814F79CF943FBE3594C530A22A92E11BE80FCEC1684C4F56712D5846B0749C 9B54A979B315222F209DEE72583B03093EC38F7C5B9F9BCB21DBE8EDDAE9BE8B 75ACE6B12A31083AC8348EC84D1D29D2297A266284B7E9734E207DAF59A25F4E 4AA38509E993C5394FED76E6A2F25462685C4C86C6E8CFC9863338EC1428BDFC 74616BB1BC8948B0ED4C87C15B4405F3A7796F9DB3798FFFE8BD0A94E834817B D5E9812E308D0CC920470A6F2CD088FCB80462BF7CB3F039A7DF3DAF5B2B5355 E083A385CD2EAF0FC181E40E96DD7E9AB9EF5C7E6866A13B8A54718E950FE097 EF0951A357114F18CE9933D28B3A77AA71E3CE884661F13284BCED5D5FD1A86D 543E588FF473DC2CF9A4DC312500135F29C2D0174B32018C8DBD40EF9A232883 710A1F2AB2CD11312300ACDF789A9B7B93D2035D81D1C84984D92D78A53A00C6 EDA94B24BBAC1AD17774A4E07E6F74ABD90415965616AD540C8ECD8C3A44EE4F 7F4F6BB6238C5062D63FA59B7BF08BE93FAEA70A2AB08FBEAAF7DBF56B95FD93 03CA406543BA6C9527D0DF01F5108D31A51778A5EB1C93F27B72B46146A353A2 01CACBC829603B9989A87CF64528682CCBA0562A8165B185C58A5C6BB72F5E89 500ACCAAB8ECEFBB2640E99EAEEC4EA979AA793D013D61D8ACF8784FF8D9398F F6A252A709324FB39509F0B3A4E725E82F53543383C6765BE556CC897C758208 AA3AD37B0406E4A79F8F0A6C1983FC73E71CD858C0DB66ED66D5D992978614EE 1EA91EBE191E082EBA1FC040AF19A2202575C2EBEB8058833E3520FA03D2F915 85C1ED337E457B9FEEB0C6EF2735EFDA6E0D05FA641BCF698AC6B97751E8306C 4DF00A39B8581FF53DB8F8525FDB196D85950906CCB59B8EF171349AA3B567B1 6A00819947A995FB383C3C1709C9A2C113B2E40BB832B7D4A0FBA0B16A2C455F 55809CC425C403E9668DC66BE45B71A81C332FD4DB279D22A2959962304A8F18 085893DAC61317D24A8F198FDAB95F3B86F0AFD35047B868A9A17037A2829A02 BAB042F75F349E197A7EED41984C2859754CAFD0251439921C248B463B516951 2E1322C80D73F9CBCAA63A585450275AC2492E4D3FB78E800F788254DB5E610D CF788DF5C70FF99892BCDF16133E34B24B77C8F097F546B87C603DDB8998B66E BACB68BA27462AF54AA405682EC96D701F0D474DECD5F95CA2102DF639EB169E D518162C2BAE45FF698B6DE15FC6E7DE48C336C40A670FD26952A6BAB09115E1 991F0073419F2CC2A1C08BE91096936AA0C37E4ED3CCCEE235476074B8FF1125 6BDE3701F85532D8BB64CCC927CC335281C95EA689706F0AC717DC2CF680C754 E5EFD7FA4BB8880B2B727A964C876D4A223069D4E6001771F0E23EAD2A4BBC80 E76675297B2EF05F52BF4E71B3EE2BE3048CF088C79540113C66AE98B2FD3CB1 B0741A215FD070882C52765009D7D711DAA2508F19AE7DDA15229A856AC49BC3 4DDF40814FF96500E4B9B02D412E94623C5FDCC76C0FB8E42DF56A904FE49D65 1DA7C53901B2EA71AB658A464D3ABDE27D9DB8D9E0B48F64E61A2495AD5D8DAB B5E72424AD017DF37964AF911BD7FA21A5EB4775DC8E95EF0C0EB856B00D89D7 8172A1DE8530767D317B8256103E53CFB877E10686A04F5A08F8DC58D843DEBA FD5F40597588663D103689F6EB3EB14D06E18C8078F2538B43E712DF491FC5C6 AF639256C8C6134B64D560D8476DEA6329D995E46CC4BC78841C59E73648B47E BFA7DE0846422F738454AE77E822A083405289247BD7C478BE4974F742CD6051 E99FBB1D1B3FBABFEE855174734EE45E87D0AADF32B1283B911162A9955847FD 38944D70584FAA6B1A7191C5C134B73F98EB632B69E2F0C0F94156787C34C8A3 7622A029D58F9626B74F8A8A1F3803E0BC20E0EADEB1E99B70F1BD9F980FB751 2A842843DE42EB142A84D5D3138629AE9EAF6F3479C423E8829C8816FA6EFA27 DCE5580E65AA9854B1C64163DC318420CD993C15BFD76A8BA1182860A6B03D6D 22B8CF43CFE6C8AB27C64842E239CAE707D3086BADDE1D7C94E3BC96319470D6 8D26915C575CFDD03271D6BB9DE86A0EB6EEA6E768B224A626C62A9AB48A6EDB 44F70BB5AF991CDF9736D65933E81CC57A78F623F33EC9AF535F2F25FA4EEC90 D50DB7E87F31E971A75A33A301CA6013EEC5A4E179D695B33DADF2C98364434A 42926776000B610E17524162253F6FA638D6581C18F99EA0BD1D2E24D2424ADF C05010D08192485153DD03930C7BF45237593E484F9851E6D464FA10FECA5D9E 0C8CCC97DE029030900CDBB491C5CF226DBF903CFE7735D939C3FDF3A20B70CE 66579B28B99313FEE914E295388C7BC8E055A2E54EA3A8206D3C8F4F7C0BA5E6 E519419FD8CE215F7B8E9BEC604A9E3FE272A0328A24E31997C8A91E0946BCF1 6943A97CBED2AB9FC636B49828BBB8B89E0BBC2653796431224895ABA5DAC41E 1854BD9764E86147FD7624F736F40DE3B7582EDDFD15C2BDE3F22B5A54D7DF10 B87A1301CE85CFC061689A890A321412A13314AE96DCD3EDA75035FDD8F4AB9B 897A2C68263A68457032C469987970648BA2D88B1C5375DFEAA35A917B8A952E EE670427942AEDB3CB599C5746180E392837D371E15D860620ABDB6AA7772C40 A5E346661673ACA530BE3D8E3FFB895E5DA3DC23B1B43C080C77F7E47847F0F3 F3AA5CA9E4BF75FC5EBD18D19F21A7DAA3B11CABC6E4070A15F7DBC8B05EB6AA A02EF1B078EB66D61D6AFE41DA9B36FE7EC9EF94D1EA26282A9871E2CACB3126 2AD49C2D9B50A6E47D8F2CCAD50992D1B430979A45FD9E76182A19964BB2A1F6 51779A2B258DC1DF4C2F3074621286831F3848AC152DDD2BA561E6586ADA88D3 598A2CE2CD048F027CE0008B828BD915887D7785341E8305DF2346ADB76BE99F 87B02173BDC334E9221C8DF54114A6B24C1C5340299512FA6C8C51AB4C8778CE 178CEF531C6D1B5FF0A1BE8EFF767F959BD4C345C52699A29A17B2A230842BF6 4B011217D6D24EDAC3F6D53482786F1CA33169B90ECD499407D37CE9B70DDF78 7B7547B32952535BA9ACD1E244447AE3FCED3AF28717083CF9590A09780984D6 AF0743C82AE4FB3E2BB2856A4153A3967A023FFC35382D6C22D84A924900B6A6 3DDD400E6D2418DA6C27F2FA34C075C902B89EBAE658B3C9A18EEE449DA5A379 337DE95CB7AB3F0970CF1A5D8FAD8090E495570FDFB2FBBA79244780D8035547 C5A55BB21A2270F724BF5D442CDC5BB9F09BE0CAE59B1C2270F0BDACE698F2C5 DE8F66BFB9634904B161F5BA2B1950048300D69BABD312D58D89C4ED527AF7BA 7DA2478EDC2CDEE3473DD8A8ED9D891CD1FC21F23013228BB3281B71FCE959BD 6F8E9059D682A7FCC5265A0620992D4FA8D78377EB34CE3ECA070EE3707239BC 98907DB0120CE42ABA32CF97127E28382BDDFD685674279F588D4F951216C355 821361790F64C2CC720DE97E8ECB57326C43EE47367628E05769E106868B54F4 C33C9951908DF6FC4F5ED2C7787BD8FA591BBB3E9C6C1DA94CC5E38D9B20C886 7D237572FF46DD896A4D6163408EA6CEFAC398EE041EAE29D577E75326CA17A6 B072D47A7B13EC441CE6DAA042ECD02134CBFA6809A435050413817193DAEB16 A5882C8AEA44BCF36E74E9ECCDFE7E19FF5A5DD7A94E5AB4F8702C3DA7F42325 23C808670A0490F5B373DADE40814FF9650241D3D69C91FBC5ECE728F827D9BF C928602E05477903449E079164CA39859C4BCA60C579F490AA455F82B5050BB3 969AFB478E0D4A257B3356EA3CD62051FCE6C6B1929CFF85BFDF166BEF658E10 3A55E007F38EBBB248B3F0B8ED1925106B499B762E45113AE1AC9DE09644C84B 9C08034B297314EE69BC32DB6E7D7FB9913CE5AC17E7335979E9DCCE2BAB3725 1976155551F9706A576FE0E3ADCCF72C87683291528ECB749CB0ED291966E239 B5E3630676BD409E08F85BC1AEC9A2D4135376284A96EA24431243BD6FE8B966 95F11A4BB53F392E0AEFEA623064FF8A7002367B0A515635CB2D2DDFB9B4A8D7 FE721754E81BBA548848A235B91AD4E4F7DB19CCE2F61D277FC00AB956EB93BE 44AB4970CA56BF59506C94ED160FB1E25D3DF2988A532BDB787BFB8539D22986 FDC378AC31444E63C4727FEE121A43751043849E6DCAC5B59D0FC703AAFBBFD4 E8B7C268F21615AD02CE9DABEFA27B5FE6A6441B619539CAB1F810F1263447AA 633F5DAF483752EF1A0421740E3A811D2D2898CBF53E7F686C9223FD7235F02D 6F90D2D48CC20AB87778DE3C6FB335E0F0EC20B5DC5B65223FE117526DE2C72F FE839DF93CB2A7D66CD900CB325F891E311BEC932F703FB4FEFA29DB8B9C88DD 375EC71B3D58C7BC59ADA91971A3BDA1ADEA629CE6CC92BD542CDDFAA7706FB2 6CDDE2DF07E56D6741916AE8E8744339816F3E6C38062747AA9FDA2A2678A6B7 EFEA870AA3A4D71B25EE3013EAB1DBA34401B867C7A41AE51E0421D41D3BB83C E120C8FEABA6E5DEC53A689C21426D4BBCB68CB37568761C360E6D4E3596FB7D F4DEC7918E58C0293D12D6DDA7E9DCDAAD7C939F55CD1BC4A228B31E9A904156 DA6B40B08E6ACE674618B768DD681C772A3E55FE096CF949CF3B0460ABDCD891 D17B37B355B29AB5137899C036F31DA026244FA25FB798FBE5105BDA29F46538 D3D3AC1001A7BCECE64DE94FFE6C354166A0F97256137BDFA07F6E22A3D1D2F4 9588DBAE95E895BC5E64DDCBBAA8D0A22C229B42CB717FC711E7E9DF793DF80B 9F14754585A3C7E17F37B32924B9F9870DA8635E3E18BD1DCD81EDF01834D9C6 B33F23C956C2FCBFA47D84422F583459D827D1E120B97694D12F1F54D02379C0 D288F7104F3FFCF4F76E3494F4ACBD1BE3A15543CC680924C78A473F8E311ADF 8FE00A04C6C393DE61AD3EDA5BC031E2353076A2489391B52632387CA28A7B93 FBB065A6EF3658AE80B1ADA47E9B2539E73A71FA75645F85ED8ECC257FB4CF26 B6C912DE9D0F9899E70BECCB934AD32CF49A093371A9F73DE6255EBC39DE1E7F 00D0CBDABD4D0383977E694890E71FBE5C376BE5F3A80C28987417504F515C50 909F3D31178BB9B1D085BE514F71B910A9085BD6122DDC72A150BFE266920E49 5661BCB4BAB51D6DEFE32B616963DBD989FCDD1637B294CE4E288655FBEFA1BF 7F25BBF8CF17C2D5FD161A7C2CC9CC7490D9BF15A1D35B3BFA43ADE256E88BDA BD490D92907C57BAC408A575EC84D6AEE070148C7C9A91C03B09FDBD792E8FF0 C0B886AAD2EDD86541E5E579359D40E3AC312ACD3D8FD49F71BD533DDF8859B1 BAF17F1884E331DD07CEEF93B71D492AEBAADF7A263450A7A72210CE630A0D37 BF024BDC09ACC882816B8C22C62AE38A3A8D0F6EBC2B1B2C0B8161A8B076DD5D 4B779C0788546BB4CF57332230D237856B00D79C28A7C01D11F44B7304F69075 94B97A745DA43D1BE561372CE611C345A843834E46AD9DDB16CABCD3FA33D6F1 F6B5C0497F5EE5400B305CDC16A7EC286AA4D45D0EEBB9DA06AC9C5294D68EC9 E4DC3CA2B92CE8FC0526184A86EDC7AB34D67E60AC12D9CA8FD300235EC968BA 92C6FBDA47572BC5600F25249F60AD287CBDAE980E747FCBE7EE5CD323E733F0 63553B494D3DDEB9CC1480B5C3BB79A28E419AA65B18CB297AB383419E890E2A CE6F98C9900CCB4675280A10CF060B8D220DDA1BE55DFA65715EABCC1AFAA271 B1F8732341613E17B231231A0D24D4D7FC198AE04D89A99C4536217769C6FBD9 5EE24A6302F97438F7C0E311C878F674B4477A5ADA3952CDE4055AC408B8174E 86F8FB797646DFFFE0ECA25D1BAB9A9F71F3926D3D85AA63E7A8C931D71E79E0 AF1EAC26FADE468F4FF7F3861D14C10E3BE1F9EAFD6D3A544E8108D5DAB5B180 3950C74818BC8AF4758A108F462EF1826647A49667F5E482038C54716856D9BC 35F29922846D2148F92F943E951D7438C73D6A60459A8003174036C64E1629CD 155D47FD04B03C023AD67CD5A70C98AB556EEAB8C48169706E5B352F6505D580 AC945171BFE62E81F8F500438AC3B64D857BA5BC54C2C4BBB237F8FA51296255 E66A92A61FE13FDE781D393557EB72CEBAD86511035F775FAC39A0479CCD400F 226709118F887F47CC2ECC8F79816D4A945B2845F50AFD62D8C9A9BBF4739496 9E644BC9F7B04803B7EE75A09EAE94365F6F374B4FCEB0B506C76297564B9B6B 8B812BC3A33929AA94692572B010E6210AEAA312BDFC88BF302244AB9D587A9B 919823FD01DE12438D960944D1977800FEB49E638C32E5B188B1CA033E0C37EE A142F746367888AA119535F0CCAF7EAA461B790EB089D2D6962E28A398439BB7 9C9943654D7A2D765B46BC0DD1F915327F369162E1BA1BA83110B93F442905E0 523BFF5E279508A98568CD5CFD18FABBE9D17265A9081E7BF64155A2CE3C0DF7 88D00671AD65654709589BAD7EA65BBA811387ABA5CA0BC3F66D3D48597A0D1D 2C268375DF47CCF62166262AE4840AB03BF49BE67A05EF66328EC729F03CA5FF AD3937FC053E223303565DC771ACF32E63DFB96D5030E787961D72D02C195C66 B48E9AF0309DC169CFE8D16E2818DA94693A18F027DEA0D916672480464F7E22 CA6E431FE38D3FC019BDD229E064B72C545C61C6EA55984565CCA88ACB01F744 3B4593CC8953C83DFB6FF3C5F9113898F45B76D98F7F118FE4D1E6BE669545C3 92676FA583E3D3B272D5BFB24153AF62BF53BA0C81BF5AA2012FD33DD7640BDD 5CE8BA566FC85FC277B1EF69622D720569405B04D49FAA4C9FB2D4E3983D5C90 6B9A4327AB712D655D33EBE0C95E1325576B034525DC7BEE4BE00928DFD23FC7 42F317916B81D6B189FAD3045D66E40AED0B64F709989F419019BD5CAD255631 C91E48735BF1A70917B17928088769ECA64EA6FF215A445CBCB6D6D784022768 BAE9BE186FBC80269392EC8C86 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark {restore}if %%EndFont %%BeginFont: CMSY10 %!PS-AdobeFont-1.0: CMSY10 003.002 %%Title: CMSY10 %Version: 003.002 %%CreationDate: Mon Jul 13 16:17:00 2009 %%Creator: David M. Jones %Copyright: Copyright (c) 1997, 2009 American Mathematical Society %Copyright: (), with Reserved Font Name CMSY10. % This Font Software is licensed under the SIL Open Font License, Version 1.1. % This license is in the accompanying file OFL.txt, and is also % available with a FAQ at: http://scripts.sil.org/OFL. %%EndComments FontDirectory/CMSY10 known{/CMSY10 findfont dup/UniqueID known{dup /UniqueID get 5096651 eq exch/FontType get 1 eq and}{pop false}ifelse {save true}{false}ifelse}{false}ifelse 11 dict begin /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0 ]readonly def /FontName /CMSY10 def /FontBBox {-29 -960 1116 775 }readonly def /UniqueID 5096651 def /PaintType 0 def /FontInfo 9 dict dup begin /version (003.002) readonly def /Notice (Copyright \050c\051 1997, 2009 American Mathematical Society \050\051, with Reserved Font Name CMSY10.) readonly def /FullName (CMSY10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle -14.04 def /isFixedPitch false def /UnderlinePosition -100 def /UnderlineThickness 50 def end readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 15 /bullet put dup 102 /braceleft put dup 103 /braceright put dup 106 /bar put readonly def currentdict end currentfile eexec D9D66F633B846AB284BCF8B0411B772DE5CD06DFE1BE899059C588357426D7A0 7B684C079A47D271426064AD18CB9750D8A986D1D67C1B2AEEF8CE785CC19C81 DE96489F740045C5E342F02DA1C9F9F3C167651E646F1A67CF379789E311EF91 511D0F605B045B279357D6FC8537C233E7AEE6A4FDBE73E75A39EB206D20A6F6 1021961B748D419EBEEB028B592124E174CA595C108E12725B9875544955CFFD 028B698EF742BC8C19F979E35B8E99CADDDDC89CC6C59733F2A24BC3AF36AD86 1319147A4A219ECB92D0D9F6228B51A97C29547000FCC8A581BE543D73F1FED4 3D08C53693138003C01E1D216B185179E1856E2A05AA6C66AABB68B7E4409021 91AA9D8E4C5FBBDA55F1BB6BC679EABA06BE9795DB920A6343CE934B04D75DF2 E0C30B8FD2E475FE0D66D4AA65821864C7DD6AC9939A04094EEA832EAD33DB7A 11EE8D595FB0E543D0E80D31D584B97879B3C7B4A85CC6358A41342D70AD0B97 C14123421FE8A7D131FB0D03900B392FDA0ABAFC25E946D2251F150EC595E857 D17AE424DB76B431366086F377B2A0EEFD3909E3FA35E51886FC318989C1EF20 B6F5990F1D39C22127F0A47BC8461F3AFDF87D9BDA4B6C1D1CFD7513F1E3C3D3 93BEF764AA832316343F9FE869A720E4AA87AE76FA87A833BBC5892DE05B867F 10FA225E233BCFA9BB51F46A6DF22ADCEACC01C3CD1F54C9AEFA25E92EFAC00D 7E2BA427C25483BA42A199F4D2E43DFCE79A7156F7417ACF78E41FCA91E6C9EF B933450D851B73A6AB6AEA7EE4C710CB5C14270D1674FA334686653793FCB31B 491E870D3C2BC654D2C1DE463EC9BA29D7371AA1078800EF93D3F66263A2EBBB F5723697BF7448BD0D2E301544BECF497FD475B85DFEF52AF4F8F8BE445CABE6 019318806D10C5952157FF8F8286C1EE701545C8F60EFA854EAE66835A2046A6 915D395F1E0366EFE0C0391583FE001FF16D82A2E2DA5F57754A2C6F69306E36 356ECF8EFC3F1188AD6FCD2427E0580C97A5B69B4E0E09B85EEDE142F5ADD2F0 5DE51D6DB72B127412A0D57106C19CA493048A4F815129ABE767D51715B1515D 9C21067CB5BC88741B7298C83EAE36A866DFA87D8981F179B1C31292F56BBB64 3C430779468AAF07C8A8B4934E1E775FE3F35186BD1FA6EE3689C1C750678AF1 FBF9B23195A124C5C991FE670AC0C86FD39D2B07B9A319E74EFD498B45820252 720ECDF7294F7B0B137CEB86D33BFCEB8606985A3260FD669E461C8BE94216C5 D434FD8854F44EE66E5A289A9F9E32BC36AF645D53F96652602BAED418C8D726 BD04A1B4617551FE4DEF54083D414F7DCE004E6BB2DC9C2EF7CE232B254BA2C5 7DCBD36C2072ED46FF711F121A701E2284BF1B718B3164382B8F453D68FA0377 DFE106503B8401D4DB87F5402A3AC9A442FA060B0610A9524D530C7157C26B56 AC970FCC1D5655FFFFA39246E6420CF97D08ADFB7B05822679BD40C638DDF0E7 A97BFE8918B611A145AC965C203F1428812F9D340AF499B3A915B22BE798594E 0F520109FC81E452180AE45B170FF999C5FC2761C6CECD8742A5A6FC97F16743 AD4EFCC6572A6D3F3E4E330C5CB2FF6FEA48A5B64DD3DBE943BD9918D4A18E18 CBCF598AEFBB6AB3CD2CBC9BFD6099272F6543F3E532E0E21E614BD2880B1023 0AC234CB705827BF016DB84E00E8C255FDEFA0101A842929540B7B4AA8A089BD 5EFF05B72356B6BC3727817823B5CDBB1B963103000D7F2A4E2A1472FC3E614B 5CBCB6D6D784023173DEFEBFA8F9ED87EC1A0A9EE98CA59CFC964CF943DC683F E9E00DA718C4425A705A69D99988EC6F152525C790912C2E46A2381A569424AB 54DF4798BC2D7E7A361E7991641D4B756CE2A7FF4A2848927092C59C2C4B8809 E13AB84FB6B111E680D7FB9F2FFC2C5C66B0B501E4447C2E46C10E2F6124476F A140C404CFE2DC9E0199BF61E035CEB481D438139A9630934E541D261FFD2906 4CAD99E20655FA746AFB81EDBB5601F5FD6B1D6832A01D585E2C55053F6A7378 4DAACCAC7608DBDADAAE732D66B3E7F87E79756337C1A961E53A4651BE7C77F4 038B89C87F650C54A2A90EB7F1D525BB353F33318551EE8D84A6A83C718EA5A4 B2AC0F7306B1E095819B87015A90CA3ED739B09061782C28CDB36BA4BD5E5308 5CBB70414E4112193DAC4A1FA30996327230D1E021F3CD8115E12D239D93FFDC B645910EB29E40D830E7BAF2DB255FD7C4E776557BB38157917D993EAC245837 A3B515147043574157B8342D829C7228CCEA843ABC89D1785A9672A5923FC4CD 2F3FF27E6FCACF84E2D3136CA2C0FD3EF1EE7354CD04C38B5FB874553646ED2D CEDF7E362EADD04B18051F20A8FB0DE18E152385B9D05F98A3A7EF177824E246 455ABE69E2F700EB78185CCFC07E3B4C6FA301112528D977367D30D0D5D59EDE FAEB706DDC970A9E296236C725B2B55B09B9C336B8E23CBA5FB8692D56F33B03 16294E5FC7FAA42E96395A57CE51CA8DDD77442F142E2E576B778373FB31C81C 16840BB422CA827E30A81829648BDF1CA36700EA32AD888D097C1FE0A05B2D9F 483AEE40269DF09AF0D1AD3DF80C45DDC59C2A03FBB661C79B87853737C6D352 67626B657321B16198DBD6DB98A092F17878AE4698121E1006E53D6F9B0A3BE2 3FB68828EF854A0CDBAA68B37ABCA6AD4A3D809AAF0BAB1697A81FE59C98C472 1E33CD70A75A22C249DD11D76C2575ED3370A25892A16D2FD569CDA70C130770 93F493C7D47D6F9A5424A7A542BAD726BFC3AB225DCEBBE6AC4BE006F8C7C0EA 051424B08305BF2D951AB2986AAFEA04E078CA79B399585BFF0F1ADCED02E15B 8765EB6BF6A8E4D0901EFF2C3AA104924EAD9637A35D877E0C51A3C37DA78CD4 8643C8CE6DCDDE3F116A6C2390F948E5371BEB5AD2E87B41C5F01FB5C196C436 6E256A88D082E3F46E4EFFBF605B2EFF1E9D9AD5EE4DDC323A137CD9451EDEE0 06F7D82898D71FAF2362C0FCF1F726F97F820305B7CE20728CA08C63575083A7 84BA28B7DE2B916432475510E274C12FFD1660A717F51DACFDF0A102D85224E0 D6DB607BB72569ABB8A7BC6A10354CBBC01732EFE35B72062DF269CB25EA3DE6 DC603B04C90C5912D2C38D7A5ACDCDD3F6F116D884F0D8C528F69D5D47BA20DB 0A9E585C7D8CC3C324FE8A1DF150279F7E8FB43BDB720E624E5E9918032C02CD 8020636AE5C38DA2484B7F4B34163E0D0A561B43B80E97746DC05C871AB620EC C5D47101ECED4A7E25F291184BEF8B80024AA7BB456C1B83A907652B331DEA34 754226C39C6889EBEEFDAD081E01EF8FE47751987667836FDE4C8BB8A3FD4406 1E643B4EA37BD370734D1A2DB17C2F4B74B4ED75098B433601F75A88C9A37A05 CCB157EF6E32023BFA33973F3E655A4D58289136996FCFA61EEABD70791B6523 1FF5DE71AB8A17038923118A5EED8D59C4C58D246FFA9BB26472346B40C8741F 153D19CAFF20DD2A86C6DB89154A630FB1761929FC3F0448EE2F089C1C953E02 905BA8DE75D101A982A611056C4B237596C10951DD98BAB838B742D3CF7DE718 617DB72E5268583223E37E029D1C8FD3F1D21690151F76B76C52C725CA135CA2 8666553E863CE188BFC9B99AF56AC2DB5BFEBEB12FB563D00244EB89E478657A 98AF2E1223C1ABC25A4500E8119B86EB3C26B8A2F3505A3E5610F89B7C34E278 53FA0A54A7F46D84A35EFEC36AE660A9E3C37EE3864106702DE5AF6C45ABF64B 888A4A51323138CE77DB935576FE6B4824B6942DF80625098CE1B5B32B234F1D 052A9D6039697118A9D793793775D8729D8574A2E74D7109C7B7E23BC5E2E87A CA8E019203952A4892544E1AD3D4EDD22971611358AB230E9A2ABDF00A288501 A01B67C42B33F6B78C39562DB50F4663B922D9BE0D8A150311AE44B83C1F129F 07337323E9A23211EE58E16043E127C6F9574019179F5635648A011266677B56 B5D0201A4E1470B952A1579B57AB2329CD4C615395023C653F784D36B5EE3672 10D191F29EA508CE84763CA4CE7C2C5229E38E241255A5CABCD6C7CBAED901A2 CA53B5E24111921CDDF83578D33D463D70EDACA0E470D8F592303FB6BFD68B4D 3F3BE2D7C5EC8BBF10C90111A33E205F2649B56E8443F6FAA6C721C66575AE12 D4C40F1F46CF9E9DA675AB5D5840D938780CD9E4AD6736ECBEB6A4397613586F 849B51048AC5F9405E03E14540A5E5582F61CDCDB57EDDF95A8C6705F433EE16 648F098C03DED8A2AD94AE3DE202D629B9422ABB031318D48F2C85F9DBFA17BE 84708AA3B6C9F81F4508F7A5CB7B6646AB8722ECF817877B77D473F577556DAA 2BA0ABACFCF5DEA7498C47328E873019A956FBB250FD9D8885D21D368FA70CBD 2709D2DA44EE7A9869963EAB48789541906DE49FAE785ECE1F18A22C7E7ED204 9768896B78E9EB7A2BD6EEC1B26083940656ECD689D92942CC8AF05CBF82AED0 B45A7DF4DD7AA6526FB597322560B9ED3087A65B5EEF1371C328A021411BFE3B D9B5088B2F1AAE381FFED52D2D1E02CD0DA78683E3B06171CBE94BE9760005D7 135893D7CC2DB097F6AC664D9594CF1C650F84DA80D2EDE04802DBA33CE3DAFE EB7A37E8AEFA4FDA6252FF21E8673DD98E67124D5DBC7BACF361E57077B71939 C1D1FB923E4E35C075CD1BCBE0E80DAEA1320D55B43EAB45D9B26C366B278782 7519FDC482D98839BF0DF2E7C3A56A1C1A3FC0E57A75CA414F6536C1FE8EB7A0 4ADFEE3BEDA0F53BE8CF5F64230784A797133E8CD46BCCB3BF38BCE38A73CCE2 9E073ADE792F7128231DDD1F63E6156ADB2609C200837C2E8A2D93D2A7BC9171 050C709A71E44E32B1B03C92EB5CF1D3BAB1C38E027DC4ED9AED633D98CD7486 3F773ACF8AE332631CF2ABE6D606607593FE862ADE31803964E3F4DC3CE3A271 C76BDD95C87CDB3B87BC26FC7A16D567EEC62E6FF0D471B4853DB8A94D4CACF8 843824F818083F10E88D52FC4253E8203292CB40F1414AE7E51DD7347007C342 CD70E8E9F2D2A13D71213B841DDEAAB208AD9EA644591C15DEB084165F9DF24B B91D3BBEEC2E34E38EF16A0C3F00700A7BDCBBFED2EC0D09601AD6538288DB50 3478B051B5E16B604A0341FE621A58718D960D699D3FAD284310DCF54EB13175 19A75A539EE98E804AEA24689D3540F0F12951A3C01FACCE9A7BAF4D0DAFA946 FF65A4D2A4C39969607272C6886F44E90ABE27CA3A1F12A29D9B32E60E8E34F0 17C5FE43D0E69A99A922D98909B2BBCD145E59A5E7F5426B3988F73B09A525F6 8BD4915663C1301323180E760BE81CB874B020FDA3AE63340E4261E4F3E4949B CC0966BDC4426190BE9F5D77F76A72AD925662E5FE1CEF9CCAB68F0BD33DA003 F11EB91AC4502FBD6AE48DA0F9D07C35B96B103E379B8A83A05FE728F1716194 1F650F75BEBADB2E3810388F3E2DC7B19F1BA9E32925F2FD9F19F4E8701F3E4E 4069125D7C401144740691E7A460021A47B1E27997FC1DDABEC5BD0EE0B20194 2D579C7D6727AA124083242BDA46D8E116E2751C5F298851A62B60AEBE82A929 9B9F2492BA35690D1EFD16215B8EF14E7A3803B93C28FA41D971B05B6AF3B593 E74AD1E68A5FCE12A86E63B78BFEA87D3949FD164F12277A4688BE96356791CB 8671C49365608F3EDECC109321AF92B4C29CAF073DA3A7D73E913D0D83FAC5EB BD884D4C686056404DAAAD6F82F94F803FA1FB0DD8908D1DF08FB87A8BB83027 04DE0CBB1C6FEB6B517FBD7CF065120079E608CE41893C2BC96A347826CCDFD5 C69E161217F2127A59F1A6F22037641613F191F22D5B4CDCBCC2EE5615623404 ABA7BE6C5FE475481615B2AC1A2412E54688DD21E44CC9AF5F16E634AFCA389C 4D740B7B51BB141BFAD1080E7C726C1606A28ED492E6BDE9F800EFACD1513909 84E98CEB6A0B7A2A6F3E1D1DCC3B2552795E0932673E59ECC56DDD37A1D52BA6 C3F0E905978AB568941A163F4CE3AAB5C5B16F86016EC47BA6F3F7AAAA77C3B6 09C8C3ABDB6D514A76ECD37C37AA88B5860630B3406B494F7725975596F84777 D9CF48686EC9C5DBCC1D78513F591C7C10AB9D153B3D41426B7BF668B0D04503 56BCB686258462C1DC61095724B9F3312316262FD7C1AEC6E54DE7E5A7BD8EFF 035299B8FD8A4A7B0F51404F4A760F4D8B4C0FB7A32FA4B2383AB6E9C78FDEDB FE6A5788D38A6701B123630C2A6D820A684166FBBC83DB17069494FBD411B333 CB37E2491C5BD035A33867A6D3A3D420CC31ACF43AA07182CAAE67E40EC63663 B678F71D4C6E0EC3A0AAF904CD3AA66E0DE5E3CDE049E94249B39A1C06E3CE9A F974B2484BB2CDA14282B9511E505B3C89F9C802218AE40D1A7541335C5736DD CD565D4B9F4CC78F3A393737EDB4FBD0DA299E21CCFEBA5478EEF013F0552A8B 0BB11FF46CCDB784E8BDCF730A16363E66572049E42C695886EAB42A9AD9094C B635DF4B5B9BD9B9AE8455DFA3EEFC77653190F9A8B1E93B7281C2A21EA7DDA9 33484745BDF7E3DD63C7AC66C286C9A5A698A5E4D7A91710B7FF943FB23609B6 4B442F83CB795788FAB5E9CF3F75D5487DA26170E4561C7941C910B088C3B86D F844B0F340CF82786A3FCF347048463EBD2006281A816627065DDA6CD4D3AC5E 2024BC96C7D896381BBB567951E7A1F29D4E95351298B000D29E5F3D0448CB5A CFDAE1BADE9403B90371C3A07D208948AFA022A69C519434B6813086ADF518D5 88E0B92072A44BA1B3EBB630A13B7AB90992E85B6D67361C8D96F3E0D826FF37 17B67E4B1EB7BADFD98D7F4FD17BECE740ADF13C141EBF0A91CB105DABB32FE0 55086D56A0D358841D15FD349E6B95512E4EDF4C430216FF85C2ABE995E4B40A A6044CC8820AD885C07E052B3F91C2E9A1D163BFFD210F7BE95B923E2500DB50 2075106DB541C267BD450B25B670CE80BCD068D4DBFF2D82634175B61FBD3BC3 406131F44C7D6F18D375D1F2270829DDF29DC14DBB58A30AC193245D18DE91F8 AB88AB548D8138605BB5A50073295534E314366E26665AE70482B890E4101D6B 60E4F3B37ABCA1346DAAE8FDB8DD9C832EFF3E73BA470E2BACE7B8515CB43388 C27AF99FF9322175CF8D4947E6B3846AFF5163E972156847F58A66660EC8A3A6 5FB47C9F637B4CBB4C73B6A080B0CF6FD1E9665E92032540570FFCC747C67C50 822811AADC404BC7ECD1673E8AA6C3A2F1D82F39430B58C29145E2F1B679C46E 94EDC711883F1E4EA84117A54757E8895A40401A26E1437B39A2F65CAADD6E02 D71FA8AF7453668DC613F326A3344F74AD7AC67569AF399385500ABDA5EDD3BA 343CC5EDD4B558467626850E752B9959FEF1454E53E7A3DCBC2255AD8F6AB4FE 894455118A61C58840CB68A925ACCAD75CEACE863D806916228F0614191A1CD5 DC9BAE256018615AA3725834519449B0A88B4F396654E74099C007930ADB1327 DD119BF799FE3B0B223E1EDA04FE2DA7A1C879143E1C33B6C6344F4BA033AD6F 8E88C33DEF1977796B454BAB2494C930F492A518E8198C708A75FFEF8C49C324 A718AB59B889DED521229E741FFE53F98EBE88B0405AD523254FD3FA4BBE96DA DA1C27C1C979A0DD4E61C3B1F4C4DE01E42F1C4435EECFC02D97994BC8AF5270 E7CB1458D76ED0229C5FFB4A23B8716018F9050970895D51722CDE8F2EA3D947 DFF374D84915D5C5D16463A6FFCD079D1ED416C4347BF831FF0C4ADFB61295DC 4D5785BB0852BF472CFC97EC174491CAF961AB90629F055E75DAA6D9898E8653 5BCF379816CAE46FEA62E7BE8E9B953466E51828172C4DBD0E1BBAD1CE28B5B1 02B3E36403BE80B49A47446A6677FCED438F01D60EB10F478C89528FA337D0D8 88D3FC123C076507ACDAF783A9A6E24ED73BF24B6E0F11C13E532DE5F70B15A0 657F5ED27D204449A841ED19E01432CFFE928E921321113780D036D34F2797DE D4459CFD15BB117B5C9745EF3CD2B296D91FAD48C80B136D94476967E255F808 AD2B5D522ADEC64176833756510391815A1D4A8DA1D0AEE7CAD36A1D161889F2 3347D5B6BC503300FDDD48F594F391D5FB42C42113C538E707C16EE24A3F375E 7C506E8F49CE50FF9DEF3B4A4C1BEB3848EAA3477349833BA22D2A9012287D8B A8C4CB4307A1188ACC0E6E9338E1559BE5FAFF381BD82A6C71C267409468B3C0 2C1A29F4281D565836EAE57F680490FEA4A952FF64C8CD11C377C294DCD1EC25 CEFB2B6DCE959D0208F85B6E32E9B44FD455F9B134A5306D95EA29F37BB8B86D 9E592159338E1293F449380E13C21AE42E6E371B75D78AA87381B96012E722B1 3E1628DC89D9009FB38D9984AECC3367A8436F03DD58F85DD4971868D7949185 A1073DA64020E32F61C371D29A74A3D9B70EE7F05073531287B2243D355F2FA2 FCAE099817F63A3235CF8AD47382886B3DCC93B9E205EC405ADD22C031A21714 FE178378C5E228BAB7950F3FF40CB589F4BB895CB7D6320A1E7D608276EFC3F3 148DA7EE00DC79E33F1B3D13C0FC26E0424C441C55AE7E3153411881C628B7DB E25EB59D686887F5F66117D601DD8B5EFED15B387372AD0BDB339C9A3D9DB135 F53F30B68802D99EA4ED900E6A375018BD9109755FCF8B4D07E1F717FD46AC4C CE5D401AA5635BA4F8BFBD4488691BAFD8B51A85A2F0180FB9CC06A6C5DAEFFA CAF15F4D81ED657F9A8D619150A2C87A20879403F7E9469AE85911988ACCD635 72599A7AA62EBDA42439FEDBC602E0698318FFEEC8EFE7DCA381A7F2E21145FF A5549BF6B3BBABD08760336875BA183FF4FA92D4569087FDE0AB50E0B2DD97D4 DCE9D3D6EBF5A1FAF7C0C4CA715A6A6BA67A7A08145F3D9545265B3862776E4D 179F3FA9B1AE033885A84C8F91F20615521D85E69BD951B98580E3873206DF82 AF43C6F1C8D14BA99D15F71E588FC5439AE3E6B1545591BCCB19B119AF4F4362 4E93255B5034ED730A5B3E6C42C7862662D49A8A4E41FD9740AE6766863D5CD5 2D8E54C0CD96F5A70B88B015C76E25FE4017A9F55256D3E7B3F0F4F94C90EBB9 0D67CAC1F26311AE82B804F8A2426910C18253743ED4FE97B183F3F04471D7AA 8FA7CDFBE63BEFF13C451E52F0137E2D0079D4DD39A80BF5A1E253CD09AD807D 171B398CB6A28E9B6B7953ED5077897E1D740360E8FE61328BF8AF332205ABF8 C5F7964B 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark {restore}if %%EndFont %%BeginFont: CMBX12 %!PS-AdobeFont-1.0: CMBX12 003.002 %%Title: CMBX12 %Version: 003.002 %%CreationDate: Mon Jul 13 16:17:00 2009 %%Creator: David M. Jones %Copyright: Copyright (c) 1997, 2009 American Mathematical Society %Copyright: (), with Reserved Font Name CMBX12. % This Font Software is licensed under the SIL Open Font License, Version 1.1. % This license is in the accompanying file OFL.txt, and is also % available with a FAQ at: http://scripts.sil.org/OFL. %%EndComments FontDirectory/CMBX12 known{/CMBX12 findfont dup/UniqueID known{dup /UniqueID get 5000769 eq exch/FontType get 1 eq and}{pop false}ifelse {save true}{false}ifelse}{false}ifelse 11 dict begin /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0 ]readonly def /FontName /CMBX12 def /FontBBox {-53 -251 1139 750 }readonly def /UniqueID 5000769 def /PaintType 0 def /FontInfo 9 dict dup begin /version (003.002) readonly def /Notice (Copyright \050c\051 1997, 2009 American Mathematical Society \050\051, with Reserved Font Name CMBX12.) readonly def /FullName (CMBX12) readonly def /FamilyName (Computer Modern) readonly def /Weight (Bold) readonly def /ItalicAngle 0 def /isFixedPitch false def /UnderlinePosition -100 def /UnderlineThickness 50 def end readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 11 /ff put dup 12 /fi put dup 39 /quoteright put dup 40 /parenleft put dup 41 /parenright put dup 45 /hyphen put dup 46 /period put dup 47 /slash put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 56 /eight put dup 57 /nine put dup 58 /colon put dup 65 /A put dup 66 /B put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 71 /G put dup 72 /H put dup 73 /I put dup 75 /K put dup 76 /L put dup 77 /M put dup 78 /N put dup 79 /O put dup 80 /P put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 86 /V put dup 87 /W put dup 97 /a put dup 98 /b put dup 99 /c put dup 100 /d put dup 101 /e put dup 102 /f put dup 103 /g put dup 104 /h put dup 105 /i put dup 107 /k put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 113 /q put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 118 /v put dup 119 /w put dup 120 /x put dup 121 /y put dup 122 /z put readonly def currentdict end currentfile eexec D9D66F633B846AB284BCF8B0411B772DE5CE3DD325E55798292D7BD972BD75FA 0E079529AF9C82DF72F64195C9C210DCE34528F540DA1FFD7BEBB9B40787BA93 51BBFB7CFC5F9152D1E5BB0AD8D016C6CFA4EB41B3C51D091C2D5440E67CFD71 7C56816B03B901BF4A25A07175380E50A213F877C44778B3C5AADBCC86D6E551 E6AF364B0BFCAAD22D8D558C5C81A7D425A1629DD5182206742D1D082A12F078 0FD4F5F6D3129FCFFF1F4A912B0A7DEC8D33A57B5AE0328EF9D57ADDAC543273 C01924195A181D03F5054A93B71E5065F8D92FE23794D2D43A151FEE81296FBE 0CF37DF6A338C826464BA5198991445EC4BE80971DB687336AE8F74B516E333D 2D8AB74D362C559AAE6ACFAE49AEEF4F52E28C869222C1301D041E7A0BC1B608 1BF728EF9E98F3A12EB2714E7F16B14E055FE1FA0EEFB058860ACADEDA9D0E4C 42E3C6F1E4869471BFAA3760175F3FBD842755A9D7847EBF605F18293B42F557 FBE2715002669091BB033E1AAD657532F34F7C66E4F04D63ABB07E6CB9D9AEAE 78EDE8B79DD9BC87A1FF445EAA05B5572BB880E69F4DE1F82D7F0E9980AB0C18 22C448B0B1722D3CC33C56FF287CECB80658B3AF5E7675BE82CEFF3DAD5942EE A03C955FF979E41E54BCFB5316A9AB8945C403A73180D0961416EC9C92F49811 4B91BC4C788392994587517718521E416D469F69952149FF7F9224377EBA1065 4A727BF806A112A7B45B0A1BA1D5A23683960575368D9EAC8C04753BF7465AF7 95F25C258C63E4FDFFD0B412FD381946AA38C0B961652BCEC30322C47BF4755D 9F91880688AF066E32FFB22E1A52DE741307AD3ED830D6BAA1D1F562919666DC 5E8FD9862AC8600B0AE0BC7FC779252AAC57248744ACC8A8AAFA836BCF09B0DF 9253DFBB1CB77EA8A59D42D1B18FF25E9AED72FA62FEC3F126F030F5D7DED9C3 CF60FE890BA4A48E39E687BFFAEAB96AE542A6387F6624486037C8924002A511 BEE5FBFD780AC1D4BEC3FBC47A930BAD0280D444259528B6C565DE11DE36BB65 9BADC55C1EDA1A80458E98896D782DFB5C137897419602809F9BF8CA39F00C68 EFB9E076FB324C2963F23CBFED28B9EF70EAA4E4B903225D1F199A7162AB239A D92D71C18B1B682D04C6A48926275BCB16D413B2A0E953E1257E0B12D8B717CE 2EC84CFBC046A4338A69F454A469B12118E562B4F56C5FFB3CA5D357513E6FFE 947A564B229C7FD873057D5C7CDF03E958294A1003B37D8DF565A70A00A3734B 0138AE5277D383D10C2BD853EF806D3CCDC47739F0E374A3DF3B63638B949ED6 4EC25869DC1C0B1F4DBDFFCC97382841D8F10F3635C792139A1EC462FDBA379C BE0990CA2E70FE73137AFBBF30CA54954D7E7377CC50BDD780DDD4C7FDC77AD2 F3EB1169F14A0041F18160F43C24FAF556DB5D621709FBC544CE55424F7446D4 6AC07A51C8CD5161AB0AD5084A96FB35D77F1CA155147DEF8D7A590EA6939514 D4A226588295CE0007BA8A550895511C8D80BBE5CDFB8A50D249C3BDCA974415 F5557914A9B805782F399E4078DDB6264F1A49A9A5BA45E284A5196E9828EBA8 481D357B8D9E6ECA631A6204439FDFACE7D7E6A2392726107CB7D2517CD19A24 FBE592C119626DB221BBB635B6EB84845C16A9585282E34958B961F4A543AF9D 419B6A9105BF185FC767712D923437BE08A9C0EB92AB6792DBDC671029B6FCA6 7F717FCE379C0F3B51C6CF042A762ED04898FBB4B0105C3C4ADDDC18C51BAA3B 70A93666669547081D9246732CFF74C83EE90DA17F5B4F8BAF47FE4D81590988 2858C9B96071341FA0A0D23BDD4947FC9BC2297913CFBD4FD6CA4303AB3179AE 0203F1BD502065F90CE9BEA3B52DAFE4A29446082EA0E6B1D7AF1F31D0AD02CC 9A7FACE2CA86E5FE0F6A425B28A5940ECA306891CECDB3CFC7A5BBC76B5D9E8A C754379ADE80B4D72CE493010317BF21A0CF4A0A55C1246218839DCA3F4D626D 1F4161D38F54AD5142C1CEE95C61D8BB10FAD4B772F4955777AFDE8AE5A837C2 A2BBB11D0BF5DA2E63D0B75ED421DBA9C789B281B01846B65DC572BA69591969 21265DB722AE86BD8CAA3D887C975A617ACEDDFB7AAB341F47532AC0F354A530 7662C089DA3939588774FFA16FC4A52555DED6D6F51DE718BF5F345C23C90198 17B77CB8B5D53A5CE7A79F3E286B6A59F3F6178AC8BF15C0A15C1A8A95D03B60 30EBE53DE328CE085CD9A1D49C69AA299C5B58B24334A546F6E274C1B534DC8F 3289553F560C2F81E413ADB92FA0E7DD1C2F39D5FD268EBA97AB7335ECF28257 96B4EADB7D0778706CB41C7E9C882760E7670936774A1088FFB2011115FDADB3 B69EBD5108760762521C25C968C3E282DC3400001AC8FB1EA27FF643E3025950 1D617BB8BB321281708E496277E11DD3AE0023DA9F25AD06B39C7CF527FED27B 57397E88D3DF70EE4FCCEFC8A0927D6B05517E571B3E70ECC99F3CBA32CCD4DE B8BF22626B6C94FE65598A88AB90D238461EBD9A098DADEA4091AF1CDD7560EC 8E1B9BC2321686E1759E6B8A270C8CB4A254F7368039602EAEAB86ED21CDED91 8F2DB9889F46981C494C7EAF5E819B91C129F0740B8002B510014985E5791F59 B16879CC6521D8E9F1C4C1890AC85A78022BE614BEFF318AB2616F0C3F02405E BB425D1555472A2642BA7686E431DC3FB8A1688B76660D9957C3FDE8D58109AC 21B1234C9DDF3F0FAF93BCF7B2F88A001F23162E1A13E5E9118D51B485B70A91 D0CBC39CF44413FD8686D9030782DAB58064F5B987E0402AF5B264B17BD31BD4 FDF63951BECD73ACA6138854EF35B062D01F33073850D9C09A818828C581241F A625AB3638081DD0F00F946BE5450D38489CECEA4E66B4D85CC8AE0157E2AEE4 A22A9313829F24D573101D84CC1784D1CED7DFAD5DD966601370C6CCBB723082 A86BBAF0A5D867D0D2E3CA16E14E5109A29EF02649C47E12E88B3B397D65CACA DEB9940B92100744D686066F8250FF30E5F13D81428EE238A2E4E07ACE0F5C38 7D79D4A336D0D26AF9C2B84088ED8ECDF94A1E3FADB45AFDAB46CAD6FF950B0F 07AA2CDF82374DA76C56D29C80138841EB13F0D02ADD32F88B23E282ECC845F9 BB9AAECE9CDC644AC2D49577A92307A83A99434F6493156DF25DBF0FCF2EC21E 8C50A312C3D19E0609C0038554CF4FEF3ACEB7A833FD54B06EF0D617C2971C89 E4C06075B09B84A4F78A82152B9A9C540B1D881313C2C74F20ED064A9606EC2C B56D7BB4797F1EEF4A9B13579CCF311FA4A4DFA62D80FDB7F535CC6526D1AAE5 45C008EAF024B48C377522F74D939A475970533E645B1BFA81997549AFF26F67 2AAE6C2EFA357DB3B525276EF330905688777057F4E4CBF584520A534A8587E5 5A8360891E75A15205E8ADAC4A4E5A6E27D0C4A7D492216E4BC023AB027F37AF A8DC7579BA50204D5F45A51460C5BD8A5A7F87668CA6451137F2F59E117BBE28 5C40820882A5546FA76F0CF49F8A6EC445F0647CC3227C400F56E7E9B84A6975 E85E243CC1666DBAFF4E07EEAF3AF71BDACB30DAEA792F2B8504CAB071544F01 5D66243D529C479D276FE22F7E275D9E7FA9C6EECA18716B2F213916E32C1D94 6E32397B41AC6779543218E506569E3544803BBF9B404A983EBA62A494187B30 8D3DFA4E1237A2E5E08224A60492C09ADAD8775B7CDB830520829BA164209ACB BCDEB2D574CEBFB7AE4BE72DF4EB1945FEF2458761AD8DCC0D378AEB7DA002C6 9C14A665DAAA532B0ABA98D7BFB5A6151FF6703385AF7AE8FD315A492FCCDBCB B825707F9566B3B4943A3C61C3DEFDC31A843A2D67AB06891F3E110DD8C73D3B B5E4151B51D9F13905D7D94DB9ABBFCAF35F43B6EEE256B1A80ED6D1739D8D5E 8C767F6F0E8704C5345D028A2A6DAFD9BB7AA048B8B895FE9423A7ACE858BADD 595CB074A128DAFE08FDFFD6BDAC0114159A702FDCBF8013804B0CAEAD7AF38E FAF086A3248AD4FCA1401A85AE2F72E3E6956DC0996FE8ADB18F89B14A208A15 13F81AF73D0DB72F78C4DA634ADE3C73756CAE6AF2E149C26316DFD93370BE1A FB4A79F77A67C07CB0A53C78367F21661D4AFE9E27328E077B522B50FD9AE2E3 DA087BE481515B5DD7BF894A96A84A6C78874100505B7DDE1D22EFCE8D58B3AB 313AB5495F72E2CA4E6AE22C0CB854302B9990372F1661D9F0A517F90686F248 C5643008B3D29F7296E5C8FD4049886662EFDD4106E17C879F5D41CE84F87E89 F6A3117C968B95A35940CC29C43E1E0DEF51C1E46B676301F40D59615C3F73DD DE37B72FF7105DB84227DA5241583272AB1C3CD97AE11C1EE98FFDB5E5F44844 8FC41BEA5C54B26341AFF6830D9D0A5A2901B0653D8BD0746838194D240FF753 E99750D3383373F453723D86BE97B571B8B84D8696089B5CFDD53E6C562A2197 A8C4FB0CC690C27761A816B441029D3D306245052E0C41B53025D8CB7267CFE3 C17FDFE348E765326F91AEB700CC49162DF748171214252CBC821493DD01AA20 417D66DF47EBEFFF3E9BB2B0A2BE7D9B8C68BD570FC2EB0FA54CECC318F04C43 19598BDE93F2F13DC7847354C99059AB20593EE51E94F9D4E9241869D605AAF4 9D9B5FD88C3798A039A67993C5EC68B6326B132E647F67EACCA7F7AE7F718D85 12666E90D7C73EF210E344964A38228B236679A2B18F5E081234CAA2458F8D83 3F0CA308D19663CB12EB904076EF88E556407C33C9380A6A3D68A9EFE65387C1 A1BCD2D26DFD2AC0881EC30E81C0A4E76C244A2BD822EE88C4A60B480D107E68 90E419A1F512E865BA922A7830909BC2611A80931CB2E9344529586726614D94 3AC5200FB9FF68AD9686506C5EFA8788C0AD0251AFE7F95E84683380CDB421C5 B1A783B6D5F3A6BD1BC1C14B363DB01C87C0796DCDD5BECF41A1A9F43183CF6B 82C2AE49F0BFDC5DEF7729F2E638EE6EA9E4D059EB9BB1B992AD8C82D501A550 1BF73CBBFE740179B54E193E84A55DCD61B343C1852780FFB44248FC9426AC94 AA2B3FE20FBA30F6C4D1E0FF3EDCDD8C0F57CCB50CDB0EFE2E04A8927E239C1D 9B026C7929BB48461D4D695FFC766C8A0E545B1BCC2AA068D1865333108E7985 2D93F9B00EA0A90939D0D3840D59B6CC0CE2C147B2E1A9A4F14270FE3ACF51D5 99F7349106165AD627CBBB0ABA01ECC6D3A14C1DC1ED23A9DB9865BB4396C51A 31ECD001EAC94B33C34E29C5611148EF3E55DD61813470B8F3CE32564C749414 3C93C77EA5A3538A0B5AE3FC4DA32813B06772E0E48E25BB39F3F6FDCC077E86 F86FA50E18FD19EB2F37311CE87F18F3BC85CE7FD71CA92D5C3264E34E04A2E5 70C79D99F54D6C6D9D527AE45EBB48411221134587D2253E7C8ED7658EDCA34E 5E768DD14E0200470F73C44D006CE8CB35DE1CA3EC10ADC668B0662A7774C891 84EC95A31DD872F0728D9F65CA80940080E04630BE4DEC77A2C49E3913C39978 BF145F8832AF2C4385EBCDB15F9D32C22CBA0CF950877717D6F1591D7C0B8047 8C9BFCB16AF7124ED83137695F3D69228DB633053208C29E0ABA1B06A7FB3EE7 5625CB44927E2DA6E038A6E62DEBDA2D96A03177982D8FA33BAAF4426E05F4B7 9C1748B3FF7691F9888E7FF864A10B9DF761A41E6B5CFAD2BDD7E1C4924AC97B F4B352705316DD1A58637CC12D71C18A5CA691AB2AA8F171590EC24582B1123E 94D4DC587D8F99E18A711776BF4013C96446BFECFEE4C809EA94B169088024DE 0CBD20199A915AA406F0BD5F3D63D1467C49B4691AEBBB35ED6624F2D7BB74BC E80FD92B9FD04DD9C2BE9B6FD29EC7EC07FAB447511C61DD299C783BC09AE2A4 7B3CBCA6A20C6631D06D0B2E2482A50612BB7C29B7E7D0A205EB0E8436702581 596BC996ABD58CD8D5BAAE4B1478195CAFF98FE0141287296C4EFB8D2E7A8442 F0A3AA9F9264329982532295A176BA1867EF732BBAC49AF485D9D0F7130F617E 7F7DEEF935874D55A22240F8EDE4F247D5F73481373A392D40A8076BD91079E1 1CE5998BA13D48D56B49A92B4A18430E316405D2E2E391B496A1934671FF1785 AF42BA3B2D14B8E04014437FD194455C50289DFBA61B5C377BCBDADA48E82DEE 4E70EF5E9DC03064907BCB8BE4D59DE069FB0C0CB140DA54708E630767313F9F 744594AD8A499CFEF733E640A11FD74E46A749F9C7D18D49251BF85C6EB4668D 67598C31A8F90922FEAEAD4B83B6E7184567DC798E4BA1C4C9B3461A478D63CA 054F13B502DACB674EB49D6BB935E5EC82BF99FDA7D47C581AD7F940DF4FC6FA 6C6D25D647033AC69505F0CAC58DE99087F365531A6283CB89CB644688963C3B 8B2203A94294E58739EF23C7803630A1F9121D62BE1977DE2F41687C8CAF87FE CBD7AD3B98E0D95C8C6E1A7CCB0E09465AA874DC90A0F5DB2C5E7C130297FD39 EFE63B0350B5139D09E6864D22C3F1150B29196E40EEF9723E71158B7ECFB8E4 C426FEDCD439420B7F1C251FADA347C9A2C49738B5A17922E1EA93CA7B125B76 57449EAA9C1D591CAD327D0E98EF2D44D614EE9ED49DD31ACAC0B956620B6BA5 5BF6D08CA7541059D5ED2EF00AE2EE95488F5645BF6837D9241C0D3959B7580F C9ECB2BCF3E65C07D52EC9CFB21C11CD4C883E44C173214C900C44D2E1E43DD1 CE8DFE3DA93C38B548BC4EC46FF91F30CFB97525E1FD4E77686433B20BABF8D2 848C1CDF1BCF185CFD7A81D2D4BB826E837E2AF35CFC4F419F698DB0C43E9F9C B0FB628AC9A3CBE9B1FF4A067016E70333E78B32AB2D89C483834B31F5808FDB 77492E099F1504DABCA5722C7860CDCEDB2DDEB512FFCC7D287F4945FD711F28 87BC3D36173566B81FC2C1290C717A09697DAC6072408E20926D39270121CE58 3EF97CE12EDD7F87F2C8CFE36C3C0400869C0D813B71C425343EE0CDF717BDD8 409D5297D0F8F7FDEB0257C0A391F5635E0DB1116058942FF3E7C94D5F2873A7 A3B0ADAFC3835AF2BE474E6741319BC6695FB37F59AEE388F81F6E66F910000B 72E6BA7531B4378CEFEEDC79CCF4947BA1703823B5AB4F4AD73D9615C66C489D 99D68E49C9BF765B7FC547BAB9640D51D5A7A2396507AB5A4DFF3D14F52422CD 8FCFEAA06A56C6C7FFCD29C9A7A59DDD2A909A9363FE5F1E9629616D25ED38CB E754C059E4379318CC491C3B1A90128693AC53F80F8210FAEA7EE638902A7D3C 82B95B3F5AE340EC1B648DBB9FB679D6E80B7F426D8671FE7136D97F51E2D2F3 C9CE9183E4061CA40091A2A70DBB9ECBB19CE3F65ADD0FB346B54BAB182E2CD0 EAF4C0F402C25573FB344EA771B297BEB615FCD0595172E84ED2A62FF8962634 23C19076C2A9ECEED5135994EB397303A9619C76DC55E032DA83FBA441BD484A 59F70A5110A8927F6239A14D4E223E189A5462E4A92EAEFFA4B961A2A32B320F C2B4E8C1821FA67A655B5042C15E4DE1FB3652B55078DB123573C4E986B19DB0 1C5131F3DFAB271C30A5476B4A19D8FC922E31879C34BAED94C07A4841B8209C 403369FB8E842610D1EB4662B6171A4465FD0E819964F62EC5B0ADC92F08CF90 1DE0B410FFBAD16F6D355E8AD72CCF67961EDB6CDA82398021007C2D0462E893 75EB0710AE4A6CDD15077C9DEFC5774EF4A657734D703CE42174259B58E5277E 0DF26BF59AF8D1A3E7DC12E3C12AA4B67CF35B19962F6950C2020B698D971B35 82FF84E72F72FBB0C54A112BADBAE6C4CAA358BDE6A705AB59332C3850CA3D25 C7564499BC1319121CE0D93218210C68080AFF33420E3CB3A48BF9EB66BC07C8 A79D8CD8E78C200FF7CFA3DAED0B9E87E6141C88B436D8FCBA50AC195FCBB9BC 9512B95FE3A37FFAAB39850FCEBD4D50A243EA416E73F53B4B00F3B6EAE0CA06 0693AFFEF215D00BFCAD02E45496D7C8F5E99EB9096FC4300D038C1AFD31EC4C 5ACA6B72C1BE7204E37A4CBBCB1EC26AB87F2FF82DE20601025169A5FBD2D060 62B5B2DBC288C79C33B596832AA18D730AD572C6EDFABCBD36DEA87C0F323C3D 6E537AD3B43C6F3A905597570A8C6B0B4A5E08C08EAFF9731E745F2BA8ED0C0E 1ADF7821CFCD4E38F3F4C243CAD31D9F8FC68B9043740852B4CCBDD37BF728E5 648215961FA82A0C847ADCC5187331D0863A4573BE520C02CAE14AED4F06B3F1 FB4A318AB54CD86DEC824707B29F858FD726A167F2333855C0575EAF4EBEA0B6 754B1775F967140641FC06F82B191244186FF347A351FBD8FA62E8C978B21F6A E124929876488AFA97FAD1A68A0C3496BCA768F4AF8016D7A65BBA3AAFD7F5FE E75FE714FFF3D54D09C9747ACA01CEFD260985C6E87477C9C7843343C7E9E3F4 0537D461EF019E046DB8A6F08DC7B007337B688E610C55A35496196C01E6F8C3 C7ACEA49F6AFA7FD9CC809E9916813F64BB5704664DD21422F8F32477EB874E4 D86593B4D4050C116B8861EFDC6BE1ABCBF942F0BBBF4E4241C418DD1263F252 B16F904E5B650CFC5763390916625B28ECE4C39C55CA937E28093E66A9837BBD 98666F090E8E06F1934736F800CDD0E78706E3F1CE6D2EE55CC48D1302770DDB A139EEEFCF8353D4473D89EAD552B810E0F1737A6636D15265E0FA2699BA04F6 FB68CAB1237E29BB528DFA4F5FA91D651DFB030977585D1BCAE3E7E4D8CE5C9D 7EF3F0818C89DBF49334C1EAB88CDE3679F5D99AE73789CA43DD7432F510FEC5 64946ED2737E35744E2D6B4B2018C8C15CF9F23E8707AD638C50E214BFA28958 1DF5D70CDC4C38C41B7245F9D92ACE89EBE7A1FAC55B19122391382B33F768C3 9D6EE6CB83A7C18813E56E02896B1B34D7CB8D86B463C6D17578F64B3A758498 12954761C3B140EF7BFF72EBCA30E296D4F8A6A918191C2733D368D30B7E9B47 29B6F2C6EE5FD0F73FAEDBB6112BBF87107BF9D3008CC237496422661F2D30DA AF3DE2F9B92BADE1204B6D3C502B44F079BDE6DD16A634FAFBDC16C418B96349 1C8008696A2ED650B201F1DB9F10B4CD2F22E0601AAFCCFED995C712D4FBABAB C882338686FC4573D1516E7677BA3301D1A391C1223C1EC0FD493A28F897CA3B BA7BAE21AEF1EFBE4D70E95911988ACCD6357223C8DA884492A28F32B3767E8A 6E4DE35DB7F2E33CC9D20E19E2E76B64A96A3E4F30D41F1F583AFC672325C5F0 07DA305F63CB575BC51711EBA10A20958FE804BD185932B0C7E8D93315E7FEF1 C2B76878D72A3D9A61948693D19A67AFD5151A85B694B0E3B3ECCC3A1576CBCD 2CFFCEEC541EACA75D52CB0109832D0A1C99A3E4816F5B6899F4210A541EBCEA F1FFA31219E8DFC8CFAF0A309BE2C98E9E8F8B838E168B0C58093AB5AF57DE0F B4DDA520A169982DC5B3F8E4E382D01F4971331D6FA1CFB0E481A3ECCD393D74 6DC2335CAE00F059F2B86BF2E3AF6FB34009227246B4D958ED0CF8CDE709BE58 21CFB8DA9DEC4F1A9A23B555B7AB66C4A0D5946AE373FB1BCCDEDED21D95B434 9B0854EC632946A814E3586C10BF0516D47B8FFA4821791D5E570478A87077C1 73560DA9976B306ADF5DE0B891000A248833CBA9EC0B71DD2E52616413DFE681 CCA597A28460F96C7096D87868C7E2D38EFFB186455BB3FDE765C6E0566B7A7A 1B7D5F88B386F94D28587B9E44A839075A6EABC8BC217FDBE30FDC4F055167AA F4A9961AA6616D1124B27770B40F297EBC33A0CF2B625CBFF10A27E2B9B1F8B2 0F723E7D0584333E8CDD2A47F15F098F242AE43FF4E645E49C953B05BD935384 8F54E90486853156043B0096E3271633160E108F712B20B39F35E1366F728DD1 59BD1A675F9F42C811545EC3D367EF7F84369E53E6C63C04DC71C8FC578E8E7D 7584697514D10BF89A573BEB2136595C3EACAB6E6F786A20316B992FC810CD7D EBAD5A6C99BFA1EA394E5DEB1F2C39F1ED7AD5785E581E125EDD2424051D67CD 3CF5EF4349B3091447823142660D2713BC03510AD7BB1B282F41C18E05866BE8 592E112B33711043EB837C589B4C2DD401DE948141981D459C4A3C8B97DA0DB1 BE657B9710C8C1FCE396D4D0720975D3353BFC9987F5D0D3815947AB1800922C 738A88E22AC372C7B61BCC68EE3647410AA0FC495E6C9C2CD314C668AECBFE1F 62CADDC2C09F8E9A4E6522DD36EB90EB3733E70225735185754454FFCCFAEA96 74535B16CC24105ABAA802444D40E9EF96492EC936E8721550729AE5C0CD8344 16D0AC1D16D37B63AB62B09EBC8DE5368AE16C842675AE4776EA66063B96F015 59756B4C1D7105FA246310F1A835FE299AEBBAC290931F8EB632FD32EEAB96F7 F8B5CA6B16731BE616D7CC864B7F781E51764914DF795B08C7E690D1CF903A3F 457368EDACF59C3F163691B87FDDD7D39CA04F7DF56D6FEDB4C0C2EA7148DAF1 EB7B475ABB35354DD49E4BE90B856A92487C6B4A1F72E76A2CF70D626A156C70 28557CE8C751A649A620238D6B76F06039C725FC4FDDAE4211FFAA8E04ABB1E9 5809392E1C559613A6C5684C9BCD0BB25E144C71780EFDA18DAE01FB4B0D8197 B8EED3F4029A003E6B1026B21FCC8B9D10C887F13AFB0A5A71910F09B41A4FA0 1DDEF0892D103EAC654B8CA4028D3F9527B930F4CBC31A00EC2C5CC46E1E3BCB C53DAE1343C4DA0BAC190D0FF99E349BB7CFF37413D1CF6D75939C668710D787 C0FD1A531D923C598EF3DB58679FECDA7B0FC6E6F8F206D736727F16D3EFFD21 E66E961027A343146106BA16C420B92EA1ED3CB27F8027DCFD49701512B92547 DCBF93F35DFC940DF8A7084A2B53F280AFCBA00234CD1E0F81EF0E716271814A 072115E1A50DF4F1920A1CF0418049EFB6873F3356A6CBCA578B7DF1E0EB104B 25F5F378883C3FED59AB842DCCF410261D6E5D7A138BD0D7B7F41D536E046342 A44E469BDBD7ABF3667674E5361CAE364147735244804783AD09C38E6B32443F B0269EAAB8786A9A827B8EA80FE7352771B430EB60B9957EEAE2048EE60AFA88 8DD61A09D8787F22C68C2635AA18D6C51D9DD3D3A6AD6D4EC84A44AD9C0F4206 0F65E9B8C9EF30965B4016DCB113C24CA1A34E470D44DA36669BC34B89C469E3 E57C65B6AF073FFF4DD2E5B821ECDE0779703BE2C06CC8B308AEC8DDF7896D86 59B3EC3ECB9D699163A82F5656BA9AE6A83D5A50058380EBD27BEDC9C75B660B F728B176515817BDB4006D332D2B3AC9DC52337478F50B789DE88B9F2FA97079 31B7AE43ABEAD548FA76194E9360A35E8EAD1388A801BBE603B39166997F86CC A923E87E2124F8489E03B628B1E40BC281E59065C0586EC504E38362268EB9EF 2D67C9FDD556E13A47EF223B186A2F64BC7B79F967C51A6C03DA13F19DB5F768 C7E983A3F75F99771AD574F2CAB2D817810BBD406EDBDF60F23DB9B2ACBBF35C 25549AFC9C54C431975A51E92DD24F48560DBDE742B360F24E85E0BD6CA7DFDB 70D9A45A8F1AD21976094FE996E2F26A7EF3BCDCFC18F77794195DE199C7E82D 6C173B49407FAC50116B04C25A4E5B3F2D939955BA1066630FCC35FA9D7A16E9 5CCF342E3B821279991683A1F0DCF2E200EB974F92F502F501969E8E0FA31A02 A8FA282C5209B531380FDB80A635D66BAF7D962F7E7B59F5647DC667B4BC8961 4D8951D8B316335FF4C864375E490A261B980EF84D5AA79D77086FAD38E4FF57 827914543CF7FBB28457FA66B1EE122379F580300F7CC38B20BB660BCF4C41B0 AB422E31312B318EBFB174A9ABC8DE86F82CD7545387D8D2176685B16762C2CD 7017EAEC5C28C0F1FA53F4912AE56D5ACF9AA86DB5EB0767499AD6780BD60218 CB8FF23BB2DEBABBF02EF4E19AE8DC824C2F71AABB90942AA575246A647A4EE3 3DE544D00F47BE571D17CFA4FEDB8052C4A6D8B1982931C5A13C56D28DCC98ED 2184B048B50C611DFD6528FAA755BD89E615C4962CF5F753B1984A9149C731CF B6742E72E33EEBA9C102C40045D8DACA7A1D2764E5B788D3C1F2C766F9CBBC98 CA005ECD69DF4F1D7DACBE6EEE980D640ED0C106E91E475FE37E762B152342F7 DE01A2A5E69C56F8D7C30D73A2BFAA6A01965A5BC4996658C279C003FC621A36 0BB44E67A4CBF17B68B69CBDD80118E3777B53051C38931569B6C708C7EBCE0D 55D3E3CB788B33C05683CB186F31973266BA2A4933E3A9A4CB507534520DB01B 4C0C2996F8E1364E2713F2D404E4447FD064E97912830C17566C309755D7F188 419A2A3E1BDDD35A4F7C18FE16C099619C1489A4E37C8EAE5EFDEAEAB16E8864 B4AA9CC7D877DD9B53D58FA6731161818E539638E68A8BA00E398B7ED74E487B 6F6250BC2E040836A2F416A398CC5E1421627185E81C339B4C1DA29216FEF0D1 751F4377CF1D9A9908C753352C37DAA830986946AE0D1C16C51D67B6666FA9F0 333743B4AF9F336E0B17112779EC035DDBA628E610B66A90947A2E75BF7A3EE5 0B3C68FBF220FD5FDC432E2A390BC6D89F89B3258F7D29D8EF4645B1EF3EB927 0EDD6CAA0D73ECC3AA07DC0107064CD29A6AA0A27E0A89A41BAF8C47A96D8DDD 4BBBC4AE18BEE986F5F63E7ECDB6E2068EC38F13D692B32490A3444CE4488A64 87763B130EA45715AEA8AE5FB3D0FD64E7DBB687ED7F0593FB3A696C73DAA826 A46ECA206EEAECAAF0DA0A3E33B7B73081A375E3F67C0E9A991861545F17E7C5 5EF1207097CC2B5EF951F9F55F477210DADF8C252D2D58250FF67D456A7E7F5D 7B3FEA0DC94C1EA62BBBEC4AA866ACBBDC17575C08BB455ABBAE80D3444A4F36 BD75FA9D98279315BF0A66192595794E7DD746EC3C0E5C70EF9824D569A8C4D6 33514F324344A70B9D4C28053FB2543AA58DC7E709A70673EDA2786096F32EA6 0D9F15A0C4B334DCDD35C659542F065668A9D666F7CCE24369A6BDD5E0501B6D 6C8F5E7921EC7B2A966800F50E63056AB66DB66710B5202A967677702A75D372 15F95521CDE9BA0BA6E3418C72F17A256B3E4B30C72A962207044FC299EB8815 ABFD76B29033F51221FD815976F2F9F02C0EA898124BBCFDFB428F8FC3DB9E74 1FF7A830B7E1C7CB0805216322139EA2098C715DE806CEB70FF638306F6EA11D 1B6AE6DC794395C11CEDA7F96F9E48C2F365DE2D80D6AF3DDB7B3D484BC5BA63 F3E93A17A7A1DBA8E3D94567B08C5AB90578596CD5AFCCD414F10E404EF2F1FB 65E9EDB3CC34642B6F80FB7F60D98863339AB4FA1F47B6E94D7674630D8BF408 4A6E4127AB9A549A1C9C203DBB6B1B15FE8706F9BEA44026F2C011F717F33815 578D948FDE2E46B6C59BD61CA6375E441AEC54CCB38D9DA77481866003088ECD C798A14E0AB713FEDE8785A5FED8F2C7493CCCE9F0DE7FEA24FD640BBB11BFE4 D91895527F3CCB39FB702694D50B52AAE681C793493278C719DC5993EE91F752 E1034F3D9DDA55BC51BEC2FB8CD807AEB173E0501D54045F688A55E25ED208F0 D58EDA80040EBC93B8BDF6918D1C3B35C55929E8A98A21BE6345DE8CD5292E13 BEA214A9FD0FBB725147F0925CA143469405088894C435552C96069CD69175CF 7FFE0D07DD81C2288AFF9E6F5A5516C052599E582DF0DC455AD667438BA261BD 009DC7A66DD2A52F8D969F1C516EEC72D92E8282C33875C801DECECA7141245D AB01A7D642C9119AF7A3B6D101830CCC7C6C44E1CB4165CD34199517368DC705 864DF030771AB122C0B148D10A426F114644B2D6FA2A4057220EA8BC2AB71B02 C63D6699222A1B8D31B058A8E3A0E61D5B4C317939732AC00277461CBBF8E662 721D302EB956808620610AFC11AC5FF0A590473E5BC98F2D35AED31C0855B15E AAFEAF7C70761E822967AA670384CE6CA1AE967EFE4ECCAE8FDD31E56035AF38 732D5D5A5FF9EC47496E78575A26930C3A4DFCEBF8E5E5424776C2F3F6CA9114 BC9D85029C1FB81E6FE13889A10FE1461FBA61FF00AF5921243AF0644F8876A0 FF2A31F2AC779309978296438E9AB191E51826F43CB443CBE49D0D539C04E5B6 8CE901CB470D2F27ADDB91476451BCF60003767C3548AAA6C5798659168990BA 2D3A0784E8112F40D9EF861966A582199E12C578A53858924DD5445415F6D276 2DFF9D9AC0602F0FCA3AB6AE470231B33AA21715C261537597B1EC01921E06BB B3FE7B65081327ED6D42B727B64AB8A84BF0873AC02A4227FC2E70F405481EC8 6205189E29BBE4D28604A2F9D0F116E2E17930606D21847A09A172722AE1B8CD 45D14291252453A57F5A9290C266EAB1581C6AA5D593E0BAA78E982A2C97126F 834227B6CBB96C9E5FAAD3F795E7A07A82FF88DC8A83B3D17F526BC8563A08E8 F9DD4571747D37E87CC75529721AAE241A8DE536CEB128A8255F25812EDE4DD2 F82719DC11C6F0DA1345D9DF6030210159B107FC60B762F38BC80886E50C1DDD D856FBAA612E932132E1E4EE97C830C8A7F64EC53DA53A4E9C48B9FAD8C17790 2A033211B3817B6F289B1CF34B453F4F762715A851A728C6290F2134AAB296F6 E9FDF1B99016577A1428C5CC1E86F682B01A3B9438EF0FB7C79824902B66A148 06861F6EDFF266AF1C5262FF26AAC49D1FE43A27013FDAD2B76E0F03AD330215 927F3A707A78446E62B4319C366E508226CABA2B2CBA56270815068457AD7834 6E1D763624218754D4895BADCAF6813EAE194D0779ABD758355B9D5AE4315831 90BE688C3032C7951E78AD8D6692C814EFF6177A6B8E6ED289DC9B18A71FF7E2 3864FB6ED54CC9E41E65D84DE20F82F126B6B9F6DF4C9069EB7819084BA296D3 8DF06C2E660E97CB8CB1B18511A3BBE1DF893511F1A0F78CA4E4F7A7AA825A7B 00C3B1DCE7134F9A4F54C1F0F2CF70AD611369FE2155AC4B297732CBF206EB3B 04E674D21E42773F9F1E8ADC506F0B96A115B9EF416A044389986C6F109B4C7F 11B24BD7D514A5090A454D8C8B65B3253E8EB205C2934BBC6DAB1BFE5980F77D 32458B36A8B989A215B6224421CDCFA7D1F8367586DA1A4926BDE5E2D4254554 366B9CCFEF3EC6D3C2B2FBD3BF1EF9F2D7928511436CBA7B56EA1CFE0163297A 5502535114A9BA594239C3A062A3DA23564A70A053E31DE64A1EA6A93F747E20 D225592AED2508A0C1D654DBDDD1D99E71BCA9027AAA1F65F30AC939A59A222E B8A56F4EEE3AD2348E49B435D3E05779A3F18C8C53FC50EDE8D18A56D81D809E 99E9246B59A7A51D0826107A04450DCD8007D724FBA1E2D638E06F13C4C5C471 36C6B918C0EF3A92FCB29295720FBDAFF55A9E13A6253A71597FD7B847969967 C92982543AAF66613EDBC0885200444A8DB1707E0A429C44BBA54D4724D6B204 1247F4C3CB0808D6798486F5C2005FFA5B7481050ED950CE5C61E6D6504A4FB0 92A2549AC429C9F4F997A06D29409E06AC756F82C57CC151834787DFC9ED3E25 E05693F5D4E063A5796404663219E06A86CE00A5446AF8D44FA448454F5FFD81 C74399D753F837DDD6AE88343B18CA72C82DFE41420C8FB8756A4D40BB4FE81F 886475C83DC5612270B0A6EE550802006EE0DD529E606668767E1B8D8FC3DD6B 2322A91F8957D941DF4CEE7757C40D49B9D99A06CF88C18ABF1049783D22F815 93A7B3A405FEB7CC73A2DC5E4473EFBFABC5FE751BA0EFF0878D5F546D44CE9E 6709C58B5C3F2FA6F3BE58556DC4D5F20BD506CF42464D5F4C86530B51989ED5 A7E45ED0D927BCCB02DFB0FC278B529CE1056D6F82C3E65E918E5858C4E5BAE9 3B8B8D69EC9A5390FE737DFB8391672491CE770A1CAA352B3A723855F9306D49 FC55F5CCA5AAA8B61BCE155DC3B3D4C434CAD525B1782C67ACD4D2B62D044274 FA31F184123765CC476799C8A329FBD6C2B3936C42D71508C72DA860F0A053E4 C9AC6AD3649AA632CC51FC6014DCD0FA38E00E369191EB66C2878D4B385C706C 6C51E8072DEF88FDCE39E426670986E9534DECB8252EA1BD0FE8D9E99EB073BF E4B0F03C62F44E5ACF16D059825A4C211157C4AA5C5C5798A1423685096A8099 7D4FA0881387A6765C4728895CA0832E19DF2B8E71058DFE6F91DEA6239614A5 DB1D28EBEFBBBAB6EAC9BFF447C5BD66CFAF8B6A392691C637F3331F62F303FA D6C43DDEBB590E39D4169AE60C2091FDBDF9497DA1C84933BDBE74B79211D66A 57A8C574F8E1AA5941F174F4BF4CB6092157FA72D4455CB53D332F6465433610 F512DA9BF7DB49BB72023DFB2716556EA7016F911922C0A4551813B4743D2825 C84C90EE01D4ADE8FB07E927F8652559E4C206881B58504B537041936B769A3E 6AC3E1D6DCEA4663160FE730CE15F76C22D69EA1F00AB797A1A0F3800CA3F415 417655D73998D3FD7FD610FFE8EFC8E2854B8A3B211CCFA9C10BD50821E9A89A 422036BD668DBEF3CB3C210B53A913C9B95B2A49C4B681457DAC5AAA2258AFA4 F5515C6892C00D1820A90CEAEA4AFE9351B50E4F21ECB753241CA1F18DD0F16D 2383E200DBF477EC0C2D3AAD49BD90379F94E821E7E077CCA50A0E2232EB3353 C364DC4F802571FA392CC8B59A3CC3E954925A52FB60473E76B61647642DF158 3709ADDA7B8AB88A36970145EF6FA781494F5AB6E99F2D28F9835C5F31B2A0A2 C20E7B022227D125CCE47CC0A1FF309A81718BE1296FF73A61724CA03DFC40D0 989A6D46EE18957F6D744B1280389F207E0B93946FF62EBBA954DD7C2236DBD2 272A7B38F300943A732D9EDBC5C59DCFC17B1FB3DDFF91B27F29DEC3EA4FB4D3 CD5DD97609F211D50927629FCC55E1A490D592AF95EE138D9718ACB75717DFE8 74692145E1885B593920558831929670801B8F60563746CEE773DE93D79965FB 3C0325D419AA930138FE6481481FBD2F7E3A950792073F30DD3790554B5E841D 5AFC834800E28E364632125CAE2516DF1E408B8D6F1E1CA24A2D044224CE079C CBB6A0FDFBABF02CB5164193781BA9945B631CA7345B9ABEDE9273D9A0A2643B 7BDC26DBADD4178B53F98B90B30089BFFAFF07699DE0A515784E532F3187A0A9 9A10D3B458FFABB157064B96B97CAB90122391F4A13C951F5CA203D96F3BC2C0 F44982E055272D4B527660970F66F2061397B0DBC733FFCBAE766D8FB3EB4D46 A0DBDD5ED3A69D4F8BCD39C565D91805F4BEB6AAE731D6761A82F661A0708B82 6B8E4BAA15534AF560BDF81AED20734109E862F9E835C2D570086A681DC29D57 A4EDB84942C387C8676346333E4BC14699440C18D8B11EC70AD5A62A9E21ECF2 7147126113422E0203BE17621B4FE6026666AD30B65C11C3CDAC665D8BD5382D E7168D7857D335070C614D4EB8A64FCE768948368FD92EB2B244871E2F73E1ED 2D1EDE69653E9910730FD34B9D8AA52420E86132B91E3862C2BFA7243A72C25A DF8946BD6E85A99750D0AE5FFC076756F50B7F9817FF723A5DFF47041C2517C7 71846916317D4D6B1A2A5312DD3A3D3429D0862CE1263C7324DD47C801D8B66F AF06E38AB2E8FBE329BF4362A18CD6135783BFD5A48DE55C0E169CBBED290BBA 1B440E6067453CFBAAA4F0C42C2537495447BCB8624603D3CCC0F7165B59C820 C5241C327C85FC368E3EAC86362504A872F8B1104AAEB3BF87FD5F7310FF59A2 F354231163A670A220F1390BF886E34082DCC38BCAAFD8C6119524CF57246F86 6D1C1844286A2E53C6B1F5A070A57A807BBC412167935DBCE33C878621C65D99 1D18F79BA65B3F22CAA1990C91E7CCFA8106A5754091CDB21A0D5C7EAB330548 9401F0B267A6F79110905829C46DEDCCC41C6AFA2B7CB1BB86256AD3DEAC7DDD 554498A0B43E6D3E1824CB03EFB52DAB9B567C7650A3D504DCEF996914B2E26F D826A24E9387E3E188F2F568D982C9ADBBD844B9E888808D03ABCDC5A0F8E085 ADF520633CAC6C9CD30B4DF49E1C335CD80E822A08D61BC563EF4B88358A0515 96877DE1E379145112CCDC7F0FFAAAFFC3AFA996A1AA6D7C96501AA71344F09B E0B644296B25CA20588981A0AC159E3AC0BF664C08B09515EB84962AE4DD6176 57FCF3640EAFA5507BD4734F1A824171DAF836383213C7EDB74314455EF3FC73 CBC4A700C6C5A0955E72C8B28C81848F4F4DBD2558ADEC87632B23E68A4C75AF 5C20F577F0074EAFB5408C2448E0B7E3AA410ADF8B66DB1DBE61179FF95BA710 5DA4B472E5D56142515462A8EAAAC2C0CE1C909F5FFA569B8B355CBE10B80A00 1CD122459A3F1438D9DFFF2DED17A182F08612C2DB2146CE248496166FE89B56 8E02827393ECF154C32E026CEFBEFF3E32AA3A8C360A746386EBFE36DA97224A E25BFFF8780404AAFE00592A60C225AF2D8261901EF49DF260BC9A833D7041E7 E5A54AAEEC9211E090272394BC0177FE30588FE1FFCC1AF58E1B315B82E67410 4EF419E493B6DD5C4F9DB229E427B9690D7150ABD23AE8EF8637BB24246F0C83 F591BEA72398319FD9FA5A860A94A83C113DA9C8C6B8AC0BFE072AAAC0B24669 D2C8E2B6B7D979B154202B98164380AAADB00E6EA0712855FADDFFE430CF0CE0 6D021695B5261B788DDEE311AEC023EDA362F37642CCA95691D34034D04FCC72 2AFBB4F6B4A53FFED88AA70F10DB2516506FA18940B8433CDD0B854CA373BC71 68B3A2B0FC8968E437B69771E63AFD67A202565BDAB2CB797987802E88D39221 0622C2C2E5ED46E39856B07D81DF97F85735662ADB4DBA927398464D428FA79D AF84C379568294E999C195B71468DC7FCA62F161E45BF1EB385786C071F65A5B 3069A6B6F5CC17173A8EF7CBCBC7C7753842D2A3BA3B505E948BFDF09858F4F2 27E5605E76559E6C512A1852745EC34BA103F301F88CFE5302724CB5AAFA97AD 91F7D0664696BB46E0AC6A8BC207E48457134BD4E4B526D24C0511E22C4BB010 A019B7D645BFEE8A99692E825758DCBA53AD22A0F07D48D2030CF9D0F6F33CBA 54A6B318341F6D9E8C7933C9B83C459B3ECADB93040AA60447901AB6325E3B4C 8D4A1FB52A75826004A8AFA59FA2A72CF28FFCDC943CD74F95BA8D57CEEF1668 04999C442B9A9C8BFEABA9CEDD6E1BE9947B9F6FB8389E4765A3C01D4CD16BB8 AE498C7D5890CA9894FEF625964D3A122ACECB78DEBE615B97A973304BF64EAC AB90482932707F9F6A4DD81904E577FA26C2DDA48EFA3878642E309219F7AF32 0732B71F4F49DFED46763636B0C4FC0FC3019762180354B5FC0E55988986349B FDBC8CB1FAEDB6FEF383C5830B4CBBE6554581E6D2A07765171A2C24711E4BBC 8EC020845AD64EFB12A0038E1479E893D83355D7EEE8E77FB51DFE686AEB6E80 8B5789404C7C2B5598A44CAFA7E888DB53F00A02D07305366222D56B66085F92 349E572F0BDB481E2F9C6A82959DC3B4797A03C6A63F2A4DC64617EDE8181E0D 26A90AE1B08E6D1ABD1272E249C9F19E4BEAB288BE2F0E9432E005F5EF389F88 F2AF85A6195E4EFF774EC68105837DF89F8FBA5CCFA64D2B33B322CA521D83D3 FB78E52DAE2B2ABAD94CAFB3DAE3C39B1E3C5672C32B217ED7DD9A6C3DB09688 F86378AAF1F4C9CE909C20CE9DE76577476DA70277B288FFF37D26F1DC6B7DA2 28D5F077CD9ABB620A20A46A5E5F38C7A080C783CD1C170A9434E38C28F240CB 09EAE733F9477FF9CCFC4B1F944033F2ABC1383E4756F49E22C2ECA5EDC5D2DB 523C4D68FDA0F6EE8409E7709B3BE3E6D1CD0020C7914470B34E4E2EC06E6A5F 45395132819B639C5A7EAC91E9A196163BD41CBA3E72D7412CD6E191EC61BD2F E289EB694BA5FAB788E683C609774ECE4C212D278C9DD53AD3B5F82BD885B050 C512152A97C4FC30470239E015ABD5D8F8E75C3FC101DD09E7611D96C052AC5C BA92B0E539B8BF06738821DA20678FC789FE46D70827466DB60C4D9037F24BA3 4A8714CD2062C8F829AF6AC6AFE5C735A573E35CC15DEE33C4E101D34EE00060 8B3CF9D4FEA528623833F67F1475717D90D30CFAE324694C9DB75D47FB314AC9 28FF316EE97016729EDCAC1984F7D41969D030405CB9E32262CF6205EE3C618A B2FD935AB2858E7A726C9D63A9F8E3267351FD4B7D2E2ED5257E8961646664B5 49C098C32A45946B212EA2C99E2F60346EA46B5439B68162677330D6F9F9D029 D371CFCB78D7FFF643647F8BD3F3C5C03EE1146A1FFD5F7B1D808C5C74F0E016 E1E6F8C63F3F9EC2CA913D5E0B53F47078FE2212E3218CE5D613980431AEEA58 A3DE12746E2722356839FA4593F21FA686C59ECCF5975FB0F3870985F92FF5E0 4D9828A6B40FFCA68765D1668B90667E03B78AF567ABB51911B9AECEBFBCCFFF A7353A8AD6A0A006861DA150332B050B39548E8FF3B76B92097A94B684E999AB 3D4C2DFF4D3F26748900D1C2C3F064BE38A96C59FAE086E871033D8E6239A29F 6C00CAC1E7F3B2416B811DB0509BA60D2AB67B85CD0D78F150F081E585A77531 AD109C82F5EA7C0603A54B858F559B9EA5709709B658725F152330103DED9DAF 1F7547B828AC8EB807389AED364885B2D318C8B2C1550A85FF60E7A9A2043C8B BF6DCD0DB5891B7539FD619378844B2F15047DD021C04374349130A53CEC6D0D 7041D74A080913AB3E60195A341C6A137AFBCC9EE26CE2F674992957A5E39B8A D9D39CF7EBDB41F96C19FF4E78ADADBA8E06EF7E3D176C5C4F8EE24CDB6855C3 17C2D89F8A4E85F141C661C8319A17BDC7F6F9D226054273F64591C4F814CEDA A62482BA980F15BAC25E048C243CC216116DE22EE1F8F1CA6C36B8CDDA3492D1 3C76DB915CE64E05256FD14A6053B4CB4881C84CF8A11890B72E0E870468CC52 DB7A41939112530E95A601302EA3771DF0A54E3898BEE76D00A4629374B7ACEF 793C0597CF98857D9B22F6C19E5BB350D85FC343C598976099EF35C79DC55A66 6A04DA8A45E73342D11099F47DCBD9C99F0C7097308C09C95DC386EEDA02E176 969CFEFF00852719D9214002013E0F733CEEE9CA3BBA72CA90D9425783384FD8 DE5BAE3B51BE5ECB247297A358C6BC323B4F5B312E2BCB0F447078FC42D35935 16A2143F54CCAC706CA97CF1494E28798A2803548350E890378281C56B21459D 9F089D64914CC149F705E2337A7DC2582ACBFAA93752F662DA3A8C697EF5AF60 0C5A70E686ED741A005E6CEC29BCEA2D8C9B8C4D14C0C637CE3C30291F89B888 07FB39092A713B5C17DF4EC4EE2E745A4D7DE6595DF8F70AD5FE83B44FACA9CF AF65519FCBBE9D61BF65C9BA1073724049046A2CA929EF2569D49E340EDCA258 1F4391D9C9D69BCB9A9AEF048E25251203763DC185703EC7B6412CE02AAC0E52 27DF188EA0221AA746CB043AC69059CB9B4BA3A0C3BCFAA90B94599A3CE6A292 C6EF2FA1CB09E3E43571C4ABA77D4AE8DFCF6F2C994F922EA01B1FEE3D283E44 930D42DD149BF4AAECD77A575388643BBD19FA398DB17CD3CD3BB2AF3244BE3D 935527DD0C37EC1575D890D2BF1D4EF6ADC5D686092A8A86A719BD1C3DAA7C9A DA424CEF239E2F7A4B402DBEDD26F9EB1830D43C333EFBF91A9A9A7B089E3808 2058A2A51740263109746D700231CCCE2DDD7802B281D1B8F9938DC25CB01F91 E488227DBCB4A7605E3E1930EE11BE43E9B987210C708288F95857C57E98AF9A BFEE2C1E066D42033EDB4956617590B23AD085D1E1F2E2FA4CB048F7A27DEA16 894C92DD082C334F88F47C8B30C6F7F38A50DD3DD154FCC11D08023003936146 695AD1432C4919994A1D8368818BC121551BD26F4E6A2717A3AD49BBA6341C39 7AFE2845B125DB43B047A1038BADE14929D6D4FB8F42A89E18DD9E9D197D8364 017F93734437D4AFEA6F33A54B127E1C82CBDF742368C4D35BDD062EF86B40FE A7004D94281ACCA2CA8DFF63431C494A745B07B0905452EC96B80AFF7A758A9F A8294AC30441351D08EF1048CFC78B103685DE80E874495F8D821706C86270EF 77166BB5494439D0CB85D08F3880956C9F8D1436A4905CB999C558D39923EF50 FFDE5D53ADB1DDC858157D7CD33006CD83FE4ED790C5313113A63DFB5102585E DC9642F49A30A76740DF317E481097840F2A444D449FFD53E3A082CE099A1971 6A7E79B77196911B05CC762D6A997E2A8191EC8E62D936951C62DA78C04554B4 FA65FBA1A6D57AE13C32283F3F47EFB3DC5E65A7786B13A60E40FF016B555826 C2AB54FED36C2D09535E1C3B21BB6F85AF475B6B09B12320BFA005A8BC253CCC AD84BD015F8BEF7A13CE20C001C458967EBA18C52898040F36EBEEEA18E7EF30 F5AB3424DF07BCDF081C0A74FF37E42957181CD4F662ECBD5D7F03868ED97CE1 AE4C7ED4C298535F250A9B1B0243769675C5AB9B079E5D364F0ED8A890174B1D FDFC1D7E9225C4B55614C5E472E37CA872B9DB57C19781F613DCC495218C101D 19934550A50569E1D7D9BB7EFE0AFBA27CC08A3DEA037C3B4D6F40A8A1400722 03661C62E871FBBEA90CC523F0C7B8CB6DDE5F40ADB0FC889A2F9A936A43CF4D F0C5F23759745D721D946B8A0B10D7B723C05DA84B85A175EADFF2957A2E0FC5 01969864A53A8F29F57C85F4596618BBC1377F986ED8A06A2558B30486DD7152 F4DF9391059D355AB93744DEEE87D2D159504317E43051ABE89040D8114320B5 5EA855CE1823B9298174BFFCABE9D9A8FEFD6D4B998F179A67561B23446338F1 82A1213EF33B753A4F1E0A6266993406BD39C6301C53CD6D5C838BF6629B4BF7 B009E283F685FFAC786ABEAB2B6F7949931210541E9A7208EB367A4AD4E2D500 BB219A2FFAD26EC6B980745523207C74B15C28B6AEED0669F534CD36C86B7170 C9188C7E329EF24618B8C5060382E2743DD245B1B011CE8B4D41F718AF745CA4 311DA0ED2B0EABB80BA78292EC4A87C211AC758E41FCD963FAE911A7801E416D 302B9532057FDEE6F56EDF11B1FB91CF59D046A6DE37F1E23F97781A77E233A3 B62B1CED2E3AB87225C2A4EEB244CCA7CCABBEF60D7498CAEEA67EAA306FE1ED 78F21B81107E7053E3BCA64DBF7DCC857B90E416A685CB3A871D66D40597E4F2 A4099A1909AA93C25DB66AA036E5643CA818B3D97056AF21ADF453AF1EF623EF 7082F429B4400EBFC981D15157047070E36858EAD9B25635900827BB9D11EF06 17ABD80172D617183E5E8CB868FE15DC403AD8E4986311897F69CAABA6C1C1C3 50DD49D837D9242ECC902DFDE7D0670FF409C9B08FC423DD38A8C14E977604EF 5032C317B6A49042CD09A21B3F5710EE42ADFC2241651F6CF7DCBB77A6B9ABA1 B1F9705B55A55D1F001A729DFA61BF5322454C6A9CBBF205AABE6A13EC1D8AAE F18426B505068E965D5FBAAB3B5C4718C948AE67F75B1901587723D5F97E5E4A 2F8CC8E1CD0698FBB6162C288ADA8E89ACD86B1DCF0BDFF52677EE29D8F51FC0 2327B92B3C0C057350C8AF6A0C3AF9318B9DB56998360DC08B3EE34ED18DD35B 5521CF9442208B9BB80A397A273DEC85DC70925E8CD9019C7CA86018CD604BB3 1ABE9DEF0D2CCA50D94C279DCE48FB04EDE27935503C83DA1A3C1F2DEAA0BFB1 787302D2BD4E036324CE2AF85D5C2977DE86B450AC8A34112E886379BAE0BDD5 38CCD0B3C8424C1AB71C168448FFA1C603FFDCC16468C3610982B46B52B97D88 734596D5485E37618DD371E1C079A7330C3BC860D485244709E2CD975AC530AD ECC1340E90AC7CD93D492BF58C7889C6154FD5480E88E9BE7D898C057F85F906 4841E5E98B905276D5A0132C2880022348A96250D3D9997D1851ECED2495AD78 FB4C6D74BFED40C25FDCB74A564D82E3F14C0EC8ECCC98E4AC29A488A4B7B9A2 6432F1D3B4819BA996D5CD5D61A4251358A41AFF25C70572F07242723BDB130D 99E10BC5EADEADF3CA82A28FA8DFEC5EEC4A5E5B99138052AF0DD311B34A8B9C 835769C1C31C1EBD74239BB8A93FB49690C475A5DE87B6E5A04DAD93B69ACE86 233BC9FD6949F2590B405EF8330C913AE7119850FAF1B5F3CFFF4180B5212592 D20AE2982FCB090DC5B15DDCBF88157DFC0F039FD1CFFA367C5C29AFE511CB49 8DC4AF438AA70B3B982189913B00A9BA143D28519CFDD6893CF22F8533566C7E BFBEA47F0FD6FCC733C47B261BBE82F68C268C3FFBFAA044C927E2E954364D1D 35BB1246CCF238F33EF43FA8D707F900550852072CBFF61E0A14C36068575292 29D2F5B4B7CF3F9764E61F39BB3A16707D7AD76531E839A737B36B68EBC9114F 48AF35F4F0DF07DC3C011A9A4190315C0FF7E681F06F3F5BE48079BE4C5BC592 4E6911254E8E96C1A112E2483FC6FA56BC5B2E808A18F6862D348D01A1E17614 6D94525C26507A733ABB464332DCD625A53411E6581404676B8981B87179DE20 CFCAEA15171CA99872D9542BC32754B4B8DA06108630EF6A7BBEF1382655C83A BF0C48D8B3A021D722F3CFFE8AB5357EC2FA45638EFD7D27C4B73CCFA15DC4C1 E2B55BE2EB8B973B893801C2A1CB3A0C2678A74FBB9719034BE264D5D82878C9 D16DC69FE42E39C746CCBE11FE3C782997849F3221CE061C436302596C760F01 CCD1FB407962D6830A9336C02F94FB652AE3C93D3E84B6706C948A75CFDE2FCB 460FDA44F03875D55A9F59EE25BE5ED50132A818C9D5C35E852C4FE6190CEE6B 467E8253ADE595DB5802CC60DE76B8D3AD3DD54BB5E0CF0636B87B272D2B748E F0E7246328C4CC5A2D2E9B837B80F8A6163C3DEB2ECFFBBA894472E5FF6F 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark {restore}if %%EndFont %%BeginFont: CMTT10 %!PS-AdobeFont-1.0: CMTT10 003.002 %%Title: CMTT10 %Version: 003.002 %%CreationDate: Mon Jul 13 16:17:00 2009 %%Creator: David M. Jones %Copyright: Copyright (c) 1997, 2009 American Mathematical Society %Copyright: (), with Reserved Font Name CMTT10. % This Font Software is licensed under the SIL Open Font License, Version 1.1. % This license is in the accompanying file OFL.txt, and is also % available with a FAQ at: http://scripts.sil.org/OFL. %%EndComments FontDirectory/CMTT10 known{/CMTT10 findfont dup/UniqueID known{dup /UniqueID get 5000832 eq exch/FontType get 1 eq and}{pop false}ifelse {save true}{false}ifelse}{false}ifelse 11 dict begin /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0 ]readonly def /FontName /CMTT10 def /FontBBox {-4 -233 537 696 }readonly def /UniqueID 5000832 def /PaintType 0 def /FontInfo 9 dict dup begin /version (003.002) readonly def /Notice (Copyright \050c\051 1997, 2009 American Mathematical Society \050\051, with Reserved Font Name CMTT10.) readonly def /FullName (CMTT10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle 0 def /isFixedPitch true def /UnderlinePosition -100 def /UnderlineThickness 50 def end readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 33 /exclam put dup 34 /quotedbl put dup 35 /numbersign put dup 36 /dollar put dup 37 /percent put dup 38 /ampersand put dup 39 /quoteright put dup 40 /parenleft put dup 41 /parenright put dup 42 /asterisk put dup 43 /plus put dup 44 /comma put dup 45 /hyphen put dup 46 /period put dup 47 /slash put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 56 /eight put dup 57 /nine put dup 58 /colon put dup 59 /semicolon put dup 60 /less put dup 61 /equal put dup 62 /greater put dup 63 /question put dup 64 /at put dup 65 /A put dup 66 /B put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 71 /G put dup 72 /H put dup 73 /I put dup 74 /J put dup 75 /K put dup 76 /L put dup 77 /M put dup 78 /N put dup 79 /O put dup 80 /P put dup 81 /Q put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 86 /V put dup 87 /W put dup 88 /X put dup 89 /Y put dup 90 /Z put dup 91 /bracketleft put dup 92 /backslash put dup 93 /bracketright put dup 94 /asciicircum put dup 95 /underscore put dup 97 /a put dup 98 /b put dup 99 /c put dup 100 /d put dup 101 /e put dup 102 /f put dup 103 /g put dup 104 /h put dup 105 /i put dup 106 /j put dup 107 /k put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 113 /q put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 118 /v put dup 119 /w put dup 120 /x put dup 121 /y put dup 122 /z put dup 123 /braceleft put dup 124 /bar put dup 125 /braceright put dup 126 /asciitilde put readonly def currentdict end currentfile eexec D9D66F633B846AB284BCF8B0411B772DE5CE3DD325E55798292D7BD972BD75FA 0E079529AF9C82DF72F64195C9C210DCE34528F540DA1FFD7BEBB9B40787BA93 51BBFB7CFC5F9152D1E5BB0AD8D016C6CFA4EB41B3C51D091C2D5440E67CFD71 7C56816B03B901BF4A25A07175380E50A213F877C44778B3C5AADBCC86D6E551 E6AF364B0BFCAAD22D8D558C5C81A7D425A1629DD5182206742D1D082A12F078 0FD4F5F6D3129FCFFF1F4A912B0A7DEC8D33A57B5AE0328EF9D57ADDAC543273 C01924195A181D03F5054A93B71E5065F8D92FE23794DDF2E5ECEBA191DB82B3 7A69521B0C4D40495B5D9CE7A3AF33D17EE69979B82B715BAD8A5904C5DE0260 6C15950CCF6E188A0CDF841EB68E5A2F88253E382140F87C87E55C9EA93B8C89 14A36CDF630D6BE7CD36DBDCE22B21778E8648B97B7EC6742EB5114BDF0454B0 0EA7B1FE236C84C0E5308C871F67B973892890557AA12E00B2C20C71F516C397 3F3BBD14A1D0149CA064391056E45E9470FC7F6F556ABC82653B3C8049AB5CF4 BA83C8F2158C236B2FFD4208846013BAF4165E8BB8D334C8FF2E8D74AF5DAB2F D44788869B08399421AAA900ECC6A2D594641C121660D4B5F512938994C18DD0 FCD9B008F68F0351D21ED735B2740CB1E0C1CCD25EB548C35B844601D98828DB 556F71D07E081A593FF12DAF83676492A0FFE16E95717A07082B43A966C1EE8F 8A59E1255E1705C43A23CF29A5E4A6547C93F1680A870EE7BAD8CF74D838CD5E F806911D8FE4262ED8E7F5BC58B92C9C6D74F8AD45FBB021EC7E97393018B9DB B1B84E7B243ADB05ADD3F1DB3692ADC5D47FEC7DF93080669E63281F1576B673 125EDF08016664BE73364F65389F7C3B66623AD1754ECBEF9E5CE6948D933787 A5674279ACB2EBECD3B4E6361419AB32028A27670C9F3E18B746A10B00AF6D77 4EC00E3BE521C02A99AE5BAA98F793EB1228952BE67934B91472E01AF7B816BC 56D7F19F631A1927846D800C107B1E9CBFF9D2DD513B4A8CE2E0DFD77B1ED178 E43FA7052765E9FAF89989D490D8FEF6C536EC0D4AE27A74F474B98DA9E6B92F 15E063DB260571979A5DE2423920CE1F59F56EB11E00E3BB9D466A8263E1E385 2014BEFDA8D1EA3EDA04BE32AEE6CD15C5C010A1DF7F705A2C0C18E87C8DCCE9 05D9163181CBA56C0FAC8C06A2990554C8E759D076B01BBEADE3B5FB8B551390 6C8E4A2A1C6E7D9C708614626F3770C0AB7DD2027469C77975C27576065862AD 04E5E50CEBE907E3E991FA0C627302C0E207B4D5992BEBAB5853AD1C0D271728 C76F40A79392ACCA7358F948AC65DC823CFDA59E1FF69CEBB6B7EC3CF21669E4 70D999508F9C49E2D9F8818CA53C977D93E15FBBBAF75B1E84F0BA62BCC4BAFA 4EEC82D804C8A8C0210F3E5E258BB1F6921AF02BA9861BAD5C3D5FC8CEFABA8A A607E547B802096F7AEB09FBA99C83C9A494B94408DD607CA6561A6E6660C473 62CF8D35F31D052F6C6C8138A8E1430CBA7EA6973D6D510C1A06B3FBD79D9364 240C1A00272DA44B89A9FE8D5BF36DC1B5EBB4A78ADBE9C5EDB485F093D9517D 69E1AC9A8E6C9D7C324E3797CFEAD9A18E82E03F69B2CED7D5DDCD1A218BF2E2 ED2293AE999FE2A4B5213A10083EE0407BCF8007670B8C737EAB30311C868D84 121149ACB4A27F3ED6C0C181C98AAAF51B105F264B5672D7F745131ABAB5BEA4 0C9B43C0DD9116D6DC61F90BE72018F290D26D5E9D341055CAF09C9F45333CDB D45B7954271767F638EEC499F7B53C2CC5774EA7A7F024C4CABFB93D9CB1856A 0C671A4ECA7C62EA5242648A84E7F3AFB9547A0AFC29593CFCE6D8B873A78157 D337CABD291431C0A2CE1F37E0CD7340567AC206FF98E4B5A6410F70F750451C 550EFB54AA259A1B236CA9CB730D2CEF125EC65D959441F7CC9768F777B44844 CC9842A307C72B740680ACBBF6AA35FA7A94825069BF7696ED81A371A9E5475A 9D997F2DFAD339AADF797F7E03E654234455AC3D17702A420EE0A597BA31BDE4 FEB8DBA7C61D311CC90441A620164DC22DC2D373973EF84CC553453AB1B3337F 7B39983B8DFFB3A9425F119B45C1CD37A76F905777B3154CA6200792F1759D06 E017890F4041A385F2238E3C48B6C8EE6F5258463FDBFF7AC762F6C4363926D6 50F004D473B7B7F73CA686B559C2885F1AA761653C727A77D73431E9D110E76A 2E55C68CD50F43997C9B2FC4710F8C8540909829E215678E63BB8363C4B8AF05 9986102BB36580D9CA95CD216B7C321822CB41B2E0422CD077F3B55E0246FDB2 44D5976F67296B5B0BE4B06F6E43535C21164E6C5089C3E9BA2D6B30888C57DE 49DC8D9D46C0D5EDC47ACF2C03B72DE3B69512508539019B759280BABEA12BC9 385308A0395C4CD33182A10A5A229743379C2075D82D8BFCE4A66E1AA087A091 8F5372684FA5037D1B92D50CD9CB4F50AD4F8EE7D51F1C9E63C721CB5B9BD011 6F0A8DD4FDCD2B008F223A1036D90F0F3B252487DE7898F9AFBB3A9D9CD49E0C EF4ADAD5155A98D2125ED5A3D3907F67301649519419F33CD942E8DDEAC1BDA0 E90C431B198F646766A8FA9F8D1561B57E126EF604838C0C1966655CF31FB7EB C8CCC434FC1C96046D38203E1791EC824A3D7AED85C029288D4608CA7668A2BE 484C99639F121845B22EEFCE0A3B808261921AA042AE19E641769E91277BEC29 4594082CCB3058F90FAC4A700A8A827ACA00FCF574ABC8EB7DBCECD97F2B22C0 0AA19E8739B81AF8C6F621D69B8E6F29BAE233FBA655A0AF5BDFD7F5C6B9167C 6BC7AB693D45EF2AD999F5DA3CEFA39BA48A17EE6D9F2C4DAB91AE3F0044DC3F 5D5506CE4675AA928B0092D6F173644F91295216D8BBB14CDDE0AD524A4D545C 1B5E284A3BF0396664081CFB4F186A84A0D24D61E82F4767C1E55A0642720CF3 909FA1AB8EAB78030B59BEA067DEDBD2F1D0340E790AB2777DB18248521934A8 BB38A58B7F633DEA4291B0D5D13E9A882C974697CC6D3B49E030C94EA29B5506 CC29C44D01B4751B453A46A9F6BF3BF135AE87A4CE232AF57B66578310DE41E0 2A6AC422117F1963C4D7CC306BD25A6E724E51921779F22F029733122E23E2F0 CB340008813ABB104380C80A492B3FC6D0BB07CB8D8409E9576891EF6E5C9D08 EB8320DFA31BAFFBD336D0C2BBC3D3B2D30368B9860768FC080D30569C7F7811 0EBEDA2962476113625EEB555490B8CE4C5F99D74ED10F738C61854CFF8B41C6 9402E56BE8856144A1A05D0B05F4CB7EF728B2F4F5A439F18C3B68CEFA41E59A D8308ADC92EC1289DC84CF48D2CDEFF509A145BF945E1E00D552D329EBD2A7C4 21D58082CC8FA790E981F4AC8EAB99950678FD3A7DA3DF13778681B208DD71A0 7C3CBD0664B37C9EDC6B601D79A2C51FB54DAEE849F93209793849104E722D3F 52DFAF7047EEEDDFE744787A5801E4AC2C3D58EC5DDC15FCEE03990C53B0C57A FC54F125A04C8E4A0ADAA725808C587E7DAFB9F784FA2875689979D316DC22BD AA36B306A1ABCF907B63C6476737B746099973CAEA8C1E2C5C41F27E0F7DE8D7 F0D942E34E92F43FE902653D4D2EBB6F3B9F7928B1550A82AF234D45D028F429 067652BD3D391BF423AE72B9CB1E8D91E898161BE3A7849D456A861A2046711E E934DC59442AE7D81661CE8EF727D8D7DDC0270E937E40F896AEAE6171661431 C1025C53172F9D366834BA0054FBFD84503FBAE328B6FDEA180F8EA35B1DA937 5CC3B8F00C206908C2FFFFA6A7AC6915D15EA44BDCF29E2BFCFD4A849535F19B 0D307C696BE8205C7D84B9C77F02EF27D911056EDBB4080E4D3ED72788666CAD CD91B0ECE27A177DB23320A7FA9C31408B4D02D2A4B1CC6DDE1A6CAC3D8EC1EC 2226EC98E51046D1EC26FA20EE62D24747D83CF4941DCE5CCEEC0DBE387149CD E05B19FFCAFC0D117F9A3E60DCD4C815228D98EF95EB559AD0ACC0D50FFDF714 56C3C812EA5ADBB013BBD956A7C4CC0ED7D3E25D5C9AF5E626F18297F75D4957 F5B0B33379114B903FE98BCF35C3FF76FEE1D9AEB711F2962276531F7380EE3F E368720E0292A170A15C5539B1FC7BB954EE2624B504CB8C805B8D31AC38307F 0513606F09211AE64DAC447693B2A0AD15E9A64C34F5A911ECD0ABCA90E9791D 67C6BD202B0858EF96E7722305B8AC02B01AB1706CC6AE875A8DDD15EE349046 EAA65005E7866B506EDFB7A5A2AFD5C9E9DCC821A79EE9C1EA2C7BBA32A40BC7 CEC26DB1AC473C8C3960ACEC581B37D6569E8C8C42950BAB7930B65E1570E3F8 9A7FA719F1DCFDA45A3BF2AAB32C9A93BA3552608A61C623DE59BCB346E87EF5 9CF025A87803161221C5C1C6F6B3403712C76E9D755C7BD68D7F2DC03C14CDF0 C1BBED1D648B905B4B17037B7263C1EA7A7F06FAAC4E09E08483A8D714C19861 327CD9C32DDF850302DD6DDE24912D00C22ECDF3CDFB18FA831A41A7488EC203 F564CFE30D506F0829A96D35A7E09C3DCD107D589B627A15B55C5D6649126BEC 60B88C55ECCBB4E680265D9EAB4CE22965D3B1AF759B01ACB0D0E6C92B6B4EFD A81E6A648708979487FC591CF09631310D46891423F4EC159A73E30D8DD147A4 B0EACF6D45D18CD16CEB8176F03ABCB41F2234747B9733C8FAF34AE5D43D3BA5 0CE0FACFC9B087F84FB6C68678BC6E76022B1526D6E5B3A48EC1A110BD75F45F 1C4DC6D39F254976453F57DF873B7D635C80C42026DE020E5BAFE0DA0D54D1E1 DC634D2621BA184347E5252F645A6A1DB7657C48124186F0E4C644077457C24D 55753C651A9A7B6349867641464B515B821349C795A645420508673B93750D0C 7A3B33EB1F09782033742AE8F3A23FC02284E6C03818FADD1731361542E3FA3E 75B8D52B668C3E18A4AE967D0FC3157083D952AFB8144D549E69EAAC51C279C5 E5D88A0D9D53013DFFB4352A1598FF84DCDE6FA32FC377306B9B92C0F96EE149 8CD55E7B2445B86CCA7A547FA732D52D59025129FD8C6333AC0DF4F0CFF6287E F2036D5DBBB3B91B92F12FEBE0B61A313A4DB5A9CF0BB3DDB781A56FEBFFACCB 8CB9D1D3DBDBC4CB6AAE6769E470582403CB920630221B68BCB625CD4605FA8F D3D5B7A1A28D15E44B38E92E906C138E72C15B86F64C38E23BF0440052A8C914 54397F49DBED99D0AF7CEA3B0A05FF37C2D7EAE1412567E6776333237C31E3C0 49949EC8BFD6E0F6446CE2D4DCD2C1524A288818CC5D159BF8463A847AE4A2B9 CC8C58F822804B81B13BF4F2DEB6229C4F51F093075581791D02C36A13B855A0 34900AA7CD4F1A797652656FE3A8425A38F421C4CC0ACA1CDD44FA6B31219276 1CDE1CD63D6A58CE705CB56CCA1260F9B86E989019071563A9B4C274A87558CA 6EF1660D574EDA276801F0057740E2C3B80D253D697736484D892CE1AB128B8A DECD69712F5E70E895FBAA927E8194D792A04AB6CE205E04E38A433BBB793FB4 E8BBC4279D58A223C6673D909D6AFECD246E66A52F4CB35E5931D24C828489BD 4ECAF621A220D8ECF702BEB01C4FC7510197D3F6D15321EC87175ADBA6434ECD 2B5A306E91375CAD22CD94301763E4A8B981472890422C5488FCD523C9CB17DC ED22FBF12D5F7525D0D6BCFE8CE85B0DFB1D6F989C267FFBA0A996D309E4A934 3DB54A9D29C88B9D55D7300DA3D46419256C5A07A2A529A8DE8BD1727281F5FE 97033D861E0531B14E811378EC1AF1CC7EE9BA2B07D935843D3053F673979F8C FAFD59D555B56CE338F606747238B22BD62C42BB7238FEA335678D474A643570 A9E7B4970E8C541CE9DBC7BF70ED7BA33639D6744A18379455029E934C95E2EF 639C4848CE9A0879B51649FAB023A71782444B451F92A34CB8A124270CCF86D4 D18EEF5C1D2B2A29012613851C49F50702D63BACF95EE2AB4D72B375E0A62615 E0991E130A67ECBA9E05329B740708F1CB148724C3A6E5E3AEC1F88EBCA398D2 1CA8827C977D72734310233176D1AE26C55CF2CEACA62223315C28FCF6305C7E A22414D4739A059F552F1F9372CCCA5FED4F9AC987942848EB498900269511F3 F408CBEA0659B954F5F1B18AE4FB270213646F9B28AE4439D2BA2D3E0AAAA780 5E530E4EFC8A060EB979E12191044509DA0C14397AFF949E12DC970658D5EAF5 4EA963F5BC1407A32F3837CA6A24B7F3D60EB8E6222B702E25ED903F9D21AE50 664A095009BDEAF4B78DAF94E5A55D48366CABF07791A1684B2F54EA69070844 4F031AF8DF416C2D3679F8BA038B0DC9DD0400CA6B34667BCBBC07E62C1668A8 35A8C57C9048A7227E672E89681B54D662079A189A9E96A3CA96D8DD10189B04 1DA49BA2729F1CA585B1BD5C467295285D52E47CA904235A1A3E48EFAE9EB6F6 01374125CE89D53C276858668CF45D2F092DDCAA52418E0BB94C2B8266B4D88A 5D911507BB1DDA3D8F6E7C14A91CA11AE799EC42E993098E18CADA70BD2A1D82 2C39326C6E3F9E84CD9758B9AE43D79BF99E6A0CD713E95B3D9B7DB90D127DE0 DAFEBF850CAAACBD860B5DEF2082F1ADA64B44B193C4A1417BE221FDCA36456C BE5934C8CE3ED55AE3A11697C2D682B7D0F72D48976451D205783BE25DBD2507 39C14FFB4BB828DFD187104F38A7F11D5F0698C11E8C1D4F107CACE573FDC4B1 C56FDAE47024D6FD16A2FEABB434CA320300FC4B6C1B6CA08F76C60B7C08A665 99F404DBA8A2A1EB18EF6750E4EC186E31561A3F080BA6562967546715859481 7BA782940F5C5D06626D6F6A412CA7C13820EC7C1DF23E15E5829F698CF617BE D940523E4EE4ADECEC48C24297DBAD528BA1DCE7AC335A1D15D55415B108EFC8 6D45030D27B3EA63B2B4CD771DBE66AE0218ABB1153D4B7482289D1313CEF184 5C960B1E3C3C953912CC6F4521D1E15636C1545EEE457EFB87B88C9E43CC2F38 6BC4BC96969F4FF28ABB06F4454C01CEF1B6DC538F1E832FC1666D977E5A881B F72F1B4C7DD4BE167A5535F1163A0706F9A0B26400178DF8A128FB5EBE6A7B81 E478AD183EC06622B591337B9F1872AAEA356F4FC67EE767B34CB5A4D90702D9 39FB846947F4096FB3DCF16EC81455164783BA0B5D723060DAFF411B68307E81 7BEA1D9A47A5AA3D648E618C83C60F060029E6EC4D46B045FA7415BAB2AD0AA5 ED9C729C24136F6AF61E6409C0B5CA760B16225641E268A68CFB8260BBEAFC77 6626EBD97195E77CAB425CFB0096D805D9EE699E41680D095AE9FA10122A7882 2F00F495C9EB2102DF0D3E61833BC0A2E468C5CF7AB430FDB7C0BE3DF2C0D230 1580BAA25D65F599378D873165482A1FBB224AEA89C6BCCFBDBA42AE1C5DCF41 06969F585CD3B737D1388D6359F5468D88FCD2279BDB270F6A858FB7D2ABDEFE 5EE8FB79FA437F8F50237B92C307B73B0DCB808D07A9C3255CB9B3B17039CE5A 288103D05D132863FB522A02CEE3839EF9AF7F07D99732F0B8B384745369FB3E 7901166478F4A16076A1504C5E98D17408494E270BBF4470ED12B4332422679F 759F1D93984D7E506D16950DB6C2682FE1379EFFA6F6C95DD71F6E55BE3EF6AF E0CB25388EEB436E6527806FC75484133F6E561DEB979D5C1FFEFDAF2A6D964E 03BAE0BD593C2992AD84569C81050F7A793C5263E50C2F50B98C4CC703EAE17A 6AEDAACE312DAFAF5278D125B6EFC5587484F61DAFF46B87B7C9B1EEDECA4859 314A9A9E2248467DE1E54D90DD671660B9040B3E0DD982260822177EFD757266 74A16C83A7FB168016A320D3DF3BD7726F1F4EC90EE5DFE810C96B099FD4368D 906AE4699049EFD37E8EF058D4B97BF71106445AADD4FC6E90615A0066823A36 673B8DE32322BBE861AE251226B4385AB28702831270DBD25D666FBB0AD7B96E A44E891EA1EAF0F87013AFC982E33D67A28E96E0C9CB99B9E4192536830D9901 931A8CAFA41289633B20BA3BD7AA3414B6DA8D57CCF2FBE39920CC06361F075B CC40335DB9A0071CFF77F6B7BB47F3100DBDC9C4A58C2B81EC99E8E966AF3390 E3FBCC28BA1D79961C8A1584266454DF772FBA99664D74D4A89FC82FFEDFCFE1 4C9E4A04291E803D142E37E7ACA66AB279378F2F192FFB2B5BBAD18B95F03136 2CB594A3D6D3F8576B90A6C4DAD6D6C8EE07AF682F925F01D0B26CBA347C03BE F3B0585CF4539FDC66915E22117078CC94D621F31DCB3E021998A5D6EE94CA4B E214D07517283D56973D8E4367392BF6C1150DEBF459D141AE0941C1C8C5CFBE E735D796E365A1B0F60BB4CF2801EAFE4889EE5F338D3C4885368281B3C95CCE 251C28A90D318A8A0384439B38D63B94757252062EA44E88509FDD2E75FAAB71 7329622828B2785C1A8B26351BC74237A6BF99216652ACBD4CCF54CFC8AC72A6 46342F1E32D4318E7E27C7B2DAC943B3E72C472FC6F1DDA8684AA922516A672C E969C047E318B5E3B1270C1BEB1C4071A15BC81B29B268C679B41FC5E381BE33 DD95F0D68118CBB60C521E5CB2BA46A10E50E9238163713290DF6DD8A27D3813 F871C07E725D4518013D9A84CEC96782541E5580E33C2EBCDB18F08EB4655A46 507A8526DB26C854928B81FD502B0CCE4A68943C12078F57C10F4E85FBEE1025 46D925B8B3B447D4920410FEEB9844FABE985F9228FDD9F58392F2F3BD650E49 2E3AD5A14984874DF4572816931885CE8A448EC95BBF40DDF4F85653AD90A88C C4A879C0C7596E61997B972E8A55E57B17F802C738E5C7A8FBF6424F8B131B23 CEE3EA3747DB066246C250EAD335A76FA166ABF75120CECB59076AB31A51F176 57176CBE8C802A97B0542A5CFD6D5E6D7EC848B923012E45D9F065BFFA0D03E6 788B68BA4DE51DA37994948F859D41C28BA939C3A82BFDB44DA585AE80B8CD7B A6EEA79B70BFB4864E06F06A9751BD2D2A209D150D7135E0A25D67263EDD2A7C C63B5B76ADB05D44BD5BC0BB3EBCE2E74E1AE5F7DE07A59D90C932DAA2553505 27F2AFC05F7CEB39E1C7E54F69FB0BBB069959F2FBD11709F8E81F6E7CA06DBA 1CBDD8E7A78487462596DA288B50B295E46F4C3D9BA862688C68859734B232A7 4B371D2BD786924F186524765E789EEAA30B20C069322D42C893A30BF1BD2C46 F8F3732DDFE80B8FC1789239345944D8B457824FD80D11184E73FBA30EB80A9F 2FD466826D4E666E3A835B98A1D4AE5D17053A6A648E26E77BD08F9A3E02956A AE82C4929E9666F539079846527D0E326FE7CBBF86E3722BA3E53F8A5121080B ACF8D3C67A2A1DF624B9DB92105D3C833F5A6ECEC108E026E1D3D968967A1447 15CEFDD09123D56606134BC3449404ADAB1330C9238DE48F3CDFBC91EB86D7B3 8B85B5BA97376A0673E434DBFF19798EA90BFBD94493E2D21976F8106FC0C276 C81C9B9F7D4A68120DDA56FC6EC65FFA40DB78A60A05EC270A106DEEBD2CB92B F0622BD2B1D43771DF39AAD3ECB655F317AB483F7290C148690903AAA636583C 99DE3DBA99EFE20773D3D8DDD816A28D7BD8881DE570BAF5C7A30679179E1214 FCFED81605FE56AEA21C1894167F93D648B474352A65C0756F812F97AB435ADD 22C031A21714A626DE35308AC51CD676DB1748DD2773532294FA77CFB2AAFD32 A72BB7A045F12B4934A768F89217233DBBD69B900B28492A26713CA5D61A9042 A982CB071F1F875718FAC168E4E275860DB6369B8114E1BDD4801110B62C3E3E CF140554C826967A99F4E9726526E87D57BF845CE38E33893E5F9788769B6A4B A4577C38C8D45AF2EDC9F4FA7DD9979AB8E14FF5D8956233AB4C02982BE8E561 C63B7BC314793F634DB6F086E1A60D9FC3B69D3A7C20A99FBF3CB028CDBCEB60 E803C8DC3C5F0CCAC030905E72BBAC052520CB0E40E23B46B2150DE67F61E4B1 8C4D55904B7F90DDE4A4A78B11AE1009DE46DA396791B1C0EA63FB6897FDFA0F 42474042E7E9B06A703A7C6E672AC6705506F3C0B6861BC85CEBB9DC9CE89372 88DBC4F96661C812D31312FDBD0E6AFA59D5E0D41E963C93AE5F9D6562A5BDB2 EF35BEAF99FC9B83D0F6E963F0BBE59633708BABA1C0C474D507E7DD8C3FC2A0 0E05F058D68121D18C24FD704053E9568C1E110FF28D77255EF61C590A82774A 36F918A82ABEA5D650537545756AF0D00E5531E48A9EF82A048F9ABF657FD6E6 7A86F4EC045CF79F55472FC309009C30F1C3566B750DD4192CF586DE51D718CE 4E3203A1196B6C1B2C006DA31157A6A6DD46B4D1B3339108E2D9247B3769DE84 CA991F28D39B289A4F3AA3556BA6774225E83D3E036A9C7CF02AFF6ED9D3947E C669D9690A6B0607463E910C0D29608F8FACDD5CC249BAC915531365E910E062 8C0916C9A80195D4C3A837B0242CC141677B2C582F9C1085BC3584B742F6A17A C122BD3C37CD6584C8D40E7F673FB8B37B3D86A625B0F2987083E14E0E85B2B4 4CB39E84CCE637E8414538034A2B8DDD282DB19BB49971CBB107D16C3B6E8641 129AAF973C7B5548E265975B0F2A90CFA0BDCDB9800F9F13D7AE2DE432FD56FE F121AFD9D4146B47DEDA2CFC1099B1C9DAB8E89FE32554EAED0738F19E704157 D1A34793E173D032F16245239666AD054A9D6942EDC98B21EB7BF54F5C2B1EBD CE86CDC4D01C9D05ED97A4A38F3F28273DF70C21DB2925BCA2B4E479414E99F7 5FCFF8E6AF113C0C43B061AA6CB3FBDFD957BEAF2BFDC1947F8A69DD669AFF10 99E3D76DD5A4945962C6B1B9D8AB6640504BE4A5D372ECEFF0B5C6F4457709CB 0C0B62B3A7A743AFE1C00B37934F1ED8A45FC5AC174336A3F6F0D4386F3DB83C CF9143F3A1A431342A27B66A287D2BA92A6CE6C7DBBF62CD6792231B90603D75 10079164273D164E13868F7442FD4D56DF7C21D7CDACD60B6DAEE2521AB9B4F8 2C1E5EF603450BC562A195E9F1CC903DBB5EDD926DED61EB7DAD9A91018ACD85 8E992234AC9D62CF763D2629F7CF9DCB210F48CDD474BC04C426E2CECCDCBBDD D02819085642CC479A7551AC5123CCEBA6C81DB91F6A27E49ADC764433697176 4C8F6A20247B49CE410988A3940B5A7593797D8A4F67CCA9C991D6790A819B52 AAAD0CE9206955843D46ECE2BFAB537F81BE41B6B6B86D86D1979AB37E177D41 6C865EDEBE02288055452DA705EBAC5D4AFE97D78954E3B28DFF4D0BA7F68091 844E7E681A3282F7FC211E13A7C644170B7CC7787D549409C688B1419D3454DE BF570A46CB6F67CA472BDD5A7B8E16D11A40B488136291D57736A445C9C25EAC A42686BD3320E18FD75743B0B3C78EA9652D67879F3C114B8A5E8B6E99DE9C6D 9A6CBD0990E3CFB656D0A3750533B6406B6E4F61160966AD4165B00477B8B501 D4F5B5588C9C4F88668DA9986CF0A4655707C0E19F4369AD260BA4E5F609BD30 646213E8AD59DC1FC6C35CA80607ED028EF33FDAFB8101F25522059EBA068ECB 55D5B090D680EA3CF483FFBF44E686EE3924694FD82DFF58B3F228223DF2B2AD AEDB5CC749C4B2F54C33425A5B674C0A3C4911728B598303CE6A18A4D5D85DBA 9094E105CAAD0F7391273F4E0FA93AE99076AF27F0B2A858284EB11050DF759A B7FDEA1FC7B70491FAB93D6E15AC08C38D8F20F5F793C089AB91123A01080548 802256F9B2667F310CBBE92862923F3119B8DC47A3D0E704AA7C37E63715D5F0 01EB120BF36C723F0F77FB88A2FC7AD0509BD6DB28E2E057E05A99D9969F3913 787C334514D0136514B9C8364ABD5E890FB400B34650D6B02C13601F6E733390 1B8625E9528AA3E4A8496813687BB411670B10C94E35AB1661B14E8877CDEDD1 1680D5A7F7A701EE281D40A90AAB6D00D30539E1B0D9EDEC9711F4EDFE7E4BF6 43E63A8CFFC8027A67E904BA587A0B33795352B8057E8F3D4D3EDFF75891A1A6 B9B23604BD9F35A475A2BEBFAB5153D461C07824578B1B5370926C4ECA10ED72 B8AA80104B4E0A36030309B41C4DAC2B4ECBB370B685B687EA872452C1956802 8F08AA0313E0BF5E84B7D4E07907787E83DB7DEBE0A07E40969EBFF6D397E0AC 30205649C933A94C5CF53A7AE7AE268BA379FAB7929975425DF74660B49E571C 1BDE7D5E9A26CC7107E99558F90AC41F7D7A2AEBA96ECF1173CC7E8A9C109802 186AC9C475950B058CB249FEAE07E1C10CB6420412C672FEE56262D0BD65048C AB5EB395752344A096B4C8A969075E5097220816ADFE6796A4713EF7A3E40DB1 FA5DAD6FCB4AF346C1FF3752585854C18C871EAEBA8B1BDBB21A0E912CF4F75D 566F9123E268E792144FE20B24436949E390AC737DC9BE22D70C47C5C68B55CC 6B9BD17AAA6E4774F79C579E31310F35084808F6F1115CA55BDEAF26E630E5D1 0C7D7281C405CFD48C478C457CF37D5D21D8CFAC0022154E1325ED7E7D9A238D B6937066FC0F884F0C8A2E52A40C234EA3666415B37E79DF04C373C5E98DC38F 2458BC03E20A874C61E9C65CBE5BB0CBB09845F475EE91D3A789CC4D1E3F74B8 16DB60C84DF6C7804457B00128944046044230C8B030AA6D8BBEC3C886399E7C DC62884EC2652F2428F6955AB676DF8518E1D75ADFEB9C29EB4D9A4C7942212C 07203BB13E465F42EB5E8F516F4F18B9C177FE7D536B4D467A147297996B9063 1029DF29E739D1A9DB992C1B98FB6EE5479E68779E5A24BB4C05C70C79223CC9 B85EE37408A99D9A7403D0D24CF484919A5BC731A13BE98B56CC23394F9F3DDC 47323EEA5B227BBE9312E2074193AC1DED29E570950AF946A09D12F52C841721 27B0CAEC834A391C1E2DB2D736FDC92B3DCBB1FC128034E8A2381145C6426AC0 317E796BFE0ED1459EF793864DADFAF394DC051DCB5F1E409050E41B3D90D821 94447BF370C7CCE0A391899D08B9CEB3673274A23EED41CB5575C8896C8D3EF9 9F2DA10F70DFAA9BC0356ECEC7CCBB9EDED943EB85F3998786CB1A305920B7C5 0F7F154C0F22A6B53C186C3225BD58863FE1D9DF38FE913EF330CE80EFBBC43E DEE10A0DC03F64F0E4CA387130D5783E8A1D74EC5E65D8691708D655B69B0D75 7063B34BE04A4423C0514D6D7E8AC8A8CA198E5DDE9FE491A846BAC77C8CB95A 39BD4A352A12C62DF10F9D4EB04305EB2C683AC3B4A9EC143167C7A506DF61EA AFBF31298EF5100910F62F31F50185F8000EAB4825599225DD33ECA9005C4CC2 042016FB9C02418CFEFDE691DDDAF317A96F4AAFF639DF1EEAA31A84A5DEA1B0 4540B756B0B4FCC4F51D80EF8CD0DA91E38D2FC1121054E9732A0A0ACE182624 166722D9D6384AEEDCD7E6F3DC49987BA683180D8424ED60C600D143EC9B3803 E12459BE9A3563AFBE340864EDE14D416EC3D3F4BD0D3261E4C3DDB32922D953 3229BE070175C21FC6F94A9B0AE96AB31605BBAEE010D939EE89AB91738C8F45 10CE2906877AFD2E5F39E7C45CE1454D1C167BA90C2CF192AC834A4D1605BD94 6D9EFA985E106984CBB4ED442042586391FBF386F79999855B4812C437458063 12660E29DA28D77760EDE77C45D84E758EF3D265D2AB232A7F63F86DC8DD3534 01CFC76BEE8425B16131F483104ECBB582FC38DE857F05AC7D8FA2428962BA07 2FF35FC1FE7EE7E2D1A6CE661CAAB28D906E17D9918648D16339B87792FDF8D3 B04EFBB83861FF4610343298BE567E5A97B8E41911E88CCDB6710E29F24D1FAC 22F85455B4B17D6CCB61DE8E639E0667E46DCD004F5ADFC2F6CABA1B4180A25D E36C1A57DA64335544DAC4F790634C28C10F6AC8DBA8B6B0143FB00E7E3273F7 1D221F65291473CDFC71BB4F3C911DB6F5B02DD38A296934DCC471EA9DEF3941 9861D6F9D72FA13168DF02CB8880043139329C14B0D93DB8752C4E006C8FAAAB 7434BF31F2EE305EEC12A2F8581D86A2F93A22C6A16E7255B84937A97541F875 3A6737AEEAD8CC05C55278CD05A93FF79A573F08EE662D1451B7C29293FD3219 FF1F07B5EDD449F95D802AE6EE9461525B57B47AD676226CB0AF3C6C0E23CA49 8FE6744C36AA9A45F26B4E891691FFC7680B32B0F6C4422584579C7A13444C38 4C9067787825B07042E63B9C6FCBDE652C60D5D8574423A43CCA948E5B638CA7 813E94BB204CEE5BD7257B98D25F0207709974F33A9635621C3464137BE43708 97921345C6FAE91B6E974413EE5F3AD54966FEC1930A04A06B170EC02D88C95E 74FC4791588B9C5E8325DBA166CD541AC0148BF212BA9B24171312DFA9D8D946 B413C86FDEB625C874A94B986CA795379CD5B4061D2FE3C3A44355629714EE5A 3E6681C38B6C63557220661C4F7C6B38DD78B2D53021E9C3AAC3ECD21293590F E10CB86944EDAB1FFE5380E71276C60EAB7E9F1DAF306CB780BFC491511FFF59 EFCF82AF7044F013A1FDE387B201745FCC384A1744B16A299F59BCBAF2746733 C66F9D61CACD3AFF06739F388BF17F8292B8D7CA97C74386C93517AD89CDD358 18F35429A323958C0A528989A483DC1C8283F934AD2D560FAC2BC019A171E538 8AE1FA57FBAB7E9DFCE6483A0FB077A3A9EF1B9A39AA6B40211BEC3A46F1FEA6 11304E85DE80D20B8F155A2EE61B251535B10F4125F42E96F7E69CF3842F626E A34211CD49F42E03C74C1847E4DAF520D1A63FE74CB64B9D8314B8D1EF27DA97 E9FA4832346E86C1A47229298B3BBB52D079539970EFB2D13C85A1FDDB9DB567 0FDF672B9F3D74BB0798233CDC7A5057B697A11FFEBAFCBDC096A3AD9FBEDC38 8D8DDE21EE771251614E6540F835B394D80A2AEF21B41B6BFB1B762366DD8795 96EE306285FCA61F798F7C5A42C6E8A030BA7EECB8EC0BD769645FA3CC20DE1A 9107BD487278F660E74259BAB36599164D75D76C85777BA55226FDAF8D0D5204 0E030A10E035D32A32CCAB9F4C9D5C29ED4054CED2C59E5AC4177C736158B095 E800D8FF594A7E58589188F31AE61C754621CF48BF115F9DC62DB1D2C8807075 8F0955CEFA77F9E16A142D71DB3B36D27C78D824C85FD1B6E73566EC486937FE 85441BC81737AE4594EA4BA70404081783D86D7F782E996047C8C2333E1C00D5 260BCB452CD4F41A18368E2450F45F77C849DBF780D527C972FF1CB1D90E2155 B034450732E836A304C0C65A22DA2D3DC0DEFB51C62E5CF24A63F38CA9A7B725 6CF94CD6F2DEBC79AFC90912E05169B17C27CC63FE88C586A3039B246F6DFBEA C4DEAAEE8D94B91A3AE29A0F60470725430073E555AB6B69E97A1CECAF416959 EA671A353EEB40353A74C4397056796C948CAD4E34AA5649843F549DFC47F07E A46A2640A04E9E88F84803551A1858AD3C491CE4262EA7DE5CBC624CF9EDB79E D7649BBEAE2207CB7EF264D13487BAE1C05B47BE48EF0A1E423D52D626969F19 9BAF6C36A5F7ACA1EC5146751538C74BBC3A33408E950907D84A85745CB3C619 30890699C822D7FA30E4CE63A4B53C442D9BE56A99AC2EDD02C799E611050018 C6B95DFAA9355B146B1E3077C44DFFD62E1ADA32C5C21BAAA41D38C7782C1CF5 10ED256CE14FF1576E8BCAC3DAB51D9FC8035628C1B503D16659B2B761BB63B5 755C01509EE4433750EE5B0994E956B1567D5F1E9E0B7DB27681799299FEF9C8 C2AD946019AFC351D190BFA2C1B801DB3536BE9721DF544D11F39EA4D9F1DEC3 462E608F9CE48AB37F16A1874FE5F4AD980EBE76A345A50B2428C3DA1925ECC9 DF68179939E4EF14C760B1EA2E4212BCE7C0CDA8B34CF2990637829E8E951ECC 0AFC95875DB4F44B7703547C1D3CED8227C3F7AE582111EBC86A8908515FE091 2D12733064E9D215D4A4EB350DE11D3D3BBBF8AB4C628CDC2A8FB41FBFBC4048 AF83E702287BFD3D16F6FFE56CE24008B735B517D364E7BA4B02300B594DA978 0937CD3FFC89CECFAB77CE33651B05F18E56EAEC5779687619FC1878825B3776 89AE6FBE36BC60341E2AB511079FE8C9CFC57029CA387E28E78382CB0F318B8D 3FBDF6F5D8C097BF895955BAE8591CE021CCC49976EACA720179B72B68EC6AA2 427CA0A8808552F93676CD7156CC445787A052A784EA597E3E557B1141E32EA7 9758E599D3AC3A4A33A7ED2282B39DEB413CF1E63555953037FC11D9774E8281 E13DEE841B104551889CBBAFD08BA6485BD850957CC7D8355064C23CCFC09B86 15A1A2666DB274D772064661AD58CCF8B04336371080E88695461B7E0526CE77 0EB7596E6DBD17274E021441A6932317D5024AB0240C4944AAB762613A5DFC8D BBAFCC8C2A09C204E0558F49B3B9044BEBC0987548D105028693DC68DBB0A9E6 600C9045FF964A418772CF8D73808A59C278A9FE1825AF4EE6884E4E91216179 05E79DD583FFD06888AFCFD95E0CFAAFE51737076845363AAA1E59E1EDAD9D6A 0B392522EE77BDDCB6D191C7B797D203FDCF2DCDA4B6D4B74EBC6372A48B13E6 6D33C4973CABF2A3D8B91BD71421748308FA2147849025FBD2F1866908910C79 59635A0615DEA01BA7890B3AAD778D109AB6A785FF83E8734FA6AC6F7ECC990D 6DC1108D7D15164E248C6D1F0BC962C52AD2777B96487CE582456B2BB1BC33C3 3425403557E92A95DE74A982EA07396D0E7C5FF16C7BB1A54124A0DFC6FBFAF2 DBCBC7A2E723EE5B661FC62C2C396A3E3341DFE5031DE0E15E5BFE6C8305C555 728B93DDB0D2F998EB3D6E8526A25D77AFDB89149FDB6CBC03B80C71182E0393 E451562E199E075C5311A3674F372E6F0F2DE8954F04429B27A448442F0CA5D5 2404F4537FE01C9736A786163FDD429EEE672A60D52D5F58188549D9E9E5ED41 6C25FF8E53A97D859B18F91025B5501E09638D04DBEF22AA1D160B9CD4C94876 9EB9D8BB838455E647B8D4F4E5ADAC207E9C1F373C63B3987A07E0BEFE97EC54 4E24C1C0B953F3DAC89D066DC66CFCD3AF8AB505E6559BB8E9664C0647EA2030 65BB8F35D639EEFD9C0471BF83B8CE583C5288B12E164CCF57C31C326245A528 E45943DB79E305DCA23A2EFB82D1C752C7499CA8A01A7ECF7BF6B287350609F0 A2DC4FB958868D298978EB2FFDCDC4A0C8DCEF7066287EC7A53F7B350D5C37C4 E7C92A0D8232006FE5C7E3C22EB590C93A4096104BDF5117AE70DE4EDE2EF87C 11602CB8D4C3AF679D17FD5167C1AB635AE508EE90B912656E9121BDC481E2AC E7273B5576EF99038F2F07C7A23B5926DB6D9DEE504AB75DE45666AF661932EA 75AF60F39A6456EC731E53452B9BBDD951DF4E4FB7374B0F9371EAA6D4671432 461357C0C60F46C22A1A2B643CCAFCE21C74ED943AF4F5BA2478860F56042F0D F85BE9A9E810FB96E5A9D8A979CCFEFCBF1603F25AF1837A9191759387053011 7CDF0BD12C3417EF376F8E3DF06B3C48DB995618F372DA8705C9D04297D1B832 93C0316D8FAD1AA1F284BE4901E4B81079D76A018F871E3EA3B5BB46493652D2 5F7BDEE050F252308FCE5FFE339AE2230C3F5C9A28B875B2BF2A915EB1E23F2B C38B3A78F3E5DAC5B295BF326EE53B9BEA7D505F4CC01C6A8D06B90ABBFECF7C E71CDD427000179311C9D3BC851E294F95BE11F2F85A6BA3C217EBBB22761BEE D503CCB29BB09393917EB2F87567B4CEFC4024CD88761DBF9CEFBDCAACB1CDC2 AD3EC0B833F79B10FF2D912BCDA6C65E957ACFAE5D63ED379FF131919BCCF1E5 E88C26463F5B9587BCD7E153A12C696D8023B2E49A103C0C61560784A4FC0DC2 9A075F00072064FFC2C341DB19D82E11EED2648C7F6CD06270F93F4A2F5F8B75 858AD309A6D5E63B583A0E835D210F60FD71B9E159A8D639FE5E774D3754D41D B4B495EC984DA4AB7B831D13EB891A9C93150F3F50FCBBCCF047879CD4CE8F0A 0D8C9A90B89F14ADA6644B83E6D0B0890BDC8BCDC5EE6DB85CE8FA5F02DCF259 9DA572E0FBE9B2D9E2517667366B415441C6A1E56BBC5D0E6F88B2C03A17C2EF B13A2166C34D3C4C7D17DB62BAF7FDC49FB301D1AE0524D87D96955A2B38782B 62AACDE5B43E8D6646DDEE92C2C7EE93E4D892594C1D1BC58DB5E503F9A6E1F8 83165C19669F866924DCE4CDB53DF78E3A38177AB1507DA65916AF2A6F7CF34E E327C51527BA6E8358094F9EBA9957914BF0195E58ABC869E79A2E68C2BAB04D 75267D48E998F36CCA9A94117D1187146355E5E65A15A3D9C123F9199352D5E8 7AF96F0FD88C897A13A810DD3960B517462057C0463955471ADECC244B82A0D7 A93F3AA163855DBF547F7824231630C255F50311CBC7A48273A5FF91722480F6 782337A984344897E888C830DEB079EE3E7DA1312C95AD5E5078B63D1731102F C928820255CE8742C2A4B412AB6D662E40C7A767D06C73AFFF8C6336053078D1 7FCCAD175C7174016B054B3D09008D01D00D6D7FFBF6B39A053AF0181B718B90 ABC6DB0070BBF8B26D51D46599D8C2DD46A6F4A033FCB04E9EA807D3F3E9C45D 99FDC21412065FC11E2C9A0108B61BBDB87C9FB92CC6D4D32B254A45E391051B 9A9D77F5B2AB5452AE72B97B458B02742D74B5A946A9B778F28492F3CC5F3524 6645C9DC75BCC4FB2C994C86F91BCA6E3B20579C2219BFE0428668AED62D8470 92FAD9574363420F7F118A93ECC35F6FC174C74C016B503AD35710EFCF4C5CF9 02C7FD683D964E60A96FC687F611C496120255E3BD59EE81177B5AE8B6F69B41 BDBDFA0FCC571214D1F0DEFC52F9E41FF24747D2909AB62FDC59B498A76FB399 BF2B8F46AECA0FD74BA98994C540264997CC5615A0B601ADBE602E43ED5EFE81 9468A132227B985905AB5E0C8146B860B8E4D4CD3B33816377E08410ED37E146 803D54A10974EFD818ABE474DB1B187171D344AE88A717A333ECD8E45AB5FDCE 5E9F1DEF736B4B401C38C499FB8D374FA3BEC0931AB7A1AC2ED1CA55EE08D4D5 84D4D75043CDDC6F11795AD6C2765DE8E46324A8E32568903AF16EB7F7D42D6F 9EB34675EDDB76BBC74B8C66D9EAF9923844EE39FC4F8F36D444BDCCB32D5987 9E1A34023A8389C07A8A54BCFF045E57C596D9CBB7234F3D32CEF39A207C35C5 2EC594BC6D6F4D421DC37320E387499BAF6FF135F251328367021C8D48392B80 9CCE1B2FAD718580B126C50B243284A47C22D8F32C5F28F184E0D6A657EB6013 9BC8D85309A05A9A9302A61B9A49E8CC329F7E54AEB59BE426CA133C792FAAA4 C01FA639598C7B21A85E441636E19BC9CEA795158ECE11889F41D325BCD4EEBC 4AFEF80879C543CF28FE5E965E110C0322CFFF655A0C1D596A5ED2E2F831AD10 28219C8C0B7902D50E09C2D0041A2934A08A995E9171709ACE5B14B308B6D3E5 052A17FD842FA9ABCD527C53261FF5D874C5B805D1523FCFF4262F6E92112153 213154DBCBAC2959B6E5676A1735C26E2D174368745A1C8ECC5919AE8236BF03 CD207928040A8C5315B450948EA4D23B99F184137F464150D390E697E182B6CE 96ABEF0CB4125C8AD5D39081DE8A63FFC4F738FF4148E264BAC0F8890627DCE7 33BAA239C09323BACBFED301A71131799FDA54B04DB83697F29AB1CCB8FA6E01 DA5872D91E04392C1E635753DEA9C107357DB99D502CEDE64B65AAC691DFA7D6 53D366EACCC105D0BF34A4B6439AEE68BE5861A9F2F8B553F836B73D0B49EC4B 3E2AA6A55A026FD2258DD2E17BE18ED3AE93168243710DEE4C351D3568E39A5C DFA3ACE49BE65A86B2653BD63618B3BD1BD365BA7462140B4B9B2A81E0786410 46ABF80BF6DBA2E07503107A82A7DBC0B05A3005DF475E1BCA6417866555174F 08D6E401CC5EF31D8E2F2E89231D374AAD3467594BA95798DC4BB19A15A98FD4 D02EB96DEDE561B6A448F6772028022595A1C944D8EB4C9C0C04D3EBE1467157 99D8C5C72AD625DCD92856C1D793373784060513E260B587F3DC364C484C36AA 07BEE82A0E0BBE6F80D3467F02FE6635F508A6EE90FD293E81CF99CB3E52FA0A 763DE6CC0114A74458F738FAD91A088C9D25976F6286C8E0D2DD61A71643FB69 1415F21D1F6A95462F889DD443DEEF30D118FC756F917A5714C893CCDD7FE3A7 57286E3A15D5E87931196D64A026DA4A4C907C38BF95BDA599DC7A4F1967746E 4473ABBE80A5DD49CEA25B2BB8A9DFFC3537A1F5D4477EBF142103787818E09A E5D50417F82BA1C422B33BB66FC018C007987ACC6AAA798524FB776D7550E3DE 95B496B761D2B1EDB6B2BB0134A039D4BAAA83614B0058AEEF40A693D24AFE9E 7F97A02DBD8119651CE48E196A6F60043B34DC444DFE2ADC6E833E34E52B3455 A2A035DD0BA864612EB104C0C0D5E83D631BA37F10A7AAD7F630C19C6E8F6AC0 DDF3BD600808041AEA7CA46BC360F5DC1A8001FB2C962237E77ADFD7AE114290 F18B5DBD7456F3FA921B36CB4A6E90AAD8D12B27CDFEA15A81A590C1F3988660 BE432900B58B1CE7492672946CC32523CFDEA14777B4596330C7E93FE4C6E4C3 139C7EF73A4863A2A76863438CB15A31019289896D48AF13DD320428271374CD E901035EE605AB95C0033DD699D58B49129B0AB9C535E8CE5CE9F84389B3CBEF 33FEED3C1ED80371098ADAE53FC2B9A06515194632D184B8124C6BE8A25A5E16 9F23EFC9D3568513DACA3A97D8030E10D0DB62A117F573443D78994B623D7D39 0172E22566EED959B56B93A51AD64D9B36708881A2598C9422463D8BB16D5A78 94FB7535DD5E3BA93E6D2006789586C2441831522B2A87620835926DCA369367 F96E54DD0783CB5E0760E92B2119BF1EFB1B7CF18A70B87E5332CC6DFCF10CA3 F62A22A8E4E6818FC045B1B0FB0EDEFB230BE1834CA846F7C5E099A4C54C5F65 FA029ED16F0BC09AC2654C7A9B4114BE54DE04889A2EF322327817FBC8E6D0A6 F5F115A28A2759CEDE0CDA907192854912F402C9CE5790512F3B4B85DF290C6F 964EEC7BA3A5D2AF19417660F9FABBACD29CD3F1D0112E40C23C02D8A906CCDB 2757C309D8B89B88C3D3967D4BFC45472BF2FC58E888956C503F2774EDBC8C00 1E50E35497A0FA5131383AFB3CB8CC1DA2BD99C85AAF3A2346EA3DB89BC877B5 D37832226452483339333B2E4EF87E4B2985916DE138BC548D06CF247FD3BBF9 DC5BED8B1AB435814998EC910F71D300069C1EDED83E9346A85A3AEF295AF7D6 06C98C6454415056C21395D6FE6D636A1F316BA3E3AC963F9064532090840548 A62D1E3CAA038509C44B2762D363BA88C32EE1E82A65849278077875340644D3 38E445E3BF798205E90D6C19501246A2A77B93A65A82C21F763F7FB4AAC73823 FB377164F0E7683A8C143AE37F95D424C60C503640565ED52C9E79F720038392 5AAF1075DA2D9648C691139F1531F212B9BA66085AF612C0A6FCCBC49AD9A1AC ABD7BDE6998EE089283450DB280D71078671CE182F5C8D6B5BC6FD1EFA3D23FE 66C5FA9F47C81C84B81065B3AF067E617C2A49FA234EB71739D885EE2A088D60 F95439492707E02658BD498EBBF56F0435955718607D56B524345DD34292879D FB035E52B4E5C232771F6975285A56B6B3808C608B5408809069305E1DB194FE 33A29E71F16FDD2681288216A1A284919271D497D73E7F52A1A73788764063C9 44BD46F1E6F60A2A1709A06D653336A7845898E65524ABB1DD3EEAD1554B68C7 722AB41316562032D231946B27B2D809CB3AFEBB2D37B6BA50578A7F817B73FC FABCB63DF361EF5C24A607CD352757EEB7FE6EDF7BD7C1C0671B67064BC272C1 28F775A8012234BDF543AD5DFB86F64FDEB355F1D649AFBCF651BE1ED1DCA962 EF1F3235005A3CD6DC0B78DB6CA65A0373E1893114D6D4E5A5EF1FA6BE38E9AD AB6C62AB892E9AAD121AE50D5B185651FBA345909078FFE9FE7492EE182FC5C3 3F9717CE10169438F0FFFC3A84A84FF562B8D2F825E305891758D6B7E096C298 BD344F4BE443E423A0CE11E2428000032E06DEF85E3A5BCB9FFB8AE4687A539A F6B24E35385B10758D3CB03B34020341C9FDA67403C2298AE94C70A18FDC8BBF E7E0843F4BACE6D4F3A484B1C425084252E81A99414FE78175B23985846B1564 D02B333BD8209D16F89BF12970EBF251F32CC45D0D59737AA3C416EA61B74D23 75CD0040F8A289F1566CCA6B3B09ACC51AFD4BE9037483134687EE187C41E571 EF828AF4827ADC11BE88B28A0CA4E38F27DCFD55873CED7381EB4ED80A99524C 165FC25B21A0D982C650927023B246A122426C45ED4A730B66F160851B24F703 CCCA8BDFA289B0F957B87906EEA88F714497A11912D71355304483765ACF958B 3D114C33B1A78D3C2E667C7F12A3E345AD365CC31F8955AA214A4741E0AD8B06 40BB42258A561A5404402E6DD847A49621D5EB06FFD366EB14EB05E6140567B6 A3174BFBB7951F65248622426E41630FA9CE9782F77754CFF68E1D3BBDA2F8FF D00D99D23CB38F14645776BA3EAA34992055677E2FB4DF057A823548FB0C52AC 8A9511048C13F0B50FB20ECD37743D56F55379353FA48DDFF43D1C712C74476C 20391932824690F5EFC14869AB68DD533FE00F382469C1CF841B1E3C91285E47 CFD5B77615C6B710E9EEC208F90E27A363F41C4F0499935074B528682F33C1B3 7AA5C2F16CBA2FC1E0F87A0AAA3DC8BF4A6FBB91CDBE978062BAA77CC4B41F57 FFC2C9160AFF5DC1EFFF988ABB619D198CA98B2F9BBC97A34F86E0F7CC245AAD 91867351F98D6E93813BAD63F3557F1277F311B80E2E8DE6F16E34E0F5FF5FD4 10B68D52F11DD15EE620C15C64CD8392072419F74F8AF6FF61AB288E2807CFC6 6AC4603430B5424CE3F8DA182464DE9588169350908D368D15ECF34E90D8FE2B 85EF8FB0318A8CFB8EAAFB422EE66436DB534884A79348EDAF9A2AAB5DBC6B4D 224F6D0D41C718F86B83EB6807D3DF277BF391A95EFDDCFA4C2DD49E6FCE3A94 E4C4CA7A8363A8610A5CA5B7B13BDF3E4B5E95940C84D3699C7DD8C69CE3BC8F 1F513D39C25406A42FBC0D4F7926F5074D750B7929BCCC74B2A5A8D9326EA944 72768AD4DF13263D3D329FFCB2989A21A5BAE9C46EB0F28A5A5F2329F95797E4 A6A291DCECB13244146B8A1180C029610DA9B5C5242046D5C3BAD2AC9686F236 70B6B81AAF86F15D54AE46E75D39EE2548264452BC220416E57EBDEC45017949 2DC6718A3D14B931F38A389BFB88B14334447EF414D803100C3916FDF4F0A8D7 B68BE36F7B5AC9FEBB78162214DC349D6BA4F22D98A2FD90B9EF3A3038FB534D D6EB70EEEF1CD91A0487E88B1C0227FA7D1BADFC30DF34FB81E35DEDA1306C10 73CEBB33B7DA3C897752947CDED15C68243F7E1E9716D751B5CF68D32E9433EC 8317B6910DEDF297A1CFBF95C2FBB92EDA7CC2A5B853A5B3DBB1E2C869A13F8E 08FD2ECA621A75EFD69E2FE9CB5B10026901F535BF4E7F30C7A6AE3B00F55696 72FA49ED6B7A28F31DB28D2DF9CA1121E34036C6227BC244A8F22A48F29B7F3C 6FD319F8D8C398BF6D1DAF886FA3023C4B88777F963E74AA0C55B6EC65A38431 5E49F222F81AFD66DACA0F874E2FE897985C6C25347758A0D8608E6388D0EB1B 18FB22015E33B436CAF97804234749254718090DBD3C1801DB22823D0E172E45 978F25643F19AB284BB5A9E7BB776B37107C1BAD20BEADAC0E373254B3ED740E 4D0A32A6D2E8677F28970A49609FCBD876D5B8667ABCE147754178FC558D24C7 6FCD30FEF074372FB3FCE00DDB5B18A56300910F204C63E811985F5A3EBEC7F4 7A654939C8C2FCD6B3EFF62720368FC1264335DFF72C3A9B0E2D7B48E457941F 5DA2170F5448D870487D127779BDA70EC0DB3F1867C24561DDDE4DFF123D8551 280657FD211EFC9046FDFC083B03C04A7235EDFC207A00EFD54B962C94596101 8CFD7E202167DF4DB18E58919A83AA00A2678C370AE5F17623FD28D5158B8542 E5A28FFBC292BF1D2D236030187ED2838DC53B5E7E7536D898D88799418D9CAB 6C8C9EBAB0F089FFF4E2182AB7035FB6DC7A1DD60DD708728E65E7180CFD7B11 1E5C3A1B59B424931EB0854E08A29AE3B8FA326BD2EDE7AD52CAB7BD80F2074B 0054D51693EB90200F8D80BA4E00BD079DD54E311625373FF739251160E44EC3 6DA82F68B5F4A2B2CDFB8210F6577C22DC2B8800414F9F2ED2DEC8B5515D9D7E 9B11C9AD0101A0A5831C53AC007048D0DB8A377815595CF63B2F9B4AA6CD10AF D6802D71A97035F1B3C253CCD06A931F5B6A1BB87C05CF18332783033FB6A09A 1E92D5A657DD5F95969AB7BFF0C1A213843B1C247392E2316F3E4E85A8DA8048 F67CDBA7067FD19D3E6AE0268118AF722EE59FADE9624050D4DFDA25797C55D0 2E2C4C345DCB184D0706B2B3326CE2875FB12AB338892AC5054B51DBA189B2D3 780A6FE08E8E5A729C44D241FDD9074CF2869982E5ED9C80A77E57D90BED86D1 A49DF3D189EB13D2B25B1C176680304FE6FBD3FCBF4D37DFEF135B5CA76DF4AE 34F56E08926B653B76AB1D769CED9E41A017B3C6F6AE2F5DB2228DB4B476C11D 05C67986BC0FE0BA77E1B57A2B0B6DE4BFF8DF20DD19DC52CAC77C9A457685C2 3F255B5BEFB482136AF381FB2B52786A055F847141BC5292735A255AE3AFCCE2 62248B00DC1BBBC9D87799A72691D56D737C9143EB92D779470BBFB4150E5B8E 7CB3DB69B383352211F2BBBF0362F1F654F351E58B4CC642BCF4726E3BBFC4F9 EA7186583E117D73673905CBDD7B33127B3BE3F979031B6E0A858B205C4BD450 46FB47FE7EE3F6662FB9D6AF3484032AACF368E23E16AB67AAEF5D21EABDF65D 8B4414B902EFFF9B67701B836D91C20D92B5C18D980342E9BD9C834A4266FF14 DACEB9CDB91ADBC8377446B07192AB3401CFE6A35920ED5089720409E1951474 C33B5F87E617EAE9FA1B7C315335042A614794895DB545BAADF0939746DE346E 08258E8481F9A02A854E3773394C58FA1130E59128A3D9B229AAC8FC0D7F029A 4C2354983CF6985A495983CCAD4B00C8B22F818E49122CA60F34434BC713ECE5 27F7DE27339B9A46F0D9DE2A36056CE04B185760E8A43C4D61CDA9C9618010B3 E6B7B3A033A872EC36B3E67CBE583F1897F406AE6E08AC02BFEDD4BBA87897F8 BC3262A26AAB01EC30F482139EBD866859219D64F66D6755E26C2ACFE07A94FC 9D93C3E4761B8B9A37901611FA55FE882D9DF38787A488E9731057DE5DA081B7 D3052817F5BDAD299734960179E370A954FC694EE1CCDB9221AB1CD47F5D8317 ADF41385B22374FEB8697742F87E473E2D47DF10F793514C5CE04BE2C5C07984 BF6D9A16778EBF7C9E2DE1AFCAF44E45E0F419E94042DFBE37677D0BDFCA47F9 3D6B72642FD35B6568ED554D2CC8B4341F8FB81C33763C77EA401513125A5554 4C091EAFAFAFA7C19CEC41FFF244F013D8C6298EE0B9EBB7932E14541B4BC8CC C3F080415A8F016E2535780BA2FABB5753AFCBCB13DA8327317334D9E5605AFF E696E2879992B8F01C19227B3B31E923C14499ACFF83B5D8B73B300593EABC9A 892C6A90B66A0C492953E53D75CC57F8D9B8BBB6E19994FD03140DC1C868B51D BE73A61F7C685A3A9ACD538BF020C5363B1A146A83CB93E7B8637100DC6EAF1C 9B9422C4C0EBDC5181621AF1C3DF04F9F25730C40C3738D864F4089FF310B532 AC3E34974D87DF814F62F18C9766F2FCC22F2E8E2D1345AD1031D25FA6E379AA 4AFD6923CC92B3DB7880A7DCD2125B9AC32731E3FA2C3DAC501C85993E3BFC6E 3CB069A860FB2BD2F47E9A9A8F5AA5D90926A7D5B1AFA4AE370C650C18287C6E 4340DE71CC7027B28E54F398EBE74B101ACF563C54DF227F5857E435E9B332B1 A2CAB0E8D157F6BED371EA19CDBA98188697838808AB64F6AD8B8C0B611312A4 C52284A1D3BB62649934F3AF83E8680C4298107A9BA4937BC5DFC6E02B38D840 93798BE30797112D44C9AA9CF4E9437D11A8908D440743F16048B8F01E4DD644 8437F01748A496F0E1E95F1BF0A8A68CC3EC5D5687E8AB253207702CB2FB20AC 7A98D2D9ABD7156A270285E95138E27431FF37807872075A8E4B81988D59AB9B F4BA0E52D4B1D19047CBF5F66274B572A28BE387F4B580630F0C6199B63992DC 7C53B6E7B1CF6CCAF045CF09C8F7A0951921667A93C1493D749C2265ABD7F562 F595D537479000E76F5821EFE62FD197113165DF4289D5E1CBE9B05625A5F995 BB20409586D632BF2757C067AE77693E83A8921E04D3BAA94382B93A3E3693ED CA5A6C71D0073B78371D58BA0D2F016A43350F00343D6BEB95B49B7226ADEE5E BFBE8E2DEE5184187949A7CA9849127CA4E99CCDC1C550352D370567C62593CF 9DEA6F587EADAF2F04EE4F661D8FD7AE380827082C9AE060182AE0C63A3009E0 E1BEF1550620A0E462A0B8918BF60E06B61D3E435B428D615304AC3023E83772 C6B048A55AF204D70609174535E26D0E6B3A271D40AE1C2E5D73E0BF2ACB1C98 FD29B84C316F7496A482095BA784958039B6B7D2E9BE4FCC3FF4AD97B3CF54BE 7BDE581049257BA31BC9AABE7ECAA5701B91820A36C62FF7573346B9B30976F0 A43383030B52BAA6C11DC6C8B745414D41D4BDB61CB97F40BAD09BB4EB0D7209 2CBE2F02E4D808AFBA930C0BB8C106C5E59C922B770648FF3A3687FE55BD4ACF F0EF66BC4A2099BE15B16EB32ACF3A27497DA2E6142A2B9F13EA2A3A82EA7934 627D3971EFA6AC61B42599CB1FA51AB0DD8F4F7998B3CB5E543CE620E159D1A9 1B8121B319C0C3620C1355BD1F9F290174CD1D2AA05ADD70D60918BED9FA0A18 BB918CE247F51AF1B246A6515D62796B98F4F84D0F10F7234C1E6CDC520C5561 3C3D984560364932AA1AE0E2452FE7753916DC8B043F43EA00C2BFE47C868308 F390F7450AA754830F10AC9FEE0F230FAE46DC5CB40CA7E2B6E5CC8B22D64BA2 E82D011DE86FF52F012539ED02C4F58EF348976964AE729B949B77DF7ECEE7F3 F51E4202E26E21DCE18DC0FB0D31EFCFB0C188A52699AB1F0DC1CE623258DF54 B0332C84EEDA53BDF58809283A55C1B090503E2E1A0DA3E647832CF3231BB54D 0D6D6E4BB80425136FE1727EF3DC39205D1079C6414BB18C87AD7D3B445FADD1 ABFE8BE5E9B857942BA11EAA62316CD74848CC89E92D8697F20486F55EAB7468 FA49D3687C78B8C1A65C6D1D28860779F86A4068427E4BA5D8D5D4035B6FCA10 363AC21D2D9FA6CF465327CC19350184EB823B37AF8BF7501228FA813D9F022F 2FC12A96865C7AD4E799760C395A3FE61B5BA1369D12B045A8457FC32BB3CE24 2EE58564A0EA57A09F0EDC7223DB08C10951D4CC603E0F71859C4F05312FC832 5A2E34621E31787B0C9C762427803B6DD882EC59B545AB3CD8EE4700BF7E1834 C9431827E3C2A98DB9D2DD1E525EF0387BECA6CA7FA349040509E0C4D552BD3D DF1EA3E3B35C0BC7079A2C2ABE6C0DAE9EBEED559B413E34461642640A640244 A10E8F7A82506DB94CF83D2D44754FA3C2160821A7AD460762CDDF64D0960980 FC341EC9ACA3BFCA0600665311BAA75675E1D99CB2F24AC2DE674F06C03C6825 6B37946C533EB12A38FC2B31C52A60CBBB09B41BE98646966A43F0AF2402F4AA 57C0361DB95B1CCA33E4DF4E2EC2B42BF6DD85988CDA7E05BE6D949404DC878A 6B3B926A3A7ABDCB84836DEFBF5CAAF9EBD136B7CBC274729C142AA96FA6F20A 12010DBEE9AE0F53D568358ABAAA78477C9553F6C499188BCF09F0DDA2153035 2A47445EEC484F2A6BECB882E2CF121A04BAFA1A96FFED21ABF2903EBCE81DE7 DFE2787FCE858FAD5A9DC9F6BB6C520715C942D2A79D8EC549108474E00AF2D4 D466F695FF681F548F2829868172F14950E42CC66F826A3A6924A889C7AD044D DA06BDB19B3A49E60CBE7E9392DC77D06DC6600FC191717833206EBC349E3C64 AD0A7A3AA8EFB80C40A3B1CD93FBECA377367D539C0A0E91E2E6932BA2F50840 1FCB806459D2B4A164F7CA0FDADB88D91A4C3EA388FF62A402155A0E16B03435 F678283A1F28A5035804D3AE65019F31CB048D95BE60A97A6494F32BA9E17941 596545162A04FF0171A36F277F49DE998A3CBEB8F8C598AA96308CEF78ABB2C9 D8F3729FFCC82D8F529F017AE00AE9F8E5B02C8C1C687BC945059D72720C9716 9DD15F79C992F558874E9DA253B01B26F75F9F0ADB384B919F5A8427457B2EE9 7CBBC543066CB01F02276F0FA20A12FE9CE7E69DF74BB456A417588C22F82CD3 8AE7913A959E7D27B759C94D67FC55BC4D1FCFE739C50E5509B6F272B174A7AF 688A45DDF72B398B6B41A3D0BD3820791C943656C77FA49AE2447079BB4A61B3 397CE8F180621778693642D8493D2A3A1F2C54D475643671B1AA972F87902C62 8EA53B3EC372FFAE46CDA4DD79243DF892B2B49A3238028F41FDF9A1D904661A 5C89806C6E564789443F774A0D8F39D1925367747E62FF8F69279157D18DF644 A49318E7BD4F836ED366963BD57A5F704A55795567F23D2C1B07975A82B76EED 75ADCA889839536193CDE285933BB2495252D7B33C438D28349F30D71E5B9910 BBBFAA5D5F894E02EBB4F9076179115E5C082B34EED18535304B12ACAF3A5D77 C10AAACB24BF7CD17ADC52666EE8D730EBDF4659EA89EA088C1CB7D4CA4CED36 8A99AED7F997CE967808A477315F4919506B28C71805BB5AD4C797F5F98C81B5 3BD861F9F57D65662034C1D4E88F23A8092BB709FCF1D2F481534A4BBA20A18C 6BF85598FDF6480AEC0989533CD11BD25DF8C28ED16E6E8F75B91CCB41400602 DB164070B89F38B4FAD6867886DF305D45B8FD57C72489096E0CC2153D26AE41 7498546C6964461FD455441EF6BE1AE922D0E2A62253067BEBB65E926AE232EB D76AA7976EC599E9835E21E1D9EDABC53081E80F7F1B338F5A5F7D4E619FD6C8 2CDD33A1299C5DB13E7F5BB3765BE54EF46A2A5E4DB5A00D30609A085920C7EB 68DE604375D37EB9A0622783F2332E6FBB4262D268B79F5E939A99572214F969 C63AF218A2C6AD6180E819E880D9A78B0128E93E004B6510769015A724F64DF8 0E37A8DA8E541E836CFA5EFF5692585AE779045D6D4E2EDC8580502A5557AA7C 7C21EB7DD58225EF9676F2134E0B1D6038CD9CC41AA0BFE88DB3E2F1C8360576 3FF3557F29EEE84D0D14DFA2801DD9E8BC3AB5DCBBBFEC020FAB62671845574D 46C4BCF1455888C25EC9DCE45EA37E89DC6CF152503F9D118B9280A89C8A0C29 5E83F0DA2851A04DEC6AB0AF04B0EC40D17470605A874778D089F5150A19DC33 E29CD339F738111CAD30E1C542749C2CF8C23AF56212429CEC5F369D8D7EF956 5E3B00E83062875E4CBB17185D672241E2CE4B0E5CDAF8820F8B3D0B999CA50C 995EE9678A23B8E00AD23D18482C30DE5425384E2F7E68A8D7A1FB279B9B0502 D6C40FF8DF5137E9AC0FE1300EA255AE4D6B39AEED6F9E15711AF84C1E913D79 8F3A0095B43C875CC40262D707A05BFBAFABCBAB5071834CAA3678C5FF44BD45 6E11A024FA94D01981BE7AA5FB84450F7052E60006BA5CBCF8E11D7C859B464B 98FF90852E1B3AA5BE061C3A827B015EF5C7289C4D0D291B5BCA7E532F57ED10 48075D98290BAC772D84B07B1F7502B4DB59BF49EEE890EE61DDA21CFFDE7220 AEADC068CD3936952CC4735D59EE4747DB9E4DC5AED7F8B096B96D94FF5504B7 503CC1545182BDFF265410169208710DB4B7AAC094271076F36B90BB64202084 603747B336927227B88B4E036C6E359FD01838625A62F8D790C782A738D11AC9 624F0D4E1C3958B7FB28833B83CC9F54FF98EFC2D10674171B50335BFEFDB342 AD1344F973335E8F8AB6D483A8C75BC8B33DB9C49506DA009813979E6C9F5BF0 1885290C2B7F622EAD2B998CCCA6FD5818B6F9596A8087C73D95DBB1ECC3F414 8B2807A89C2734B2740E518A59ADC20ECCF98CE1C9803855A750C180B6E2B354 80D8ACD8F95FE36C1218E851258DDA90704E43F4366EC0D1A519A8685078CD28 B258F3DD351EA10519F0383F0A 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark {restore}if %%EndFont %%BeginFont: CMSL10 %!PS-AdobeFont-1.0: CMSL10 003.002 %%Title: CMSL10 %Version: 003.002 %%CreationDate: Mon Jul 13 16:17:00 2009 %%Creator: David M. Jones %Copyright: Copyright (c) 1997, 2009 American Mathematical Society %Copyright: (), with Reserved Font Name CMSL10. % This Font Software is licensed under the SIL Open Font License, Version 1.1. % This license is in the accompanying file OFL.txt, and is also % available with a FAQ at: http://scripts.sil.org/OFL. %%EndComments FontDirectory/CMSL10 known{/CMSL10 findfont dup/UniqueID known{dup /UniqueID get 5000798 eq exch/FontType get 1 eq and}{pop false}ifelse {save true}{false}ifelse}{false}ifelse 11 dict begin /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0 ]readonly def /FontName /CMSL10 def /FontBBox {-62 -250 1123 750 }readonly def /UniqueID 5000798 def /PaintType 0 def /FontInfo 9 dict dup begin /version (003.002) readonly def /Notice (Copyright \050c\051 1997, 2009 American Mathematical Society \050\051, with Reserved Font Name CMSL10.) readonly def /FullName (CMSL10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle -9.46 def /isFixedPitch false def /UnderlinePosition -100 def /UnderlineThickness 50 def end readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 45 /hyphen put dup 46 /period put dup 47 /slash put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 56 /eight put dup 57 /nine put dup 65 /A put dup 66 /B put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 71 /G put dup 72 /H put dup 73 /I put dup 75 /K put dup 76 /L put dup 77 /M put dup 78 /N put dup 79 /O put dup 80 /P put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 86 /V put dup 87 /W put dup 88 /X put dup 89 /Y put dup 90 /Z put readonly def currentdict end currentfile eexec D9D66F633B846AB284BCF8B0411B772DE5CE32340DC6F28AF40857E4451976E7 5182433CF9F333A38BD841C0D4E68BF9E012EB32A8FFB76B5816306B5EDF7C99 8B3A16D9B4BC056662E32C7CD0123DFAEB734C7532E64BBFBF5A60336E646716 EFB852C877F440D329172C71F1E5D59CE9473C26B8AEF7AD68EF0727B6EC2E0C 02CE8D8B07183838330C0284BD419CBDAE42B141D3D4BE492473F240CEED931D 46E9F999C5CB3235E2C6DAAA2C0169E1991BEAEA0D704BF49CEA3E98E8C2361A 4B60D020D325E4C2450F3BCF59223103D20DB6943DE1BA6FC8D4362C3CE32E0D DCE118A7394CB72B56624142B74A3863C1D054C7CB14F89CBAFF08A4162FC384 7FEDA760DD8E09028C461D7C8C765390E13667DD233EA2E20063634941F668C0 C14657504A30C0C298F341B0EC9D1247E084CC760B7D4F27874744CDC5D76814 25E2367955EA15B0B5CD2C4A0B21F3653FCC70D32D6AC6E28FB470EB246D6ED5 7872201EF784EE43930DC4801FC99043C93D789F5ED9A09946EC104C430B5581 299CB76590919D5538B16837F966CF6B213D6E40238F55B4E0F715DBD2A8B8B8 80A4B633D128EB01BB783569E827F83AF61665C0510C7EA8E6FC89A30B0BC0EB 5A53E5E67EF62D8855F6606E421BD351916549C569C7368AAFB714E22A023584 8B1D6B52FC6F635E44058690002C6BA02CEC21C54CC8875B408A8BB84F445894 5D6B3E4841CA20AF852A660FE9C832F773691DC6F7197FF3DEAEE97418A5ED2F F2AE65300416227CD3BB03C29003C770CD7D2A7A2E4C1DCA193651C2CDDBF93B 966938788694BFB562AB0010268955FC3555E5984CCAB0A9B7590C77C9BC713E A29E5BD7193A4E971D1752DDD0F0AA4648E7E87BBCE66A1E836C715C408B07A5 9EB56BEFD4596706CF839BA4CFA90CAD4038C1E006B51913279A2C31FBEE5BD4 A7D74F9103CE6124F5B439CB860987DF44FE17EF88EF1BF62C67060D25696BCD 94ADF08F04E349CEBDF9D3389D870D94CC05E393B3F4362A13A6A672EE5E8F5A DFE7046AFE3EBAEA58FFEBA4A47BF61F92E2003756DA643CCF2C9DFCCAB62669 E3C2A18D690B64D907F50BCA155A85E47C3A6954C6FF7ACA36D8DFCE777B7929 5F5D5F787B9C247ABF13D6D7B4A8F06BA25CCB342F8A5071325CDA86AD71BA23 8A9695C7D1D50D0AAC267AB7CDBA7AAF46A264B7B081B7E79AD937FEE4969FD5 155A99E652461EFFB4BD010E5885631E2B2497D6B8C43CE77D7D47FE201DD46E 4482FFDCE150A1183C22C004A0AF0E1F42AA6804E038E1DFC8B0A3CE26B52038 44D2E7F759DA5C252489E5525963D68BC27C82247BEB18818C7D4CF0BC5CC97D 8C701034B8DF798DD4CE36C3F8B1FD40B2DA14EA75583852875031AF8C909EE0 04495FDCD04B05A5EFEBA56A8CAC1F57F1B8AB91FB25C81CD51EE69D6E0F52CC A0E12CF7E3187D67DF71A599FFD895FAA7BF80E2E6B96592BE77AE96905BAF0F F547355A36C443797DDA7C414AA606CF9153E03450B77D1BA4088D739DF55F07 111B9E11AF37F45B6EDE6D7AC126E05886A57C83886DA87761BE600DEECD1344 8A82BD652BE7ABFE6A0F50ED7C6F4EE12CDFD80CA7A5518692F267C51C3FE76C 567BB8DDBE09A2AF901F79AD02B435287CB8057B3D5EE6655071F67B00438728 C4C3EBD648BAF650993AFE5E2B29074A99ED0FB725D9B8CE8B0292B08A280214 C3AF252BEEAD30C88F72E322FAC3E9D78A1038F5DFC41F7BF1AE3744A0677094 51B77C2D630B67853FE5E975A395C06A4D4DA744040B272C2B88D8B7ED3A2C01 66F503C9DFD3C7DDAC865900D2A4F2CDF517F449851DB1963468D0266D7A3E58 9F6B2A1843E6444274F16A9930302DACD8D2BC4588765099A86BCCD8A31DF0E6 2853114DFF2D19F812F19AE6C2E419D7AC1BC024D1195074FD0C6717BFB389A4 4D5428E7BB2E4F9E9FDEDED7BDCBDD3460805AEA0B5F6460C2FDF19273CE5BA7 5D3AAE0DB94C6AFA8339646191C23B0149E7CBF136FC4C844E025A38935DF256 0A0A6466A45EE8B9B23B6A055856FB084F87C73BA28F1883E3B184CD813C72F9 233B78CA4E125ABD26F29B92CD9DF39D6FDC2A217E2B6B45D9B0A4D536790A5D BC0903069565A442FA7466414D948AC432C6B75D8D0E1DBB217CA3DC38A52DEF 62E9D5AE9E753956C13819D93148C7683BE4F71B80BC066D8C19FC807FB1C086 B49215DCF56A91A42089F0D063B9981925691F7DDE3237403AC714F5CC3ACA88 DB2F1DD205578C00472FD70C8BA4F752E3923ACF3164D442A6B639902ED060D0 C5777BC20F9A3BDA60FA3BC986C38136FBD2E8F910E32EF36377C9CC187F4AFA CCEC423DB925B378522B748BDF12D523804CABA83CB5A7ED69FAB9AAB75EE8FC 38D9866E3754C4E2F2B9AEFA804044D878DED0E114EA0E9682FCF38F6628E63D FE1C1B5615E54FAE8684566EDC4B616F76EEFD6207E0386F06D3BFFA26425F24 303CC7C8A8D7021E7D09B202616988287838C3DBCE3179B4FB5C726E603A47F2 8248CB508F327D1291CF3F08F7C88298DC2D0F778D24304EFCF6E074182BF5B1 8E6551811FD6991971692108E289B61053D6DCBA2925B3903E8916EBD09D97A2 C6D08E89DE4C0CDF7185E1E00DF456B249F0BFC686E04FDAAD2772DC2C39DD53 9C23A41471267F53A87E5C2B8CBCDB66CE0B9844BC506428E6150B48D2FA6363 4FDB2CEDFBAE0B7DBCE4D83E29B2955F8966272CB865EDB360C8A8C19EC62A29 03066483E4083524A1E8D80FE3867BC1AA91753C26ACBE8489AB0E3330206212 93E07ED473DBF457EB8489E66FB4B8ED8A9EA8911CF9308CFE3E6D6F36810EE8 91CCB11BD548617B2C683C354452B9229E7C9E68828BBEC324420DF7C188CCE0 FBB514547553A7E9B38AC265783891F42DA472388569C8E7594F7E8810895A27 06E456902A8D9F65CA808F1FD475D011C4572F8A654BA01D67942226A663D179 95149FFF41A9F55AE84EEB9A6A39C017D7E4FD6EFEEE7FF3CE847CDB064A4954 9DCD273B810E0F259501BA4003A3EC1ABA6E13D24C0B57FF82D6DF077833B6A2 7EA54801BA81DB961C261689C0887FAD83771E55D3D137AFBB21779397E11972 6C6CA922F45AFA5C0526863A5AD8B9C0775CCBA17FFD37A44CED4710884DBC31 5C9D3F5441595B86CF7CA2EEE42AE87896E9E60EBF5F35C2B7FDBF9A9CDAE262 3F48396F0F741E9DDF1D4FEF75E68AFB020D06CC29B3A7B2ED819D1AABC12B91 CA2A65F1AFDDA2F3FB322E0268DBBA024663E49EFF076455338FE31A16B04EC1 797EAB0B49AFFB906A0690A1E8E2F5314773E1CCFFF43E6FB3875AC907F0C5D0 DCB9BCC127014D472463560CA0CB1C2CE614D94177C7A52A5B089316689C8112 CA57E35D716D956DBF9013B1E5B9626456B1433C8C15FA906458F957133B9E19 8D46DC3AC015F7602538C2AE3927C6DDBACF38E59220C2F5AF36B68DE9117C51 04CF7DF32B1AF55B87D1D8A5F4BCFEC66F63B32B6548DEDA3AAB06C5310E4757 78AFF947DA22809B360FE535506A554DDDE5A6F2411246653710ECE5CD3185BE 730520A766C47E1ED01890059882BE1432586864E1A86A7F586438C8DD35C00F 021A741ED47E0F16DB6070ED0C50038632CA4AC2975578A8372A080CC0447C79 CEABDF2BCD5E78564247B0F0025F556DA8FB62125227849EACFB724A4AE3EF57 90C07A5B27D2E59425F56BF8AD84C5F5310FEB1BC73D536339FC2E6A5BE2DAFD 97FC835E0D52F680F80ACA37DB498AACF152B9B44626CD89E3302C3EE1623EE0 F998FA78305960AAB9F483F731F5F67A8C963C23DB8E48FB804EF8B86FAFE7F9 4C09641915FA7E3930AC922682313408BC1607C76751CEEAFD660206A39CF394 40ABE2A313AB7D5FD6444E219DC5C26734D322BA268D330AC17959A390D6C8E7 3A155095BDD66516DAD5D65519A7FB871ECDA77061EFB21F359158B4470EF79B 362C35C06B85C9A9505C8361939C6AC013F2CFE8EEF46FD8CB4452AAB3EF1FA7 DC066557BADC2ADDDF7DDC2A0E1DD4A357E27A2073427EACF9B9035DA5272136 7DF37E26D96ED4B2ACD60596E039BCB15E259C72FEB3344E3EEE3D4F17DF4233 04C1416BCADE80BD483DD8C9AF979E1C7D50C4CF015870703F88B92C4FE46AB8 DE6717B55C460C805B391B84333097E116F4A51F631FAFAB34CFC925BEE8B72B C9FD5F5A79D8F2295FBFAE649DC6AB47794AC7D73431FFE5BE992F2B5AC67049 B5208251C0E442385A9FACF25E3A98D7F5D4C2A1ABDC600AABE84769CA83350F 9B87F71CEAD3600E02FF9AC03C1B5C21C84F911511A0CF0111BAC7605EE31229 3C526A79D943D92E1CC3C38ABE82D560CFD4172F318030852A5FCC0534B8B3FE D7365987C8B48A072907B26CDC2108130A33233E8E0BB5FDF14FB55098A10EA2 B51AD9EFB119F82B08D256D396D3263FBD9DBF172D43A90ACD1A31F3E89E8571 74BE98B9560E2CD661A2F93C69FEA3FF26B00772AE2C2C24B98D3D122EA2AA8A 44652CCDF4EF4F01CA7D62A976E23E8A86291F43BFAF38FD9C325E70F9C36CB5 A181DAD30156E98339E6A0498D3420B7BB3B4E651A9090D4A17604AE386273A8 3D4AE8CC18345E6E19DF06BA848F203F74B161D6A8882991CBA7385F308696A1 BEEB0130D938A764B98A2001A38489B1334025EA848CA44A116D64926D460D64 01159E77EA7ED9ECE7BA77635BE564A4ED89315BDFF54ACE6AA1A26591D13CD4 6D6425CA7933769B842192858D10998509396829263290A3A7CFEBBDA3EE6CDD DF1E492AECDFF7941B53573F01F623CA0A5ECC9D05A3D0954F7AE8CE94AC3B2A CD4E27519B2E16F033EB732AA024BBAF74626DB55DC74B1FDDB07FAE98B4AC5C 683CFD8744F361838D343B657EBF52DEEE7AEA7565C5BEEFE455DDDBC4DCCA7D 87D6D769C5ECCF14118A14A85A86865777C8E28F953160D5E82844AE54D541DF 550D5F1519E183E0C42BE88F0458CE8087F2CD4B1B49A8E9E3D127C4A4CB74A6 2E73BF4CC317781D03FF04BC36AC0E4AF99E2ACAD20F6F8029DE8A035DAB40DB 17D237850BCDD05931FF4B0FE2D0B79EC5A88FE0236271CCB075BD194AA25AFB 3FB93A5206F61A14602E4EB6F1C31C654527CE0C02D04314DF9AFD710D0EBB9E F8721B97F5FB18E27507E1F800B5509A58A1A8296C72B7B73F99B6CFE42E9C2F B63B3555475E562672645CD374BCDE937A9B05A157FB3E74C8297507253E957B 1A9DC421946734CEFA3D5EE357DAC7E9DE17A5BDDEF6B2D2A740BC58128FC514 61154664412BA1C05209EC992A77B7CA45AB7C0EEBF590A5B5652866008CDEF7 124A3003AE6A7CF9DF3C72750CBD281358CD2FF25B162B78CBB971DB3477F8D2 ECA3EE9CBC90323B2C236E375337EA0848CD7CB5781A2B0A42DE7E4D99DB2746 0B26796CEE129D23C76794B7CE21C13C7D4A998B752C8CF43A4821B736EBE246 D2A2BD7BA3351FBCD1B0A501EC1EAABE60D06DA2FE39BE1F0AD629769FDDC933 F9D02F9686EC8C2D7455C26AF4DD3F6860B2289E3A30E1C254AD17D731CB73B2 BF4DFE90CAEECE3ED0CD3FB4C8F4C7BE1C056AB4E9B95781A8968E3CC1010003 75DFBC4AB9F6B27C5A9AD88D94441A8ADF09EB275E5F0E5E6F3BFEA0FA8C308A 8593ABA0645ECA8FDC3F0E264B35D4B0DDB86B93CD8A047FC409E18196B501C3 B003622999C47BAC04FD1ABD8AD359C977766E9643EF3BD6385306B08EE3E13E 7DA5A06AE33D17A3D574C6390DB6E9429754B210F0C349C359559C7EAA2350BD F61D4D8A92B1AF697BC620FA0351E67E0D9F41A95A47EE0BF210C2C48691901F F905F65693DCB85BE412F097480F6A7266AE0A928729DA0F691CBFFF3B276EA7 322BCD2206D96E3DAFDFB992CA8F2955F0E8B882729DFF840569D12E4DA1775E 523AA734552AAB6F2F16B89B39F1A3FF0E07EA08D13E612F201716C67F327017 6C041760DA30374434808273062C1FFA2C47B3FB578807BC26537F542040FF77 66C995EF3E8B08B09FCD3EE89C30F157158A739606D2CEAA26694A4F1CEA6633 B54933141CB85C60AB262E2D4E824A3B85C2BEF810DD774F296AB37D0BAE7182 5648CD18556ACB124246A75474B232D712C2358908B5D9A76F82C626BFDE01A1 093B8FA6AA0B32F2CDEF737B28BC0448FF816DDB5812131DA0DD5979D77C3838 B978CC3F6778A4BFCE9A7087EFB19749285AE4C92B99A6649DA349A2E0889D72 6D4FC664522F06C8C4D86D30BA43ED4E42211217D01636A4E17E2A132D26F394 EC34EA12D84594AED9C6CDBBC0908860F39B240FA7D7B3003DB10322498691CF A294C0FC7ACC0BAD1EED3E9D60AAE3F7429695892D1A21CEBF062C6129B33966 8B2EF6E932F9891DE6028B81C5E9B23278D35B7F0D83989BCBA25E20E9D503DE 144DC485F09A4EFA1268AC5E4B551C5B2F1D51E9B9B9C0FEE585204F869D0BE0 7287D7570A12940A47C1F51AC6134F03B415C30E147C49F89228855D093EE55F 172711F37776E97A99CC4B36E2F10713E36FB279FD3FA5A0EB9F3938F42E2BB9 254EB8F0C0F30391735019E02BFDA21D9813C6A22279B898EAF01AA892B14DC6 5912B9275167AB46EBC420836CC1A5F38A4EB47C039A7BCA62BC3FCE4199FC71 011DD6E5FFA0F3D7F04AC02AF91B9249B9F993AE346572329DA852115BEF8460 B94690E790003586F473F37EAB5AC2922F5F663EE2C3C0C336A8DB71650631AC 0A923A389AC911CB215EC2EC7D50CF8AEFD59EBFFA53A9F1FFB7E6215F17093E 3975F186FE23BB5FA5474C11408FABD223E1E6F62035B5A5C1AEFD8899F00FFB E729C2D5FD551E80716CEA4E8281660286A802AAE8D5834F37F2EAC46297E57E 993B09251DD7789D3467417E393B7DEABD06676B96241B0E43ED1A1A9FC3B12E 0D34B2B0792B79AA648FE9450C3B209FB6D7D91F50C52A5DAB0BC81A8B698BD9 18946EFF691912D7348D48FE68CD876FC6F71F81165D0C3272DA1A992308D9E0 ED6D0A4DAD679AF495F62B78D462B463BD4A40931172290C615B3B3B6B47E45F CEBB85E0A6AB6832067CA6D403C239530D07F199788AA4DD52553836851C5228 1072406F6D7323A334E7A7FCA588897C4FBA6D4F7DEB65525EFB74E539C988C3 A685A98752F7198E77E456A545F0D23A1BEF81EF58B02D289CF980A3F17BEC8A 6F83DD90C4A917EB0E5E2B444A608E2E9D2FF80620E16AC1D7775C0A10C1299B BEE0E1AB24C50647E5CA1DA65CFF3B2C295F0644CA7826E1DC6FADEA93D66A20 DE852F20AD224D28DB900519EB1569837139C833F24B799F7EBE3FDC14235323 1D0BCD4991C861F38DF413A5A5588B73AEC3BBFDB885CE17BB3E97B4E6A79761 93EC8418C2BC4725CD61B5E30C07352F647C3FD50083878C13CFAC241DDCB082 E53703D182068727F9EB6FACEC25F6D901D7309ED7370867E34E267519E22D62 4FC7093448BD0D6B1C43D318A3E14C92032325C132AE0FF7ED707E1FA4A955FB F5224BE0045CB14ECC321D0F333FE24EEFCC504F7C756451D7693C3E6CA87526 4912E1B6DB935BDE76FBFAFCA4ED473F1D2618812CFF25A6859C626A216603C1 361BE3E071FCFEC2D4BF2FEBDE07DBD56A1BFF8303901168FA06488BA6B76F36 95B0A90D7724E9ADB567C2ADC65CF3482CF47FD1D16F70AA19A97D0F9EFC611C AEA5E1ACCDA7FB2DF05E9480936281484BC329F0B771775E73F7FD72FE3F45F0 50ADBD03932B38F37A8F0A66B2F739EA3AC8811C8F514E68C5643E4AFF485C81 88475A523D7FCCA5C8809BD49846C77795A38DC6406082000236A4D2628B5932 AB7916D44EC2210CB941B1422DEB13896DD78CB7B7F400EA5A6CD639D9CC828F 52311A11F2A84E566DE98826F1E28D55FB08ED70950205DE52C207CF14238446 084FB4DCE04C781858BB4E0744C023EB0B563769751AF1D807EED20E4AFFDC46 3C1510C782FD92902761F7557FEF701AA67B20A9B019C760B2BBA8A048BA3681 35DB440925CABA05B8A13B2D30D14FA875D3E200A018C78BE2E930457BC33AD2 FE3610314A268E9A30EB41F7C771758410E7D1179567B22CFEB5163F7CADBC40 4D40860E83BD5DF2BAB4822B55B863D0793D3B60F0DDDB6DB993711C4C7C2F39 31D02C7D8EE36FFF8FF2179534EE4F2DF388C8AF7468EB28FD5E0CBDF9E23D1F F320EBF19352E03458A43BD42366D549EEE1256555177E3D6A0932C6028CA6D1 1849D17B5DA8ED647B79AB412E0D5BB39A58964B4CA44CAF45F63AF49B330AB3 DD863F5EA66EF0C6D7FB2EAF256CEA1CF067D32DDB9E44EF1E351BDB292EADD0 55C9796128CD979A5F012FA15EB06B0C15120E70E0FDC963BD83BC0E73C5DB4E 29A03DF4D2722616B45D8664ED5EA0F0587DFFD8DF4D75E2B6686336B4E51EEA EF477B86955E866E664E85AAA08E752F656BBF1A42399248C71DE0EF51ED7E50 34670F9B409A6C12A58D7479885795F31D3E6F90BADA0DCD650B5F64E2C61EBD FDDE74B2227D7C20D4F215E4514575253EE48341D472C2E89C2F3CD725C0D0F9 1B86D25D0B9C6EF72F6C4B911EF5040FD741AF3D54CDC8AD000EB830D2362FE5 0A5599553294736404CB5CD95D394627261605BF602F58D07091A4B329165CF0 0B1445F264F4884B5123963AC4219453664B075586E92448D9BE5460FB17E4BD FF59A4F1EC1E48F6271FF3E70DABFFA6ADAE1CC466593A63ECD1CB507C62002E A3132EB846195515B7FD321D332F0EF8608059CF34B1CA05024FEDA516423515 60CC65296D5DC3A82E43ADD814E0005B77C103B1EFDF07470B09FEB4443D8C5D 5182515A2FB5C5C6D38208322ED125E46249AB7A07AF98E4720F2F64E0BDD651 539168A6E5213ECA91E32702FBFA0385A91B743F5BC41378678EFEAC4A5B3CB4 BE3DC301AD0FA9E8E19DF5B13B03CBA0C37EC2515C2C9B665639255258219E69 092D1CE04E60C6858B1C24A83D683B1E9CA233DAD4836405A235A53C272F5695 1CD28C5AF4C609534E9DAD5723802FDEF1C516301D178C95CB729992924706EB 817491F033A6A5BB90D906064CE2EC3AEB2A7738F1FF86D8DAD4D3C71F265830 FDE5D597B168BA9FB84A4A928C4C7A8BF6C69E726C85B1CB4552E1714272B73B 8F872241429D74C4CA644611824E973A275571270AD7846A7E538A717303390D 2E597C60C14A09957274FB230E013648920756107BEAE66FB53CC8678CF45516 C4F16B0D8C3F315B8A167A9F28B681DC63456209A6AD3BBECD800F265CE1379B 74199AB1584FF9E8AD4A2E0EDFE146FB6F29FBB56E43F78695976ACCCD3C0C59 D727E7BC6CF570379A0FDA9B6969BAA5F50B409833EE64AFF6F07CD0DEE85522 01C04C5A392EB0912282146F575AE2FCF68802EDFFAEA1B27EEA2228AACD2653 E6070915AE82A8EE1132D1AEF54D714A11B8E5D7EEE908E656917B50D0503353 55AECED82FB999685D2299347040EEFDBDA0CEFB1957B6558E365E4A76B4C247 E455328E8D5472DF8AFA4B4EF21CD636D5E49F164DEBF1B76175E2A2CFE07C06 C89220C9676A83B24ADCCC2CA075320525849F3D27B2280B6CF29389BCCA214A C0F773C28D7261F17D42A06E3BC2B98D51F3554D6BDB9B705F27DB5360A803C1 6C8D69B3698642B4E38C5CD7F621E8C8AE9D40CAB4195E7C8955B0301FFC4616 0167E3FD40D062D0A82E70FA8B3B2C50B3A821E14109D3E909858B4B3625F0B1 B16022DBED75024D8609F1422D86620EFBF595D98CEE842B03B676BECDCEEB99 2A41C5D757BD071310757D9BE394E780195D255A309849348ED60ACB7A1FE0BC 707679240C61034675C4C1EE2C7EAD9441ACF23919646B9BC479BE540D60DFC3 2D90CD431C01BA26E64590B726376199A2C2106418ADA1D457691440F9CAF07B 3BF47809AF74CE3F7B17AAAE158A26968EE325619EAB134071968AE31CC6621A 4DEEAC286F6FA27792486E739E66449A3EABE222473285CBCE80951ABA1E8233 B3976218956FA4CE1735BFED7D90DF345C4EDA1E4BEDC378281FF4A6D25FD649 7D36A7543938A8BEE7E5D5C1B990F601AE018D72700D02492A4D15DD45EEEAFD 43F43B7577AACFE90ABA0D2362D6C372DB917121BC02CB67B0FBBF4E9EEE02F0 6B95424DE2303553331B76AEC459B4A98D406BACD9898DEC8DE2F24883EA3D66 FE753C15BD40E2E93EFF44A70AD9AA0356C3AB43C5F7F5AF4CE66131887D6D06 E6B7AE106D08B79CD8C9DE88F4B9C6243AAF7A54BF7880B6140580FA2ED3807B 275F68271018A364142F96BF11073FFAA7A6E19F8F6B6B3E8D3A387EE880DCA8 88E86CDAC6F4633B00FB3E79FA083FCF8977021F0CA2351E7DCAEB4BDC1AB94A BC0D536D6F0E9AE5BD44F9B177DDF0C76675700B34473F2F0E30F440EF59724A D661F9337032F6193224A926A3F8566832E64D38D40A350282E284DBD864D4EA AA04EE8B01CC7273D4A49B76D2F3B0C454A73063D94389721B80C6C65B16BA88 28B26ED7F00A92948EEF95C118FA36B99B61DCB8B332BA2D07D3EC989540C24E 3AB425CB74576E6179116FAC82D89247963153508262B922972006801C021944 31E3BBCC16FD5FB34D8C9FEFEE2B2C057FA129F23F6654680EEADA6C6F914C08 A3691318152B9E099B23B997ABABCB87475D261F3827F94C22CF179D6C0D4317 D30C8A03A1B98F367FC48AFE50BB6138C77E2363EB575628CEAC975C32D8810A 953EE00088A0746F4B8938AA636FA5C91A019300C64E792AD0272EEF3340DA31 A41FA95F1B374A14A57DF70BBB554124C2C4A787B9D87DD9EC857C61D5E2629B 17D6ADB9892DD973550E2C938BB3D4C8B16138700B3B8647E7E69B38FBC61B53 87663A0253513077C51585D467FFF3C7818875E709C582FCE5F804B2AD18BAD1 7932EC43E9412AF53F38F1AFCC13090559F113FEA5194C8860DD18EEBD72E969 04AF05584D26E25EB05EF7A5BA9D43FA767823072BCB67DE420D49C675E4E6C0 BEE3D0E9C5BF2F79D1C57F4E4D3A9C27A83704BA227F81EC74C51877085960E9 D137B676AF998C4B9CBE8C047DD31DDEE8E6B6341669E9948EC9C6E492D4F937 87664AACE9DEDA855AD5E865C94902B139DF132AE654F064BD36F87693E99F63 CD672DC99A9733E8430697E9D89C370AA3B9FB286F42AB7FEDD91FF355119A5F FBC2E62FCA5A7366491583E6414981985A919864F5210408AAF9CAA479302B8B 2326424B3502A9E74D9853F1CF8E351CB663F6ACCDB3FC823BF867227900A91C BA9B1341791046F11D046B3A36749E3CA8D5169718D67D452F003AE7513D56B8 E41BAAA7B37F73F57262E954A847F4D52176C81F2A394EEBC3770F1ADA9214B1 21E95925DF98313DA9F93A270722BD1CE2FDA5853837EF5B43468FF634C19FAD 840C47C8863B04D8D005C1952F9696A65549517F64475890362A61BF74A4277A 608F6D0B8FB9C1D87EADD818BEA6A70F1C4261B6A8DCAEE6E957E7247E02B5A7 2CA635A0843BA74FBAF90467D765E5B57D59CDC1E91F8A23F3561A1EFAEE1F46 6611E2D8C6B90532448CAC999DCA3A3C683120C19A72CE20B3252DB7A7FCA96A 46CFB0290F1B4BDE03287B2DF36EC3CC08C54FFEC21496EDBF417BD00EBA4008 D676A09A1F6921140AED1B590D6D6E24831E66777533C4205471FFCF3DF8321F 99C6D15D43EA0A7A7BFC03EDF36D946D77C5FDAAA61545EB6C97D55323E9321E 3717C38EE10FA8DB8186F815748A01CC17BFD5A1D7FF2EA5D14F54C7E4B21D90 FC7A33C7628A8D277BFB3DFFB0509B67B4564285C39A5BBCFE6E0A22C940A098 321FE35A05FFB0065FA6C200834C9BB826B82E96C2662F837B3EFCC82366F19A 3B3D0F7DEF1738F9F205BA39DD740BA6859D434B879F94DC12BD1FB1B8DBF950 82A1DBF778DE6AF2FB54E66C1C87517718D85BA286F21CBB11730549FDBF76E8 444B8D569BCF2603AC7DF008D148596C9864F7765147B70036FD5DB148A27DBB D7782C44FBAE1D6AB2F2D0BAA51050013FABECD93F99BB8F46DA83DFBA67E59F B79ABCFA4EBF1E0D9C3F445A18ADEA7FC8C21F44CF9C98FC30D8C8984F78DBEB 9E0891A62B5B79FA8AB9B42C2D525CA8421C1A349F53698AF2D2CC38BC270A81 3348D274D2E1E3295F2951E0AA6E286B0D6223572EBFC554BDD5D4E011E82219 CDB158B90EE9B98557C52D65CB7C979B5FEDD91DB787659283937822A9390413 98B5A93CECB4F49926C0C55BE6CD4DFD33B33B53D6E509CEBCEE00BDC29E3AB1 9F8E54F4596E4BD576EF9F016ABDA8B04AE78C5A8CF0DEB9E2A5424D243AA8BC 7E20BAE5F24568AA76E9ADC471F88FF601B76900DF822DC302D21F60448ADCDC BCE3FBAC54A5F210BBFD2B71ABD320475C006ECF08F10913D6EE3C9B27503699 F6EC63F9A3B8E8B314B156190D56CB197EC512F0B51E712A40EC0FC591CFD232 313EE57DBF5C4D6FD184089AB27AF4577383B51691B01DA4179E0B2B931C4C76 127C91FF9377F9547F766196F0D717C7499808F8F6D3F659B81D4ADE29D9E81F 052699E68E0011EC15CD5B0A897DCB84F36DE8F89E9E4534B6E5A04E8FEAD402 D86C375CDDCA25FA61C28DF40DC77BC9997E6176FD29602D9FECC4D7127A58D8 D5D6673C64690BB5D845C77EFC52CF7939020AE46031D059F4B99C10FC59095E 64A7C2A3738C1D4B6BA29397A2A455B704EFC6EE695B91E28EBA61E30E4E3851 A2A841BEF92FA4DAD9129FEB1E6A45E023081C753CAB7E2F136AEA23FF48B724 6FC0D3AA9DB64A68353CF97AF0B67C6CC85DAD6241D9A2291F6E99C8550AE9AF D9A539FF822B85261A655F3F69B3F445978013EF842F91667F65F4834958E6CD 01B59C73A1B1E62AA5C0343338C04ED034362D1422D5E8A2889E4F44E744014C 037DEB2EF4AF5ACFDD23B48110A1D476B8D67C24D2EF5A29E5132225F362774D 70EFA69543E32AA9654D2B41FACBCC541C7CC632972B22482120793C4A857173 BB6DB8F3EC0BBF7A12206A2E343D586D2F9CFFF0B661727E747BDFF93E0A3717 8F8A19B5E320DCA5079647FD5A73EEC44828D731C5D7EA65B32468D254DD1C98 38D3D1D01E30FB8A34063C54776A89DDF3D94209356BA1888DCA4C203DBDCB20 EEAB3E550E578865C13D2259AF1C76C57D3F5A738CE86BE565477019B456BB65 F17FF4847CB1F4CD45B53ACA2FFFD618958FBD3DBDFA099CB118B88D3F22ACD1 57335768B12D4DEA18A4F46C2AC08D584C32766FAF22F2DE7EB7F1C06FE11DBF 1876C71D82624FFBC92EBAC9293FB8E58BAF58CFBF51659B63A3BBF4B5BAC52E 2DCB647973BDB96BFA3AA31E29740A777526AC010C792F660807DCBDCA738D51 AC5DE05E3C1E9B76515D440AE83592F4F5FF55D4FE7EF28C2C0E83AB0D4B9B12 E927200ED40E5558B5755E47A3E71A078829EB3DAFCAC8AB7AFB80D5C2A97649 52AE504D8C2AAD5BBA40772EF01F6CAB10F21B2857A1447ED5D77BFC61D7430E D9F12FAD70E7D4D3A44EF35D0AC7D965A02B9E772398ECFA6B5344BAEC3B2221 BE6D46645AB0C562FE71370B788FBB19C3F9E98E546E09CB94B745214D71C5A5 B4598B17655BEC54BA1174749AB5A0AE842CA1A468035256CCA9036390B684C9 67DF1C4005ECF5995D1C2BD6A0EB3AE72AE64D736C37F5E41FEB9FFCDD6592F8 6E4F511EE57436F082E33D326F5DD84A8BEBA270E9DC3945F8A1F7697A696EC0 CB117E7503B6B666A6A70AAC4B496A5D10011592765DB0E4F1E93A821ADB5F19 819D2EC560175E5776D5D2458D08184A92657F631D60A03BBC1B7A779B1B36D1 64B505036ADA9B264400B636B4C469C07E09CA7DE9B06E334A3F005D30EB1DC3 5F6C6B73D3CE68D3DD6C938693DF7876ADB39004425595356AD59C27DFEBB662 8C66BDB4939C6A4E092F8AB4054CEB2115C130F2135DD7CD2412C561663916F5 CBF55EC58935978F692C0C83A1EC7AA8BC8F74C2243FC12F5C1FDD3D4FEDC7FB 79A26A22EA5CE7340AC9487D50B7828A7FDCB4108936D3332E35F9724620757F EE3455ACEEE1CFCB8EE28EEBA6459691BA50FB364749011843A99580B108E035 95D2835839B484B710CD51C4B7DEBED63259ACE5C9E40E802482CCEC74A49726 F1734047A753B55504440363320663B28DD410A94868D76AC7BB386225ACC7A0 4BC94AF022D89F2C352BB952F4651137BF8447C3DF53D142DA67CBA5E65C3245 DEA6A306A17D0227EA4C57243272117FF27707FEB256443287AC9E31832946A3 4751432C58927C1886BB357FB7FFDDBCD7C6E6E7488742D51D4C83C094135FAF 0AED43363615ED8CB1D47EA4BD8859A9BEA65C00C3D70968CC33DF7640029208 C5E30EC517567ED45A5808257BA19FB5DD8DC7DAA27C6AB2D96CF4761C95E4FC 6E07308B1DF6A68A8A95DCF793B5B3594C244D787F33E1B0D9F52595426AA71E D8C1C7C82FA8E7505CD05DE7762A73BE71C2D0A7E85416248F0CE3D77AEF3338 1561F588063226FDCB2DD4C0BDEE89724B0124B75A4BC9544DE91BCEC26E0D50 AC028AEE9C18F152DF02C17986A189CF49971B2B9DF33F539632F1E02E50E40F 0BE617596F41AA53E2976D9573DB7CBB1BB434DAA9410933C123CF71D281DB0B EA20D1BC62CF47BE606B04497949C2D5BDE8B461D5EDD69FAF2976062027D461 6C66FA277FB7B382E2F528BA4FD764C8F0E81F96F18D80D42415FBEC9FCBD938 6B46FF86443D3D689570B6F5C16A4AC5B19ACA3B4824AD0838A2D3BDE2B40E2A C61F9C560C3B67BF6F721774869074F9AB101BBFB71CCBCC09C8358E97CC89AE 3CEC64CA66F26EC18E485D96042BE5944A6F6C4DAD2E6FD143905E20B5FEC320 3D27760E01B624EAF921DBBEDF043F350A6D8EC98462365E646BC16B8F862B44 4B1E75B3EEF455D51AC56B97FE0237F60A5FCD4198B1CCA4A1FD8CC3886CF5A5 B7C9463C4E30655E6D8A89FD20308719DD762F7B55505E15A68C168439394AFA B1F35363D1F9316C380BFDBA6C5580F9FCFA9616A3507D218DBE8F728F625192 1394721322428091DB6C0BB488FAE9EC71812E3D4C83B1F049FEA0767F7CE1F6 7BD6E7712C3D021636533D4D7213C2779E24AE89A93C3B4C8B976E6AE682B54F 61006AF20B56F48F8CFF4DC312E6A4547B26A8C0D0EEB13CAF4D3B950F5DB9A3 80F9690A3E8BA70CAE056B449039DF34E307476BF981A6713DFFE2E0E522B80E F997EC420D1CF30C5FD3ABBFA7C2F7B3C89E17990D349D3FAF73C7E205F95153 858D3DB1C6AE78C54900B9C443C90B24A271C3511F056EA63ED644EDDC42F80E 35A95B96B6A35744989127115CDBCC39D2DD217DF73CCE88217A9C5D0A053C3C F1453E0F5DBBF65D0B6DC5D1124381413A8B319EAA13F5AB22006F6253B97731 8FDF0353C651003A62F4B199E863A25CC4F3609E3A7C49A8C7D9620C71061CB2 30AB742B723C4281C5832251605DAE1E22689294A91EACF5F15D93E9572C5A7B 76978C52DE63A06B1B76E2A46E9560519D95E455BBE380C6CEAA964BB772C195 F4230319EB46A8BE1893D29D84D2E4A574AD60FC53F5F8DE3424503872110B77 DF58DDC1115E7325927B5AE38B57ED44E7620C664298853990A97AF75C11B251 509F685173FC15D9B3FA013FAD670AC9902CE85F95641DF0CB406E3956248EEE D7E5166ACE9CD34EFD938F389C285625CE21B7D649C71A402D2795734855AEDA 12F8E10AE861715A09FC6539F75FD0EE5CA08B1F0A6FC42EF75369253BAC1452 A29BEC183849D659A720867F5BE079879D5E8D8478D15C0B7A5D03AADC4083D1 96A21A9E13201181F2EED3C81AFF88B28161802D60A34E386B234AE3FDFD61B1 D92CD893C3F96DA6DA13E4B028D1FF54F801D547E129169B724F47F7BA28118A 637415C3ECB345779D73D6AE24C15111AEE81501596CB6B023CC2BD13C3D0BB9 2B993961A2B053A7E24E99D78E1CBB5F4C694C0A729156244EFBE8E11DF9929C 66143227C30056B3051A51175F3369E34D364A461B4677DEDD5ACB1D3DDA2A8F 8D7D0007C12145C0C66DBBB016AC3F35D6928095D9FCF430DA49018D7242857C AD79ED461E626764D3CF0CDDB33C43480812BA66B60262D458F26CD06C676338 B8CB10C15B45EDCAD3314BDC8EB9B070333E55D8C96BCCB4ECCB5A068AF3FEA4 D25D6697979B3999F9DF2A9489A8610F50D1DF3691E4C862D11113F25C6332EC A9AB8532079A8518AF272DBD1C7A2D5D06D2F6D46163FF42C750A1B62323162A 47BFE591859E2E259AB4141E6A3700951B08BA73BB567512A7A984763206E50D 8A8601F7B25A4E52E70E7E767F22AAD74C9872ED97BBD6E7815B8ADD9339D89E 9A119790F7DEC6D5815A16DD9CBD0D688F58D377D88165FD74BD92E74C8716C3 02D4D33E5DCD707C8D7C44589E29B3458D4F5172B59D1F9327774A8137314D8A FD0F4F5516C79F0AF8EBBCD3E0BE9A13E53AF511F836037551316BAE27EAFAC2 A516296E5DFF5C47C67DBC60D0B1203A7392AF6E3C03DCF0EEA729807606B019 DC84E4D50122AE40E8627E17E4CD01EC1938611DE4E8DF60326CC886EFAC1C84 4C7F23ACD1802F1619EEEAF2F3D94A9BCEED27633205D96C42B54F6788410076 E4FC37F92155A15C996427D25A249F91A6CCB96AB906BC16B1119FD6C7354703 5466D5E113A33E61CC74AB43FE9D870F210F61BB6E60E242A765DF18B23F2E3C 88DEB0DA0E9C192A3C77957675A7253A90FF18E2CB2482CCE1D936BF3CC8F058 1FABD43B428E21E4C8B06302EA20F430A650E4B823B270DD82495CD678ACFB3F 835602997133AFB5AF02B9AD33B4EE51274B5D3731B2FBC37B74B7A6C549BAAC D29DB5E84C9CD564F7B65A338211623CB5D6A54C7BF1731B7C6FB033FA6658A4 8F8F719083ACA6B02A382834FDEA45C7DC2DA715A3B508759F342EE5527352DC 732C6D47B1AD38B42C9C41FF13334AF5214182A3B5E8433106B57676326D84D4 4DBDB110D8002D1110A62B60A409970A5D2CCE07ED756761165007BA320FAED0 5EDE3D99BCC65F270068CA0F20EA003E53BA7DE3E999B7F80265C113EA933882 9733E4AA1736364442A5A5F5C817C86D9521A6875EC14A5670CDFD87744E6AD2 052FB6F4CAC6ACEA29F5DFA087F9F97158BCF9DB4147D399120CBF8826A4BA20 F79A0F15869A7BFD170633526DCD7523C91950F3A90466E1C04431E7F4891630 2C9CC8B0DDF9A3963D0B119DA76E54E0AA599BFF467F2048651156EC73C719AF 045F917F507111408290D70D3992EE604798F876153E916F0871892BDB3C51B2 AE6B9CF9DBDC96809CBD75BC52C0FEFA49896C72CF900B0A15BD3E0F60C68F5F CB7C3ED9B155BE9DC503E3B71E4544E180A245570B285EDD310CD042ADC6EA57 6C97B28803191E469301CF33A4AEB4161156B50473D85320A4631FFDE61E0983 E094B6C7E9F2ECB7E2EB31658281B221A9371ACDF9E4B4DA38C3632C4D454F1C 5DFDE797EC6C7526C93DD1B611ACDF1F4F204E96DC36A30ABA189BF3F9EAD472 4BD072A0AF4928809E08395F55DAC06E17E06FDEAD7E311FD3CAFE43BB21FCD0 395890A85FA271DBB2C0EE2BCC2E93C7E4C895EC5ACB2C2780EA8E0F9C7DA91D 08D0879833C64AEC6D4DFFFCC2EAC4EE8BFBF9036081088BDB9E8B7BC3E7CBFA B7E836D8D17CACB86040862AC38A0AB7770468A7325BED1AE9792F20D4D1502D FD0ADFC9B37E0DE21548426AF9C111FC0C2DAD386971381439A65767A0082C11 5EEC0069E5CFEE1B5CC95067C7B539CCBBBE9930B0BAB982DC71185851A45119 B232A0E25F322B2FF97151E2465E04F97586BB9F582BC61FE7218A62519C0E21 5FAE43869FE5008E8F10FB4C504457BD790D2A5BF0DC20CBC17EF1F8A482AFD3 504F256ED4402C226466DF495D50B509014D16136E339DB244533731BCCE85BB BC6EF4B26E280F14CB34DA01670A6C49A1E7CCA644C2CC1629AC87E2C41550F1 D6A845B0B4C9D2E28E799F8DFB9553C3EC0EE8DDC954C5720A63102F1406BCEC 10419A88934379EFEB39E9651881805B74F8B80FB86AAA59914E161D7DC8863F A2F08FE10648C67CB3564CD07D4E24A8F6A5B9CF47248F0270F055262E4196CD 73D6660CFED5F08C7D63641B06A9BF475E1F30EEE591C3F7D99447A17A1BE38F 884D74D30EB547D9CF1B07E9949D04652BAE17CAE3C1DBB218ADFF4955DA8233 5614B69B89C687CE7B154784CF34A111E05A18B1C195326F0DA114A593C07B35 9D8AE5BD82CE550FF964F024542C99E68F97252843A48EFDAE2C024346F97CF2 CC76D312BBB4676F8296BFBDE5DEFB60DF1A3696AB9324D485AC2FD43846703F FB7C17A60EB3A0097D01773889EB6FA67D511D5FFD960F0990CFA9E4D8DBB4E3 3881636881C27572DED04AB12EB9D9A16A72B0320D748B66AF32D44FC0328E9C 05BA1017384F859D899AB1A2320C1D64B7B76549268E0F44EC26861E3B99A59B C589DFE69B89DACC79998215B923ECCEED368981419C0A603583DC4347EB1BD7 09A147A1F12B6BB5E3B5005C4C1B36FF339DD7447BE0C2D6DE59B141EE5D2035 29C6C50CF54178EDA0A58A5211B0EC6A6E07EA3981AE389F6A93F8B891B82F3B 362AB6DB11E43E4033FA28496F7EE49492E6EF7A62CD1DC97AC106098DCC4540 415F2F3F9CF23CAE718B77F2B3543323CBAEE83412F05EF68BC9F9C3ADCD20E1 2FB93874BD380763E9BD03059859A833BDAFB215D1CF0762133053445DA3E18C A58E3AE0865BD24DBBD9FFB8B15F81F2E54743B6FD44C4F5E77E4395A6E56889 514E47B0A28375B3E2B423EAB01A9B42862EE440663D9485198614F38B84B29E D87D0DA9D6AFCE8DC4E5294452422B5E165ED5609C202267FCEE59C3450CF6B0 2C920AF68C39D020940D3F69F3A726A7D4DE59ECABE459D3F9F8CE176F7C4654 9863C451410396822362363B9ED20850DAAA4ACF76361FFA0EBFCDCEC6C27EB7 33DA06AF6BF462F9CBA2EAE0C4A02DBF755CF6236A6D6E2497D5680F38B253D0 8682438DF3A317D05C77ED198B68797B1E5DEEDC528FFFD3AA8E05E72D7268DC B7CC741C3F083C5F237AB7A9CE8A7B69AAEA065E8F3076431D3DA33DB07F897E 0C9451456876D8031552126631DACA4231D3774F78F06C2B39AF962C79DBF69F 195B9C4347E648AA764A35E2D20C093E6DB57FCC77BB8DA1A0BD4362AF74BD87 EEE0351E39A3A2451012CAF5DCBA4EA07258428FAC61 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark {restore}if %%EndFont %%BeginFont: CMBX10 %!PS-AdobeFont-1.0: CMBX10 003.002 %%Title: CMBX10 %Version: 003.002 %%CreationDate: Mon Jul 13 16:17:00 2009 %%Creator: David M. Jones %Copyright: Copyright (c) 1997, 2009 American Mathematical Society %Copyright: (), with Reserved Font Name CMBX10. % This Font Software is licensed under the SIL Open Font License, Version 1.1. % This license is in the accompanying file OFL.txt, and is also % available with a FAQ at: http://scripts.sil.org/OFL. %%EndComments FontDirectory/CMBX10 known{/CMBX10 findfont dup/UniqueID known{dup /UniqueID get 5000768 eq exch/FontType get 1 eq and}{pop false}ifelse {save true}{false}ifelse}{false}ifelse 11 dict begin /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0 ]readonly def /FontName /CMBX10 def /FontBBox {-56 -250 1164 750 }readonly def /UniqueID 5000768 def /PaintType 0 def /FontInfo 9 dict dup begin /version (003.002) readonly def /Notice (Copyright \050c\051 1997, 2009 American Mathematical Society \050\051, with Reserved Font Name CMBX10.) readonly def /FullName (CMBX10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Bold) readonly def /ItalicAngle 0 def /isFixedPitch false def /UnderlinePosition -100 def /UnderlineThickness 50 def end readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 12 /fi put dup 45 /hyphen put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 56 /eight put dup 57 /nine put dup 63 /question put dup 65 /A put dup 66 /B put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 71 /G put dup 72 /H put dup 73 /I put dup 76 /L put dup 78 /N put dup 79 /O put dup 80 /P put dup 82 /R put dup 83 /S put dup 84 /T put dup 87 /W put dup 97 /a put dup 98 /b put dup 99 /c put dup 100 /d put dup 101 /e put dup 102 /f put dup 103 /g put dup 104 /h put dup 105 /i put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 118 /v put dup 120 /x put dup 121 /y put dup 122 /z put readonly def currentdict end currentfile eexec D9D66F633B846AB284BCF8B0411B772DE5CE3DD325E55798292D7BD972BD75FA 0E079529AF9C82DF72F64195C9C210DCE34528F540DA1FFD7BEBB9B40787BA93 51BBFB7CFC5F9152D1E5BB0AD8D016C6CFA4EB41B3C51D091C2D5440E67CFD71 7C56816B03B901BF4A25A07175380E50A213F877C44778B3C5AADBCC86D6E551 E6AF364B0BFCAAD22D8D558C5C81A7D425A1629DD5182206742D1D082A12F078 0FD4F5F6D3129FCFFF1F4A912B0A7DEC8D33A57B5AE0328EF9D57ADDAC543273 C01924195A181D03F5054A93B71E5065F8D92FE23794D2D43B233BABF23DF8DB B6C2BD2F04672F9A3B7FE430263E962F16A948319C51B8ADE6E8A80D3D88023A 6DEA4D271676C2C8615C4A0EA7DC8F6601610F398673A4D4B905F49EA868FEF6 39BE073001A36DEA6C08ED51452F062B971740019692E221F4455EDE46AF24B8 407A98B791F6AD525C72C09776247E194043281D04FE1CD1D8AD8DCEEC3045B4 F95B3B41CD3300768D8A049815348BD7AC1004F5500817E3A267D694AE108BAF 285B288FC5F28A03E9D34FE5D9B2F9A9BB26ADE66B1CF8EB5BE606E83D213C33 DE083C20D636EF780E761944FCE3B8A950B1E6E7568F33B557C6D59E0CEAF185 53E609A4F58AC4D5269116F958C4D115C44B5A6DABAB79D3BB6E60BDFCECE108 74CFBE258779F32C80CD7D9A7CEBA50A0966BD9961F71560119668C4A0C30A5D ED91ACB30940502B24F33906D6E0F16F81DA87EB6D7FC8B7853BE388C40D75C2 2CA8F94713AAA1561F5321CE97997CB4AF0E37F44E25B0F73CF4986422B1CD89 8F861CA623004ADB1C28268D7F8C484AA10C9519B6AEADC95AFAA3304D60E85D 718B2F67D2B734095E5A92C90785252C98067DC05137BE735220BBCB7C341D61 C4B98BFB1EAF883D38D7A93195A059EF82B42027F23B6CD633231D704B891A9B 03D11A646F13898F20321D7BC150C63FD6DC6BF9CAFD8DA759E95384B729A0B2 767B9F3E55C682F7A248BC1184F7D294CFFAE0B246DFCC8F215625DDD4F49F09 FA8D41CBF4A06152FEB152C61539ADF7E70A4D23AF8267D25CE3B12D39D62377 547E2528D18DC4134FA3BE0437EE0B3509223D71F06D44C6227D62BD01AC0A2A 3EDA975E894371C07CA1027B102549A7D552FFD25ED2DCC68E29E71BBAB43C62 57B0BFC6A953ABC2EF703F35D112F6B5460018CDCEAD17F149DBE5B52C2B9E10 9818EA6D97C8AC884F6841C9B600A7D868F59C1D80E98DE0741D06D69858EC84 1B33C6C9938B7E8A6FF6C12AD456EECBD3EBAF0D7331536B9F6422019FAFFFA4 822E79D6D89D6366DA636CB708894FEF904F366E295F1CB808E78E883913C4FB 1631248ED6A7CF1095C0C61C4F05E4B9DFC47533A5FD24540AD71A0E2907B98B 28085EB88ABFC3478C9644594C7DC4244ED5A7C1CA8D960B65497D56D174645A B88F12C2CF0A807DA314017984CF3C4FB7F47392A651EB9CFA961B28E2989893 9FC4D97171BD5338673F5D1CE2C3C08D48A1B77769F01D5058236C655FFD864B 80E28F900191D4EB349AA5E400A7B0A0FCA0F3E79D7A7C69775BF754329397B7 D18B20B2683CBC4A19729BA878B3C17EBA0A7E9EE297A5B67E915CAD92C8F356 582B8299DE6A58E73408F525F7EA895C48A8F0D626A06A96A50348DFBE479D89 4272576FBB0CD332193D28A8F11503BAE98F8E1D73CF5BCADF23DCD4E6586ABB 323568F5A34E359661074D50CD8D9DF27191FCE24F10225A5D721EFDE2547E1D CA998077D2340B1A4ADFFF570AA677CDF3305D5E3A394BB1626EB35074D4EEAC 2F037CA2EA389F7683FD17A8E07C12B4CB3BA8C249C9B12D297C618009F76717 0EBF5F2DD39A6BDA10A2E5A811D4E190660F5FDDBA29201B6F8042620397AB2C E59267A7247B0463891831A6F40582BC3F614E5167B646A8F53D8A31717DD9A1 9034034E705BA7884F0E0738307AF69D3517147C282747F2788462FDC4336A4F 9CD222908401A25F0A1F7B13B8DAE622DC965AD0BE62497420B70C04AF432237 E0FDD043456187658ED93B0F9822A3998511DF05E59CC85B7B9992CA0CE3B814 9723BAE70D2631F32B4BF93511F67179FFAD2075E1591CA5907A4C67701B56CF A5E5B02EB4A842BA1F18D6864E5677359C2FB4AF5BCBABAFB053F230CC129B45 8D15413F736EB07C571521C7DE2A13F2AC1C133D491B0A607197BE9AA1231D96 BED7968788246B2E4D2BD330F802810F5BDA3760FEA5210CFC6F54748FB1D921 5CC3624BBA5B8962AA7D94159651589540B17CF7A785F297264F9C1006D36928 6E2756D3B623A6087E4B106FBA76255903C624C07E18A1AF4E185A533C640711 86BB477A906ADD36EB6C8F4A12BC2F01B2B98412E4E105977640930CD998D990 0254A1E5E9843B7A8ADE0AF6D5871E6D3D666465AE69813A2E26333213FF6713 6F08D55A90C079A56E1B9AC655F720FC22B5AD8550FFF26DA7B0C5A0B60DDB05 64E8FAF684F3A455BA9BC9278043D79537D201D520E38750335A4C8FEA887377 879331B68DAD6B253F4FF9981D0F9B9550ED5179B15EEEB00E560A3DB6E5973B 63403E4E2F40A3D0B937246E9652000B917B1369741E0F913C14C2D2D6D1FCBE 2CEC4422177C58523715BD070002EC2E13D383A1DC8C84228862B6C5D3B65667 9FA97E175239BB7FE7E37E14B96DD7960A8AD49DF428CFC13B5D3CC22E245317 47B5244DA97F1DF954CED2D552477237CB23D037C0DE728E26C82738954EEA1F F34FE497DA005AF03746DD2ACF77F6E6F2C224862A1D18AF6F7A5DAF34564387 9E01DBFF49F8621C058C04C2B3F4F3033FF3E8A977B2CD6B2A3CA4A6C569B19F C5AC457AE9AF334DA66A730960C7565E93A2D373C0E3DE14646FFDA05DF4C6EB 6D4CA8ACCA3C3115764F77B842581760BFB9E5C0EBE55308B0577A8F4D968CE2 BA3361D79378D451DD150C34D7E901397AC63B33BD7DB13C50D678F5DE999238 4B4EA15BD449C46F262D931478F5685CDEEC4C4201FC3EFA607AFB8F27AF6751 125DE42D2FE2D31DE769B7E7FD8CC8C5D91343B537139A822A5BC4160BB5314E 37501F65B4FC35475FE9E03E34CBF6795AE86CE409500BD0799DE39FA69978B6 EC74D2197C03632D3F59B85F404DB31240968FA75059B2581B101E028CDECC2E 7E5E25DFA106E9B8ADB81E82BE9ED3BAA9D03EEB22B7B67AB1262DF6AF5F5EFD A5627EFEB84F3A5F92EF2557EDA2843D7D18C592635623CEAB14CC3620F33986 410D6DBAEF9F86E4E6682054540E2B01D8FF2161F10E66851A188BC15BD6666E 8D3F21709F196A31EE676D28A2D12639CC2E7020A52910F052E61A0710DF09B0 064171D05611451BD24FAD64716F141E1C41D3218A8115A3D73CA041D02B46D9 28C3D07DF0FB668E8E91409C8D0A26A65CD737C075E026AC0A974C9BE658199B 3B9D82ED95E4646977D8F60717DA4C68767DBD7E8320D5AA1D5DEB2E6B009759 8282F27D64F1F904830AAB501CDA4D9233FC2F12F77F0FBCC46E6B729C71F6D5 E6F3EA02EC35D1048394F4EF2177FC5EB726DE5EF2DE7997166B8BE5B5105D08 EAAC3481FC612665CA112D3F889A0E5B7843EFFCEFACA24A01B6AC2B7DDE02F4 A9295AA2409A3756BAAB44608DACBB56840060037869455BEBA46F10AFC68DD0 0563843DF111C6D34911CF13AA6023E5E899060B5EC60D0F78FDEF3E981151A9 24903EB13ED1A67EA1977449716D1A5A7EDE1A2E9465C9C2B20A58AF02D9F373 73E627CBF296B3A6A4670C39F3B5EA30D76F0362C81020A1777F0ADDBC6B52F7 213FEE1718214087837049CF2AF00407639657428B9E8B532F68B631611A3501 3D9DCA38090E227BD0D6D0FB4130EE866DB6B195C873AFD18DDB3B1E40F740C6 B3B375ADCBBF628A07A5FACED539FEDA3379D3B60216C2EA6629BE2F65199D82 FE3AE627D7C67270F3497AE75F7A9514968B5950E2D63C38DA240AF4E6CAE88E E25167D179108679876E7C80C85FE1D2BCC2EC9B88BE76A8F5736E8E6B3A9CF9 42E58A4ECB7914865E67C1468CF66D658206830B9380FE346DC2DC4BB56A92CE 4B5E4EA9036C177869315A2D9E6CFE97E3BFD7CBE0747D40CE5E8A3A0988576B 8AD2B1E4314C0D8A0CBCA08844A49F7E054D31BA7543730C0A7390BC4A288D10 CE29E389A4791305D3AC1BB6F77C805F1032787306F78FF76A20A9E629899F6D 13356768D33D7B9E294E8CD50CBFB9CA02A193922BD9B4372C912D1689B6644D 52CAA30F7421E8114D077288119AD9514EF21E5B9989CCE2ABA0C12549FDF493 FFB39736AC9EB72DAF45E4EA6057527FA9F5AA0A1A3F03C12F7482E465C766D3 760DA7714D56C91BDAED507A5572BEB51A895F8DD3BD5AAB042650154FC7E4E5 5EEA6194DF73AC5EE2CBD4EE26E29B1D2D0C458B4850BFE842DDF2EBB4E2A25D C6A11CA2D8F346E2B736DF88A3D57BC0380B52396A6C039212699F5D3342EB58 0C3DD5D01D5078479BD9FD10C07925556C0AB0F03606F33796BA72074549EDA6 E33644F62CA35207D7421D2727AD8419AD1772789D33405FCDDC9286BC34C974 A52297F5BBD2E541E8BB473F733AE5097BBC9D5FACF18DE4173B4711E28B23ED 16E0A6746A60F6FF903026A3900169EDA87D98396E762C2EC963D89197B8CD0C 25244806BE7CBF46BE60A8F9171731EADFC969C28679B025371E5572E52A0EF8 B3FD9B4638D03E20BFDEC9345E70B8166D38846DCA68E0D0B4B53629C7E7620B 45E0A610BCD07FEF8814CF915CFB11119F42407D1C6DC1E6353451D40A382C2E C74DF2A4889ED5A3495C3E973565F7178CA190D22C9693C10EB12C1E7A8679CE 4AFECFC964CC98111BA4ED2BA9B10292A71D5B11870EB08EB483922CE8628A06 05E7CF6DF93E112B60EF888AA8DB52994EC33DC7277D7B7A4F913AD30257261A D6EE80476A9A8D316D190BE6CE0046CBBCED365AB305495284FA921BE0638E00 63DB2AA4C5F163340BCCD1061B469504DEE350B82FBE1689C1B65D095405614B 35997D6F0DACA7190D64ABA351705B17B23FE2EE5996FCD607F49F54392463EC DD5B944A4B82FA2BE3E75E2946D483060DF99277340B0AB65A2042AD088E2B75 BBDAB869D1940F64B50D25078519D18748AD64AC5615EFAAF4F3105B0111AD40 70EE173ABE6A4ACE486B4E5999158A4377FDA6922FAA6E9305F48570D14BC81F BFF4C663E1EA9D1E050534F9315A663C4C5DA52CB02EA6408AA473C32CB0CD71 169BB43C0508A842F400240F0063243B4C459A1FCB3312C41C32ED0EE87F591A BCB6D5D3830AE4645CB4D40336DB4AB6540B52E70E1EA415CC6D886827EBC5B3 EC35CC5C136243B0C20B3C603B648B132B99D05F9B48263ACFA59A856BE74441 FECF5C6D1FE9D1F4F9942F460961901E16017144C37E83C6822177B2A6C47ECC 6C47A1104460665E5BCFCF08874008302750EB991CD98D0D8D22B921F90B99B9 05EE7C39F2BC2A7798157503743C9F2F267BDBE2E8A4CDA7317F81DBF8962E1C EC02822CC7F770FD4D08D335904375BF0C6DAA0510771627ECB9EE69C0F47D30 69A87052989DF80D9F4F19F75B070C3689AB3BE0966453F9D56CED6C1745B50D 813AE6D7E44B73423AB3778ABE4CD2C4DF40E14C5A426043F7057E2DFA2DAA70 EA6723F1C7967FECB1E7C1C0CA283334163FBE31C32254490170C3513580A552 19A5DD75E6C4ADCB12D33517A03318A6BBC7E4214266E125140D8C40F78A0340 1F95D9FBEC4DCC55B71E89375AA94B0D55646F6C069561480407D0A3AC127024 D7D1E9ED6B599A2A8766B8792F46D35508B66F302D289405B101A3C6BADA680D 8C56E2A00B766A4CB155446F862FCF17537A2BE85418E20CD77C4F1F69F70BC6 17BB5DA8FAA876D0E8BABE273A19C04A8697B3E3CF4725E2C77C8761A9243F24 96F8AE96399996001A57FD75106745AB4646FB9C6421F1D4EBF3BE533BD11AE8 14BFBD6D308376B26E08E4ADA490DDCCA94BE8240403D5EB0FE3549061DFB668 4105B4FE77189546619B6BCF3F9723E278E98D50A17DB8A4C46744FA21760635 5B332689316BD17C966D466AE737FE3ED7ABC443ADD88D4823A10BC9747ABDEE 027515AC353A420523F85298029475D8BFD83A2CD00C02CA07974BAA581D2215 A850E6E4C0A5E17E0EDF91C63FAC18C70093F40FEEAF0350B403E2806F4EAE96 BF616A805616EE55C4657418C26CAF54187A6684821B86A76F15088AC4D5B551 66C3CA8DC61E9810858D1204F899C7E3A1754F483134609F6EEE6364B1CC04FD 92C86EF194FA3249601AD722D75D1D395CD15A93C768EC60A486AE885683364F 93DA00A865C1035F913FDA69E7D9A0422880FB81EC23C00427F07A5EA3CCB613 83C859958AC53FAEA26A6BB39ABA068863CCE3D447720BC31A5136E08EE58963 093AF587A72112D55853A1048A2B1695DB2D7F13CC924F2F0902071260C33ED6 30893A04577C0ACF0681C0FEC23E5404F844A83BB5A2F8DE1F0792196139993C 1152094BC36A6AE5BAB4B8281E506F485F0BAEEBBE71E174B7CED1E52A8242F9 DBDF3E0FBA296538D964EB5B7A4E23B1BB0F59872C9D4FE8498203E3AC08B71E D2B965AA6CD5D20DA6C83FDC86F4A5D68A58A72C5BB9BFE9BC755C56B24025CE 6F24443D3CF32CD711D3D94C7C1DC275DDAE3341D840090F97CB6CAEF274C94F 9F3BD3AAB3F98BA8A7B5CE5E48D1462DAAB37BEB1C10B410E8D33FA42D898183 BD4F807112D78AA94509E33C179BF7C9E82E55AA7D09E128A0DA06A330CF4AF8 5DC861498CE029CE8C1BD15C923A708F2E7AF98E4F7B34212A0CB417553C86EB 6DD46B0466F1A21D29FC5111226794ECFCA5DD4240C0B8D106CCD7EA6F03E133 BB7733F055D6FFA04EF5C6F872B4FDA3E42F0F036C4825543D75682ACF71B548 DED160ACD05625274799D0AE201305DA526E01A3D2A719B1B15C05CC09467F3A 5627860C0F36C503EE392E1786620F3F2287AFE56634E03566B9B1F537FD92A2 913166228791871A8F8CBA1A1DA634E8224058052A10FE1E67CBD3FD21A6C07E 243CBF58BDC78577847664EEA5225EB8D6679AB17C563848A9D4D58995EA3609 51C1443B752A070D9872FE1643F0677019235AC25DC2B29169D38308F2170A1A A0FDCC59E6602197D2815B914041FFC7106DAAAF30CD97400C6D0826A40385A4 C8520119A065CF32CF2FC5FBD8DFD29222528A7F96FDA533145846B3428F8239 E50277C366418D713F84B12A5FD4F904DC13DB1844A391FDAEB97643A6FD2945 942FD4FC5A4A35E184F23304B8B4D93D0C37EFCC4E106D4FCD0DA3E5D2117589 3FFC2BD1D121026562C55C455C3585050B9460891B006F62D9D9B66695C3D348 A467C14C0256FA9621CB056E7CD389505194FF463BCC4010897F9A690EA87D9D BB3ED4C174FBADB8A4744C6E4A44D773967FD703EC37672F9993DC48BCC8A060 6CEFE8E6B8F10886E15BA0466AF410B90DF0020FAB88BE493606B6A734EA85BB 926950EB10D2F2CFDBD182B0F133809612CCF6ACCAD049C8005A42FAF78368B9 E7684F98DE421BE0A3BC0FAEE024A7BE67E15C8394F17FE84DFD8156C2A3E94D 08259E15CC657E8CE3088395BF6B5F825764E141AE15EBD186DC049261623D26 8636705E06C6E4A1F8ACAEA59F91B042DF5DB9C2AB986A784384706A43E5F18E 42C29CC1CA86D4F247B3BBBC89F3633EE074DCA4AC15B1E33EE4822812A62E88 C32B0AA57249980EE17AFC1346074800FA529445D18649A0475246A25CF325A0 BDA06AAF392FD455218B13D9ED577D51A9500B9FB7860716A8E2FB3A8C4BE3B3 6656C6A5653AEF00184020ACA0BCCBF48BE3BF91E11C8658686C89848E714E6D DC158DCD1C1BC03B83FF94C60B1DC71CE8A86B46DBE661C9F8F4677F8A2C7CF1 E41A91EBDA2304735147BE66CDFF2673F09D408297302124C127F0B35690CAE9 CE1679120CC4D582FB69550AD34A047DDFCD9D411724554CCED753DB52D6AA7B 22B0C55EB698ADDBB0F8ED15C971AEF113C74B9E25DA29199237B98DA4023665 C2A63A837E4CAB38F8DF37DBAB5DC80C0AB25B56BCA5D899F1575E61ADF75676 F48EE26C054AD9A75FD88A3E17498AC26FD4DC8000A125D6DD423540B8A98779 B28CE97C9CAFAC45693FF43249E4B559E7F19FB349F94B60AAAAF05B5FBF244E 982B4B51D997DA5811CD43E1917DA885DD96133A5CE1A290DBBFD88AF285A879 D3136C41C839FD2276760A7B4F21F4026AADCDAB3F113FCCCA9588C7FB72643E AB8F6D8AEAD1DC3DCA6E436B3DF24E7DC6AD37137B49327871EA80F3B8AEE932 D20D9A5B4779DFFAD7B3E5D447023D6433575F8F5AF589D7E094DA3786555D0C 046A427ADF128E00AC7B458D5A131A130D6F49A7ABF47833791F172D69FE6393 EAE0E90E7FF7BC2333D4E0215D5201E4B209591782F8A664335F67B9DDE36DBA 793EC77E5EB405862D14EAB6A99218B3F66F11EA2F345629C402BD8FD9CA0AC8 FB5A2E119DAA9F80083C9BC54F4586C44320993CB5D9CBDC8F8522001F82A16C E307F175B794F4426E5D273581A6D2844444D82093FB03482B270D693391DEA7 CB26D4A418E48A2989167B7DCE251F0D53D5C9B29D359A568FEDB965DF31CBF3 900392FE739A2B43BFA2363CA74FA72668FC761D1A17B9C0B56D6172499CDDCC 90EA538A5526FD5AFF81D04BFEA703E5DA963B11042723106704021C1B90557C B7AA96E076842E2C5F929FDA6D05E0B91B5548006EB4A6EB262077411083C2EE D51D0D237A85D6480DA41A9D8DC24EAEC0C849E0D53D9FE1E54ECD82C957B8B9 ED68D7B29A43F369C28272083B7B4E700546D293DEDAC7E74EEC946B4412B0B2 0639AB78E79402C787F50C4F78991DBC12D73F5B371BBA2CD9535EEF0550084F 40A4B2C4D178C0C001E63E08DAF15D064426F6F24C49E02AF5417D18BB7997D1 46CD6476615EE2F496EF2D2E5A6DE68ACABAEC2033F9F3689D9F8CA23483C81F 8E9CC42B7AF2BC3FA80B68FD37E3B87FC27AEB7AF6D2DFF9B4B7A60D26292AB2 36461A349D3BEFAAB8918729204873D7793A647387156252B5A1B975639E02C8 9715F8B4853B592ED9E467BA41B32363ED0D7557EA0AFB8EB093B4CB1FB3CCD9 3369A67A60448575C7CE305DE7C1B59DC21DB0132F2B67B7B31EA068C5942DBD 7D1BE9CBA33107AA60AD033EA5B3618B83BEBA01BC0DB592BCB0796AF520E8EF BAE6CBAA5DAB5897040D6CB1E3EEE78A98B59897138A084E64E116446EDAB213 46AF2FED3E303F05D7EE630434645AD21B410AF8C1808A79F96CFC56741F62B4 431AD2FD90CCF0A876EDDE18506E73B4E390C752DB45A2E8BB824F2E0310C59E 864A74877AB522D1B477F5A3D7ABF80CC031C2F2BE5D633E49E6D10EB6EB8434 F17B15274840BEB842587F3B9AED05B97DD603AAF94D5FA688675B55D40FA43C 6D97741D9FE5F54C7D441AA62D48801769531ED7EFB3C438EFB1B513E930FA50 51B3D743AFEFD98A368F8A67BED1F89DB11BDBF10BD7C453B4711475E3D8B36D 38F6013E88D476907A47591803200911E2C91D05BFFFB6078443809546E9967F 2C28133CBECA6A46C69EB060253966788EB6B03FF7440121976BD13CF41A65E3 37735CA90366719B4BA72DA3AA9ABE687E00081AD5F370ACB8EC00E9A2608E78 5391C67AC9C3B91DF9A4D4CBA46CEAF0A879549CA69DF46E64E255F1FFD5F183 D3F0D57CC92CE4B9717BF0D529670457E00E1DB0091E05B3DCDCADB1E695F8A9 643B73234CD7CCFC906FF77FE1AEB7996F9BB0941764AC80BEAD3AB69689DD71 829FC2DA9FFD25C55A4F377ED8E0339C3CE89784152C25462CCF12E525B25FF4 3162BA21E584BE4744B3AB0D1D8702B3E070D395A24786EA7C0E671514A0C34C 04242B86A8ABBD44EE1CDF1EEE5E014744D5DCA956F1D0FD53A6826B19AB6FE2 B6725D8EDA0FA3EDEC3C9FC0BFBA6374EA60EDDDB9BC7FCFCA76A1653CAA740C 848CE2BD10913B1C0D56C31229D9BA0A6773C8686D59B5734B563FEB90C2AD89 B41A4482CA1EEBAA5C23F65B4433252909EE79FE294598331AFEF847A863E137 6EF97AFBB87EDD3875AF98FB1FE6F8D8C840D4896A183FF4E395EB7A69DCE16A F779DB5DECEB45541CB32FF7D147CB85CD34424CE13529BC008B07C5D4E3FB13 343F286E50D0E1C5C6294304F6DE699987694C2C554C31B5DC282F94973EE4F7 F6CB979D1F833A7D988627BF757E7EB41FF5421720E7677FAF7F5B3F108C3259 AD24C4E3568F66F15D2B2A9D73007D02FB25DA53070C2BBB4491BF12A6070CF4 16CA6A8A1CF3C9C525A99A138FF64C26509E5A8414F1DE38B6197DD8D11FB10D C168A78AD39F674929B5CA52529A0943657E521EF464B036392F4234435AC61C F55E02385AA48B228CF68EE003ABE571ACD364C5FB0D8C228BC7A3F25D01AAF6 F48FBFCBFA62794496BF3E3E81985D350AAA08318765F176B08490CE3A67142C 45F58D9EA0360C0964B7B212364259B91096A56BD0E793F02264142AD1CAF3E8 D35822D785C9CFBE1CE2D9EFB82C89095AF08B79F006105EB6DE44259EE9BF70 5C6E0EE6A07FA6EDB2501056EBEB0D9B5DAB1C8D20598F579B415541567E42DE 42EE97B97F664C4E305372C98E9401739B3454D2C121F96631EE73EAF3BE24F4 799D0520DB3E0D66477F3309BAF7334BE4825A689E15BA0AC471F50DA2B86551 0896B0133C1D0C2CA2204D441DE5C130420E468CA64092D1D03ACD2FADCF17B3 6116420CFAAE8DE28CFED91459D645C92FFDC3103333656C79DD1C174C26DD97 D462B4323F33B410DF5688199749C1033BF3AF5145DB173893CB13E06F29ED38 79FE573B8D71F623B9DDBDC3D963E6BD1216310F9E985BB49A95FBA4CE012773 9A7DA46B0786D3EB2CC51897FDFB7F0584A27B8858AEFBFD489E95ED63577DBD D11ACF5AADB51C830DB3013C710E64F79C9A3BF0D8FD11C624D47D855A697253 68619710B6D441D479677B8D2445E89188D4C6E30E071838B968315F4DAE4B93 182EFEB487A03399B7388FF1D7990C7022449B767A53B1F7A6E323FA469B9A79 CB3DB10C2CBEFC6EE7C3910BFC8A7F035020F22A24E5028F75BA9907504610E3 FCA106B6354EEEB39DF382A91608E6E18CB5B301C30552196E990462063969F6 EB3AD5A1FE45117A0C41ACBC43774A41103397A70D335D41F59317F44A60ED73 DAB72A2F1AC1DA27112B3B5BD9EE970A2FA1D95393902793AD1EE7449EF39334 3EA3CA06165FA1B97A103553E65A2E7BC2E0E314F947ABE6115070223439752D 6F68BF8C58D876D19E4EBCB30E13B1118FD1A2852505D49C1DD2E8EFDDDBA23B B2E122DA14EF90423285C4B2AEE0E0AC90BB3BF0C993A463C85C7B84E28B6530 76CA53A959BF6B5D832E47A32043643ACE7D7A6C034DF78B7705482F835A9B13 5A2ADBF33C3567BC7577376DE977EF041E8C7CBA75E31E934AFC237FADC20659 B5FFC23D6678819B0ECFFF5D5FFD4B7E393D0C0087260DB997935F0EBF3B02AC CC687DB7121310F0585CF385FF18BCF6690415AE872823D8DDFFCCCF5CAFD705 3A236404661DE55E772F5982E78CCADCFD0F1E7ED98F0DBA07B832A01384E9C4 BE1C89F8850E8E42ACD39AD383AD1C88F8A6095792FBC22E3475CC5F0868FC16 70AA36319BFB524C43653393F079F9C6D50E67276A6561CD437E2F807EA88EC3 A71BF767AF2CFFAAA7F2F7C36C8D1379D5E50809FC7E1269F6B0B975FC09D8AC EBE423B40140F7AB6FBC84982A912BCBF17E8709D2BA620993527700DC510B03 8A6AF5A1302E74E310656B8E39C664C378B22F5BEB0A7534B520BABBEDCEF166 2E2BA4F9908402DEF9AACE7BD76B3D4A244E3AC74FC0995E07B3C24E75C142A9 70F63BC1014A091DC95B235292FAC3C7A7D26021EC57FEAD507DCD205D996587 9F665CBFA93110676AD2AE5F9560C3190AC388C4D02E161B1383535A4F10EEED 8D94717B2F1204BBE95F919C0E1C145C9C4FA2E5F45647C73DEC207C3655C2C3 3ADFCD25AC12FC399B1BFA5399079A9895F9AA99EB00BBB0003D657CE719DA50 9D4F43BA1C8DDC44D84808BDBFA2B4520DD610CF4700F270FDEC99E3F728AD18 9C3704E7851BBF2779EA23D1556D2FA4B3EBFE54E9035030C051DC42FA7A2D4C D25B3031951431451DCC308C9F52C0FE67A430243F3A7669077A7C13047806EB D5E004ADF8877F37D4ECF3850ED78ED3D353CACADD313809CC2E963564A4C96A 8D2D967CBE4C2C1DA1D57C1262F9410698CE0EE13AB2EEE3C205CDEDA3E9FD1C 51ACA46DF2689707673F182D18B1B64AA641DC0B5D2E3C75F92B69DE2040CE0B E8D521A8EF2262E75AEB00318E3CC133EC8E06BFE8F5DC0B0DE4B5C07421CC4B AB585DB6B9C6006EBFB534E0BBB1EA690958489F447EBAA15D352756AD4F3F12 7998C476A97E0C02C44EA6960180EBEA8179AC127E389F8DFF90FFC1D382DAA9 11944A9EE8EEF929D59E67DA7CDAF60B5D4A4856E5013E0E1B9DA36CD2BC5805 EC4AAF141098AFE7A0ABFE13DA4A82127783186D035BF6AC2000A76CB9C2A81A D2DE6EB557A01E0D601F75E703B667C902386E8B52F673E637498B81C5850DE4 61EE162F63ACF4D0F6FF6D1BE8D75BD6F6B45E4D6B80AFD640A1FCB8F3569E43 505B1E2DDE5F3CD14DC9D79DA9A100E4BBFB032295F3D3D7D3D8FE7A74E85A68 B86AC38C1AE0BA99ED69509B0EC0C05DC92512D643D1E85DE755715CDB6188F9 71C4C231BB06D27A9824AD801B32E39A9DAD3D172CA9B298F1565BC05D894C24 77BE970C01496D0BB219D33A6EE47A2F0F17BE3D38C692A045D056DC7B0FE7E3 6DB650AB1B57A11227D1CB0F6BB39C6A42D6E1BFB364BB785632E7A32304E63A 9133DDD269E32DEA34E7F51899D0AFC478CB2E68466534F1CE6962A876219703 ED2FC5FA93395983F49A51773ED86EF88E92D8DFF989F1B889A6A4DA40CAAB08 4BD0B7F9204799606A54CFEBBB3337E9A8BD0F36F3AABBF60BC63BA27051EBB6 39005B0F32859A0329917E9C2115A4804AE3AFBF5A987A55C50502ABB7D40273 53DDFC7974CD3DF740A26BF4800C89786CD4C34A1735705301D15B620465DF3E 58C716D47F993149890751D449837C65824D0F5BEAF06105BC8F417457C1303E FE1D09B84149C161DE84DB241A0BE45798F3E4DFC138A7B517CCA9A654C48DF9 A6F3318D494E7C3862A8FAC46B3E3019A934464B108D04698782A19F72723107 06E6E4A362137F7ACD4503591A289C81ADF72732259B9A5808445A51332135B3 770D95945B561CF506D3C1ACF988ED2D57F99296041BB5E7EAB0DE706016B9A4 2588C88A0A872D3A23C2C7A7603A6B64AF9C9EB1DC8E975599EA1D24D9D74661 EC6F0E964937A736090B2720E7A8D0EFCF0E137B00FCEE27D9A785564A147922 8E89EEF3B7837A8F3B92006A798174E123B0BAAC7CFFB85667DE113AE99BF4E7 A8D3A053C5AF0FE4EE028F235576AF2B5839F48B5EA2E52E73E3C132C014B8BD C57ADEDB1EEB9D559E94145BB5D8C3C7991A3714DC3936819D3DE182DFCB51E3 9DF3DDC87E92E231B19349ACE65C3F92FA72A7B04A93B0ED306655770B72598C 02BAAD8E46C1EAA4C626EE4B79D8506CC911A6778B4E55D3775F1C528F86344E 732342B47E40DDA29D8AB7BFED5414CA5BE9EBB5B9C842B119D28969E5E93356 316A956653DC5DB230AD54DAC40C37B485E2134157179F42D042EA817808B720 A993A29EEE99FA05BF1F0AC366DFD68D1E5A73F883A8396C83B170310968A070 29EE691A16AAC8A766DE4D5422B7A31C76D078DFF769BBC6250E1CDE381F099C C15182FB08FB3F8D264466E05487ED12C4A03350893658681D7C3DC7A212FFF9 0C97B99B80C0C6D4B802525D45FA4F17A2A22967DDFD65BE3B7FE8AA99B47DC9 BDF9CDD6B195AB80805AE6845545DF7E1AD9422A1FDD4E1D83AC18B958E96314 6F212B6BDE0FC431C1E3CC432C88B95A411EF2D6E977AC24571D4D822EFC4FC0 3EFB0B272B6EFE4D0D48A9974BC93EAB0FABCBA97662B2D81A19A302235DE926 125A155461F09CA091145E1EC1DBC3F6793EBAF0507142FD3A647607B87D1AAD 082C03B124C018EDE123CB00C06C49FCF7730C99E1A3B78AD688CAE629620F41 3EA301711EADC4DFCB64F69006880845D221B914CF67BE88E06113C00D50E2AC CE37C887E26DC09BEC5FAB2671FD2050D4CABE61347D53A502C93ED92B489E9B B88A3C283C02A4655C572B06777CBE3A6509816D8F3CF05FA53FCBDC105A7642 E241E1C6E878CC719AEC4170A9E5A7BC6BD273B5675C5C8733D01F547AEAA9EE 879EFDFF98E5CBEBE33830F00626EDB945E6C350FCBDCB7588A2CF3CD1FB88AB DC67F7CBB76DB822768E21DE82C449F557B828A7BA3BE562D47E52151DF93042 6DF5BA30A9A5F7694170CB3288F30695356FBE6E78F140C7ABA068493635BE2E 9949EDF0284D9893633AA0FFF1124DEA4D6CBCA23AFF86A150AF7B6864C688EE 070982CF1A045C59C6C8EDD0074E53693FE44C2E3C1B4C6161FC975E77CAD117 2E1DC8307E5F34B5BB48C53B2832FEC5055EA232483F1BB8B41C56DADAF843D3 C5D4DAA4B0A473FC638441D06D50359CC11EC7D8213D627AB6AC0998026FEA42 61BF67BC22ABCA793402936212E580CE20AE3BD64AEF38C53D80D3A5C18BA612 6B467EB103BB7812C0D50F2E8AB1FC243C11224B31BB9C15528CAE8D1161F714 CC4326EE2C6C52B43BCF8373403E13635A1A2D15CEFA3D321F14DDF82016C296 850FF165ECEE7C7D34B5A3C2420F6AB3885EBACC2425617A4F62DBDBC2256813 8128028DA65C1226E4FA6960A29782148E56977896CE840834B4DE4466BF66F2 8BFC3E675AF4ECFD98091F925A6A7388FE7632E81ECEDAB09C2D52BE51C90B14 07BD70A44B0B322E40206BC00D3EE62FA32E00E9BE8AEF6AD053FDBED12E1601 A40DCF631B20A87BF2456FD8A662BFCDAA343B63A1626243AC146E7F30BDADC7 82571EF3897C86BA1856B3D61C61EDD544F5DF50E1FFD9280B1BB662D6521F66 4A25FA8E0EC8066FACB7487CEDCDC63C9B55E5F34092F44AE2386825EAD79839 5E3D1EBEB0DE988F909497C90508A225D6C6DEB0FAA8021CDD89CC9F4975F526 3CD610FE5447459BC4EA260FC6E59FA463B5D955A86442DC364AD7F7755ECE28 27DE7D890CB2B6D5803E1DE3793C732A497DE317B7D822BAB058B2DC8792A53D 14396E642619580BA0511256B7BA086E4D582DEEFA85013940B6030B05A8464D 4F3B9E0141661F1437B04C7EF3E4DE7B10D3B8A23628D6C44623E9514BD374C9 3FD5BF4451D4A5E2DB5A9C3C8E3B8E61A60F0CD695BA5D6E538B4F5CB6DA9FA3 3FA576BDF9204FB9223A49DBADA1F9548EFA3DC364520236B6CB4B571A7D075F A324DF77E1BAC3F9BA48BE5061C2DC90D0608A601DC234F2E148271124F5A16C E80155C891997AD0F18E6F75521502C040B7DB765F2D8559F1D3EF1A19565491 CEB28D067B5BCFD7DB631DFE03CB267A066F4924BA43417ED7CD5C9D5F002D7F 186EDD5C15FE2DDBF88697D6EDBED661C8507DB862737EA571B22E3C669DD417 26324EC6117823AA81A38EAA2A0587033A38F4A8DC7DBB0DBEFDC32E7AABFDC1 895DBAE3522D0E5C46EAB9B3DAE973F55508F5CCCB3452FB091CD2B5381C32BE FB8728979F8F884A0DD4329F8D77FAC666D0B8B698E3D80F6A9CEEDE7F1579DD E080743DD0C61EA2B9001CB2F3196A5A2103465EB911C6D4E691AA899C279952 3B8072EEDA3D4ADDE09BBC09C7D9C800829DB095A040F1AB1F54628DEB0FE14D 5510DE3D56E9054A9BC178C19B093377169EBA708CBEE34274060FEFB8B1AF2F 206451CAD4D9DC64966F5D97D4E545B000FED5157C4A6DAC5BFF0A733E0DFADF F3E131B62B29260BED1E18950210C5F698D56DC9C269D90D21B6267448C7C342 1F70172652FA4B661282F731D0986505D02EAF68DF8D96CF2CD30954EA9B4FD7 C49DF7C29C0B2FADBA3A19EAEF48F05084D2C9E653084C0FAB5D3159F97EC87A 668D0921DB864084A17F407FBC2E07435E1F2BB1EC837D289161FED3C9D24867 5356F09CD591E2D5E783AE67AA661114514DEF9D27BBCE8E94B840A51819550F 15D24ED33CBE809EB9F6920FE3DF926F304A7C84194232B97C44F4B4D6E6F79A 3255BF6A8B2A3CDB1CE1CB2D35B032317936F0581C68A514EF60E7E8407BBF98 4E946697CCFD6869D209FAE41FB35095253B149B84D6EBACDE7AC83724F5BF0B D9618D18F4978728B8FEC34903C236CD1563373D342A136BB42031D229279805 BB970423C5A50053F2A3A1A90AB59D401CB18F33BC9A522854FF786421E2161A 4B7E816B636136A19275772D913A348715E88B2AC979ED52B5D2A71C9CC842B1 EB4F19E3F65520693331F28F8C52B25F4E5B9728B4F18620B91D60C090C3BD1F 0F1BCA19028B01C2B74368594F604F07F32647C806958EFC69D5613A90DD13C6 2277894AED341D2FCD2408D92F7168462AA1FFDCA5092869D82C169DA78BC51A 3FE6749142A493EAB7515869AD83CB1284B5946312F7B8FB95CD03C41BD96B19 32B350FF96A532EA57C6496A9E7DC0FF32A77118D0F763D2C520EBAE65F0D30D 6A06AAF63D24483A60F924441B74ED4E115BA1FED174EA6D76F732F029E5B023 35D0F3D8494F89F73CA258CD3C69B87892AB774030B43ED877A2378EBC5D86AB AA9897C43F1AD3BCB208931FCC200FB8CBC0144FA905801895A32AD1148633E5 CAD90F7A5A3CD2B7C26D8C2894A65BE6EEBEAAB29C4287A91EFDDC141D5CFA74 85C2EE30B519B18176B302075F709FDC0E3628EB488E7F3556F6CEB8987D60D2 6D26AFBA656AE055054390E31049E54926A46C4E725C1813F8419547DF2F0290 BA684526A1413C834F5EADF7207C00F17DE7D4A5E9FE4B333C9FEED30D27394E F986C26A8134F087A30C517FFFBB5056C7E09288179CC323338B9E5D51B4CE40 084929BD0B319567C95013398F888C742A9117937C37A611831807E8B79FACF6 BB7437C907B9A1746718100BBDFE54F03D0DDACA812FDD655BE99D56568FD3C9 65ECC800BAB60A5E12F73265D9A5976E4F821067927EC46753DDD204DAE95D94 C28DA40D3FA922E165B199C1E62B4BC76D7B5D8EB08249D432578C36DE95715F 1FCF15C00846B18609779B397E7229E3BF2C53313597E089498BFAC7DE2DB922 9A2D0F4A057A571FF0CF9BA00C9EDF11607DDECC928A70343D823CD1AF3642C8 4432C2DBEA606BC21492CAC2F64D6B0613A14DE29AADF0AC9FF2D50838C43ACF 6ED3E66565FF76A92FCCCBE1DBD092D0456673025C133B024D9DA7BF108CFE93 44D7D30BB783A8B401030A1CFC146DBB271A3621FD679901D80E10DE4E918A82 E1F5054D3A6FDE3390F0928181597B551A0E88B7A555E6C6D348A58467F0195D A6592C53382310A1CC4DF1DC28886E566B637F165321E68B336D07712659ADDD E770F2BEDF71E714D91E61A53400DCDFFD600142AE2D30131AFE4CBD124E0BE9 39D59C7DEB0AC715D19231C9E8E339CF7052CBF4DCA0E55B87CE7F339DC4C7B5 E61744866A3BF7B23ECC97BCB2F103090DBD716F3CC00B5173878EB857CCCEE3 A82B9E44785D77B6BB0500929A29FC28C508671B1FEE39E8CA257712BE982C12 3931D9586F5CB3C6C0054B3386792768E220BD82629317D8E029F249645A77AD 0A19B154FFC4EE687059F77AA1E082300DFAD4CB633EAE2E84471570F496A3E1 B774E4A94B1463D8E39C04461E53582AC7097A5C3CEE507E91DDD6E235670844 8AED01C7B85E531D713777310C8C2EFF2BD948B3CD75E4A1D59D9EB46E2F9686 4F54645A052DB6E6EAE5429A3C26C45E6781CB518FFCB38F1AC2C22988C40701 4987A684C9CE8A3A3BDF22ECFFFF303480DA68BE3CCDA267331D914998F3DBED 2C40D6B3464CA0473AF611E05B8E3E1A83B311BE68E8CC89EBA849EE9BD830CF 40C3D3F086947245D5A2624B4287442CF4556996ED6A5AEF8E3B9819F9C14578 0EB7C1041A9161A1EF61ABFA81E8EB094FB9DFB8119954F31893213A1665DE12 954FFA96E565F524D531EF73B9B85EB0346ECA74787471DF4371A366661647DE 1DBCD7314D28072A43662E76E752F59CE9E0626E7E2CD577C56622B5170A9B6A 1F0AA075DBA0707B291BEBB9F12D88E7CEFA3B3189D7B141EB968CB03F9BFFDF 55B80A0268DAC7F38D75BCFE4AE9BCE32988428C490FE97A5A3AC7878A34118C 36733E3750EA1A0CA65A072F6BC0F8F080CC13B632F2E4CDDF21534258D74CA1 7C3DEDA5BEFAD5F4A848B745A0C8991B080264C3B8A97E457B49E3BE89E88F58 B76AACC3805B37D9B55294CFFEA68D62CD533D54FD4D5D2122AF19FBA5002307 456F6BE9BD9A05E15F1CB2ADF6B6D8282DF80C86251405B11A0ABA45E9AAF0D6 250D108104EBD83C29A7B8A2E8D3B405BCC1023B8FEBE7AFA64BF86948487614 75B89CF0B6BBBDA0D89251625B6883E0BDC7587D53627825D9D5F877AFF6E47F A475481FBBAEBDE6958BFCD2AF4C339DB8FAD6093B1C0B93949BB626DADF28E7 BE73B1187A4282DDC9C76AB4D2C1013F2ABDF0347B2ED863DAE6E0C16974A049 20B420366E23153A5DE9C59C58520C5D803BE95D640A957EF380E695CF308FEA BD6947A97DE2F6C80FD05985B455FE61C1E9C9F4A9FDBD377CB4CC93ECDE303D 832E38A9E2E8B2A96D4BDF3DEAA9ECDA4B17E99B684238258AB15D75AD724D14 A210BCAF06FC36EE3025F547DF566E547F414DBEC4AD342B70A58CE1DA417A2E E7C57492A6C419A68A1525F0F25FA14CF30F03E6019C90889B29A772CAD4B48D FB993FB6F1D1E043538D78BFBFCA5C7E828BE667417F207E8958D4C74A0E3617 AEBDA1820A6F6AA728ABBF2951605170C2C181EF7E9D6AD01FBE5AB82F0E885E 73AA7581D3C8AE764E03AE8E707F1C079413618183A46F61A2B9249308A6DF46 C48AACF726B82994CB298F11FD66D4235274328E2420185EC100F42A65E12165 A060FDF7BBED4EB3301F900F1CA1EAD79BAEEAEEDA6BE53AA695828BAF3791F1 4BE17F43F124B5DB0F2631DF408F317B6384E9ABDE4BBA689BDC532FFD68D672 775F7D59D8AD4A809F940019B38836624C4F0E4B2236F068AC48BDDFA5188579 5B6D28B8DD9AC9A71E80D140055782012159CCBD1E6C21D33C90B60DC37BCDCF D2DD9CBDEE36E1F877A4B96462E2A31138924FA625E0F1307538321AA90F26E0 BDDFAFA4CBA411AF3902AD078F7A17D436BF9B875E53DB9D92CEEA9535189E68 3C7DF98998368C586FA1CF7EA74B43E7182458B1CBD74E8F4147B205ED7AEAF5 68662947F89F6CAB53D142629E31CC4AE2E80921FC276C540BA457FCD9F0B03F D1BF3836AECAB05D56F240E0104AE35943F8371E671AA572D20FDDE7900CF5CD 3563F6178660E0C0E9DFD3611C9774F8A27E979655EE6E908ABE0610B534FACD 2BAC549B6AFBD267D7A65C52482D6E9791038BB23408277F6E552C04CA075B92 F90DD38F6A9F9DACCFF5F6C1D20C79BCD1E65D9C06F2FBB4A7D7ED0015F43C3D F8D9EFCF060B4E4F36AC7A6674E27430998BBDD0D9128C43D6B338A2A7CAF47F 9DF2A49780E4B23DD8DFBC2240D0C0232A07B945A71D0ACF267174CC828A6776 AF19A0276BC7E0AB58C9AA1C45DBAB3B77DF463051EB994E8E1F7BEF4252EE19 AD2FFA7EA3A65DDA9CA2E8637A48CCB3A1EED2C2E69C1FEEE3F5D7D4A4C34078 B954105701C313931A9341BA57DC9DD3D8992EFC9209F47A1F1AC0B616875ECD 1D752F86F340D9054A5FBD61A7C6590FAB798D2B1396281E0180378A1992F13A D6136AC53D92A3164E6BB0A0930768FE6AFE6D2879EE4AEAC58809B30A025E81 6150B1E8490C18A16E5B05C93090024FBEA893C380EF665405B49993ED9E659C 3BA313623878E9DA858271B4A9F97ED69AA74C602335F3D4AF9DAB166F733A41 7A82958BF203CD36186380BE1C591A1BE73364CBC1330CF85BAEB031D583A891 52709C2B2DA04BDE531910314BD327036C9C524167D30A7CA2F279276A33062F 60B35E8F706CAEA40D729435842B0ACA21E39D5FD5DF19773485211DDDDF651A ACADD787CE4208101C8698BC9C63F09519ACF4B9657ACCD657983D0273144497 FA40FD64C712430C190688B15D9C12EFF944806436A5DC610CACA624EBD0D25F A04DD8962C8A44FB6CF1FA39A5E562A438CFF0C3FA6C1C99EAC038AA313B4A95 5961E7C6928B4A48BCE1A6C008CA716DC21EBBA2411346F665CC7F3CB2BF854A A99825BDDBB7C347D6DDC3237E819BBAFC4B7C524D2B5F23EF538323A4976AA3 59698C365A384D8D72E28F0B84850FB092446A480DB8C4FE34B130C02FC0C476 3630DD318976AB9027B08C365B106FC60A9C2957AE7FB84D1857B23C8700308F 9041575CFE2BBE3545F866921D7026E4BD4B3E52C86A37855045EE396A1D085F E2310F995C83C94E701922AA6CA5D6CB4E3810E6525CEDF774B22FB958232834 7E073DFA42087B4F124DC5095D4392352476F719A81023C295435E03F281E109 2C83497D825FE9E776BAF2F82A82DDCC5F7EB05A0CDF3E68D5F50A9B737973EC 6D0A819EA3EBD18BE41AFB468EA875A0833DB1B09AA199E2F253B445417C43FA 925CBBB0B6AA77AE597675F5AC52B0D1E1ED4DB1BC25515CB7FE34622AD36A35 BF00DAB84F298DD5BA60CCE41BE93F8E8AE23E7B5D6E12D4108CCC2841924E4C 1F9088AC2A143B3A05D4EAB148A86FBF37AA04239D96DFD6719FFE41F92F9AB4 AE9A335B25FC54AB8238095006F338669DD41726324EC61B7B2A3E69D178453C 0BE8327D967B37774FEB60C991FB54328D63DAB0EF5F5518A29AC066DEAF23D4 1949F2F0831869331442742DE14849C5BD9B195D7C2DE699DC164B209CFBB8C7 93B8BFBB50552E7EEDEBE65D44DB80DED63014EB861422E72248D639EF6024B4 896355154AE8B39AD5BD95363E7F47318BB0859E71194B6A757FC027D3CC733D 19C39562BC4AF6B1F55D37581085F37DA1C44CC84487818D3773995FA2D8576D 7E0974BDD9B7DA02B15F569B2A790A365B7BEDD7C89DD3F0B32849BD779511A5 D737A46035614E5D888CDBDE98C5449BB919C1038D3188B0AB499F66AFB71AD7 4B28C2BC918477AD1F0BCF762A4EE94F17AAEF29B1E846A0A345015CA6B4817A ABD725B85CDD17DEE1548698617D3CAF1F94C7E057BC0C87D0636B6A098EA646 7CF57394206D2718A1B4828EEA5F3B0CE76AEEB2E2DA301B1A8D2C01E99FF4C8 B886EC3721FCCC77F52A246840890A2BC4B4E9B11AF17668A96602C376F6D2C9 A0351B90ED55CAE684E0865B713851B9CC0B8C4B72B3BB960BBC9C9BC91AD453 25CEEBDFF2850810DE61CEAA54B501EFF14ABA7932B1574D0FAFDFDF58418AA1 716DA0E5BDD1A205802258B7A3E8F6AAFD13FF5E1240497613B984C546A038A9 456214BCB825DAB57C2697E57126A02EBCCBA9BC51AC59E0CE027D66F6425000 7375276A39395FBAD2E09EB8E9880A2C448E7DECB8C9B1FA6F5716C12FA87448 3A6DD376D4AAE9661A8B6572DF9FD5D5B94DBE1876B3C95CC7A35537F63D9952 827831C0CD350D0A4BFC3F515E76A4A814F49B2F0869014444B4B3CD58BD73EE 70D72207407032B6B307E414051F222F506F0A4385E657361620208104F2A6B7 EDCFF91AB5DDF2041BCC68941ABC3A50607358EC386E20242386A83B75601ECD 9E672768549746C6E8448FE0393A4D7881ECEF8791600B851B3CB950944E631D 7DA811EC601D9DEEE8D04A8A2F9F4E9A6DE32727A53352D9455332329F13FE71 7E225D65250601DB655C2600F313D85C1207077F3CE767F6EC6A77F543024237 52B6AB0DA86C3AE56E323F64D9429E70FFE568FC7451444305E8212A5130737F 71A66D3E5D89300B3B93B76D2D513D15FF680239294029822A99C4A5B134D08D AF8059C66FB1E830E7616EF46BD14035FE3D32F1B7162DE509331CA04CA9C15B 15C73357DA32DAA04B51A1D48CB22D10DE2A863E6D261C0C7D05D147676D7D48 83995DD9879B25F0699EBCA61812480C81E05290C3923BC134DA2937C6632A14 F45BF42CD9A637AA58421994495556848404F9DD613E1E982256086A8369D24F 9B37FB818B24F9ABA65E2E47D8F853C6FCD1AD4E9E6F870671FF56E6D9BC6292 BE74F1E118F59B193E854A4B5B3AECF32668E0048FB691BC1995938FC4B63035 F88592D4345518CB8946D86E47D234086FA24F62E725F3E9CBDDECE622255627 24AEBE3A420D48203EF7B8003494C397087F875F45A01A3010C3152AFDEEEA42 D177E37D68B2D3D6C33F884E9DFD544508A44E5C4524DCAC6459A5991D49C5A6 EC5104B1C171007C9CFCCFF4D23BF82FD620078D7D89C0BF98D009D50723B19B 785AEEDEC0A91B0B295FE7F8D332D270D3658D77708AB9CD6F0CEBBE51438F0D F96515D0D2188D1D09EA56C8C8DC35ADB827EA66F2D6A71C4FF9B6D2756A4EA7 B015DA0E9066A96F09A59E167381CDD334E7F82C3124FC10D2718E22B349709D B3E0FFCCF2C0081AD043083C1EF45ED03461EB721018EDDF2332296D20077E03 79556C54BB765CB22AEA8DA2B9F4E379EACB93CA8CC1B0839EC2E6B48A0113AF 89616C38E235A850889A82BC1618653BE3F5134FE90D30E8859D78B6A7A4C07E B6C28CAE8CBB51910B76F9612E03272741174713DFEA804B935DF588AA833C4C 1A114B036C212FCA0FEB55CA1E7E197820692B5EF17440E28445CFBF97FDD309 95D1358B56C85377CB3968B1E23B5CBF4475A1A1710AF3054715D0BA1E30C553 720C007AE29DCDD59353A1A9E516CBAF80E23AAFA730E8E2000E5C2950398062 F23AD5E577F62B9B1F8BBF998AE0F4ADF79CAC8C94BB48CD8D46DBDEE683C766 3DA1F21F8A4ACDE586C3D0E6DBA170C7527F228CE30E7C450AD43519C5A9AF73 487538F6FE879F6418F4704895D7E5D4C51935646094B33E05CA7B26560B31CB 3D5A66917B83A96C41692C544AEB7E5CFF61BBFDA6EB0EDDD4500B64B984F513 D029BA2E937249B723A3AED50F40CC338BEB5862753102692544152365562847 BD7C33CD48AA241F12C6A49EC77A96474D517DB46782CA9018A762ACAF8EE172 9AC8595498140CB86877E4491F0FB0AA1A79597A7D4342719459CD7828AD8DAF 513FB2FEE4F40EC7FDEA01C9CF6D566114BD4FFD6E196F73D15D59D4F861A2CB 89E368B282544B0D97A710DFC41E59270BAE32D63DE7D7D3EFA2EFBA245E829C BFA6EE561C4439ACD963CB9103BD8EA9F7C3B2F812ED8C186B25A624238771B6 51BF343BCED266B089561920835BD58BB2F42526248F038FBFE73CAA97B59A84 D93212F1297B3A15D5819AC8576C1421D6DBC00C134E8B271C78DC48271794C9 94A3F982B416D5C6D5DB064E570FF7ED5A8A9111D081D669013646F6A0C808F4 FDFD1F116D52179D75BC5EEB24C86BF6D661D1C23B2E5EF4B22989028CE64477 D1F7B1850D30726ADCCE1D85A818BC1EDF630CBE19C69763C0F51B4AB68ED1E0 BFBA4EF19E7D5BAAEDFEDC43ABD7FC80628A4B511CE49A7FC2641094091B83B6 F07662CE3EEA432D19934972BF175837C7342DEA1BB3C71EF7908228AE07C8ED 1107D3C85C3A91006B568F910A2742B6614EF465B26161BCB9A24E9F87EF2066 4C1CCA1B0A1055D8B9815D386DA4EF70CCFE471C7CEF767D945FB34A0CD7B2B9 E41CDD00EBEF36F247986D05DB87BFDE6CA70AF16C4BCD3B5F9CA77F31D137B5 C8481A8B907D85A76E188FDABF97580861B9F282B3C97F5882CF61CD9554327C C0844930ABBC0B19A868C7A16FFAF238970115D9CB1D677979EFB116D866A3D2 330B377E6B6A23C1BFB132956969E786D92D1288792A27AB0D84B597036A5552 C1D1EB65E96116DD8C7E0C4B4D3A00CC3BD2E9E794BD0030736E83EBFEDF7D01 A4C0943C2A8F17076B3171A4AD0F6C8A0FFEF5A5334F2FB90C04656DBF2D0921 0C6F548536B7281F748DCFCB276565C5EDF76CF588E01F3E585AF6C42F871D08 62FEC1A63B5B54C82DB065A16E98F9B7A79480F4A97F40C3270A9303E77B6824 F1275E2871926FCBC697FB73F7DA3F55B8A21235CBCCE36F5621C2C797CB9C73 78BC62CA1EB1B50F112D511E86A9482F58808AA83A8A9302E7158CB3E45C753E 9E2343AAEEB203A009270E4872A810F0A191E0B5A79FD1FF23FB2A1EEF94917D 8B7B58DFD3EB76550F5A1F949DA055D7A5D0A22A07680753A80B801824B23066 C1526B5C4E24734026637C8473A37BAA7E34EE4573F0DD5107DB0E6772AA9387 C1BE6614E045272AD92642AE015216C42333AEC9D3952E497918B1F13F50D204 A1ECA662D60E022828E65B8696A32BAFD19ED17166499D429C48E20436B197E7 E91B22A4DE1794CEBF8E83 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark {restore}if %%EndFont %%BeginFont: CMR10 %!PS-AdobeFont-1.0: CMR10 003.002 %%Title: CMR10 %Version: 003.002 %%CreationDate: Mon Jul 13 16:17:00 2009 %%Creator: David M. Jones %Copyright: Copyright (c) 1997, 2009 American Mathematical Society %Copyright: (), with Reserved Font Name CMR10. % This Font Software is licensed under the SIL Open Font License, Version 1.1. % This license is in the accompanying file OFL.txt, and is also % available with a FAQ at: http://scripts.sil.org/OFL. %%EndComments FontDirectory/CMR10 known{/CMR10 findfont dup/UniqueID known{dup /UniqueID get 5000793 eq exch/FontType get 1 eq and}{pop false}ifelse {save true}{false}ifelse}{false}ifelse 11 dict begin /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0 ]readonly def /FontName /CMR10 def /FontBBox {-40 -250 1009 750 }readonly def /UniqueID 5000793 def /PaintType 0 def /FontInfo 9 dict dup begin /version (003.002) readonly def /Notice (Copyright \050c\051 1997, 2009 American Mathematical Society \050\051, with Reserved Font Name CMR10.) readonly def /FullName (CMR10) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle 0 def /isFixedPitch false def /UnderlinePosition -100 def /UnderlineThickness 50 def end readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 11 /ff put dup 12 /fi put dup 13 /fl put dup 14 /ffi put dup 15 /ffl put dup 33 /exclam put dup 34 /quotedblright put dup 35 /numbersign put dup 36 /dollar put dup 37 /percent put dup 38 /ampersand put dup 39 /quoteright put dup 40 /parenleft put dup 41 /parenright put dup 42 /asterisk put dup 43 /plus put dup 44 /comma put dup 45 /hyphen put dup 46 /period put dup 47 /slash put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 53 /five put dup 54 /six put dup 55 /seven put dup 56 /eight put dup 57 /nine put dup 58 /colon put dup 59 /semicolon put dup 61 /equal put dup 63 /question put dup 64 /at put dup 65 /A put dup 66 /B put dup 67 /C put dup 68 /D put dup 69 /E put dup 70 /F put dup 71 /G put dup 72 /H put dup 73 /I put dup 74 /J put dup 75 /K put dup 76 /L put dup 77 /M put dup 78 /N put dup 79 /O put dup 80 /P put dup 81 /Q put dup 82 /R put dup 83 /S put dup 84 /T put dup 85 /U put dup 86 /V put dup 87 /W put dup 88 /X put dup 89 /Y put dup 90 /Z put dup 91 /bracketleft put dup 92 /quotedblleft put dup 93 /bracketright put dup 96 /quoteleft put dup 97 /a put dup 98 /b put dup 99 /c put dup 100 /d put dup 101 /e put dup 102 /f put dup 103 /g put dup 104 /h put dup 105 /i put dup 106 /j put dup 107 /k put dup 108 /l put dup 109 /m put dup 110 /n put dup 111 /o put dup 112 /p put dup 113 /q put dup 114 /r put dup 115 /s put dup 116 /t put dup 117 /u put dup 118 /v put dup 119 /w put dup 120 /x put dup 121 /y put dup 122 /z put dup 123 /endash put readonly def currentdict end currentfile eexec D9D66F633B846AB284BCF8B0411B772DE5CE3DD325E55798292D7BD972BD75FA 0E079529AF9C82DF72F64195C9C210DCE34528F540DA1FFD7BEBB9B40787BA93 51BBFB7CFC5F9152D1E5BB0AD8D016C6CFA4EB41B3C51D091C2D5440E67CFD71 7C56816B03B901BF4A25A07175380E50A213F877C44778B3C5AADBCC86D6E551 E6AF364B0BFCAAD22D8D558C5C81A7D425A1629DD5182206742D1D082A12F078 0FD4F5F6D3129FCFFF1F4A912B0A7DEC8D33A57B5AE0328EF9D57ADDAC543273 C01924195A181D03F5054A93B71E5065F8D92FE23794D2DB9B8591E5F01442D8 569672CF86B91C3F79C5DDC97C190EE0082814A5B5A2A5E77C790F087E729079 24A5AC880DDED58334DD5E8DC6A0B2BD4F04B17334A74BF8FF5D88B7B678A04A 2255C050CB39A389106B0C672A1912AFA86A49EFD02E61E6509E50EE35E67944 8FC63D91C3D2794B49A0C2993832BC4CDC8F7BD7575AD61BCDF42E2E421AA93E 3FF9E4FAD980256D8B377043A07FC75D6169338028692CCA8CD1FE92FD60AD26 D57B7519B80A8F8DCE9CEE5CDF720AF268D3C14099498A843D76E3B6C0328F24 D36EFE7F5C4E5B5C612786200C8DE3A41EE5F1FFAF4097653CFCDC8F4FD32E0B 03EDB3E413283B9EFB0AC33B055617005BC9B0057FD68C52D1B0E67F0C571685 767F2AA85ADE4E0104A1C777733D5E318A22A9944336E5B98D965E50D31F357A 8B6EA5A0EA98E1B027CE68C2EDB149EDDD04ED74A1B3D206D471A0C11C11449B DE190BBFEBC08C9E1B7513B43DA3134D6B11A2516E6E86B67F68C970A320D05E 94FEC57FB347606DF89989C33482BD09D011C55AA920319E7B26A205D3D0F004 22466F09C0482A164CFB27EF6ED2B040ECCC3DCAF345B5A73676F193D43123B7 72FD6CFC5E37930E61EBD5A6307E4DE70194E6384EC0D79DB6AD86D3B319A31C 8B0589D0FE28241D8ACE280D0530EE99C80723E560BB72AE9D53F4713181F491 344B06D3027BA4E9E94D4305BE1D817197C54C8FF56CD6964165F6448ECC8A8A 64B48B4F0FD69299A137589E2491A283509B21A3A5772F75B7602A9F60AE559B 07A58436D04222C73EAEA72DE9A5A441F88D27C11F4F91255EFE280E91A4ACAC 1E98A4E5E6C57B9AE86FD218C3CD8F24A4104156A80F13821384E529783C52C8 78B94AB3A0096090867ED32E8A30980E737922037F75F062BD83BF4F5929BC51 CC22AEE2DBBAAA001CFFBFF41D258424FAD888FFF1BEAB796A44E3126159E120 7E4025C676CF94888A1971AEF8B6764B3AF4A92D36FAF6FC56FD049710EE3782 BC2CD84FE2473F133BE03C1346B875463F126DCAB15C7A9BCC9A727D23611462 4E8D2BFD2466600285D79518712B8681ABCD69608E6AA9578F7BD771EC36E01A 5A17BC17E375020ECA59B43790ABEB9DF5F4FBBEF807E5699EFEAC563E1ACC5D EFA336E75DE6D8248E9381BB110884FDC89C2F9A41EBBC9A8A1F98E6A41F68BE EE30E25CA148C1EFF42DFF8C214A6537AB11F260B8C329A4947B5FC8DC9C5622 4DF7BF4FBFB00380D47BABB03BC30627AA74103E553F55278F538EDD8C1E64CE 0F1398CA0AB5A86630139B4A7E8FC02804CAFF3830114640AE50D2FDA3B561B5 C63AD7EE3347804CBB40FB1E77A6C89735DD870351C3A1811591AB493251B904 314F65791963C0412377C1D02362C5E9655F1C3D4803CD379A8EF24C48218C2E DF1165840462BF37DDE1B8D5FF09FA2C3B261E2F1A65ECFBE5D4EAD43B52C029 EEB3948CB8A252CBAF545C8FA1C31E920E23A12DD7222CEF2D2A513BD758EA13 DA33BF5FBF1D734653EB83DA2D374A5B9A0CE316F24EE375D6DF6BDA49954C2E DB25A88821193636119D469BA66E5DAA9C92520FD4F84426A4E54273FA469084 7517817A6EE3E21176D333825E88046F50B3CF6938AF9BA79A2F51398239EB91 1A2D07F7FCD948427FF62F40FF95E39FE1A1AA8451411563FD5388472251C155 69BDE9283B41900B21EB1190D06E6B13B7794FED020D2C1BDD205AE77B084BCE EF628249398B496DE85B406FC2E1939EF00DFC84C07E26CF72EC401BAAE756E5 7F6673216E7560D1C2A723CB405EE5CA474A07F61B81F8836482F73DC9516D67 CE0CB770EAD755B6B356198B4B97EBB29C63456953270CCC8D5650C1D006E69D 38DE2DFEAB27DAD50A817F0D645D30AF5B75A7B53CBD3D2B8D87BD0A7E525AF3 22F7ADDFCE31716914C2318260C2E2B4664893921B68C5A93334A361D94A759C 0D7B146D6FD94F0442D672BDA0F6432E18F3C5DFA37ADA378D95B75F413C9ED1 BB5C606A3EC7DFB3F796F59B0478C13FD1900381EFE0BB5242D5B5D34D03AF1D 4BDC93EAF8020E26CA23C8B0E7DDEBBC6762A557067A4CE05A524188A8F02E2F 3625DA38DFCF381727887F5646A3995A8A38A5FB1E5D5EBB395FDD0B7C8E71AD B48EEDB62AB2CE99D121435EFBBFCEEA69AE9ED8238B60CC7288DE33C766CDFE 15B767B4AE2E6CE0965E77272AC9F86023DA620548CFAC85BC751C44218A29C9 849F1C2DCBDFAD895B54E51A569952ED50F82DC8A19F367E7E44643854EFD6B3 FCAEB04E55E4661C82D31E2932611748480EF61FB2FBFB0CFB940BEA81AFCD84 4C6A6332D7A600170E38A8EAFCD4F93DC153C43175434C86BC747348FAC61B76 1FEC9027C1A193E55C80F1F20B5317AA0A05AAA36AE235F6E49F06E570FEE798 84857D7552EA92EF3EFAD52DE39C2F8F43C59E3A957B7B926FC95FC4B60186DF 7F3523EE2AB74E294C8C4BCD8B4975E84849E0FBDA6C0B0F24A636DFA578B122 CF97BC5089E21E9F5298D1C9F30CB8BAFF6A3A11BB4D9A0A5CF2B18D055C44CA 4FD4D8FE1AF3630907DE7E585AA811F9CD11FB2C8FC791851D651009FA5DF20B 3C33FD2FF848A9E3F5652BD294965A332DD3F246C91B0ADA34017FF2451D1394 F9C3C95AAC6EC8062BE98E8914D51DA6A164AD13938693D446044859D03A949D F9AC5DF4A000CDA98BB516D762CB9F6D44B5268FD0C26E88BC4A760C0F75A140 DEBDECA4F511128B7D2805872160C55236F0A0FA7637FF0D4E94AC079CD3C8A7 D03A5A56F26B0438B577C46011A10532FEBCAD14FBD6032E224F45691A726886 56F305231EB2FCDF59C8BBFCB5DBD2D093A0E84D62AC93A2312CA69295E937C4 8DBA1802B85F54B5E7E6D6216A918F911FF705D3B5CF055F1D873B96283A0B53 59344D910CD396D883F6F7836BA65FAB4393A773A8F6BC298069E5BA38210EED 49C9D920F718E3FCE692527DC7CCE6963BF744F2C91BC5952564196D60574E86 87A0FAB21F2DB2BD5A51D7FBD8FC19946D24E5A228462C4772F978E650ADCE3B 8D66B9C21279C531CA1C3A8ECE3420BB65837287A7222CC3673A2A5F8BBFDB60 C719CD073EF9A23675198462C7C87B24CC92D6AEE5C25AC63855CC3281494342 D28F3D2FDE0C183486769A4FD5B0143193D31FCB2C2A14E487BBD96D0BADBB64 D1B56021C363A795BF10E2DB448261C363A54A4AC1182B470C457AA82DF3F5D1 F4B329806141EBD53CAE309319B94133D7EBDC2D0453A905ADD207364371E178 0A95C2686E3B34C4A978BFC0EE968C39ABA00889BC5149162C2B54483D44FD3B 5CFF41F611C7E03B94945F414560E874D7CF27FFD0630890D7D7EA66CBD15448 229059E1C436BB33D69552B5367AB5D53591C4678D0C704DD3EA23F5D9E8A7AC 17D003C19E333E726FFFA2961F33C70F429085F7BFE3E2510F59B78F58B19CB4 01B48E184BAD9020FECCE3AF52048A056981DAEA02AE78197E65855DDB170616 F54278395D9EA50DC83761AE759F9CDEF9E1948E7002414FC05286ED793E6662 3347F2A9AF8917493D7305B92CF93E8E9185F70015F5594084298A6C2F9FD3C0 689F262AC9FEDC9B89577ECDE92F08D3142209FBCE7B5C0A840CC767BCA56C20 4E4E545E2BE4D21C53855CEE4CD0AB35D1A604C0FFFF77DBAE4289752276559F A05FEE65F45ECAF44E95E23FAB6052195C7948AF0B1126482D4E02D72BF8AB03 DE0F1A632F7672AD9DDE70EDC82AA993678A82BEAD0BC2649C4707FD8509810D 364B5C6FE0E10772E95288C622C2F06C634F4DF8C7FD1432BC9310D5F24FEE3F 7AB324863D6DABAA1576E70643CA79EF4D7DF4105093D66CEE0F3B87D2164A7F 26EA05F5C4645B22D3E1BFD2219657712C168FD90DE801FB0F32759E80DEC1E1 43CEEB19FED12D757205043FC98FEC62D6A8D8B97BC083B4A0E985AF7850D6FD 8716B9957C1C35A0675BC53DF672C425C79F43FDABAEE7D63F092CF271C9A9D7 C41F40C4189510987887942E60A412B3EEC84C9A6E1AC7D54D528F5604B72C08 94B7882621A5BF1F325B92FF96B80878CC550D1AE4D8196E41CB1251856609A5 C4D3BD05A922D0D45E039D9450DEF8490A3E924E41434194910BF60BA1B08BE1 B41824345627745541A4F1703E956328F6227D11C74946B38CFB096139979E56 4E723B889B44C6D78673868C89912F8B4F0B4B485F1587A637B630F92E6072D5 7F3B44EA6FD96BBD4FC28A6C1D90805E3BE3E42A7BC9C880762966C55BC04E01 204D083AE976FAE6F37C94F27E68F8C0F28D52B17F6C0FD7C9150701FD78F8CE B8E8DC9260E3974005EB5CA728171F482D765016C94D4ADFE4A42EF42212BC56 7E4EEEE8B0D2A7856CD4E44F55C0BAB762F92CB8D64C17022D4BF3A47C12F5E6 279FC23101FEE93753653CE8CEDC3B75C9CCB29BF1D4554C6120DE8EE750FCBB E38B5D915206974962E320362E59B3F21B3AB1875703191043D03284D4467346 CFF2F98CEB4845B73ED8E003E0DC94251B73E13A9B51A3F1430BCF6A21EB9B7A 65E17FA411F53BE6432F1506232B8159E008FA257F884A4A01AC53BE91754D78 BF14A5B0FBFB9C31BF4908355F8A762052968DF526D118708CCB0B7CB5BEE285 6DAB6CD2E3934178E60BECB11AAB5478623CF6C50C92F8BB5D1A583609028FA7 B8A53B791BDC9EF76A124F3F7641857E4BEA0837CB36176EC9A522EA7F41B8D3 63C37D1145367BD300F17B54522A834BBB74DE12BF9EB26ACE6F24A046D58F89 4D4B7DF74875F1A0C1C9D97BE0849593D7B398EB4B00BEBC8C8D1497B6EF831A A35380FFB7F1AFA4D888AA52C9482E8B1755CC209905F98F40D95B44D4DCBCB6 67423D1BC2F3560FF0A8B4F0CAC352A4EE2C1D946E45AAEC8A6AD40303F3382C DF0756BFA3B1ED64C169E56ED1C760F2FF0E24DC5C9F41306EF8D2628153D30A 5DCB0791126BEFD4947D7EF08301FE015F2B0008DFFCBF9F2D4D859FD43EC7D9 C5BE237E9BF6665B7B1BEBB362F0C0C3A8D86010B9C97FA741C97C2E0513386C 9C26C235B14DD2A58BFDAC7B5F63DB4DA6D5D37D0098175A9071590E1DF66A3D B8173A047C29D7D35557F06132CC920B5460B8AFC11D23D09A4E45D089F5EB51 963FA1A6256E359D485107FD143B2BF21FDE9DA5744BC2615E86C31C89470CF0 D06C6397D9FCCB316EA9989430240759D2C4945D941F159FC02327F34B042BAB B5C3A47C78E8C1A6FBCD396B1A51CC4B020B8AD401841EDABACECDB482D6EC5B 72D2BFEB4556720FADD49D07307C8B22ACB7E310CA4151A85C71EEF70E8D15DE B3B00F26E0E166C14647A65ADA228A3D1C89025BE059306565DB1B1EFC37D358 8C1EB024254AFD049BA977BD4C2C605050E17940A89D0D4C5D963E792320F5DB 3706682E03D25D9E02487247819551465092CC22B6B56E93F3AB528038FEC3F0 668F866707A19B0463BE706EC729D2EE1653AAC7E29BD25BFB3241D4792F5152 ED415B4E7FA92C2EE5A22E27E8B75542C492E56D811C192E95542A6FE0BFE5A5 69273C2ABED4300D491B92D2AECDD278404CB84B1BB1BD7AFEC858215837D118 C0E928BE7E07CFEEB51A6D21375B772B8248C994564014015232A0DA4BEA1754 3274F407FED0837A236371F1A32056240F2015B1E7F4B2CA72C6B58610A66F13 407CFFBA5E0A2893C1F572D50F51286E9133B5A84239C9493B0574E77D281D01 11D00683354A000C9700EAFBC1FD104EA19DFCB87470190E7E2CE26E3A6FD0FF 2620B87B82AC8686B6206B530F17E9348BC7D04B948348802CE53A312443DB87 4DBBA5313A6A2A8DAB8A1CC9A594FF8C299281C0A261C8CB2226B732FBEEDE40 2C6ACC74A1A61379E2E1CD5548CD908268A32FA83D8504C442EA0E183ADBF7FF 9FD09C037AB03516ECCA93FF048235BD11A25DB07F164512A079C5392AC7F889 CE96AE5C8D9580BCAFCC087C35E76EED1A671E87C12E3045E15A687134736DF8 DA984772AFD189D68571A2ED7256F1E204230E41D3D9DD876F938951714A3973 0CA9310489F8E807C1C7A4E51AEA5BC030610A5D7263FF7E0F9FDE3E5E37A362 5B919000BD94D978583B942EB79CF2BEAC33FEBC9A67272EB10865BA8FB75FD7 9D280AB59F91B96C16C982DE848D76D8FA8620DFD7C80B7DEAE7264350D6FB3A EF04794DA3305844A7CF718F6D1A4A3AFF6826173A076A1372ABFC54ED3AC6C2 09C9287FC830556CA694E21CA5342ECA7B10C90AFC4783D841D7B1E34FA3DB7A 2B706F3E21B0FBAB23E7257962FC3BC309CEA2C7239A9D6B44CC96825115ABD2 AF9A2566D2F3382C01569FBDB94C8D664A5DA0F7DC3DD140CA77C743D7BC1420 324ECF9E4780280EB119885E96A6C619CE3C0C8E1E264E2DEB137E5DC8149786 486D65667ECF47B1A1E20E9E6E4FC8323E0BC8E61BDD3BCDFC6575C69C03E31A EFFC290472CBBD049DE3F840AEE37A2486034240F80E75D8A79E0762377DF660 52B12EAA16D678990B11A9BFBC03C1D4FCDA9FD4FFBB3E88352438102F10B7C5 9F04C013B6575B5E948FAB58EA691984A0E54E6B9F3F505FFFEF74D06FA1CDF3 4B8A95904C8A2763AA8AF5B71D00F5DE09DC1CDF87A08B6D181453063E14C12D B7BB3775A6E2A901636273D9EEB833EA8CF20FD83AE899E28DADE10EEEC20BD7 BD93085A4B1AC80AC1AE8280C14767F1A487BD066007A0D050317BD081131A14 6EA0898ED59E46DA7B6254BDCCBC660686E2EDA0E77A705A653733BB5C5497D0 B130359F866CF293FB6EF0C2AC5BAA2DB0DED045E2DED3A2612D078333260359 16CF0CCB272D34767EA069E0F0B0D42327A18529D72E890EDA6195C2688438ED E9ACDBEED41E81CA8EB5E43C2B09CE266EFCA03F2D7FF57F12B06F9E54FCC6A6 546676F6FFC5B8B7D3F0982B6FF0D21D949309F0C0B175CC1D0976F8C55C6AED 6E821C39041E22D91AB30922F2B2EC2746BC7DAB484991542FBC82D87B487507 559AB466F73EE23C2D3194DC5CE4C9AE66D3164613AC5CBB3DB501B64DA7C91B C7ED2EE9027FC0906820B35D4F2CF66C4F9CE4A884B7C07155BCA884ECA5EB3A ABB83F84DB1F5639599DC7D3F51241AB5D95C3BCB7AB1EC90B4BC989F74FB354 04B2D7366A34D335A47B8C00C05CB423482BF6C7970A95545424A08AFF9A035B 7F83F52B65A9799CE76E303B85664B624C65E9CA58184C7BE2BB9D9C86A4DE5A 8165EE3DA2E652B5022EE7893896BABD88931DE1D538F615787645DF5ACBBA0B A8E5B899A37321AA7D4B283AC9234978C2DD81813A1EE5DB6EC170DAC1B6EF02 94892635B498765C07A38D2E9DB0B7581B11056C28278F89B0E60998379C07EB C0EAEDC32AA69B8B836F92A61AFD35688315B2C3F860632FC13E4BDFB63214BC 41CC6859EAB3AC3034449213CAB99FA1D216563419CD6D6CE4E1B56F33E6C654 7AA9DCB5B05FC068DF02AC32408C8010AD004F6CCA9887830927F8CBCD49CDB5 18CAC1EAFF815FF2F6F527F936948201565003022C6C7390B4E3C2B219FB4F76 9F12BD25CA7B3B61D1A2F8DFEE795D04D5428B42FB66E0C254AF7B7A10CEF7FD E5ADA5E217BE24851180E9A1700FBA66C7D2B0D7BFDE4F4EED1D24B821A40947 5620363657F6D048E651A689822CF815E72FC8AE9D835BE31D1DD8B54C9A717F 4DC319B4B59AE073936EA40B070524C7E71D5A7B64436DA107749746B516E29F E3BBCB8F8C473E706670E11E5B221716F315FF097CD1841D0069FA69EA1898FF 9F9EC2518C77806A19730C97F54BEAD604548D553D4A6EDB247853225E24E7E9 89D71F6BC94DB986467E755CCC99069B313F5745B02B4BB608A39F0A0A732B87 7EA2DED68219754BF1FBCA350327572D769C962EF9242132D93A5C8E9725D8D3 AAAEC15ED0F362471AA58488620156F3474FA59CA080EA96FE995D2B3DEEADF3 3141D157481C66507725ACA5953CBBE1ACEE7E3F02C72C6552D15EB3D612730E 61A06A43575568DC3CF3844BABF04CA767E2995196097015E0C4F622C4356B6B F41DBAFD797A4B9D7AC22332C552043EF98913D0D9B50CA6B7CDAF903BC5C04F D20A952BA5CC35B646ACD0A287C956B98C450051AF6AAF79DF37F8954473F8F6 652BF03AE2AE82B99D820CF93F5FC0BA17EBD7A83D1DF278C46A4F26DEAEFC4D 95D07A253330DCFED1B05FDFFA1995E7DF4CCFB449E94C749BD813E1949FA757 5DD7B4C68A3F7946CCEE6BDC8B12FF30657F0808D07508AF7042C2C84135434B 0EE39A08AA24298C2D91085B4E047C7F92AF7461811CDA6D6215BE29949D9B7C 6C2CE48910D18041571B8D78EC12E8AA4D8136BE32EBCAA12C5A7FE604561890 08F10D3367C653C7041D0105C2E3CCAA6E055E80BC34A62418DD202F6161D512 A8BBEF81030F8F05464D998B930B8273C00CBCC50DBBB4EC8284631410D4156C 420D073AE8ADD268DF693B9120BCC42030AFDEE9E338CF20D2350EC7C23EFC6B 84FC7A00FC6766383E542DF699BE07F01832AC295BB1D4EC2A7176E1356941B0 D84EBB40D1DAF93B95079B5208FADEA55A7F4DB794381ACC21AA586257CB4CC1 93F4F5E302F4CD994EC08C58537CEB1A07B545CE68FAB9431C7C1EE4C4D18EE0 57054558E43C1043FEC9D4F753D432EE93A75860E50D0A6138F9C1E2AE758EB7 547F9797BB7D67C94CA4C56EEA98BDA4683F7C3DC9AD05A6A8599B1DB3D766D2 D3E27F50CA9762F00A7EE3605053C657F0C29BF1E997B9206318FAAF01FDEF07 66BE08CB3A8755F90917C0356397CB0A51F6AAD0A5B019AE84033C16C4CF8124 9AF3DDACEE33F598125CED9B9D1448435737C4B976DB7C1BE5A5E04D16742A22 995AE9DFF6669B0CAA80B3AA3DA84543A2502FE791EB65AE23597A3FE54DD7F3 B5F18D3352B561261827D71DEFC21540EEC68747915A3E95355129EB8DC3AB2D 124146609E1F385C696762F6FB9BE1563BDF84BDC84EC3858F2EFEB078DDDC8F 7E5D556AAF054BB91545316B7FBA68BBCC51F65169ECDB878BFBA233122F0664 A8C32A7059E8DAC855A30E6593E8A8404E0245C6168B352568B5EF321A2190B4 D7FF9600621DCE9CDE00B2B3B74BF42249F20CF8487587EC0B8A6D267733EEE1 5CDA5DFB03D48542403188A95DBA88B32D541CD389CB12F607844E3AAF1736B9 3336ADD7402F1101B6A8D9DDD843E6E80330277D6E0220FE94FA9533CB7AF0FD 1A0B0F4F745377F6F6C1F58BF65298A8EB4181F3DF95321B7061B7E0724EBD5B 5327E16738602270A3D5548BB5D2FB075D0F0C696E83C25D3EE91CF5FDA380B3 B2DBD0E45E3881311E524EA96043C842BF330951E778C5F78A54EC33AD31D062 C51CDC286B9862B0C69172ACBBD8C29BA4C6E728D678ED7B209DE28EA7638060 0C84A5B873BBB5C95ACF2CE541F4CD21D51E4F045880A3A59649A14960092DC6 D54944FACD587E2A577DEBC4F18E2C1755C5965ECF93B9B5DE86D991E624AB1D 39A3AF2F67162A1F55641176BD1D49AB8414398650AD64241FA6ACED9F3B3B05 C10B1139EA424EDEE58B78878788B84B2F90CD6E995D461C3BF7079D2F8D9D73 31ABB4B3D8CF7AA16E329C0906D77AB2144E83E3CDDDF095CE9A836EFFBC02CA 271AA81298AB867D8574101D474D76ABB31E3B327F7984A141A4B19E695B6E4F 5EE481A86FE19A47333DC0EF0298B8B1334C1AA1B349A966B2E35BED54243580 FCB57AC33C49ECED9B0651A8A701D7C4E589D08AAF91653F9751B87E080F9D58 D0497793CD7F3E58DDB55C8651D264798761C4EEDE4626686759852C14524F98 584ACA7958632CECDFE1ABA0F78067D7ECFD7DC1D74BDEA77930F422822BB15D 1BFC89A853310FBAC8751A7D639E32C56935D7366083F9998909DE898AD273C8 F9552DE49775BF217C8C749A987CD8D037DF90A94F3150F7A88E7F6FF258DFF2 EB297BF462F7EB65F130F53748C9962D5AAF9F3302634D5652B38169615F1FD6 62DAE00DB38E8658C45DE4C70C1E197DD490B67B5A764A3D83AB75E6D5A65E59 2B1F7EAF53044BC2FE71B260410EA8E723F2DC4906B1A90BE32A5D15AF3FF0DD C87384E2A7901330070E7724BD3016C37C9A52426B91F64BADEEFB478579F9F9 25E0752FB24F272F436E5D414AA8759CC24A39C5E1B3C64C0B1E2C6891E1E109 E5BEFC2A40E67C8F60BC42F8D99017A710686D68A8AE56B83ED766137BF9DE93 B26B72FFD337D62DEA8EAC52293A16689332B9DF2949CACC76360DFA0933B8B6 339B610664417DD9BAAE8EF5FA845DCBA0FA3A311C79E23615743D19F602150A EFFB2086FBC818F1F770E2089B1A002AD7115B409DDFFEE2750E1276820E89A9 E654601A8B32C456E1E3746540D3FEA7A44B3C2F29AF468130F037242EA8FCBF A2B8E79293FF92366AB94B406D388FDA08B4A409D560FB6D269A3EEACB007FC3 391DA43178FE70E2371303D2D91078E593A5F819389E62DC1445E0FB4E607854 D3522A68E2EB0CD41602210662C53D031FDEB13D7844D6E002604AE05DACE3CC 784196A194210FB5200157C08E263713A72EBA6781EB4FCE134D4CE319947B6B AD8DE8ADCD2BB3F1607EDB09F9C68ED0C763172E10FD68718C39BD2CD34A3C47 AB803282C1A9E108FC6EDCC61F4410BE7699FF1E5C27DDA0BFA7059E492DCA4A DE31F8A15EAB988543240EA6CD5C33499F99B48F8A92F37C36121A68B5D8D2BA 0F0F047058EE30FAD733A51CB3AF448089073281EA3A153F0BF38A97D9B5BEA3 216D4234DEE2C2587B4F6233E2C2D9287FA97D0495E28C4B6FEBD4BE11D76E02 0E67B72567D21A141B694939D474D8829CFB026CD53062529F03C23C59305C7A 2A13EB8D4BCA76305F268EDD6453D78ACD6A493857078586A4978D5D2CAC77A0 D5895184338DBAE2D178C1E449853FA9B65F9E640DB8482D545CC523F824A0D4 14B78ACAE4D1B79240DFC6BC5959F15CCDB5EDF6FB73792F19A3F3844CFB2338 3C256592C59097F591180A4428B5F5E1E3EEACCD45873DC47E51E1E4CAD664D7 FBA24456666C28476F17C3D9790465B8852E123B3BFB7A6E26E235884F9C0945 FEAC295D137EC71A9AAE17E12419D4535D8409BB38FF2AB511BC73278B4B03FA 647042DC6289EB1BC15D3597CD6CCC99AFA02F36C06FA7B262B332BD30692F25 91AE7511A4119791E6B68C05199277F14EA2931D0A242D59D7FF296038CBA571 9C9CFDDBFBDDAB3A2DCCBCEA4EBAED6D0ADE2863DD76BADDD8122A4AA386835E 5AA9534511D08883DEC5C8F0DD244C0B3338E977BA417A24BAA041A20FCD7FBB EAD7A812F017F1FC52133A2722778B45B6B523FA26ED6239CE1DA897BAE6C697 DA0BC2A32EB4096C1B91B6657FD21E34890BE1595C10BB71E5F4889D27DF09FA 50C30B0872FBA1717B269FB79A3C226B8D236BD37D19658E122460848153C749 EFFDCFDC9171FC9D061F44DB7BF580862400636F0ACD21C2FA7427FC511C2B34 20A7A62D9A3955AB33E42B976BF76149CE127D7C861B4CCCDB0C3F3595204D37 6C77D861C64BDE28CFDB30B78F38C77D3163197DEF4179E719D6674DBB3561FD 06A05039754056D3109E1AAE8CB959A3AFC7C565D987966CA67DAC6B285A4CB0 05F67A4B1FBC5612984D2A04E3524579C63649A9845BBFD1CBF53B8E4BF63912 1EC4CED70568FD44C4A06C1B09547297C581E8AEC8151ABE17AE47D537C4670C 6FFE45FF252DD40ACEC5357E6ADF9AD8C35E9A96A1D2599784487797175C0CED B92CA4DD93B10176613CDBBF70DD34918B0795ACDF070745A4FA25CDE80D862A 3AE7752AC76CC989E3E4CCCD6CD01101317A71126DA519151A647E7DD77D914D 1CA90A09651805ECFD787922329586268E4196CF4CE7479621A99C4CA4FE5116 34877E4FB07ECE69B6C0C7AFB1EB859DB7B66F106F417F4B4CBC5F9332C1ACC7 C133E69C3160A9F4490F24184C496FC2C22E040E6E8E405B6610D75EAD6A45B8 347529021C949CF1915866A31AAAAFCAE6A0C08435D6020EC60FA00E445FD4F3 1D0820766FD83B173D6AEF2574A74E55217B25524B08C70599D57ED954C28AE1 56752E92A226CBDF51C8551AA749A2775DFFD6711A6B3BCB4B613958D4D4F1CB 3CD42615AC9FB770C7CE955F51CEE21B1E85D5CED699B5AC793F7177BD054B39 8E1404776A715DE0C28F91F3886B838DE2164D11927919B3C72F82932D8EF131 E429251F2CF9D3C76B94DC43DB22C6537028F942B0784D2EDEAC0C2BD3890CA1 27D8F2302B44FA2589D4D15B15A6714A362DCAECAF28DCCF9A70CE5908DE101E 04B85AA7CB71C13F9E6EB178DE3123DE572509CF872FC9564795D286861C1864 8DD540ECB9D75A8D2443EF80302912AC116396E545C3B0C3250E81B78AE359CC 28A09A94BB5ED1381699AE3552A4F0B30901535E761D9BB32BFF10B5A8068E16 7B6E9A24BFADEE9D33611275BFACD8CCD3D4790CC8A485CD0B5BBA7123DAA842 FF6BCEC22ED9DFA194E73CBAD1ADC447BDE46FDE9B905931BBFB2A882A378DD5 8457081F0EF2F1B5A882CD357EE2E010146CBD7D1CC4816486665CEDBCF3870A D69B166BE00A41CEB198A892DCFAD21C4AA63E78FD039645AE07909F6DEF34B7 C561A353903C775B46790D67CC06C6250BA67DAC397C6B87F989FC077BC23630 4C27C88FA000B08933EC3A51C8CB043AD84D4AF8AF50715712512E1EBF48AC15 CCE2A38F3F519E39D425DFAAC92B25E5439013F84D6CB08FAA241E2C9A07614B 5F8F09784F3111760388606285F7FF57A7610F631602558F3496FC0B804A01F6 7C1EAE515B7754A260DC830EEC514178030468E498096276ED6814A0921275A7 53214B3D4772E45B9F25F6F6C8B0D9FBEB02F5BE5C5D73E2392AE89CED29B60A 0DA566D4A6C285E99DB9724FB8B94C70D4A9E7A6B63C8943299AF33E060EEEEC 399C89BABBC727B584FD784D9CDFFF83DB3A3120EDAAD93A074010C5626DD947 0582E82C1AB8A01068A179E313C19ADFA5F3C967DD2D82103395FD0A5270EB75 A26606DBE2F4FF499B415AD8AAFD99A0B9437188DD87665BF143F0344948E545 7C5F7ADA1132BDB614EE50849934DE288E3A719938FAFD11BB7767CF30843CA2 357377798039E6654F151F9B1D75F7C178DC1D745F5E7295D27D7524D37DC63A 4007C2C51C889DE95191E6BDA4106A1326E0AD8E367856F95A059C3FFE3CBA54 E59272E231A3EDB3ACFFB8F392F4F4784D11B869CBDC8CABB9120CB6305EEF0A 3E4897AAA74080B76D7947EFF83AB0A7B605CD31AC2704D9CB29D657B7DC36B0 2D835C03642447F06B227A655D9A5CF45A637C56E7163CFBB15970D77B7F462A 5103E3DB92B0A781A1D977076377C1F7019EB0793711DA2406022BA0DCD47B47 523BC1FB5FCA2D7BA2800FCE8A18B5C5C6CE9E652E375CD20A5770E5077AA859 3924F7ACFCAF40F5D477BF1D407BBB7CBC5A8B734CA1B778372E8030E2B5FA44 6F46FFAADDCA84E9F96E70A194B98F12C792CE24D1E8CC2B838662D706B0CA8B E12A92E0A15F4F4A6E7EFCB1F3268007D4A4C1C70C204399DB54EC1653043E29 D35353E035710677AAAC9004B381DF4F2CD2D13EDDE6A265016C15A243D7BBEC 2E2682ED4B90BE9914F92D396EDF9104DCF3AEF6A806B382A0D8356B9F0BF543 013B76298E975CF21DCEE81C27F091AFE2EC40AB92CF91FCC874C1AB8861B541 16E8BFB4751A83E3676287A38B128FADB873031E5531132C609157955802BD70 47F35E43D394247FF3FE6754AA3148F40E1140A4AADA335EA8E5B766B529884C 2262EC695865C049B26AAF393C3EFAEC9268861E672334DD6C5BF4CC72D96A93 AB8EA53FBE134F4F9F84B30D7D4998956EC98AC2F766417B0491BD2774457FAF 26AA4AB1C22F1EEF8088F1C443E74FB70948A3CF8560981988C24B880BC92CCF 5F653E59AFB854449BDE7B1BA37436CE30800FB362954B249611BEAEE180092A E3D238BD2553CBC6DA57D9BE769006DF36A2271E5F025EBF38D2F59AF73D0094 CC691E60761391AF90E3ACC05638CEE7A7E49F1A8EB8ED99CBE15D887A107471 3AE7B4779FCB8B78DEF600702E160312678AF2BE9F2853061E29ECAE989B94AC 553EF580FB1E99ED0A91FC11DB7751461806AB125FC300B21811471EA0E6C835 6428D846FA91D68CA37FDE02C9DFA6A7E8CF2162BF564758B29383A88A406A97 6AB76DA0A6164A59FC693303A52ACEF399AE9B8BCB8A7D6F2D2330E743EB2996 AF49DEE7A861A8AB9D7A5D5EEAD264AABD8AA9A45886D212F4FED114DAD309C9 3F15FF18972FA9C3A6EDC2F0821009F5684B9B1DFE2D82D8D96D6FB8A5B40449 C8C87FD2003D8C1D10C4241A06E5B43DBF0EA83FEF44379013EA7F6F2B753DF9 74A1FA929DAE1082856AA15ACED24796CB23244730C33942E4CF07B885C76531 6A35CAAC15F4593034B77664B21E0E1013EA10630FB069FAD9F80601EB846211 F44935226E557477A3A3FF012634C889E7E1A38436C8CD9AF115C681ED8426BA 44549DAA63EDE74318EFA439B5140092300406B498255AD295CFD3080F4FC6A4 98A7925A5AAF228F976B459D8B422DC6F9499D4608AAF1FBBD8EF7B6D90994DB 207DC9D65077BF6E0C62CD484D1370457B76B26F710D6ABB2C179138F14CBF44 B80F63C7B91FCF85FBAE57E2B3C7D2E6E5EABD4FDB2017F738B16C32411CCC82 C08328B73F0B4A0D00B9B437FE42D96B63BF05BD60C5A3ECCCDA5DF0DA2E6A2B 7BC0AE9F05BDFC58ED311E51549EC6FB84970B03C698298323620E906E7D8BDC 8863DD13D1AB4E48559E0D7707D9585BB329CBB4BA87CE3EE8CF8CB7C87AAD18 BACFC602BD7595EC6FED69D7D551F8586BD77AF5E2D9CA9EAD3700C566F855BA 0F713D96C37A533A4FFB94BAF4714696E398E37D83F7FDAD0C21096087A1DFCD 3F5E41C3F6587266AB616C9DA4847EB2A22D80EDBA245566FD24D13EF2AA07CB A8DE5C2667456974DD28D364089782C198CD39F3BD9FDC6BA35A01E89826DBEA D35F874A0D20E4C0CB0A300A68DB4B382646C65CAF16C321CD8DA8A99A2988F2 84CBB9276C4E952497F169F0375EA7255DA1DDC7B7408C09B14F319238E58972 56EF93E5F3958D79A405A35EF4A83AE29ED3A08FF1AD9516D05208759809CD32 F4275C7B33DD61BD4D90091C8B8FD078229493E2638EFBD59E1491501F5991FD F34C7C4E40DFDFFD3A1C97B6035835C8D4CD5AF3EB632D83A5AAD74814402113 6D90EF5DA7EE961F3688F576F81D5D3B260CE7F7D1021F4B13A288C5FD47B8D6 CB460028459572BE4141C5B8BF922C3715B13F224F5D24EE3457D3884286C2E9 B17FF34D3B4A5B60FAFCFFD25B9C28EDE6CDEC3684865749876A5F920E891454 9BB728FF14E011BA67948A71BD2867B06F0C1683DD59242EF0AE9A7950702AF7 48A8A85AAB53F0760A944E3998A9A290D5E069220502BB515757BB02B656BF08 297B84BF44DAAEDFAA9C1D61D1E5DB9ADE63720923BF96C86E0BC574516E10B2 C9BB513BA802C790DB0D2448E27E655B7AC91100C6A84CEF86378C8A0D96B28A 64F1C954694E03D2E085E8303E923D9A7391B05C68E4EA240AAEEEF45889F648 89394C9F7005C97D2FE9E4FC30F642AF82A39D9C3C4D408126C3306D38B2EEF8 DBDCAE8A1403DC8DB4AC120CD70FCD2BC664DFE52D76ACBD92D1BA24E033E2D7 8C5E2340D75A599E11FB3B0C511288706E29E467E26CBA5095A95009105422A8 059A321A78539ECE65CAAD81B4CEDDB07AAC32148EC255681668F72E7C93D293 F06A944379498DC6C6CF737DA42602AA12D9F790349DEAD05FE904F4961296BF 5308C2E801C7BFACB433FE45480F866EC8163EF77E743F5EB8C63DA91F57CC1B 5B8B9463A0C985368D4AD19521292E22A25A057EC8FE6FE6D834B8F2A97CE5ED 3A1F6A4F667E7FDA6FDC917689AC08CD7549E023E164B0DF05906B5A66A18E6D 98B4AB058A12183EF0EB64BA4E9989AAE44699F10B4FA5D309D458B3463D9F02 B90846727F7B767257855827027F4E326E3A88035DA3EA3D325582A62ED23028 CA4F300233404E63F53523FF61AFD79675B555B1E3F815C1CDCDA3B53DA183E2 1EBE3F5B187D8321A0A2D5B99A304B78645C1FEB46EB87888679CA10AE235550 0A92876B1DD0A29187F6B5E132D66BC76F02706B405E5C256F4881F4316653A0 919F83FCDDC2CB7BF0F0976A74B55F0A426D482333C04D683D657B9AE1E56930 ACE067B6F67B61351DF297AAD8110618C36F0D235171054C26E701927C6943D4 2719350DFCA9999F31B42E71D5CA148F6A82A776A789E4FBAF707E22B22A7917 EA90606546BBD00EB679D8546F1F2DD7D82A83E910C4A58DF353134259C54217 D8C85BEAE5DF2147BC6706E2F3E7F9A16C01584B949D5DA97617A27763AE2285 91455CF72DCA40EC930CE3EF41E27A9EF991960D17AC0B6AE275E2539E9FA23E D5601668E49F0402A1FEC020E5754DA7DA71248FE0EBA43793492C9F2026D745 0E25A4B7CFF56738FB939DB56ADE180E86180C0A149413CAEA99AA601466DA61 B231506B9DA5D1E86C947F5E891E0915EDBDF677572C22C43574C80126CC9994 689879DA6E3EC798170C743555FC311AD892156B5311DAAF17AB8A887ACE4996 CD3C62D6B969E456DE214061B92F0325212DEB63C8D9AE8979C1E0A9AA3B8DD8 C0D38EC43AF73D74C363949B51844B2221745BE956F0BC4307C6A4AA1D3B9478 C5DB07D9D0983F54FA6E52EDDADED01927565369582360948D8E2FC49EFEB0DD EFC5D21E28D334AA2710C3ABB734381126E86A066F06C6C88D9843ABDAEE2744 42CE48E895F9160CCB9E8252A7382F132CCB9FABA0D56F64D5A301A4FEA845F4 127AB0513DC75326C66FA6D451B49E45BDA5807F4979C97DDC2FB36371A00389 5917714745683AA1C3B9782EC6323D06AB790092354A2ECAE62C6AE7C4177A0E ADAC832CF79541011DCEB8A49AB562875E01DDAF6FB7E10200DDA269A21392F4 6D29432FA4B27AB32FD492BFDECC025475580ABCB7A8A0143D6298AD1D340999 85F32E7918B19C8A849D082AB88BD65692A7DE3E2B70C753F9BF427D1F9015B2 B670129BCDF41B4382A8B1A236E754BAE6243961B292676536CF77FD467F4BEA EAAEA5F1BB517C89A581B102A1BE1656FC87AA2B9C1D4C2E497B41F2DE8443A1 5E2DC355CB690E4D9D6B445224B5CB490E8291BD2C1BAE3F75042350BC1E07BE 9A43F21B44444148715C921A2370B9CA18C2ECA90DDEE7A72121B38BDD5246DE 5EE7EC6020157188A0209D16538AFAFC8AEFCC433A4DDEE97B1A7A87E8F8625E AA858D99AE5E0ECF11C35D7B746F2A8C7107384636B807E6F8A29D18DACDD07C 153EBB37BC12E2F6B422FDF15D2CA7386F38AC761D0DD379687A51B566857F56 B532A90EBA99970A9C876E28D74BE19FD15E167FB19A1471AC7ECC2E11A0D6DD 16AAE71B8DB7DC76C262A39FA0F67CEC3ACAD88F13E2DEDB968CE04DB6A791D9 99EEEFFACAAA7A663CD64D87F8B203F8E1C6C71B1F75E43B81387D90573DB8A5 249E173A4757421323238C9163DF9C703536B0618ACD83473CD065BA73EDE7DD 3615D3444BECBB72CDC9DA6D1ACB666652ED9A0CFED124C5CD4E0EB1EA1B8305 0B3780A7BD91F8D7AF00872A50E3BF105D1A2D5EE5FB2B694726CC34EC6A1E3E E8C653CD1A5A2EFE0713D869949B6122C5DF5F57AAEB5AD44BB3EF8B5D708A4F A001D471152EFA538948240EC786273BE0D6CF6A570E5027CBCEBEAF75FB2F4B A9F78C88908E515A8806D9AB5614538FA737E3F188344EC16DACA5771BDD5AB3 A15CA222B7527970E3A40ED9C2878DDEDA4C4832D85199BCB571E3B3C33D2285 309852724C93E46FE2DF1C74F3AE90D6464BB36FE7B24CAEE87D37F008316766 D919CBD337FC8FF74E241BF16DE30C65407EB69891A942657599470FF6B08C85 036C8ADA3A9062B80F9C42F94BA189AD35F8B7F7B11C71AD11C54DCC04A26EC8 633F520708FDACCFC2C397BC41070F7F952520F3153EFAB04141DC9AEB1E208D 63B45D052A750449E286AD059B04651AEE56065898A9155070CE86DE905F04E6 40375A9CAA5245FB3583430BAD69F9C861CFA32B4B16FA34A37279DE9DB3EF25 DE48A0417EF097227C85D1D1F0CF0362D0CF2E767E66134F2C943D9D3F3FCA54 7CFEB8BAA22C5DBF15D12006684E292E99A4B6AD93AA86AE5733A0503FD4A70E B152D0EAF839D6D2FD53852EE24BF1FC7528F75B4CB4916270C5DE7509076235 109BE5CCF700F8D9147A722F0959C4560ACA2591A57168E04EA7BC74A1CFC498 5489D584F71E1EA8D93C4F30EAB0C625914F2C2962B3BBBBD0A0F01E03EFC0D3 60162B987D1C902AA342FA2B1EF958CE16C27249576B1C14AE3A18B795577B9E A3B280712BF3B5B506F902EEDE93C1FC89DC89FCAE4219D32D2B6CB53C269D00 CBC611A9B8AD6656B8255F21D1057B75265E1B8532FED07AEB16ED73E71EA9CF 3DDD473330760574B8C0825ED29D0F6A869C3ADFA9FB85B8544D8313B6933E83 FDC9DC967CBC4A6714F0317449079864D5A46EC9948C85F3F5259F1969768C79 B8E2DA43CE1A41E9C5258A153EB519890686412080FC284916B16CE6C5295D7C AF9A38B91FD2B9E7560BF7DFEB03DF11CFF76C7CFACAB128CF66FFD2DDE4D504 C8CCAF423E2CCA3E691EB544BA99B4C2CB7AD3DF81F3E26CFD00503879F75801 0DA1B01681BDEAA65A66C5B7BFC826548C24AD0969154508CD6560CF48409F78 8F80F7E41832C7B11A5085B662D6693B7536A9192F66E9069A7135DBCFBAA4FF EB2D140BC2892F6E4CF53A2FE00C7316E26B2EC8BE5EE945C8729F30A0668E33 A209889EFFE29BF206C41C5C358F03542035550CC065B97A1DE21C153CF36F61 ABC1BD80B5BDAB722FA1F26ADB0404A70008A7B90061889D57FEA489603A9D23 6D6A52DC0A5126B89CD6D65BF1D7150272CB5A5C0F7EA04E4DC4323DA05E4A92 9CBEDDF1105F7B9AA16B5D3F89B7B9DE0C04F2A202B086FF687A72596DD27252 7C8ABA15EEDACF85A3325DABC94520E4645C9CFB42B667D8BE3140E95EBCFA50 2EBDF1CF7738EF7C58A18F8D15621C2FDA0E0BD823345F409FD6841AF5CE3CFF 9FA922E6E8254735B2AD5FB6084608C5A827A4DF70A406D941E90E15726529C5 9E7E28D25B01E77B80A9643541BF0957EA5C8A0E2CB363028D01E155BFF6E70E 7C5F53C8432295D564170D4A51863D744ED8785B758AAFC079B681610D2E2EB4 27C4608B7428E84BD6CDCB5C3DB686628AF0FBE1F9DE9FED1C1270CEBE299206 ABBA0EF32BBB968FA149F548473ADFCC60FF3BF453C04C9ACD9F8B7DD4DD219F B435740D1183AAC62E5DE6E285338C56A7DE72D60E209E70D84A5DC7F0BBC837 06A752F86D5A8B2F487736B77B650685C08D1FF45BEC66D4D2D8351A07F90201 24917F94A8A93AD36F66802C5765939B1932B86738F42738C29C1AA443E06438 51AF7D985F39CCD46C26E7DA86A5411DC53E4395398DE3EBC8728355AFF1C4F8 98B8BADB53A454010B90E9903D8051761DE761BA984D3E726AE61F7A52D7D5C5 02E2F986B21DD6F36A84584297D71E30FE820F00C5856E7E1B290A61957B184F D0E637D06009F7C90033DAA8AF57A5578B42341B415C1E25CDCA1C25A7284D71 66F1CA34E95A7CAE5452CABD02AD41264991EEE452DEC552B94D3824EC524F70 28359E7489F1E37889DE27A6D6CAF13BD78BC777317DFBD14624DA00D66546B4 09CF66F7F0DF208A959B7819D8EA7971CB714B2D29A23A73B117D36093D371FA 8483FF2587007832E2B46DA28A7283F7637FED147769A0CE186FA4DBAD0723FD A6FDBD7FE0AED2C101F8461B83F652FF7DD7BD0581D97D406A9C3ACD1A7D58BA 6E3E34677BEDD37690A103794E96D7946BC91FECC6BF995555ACE2A315FDF2D6 F11B3E7B1F036BC1D443C54BD9CAA22334A79AA6BFBBA117D251F3822D6BDE09 2EDCBC75E3D9CC9C627837ACA4B44C0E0A35E0DCFF81A66F1CBB32431EF1241F 607139605058F61B631A979B663A2220EC0DCD732D68CA443789626149CC5D08 AF0A1D8A4E5DDEC60CF5608EDBEBEFF99C0852E51C94D9928885FADDE482A978 9E117ECED05CE9F848E330B10ECF37CABB5EA5064F7023640D5175B1FD01834F 9DAA446A55B8A1419E9F7FC24729ACF51650772238E0FC37851DB971F80822D9 E23BD72ACCDBDB27219E8C47594DB98A2E3E34ED80D0C0BD910BD3CF02DA009B 7C926DF09AEDEE2FA4273DFB95A3726C742CFE1DC8465F799C3BA9E680304A74 A7A1B6C2F8176F7D91F11B9C825B40DCAC79C3B14C2223533E349348232F1DFA A55C5721067F890CFDD1AE42E9A58312D91A4D4D87E305A07AD091BF2D5EC089 B7D6B04A641B07EF3F74162C54B88C6AD6B6C56E12EBCC6AD0F2CCDFCA6458B4 3D487D2A8543B7EA5D9B88C03FDDEE3FACABDB912A45524472BD000CA812A3D1 FB37C1B2D22489D24CDEE01ACBA321E61B16DDFC21E456F370374729794A1D59 D1C331C4988D614FBBC207DE43A12970A6EA1708C770303C294E04319BB2AB31 D31BE5C587D864754B9D1742FD0B0AC36EA82C5810060167685E32F8AF002CE7 2491DC5FACE715CA95DDFBD5EC5881A7AF3855C0F8987CDF2672DF629C2A8781 7F81E69224986FB314B6181F3643232458991417543A5AAEE25E35A144CDC94D 6A0D4E892E66F2633EC481B58DC28F8EE697C07945F36F9070B052C0A8CD9314 44722F594EDB0F3661F1D029550AF11BF7DBB6514D6A08BEA0FFDCF8A9CE855C 0D29679417F2076B114988972E0BBA258FCD390D420D8ECB0AA93996431541EF A3C0073515081D6B79E8513B9B2E60483CFA4D1FF5FCD16449F6260DF820FEC7 8AE311F50650910412752444024C4EFCE4B22B20D507C7006789C52B018E46EB E6FE026EFC417B67EE01CF5C2859DD14C8B1D420FD390D81D82D668F6456FC10 F5633BDE01C401FAED210B508E7F26F634E9E1545312E2F3E5F1E0B379758677 DFBB4B9FDA7881358AC2CEE685A4845839F72057D485A47763B7F42D9E42109D E0A6B06631FAE13FB5F523705495FACF48B2C6977DAE76EFB3687808123023B4 0DF3F0945007962161503FDA82A07AF255FAB5B0D979D76351522E8241F1EB5D 676F3F3787AC31636A186CC7B04353D2F388581E723E176922EFD56852987E7D CE6C9C68BFEE41F6F90A228DB7DF0036EBA4E00931D1A1A19F8B197DB7D290DE 67B6F07FE1FB9C835FC3519BA08922FA39510309EEB07AB537EDCB8FD8020CA3 E607FDC574741FC77D838C41315FFF6EE25D698C5D1AB0080CA43821994A5A76 87A1A4C05E144EED96433B5B0B4089FDBBF9C6BF7F7157DC120A6F27230EE68F DE384C560192844F85930FA2192C22EE73086E32C7AD0C406C549DDF024A8D09 65D316E895280DD9738E80626F430160B27721C98A969026C39853101B946154 468B9E87F1B1DA540D51C2152CE8E83EE878B7591EDAE7200D539863937FEE22 148B15E4D76A034DCB97B36ACA6433D4A43510E7A1B0B6D6585E69C87B8979B9 3DDD5016A03987CF4893152A23E93B493F615C452F976093996A684F2226EF5B AEEE21BF467EAD664532A1C3E989149E9882CF59F5DAF2ED2D930CB2A6972D1A E6B625DF30AF635ED9A5783C017EA310344CE7E43D70E60AB6691E546D33B687 C2C5B0734A2F6D8BB43C841E3C17F3B8FB07EF520ABCF4B34B85E9F6717C455F 2EEDF3F55A4F33167F949B2051A77C6F8B70271D2523705257F03DF774EBF474 D0E7AD6B09C107AE462317A120FFDBF0B26E19A48E05C9B78AC686069295C684 77223B6FEAC59D29670C3224636A0212041A111B18FA775B45C5FDCCDB5011E9 27A26847366136EA7260979BEB5F1F74783C7C16E02A9330A03CFEE0EE625393 7BCA3EFCF36B5F27E5AF9B261C1F7E5FF889304A42562C89A748A8F233758E22 AE626E74DFD577F337DA8B99390216F0CB60C479B9E3E38360C024C5780B62E3 AF8BEE68ABE4B5E5318688D34568D0E3EF4AFA5AA162A45228B30EDF6ADA377C 5720AD8583E953CA6E3C8F895B08AA2A5CE66B09F0B434DD209F868E69833D3A 6EB0D053711E48745CF495F517AE46E7BDB5AD7D3AC9825BF3D26151C4049054 4F7E29184F2EB01280E08D17C1B8B87A6ED61861F7445C226284125367D1AACF C9B9B1C00EF53905B5E0B28CD1BA4EC737EE6290E1D2F4484EE4CF51BE29A352 E2EF6641E817BA676773F318B2793399E43A16076A01340A890DDA03414A927D 43EA11BC4D1D0A08696EC72B537E01E7C3C282A887E6F6BACC427A3A801924BC 0E0E09C27D30A9BD8841FC28DAAB4D2B43A6625C49CDC652414BEAAACB6E1659 234A26E72CAF05ED7A1567A794264882940CBB07A729D6783F6FA2DC2F8D668C 27FC1F8D60CF0105B65391B4C567687E8D0315978E8210D0234BA3707CF410DB 4557083DC0E1C62E3DC9A28402EB0E873502B8F08A524ADDD20A2021255F39C2 767D1468013FF5A0DEAF81FBEC60EEA473BA045C8FA39DF2B6E57DA772AC72A4 02BC8D14BCF6CADE25DDFDAA972E280E24B2826B880D6A47AA0B8B0D63D32364 891BE63CB3945CA9CD4EFCE47C27863CA07E14B092558AA2780A53286DE8A70A 7358D914023FE378D3B8C51B65E37C6399F1F4E7CFBFB8D63C4CCB9A51C98104 312A1310C77228F457F3E78395E5C15F561F98C3BA34A6FC578943CD8FBF05FD E0AF33F502EF4413EBB9129A87B4973103771C59B62B072A13F885328F3AC5B1 1F0D2CA896F6E22EC773F71CCCB1076B5831096D45FB0BADBE0C7407FFDED225 10AE5ADE0322DDBA9F2B82A2FA751D518FAB85AE4F7DC14B4DA856833A3E8B45 DB33FD0C218FB1E2975924DA1D72692650EBDBE2BF6FAA12827EE7B8CF219F0B 0FA8517A6584481F482222B6BBEBFC8C9B3204C0B05BE4EC2DD8B856A5F79F81 9CC99EF71712BF6646358CC9C6A9AC3542D8E6F56E118ABDBB04F32E6661F723 435923AA31F3B1D2F2FB45C1BC044B6C0BBBD4901903B0163E9B311E2000218A 1A53D96BC002D4B0975E5F8BC822F6D2597B4B6D9D223266FBC967DD649A7675 DBA06506D23BDC306ECD031E5F77A734F2E4721E7B00F530A1677566E9A80FAE 659787F01A5F4E015B3C75D6844AEB8B5494B4E513E51CCBCD94919EC834B6CB C059C5B1C3C7611F6A7E46D34371CCCE19EE0EFAA40F597FDE8C9BA86FAC3CAE 7D9818D824235BAD2F1764A349E1A0C725770A687CD0A1732E6952D0AE1FC811 A3723A649CABDF3D0166807A454833D646ADF2F149C9F5FA29FE7F4BB6A4D1F0 3B5FCF799F6D3312A5133C587D2EF8B3ECF343BF716D79E26B7F37E68B2A12F1 C008822F7A5D874D5D23480611277C10C8553E279CA1B318D70E64242A89D8DE E09F3E2BD9A320E8EC73038D0063B8D046BF325BF7C7AB02D1F5192933B7C6E0 E3F7E38E08E615F16F7D2956F24D399E3EFEA79378BDC090671A51806CFBC44F 04EA601C1A200AB535DF6F42CF02213326F2E3A7138D6A065B15A2F6A9E9807A A20D929BAF627D6E6F127FDFB4BB6F51A33757FD8DCEA2E4A6FB32EF19E6E03D E61C54BC6BF92CC133AF30FA68958F218F031FD35A369A3D410F3587F244F1BB CF97BA23323F61BE1893A8152648A719B5BD63ACD46D6AFD18AE1EB42B2093F2 12C473CD4DA1AC31D44427E4350E3FA08C5CDA8665FF6E98D3A914B83D4E5B74 79D0827B36A7A9E74AECCF9F29CFCC49AE051FA4EF4555D9B16D905963A7DAB6 14FC2644250DF4A344B55C7402C7AA36E341889D962337EF370AA99FEDD2330B 1D7D4405EF68872A682AB684C10281AEB8CC2996C8897781B4BCE7E29AEBF1AB FF648F9885C83C7B3375C0F3B70745E44381549A1F3C88A13D1407E15070F138 608F280B341630F4A598777F99D41FD2DC17B867238C2DC2F1CA2FD79B012FFF FBC6943EBF63DED699A4E902DAA9C27DAF2EE4D54C24076230D30F70F9C40153 503B552379F8855D2578B85BEBFBCF5D2766E4EF98EF4E790A79D8AD6723EDE8 FA6FCEA027E3145F581619772BC6CBF036FF2B3BB3F7E3F6EC6F8A4F4B81A922 71736CCBE1A283439B7A6CAB79847EF0A4193AB8BBF264984CEE5B776A657BAC 0FFBFBE8871F37768D960EDAFDAB7B58DA1D8D133765A8BED63389AEC51D490A 5B0424BC8A13C448F7913C2E1FC941BFDAC308A9C375CF5FDD1B5FD726DA410F E7B50E26E33F9DFDEA2E64DCCE5C4FBAC270570D3CC42E21BBF8D3495BC0A336 0ED0055032C52D4722BEB9B201738977AD5C929DF16801CC175D6CFF249F5464 B0ACAE1691389250FDB44B1DE006AB17F7964C3340995AC49083C95B6C62C4FB 4C8518A1115D541CD780A66325D14FDF6DE91610E3F996F19BBC54B7174D1F06 284D39ECA67C521E7EC560E16F240396819000AB4D2FB7C985FC805140C2538A DAC32728A06D19EDFEC90F8BA8752186F91EE44DA1E52EB0B8AC3026EB1F35AC 8D426FC6B8CCE39A468B8959DEFB2F2C54FB7018D09AF19B186A21E815C94E78 9CB2F0A9A863AB7B88F31940EEDCD26248E71205CF0A129F9007793F4031EB15 6570DA7F5B4EDDC0CBA699EEC8AB73FC7A630964B2410588411F72F0075ADE11 5F6B08215F853CEDF885329008FD423E0933715D58152EBEFAA5E75DA3DEC9EF 06ABBBEC61C45E146265539CF7A9B3A545467F5D28DE4EAD3AF23E35E3445FAA 77C78C3150A74E416372B150CD34B1A8DC1C81D8B4AB6EF7D111C73552CB4D27 31FBF52232618E495DB14851336FF5F0C930F84E4B58477EC66AD6AF4745C41F 6786394E4818642A6A5AAFF78F31E55F94440BC7E10FA9B8C5D2E7397234BE3E 522053F0FF03CEC74AA6A246414AC09633E5FA377247D20741AF2EF56E5C0B26 AE7E76ABF1FB4064E5F3737415A9A21F0944AB2FC7A931B6B760162CDD05413E 8B551E7E4D3B5C46490AFB5C74110FEBEC9355186155FC4FC27631FE2EEC4C80 736BECBACEA0D86DF66857003511657BCF1457864A4ABEEC53BC085D6AE96503 7346B6706C05A298F16CFA54D4184BA475121327FD4D20DB73DB48A906B49D29 6C705B8EC088C579FBC6E2EB96C0AD024E800115B0CFE4B91748964659A96332 E2D7B49C2FAEC1CE6A68804EAEB23498928AB92879497F3B19C9B5F78806CE1D 71D1311FFEBC6EF8774CAC0D1FC9E59F30837A5EE259486457FCC5FA83032D43 ABBBF0CED95315B449ED6ED79C87101B12833996604CED80023BBAA7E17CB98D 64D2166E536DD19A8239A14AA6F75F7D33E31E6F2AD7B2E5E8A40AF52A433CC0 CAD89CDE1244854F7D14299B685A32A15E288E98600D6434AE9D51ABB2716577 CB993A33FCA6F1351E0F6D7F187CCE230CDD0E814081F890948B6B5F2F6D1712 D22B3C589A3EF41E24EA201D65CFD58F12B34F695DF69937B2D9040BCED0C0F4 F9BFB73C17E033BECA1721FA0997DB4946E86C7941AD758A7C7BE59C3BAAD4E9 FFD107F7D5EC90174D15FF30EC573C54898659A1716E05DF8F665E0D2DBE73F5 00920FCE50ED6A4543CEC538BE4061245F9658F232A67C6990E0C3F4E16624EE A9845F3DA48A19DB26923DFEAA6EB89AA3F5A90B1749BF86F4ECCDE32F463C67 3EAB0E71D9F361F18EFA7A88B1C12C26B88E6B791F61CE533A463474530D5AE3 CFC1E4825BF7AF2185E3A7CE5C7200D2F7905C7EFD6A1B380F2B4E6C2B660148 F857B32920AD49FD6C53359E188FA4345C0E8B38D631AFE41373782F0CD3134F 4E7D3E0A3522A04C1284542F6D8F972303E6B38868A2C078D4D9DA5ADA5BC9C3 16302C1876D482F16DEDB4DEA5B94A708DB22FA06221B99D587A0A19F0ACC068 096B1B79589C971300A87A517B8B1E41AF836C97830E814191E0D91061AA2D58 9BCECED0EE5C28400FADDD1780EEE30455A4F32AE05333C6B07F1E6D3DDFBE83 F24F56E14001D304A05E6129F9DFFD31F60E6A3F9F73BF67017CAF4DAD0D3671 2FE8CF73ACDEA52C764E0B6B984498AF0306BBCB470862686789B5BD6C3FBE59 2C5732682FA1579B82F42E3EA2AB297E7B682ACAB0C3E219AD0E8C652CD9D7D2 742D2DF2627A2D151F474730BCDFBDDF7AC2919891B0557014A4BDDBEC7A28FD 38D2A4295E94795F3A5CF4DBADFF5BF62E9230E7A9090215789982195242F51D FFB5AC9C45B463FF998AA822EE752890AE26B4B63D16DA29A627E6E897DFC8DD 388B79F18110A6BBC40A15A7B29461530A52E40C20BDFFDFCAD82BF8CFE5B746 82F73B5E171DF97356EFABC70213F64EC4111F90B26C4BFF95B370F2203F6292 3101FD2E377131F2BAD942471E70B6121246470EB8C957B60AE08D6E28689B63 74FF4F0F5C0AACD1AAE2D7F52CB3B29A2120FB6E75045A9B6F60D28E79318A63 D9E1F0453EB5853E5EEB0210013A98B16B4BF08A3055D41BAB2612373A32925E B2C6A82B40A9D22E1CCAD70E8C3C6618B566B6BC1E3278932FE809567025E881 B4678AF1146C89EE1C4A4EFB5FD3228AE24964FABD15B337BAF7A238C82FA558 79FFDFE405D5907CA6C3B3D86F0661D626D5E6C8C7A13883C5E834D98767F284 818C6F3A36D35E31698E7996BCFD63F07BAE732EAA795FE422F2452B97986AAC 0E7EE0EA09785BF8E7F0C6E125BB9399F85088D28312B61256DD7B6CE1D4911C D11E8E7EEE175CE8671BD2905D223E9207E0F406E87BFB420873558DC222C1F4 C125D9F6A9531C3E7700F72F80219D1B4689CC4684A82C40F9E589505614B993 63B1B15194DD888291B16DDF14598C4A51D09E01743AB542D8DBA2BF0A8DD076 88E1924ABDF47CF9F906EC3F638D11337EA844DD51276381821C3530B21D6AEF A7AB07B5B86CAF98DE356B6286BCF3CB691FAD770C242394CD61F3D6972FFD8F 85EBB2AE29F22C17A215927231397C413384F8B28C889E2AC83200C7504C850C FF98B7C24D0233AA1AD3CED288A60E34962DC5139B14117AAA547BD323F7E0DE 62B34D0400B298BB9F81E5F6234881F52AFC972E93633B64AD846151FFB6B097 B9AC550DAF54BAE97E8660FC8BBF68C77D442804A6230C84CFB1D4F955D24157 332BC0A21CE34726B68D7E6F04704413AF810F8C08A364B047C0BC9F251AED0C 60450012DE236A841C353EB7B543FFD540CE32FC5A7339099206EE05DB7E2141 F3042D09F09D3BDF71131FFF47E453A883502D5CD3DCA15ACCD5C27FABEA2AF3 734A704D8BDB74982DFC0734B7542F30EF201B46DFF33A05CC65B8F0E33DDC70 13ED94814F13EC56AA45AF890DC9BECADA7F2386DE2FAA90EEF0E338541000A7 96BD4A367C0DA13966C4D754BCBADC383DFFC442737236789BE2BEB7ADFBB170 4576A1FC1134AED8B2AD1E7FB0B887317DE34228C2FEBD9041CA35FE2587A40B 22E9AF27CCFE32E557D5618966C1FFA4FEA9A494BEBDEF849A138EB6E849A008 3387AF746556DA497A0F92AAF5314A956D2244A32AF30D02B23DC3469FF51138 B8314E2FDBF8ABF72228354771E365832C4253BFE375C2BB9F677372C68BA937 E4BD8186EEDF7F9204B6F0E03D0C3B4FCEABC7DDB9E258A2178C05FC1619F282 AFE2542E25FD586DE1D889D16D74EDDCC45E2240077433076029E94D57954A91 438DE75ADEB420D2B2CC5DD996067B5C870DF055CC8A992DC247CD8DE04C94A4 4E00000CE66095E1C46B230CCA2363B45DFD28C678DDE5A95AFC749B743ABA2F 26D45FCC07BDD1B9CBE19FAC80AD17EF1306A6E362D7A52BC9C52636A532823D 0CB253569E5DFED87EC2C5C3B2AA12C9813C8673B09AC939A5675E88A9DDACF8 47F5CB07FBA5C46D0149AEDB5033DD121EA002DF8BF12D3405DE91F990FBA782 4B8CB09EF63DF013632FEF9EF012DE1C8A96593530EBBB20F952B691E0FDC5DD AAF0D54F52B61B50CA6812CF67F8CBDFC446BF74DC285777CCF5C3BFBDA4BF72 71427F4EC09900DCF3328A3D27C5483E51E7CE1C3986A50F7E6C9EB2F48375D2 DCE4F4989810B5AFFF6B8860A5A70F9F41979360B0D9588395488B2F7BD81514 480633B4DB840C5B0725E91EA94C06FBB2E5E0954F7B1F25FEE20EFAB5DE30C2 C7B6F4A7ACC27F273FA88036A559A5BCB5C2B6BB4AB6AA37783F622545406C12 F4BA3E807EE6635DEBE5D4E22E64684CA40938D3E95AB500AE1662B9BBAAA76F 3F1448663CB202561EAF1BCC8940D475E0F27BE5267D0DA5A8C08659011BA66E 2DB1421A813EB81B08EF8818E50937723CDC4B7D36A9E977215E7AD26ACD5B4B A0F143B8EAD373BC9F91380D54D29581E33C083C90C361DE8600DD1AC0177C9E 7CD271E3B91A7ECDAE0E5C16DF983B77BCCC9B8EC0E91E029939C1FF7498713A 5612CDE76FCAA629A7DE101647558572B5A8797D3DF2179570FEB1BB44971F23 B60B68C369B11B1AFC681CF064473F43E6295881A5A2660DC0611FF6969C624E BF4B966BB1EAED446DEFEC0B6548F4B9F7ACD46DDCCBDBA7CBEA031CC826D5BB CDEBC02A6E9A6057A20A9451239038172DC2A68007A24FB26E2D12069A513641 5FB0E691B9A312C1EA2BD21EA173E65499740377A3EC4136D77F356D290159C1 0C2575B8B965AFEA8AC4084E6F43AB141B65537C69CF9ECA56B93421286CF536 4F8ABA4E705053C71BC9962603F30B292F094737AD8088AB2BEEF9E759BC8342 579FAC30BB3B4BFCBAC1351D40CD70FE644F3D812183387984FFF134E6551600 BCDC409051140986A8CAE572834F9C9B3FBD06C188FA680359CED9FE4CF22AA4 51C4F6BFAD61B0C73C83D2E2D9DCE476B6CDC9C75B5671C075DD53A5A8E7FCBC 7E3A4F7E26414897FE90DC8E0C55E77C18BFBA85CB162A20E8236D52B3490B6C 13364CE8E12F151B1C07E11E735D0B6DA31319473A68B72BBF7BDDE4E46F113E 06E70610E68D0DF00DC79506F5E673E36FE77E40BE8EFA2D34CA81593E93F989 5860D39E692948767F81D1731AD965EA2D08CF118382A92B9316226FB5538C44 17A8C3B173CBA37B987EF0B29DCDA0E4F32199BF3249F7DF19757FDA24536BBC 564BF3B78114C67A157B09C6394D497A372EA5400DD215C4961B4BF5276C1D12 EEC34A9E3008381B8F605592EFA9EED97A88E41B81D378DF6838FB4BA76BE865 4DEFD950EC703A23B7AAF7BC50EF21935EE1A22D195DF85992A222E5431AD04E E9B5862538439583D3DD6553F385C18DC917D046F70AB12102F88C9BCFB8511E 0C39400D081CB8AE33E9C8D19316B69B92AB2A7F1B588D31E16C18DD6D7CFEEE 1CE0B745D28D33BACD0F4D746442E45CA3D2016905F4B45048B1AD91F121F47F 4902552BAA713F4465FB7CA1E0C5D77C0101871CD6D01A58C9E3831CC02A36E8 551920D4F90C55B06A1F07C104DDA1EB755A90609B549BB811E0344247397638 9BA052FAA040913EA2F8AAFFE313E6446185DF94B145FA8BCB65E23311CB7C49 133D8053F9E71B98B488D92EBB68440DBDC2E93017E18986D38C63B5FA5FC490 1844C1D3E4CE540D91BC2DDD3909B3DA2A814D14DC1361604E3B429FF53A3F62 8DE6E26555697C2258D603099EF2E1E75EC744BDCBD2C15A254D331168B57346 81439BFE78C488BCBDCADA7C56B1482B4D229E44C13950657A7C4B5298C70E06 29A1FA61289852883C4257C49EABB0F2470E01BE80FFA9A0E54788ED97FDD321 BA1BA9D0A04C28F5DF10251FFB3EFCD7096651D3C8A64C5F41EAF1DBC5A46A37 B4BDA4A8DD9426F105063B95E51AED9017F730E2239A3D41869FF4E4F36D4B25 362F196959DE5A229C40872AE7B31003A9E713C87BFA0C37EDF57F6FCBDBB465 6E72017755D26EF1B9A40B5F06C6EFE387FDD13F9B787529E4425E4D3C9AB983 1585E33D2906EC0ADB9E2745A195E1B083BD650D95D3464EA3E8F5C6A98972CD E790BC527B886842418E07B8E80282D91F53DFA77C8294B5E0DB5D1759DF2F5B 78A437A742D2446E977FDD6CD3D19360991161D5E1B81452D9FB07CB9AA8ABF6 AC3A3B293CD9FA47C4EF19A58513FE5320D0C72DF2F88B803F5BB3A01CEB1F60 9A4888F9FF2F585A37472E5BA2987DD380D36C2EBDC4097FFB4B3F444EB20573 E8A91128533878A692D6C4D42AF65D895A22D3A672051BBF034AA19FB0A018A1 D5AB85DEB10D66DF0A54F4564F393479FE7CF3C62AB1397486B2BA910915ACD8 4DAC32DCC3B35E15C0A1BC231ACAA2C19F0C8F89085710B22E2741731D6A95A5 573F9D57576DB1E55E4FDA7E1DB3FEEB3B4E29B142789D426CC4ECBF6F9B51BD C5EC39B9AE0C1FF7FF135CAEAA257533B411AEDDF2BD3F8AFD1832AC295BB1D4 EC7EE0CC367D7996B9281E3BDAC2E0EE319A9B4BDAC3B813B267A65FF95D7E66 2B92E702B96FE8BAE06F0E6E2D82DED7D6D24955DE4E45C9E32B39D8F5A9881D AD25B03A423B46A4CFA3B00A72F0AEB6B2234717E8D9F5DA9C1467061F7120FF 5B88D9DD3E855D875990599FBB65B3119B1722005A074E7FEF3707D9C6491770 5E733033E7C9C7452488448F4FCA65465858DB121808210F9723F96AB0A7E8E6 4891404A86B2085676EADB90FCF656877F135CAE377DABC217344FE7F678A1D5 41C887C3743FC30EC9F588E656165C5B088FEF92482AE1F909BDAC9BCD077B2F 8EDF81C2FAC11B23E7ED2D2D8BB2DC28C365902252DFEB023F174966F9A07345 C55BFF02F618C51C28D9CE34C7FDC6C7B04FE221CB3F8D8AE3E2FE9B9C6A4325 3A78ECF3BBCEF8670B0BB83614B7351715FD37D7FE7F1C8FF5CA4C9303D0A844 039FE8D2EF514E3495D1042B7492E899E741EC08205A3C5C674D123400FE2A7D 63A39F60AFE3A8A78B880EC014213DCD07F842B7DCD4B9F694C5E185E72A1A14 F422B46C45B34E6DCE566F0CC977235793D259394762C5CDB4ECE18099CDE8F9 93447678148E4BE93F8244978164069617F1D3C9FE99A7AD61ACB4F39014190C 9D9CB4AB23498B0FCC203E2FB23BFB90B5FA9B4E3BCDCB97A43A22DFDA6B5D28 42B8C7489159857951AC19811368A22DC9843079FEE3A693897EAB6AEE18FB49 C15EBF06752EE5681BCE110063528FC48663F5F48B5800A210FE5A912B54F694 072F4714567D30C918275A952DA8C54E63EBD34DDA407E53B68C30F1E14B4D30 DEC4EC1B320F91D8547CD8C9C93F65A91F344AE1CC98F3017775D3D1BD8A3B12 8711A6396099EF8BCADC1D680CE86C81540C49A64FB6D0A09EF299FF90B582B1 7751AB5F9D5F7E68FB07699CE818A3F7E7F8EF1A9805AF1A1107168EA3DA567A 3D46914C249537C1AFC696282D950493642AC65A3A47EEB547D84E784EF7605B 82852DF9FD983CD8821B3CD417A744BD6699271D8F9854B342B5B93DA33DB035 50A145F36F5F5C2F25A54FE58749634B8080F7EA65E8B493D0669CA3151A2961 3F2952DE8D7D23ADA70D126230E6072CE9C655BF65A148B85D54D14E757375B9 671CB0E3DBD1BFF66EB4B2C42D8996EB414C55608211947376BE859C1F33A410 2ACE69D2DD86EB061062CEAFB2FF9577415028114C82534FF90B9658F7615D3A 11B74ED400BAFB4A522C5D7438764E5107B8EE9FD49928B3E55AF6FD35EE245D 08622692C4E78046F5224CD13BE7B6C9D5D789748F7206E4B3A877F6558C1C33 3B380EC862F4CBF2E33AA61B1C067D697113693C524D3AA15A8F267D65CAE646 EB8A7106DCC6543540B1233294D9BE144F03E29CCFC41A52CA2BD14F63B24AB2 93D3803660748896DCEEA8FAC3AC63BE3264CC5A8CB0BCBEA0BE229E49B5D231 FE5E8166B5580FD57035660135EC10AC4AC6F2A6FEBFA0675F09989043E07707 A51A2BE9EE086DB7D01FDCC2F78EC93BDDF5022018EC18838010887291E504E2 2B1D62EE552C85E71664219A466701E55425C4B14B135E6B67B0D9AE69CFCC6B 6B7744E3AA09EA08B064202084603747B37F57441B9730903DA7CFB22832CD0D E0619886E840BAA543782794D1A5CB5F92C6F1F0C6532F386A7D354AFACF9662 6B7F3362651F6A18F98F2CA721C3C07E65FC4A1A53A54A5B614A8B6A987EA3F1 142DF6F606005E9AD378B188279AFCC5BD05480045E6632A22C7260F64ACD03E 34DBA66422046C1A1B991FBAC470D7863F530767EBDFD87A445C934321DD6154 C954973E1A6FB21B7D736A876DAD4C117F5A89FF9B491BE87D34D6B4A2B6A021 C5DF9906BDECB494FC3815142969F19B96C7F3871D2AC0A042A407778D42C9BC F5242499D3203839890DFAC8CDCAC244D67A70106976F9B6FCC01A118EED901A CBB2954F66A902001BFB5FD110C0F3D1DA85D46F3C5445E10E794001EF344DAD C016265DABEF706671B27A5634E58F54402D1D6B7ECAA233E36E3B29E60626CD 42E0FB9750AA649B04641CACDA1F31CD5733E94D9A22BF50EB19134655916A25 230CA53E3609B78F2C16AB6278851D28775597F5C0C66286FA57A53A904AF4BC EE12AE259132A3E49EBDC270B1FD711032A9FC502A2B1F79BA5070A95449A08D 09ACCBE03C339CDBD777C7212E773029C8F663A6F4EBA06B24170C99087B683B B7F12D5EEC8F4A6F85C4C1FD91760F084543CF25A652BFCB976F7BF15AB5CF80 617E93F7EF9946CE477CD06B1C0D5EB9963DE29C3BA73793A9E75BE1A5054F75 C2C500B23FAC78994A0C7E751FA02514B05621A8943D92A0BC94D91A50B6E416 8023DEFD7F7318B96B935ADF13ADD8704EB1B3C27AC75D34A0AC2FE4E681542A E413E27A03FB50138FE5CF12A0C825472E48213308179F6D14EB312FB18E3D12 C14B580D8FE7608EA2633AB1E2847BDFCD369A7116C1C6DE142E4947F5A2FF70 1E9A49C5275E66B1BFB4FE0693E3C909DCD45AF79B49BABF0B61837B97C49444 DE4A77B07B1B709F4155481142B838229CAC559E1834E0BE0814AA791D7D6F1C 8A1608A983688F902BEA614FB08E5FAD8DDC8C15B436894581E1743380BC54A2 E4254ED0740471CCAD3A20017FD5B79C3ACF7DBF36BD74EE13EB7F2928753450 EB2F48D0578826BCB380909A61EA9247EAE861E8F853289EFFC28EA645921BE8 FE3E414A73A41DA07B1E1FA407C1C1ADF2D11FFB467D3D63D6D7E2B556BB4DD1 B0EFDA50ADC9B4816570BD19FB4739458F738A8F6271C47AE550648230C0261F 557391372983474D9D6512080CEFCE3E410D457A0676707EA0B6A77C8A08E5C2 1BFEC3239F873ECB053A9A62E93B3E642C110ED013F0DF380AFC528EC16AC731 C95C8DB7B6AC4B66724C8631F55A63EF4EBE2CA0BFCC263B01B64428A3A6B930 9FD26D4B07135305BECA52809373247D2A08469050A13B0C3A0B1A0087720E03 28AD2AF77C8D0ECA9C5A1F80D025B7A765398F25D579AEFAFEB95C23F8BFDD51 EA06B00A5571F57485445D9492F1A1C7B31A5A7DB1336CD60C9E64B3971B6FF0 11423423792FE964C9F5BC0A3134019D286146D5D3E947903F4AAF40BEC1A6C1 2E374075DAF3964C5DB10F32751B24E6E2D583581A700187C0037C898023478B 31F332553B4DAC247E727F9122AEC8F7CDF013AE97E8D0C7E92E80C94DD920D1 D307B42EBA50BF43F765C725ADD7B0D3D18E48453F623CC5E7CE6DEC8D6DC30F 5636397BD0529DD4DF696B870850C3E14840A44F15FFEB36F6C08B3E2E65F479 EAF572D4BB4AB35D774208DECF403F9CD76B3A2E91572FA2DC14EB7BA026AFD0 7626C71C52AFED279916767BB2230B17C8DAD1174E2592CF7018FD37CDFC7952 9E9F5C50996CFD56AE83337C214C03B7DE21A11B6BCE3BEAE6ACEED09DA748C8 5E6A36CE9487EC263EEE2C3FCBEC55B643142891D730738057B4E4FD13C6CD53 F66C43F5A7197281B7CF4A8E5DD47C3240B0D4A30AAD293002F32C659CE6EB33 92899B3F08DFD649BDAE7652D82FE023CE69E545668808B73BD5642188EF9511 942BD12F23B4585DBA2608621E4A70C3B9776A05786B30A695BF153DC3F11ADF A8AD765B5262A284E473E3BB7931007A73FBB27E797FECB251C07A0CBFC3F667 C383ED814F19C6ED7AC001A80E484FC2BE7A6D0748BB7CD500D31DB260654586 904A7373A7B0E44389DEFFA42B47871CBE926D65735A92484488A7A6AD5A25AA 19A1787BFD0A8E68C75D7B61683E7F87DDA08DDD5C58038509C44B00EF3FE956 1BDDBE618CC7DD6620680A6CD9F267ECDA9B990E62D4137CE23C9C27B377B66B 38A631C8CFF9794B179AFEA684CDF06541602A2BA24CEFD46936611C0D423BE9 F20ABDAF438A998565810E7906185E8C8A1B141E00E2FD9242AE85FCEA64CB42 56F6CAE446B80E363BFE9CCE952C42E7CB154D182D36C6520FF5F32E5F62942D 2B98882CE5F9D29623429D33AAFD501E5674842BD7C27D05F1BE05A2B7FD7C7E 9C3CCF04FAEB8800C6451654DA5C4CA4604C9FDCF4A1E3623003D44F8C91DA1D 3DE17EAF4F23C320DA51595CB73AC6DB83C3B9D7966553FD27C43728CF3ABF34 EAB5DF30F534F778925D96CC29FF315682C7853EF2AB5E5FE06263183DFCE7F6 9FF83714DAF6A27BDF06EBD068F8E9C99046D9C13E71914C01A35EBF29F900FF 71087FA7549F9773E6C720324860EDCB1CA8D3C83E81B521D42A95EC348F4509 00EFD89460C35D4F1C5C7B96C4A0191EEBFD32B982949C0356D92A52408CA3F8 4A8666A0F820C5BB1CE0634CA386ED8227206F8F6E434FD3B9CC1A503C09BE25 DC3A020D70BCBA4346B6E3AA1B9CA380FFC73849A2C9D3076A1E16D44F5D2C61 C743FDA7A54B26F39F6607D75568AF7A4A33E579E74BD0CD635330A79DD7D261 8AF327973104A0600440C1837A98D36BFE05E603DC5FA3B6BF46E077DBBC7AF4 3FFB90A6169F3986F9C9D8DCF9A5B5004FC9AB725721BFCCCBDE637F9F0FD055 B6ABE8CCD1FB4D8DA2E83124215C84CFA1C0BD6DFA0AD8E98579A97AAB09C261 A99726F14FB5252DD65F874C4D46FA675EA22307833295AAA6B02D59EBE20ED0 A8E9201B3FB75D74AF32D0BAA88F520EACAE76DD0406042546A08B6C76A4FE2B A8FCF85AA9B5D5ABE7147F4BE2CC69F15C99F5E0F74BA361D1799E818BFE93EB 668A7F4D434EA9162DAAC2A1FD549EDF7AB58417F04C8BA988B83569D9DB7829 00493175B2835D1A21940643B2CA84EDC803AD8C129C7502E9C1691CB3054D96 CFE4AE4D341C563B2F1ABEA50522553AAAC2D4FF14D0565BC5CAD8BB6F7FEB24 BFCC7274B2D9A74F21EF1F7E1F918ED9AA4D4DE3371F130C3841D41BB68F93DB B80643D715F329254DB2E5CEEA890FD7D4776A5D7F269382D300A4364ABEF9F1 6C878F0D64AA312D37E1EF29EC1C7F2482D9E279E51D3912261564459BEE92ED DDBF2522AA13F46D92F75DE8C9D07F1DC43E45F5314F648AAFD09897083C352B 590B33BF4573B505CEC728088C559204DD4F85131C32CFB9884F54F03C221F13 11682070D5F259BA7347E7FC381E7C8852F1E45C88690B1762010023AC60B5CA 67293BE72D397D2313C96E60B42751E2B04EC2316BD9192B45A68563EB315D48 04287FB247E2EA977CD31FC12F9522B560F10D015C7F1093DF2AA027BFA69CEE 365988BB06F4B3C72BD34FCAB5DC45D8832B9C45212C3764CEC46320B92C66F9 21779CBE68EDF9CE6589DCD8A4308E35E7AF3345DBCDD8131E471271ADBFDA99 C01EE990DF5A8A320B81F020CD8C7B6DAEE14A271F57E825EEE92FB9DDEA9A09 9A1A96A0AB210FFE6617ED0227EE2FB7D4F2E64839D5BB037A60F1341948EAA7 5238BFD356117A446EB742E517C1A48DA94ED52DF67B724D6BD8CAFBCFE0D6E2 AEC5CD56D6BAA83EA1004FD07AF97A93E55BD85FD8458AC0F8759089FB30C57D 159E9DB5742E043A49C5F3F3D67A0521D7CA22943BD615C018A37B3BA5872830 4A8955D0355971ECE595321082D5D48A9D07572B7099F0796BBCBD09BCDBAC1D DB1AFBD1F8A884E9311C838122902D266D804C8949AAE6EE56EAA88682E31EF2 BD4A00B922A69EA33FE124D61A7C86BB5CEF0BB877136226B84CE66D802AEA0B AEA7C9E520863208E58F9ECEEECC2541694DC1305AF54ACE1D 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark {restore}if %%EndFont %%BeginFont: CMR12 %!PS-AdobeFont-1.0: CMR12 003.002 %%Title: CMR12 %Version: 003.002 %%CreationDate: Mon Jul 13 16:17:00 2009 %%Creator: David M. Jones %Copyright: Copyright (c) 1997, 2009 American Mathematical Society %Copyright: (), with Reserved Font Name CMR12. % This Font Software is licensed under the SIL Open Font License, Version 1.1. % This license is in the accompanying file OFL.txt, and is also % available with a FAQ at: http://scripts.sil.org/OFL. %%EndComments FontDirectory/CMR12 known{/CMR12 findfont dup/UniqueID known{dup /UniqueID get 5000794 eq exch/FontType get 1 eq and}{pop false}ifelse {save true}{false}ifelse}{false}ifelse 11 dict begin /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0 ]readonly def /FontName /CMR12 def /FontBBox {-34 -251 988 750 }readonly def /UniqueID 5000794 def /PaintType 0 def /FontInfo 9 dict dup begin /version (003.002) readonly def /Notice (Copyright \050c\051 1997, 2009 American Mathematical Society \050\051, with Reserved Font Name CMR12.) readonly def /FullName (CMR12) readonly def /FamilyName (Computer Modern) readonly def /Weight (Medium) readonly def /ItalicAngle 0 def /isFixedPitch false def /UnderlinePosition -100 def /UnderlineThickness 50 def end readonly def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 46 /period put dup 48 /zero put dup 49 /one put dup 50 /two put dup 51 /three put dup 52 /four put dup 57 /nine put dup 77 /M put dup 86 /V put dup 97 /a put dup 101 /e put dup 105 /i put dup 110 /n put dup 111 /o put dup 114 /r put dup 115 /s put dup 121 /y put readonly def currentdict end currentfile eexec D9D66F633B846AB284BCF8B0411B772DE5CE3DD325E55798292D7BD972BD75FA 0E079529AF9C82DF72F64195C9C210DCE34528F540DA1FFD7BEBB9B40787BA93 51BBFB7CFC5F9152D1E5BB0AD8D016C6CFA4EB41B3C51D091C2D5440E67CFD71 7C56816B03B901BF4A25A07175380E50A213F877C44778B3C5AADBCC86D6E551 E6AF364B0BFCAAD22D8D558C5C81A7D425A1629DD5182206742D1D082A12F078 0FD4F5F6D3129FCFFF1F4A912B0A7DEC8D33A57B5AE0328EF9D57ADDAC543273 C01924195A181D03F5054A93B71E5065F8D92FE23794D2DB9C535A5E57376651 F6823308463DC4E0339C78699AC82C769542FD3B410E236AF8AF68CF124D9224 FD6EE92A38075CAAF82447C7AF41EF96F3ADF62F76FB425BEDE4C4124E7B1E0B 8BF254D91912D3A99557F5427907A56514C5A3EB961B94112077FE9417B70DA0 B2E1C1FA3E1D6F01D11F640CF848E45BE3E205258E64FE36AFBD4DF4E93F6B1A 966C8E7FBE2CC8FF43C1F67BF6C361678B5E90F4BA524FE8A4CAD6AB28183E6E CA6C9636E884845105595A2E40CDBE8D4807A81AF4DB77B31873FEB221BCADD4 2C4669459704CB58A7BC230FC59F867EEADE660E49AEEDEEB042BA9A7DD8193E 56C3A36A1F639F7EA512EE4BC6992F52C2FC82A890EFDA730105B0AF7B819295 EE00B48F64C2B5BCB275B1DD62F289CDAD4AD9B7EF057684642FA6FA6322C277 E779CAC36D78F7779CB6DE12638B3C65B70C6B5F8A8C6421A379719B8DD44973 5F52856A4A29B2ED37F2B1FBE6EF4B79B7C0CD6395C756A00FACD763C235914F 847D1D99831023CE1FD89EFEC83AA7E313131C0C197248605EF5BA773D0A4000 72F607551A8EA6F0FF19441ACA179177D1FF7B423FEBDF58B0C19CAE3C10EEF6 3538D8FC4762B77C5AA023A8186C40D0365A4487DC3564265B3DF908572DEAA2 57E29EC669DD72974F806EFF5ECAFA9ADF1F9D2A63087FB7BBD100F0F81C6FFB B1EA1C9DD46548AEDD147EE64B1B4894972DAE1DC3E8569D6A3CEF9F9E46DEB7 547E10BB2959D374A33E47C58F1B20419920AB485F166062FCCC08EB5CC9AC88 F388F0C0155027B727729488E44CCABB7064A1432E179189C4627453C5231535 47D1F2B8BA43069696830CBB6E5F9A135CF22D3D1FE490A3A63C088EA32FF444 24A2427BBA63033DFE2E06DF8CE67949B6AB02F26335A376B57376814D2A7DE7 64A4347577EBE9A6E33DD2FC214A09C6D889C8FFBF1D567032548851B8F97204 49E215CC7D222F593E1EF1439ED60AD922D41E0E9EFB5CA48F2FEFF75AC5FEE7 FB6676D8B8D4DB6885FBE8B61B586313E4DAFB09D94CEDC0507E93000104F3DD F83865A2C6F6A7DA8562BF86F5DB233CC9B53391273A1462E40876A8AC2B098A DBADD5A160DEAC061F86A5FCCAB495EF8A9D121AF07928EAFD56F618E4EAEA97 CF89A3AFD406FC9DE1E9769C1E1EB83BB883786BC075EB5DA2692CD59C4DD7C1 7FD2FF9B18AC740A390C1DB38670DEB18C67721A1DCD502FE7368F47DB4281D5 459B3F020595FA3B10544AAE9EF786A0645FB7C9BB29D091E1432CD878A05918 1665643005BFD9A4B0FFD347ADC84CE22D6F9AD4EDC05E8C7179DCB360AB57D1 6ABCD200A4B4AD56825DC345984D9A3DE11CDA5E9EC1E5006EE4181E4EFE0846 67D8C27BEE8F84A1E01947E945BBE988702DEB2240C4BED952E433E5305484E5 71965D3DE95C4115FF78CE9EC18E323C599727C8B93CDFBCD1CCA780DB8C81ED C4B5E596E1603624308972FFAE9A57B0EDB51FDDB6E23EDE2946F61BEB241345 2A192D8CAD53E823D687F9C64A70A4B4B703291FA6317C051DC6A44BCCE0288E 3839D726A8F2E39BFF429865E95C726E808E02CD06F36C1CC9AC77999F8E28BF CE9D74B699CA982479E9D0DD98EAB24D29C981EF0349721D6819549A39413801 F80182D567EE316E2F0AB208068E15693E4C399A381BF9BBA625E597E6E109B8 16F3A84C8EC92F2ADE288821092A421A8D3B907048FE947230810F0777EE2542 29A3485223FEA079B359034F70464DAD2F0E420271A4E0CCF57A0ABBC20AB327 0CA71B292126D395E0D083B19BEC6B48A9DE2BF470C3D01A8C3F52075BD4BE02 A0C518355814478202FD4762EC542F8E7B9B1F7824F0554660CEB83E35635E1E DF0D03C94C903ECB36B4948ED98B6324E0094EB1DF70863142D4ED3A932D7346 39D69F8F044B6084482D7748C27328AFD24A3A70B99D1F7D32CB984488672254 28B6A9E9DCA2C9FF6A1B311D72413404B3CE5428BDB7FF3C36357D7975184F56 FA6B32AD54C37D0AF7576663AB1397B80D4E998F0B4C4F6D90B483029EF2EDA9 D4C4204C1546EFF3100629453EAE01918D09FE104E626ABA38646F17B6A94CE8 116BC7A8D9C319434CA5B830859B4164DFADF1D7C3ECA5C78D8DEA930EA4AC3F 59DBBF3148C91A2E807FB934E3439D4F67C6DBBA9972854E6E3688E1E0A34B74 482217CFE031CD7B5DFEF727C3EF8DAEEEDA08F4C90289E62FB2AF2357EB2E45 4BC547980FD479101FFEEE477AAC6268DD659E8DD9E244676FD3C6909713B71A 323B211E571BE711D103FA23B5B9AF077D84E2D20FEE805E81D20C03501F0F17 C3B081946CD0FD577F00E50B76CC37CFA97A61B89C25DD43911B28857284BEBB 5BEC61FFE3A14C64BC5425A7A82326617F6F1FA4FEAE56071C9F559F91568179 46369B394A5CE96FB7420FF8AB7C61CB83492FA5AE4A4B0799578594C9EA67E1 E54498AA5CD6ABA34AD3417F04F5D8D664A7EB39D41E2D17643CAEBBCCD9C38C C5C9541641A09335EFBCE0D276A54253EFD68141807A66F1DFEB4BEA5889FFA3 4D20BD52012206A9F8D3E0F6AFC03FDBBDF3E51506EC6336E249CEFB571AB84C BDF8E471E3795C04E38A5306BA6D450D72E50910D1AC385BB06CCD4B8E433A32 5A4B7FACC976BB31FCAA1E62DB2C4FE06DDDE7367930E336B49F47DAD91C8735 9A35D80CA2E117E86B52E41E9278046ED923454989E48610ACB3B1663F197117 52659A9D7BFA561C7ACE0771794FC778675F83C5EDCB132AF124C7E6540A140B E0A268836C73A3C746DC964E482E63C56C0D396515283970FBFF182F9F684FE2 655FD8F5D057D22246DDC3FD11B77552DB4D90ADBAB77BBB1FB1592129DE0AEC F822D7D36E52BCDABBD560B403A5C56C5E1BE789C3AC049318C7FAC5E5861E42 FD66C3C0F46361078D7E036281682BCE9BBF77983C93ECBBEBA9B359769CA442 87FCA1B98F4EEC4935CC93B08AAADDF355C99816453587310F08C50B9BA3D107 5388A1F3AED2AE32BEFADF0285DA90436D1D7EA85D7B9B6DF2AC4B778CFADFF6 6EEE54D1A1C5DEE3CCA7EFF57A7C2931933CEED90CA26DAAB45E4388EC4DC366 B9E88518D6CF094861D2A59282044CC06E63EFB390A6DF4BA5EAC7CE39E1EE03 3D84099F5BE96612789AF3EDED07266EF10A0FC23EA1EA97040B6BAA63138B1A A9CB8F5DED781260962D7618EDB200C3ED976033E8967A8CC676E9C11F74BE34 343A7ECE7EE97E8F76F7E95517A6D6163527406EF5A669535CB2BF4031F29046 BB2D0FFFB47A576F5EAB1D00A582965C56F28C00B3BB7BE2CC8D8391F789070D 775EB775437F0CD53DA840BB3575104B63E4B0BF14E3F14B320EDEF65FD4CAF5 8596DA491BBCF3153DED3B718F833D106432DF8DB8B8E6B34D5308C9010A5DD0 7E0E53260BB84BAB3EA748E8D72F75901604F80F4416920D69B4B983DCDB72C5 E9928F01A4A85954FD74578AE336C782CDF81D1EB7EBCEBFBAE7ED8AB4862584 397928F502D65139CCD582CF0723C5262EE54B9D2B8C39614652A8A90E1C3B65 7D26B99DA298FE4B9A7E98848F619C9BB4FF9FD215B72F99506F06355B332689 37D80AFD9F9ACD8172CDC51FCD3A759ACA0F7D4EBB07840840EE42C2D5B8B257 2C6DB3A7657B75F2F0B9730A20112745703E2D0FE709436CA6A5F36F59E64D9E 37C0A23D6D289E1AC1DA273872F5FC5C3DA2B127F078A4D7AB3FD7E124455817 DDC796D54EF26A1FBFD539D3A21B86DD4477DA49213259ABB3FF241424F2BE5F 89151E02FF87E0BEE26E85C0E518D8BE7CC9214B8E9A9EA1DBB49C6C212CCF08 90C0F23E9858947EE344062EBD9C574979087439975EAD4E85CD7BFAD3C91CF1 EFF577843AF1427D06CB2F3BB519ED1591974218C43F0D2038665F9E2E3960B7 FE68CD3CB2DB6B36C7997C6B21EC11CF1DE049541001FFF26D14C255E3AE862C 5A5701292FD2FB3D04523D6E2F3547923BB117718DFB6E6520F0D0B5450C695B 8C9242CC8671B7284CB2E1E9EB097A3DB1B4D5E8EEB93B4DC7E38C0A10474665 54DDCBAF079B92EA494F6FA75A84C5AAFE280284D0823D7C22249A21044BB0E6 4062074ECD17B62E03EDF4945A294BFEFB51F5FD870D9D7230FC91B83C1D85A8 86CDDF326FC90E04362145D6E8630C50594484FB829DA18F5C078F2EE67D2F2B 08DFF39AE2E8C9741FA989AE494C7166F122D2C5F71B97C973B7CE8500E9F87E D59C30F2E99CC4D34713DAB680598F41955FBDC26A14CF1E73D6BD6B9AAC8D3B B998F2D0D647356CD236DEAD6561389ED3A6746221B0CF15D6648412B35A6B54 6A0EF5BBB34AA376D9BAF025BFC650C1B74333CE85413D0EBB2F4D082A26A5BC 3C0A25D2B12CB159F140E00E262F1CFECCB2C802FF94CD34DA0CE9B4B3830FB1 DA85B9B670D5169928990A2E9CC869891CA2FFAD9774E6B92549644DAA5FE00C A5BE4F5FF91A0B6D2FD8F96121D766391EC4ED3E73DADD476B7DAE1A50AFCD98 DB7E27E44D30416088D9BC07D4661D9ECEC0806830ABF14CE55AA3CA2DF66E8E 748B8ED46466F1EEB072AC0674FE6FED231E0DDA59ED7C42BC05EF00E176050A C4834D893DE42474EA20DB1E25059E84BD137EF65A02CC295B0FFDE4CDE95879 0FE88BDF2519ABAE7F8CC3E6386ED35E04A14F1E3861922645E3A3F43B48A5AA 1999A5EFE192515FCC625C829FF5A7B337AA422F5E920545F9BB269C869A821D 6C4C26DD2AE746EF0F0B4C1E7E9871ADB5270E1CA9BE28225F7A0370D4C52422 E25263EE101C4EC1C7811B05AD42F364844A56BB91EE72FC8ED53CC6954D2BD6 F945D739BE4C61E36143CE890FC0CBF2F610018D678ECF7CEAB18FF5A0E48F76 FDE2463D40A99380D679B3B76D39C664F4992D23E5988B0D1AF33DFB04894016 E852EFD1EFFE586153C0F31ADBDBDE3F73FB49C5EE64D0D02E1504248FAFAC3D 903FD44679BB09C30288139B41B1E90A10139CA3172677250B16535A1F3E5E4B 6F4264DE58896E66051FC677030A121C5A285C47B6129CB5A3998830CE070D21 2F093FC1B44089F603A21F45F60960F134A47226874C737EF6C085634B0A4A66 139420501351F737A73F39D960EC38420BE46E5B09D298E7C16B8E32F01507D4 0141FC52DA1DE718D634AD9C8B00E46EEEF84356759324D2B9A3473C5DA38DE9 E30182B87F91B6A7F7BACF29A93B44C879CCDEDB063F9D2E51E0F1FC9F018FE1 2433D85AF24B55DE3A61C4D0A2DA4FDE933F5F6FDF17E9FA9932BFC46E2D71F6 585EEF5B2E4E89E797A24B799D7F064DD1A817A53677FC9EB8CC3E7F93FE50E8 D50E3191052943FD6C98B573BDD1F6D70349E1F8011599E3F8FDF1D6E80A710E 51E434E85801617C6FD8ACCF1B77B4BFCCDD35CB4C0367F4EB4D8D9DE8284D5E B4F43E2F8320C2C5A9AE90ECBA7E65D377E91DB69FEF27069235366AD3E126C3 A73CE97F4C90BA00D206FA012C327FD69EE59AF4470A315B1799CDC0539BF90E 512C8FC3BEFE4D1B01D969EA9E3FEF976CD6E0FA4C9ECEC955B265CFD58AB8E5 F7371E479279EE14B689269205C5B506940606CF3E24A1E7EFF3CA96ED30AD6D E243DE57690C3D69A401AB3315FA49E4BF4ACD4DD1CA39272533E82EFDD508E5 1C2CD286CCC5DE1202C7C7F654521750632EB637F918667E2233A43DF75239EB F28F3129EB5DEE2FC5BFC331FF709B0FE9B327CBBCE98BCA2C861C6547E50407 1218CEBE6EB5F9BABA4F2E11BCC6FB553A544A567B459E06375102C69F8018DF BA6A227CFB13E2D74E6A521E01B74F2963E9A0A1C9FD87A88EE6356E3BFABF55 BABC751D2BF85E6712E8EF57914920775906662E4BA68FFA21AD422D34E15578 43CA0568B431101A1194F8AB1EF25E886BFCDFC10F4A5EBD9530816548BC298E AE4A0B6B52B8B59C644C409B4191B6F4203F52314F2675F02AEB65A72C66E92A 2AC703E15D8D381522C0AC30C165B822A9B8D18CAECC094EDE020756018DCF51 D0701B507519C4270B70D8CE94B436F640C15872F9B5B77892AA3D110E4D6A65 8F0815C61A5127BA25815378683F46E69E54A391A8675977E7DF9C2D4E6FA991 9F029E50CC2F266B31EE9F9F24452D5838905F330CB7E416B8AF836C5AC26AB8 BE2ECC6EA4BDAA08C30995709E225C21D35DB6369167602CBFA8DB2697635925 969002CD1BEE745DA2E56C17EF3F0C05E3847147F86963C37A221C8827195A8A 3D38993E4939AC915BFD9A212F5FF3F826F742B952018986F9FBDDB69C3AC65A 845F7F33C55D4BE60A1817EBBCA7E1538E8087E1BD5C083A320D52953BE65F31 E8339C612A510B59CE48D2EF7061560C4AD258E7DC59694493E3AC878246F37D 6DE89253EBC8830C6B209E818213C4AC4CF1F391AD91D57BE76FB0E2924A1407 E4A949C905E44F54EAED6419F13D59942C8079336A172D4758BEB5D3E786FB93 3CBE4FD2EB53E4E1DAC34E821EB30FD44BC6CB4298242C38F848FC23AEDC9733 52BE6F32E31E25F18301370F8936810B0566B664B042C7AE0D78ACF0A87E5BF6 F9B66E358168B2CEA30DCD940074F3ADB793CDB136161FE2522905E87B8E463F 95D4DAB7E14A3DF7BCCE8141C5A08FCFA2BCE9F2D1B05A7642E75877EB840149 AAB007CD239AE47AD115929427717F219B0A8907F0EC79ADE1B901DAEE87A2F8 39361DAB43DFFF69650F601B24061A9353CFD619FF9626F63275FD09A5B13BB4 8B3379EC4D147C41197E8387FC04DA7BE409524CEF74EA91DC066808A7FD0EF3 957A44E2503EDA67B1C61827479486134E922E560A673BF314D601C66003CD07 55569085AFC8428389A140EB976CCFB8F29E27587E46C413ABE2EFB51AF5913F 53EEB74063162E0BA1E24CEDCA320377D3E11BD374F0B44E132A5C35835B6E2C D32948EF9DC7931D104C1385709DA882DED6458319F21C2329938396BC074106 CB9CFB9E0A915F8DBC8435F386917AC87A2BA45D857EC30ECA66FB4044F5439E CDD556B82A0E43418D179AD883C85AC276E1190CEC242E3E1D86E725ADC39E46 BB6C47FE9E17E29F8EA81E870302A00D91434F3B7A05F243176E6EF1082541A1 B9052191EE5C2B8E94A2E02DB65FC769653CA8D1C07A13CB853544AEC7FC35C5 218DE3128AA31952DCE19C55C23FD69BCEA2C661F57B11B8F9E86BFA718D1521 3346E78C701A5E51923D6D937E62FDE3669B214D240538F069A100A542720A86 31DE88116DE775F7ACC2A49EA6C02A24408271A846990669F2AF60AFAB4C16F9 7F4E88E917F0FFDCE68F22998AC0AF2A60A73258C3A4BBC42A2F918123128195 196D0E150D79AC3CF4628503D1F3FC528265ED8324E56849A47B3B07C29940B9 1BC270071E221D355EA51E9942D3BD7F99816304FFFC8F5B036C953B38759341 ED5D7B9C8E6B70C409DD8362FD291201CC385E4A98D73E8518A4C0E544152563 82032FBD2FCB6E403D34B85ED4053A8CB619BDD4DE001F4C3007B1F317579651 E6D6662189CC2D95AB85D7473F65C5D7B4AC63B0FE928F3400035D5A9D443D0D F3532B99F3AC26CB25EA3CD64C341159061E02EFBC7C033C05CD919BBD827A6A BAD50D9C98DD94332DB4C7155F8A52013F9ECB7CCE3CFB3E667C57B022A0A753 A45E41A9D8229D5198031ABA3DAAC142AEA5FAB6694A6433629E15AE45A67FDA 34DE10D995ABCAF45FBB3B6B73E80D05F4C51F8C29D4B0F67C8A86432A6C5E86 F0126AB25A5CA2875B48C61CB8112A4CF9AA08F8B0157396CF63CBECDB8867CC AC10F060630C9BFBAD84B1FF01C814878F0C177F552BDC9BB181B14581C6E968 DAAAB2896FCFB745795C4D2C87CC15BAA041EF80C5BDC12EC1F5786BB41A5A21 073EE0BC436B346E014DB4099EDC67BC432E470A4B779FD556341061CA3F2BE8 EFA332637AEC878C2BB189CA3267B2BE5B8178E6B7889A33771F86276E6F0B8E 8E93B816AC7005575762EF4DE45E2794B7322F9B6D8E634FB8FF250D638EB502 818321B3C46DB51B8EC6C2EF1D05C716519A3BD6B12A67239898F8A012AD86D3 A5FB886A4A9C2F39D61BCA53BF8E12C28FAE703C80CA9F7AD05C717514E523E0 370A01839E7ACBCA79A17A10862A419D16D839113C2E7A8DF0AB9C72777CE63D 7262E3A0121D94735023D11DCFCA7F63E60C1522035FCCE62CC028F2A47AB4A1 5817F83963EA12BAB4F7F7A4F3A6C218842DA58BD96F4421C1462507C1C1A306 FE152A2D05F17FC1959CF0589439E183AEA012EBE630508F25FCBF5BCEDAFD8B 15A48F305835FDC3AC5658480F34B8CB3013CAE41D5794F8E13AE8B27319DA42 F65DF1C3B96659A9EB6C877A4D4A2FC934EC297885712A5D8AE6D9C0A4679D07 579D360BBCF1A6E23E08CC8DFA9DFF897088CC68B5D4F0DBA651F2C482F55F7E BA48FB20B41C6EF57313F22DA51CCC14D5375B4C7F6811D3070E0C2C4D7CA11C F4CFFD3A5D05F237B826A3B31FAA862D9B6FC87814CBAAE9A65D8A8436B435BB C9E802E9059B6ECD00B8855B63131714B0A94D51DE7B26118CF17BAC4E4BA647 CA1854406F04358C268C0F3D67B0790EDBC9A6169A3E93F6EB244B92505AF2C5 07BA7BEF204EEE7DE594E6AD9267F24F1263B0D66A3C05307A835A02902382C0 CFDAB41E802D96D49DCB379E56ADA6291D19BD53511E505786D0E392696AD713 3FDB64DC8BA8730C6D068FA2D8907B87D0A09B928D408C176A281803EC06023A E397CE2E50D6A4AD999CAAFD8DB6586DA8401CA8C844A17959846071CAD7A34B 8ED31E7ABA8D5A7F0721435EAD575C6F5A4DC59705034F69B14FF28B55E34DD2 30D7CBA88E3BF7297286744B8CCCE26C75AC63DC723AF3AB1EA2B290DE432117 BBE0CFA454E7CE42ED311F97669A1A7CECED0BD20C4876BB6485BCB638A503DF F0BBF149EB6F89F8D41F55B16B7CB0D4BAEB8CDB09C0CECB2B7A7CCD57443109 F9E2BF9318D3383753EC881BE7FE10FBCC7E752073C05D93BB9DE5110EF35511 31054462265A33234E441FAF12E4DBA0F18E271775DD9F121F3C4D5A7446D72C 9E5CEB9A0AD53C35D5D2C30A719D76645F9AE5BF3220B84252B3FA5AB67B7BE9 3CC9E7D404D73B8BC6991B38F1C2F63674F972DE07DB7797F92ADB0CA60C6D8A FB0023AA3AB889C5225C0A825547BE2E621C19A3AB587261613EF0B17EC35B18 D3D7D5DC2B34AB0B09CF7A9263174BFAAA41FABBF9910F27B0FD89CA576AAB1C ACF0BBA1686FDAA4ABDEB259DB1413231B9CBC842EC6409CE7B04A808035A1B7 2982530FDB0ABF45A0C3D4DAB183566C2B8C83D910799CD6C6E157B1794BDA1B AD5E51EBD89DD3B412D2BA0A9C9ACBA7C579F7569F397BA1C9D750E1ACE16774 F1A97494955E9CF7FBCFAAB06BF020A858AA9B7A2DD1A4E1F587D36D6988E667 3C32FF600E9271F6F40DC4BF68FCEE412E9EF095A19A2EFB49B4164BF761290B 1B852335B71C3835842CC7B81054B21879331E478FDE46441E749B388816B043 18961B8CB6A81421D731200727067BFC4673988A2DD5DBA2B18E7C2ECF8E1F96 3B7783341DF93905F509FE05EDFD2DE9E51C3ABDA83BBB55D44616C5E37B3818 208ACE647ECF8C0306CEE69081457D6C262C7C46DCA9C5F76FF7BF9DD33197BC E1EAAF832FBCDBAC094D385E5DEA98431AE9590ACE01525B9DA83C31C9D69989 FBBB6E795EC2D1F5ACCABDEFEDB987C80C61DF39F308E414C36581F89C9F31EA BE0F05BA5673888758C7F7B94B0464B52633C579C6807509427834C4D64DAA6E 9C753066B2C04EBBF2D452C2AA29A74FB7BC93CD8F1817549476CE216BE179F0 3245D620E734FDC14D05692C8866763307FDD24ADA5E242576E7DF33C1AA7A1B 24CFEAB55AF4044D400C9175A4E23FC6F4CCF82C666FA0A35C4C8500402822A3 F3CF7605E25F517A38F30D7F71E7D72C44CA4F1999EFB94657CB36AD6CA2699F F04434C068DA7171C8DD9F4F87FCCCCAF8A4038951D4DDC4A1CF18F915273A8C 5EA2CC66D0A94A1448A8631B241687C965302B60800AE0BDAD1DF5077289642B AAB6F6BD2730B083EDD5BB4568972430305C81815654DC96A906830C616BF041 08EF48F6FCCD9DE7E7BDFCC877FC43A2C3967DBDED2D9F481C92575E0D4CD0B0 0197373D2688876B81229C08708A9E3682FC84C83F9890722EF6C4168E499ABA 4E30B7F299551C647102B5D9D3B9B34E142B73314AC6F9B84283FC7954D2860D 53A7D2A1A9E1AF8EFC7F18F1A8EFC27942A3D4FB04082840813A2FF1D6155D33 934160BC7832776E15D29555432BCFD9337E0000D5919BAC9AB628559A8AA5C8 CFF02E5D185973388212C545E37A680D791652FC914DF3F9522352354EA680CC E1E78B100CA4A56D86B1BD450E528B77A487402A3B4436F093D39D2242F5B78F 02382948AF8DCE92C9F5FC27154DEAB154DFC2C08F8CB25E4A2315862E9919C7 3EBBF7975D561E8F39E687AFC65A527F5156282DF3957BFE4202D0886B9DC00C 98308428F782F68958B0B17F79FA42F930E88D48FCEC7DFB0EDA3E41086905C3 1B9096C243363F893E15EF0A1E338648FA9984E3BEA4DB93B3E2A53841742501 AD0010E470C67197ADDF97D794D5E8EB01E9169E3494A9D55ABDC79E9AF3DEE2 FB5B77C950DBF01A62074F79A7FD9F17213A1C01F96DD6A5D15EDAFE8E41D2C5 4517776C40C90B2FAAC4D9F0224D35CCBD83E8EB16FDE743EBDE119A91604BBB 67CF9B42ECEE4F00C5978F88A6F2BD9145B5955CD8FA9DCFB9D4229DD84FF712 E4CB4A8402BE43FB5B52314EE254F60617E91F00B0E6D203F271A9E25CDBDE2F 54866F5528DCEB1066A826023CE075A7A2E6AB9C7661FD7975E2FB08A0D8550A 0DFC3A7943CDD16C7FDCB2DCD896B0CB02A2B7283A5EF00CD24C02F667C1C1C8 C2B9670114ADA8D17B4EE8CBA96F994E980B28DA5475B8CB632DD8E0C7D2419B E2C80DEFF5E71F77A1FC965E63E62167B1AFBB04D21A2B66784EF2C8210DCFC0 93E7EDBF314AF66AA17B4523570D5DC1E9C8326D0AC94FD09BC33A8355DF0A28 F6DA836948FC69C034250DC1C5B66F340B44E93E2D8CD8A451F833A67740CCEE CAEAA1CDC78A6CB4199F9A00690532AD19E82EA3D9E6576A30A9A90CE9290D53 1F02F0E717CCDE0C9013A3BA719BABB73FC1A9C95757AD89447451FD3E48E2E4 2E3468FA5D1B99A91E182BA805E5203D4EF8144CCC371691BFA36178E2CD384F 7743815E7DC47300D52854BF4D08F8E34817B297EFC43331E6A8A032303BD351 E0F0E37BC92692C53307726C3F0A0181A529D1B630B7AF5F9FDA95549BEFA4C9 3C5F529DBCC7B5A75EEC7C8B1A4153BBB53EF8FC51C2031226D73E3C7EF68536 16C85338AC8CAD6625F447CE1C9449F6A38813D6BFADC034BB1063C50DD13C1F 6E1FA47095542AFB38D0A1FE379A27E0BD12FD782DA5973E2953C06D6FD2056D 497942950B1B8A0FE7FDA59F8791B9F51EEA5BCBDE2B7008EB5BE4B7CCD0594E EF18F2DDB05E64CE15094281F0D1CE1E7DA6818C2CBC89726809BA1644C7BF6C 395923890660EEE9186F2424F014A5096DD38605CCFB39CCEF14E76A3AEC4D65 EAED761FA024B3DDA82341B9E62545AA753D3BFB7F839931A324981331B2CDF2 3DDAB9892415DA67C7B30939199FA37CE1F7A1BA75D2EDF5A5DF352C3B52E47E D8CB61D48340A549E59F19C17ABACE6DC4D091B971F50B2E5293D20CAC2C2086 7BB1F300BB3A9EBF450621B8F5D4F764026C52C3130EDD66E8EBAD2F7E2DCF53 DF4BBA0A3AE30066A607A33AD26668126E070C281E5098E5466872ED60064A2D 4F9622D92706F5C42C194788D20AE7D5459B48F263045C294775C819AB23ABEA E97F4A4D7296FC5BAD4846BC8370A2ED693CF3660C1F306F799ED4EE78C0F403 1157C01B6C2157F950EFEC765427490648FDCFB3DC40232968DA24E27019DB01 DE97418B89F48B4A17701C8DC4ABA5E6F18702A668E0D8BC3C19C883F8934F05 47502319CCF736C3A7C2A782553BE69CBD67E1E15687942127C22F2917D66A4C 194C520B3A06955CD976FEE8C22AC00D71DBB5CE946F105A1E395890B9A9472C C5827C3D10684F5506844E873166C9D033E3FFF339BE74DD9474A6D76A1F0690 C72EEEA7EA073B786948828E7B076BB2E7A8D1982F9865CB83B5F2EFECCBE52E 7BCD61E20BD4B2E4085C237C3C37398618889D1E738EADEE4B7819661A00E520 EF64812B5FAEA9DBD18851F2195CF5B6FEA5C5025679170AED4914F42723AE2C 5D623A3A5715EB6E 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark {restore}if %%EndFont TeXDict begin 40258437 52099151 1000 600 600 (cfitsio.dvi) @start /Fa 133[37 4[49 30 37 38 1[46 46 51 74 23 2[28 1[42 1[42 2[42 46 11[68 12[68 3[69 55[51 12[{}19 90.9091 /CMTI10 rf /Fb 193[71 62[{}1 90.9091 /CMMI10 rf /Fc 149[25 2[45 45 86[45 15[{}4 90.9091 /CMSY10 rf /Fd 134[59 59 81 59 62 44 44 46 59 62 56 62 93 31 59 1[31 62 56 34 51 62 50 62 54 9[116 85 86 78 62 84 1[77 1[88 106 67 88 1[42 88 88 70 74 86 81 80 85 6[31 56 56 56 56 56 56 56 56 56 56 1[31 37 32[62 12[{}58 99.6264 /CMBX12 rf /Fe 129[48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 1[48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 48 33[{}93 90.9091 /CMTT10 rf /Ff 133[60 71 71 97 71 75 52 53 55 1[75 67 75 112 37 71 1[37 75 67 41 61 75 60 75 65 9[139 102 103 94 75 100 1[92 101 105 128 81 105 1[50 105 106 85 88 103 97 96 102 7[67 67 67 67 67 67 67 67 67 67 67 37 45 3[52 52 27[75 78 11[{}62 119.552 /CMBX12 rf /Fg 135[102 3[75 1[79 1[108 1[108 4[54 108 2[88 108 2[94 29[140 138 146 7[97 97 97 97 97 97 97 97 97 97 48[{}23 172.188 /CMBX12 rf /Fh 165[56 68 68 93 68 68 66 51 67 1[62 71 68 83 57 71 1[33 68 71 59 62 69 66 64 68 7[45 45 45 45 45 45 45 45 45 45 45 25 30 45[{}37 90.9091 /CMSL10 rf /Fi 133[46 55 55 1[55 58 41 41 43 1[58 52 58 87 29 2[29 58 52 32 48 58 46 58 51 9[108 2[73 58 78 1[71 79 82 1[63 2[40 82 82 66 69 80 76 74 79 1[49 5[52 52 52 52 52 52 52 52 52 52 2[35 32[58 12[{}52 90.9091 /CMBX10 rf /Fj 132[45 40 48 48 66 48 51 35 36 36 48 51 45 51 76 25 48 28 25 51 45 28 40 51 40 51 45 25 2[25 45 25 56 68 68 93 68 68 66 51 67 71 62 71 68 83 57 71 47 33 68 71 59 62 69 66 64 68 71 43 1[71 1[25 25 45 45 45 45 45 45 45 45 45 45 45 25 30 25 71 45 35 35 25 71 76 45 76 45 25 17[76 76 51 51 53 11[{}92 90.9091 /CMR10 rf /Fk 134[62 5[46 46 2[59 65 4[33 3[52 3[59 10[88 8[107 19[59 4[59 59 59 59 59 1[33 46[{}17 119.552 /CMR12 rf /Fl 139[63 64 66 2[81 90 134 45 2[45 1[81 49 74 1[72 1[78 12[112 90 2[110 6[60 2[101 2[117 1[122 65[{}20 143.462 /CMBX12 rf /Fm 133[103 123 123 1[123 129 90 92 95 1[129 116 129 194 65 2[65 129 116 71 106 129 103 129 113 9[240 1[179 162 129 173 1[159 175 182 1[140 2[87 182 183 146 153 178 168 165 175 25[65 26[129 12[{}42 206.559 /CMBX12 rf end %%EndProlog %%BeginSetup %%Feature: *Resolution 600dpi TeXDict begin %%BeginPaperSize: Letter /setpagedevice where { pop << /PageSize [612 792] >> setpagedevice } { /letter where { pop letter } if } ifelse %%EndPaperSize end %%EndSetup %%Page: 1 1 TeXDict begin 1 0 bop 0 0 a SDict begin [/Producer (dvips + Distiller)/Title ()/Subject ()/Creator (LaTeX with hyperref package)/Author ()/Keywords () /DOCINFO pdfmark end 0 0 a 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.i) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin [/Count -4/Dest (chapter.1) cvn/Title (Introduction ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.1.1) cvn/Title ( A Brief Overview) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.1.2) cvn/Title (Sources of FITS Software and Information) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.1.3) cvn/Title (Acknowledgments) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.1.4) cvn/Title (Legal Stuff) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -6/Dest (chapter.2) cvn/Title ( Creating the CFITSIO Library ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -4/Dest (section.2.1) cvn/Title (Building the Library) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.2.1.1) cvn/Title (Unix Systems) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.2.1.2) cvn/Title (VMS) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.2.1.3) cvn/Title (Windows PCs) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.2.1.4) cvn/Title (Macintosh PCs) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.2.2) cvn/Title (Testing the Library) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.2.3) cvn/Title (Linking Programs with CFITSIO) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.2.4) cvn/Title (Using CFITSIO in Multi-threaded Environments) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.2.5) cvn/Title (Getting Started with CFITSIO) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.2.6) cvn/Title (Example Program) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (chapter.3) cvn/Title ( A FITS Primer ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -13/Dest (chapter.4) cvn/Title ( Programming Guidelines ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.1) cvn/Title (CFITSIO Definitions) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.2) cvn/Title (Current Header Data Unit \(CHDU\)) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.3) cvn/Title (Function Names and Variable Datatypes) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.4) cvn/Title (Support for Unsigned Integers and Signed Bytes) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.5) cvn/Title (Dealing with Character Strings) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.6) cvn/Title (Implicit Data Type Conversion) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.7) cvn/Title (Data Scaling) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.8) cvn/Title (Support for IEEE Special Values) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.9) cvn/Title (Error Status Values and the Error Message Stack) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.10) cvn/Title (Variable-Length Arrays in Binary Tables) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.11) cvn/Title (Multiple Access to the Same FITS File) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.12) cvn/Title (When the Final Size of the FITS HDU is Unknown) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.4.13) cvn/Title (CFITSIO Size Limitations) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -8/Dest (chapter.5) cvn/Title (Basic CFITSIO Interface Routines ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.5.1) cvn/Title (CFITSIO Error Status Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.5.2) cvn/Title (FITS File Access Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.5.3) cvn/Title (HDU Access Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -2/Dest (section.5.4) cvn/Title (Header Keyword Read/Write Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.5.4.1) cvn/Title (Keyword Reading Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.5.4.2) cvn/Title (Keyword Writing Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.5.5) cvn/Title (Primary Array or IMAGE Extension I/O Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.5.6) cvn/Title (Image Compression) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -6/Dest (section.5.7) cvn/Title (ASCII and Binary Table Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.5.7.1) cvn/Title (Create New Table) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.5.7.2) cvn/Title (Column Information Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.5.7.3) cvn/Title (Routines to Edit Rows or Columns) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.5.7.4) cvn/Title (Read and Write Column Data Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.5.7.5) cvn/Title (Row Selection and Calculator Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.5.7.6) cvn/Title (Column Binning or Histogramming Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -3/Dest (section.5.8) cvn/Title (Utility Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.5.8.1) cvn/Title (File Checksum Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.5.8.2) cvn/Title (Date and Time Utility Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.5.8.3) cvn/Title (General Utility Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -4/Dest (chapter.6) cvn/Title ( The CFITSIO Iterator Function ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.6.1) cvn/Title (The Iterator Work Function) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.6.2) cvn/Title (The Iterator Driver Function) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.6.3) cvn/Title (Guidelines for Using the Iterator Function) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.6.4) cvn/Title (Complete List of Iterator Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -1/Dest (chapter.7) cvn/Title ( World Coordinate System Routines ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.7.1) cvn/Title ( Self-contained WCS Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -2/Dest (chapter.8) cvn/Title ( Hierarchical Grouping Routines ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.8.1) cvn/Title (Grouping Table Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.8.2) cvn/Title (Group Member Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -6/Dest (chapter.9) cvn/Title ( Specialized CFITSIO Interface Routines ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -2/Dest (section.9.1) cvn/Title (FITS File Access Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.1.1) cvn/Title (File Access) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.1.2) cvn/Title (Download Utility Functions) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.9.2) cvn/Title (HDU Access Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -7/Dest (section.9.3) cvn/Title (Specialized Header Keyword Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.3.1) cvn/Title (Header Information Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.3.2) cvn/Title (Read and Write the Required Keywords) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.3.3) cvn/Title (Write Keyword Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.3.4) cvn/Title (Insert Keyword Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.3.5) cvn/Title (Read Keyword Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.3.6) cvn/Title (Modify Keyword Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.3.7) cvn/Title (Update Keyword Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.9.4) cvn/Title (Define Data Scaling and Undefined Pixel Parameters) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.9.5) cvn/Title (Specialized FITS Primary Array or IMAGE Extension I/O Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -4/Dest (section.9.6) cvn/Title (Specialized FITS ASCII and Binary Table Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.6.1) cvn/Title (General Column Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.6.2) cvn/Title (Low-Level Table Access Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.6.3) cvn/Title (Write Column Data Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.9.6.4) cvn/Title (Read Column Data Routines) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -12/Dest (chapter.10) cvn/Title ( Extended File Name Syntax ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.10.1) cvn/Title (Overview) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -6/Dest (section.10.2) cvn/Title (Filetype) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.2.1) cvn/Title (Notes about HTTP proxy servers) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.2.2) cvn/Title (Notes about HTTPS and FTPS file access) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.2.3) cvn/Title (Notes about the stream filetype driver) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.2.4) cvn/Title (Notes about the gsiftp filetype) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.2.5) cvn/Title (Notes about the root filetype) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.2.6) cvn/Title (Notes about the shmem filetype:) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.10.3) cvn/Title (Base Filename) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.10.4) cvn/Title (Output File Name when Opening an Existing File) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.10.5) cvn/Title (Template File Name when Creating a New File) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.10.6) cvn/Title (Image Tile-Compression Specification) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.10.7) cvn/Title (HDU Location Specification) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.10.8) cvn/Title (Image Section) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.10.9) cvn/Title (Image Transform Filters) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.10.10) cvn/Title (Column and Keyword Filtering Specification) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -7/Dest (section.10.11) cvn/Title (Row Filtering Specification) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.11.1) cvn/Title (General Syntax) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.11.2) cvn/Title (Bit Masks) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.11.3) cvn/Title (Vector Columns) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.11.4) cvn/Title (Row Access) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.11.5) cvn/Title (Good Time Interval Filtering) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.11.6) cvn/Title (Spatial Region Filtering) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (subsection.10.11.7) cvn/Title (Example Row Filters) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.10.12) cvn/Title ( Binning or Histogramming Specification) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -6/Dest (chapter.11) cvn/Title (Template Files ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.11.1) cvn/Title (Detailed Template Line Format) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.11.2) cvn/Title (Auto-indexing of Keywords) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.11.3) cvn/Title (Template Parser Directives) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.11.4) cvn/Title (Formal Template Syntax) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.11.5) cvn/Title (Errors) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.11.6) cvn/Title (Examples) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -6/Dest (chapter.12) cvn/Title ( Local FITS Conventions ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.12.1) cvn/Title (64-Bit Long Integers) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.12.2) cvn/Title (Long String Keyword Values.) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.12.3) cvn/Title (Arrays of Fixed-Length Strings in Binary Tables) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.12.4) cvn/Title (Keyword Units Strings) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.12.5) cvn/Title (HIERARCH Convention for Extended Keyword Names) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.12.6) cvn/Title (Tile-Compressed Image Format) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -2/Dest (chapter.13) cvn/Title ( Optimizing Programs ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.13.1) cvn/Title (How CFITSIO Manages Data I/O) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (section.13.2) cvn/Title (Optimization Strategies) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (appendix.A) cvn/Title (Index of Routines ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (appendix.B) cvn/Title (Parameter Definitions ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/Count -0/Dest (appendix.C) cvn/Title (CFITSIO Error Status Codes ) /OUT pdfmark end 0 464 a 0 464 a SDict begin [/PageMode /UseOutlines/Page 1/View [/Fit] /DOCVIEW pdfmark end 0 464 a 0 464 a SDict begin [ {Catalog}<<>> /PUT pdfmark end 0 464 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (Doc-Start) cvn /DEST pdfmark end 0 464 a 0 464 a SDict begin [ {Catalog} <>4<>]>>>> /PUT pdfmark end 0 464 a 240 1799 a Fm(CFITSIO)76 b(User's)g(Reference)i(Guide)727 2258 y Fl(An)53 b(In)l(terface)f(to)i(FITS)g(F)-13 b(ormat)54 b(Files)1263 2518 y(for)g(C)f(Programmers)1667 3013 y Fk(V)-10 b(ersion)38 b(3.4)1727 3916 y Fj(HEASAR)m(C)1764 4029 y(Co)s(de)30 b(662)1363 4142 y(Go)s(ddard)f(Space)i(Fligh)m(t)h (Cen)m(ter)1522 4255 y(Green)m(b)s(elt,)f(MD)h(20771)1857 4367 y(USA)1701 5227 y Fk(Ma)m(y)39 b(2019)p eop end %%Page: 2 2 TeXDict begin 2 1 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.ii) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(ii)p eop end %%Page: 3 3 TeXDict begin 3 2 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.iii) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter*.1) cvn /DEST pdfmark end 0 464 a 803 x Fm(Con)-6 b(ten)g(ts)0 1858 y SDict begin H.S end 0 1858 a Fi(1)84 b(In)m(tro)s(duction)748 1858 y SDict begin 13.6 H.L end 748 1858 a 748 1858 a SDict begin [/Subtype /Link/Dest (chapter.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 748 1858 a 3100 w Fi(1)136 2020 y SDict begin H.S end 136 2020 a Fj(1.1)125 b(A)30 b(Brief)h(Ov)m(erview)1069 2020 y SDict begin 13.6 H.L end 1069 2020 a 1069 2020 a SDict begin [/Subtype /Link/Dest (section.1.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1069 2020 a 85 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)131 b(1)136 2182 y SDict begin H.S end 136 2182 a Fj(1.2)94 b(Sources)30 b(of)h(FITS)f(Soft)m(w)m(are)h(and)f(Information)2035 2182 y SDict begin 13.6 H.L end 2035 2182 a 2035 2182 a SDict begin [/Subtype /Link/Dest (section.1.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2035 2182 a 38 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)f(.)131 b(1)136 2344 y SDict begin H.S end 136 2344 a Fj(1.3)94 b(Ac)m(kno)m(wledgmen)m(ts)1053 2344 y SDict begin 13.6 H.L end 1053 2344 a 1053 2344 a SDict begin [/Subtype /Link/Dest (section.1.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1053 2344 a 30 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)131 b(2)136 2506 y SDict begin H.S end 136 2506 a Fj(1.4)94 b(Legal)32 b(Stu\013)779 2506 y SDict begin 13.6 H.L end 779 2506 a 779 2506 a SDict begin [/Subtype /Link/Dest (section.1.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 779 2506 a 92 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)f(.)131 b(4)0 2766 y SDict begin H.S end 0 2766 a Fi(2)119 b(Creating)34 b(the)h(CFITSIO)e(Library)1627 2766 y SDict begin 13.6 H.L end 1627 2766 a 1627 2766 a SDict begin [/Subtype /Link/Dest (chapter.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1627 2766 a 2221 w Fi(5)136 2928 y SDict begin H.S end 136 2928 a Fj(2.1)94 b(Building)31 b(the)f(Library)1167 2928 y SDict begin 13.6 H.L end 1167 2928 a 1167 2928 a SDict begin [/Subtype /Link/Dest (section.2.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1167 2928 a 58 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.) 131 b(5)345 3090 y SDict begin H.S end 345 3090 a Fj(2.1.1)106 b(Unix)31 b(Systems)1181 3090 y SDict begin 13.6 H.L end 1181 3090 a 1181 3090 a SDict begin [/Subtype /Link/Dest (subsection.2.1.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1181 3090 a 44 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)f(.)131 b(5)345 3252 y SDict begin H.S end 345 3252 a Fj(2.1.2)106 b(VMS)838 3252 y SDict begin 13.6 H.L end 838 3252 a 838 3252 a SDict begin [/Subtype /Link/Dest (subsection.2.1.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 838 3252 a 33 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)f(.)131 b(7)345 3413 y SDict begin H.S end 345 3413 a Fj(2.1.3)106 b(Windo)m(ws)31 b(PCs)1195 3413 y SDict begin 13.6 H.L end 1195 3413 a 1195 3413 a SDict begin [/Subtype /Link/Dest (subsection.2.1.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1195 3413 a 30 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)131 b(7)345 3575 y SDict begin H.S end 345 3575 a Fj(2.1.4)106 b(Macin)m(tosh)32 b(PCs)1240 3575 y SDict begin 13.6 H.L end 1240 3575 a 1240 3575 a SDict begin [/Subtype /Link/Dest (subsection.2.1.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1240 3575 a 55 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)131 b(7)136 3737 y SDict begin H.S end 136 3737 a Fj(2.2)94 b(T)-8 b(esting)32 b(the)e(Library)1121 3737 y SDict begin 13.6 H.L end 1121 3737 a 1121 3737 a SDict begin [/Subtype /Link/Dest (section.2.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1121 3737 a 33 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)f(.)131 b(7)136 3899 y SDict begin H.S end 136 3899 a Fj(2.3)94 b(Linking)31 b(Programs)f(with)g(CFITSIO)1675 3899 y SDict begin 13.6 H.L end 1675 3899 a 1675 3899 a SDict begin [/Subtype /Link/Dest (section.2.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1675 3899 a 45 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)131 b(9)136 4061 y SDict begin H.S end 136 4061 a Fj(2.4)94 b(Using)31 b(CFITSIO)e(in)h(Multi-threaded) h(En)m(vironmen)m(ts)2294 4061 y SDict begin 13.6 H.L end 2294 4061 a 2294 4061 a SDict begin [/Subtype /Link/Dest (section.2.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2294 4061 a 62 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)131 b(9)136 4223 y SDict begin H.S end 136 4223 a Fj(2.5)94 b(Getting)32 b(Started)f(with)f(CFITSIO)1589 4223 y SDict begin 13.6 H.L end 1589 4223 a 1589 4223 a SDict begin [/Subtype /Link/Dest (section.2.5) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1589 4223 a 60 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)131 b(9)136 4385 y SDict begin H.S end 136 4385 a Fj(2.6)94 b(Example)31 b(Program)1068 4385 y SDict begin 13.6 H.L end 1068 4385 a 1068 4385 a SDict begin [/Subtype /Link/Dest (section.2.6) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1068 4385 a 86 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)85 b(10)0 4645 y SDict begin H.S end 0 4645 a Fi(3)119 b(A)35 b(FITS)f(Primer)913 4645 y SDict begin 13.6 H.L end 913 4645 a 913 4645 a SDict begin [/Subtype /Link/Dest (chapter.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 913 4645 a 2882 w Fi(13)0 4904 y SDict begin H.S end 0 4904 a Fi(4)119 b(Programming)37 b(Guidelines)1348 4904 y SDict begin 13.6 H.L end 1348 4904 a 1348 4904 a SDict begin [/Subtype /Link/Dest (chapter.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1348 4904 a 2447 w Fi(15)136 5066 y SDict begin H.S end 136 5066 a Fj(4.1)94 b(CFITSIO)29 b(De\014nitions)1181 5066 y SDict begin 13.6 H.L end 1181 5066 a 1181 5066 a SDict begin [/Subtype /Link/Dest (section.4.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1181 5066 a 44 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.) 85 b(15)136 5228 y SDict begin H.S end 136 5228 a Fj(4.2)94 b(Curren)m(t)30 b(Header)h(Data)h(Unit)e(\(CHDU\))1774 5228 y SDict begin 13.6 H.L end 1774 5228 a 1774 5228 a SDict begin [/Subtype /Link/Dest (section.4.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1774 5228 a 87 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f (.)85 b(18)136 5390 y SDict begin H.S end 136 5390 a Fj(4.3)94 b(F)-8 b(unction)32 b(Names)e(and)g(V)-8 b(ariable)32 b(Datat)m(yp)s(es)1961 5390 y SDict begin 13.6 H.L end 1961 5390 a 1961 5390 a SDict begin [/Subtype /Link/Dest (section.4.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1961 5390 a 41 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(18)136 5552 y SDict begin H.S end 136 5552 a Fj(4.4)94 b(Supp)s(ort)29 b(for)h(Unsigned)g(In)m(tegers)h(and)f (Signed)g(Bytes)2270 5552 y SDict begin 13.6 H.L end 2270 5552 a 2270 5552 a SDict begin [/Subtype /Link/Dest (section.4.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2270 5552 a 86 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(20)136 5714 y SDict begin H.S end 136 5714 a Fj(4.5)94 b(Dealing)33 b(with)d(Character)g(Strings)1588 5714 y SDict begin 13.6 H.L end 1588 5714 a 1588 5714 a SDict begin [/Subtype /Link/Dest (section.4.5) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1588 5714 a 61 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(22)1912 5942 y(iii)p eop end %%Page: 4 4 TeXDict begin 4 3 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.iv) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(iv)3311 b Fh(CONTENTS)136 555 y SDict begin H.S end 136 555 a Fj(4.6)94 b(Implicit)31 b(Data)h(T)m(yp)s(e)e(Con)m(v)m(ersion)1584 555 y SDict begin 13.6 H.L end 1584 555 a 1584 555 a SDict begin [/Subtype /Link/Dest (section.4.6) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1584 555 a 65 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)f(.)85 b(23)136 716 y SDict begin H.S end 136 716 a Fj(4.7)94 b(Data)32 b(Scaling)853 716 y SDict begin 13.6 H.L end 853 716 a 853 716 a SDict begin [/Subtype /Link/Dest (section.4.7) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 853 716 a 89 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(23)136 876 y SDict begin H.S end 136 876 a Fj(4.8)94 b(Supp)s(ort)29 b(for)h(IEEE)g(Sp)s(ecial)g(V)-8 b(alues)1652 876 y SDict begin 13.6 H.L end 1652 876 a 1652 876 a SDict begin [/Subtype /Link/Dest (section.4.8) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1652 876 a 68 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(24)136 1037 y SDict begin H.S end 136 1037 a Fj(4.9)94 b(Error)30 b(Status)g(V)-8 b(alues)32 b(and)d(the)i(Error)e(Message)j(Stac)m(k)2312 1037 y SDict begin 13.6 H.L end 2312 1037 a 2312 1037 a SDict begin [/Subtype /Link/Dest (section.4.9) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2312 1037 a 44 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)f(.)85 b(24)136 1197 y SDict begin H.S end 136 1197 a Fj(4.10)49 b(V)-8 b(ariable-Length)33 b(Arra)m(ys)d(in)g(Binary)h(T)-8 b(ables)1971 1197 y SDict begin 13.6 H.L end 1971 1197 a 1971 1197 a SDict begin [/Subtype /Link/Dest (section.4.10) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1971 1197 a 31 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(25)136 1358 y SDict begin H.S end 136 1358 a Fj(4.11)49 b(Multiple)32 b(Access)f(to)g(the)g(Same)f (FITS)g(File)1901 1358 y SDict begin 13.6 H.L end 1901 1358 a 1901 1358 a SDict begin [/Subtype /Link/Dest (section.4.11) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1901 1358 a 31 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(27)136 1518 y SDict begin H.S end 136 1518 a Fj(4.12)49 b(When)31 b(the)f(Final)h(Size)g (of)g(the)f(FITS)g(HDU)h(is)f(Unkno)m(wn)2393 1518 y SDict begin 13.6 H.L end 2393 1518 a 2393 1518 a SDict begin [/Subtype /Link/Dest (section.4.12) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2393 1518 a 34 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(27)136 1678 y SDict begin H.S end 136 1678 a Fj(4.13)49 b(CFITSIO)29 b(Size)i (Limitations)1395 1678 y SDict begin 13.6 H.L end 1395 1678 a 1395 1678 a SDict begin [/Subtype /Link/Dest (section.4.13) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1395 1678 a 42 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)f(.)85 b(28)0 1931 y SDict begin H.S end 0 1931 a Fi(5)f(Basic)36 b(CFITSIO)d(In)m (terface)h(Routines)1757 1931 y SDict begin 13.6 H.L end 1757 1931 a 1757 1931 a SDict begin [/Subtype /Link/Dest (chapter.5) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1757 1931 a 2038 w Fi(31)136 2092 y SDict begin H.S end 136 2092 a Fj(5.1)94 b(CFITSIO)29 b(Error)h(Status)g(Routines)1631 2092 y SDict begin 13.6 H.L end 1631 2092 a 1631 2092 a SDict begin [/Subtype /Link/Dest (section.5.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1631 2092 a 89 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)f(.)85 b(31)136 2252 y SDict begin H.S end 136 2252 a Fj(5.2)94 b(FITS)30 b(File)i(Access)f(Routines)1406 2252 y SDict begin 13.6 H.L end 1406 2252 a 1406 2252 a SDict begin [/Subtype /Link/Dest (section.5.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1406 2252 a 31 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(32)136 2412 y SDict begin H.S end 136 2412 a Fj(5.3)94 b(HDU)32 b(Access)f(Routines)1223 2412 y SDict begin 13.6 H.L end 1223 2412 a 1223 2412 a SDict begin [/Subtype /Link/Dest (section.5.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1223 2412 a 72 w Fj(.)46 b(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(35)136 2573 y SDict begin H.S end 136 2573 a Fj(5.4)94 b(Header)31 b(Keyw)m(ord)f(Read/W)-8 b(rite)33 b(Routines)1892 2573 y SDict begin 13.6 H.L end 1892 2573 a 1892 2573 a SDict begin [/Subtype /Link/Dest (section.5.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1892 2573 a 40 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(37)345 2733 y SDict begin H.S end 345 2733 a Fj(5.4.1)106 b(Keyw)m(ord)30 b(Reading)h(Routines)1725 2733 y SDict begin 13.6 H.L end 1725 2733 a 1725 2733 a SDict begin [/Subtype /Link/Dest (subsection.5.4.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1725 2733 a 65 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(38)345 2894 y SDict begin H.S end 345 2894 a Fj(5.4.2)106 b(Keyw)m(ord)30 b(W)-8 b(riting)32 b(Routines)1704 2894 y SDict begin 13.6 H.L end 1704 2894 a 1704 2894 a SDict begin [/Subtype /Link/Dest (subsection.5.4.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1704 2894 a 86 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)85 b(40)136 3054 y SDict begin H.S end 136 3054 a Fj(5.5)94 b(Primary)30 b(Arra)m(y)h(or)f(IMA)m(GE)i(Extension)e(I/O)g(Routines)2373 3054 y SDict begin 13.6 H.L end 2373 3054 a 2373 3054 a SDict begin [/Subtype /Link/Dest (section.5.5) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2373 3054 a 54 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f (.)85 b(43)136 3215 y SDict begin H.S end 136 3215 a Fj(5.6)94 b(Image)32 b(Compression)1123 3215 y SDict begin 13.6 H.L end 1123 3215 a 1123 3215 a SDict begin [/Subtype /Link/Dest (section.5.6) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1123 3215 a 31 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)f(.)85 b(47)136 3375 y SDict begin H.S end 136 3375 a Fj(5.7)94 b(ASCI)s(I)29 b(and)h(Binary)h(T)-8 b(able)31 b(Routines)1705 3375 y SDict begin 13.6 H.L end 1705 3375 a 1705 3375 a SDict begin [/Subtype /Link/Dest (section.5.7) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1705 3375 a 85 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(52)345 3536 y SDict begin H.S end 345 3536 a Fj(5.7.1)106 b(Create)32 b(New)e(T)-8 b(able)1353 3536 y SDict begin 13.6 H.L end 1353 3536 a 1353 3536 a SDict begin [/Subtype /Link/Dest (subsection.5.7.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1353 3536 a 84 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f (.)85 b(52)345 3696 y SDict begin H.S end 345 3696 a Fj(5.7.2)106 b(Column)30 b(Information)g(Routines)1830 3696 y SDict begin 13.6 H.L end 1830 3696 a 1830 3696 a SDict begin [/Subtype /Link/Dest (subsection.5.7.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1830 3696 a 31 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(53)345 3857 y SDict begin H.S end 345 3857 a Fj(5.7.3)106 b(Routines)31 b(to)g(Edit)f(Ro)m(ws)h(or)f(Columns)2034 3857 y SDict begin 13.6 H.L end 2034 3857 a 2034 3857 a SDict begin [/Subtype /Link/Dest (subsection.5.7.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2034 3857 a 39 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(55)345 4017 y SDict begin H.S end 345 4017 a Fj(5.7.4)106 b(Read)31 b(and)f(W)-8 b(rite)31 b(Column)f(Data)i(Routines)2219 4017 y SDict begin 13.6 H.L end 2219 4017 a 2219 4017 a SDict begin [/Subtype /Link/Dest (subsection.5.7.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2219 4017 a 66 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(57)345 4178 y SDict begin H.S end 345 4178 a Fj(5.7.5)106 b(Ro)m(w)31 b(Selection)h(and)e (Calculator)h(Routines)2197 4178 y SDict begin 13.6 H.L end 2197 4178 a 2197 4178 a SDict begin [/Subtype /Link/Dest (subsection.5.7.5) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2197 4178 a 88 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(59)345 4338 y SDict begin H.S end 345 4338 a Fj(5.7.6)106 b(Column)30 b(Binning)g(or)g(Histogramming)i (Routines)2423 4338 y SDict begin 13.6 H.L end 2423 4338 a 2423 4338 a SDict begin [/Subtype /Link/Dest (subsection.5.7.6) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2423 4338 a 74 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)f(.)85 b(61)136 4498 y SDict begin H.S end 136 4498 a Fj(5.8)94 b(Utilit)m(y)33 b(Routines)986 4498 y SDict begin 13.6 H.L end 986 4498 a 986 4498 a SDict begin [/Subtype /Link/Dest (section.5.8) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 986 4498 a 27 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(64)345 4659 y SDict begin H.S end 345 4659 a Fj(5.8.1)106 b(File)32 b(Chec)m(ksum)e(Routines)1602 4659 y SDict begin 13.6 H.L end 1602 4659 a 1602 4659 a SDict begin [/Subtype /Link/Dest (subsection.5.8.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1602 4659 a 47 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(64)345 4819 y SDict begin H.S end 345 4819 a Fj(5.8.2)106 b(Date)32 b(and)e(Time)g(Utilit)m(y)j (Routines)1912 4819 y SDict begin 13.6 H.L end 1912 4819 a 1912 4819 a SDict begin [/Subtype /Link/Dest (subsection.5.8.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1912 4819 a 90 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(65)345 4980 y SDict begin H.S end 345 4980 a Fj(5.8.3)106 b(General)32 b(Utilit)m(y)g(Routines)1616 4980 y SDict begin 13.6 H.L end 1616 4980 a 1616 4980 a SDict begin [/Subtype /Link/Dest (subsection.5.8.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1616 4980 a 33 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(66)0 5232 y SDict begin H.S end 0 5232 a Fi(6)119 b(The)35 b(CFITSIO)e(Iterator)g(F)-9 b(unction)1677 5232 y SDict begin 13.6 H.L end 1677 5232 a 1677 5232 a SDict begin [/Subtype /Link/Dest (chapter.6) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1677 5232 a 2118 w Fi(77)136 5393 y SDict begin H.S end 136 5393 a Fj(6.1)94 b(The)30 b(Iterator)i(W)-8 b(ork)31 b(F)-8 b(unction)1463 5393 y SDict begin 13.6 H.L end 1463 5393 a 1463 5393 a SDict begin [/Subtype /Link/Dest (section.6.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1463 5393 a 45 w Fj(.)45 b(.)h(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(78)136 5553 y SDict begin H.S end 136 5553 a Fj(6.2)94 b(The)30 b(Iterator)i(Driv)m(er)f(F)-8 b(unction)1500 5553 y SDict begin 13.6 H.L end 1500 5553 a 1500 5553 a SDict begin [/Subtype /Link/Dest (section.6.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1500 5553 a 78 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(80)136 5714 y SDict begin H.S end 136 5714 a Fj(6.3)94 b(Guidelines)31 b(for)f(Using)h(the)f(Iterator)i(F)-8 b(unction)2028 5714 y SDict begin 13.6 H.L end 2028 5714 a 2028 5714 a SDict begin [/Subtype /Link/Dest (section.6.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2028 5714 a 45 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)f(.)85 b(81)p eop end %%Page: 5 5 TeXDict begin 5 4 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.v) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(CONTENTS)3334 b Fj(v)136 555 y SDict begin H.S end 136 555 a Fj(6.4)94 b(Complete)32 b(List)e(of)h (Iterator)g(Routines)1728 555 y SDict begin 13.6 H.L end 1728 555 a 1728 555 a SDict begin [/Subtype /Link/Dest (section.6.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1728 555 a 62 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(82)0 823 y SDict begin H.S end 0 823 a Fi(7)119 b(W)-9 b(orld)36 b(Co)s(ordinate)e (System)h(Routines)1839 823 y SDict begin 13.6 H.L end 1839 823 a 1839 823 a SDict begin [/Subtype /Link/Dest (chapter.7) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1839 823 a 1956 w Fi(85)136 986 y SDict begin H.S end 136 986 a Fj(7.1)125 b(Self-con)m(tained) 32 b(W)m(CS)e(Routines)1549 986 y SDict begin 13.6 H.L end 1549 986 a 1549 986 a SDict begin [/Subtype /Link/Dest (section.7.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1549 986 a 29 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)85 b(86)0 1254 y SDict begin H.S end 0 1254 a Fi(8)119 b(Hierarc)m(hical)36 b(Grouping)g(Routines)1667 1254 y SDict begin 13.6 H.L end 1667 1254 a 1667 1254 a SDict begin [/Subtype /Link/Dest (chapter.8) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1667 1254 a 2128 w Fi(89)136 1418 y SDict begin H.S end 136 1418 a Fj(8.1)94 b(Grouping)30 b(T)-8 b(able)31 b(Routines)1350 1418 y SDict begin 13.6 H.L end 1350 1418 a 1350 1418 a SDict begin [/Subtype /Link/Dest (section.8.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1350 1418 a 87 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(90)136 1581 y SDict begin H.S end 136 1581 a Fj(8.2)94 b(Group)30 b(Mem)m(b)s(er)g(Routines)1335 1581 y SDict begin 13.6 H.L end 1335 1581 a 1335 1581 a SDict begin [/Subtype /Link/Dest (section.8.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1335 1581 a 31 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(92)0 1849 y SDict begin H.S end 0 1849 a Fi(9)119 b(Sp)s(ecialized)36 b(CFITSIO)d(In)m (terface)h(Routines)2054 1849 y SDict begin 13.6 H.L end 2054 1849 a 2054 1849 a SDict begin [/Subtype /Link/Dest (chapter.9) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2054 1849 a 1741 w Fi(95)136 2013 y SDict begin H.S end 136 2013 a Fj(9.1)94 b(FITS)30 b(File)i(Access)f(Routines)1406 2013 y SDict begin 13.6 H.L end 1406 2013 a 1406 2013 a SDict begin [/Subtype /Link/Dest (section.9.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1406 2013 a 31 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(95)345 2176 y SDict begin H.S end 345 2176 a Fj(9.1.1)106 b(File)32 b(Access)1077 2176 y SDict begin 13.6 H.L end 1077 2176 a 1077 2176 a SDict begin [/Subtype /Link/Dest (subsection.9.1.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1077 2176 a 77 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(95)345 2340 y SDict begin H.S end 345 2340 a Fj(9.1.2)106 b(Do)m(wnload)32 b(Utilit)m(y)g(F)-8 b(unctions)1737 2340 y SDict begin 13.6 H.L end 1737 2340 a 1737 2340 a SDict begin [/Subtype /Link/Dest (subsection.9.1.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1737 2340 a 53 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)85 b(99)136 2503 y SDict begin H.S end 136 2503 a Fj(9.2)94 b(HDU)32 b(Access)f(Routines)1223 2503 y SDict begin 13.6 H.L end 1223 2503 a 1223 2503 a SDict begin [/Subtype /Link/Dest (section.9.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1223 2503 a 72 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(100)136 2667 y SDict begin H.S end 136 2667 a Fj(9.3)94 b(Sp)s(ecialized)32 b(Header)e(Keyw)m(ord)h(Routines)1858 2667 y SDict begin 13.6 H.L end 1858 2667 a 1858 2667 a SDict begin [/Subtype /Link/Dest (section.9.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1858 2667 a 74 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(102)345 2830 y SDict begin H.S end 345 2830 a Fj(9.3.1)106 b(Header)31 b(Information)f(Routines)1797 2830 y SDict begin 13.6 H.L end 1797 2830 a 1797 2830 a SDict begin [/Subtype /Link/Dest (subsection.9.3.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1797 2830 a 64 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(102)345 2994 y SDict begin H.S end 345 2994 a Fj(9.3.2)106 b(Read)31 b(and)f(W)-8 b(rite)31 b(the)g(Required)f(Keyw)m(ords)2234 2994 y SDict begin 13.6 H.L end 2234 2994 a 2234 2994 a SDict begin [/Subtype /Link/Dest (subsection.9.3.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2234 2994 a 51 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(102)345 3157 y SDict begin H.S end 345 3157 a Fj(9.3.3)106 b(W)-8 b(rite)32 b(Keyw)m(ord)e(Routines)1623 3157 y SDict begin 13.6 H.L end 1623 3157 a 1623 3157 a SDict begin [/Subtype /Link/Dest (subsection.9.3.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1623 3157 a 26 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)f(.)40 b(104)345 3321 y SDict begin H.S end 345 3321 a Fj(9.3.4)106 b(Insert)30 b(Keyw)m(ord)g(Routines)1631 3321 y SDict begin 13.6 H.L end 1631 3321 a 1631 3321 a SDict begin [/Subtype /Link/Dest (subsection.9.3.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1631 3321 a 89 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)40 b(106)345 3484 y SDict begin H.S end 345 3484 a Fj(9.3.5)106 b(Read)31 b(Keyw)m(ord)f(Routines)1604 3484 y SDict begin 13.6 H.L end 1604 3484 a 1604 3484 a SDict begin [/Subtype /Link/Dest (subsection.9.3.5) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1604 3484 a 45 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.) g(.)f(.)40 b(107)345 3648 y SDict begin H.S end 345 3648 a Fj(9.3.6)106 b(Mo)s(dify)30 b(Keyw)m(ord)h(Routines)1684 3648 y SDict begin 13.6 H.L end 1684 3648 a 1684 3648 a SDict begin [/Subtype /Link/Dest (subsection.9.3.6) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1684 3648 a 36 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)40 b(109)345 3811 y SDict begin H.S end 345 3811 a Fj(9.3.7)106 b(Up)s(date)31 b(Keyw)m(ord)f(Routines)1694 3811 y SDict begin 13.6 H.L end 1694 3811 a 1694 3811 a SDict begin [/Subtype /Link/Dest (subsection.9.3.7) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1694 3811 a 26 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)40 b(110)136 3975 y SDict begin H.S end 136 3975 a Fj(9.4)94 b(De\014ne)31 b(Data)h(Scaling)f(and)f(Unde\014ned)f(Pixel)i(P)m(arameters)2454 3975 y SDict begin 13.6 H.L end 2454 3975 a 2454 3975 a SDict begin [/Subtype /Link/Dest (section.9.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2454 3975 a 43 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(111)136 4138 y SDict begin H.S end 136 4138 a Fj(9.5)94 b(Sp)s(ecialized)32 b(FITS)d(Primary)h(Arra)m(y)h(or)f(IMA)m(GE)h(Extension)g(I/O)f (Routines)3079 4138 y SDict begin 13.6 H.L end 3079 4138 a 3079 4138 a SDict begin [/Subtype /Link/Dest (section.9.5) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 3079 4138 a 55 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(112)136 4302 y SDict begin H.S end 136 4302 a Fj(9.6)94 b(Sp)s(ecialized)32 b(FITS)d(ASCI)s(I)g (and)h(Binary)g(T)-8 b(able)31 b(Routines)2410 4302 y SDict begin 13.6 H.L end 2410 4302 a 2410 4302 a SDict begin [/Subtype /Link/Dest (section.9.6) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2410 4302 a 87 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(115)345 4465 y SDict begin H.S end 345 4465 a Fj(9.6.1)106 b(General)32 b(Column)d(Routines)1669 4465 y SDict begin 13.6 H.L end 1669 4465 a 1669 4465 a SDict begin [/Subtype /Link/Dest (subsection.9.6.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1669 4465 a 51 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(115)345 4629 y SDict begin H.S end 345 4629 a Fj(9.6.2)106 b(Lo)m(w-Lev)m(el)33 b(T)-8 b(able)31 b(Access)g(Routines)1962 4629 y SDict begin 13.6 H.L end 1962 4629 a 1962 4629 a SDict begin [/Subtype /Link/Dest (subsection.9.6.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1962 4629 a 40 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(117)345 4792 y SDict begin H.S end 345 4792 a Fj(9.6.3)106 b(W)-8 b(rite)32 b(Column)e(Data)i(Routines)1809 4792 y SDict begin 13.6 H.L end 1809 4792 a 1809 4792 a SDict begin [/Subtype /Link/Dest (subsection.9.6.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1809 4792 a 52 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(117)345 4956 y SDict begin H.S end 345 4956 a Fj(9.6.4)106 b(Read)31 b(Column)e(Data)j (Routines)1789 4956 y SDict begin 13.6 H.L end 1789 4956 a 1789 4956 a SDict begin [/Subtype /Link/Dest (subsection.9.6.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1789 4956 a 72 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(118)0 5223 y SDict begin H.S end 0 5223 a Fi(10)67 b(Extended)35 b(File)f(Name)h(Syn)m(tax)1500 5223 y SDict begin 13.6 H.L end 1500 5223 a 1500 5223 a SDict begin [/Subtype /Link/Dest (chapter.10) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1500 5223 a 2243 w Fi(123)136 5387 y SDict begin H.S end 136 5387 a Fj(10.1)49 b(Ov)m(erview)716 5387 y SDict begin 13.6 H.L end 716 5387 a 716 5387 a SDict begin [/Subtype /Link/Dest (section.10.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 716 5387 a 84 w Fj(.)d(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(123)136 5550 y SDict begin H.S end 136 5550 a Fj(10.2)49 b(Filet)m(yp)s(e)668 5550 y SDict begin 13.6 H.L end 668 5550 a 668 5550 a SDict begin [/Subtype /Link/Dest (section.10.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 668 5550 a 62 w Fj(.)c(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)f(.)40 b(126)345 5714 y SDict begin H.S end 345 5714 a Fj(10.2.1)61 b(Notes)32 b(ab)s(out)e(HTTP)g(pro)m(xy)g(serv)m(ers)1968 5714 y SDict begin 13.6 H.L end 1968 5714 a 1968 5714 a SDict begin [/Subtype /Link/Dest (subsection.10.2.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1968 5714 a 34 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)40 b(127)p eop end %%Page: 6 6 TeXDict begin 6 5 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.vi) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(vi)3311 b Fh(CONTENTS)345 555 y SDict begin H.S end 345 555 a Fj(10.2.2)61 b(Notes)32 b(ab)s(out)e(HTTPS)f(and)h(FTPS)g(\014le)g(access)2322 555 y SDict begin 13.6 H.L end 2322 555 a 2322 555 a SDict begin [/Subtype /Link/Dest (subsection.10.2.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2322 555 a 34 w Fj(.)46 b(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(127)345 716 y SDict begin H.S end 345 716 a Fj(10.2.3)61 b(Notes)32 b(ab)s(out)e(the)h (stream)f(\014let)m(yp)s(e)h(driv)m(er)2161 716 y SDict begin 13.6 H.L end 2161 716 a 2161 716 a SDict begin [/Subtype /Link/Dest (subsection.10.2.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2161 716 a 54 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(128)345 876 y SDict begin H.S end 345 876 a Fj(10.2.4)61 b(Notes)32 b(ab)s(out)e(the)h (gsiftp)f(\014let)m(yp)s(e)1849 876 y SDict begin 13.6 H.L end 1849 876 a 1849 876 a SDict begin [/Subtype /Link/Dest (subsection.10.2.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1849 876 a 83 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(128)345 1037 y SDict begin H.S end 345 1037 a Fj(10.2.5)61 b(Notes)32 b(ab)s(out)e(the)h (ro)s(ot)f(\014let)m(yp)s(e)1793 1037 y SDict begin 13.6 H.L end 1793 1037 a 1793 1037 a SDict begin [/Subtype /Link/Dest (subsection.10.2.5) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1793 1037 a 68 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(129)345 1197 y SDict begin H.S end 345 1197 a Fj(10.2.6)61 b(Notes)32 b(ab)s(out)e(the)h (shmem)e(\014let)m(yp)s(e:)1932 1197 y SDict begin 13.6 H.L end 1932 1197 a 1932 1197 a SDict begin [/Subtype /Link/Dest (subsection.10.2.6) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1932 1197 a 70 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(131)136 1358 y SDict begin H.S end 136 1358 a Fj(10.3)49 b(Base)32 b(Filename)923 1358 y SDict begin 13.6 H.L end 923 1358 a 923 1358 a SDict begin [/Subtype /Link/Dest (section.10.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 923 1358 a 90 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)f(.)40 b(131)136 1518 y SDict begin H.S end 136 1518 a Fj(10.4)49 b(Output)30 b(File)h(Name)g(when)f(Op)s(ening)f(an)h(Existing)h(File) 2346 1518 y SDict begin 13.6 H.L end 2346 1518 a 2346 1518 a SDict begin [/Subtype /Link/Dest (section.10.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2346 1518 a 81 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h (.)g(.)f(.)40 b(133)136 1678 y SDict begin H.S end 136 1678 a Fj(10.5)49 b(T)-8 b(emplate)32 b(File)g(Name)f(when)e(Creating)i(a)g(New)f(File) 2228 1678 y SDict begin 13.6 H.L end 2228 1678 a 2228 1678 a SDict begin [/Subtype /Link/Dest (section.10.5) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2228 1678 a 57 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)f(.)40 b(135)136 1839 y SDict begin H.S end 136 1839 a Fj(10.6)49 b(Image)32 b(Tile-Compression)e(Sp)s(eci\014cation)1841 1839 y SDict begin 13.6 H.L end 1841 1839 a 1841 1839 a SDict begin [/Subtype /Link/Dest (section.10.6) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1841 1839 a 91 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(135)136 1999 y SDict begin H.S end 136 1999 a Fj(10.7)49 b(HDU)32 b(Lo)s(cation)f(Sp)s(eci\014cation)1461 1999 y SDict begin 13.6 H.L end 1461 1999 a 1461 1999 a SDict begin [/Subtype /Link/Dest (section.10.7) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1461 1999 a 47 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(135)136 2160 y SDict begin H.S end 136 2160 a Fj(10.8)49 b(Image)32 b(Section)903 2160 y SDict begin 13.6 H.L end 903 2160 a 903 2160 a SDict begin [/Subtype /Link/Dest (section.10.8) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 903 2160 a 39 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)f(.)40 b(137)136 2320 y SDict begin H.S end 136 2320 a Fj(10.9)49 b(Image)32 b(T)-8 b(ransform)29 b(Filters)1312 2320 y SDict begin 13.6 H.L end 1312 2320 a 1312 2320 a SDict begin [/Subtype /Link/Dest (section.10.9) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1312 2320 a 54 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(138)136 2481 y SDict begin H.S end 136 2481 a Fj(10.10)t(Column)30 b(and)g(Keyw)m(ord)g(Filtering)h (Sp)s(eci\014cation)2124 2481 y SDict begin 13.6 H.L end 2124 2481 a 2124 2481 a SDict begin [/Subtype /Link/Dest (section.10.10) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2124 2481 a 91 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(139)136 2641 y SDict begin H.S end 136 2641 a Fj(10.11)t(Ro)m(w)31 b(Filtering)h(Sp)s (eci\014cation)1426 2641 y SDict begin 13.6 H.L end 1426 2641 a 1426 2641 a SDict begin [/Subtype /Link/Dest (section.10.11) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1426 2641 a 82 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)40 b(142)345 2802 y SDict begin H.S end 345 2802 a Fj(10.11.1)16 b(General)32 b(Syn)m(tax)1251 2802 y SDict begin 13.6 H.L end 1251 2802 a 1251 2802 a SDict begin [/Subtype /Link/Dest (subsection.10.11.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1251 2802 a 44 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)f(.)40 b(143)345 2962 y SDict begin H.S end 345 2962 a Fj(10.11.2)16 b(Bit)32 b(Masks)1040 2962 y SDict begin 13.6 H.L end 1040 2962 a 1040 2962 a SDict begin [/Subtype /Link/Dest (subsection.10.11.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1040 2962 a 43 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(145)345 3123 y SDict begin H.S end 345 3123 a Fj(10.11.3)16 b(V)-8 b(ector)32 b(Columns)1274 3123 y SDict begin 13.6 H.L end 1274 3123 a 1274 3123 a SDict begin [/Subtype /Link/Dest (subsection.10.11.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1274 3123 a 92 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(146)345 3283 y SDict begin H.S end 345 3283 a Fj(10.11.4)16 b(Ro)m(w)31 b(Access)1102 3283 y SDict begin 13.6 H.L end 1102 3283 a 1102 3283 a SDict begin [/Subtype /Link/Dest (subsection.10.11.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1102 3283 a 52 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)f(.)40 b(148)345 3444 y SDict begin H.S end 345 3444 a Fj(10.11.5)16 b(Go)s(o)s(d)30 b(Time)h(In)m(terv)-5 b(al)31 b(Filtering)1799 3444 y SDict begin 13.6 H.L end 1799 3444 a 1799 3444 a SDict begin [/Subtype /Link/Dest (subsection.10.11.5) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1799 3444 a 62 w Fj(.)46 b(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(148)345 3604 y SDict begin H.S end 345 3604 a Fj(10.11.6)16 b(Spatial)31 b(Region)h(Filtering)1590 3604 y SDict begin 13.6 H.L end 1590 3604 a 1590 3604 a SDict begin [/Subtype /Link/Dest (subsection.10.11.6) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1590 3604 a 59 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(149)345 3764 y SDict begin H.S end 345 3764 a Fj(10.11.7)16 b(Example)31 b(Ro)m(w)g(Filters)1476 3764 y SDict begin 13.6 H.L end 1476 3764 a 1476 3764 a SDict begin [/Subtype /Link/Dest (subsection.10.11.7) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1476 3764 a 32 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(151)136 3925 y SDict begin H.S end 136 3925 a Fj(10.12)35 b(Binning)30 b(or)g(Histogramming)i(Sp)s(eci\014cation)1971 3925 y SDict begin 13.6 H.L end 1971 3925 a 1971 3925 a SDict begin [/Subtype /Link/Dest (section.10.12) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1971 3925 a 31 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.) f(.)40 b(152)0 4178 y SDict begin H.S end 0 4178 a Fi(11)32 b(T)-9 b(emplate)35 b(Files)845 4178 y SDict begin 13.6 H.L end 845 4178 a 845 4178 a SDict begin [/Subtype /Link/Dest (chapter.11) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 845 4178 a 2898 w Fi(155)136 4338 y SDict begin H.S end 136 4338 a Fj(11.1)49 b(Detailed)33 b(T)-8 b(emplate)31 b(Line)g(F)-8 b(ormat)1601 4338 y SDict begin 13.6 H.L end 1601 4338 a 1601 4338 a SDict begin [/Subtype /Link/Dest (section.11.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1601 4338 a 48 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h (.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.) h(.)g(.)f(.)h(.)g(.)f(.)40 b(155)136 4498 y SDict begin H.S end 136 4498 a Fj(11.2)49 b(Auto-indexing)31 b(of)g(Keyw)m(ords)1435 4498 y SDict begin 13.6 H.L end 1435 4498 a 1435 4498 a SDict begin [/Subtype /Link/Dest (section.11.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1435 4498 a 73 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(156)136 4659 y SDict begin H.S end 136 4659 a Fj(11.3)49 b(T)-8 b(emplate)32 b(P)m(arser)f(Directiv)m(es)1421 4659 y SDict begin 13.6 H.L end 1421 4659 a 1421 4659 a SDict begin [/Subtype /Link/Dest (section.11.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1421 4659 a 87 w Fj(.)45 b(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)f(.)40 b(157)136 4819 y SDict begin H.S end 136 4819 a Fj(11.4)49 b(F)-8 b(ormal)32 b(T)-8 b(emplate)32 b(Syn)m(tax)1332 4819 y SDict begin 13.6 H.L end 1332 4819 a 1332 4819 a SDict begin [/Subtype /Link/Dest (section.11.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1332 4819 a 34 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(158)136 4980 y SDict begin H.S end 136 4980 a Fj(11.5)49 b(Errors)596 4980 y SDict begin 13.6 H.L end 596 4980 a 596 4980 a SDict begin [/Subtype /Link/Dest (section.11.5) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 596 4980 a 63 w Fj(.)d(.)f(.)h(.)g(.)g(.)f(.)h (.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)f(.)40 b(158)136 5140 y SDict begin H.S end 136 5140 a Fj(11.6)49 b(Examples)728 5140 y SDict begin 13.6 H.L end 728 5140 a 728 5140 a SDict begin [/Subtype /Link/Dest (section.11.6) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 728 5140 a 72 w Fj(.)d(.)g(.)g(.)f(.)h(.)g (.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f (.)40 b(158)0 5393 y SDict begin H.S end 0 5393 a Fi(12)67 b(Lo)s(cal)35 b(FITS)g(Con)m(v)m(en)m(tions)1316 5393 y SDict begin 13.6 H.L end 1316 5393 a 1316 5393 a SDict begin [/Subtype /Link/Dest (chapter.12) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1316 5393 a 2427 w Fi(161)136 5553 y SDict begin H.S end 136 5553 a Fj(12.1)49 b(64-Bit)33 b(Long)e(In)m(tegers)1164 5553 y SDict begin 13.6 H.L end 1164 5553 a 1164 5553 a SDict begin [/Subtype /Link/Dest (section.12.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1164 5553 a 61 w Fj(.)45 b(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.) 40 b(161)136 5714 y SDict begin H.S end 136 5714 a Fj(12.2)49 b(Long)31 b(String)f(Keyw)m (ord)g(V)-8 b(alues.)1513 5714 y SDict begin 13.6 H.L end 1513 5714 a 1513 5714 a SDict begin [/Subtype /Link/Dest (section.12.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1513 5714 a 65 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)f(.)40 b(161)p eop end %%Page: 7 7 TeXDict begin 7 6 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.vii) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(CONTENTS)3284 b Fj(vii)136 555 y SDict begin H.S end 136 555 a Fj(12.3)49 b(Arra)m(ys)31 b(of)f(Fixed-Length)i(Strings)d(in)h(Binary)h(T)-8 b(ables)2278 555 y SDict begin 13.6 H.L end 2278 555 a 2278 555 a SDict begin [/Subtype /Link/Dest (section.12.3) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2278 555 a 78 w Fj(.)46 b(.)f(.)h(.)g(.)g (.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)40 b(163)136 715 y SDict begin H.S end 136 715 a Fj(12.4)49 b(Keyw)m(ord)31 b(Units)f(Strings)1254 715 y SDict begin 13.6 H.L end 1254 715 a 1254 715 a SDict begin [/Subtype /Link/Dest (section.12.4) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1254 715 a 41 w Fj(.)46 b(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.) f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f (.)h(.)g(.)f(.)40 b(163)136 876 y SDict begin H.S end 136 876 a Fj(12.5)49 b(HIERAR)m(CH)31 b(Con)m(v)m(en)m(tion)h(for)e(Extended)g(Keyw)m(ord)g (Names)2548 876 y SDict begin 13.6 H.L end 2548 876 a 2548 876 a SDict begin [/Subtype /Link/Dest (section.12.5) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 2548 876 a 91 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.) 40 b(163)136 1036 y SDict begin H.S end 136 1036 a Fj(12.6)49 b(Tile-Compressed)31 b(Image)g(F)-8 b(ormat)1597 1036 y SDict begin 13.6 H.L end 1597 1036 a 1597 1036 a SDict begin [/Subtype /Link/Dest (section.12.6) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1597 1036 a 52 w Fj(.)46 b(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.) f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f (.)40 b(164)0 1287 y SDict begin H.S end 0 1287 a Fi(13)67 b(Optimizing)35 b(Programs)1191 1287 y SDict begin 13.6 H.L end 1191 1287 a 1191 1287 a SDict begin [/Subtype /Link/Dest (chapter.13) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1191 1287 a 2552 w Fi(167)136 1447 y SDict begin H.S end 136 1447 a Fj(13.1)49 b(Ho)m(w)32 b(CFITSIO)c(Manages)k(Data)g(I/O)1712 1447 y SDict begin 13.6 H.L end 1712 1447 a 1712 1447 a SDict begin [/Subtype /Link/Dest (section.13.1) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1712 1447 a 78 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.) g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g (.)f(.)40 b(167)136 1607 y SDict begin H.S end 136 1607 a Fj(13.2)49 b(Optimization)32 b(Strategies)1289 1607 y SDict begin 13.6 H.L end 1289 1607 a 1289 1607 a SDict begin [/Subtype /Link/Dest (section.13.2) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1289 1607 a 77 w Fj(.)46 b(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f (.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.)h(.)g(.)g(.)f(.)h(.)g(.)f(.) h(.)g(.)f(.)40 b(168)0 1858 y SDict begin H.S end 0 1858 a Fi(A)57 b(Index)35 b(of)g(Routines)990 1858 y SDict begin 13.6 H.L end 990 1858 a 990 1858 a SDict begin [/Subtype /Link/Dest (appendix.A) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 990 1858 a 2753 w Fi(173)0 2109 y SDict begin H.S end 0 2109 a Fi(B)62 b(P)m(arameter)35 b(De\014nitions)1181 2109 y SDict begin 13.6 H.L end 1181 2109 a 1181 2109 a SDict begin [/Subtype /Link/Dest (appendix.B) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1181 2109 a 2562 w Fi(179)0 2360 y SDict begin H.S end 0 2360 a Fi(C)60 b(CFITSIO)33 b(Error)i(Status)f(Co)s(des)1523 2360 y SDict begin 13.6 H.L end 1523 2360 a 1523 2360 a SDict begin [/Subtype /Link/Dest (appendix.C) cvn/H /I/Border [0 0 1]BorderArrayPatch/Color [1 0 0] H.B /ANN pdfmark end 1523 2360 a 2220 w Fi(185)p eop end %%Page: 8 8 TeXDict begin 8 7 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.viii) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(viii)3261 b Fh(CONTENTS)p eop end %%Page: 1 9 TeXDict begin 1 8 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.1) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.1) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(1)0 1687 y Fm(In)-6 b(tro)6 b(duction)0 2020 y SDict begin H.S end 0 2020 a 0 2020 a SDict begin 13.6 H.A end 0 2020 a 0 2020 a SDict begin [/View [/XYZ H.V]/Dest (section.1.1) cvn /DEST pdfmark end 0 2020 a 196 x Ff(1.1)180 b(A)45 b(Brief)g(Ov)l(erview)0 2495 y Fj(CFITSIO)22 b(is)h(a)g(mac)m (hine-indep)s(enden)m(t)g(library)g(of)g(routines)h(for)e(reading)i (and)e(writing)h(data)h(\014les)f(in)g(the)h(FITS)0 2608 y(\(Flexible)30 b(Image)e(T)-8 b(ransp)s(ort)27 b(System\))i(data)f (format.)40 b(It)29 b(can)f(also)h(read)f(IRAF)g(format)g(image)h (\014les)f(and)g(ra)m(w)0 2721 y(binary)39 b(data)i(arra)m(ys)g(b)m(y)f (con)m(v)m(erting)i(them)e(on)g(the)g(\015y)g(in)m(to)h(a)f(virtual)h (FITS)e(format)i(\014le.)70 b(This)39 b(library)0 2833 y(is)c(written)g(in)g(ANSI)f(C)h(and)f(pro)m(vides)h(a)h(p)s(o)m(w)m (erful)e(y)m(et)i(simple)f(in)m(terface)i(for)e(accessing)h(FITS)e (\014les)h(whic)m(h)0 2946 y(will)c(run)f(on)h(most)g(commonly)h(used)e (computers)h(and)f(w)m(orkstations.)44 b(CFITSIO)29 b(supp)s(orts)h (all)h(the)h(features)0 3059 y(describ)s(ed)39 b(in)g(the)h(o\016cial)i (de\014nition)d(of)h(the)g(FITS)f(format)i(and)e(can)h(read)g(and)f (write)h(all)h(the)f(curren)m(tly)0 3172 y(de\014ned)g(t)m(yp)s(es)h (of)g(extensions,)j(including)d(ASCI)s(I)e(tables)j(\(T)-8 b(ABLE\),)42 b(Binary)f(tables)h(\(BINT)-8 b(ABLE\))43 b(and)0 3285 y(IMA)m(GE)30 b(extensions.)41 b(The)28 b(CFITSIO)f(routines)i(insulate)h(the)f(programmer)f(from)h(ha)m(ving)g (to)h(deal)f(with)g(the)0 3398 y(complicated)36 b(formatting)g(details) g(in)e(the)h(FITS)f(\014le,)i(ho)m(w)m(ev)m(er,)h(it)e(is)g(assumed)f (that)h(users)f(ha)m(v)m(e)i(a)f(general)0 3511 y(kno)m(wledge)c(ab)s (out)f(the)h(structure)f(and)g(usage)h(of)f(FITS)g(\014les.)0 3671 y(CFITSIO)k(also)j(con)m(tains)h(a)e(set)h(of)f(F)-8 b(ortran)36 b(callable)i(wrapp)s(er)d(routines)g(whic)m(h)h(allo)m(w)i (F)-8 b(ortran)36 b(programs)0 3784 y(to)31 b(call)g(the)f(CFITSIO)e (routines.)41 b(See)30 b(the)g(companion)g(\\FITSIO)f(User's)h(Guide")g (for)g(the)g(de\014nition)g(of)g(the)0 3897 y(F)-8 b(ortran)39 b(subroutine)d(calling)k(sequences.)63 b(These)38 b(wrapp)s(ers)e (replace)j(the)f(older)g(F)-8 b(ortran)39 b(FITSIO)d(library)0 4010 y(whic)m(h)30 b(is)h(no)f(longer)h(supp)s(orted.)0 4170 y(The)20 b(CFITSIO)f(pac)m(k)-5 b(age)23 b(w)m(as)e(initially)i (dev)m(elop)s(ed)e(b)m(y)f(the)h(HEASAR)m(C)g(\(High)h(Energy)e (Astroph)m(ysics)h(Science)0 4283 y(Arc)m(hiv)m(e)35 b(Researc)m(h)g(Cen)m(ter\))f(at)h(the)f(NASA)g(Go)s(ddard)e(Space)j (Fligh)m(t)g(Cen)m(ter)f(to)h(con)m(v)m(ert)g(v)-5 b(arious)34 b(existing)0 4396 y(and)25 b(newly)h(acquired)g(astronomical)i(data)e (sets)h(in)m(to)g(FITS)e(format)h(and)f(to)i(further)e(analyze)i(data)g (already)f(in)0 4509 y(FITS)h(format.)41 b(New)28 b(features)g(con)m (tin)m(ue)h(to)g(b)s(e)e(added)h(to)g(CFITSIO)f(in)g(large)i(part)f (due)g(to)g(con)m(tributions)h(of)0 4622 y(ideas)k(or)g(actual)h(co)s (de)f(from)f(users)g(of)h(the)g(pac)m(k)-5 b(age.)49 b(The)33 b(In)m(tegral)h(Science)f(Data)h(Cen)m(ter)f(in)g (Switzerland,)0 4734 y(and)g(the)g(XMM/ESTEC)h(pro)5 b(ject)34 b(in)f(The)g(Netherlands)g(made)g(esp)s(ecially)i (signi\014can)m(t)f(con)m(tributions)g(that)0 4847 y(resulted)c(in)g (man)m(y)h(of)f(the)h(new)f(features)g(that)h(app)s(eared)f(in)g(v2.0)i (of)e(CFITSIO.)0 5143 y SDict begin H.S end 0 5143 a 0 5143 a SDict begin 13.6 H.A end 0 5143 a 0 5143 a SDict begin [/View [/XYZ H.V]/Dest (section.1.2) cvn /DEST pdfmark end 0 5143 a 179 x Ff(1.2)135 b(Sources)45 b(of)g(FITS)f(Soft)l(w)l (are)i(and)f(Information)0 5601 y Fj(The)22 b(latest)i(v)m(ersion)f(of) g(the)f(CFITSIO)f(source)i(co)s(de,)h(do)s(cumen)m(tation,)i(and)21 b(example)j(programs)e(are)h(a)m(v)-5 b(ailable)0 5714 y(on)30 b(the)h(W)-8 b(eb)31 b(or)f(via)h(anon)m(ymous)g(ftp)e(from:) 1927 5942 y(1)p eop end %%Page: 2 10 TeXDict begin 2 9 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.2) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(2)2452 b Fh(CHAPTER)30 b(1.)71 b(INTR)m(ODUCTION)382 555 y Fe (http://heasarc.gsfc.nasa)o(.go)o(v/fi)o(tsio)382 668 y(ftp://legacy.gsfc.nasa.g)o(ov/)o(soft)o(ware)o(/fi)o(tsio)o(/c)0 933 y Fj(An)m(y)28 b(questions,)g(bug)f(rep)s(orts,)h(or)f(suggested)i (enhancemen)m(ts)f(related)g(to)h(the)e(CFITSIO)f(pac)m(k)-5 b(age)30 b(should)d(b)s(e)0 1045 y(sen)m(t)k(to)g(the)g(FTOOLS)e(Help)h (Desk)h(at)g(the)g(HEASAR)m(C:)382 1310 y Fe(http://heasarc.gsfc.nasa)o (.go)o(v/cg)o(i-bi)o(n/f)o(tool)o(shel)o(p)0 1574 y Fj(This)40 b(User's)i(Guide)f(assumes)g(that)h(readers)f(already)g(ha)m(v)m(e)i(a) f(general)g(understanding)d(of)j(the)f(de\014nition)0 1687 y(and)31 b(structure)g(of)h(FITS)e(format)i(\014les.)44 b(F)-8 b(urther)32 b(information)f(ab)s(out)h(FITS)f(formats)g(is)h(a)m (v)-5 b(ailable)34 b(from)d(the)0 1800 y(FITS)37 b(Supp)s(ort)f (O\016ce)i(at)h Fe(http://fits.gsfc.nasa.g)o(ov)p Fj(.)57 b(In)37 b(particular,)j(the)e('FITS)g(Standard')f(giv)m(es)0 1913 y(the)31 b(authoritativ)m(e)j(de\014nition)d(of)g(the)h(FITS)e (data)i(format.)43 b(Other)31 b(do)s(cumen)m(ts)g(a)m(v)-5 b(ailable)34 b(at)d(that)h(W)-8 b(eb)32 b(site)0 2026 y(pro)m(vide)e(additional)i(historical)f(bac)m(kground)g(and)e (practical)j(advice)g(on)e(using)g(FITS)f(\014les.)0 2186 y(The)d(HEASAR)m(C)f(also)i(pro)m(vides)f(a)h(v)m(ery)f (sophisticated)h(FITS)e(\014le)i(analysis)f(program)g(called)h(`Fv')g (whic)m(h)f(can)0 2299 y(b)s(e)31 b(used)f(to)i(displa)m(y)f(and)g (edit)g(the)h(con)m(ten)m(ts)g(of)g(an)m(y)f(FITS)g(\014le)g(as)g(w)m (ell)h(as)g(construct)f(new)g(FITS)f(\014les)h(from)0 2412 y(scratc)m(h.)56 b(Fv)36 b(is)f(freely)h(a)m(v)-5 b(ailable)37 b(for)e(most)h(Unix)f(platforms,)i(Mac)f(PCs,)g(and)f (Windo)m(ws)g(PCs.)54 b(CFITSIO)0 2525 y(users)29 b(ma)m(y)h(also)h(b)s (e)f(in)m(terested)g(in)g(the)g(FTOOLS)f(pac)m(k)-5 b(age)31 b(of)g(programs)e(that)h(can)h(b)s(e)e(used)g(to)i(manipulate)0 2638 y(and)f(analyze)i(FITS)d(format)i(\014les.)41 b(Fv)30 b(and)g(FTOOLS)f(are)i(a)m(v)-5 b(ailable)32 b(from)e(their)h(resp)s (ectiv)m(e)g(W)-8 b(eb)31 b(sites)g(at:)382 2902 y Fe (http://fv.gsfc.nasa.gov)382 3015 y(http://heasarc.gsfc.nasa)o(.go)o (v/ft)o(ools)0 3178 y SDict begin H.S end 0 3178 a 0 3178 a SDict begin 13.6 H.A end 0 3178 a 0 3178 a SDict begin [/View [/XYZ H.V]/Dest (section.1.3) cvn /DEST pdfmark end 0 3178 a 176 x Ff(1.3)135 b(Ac)l(kno)l(wledgmen)l(ts)0 3605 y Fj(The)27 b(dev)m(elopmen)m(t)h(of)g(the)f(man)m(y)g(p)s(o)m(w)m (erful)g(features)h(in)f(CFITSIO)e(w)m(as)j(made)f(p)s(ossible)g (through)f(collab)s(ora-)0 3718 y(tions)33 b(with)e(man)m(y)i(p)s (eople)f(or)g(organizations)i(from)e(around)f(the)h(w)m(orld.)46 b(The)32 b(follo)m(wing)h(in)f(particular)h(ha)m(v)m(e)0 3831 y(made)d(esp)s(ecially)i(signi\014can)m(t)f(con)m(tributions:)0 3991 y(Programmers)25 b(from)h(the)f(In)m(tegral)i(Science)g(Data)g (Cen)m(ter,)g(Switzerland)f(\(namely)-8 b(,)28 b(Jurek)c(Bork)m(o)m (wski,)29 b(Bruce)0 4104 y(O'Neel,)34 b(and)e(Don)h(Jennings\),)f (designed)g(the)h(concept)g(for)f(the)h(plug-in)f(I/O)g(driv)m(ers)g (that)h(w)m(as)g(in)m(tro)s(duced)0 4217 y(with)i(CFITSIO)e(2.0.)56 b(The)34 b(use)h(of)g(`driv)m(ers')g(greatly)h(simpli\014ed)f(the)g(lo) m(w-lev)m(el)j(I/O,)d(whic)m(h)f(in)h(turn)f(made)0 4330 y(other)40 b(new)f(features)i(in)e(CFITSIO)f(\(e.g.,)45 b(supp)s(ort)38 b(for)h(compressed)h(FITS)f(\014les)h(and)f(supp)s(ort) f(for)i(IRAF)0 4443 y(format)32 b(image)g(\014les\))g(m)m(uc)m(h)f (easier)i(to)f(implemen)m(t.)44 b(Jurek)31 b(Bork)m(o)m(wski)h(wrote)g (the)g(Shared)e(Memory)i(driv)m(er,)0 4556 y(and)23 b(Bruce)i(O'Neel)g (wrote)f(the)g(driv)m(ers)g(for)f(accessing)j(FITS)d(\014les)h(o)m(v)m (er)h(the)f(net)m(w)m(ork)h(using)e(the)i(FTP)-8 b(,)24 b(HTTP)-8 b(,)0 4669 y(and)26 b(R)m(OOT)g(proto)s(cols.)41 b(Also,)28 b(in)e(2009,)k(Bruce)d(O'Neel)h(w)m(as)f(the)g(k)m(ey)g(dev) m(elop)s(er)g(of)g(the)g(thread-safe)g(v)m(ersion)0 4782 y(of)k(CFITSIO.)0 4942 y(The)45 b(ISDC)g(also)h(pro)m(vided)f(the)h (template)h(parsing)e(routines)g(\(written)h(b)m(y)f(Jurek)g(Bork)m(o)m (wski\))i(and)e(the)0 5055 y(hierarc)m(hical)39 b(grouping)d(routines)h (\(written)h(b)m(y)f(Don)h(Jennings\).)60 b(The)37 b(ISDC)f(D)m(AL)i (\(Data)h(Access)f(La)m(y)m(er\))0 5168 y(routines)30 b(are)h(la)m(y)m(ered)h(on)e(top)h(of)f(CFITSIO)f(and)h(mak)m(e)h (extensiv)m(e)h(use)e(of)h(these)g(features.)0 5328 y(Giuliano)g(T)-8 b(a\013oni)31 b(and)f(Andrea)g(Barisani,)i(at)f(INAF,)g(Univ)m(ersit)m (y)h(of)e(T)-8 b(rieste,)32 b(Italy)-8 b(,)32 b(implemen)m(ted)e(the)h (I/O)0 5441 y(driv)m(er)f(routines)g(for)h(accessing)g(FITS)f(\014les)g (on)h(the)f(computational)i(grids)e(using)g(the)h(gridftp)e(proto)s (col.)0 5601 y(Uw)m(e)c(Lammers)e(\(XMM/ESA/ESTEC,)h(The)g (Netherlands\))g(designed)g(the)g(high-p)s(erformance)f(lexical)j (pars-)0 5714 y(ing)42 b(algorithm)h(that)f(is)g(used)f(to)i(do)e (on-the-\015y)h(\014ltering)g(of)g(FITS)f(tables.)76 b(This)41 b(algorithm)i(essen)m(tially)p eop end %%Page: 3 11 TeXDict begin 3 10 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.3) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(1.3.)72 b(A)m(CKNO)m(WLEDGMENTS)2623 b Fj(3)0 555 y(pre-compiles)36 b(the)g(user-supplied)e(selection)k(expression)d(in)m(to)i(a)f(form)g (that)g(can)g(b)s(e)f(rapidly)g(ev)-5 b(aluated)37 b(for)0 668 y(eac)m(h)31 b(ro)m(w.)40 b(P)m(eter)31 b(Wilson)f(\(RSTX,)f (NASA/GSF)m(C\))i(then)e(wrote)h(the)g(parsing)f(routines)g(used)g(b)m (y)g(CFITSIO)0 781 y(based)i(on)f(Lammers')h(design,)g(com)m(bined)g (with)g(other)g(tec)m(hniques)g(suc)m(h)g(as)g(the)g(CFITSIO)f (iterator)i(routine)0 894 y(to)g(further)e(enhance)h(the)h(data)g(pro)s (cessing)f(throughput.)42 b(This)31 b(e\013ort)h(also)g(b)s(ene\014ted) e(from)h(a)h(m)m(uc)m(h)f(earlier)0 1007 y(lexical)25 b(parsing)f(routine)f(that)h(w)m(as)g(dev)m(elop)s(ed)g(b)m(y)g(Ken)m (t)g(Blac)m(kburn)f(\(NASA/GSF)m(C\).)i(More)g(recen)m(tly)-8 b(,)27 b(Craig)0 1120 y(Markw)m(ardt)i(\(NASA/GSF)m(C\))g(implemen)m (ted)g(additional)g(functions)f(\(median,)h(a)m(v)m(erage,)j(stddev\))c (and)g(other)0 1233 y(enhancemen)m(ts)j(to)g(the)g(lexical)h(parser.)0 1393 y(The)40 b(CFITSIO)g(iterator)i(function)e(is)h(lo)s(osely)h (based)f(on)f(similar)i(ideas)f(dev)m(elop)s(ed)g(for)g(the)g(XMM)g (Data)0 1506 y(Access)31 b(La)m(y)m(er.)0 1666 y(P)m(eter)25 b(Wilson)g(\(RSTX,)f(NASA/GSF)m(C\))h(wrote)g(the)f(complete)i(set)e (of)h(F)-8 b(ortran-callable)27 b(wrapp)s(ers)22 b(for)i(all)h(the)0 1779 y(CFITSIO)k(routines,)h(whic)m(h)g(in)g(turn)g(rely)g(on)h(the)f (CF)m(OR)-8 b(TRAN)31 b(macro)g(dev)m(elop)s(ed)g(b)m(y)f(Burkhard)f (Buro)m(w.)0 1939 y(The)h(syn)m(tax)i(used)e(b)m(y)h(CFITSIO)f(for)g (\014ltering)i(or)f(binning)e(input)h(FITS)h(\014les)g(is)g(based)f(on) h(ideas)h(dev)m(elop)s(ed)0 2052 y(for)41 b(the)g(AXAF)h(Science)g(Cen) m(ter)g(Data)h(Mo)s(del)e(b)m(y)g(Jonathan)g(McDo)m(w)m(ell,)47 b(An)m(tonella)c(F)-8 b(ruscione,)45 b(Aneta)0 2165 y(Siemigino)m(wsk) -5 b(a)27 b(and)e(Bill)i(Jo)m(y)m(e.)41 b(See)26 b(h)m (ttp://heasarc.gsfc.nasa.go)m(v/do)s(cs/journal/axa)q(f7.h)m(t)q(ml)32 b(for)25 b(further)0 2278 y(description)30 b(of)h(the)g(AXAF)g(Data)h (Mo)s(del.)0 2438 y(The)j(\014le)g(decompression)g(co)s(de)g(w)m(ere)h (tak)m(en)g(directly)g(from)e(the)i(gzip)f(\(GNU)h(zip\))g(program)f (dev)m(elop)s(ed)g(b)m(y)0 2551 y(Jean-loup)30 b(Gailly)i(and)e (others.)0 2711 y(The)e(new)h(compressed)g(image)h(data)g(format)f (\(where)g(the)g(image)h(is)f(tiled)h(and)e(the)h(compressed)g(b)m(yte) h(stream)0 2824 y(from)k(eac)m(h)i(tile)h(is)d(stored)h(in)g(a)g (binary)f(table\))j(w)m(as)e(implemen)m(ted)g(in)g(collab)s(oration)i (with)d(Ric)m(hard)h(White)0 2937 y(\(STScI\),)30 b(P)m(erry)g (Green\014eld)h(\(STScI\))f(and)f(Doug)i(T)-8 b(o)s(dy)30 b(\(NO)m(A)m(O\).)0 3097 y(Doug)h(Mink)g(\(SA)m(O\))f(pro)m(vided)g (the)h(routines)f(for)g(con)m(v)m(erting)j(IRAF)d(format)h(images)g(in) m(to)h(FITS)d(format.)0 3257 y(Martin)k(Reinec)m(k)m(e)i(\(Max)f(Planc) m(k)f(Institute,)h(Garc)m(hing\)\))g(pro)m(vided)f(the)g(mo)s (di\014cations)f(to)i(cfortran.h)e(that)0 3370 y(are)d(necessary)h(to)f (supp)s(ort)e(64-bit)k(in)m(teger)f(v)-5 b(alues)29 b(when)f(calling)i (C)f(routines)g(from)f(fortran)h(programs.)39 b(The)0 3483 y(cfortran.h)30 b(macros)h(w)m(ere)g(originally)h(dev)m(elop)s(ed) e(b)m(y)h(Burkhard)e(Buro)m(w)h(\(CERN\).)0 3643 y(Julian)f(T)-8 b(a)m(ylor)31 b(\(ESO,)e(Garc)m(hing\))i(pro)m(vided)e(the)g(fast)h(b)m (yte-sw)m(apping)g(algorithms)h(that)f(use)f(the)h(SSE2)f(and)0 3756 y(SSSE3)g(mac)m(hine)i(instructions)f(a)m(v)-5 b(ailable)33 b(on)d(x86)p 1784 3756 28 4 v 34 w(64)h(CPUs.)0 3916 y(In)c(addition,)i(man)m(y)f(other)g(p)s(eople)g(ha)m(v)m(e)h(made)f(v) -5 b(aluable)29 b(con)m(tributions)f(to)h(the)f(dev)m(elopmen)m(t)h(of) f(CFITSIO.)0 4029 y(These)i(include)g(\(with)h(ap)s(ologies)h(to)f (others)f(that)h(ma)m(y)g(ha)m(v)m(e)h(inadv)m(erten)m(tly)g(b)s(een)d (omitted\):)0 4189 y(Stev)m(e)g(Allen,)g(Carl)f(Ak)m(erlof,)h(Keith)f (Arnaud,)g(Morten)g(Krabb)s(e)e(Barfo)s(ed,)j(Ken)m(t)f(Blac)m(kburn,)h (G)f(Bo)s(dammer,)0 4302 y(Romk)m(e)h(Bon)m(tek)m(o)s(e,)i(Lucio)d (Chiapp)s(etti,)g(Keith)g(Costorf,)g(Robin)g(Corb)s(et,)g(John)e(Da)m (vis,)k(Ric)m(hard)e(Fink,)h(Ning)0 4415 y(Gan,)i(Emily)f(Greene,)h (Gretc)m(hen)g(Green,)f(Jo)s(e)g(Harrington,)h(Cheng)f(Ho,)h(Phil)f(Ho) s(dge,)g(Jim)g(Ingham,)g(Y)-8 b(oshi-)0 4528 y(tak)j(a)44 b(Ishisaki,)i(Diab)e(Jerius,)h(Mark)f(Levine,)i(T)-8 b(o)s(dd)42 b(Karak)-5 b(askian,)47 b(Edw)m(ard)42 b(King,)k(Scott)e (Ko)s(c)m(h,)i(Claire)0 4641 y(Larkin,)32 b(Rob)g(Managan,)i(Eric)e (Mandel,)h(Ric)m(hard)f(Mathar,)h(John)e(Matto)m(x,)k(Carsten)d(Mey)m (er,)i(Emi)d(Miy)m(ata,)0 4754 y(Stefan)39 b(Mo)s(c)m(hnac)m(ki,)k(Mik) m(e)e(Noble,)h(Oliv)m(er)e(Ob)s(erdorf,)f(Cliv)m(e)i(P)m(age,)i(Arvind) 38 b(P)m(armar,)j(Je\013)f(P)m(edelt)m(y)-8 b(,)43 b(Tim)0 4867 y(P)m(earson,)d(Philipp)s(e)c(Prugniel,)j(Maren)e(Purv)m(es,)i (Scott)g(Randall,)g(Chris)d(Rogers,)k(Arnold)d(Rots,)i(Rob)e(Sea-)0 4979 y(man,)23 b(Barry)e(Sc)m(hlesinger,)i(Robin)e(Stebbins,)h(Andrew)d (Szymk)m(o)m(wiak,)25 b(Allyn)c(T)-8 b(ennan)m(t,)23 b(P)m(eter)f(T)-8 b(eub)s(en,)22 b(James)0 5092 y(Theiler,)k(Doug)g(T) -8 b(o)s(dy)g(,)25 b(Shiro)f(Ueno,)j(Stev)m(e)f(W)-8 b(alton,)28 b(Arc)m(hie)d(W)-8 b(arno)s(c)m(k,)27 b(Alan)e(W)-8 b(atson,)28 b(Dan)d(Whipple,)h(Wim)0 5205 y(Wimmers,)31 b(P)m(eter)g(Y)-8 b(oung,)31 b(Jianjun)e(Xu,)h(and)g(Nelson)h(Zarate.)p eop end %%Page: 4 12 TeXDict begin 4 11 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.4) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(4)2452 b Fh(CHAPTER)30 b(1.)71 b(INTR)m(ODUCTION)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (section.1.4) cvn /DEST pdfmark end 0 464 a 91 x Ff(1.4)135 b(Legal)46 b(Stu\013)0 805 y Fj(Cop)m(yrigh)m(t)37 b(\(Unpublished{all)g(righ)m (ts)g(reserv)m(ed)g(under)e(the)i(cop)m(yrigh)m(t)h(la)m(ws)f(of)g(the) g(United)g(States\),)j(U.S.)0 918 y(Go)m(v)m(ernmen)m(t)30 b(as)g(represen)m(ted)e(b)m(y)h(the)g(Administrator)g(of)g(the)g (National)h(Aeronautics)g(and)e(Space)h(Adminis-)0 1031 y(tration.)42 b(No)31 b(cop)m(yrigh)m(t)g(is)g(claimed)g(in)f(the)h (United)f(States)h(under)e(Title)j(17,)f(U.S.)f(Co)s(de.)0 1191 y(P)m(ermission)g(to)g(freely)f(use,)h(cop)m(y)-8 b(,)31 b(mo)s(dify)-8 b(,)29 b(and)g(distribute)g(this)g(soft)m(w)m (are)i(and)e(its)h(do)s(cumen)m(tation)g(without)0 1304 y(fee)f(is)f(hereb)m(y)g(gran)m(ted,)i(pro)m(vided)e(that)h(this)f(cop) m(yrigh)m(t)i(notice)f(and)f(disclaimer)h(of)f(w)m(arran)m(t)m(y)i(app) s(ears)d(in)h(all)0 1417 y(copies.)0 1577 y(DISCLAIMER:)0 1737 y(THE)33 b(SOFTW)-10 b(ARE)32 b(IS)g(PR)m(O)m(VIDED)i('AS)f(IS')g (WITHOUT)f(ANY)i(W)-10 b(ARRANTY)33 b(OF)g(ANY)h(KIND,)f(EI-)0 1850 y(THER)42 b(EXPRESSED,)f(IMPLIED,)i(OR)e(ST)-8 b(A)g(TUTOR)g(Y,)43 b(INCLUDING,)f(BUT)h(NOT)e(LIMITED)h(TO,)0 1963 y(ANY)33 b(W)-10 b(ARRANTY)33 b(THA)-8 b(T)32 b(THE)g(SOFTW)-10 b(ARE)32 b(WILL)g(CONF)m(ORM)g(TO)g(SPECIFICA)-8 b(TIONS,)30 b(ANY)0 2076 y(IMPLIED)38 b(W)-10 b(ARRANTIES)37 b(OF)h(MER)m(CHANT)-8 b(ABILITY,)38 b(FITNESS)f(F)m(OR)h(A)g(P)-8 b(AR)g(TICULAR)38 b(PUR-)0 2189 y(POSE,)24 b(AND)i(FREEDOM)f(FR)m(OM)h(INFRINGEMENT,)g (AND)f(ANY)h(W)-10 b(ARRANTY)25 b(THA)-8 b(T)25 b(THE)g(DOC-)0 2302 y(UMENT)-8 b(A)g(TION)31 b(WILL)f(CONF)m(ORM)h(TO)e(THE)h(SOFTW) -10 b(ARE,)30 b(OR)g(ANY)h(W)-10 b(ARRANTY)31 b(THA)-8 b(T)30 b(THE)0 2415 y(SOFTW)-10 b(ARE)31 b(WILL)h(BE)g(ERR)m(OR)g (FREE.)g(IN)g(NO)g(EVENT)f(SHALL)g(NASA)h(BE)g(LIABLE)g(F)m(OR)g(ANY)0 2528 y(D)m(AMA)m(GES,)26 b(INCLUDING,)e(BUT)f(NOT)g(LIMITED)h(TO,)f (DIRECT,)g(INDIRECT,)g(SPECIAL)f(OR)h(CON-)0 2641 y(SEQUENTIAL)28 b(D)m(AMA)m(GES,)k(ARISING)d(OUT)g(OF,)h(RESUL)-8 b(TING)29 b(FR)m(OM,)h(OR)f(IN)h(ANY)g(W)-10 b(A)i(Y)30 b(CON-)0 2754 y(NECTED)25 b(WITH)g(THIS)f(SOFTW)-10 b(ARE,)25 b(WHETHER)g(OR)g(NOT)g(BASED)g(UPON)g(W)-10 b(ARRANTY,)26 b(CON-)0 2867 y(TRA)m(CT,)d(TOR)-8 b(T)23 b(,)g(OR)g(OTHER)-10 b(WISE,)22 b(WHETHER)i(OR)f(NOT)f(INJUR)-8 b(Y)24 b(W)-10 b(AS)23 b(SUST)-8 b(AINED)23 b(BY)h(PER-)0 2979 y(SONS)h(OR)i(PR)m (OPER)-8 b(TY)26 b(OR)g(OTHER)-10 b(WISE,)26 b(AND)h(WHETHER)g(OR)f (NOT)g(LOSS)f(W)-10 b(AS)26 b(SUST)-8 b(AINED)0 3092 y(FR)m(OM,)37 b(OR)e(AR)m(OSE)h(OUT)f(OF)h(THE)g(RESUL)-8 b(TS)35 b(OF,)h(OR)f(USE)h(OF,)g(THE)g(SOFTW)-10 b(ARE)35 b(OR)g(SER-)0 3205 y(VICES)29 b(PR)m(O)m(VIDED)j(HEREUNDER.")p eop end %%Page: 5 13 TeXDict begin 5 12 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.5) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.2) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(2)0 1687 y Fm(Creating)77 b(the)h(CFITSIO)e(Library)0 2060 y SDict begin H.S end 0 2060 a 0 2060 a SDict begin 13.6 H.A end 0 2060 a 0 2060 a SDict begin [/View [/XYZ H.V]/Dest (section.2.1) cvn /DEST pdfmark end 0 2060 a 156 x Ff(2.1)135 b(Building)45 b(the)h(Library)0 2467 y Fj(The)h(CFITSIO)f (co)s(de)h(is)h(con)m(tained)g(in)f(ab)s(out)g(40)h(C)f(source)h (\014les)f(\(*.c\))i(and)e(header)g(\014les)g(\(*.h\).)93 b(On)0 2580 y(V)-10 b(AX/VMS)31 b(systems)g(2)f(assem)m(bly-co)s(de)i (\014les)e(\(vmsieeed.mar)h(and)f(vmsieeer.mar\))i(are)e(also)i (needed.)0 2740 y(CFITSIO)22 b(is)h(written)g(in)g(ANCI)g(C)g(and)g (should)f(b)s(e)g(compatible)j(with)e(most)g(existing)i(C)d(and)h(C++)f (compilers.)0 2853 y(Cra)m(y)30 b(sup)s(ercomputers)f(are)i(curren)m (tly)f(not)h(supp)s(orted.)0 3003 y SDict begin H.S end 0 3003 a 0 3003 a SDict begin 13.6 H.A end 0 3003 a 0 3003 a SDict begin [/View [/XYZ H.V]/Dest (subsection.2.1.1) cvn /DEST pdfmark end 0 3003 a 146 x Fd(2.1.1)112 b(Unix)39 b(Systems)0 3369 y Fj(The)30 b(CFITSIO)f(library)h(is)g(built)g(on)h (Unix)f(systems)g(b)m(y)g(t)m(yping:)48 3633 y Fe(>)95 b(./configure)45 b([--prefix=/target/insta)o(llat)o(ion)o(/pat)o(h])d ([--enable-reentrant])764 3746 y([--enable-sse2])h([--enable-ssse3])48 3859 y(>)95 b(make)476 b(\(or)95 b('make)46 b(shared'\))48 3971 y(>)95 b(make)47 b(install)93 b(\(this)46 b(step)h(is)g (optional\))0 4235 y Fj(at)24 b(the)g(op)s(erating)g(system)g(prompt.) 38 b(The)23 b(con\014gure)g(command)g(customizes)i(the)f(Mak)m(e\014le) h(for)f(the)g(particular)0 4348 y(system,)g(then)d(the)g(`mak)m(e')i (command)e(compiles)h(the)f(source)h(\014les)f(and)g(builds)f(the)h (library)-8 b(.)38 b(T)m(yp)s(e)21 b(`./con\014gure')0 4461 y(and)34 b(not)h(simply)f(`con\014gure')h(to)h(ensure)e(that)h (the)g(con\014gure)g(script)f(in)h(the)g(curren)m(t)f(directory)h(is)g (run)f(and)0 4574 y(not)29 b(some)g(other)g(system-wide)g(con\014gure)f (script.)40 b(The)29 b(optional)h('pre\014x')e(argumen)m(t)h(to)g (con\014gure)g(giv)m(es)h(the)0 4687 y(path)e(to)i(the)f(directory)g (where)f(the)h(CFITSIO)f(library)g(and)g(include)h(\014les)f(should)g (b)s(e)g(installed)i(via)f(the)g(later)0 4800 y('mak)m(e)j(install')f (command.)41 b(F)-8 b(or)31 b(example,)143 5064 y Fe(>)48 b(./configure)c(--prefix=/usr1/local)0 5328 y Fj(will)25 b(cause)h(the)f('mak)m(e)h(install')g(command)f(to)h(cop)m(y)g(the)f (CFITSIO)e(lib)s(c\014tsio)i(\014le)h(to)f(/usr1/lo)s(cal/lib)i(and)e (the)0 5441 y(necessary)33 b(include)e(\014les)i(to)f(/usr1/lo)s (cal/include)j(\(assuming)d(of)g(course)g(that)h(the)f(pro)s(cess)g (has)g(p)s(ermission)0 5554 y(to)f(write)g(to)g(these)g(directories\).) 0 5714 y(All)g(the)g(a)m(v)-5 b(ailable)32 b(con\014gure)e(options)h (can)g(b)s(e)f(seen)g(b)m(y)g(en)m(tering)i(the)e(command)1927 5942 y(5)p eop end %%Page: 6 14 TeXDict begin 6 13 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.6) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(6)1580 b Fh(CHAPTER)30 b(2.)112 b(CREA)-8 b(TING)30 b(THE)g(CFITSIO)f(LIBRAR) -8 b(Y)143 555 y Fe(>)48 b(./configure)c(--help)0 830 y Fj(Some)30 b(of)h(the)g(more)f(useful)g(options)g(are)h(describ)s(ed) e(b)s(elo)m(w:)0 990 y(The)j({enable-reen)m(tran)m(t)j(option)f(will)f (attempt)h(to)f(con\014gure)g(CFITSIO)e(so)i(that)g(it)g(can)h(b)s(e)e (used)g(in)g(m)m(ulti-)0 1103 y(threaded)c(programs.)39 b(See)29 b(the)f("Using)h(CFITSIO)d(in)i(Multi-threaded)h(En)m (vironmen)m(ts")f(section,)i(b)s(elo)m(w,)f(for)0 1216 y(more)i(details.)0 1376 y(The)24 b({enable-sse2)j(and)d({enable-ssse3) i(options)g(will)f(cause)g(con\014gure)g(to)g(attempt)h(to)f(build)f (CFITSIO)f(using)0 1489 y(faster)31 b(b)m(yte-sw)m(apping)h (algorithms.)42 b(See)31 b(the)g("Optimizing)h(Programs")f(c)m(hapter)h (of)e(this)h(man)m(ual)g(for)g(more)0 1602 y(information)g(ab)s(out)f (these)h(options.)0 1762 y(The)44 b({with-gsiftp-\015a)m(v)m(our)h(and) f({with-gsiftp)g(options)h(enable)f(supp)s(ort)e(for)i(the)h(Globus)e (T)-8 b(o)s(olkit)46 b(gsiftp)0 1875 y(proto)s(cal.)c(See)30 b(the)h("Extended)f(File)i(Name)f(Syn)m(tax")g(c)m(hapter)g(for)f(more) g(information.)0 2035 y(The)22 b({with-bzip2)h(option)h(enables)f(supp) s(ort)d(for)j(reading)g(FITS)f(\014les)g(that)i(ha)m(v)m(e)f(b)s(een)f (externally)i(compressed)0 2148 y(b)m(y)j(the)h(bzip2)f(algorithm.)41 b(This)27 b(requires)g(that)h(the)f(CFITSIO)f(library)-8 b(,)28 b(and)f(all)i(applications)f(program)f(that)0 2261 y(use)j(CFITSIO,)f(to)i(b)s(e)f(link)m(ed)h(to)g(include)f(the)g (libbz2)h(library)-8 b(.)0 2421 y(The)28 b('mak)m(e)h(shared')f(option) h(builds)e(a)i(shared)e(or)i(dynamic)f(v)m(ersion)h(of)f(the)h(CFITSIO) d(library)-8 b(.)40 b(When)28 b(using)0 2534 y(the)f(shared)f(library)h (the)g(executable)h(co)s(de)f(is)g(not)g(copied)g(in)m(to)h(y)m(our)f (program)g(at)g(link)g(time)g(and)g(instead)g(the)0 2647 y(program)g(lo)s(cates)i(the)f(necessary)g(library)f(co)s(de)h(at)g (run)e(time,)j(normally)f(through)e(LD)p 3065 2647 28 4 v 33 w(LIBRAR)-8 b(Y)p 3514 2647 V 34 w(P)g(A)g(TH)28 b(or)0 2760 y(some)j(other)f(metho)s(d.)41 b(The)29 b(adv)-5 b(an)m(tages)33 b(of)d(using)g(a)h(shared)e(library)h(are:)143 3035 y Fe(1.)95 b(Less)47 b(disk)f(space)h(if)g(you)g(build)f(more)h (than)f(1)i(program)143 3148 y(2.)95 b(Less)47 b(memory)f(if)h(more)g (than)f(one)h(copy)g(of)g(a)g(program)f(using)h(the)g(shared)334 3261 y(library)f(is)h(running)f(at)h(the)g(same)g(time)f(since)h(the)g (system)f(is)h(smart)334 3374 y(enough)f(to)h(share)g(copies)f(of)h (the)g(shared)f(library)g(at)h(run)g(time.)143 3487 y(3.)95 b(Possibly)46 b(easier)g(maintenance)e(since)j(a)g(new)g(version)f(of)h (the)g(shared)334 3600 y(library)f(can)h(be)g(installed)e(without)h (relinking)f(all)i(the)g(software)334 3713 y(that)g(uses)f(it)i(\(as)e (long)h(as)g(the)g(subroutine)e(names)i(and)f(calling)334 3825 y(sequences)f(remain)h(unchanged\).)143 3938 y(4.)95 b(No)47 b(run-time)f(penalty.)0 4213 y Fj(The)30 b(disadv)-5 b(an)m(tages)32 b(are:)143 4488 y Fe(1.)47 b(More)g(hassle)f(at)h (runtime.)94 b(You)46 b(have)h(to)g(either)f(build)h(the)g(programs)286 4601 y(specially)f(or)h(have)f(LD_LIBRARY_PATH)e(set)j(right.)143 4714 y(2.)g(There)g(may)g(be)g(a)g(slight)f(start)h(up)g(penalty,)e (depending)h(on)h(where)f(you)h(are)286 4827 y(reading)f(the)h(shared)f (library)g(and)h(the)g(program)f(from)g(and)h(if)g(your)g(CPU)g(is)286 4940 y(either)f(really)h(slow)f(or)h(really)f(heavily)g(loaded.)0 5215 y Fj(On)32 b(Mac)i(OS)e(X)i(platforms)f(the)g('mak)m(e)h(shared')f (command)f(w)m(orks)h(lik)m(e)i(on)e(other)g(UNIX)g(platforms,)h(but)f (a)0 5328 y(.dylib)f(\014le)g(will)g(b)s(e)f(created)i(instead)g(of)f (.so.)46 b(If)31 b(installed)i(in)f(a)g(nonstandard)f(lo)s(cation,)j (add)d(its)i(lo)s(cation)g(to)0 5441 y(the)e(D)m(YLD)p 422 5441 V 34 w(LIBRAR)-8 b(Y)p 872 5441 V 33 w(P)g(A)g(TH)31 b(en)m(vironmen)m(t)g(v)-5 b(ariable)31 b(so)g(that)g(the)f(library)g (can)h(b)s(e)f(found)f(at)i(run)e(time.)0 5601 y(On)h(HP/UX)i(systems,) g(the)f(en)m(vironmen)m(t)h(v)-5 b(ariable)32 b(CFLA)m(GS)f(should)f(b) s(e)h(set)g(to)h(-Ae)g(b)s(efore)f(running)e(con-)0 5714 y(\014gure)h(to)h(enable)g("extended)g(ANSI")f(features.)p eop end %%Page: 7 15 TeXDict begin 7 14 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.7) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(2.2.)72 b(TESTING)29 b(THE)h(LIBRAR)-8 b(Y)2555 b Fj(7)0 555 y(By)31 b(default,)h(a)f(set)h(of)f(F)-8 b(ortran-callable)34 b(wrapp)s(er)29 b(routines)i(are)g(also)h(built)f(and)f(included)h(in)f (the)h(CFITSIO)0 668 y(library)-8 b(.)70 b(If)40 b(these)g(wrapp)s(er)f (routines)h(are)g(not)h(needed)e(\(i.e.,)45 b(the)40 b(CFITSIO)f(library)g(will)i(not)f(b)s(e)g(link)m(ed)0 781 y(to)d(an)m(y)f(F)-8 b(ortran)37 b(applications)g(whic)m(h)f(call)h (FITSIO)e(subroutines\))g(then)h(they)g(ma)m(y)h(b)s(e)e(omitted)i (from)f(the)0 894 y(build)28 b(b)m(y)i(t)m(yping)g('mak)m(e)g (all-no\014tsio')i(instead)d(of)h(simply)f(t)m(yping)h('mak)m(e'.)42 b(This)28 b(will)i(reduce)f(the)h(size)g(of)g(the)0 1007 y(CFITSIO)f(library)h(sligh)m(tly)-8 b(.)0 1167 y(It)33 b(ma)m(y)g(not)g(b)s(e)f(p)s(ossible)g(to)h(statically)i(link)e (programs)f(that)h(use)g(CFITSIO)e(on)h(some)h(platforms)g(\(namely)-8 b(,)0 1280 y(on)28 b(Solaris)h(2.6\))h(due)e(to)h(the)g(net)m(w)m(ork)g (driv)m(ers)f(\(whic)m(h)h(pro)m(vide)g(FTP)f(and)g(HTTP)g(access)h(to) h(FITS)d(\014les\).)41 b(It)0 1393 y(is)33 b(p)s(ossible)f(to)i(mak)m (e)f(b)s(oth)g(a)g(dynamic)f(and)g(a)i(static)g(v)m(ersion)f(of)g(the)g (CFITSIO)e(library)-8 b(,)34 b(but)e(net)m(w)m(ork)i(\014le)0 1506 y(access)e(will)e(not)h(b)s(e)f(p)s(ossible)g(using)g(the)g (static)i(v)m(ersion.)0 1667 y SDict begin H.S end 0 1667 a 0 1667 a SDict begin 13.6 H.A end 0 1667 a 0 1667 a SDict begin [/View [/XYZ H.V]/Dest (subsection.2.1.2) cvn /DEST pdfmark end 0 1667 a 146 x Fd(2.1.2)112 b(VMS)0 2035 y Fj(On)28 b(V)-10 b(AX/VMS)31 b(and)d(ALPHA/VMS)i(systems)f(the)h(mak)m (e)p 2100 2035 28 4 v 34 w(g\015oat.com)h(command)e(\014le)g(ma)m(y)h (b)s(e)f(executed)h(to)0 2148 y(build)35 b(the)i(c\014tsio.olb)g(ob)5 b(ject)37 b(library)f(using)g(the)g(default)h(G-\015oating)g(p)s(oin)m (t)g(option)f(for)g(double)g(v)-5 b(ariables.)0 2261 y(The)37 b(mak)m(e)p 405 2261 V 33 w(d\015oat.com)i(and)d(mak)m(e)p 1279 2261 V 34 w(ieee.com)j(\014les)f(ma)m(y)f(b)s(e)g(used)f(instead)i (to)g(build)e(the)h(library)g(with)g(the)0 2374 y(other)26 b(\015oating)i(p)s(oin)m(t)e(options.)39 b(Note)28 b(that)f(the)f (getcwd)h(function)f(that)h(is)f(used)f(in)h(the)h(group.c)f(mo)s(dule) f(ma)m(y)0 2487 y(require)44 b(that)i(programs)e(using)g(CFITSIO)f(b)s (e)h(link)m(ed)i(with)e(the)h(ALPHA$LIBRAR)-8 b(Y:V)e(AX)m(CR)i(TL.OLB) 0 2600 y(library)g(.)41 b(See)30 b(the)h(example)g(link)f(line)h(in)f (the)h(next)f(section)i(of)e(this)h(do)s(cumen)m(t.)0 2761 y SDict begin H.S end 0 2761 a 0 2761 a SDict begin 13.6 H.A end 0 2761 a 0 2761 a SDict begin [/View [/XYZ H.V]/Dest (subsection.2.1.3) cvn /DEST pdfmark end 0 2761 a 146 x Fd(2.1.3)112 b(Windo)m(ws)38 b(PCs)0 3129 y Fj(A)j(precompiled)f(DLL) g(v)m(ersion)h(of)g(CFITSIO)e(\(not)i(necessarily)g(the)g(latest)h(v)m (ersion\))f(is)g(a)m(v)-5 b(ailable)42 b(on)f(the)0 3242 y(CFITSIO)26 b(w)m(eb)i(site.)41 b(The)27 b(CFITSIO)f(library)h(ma)m(y) i(also)g(b)s(e)e(built)g(from)h(the)g(source)f(co)s(de)h(using)g(the)g (CMak)m(e)0 3355 y(build)j(system.)44 b(See)32 b(the)g("README.win")h (\014le)f(in)f(the)h(CFITSIO)e(source)i(distribution)f(for)g(more)h (informa-)0 3468 y(tion.)0 3612 y SDict begin H.S end 0 3612 a 0 3612 a SDict begin 13.6 H.A end 0 3612 a 0 3612 a SDict begin [/View [/XYZ H.V]/Dest (subsection.2.1.4) cvn /DEST pdfmark end 0 3612 a 163 x Fd(2.1.4)112 b(Macin)m(tosh)39 b(PCs)0 3998 y Fj(When)20 b(building)f(on)i(Mac)g(OS-X,)f(users)g (should)f(follo)m(w)i(the)g(Unix)f(instructions,)i(ab)s(o)m(v)m(e.)39 b(See)20 b(the)h(README.MacOS)0 4111 y(\014le)30 b(for)h(instructions)f (on)g(building)g(a)g(Univ)m(ersal)i(Binary)e(that)h(supp)s(orts)e(b)s (oth)g(In)m(tel)i(and)f(P)m(o)m(w)m(erPC)h(CPUs.)0 4282 y SDict begin H.S end 0 4282 a 0 4282 a SDict begin 13.6 H.A end 0 4282 a 0 4282 a SDict begin [/View [/XYZ H.V]/Dest (section.2.2) cvn /DEST pdfmark end 0 4282 a 179 x Ff(2.2)135 b(T)-11 b(esting)46 b(the)f(Library)0 4714 y Fj(The)40 b(CFITSIO)e(library)i(should)f(b)s(e)g(tested)i(b)m(y)f (building)f(and)g(running)g(the)h(testprog.c)h(program)f(that)h(is)0 4827 y(included)30 b(with)g(the)g(release.)42 b(On)30 b(Unix)g(systems,)h(t)m(yp)s(e:)191 5101 y Fe(\045)47 b(make)g(testprog)191 5214 y(\045)g(testprog)f(>)h(testprog.lis)191 5327 y(\045)g(diff)g(testprog.lis)d(testprog.out)191 5440 y(\045)j(cmp)g(testprog.fit)e(testprog.std)0 5714 y Fj(On)30 b(VMS)g(systems,)g(\(assuming)h(cc)g(is)f(the)h(name)f(of)h (the)f(C)g(compiler)h(command\),)g(t)m(yp)s(e:)p eop end %%Page: 8 16 TeXDict begin 8 15 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.8) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(8)1580 b Fh(CHAPTER)30 b(2.)112 b(CREA)-8 b(TING)30 b(THE)g(CFITSIO)f(LIBRAR) -8 b(Y)191 555 y Fe($)47 b(cc)h(testprog.c)191 668 y($)f(link)g (testprog,)e(cfitsio/lib,)g(alpha$library:vaxcrtl/l)o(ib)191 781 y($)i(run)g(testprog)0 1047 y Fj(The)42 b(test)h(program)f(should)f (pro)s(duce)g(a)i(FITS)e(\014le)i(called)g(`testprog.\014t')h(that)f (is)f(iden)m(tical)i(to)f(the)f(`test-)0 1160 y(prog.std')35 b(FITS)e(\014le)i(included)e(with)h(this)g(release.)54 b(The)34 b(diagnostic)i(messages)f(\(whic)m(h)g(w)m(ere)g(pip)s(ed)e (to)i(the)0 1273 y(\014le)h(testprog.lis)i(in)e(the)h(Unix)f(example\)) h(should)e(b)s(e)h(iden)m(tical)i(to)f(the)f(listing)h(con)m(tained)h (in)e(the)g(\014le)h(test-)0 1386 y(prog.out.)63 b(The)37 b('di\013)7 b(')38 b(and)f('cmp')h(commands)g(sho)m(wn)f(ab)s(o)m(v)m (e)i(should)d(not)i(rep)s(ort)f(an)m(y)h(di\013erences)g(in)g(the)0 1499 y(\014les.)65 b(\(There)38 b(ma)m(y)h(b)s(e)f(some)h(minor)f (format)h(di\013erences,)i(suc)m(h)d(as)h(the)g(presence)f(or)h (absence)g(of)f(leading)0 1612 y(zeros,)31 b(or)g(3)f(digit)i(exp)s (onen)m(ts)e(in)g(n)m(um)m(b)s(ers,)f(whic)m(h)h(can)h(b)s(e)f (ignored\).)0 1772 y(The)e(F)-8 b(ortran)30 b(wrapp)s(ers)d(in)h (CFITSIO)f(ma)m(y)j(b)s(e)e(tested)h(with)g(the)g(testf77)h(program)f (on)g(Unix)f(systems)h(with:)191 2038 y Fe(\045)47 b(f77)g(-o)g (testf77)f(testf77.f)g(-L.)g(-lcfitsio)g(-lnsl)g(-lsocket)95 2151 y(or)191 2264 y(\045)h(f77)g(-f)g(-o)h(testf77)d(testf77.f)h(-L.)h (-lcfitsio)188 b(\(under)46 b(SUN)h(O/S\))95 2377 y(or)191 2490 y(\045)g(f77)g(-o)g(testf77)f(testf77.f)g(-Wl,-L.)f(-lcfitsio)h (-lm)h(-lnsl)f(-lsocket)f(\(HP/UX\))191 2716 y(\045)i(testf77)f(>)i (testf77.lis)191 2829 y(\045)f(diff)g(testf77.lis)e(testf77.out)191 2942 y(\045)i(cmp)g(testf77.fit)e(testf77.std)0 3208 y Fj(On)31 b(mac)m(hines)h(running)f(SUN)g(O/S,)h(F)-8 b(ortran)33 b(programs)e(m)m(ust)h(b)s(e)f(compiled)h(with)g(the)g('-f) 7 b(')32 b(option)h(to)f(force)0 3321 y(double)25 b(precision)h(v)-5 b(ariables)26 b(to)g(b)s(e)f(aligned)h(on)g(8-b)m(yte)h(b)s(oundarys)c (to)j(mak)m(e)h(the)e(fortran-declared)h(v)-5 b(ariables)0 3434 y(compatible)34 b(with)e(C.)g(A)h(similar)g(compiler)g(option)g (ma)m(y)g(b)s(e)f(required)g(on)g(other)h(platforms.)48 b(F)-8 b(ailing)34 b(to)f(use)0 3547 y(this)26 b(option)g(ma)m(y)g (cause)h(the)f(program)f(to)i(crash)e(on)h(FITSIO)f(routines)g(that)i (read)f(or)f(write)h(double)g(precision)0 3659 y(v)-5 b(ariables.)0 3820 y(Also)31 b(note)g(that)f(on)g(some)h(systems,)f (the)h(output)e(listing)i(of)g(the)f(testf77)i(program)d(ma)m(y)i (di\013er)f(sligh)m(tly)h(from)0 3933 y(the)g(testf77.std)h(template,)g (if)f(leading)g(zeros)g(are)g(not)g(prin)m(ted)f(b)m(y)h(default)g(b)s (efore)f(the)h(decimal)g(p)s(oin)m(t)g(when)0 4045 y(using)f(F)h (format.)0 4206 y(A)37 b(few)f(other)g(utilit)m(y)i(programs)e(are)h (included)f(with)g(CFITSIO;)f(the)i(\014rst)e(four)h(of)g(this)h (programs)f(can)h(b)s(e)0 4319 y(compiled)e(an)g(link)m(ed)g(b)m(y)g(t) m(yping)g(`mak)m(e)h(program)p 1815 4319 28 4 v 33 w(name')f(where)f (`program)p 2746 4319 V 33 w(name')h(is)g(the)g(actual)h(name)f(of)0 4431 y(the)c(program:)191 4698 y Fe(speed)46 b(-)i(measures)d(the)i (maximum)f(throughput)f(\(in)i(MB)g(per)g(second\))668 4811 y(for)g(writing)f(and)h(reading)f(FITS)g(files)h(with)f(CFITSIO.) 191 5036 y(listhead)f(-)j(lists)e(all)h(the)g(header)f(keywords)g(in)h (any)g(FITS)f(file)191 5262 y(fitscopy)f(-)j(copies)e(any)h(FITS)g (file)f(\(especially)f(useful)h(in)h(conjunction)811 5375 y(with)g(the)g(CFITSIO's)e(extended)h(input)g(filename)g (syntax\).)191 5601 y(cookbook)f(-)j(a)f(sample)f(program)g(that)h (performs)e(common)i(read)f(and)811 5714 y(write)h(operations)e(on)i(a) g(FITS)g(file.)p eop end %%Page: 9 17 TeXDict begin 9 16 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.9) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(2.3.)72 b(LINKING)30 b(PR)m(OGRAMS)h(WITH)f(CFITSIO)1975 b Fj(9)191 668 y Fe(iter_a,)46 b(iter_b,)g(iter_c)g(-)h(examples)f(of)h(the)g (CFITSIO)f(iterator)f(routine)0 841 y SDict begin H.S end 0 841 a 0 841 a SDict begin 13.6 H.A end 0 841 a 0 841 a SDict begin [/View [/XYZ H.V]/Dest (section.2.3) cvn /DEST pdfmark end 0 841 a 176 x Ff(2.3)135 b(Linking)45 b(Programs)h(with)f(CFITSIO)0 1271 y Fj(When)25 b(linking)h (applications)h(soft)m(w)m(are)g(with)e(the)h(CFITSIO)e(library)-8 b(,)27 b(sev)m(eral)g(system)f(libraries)g(usually)f(need)0 1384 y(to)36 b(b)s(e)f(sp)s(eci\014ed)g(on)g(the)g(link)h(command)f (line.)56 b(On)34 b(Unix)i(systems,)h(the)e(most)h(reliable)g(w)m(a)m (y)h(to)f(determine)0 1497 y(what)26 b(libraries)h(are)f(required)g(is) g(to)h(t)m(yp)s(e)f('mak)m(e)i(testprog')f(and)f(see)h(what)f (libraries)h(the)f(con\014gure)g(script)g(has)0 1610 y(added.)39 b(The)25 b(t)m(ypical)j(libraries)e(that)g(need)g(to)g(b)s (e)g(added)f(are)h(-lm)h(\(the)f(math)g(library\))g(and)f(-lnsl)h(and)g (-lso)s(c)m(k)m(et)0 1722 y(\(needed)k(only)g(for)g(FTP)g(and)f(HTTP)g (\014le)h(access\).)43 b(These)30 b(latter)h(2)f(libraries)g(are)h(not) f(needed)g(on)g(VMS)g(and)0 1835 y(Windo)m(ws)g(platforms,)h(b)s (ecause)f(FTP)h(\014le)f(access)i(is)e(not)h(curren)m(tly)f(supp)s (orted)f(on)h(those)h(platforms.)0 1996 y(Note)i(that)g(when)e (upgrading)g(to)i(a)f(new)m(er)g(v)m(ersion)g(of)g(CFITSIO)f(it)h(is)g (usually)g(necessary)g(to)h(recompile,)h(as)0 2108 y(w)m(ell)d(as)g (relink,)g(the)f(programs)g(that)h(use)f(CFITSIO,)f(b)s(ecause)i(the)f (de\014nitions)g(in)g(\014tsio.h)h(often)f(c)m(hange.)0 2279 y SDict begin H.S end 0 2279 a 0 2279 a SDict begin 13.6 H.A end 0 2279 a 0 2279 a SDict begin [/View [/XYZ H.V]/Dest (section.2.4) cvn /DEST pdfmark end 0 2279 a 179 x Ff(2.4)135 b(Using)46 b(CFITSIO)e(in)h(Multi-threaded)g(En)l (vironmen)l(ts)0 2711 y Fj(CFITSIO)d(can)h(b)s(e)g(used)f(either)i (with)e(the)i(POSIX)e(pthreads)g(in)m(terface)j(or)e(the)h(Op)s(enMP)d (in)m(terface)k(for)0 2824 y(m)m(ulti-threaded)g(parallel)g(programs.) 81 b(When)43 b(used)h(in)f(a)i(m)m(ulti-threaded)f(en)m(vironmen)m(t,)k (the)c(CFITSIO)0 2937 y(library)26 b(*m)m(ust*)h(b)s(e)e(built)h(using) g(the)g(-D)p 1426 2937 28 4 v 34 w(REENTRANT)f(compiler)i(directiv)m (e.)41 b(This)25 b(can)i(b)s(e)e(done)h(using)g(the)0 3050 y(follo)m(wing)32 b(build)d(commands:)95 3323 y Fe(>./configure)45 b(--enable-reentrant)95 3436 y(>)j(make)0 3709 y Fj(A)32 b(function)g(called)i(\014ts)p 845 3709 V 32 w(is)p 938 3709 V 33 w(reen)m(tran)m(t)f(is)g(a)m(v)-5 b(ailable)34 b(to)f(test)h(whether)d(or)i(not)f(CFITSIO)f(w)m(as)h (compiled)h(with)0 3822 y(the)28 b(-D)p 258 3822 V 34 w(REENTRANT)f(directiv)m(e.)42 b(When)28 b(this)g(feature)g(is)g (enabled,)h(m)m(ultiple)g(threads)e(can)i(call)g(an)m(y)g(of)f(the)0 3935 y(CFITSIO)k(routines)h(to)h(sim)m(ultaneously)g(read)f(or)h(write) f(separate)h(FITS)f(\014les.)49 b(Multiple)34 b(threads)f(can)h(also)0 4048 y(read)29 b(data)h(from)e(the)h(same)h(FITS)e(\014le)h(sim)m (ultaneously)-8 b(,)31 b(as)e(long)h(as)f(the)g(\014le)g(w)m(as)h(op)s (ened)e(indep)s(enden)m(tly)g(b)m(y)0 4161 y(eac)m(h)37 b(thread.)58 b(This)35 b(relies)i(on)f(the)g(op)s(erating)h(system)f (to)h(correctly)g(deal)g(with)f(reading)g(the)g(same)h(\014le)f(b)m(y)0 4274 y(m)m(ultiple)30 b(pro)s(cesses.)41 b(Di\013eren)m(t)30 b(threads)g(should)e(not)i(share)f(the)h(same)g('\014ts\014le')g(p)s (oin)m(ter)f(to)i(read)e(an)h(op)s(ened)0 4386 y(FITS)40 b(\014le,)j(unless)d(lo)s(c)m(ks)h(are)g(placed)f(around)g(the)g(calls) i(to)f(the)g(CFITSIO)d(reading)j(routines.)71 b(Di\013eren)m(t)0 4499 y(threads)30 b(should)f(nev)m(er)i(try)f(to)h(write)g(to)g(the)g (same)f(FITS)g(\014le.)0 4670 y SDict begin H.S end 0 4670 a 0 4670 a SDict begin 13.6 H.A end 0 4670 a 0 4670 a SDict begin [/View [/XYZ H.V]/Dest (section.2.5) cvn /DEST pdfmark end 0 4670 a 179 x Ff(2.5)135 b(Getting)46 b(Started)g(with)f (CFITSIO)0 5102 y Fj(In)27 b(order)h(to)g(e\013ectiv)m(ely)j(use)d(the) g(CFITSIO)e(library)i(it)g(is)g(recommended)g(that)g(new)f(users)h(b)s (egin)f(b)m(y)h(reading)0 5215 y(the)g(\\CFITSIO)g(Quic)m(k)g(Start)g (Guide".)41 b(It)28 b(con)m(tains)h(all)h(the)e(basic)h(information)f (needed)g(to)h(write)f(programs)0 5328 y(that)c(p)s(erform)f(most)h(t)m (yp)s(es)g(of)g(op)s(erations)g(on)g(FITS)f(\014les.)39 b(The)23 b(set)i(of)f(example)g(FITS)g(utilit)m(y)h(programs)e(that)0 5441 y(are)29 b(a)m(v)-5 b(ailable)31 b(from)d(the)g(CFITSIO)f(w)m(eb)i (site)g(are)g(also)g(v)m(ery)g(useful)f(for)g(learning)h(ho)m(w)f(to)h (use)f(CFITSIO.)f(T)-8 b(o)0 5554 y(learn)23 b(ev)m(en)g(more)g(ab)s (out)f(the)h(capabilities)h(of)f(the)g(CFITSIO)e(library)h(the)h(follo) m(wing)h(steps)e(are)h(recommended:)0 5714 y(1.)41 b(Read)31 b(the)f(follo)m(wing)i(short)e(`FITS)g(Primer')g(c)m(hapter)h(for)f(an) h(o)m(v)m(erview)h(of)e(the)h(structure)f(of)g(FITS)g(\014les.)p eop end %%Page: 10 18 TeXDict begin 10 17 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.10) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(10)1535 b Fh(CHAPTER)30 b(2.)112 b(CREA)-8 b(TING)30 b(THE)g(CFITSIO)f(LIBRAR) -8 b(Y)0 555 y Fj(2.)40 b(Review)28 b(the)f(Programming)g(Guidelines)h (in)f(Chapter)f(4)i(to)g(b)s(ecome)f(familiar)h(with)f(the)h(con)m(v)m (en)m(tions)h(used)0 668 y(b)m(y)h(the)h(CFITSIO)e(in)m(terface.)0 828 y(3.)74 b(Refer)41 b(to)h(the)g(co)s(okb)s(o)s(ok.c,)j(listhead.c,) h(and)40 b(\014tscop)m(y)-8 b(.c)43 b(programs)e(that)h(are)g(included) e(with)h(this)h(re-)0 941 y(lease)g(for)e(examples)h(of)g(routines)f (that)h(p)s(erform)e(v)-5 b(arious)41 b(common)g(FITS)f(\014le)g(op)s (erations.)72 b(T)m(yp)s(e)40 b('mak)m(e)0 1054 y(program)p 339 1054 28 4 v 33 w(name')30 b(to)h(compile)h(and)d(link)i(these)g (programs)f(on)g(Unix)g(systems.)0 1214 y(4.)40 b(W)-8 b(rite)30 b(a)e(simple)g(program)g(to)g(read)g(or)g(write)g(a)h(FITS)e (\014le)h(using)g(the)g(Basic)h(In)m(terface)g(routines)f(describ)s(ed) 0 1327 y(in)i(Chapter)g(5.)0 1487 y(5.)79 b(Scan)43 b(through)f(the)h (more)g(sp)s(ecialized)i(routines)d(that)i(are)f(describ)s(ed)f(in)h (the)g(follo)m(wing)i(c)m(hapters)e(to)0 1600 y(b)s(ecome)31 b(familiar)g(with)f(the)h(functionalit)m(y)g(that)g(they)g(pro)m(vide.) 0 1785 y SDict begin H.S end 0 1785 a 0 1785 a SDict begin 13.6 H.A end 0 1785 a 0 1785 a SDict begin [/View [/XYZ H.V]/Dest (section.2.6) cvn /DEST pdfmark end 0 1785 a 179 x Ff(2.6)135 b(Example)46 b(Program)0 2220 y Fj(The)c(follo)m(wing) j(listing)f(sho)m(ws)e(an)h(example)h(of)f(ho)m(w)g(to)g(use)g(the)g (CFITSIO)f(routines)g(in)h(a)g(C)g(program.)0 2333 y(Refer)26 b(to)g(the)g(co)s(okb)s(o)s(ok.c)g(program)f(that)i(is)e(included)g (with)g(the)h(CFITSIO)e(distribution)h(for)g(other)h(example)0 2446 y(routines.)0 2606 y(This)38 b(program)h(creates)h(a)f(new)f(FITS) g(\014le,)k(con)m(taining)e(a)f(FITS)f(image.)68 b(An)38 b(`EXPOSURE')h(k)m(eyw)m(ord)g(is)0 2719 y(written)27 b(to)g(the)f(header,)i(then)e(the)h(image)g(data)h(are)f(written)f(to)h (the)g(FITS)f(\014le)g(b)s(efore)h(closing)g(the)g(FITS)f(\014le.)0 3004 y Fe(#include)46 b("fitsio.h")92 b(/*)47 b(required)f(by)h(every)g (program)e(that)i(uses)g(CFITSIO)93 b(*/)0 3117 y(main\(\))0 3230 y({)191 3343 y(fitsfile)45 b(*fptr;)333 b(/*)47 b(pointer)f(to)h(the)g(FITS)g(file;)f(defined)g(in)h(fitsio.h)f(*/)191 3456 y(int)h(status,)f(ii,)h(jj;)191 3569 y(long)94 b(fpixel)46 b(=)i(1,)f(naxis)f(=)i(2,)f(nelements,)e(exposure;)191 3681 y(long)i(naxes[2])e(=)j({)f(300,)g(200)g(};)142 b(/*)47 b(image)g(is)g(300)g(pixels)f(wide)h(by)g(200)g(rows)f(*/)191 3794 y(short)g(array[200][300];)191 4020 y(status)g(=)h(0;)429 b(/*)48 b(initialize)d(status)h(before)g(calling)g(fitsio)g(routines)f (*/)191 4133 y(fits_create_file\(&fptr,)c("testfile.fits",)j (&status\);)140 b(/*)48 b(create)e(new)h(file)f(*/)191 4359 y(/*)h(Create)f(the)h(primary)f(array)g(image)h(\(16-bit)e(short)i (integer)f(pixels)g(*/)191 4472 y(fits_create_img\(fptr,)c(SHORT_IMG,)j (naxis,)h(naxes,)g(&status\);)191 4698 y(/*)h(Write)f(a)i(keyword;)d (must)i(pass)g(the)g(ADDRESS)e(of)j(the)f(value)f(*/)191 4811 y(exposure)f(=)j(1500.;)191 4924 y(fits_update_key\(fptr,)42 b(TLONG,)k("EXPOSURE",)f(&exposure,)430 5036 y("Total)h(Exposure)f (Time",)h(&status\);)191 5262 y(/*)h(Initialize)e(the)i(values)f(in)h (the)g(image)g(with)f(a)i(linear)e(ramp)g(function)g(*/)191 5375 y(for)h(\(jj)g(=)g(0;)g(jj)h(<)f(naxes[1];)e(jj++\))382 5488 y(for)i(\(ii)g(=)g(0;)g(ii)g(<)h(naxes[0];)d(ii++\))573 5601 y(array[jj][ii])f(=)j(ii)h(+)f(jj;)p eop end %%Page: 11 19 TeXDict begin 11 18 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.11) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(2.6.)72 b(EXAMPLE)31 b(PR)m(OGRAM)2618 b Fj(11)191 555 y Fe(nelements)45 b(=)j(naxes[0])d(*)j(naxes[1];)474 b(/*)48 b(number)e(of)h(pixels)f(to) h(write)g(*/)191 781 y(/*)g(Write)f(the)h(array)g(of)g(integers)e(to)j (the)f(image)f(*/)191 894 y(fits_write_img\(fptr,)c(TSHORT,)k(fpixel,)g (nelements,)f(array[0],)g(&status\);)191 1120 y(fits_close_file\(fptr,) d(&status\);)570 b(/*)47 b(close)g(the)g(file)f(*/)191 1346 y(fits_report_error\(stderr)o(,)c(status\);)93 b(/*)47 b(print)g(out)g(any)f(error)h(messages)e(*/)191 1458 y(return\()h(status)g(\);)0 1571 y(})p eop end %%Page: 12 20 TeXDict begin 12 19 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.12) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(12)1535 b Fh(CHAPTER)30 b(2.)112 b(CREA)-8 b(TING)30 b(THE)g(CFITSIO)f(LIBRAR) -8 b(Y)p eop end %%Page: 13 21 TeXDict begin 13 20 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.13) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.3) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(3)0 1687 y Fm(A)78 b(FITS)f(Primer)0 2180 y Fj(This)36 b(section)h(giv)m (es)h(a)f(brief)f(o)m(v)m(erview)i(of)e(the)h(structure)f(of)h(FITS)e (\014les.)59 b(Users)36 b(should)g(refer)g(to)h(the)g(do)s(c-)0 2293 y(umen)m(tation)i(a)m(v)-5 b(ailable)41 b(from)d(the)g(FITS)g (Supp)s(ort)e(OF\014ce,)41 b(as)d(describ)s(ed)g(in)g(the)g(in)m(tro)s (duction,)j(for)d(more)0 2406 y(detailed)31 b(information)g(on)f(FITS)g (formats.)0 2566 y(FITS)e(w)m(as)h(\014rst)g(dev)m(elop)s(ed)g(in)f (the)h(late)i(1970's)g(as)e(a)g(standard)f(data)i(in)m(terc)m(hange)g (format)f(b)s(et)m(w)m(een)h(v)-5 b(arious)0 2679 y(astronomical)36 b(observ)-5 b(atories.)52 b(Since)34 b(then)g(FITS)f(has)h(b)s(ecome)g (the)h(standard)e(data)i(format)f(supp)s(orted)e(b)m(y)0 2791 y(most)f(astronomical)h(data)f(analysis)g(soft)m(w)m(are)h(pac)m (k)-5 b(ages.)0 2952 y(A)34 b(FITS)f(\014le)g(consists)h(of)g(one)g(or) g(more)g(Header)g(+)f(Data)i(Units)f(\(HDUs\),)i(where)d(the)h(\014rst) f(HDU)h(is)g(called)0 3065 y(the)j(`Primary)f(HDU',)i(or)f(`Primary)f (Arra)m(y'.)60 b(The)36 b(primary)g(arra)m(y)h(con)m(tains)h(an)e (N-dimensional)i(arra)m(y)f(of)0 3177 y(pixels,)30 b(suc)m(h)g(as)g(a)h (1-D)g(sp)s(ectrum,)e(a)h(2-D)h(image,)h(or)e(a)g(3-D)i(data)e(cub)s (e.)40 b(Six)30 b(di\013eren)m(t)g(primary)f(data)i(t)m(yp)s(es)0 3290 y(are)j(supp)s(orted:)44 b(Unsigned)33 b(8-bit)h(b)m(ytes,)h (16-bit,)g(32-bit,)h(and)c(64-bit)j(signed)e(in)m(tegers,)i(and)e(32)h (and)f(64-bit)0 3403 y(\015oating)c(p)s(oin)m(t)f(reals.)41 b(FITS)27 b(also)j(has)e(a)g(con)m(v)m(en)m(tion)j(for)d(storing)g(16,) i(32-bit,)g(and)e(64-bit)i(unsigned)d(in)m(tegers)0 3516 y(\(see)36 b(the)g(later)g(section)g(en)m(titled)h(`Unsigned)e(In)m (tegers')i(for)e(more)g(details\).)57 b(The)35 b(primary)f(HDU)i(ma)m (y)g(also)0 3629 y(consist)31 b(of)g(only)f(a)h(header)f(with)g(a)h(n)m (ull)f(arra)m(y)h(con)m(taining)h(no)e(data)h(pixels.)0 3789 y(An)m(y)i(n)m(um)m(b)s(er)e(of)h(additional)i(HDUs)f(ma)m(y)g (follo)m(w)h(the)e(primary)g(arra)m(y;)i(these)f(additional)h(HDUs)f (are)g(called)0 3902 y(FITS)d(`extensions'.)41 b(There)30 b(are)h(curren)m(tly)f(3)h(t)m(yp)s(es)g(of)f(extensions)h(de\014ned)e (b)m(y)h(the)h(FITS)f(standard:)136 4171 y Fc(\017)46 b Fj(Image)31 b(Extension)g(-)g(a)f(N-dimensional)h(arra)m(y)g(of)g (pixels,)g(lik)m(e)g(in)f(a)h(primary)e(arra)m(y)136 4368 y Fc(\017)46 b Fj(ASCI)s(I)29 b(T)-8 b(able)31 b(Extension)g(-)f (ro)m(ws)h(and)e(columns)h(of)h(data)g(in)f(ASCI)s(I)f(c)m(haracter)j (format)136 4564 y Fc(\017)46 b Fj(Binary)31 b(T)-8 b(able)31 b(Extension)f(-)h(ro)m(ws)f(and)g(columns)g(of)h(data)g(in)f(binary)f (represen)m(tation)0 4833 y(In)k(eac)m(h)i(case)g(the)f(HDU)h(consists) g(of)f(an)g(ASCI)s(I)e(Header)i(Unit)h(follo)m(w)m(ed)g(b)m(y)f(an)g (optional)h(Data)g(Unit.)52 b(F)-8 b(or)0 4946 y(historical)37 b(reasons,)g(eac)m(h)f(Header)g(or)g(Data)h(unit)e(m)m(ust)g(b)s(e)g (an)g(exact)i(m)m(ultiple)f(of)g(2880)h(8-bit)f(b)m(ytes)g(long.)0 5059 y(An)m(y)30 b(un)m(used)g(space)g(is)h(padded)e(with)h(\014ll)g(c) m(haracters)i(\(ASCI)s(I)d(blanks)h(or)h(zeros\).)0 5219 y(Eac)m(h)i(Header)f(Unit)h(consists)g(of)f(an)m(y)g(n)m(um)m(b)s(er)f (of)i(80-c)m(haracter)i(k)m(eyw)m(ord)d(records)g(or)g(`card)h(images') g(whic)m(h)0 5332 y(ha)m(v)m(e)f(the)e(general)i(form:)95 5601 y Fe(KEYNAME)46 b(=)i(value)e(/)i(comment)d(string)95 5714 y(NULLKEY)h(=)334 b(/)48 b(comment:)d(This)i(keyword)f(has)g(no)i (value)1905 5942 y Fj(13)p eop end %%Page: 14 22 TeXDict begin 14 21 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.14) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(14)2398 b Fh(CHAPTER)30 b(3.)112 b(A)30 b(FITS)g(PRIMER)0 555 y Fj(The)35 b(k)m(eyw)m(ord)i(names)f(ma)m(y)g(b)s(e)g(up)f(to)h(8)h(c) m(haracters)g(long)g(and)e(can)h(only)h(con)m(tain)g(upp)s(ercase)e (letters,)k(the)0 668 y(digits)25 b(0-9,)i(the)e(h)m(yphen,)g(and)f (the)h(underscore)e(c)m(haracter.)41 b(The)24 b(k)m(eyw)m(ord)h(name)g (is)f(\(usually\))h(follo)m(w)m(ed)i(b)m(y)d(an)0 781 y(equals)29 b(sign)g(and)f(a)g(space)i(c)m(haracter)g(\(=)e(\))h(in)f (columns)h(9)g(-)f(10)i(of)f(the)f(record,)h(follo)m(w)m(ed)i(b)m(y)d (the)h(v)-5 b(alue)29 b(of)g(the)0 894 y(k)m(eyw)m(ord)34 b(whic)m(h)g(ma)m(y)g(b)s(e)f(either)h(an)g(in)m(teger,)i(a)e (\015oating)g(p)s(oin)m(t)g(n)m(um)m(b)s(er,)g(a)g(c)m(haracter)h (string)e(\(enclosed)i(in)0 1007 y(single)28 b(quotes\),)i(or)e(a)g(b)s (o)s(olean)g(v)-5 b(alue)28 b(\(the)g(letter)h(T)f(or)f(F\).)i(A)f(k)m (eyw)m(ord)g(ma)m(y)h(also)f(ha)m(v)m(e)h(a)g(n)m(ull)e(or)h (unde\014ned)0 1120 y(v)-5 b(alue)31 b(if)f(there)h(is)f(no)g(sp)s (eci\014ed)g(v)-5 b(alue)31 b(string,)g(as)f(in)g(the)h(second)f (example,)i(ab)s(o)m(v)m(e)0 1280 y(The)26 b(last)h(k)m(eyw)m(ord)g(in) g(the)f(header)h(is)f(alw)m(a)m(ys)i(the)f(`END')g(k)m(eyw)m(ord)g (whic)m(h)g(has)f(no)g(v)-5 b(alue)27 b(or)g(commen)m(t)g(\014elds.)0 1393 y(There)k(are)g(man)m(y)g(rules)g(go)m(v)m(erning)h(the)g(exact)g (format)g(of)f(a)g(k)m(eyw)m(ord)h(record)f(\(see)h(the)f(FITS)f (Standard\))h(so)0 1506 y(it)i(is)f(b)s(etter)h(to)g(rely)g(on)f (standard)f(in)m(terface)j(soft)m(w)m(are)g(lik)m(e)g(CFITSIO)d(to)i (correctly)h(construct)f(or)f(to)h(parse)0 1619 y(the)e(k)m(eyw)m(ord)f (records)h(rather)f(than)g(try)g(to)h(deal)g(directly)g(with)f(the)h (ra)m(w)f(FITS)g(formats.)0 1779 y(Eac)m(h)37 b(Header)g(Unit)f(b)s (egins)g(with)g(a)g(series)h(of)f(required)g(k)m(eyw)m(ords)g(whic)m(h) g(dep)s(end)f(on)h(the)g(t)m(yp)s(e)h(of)f(HDU.)0 1892 y(These)31 b(required)g(k)m(eyw)m(ords)h(sp)s(ecify)g(the)f(size)i(and) e(format)h(of)g(the)g(follo)m(wing)h(Data)g(Unit.)45 b(The)31 b(header)g(ma)m(y)0 2005 y(con)m(tain)h(other)f(optional)g(k)m (eyw)m(ords)g(to)h(describ)s(e)e(other)g(asp)s(ects)h(of)g(the)g(data,) g(suc)m(h)g(as)g(the)f(units)g(or)h(scaling)0 2118 y(v)-5 b(alues.)44 b(Other)31 b(COMMENT)g(or)g(HISTOR)-8 b(Y)30 b(k)m(eyw)m(ords)i(are)g(also)g(frequen)m(tly)g(added)e(to)i(further)e (do)s(cumen)m(t)0 2230 y(the)h(data)g(\014le.)0 2391 y(The)36 b(optional)h(Data)h(Unit)f(immediately)g(follo)m(ws)h(the)e (last)h(2880-b)m(yte)i(blo)s(c)m(k)e(in)f(the)g(Header)h(Unit.)59 b(Some)0 2503 y(HDUs)31 b(do)f(not)h(ha)m(v)m(e)g(a)g(Data)h(Unit)f (and)f(only)g(consist)h(of)g(the)f(Header)h(Unit.)0 2664 y(If)24 b(there)i(is)f(more)g(than)f(one)h(HDU)h(in)f(the)g(FITS)f (\014le,)i(then)f(the)g(Header)h(Unit)f(of)g(the)g(next)g(HDU)h (immediately)0 2777 y(follo)m(ws)g(the)e(last)i(2880-b)m(yte)h(blo)s(c) m(k)e(of)g(the)f(previous)g(Data)j(Unit)d(\(or)h(Header)g(Unit)g(if)f (there)h(is)g(no)f(Data)i(Unit\).)0 2937 y(The)k(main)g(required)g(k)m (eyw)m(ords)g(in)g(FITS)g(primary)g(arra)m(ys)g(or)h(image)g (extensions)g(are:)136 3172 y Fc(\017)46 b Fj(BITPIX)32 b({)g(de\014nes)e(the)i(data)g(t)m(yp)s(e)g(of)g(the)g(arra)m(y:)43 b(8,)33 b(16,)g(32,)g(64,)g(-32,)g(-64)g(for)e(unsigned)f(8{bit)j(b)m (yte,)227 3284 y(16{bit)41 b(signed)f(in)m(teger,)j(32{bit)f(signed)d (in)m(teger,)44 b(32{bit)d(IEEE)e(\015oating)h(p)s(oin)m(t,)i(and)e (64{bit)h(IEEE)227 3397 y(double)30 b(precision)h(\015oating)g(p)s(oin) m(t,)g(resp)s(ectiv)m(ely)-8 b(.)136 3585 y Fc(\017)46 b Fj(NAXIS)30 b({)h(the)g(n)m(um)m(b)s(er)e(of)h(dimensions)g(in)g(the) h(arra)m(y)-8 b(,)31 b(usually)f(0,)h(1,)g(2,)g(3,)g(or)g(4.)136 3773 y Fc(\017)46 b Fj(NAXISn)30 b({)h(\(n)f(ranges)g(from)g(1)h(to)g (NAXIS\))g(de\014nes)e(the)i(size)g(of)g(eac)m(h)g(dimension.)0 4008 y(FITS)e(tables)i(start)g(with)f(the)g(k)m(eyw)m(ord)g(XTENSION)g (=)f(`T)-8 b(ABLE')31 b(\(for)f(ASCI)s(I)f(tables\))i(or)f(XTENSION)f (=)0 4120 y(`BINT)-8 b(ABLE')32 b(\(for)e(binary)g(tables\))h(and)f(ha) m(v)m(e)i(the)e(follo)m(wing)i(main)e(k)m(eyw)m(ords:)136 4355 y Fc(\017)46 b Fj(TFIELDS)30 b({)h(n)m(um)m(b)s(er)e(of)h (\014elds)g(or)h(columns)f(in)g(the)g(table)136 4543 y Fc(\017)46 b Fj(NAXIS2)31 b({)g(n)m(um)m(b)s(er)e(of)h(ro)m(ws)h(in)f (the)g(table)136 4731 y Fc(\017)46 b Fj(TTYPEn)29 b({)i(for)f(eac)m(h)i (column)e(\(n)g(ranges)h(from)f(1)g(to)h(TFIELDS\))g(giv)m(es)g(the)g (name)f(of)h(the)f(column)136 4918 y Fc(\017)46 b Fj(TF)m(ORMn)31 b({)f(the)h(data)g(t)m(yp)s(e)f(of)h(the)g(column)136 5106 y Fc(\017)46 b Fj(TUNITn)30 b({)g(the)h(ph)m(ysical)g(units)f(of)g (the)h(column)f(\(optional\))0 5341 y(Users)k(should)f(refer)h(to)h (the)f(FITS)g(Supp)s(ort)e(O\016ce)i(at)h Fe(http://fits.gsfc.nasa.gov) 27 b Fj(for)34 b(further)f(infor-)0 5454 y(mation)e(ab)s(out)f(the)h (FITS)e(format)i(and)f(related)h(soft)m(w)m(are)h(pac)m(k)-5 b(ages.)p eop end %%Page: 15 23 TeXDict begin 15 22 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.15) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.4) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(4)0 1687 y Fm(Programming)77 b(Guidelines)0 2060 y SDict begin H.S end 0 2060 a 0 2060 a SDict begin 13.6 H.A end 0 2060 a 0 2060 a SDict begin [/View [/XYZ H.V]/Dest (section.4.1) cvn /DEST pdfmark end 0 2060 a 156 x Ff(4.1)135 b(CFITSIO)44 b(De\014nitions)0 2466 y Fj(An)m(y)30 b(program)g(that)h (uses)f(the)h(CFITSIO)d(in)m(terface)k(m)m(ust)e(include)g(the)h (\014tsio.h)f(header)g(\014le)h(with)f(the)g(state-)0 2579 y(men)m(t)95 2818 y Fe(#include)46 b("fitsio.h")0 3057 y Fj(This)30 b(header)h(\014le)h(con)m(tains)g(the)f(protot)m(yp)s (es)h(for)f(all)h(the)f(CFITSIO)f(user)g(in)m(terface)j(routines)e(as)g (w)m(ell)h(as)g(the)0 3170 y(de\014nitions)g(of)g(v)-5 b(arious)32 b(constan)m(ts)h(used)e(in)h(the)h(in)m(terface.)47 b(It)32 b(also)h(de\014nes)e(a)i(C)f(structure)f(of)h(t)m(yp)s(e)h (`\014ts\014le')0 3283 y(that)j(is)g(used)f(b)m(y)g(CFITSIO)f(to)j (store)f(the)g(relev)-5 b(an)m(t)37 b(parameters)f(that)g(de\014ne)f (the)h(format)g(of)g(a)g(particular)0 3396 y(FITS)c(\014le.)48 b(Application)34 b(programs)f(m)m(ust)g(de\014ne)f(a)h(p)s(oin)m(ter)g (to)g(this)g(structure)g(for)f(eac)m(h)i(FITS)e(\014le)h(that)h(is)0 3508 y(to)i(b)s(e)f(op)s(ened.)56 b(This)35 b(structure)g(is)h (initialized)h(\(i.e.,)i(memory)c(is)h(allo)s(cated)h(for)f(the)g (structure\))f(when)g(the)0 3621 y(FITS)h(\014le)g(is)h(\014rst)e(op)s (ened)h(or)g(created)i(with)e(the)g(\014ts)p 1949 3621 28 4 v 33 w(op)s(en)p 2172 3621 V 32 w(\014le)g(or)h(\014ts)p 2596 3621 V 32 w(create)p 2864 3621 V 34 w(\014le)g(routines.)59 b(This)35 b(\014ts\014le)0 3734 y(p)s(oin)m(ter)c(is)h(then)f(passed)g (as)g(the)h(\014rst)e(argumen)m(t)i(to)g(ev)m(ery)g(other)g(CFITSIO)d (routine)j(that)g(op)s(erates)g(on)f(the)0 3847 y(FITS)h(\014le.)48 b(Application)34 b(programs)f(m)m(ust)g(not)g(directly)g(read)g(or)g (write)g(elemen)m(ts)h(in)f(this)g(\014ts\014le)f(structure)0 3960 y(b)s(ecause)e(the)h(de\014nition)f(of)h(the)f(structure)g(ma)m(y) h(c)m(hange)g(in)g(future)e(v)m(ersions)i(of)f(CFITSIO.)0 4120 y(A)45 b(n)m(um)m(b)s(er)e(of)i(sym)m(b)s(olic)g(constan)m(ts)h (are)f(also)g(de\014ned)f(in)g(\014tsio.h)h(for)f(the)h(con)m(v)m (enience)i(of)e(application)0 4233 y(programmers.)55 b(Use)35 b(of)h(these)f(sym)m(b)s(olic)h(constan)m(ts)g(rather)f(than)g (the)h(actual)g(n)m(umeric)f(v)-5 b(alue)36 b(will)f(help)g(to)0 4346 y(mak)m(e)c(the)g(source)f(co)s(de)h(more)g(readable)f(and)g (easier)i(for)e(others)g(to)h(understand.)0 4585 y Fe(String)46 b(Lengths,)g(for)h(use)f(when)h(allocating)e(character)g(arrays:)95 4811 y(#define)h(FLEN_FILENAME)e(1025)j(/*)g(max)g(length)f(of)h(a)h (filename)857 b(*/)95 4924 y(#define)46 b(FLEN_KEYWORD)140 b(72)95 b(/*)47 b(max)g(length)f(of)h(a)h(keyword)905 b(*/)95 5036 y(#define)46 b(FLEN_CARD)284 b(81)95 b(/*)47 b(max)g(length)f(of)h(a)h(FITS)f(header)f(card)476 b(*/)95 5149 y(#define)46 b(FLEN_VALUE)236 b(71)95 b(/*)47 b(max)g(length)f(of) h(a)h(keyword)e(value)g(string)285 b(*/)95 5262 y(#define)46 b(FLEN_COMMENT)140 b(73)95 b(/*)47 b(max)g(length)f(of)h(a)h(keyword)e (comment)g(string)189 b(*/)95 5375 y(#define)46 b(FLEN_ERRMSG)188 b(81)95 b(/*)47 b(max)g(length)f(of)h(a)h(CFITSIO)e(error)g(message)237 b(*/)95 5488 y(#define)46 b(FLEN_STATUS)188 b(31)95 b(/*)47 b(max)g(length)f(of)h(a)h(CFITSIO)e(status)g(text)g(string)h(*/)95 5714 y(Note)g(that)g(FLEN_KEYWORD)d(is)j(longer)f(than)h(the)g(nominal) f(8-character)f(keyword)1905 5942 y Fj(15)p eop end %%Page: 16 24 TeXDict begin 16 23 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.16) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(16)1763 b Fh(CHAPTER)29 b(4.)112 b(PR)m(OGRAMMING)32 b(GUIDELINES)95 555 y Fe(name)47 b(length)f(because)g(the)h(HIERARCH)e(convention)g (supports)h(longer)g(keyword)g(names.)0 781 y(Access)g(modes)g(when)h (opening)f(a)h(FITS)g(file:)95 1007 y(#define)f(READONLY)94 b(0)95 1120 y(#define)46 b(READWRITE)g(1)0 1346 y(BITPIX)g(data)h(type) f(code)h(values)f(for)h(FITS)g(images:)95 1571 y(#define)f(BYTE_IMG)284 b(8)96 b(/*)f(8-bit)46 b(unsigned)f(integers)h(*/)95 1684 y(#define)g(SHORT_IMG)189 b(16)95 b(/*)47 b(16-bit)141 b(signed)46 b(integers)g(*/)95 1797 y(#define)g(LONG_IMG)237 b(32)95 b(/*)47 b(32-bit)141 b(signed)46 b(integers)g(*/)95 1910 y(#define)g(LONGLONG_IMG)f(64)95 b(/*)47 b(64-bit)141 b(signed)46 b(integers)g(*/)95 2023 y(#define)g(FLOAT_IMG)141 b(-32)95 b(/*)47 b(32-bit)f(single)g(precision)f(floating)h(point)g(*/) 95 2136 y(#define)g(DOUBLE_IMG)93 b(-64)i(/*)47 b(64-bit)f(double)g (precision)f(floating)h(point)g(*/)95 2362 y(The)h(following)f(4)h (data)g(type)f(codes)h(are)g(also)f(supported)g(by)h(CFITSIO:)95 2475 y(#define)f(SBYTE_IMG)93 b(10)286 b(/*)95 b(8-bit)46 b(signed)g(integers,)g(equivalent)f(to)i(*/)1384 2588 y(/*)95 b(BITPIX)46 b(=)i(8,)f(BSCALE)f(=)h(1,)g(BZERO)g(=)g(-128)g(*/) 95 2700 y(#define)f(USHORT_IMG)93 b(20)238 b(/*)47 b(16-bit)f(unsigned) g(integers,)f(equivalent)g(to)i(*/)1384 2813 y(/*)95 b(BITPIX)46 b(=)i(16,)e(BSCALE)h(=)g(1,)g(BZERO)g(=)g(32768)f(*/)95 2926 y(#define)g(ULONG_IMG)141 b(40)238 b(/*)47 b(32-bit)f(unsigned)g (integers,)f(equivalent)g(to)i(*/)1384 3039 y(/*)95 b(BITPIX)46 b(=)i(32,)e(BSCALE)h(=)g(1,)g(BZERO)g(=)g(2147483648)e(*/)95 3152 y(#define)h(ULONGLONG_IMG)92 b(80)j(/*)47 b(64-bit)f(unsigned)g (integers,)f(equivalent)g(to)i(*/)1384 3265 y(/*)95 b(BITPIX)46 b(=)i(64,)e(BSCALE)h(=)g(1,)g(BZERO)g(=)g(9223372036854775808*/)0 3491 y(Codes)f(for)h(the)g(data)g(type)f(of)i(binary)e(table)g(columns) g(and/or)g(for)h(the)0 3604 y(data)g(type)f(of)h(variables)f(when)g (reading)g(or)h(writing)f(keywords)g(or)h(data:)1432 3830 y(DATATYPE)714 b(TFORM)46 b(CODE)95 3942 y(#define)g(TBIT)476 b(1)96 b(/*)1335 b('X')47 b(*/)95 4055 y(#define)f(TBYTE)381 b(11)95 b(/*)47 b(8-bit)f(unsigned)g(byte,)332 b('B')47 b(*/)95 4168 y(#define)f(TLOGICAL)237 b(14)95 b(/*)47 b(logicals)e(\(int)i(for)g(keywords)236 b(*/)1289 4281 y(/*)95 b(and)46 b(char)h(for)g(table)f(cols)142 b('L')47 b(*/)95 4394 y(#define)f(TSTRING)285 b(16)95 b(/*)47 b(ASCII)f(string,)666 b('A')47 b(*/)95 4507 y(#define)f(TSHORT)333 b(21)95 b(/*)47 b(signed)f(short,)666 b('I')47 b(*/)95 4620 y(#define)f(TLONG)381 b(41)95 b(/*)47 b(signed)f(long,)905 b(*/)95 4733 y(#define)46 b(TLONGLONG)189 b(81)95 b(/*)47 b(64-bit)f(long)h(signed)f(integer)f('K')i(*/)95 4846 y(#define)f(TFLOAT)333 b(42)95 b(/*)47 b(single)f(precision)f(float,) 189 b('E')47 b(*/)95 4959 y(#define)f(TDOUBLE)285 b(82)95 b(/*)47 b(double)f(precision)f(float,)189 b('D')47 b(*/)95 5072 y(#define)f(TCOMPLEX)237 b(83)95 b(/*)47 b(complex)f(\(pair)g(of)h (floats\))141 b('C')47 b(*/)95 5185 y(#define)f(TDBLCOMPLEX)f(163)95 b(/*)47 b(double)f(complex)g(\(2)h(doubles\))e('M')i(*/)95 5410 y(The)g(following)f(data)g(type)h(codes)f(are)h(also)g(supported)e (by)i(CFITSIO:)95 5523 y(#define)f(TINT)429 b(31)95 b(/*)47 b(int)1335 b(*/)95 5636 y(#define)46 b(TSBYTE)333 b(12)95 b(/*)47 b(8-bit)f(signed)g(byte,)428 b('S')47 b(*/)p eop end %%Page: 17 25 TeXDict begin 17 24 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.17) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(4.1.)72 b(CFITSIO)29 b(DEFINITIONS)2576 b Fj(17)95 555 y Fe(#define)46 b(TUINT)381 b(30)95 b(/*)47 b(unsigned)e(int)715 b('V')47 b(*/)95 668 y(#define)f(TUSHORT)285 b(20)95 b(/*)47 b(unsigned)e(short) 619 b('U')47 b(*/)95 781 y(#define)f(TULONG)333 b(40)95 b(/*)47 b(unsigned)e(long)858 b(*/)95 894 y(#define)46 b(TULONGLONG)141 b(80)95 b(/*)47 b(unsigned)e(long)i(long)428 b('W')47 b(*/)95 1120 y(The)g(following)f(data)g(type)h(code)g(is)g (only)f(for)h(use)g(with)g(fits\\_get\\_coltype)95 1233 y(#define)f(TINT32BIT)189 b(41)95 b(/*)47 b(signed)f(32-bit)g(int,)428 b('J')47 b(*/)0 1571 y(HDU)g(type)g(code)f(values)g(\(value)g(returned) g(when)h(moving)f(to)h(new)g(HDU\):)95 1797 y(#define)f(IMAGE_HDU)93 b(0)i(/*)48 b(Primary)d(Array)i(or)g(IMAGE)f(HDU)h(*/)95 1910 y(#define)f(ASCII_TBL)93 b(1)i(/*)48 b(ASCII)94 b(table)46 b(HDU)h(*/)95 2023 y(#define)f(BINARY_TBL)f(2)95 b(/*)48 b(Binary)e(table)g(HDU)h(*/)95 2136 y(#define)f(ANY_HDU)142 b(-1)94 b(/*)48 b(matches)d(any)i(type)g(of)g(HDU)g(*/)0 2362 y(Column)f(name)h(and)g(string)f(matching)f(case-sensitivity:)95 2588 y(#define)h(CASESEN)142 b(1)g(/*)48 b(do)f(case-sensitive)d (string)i(match)g(*/)95 2700 y(#define)g(CASEINSEN)g(0)142 b(/*)48 b(do)f(case-insensitive)c(string)j(match)h(*/)0 2926 y(Logical)f(states)g(\(if)h(TRUE)f(and)h(FALSE)g(are)g(not)g (already)e(defined\):)95 3152 y(#define)h(TRUE)h(1)95 3265 y(#define)f(FALSE)h(0)0 3491 y(Values)f(to)h(represent)f (undefined)f(floating)g(point)i(numbers:)95 3717 y(#define)f (FLOATNULLVALUE)92 b(-9.11912E-36F)95 3830 y(#define)46 b(DOUBLENULLVALUE)e(-9.1191291391491E-36)0 4055 y(Image)i(compression)f (algorithm)g(definitions)95 4281 y(#define)h(RICE_1)333 b(11)95 4394 y(#define)46 b(GZIP_1)333 b(21)95 4507 y(#define)46 b(GZIP_2)333 b(22)95 4620 y(#define)46 b(PLIO_1)333 b(31)95 4733 y(#define)46 b(HCOMPRESS_1)93 b(41)95 4846 y(#define)46 b(NOCOMPRESS)93 b(-1)95 5072 y(#define)46 b(NO_DITHER)g(-1)95 5185 y(#define)g(SUBTRACTIVE_DITHER_1)d(1)95 5297 y(#define)j (SUBTRACTIVE_DITHER_2)d(2)p eop end %%Page: 18 26 TeXDict begin 18 25 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.18) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(18)1763 b Fh(CHAPTER)29 b(4.)112 b(PR)m(OGRAMMING)32 b(GUIDELINES)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (section.4.2) cvn /DEST pdfmark end 0 464 a 91 x Ff(4.2)135 b(Curren)l(t)46 b(Header)f(Data)h(Unit)g(\(CHDU\))0 811 y Fj(The)37 b(concept)h(of)g(the)f(Curren)m(t)g(Header)g(and)g(Data)i (Unit,)h(or)d(CHDU,)h(is)f(fundamen)m(tal)h(to)g(the)f(use)g(of)h(the)0 924 y(CFITSIO)31 b(library)-8 b(.)46 b(A)32 b(simple)h(FITS)e(image)j (ma)m(y)f(only)f(con)m(tain)i(a)e(single)h(Header)g(and)f(Data)h(unit)f (\(HDU\),)0 1037 y(but)39 b(in)g(general)i(FITS)e(\014les)h(can)g(con)m (tain)h(m)m(ultiple)g(Header)f(Data)h(Units)f(\(also)h(kno)m(wn)e(as)h (`extensions'\),)0 1150 y(concatenated)c(one)f(after)f(the)h(other)f (in)g(the)g(\014le.)53 b(The)33 b(user)h(can)g(sp)s(ecify)g(whic)m(h)g (HDU)h(should)e(b)s(e)g(initially)0 1263 y(op)s(ened)j(at)i(run)d(time) j(b)m(y)f(giving)h(the)f(HDU)h(name)f(or)g(n)m(um)m(b)s(er)f(after)h (the)g(ro)s(ot)h(\014le)f(name.)60 b(F)-8 b(or)38 b(example,)0 1376 y('m)m(y\014le.\014ts[4]')i(op)s(ens)d(the)h(5th)h(HDU)g(in)f(the) g(\014le)g(\(note)h(that)g(the)f(n)m(um)m(b)s(ering)f(starts)i(with)f (0\),)j(and)c('m)m(y-)0 1489 y(\014le.\014ts[EVENTS])k(op)s(ens)f(the)h (HDU)h(with)e(the)h(name)g('EVENTS')g(\(as)g(de\014ned)f(b)m(y)h(the)g (EXTNAME)g(or)0 1602 y(HDUNAME)35 b(k)m(eyw)m(ords\).)50 b(If)33 b(no)g(HDU)h(is)f(sp)s(eci\014ed)g(then)g(CFITSIO)e(op)s(ens)i (the)g(\014rst)g(HDU)h(\(the)g(primary)0 1715 y(arra)m(y\))24 b(b)m(y)e(default.)39 b(The)22 b(CFITSIO)f(routines)i(whic)m(h)g(read)f (and)g(write)i(data)f(only)g(op)s(erate)g(within)g(the)g(op)s(ened)0 1827 y(HDU,)32 b(Other)e(CFITSIO)f(routines)i(are)g(pro)m(vided)f(to)i (mo)m(v)m(e)g(to)f(and)f(op)s(en)g(an)m(y)h(other)g(existing)h(HDU)f (within)0 1940 y(the)g(FITS)e(\014le)i(or)f(to)h(app)s(end)e(or)h (insert)g(new)g(HDUs)h(in)f(the)h(FITS)f(\014le.)0 2124 y SDict begin H.S end 0 2124 a 0 2124 a SDict begin 13.6 H.A end 0 2124 a 0 2124 a SDict begin [/View [/XYZ H.V]/Dest (section.4.3) cvn /DEST pdfmark end 0 2124 a 179 x Ff(4.3)135 b(F)-11 b(unction)44 b(Names)i(and)f(V)-11 b(ariable)46 b(Datat)l(yp)t(es)0 2559 y Fj(Most)33 b(of)f(the)g (CFITSIO)f(routines)h(ha)m(v)m(e)h(b)s(oth)e(a)i(short)e(name)h(as)h(w) m(ell)g(as)f(a)g(longer)h(descriptiv)m(e)g(name.)45 b(The)0 2672 y(short)32 b(name)g(is)g(only)g(5)h(or)f(6)g(c)m(haracters)h(long) g(and)f(is)g(similar)g(to)h(the)f(subroutine)f(name)h(in)g(the)g(F)-8 b(ortran-77)0 2785 y(v)m(ersion)38 b(of)g(FITSIO.)f(The)h(longer)g (name)g(is)g(more)g(descriptiv)m(e)h(and)e(it)h(is)g(recommended)g (that)g(it)h(b)s(e)e(used)0 2898 y(instead)31 b(of)f(the)h(short)f (name)g(to)h(more)g(clearly)h(do)s(cumen)m(t)e(the)g(source)h(co)s(de.) 0 3058 y(Man)m(y)c(of)f(the)g(CFITSIO)f(routines)h(come)h(in)e (families)i(whic)m(h)f(di\013er)g(only)g(in)g(the)g(data)h(t)m(yp)s(e)f (of)g(the)g(asso)s(ciated)0 3171 y(parameter\(s\).)45 b(The)31 b(data)h(t)m(yp)s(e)g(of)g(these)g(routines)f(is)h(indicated)g (b)m(y)f(the)h(su\016x)e(of)i(the)g(routine)f(name.)44 b(The)0 3284 y(short)27 b(routine)h(names)g(ha)m(v)m(e)h(a)f(1)g(or)f (2)h(c)m(haracter)i(su\016x)c(\(e.g.,)31 b('j')c(in)h('\013pkyj'\))g (while)f(the)h(long)g(routine)g(names)0 3397 y(ha)m(v)m(e)k(a)e(4)h(c)m (haracter)h(or)e(longer)h(su\016x)f(as)g(sho)m(wn)g(in)g(the)h(follo)m (wing)h(table:)191 3681 y Fe(Long)285 b(Short)94 b(Data)191 3794 y(Names)237 b(Names)94 b(Type)191 3907 y(-----)237 b(-----)94 b(----)191 4020 y(_bit)381 b(x)190 b(bit)191 4133 y(_byt)381 b(b)190 b(unsigned)46 b(byte)191 4246 y(_sbyt)333 b(sb)142 b(signed)46 b(byte)191 4359 y(_sht)381 b(i)190 b(short)47 b(integer)191 4472 y(_lng)381 b(j)190 b(long)47 b(integer)191 4585 y(_lnglng)237 b(jj)142 b(8-byte)46 b(LONGLONG)g(integer)g(\(see)g(note)h(below\))191 4698 y(_usht)333 b(ui)142 b(unsigned)46 b(short)g(integer)191 4811 y(_ulng)333 b(uj)142 b(unsigned)46 b(long)g(integer)191 4924 y(_ulnglng)189 b(ujj)94 b(unsigned)46 b(long)g(long)h(integer)191 5036 y(_uint)333 b(uk)142 b(unsigned)46 b(int)h(integer)191 5149 y(_int)381 b(k)190 b(int)47 b(integer)191 5262 y(_flt)381 b(e)190 b(real)47 b(exponential)e(floating)g(point)i(\(float\))191 5375 y(_fixflt)237 b(f)190 b(real)47 b(fixed-decimal)d(format)i (floating)g(point)g(\(float\))191 5488 y(_dbl)381 b(d)190 b(double)46 b(precision)g(real)g(floating-point)e(\(double\))191 5601 y(_fixdbl)237 b(g)190 b(double)46 b(precision)g(fixed-format)e (floating)i(point)g(\(double\))191 5714 y(_cmp)381 b(c)190 b(complex)46 b(reals)g(\(pairs)h(of)g(float)f(values\))p eop end %%Page: 19 27 TeXDict begin 19 26 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.19) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(4.3.)72 b(FUNCTION)30 b(NAMES)h(AND)g(V)-10 b(ARIABLE)30 b(D)m(A)-8 b(T)g(A)g(TYPES)1409 b Fj(19)191 555 y Fe(_fixcmp)237 b(fc)142 b(complex)46 b(reals,)g(fixed-format)f(floating)g(point)191 668 y(_dblcmp)237 b(m)190 b(double)46 b(precision)g(complex)f(\(pairs)i (of)g(double)f(values\))191 781 y(_fixdblcmp)93 b(fm)142 b(double)46 b(precision)g(complex,)f(fixed-format)g(floating)g(point) 191 894 y(_log)381 b(l)190 b(logical)46 b(\(int\))191 1007 y(_str)381 b(s)190 b(character)46 b(string)0 1273 y Fj(The)32 b(logical)j(data)f(t)m(yp)s(e)f(corresp)s(onds)e(to)j(`in)m (t')f(for)g(logical)i(k)m(eyw)m(ord)e(v)-5 b(alues,)34 b(and)e(`b)m(yte')i(for)f(logical)i(binary)0 1386 y(table)40 b(columns.)67 b(In)39 b(other)g(w)m(ords,)i(the)f(v)-5 b(alue)39 b(when)g(writing)g(a)h(logical)h(k)m(eyw)m(ord)f(m)m(ust)f(b) s(e)g(stored)g(in)g(an)0 1499 y(`in)m(t')g(v)-5 b(ariable,)40 b(and)e(m)m(ust)f(b)s(e)g(stored)h(in)g(a)g(`c)m(har')h(arra)m(y)f (when)f(reading)h(or)f(writing)h(to)h(`L')f(columns)f(in)h(a)0 1612 y(binary)c(table.)56 b(Implicit)35 b(data)h(t)m(yp)s(e)f(con)m(v)m (ersion)i(is)e(not)g(supp)s(orted)e(for)i(logical)j(table)e(columns,)g (but)e(is)h(for)0 1725 y(k)m(eyw)m(ords,)30 b(so)f(a)h(logical)h(k)m (eyw)m(ord)f(ma)m(y)f(b)s(e)g(read)f(and)h(cast)h(to)g(an)m(y)f(n)m (umerical)h(data)f(t)m(yp)s(e;)h(a)g(returned)d(v)-5 b(alue)0 1838 y(=)30 b(0)h(indicates)g(false,)g(and)f(an)m(y)h(other)f (v)-5 b(alue)31 b(=)f(true.)0 1998 y(The)24 b(`in)m(t')i(data)g(t)m(yp) s(e)f(ma)m(y)h(b)s(e)e(2)h(b)m(ytes)h(long)f(on)g(some)g(old)g(PC)g (compilers,)h(but)f(otherwise)g(it)g(is)g(nearly)g(alw)m(a)m(ys)0 2111 y(4)i(b)m(ytes)g(long.)40 b(Some)27 b(64-bit)h(mac)m(hines,)g(lik) m(e)g(the)f(Alpha/OSF,)g(de\014ne)f(the)h(`short',)h(`in)m(t',)h(and)d (`long')i(in)m(teger)0 2224 y(data)j(t)m(yp)s(es)f(to)i(b)s(e)d(2,)i (4,)g(and)f(8)h(b)m(ytes)g(long,)g(resp)s(ectiv)m(ely)-8 b(.)0 2384 y(Because)40 b(there)e(is)h(no)f(univ)m(ersal)h(C)f (compiler)g(standard)g(for)g(the)h(name)f(of)h(the)f(8-b)m(yte)i(in)m (teger)g(datat)m(yp)s(e,)0 2497 y(the)33 b(\014tsio.h)h(include)f (\014le)g(t)m(yp)s(edef)7 b('s)33 b('LONGLONG')h(to)g(b)s(e)e(equiv)-5 b(alen)m(t)35 b(to)f(an)f(appropriate)g(8-b)m(yte)i(in)m(teger)0 2610 y(data)c(t)m(yp)s(e)g(on)f(eac)m(h)i(supp)s(orted)d(platform.)41 b(F)-8 b(or)31 b(maxim)m(um)f(soft)m(w)m(are)i(p)s(ortabilit)m(y)g(it)f (is)f(recommended)g(that)0 2723 y(this)g(LONGLONG)g(datat)m(yp)s(e)h(b) s(e)e(used)g(to)i(de\014ne)e(8-b)m(yte)i(in)m(teger)h(v)-5 b(ariables)30 b(rather)g(than)g(using)f(the)i(nativ)m(e)0 2835 y(data)h(t)m(yp)s(e)g(name)f(on)h(a)f(particular)h(platform.)44 b(On)31 b(most)h(32-bit)g(Unix)g(and)e(Mac)j(OS-X)e(op)s(erating)h (systems)0 2948 y(LONGLONG)h(is)f(equiv)-5 b(alen)m(t)34 b(to)f(the)g(in)m(trinsic)g('long)g(long')h(8-b)m(yte)g(in)m(teger)f (datat)m(yp)s(e.)49 b(On)31 b(64-bit)j(systems)0 3061 y(\(whic)m(h)e(curren)m(tly)g(includes)f(Alpha)h(OSF/1,)g(64-bit)h(Sun) e(Solaris,)h(64-bit)h(SGI)f(MIPS,)f(and)g(64-bit)i(Itanium)0 3174 y(and)28 b(Opteron)g(PC)h(systems\),)g(LONGLONG)g(is)g(simply)f(t) m(yp)s(edef)7 b('ed)29 b(to)g(b)s(e)g(equiv)-5 b(alen)m(t)30 b(to)f('long'.)42 b(Microsoft)0 3287 y(Visual)33 b(C++)e(V)-8 b(ersion)33 b(6.0)g(do)s(es)f(not)g(de\014ne)g(a)h('long)g(long')g (data)g(t)m(yp)s(e,)g(so)f(LONGLONG)h(is)f(t)m(yp)s(edef)7 b('ed)32 b(to)0 3400 y(b)s(e)e(equiv)-5 b(alen)m(t)32 b(to)f(the)f(')p 853 3400 28 4 v 887 3400 V 66 w(in)m(t64')i(data)f(t)m (yp)s(e)g(on)f(32-bit)h(windo)m(ws)f(systems)h(when)e(using)h(Visual)h (C++.)0 3560 y(A)j(related)h(issue)e(that)i(a\013ects)g(the)f(p)s (ortabilit)m(y)g(of)g(soft)m(w)m(are)i(is)d(ho)m(w)h(to)h(prin)m(t)e (out)h(the)g(v)-5 b(alue)34 b(of)g(a)g('LONG-)0 3673 y(LONG')e(v)-5 b(ariable)32 b(with)f(prin)m(tf.)44 b(Dev)m(elop)s(ers) 33 b(ma)m(y)f(\014nd)e(it)i(con)m(v)m(enien)m(t)h(to)g(use)e(the)h (follo)m(wing)h(prepro)s(cessing)0 3786 y(statemen)m(ts)f(in)e(their)h (C)f(programs)g(to)h(handle)f(this)g(in)g(a)h(mac)m(hine-p)s(ortable)g (manner:)0 4052 y Fe(#if)47 b(defined\(_MSC_VER\))c(/*)k(Microsoft)e (Visual)i(C++)f(*/)477 4165 y(printf\("\045I64d",)e(longlongvalue\);)0 4391 y(#elif)i(\(USE_LL_SUFFIX)e(==)j(1\))477 4504 y (printf\("\045lld",)d(longlongvalue\);)0 4730 y(#else)477 4843 y(printf\("\045ld",)g(longlongvalue\);)0 4956 y(#endif)0 5222 y Fj(Similarly)-8 b(,)32 b(the)f(name)g(of)g(the)h(C)e(utilit)m(y) j(routine)e(that)g(con)m(v)m(erts)i(a)e(c)m(haracter)i(string)d(of)i (digits)f(in)m(to)h(a)g(8-b)m(yte)0 5335 y(in)m(teger)g(v)-5 b(alue)31 b(is)f(platform)g(dep)s(enden)m(t:)0 5601 y Fe(#if)47 b(defined\(_MSC_VER\))c(/*)k(Microsoft)e(Visual)i(C++)f(*/) 286 5714 y(/*)i(VC++)e(6.0)h(does)g(not)g(seem)f(to)h(have)g(an)g (8-byte)f(conversion)f(routine)h(*/)p eop end %%Page: 20 28 TeXDict begin 20 27 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.20) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(20)1763 b Fh(CHAPTER)29 b(4.)112 b(PR)m(OGRAMMING)32 b(GUIDELINES)0 668 y Fe(#elif)46 b(\(USE_LL_SUFFIX)e(==)j(1\))477 781 y(longlongvalue)d(=)k(atoll\(*string\);)0 1007 y(#else)477 1120 y(longlongvalue)c(=)k(atol\(*string\);)0 1233 y(#endif)0 1475 y Fj(When)23 b(dealing)h(with)f(the)h(FITS)f(b)m(yte)h(data)g(t)m (yp)s(e)f(it)h(is)g(imp)s(ortan)m(t)f(to)h(remem)m(b)s(er)f(that)h(the) g(ra)m(w)f(v)-5 b(alues)24 b(\(b)s(efore)0 1588 y(an)m(y)h(scaling)g(b) m(y)f(the)h(BSCALE)e(and)h(BZER)m(O,)g(or)h(TSCALn)d(and)i(TZER)m(On)f (k)m(eyw)m(ord)i(v)-5 b(alues\))25 b(in)f(b)m(yte)h(arra)m(ys)0 1700 y(\(BITPIX)37 b(=)f(8\))h(or)f(b)m(yte)i(columns)e(\(TF)m(ORMn)h (=)f('B'\))h(are)g(in)m(terpreted)g(as)g(unsigned)e(b)m(ytes)i(with)g (v)-5 b(alues)0 1813 y(ranging)34 b(from)g(0)g(to)h(255.)53 b(Some)34 b(C)g(compilers)h(de\014ne)e(a)h('c)m(har')h(v)-5 b(ariable)35 b(as)g(signed,)g(so)f(it)h(is)f(imp)s(ortan)m(t)g(to)0 1926 y(explicitly)e(declare)f(a)g(n)m(umeric)f(c)m(har)h(v)-5 b(ariable)31 b(as)g('unsigned)e(c)m(har')i(to)g(a)m(v)m(oid)h(an)m(y)f (am)m(biguit)m(y)0 2086 y(One)22 b(feature)h(of)g(the)g(CFITSIO)e (routines)i(is)f(that)i(they)f(can)g(op)s(erate)g(on)f(a)h(`X')h (\(bit\))f(column)g(in)f(a)h(binary)f(table)0 2199 y(as)33 b(though)f(it)h(w)m(ere)g(a)g(`B')g(\(b)m(yte\))h(column.)47 b(F)-8 b(or)33 b(example)g(a)g(`11X')h(data)f(t)m(yp)s(e)g(column)f (can)h(b)s(e)f(in)m(terpreted)0 2312 y(the)c(same)h(as)f(a)g(`2B')i (column)e(\(i.e.,)i(2)e(unsigned)f(8-bit)i(b)m(ytes\).)41 b(In)27 b(some)i(instances,)g(it)f(can)h(b)s(e)e(more)h(e\016cien)m(t)0 2425 y(to)j(read)f(and)g(write)h(whole)f(b)m(ytes)h(at)g(a)g(time,)g (rather)g(than)f(reading)g(or)h(writing)f(eac)m(h)i(individual)d(bit.)0 2585 y(The)36 b(complex)i(and)e(double)h(precision)g(complex)h(data)g (t)m(yp)s(es)f(are)g(not)g(directly)h(supp)s(orted)d(in)i(ANSI)f(C)h (so)0 2698 y(these)g(data)g(t)m(yp)s(es)f(should)f(b)s(e)h(in)m (terpreted)h(as)f(pairs)g(of)h(\015oat)g(or)f(double)g(v)-5 b(alues,)38 b(resp)s(ectiv)m(ely)-8 b(,)40 b(where)c(the)0 2811 y(\014rst)30 b(v)-5 b(alue)30 b(in)h(eac)m(h)g(pair)f(is)h(the)f (real)h(part,)g(and)e(the)i(second)f(is)h(the)f(imaginary)h(part.)0 2963 y SDict begin H.S end 0 2963 a 0 2963 a SDict begin 13.6 H.A end 0 2963 a 0 2963 a SDict begin [/View [/XYZ H.V]/Dest (section.4.4) cvn /DEST pdfmark end 0 2963 a 179 x Ff(4.4)135 b(Supp)t(ort)44 b(for)h(Unsigned)h(In)l(tegers)g(and)f (Signed)g(Bytes)0 3392 y Fj(Although)33 b(FITS)f(do)s(es)g(not)h (directly)h(supp)s(ort)d(unsigned)g(in)m(tegers)j(as)f(one)g(of)g(its)h (fundamen)m(tal)e(data)i(t)m(yp)s(es,)0 3505 y(FITS)27 b(can)h(still)h(b)s(e)e(used)g(to)i(e\016cien)m(tly)h(store)e(unsigned) f(in)m(teger)i(data)g(v)-5 b(alues)28 b(in)g(images)h(and)e(binary)g (tables.)0 3618 y(The)42 b(con)m(v)m(en)m(tion)j(used)d(in)g(FITS)g (\014les)h(is)f(to)i(store)f(the)g(unsigned)e(in)m(tegers)j(as)f (signed)g(in)m(tegers)h(with)e(an)0 3731 y(asso)s(ciated)34 b(o\013set)f(\(sp)s(eci\014ed)f(b)m(y)g(the)g(BZER)m(O)g(or)g(TZER)m (On)f(k)m(eyw)m(ord\).)47 b(F)-8 b(or)33 b(example,)g(to)g(store)g (unsigned)0 3844 y(16-bit)g(in)m(teger)g(v)-5 b(alues)32 b(in)f(a)h(FITS)f(image)i(the)e(image)i(w)m(ould)f(b)s(e)e(de\014ned)h (as)h(a)g(signed)f(16-bit)i(in)m(teger)g(\(with)0 3957 y(BITPIX)c(k)m(eyw)m(ord)g(=)g(SHOR)-8 b(T)p 1132 3957 28 4 v 32 w(IMG)30 b(=)e(16\))j(with)d(the)i(k)m(eyw)m(ords)f(BSCALE)f (=)h(1.0)h(and)f(BZER)m(O)g(=)f(32768.)0 4070 y(Th)m(us)34 b(the)h(unsigned)f(v)-5 b(alues)35 b(of)g(0,)i(32768,)h(and)d(65535,)j (for)d(example,)i(are)e(ph)m(ysically)h(stored)f(in)g(the)g(FITS)0 4183 y(image)40 b(as)e(-32768,)43 b(0,)e(and)d(32767,)k(resp)s(ectiv)m (ely;)i(CFITSIO)37 b(automatically)k(adds)c(the)i(BZER)m(O)f(o\013set)h (to)0 4296 y(these)g(v)-5 b(alues)39 b(when)f(they)g(are)h(read.)65 b(Similarly)-8 b(,)42 b(in)c(the)h(case)h(of)e(unsigned)g(32-bit)i(in)m (tegers)f(the)g(BITPIX)0 4408 y(k)m(eyw)m(ord)c(w)m(ould)f(b)s(e)g (equal)h(to)h(LONG)p 1392 4408 V 32 w(IMG)f(=)g(32)g(and)f(BZER)m(O)g (w)m(ould)h(b)s(e)f(equal)h(to)g(2147483648)k(\(i.e.)55 b(2)0 4521 y(raised)30 b(to)h(the)g(31st)g(p)s(o)m(w)m(er\).)0 4681 y(The)j(CFITSIO)g(in)m(terface)i(routines)f(will)g(e\016cien)m (tly)i(and)d(transparen)m(tly)i(apply)e(the)h(appropriate)g(o\013set)h (in)0 4794 y(these)29 b(cases)h(so)f(in)g(general)h(application)g (programs)f(do)g(not)g(need)f(to)i(b)s(e)e(concerned)h(with)g(ho)m(w)g (the)g(unsigned)0 4907 y(v)-5 b(alues)33 b(are)h(actually)g(stored)g (in)e(the)i(FITS)e(\014le.)49 b(As)33 b(a)g(con)m(v)m(enience)i(for)e (users,)g(CFITSIO)f(has)h(sev)m(eral)h(pre-)0 5020 y(de\014ned)f (constan)m(ts)i(for)e(the)h(v)-5 b(alue)35 b(of)f(BITPIX)f(\(USHOR)-8 b(T)p 2153 5020 V 33 w(IMG,)35 b(ULONG)p 2768 5020 V 33 w(IMG,)f(ULONGLONG)p 3649 5020 V 33 w(IMG\))0 5133 y(and)j(for)g(the)g(TF)m(ORMn)g(v)-5 b(alue)38 b(in)f(the)g(case)h(of)g (binary)e(tables)i(\(`U',)g(`V',)h(and)d(`W'\))j(whic)m(h)e (programmers)0 5246 y(can)31 b(use)g(when)f(creating)i(FITS)e(\014les)h (con)m(taining)h(unsigned)e(in)m(teger)i(v)-5 b(alues.)42 b(The)31 b(follo)m(wing)h(co)s(de)f(fragmen)m(t)0 5359 y(illustrates)g(ho)m(w)g(to)g(write)g(a)f(FITS)g(1-D)h(primary)f(arra)m (y)h(of)f(unsigned)g(16-bit)h(in)m(tegers:)286 5601 y Fe(unsigned)46 b(short)g(uarray[100];)286 5714 y(int)h(naxis,)f (status;)p eop end %%Page: 21 29 TeXDict begin 21 28 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.21) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(4.4.)72 b(SUPPOR)-8 b(T)30 b(F)m(OR)g(UNSIGNED)h(INTEGERS)f(AND)h(SIGNED)f (BYTES)942 b Fj(21)286 555 y Fe(long)47 b(naxes[10],)e(group,)h (firstelem,)f(nelements;)334 668 y(...)286 781 y(status)h(=)i(0;)286 894 y(naxis)f(=)g(1;)286 1007 y(naxes[0])f(=)h(100;)286 1120 y(fits_create_img\(fptr,)42 b(USHORT_IMG,)j(naxis,)h(naxes,)g (&status\);)286 1346 y(firstelem)g(=)h(1;)286 1458 y(nelements)f(=)h (100;)286 1571 y(fits_write_img\(fptr,)c(TUSHORT,)i(firstelem,)g (nelements,)1241 1684 y(uarray,)h(&status\);)334 1797 y(...)0 2038 y Fj(In)40 b(the)h(ab)s(o)m(v)m(e)i(example,)h(the)e(2nd)e (parameter)h(in)g(\014ts)p 1998 2038 28 4 v 33 w(create)p 2267 2038 V 34 w(img)g(tells)h(CFITSIO)e(to)i(write)f(the)g(header)0 2151 y(k)m(eyw)m(ords)34 b(appropriate)g(for)f(an)g(arra)m(y)i(of)e (16-bit)i(unsigned)e(in)m(tegers)i(\(i.e.,)h(BITPIX)d(=)g(16)i(and)e (BZER)m(O)g(=)0 2264 y(32768\).)41 b(Then)23 b(the)h(\014ts)p 834 2264 V 32 w(write)p 1068 2264 V 33 w(img)h(routine)f(writes)f(the)i (arra)m(y)f(of)g(unsigned)f(short)g(in)m(tegers)i(\(uarra)m(y\))g(in)m (to)g(the)0 2377 y(primary)f(arra)m(y)h(of)g(the)g(FITS)f(\014le.)39 b(Similarly)-8 b(,)27 b(a)e(32-bit)i(unsigned)c(in)m(teger)j(image)h (ma)m(y)e(b)s(e)f(created)i(b)m(y)f(setting)0 2490 y(the)34 b(second)f(parameter)h(in)f(\014ts)p 1130 2490 V 33 w(create)p 1399 2490 V 34 w(img)h(equal)g(to)g(`ULONG)p 2330 2490 V 33 w(IMG')g(and)f(b)m(y)h(calling)g(the)g(\014ts)p 3491 2490 V 33 w(write)p 3726 2490 V 33 w(img)0 2603 y(routine)j(with)f(the)h(second)f(parameter)h(=)f(TULONG)h(to)g(write)g (the)f(arra)m(y)h(of)g(unsigned)f(long)h(image)h(pixel)0 2716 y(v)-5 b(alues.)0 2876 y(An)27 b(analogous)h(set)f(of)g(routines)g (are)g(a)m(v)-5 b(ailable)30 b(for)c(reading)h(or)g(writing)g(unsigned) f(in)m(teger)i(v)-5 b(alues)28 b(and)e(signed)0 2989 y(b)m(yte)i(v)-5 b(alues)28 b(in)g(a)g(FITS)f(binary)g(table)i (extension.)40 b(When)28 b(sp)s(ecifying)f(the)h(TF)m(ORMn)g(k)m(eyw)m (ord)g(v)-5 b(alue)28 b(whic)m(h)0 3102 y(de\014nes)37 b(the)h(format)g(of)g(a)h(column,)h(CFITSIO)c(recognizes)j(4)g (additional)g(data)f(t)m(yp)s(e)g(co)s(des)g(b)s(esides)f(those)0 3215 y(already)j(de\014ned)e(in)g(the)i(FITS)e(standard:)57 b(`U')40 b(meaning)f(a)h(16-bit)g(unsigned)e(in)m(teger)j(column,)g (`V')f(for)f(a)0 3328 y(32-bit)29 b(unsigned)f(in)m(teger)h(column,)g (`W')g(for)f(a)g(64-bit)i(unsigned)d(in)m(teger)i(column,)g(and)f('S')g (for)g(a)g(signed)g(b)m(yte)0 3440 y(column.)39 b(These)24 b(non-standard)f(data)j(t)m(yp)s(e)e(co)s(des)h(are)g(not)g(actually)h (written)e(in)m(to)i(the)e(FITS)g(\014le)h(but)f(instead)0 3553 y(are)30 b(just)f(used)g(in)m(ternally)i(within)e(CFITSIO.)f(The)i (follo)m(wing)h(co)s(de)f(fragmen)m(t)g(illustrates)h(ho)m(w)f(to)g (use)f(these)0 3666 y(features:)286 3907 y Fe(unsigned)46 b(short)g(uarray[100];)286 4020 y(unsigned)g(int)95 b(varray[100];)286 4246 y(int)47 b(colnum,)f(tfields,)g(status;)286 4359 y(long)h(nrows,)f(firstrow,)f(firstelem,)g(nelements,)g(pcount;)286 4585 y(char)i(extname[])e(=)j("Test_table";)521 b(/*)47 b(extension)f(name)g(*/)286 4811 y(/*)i(define)e(the)h(name,)f(data)h (type,)f(and)h(physical)e(units)i(for)g(4)g(columns)f(*/)286 4924 y(char)h(*ttype[])f(=)h({)g("Col_1",)f("Col_2",)g("Col_3",)f ("Col_4")h(};)286 5036 y(char)h(*tform[])f(=)h({)g("1U",)285 b("1V",)190 b("1W",)g("1S"};)93 b(/*)48 b(special)d(CFITSIO)h(codes)h (*/)286 5149 y(char)g(*tunit[])f(=)h({)g(")h(",)381 b(")48 b(",)190 b(")47 b(",)191 b(")47 b(")h(};)334 5262 y(...)525 5488 y(/*)f(write)g(the)f(header)h(keywords)e(*/)286 5601 y(status)94 b(=)48 b(0;)286 5714 y(nrows)142 b(=)48 b(1;)p eop end %%Page: 22 30 TeXDict begin 22 29 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.22) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(22)1763 b Fh(CHAPTER)29 b(4.)112 b(PR)m(OGRAMMING)32 b(GUIDELINES)286 555 y Fe(tfields)46 b(=)i(3)286 668 y(pcount)94 b(=)48 b(0;)286 781 y(fits_create_tbl\(fptr,)42 b(BINARY_TBL,)j(nrows,)h (tfields,)g(ttype,)g(tform,)764 894 y(tunit,)g(extname,)f(&status\);) 525 1120 y(/*)i(write)g(the)f(unsigned)g(shorts)g(to)h(the)g(1st)g (column)f(*/)286 1233 y(colnum)190 b(=)47 b(1;)286 1346 y(firstrow)94 b(=)47 b(1;)286 1458 y(firstelem)f(=)h(1;)286 1571 y(nelements)f(=)h(100;)286 1684 y(fits_write_col\(fptr,)c (TUSHORT,)i(colnum,)h(firstrow,)f(firstelem,)668 1797 y(nelements,)g(uarray,)h(&status\);)525 2023 y(/*)h(now)g(write)f(the)h (unsigned)f(longs)g(to)h(the)g(2nd)g(column)f(*/)286 2136 y(colnum)190 b(=)47 b(2;)286 2249 y(fits_write_col\(fptr,)c (TUINT,)j(colnum,)g(firstrow,)f(firstelem,)668 2362 y(nelements,)g (varray,)h(&status\);)334 2475 y(...)0 2752 y Fj(Note)34 b(that)e(the)h(non-standard)e(TF)m(ORM)i(v)-5 b(alues)32 b(for)g(the)h(3)f(columns,)h(`U',)g(`V',)g(and)f(`W')h(tell)g(CFITSIO)e (to)0 2865 y(write)i(the)g(k)m(eyw)m(ords)g(appropriate)f(for)h (unsigned)e(16-bit,)k(unsigned)c(32-bit)j(and)e(unsigned)g(64-bit)h(in) m(tegers,)0 2978 y(resp)s(ectiv)m(ely)27 b(\(i.e.,)i(TF)m(ORMn)d(=)f ('1I')i(and)f(TZER)m(On)e(=)i(32768)i(for)e(unsigned)f(16-bit)i(in)m (tegers,)h(TF)m(ORMn)e(=)0 3091 y('1J')j(and)g(TZER)m(On)e(=)h (2147483648)34 b(for)28 b(unsigned)g(32-bit)i(in)m(tegers,)h(and)d(TF)m (ORMn)g(=)h('1K')g(and)f(TZER)m(On)0 3204 y(=)34 b(92233720368547)q (758)q(08)41 b(for)35 b(unsigned)e(64-bit)j(in)m(tegers\).)55 b(The)34 b('S')g(TF)m(ORMn)h(v)-5 b(alue)35 b(tells)g(CFITSIO)e(to)0 3317 y(write)26 b(the)f(k)m(eyw)m(ords)h(appropriate)g(for)f(a)h (signed)f(8-bit)i(b)m(yte)f(column)f(with)g(TF)m(ORMn)h(=)f('1B')h(and) f(TZER)m(On)0 3430 y(=)30 b(-128.)42 b(The)29 b(calls)j(to)e(\014ts)p 959 3430 28 4 v 33 w(write)p 1194 3430 V 33 w(col)h(then)e(write)i(the) f(arra)m(ys)g(of)g(unsigned)f(in)m(teger)j(v)-5 b(alues)30 b(to)h(the)f(columns.)0 3605 y SDict begin H.S end 0 3605 a 0 3605 a SDict begin 13.6 H.A end 0 3605 a 0 3605 a SDict begin [/View [/XYZ H.V]/Dest (section.4.5) cvn /DEST pdfmark end 0 3605 a 179 x Ff(4.5)135 b(Dealing)47 b(with)e(Character)h (Strings)0 4039 y Fj(The)36 b(c)m(haracter)j(string)d(v)-5 b(alues)38 b(in)e(a)h(FITS)f(header)h(or)g(in)f(an)h(ASCI)s(I)e(column) i(in)f(a)i(FITS)e(table)h(extension)0 4152 y(are)i(generally)i(padded)d (out)h(with)g(non-signi\014can)m(t)h(space)f(c)m(haracters)i(\(ASCI)s (I)d(32\))i(to)g(\014ll)f(up)f(the)h(header)0 4264 y(record)33 b(or)h(the)f(column)h(width.)49 b(When)33 b(reading)h(a)g(FITS)e (string)i(v)-5 b(alue,)35 b(the)e(CFITSIO)f(routines)i(will)f(strip)0 4377 y(o\013)38 b(these)f(non-signi\014can)m(t)h(trailing)g(spaces)f (and)g(will)g(return)f(a)i(n)m(ull-terminated)g(string)f(v)-5 b(alue)37 b(con)m(taining)0 4490 y(only)d(the)g(signi\014can)m(t)g(c)m (haracters.)52 b(Leading)34 b(spaces)g(in)g(a)g(FITS)f(string)g(are)h (considered)g(signi\014can)m(t.)52 b(If)33 b(the)0 4603 y(string)i(con)m(tains)h(all)g(blanks,)g(then)e(CFITSIO)g(will)h (return)f(a)h(single)g(blank)g(c)m(haracter,)j(i.e,)f(the)e(\014rst)f (blank)0 4716 y(is)c(considered)f(to)i(b)s(e)e(signi\014can)m(t,)i (since)f(it)g(distinguishes)g(the)g(string)f(from)h(a)g(n)m(ull)f(or)h (unde\014ned)e(string,)i(but)0 4829 y(the)h(remaining)f(trailing)h (spaces)g(are)g(not)g(signi\014can)m(t.)0 4989 y(Similarly)-8 b(,)41 b(when)c(writing)h(string)g(v)-5 b(alues)38 b(to)h(a)g(FITS)e (\014le)h(the)g(CFITSIO)f(routines)h(exp)s(ect)g(to)h(get)g(a)g(n)m (ull-)0 5102 y(terminated)33 b(string)g(as)g(input;)g(CFITSIO)e(will)i (pad)f(the)h(string)g(with)f(blanks)g(if)h(necessary)g(when)f(writing)g (it)0 5215 y(to)f(the)g(FITS)e(\014le.)0 5375 y(When)j(calling)i (CFITSIO)d(routines)i(that)g(return)e(a)i(c)m(haracter)h(string)f(it)g (is)f(vital)i(that)f(the)g(size)g(of)g(the)g(c)m(har)0 5488 y(arra)m(y)38 b(b)s(e)g(large)h(enough)e(to)i(hold)e(the)h(en)m (tire)h(string)f(of)g(c)m(haracters,)k(otherwise)c(CFITSIO)e(will)i(o)m (v)m(erwrite)0 5601 y(whatev)m(er)d(memory)e(lo)s(cations)i(follo)m(w)g (the)f(c)m(har)h(arra)m(y)-8 b(,)35 b(p)s(ossibly)e(causing)h(the)g (program)g(to)g(execute)h(incor-)0 5714 y(rectly)-8 b(.)42 b(This)30 b(t)m(yp)s(e)g(of)h(error)f(can)h(b)s(e)f(di\016cult)g(to)h (debug,)f(so)h(programmers)f(should)f(alw)m(a)m(ys)j(ensure)e(that)h (the)p eop end %%Page: 23 31 TeXDict begin 23 30 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.23) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(4.6.)72 b(IMPLICIT)29 b(D)m(A)-8 b(T)g(A)32 b(TYPE)e(CONVERSION)1938 b Fj(23)0 555 y(c)m(har)27 b(arra)m(ys)g(are)g(allo)s(cated)i(enough)d (space)i(to)f(hold)g(the)f(longest)i(p)s(ossible)f(string,)g Fi(including)h Fj(the)f(terminat-)0 668 y(ing)k(NULL)g(c)m(haracter.)45 b(The)30 b(\014tsio.h)h(\014le)h(con)m(tains)g(the)f(follo)m(wing)i (de\014ned)d(constan)m(ts)i(whic)m(h)f(programmers)0 781 y(are)g(strongly)g(encouraged)g(to)g(use)f(whenev)m(er)g(they)h (are)f(allo)s(cating)j(space)e(for)f(c)m(har)h(arra)m(ys:)0 1025 y Fe(#define)46 b(FLEN_FILENAME)e(1025)j(/*)g(max)g(length)f(of)h (a)g(filename)f(*/)0 1138 y(#define)g(FLEN_KEYWORD)140 b(72)95 b(/*)47 b(max)g(length)f(of)h(a)g(keyword)94 b(*/)0 1251 y(#define)46 b(FLEN_CARD)284 b(81)95 b(/*)47 b(length)f(of)h(a)h(FITS)e(header)g(card)h(*/)0 1364 y(#define)f(FLEN_VALUE)236 b(71)95 b(/*)47 b(max)g(length)f(of)h(a)g (keyword)f(value)h(string)f(*/)0 1477 y(#define)g(FLEN_COMMENT)140 b(73)95 b(/*)47 b(max)g(length)f(of)h(a)g(keyword)f(comment)g(string)g (*/)0 1590 y(#define)g(FLEN_ERRMSG)188 b(81)95 b(/*)47 b(max)g(length)f(of)h(a)g(CFITSIO)f(error)h(message)e(*/)0 1703 y(#define)h(FLEN_STATUS)188 b(31)95 b(/*)47 b(max)g(length)f(of)h (a)g(CFITSIO)f(status)g(text)h(string)f(*/)0 1947 y Fj(F)-8 b(or)23 b(example,)h(when)d(declaring)i(a)f(c)m(har)g(arra)m(y)h(to)f (hold)g(the)g(v)-5 b(alue)22 b(string)g(of)g(FITS)f(k)m(eyw)m(ord,)k (use)c(the)h(follo)m(wing)0 2060 y(statemen)m(t:)191 2304 y Fe(char)47 b(value[FLEN_VALUE];)0 2548 y Fj(Note)41 b(that)f(FLEN)p 686 2548 28 4 v 33 w(KEYW)m(ORD)g(is)f(longer)h(than)f (needed)g(for)g(the)h(nominal)f(8-c)m(haracter)j(k)m(eyw)m(ord)e(name)0 2661 y(b)s(ecause)30 b(the)h(HIERAR)m(CH)f(con)m(v)m(en)m(tion)j(supp)s (orts)28 b(longer)j(k)m(eyw)m(ord)g(names.)0 2813 y SDict begin H.S end 0 2813 a 0 2813 a SDict begin 13.6 H.A end 0 2813 a 0 2813 a SDict begin [/View [/XYZ H.V]/Dest (section.4.6) cvn /DEST pdfmark end 0 2813 a 179 x Ff(4.6)135 b(Implicit)46 b(Data)g(T)l(yp)t(e)f(Con)l(v)l(ersion)0 3242 y Fj(The)29 b(CFITSIO)e(routines)i(that)h(read)f(and)f(write)i(n)m (umerical)f(data)h(can)g(p)s(erform)d(implicit)j(data)g(t)m(yp)s(e)f (con)m(v)m(er-)0 3355 y(sion.)39 b(This)25 b(means)h(that)g(the)g(data) g(t)m(yp)s(e)g(of)g(the)g(v)-5 b(ariable)26 b(or)g(arra)m(y)g(in)f(the) h(program)g(do)s(es)f(not)h(need)f(to)i(b)s(e)e(the)0 3468 y(same)g(as)f(the)h(data)g(t)m(yp)s(e)g(of)f(the)h(v)-5 b(alue)25 b(in)f(the)g(FITS)g(\014le.)39 b(Data)26 b(t)m(yp)s(e)f(con)m (v)m(ersion)g(is)g(supp)s(orted)d(for)i(n)m(umerical)0 3581 y(and)37 b(string)g(data)g(t)m(yp)s(es)h(\(if)f(the)g(string)g (con)m(tains)i(a)e(v)-5 b(alid)38 b(n)m(um)m(b)s(er)e(enclosed)h(in)g (quotes\))h(when)e(reading)i(a)0 3694 y(FITS)30 b(header)h(k)m(eyw)m (ord)g(v)-5 b(alue)31 b(and)f(for)h(n)m(umeric)g(v)-5 b(alues)31 b(when)f(reading)h(or)f(writing)h(v)-5 b(alues)31 b(in)g(the)g(primary)0 3807 y(arra)m(y)24 b(or)g(a)h(table)f(column.)39 b(CFITSIO)22 b(returns)h(status)h(=)f(NUM)p 2267 3807 28 4 v 34 w(O)m(VERFLO)m(W)i(if)e(the)h(con)m(v)m(erted)i(data)e(v)-5 b(alue)0 3920 y(exceeds)33 b(the)g(range)g(of)g(the)f(output)g(data)i (t)m(yp)s(e.)47 b(Implicit)33 b(data)g(t)m(yp)s(e)g(con)m(v)m(ersion)h (is)e(not)h(supp)s(orted)d(within)0 4032 y(binary)g(tables)h(for)f (string,)g(logical,)k(complex,)d(or)f(double)g(complex)h(data)g(t)m(yp) s(es.)0 4193 y(In)g(addition,)h(an)m(y)f(table)h(column)f(ma)m(y)h(b)s (e)f(read)g(as)h(if)f(it)h(con)m(tained)g(string)f(v)-5 b(alues.)44 b(In)31 b(the)g(case)i(of)e(n)m(umeric)0 4306 y(columns)f(the)h(returned)e(string)h(will)h(b)s(e)f(formatted)h (using)e(the)i(TDISPn)e(displa)m(y)i(format)f(if)h(it)g(exists.)0 4458 y SDict begin H.S end 0 4458 a 0 4458 a SDict begin 13.6 H.A end 0 4458 a 0 4458 a SDict begin [/View [/XYZ H.V]/Dest (section.4.7) cvn /DEST pdfmark end 0 4458 a 179 x Ff(4.7)135 b(Data)46 b(Scaling)0 4887 y Fj(When)38 b(reading)f(n)m(umerical)i(data)f(v)-5 b(alues)38 b(in)f(the)h(primary) f(arra)m(y)h(or)g(a)g(table)h(column,)h(the)d(v)-5 b(alues)38 b(will)h(b)s(e)0 5000 y(scaled)f(automatically)j(b)m(y)c(the)g(BSCALE)g (and)g(BZER)m(O)g(\(or)h(TSCALn)e(and)h(TZER)m(On\))f(header)h(v)-5 b(alues)38 b(if)0 5113 y(they)31 b(are)f(presen)m(t)h(in)f(the)g (header.)41 b(The)30 b(scaled)h(data)g(that)g(is)f(returned)g(to)h(the) f(reading)h(program)f(will)h(ha)m(v)m(e)382 5357 y Fe(output)46 b(value)g(=)i(\(FITS)e(value\))g(*)i(BSCALE)e(+)h(BZERO)0 5601 y Fj(\(a)30 b(corresp)s(onding)e(form)m(ula)h(using)g(TSCALn)e (and)i(TZER)m(On)e(is)i(used)g(when)f(reading)h(from)g(table)h (columns\).)0 5714 y(In)h(the)i(case)g(of)f(in)m(teger)h(output)f(v)-5 b(alues)32 b(the)h(\015oating)g(p)s(oin)m(t)f(scaled)g(v)-5 b(alue)33 b(is)f(truncated)g(to)h(an)f(in)m(teger)h(\(not)p eop end %%Page: 24 32 TeXDict begin 24 31 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.24) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(24)1763 b Fh(CHAPTER)29 b(4.)112 b(PR)m(OGRAMMING)32 b(GUIDELINES)0 555 y Fj(rounded)j(to)j(the)f(nearest)h(in)m(teger\).)62 b(The)36 b(\014ts)p 1673 555 28 4 v 32 w(set)p 1816 555 V 34 w(bscale)i(and)e(\014ts)p 2430 555 V 32 w(set)p 2573 555 V 34 w(tscale)i(routines)f(\(describ)s(ed)f(in)h(the)0 668 y(`Adv)-5 b(anced')29 b(c)m(hapter\))h(ma)m(y)g(b)s(e)e(used)h(to)g (o)m(v)m(erride)i(the)e(scaling)h(parameters)f(de\014ned)f(in)h(the)g (header)g(\(e.g.,)i(to)0 781 y(turn)e(o\013)i(the)g(scaling)g(so)g (that)g(the)f(program)g(can)h(read)f(the)h(ra)m(w)f(unscaled)h(v)-5 b(alues)30 b(from)g(the)h(FITS)e(\014le\).)0 941 y(When)44 b(writing)h(n)m(umerical)g(data)g(to)g(the)g(primary)f(arra)m(y)h(or)f (to)h(a)g(table)h(column)e(the)h(data)g(v)-5 b(alues)45 b(will)0 1054 y(generally)29 b(b)s(e)f(automatically)j(in)m(v)m(ersely) f(scaled)f(b)m(y)f(the)g(v)-5 b(alue)29 b(of)f(the)h(BSCALE)e(and)h (BZER)m(O)g(\(or)h(TSCALn)0 1167 y(and)35 b(TZER)m(On\))f(k)m(eyw)m (ord)i(v)-5 b(alues)35 b(if)h(they)f(they)g(exist)i(in)e(the)g(header.) 55 b(These)35 b(k)m(eyw)m(ords)h(m)m(ust)f(ha)m(v)m(e)i(b)s(een)0 1280 y(written)31 b(to)h(the)g(header)f(b)s(efore)g(an)m(y)g(data)h(is) g(written)f(for)g(them)g(to)h(ha)m(v)m(e)h(an)m(y)e(immediate)i (e\013ect.)45 b(One)30 b(ma)m(y)0 1393 y(also)h(use)g(the)f(\014ts)p 623 1393 V 33 w(set)p 767 1393 V 33 w(bscale)i(and)d(\014ts)p 1367 1393 V 33 w(set)p 1511 1393 V 33 w(tscale)j(routines)f(to)g (de\014ne)f(or)g(o)m(v)m(erride)i(the)f(scaling)g(k)m(eyw)m(ords)g(in)0 1506 y(the)e(header)g(\(e.g.,)i(to)e(turn)f(o\013)h(the)g(scaling)h(so) f(that)h(the)f(program)f(can)h(write)g(the)g(ra)m(w)g(unscaled)g(v)-5 b(alues)29 b(in)m(to)0 1619 y(the)d(FITS)g(\014le\).)40 b(If)25 b(scaling)i(is)g(p)s(erformed,)e(the)i(in)m(v)m(erse)g(scaled)g (output)e(v)-5 b(alue)27 b(that)g(is)f(written)g(in)m(to)h(the)g(FITS)0 1732 y(\014le)j(will)h(ha)m(v)m(e)430 1958 y Fe(FITS)46 b(value)h(=)g(\(\(input)f(value\))g(-)h(BZERO\))f(/)i(BSCALE)0 2185 y Fj(\(a)39 b(corresp)s(onding)d(form)m(ula)i(using)g(TSCALn)e (and)h(TZER)m(On)g(is)h(used)f(when)f(writing)i(to)h(table)g (columns\).)0 2298 y(Rounding)34 b(to)i(the)g(nearest)g(in)m(teger,)i (rather)d(than)g(truncation,)j(is)d(p)s(erformed)f(when)g(writing)h(in) m(teger)i(data)0 2411 y(t)m(yp)s(es)30 b(to)i(the)e(FITS)g(\014le.)0 2560 y SDict begin H.S end 0 2560 a 0 2560 a SDict begin 13.6 H.A end 0 2560 a 0 2560 a SDict begin [/View [/XYZ H.V]/Dest (section.4.8) cvn /DEST pdfmark end 0 2560 a 179 x Ff(4.8)135 b(Supp)t(ort)44 b(for)h(IEEE)h(Sp)t(ecial)f(V)-11 b(alues)0 2989 y Fj(The)26 b(ANSI/IEEE-754)h(\015oating-p)s(oin)m(t)h (n)m(um)m(b)s(er)d(standard)g(de\014nes)h(certain)h(sp)s(ecial)g(v)-5 b(alues)26 b(that)h(are)g(used)e(to)0 3102 y(represen)m(t)j(suc)m(h)g (quan)m(tities)h(as)f(Not-a-Num)m(b)s(er)h(\(NaN\),)h(denormalized,)f (under\015o)m(w,)e(o)m(v)m(er\015o)m(w,)j(and)d(in\014nit)m(y)-8 b(.)0 3215 y(\(See)31 b(the)g(App)s(endix)d(in)j(the)f(FITS)g(standard) f(or)i(the)g(FITS)e(User's)i(Guide)f(for)g(a)h(list)g(of)g(these)g(v)-5 b(alues\).)41 b(The)0 3328 y(CFITSIO)31 b(routines)i(that)g(read)f (\015oating)i(p)s(oin)m(t)f(data)g(in)f(FITS)g(\014les)h(recognize)h (these)f(IEEE)f(sp)s(ecial)i(v)-5 b(alues)0 3441 y(and)27 b(b)m(y)h(default)h(in)m(terpret)f(the)h(o)m(v)m(er\015o)m(w)g(and)f (in\014nit)m(y)f(v)-5 b(alues)29 b(as)f(b)s(eing)g(equiv)-5 b(alen)m(t)29 b(to)g(a)g(NaN,)g(and)e(con)m(v)m(ert)0 3554 y(the)37 b(under\015o)m(w)e(and)i(denormalized)g(v)-5 b(alues)37 b(in)m(to)h(zeros.)60 b(In)36 b(some)i(cases)f(programmers)g (ma)m(y)g(w)m(an)m(t)h(access)0 3667 y(to)d(the)g(ra)m(w)f(IEEE)g(v)-5 b(alues,)36 b(without)e(an)m(y)h(mo)s(di\014cation)g(b)m(y)f(CFITSIO.)f (This)h(can)h(b)s(e)e(done)i(b)m(y)f(calling)i(the)0 3780 y(\014ts)p 127 3780 28 4 v 32 w(read)p 331 3780 V 33 w(img)27 b(or)g(\014ts)p 767 3780 V 32 w(read)p 971 3780 V 33 w(col)g(routines)g(while)f(sp)s(ecifying)h(0.0)h(as)e (the)h(v)-5 b(alue)27 b(of)g(the)g(NULL)-10 b(V)g(AL)26 b(parameter.)0 3892 y(This)44 b(will)h(force)h(CFITSIO)d(to)i(simply)g (pass)f(the)h(IEEE)f(v)-5 b(alues)45 b(through)f(to)i(the)f (application)h(program)0 4005 y(without)38 b(an)m(y)h(mo)s (di\014cation.)65 b(This)37 b(is)h(not)h(fully)f(supp)s(orted)e(on)i(V) -10 b(AX/VMS)40 b(mac)m(hines,)h(ho)m(w)m(ev)m(er,)g(where)0 4118 y(there)34 b(is)f(no)g(easy)h(w)m(a)m(y)h(to)f(b)m(ypass)f(the)g (default)h(in)m(terpretation)h(of)e(the)h(IEEE)f(sp)s(ecial)h(v)-5 b(alues.)50 b(This)33 b(is)g(also)0 4231 y(not)e(supp)s(orted)e(when)h (reading)g(\015oating-p)s(oin)m(t)i(images)g(that)g(ha)m(v)m(e)g(b)s (een)e(compressed)g(with)g(the)h(FITS)f(tiled)0 4344 y(image)i(compression)f(con)m(v)m(en)m(tion)j(that)d(is)g(discussed)g (in)f(section)j(5.6;)f(the)g(pixels)f(v)-5 b(alues)31 b(in)g(tile)h(compressed)0 4457 y(images)42 b(are)f(represen)m(ted)f(b) m(y)h(scaled)h(in)m(tegers,)i(and)c(a)h(reserv)m(ed)g(in)m(teger)h(v)-5 b(alue)41 b(\(not)h(a)f(NaN\))h(is)e(used)g(to)0 4570 y(represen)m(t)30 b(unde\014ned)f(pixels.)0 4719 y SDict begin H.S end 0 4719 a 0 4719 a SDict begin 13.6 H.A end 0 4719 a 0 4719 a SDict begin [/View [/XYZ H.V]/Dest (section.4.9) cvn /DEST pdfmark end 0 4719 a 179 x Ff(4.9)135 b(Error)46 b(Status)f(V)-11 b(alues)45 b(and)g(the)g(Error)g(Message)h (Stac)l(k)0 5149 y Fj(Nearly)36 b(all)g(the)g(CFITSIO)e(routines)h (return)f(an)h(error)g(status)h(v)-5 b(alue)35 b(in)g(2)h(w)m(a)m(ys:) 51 b(as)36 b(the)f(v)-5 b(alue)36 b(of)g(the)f(last)0 5261 y(parameter)29 b(in)f(the)g(function)g(call,)j(and)d(as)g(the)h (returned)e(v)-5 b(alue)29 b(of)f(the)h(function)f(itself.)41 b(This)27 b(pro)m(vides)i(some)0 5374 y(\015exibilit)m(y)37 b(in)e(the)h(w)m(a)m(y)h(programmers)e(can)h(test)h(if)f(an)f(error)h (o)s(ccurred,)g(as)g(illustrated)h(in)e(the)h(follo)m(wing)i(2)0 5487 y(co)s(de)31 b(fragmen)m(ts:)191 5714 y Fe(if)47 b(\()h(fits_write_record\(fptr,)41 b(card,)46 b(&status\))g(\))p eop end %%Page: 25 33 TeXDict begin 25 32 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.25) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(4.10.)73 b(V)-10 b(ARIABLE-LENGTH)31 b(ARRA)-8 b(YS)30 b(IN)g(BINAR)-8 b(Y)32 b(T)-8 b(ABLES)1327 b Fj(25)430 555 y Fe(printf\(")45 b(Error)h(occurred)g(while)g(writing)g(keyword."\);)0 781 y(or,)191 1007 y(fits_write_record\(fptr,)41 b(card,)47 b(&status\);)191 1120 y(if)g(\()h(status)e(\))430 1233 y(printf\(")f(Error)h(occurred)g(while)g(writing)g(keyword."\);)0 1489 y Fj(A)27 b(listing)h(of)g(all)g(the)f(CFITSIO)f(status)i(co)s(de) f(v)-5 b(alues)28 b(is)f(giv)m(en)h(at)g(the)g(end)e(of)i(this)f(do)s (cumen)m(t.)39 b(Programmers)0 1602 y(are)33 b(encouraged)g(to)g(use)f (the)h(sym)m(b)s(olic)f(mnemonics)g(\(de\014ned)g(in)g(\014tsio.h\))h (rather)f(than)g(the)h(actual)h(in)m(teger)0 1714 y(status)d(v)-5 b(alues)30 b(to)i(impro)m(v)m(e)f(the)f(readabilit)m(y)i(of)f(their)f (co)s(de.)0 1875 y(The)i(CFITSIO)f(library)g(uses)h(an)g(`inherited)h (status')g(con)m(v)m(en)m(tion)h(for)e(the)h(status)f(parameter)h(whic) m(h)f(means)0 1988 y(that)37 b(if)f(a)h(routine)f(is)h(called)g(with)f (a)h(p)s(ositiv)m(e)g(input)f(v)-5 b(alue)36 b(of)h(the)g(status)f (parameter)h(as)g(input,)g(then)f(the)0 2100 y(routine)j(will)f(exit)i (immediately)g(without)e(c)m(hanging)i(the)e(v)-5 b(alue)39 b(of)g(the)g(status)g(parameter.)65 b(Th)m(us,)40 b(if)f(one)0 2213 y(passes)24 b(the)h(status)g(v)-5 b(alue)25 b(returned)f(from)g (eac)m(h)i(CFITSIO)d(routine)h(as)h(input)f(to)h(the)g(next)g(CFITSIO)e (routine,)0 2326 y(then)28 b(whenev)m(er)g(an)g(error)g(is)h(detected)g (all)h(further)d(CFITSIO)f(pro)s(cessing)i(will)h(cease.)42 b(This)27 b(con)m(v)m(en)m(tion)k(can)0 2439 y(simplify)h(the)h(error)f (c)m(hec)m(king)j(in)d(application)i(programs)e(b)s(ecause)h(it)g(is)g (not)g(necessary)g(to)g(c)m(hec)m(k)i(the)d(v)-5 b(alue)0 2552 y(of)30 b(the)g(status)h(parameter)f(after)h(ev)m(ery)g(single)f (CFITSIO)f(routine)h(call.)42 b(If)30 b(a)g(program)g(con)m(tains)h(a)g (sequence)0 2665 y(of)d(sev)m(eral)i(CFITSIO)d(calls,)j(one)e(can)h (just)e(c)m(hec)m(k)j(the)f(status)f(v)-5 b(alue)29 b(after)g(the)f (last)h(call.)41 b(Since)29 b(the)f(returned)0 2778 y(status)33 b(v)-5 b(alues)33 b(are)g(generally)h(distinctiv)m(e,)h(it)f(should)d (b)s(e)i(p)s(ossible)f(to)h(determine)g(whic)m(h)g(routine)g (originally)0 2891 y(returned)c(the)i(error)f(status.)0 3051 y(CFITSIO)c(also)i(main)m(tains)h(an)e(in)m(ternal)h(stac)m(k)h (of)f(error)f(messages)h(\(80-c)m(haracter)j(maxim)m(um)c(length\))h (whic)m(h)0 3164 y(in)36 b(man)m(y)g(cases)h(pro)m(vide)f(a)g(more)g (detailed)i(explanation)f(of)f(the)g(cause)h(of)f(the)g(error)g(than)f (is)h(pro)m(vided)g(b)m(y)0 3277 y(the)k(error)e(status)i(n)m(um)m(b)s (er)e(alone.)69 b(It)39 b(is)h(recommended)f(that)g(the)h(error)f (message)h(stac)m(k)h(b)s(e)e(prin)m(ted)g(out)0 3390 y(whenev)m(er)g(a)g(program)g(detects)h(a)f(CFITSIO)e(error.)66 b(The)38 b(function)h(\014ts)p 2653 3390 28 4 v 32 w(rep)s(ort)p 2931 3390 V 32 w(error)g(will)g(prin)m(t)g(out)g(the)0 3503 y(en)m(tire)31 b(error)e(message)h(stac)m(k,)i(or)d(alternativ)m (ely)k(one)d(ma)m(y)g(call)h(\014ts)p 2376 3503 V 32 w(read)p 2580 3503 V 33 w(errmsg)e(to)h(get)h(the)f(error)f(messages)0 3616 y(one)i(at)g(a)g(time.)0 3752 y SDict begin H.S end 0 3752 a 0 3752 a SDict begin 13.6 H.A end 0 3752 a 0 3752 a SDict begin [/View [/XYZ H.V]/Dest (section.4.10) cvn /DEST pdfmark end 0 3752 a 197 x Ff(4.10)136 b(V)-11 b(ariable-Length)45 b(Arra)l(ys)g(in)g(Binary)g(T)-11 b(ables)0 4199 y Fj(CFITSIO)33 b(pro)m(vides)i(easy-to-use)h(supp)s (ort)d(for)i(reading)g(and)f(writing)h(data)g(in)g(v)-5 b(ariable)35 b(length)g(\014elds)g(of)g(a)0 4312 y(binary)27 b(table.)40 b(The)27 b(v)-5 b(ariable)29 b(length)f(columns)f(ha)m(v)m (e)i(TF)m(ORMn)e(k)m(eyw)m(ord)h(v)-5 b(alues)28 b(of)g(the)f(form)g (`1Pt\(len\)')j(or)0 4425 y(`1Qt\(len\)')36 b(where)d(`t')h(is)g(the)g (data)g(t)m(yp)s(e)g(co)s(de)g(\(e.g.,)j(I,)c(J,)h(E,)g(D,)g(etc.\))52 b(and)33 b(`len')i(is)e(an)h(in)m(teger)h(sp)s(ecifying)0 4538 y(the)g(maxim)m(um)g(length)h(of)f(the)h(v)m(ector)h(in)d(the)i (table.)56 b(The)35 b('P')g(t)m(yp)s(e)g(v)-5 b(ariable)36 b(length)g(columns)f(use)g(32-bit)0 4650 y(arra)m(y)j(length)h(and)e(b) m(yte)h(o\013set)h(v)-5 b(alues,)41 b(whereas)c(the)h('Q')g(t)m(yp)s(e) g(columns)g(use)f(64-bit)i(v)-5 b(alues,)41 b(whic)m(h)c(ma)m(y)0 4763 y(b)s(e)31 b(required)h(when)f(dealing)i(with)f(large)h(arra)m (ys.)46 b(CFITSIO)31 b(supp)s(orts)f(a)i(lo)s(cal)i(con)m(v)m(en)m (tion)g(that)f(in)m(terprets)0 4876 y(the)41 b('P')g(t)m(yp)s(e)g (descriptors)g(as)g(unsigned)e(32-bit)j(in)m(tegers,)j(whic)m(h)c(pro)m (vides)g(a)g(factor)g(of)g(2)h(greater)g(range)0 4989 y(for)32 b(the)g(arra)m(y)h(length)g(or)f(heap)g(address)f(than)h(is)g (p)s(ossible)g(with)g(32-bit)h('signed')g(in)m(tegers.)47 b(Note,)34 b(ho)m(w)m(ev)m(er,)0 5102 y(that)i(other)g(soft)m(w)m(are)g (pac)m(k)-5 b(ages)38 b(ma)m(y)d(not)h(supp)s(ort)e(this)h(con)m(v)m (en)m(tion,)k(and)c(ma)m(y)h(b)s(e)e(unable)h(to)h(read)f(thees)0 5215 y(extended)30 b(range)h(v)-5 b(ariable)31 b(length)g(records.)0 5375 y(If)d(the)h(v)-5 b(alue)30 b(of)f(`len')g(is)g(not)g(sp)s (eci\014ed)f(when)g(the)h(table)h(is)e(created)i(\(e.g.,)h(if)e(the)g (TF)m(ORM)g(k)m(eyw)m(ord)h(v)-5 b(alue)29 b(is)0 5488 y(simply)j(sp)s(eci\014ed)f(as)h('1PE')h(instead)g(of)f('1PE\(400\))i (\),)g(then)d(CFITSIO)g(will)h(automatically)j(scan)e(the)f(table)0 5601 y(when)27 b(it)j(is)e(closed)h(to)h(determine)e(the)h(maxim)m(um)f (length)h(of)g(the)f(v)m(ector)j(and)c(will)i(app)s(end)e(this)i(v)-5 b(alue)29 b(to)g(the)0 5714 y(TF)m(ORMn)h(v)-5 b(alue.)p eop end %%Page: 26 34 TeXDict begin 26 33 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.26) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(26)1763 b Fh(CHAPTER)29 b(4.)112 b(PR)m(OGRAMMING)32 b(GUIDELINES)0 555 y Fj(The)d(same)h(routines)g(that)g(read)f(and)g(write)h(data)g(in) g(an)f(ordinary)g(\014xed)g(length)h(binary)f(table)h(extension)h(are)0 668 y(also)41 b(used)d(for)i(v)-5 b(ariable)40 b(length)g(\014elds,)h (ho)m(w)m(ev)m(er,)j(the)c(routine)f(parameters)h(tak)m(e)h(on)f(a)g (sligh)m(tly)g(di\013eren)m(t)0 781 y(in)m(terpretation)32 b(as)e(describ)s(ed)g(b)s(elo)m(w.)0 941 y(All)37 b(the)f(data)h(in)f (a)h(v)-5 b(ariable)37 b(length)f(\014eld)g(is)g(written)h(in)m(to)g (an)f(area)h(called)h(the)e(`heap')g(whic)m(h)g(follo)m(ws)i(the)0 1054 y(main)31 b(\014xed-length)h(FITS)e(binary)h(table.)44 b(The)31 b(size)h(of)f(the)h(heap,)f(in)g(b)m(ytes,)h(is)g(sp)s (eci\014ed)e(b)m(y)h(the)h(PCOUNT)0 1167 y(k)m(eyw)m(ord)21 b(in)f(the)h(FITS)f(header.)37 b(When)20 b(creating)i(a)f(new)f(binary) g(table,)j(the)e(initial)h(v)-5 b(alue)21 b(of)f(PCOUNT)g(should)0 1280 y(usually)27 b(b)s(e)h(set)g(to)g(zero.)41 b(CFITSIO)26 b(will)i(recompute)g(the)g(size)g(of)g(the)g(heap)g(as)g(the)g(data)g (is)g(written)f(and)h(will)0 1393 y(automatically)g(up)s(date)c(the)i (PCOUNT)e(k)m(eyw)m(ord)h(v)-5 b(alue)26 b(when)e(the)h(table)h(is)f (closed.)40 b(When)25 b(writing)g(v)-5 b(ariable)0 1506 y(length)34 b(data)g(to)g(a)g(table,)i(CFITSIO)c(will)h(automatically)k (extend)c(the)h(size)g(of)g(the)g(heap)f(area)h(if)g(necessary)-8 b(,)0 1619 y(so)31 b(that)g(an)m(y)f(follo)m(wing)i(HDUs)f(do)f(not)h (get)h(o)m(v)m(erwritten.)0 1779 y(By)e(default)f(the)h(heap)f(data)i (area)f(starts)g(immediately)h(after)f(the)f(last)i(ro)m(w)e(of)h(the)g (\014xed-length)f(table.)42 b(This)0 1892 y(default)27 b(starting)g(lo)s(cation)i(ma)m(y)e(b)s(e)f(o)m(v)m(erridden)h(b)m(y)g (the)g(THEAP)f(k)m(eyw)m(ord,)i(but)f(this)f(is)h(not)g(recommended.)0 2005 y(If)34 b(additional)h(ro)m(ws)f(of)g(data)h(are)g(added)e(to)i (the)f(table,)j(CFITSIO)32 b(will)j(automatically)i(shift)c(the)i(the)f (heap)0 2118 y(do)m(wn)g(to)i(mak)m(e)f(ro)s(om)g(for)f(the)h(new)f(ro) m(ws,)i(but)e(it)i(is)e(ob)m(viously)i(b)s(e)e(more)h(e\016cien)m(t)h (to)f(initially)h(create)h(the)0 2230 y(table)31 b(with)e(the)h (necessary)g(n)m(um)m(b)s(er)f(of)h(blank)f(ro)m(ws,)h(so)g(that)g(the) g(heap)g(do)s(es)f(not)h(needed)g(to)g(b)s(e)f(constan)m(tly)0 2343 y(mo)m(v)m(ed.)0 2503 y(When)36 b(writing)g(ro)m(w)g(of)h(data)f (to)h(a)g(v)-5 b(ariable)37 b(length)f(\014eld)g(the)g(en)m(tire)i (arra)m(y)e(of)g(v)-5 b(alues)37 b(for)f(a)g(giv)m(en)i(ro)m(w)e(of)0 2616 y(the)30 b(table)h(m)m(ust)e(b)s(e)h(written)g(with)f(a)h(single)h (call)g(to)f(\014ts)p 1986 2616 28 4 v 33 w(write)p 2221 2616 V 33 w(col.)42 b(The)29 b(total)i(length)g(of)f(the)g(arra)m(y)g (is)g(giv)m(en)0 2729 y(b)m(y)j(nelemen)m(ts)h(+)f(\014rstelem)g(-)g (1.)49 b(Additional)34 b(elemen)m(ts)h(cannot)e(b)s(e)g(app)s(ended)e (to)j(an)f(existing)h(v)m(ector)h(at)f(a)0 2842 y(later)c(time)g(since) g(an)m(y)g(attempt)g(to)g(do)g(so)f(will)h(simply)f(o)m(v)m(erwrite)i (all)f(the)f(previously)h(written)f(data)h(and)f(the)0 2955 y(new)36 b(data)h(will)g(b)s(e)f(written)g(to)h(a)g(new)f(area)h (of)g(the)g(heap.)58 b(The)36 b(\014ts)p 2496 2955 V 33 w(compress)p 2889 2955 V 32 w(heap)g(routine)h(is)f(pro)m(vided)0 3068 y(to)h(compress)g(the)g(heap)g(and)f(reco)m(v)m(er)i(an)m(y)f(un)m (used)f(space.)60 b(T)-8 b(o)37 b(a)m(v)m(oid)i(ha)m(ving)e(to)h(deal)f (with)f(this)h(issue,)h(it)0 3181 y(is)31 b(recommended)h(that)g(ro)m (ws)f(in)g(a)h(v)-5 b(ariable)32 b(length)g(\014eld)f(should)f(only)i (b)s(e)f(written)g(once.)45 b(An)31 b(exception)h(to)0 3294 y(this)e(general)h(rule)f(o)s(ccurs)g(when)f(setting)i(elemen)m (ts)h(of)e(an)g(arra)m(y)g(as)h(unde\014ned.)38 b(It)30 b(is)h(allo)m(w)m(ed)h(to)e(\014rst)g(write)0 3407 y(a)e(dumm)m(y)f(v) -5 b(alue)28 b(in)m(to)h(the)f(arra)m(y)h(with)e(\014ts)p 1534 3407 V 33 w(write)p 1769 3407 V 33 w(col,)j(and)d(then)g(call)j (\014ts)p 2632 3407 V 32 w(write)p 2866 3407 V 33 w(col)p 3009 3407 V 34 w(n)m(ul)d(to)i(\015ag)f(the)g(desired)0 3520 y(elemen)m(ts)h(as)f(unde\014ned.)38 b(Note)29 b(that)g(the)f(ro)m (ws)g(of)g(a)g(table,)i(whether)d(\014xed)g(or)h(v)-5 b(ariable)29 b(length,)g(do)f(not)g(ha)m(v)m(e)0 3633 y(to)j(b)s(e)f(written)g(consecutiv)m(ely)j(and)d(ma)m(y)h(b)s(e)e (written)i(in)f(an)m(y)h(order.)0 3793 y(When)40 b(writing)h(to)g(a)g (v)-5 b(ariable)41 b(length)g(ASCI)s(I)e(c)m(haracter)j(\014eld)e (\(e.g.,)45 b(TF)m(ORM)c(=)f('1P)-8 b(A'\))43 b(only)d(a)h(single)0 3906 y(c)m(haracter)22 b(string)e(can)h(b)s(e)e(written.)38 b(The)20 b(`\014rstelem')g(and)g(`nelemen)m(ts')i(parameter)e(v)-5 b(alues)21 b(in)f(the)g(\014ts)p 3526 3906 V 33 w(write)p 3761 3906 V 33 w(col)0 4019 y(routine)35 b(are)h(ignored)f(and)f(the)i (n)m(um)m(b)s(er)d(of)j(c)m(haracters)g(to)g(write)f(is)h(simply)e (determined)h(b)m(y)g(the)g(length)h(of)0 4131 y(the)31 b(input)e(n)m(ull-terminated)i(c)m(haracter)h(string.)0 4292 y(The)21 b(\014ts)p 305 4292 V 33 w(write)p 540 4292 V 33 w(descript)g(routine)h(is)f(useful)g(in)g(situations)i(where) e(m)m(ultiple)h(ro)m(ws)g(of)g(a)g(v)-5 b(ariable)22 b(length)g(column)0 4405 y(ha)m(v)m(e)32 b(the)e(iden)m(tical)i(arra)m (y)f(of)g(v)-5 b(alues.)41 b(One)30 b(can)g(simply)g(write)h(the)f (arra)m(y)h(once)g(for)g(the)f(\014rst)g(ro)m(w,)g(and)g(then)0 4517 y(use)c(\014ts)p 280 4517 V 32 w(write)p 514 4517 V 33 w(descript)g(to)g(write)g(the)g(same)h(descriptor)e(v)-5 b(alues)27 b(in)m(to)g(the)f(other)g(ro)m(ws;)h(all)g(the)f(ro)m(ws)g (will)g(then)0 4630 y(p)s(oin)m(t)k(to)h(the)g(same)g(storage)h(lo)s (cation)g(th)m(us)e(sa)m(ving)h(disk)f(space.)0 4791 y(When)35 b(reading)g(from)f(a)i(v)-5 b(ariable)35 b(length)h(arra)m(y) f(\014eld)g(one)g(can)g(only)h(read)e(as)i(man)m(y)f(elemen)m(ts)h(as)f (actually)0 4903 y(exist)i(in)e(that)i(ro)m(w)e(of)h(the)g(table;)k (reading)c(do)s(es)g(not)g(automatically)i(con)m(tin)m(ue)f(with)f(the) g(next)g(ro)m(w)g(of)g(the)0 5016 y(table)29 b(as)f(o)s(ccurs)g(when)f (reading)h(an)g(ordinary)g(\014xed)f(length)h(table)h(\014eld.)40 b(A)m(ttempts)29 b(to)g(read)f(more)g(than)g(this)0 5129 y(will)k(cause)h(an)e(error)h(status)g(to)g(b)s(e)f(returned.)44 b(One)32 b(can)g(determine)g(the)g(n)m(um)m(b)s(er)e(of)i(elemen)m(ts)h (in)f(eac)m(h)h(ro)m(w)0 5242 y(of)e(a)f(v)-5 b(ariable)31 b(column)g(with)f(the)g(\014ts)p 1329 5242 V 33 w(read)p 1534 5242 V 32 w(descript)h(routine.)p eop end %%Page: 27 35 TeXDict begin 27 34 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.27) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(4.11.)73 b(MUL)-8 b(TIPLE)30 b(A)m(CCESS)f(TO)g(THE)i(SAME)f(FITS)f(FILE)1515 b Fj(27)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (section.4.11) cvn /DEST pdfmark end 0 464 a 91 x Ff(4.11)136 b(Multiple)45 b(Access)g(to)g(the)g(Same)h(FITS)d (File)0 807 y Fj(CFITSIO)29 b(supp)s(orts)g(sim)m(ultaneous)i(read)f (and)g(write)h(access)h(to)f(di\013eren)m(t)g(HDUs)g(in)f(the)h(same)g (FITS)f(\014le)g(in)0 920 y(some)h(circumstances,)g(as)g(describ)s(ed)e (b)s(elo)m(w:)136 1185 y Fc(\017)46 b Fj(Multi-threaded)31 b(programs)227 1339 y(When)f(CFITSIO)f(is)h(compiled)h(with)e(the)i(-D) p 1842 1339 28 4 v 33 w(REENTRANT)f(directiv)m(e)h(\(as)g(can)f(b)s(e)g (tested)h(with)f(the)227 1452 y(\014ts)p 354 1452 V 33 w(is)p 448 1452 V 33 w(reen)m(tran)m(t)38 b(function\))f(di\013eren)m (t)h(threads)f(can)g(call)i(an)m(y)e(of)h(the)f(CFITSIO)f(routines)h (to)h(sim)m(ul-)227 1565 y(taneously)g(read)g(or)f(write)h(separate)h (FITS)d(\014les.)62 b(Multiple)39 b(threads)e(can)h(also)g(read)f(data) i(from)e(the)227 1677 y(same)32 b(FITS)f(\014le)g(sim)m(ultaneously)-8 b(,)33 b(as)f(long)g(as)f(the)h(\014le)f(w)m(as)h(op)s(ened)f(indep)s (enden)m(tly)f(b)m(y)h(eac)m(h)i(thread.)227 1790 y(This)g(relies)h(on) g(the)f(op)s(erating)h(system)g(to)g(correctly)h(deal)g(with)e(reading) g(the)h(same)g(\014le)g(b)m(y)f(m)m(ultiple)227 1903 y(pro)s(cesses.)64 b(Di\013eren)m(t)40 b(threads)e(should)f(not)i (share)f(the)g(same)h('\014ts\014le')f(p)s(oin)m(ter)g(to)h(read)g(an)f (op)s(ened)227 2016 y(FITS)25 b(\014le,)i(unless)e(lo)s(c)m(ks)h(are)g (placed)g(around)e(the)i(calls)g(to)g(the)g(CFITSIO)e(reading)i (routines.)39 b(Di\013eren)m(t)227 2129 y(threads)30 b(should)g(nev)m(er)g(try)h(to)g(write)f(to)h(the)g(same)g(FITS)e (\014le.)136 2323 y Fc(\017)46 b Fj(Multiple)31 b(read)g(access)g(to)h (the)e(same)h(FITS)e(\014le)i(within)f(a)h(single)g(program/thread)227 2476 y(A)46 b(single)g(pro)s(cess)f(ma)m(y)h(op)s(en)f(the)g(same)h (FITS)f(\014le)g(with)g(READONL)-8 b(Y)46 b(access)h(m)m(ultiple)f (times,)227 2589 y(and)32 b(th)m(us)f(create)j(m)m(ultiple)f ('\014ts\014le*')g(p)s(oin)m(ters)f(to)g(that)h(same)g(\014le)f(within) f(CFITSIO.)g(This)g(relies)i(on)227 2702 y(the)h(op)s(erating)g (system's)g(abilit)m(y)h(to)g(op)s(en)e(a)h(single)g(\014le)g(m)m (ultiple)g(times)g(and)f(correctly)i(manage)g(the)227 2815 y(subsequen)m(t)24 b(read)g(requests)g(directed)g(to)h(the)f (di\013eren)m(t)h(C)f('\014le*')h(p)s(oin)m(ters,)g(whic)m(h)f (actually)i(all)f(p)s(oin)m(t)f(to)227 2928 y(the)32 b(same)h(\014le.)45 b(CFITSIO)30 b(simply)i(executes)h(the)f(read)g (requests)g(to)g(the)g(di\013ernet)g('\014ts\014le*')h(p)s(oin)m(ters) 227 3041 y(the)e(same)g(as)f(if)h(they)f(w)m(ere)h(ph)m(ysically)g (di\013eren)m(t)g(\014les.)136 3234 y Fc(\017)46 b Fj(Multiple)31 b(write)g(access)h(to)f(the)f(same)h(FITS)f(\014le)g(within)g(a)h (single)g(program/thread)227 3388 y(CFITSIO)22 b(supp)s(orts)g(op)s (ening)h(the)g(same)h(FITS)f(\014le)g(m)m(ultiple)i(times)f(with)f (WRITE)g(access,)j(but)d(it)h(only)227 3500 y(ph)m(ysically)j(op)s(ens) f(the)g(\014le)h(\(at)g(the)g(op)s(erating)f(system)h(lev)m(el\))h (once,)g(on)e(the)h(\014rst)e(call)j(to)f(\014ts)p 3509 3500 V 32 w(op)s(en)p 3731 3500 V 33 w(\014le.)227 3613 y(If)38 b(\014ts)p 453 3613 V 32 w(op)s(en)p 675 3613 V 32 w(\014le)g(is)g(subsequen)m(tly)f(called)i(to)g(op)s(en)e(the)h (same)g(\014le)g(again,)j(CFITSIO)36 b(will)i(recognize)227 3726 y(that)c(the)f(\014le)g(is)g(already)g(op)s(en,)h(and)e(will)h (return)f(a)h(new)g('\014ts\014le*')g(p)s(oin)m(ter)g(that)h(logically) h(p)s(oin)m(ts)e(to)227 3839 y(the)i(\014rst)e('\014ts\014le*')i(p)s (oin)m(ter,)h(without)e(actually)i(op)s(ening)e(the)g(\014le)h(a)f (second)h(time.)53 b(The)34 b(application)227 3952 y(program)39 b(can)g(then)g(treat)h(the)f(2)g('\014ts\014le*')h(p)s(oin)m(ters)f(as) g(if)g(they)g(p)s(oin)m(t)g(to)h(di\013eren)m(t)f(\014les,)i(and)e(can) 227 4065 y(seemingly)c(mo)m(v)m(e)g(to)g(and)e(write)h(data)h(to)g(2)f (di\013eren)m(t)g(HDUs)h(within)e(the)h(same)g(\014le.)52 b(Ho)m(w)m(ev)m(er,)37 b(eac)m(h)227 4178 y(time)31 b(the)g (application)g(program)g(switc)m(hes)g(whic)m(h)f('\014ts\014le*')h(p)s (oin)m(ter)f(it)h(is)f(writing)h(to,)g(CFITSIO)e(will)227 4291 y(\015ush)24 b(an)m(y)i(in)m(ternal)g(bu\013ers)e(that)i(con)m (tain)h(data)f(written)g(to)g(the)g(\014rst)e('\014ts\014le*')i(p)s (oin)m(ter,)h(then)e(mo)m(v)m(e)i(to)227 4404 y(the)j(HDU)g(that)g(the) g(other)f('\014ts\014le*')h(p)s(oin)m(ter)g(is)f(writing)h(to.)41 b(Ob)m(viously)-8 b(,)30 b(this)f(ma)m(y)h(add)f(a)h(signi\014can)m(t) 227 4517 y(amoun)m(t)h(of)f(computational)i(o)m(v)m(erhead)f(if)f(the)g (application)h(program)f(uses)g(this)g(feature)g(to)h(frequen)m(tly)227 4630 y(switc)m(h)25 b(bac)m(k)h(and)e(forth)g(b)s(et)m(w)m(een)i (writing)f(to)g(2)g(\(or)g(more\))g(HDUs)h(in)e(the)h(same)g(\014le,)h (so)f(this)g(capabilit)m(y)227 4742 y(should)30 b(b)s(e)f(used)h (judiciously)-8 b(.)227 4896 y(Note)26 b(that)f(CFITSIO)e(will)i(not)g (allo)m(w)h(a)e(FITS)g(\014le)h(to)g(b)s(e)f(op)s(ened)g(a)g(second)h (time)g(with)f(READ)m(WRITE)227 5009 y(access)32 b(if)e(it)h(w)m(as)g (op)s(ened)f(previously)g(with)g(READONL)-8 b(Y)31 b(access.)0 5170 y SDict begin H.S end 0 5170 a 0 5170 a SDict begin 13.6 H.A end 0 5170 a 0 5170 a SDict begin [/View [/XYZ H.V]/Dest (section.4.12) cvn /DEST pdfmark end 0 5170 a 179 x Ff(4.12)136 b(When)44 b(the)h(Final)h(Size)f(of)g(the)g(FITS)f(HDU)h (is)g(Unkno)l(wn)0 5601 y Fj(It)27 b(is)h(not)f(required)f(to)i(kno)m (w)f(the)h(total)h(size)f(of)f(a)h(FITS)e(data)i(arra)m(y)g(or)f(table) h(b)s(efore)f(b)s(eginning)f(to)i(write)g(the)0 5714 y(data)k(to)f(the)g(FITS)f(\014le.)43 b(In)30 b(the)h(case)h(of)f(the)g (primary)f(arra)m(y)h(or)g(an)f(image)j(extension,)e(one)h(should)d (initially)p eop end %%Page: 28 36 TeXDict begin 28 35 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.28) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(28)1763 b Fh(CHAPTER)29 b(4.)112 b(PR)m(OGRAMMING)32 b(GUIDELINES)0 555 y Fj(create)f(the)e(arra)m(y)h(with)e(the)i(size)g(of)f(the)g (highest)g(dimension)g(\(largest)i(NAXISn)d(k)m(eyw)m(ord\))i(set)g(to) g(a)f(dumm)m(y)0 668 y(v)-5 b(alue,)26 b(suc)m(h)e(as)g(1.)39 b(Then)23 b(after)i(all)g(the)g(data)f(ha)m(v)m(e)i(b)s(een)d(written)h (and)g(the)g(true)g(dimensions)g(are)g(kno)m(wn,)h(then)0 781 y(the)33 b(NAXISn)f(v)-5 b(alue)33 b(should)f(b)s(e)g(up)s(dated)g (using)g(the)h(\014ts)p 2069 781 28 4 v 33 w(up)s(date)p 2378 781 V 32 w(k)m(ey)g(routine)g(b)s(efore)g(mo)m(ving)g(to)h (another)0 894 y(extension)d(or)f(closing)i(the)e(FITS)g(\014le.)0 1054 y(When)f(writing)g(to)g(FITS)g(tables,)h(CFITSIO)d(automatically) 32 b(k)m(eeps)e(trac)m(k)g(of)f(the)g(highest)h(ro)m(w)f(n)m(um)m(b)s (er)e(that)0 1167 y(is)32 b(written)g(to,)h(and)e(will)h(increase)h (the)f(size)h(of)f(the)g(table)g(if)g(necessary)-8 b(.)46 b(CFITSIO)30 b(will)i(also)h(automatically)0 1280 y(insert)j(space)h (in)f(the)g(FITS)f(\014le)i(if)f(necessary)-8 b(,)39 b(to)e(ensure)e(that)i(the)f(data)h('heap',)h(if)e(it)h(exists,)h (and/or)f(an)m(y)0 1393 y(additional)29 b(HDUs)g(that)g(follo)m(w)g (the)g(table)g(do)f(not)h(get)g(o)m(v)m(erwritten)h(as)e(new)g(ro)m(ws) g(are)h(written)f(to)h(the)g(table.)0 1553 y(As)37 b(a)h(general)g (rule)f(it)h(is)f(b)s(est)g(to)h(sp)s(ecify)f(the)h(initial)g(n)m(um)m (b)s(er)e(of)i(ro)m(ws)f(=)g(0)g(when)g(the)g(table)h(is)g(created,)0 1666 y(then)g(let)h(CFITSIO)e(k)m(eep)i(trac)m(k)g(of)g(the)f(n)m(um)m (b)s(er)f(of)i(ro)m(ws)f(that)h(are)f(actually)i(written.)65 b(The)38 b(application)0 1779 y(program)e(should)f(not)i(man)m(ually)g (up)s(date)e(the)i(n)m(um)m(b)s(er)e(of)h(ro)m(ws)g(in)g(the)h(table)g (\(as)g(giv)m(en)g(b)m(y)f(the)h(NAXIS2)0 1892 y(k)m(eyw)m(ord\))j (since)f(CFITSIO)e(do)s(es)i(this)g(automatically)-8 b(.)69 b(If)38 b(a)i(table)f(is)g(initially)i(created)f(with)e(more)h (than)0 2005 y(zero)i(ro)m(ws,)j(then)c(this)h(will)f(usually)h(b)s(e)f (considered)g(as)h(the)g(minim)m(um)f(size)h(of)g(the)g(table,)j(ev)m (en)d(if)g(few)m(er)0 2118 y(ro)m(ws)30 b(are)g(actually)h(written)f (to)h(the)f(table.)41 b(Th)m(us,)30 b(if)f(a)i(table)f(is)g(initially)h (created)g(with)f(NAXIS2)g(=)g(20,)h(and)0 2230 y(CFITSIO)g(only)i (writes)f(10)i(ro)m(ws)e(of)h(data)g(b)s(efore)f(closing)i(the)f (table,)h(then)e(NAXIS2)h(will)g(remain)f(equal)h(to)0 2343 y(20.)50 b(If)33 b(ho)m(w)m(ev)m(er,)i(30)g(ro)m(ws)e(of)g(data)h (are)g(written)f(to)h(this)f(table,)i(then)e(NAXIS2)h(will)f(b)s(e)g (increased)g(from)g(20)0 2456 y(to)f(30.)44 b(The)31 b(one)g(exception)i(to)f(this)f(automatic)i(up)s(dating)d(of)h(the)h (NAXIS2)f(k)m(eyw)m(ord)h(is)f(if)g(the)h(application)0 2569 y(program)c(directly)g(mo)s(di\014es)f(the)i(v)-5 b(alue)28 b(of)g(NAXIS2)g(\(up)f(or)h(do)m(wn\))g(itself)h(just)e(b)s (efore)h(closing)h(the)f(table.)41 b(In)0 2682 y(this)28 b(case,)i(CFITSIO)d(do)s(es)h(not)h(up)s(date)e(NAXIS2)i(again,)h (since)f(it)g(assumes)f(that)h(the)f(application)i(program)0 2795 y(m)m(ust)i(ha)m(v)m(e)h(had)f(a)g(go)s(o)s(d)g(reason)h(for)f(c)m (hanging)h(the)f(v)-5 b(alue)33 b(directly)-8 b(.)47 b(This)31 b(is)h(not)h(recommended,)f(ho)m(w)m(ev)m(er,)0 2908 y(and)j(is)h(only)g(pro)m(vided)g(for)f(bac)m(kw)m(ard)h (compatibilit)m(y)i(with)e(soft)m(w)m(are)h(that)g(initially)g(creates) g(a)f(table)h(with)0 3021 y(a)d(large)h(n)m(um)m(b)s(er)e(of)h(ro)m (ws,)h(than)f(decreases)g(the)h(NAXIS2)f(v)-5 b(alue)34 b(to)h(the)f(actual)h(smaller)g(v)-5 b(alue)34 b(just)f(b)s(efore)0 3134 y(closing)e(the)g(table.)0 3368 y SDict begin H.S end 0 3368 a 0 3368 a SDict begin 13.6 H.A end 0 3368 a 0 3368 a SDict begin [/View [/XYZ H.V]/Dest (section.4.13) cvn /DEST pdfmark end 0 3368 a 179 x Ff(4.13)136 b(CFITSIO)44 b(Size)h(Limitations)0 3813 y Fj(CFITSIO)29 b(places)j(v)m(ery)f(few)g (restrictions)g(on)g(the)g(size)g(of)g(FITS)f(\014les)h(that)g(it)h (reads)e(or)h(writes.)42 b(There)30 b(are)i(a)0 3926 y(few)e(limits,)h(ho)m(w)m(ev)m(er,)h(that)f(ma)m(y)g(a\013ect)h(some)f (extreme)g(cases:)0 4086 y(1.)43 b(The)31 b(maxim)m(um)g(n)m(um)m(b)s (er)f(of)h(FITS)f(\014les)h(that)h(ma)m(y)g(b)s(e)e(sim)m(ultaneously)i (op)s(ened)f(b)m(y)g(CFITSIO)e(is)i(set)h(b)m(y)0 4199 y(NMAXFILES,)e(as)f(de\014ned)f(in)h(\014tsio2.h.)41 b(The)29 b(curren)m(t)g(default)g(v)-5 b(alue)30 b(is)f(1000,)j(but)c (this)h(ma)m(y)h(b)s(e)f(increased)0 4312 y(if)40 b(necessary)-8 b(.)72 b(Note)42 b(that)f(CFITSIO)e(allo)s(cates)j(NIOBUF)f(*)g(2880)h (b)m(ytes)f(of)g(I/O)f(bu\013er)g(space)h(for)f(eac)m(h)0 4425 y(\014le)d(that)h(is)f(op)s(ened.)61 b(The)37 b(default)g(v)-5 b(alue)38 b(of)f(NIOBUF)h(is)f(40)h(\(de\014ned)f(in)f(\014tsio.h\),)k (so)e(this)f(amoun)m(ts)g(to)0 4538 y(more)31 b(than)g(115K)i(of)e (memory)g(for)g(eac)m(h)i(op)s(ened)d(\014le)i(\(or)f(115)i(MB)f(for)f (1000)i(op)s(ened)d(\014les\).)44 b(Note)33 b(that)f(the)0 4650 y(underlying)k(op)s(erating)i(system,)h(ma)m(y)e(ha)m(v)m(e)i(a)e (lo)m(w)m(er)i(limit)f(on)f(the)g(n)m(um)m(b)s(er)f(of)h(\014les)g (that)h(can)f(b)s(e)g(op)s(ened)0 4763 y(sim)m(ultaneously)-8 b(.)0 4924 y(2.)67 b(It)40 b(used)e(to)i(b)s(e)e(common)i(for)f (computer)g(systems)g(to)h(only)f(supp)s(ort)f(disk)g(\014les)h(up)f (to)i(2**31)i(b)m(ytes)d(=)0 5036 y(2.1)k(GB)g(in)f(size,)47 b(but)41 b(most)i(systems)f(no)m(w)g(supp)s(ort)f(larger)i(\014les.)76 b(CFITSIO)41 b(can)i(optionally)g(read)g(and)0 5149 y(write)37 b(these)h(so-called)h('large)f(\014les')g(that)f(are)h(greater)g(than)f (2.1)h(GB)g(on)f(platforms)g(where)g(they)g(are)h(sup-)0 5262 y(p)s(orted,)43 b(but)d(this)g(usually)h(requires)f(that)i(sp)s (ecial)f(compiler)g(option)g(\015ags)g(b)s(e)f(sp)s(eci\014ed)g(to)i (turn)d(on)i(this)0 5375 y(option.)69 b(On)39 b(lin)m(ux)h(and)f (solaris)i(systems)f(the)g(compiler)g(\015ags)g(are)g('-D)p 2617 5375 28 4 v 34 w(LAR)m(GEFILE)p 3184 5375 V 33 w(SOUR)m(CE')f(and) g(`-)0 5488 y(D)p 74 5488 V 33 w(FILE)p 318 5488 V 33 w(OFFSET)p 719 5488 V 32 w(BITS=64'.)i(These)29 b(\015ags)h(ma)m(y)g (also)h(w)m(ork)f(on)g(other)g(platforms)f(but)g(this)h(has)g(not)g(b)s (een)0 5601 y(tested.)43 b(Starting)31 b(with)f(v)m(ersion)h(3.0)h(of)f (CFITSIO,)f(the)h(default)f(Mak)m(e\014le)j(that)e(is)g(distributed)f (with)g(CFIT-)0 5714 y(SIO)h(will)h(include)g(these)g(2)g(compiler)h (\015ags)f(when)e(building)h(on)h(Solaris)g(and)g(Lin)m(ux)f(PC)g (systems.)45 b(Users)32 b(on)p eop end %%Page: 29 37 TeXDict begin 29 36 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.29) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(4.13.)73 b(CFITSIO)28 b(SIZE)h(LIMIT)-8 b(A)g(TIONS)2300 b Fj(29)0 555 y(other)32 b(platforms)g(will)g(need)f(to)i(add)e(these)h(compiler) h(\015ags)f(man)m(ually)g(if)g(they)g(w)m(an)m(t)g(to)h(supp)s(ort)d (large)j(\014les.)0 668 y(In)j(most)i(cases)g(it)g(app)s(ears)e(that)i (it)g(is)f(not)h(necessary)f(to)h(include)f(these)h(compiler)g(\015ags) f(when)f(compiling)0 781 y(application)c(co)s(de)e(that)h(call)h(the)e (CFITSIO)f(library)h(routines.)0 941 y(When)i(CFITSIO)e(is)i(built)g (with)g(large)h(\014le)f(supp)s(ort)e(\(e.g.,)35 b(on)d(Solaris)g(and)f (Lin)m(ux)h(PC)f(system)h(b)m(y)g(default\))0 1054 y(then)e(it)h(can)g (read)f(and)g(write)g(FITS)g(data)h(\014les)f(on)h(disk)e(that)i(ha)m (v)m(e)h(an)m(y)f(of)f(these)h(conditions:)136 1314 y Fc(\017)46 b Fj(FITS)30 b(\014les)g(larger)h(than)f(2.1)i(GB)f(in)f (size)136 1501 y Fc(\017)46 b Fj(FITS)30 b(images)h(con)m(taining)h (greater)g(than)e(2.1)h(G)g(pixels)136 1689 y Fc(\017)46 b Fj(FITS)34 b(images)i(that)g(ha)m(v)m(e)g(one)f(dimension)f(with)g (more)h(than)g(2.1)h(G)f(pixels)g(\(as)g(giv)m(en)h(b)m(y)f(one)g(of)g (the)227 1802 y(NAXISn)30 b(k)m(eyw)m(ord\))136 1990 y Fc(\017)46 b Fj(FITS)26 b(tables)h(con)m(taining)g(more)g(than)f (2.1E09)i(ro)m(ws)e(\(giv)m(en)i(b)m(y)e(the)g(NAXIS2)h(k)m(eyw)m (ord\),)h(or)e(with)g(ro)m(ws)227 2103 y(that)31 b(are)g(more)g(than)f (2.1)h(GB)g(wide)f(\(giv)m(en)i(b)m(y)e(the)h(NAXIS1)f(k)m(eyw)m(ord\)) 136 2290 y Fc(\017)46 b Fj(FITS)36 b(binary)f(tables)i(with)f(a)h(v)-5 b(ariable-length)38 b(arra)m(y)f(heap)f(that)h(is)f(larger)h(than)f (2.1)h(GB)g(\(giv)m(en)h(b)m(y)227 2403 y(the)31 b(PCOUNT)e(k)m(eyw)m (ord\))0 2663 y(The)c(curren)m(t)g(maxim)m(um)g(FITS)f(\014le)h(size)h (supp)s(orted)e(b)m(y)h(CFITSIO)e(is)j(ab)s(out)f(6)g(terab)m(ytes)i (\(con)m(taining)g(2**31)0 2776 y(FITS)d(blo)s(c)m(ks,)i(eac)m(h)g (2880)h(b)m(ytes)e(in)f(size\).)40 b(Curren)m(tly)-8 b(,)26 b(supp)s(ort)d(for)i(large)g(\014les)g(in)g(CFITSIO)e(has)h(b)s (een)g(tested)0 2889 y(on)30 b(the)h(Lin)m(ux,)f(Solaris,)h(and)f(IBM)g (AIX)h(op)s(erating)g(systems.)0 3049 y(Note)26 b(that)f(when)e (writing)h(application)i(programs)e(that)h(are)f(in)m(tended)g(to)h (supp)s(ort)e(large)i(\014les)g(it)f(is)h(imp)s(ortan)m(t)0 3162 y(to)31 b(use)g(64-bit)g(in)m(teger)h(v)-5 b(ariables)31 b(to)h(store)f(quan)m(tities)h(suc)m(h)e(as)h(the)f(dimensions)g(of)h (images,)h(or)f(the)f(n)m(um)m(b)s(er)0 3275 y(of)38 b(ro)m(ws)f(in)h(a)g(table.)63 b(These)38 b(programs)f(m)m(ust)g(also)i (call)g(the)f(sp)s(ecial)g(v)m(ersions)g(of)g(some)g(of)g(the)f (CFITSIO)0 3388 y(routines)28 b(that)h(ha)m(v)m(e)h(b)s(een)d(adapted)i (to)g(supp)s(ort)e(64-bit)i(in)m(tegers.)42 b(The)27 b(names)i(of)f(these)h(routines)f(end)g(in)g('ll')0 3501 y(\('el')k('el'\))g(to)f(distinguish)e(them)i(from)f(the)g(32-bit)i(in) m(teger)g(v)m(ersion)e(\(e.g.,)j(\014ts)p 2766 3501 28 4 v 32 w(get)p 2918 3501 V 34 w(n)m(um)p 3127 3501 V 32 w(ro)m(wsll\).)p eop end %%Page: 30 38 TeXDict begin 30 37 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.30) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(30)1763 b Fh(CHAPTER)29 b(4.)112 b(PR)m(OGRAMMING)32 b(GUIDELINES)p eop end %%Page: 31 39 TeXDict begin 31 38 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.31) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.5) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(5)0 1687 y Fm(Basic)77 b(CFITSIO)f(In)-6 b(terface)77 b(Routines)0 2180 y Fj(This)30 b(c)m(hapter)i(describ)s(es)e(the)i(basic)f(routines) g(in)g(the)g(CFITSIO)e(user)i(in)m(terface)h(that)g(pro)m(vide)f(all)h (the)g(func-)0 2293 y(tions)j(normally)g(needed)g(to)g(read)g(and)f (write)h(most)h(FITS)e(\014les.)54 b(It)35 b(is)g(recommended)f(that)i (these)f(routines)0 2406 y(b)s(e)d(used)g(for)g(most)h(applications)h (and)e(that)h(the)f(more)h(adv)-5 b(anced)33 b(routines)f(describ)s(ed) g(in)g(the)h(next)f(c)m(hapter)0 2518 y(only)e(b)s(e)g(used)g(in)g(sp)s (ecial)h(circumstances)g(when)e(necessary)-8 b(.)0 2679 y(The)30 b(follo)m(wing)i(con)m(v)m(en)m(tions)g(are)f(used)e(in)i (this)f(c)m(hapter)h(in)f(the)g(description)h(of)f(eac)m(h)i(function:) 0 2839 y(1.)39 b(Most)25 b(functions)e(ha)m(v)m(e)i(2)f(names:)37 b(a)24 b(long)h(descriptiv)m(e)f(name)g(and)f(a)i(short)e(concise)i (name.)38 b(Both)25 b(names)f(are)0 2952 y(listed)g(on)f(the)g(\014rst) f(line)i(of)f(the)h(follo)m(wing)g(descriptions,)h(separated)e(b)m(y)h (a)f(slash)g(\(/\))h(c)m(haracter.)40 b(Programmers)0 3065 y(ma)m(y)27 b(use)g(either)g(name)g(in)f(their)h(programs)g(but)f (the)h(long)g(names)g(are)g(recommended)f(to)i(help)e(do)s(cumen)m(t)h (the)0 3177 y(co)s(de)k(and)e(mak)m(e)j(it)f(easier)g(to)g(read.)0 3338 y(2.)42 b(A)30 b(righ)m(t)h(arro)m(w)g(sym)m(b)s(ol)f(\()p Fb(>)p Fj(\))h(is)g(used)f(in)g(the)h(function)f(descriptions)g(to)i (separate)f(the)g(input)f(parameters)0 3451 y(from)j(the)g(output)f (parameters)i(in)f(the)g(de\014nition)g(of)g(eac)m(h)h(routine.)49 b(This)32 b(sym)m(b)s(ol)h(is)g(not)g(actually)i(part)e(of)0 3563 y(the)e(C)f(calling)h(sequence.)0 3724 y(3.)41 b(The)30 b(function)g(parameters)h(are)g(de\014ned)e(in)h(more)g(detail)i(in)e (the)g(alphab)s(etical)i(listing)f(in)f(App)s(endix)f(B.)0 3884 y(4.)39 b(The)23 b(\014rst)g(argumen)m(t)g(in)h(almost)g(all)h (the)e(functions)g(is)h(a)g(p)s(oin)m(ter)f(to)h(a)g(structure)f(of)h (t)m(yp)s(e)g(`\014ts\014le'.)38 b(Memory)0 3997 y(for)26 b(this)g(structure)f(is)h(allo)s(cated)i(b)m(y)e(CFITSIO)e(when)h(the)h (FITS)g(\014le)g(is)g(\014rst)f(op)s(ened)g(or)h(created)h(and)e(is)h (freed)0 4110 y(when)j(the)i(FITS)f(\014le)g(is)g(closed.)0 4270 y(5.)53 b(The)34 b(last)h(argumen)m(t)f(in)g(almost)i(all)f(the)f (functions)g(is)g(the)h(error)f(status)g(parameter.)53 b(It)35 b(m)m(ust)f(b)s(e)f(equal)0 4383 y(to)k(0)g(on)f(input,)h (otherwise)g(the)f(function)g(will)h(immediately)g(exit)g(without)g (doing)f(an)m(ything.)59 b(A)36 b(non-zero)0 4496 y(output)27 b(v)-5 b(alue)27 b(indicates)i(that)e(an)g(error)g(o)s(ccurred)g(in)g (the)g(function.)39 b(In)27 b(most)g(cases)h(the)g(status)f(v)-5 b(alue)28 b(is)f(also)0 4608 y(returned)i(as)i(the)f(v)-5 b(alue)31 b(of)g(the)f(function)g(itself.)0 4739 y SDict begin H.S end 0 4739 a 0 4739 a SDict begin 13.6 H.A end 0 4739 a 0 4739 a SDict begin [/View [/XYZ H.V]/Dest (section.5.1) cvn /DEST pdfmark end 0 4739 a 196 x Ff(5.1)135 b(CFITSIO)44 b(Error)h(Status)h(Routines)0 5168 y Fi(1)81 b Fj(Return)27 b(a)j(descriptiv)m(e)f(text)h(string)e(\(30)i(c)m(har)f (max.\))41 b(corresp)s(onding)28 b(to)h(a)g(CFITSIO)e(error)h(status)h (co)s(de.)95 5385 y Fe(void)47 b(fits_get_errstatus)c(/)k(ffgerr)f (\(int)h(status,)f(>)h(char)g(*err_text\))0 5601 y Fi(2)81 b Fj(Return)35 b(the)h(top)g(\(oldest\))h(80-c)m(haracter)i(error)c (message)i(from)e(the)h(in)m(ternal)h(CFITSIO)d(stac)m(k)j(of)f(error) 227 5714 y(messages)45 b(and)e(shift)h(an)m(y)g(remaining)g(messages)h (on)f(the)g(stac)m(k)h(up)e(one)h(lev)m(el.)83 b(Call)44 b(this)g(routine)1905 5942 y(31)p eop end %%Page: 32 40 TeXDict begin 32 39 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.32) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(32)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)227 555 y Fj(rep)s(eatedly)c(to)h(get)g(eac)m (h)g(message)f(in)g(sequence.)39 b(The)26 b(function)f(returns)g(a)h(v) -5 b(alue)26 b(=)f(0)h(and)g(a)g(n)m(ull)f(error)227 668 y(message)32 b(when)d(the)i(error)f(stac)m(k)i(is)e(empt)m(y)-8 b(.)95 940 y Fe(int)47 b(fits_read_errmsg)d(/)j(ffgmsg)f(\(char)h (*err_msg\))0 1211 y Fi(3)81 b Fj(Prin)m(t)30 b(out)h(the)g(error)f (message)i(corresp)s(onding)e(to)h(the)g(input)f(status)h(v)-5 b(alue)31 b(and)f(all)i(the)f(error)f(messages)227 1324 y(on)d(the)h(CFITSIO)e(stac)m(k)j(to)f(the)f(sp)s(eci\014ed)g(\014le)g (stream)h(\(normally)g(to)g(stdout)f(or)g(stderr\).)40 b(If)26 b(the)i(input)227 1437 y(status)j(v)-5 b(alue)31 b(=)f(0)h(then)f(this)g(routine)g(do)s(es)g(nothing.)95 1709 y Fe(void)47 b(fits_report_error)c(/)48 b(ffrprt)e(\(FILE)g (*stream,)g(status\))0 1981 y Fi(4)81 b Fj(The)44 b(\014ts)p 461 1981 28 4 v 32 w(write)p 695 1981 V 33 w(errmark)g(routine)h(puts)f (an)h(in)m(visible)g(mark)m(er)g(on)g(the)g(CFITSIO)e(error)h(stac)m (k.)85 b(The)227 2094 y(\014ts)p 354 2094 V 33 w(clear)p 573 2094 V 34 w(errmark)31 b(routine)i(can)g(then)f(b)s(e)f(used)h(to)h (delete)h(an)m(y)f(more)f(recen)m(t)i(error)e(messages)h(on)g(the)227 2207 y(stac)m(k,)42 b(bac)m(k)c(to)g(the)g(p)s(osition)g(of)g(the)g (mark)m(er.)63 b(This)37 b(preserv)m(es)g(an)m(y)h(older)g(error)f (messages)i(on)f(the)227 2319 y(stac)m(k.)77 b(The)41 b(\014ts)p 855 2319 V 32 w(clear)p 1073 2319 V 34 w(errmsg)g(routine)h (simply)f(clears)i(all)g(the)f(messages)g(\(and)g(marks\))f(from)h(the) 227 2432 y(stac)m(k.)g(These)31 b(routines)f(are)h(called)g(without)g (an)m(y)f(argumen)m(ts.)95 2704 y Fe(void)47 b(fits_write_errmark)c(/)k (ffpmrk)f(\(void\))95 2817 y(void)h(fits_clear_errmark)c(/)k(ffcmrk)f (\(void\))95 2930 y(void)h(fits_clear_errmsg)c(/)48 b(ffcmsg)e (\(void\))0 3101 y SDict begin H.S end 0 3101 a 0 3101 a SDict begin 13.6 H.A end 0 3101 a 0 3101 a SDict begin [/View [/XYZ H.V]/Dest (section.5.2) cvn /DEST pdfmark end 0 3101 a 177 x Ff(5.2)135 b(FITS)44 b(File)i(Access)e(Routines)0 3527 y Fi(1)81 b Fj(Op)s(en)29 b(an)h(existing)h(data)g(\014le.)227 3794 y Fe(int)47 b(fits_open_file)d(/)k(ffopen)418 3907 y(\(fitsfile)d(**fptr,)h(char)h(*filename,)e(int)i(iomode,)f(>)h(int)g (*status\))227 4133 y(int)g(fits_open_diskfile)c(/)k(ffdkopen)418 4246 y(\(fitsfile)e(**fptr,)h(char)h(*filename,)e(int)i(iomode,)f(>)h (int)g(*status\))227 4472 y(int)g(fits_open_data)d(/)k(ffdopn)418 4585 y(\(fitsfile)d(**fptr,)h(char)h(*filename,)e(int)i(iomode,)f(>)h (int)g(*status\))227 4811 y(int)g(fits_open_table)d(/)j(fftopn)418 4924 y(\(fitsfile)e(**fptr,)h(char)h(*filename,)e(int)i(iomode,)f(>)h (int)g(*status\))227 5149 y(int)g(fits_open_image)d(/)j(ffiopn)418 5262 y(\(fitsfile)e(**fptr,)h(char)h(*filename,)e(int)i(iomode,)f(>)h (int)g(*status\))227 5488 y(int)g(fits_open_extlist)c(/)48 b(ffeopn)418 5601 y(\(fitsfile)d(**fptr,)h(char)h(*filename,)e(int)i (iomode,)f(char)g(*extlist,)418 5714 y(>)95 b(int)47 b(*hdutype,)f(int)g(*status\))p eop end %%Page: 33 41 TeXDict begin 33 40 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.33) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.2.)72 b(FITS)30 b(FILE)g(A)m(CCESS)f(R)m(OUTINES)2244 b Fj(33)227 555 y(The)41 b(iomo)s(de)h(parameter)g(determines)g(the)f(read/write)h (access)h(allo)m(w)m(ed)h(in)d(the)g(\014le)h(and)f(can)h(ha)m(v)m(e) 227 668 y(v)-5 b(alues)32 b(of)g(READONL)-8 b(Y)32 b(\(0\))g(or)g(READ) m(WRITE)g(\(1\).)44 b(The)31 b(\014lename)h(parameter)g(giv)m(es)h(the) e(name)h(of)227 781 y(the)f(\014le)g(to)g(b)s(e)f(op)s(ened,)h(follo)m (w)m(ed)h(b)m(y)f(an)f(optional)i(argumen)m(t)f(giving)h(the)f(name)f (or)h(index)f(n)m(um)m(b)s(er)g(of)227 894 y(the)d(extension)g(within)g (the)f(FITS)g(\014le)h(that)g(should)f(b)s(e)g(mo)m(v)m(ed)i(to)f(and)f (op)s(ened)g(\(e.g.,)k Fe(myfile.fits+3)227 1007 y Fj(or)36 b Fe(myfile.fits[3])d Fj(mo)m(v)m(es)k(to)g(the)g(3rd)f(extension)g (within)g(the)h(\014le,)h(and)d Fe(myfile.fits[events])227 1120 y Fj(mo)m(v)m(es)d(to)f(the)g(extension)g(with)f(the)g(k)m(eyw)m (ord)h(EXTNAME)g(=)f('EVENTS'\).)227 1276 y(The)37 b(\014ts)p 548 1276 28 4 v 32 w(op)s(en)p 770 1276 V 32 w(disk\014le)g(routine)g (is)g(similar)g(to)h(the)f(\014ts)p 2241 1276 V 33 w(op)s(en)p 2464 1276 V 32 w(\014le)g(routine)g(except)h(that)f(it)h(do)s(es)f(not) 227 1389 y(supp)s(ort)22 b(the)h(extended)h(\014lename)f(syn)m(tax)h (in)f(the)h(input)e(\014le)i(name.)38 b(This)23 b(routine)g(simply)g (tries)h(to)g(op)s(en)227 1502 y(the)36 b(sp)s(eci\014ed)e(input)h (\014le)g(on)g(magnetic)i(disk.)55 b(This)34 b(routine)h(is)h(mainly)f (for)g(use)g(in)g(cases)h(where)f(the)227 1615 y(\014lename)f(\(or)h (directory)f(path\))g(con)m(tains)h(square)f(or)g(curly)f(brac)m(k)m (et)j(c)m(haracters)f(that)f(w)m(ould)g(confuse)227 1728 y(the)d(extended)f(\014lename)h(parser.)227 1884 y(The)i(\014ts)p 544 1884 V 32 w(op)s(en)p 766 1884 V 32 w(data)h(routine)e(is)h (similar)g(to)h(the)f(\014ts)p 2113 1884 V 32 w(op)s(en)p 2335 1884 V 33 w(\014le)f(routine)h(except)h(that)f(it)h(will)f(mo)m(v) m(e)h(to)227 1997 y(the)23 b(\014rst)f(HDU)h(con)m(taining)h (signi\014can)m(t)f(data,)i(if)e(a)g(HDU)g(name)f(or)h(n)m(um)m(b)s(er) e(to)i(op)s(en)f(w)m(as)h(not)f(explicitly)227 2110 y(sp)s(eci\014ed)37 b(as)g(part)h(of)f(the)h(\014lename.)61 b(In)37 b(this)g(case,)j(it)e (will)g(lo)s(ok)g(for)f(the)g(\014rst)g(IMA)m(GE)h(HDU)g(with)227 2223 y(NAXIS)29 b(greater)h(than)e(0,)i(or)f(the)f(\014rst)g(table)i (that)f(do)s(es)g(not)g(con)m(tain)h(the)f(strings)f(`GTI')h(\(Go)s(o)s (d)g(Time)227 2336 y(In)m(terv)-5 b(al)31 b(extension\))h(or)e(`OBST)-8 b(ABLE')31 b(in)f(the)h(EXTNAME)f(k)m(eyw)m(ord)h(v)-5 b(alue.)227 2492 y(The)25 b(\014ts)p 536 2492 V 32 w(op)s(en)p 758 2492 V 32 w(table)h(and)e(\014ts)p 1305 2492 V 33 w(op)s(en)p 1528 2492 V 32 w(image)i(routines)f(are)g(similar)h(to)f (\014ts)p 2828 2492 V 33 w(op)s(en)p 3051 2492 V 32 w(data)h(except)f (they)h(will)227 2605 y(mo)m(v)m(e)h(to)g(the)f(\014rst)f(signi\014can) m(t)h(table)h(HDU)f(or)g(image)h(HDU)f(in)f(the)h(\014le,)h(resp)s (ectiv)m(ely)-8 b(,)29 b(if)c(a)h(HDU)h(name)227 2718 y(or)k(n)m(um)m(b)s(er)e(is)h(not)h(sp)s(eci\014ed)e(as)i(part)f(of)h (the)f(\014lename.)227 2874 y(The)40 b(\014ts)p 551 2874 V 33 w(op)s(en)p 774 2874 V 32 w(extname)h(routine)g(op)s(ens)f(the)h (\014le)g(and)f(attempts)h(to)h(mo)m(v)m(e)g(to)f(a)g('useful')g(HDU.)g (If)227 2987 y(after)28 b(op)s(ening)f(the)h(\014le)f(CFITSIO)f(is)h(p) s(oin)m(ting)h(to)g(n)m(ull)f(primary)g(arra)m(y)-8 b(,)29 b(then)e(CFITSIO)f(will)i(attempt)227 3100 y(to)38 b(mo)m(v)m(e)g(to)f (the)g(\014rst)f(extension)h(that)g(has)f(an)h(EXTNAME)g(or)f(HDUNAME)i (k)m(eyw)m(ord)f(v)-5 b(alue)37 b(that)227 3213 y(matc)m(hes)28 b(one)f(of)g(the)g(names)f(in)h(the)g(input)f(extlist)i (space-delimited)g(list)f(of)g(names.)39 b(If)27 b(that)g(fails,)h (then)227 3326 y(CFITSIO)h(simply)h(mo)m(v)m(es)i(to)f(the)f(2nd)g(HDU) h(in)f(the)h(\014le.)227 3482 y(IRAF)26 b(images)g(\(.imh)g(format)g (\014les\))f(and)g(ra)m(w)h(binary)e(data)j(arra)m(ys)e(ma)m(y)h(also)h (b)s(e)e(op)s(ened)f(with)h(READ-)227 3595 y(ONL)-8 b(Y)37 b(access.)60 b(CFITSIO)35 b(will)i(automatically)i(test)f(if)e(the)h (input)e(\014le)i(is)f(an)h(IRAF)f(image,)k(and)c(if,)227 3708 y(so)c(will)g(con)m(v)m(ert)h(it)f(on)f(the)h(\015y)f(in)m(to)i(a) f(virtual)f(FITS)g(image)i(b)s(efore)e(it)h(is)g(op)s(ened)e(b)m(y)i (the)g(application)227 3821 y(program.)64 b(If)37 b(the)h(input)g (\014le)g(is)g(a)g(ra)m(w)g(binary)g(data)g(arra)m(y)h(of)f(n)m(um)m(b) s(ers,)h(then)e(the)i(data)f(t)m(yp)s(e)h(and)227 3933 y(dimensions)d(of)g(the)g(arra)m(y)h(m)m(ust)f(b)s(e)f(sp)s(eci\014ed)g (in)h(square)g(brac)m(k)m(ets)h(follo)m(wing)h(the)e(name)g(of)h(the)f (\014le)227 4046 y(\(e.g.)56 b('ra)m(w\014le.dat[i512,512]')40 b(op)s(ens)34 b(a)i(512)g(x)f(512)h(short)e(in)m(teger)j(image\).)56 b(See)35 b(the)g(`Extended)g(File)227 4159 y(Name)k(Syn)m(tax')g(c)m (hapter)g(for)e(more)i(details)g(on)f(ho)m(w)g(to)h(sp)s(ecify)f(the)g (ra)m(w)h(\014le)f(name.)64 b(The)38 b(ra)m(w)g(\014le)227 4272 y(is)k(con)m(v)m(erted)g(on)f(the)h(\015y)f(in)m(to)h(a)f(virtual) h(FITS)e(image)j(in)e(memory)g(that)h(is)f(then)g(op)s(ened)g(b)m(y)g (the)227 4385 y(application)32 b(program)e(with)g(READONL)-8 b(Y)31 b(access.)227 4541 y(Programs)g(can)g(read)f(the)h(input)e (\014le)i(from)f(the)h('stdin')f(\014le)h(stream)g(if)f(a)h(dash)f(c)m (haracter)i(\('-'\))g(is)f(giv)m(en)227 4654 y(as)36 b(the)g(\014lename.)58 b(Files)37 b(can)f(also)h(b)s(e)e(op)s(ened)g(o) m(v)m(er)i(the)f(net)m(w)m(ork)h(using)e(FTP)h(or)g(HTTP)f(proto)s (cols)227 4767 y(b)m(y)j(supplying)f(the)h(appropriate)h(URL)e(as)i (the)f(\014lename.)64 b(The)38 b(HTTPS)f(and)g(FTPS)h(proto)s(cols)h (are)227 4880 y(also)29 b(supp)s(orted)d(if)i(the)g(CFITSIO)e(build)h (includes)g(the)h(lib)s(curl)f(library)-8 b(.)40 b(\(If)27 b(the)h(CFITSIO)f('con\014gure')227 4993 y(script)34 b(\014nds)e(a)i(usable)f(lib)s(curl)g(library)h(on)f(y)m(our)h(system,) h(it)f(will)g(automatically)i(b)s(e)d(included)g(in)h(the)227 5106 y(build.\))227 5262 y(The)43 b(input)f(\014le)h(can)h(b)s(e)f(mo)s (di\014ed)f(in)g(v)-5 b(arious)44 b(w)m(a)m(ys)g(to)g(create)g(a)g (virtual)f(\014le)h(\(usually)f(stored)g(in)227 5375 y(memory\))31 b(that)g(is)g(then)f(op)s(ened)f(b)m(y)i(the)f (application)i(program)e(b)m(y)h(supplying)e(a)i(\014ltering)g(or)f (binning)227 5488 y(sp)s(eci\014er)e(in)g(square)g(brac)m(k)m(ets)h (follo)m(wing)h(the)e(\014lename.)40 b(Some)29 b(of)f(the)g(more)h (common)f(\014ltering)h(meth-)227 5601 y(o)s(ds)j(are)h(illustrated)h (in)e(the)h(follo)m(wing)i(paragraphs,)e(but)f(users)g(should)f(refer)i (to)g(the)g('Extended)g(File)227 5714 y(Name)e(Syn)m(tax')g(c)m(hapter) g(for)f(a)h(complete)h(description)e(of)h(the)f(full)h(\014le)f (\014ltering)h(syn)m(tax.)p eop end %%Page: 34 42 TeXDict begin 34 41 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.34) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(34)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)227 555 y Fj(When)d(op)s(ening)f(an)h(image,) h(a)g(rectangular)f(subset)f(of)h(the)g(ph)m(ysical)g(image)h(ma)m(y)g (b)s(e)e(op)s(ened)f(b)m(y)i(listing)227 668 y(the)k(\014rst)e(and)h (last)h(pixel)g(in)f(eac)m(h)i(dimension)e(\(and)g(optional)h(pixel)g (skipping)f(factor\):)227 895 y Fe(myimage.fits[101:200,301:)o(400])227 1123 y Fj(will)g(create)h(and)e(op)s(en)f(a)i(100x100)i(pixel)e (virtual)g(image)g(of)g(that)g(section)g(of)g(the)f(ph)m(ysical)h (image,)i(and)227 1235 y Fe(myimage.fits[*,-*])c Fj(op)s(ens)k(a)h (virtual)g(image)h(that)f(is)g(the)g(same)g(size)h(as)e(the)h(ph)m (ysical)h(image)g(but)227 1348 y(has)c(b)s(een)g(\015ipp)s(ed)f(in)h (the)g(v)m(ertical)j(direction.)227 1495 y(When)28 b(op)s(ening)g(a)g (table,)i(the)e(\014ltering)g(syn)m(tax)h(can)f(b)s(e)f(used)h(to)g (add)g(or)g(delete)h(columns)f(or)g(k)m(eyw)m(ords)227 1608 y(in)g(the)g(virtual)h(table:)40 b Fe(myfile.fits[events][col)i (!time;)k(PI)h(=)h(PHA*1.2])26 b Fj(op)s(ens)h(a)h(virtual)h(ta-)227 1721 y(ble)j(in)f(whic)m(h)g(the)h(TIME)f(column)g(has)g(b)s(een)g (deleted)h(and)f(a)g(new)g(PI)g(column)h(has)f(b)s(een)g(added)f(with) 227 1834 y(a)41 b(v)-5 b(alue)40 b(1.2)i(times)e(that)h(of)f(the)h(PHA) f(column.)70 b(Similarly)-8 b(,)43 b(one)e(can)f(\014lter)h(a)f(table)h (to)g(k)m(eep)g(only)227 1947 y(those)35 b(ro)m(ws)e(that)i(satisfy)f (a)g(selection)i(criterion:)48 b Fe(myfile.fits[events][pha)42 b(>)47 b(50])33 b Fj(creates)j(and)227 2060 y(op)s(ens)31 b(a)g(virtual)h(table)g(con)m(taining)h(only)e(those)h(ro)m(ws)f(with)g (a)g(PHA)h(v)-5 b(alue)31 b(greater)i(than)e(50.)44 b(A)31 b(large)227 2173 y(n)m(um)m(b)s(er)d(of)h(b)s(o)s(olean)h(and)e (mathematical)k(op)s(erators)d(can)g(b)s(e)g(used)f(in)h(the)g (selection)i(expression.)40 b(One)227 2286 y(can)25 b(also)g(\014lter)g (table)g(ro)m(ws)f(using)g('Go)s(o)s(d)h(Time)f(In)m(terv)-5 b(al')26 b(extensions,)g(and)e(spatial)h(region)g(\014lters)g(as)f(in) 227 2399 y Fe(myfile.fits[events][gtifi)o(lter)o(\(\)])14 b Fj(and)19 b Fe(myfile.fits[events][regfil)o(ter)o(\()42 b("stars.rng"\)])p Fj(.)227 2546 y(Finally)-8 b(,)34 b(table)e(columns)f(ma)m(y)h(b)s(e)f(binned)f(or)h(histogrammed)h(to)g (generate)h(a)e(virtual)h(image.)45 b(F)-8 b(or)32 b(ex-)227 2659 y(ample,)d Fe(myfile.fits[events][bin)41 b(\(X,Y\)=4])26 b Fj(will)h(result)h(in)f(a)h(2-dimensional)g(image)h(calculated)227 2771 y(b)m(y)35 b(binning)e(the)i(X)f(and)g(Y)h(columns)f(in)g(the)h (ev)m(en)m(t)h(table)f(with)f(a)h(bin)f(size)h(of)g(4)f(in)h(eac)m(h)g (dimension.)227 2884 y(The)30 b(TLMINn)g(and)f(TLMAXn)h(k)m(eyw)m(ords) h(will)g(b)s(e)e(used)h(b)m(y)g(default)h(to)g(determine)f(the)h(range) f(of)h(the)227 2997 y(image.)227 3144 y(A)j(single)g(program)f(can)g (op)s(en)g(the)h(same)f(FITS)g(\014le)g(more)h(than)f(once)h(and)f (then)g(treat)h(the)g(resulting)227 3257 y(\014ts\014le)c(p)s(oin)m (ters)g(as)g(though)g(they)g(w)m(ere)h(completely)h(indep)s(enden)m(t)d (FITS)g(\014les.)40 b(Using)31 b(this)f(facilit)m(y)-8 b(,)33 b(a)227 3370 y(program)f(can)f(op)s(en)g(a)h(FITS)f(\014le)g(t)m (wice,)j(mo)m(v)m(e)f(to)f(2)g(di\013eren)m(t)g(extensions)g(within)f (the)g(\014le,)h(and)f(then)227 3483 y(read)g(and)e(write)i(data)g(in)f (those)h(extensions)g(in)f(an)m(y)h(order.)0 3723 y Fi(2)81 b Fj(Create)31 b(and)f(op)s(en)f(a)i(new)f(empt)m(y)h(output)f(FITS)f (\014le.)227 3951 y Fe(int)47 b(fits_create_file)d(/)j(ffinit)418 4064 y(\(fitsfile)e(**fptr,)h(char)h(*filename,)e(>)i(int)g(*status\)) 227 4289 y(int)g(fits_create_diskfile)42 b(/)48 b(ffdkinit)418 4402 y(\(fitsfile)d(**fptr,)h(char)h(*filename,)e(>)i(int)g(*status\)) 227 4629 y Fj(An)36 b(error)h(will)g(b)s(e)f(returned)f(if)h(the)h(sp)s (eci\014ed)f(\014le)h(already)g(exists,)i(unless)d(the)h(\014lename)f (is)h(pre\014xed)227 4742 y(with)30 b(an)g(exclamation)i(p)s(oin)m(t)e (\(!\).)42 b(In)29 b(that)i(case)g(CFITSIO)d(will)j(o)m(v)m(erwrite)g (\(delete\))h(an)m(y)f(existing)g(\014le)227 4855 y(with)36 b(the)g(same)h(name.)57 b(Note)38 b(that)e(the)h(exclamation)h(p)s(oin) m(t)e(is)g(a)h(sp)s(ecial)f(UNIX)g(c)m(haracter)i(so)e(if)g(it)227 4968 y(is)d(used)e(on)h(the)h(command)f(line)h(it)g(m)m(ust)f(b)s(e)g (preceded)g(b)m(y)g(a)g(bac)m(kslash)h(to)h(force)e(the)h(UNIX)g(shell) f(to)227 5081 y(accept)g(the)f(c)m(haracter)h(as)e(part)g(of)h(the)g (\014lename.)227 5228 y(The)26 b(output)h(\014le)g(will)g(b)s(e)f (written)h(to)g(the)g('stdout')g(\014le)g(stream)g(if)g(a)g(dash)f(c)m (haracter)i(\('-'\))g(or)f(the)g(string)227 5341 y('stdout')34 b(is)f(giv)m(en)h(as)g(the)f(\014lename.)49 b(Similarly)-8 b(,)35 b('-.gz')g(or)e('stdout.gz')i(will)f(cause)f(the)h(\014le)f(to)h (b)s(e)e(gzip)227 5454 y(compressed)e(b)s(efore)g(it)h(is)g(written)f (out)h(to)g(the)f(stdout)h(stream.)227 5601 y(Optionally)-8 b(,)41 b(the)c(name)h(of)f(a)h(template)h(\014le)e(that)h(is)f(used)g (to)h(de\014ne)f(the)g(structure)g(of)g(the)h(new)f(\014le)227 5714 y(ma)m(y)i(b)s(e)f(sp)s(eci\014ed)f(in)h(paren)m(theses)h(follo)m (wing)g(the)g(output)e(\014le)i(name.)64 b(The)38 b(template)h(\014le)g (ma)m(y)g(b)s(e)p eop end %%Page: 35 43 TeXDict begin 35 42 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.35) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.3.)72 b(HDU)31 b(A)m(CCESS)e(R)m(OUTINES)2488 b Fj(35)227 555 y(another)32 b(FITS)e(\014le,)i(in)f(whic)m(h)g(case)i(the)e(new)g (\014le,)h(at)g(the)g(time)g(it)f(is)h(op)s(ened,)f(will)g(b)s(e)g(an)g (exact)i(cop)m(y)227 668 y(of)38 b(the)g(template)i(\014le)e(except)g (that)h(the)f(data)g(structures)g(\(images)h(and)e(tables\))i(will)f(b) s(e)g(\014lled)f(with)227 781 y(zeros.)k(Alternativ)m(ely)-8 b(,)32 b(the)d(template)i(\014le)e(ma)m(y)g(b)s(e)f(an)h(ASCI)s(I)e (format)i(text)h(\014le)f(con)m(taining)i(directiv)m(es)227 894 y(that)e(de\014ne)e(the)h(k)m(eyw)m(ords)g(to)g(b)s(e)g(created)h (in)e(eac)m(h)i(HDU)g(of)f(the)g(\014le.)40 b(See)28 b(the)g('Extended)f(File)i(Name)227 1007 y(Syn)m(tax')i(section)h(for)e (a)h(complete)g(description)g(of)f(the)h(template)h(\014le)e(syn)m (tax.)227 1156 y(The)f(\014ts)p 540 1156 28 4 v 33 w(create)p 809 1156 V 34 w(disk\014le)g(routine)h(is)g(similar)g(to)g(the)g (\014ts)p 2238 1156 V 32 w(create)p 2506 1156 V 34 w(\014le)g(routine)g (except)g(that)g(it)g(do)s(es)g(not)227 1269 y(supp)s(ort)36 b(the)i(extended)g(\014lename)g(syn)m(tax)g(in)g(the)g(input)f(\014le)h (name.)63 b(This)37 b(routine)h(simply)f(tries)h(to)227 1382 y(create)e(the)e(sp)s(eci\014ed)f(\014le)h(on)f(magnetic)j(disk.) 50 b(This)33 b(routine)h(is)g(mainly)g(for)g(use)f(in)h(cases)g(where)g (the)227 1495 y(\014lename)g(\(or)h(directory)f(path\))g(con)m(tains)h (square)f(or)g(curly)f(brac)m(k)m(et)j(c)m(haracters)f(that)f(w)m(ould) g(confuse)227 1608 y(the)d(extended)f(\014lename)h(parser.)0 1861 y Fi(3)81 b Fj(Close)28 b(a)f(previously)g(op)s(ened)g(FITS)g (\014le.)40 b(The)27 b(\014rst)f(routine)i(simply)f(closes)h(the)g (\014le,)g(whereas)f(the)h(second)227 1974 y(one)g(also)h(DELETES)e (the)g(\014le,)i(whic)m(h)e(can)h(b)s(e)g(useful)e(in)i(cases)g(where)g (a)g(FITS)f(\014le)g(has)h(b)s(een)f(partially)227 2086 y(created,)37 b(but)c(then)h(an)h(error)e(o)s(ccurs)h(whic)m(h)g(prev)m (en)m(ts)h(it)g(from)f(b)s(eing)g(completed.)53 b(Note)36 b(that)e(these)227 2199 y(routines)23 b(b)s(eha)m(v)m(e)g(di\013eren)m (tly)h(than)e(most)h(other)g(CFITSIO)e(routines)i(if)f(the)h(input)f(v) -5 b(alue)23 b(of)g(the)g(`status')227 2312 y(parameter)43 b(is)f(not)h(zero:)65 b(Instead)42 b(of)h(simply)f(returning)f(to)i (the)g(calling)g(program)g(without)f(doing)227 2425 y(an)m(ything,)30 b(these)f(routines)f(e\013ectiv)m(ely)k(ignore)d(the)f(input)g(status)h (v)-5 b(alue)29 b(and)f(still)h(attempt)h(to)f(close)h(or)227 2538 y(delete)i(the)e(\014le.)95 2791 y Fe(int)47 b(fits_close_file)d (/)j(ffclos)g(\(fitsfile)e(*fptr,)h(>)h(int)g(*status\))95 3017 y(int)g(fits_delete_file)d(/)j(ffdelt)f(\(fitsfile)g(*fptr,)g(>)h (int)g(*status\))0 3270 y Fi(4)81 b Fj(Return)21 b(the)i(name,)h(I/O)e (mo)s(de)g(\(READONL)-8 b(Y)24 b(or)e(READ)m(WRITE\),)i(and/or)e(the)g (\014le)h(t)m(yp)s(e)f(\(e.g.)40 b('\014le://',)227 3383 y('ftp://'\))32 b(of)f(the)f(op)s(ened)g(FITS)g(\014le.)95 3636 y Fe(int)47 b(fits_file_name)d(/)k(ffflnm)e(\(fitsfile)f(*fptr,)h (>)i(char)e(*filename,)f(int)i(*status\))95 3862 y(int)g (fits_file_mode)d(/)k(ffflmd)e(\(fitsfile)f(*fptr,)h(>)i(int)f (*iomode,)e(int)i(*status\))95 4088 y(int)g(fits_url_type)e(/)i(ffurlt) f(\(fitsfile)f(*fptr,)h(>)i(char)f(*urltype,)e(int)i(*status\))0 4244 y SDict begin H.S end 0 4244 a 0 4244 a SDict begin 13.6 H.A end 0 4244 a 0 4244 a SDict begin [/View [/XYZ H.V]/Dest (section.5.3) cvn /DEST pdfmark end 0 4244 a 176 x Ff(5.3)135 b(HDU)46 b(Access)e(Routines)0 4670 y Fj(The)30 b(follo)m(wing)i(functions)e(p)s(erform)f(op)s(erations)h(on)h (Header-Data)h(Units)f(\(HDUs\))h(as)e(a)h(whole.)0 4924 y Fi(1)81 b Fj(Mo)m(v)m(e)44 b(to)g(a)f(di\013eren)m(t)g(HDU)g(in)g (the)g(\014le.)77 b(The)43 b(\014rst)f(routine)g(mo)m(v)m(es)i(to)g(a)f (sp)s(eci\014ed)f(absolute)h(HDU)227 5036 y(n)m(um)m(b)s(er)f (\(starting)h(with)g(1)f(for)h(the)g(primary)e(arra)m(y\))j(in)e(the)h (FITS)f(\014le,)k(and)c(the)g(second)h(routine)227 5149 y(mo)m(v)m(es)35 b(a)e(relativ)m(e)i(n)m(um)m(b)s(er)d(HDUs)i(forw)m (ard)e(or)h(bac)m(kw)m(ard)h(from)f(the)g(curren)m(t)g(HDU.)h(A)f(n)m (ull)g(p)s(oin)m(ter)227 5262 y(ma)m(y)e(b)s(e)f(giv)m(en)h(for)f(the)g (hdut)m(yp)s(e)f(parameter)i(if)f(it's)h(v)-5 b(alue)31 b(is)f(not)h(needed.)40 b(The)30 b(third)f(routine)i(mo)m(v)m(es)227 5375 y(to)39 b(the)g(\(\014rst\))f(HDU)i(whic)m(h)e(has)g(the)h(sp)s (eci\014ed)e(extension)i(t)m(yp)s(e)g(and)f(EXTNAME)g(and)g(EXTVER)227 5488 y(k)m(eyw)m(ord)26 b(v)-5 b(alues)26 b(\(or)g(HDUNAME)h(and)e (HDUVER)h(k)m(eyw)m(ords\).)40 b(The)24 b(hdut)m(yp)s(e)h(parameter)h (ma)m(y)g(ha)m(v)m(e)227 5601 y(a)d(v)-5 b(alue)22 b(of)g(IMA)m(GE)p 935 5601 28 4 v 34 w(HDU,)h(ASCI)s(I)p 1476 5601 V 31 w(TBL,)f(BINAR)-8 b(Y)p 2101 5601 V 34 w(TBL,)22 b(or)g(ANY)p 2676 5601 V 34 w(HDU)g(where)g(ANY)p 3396 5601 V 33 w(HDU)h(means)227 5714 y(that)33 b(only)g(the)f(extname)i(and)d(extv)m(er)j(v)-5 b(alues)33 b(will)f(b)s(e)g(used)g(to)h(lo)s(cate)h(the)f(correct)g (extension.)48 b(If)32 b(the)p eop end %%Page: 36 44 TeXDict begin 36 43 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.36) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(36)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)227 555 y Fj(input)k(v)-5 b(alue)36 b(of)f(extv)m(er)h(is)f(0)h(then)e(the)i(EXTVER)e(k)m(eyw)m(ord)i(is)f (ignored)g(and)g(the)g(\014rst)f(HDU)i(with)f(a)227 668 y(matc)m(hing)28 b(EXTNAME)g(\(or)f(HDUNAME\))i(k)m(eyw)m(ord)e(will)g (b)s(e)g(found.)38 b(If)27 b(no)f(matc)m(hing)i(HDU)g(is)f(found)227 781 y(in)f(the)g(\014le)g(then)g(the)g(curren)m(t)g(HDU)g(will)h (remain)f(unc)m(hanged)f(and)h(a)g(status)g(=)g(BAD)p 3246 781 28 4 v 33 w(HDU)p 3484 781 V 34 w(NUM)h(will)227 894 y(b)s(e)j(returned.)95 1141 y Fe(int)47 b(fits_movabs_hdu)d(/)j (ffmahd)286 1254 y(\(fitsfile)f(*fptr,)g(int)h(hdunum,)e(>)j(int)f (*hdutype,)e(int)i(*status\))95 1480 y(int)g(fits_movrel_hdu)d(/)j (ffmrhd)286 1593 y(\(fitsfile)f(*fptr,)g(int)h(nmove,)f(>)h(int)g (*hdutype,)e(int)i(*status\))95 1818 y(int)g(fits_movnam_hdu)d(/)j (ffmnhd)286 1931 y(\(fitsfile)f(*fptr,)g(int)h(hdutype,)e(char)i (*extname,)e(int)i(extver,)f(>)h(int)g(*status\))0 2178 y Fi(2)81 b Fj(Return)38 b(the)i(total)h(n)m(um)m(b)s(er)d(of)i(HDUs)g (in)f(the)h(FITS)f(\014le.)68 b(This)39 b(returns)f(the)h(n)m(um)m(b)s (er)g(of)g(completely)227 2291 y(de\014ned)30 b(HDUs)h(in)f(the)h (\014le.)42 b(If)30 b(a)h(new)f(HDU)h(has)g(just)f(b)s(een)g(added)f (to)j(the)f(FITS)f(\014le,)h(then)f(that)h(last)227 2404 y(HDU)f(will)f(only)g(b)s(e)g(coun)m(ted)g(if)g(it)h(has)e(b)s(een)h (closed,)h(or)f(if)g(data)h(has)e(b)s(een)h(written)g(to)g(the)g(HDU.)h (The)227 2517 y(curren)m(t)g(HDU)i(remains)e(unc)m(hanged)g(b)m(y)g (this)g(routine.)95 2764 y Fe(int)47 b(fits_get_num_hdus)c(/)48 b(ffthdu)286 2877 y(\(fitsfile)e(*fptr,)g(>)h(int)g(*hdunum,)f(int)h (*status\))0 3124 y Fi(3)81 b Fj(Return)31 b(the)h(n)m(um)m(b)s(er)f (of)h(the)h(curren)m(t)e(HDU)i(\(CHDU\))h(in)d(the)i(FITS)e(\014le)h (\(where)g(the)g(primary)g(arra)m(y)g(=)227 3237 y(1\).)42 b(This)29 b(function)h(returns)g(the)g(HDU)h(n)m(um)m(b)s(er)e(rather)h (than)h(a)f(status)h(v)-5 b(alue.)95 3484 y Fe(int)47 b(fits_get_hdu_num)d(/)j(ffghdn)286 3597 y(\(fitsfile)f(*fptr,)g(>)h (int)g(*hdunum\))0 3844 y Fi(4)81 b Fj(Return)38 b(the)h(t)m(yp)s(e)h (of)f(the)h(curren)m(t)f(HDU)h(in)f(the)g(FITS)g(\014le.)67 b(The)39 b(p)s(ossible)g(v)-5 b(alues)39 b(for)g(hdut)m(yp)s(e)f(are:) 227 3957 y(IMA)m(GE)p 546 3957 V 34 w(HDU,)31 b(ASCI)s(I)p 1095 3957 V 32 w(TBL,)f(or)g(BINAR)-8 b(Y)p 1840 3957 V 34 w(TBL.)95 4204 y Fe(int)47 b(fits_get_hdu_type)c(/)48 b(ffghdt)286 4317 y(\(fitsfile)e(*fptr,)g(>)h(int)g(*hdutype,)e(int)i (*status\))0 4564 y Fi(5)81 b Fj(Cop)m(y)24 b(all)h(or)f(part)g(of)g (the)g(HDUs)h(in)f(the)g(FITS)g(\014le)g(asso)s(ciated)h(with)f(infptr) f(and)h(app)s(end)e(them)i(to)h(the)g(end)227 4677 y(of)f(the)f(FITS)f (\014le)i(asso)s(ciated)g(with)f(outfptr.)38 b(If)23 b('previous')g(is)g(true)g(\(not)h(0\),)i(then)d(an)m(y)g(HDUs)h (preceding)227 4789 y(the)35 b(curren)m(t)f(HDU)g(in)g(the)h(input)e (\014le)h(will)h(b)s(e)e(copied)i(to)g(the)f(output)g(\014le.)52 b(Similarly)-8 b(,)36 b('curren)m(t')f(and)227 4902 y('follo)m(wing')c (determine)e(whether)f(the)h(curren)m(t)g(HDU,)g(and/or)g(an)m(y)g (follo)m(wing)h(HDUs)g(in)e(the)h(input)f(\014le)227 5015 y(will)i(b)s(e)f(copied)i(to)f(the)g(output)f(\014le.)41 b(Th)m(us,)29 b(if)g(all)i(3)f(parameters)g(are)g(true,)g(then)g(the)f (en)m(tire)i(input)e(\014le)227 5128 y(will)36 b(b)s(e)e(copied.)56 b(On)35 b(exit,)i(the)f(curren)m(t)f(HDU)h(in)e(the)i(input)e(\014le)i (will)f(b)s(e)g(unc)m(hanged,)h(and)f(the)g(last)227 5241 y(HDU)c(in)f(the)h(output)f(\014le)g(will)h(b)s(e)f(the)g(curren)m (t)h(HDU.)95 5488 y Fe(int)47 b(fits_copy_file)d(/)k(ffcpfl)286 5601 y(\(fitsfile)e(*infptr,)f(fitsfile)h(*outfptr,)f(int)i(previous,)e (int)i(current,)477 5714 y(int)g(following,)e(>)j(int)f(*status\))p eop end %%Page: 37 45 TeXDict begin 37 44 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.37) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.4.)72 b(HEADER)31 b(KEYW)m(ORD)g(READ/WRITE)g(R)m(OUTINES)1495 b Fj(37)0 555 y Fi(6)81 b Fj(Cop)m(y)34 b(the)h(curren)m(t)f(HDU)h (from)f(the)g(FITS)g(\014le)h(asso)s(ciated)g(with)g(infptr)e(and)h (app)s(end)e(it)j(to)g(the)g(end)f(of)227 668 y(the)39 b(FITS)e(\014le)h(asso)s(ciated)i(with)e(outfptr.)64 b(Space)38 b(ma)m(y)h(b)s(e)e(reserv)m(ed)i(for)f(MOREKEYS)f (additional)227 781 y(k)m(eyw)m(ords)31 b(in)f(the)h(output)f(header.) 95 1032 y Fe(int)47 b(fits_copy_hdu)e(/)i(ffcopy)286 1144 y(\(fitsfile)f(*infptr,)f(fitsfile)h(*outfptr,)f(int)i(morekeys,)e (>)j(int)f(*status\))0 1395 y Fi(7)81 b Fj(W)-8 b(rite)31 b(the)g(curren)m(t)f(HDU)h(in)f(the)h(input)e(FITS)h(\014le)g(to)h(the) g(output)f(FILE)g(stream)h(\(e.g.,)h(to)f(stdout\).)95 1645 y Fe(int)47 b(fits_write_hdu)d(/)k(ffwrhdu)286 1758 y(\(fitsfile)e(*infptr,)f(FILE)i(*stream,)e(>)j(int)f(*status\))0 2009 y Fi(8)81 b Fj(Cop)m(y)43 b(the)h(header)g(\(and)f(not)h(the)g (data\))h(from)e(the)h(CHDU)g(asso)s(ciated)h(with)f(infptr)e(to)j(the) f(CHDU)227 2122 y(asso)s(ciated)28 b(with)e(outfptr.)39 b(If)26 b(the)h(curren)m(t)f(output)g(HDU)h(is)g(not)f(completely)i (empt)m(y)-8 b(,)29 b(then)d(the)h(CHDU)227 2235 y(will)35 b(b)s(e)f(closed)h(and)f(a)h(new)f(HDU)h(will)g(b)s(e)f(app)s(ended)e (to)j(the)g(output)f(\014le.)53 b(An)34 b(empt)m(y)h(output)f(data)227 2348 y(unit)c(will)h(b)s(e)f(created)h(with)f(all)h(v)-5 b(alues)31 b(initially)h(=)e(0\).)95 2598 y Fe(int)47 b(fits_copy_header)d(/)j(ffcphd)286 2711 y(\(fitsfile)f(*infptr,)f (fitsfile)h(*outfptr,)f(>)i(int)g(*status\))0 2962 y Fi(9)81 b Fj(Delete)35 b(the)e(CHDU)h(in)f(the)g(FITS)f(\014le.)50 b(An)m(y)33 b(follo)m(wing)i(HDUs)e(will)h(b)s(e)e(shifted)h(forw)m (ard)g(in)g(the)g(\014le,)h(to)227 3074 y(\014ll)k(in)f(the)g(gap)h (created)g(b)m(y)g(the)f(deleted)h(HDU.)h(In)d(the)i(case)g(of)g (deleting)g(the)g(primary)e(arra)m(y)i(\(the)227 3187 y(\014rst)30 b(HDU)h(in)f(the)h(\014le\))g(then)f(the)h(curren)m(t)f (primary)f(arra)m(y)i(will)g(b)s(e)f(replace)h(b)m(y)g(a)g(n)m(ull)f (primary)f(arra)m(y)227 3300 y(con)m(taining)k(the)f(minim)m(um)e(set)i (of)g(required)e(k)m(eyw)m(ords)i(and)e(no)i(data.)44 b(If)31 b(there)g(are)h(more)f(extensions)227 3413 y(in)f(the)g(\014le) g(follo)m(wing)i(the)e(one)g(that)h(is)f(deleted,)h(then)f(the)g(the)g (CHDU)h(will)f(b)s(e)g(rede\014ned)e(to)j(p)s(oin)m(t)f(to)227 3526 y(the)d(follo)m(wing)h(extension.)41 b(If)26 b(there)h(are)g(no)g (follo)m(wing)h(extensions)f(then)g(the)g(CHDU)g(will)g(b)s(e)f (rede\014ned)227 3639 y(to)36 b(p)s(oin)m(t)f(to)g(the)g(previous)f (HDU.)i(The)e(output)h(hdut)m(yp)s(e)e(parameter)i(returns)f(the)h(t)m (yp)s(e)g(of)f(the)h(new)227 3752 y(CHDU.)c(A)g(n)m(ull)f(p)s(oin)m (ter)g(ma)m(y)h(b)s(e)f(giv)m(en)i(for)e(hdut)m(yp)s(e)f(if)h(the)h (returned)e(v)-5 b(alue)31 b(is)f(not)h(needed.)95 4002 y Fe(int)47 b(fits_delete_hdu)d(/)j(ffdhdu)286 4115 y(\(fitsfile)f (*fptr,)g(>)h(int)g(*hdutype,)e(int)i(*status\))0 4271 y SDict begin H.S end 0 4271 a 0 4271 a SDict begin 13.6 H.A end 0 4271 a 0 4271 a SDict begin [/View [/XYZ H.V]/Dest (section.5.4) cvn /DEST pdfmark end 0 4271 a 177 x Ff(5.4)135 b(Header)46 b(Keyw)l(ord)g(Read/W)-11 b(rite)46 b(Routines)0 4698 y Fj(These)35 b(routines)g(read)f(or)h(write)h(k)m (eyw)m(ords)f(in)g(the)g(Curren)m(t)f(Header)h(Unit)g(\(CHU\).)h(Wild)g (card)e(c)m(haracters)0 4811 y(\(*,)28 b(?,)g(or)e(#\))h(ma)m(y)g(b)s (e)f(used)g(when)f(sp)s(ecifying)i(the)g(name)f(of)h(the)g(k)m(eyw)m (ord)g(to)g(b)s(e)f(read:)39 b(a)27 b(')10 b(?')39 b(will)27 b(matc)m(h)h(an)m(y)0 4924 y(single)35 b(c)m(haracter)g(at)g(that)f(p)s (osition)g(in)g(the)g(k)m(eyw)m(ord)h(name)f(and)f(a)h('*')h(will)g (matc)m(h)f(an)m(y)h(length)f(\(including)0 5036 y(zero\))c(string)f (of)g(c)m(haracters.)42 b(The)28 b('#')h(c)m(haracter)i(will)e(matc)m (h)h(an)m(y)f(consecutiv)m(e)i(string)e(of)g(decimal)h(digits)f(\(0)0 5149 y(-)35 b(9\).)55 b(When)35 b(a)g(wild)g(card)g(is)g(used)f(the)h (routine)g(will)g(only)g(searc)m(h)h(for)f(a)g(matc)m(h)h(from)e(the)h (curren)m(t)g(header)0 5262 y(p)s(osition)27 b(to)h(the)f(end)f(of)h (the)g(header)g(and)f(will)h(not)g(resume)g(the)g(searc)m(h)g(from)g (the)g(top)g(of)g(the)g(header)g(bac)m(k)g(to)0 5375 y(the)k(original)i(header)e(p)s(osition)g(as)h(is)f(done)g(when)f(no)h (wildcards)g(are)h(included)e(in)h(the)g(k)m(eyw)m(ord)h(name.)43 b(The)0 5488 y(\014ts)p 127 5488 28 4 v 32 w(read)p 331 5488 V 33 w(record)29 b(routine)h(ma)m(y)g(b)s(e)f(used)f(to)i(set)g (the)g(starting)g(p)s(osition)f(when)g(doing)g(wild)g(card)h(searc)m (hes.)41 b(A)0 5601 y(status)29 b(v)-5 b(alue)30 b(of)f(KEY)p 809 5601 V 32 w(NO)p 980 5601 V 33 w(EXIST)f(is)h(returned)e(if)i(the)g (sp)s(eci\014ed)f(k)m(eyw)m(ord)i(to)f(b)s(e)g(read)f(is)h(not)h(found) d(in)i(the)0 5714 y(header.)p eop end %%Page: 38 46 TeXDict begin 38 45 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.38) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(38)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (subsection.5.4.1) cvn /DEST pdfmark end 0 464 a 91 x Fd(5.4.1)112 b(Keyw)m(ord)38 b(Reading)g (Routines)0 764 y Fi(1)81 b Fj(Return)33 b(the)h(n)m(um)m(b)s(er)e(of)i (existing)h(k)m(eyw)m(ords)g(\(not)f(coun)m(ting)h(the)f(END)g(k)m(eyw) m(ord\))h(and)e(the)h(amoun)m(t)h(of)227 877 y(space)e(curren)m(tly)f (a)m(v)-5 b(ailable)34 b(for)e(more)g(k)m(eyw)m(ords.)46 b(It)32 b(returns)e(morek)m(eys)j(=)f(-1)g(if)g(the)g(header)g(has)g (not)227 990 y(y)m(et)27 b(b)s(een)d(closed.)40 b(Note)26 b(that)g(CFITSIO)d(will)j(dynamically)g(add)e(space)i(if)f(required)f (when)g(writing)h(new)227 1103 y(k)m(eyw)m(ords)32 b(to)g(a)f(header)g (so)h(in)f(practice)h(there)g(is)f(no)g(limit)h(to)g(the)f(n)m(um)m(b)s (er)f(of)i(k)m(eyw)m(ords)f(that)h(can)g(b)s(e)227 1216 y(added)e(to)h(a)f(header.)41 b(A)30 b(n)m(ull)g(p)s(oin)m(ter)h(ma)m (y)f(b)s(e)g(en)m(tered)h(for)f(the)g(morek)m(eys)h(parameter)g(if)f (it's)h(v)-5 b(alue)31 b(is)227 1329 y(not)g(needed.)95 1588 y Fe(int)47 b(fits_get_hdrspace)c(/)48 b(ffghsp)286 1701 y(\(fitsfile)e(*fptr,)g(>)h(int)g(*keysexist,)e(int)i(*morekeys,)e (int)i(*status\))0 1960 y Fi(2)81 b Fj(Return)28 b(the)h(sp)s (eci\014ed)f(k)m(eyw)m(ord.)41 b(In)29 b(the)g(\014rst)f(routine,)i (the)f(datat)m(yp)s(e)h(parameter)g(sp)s(eci\014es)e(the)h(desired)227 2073 y(returned)e(data)h(t)m(yp)s(e)g(of)g(the)g(k)m(eyw)m(ord)h(v)-5 b(alue)28 b(and)f(can)h(ha)m(v)m(e)h(one)f(of)g(the)g(follo)m(wing)h (sym)m(b)s(olic)g(constan)m(t)227 2186 y(v)-5 b(alues:)47 b(TSTRING,)33 b(TLOGICAL)f(\(==)h(in)m(t\),)j(TBYTE,)d(TSHOR)-8 b(T,)33 b(TUSHOR)-8 b(T,)32 b(TINT,)h(TUINT,)227 2298 y(TLONG,)24 b(TULONG,)g(TLONGLONG,)g(TFLO)m(A)-8 b(T,)25 b(TDOUBLE,)f(TCOMPLEX,)f(and)h(TDBLCOM-)227 2411 y(PLEX.)j(Within)f (the)h(con)m(text)h(of)f(this)g(routine,)g(TSTRING)f(corresp)s(onds)f (to)i(a)g('c)m(har*')h(data)f(t)m(yp)s(e,)h(i.e.,)227 2524 y(a)k(p)s(oin)m(ter)g(to)g(a)g(c)m(haracter)i(arra)m(y)-8 b(.)45 b(Data)33 b(t)m(yp)s(e)f(con)m(v)m(ersion)h(will)f(b)s(e)f(p)s (erformed)f(for)i(n)m(umeric)f(v)-5 b(alues)32 b(if)227 2637 y(the)27 b(k)m(eyw)m(ord)g(v)-5 b(alue)27 b(do)s(es)f(not)h(ha)m (v)m(e)h(the)f(same)g(data)g(t)m(yp)s(e.)40 b(If)26 b(the)h(v)-5 b(alue)27 b(of)g(the)f(k)m(eyw)m(ord)i(is)e(unde\014ned)227 2750 y(\(i.e.,)31 b(the)e(v)-5 b(alue)30 b(\014eld)e(is)h(blank\))g (then)f(an)h(error)g(status)g(=)f(V)-10 b(ALUE)p 2627 2750 28 4 v 33 w(UNDEFINED)30 b(will)g(b)s(e)e(returned.)227 2900 y(The)c(second)f(routine)h(returns)f(the)h(k)m(eyw)m(ord)g(v)-5 b(alue)24 b(as)g(a)g(c)m(haracter)i(string)d(\(a)i(literal)g(cop)m(y)g (of)f(what)f(is)h(in)227 3013 y(the)j(v)-5 b(alue)26 b(\014eld\))g(regardless)h(of)f(the)g(in)m(trinsic)h(data)g(t)m(yp)s(e) f(of)g(the)g(k)m(eyw)m(ord.)40 b(The)26 b(third)f(routine)h(returns)227 3126 y(the)45 b(en)m(tire)h(80-c)m(haracter)i(header)c(record)h(of)g (the)g(k)m(eyw)m(ord,)k(with)c(an)m(y)g(trailing)h(blank)e(c)m (haracters)227 3239 y(stripp)s(ed)37 b(o\013.)64 b(The)38 b(fourth)f(routine)h(returns)f(the)h(\(next\))h(header)f(record)g(that) h(con)m(tains)g(the)f(literal)227 3352 y(string)31 b(of)f(c)m (haracters)i(sp)s(eci\014ed)e(b)m(y)g(the)g('string')h(argumen)m(t.)227 3502 y(If)f(a)h(NULL)f(commen)m(t)i(p)s(oin)m(ter)e(is)g(supplied)g (then)g(the)g(commen)m(t)i(string)e(will)h(not)f(b)s(e)g(returned.)95 3761 y Fe(int)47 b(fits_read_key)e(/)i(ffgky)286 3874 y(\(fitsfile)f(*fptr,)g(int)h(datatype,)e(char)i(*keyname,)e(>)i(DTYPE) g(*value,)334 3987 y(char)g(*comment,)e(int)i(*status\))95 4213 y(int)g(fits_read_keyword)c(/)48 b(ffgkey)286 4326 y(\(fitsfile)e(*fptr,)g(char)g(*keyname,)g(>)h(char)g(*value,)f(char)g (*comment,)334 4439 y(int)h(*status\))95 4664 y(int)g(fits_read_card)d (/)k(ffgcrd)286 4777 y(\(fitsfile)e(*fptr,)g(char)g(*keyname,)g(>)h (char)g(*card,)f(int)h(*status\))95 5003 y(int)g(fits_read_str)e(/)i (ffgstr)286 5116 y(\(fitsfile)f(*fptr,)g(char)g(*string,)g(>)h(char)g (*card,)f(int)h(*status\))0 5375 y Fi(3)81 b Fj(Read)22 b(a)g(string-v)-5 b(alued)23 b(k)m(eyw)m(ord)f(and)g(return)e(the)j (string)f(length,)i(the)e(v)-5 b(alue)23 b(string,)h(and/or)e(the)g (commen)m(t)227 5488 y(\014eld.)48 b(The)33 b(\014rst)f(routine,)i (\013gksl,)g(simply)e(returns)g(the)h(length)h(of)f(the)g(c)m(haracter) h(string)f(v)-5 b(alue)34 b(of)f(the)227 5601 y(sp)s(eci\014ed)g(k)m (eyw)m(ord.)50 b(The)32 b(second)i(routine,)g(\013gsky)-8 b(,)35 b(also)f(returns)e(up)g(to)i(maxc)m(har)g(c)m(haracters)g(of)g (the)227 5714 y(k)m(eyw)m(ord)d(v)-5 b(alue)31 b(string,)g(starting)g (with)g(the)f(\014rstc)m(har)g(c)m(haracter,)j(and)d(the)g(k)m(eyw)m (ord)h(commen)m(t)h(string)p eop end %%Page: 39 47 TeXDict begin 39 46 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.39) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.4.)72 b(HEADER)31 b(KEYW)m(ORD)g(READ/WRITE)g(R)m(OUTINES)1495 b Fj(39)227 555 y(\(unless)33 b(the)h(input)e(v)-5 b(alue)34 b(of)g(comm)f(=)g(NULL\).)h(The)f(v)-5 b(aluelen)34 b(argumen)m(t)g (returns)e(the)h(total)j(length)227 668 y(of)c(the)f(k)m(eyw)m(ord)h(v) -5 b(alue)32 b(string)f(regardless)h(of)f(ho)m(w)h(m)m(uc)m(h)f(of)h (the)f(string)g(is)h(actually)h(returned)d(\(whic)m(h)227 781 y(dep)s(ends)25 b(on)i(the)g(v)-5 b(alue)27 b(of)g(the)g(\014rstc)m (har)g(and)f(maxc)m(har)h(argumen)m(ts\).)40 b(Note)29 b(that)e(the)g(v)-5 b(alue)27 b(c)m(haracter)227 894 y(string)33 b(argumen)m(t)h(m)m(ust)f(b)s(e)f(allo)s(cated)j(large)g (enough)e(to)g(also)i(hold)d(the)i(n)m(ull)f(terminator)g(at)h(the)g (end)227 1007 y(of)41 b(the)f(returned)f(string.)69 b(These)40 b(routines)g(supp)s(ort)f(string)h(k)m(eyw)m(ords)g(that)h(use)e(the)i (CONTINUE)227 1120 y(con)m(v)m(en)m(tion)25 b(to)e(con)m(tin)m(ue)g (long)g(string)f(v)-5 b(alues)23 b(o)m(v)m(er)h(m)m(ultiple)f(FITS)e (header)h(records.)38 b(Normally)-8 b(,)26 b(string-)227 1233 y(v)-5 b(alued)40 b(k)m(eyw)m(ords)h(ha)m(v)m(e)g(a)g(maxim)m(um)f (length)h(of)f(68)h(c)m(haracters,)k(ho)m(w)m(ev)m(er,)f(CONTINUE'd)39 b(string)227 1346 y(k)m(eyw)m(ords)31 b(ma)m(y)g(b)s(e)f(arbitrarily)g (long.)95 1630 y Fe(int)47 b(fits_get_key_strlen)c(/)k(ffgksl)286 1742 y(\(fitsfile)f(*fptr,)g(const)g(char)h(*keyname,)e(int)i(*length,) e(int)i(*status\);)95 1968 y(int)g(fits_read_string_key)c(/)k(ffgsky) 334 2081 y(\(fitsfile)e(*fptr,)h(const)h(char)f(*keyname,)g(int)h (firstchar,)e(int)i(maxchar,)334 2194 y(char)g(*value,)f(int)g (*valuelen,)f(char)i(*comm,)f(int)h(*status\);)0 2478 y Fi(4)81 b Fj(Return)38 b(the)h(n)m(th)f(header)h(record)g(in)f(the)i (CHU.)f(The)f(\014rst)g(k)m(eyw)m(ord)i(in)e(the)h(header)g(is)g(at)g (k)m(eyn)m(um)g(=)227 2591 y(1;)53 b(if)45 b(k)m(eyn)m(um)g(=)f(0)h (then)g(these)g(routines)g(simply)f(reset)h(the)h(in)m(ternal)f (CFITSIO)e(p)s(oin)m(ter)i(to)h(the)227 2704 y(b)s(eginning)35 b(of)h(the)g(header)f(so)h(that)g(subsequen)m(t)f(k)m(eyw)m(ord)h(op)s (erations)g(will)g(start)g(at)g(the)g(top)g(of)g(the)227 2817 y(header)26 b(\(e.g.,)j(prior)c(to)h(searc)m(hing)h(for)f(k)m(eyw) m(ords)g(using)f(wild)g(cards)h(in)f(the)h(k)m(eyw)m(ord)h(name\).)39 b(The)26 b(\014rst)227 2930 y(routine)32 b(returns)e(the)i(en)m(tire)h (80-c)m(haracter)h(header)e(record)g(\(with)f(trailing)i(blanks)e (truncated\),)i(while)227 3043 y(the)41 b(second)f(routine)g(parses)g (the)g(record)h(and)e(returns)g(the)i(name,)i(v)-5 b(alue,)43 b(and)d(commen)m(t)h(\014elds)f(as)227 3156 y(separate)32 b(\(blank)f(truncated\))g(c)m(haracter)i(strings.)42 b(If)30 b(a)h(NULL)g(commen)m(t)h(p)s(oin)m(ter)f(is)g(giv)m(en)h(on)f (input,)227 3268 y(then)f(the)h(commen)m(t)g(string)g(will)f(not)h(b)s (e)f(returned.)95 3553 y Fe(int)47 b(fits_read_record)d(/)j(ffgrec)286 3665 y(\(fitsfile)f(*fptr,)g(int)h(keynum,)e(>)j(char)f(*card,)f(int)h (*status\))95 3891 y(int)g(fits_read_keyn)d(/)k(ffgkyn)286 4004 y(\(fitsfile)e(*fptr,)g(int)h(keynum,)e(>)j(char)f(*keyname,)e (char)h(*value,)334 4117 y(char)h(*comment,)e(int)i(*status\))0 4401 y Fi(5)81 b Fj(Return)44 b(the)i(next)g(k)m(eyw)m(ord)g(whose)f (name)h(matc)m(hes)g(one)g(of)g(the)f(strings)h(in)f('inclist')i(but)e (do)s(es)g(not)227 4514 y(matc)m(h)31 b(an)m(y)g(of)g(the)f(strings)g (in)g('exclist'.)43 b(The)30 b(strings)g(in)g(inclist)h(and)f(exclist)i (ma)m(y)e(con)m(tain)i(wild)e(card)227 4627 y(c)m(haracters)k(\(*,)f (?,)f(and)f(#\))h(as)g(describ)s(ed)f(at)i(the)f(b)s(eginning)f(of)h (this)g(section.)46 b(This)31 b(routine)h(searc)m(hes)227 4740 y(from)j(the)g(curren)m(t)g(header)g(p)s(osition)g(to)h(the)f(end) f(of)h(the)h(header,)g(only)-8 b(,)37 b(and)d(do)s(es)h(not)g(con)m (tin)m(ue)i(the)227 4853 y(searc)m(h)32 b(from)e(the)h(top)g(of)g(the)g (header)g(bac)m(k)g(to)h(the)f(original)h(p)s(osition.)42 b(The)31 b(curren)m(t)f(header)h(p)s(osition)227 4966 y(ma)m(y)e(b)s(e)e(reset)h(with)g(the)g(\013grec)g(routine.)40 b(Note)29 b(that)g(nexc)f(ma)m(y)g(b)s(e)f(set)h(=)g(0)g(if)g(there)g (are)g(no)g(k)m(eyw)m(ords)227 5079 y(to)h(b)s(e)f(excluded.)39 b(This)28 b(routine)g(returns)f(status)h(=)g(KEY)p 2268 5079 28 4 v 32 w(NO)p 2439 5079 V 33 w(EXIST)f(if)h(a)h(matc)m(hing)g (k)m(eyw)m(ord)g(is)f(not)227 5191 y(found.)95 5475 y Fe(int)47 b(fits_find_nextkey)c(/)48 b(ffgnxk)286 5588 y(\(fitsfile)e(*fptr,)g(char)g(**inclist,)f(int)i(ninc,)g(char)f (**exclist,)334 5701 y(int)h(nexc,)f(>)i(char)e(*card,)h(int)94 b(*status\))p eop end %%Page: 40 48 TeXDict begin 40 47 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.40) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(40)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 555 y Fi(6)81 b Fj(Return)25 b(the)h(ph)m(ysical)g(units)g(string)g(from)f(an)h(existing)h(k)m(eyw)m (ord.)39 b(This)26 b(routine)g(uses)f(a)h(lo)s(cal)i(con)m(v)m(en)m (tion,)227 668 y(sho)m(wn)d(in)g(the)g(follo)m(wing)i(example,)g(in)e (whic)m(h)g(the)h(k)m(eyw)m(ord)f(units)g(are)h(enclosed)g(in)f(square) g(brac)m(k)m(ets)h(in)227 781 y(the)k(b)s(eginning)f(of)h(the)g(k)m (eyw)m(ord)g(commen)m(t)g(\014eld.)40 b(A)30 b(n)m(ull)g(string)f(is)h (returned)e(if)i(no)f(units)g(are)h(de\014ned)227 894 y(for)g(the)h(k)m(eyw)m(ord.)239 1135 y Fe(VELOCITY=)809 b(12.3)46 b(/)i([km/s])e(orbital)g(speed)95 1361 y(int)h (fits_read_key_unit)c(/)48 b(ffgunt)286 1474 y(\(fitsfile)e(*fptr,)g (char)g(*keyname,)g(>)h(char)g(*unit,)f(int)h(*status\))0 1715 y Fi(7)81 b Fj(Concatenate)39 b(the)f(header)f(k)m(eyw)m(ords)h (in)g(the)f(CHDU)h(in)m(to)h(a)f(single)g(long)g(string)g(of)g(c)m (haracters.)64 b(This)227 1828 y(pro)m(vides)28 b(a)h(con)m(v)m(enien)m (t)h(w)m(a)m(y)f(of)g(passing)f(all)h(or)f(part)g(of)g(the)h(header)f (information)g(in)g(a)h(FITS)e(HDU)i(to)227 1941 y(other)i (subroutines.)39 b(Eac)m(h)31 b(80-c)m(haracter)h(\014xed-length)f(k)m (eyw)m(ord)f(record)g(is)g(app)s(ended)e(to)j(the)f(output)227 2054 y(c)m(haracter)j(string,)f(in)f(order,)g(with)g(no)g(in)m(terv)m (ening)i(separator)f(or)f(terminating)h(c)m(haracters.)45 b(The)31 b(last)227 2167 y(header)e(record)g(is)g(terminated)h(with)f (a)g(NULL)g(c)m(haracter.)42 b(These)29 b(routine)g(allo)s(cates)j (memory)d(for)g(the)227 2279 y(returned)k(c)m(haracter)j(arra)m(y)-8 b(,)37 b(so)d(the)h(calling)h(program)e(m)m(ust)g(free)g(the)h(memory)f (when)f(\014nished.)51 b(The)227 2392 y(cleanest)32 b(w)m(a)m(y)g(to)f (do)f(this)g(is)h(to)g(call)g(the)g(\014ts)p 1823 2392 28 4 v 32 w(free)p 1999 2392 V 33 w(memory)g(routine.)227 2540 y(There)38 b(are)h(2)g(related)g(routines:)57 b(\014ts)p 1581 2540 V 32 w(hdr2str)37 b(simply)h(concatenates)j(all)f(the)e (existing)i(k)m(eyw)m(ords)e(in)227 2652 y(the)44 b(header;)51 b(\014ts)p 863 2652 V 33 w(con)m(v)m(ert)p 1185 2652 V 34 w(hdr2str)43 b(is)h(similar,)k(except)d(that)f(if)g(the)g(CHDU)h (is)f(a)g(tile)h(compressed)227 2765 y(image)c(\(stored)f(in)f(a)h (binary)e(table\))j(then)e(it)h(will)f(\014rst)g(con)m(v)m(ert)i(that)f (header)f(bac)m(k)h(to)g(that)g(of)g(the)227 2878 y(corresp)s(onding)30 b(normal)g(FITS)g(image)h(b)s(efore)f(concatenating)j(the)e(k)m(eyw)m (ords.)227 3025 y(Selected)f(k)m(eyw)m(ords)e(ma)m(y)h(b)s(e)e (excluded)h(from)g(the)g(returned)f(c)m(haracter)j(string.)40 b(If)27 b(the)i(second)f(param-)227 3138 y(eter)h(\(no)s(commen)m(ts\)) g(is)f(TR)m(UE)g(\(nonzero\))h(then)e(an)m(y)i(COMMENT,)f(HISTOR)-8 b(Y,)27 b(or)h(blank)g(k)m(eyw)m(ords)227 3251 y(in)i(the)h(header)f (will)h(not)f(b)s(e)g(copied)h(to)g(the)g(output)f(string.)227 3398 y(The)25 b('exclist')j(parameter)e(ma)m(y)g(b)s(e)f(used)g(to)h (supply)e(a)i(list)h(of)e(k)m(eyw)m(ords)h(that)h(are)f(to)g(b)s(e)f (excluded)g(from)227 3511 y(the)k(output)g(c)m(haracter)h(string.)41 b(Wild)29 b(card)g(c)m(haracters)h(\(*,)g(?,)f(and)g(#\))g(ma)m(y)g(b)s (e)f(used)g(in)h(the)g(excluded)227 3624 y(k)m(eyw)m(ord)h(names.)41 b(If)29 b(no)g(additional)i(k)m(eyw)m(ords)f(are)g(to)g(b)s(e)f (excluded,)h(then)f(set)h(nexc)g(=)f(0)h(and)f(sp)s(ecify)227 3737 y(NULL)i(for)f(the)g(the)h(**exclist)i(parameter.)95 3978 y Fe(int)47 b(fits_hdr2str)e(/)i(ffhdr2str)286 4091 y(\(fitsfile)f(*fptr,)g(int)h(nocomments,)d(char)j(**exclist,)e(int)i (nexc,)286 4204 y(>)h(char)e(**header,)g(int)h(*nkeys,)e(int)i (*status\))95 4430 y(int)g(fits_convert_hdr2str)c(/)k(ffcnvthdr2str)286 4543 y(\(fitsfile)f(*fptr,)g(int)h(nocomments,)d(char)j(**exclist,)e (int)i(nexc,)286 4656 y(>)h(char)e(**header,)g(int)h(*nkeys,)e(int)i (*status\))95 4882 y(int)g(fits_free_memory)d(/)j(fffree)286 4994 y(\(char)g(*header,)e(>)j(int)f(*status\);)0 5232 y SDict begin H.S end 0 5232 a 0 5232 a SDict begin 13.6 H.A end 0 5232 a 0 5232 a SDict begin [/View [/XYZ H.V]/Dest (subsection.5.4.2) cvn /DEST pdfmark end 0 5232 a 163 x Fd(5.4.2)112 b(Keyw)m(ord)38 b(W)-9 b(riting)37 b(Routines)0 5601 y Fi(1)81 b Fj(W)-8 b(rite)32 b(a)g(k)m(eyw)m(ord)g(of)f(the)h (appropriate)f(data)h(t)m(yp)s(e)g(in)m(to)g(the)g(CHU.)f(The)g (\014rst)g(routine)g(simply)g(app)s(ends)227 5714 y(a)j(new)f(k)m(eyw)m (ord)h(whereas)f(the)g(second)h(routine)f(will)h(up)s(date)e(the)i(v)-5 b(alue)33 b(and)g(commen)m(t)h(\014elds)f(of)h(the)p eop end %%Page: 41 49 TeXDict begin 41 48 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.41) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.4.)72 b(HEADER)31 b(KEYW)m(ORD)g(READ/WRITE)g(R)m(OUTINES)1495 b Fj(41)227 555 y(k)m(eyw)m(ord)34 b(if)g(it)g(already)g(exists,)h (otherwise)f(it)g(app)s(ends)e(a)i(new)f(k)m(eyw)m(ord.)51 b(Note)35 b(that)f(the)g(address)e(to)227 668 y(the)37 b(v)-5 b(alue,)38 b(and)d(not)i(the)f(v)-5 b(alue)36 b(itself,)j(m)m(ust)d(b)s(e)f(en)m(tered.)59 b(The)35 b(datat)m(yp)s(e)i(parameter)g(sp)s(eci\014es)f(the)227 781 y(data)25 b(t)m(yp)s(e)f(of)g(the)g(k)m(eyw)m(ord)g(v)-5 b(alue)25 b(with)e(one)h(of)g(the)g(follo)m(wing)i(v)-5 b(alues:)37 b(TSTRING,)23 b(TLOGICAL)g(\(==)227 894 y(in)m(t\),)38 b(TBYTE,)d(TSHOR)-8 b(T,)34 b(TUSHOR)-8 b(T,)35 b(TINT,)f(TUINT,)h (TLONG,)g(TLONGLONG,)g(TULONG,)227 1007 y(TFLO)m(A)-8 b(T,)24 b(TDOUBLE.)f(Within)h(the)f(con)m(text)i(of)f(this)f(routine,)i (TSTRING)d(corresp)s(onds)g(to)i(a)g('c)m(har*')227 1120 y(data)j(t)m(yp)s(e,)h(i.e.,)g(a)f(p)s(oin)m(ter)f(to)i(a)e(c)m (haracter)i(arra)m(y)-8 b(.)41 b(A)26 b(n)m(ull)g(p)s(oin)m(ter)h(ma)m (y)g(b)s(e)e(en)m(tered)i(for)f(the)h(commen)m(t)227 1233 y(parameter)k(in)f(whic)m(h)g(case)i(the)e(k)m(eyw)m(ord)h(commen) m(t)h(\014eld)d(will)i(b)s(e)f(unmo)s(di\014ed)e(or)j(left)g(blank.)95 1515 y Fe(int)47 b(fits_write_key)d(/)k(ffpky)286 1628 y(\(fitsfile)e(*fptr,)g(int)h(datatype,)e(char)i(*keyname,)e(DTYPE)h (*value,)477 1741 y(char)h(*comment,)e(>)j(int)f(*status\))95 1967 y(int)g(fits_update_key)d(/)j(ffuky)286 2080 y(\(fitsfile)f (*fptr,)g(int)h(datatype,)e(char)i(*keyname,)e(DTYPE)h(*value,)477 2193 y(char)h(*comment,)e(>)j(int)f(*status\))0 2475 y Fi(2)81 b Fj(W)-8 b(rite)44 b(a)g(k)m(eyw)m(ord)f(with)g(a)h(n)m(ull) f(or)g(unde\014ned)e(v)-5 b(alue)43 b(\(i.e.,)48 b(the)c(v)-5 b(alue)43 b(\014eld)g(in)g(the)g(k)m(eyw)m(ord)h(is)f(left)227 2588 y(blank\).)70 b(The)40 b(\014rst)f(routine)h(simply)g(app)s(ends)e (a)j(new)e(k)m(eyw)m(ord)i(whereas)f(the)g(second)g(routine)h(will)227 2701 y(up)s(date)27 b(the)h(v)-5 b(alue)29 b(and)e(commen)m(t)i (\014elds)e(of)h(the)g(k)m(eyw)m(ord)g(if)g(it)g(already)h(exists,)g (otherwise)f(it)h(app)s(ends)227 2814 y(a)g(new)g(k)m(eyw)m(ord.)40 b(A)29 b(n)m(ull)g(p)s(oin)m(ter)g(ma)m(y)g(b)s(e)g(en)m(tered)g(for)g (the)g(commen)m(t)g(parameter)h(in)e(whic)m(h)h(case)h(the)227 2927 y(k)m(eyw)m(ord)h(commen)m(t)h(\014eld)d(will)i(b)s(e)f(unmo)s (di\014ed)e(or)j(left)g(blank.)95 3209 y Fe(int)47 b (fits_write_key_null)c(/)k(ffpkyu)286 3322 y(\(fitsfile)f(*fptr,)g (char)g(*keyname,)g(char)g(*comment,)g(>)h(int)g(*status\))95 3548 y(int)g(fits_update_key_null)c(/)k(ffukyu)286 3661 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(char)g(*comment,)g(>)h(int)g (*status\))0 3943 y Fi(3)81 b Fj(W)-8 b(rite)40 b(\(app)s(end\))e(a)h (COMMENT)g(or)g(HISTOR)-8 b(Y)38 b(k)m(eyw)m(ord)i(to)f(the)g(CHU.)h (The)e(commen)m(t)i(or)f(history)227 4056 y(string)31 b(will)f(b)s(e)g(con)m(tin)m(ued)h(o)m(v)m(er)h(m)m(ultiple)f(k)m(eyw)m (ords)g(if)f(it)h(is)f(longer)h(than)f(70)i(c)m(haracters.)95 4338 y Fe(int)47 b(fits_write_comment)c(/)48 b(ffpcom)286 4451 y(\(fitsfile)e(*fptr,)g(char)g(*comment,)g(>)h(int)g(*status\))95 4677 y(int)g(fits_write_history)c(/)48 b(ffphis)286 4790 y(\(fitsfile)e(*fptr,)g(char)g(*history,)g(>)h(int)g(*status\))0 5073 y Fi(4)81 b Fj(W)-8 b(rite)29 b(the)g(D)m(A)-8 b(TE)29 b(k)m(eyw)m(ord)g(to)g(the)g(CHU.)f(The)g(k)m(eyw)m(ord)h(v)-5 b(alue)29 b(will)f(con)m(tain)i(the)f(curren)m(t)f(system)g(date)227 5185 y(as)k(a)g(c)m(haracter)h(string)e(in)g('yyyy-mm-ddThh:mm:ss')e (format.)44 b(If)31 b(a)h(D)m(A)-8 b(TE)32 b(k)m(eyw)m(ord)g(already)g (exists)227 5298 y(in)c(the)f(header,)i(then)e(this)g(routine)h(will)g (simply)f(up)s(date)g(the)h(k)m(eyw)m(ord)g(v)-5 b(alue)28 b(with)f(the)h(curren)m(t)g(date.)95 5581 y Fe(int)47 b(fits_write_date)d(/)j(ffpdat)286 5694 y(\(fitsfile)f(*fptr,)g(>)h (int)g(*status\))p eop end %%Page: 42 50 TeXDict begin 42 49 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.42) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(42)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 555 y Fi(5)81 b Fj(W)-8 b(rite)34 b(a)g(user)f(sp)s(eci\014ed)g(k)m(eyw)m(ord)h(record)f(in)m(to)h(the)g (CHU.)g(This)e(is)i(a)g(lo)m(w{lev)m(el)i(routine)e(whic)m(h)f(can)h(b) s(e)227 668 y(used)f(to)h(write)f(an)m(y)h(arbitrary)f(record)g(in)m (to)i(the)e(header.)50 b(The)32 b(record)i(m)m(ust)f(conform)g(to)h (the)g(all)g(the)227 781 y(FITS)c(format)h(requiremen)m(ts.)95 1034 y Fe(int)47 b(fits_write_record)c(/)48 b(ffprec)286 1147 y(\(fitsfile)e(*fptr,)g(char)g(*card,)g(>)i(int)f(*status\))0 1401 y Fi(6)81 b Fj(Up)s(date)34 b(an)g(80-c)m(haracter)j(record)e(in)f (the)g(CHU.)h(If)f(a)h(k)m(eyw)m(ord)f(with)h(the)f(input)g(name)g (already)h(exists,)227 1514 y(then)e(it)h(is)f(o)m(v)m(erwritten)h(b)m (y)f(the)g(v)-5 b(alue)34 b(of)f(card.)49 b(This)32 b(could)h(mo)s (dify)f(the)i(k)m(eyw)m(ord)f(name)g(as)h(w)m(ell)g(as)227 1627 y(the)c(v)-5 b(alue)30 b(and)e(commen)m(t)j(\014elds.)40 b(If)29 b(the)g(k)m(eyw)m(ord)h(do)s(esn't)f(already)h(exist)g(then)g (a)f(new)g(k)m(eyw)m(ord)h(card)227 1739 y(is)h(app)s(ended)d(to)j(the) g(header.)95 1993 y Fe(int)47 b(fits_update_card)d(/)j(ffucrd)286 2106 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(char)g(*card,)g(>)i (int)f(*status\))0 2359 y Fi(7)81 b Fj(Mo)s(dify)30 b(\(o)m(v)m (erwrite\))i(the)f(commen)m(t)g(\014eld)f(of)h(an)f(existing)h(k)m(eyw) m(ord.)95 2613 y Fe(int)47 b(fits_modify_comment)c(/)k(ffmcom)286 2726 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(char)g(*comment,)g(>)h (int)g(*status\))0 2979 y Fi(8)81 b Fj(W)-8 b(rite)33 b(the)f(ph)m(ysical)h(units)f(string)g(in)m(to)h(an)f(existing)h(k)m (eyw)m(ord.)46 b(This)32 b(routine)g(uses)g(a)g(lo)s(cal)i(con)m(v)m (en)m(tion,)227 3092 y(sho)m(wn)e(in)g(the)h(follo)m(wing)h(example,)g (in)e(whic)m(h)g(the)h(k)m(eyw)m(ord)g(units)f(are)h(enclosed)g(in)f (square)g(brac)m(k)m(ets)227 3205 y(in)e(the)h(b)s(eginning)f(of)g(the) h(k)m(eyw)m(ord)g(commen)m(t)g(\014eld.)239 3458 y Fe(VELOCITY=)809 b(12.3)46 b(/)i([km/s])e(orbital)g(speed)95 3684 y(int)h (fits_write_key_unit)c(/)k(ffpunt)286 3797 y(\(fitsfile)f(*fptr,)g (char)g(*keyname,)g(char)g(*unit,)g(>)i(int)f(*status\))0 4050 y Fi(9)81 b Fj(Rename)30 b(an)h(existing)g(k)m(eyw)m(ord,)g (preserving)f(the)g(curren)m(t)h(v)-5 b(alue)30 b(and)g(commen)m(t)i (\014elds.)95 4304 y Fe(int)47 b(fits_modify_name)d(/)j(ffmnam)286 4417 y(\(fitsfile)f(*fptr,)g(char)g(*oldname,)g(char)g(*newname,)g(>)h (int)g(*status\))0 4670 y Fi(10)f Fj(Delete)37 b(a)e(k)m(eyw)m(ord)g (record.)54 b(The)34 b(space)i(o)s(ccupied)e(b)m(y)h(the)g(k)m(eyw)m (ord)g(is)g(reclaimed)h(b)m(y)e(mo)m(ving)i(all)g(the)227 4783 y(follo)m(wing)e(header)f(records)f(up)g(one)h(ro)m(w)f(in)h(the)f (header.)48 b(The)32 b(\014rst)g(routine)g(deletes)i(a)f(k)m(eyw)m(ord) g(at)h(a)227 4896 y(sp)s(eci\014ed)23 b(p)s(osition)h(in)g(the)g (header)f(\(the)i(\014rst)e(k)m(eyw)m(ord)h(is)g(at)g(p)s(osition)g (1\),)i(whereas)e(the)g(second)g(routine)227 5009 y(deletes)30 b(a)f(sp)s(eci\014cally)g(named)f(k)m(eyw)m(ord.)41 b(Wild)29 b(card)f(c)m(haracters)i(ma)m(y)f(b)s(e)f(used)g(when)f(sp)s(ecifying)i (the)227 5122 y(name)23 b(of)g(the)f(k)m(eyw)m(ord)h(to)h(b)s(e)e (deleted.)38 b(The)22 b(third)g(routine)h(deletes)g(the)g(\(next\))h(k) m(eyw)m(ord)f(that)g(con)m(tains)227 5235 y(the)31 b(literal)h(c)m (haracter)g(string)e(sp)s(eci\014ed)g(b)m(y)g(the)h('string')f(argumen) m(t.)95 5488 y Fe(int)47 b(fits_delete_record)c(/)48 b(ffdrec)286 5601 y(\(fitsfile)e(*fptr,)g(int)142 b(keynum,)94 b(>)47 b(int)g(*status\))p eop end %%Page: 43 51 TeXDict begin 43 50 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.43) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.5.)72 b(PRIMAR)-8 b(Y)31 b(ARRA)-8 b(Y)31 b(OR)f(IMA)m(GE)h(EXTENSION)f(I/O)g (R)m(OUTINES)1011 b Fj(43)95 555 y Fe(int)47 b(fits_delete_key)d(/)j (ffdkey)286 668 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(>)h(int)g (*status\))95 894 y(int)g(fits_delete_str)d(/)j(ffdstr)286 1007 y(\(fitsfile)f(*fptr,)g(char)g(*string,)g(>)h(int)g(*status\))0 1157 y SDict begin H.S end 0 1157 a 0 1157 a SDict begin 13.6 H.A end 0 1157 a 0 1157 a SDict begin [/View [/XYZ H.V]/Dest (section.5.5) cvn /DEST pdfmark end 0 1157 a 177 x Ff(5.5)135 b(Primary)46 b(Arra)l(y)f(or)g(IMA)l(GE)f(Extension)i(I/O) f(Routines)0 1584 y Fj(These)22 b(routines)g(read)h(or)f(write)h(data)g (v)-5 b(alues)23 b(in)f(the)g(primary)g(data)h(arra)m(y)g(\(i.e.,)j (the)c(\014rst)g(HDU)h(in)f(a)h(FITS)e(\014le\))0 1697 y(or)32 b(an)g(IMA)m(GE)h(extension.)47 b(There)31 b(are)i(also)g (routines)f(to)h(get)g(information)f(ab)s(out)g(the)g(data)h(t)m(yp)s (e)g(and)e(size)0 1810 y(of)c(the)g(image.)41 b(Users)27 b(should)f(also)i(read)f(the)g(follo)m(wing)h(c)m(hapter)g(on)f(the)g (CFITSIO)e(iterator)k(function)d(whic)m(h)0 1923 y(pro)m(vides)33 b(a)h(more)f(`ob)5 b(ject)35 b(orien)m(ted')f(metho)s(d)f(of)g(reading) g(and)g(writing)g(images.)51 b(The)32 b(iterator)j(function)e(is)0 2035 y(a)e(little)i(more)e(complicated)h(to)g(use,)f(but)f(the)h(adv)-5 b(an)m(tages)32 b(are)f(that)h(it)f(usually)g(tak)m(es)h(less)f(co)s (de)g(to)g(p)s(erform)0 2148 y(the)37 b(same)f(op)s(eration,)j(and)c (the)i(resulting)f(program)g(often)h(runs)e(faster)i(b)s(ecause)f(the)g (FITS)g(\014les)g(are)h(read)0 2261 y(and)30 b(written)g(using)g(the)h (most)f(e\016cien)m(t)i(blo)s(c)m(k)f(size.)0 2421 y(C)25 b(programmers)h(should)f(note)h(that)g(the)h(ordering)e(of)h(arra)m(ys) g(in)g(FITS)f(\014les,)i(and)e(hence)h(in)g(all)g(the)g(CFITSIO)0 2534 y(calls,)40 b(is)d(more)g(similar)h(to)f(the)h(dimensionalit)m(y)g (of)f(arra)m(ys)g(in)g(F)-8 b(ortran)38 b(rather)f(than)f(C.)h(F)-8 b(or)38 b(instance)g(if)f(a)0 2647 y(FITS)28 b(image)i(has)e(NAXIS1)h (=)f(100)i(and)e(NAXIS2)h(=)f(50,)i(then)e(a)h(2-D)h(arra)m(y)f(just)f (large)i(enough)e(to)i(hold)e(the)0 2760 y(image)k(should)d(b)s(e)h (declared)h(as)f(arra)m(y[50][100])k(and)c(not)h(as)f(arra)m (y[100][50].)0 2920 y(The)h(`datat)m(yp)s(e')h(parameter)g(sp)s (eci\014es)e(the)i(data)g(t)m(yp)s(e)f(of)g(the)g(`n)m(ulv)-5 b(al')32 b(and)f(`arra)m(y')h(p)s(oin)m(ters)f(and)f(can)i(ha)m(v)m(e)0 3033 y(one)h(of)g(the)g(follo)m(wing)h(v)-5 b(alues:)46 b(TBYTE,)33 b(TSBYTE,)f(TSHOR)-8 b(T,)32 b(TUSHOR)-8 b(T,)32 b(TINT,)h(TUINT,)f(TLONG,)0 3146 y(TLONGLONG,)27 b(TULONG,)g(TULONGLONG,)f(TFLO)m(A)-8 b(T,)28 b(TDOUBLE.)f(Automatic)h (data)f(t)m(yp)s(e)g(con)m(v)m(er-)0 3259 y(sion)34 b(is)g(p)s (erformed)f(if)h(the)g(data)h(t)m(yp)s(e)g(of)f(the)g(FITS)g(arra)m(y)g (\(as)h(de\014ned)e(b)m(y)h(the)h(BITPIX)e(k)m(eyw)m(ord\))i(di\013ers) 0 3372 y(from)d(that)i(sp)s(eci\014ed)e(b)m(y)g('datat)m(yp)s(e'.)49 b(The)33 b(data)g(v)-5 b(alues)33 b(are)g(also)h(automatically)i (scaled)d(b)m(y)g(the)g(BSCALE)0 3485 y(and)d(BZER)m(O)g(k)m(eyw)m(ord) h(v)-5 b(alues)31 b(as)f(they)h(are)f(b)s(eing)g(read)h(or)f(written)g (in)h(the)f(FITS)g(arra)m(y)-8 b(.)0 3701 y Fi(1)81 b Fj(Get)33 b(the)f(data)h(t)m(yp)s(e)f(or)g(equiv)-5 b(alen)m(t)34 b(data)f(t)m(yp)s(e)f(of)g(the)h(image.)47 b(The)32 b(\014rst)f (routine)h(returns)f(the)h(ph)m(ysical)227 3814 y(data)46 b(t)m(yp)s(e)f(of)h(the)f(FITS)f(image,)51 b(as)45 b(giv)m(en)h(b)m(y)f (the)g(BITPIX)g(k)m(eyw)m(ord,)50 b(with)44 b(allo)m(w)m(ed)j(v)-5 b(alues)46 b(of)227 3927 y(BYTE)p 492 3927 28 4 v 33 w(IMG)23 b(\(8\),)i(SHOR)-8 b(T)p 1215 3927 V 32 w(IMG)23 b(\(16\),)i(LONG)p 1934 3927 V 33 w(IMG)e(\(32\),)i(LONGLONG)p 2921 3927 V 33 w(IMG)e(\(64\),)i(FLO)m(A)-8 b(T)p 3684 3927 V 33 w(IMG)227 4040 y(\(-32\),)31 b(and)c(DOUBLE)p 1043 4040 V 33 w(IMG)h(\(-64\).)42 b(The)27 b(second)h(routine)f(is)h (similar,)h(except)g(that)f(if)g(the)g(image)h(pixel)227 4153 y(v)-5 b(alues)33 b(are)g(scaled,)g(with)f(non-default)h(v)-5 b(alues)32 b(for)g(the)h(BZER)m(O)f(and)g(BSCALE)f(k)m(eyw)m(ords,)j (then)e(the)227 4266 y(routine)j(will)g(return)e(the)i('equiv)-5 b(alen)m(t')36 b(data)f(t)m(yp)s(e)g(that)g(is)f(needed)h(to)g(store)g (the)g(scaled)g(v)-5 b(alues.)53 b(F)-8 b(or)227 4378 y(example,)29 b(if)e(BITPIX)g(=)g(16)h(and)f(BSCALE)f(=)h(0.1)h(then)f (the)h(equiv)-5 b(alen)m(t)28 b(data)g(t)m(yp)s(e)g(is)f(FLO)m(A)-8 b(T)p 3659 4378 V 33 w(IMG.)227 4491 y(Similarly)25 b(if)f(BITPIX)g(=)g (16,)i(BSCALE)e(=)g(1,)i(and)d(BZER)m(O)h(=)g(32768,)k(then)c(the)g (the)h(pixel)f(v)-5 b(alues)25 b(span)227 4604 y(the)31 b(range)g(of)f(an)g(unsigned)g(short)g(in)m(teger)h(and)f(the)h (returned)e(data)i(t)m(yp)s(e)g(will)f(b)s(e)g(USHOR)-8 b(T)p 3572 4604 V 32 w(IMG.)95 4820 y Fe(int)47 b(fits_get_img_type)c (/)48 b(ffgidt)286 4933 y(\(fitsfile)e(*fptr,)g(>)h(int)g(*bitpix,)f (int)h(*status\))95 5159 y(int)g(fits_get_img_equivtype)42 b(/)48 b(ffgiet)286 5272 y(\(fitsfile)e(*fptr,)g(>)h(int)g(*bitpix,)f (int)h(*status\))0 5488 y Fi(2)81 b Fj(Get)34 b(the)g(n)m(um)m(b)s(er)e (of)i(dimensions,)g(and/or)g(the)g(size)g(of)g(eac)m(h)h(dimension)e (in)g(the)h(image)h(.)50 b(The)33 b(n)m(um)m(b)s(er)227 5601 y(of)h(axes)f(in)g(the)g(image)i(is)e(giv)m(en)h(b)m(y)f(naxis,)h (and)f(the)g(size)h(of)f(eac)m(h)i(dimension)d(is)h(giv)m(en)h(b)m(y)f (the)h(naxes)227 5714 y(arra)m(y)d(\(a)g(maxim)m(um)g(of)f(maxdim)g (dimensions)g(will)g(b)s(e)g(returned\).)p eop end %%Page: 44 52 TeXDict begin 44 51 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.44) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(44)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)95 555 y Fe(int)47 b(fits_get_img_dim)d(/)j (ffgidm)286 668 y(\(fitsfile)f(*fptr,)g(>)h(int)g(*naxis,)f(int)h (*status\))95 894 y(int)g(fits_get_img_size)c(/)48 b(ffgisz)286 1007 y(\(fitsfile)e(*fptr,)g(int)h(maxdim,)e(>)j(long)f(*naxes,)e(int)i (*status\))95 1233 y(int)g(fits_get_img_sizell)c(/)k(ffgiszll)286 1346 y(\(fitsfile)f(*fptr,)g(int)h(maxdim,)e(>)j(LONGLONG)d(*naxes,)h (int)h(*status\))95 1571 y(int)g(fits_get_img_param)c(/)48 b(ffgipr)286 1684 y(\(fitsfile)e(*fptr,)g(int)h(maxdim,)e(>)j(int)f (*bitpix,)e(int)i(*naxis,)f(long)h(*naxes,)334 1797 y(int)g(*status\)) 95 2023 y(int)g(fits_get_img_paramll)c(/)k(ffgiprll)286 2136 y(\(fitsfile)f(*fptr,)g(int)h(maxdim,)e(>)j(int)f(*bitpix,)e(int)i (*naxis,)f(LONGLONG)g(*naxes,)334 2249 y(int)h(*status\))0 2504 y Fi(3)81 b Fj(Create)23 b(a)f(new)g(primary)f(arra)m(y)i(or)f (IMA)m(GE)i(extension)e(with)g(a)h(sp)s(eci\014ed)f(data)h(t)m(yp)s(e)f (and)g(size.)38 b(If)22 b(the)h(FITS)227 2617 y(\014le)30 b(is)g(curren)m(tly)f(empt)m(y)h(then)g(a)g(primary)f(arra)m(y)h(is)g (created,)h(otherwise)f(a)g(new)f(IMA)m(GE)i(extension)f(is)227 2730 y(app)s(ended)f(to)i(the)g(\014le.)95 2985 y Fe(int)47 b(fits_create_img)d(/)j(ffcrim)286 3098 y(\()h(fitsfile)d(*fptr,)h(int) h(bitpix,)f(int)h(naxis,)f(long)h(*naxes,)f(>)h(int)g(*status\))95 3324 y(int)g(fits_create_imgll)c(/)48 b(ffcrimll)286 3437 y(\()g(fitsfile)d(*fptr,)h(int)h(bitpix,)f(int)h(naxis,)f (LONGLONG)g(*naxes,)g(>)h(int)g(*status\))0 3692 y Fi(4)81 b Fj(Cop)m(y)39 b(an)f(n-dimensional)h(image)h(in)f(a)g(particular)h (ro)m(w)f(and)f(column)h(of)g(a)g(binary)f(table)i(\(in)f(a)g(v)m (ector)227 3805 y(column\))31 b(to)g(or)f(from)g(a)h(primary)e(arra)m (y)i(or)g(image)g(extension.)227 3954 y(The)c('cell2image')k(routine)d (will)g(app)s(end)e(a)i(new)f(image)i(extension)f(\(or)g(primary)f (arra)m(y\))h(to)h(the)e(output)227 4067 y(\014le.)43 b(An)m(y)31 b(W)m(CS)g(k)m(eyw)m(ords)g(asso)s(ciated)h(with)f(the)g (input)f(column)h(image)h(will)f(b)s(e)f(translated)i(in)m(to)g(the)227 4180 y(appropriate)j(form)g(for)g(an)f(image)j(extension.)55 b(An)m(y)35 b(other)g(k)m(eyw)m(ords)g(in)g(the)g(table)h(header)f (that)h(are)227 4293 y(not)28 b(sp)s(eci\014cally)h(related)f(to)h (de\014ning)e(the)g(binary)g(table)i(structure)e(or)h(to)g(other)g (columns)g(in)f(the)h(table)227 4406 y(will)j(also)g(b)s(e)f(copied)h (to)g(the)g(header)f(of)g(the)h(output)f(image.)227 4555 y(The)i('image2cell')k(routine)c(will)h(cop)m(y)g(the)g(input)e(image)j (in)m(to)f(the)g(sp)s(eci\014ed)f(ro)m(w)g(and)g(column)g(of)h(the)227 4668 y(curren)m(t)e(binary)g(table)h(in)f(the)h(output)f(\014le.)44 b(The)31 b(binary)f(table)j(HDU)f(m)m(ust)f(exist)h(b)s(efore)f (calling)i(this)227 4781 y(routine,)h(but)f(it)h(ma)m(y)f(b)s(e)g(empt) m(y)-8 b(,)35 b(with)e(no)g(ro)m(ws)g(or)g(columns)g(of)g(data.)50 b(The)33 b(sp)s(eci\014ed)f(column)h(\(and)227 4894 y(ro)m(w\))e(will)h (b)s(e)e(created)h(if)g(it)g(do)s(es)g(not)g(already)g(exist.)43 b(The)30 b('cop)m(yk)m(ey\015ag')j(parameter)e(con)m(trols)h(whic)m(h) 227 5007 y(k)m(eyw)m(ords)26 b(are)g(copied)g(from)f(the)g(input)g (image)h(to)g(the)g(header)f(of)h(the)f(output)g(table:)39 b(0)26 b(=)f(no)h(k)m(eyw)m(ords)227 5120 y(will)k(b)s(e)g(copied,)g(1) h(=)e(all)i(k)m(eyw)m(ords)f(will)g(b)s(e)f(copied)h(\(except)i(those)e (k)m(eyw)m(ords)g(that)h(w)m(ould)e(b)s(e)g(in)m(v)-5 b(alid)227 5233 y(in)30 b(the)h(table)g(header\),)g(and)f(2)g(=)g(cop)m (y)i(only)e(the)h(W)m(CS)f(k)m(eyw)m(ords.)95 5488 y Fe(int)47 b(fits_copy_cell2image)286 5601 y(\(fitsfile)f(*infptr,)f (fitsfile)h(*outfptr,)f(char)i(*colname,)e(long)i(rownum,)334 5714 y(>)h(int)e(*status\))p eop end %%Page: 45 53 TeXDict begin 45 52 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.45) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.5.)72 b(PRIMAR)-8 b(Y)31 b(ARRA)-8 b(Y)31 b(OR)f(IMA)m(GE)h(EXTENSION)f(I/O)g (R)m(OUTINES)1011 b Fj(45)95 668 y Fe(int)47 b(fits_copy_image2cell)286 781 y(\(fitsfile)f(*infptr,)f(fitsfile)h(*outfptr,)f(char)i(*colname,)e (long)i(rownum,)334 894 y(int)g(copykeyflag)e(>)i(int)g(*status\))0 1135 y Fi(5)81 b Fj(W)-8 b(rite)40 b(a)f(rectangular)g(subimage)g(\(or) g(the)g(whole)g(image\))h(to)f(the)g(FITS)f(data)h(arra)m(y)-8 b(.)67 b(The)38 b(fpixel)h(and)227 1248 y(lpixel)30 b(arra)m(ys)g(giv)m (e)h(the)f(co)s(ordinates)g(of)f(the)h(\014rst)f(\(lo)m(w)m(er)i(left)f (corner\))g(and)f(last)h(\(upp)s(er)e(righ)m(t)i(corner\))227 1361 y(pixels)h(in)f(FITS)g(image)h(to)g(b)s(e)f(written)g(to.)95 1602 y Fe(int)47 b(fits_write_subset)c(/)48 b(ffpss)286 1715 y(\(fitsfile)e(*fptr,)g(int)h(datatype,)e(long)i(*fpixel,)e(long)i (*lpixel,)334 1828 y(DTYPE)f(*array,)g(>)i(int)f(*status\))0 2070 y Fi(6)81 b Fj(W)-8 b(rite)39 b(pixels)g(in)m(to)g(the)g(FITS)f (data)h(arra)m(y)-8 b(.)66 b('fpixel')39 b(is)f(an)g(arra)m(y)h(of)g (length)g(NAXIS)f(whic)m(h)g(giv)m(es)i(the)227 2183 y(co)s(ordinate)k(of)f(the)g(starting)g(pixel)g(to)h(b)s(e)e(written)h (to,)j(suc)m(h)d(that)g(fpixel[0])h(is)f(in)f(the)h(range)g(1)g(to)227 2295 y(NAXIS1,)34 b(fpixel[1])f(is)g(in)f(the)g(range)h(1)g(to)g (NAXIS2,)g(etc.)48 b(The)32 b(\014rst)g(pair)g(of)h(routines)f(simply)g (writes)227 2408 y(the)40 b(arra)m(y)g(of)g(pixels)f(to)i(the)e(FITS)g (\014le)h(\(doing)g(data)g(t)m(yp)s(e)g(con)m(v)m(ersion)h(if)e (necessary\))h(whereas)g(the)227 2521 y(second)c(routines)g(will)g (substitute)f(the)h(appropriate)g(FITS)f(n)m(ull)g(v)-5 b(alue)37 b(for)e(an)m(y)h(elemen)m(ts)h(whic)m(h)f(are)227 2634 y(equal)41 b(to)g(the)f(input)g(v)-5 b(alue)40 b(of)h(n)m(ulv)-5 b(al)40 b(\(note)h(that)g(this)f(parameter)h(giv)m(es)h(the)e(address)f (of)i(the)f(n)m(ull)227 2747 y(v)-5 b(alue,)36 b(not)f(the)f(n)m(ull)g (v)-5 b(alue)35 b(itself)7 b(\).)53 b(F)-8 b(or)35 b(in)m(teger)h(FITS) d(arra)m(ys,)j(the)f(FITS)e(n)m(ull)h(v)-5 b(alue)35 b(is)f(de\014ned)f(b)m(y)227 2860 y(the)26 b(BLANK)f(k)m(eyw)m(ord)h (\(an)g(error)f(is)g(returned)f(if)i(the)f(BLANK)h(k)m(eyw)m(ord)g(do)s (esn't)f(exist\).)40 b(F)-8 b(or)26 b(\015oating)227 2973 y(p)s(oin)m(t)g(FITS)f(arra)m(ys)h(the)g(sp)s(ecial)g(IEEE)f(NaN)i (\(Not-a-Num)m(b)s(er\))g(v)-5 b(alue)26 b(will)g(b)s(e)f(written)h(in) m(to)h(the)f(FITS)227 3086 y(\014le.)66 b(If)38 b(a)h(n)m(ull)f(p)s (oin)m(ter)h(is)f(en)m(tered)h(for)g(n)m(ulv)-5 b(al,)41 b(then)d(the)h(n)m(ull)f(v)-5 b(alue)39 b(is)g(ignored)g(and)e(this)i (routine)227 3199 y(b)s(eha)m(v)m(es)31 b(the)g(same)g(as)f(\014ts)p 1189 3199 28 4 v 33 w(write)p 1424 3199 V 33 w(pix.)95 3440 y Fe(int)47 b(fits_write_pix)d(/)k(ffppx)286 3553 y(\(fitsfile)e(*fptr,)g(int)h(datatype,)e(long)i(*fpixel,)e(LONGLONG)h (nelements,)334 3666 y(DTYPE)g(*array,)g(int)h(*status\);)95 3892 y(int)g(fits_write_pixll)d(/)j(ffppxll)286 4005 y(\(fitsfile)f(*fptr,)g(int)h(datatype,)e(LONGLONG)g(*fpixel,)h (LONGLONG)g(nelements,)334 4118 y(DTYPE)g(*array,)g(int)h(*status\);)95 4343 y(int)g(fits_write_pixnull)c(/)48 b(ffppxn)286 4456 y(\(fitsfile)e(*fptr,)g(int)h(datatype,)e(long)i(*fpixel,)e(LONGLONG)h (nelements,)334 4569 y(DTYPE)g(*array,)g(DTYPE)h(*nulval,)e(>)j(int)f (*status\);)95 4795 y(int)g(fits_write_pixnullll)c(/)k(ffppxnll)286 4908 y(\(fitsfile)f(*fptr,)g(int)h(datatype,)e(LONGLONG)g(*fpixel,)h (LONGLONG)g(nelements,)334 5021 y(DTYPE)g(*array,)g(DTYPE)h(*nulval,)e (>)j(int)f(*status\);)0 5262 y Fi(7)81 b Fj(Set)24 b(FITS)g(data)i (arra)m(y)f(elemen)m(ts)h(equal)f(to)g(the)g(appropriate)f(n)m(ull)h (pixel)g(v)-5 b(alue.)39 b(F)-8 b(or)25 b(in)m(teger)h(FITS)e(arra)m (ys,)227 5375 y(the)34 b(FITS)e(n)m(ull)h(v)-5 b(alue)34 b(is)f(de\014ned)f(b)m(y)h(the)h(BLANK)f(k)m(eyw)m(ord)h(\(an)f(error)g (is)g(returned)f(if)h(the)h(BLANK)227 5488 y(k)m(eyw)m(ord)23 b(do)s(esn't)g(exist\).)39 b(F)-8 b(or)23 b(\015oating)g(p)s(oin)m(t)g (FITS)f(arra)m(ys)g(the)h(sp)s(ecial)g(IEEE)f(NaN)h(\(Not-a-Num)m(b)s (er\))227 5601 y(v)-5 b(alue)34 b(will)f(b)s(e)g(written)g(in)m(to)h (the)g(FITS)e(\014le.)49 b(Note)34 b(that)g('\014rstelem')g(is)f(a)h (scalar)g(giving)g(the)f(o\013set)h(to)227 5714 y(the)d(\014rst)e (pixel)i(to)g(b)s(e)f(written)g(in)h(the)f(equiv)-5 b(alen)m(t)32 b(1-dimensional)f(arra)m(y)g(of)g(image)g(pixels.)p eop end %%Page: 46 54 TeXDict begin 46 53 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.46) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(46)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)95 555 y Fe(int)47 b(fits_write_null_img)c(/) k(ffpprn)286 668 y(\(fitsfile)f(*fptr,)g(LONGLONG)f(firstelem,)g (LONGLONG)h(nelements,)f(>)i(int)g(*status\))0 925 y Fi(8)81 b Fj(Read)33 b(a)h(rectangular)h(subimage)f(\(or)g(the)g(whole) g(image\))h(from)e(the)h(FITS)f(data)h(arra)m(y)-8 b(.)52 b(The)33 b(fpixel)h(and)227 1038 y(lpixel)c(arra)m(ys)g(giv)m(e)h(the)f (co)s(ordinates)g(of)f(the)h(\014rst)f(\(lo)m(w)m(er)i(left)f(corner\)) g(and)f(last)h(\(upp)s(er)e(righ)m(t)i(corner\))227 1151 y(pixels)d(to)h(b)s(e)e(read)h(from)g(the)g(FITS)f(image.)41 b(Unde\014ned)25 b(FITS)h(arra)m(y)i(elemen)m(ts)g(will)f(b)s(e)f (returned)g(with)227 1263 y(a)k(v)-5 b(alue)30 b(=)e(*n)m(ullv)-5 b(al,)31 b(\(note)f(that)g(this)f(parameter)h(giv)m(es)g(the)g(address) e(of)h(the)h(n)m(ull)f(v)-5 b(alue,)30 b(not)g(the)f(n)m(ull)227 1376 y(v)-5 b(alue)36 b(itself)7 b(\))37 b(unless)e(n)m(ulv)-5 b(al)36 b(=)g(0)g(or)f(*n)m(ulv)-5 b(al)37 b(=)e(0,)j(in)d(whic)m(h)g (case)i(no)f(c)m(hec)m(ks)h(for)e(unde\014ned)f(pixels)227 1489 y(will)d(b)s(e)f(p)s(erformed.)95 1746 y Fe(int)47 b(fits_read_subset)d(/)j(ffgsv)286 1859 y(\(fitsfile)f(*fptr,)g(int)94 b(datatype,)46 b(long)g(*fpixel,)g(long)g(*lpixel,)g(long)h(*inc,)334 1972 y(DTYPE)f(*nulval,)g(>)h(DTYPE)g(*array,)f(int)h(*anynul,)e(int)i (*status\))0 2228 y Fi(9)81 b Fj(Read)32 b(pixels)h(from)f(the)g(FITS)g (data)h(arra)m(y)-8 b(.)48 b('fpixel')33 b(is)g(the)f(starting)h(pixel) g(lo)s(cation)h(and)e(is)h(an)f(arra)m(y)h(of)227 2341 y(length)h(NAXIS)f(suc)m(h)g(that)h(fpixel[0])g(is)f(in)g(the)h(range)f (1)h(to)g(NAXIS1,)g(fpixel[1])g(is)g(in)f(the)g(range)h(1)f(to)227 2454 y(NAXIS2,)c(etc.)41 b(The)28 b(nelemen)m(ts)h(parameter)f(sp)s (eci\014es)g(the)g(n)m(um)m(b)s(er)f(of)h(pixels)h(to)g(read.)39 b(If)28 b(fpixel)g(is)g(set)227 2567 y(to)36 b(the)f(\014rst)f(pixel,)j (and)e(nelemen)m(ts)g(is)g(set)h(equal)g(to)f(the)g(NAXIS1)h(v)-5 b(alue,)37 b(then)d(this)h(routine)g(w)m(ould)227 2680 y(read)28 b(the)g(\014rst)f(ro)m(w)h(of)g(the)h(image.)41 b(Alternativ)m(ely)-8 b(,)31 b(if)d(nelemen)m(ts)h(is)f(set)g(equal)h (to)f(NAXIS1)g(*)h(NAXIS2)227 2793 y(then)h(it)h(w)m(ould)f(read)h(an)f (en)m(tire)h(2D)g(image,)h(or)f(the)f(\014rst)g(plane)g(of)h(a)g(3-D)g (datacub)s(e.)227 2943 y(The)38 b(\014rst)g(2)h(routines)f(will)h (return)f(an)m(y)h(unde\014ned)d(pixels)j(in)f(the)h(FITS)e(arra)m(y)i (equal)g(to)h(the)e(v)-5 b(alue)227 3055 y(of)36 b(*n)m(ullv)-5 b(al)36 b(\(note)g(that)g(this)f(parameter)h(giv)m(es)g(the)g(address)e (of)i(the)f(n)m(ull)g(v)-5 b(alue,)37 b(not)f(the)f(n)m(ull)g(v)-5 b(alue)227 3168 y(itself)7 b(\))34 b(unless)d(n)m(ulv)-5 b(al)32 b(=)g(0)g(or)h(*n)m(ulv)-5 b(al)32 b(=)g(0,)h(in)f(whic)m(h)g (case)h(no)f(c)m(hec)m(ks)h(for)f(unde\014ned)e(pixels)i(will)h(b)s(e) 227 3281 y(p)s(erformed.)42 b(The)31 b(second)h(2)f(routines)h(are)f (similar)h(except)g(that)g(an)m(y)g(unde\014ned)d(pixels)i(will)h(ha)m (v)m(e)h(the)227 3394 y(corresp)s(onding)d(n)m(ullarra)m(y)g(elemen)m (t)i(set)f(equal)g(to)g(TR)m(UE)g(\(=)f(1\).)95 3651 y Fe(int)47 b(fits_read_pix)e(/)i(ffgpxv)286 3764 y(\(fitsfile)f (*fptr,)g(int)94 b(datatype,)46 b(long)g(*fpixel,)g(LONGLONG)f (nelements,)334 3877 y(DTYPE)h(*nulval,)g(>)h(DTYPE)g(*array,)f(int)h (*anynul,)e(int)i(*status\))95 4102 y(int)g(fits_read_pixll)d(/)j (ffgpxvll)286 4215 y(\(fitsfile)f(*fptr,)g(int)94 b(datatype,)46 b(LONGLONG)f(*fpixel,)h(LONGLONG)f(nelements,)334 4328 y(DTYPE)h(*nulval,)g(>)h(DTYPE)g(*array,)f(int)h(*anynul,)e(int)i (*status\))95 4554 y(int)g(fits_read_pixnull)c(/)48 b(ffgpxf)286 4667 y(\(fitsfile)e(*fptr,)g(int)94 b(datatype,)46 b(long)g(*fpixel,)g (LONGLONG)f(nelements,)334 4780 y(>)j(DTYPE)e(*array,)g(char)g (*nullarray,)f(int)i(*anynul,)f(int)g(*status\))95 5006 y(int)h(fits_read_pixnullll)c(/)k(ffgpxfll)286 5119 y(\(fitsfile)f (*fptr,)g(int)94 b(datatype,)46 b(LONGLONG)f(*fpixel,)h(LONGLONG)f (nelements,)334 5231 y(>)j(DTYPE)e(*array,)g(char)g(*nullarray,)f(int)i (*anynul,)f(int)g(*status\))0 5488 y Fi(10)g Fj(Cop)m(y)36 b(a)g(rectangular)h(section)g(of)g(an)e(image)j(and)d(write)h(it)h(to)f (a)h(new)e(FITS)g(primary)g(image)j(or)e(image)227 5601 y(extension.)49 b(The)32 b(new)g(image)i(HDU)g(is)e(app)s(ended)f(to)j (the)f(end)f(of)h(the)g(output)f(\014le;)i(all)g(the)f(k)m(eyw)m(ords) 227 5714 y(in)39 b(the)f(input)g(image)i(will)f(b)s(e)f(copied)h(to)g (the)g(output)f(image.)66 b(The)38 b(common)h(W)m(CS)g(k)m(eyw)m(ords)g (will)p eop end %%Page: 47 55 TeXDict begin 47 54 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.47) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.6.)72 b(IMA)m(GE)31 b(COMPRESSION)2567 b Fj(47)227 555 y(b)s(e)34 b(up)s(dated)f(if)i(necessary)g(to)g(corresp)s(ond)e(to)j(the)e(co)s (ordinates)h(of)g(the)g(section.)54 b(The)34 b(format)h(of)g(the)227 668 y(section)29 b(expression)e(is)g(same)g(as)h(sp)s(ecifying)f(an)g (image)h(section)h(using)d(the)i(extended)f(\014le)g(name)g(syn)m(tax) 227 781 y(\(see)32 b("Image)f(Section")h(in)e(Chapter)g(10\).)42 b(\(Examples:)f("1:100,1:200",)36 b("1:100:2,)d(1:*:2",)g("*,)f(-*"\).) 95 996 y Fe(int)47 b(fits_copy_image_section)42 b(/)47 b(ffcpimg)286 1109 y(\(fitsfile)f(*infptr,)f(fitsfile)h(*outfptr,)f (char)i(*section,)e(int)i(*status\))0 1259 y SDict begin H.S end 0 1259 a 0 1259 a SDict begin 13.6 H.A end 0 1259 a 0 1259 a SDict begin [/View [/XYZ H.V]/Dest (section.5.6) cvn /DEST pdfmark end 0 1259 a 177 x Ff(5.6)135 b(Image)46 b(Compression)0 1686 y Fj(CFITSIO)29 b(transparen)m(tly)h (supp)s(orts)f(the)h(2)h(metho)s(ds)f(of)g(image)i(compression)e (describ)s(ed)g(b)s(elo)m(w.)0 1846 y(1\))45 b(The)f(en)m(tire)i(FITS)e (\014le)h(ma)m(y)g(b)s(e)f(externally)i(compressed)e(with)g(the)h(gzip) g(or)g(Unix)f(compress)h(utilit)m(y)0 1959 y(programs,)37 b(pro)s(ducing)d(a)j(*.gz)g(or)f(*.Z)g(\014le,)h(resp)s(ectiv)m(ely)-8 b(.)59 b(When)36 b(reading)g(compressed)f(\014les)h(of)g(this)g(t)m(yp) s(e,)0 2072 y(CFITSIO)43 b(\014rst)h(uncompresses)f(the)i(en)m(tire)g (\014le)g(in)m(to)g(memory)g(b)s(efore)f(p)s(erforming)f(the)i (requested)f(read)0 2185 y(op)s(erations.)c(Output)28 b(\014les)g(can)h(b)s(e)f(directly)i(written)e(in)g(the)h(gzip)g (compressed)g(format)g(if)f(the)h(user-sp)s(eci\014ed)0 2298 y(\014lename)35 b(ends)e(with)i(`.gz'.)54 b(In)34 b(this)g(case,)j(CFITSIO)c(initially)j(writes)e(the)h(uncompressed)e (\014le)i(in)f(memory)0 2411 y(and)j(then)g(compresses)g(it)h(and)f (writes)g(it)h(to)g(disk)f(when)f(the)i(FITS)f(\014le)g(is)g(closed,)k (th)m(us)36 b(sa)m(ving)j(user)d(disk)0 2524 y(space.)59 b(Read)36 b(and)g(write)h(access)g(to)g(these)g(compressed)f(FITS)g (\014les)g(is)g(generally)i(quite)e(fast)h(since)g(all)g(the)0 2636 y(I/O)28 b(is)g(p)s(erformed)e(in)i(memory;)h(the)f(main)g (limitation)i(with)e(this)f(tec)m(hnique)i(is)f(that)h(there)f(m)m(ust) g(b)s(e)f(enough)0 2749 y(a)m(v)-5 b(ailable)33 b(memory)d(\(or)h(sw)m (ap)f(space\))h(to)g(hold)f(the)h(en)m(tire)g(uncompressed)e(FITS)h (\014le.)0 2910 y(2\))42 b(CFITSIO)d(also)j(supp)s(orts)d(the)j(FITS)e (tiled)h(image)i(compression)e(con)m(v)m(en)m(tion)i(in)e(whic)m(h)f (the)i(image)g(is)0 3022 y(sub)s(divided)30 b(in)m(to)j(a)f(grid)g(of)g (rectangular)i(tiles,)f(and)f(eac)m(h)h(tile)g(of)g(pixels)f(is)g (individually)g(compressed.)45 b(The)0 3135 y(details)c(of)f(this)g (FITS)g(compression)g(con)m(v)m(en)m(tion)i(are)e(describ)s(ed)f(at)i (the)g(FITS)e(Supp)s(ort)f(O\016ce)i(w)m(eb)g(site)0 3248 y(at)c(h)m(ttp://\014ts.gsfc.nasa.go)m(v/\014ts)p 1230 3248 28 4 v 37 w(registry)-8 b(.h)m(tml,)38 b(and)d(in)g(the)g (fpac)m(kguide)h(p)s(df)e(\014le)h(that)h(is)g(included)e(with)0 3361 y(the)h(CFITSIO)f(source)h(\014le)h(distributions)e(Basically)-8 b(,)39 b(the)c(compressed)g(image)i(tiles)f(are)g(stored)f(in)g(ro)m (ws)g(of)0 3474 y(a)42 b(v)-5 b(ariable)42 b(length)g(arra)m(y)h (column)e(in)g(a)h(FITS)f(binary)g(table,)46 b(ho)m(w)m(ev)m(er)c (CFITSIO)f(recognizes)i(that)f(this)0 3587 y(binary)37 b(table)i(extension)f(con)m(tains)h(an)e(image)i(and)e(treats)i(it)f (as)g(if)g(it)g(w)m(ere)g(an)g(IMA)m(GE)g(extension.)64 b(This)0 3700 y(tile-compressed)37 b(format)f(is)f(esp)s(ecially)i(w)m (ell)g(suited)e(for)h(compressing)f(v)m(ery)h(large)h(images)g(b)s (ecause)e(a\))i(the)0 3813 y(FITS)28 b(header)h(k)m(eyw)m(ords)h (remain)f(uncompressed)e(for)i(rapid)g(read)g(access,)h(and)f(b)s (ecause)g(b\))g(it)g(is)h(p)s(ossible)e(to)0 3926 y(extract)f(and)e (uncompress)g(sections)i(of)f(the)g(image)h(without)e(ha)m(ving)i(to)f (uncompress)f(the)h(en)m(tire)g(image.)41 b(This)0 4039 y(format)34 b(is)g(also)h(m)m(uc)m(h)e(more)h(e\013ectiv)m(e)j(in)c (compressing)h(\015oating)h(p)s(oin)m(t)e(images)i(than)f(simply)f (compressing)0 4152 y(the)39 b(image)i(using)d(gzip)i(or)f(compress)g (b)s(ecause)g(it)h(appro)m(ximates)g(the)g(\015oating)g(p)s(oin)m(t)f (v)-5 b(alues)39 b(with)g(scaled)0 4264 y(in)m(tegers)32 b(whic)m(h)e(can)g(then)g(b)s(e)g(compressed)g(more)h(e\016cien)m(tly) -8 b(.)0 4425 y(Curren)m(tly)41 b(CFITSIO)e(supp)s(orts)h(3)h(general)i (purp)s(ose)c(compression)i(algorithms)i(plus)d(one)i(other)f(sp)s (ecial-)0 4538 y(purp)s(ose)31 b(compression)i(tec)m(hnique)h(that)f (is)g(designed)g(for)g(data)g(masks)g(with)g(p)s(ositiv)m(e)h(in)m (teger)g(pixel)f(v)-5 b(alues.)0 4650 y(The)40 b(3)g(general)h(purp)s (ose)e(algorithms)i(are)f(GZIP)-8 b(,)41 b(Rice,)j(and)39 b(HCOMPRESS,)g(and)h(the)g(sp)s(ecial)h(purp)s(ose)0 4763 y(algorithm)33 b(is)f(the)g(IRAF)g(pixel)g(list)h(compression)f (tec)m(hnique)g(\(PLIO\).)g(There)g(are)g(2)g(v)-5 b(arian)m(ts)33 b(of)f(the)g(GZIP)0 4876 y(algorithm:)46 b(GZIP)p 681 4876 V 33 w(1)33 b(compresses)f(the)h(arra)m(y)g(of)g(image)h(pixel)f (v)-5 b(alue)33 b(normally)g(with)g(the)f(GZIP)h(algorithm,)0 4989 y(while)26 b(GZIP)p 460 4989 V 32 w(2)g(\014rst)f(sh)m(u\017es)g (the)g(b)m(ytes)i(in)e(all)h(the)g(pixel)g(v)-5 b(alues)26 b(so)g(that)g(the)g(most-signi\014can)m(t)h(b)m(yte)f(of)g(ev)m(ery)0 5102 y(pixel)h(app)s(ears)e(\014rst,)i(follo)m(w)m(ed)h(b)m(y)e(the)g (less)h(signi\014can)m(t)g(b)m(ytes)g(in)f(sequence.)39 b(GZIP)p 2944 5102 V 33 w(2)26 b(ma)m(y)h(b)s(e)f(more)g(e\013ectiv)m (e)0 5215 y(in)36 b(cases)h(where)e(the)h(most)h(signi\014can)m(t)f(b)m (yte)h(in)f(most)g(of)g(the)g(image)i(pixel)e(v)-5 b(alues)36 b(con)m(tains)h(the)g(same)f(bit)0 5328 y(pattern.)41 b(In)29 b(principle,)h(an)m(y)g(n)m(um)m(b)s(er)f(of)h(other)g (compression)g(algorithms)h(could)f(also)h(b)s(e)e(supp)s(orted)f(b)m (y)i(the)0 5441 y(FITS)g(tiled)h(image)g(compression)g(con)m(v)m(en)m (tion.)0 5601 y(The)k(FITS)g(image)h(can)g(b)s(e)f(sub)s(divided)e(in)m (to)k(an)m(y)f(desired)f(rectangular)h(grid)f(of)h(compression)f (tiles.)57 b(With)0 5714 y(the)32 b(GZIP)-8 b(,)33 b(Rice,)h(and)e (PLIO)f(algorithms,)j(the)e(default)h(is)f(to)h(tak)m(e)h(eac)m(h)g(ro) m(w)e(of)h(the)f(image)i(as)e(a)h(tile.)47 b(The)p eop end %%Page: 48 56 TeXDict begin 48 55 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.48) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(48)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 555 y Fj(HCOMPRESS)25 b(algorithm)i(is)g (inheren)m(tly)f(2-dimensional)h(in)f(nature,)i(so)e(the)h(default)f (in)g(this)g(case)i(is)e(to)h(tak)m(e)0 668 y(16)h(ro)m(ws)g(of)f(the)h (image)h(p)s(er)d(tile.)41 b(In)27 b(most)h(cases)g(it)g(mak)m(es)h (little)g(di\013erence)f(what)f(tiling)i(pattern)f(is)f(used,)h(so)0 781 y(the)33 b(default)g(tiles)g(are)g(usually)g(adequate.)48 b(In)32 b(the)h(case)g(of)g(v)m(ery)g(small)g(images,)i(it)e(could)g(b) s(e)f(more)g(e\016cien)m(t)0 894 y(to)h(compress)f(the)h(whole)f(image) i(as)e(a)h(single)g(tile.)48 b(Note)34 b(that)f(the)f(image)i (dimensions)d(are)i(not)g(required)e(to)0 1007 y(b)s(e)d(an)g(in)m (teger)i(m)m(ultiple)f(of)f(the)h(tile)g(dimensions;)g(if)f(not,)i (then)e(the)g(tiles)i(at)f(the)f(edges)h(of)g(the)f(image)i(will)f(b)s (e)0 1120 y(smaller)i(than)f(the)h(other)f(tiles.)0 1280 y(The)41 b(4)g(supp)s(orted)f(image)i(compression)f(algorithms)h(are)g (all)g('loss-less')h(when)d(applied)h(to)h(in)m(teger)h(FITS)0 1393 y(images;)25 b(the)c(pixel)g(v)-5 b(alues)20 b(are)h(preserv)m(ed) f(exactly)j(with)d(no)g(loss)h(of)f(information)h(during)e(the)i (compression)g(and)0 1506 y(uncompression)34 b(pro)s(cess.)54 b(In)34 b(addition,)j(the)e(HCOMPRESS)f(algorithm)i(supp)s(orts)d(a)i ('lossy')h(compression)0 1619 y(mo)s(de)41 b(that)h(will)g(pro)s(duce)f (larger)h(amoun)m(t)g(of)g(image)h(compression.)74 b(This)41 b(is)g(ac)m(hiev)m(ed)j(b)m(y)d(sp)s(ecifying)h(a)0 1732 y(non-zero)32 b(v)-5 b(alue)32 b(for)f(the)g(HCOMPRESS)f(\\scale")k (parameter.)44 b(Since)31 b(the)g(amoun)m(t)h(of)g(compression)f(that)h (is)0 1844 y(ac)m(hiev)m(ed)g(dep)s(ends)d(directly)i(on)f(the)h(RMS)f (noise)h(in)f(the)h(image,)h(it)f(is)g(usually)f(more)g(con)m(v)m(en)m (tion)j(to)e(sp)s(ecify)0 1957 y(the)f(HCOMPRESS)e(scale)i(factor)h (relativ)m(e)g(to)f(the)g(RMS)f(noise.)41 b(Setting)30 b(s)f(=)g(2.5)i(means)e(use)g(a)h(scale)h(factor)0 2070 y(that)h(is)f(2.5)i(times)e(the)h(calculated)h(RMS)e(noise)h(in)f(the)g (image)i(tile.)44 b(In)31 b(some)g(cases)h(it)g(ma)m(y)g(b)s(e)f (desirable)g(to)0 2183 y(sp)s(ecify)h(the)g(exact)i(scaling)f(to)g(b)s (e)e(used,)h(instead)h(of)f(sp)s(ecifying)g(it)g(relativ)m(e)j(to)d (the)h(calculated)h(noise)e(v)-5 b(alue.)0 2296 y(This)37 b(ma)m(y)h(b)s(e)f(done)g(b)m(y)h(sp)s(ecifying)f(the)h(negativ)m(e)i (of)d(desired)g(scale)i(v)-5 b(alue)38 b(\(t)m(ypically)i(in)d(the)h (range)g(-2)g(to)0 2409 y(-100\).)0 2569 y(V)-8 b(ery)43 b(high)g(compression)f(factors)i(\(of)f(100)h(or)f(more\))g(can)g(b)s (e)f(ac)m(hiev)m(ed)j(b)m(y)d(using)h(large)g(HCOMPRESS)0 2682 y(scale)31 b(v)-5 b(alues,)31 b(ho)m(w)m(ev)m(er,)h(this)e(can)g (pro)s(duce)f(undesirable)g(\\blo)s(c)m(ky")j(artifacts)f(in)f(the)g (compressed)g(image.)42 b(A)0 2795 y(v)-5 b(ariation)27 b(of)g(the)f(HCOMPRESS)f(algorithm)i(\(called)h(HSCOMPRESS\))c(can)i(b) s(e)g(used)f(in)h(this)g(case)h(to)g(apply)0 2908 y(a)f(small)h(amoun)m (t)f(of)h(smo)s(othing)f(of)g(the)g(image)h(when)e(it)i(is)f (uncompressed)f(to)h(help)g(co)m(v)m(er)i(up)d(these)h(artifacts.)0 3021 y(This)36 b(smo)s(othing)h(is)g(purely)f(cosmetic)j(and)d(do)s(es) h(not)g(cause)g(an)m(y)h(signi\014can)m(t)g(c)m(hange)g(to)f(the)g (image)i(pixel)0 3134 y(v)-5 b(alues.)0 3294 y(Floating)34 b(p)s(oin)m(t)f(FITS)e(images)j(\(whic)m(h)e(ha)m(v)m(e)i(BITPIX)e(=)g (-32)h(or)g(-64\))g(usually)f(con)m(tain)i(to)s(o)f(m)m(uc)m(h)g (\\noise")0 3407 y(in)k(the)g(least)i(signi\014can)m(t)f(bits)f(of)h (the)f(man)m(tissa)h(of)g(the)f(pixel)h(v)-5 b(alues)37 b(to)h(b)s(e)f(e\013ectiv)m(ely)j(compressed)d(with)0 3520 y(an)m(y)d(lossless)g(algorithm.)52 b(Consequen)m(tly)-8 b(,)35 b(\015oating)g(p)s(oin)m(t)e(images)i(are)f(\014rst)f(quan)m (tized)h(in)m(to)h(scaled)g(in)m(teger)0 3633 y(pixel)26 b(v)-5 b(alues)25 b(\(and)g(th)m(us)g(thro)m(wing)h(a)m(w)m(a)m(y)h(m)m (uc)m(h)e(of)h(the)f(noise\))h(b)s(efore)f(b)s(eing)g(compressed)g (with)g(the)h(sp)s(eci\014ed)0 3745 y(algorithm)d(\(either)g(GZIP)-8 b(,)23 b(Rice,)i(or)d(HCOMPRESS\).)f(This)h(tec)m(hnique)h(pro)s(duces) e(m)m(uc)m(h)h(higher)g(compression)0 3858 y(factors)33 b(than)e(simply)g(using)g(the)h(GZIP)g(utilit)m(y)h(to)f(externally)h (compress)f(the)f(whole)h(FITS)f(\014le,)i(but)e(it)h(also)0 3971 y(means)d(that)h(the)g(original)g(\015oating)g(v)-5 b(alue)30 b(pixel)f(v)-5 b(alues)30 b(are)g(not)f(exactly)i(preserv)m (ed.)40 b(When)29 b(done)g(prop)s(erly)-8 b(,)0 4084 y(this)33 b(in)m(teger)h(scaling)f(tec)m(hnique)h(will)f(only)f (discard)h(the)f(insigni\014can)m(t)i(noise)f(while)g(still)g (preserving)f(all)i(the)0 4197 y(real)43 b(information)f(in)g(the)h (image.)77 b(The)42 b(amoun)m(t)g(of)h(precision)f(that)h(is)f (retained)h(in)e(the)i(pixel)f(v)-5 b(alues)43 b(is)0 4310 y(con)m(trolled)37 b(b)m(y)d(the)i("quan)m(tization)h(lev)m(el")g (parameter,)g(q.)54 b(Larger)35 b(v)-5 b(alues)36 b(of)f(q)f(will)i (result)f(in)f(compressed)0 4423 y(images)h(whose)e(pixels)h(more)f (closely)i(matc)m(h)g(the)e(\015oating)i(p)s(oin)m(t)e(pixel)h(v)-5 b(alues,)35 b(but)e(at)h(the)g(same)g(time)g(the)0 4536 y(amoun)m(t)j(of)f(compression)g(that)h(is)f(ac)m(hiev)m(ed)i(will)f(b) s(e)e(reduced.)58 b(Users)36 b(should)f(exp)s(erimen)m(t)i(with)e (di\013eren)m(t)0 4649 y(v)-5 b(alues)25 b(for)g(this)g(parameter)g(to) h(determine)f(the)g(optimal)h(v)-5 b(alue)25 b(that)h(preserv)m(es)f (all)h(the)f(useful)f(information)h(in)0 4762 y(the)k(image,)h(without) f(needlessly)g(preserving)f(all)h(the)g(\\noise")h(whic)m(h)e(will)h(h) m(urt)f(the)h(compression)f(e\016ciency)-8 b(.)0 4922 y(The)38 b(default)g(v)-5 b(alue)38 b(for)g(the)g(quan)m(tization)i (scale)g(factor)f(is)f(4.0,)j(whic)m(h)d(means)g(that)g(scaled)h(in)m (teger)h(pixel)0 5035 y(v)-5 b(alues)41 b(will)h(b)s(e)e(quan)m(tized)i (suc)m(h)f(that)h(the)f(di\013erence)h(b)s(et)m(w)m(een)f(adjacen)m(t)i (in)m(teger)f(v)-5 b(alues)42 b(will)f(b)s(e)g(1/4th)0 5148 y(of)35 b(the)h(noise)f(lev)m(el)i(in)e(the)g(image)h(bac)m (kground.)55 b(CFITSIO)34 b(uses)g(an)h(optimized)h(algorithm)g(to)g (accurately)0 5261 y(estimate)41 b(the)e(noise)h(in)f(the)g(image.)68 b(As)39 b(an)g(example,)k(if)c(the)g(RMS)g(noise)g(in)g(the)h(bac)m (kground)e(pixels)i(of)0 5373 y(an)35 b(image)h(=)f(32.0,)j(then)d(the) h(spacing)f(b)s(et)m(w)m(een)h(adjacen)m(t)g(scaled)g(in)m(teger)h (pixel)e(v)-5 b(alues)36 b(will)f(equal)h(8.0)g(b)m(y)0 5486 y(default.)63 b(Note)38 b(that)h(the)e(RMS)h(noise)g(is)f(indep)s (enden)m(tly)g(calculated)j(for)d(eac)m(h)i(tile)f(of)g(the)g(image,)j (so)d(the)0 5599 y(resulting)24 b(in)m(teger)i(scaling)f(factor)g(ma)m (y)g(\015uctuate)g(sligh)m(tly)g(for)f(eac)m(h)i(tile.)40 b(In)23 b(some)i(cases)g(it)f(ma)m(y)h(b)s(e)f(desirable)0 5712 y(to)29 b(sp)s(ecify)f(the)h(exact)h(quan)m(tization)h(lev)m(el)f (to)f(b)s(e)f(used,)g(instead)h(of)g(sp)s(ecifying)f(it)h(relativ)m(e)i (to)e(the)g(calculated)p eop end %%Page: 49 57 TeXDict begin 49 56 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.49) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.6.)72 b(IMA)m(GE)31 b(COMPRESSION)2567 b Fj(49)0 555 y(noise)27 b(v)-5 b(alue.)40 b(This)27 b(ma)m(y)g(b)s(e)g(done)f(b)m(y)h(sp)s (ecifying)g(the)g(negativ)m(e)i(of)f(desired)e(quan)m(tization)j(lev)m (el)g(for)d(the)h(v)-5 b(alue)0 668 y(of)29 b(q.)40 b(In)28 b(the)i(previous)e(example,)i(one)f(could)g(sp)s(ecify)g(q)g(=)f(-8.0)j (so)e(that)h(the)f(quan)m(tized)g(in)m(teger)i(lev)m(els)f(di\013er)0 781 y(b)m(y)k(exactly)j(8.0.)54 b(Larger)35 b(negativ)m(e)i(v)-5 b(alues)35 b(for)f(q)h(means)f(that)h(the)g(lev)m(els)h(are)f(more)g (coarsely)h(spaced,)g(and)0 894 y(will)31 b(pro)s(duce)e(higher)h (compression)g(factors.)0 1054 y(When)h(\015oating)g(p)s(oin)m(t)g (images)h(are)f(b)s(eing)g(quan)m(tized,)h(one)f(m)m(ust)g(also)h(sp)s (ecify)e(what)h(quan)m(tization)h(metho)s(d)0 1167 y(is)g(to)h(b)s(e)e (used.)44 b(The)32 b(default)g(algorithm)g(is)g(called)h(\\SUBTRA)m (CTIVE)p 2567 1167 28 4 v 33 w(DITHER)p 2965 1167 V 33 w(1".)46 b(A)32 b(second)g(v)-5 b(ariation)0 1280 y(called)30 b(\\SUBTRA)m(CTIVE)p 982 1280 V 33 w(DITHER)p 1380 1280 V 33 w(2")g(is)f(also)h(a)m(v)-5 b(ailable,)32 b(whic)m(h)d(do)s(es)g (the)h(same)f(thing)h(except)g(that)g(an)m(y)0 1393 y(pixels)g(with)g (a)g(v)-5 b(alue)31 b(of)f(0.0)h(are)f(not)g(dithered)g(and)f(instead)h (the)g(zero)h(v)-5 b(alues)30 b(are)h(exactly)g(preserv)m(ed)f(in)g (the)0 1506 y(compressed)35 b(image.)58 b(One)35 b(ma)m(y)h(also)h (turn)d(o\013)i(dithering)g(completely)h(with)e(the)h(\\NO)p 3148 1506 V 33 w(DITHER")g(option,)0 1619 y(but)30 b(this)g(is)g(not)h (recommended)f(b)s(ecause)g(it)h(can)g(cause)g(larger)g(systematic)h (errors)e(in)g(measuremen)m(ts)g(of)h(the)0 1732 y(p)s(osition)f(or)h (brigh)m(tness)f(of)g(ob)5 b(jects)32 b(in)e(the)g(compressed)g(image.) 0 1892 y(There)37 b(are)g(3)h(metho)s(ds)e(for)h(sp)s(ecifying)g(all)h (the)g(parameters)f(needed)g(to)h(write)f(a)h(FITS)e(image)j(in)d(the)i (tile)0 2005 y(compressed)28 b(format.)41 b(The)28 b(parameters)g(ma)m (y)h(either)g(b)s(e)f(sp)s(eci\014ed)g(at)h(run)e(time)i(as)g(part)f (of)h(the)g(\014le)f(name)h(of)0 2118 y(the)e(output)f(compressed)h (FITS)e(\014le,)j(or)f(the)g(writing)f(program)h(ma)m(y)g(call)h(a)f (set)g(of)g(help)s(er)f(CFITSIO)f(subrou-)0 2230 y(tines)36 b(that)g(are)g(pro)m(vided)f(for)h(sp)s(ecifying)f(the)h(parameter)g(v) -5 b(alues,)37 b(or)f(\\compression)g(directiv)m(e")i(k)m(eyw)m(ords)0 2343 y(ma)m(y)c(b)s(e)e(added)h(to)g(the)h(header)f(of)g(eac)m(h)h (image)h(HDU)e(to)h(sp)s(ecify)f(the)g(compression)g(parameters.)50 b(These)33 b(3)0 2456 y(metho)s(ds)d(are)g(describ)s(ed)g(b)s(elo)m(w.) 0 2616 y(1\))23 b(A)m(t)g(run)e(time,)k(when)c(sp)s(ecifying)h(the)h (name)f(of)g(the)h(output)f(FITS)f(\014le)i(to)g(b)s(e)e(created,)k (the)e(user)e(can)i(indicate)0 2729 y(that)32 b(images)g(should)e(b)s (e)h(written)g(in)g(tile-compressed)i(format)e(b)m(y)h(enclosing)g(the) f(compression)h(parameters)0 2842 y(in)e(square)g(brac)m(k)m(ets)i (follo)m(wing)g(the)e(ro)s(ot)h(disk)f(\014le)g(name)h(in)f(the)h (follo)m(wing)g(format:)191 3100 y Fe([compress)45 b(NAME)i(T1,T2;)f (q[z])h(QLEVEL,)e(s)j(HSCALE])0 3359 y Fj(where)191 3617 y Fe(NAME)142 b(=)47 b(algorithm)f(name:)94 b(GZIP,)46 b(Rice,)h(HCOMPRESS,)e(HSCOMPRSS)g(or)i(PLIO)620 3730 y(may)g(be)h(abbreviated)c(to)j(the)g(first)g(letter)f(\(or)h(HS)g(for) g(HSCOMPRESS\))191 3843 y(T1,T2)94 b(=)47 b(tile)g(dimension)e(\(e.g.)i (100,100)f(for)g(square)h(tiles)f(100)h(pixels)f(wide\))191 3955 y(QLEVEL)g(=)h(quantization)e(level)h(for)h(floating)f(point)g (FITS)h(images)191 4068 y(HSCALE)f(=)h(HCOMPRESS)f(scale)g(factor;)g (default)g(=)h(0)h(which)e(is)h(lossless.)0 4327 y Fj(Here)31 b(are)g(a)f(few)h(examples)f(of)h(this)f(extended)h(syn)m(tax:)191 4585 y Fe(myfile.fit[compress])185 b(-)48 b(use)f(the)g(default)e (compression)g(algorithm)g(\(Rice\))1432 4698 y(and)i(the)g(default)e (tile)i(size)g(\(row)f(by)i(row\))191 4924 y(myfile.fit[compress)42 b(G])48 b(-)f(use)g(the)g(specified)e(compression)g(algorithm;)191 5036 y(myfile.fit[compress)d(R])239 b(only)46 b(the)h(first)f(letter)h (of)g(the)g(algorithm)191 5149 y(myfile.fit[compress)42 b(P])239 b(should)46 b(be)h(given.)191 5262 y(myfile.fit[compress)42 b(H])191 5488 y(myfile.fit[compress)g(R)48 b(100,100])141 b(-)47 b(use)g(Rice)g(and)g(100)g(x)g(100)g(pixel)f(tiles)191 5714 y(myfile.fit[compress)c(R;)48 b(q)f(10.0])f(-)i(quantization)c (level)j(=)g(\(RMS-noise\))e(/)i(10.)p eop end %%Page: 50 58 TeXDict begin 50 57 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.50) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(50)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)191 555 y Fe(myfile.fit[compress)42 b(R;)48 b(qz)f(10.0])f(-)i(quantization)c(level)i(=)i(\(RMS-noise\))d (/)i(10.)1050 668 y(also)g(use)g(the)f(SUBTRACTIVE_DITHER_2)d (quantization)h(method)191 781 y(myfile.fit[compress)e(HS;)47 b(s)h(2.0])94 b(-)h(HSCOMPRESS)45 b(\(with)i(smoothing\))2005 894 y(and)f(scale)h(=)g(2.0)g(*)h(RMS-noise)0 1116 y Fj(2\))29 b(Before)g(calling)g(the)f(CFITSIO)e(routine)i(to)h(write)f (the)g(image)h(header)f(k)m(eyw)m(ords)g(\(e.g.,)j(\014ts)p 3335 1116 28 4 v 32 w(create)p 3603 1116 V 34 w(image\))0 1228 y(the)37 b(programmer)g(can)g(call)i(the)e(routines)g(describ)s (ed)f(b)s(elo)m(w)h(to)h(sp)s(ecify)f(the)g(compression)g(algorithm)i (and)0 1341 y(the)g(tiling)h(pattern)f(that)g(is)g(to)g(b)s(e)f(used.) 65 b(There)38 b(are)i(routines)e(for)h(sp)s(ecifying)f(the)h(v)-5 b(arious)39 b(compression)0 1454 y(parameters)31 b(and)e(similar)i (routines)f(to)i(return)d(the)h(curren)m(t)h(v)-5 b(alues)30 b(of)h(the)f(parameters:)95 1676 y Fe(int)47 b (fits_set_compression_type\()o(fit)o(sfil)o(e)42 b(*fptr,)k(int)h (comptype,)e(int)i(*status\))95 1789 y(int)g (fits_set_tile_dim\(fitsfile)41 b(*fptr,)46 b(int)h(ndim,)f(long)h (*tilesize,)e(int)i(*status\))95 1902 y(int)g (fits_set_quantize_level\(fi)o(tsf)o(ile)41 b(*fptr,)46 b(float)h(qlevel,)f(int)h(*status\))95 2015 y(int)g (fits_set_quantize_method\(f)o(its)o(file)41 b(*fptr,)46 b(int)h(method,)f(int)h(*status\))95 2128 y(int)g (fits_set_quantize_dither\(f)o(its)o(file)41 b(*fptr,)46 b(int)h(dither,)f(int)h(*status\))95 2240 y(int)g (fits_set_dither_seed\(fitsf)o(ile)41 b(*fptr,)46 b(int)h(seed,)g(int)f (*status\))95 2353 y(int)h(fits_set_dither_offset\(fit)o(sfi)o(le)42 b(*fptr,)k(int)h(offset,)e(int)i(*status\))95 2466 y(int)g (fits_set_lossy_int\(fitsfil)o(e)42 b(*fptr,)k(int)h(lossy_int,)e(int)i (*status\))286 2579 y(this)g(forces)f(integer)g(image)g(to)h(be)h (converted)d(to)i(floats,)f(then)h(quantized)95 2692 y(int)g(fits_set_huge_hdu\(fitsfile)41 b(*fptr,)46 b(int)h(huge,)f(int) h(*status\);)286 2805 y(this)g(should)f(be)h(called)f(when)h(the)g (compressed)e(image)h(size)h(is)g(more)g(than)f(4)i(GB.)95 2918 y(int)f(fits_set_hcomp_scale\(fitsf)o(ile)41 b(*fptr,)46 b(float)h(scale,)f(int)h(*status\))95 3031 y(int)g (fits_set_hcomp_smooth\(fits)o(fil)o(e)42 b(*fptr,)k(int)h(smooth,)f (int)h(*status\))668 3144 y(Set)g(smooth)f(=)i(1)f(to)g(apply)g (smoothing)e(when)i(uncompressing)d(the)j(image)95 3370 y(int)g(fits_get_compression_type\()o(fit)o(sfil)o(e)42 b(*fptr,)k(int)h(*comptype,)e(int)i(*status\))95 3482 y(int)g(fits_get_tile_dim\(fitsfile)41 b(*fptr,)46 b(int)h(ndim,)f (long)h(*tilesize,)e(int)i(*status\))95 3595 y(int)g (fits_get_quantize_level\(fi)o(tsf)o(ile)41 b(*fptr,)46 b(float)h(*level,)f(int)h(*status\))95 3708 y(int)g (fits_get_hcomp_scale\(fitsf)o(ile)41 b(*fptr,)46 b(float)h(*scale,)e (int)i(*status\))0 3930 y Fj(Sev)m(eral)33 b(sym)m(b)s(olic)f(constan)m (ts)h(are)f(de\014ned)e(for)i(use)f(as)h(the)g(v)-5 b(alue)33 b(of)f(the)f(`compt)m(yp)s(e')i(parameter:)44 b(GZIP)p 3802 3930 V 32 w(1,)0 4043 y(GZIP)p 227 4043 V 32 w(2,)j(RICE)p 604 4043 V 32 w(1,)f(HCOMPRESS)p 1333 4043 V 32 w(1)d(or)g(PLIO)p 1800 4043 V 32 w(1.)78 b(En)m(tering)43 b(NULL)g(for)g(compt)m(yp)s(e)g (will)g(turn)f(o\013)h(the)0 4156 y(tile-compression)32 b(and)e(cause)h(normal)f(FITS)g(images)h(to)g(b)s(e)f(written.)0 4316 y(There)20 b(are)g(also)i(de\014ned)d(sym)m(b)s(olic)h(constan)m (ts)i(for)e(the)g(quan)m(tization)i(metho)s(d:)36 b(\\SUBTRA)m(CTIVE)p 3507 4316 V 32 w(DITHER)p 3904 4316 V 33 w(1",)0 4429 y(\\SUBTRA)m(CTIVE)p 726 4429 V 33 w(DITHER)p 1124 4429 V 32 w(2",)c(and)e(\\NO)p 1664 4429 V 33 w(DITHER".)0 4589 y(3\))g(CFITSIO)e(will)i(uses)f(the)h(v)-5 b(alues)29 b(of)h(the)g(follo)m(wing)g(k)m(eyw)m(ords,)h(if)e(they)h(are)g(presen) m(t)f(in)g(the)h(header)f(of)h(the)0 4702 y(image)k(HDU,)g(to)g (determine)f(ho)m(w)g(to)h(compress)f(that)g(HDU.)h(These)f(k)m(eyw)m (ords)g(o)m(v)m(erride)i(an)m(y)e(compression)0 4815 y(parameters)e(that)g(w)m(ere)g(sp)s(eci\014ed)e(with)h(the)h(previous) f(2)g(metho)s(ds.)95 5036 y Fe(FZALGOR)94 b(-)47 b('RICE_1')f(,)h ('GZIP_1',)f('GZIP_2',)f('HCOMPRESS_1',)f('PLIO_1',)h('NONE')95 5149 y(FZTILE)142 b(-)47 b('ROW',)g('WHOLE',)e(or)i('\(n,m\)')95 5262 y(FZQVALUE)f(-)h(float)g(value)f(\(default)g(=)h(4.0\))95 5375 y(FZQMETHD)f(-)h('SUBTRACTIVE_DITHER_1',)42 b ('SUBTRACTIVE_DITHER_2',)f('NO_DITHER')95 5488 y(FZDTHRSD)46 b(-)h('CLOCK',)f('CHECKSUM',)f(1)i(-)h(10000)95 5601 y(FZINT2F)94 b(-)h(T,)47 b(or)h(F:)94 b(Convert)46 b(integers)g(to)h (floats,)f(then)g(quantize?)95 5714 y(FZHSCALE)g(-)h(float)g(value)f (\(default)g(=)h(0\).)95 b(Hcompress)45 b(scale)h(value.)p eop end %%Page: 51 59 TeXDict begin 51 58 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.51) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.6.)72 b(IMA)m(GE)31 b(COMPRESSION)2567 b Fj(51)0 555 y(No)23 b(sp)s(ecial)f(action)i(is)e(required)f(b)m(y)h(soft)m(w)m(are)i(when)d (read)h(tile-compressed)h(images)g(b)s(ecause)f(all)h(the)f(CFITSIO)0 668 y(routines)35 b(that)g(read)g(normal)g(uncompressed)f(FITS)g (images)i(also)g(transparen)m(tly)g(read)e(images)j(in)d(the)h(tile-)0 781 y(compressed)28 b(format;)h(CFITSIO)e(essen)m(tially)j(treats)f (the)f(binary)g(table)h(that)f(con)m(tains)i(the)e(compressed)g(tiles)0 894 y(as)j(if)f(it)h(w)m(ere)g(an)f(IMA)m(GE)h(extension.)0 1054 y(The)f(follo)m(wing)i(2)e(routines)h(are)f(a)m(v)-5 b(ailable)33 b(for)d(compressing)h(or)f(or)g(decompressing)h(an)f (image:)95 1309 y Fe(int)47 b(fits_img_compress\(fitsfile)41 b(*infptr,)46 b(fitsfile)f(*outfptr,)g(int)i(*status\);)95 1421 y(int)g(fits_img_decompress)c(\(fitsfile)i(*infptr,)h(fitsfile)f (*outfptr,)h(int)g(*status\);)0 1676 y Fj(Before)30 b(calling)h(the)f (compression)f(routine,)h(the)g(compression)f(parameters)h(m)m(ust)f (\014rst)g(b)s(e)g(de\014ned)f(in)h(one)h(of)0 1789 y(the)e(3)h(w)m(a)m (y)g(describ)s(ed)e(in)h(the)g(previous)g(paragraphs.)39 b(There)28 b(is)g(also)h(a)f(routine)h(to)f(determine)h(if)f(the)g (curren)m(t)0 1902 y(HDU)j(con)m(tains)h(a)e(tile)i(compressed)e(image) i(\(it)f(returns)e(1)i(or)f(0\):)95 2156 y Fe(int)47 b(fits_is_compressed_image\(f)o(its)o(file)41 b(*fptr,)46 b(int)h(*status\);)0 2411 y Fj(A)30 b(small)g(example)g(program)f (called)i('imcop)m(y')f(is)g(included)f(with)g(CFITSIO)f(that)i(can)f (b)s(e)g(used)g(to)h(compress)0 2524 y(\(or)44 b(uncompress\))g(an)m(y) g(FITS)g(image.)83 b(This)43 b(program)h(can)h(b)s(e)e(used)h(to)g(exp) s(erimen)m(t)h(with)f(the)g(v)-5 b(arious)0 2637 y(compression)30 b(options)h(on)f(existing)i(FITS)d(images)j(as)e(sho)m(wn)g(in)g(these) h(examples:)0 2891 y Fe(1\))95 b(imcopy)46 b(infile.fit)f ('outfile.fit[compress]')334 3117 y(This)i(will)f(use)h(the)g(default)f (compression)f(algorithm)g(\(Rice\))h(and)h(the)334 3230 y(default)f(tile)h(size)f(\(row)h(by)g(row\))0 3456 y(2\))95 b(imcopy)46 b(infile.fit)f('outfile.fit[compress)d(GZIP]')334 3681 y(This)47 b(will)f(use)h(the)g(GZIP)g(compression)e(algorithm)g (and)i(the)g(default)334 3794 y(tile)g(size)f(\(row)h(by)g(row\).)94 b(The)47 b(allowed)f(compression)f(algorithms)g(are)334 3907 y(Rice,)h(GZIP,)h(and)g(PLIO.)94 b(Only)46 b(the)h(first)g(letter) f(of)h(the)g(algorithm)334 4020 y(name)g(needs)f(to)h(be)g(specified.)0 4246 y(3\))95 b(imcopy)46 b(infile.fit)f('outfile.fit[compress)d(G)47 b(100,100]')334 4472 y(This)g(will)f(use)h(the)g(GZIP)g(compression)e (algorithm)g(and)i(100)g(X)g(100)g(pixel)334 4585 y(tiles.)0 4811 y(4\))95 b(imcopy)46 b(infile.fit)f('outfile.fit[compress)d(R)47 b(100,100;)f(qz)h(10.0]')334 5036 y(This)g(will)f(use)h(the)g(Rice)g (compression)e(algorithm,)g(100)h(X)i(100)f(pixel)334 5149 y(tiles,)f(and)h(quantization)e(level)h(=)h(RMSnoise)f(/)h(10.0)g (\(assuming)e(the)334 5262 y(input)h(image)h(has)g(a)g(floating)f (point)g(data)h(type\).)f(By)h(specifying)334 5375 y(qz)g(instead)f(of) h(q,)g(this)g(means)f(use)h(the)g(subtractive)e(dither2)334 5488 y(quantization)g(method.)0 5714 y(5\))95 b(imcopy)46 b(infile.fit)f(outfile.fit)p eop end %%Page: 52 60 TeXDict begin 52 59 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.52) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(52)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)334 668 y Fe(If)47 b(the)g(input)g(file)f(is) h(in)h(tile-compressed)43 b(format,)j(then)h(it)g(will)f(be)334 781 y(uncompressed)f(to)i(the)g(output)f(file.)94 b(Otherwise,)45 b(it)i(simply)f(copies)334 894 y(the)h(input)f(image)h(to)g(the)g (output)f(image.)0 1120 y(6\))95 b(imcopy)46 b ('infile.fit[1001:1500,20)o(01:2)o(500])o(')89 b(outfile.fit)334 1346 y(This)47 b(extracts)e(a)j(500)f(X)g(500)g(pixel)f(section)g(of)h (the)g(much)g(larger)334 1458 y(input)f(image)h(\(which)f(may)h(be)g (in)g(tile-compressed)d(format\).)93 b(The)334 1571 y(output)46 b(is)h(a)h(normal)e(uncompressed)e(FITS)j(image.)0 1797 y(7\))95 b(imcopy)46 b('infile.fit[1001:1500,20)o(01:2)o(500])o(')89 b(outfile.fit.gz)334 2023 y(Same)47 b(as)g(above,)f(except)g(the)h (output)f(file)h(is)g(externally)e(compressed)334 2136 y(using)h(the)h(gzip)g(algorithm.)0 2397 y SDict begin H.S end 0 2397 a 0 2397 a SDict begin 13.6 H.A end 0 2397 a 0 2397 a SDict begin [/View [/XYZ H.V]/Dest (section.5.7) cvn /DEST pdfmark end 0 2397 a 197 x Ff(5.7)135 b(ASCI)t(I)45 b(and)f(Binary)h(T)-11 b(able)45 b(Routines)0 2846 y Fj(These)36 b(routines)g(p)s(erform)f(read)i(and)e(write)i(op)s (erations)g(on)f(columns)g(of)h(data)g(in)f(FITS)g(ASCI)s(I)e(or)j (Binary)0 2959 y(tables.)47 b(Note)33 b(that)g(in)e(the)i(follo)m(wing) g(discussions,)f(the)g(\014rst)g(ro)m(w)g(and)f(column)h(in)g(a)g (table)h(is)g(at)f(p)s(osition)h(1)0 3072 y(not)e(0.)0 3232 y(Users)k(should)g(also)i(read)e(the)h(follo)m(wing)h(c)m(hapter)g (on)e(the)h(CFITSIO)e(iterator)j(function)f(whic)m(h)f(pro)m(vides)h(a) 0 3345 y(more)i(`ob)5 b(ject)39 b(orien)m(ted')g(metho)s(d)f(of)g (reading)g(and)g(writing)g(table)h(columns.)63 b(The)37 b(iterator)j(function)d(is)i(a)0 3458 y(little)e(more)f(complicated)h (to)f(use,)h(but)e(the)g(adv)-5 b(an)m(tages)38 b(are)d(that)i(it)f (usually)f(tak)m(es)i(less)e(co)s(de)h(to)g(p)s(erform)0 3571 y(the)h(same)f(op)s(eration,)j(and)c(the)i(resulting)f(program)g (often)h(runs)e(faster)i(b)s(ecause)f(the)g(FITS)g(\014les)g(are)h (read)0 3684 y(and)30 b(written)g(using)g(the)h(most)f(e\016cien)m(t)i (blo)s(c)m(k)f(size.)0 3840 y SDict begin H.S end 0 3840 a 0 3840 a SDict begin 13.6 H.A end 0 3840 a 0 3840 a SDict begin [/View [/XYZ H.V]/Dest (subsection.5.7.1) cvn /DEST pdfmark end 0 3840 a 146 x Fd(5.7.1)112 b(Create)38 b(New)f(T)-9 b(able)0 4202 y Fi(1)81 b Fj(Create)40 b(a)f(new)g(ASCI)s(I)e(or)i(bin) m(table)h(table)g(extension.)68 b(If)39 b(the)g(FITS)g(\014le)g(is)g (curren)m(tly)g(empt)m(y)h(then)f(a)227 4315 y(dumm)m(y)25 b(primary)f(arra)m(y)i(will)g(b)s(e)f(created)i(b)s(efore)e(app)s (ending)f(the)i(table)g(extension)h(to)f(it.)40 b(The)25 b(tblt)m(yp)s(e)227 4428 y(parameter)39 b(de\014nes)e(the)h(t)m(yp)s(e) h(of)f(table)h(and)e(can)i(ha)m(v)m(e)g(v)-5 b(alues)39 b(of)f(ASCI)s(I)p 2924 4428 28 4 v 31 w(TBL)g(or)g(BINAR)-8 b(Y)p 3659 4428 V 34 w(TBL.)227 4541 y(The)29 b(naxis2)g(parameter)h (giv)m(es)g(the)g(initial)g(n)m(um)m(b)s(er)e(of)h(ro)m(ws)g(to)h(b)s (e)f(created)h(in)f(the)g(table,)h(and)f(should)227 4654 y(normally)h(b)s(e)f(set)h(=)g(0.)40 b(CFITSIO)29 b(will)h (automatically)i(increase)f(the)e(size)i(of)f(the)g(table)g(as)g (additional)227 4767 y(ro)m(ws)d(are)g(written.)40 b(A)27 b(non-zero)g(n)m(um)m(b)s(er)f(of)h(ro)m(ws)g(ma)m(y)g(b)s(e)f(sp)s (eci\014ed)g(to)i(reserv)m(e)f(space)h(for)e(that)i(man)m(y)227 4880 y(ro)m(ws,)41 b(ev)m(en)e(if)g(a)g(few)m(er)g(n)m(um)m(b)s(er)e (of)i(ro)m(ws)f(will)h(b)s(e)f(written.)66 b(The)38 b(tunit)g(and)g (extname)i(parameters)227 4993 y(are)e(optional)g(and)f(a)h(n)m(ull)f (p)s(oin)m(ter)g(ma)m(y)h(b)s(e)f(giv)m(en)h(if)g(they)f(are)h(not)f (de\014ned.)61 b(The)37 b(FITS)f(Standard)227 5106 y(recommends)29 b(that)h(only)g(letters,)h(digits,)g(and)e(the)g(underscore)g(c)m (haracter)i(b)s(e)e(used)g(in)g(column)g(names)227 5219 y(\(the)c(tt)m(yp)s(e)g(parameter\))g(with)e(no)h(em)m(b)s(edded)f (spaces.)40 b(T)-8 b(railing)24 b(blank)g(c)m(haracters)i(are)e(not)h (signi\014can)m(t.)95 5601 y Fe(int)47 b(fits_create_tbl)d(/)j(ffcrtb) 286 5714 y(\(fitsfile)f(*fptr,)g(int)h(tbltype,)e(LONGLONG)h(naxis2,)g (int)g(tfields,)g(char)h(*ttype[],)p eop end %%Page: 53 61 TeXDict begin 53 60 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.53) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.7.)72 b(ASCI)s(I)29 b(AND)i(BINAR)-8 b(Y)31 b(T)-8 b(ABLE)31 b(R)m(OUTINES)1864 b Fj(53)334 555 y Fe(char)47 b(*tform[],)e(char)i (*tunit[],)e(char)i(*extname,)e(int)i(*status\))0 693 y SDict begin H.S end 0 693 a 0 693 a SDict begin 13.6 H.A end 0 693 a 0 693 a SDict begin [/View [/XYZ H.V]/Dest (subsection.5.7.2) cvn /DEST pdfmark end 0 693 a 151 x Fd(5.7.2)112 b(Column)39 b(Information)f(Routines)0 1050 y Fi(1)81 b Fj(Get)30 b(the)g(n)m(um)m(b)s(er)e(of)i(ro)m(ws)g(or)f(columns)g(in) h(the)g(curren)m(t)f(FITS)g(table.)41 b(The)29 b(n)m(um)m(b)s(er)f(of)i (ro)m(ws)g(is)f(giv)m(en)i(b)m(y)227 1163 y(the)j(NAXIS2)f(k)m(eyw)m (ord)h(and)e(the)i(n)m(um)m(b)s(er)e(of)h(columns)g(is)g(giv)m(en)h(b)m (y)f(the)h(TFIELDS)e(k)m(eyw)m(ord)i(in)f(the)227 1276 y(header)d(of)h(the)g(table.)95 1521 y Fe(int)47 b(fits_get_num_rows)c (/)48 b(ffgnrw)286 1634 y(\(fitsfile)e(*fptr,)g(>)h(long)g(*nrows,)f (int)h(*status\);)95 1860 y(int)g(fits_get_num_rowsll)c(/)k(ffgnrwll) 286 1973 y(\(fitsfile)f(*fptr,)g(>)h(LONGLONG)f(*nrows,)g(int)g (*status\);)95 2199 y(int)h(fits_get_num_cols)c(/)48 b(ffgncl)286 2312 y(\(fitsfile)e(*fptr,)g(>)h(int)g(*ncols,)f(int)h (*status\);)0 2557 y Fi(2)81 b Fj(Get)25 b(the)f(table)i(column)e(n)m (um)m(b)s(er)f(\(and)h(name\))h(of)f(the)h(column)f(whose)g(name)g (matc)m(hes)i(an)e(input)g(template)227 2670 y(name.)48 b(If)32 b(casesen)i(=)e(CASESEN)g(then)g(the)h(column)f(name)h(matc)m (h)h(will)f(b)s(e)f(case-sensitiv)m(e,)k(whereas)227 2783 y(if)27 b(casesen)h(=)e(CASEINSEN)g(then)h(the)g(case)h(will)f(b)s (e)f(ignored.)40 b(As)27 b(a)g(general)h(rule,)f(the)g(column)g(names) 227 2895 y(should)j(b)s(e)f(treated)j(as)e(case)i(INsensitiv)m(e.)227 3043 y(The)26 b(input)g(column)g(name)g(template)i(ma)m(y)f(b)s(e)f (either)h(the)g(exact)h(name)e(of)h(the)f(column)g(to)i(b)s(e)d(searc)m (hed)227 3156 y(for,)k(or)f(it)h(ma)m(y)g(con)m(tain)h(wild)e(card)g(c) m(haracters)i(\(*,)g(?,)f(or)f(#\),)h(or)f(it)h(ma)m(y)g(con)m(tain)h (the)e(in)m(teger)i(n)m(um)m(b)s(er)227 3269 y(of)j(the)f(desired)f (column)h(\(with)g(the)h(\014rst)e(column)h(=)g(1\).)46 b(The)32 b(`*')h(wild)f(card)g(c)m(haracter)h(matc)m(hes)h(an)m(y)227 3382 y(sequence)h(of)g(c)m(haracters)h(\(including)f(zero)g(c)m (haracters\))i(and)d(the)h(`?')53 b(c)m(haracter)36 b(matc)m(hes)g(an)m (y)f(single)227 3495 y(c)m(haracter.)42 b(The)29 b(#)h(wildcard)f(will) h(matc)m(h)h(an)m(y)e(consecutiv)m(e)j(string)e(of)f(decimal)i(digits)f (\(0-9\).)43 b(If)29 b(more)227 3608 y(than)43 b(one)f(column)h(name)f (in)g(the)h(table)h(matc)m(hes)f(the)g(template)h(string,)i(then)c(the) h(\014rst)e(matc)m(h)j(is)227 3721 y(returned)28 b(and)h(the)g(status)h (v)-5 b(alue)30 b(will)f(b)s(e)g(set)h(to)g(COL)p 2171 3721 28 4 v 32 w(NOT)p 2408 3721 V 32 w(UNIQUE)f(as)h(a)f(w)m(arning)g (that)h(a)g(unique)227 3834 y(matc)m(h)e(w)m(as)g(not)f(found.)39 b(T)-8 b(o)27 b(\014nd)f(the)h(other)g(cases)h(that)g(matc)m(h)g(the)g (template,)h(call)f(the)g(routine)f(again)227 3947 y(lea)m(ving)g(the)e (input)f(status)h(v)-5 b(alue)26 b(equal)f(to)h(COL)p 1950 3947 V 32 w(NOT)p 2187 3947 V 32 w(UNIQUE)f(and)f(the)h(next)h (matc)m(hing)g(name)f(will)227 4059 y(then)30 b(b)s(e)g(returned.)40 b(Rep)s(eat)30 b(this)h(pro)s(cess)f(un)m(til)g(a)h(status)g(=)f(COL)p 2628 4059 V 32 w(NOT)p 2865 4059 V 32 w(F)m(OUND)i(is)e(returned.)227 4207 y(The)36 b(FITS)g(Standard)g(recommends)g(that)i(only)e(letters,)k (digits,)f(and)d(the)h(underscore)f(c)m(haracter)j(b)s(e)227 4320 y(used)31 b(in)g(column)g(names)g(\(with)h(no)f(em)m(b)s(edded)f (spaces\).)45 b(T)-8 b(railing)32 b(blank)f(c)m(haracters)i(are)e(not)h (signi\014-)227 4433 y(can)m(t.)95 4678 y Fe(int)47 b(fits_get_colnum)d (/)j(ffgcno)286 4791 y(\(fitsfile)f(*fptr,)g(int)h(casesen,)e(char)i (*templt,)e(>)j(int)f(*colnum,)334 4904 y(int)g(*status\))95 5130 y(int)g(fits_get_colname)d(/)j(ffgcnn)286 5243 y(\(fitsfile)f (*fptr,)g(int)h(casesen,)e(char)i(*templt,)e(>)j(char)e(*colname,)334 5356 y(int)h(*colnum,)f(int)g(*status\))0 5601 y Fi(3)81 b Fj(Return)30 b(the)i(data)g(t)m(yp)s(e,)h(v)m(ector)g(rep)s(eat)f(v) -5 b(alue,)32 b(and)f(the)h(width)f(in)g(b)m(ytes)h(of)g(a)g(column)f (in)g(an)h(ASCI)s(I)e(or)227 5714 y(binary)35 b(table.)56 b(Allo)m(w)m(ed)37 b(v)-5 b(alues)36 b(for)f(the)h(data)g(t)m(yp)s(e)f (in)g(ASCI)s(I)f(tables)i(are:)51 b(TSTRING,)35 b(TSHOR)-8 b(T,)p eop end %%Page: 54 62 TeXDict begin 54 61 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.54) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(54)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)227 555 y Fj(TLONG,)36 b(TFLO)m(A)-8 b(T,)36 b(and)f(TDOUBLE.)i(Binary)e(tables)i(also)g(supp)s(ort)d(these) i(t)m(yp)s(es:)52 b(TLOGICAL,)227 668 y(TBIT,)37 b(TBYTE,)f(TLONGLONG,) g(TCOMPLEX)g(and)g(TDBLCOMPLEX.)g(The)g(negativ)m(e)j(of)e(the)227 781 y(data)29 b(t)m(yp)s(e)g(co)s(de)f(v)-5 b(alue)29 b(is)f(returned)f(if)h(it)h(is)f(a)h(v)-5 b(ariable)29 b(length)g(arra)m(y)f(column.)40 b(Note)30 b(that)f(in)e(the)i(case)227 894 y(of)i(a)g('J')g(32-bit)i(in)m(teger)f(binary)e(table)h(column,)g (this)g(routine)g(will)g(return)f(data)h(t)m(yp)s(e)g(=)g(TINT32BIT)227 1007 y(\(whic)m(h)40 b(in)f(fact)h(is)f(equiv)-5 b(alen)m(t)41 b(to)f(TLONG\).)f(With)h(most)g(curren)m(t)f(C)g(compilers,)j(a)d(v)-5 b(alue)40 b(in)f(a)h('J')227 1120 y(column)29 b(has)g(the)h(same)f (size)h(as)g(an)f('in)m(t')h(v)-5 b(ariable,)31 b(and)d(ma)m(y)i(not)g (b)s(e)e(equiv)-5 b(alen)m(t)31 b(to)f(a)g('long')g(v)-5 b(ariable,)227 1233 y(whic)m(h)30 b(is)h(64-bits)g(long)g(on)g(an)f (increasing)h(n)m(um)m(b)s(er)e(of)h(compilers.)227 1400 y(The)22 b('rep)s(eat')h(parameter)g(returns)f(the)g(v)m(ector)i(rep)s (eat)f(coun)m(t)g(on)f(the)h(binary)f(table)h(TF)m(ORMn)f(k)m(eyw)m (ord)227 1513 y(v)-5 b(alue.)60 b(\(ASCI)s(I)35 b(table)j(columns)e (alw)m(a)m(ys)i(ha)m(v)m(e)g(rep)s(eat)e(=)g(1\).)60 b(The)36 b('width')g(parameter)h(returns)f(the)227 1626 y(width)30 b(in)g(b)m(ytes)h(of)g(a)f(single)h(column)g(elemen)m(t)h (\(e.g.,)g(a)f('10D')h(binary)e(table)h(column)f(will)h(ha)m(v)m(e)h (width)227 1739 y(=)d(8,)i(an)e(ASCI)s(I)f(table)i('F12.2')i(column)e (will)g(ha)m(v)m(e)g(width)f(=)g(12,)i(and)e(a)h(binary)e(table'60A')k (c)m(haracter)227 1852 y(string)44 b(column)g(will)g(ha)m(v)m(e)h (width)e(=)h(60\);)52 b(Note)45 b(that)f(CFITSIO)f(supp)s(orts)f(the)i (lo)s(cal)h(con)m(v)m(en)m(tion)227 1965 y(for)d(sp)s(ecifying)f(arra)m (ys)i(of)f(\014xed)f(length)h(strings)f(within)h(a)g(binary)f(table)h (c)m(haracter)i(column)d(using)227 2078 y(the)g(syn)m(tax)g(TF)m(ORM)g (=)g('rAw')f(where)g('r')h(is)g(the)g(total)h(n)m(um)m(b)s(er)d(of)i(c) m(haracters)h(\(=)f(the)g(width)f(of)227 2191 y(the)f(column\))g(and)e ('w')i(is)f(the)h(width)f(of)g(a)h(unit)f(string)g(within)g(the)h (column.)65 b(Th)m(us)37 b(if)h(the)h(column)227 2304 y(has)34 b(TF)m(ORM)h(=)f('60A12')j(then)d(this)g(means)g(that)h(eac)m (h)g(ro)m(w)g(of)f(the)h(table)g(con)m(tains)g(5)g(12-c)m(haracter)227 2416 y(substrings)23 b(within)h(the)g(60-c)m(haracter)j(\014eld,)f(and) d(th)m(us)h(in)g(this)g(case)h(this)g(routine)f(will)g(return)f(t)m(yp) s(eco)s(de)227 2529 y(=)f(TSTRING,)g(rep)s(eat)g(=)g(60,)j(and)d(width) f(=)h(12.)39 b(\(The)22 b(TDIMn)g(k)m(eyw)m(ord)h(ma)m(y)g(also)g(b)s (e)f(used)f(to)i(sp)s(ecify)227 2642 y(the)29 b(unit)e(string)h (length;)i(The)e(pair)g(of)g(k)m(eyw)m(ords)g(TF)m(ORMn)g(=)g('60A')i (and)e(TDIMn)f(=)h('\(12,5\)')j(w)m(ould)227 2755 y(ha)m(v)m(e)g(the)f (same)g(e\013ect)h(as)e(TF)m(ORMn)h(=)f('60A12'\).)43 b(The)29 b(n)m(um)m(b)s(er)f(of)i(substrings)e(in)h(an)m(y)h(binary)f (table)227 2868 y(c)m(haracter)36 b(string)e(\014eld)f(can)h(b)s(e)g (calculated)i(b)m(y)d(\(rep)s(eat/width\).)53 b(A)34 b(n)m(ull)f(p)s(oin)m(ter)h(ma)m(y)h(b)s(e)e(giv)m(en)i(for)227 2981 y(an)m(y)c(of)g(the)f(output)g(parameters)h(that)g(are)g(not)f (needed.)227 3149 y(The)46 b(second)g(routine,)k(\014t)p 1188 3149 28 4 v 33 w(get)p 1341 3149 V 34 w(eqcolt)m(yp)s(e)d(is)f (similar)h(except)g(that)f(in)g(the)g(case)i(of)e(scaled)h(in)m(teger) 227 3262 y(columns)35 b(it)g(returns)f(the)h('equiv)-5 b(alen)m(t')37 b(data)f(t)m(yp)s(e)f(that)h(is)f(needed)f(to)i(store)g (the)f(scaled)h(v)-5 b(alues,)37 b(and)227 3374 y(not)28 b(necessarily)h(the)f(ph)m(ysical)g(data)g(t)m(yp)s(e)g(of)g(the)g (unscaled)f(v)-5 b(alues)29 b(as)e(stored)h(in)g(the)f(FITS)g(table.)41 b(F)-8 b(or)227 3487 y(example)38 b(if)g(a)g('1I')g(column)f(in)g(a)h (binary)f(table)h(has)g(TSCALn)d(=)j(1)f(and)g(TZER)m(On)f(=)i(32768,)j (then)227 3600 y(this)29 b(column)f(e\013ectiv)m(ely)k(con)m(tains)d (unsigned)f(short)g(in)m(teger)i(v)-5 b(alues,)29 b(and)f(th)m(us)h (the)f(returned)g(v)-5 b(alue)29 b(of)227 3713 y(t)m(yp)s(eco)s(de)34 b(will)f(b)s(e)g(TUSHOR)-8 b(T,)32 b(not)h(TSHOR)-8 b(T.)33 b(Similarly)-8 b(,)34 b(if)f(a)h(column)f(has)f(TTYPEn)g(=)h('1I')h (and)227 3826 y(TSCALn)29 b(=)h(0.12,)i(then)e(the)h(returned)e(t)m(yp) s(eco)s(de)i(will)f(b)s(e)g(TFLO)m(A)-8 b(T.)95 4121 y Fe(int)47 b(fits_get_coltype)d(/)j(ffgtcl)286 4233 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(>)j(int)f(*typecode,)e(long)h (*repeat,)334 4346 y(long)h(*width,)f(int)g(*status\))95 4572 y(int)h(fits_get_coltypell)c(/)48 b(ffgtclll)286 4685 y(\(fitsfile)e(*fptr,)g(int)h(colnum,)e(>)j(int)f(*typecode,)e (LONGLONG)g(*repeat,)334 4798 y(LONGLONG)h(*width,)f(int)i(*status\))95 5024 y(int)g(fits_get_eqcoltype)c(/)48 b(ffeqty)286 5137 y(\(fitsfile)e(*fptr,)g(int)h(colnum,)e(>)j(int)f(*typecode,)e(long)h (*repeat,)334 5250 y(long)h(*width,)f(int)g(*status\))95 5475 y(int)h(fits_get_eqcoltypell)c(/)k(ffeqtyll)286 5588 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(>)j(int)f(*typecode,)e (LONGLONG)g(*repeat,)334 5701 y(LONGLONG)h(*width,)f(int)i(*status\))p eop end %%Page: 55 63 TeXDict begin 55 62 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.55) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.7.)72 b(ASCI)s(I)29 b(AND)i(BINAR)-8 b(Y)31 b(T)-8 b(ABLE)31 b(R)m(OUTINES)1864 b Fj(55)0 555 y Fi(4)81 b Fj(Return)29 b(the)h(displa)m(y)g(width)f(of)h(a)h(column.)40 b(This)29 b(is)h(the)g(length)h(of)f(the)g(string)g(that)h(will)f(b)s(e)f (returned)g(b)m(y)227 668 y(the)34 b(\014ts)p 514 668 28 4 v 32 w(read)p 718 668 V 33 w(col)g(routine)f(when)f(reading)h(the) h(column)e(as)i(a)f(formatted)h(string.)49 b(The)32 b(displa)m(y)i (width)227 781 y(is)29 b(determined)g(b)m(y)g(the)g(TDISPn)f(k)m(eyw)m (ord,)i(if)f(presen)m(t,)h(otherwise)f(b)m(y)g(the)g(data)h(t)m(yp)s(e) f(of)h(the)f(column.)95 1125 y Fe(int)47 b(fits_get_col_display_width) 41 b(/)47 b(ffgcdw)286 1238 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(>)j (int)f(*dispwidth,)e(int)h(*status\))0 1470 y Fi(5)81 b Fj(Return)27 b(the)i(n)m(um)m(b)s(er)e(of)i(and)e(size)j(of)e(the)h (dimensions)f(of)g(a)h(table)g(column)g(in)f(a)g(binary)g(table.)41 b(Normally)227 1583 y(this)28 b(information)h(is)f(giv)m(en)h(b)m(y)f (the)h(TDIMn)f(k)m(eyw)m(ord,)h(but)e(if)i(this)f(k)m(eyw)m(ord)g(is)g (not)h(presen)m(t)f(then)g(this)227 1695 y(routine)j(returns)e(naxis)h (=)g(1)h(and)f(naxes[0])h(equal)g(to)g(the)g(rep)s(eat)f(coun)m(t)h(in) f(the)h(TF)m(ORM)g(k)m(eyw)m(ord.)95 1927 y Fe(int)47 b(fits_read_tdim)d(/)k(ffgtdm)286 2040 y(\(fitsfile)e(*fptr,)g(int)h (colnum,)e(int)i(maxdim,)f(>)i(int)f(*naxis,)334 2153 y(long)g(*naxes,)f(int)g(*status\))95 2378 y(int)h(fits_read_tdimll)d (/)j(ffgtdmll)286 2491 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(int)i (maxdim,)f(>)i(int)f(*naxis,)334 2604 y(LONGLONG)f(*naxes,)f(int)i (*status\))0 2836 y Fi(6)81 b Fj(Deco)s(de)33 b(the)g(input)f(TDIMn)h (k)m(eyw)m(ord)g(string)f(\(e.g.)50 b('\(100,200\)'\))37 b(and)32 b(return)g(the)h(n)m(um)m(b)s(er)e(of)i(and)f(size)227 2949 y(of)c(the)g(dimensions)f(of)h(a)g(binary)f(table)h(column.)40 b(If)27 b(the)h(input)f(tdimstr)g(c)m(haracter)i(string)f(is)g(n)m (ull,)g(then)227 3061 y(this)d(routine)f(returns)f(naxis)h(=)h(1)f(and) g(naxes[0])i(equal)e(to)i(the)e(rep)s(eat)h(coun)m(t)g(in)f(the)g(TF)m (ORM)h(k)m(eyw)m(ord.)227 3174 y(This)30 b(routine)g(is)h(called)g(b)m (y)f(\014ts)p 1350 3174 V 33 w(read)p 1555 3174 V 33 w(tdim.)95 3406 y Fe(int)47 b(fits_decode_tdim)d(/)j(ffdtdm)286 3519 y(\(fitsfile)f(*fptr,)g(char)g(*tdimstr,)g(int)h(colnum,)e(int)i (maxdim,)f(>)i(int)e(*naxis,)334 3632 y(long)h(*naxes,)f(int)g (*status\))95 3857 y(int)h(fits_decode_tdimll)c(/)48 b(ffdtdmll)286 3970 y(\(fitsfile)e(*fptr,)g(char)g(*tdimstr,)g(int)h (colnum,)e(int)i(maxdim,)f(>)i(int)e(*naxis,)334 4083 y(LONGLONG)g(*naxes,)f(int)i(*status\))0 4315 y Fi(7)81 b Fj(W)-8 b(rite)23 b(a)g(TDIMn)f(k)m(eyw)m(ord)h(whose)f(v)-5 b(alue)23 b(has)g(the)f(form)g('\(l,m,n...\)')40 b(where)22 b(l,)i(m,)g(n...)38 b(are)23 b(the)g(dimensions)227 4427 y(of)31 b(a)g(m)m(ultidimensional)g(arra)m(y)g(column)f(in)g(a)h (binary)e(table.)95 4659 y Fe(int)47 b(fits_write_tdim)d(/)j(ffptdm)286 4772 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(int)i(naxis,)f(long)h (*naxes,)f(>)h(int)g(*status\))95 4998 y(int)g(fits_write_tdimll)c(/)48 b(ffptdmll)286 5110 y(\(fitsfile)e(*fptr,)g(int)h(colnum,)e(int)i (naxis,)f(LONGLONG)g(*naxes,)g(>)h(int)g(*status\))0 5253 y SDict begin H.S end 0 5253 a 0 5253 a SDict begin 13.6 H.A end 0 5253 a 0 5253 a SDict begin [/View [/XYZ H.V]/Dest (subsection.5.7.3) cvn /DEST pdfmark end 0 5253 a 144 x Fd(5.7.3)112 b(Routines)38 b(to)f(Edit)g(Ro)m(ws)g(or)g(Columns)0 5601 y Fi(1)81 b Fj(Insert)32 b(or)h(delete)i(ro)m(ws)e(in)g(an)g(ASCI) s(I)f(or)h(binary)f(table.)50 b(When)33 b(inserting)h(ro)m(ws)f(all)h (the)f(ro)m(ws)g(follo)m(wing)227 5714 y(ro)m(w)24 b(FR)m(O)m(W)i(are)e (shifted)f(do)m(wn)h(b)m(y)g(NR)m(O)m(WS)g(ro)m(ws;)j(if)c(FR)m(O)m(W)j (=)d(0)i(then)e(the)h(blank)g(ro)m(ws)g(are)g(inserted)p eop end %%Page: 56 64 TeXDict begin 56 63 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.56) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(56)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)227 555 y Fj(at)h(the)e(b)s(eginning)g(of)h (the)f(table.)42 b(Note)31 b(that)f(it)g(is)f(*not*)i(necessary)f(to)g (insert)f(ro)m(ws)h(in)f(a)h(table)g(b)s(efore)227 668 y(writing)g(data)g(to)g(those)h(ro)m(ws)e(\(indeed,)h(it)g(w)m(ould)f (b)s(e)g(ine\016cien)m(t)i(to)f(do)g(so\).)41 b(Instead)29 b(one)h(ma)m(y)g(simply)227 781 y(write)h(data)g(to)g(an)m(y)g(ro)m(w)f (of)h(the)f(table,)i(whether)e(that)h(ro)m(w)f(of)h(data)g(already)g (exists)g(or)f(not.)227 933 y(The)40 b(\014rst)g(delete)i(routine)e (deletes)i(NR)m(O)m(WS)f(consecutiv)m(e)h(ro)m(ws)f(starting)g(with)f (ro)m(w)g(FIRSTR)m(O)m(W.)227 1046 y(The)d(second)g(delete)h(routine)f (tak)m(es)h(an)f(input)f(string)h(that)h(lists)f(the)g(ro)m(ws)g(or)g (ro)m(w)g(ranges)g(\(e.g.,)k('5-)227 1159 y(10,12,20-30'\),)32 b(whereas)26 b(the)g(third)g(delete)h(routine)f(tak)m(es)h(an)f(input)f (in)m(teger)j(arra)m(y)e(that)h(sp)s(eci\014es)f(eac)m(h)227 1272 y(individual)35 b(ro)m(w)h(to)g(b)s(e)f(deleted.)58 b(In)35 b(b)s(oth)f(latter)j(cases,)i(the)c(input)g(list)h(of)g(ro)m (ws)g(to)g(delete)h(m)m(ust)f(b)s(e)227 1385 y(sorted)i(in)g(ascending) g(order.)62 b(These)38 b(routines)f(up)s(date)g(the)h(NAXIS2)g(k)m(eyw) m(ord)h(to)f(re\015ect)g(the)g(new)227 1498 y(n)m(um)m(b)s(er)29 b(of)i(ro)m(ws)f(in)g(the)h(table.)95 1761 y Fe(int)47 b(fits_insert_rows)d(/)j(ffirow)286 1874 y(\(fitsfile)f(*fptr,)g (LONGLONG)f(firstrow,)h(LONGLONG)f(nrows,)h(>)i(int)f(*status\))95 2100 y(int)g(fits_delete_rows)d(/)j(ffdrow)286 2213 y(\(fitsfile)f (*fptr,)g(LONGLONG)f(firstrow,)h(LONGLONG)f(nrows,)h(>)i(int)f (*status\))95 2439 y(int)g(fits_delete_rowrange)c(/)k(ffdrrg)286 2552 y(\(fitsfile)f(*fptr,)g(char)g(*rangelist,)f(>)j(int)e(*status\)) 95 2778 y(int)h(fits_delete_rowlist)c(/)k(ffdrws)286 2891 y(\(fitsfile)f(*fptr,)g(long)g(*rowlist,)g(long)g(nrows,)g(>)i (int)f(*status\))95 3116 y(int)g(fits_delete_rowlistll)42 b(/)48 b(ffdrwsll)286 3229 y(\(fitsfile)e(*fptr,)g(LONGLONG)f (*rowlist,)h(LONGLONG)f(nrows,)h(>)i(int)f(*status\))0 3493 y Fi(2)81 b Fj(Insert)36 b(or)h(delete)i(column\(s\))e(in)g(an)g (ASCI)s(I)f(or)h(binary)f(table.)62 b(When)37 b(inserting,)i(COLNUM)e (sp)s(eci\014es)227 3606 y(the)28 b(column)g(n)m(um)m(b)s(er)f(that)h (the)g(\(\014rst\))g(new)f(column)h(should)f(o)s(ccup)m(y)h(in)g(the)g (table.)41 b(NCOLS)26 b(sp)s(eci\014es)227 3719 y(ho)m(w)35 b(man)m(y)g(columns)f(are)h(to)g(b)s(e)f(inserted.)53 b(An)m(y)35 b(existing)h(columns)e(from)g(this)h(p)s(osition)f(and)g (higher)227 3832 y(are)c(shifted)f(o)m(v)m(er)h(to)g(allo)m(w)g(ro)s (om)f(for)g(the)h(new)e(column\(s\).)41 b(The)29 b(index)f(n)m(um)m(b)s (er)g(on)h(all)h(the)f(follo)m(wing)227 3945 y(k)m(eyw)m(ords)34 b(will)f(b)s(e)g(incremen)m(ted)h(or)f(decremen)m(ted)h(if)f(necessary) h(to)g(re\015ect)g(the)f(new)g(p)s(osition)g(of)h(the)227 4057 y(column\(s\))26 b(in)f(the)h(table:)39 b(TBCOLn,)26 b(TF)m(ORMn,)h(TTYPEn,)e(TUNITn,)h(TNULLn,)g(TSCALn,)f(TZE-)227 4170 y(R)m(On,)43 b(TDISPn,)g(TDIMn,)g(TLMINn,)g(TLMAXn,)g(TDMINn,)g (TDMAXn,)h(TCTYPn,)e(TCRPXn,)227 4283 y(TCR)-10 b(VLn,)29 b(TCDL)-8 b(Tn,)30 b(TCR)m(OTn,)f(and)h(TCUNIn.)95 4547 y Fe(int)47 b(fits_insert_col)d(/)j(fficol)286 4660 y(\(fitsfile)f (*fptr,)g(int)h(colnum,)e(char)i(*ttype,)f(char)h(*tform,)334 4773 y(>)h(int)e(*status\))95 4999 y(int)h(fits_insert_cols)d(/)j (fficls)286 5111 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(int)i(ncols,)f (char)h(**ttype,)334 5224 y(char)g(**tform,)e(>)j(int)f(*status\))95 5450 y(int)g(fits_delete_col)d(/)j(ffdcol\(fitsfile)d(*fptr,)i(int)h (colnum,)f(>)h(int)g(*status\))0 5714 y Fi(3)81 b Fj(Cop)m(y)29 b(column\(s\))i(b)s(et)m(w)m(een)f(HDUs.)41 b(If)30 b(create)p 1783 5714 28 4 v 34 w(col)h(=)f(TR)m(UE,)g(then)f(new)h(column\(s\))g (will)g(b)s(e)g(inserted)f(in)p eop end %%Page: 57 65 TeXDict begin 57 64 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.57) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.7.)72 b(ASCI)s(I)29 b(AND)i(BINAR)-8 b(Y)31 b(T)-8 b(ABLE)31 b(R)m(OUTINES)1864 b Fj(57)227 555 y(the)35 b(output)g(table,)i (starting)f(at)g(p)s(osition)f(`outcolumn',)i(otherwise)f(the)f (existing)h(output)f(column\(s\))227 668 y(will)c(b)s(e)f(o)m(v)m (erwritten)i(\(in)e(whic)m(h)g(case)h(they)g(m)m(ust)f(ha)m(v)m(e)i(a)f (compatible)g(data)g(t)m(yp)s(e\).)227 823 y(The)43 b(\014rst)f(form)g (copies)i(a)f(single)h(column)e(incoln)m(um)h(to)h(outcoln)m(um.)79 b(Cop)m(ying)43 b(within)f(the)i(same)227 936 y(HDU)29 b(is)f(p)s(ermitted.)39 b(The)27 b(second)h(form)f(copies)i(ncols)f (columns)f(from)h(the)g(input,)f(starting)i(at)f(column)227 1049 y(incoln)m(um)34 b(to)h(the)f(output,)h(starting)g(at)g(outcoln)m (um.)52 b(F)-8 b(or)35 b(the)g(second)f(form,)g(the)h(input)e(and)g (output)227 1162 y(m)m(ust)e(b)s(e)e(di\013eren)m(t)i(HDUs.)227 1316 y(If)21 b(outcoln)m(um)h(is)f(greater)i(than)d(the)i(n)m(um)m(b)s (er)e(of)h(column)g(in)g(the)h(output)e(table,)25 b(then)20 b(the)i(new)f(column\(s\))227 1429 y(will)32 b(b)s(e)f(app)s(ended)f (to)j(the)f(end)f(of)g(the)h(table.)46 b(Note)33 b(that)f(the)g (\014rst)f(column)g(in)h(a)g(table)g(is)g(at)h(coln)m(um)227 1542 y(=)h(1.)51 b(The)33 b(standard)g(indexed)g(k)m(eyw)m(ords)h(that) g(related)h(to)f(the)g(columns)g(\(e.g.,)i(TDISPn,)e(TUNITn,)227 1655 y(TCRPXn,)c(TCDL)-8 b(Tn,)29 b(etc.\))43 b(will)30 b(also)i(b)s(e)d(copied.)95 1924 y Fe(int)47 b(fits_copy_col)e(/)i (ffcpcl)286 2037 y(\(fitsfile)f(*infptr,)f(fitsfile)h(*outfptr,)f(int)i (incolnum,)e(int)i(outcolnum,)334 2150 y(int)g(create_col,)e(>)i(int)g (*status\);)95 2376 y(int)g(fits_copy_cols)d(/)k(ffccls)286 2488 y(\(fitsfile)e(*infptr,)f(fitsfile)h(*outfptr,)f(int)i(incolnum,)e (int)i(outcolnum,)334 2601 y(int)g(ncols,)f(int)h(create_col,)e(>)i (int)g(*status\);)0 2870 y Fi(4)81 b Fj(Cop)m(y)30 b('nro)m(ws')g (consecutiv)m(e)j(ro)m(ws)d(from)g(one)h(table)g(to)g(another,)g(b)s (eginning)f(with)g(ro)m(w)g('\014rstro)m(w'.)41 b(These)227 2983 y(ro)m(ws)31 b(will)h(b)s(e)e(app)s(ended)g(to)i(an)m(y)f (existing)h(ro)m(ws)g(in)e(the)i(output)e(table.)44 b(Note)33 b(that)f(the)f(\014rst)f(ro)m(w)i(in)f(a)227 3096 y(table)h(is)e(at)h (ro)m(w)g(=)f(1.)95 3365 y Fe(int)47 b(fits_copy_rows)d(/)k(ffcprw)286 3478 y(\(fitsfile)e(*infptr,)f(fitsfile)h(*outfptr,)f(LONGLONG)h (firstrow,)334 3591 y(LONGLONG)g(nrows,)g(>)h(int)g(*status\);)0 3859 y Fi(5)81 b Fj(Mo)s(dify)37 b(the)g(v)m(ector)i(length)f(of)f(a)h (binary)e(table)i(column)f(\(e.g.,)k(c)m(hange)e(a)e(column)g(from)g (TF)m(ORMn)g(=)227 3972 y('1E')31 b(to)h('20E'\).)g(The)e(v)m(ector)i (length)e(ma)m(y)h(b)s(e)f(increased)h(or)f(decreased)h(from)f(the)g (curren)m(t)h(v)-5 b(alue.)95 4241 y Fe(int)47 b (fits_modify_vector_len)42 b(/)48 b(ffmvec)286 4354 y(\(fitsfile)e (*fptr,)g(int)h(colnum,)e(LONGLONG)h(newveclen,)f(>)i(int)g(*status\))0 4512 y SDict begin H.S end 0 4512 a 0 4512 a SDict begin 13.6 H.A end 0 4512 a 0 4512 a SDict begin [/View [/XYZ H.V]/Dest (subsection.5.7.4) cvn /DEST pdfmark end 0 4512 a 143 x Fd(5.7.4)112 b(Read)38 b(and)h(W)-9 b(rite)36 b(Column)j(Data)e (Routines)0 4876 y Fj(The)e(follo)m(wing)h(routines)g(write)f(or)g (read)g(data)h(v)-5 b(alues)36 b(in)f(the)g(curren)m(t)g(ASCI)s(I)f(or) h(binary)g(table)h(extension.)0 4989 y(If)d(a)g(write)g(op)s(eration)h (extends)f(b)s(ey)m(ond)f(the)h(curren)m(t)g(size)h(of)f(the)g(table,)i (then)e(the)g(n)m(um)m(b)s(er)f(of)h(ro)m(ws)g(in)g(the)0 5102 y(table)i(will)g(automatically)i(b)s(e)c(increased)i(and)e(the)i (NAXIS2)f(k)m(eyw)m(ord)h(v)-5 b(alue)35 b(will)f(b)s(e)g(up)s(dated.) 51 b(A)m(ttempts)0 5215 y(to)31 b(read)f(b)s(ey)m(ond)g(the)h(end)e(of) i(the)f(table)i(will)e(result)h(in)f(an)g(error.)0 5375 y(Automatic)37 b(data)e(t)m(yp)s(e)g(con)m(v)m(ersion)i(is)e(p)s (erformed)e(for)i(n)m(umerical)g(data)h(t)m(yp)s(es)f(\(only\))h(if)f (the)g(data)h(t)m(yp)s(e)f(of)0 5488 y(the)43 b(column)f(\(de\014ned)f (b)m(y)h(the)h(TF)m(ORMn)f(k)m(eyw)m(ord\))h(di\013ers)f(from)g(the)g (data)h(t)m(yp)s(e)g(of)f(the)h(arra)m(y)g(in)f(the)0 5601 y(calling)k(routine.)84 b(ASCI)s(I)43 b(and)h(binary)g(tables)h (supp)s(ort)e(the)i(follo)m(wing)h(data)f(t)m(yp)s(e)g(v)-5 b(alues:)70 b(TSTRING,)0 5714 y(TBYTE,)35 b(TSBYTE,)f(TSHOR)-8 b(T,)33 b(TUSHOR)-8 b(T,)34 b(TINT,)h(TUINT,)f(TLONG,)g(TLONGLONG,)h (TULONG,)p eop end %%Page: 58 66 TeXDict begin 58 65 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.58) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(58)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 555 y Fj(TULONGLONG,)42 b(TFLO)m(A)-8 b(T,)43 b(or)f(TDOUBLE.)h(Binary)f(tables)h(also)g(supp)s(ort)d (TLOGICAL)i(\(in)m(ternally)0 668 y(mapp)s(ed)29 b(to)i(the)g(`c)m (har')g(data)g(t)m(yp)s(e\),)g(TCOMPLEX,)f(and)g(TDBLCOMPLEX.)0 828 y(Note)c(that)g(it)g(is)f(*not*)h(necessary)f(to)h(insert)f(ro)m (ws)g(in)g(a)g(table)h(b)s(efore)f(writing)g(data)h(to)g(those)f(ro)m (ws)g(\(indeed,)h(it)0 941 y(w)m(ould)h(b)s(e)g(ine\016cien)m(t)i(to)f (do)f(so\).)41 b(Instead,)28 b(one)g(ma)m(y)g(simply)f(write)g(data)h (to)h(an)m(y)e(ro)m(w)h(of)g(the)f(table,)j(whether)0 1054 y(that)h(ro)m(w)f(of)h(data)g(already)g(exists)g(or)f(not.)0 1214 y(Individual)g(bits)i(in)f(a)h(binary)e(table)i('X')g(or)g('B')g (column)f(ma)m(y)h(b)s(e)f(read/written)h(to/from)g(a)g(*c)m(har)g (arra)m(y)g(b)m(y)0 1327 y(sp)s(ecifying)k(the)f(TBIT)h(datat)m(yp)s (e.)57 b(The)35 b(*c)m(har)i(arra)m(y)f(will)g(b)s(e)f(in)m(terpreted)h (as)g(an)g(arra)m(y)g(of)g(logical)i(TR)m(UE)0 1440 y(\(1\))d(or)g(F) -10 b(ALSE)34 b(\(0\))h(v)-5 b(alues)35 b(that)g(corresp)s(ond)e(to)i (the)g(v)-5 b(alue)35 b(of)f(eac)m(h)i(bit)e(in)g(the)h(FITS)e('X')i (or)g('B')g(column.)0 1553 y(Alternativ)m(ely)-8 b(,)30 b(the)c(v)-5 b(alues)27 b(in)e(a)i(binary)e(table)i('X')g(column)f(ma)m (y)h(b)s(e)e(read/written)i(8)f(bits)g(at)h(a)f(time)h(to/from)0 1666 y(an)j(arra)m(y)h(of)g(8-bit)g(in)m(tegers)g(b)m(y)g(sp)s (ecifying)f(the)h(TBYTE)f(datat)m(yp)s(e.)0 1826 y(Note)25 b(that)g(within)e(the)h(con)m(text)i(of)e(these)g(routines,)i(the)e (TSTRING)f(data)h(t)m(yp)s(e)g(corresp)s(onds)f(to)h(a)h(C)e('c)m (har**')0 1939 y(data)35 b(t)m(yp)s(e,)h(i.e.,)h(a)e(p)s(oin)m(ter)f (to)i(an)e(arra)m(y)h(of)g(p)s(oin)m(ters)f(to)h(an)g(arra)m(y)g(of)g (c)m(haracters.)54 b(This)34 b(is)g(di\013eren)m(t)h(from)0 2052 y(the)d(k)m(eyw)m(ord)h(reading)f(and)f(writing)h(routines)g (where)g(TSTRING)f(corresp)s(onds)g(to)h(a)h(C)e('c)m(har*')j(data)f(t) m(yp)s(e,)0 2165 y(i.e.,)g(a)e(single)h(p)s(oin)m(ter)f(to)h(an)f(arra) m(y)g(of)g(c)m(haracters.)45 b(When)30 b(reading)i(strings)e(from)h(a)g (table,)i(the)e(c)m(har)h(arra)m(ys)0 2278 y(ob)m(viously)f(m)m(ust)f (ha)m(v)m(e)i(b)s(een)e(allo)s(cated)i(long)f(enough)f(to)h(hold)f(the) h(whole)f(FITS)g(table)h(string.)0 2438 y(Numerical)i(data)g(v)-5 b(alues)33 b(are)g(automatically)j(scaled)d(b)m(y)f(the)h(TSCALn)e(and) h(TZER)m(On)f(k)m(eyw)m(ord)i(v)-5 b(alues)33 b(\(if)0 2551 y(they)e(exist\).)0 2711 y(In)25 b(the)g(case)i(of)e(binary)g (tables)h(with)f(v)m(ector)i(elemen)m(ts,)h(the)e('felem')g(parameter)g (de\014nes)f(the)g(starting)h(elemen)m(t)0 2824 y(\(b)s(eginning)h (with)g(1,)h(not)g(0\))g(within)f(the)g(cell)i(\(a)f(cell)g(is)f (de\014ned)f(as)i(the)f(in)m(tersection)i(of)f(a)f(ro)m(w)h(and)e(a)i (column)0 2937 y(and)e(ma)m(y)h(con)m(tain)h(a)g(single)f(v)-5 b(alue)27 b(or)g(a)g(v)m(ector)h(of)f(v)-5 b(alues\).)40 b(The)26 b(felem)i(parameter)f(is)g(ignored)f(when)g(dealing)0 3050 y(with)34 b(ASCI)s(I)e(tables.)52 b(Similarly)-8 b(,)36 b(in)d(the)i(case)f(of)h(binary)e(tables)h(the)h('nelemen)m(ts') g(parameter)f(sp)s(eci\014es)g(the)0 3163 y(total)28 b(n)m(um)m(b)s(er)d(of)h(v)m(ector)i(v)-5 b(alues)27 b(to)g(b)s(e)e(read)h(or)h(written)f(\(con)m(tin)m(uing)i(on)e (subsequen)m(t)f(ro)m(ws)i(if)f(required\))g(and)0 3275 y(not)31 b(the)f(n)m(um)m(b)s(er)f(of)i(table)g(cells.)0 3524 y Fi(1)81 b Fj(W)-8 b(rite)31 b(elemen)m(ts)h(in)m(to)f(an)g(ASCI) s(I)e(or)h(binary)f(table)j(column.)0 3772 y(The)38 b(\014rst)f (routine)h(simply)g(writes)g(the)g(arra)m(y)h(of)f(v)-5 b(alues)39 b(to)g(the)f(FITS)g(\014le)g(\(doing)g(data)h(t)m(yp)s(e)g (con)m(v)m(ersion)0 3885 y(if)h(necessary\))h(whereas)f(the)h(second)f (routine)h(will)f(substitute)h(the)f(appropriate)g(FITS)g(n)m(ull)g(v) -5 b(alue)41 b(for)f(all)0 3998 y(elemen)m(ts)34 b(whic)m(h)f(are)g (equal)h(to)f(the)g(input)f(v)-5 b(alue)34 b(of)f(n)m(ulv)-5 b(al)33 b(\(note)h(that)f(this)g(parameter)g(giv)m(es)i(the)e(address)0 4111 y(of)40 b(n)m(ulv)-5 b(al,)44 b(not)c(the)g(n)m(ull)g(v)-5 b(alue)41 b(itself)7 b(\).)72 b(F)-8 b(or)40 b(in)m(teger)i(columns)e (the)g(FITS)g(n)m(ull)g(v)-5 b(alue)40 b(is)h(de\014ned)e(b)m(y)h(the)0 4224 y(TNULLn)32 b(k)m(eyw)m(ord)i(\(an)g(error)e(is)i(returned)e(if)h (the)h(k)m(eyw)m(ord)f(do)s(esn't)g(exist\).)51 b(F)-8 b(or)34 b(\015oating)g(p)s(oin)m(t)f(columns)0 4337 y(the)h(sp)s(ecial) h(IEEE)f(NaN)h(\(Not-a-Num)m(b)s(er\))h(v)-5 b(alue)35 b(will)f(b)s(e)g(written)g(in)m(to)i(the)e(FITS)g(\014le.)52 b(If)34 b(a)h(n)m(ull)f(p)s(oin)m(ter)0 4449 y(is)f(en)m(tered)g(for)g (n)m(ulv)-5 b(al,)34 b(then)f(the)g(n)m(ull)g(v)-5 b(alue)33 b(is)g(ignored)g(and)g(this)g(routine)f(b)s(eha)m(v)m(es)i(the)f(same)g (as)h(the)f(\014rst)0 4562 y(routine.)41 b(The)29 b(third)g(routine)h (simply)f(writes)h(unde\014ned)d(pixel)k(v)-5 b(alues)30 b(to)g(the)g(column.)41 b(The)29 b(fourth)g(routine)0 4675 y(\014lls)e(ev)m(ery)i(column)e(in)h(the)g(table)g(with)g(n)m(ull) f(v)-5 b(alues,)29 b(in)e(the)h(sp)s(eci\014ed)f(ro)m(ws)h(\(ignoring)g (an)m(y)g(columns)g(that)g(do)0 4788 y(not)j(ha)m(v)m(e)g(a)g (de\014ned)e(n)m(ull)h(v)-5 b(alue\).)95 5036 y Fe(int)47 b(fits_write_col)d(/)k(ffpcl)286 5149 y(\(fitsfile)e(*fptr,)g(int)h (datatype,)e(int)i(colnum,)f(LONGLONG)f(firstrow,)334 5262 y(LONGLONG)h(firstelem,)f(LONGLONG)g(nelements,)g(DTYPE)i(*array,) e(>)j(int)f(*status\))95 5488 y(int)g(fits_write_colnull)c(/)48 b(ffpcn)286 5601 y(\(fitsfile)e(*fptr,)g(int)h(datatype,)e(int)i (colnum,)f(LONGLONG)f(firstrow,)286 5714 y(LONGLONG)h(firstelem,)f (LONGLONG)g(nelements,)g(DTYPE)i(*array,)f(DTYPE)g(*nulval,)p eop end %%Page: 59 67 TeXDict begin 59 66 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.59) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.7.)72 b(ASCI)s(I)29 b(AND)i(BINAR)-8 b(Y)31 b(T)-8 b(ABLE)31 b(R)m(OUTINES)1864 b Fj(59)286 555 y Fe(>)48 b(int)f(*status\))143 781 y(int)g(fits_write_col_null)c(/)k(ffpclu)334 894 y(\(fitsfile)e(*fptr,)h(int)h(colnum,)f(LONGLONG)g(firstrow,)f (LONGLONG)h(firstelem,)382 1007 y(LONGLONG)f(nelements,)g(>)j(int)f (*status\))143 1233 y(int)g(fits_write_nullrows)c(/)k(ffprwu)334 1346 y(\(fitsfile)e(*fptr,)h(LONGLONG)g(firstrow,)f(LONGLONG)h (nelements,)f(>)i(int)g(*status\))0 1577 y Fi(2)81 b Fj(Read)33 b(elemen)m(ts)i(from)e(an)g(ASCI)s(I)f(or)i(binary)e(table)i (column.)50 b(The)33 b(data)h(t)m(yp)s(e)g(parameter)g(sp)s(eci\014es)f (the)227 1690 y(data)28 b(t)m(yp)s(e)g(of)g(the)f(`n)m(ulv)-5 b(al')29 b(and)e(`arra)m(y')h(p)s(oin)m(ters;)h(Unde\014ned)c(arra)m(y) j(elemen)m(ts)h(will)f(b)s(e)f(returned)f(with)227 1802 y(a)k(v)-5 b(alue)30 b(=)e(*n)m(ullv)-5 b(al,)31 b(\(note)f(that)g (this)f(parameter)h(giv)m(es)g(the)g(address)e(of)h(the)h(n)m(ull)f(v) -5 b(alue,)30 b(not)g(the)f(n)m(ull)227 1915 y(v)-5 b(alue)31 b(itself)7 b(\))32 b(unless)e(n)m(ulv)-5 b(al)32 b(=)e(0)h(or)g(*n)m (ulv)-5 b(al)31 b(=)g(0,)g(in)f(whic)m(h)h(case)h(no)e(c)m(hec)m(king)j (for)d(unde\014ned)f(pixels)227 2028 y(will)34 b(b)s(e)f(p)s(erformed.) 48 b(The)33 b(second)g(routine)h(is)f(similar)h(except)g(that)g(an)m(y) g(unde\014ned)d(pixels)j(will)g(ha)m(v)m(e)227 2141 y(the)d(corresp)s (onding)e(n)m(ullarra)m(y)i(elemen)m(t)h(set)f(equal)g(to)g(TR)m(UE)f (\(=)h(1\).)227 2287 y(An)m(y)c(column,)g(regardless)f(of)g(it's)h(in)m (trinsic)g(data)g(t)m(yp)s(e,)g(ma)m(y)g(b)s(e)e(read)i(as)f(a)g (string.)40 b(It)26 b(should)f(b)s(e)h(noted)227 2400 y(ho)m(w)m(ev)m(er)32 b(that)f(reading)f(a)h(n)m(umeric)f(column)g(as)h (a)g(string)f(is)g(10)i(-)e(100)i(times)f(slo)m(w)m(er)g(than)f (reading)h(the)227 2513 y(same)22 b(column)g(as)f(a)h(n)m(um)m(b)s(er)e (due)h(to)i(the)e(large)i(o)m(v)m(erhead)g(in)e(constructing)h(the)g (formatted)g(strings.)37 b(The)227 2625 y(displa)m(y)26 b(format)g(of)f(the)h(returned)e(strings)h(will)h(b)s(e)f(determined)g (b)m(y)g(the)h(TDISPn)e(k)m(eyw)m(ord,)j(if)e(it)h(exists,)227 2738 y(otherwise)32 b(b)m(y)f(the)g(data)h(t)m(yp)s(e)f(of)g(the)g (column.)43 b(The)30 b(length)i(of)f(the)g(returned)f(strings)h(\(not)g (including)227 2851 y(the)26 b(n)m(ull)f(terminating)i(c)m(haracter\))g (can)f(b)s(e)f(determined)g(with)g(the)h(\014ts)p 2703 2851 28 4 v 32 w(get)p 2855 2851 V 34 w(col)p 2999 2851 V 34 w(displa)m(y)p 3311 2851 V 33 w(width)f(routine.)227 2964 y(The)30 b(follo)m(wing)i(TDISPn)d(displa)m(y)i(formats)f(are)h (curren)m(tly)f(supp)s(orted:)418 3181 y Fe(Iw.m)142 b(Integer)418 3293 y(Ow.m)g(Octal)47 b(integer)418 3406 y(Zw.m)142 b(Hexadecimal)45 b(integer)418 3519 y(Fw.d)142 b(Fixed)47 b(floating)e(point)418 3632 y(Ew.d)142 b(Exponential)45 b(floating)h(point)418 3745 y(Dw.d)142 b(Exponential)45 b(floating)h(point)418 3858 y(Gw.d)142 b(General;)46 b(uses)g(Fw.d)h(if)g(significance)e(not)i(lost,)f(else)h(Ew.d)227 4074 y Fj(where)24 b(w)h(is)f(the)h(width)f(in)g(c)m(haracters)i(of)f (the)g(displa)m(y)m(ed)g(v)-5 b(alues,)27 b(m)d(is)h(the)f(minim)m(um)g (n)m(um)m(b)s(er)g(of)g(digits)227 4187 y(displa)m(y)m(ed,)29 b(and)e(d)g(is)h(the)f(n)m(um)m(b)s(er)g(of)g(digits)i(to)f(the)g(righ) m(t)g(of)f(the)h(decimal.)41 b(The)27 b(.m)g(\014eld)g(is)h(optional.) 95 4418 y Fe(int)47 b(fits_read_col)e(/)i(ffgcv)286 4531 y(\(fitsfile)f(*fptr,)g(int)h(datatype,)e(int)i(colnum,)f(LONGLONG)f (firstrow,)g(LONGLONG)h(firstelem,)334 4644 y(LONGLONG)g(nelements,)f (DTYPE)h(*nulval,)g(DTYPE)g(*array,)g(int)h(*anynul,)e(int)i(*status\)) 95 4870 y(int)g(fits_read_colnull)c(/)48 b(ffgcf)286 4983 y(\(fitsfile)e(*fptr,)g(int)h(datatype,)e(int)i(colnum,)f (LONGLONG)f(firstrow,)g(LONGLONG)h(firstelem,)286 5096 y(LONGLONG)g(nelements,)f(DTYPE)h(*array,)g(char)h(*nullarray,)d(int)j (*anynul,)f(int)h(*status\))0 5239 y SDict begin H.S end 0 5239 a 0 5239 a SDict begin 13.6 H.A end 0 5239 a 0 5239 a SDict begin [/View [/XYZ H.V]/Dest (subsection.5.7.5) cvn /DEST pdfmark end 0 5239 a 143 x Fd(5.7.5)112 b(Ro)m(w)37 b(Selection)h(and)h(Calculator)f(Routines)0 5601 y Fj(These)21 b(routines)f(all)i(parse)f(and)f(ev)-5 b(aluate)23 b(an)d(input)g (string)h(con)m(taining)i(a)e(user)f(de\014ned)g(arithmetic)i (expression.)0 5714 y(The)29 b(\014rst)f(3)i(routines)f(select)i(ro)m (ws)e(in)g(a)h(FITS)e(table,)j(based)e(on)g(whether)g(the)g(expression) g(ev)-5 b(aluates)31 b(to)f(true)p eop end %%Page: 60 68 TeXDict begin 60 67 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.60) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(60)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 555 y Fj(\(not)e(equal)f(to)h(zero\))g(or)f (false)h(\(zero\).)41 b(The)27 b(other)g(routines)g(ev)-5 b(aluate)29 b(the)e(expression)g(and)f(calculate)k(a)d(v)-5 b(alue)0 668 y(for)26 b(eac)m(h)i(ro)m(w)f(of)g(the)g(table.)40 b(The)26 b(allo)m(w)m(ed)j(expression)d(syn)m(tax)i(is)e(describ)s(ed)g (in)g(the)h(ro)m(w)g(\014lter)g(section)g(in)g(the)0 781 y(`Extended)32 b(File)h(Name)g(Syn)m(tax')g(c)m(hapter)g(of)f(this) g(do)s(cumen)m(t.)46 b(The)32 b(expression)g(ma)m(y)h(also)g(b)s(e)e (written)i(to)g(a)0 894 y(text)h(\014le,)h(and)e(the)h(name)f(of)h(the) f(\014le,)i(prep)s(ended)c(with)i(a)h('@')g(c)m(haracter)h(ma)m(y)f(b)s (e)f(supplied)f(for)h(the)h('expr')0 1007 y(parameter)d(\(e.g.)42 b('@\014lename.txt'\).)g(The)30 b(expression)g(in)g(the)g(\014le)h(can) f(b)s(e)g(arbitrarily)g(complex)h(and)f(extend)0 1120 y(o)m(v)m(er)35 b(m)m(ultiple)g(lines)g(of)f(the)g(\014le.)53 b(Lines)33 b(that)i(b)s(egin)f(with)g(2)g(slash)g(c)m(haracters)i (\('//'\))g(will)f(b)s(e)e(ignored)i(and)0 1233 y(ma)m(y)c(b)s(e)f (used)f(to)i(add)f(commen)m(ts)h(to)h(the)e(\014le.)0 1492 y Fi(1)81 b Fj(Ev)-5 b(aluate)38 b(a)f(b)s(o)s(olean)g(expression) g(o)m(v)m(er)h(the)g(indicated)f(ro)m(ws,)i(returning)d(an)h(arra)m(y)h (of)f(\015ags)g(indicating)227 1605 y(whic)m(h)31 b(ro)m(ws)g(ev)-5 b(aluated)32 b(to)f(TR)m(UE/F)-10 b(ALSE.)31 b(Up)s(on)f(return,)g(*n)p 2518 1605 28 4 v 33 w(go)s(o)s(d)p 2743 1605 V 33 w(ro)m(ws)g(con)m (tains)i(the)f(n)m(um)m(b)s(er)f(of)227 1718 y(ro)m(ws)h(that)g(ev)-5 b(aluate)32 b(to)f(TR)m(UE.)95 1978 y Fe(int)47 b(fits_find_rows)d(/)k (fffrow)286 2090 y(\(fitsfile)e(*fptr,)93 b(char)47 b(*expr,)f(long)h (firstrow,)e(long)i(nrows,)286 2203 y(>)h(long)e(*n_good_rows,)f(char)h (*row_status,)92 b(int)47 b(*status\))0 2463 y Fi(2)81 b Fj(Find)29 b(the)i(\014rst)f(ro)m(w)g(whic)m(h)g(satis\014es)h(the)g (input)e(b)s(o)s(olean)h(expression)95 2722 y Fe(int)47 b(fits_find_first_row)c(/)k(ffffrw)286 2835 y(\(fitsfile)f(*fptr,)93 b(char)47 b(*expr,)f(>)i(long)e(*rownum,)g(int)h(*status\))0 3095 y Fi(3)81 b Fj(Ev)-5 b(aluate)35 b(an)f(expression)h(on)f(all)h (ro)m(ws)g(of)f(a)h(table.)54 b(If)34 b(the)g(input)g(and)g(output)g (\014les)g(are)h(not)g(the)f(same,)227 3208 y(cop)m(y)i(the)g(TR)m(UE)f (ro)m(ws)g(to)h(the)f(output)g(\014le;)j(if)d(the)g(output)g(table)h (is)f(not)h(empt)m(y)-8 b(,)37 b(then)e(this)g(routine)227 3321 y(will)28 b(app)s(end)e(the)i(new)f(selected)i(ro)m(ws)e(after)h (the)g(existing)h(ro)m(ws.)39 b(If)27 b(the)h(\014les)g(are)f(the)h (same,)h(delete)g(the)227 3434 y(F)-10 b(ALSE)30 b(ro)m(ws)h(\(preserv) m(e)f(the)h(TR)m(UE)f(ro)m(ws\).)95 3693 y Fe(int)47 b(fits_select_rows)d(/)j(ffsrow)286 3806 y(\(fitsfile)f(*infptr,)f (fitsfile)h(*outfptr,)93 b(char)46 b(*expr,)94 b(>)48 b(int)f(*status)e(\))0 4066 y Fi(4)81 b Fj(Calculate)28 b(an)f(expression)f(for)h(the)f(indicated)i(ro)m(ws)e(of)h(a)g(table,)i (returning)d(the)h(results,)g(cast)h(as)f(datat)m(yp)s(e)227 4179 y(\(TSHOR)-8 b(T,)32 b(TDOUBLE,)h(etc\),)h(in)e(arra)m(y)-8 b(.)48 b(If)31 b(n)m(ulv)-5 b(al==NULL,)33 b(UNDEFs)g(will)f(b)s(e)g (zero)s(ed)g(out.)47 b(F)-8 b(or)227 4292 y(v)m(ector)37 b(results,)f(the)f(n)m(um)m(b)s(er)e(of)i(elemen)m(ts)i(returned)c(ma)m (y)j(b)s(e)e(less)h(than)g(nelemen)m(ts)g(if)g(nelemen)m(ts)h(is)227 4404 y(not)c(an)g(ev)m(en)h(m)m(ultiple)f(of)g(the)g(result)g (dimension.)44 b(Call)33 b(\014ts)p 2392 4404 V 32 w(test)p 2570 4404 V 34 w(expr)e(to)h(obtain)h(the)f(dimensions)f(of)227 4517 y(the)g(results.)95 4777 y Fe(int)47 b(fits_calc_rows)d(/)k (ffcrow)286 4890 y(\(fitsfile)e(*fptr,)93 b(int)47 b(datatype,)f(char)g (*expr,)g(long)h(firstrow,)334 5003 y(long)g(nelements,)e(void)h (*nulval,)g(>)h(void)g(*array,)94 b(int)46 b(*anynul,)g(int)h (*status\))0 5262 y Fi(5)81 b Fj(Ev)-5 b(aluate)33 b(an)g(expression)f (and)h(write)f(the)h(result)g(either)g(to)h(a)f(column)f(\(if)h(the)g (expression)f(is)h(a)g(function)227 5375 y(of)d(other)g(columns)g(in)f (the)h(table\))h(or)f(to)g(a)h(k)m(eyw)m(ord)f(\(if)g(the)g(expression) f(ev)-5 b(aluates)32 b(to)e(a)g(constan)m(t)i(and)227 5488 y(is)f(not)f(a)h(function)f(of)h(other)f(columns)h(in)f(the)g (table\).)42 b(In)30 b(the)h(former)e(case,)j(the)f(parName)f (parameter)227 5601 y(is)40 b(the)g(name)f(of)h(the)g(column)f(\(whic)m (h)h(ma)m(y)g(or)f(ma)m(y)h(not)g(already)g(exist\))h(in)m(to)f(whic)m (h)g(to)g(write)g(the)227 5714 y(results,)e(and)f(parInfo)e(con)m (tains)j(an)f(optional)g(TF)m(ORM)g(k)m(eyw)m(ord)g(v)-5 b(alue)38 b(if)e(a)h(new)f(column)h(is)f(b)s(eing)p eop end %%Page: 61 69 TeXDict begin 61 68 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.61) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.7.)72 b(ASCI)s(I)29 b(AND)i(BINAR)-8 b(Y)31 b(T)-8 b(ABLE)31 b(R)m(OUTINES)1864 b Fj(61)227 555 y(created.)42 b(If)28 b(a)h(TF)m(ORM)h(v)-5 b(alue)29 b(is)g(not)g(sp)s(eci\014ed)g(then)f(a) i(default)f(format)g(will)h(b)s(e)e(used,)h(dep)s(ending)e(on)227 668 y(the)35 b(expression.)54 b(If)34 b(the)h(expression)f(ev)-5 b(aluates)37 b(to)e(a)g(constan)m(t,)i(then)e(the)g(result)f(will)h(b)s (e)f(written)h(to)227 781 y(the)28 b(k)m(eyw)m(ord)g(name)f(giv)m(en)h (b)m(y)g(the)f(parName)h(parameter,)h(and)d(the)i(parInfo)e(parameter)i (ma)m(y)g(b)s(e)f(used)227 894 y(to)k(supply)e(an)h(optional)i(commen)m (t)f(for)f(the)g(k)m(eyw)m(ord.)42 b(If)29 b(the)i(k)m(eyw)m(ord)g(do)s (es)f(not)g(already)h(exist,)g(then)227 1007 y(the)f(name)f(of)h(the)g (k)m(eyw)m(ord)g(m)m(ust)f(b)s(e)g(preceded)g(with)g(a)h('#')f(c)m (haracter,)j(otherwise)e(the)f(result)h(will)g(b)s(e)227 1120 y(written)h(to)g(a)g(column)f(with)g(that)h(name.)95 1362 y Fe(int)47 b(fits_calculator)d(/)j(ffcalc)286 1475 y(\(fitsfile)f(*infptr,)f(char)i(*expr,)f(fitsfile)f(*outfptr,)h(char)g (*parName,)334 1588 y(char)h(*parInfo,)e(>)95 b(int)47 b(*status\))0 1831 y Fi(6)81 b Fj(This)38 b(calculator)k(routine)e(is)f (similar)h(to)g(the)g(previous)f(routine,)j(except)f(that)f(the)g (expression)f(is)h(only)227 1944 y(ev)-5 b(aluated)42 b(o)m(v)m(er)f(the)f(sp)s(eci\014ed)g(ro)m(w)g(ranges.)70 b(nranges)39 b(sp)s(eci\014es)h(the)g(n)m(um)m(b)s(er)f(of)h(ro)m(w)h (ranges,)i(and)227 2057 y(\014rstro)m(w)30 b(and)g(lastro)m(w)h(giv)m (e)h(the)f(starting)g(and)f(ending)g(ro)m(w)g(n)m(um)m(b)s(er)f(of)i (eac)m(h)g(range.)95 2299 y Fe(int)47 b(fits_calculator_rng)c(/)k (ffcalc_rng)286 2412 y(\(fitsfile)f(*infptr,)f(char)i(*expr,)f (fitsfile)f(*outfptr,)h(char)g(*parName,)334 2525 y(char)h(*parInfo,)e (int)i(nranges,)e(long)i(*firstrow,)e(long)i(*lastrow)334 2638 y(>)95 b(int)47 b(*status\))0 2881 y Fi(7)81 b Fj(Ev)-5 b(aluate)36 b(the)f(giv)m(en)h(expression)f(and)g(return)f(dimension)g (and)h(t)m(yp)s(e)g(information)g(on)g(the)h(result.)54 b(The)227 2994 y(returned)37 b(dimensions)f(corresp)s(ond)g(to)j(a)e (single)i(ro)m(w)e(en)m(try)h(of)f(the)h(requested)f(expression,)j(and) d(are)227 3106 y(equiv)-5 b(alen)m(t)26 b(to)f(the)g(result)f(of)g (\014ts)p 1380 3106 28 4 v 33 w(read)p 1585 3106 V 32 w(tdim\(\).)40 b(Note)25 b(that)g(strings)f(are)h(considered)f(to)h(b)s (e)f(one)g(elemen)m(t)227 3219 y(regardless)31 b(of)g(string)f(length.) 41 b(If)30 b(maxdim)g(==)g(0,)h(then)f(naxes)g(is)h(optional.)95 3462 y Fe(int)47 b(fits_test_expr)d(/)k(fftexp)286 3575 y(\(fitsfile)e(*fptr,)g(char)g(*expr,)g(int)h(maxdim)f(>)i(int)f (*datatype,)e(long)h(*nelem,)g(int)h(*naxis,)334 3688 y(long)g(*naxes,)f(int)g(*status\))0 3833 y SDict begin H.S end 0 3833 a 0 3833 a SDict begin 13.6 H.A end 0 3833 a 0 3833 a SDict begin [/View [/XYZ H.V]/Dest (subsection.5.7.6) cvn /DEST pdfmark end 0 3833 a 143 x Fd(5.7.6)112 b(Column)39 b(Binning)f(or)f(Histogramming)i(Routines)0 4195 y Fj(The)30 b(follo)m(wing)j(routines)e(ma)m(y)g(b)s(e)g(useful)f (when)g(p)s(erforming)g(histogramming)h(op)s(erations)h(on)e (column\(s\))i(of)0 4308 y(a)f(table)g(to)g(generate)h(an)e(image)i(in) e(a)h(primary)e(arra)m(y)i(or)f(image)i(extension.)0 4550 y Fi(1)81 b Fj(Calculate)27 b(the)e(histogramming)h(parameters)g (\(min,)h(max,)f(and)f(bin)g(size)h(for)f(eac)m(h)i(axis)f(of)f(the)h (histogram,)227 4663 y(based)38 b(on)g(a)g(v)-5 b(ariet)m(y)39 b(of)f(p)s(ossible)g(input)f(parameters.)64 b(If)37 b(the)h(input)f (names)h(of)g(the)g(columns)g(to)h(b)s(e)227 4776 y(binned)d(are)i(n)m (ull,)h(then)e(the)h(routine)f(will)h(\014rst)f(lo)s(ok)h(for)f(the)h (CPREF)f(=)g("NAME1,)j(NAME2,)h(...")227 4889 y(k)m(eyw)m(ord)34 b(whic)m(h)f(lists)h(the)g(preferred)e(columns.)50 b(If)32 b(not)i(presen)m(t,)h(then)e(the)g(routine)h(will)g(assume)f(the)227 5002 y(column)d(names)h(X,)f(Y,)h(Z,)f(and)g(T)g(for)g(up)g(to)h(4)f (axes)h(\(as)g(sp)s(eci\014ed)f(b)m(y)g(the)h(NAXIS)f(parameter\).)227 5149 y(MININ)39 b(and)f(MAXIN)h(are)g(input)e(arra)m(ys)i(that)g(giv)m (e)h(the)f(minim)m(um)e(and)h(maxim)m(um)h(v)-5 b(alue)39 b(for)f(the)227 5262 y(histogram,)30 b(along)f(eac)m(h)g(axis.)40 b(Alternativ)m(ely)-8 b(,)32 b(the)c(name)g(of)h(k)m(eyw)m(ords)f(that) h(giv)m(e)g(the)f(min,)h(max,)g(and)227 5375 y(binsize)f(ma)m(y)g(b)s (e)f(giv)m(e)h(with)f(the)h(MINNAME,)h(MAXNAME,)f(and)f(BINNAME)h(arra) m(y)g(parameters.)40 b(If)227 5488 y(the)33 b(v)-5 b(alue)34 b(=)e(DOUBLENULL)-10 b(V)g(ALUE)33 b(and)g(no)f(k)m(eyw)m(ord)i(names)e (are)h(giv)m(en,)i(then)e(the)g(routine)g(will)227 5601 y(use)i(the)f(TLMINn)g(and)g(TLMAXn)g(k)m(eyw)m(ords,)j(if)d(presen)m (t,)i(or)f(the)f(actual)i(min)e(and/or)h(max)g(v)-5 b(alues)227 5714 y(in)30 b(the)h(column.)p eop end %%Page: 62 70 TeXDict begin 62 69 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.62) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(62)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)227 555 y Fj(The)e(\\d")g(v)m(ersion)h(has)e (double)h(precision)g(\015oating)h(p)s(oin)m(t)f(outputs)g(as)g(noted)g (in)g(the)g(calling)h(signature.)227 668 y(The)h(v)m(ersion)h(without)f (\\d")h(has)f(single)h(precision)g(\015oating)g(p)s(oin)m(t)f(outputs.) 227 818 y(BINSIZEIN)k(is)h(an)g(arra)m(y)g(giving)h(the)f(binsize)g (along)h(eac)m(h)g(axis.)55 b(If)34 b(the)h(v)-5 b(alue)36 b(=)e(DOUBLENULL-)227 931 y(V)-10 b(ALUE,)38 b(and)e(a)i(k)m(eyw)m(ord) f(name)g(is)h(not)f(sp)s(eci\014ed)f(with)h(BINNAME,)h(then)f(this)g (routine)g(will)h(\014rst)227 1044 y(lo)s(ok)d(for)f(the)g(TDBINn)g(k)m (eyw)m(ord,)i(or)f(else)g(will)f(use)g(a)h(binsize)f(=)g(1,)h(or)g(a)f (binsize)g(that)h(pro)s(duces)e(10)227 1157 y(histogram)e(bins,)f(whic) m(h)g(ev)m(er)h(is)g(smaller.)95 1417 y Fe(int)47 b (fits_calc_binning[d])143 1530 y(Input)g(parameters:)239 1643 y(\(fitsfile)e(*fptr,)94 b(/*)47 b(IO)g(-)h(pointer)d(to)j(table)e (to)h(be)g(binned)667 b(*/)286 1756 y(int)47 b(naxis,)333 b(/*)47 b(I)g(-)h(number)e(of)h(axes/columns)e(in)i(the)g(binned)f (image)94 b(*/)286 1868 y(char)47 b(colname[4][FLEN_VALUE],)137 b(/*)47 b(I)h(-)f(optional)f(column)g(names)428 b(*/)286 1981 y(double)46 b(*minin,)237 b(/*)47 b(I)h(-)f(optional)f(lower)g (bound)h(value)f(for)h(each)f(axis)95 b(*/)286 2094 y(double)46 b(*maxin,)237 b(/*)47 b(I)h(-)f(optional)f(upper)g(bound)h(value,)f (for)h(each)f(axis)h(*/)286 2207 y(double)f(*binsizein,)f(/*)i(I)h(-)f (optional)f(bin)h(size)f(along)h(each)f(axis)429 b(*/)286 2320 y(char)47 b(minname[4][FLEN_VALUE],)41 b(/*)48 b(I)f(-)h(optional) d(keywords)h(for)h(min)333 b(*/)286 2433 y(char)47 b (maxname[4][FLEN_VALUE],)41 b(/*)48 b(I)f(-)h(optional)d(keywords)h (for)h(max)333 b(*/)286 2546 y(char)47 b(binname[4][FLEN_VALUE],)41 b(/*)48 b(I)f(-)h(optional)d(keywords)h(for)h(binsize)141 b(*/)143 2659 y(Output)46 b(parameters:)286 2772 y(int)h(*colnum,)237 b(/*)47 b(O)g(-)h(column)e(numbers,)f(to)j(be)f(binned)f(*/)286 2885 y(long)h(*naxes,)237 b(/*)47 b(O)g(-)h(number)e(of)h(bins)g(in)g (each)g(histogram)e(axis)h(*/)286 2998 y(float[double])f(*amin,)237 b(/*)47 b(O)g(-)h(lower)e(bound)g(of)i(the)e(histogram)g(axes)g(*/)286 3110 y(float[double])f(*amax,)237 b(/*)47 b(O)g(-)h(upper)e(bound)g(of) i(the)e(histogram)g(axes)g(*/)286 3223 y(float[double])f(*binsize,)93 b(/*)47 b(O)g(-)h(width)e(of)h(histogram)e(bins/pixels)g(on)i(each)g (axis)g(*/)286 3336 y(int)g(*status\))0 3596 y Fi(2)81 b Fj(Cop)m(y)26 b(the)h(relev)-5 b(an)m(t)28 b(k)m(eyw)m(ords)f(from)g (the)g(header)f(of)h(the)g(table)h(that)f(is)g(b)s(eing)f(binned,)h(to) g(the)g(the)g(header)227 3709 y(of)e(the)h(output)e(histogram)i(image.) 40 b(This)24 b(will)i(not)f(cop)m(y)h(the)f(table)h(structure)f(k)m (eyw)m(ords)g(\(e.g.,)j(NAXIS,)227 3822 y(TF)m(ORMn,)j(TTYPEn,)f (etc.\))44 b(nor)31 b(will)g(it)g(cop)m(y)h(the)f(k)m(eyw)m(ords)g (that)h(apply)e(to)i(other)f(columns)g(of)g(the)227 3935 y(table)g(that)g(are)f(not)h(used)e(to)i(create)g(the)f(histogram.)42 b(This)29 b(routine)h(will)g(translate)h(the)g(names)f(of)g(the)227 4048 y(W)-8 b(orld)27 b(Co)s(ordinate)e(System)h(\(W)m(CS\))g(k)m(eyw)m (ords)g(for)g(the)g(binned)e(columns)h(in)m(to)i(the)f(form)f(that)h (is)g(need)227 4161 y(for)h(a)g(FITS)g(image)h(\(e.g.,)h(the)e(TCTYPn)f (table)i(k)m(eyw)m(ord)f(will)g(b)s(e)g(translated)g(to)h(the)f(CTYPEn) f(image)227 4273 y(k)m(eyw)m(ord\).)95 4533 y Fe(int)47 b(fits_copy_pixlist2image)286 4646 y(\(fitsfile)f(*infptr,)141 b(/*)47 b(I)g(-)h(pointer)e(to)h(input)f(HDU)h(*/)334 4759 y(fitsfile)f(*outfptr,)93 b(/*)47 b(I)g(-)h(pointer)e(to)h(output) f(HDU)h(*/)334 4872 y(int)g(firstkey,)332 b(/*)47 b(I)g(-)h(first)e (HDU)h(keyword)f(to)h(start)f(with)h(*/)334 4985 y(int)g(naxis,)476 b(/*)47 b(I)g(-)h(number)e(of)h(axes)g(in)g(the)g(image)f(*/)334 5098 y(int)h(*colnum,)380 b(/*)47 b(I)g(-)h(numbers)e(of)h(the)g (columns)e(to)j(be)f(binned)94 b(*/)334 5211 y(int)47 b(*status\))380 b(/*)47 b(IO)g(-)g(error)g(status)f(*/)0 5470 y Fi(3)81 b Fj(W)-8 b(rite)36 b(a)f(set)h(of)f(default)h(W)m(CS)f (k)m(eyw)m(ords)g(to)h(the)f(histogram)h(header,)g(IF)f(the)g(W)m(CS)g (k)m(eyw)m(ords)h(do)f(not)227 5583 y(already)40 b(exist.)69 b(This)38 b(will)i(create)h(a)e(linear)h(W)m(CS)f(where)g(the)h(co)s (ordinate)g(t)m(yp)s(es)f(are)h(equal)g(to)g(the)227 5696 y(original)32 b(column)e(names.)p eop end %%Page: 63 71 TeXDict begin 63 70 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.63) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.7.)72 b(ASCI)s(I)29 b(AND)i(BINAR)-8 b(Y)31 b(T)-8 b(ABLE)31 b(R)m(OUTINES)1864 b Fj(63)95 555 y Fe(int)47 b(fits_write_keys_histo) 239 668 y(\(fitsfile)e(*fptr,)237 b(/*)47 b(I)h(-)f(pointer)f(to)h (table)f(to)i(be)f(binned)666 b(*/)286 781 y(fitsfile)46 b(*histptr,)93 b(/*)47 b(I)h(-)f(pointer)f(to)h(output)f(histogram)f (image)i(HDU)285 b(*/)286 894 y(int)47 b(naxis,)476 b(/*)47 b(I)h(-)f(number)f(of)h(axes)g(in)g(the)g(histogram)e(image)285 b(*/)286 1007 y(int)47 b(*colnum,)380 b(/*)47 b(I)h(-)f(column)f (numbers)g(of)h(the)g(binned)f(columns)332 b(*/)286 1120 y(int)47 b(*status\))0 1373 y Fi(4)81 b Fj(Up)s(date)29 b(the)i(W)m(CS)f(k)m(eyw)m(ords)g(in)g(a)g(histogram)h(image)g(header)f (that)h(giv)m(e)g(the)f(lo)s(cation)i(of)e(the)g(reference)227 1486 y(pixel)h(\(CRPIXn\),)f(and)g(the)h(pixel)f(size)h(\(CDEL)-8 b(Tn\),)31 b(in)f(the)h(binned)e(image.)227 1635 y(The)j(\\d")g(v)m (ersion)h(has)e(double)h(precision)g(\015oating)h(p)s(oin)m(t)f(inputs) f(as)h(noted)g(in)g(the)g(calling)h(signature.)227 1748 y(The)d(v)m(ersion)h(without)f(\\d")h(has)f(single)h(precision)g (\015oating)g(p)s(oin)m(t)f(inputs.)95 2002 y Fe(int)47 b(fits_rebin_wcs[d])239 2115 y(\(fitsfile)e(*fptr,)237 b(/*)47 b(I)h(-)f(pointer)f(to)h(table)f(to)i(be)f(binned)523 b(*/)286 2227 y(int)47 b(naxis,)476 b(/*)47 b(I)h(-)f(number)f(of)h (axes)g(in)g(the)g(histogram)e(image)142 b(*/)286 2340 y(float[double])45 b(*amin,)380 b(/*)47 b(I)g(-)h(first)e(pixel)h (include)e(in)j(each)e(axis)381 b(*/)286 2453 y(float[double])45 b(*binsize,)236 b(/*)47 b(I)g(-)h(binning)e(factor)g(for)h(each)f(axis) 572 b(*/)286 2566 y(int)47 b(*status\))0 2820 y Fi(5)81 b Fj(Bin)33 b(the)h(v)-5 b(alues)35 b(in)e(the)h(input)f(table)h (columns,)h(and)e(write)h(the)g(histogram)h(arra)m(y)f(to)g(the)g (output)g(FITS)227 2933 y(image)e(\(histptr\).)227 3082 y(The)g(\\d")g(v)m(ersion)h(has)e(double)h(precision)g(\015oating)h(p)s (oin)m(t)f(inputs)f(as)h(noted)g(in)g(the)g(calling)h(signature.)227 3195 y(The)d(v)m(ersion)h(without)f(\\d")h(has)f(single)h(precision)g (\015oating)g(p)s(oin)m(t)f(inputs.)95 3448 y Fe(int)47 b(fits_make_hist[d])143 3561 y(\(fitsfile)e(*fptr,)190 b(/*)47 b(I)g(-)h(pointer)e(to)h(table)f(with)h(X)g(and)g(Y)h(cols;)285 b(*/)191 3674 y(fitsfile)45 b(*histptr,)h(/*)h(I)g(-)h(pointer)e(to)h (output)f(FITS)h(image)619 b(*/)191 3787 y(int)47 b(bitpix,)380 b(/*)47 b(I)g(-)h(datatype)d(for)i(image:)f(16,)h(32,)g(-32,)g(etc)238 b(*/)191 3900 y(int)47 b(naxis,)428 b(/*)47 b(I)g(-)h(number)e(of)h (axes)g(in)g(the)g(histogram)e(image)190 b(*/)191 4013 y(long)47 b(*naxes,)332 b(/*)47 b(I)g(-)h(size)e(of)i(axes)e(in)h(the)g (histogram)f(image)285 b(*/)191 4126 y(int)47 b(*colnum,)332 b(/*)47 b(I)g(-)h(column)e(numbers)g(\(array)g(length)g(=)h(naxis\))190 b(*/)191 4238 y(float[double])44 b(*amin,)333 b(/*)47 b(I)g(-)h(minimum)d(histogram)h(value,)g(for)h(each)f(axis)142 b(*/)191 4351 y(float[double])44 b(*amax,)333 b(/*)47 b(I)g(-)h(maximum)d(histogram)h(value,)g(for)h(each)f(axis)142 b(*/)191 4464 y(float[double])44 b(*binsize,)189 b(/*)47 b(I)g(-)h(bin)f(size)f(along)h(each)f(axis)810 b(*/)191 4577 y(float[double])44 b(weight,)285 b(/*)47 b(I)g(-)h(binning)d (weighting)h(factor)g(\(FLOATNULLVALUE)d(*/)1098 4690 y(/*)238 b(for)47 b(no)g(weighting\))1143 b(*/)191 4803 y(int)47 b(wtcolnum,)284 b(/*)47 b(I)g(-)h(keyword)e(or)h(col)g(for)g (weight)284 b(\(or)47 b(NULL\))g(*/)191 4916 y(int)g(recip,)428 b(/*)47 b(I)g(-)h(use)f(reciprocal)e(of)i(the)g(weight?)f(0)h(or)g(1) 239 b(*/)191 5029 y(char)47 b(*selectrow,)140 b(/*)47 b(I)g(-)h(optional)d(array)i(\(length)f(=)h(no.)g(of)477 b(*/)1098 5142 y(/*)47 b(rows)g(in)g(the)g(table\).)93 b(If)47 b(the)g(element)f(is)h(true)95 b(*/)1098 5255 y(/*)47 b(then)g(the)f(corresponding)f(row)i(of)g(the)g(table)f(will)h (*/)1098 5368 y(/*)g(be)g(included)f(in)h(the)g(histogram,)e(otherwise) g(the)95 b(*/)1098 5480 y(/*)47 b(row)g(will)f(be)i(skipped.)93 b(Ingnored)45 b(if)j(*selectrow)d(*/)1098 5593 y(/*)i(is)g(equal)f(to)i (NULL.)1335 b(*/)191 5706 y(int)47 b(*status\))p eop end %%Page: 64 72 TeXDict begin 64 71 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.64) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(64)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (section.5.8) cvn /DEST pdfmark end 0 464 a 91 x Ff(5.8)135 b(Utilit)l(y)47 b(Routines)0 668 y SDict begin H.S end 0 668 a 0 668 a SDict begin 13.6 H.A end 0 668 a 0 668 a SDict begin [/View [/XYZ H.V]/Dest (subsection.5.8.1) cvn /DEST pdfmark end 0 668 a 141 x Fd(5.8.1)112 b(File)39 b(Chec)m(ksum)f(Routines)0 1028 y Fj(The)33 b(follo)m(wing)h(routines)f(either)h(compute)f(or)h(v)-5 b(alidate)34 b(the)g(c)m(hec)m(ksums)f(for)g(the)h(CHDU.)g(The)e(D)m(A) -8 b(T)g(ASUM)0 1140 y(k)m(eyw)m(ord)33 b(is)f(used)f(to)i(store)f(the) h(n)m(umerical)f(v)-5 b(alue)33 b(of)f(the)g(32-bit,)i(1's)f(complemen) m(t)g(c)m(hec)m(ksum)g(for)f(the)g(data)0 1253 y(unit)26 b(alone.)40 b(If)25 b(there)h(is)h(no)e(data)i(unit)f(then)f(the)h(v)-5 b(alue)27 b(is)f(set)g(to)h(zero.)40 b(The)26 b(n)m(umerical)g(v)-5 b(alue)27 b(is)f(stored)g(as)g(an)0 1366 y(ASCI)s(I)20 b(string)i(of)h(digits,)h(enclosed)f(in)e(quotes,)k(b)s(ecause)d(the)g (v)-5 b(alue)23 b(ma)m(y)f(b)s(e)f(to)s(o)i(large)g(to)g(represen)m(t)f (as)g(a)h(32-bit)0 1479 y(signed)28 b(in)m(teger.)41 b(The)27 b(CHECKSUM)g(k)m(eyw)m(ord)i(is)f(used)f(to)h(store)h(the)f (ASCI)s(I)e(enco)s(ded)i(COMPLEMENT)f(of)0 1592 y(the)f(c)m(hec)m(ksum) h(for)f(the)h(en)m(tire)g(HDU.)g(Storing)f(the)h(complemen)m(t,)h (rather)e(than)g(the)h(actual)g(c)m(hec)m(ksum,)h(forces)0 1705 y(the)k(c)m(hec)m(ksum)h(for)f(the)h(whole)f(HDU)h(to)g(equal)g (zero.)47 b(If)31 b(the)i(\014le)f(has)g(b)s(een)f(mo)s(di\014ed)g (since)i(the)f(c)m(hec)m(ksums)0 1818 y(w)m(ere)39 b(computed,)i(then)e (the)g(HDU)g(c)m(hec)m(ksum)h(will)f(usually)f(not)h(equal)h(zero.)66 b(These)39 b(c)m(hec)m(ksum)g(k)m(eyw)m(ord)0 1931 y(con)m(v)m(en)m (tions)34 b(are)f(based)f(on)g(a)g(pap)s(er)f(b)m(y)h(Rob)g(Seaman)g (published)f(in)h(the)g(pro)s(ceedings)g(of)g(the)h(AD)m(ASS)f(IV)0 2044 y(conference)h(in)e(Baltimore)j(in)d(No)m(v)m(em)m(b)s(er)i(1994)h (and)d(a)h(later)h(revision)f(in)f(June)g(1995.)47 b(See)32 b(App)s(endix)e(B)i(for)0 2157 y(the)f(de\014nition)f(of)g(the)h (parameters)f(used)g(in)g(these)h(routines.)0 2407 y Fi(1)81 b Fj(Compute)33 b(and)g(write)h(the)g(D)m(A)-8 b(T)g(ASUM)35 b(and)e(CHECKSUM)g(k)m(eyw)m(ord)h(v)-5 b(alues)34 b(for)f(the)h(CHDU)g(in)m(to)h(the)227 2520 y(curren)m(t)d(header.)46 b(If)32 b(the)g(k)m(eyw)m(ords)h(already)g (exist,)g(their)g(v)-5 b(alues)32 b(will)h(b)s(e)e(up)s(dated)g(only)h (if)h(necessary)227 2633 y(\(i.e.,)f(if)f(the)f(\014le)h(has)f(b)s(een) f(mo)s(di\014ed)h(since)g(the)h(original)h(k)m(eyw)m(ord)e(v)-5 b(alues)31 b(w)m(ere)g(computed\).)95 2883 y Fe(int)47 b(fits_write_chksum)c(/)48 b(ffpcks)286 2996 y(\(fitsfile)e(*fptr,)g(>) h(int)g(*status\))0 3246 y Fi(2)81 b Fj(Up)s(date)28 b(the)h(CHECKSUM)e(k)m(eyw)m(ord)i(v)-5 b(alue)29 b(in)f(the)h(CHDU,)g (assuming)f(that)h(the)f(D)m(A)-8 b(T)g(ASUM)30 b(k)m(eyw)m(ord)227 3359 y(exists)36 b(and)f(already)h(has)f(the)h(correct)g(v)-5 b(alue.)56 b(This)35 b(routine)g(calculates)j(the)e(new)f(c)m(hec)m (ksum)h(for)f(the)227 3471 y(curren)m(t)40 b(header)g(unit,)j(adds)c (it)i(to)g(the)f(data)h(unit)f(c)m(hec)m(ksum,)k(enco)s(des)c(the)g(v) -5 b(alue)41 b(in)m(to)g(an)f(ASCI)s(I)227 3584 y(string,)31 b(and)f(writes)g(the)h(string)f(to)h(the)g(CHECKSUM)e(k)m(eyw)m(ord.)95 3834 y Fe(int)47 b(fits_update_chksum)c(/)48 b(ffupck)286 3947 y(\(fitsfile)e(*fptr,)g(>)h(int)g(*status\))0 4197 y Fi(3)81 b Fj(V)-8 b(erify)35 b(the)f(CHDU)h(b)m(y)g(computing)f(the)h (c)m(hec)m(ksums)g(and)f(comparing)h(them)f(with)g(the)h(k)m(eyw)m (ords.)53 b(The)227 4310 y(data)34 b(unit)f(is)g(v)m(eri\014ed)g (correctly)h(if)f(the)h(computed)f(c)m(hec)m(ksum)g(equals)h(the)f(v)-5 b(alue)34 b(of)f(the)g(D)m(A)-8 b(T)g(ASUM)227 4423 y(k)m(eyw)m(ord.)64 b(The)37 b(c)m(hec)m(ksum)i(for)f(the)g(en)m(tire)g(HDU)h(\(header)f (plus)f(data)i(unit\))e(is)h(correct)h(if)f(it)h(equals)227 4536 y(zero.)47 b(The)32 b(output)f(D)m(A)-8 b(T)g(A)m(OK)34 b(and)d(HDUOK)i(parameters)f(in)g(this)g(routine)g(are)g(in)m(tegers)i (whic)m(h)e(will)227 4649 y(ha)m(v)m(e)k(a)f(v)-5 b(alue)35 b(=)f(1)h(if)f(the)h(data)g(or)f(HDU)h(is)g(v)m(eri\014ed)f(correctly) -8 b(,)38 b(a)d(v)-5 b(alue)35 b(=)f(0)h(if)f(the)h(D)m(A)-8 b(T)g(ASUM)36 b(or)227 4762 y(CHECKSUM)29 b(k)m(eyw)m(ord)g(is)h(not)f (presen)m(t,)h(or)f(v)-5 b(alue)30 b(=)f(-1)h(if)f(the)h(computed)f(c)m (hec)m(ksum)h(is)f(not)h(correct.)95 5125 y Fe(int)47 b(fits_verify_chksum)c(/)48 b(ffvcks)286 5238 y(\(fitsfile)e(*fptr,)g (>)h(int)g(*dataok,)f(int)h(*hduok,)e(int)i(*status\))0 5488 y Fi(4)81 b Fj(Compute)40 b(and)g(return)g(the)h(c)m(hec)m(ksum)g (v)-5 b(alues)41 b(for)g(the)g(CHDU)g(without)g(creating)h(or)f(mo)s (difying)f(the)227 5601 y(CHECKSUM)33 b(and)h(D)m(A)-8 b(T)g(ASUM)35 b(k)m(eyw)m(ords.)52 b(This)33 b(routine)h(is)g(used)f (in)m(ternally)i(b)m(y)f(\013v)m(c)m(ks,)i(but)d(ma)m(y)227 5714 y(b)s(e)d(useful)g(in)g(other)g(situations)h(as)g(w)m(ell.)p eop end %%Page: 65 73 TeXDict begin 65 72 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.65) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.8.)72 b(UTILITY)30 b(R)m(OUTINES)2693 b Fj(65)95 555 y Fe(int)47 b(fits_get_chksum/)d(/ffgcks)286 668 y(\(fitsfile)i(*fptr,)g(>)h (unsigned)f(long)g(*datasum,)g(unsigned)f(long)i(*hdusum,)334 781 y(int)g(*status\))0 1022 y Fi(5)81 b Fj(Enco)s(de)23 b(a)h(c)m(hec)m(ksum)g(v)-5 b(alue)24 b(in)m(to)g(a)g(16-c)m(haracter)j (string.)38 b(If)23 b(complm)h(is)f(non-zero)i(\(true\))f(then)f(the)h (32-bit)227 1135 y(sum)30 b(v)-5 b(alue)31 b(will)f(b)s(e)g(complemen)m (ted)h(b)s(efore)f(enco)s(ding.)95 1376 y Fe(int)47 b (fits_encode_chksum)c(/)48 b(ffesum)286 1489 y(\(unsigned)e(long)g (sum,)h(int)g(complm,)f(>)h(char)g(*ascii\);)0 1730 y Fi(6)81 b Fj(Deco)s(de)24 b(a)f(16-c)m(haracter)j(c)m(hec)m(ksum)e (string)f(in)m(to)g(a)h(unsigned)e(long)h(v)-5 b(alue.)39 b(If)23 b(is)g(non-zero)g(\(true\).)39 b(then)23 b(the)227 1842 y(32-bit)33 b(sum)d(v)-5 b(alue)32 b(will)g(b)s(e)f(complemen)m (ted)h(after)g(deco)s(ding.)44 b(The)31 b(c)m(hec)m(ksum)h(v)-5 b(alue)32 b(is)g(also)g(returned)227 1955 y(as)f(the)f(v)-5 b(alue)31 b(of)g(the)f(function.)95 2196 y Fe(unsigned)46 b(long)h(fits_decode_chksum)42 b(/)48 b(ffdsum)525 2309 y(\(char)e(*ascii,)g(int)h(complm,)f(>)h(unsigned)f(long)h(*sum\);)0 2454 y SDict begin H.S end 0 2454 a 0 2454 a SDict begin 13.6 H.A end 0 2454 a 0 2454 a SDict begin [/View [/XYZ H.V]/Dest (subsection.5.8.2) cvn /DEST pdfmark end 0 2454 a 143 x Fd(5.8.2)112 b(Date)38 b(and)g(Time)g(Utilit)m(y)f(Routines)0 2816 y Fj(The)29 b(follo)m(wing)i(routines)f(help)f(to)i(construct)f (or)f(parse)h(the)g(FITS)f(date/time)i(strings.)41 b(Starting)30 b(in)f(the)h(y)m(ear)0 2929 y(2000,)k(the)d(FITS)g(D)m(A)-8 b(TE)32 b(k)m(eyw)m(ord)g(v)-5 b(alues)31 b(\(and)h(the)f(v)-5 b(alues)32 b(of)f(other)h(`D)m(A)-8 b(TE-')33 b(k)m(eyw)m(ords\))f(m)m (ust)f(ha)m(v)m(e)i(the)0 3042 y(form)j('YYYY-MM-DD')k(\(date)e(only\)) f(or)g('YYYY-MM-DDThh:mm:ss.ddd...')61 b(\(date)38 b(and)e(time\))h (where)0 3154 y(the)30 b(n)m(um)m(b)s(er)f(of)i(decimal)g(places)g(in)f (the)g(seconds)g(v)-5 b(alue)31 b(is)f(optional.)42 b(These)30 b(times)h(are)f(in)g(UTC.)g(The)g(older)0 3267 y('dd/mm/yy')d(date)g (format)g(ma)m(y)h(not)f(b)s(e)f(used)g(for)h(dates)h(after)f(01)h(Jan) m(uary)e(2000.)42 b(See)27 b(App)s(endix)e(B)i(for)g(the)0 3380 y(de\014nition)j(of)h(the)f(parameters)h(used)e(in)h(these)h (routines.)0 3621 y Fi(1)81 b Fj(Get)23 b(the)f(curren)m(t)f(system)i (date.)38 b(C)22 b(already)g(pro)m(vides)g(standard)f(library)h (routines)g(for)f(getting)j(the)e(curren)m(t)227 3734 y(date)k(and)e(time,)j(but)d(this)h(routine)g(is)g(pro)m(vided)g(for)f (compatibilit)m(y)k(with)c(the)h(F)-8 b(ortran)26 b(FITSIO)e(library)-8 b(.)227 3847 y(The)30 b(returned)f(y)m(ear)j(has)e(4)g(digits)h (\(1999,)i(2000,)g(etc.\))95 4088 y Fe(int)47 b (fits_get_system_date/ffgsd)o(t)286 4201 y(\()h(>)f(int)g(*day,)g(int)f (*month,)g(int)h(*year,)f(int)h(*status)f(\))0 4442 y Fi(2)81 b Fj(Get)34 b(the)g(curren)m(t)g(system)f(date)i(and)e(time)h (string)g(\('YYYY-MM-DDThh:mm:ss'\).)53 b(The)33 b(time)i(will)f(b)s(e) 227 4555 y(in)26 b(UTC/GMT)g(if)g(a)m(v)-5 b(ailable,)29 b(as)e(indicated)f(b)m(y)g(a)g(returned)f(timeref)h(v)-5 b(alue)27 b(=)e(0.)40 b(If)26 b(the)g(returned)e(v)-5 b(alue)227 4668 y(of)31 b(timeref)g(=)g(1)g(then)f(this)h(indicates)g (that)h(it)f(w)m(as)g(not)g(p)s(ossible)f(to)h(con)m(v)m(ert)i(the)d (lo)s(cal)i(time)g(to)f(UTC,)227 4780 y(and)f(th)m(us)g(the)h(lo)s(cal) g(time)g(w)m(as)g(returned.)95 5021 y Fe(int)47 b (fits_get_system_time/ffgst)o(m)286 5134 y(\(>)h(char)e(*datestr,)f (int)95 b(*timeref,)45 b(int)i(*status\))0 5375 y Fi(3)81 b Fj(Construct)26 b(a)i(date)g(string)f(from)g(the)g(input)f(date)i(v) -5 b(alues.)40 b(If)27 b(the)g(y)m(ear)h(is)g(b)s(et)m(w)m(een)f(1900)i (and)e(1998,)j(inclu-)227 5488 y(siv)m(e,)38 b(then)c(the)i(returned)d (date)j(string)f(will)g(ha)m(v)m(e)i(the)e(old)g(FITS)f(format)i (\('dd/mm/yy'\),)h(otherwise)227 5601 y(the)32 b(date)f(string)g(will)h (ha)m(v)m(e)g(the)g(new)e(FITS)h(format)g(\('YYYY-MM-DD'\).)36 b(Use)31 b(\014ts)p 3229 5601 28 4 v 33 w(time2str)h(instead)227 5714 y(to)f(alw)m(a)m(ys)h(return)e(a)g(date)h(string)g(using)f(the)g (new)g(FITS)g(format.)p eop end %%Page: 66 74 TeXDict begin 66 73 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.66) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(66)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)95 555 y Fe(int)47 b(fits_date2str/ffdt2s)286 668 y(\(int)g(year,)f(int)h(month,)f(int)h(day,)g(>)g(char)g(*datestr,) e(int)i(*status\))0 928 y Fi(4)81 b Fj(Construct)34 b(a)i(new-format)f (date)h(+)f(time)h(string)f(\('YYYY-MM-DDThh:mm:ss.ddd...'\).)57 b(If)34 b(the)i(y)m(ear,)227 1041 y(mon)m(th,)d(and)e(da)m(y)h(v)-5 b(alues)32 b(all)h(=)e(0)h(then)g(only)g(the)g(time)g(is)g(enco)s(ded)f (with)h(format)g('hh:mm:ss.ddd...'.)227 1154 y(The)j(decimals)h (parameter)g(sp)s(eci\014es)e(ho)m(w)i(man)m(y)f(decimal)h(places)g(of) f(fractional)i(seconds)e(to)h(include)227 1266 y(in)30 b(the)h(string.)41 b(If)29 b(`decimals')j(is)f(negativ)m(e,)h(then)f (only)f(the)h(date)g(will)f(b)s(e)g(return)f(\('YYYY-MM-DD'\).)95 1526 y Fe(int)47 b(fits_time2str/fftm2s)286 1639 y(\(int)g(year,)f(int) h(month,)f(int)h(day,)g(int)g(hour,)f(int)h(minute,)f(double)g(second,) 286 1752 y(int)h(decimals,)f(>)h(char)g(*datestr,)e(int)i(*status\))0 2012 y Fi(5)81 b Fj(Return)44 b(the)g(date)i(as)f(read)f(from)h(the)g (input)e(string,)49 b(where)44 b(the)h(string)g(ma)m(y)g(b)s(e)f(in)h (either)g(the)g(old)227 2125 y(\('dd/mm/yy'\))29 b(or)f(new)f (\('YYYY-MM-DDThh:mm:ss')k(or)d('YYYY-MM-DD'\))j(FITS)d(format.)40 b(Null)227 2237 y(p)s(oin)m(ters)31 b(ma)m(y)f(b)s(e)g(supplied)f(for)h (an)m(y)h(un)m(w)m(an)m(ted)g(output)f(date)h(parameters.)95 2497 y Fe(int)47 b(fits_str2date/ffs2dt)286 2610 y(\(char)g(*datestr,)e (>)i(int)g(*year,)f(int)h(*month,)f(int)h(*day,)f(int)h(*status\))0 2870 y Fi(6)81 b Fj(Return)30 b(the)h(date)h(and)f(time)h(as)f(read)g (from)g(the)h(input)e(string,)h(where)g(the)h(string)f(ma)m(y)h(b)s(e)e (in)h(either)h(the)227 2983 y(old)d(or)f(new)g(FITS)g(format.)40 b(The)28 b(returned)f(hours,)h(min)m(utes,)h(and)f(seconds)g(v)-5 b(alues)29 b(will)f(b)s(e)g(set)h(to)g(zero)227 3095 y(if)k(the)h(input)e(string)h(do)s(es)g(not)h(include)f(the)g(time)h (\('dd/mm/yy')f(or)h('YYYY-MM-DD'\))j(.)c(Similarly)-8 b(,)227 3208 y(the)36 b(returned)e(y)m(ear,)j(mon)m(th,)g(and)d(date)i (v)-5 b(alues)36 b(will)f(b)s(e)g(set)h(to)g(zero)g(if)f(the)g(date)h (is)f(not)h(included)e(in)227 3321 y(the)29 b(input)f(string)h (\('hh:mm:ss.ddd...'\).)40 b(Null)29 b(p)s(oin)m(ters)f(ma)m(y)i(b)s(e) e(supplied)f(for)i(an)m(y)g(un)m(w)m(an)m(ted)g(output)227 3434 y(date)i(and)f(time)h(parameters.)95 3694 y Fe(int)47 b(fits_str2time/ffs2tm)286 3807 y(\(char)g(*datestr,)e(>)i(int)g (*year,)f(int)h(*month,)f(int)h(*day,)f(int)h(*hour,)286 3920 y(int)g(*minute,)f(double)g(*second,)f(int)i(*status\))0 4060 y SDict begin H.S end 0 4060 a 0 4060 a SDict begin 13.6 H.A end 0 4060 a 0 4060 a SDict begin [/View [/XYZ H.V]/Dest (subsection.5.8.3) cvn /DEST pdfmark end 0 4060 a 150 x Fd(5.8.3)112 b(General)39 b(Utilit)m(y)e(Routines)0 4429 y Fj(The)30 b(follo)m(wing)i(utilit)m(y)f(routines)g(ma)m(y)g(b)s (e)e(useful)h(for)g(certain)h(applications.)0 4689 y Fi(1)81 b Fj(Return)30 b(the)h(revision)g(n)m(um)m(b)s(er)f(of)h(the)g (CFITSIO)f(library)-8 b(.)42 b(The)31 b(revision)g(n)m(um)m(b)s(er)f (will)h(b)s(e)f(incremen)m(ted)227 4802 y(with)g(eac)m(h)i(new)e (release)h(of)g(CFITSIO.)95 5061 y Fe(float)47 b(fits_get_version)c(/) 48 b(ffvers)e(\()h(>)h(float)e(*version\))0 5321 y Fi(2)81 b Fj(W)-8 b(rite)34 b(an)g(80-c)m(haracter)i(message)e(to)g(the)g (CFITSIO)e(error)h(stac)m(k.)51 b(Application)34 b(programs)f(should)g (not)227 5434 y(normally)e(write)f(to)i(the)e(stac)m(k,)i(but)e(there)g (ma)m(y)h(b)s(e)f(some)h(situations)g(where)f(this)g(is)h(desirable.)95 5694 y Fe(void)47 b(fits_write_errmsg)c(/)48 b(ffpmsg)e(\(char)g (*err_msg\))p eop end %%Page: 67 75 TeXDict begin 67 74 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.67) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.8.)72 b(UTILITY)30 b(R)m(OUTINES)2693 b Fj(67)0 555 y Fi(3)81 b Fj(Con)m(v)m(ert)31 b(a)g(c)m(haracter)h(string)e(to)h(upp)s(ercase)e (\(op)s(erates)j(in)e(place\).)95 817 y Fe(void)47 b(fits_uppercase)d (/)j(ffupch)g(\(char)f(*string\))0 1079 y Fi(4)81 b Fj(Compare)43 b(the)i(input)e(template)i(string)f(against)h(the)g(reference)f(string) g(to)h(see)g(if)f(they)g(matc)m(h.)82 b(The)227 1192 y(template)36 b(string)f(ma)m(y)g(con)m(tain)g(wildcard)f(c)m (haracters:)51 b('*')35 b(will)g(matc)m(h)g(an)m(y)g(sequence)g(of)f(c) m(haracters)227 1305 y(\(including)j(zero)h(c)m(haracters\))g(and)e(') 10 b(?')60 b(will)38 b(matc)m(h)f(an)m(y)g(single)h(c)m(haracter)g(in)f (the)g(reference)g(string.)227 1418 y(The)e('#')h(c)m(haracter)h(will)f (matc)m(h)g(an)m(y)g(consecutiv)m(e)h(string)f(of)f(decimal)i(digits)f (\(0)g(-)f(9\).)57 b(If)35 b(casesen)h(=)227 1531 y(CASESEN)c(=)h(TR)m (UE)h(then)f(the)g(matc)m(h)i(will)e(b)s(e)g(case)h(sensitiv)m(e,)i (otherwise)e(the)f(case)i(of)e(the)h(letters)227 1644 y(will)g(b)s(e)f(ignored)h(if)g(casesen)g(=)g(CASEINSEN)e(=)h(F)-10 b(ALSE.)34 b(The)f(returned)f(MA)-8 b(TCH)34 b(parameter)h(will)227 1757 y(b)s(e)30 b(TR)m(UE)g(if)g(the)g(2)h(strings)f(matc)m(h,)h(and)f (EXA)m(CT)g(will)g(b)s(e)g(TR)m(UE)g(if)g(the)g(matc)m(h)h(is)f(exact)i (\(i.e.,)g(if)e(no)227 1870 y(wildcard)k(c)m(haracters)i(w)m(ere)f (used)e(in)h(the)h(matc)m(h\).)53 b(Both)35 b(strings)g(m)m(ust)f(b)s (e)f(68)j(c)m(haracters)f(or)g(less)f(in)227 1983 y(length.)95 2245 y Fe(void)47 b(fits_compare_str)c(/)48 b(ffcmps)334 2358 y(\(char)e(*templt,)g(char)h(*string,)e(int)i(casesen,)f(>)h(int)g (*match,)f(int)h(*exact\))0 2620 y Fi(5)81 b Fj(Split)30 b(a)i(string)f(con)m(taining)h(a)g(list)f(of)g(names)g(\(t)m(ypically)j (\014le)d(names)g(or)g(column)f(names\))i(in)m(to)g(individual)227 2733 y(name)23 b(tok)m(ens)g(b)m(y)g(a)g(sequence)g(of)g(calls)g(to)h (\014ts)p 1814 2733 28 4 v 32 w(split)p 2018 2733 V 33 w(names.)38 b(The)22 b(names)h(in)f(the)h(list)g(m)m(ust)f(b)s(e)g (delimited)227 2846 y(b)m(y)45 b(a)f(comma)i(and/or)e(spaces.)83 b(This)44 b(routine)g(ignores)h(spaces)g(and)f(commas)h(that)g(o)s (ccur)f(within)227 2959 y(paren)m(theses,)36 b(brac)m(k)m(ets,)h(or)e (curly)f(brac)m(k)m(ets.)54 b(It)35 b(also)g(strips)f(an)m(y)h(leading) g(and)f(trailing)h(blanks)f(from)227 3072 y(the)d(returned)e(name.)227 3223 y(This)h(routine)g(is)h(similar)f(to)h(the)g(ANSI)f(C)g('strtok')h (function:)227 3374 y(The)37 b(\014rst)f(call)i(to)g(\014ts)p 1033 3374 V 32 w(split)p 1237 3374 V 33 w(names)f(has)g(a)g(non-n)m (ull)f(input)g(string.)61 b(It)37 b(\014nds)e(the)i(\014rst)f(name)h (in)g(the)227 3487 y(string)26 b(and)f(terminates)h(it)h(b)m(y)e(o)m(v) m(erwriting)i(the)f(next)g(c)m(haracter)h(of)f(the)g(string)f(with)h(a) g(n)m(ull)f(terminator)227 3600 y(and)31 b(returns)g(a)h(p)s(oin)m(ter) f(to)i(the)e(name.)45 b(Eac)m(h)32 b(subsequen)m(t)f(call,)j(indicated) e(b)m(y)f(a)h(NULL)g(v)-5 b(alue)32 b(of)g(the)227 3713 y(input)f(string,)i(returns)e(the)h(next)h(name,)f(searc)m(hing)h(from) f(just)g(past)g(the)g(end)f(of)i(the)f(previous)g(name.)227 3826 y(It)f(returns)e(NULL)h(when)g(no)g(further)f(names)h(are)h (found.)143 4088 y Fe(char)47 b(*fits_split_names\(char)42 b(*namelist\))0 4350 y Fj(The)30 b(follo)m(wing)i(example)f(sho)m(ws)f (ho)m(w)g(a)h(string)f(w)m(ould)h(b)s(e)e(split)i(in)m(to)g(3)g(names:) 191 4612 y Fe(myfile[1][bin)44 b(\(x,y\)=4],)h(file2.fits)93 b(file3.fits)191 4725 y(^^^^^^^^^^^^^^^^^^^^^^)c(^^^^^^^^^^)k (^^^^^^^^^^)382 4838 y(1st)47 b(name)619 b(2nd)47 b(name)190 b(3rd)47 b(name)0 5100 y Fi(6)81 b Fj(T)-8 b(est)34 b(that)g(the)g(k)m (eyw)m(ord)g(name)f(con)m(tains)i(only)e(legal)j(c)m(haracters)f (\(A-Z,0-9,)h(h)m(yphen,)d(and)g(underscore\))227 5213 y(or)e(that)g(the)f(k)m(eyw)m(ord)h(record)f(con)m(tains)i(only)e (legal)i(prin)m(table)f(ASCI)s(I)e(c)m(haracters)95 5475 y Fe(int)47 b(fits_test_keyword)c(/)48 b(fftkey)e(\(char)g(*keyname,)g (>)h(int)g(*status\))95 5701 y(int)g(fits_test_record)d(/)j(fftrec)f (\(char)h(*card,)f(>)h(int)g(*status\))p eop end %%Page: 68 76 TeXDict begin 68 75 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.68) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(68)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 555 y Fi(7)81 b Fj(T)-8 b(est)25 b(whether)f(the)h(curren)m(t)f(header)h(con)m(tains)g(an)m(y)g(NULL)g (\(ASCI)s(I)e(0\))j(c)m(haracters.)40 b(These)24 b(c)m(haracters)j(are) 227 668 y(illegal)37 b(in)d(the)h(header,)g(but)f(they)g(will)h(go)g (undetected)g(b)m(y)f(most)h(of)g(the)f(CFITSIO)f(k)m(eyw)m(ord)i (header)227 781 y(routines,)29 b(b)s(ecause)f(the)h(n)m(ull)f(is)g(in)m (terpreted)g(as)h(the)f(normal)g(end-of-string)h(terminator.)41 b(This)27 b(routine)227 894 y(returns)h(the)g(p)s(osition)h(of)g(the)g (\014rst)f(n)m(ull)g(c)m(haracter)i(in)f(the)f(header,)h(or)g(zero)g (if)g(there)g(are)g(no)f(n)m(ulls.)40 b(F)-8 b(or)227 1007 y(example)37 b(a)f(returned)f(v)-5 b(alue)37 b(of)f(110)h(w)m (ould)f(indicate)h(that)g(the)f(\014rst)f(NULL)h(is)g(lo)s(cated)h(in)f (the)g(30th)227 1120 y(c)m(haracter)28 b(of)f(the)g(second)f(k)m(eyw)m (ord)h(in)f(the)h(header)f(\(recall)i(that)f(eac)m(h)h(header)e(record) h(is)f(80)h(c)m(haracters)227 1233 y(long\).)45 b(Note)33 b(that)f(this)g(is)f(one)h(of)g(the)g(few)f(CFITSIO)f(routines)h(in)h (whic)m(h)f(the)h(returned)e(v)-5 b(alue)32 b(is)g(not)227 1346 y(necessarily)g(equal)e(to)i(the)e(status)h(v)-5 b(alue\).)95 1613 y Fe(int)47 b(fits_null_check)d(/)j(ffnchk)g(\(char)f (*card,)g(>)h(int)g(*status\))0 1881 y Fi(8)81 b Fj(P)m(arse)25 b(a)g(header)g(k)m(eyw)m(ord)g(record)g(and)f(return)g(the)h(name)g(of) g(the)g(k)m(eyw)m(ord,)i(and)d(the)h(length)h(of)f(the)g(name.)227 1993 y(The)34 b(k)m(eyw)m(ord)h(name)f(normally)h(o)s(ccupies)f(the)h (\014rst)e(8)i(c)m(haracters)g(of)g(the)f(record,)i(except)f(under)e (the)227 2106 y(HIERAR)m(CH)e(con)m(v)m(en)m(tion)h(where)e(the)h(name) f(can)h(b)s(e)f(up)f(to)i(70)g(c)m(haracters)h(in)e(length.)95 2374 y Fe(int)47 b(fits_get_keyname)d(/)j(ffgknm)286 2487 y(\(char)g(*card,)f(>)h(char)g(*keyname,)e(int)i(*keylength,)e (int)i(*status\))0 2754 y Fi(9)81 b Fj(P)m(arse)29 b(a)h(header)f(k)m (eyw)m(ord)h(record,)f(returning)g(the)g(v)-5 b(alue)30 b(\(as)g(a)f(literal)i(c)m(haracter)g(string\))e(and)g(commen)m(t)227 2867 y(strings.)40 b(If)27 b(the)g(k)m(eyw)m(ord)h(has)f(no)g(v)-5 b(alue)28 b(\(columns)f(9-10)i(not)f(equal)f(to)h('=)g('\),)g(then)f(a) h(n)m(ull)f(v)-5 b(alue)28 b(string)227 2980 y(is)j(returned)e(and)h (the)g(commen)m(t)i(string)e(is)g(set)h(equal)g(to)g(column)f(9)h(-)g (80)g(of)g(the)f(input)g(string.)95 3247 y Fe(int)47 b(fits_parse_value)d(/)j(ffpsvc)286 3360 y(\(char)g(*card,)f(>)h(char)g (*value,)f(char)g(*comment,)g(int)h(*status\))0 3628 y Fi(10)f Fj(Construct)40 b(a)g(prop)s(erly)f(formated)i(80-c)m (haracter)i(header)d(k)m(eyw)m(ord)g(record)g(from)g(the)g(input)f(k)m (eyw)m(ord)227 3741 y(name,)25 b(k)m(eyw)m(ord)f(v)-5 b(alue,)25 b(and)e(k)m(eyw)m(ord)h(commen)m(t)g(strings.)38 b(Hierarc)m(hical)26 b(k)m(eyw)m(ord)e(names)f(\(e.g.,)j("ESO)227 3854 y(TELE)e(CAM"\))i(are)f(supp)s(orted.)37 b(The)25 b(v)-5 b(alue)25 b(string)g(ma)m(y)h(con)m(tain)g(an)f(in)m(teger,)i (\015oating)f(p)s(oin)m(t,)g(logical,)227 3967 y(or)31 b(quoted)f(c)m(haracter)i(string)e(\(e.g.,)j("12",)f("15.7",)h("T",)e (or)g("'NGC)g(1313'"\).)143 4234 y Fe(int)47 b(fits_make_key)d(/)k (ffmkky)334 4347 y(\(const)e(char)h(*keyname,)e(const)h(char)h(*value,) f(const)g(char)h(*comment,)430 4460 y(>)g(char)g(*card,)f(int)h (*status\))0 4727 y Fi(11)f Fj(Construct)26 b(an)h(arra)m(y)g(indexed)f (k)m(eyw)m(ord)h(name)f(\(R)m(OOT)g(+)h(nnn\).)38 b(This)26 b(routine)g(app)s(ends)f(the)i(sequence)227 4840 y(n)m(um)m(b)s(er)i (to)i(the)g(ro)s(ot)g(string)f(to)h(create)h(a)f(k)m(eyw)m(ord)g(name)f (\(e.g.,)i('NAXIS')f(+)f(2)h(=)f('NAXIS2'\))95 5108 y Fe(int)47 b(fits_make_keyn)d(/)k(ffkeyn)286 5221 y(\(char)f(*keyroot,)e (int)i(value,)f(>)h(char)g(*keyname,)e(int)i(*status\))0 5488 y Fi(12)f Fj(Construct)41 b(a)h(sequence)f(k)m(eyw)m(ord)h(name)g (\(n)f(+)g(R)m(OOT\).)g(This)g(routine)g(concatenates)j(the)e(sequence) 227 5601 y(n)m(um)m(b)s(er)20 b(to)j(the)e(fron)m(t)h(of)g(the)f(ro)s (ot)h(string)g(to)g(create)h(a)f(k)m(eyw)m(ord)g(name)g(\(e.g.,)j(1)d (+)f('CTYP')g(=)g('1CTYP'\))p eop end %%Page: 69 77 TeXDict begin 69 76 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.69) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.8.)72 b(UTILITY)30 b(R)m(OUTINES)2693 b Fj(69)95 555 y Fe(int)47 b(fits_make_nkey)d(/)k(ffnkey)286 668 y(\(int)f(value,)f(char)h (*keyroot,)e(>)i(char)g(*keyname,)e(int)i(*status\))0 932 y Fi(13)f Fj(Determine)41 b(the)g(data)f(t)m(yp)s(e)h(of)f(a)h(k)m (eyw)m(ord)f(v)-5 b(alue)41 b(string.)70 b(This)39 b(routine)i(parses)e (the)i(k)m(eyw)m(ord)f(v)-5 b(alue)227 1045 y(string)28 b(to)h(determine)f(its)g(data)h(t)m(yp)s(e.)40 b(Returns)27 b('C',)h('L',)h('I',)f('F')h(or)f('X',)g(for)g(c)m(haracter)i(string,)e (logical,)227 1158 y(in)m(teger,)k(\015oating)g(p)s(oin)m(t,)e(or)h (complex,)g(resp)s(ectiv)m(ely)-8 b(.)95 1421 y Fe(int)47 b(fits_get_keytype)d(/)j(ffdtyp)286 1534 y(\(char)g(*value,)f(>)h(char) g(*dtype,)e(int)i(*status\))0 1798 y Fi(14)f Fj(Determine)39 b(the)f(in)m(teger)h(data)g(t)m(yp)s(e)f(of)g(an)g(in)m(teger)h(k)m (eyw)m(ord)f(v)-5 b(alue)39 b(string.)63 b(The)37 b(returned)g(datat)m (yp)s(e)227 1911 y(v)-5 b(alue)36 b(is)f(the)g(minim)m(um)f(in)m(teger) i(datat)m(yp)s(e)g(\(starting)g(from)f(top)g(of)g(the)g(follo)m(wing)i (list)e(and)g(w)m(orking)227 2024 y(do)m(wn\))c(required)e(to)i(store)g (the)g(in)m(teger)h(v)-5 b(alue:)191 2288 y Fe(Data)47 b(Type)285 b(Range)239 2401 y(TSBYTE:)236 b(-128)47 b(to)g(127)239 2514 y(TBYTE:)332 b(128)47 b(to)g(255)239 2626 y(TSHORT:)236 b(-32768)46 b(to)i(32767)239 2739 y(TUSHORT:)236 b(32768)46 b(to)i(65535)239 2852 y(TINT)380 b(-2147483648)45 b(to)i(2147483647)239 2965 y(TUINT)380 b(2147483648)45 b(to)i(4294967295)239 3078 y(TLONGLONG)140 b(-9223372036854775808)43 b(to)k (9223372036854775807)80 3342 y Fj(The)30 b(*neg)h(parameter)g(returns)e (1)i(if)f(the)h(input)e(v)-5 b(alue)31 b(is)g(negativ)m(e)h(and)e (returns)f(0)i(if)f(it)h(is)g(non-negativ)m(e.)95 3606 y Fe(int)47 b(fits_get_inttype)d(/)j(ffinttyp)286 3719 y(\(char)g(*value,)f(>)h(int)g(*datatype,)e(int)i(*neg,)f(int)h (*status\))0 3982 y Fi(15)f Fj(Return)35 b(the)g(class)h(of)g(an)f (input)g(header)g(record.)56 b(The)35 b(record)g(is)g(classi\014ed)h (in)m(to)h(one)e(of)h(the)f(follo)m(wing)227 4095 y(categories)d(\(the) e(class)g(v)-5 b(alues)30 b(are)f(de\014ned)f(in)h(\014tsio.h\).)41 b(Note)31 b(that)e(this)h(is)f(one)h(of)f(the)g(few)g(CFITSIO)227 4208 y(routines)i(that)f(do)s(es)h(not)f(return)f(a)i(status)g(v)-5 b(alue.)334 4472 y Fe(Class)94 b(Value)619 b(Keywords)95 4585 y(TYP_STRUC_KEY)92 b(10)j(SIMPLE,)46 b(BITPIX,)g(NAXIS,)g(NAXISn,) g(EXTEND,)g(BLOCKED,)1002 4698 y(GROUPS,)g(PCOUNT,)g(GCOUNT,)g(END)1002 4811 y(XTENSION,)g(TFIELDS,)f(TTYPEn,)h(TBCOLn,)g(TFORMn,)g(THEAP,)1002 4924 y(and)h(the)g(first)f(4)i(COMMENT)e(keywords)f(in)i(the)g(primary) f(array)1002 5036 y(that)h(define)f(the)h(FITS)g(format.)95 5149 y(TYP_CMPRS_KEY)92 b(20)j(The)47 b(keywords)f(used)g(in)i(the)e (compressed)f(image)i(or)g(table)1002 5262 y(format,)f(including)f (ZIMAGE,)h(ZCMPTYPE,)f(ZNAMEn,)h(ZVALn,)1002 5375 y(ZTILEn,)g(ZBITPIX,) g(ZNAXISn,)f(ZSCALE,)h(ZZERO,)g(ZBLANK)95 5488 y(TYP_SCAL_KEY)140 b(30)95 b(BSCALE,)46 b(BZERO,)g(TSCALn,)g(TZEROn)95 5601 y(TYP_NULL_KEY)140 b(40)95 b(BLANK,)46 b(TNULLn)95 5714 y(TYP_DIM_KEY)188 b(50)95 b(TDIMn)p eop end %%Page: 70 78 TeXDict begin 70 77 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.70) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(70)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)95 555 y Fe(TYP_RANG_KEY)140 b(60)95 b(TLMINn,)46 b(TLMAXn,)g(TDMINn,)g(TDMAXn,)g(DATAMIN,)f (DATAMAX)95 668 y(TYP_UNIT_KEY)140 b(70)95 b(BUNIT,)46 b(TUNITn)95 781 y(TYP_DISP_KEY)140 b(80)95 b(TDISPn)95 894 y(TYP_HDUID_KEY)d(90)j(EXTNAME,)46 b(EXTVER,)g(EXTLEVEL,)f (HDUNAME,)g(HDUVER,)h(HDULEVEL)95 1007 y(TYP_CKSUM_KEY)f(100)94 b(CHECKSUM,)46 b(DATASUM)95 1120 y(TYP_WCS_KEY)141 b(110)94 b(WCS)47 b(keywords)f(defined)g(in)h(the)g(the)g(WCS)f(papers,)g (including:)1002 1233 y(CTYPEn,)g(CUNITn,)g(CRVALn,)g(CRPIXn,)g (CROTAn,)f(CDELTn)1002 1346 y(CDj_is,)h(PVj_ms,)g(LONPOLEs,)f(LATPOLEs) 1002 1458 y(TCTYPn,)h(TCTYns,)g(TCUNIn,)g(TCUNns,)g(TCRVLn,)f(TCRVns,)h (TCRPXn,)1002 1571 y(TCRPks,)g(TCDn_k,)g(TCn_ks,)g(TPVn_m,)g(TPn_ms,)f (TCDLTn,)h(TCROTn)1002 1684 y(jCTYPn,)g(jCTYns,)g(jCUNIn,)g(jCUNns,)g (jCRVLn,)f(jCRVns,)h(iCRPXn,)1002 1797 y(iCRPns,)g(jiCDn,)94 b(jiCDns,)46 b(jPVn_m,)g(jPn_ms,)f(jCDLTn,)h(jCROTn)1002 1910 y(\(i,j,m,n)g(are)h(integers,)e(s)i(is)h(any)f(letter\))95 2023 y(TYP_REFSYS_KEY)d(120)j(EQUINOXs,)f(EPOCH,)g(MJD-OBSs,)f (RADECSYS,)g(RADESYSs,)g(DATE-OBS)95 2136 y(TYP_COMM_KEY)140 b(130)47 b(COMMENT,)f(HISTORY,)f(\(blank)h(keyword\))95 2249 y(TYP_CONT_KEY)140 b(140)47 b(CONTINUE)95 2362 y(TYP_USER_KEY)140 b(150)47 b(all)g(other)g(keywords)95 2588 y(int)g(fits_get_keyclass)c (/)48 b(ffgkcl)e(\(char)g(*card\))0 2839 y Fi(16)g Fj(P)m(arse)28 b(the)g('TF)m(ORM')g(binary)f(table)h(column)g(format)f(string.)40 b(This)27 b(routine)g(parses)g(the)h(input)f(TF)m(ORM)227 2952 y(c)m(haracter)38 b(string)d(and)g(returns)g(the)g(in)m(teger)i (data)g(t)m(yp)s(e)f(co)s(de,)h(the)f(rep)s(eat)g(coun)m(t)g(of)g(the)f (\014eld,)i(and,)227 3065 y(in)e(the)f(case)i(of)f(c)m(haracter)h (string)f(\014elds,)g(the)g(length)g(of)g(the)g(unit)f(string.)54 b(See)34 b(App)s(endix)f(B)i(for)g(the)227 3178 y(allo)m(w)m(ed)41 b(v)-5 b(alues)38 b(for)h(the)f(returned)g(t)m(yp)s(eco)s(de)h (parameter.)65 b(A)39 b(n)m(ull)f(p)s(oin)m(ter)h(ma)m(y)g(b)s(e)f(giv) m(en)h(for)g(an)m(y)227 3291 y(output)30 b(parameters)h(that)g(are)g (not)f(needed.)143 3543 y Fe(int)47 b(fits_binary_tform)c(/)48 b(ffbnfm)334 3656 y(\(char)e(*tform,)g(>)i(int)f(*typecode,)e(long)h (*repeat,)g(long)g(*width,)382 3768 y(int)h(*status\))143 3994 y(int)g(fits_binary_tformll)c(/)k(ffbnfmll)334 4107 y(\(char)f(*tform,)g(>)i(int)f(*typecode,)e(LONGLONG)g(*repeat,)h(long) g(*width,)382 4220 y(int)h(*status\))0 4472 y Fi(17)f Fj(P)m(arse)38 b(the)f('TF)m(ORM')h(k)m(eyw)m(ord)g(v)-5 b(alue)37 b(that)h(de\014nes)e(the)h(column)g(format)h(in)e(an)h(ASCI)s (I)f(table.)62 b(This)227 4585 y(routine)29 b(parses)g(the)g(input)f (TF)m(ORM)h(c)m(haracter)h(string)f(and)g(returns)e(the)i(data)h(t)m (yp)s(e)f(co)s(de,)h(the)f(width)227 4698 y(of)f(the)f(column,)h(and)f (\(if)h(it)g(is)f(a)h(\015oating)g(p)s(oin)m(t)g(column\))f(the)h(n)m (um)m(b)s(er)e(of)h(decimal)i(places)f(to)g(the)f(righ)m(t)227 4811 y(of)39 b(the)f(decimal)h(p)s(oin)m(t.)65 b(The)38 b(returned)f(data)i(t)m(yp)s(e)f(co)s(des)g(are)h(the)g(same)f(as)h (for)f(the)g(binary)g(table,)227 4924 y(with)26 b(the)h(follo)m(wing)h (additional)f(rules:)38 b(in)m(teger)28 b(columns)e(that)h(are)f(b)s (et)m(w)m(een)h(1)g(and)f(4)g(c)m(haracters)i(wide)227 5036 y(are)i(de\014ned)e(to)j(b)s(e)d(short)i(in)m(tegers)g(\(co)s(de)g (=)g(TSHOR)-8 b(T\).)29 b(Wider)g(in)m(teger)i(columns)e(are)h (de\014ned)e(to)j(b)s(e)227 5149 y(regular)39 b(in)m(tegers)g(\(co)s (de)g(=)f(TLONG\).)h(Similarly)-8 b(,)41 b(Fixed)e(decimal)g(p)s(oin)m (t)f(columns)g(\(with)h(TF)m(ORM)227 5262 y(=)c('Fw.d'\))g(are)h (de\014ned)d(to)j(b)s(e)e(single)i(precision)f(reals)h(\(co)s(de)f(=)g (TFLO)m(A)-8 b(T\))35 b(if)g(w)g(is)g(b)s(et)m(w)m(een)g(1)h(and)227 5375 y(7)42 b(c)m(haracters)h(wide,)h(inclusiv)m(e.)75 b(Wider)41 b('F')h(columns)f(will)h(return)e(a)i(double)f(precision)h (data)g(co)s(de)227 5488 y(\(=)32 b(TDOUBLE\).)h('Ew.d')f(format)g (columns)g(will)g(ha)m(v)m(e)i(dataco)s(de)f(=)e(TFLO)m(A)-8 b(T,)33 b(and)e('Dw.d')i(format)227 5601 y(columns)45 b(will)h(ha)m(v)m(e)h(dataco)s(de)f(=)f(TDOUBLE.)g(A)h(n)m(ull)f(p)s (oin)m(ter)h(ma)m(y)f(b)s(e)g(giv)m(en)i(for)e(an)m(y)g(output)227 5714 y(parameters)31 b(that)g(are)g(not)f(needed.)p eop end %%Page: 71 79 TeXDict begin 71 78 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.71) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.8.)72 b(UTILITY)30 b(R)m(OUTINES)2693 b Fj(71)95 555 y Fe(int)47 b(fits_ascii_tform)d(/)j(ffasfm)286 668 y(\(char)g(*tform,)f(>)h(int)g (*typecode,)e(long)i(*width,)e(int)i(*decimals,)334 781 y(int)g(*status\))0 1003 y Fi(18)f Fj(Calculate)32 b(the)f(starting)g (column)g(p)s(ositions)f(and)g(total)i(ASCI)s(I)d(table)j(width)d (based)i(on)f(the)h(input)e(arra)m(y)227 1116 y(of)e(ASCI)s(I)e(table)i (TF)m(ORM)g(v)-5 b(alues.)40 b(The)26 b(SP)-8 b(A)m(CE)27 b(input)e(parameter)i(de\014nes)f(ho)m(w)h(man)m(y)f(blank)h(spaces)227 1229 y(to)40 b(lea)m(v)m(e)i(b)s(et)m(w)m(een)e(eac)m(h)g(column)g (\(it)g(is)f(recommended)g(to)h(ha)m(v)m(e)h(one)e(space)h(b)s(et)m(w)m (een)g(columns)f(for)227 1342 y(b)s(etter)31 b(h)m(uman)e(readabilit)m (y\).)95 1564 y Fe(int)47 b(fits_get_tbcol)d(/)k(ffgabc)286 1676 y(\(int)f(tfields,)f(char)g(**tform,)g(int)h(space,)f(>)h(long)g (*rowlen,)334 1789 y(long)g(*tbcol,)f(int)g(*status\))0 2011 y Fi(19)g Fj(P)m(arse)27 b(a)g(template)h(header)e(record)g(and)g (return)g(a)g(formatted)h(80-c)m(haracter)j(string)c(suitable)h(for)f (app)s(end-)227 2124 y(ing)40 b(to)f(\(or)h(deleting)g(from\))f(a)g (FITS)g(header)g(\014le.)67 b(This)38 b(routine)h(is)g(useful)g(for)f (parsing)h(lines)g(from)227 2237 y(an)33 b(ASCI)s(I)f(template)i (\014le)f(and)g(reformatting)h(them)f(in)m(to)h(legal)h(FITS)d(header)h (records.)49 b(The)32 b(format-)227 2350 y(ted)i(string)g(ma)m(y)g (then)f(b)s(e)g(passed)h(to)g(the)g(\014ts)p 1880 2350 28 4 v 32 w(write)p 2114 2350 V 33 w(record,)h(\013mcrd,)f(or)g(\014ts) p 3007 2350 V 32 w(delete)p 3270 2350 V 34 w(k)m(ey)h(routines)e(to)227 2463 y(app)s(end)c(or)h(mo)s(dify)g(a)h(FITS)e(header)h(record.)95 2685 y Fe(int)47 b(fits_parse_template)c(/)k(ffgthd)286 2798 y(\(char)g(*templt,)e(>)j(char)e(*card,)g(int)h(*keytype,)f(int)h (*status\))0 3020 y Fj(The)31 b(input)g(templt)h(c)m(haracter)h(string) f(generally)h(should)d(con)m(tain)j(3)f(tok)m(ens:)44 b(\(1\))33 b(the)f(KEYNAME,)g(\(2\))h(the)0 3133 y(V)-10 b(ALUE,)37 b(and)f(\(3\))i(the)f(COMMENT)g(string.)59 b(The)37 b(TEMPLA)-8 b(TE)36 b(string)h(m)m(ust)f(adhere)h(to)h(the)e (follo)m(wing)0 3245 y(format:)0 3467 y Fi(-)80 b Fj(The)32 b(KEYNAME)h(tok)m(en)h(m)m(ust)f(b)s(egin)f(in)h(columns)f(1-8)i(and)e (b)s(e)g(a)h(maxim)m(um)g(of)g(8)g(c)m(haracters)h(long.)49 b(A)227 3580 y(legal)30 b(FITS)e(k)m(eyw)m(ord)h(name)f(ma)m(y)h(only)f (con)m(tain)i(the)f(c)m(haracters)g(A-Z,)g(0-9,)h(and)e('-')h(\(min)m (us)f(sign\))h(and)227 3693 y(underscore.)40 b(This)27 b(routine)i(will)g(automatically)i(con)m(v)m(ert)f(an)m(y)f(lo)m(w)m (ercase)i(c)m(haracters)f(to)g(upp)s(ercase)d(in)227 3806 y(the)k(output)f(string.)42 b(If)30 b(the)h(\014rst)f(8)h(c)m (haracters)h(of)f(the)g(template)h(line)f(are)g(blank)f(then)h(the)g (remainder)227 3919 y(of)g(the)f(line)h(is)g(considered)f(to)h(b)s(e)f (a)g(FITS)g(commen)m(t)h(\(with)g(a)g(blank)f(k)m(eyw)m(ord)g(name\).)0 4141 y Fi(-)80 b Fj(The)26 b(V)-10 b(ALUE)26 b(tok)m(en)h(m)m(ust)e(b)s (e)h(separated)g(from)f(the)i(KEYNAME)f(tok)m(en)h(b)m(y)f(one)g(or)g (more)g(spaces)g(and/or)227 4254 y(an)g('=')g(c)m(haracter.)41 b(The)25 b(data)h(t)m(yp)s(e)g(of)g(the)g(V)-10 b(ALUE)26 b(tok)m(en)g(\(n)m(umeric,)h(logical,)j(or)c(c)m(haracter)h(string\))f (is)227 4367 y(automatically)35 b(determined)c(and)h(the)g(output)f (CARD)h(string)g(is)g(formatted)g(accordingly)-8 b(.)47 b(The)31 b(v)-5 b(alue)227 4480 y(tok)m(en)34 b(ma)m(y)f(b)s(e)f (forced)g(to)i(b)s(e)e(in)m(terpreted)g(as)h(a)g(string)g(\(e.g.)48 b(if)33 b(it)g(is)f(a)h(string)g(of)f(n)m(umeric)h(digits\))g(b)m(y)227 4593 y(enclosing)g(it)f(in)f(single)h(quotes.)45 b(If)31 b(the)h(v)-5 b(alue)32 b(tok)m(en)g(is)g(a)g(c)m(haracter)h(string)e (that)i(con)m(tains)f(1)g(or)g(more)227 4706 y(em)m(b)s(edded)39 b(blank)g(space)h(c)m(haracters)h(or)e(slash)h(\('/'\))h(c)m(haracters) g(then)e(the)g(en)m(tire)i(c)m(haracter)g(string)227 4818 y(m)m(ust)31 b(b)s(e)e(enclosed)i(in)f(single)h(quotes.)0 5040 y Fi(-)80 b Fj(The)28 b(COMMENT)g(tok)m(en)h(is)f(optional,)i(but) e(if)g(presen)m(t)g(m)m(ust)g(b)s(e)g(separated)g(from)g(the)h(V)-10 b(ALUE)28 b(tok)m(en)h(b)m(y)227 5153 y(a)i(blank)f(space)h(or)f(a)h ('/')g(c)m(haracter.)0 5375 y Fi(-)80 b Fj(One)29 b(exception)h(to)f (the)g(ab)s(o)m(v)m(e)i(rules)d(is)h(that)g(if)g(the)g(\014rst)g (non-blank)f(c)m(haracter)i(in)f(the)g(\014rst)f(8)h(c)m(haracters)227 5488 y(of)24 b(the)h(template)g(string)f(is)g(a)g(min)m(us)g(sign)g (\('-'\))h(follo)m(w)m(ed)h(b)m(y)e(a)g(single)h(tok)m(en,)h(or)e(a)h (single)f(tok)m(en)h(follo)m(w)m(ed)227 5601 y(b)m(y)k(an)g(equal)h (sign,)g(then)f(it)g(is)h(in)m(terpreted)f(as)h(the)f(name)g(of)h(a)f (k)m(eyw)m(ord)h(whic)m(h)f(is)g(to)h(b)s(e)e(deleted)i(from)227 5714 y(the)h(FITS)e(header.)p eop end %%Page: 72 80 TeXDict begin 72 79 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.72) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(72)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 555 y Fi(-)80 b Fj(The)32 b(second)g(exception)h(is)f(that)h(if)f(the)g(template)h(string)f (starts)h(with)e(a)i(min)m(us)e(sign)h(and)f(is)h(follo)m(w)m(ed)i(b)m (y)227 668 y(2)f(tok)m(ens)g(\(without)g(an)f(equals)h(sign)g(b)s(et)m (w)m(een)g(them\))f(then)g(the)h(second)f(tok)m(en)i(is)e(in)m (terpreted)h(as)g(the)227 781 y(new)f(name)h(for)f(the)h(k)m(eyw)m(ord) g(sp)s(eci\014ed)f(b)m(y)h(\014rst)f(tok)m(en.)48 b(In)32 b(this)g(case)i(the)f(old)g(k)m(eyw)m(ord)g(name)f(\(\014rst)227 894 y(tok)m(en\))c(is)e(returned)e(in)i(c)m(haracters)h(1-8)g(of)g(the) f(returned)e(CARD)j(string,)g(and)e(the)h(new)f(k)m(eyw)m(ord)i(name) 227 1007 y(\(the)35 b(second)e(tok)m(en\))j(is)e(returned)e(in)i(c)m (haracters)h(41-48)h(of)e(the)g(returned)e(CARD)i(string.)51 b(These)34 b(old)227 1120 y(and)i(new)f(names)h(ma)m(y)h(then)f(b)s(e)f (passed)g(to)i(the)f(\013mnam)g(routine)g(whic)m(h)g(will)g(c)m(hange)h (the)f(k)m(eyw)m(ord)227 1233 y(name.)0 1497 y(The)30 b(k)m(eyt)m(yp)s(e)h(output)f(parameter)h(indicates)g(ho)m(w)g(the)f (returned)g(CARD)g(string)g(should)g(b)s(e)f(in)m(terpreted:)382 1761 y Fe(keytype)857 b(interpretation)382 1873 y(-------)475 b(-------------------------)o(----)o(---)o(----)o(----)o(---)o(----)o (--)525 1986 y(-2)572 b(Rename)46 b(the)h(keyword)f(with)h(name)f(=)i (the)f(first)f(8)h(characters)e(of)j(CARD)1193 2099 y(to)f(the)g(new)g (name)g(given)f(in)h(characters)e(41)j(-)f(48)g(of)g(CARD.)525 2325 y(-1)572 b(delete)46 b(the)h(keyword)f(with)h(this)f(name)h(from)g (the)f(FITS)h(header.)573 2551 y(0)572 b(append)46 b(the)h(CARD)g (string)f(to)h(the)g(FITS)g(header)f(if)h(the)1193 2664 y(keyword)f(does)h(not)g(already)e(exist,)h(otherwise)g(update)1193 2777 y(the)h(keyword)f(value)g(and/or)g(comment)g(field)h(if)g(is)g (already)f(exists.)573 3003 y(1)572 b(This)47 b(is)g(a)g(HISTORY)f(or)h (COMMENT)f(keyword;)g(append)g(it)h(to)g(the)g(header)573 3228 y(2)572 b(END)47 b(record;)f(do)h(not)g(explicitly)e(write)h(it)i (to)f(the)g(FITS)f(file.)0 3492 y Fj(EXAMPLES:)30 b(The)g(follo)m(wing) i(lines)e(illustrate)i(v)-5 b(alid)31 b(input)e(template)j(strings:)286 3756 y Fe(INTVAL)46 b(7)i(/)f(This)g(is)g(an)g(integer)f(keyword)286 3869 y(RVAL)524 b(34.6)142 b(/)239 b(This)46 b(is)i(a)f(floating)f (point)g(keyword)286 3982 y(EVAL=-12.45E-03)92 b(/)47 b(This)g(is)g(a)g(floating)f(point)g(keyword)g(in)h(exponential)e (notation)286 4095 y(lval)i(F)g(/)h(This)f(is)g(a)g(boolean)f(keyword) 859 4208 y(This)h(is)g(a)g(comment)f(keyword)g(with)h(a)g(blank)f (keyword)g(name)286 4321 y(SVAL1)h(=)g('Hello)f(world')142 b(/)95 b(this)47 b(is)g(a)g(string)f(keyword)286 4434 y(SVAL2)94 b('123.5')g(this)47 b(is)g(also)f(a)i(string)e(keyword)286 4547 y(sval3)94 b(123+)h(/)g(this)47 b(is)g(also)f(a)i(string)e (keyword)g(with)g(the)h(value)g('123+)189 b(')286 4660 y(#)48 b(the)f(following)e(template)h(line)g(deletes)g(the)h(DATE)g (keyword)286 4772 y(-)h(DATE)286 4885 y(#)g(the)f(following)e(template) h(line)g(modifies)g(the)h(NAME)f(keyword)g(to)h(OBJECT)286 4998 y(-)h(NAME)e(OBJECT)0 5262 y Fi(20)g Fj(T)-8 b(ranslate)32 b(a)g(k)m(eyw)m(ord)g(name)f(in)m(to)h(a)g(new)f(name,)h(based)f(on)g (a)h(set)f(of)h(patterns.)43 b(This)31 b(routine)g(is)h(useful)227 5375 y(for)j(translating)h(k)m(eyw)m(ords)g(in)e(cases)i(suc)m(h)f(as)h (adding)e(or)h(deleting)h(columns)f(in)g(a)g(table,)j(or)d(cop)m(ying) 227 5488 y(a)41 b(column)g(from)f(one)h(table)g(to)g(another,)j(or)c (extracting)j(an)d(arra)m(y)h(from)f(a)h(cell)h(in)e(a)h(binary)f (table)227 5601 y(column)31 b(in)m(to)g(an)g(image)g(extension.)42 b(In)30 b(these)h(cases,)h(it)f(is)g(necessary)g(to)g(translate)h(the)f (names)f(of)h(the)227 5714 y(k)m(eyw)m(ords)f(asso)s(ciated)i(with)d (the)h(original)h(table)g(column\(s\))f(in)m(to)g(the)g(appropriate)g (k)m(eyw)m(ord)g(name)g(in)p eop end %%Page: 73 81 TeXDict begin 73 80 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.73) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.8.)72 b(UTILITY)30 b(R)m(OUTINES)2693 b Fj(73)227 555 y(the)37 b(\014nal)f(\014le.)58 b(F)-8 b(or)37 b(example,)i(if)d(column)h(2)f (is)h(deleted)g(from)e(a)i(table,)i(then)d(the)h(v)-5 b(alue)36 b(of)h('n')f(in)g(all)227 668 y(the)c(TF)m(ORMn)g(and)f (TTYPEn)f(k)m(eyw)m(ords)i(for)g(columns)f(3)h(and)f(higher)h(m)m(ust)f (b)s(e)g(decremen)m(ted)i(b)m(y)e(1.)227 781 y(Ev)m(en)j(more)g (complex)h(translations)f(are)h(sometimes)f(needed)g(to)h(con)m(v)m (ert)g(the)f(W)m(CS)g(k)m(eyw)m(ords)g(when)227 894 y(extracting)e(an)f (image)g(out)g(of)f(a)h(table)g(column)g(cell)g(in)m(to)h(a)e(separate) i(image)f(extension.)227 1044 y(The)g(user)f(passes)i(an)f(arra)m(y)g (of)h(patterns)f(to)h(b)s(e)e(matc)m(hed.)44 b(Input)30 b(pattern)h(n)m(um)m(b)s(er)f(i)i(is)f(pattern[i][0],)227 1157 y(and)j(output)f(pattern)h(n)m(um)m(b)s(er)f(i)h(is)g (pattern[i][1].)53 b(Keyw)m(ords)34 b(are)g(matc)m(hed)h(against)g(the) f(input)f(pat-)227 1270 y(terns.)41 b(If)30 b(a)g(matc)m(h)i(is)e (found)f(then)h(the)h(k)m(eyw)m(ord)g(is)f(re-written)h(according)g(to) g(the)g(output)f(pattern.)227 1420 y(Order)41 b(is)h(imp)s(ortan)m(t.) 76 b(The)41 b(\014rst)h(matc)m(h)h(is)f(accepted.)77 b(The)41 b(fastest)i(matc)m(h)g(will)f(b)s(e)g(made)g(when)227 1533 y(templates)32 b(with)e(the)h(same)f(\014rst)g(c)m(haracter)i(are) f(group)s(ed)e(together.)227 1683 y(Sev)m(eral)j(c)m(haracters)f(ha)m (v)m(e)h(sp)s(ecial)f(meanings:)466 1933 y Fe(i,j)47 b(-)g(single)f(digits,)g(preserved)f(in)j(output)e(template)466 2046 y(n)h(-)h(column)e(number)g(of)h(one)g(or)g(more)g(digits,)f (preserved)f(in)i(output)f(template)466 2159 y(m)h(-)h(generic)e (number)g(of)h(one)g(or)g(more)g(digits,)e(preserved)h(in)h(output)f (template)466 2271 y(a)h(-)h(coordinate)d(designator,)g(preserved)g(in) i(output)f(template)466 2384 y(#)h(-)h(number)e(of)h(one)g(or)g(more)g (digits)466 2497 y(?)g(-)h(any)f(character)466 2610 y(*)g(-)h(only)e (allowed)g(in)h(first)g(character)e(position,)g(to)j(match)e(all)657 2723 y(keywords;)f(only)i(useful)f(as)h(last)g(pattern)e(in)j(the)f (list)227 2973 y Fj(i,)31 b(j,)f(n,)g(and)g(m)g(are)h(returned)e(b)m(y) i(the)f(routine.)227 3123 y(F)-8 b(or)27 b(example,)g(the)f(input)f (pattern)h("iCTYPn")g(will)g(matc)m(h)h("1CTYP5")g(\(if)f(n)p 3003 3123 28 4 v 32 w(v)-5 b(alue)26 b(is)g(5\);)i(the)e(output)227 3236 y(pattern)31 b("CTYPEi")f(will)h(b)s(e)f(re-written)h(as)f ("CTYPE1".)42 b(Notice)32 b(that)f("i")g(is)g(preserv)m(ed.)227 3386 y(The)f(follo)m(wing)i(output)e(patterns)g(are)h(sp)s(ecial:)227 3536 y("-")h(-)e(do)h(not)f(cop)m(y)h(a)g(k)m(eyw)m(ord)g(that)g(matc)m (hes)g(the)g(corresp)s(onding)e(input)h(pattern)227 3686 y("+")h(-)g(cop)m(y)g(the)f(input)g(unc)m(hanged)227 3836 y(The)f(inrec)h(string)g(could)g(b)s(e)f(just)g(the)h(8-c)m(har)h (k)m(eyw)m(ord)f(name,)g(or)f(the)h(en)m(tire)h(80-c)m(har)g(header)f (record.)227 3949 y(Characters)h(9)g(-)f(80)h(in)g(the)f(input)g (string)g(simply)g(get)h(app)s(ended)e(to)i(the)g(translated)g(k)m(eyw) m(ord)f(name.)227 4100 y(If)h(n)p 375 4100 V 33 w(range)g(=)g(0,)i (then)e(only)h(k)m(eyw)m(ords)f(with)h('n')f(equal)h(to)g(n)p 2410 4100 V 32 w(v)-5 b(alue)32 b(will)g(b)s(e)f(considered)g(as)h(a)g (pattern)227 4212 y(matc)m(h.)70 b(If)39 b(n)p 722 4212 V 32 w(range)h(=)f(+1,)j(then)e(all)g(v)-5 b(alues)40 b(of)g('n')f(greater)i(than)e(or)h(equal)g(to)g(n)p 3269 4212 V 33 w(v)-5 b(alue)40 b(will)g(b)s(e)f(a)227 4325 y(matc)m(h,)32 b(and)e(if)g(-1,)h(then)f(v)-5 b(alues)31 b(of)g('n')f(less)g(than)h(or)f(equal)h(to)g(n)p 2530 4325 V 32 w(v)-5 b(alue)31 b(will)g(matc)m(h.)0 4585 y Fe(int)47 b(fits_translate_keyword\()286 4698 y(char)g(*inrec,)380 b(/*)47 b(I)h(-)f(input)f(string)g(*/)286 4811 y(char)h(*outrec,)332 b(/*)47 b(O)h(-)f(output)f(converted)f(string,)h(or)h(*/)1241 4924 y(/*)238 b(a)47 b(null)g(string)f(if)h(input)g(does)f(not)95 b(*/)1241 5036 y(/*)238 b(match)46 b(any)h(of)g(the)g(patterns)f(*/)286 5149 y(char)h(*patterns[][2],/*)c(I)48 b(-)f(pointer)f(to)h(input)f(/)i (output)e(string)g(*/)1241 5262 y(/*)238 b(templates)45 b(*/)286 5375 y(int)i(npat,)524 b(/*)47 b(I)h(-)f(number)f(of)h (templates)f(passed)g(*/)286 5488 y(int)h(n_value,)380 b(/*)47 b(I)h(-)f(base)g('n')g(template)e(value)h(of)i(interest)d(*/) 286 5601 y(int)i(n_offset,)332 b(/*)47 b(I)h(-)f(offset)f(to)h(be)g (applied)f(to)h(the)g('n')g(*/)1241 5714 y(/*)238 b(value)46 b(in)i(the)e(output)h(string)f(*/)p eop end %%Page: 74 82 TeXDict begin 74 81 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.74) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(74)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)286 555 y Fe(int)47 b(n_range,)380 b(/*)47 b(I)h(-)f(controls)f(range)g(of)h('n')g(template)f(*/)1241 668 y(/*)238 b(values)46 b(of)h(interest)f(\(-1,0,)g(or)h(+1\))g(*/)286 781 y(int)g(*pat_num,)332 b(/*)47 b(O)h(-)f(matched)f(pattern)g(number) g(\(0)h(based\))f(or)h(-1)g(*/)286 894 y(int)g(*i,)620 b(/*)47 b(O)h(-)f(value)f(of)i(i,)f(if)g(any,)g(else)f(0)i(*/)286 1007 y(int)f(*j,)620 b(/*)47 b(O)h(-)f(value)f(of)i(j,)f(if)g(any,)g (else)f(0)i(*/)286 1120 y(int)f(*m,)620 b(/*)47 b(O)h(-)f(value)f(of)i (m,)f(if)g(any,)g(else)f(0)i(*/)286 1233 y(int)f(*n,)620 b(/*)47 b(O)h(-)f(value)f(of)i(n,)f(if)g(any,)g(else)f(0)i(*/)286 1346 y(int)f(*status\))380 b(/*)47 b(IO)g(-)h(error)e(status)g(*/)80 1591 y Fj(Here)25 b(is)f(an)g(example)g(of)g(some)h(of)f(the)g (patterns)g(used)f(to)i(con)m(v)m(ert)g(the)f(k)m(eyw)m(ords)h(asso)s (ciated)g(with)f(an)g(image)227 1704 y(in)30 b(a)h(cell)h(of)e(a)h (table)g(column)f(in)m(to)i(the)e(k)m(eyw)m(ords)h(appropriate)f(for)h (an)f(IMA)m(GE)h(extension:)191 1949 y Fe(char)47 b(*patterns[][2])c(=) 48 b({{"TSCALn",)92 b("BSCALE")i(},)h(/*)47 b(Standard)e(FITS)i (keywords)e(*/)143 2062 y({"TZEROn",)93 b("BZERO")141 b(},)143 2175 y({"TUNITn",)93 b("BUNIT")141 b(},)143 2288 y({"TNULLn",)93 b("BLANK")141 b(},)143 2401 y({"TDMINn",)93 b("DATAMIN")45 b(},)143 2514 y({"TDMAXn",)93 b("DATAMAX")45 b(},)143 2626 y({"iCTYPn",)93 b("CTYPEi")g(},)i(/*)47 b(Coordinate)e(labels)h(*/)143 2739 y({"iCTYna",)93 b("CTYPEia")45 b(},)143 2852 y({"iCUNIn",)93 b("CUNITi")g(},)i(/*)47 b(Coordinate)e(units)i(*/)143 2965 y({"iCUNna",)93 b("CUNITia")45 b(},)143 3078 y({"iCRVLn",)93 b("CRVALi")g(},)i(/*)47 b(WCS)g(keywords)f(*/)143 3191 y({"iCRVna",)93 b("CRVALia")45 b(},)143 3304 y({"iCDLTn",)93 b("CDELTi")g(},)143 3417 y({"iCDEna",)g("CDELTia")45 b(},)143 3530 y({"iCRPXn",)93 b("CRPIXi")g(},)143 3643 y({"iCRPna",)g("CRPIXia")45 b(},)143 3756 y({"ijPCna",)93 b("PCi_ja")g(},)143 3868 y({"ijCDna",)g("CDi_ja")g(},)143 3981 y({"iVn_ma",)g("PVi_ma")g(},)143 4094 y({"iSn_ma",)g("PSi_ma")g(},)143 4207 y({"iCRDna",)g("CRDERia")45 b(},)143 4320 y({"iCSYna",)93 b("CSYERia")45 b(},)143 4433 y({"iCROTn",)93 b("CROTAi")g(},)143 4546 y({"WCAXna",)g ("WCSAXESa"},)143 4659 y({"WCSNna",)g("WCSNAMEa"}};)0 4904 y Fi(21)46 b Fj(T)-8 b(ranslate)26 b(the)f(k)m(eyw)m(ords)g(in)g (the)g(input)e(HDU)j(in)m(to)g(the)f(k)m(eyw)m(ords)g(that)h(are)f (appropriate)g(for)f(the)h(output)227 5017 y(HDU.)32 b(This)d(is)i(a)f(driv)m(er)h(routine)f(that)h(calls)g(the)g (previously)f(describ)s(ed)f(routine.)0 5262 y Fe(int)47 b(fits_translate_keywords\()143 5375 y(fitsfile)f(*infptr,)141 b(/*)47 b(I)g(-)h(pointer)e(to)h(input)f(HDU)h(*/)143 5488 y(fitsfile)f(*outfptr,)93 b(/*)47 b(I)g(-)h(pointer)e(to)h(output) f(HDU)h(*/)143 5601 y(int)g(firstkey,)332 b(/*)47 b(I)g(-)h(first)e (HDU)h(record)f(number)g(to)h(start)g(with)f(*/)143 5714 y(char)h(*patterns[][2],/*)c(I)k(-)h(pointer)e(to)h(input)f(/)i(output) e(keyword)g(templates)f(*/)p eop end %%Page: 75 83 TeXDict begin 75 82 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.75) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(5.8.)72 b(UTILITY)30 b(R)m(OUTINES)2693 b Fj(75)143 555 y Fe(int)47 b(npat,)524 b(/*)47 b(I)g(-)h(number)e(of)h(templates)e(passed)h(*/)143 668 y(int)h(n_value,)380 b(/*)47 b(I)g(-)h(base)e('n')h(template)f (value)g(of)h(interest)f(*/)143 781 y(int)h(n_offset,)332 b(/*)47 b(I)g(-)h(offset)e(to)h(be)g(applied)f(to)h(the)g('n')g(*/)1193 894 y(/*)238 b(value)47 b(in)g(the)g(output)f(string)g(*/)143 1007 y(int)h(n_range,)380 b(/*)47 b(I)g(-)h(controls)d(range)i(of)g ('n')g(template)e(*/)1098 1120 y(/*)238 b(values)46 b(of)h(interest)f (\(-1,0,)g(or)h(+1\))g(*/)143 1233 y(int)g(*status\))380 b(/*)47 b(IO)g(-)h(error)e(status)g(*/)0 1499 y Fi(22)g Fj(P)m(arse)35 b(the)g(input)f(string)h(con)m(taining)h(a)f(list)h(of)f (ro)m(ws)f(or)h(ro)m(w)g(ranges,)h(and)e(return)g(in)m(teger)i(arra)m (ys)f(con-)227 1612 y(taining)27 b(the)f(\014rst)f(and)g(last)i(ro)m(w) f(in)f(eac)m(h)i(range.)40 b(F)-8 b(or)26 b(example,)i(if)d(ro)m(wlist) i(=)e("3-5,)k(6,)e(8-9")h(then)d(it)i(will)227 1724 y(return)34 b(n)m(umranges)h(=)g(3,)h(rangemin)f(=)g(3,)i(6,)g(8)e(and)g(rangemax)g (=)g(5,)i(6,)g(9.)55 b(A)m(t)36 b(most,)h('maxranges')227 1837 y(n)m(um)m(b)s(er)31 b(of)h(ranges)f(will)h(b)s(e)g(returned.)43 b('maxro)m(ws')32 b(is)g(the)g(maxim)m(um)g(n)m(um)m(b)s(er)e(of)i(ro)m (ws)g(in)f(the)h(table;)227 1950 y(an)m(y)e(ro)m(ws)f(or)g(ranges)g (larger)h(than)f(this)g(will)g(b)s(e)g(ignored.)40 b(The)29 b(ro)m(ws)g(m)m(ust)g(b)s(e)f(sp)s(eci\014ed)h(in)f(increasing)227 2063 y(order,)33 b(and)f(the)g(ranges)h(m)m(ust)f(not)g(o)m(v)m(erlap.) 48 b(A)33 b(min)m(us)e(sign)i(ma)m(y)g(b)s(e)e(use)h(to)h(sp)s(ecify)f (all)h(the)g(ro)m(ws)f(to)227 2176 y(the)h(upp)s(er)d(or)j(lo)m(w)m(er) h(b)s(ound,)d(so)i("50-")h(means)e(all)i(the)f(ro)m(ws)f(from)g(50)h (to)h(the)e(end)g(of)h(the)f(table,)j(and)227 2289 y("-")d(means)e(all) h(the)g(ro)m(ws)f(in)g(the)h(table,)g(from)f(1)h(-)g(maxro)m(ws.)191 2555 y Fe(int)47 b(fits_parse_range)c(/)48 b(ffrwrg\(char)c(*rowlist,)i (LONGLONG)f(maxrows,)h(int)h(maxranges,)e(>)334 2668 y(int)i(*numranges,)e(long)h(*rangemin,)f(long)i(*rangemax,)e(int)i (*status\))191 2894 y(int)g(fits_parse_rangell)c(/)k(ffrwrgll\(char)d (*rowlist,)i(LONGLONG)f(maxrows,)h(int)h(maxranges,)e(>)334 3007 y(int)i(*numranges,)e(LONGLONG)g(*rangemin,)g(LONGLONG)h (*rangemax,)f(int)i(*status\))0 3272 y Fi(23)f Fj(Chec)m(k)37 b(that)g(the)g(Header)g(\014ll)g(b)m(ytes)g(\(if)g(an)m(y\))g(are)g (all)h(blank.)59 b(These)36 b(are)h(the)g(b)m(ytes)g(that)g(ma)m(y)h (follo)m(w)227 3385 y(END)e(k)m(eyw)m(ord)g(and)f(b)s(efore)g(the)h(b)s (eginning)f(of)h(data)g(unit,)g(or)g(the)g(end)f(of)g(the)h(HDU)g(if)g (there)f(is)h(no)227 3498 y(data)31 b(unit.)191 3764 y Fe(int)47 b(ffchfl\(fitsfile)c(*fptr,)k(>)g(int)g(*status\))0 4030 y Fi(24)f Fj(Chec)m(k)30 b(that)g(the)f(Data)i(\014ll)e(b)m(ytes)h (\(if)g(an)m(y\))g(are)g(all)g(zero)g(\(for)f(IMA)m(GE)i(or)e(BINAR)-8 b(Y)30 b(T)-8 b(able)30 b(HDU\))h(or)e(all)227 4143 y(blanks)g(\(for)g (ASCI)s(I)f(table)i(HDU\).)g(These)f(\014le)g(b)m(ytes)h(ma)m(y)f(b)s (e)g(lo)s(cated)h(after)g(the)f(last)h(v)-5 b(alid)29 b(data)h(b)m(yte)227 4256 y(in)g(the)h(HDU)g(and)f(b)s(efore)g(the)g (ph)m(ysical)h(end)f(of)h(the)f(HDU.)191 4522 y Fe(int)47 b(ffcdfl\(fitsfile)c(*fptr,)k(>)g(int)g(*status\))0 4788 y Fi(25)f Fj(Estimate)35 b(the)e(ro)s(ot-mean-squared)h(\(RMS\))f (noise)h(in)f(an)g(image.)51 b(These)33 b(routines)g(are)h(mainly)f (for)g(use)227 4901 y(with)25 b(the)g(Hcompress)g(image)i(compression)e (algorithm.)40 b(They)24 b(return)g(an)h(estimate)i(of)e(the)h(RMS)f (noise)227 5014 y(in)38 b(the)f(bac)m(kground)h(pixels)f(of)h(the)g (image.)64 b(This)36 b(robust)h(algorithm)i(\(written)f(b)m(y)f(Ric)m (hard)h(White,)227 5127 y(STScI\))e(\014rst)f(attempts)i(to)g(estimate) h(the)f(RMS)e(v)-5 b(alue)37 b(as)g(1.68)g(times)g(the)f(median)g(of)h (the)f(absolute)227 5240 y(di\013erences)26 b(b)s(et)m(w)m(een)h (successiv)m(e)g(pixels)f(in)g(the)g(image.)41 b(If)25 b(the)h(median)g(=)f(0,)j(then)d(the)h(algorithm)h(falls)227 5352 y(bac)m(k)h(to)f(computing)g(the)g(RMS)f(of)h(the)g(di\013erence)g (b)s(et)m(w)m(een)h(successiv)m(e)g(pixels,)f(after)h(sev)m(eral)g (N-sigma)227 5465 y(rejection)e(cycles)g(to)g(remo)m(v)m(e)g(extreme)g (v)-5 b(alues.)39 b(The)25 b(input)e(parameters)j(are:)38 b(the)25 b(arra)m(y)g(of)g(image)i(pixel)227 5578 y(v)-5 b(alues)30 b(\(either)h(\015oat)f(or)g(short)f(v)-5 b(alues\),)31 b(the)f(n)m(um)m(b)s(er)e(of)i(v)-5 b(alues)30 b(in)g(the)g(arra)m(y)-8 b(,)31 b(the)f(v)-5 b(alue)30 b(that)g(is)g(used)227 5691 y(to)h(represen)m(t)g(n)m(ull)f(pixels)h(\(en)m(ter)g(a)g(v)m(ery) g(large)g(n)m(um)m(b)s(er)e(if)h(there)h(are)g(no)f(n)m(ull)g (pixels\).)p eop end %%Page: 76 84 TeXDict begin 76 83 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.76) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(76)1379 b Fh(CHAPTER)30 b(5.)71 b(BASIC)30 b(CFITSIO)f(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)191 555 y Fe(int)47 b(fits_rms_float)d (\(float)i(fdata[],)f(int)i(npix,)g(float)f(in_null_value,)907 668 y(>)h(double)f(*rms,)h(int)g(*status\))191 781 y(int)g (fits_rms_short)d(\(short)i(fdata[],)f(int)i(npix,)g(short)f (in_null_value,)907 894 y(>)h(double)f(*rms,)h(int)g(*status\))0 1154 y Fi(26)f Fj(W)-8 b(as)33 b(CFITSIO)d(compiled)h(with)h(the)f(-D)p 1612 1154 28 4 v 34 w(REENTRANT)g(directiv)m(e)i(so)e(that)h(it)g(ma)m (y)h(b)s(e)d(safely)j(used)d(in)227 1267 y(m)m(ulti-threaded)d(en)m (vironmen)m(ts?)40 b(The)26 b(follo)m(wing)i(function)e(returns)f(1)i (if)f(y)m(es,)i(0)f(if)f(no.)40 b(Note,)28 b(ho)m(w)m(ev)m(er,)227 1380 y(that)35 b(ev)m(en)g(if)g(the)f(-D)p 991 1380 V 34 w(REENTRANT)f(directiv)m(e)j(w)m(as)f(sp)s(eci\014ed,)g(this)f(do)s (es)g(not)h(guaran)m(tee)h(that)f(the)227 1492 y(CFITSIO)29 b(routines)h(are)h(thread-safe,)g(b)s(ecause)g(some)f(compilers)h(ma)m (y)g(not)g(supp)s(ort)d(this)j(feature.)0 1752 y Fe(int)47 b(fits_is_reentrant\(void\))p eop end %%Page: 77 85 TeXDict begin 77 84 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.77) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.6) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(6)0 1687 y Fm(The)77 b(CFITSIO)f(Iterator)i(F)-19 b(unction)0 2180 y Fj(The)41 b(\014ts)p 325 2180 28 4 v 33 w(iterate)p 614 2180 V 34 w(data)i(function)e(in)h(CFITSIO)e(pro)m(vides)i(a)g (unique)e(metho)s(d)i(of)g(executing)h(an)e(arbitrary)0 2293 y(user-supplied)35 b(`w)m(ork')i(function)f(that)h(op)s(erates)g (on)g(ro)m(ws)f(of)h(data)g(in)f(FITS)g(tables)h(or)f(on)h(pixels)f(in) h(FITS)0 2406 y(images.)i(Rather)24 b(than)e(explicitly)j(reading)e (and)g(writing)g(the)g(FITS)g(images)h(or)f(columns)g(of)g(data,)i(one) f(instead)0 2518 y(calls)36 b(the)g(CFITSIO)d(iterator)k(routine,)g (passing)e(to)h(it)g(the)f(name)g(of)h(the)f(user's)g(w)m(ork)g (function)g(that)h(is)f(to)0 2631 y(b)s(e)30 b(executed)h(along)g(with) f(a)h(list)g(of)f(all)h(the)f(table)i(columns)e(or)g(image)h(arra)m(ys) g(that)g(are)f(to)h(b)s(e)f(passed)g(to)h(the)0 2744 y(w)m(ork)37 b(function.)61 b(The)37 b(CFITSIO)e(iterator)k(function)e (then)g(do)s(es)g(all)h(the)f(w)m(ork)g(of)h(allo)s(cating)h(memory)e (for)0 2857 y(the)28 b(arra)m(ys,)h(reading)f(the)g(input)e(data)j (from)e(the)h(FITS)f(\014le,)h(passing)g(them)g(to)g(the)g(w)m(ork)g (function,)g(and)f(then)0 2970 y(writing)36 b(an)m(y)h(output)f(data)h (bac)m(k)h(to)f(the)f(FITS)g(\014le)g(after)h(the)g(w)m(ork)g(function) f(exits.)59 b(Because)38 b(it)f(is)g(often)0 3083 y(more)g(e\016cien)m (t)i(to)f(pro)s(cess)f(only)g(a)h(subset)f(of)g(the)g(total)i(table)g (ro)m(ws)e(at)h(one)f(time,)j(the)e(iterator)g(function)0 3196 y(can)31 b(determine)f(the)h(optim)m(um)f(amoun)m(t)h(of)f(data)h (to)g(pass)f(in)g(eac)m(h)i(iteration)f(and)f(rep)s(eatedly)h(call)g (the)g(w)m(ork)0 3309 y(function)f(un)m(til)h(the)f(en)m(tire)i(table)f (b)s(een)e(pro)s(cessed.)0 3469 y(F)-8 b(or)37 b(man)m(y)f (applications)h(this)e(single)i(CFITSIO)d(iterator)k(function)d(can)h (e\013ectiv)m(ely)j(replace)e(all)g(the)f(other)0 3582 y(CFITSIO)g(routines)i(for)f(reading)h(or)f(writing)h(data)g(in)f(FITS) g(images)i(or)e(tables.)64 b(Using)37 b(the)h(iterator)h(has)0 3695 y(sev)m(eral)32 b(imp)s(ortan)m(t)e(adv)-5 b(an)m(tages)32 b(o)m(v)m(er)g(the)f(traditional)g(metho)s(d)f(of)h(reading)f(and)g (writing)g(FITS)g(data)h(\014les:)136 3961 y Fc(\017)46 b Fj(It)33 b(cleanly)h(separates)g(the)f(data)h(I/O)f(from)f(the)h (routine)g(that)h(op)s(erates)f(on)g(the)g(data.)49 b(This)32 b(leads)h(to)227 4074 y(a)e(more)g(mo)s(dular)e(and)h(`ob)5 b(ject)31 b(orien)m(ted')h(programming)e(st)m(yle.)136 4268 y Fc(\017)46 b Fj(It)27 b(simpli\014es)f(the)h(application)h (program)f(b)m(y)f(eliminating)i(the)f(need)g(to)g(allo)s(cate)i (memory)e(for)f(the)h(data)227 4381 y(arra)m(ys)e(and)f(eliminates)i (most)e(of)h(the)f(calls)i(to)f(the)g(CFITSIO)d(routines)j(that)g (explicitly)h(read)e(and)g(write)227 4494 y(the)31 b(data.)136 4689 y Fc(\017)46 b Fj(It)32 b(ensures)e(that)i(the)g(data)g(are)g(pro) s(cessed)f(as)h(e\016cien)m(tly)h(as)e(p)s(ossible.)44 b(This)31 b(is)g(esp)s(ecially)i(imp)s(ortan)m(t)227 4801 y(when)44 b(pro)s(cessing)g(tabular)h(data)h(since)f(the)g (iterator)h(function)e(will)h(calculate)i(the)e(most)g(e\016cien)m(t) 227 4914 y(n)m(um)m(b)s(er)36 b(of)i(ro)m(ws)g(in)f(the)h(table)g(to)g (b)s(e)f(passed)g(at)i(one)e(time)i(to)f(the)g(user's)e(w)m(ork)i (function)f(on)h(eac)m(h)227 5027 y(iteration.)136 5222 y Fc(\017)46 b Fj(Mak)m(es)39 b(it)e(p)s(ossible)g(for)g(larger)h(pro)5 b(jects)37 b(to)h(dev)m(elop)g(a)g(library)e(of)i(w)m(ork)f(functions)f (that)i(all)g(ha)m(v)m(e)h(a)227 5335 y(uniform)29 b(calling)j (sequence)f(and)f(are)h(all)g(indep)s(enden)m(t)e(of)i(the)f(details)i (of)e(the)h(FITS)e(\014le)i(format.)0 5601 y(There)f(are)h(basically)h (2)g(steps)e(in)h(using)f(the)h(CFITSIO)e(iterator)j(function.)42 b(The)30 b(\014rst)g(step)h(is)g(to)g(design)g(the)0 5714 y(w)m(ork)26 b(function)f(itself)h(whic)m(h)f(m)m(ust)h(ha)m(v)m (e)g(a)g(prescrib)s(ed)e(set)i(of)g(input)f(parameters.)39 b(One)25 b(of)h(these)g(parameters)1905 5942 y(77)p eop end %%Page: 78 86 TeXDict begin 78 85 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.78) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(78)1455 b Fh(CHAPTER)30 b(6.)112 b(THE)30 b(CFITSIO)e(ITERA)-8 b(TOR)30 b(FUNCTION)0 555 y Fj(is)f(a)g(structure)g(con)m(taining)i(p)s (oin)m(ters)d(to)i(the)f(arra)m(ys)h(of)f(data;)h(the)f(w)m(ork)h (function)e(can)i(p)s(erform)d(an)m(y)i(desired)0 668 y(op)s(erations)k(on)h(these)f(arra)m(ys)h(and)e(do)s(es)h(not)g(need)g (to)h(w)m(orry)f(ab)s(out)g(ho)m(w)g(the)h(input)e(data)i(w)m(ere)f (read)g(from)0 781 y(the)e(\014le)f(or)g(ho)m(w)h(the)f(output)g(data)h (get)h(written)e(bac)m(k)h(to)h(the)e(\014le.)0 941 y(The)24 b(second)h(step)g(is)f(to)i(design)e(the)h(driv)m(er)g(routine)f(that)i (op)s(ens)e(all)h(the)g(necessary)g(FITS)f(\014les)h(and)f(initializes) 0 1054 y(the)41 b(input)g(parameters)g(to)h(the)g(iterator)g(function.) 73 b(The)41 b(driv)m(er)g(program)g(calls)h(the)g(CFITSIO)e(iterator)0 1167 y(function)30 b(whic)m(h)g(then)g(reads)g(the)h(data)g(and)f (passes)g(it)h(to)g(the)g(user's)e(w)m(ork)i(function.)0 1327 y(The)20 b(follo)m(wing)i(2)f(sections)g(describ)s(e)f(these)h (steps)g(in)f(more)g(detail.)39 b(There)20 b(are)h(also)g(sev)m(eral)h (example)f(programs)0 1440 y(included)30 b(with)g(the)g(CFITSIO)f (distribution)h(whic)m(h)g(illustrate)i(ho)m(w)e(to)h(use)f(the)h (iterator)g(function.)0 1593 y SDict begin H.S end 0 1593 a 0 1593 a SDict begin 13.6 H.A end 0 1593 a 0 1593 a SDict begin [/View [/XYZ H.V]/Dest (section.6.1) cvn /DEST pdfmark end 0 1593 a 196 x Ff(6.1)135 b(The)45 b(Iterator)h(W)-11 b(ork)45 b(F)-11 b(unction)0 2043 y Fj(The)42 b(user-supplied)f (iterator)j(w)m(ork)f(function)f(m)m(ust)g(ha)m(v)m(e)i(the)f(follo)m (wing)h(set)f(of)g(input)e(parameters)i(\(the)0 2156 y(function)30 b(can)h(b)s(e)e(giv)m(en)j(an)m(y)f(desired)e(name\):)95 2429 y Fe(int)47 b(user_fn\()f(long)h(totaln,)e(long)i(offset,)f(long)g (firstn,)g(long)h(nvalues,)716 2542 y(int)g(narrays,)e(iteratorCol)g (*data,)94 b(void)47 b(*userPointer)d(\))136 2815 y Fc(\017)i Fj(totaln)24 b({)f(the)f(total)j(n)m(um)m(b)s(er)c(of)h(table)i(ro)m (ws)e(or)g(image)i(pixels)f(that)g(will)f(b)s(e)g(passed)g(to)h(the)g (w)m(ork)f(function)227 2928 y(during)29 b(1)i(or)g(more)f(iterations.) 136 3129 y Fc(\017)46 b Fj(o\013set)d({)f(the)h(o\013set)f(applied)g (to)h(the)f(\014rst)f(table)i(ro)m(w)f(or)g(image)h(pixel)f(to)h(b)s(e) e(passed)g(to)i(the)f(w)m(ork)227 3241 y(function.)55 b(In)34 b(other)i(w)m(ords,)g(this)f(is)g(the)g(n)m(um)m(b)s(er)f(of)h (ro)m(ws)h(or)f(pixels)g(that)h(are)f(skipp)s(ed)f(o)m(v)m(er)i(b)s (efore)227 3354 y(starting)30 b(the)g(iterations.)42 b(If)28 b(o\013set)j(=)e(0,)h(then)f(all)h(the)f(table)i(ro)m(ws)e(or)g (image)i(pixels)e(will)h(b)s(e)e(passed)h(to)227 3467 y(the)i(w)m(ork)f(function.)136 3668 y Fc(\017)46 b Fj(\014rstn)26 b({)i(the)f(n)m(um)m(b)s(er)f(of)i(the)f(\014rst)g(table)h(ro)m(w)f(or) g(image)i(pixel)e(\(starting)i(with)e(1\))h(that)f(is)h(b)s(eing)e (passed)227 3781 y(in)k(this)h(particular)f(call)i(to)f(the)g(w)m(ork)f (function.)136 3982 y Fc(\017)46 b Fj(n)m(v)-5 b(alues)35 b({)g(the)f(n)m(um)m(b)s(er)g(of)g(table)h(ro)m(ws)g(or)f(image)i (pixels)e(that)h(are)g(b)s(eing)f(passed)g(in)g(this)h(particular)227 4095 y(call)h(to)g(the)f(w)m(ork)f(function.)54 b(n)m(v)-5 b(alues)35 b(will)g(alw)m(a)m(ys)h(b)s(e)e(less)h(than)f(or)h(equal)g (to)h(totaln)g(and)e(will)h(ha)m(v)m(e)227 4208 y(the)f(same)f(v)-5 b(alue)34 b(on)f(eac)m(h)h(iteration,)i(except)e(p)s(ossibly)f(on)g (the)g(last)h(call)h(whic)m(h)e(ma)m(y)g(ha)m(v)m(e)i(a)e(smaller)227 4321 y(v)-5 b(alue.)136 4522 y Fc(\017)46 b Fj(narra)m(ys)31 b({)g(the)g(n)m(um)m(b)s(er)f(of)h(arra)m(ys)g(of)g(data)h(that)f(are)g (b)s(eing)g(passed)f(to)i(the)f(w)m(ork)g(function.)42 b(There)30 b(is)227 4635 y(one)h(arra)m(y)g(for)f(eac)m(h)i(image)f(or) f(table)i(column.)136 4835 y Fc(\017)46 b Fj(*data)31 b({)e(arra)m(y)h(of)f(structures,)g(one)h(for)f(eac)m(h)h(column)f(or)g (image.)42 b(Eac)m(h)29 b(structure)g(con)m(tains)h(a)g(p)s(oin)m(ter) 227 4948 y(to)h(the)g(arra)m(y)g(of)f(data)h(as)g(w)m(ell)g(as)g(other) g(descriptiv)m(e)g(parameters)g(ab)s(out)f(that)h(arra)m(y)-8 b(.)136 5149 y Fc(\017)46 b Fj(*userP)m(oin)m(ter)26 b({)g(a)f(user)f(supplied)g(p)s(oin)m(ter)h(that)h(can)f(b)s(e)f(used)h (to)g(pass)g(ancillary)h(information)f(from)g(the)227 5262 y(driv)m(er)h(function)g(to)g(the)g(w)m(ork)g(function.)39 b(This)25 b(p)s(oin)m(ter)h(is)g(passed)g(to)g(the)h(CFITSIO)d (iterator)j(function)227 5375 y(whic)m(h)37 b(then)f(passes)g(it)h(on)g (to)g(the)f(w)m(ork)h(function)f(without)h(an)m(y)g(mo)s(di\014cation.) 59 b(It)37 b(ma)m(y)g(p)s(oin)m(t)f(to)i(a)227 5488 y(single)29 b(n)m(um)m(b)s(er,)f(to)h(an)f(arra)m(y)h(of)g(v)-5 b(alues,)29 b(to)g(a)g(structure)f(con)m(taining)i(an)e(arbitrary)g(set)h(of)g (parameters)227 5601 y(of)e(di\013eren)m(t)h(t)m(yp)s(es,)g(or)f(it)h (ma)m(y)f(b)s(e)g(a)g(n)m(ull)g(p)s(oin)m(ter)g(if)g(it)h(is)f(not)g (needed.)40 b(The)26 b(w)m(ork)h(function)g(m)m(ust)g(cast)227 5714 y(this)k(p)s(oin)m(ter)f(to)h(the)g(appropriate)f(data)h(t)m(yp)s (e)g(b)s(efore)f(using)f(it)i(it.)p eop end %%Page: 79 87 TeXDict begin 79 86 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.79) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(6.1.)72 b(THE)30 b(ITERA)-8 b(TOR)30 b(W)m(ORK)g(FUNCTION)2021 b Fj(79)0 555 y(The)23 b(totaln,)k(o\013set,)g(narra)m(ys,)e(data,)h (and)d(userP)m(oin)m(ter)i(parameters)f(are)g(guaran)m(teed)h(to)g(ha)m (v)m(e)g(the)f(same)g(v)-5 b(alue)0 668 y(on)35 b(eac)m(h)i(iteration.) 57 b(Only)34 b(\014rstn,)i(n)m(v)-5 b(alues,)37 b(and)d(the)i(arra)m (ys)f(of)h(data)g(p)s(oin)m(ted)f(to)h(b)m(y)f(the)h(data)g(structures) 0 781 y(ma)m(y)31 b(c)m(hange)g(on)g(eac)m(h)g(iterativ)m(e)i(call)f (to)f(the)f(w)m(ork)h(function.)0 941 y(Note)43 b(that)g(the)f (iterator)h(treats)g(an)f(image)h(as)f(a)g(long)h(1-D)g(arra)m(y)f(of)h (pixels)f(regardless)g(of)g(it's)h(in)m(trinsic)0 1054 y(dimensionalit)m(y)-8 b(.)52 b(The)33 b(total)j(n)m(um)m(b)s(er)c(of)i (pixels)g(is)g(just)f(the)h(pro)s(duct)e(of)i(the)g(size)h(of)e(eac)m (h)i(dimension,)g(and)0 1167 y(the)e(order)g(of)g(the)g(pixels)g(is)g (the)g(same)g(as)g(the)h(order)e(that)h(they)h(are)f(stored)g(in)g(the) g(FITS)f(\014le.)48 b(If)33 b(the)g(w)m(ork)0 1280 y(function)27 b(needs)g(to)h(kno)m(w)f(the)h(n)m(um)m(b)s(er)e(and)h(size)h(of)g(the) f(image)i(dimensions)d(then)h(these)h(parameters)g(can)g(b)s(e)0 1393 y(passed)i(via)h(the)f(userP)m(oin)m(ter)i(structure.)0 1553 y(The)e(iteratorCol)i(structure)e(is)g(curren)m(tly)h(de\014ned)e (as)h(follo)m(ws:)0 1780 y Fe(typedef)46 b(struct)94 b(/*)47 b(structure)e(for)i(the)g(iterator)e(function)h(column)g (information)f(*/)0 1893 y({)143 2005 y(/*)i(structure)f(elements)f (required)h(as)h(input)f(to)h(fits_iterate_data:)c(*/)95 2231 y(fitsfile)j(*fptr;)332 b(/*)48 b(pointer)d(to)j(the)f(HDU)f (containing)f(the)i(column)f(or)i(image)e(*/)95 2344 y(int)286 b(colnum;)e(/*)48 b(column)e(number)g(in)h(the)g(table;)f (ignored)g(for)h(images)189 b(*/)95 2457 y(char)238 b(colname[70];)44 b(/*)k(name)e(\(TTYPEn\))g(of)h(the)g(column;)f(null)g(for)h(images)285 b(*/)95 2570 y(int)h(datatype;)188 b(/*)48 b(output)e(data)g(type)h (\(converted)e(if)i(necessary\))e(*/)95 2683 y(int)286 b(iotype;)e(/*)48 b(type:)e(InputCol,)f(InputOutputCol,)f(or)j (OutputCol)e(*/)95 2909 y(/*)j(output)e(structure)f(elements)h(that)g (may)h(be)g(useful)f(for)h(the)g(work)g(function:)e(*/)95 3135 y(void)238 b(*array;)189 b(/*)47 b(pointer)f(to)h(the)g(array)f (\(and)h(the)g(null)g(value\))f(*/)95 3247 y(long)238 b(repeat;)189 b(/*)47 b(binary)f(table)h(vector)f(repeat)g(value;)g (set)238 b(*/)1050 3360 y(/*)g(equal)46 b(to)i(1)f(for)g(images)810 b(*/)95 3473 y(long)238 b(tlmin;)f(/*)47 b(legal)g(minimum)e(data)i (value,)f(if)h(any)477 b(*/)95 3586 y(long)238 b(tlmax;)f(/*)47 b(legal)g(maximum)e(data)i(value,)f(if)h(any)477 b(*/)95 3699 y(char)238 b(unit[70];)93 b(/*)47 b(physical)f(unit)g(string)g (\(BUNIT)h(or)g(TUNITn\))189 b(*/)95 3812 y(char)238 b(tdisp[70];)45 b(/*)i(suggested)e(display)h(format;)g(null)h(if)g (none)190 b(*/)0 4038 y(})47 b(iteratorCol;)0 4264 y Fj(Instead)34 b(of)g(directly)g(reading)g(or)g(writing)g(the)f(elemen)m (ts)j(in)d(this)h(structure,)g(it)h(is)e(recommended)h(that)g(pro-)0 4377 y(grammers)c(use)g(the)h(access)h(functions)d(that)i(are)g(pro)m (vided)f(for)g(this)h(purp)s(ose.)0 4538 y(The)25 b(\014rst)g(\014v)m (e)h(elemen)m(ts)h(in)f(this)f(structure)h(m)m(ust)f(b)s(e)g(initially) j(de\014ned)c(b)m(y)i(the)g(driv)m(er)f(routine)h(b)s(efore)f(calling)0 4650 y(the)f(iterator)h(routine.)38 b(The)23 b(CFITSIO)f(iterator)j (routine)f(uses)f(this)g(information)h(to)g(determine)g(what)f(column)0 4763 y(or)32 b(arra)m(y)h(to)h(pass)e(to)h(the)g(w)m(ork)f(function,)h (and)f(whether)g(the)g(arra)m(y)h(is)g(to)g(b)s(e)f(input)g(to)h(the)f (w)m(ork)h(function,)0 4876 y(output)g(from)g(the)h(w)m(ork)f (function,)h(or)g(b)s(oth.)49 b(The)33 b(CFITSIO)f(iterator)i(function) f(\014lls)h(in)f(the)g(v)-5 b(alues)34 b(of)g(the)0 4989 y(remaining)c(structure)g(elemen)m(ts)i(b)s(efore)e(passing)g(it)h(to)g (the)g(w)m(ork)f(function.)0 5149 y(The)d(arra)m(y)g(structure)g (elemen)m(t)i(is)e(a)g(p)s(oin)m(ter)g(to)h(the)g(actual)g(data)g(arra) m(y)g(and)e(it)i(m)m(ust)f(b)s(e)f(cast)j(to)e(the)h(correct)0 5262 y(data)k(t)m(yp)s(e)f(b)s(efore)f(it)i(is)f(used.)41 b(The)31 b(`rep)s(eat')g(structure)g(elemen)m(t)h(giv)m(e)g(the)g(n)m (um)m(b)s(er)d(of)i(data)h(v)-5 b(alues)31 b(in)g(eac)m(h)0 5375 y(ro)m(w)f(of)g(the)g(table,)i(so)e(that)h(the)f(total)i(n)m(um)m (b)s(er)c(of)i(data)h(v)-5 b(alues)30 b(in)g(the)g(arra)m(y)h(is)f(giv) m(en)h(b)m(y)f(rep)s(eat)g(*)g(n)m(v)-5 b(alues.)0 5488 y(In)36 b(the)g(case)i(of)e(image)i(arra)m(ys)f(and)e(ASCI)s(I)g (tables,)k(rep)s(eat)e(will)g(alw)m(a)m(ys)g(b)s(e)f(equal)h(to)g(1.)59 b(When)37 b(the)f(data)0 5601 y(t)m(yp)s(e)k(is)f(a)h(c)m(haracter)h (string,)h(the)e(arra)m(y)g(p)s(oin)m(ter)f(is)h(actually)h(a)f(p)s (oin)m(ter)f(to)i(an)e(arra)m(y)h(of)g(string)f(p)s(oin)m(ters)0 5714 y(\(i.e.,)31 b(c)m(har)e(**arra)m(y\).)42 b(The)29 b(other)g(output)g(structure)f(elemen)m(ts)j(are)e(pro)m(vided)g(for)f (con)m(v)m(enience)k(in)c(case)i(that)p eop end %%Page: 80 88 TeXDict begin 80 87 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.80) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(80)1455 b Fh(CHAPTER)30 b(6.)112 b(THE)30 b(CFITSIO)e(ITERA)-8 b(TOR)30 b(FUNCTION)0 555 y Fj(information)36 b(is)g(needed)f(within)g (the)h(w)m(ork)g(function.)56 b(An)m(y)35 b(other)h(information)g(ma)m (y)g(b)s(e)f(passed)h(from)f(the)0 668 y(driv)m(er)30 b(routine)h(to)g(the)f(w)m(ork)h(function)f(via)h(the)f(userP)m(oin)m (ter)h(parameter.)0 828 y(Up)s(on)g(completion,)j(the)e(w)m(ork)h (routine)f(m)m(ust)g(return)f(an)h(in)m(teger)h(status)f(v)-5 b(alue,)34 b(with)d(0)i(indicating)g(success)0 941 y(and)e(an)m(y)g (other)g(v)-5 b(alue)32 b(indicating)g(an)f(error)g(whic)m(h)g(will)g (cause)h(the)f(iterator)i(function)e(to)h(immediately)g(exit)0 1054 y(at)27 b(that)f(p)s(oin)m(t.)39 b(Return)25 b(status)i(v)-5 b(alues)26 b(in)f(the)h(range)h(1)f({)g(1000)i(should)c(b)s(e)i(a)m(v)m (oided)h(since)f(these)h(are)f(reserv)m(ed)0 1167 y(for)d(use)g(b)m(y)h (CFITSIO.)e(A)i(return)e(status)i(v)-5 b(alue)24 b(of)g(-1)g(ma)m(y)g (b)s(e)f(used)f(to)j(force)f(the)f(CFITSIO)f(iterator)j(function)0 1280 y(to)i(stop)g(at)g(that)h(p)s(oin)m(t)e(and)g(return)g(con)m(trol) i(to)f(the)g(driv)m(er)f(routine)h(after)g(writing)f(an)m(y)h(output)f (arra)m(ys)h(to)h(the)0 1393 y(FITS)e(\014le.)40 b(CFITSIO)26 b(do)s(es)g(not)i(considered)f(this)g(to)h(b)s(e)e(an)h(error)g (condition,)i(so)e(an)m(y)g(further)f(pro)s(cessing)h(b)m(y)0 1506 y(the)k(application)g(program)f(will)h(con)m(tin)m(ue)h(normally) -8 b(.)0 1658 y SDict begin H.S end 0 1658 a 0 1658 a SDict begin 13.6 H.A end 0 1658 a 0 1658 a SDict begin [/View [/XYZ H.V]/Dest (section.6.2) cvn /DEST pdfmark end 0 1658 a 179 x Ff(6.2)135 b(The)45 b(Iterator)h(Driv)l(er)g(F)-11 b(unction)0 2087 y Fj(The)33 b(iterator)h(driv)m(er)f(function)g(m)m (ust)h(op)s(en)e(the)i(necessary)f(FITS)g(\014les)g(and)g(p)s(osition)g (them)g(to)h(the)g(correct)0 2200 y(HDU.)23 b(It)f(m)m(ust)g(also)i (initialize)g(the)e(follo)m(wing)i(parameters)e(in)g(the)h(iteratorCol) h(structure)d(\(de\014ned)g(ab)s(o)m(v)m(e\))j(for)0 2313 y(eac)m(h)31 b(column)f(or)g(image)h(b)s(efore)e(calling)j(the)e (CFITSIO)e(iterator)j(function.)40 b(Sev)m(eral)31 b(`constructor')g (routines)0 2426 y(are)g(pro)m(vided)f(in)g(CFITSIO)f(for)h(this)g (purp)s(ose.)136 2670 y Fc(\017)46 b Fj(*fptr)30 b({)h(The)f (\014ts\014le)g(p)s(oin)m(ter)g(to)i(the)e(table)h(or)g(image.)136 2853 y Fc(\017)46 b Fj(coln)m(um)30 b({)f(the)h(n)m(um)m(b)s(er)e(of)h (the)h(column)f(in)g(the)g(table.)42 b(This)28 b(v)-5 b(alue)30 b(is)f(ignored)g(in)g(the)h(case)g(of)g(images.)227 2966 y(If)j(coln)m(um)h(equals)g(0,)g(then)g(the)f(column)g(name)h (will)f(b)s(e)g(used)g(to)h(iden)m(tify)g(the)f(column)h(to)g(b)s(e)e (passed)227 3079 y(to)f(the)g(w)m(ork)f(function.)136 3261 y Fc(\017)46 b Fj(colname)32 b({)e(the)g(name)h(\(TTYPEn)e(k)m (eyw)m(ord\))i(of)f(the)h(column.)40 b(This)29 b(is)i(only)f(required)f (if)h(coln)m(um)h(=)f(0)227 3374 y(and)g(is)g(ignored)h(for)f(images.) 136 3556 y Fc(\017)46 b Fj(datat)m(yp)s(e)29 b({)g(The)e(desired)h (data)g(t)m(yp)s(e)g(of)h(the)f(arra)m(y)g(to)h(b)s(e)e(passed)h(to)h (the)f(w)m(ork)g(function.)40 b(F)-8 b(or)28 b(n)m(umer-)227 3669 y(ical)h(data)f(the)f(data)h(t)m(yp)s(e)g(do)s(es)f(not)g(need)g (to)h(b)s(e)f(the)g(same)h(as)f(the)h(actual)g(data)g(t)m(yp)s(e)g(in)f (the)g(FITS)g(\014le,)227 3782 y(in)h(whic)m(h)h(case)g(CFITSIO)e(will) i(do)g(the)f(con)m(v)m(ersion.)42 b(Allo)m(w)m(ed)30 b(v)-5 b(alues)29 b(are:)40 b(TSTRING,)28 b(TLOGICAL,)227 3895 y(TBYTE,)37 b(TSBYTE,)f(TSHOR)-8 b(T,)36 b(TUSHOR)-8 b(T,)37 b(TINT,)f(TLONG,)h(TULONG,)f(TFLO)m(A)-8 b(T,)38 b(TDOU-)227 4008 y(BLE.)33 b(If)g(the)g(input)f(v)-5 b(alue)33 b(of)g(data)h(t)m(yp)s(e)f(equals)g(0,)i(then)d(the)h (existing)h(data)g(t)m(yp)s(e)f(of)g(the)g(column)g(or)227 4121 y(image)f(will)f(b)s(e)e(used)h(without)g(an)m(y)h(con)m(v)m (ersion.)136 4303 y Fc(\017)46 b Fj(iot)m(yp)s(e)37 b({)f(de\014nes)e (whether)h(the)h(data)g(arra)m(y)g(is)g(to)g(b)s(e)f(input)g(to)h(the)g (w)m(ork)f(function)h(\(i.e,)i(read)d(from)227 4416 y(the)42 b(FITS)e(\014le\),)k(or)d(output)g(from)g(the)g(w)m(ork)g(function)g (\(i.e.,)k(written)c(to)h(the)f(FITS)g(\014le\))g(or)g(b)s(oth.)227 4529 y(Allo)m(w)m(ed)30 b(v)-5 b(alues)29 b(are)f(InputCol,)g (OutputCol,)h(or)f(InputOutputCol.)38 b(V)-8 b(ariable-length)30 b(arra)m(y)f(columns)227 4642 y(are)h(supp)s(orted)e(as)i(InputCol)e (or)i(InputOutputCol)d(t)m(yp)s(es,)j(but)f(ma)m(y)h(not)g(b)s(e)e (used)h(for)g(an)h(OutputCol)227 4755 y(t)m(yp)s(e.)0 4999 y(After)h(the)f(driv)m(er)g(routine)g(has)g(initialized)j(all)e (these)f(parameters,)h(it)g(can)g(then)f(call)h(the)g(CFITSIO)e (iterator)0 5112 y(function:)95 5357 y Fe(int)47 b (fits_iterate_data\(int)42 b(narrays,)k(iteratorCol)f(*data,)h(long)g (offset,)286 5470 y(long)h(nPerLoop,)e(int)i(\(*workFn\)\()e(\),)i (void)g(*userPointer,)d(int)j(*status\);)136 5714 y Fc(\017)f Fj(narra)m(ys)31 b({)f(the)h(n)m(um)m(b)s(er)e(of)h(columns)g(or)h (images)g(that)g(are)g(to)g(b)s(e)f(passed)g(to)h(the)f(w)m(ork)h (function.)p eop end %%Page: 81 89 TeXDict begin 81 88 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.81) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(6.3.)72 b(GUIDELINES)30 b(F)m(OR)h(USING)f(THE)g(ITERA)-8 b(TOR)30 b(FUNCTION)1200 b Fj(81)136 555 y Fc(\017)46 b Fj(*data)32 b({)f(p)s(oin)m(ter)f(to)h(arra)m(y)g(of)f(structures)g(con)m(taining)i (information)f(ab)s(out)f(eac)m(h)h(column)g(or)f(image.)136 736 y Fc(\017)46 b Fj(o\013set)31 b({)f(if)f(p)s(ositiv)m(e,)i(this)f (n)m(um)m(b)s(er)e(of)i(ro)m(ws)f(at)h(the)g(b)s(eginning)f(of)h(the)f (table)i(\(or)f(pixels)f(in)h(the)f(image\))227 849 y(will)i(b)s(e)f (skipp)s(ed)f(and)g(will)i(not)g(b)s(e)e(passed)h(to)h(the)g(w)m(ork)f (function.)136 1030 y Fc(\017)46 b Fj(nP)m(erLo)s(op)38 b(-)h(sp)s(eci\014es)e(the)i(n)m(um)m(b)s(er)e(of)h(table)h(ro)m(ws)g (\(or)f(n)m(um)m(b)s(er)f(of)i(image)g(pixels\))g(that)g(are)g(to)g(b)s (e)227 1143 y(passed)29 b(to)h(the)f(w)m(ork)h(function)e(on)h(eac)m(h) i(iteration.)42 b(If)28 b(nP)m(erLo)s(op)h(=)g(0)g(then)g(CFITSIO)f (will)i(calculate)227 1256 y(the)22 b(optim)m(um)g(n)m(um)m(b)s(er)e (for)h(greatest)j(e\016ciency)-8 b(.)39 b(If)21 b(nP)m(erLo)s(op)g(is)h (negativ)m(e,)k(then)21 b(all)i(the)f(ro)m(ws)f(or)h(pixels)227 1368 y(will)36 b(b)s(e)f(passed)g(at)h(one)g(time,)i(and)c(the)i(w)m (ork)g(function)f(will)h(only)f(b)s(e)g(called)i(once.)56 b(If)35 b(an)m(y)h(v)-5 b(ariable)227 1481 y(length)33 b(arra)m(ys)g(are)g(b)s(eing)f(pro)s(cessed,)h(then)g(the)f(nP)m(erLo)s (op)h(v)-5 b(alue)33 b(is)f(ignored,)i(and)e(the)h(iterator)h(will)227 1594 y(alw)m(a)m(ys)e(pro)s(cess)e(one)h(ro)m(w)f(of)h(the)f(table)i (at)f(a)g(time.)136 1775 y Fc(\017)46 b Fj(*w)m(orkFn)f(-)f(the)h(name) f(\(actually)i(the)f(address\))f(of)g(the)g(w)m(ork)h(function)f(that)h (is)f(to)h(b)s(e)f(called)h(b)m(y)227 1888 y(\014ts)p 354 1888 28 4 v 33 w(iterate)p 643 1888 V 34 w(data.)136 2069 y Fc(\017)h Fj(*userP)m(oin)m(ter)34 b(-)f(this)g(is)g(a)g(user)f (supplied)g(p)s(oin)m(ter)h(that)g(can)g(b)s(e)g(used)f(to)h(pass)g (ancillary)h(information)227 2182 y(from)f(the)g(driv)m(er)g(routine)g (to)h(the)f(w)m(ork)g(function.)48 b(It)33 b(ma)m(y)h(p)s(oin)m(t)f(to) h(a)f(single)h(n)m(um)m(b)s(er,)e(an)h(arra)m(y)-8 b(,)35 b(or)227 2295 y(to)c(a)g(structure)f(con)m(taining)i(an)e(arbitrary)g (set)h(of)g(parameters.)136 2476 y Fc(\017)46 b Fj(*status)30 b(-)f(The)f(CFITSIO)f(error)h(status.)41 b(Should)27 b(=)h(0)h(on)g(input;)f(a)h(non-zero)h(output)e(v)-5 b(alue)29 b(indicates)227 2588 y(an)i(error.)0 2828 y(When)f(\014ts)p 392 2828 V 32 w(iterate)p 680 2828 V 35 w(data)h(is)f(called)h(it)f (\014rst)g(allo)s(cates)i(memory)e(to)h(hold)e(all)i(the)f(requested)g (columns)g(of)g(data)0 2941 y(or)f(image)i(pixel)e(arra)m(ys.)41 b(It)29 b(then)g(reads)g(the)h(input)e(data)i(from)f(the)g(FITS)f (tables)i(or)g(images)g(in)m(to)g(the)g(arra)m(ys)0 3054 y(then)h(passes)h(the)g(structure)f(with)g(p)s(oin)m(ters)h(to)g(these) g(data)h(arra)m(ys)f(to)g(the)g(w)m(ork)g(function.)44 b(After)32 b(the)g(w)m(ork)0 3167 y(function)37 b(returns,)g(the)h (iterator)g(function)f(writes)g(an)m(y)g(output)g(columns)f(of)h(data)h (or)f(images)h(bac)m(k)g(to)g(the)0 3279 y(FITS)31 b(\014les.)46 b(It)32 b(then)g(rep)s(eats)g(this)g(pro)s(cess)g(for)f(an)m(y)i (remaining)f(sets)g(of)h(ro)m(ws)f(or)g(image)h(pixels)f(un)m(til)h(it) f(has)0 3392 y(pro)s(cessed)27 b(the)i(en)m(tire)g(table)f(or)g(image)i (or)e(un)m(til)g(the)g(w)m(ork)g(function)g(returns)f(a)h(non-zero)h (status)f(v)-5 b(alue.)40 b(The)0 3505 y(iterator)33 b(then)f(frees)g(the)h(memory)e(that)i(it)g(initially)g(allo)s(cated)h (and)e(returns)f(con)m(trol)i(to)g(the)f(driv)m(er)g(routine)0 3618 y(that)f(called)h(it.)0 3752 y SDict begin H.S end 0 3752 a 0 3752 a SDict begin 13.6 H.A end 0 3752 a 0 3752 a SDict begin [/View [/XYZ H.V]/Dest (section.6.3) cvn /DEST pdfmark end 0 3752 a 197 x Ff(6.3)135 b(Guidelines)46 b(for)f(Using)h(the)f(Iterator)h(F)-11 b(unction)0 4199 y Fj(The)34 b(totaln,)i(o\013set,)h(\014rstn,)d(and)f(n)m(v)-5 b(alues)35 b(parameters)f(that)h(are)f(passed)g(to)h(the)f(w)m(ork)g (function)g(are)h(useful)0 4312 y(for)f(determining)g(ho)m(w)g(m)m(uc)m (h)g(of)h(the)f(data)h(has)f(b)s(een)f(pro)s(cessed)h(and)f(ho)m(w)h(m) m(uc)m(h)g(remains)g(left)h(to)g(do.)52 b(On)0 4425 y(the)36 b(v)m(ery)h(\014rst)f(call)h(to)g(the)f(w)m(ork)h(function)f(\014rstn)f (will)h(b)s(e)g(equal)h(to)g(o\013set)g(+)f(1;)k(the)c(w)m(ork)g (function)g(ma)m(y)0 4538 y(need)31 b(to)g(p)s(erform)f(v)-5 b(arious)31 b(initialization)i(tasks)f(b)s(efore)e(starting)i(to)f(pro) s(cess)g(the)g(data.)43 b(Similarly)-8 b(,)32 b(\014rstn)d(+)0 4650 y(n)m(v)-5 b(alues)29 b(-)f(1)h(will)f(b)s(e)g(equal)g(to)h (totaln)h(on)e(the)g(last)h(iteration,)i(at)e(whic)m(h)f(p)s(oin)m(t)g (the)g(w)m(ork)h(function)e(ma)m(y)i(need)0 4763 y(to)k(p)s(erform)f (some)h(clean)h(up)d(op)s(erations)i(b)s(efore)g(exiting)h(for)e(the)h (last)h(time.)48 b(The)33 b(w)m(ork)f(function)h(can)g(also)0 4876 y(force)e(an)f(early)h(termination)g(of)g(the)g(iterations)g(b)m (y)g(returning)e(a)i(status)g(v)-5 b(alue)30 b(=)g(-1.)0 5036 y(The)f(narra)m(ys)g(and)g(iteratorCol.datat)m(yp)s(e)j(argumen)m (ts)e(allo)m(w)g(the)g(w)m(ork)f(function)g(to)h(double)f(c)m(hec)m(k)i (that)f(the)0 5149 y(n)m(um)m(b)s(er)k(of)i(input)f(arra)m(ys)h(and)f (their)g(data)i(t)m(yp)s(es)e(ha)m(v)m(e)i(the)f(exp)s(ected)g(v)-5 b(alues.)57 b(The)35 b(iteratorCol.fptr)i(and)0 5262 y(iteratorCol.coln)m(um)d(structure)d(elemen)m(ts)h(can)g(b)s(e)f(used) f(if)i(the)f(w)m(ork)h(function)f(needs)g(to)h(read)f(or)g(write)h(the) 0 5375 y(v)-5 b(alues)31 b(of)g(other)g(k)m(eyw)m(ords)g(in)g(the)g (FITS)f(\014le)h(asso)s(ciated)h(with)f(the)g(arra)m(y)-8 b(.)43 b(This)30 b(should)g(generally)i(only)f(b)s(e)0 5488 y(done)j(during)e(the)i(initialization)j(step)c(or)h(during)f(the) h(clean)g(up)f(step)h(after)g(the)g(last)h(set)f(of)g(data)g(has)g(b)s (een)0 5601 y(pro)s(cessed.)40 b(Extra)29 b(FITS)f(\014le)h(I/O)g (during)e(the)i(main)g(pro)s(cessing)g(lo)s(op)g(of)g(the)g(w)m(ork)g (function)g(can)g(seriously)0 5714 y(degrade)i(the)f(sp)s(eed)g(of)g (the)h(program.)p eop end %%Page: 82 90 TeXDict begin 82 89 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.82) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(82)1455 b Fh(CHAPTER)30 b(6.)112 b(THE)30 b(CFITSIO)e(ITERA)-8 b(TOR)30 b(FUNCTION)0 555 y Fj(If)i(v)-5 b(ariable-length)35 b(arra)m(y)e(columns)g(are)g(b)s(eing)f(pro)s(cessed,)h(then)g(the)g (iterator)h(will)f(op)s(erate)h(on)f(one)g(ro)m(w)g(of)0 668 y(the)j(table)g(at)g(a)g(time.)57 b(In)34 b(this)i(case)g(the)g (the)f(rep)s(eat)h(elemen)m(t)h(in)e(the)h(in)m(teratorCol)h(structure) e(will)h(b)s(e)e(set)0 781 y(equal)d(to)g(the)g(n)m(um)m(b)s(er)e(of)h (elemen)m(ts)i(in)e(the)h(curren)m(t)f(ro)m(w)g(that)h(is)g(b)s(eing)f (pro)s(cessed.)0 941 y(One)j(imp)s(ortan)m(t)g(feature)h(of)f(the)h (iterator)h(is)e(that)h(the)f(\014rst)g(elemen)m(t)i(in)e(eac)m(h)h (arra)m(y)g(that)g(is)f(passed)g(to)h(the)0 1054 y(w)m(ork)f(function)g (giv)m(es)h(the)f(v)-5 b(alue)33 b(that)h(is)f(used)f(to)h(represen)m (t)g(n)m(ull)g(or)g(unde\014ned)d(v)-5 b(alues)34 b(in)e(the)h(arra)m (y)-8 b(.)49 b(The)0 1167 y(real)41 b(data)g(then)g(b)s(egins)f(with)g (the)g(second)h(elemen)m(t)h(of)f(the)f(arra)m(y)h(\(i.e.,)k(arra)m (y[1],)g(not)c(arra)m(y[0]\).)73 b(If)40 b(the)0 1280 y(\014rst)e(arra)m(y)h(elemen)m(t)h(is)f(equal)g(to)g(zero,)j(then)c (this)g(indicates)i(that)f(all)h(the)e(arra)m(y)h(elemen)m(ts)h(ha)m(v) m(e)g(de\014ned)0 1393 y(v)-5 b(alues)33 b(and)f(there)h(are)g(no)g (unde\014ned)d(v)-5 b(alues.)48 b(If)33 b(arra)m(y[0])h(is)f(not)g (equal)g(to)g(zero,)i(then)d(this)h(indicates)g(that)0 1506 y(some)h(of)g(the)g(data)h(v)-5 b(alues)34 b(are)g(unde\014ned)d (and)j(this)f(v)-5 b(alue)35 b(\(arra)m(y[0]\))h(is)d(used)g(to)i (represen)m(t)f(them.)51 b(In)33 b(the)0 1619 y(case)i(of)e(output)g (arra)m(ys)h(\(i.e.,)i(those)e(arra)m(ys)g(that)g(will)g(b)s(e)f (written)g(bac)m(k)h(to)h(the)e(FITS)g(\014le)g(b)m(y)h(the)g(iterator) 0 1732 y(function)h(after)i(the)f(w)m(ork)f(function)h(exits\))h(the)f (w)m(ork)g(function)f(m)m(ust)h(set)g(the)g(\014rst)f(arra)m(y)h (elemen)m(t)h(to)g(the)0 1844 y(desired)g(n)m(ull)g(v)-5 b(alue)37 b(if)g(necessary)-8 b(,)40 b(otherwise)e(the)f(\014rst)g (elemen)m(t)h(should)e(b)s(e)h(set)g(to)h(zero)g(to)g(indicate)g(that)0 1957 y(there)30 b(are)h(no)e(n)m(ull)h(v)-5 b(alues)31 b(in)e(the)h(output)g(arra)m(y)-8 b(.)42 b(CFITSIO)28 b(de\014nes)h(2)h(v)-5 b(alues,)31 b(FLO)m(A)-8 b(TNULL)e(V)g(ALUE)31 b(and)0 2070 y(DOUBLENULL)-10 b(V)g(ALUE,)37 b(that)f(can)h(b)s(e)e (used)g(as)i(default)f(n)m(ull)g(v)-5 b(alues)36 b(for)g(\015oat)h(and) e(double)h(data)h(t)m(yp)s(es,)0 2183 y(resp)s(ectiv)m(ely)-8 b(.)60 b(In)35 b(the)i(case)g(of)f(c)m(haracter)i(string)e(data)h(t)m (yp)s(es,)h(a)e(n)m(ull)h(string)f(is)g(alw)m(a)m(ys)i(used)d(to)i (represen)m(t)0 2296 y(unde\014ned)28 b(strings.)0 2456 y(In)33 b(some)h(applications)g(it)g(ma)m(y)g(b)s(e)f(necessary)h(to)g (recursiv)m(ely)g(call)h(the)f(iterator)h(function.)50 b(An)33 b(example)h(of)0 2569 y(this)27 b(is)g(giv)m(en)h(b)m(y)f(one)h (of)f(the)h(example)f(programs)g(that)h(is)f(distributed)f(with)h (CFITSIO:)f(it)i(\014rst)e(calls)i(a)g(w)m(ork)0 2682 y(function)38 b(that)g(writes)h(out)f(a)g(2D)h(histogram)g(image.)65 b(That)38 b(w)m(ork)g(function)g(in)f(turn)g(calls)j(another)e(w)m(ork) 0 2795 y(function)29 b(that)h(reads)g(the)f(`X')i(and)e(`Y')h(columns)f (in)g(a)h(table)h(to)f(calculate)i(the)d(v)-5 b(alue)31 b(of)e(eac)m(h)i(2D)f(histogram)0 2908 y(image)i(pixel.)41 b(Graphically)-8 b(,)32 b(the)e(program)g(structure)g(can)h(b)s(e)f (describ)s(ed)f(as:)48 3153 y Fe(driver)46 b(-->)h(iterator)e(-->)i (work1_fn)f(-->)h(iterator)e(-->)i(work2_fn)0 3399 y Fj(Finally)-8 b(,)42 b(it)d(should)e(b)s(e)h(noted)g(that)h(the)g (table)g(columns)f(or)g(image)i(arra)m(ys)f(that)g(are)f(passed)g(to)h (the)g(w)m(ork)0 3512 y(function)c(do)h(not)g(all)g(ha)m(v)m(e)h(to)f (come)h(from)e(the)h(same)g(FITS)f(\014le)g(and)g(instead)h(ma)m(y)g (come)h(from)e(an)m(y)h(com-)0 3625 y(bination)d(of)g(sources)g(as)h (long)f(as)h(they)f(ha)m(v)m(e)h(the)f(same)h(length.)49 b(The)32 b(length)i(of)f(the)g(\014rst)f(table)i(column)f(or)0 3738 y(image)f(arra)m(y)f(is)f(used)f(b)m(y)i(the)f(iterator)i(if)e (they)h(do)f(not)h(all)g(ha)m(v)m(e)h(the)e(same)h(length.)0 3890 y SDict begin H.S end 0 3890 a 0 3890 a SDict begin 13.6 H.A end 0 3890 a 0 3890 a SDict begin [/View [/XYZ H.V]/Dest (section.6.4) cvn /DEST pdfmark end 0 3890 a 179 x Ff(6.4)135 b(Complete)47 b(List)e(of)g(Iterator)i(Routines)0 4319 y Fj(All)36 b(of)f(the)g(iterator)h(routines)f(are)g(listed)h(b)s (elo)m(w.)54 b(Most)36 b(of)f(these)h(routines)e(do)h(not)g(ha)m(v)m(e) i(a)e(corresp)s(onding)0 4432 y(short)30 b(function)g(name.)0 4678 y Fi(1)81 b Fj(Iterator)32 b(`constructor')h(functions)e(that)i (set)f(the)g(v)-5 b(alue)32 b(of)g(elemen)m(ts)h(in)f(the)g (iteratorCol)h(structure)e(that)227 4791 y(de\014ne)k(the)h(columns)f (or)h(arra)m(ys.)56 b(These)36 b(set)g(the)g(\014ts\014le)f(p)s(oin)m (ter,)i(column)e(name,)j(column)d(n)m(um)m(b)s(er,)227 4904 y(datat)m(yp)s(e,)28 b(and)e(iot)m(yp)s(e,)i(resp)s(ectiv)m(ely)-8 b(.)41 b(The)25 b(last)i(2)g(routines)f(allo)m(w)h(all)g(the)f (parameters)h(to)f(b)s(e)g(set)g(with)227 5017 y(one)31 b(function)f(call)i(\(one)f(supplies)e(the)i(column)f(name,)h(the)f (other)h(the)f(column)g(n)m(um)m(b)s(er\).)95 5262 y Fe(int)47 b(fits_iter_set_file\(iterato)o(rCo)o(l)42 b(*col,)k(fitsfile)g(*fptr\);)95 5488 y(int)h (fits_iter_set_colname\(iter)o(ato)o(rCol)41 b(*col,)46 b(char)h(*colname\);)95 5714 y(int)g(fits_iter_set_colnum\(itera)o(tor) o(Col)41 b(*col,)47 b(int)g(colnum\);)p eop end %%Page: 83 91 TeXDict begin 83 90 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.83) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(6.4.)72 b(COMPLETE)29 b(LIST)g(OF)i(ITERA)-8 b(TOR)29 b(R)m(OUTINES)1638 b Fj(83)95 668 y Fe(int)47 b(fits_iter_set_datatype\(ite)o(rat)o(orCo)o (l)42 b(*col,)k(int)h(datatype\);)95 894 y(int)g (fits_iter_set_iotype\(itera)o(tor)o(Col)41 b(*col,)47 b(int)g(iotype\);)95 1120 y(int)g(fits_iter_set_by_name\(iter)o(ato)o (rCol)41 b(*col,)46 b(fitsfile)g(*fptr,)477 1233 y(char)h(*colname,)e (int)i(datatype,)93 b(int)47 b(iotype\);)95 1458 y(int)g (fits_iter_set_by_num\(itera)o(tor)o(Col)41 b(*col,)47 b(fitsfile)e(*fptr,)477 1571 y(int)i(colnum,)f(int)h(datatype,)93 b(int)47 b(iotype\);)0 1820 y Fi(2)81 b Fj(Iterator)38 b(`accessor')h(functions)e(that)g(return)g(the)g(v)-5 b(alue)38 b(of)f(the)g(elemen)m(t)i(in)e(the)g(iteratorCol)i(structure) 227 1933 y(that)31 b(describ)s(es)f(a)h(particular)f(data)h(column)g (or)f(arra)m(y)95 2181 y Fe(fitsfile)46 b(*)h (fits_iter_get_file\(iterato)o(rCol)41 b(*col\);)95 2407 y(char)47 b(*)h(fits_iter_get_colname\(i)o(ter)o(ator)o(Col)41 b(*col\);)95 2633 y(int)47 b(fits_iter_get_colnum\(itera)o(tor)o(Col)41 b(*col\);)95 2858 y(int)47 b(fits_iter_get_datatype\(ite)o(rat)o(orCo)o (l)42 b(*col\);)95 3084 y(int)47 b(fits_iter_get_iotype\(itera)o(tor)o (Col)41 b(*col\);)95 3310 y(void)47 b(*)h(fits_iter_get_array\(ite)o (rat)o(orCo)o(l)42 b(*col\);)95 3536 y(long)47 b (fits_iter_get_tlmin\(itera)o(tor)o(Col)41 b(*col\);)95 3762 y(long)47 b(fits_iter_get_tlmax\(itera)o(tor)o(Col)41 b(*col\);)95 3987 y(long)47 b(fits_iter_get_repeat\(iter)o(ato)o(rCol) 41 b(*col\);)95 4213 y(char)47 b(*)h(fits_iter_get_tunit\(ite)o(rat)o (orCo)o(l)42 b(*col\);)95 4439 y(char)47 b(*)h (fits_iter_get_tdisp\(ite)o(rat)o(orCo)o(l)42 b(*col\);)0 4687 y Fi(3)81 b Fj(The)29 b(CFITSIO)g(iterator)j(function)95 4936 y Fe(int)47 b(fits_iterate_data\(int)42 b(narrays,)94 b(iteratorCol)44 b(*data,)i(long)h(offset,)573 5049 y(long)f(nPerLoop,) 573 5161 y(int)h(\(*workFn\)\()e(long)h(totaln,)g(long)h(offset,)f (long)g(firstn,)1289 5274 y(long)g(nvalues,)g(int)h(narrays,)e (iteratorCol)g(*data,)1289 5387 y(void)h(*userPointer\),)573 5500 y(void)g(*userPointer,)573 5613 y(int)h(*status\);)p eop end %%Page: 84 92 TeXDict begin 84 91 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.84) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(84)1455 b Fh(CHAPTER)30 b(6.)112 b(THE)30 b(CFITSIO)e(ITERA)-8 b(TOR)30 b(FUNCTION)p eop end %%Page: 85 93 TeXDict begin 85 92 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.85) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.7) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(7)0 1687 y Fm(W)-19 b(orld)77 b(Co)6 b(ordinate)78 b(System)f(Routines)0 2180 y Fj(The)36 b(FITS)g(comm)m(unit)m(y)h(has)f(adopted)h(a)g(set)g (of)g(k)m(eyw)m(ord)g(con)m(v)m(en)m(tions)h(that)f(de\014ne)f(the)h (transformations)0 2293 y(needed)30 b(to)i(con)m(v)m(ert)g(b)s(et)m(w)m (een)f(pixel)g(lo)s(cations)h(in)e(an)h(image)h(and)e(the)g(corresp)s (onding)g(celestial)j(co)s(ordinates)0 2406 y(on)25 b(the)h(sky)-8 b(,)27 b(or)e(more)g(generally)-8 b(,)29 b(that)d(de\014ne)e(w)m(orld)h (co)s(ordinates)i(that)e(are)h(to)g(b)s(e)f(asso)s(ciated)i(with)e(an)m (y)h(pixel)0 2518 y(lo)s(cation)h(in)e(an)h(n-dimensional)f(FITS)g (arra)m(y)-8 b(.)40 b(CFITSIO)24 b(is)h(distributed)g(with)g(a)h(a)g (few)f(self-con)m(tained)i(W)-8 b(orld)0 2631 y(Co)s(ordinate)30 b(System)g(\(W)m(CS\))g(routines,)g(ho)m(w)m(ev)m(er,)i(these)e (routines)g(DO)f(NOT)h(supp)s(ort)e(all)j(the)f(latest)h(W)m(CS)0 2744 y(con)m(v)m(en)m(tions,)38 b(so)c(it)h(is)g(STR)m(ONGL)-8 b(Y)34 b(RECOMMENDED)h(that)g(soft)m(w)m(are)h(dev)m(elop)s(ers)e(use)g (a)h(more)g(robust)0 2857 y(external)c(W)m(CS)g(library)-8 b(.)40 b(Sev)m(eral)32 b(recommended)e(libraries)g(are:)95 3138 y Fe(WCSLIB)47 b(-)95 b(supported)45 b(by)i(Mark)g(Calabretta)95 3251 y(WCSTools)f(-)h(supported)f(by)h(Doug)g(Mink)95 3364 y(AST)g(library)f(-)i(developed)d(by)i(the)g(U.K.)g(Starlink)e (project)0 3644 y Fj(More)30 b(information)f(ab)s(out)g(the)g(W)m(CS)g (k)m(eyw)m(ord)h(con)m(v)m(en)m(tions)h(and)d(links)h(to)h(all)g(of)f (these)g(W)m(CS)g(libraries)h(can)0 3757 y(b)s(e)g(found)f(on)h(the)h (FITS)e(Supp)s(ort)g(O\016ce)h(w)m(eb)g(site)i(at)f(h)m (ttp://\014ts.gsfc.nasa.go)m(v)j(under)29 b(the)h(W)m(CS)h(link.)0 3917 y(The)40 b(functions)h(pro)m(vided)g(in)f(these)i(external)f(W)m (CS)g(libraries)h(will)f(need)g(access)h(to)f(the)h(W)m(CS)f(k)m(eyw)m (ords)0 4030 y(con)m(tained)36 b(in)f(the)h(FITS)e(\014le)i(headers.)55 b(One)35 b(con)m(v)m(enien)m(t)i(w)m(a)m(y)f(to)g(pass)f(this)g (information)h(to)g(the)f(external)0 4143 y(library)c(is)f(to)i(use)f (the)g(\014ts)p 942 4143 28 4 v 32 w(hdr2str)f(routine)h(in)g(CFITSIO)e (\(de\014ned)h(b)s(elo)m(w\))h(to)h(cop)m(y)g(the)f(header)g(k)m(eyw)m (ords)0 4256 y(in)m(to)k(one)e(long)i(string,)f(and)f(then)g(pass)g (this)h(string)f(to)i(an)e(in)m(terface)i(routine)f(in)f(the)h (external)g(library)f(that)0 4369 y(will)d(extract)h(the)f(necessary)f (W)m(CS)h(information)g(\(e.g.,)h(the)f('w)m(cspih')g(routine)f(in)g (the)h(W)m(CSLIB)f(library)h(and)0 4482 y(the)h('astFitsChan')g(and)f ('astPutCards')g(functions)g(in)g(the)h(AST)e(library\).)0 4763 y Fi(1)81 b Fj(Concatenate)38 b(the)f(header)f(k)m(eyw)m(ords)h (in)f(the)g(CHDU)h(in)m(to)h(a)f(single)g(long)g(string)f(of)h(c)m (haracters.)60 b(Eac)m(h)227 4876 y(80-c)m(haracter)28 b(\014xed-length)c(k)m(eyw)m(ord)h(record)g(is)g(app)s(ended)d(to)k (the)f(output)f(c)m(haracter)i(string,)g(in)e(order,)227 4989 y(with)h(no)f(in)m(terv)m(ening)i(separator)f(or)g(terminating)h (c)m(haracters.)40 b(The)24 b(last)i(header)e(record)h(is)f(terminated) 227 5101 y(with)33 b(a)g(NULL)f(c)m(haracter.)49 b(This)32 b(routine)h(allo)s(cates)i(memory)d(for)h(the)g(returned)e(c)m (haracter)j(arra)m(y)-8 b(,)35 b(so)227 5214 y(the)c(calling)h(program) e(m)m(ust)g(free)h(the)f(memory)g(when)g(\014nished.)227 5375 y(There)c(are)h(2)f(related)h(routines:)39 b(\014ts)p 1514 5375 V 32 w(hdr2str)25 b(simply)h(concatenates)j(all)e(the)f (existing)h(k)m(eyw)m(ords)g(in)f(the)227 5488 y(header;)40 b(\014ts)p 682 5488 V 32 w(con)m(v)m(ert)p 1003 5488 V 34 w(hdr2str)35 b(is)i(similar,)h(except)f(that)g(if)f(the)h(CHDU)f (is)h(a)f(tile)i(compressed)e(image)227 5601 y(\(stored)28 b(in)g(a)f(binary)g(table\))i(then)e(it)h(will)g(\014rst)f(con)m(v)m (ert)i(that)f(header)g(bac)m(k)g(to)g(that)g(of)g(a)g(normal)g(FITS)227 5714 y(image)k(b)s(efore)e(concatenating)j(the)d(k)m(eyw)m(ords.)1905 5942 y(85)p eop end %%Page: 86 94 TeXDict begin 86 93 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.86) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(86)1169 b Fh(CHAPTER)29 b(7.)112 b(W)m(ORLD)31 b(COORDINA)-8 b(TE)30 b(SYSTEM)f(R)m(OUTINES)227 555 y Fj(Selected)h(k)m(eyw)m(ords)e (ma)m(y)h(b)s(e)e(excluded)h(from)g(the)g(returned)f(c)m(haracter)j (string.)40 b(If)27 b(the)i(second)f(param-)227 668 y(eter)h(\(no)s (commen)m(ts\))g(is)f(TR)m(UE)g(\(nonzero\))h(then)e(an)m(y)i(COMMENT,) f(HISTOR)-8 b(Y,)27 b(or)h(blank)g(k)m(eyw)m(ords)227 781 y(in)i(the)h(header)f(will)h(not)f(b)s(e)g(copied)h(to)g(the)g (output)f(string.)227 924 y(The)25 b('exclist')j(parameter)e(ma)m(y)g (b)s(e)f(used)g(to)h(supply)e(a)i(list)h(of)e(k)m(eyw)m(ords)h(that)h (are)f(to)g(b)s(e)f(excluded)g(from)227 1037 y(the)k(output)g(c)m (haracter)h(string.)41 b(Wild)29 b(card)g(c)m(haracters)h(\(*,)g(?,)f (and)g(#\))g(ma)m(y)g(b)s(e)f(used)g(in)h(the)g(excluded)227 1150 y(k)m(eyw)m(ord)h(names.)41 b(If)29 b(no)g(additional)i(k)m(eyw)m (ords)f(are)g(to)g(b)s(e)f(excluded,)h(then)f(set)h(nexc)g(=)f(0)h(and) f(sp)s(ecify)227 1263 y(NULL)i(for)f(the)g(the)h(**exclist)i (parameter.)95 1478 y Fe(int)47 b(fits_hdr2str)286 1591 y(\(fitsfile)f(*fptr,)g(int)h(nocomments,)d(char)j(**exclist,)e(int)i (nexc,)286 1704 y(>)h(char)e(**header,)g(int)h(*nkeys,)e(int)i (*status\))95 1930 y(int)g(fits_convert_hdr2str)c(/)k(ffcnvthdr2str)286 2043 y(\(fitsfile)f(*fptr,)g(int)h(nocomments,)d(char)j(**exclist,)e (int)i(nexc,)286 2155 y(>)h(char)e(**header,)g(int)h(*nkeys,)e(int)i (*status\))0 2371 y Fi(2)81 b Fj(The)24 b(follo)m(wing)j(CFITSIO)d (routine)i(is)f(sp)s(eci\014cally)h(designed)f(for)h(use)f(in)g (conjunction)g(with)g(the)h(W)m(CSLIB)227 2484 y(library)-8 b(.)40 b(It)27 b(is)h(not)f(exp)s(ected)h(that)g(applications)g (programmers)f(will)h(call)g(this)f(routine)h(directly)-8 b(,)29 b(but)d(it)227 2597 y(is)33 b(do)s(cumen)m(ted)g(here)g(for)g (completeness.)50 b(This)33 b(routine)g(extracts)h(arra)m(ys)g(from)e (a)i(binary)e(table)i(that)227 2710 y(con)m(tain)i(W)m(CS)e (information)h(using)f(the)g(-T)-8 b(AB)36 b(table)f(lo)s(okup)f(con)m (v)m(en)m(tion.)55 b(See)35 b(the)f(do)s(cumen)m(tation)227 2822 y(pro)m(vided)c(with)g(the)h(W)m(CSLIB)f(library)g(for)g(more)h (information.)95 3038 y Fe(int)47 b(fits_read_wcstab)334 3151 y(\(fitsfile)e(*fptr,)h(int)h(nwtb,)g(wtbarr)f(*wtb,)g(int)h (*status\);)0 3301 y SDict begin H.S end 0 3301 a 0 3301 a SDict begin 13.6 H.A end 0 3301 a 0 3301 a SDict begin [/View [/XYZ H.V]/Dest (section.7.1) cvn /DEST pdfmark end 0 3301 a 176 x Ff(7.1)180 b(Self-con)l(tained)46 b(W)l(CS)f(Routines) 0 3728 y Fj(The)21 b(follo)m(wing)i(routines)e(DO)g(NOT)g(supp)s(ort)f (the)h(more)h(recen)m(t)g(W)m(CS)f(con)m(v)m(en)m(tions)j(that)d(ha)m (v)m(e)i(b)s(een)e(appro)m(v)m(ed)0 3841 y(as)34 b(part)g(of)g(the)g (FITS)f(standard.)50 b(Consequen)m(tly)-8 b(,)35 b(the)f(follo)m(wing)i (routines)d(ARE)h(NO)m(W)h(DEPRECA)-8 b(TED.)0 3953 y(It)30 b(is)g(STR)m(ONGL)-8 b(Y)30 b(RECOMMENDED)h(that)g(soft)m(w)m(are)g (dev)m(elop)s(ers)f(not)h(use)f(these)g(routines,)g(and)g(instead)0 4066 y(use)g(an)g(external)i(W)m(CS)e(library)-8 b(,)31 b(as)f(describ)s(ed)f(in)i(the)f(previous)g(section.)0 4227 y(These)21 b(routines)g(are)g(included)f(mainly)h(for)g(bac)m(kw)m (ard)g(compatibilit)m(y)j(with)c(existing)i(soft)m(w)m(are.)39 b(They)21 b(supp)s(ort)0 4339 y(the)30 b(follo)m(wing)i(standard)d(map) g(pro)5 b(jections:)41 b(-SIN,)30 b(-T)-8 b(AN,)31 b(-AR)m(C,)g(-NCP)-8 b(,)30 b(-GLS,)g(-MER,)h(and)e(-AIT)h(\(these)0 4452 y(are)f(the)g(legal)h(v)-5 b(alues)29 b(for)f(the)h(co)s(ordt)m(yp)s(e) f(parameter\).)41 b(These)28 b(routines)h(are)g(based)f(on)g(similar)h (functions)f(in)0 4565 y(Classic)j(AIPS.)f(All)h(the)g(angular)f(quan)m (tities)i(are)f(giv)m(en)g(in)f(units)g(of)g(degrees.)0 4781 y Fi(1)81 b Fj(Get)41 b(the)f(v)-5 b(alues)41 b(of)g(the)f(basic)h (set)g(of)f(standard)g(FITS)f(celestial)k(co)s(ordinate)e(system)g(k)m (eyw)m(ords)f(from)227 4894 y(the)33 b(header)f(of)h(a)f(FITS)g(image)i (\(i.e.,)g(the)f(primary)f(arra)m(y)g(or)h(an)f(IMA)m(GE)i (extension\).)47 b(These)33 b(v)-5 b(alues)227 5006 y(ma)m(y)35 b(then)f(b)s(e)g(passed)f(to)i(the)g(\014ts)p 1462 5006 28 4 v 32 w(pix)p 1618 5006 V 32 w(to)p 1730 5006 V 34 w(w)m(orld)f(and)g(\014ts)p 2321 5006 V 32 w(w)m(orld)p 2573 5006 V 33 w(to)p 2686 5006 V 33 w(pix)g(routines)g(that)h(p)s (erform)e(the)227 5119 y(co)s(ordinate)f(transformations.)42 b(If)30 b(an)m(y)h(or)f(all)i(of)f(the)g(W)m(CS)f(k)m(eyw)m(ords)h(are) g(not)g(presen)m(t,)g(then)g(default)227 5232 y(v)-5 b(alues)26 b(will)f(b)s(e)f(returned.)38 b(If)24 b(the)i(\014rst)e(co)s (ordinate)i(axis)f(is)g(the)g(declination-lik)m(e)j(co)s(ordinate,)f (then)e(this)227 5345 y(routine)31 b(will)f(sw)m(ap)h(them)f(so)h(that) g(the)f(longitudinal-lik)m(e)j(co)s(ordinate)e(is)f(returned)g(as)g (the)h(\014rst)e(axis.)227 5488 y(The)34 b(\014rst)g(routine)h (\(\013gics\))h(returns)e(the)h(primary)f(W)m(CS,)g(whereas)h(the)g (second)g(routine)f(returns)g(the)227 5601 y(particular)24 b(v)m(ersion)h(of)f(the)g(W)m(CS)f(sp)s(eci\014ed)g(b)m(y)h(the)g('v)m (ersion')h(parameter,)h(whic)m(h)d(m)m(uc)m(h)h(b)s(e)f(a)h(c)m (haracter)227 5714 y(ranging)31 b(from)f('A')h(to)g('Z')f(\(or)h(a)g (blank)f(c)m(haracter,)i(whic)m(h)e(is)g(equiv)-5 b(alen)m(t)32 b(to)f(calling)h(\013gics\).)p eop end %%Page: 87 95 TeXDict begin 87 94 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.87) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(7.1.)113 b(SELF-CONT)-8 b(AINED)30 b(W)m(CS)g(R)m(OUTINES)1984 b Fj(87)227 555 y(If)35 b(the)h(\014le)f(uses)g(the)g(new)m(er)h('CDj)p 1454 555 28 4 v 32 w(i')g(W)m(CS)f(transformation)h(matrix)g(k)m(eyw)m (ords)f(instead)h(of)f(old)h(st)m(yle)227 668 y('CDEL)-8 b(Tn')37 b(and)f('CR)m(OT)-8 b(A2')38 b(k)m(eyw)m(ords,)h(then)e(this)f (routine)h(will)g(calculate)j(and)c(return)g(the)h(v)-5 b(alues)227 781 y(of)33 b(the)g(equiv)-5 b(alen)m(t)35 b(old-st)m(yle)f(k)m(eyw)m(ords.)49 b(Note)34 b(that)g(the)f(con)m(v)m (ersion)h(from)e(the)i(new-st)m(yle)g(k)m(eyw)m(ords)227 894 y(to)e(the)f(old-st)m(yle)h(v)-5 b(alues)31 b(is)g(sometimes)g (only)g(an)g(appro)m(ximation,)h(so)e(if)h(the)g(appro)m(ximation)h(is) e(larger)227 1007 y(than)37 b(an)h(in)m(ternally)g(de\014ned)e (threshold)h(lev)m(el,)k(then)c(CFITSIO)f(will)i(still)g(return)e(the)i (appro)m(ximate)227 1120 y(W)m(CS)32 b(k)m(eyw)m(ord)h(v)-5 b(alues,)33 b(but)e(will)h(also)h(return)e(with)h(status)g(=)f(APPR)m (O)m(X)p 2908 1120 V 34 w(W)m(CS)p 3149 1120 V 33 w(KEY,)g(to)i(w)m (arn)f(the)227 1233 y(calling)k(program)e(that)h(appro)m(ximations)g (ha)m(v)m(e)g(b)s(een)f(made.)52 b(It)35 b(is)f(then)g(up)f(to)i(the)f (calling)i(program)227 1346 y(to)30 b(decide)g(whether)e(the)h(appro)m (ximations)h(are)g(su\016cien)m(tly)f(accurate)i(for)e(the)g (particular)g(application,)227 1458 y(or)46 b(whether)e(more)i(precise) g(W)m(CS)f(transformations)h(m)m(ust)f(b)s(e)g(p)s(erformed)f(using)g (new-st)m(yle)j(W)m(CS)227 1571 y(k)m(eyw)m(ords)31 b(directly)-8 b(.)95 1824 y Fe(int)47 b(fits_read_img_coord)c(/)k(ffgics)286 1937 y(\(fitsfile)f(*fptr,)g(>)h(double)f(*xrefval,)g(double)g (*yrefval,)334 2050 y(double)g(*xrefpix,)f(double)i(*yrefpix,)e(double) h(*xinc,)g(double)g(*yinc,)334 2163 y(double)g(*rot,)h(char)f (*coordtype,)f(int)i(*status\))95 2389 y(int)g (fits_read_img_coord_versio)o(n)42 b(/)47 b(ffgicsa)286 2502 y(\(fitsfile)f(*fptr,)g(char)g(version,)g(>)h(double)f(*xrefval,)g (double)g(*yrefval,)334 2615 y(double)g(*xrefpix,)f(double)i(*yrefpix,) e(double)h(*xinc,)g(double)g(*yinc,)334 2728 y(double)g(*rot,)h(char)f (*coordtype,)f(int)i(*status\))0 2981 y Fi(2)81 b Fj(Get)30 b(the)f(v)-5 b(alues)30 b(of)f(the)h(standard)e(FITS)h(celestial)j(co)s (ordinate)e(system)f(k)m(eyw)m(ords)h(from)f(the)g(header)g(of)h(a)227 3094 y(FITS)23 b(table)i(where)e(the)h(X)g(and)g(Y)g(\(or)g(RA)g(and)f (DEC\))h(co)s(ordinates)h(are)f(stored)g(in)f(2)h(separate)h(columns) 227 3207 y(of)30 b(the)f(table)h(\(as)g(in)f(the)h(Ev)m(en)m(t)g(List)g (table)g(format)f(that)h(is)g(often)f(used)g(b)m(y)g(high)g(energy)g (astroph)m(ysics)227 3320 y(missions\).)71 b(These)40 b(v)-5 b(alues)40 b(ma)m(y)h(then)f(b)s(e)f(passed)h(to)h(the)f(\014ts) p 2511 3320 V 33 w(pix)p 2668 3320 V 32 w(to)p 2780 3320 V 34 w(w)m(orld)g(and)g(\014ts)p 3383 3320 V 32 w(w)m(orld)p 3635 3320 V 33 w(to)p 3748 3320 V 33 w(pix)227 3432 y(routines)31 b(that)f(p)s(erform)f(the)i(co)s(ordinate)g(transformations.)95 3685 y Fe(int)47 b(fits_read_tbl_coord)c(/)k(ffgtcs)286 3798 y(\(fitsfile)f(*fptr,)g(int)h(xcol,)f(int)h(ycol,)f(>)i(double)e (*xrefval,)334 3911 y(double)g(*yrefval,)f(double)i(*xrefpix,)e(double) h(*yrefpix,)f(double)h(*xinc,)334 4024 y(double)g(*yinc,)g(double)g (*rot,)h(char)f(*coordtype,)f(int)i(*status\))0 4277 y Fi(3)81 b Fj(Calculate)42 b(the)g(celestial)h(co)s(ordinate)f (corresp)s(onding)e(to)i(the)f(input)f(X)h(and)g(Y)g(pixel)g(lo)s (cation)i(in)e(the)227 4390 y(image.)95 4643 y Fe(int)47 b(fits_pix_to_world)c(/)48 b(ffwldp)286 4756 y(\(double)e(xpix,)h (double)f(ypix,)g(double)g(xrefval,)g(double)g(yrefval,)334 4869 y(double)g(xrefpix,)g(double)g(yrefpix,)f(double)h(xinc,)h(double) f(yinc,)334 4982 y(double)g(rot,)h(char)f(*coordtype,)f(>)j(double)e (*xpos,)g(double)g(*ypos,)334 5095 y(int)h(*status\))0 5348 y Fi(4)81 b Fj(Calculate)42 b(the)g(X)f(and)f(Y)h(pixel)h(lo)s (cation)g(corresp)s(onding)e(to)i(the)f(input)f(celestial)k(co)s (ordinate)e(in)f(the)227 5461 y(image.)95 5714 y Fe(int)47 b(fits_world_to_pix)c(/)48 b(ffxypx)p eop end %%Page: 88 96 TeXDict begin 88 95 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.88) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(88)1169 b Fh(CHAPTER)29 b(7.)112 b(W)m(ORLD)31 b(COORDINA)-8 b(TE)30 b(SYSTEM)f(R)m(OUTINES)286 555 y Fe(\(double)46 b(xpos,)h(double)f(ypos,)g(double)g(xrefval,)g(double)g(yrefval,)334 668 y(double)g(xrefpix,)g(double)g(yrefpix,)f(double)h(xinc,)h(double)f (yinc,)334 781 y(double)g(rot,)h(char)f(*coordtype,)f(>)j(double)e (*xpix,)g(double)g(*ypix,)334 894 y(int)h(*status\))p eop end %%Page: 89 97 TeXDict begin 89 96 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.89) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.8) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(8)0 1687 y Fm(Hierarc)-6 b(hical)76 b(Grouping)h(Routines)0 2180 y Fj(These)34 b(functions)h(allo)m(w)h(for)e(the)h(creation)h(and) e(manipulation)h(of)g(FITS)f(HDU)h(Groups,)h(as)f(de\014ned)e(in)h("A)0 2293 y(Hierarc)m(hical)f(Grouping)c(Con)m(v)m(en)m(tion)j(for)e(FITS")h (b)m(y)f(Jennings,)g(P)m(ence,)h(F)-8 b(olk)32 b(and)e(Sc)m(hlesinger:) 0 2453 y(h)m(ttps://\014ts.gsfc.nasa.go)m (v/registry/grouping/grouping.p)s(df)0 2613 y(A)38 b(group)g(is)g(a)g (collection)j(of)d(HDUs)h(whose)f(asso)s(ciation)h(is)g(de\014ned)d(b)m (y)i(a)h Fa(gr)-5 b(ouping)40 b(table)p Fj(.)65 b(HDUs)38 b(whic)m(h)0 2726 y(are)46 b(part)f(of)g(a)g(group)g(are)h(referred)e (to)i(as)f Fa(memb)-5 b(er)47 b(HDUs)d Fj(or)h(simply)g(as)g Fa(memb)-5 b(ers)p Fj(.)86 b(Grouping)45 b(table)0 2839 y(mem)m(b)s(er)40 b(HDUs)i(ma)m(y)f(themselv)m(es)h(b)s(e)f(grouping)f (tables,)45 b(th)m(us)40 b(allo)m(wing)j(for)e(the)g(construction)g(of) g(op)s(en-)0 2952 y(ended)30 b(hierarc)m(hies)h(of)f(HDUs.)0 3112 y(Grouping)c(tables)i(con)m(tain)g(one)f(ro)m(w)g(for)f(eac)m(h)i (mem)m(b)s(er)e(HDU.)i(The)e(grouping)g(table)i(columns)e(pro)m(vide)h (iden-)0 3225 y(ti\014cation)i(information)f(that)g(allo)m(ws)h (applications)f(to)g(reference)g(or)g("p)s(oin)m(t)g(to")g(the)g(mem)m (b)s(er)f(HDUs.)40 b(Mem-)0 3338 y(b)s(er)27 b(HDUs)h(are)g(exp)s (ected,)h(but)e(not)h(required,)f(to)i(con)m(tain)g(a)f(set)g(of)g (GRPIDn/GRPLCn)f(k)m(eyw)m(ords)h(in)f(their)0 3451 y(headers)j(for)h (eac)m(h)g(grouping)g(table)g(that)g(they)g(are)g(referenced)g(b)m(y)-8 b(.)41 b(In)30 b(this)h(sense,)g(the)g(GRPIDn/GRPLCn)0 3563 y(k)m(eyw)m(ords)d("link")g(the)g(mem)m(b)s(er)f(HDU)h(bac)m(k)g (to)g(its)g(Grouping)f(table.)41 b(Note)29 b(that)f(a)f(mem)m(b)s(er)g (HDU)h(need)g(not)0 3676 y(reside)i(in)g(the)g(same)g(FITS)f(\014le)i (as)f(its)g(grouping)g(table,)h(and)e(that)i(a)f(giv)m(en)h(HDU)g(ma)m (y)g(b)s(e)e(referenced)h(b)m(y)g(up)0 3789 y(to)h(999)h(grouping)e (tables)h(sim)m(ultaneously)-8 b(.)0 3949 y(Grouping)22 b(tables)i(are)f(implemen)m(ted)g(as)g(FITS)f(binary)g(tables)h(with)g (up)e(to)j(six)e(pre-de\014ned)g(column)g(TTYPEn)0 4062 y(v)-5 b(alues:)36 b('MEMBER)p 752 4062 28 4 v 34 w(XTENSION',)20 b('MEMBER)p 1789 4062 V 33 w(NAME',)h('MEMBER)p 2620 4062 V 34 w(VERSION',)f('MEMBER)p 3590 4062 V 34 w(POSITION',)0 4175 y('MEMBER)p 451 4175 V 34 w(URI)p 653 4175 V 32 w(TYPE')g(and)g('MEMBER)p 1601 4175 V 34 w(LOCA)-8 b(TION'.)20 b(The)f(\014rst)h(three)g(columns)g(allo)m(w)i(mem)m(b)s(er)e(HDUs)0 4288 y(to)28 b(b)s(e)f(iden)m(ti\014ed)g(b)m(y)g(reference)h(to)g (their)f(XTENSION,)g(EXTNAME)g(and)g(EXTVER)g(k)m(eyw)m(ord)g(v)-5 b(alues.)40 b(The)0 4401 y(fourth)29 b(column)h(allo)m(ws)i(mem)m(b)s (er)d(HDUs)i(to)g(b)s(e)f(iden)m(ti\014ed)g(b)m(y)g(HDU)h(p)s(osition)f (within)g(their)g(FITS)g(\014le.)40 b(The)0 4514 y(last)f(t)m(w)m(o)g (columns)e(iden)m(tify)h(the)g(FITS)f(\014le)h(in)f(whic)m(h)h(the)g (mem)m(b)s(er)f(HDU)h(resides,)i(if)d(di\013eren)m(t)i(from)e(the)0 4627 y(grouping)30 b(table)h(FITS)f(\014le.)0 4787 y(Additional)25 b(user)f(de\014ned)f("auxiliary")j(columns)e(ma)m(y)h(also)g(b)s(e)f (included)g(with)g(an)m(y)h(grouping)f(table.)39 b(When)25 b(a)0 4900 y(grouping)i(table)i(is)f(copied)g(or)f(mo)s(di\014ed)g(the) h(presence)g(of)f(auxiliary)i(columns)e(is)h(alw)m(a)m(ys)h(tak)m(en)g (in)m(to)f(accoun)m(t)0 5013 y(b)m(y)j(the)g(grouping)g(supp)s(ort)f (functions;)h(ho)m(w)m(ev)m(er,)i(the)e(grouping)g(supp)s(ort)f (functions)g(cannot)i(directly)g(mak)m(e)0 5126 y(use)e(of)h(this)f (data.)0 5286 y(If)44 b(a)h(grouping)f(table)h(column)f(is)h(de\014ned) e(but)h(the)g(corresp)s(onding)g(mem)m(b)s(er)f(HDU)j(information)e(is) h(un-)0 5399 y(a)m(v)-5 b(ailable)41 b(then)c(a)i(n)m(ull)f(v)-5 b(alue)39 b(of)f(the)g(appropriate)h(data)f(t)m(yp)s(e)h(is)f(inserted) g(in)g(the)g(column)g(\014eld.)64 b(In)m(teger)0 5512 y(columns)26 b(\(MEMBER)p 811 5512 V 34 w(POSITION,)f(MEMBER)p 1771 5512 V 34 w(VERSION\))h(are)h(de\014ned)f(with)g(a)h(TNULLn)f(v)-5 b(alue)27 b(of)g(zero)0 5625 y(\(0\).)41 b(Character)27 b(\014eld)f(columns)h(\(MEMBER)p 1607 5625 V 34 w(XTENSION,)f(MEMBER)p 2600 5625 V 33 w(NAME,)i(MEMBER)p 3388 5625 V 34 w(URI)p 3590 5625 V 32 w(TYPE,)1905 5942 y(89)p eop end %%Page: 90 98 TeXDict begin 90 97 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.90) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(90)1338 b Fh(CHAPTER)29 b(8.)112 b(HIERAR)m(CHICAL)30 b(GR)m(OUPING)h(R)m (OUTINES)0 555 y Fj(MEMBER)p 426 555 28 4 v 33 w(LOCA)-8 b(TION\))30 b(utilize)i(an)e(ASCI)s(I)f(n)m(ull)h(c)m(haracter)i(to)f (denote)g(a)g(n)m(ull)f(\014eld)g(v)-5 b(alue.)0 715 y(The)23 b(grouping)g(supp)s(ort)f(functions)h(b)s(elong)h(to)g(t)m(w)m (o)h(basic)f(categories:)40 b(those)24 b(that)h(w)m(ork)e(with)h (grouping)f(table)0 828 y(HDUs)j(\(\013gt**\))j(and)c(those)h(that)h(w) m(ork)f(with)f(mem)m(b)s(er)h(HDUs)g(\(\013gm**\).)41 b(Tw)m(o)26 b(functions,)h(\014ts)p 3360 828 V 32 w(cop)m(y)p 3573 828 V 34 w(group\(\))0 941 y(and)40 b(\014ts)p 314 941 V 33 w(remo)m(v)m(e)p 626 941 V 34 w(group\(\),)k(ha)m(v)m(e)e(the) f(option)g(to)h(recursiv)m(ely)f(cop)m(y/delete)j(en)m(tire)e(groups.) 71 b(Care)41 b(should)0 1054 y(b)s(e)33 b(tak)m(en)h(when)f(emplo)m (ying)h(these)g(functions)f(in)g(recursiv)m(e)h(mo)s(de)f(as)g(p)s(o)s (orly)g(de\014ned)f(groups)h(could)g(cause)0 1167 y(unpredictable)25 b(results.)39 b(The)25 b(problem)g(of)h(a)g(grouping)f(table)i (directly)f(or)g(indirectly)g(referencing)g(itself)g(\(th)m(us)0 1280 y(creating)41 b(an)f(in\014nite)f(lo)s(op\))i(is)e(protected)i (against;)46 b(in)39 b(fact,)44 b(neither)39 b(function)h(will)g (attempt)h(to)f(cop)m(y)h(or)0 1393 y(delete)32 b(an)e(HDU)h(t)m(wice.) 0 1548 y SDict begin H.S end 0 1548 a 0 1548 a SDict begin 13.6 H.A end 0 1548 a 0 1548 a SDict begin [/View [/XYZ H.V]/Dest (section.8.1) cvn /DEST pdfmark end 0 1548 a 197 x Ff(8.1)135 b(Grouping)45 b(T)-11 b(able)45 b(Routines)0 1997 y Fi(1)81 b Fj(Create)34 b(\(app)s(end\))f(a)h(grouping)f(table)i (at)f(the)g(end)f(of)h(the)g(curren)m(t)f(FITS)g(\014le)h(p)s(oin)m (ted)g(to)g(b)m(y)g(fptr.)49 b(The)227 2110 y(grpname)28 b(parameter)h(pro)m(vides)g(the)g(grouping)f(table)h(name)g(\(GRPNAME)g (k)m(eyw)m(ord)g(v)-5 b(alue\))29 b(and)f(ma)m(y)227 2223 y(b)s(e)42 b(set)h(to)g(NULL)f(if)g(no)g(group)g(name)g(is)h(to)g (b)s(e)e(sp)s(eci\014ed.)76 b(The)42 b(groupt)m(yp)s(e)g(parameter)g (sp)s(eci\014es)227 2336 y(the)c(desired)g(structure)f(of)h(the)g (grouping)f(table)i(and)e(ma)m(y)i(tak)m(e)g(on)f(the)g(v)-5 b(alues:)56 b(GT)p 3355 2336 28 4 v 33 w(ID)p 3490 2336 V 33 w(ALL)p 3705 2336 V 32 w(URI)227 2449 y(\(all)35 b(columns)e(created\),)j(GT)p 1274 2449 V 33 w(ID)p 1409 2449 V 33 w(REF)d(\(ID)h(b)m(y)g(reference)g(columns\),)g(GT)p 2904 2449 V 33 w(ID)p 3039 2449 V 33 w(POS)e(\(ID)i(b)m(y)g(p)s (osition)227 2562 y(columns\),)48 b(GT)p 801 2562 V 32 w(ID)p 935 2562 V 33 w(ALL)c(\(ID)g(b)m(y)f(reference)i(and)e(p)s (osition)g(columns\),)48 b(GT)p 3028 2562 V 32 w(ID)p 3162 2562 V 33 w(REF)p 3383 2562 V 33 w(URI)c(\(ID)g(b)m(y)227 2674 y(reference)35 b(and)e(FITS)g(\014le)i(URI)e(columns\),)j(and)d (GT)p 2129 2674 V 33 w(ID)p 2264 2674 V 33 w(POS)p 2481 2674 V 32 w(URI)h(\(ID)g(b)m(y)g(p)s(osition)g(and)g(FITS)f(\014le)227 2787 y(URI)e(columns\).)95 3063 y Fe(int)47 b(fits_create_group)c(/)48 b(ffgtcr)286 3176 y(\(fitsfile)e(*fptr,)g(char)g(*grpname,)g(int)h (grouptype,)e(>)i(int)g(*status\))0 3451 y Fi(2)81 b Fj(Create)26 b(\(insert\))g(a)f(grouping)g(table)h(just)f(after)h(the)f (CHDU)h(of)g(the)f(curren)m(t)g(FITS)g(\014le)g(p)s(oin)m(ted)g(to)h(b) m(y)g(fptr.)227 3564 y(All)k(HDUs)f(b)s(elo)m(w)g(the)g(the)g (insertion)g(p)s(oin)m(t)f(will)i(b)s(e)e(shifted)g(do)m(wn)m(w)m(ards) g(to)i(mak)m(e)g(ro)s(om)e(for)g(the)h(new)227 3677 y(HDU.)23 b(The)e(grpname)h(parameter)g(pro)m(vides)f(the)h(grouping)g(table)g (name)g(\(GRPNAME)h(k)m(eyw)m(ord)f(v)-5 b(alue\))227 3790 y(and)25 b(ma)m(y)i(b)s(e)e(set)h(to)h(NULL)e(if)h(no)g(group)f (name)h(is)g(to)g(b)s(e)f(sp)s(eci\014ed.)39 b(The)25 b(groupt)m(yp)s(e)h(parameter)g(sp)s(eci-)227 3903 y(\014es)g(the)h (desired)f(structure)g(of)h(the)f(grouping)g(table)i(and)e(ma)m(y)h (tak)m(e)h(on)e(the)h(v)-5 b(alues:)39 b(GT)p 3355 3903 V 33 w(ID)p 3490 3903 V 33 w(ALL)p 3705 3903 V 32 w(URI)227 4016 y(\(all)c(columns)e(created\),)j(GT)p 1274 4016 V 33 w(ID)p 1409 4016 V 33 w(REF)d(\(ID)h(b)m(y)g(reference)g (columns\),)g(GT)p 2904 4016 V 33 w(ID)p 3039 4016 V 33 w(POS)e(\(ID)i(b)m(y)g(p)s(osition)227 4129 y(columns\),)29 b(GT)p 782 4129 V 33 w(ID)p 917 4129 V 33 w(ALL)f(\(ID)g(b)m(y)g (reference)h(and)e(p)s(osition)h(columns\),)h(GT)p 2897 4129 V 33 w(ID)p 3032 4129 V 33 w(REF)p 3253 4129 V 32 w(URI)f(\(ID)h(b)m(y)f(ref-)227 4242 y(erence)g(and)e(FITS)h(\014le)g (URI)g(columns\),)h(and)e(GT)p 1976 4242 V 33 w(ID)p 2111 4242 V 33 w(POS)p 2328 4242 V 32 w(URI)h(\(ID)g(b)m(y)g(p)s (osition)g(and)g(FITS)f(\014le)h(URI)227 4355 y(columns\))k(.)95 4630 y Fe(int)47 b(fits_insert_group)c(/)48 b(ffgtis)286 4743 y(\(fitsfile)e(*fptr,)g(char)g(*grpname,)g(int)h(grouptype,)e(>)i (int)g(*status\))0 5019 y Fi(3)81 b Fj(Change)20 b(the)h(structure)f (of)h(an)g(existing)g(grouping)g(table)g(p)s(oin)m(ted)g(to)g(b)m(y)g (gfptr.)37 b(The)20 b(groupt)m(yp)s(e)g(parameter)227 5132 y(\(see)27 b(\014ts)p 532 5132 V 32 w(create)p 800 5132 V 35 w(group\(\))e(for)h(v)-5 b(alid)26 b(parameter)g(v)-5 b(alues\))26 b(sp)s(eci\014es)g(the)f(new)g(structure)h(of)f(the)h (grouping)227 5245 y(table.)44 b(This)30 b(function)h(only)g(adds)g(or) g(remo)m(v)m(es)h(grouping)f(table)h(columns,)f(it)h(do)s(es)f(not)g (add)g(or)g(delete)227 5357 y(group)26 b(mem)m(b)s(ers)f(\(i.e.,)k (table)e(ro)m(ws\).)40 b(If)26 b(the)g(grouping)g(table)h(already)g (has)f(the)h(desired)e(structure)h(then)227 5470 y(no)35 b(op)s(erations)f(are)h(p)s(erformed)e(and)h(function)g(simply)h (returns)e(with)h(a)h(\(0\))g(success)g(status)g(co)s(de.)53 b(If)227 5583 y(the)32 b(requested)g(structure)g(c)m(hange)h(creates)g (new)f(grouping)g(table)h(columns,)f(then)g(the)g(column)g(v)-5 b(alues)227 5696 y(for)30 b(all)i(existing)f(mem)m(b)s(ers)f(will)g(b)s (e)g(\014lled)g(with)g(the)h(n)m(ull)f(v)-5 b(alues)31 b(appropriate)f(to)h(the)g(column)f(t)m(yp)s(e.)p eop end %%Page: 91 99 TeXDict begin 91 98 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.91) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(8.1.)72 b(GR)m(OUPING)31 b(T)-8 b(ABLE)31 b(R)m(OUTINES)2235 b Fj(91)95 555 y Fe(int)47 b(fits_change_group)c(/)48 b(ffgtch)286 668 y(\(fitsfile)e(*gfptr,)f(int)i(grouptype,)e(>)j(int)f (*status\))0 905 y Fi(4)81 b Fj(Remo)m(v)m(e)41 b(the)e(group)g (de\014ned)f(b)m(y)h(the)h(grouping)f(table)h(p)s(oin)m(ted)f(to)h(b)m (y)g(gfptr,)h(and)e(optionally)i(all)f(the)227 1018 y(group)29 b(mem)m(b)s(er)f(HDUs.)41 b(The)28 b(rmopt)h(parameter)g(sp)s (eci\014es)g(the)g(action)h(to)g(b)s(e)e(tak)m(en)i(for)f(all)h(mem)m (b)s(ers)227 1131 y(of)d(the)g(group)g(de\014ned)e(b)m(y)i(the)g (grouping)g(table.)40 b(V)-8 b(alid)28 b(v)-5 b(alues)27 b(are:)40 b(OPT)p 2848 1131 28 4 v 32 w(RM)p 3030 1131 V 33 w(GPT)26 b(\(delete)j(only)e(the)227 1244 y(grouping)33 b(table\))i(and)e(OPT)p 1259 1244 V 32 w(RM)p 1441 1244 V 33 w(ALL)g(\(recursiv)m(ely)h(delete)h(all)f(HDUs)g(that)g(b)s(elong) f(to)h(the)g(group\).)227 1357 y(An)m(y)d(groups)g(con)m(taining)i(the) e(grouping)g(table)h(gfptr)e(as)i(a)f(mem)m(b)s(er)g(are)g(up)s(dated,) f(and)h(if)g(rmopt)g(==)227 1470 y(OPT)p 431 1470 V 32 w(RM)p 613 1470 V 33 w(GPT)21 b(all)h(mem)m(b)s(ers)f(ha)m(v)m(e)h (their)f(GRPIDn)g(and)g(GRPLCn)f(k)m(eyw)m(ords)h(up)s(dated)f (accordingly)-8 b(.)227 1582 y(If)36 b(rmopt)g(==)g(OPT)p 985 1582 V 32 w(RM)p 1167 1582 V 33 w(ALL,)g(then)g(other)h(groups)e (that)i(con)m(tain)h(the)e(deleted)h(mem)m(b)s(ers)f(of)g(gfptr)227 1695 y(are)31 b(up)s(dated)e(to)i(re\015ect)g(the)g(deletion)g (accordingly)-8 b(.)95 1932 y Fe(int)47 b(fits_remove_group)c(/)48 b(ffgtrm)286 2045 y(\(fitsfile)e(*gfptr,)f(int)i(rmopt,)f(>)i(int)f (*status\))0 2282 y Fi(5)81 b Fj(Cop)m(y)28 b(\(app)s(end\))g(the)h (group)f(de\014ned)g(b)m(y)h(the)f(grouping)h(table)h(p)s(oin)m(ted)e (to)i(b)m(y)e(infptr,)h(and)f(optionally)i(all)227 2395 y(group)g(mem)m(b)s(er)h(HDUs,)g(to)h(the)f(FITS)f(\014le)g(p)s(oin)m (ted)h(to)h(b)m(y)e(outfptr.)41 b(The)31 b(cp)s(opt)f(parameter)h(sp)s (eci\014es)227 2508 y(the)c(action)h(to)f(b)s(e)f(tak)m(en)h(for)g(all) g(mem)m(b)s(ers)f(of)g(the)h(group)f(infptr.)38 b(V)-8 b(alid)28 b(v)-5 b(alues)26 b(are:)40 b(OPT)p 3443 2508 V 32 w(GCP)p 3674 2508 V 32 w(GPT)227 2621 y(\(cop)m(y)d(only)g(the)f (grouping)g(table\))h(and)e(OPT)p 1887 2621 V 32 w(GCP)p 2118 2621 V 33 w(ALL)h(\(recursiv)m(ely)h(cop)m(y)g(ALL)e(the)i(HDUs)f (that)227 2734 y(b)s(elong)24 b(to)g(the)g(group)f(de\014ned)g(b)m(y)g (infptr\).)38 b(If)23 b(the)h(cp)s(opt)g(==)f(OPT)p 2618 2734 V 32 w(GCP)p 2849 2734 V 32 w(GPT)h(then)f(the)h(mem)m(b)s(ers)f (of)227 2847 y(infptr)i(ha)m(v)m(e)h(their)g(GRPIDn)f(and)g(GRPLCn)g(k) m(eyw)m(ords)h(up)s(dated)e(to)i(re\015ect)g(the)g(existence)h(of)f (the)f(new)227 2960 y(grouping)f(table)g(outfptr,)h(since)f(they)g(no)m (w)g(b)s(elong)g(to)g(the)g(new)g(group.)38 b(If)23 b(cp)s(opt)h(==)f (OPT)p 3460 2960 V 32 w(GCP)p 3691 2960 V 32 w(ALL)227 3073 y(then)29 b(the)g(new)g(grouping)g(table)h(outfptr)e(only)h(con)m (tains)i(p)s(oin)m(ters)e(to)h(the)f(copied)g(mem)m(b)s(er)g(HDUs)h (and)227 3185 y(not)38 b(the)g(original)g(mem)m(b)s(er)f(HDUs)h(of)g (infptr.)61 b(Note)39 b(that,)h(when)d(cp)s(opt)g(==)g(OPT)p 3301 3185 V 32 w(GCP)p 3532 3185 V 33 w(ALL,)g(all)227 3298 y(mem)m(b)s(ers)h(of)h(the)f(group)g(de\014ned)f(b)m(y)i(infptr)e (will)i(b)s(e)e(copied)i(to)g(a)g(single)g(FITS)f(\014le)h(p)s(oin)m (ted)f(to)h(b)m(y)227 3411 y(outfptr)30 b(regardless)h(of)f(their)h (\014le)f(distribution)g(in)g(the)h(original)g(group.)95 3648 y Fe(int)47 b(fits_copy_group)d(/)j(ffgtcp)286 3761 y(\(fitsfile)f(*infptr,)f(fitsfile)h(*outfptr,)f(int)i(cpopt,)f(>)h (int)g(*status\))0 3998 y Fi(6)81 b Fj(Merge)40 b(the)f(t)m(w)m(o)h (groups)e(de\014ned)g(b)m(y)h(the)g(grouping)g(table)g(HDUs)h(infptr)e (and)g(outfptr)h(b)m(y)f(com)m(bining)227 4111 y(their)30 b(mem)m(b)s(ers)f(in)m(to)i(a)f(single)g(grouping)f(table.)42 b(All)30 b(mem)m(b)s(er)f(HDUs)h(\(ro)m(ws\))h(are)f(copied)g(from)f (infptr)227 4224 y(to)f(outfptr.)39 b(If)26 b(mgopt)i(==)e(OPT)p 1419 4224 V 32 w(MR)m(G)p 1669 4224 V 34 w(COPY)g(then)g(infptr)g(con)m (tin)m(ues)i(to)g(exist)g(unaltered)e(after)i(the)227 4337 y(merge.)57 b(If)36 b(the)f(mgopt)i(==)e(OPT)p 1474 4337 V 31 w(MR)m(G)p 1723 4337 V 34 w(MO)m(V)i(then)e(infptr)f(is)i (deleted)h(after)f(the)g(merge.)57 b(In)35 b(b)s(oth)227 4450 y(cases,)d(the)e(GRPIDn)h(and)e(GRPLCn)h(k)m(eyw)m(ords)g(of)h (the)g(mem)m(b)s(er)e(HDUs)i(are)g(up)s(dated)e(accordingly)-8 b(.)95 4687 y Fe(int)47 b(fits_merge_groups)c(/)48 b(ffgtmg)286 4799 y(\(fitsfile)e(*infptr,)f(fitsfile)h(*outfptr,)f(int)i(mgopt,)f(>) h(int)g(*status\))0 5036 y Fi(7)81 b Fj("Compact")24 b(the)f(group)g(de\014ned)f(b)m(y)h(grouping)f(table)i(p)s(oin)m(ted)f (to)h(b)m(y)f(gfptr.)38 b(The)22 b(compaction)j(is)e(ac)m(hiev)m(ed)227 5149 y(b)m(y)37 b(merging)h(\(via)g(\014ts)p 1034 5149 V 32 w(merge)p 1303 5149 V 34 w(groups\(\)\))f(all)h(direct)g(mem)m(b)s (er)f(HDUs)g(of)h(gfptr)e(that)i(are)g(themselv)m(es)227 5262 y(grouping)i(tables.)70 b(The)40 b(cmopt)g(parameter)h(de\014nes)e (whether)g(the)i(merged)f(grouping)f(table)i(HDUs)227 5375 y(remain)j(after)h(merging)f(\(cmopt)h(==)f(OPT)p 1852 5375 V 32 w(CMT)p 2099 5375 V 32 w(MBR\))h(or)f(if)g(they)h(are)f (deleted)h(after)g(merging)227 5488 y(\(cmopt)31 b(==)f(OPT)p 916 5488 V 32 w(CMT)p 1163 5488 V 32 w(MBR)p 1409 5488 V 34 w(DEL\).)g(If)g(the)h(grouping)e(table)j(con)m(tains)f(no)f (direct)h(mem)m(b)s(er)e(HDUs)227 5601 y(that)i(are)f(themselv)m(es)h (grouping)e(tables)i(then)e(this)h(function)f(do)s(es)h(nothing.)40 b(Note)31 b(that)g(this)e(function)227 5714 y(is)i(not)f(recursiv)m(e,) h(i.e.,)h(only)f(the)f(direct)h(mem)m(b)s(er)f(HDUs)h(of)f(gfptr)g(are) h(considered)f(for)g(merging.)p eop end %%Page: 92 100 TeXDict begin 92 99 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.92) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(92)1338 b Fh(CHAPTER)29 b(8.)112 b(HIERAR)m(CHICAL)30 b(GR)m(OUPING)h(R)m (OUTINES)95 555 y Fe(int)47 b(fits_compact_group)c(/)48 b(ffgtcm)286 668 y(\(fitsfile)e(*gfptr,)f(int)i(cmopt,)f(>)i(int)f (*status\))0 945 y Fi(8)81 b Fj(V)-8 b(erify)21 b(the)h(in)m(tegrit)m (y)h(of)e(the)g(grouping)g(table)h(p)s(oin)m(ted)f(to)h(b)m(y)f(gfptr)g (to)h(mak)m(e)g(sure)e(that)i(all)g(group)f(mem)m(b)s(ers)227 1058 y(are)31 b(accessible)i(and)d(that)h(all)g(links)g(to)g(other)g (grouping)f(tables)i(are)f(v)-5 b(alid.)42 b(The)30 b(\014rstfailed)g (parameter)227 1171 y(returns)c(the)i(mem)m(b)s(er)e(ID)h(\(ro)m(w)h(n) m(um)m(b)s(er\))e(of)i(the)f(\014rst)f(mem)m(b)s(er)h(HDU)h(to)g(fail)g (v)m(eri\014cation)g(\(if)g(p)s(ositiv)m(e)227 1284 y(v)-5 b(alue\))36 b(or)e(the)h(\014rst)e(group)h(link)g(to)i(fail)f(\(if)f (negativ)m(e)j(v)-5 b(alue\).)54 b(If)34 b(gfptr)g(is)g(successfully)h (v)m(eri\014ed)f(then)227 1397 y(\014rstfailed)d(con)m(tains)g(a)g (return)e(v)-5 b(alue)31 b(of)g(0.)95 1673 y Fe(int)47 b(fits_verify_group)c(/)48 b(ffgtvf)286 1786 y(\(fitsfile)e(*gfptr,)f (>)j(long)f(*firstfailed,)d(int)j(*status\))0 2063 y Fi(9)81 b Fj(Op)s(en)23 b(a)j(grouping)f(table)h(that)g(con)m(tains)g (the)g(mem)m(b)s(er)e(HDU)i(p)s(oin)m(ted)f(to)h(b)m(y)f(mfptr.)38 b(The)25 b(grouping)g(table)227 2176 y(to)39 b(op)s(en)e(is)h (de\014ned)f(b)m(y)h(the)g(grpid)f(parameter,)j(whic)m(h)e(con)m(tains) h(the)f(k)m(eyw)m(ord)h(index)e(v)-5 b(alue)39 b(of)f(the)227 2289 y(GRPIDn/GRPLCn)d(k)m(eyw)m(ord\(s\))g(that)h(link)f(the)g(mem)m (b)s(er)f(HDU)h(mfptr)f(to)i(the)f(grouping)f(table.)55 b(If)227 2402 y(the)30 b(grouping)f(table)h(resides)f(in)h(a)f(\014le)h (other)f(than)h(the)f(mem)m(b)s(er)g(HDUs)h(\014le)f(then)g(an)h (attempt)g(is)g(\014rst)227 2515 y(made)f(to)h(op)s(en)e(the)h(\014le)g (readwrite,)h(and)e(failing)i(that)g(readonly)-8 b(.)40 b(A)29 b(p)s(oin)m(ter)g(to)h(the)f(op)s(ened)f(grouping)227 2628 y(table)k(HDU)f(is)f(returned)f(in)h(gfptr.)227 2786 y(Note)35 b(that)g(it)f(is)g(p)s(ossible,)g(although)h(unlik)m (ely)f(and)f(undesirable,)h(for)g(the)g(GRPIDn/GRPLCn)f(k)m(ey-)227 2899 y(w)m(ords)k(in)g(a)g(mem)m(b)s(er)g(HDU)h(header)f(to)h(b)s(e)e (non-con)m(tin)m(uous,)k(e.g.,)g(GRPID1,)g(GRPID2,)g(GRPID5,)227 3012 y(GRPID6.)i(In)29 b(suc)m(h)g(cases,)i(the)f(grpid)f(index)g(v)-5 b(alue)31 b(sp)s(eci\014ed)e(in)g(the)h(function)f(call)j(shall)e(iden) m(tify)g(the)227 3125 y(\(grpid\)th)36 b(GRPID)f(v)-5 b(alue.)57 b(In)34 b(the)i(ab)s(o)m(v)m(e)h(example,)g(if)f(grpid)e(==) h(3,)j(then)d(the)g(group)g(sp)s(eci\014ed)g(b)m(y)227 3238 y(GRPID5)c(w)m(ould)g(b)s(e)e(op)s(ened.)95 3515 y Fe(int)47 b(fits_open_group)d(/)j(ffgtop)286 3628 y(\(fitsfile)f (*mfptr,)f(int)i(grpid,)f(>)i(fitsfile)d(**gfptr,)h(int)h(*status\))0 3905 y Fi(10)f Fj(Add)38 b(a)h(mem)m(b)s(er)f(HDU)i(to)f(an)g(existing) g(grouping)g(table)h(p)s(oin)m(ted)e(to)i(b)m(y)e(gfptr.)66 b(The)38 b(mem)m(b)s(er)g(HDU)227 4017 y(ma)m(y)30 b(either)g(b)s(e)f (p)s(oin)m(ted)g(to)h(mfptr)f(\(whic)m(h)g(m)m(ust)h(b)s(e)e(p)s (ositioned)i(to)g(the)f(mem)m(b)s(er)g(HDU\))i(or,)f(if)f(mfptr)227 4130 y(==)36 b(NULL,)g(iden)m(ti\014ed)g(b)m(y)g(the)g(hdup)s(os)e (parameter)i(\(the)h(HDU)g(p)s(osition)f(n)m(um)m(b)s(er,)g(Primary)f (arra)m(y)227 4243 y(==)f(1\))i(if)f(b)s(oth)f(the)h(grouping)g(table)g (and)g(the)g(mem)m(b)s(er)f(HDU)h(reside)g(in)g(the)g(same)g(FITS)f (\014le.)54 b(The)227 4356 y(new)27 b(mem)m(b)s(er)f(HDU)h(shall)g(ha)m (v)m(e)h(the)f(appropriate)g(GRPIDn)f(and)g(GRPLCn)g(k)m(eyw)m(ords)h (created)h(in)f(its)227 4469 y(header.)44 b(Note)33 b(that)f(if)g(the)g (mem)m(b)s(er)e(HDU)j(is)e(already)h(a)g(mem)m(b)s(er)f(of)h(the)g (group)f(then)g(it)h(will)g(not)g(b)s(e)227 4582 y(added)e(a)h(second)f (time.)95 4859 y Fe(int)47 b(fits_add_group_member)42 b(/)48 b(ffgtam)286 4972 y(\(fitsfile)e(*gfptr,)f(fitsfile)h(*mfptr,)g (int)h(hdupos,)f(>)h(int)g(*status\))0 5149 y SDict begin H.S end 0 5149 a 0 5149 a SDict begin 13.6 H.A end 0 5149 a 0 5149 a SDict begin [/View [/XYZ H.V]/Dest (section.8.2) cvn /DEST pdfmark end 0 5149 a 176 x Ff(8.2)135 b(Group)45 b(Mem)l(b)t(er)f(Routines)0 5578 y Fi(1)81 b Fj(Return)28 b(the)i(n)m(um)m(b)s(er)e(of)h(mem)m(b)s(er)g(HDUs)h(in) f(a)h(grouping)f(table)h(gfptr.)40 b(The)29 b(n)m(um)m(b)s(er)f(of)i (mem)m(b)s(er)e(HDUs)227 5691 y(is)j(just)e(the)i(NAXIS2)g(v)-5 b(alue)31 b(\(n)m(um)m(b)s(er)e(of)h(ro)m(ws\))h(of)g(the)f(grouping)g (table.)p eop end %%Page: 93 101 TeXDict begin 93 100 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.93) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(8.2.)72 b(GR)m(OUP)31 b(MEMBER)g(R)m(OUTINES)2295 b Fj(93)95 555 y Fe(int)47 b(fits_get_num_members)c(/)k(ffgtnm)286 668 y(\(fitsfile)f(*gfptr,)f(>)j(long)f(*nmembers,)e(int)h(*status\))0 945 y Fi(2)81 b Fj(Return)34 b(the)h(n)m(um)m(b)s(er)f(of)i(groups)e (to)i(whic)m(h)f(the)g(HDU)h(p)s(oin)m(ted)f(to)h(b)m(y)f(mfptr)f(is)i (link)m(ed,)h(as)e(de\014ned)f(b)m(y)227 1058 y(the)27 b(n)m(um)m(b)s(er)f(of)h(GRPIDn/GRPLCn)f(k)m(eyw)m(ord)i(records)e (that)i(app)s(ear)e(in)g(its)i(header.)39 b(Note)28 b(that)g(eac)m(h) 227 1171 y(time)37 b(this)g(function)f(is)g(called,)k(the)c(indices)h (of)g(the)f(GRPIDn/GRPLCn)g(k)m(eyw)m(ords)h(are)g(c)m(hec)m(k)m(ed)h (to)227 1284 y(mak)m(e)29 b(sure)e(they)g(are)h(con)m(tin)m(uous)g (\(ie)h(no)e(gaps\))h(and)f(are)h(re-en)m(umerated)g(to)h(eliminate)g (gaps)f(if)f(found.)95 1674 y Fe(int)47 b(fits_get_num_groups)c(/)k (ffgmng)286 1787 y(\(fitsfile)f(*mfptr,)f(>)j(long)f(*nmembers,)e(int)h (*status\))0 2063 y Fi(3)81 b Fj(Op)s(en)26 b(a)i(mem)m(b)s(er)f(of)h (the)f(grouping)h(table)g(p)s(oin)m(ted)g(to)g(b)m(y)g(gfptr.)39 b(The)27 b(mem)m(b)s(er)g(to)i(op)s(en)e(is)g(iden)m(ti\014ed)h(b)m(y) 227 2176 y(its)i(ro)m(w)g(n)m(um)m(b)s(er)e(within)h(the)g(grouping)h (table)g(as)g(giv)m(en)g(b)m(y)g(the)f(parameter)h('mem)m(b)s(er')f (\(\014rst)h(mem)m(b)s(er)227 2289 y(==)g(1\))g(.)41 b(A)30 b(\014ts\014le)f(p)s(oin)m(ter)h(to)h(the)f(op)s(ened)f(mem)m(b) s(er)g(HDU)i(is)f(returned)f(as)h(mfptr.)39 b(Note)31 b(that)g(if)f(the)227 2402 y(mem)m(b)s(er)e(HDU)h(resides)g(in)f(a)h (FITS)f(\014le)g(di\013eren)m(t)h(from)f(the)h(grouping)f(table)h(HDU)h (then)e(the)h(mem)m(b)s(er)227 2515 y(\014le)i(is)f(\014rst)g(op)s (ened)f(readwrite)i(and,)f(failing)h(this,)g(op)s(ened)e(readonly)-8 b(.)95 2792 y Fe(int)47 b(fits_open_member)d(/)j(ffgmop)286 2905 y(\(fitsfile)f(*gfptr,)f(long)i(member,)f(>)h(fitsfile)f(**mfptr,) f(int)i(*status\))0 3182 y Fi(4)81 b Fj(Cop)m(y)27 b(\(app)s(end\))f(a) i(mem)m(b)s(er)f(HDU)h(of)f(the)h(grouping)e(table)j(p)s(oin)m(ted)e (to)h(b)m(y)f(gfptr.)39 b(The)27 b(mem)m(b)s(er)g(HDU)h(is)227 3295 y(iden)m(ti\014ed)33 b(b)m(y)g(its)h(ro)m(w)f(n)m(um)m(b)s(er)e (within)i(the)g(grouping)g(table)g(as)h(giv)m(en)g(b)m(y)e(the)i (parameter)f('mem)m(b)s(er')227 3408 y(\(\014rst)j(mem)m(b)s(er)f(==)g (1\).)58 b(The)35 b(cop)m(y)i(of)f(the)g(group)f(mem)m(b)s(er)g(HDU)i (will)f(b)s(e)f(app)s(ended)f(to)j(the)f(FITS)227 3521 y(\014le)29 b(p)s(oin)m(ted)g(to)g(b)m(y)f(mfptr,)h(and)f(up)s(on)f (return)g(mfptr)h(shall)h(p)s(oin)m(t)f(to)i(the)f(copied)g(mem)m(b)s (er)f(HDU.)h(The)227 3633 y(cp)s(opt)e(parameter)h(ma)m(y)g(tak)m(e)h (on)e(the)g(follo)m(wing)i(v)-5 b(alues:)40 b(OPT)p 2465 3633 28 4 v 32 w(MCP)p 2708 3633 V 32 w(ADD)29 b(whic)m(h)e(adds)f(a)i (new)f(en)m(try)227 3746 y(in)d(gfptr)g(for)f(the)i(copied)f(mem)m(b)s (er)g(HDU,)h(OPT)p 1907 3746 V 31 w(MCP)p 2149 3746 V 33 w(NADD)g(whic)m(h)f(do)s(es)g(not)g(add)f(an)h(en)m(try)h(in)e (gfptr)227 3859 y(for)i(the)h(copied)f(mem)m(b)s(er,)h(and)f(OPT)p 1536 3859 V 32 w(MCP)p 1779 3859 V 32 w(REPL)g(whic)m(h)g(replaces)h (the)f(original)h(mem)m(b)s(er)f(en)m(try)g(with)227 3972 y(the)31 b(copied)g(mem)m(b)s(er)e(en)m(try)-8 b(.)95 4249 y Fe(int)47 b(fits_copy_member)d(/)j(ffgmcp)286 4362 y(\(fitsfile)f(*gfptr,)f(fitsfile)h(*mfptr,)g(long)g(member,)g (int)h(cpopt,)f(>)i(int)f(*status\))0 4639 y Fi(5)81 b Fj(T)-8 b(ransfer)34 b(a)i(group)f(mem)m(b)s(er)f(HDU)i(from)f(the)h (grouping)f(table)h(p)s(oin)m(ted)f(to)h(b)m(y)f(infptr)g(to)h(the)f (grouping)227 4752 y(table)i(p)s(oin)m(ted)f(to)h(b)m(y)f(outfptr.)58 b(The)35 b(mem)m(b)s(er)h(HDU)h(to)f(transfer)g(is)g(iden)m(ti\014ed)g (b)m(y)g(its)h(ro)m(w)f(n)m(um)m(b)s(er)227 4865 y(within)42 b(infptr)f(as)i(sp)s(eci\014ed)f(b)m(y)g(the)h(parameter)g('mem)m(b)s (er')f(\(\014rst)g(mem)m(b)s(er)g(==)f(1\).)78 b(If)42 b(tfopt)h(==)227 4978 y(OPT)p 431 4978 V 32 w(MCP)p 674 4978 V 33 w(ADD)26 b(then)f(the)h(mem)m(b)s(er)e(HDU)i(is)g(made)f(a)h (mem)m(b)s(er)f(of)g(outfptr)g(and)g(remains)g(a)h(mem)m(b)s(er)227 5091 y(of)34 b(infptr.)51 b(If)34 b(tfopt)g(==)g(OPT)p 1339 5091 V 32 w(MCP)p 1582 5091 V 32 w(MO)m(V)h(then)f(the)g(mem)m(b)s (er)f(HDU)i(is)f(deleted)h(from)e(infptr)g(after)227 5204 y(the)e(transfer)f(to)h(outfptr.)95 5480 y Fe(int)47 b(fits_transfer_member)c(/)k(ffgmtf)286 5593 y(\(fitsfile)f(*infptr,)f (fitsfile)h(*outfptr,)f(long)i(member,)e(int)i(tfopt,)334 5706 y(>)h(int)e(*status\))p eop end %%Page: 94 102 TeXDict begin 94 101 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.94) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(94)1338 b Fh(CHAPTER)29 b(8.)112 b(HIERAR)m(CHICAL)30 b(GR)m(OUPING)h(R)m (OUTINES)0 555 y Fi(6)81 b Fj(Remo)m(v)m(e)31 b(a)e(mem)m(b)s(er)g(HDU) h(from)f(the)h(grouping)f(table)h(p)s(oin)m(ted)f(to)h(b)m(y)g(gfptr.) 40 b(The)29 b(mem)m(b)s(er)f(HDU)i(to)h(b)s(e)227 668 y(deleted)37 b(is)e(iden)m(ti\014ed)h(b)m(y)f(its)h(ro)m(w)g(n)m(um)m (b)s(er)f(in)g(the)h(grouping)f(table)h(as)g(sp)s(eci\014ed)f(b)m(y)h (the)f(parameter)227 781 y('mem)m(b)s(er')41 b(\(\014rst)g(mem)m(b)s (er)g(==)f(1\).)74 b(The)41 b(rmopt)g(parameter)h(ma)m(y)f(tak)m(e)i (on)e(the)h(follo)m(wing)g(v)-5 b(alues:)227 894 y(OPT)p 431 894 28 4 v 32 w(RM)p 613 894 V 33 w(ENTR)d(Y)34 b(whic)m(h)e(remo)m (v)m(es)j(the)e(mem)m(b)s(er)g(HDU)h(en)m(try)f(from)g(the)g(grouping)g (table)h(and)f(up-)227 1007 y(dates)40 b(the)f(mem)m(b)s(er's)f (GRPIDn/GRPLCn)g(k)m(eyw)m(ords,)k(and)c(OPT)p 2687 1007 V 32 w(RM)p 2869 1007 V 33 w(MBR)h(whic)m(h)g(remo)m(v)m(es)h(the)227 1120 y(mem)m(b)s(er)30 b(HDU)h(en)m(try)g(from)f(the)g(grouping)g (table)i(and)d(deletes)j(the)e(mem)m(b)s(er)g(HDU)h(itself.)95 1380 y Fe(int)47 b(fits_remove_member)c(/)48 b(ffgmrm)286 1492 y(\(fitsfile)e(*gfptr,)f(long)i(member,)f(int)h(rmopt,)f(>)h(int)g (*status\))p eop end %%Page: 95 103 TeXDict begin 95 102 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.95) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.9) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(9)0 1687 y Fm(Sp)6 b(ecialized)77 b(CFITSIO)f(In)-6 b(terface)0 1937 y(Routines)0 2429 y Fj(The)28 b(basic)h(in)m(terface)i(routines)e (describ)s(ed)e(previously)i(are)g(recommended)f(for)h(most)g(uses,)g (but)f(the)h(routines)0 2542 y(describ)s(ed)h(in)g(this)h(c)m(hapter)g (are)h(also)f(a)m(v)-5 b(ailable)34 b(if)c(necessary)-8 b(.)43 b(Some)31 b(of)g(these)g(routines)g(p)s(erform)e(more)i(sp)s(e-) 0 2655 y(cialized)e(function)d(that)i(cannot)f(easily)h(b)s(e)e(done)h (with)f(the)h(basic)h(in)m(terface)g(routines)f(while)f(others)h (duplicate)0 2767 y(the)j(functionalit)m(y)i(of)e(the)g(basic)h (routines)f(but)f(ha)m(v)m(e)i(a)g(sligh)m(tly)g(di\013eren)m(t)g (calling)g(sequence.)41 b(See)31 b(App)s(endix)0 2880 y(B)g(for)f(the)g(de\014nition)g(of)h(eac)m(h)h(function)e(parameter.)0 3090 y SDict begin H.S end 0 3090 a 0 3090 a SDict begin 13.6 H.A end 0 3090 a 0 3090 a SDict begin [/View [/XYZ H.V]/Dest (section.9.1) cvn /DEST pdfmark end 0 3090 a 179 x Ff(9.1)135 b(FITS)44 b(File)i(Access)e(Routines)0 3370 y SDict begin H.S end 0 3370 a 0 3370 a SDict begin 13.6 H.A end 0 3370 a 0 3370 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.1.1) cvn /DEST pdfmark end 0 3370 a 163 x Fd(9.1.1)112 b(File)39 b(Access)0 3777 y Fi(1)81 b Fj(Op)s(en)37 b(an)i(existing)i(FITS)d(\014le)h(residing)g(in)g(core)h(computer)f (memory)-8 b(.)68 b(This)38 b(routine)h(is)h(analogous)g(to)227 3890 y(\014ts)p 354 3890 28 4 v 33 w(op)s(en)p 577 3890 V 32 w(\014le.)55 b(The)35 b('\014lename')g(is)g(curren)m(tly)h (ignored)f(b)m(y)g(this)g(routine)g(and)g(ma)m(y)g(b)s(e)g(an)m(y)g (arbitrary)227 4003 y(string.)78 b(In)42 b(general,)47 b(the)c(application)h(m)m(ust)f(ha)m(v)m(e)h(preallo)s(cated)g(an)e (initial)i(blo)s(c)m(k)g(of)f(memory)f(to)227 4115 y(hold)i(the)h(FITS) f(\014le)h(prior)f(to)h(calling)h(this)e(routine:)70 b('memptr')44 b(p)s(oin)m(ts)g(to)i(the)e(starting)i(address)227 4228 y(and)39 b('memsize')i(giv)m(es)g(the)f(initial)h(size)f(of)g(the) g(blo)s(c)m(k)g(of)g(memory)-8 b(.)69 b('mem)p 2958 4228 V 33 w(reallo)s(c')41 b(is)f(a)g(p)s(oin)m(ter)f(to)227 4341 y(an)c(optional)i(function)d(that)i(CFITSIO)e(can)h(call)h(to)g (allo)s(cate)i(additional)e(memory)-8 b(,)37 b(if)e(needed)f(\(only)227 4454 y(if)41 b(mo)s(de)e(=)h(READ)m(WRITE\),)i(and)e(is)g(mo)s(deled)g (after)h(the)f(standard)g(C)g('reallo)s(c')i(function;)j(a)c(n)m(ull) 227 4567 y(p)s(oin)m(ter)g(ma)m(y)g(b)s(e)f(giv)m(en)i(if)e(the)h (initial)h(allo)s(cation)h(of)e(memory)f(is)h(all)g(that)g(will)g(b)s (e)f(required)g(\(e.g.,)227 4680 y(if)35 b(the)g(\014le)g(is)g(op)s (ened)f(with)h(mo)s(de)f(=)h(READONL)-8 b(Y\).)36 b(The)e('deltasize')j (parameter)e(ma)m(y)h(b)s(e)e(used)g(to)227 4793 y(suggest)g(a)f(minim) m(um)f(amoun)m(t)h(of)g(additional)h(memory)f(that)g(should)f(b)s(e)g (allo)s(cated)j(during)d(eac)m(h)i(call)227 4906 y(to)d(the)f(memory)f (reallo)s(cation)j(function.)40 b(By)30 b(default,)g(CFITSIO)e(will)i (reallo)s(cate)j(enough)c(additional)227 5019 y(space)44 b(to)g(hold)f(the)h(en)m(tire)g(curren)m(tly)f(de\014ned)g(FITS)f (\014le)i(\(as)f(giv)m(en)i(b)m(y)e(the)h(NAXISn)e(k)m(eyw)m(ords\))227 5132 y(or)g(1)f(FITS)g(blo)s(c)m(k)h(\(=)f(2880)i(b)m(ytes\),)i(whic)m (h)d(ev)m(er)g(is)f(larger.)74 b(V)-8 b(alues)43 b(of)e(deltasize)i (less)f(than)f(2880)227 5245 y(will)31 b(b)s(e)f(ignored.)42 b(Since)31 b(the)g(memory)g(reallo)s(cation)i(op)s(eration)e(can)g(b)s (e)f(computationally)i(exp)s(ensiv)m(e,)227 5357 y(allo)s(cating)27 b(a)e(larger)g(initial)h(blo)s(c)m(k)f(of)g(memory)-8 b(,)26 b(and/or)f(sp)s(ecifying)f(a)h(larger)h(deltasize)g(v)-5 b(alue)25 b(ma)m(y)g(help)227 5470 y(to)i(reduce)f(the)g(n)m(um)m(b)s (er)e(of)i(reallo)s(cation)i(calls)f(and)f(mak)m(e)h(the)f(application) h(program)f(run)e(faster.)40 b(Note)227 5583 y(that)29 b(v)-5 b(alues)29 b(of)f(the)h(memptr)f(and)f(memsize)j(p)s(oin)m(ters) e(will)h(b)s(e)e(up)s(dated)g(b)m(y)i(CFITSIO)d(if)j(the)f(lo)s(cation) 227 5696 y(or)j(size)g(of)f(the)h(FITS)f(\014le)g(in)g(memory)g(should) g(c)m(hange)h(as)g(a)g(result)f(of)g(allo)s(cating)j(more)e(memory)-8 b(.)1905 5942 y(95)p eop end %%Page: 96 104 TeXDict begin 96 103 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.96) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(96)1003 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)95 555 y Fe(int)47 b(fits_open_memfile)c(/)48 b(ffomem)286 668 y(\(fitsfile)e(**fptr,)f(const)i(char)f(*filename,)f (int)i(mode,)g(void)f(**memptr,)334 781 y(size_t)g(*memsize,)f(size_t)i (deltasize,)334 894 y(void)g(*\(*mem_realloc\)\(void)42 b(*p,)47 b(size_t)f(newsize\),)f(int)i(*status\))0 1147 y Fi(2)81 b Fj(Create)49 b(a)g(new)f(FITS)g(\014le)h(residing)f(in)h (core)g(computer)g(memory)-8 b(.)96 b(This)48 b(routine)g(is)h (analogous)h(to)227 1260 y(\014ts)p 354 1260 28 4 v 33 w(create)p 623 1260 V 34 w(\014le.)40 b(In)29 b(general,)i(the)e (application)h(m)m(ust)f(ha)m(v)m(e)i(preallo)s(cated)g(an)e(initial)h (blo)s(c)m(k)g(of)f(memory)227 1373 y(to)38 b(hold)e(the)h(FITS)f (\014le)h(prior)f(to)h(calling)i(this)d(routine:)54 b('memptr')36 b(p)s(oin)m(ts)h(to)g(the)g(starting)h(address)227 1486 y(and)h('memsize')i(giv)m(es)g(the)f(initial)h(size)f(of)g(the)g(blo)s (c)m(k)g(of)g(memory)-8 b(.)69 b('mem)p 2958 1486 V 33 w(reallo)s(c')41 b(is)f(a)g(p)s(oin)m(ter)f(to)227 1599 y(an)f(optional)g(function)f(that)h(CFITSIO)e(can)i(call)h(to)f(allo)s (cate)i(additional)e(memory)-8 b(,)40 b(if)d(needed,)j(and)227 1712 y(is)34 b(mo)s(deled)f(after)h(the)g(standard)f(C)g('reallo)s(c')i (function;)g(a)f(n)m(ull)f(p)s(oin)m(ter)h(ma)m(y)g(b)s(e)f(giv)m(en)h (if)g(the)g(initial)227 1824 y(allo)s(cation)i(of)d(memory)g(is)h(all)g (that)g(will)f(b)s(e)g(required.)48 b(The)33 b('deltasize')j(parameter) d(ma)m(y)h(b)s(e)f(used)f(to)227 1937 y(suggest)i(a)f(minim)m(um)f (amoun)m(t)h(of)g(additional)h(memory)f(that)g(should)f(b)s(e)g(allo)s (cated)j(during)d(eac)m(h)i(call)227 2050 y(to)d(the)f(memory)f(reallo) s(cation)j(function.)40 b(By)30 b(default,)g(CFITSIO)e(will)i(reallo)s (cate)j(enough)c(additional)227 2163 y(space)41 b(to)g(hold)e(1)i(FITS) e(blo)s(c)m(k)h(\(=)g(2880)i(b)m(ytes\))f(and)e(v)-5 b(alues)41 b(of)f(deltasize)h(less)g(than)f(2880)h(will)g(b)s(e)227 2276 y(ignored.)f(Since)28 b(the)f(memory)h(reallo)s(cation)i(op)s (eration)e(can)g(b)s(e)f(computationally)i(exp)s(ensiv)m(e,)g(allo)s (cat-)227 2389 y(ing)36 b(a)f(larger)h(initial)h(blo)s(c)m(k)e(of)h (memory)-8 b(,)37 b(and/or)e(sp)s(ecifying)g(a)h(larger)g(deltasize)h (v)-5 b(alue)36 b(ma)m(y)f(help)g(to)227 2502 y(reduce)f(the)g(n)m(um)m (b)s(er)e(of)i(reallo)s(cation)i(calls)f(and)e(mak)m(e)i(the)f (application)h(program)f(run)e(faster.)52 b(Note)227 2615 y(that)29 b(v)-5 b(alues)29 b(of)f(the)h(memptr)f(and)f(memsize)j (p)s(oin)m(ters)e(will)h(b)s(e)e(up)s(dated)g(b)m(y)i(CFITSIO)d(if)j (the)f(lo)s(cation)227 2728 y(or)j(size)g(of)f(the)h(FITS)f(\014le)g (in)g(memory)g(should)g(c)m(hange)h(as)g(a)g(result)f(of)g(allo)s (cating)j(more)e(memory)-8 b(.)95 2981 y Fe(int)47 b (fits_create_memfile)c(/)k(ffimem)286 3094 y(\(fitsfile)f(**fptr,)f (void)i(**memptr,)334 3207 y(size_t)f(*memsize,)f(size_t)i(deltasize,) 334 3320 y(void)g(*\(*mem_realloc\)\(void)42 b(*p,)47 b(size_t)f(newsize\),)f(int)i(*status\))0 3573 y Fi(3)81 b Fj(Reop)s(en)34 b(a)i(FITS)e(\014le)h(that)h(w)m(as)f(previously)g (op)s(ened)g(with)f(\014ts)p 2414 3573 V 33 w(op)s(en)p 2637 3573 V 32 w(\014le)h(or)g(\014ts)p 3058 3573 V 33 w(create)p 3327 3573 V 34 w(\014le.)55 b(The)34 b(new)227 3685 y(\014ts\014le)i(p)s(oin)m(ter)h(ma)m(y)g(then)f(b)s(e)f(treated)j (as)e(a)h(separate)g(\014le,)h(and)e(one)h(ma)m(y)g(sim)m(ultaneously)g (read)f(or)227 3798 y(write)e(to)h(2)f(\(or)g(more\))g(di\013eren)m(t)g (extensions)g(in)g(the)g(same)g(\014le.)51 b(The)33 b(\014ts)p 2886 3798 V 32 w(op)s(en)p 3108 3798 V 32 w(\014le)h(routine)g(\(ab)s (o)m(v)m(e\))227 3911 y(automatically)k(detects)f(cases)f(where)e(a)i (previously)f(op)s(ened)f(\014le)i(is)f(b)s(eing)g(op)s(ened)f(again,)k (and)c(then)227 4024 y(in)m(ternally)e(call)f(\014ts)p 930 4024 V 33 w(reop)s(en)p 1229 4024 V 32 w(\014le,)g(so)f(programs)g (should)g(rarely)g(need)g(to)h(explicitly)h(call)g(this)e(routine.)95 4277 y Fe(int)47 b(fits_reopen_file)d(/)j(ffreopen)286 4390 y(\(fitsfile)f(*openfptr,)f(fitsfile)g(**newfptr,)g(>)j(int)f (*status\))0 4643 y Fi(4)81 b Fj(Create)24 b(a)g(new)f(FITS)g(\014le,)i (using)e(a)h(template)h(\014le)e(to)i(de\014ne)d(its)i(initial)h(size)g (and)e(structure.)37 b(The)24 b(template)227 4756 y(ma)m(y)i(b)s(e)f (another)g(FITS)g(HDU)h(or)f(an)g(ASCI)s(I)f(template)j(\014le.)39 b(If)25 b(the)g(input)g(template)h(\014le)g(name)f(p)s(oin)m(ter)227 4869 y(is)j(n)m(ull,)h(then)e(this)h(routine)f(b)s(eha)m(v)m(es)i(the)f (same)g(as)g(\014ts)p 2160 4869 V 32 w(create)p 2428 4869 V 35 w(\014le.)40 b(The)27 b(curren)m(tly)h(supp)s(orted)e(format) 227 4982 y(of)33 b(the)g(ASCI)s(I)e(template)j(\014le)e(is)h(describ)s (ed)e(under)g(the)i(\014ts)p 2350 4982 V 33 w(parse)p 2591 4982 V 32 w(template)h(routine)f(\(in)f(the)h(general)227 5095 y(Utilities)g(section\))95 5348 y Fe(int)47 b (fits_create_template)c(/)k(fftplt)286 5461 y(\(fitsfile)f(**fptr,)f (char)i(*filename,)e(char)i(*tpltfile)e(>)i(int)g(*status\))0 5714 y Fi(5)81 b Fj(P)m(arse)31 b(the)f(input)g(\014lename)g(or)g(URL)h (in)m(to)g(its)g(comp)s(onen)m(t)f(parts,)h(namely:)p eop end %%Page: 97 105 TeXDict begin 97 104 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.97) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.1.)72 b(FITS)30 b(FILE)g(A)m(CCESS)f(R)m(OUTINES)2244 b Fj(97)336 555 y Fc(\017)46 b Fj(the)31 b(\014le)f(t)m(yp)s(e)h(\(\014le://,)h (ftp://,)f(h)m(ttp://,)h(etc\),)336 700 y Fc(\017)46 b Fj(the)31 b(base)f(input)g(\014le)g(name,)336 845 y Fc(\017)46 b Fj(the)31 b(name)f(of)h(the)f(output)g(\014le)h(that)g (the)f(input)g(\014le)g(is)h(to)g(b)s(e)e(copied)i(to)g(prior)f(to)h (op)s(ening,)336 990 y Fc(\017)46 b Fj(the)31 b(HDU)g(or)f(extension)h (sp)s(eci\014cation,)336 1134 y Fc(\017)46 b Fj(the)31 b(\014ltering)f(sp)s(eci\014er,)336 1279 y Fc(\017)46 b Fj(the)31 b(binning)e(sp)s(eci\014er,)336 1424 y Fc(\017)46 b Fj(the)31 b(column)f(sp)s(eci\014er,)336 1569 y Fc(\017)46 b Fj(and)30 b(the)h(image)g(pixel)g(\014ltering)g(sp)s(eci\014er.)227 1755 y(A)k(n)m(ull)g(p)s(oin)m(ter)f(\(0\))i(ma)m(y)g(b)s(e)e(b)s(e)g (sp)s(eci\014ed)g(for)g(an)m(y)h(of)g(the)g(output)g(string)f(argumen)m (ts)h(that)h(are)f(not)227 1868 y(needed.)52 b(Null)34 b(strings)g(will)g(b)s(e)g(returned)f(for)h(an)m(y)g(comp)s(onen)m(ts)g (that)h(are)f(not)h(presen)m(t)f(in)g(the)g(input)227 1981 y(\014le)28 b(name.)39 b(The)27 b(calling)i(routine)e(m)m(ust)g (allo)s(cate)j(su\016cien)m(t)d(memory)g(to)h(hold)f(the)g(returned)f (c)m(haracter)227 2094 y(strings.)52 b(Allo)s(cating)37 b(the)d(string)g(lengths)h(equal)g(to)g(FLEN)p 2362 2094 28 4 v 33 w(FILENAME)f(is)g(guaran)m(teed)i(to)f(b)s(e)e(safe.)227 2207 y(These)d(routines)h(are)f(mainly)h(for)f(in)m(ternal)h(use)f(b)m (y)h(other)f(CFITSIO)f(routines.)95 2462 y Fe(int)47 b(fits_parse_input_url)c(/)k(ffiurl)286 2575 y(\(char)g(*filename,)e(>) i(char)g(*filetype,)e(char)h(*infile,)g(char)h(*outfile,)e(char)334 2688 y(*extspec,)g(char)i(*filter,)f(char)g(*binspec,)f(char)i (*colspec,)e(int)i(*status\))95 2914 y(int)g(fits_parse_input_filename) 41 b(/)48 b(ffifile)286 3027 y(\(char)f(*filename,)e(>)i(char)g (*filetype,)e(char)h(*infile,)g(char)h(*outfile,)e(char)334 3140 y(*extspec,)g(char)i(*filter,)f(char)g(*binspec,)f(char)i (*colspec,)e(char)i(*pixspec,)334 3253 y(int)g(*status\))0 3509 y Fi(6)81 b Fj(P)m(arse)33 b(the)f(input)g(\014lename)h(and)e (return)h(the)h(HDU)g(n)m(um)m(b)s(er)e(that)i(w)m(ould)f(b)s(e)g(mo)m (v)m(ed)i(to)f(if)f(the)h(\014le)f(w)m(ere)227 3622 y(op)s(ened)h(with) g(\014ts)p 878 3622 V 32 w(op)s(en)p 1100 3622 V 32 w(\014le.)49 b(The)33 b(returned)f(HDU)i(n)m(um)m(b)s(er)e(b)s(egins)h(with)g(1)g (for)g(the)g(primary)g(arra)m(y)-8 b(,)227 3734 y(so)40 b(for)f(example,)k(if)c(the)h(input)e(\014lename)i(=)f(`m)m (y\014le.\014ts[2]')i(then)e(hdun)m(um)e(=)i(3)h(will)g(b)s(e)f (returned.)227 3847 y(CFITSIO)j(do)s(es)i(not)g(op)s(en)f(the)g(\014le) h(to)h(c)m(hec)m(k)g(if)e(the)h(extension)h(actually)g(exists)f(if)g (an)f(extension)227 3960 y(n)m(um)m(b)s(er)e(is)i(sp)s(eci\014ed.)75 b(If)42 b(an)g(extension)h(name)f(is)h(included)e(in)h(the)h(\014le)f (name)g(sp)s(eci\014cation)h(\(e.g.)227 4073 y(`m)m (y\014le.\014ts[EVENTS]')i(then)e(this)h(routine)g(will)h(ha)m(v)m(e)g (to)f(op)s(en)g(the)g(FITS)f(\014le)h(and)f(lo)s(ok)i(for)f(the)227 4186 y(p)s(osition)31 b(of)f(the)h(named)f(extension,)i(then)e(close)i (\014le)e(again.)42 b(This)30 b(is)g(not)h(p)s(ossible)f(if)h(the)f (\014le)h(is)f(b)s(eing)227 4299 y(read)k(from)f(the)h(stdin)f(stream,) i(and)f(an)f(error)g(will)i(b)s(e)e(returned)f(in)i(this)f(case.)52 b(If)33 b(the)h(\014lename)g(do)s(es)227 4412 y(not)42 b(sp)s(ecify)g(an)g(explicit)h(extension)g(\(e.g.)76 b('m)m(y\014le.\014ts'\))43 b(then)f(hdun)m(um)e(=)h(-99)i(will)g(b)s (e)e(returned,)227 4525 y(whic)m(h)35 b(is)g(functionally)h(equiv)-5 b(alen)m(t)36 b(to)g(hdun)m(um)d(=)h(1.)55 b(This)34 b(routine)h(is)g(mainly)h(used)e(for)g(bac)m(kw)m(ard)227 4638 y(compatibilit)m(y)39 b(in)e(the)f(fto)s(ols)i(soft)m(w)m(are)g (pac)m(k)-5 b(age)39 b(and)d(is)g(not)h(recommended)g(for)f(general)i (use.)59 b(It)37 b(is)227 4751 y(generally)k(b)s(etter)e(and)g(more)g (e\016cien)m(t)i(to)f(\014rst)e(op)s(en)h(the)g(FITS)g(\014le)g(with)g (\014ts)p 3125 4751 V 32 w(op)s(en)p 3347 4751 V 33 w(\014le,)i(then)e (use)227 4864 y(\014ts)p 354 4864 V 33 w(get)p 507 4864 V 34 w(hdu)p 694 4864 V 31 w(n)m(um)c(to)i(determine)g(whic)m(h)f(HDU)h (in)f(the)h(\014le)f(has)g(b)s(een)g(op)s(ened,)h(rather)f(than)g (calling)227 4976 y(\014ts)p 354 4976 V 33 w(parse)p 595 4976 V 32 w(input)p 840 4976 V 32 w(url)30 b(follo)m(w)m(ed)i(b)m (y)e(a)h(call)g(to)h(\014ts)p 1967 4976 V 32 w(op)s(en)p 2189 4976 V 32 w(\014le.)143 5232 y Fe(int)47 b(fits_parse_extnum)c(/) 48 b(ffextn)334 5345 y(\(char)e(*filename,)f(>)j(int)f(*hdunum,)e(int)i (*status\))0 5601 y Fi(7)81 b Fj(P)m(arse)45 b(the)g(input)e(\014le)i (name)g(and)f(return)f(the)i(ro)s(ot)g(\014le)g(name.)83 b(The)44 b(ro)s(ot)h(name)g(includes)f(the)h(\014le)227 5714 y(t)m(yp)s(e)35 b(if)g(sp)s(eci\014ed,)h(\(e.g.)56 b('ftp://')37 b(or)e('h)m(ttp://'\))i(and)d(the)h(full)g(path)g(name,)h (to)g(the)f(exten)m(t)i(that)e(it)h(is)p eop end %%Page: 98 106 TeXDict begin 98 105 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.98) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(98)1003 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)227 555 y Fj(sp)s(eci\014ed)c(in)f(the)i (input)e(\014lename.)39 b(It)26 b(do)s(es)g(not)g(include)g(the)g(HDU)h (name)f(or)g(n)m(um)m(b)s(er,)g(or)g(an)m(y)h(\014ltering)227 668 y(sp)s(eci\014cations.)86 b(The)45 b(calling)h(routine)g(m)m(ust)f (allo)s(cate)i(su\016cien)m(t)f(memory)f(to)h(hold)f(the)g(returned)227 781 y(ro)s(otname)33 b(c)m(haracter)g(string.)46 b(Allo)s(cating)34 b(the)f(length)f(equal)h(to)f(FLEN)p 2817 781 28 4 v 33 w(FILENAME)h(is)f(guaran)m(teed)227 894 y(to)f(b)s(e)f(safe.)143 1119 y Fe(int)47 b(fits_parse_rootname)c(/)k(ffrtnm)334 1232 y(\(char)f(*filename,)f(>)j(char)f(*rootname,)e(int)h(*status\);)0 1457 y Fi(8)81 b Fj(T)-8 b(est)37 b(if)f(the)h(input)f(\014le)h(or)f(a) h(compressed)g(v)m(ersion)g(of)g(the)g(\014le)f(\(with)h(a)g(.gz,)j (.Z,)c(.z,)j(or)e(.zip)g(extension\))227 1570 y(exists)i(on)f(disk.)63 b(The)37 b(returned)g(v)-5 b(alue)38 b(of)g(the)h('exists')g(parameter) f(will)g(ha)m(v)m(e)i(1)e(of)g(the)g(4)g(follo)m(wing)227 1683 y(v)-5 b(alues:)370 1893 y Fe(2:)95 b(the)47 b(file)g(does)g(not)f (exist,)h(but)f(a)i(compressed)d(version)h(does)g(exist)370 2006 y(1:)95 b(the)47 b(disk)g(file)g(does)f(exist)370 2119 y(0:)95 b(neither)46 b(the)h(file)g(nor)g(a)g(compressed)e (version)h(of)h(the)g(file)g(exist)323 2232 y(-1:)94 b(the)47 b(input)g(file)f(name)h(is)g(not)g(a)g(disk)g(file)g(\(could)f (be)h(a)g(ftp,)g(http,)561 2344 y(smem,)g(or)g(mem)g(file,)f(or)h(a)h (file)e(piped)h(in)g(on)g(the)g(STDIN)f(stream\))143 2635 y(int)h(fits_file_exists)c(/)48 b(ffexist)334 2748 y(\(char)e(*filename,)f(>)j(int)f(*exists,)e(int)i(*status\);)0 2973 y Fi(9)81 b Fj(Flush)36 b(an)m(y)i(in)m(ternal)g(bu\013ers)e(of)i (data)g(to)g(the)f(output)g(FITS)g(\014le.)62 b(These)37 b(routines)g(rarely)g(need)g(to)i(b)s(e)227 3086 y(called,)i(but)36 b(can)i(b)s(e)f(useful)f(in)h(cases)i(where)d(other)i(pro)s(cesses)f (need)g(to)h(access)h(the)f(same)f(FITS)g(\014le)227 3199 y(in)j(real)i(time,)h(either)e(on)g(disk)f(or)g(in)g(memory)-8 b(.)71 b(These)41 b(routines)f(also)h(help)f(to)i(ensure)d(that)i(if)g (the)227 3312 y(application)c(program)d(subsequen)m(tly)h(ab)s(orts)f (then)h(the)g(FITS)f(\014le)h(will)g(ha)m(v)m(e)i(b)s(een)d(closed)h (prop)s(erly)-8 b(.)227 3425 y(The)43 b(\014rst)g(routine,)k(\014ts)p 1110 3425 V 33 w(\015ush)p 1332 3425 V 31 w(\014le)c(is)h(more)f (rigorous)h(and)f(completely)i(closes,)j(then)c(reop)s(ens,)i(the)227 3538 y(curren)m(t)31 b(HDU,)h(b)s(efore)e(\015ushing)g(the)h(in)m (ternal)g(bu\013ers,)f(th)m(us)h(ensuring)f(that)h(the)g(output)g(FITS) f(\014le)h(is)227 3650 y(iden)m(tical)38 b(to)e(what)f(w)m(ould)h(b)s (e)f(pro)s(duced)f(if)h(the)h(FITS)f(w)m(as)h(closed)g(at)g(that)g(p)s (oin)m(t)g(\(i.e.,)i(with)e(a)g(call)227 3763 y(to)g(\014ts)p 470 3763 V 33 w(close)p 689 3763 V 34 w(\014le\).)56 b(The)35 b(second)g(routine,)i(\014ts)p 1912 3763 V 33 w(\015ush)p 2134 3763 V 31 w(bu\013er)d(simply)h(\015ushes)f(the)h(in)m (ternal)h(CFITSIO)227 3876 y(bu\013ers)28 b(of)h(data)h(to)f(the)h (output)e(FITS)g(\014le,)i(without)f(up)s(dating)f(and)g(closing)i(the) f(curren)m(t)g(HDU.)h(This)227 3989 y(is)37 b(m)m(uc)m(h)g(faster,)i (but)e(there)g(ma)m(y)g(b)s(e)f(circumstances)i(where)e(the)h (\015ushed)f(\014le)h(do)s(es)f(not)h(completely)227 4102 y(re\015ect)31 b(the)g(\014nal)f(state)i(of)e(the)h(\014le)f(as)h (it)g(will)f(exist)i(when)d(the)h(\014le)h(is)f(actually)i(closed.)227 4247 y(A)f(t)m(ypical)h(use)e(of)h(these)g(routines)f(w)m(ould)g(b)s(e) g(to)h(\015ush)e(the)h(state)i(of)f(a)g(FITS)e(table)j(to)f(disk)f (after)h(eac)m(h)227 4360 y(ro)m(w)36 b(of)f(the)h(table)g(is)f (written.)55 b(It)36 b(is)f(recommend)g(that)h(\014ts)p 2392 4360 V 32 w(\015ush)p 2613 4360 V 32 w(\014le)f(b)s(e)g(called)h (after)g(the)f(\014rst)g(ro)m(w)227 4472 y(is)k(written,)i(then)d (\014ts)p 1023 4472 V 32 w(\015ush)p 1244 4472 V 31 w(bu\013er)g(ma)m (y)h(b)s(e)f(called)h(after)g(eac)m(h)h(subsequen)m(t)e(ro)m(w)g(is)h (written.)65 b(Note)227 4585 y(that)40 b(this)f(latter)h(routine)f (will)g(not)g(automatically)j(up)s(date)c(the)h(NAXIS2)g(k)m(eyw)m(ord) h(whic)m(h)e(records)227 4698 y(the)c(n)m(um)m(b)s(er)d(of)i(ro)m(ws)h (of)f(data)g(in)g(the)g(table,)i(so)f(this)f(k)m(eyw)m(ord)g(m)m(ust)g (b)s(e)f(explicitly)j(up)s(dated)d(b)m(y)h(the)227 4811 y(application)f(program)e(after)h(eac)m(h)h(ro)m(w)e(is)g(written.)95 5036 y Fe(int)47 b(fits_flush_file)d(/)j(ffflus)286 5149 y(\(fitsfile)f(*fptr,)g(>)h(int)g(*status\))95 5375 y(int)g (fits_flush_buffer)c(/)48 b(ffflsh)286 5488 y(\(fitsfile)e(*fptr,)g(0,) h(>)g(int)g(*status\))286 5714 y(\(Note:)94 b(The)47 b(second)f(argument)g(must)g(be)i(0\).)p eop end %%Page: 99 107 TeXDict begin 99 106 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.99) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.1.)72 b(FITS)30 b(FILE)g(A)m(CCESS)f(R)m(OUTINES)2244 b Fj(99)0 555 y Fi(10)81 b Fj(W)-8 b(rapp)s(er)37 b(functions)h(for)g(global)h (initialization)i(and)c(clean)m(up)i(of)f(the)g(lib)s(curl)f(library)h (used)f(when)g(ac-)227 668 y(cessing)42 b(\014les)g(with)f(the)g(HTTPS) g(or)g(FTPS)g(proto)s(cols.)74 b(If)41 b(an)g(HTTPS/FTPS)f(\014le)i (transfer)f(is)g(to)227 781 y(b)s(e)33 b(p)s(erformed,)g(it)h(is)g (recommended)f(that)h(y)m(ou)g(call)h(the)f(init)g(function)f(once)h (near)f(the)h(start)g(of)g(y)m(our)227 894 y(program)j(b)s(efore)g(an)m (y)g(\014le)p 1177 894 28 4 v 33 w(op)s(en)f(calls,)k(and)d(b)s(efore)f (creating)j(an)m(y)e(threads.)60 b(The)37 b(clean)m(up)g(function)227 1007 y(should)29 b(b)s(e)f(called)j(after)f(all)g(HTTPS/FTPS)e(\014le)i (accessing)g(is)g(completed,)h(and)d(after)i(all)h(threads)e(are)227 1120 y(completed.)40 b(The)24 b(functions)f(return)h(0)g(up)s(on)f (successful)h(initialization)j(and)d(clean)m(up.)39 b(These)24 b(are)g(NOT)227 1233 y(THREAD-SAFE.)95 1505 y Fe(int)47 b(fits_init_https)d(/)j(ffihtps)286 1618 y(\(\))95 1844 y(int)g(fits_cleanup_https)c(/)48 b(ffchtps)286 1957 y(\(\))0 2107 y SDict begin H.S end 0 2107 a 0 2107 a SDict begin 13.6 H.A end 0 2107 a 0 2107 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.1.2) cvn /DEST pdfmark end 0 2107 a 156 x Fd(9.1.2)112 b(Do)m(wnload)39 b(Utilit)m(y)e(F)-9 b(unctions)0 2485 y Fj(These)32 b(routines)h(do)f(not)h(need)g(to)g(b)s (e)f(called)i(for)e(normal)h(\014le)f(accessing.)49 b(They)33 b(are)g(primarily)f(in)m(tended)g(to)0 2598 y(help)g(with)g(debugging)g (and)g(diagnosing)h(issues)f(whic)m(h)g(o)s(ccur)g(during)f(\014le)i (do)m(wnloads.)46 b(These)32 b(routines)h(are)0 2710 y(NOT)d(THREAD-SAFE.)0 2983 y Fi(1)81 b Fj(T)-8 b(oggle)23 b(the)f(v)m(erb)s(osit)m(y)g(of)f(the)h(lib)s(curl)e(library)h (diagnostic)i(output)e(when)f(accessing)j(\014les)f(with)f(the)g(HTTPS) 227 3096 y(or)31 b(FTPS)e(proto)s(col.)42 b(`\015ag')31 b(=)f(1)h(turns)e(the)i(output)f(on,)g(0)h(turns)e(it)i(o\013)g(\(the)g (default\).)143 3369 y Fe(void)47 b(fits_verbose_https)c(/)k(ffvhtps) 382 3482 y(\(int)f(flag\))0 3754 y Fi(2)g Fj(If)38 b(`\015ag')h(is)g (set)g(to)g(1,)j(this)c(will)h(displa)m(y)g(\(to)h(stderr\))e(a)h (progress)f(bar)g(during)g(an)g(h)m(ttps)h(\014le)f(do)m(wnload.)227 3867 y(\(This)30 b(is)h(not)f(y)m(et)i(implemen)m(ted)f(for)f(other)g (\014le)h(transfer)f(proto)s(cols.\))42 b(`\015ag')31 b(=)f(0)h(b)m(y)f(default.)143 4140 y Fe(void)47 b (fits_show_download_progr)o(ess)41 b(/)48 b(ffshdwn)382 4253 y(\(int)e(flag\))0 4525 y Fi(3)g Fj(The)33 b(timeout)h(setting)h (\(in)e(seconds\))h(determines)f(the)h(maxim)m(um)f(time)h(allo)m(w)m (ed)h(for)e(a)h(net)g(do)m(wnload)f(to)227 4638 y(complete.)42 b(If)28 b(a)h(do)m(wnload)f(has)h(not)f(\014nished)f(within)h(the)h (allo)m(w)m(ed)h(time,)g(the)f(\014le)f(transfer)g(will)h(termi-)227 4751 y(nate)d(and)f(the)h(CFITSIO)e(calling)j(function)e(will)g(return) g(with)g(an)g(error.)39 b(Use)26 b(\014ts)p 3102 4751 28 4 v 32 w(get)p 3254 4751 V 34 w(timeout)h(will)e(see)227 4864 y(the)30 b(curren)m(t)g(timeout)g(setting)h(and)e(\014ts)p 1637 4864 V 33 w(set)p 1781 4864 V 33 w(timeout)i(to)f(c)m(hange)h(the) f(setting.)42 b(This)29 b(adjustman)m(t)g(ma)m(y)227 4977 y(b)s(e)h(particularly)h(useful)f(when)f(ha)m(ving)i(trouble)f(do) m(wnloading)h(large)g(\014les)g(o)m(v)m(er)h(slo)m(w)f(connections.)143 5250 y Fe(int)47 b(fits_get_timeout)c(/)48 b(ffgtmo)334 5363 y(\(\))143 5588 y(int)f(fits_set_timeout)c(/)48 b(ffstmo)334 5701 y(\(int)f(seconds,)e(>)j(int)f(*status\))p eop end %%Page: 100 108 TeXDict begin 100 107 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.100) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(100)958 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (section.9.2) cvn /DEST pdfmark end 0 464 a 91 x Ff(9.2)135 b(HDU)46 b(Access)e(Routines)0 795 y Fi(1)81 b Fj(Get)28 b(the)f(b)m(yte)h(o\013sets)g(in)f(the)g (FITS)f(\014le)i(to)f(the)h(start)g(of)f(the)g(header)g(and)g(the)g (start)h(and)e(end)h(of)g(the)g(data)227 908 y(in)34 b(the)g(CHDU.)g(The)f(di\013erence)h(b)s(et)m(w)m(een)h(headstart)f (and)f(dataend)h(equals)g(the)g(size)g(of)g(the)g(CHDU.)227 1021 y(If)e(the)h(CHDU)f(is)h(the)f(last)h(HDU)g(in)f(the)h(\014le,)g (then)f(dataend)g(is)g(also)i(equal)e(to)h(the)g(size)g(of)g(the)f(en)m (tire)227 1133 y(FITS)i(\014le.)55 b(Null)35 b(p)s(oin)m(ters)g(ma)m(y) g(b)s(e)f(input)g(for)h(an)m(y)g(of)g(the)g(address)f(parameters)i(if)e (their)h(v)-5 b(alues)36 b(are)227 1246 y(not)31 b(needed.)95 1502 y Fe(int)47 b(fits_get_hduaddr)d(/)j(ffghad)94 b(\(only)46 b(supports)g(files)g(up)h(to)h(2.1)f(GB)g(in)g(size\))334 1615 y(\(fitsfile)e(*fptr,)h(>)i(long)f(*headstart,)d(long)j (*datastart,)e(long)h(*dataend,)382 1728 y(int)h(*status\))95 1953 y(int)g(fits_get_hduaddrll)c(/)48 b(ffghadll)93 b(\(supports)45 b(large)i(files\))334 2066 y(\(fitsfile)e(*fptr,)h(>)i (LONGLONG)d(*headstart,)g(LONGLONG)h(*datastart,)382 2179 y(LONGLONG)f(*dataend,)h(int)h(*status\))0 2434 y Fi(2)81 b Fj(Create)31 b(\(app)s(end\))f(a)i(new)e(empt)m(y)i(HDU)f (at)h(the)f(end)f(of)i(the)f(FITS)f(\014le.)42 b(This)31 b(is)g(no)m(w)g(the)g(CHDU)g(but)f(it)227 2547 y(is)i(completely)g (empt)m(y)g(and)f(has)g(no)g(header)g(k)m(eyw)m(ords.)43 b(It)32 b(is)f(recommended)g(that)h(\014ts)p 3344 2547 28 4 v 32 w(create)p 3612 2547 V 34 w(img)g(or)227 2660 y(\014ts)p 354 2660 V 33 w(create)p 623 2660 V 34 w(tbl)e(b)s(e)g(used) g(instead)g(of)h(this)f(routine.)95 2916 y Fe(int)47 b(fits_create_hdu)d(/)j(ffcrhd)286 3028 y(\(fitsfile)f(*fptr,)g(>)h (int)g(*status\))0 3284 y Fi(3)81 b Fj(Insert)22 b(a)h(new)g(IMA)m(GE)h (extension)f(immediately)i(follo)m(wing)f(the)f(CHDU,)h(or)f(insert)g (a)g(new)f(Primary)h(Arra)m(y)227 3397 y(at)30 b(the)e(b)s(eginning)g (of)h(the)g(\014le.)40 b(An)m(y)29 b(follo)m(wing)h(extensions)f(in)g (the)f(\014le)h(will)g(b)s(e)f(shifted)g(do)m(wn)h(to)g(mak)m(e)227 3510 y(ro)s(om)36 b(for)h(the)f(new)g(extension.)59 b(If)36 b(the)h(CHDU)g(is)f(the)h(last)g(HDU)g(in)f(the)h(\014le)f(then)g(the)h (new)f(image)227 3623 y(extension)31 b(will)g(simply)e(b)s(e)h(app)s (ended)e(to)j(the)f(end)g(of)g(the)g(\014le.)41 b(One)30 b(can)g(force)h(a)g(new)e(primary)g(arra)m(y)227 3735 y(to)35 b(b)s(e)d(inserted)i(at)g(the)g(b)s(eginning)f(of)g(the)h(FITS) f(\014le)g(b)m(y)h(setting)h(status)e(=)h(PREPEND)p 3432 3735 V 32 w(PRIMAR)-8 b(Y)227 3848 y(prior)25 b(to)g(calling)i(the)e (routine.)38 b(In)25 b(this)f(case)i(the)f(old)g(primary)f(arra)m(y)i (will)f(b)s(e)f(con)m(v)m(erted)j(to)e(an)g(IMA)m(GE)227 3961 y(extension.)49 b(The)32 b(new)g(extension)i(\(or)f(primary)f (arra)m(y\))h(will)h(b)s(ecome)f(the)g(CHDU.)g(Refer)g(to)h(Chapter)227 4074 y(9)d(for)f(a)h(list)g(of)f(pre-de\014ned)f(bitpix)i(v)-5 b(alues.)95 4329 y Fe(int)47 b(fits_insert_img)d(/)j(ffiimg)286 4442 y(\(fitsfile)f(*fptr,)g(int)h(bitpix,)e(int)i(naxis,)f(long)h (*naxes,)f(>)h(int)g(*status\))95 4668 y(int)g(fits_insert_imgll)c(/)48 b(ffiimgll)286 4781 y(\(fitsfile)e(*fptr,)g(int)h(bitpix,)e(int)i (naxis,)f(LONGLONG)g(*naxes,)g(>)h(int)g(*status\))0 5036 y Fi(4)81 b Fj(Insert)30 b(a)g(new)g(ASCI)s(I)f(or)i(binary)f (table)h(extension)g(immediately)h(follo)m(wing)g(the)f(CHDU.)g(An)m(y) f(follo)m(wing)227 5149 y(extensions)36 b(will)g(b)s(e)f(shifted)g(do)m (wn)g(to)h(mak)m(e)g(ro)s(om)g(for)f(the)g(new)g(extension.)57 b(If)35 b(there)h(are)f(no)h(other)227 5262 y(follo)m(wing)c (extensions)g(then)e(the)h(new)f(table)h(extension)h(will)f(simply)f(b) s(e)g(app)s(ended)f(to)i(the)g(end)f(of)h(the)227 5375 y(\014le.)42 b(If)30 b(the)h(FITS)f(\014le)g(is)h(curren)m(tly)g(empt)m (y)g(then)f(this)g(routine)h(will)g(create)h(a)f(dumm)m(y)f(primary)f (arra)m(y)227 5488 y(b)s(efore)i(app)s(ending)f(the)i(table)h(to)f(it.) 44 b(The)31 b(new)g(extension)i(will)e(b)s(ecome)h(the)g(CHDU.)g(The)f (tunit)h(and)227 5601 y(extname)39 b(parameters)g(are)f(optional)i(and) e(a)g(n)m(ull)g(p)s(oin)m(ter)h(ma)m(y)f(b)s(e)g(giv)m(en)h(if)f(they)h (are)f(not)h(de\014ned.)227 5714 y(When)32 b(inserting)g(an)g(ASCI)s(I) f(table)i(with)e(\014ts)p 1847 5714 V 33 w(insert)p 2103 5714 V 33 w(atbl,)i(a)f(n)m(ull)g(p)s(oin)m(ter)g(ma)m(y)h(giv)m(en)g (for)f(the)g(*tb)s(col)p eop end %%Page: 101 109 TeXDict begin 101 108 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.101) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.2.)72 b(HDU)31 b(A)m(CCESS)e(R)m(OUTINES)2443 b Fj(101)227 555 y(parameter)23 b(in)f(whic)m(h)h(case)g(eac)m(h)h(column)e(of)h (the)g(table)g(will)g(b)s(e)f(separated)h(b)m(y)f(a)h(single)g(space)g (c)m(haracter.)227 668 y(Similarly)-8 b(,)29 b(if)d(the)h(input)f(v)-5 b(alue)27 b(of)g(ro)m(wlen)g(is)f(0,)i(then)f(CFITSIO)e(will)i (calculate)i(the)e(default)f(ro)m(wlength)227 781 y(based)39 b(on)g(the)g(tb)s(col)h(and)e(tt)m(yp)s(e)h(v)-5 b(alues.)67 b(Under)39 b(normal)g(circumstances,)j(the)d(nro)m(ws)f(paramen)m(ter) 227 894 y(should)31 b(ha)m(v)m(e)i(a)f(v)-5 b(alue)32 b(of)f(0;)i(CFITSIO)d(will)i(automatically)j(up)s(date)30 b(the)i(n)m(um)m(b)s(er)e(of)i(ro)m(ws)g(as)g(data)g(is)227 1007 y(written)26 b(to)h(the)f(table.)40 b(When)25 b(inserting)h(a)h (binary)e(table)h(with)g(\014ts)p 2596 1007 28 4 v 32 w(insert)p 2851 1007 V 33 w(btbl,)g(if)g(there)g(are)g(follo)m(wing)227 1120 y(extensions)f(in)f(the)h(\014le)f(and)g(if)g(the)h(table)g(con)m (tains)g(v)-5 b(ariable)25 b(length)g(arra)m(y)g(columns)f(then)g(p)s (coun)m(t)g(m)m(ust)227 1233 y(sp)s(ecify)30 b(the)h(exp)s(ected)g (\014nal)f(size)h(of)f(the)h(data)g(heap,)f(otherwise)h(p)s(coun)m(t)f (m)m(ust)h(=)f(0.)95 1490 y Fe(int)47 b(fits_insert_atbl)d(/)j(ffitab) 286 1603 y(\(fitsfile)f(*fptr,)g(LONGLONG)f(rowlen,)h(LONGLONG)g (nrows,)g(int)h(tfields,)e(char)i(*ttype[],)334 1716 y(long)g(*tbcol,)f(char)g(*tform[],)f(char)i(*tunit[],)e(char)i (*extname,)e(>)j(int)f(*status\))95 1942 y(int)g(fits_insert_btbl)d(/)j (ffibin)286 2055 y(\(fitsfile)f(*fptr,)g(LONGLONG)f(nrows,)h(int)h (tfields,)f(char)g(**ttype,)286 2168 y(char)h(**tform,)f(char)g (**tunit,)g(char)g(*extname,)g(long)g(pcount,)g(>)i(int)e(*status\))0 2425 y Fi(5)81 b Fj(Mo)s(dify)27 b(the)h(size,)h(dimensions,)f(and/or)f (data)i(t)m(yp)s(e)f(of)f(the)h(curren)m(t)g(primary)e(arra)m(y)i(or)g (image)h(extension.)227 2538 y(If)39 b(the)h(new)e(image,)44 b(as)39 b(sp)s(eci\014ed)g(b)m(y)g(the)g(input)g(argumen)m(ts,)j(is)d (larger)h(than)f(the)h(curren)m(t)f(existing)227 2651 y(image)30 b(in)e(the)g(FITS)g(\014le)g(then)g(zero)h(\014ll)f(data)h (will)g(b)s(e)f(inserted)g(at)h(the)f(end)g(of)g(the)h(curren)m(t)f (image)i(and)227 2764 y(an)m(y)35 b(follo)m(wing)h(extensions)f(will)g (b)s(e)f(mo)m(v)m(ed)i(further)d(bac)m(k)i(in)g(the)f(\014le.)54 b(Similarly)-8 b(,)36 b(if)f(the)g(new)f(image)227 2877 y(is)j(smaller)g(than)g(the)f(curren)m(t)h(image)h(then)e(an)m(y)h (follo)m(wing)h(extensions)f(will)g(b)s(e)f(shifted)h(up)e(to)m(w)m (ards)227 2990 y(the)h(b)s(eginning)f(of)h(the)g(FITS)f(\014le)h(and)f (the)h(image)h(data)f(will)h(b)s(e)e(truncated)g(to)i(the)f(new)f (size.)58 b(This)227 3103 y(routine)27 b(rewrites)g(the)h(BITPIX,)f (NAXIS,)g(and)f(NAXISn)g(k)m(eyw)m(ords)i(with)f(the)g(appropriate)g(v) -5 b(alues)27 b(for)227 3216 y(the)k(new)f(image.)95 3473 y Fe(int)47 b(fits_resize_img)d(/)j(ffrsim)286 3586 y(\(fitsfile)f(*fptr,)g(int)h(bitpix,)e(int)i(naxis,)f(long)h(*naxes,)f (>)h(int)g(*status\))95 3812 y(int)g(fits_resize_imgll)c(/)48 b(ffrsimll)286 3925 y(\(fitsfile)e(*fptr,)g(int)h(bitpix,)e(int)i (naxis,)f(LONGLONG)g(*naxes,)g(>)h(int)g(*status\))0 4183 y Fi(6)81 b Fj(Cop)m(y)43 b(the)h(data)h(\(and)e(not)h(the)g (header\))g(from)f(the)h(CHDU)g(asso)s(ciated)h(with)f(infptr)e(to)j (the)f(CHDU)227 4295 y(asso)s(ciated)34 b(with)e(outfptr.)47 b(This)32 b(will)g(o)m(v)m(erwrite)i(an)m(y)f(data)g(previously)g(in)f (the)h(output)f(CHDU.)h(This)227 4408 y(lo)m(w)39 b(lev)m(el)h(routine) e(is)g(used)f(b)m(y)h(\014ts)p 1510 4408 V 33 w(cop)m(y)p 1724 4408 V 33 w(hdu,)h(but)e(it)i(ma)m(y)f(also)h(b)s(e)f(useful)f(in) h(certain)h(application)227 4521 y(programs)30 b(that)h(w)m(an)m(t)g (to)g(cop)m(y)g(the)f(data)h(from)f(one)h(FITS)e(\014le)i(to)g(another) f(but)f(also)j(w)m(an)m(t)f(to)g(mo)s(dify)227 4634 y(the)h(header)g(k) m(eyw)m(ords.)46 b(The)32 b(required)f(FITS)g(header)h(k)m(eyw)m(ords)g (whic)m(h)g(de\014ne)f(the)h(structure)g(of)g(the)227 4747 y(HDU)f(m)m(ust)g(b)s(e)e(written)i(to)g(the)f(output)g(CHDU)h(b)s (efore)f(calling)i(this)e(routine.)95 5005 y Fe(int)47 b(fits_copy_data)d(/)k(ffcpdt)286 5118 y(\(fitsfile)e(*infptr,)f (fitsfile)h(*outfptr,)f(>)i(int)g(*status\))0 5375 y Fi(7)81 b Fj(Read)30 b(or)g(write)g(a)h(sp)s(eci\014ed)e(n)m(um)m(b)s (er)g(of)i(b)m(ytes)f(starting)h(at)g(the)g(sp)s(eci\014ed)e(b)m(yte)i (o\013set)g(from)f(the)g(start)h(of)227 5488 y(the)c(extension)g(data)f (unit.)39 b(These)26 b(lo)m(w)h(lev)m(el)h(routine)e(are)h(in)m(tended) f(mainly)g(for)g(accessing)i(the)e(data)h(in)227 5601 y(non-standard,)h(conforming)g(extensions,)h(and)e(should)g(not)h(b)s (e)g(used)f(for)g(standard)g(IMA)m(GE,)i(T)-8 b(ABLE,)227 5714 y(or)31 b(BINT)-8 b(ABLE)31 b(extensions.)p eop end %%Page: 102 110 TeXDict begin 102 109 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.102) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(102)958 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)95 555 y Fe(int)47 b(fits_read_ext)e(/)i (ffgextn)286 668 y(\(fitsfile)f(*fptr,)g(LONGLONG)f(offset,)h(LONGLONG) g(nbytes,)f(void)i(*buffer\))95 781 y(int)g(fits_write_ext)d(/)k (ffpextn)286 894 y(\(fitsfile)e(*fptr,)g(LONGLONG)f(offset,)h(LONGLONG) g(nbytes,)f(void)i(*buffer\))0 1158 y Fi(8)81 b Fj(This)34 b(routine)g(forces)h(CFITSIO)f(to)h(rescan)g(the)g(curren)m(t)g(header) f(k)m(eyw)m(ords)h(that)g(de\014ne)f(the)h(structure)227 1271 y(of)f(the)f(HDU)h(\(suc)m(h)g(as)f(the)h(NAXIS)f(and)g(BITPIX)g (k)m(eyw)m(ords\))h(so)f(that)h(it)g(reinitializes)i(the)d(in)m(ternal) 227 1384 y(bu\013ers)26 b(that)h(describ)s(e)g(the)g(HDU)g(structure.) 39 b(This)26 b(routine)h(is)g(useful)f(for)g(reinitializing)j(the)e (structure)227 1497 y(of)34 b(an)f(HDU)h(if)f(an)m(y)h(of)g(the)f (required)g(k)m(eyw)m(ords)g(\(e.g.,)j(NAXISn\))d(ha)m(v)m(e)i(b)s(een) e(mo)s(di\014ed.)48 b(In)33 b(practice)227 1610 y(it)e(should)e(rarely) h(b)s(e)f(necessary)h(to)h(call)g(this)f(routine)g(b)s(ecause)f (CFITSIO)g(in)m(ternally)i(calls)g(it)f(in)g(most)227 1723 y(situations.)95 1987 y Fe(int)47 b(fits_set_hdustruc)c(/)48 b(ffrdef)286 2100 y(\(fitsfile)e(*fptr,)g(>)h(int)g(*status\))141 b(\(DEPRECATED\))0 2262 y SDict begin H.S end 0 2262 a 0 2262 a SDict begin 13.6 H.A end 0 2262 a 0 2262 a SDict begin [/View [/XYZ H.V]/Dest (section.9.3) cvn /DEST pdfmark end 0 2262 a 177 x Ff(9.3)135 b(Sp)t(ecialized)46 b(Header)g(Keyw)l(ord)f(Routines)0 2553 y SDict begin H.S end 0 2553 a 0 2553 a SDict begin 13.6 H.A end 0 2553 a 0 2553 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.3.1) cvn /DEST pdfmark end 0 2553 a 140 x Fd(9.3.1)112 b(Header)38 b(Information)h(Routines)0 2906 y Fi(1)81 b Fj(Reserv)m(e)29 b(space)g(in)e(the)i(CHU)f(for)g(MOREKEYS)f(more)h (header)g(k)m(eyw)m(ords.)41 b(This)27 b(routine)h(ma)m(y)h(b)s(e)f (called)227 3018 y(to)34 b(allo)s(cate)h(space)e(for)f(additional)i(k)m (eyw)m(ords)f(at)g(the)g(time)g(the)g(header)f(is)h(created)g(\(prior)g (to)g(writing)227 3131 y(an)m(y)h(data\).)51 b(CFITSIO)32 b(can)i(dynamically)g(add)f(more)g(space)h(to)g(the)g(header)f(when)f (needed,)j(ho)m(w)m(ev)m(er)227 3244 y(it)c(is)g(more)f(e\016cien)m(t)i (to)f(preallo)s(cate)h(the)f(required)f(space)h(if)f(the)g(size)i(is)e (kno)m(wn)g(in)g(adv)-5 b(ance.)95 3509 y Fe(int)47 b(fits_set_hdrsize) d(/)j(ffhdef)286 3621 y(\(fitsfile)f(*fptr,)g(int)h(morekeys,)e(>)i (int)g(*status\))0 3886 y Fi(2)81 b Fj(Return)26 b(the)h(n)m(um)m(b)s (er)e(of)j(k)m(eyw)m(ords)f(in)f(the)h(header)g(\(not)h(coun)m(ting)g (the)f(END)g(k)m(eyw)m(ord\))h(and)e(the)h(curren)m(t)227 3999 y(p)s(osition)34 b(in)g(the)g(header.)50 b(The)34 b(p)s(osition)f(is)h(the)g(n)m(um)m(b)s(er)f(of)h(the)g(k)m(eyw)m(ord)g (record)f(that)i(will)f(b)s(e)f(read)227 4112 y(next)k(\(or)g(one)f (greater)i(than)e(the)h(p)s(osition)f(of)h(the)g(last)g(k)m(eyw)m(ord)g (that)g(w)m(as)g(read\).)59 b(A)37 b(v)-5 b(alue)36 b(of)h(1)g(is)227 4224 y(returned)29 b(if)i(the)f(p)s(oin)m(ter)h(is)f(p)s(ositioned)h (at)g(the)f(b)s(eginning)g(of)g(the)h(header.)95 4489 y Fe(int)47 b(fits_get_hdrpos)d(/)j(ffghps)286 4602 y(\(fitsfile)f (*fptr,)g(>)h(int)g(*keysexist,)e(int)i(*keynum,)e(int)i(*status\))0 4754 y SDict begin H.S end 0 4754 a 0 4754 a SDict begin 13.6 H.A end 0 4754 a 0 4754 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.3.2) cvn /DEST pdfmark end 0 4754 a 143 x Fd(9.3.2)112 b(Read)38 b(and)h(W)-9 b(rite)36 b(the)h(Required)h (Keyw)m(ords)0 5110 y Fi(1)81 b Fj(W)-8 b(rite)34 b(the)f(required)g (extension)h(header)e(k)m(eyw)m(ords)i(in)m(to)g(the)f(CHU.)h(These)f (routines)g(are)g(not)g(required,)227 5223 y(and)g(instead)g(the)g (appropriate)g(header)g(ma)m(y)g(b)s(e)g(constructed)g(b)m(y)g(writing) g(eac)m(h)h(individual)e(k)m(eyw)m(ord)227 5336 y(in)e(the)h(prop)s(er) e(sequence.)227 5488 y(The)21 b(simpler)g(\014ts)p 842 5488 28 4 v 33 w(write)p 1077 5488 V 33 w(imghdr)f(routine)i(is)f (equiv)-5 b(alen)m(t)23 b(to)f(calling)h(\014ts)p 2727 5488 V 32 w(write)p 2961 5488 V 33 w(grphdr)d(with)h(the)h(default)227 5601 y(v)-5 b(alues)37 b(of)f(simple)g(=)g(TR)m(UE,)g(p)s(coun)m(t)g(=) g(0,)i(gcoun)m(t)f(=)f(1,)i(and)e(extend)g(=)f(TR)m(UE.)i(The)e (PCOUNT,)227 5714 y(GCOUNT)43 b(and)g(EXTEND)g(k)m(eyw)m(ords)g(are)h (not)f(required)f(in)h(the)h(primary)e(header)h(and)f(are)i(only)p eop end %%Page: 103 111 TeXDict begin 103 110 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.103) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.3.)72 b(SPECIALIZED)29 b(HEADER)i(KEYW)m(ORD)g(R)m(OUTINES)1465 b Fj(103)227 555 y(written)38 b(if)f(p)s(coun)m(t)g(is)g(not)h(equal)f (to)i(zero,)h(gcoun)m(t)e(is)f(not)h(equal)g(to)g(zero)g(or)f(one,)j (and)c(if)i(extend)f(is)227 668 y(TR)m(UE,)k(resp)s(ectiv)m(ely)-8 b(.)74 b(When)41 b(writing)g(to)h(an)e(IMA)m(GE)i(extension,)i(the)e (SIMPLE)e(and)g(EXTEND)227 781 y(parameters)c(are)f(ignored.)56 b(It)35 b(is)g(recommended)g(that)h(\014ts)p 2342 781 28 4 v 32 w(create)p 2610 781 V 35 w(image)g(or)f(\014ts)p 3150 781 V 33 w(create)p 3419 781 V 34 w(tbl)g(b)s(e)g(used)227 894 y(instead)26 b(of)f(these)h(routines)g(to)g(write)f(the)h(required) e(header)i(k)m(eyw)m(ords.)39 b(The)25 b(general)h(\014ts)p 3377 894 V 33 w(write)p 3612 894 V 33 w(exthdr)227 1007 y(routine)31 b(ma)m(y)g(b)s(e)e(used)h(to)h(write)g(the)f(header)g(of)h (an)m(y)g(conforming)f(FITS)g(extension.)95 1252 y Fe(int)47 b(fits_write_imghdr)c(/)48 b(ffphps)286 1365 y(\(fitsfile)e(*fptr,)g (int)h(bitpix,)e(int)i(naxis,)f(long)h(*naxes,)f(>)h(int)g(*status\))95 1591 y(int)g(fits_write_imghdrll)c(/)k(ffphpsll)286 1704 y(\(fitsfile)f(*fptr,)g(int)h(bitpix,)e(int)i(naxis,)f(LONGLONG)g (*naxes,)g(>)h(int)g(*status\))95 1930 y(int)g(fits_write_grphdr)c(/)48 b(ffphpr)286 2042 y(\(fitsfile)e(*fptr,)g(int)h(simple,)e(int)i (bitpix,)f(int)h(naxis,)f(long)h(*naxes,)334 2155 y(LONGLONG)f(pcount,) f(LONGLONG)h(gcount,)g(int)h(extend,)f(>)h(int)g(*status\))95 2381 y(int)g(fits_write_grphdrll)c(/)k(ffphprll)286 2494 y(\(fitsfile)f(*fptr,)g(int)h(simple,)e(int)i(bitpix,)f(int)h(naxis,)f (LONGLONG)g(*naxes,)334 2607 y(LONGLONG)g(pcount,)f(LONGLONG)h(gcount,) g(int)h(extend,)f(>)h(int)g(*status\))95 2833 y(int)g (fits_write_exthdr)c(/ffphext)286 2946 y(\(fitsfile)j(*fptr,)g(char)g (*xtension,)f(int)i(bitpix,)f(int)h(naxis,)f(long)h(*naxes,)334 3059 y(LONGLONG)f(pcount,)f(LONGLONG)h(gcount,)g(>)h(int)g(*status\))0 3417 y Fi(2)81 b Fj(W)-8 b(rite)30 b(the)g(ASCI)s(I)d(table)k(header)e (k)m(eyw)m(ords)g(in)m(to)i(the)e(CHU.)h(The)e(optional)j(TUNITn)d(and) h(EXTNAME)227 3530 y(k)m(eyw)m(ords)f(are)h(written)e(only)h(if)g(the)g (input)f(p)s(oin)m(ters)h(are)g(not)g(n)m(ull.)40 b(A)27 b(n)m(ull)h(p)s(oin)m(ter)g(ma)m(y)g(giv)m(en)h(for)f(the)227 3643 y(*tb)s(col)37 b(parameter)g(in)f(whic)m(h)g(case)i(a)e(single)h (space)g(will)g(b)s(e)f(inserted)g(b)s(et)m(w)m(een)h(eac)m(h)g(column) f(of)h(the)227 3756 y(table.)57 b(Similarly)-8 b(,)37 b(if)f(ro)m(wlen)f(is)h(giv)m(en)g(=)f(0,)i(then)e(CFITSIO)f(will)i (calculate)h(the)f(default)f(ro)m(wlength)227 3868 y(based)30 b(on)h(the)f(tb)s(col)h(and)f(tt)m(yp)s(e)h(v)-5 b(alues.)95 4114 y Fe(int)47 b(fits_write_atblhdr)c(/)48 b(ffphtb)286 4227 y(\(fitsfile)e(*fptr,)g(LONGLONG)f(rowlen,)h(LONGLONG)g(nrows,)g (int)h(tfields,)e(char)i(**ttype,)334 4340 y(long)g(*tbcol,)f(char)g (**tform,)g(char)g(**tunit,)g(char)h(*extname,)e(>)i(int)g(*status\))0 4585 y Fi(3)81 b Fj(W)-8 b(rite)30 b(the)f(binary)g(table)h(header)e(k) m(eyw)m(ords)i(in)m(to)g(the)f(CHU.)g(The)g(optional)h(TUNITn)e(and)h (EXTNAME)227 4698 y(k)m(eyw)m(ords)35 b(are)g(written)g(only)g(if)f (the)h(input)f(p)s(oin)m(ters)g(are)h(not)g(n)m(ull.)53 b(The)35 b(p)s(coun)m(t)f(parameter,)i(whic)m(h)227 4811 y(sp)s(eci\014es)h(the)g(size)g(of)g(the)g(v)-5 b(ariable)38 b(length)f(arra)m(y)g(heap,)h(should)e(initially)i(=)f(0;)j(CFITSIO)c (will)h(au-)227 4924 y(tomatically)d(up)s(date)d(the)g(PCOUNT)f(k)m (eyw)m(ord)i(v)-5 b(alue)32 b(if)f(an)m(y)g(v)-5 b(ariable)32 b(length)g(arra)m(y)g(data)g(is)f(written)227 5036 y(to)g(the)e(heap.) 41 b(The)29 b(TF)m(ORM)g(k)m(eyw)m(ord)h(v)-5 b(alue)30 b(for)g(v)-5 b(ariable)30 b(length)g(v)m(ector)h(columns)e(should)g(ha) m(v)m(e)i(the)227 5149 y(form)c('Pt\(len\)')j(or)d('1Pt\(len\)')j (where)d(`t')h(is)g(the)g(data)g(t)m(yp)s(e)g(co)s(de)f(letter)i (\(A,I,J,E,D,)g(etc.\))42 b(and)27 b(`len')h(is)227 5262 y(an)g(in)m(teger)i(sp)s(ecifying)e(the)g(maxim)m(um)g(length)g(of)h (the)f(v)m(ectors)h(in)f(that)h(column)f(\(len)g(m)m(ust)g(b)s(e)g (greater)227 5375 y(than)36 b(or)g(equal)h(to)g(the)f(longest)i(v)m (ector)f(in)f(the)h(column\).)58 b(If)36 b(`len')g(is)h(not)f(sp)s (eci\014ed)g(when)f(the)h(table)227 5488 y(is)c(created)g(\(e.g.,)h (the)f(input)e(TF)m(ORMn)h(v)-5 b(alue)32 b(is)f(just)g('1Pt'\))i(then) e(CFITSIO)f(will)h(scan)h(the)f(column)227 5601 y(when)f(the)h(table)h (is)f(\014rst)f(closed)h(and)g(will)g(app)s(end)e(the)i(maxim)m(um)g (length)g(to)g(the)g(TF)m(ORM)g(k)m(eyw)m(ord)227 5714 y(v)-5 b(alue.)41 b(Note)30 b(that)f(if)f(the)h(table)g(is)g(subsequen) m(tly)f(mo)s(di\014ed)f(to)j(increase)f(the)g(maxim)m(um)f(length)h(of) g(the)p eop end %%Page: 104 112 TeXDict begin 104 111 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.104) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(104)958 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)227 555 y Fj(v)m(ectors)39 b(then)e(the)g(mo)s(difying)g(program)g(is)g(resp)s(onsible)g(for)g (also)h(up)s(dating)e(the)i(TF)m(ORM)f(k)m(eyw)m(ord)227 668 y(v)-5 b(alue.)95 935 y Fe(int)47 b(fits_write_btblhdr)c(/)48 b(ffphbn)286 1048 y(\(fitsfile)e(*fptr,)g(LONGLONG)f(nrows,)h(int)h (tfields,)f(char)g(**ttype,)334 1161 y(char)h(**tform,)e(char)i (**tunit,)e(char)i(*extname,)e(LONGLONG)h(pcount,)g(>)h(int)g (*status\))0 1427 y Fi(4)81 b Fj(Read)30 b(the)h(required)e(k)m(eyw)m (ords)i(from)f(the)h(CHDU)f(\(image)j(or)d(table\).)42 b(When)30 b(reading)h(from)f(an)g(IMA)m(GE)227 1540 y(extension)24 b(the)g(SIMPLE)e(and)h(EXTEND)g(parameters)h(are)f(ignored.)39 b(A)23 b(n)m(ull)g(p)s(oin)m(ter)h(ma)m(y)g(b)s(e)e(supplied)227 1653 y(for)30 b(an)m(y)h(of)g(the)f(returned)f(parameters)i(that)g(are) g(not)f(needed.)95 1920 y Fe(int)47 b(fits_read_imghdr)d(/)j(ffghpr)286 2033 y(\(fitsfile)f(*fptr,)g(int)h(maxdim,)e(>)j(int)f(*simple,)e(int)i (*bitpix,)f(int)h(*naxis,)334 2146 y(long)g(*naxes,)f(long)g(*pcount,)g (long)g(*gcount,)g(int)h(*extend,)e(int)i(*status\))95 2372 y(int)g(fits_read_imghdrll)c(/)48 b(ffghprll)286 2485 y(\(fitsfile)e(*fptr,)g(int)h(maxdim,)e(>)j(int)f(*simple,)e(int)i (*bitpix,)f(int)h(*naxis,)334 2598 y(LONGLONG)f(*naxes,)f(long)i (*pcount,)f(long)g(*gcount,)g(int)h(*extend,)e(int)i(*status\))95 2823 y(int)g(fits_read_atblhdr)c(/)48 b(ffghtb)286 2936 y(\(fitsfile)e(*fptr,int)f(maxdim,)h(>)h(long)g(*rowlen,)e(long)i (*nrows,)334 3049 y(int)g(*tfields,)e(char)i(**ttype,)e(LONGLONG)h (*tbcol,)g(char)g(**tform,)g(char)h(**tunit,)334 3162 y(char)g(*extname,)93 b(int)47 b(*status\))95 3388 y(int)g (fits_read_atblhdrll)c(/)k(ffghtbll)286 3501 y(\(fitsfile)f(*fptr,int)f (maxdim,)h(>)h(LONGLONG)f(*rowlen,)f(LONGLONG)h(*nrows,)334 3614 y(int)h(*tfields,)e(char)i(**ttype,)e(long)i(*tbcol,)f(char)h (**tform,)e(char)i(**tunit,)334 3727 y(char)g(*extname,)93 b(int)47 b(*status\))95 3952 y(int)g(fits_read_btblhdr)c(/)48 b(ffghbn)286 4065 y(\(fitsfile)e(*fptr,)g(int)h(maxdim,)e(>)j(long)f (*nrows,)e(int)i(*tfields,)334 4178 y(char)g(**ttype,)e(char)i (**tform,)e(char)i(**tunit,)f(char)g(*extname,)334 4291 y(long)h(*pcount,)e(int)i(*status\))95 4517 y(int)g (fits_read_btblhdrll)c(/)k(ffghbnll)286 4630 y(\(fitsfile)f(*fptr,)g (int)h(maxdim,)e(>)j(LONGLONG)d(*nrows,)h(int)h(*tfields,)334 4743 y(char)g(**ttype,)e(char)i(**tform,)e(char)i(**tunit,)f(char)g (*extname,)334 4856 y(long)h(*pcount,)e(int)i(*status\))0 5011 y SDict begin H.S end 0 5011 a 0 5011 a SDict begin 13.6 H.A end 0 5011 a 0 5011 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.3.3) cvn /DEST pdfmark end 0 5011 a 144 x Fd(9.3.3)112 b(W)-9 b(rite)37 b(Keyw)m(ord)g(Routines)0 5375 y Fj(These)32 b(routines)h(simply)f(app)s(end)f(a)h(new)g(k)m(eyw) m(ord)h(to)h(the)e(header)h(and)f(do)g(not)h(c)m(hec)m(k)h(to)f(see)g (if)g(a)f(k)m(eyw)m(ord)0 5488 y(with)d(the)g(same)h(name)f(already)h (exists.)41 b(In)28 b(general)i(it)g(is)f(preferable)g(to)h(use)f(the)h (\014ts)p 3009 5488 28 4 v 32 w(up)s(date)p 3317 5488 V 32 w(k)m(ey)g(routine)f(to)0 5601 y(ensure)34 b(that)h(the)g(same)g (k)m(eyw)m(ord)g(is)f(not)h(written)g(more)g(than)f(once)h(to)h(the)e (header.)54 b(See)34 b(App)s(endix)f(B)i(for)0 5714 y(the)c (de\014nition)f(of)g(the)h(parameters)f(used)g(in)g(these)h(routines.)p eop end %%Page: 105 113 TeXDict begin 105 112 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.105) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.3.)72 b(SPECIALIZED)29 b(HEADER)i(KEYW)m(ORD)g(R)m(OUTINES)1465 b Fj(105)0 555 y Fi(1)81 b Fj(W)-8 b(rite)30 b(\(app)s(end\))f(a)g(new) g(k)m(eyw)m(ord)h(of)g(the)f(appropriate)g(data)h(t)m(yp)s(e)g(in)m(to) g(the)g(CHU.)f(A)h(n)m(ull)f(p)s(oin)m(ter)g(ma)m(y)227 668 y(b)s(e)35 b(en)m(tered)h(for)f(the)h(commen)m(t)h(parameter,)g (whic)m(h)e(will)h(cause)g(the)g(commen)m(t)g(\014eld)f(of)h(the)f(k)m (eyw)m(ord)227 781 y(to)43 b(b)s(e)e(left)i(blank.)76 b(The)41 b(\015t,)k(dbl,)f(cmp,)h(and)d(dblcmp)f(v)m(ersions)h(of)g (this)g(routine)g(ha)m(v)m(e)h(the)g(added)227 894 y(feature)33 b(that)g(if)g(the)f('decimals')i(parameter)f(is)g(negativ)m(e,)i(then)d (the)h('G')g(displa)m(y)g(format)g(rather)f(then)227 1007 y(the)i('E')f(format)h(will)f(b)s(e)g(used)f(when)g(constructing)i (the)g(k)m(eyw)m(ord)f(v)-5 b(alue,)35 b(taking)f(the)g(absolute)f(v)-5 b(alue)227 1120 y(of)34 b('decimals')h(for)e(the)h(precision.)51 b(This)33 b(will)h(suppress)d(trailing)k(zeros,)g(and)e(will)h(use)g(a) g(\014xed)f(format)227 1233 y(rather)e(than)f(an)g(exp)s(onen)m(tial)h (format,)g(dep)s(ending)e(on)h(the)h(magnitude)f(of)h(the)g(v)-5 b(alue.)95 1478 y Fe(int)47 b(fits_write_key_str)c(/)48 b(ffpkys)286 1591 y(\(fitsfile)e(*fptr,)g(char)g(*keyname,)g(char)g (*value,)g(char)h(*comment,)334 1704 y(>)h(int)e(*status\))95 1930 y(int)h(fits_write_key_[log,)c(lng])j(/)95 b(ffpky[lj])286 2042 y(\(fitsfile)46 b(*fptr,)g(char)g(*keyname,)g(DTYPE)g(numval,)g (char)g(*comment,)334 2155 y(>)i(int)e(*status\))95 2381 y(int)h(fits_write_key_[flt,)c(dbl,)j(fixflg,)g(fixdbl])g(/)h (ffpky[edfg])286 2494 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(DTYPE) g(numval,)g(int)h(decimals,)286 2607 y(char)g(*comment,)e(>)j(int)f (*status\))95 2833 y(int)g(fits_write_key_[cmp,)c(dblcmp,)i(fixcmp,)h (fixdblcmp])f(/)j(ffpk[yc,ym,fc,fm])286 2946 y(\(fitsfile)e(*fptr,)g (char)g(*keyname,)g(DTYPE)g(*numval,)g(int)g(decimals,)286 3059 y(char)h(*comment,)e(>)j(int)f(*status\))0 3304 y Fi(2)81 b Fj(W)-8 b(rite)30 b(\(app)s(end\))e(a)i(string)f(v)-5 b(alued)29 b(k)m(eyw)m(ord)h(in)m(to)g(the)f(CHU)h(whic)m(h)e(ma)m(y)i (b)s(e)f(longer)h(than)e(68)i(c)m(haracters)227 3417 y(in)43 b(length.)80 b(This)42 b(uses)h(the)g(Long)h(String)e(Keyw)m (ord)h(con)m(v)m(en)m(tion)j(that)d(is)h(describ)s(ed)e(in)h(the`Lo)s (cal)227 3530 y(FITS)38 b(Con)m(v)m(en)m(tions')i(section)g(in)f (Chapter)f(4.)66 b(Since)38 b(this)h(uses)f(a)h(non-standard)f(FITS)g (con)m(v)m(en)m(tion)227 3643 y(to)45 b(enco)s(de)f(the)g(long)h(k)m (eyw)m(ord)f(string,)k(programs)43 b(whic)m(h)h(use)g(this)g(routine)g (should)f(also)h(call)i(the)227 3756 y(\014ts)p 354 3756 28 4 v 33 w(write)p 589 3756 V 33 w(k)m(ey)p 755 3756 V 33 w(longw)m(arn)26 b(routine)f(to)h(add)f(some)h(COMMENT)f(k)m(eyw)m (ords)g(to)h(w)m(arn)f(users)g(of)g(the)h(FITS)227 3868 y(\014le)43 b(that)h(this)e(con)m(v)m(en)m(tion)j(is)e(b)s(eing)f (used.)78 b(The)42 b(\014ts)p 2220 3868 V 32 w(write)p 2454 3868 V 33 w(k)m(ey)p 2620 3868 V 34 w(longw)m(arn)h(routine)g (also)h(writes)f(a)227 3981 y(k)m(eyw)m(ord)29 b(called)g(LONGSTRN)e (to)i(record)f(the)g(v)m(ersion)h(of)f(the)g(longstring)h(con)m(v)m(en) m(tion)h(that)f(has)f(b)s(een)227 4094 y(used,)35 b(in)f(case)i(a)f (new)e(con)m(v)m(en)m(tion)k(is)e(adopted)f(at)h(some)g(p)s(oin)m(t)f (in)h(the)f(future.)52 b(If)34 b(the)h(LONGSTRN)227 4207 y(k)m(eyw)m(ord)43 b(is)g(already)g(presen)m(t)g(in)g(the)f(header,)k (then)d(\014ts)p 2332 4207 V 32 w(write)p 2566 4207 V 33 w(k)m(ey)p 2732 4207 V 34 w(longw)m(arn)g(will)g(simply)f(return)227 4320 y(without)31 b(doing)f(an)m(ything.)95 4565 y Fe(int)47 b(fits_write_key_longstr)42 b(/)48 b(ffpkls)286 4678 y(\(fitsfile)e(*fptr,)g(char)g(*keyname,)g(char)g(*longstr,)g(char)g (*comment,)334 4791 y(>)i(int)e(*status\))95 5017 y(int)h (fits_write_key_longwarn)42 b(/)47 b(ffplsw)286 5130 y(\(fitsfile)f(*fptr,)g(>)h(int)g(*status\))0 5375 y Fi(3)81 b Fj(W)-8 b(rite)38 b(\(app)s(end\))d(a)i(n)m(um)m(b)s(ered)e (sequence)i(of)g(k)m(eyw)m(ords)g(in)m(to)g(the)g(CHU.)g(The)f (starting)h(index)f(n)m(um)m(b)s(er)227 5488 y(\(nstart\))30 b(m)m(ust)e(b)s(e)g(greater)i(than)f(0.)40 b(One)28 b(ma)m(y)i(app)s (end)d(the)h(same)i(commen)m(t)f(to)h(ev)m(ery)f(k)m(eyw)m(ord)g(\(and) 227 5601 y(eliminate)35 b(the)f(need)f(to)h(ha)m(v)m(e)g(an)f(arra)m(y) h(of)f(iden)m(tical)j(commen)m(t)e(strings,)g(one)f(for)h(eac)m(h)g(k)m (eyw)m(ord\))g(b)m(y)227 5714 y(including)24 b(the)h(amp)s(ersand)e(c)m (haracter)j(as)e(the)h(last)g(non-blank)f(c)m(haracter)i(in)e(the)g (\(\014rst\))h(COMMENTS)p eop end %%Page: 106 114 TeXDict begin 106 113 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.106) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(106)958 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)227 555 y Fj(string)23 b(parameter.)38 b(This)22 b(same)h(string)f(will)h(then)f(b)s(e)g(used)f(for)h(the)h (commen)m(t)g(\014eld)f(in)g(all)i(the)e(k)m(eyw)m(ords.)227 668 y(One)32 b(ma)m(y)h(also)g(en)m(ter)f(a)h(n)m(ull)f(p)s(oin)m(ter)g (for)g(the)g(commen)m(t)h(parameter)g(to)f(lea)m(v)m(e)j(the)d(commen)m (t)h(\014eld)f(of)227 781 y(the)f(k)m(eyw)m(ord)g(blank.)95 995 y Fe(int)47 b(fits_write_keys_str)c(/)k(ffpkns)286 1107 y(\(fitsfile)f(*fptr,)g(char)g(*keyroot,)g(int)h(nstart,)e(int)i (nkeys,)334 1220 y(char)g(**value,)e(char)i(**comment,)e(>)i(int)g (*status\))95 1446 y(int)g(fits_write_keys_[log,)42 b(lng])47 b(/)g(ffpkn[lj])286 1559 y(\(fitsfile)f(*fptr,)g(char)g(*keyroot,)g (int)h(nstart,)e(int)i(nkeys,)334 1672 y(DTYPE)f(*numval,)g(char)h (**comment,)e(int)i(*status\))95 1898 y(int)g(fits_write_keys_[flt,)42 b(dbl,)47 b(fixflg,)f(fixdbl])g(/)h(ffpkne[edfg])286 2011 y(\(fitsfile)f(*fptr,)g(char)g(*keyroot,)g(int)h(nstart,)e(int)i (nkey,)334 2124 y(DTYPE)f(*numval,)g(int)h(decimals,)e(char)i (**comment,)e(>)i(int)g(*status\))0 2337 y Fi(4)81 b Fj(Cop)m(y)21 b(an)h(indexed)f(k)m(eyw)m(ord)i(from)e(one)h(HDU)h(to)f (another,)i(mo)s(difying)e(the)g(index)f(n)m(um)m(b)s(er)f(of)i(the)g (k)m(eyw)m(ord)227 2450 y(name)37 b(in)f(the)g(pro)s(cess.)58 b(F)-8 b(or)37 b(example,)i(this)d(routine)h(could)f(read)g(the)h (TLMIN3)f(k)m(eyw)m(ord)h(from)f(the)227 2563 y(input)30 b(HDU)h(\(b)m(y)g(giving)h(k)m(eyro)s(ot)f(=)g(`TLMIN')g(and)f(inn)m (um)f(=)h(3\))i(and)e(write)h(it)g(to)g(the)g(output)f(HDU)227 2676 y(with)36 b(the)g(k)m(eyw)m(ord)h(name)f(TLMIN4)g(\(b)m(y)g (setting)i(outn)m(um)d(=)h(4\).)58 b(If)36 b(the)g(input)f(k)m(eyw)m (ord)i(do)s(es)f(not)227 2789 y(exist,)c(then)e(this)g(routine)g (simply)g(returns)f(without)i(indicating)g(an)f(error.)95 3002 y Fe(int)47 b(fits_copy_key)e(/)i(ffcpky)286 3115 y(\(fitsfile)f(*infptr,)f(fitsfile)h(*outfptr,)f(int)i(innum,)f(int)h (outnum,)334 3228 y(char)g(*keyroot,)e(>)i(int)g(*status\))0 3442 y Fi(5)81 b Fj(W)-8 b(rite)30 b(\(app)s(end\))f(a)h(`triple)f (precision')h(k)m(eyw)m(ord)g(in)m(to)g(the)g(CHU)f(in)g(F28.16)j (format.)41 b(The)29 b(\015oating)h(p)s(oin)m(t)227 3555 y(k)m(eyw)m(ord)g(v)-5 b(alue)30 b(is)f(constructed)h(b)m(y)f (concatenating)j(the)d(input)g(in)m(teger)i(v)-5 b(alue)29 b(with)g(the)h(input)e(double)227 3668 y(precision)35 b(fraction)f(v)-5 b(alue)35 b(\(whic)m(h)f(m)m(ust)g(ha)m(v)m(e)i(a)e (v)-5 b(alue)35 b(b)s(et)m(w)m(een)f(0.0)i(and)d(1.0\).)53 b(The)34 b(\013gkyt)h(routine)227 3781 y(should)d(b)s(e)h(used)f(to)i (read)f(this)g(k)m(eyw)m(ord)h(v)-5 b(alue,)35 b(b)s(ecause)e(the)g (other)h(k)m(eyw)m(ord)f(reading)h(routines)f(will)227 3893 y(not)e(preserv)m(e)f(the)h(full)f(precision)h(of)f(the)h(v)-5 b(alue.)95 4107 y Fe(int)47 b(fits_write_key_triple)42 b(/)48 b(ffpkyt)286 4220 y(\(fitsfile)e(*fptr,)g(char)g(*keyname,)g (long)g(intval,)g(double)g(frac,)334 4333 y(char)h(*comment,)e(>)i(int) g(*status\))0 4546 y Fi(6)81 b Fj(W)-8 b(rite)37 b(k)m(eyw)m(ords)f(to) h(the)f(CHDU)g(that)h(are)f(de\014ned)f(in)h(an)g(ASCI)s(I)e(template)j (\014le.)58 b(The)35 b(format)i(of)f(the)227 4659 y(template)c(\014le)f (is)f(describ)s(ed)f(under)g(the)i(\014ts)p 1788 4659 28 4 v 32 w(parse)p 2028 4659 V 33 w(template)g(routine.)95 4873 y Fe(int)47 b(fits_write_key_template)42 b(/)47 b(ffpktp)286 4986 y(\(fitsfile)f(*fptr,)g(const)g(char)h(*filename,)e (>)i(int)g(*status\))0 5126 y SDict begin H.S end 0 5126 a 0 5126 a SDict begin 13.6 H.A end 0 5126 a 0 5126 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.3.4) cvn /DEST pdfmark end 0 5126 a 143 x Fd(9.3.4)112 b(Insert)38 b(Keyw)m(ord)f (Routines)0 5488 y Fj(These)42 b(insert)h(routines)f(are)h(somewhat)g (less)f(e\016cien)m(t)i(than)f(the)f(`up)s(date')g(or)h(`write')g(k)m (eyw)m(ord)g(routines)0 5601 y(b)s(ecause)30 b(the)g(follo)m(wing)i(k)m (eyw)m(ords)e(in)g(the)g(header)g(m)m(ust)g(b)s(e)f(shifted)h(do)m(wn)f (to)i(mak)m(e)g(ro)s(om)f(for)g(the)g(inserted)0 5714 y(k)m(eyw)m(ord.)41 b(See)31 b(App)s(endix)d(B)j(for)f(the)h (de\014nition)f(of)g(the)h(parameters)g(used)e(in)h(these)h(routines.)p eop end %%Page: 107 115 TeXDict begin 107 114 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.107) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.3.)72 b(SPECIALIZED)29 b(HEADER)i(KEYW)m(ORD)g(R)m(OUTINES)1465 b Fj(107)0 555 y Fi(1)81 b Fj(Insert)26 b(a)h(new)f(k)m(eyw)m(ord)h (record)g(in)m(to)g(the)g(CHU)g(at)g(the)g(sp)s(eci\014ed)f(p)s (osition)h(\(i.e.,)i(immediately)f(preceding)227 668 y(the)j(\(k)m(eyn)m(um\)th)g(k)m(eyw)m(ord)g(in)f(the)g(header.\))95 921 y Fe(int)47 b(fits_insert_record)c(/)48 b(ffirec)286 1034 y(\(fitsfile)e(*fptr,)g(int)h(keynum,)e(char)i(*card,)f(>)i(int)f (*status\))0 1286 y Fi(2)81 b Fj(Insert)24 b(a)h(new)g(k)m(eyw)m(ord)g (in)m(to)h(the)f(CHU.)g(The)g(new)f(k)m(eyw)m(ord)i(is)f(inserted)f (immediately)j(follo)m(wing)f(the)f(last)227 1399 y(k)m(eyw)m(ord)i (that)f(has)f(b)s(een)h(read)f(from)h(the)g(header.)39 b(The)25 b(`longstr')i(v)m(ersion)f(has)f(the)h(same)g(functionalit)m (y)227 1512 y(as)33 b(the)g(`str')f(v)m(ersion)h(except)h(that)f(it)g (also)g(supp)s(orts)e(the)h(lo)s(cal)i(long)f(string)g(k)m(eyw)m(ord)g (con)m(v)m(en)m(tion)h(for)227 1625 y(strings)29 b(longer)g(than)g(68)h (c)m(haracters.)41 b(A)29 b(n)m(ull)g(p)s(oin)m(ter)g(ma)m(y)g(b)s(e)g (en)m(tered)g(for)g(the)g(commen)m(t)g(parameter)227 1738 y(whic)m(h)d(will)f(cause)h(the)g(commen)m(t)h(\014eld)e(to)h(b)s (e)f(left)h(blank.)39 b(The)25 b(\015t,)h(dbl,)g(cmp,)h(and)e(dblcmp)f (v)m(ersions)i(of)227 1851 y(this)k(routine)g(ha)m(v)m(e)h(the)e(added) g(feature)i(that)f(if)g(the)g('decimals')h(parameter)f(is)g(negativ)m (e,)i(then)d(the)h('G')227 1964 y(displa)m(y)g(format)g(rather)f(then)g (the)h('E')f(format)h(will)g(b)s(e)f(used)f(when)h(constructing)h(the)f (k)m(eyw)m(ord)h(v)-5 b(alue,)227 2077 y(taking)27 b(the)g(absolute)g (v)-5 b(alue)26 b(of)h('decimals')g(for)f(the)h(precision.)39 b(This)26 b(will)g(suppress)e(trailing)k(zeros,)g(and)227 2189 y(will)37 b(use)g(a)g(\014xed)f(format)h(rather)g(than)f(an)h(exp) s(onen)m(tial)g(format,)i(dep)s(ending)c(on)i(the)g(magnitude)g(of)227 2302 y(the)31 b(v)-5 b(alue.)95 2555 y Fe(int)47 b(fits_insert_card)d (/)j(ffikey)286 2668 y(\(fitsfile)f(*fptr,)g(char)g(*card,)g(>)i(int)f (*status\))95 2894 y(int)g(fits_insert_key_[str,)42 b(longstr])k(/)h (ffi[kys,)f(kls])286 3007 y(\(fitsfile)g(*fptr,)g(char)g(*keyname,)g (char)g(*value,)g(char)h(*comment,)334 3120 y(>)h(int)e(*status\))95 3345 y(int)h(fits_insert_key_[log,)42 b(lng])47 b(/)g(ffiky[lj])286 3458 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(DTYPE)g(numval,)g(char) g(*comment,)334 3571 y(>)i(int)e(*status\))95 3797 y(int)h (fits_insert_key_[flt,)42 b(fixflt,)k(dbl,)h(fixdbl])f(/)h(ffiky[edfg]) 286 3910 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(DTYPE)g(numval,)g (int)h(decimals,)334 4023 y(char)g(*comment,)e(>)i(int)g(*status\))95 4249 y(int)g(fits_insert_key_[cmp,)42 b(dblcmp,)k(fixcmp,)g(fixdblcmp]) f(/)i(ffik[yc,ym,fc,fm])286 4362 y(\(fitsfile)f(*fptr,)g(char)g (*keyname,)g(DTYPE)g(*numval,)g(int)g(decimals,)334 4474 y(char)h(*comment,)e(>)i(int)g(*status\))0 4727 y Fi(3)81 b Fj(Insert)32 b(a)i(new)f(k)m(eyw)m(ord)h(with)f(an)h(unde\014ned,)e (or)h(n)m(ull,)h(v)-5 b(alue)34 b(in)m(to)h(the)e(CHU.)h(The)f(v)-5 b(alue)34 b(string)f(of)h(the)227 4840 y(k)m(eyw)m(ord)d(is)g(left)g (blank)f(in)g(this)g(case.)95 5093 y Fe(int)47 b(fits_insert_key_null)c (/)k(ffikyu)286 5205 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(char)g (*comment,)g(>)h(int)g(*status\))0 5352 y SDict begin H.S end 0 5352 a 0 5352 a SDict begin 13.6 H.A end 0 5352 a 0 5352 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.3.5) cvn /DEST pdfmark end 0 5352 a 143 x Fd(9.3.5)112 b(Read)38 b(Keyw)m(ord)g(Routines)0 5714 y Fj(Wild)31 b(card)f(c)m(haracters)i(ma)m(y)f(b)s(e)f(used)f(when)h(sp)s(ecifying)g (the)g(name)h(of)f(the)h(k)m(eyw)m(ord)g(to)g(b)s(e)f(read.)p eop end %%Page: 108 116 TeXDict begin 108 115 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.108) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(108)958 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 555 y Fi(1)81 b Fj(Read)43 b(a)h(k)m(eyw)m(ord)g(v)-5 b(alue)43 b(\(with)h(the)f(appropriate)h (data)g(t)m(yp)s(e\))g(and)e(commen)m(t)j(from)e(the)g(CHU.)h(If)f(a) 227 668 y(NULL)32 b(commen)m(t)h(p)s(oin)m(ter)f(is)h(giv)m(en)g(on)f (input,)f(then)h(the)g(commen)m(t)i(string)e(will)g(not)g(b)s(e)g (returned.)44 b(If)227 781 y(the)32 b(v)-5 b(alue)33 b(of)f(the)g(k)m(eyw)m(ord)g(is)g(not)h(de\014ned)d(\(i.e.,)k(the)e(v) -5 b(alue)33 b(\014eld)e(is)h(blank\))g(then)g(an)g(error)f(status)h(=) 227 894 y(V)-10 b(ALUE)p 545 894 28 4 v 33 w(UNDEFINED)29 b(will)f(b)s(e)g(returned)e(and)h(the)h(input)f(v)-5 b(alue)28 b(will)h(not)f(b)s(e)f(c)m(hanged)h(\(except)h(that)227 1007 y(\013gkys)i(will)g(reset)g(the)f(v)-5 b(alue)31 b(to)g(a)g(n)m(ull)f(string\).)95 1252 y Fe(int)47 b(fits_read_key_str) c(/)48 b(ffgkys)286 1365 y(\(fitsfile)e(*fptr,)g(char)g(*keyname,)g(>)h (char)g(*value,)f(char)g(*comment,)334 1478 y(int)h(*status\);)95 1704 y(NOTE:)g(after)f(calling)g(the)h(following)e(routine,)h(programs) f(must)i(explicitly)e(free)382 1817 y(the)i(memory)f(allocated)f(for)i ('longstr')e(after)i(it)g(is)g(no)g(longer)f(needed)g(by)382 1930 y(calling)g(fits_free_memory.)95 2155 y(int)h (fits_read_key_longstr)42 b(/)48 b(ffgkls)286 2268 y(\(fitsfile)e (*fptr,)g(char)g(*keyname,)g(>)h(char)g(**longstr,)e(char)h(*comment,) 620 2381 y(int)h(*status\))95 2607 y(int)g(fits_free_memory)d(/)j (fffree)286 2720 y(\(char)g(*longstr,)e(>)i(int)g(*status\);)95 2946 y(int)g(fits_read_key_[log,)c(lng,)k(flt,)f(dbl,)h(cmp,)f(dblcmp]) g(/)i(ffgky[ljedcm])286 3059 y(\(fitsfile)e(*fptr,)g(char)g(*keyname,)g (>)h(DTYPE)f(*numval,)g(char)h(*comment,)334 3172 y(int)g(*status\))95 3397 y(int)g(fits_read_key_lnglng)c(/)k(ffgkyjj)286 3510 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(>)h(LONGLONG)f(*numval,)f (char)i(*comment,)334 3623 y(int)g(*status\))0 3868 y Fi(2)81 b Fj(Read)36 b(a)h(sequence)f(of)h(indexed)e(k)m(eyw)m(ord)i(v) -5 b(alues)37 b(\(e.g.,)i(NAXIS1,)g(NAXIS2,)f(...\).)59 b(The)36 b(input)f(starting)227 3981 y(index)j(n)m(um)m(b)s(er)e (\(nstart\))j(m)m(ust)f(b)s(e)f(greater)i(than)e(0.)64 b(If)37 b(the)h(v)-5 b(alue)38 b(of)g(an)m(y)h(of)f(the)g(k)m(eyw)m (ords)g(is)g(not)227 4094 y(de\014ned)c(\(i.e.,)j(the)e(v)-5 b(alue)35 b(\014eld)f(is)h(blank\))g(then)f(an)g(error)h(status)g(=)f (V)-10 b(ALUE)p 3009 4094 V 33 w(UNDEFINED)36 b(will)f(b)s(e)227 4207 y(returned)21 b(and)h(the)h(input)e(v)-5 b(alue)23 b(for)f(the)g(unde\014ned)e(k)m(eyw)m(ord\(s\))k(will)e(not)h(b)s(e)e (c)m(hanged.)39 b(These)22 b(routines)227 4320 y(do)j(not)h(supp)s(ort) d(wild)i(card)h(c)m(haracters)g(in)f(the)h(ro)s(ot)f(name.)39 b(If)25 b(there)h(are)f(no)g(indexed)g(k)m(eyw)m(ords)h(in)f(the)227 4433 y(header)35 b(with)f(the)h(input)e(ro)s(ot)i(name)g(then)f(these)h (routines)g(do)f(not)h(return)e(a)i(non-zero)h(status)e(v)-5 b(alue)227 4546 y(and)30 b(instead)h(simply)f(return)f(nfound)f(=)i(0.) 95 4791 y Fe(int)47 b(fits_read_keys_str)c(/)48 b(ffgkns)286 4904 y(\(fitsfile)e(*fptr,)g(char)g(*keyname,)g(int)h(nstart,)e(int)i (nkeys,)334 5017 y(>)h(char)e(**value,)g(int)h(*nfound,)93 b(int)47 b(*status\))95 5243 y(int)g(fits_read_keys_[log,)c(lng,)j (flt,)h(dbl])g(/)g(ffgkn[ljed])286 5356 y(\(fitsfile)f(*fptr,)g(char)g (*keyname,)g(int)h(nstart,)e(int)i(nkeys,)334 5469 y(>)h(DTYPE)e (*numval,)f(int)i(*nfound,)f(int)h(*status\))0 5714 y Fi(3)81 b Fj(Read)37 b(the)h(v)-5 b(alue)38 b(of)g(a)g(\015oating)g(p)s (oin)m(t)g(k)m(eyw)m(ord,)i(returning)d(the)h(in)m(teger)h(and)e (fractional)i(parts)e(of)h(the)p eop end %%Page: 109 117 TeXDict begin 109 116 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.109) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.3.)72 b(SPECIALIZED)29 b(HEADER)i(KEYW)m(ORD)g(R)m(OUTINES)1465 b Fj(109)227 555 y(v)-5 b(alue)35 b(in)e(separate)i(routine)f(argumen)m (ts.)52 b(This)33 b(routine)h(ma)m(y)g(b)s(e)f(used)h(to)g(read)g(an)m (y)g(k)m(eyw)m(ord)h(but)e(is)227 668 y(esp)s(ecially)f(useful)d(for)i (reading)f(the)h('triple)g(precision')f(k)m(eyw)m(ords)h(written)g(b)m (y)f(\013pkyt.)95 929 y Fe(int)47 b(fits_read_key_triple)c(/)k(ffgkyt) 286 1042 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(>)h(long)g (*intval,)e(double)h(*frac,)334 1155 y(char)h(*comment,)e(int)i (*status\))0 1296 y SDict begin H.S end 0 1296 a 0 1296 a SDict begin 13.6 H.A end 0 1296 a 0 1296 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.3.6) cvn /DEST pdfmark end 0 1296 a 150 x Fd(9.3.6)112 b(Mo)s(dify)39 b(Keyw)m(ord)e(Routines)0 1666 y Fj(These)31 b(routines)h(mo)s(dify)f(the)h(v)-5 b(alue)32 b(of)g(an)g(existing)g(k)m(eyw)m(ord.)46 b(An)31 b(error)g(is)h(returned)e(if)i(the)g(k)m(eyw)m(ord)g(do)s(es)0 1778 y(not)43 b(exist.)77 b(Wild)43 b(card)g(c)m(haracters)h(ma)m(y)f (b)s(e)f(used)f(when)h(sp)s(ecifying)g(the)h(name)f(of)h(the)f(k)m(eyw) m(ord)h(to)h(b)s(e)0 1891 y(mo)s(di\014ed.)c(See)30 b(App)s(endix)f(B)i (for)f(the)g(de\014nition)g(of)h(the)f(parameters)h(used)f(in)g(these)h (routines.)0 2152 y Fi(1)81 b Fj(Mo)s(dify)30 b(\(o)m(v)m(erwrite\))i (the)f(n)m(th)f(80-c)m(haracter)j(header)d(record)h(in)f(the)g(CHU.)95 2413 y Fe(int)47 b(fits_modify_record)c(/)48 b(ffmrec)286 2526 y(\(fitsfile)e(*fptr,)g(int)h(keynum,)e(char)i(*card,)f(>)i(int)f (*status\))0 2786 y Fi(2)81 b Fj(Mo)s(dify)37 b(\(o)m(v)m(erwrite\))j (the)e(80-c)m(haracter)j(header)c(record)h(for)f(the)h(named)f(k)m(eyw) m(ord)h(in)g(the)g(CHU.)g(This)227 2899 y(can)31 b(b)s(e)f(used)f(to)i (o)m(v)m(erwrite)h(the)f(name)f(of)h(the)f(k)m(eyw)m(ord)h(as)g(w)m (ell)g(as)g(its)g(v)-5 b(alue)30 b(and)g(commen)m(t)i(\014elds.)95 3160 y Fe(int)47 b(fits_modify_card)d(/)j(ffmcrd)286 3273 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(char)g(*card,)g(>)i (int)f(*status\))0 3534 y Fi(5)81 b Fj(Mo)s(dify)30 b(the)g(v)-5 b(alue)31 b(and)e(commen)m(t)i(\014elds)f(of)g(an)g(existing)h(k)m(eyw) m(ord)g(in)f(the)g(CHU.)h(The)e(`longstr')i(v)m(ersion)227 3647 y(has)41 b(the)h(same)f(functionalit)m(y)i(as)e(the)h(`str')f(v)m (ersion)h(except)g(that)g(it)g(also)g(supp)s(orts)d(the)j(lo)s(cal)g (long)227 3760 y(string)29 b(k)m(eyw)m(ord)h(con)m(v)m(en)m(tion)h(for) e(strings)f(longer)i(than)f(68)h(c)m(haracters.)41 b(Optionally)-8 b(,)31 b(one)e(ma)m(y)h(mo)s(dify)227 3872 y(only)e(the)g(v)-5 b(alue)28 b(\014eld)g(and)f(lea)m(v)m(e)j(the)e(commen)m(t)h(\014eld)e (unc)m(hanged)h(b)m(y)g(setting)g(the)g(input)f(COMMENT)227 3985 y(parameter)c(equal)h(to)f(the)g(amp)s(ersand)e(c)m(haracter)j (\(&\))f(or)g(b)m(y)g(en)m(tering)g(a)g(n)m(ull)g(p)s(oin)m(ter)g(for)f (the)h(commen)m(t)227 4098 y(parameter.)40 b(The)24 b(\015t,)i(dbl,)g (cmp,)f(and)g(dblcmp)e(v)m(ersions)j(of)f(this)g(routine)g(ha)m(v)m(e)h (the)f(added)f(feature)h(that)227 4211 y(if)h(the)h('decimals')g (parameter)g(is)f(negativ)m(e,)k(then)c(the)g('G')h(displa)m(y)f (format)h(rather)f(then)g(the)g('E')h(format)227 4324 y(will)i(b)s(e)f(used)f(when)h(constructing)h(the)f(k)m(eyw)m(ord)h(v) -5 b(alue,)30 b(taking)f(the)g(absolute)g(v)-5 b(alue)29 b(of)f('decimals')i(for)227 4437 y(the)37 b(precision.)60 b(This)35 b(will)i(suppress)e(trailing)i(zeros,)i(and)d(will)h(use)g(a) g(\014xed)e(format)i(rather)g(than)f(an)227 4550 y(exp)s(onen)m(tial)c (format,)f(dep)s(ending)d(on)j(the)f(magnitude)h(of)f(the)h(v)-5 b(alue.)95 4811 y Fe(int)47 b(fits_modify_key_[str,)42 b(longstr])k(/)h(ffm[kys,)f(kls])286 4924 y(\(fitsfile)g(*fptr,)g(char) g(*keyname,)g(char)g(*value,)g(char)h(*comment,)334 5036 y(>)h(int)e(*status\);)95 5262 y(int)h(fits_modify_key_[log,)42 b(lng])47 b(/)g(ffmky[lj])286 5375 y(\(fitsfile)f(*fptr,)g(char)g (*keyname,)g(DTYPE)g(numval,)g(char)g(*comment,)334 5488 y(>)i(int)e(*status\))95 5714 y(int)h(fits_modify_key_[flt,)42 b(dbl,)47 b(fixflt,)f(fixdbl])g(/)h(ffmky[edfg])p eop end %%Page: 110 118 TeXDict begin 110 117 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.110) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(110)958 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)286 555 y Fe(\(fitsfile)46 b(*fptr,)g(char)g(*keyname,)g(DTYPE)g(numval,)g(int)h(decimals,)334 668 y(char)g(*comment,)e(>)i(int)g(*status\))95 894 y(int)g (fits_modify_key_[cmp,)42 b(dblcmp,)k(fixcmp,)g(fixdblcmp])f(/)i (ffmk[yc,ym,fc,fm])286 1007 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g (DTYPE)g(*numval,)g(int)g(decimals,)334 1120 y(char)h(*comment,)e(>)i (int)g(*status\))0 1431 y Fi(6)81 b Fj(Mo)s(dify)22 b(the)g(v)-5 b(alue)23 b(of)f(an)g(existing)i(k)m(eyw)m(ord)e(to)h(b)s(e)f (unde\014ned,)g(or)g(n)m(ull.)38 b(The)22 b(v)-5 b(alue)22 b(string)h(of)f(the)g(k)m(eyw)m(ord)227 1544 y(is)30 b(set)h(to)g(blank.)40 b(Optionally)-8 b(,)31 b(one)f(ma)m(y)h(lea)m(v) m(e)h(the)f(commen)m(t)g(\014eld)e(unc)m(hanged)h(b)m(y)g(setting)h (the)f(input)227 1657 y(COMMENT)f(parameter)g(equal)g(to)g(the)g(amp)s (ersand)e(c)m(haracter)k(\(&\))e(or)f(b)m(y)h(en)m(tering)g(a)g(n)m (ull)g(p)s(oin)m(ter.)95 1968 y Fe(int)47 b(fits_modify_key_null)c(/)k (ffmkyu)286 2081 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(char)g (*comment,)g(>)h(int)g(*status\))0 2290 y SDict begin H.S end 0 2290 a 0 2290 a SDict begin 13.6 H.A end 0 2290 a 0 2290 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.3.7) cvn /DEST pdfmark end 0 2290 a 143 x Fd(9.3.7)112 b(Up)s(date)39 b(Keyw)m(ord)e(Routines)0 2680 y Fi(1)81 b Fj(These)29 b(up)s(date)g(routines)h(mo)s(dify)f(the)g(v)-5 b(alue,)31 b(and)e(optionally)i(the)f(commen)m(t)h(\014eld,)f(of)g(the) g(k)m(eyw)m(ord)g(if)f(it)227 2793 y(already)34 b(exists,)g(otherwise)f (the)g(new)f(k)m(eyw)m(ord)h(is)f(app)s(ended)f(to)j(the)f(header.)47 b(A)33 b(separate)g(routine)g(is)227 2906 y(pro)m(vided)c(for)g(eac)m (h)h(k)m(eyw)m(ord)f(data)h(t)m(yp)s(e.)41 b(The)28 b(`longstr')i(v)m (ersion)g(has)e(the)i(same)f(functionalit)m(y)h(as)g(the)227 3019 y(`str')h(v)m(ersion)g(except)h(that)g(it)f(also)h(supp)s(orts)c (the)j(lo)s(cal)h(long)g(string)e(k)m(eyw)m(ord)i(con)m(v)m(en)m(tion)h (for)d(strings)227 3132 y(longer)i(than)f(68)h(c)m(haracters.)45 b(A)31 b(n)m(ull)g(p)s(oin)m(ter)h(ma)m(y)f(b)s(e)g(en)m(tered)h(for)f (the)g(commen)m(t)i(parameter)e(whic)m(h)227 3245 y(will)i(lea)m(v)m(e) h(the)f(commen)m(t)g(\014eld)f(unc)m(hanged)g(or)g(blank.)46 b(The)31 b(\015t,)i(dbl,)f(cmp,)h(and)e(dblcmp)g(v)m(ersions)i(of)227 3357 y(this)d(routine)g(ha)m(v)m(e)h(the)e(added)g(feature)i(that)f(if) g(the)g('decimals')h(parameter)f(is)g(negativ)m(e,)i(then)d(the)h('G') 227 3470 y(displa)m(y)g(format)g(rather)f(then)g(the)h('E')f(format)h (will)g(b)s(e)f(used)f(when)h(constructing)h(the)f(k)m(eyw)m(ord)h(v)-5 b(alue,)227 3583 y(taking)27 b(the)g(absolute)g(v)-5 b(alue)26 b(of)h('decimals')g(for)f(the)h(precision.)39 b(This)26 b(will)g(suppress)e(trailing)k(zeros,)g(and)227 3696 y(will)37 b(use)g(a)g(\014xed)f(format)h(rather)g(than)f(an)h(exp) s(onen)m(tial)g(format,)i(dep)s(ending)c(on)i(the)g(magnitude)g(of)227 3809 y(the)31 b(v)-5 b(alue.)95 4121 y Fe(int)47 b (fits_update_key_[str,)42 b(longstr])k(/)h(ffu[kys,)f(kls])286 4233 y(\(fitsfile)g(*fptr,)g(char)g(*keyname,)g(char)g(*value,)g(char)h (*comment,)334 4346 y(>)h(int)e(*status\))95 4572 y(int)h (fits_update_key_[log,)42 b(lng])47 b(/)g(ffuky[lj])286 4685 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(DTYPE)g(numval,)g(char) g(*comment,)334 4798 y(>)i(int)e(*status\))95 5024 y(int)h (fits_update_key_[flt,)42 b(dbl,)47 b(fixflt,)f(fixdbl])g(/)h (ffuky[edfg])286 5137 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(DTYPE) g(numval,)g(int)h(decimals,)334 5250 y(char)g(*comment,)e(>)i(int)g (*status\))95 5475 y(int)g(fits_update_key_[cmp,)42 b(dblcmp,)k (fixcmp,)g(fixdblcmp])f(/)i(ffuk[yc,ym,fc,fm])286 5588 y(\(fitsfile)f(*fptr,)g(char)g(*keyname,)g(DTYPE)g(*numval,)g(int)g (decimals,)334 5701 y(char)h(*comment,)e(>)i(int)g(*status\))p eop end %%Page: 111 119 TeXDict begin 111 118 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.111) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.4.)72 b(DEFINE)31 b(D)m(A)-8 b(T)g(A)32 b(SCALING)e(AND)h(UNDEFINED)h(PIXEL)d (P)-8 b(ARAMETERS)655 b Fj(111)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (section.9.4) cvn /DEST pdfmark end 0 464 a 91 x Ff(9.4)135 b(De\014ne)45 b(Data)h(Scaling)g(and)e(Unde\014ned)h(Pixel)h(P)l(arameters)0 805 y Fj(These)37 b(routines)g(set)h(or)f(mo)s(dify)g(the)g(in)m (ternal)h(parameters)g(used)e(b)m(y)i(CFITSIO)d(to)j(either)g(scale)h (the)e(data)0 918 y(or)f(to)h(represen)m(t)f(unde\014ned)d(pixels.)58 b(Generally)37 b(CFITSIO)d(will)j(scale)g(the)f(data)h(according)g(to)f (the)h(v)-5 b(alues)0 1031 y(of)35 b(the)f(BSCALE)g(and)g(BZER)m(O)h (\(or)g(TSCALn)d(and)i(TZER)m(On\))g(k)m(eyw)m(ords,)i(ho)m(w)m(ev)m (er)g(these)f(routines)f(ma)m(y)0 1144 y(b)s(e)e(used)h(to)h(o)m(v)m (erride)g(the)f(k)m(eyw)m(ord)h(v)-5 b(alues.)49 b(This)32 b(ma)m(y)i(b)s(e)f(useful)f(when)g(one)i(w)m(an)m(ts)f(to)h(read)f(or)g (write)h(the)0 1257 y(ra)m(w)e(unscaled)g(v)-5 b(alues)33 b(in)f(the)g(FITS)f(\014le.)47 b(Similarly)-8 b(,)33 b(CFITSIO)e(generally)i(uses)f(the)g(v)-5 b(alue)33 b(of)f(the)h(BLANK) 0 1370 y(or)40 b(TNULLn)f(k)m(eyw)m(ord)h(to)h(signify)e(an)h (unde\014ned)e(pixel,)43 b(but)c(these)h(routines)g(ma)m(y)g(b)s(e)f (used)g(to)i(o)m(v)m(erride)0 1483 y(this)32 b(v)-5 b(alue.)48 b(These)32 b(routines)g(do)h(not)f(create)i(or)f(mo)s(dify)e(the)i (corresp)s(onding)e(header)i(k)m(eyw)m(ord)f(v)-5 b(alues.)48 b(See)0 1596 y(App)s(endix)29 b(B)h(for)h(the)f(de\014nition)g(of)h (the)f(parameters)h(used)e(in)i(these)f(routines.)0 1827 y Fi(1)81 b Fj(Reset)26 b(the)g(scaling)g(factors)g(in)f(the)h(primary) f(arra)m(y)h(or)f(image)i(extension;)h(do)s(es)d(not)g(c)m(hange)i(the) f(BSCALE)227 1940 y(and)i(BZER)m(O)g(k)m(eyw)m(ord)h(v)-5 b(alues)28 b(and)g(only)g(a\013ects)i(the)e(automatic)j(scaling)e(p)s (erformed)e(when)g(the)h(data)227 2053 y(elemen)m(ts)f(are)f (written/read)g(to/from)g(the)g(FITS)f(\014le.)39 b(When)25 b(reading)h(from)f(a)h(FITS)f(\014le)g(the)h(returned)227 2166 y(data)i(v)-5 b(alue)28 b(=)f(\(the)h(v)-5 b(alue)28 b(giv)m(en)h(in)e(the)g(FITS)g(arra)m(y\))h(*)g(BSCALE)f(+)g(BZER)m(O.) g(The)g(in)m(v)m(erse)i(form)m(ula)227 2279 y(is)i(used)e(when)h (writing)g(data)h(v)-5 b(alues)31 b(to)g(the)f(FITS)g(\014le.)95 2511 y Fe(int)47 b(fits_set_bscale)d(/)j(ffpscl)286 2624 y(\(fitsfile)f(*fptr,)g(double)g(scale,)g(double)g(zero,)g(>)i(int)f (*status\))0 2856 y Fi(2)81 b Fj(Reset)39 b(the)f(scaling)i(parameters) e(for)h(a)f(table)h(column;)k(do)s(es)38 b(not)g(c)m(hange)i(the)e (TSCALn)f(or)h(TZER)m(On)227 2968 y(k)m(eyw)m(ord)29 b(v)-5 b(alues)29 b(and)e(only)i(a\013ects)g(the)g(automatic)h(scaling) f(p)s(erformed)e(when)g(the)i(data)g(elemen)m(ts)h(are)227 3081 y(written/read)i(to/from)g(the)g(FITS)f(\014le.)44 b(When)31 b(reading)g(from)g(a)h(FITS)f(\014le)g(the)h(returned)e(data) i(v)-5 b(alue)227 3194 y(=)25 b(\(the)i(v)-5 b(alue)26 b(giv)m(en)g(in)f(the)h(FITS)f(arra)m(y\))h(*)g(TSCAL)e(+)i(TZER)m(O.)e (The)h(in)m(v)m(erse)i(form)m(ula)f(is)f(used)g(when)227 3307 y(writing)31 b(data)g(v)-5 b(alues)30 b(to)i(the)e(FITS)g(\014le.) 95 3539 y Fe(int)47 b(fits_set_tscale)d(/)j(fftscl)286 3652 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(double)i(scale,)f(double)g (zero,)334 3765 y(>)i(int)e(*status\))0 3997 y Fi(3)81 b Fj(De\014ne)36 b(the)g(in)m(teger)i(v)-5 b(alue)36 b(to)h(b)s(e)e(used)h(to)h(signify)f(unde\014ned)e(pixels)i(in)g(the)g (primary)f(arra)m(y)i(or)f(image)227 4109 y(extension.)54 b(This)34 b(is)g(only)h(used)f(if)g(BITPIX)g(=)h(8,)h(16,)g(or)f(32.)54 b(This)34 b(do)s(es)g(not)h(create)h(or)e(c)m(hange)i(the)227 4222 y(v)-5 b(alue)31 b(of)g(the)f(BLANK)h(k)m(eyw)m(ord)g(in)f(the)g (header.)95 4454 y Fe(int)47 b(fits_set_imgnull)d(/)j(ffpnul)286 4567 y(\(fitsfile)f(*fptr,)g(LONGLONG)f(nulval,)h(>)i(int)e(*status\))0 4799 y Fi(4)81 b Fj(De\014ne)36 b(the)g(string)g(to)g(b)s(e)f(used)g (to)i(signify)f(unde\014ned)e(pixels)i(in)f(a)h(column)g(in)g(an)f (ASCI)s(I)g(table.)58 b(This)227 4912 y(do)s(es)30 b(not)h(create)h(or) e(c)m(hange)i(the)e(v)-5 b(alue)31 b(of)g(the)f(TNULLn)g(k)m(eyw)m (ord.)95 5143 y Fe(int)47 b(fits_set_atblnull)c(/)48 b(ffsnul)286 5256 y(\(fitsfile)e(*fptr,)g(int)h(colnum,)e(char)i (*nulstr,)f(>)h(int)g(*status\))0 5488 y Fi(5)81 b Fj(De\014ne)34 b(the)h(v)-5 b(alue)34 b(to)h(b)s(e)f(used)g(to)h(signify)f (unde\014ned)e(pixels)j(in)f(an)g(in)m(teger)i(column)e(in)g(a)g (binary)g(table)227 5601 y(\(where)29 b(TF)m(ORMn)f(=)g('B',)i('I',)f (or)f('J'\).)i(This)d(do)s(es)i(not)f(create)j(or)d(c)m(hange)i(the)e (v)-5 b(alue)29 b(of)g(the)g(TNULLn)227 5714 y(k)m(eyw)m(ord.)p eop end %%Page: 112 120 TeXDict begin 112 119 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.112) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(112)958 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)95 555 y Fe(int)47 b(fits_set_btblnull)c(/)48 b(fftnul)286 668 y(\(fitsfile)e(*fptr,)g(int)h(colnum,)e(LONGLONG)h (nulval,)g(>)h(int)g(*status\))0 818 y SDict begin H.S end 0 818 a 0 818 a SDict begin 13.6 H.A end 0 818 a 0 818 a SDict begin [/View [/XYZ H.V]/Dest (section.9.5) cvn /DEST pdfmark end 0 818 a 177 x Ff(9.5)135 b(Sp)t(ecialized)61 b(FITS)e(Primary)i(Arra)l(y)f(or)h(IMA)l(GE)e(Extension)j(I/O)306 1144 y(Routines)0 1394 y Fj(These)27 b(routines)h(read)f(or)h(write)g (data)g(v)-5 b(alues)28 b(in)g(the)f(primary)g(data)h(arra)m(y)h (\(i.e.,)g(the)f(\014rst)f(HDU)i(in)e(the)h(FITS)0 1507 y(\014le\))37 b(or)g(an)f(IMA)m(GE)h(extension.)60 b(Automatic)39 b(data)e(t)m(yp)s(e)g(con)m(v)m(ersion)g(is)g(p)s(erformed)e(for)h(if)h (the)g(data)g(t)m(yp)s(e)0 1620 y(of)c(the)g(FITS)f(arra)m(y)h(\(as)g (de\014ned)f(b)m(y)g(the)h(BITPIX)g(k)m(eyw)m(ord\))g(di\013ers)g(from) f(the)h(data)g(t)m(yp)s(e)g(of)g(the)g(arra)m(y)g(in)0 1733 y(the)c(calling)i(routine.)40 b(The)28 b(data)i(v)-5 b(alues)29 b(are)h(automatically)i(scaled)d(b)m(y)g(the)h(BSCALE)e(and) g(BZER)m(O)h(header)0 1846 y(v)-5 b(alues)25 b(as)h(they)f(are)g(b)s (eing)g(written)g(or)g(read)f(from)h(the)g(FITS)f(arra)m(y)-8 b(.)40 b(Unlik)m(e)26 b(the)f(basic)h(routines)e(describ)s(ed)g(in)0 1959 y(the)31 b(previous)g(c)m(hapter,)i(most)e(of)h(these)g(routines)f (sp)s(eci\014cally)h(supp)s(ort)d(the)j(FITS)e(random)h(groups)f (format.)0 2072 y(See)h(App)s(endix)d(B)j(for)f(the)h(de\014nition)f (of)g(the)h(parameters)g(used)e(in)h(these)h(routines.)0 2232 y(The)24 b(more)h(primitiv)m(e)h(reading)f(and)f(writing)h (routines)f(\(i.)40 b(e.,)26 b(\013ppr)p 2364 2232 28 4 v 32 w(,)g(\013ppn)p 2653 2232 V 31 w(,)g(\013ppn,)f(\013gp)m(v)p 3185 2232 V 33 w(,)h(or)f(\013gpf)p 3552 2232 V 32 w(\))g(simply)0 2345 y(treat)g(the)g(primary)e(arra)m(y)i(as)f(a)h(long)g (1-dimensional)g(arra)m(y)g(of)f(pixels,)i(ignoring)f(the)f(in)m (trinsic)h(dimensionalit)m(y)0 2458 y(of)30 b(the)g(arra)m(y)-8 b(.)42 b(When)30 b(dealing)h(with)e(a)i(2D)g(image,)g(for)f(example,)h (the)f(application)i(program)e(m)m(ust)g(calculate)0 2571 y(the)i(pixel)g(o\013set)g(in)f(the)h(1-D)h(arra)m(y)f(that)g (corresp)s(onds)e(to)i(an)m(y)g(particular)g(X,)g(Y)f(co)s(ordinate)i (in)e(the)g(image.)0 2684 y(C)25 b(programmers)h(should)f(note)h(that)g (the)h(ordering)e(of)h(arra)m(ys)g(in)g(FITS)f(\014les,)i(and)e(hence)h (in)g(all)g(the)g(CFITSIO)0 2797 y(calls,)40 b(is)d(more)g(similar)h (to)f(the)h(dimensionalit)m(y)g(of)f(arra)m(ys)g(in)g(F)-8 b(ortran)38 b(rather)f(than)f(C.)h(F)-8 b(or)38 b(instance)g(if)f(a)0 2910 y(FITS)28 b(image)i(has)e(NAXIS1)h(=)f(100)i(and)e(NAXIS2)h(=)f (50,)i(then)e(a)h(2-D)h(arra)m(y)f(just)f(large)i(enough)e(to)i(hold)e (the)0 3022 y(image)k(should)d(b)s(e)h(declared)h(as)f(arra)m (y[50][100])k(and)c(not)h(as)f(arra)m(y[100][50].)0 3183 y(F)-8 b(or)30 b(con)m(v)m(enience,)i(higher-lev)m(el)g(routines)d(are) h(also)h(pro)m(vided)e(to)h(sp)s(eci\014cally)h(deal)f(with)f(2D)i (images)f(\(\013p2d)p 3872 3183 V 0 3296 a(and)c(\013g2d)p 372 3296 V 33 w(\))h(and)f(3D)i(data)f(cub)s(es)f(\(\013p3d)p 1467 3296 V 59 w(and)g(\013g3d)p 1893 3296 V 33 w(\).)40 b(The)26 b(dimensionalit)m(y)i(of)f(the)g(FITS)f(image)i(is)e(passed)0 3408 y(b)m(y)36 b(the)h(naxis1,)h(naxis2,)h(and)d(naxis3)h(parameters)f (and)g(the)h(declared)f(dimensions)g(of)h(the)f(program)g(arra)m(y)0 3521 y(are)30 b(passed)g(in)f(the)h(dim1)g(and)f(dim2)h(parameters.)41 b(Note)31 b(that)f(the)g(dimensions)f(of)h(the)g(program)g(arra)m(y)g (ma)m(y)0 3634 y(b)s(e)35 b(larger)h(than)f(the)h(dimensions)f(of)h (the)g(FITS)e(arra)m(y)-8 b(.)58 b(F)-8 b(or)36 b(example)g(if)g(a)g (FITS)e(image)j(with)e(NAXIS1)h(=)0 3747 y(NAXIS2)g(=)g(400)h(is)f (read)g(in)m(to)h(a)g(program)f(arra)m(y)g(whic)m(h)g(is)g(dimensioned) f(as)i(512)g(x)f(512)h(pixels,)h(then)e(the)0 3860 y(image)g(will)f (just)f(\014ll)g(the)h(lo)m(w)m(er)h(left)f(corner)f(of)h(the)g(arra)m (y)g(with)f(pixels)h(in)f(the)h(range)g(1)g(-)g(400)g(in)g(the)f(X)h (an)0 3973 y(Y)g(directions.)54 b(This)34 b(has)h(the)g(e\013ect)h(of)f (taking)g(a)h(con)m(tiguous)f(set)h(of)f(pixel)g(v)-5 b(alue)35 b(in)f(the)h(FITS)f(arra)m(y)i(and)0 4086 y(writing)30 b(them)g(to)h(a)f(non-con)m(tiguous)h(arra)m(y)g(in)e(program)h(memory) g(\(i.e.,)i(there)e(are)h(no)m(w)f(some)g(blank)g(pixels)0 4199 y(around)f(the)i(edge)g(of)g(the)f(image)i(in)e(the)g(program)g (arra)m(y\).)0 4359 y(The)k(most)i(general)f(set)h(of)f(routines)f (\(\013pss)p 1560 4359 V 33 w(,)i(\013gsv)p 1836 4359 V 33 w(,)g(and)e(\013gsf)p 2273 4359 V 33 w(\))h(ma)m(y)h(b)s(e)e(used) g(to)h(transfer)g(a)g(rectangular)0 4472 y(subset)27 b(of)h(the)g(pixels)f(in)h(a)g(FITS)f(N-dimensional)h(image)h(to)f(or)g (from)f(an)g(arra)m(y)i(whic)m(h)e(has)g(b)s(een)g(declared)h(in)0 4585 y(the)h(calling)h(program.)40 b(The)28 b(fpixel)h(and)f(lpixel)h (parameters)g(are)g(in)m(teger)h(arra)m(ys)f(whic)m(h)f(sp)s(ecify)g (the)h(starting)0 4698 y(and)k(ending)f(pixel)i(co)s(ordinate)g(in)f (eac)m(h)h(dimension)f(\(starting)h(with)f(1,)h(not)g(0\))g(of)f(the)g (FITS)g(image)h(that)g(is)0 4811 y(to)f(b)s(e)e(read)g(or)h(written.)45 b(It)32 b(is)g(imp)s(ortan)m(t)g(to)h(note)f(that)h(these)f(are)g(the)g (starting)h(and)e(ending)g(pixels)h(in)g(the)0 4924 y(FITS)i(image,)k (not)d(in)f(the)h(declared)h(arra)m(y)f(in)f(the)h(program.)54 b(The)35 b(arra)m(y)g(parameter)g(in)g(these)g(routines)g(is)0 5036 y(treated)f(simply)e(as)h(a)f(large)i(one-dimensional)g(arra)m(y)f (of)f(the)h(appropriate)g(data)g(t)m(yp)s(e)g(con)m(taining)h(the)f (pixel)0 5149 y(v)-5 b(alues;)37 b(The)d(pixel)h(v)-5 b(alues)35 b(in)g(the)f(FITS)g(arra)m(y)h(are)g(read/written)g(from/to) h(this)e(program)h(arra)m(y)g(in)f(strict)0 5262 y(sequence)d(without)f (an)m(y)h(gaps;)g(it)g(is)f(up)f(to)j(the)e(calling)i(routine)e(to)i (correctly)f(in)m(terpret)g(the)g(dimensionalit)m(y)0 5375 y(of)d(this)f(arra)m(y)-8 b(.)41 b(The)27 b(t)m(w)m(o)i(FITS)e (reading)h(routines)f(\(\013gsv)p 2018 5375 V 61 w(and)g(\013gsf)p 2415 5375 V 61 w(\))h(also)g(ha)m(v)m(e)h(an)f(`inc')g(parameter)g (whic)m(h)0 5488 y(de\014nes)33 b(the)h(data)h(sampling)f(in)m(terv)-5 b(al)36 b(in)d(eac)m(h)j(dimension)d(of)h(the)h(FITS)e(arra)m(y)-8 b(.)53 b(F)-8 b(or)35 b(example,)h(if)e(inc[0]=2)0 5601 y(and)i(inc[1]=3)j(when)d(reading)h(a)g(2-dimensional)h(FITS)e(image,) 41 b(then)36 b(only)h(ev)m(ery)h(other)f(pixel)h(in)e(the)i(\014rst)0 5714 y(dimension)30 b(and)g(ev)m(ery)h(3rd)f(pixel)g(in)g(the)h(second) f(dimension)g(will)h(b)s(e)f(returned)f(to)i(the)f('arra)m(y')i (parameter.)p eop end %%Page: 113 121 TeXDict begin 113 120 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.113) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.5.)72 b(SPECIALIZED)29 b(FITS)g(PRIMAR)-8 b(Y)31 b(ARRA)-8 b(Y)32 b(OR)d(IMA)m(GE)j(EXTENSION)d(I/O)h(R)m(OUTINES)80 b Fj(113)0 555 y(Tw)m(o)29 b(t)m(yp)s(es)h(of)f(routines)g(are)h(pro)m (vided)e(to)i(read)f(the)h(data)g(arra)m(y)f(whic)m(h)g(di\013er)g(in)g (the)h(w)m(a)m(y)g(unde\014ned)d(pixels)0 668 y(are)38 b(handled.)60 b(The)37 b(\014rst)g(t)m(yp)s(e)g(of)g(routines)h (\(e.g.,)i(\013gp)m(v)p 2059 668 28 4 v 34 w(\))d(simply)g(return)f(an) h(arra)m(y)h(of)g(data)g(elemen)m(ts)g(in)0 781 y(whic)m(h)30 b(unde\014ned)f(pixels)h(are)h(set)g(equal)g(to)h(a)f(v)-5 b(alue)31 b(sp)s(eci\014ed)e(b)m(y)i(the)g(user)e(in)i(the)f(`n)m(ulv) -5 b(al')32 b(parameter.)41 b(An)0 894 y(additional)30 b(feature)f(of)g(these)h(routines)e(is)h(that)h(if)f(the)g(user)f(sets) h(n)m(ulv)-5 b(al)29 b(=)g(0,)h(then)e(no)h(c)m(hec)m(ks)h(for)f (unde\014ned)0 1007 y(pixels)c(will)g(b)s(e)g(p)s(erformed,)f(th)m(us)h (reducing)f(the)h(amoun)m(t)h(of)f(CPU)f(pro)s(cessing.)39 b(The)24 b(second)h(t)m(yp)s(e)g(of)g(routines)0 1120 y(\(e.g.,)36 b(\013gpf)p 413 1120 V 32 w(\))e(returns)e(the)i(data)g (elemen)m(t)g(arra)m(y)g(and,)g(in)f(addition,)h(a)g(c)m(har)g(arra)m (y)f(that)h(indicates)h(whether)0 1233 y(the)f(v)-5 b(alue)34 b(of)g(the)f(corresp)s(onding)g(data)h(pixel)g(is)g(unde\014ned)d(\(=)j (1\))g(or)g(de\014ned)e(\(=)i(0\).)51 b(The)33 b(latter)i(t)m(yp)s(e)f (of)0 1346 y(routines)d(ma)m(y)h(b)s(e)e(more)i(con)m(v)m(enien)m(t)h (to)f(use)f(in)g(some)g(circumstances,)i(ho)m(w)m(ev)m(er,)g(it)e (requires)g(an)g(additional)0 1458 y(arra)m(y)g(of)f(logical)j(v)-5 b(alues)31 b(whic)m(h)f(can)h(b)s(e)e(un)m(wieldy)h(when)g(w)m(orking)g (with)g(large)i(data)f(arra)m(ys.)0 1732 y Fi(1)81 b Fj(W)-8 b(rite)31 b(elemen)m(ts)h(in)m(to)f(the)g(FITS)f(data)h(arra)m (y)-8 b(.)95 2005 y Fe(int)47 b(fits_write_img)d(/)k(ffppr)286 2117 y(\(fitsfile)e(*fptr,)g(int)h(datatype,)e(LONGLONG)g(firstelem,)g (LONGLONG)h(nelements,)334 2230 y(DTYPE)g(*array,)g(int)h(*status\);)95 2456 y(int)g(fits_write_img_[byt,)c(sht,)j(usht,)h(int,)f(uint,)h(lng,) f(ulng,)h(lnglng,)e(ulnglng,)h(flt,)h(dbl])f(/)286 2569 y(ffppr[b,i,ui,k,uk,j,uj,jj,)o(ujj)o(,e,d)o(])286 2682 y(\(fitsfile)g(*fptr,)g(long)g(group,)g(LONGLONG)g(firstelem,)f (LONGLONG)h(nelements,)334 2795 y(DTYPE)g(*array,)g(>)i(int)f (*status\);)95 3021 y(int)g(fits_write_imgnull)c(/)48 b(ffppn)286 3134 y(\(fitsfile)e(*fptr,)g(int)h(datatype,)e(LONGLONG)g (firstelem,)g(LONGLONG)h(nelements,)334 3247 y(DTYPE)g(*array,)g(DTYPE) h(*nulval,)e(>)j(int)f(*status\);)95 3472 y(int)g (fits_write_imgnull_[byt,)42 b(sht,)k(usht,)h(int,)f(uint,)h(lng,)f (ulng,)h(lnglng,)e(ulnglng,)h(flt,)h(dbl])f(/)286 3585 y(ffppn[b,i,ui,k,uk,j,uj,jj,)o(ujj)o(,e,d)o(])286 3698 y(\(fitsfile)g(*fptr,)g(long)g(group,)g(LONGLONG)g(firstelem,)525 3811 y(LONGLONG)g(nelements,)f(DTYPE)h(*array,)g(DTYPE)g(nulval,)g(>)h (int)g(*status\);)0 4084 y Fi(2)81 b Fj(Set)30 b(data)h(arra)m(y)g (elemen)m(ts)h(as)e(unde\014ned.)95 4357 y Fe(int)47 b(fits_write_img_null)c(/)k(ffppru)286 4470 y(\(fitsfile)f(*fptr,)g (long)g(group,)g(LONGLONG)g(firstelem,)f(LONGLONG)h(nelements,)334 4583 y(>)i(int)e(*status\))0 4856 y Fi(3)81 b Fj(W)-8 b(rite)32 b(v)-5 b(alues)30 b(in)m(to)i(group)e(parameters.)42 b(This)30 b(routine)g(only)h(applies)g(to)g(the)g(`Random)f(Group)s (ed')g(FITS)227 4969 y(format)22 b(whic)m(h)f(has)g(b)s(een)f(used)h (for)g(applications)h(in)f(radio)h(in)m(terferometry)-8 b(,)25 b(but)20 b(is)h(o\016cially)i(deprecated)227 5082 y(for)30 b(future)g(use.)95 5355 y Fe(int)47 b(fits_write_grppar_[byt,) 42 b(sht,)k(usht,)h(int,)f(uint,)h(lng,)f(ulng,)h(lnglng,)f(ulnglng,)f (flt,)i(dbl])f(/)286 5468 y(ffpgp[b,i,ui,k,uk,j,uj,jj,)o(ujj)o(,e,d)o (])286 5581 y(\(fitsfile)g(*fptr,)g(long)g(group,)g(long)h(firstelem,)e (long)i(nelements,)334 5694 y(>)h(DTYPE)e(*array,)g(int)h(*status\))p eop end %%Page: 114 122 TeXDict begin 114 121 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.114) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(114)958 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 555 y Fi(4)81 b Fj(W)-8 b(rite)31 b(a)g(2-D)h(or)e(3-D)h(image)h(in)m(to)f(the)g(data)g(arra)m(y)-8 b(.)95 776 y Fe(int)47 b(fits_write_2d_[byt,)c(sht,)k(usht,)f(int,)h (uint,)f(lng,)h(ulng,)f(lnglng,)g(ulnglng,)f(flt,)i(dbl])g(/)286 889 y(ffp2d[b,i,ui,k,uk,j,uj,jj,)o(ujj)o(,e,d)o(])286 1002 y(\(fitsfile)f(*fptr,)g(long)g(group,)g(LONGLONG)g(dim1,)g (LONGLONG)g(naxis1,)334 1115 y(LONGLONG)g(naxis2,)f(DTYPE)i(*array,)f (>)h(int)g(*status\))95 1341 y(int)g(fits_write_3d_[byt,)c(sht,)k (usht,)f(int,)h(uint,)f(lng,)h(ulng,)f(lnglng,)g(ulnglng,)f(flt,)i (dbl])g(/)286 1453 y(ffp3d[b,i,ui,k,uk,j,uj,jj,)o(ujj)o(,e,d)o(])286 1566 y(\(fitsfile)f(*fptr,)g(long)g(group,)g(LONGLONG)g(dim1,)g (LONGLONG)g(dim2,)g(LONGLONG)g(naxis1,)334 1679 y(LONGLONG)g(naxis2,)f (LONGLONG)h(naxis3,)g(DTYPE)g(*array,)g(>)h(int)g(*status\))0 1900 y Fi(5)81 b Fj(W)-8 b(rite)31 b(an)g(arbitrary)f(data)h (subsection)f(in)m(to)i(the)e(data)h(arra)m(y)-8 b(.)95 2121 y Fe(int)47 b(fits_write_subset_[byt,)42 b(sht,)k(usht,)h(int,)f (uint,)h(lng,)f(ulng,)h(lnglng,)f(ulnglng,)f(flt,)i(dbl])f(/)286 2234 y(ffpss[b,i,ui,k,uk,j,uj,jj,)o(ujj)o(,e,d)o(])286 2347 y(\(fitsfile)g(*fptr,)g(long)g(group,)g(long)h(naxis,)f(long)h (*naxes,)334 2460 y(long)g(*fpixel,)e(long)i(*lpixel,)e(DTYPE)i (*array,)f(>)h(int)g(*status\))0 2680 y Fi(6)81 b Fj(Read)30 b(elemen)m(ts)i(from)e(the)g(FITS)g(data)h(arra)m(y)-8 b(.)95 2901 y Fe(int)47 b(fits_read_img)e(/)i(ffgpv)286 3014 y(\(fitsfile)f(*fptr,)g(int)94 b(datatype,)46 b(long)g(firstelem,) f(long)i(nelements,)334 3127 y(DTYPE)f(*nulval,)g(>)h(DTYPE)g(*array,)f (int)h(*anynul,)e(int)i(*status\))95 3353 y(int)g(fits_read_img_[byt,)c (sht,)k(usht,)f(int,)h(uint,)f(lng,)h(ulng,)f(lnglng,)g(ulnglng,)f (flt,)i(dbl])g(/)286 3466 y(ffgpv[b,i,ui,k,uk,j,uj,jj,)o(ujj)o(,e,d)o (])286 3579 y(\(fitsfile)f(*fptr,)g(long)g(group,)g(long)h(firstelem,)e (long)i(nelements,)334 3692 y(DTYPE)f(nulval,)g(>)i(DTYPE)e(*array,)g (int)h(*anynul,)e(int)i(*status\))95 3917 y(int)g(fits_read_imgnull)c (/)48 b(ffgpf)286 4030 y(\(fitsfile)e(*fptr,)g(int)94 b(datatype,)46 b(long)g(firstelem,)f(long)i(nelements,)334 4143 y(>)h(DTYPE)e(*array,)g(char)g(*nullarray,)f(int)i(*anynul,)f(int) g(*status\))95 4369 y(int)95 b(fits_read_imgnull_[byt,)42 b(sht,)k(usht,)h(int,)f(uint,)h(lng,)f(ulng,)h(lnglng,)e(ulnglng,)h (flt,)h(dbl])f(/)334 4482 y(ffgpf[b,i,ui,k,uk,j,uj,jj)o(,uj)o(j,e,)o (d])334 4595 y(\(fitsfile)f(*fptr,)h(long)h(group,)f(long)h(firstelem,) e(long)h(nelements,)334 4708 y(>)i(DTYPE)e(*array,)g(char)g (*nullarray,)f(int)i(*anynul,)f(int)g(*status\))0 4929 y Fi(7)81 b Fj(Read)29 b(v)-5 b(alues)31 b(from)e(group)g(parameters.) 41 b(This)29 b(routine)g(only)h(applies)g(to)h(the)e(`Random)h(Group)s (ed')f(FITS)227 5041 y(format)22 b(whic)m(h)f(has)g(b)s(een)f(used)h (for)g(applications)h(in)f(radio)h(in)m(terferometry)-8 b(,)25 b(but)20 b(is)h(o\016cially)i(deprecated)227 5154 y(for)30 b(future)g(use.)95 5375 y Fe(int)95 b(fits_read_grppar_[byt,) 42 b(sht,)k(usht,)h(int,)f(uint,)h(lng,)f(ulng,)h(lnglng,)f(ulnglng,)f (flt,)i(dbl])f(/)334 5488 y(ffggp[b,i,ui,k,uk,j,uj,jj)o(,uj)o(j,e,)o (d])334 5601 y(\(fitsfile)f(*fptr,)h(long)h(group,)f(long)h(firstelem,) e(long)h(nelements,)334 5714 y(>)i(DTYPE)e(*array,)g(int)h(*status\))p eop end %%Page: 115 123 TeXDict begin 115 122 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.115) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.6.)72 b(SPECIALIZED)29 b(FITS)g(ASCI)s(I)g(AND)i(BINAR)-8 b(Y)32 b(T)-8 b(ABLE)30 b(R)m(OUTINES)933 b Fj(115)0 555 y Fi(8)81 b Fj(Read)37 b(2-D)h(or)g(3-D)g(image)g(from)f(the)g(data)h(arra)m(y)-8 b(.)62 b(Unde\014ned)36 b(pixels)i(in)e(the)i(arra)m(y)g(will)f(b)s(e)g (set)g(equal)227 668 y(to)32 b(the)g(v)-5 b(alue)31 b(of)h('n)m(ulv)-5 b(al',)32 b(unless)f(n)m(ulv)-5 b(al=0)31 b(in)g(whic)m(h)g(case)h(no)f (testing)i(for)e(unde\014ned)e(pixels)i(will)h(b)s(e)227 781 y(p)s(erformed.)95 1049 y Fe(int)95 b(fits_read_2d_[byt,)43 b(sht,)k(usht,)f(int,)h(uint,)f(lng,)h(ulng,)f(lnglng,)g(ulnglng,)f (flt,)i(dbl])g(/)334 1162 y(ffg2d[b,i,ui,k,uk,j,uj,jj)o(,uj)o(j,e,)o (d])334 1275 y(\(fitsfile)e(*fptr,)h(long)h(group,)f(DTYPE)h(nulval,)e (LONGLONG)h(dim1,)g(LONGLONG)g(naxis1,)334 1387 y(LONGLONG)g(naxis2,)f (>)j(DTYPE)e(*array,)g(int)h(*anynul,)f(int)g(*status\))95 1613 y(int)95 b(fits_read_3d_[byt,)43 b(sht,)k(usht,)f(int,)h(uint,)f (lng,)h(ulng,)f(lnglng,)g(ulnglng,)f(flt,)i(dbl])g(/)334 1726 y(ffg3d[b,i,ui,k,uk,j,uj,jj)o(,uj)o(j,e,)o(d])334 1839 y(\(fitsfile)e(*fptr,)h(long)h(group,)f(DTYPE)h(nulval,)e (LONGLONG)h(dim1,)334 1952 y(LONGLONG)g(dim2,)g(LONGLONG)g(naxis1,)f (LONGLONG)h(naxis2,)g(LONGLONG)f(naxis3,)334 2065 y(>)j(DTYPE)e (*array,)g(int)h(*anynul,)e(int)i(*status\))0 2333 y Fi(9)81 b Fj(Read)30 b(an)g(arbitrary)h(data)g(subsection)f(from)g(the) g(data)i(arra)m(y)-8 b(.)95 2600 y Fe(int)95 b(fits_read_subset_[byt,) 42 b(sht,)k(usht,)h(int,)f(uint,)h(lng,)f(ulng,)h(lnglng,)f(ulnglng,)f (flt,)i(dbl])f(/)334 2713 y(ffgsv[b,i,ui,k,uk,j,uj,jj)o(,uj)o(j,e,)o (d])334 2826 y(\(fitsfile)f(*fptr,)h(int)h(group,)f(int)h(naxis,)f (long)h(*naxes,)334 2939 y(long)g(*fpixel,)e(long)i(*lpixel,)e(long)i (*inc,)f(DTYPE)h(nulval,)334 3052 y(>)h(DTYPE)e(*array,)g(int)h (*anynul,)e(int)i(*status\))95 3278 y(int)95 b (fits_read_subsetnull_[byt)o(,)42 b(sht,)k(usht,)h(int,)f(uint,)h(lng,) f(ulng,)h(lnglng,)f(ulnglng,)f(flt,)i(dbl])f(/)334 3391 y(ffgsf[b,i,ui,k,uk,j,uj,jj)o(,uj)o(j,e,)o(d])334 3504 y(\(fitsfile)f(*fptr,)h(int)h(group,)f(int)h(naxis,)f(long)h(*naxes,) 334 3617 y(long)g(*fpixel,)e(long)i(*lpixel,)e(long)i(*inc,)f(>)i (DTYPE)e(*array,)334 3730 y(char)h(*nullarray,)d(int)j(*anynul,)f(int)h (*status\))0 3896 y SDict begin H.S end 0 3896 a 0 3896 a SDict begin 13.6 H.A end 0 3896 a 0 3896 a SDict begin [/View [/XYZ H.V]/Dest (section.9.6) cvn /DEST pdfmark end 0 3896 a 177 x Ff(9.6)135 b(Sp)t(ecialized)46 b(FITS)e(ASCI)t(I)g (and)g(Binary)h(T)-11 b(able)45 b(Routines)0 4188 y SDict begin H.S end 0 4188 a 0 4188 a SDict begin 13.6 H.A end 0 4188 a 0 4188 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.6.1) cvn /DEST pdfmark end 0 4188 a 140 x Fd(9.6.1)112 b(General)39 b(Column)f(Routines)0 4543 y Fi(1)81 b Fj(Get)31 b(information)f(ab)s(out)g(an)g(existing)h(ASCI)s(I)d(or)i(binary)f (table)i(column.)41 b(A)30 b(n)m(ull)g(p)s(oin)m(ter)g(ma)m(y)h(b)s(e)e (giv)m(en)227 4656 y(for)40 b(an)m(y)h(of)f(the)h(output)f(parameters)g (that)h(are)g(not)f(needed.)70 b(D)m(A)-8 b(T)g(A)g(TYPE)42 b(is)e(a)h(c)m(haracter)h(string)227 4769 y(whic)m(h)d(returns)e(the)i (data)g(t)m(yp)s(e)g(of)g(the)f(column)h(as)g(de\014ned)e(b)m(y)i(the)f (TF)m(ORMn)h(k)m(eyw)m(ord)g(\(e.g.,)j('I',)227 4882 y('J','E',)28 b('D',)g(etc.\).)41 b(In)27 b(the)g(case)g(of)g(an)g (ASCI)s(I)f(c)m(haracter)i(column,)g(t)m(yp)s(eco)s(de)f(will)g(ha)m(v) m(e)h(a)f(v)-5 b(alue)28 b(of)f(the)227 4994 y(form)g('An')g(where)f ('n')h(is)g(an)g(in)m(teger)i(expressing)d(the)h(width)g(of)g(the)g (\014eld)g(in)f(c)m(haracters.)41 b(F)-8 b(or)28 b(example,)227 5107 y(if)g(TF)m(ORM)h(=)e('160A8')k(then)d(\013gb)s(cl)g(will)g (return)f(t)m(yp)s(ec)m(har='A8')j(and)d(rep)s(eat=20.)41 b(All)29 b(the)f(returned)227 5220 y(parameters)j(are)g(scalar)g(quan)m (tities.)95 5488 y Fe(int)47 b(fits_get_acolparms)c(/)48 b(ffgacl)191 5601 y(\(fitsfile)d(*fptr,)h(int)h(colnum,)f(>)h(char)g (*ttype,)f(long)h(*tbcol,)239 5714 y(char)f(*tunit,)g(char)h(*tform,)f (double)g(*scale,)f(double)i(*zero,)p eop end %%Page: 116 124 TeXDict begin 116 123 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.116) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(116)958 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)239 555 y Fe(char)46 b(*nulstr,)g(char)g (*tdisp,)g(int)h(*status\))95 781 y(int)g(fits_get_bcolparms)c(/)48 b(ffgbcl)286 894 y(\(fitsfile)e(*fptr,)g(int)h(colnum,)e(>)j(char)f (*ttype,)e(char)i(*tunit,)334 1007 y(char)g(*typechar,)e(long)h (*repeat,)g(double)g(*scale,)g(double)g(*zero,)334 1120 y(long)h(*nulval,)e(char)i(*tdisp,)f(int)94 b(*status\))95 1346 y(int)47 b(fits_get_bcolparmsll)c(/)k(ffgbclll)286 1458 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(>)j(char)f(*ttype,)e(char) i(*tunit,)334 1571 y(char)g(*typechar,)e(LONGLONG)g(*repeat,)h(double)g (*scale,)g(double)g(*zero,)334 1684 y(LONGLONG)g(*nulval,)f(char)i (*tdisp,)f(int)94 b(*status\))0 1937 y Fi(2)81 b Fj(Return)27 b(optimal)i(n)m(um)m(b)s(er)e(of)h(ro)m(ws)g(to)h(read)f(or)g(write)g (at)h(one)f(time)h(for)f(maxim)m(um)g(I/O)f(e\016ciency)-8 b(.)42 b(Refer)227 2050 y(to)25 b(the)g(\\Optimizing)g(Co)s(de")f (section)i(in)e(Chapter)g(5)g(for)g(more)h(discussion)f(on)g(ho)m(w)g (to)h(use)f(this)h(routine.)95 2416 y Fe(int)47 b(fits_get_rowsize)d(/) j(ffgrsz)286 2529 y(\(fitsfile)f(*fptr,)g(long)g(*nrows,)g(*status\))0 2782 y Fi(3)81 b Fj(De\014ne)22 b(the)g(zero)i(indexed)d(b)m(yte)i (o\013set)g(of)g(the)f('heap')h(measured)e(from)h(the)h(start)g(of)f (the)g(binary)g(table)h(data.)227 2895 y(By)30 b(default)g(the)f(heap)h (is)f(assumed)g(to)h(start)g(immediately)h(follo)m(wing)g(the)f (regular)f(table)i(data,)f(i.e.,)h(at)227 3008 y(lo)s(cation)38 b(NAXIS1)f(x)g(NAXIS2.)59 b(This)36 b(routine)g(is)h(only)f(relev)-5 b(an)m(t)38 b(for)e(binary)g(tables)h(whic)m(h)g(con)m(tain)227 3121 y(v)-5 b(ariable)25 b(length)g(arra)m(y)g(columns)f(\(with)g(TF)m (ORMn)g(=)g('Pt'\).)40 b(This)23 b(routine)i(also)g(automatically)i (writes)227 3234 y(the)35 b(v)-5 b(alue)35 b(of)g(theap)f(to)h(a)g(k)m (eyw)m(ord)g(in)g(the)f(extension)h(header.)53 b(This)34 b(routine)g(m)m(ust)h(b)s(e)f(called)h(after)227 3347 y(the)c(required)e(k)m(eyw)m(ords)h(ha)m(v)m(e)i(b)s(een)d(written)h (\(with)g(\013ph)m(bn\))f(but)h(b)s(efore)f(an)m(y)i(data)g(is)f (written)g(to)h(the)227 3460 y(table.)95 3713 y Fe(int)47 b(fits_write_theap)d(/)j(ffpthp)286 3826 y(\(fitsfile)f(*fptr,)g(long)g (theap,)g(>)i(int)f(*status\))0 4079 y Fi(4)81 b Fj(T)-8 b(est)37 b(the)f(con)m(ten)m(ts)i(of)f(the)g(binary)e(table)j(v)-5 b(ariable)37 b(arra)m(y)g(heap,)h(returning)e(the)g(size)h(of)g(the)g (heap,)h(the)227 4192 y(n)m(um)m(b)s(er)30 b(of)h(un)m(used)e(b)m(ytes) j(that)f(are)g(not)g(curren)m(tly)g(p)s(oin)m(ted)g(to)h(b)m(y)e(an)m (y)i(of)f(the)g(descriptors,)g(and)f(the)227 4304 y(n)m(um)m(b)s(er)d (of)h(b)m(ytes)h(whic)m(h)f(are)g(p)s(oin)m(ted)g(to)h(b)m(y)f(m)m (ultiple)h(descriptors.)40 b(It)28 b(also)h(returns)e(v)-5 b(alid)29 b(=)e(F)-10 b(ALSE)227 4417 y(if)31 b(an)m(y)f(of)h(the)f (descriptors)h(p)s(oin)m(t)f(to)h(in)m(v)-5 b(alid)31 b(addresses)f(out)g(of)h(range)g(of)f(the)h(heap.)95 4670 y Fe(int)47 b(fits_test_heap)d(/)k(fftheap)286 4783 y(\(fitsfile)e(*fptr,)g(>)h(LONGLONG)f(*heapsize,)f(LONGLONG)g (*unused,)h(LONGLONG)f(*overlap,)334 4896 y(int)i(*validheap,)e(int)i (*status\))0 5149 y Fi(5)81 b Fj(Re-pac)m(k)33 b(the)f(v)m(ectors)h(in) e(the)h(binary)f(table)i(v)-5 b(ariable)32 b(arra)m(y)g(heap)g(to)g (reco)m(v)m(er)i(an)m(y)e(un)m(used)e(space.)45 b(Nor-)227 5262 y(mally)-8 b(,)40 b(when)d(a)g(v)m(ector)i(in)e(a)g(v)-5 b(ariable)38 b(length)g(arra)m(y)f(column)g(is)g(rewritten)h(the)f (previously)g(written)227 5375 y(arra)m(y)d(remains)e(in)h(the)g(heap)f (as)h(w)m(asted)h(un)m(used)d(space.)49 b(This)32 b(routine)g(will)i (repac)m(k)f(the)g(arra)m(ys)g(that)227 5488 y(are)h(still)g(in)f(use,) h(th)m(us)f(eliminating)h(an)m(y)g(b)m(ytes)g(in)f(the)g(heap)g(that)h (are)g(no)f(longer)h(in)f(use.)49 b(Note)34 b(that)227 5601 y(if)f(sev)m(eral)h(v)m(ectors)g(p)s(oin)m(t)e(to)i(the)e(same)h (b)m(ytes)g(in)g(the)f(heap,)i(then)e(this)g(routine)h(will)g(mak)m(e)g (duplicate)227 5714 y(copies)e(of)g(the)g(b)m(ytes)f(for)h(eac)m(h)g(v) m(ector,)h(whic)m(h)e(will)h(actually)h(expand)e(the)g(size)i(of)e(the) h(heap.)p eop end %%Page: 117 125 TeXDict begin 117 124 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.117) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.6.)72 b(SPECIALIZED)29 b(FITS)g(ASCI)s(I)g(AND)i(BINAR)-8 b(Y)32 b(T)-8 b(ABLE)30 b(R)m(OUTINES)933 b Fj(117)95 555 y Fe(int)47 b(fits_compress_heap)c(/)48 b(ffcmph)286 668 y(\(fitsfile)e(*fptr,)g(>)h(int)g(*status\))0 833 y SDict begin H.S end 0 833 a 0 833 a SDict begin 13.6 H.A end 0 833 a 0 833 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.6.2) cvn /DEST pdfmark end 0 833 a 143 x Fd(9.6.2)112 b(Lo)m(w-Lev)m(el)39 b(T)-9 b(able)38 b(Access)f(Routines)0 1198 y Fj(The)g(follo)m(wing)j(2)e(routines)f(pro)m(vide)h(lo)m(w-lev)m (el)j(access)e(to)g(the)f(data)g(in)g(ASCI)s(I)e(or)i(binary)f(tables)h (and)g(are)0 1311 y(mainly)29 b(useful)f(as)i(an)f(e\016cien)m(t)h(w)m (a)m(y)g(to)g(cop)m(y)g(all)g(or)f(part)g(of)g(a)g(table)h(from)f(one)g (lo)s(cation)i(to)f(another.)40 b(These)0 1424 y(routines)24 b(simply)g(read)g(or)h(write)f(the)h(sp)s(eci\014ed)e(n)m(um)m(b)s(er)g (of)i(consecutiv)m(e)h(b)m(ytes)f(in)f(an)g(ASCI)s(I)f(or)h(binary)g (table,)0 1537 y(without)g(regard)g(for)f(column)h(b)s(oundaries)e(or)i (the)g(ro)m(w)g(length)g(in)f(the)h(table.)40 b(These)23 b(routines)h(do)f(not)h(p)s(erform)0 1650 y(an)m(y)36 b(mac)m(hine)h(dep)s(enden)m(t)e(data)i(con)m(v)m(ersion)g(or)g(b)m (yte)f(sw)m(apping.)58 b(See)36 b(App)s(endix)e(B)j(for)f(the)g (de\014nition)g(of)0 1763 y(the)31 b(parameters)f(used)g(in)g(these)h (routines.)0 2037 y Fi(1)81 b Fj(Read)30 b(or)h(write)f(a)h(consecutiv) m(e)h(arra)m(y)f(of)g(b)m(ytes)f(from)g(an)h(ASCI)s(I)d(or)j(binary)e (table)95 2311 y Fe(int)47 b(fits_read_tblbytes)c(/)48 b(ffgtbb)286 2424 y(\(fitsfile)e(*fptr,)g(LONGLONG)f(firstrow,)h (LONGLONG)f(firstchar,)g(LONGLONG)h(nchars,)334 2537 y(>)i(unsigned)d(char)i(*values,)e(int)i(*status\))95 2763 y(int)g(fits_write_tblbytes)c(/)k(ffptbb)286 2876 y(\(fitsfile)f(*fptr,)g(LONGLONG)f(firstrow,)h(LONGLONG)f(firstchar,)g (LONGLONG)h(nchars,)334 2989 y(unsigned)g(char)g(*values,)g(>)h(int)g (*status\))0 3153 y SDict begin H.S end 0 3153 a 0 3153 a SDict begin 13.6 H.A end 0 3153 a 0 3153 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.6.3) cvn /DEST pdfmark end 0 3153 a 143 x Fd(9.6.3)112 b(W)-9 b(rite)37 b(Column)h(Data)g (Routines)0 3516 y Fi(1)81 b Fj(W)-8 b(rite)28 b(elemen)m(ts)h(in)m(to) f(an)g(ASCI)s(I)d(or)j(binary)e(table)j(column)e(\(in)g(the)h(CDU\).)g (The)f(data)h(t)m(yp)s(e)f(of)h(the)f(arra)m(y)227 3629 y(is)k(implied)f(b)m(y)g(the)h(su\016x)e(of)i(the)f(routine)h(name.)95 3903 y Fe(int)47 b(fits_write_col_str)c(/)48 b(ffpcls)286 4016 y(\(fitsfile)e(*fptr,)g(int)h(colnum,)e(LONGLONG)h(firstrow,)f (LONGLONG)h(firstelem,)334 4129 y(LONGLONG)g(nelements,)f(char)h (**array,)g(>)h(int)g(*status\))95 4355 y(int)g (fits_write_col_[log,byt,sh)o(t,u)o(sht,)o(int,)o(uin)o(t,ln)o(g,ul)o (ng,)o(lngl)o(ng,u)o(lng)o(lng,)o(flt,)o(dbl)o(,cmp)o(,dbl)o(cmp)o(])42 b(/)286 4468 y(ffpcl[l,b,i,ui,k,uk,j,uj,j)o(j,u)o(jj,e)o(,d,c)o(,m])286 4581 y(\(fitsfile)k(*fptr,)g(int)h(colnum,)e(LONGLONG)h(firstrow,)525 4694 y(LONGLONG)g(firstelem,)f(LONGLONG)g(nelements,)g(DTYPE)h(*array,) g(>)i(int)f(*status\))0 4968 y Fi(2)81 b Fj(W)-8 b(rite)36 b(elemen)m(ts)h(in)m(to)g(an)e(ASCI)s(I)f(or)i(binary)e(table)j(column) e(substituting)g(the)h(appropriate)f(FITS)g(n)m(ull)227 5081 y(v)-5 b(alue)31 b(for)f(an)m(y)h(elemen)m(ts)h(that)f(are)f (equal)h(to)g(the)g(n)m(ulv)-5 b(al)31 b(parameter.)95 5355 y Fe(int)47 b(fits_write_colnull_[log,)42 b(byt,)k(sht,)h(usht,)f (int,)h(uint,)f(lng,)h(ulng,)f(lnglng,)g(ulnglng,)g(flt,)g(dbl])h(/)286 5468 y(ffpcn[l,b,i,ui,k,uk,j,uj,j)o(j,u)o(jj,e)o(,d])286 5581 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(LONGLONG)h(firstrow,)f (LONGLONG)h(firstelem,)334 5694 y(LONGLONG)g(nelements,)f(DTYPE)h (*array,)g(DTYPE)g(nulval,)g(>)h(int)g(*status\))p eop end %%Page: 118 126 TeXDict begin 118 125 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.118) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(118)958 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)0 555 y Fi(3)81 b Fj(W)-8 b(rite)27 b(string)g(elemen)m(ts)h(in)m(to)f(a)g(binary)f(table)h(column)f(\(in)h (the)f(CDU\))i(substituting)e(the)g(FITS)g(n)m(ull)g(v)-5 b(alue)227 668 y(for)30 b(an)m(y)h(elemen)m(ts)h(that)f(are)g(equal)f (to)i(the)e(n)m(ulstr)g(string.)95 921 y Fe(int)47 b (fits_write_colnull_str)42 b(/)48 b(ffpcns)286 1034 y(\(fitsfile)e (*fptr,)g(int)h(colnum,)e(LONGLONG)h(firstrow,)f(LONGLONG)h(firstelem,) 334 1147 y(LONGLONG)g(nelements,)f(char)h(**array,)g(char)g(*nulstr,)g (>)h(int)g(*status\))0 1399 y Fi(4)81 b Fj(W)-8 b(rite)34 b(bit)f(v)-5 b(alues)33 b(in)m(to)h(a)g(binary)e(b)m(yte)h(\('B'\))i (or)e(bit)g(\('X'\))h(table)g(column)f(\(in)g(the)g(CDU\).)h(Larra)m(y) f(is)g(an)227 1512 y(arra)m(y)25 b(of)g(c)m(haracters)h(corresp)s (onding)e(to)h(the)g(sequence)g(of)f(bits)h(to)g(b)s(e)f(written.)39 b(If)24 b(an)g(elemen)m(t)i(of)f(larra)m(y)227 1625 y(is)k(true)g (\(not)h(equal)f(to)h(zero\))g(then)f(the)g(corresp)s(onding)f(bit)h (in)g(the)g(FITS)f(table)i(is)f(set)h(to)g(1,)g(otherwise)227 1738 y(the)37 b(bit)g(is)g(set)g(to)g(0.)60 b(The)37 b('X')g(column)f(in)h(a)g(FITS)f(table)h(is)g(alw)m(a)m(ys)h(padded)e (out)h(to)g(a)g(m)m(ultiple)h(of)227 1851 y(8)f(bits)f(where)g(the)g (bit)h(arra)m(y)f(starts)h(with)f(the)h(most)f(signi\014can)m(t)h(bit)g (of)f(the)h(b)m(yte)g(and)e(w)m(orks)h(do)m(wn)227 1964 y(to)m(w)m(ards)h(the)g(1's)f(bit.)59 b(F)-8 b(or)37 b(example,)i(a)d('4X')h(arra)m(y)-8 b(,)39 b(with)d(the)h(\014rst)e (bit)i(=)e(1)i(and)f(the)g(remaining)h(3)227 2077 y(bits)31 b(=)g(0)h(is)f(equiv)-5 b(alen)m(t)33 b(to)f(the)g(8-bit)g(unsigned)e (b)m(yte)i(decimal)g(v)-5 b(alue)32 b(of)g(128)g(\('1000)i(0000B'\).)g (In)d(the)227 2189 y(case)h(of)f('X')g(columns,)g(CFITSIO)f(can)h (write)g(to)g(all)h(8)f(bits)g(of)g(eac)m(h)h(b)m(yte)f(whether)f(they) h(are)g(formally)227 2302 y(v)-5 b(alid)34 b(or)f(not.)50 b(Th)m(us)32 b(if)i(the)f(column)g(is)h(de\014ned)e(as)h('4X',)i(and)e (one)g(calls)i(\013p)s(clx)e(with)g(\014rstbit=1)g(and)227 2415 y(n)m(bits=8,)i(then)f(all)g(8)h(bits)e(will)h(b)s(e)g(written)g (in)m(to)g(the)g(\014rst)f(b)m(yte)i(\(as)f(opp)s(osed)f(to)i(writing)e (the)h(\014rst)g(4)227 2528 y(bits)28 b(in)m(to)h(the)e(\014rst)g(ro)m (w)h(and)f(then)h(the)g(next)g(4)g(bits)f(in)m(to)i(the)f(next)g(ro)m (w\),)h(ev)m(en)f(though)f(the)h(last)h(4)f(bits)227 2641 y(of)j(eac)m(h)g(b)m(yte)g(are)f(formally)h(not)f(de\014ned)f(and) h(should)f(all)i(b)s(e)e(set)i(=)f(0.)41 b(It)30 b(should)f(also)j(b)s (e)d(noted)h(that)227 2754 y(it)k(is)e(more)h(e\016cien)m(t)i(to)e (write)g('X')h(columns)e(an)h(en)m(tire)h(b)m(yte)f(at)h(a)f(time,)h (instead)f(of)g(bit)g(b)m(y)g(bit.)48 b(An)m(y)227 2867 y(of)31 b(the)g(CFITSIO)e(routines)h(that)i(write)f(to)g(columns)f (\(e.g.)43 b(\014ts)p 2481 2867 28 4 v 33 w(write)p 2716 2867 V 33 w(col)p 2859 2867 V 33 w(b)m(yt\))32 b(ma)m(y)f(b)s(e)f(used) g(for)g(this)227 2980 y(purp)s(ose.)60 b(These)36 b(routines)i(will)f (in)m(terpret)h('X')f(columns)g(as)g(though)g(they)h(w)m(ere)f('B')h (columns)f(\(e.g.,)227 3093 y('1X')32 b(through)d('8X')j(is)e(equiv)-5 b(alen)m(t)32 b(to)f('1B',)h(and)e('9X')h(through)f('16X')i(is)e(equiv) -5 b(alen)m(t)32 b(to)f('2B'\).)95 3345 y Fe(int)47 b (fits_write_col_bit)c(/)48 b(ffpclx)286 3458 y(\(fitsfile)e(*fptr,)g (int)h(colnum,)e(LONGLONG)h(firstrow,)f(long)i(firstbit,)334 3571 y(long)g(nbits,)f(char)g(*larray,)g(>)h(int)g(*status\))0 3824 y Fi(5)81 b Fj(W)-8 b(rite)35 b(the)f(descriptor)g(for)f(a)h(v)-5 b(ariable)35 b(length)f(column)g(in)f(a)i(binary)e(table.)52 b(This)33 b(routine)g(can)i(b)s(e)e(used)227 3937 y(in)h(conjunction)g (with)f(\013gdes)h(to)h(enable)f(2)g(or)g(more)g(arra)m(ys)h(to)f(p)s (oin)m(t)g(to)h(the)f(same)g(storage)h(lo)s(cation)227 4050 y(to)c(sa)m(v)m(e)h(storage)g(space)f(if)f(the)h(arra)m(ys)g(are)g (iden)m(tical.)191 4302 y Fe(int)47 b(fits_write_descript)42 b(/)48 b(ffpdes)382 4415 y(\(fitsfile)d(*fptr,)h(int)h(colnum,)f (LONGLONG)f(rownum,)h(LONGLONG)g(repeat,)430 4528 y(LONGLONG)f(offset,) h(>)h(int)g(*status\))0 4667 y SDict begin H.S end 0 4667 a 0 4667 a SDict begin 13.6 H.A end 0 4667 a 0 4667 a SDict begin [/View [/XYZ H.V]/Dest (subsection.9.6.4) cvn /DEST pdfmark end 0 4667 a 151 x Fd(9.6.4)112 b(Read)38 b(Column)h(Data)f (Routines)0 5036 y Fj(Tw)m(o)28 b(t)m(yp)s(es)f(of)h(routines)f(are)h (pro)m(vided)f(to)h(get)h(the)e(column)h(data)g(whic)m(h)f(di\013er)g (in)g(the)h(w)m(a)m(y)h(unde\014ned)c(pixels)0 5149 y(are)40 b(handled.)66 b(The)39 b(\014rst)g(set)h(of)f(routines)g(\(\013gcv\))i (simply)e(return)f(an)h(arra)m(y)h(of)g(data)g(elemen)m(ts)g(in)f(whic) m(h)0 5262 y(unde\014ned)28 b(pixels)j(are)g(set)g(equal)g(to)g(a)g(v) -5 b(alue)31 b(sp)s(eci\014ed)f(b)m(y)h(the)f(user)g(in)g(the)h('n)m (ullv)-5 b(al')32 b(parameter.)41 b(If)30 b(n)m(ullv)-5 b(al)0 5375 y(=)22 b(0,)j(then)d(no)g(c)m(hec)m(ks)i(for)e(unde\014ned) e(pixels)j(will)g(b)s(e)f(p)s(erformed,)g(th)m(us)g(increasing)i(the)e (sp)s(eed)g(of)g(the)h(program.)0 5488 y(The)36 b(second)g(set)g(of)h (routines)e(\(\013gcf)7 b(\))38 b(returns)d(the)h(data)h(elemen)m(t)g (arra)m(y)g(and)e(in)h(addition)g(a)h(logical)h(arra)m(y)0 5601 y(of)33 b(\015ags)f(whic)m(h)g(de\014nes)g(whether)g(the)g (corresp)s(onding)g(data)h(pixel)f(is)h(unde\014ned.)44 b(See)33 b(App)s(endix)e(B)i(for)f(the)0 5714 y(de\014nition)e(of)h (the)f(parameters)h(used)e(in)h(these)h(routines.)p eop end %%Page: 119 127 TeXDict begin 119 126 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.119) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.6.)72 b(SPECIALIZED)29 b(FITS)g(ASCI)s(I)g(AND)i(BINAR)-8 b(Y)32 b(T)-8 b(ABLE)30 b(R)m(OUTINES)933 b Fj(119)0 555 y(An)m(y)39 b(column,)h(regardless)f(of)g(it's)g(in)m(trinsic)g(data)h(t)m(yp)s(e,) h(ma)m(y)e(b)s(e)f(read)g(as)h(a)g(string.)66 b(It)38 b(should)g(b)s(e)g(noted)0 668 y(ho)m(w)m(ev)m(er)32 b(that)f(reading)f(a)h(n)m(umeric)f(column)g(as)h(a)f(string)h(is)f(10) h(-)g(100)g(times)g(slo)m(w)m(er)h(than)e(reading)g(the)h(same)0 781 y(column)g(as)h(a)g(n)m(um)m(b)s(er)e(due)h(to)h(the)g(large)h(o)m (v)m(erhead)f(in)g(constructing)g(the)g(formatted)g(strings.)44 b(The)31 b(displa)m(y)0 894 y(format)26 b(of)g(the)h(returned)d (strings)i(will)g(b)s(e)g(determined)f(b)m(y)h(the)g(TDISPn)f(k)m(eyw)m (ord,)j(if)d(it)i(exists,)h(otherwise)e(b)m(y)0 1007 y(the)h(data)g(t)m(yp)s(e)f(of)h(the)f(column.)39 b(The)26 b(length)h(of)g(the)f(returned)f(strings)h(\(not)h(including)f(the)h(n) m(ull)f(terminating)0 1120 y(c)m(haracter\))38 b(can)e(b)s(e)g (determined)f(with)h(the)g(\014ts)p 1722 1120 28 4 v 33 w(get)p 1875 1120 V 34 w(col)p 2019 1120 V 33 w(displa)m(y)p 2330 1120 V 33 w(width)g(routine.)57 b(The)36 b(follo)m(wing)h(TDISPn)0 1233 y(displa)m(y)31 b(formats)f(are)h(curren)m(tly)f(supp)s(orted:)191 1490 y Fe(Iw.m)142 b(Integer)191 1603 y(Ow.m)g(Octal)46 b(integer)191 1716 y(Zw.m)142 b(Hexadecimal)45 b(integer)191 1829 y(Fw.d)142 b(Fixed)46 b(floating)g(point)191 1942 y(Ew.d)142 b(Exponential)45 b(floating)g(point)191 2055 y(Dw.d)142 b(Exponential)45 b(floating)g(point)191 2168 y(Gw.d)142 b(General;)46 b(uses)g(Fw.d)h(if)g(significance)d(not)j (lost,)g(else)f(Ew.d)0 2425 y Fj(where)37 b(w)h(is)g(the)g(width)f(in)h (c)m(haracters)h(of)f(the)h(displa)m(y)m(ed)f(v)-5 b(alues,)41 b(m)c(is)h(the)g(minim)m(um)g(n)m(um)m(b)s(er)e(of)i(digits)0 2538 y(displa)m(y)m(ed,)31 b(and)f(d)g(is)g(the)h(n)m(um)m(b)s(er)e(of) h(digits)h(to)g(the)g(righ)m(t)g(of)g(the)f(decimal.)42 b(The)30 b(.m)g(\014eld)g(is)g(optional.)0 2796 y Fi(1)81 b Fj(Read)29 b(elemen)m(ts)i(from)e(an)g(ASCI)s(I)f(or)i(binary)f (table)h(column)f(\(in)h(the)f(CDU\).)i(These)e(routines)g(return)g (the)227 2909 y(v)-5 b(alues)30 b(of)g(the)g(table)h(column)f(arra)m(y) g(elemen)m(ts.)42 b(Unde\014ned)28 b(arra)m(y)j(elemen)m(ts)g(will)f(b) s(e)f(returned)g(with)h(a)227 3022 y(v)-5 b(alue)30 b(=)e(n)m(ulv)-5 b(al,)30 b(unless)e(n)m(ulv)-5 b(al)29 b(=)f(0)i(\(or)f(=)f(')h(')g (for)g(\013gcvs\))g(in)g(whic)m(h)f(case)i(no)f(c)m(hec)m(king)i(for)d (unde\014ned)227 3135 y(v)-5 b(alues)28 b(will)g(b)s(e)f(p)s(erformed.) 38 b(The)27 b(an)m(yn)m(ul)h(parameter)g(is)g(set)g(to)g(true)f(if)h (an)m(y)g(of)f(the)h(returned)f(elemen)m(ts)227 3247 y(are)k(unde\014ned.)95 3505 y Fe(int)47 b(fits_read_col_str)c(/)48 b(ffgcvs)286 3618 y(\(fitsfile)e(*fptr,)g(int)h(colnum,)e(LONGLONG)h (firstrow,)f(LONGLONG)h(firstelem,)334 3731 y(LONGLONG)g(nelements,)f (char)h(*nulstr,)g(>)h(char)g(**array,)e(int)i(*anynul,)334 3844 y(int)g(*status\))95 4070 y(int)g(fits_read_col_[log,byt,sht)o (,us)o(ht,i)o(nt,u)o(int)o(,lng)o(,uln)o(g,)41 b(lnglng,)46 b(ulnglng,)g(flt,)g(dbl,)h(cmp,)g(dblcmp])e(/)286 4183 y(ffgcv[l,b,i,ui,k,uk,j,uj,j)o(j,u)o(jj,e)o(,d,c)o(,m])286 4295 y(\(fitsfile)h(*fptr,)g(int)h(colnum,)e(LONGLONG)h(firstrow,)f (LONGLONG)h(firstelem,)334 4408 y(LONGLONG)g(nelements,)f(DTYPE)h (nulval,)g(>)h(DTYPE)g(*array,)e(int)i(*anynul,)334 4521 y(int)g(*status\))0 4779 y Fi(2)81 b Fj(Read)39 b(elemen)m(ts)i(and)e (n)m(ull)h(\015ags)g(from)f(an)g(ASCI)s(I)g(or)g(binary)g(table)i (column)e(\(in)h(the)g(CHDU\).)g(These)227 4892 y(routines)29 b(return)e(the)i(v)-5 b(alues)29 b(of)g(the)g(table)h(column)e(arra)m (y)i(elemen)m(ts.)41 b(An)m(y)29 b(unde\014ned)d(arra)m(y)k(elemen)m (ts)227 5005 y(will)k(ha)m(v)m(e)h(the)f(corresp)s(onding)e(n)m (ullarra)m(y)i(elemen)m(t)h(set)f(equal)g(to)g(TR)m(UE.)g(The)f(an)m (yn)m(ul)h(parameter)g(is)227 5118 y(set)d(to)g(true)f(if)h(an)m(y)g (of)f(the)h(returned)e(elemen)m(ts)j(are)e(unde\014ned.)95 5375 y Fe(int)47 b(fits_read_colnull_str)42 b(/)48 b(ffgcfs)286 5488 y(\(fitsfile)e(*fptr,)g(int)h(colnum,)e(LONGLONG)h(firstrow,)f (LONGLONG)h(firstelem,)334 5601 y(LONGLONG)g(nelements,)f(>)i(char)g (**array,)e(char)i(*nullarray,)e(int)i(*anynul,)334 5714 y(int)g(*status\))p eop end %%Page: 120 128 TeXDict begin 120 127 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.120) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(120)958 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)95 668 y Fe(int)47 b (fits_read_colnull_[log,byt)o(,sh)o(t,us)o(ht,i)o(nt,)o(uint)o(,lng)o (,ul)o(ng,l)o(ngln)o(g,u)o(lngl)o(ng,f)o(lt,)o(dbl,)o(cmp,)o(dbl)o (cmp])41 b(/)286 781 y(ffgcf[l,b,i,ui,k,uk,j,uj,j)o(j,u)o(jj,e)o(,d,c)o (,m])286 894 y(\(fitsfile)46 b(*fptr,)g(int)h(colnum,)e(LONGLONG)h (firstrow,)334 1007 y(LONGLONG)g(firstelem,)f(LONGLONG)g(nelements,)g (>)j(DTYPE)e(*array,)334 1120 y(char)h(*nullarray,)d(int)j(*anynul,)f (int)h(*status\))0 1384 y Fi(3)81 b Fj(Read)24 b(an)g(arbitrary)g(data) h(subsection)f(from)g(an)g(N-dimensional)h(arra)m(y)g(in)f(a)g(binary)g (table)h(v)m(ector)h(column.)227 1497 y(Unde\014ned)21 b(pixels)i(in)f(the)h(arra)m(y)g(will)g(b)s(e)f(set)h(equal)h(to)f(the) g(v)-5 b(alue)23 b(of)g('n)m(ulv)-5 b(al',)25 b(unless)d(n)m(ulv)-5 b(al=0)23 b(in)f(whic)m(h)227 1610 y(case)37 b(no)e(testing)h(for)f (unde\014ned)e(pixels)i(will)h(b)s(e)f(p)s(erformed.)53 b(The)35 b(\014rst)g(and)f(last)i(ro)m(ws)g(in)f(the)g(table)227 1722 y(to)30 b(b)s(e)e(read)h(are)g(sp)s(eci\014ed)g(b)m(y)g (fpixel\(naxis+1\))g(and)g(lpixel\(naxis+1\),)i(and)d(hence)h(are)h (treated)g(as)f(the)227 1835 y(next)38 b(higher)f(dimension)g(of)h(the) f(FITS)g(N-dimensional)h(arra)m(y)-8 b(.)63 b(The)37 b(INC)h(parameter)g(sp)s(eci\014es)f(the)227 1948 y(sampling)31 b(in)m(terv)-5 b(al)31 b(in)f(eac)m(h)i(dimension)e(b)s(et)m(w)m(een)h (the)f(data)h(elemen)m(ts)h(that)f(will)g(b)s(e)e(returned.)95 2212 y Fe(int)47 b(fits_read_subset_[byt,)42 b(sht,)47 b(usht,)f(int,)h(uint,)f(lng,)h(ulng,)f(lnglng,)g(ulnglng,)f(flt,)i (dbl])g(/)286 2325 y(ffgsv[b,i,ui,k,uk,j,uj,jj,)o(ull)o(,e,d)o(])286 2438 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(int)i(naxis,)f(long)h (*naxes,)f(long)h(*fpixel,)334 2551 y(long)g(*lpixel,)e(long)i(*inc,)f (DTYPE)h(nulval,)e(>)j(DTYPE)e(*array,)g(int)h(*anynul,)334 2664 y(int)g(*status\))0 2928 y Fi(4)81 b Fj(Read)24 b(an)g(arbitrary)g(data)h(subsection)f(from)g(an)g(N-dimensional)h (arra)m(y)g(in)f(a)g(binary)g(table)h(v)m(ector)h(column.)227 3041 y(An)m(y)34 b(Unde\014ned)e(pixels)i(in)g(the)f(arra)m(y)i(will)f (ha)m(v)m(e)h(the)f(corresp)s(onding)e('n)m(ullarra)m(y')j(elemen)m(t)g (set)f(equal)227 3154 y(to)40 b(TR)m(UE.)e(The)h(\014rst)e(and)h(last)i (ro)m(ws)e(in)h(the)f(table)i(to)f(b)s(e)f(read)h(are)g(sp)s(eci\014ed) e(b)m(y)i(fpixel\(naxis+1\))227 3267 y(and)i(lpixel\(naxis+1\),)47 b(and)41 b(hence)h(are)g(treated)g(as)g(the)g(next)g(higher)g (dimension)f(of)h(the)g(FITS)f(N-)227 3379 y(dimensional)i(arra)m(y)-8 b(.)78 b(The)41 b(INC)h(parameter)h(sp)s(eci\014es)f(the)h(sampling)f (in)m(terv)-5 b(al)44 b(in)e(eac)m(h)i(dimension)227 3492 y(b)s(et)m(w)m(een)31 b(the)g(data)g(elemen)m(ts)h(that)f(will)f (b)s(e)g(returned.)95 3756 y Fe(int)47 b(fits_read_subsetnull_[byt,)41 b(sht,)47 b(usht,)f(int,)h(uint,)f(lng,)h(ulng,)f(lnglng,)g(ulnglng,)f (flt,)i(dbl])g(/)286 3869 y(ffgsf[b,i,ui,k,uk,j,uj,jj,)o(ujj)o(,e,d)o (])286 3982 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(int)i(naxis,)f (long)h(*naxes,)334 4095 y(long)g(*fpixel,)e(long)i(*lpixel,)e(long)i (*inc,)f(>)i(DTYPE)e(*array,)334 4208 y(char)h(*nullarray,)d(int)j (*anynul,)f(int)h(*status\))0 4472 y Fi(5)81 b Fj(Read)35 b(bit)g(v)-5 b(alues)35 b(from)g(a)g(b)m(yte)h(\('B'\))g(or)f(bit)g (\(`X`\))h(table)g(column)f(\(in)g(the)g(CDU\).)h(Larra)m(y)g(is)f(an)f (arra)m(y)227 4585 y(of)g(logical)i(v)-5 b(alues)34 b(corresp)s(onding) f(to)h(the)g(sequence)g(of)g(bits)g(to)g(b)s(e)f(read.)51 b(If)33 b(larra)m(y)h(is)g(true)f(then)h(the)227 4698 y(corresp)s(onding)i(bit)h(w)m(as)g(set)h(to)f(1,)j(otherwise)d(the)g (bit)g(w)m(as)g(set)h(to)f(0.)61 b(The)37 b('X')g(column)g(in)f(a)i (FITS)227 4811 y(table)e(is)e(alw)m(a)m(ys)i(padded)e(out)h(to)g(a)g(m) m(ultiple)g(of)g(8)g(bits)f(where)g(the)h(bit)g(arra)m(y)g(starts)g (with)f(the)h(most)227 4924 y(signi\014can)m(t)j(bit)e(of)h(the)g(b)m (yte)g(and)f(w)m(orks)g(do)m(wn)h(to)m(w)m(ards)g(the)g(1's)g(bit.)59 b(F)-8 b(or)37 b(example,)i(a)e('4X')h(arra)m(y)-8 b(,)227 5036 y(with)33 b(the)h(\014rst)e(bit)i(=)f(1)h(and)e(the)i(remaining)f (3)h(bits)f(=)g(0)h(is)f(equiv)-5 b(alen)m(t)35 b(to)f(the)g(8-bit)g (unsigned)e(b)m(yte)227 5149 y(v)-5 b(alue)31 b(of)f(128.)42 b(Note)31 b(that)g(in)e(the)i(case)g(of)f('X')g(columns,)g(CFITSIO)f (can)h(read)g(all)h(8)f(bits)g(of)g(eac)m(h)h(b)m(yte)227 5262 y(whether)h(they)h(are)g(formally)g(v)-5 b(alid)33 b(or)f(not.)48 b(Th)m(us)31 b(if)i(the)f(column)h(is)f(de\014ned)f(as)i ('4X',)h(and)e(one)h(calls)227 5375 y(\013gcx)d(with)f(\014rstbit=1)f (and)h(n)m(bits=8,)g(then)g(all)h(8)f(bits)g(will)g(b)s(e)g(read)g (from)f(the)h(\014rst)g(b)m(yte)g(\(as)h(opp)s(osed)227 5488 y(to)39 b(reading)f(the)g(\014rst)g(4)g(bits)g(from)g(the)g (\014rst)f(ro)m(w)h(and)g(then)f(the)i(\014rst)e(4)h(bits)g(from)g(the) g(next)g(ro)m(w\),)227 5601 y(ev)m(en)g(though)f(the)g(last)i(4)e(bits) g(of)h(eac)m(h)g(b)m(yte)g(are)f(formally)h(not)g(de\014ned.)60 b(It)37 b(should)f(also)i(b)s(e)f(noted)227 5714 y(that)f(it)f(is)h (more)f(e\016cien)m(t)h(to)g(read)f('X')h(columns)e(an)h(en)m(tire)h(b) m(yte)g(at)g(a)f(time,)i(instead)e(of)h(bit)f(b)m(y)g(bit.)p eop end %%Page: 121 129 TeXDict begin 121 128 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.121) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(9.6.)72 b(SPECIALIZED)29 b(FITS)g(ASCI)s(I)g(AND)i(BINAR)-8 b(Y)32 b(T)-8 b(ABLE)30 b(R)m(OUTINES)933 b Fj(121)227 555 y(An)m(y)29 b(of)g(the)h(CFITSIO)d(routines)i(that)g(read)g(columns)g(\(e.g.)42 b(\014ts)p 2520 555 28 4 v 32 w(read)p 2724 555 V 33 w(col)p 2867 555 V 34 w(b)m(yt\))29 b(ma)m(y)h(b)s(e)e(used)g(for)h (this)227 668 y(purp)s(ose.)60 b(These)36 b(routines)i(will)f(in)m (terpret)h('X')f(columns)g(as)g(though)g(they)h(w)m(ere)f('B')h (columns)f(\(e.g.,)227 781 y('8X')32 b(is)e(equiv)-5 b(alen)m(t)32 b(to)f('1B',)h(and)e('16X')i(is)e(equiv)-5 b(alen)m(t)32 b(to)f('2B'\).)95 1041 y Fe(int)47 b(fits_read_col_bit)c (/)48 b(ffgcx)286 1154 y(\(fitsfile)e(*fptr,)g(int)h(colnum,)e (LONGLONG)h(firstrow,)f(LONGLONG)h(firstbit,)334 1267 y(LONGLONG)g(nbits,)g(>)h(char)g(*larray,)e(int)i(*status\))0 1526 y Fi(6)81 b Fj(Read)31 b(an)m(y)h(consecutiv)m(e)i(set)e(of)g (bits)f(from)h(an)f('X')h(or)g('B')h(column)e(and)g(in)m(terpret)h (them)g(as)f(an)h(unsigned)227 1639 y(n-bit)h(in)m(teger.)48 b(n)m(bits)33 b(m)m(ust)f(b)s(e)g(less)h(than)g(16)g(or)g(32)g(in)f (\013gcxui)i(and)d(\013gcxuk,)j(resp)s(ectiv)m(ely)-8 b(.)49 b(If)32 b(nro)m(ws)227 1752 y(is)c(greater)h(than)f(1,)h(then)e (the)h(same)h(set)f(of)g(bits)g(will)g(b)s(e)f(read)h(from)f(eac)m(h)i (ro)m(w,)g(starting)g(with)e(\014rstro)m(w.)227 1865 y(The)j(bits)g(are)h(n)m(um)m(b)s(ered)e(with)h(1)h(=)f(the)h(most)f (signi\014can)m(t)i(bit)e(of)h(the)f(\014rst)g(elemen)m(t)i(of)e(the)h (column.)95 2125 y Fe(int)47 b(fits_read_col_bit_[usht,)42 b(uint])k(/)h(ffgcx[ui,uk])286 2238 y(\(fitsfile)f(*fptr,)g(int)h (colnum,)e(LONGLONG)h(firstrow,)f(LONGLONG,)h(nrows,)334 2351 y(long)h(firstbit,)e(long)i(nbits,)f(>)h(DTYPE)g(*array,)e(int)i (*status\))0 2611 y Fi(7)81 b Fj(Return)27 b(the)i(descriptor)f(for)h (a)g(v)-5 b(ariable)29 b(length)g(column)f(in)h(a)g(binary)e(table.)41 b(The)28 b(descriptor)h(consists)g(of)227 2723 y(2)j(in)m(teger)g (parameters:)42 b(the)31 b(n)m(um)m(b)s(er)f(of)h(elemen)m(ts)i(in)d (the)h(arra)m(y)h(and)e(the)h(starting)h(o\013set)g(relativ)m(e)h(to) 227 2836 y(the)c(start)h(of)e(the)h(heap.)40 b(The)29 b(\014rst)f(pair)g(of)h(routine)g(returns)e(a)i(single)h(descriptor)e (whereas)h(the)g(second)227 2949 y(pair)34 b(of)h(routine)f(returns)g (the)g(descriptors)g(for)g(a)h(range)g(of)f(ro)m(ws)h(in)f(the)g (table.)54 b(The)34 b(only)g(di\013erence)227 3062 y(b)s(et)m(w)m(een) 42 b(the)f(2)g(routines)f(in)h(eac)m(h)h(pair)e(is)h(that)g(one)g (returns)f(the)h(parameters)g(as)g('long')g(in)m(tegers,)227 3175 y(whereas)30 b(the)h(other)g(returns)e(the)h(v)-5 b(alues)31 b(as)g(64-bit)g('LONGLONG')g(in)m(tegers.)95 3435 y Fe(int)47 b(fits_read_descript)c(/)48 b(ffgdes)286 3548 y(\(fitsfile)e(*fptr,)g(int)h(colnum,)e(LONGLONG)h(rownum,)g(>)h (long)g(*repeat,)525 3661 y(long)g(*offset,)e(int)i(*status\))95 3886 y(int)g(fits_read_descriptll)c(/)k(ffgdesll)286 3999 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(LONGLONG)h(rownum,)g(>)h (LONGLONG)f(*repeat,)525 4112 y(LONGLONG)g(*offset,)f(int)i(*status\)) 95 4338 y(int)g(fits_read_descripts)c(/)k(ffgdess)286 4451 y(\(fitsfile)f(*fptr,)g(int)h(colnum,)e(LONGLONG)h(firstrow,)f (LONGLONG)h(nrows)334 4564 y(>)i(long)e(*repeat,)g(long)g(*offset,)g (int)h(*status\))95 4790 y(int)g(fits_read_descriptsll)42 b(/)48 b(ffgdessll)286 4903 y(\(fitsfile)e(*fptr,)g(int)h(colnum,)e (LONGLONG)h(firstrow,)f(LONGLONG)h(nrows)334 5016 y(>)i(LONGLONG)d (*repeat,)h(LONGLONG)f(*offset,)h(int)h(*status\))p eop end %%Page: 122 130 TeXDict begin 122 129 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.122) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(122)958 b Fh(CHAPTER)30 b(9.)112 b(SPECIALIZED)28 b(CFITSIO)h(INTERF)-10 b(A)m(CE)30 b(R)m(OUTINES)p eop end %%Page: 123 131 TeXDict begin 123 130 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.123) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.10) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(10)0 1687 y Fm(Extended)77 b(File)g(Name)g(Syn)-6 b(tax)0 2060 y SDict begin H.S end 0 2060 a 0 2060 a SDict begin 13.6 H.A end 0 2060 a 0 2060 a SDict begin [/View [/XYZ H.V]/Dest (section.10.1) cvn /DEST pdfmark end 0 2060 a 156 x Ff(10.1)136 b(Ov)l(erview)0 2466 y Fj(CFITSIO)30 b(supp)s(orts)f(an)j (extended)f(syn)m(tax)h(when)f(sp)s(ecifying)g(the)h(name)f(of)h(the)g (data)g(\014le)f(to)h(b)s(e)f(op)s(ened)g(or)0 2579 y(created)g(that)g (includes)f(the)h(follo)m(wing)h(features:)136 2813 y Fc(\017)46 b Fj(CFITSIO)40 b(can)i(read)f(IRAF)h(format)g(images)g (whic)m(h)f(ha)m(v)m(e)i(header)e(\014le)h(names)f(that)h(end)f(with)g (the)227 2926 y('.imh')d(extension,)i(as)e(w)m(ell)g(as)g(reading)f (and)g(writing)g(FITS)g(\014les,)i(This)e(feature)h(is)f(implemen)m (ted)h(in)227 3039 y(CFITSIO)29 b(b)m(y)i(\014rst)e(con)m(v)m(erting)k (the)d(IRAF)h(image)h(in)m(to)f(a)g(temp)s(orary)f(FITS)g(format)h (\014le)f(in)g(memory)-8 b(,)227 3152 y(then)35 b(op)s(ening)f(the)h (FITS)f(\014le.)54 b(An)m(y)35 b(of)g(the)g(usual)f(CFITSIO)g(routines) g(then)h(ma)m(y)g(b)s(e)f(used)g(to)i(read)227 3265 y(the)31 b(image)g(header)f(or)h(data.)41 b(Similarly)-8 b(,)31 b(ra)m(w)f(binary)g(data)h(arra)m(ys)f(can)h(b)s(e)f(read)g(b)m(y)g (con)m(v)m(erting)i(them)227 3378 y(on)f(the)f(\015y)g(in)m(to)h (virtual)g(FITS)f(images.)136 3557 y Fc(\017)46 b Fj(FITS)f(\014les)h (on)f(the)h(In)m(ternet)g(can)g(b)s(e)f(read)g(\(and)g(sometimes)i (written\))f(using)f(the)h(FTP)-8 b(,)46 b(HTTP)-8 b(,)227 3670 y(HTTPS,)30 b(FTPS,)g(or)g(R)m(OOT)g(proto)s(cols.)136 3849 y Fc(\017)46 b Fj(FITS)30 b(\014les)g(can)h(b)s(e)f(pip)s(ed)f(b)s (et)m(w)m(een)i(tasks)f(on)h(the)f(stdin)g(and)g(stdout)g(streams.)136 4028 y Fc(\017)46 b Fj(FITS)36 b(\014les)h(can)g(b)s(e)f(read)h(and)f (written)h(in)g(shared)f(memory)-8 b(.)60 b(This)36 b(can)h(p)s(oten)m (tially)i(ac)m(hiev)m(e)g(b)s(etter)227 4141 y(data)26 b(I/O)e(p)s(erformance)g(compared)h(to)h(reading)f(and)f(writing)g(the) h(same)h(FITS)e(\014les)g(on)h(magnetic)h(disk.)136 4320 y Fc(\017)46 b Fj(Compressed)30 b(FITS)f(\014les)i(in)f(gzip)h(or)f (Unix)g(COMPRESS)f(format)h(can)h(b)s(e)f(directly)h(read.)136 4499 y Fc(\017)46 b Fj(Output)28 b(FITS)h(\014les)g(can)g(b)s(e)g (written)g(directly)h(in)e(compressed)h(gzip)h(format,)g(th)m(us)e(sa)m (ving)i(disk)f(space.)136 4678 y Fc(\017)46 b Fj(FITS)26 b(table)h(columns)f(can)h(b)s(e)f(created,)i(mo)s(di\014ed,)f(or)f (deleted)h('on-the-\015y')g(as)g(the)g(table)g(is)f(op)s(ened)g(b)m(y) 227 4791 y(CFITSIO.)32 b(This)h(creates)i(a)e(virtual)h(FITS)f(\014le)g (con)m(taining)i(the)f(mo)s(di\014cations)f(that)h(is)g(then)f(op)s (ened)227 4904 y(b)m(y)e(the)f(application)i(program.)136 5083 y Fc(\017)46 b Fj(T)-8 b(able)29 b(ro)m(ws)e(ma)m(y)i(b)s(e)e (selected,)j(or)e(\014ltered)g(out,)g(on)g(the)g(\015y)f(when)g(the)h (table)h(is)f(op)s(ened)f(b)m(y)g(CFITSIO,)227 5196 y(based)22 b(on)f(an)g(user-sp)s(eci\014ed)g(expression.)38 b(Only)21 b(ro)m(ws)g(for)g(whic)m(h)h(the)g(expression)f(ev)-5 b(aluates)23 b(to)f('TR)m(UE')227 5309 y(are)31 b(retained)g(in)f(the)g (cop)m(y)i(of)e(the)h(table)g(that)g(is)f(op)s(ened)g(b)m(y)g(the)h (application)g(program.)136 5488 y Fc(\017)46 b Fj(Histogram)28 b(images)g(ma)m(y)f(b)s(e)f(created)h(on)f(the)h(\015y)f(b)m(y)g (binning)g(the)g(v)-5 b(alues)27 b(in)f(table)i(columns,)f(resulting) 227 5601 y(in)36 b(a)g(virtual)h(N-dimensional)f(FITS)g(image.)59 b(The)35 b(application)i(program)f(then)g(only)g(sees)g(the)h(FITS)227 5714 y(image)32 b(\(in)e(the)h(primary)e(arra)m(y\))j(instead)e(of)h (the)f(original)i(FITS)d(table.)1882 5942 y(123)p eop end %%Page: 124 132 TeXDict begin 124 131 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.124) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(124)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fj(The)39 b(latter)i(3)f(table)h(\014ltering)f(features)g (in)f(particular)h(add)f(v)m(ery)h(p)s(o)m(w)m(erful)f(data)i(pro)s (cessing)e(capabilities)0 668 y(directly)33 b(in)m(to)g(CFITSIO,)e(and) h(hence)h(in)m(to)g(ev)m(ery)g(task)g(that)g(uses)f(CFITSIO)f(to)i (read)f(or)h(write)f(FITS)g(\014les.)0 781 y(F)-8 b(or)29 b(example,)g(these)f(features)h(transform)e(a)h(v)m(ery)g(simple)g (program)g(that)g(just)g(copies)g(an)g(input)f(FITS)g(\014le)h(to)0 894 y(a)c(new)f(output)h(\014le)g(\(lik)m(e)h(the)f(`\014tscop)m(y')h (program)e(that)i(is)e(distributed)g(with)h(CFITSIO\))e(in)m(to)j(a)f (m)m(ultipurp)s(ose)0 1007 y(FITS)33 b(\014le)g(pro)s(cessing)g(to)s (ol.)51 b(By)33 b(app)s(ending)f(fairly)i(simple)f(quali\014ers)g(on)m (to)h(the)g(name)f(of)h(the)f(input)g(FITS)0 1120 y(\014le,)45 b(the)d(user)f(can)h(p)s(erform)e(quite)i(complex)h(table)f(editing)h (op)s(erations)f(\(e.g.,)k(create)d(new)e(columns,)k(or)0 1233 y(\014lter)32 b(out)h(ro)m(ws)f(in)g(a)g(table\))i(or)e(create)i (FITS)d(images)j(b)m(y)e(binning)f(or)h(histogramming)h(the)g(v)-5 b(alues)32 b(in)g(table)0 1346 y(columns.)47 b(In)32 b(addition,)h(these)g(functions)f(ha)m(v)m(e)i(b)s(een)e(co)s(ded)g (using)g(new)g(state-of-the)j(art)e(algorithms)g(that)0 1458 y(are,)e(in)f(some)h(cases,)g(10)h(-)e(100)i(times)f(faster)g (than)f(previous)g(widely)g(used)f(implemen)m(tations.)0 1619 y(Before)34 b(describing)f(the)h(complete)h(syn)m(tax)f(for)f(the) h(extended)f(FITS)g(\014le)g(names)g(in)g(the)h(next)g(section,)h(here) 0 1732 y(are)c(a)g(few)f(examples)h(of)f(FITS)g(\014le)g(names)h(that)f (giv)m(e)i(a)f(quic)m(k)g(o)m(v)m(erview)h(of)f(the)f(allo)m(w)m(ed)i (syn)m(tax:)136 2005 y Fc(\017)46 b Fe(myfile.fits)p Fj(:)38 b(the)30 b(simplest)h(case)g(of)g(a)g(FITS)e(\014le)i(on)f (disk)g(in)g(the)h(curren)m(t)f(directory)-8 b(.)136 2207 y Fc(\017)46 b Fe(myfile.imh)p Fj(:)i(op)s(ens)34 b(an)h(IRAF)g(format)g(image)i(\014le)e(and)f(con)m(v)m(erts)j(it)e(on) g(the)g(\015y)g(in)m(to)h(a)f(temp)s(orary)227 2320 y(FITS)30 b(format)h(image)g(in)f(memory)h(whic)m(h)f(can)g(then)g(b)s(e)g(read)g (with)g(an)m(y)h(other)g(CFITSIO)e(routine.)136 2521 y Fc(\017)46 b Fe(rawfile.dat[i512,512])p Fj(:)35 b(op)s(ens)30 b(a)g(ra)m(w)h(binary)e(data)i(arra)m(y)g(\(a)g(512)g(x)f(512)i(short)e (in)m(teger)h(arra)m(y)g(in)227 2634 y(this)i(case\))i(and)d(con)m(v)m (erts)j(it)e(on)g(the)g(\015y)g(in)m(to)h(a)f(temp)s(orary)g(FITS)f (format)h(image)i(in)d(memory)h(whic)m(h)227 2747 y(can)e(then)f(b)s(e) g(read)g(with)g(an)m(y)h(other)f(CFITSIO)f(routine.)136 2948 y Fc(\017)46 b Fe(myfile.fits.gz)p Fj(:)d(if)33 b(this)g(is)g(the)g(name)g(of)h(a)f(new)g(output)g(\014le,)h(the)f ('.gz')i(su\016x)d(will)h(cause)h(it)g(to)g(b)s(e)227 3061 y(compressed)c(in)g(gzip)h(format)g(when)e(it)i(is)g(written)f(to) h(disk.)136 3263 y Fc(\017)46 b Fe(myfile.fits.gz[events,)c(2])p Fj(:)35 b(op)s(ens)20 b(and)f(uncompresses)g(the)i(gzipp)s(ed)f(\014le) g(m)m(y\014le.\014ts)h(then)f(mo)m(v)m(es)227 3376 y(to)31 b(the)g(extension)g(with)f(the)h(k)m(eyw)m(ords)f(EXTNAME)h(=)f ('EVENTS')g(and)g(EXTVER)g(=)g(2.)136 3577 y Fc(\017)46 b Fe(-)p Fj(:)40 b(a)30 b(dash)f(\(min)m(us)g(sign\))h(signi\014es)g (that)g(the)g(input)f(\014le)g(is)h(to)g(b)s(e)f(read)h(from)f(the)h (stdin)f(\014le)h(stream,)g(or)227 3690 y(that)d(the)g(output)f(\014le) h(is)f(to)h(b)s(e)f(written)h(to)g(the)g(stdout)f(stream.)40 b(See)27 b(also)g(the)g(stream://)h(driv)m(er)e(whic)m(h)227 3803 y(pro)m(vides)37 b(a)f(more)h(e\016cien)m(t,)i(but)d(more)g (restricted)h(metho)s(d)f(of)h(reading)f(or)g(writing)h(to)g(the)f (stdin)g(or)227 3916 y(stdout)31 b(streams.)136 4117 y Fc(\017)46 b Fe(ftp://legacy.gsfc.nasa.go)o(v/te)o(st/v)o(ela)o(.fit) o(s)p Fj(:)k(FITS)37 b(\014les)h(in)g(an)m(y)h(ftp)e(arc)m(hiv)m(e)j (site)f(on)f(the)227 4230 y(In)m(ternet)31 b(ma)m(y)g(b)s(e)f(directly) h(op)s(ened)e(with)h(read-only)h(access.)136 4432 y Fc(\017)46 b Fe(http://legacy.gsfc.nasa.g)o(ov/s)o(oftw)o(are)o(/tes)o(t.fi)o(ts)p Fj(:)33 b(an)m(y)27 b(v)-5 b(alid)28 b(URL)f(to)h(a)g(FITS)e(\014le)i (on)f(the)227 4545 y(W)-8 b(eb)31 b(ma)m(y)g(b)s(e)f(op)s(ened)g(with)g (read-only)g(access.)136 4746 y Fc(\017)46 b Fe (root://legacy.gsfc.nasa.g)o(ov/t)o(est/)o(vel)o(a.fi)o(ts)p Fj(:)e(similar)36 b(to)g(ftp)f(access)i(except)f(that)g(it)g(pro-)227 4859 y(vides)30 b(write)h(as)f(w)m(ell)h(as)g(read)f(access)h(to)g(the) f(\014les)h(across)f(the)h(net)m(w)m(ork.)41 b(This)29 b(uses)h(the)h(ro)s(ot)f(proto)s(col)227 4972 y(dev)m(elop)s(ed)h(at)g (CERN.)136 5174 y Fc(\017)46 b Fe(shmem://h2[events])p Fj(:)j(op)s(ens)36 b(the)i(FITS)e(\014le)h(in)g(a)g(shared)f(memory)h (segmen)m(t)h(and)f(mo)m(v)m(es)h(to)g(the)227 5287 y(EVENTS)30 b(extension.)136 5488 y Fc(\017)46 b Fe(mem://)p Fj(:)65 b(creates)44 b(a)g(scratc)m(h)g(output)f(\014le)g(in)g(core)h(computer) f(memory)-8 b(.)79 b(The)43 b(resulting)g('\014le')h(will)227 5601 y(disapp)s(ear)25 b(when)f(the)i(program)f(exits,)i(so)f(this)f (is)h(mainly)f(useful)g(for)g(testing)i(purp)s(oses)c(when)i(one)g(do)s (es)227 5714 y(not)31 b(w)m(an)m(t)g(a)g(p)s(ermanen)m(t)f(cop)m(y)h (of)f(the)h(output)f(\014le.)p eop end %%Page: 125 133 TeXDict begin 125 132 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.125) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.1.)73 b(O)m(VER)-10 b(VIEW)2995 b Fj(125)136 555 y Fc(\017)46 b Fe(myfile.fits[3;)e(Images\(10\)])p Fj(:)c(op)s(ens)30 b(a)i(cop)m(y)g(of)g(the)g(image)g(con)m(tained)h(in)e(the)h(10th)g(ro) m(w)f(of)h(the)227 668 y('Images')38 b(column)f(in)g(the)g(binary)f (table)i(in)e(the)h(3th)g(extension)h(of)f(the)g(FITS)f(\014le.)60 b(The)37 b(virtual)g(\014le)227 781 y(that)31 b(is)g(op)s(ened)e(b)m(y) i(the)f(application)i(just)e(con)m(tains)h(this)f(single)h(image)h(in)e (the)h(primary)e(arra)m(y)-8 b(.)136 973 y Fc(\017)46 b Fe(myfile.fits[1:512:2,)d(1:512:2])p Fj(:)c(op)s(ens)30 b(a)h(section)h(of)g(the)f(input)f(image)i(ranging)f(from)f(the)h(1st) 227 1086 y(to)k(the)f(512th)h(pixel)f(in)g(X)g(and)g(Y,)g(and)f (selects)j(ev)m(ery)e(second)g(pixel)h(in)e(b)s(oth)g(dimensions,)i (resulting)227 1198 y(in)30 b(a)h(256)h(x)e(256)i(pixel)e(input)g (image)h(in)g(this)f(case.)136 1390 y Fc(\017)46 b Fe (myfile.fits[EVENTS][col)c(Rad)47 b(=)g(sqrt\(X**2)e(+)j(Y**2\)])p Fj(:)36 b(creates)27 b(and)d(op)s(ens)h(a)g(virtual)h(\014le)f(on)227 1503 y(the)h(\015y)f(that)i(is)f(iden)m(tical)h(to)g(m)m (y\014le.\014ts)f(except)g(that)h(it)f(will)g(con)m(tain)h(a)f(new)g (column)f(in)h(the)g(EVENTS)227 1616 y(extension)41 b(called)h('Rad')f (whose)f(v)-5 b(alue)41 b(is)g(computed)f(using)h(the)f(indicated)h (expression)g(whic)m(h)f(is)h(a)227 1729 y(function)30 b(of)h(the)f(v)-5 b(alues)31 b(in)f(the)h(X)f(and)g(Y)h(columns.)136 1920 y Fc(\017)46 b Fe(myfile.fits[EVENTS][PHA)c(>)47 b(5])p Fj(:)41 b(creates)33 b(and)d(op)s(ens)g(a)i(virtual)f(FITS)f (\014les)h(that)g(is)g(iden)m(tical)i(to)227 2033 y('m)m (y\014le.\014ts')40 b(except)h(that)f(the)f(EVENTS)g(table)h(will)g (only)f(con)m(tain)i(the)e(ro)m(ws)h(that)g(ha)m(v)m(e)g(v)-5 b(alues)40 b(of)227 2146 y(the)34 b(PHA)g(column)g(greater)h(than)e(5.) 52 b(In)33 b(general,)j(an)m(y)e(arbitrary)g(b)s(o)s(olean)f (expression)h(using)f(a)i(C)e(or)227 2259 y(F)-8 b(ortran-lik)m(e)31 b(syn)m(tax,)e(whic)m(h)f(ma)m(y)h(com)m(bine)g(AND)g(and)f(OR)f(op)s (erators,)i(ma)m(y)g(b)s(e)f(used)f(to)i(select)h(ro)m(ws)227 2372 y(from)g(a)h(table.)136 2564 y Fc(\017)46 b Fe (myfile.fits[EVENTS][bin)c(\(X,Y\)=1,2048,4])p Fj(:)34 b(creates)26 b(a)g(temp)s(orary)f(FITS)g(primary)f(arra)m(y)i(im-)227 2677 y(age)38 b(whic)m(h)e(is)h(computed)f(on)g(the)h(\015y)f(b)m(y)g (binning)f(\(i.e,)40 b(computing)c(the)h(2-dimensional)g(histogram\)) 227 2789 y(of)d(the)f(v)-5 b(alues)34 b(in)f(the)h(X)g(and)e(Y)i (columns)f(of)h(the)f(EVENTS)g(extension.)50 b(In)33 b(this)g(case)i(the)e(X)h(and)f(Y)227 2902 y(co)s(ordinates)h(range)g (from)f(1)h(to)g(2048)h(and)e(the)h(image)g(pixel)g(size)g(is)g(4)f (units)g(in)g(b)s(oth)g(dimensions,)h(so)227 3015 y(the)d(resulting)f (image)i(is)e(512)i(x)e(512)i(pixels)f(in)f(size.)136 3207 y Fc(\017)46 b Fj(The)31 b(\014nal)g(example)i(com)m(bines)f(man)m (y)f(of)h(these)g(feature)g(in)m(to)g(one)g(complex)g(expression)f (\(it)i(is)e(brok)m(en)227 3320 y(in)m(to)h(sev)m(eral)f(lines)g(for)f (clarit)m(y\):)370 3576 y Fe(ftp://legacy.gsfc.nasa.gov)o(/dat)o(a/s)o (ampl)o(e.fi)o(ts.)o(gz[E)o(VENT)o(S])370 3689 y([col)47 b(phacorr)f(=)h(pha)g(*)h(1.1)f(-)g(0.3][phacorr)e(>=)i(5.0)g(&&)g (phacorr)f(<=)h(14.0])370 3801 y([bin)g(\(X,Y\)=32])227 4057 y Fj(In)37 b(this)h(case,)j(CFITSIO)36 b(\(1\))j(copies)g(and)e (uncompresses)g(the)h(FITS)f(\014le)h(from)f(the)h(ftp)f(site)i(on)f (the)227 4170 y(legacy)g(mac)m(hine,)h(\(2\))e(mo)m(v)m(es)g(to)g(the)g ('EVENTS')f(extension,)i(\(3\))f(calculates)i(a)d(new)g(column)g (called)227 4283 y('phacorr',)30 b(\(4\))f(selects)h(the)f(ro)m(ws)g (in)f(the)h(table)h(that)f(ha)m(v)m(e)h(phacorr)e(in)g(the)h(range)g(5) g(to)h(14,)g(and)e(\014nally)227 4396 y(\(5\))35 b(bins)d(the)h (remaining)g(ro)m(ws)g(on)h(the)f(X)g(and)g(Y)g(column)g(co)s (ordinates,)i(using)d(a)i(pixel)f(size)h(=)f(32)h(to)227 4509 y(create)d(a)f(2D)g(image.)42 b(All)30 b(this)f(pro)s(cessing)g (is)h(completely)h(transparen)m(t)e(to)i(the)e(application)i(program,) 227 4622 y(whic)m(h)f(simply)g(sees)h(the)g(\014nal)f(2-D)h(image)h(in) e(the)g(primary)g(arra)m(y)h(of)f(the)h(op)s(ened)f(\014le.)0 4886 y(The)c(full)h(extended)g(CFITSIO)e(FITS)h(\014le)h(name)g(can)g (con)m(tain)h(sev)m(eral)g(di\013eren)m(t)g(comp)s(onen)m(ts)f(dep)s (ending)e(on)0 4998 y(the)31 b(con)m(text.)42 b(These)30 b(comp)s(onen)m(ts)h(are)g(describ)s(ed)e(in)h(the)g(follo)m(wing)i (sections:)0 5262 y Fe(When)47 b(creating)e(a)j(new)f(file:)143 5375 y(filetype://BaseFilename\(t)o(empl)o(ate)o(Name)o(\)[co)o(mpr)o (ess])0 5601 y(When)g(opening)e(an)j(existing)d(primary)h(array)g(or)i (image)e(HDU:)143 5714 y(filetype://BaseFilename\(o)o(utNa)o(me\))o ([HDU)o(loca)o(tio)o(n][I)o(mage)o(Sec)o(tion)o(][pi)o(xFi)o(lter)o(])p eop end %%Page: 126 134 TeXDict begin 126 133 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.126) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(126)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 668 y Fe(When)47 b(opening)e(an)j(existing)d(table)i(HDU:)143 781 y(filetype://BaseFilename\(o)o(utNa)o(me\))o([HDU)o(loca)o(tio)o (n][c)o(olFi)o(lte)o(r][r)o(owFi)o(lte)o(r][b)o(inSp)o(ec])0 991 y Fj(The)35 b(\014let)m(yp)s(e,)j(BaseFilename,)h(outName,)g(HDUlo) s(cation,)g(ImageSection,)g(and)c(pixFilter)i(comp)s(onen)m(ts,)g(if)0 1104 y(presen)m(t,)27 b(m)m(ust)f(b)s(e)g(giv)m(en)h(in)f(that)g (order,)h(but)e(the)i(colFilter,)i(ro)m(wFilter,)g(and)c(binSp)s(ec)g (sp)s(eci\014ers)g(ma)m(y)i(follo)m(w)0 1217 y(in)j(an)m(y)h(order.)42 b(Regardless)31 b(of)g(the)g(order,)f(ho)m(w)m(ev)m(er,)i(the)f (colFilter)i(sp)s(eci\014er,)e(if)f(presen)m(t,)h(will)g(b)s(e)f(pro)s (cessed)0 1330 y(\014rst)g(b)m(y)g(CFITSIO,)f(follo)m(w)m(ed)j(b)m(y)e (the)h(ro)m(wFilter)h(sp)s(eci\014er,)e(and)f(\014nally)i(b)m(y)f(the)g (binSp)s(ec)f(sp)s(eci\014er.)0 1477 y SDict begin H.S end 0 1477 a 0 1477 a SDict begin 13.6 H.A end 0 1477 a 0 1477 a SDict begin [/View [/XYZ H.V]/Dest (section.10.2) cvn /DEST pdfmark end 0 1477 a 179 x Ff(10.2)136 b(Filet)l(yp)t(e)0 1906 y Fj(The)37 b(t)m(yp)s(e)g(of)g(\014le)g(determines)g(the)g (medium)f(on)h(whic)m(h)g(the)g(\014le)g(is)h(lo)s(cated)g(\(e.g.,)i (disk)d(or)g(net)m(w)m(ork\))h(and,)0 2019 y(hence,)f(whic)m(h)e(in)m (ternal)h(device)g(driv)m(er)f(is)g(used)f(b)m(y)h(CFITSIO)f(to)i(read) f(and/or)g(write)g(the)g(\014le.)56 b(Curren)m(tly)0 2132 y(supp)s(orted)29 b(t)m(yp)s(es)h(are)382 2342 y Fe(file://)93 b(-)48 b(file)e(on)i(local)e(magnetic)g(disk)g (\(default\))430 2455 y(ftp://)93 b(-)48 b(a)f(readonly)f(file)g (accessed)g(with)h(the)g(anonymous)e(FTP)i(protocol.)907 2568 y(It)g(also)g(supports)93 b(ftp://username:password@)o(host)o(nam) o(e/..)o(.)907 2681 y(for)47 b(accessing)e(password-protected)e(ftp)k (sites.)382 2794 y(http://)93 b(-)48 b(a)f(readonly)f(file)g(accessed)g (with)h(the)g(HTTP)f(protocol.)93 b(It)907 2907 y(supports)45 b(username:password)e(just)k(like)g(the)g(ftp)g(driver.)907 3020 y(Proxy)f(HTTP)h(servers)f(are)h(supported)e(using)h(the)h (http_proxy)907 3133 y(environment)e(variable)g(\(see)i(following)e (note\).)334 3245 y(https://)93 b(-)48 b(a)f(readonly)f(file)g (accessed)g(with)h(the)g(HTTPS)f(protocol.)93 b(This)907 3358 y(is)47 b(available)e(only)i(if)g(CFITSIO)f(was)h(built)f(with)h (the)g(libcurl)907 3471 y(library)f(\(see)g(the)h(following)e(note\).) 334 3584 y(ftps://)94 b(-)h(a)47 b(readonly)f(file)g(accessed)g(with)h (the)g(FTPS)f(protocol.)93 b(This)907 3697 y(is)47 b(available)e(only)i (if)g(CFITSIO)f(was)h(built)f(with)h(the)g(libcurl)907 3810 y(library.)286 3923 y(stream://)93 b(-)48 b(special)e(driver)g(to) h(read)g(an)g(input)f(FITS)h(file)f(from)h(the)g(stdin)907 4036 y(stream,)f(and/or)g(write)g(an)h(output)f(FITS)h(file)g(to)g(the) g(stdout)143 4149 y(stream.)94 b(This)46 b(driver)g(is)i(fragile)d(and) i(has)g(limited)143 4262 y(functionality)d(\(see)j(the)g(following)e (note\).)286 4375 y(gsiftp://)93 b(-)48 b(access)e(files)g(on)h(a)h (computational)c(grid)j(using)f(the)h(gridftp)907 4487 y(protocol)e(in)j(the)e(Globus)h(toolkit)e(\(see)i(following)e(note\).) 382 4600 y(root://)93 b(-)48 b(uses)e(the)h(CERN)g(root)g(protocol)e (for)i(writing)f(as)h(well)g(as)907 4713 y(reading)f(files)g(over)h (the)g(network)e(\(see)i(following)e(note\).)334 4826 y(shmem://)93 b(-)48 b(opens)e(or)h(creates)f(a)i(file)e(which)h (persists)e(in)i(the)g(computer's)907 4939 y(shared)f(memory)g(\(see)h (following)e(note\).)430 5052 y(mem://)93 b(-)48 b(opens)e(a)i (temporary)d(file)i(in)g(core)f(memory.)94 b(The)47 b(file)907 5165 y(disappears)e(when)h(the)h(program)f(exits)h(so)g(this)f(is)i (mainly)907 5278 y(useful)e(for)h(test)f(purposes)g(when)h(a)g (permanent)e(output)h(file)907 5391 y(is)h(not)g(desired.)0 5601 y Fj(If)35 b(the)h(\014let)m(yp)s(e)g(is)f(not)h(sp)s(eci\014ed,)h (then)e(t)m(yp)s(e)h(\014le://)h(is)e(assumed.)56 b(The)35 b(double)g(slashes)h('//')h(are)f(optional)0 5714 y(and)30 b(ma)m(y)h(b)s(e)e(omitted)j(in)e(most)h(cases.)p eop end %%Page: 127 135 TeXDict begin 127 134 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.127) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.2.)73 b(FILETYPE)3037 b Fj(127)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.2.1) cvn /DEST pdfmark end 0 464 a 91 x Fd(10.2.1)113 b(Notes)36 b(ab)s(out)j(HTTP)d (pro)m(xy)i(serv)m(ers)0 805 y Fj(A)32 b(pro)m(xy)g(HTTP)f(serv)m(er)h (ma)m(y)h(b)s(e)e(used)g(b)m(y)h(de\014ning)f(the)h(address)f(\(URL\))i (and)e(p)s(ort)g(n)m(um)m(b)s(er)g(of)h(the)g(pro)m(xy)0 918 y(serv)m(er)f(with)f(the)g(h)m(ttp)p 801 918 28 4 v 33 w(pro)m(xy)g(en)m(vironmen)m(t)h(v)-5 b(ariable.)42 b(F)-8 b(or)31 b(example)191 1311 y Fe(setenv)46 b(http_proxy)f (http://heasarc.gsfc.nasa)o(.gov)o(:312)o(8)0 1703 y Fj(will)38 b(cause)g(CFITSIO)f(to)h(use)g(p)s(ort)f(3128)i(on)f(the)g (heasarc)g(pro)m(xy)g(serv)m(er)g(whenev)m(er)g(reading)g(a)g(FITS)f (\014le)0 1816 y(with)30 b(HTTP)-8 b(.)0 2100 y SDict begin H.S end 0 2100 a 0 2100 a SDict begin 13.6 H.A end 0 2100 a 0 2100 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.2.2) cvn /DEST pdfmark end 0 2100 a 163 x Fd(10.2.2)113 b(Notes)36 b(ab)s(out)j(HTTPS)d(and)j(FTPS)e(\014le)h(access)0 2513 y Fj(CFITSIO)33 b(dep)s(ends)g(up)s(on)g(the)h(a)m(v)-5 b(ailabilit)m(y)38 b(of)d(the)g(lib)s(curl)e(library)i(in)f(order)g(to) h(p)s(erform)e(HTTPS/FTPS)0 2626 y(\014le)d(access.)42 b(\(This)29 b(should)g(b)s(e)g(the)h(dev)m(elopmen)m(t)h(v)m(ersion)f (of)g(the)g(library)-8 b(,)31 b(as)f(it)g(con)m(tains)h(the)f(curl.h)f (header)0 2739 y(\014le)g(required)g(b)m(y)g(the)g(CFITSIO)f(co)s (de.\))40 b(The)29 b(CFITSIO)f('con\014gure')h(script)g(will)h(searc)m (h)f(for)g(this)g(library)g(on)0 2852 y(y)m(our)h(system,)h(and)f(if)g (it)h(\014nds)e(it)i(it)g(will)f(automatically)k(b)s(e)29 b(incorp)s(orated)i(in)m(to)g(the)g(build.)0 3012 y(Note)43 b(that)g(if)f(y)m(ou)g(ha)m(v)m(e)i(this)e(library)f(pac)m(k)-5 b(age)44 b(on)e(y)m(our)g(system,)k(y)m(ou)c(will)h(also)g(ha)m(v)m(e)g (the)f('curl-con\014g')0 3125 y(executable.)i(Y)-8 b(ou)31 b(can)h(run)d(the)i('curl-con\014g')h(executable)g(with)f(v)-5 b(arious)31 b(options)g(to)h(learn)f(more)g(ab)s(out)g(the)0 3238 y(features)g(of)f(y)m(our)h(lib)s(curl)e(installation.)0 3398 y(If)20 b(the)g(CFITSIO)f('con\014gure')i(succeeded)f(in)g (\014nding)f(a)i(usable)f(lib)s(curl,)i(y)m(ou)e(will)h(see)g(the)f (\015ag)h('-DCFITSIO)p 3766 3398 28 4 v 32 w(HA)-10 b(VE)p 4054 3398 V 33 w(CURL=1')0 3511 y(in)34 b(the)g(CFITSIO)f(Mak)m (e\014le)j(and)e(in)f(the)i(compilation)h(output.)52 b(If)33 b('con\014gure')i(is)f(unable)g(to)h(\014nd)d(a)j(usable)0 3624 y(lib)s(curl,)30 b(CFITSIO)f(will)h(still)i(build)d(but)h(it)h(w)m (on't)g(ha)m(v)m(e)g(HTTPS/FTPS)e(capabilit)m(y)-8 b(.)0 3784 y(The)32 b(lib)s(curl)g(pac)m(k)-5 b(age)34 b(is)f(normally)g (included)e(as)i(part)g(of)f(Xco)s(de)h(on)g(Macs.)48 b(Ho)m(w)m(ev)m(er)35 b(on)d(Lin)m(ux)g(platforms)0 3897 y(y)m(ou)f(ma)m(y)g(need)f(to)h(man)m(ually)h(install)f(it.)42 b(This)29 b(can)i(b)s(e)f(easily)i(done)e(on)g(Ubun)m(tu)g(Lin)m(ux)g (using)g(the)h('apt)g(get')0 4010 y(command)f(to)h(retriev)m(e)h(the)f (lib)s(curl4-op)s(enssl-dev)f(or)g(the)g(lib)s(curl4-gn)m(utls-dev)h (pac)m(k)-5 b(ages.)0 4170 y(When)27 b(accessing)h(a)f(\014le)g(with)g (HTTPS)e(or)i(FTPS,)f(the)h(default)g(CFITSIO)f(b)s(eha)m(vior)h(is)f (to)i(attempt)g(to)g(v)m(erify)0 4283 y(b)s(oth)f(the)g(host)g(name)h (and)e(the)i(SSL)e(certi\014cate.)42 b(If)27 b(it)g(cannot,)i(it)f (will)g(still)g(p)s(erform)e(the)h(\014le)g(access)i(but)e(will)0 4396 y(issue)j(a)h(w)m(arning)f(to)h(the)g(terminal)g(windo)m(w.)0 4556 y(The)36 b(user)f(can)i(o)m(v)m(erride)g(this)f(b)s(eha)m(vior)h (to)g(force)f(CFITSIO)f(to)i(only)f(allo)m(w)i(\014le)f(transfers)e (when)g(the)i(host)0 4669 y(name)47 b(and)e(SSL)h(certi\014cate)i(ha)m (v)m(e)g(b)s(een)e(successfully)g(v)m(eri\014ed.)89 b(This)46 b(is)g(done)h(b)m(y)f(setting)i(the)e(CFIT-)0 4782 y(SIO)p 160 4782 V 32 w(VERIFY)p 549 4782 V 33 w(HTTPS)29 b(en)m(vironmen)m(t)i (v)-5 b(ariable)31 b(to)g('T)-8 b(rue'.)41 b(ie.)g(in)30 b(a)h(csh)f(shell:)0 4942 y(seten)m(v)h(CFITSIO)p 662 4942 V 32 w(VERIFY)p 1051 4942 V 33 w(HTTPS)e(T)-8 b(rue)0 5102 y(the)31 b(default)f(setting)i(for)e(this)g(is)g('F)-8 b(alse'.)0 5262 y(CFITSIO)19 b(has)h(3)g(functions)g(whic)m(h)g(apply)g (sp)s(eci\014cally)h(to)g(HTTPS/FTPS)e(access:)37 b(\014ts)p 3079 5262 V 32 w(init)p 3247 5262 V 34 w(h)m(ttps,)22 b(\014ts)p 3655 5262 V 33 w(clean)m(up)p 3988 5262 V 33 w(h)m(ttps,)0 5375 y(and)37 b(\014ts)p 311 5375 V 33 w(v)m(erb)s(ose)p 640 5375 V 32 w(h)m(ttps.)63 b(It)38 b(is)f(recommended)h(that)g(y)m(ou)g(call)h(the)f(init)g(and)f(clean)m (up)h(functions)f(near)h(the)0 5488 y(b)s(eginning)k(and)g(end)g(of)h (y)m(our)g(program)f(resp)s(ectiv)m(ely)-8 b(.)80 b(F)-8 b(or)44 b(more)e(information)h(ab)s(out)g(these)g(functions,)0 5601 y(please)30 b(see)f(the)g('FITS)f(File)i(Access)g(Routines')g (section)f(in)g(the)g(preceding)g(c)m(hapter)g(\('Sp)s(ecialized)h (CFITSIO)0 5714 y(In)m(terface)i(Routines'\).)p eop end %%Page: 128 136 TeXDict begin 128 135 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.128) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(128)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.2.3) cvn /DEST pdfmark end 0 464 a 91 x Fd(10.2.3)113 b(Notes)36 b(ab)s(out)j(the)e(stream)h(\014let)m(yp) s(e)g(driv)m(er)0 774 y Fj(The)e(stream)h(driv)m(er)f(can)h(b)s(e)f (used)g(to)h(e\016cien)m(tly)i(read)d(a)h(FITS)f(\014le)h(from)f(the)h (stdin)f(\014le)g(stream)h(or)g(write)0 887 y(a)44 b(FITS)e(to)i(the)g (stdout)f(\014le)g(stream.)80 b(Ho)m(w)m(ev)m(er,)49 b(b)s(ecause)43 b(these)h(input)e(and)h(output)g(streams)g(m)m(ust)h(b) s(e)0 1000 y(accessed)30 b(sequen)m(tially)-8 b(,)31 b(the)e(FITS)f(\014le)g(reading)h(or)f(writing)h(application)h(m)m(ust) e(also)i(read)e(and)g(write)h(the)g(\014le)0 1113 y(sequen)m(tially)-8 b(,)33 b(at)e(least)g(within)f(the)h(tolerances)h(describ)s(ed)d(b)s (elo)m(w.)0 1273 y(CFITSIO)34 b(supp)s(orts)f(2)j(di\013eren)m(t)f (metho)s(ds)g(for)g(accessing)i(FITS)d(\014les)h(on)h(the)f(stdin)g (and)f(stdout)h(streams.)0 1386 y(The)c(original)i(metho)s(d,)f(whic)m (h)f(is)h(in)m(v)m(ok)m(ed)h(b)m(y)f(sp)s(ecifying)f(a)h(dash)f(c)m (haracter,)j("-",)g(as)d(the)h(name)g(of)g(the)g(\014le)0 1499 y(when)g(op)s(ening)g(or)h(creating)h(it,)g(w)m(orks)e(b)m(y)h (storing)g(a)g(complete)h(cop)m(y)g(of)f(the)g(en)m(tire)g(FITS)f (\014le)h(in)f(memory)-8 b(.)0 1612 y(In)35 b(this)g(case,)k(when)34 b(reading)i(from)f(stdin,)i(CFITSIO)d(will)i(cop)m(y)h(the)e(en)m(tire) i(stream)f(in)m(to)h(memory)e(b)s(efore)0 1725 y(doing)c(an)m(y)h(pro)s (cessing)f(of)h(the)f(\014le.)44 b(Similarly)-8 b(,)32 b(when)f(writing)g(to)h(stdout,)g(CFITSIO)d(will)j(create)h(a)f(cop)m (y)g(of)0 1837 y(the)h(en)m(tire)g(FITS)f(\014le)g(in)h(memory)-8 b(,)33 b(b)s(efore)f(\014nally)h(\015ushing)e(it)i(out)f(to)i(the)e (stdout)h(stream)g(when)e(the)i(FITS)0 1950 y(\014le)g(is)g(closed.)49 b(Bu\013ering)33 b(the)g(en)m(tire)h(FITS)e(\014le)h(in)g(this)f(w)m(a) m(y)i(allo)m(ws)g(the)f(application)i(to)e(randomly)g(access)0 2063 y(an)m(y)h(part)f(of)h(the)f(FITS)g(\014le,)i(in)e(an)m(y)h (order,)f(but)g(it)h(also)h(requires)e(that)h(the)f(user)g(ha)m(v)m(e)i (su\016cien)m(t)f(a)m(v)-5 b(ailable)0 2176 y(memory)30 b(\(or)g(virtual)g(memory\))g(to)h(store)f(the)g(en)m(tire)h(\014le,)f (whic)m(h)f(ma)m(y)i(not)f(b)s(e)f(p)s(ossible)g(in)h(the)g(case)h(of)f (v)m(ery)0 2289 y(large)h(\014les.)0 2449 y(The)e(new)m(er)g(stream)h (\014let)m(yp)s(e)g(pro)m(vides)f(a)h(more)f(memory-e\016cien)m(t)i (metho)s(d)e(of)h(accessing)h(FITS)d(\014les)h(on)h(the)0 2562 y(stdin)37 b(or)h(stdout)g(streams.)64 b(Instead)38 b(of)g(storing)g(a)g(cop)m(y)h(of)f(the)g(en)m(tire)h(FITS)e(\014le)h (in)g(memory)-8 b(,)40 b(CFITSIO)0 2675 y(only)32 b(uses)g(a)g(set)h (of)f(in)m(ternal)h(bu\013er)e(whic)m(h)h(b)m(y)g(default)g(can)g (store)h(40)g(FITS)e(blo)s(c)m(ks,)i(or)g(ab)s(out)e(100K)i(b)m(ytes)0 2788 y(of)f(the)f(FITS)g(\014le.)43 b(The)31 b(application)i(program)e (m)m(ust)g(pro)s(cess)g(the)h(FITS)e(\014le)i(sequen)m(tially)h(from)e (b)s(eginning)0 2901 y(to)h(end,)e(within)g(this)h(100K)h(bu\013er.)41 b(Generally)32 b(sp)s(eaking)f(the)g(application)h(program)f(m)m(ust)f (conform)h(to)h(the)0 3014 y(follo)m(wing)g(restrictions:)136 3265 y Fc(\017)46 b Fj(The)36 b(program)f(m)m(ust)h(\014nish)e(reading) i(or)g(writing)f(the)h(header)g(k)m(eyw)m(ords)g(b)s(efore)f(reading)h (or)g(writing)227 3378 y(an)m(y)31 b(data)g(in)f(the)h(HDU.)136 3563 y Fc(\017)46 b Fj(The)24 b(HDU)h(can)f(con)m(tain)i(at)e(most)h (ab)s(out)f(1400)h(header)f(k)m(eyw)m(ords.)39 b(This)24 b(is)g(the)g(maxim)m(um)g(that)h(can)f(\014t)227 3676 y(in)g(the)g(nominal)h(40)g(FITS)e(blo)s(c)m(k)i(bu\013er.)37 b(In)24 b(principle,)h(this)f(limit)h(could)f(b)s(e)g(increased)g(b)m (y)g(recompiling)227 3789 y(CFITSIO)29 b(with)h(a)h(larger)g(bu\013er)e (limit,)j(whic)m(h)e(is)g(set)h(b)m(y)f(the)h(NIOBUF)g(parameter)g(in)f (\014tsio2.h.)136 3974 y Fc(\017)46 b Fj(The)32 b(program)g(m)m(ust)f (read)h(or)g(write)h(the)f(data)g(in)g(a)g(sequen)m(tial)i(manner)d (from)h(the)g(b)s(eginning)f(to)i(the)227 4087 y(end)26 b(of)g(the)h(HDU.)g(Note)h(that)f(CFITSIO's)e(in)m(ternal)i(100K)g (bu\013er)e(allo)m(ws)j(a)e(little)j(latitude)e(in)f(meeting)227 4199 y(this)31 b(requiremen)m(t.)136 4384 y Fc(\017)46 b Fj(The)30 b(program)g(cannot)h(mo)m(v)m(e)h(bac)m(k)f(to)g(a)g (previous)f(HDU)h(in)f(the)h(FITS)e(\014le.)136 4569 y Fc(\017)46 b Fj(Reading)c(or)f(writing)f(of)h(v)-5 b(ariable)42 b(length)f(arra)m(y)h(columns)e(in)h(binary)f(tables)i(is) f(not)g(supp)s(orted)e(on)227 4682 y(streams,)29 b(b)s(ecause)f(this)g (requires)g(mo)m(ving)g(bac)m(k)h(and)f(forth)f(b)s(et)m(w)m(een)i(the) f(\014xed-length)g(p)s(ortion)g(of)g(the)227 4795 y(binary)i(table)h (and)f(the)g(follo)m(wing)i(heap)e(area)i(where)e(the)g(arra)m(ys)h (are)g(actually)h(stored.)136 4980 y Fc(\017)46 b Fj(Reading)25 b(or)g(writing)f(of)h(tile-compressed)h(images)g(is)e(not)h(supp)s (orted)e(on)h(streams,)i(b)s(ecause)f(the)g(images)227 5093 y(are)31 b(in)m(ternally)g(stored)g(using)f(v)-5 b(ariable)31 b(length)g(arra)m(ys.)0 5236 y SDict begin H.S end 0 5236 a 0 5236 a SDict begin 13.6 H.A end 0 5236 a 0 5236 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.2.4) cvn /DEST pdfmark end 0 5236 a 146 x Fd(10.2.4)113 b(Notes)36 b(ab)s(out)j(the)e(gsiftp)h(\014let)m(yp)s(e)0 5601 y Fj(DEPENDENCIES:)c(Globus)h(to)s(olkit)h(\(2.4.3)g(or)f (higher\))f(\(GT\))h(should)f(b)s(e)g(installed.)53 b(There)34 b(are)h(t)m(w)m(o)h(dif-)0 5714 y(feren)m(t)31 b(w)m(a)m(ys)g(to)g (install)g(GT:)p eop end %%Page: 129 137 TeXDict begin 129 136 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.129) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.2.)73 b(FILETYPE)3037 b Fj(129)0 555 y(1\))43 b(goto)h(the)f(globus)f(to)s (olkit)i(w)m(eb)e(page)i(www.globus.org)e(and)g(follo)m(w)h(the)g(do)m (wnload)g(and)e(compilation)0 668 y(instructions;)0 828 y(2\))j(goto)i(the)d(Virtual)i(Data)g(T)-8 b(o)s(olkit)45 b(w)m(eb)e(page)i(h)m(ttp://vdt.cs.wisc.edu/)g(and)e(follo)m(w)i(the)f (instructions)0 941 y(\(STR)m(ONGL)-8 b(Y)31 b(SUGGESTED\);)0 1101 y(Once)23 b(a)h(globus)f(clien)m(t)h(has)f(b)s(een)g(installed)h (in)e(y)m(our)i(system)f(with)g(a)g(sp)s(eci\014c)g(\015a)m(v)m(our)h (it)f(is)g(p)s(ossible)g(to)h(compile)0 1214 y(and)30 b(install)h(the)g(CFITSIO)d(libraries.)41 b(Sp)s(eci\014c)30 b(con\014guration)h(\015ags)f(m)m(ust)h(b)s(e)e(used:)0 1374 y(1\))21 b({with-gsiftp[[=P)-8 b(A)g(TH]])22 b(Enable)f(Globus)f (T)-8 b(o)s(olkit)21 b(gsiftp)g(proto)s(col)g(supp)s(ort)d(P)-8 b(A)g(TH=GLOBUS)p 3532 1374 28 4 v 33 w(LOCA)g(TION)0 1487 y(i.e.)42 b(the)30 b(lo)s(cation)i(of)f(y)m(our)f(globus)g (installation)0 1647 y(2\))h({with-gsiftp-\015a)m(v)m(our[[=P)-8 b(A)g(TH])33 b(de\014nes)d(the)g(sp)s(eci\014c)g(Globus)h(\015a)m(v)m (our)f(ex.)41 b(gcc32)0 1808 y(Both)31 b(the)g(\015ags)f(m)m(ust)g(b)s (e)g(used)g(and)f(it)i(is)g(mandatory)f(to)h(set)g(b)s(oth)f(the)g(P)-8 b(A)g(TH)31 b(and)f(the)h(\015a)m(v)m(our.)0 1968 y(USA)m(GE:)g(T)-8 b(o)31 b(access)h(\014les)e(on)g(a)h(gridftp)f(serv)m(er)g(it)h(is)g (necessary)f(to)i(use)e(a)g(gsiftp)h(pre\014x:)0 2128 y(example:)41 b(gsiftp://remote)p 1003 2128 V 35 w(serv)m(er)p 1271 2128 V 34 w(fqhn/directory/\014lename)0 2288 y(The)f(gridftp)g (driv)m(er)g(uses)g(a)g(lo)s(cal)i(bu\013er)d(on)i(a)f(temp)s(orary)g (\014le)h(the)f(\014le)h(is)f(lo)s(cated)i(in)e(the)g(/tmp)h(direc-)0 2401 y(tory)-8 b(.)73 b(If)40 b(y)m(ou)h(ha)m(v)m(e)h(sp)s(ecial)g(p)s (ermissions)d(on)i(/tmp)g(or)g(y)m(ou)g(do)f(not)i(ha)m(v)m(e)g(a)f (/tmp)g(directory)-8 b(,)44 b(it)e(is)e(p)s(os-)0 2514 y(sible)d(to)h(force)g(another)g(lo)s(cation)g(setting)h(the)e(GSIFTP)p 2068 2514 V 32 w(TMPFILE)g(en)m(vironmen)m(t)h(v)-5 b(ariable)38 b(\(ex.)62 b(exp)s(ort)0 2627 y(GSIFTP)p 347 2627 V 32 w(TMPFILE=/y)m(our/lo)s(cation/y)m(ourtmp\014le\).)0 2787 y(Grid)34 b(FTP)g(supp)s(orts)f(m)m(ulti)h(c)m(hannel)h(transfer.) 52 b(By)35 b(default)f(a)h(single)g(c)m(hannel)g(transmission)f(is)g(a) m(v)-5 b(ailable.)0 2900 y(Ho)m(w)m(ev)m(er,)34 b(it)d(is)h(p)s (ossible)e(to)i(mo)s(dify)e(this)i(b)s(eha)m(vior)f(setting)h(the)f (GSIFTP)p 2691 2900 V 33 w(STREAMS)f(en)m(vironmen)m(t)h(v)-5 b(ari-)0 3013 y(able)31 b(\(ex.)41 b(exp)s(ort)30 b(GSIFTP)p 1016 3013 V 33 w(STREAMS=8\).)0 3182 y SDict begin H.S end 0 3182 a 0 3182 a SDict begin 13.6 H.A end 0 3182 a 0 3182 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.2.5) cvn /DEST pdfmark end 0 3182 a 140 x Fd(10.2.5)113 b(Notes)36 b(ab)s(out)j(the)e(ro)s(ot)g(\014let)m(yp)s(e)0 3545 y Fj(The)20 b(original)j(ro)s(otd)d(serv)m(er)h(can)h(b)s(e)e(obtained) h(from:)36 b Fe(ftp://root.cern.ch/root)o(/roo)o(td.t)o(ar.)o(gz)15 b Fj(but,)22 b(for)0 3658 y(it)33 b(to)h(w)m(ork)f(correctly)h(with)e (CFITSIO)g(one)h(has)f(to)i(use)e(a)i(mo)s(di\014ed)d(v)m(ersion)j (whic)m(h)e(supp)s(orts)f(a)i(command)0 3771 y(to)41 b(return)d(the)j(length)f(of)g(the)g(\014le.)70 b(This)39 b(mo)s(di\014ed)f(v)m(ersion)j(is)f(a)m(v)-5 b(ailable)42 b(in)e(ro)s(otd)f(sub)s(directory)g(in)h(the)0 3884 y(CFITSIO)29 b(ftp)h(area)h(at)286 4159 y Fe(ftp://legacy.gsfc.nasa.gov)o(/so)o (ftwa)o(re/f)o(its)o(io/c)o(/roo)o(t/r)o(ootd)o(.tar)o(.gz)o(.)0 4435 y Fj(This)j(small)g(serv)m(er)h(is)g(started)f(either)h(b)m(y)g (inetd)f(when)f(a)i(clien)m(t)h(requests)e(a)h(connection)h(to)f(a)f (ro)s(otd)h(serv)m(er)0 4548 y(or)30 b(b)m(y)g(hand)f(\(i.e.)42 b(from)30 b(the)g(command)g(line\).)42 b(The)29 b(ro)s(otd)h(serv)m(er) h(w)m(orks)f(with)g(the)g(R)m(OOT)g(TNetFile)i(class.)0 4661 y(It)e(allo)m(ws)g(remote)h(access)f(to)h(R)m(OOT)e(database)h (\014les)f(in)g(either)h(read)g(or)f(write)h(mo)s(de.)40 b(By)30 b(default)f(TNetFile)0 4774 y(assumes)38 b(p)s(ort)g(432)h (\(whic)m(h)f(requires)g(ro)s(otd)g(to)h(b)s(e)f(started)h(as)f(ro)s (ot\).)65 b(T)-8 b(o)39 b(run)e(ro)s(otd)h(via)h(inetd)f(add)g(the)0 4887 y(follo)m(wing)32 b(line)f(to)g(/etc/services:)95 5162 y Fe(rootd)238 b(432/tcp)0 5438 y Fj(and)30 b(to)h (/etc/inetd.conf,)i(add)d(the)g(follo)m(wing)i(line:)95 5714 y Fe(rootd)47 b(stream)f(tcp)h(nowait)f(root)h (/user/rdm/root/bin/root)o(d)42 b(rootd)k(-i)p eop end %%Page: 130 138 TeXDict begin 130 137 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.130) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(130)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fj(F)g(orce)30 b(inetd)e(to)h(reread)f(its)h(conf)f (\014le)g(with)g Fe(kill)47 b(-HUP)g()p Fj(.)39 b(Y)-8 b(ou)28 b(can)h(also)g(start)g(ro)s(otd)f(b)m(y)g(hand)0 668 y(running)35 b(directly)i(under)d(y)m(our)j(priv)-5 b(ate)37 b(accoun)m(t)g(\(no)g(ro)s(ot)g(system)f(privileges)h (needed\).)59 b(F)-8 b(or)37 b(example)g(to)0 781 y(start)e(ro)s(otd)g (listening)g(on)g(p)s(ort)f(5151)j(just)d(t)m(yp)s(e:)49 b Fe(rootd)e(-p)g(5151)33 b Fj(Notice)k(that)f(no)e(&)h(is)f(needed.)54 b(Ro)s(otd)0 894 y(will)31 b(go)g(in)m(to)g(bac)m(kground)f(b)m(y)h (itself.)95 1139 y Fe(Rootd)47 b(arguments:)191 1252 y(-i)763 b(says)47 b(we)g(were)f(started)g(by)h(inetd)191 1365 y(-p)g(port#)476 b(specifies)45 b(a)j(different)d(port)i(to)g (listen)f(on)191 1478 y(-d)h(level)476 b(level)46 b(of)i(debug)e(info)h (written)e(to)j(syslog)1050 1591 y(0)f(=)h(no)f(debug)f(\(default\)) 1050 1704 y(1)h(=)h(minimum)1050 1817 y(2)f(=)h(medium)1050 1930 y(3)f(=)h(maximum)0 2175 y Fj(Ro)s(otd)29 b(can)f(also)h(b)s(e)f (con\014gured)g(for)g(anon)m(ymous)g(usage)h(\(lik)m(e)h(anon)m(ymous)e (ftp\).)40 b(T)-8 b(o)29 b(setup)f(ro)s(otd)g(to)h(accept)0 2288 y(anon)m(ymous)h(logins)h(do)g(the)f(follo)m(wing)i(\(while)f(b)s (eing)f(logged)i(in)e(as)g(ro)s(ot\):)143 2533 y Fe(-)48 b(Add)f(the)f(following)g(line)g(to)i(/etc/passwd:)239 2759 y(rootd:*:71:72:Anonymous)41 b(rootd:/var/spool/rootd:/b)o(in/)o (fals)o(e)239 2985 y(where)46 b(you)h(may)g(modify)f(the)h(uid,)f(gid)h (\(71,)g(72\))g(and)g(the)g(home)f(directory)239 3098 y(to)h(suite)f(your)h(system.)143 3323 y(-)h(Add)f(the)f(following)g (line)g(to)i(/etc/group:)239 3549 y(rootd:*:72:rootd)239 3775 y(where)e(the)h(gid)g(must)f(match)h(the)g(gid)g(in)g (/etc/passwd.)143 4001 y(-)h(Create)e(the)h(directories:)239 4227 y(mkdir)f(/var/spool/rootd)239 4340 y(mkdir)g (/var/spool/rootd/tmp)239 4452 y(chmod)g(777)h(/var/spool/rootd/tmp)239 4678 y(Where)f(/var/spool/rootd)d(must)k(match)f(the)h(rootd)g(home)f (directory)g(as)239 4791 y(specified)f(in)i(the)g(rootd)f(/etc/passwd)f (entry.)143 5017 y(-)j(To)f(make)f(writeable)g(directories)e(for)j (anonymous)f(do,)h(for)f(example:)239 5243 y(mkdir)g (/var/spool/rootd/pub)239 5356 y(chown)g(rootd:rootd)f (/var/spool/rootd/pub)0 5601 y Fj(That's)d(all.)76 b(Sev)m(eral)43 b(additional)g(remarks:)64 b(y)m(ou)42 b(can)g(login)h(to)g(an)f(anon)m (ymous)f(serv)m(er)i(either)f(with)g(the)0 5714 y(names)31 b("anon)m(ymous")h(or)f("ro)s(otd".)43 b(The)31 b(passw)m(ord)f(should) g(b)s(e)h(of)g(t)m(yp)s(e)g(user@host.do.main.)43 b(Only)30 b(the)h(@)p eop end %%Page: 131 139 TeXDict begin 131 138 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.131) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.3.)73 b(BASE)30 b(FILENAME)2739 b Fj(131)0 555 y(is)29 b(enforced)f(for)h (the)f(time)i(b)s(eing.)39 b(In)28 b(anon)m(ymous)h(mo)s(de)f(the)g (top)h(of)g(the)g(\014le)f(tree)i(is)e(set)h(to)h(the)e(ro)s(otd)h (home)0 668 y(directory)-8 b(,)39 b(therefore)e(only)f(\014les)h(b)s (elo)m(w)f(the)h(home)f(directory)h(can)f(b)s(e)g(accessed.)60 b(Anon)m(ymous)36 b(mo)s(de)g(only)0 781 y(w)m(orks)30 b(when)g(the)g(serv)m(er)h(is)f(started)h(via)g(inetd.)0 938 y SDict begin H.S end 0 938 a 0 938 a SDict begin 13.6 H.A end 0 938 a 0 938 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.2.6) cvn /DEST pdfmark end 0 938 a 164 x Fd(10.2.6)113 b(Notes)36 b(ab)s(out)j(the)e(shmem)i(\014let)m(yp)s(e:)0 1327 y Fj(Shared)34 b(memory)h(\014les)g(are)g(curren)m(tly)g(supp)s (orted)e(on)i(most)h(Unix)f(platforms,)h(where)f(the)g(shared)f(memory) 0 1440 y(segmen)m(ts)d(are)g(managed)g(b)m(y)f(the)g(op)s(erating)h (system)g(k)m(ernel)f(and)g(`liv)m(e')i(indep)s(enden)m(tly)d(of)i(pro) s(cesses.)40 b(They)0 1553 y(are)34 b(not)g(deleted)h(\(b)m(y)f (default\))g(when)f(the)h(pro)s(cess)f(whic)m(h)h(created)h(them)f (terminates,)h(although)g(they)f(will)0 1665 y(disapp)s(ear)e(if)h(the) h(system)f(is)g(reb)s(o)s(oted.)49 b(Applications)34 b(can)g(create)h(shared)d(memory)h(\014les)g(in)g(CFITSIO)f(b)m(y)0 1778 y(calling:)143 2064 y Fe(fit_create_file\(&fitsfile)o(ptr,)41 b("shmem://h2",)j(&status\);)0 2349 y Fj(where)25 b(the)g(ro)s(ot)h (`\014le')f(names)h(are)f(curren)m(tly)g(restricted)h(to)g(b)s(e)f ('h0',)i('h1',)g('h2',)g('h3',)f(etc.,)i(up)d(to)g(a)h(maxim)m(um)0 2462 y(n)m(um)m(b)s(er)20 b(de\014ned)f(b)m(y)i(the)g(the)g(v)-5 b(alue)22 b(of)f(SHARED)p 1746 2462 28 4 v 33 w(MAXSEG)g(\(equal)h(to)f (16)h(b)m(y)f(default\).)38 b(This)20 b(is)h(a)g(protot)m(yp)s(e)0 2575 y(implemen)m(tation)30 b(of)f(the)g(shared)f(memory)g(in)m (terface)i(and)e(a)h(more)g(robust)f(in)m(terface,)j(whic)m(h)d(will)h (ha)m(v)m(e)h(few)m(er)0 2688 y(restrictions)h(on)f(the)h(n)m(um)m(b)s (er)e(of)i(\014les)f(and)g(on)g(their)g(names,)h(ma)m(y)g(b)s(e)f(dev)m (elop)s(ed)g(in)g(the)h(future.)0 2848 y(When)23 b(op)s(ening)h(an)f (already)h(existing)h(FITS)e(\014le)h(in)f(shared)g(memory)h(one)g (calls)g(the)g(usual)g(CFITSIO)e(routine:)143 3133 y Fe(fits_open_file\(&fitsfilep)o(tr,)41 b("shmem://h7",)j(mode,)j (&status\))0 3419 y Fj(The)26 b(\014le)h(mo)s(de)g(can)g(b)s(e)f(READ)m (WRITE)h(or)g(READONL)-8 b(Y)28 b(just)e(as)h(with)f(disk)h(\014les.)39 b(More)28 b(than)e(one)h(pro)s(cess)0 3532 y(can)35 b(op)s(erate)g(on)f (READONL)-8 b(Y)35 b(mo)s(de)f(\014les)h(at)g(the)f(same)h(time.)54 b(CFITSIO)33 b(supp)s(orts)f(prop)s(er)h(\014le)i(lo)s(c)m(king)0 3644 y(\(b)s(oth)27 b(in)h(READONL)-8 b(Y)29 b(and)e(READ)m(WRITE)h(mo) s(des\),)h(so)f(calls)h(to)f(\014ts)p 2572 3644 V 33 w(op)s(en)p 2795 3644 V 32 w(\014le)g(ma)m(y)g(b)s(e)f(lo)s(c)m(k)m(ed) j(out)e(un)m(til)0 3757 y(another)j(other)f(pro)s(cess)g(closes)i(the)e (\014le.)0 3918 y(When)g(an)g(application)i(is)e(\014nished)f (accessing)j(a)e(FITS)g(\014le)g(in)g(a)h(shared)e(memory)h(segmen)m (t,)i(it)f(ma)m(y)g(close)g(it)0 4030 y(\(and)j(the)g(\014le)g(will)g (remain)f(in)h(the)g(system\))g(with)g(\014ts)p 1955 4030 V 32 w(close)p 2173 4030 V 34 w(\014le,)h(or)f(delete)h(it)g(with) e(\014ts)p 3191 4030 V 33 w(delete)p 3455 4030 V 34 w(\014le.)51 b(Ph)m(ys-)0 4143 y(ical)36 b(deletion)g(is)f(p)s(ostp)s(oned)e(un)m (til)j(the)f(last)g(pro)s(cess)g(calls)h(\013clos/\013delt.)56 b(\014ts)p 2801 4143 V 32 w(delete)p 3064 4143 V 34 w(\014le)35 b(tries)h(to)f(obtain)h(a)0 4256 y(READ)m(WRITE)e(lo)s(c)m(k)g(on)f (the)g(\014le)h(to)g(b)s(e)e(deleted,)j(th)m(us)e(it)h(can)f(b)s(e)g (blo)s(c)m(k)m(ed)h(if)f(the)h(ob)5 b(ject)34 b(w)m(as)f(not)h(op)s (ened)0 4369 y(in)c(READ)m(WRITE)h(mo)s(de.)0 4529 y(A)i(shared)f (memory)h(managemen)m(t)h(utilit)m(y)g(program)f(called)h(`smem',)f(is) g(included)f(with)h(the)g(CFITSIO)e(dis-)0 4642 y(tribution.)39 b(It)27 b(can)g(b)s(e)f(built)h(b)m(y)g(t)m(yping)g(`mak)m(e)h(smem';)g (then)f(t)m(yp)s(e)g(`smem)f(-h')h(to)h(get)g(a)f(list)g(of)g(v)-5 b(alid)27 b(options.)0 4755 y(Executing)37 b(smem)f(without)g(an)m(y)h (options)g(causes)f(it)h(to)g(list)g(all)g(the)g(shared)e(memory)i (segmen)m(ts)g(curren)m(tly)0 4868 y(residing)c(in)g(the)g(system)h (and)e(managed)i(b)m(y)f(the)h(shared)e(memory)h(driv)m(er.)49 b(T)-8 b(o)34 b(get)g(a)g(list)g(of)f(all)h(the)g(shared)0 4981 y(memory)c(ob)5 b(jects,)32 b(run)d(the)h(system)h(utilit)m(y)g (program)f(`ip)s(cs)h([-a]'.)0 5171 y SDict begin H.S end 0 5171 a 0 5171 a SDict begin 13.6 H.A end 0 5171 a 0 5171 a SDict begin [/View [/XYZ H.V]/Dest (section.10.3) cvn /DEST pdfmark end 0 5171 a 174 x Ff(10.3)136 b(Base)45 b(Filename)0 5601 y Fj(The)31 b(base)g(\014lename)h(is)f(the)h(name)f (of)h(the)f(\014le)h(optionally)g(including)f(the)h(director/sub)s (directory)f(path,)h(and)0 5714 y(in)e(the)h(case)g(of)g(`ftp',)f(`h)m (ttp',)i(and)d(`ro)s(ot')j(\014let)m(yp)s(es,)e(the)h(mac)m(hine)g (iden)m(ti\014er.)41 b(Examples:)p eop end %%Page: 132 140 TeXDict begin 132 139 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.132) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(132)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)191 555 y Fe(myfile.fits)191 668 y(!data.fits)191 781 y(/data/myfile.fits)191 894 y(fits.gsfc.nasa.gov/ftp/s)o(ampl)o (eda)o(ta/m)o(yfil)o(e.f)o(its.)o(gz)0 1120 y Fj(When)29 b(creating)h(a)f(new)f(output)h(\014le)g(on)g(magnetic)h(disk)e(\(of)i (t)m(yp)s(e)f(\014le://\))h(if)f(the)g(base)g(\014lename)g(b)s(egins)f (with)0 1233 y(an)34 b(exclamation)j(p)s(oin)m(t)d(\(!\))54 b(then)34 b(an)m(y)g(existing)i(\014le)e(with)g(that)h(same)g(basename) g(will)g(b)s(e)e(deleted)i(prior)f(to)0 1346 y(creating)h(the)f(new)g (FITS)f(\014le.)51 b(Otherwise)34 b(if)g(the)g(\014le)g(to)g(b)s(e)g (created)h(already)f(exists,)i(then)d(CFITSIO)g(will)0 1459 y(return)g(an)h(error)f(and)g(will)i(not)f(o)m(v)m(erwrite)h(the)f (existing)h(\014le.)52 b(Note)35 b(that)g(the)f(exclamation)i(p)s(oin)m (t,)f(')10 b(!',)36 b(is)e(a)0 1572 y(sp)s(ecial)28 b(UNIX)g(c)m (haracter,)j(so)d(if)f(it)i(is)f(used)f(on)g(the)h(command)g(line)g (rather)g(than)f(en)m(tered)h(at)h(a)f(task)h(prompt,)0 1685 y(it)j(m)m(ust)f(b)s(e)g(preceded)g(b)m(y)h(a)g(bac)m(kslash)g(to) g(force)g(the)g(UNIX)g(shell)f(to)h(pass)f(it)i(v)m(erbatim)f(to)g(the) g(application)0 1798 y(program.)0 1958 y(If)24 b(the)i(output)e(disk)h (\014le)g(name)g(ends)f(with)g(the)h(su\016x)f('.gz',)k(then)d(CFITSIO) e(will)i(compress)g(the)g(\014le)g(using)g(the)0 2071 y(gzip)g(compression)f(algorithm)h(b)s(efore)f(writing)g(it)h(to)g (disk.)38 b(This)23 b(can)i(reduce)f(the)g(amoun)m(t)h(of)f(disk)g (space)h(used)0 2184 y(b)m(y)34 b(the)h(\014le.)53 b(Note)36 b(that)f(this)g(feature)g(requires)f(that)h(the)f(uncompressed)g (\014le)g(b)s(e)g(constructed)h(in)f(memory)0 2297 y(b)s(efore)c(it)h (is)f(compressed)g(and)g(written)h(to)g(disk,)f(so)g(it)h(can)g(fail)g (if)f(there)h(is)f(insu\016cien)m(t)h(a)m(v)-5 b(ailable)33 b(memory)-8 b(.)0 2457 y(An)45 b(input)g(FITS)f(\014le)i(ma)m(y)g(b)s (e)f(compressed)g(with)h(the)f(gzip)h(or)g(Unix)f(compress)h (algorithms,)k(in)45 b(whic)m(h)0 2570 y(case)38 b(CFITSIO)e(will)i (uncompress)e(the)i(\014le)g(on)f(the)h(\015y)e(in)m(to)j(a)f(temp)s (orary)f(\014le)g(\(in)h(memory)f(or)g(on)h(disk\).)0 2683 y(Compressed)32 b(\014les)i(ma)m(y)g(only)f(b)s(e)g(op)s(ened)f (with)h(read-only)h(p)s(ermission.)49 b(When)33 b(sp)s(ecifying)g(the)h (name)f(of)h(a)0 2796 y(compressed)h(FITS)g(\014le)h(it)g(is)g(not)g (necessary)g(to)g(app)s(end)e(the)i(\014le)g(su\016x)e(\(e.g.,)39 b(`.gz')e(or)f(`.Z'\).)g(If)f(CFITSIO)0 2908 y(cannot)24 b(\014nd)e(the)h(input)f(\014le)i(name)f(without)g(the)g(su\016x,)h (then)f(it)h(will)g(automatically)i(searc)m(h)e(for)f(a)g(compressed)0 3021 y(\014le)36 b(with)f(the)h(same)g(ro)s(ot)g(name.)57 b(In)35 b(the)h(case)h(of)f(reading)g(ftp)f(and)g(h)m(ttp)h(t)m(yp)s(e) g(\014les,)h(CFITSIO)e(generally)0 3134 y(lo)s(oks)j(for)g(a)g (compressed)g(v)m(ersion)g(of)g(the)g(\014le)g(\014rst,)h(b)s(efore)e (trying)h(to)h(op)s(en)e(the)h(uncompressed)e(\014le.)64 b(By)0 3247 y(default,)37 b(CFITSIO)e(copies)h(\(and)g(uncompressed)e (if)i(necessary\))g(the)g(ftp)f(or)h(h)m(ttp)g(FITS)f(\014le)g(in)m(to) i(memory)0 3360 y(on)f(the)g(lo)s(cal)h(mac)m(hine)f(b)s(efore)g(op)s (ening)f(it.)58 b(This)35 b(will)h(fail)g(if)g(the)g(lo)s(cal)h(mac)m (hine)g(do)s(es)e(not)h(ha)m(v)m(e)h(enough)0 3473 y(memory)g(to)h (hold)f(the)g(whole)h(FITS)e(\014le,)k(so)d(in)g(this)g(case,)k(the)c (output)g(\014lename)g(sp)s(eci\014er)g(\(see)h(the)g(next)0 3586 y(section\))32 b(can)f(b)s(e)e(used)h(to)h(further)e(con)m(trol)j (ho)m(w)e(CFITSIO)f(reads)h(ftp)g(and)g(h)m(ttp)g(\014les.)0 3746 y(If)i(the)h(input)f(\014le)h(is)g(an)g(IRAF)g(image)h(\014le)f (\(*.imh)g(\014le\))h(then)e(CFITSIO)f(will)j(automatically)h(con)m(v)m (ert)g(it)e(on)0 3859 y(the)27 b(\015y)g(in)m(to)h(a)g(virtual)f(FITS)f (image)j(b)s(efore)e(it)g(is)g(op)s(ened)g(b)m(y)g(the)g(application)i (program.)39 b(IRAF)27 b(images)i(can)0 3972 y(only)h(b)s(e)g(op)s (ened)g(with)g(READONL)-8 b(Y)31 b(\014le)f(access.)0 4132 y(Similarly)-8 b(,)32 b(if)f(the)g(input)f(\014le)i(is)f(a)g(ra)m (w)g(binary)f(data)i(arra)m(y)-8 b(,)33 b(then)d(CFITSIO)g(will)h(con)m (v)m(ert)i(it)e(on)g(the)h(\015y)e(in)m(to)0 4245 y(a)38 b(virtual)g(FITS)g(image)h(with)e(the)h(basic)h(set)f(of)g(required)f (header)h(k)m(eyw)m(ords)g(b)s(efore)g(it)g(is)g(op)s(ened)f(b)m(y)h (the)0 4358 y(application)32 b(program)f(\(with)g(READONL)-8 b(Y)31 b(access\).)44 b(In)30 b(this)h(case)h(the)f(data)g(t)m(yp)s(e)g (and)g(dimensions)f(of)h(the)0 4471 y(image)d(m)m(ust)f(b)s(e)f(sp)s (eci\014ed)g(in)h(square)g(brac)m(k)m(ets)h(follo)m(wing)g(the)f (\014lename)g(\(e.g.)41 b(ra)m(w\014le.dat[ib512,512]\).)j(The)0 4584 y(\014rst)30 b(c)m(haracter)i(\(case)f(insensitiv)m(e\))h (de\014nes)e(the)g(data)h(t)m(yp)s(e)g(of)f(the)h(arra)m(y:)239 4810 y Fe(b)429 b(8-bit)46 b(unsigned)g(byte)239 4923 y(i)381 b(16-bit)46 b(signed)g(integer)239 5036 y(u)381 b(16-bit)46 b(unsigned)g(integer)239 5149 y(j)381 b(32-bit)46 b(signed)g(integer)239 5262 y(r)h(or)g(f)143 b(32-bit)46 b(floating)g(point)239 5375 y(d)381 b(64-bit)46 b(floating)g(point)0 5601 y Fj(An)40 b(optional)h(second)f(c)m(haracter)i(sp)s(eci\014es)e (the)h(b)m(yte)f(order)g(of)g(the)h(arra)m(y)g(v)-5 b(alues:)60 b(b)40 b(or)g(B)h(indicates)g(big)0 5714 y(endian)30 b(\(as)g(in)g(FITS)f(\014les)h(and)f(the)h(nativ)m(e)i(format)e(of)g (SUN)g(UNIX)g(w)m(orkstations)h(and)f(Mac)h(PCs\))e(and)h(l)g(or)p eop end %%Page: 133 141 TeXDict begin 133 140 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.133) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.4.)73 b(OUTPUT)29 b(FILE)h(NAME)h(WHEN)g(OPENING)f(AN)h(EXISTING)f(FILE)876 b Fj(133)0 555 y(L)27 b(indicates)i(little)g(endian)e(\(nativ)m(e)j (format)d(of)h(DEC)g(OSF)f(w)m(orkstations)h(and)f(IBM)h(PCs\).)40 b(If)27 b(this)g(c)m(haracter)0 668 y(is)f(omitted)g(then)f(the)h(arra) m(y)g(is)g(assumed)f(to)h(ha)m(v)m(e)h(the)f(nativ)m(e)g(b)m(yte)h (order)e(of)h(the)f(lo)s(cal)i(mac)m(hine.)40 b(These)25 b(data)0 781 y(t)m(yp)s(e)35 b(c)m(haracters)h(are)g(then)e(follo)m(w)m (ed)j(b)m(y)d(a)i(series)f(of)g(one)g(or)g(more)g(in)m(teger)h(v)-5 b(alues)35 b(separated)h(b)m(y)e(commas)0 894 y(whic)m(h)41 b(de\014ne)f(the)h(size)h(of)f(eac)m(h)h(dimension)f(of)g(the)g(ra)m(w) g(arra)m(y)-8 b(.)74 b(Arra)m(ys)41 b(with)f(up)g(to)i(5)f(dimensions)g (are)0 1007 y(curren)m(tly)31 b(supp)s(orted.)41 b(Finally)-8 b(,)33 b(a)e(b)m(yte)h(o\013set)g(to)g(the)f(p)s(osition)h(of)f(the)g (\014rst)f(pixel)i(in)f(the)g(data)h(\014le)f(ma)m(y)h(b)s(e)0 1120 y(sp)s(eci\014ed)h(b)m(y)g(separating)i(it)f(with)f(a)h(':')48 b(from)33 b(the)h(last)g(dimension)f(v)-5 b(alue.)51 b(If)33 b(omitted,)j(it)e(is)f(assumed)g(that)0 1233 y(the)i(o\013set)h(=)f(0.)54 b(This)35 b(parameter)g(ma)m(y)h(b)s(e)e (used)g(to)i(skip)e(o)m(v)m(er)i(an)m(y)g(header)e(information)i(in)e (the)h(\014le)g(that)0 1346 y(precedes)30 b(the)h(binary)f(data.)41 b(F)-8 b(urther)30 b(examples:)95 1603 y Fe(raw.dat[b10000])521 b(1-dimensional)45 b(10000)h(pixel)g(byte)h(array)95 1715 y(raw.dat[rb400,400,12])233 b(3-dimensional)45 b(floating)g(point) h(big-endian)f(array)95 1828 y(img.fits[ib512,512:2880])89 b(reads)47 b(the)g(512)g(x)g(512)g(short)f(integer)g(array)g(in)1336 1941 y(a)i(FITS)e(file,)h(skipping)e(over)i(the)g(2880)g(byte)f(header) 0 2198 y Fj(One)25 b(sp)s(ecial)g(case)h(of)f(input)f(\014le)h(is)g (where)g(the)g(\014lename)g(=)g(`-')h(\(a)f(dash)g(or)g(min)m(us)f (sign\))h(or)g('stdin')g(or)g('stdout',)0 2311 y(whic)m(h)d (signi\014es)h(that)h(the)f(input)e(\014le)i(is)g(to)h(b)s(e)e(read)g (from)h(the)g(stdin)f(stream,)j(or)e(written)f(to)i(the)f(stdout)g (stream)0 2424 y(if)34 b(a)g(new)g(output)f(\014le)h(is)g(b)s(eing)g (created.)52 b(In)33 b(the)h(case)h(of)f(reading)h(from)e(stdin,)h (CFITSIO)f(\014rst)g(copies)i(the)0 2537 y(whole)g(stream)h(in)m(to)g (a)f(temp)s(orary)g(FITS)f(\014le)i(\(in)f(memory)g(or)g(on)g(disk\),)h (and)f(subsequen)m(t)f(reading)h(of)h(the)0 2650 y(FITS)c(\014le)h(o)s (ccurs)g(in)f(this)h(cop)m(y)-8 b(.)49 b(When)33 b(writing)g(to)g (stdout,)h(CFITSIO)d(\014rst)h(constructs)h(the)g(whole)g(\014le)g(in)0 2763 y(memory)h(\(since)i(random)d(access)j(is)e(required\),)i(then)e (\015ushes)f(it)i(out)g(to)g(the)f(stdout)h(stream)g(when)e(the)i (\014le)0 2876 y(is)30 b(closed.)42 b(In)29 b(addition,)i(if)f(the)g (output)g(\014lename)g(=)g('-.gz')i(or)e('stdout.gz')h(then)f(it)h (will)f(b)s(e)g(gzip)g(compressed)0 2989 y(b)s(efore)g(b)s(eing)g (written)g(to)h(stdout.)0 3149 y(This)25 b(abilit)m(y)j(to)e(read)g (and)f(write)h(on)g(the)g(stdin)g(and)f(stdout)h(steams)g(allo)m(ws)i (FITS)d(\014les)h(to)g(b)s(e)g(pip)s(ed)e(b)s(et)m(w)m(een)0 3262 y(tasks)42 b(in)f(memory)g(rather)g(than)h(ha)m(ving)g(to)g (create)h(temp)s(orary)e(in)m(termediate)i(FITS)d(\014les)i(on)f(disk.) 73 b(F)-8 b(or)0 3375 y(example)28 b(if)e(task1)i(creates)h(an)e (output)f(FITS)g(\014le,)i(and)f(task2)g(reads)g(an)g(input)f(FITS)g (\014le,)i(the)f(FITS)f(\014le)h(ma)m(y)0 3487 y(b)s(e)j(pip)s(ed)f(b)s (et)m(w)m(een)i(the)f(2)h(tasks)g(b)m(y)f(sp)s(ecifying)143 3744 y Fe(task1)47 b(-)g(|)g(task2)g(-)0 4001 y Fj(where)30 b(the)h(v)m(ertical)i(bar)e(is)f(the)h(Unix)g(piping)f(sym)m(b)s(ol.)42 b(This)30 b(assumes)g(that)i(the)f(2)g(tasks)g(read)g(the)g(name)g(of)0 4114 y(the)g(FITS)e(\014le)i(o\013)f(of)h(the)g(command)f(line.)0 4251 y SDict begin H.S end 0 4251 a 0 4251 a SDict begin 13.6 H.A end 0 4251 a 0 4251 a SDict begin [/View [/XYZ H.V]/Dest (section.10.4) cvn /DEST pdfmark end 0 4251 a 197 x Ff(10.4)136 b(Output)44 b(File)i(Name)f(when)g(Op)t(ening)g(an)g (Existing)h(File)0 4698 y Fj(An)36 b(optional)i(output)e(\014lename)h (ma)m(y)h(b)s(e)e(sp)s(eci\014ed)g(in)g(paren)m(theses)h(immediately)h (follo)m(wing)g(the)f(base)g(\014le)0 4811 y(name)28 b(to)h(b)s(e)f(op)s(ened.)39 b(This)28 b(is)g(mainly)g(useful)g(in)g (those)g(cases)i(where)d(CFITSIO)g(creates)j(a)e(temp)s(orary)g(cop)m (y)0 4924 y(of)i(the)f(input)g(FITS)f(\014le)i(b)s(efore)f(it)h(is)f (op)s(ened)g(and)f(passed)h(to)h(the)g(application)h(program.)40 b(This)28 b(happ)s(ens)g(b)m(y)0 5036 y(default)i(when)g(op)s(ening)g (a)g(net)m(w)m(ork)h(FTP)g(or)f(HTTP-t)m(yp)s(e)g(\014le,)h(when)e (reading)h(a)h(compressed)f(FITS)g(\014le)g(on)0 5149 y(a)36 b(lo)s(cal)h(disk,)g(when)e(reading)h(from)g(the)g(stdin)f (stream,)j(or)d(when)g(a)i(column)e(\014lter,)j(ro)m(w)e(\014lter,)h (or)f(binning)0 5262 y(sp)s(eci\014er)29 b(is)g(included)g(as)h(part)f (of)g(the)h(input)f(\014le)g(sp)s(eci\014cation.)41 b(By)30 b(default)g(this)f(temp)s(orary)g(\014le)g(is)h(created)0 5375 y(in)g(memory)-8 b(.)41 b(If)29 b(there)h(is)g(not)g(enough)g (memory)g(to)h(create)g(the)g(\014le)f(cop)m(y)-8 b(,)31 b(then)f(CFITSIO)e(will)i(exit)h(with)f(an)0 5488 y(error.)45 b(In)32 b(these)g(cases)h(one)g(can)f(force)h(a)f(p)s(ermanen)m(t)g (\014le)g(to)h(b)s(e)e(created)i(on)f(disk,)g(instead)h(of)f(a)g(temp)s (orary)0 5601 y(\014le)38 b(in)f(memory)-8 b(,)40 b(b)m(y)d(supplying)f (the)i(name)g(in)f(paren)m(theses)h(immediately)h(follo)m(wing)g(the)e (base)h(\014le)g(name.)0 5714 y(The)30 b(output)g(\014lename)g(can)h (include)f(the)h(')10 b(!')41 b(clobb)s(er)30 b(\015ag.)p eop end %%Page: 134 142 TeXDict begin 134 141 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.134) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(134)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fj(Th)m(us,)48 b(if)d(the)g(input)f(\014lename)h(to)g (CFITSIO)f(is:)70 b Fe(file1.fits.gz\(file2.fit)o(s\))39 b Fj(then)44 b(CFITSIO)g(will)0 668 y(uncompress)39 b (`\014le1.\014ts.gz')j(in)m(to)f(the)f(lo)s(cal)h(disk)e(\014le)h (`\014le2.\014ts')h(b)s(efore)f(op)s(ening)f(it.)70 b(CFITSIO)38 b(do)s(es)i(not)0 781 y(automatically)33 b(delete)f(the)e(output)g (\014le,)h(so)g(it)g(will)f(still)i(exist)f(after)g(the)f(application)i (program)e(exits.)0 941 y(The)i(output)h(\014lename)g("mem://")i(is)e (also)h(allo)m(w)m(ed,)i(whic)m(h)c(will)i(write)f(the)g(output)f (\014le)h(in)m(to)h(memory)-8 b(,)35 b(and)0 1054 y(also)28 b(allo)m(w)g(write)f(access)h(to)g(the)f(\014le.)39 b(This)26 b('\014le')i(will)f(disapp)s(ear)f(when)g(it)h(is)g(closed,)h(but)e (this)h(ma)m(y)h(b)s(e)e(useful)0 1167 y(for)k(some)h(applications)g (whic)m(h)g(only)f(need)g(to)h(mo)s(dify)f(a)h(temp)s(orary)f(cop)m(y)h (of)f(the)h(\014le.)0 1327 y(In)k(some)i(cases,)h(sev)m(eral)f (di\013eren)m(t)g(temp)s(orary)e(FITS)h(\014les)g(will)g(b)s(e)f (created)i(in)f(sequence,)i(for)e(instance,)i(if)0 1440 y(one)f(op)s(ens)g(a)g(remote)h(\014le)f(using)g(FTP)-8 b(,)37 b(then)g(\014lters)g(ro)m(ws)g(in)g(a)h(binary)e(table)i (extension,)i(then)c(create)j(an)0 1553 y(image)f(b)m(y)f(binning)f(a)h (pair)g(of)g(columns.)60 b(In)36 b(this)h(case,)j(the)d(remote)h (\014le)f(will)g(b)s(e)f(copied)h(to)h(a)f(temp)s(orary)0 1666 y(lo)s(cal)j(\014le,)h(then)d(a)h(second)f(temp)s(orary)h(\014le)f (will)h(b)s(e)f(created)i(con)m(taining)g(the)e(\014ltered)h(ro)m(ws)f (of)h(the)g(table,)0 1779 y(and)c(\014nally)g(a)h(third)e(temp)s(orary) h(\014le)h(con)m(taining)g(the)g(binned)e(image)i(will)g(b)s(e)f (created.)57 b(In)34 b(cases)i(lik)m(e)h(this)0 1892 y(where)28 b(m)m(ultiple)h(\014les)f(are)h(created,)h(the)e(out\014le)h (sp)s(eci\014er)f(will)g(b)s(e)g(in)m(terpreted)h(the)f(name)g(of)h (the)f(\014nal)g(\014le)h(as)0 2005 y(describ)s(ed)g(b)s(elo)m(w,)i(in) f(descending)g(priorit)m(y:)136 2266 y Fc(\017)46 b Fj(as)29 b(the)g(name)g(of)g(the)g(\014nal)f(image)i(\014le)f(if)f(an)h(image)h (within)e(a)h(single)g(binary)f(table)i(cell)g(is)e(op)s(ened)g(or)h (if)227 2379 y(an)i(image)g(is)g(created)g(b)m(y)f(binning)g(a)g(table) i(column.)136 2568 y Fc(\017)46 b Fj(as)33 b(the)f(name)h(of)f(the)h (\014le)f(con)m(taining)i(the)e(\014ltered)g(table)i(if)e(a)h(column)f (\014lter)g(and/or)g(a)h(ro)m(w)f(\014lter)h(are)227 2681 y(sp)s(eci\014ed.)136 2870 y Fc(\017)46 b Fj(as)31 b(the)f(name)h(of)f(the)h(lo)s(cal)h(cop)m(y)f(of)f(the)h(remote)g(FTP) f(or)h(HTTP)e(\014le.)136 3059 y Fc(\017)46 b Fj(as)31 b(the)g(name)g(of)g(the)f(uncompressed)g(v)m(ersion)h(of)g(the)f(FITS)g (\014le,)h(if)g(a)g(compressed)f(FITS)g(\014le)h(on)g(lo)s(cal)227 3172 y(disk)f(has)g(b)s(een)g(op)s(ened.)136 3361 y Fc(\017)46 b Fj(otherwise,)31 b(the)g(output)f(\014lename)g(is)h(ignored.)0 3622 y(The)e(output)f(\014le)h(sp)s(eci\014er)g(is)g(useful)f(when)g (reading)h(FTP)g(or)g(HTTP-t)m(yp)s(e)g(FITS)f(\014les)h(since)g(it)h (can)f(b)s(e)g(used)0 3735 y(to)34 b(create)i(a)e(lo)s(cal)h(disk)e (cop)m(y)i(of)f(the)g(\014le)f(that)i(can)f(b)s(e)f(reused)g(in)g(the)h (future.)50 b(If)33 b(the)h(output)g(\014le)f(name)h(=)0 3848 y(`*')i(then)e(a)i(lo)s(cal)g(\014le)f(with)g(the)g(same)g(name)g (as)g(the)h(net)m(w)m(ork)f(\014le)g(will)h(b)s(e)e(created.)56 b(Note)36 b(that)f(CFITSIO)0 3961 y(will)30 b(b)s(eha)m(v)m(e)g (di\013eren)m(tly)h(dep)s(ending)d(on)i(whether)f(the)h(remote)g (\014le)g(is)g(compressed)f(or)h(not)g(as)g(sho)m(wn)f(b)m(y)h(the)0 4074 y(follo)m(wing)i(examples:)136 4309 y Fc(\017)46 b Fe(ftp://remote.machine/tmp/)o(myfi)o(le.f)o(its)o(.gz\()o(*\))28 b Fj(-)35 b(the)g(remote)h(compressed)e(\014le)h(is)g(copied)g(to)227 4422 y(the)d(lo)s(cal)h(compressed)f(\014le)g(`m)m(y\014le.\014ts.gz',) i(whic)m(h)d(is)h(then)g(uncompressed)e(in)i(lo)s(cal)h(memory)e(b)s (efore)227 4535 y(b)s(eing)f(op)s(ened)g(and)g(passed)f(to)j(the)e (application)i(program.)136 4724 y Fc(\017)46 b Fe (ftp://remote.machine/tmp/)o(myfi)o(le.f)o(its)o(.gz\()o(myfi)o(le.)o (fits)o(\))33 b Fj(-)39 b(the)g(remote)h(compressed)f(\014le)227 4837 y(is)d(copied)g(and)f(uncompressed)g(in)m(to)h(the)g(lo)s(cal)h (\014le)f(`m)m(y\014le.\014ts'.)57 b(This)35 b(example)h(requires)g (less)g(lo)s(cal)227 4950 y(memory)21 b(than)g(the)g(previous)f (example)i(since)f(the)g(\014le)g(is)g(uncompressed)e(on)i(disk)g (instead)g(of)g(in)f(memory)-8 b(.)136 5139 y Fc(\017)46 b Fe(ftp://remote.machine/tmp/)o(myfi)o(le.f)o(its)o(\(myf)o(ile.)o (fit)o(s.gz)o(\))24 b Fj(-)30 b(this)g(will)g(usually)g(pro)s(duce)f (an)227 5252 y(error)h(since)h(CFITSIO)e(itself)i(cannot)g(compress)f (\014les.)0 5488 y(The)36 b(exact)i(b)s(eha)m(vior)e(of)h(CFITSIO)e(in) h(the)h(latter)g(case)h(dep)s(ends)c(on)j(the)f(t)m(yp)s(e)h(of)g(ftp)f (serv)m(er)g(running)f(on)0 5601 y(the)c(remote)g(mac)m(hine)g(and)f (ho)m(w)g(it)h(is)f(con\014gured.)40 b(In)30 b(some)h(cases,)g(if)f (the)h(\014le)f(`m)m(y\014le.\014ts.gz')j(exists)e(on)f(the)0 5714 y(remote)38 b(mac)m(hine,)h(then)e(the)g(serv)m(er)g(will)h(cop)m (y)f(it)h(to)f(the)h(lo)s(cal)g(mac)m(hine.)61 b(In)36 b(other)h(cases)h(the)f(ftp)g(serv)m(er)p eop end %%Page: 135 143 TeXDict begin 135 142 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.135) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.5.)73 b(TEMPLA)-8 b(TE)30 b(FILE)g(NAME)h(WHEN)g(CREA)-8 b(TING)30 b(A)g(NEW)h(FILE)997 b Fj(135)0 555 y(will)36 b(automatically)j(create) e(and)f(transmit)g(a)g(compressed)g(v)m(ersion)g(of)g(the)g(\014le)g (if)g(only)g(the)g(uncompressed)0 668 y(v)m(ersion)27 b(exists.)41 b(This)26 b(can)h(get)h(rather)f(confusing,)h(so)f(users)f (should)g(use)h(a)g(certain)h(amoun)m(t)g(of)f(caution)h(when)0 781 y(using)34 b(the)h(output)f(\014le)h(sp)s(eci\014er)f(with)h(FTP)f (or)h(HTTP)f(\014le)h(t)m(yp)s(es,)h(to)f(mak)m(e)h(sure)e(they)h(get)h (the)f(b)s(eha)m(vior)0 894 y(that)c(they)g(exp)s(ect.)0 1071 y SDict begin H.S end 0 1071 a 0 1071 a SDict begin 13.6 H.A end 0 1071 a 0 1071 a SDict begin [/View [/XYZ H.V]/Dest (section.10.5) cvn /DEST pdfmark end 0 1071 a 179 x Ff(10.5)136 b(T)-11 b(emplate)45 b(File)h(Name)g(when)e(Creating)j(a) e(New)g(File)0 1504 y Fj(When)38 b(a)h(new)f(FITS)g(\014le)h(is)g (created)g(with)g(a)f(call)i(to)g(\014ts)p 2101 1504 28 4 v 32 w(create)p 2369 1504 V 35 w(\014le,)g(the)f(name)g(of)g(a)g (template)h(\014le)e(ma)m(y)0 1617 y(b)s(e)h(supplied)g(in)h(paren)m (theses)g(immediately)h(follo)m(wing)g(the)g(name)f(of)g(the)g(new)f (\014le)h(to)h(b)s(e)e(created.)71 b(This)0 1730 y(template)27 b(is)e(used)g(to)h(de\014ne)f(the)h(structure)f(of)h(one)f(or)h(more)g (HDUs)g(in)f(the)h(new)f(\014le.)39 b(The)25 b(template)i(\014le)e(ma)m (y)0 1843 y(b)s(e)32 b(another)h(FITS)f(\014le,)i(in)f(whic)m(h)f(case) i(the)f(newly)g(created)h(\014le)f(will)g(ha)m(v)m(e)h(exactly)h(the)e (same)g(k)m(eyw)m(ords)g(in)0 1956 y(eac)m(h)25 b(HDU)g(as)g(in)f(the)g (template)i(FITS)d(\014le,)j(but)d(all)j(the)e(data)h(units)e(will)i(b) s(e)f(\014lled)g(with)f(zeros.)40 b(The)24 b(template)0 2069 y(\014le)i(ma)m(y)h(also)g(b)s(e)e(an)h(ASCI)s(I)e(text)j(\014le,) g(where)f(eac)m(h)h(line)f(\(in)g(general\))i(describ)s(es)d(one)h (FITS)f(k)m(eyw)m(ord)i(record.)0 2182 y(The)j(format)h(of)f(the)h (ASCI)s(I)e(template)i(\014le)g(is)f(describ)s(ed)f(in)i(the)f(follo)m (wing)i(T)-8 b(emplate)31 b(Files)h(c)m(hapter.)0 2359 y SDict begin H.S end 0 2359 a 0 2359 a SDict begin 13.6 H.A end 0 2359 a 0 2359 a SDict begin [/View [/XYZ H.V]/Dest (section.10.6) cvn /DEST pdfmark end 0 2359 a 179 x Ff(10.6)136 b(Image)46 b(Tile-Compression)g(Sp)t(eci\014cation)0 2792 y Fj(When)28 b(sp)s(ecifying)g(the)h(name)g(of)f(the)h(output)f (FITS)g(\014le)g(to)h(b)s(e)f(created,)i(the)f(user)f(can)g(indicate)i (that)f(images)0 2905 y(should)d(b)s(e)h(written)g(in)g (tile-compressed)h(format)g(\(see)g(section)g(5.5,)h(\\Primary)e(Arra)m (y)h(or)f(IMA)m(GE)h(Extension)0 3018 y(I/O)f(Routines"\))i(b)m(y)e (enclosing)h(the)g(compression)f(parameters)h(in)f(square)g(brac)m(k)m (ets)i(follo)m(wing)g(the)f(ro)s(ot)f(disk)0 3131 y(\014le)j(name.)41 b(Here)31 b(are)g(some)g(examples)g(of)f(the)h(syn)m(tax)g(for)f(sp)s (ecifying)g(tile-compressed)i(output)e(images:)191 3410 y Fe(myfile.fit[compress])185 b(-)48 b(use)f(Rice)f(algorithm)g(and)h (default)e(tile)i(size)191 3636 y(myfile.fit[compress)42 b(GZIP])47 b(-)g(use)g(the)g(specified)e(compression)g(algorithm;)191 3748 y(myfile.fit[compress)d(Rice])238 b(only)46 b(the)h(first)g (letter)f(of)h(the)g(algorithm)191 3861 y(myfile.fit[compress)42 b(PLIO])238 b(name)46 b(is)i(required.)191 4087 y(myfile.fit[compress) 42 b(Rice)47 b(100,100])141 b(-)48 b(use)e(100)h(x)h(100)f(pixel)f (tile)h(size)191 4200 y(myfile.fit[compress)42 b(Rice)47 b(100,100;2])e(-)j(as)f(above,)f(and)h(use)g(noisebits)e(=)i(2)0 4379 y SDict begin H.S end 0 4379 a 0 4379 a SDict begin 13.6 H.A end 0 4379 a 0 4379 a SDict begin [/View [/XYZ H.V]/Dest (section.10.7) cvn /DEST pdfmark end 0 4379 a 177 x Ff(10.7)136 b(HDU)45 b(Lo)t(cation)g(Sp)t(eci\014cation)0 4811 y Fj(The)c(optional)h(HDU)h(lo)s(cation)g(sp)s(eci\014er)d (de\014nes)h(whic)m(h)g(HDU)h(\(Header-Data)i(Unit,)h(also)d(kno)m(wn)f (as)h(an)0 4924 y(`extension'\))36 b(within)d(the)i(FITS)e(\014le)h(to) h(initially)h(op)s(en.)51 b(It)34 b(m)m(ust)g(immediately)i(follo)m(w)f (the)f(base)h(\014le)f(name)0 5036 y(\(or)g(the)g(output)g(\014le)g (name)f(if)h(presen)m(t\).)52 b(If)33 b(it)h(is)g(not)g(sp)s(eci\014ed) g(then)f(the)h(\014rst)f(HDU)i(\(the)f(primary)f(arra)m(y\))0 5149 y(is)g(op)s(ened.)46 b(The)32 b(HDU)h(lo)s(cation)h(sp)s (eci\014er)e(is)h(required)f(if)g(the)h(colFilter,)i(ro)m(wFilter,)g (or)e(binSp)s(ec)e(sp)s(eci\014ers)0 5262 y(are)f(presen)m(t,)f(b)s (ecause)h(the)f(primary)f(arra)m(y)i(is)f(not)h(a)f(v)-5 b(alid)30 b(HDU)g(for)f(these)g(op)s(erations.)41 b(The)29 b(HDU)h(ma)m(y)g(b)s(e)0 5375 y(sp)s(eci\014ed)e(either)i(b)m(y)e (absolute)i(p)s(osition)f(n)m(um)m(b)s(er,)f(starting)i(with)e(0)i(for) e(the)h(primary)f(arra)m(y)-8 b(,)31 b(or)e(b)m(y)f(reference)0 5488 y(to)h(the)g(HDU)g(name,)g(and)f(optionally)-8 b(,)31 b(the)e(v)m(ersion)g(n)m(um)m(b)s(er)e(and)h(the)h(HDU)g(t)m(yp)s(e)g (of)f(the)h(desired)f(extension.)0 5601 y(The)k(lo)s(cation)h(of)f(an)g (image)i(within)d(a)i(single)f(cell)i(of)e(a)g(binary)g(table)h(ma)m(y) f(also)h(b)s(e)f(sp)s(eci\014ed,)g(as)g(describ)s(ed)0 5714 y(b)s(elo)m(w.)p eop end %%Page: 136 144 TeXDict begin 136 143 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.136) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(136)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fj(The)26 b(absolute)h(p)s(osition)f(of)g(the)h(extension) g(is)f(sp)s(eci\014ed)f(either)i(b)m(y)f(enclosed)h(the)g(n)m(um)m(b)s (er)e(in)h(square)f(brac)m(k)m(ets)0 668 y(\(e.g.,)k(`[1]')g(=)d(the)h (\014rst)f(extension)h(follo)m(wing)i(the)e(primary)e(arra)m(y\))j(or)f (b)m(y)f(preceded)h(the)g(n)m(um)m(b)s(er)e(with)i(a)g(plus)0 781 y(sign)37 b(\(`+1'\).)63 b(T)-8 b(o)38 b(sp)s(ecify)f(the)g(HDU)h (b)m(y)g(name,)h(giv)m(e)g(the)e(name)h(of)f(the)h(desired)f(HDU)h (\(the)f(v)-5 b(alue)38 b(of)g(the)0 894 y(EXTNAME)e(or)g(HDUNAME)h(k)m (eyw)m(ord\))g(and)f(optionally)h(the)f(extension)h(v)m(ersion)f(n)m (um)m(b)s(er)f(\(v)-5 b(alue)37 b(of)f(the)0 1007 y(EXTVER)27 b(k)m(eyw)m(ord\))i(and)e(the)h(extension)h(t)m(yp)s(e)e(\(v)-5 b(alue)29 b(of)f(the)g(XTENSION)f(k)m(eyw)m(ord:)40 b(IMA)m(GE,)29 b(ASCI)s(I)d(or)0 1120 y(T)-8 b(ABLE,)36 b(or)f(BINT)-8 b(ABLE\),)36 b(separated)f(b)m(y)g(commas)h(and)e(all)i(enclosed)g(in)f (square)g(brac)m(k)m(ets.)56 b(If)34 b(the)h(v)-5 b(alue)0 1233 y(of)34 b(EXTVER)f(and)f(XTENSION)h(are)h(not)f(sp)s(eci\014ed,)h (then)f(the)h(\014rst)e(extension)j(with)e(the)g(correct)i(v)-5 b(alue)34 b(of)0 1346 y(EXTNAME)39 b(is)g(op)s(ened.)67 b(The)38 b(extension)i(name)f(and)f(t)m(yp)s(e)i(are)f(not)h(case)g (sensitiv)m(e,)j(and)38 b(the)h(extension)0 1458 y(t)m(yp)s(e)29 b(ma)m(y)g(b)s(e)f(abbreviated)h(to)g(a)g(single)g(letter)h(\(e.g.,)h (I)d(=)g(IMA)m(GE)i(extension)f(or)f(primary)g(arra)m(y)-8 b(,)30 b(A)f(or)f(T)g(=)0 1571 y(ASCI)s(I)d(table)i(extension,)h(and)e (B)h(=)f(binary)g(table)h(BINT)-8 b(ABLE)27 b(extension\).)41 b(If)26 b(the)g(HDU)h(lo)s(cation)i(sp)s(eci\014er)0 1684 y(is)h(equal)h(to)g(`[PRIMAR)-8 b(Y]')32 b(or)f(`[P]',)g(then)f (the)h(primary)e(arra)m(y)i(\(the)g(\014rst)f(HDU\))h(will)g(b)s(e)f (op)s(ened.)0 1844 y(An)36 b(optional)j(p)s(ound)34 b(sign)j(c)m (haracter)i(\("#"\))f(ma)m(y)f(b)s(e)g(app)s(ended)e(to)i(the)g (extension)h(name)f(or)g(n)m(um)m(b)s(er)e(to)0 1957 y(signify)e(that)h(an)m(y)g(other)f(extensions)h(in)f(the)g(\014le)g (should)g(b)s(e)f(ignored)h(during)f(an)m(y)i(subsequen)m(t)e(\014le)i (\014ltering)0 2070 y(op)s(erations.)83 b(F)-8 b(or)45 b(example,)k(when)43 b(doing)i(ro)m(w)f(\014ltering)h(op)s(erations)f (on)h(a)f(table)i(extension,)i(CFITSIO)0 2183 y(normally)27 b(creates)i(a)e(cop)m(y)h(of)f(the)g(\014ltered)g(table)h(in)f(memory) -8 b(,)28 b(along)h(with)d(a)i(v)m(erbatim)f(cop)m(y)h(of)f(all)h(the)g (other)0 2296 y(extensions)h(in)g(the)g(input)f(FITS)g(\014le.)41 b(If)28 b(the)h(p)s(ound)e(sign)i(is)g(app)s(ended)e(to)j(the)f(table)h (extension)g(name,)f(then)0 2409 y(only)34 b(that)g(extension,)i(and)d (none)h(of)g(the)g(other)g(extensions)g(in)f(the)h(\014le,)h(will)g(b)m (y)e(copied)h(to)h(memory)-8 b(,)35 b(as)f(in)0 2522 y(the)d(follo)m(wing)g(example:)143 2773 y Fe(myfile.fit[events#][TIME) 41 b(>)48 b(10000])0 3024 y Fj(FITS)34 b(images)i(are)f(most)h (commonly)f(stored)g(in)g(the)g(primary)f(arra)m(y)h(or)g(an)g(image)h (extension,)h(but)d(images)0 3137 y(can)d(also)h(b)s(e)e(stored)h(as)h (a)f(v)m(ector)h(in)f(a)g(single)h(cell)g(of)f(a)h(binary)e(table)i (\(i.e.)43 b(eac)m(h)32 b(ro)m(w)f(of)g(the)h(v)m(ector)g(column)0 3250 y(con)m(tains)d(a)g(di\013eren)m(t)f(image\).)42 b(Suc)m(h)27 b(an)h(image)i(can)e(b)s(e)g(op)s(ened)f(with)h(CFITSIO)e (b)m(y)i(sp)s(ecifying)g(the)g(desired)0 3363 y(column)k(name)g(and)f (the)h(ro)m(w)g(n)m(um)m(b)s(er)f(after)h(the)g(binary)f(table)i(HDU)g (sp)s(eci\014er)e(as)h(sho)m(wn)g(in)f(the)h(follo)m(wing)0 3476 y(examples.)71 b(The)40 b(column)g(name)h(is)f(separated)h(from)f (the)h(HDU)g(sp)s(eci\014er)f(b)m(y)g(a)h(semicolon)g(and)f(the)h(ro)m (w)0 3589 y(n)m(um)m(b)s(er)29 b(is)h(enclosed)h(in)e(paren)m(theses.) 41 b(In)30 b(this)g(case)h(CFITSIO)d(copies)j(the)f(image)i(from)d(the) i(table)g(cell)g(in)m(to)0 3702 y(a)h(temp)s(orary)e(primary)h(arra)m (y)g(b)s(efore)g(it)h(is)f(op)s(ened.)43 b(The)30 b(application)j (program)e(then)g(just)g(sees)g(the)h(image)0 3815 y(in)i(the)h (primary)e(arra)m(y)-8 b(,)37 b(without)d(an)m(y)h(extensions.)53 b(The)34 b(particular)g(ro)m(w)h(to)g(b)s(e)e(op)s(ened)h(ma)m(y)h(b)s (e)f(sp)s(eci\014ed)0 3927 y(either)28 b(b)m(y)f(giving)h(an)f (absolute)h(in)m(teger)h(ro)m(w)f(n)m(um)m(b)s(er)e(\(starting)i(with)f (1)h(for)f(the)g(\014rst)g(ro)m(w\),)i(or)e(b)m(y)g(sp)s(ecifying)0 4040 y(a)33 b(b)s(o)s(olean)f(expression)g(that)h(ev)-5 b(aluates)34 b(to)f(TR)m(UE)g(for)f(the)g(desired)g(ro)m(w.)47 b(The)32 b(\014rst)f(ro)m(w)i(that)g(satis\014es)g(the)0 4153 y(expression)28 b(will)g(b)s(e)g(used.)39 b(The)28 b(ro)m(w)g(selection)i(expression)e(has)g(the)g(same)g(syn)m(tax)h(as)f (describ)s(ed)f(in)h(the)g(Ro)m(w)0 4266 y(Filter)k(Sp)s(eci\014er)d (section,)j(b)s(elo)m(w.)0 4426 y(Examples:)143 4677 y Fe(myfile.fits[3])44 b(-)k(open)e(the)h(3rd)g(HDU)g(following)e(the)i (primary)f(array)143 4790 y(myfile.fits+3)92 b(-)48 b(same)e(as)h (above,)f(but)h(using)g(the)g(FTOOLS-style)d(notation)143 4903 y(myfile.fits[EVENTS])f(-)k(open)g(the)g(extension)e(that)i(has)g (EXTNAME)e(=)j('EVENTS')143 5016 y(myfile.fits[EVENTS,)43 b(2])95 b(-)47 b(same)g(as)g(above,)f(but)h(also)g(requires)e(EXTVER)h (=)i(2)143 5129 y(myfile.fits[events,2,b])42 b(-)47 b(same,)f(but)h (also)g(requires)f(XTENSION)f(=)j('BINTABLE')143 5242 y(myfile.fits[3;)c(images\(17\)])h(-)i(opens)g(the)g(image)f(in)h(row)g (17)g(of)g(the)g('images')1527 5355 y(column)f(in)i(the)e(3rd)h (extension)f(of)h(the)g(file.)143 5468 y(myfile.fits[3;)d (images\(exposure)g(>)j(100\)])g(-)g(as)g(above,)f(but)h(opens)g(the)f (image)907 5581 y(in)h(the)g(first)f(row)h(that)g(has)g(an)g ('exposure')e(column)h(value)907 5694 y(greater)g(than)g(100.)p eop end %%Page: 137 145 TeXDict begin 137 144 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.137) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.8.)73 b(IMA)m(GE)31 b(SECTION)2744 b Fj(137)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (section.10.8) cvn /DEST pdfmark end 0 464 a 91 x Ff(10.8)136 b(Image)46 b(Section)0 811 y Fj(A)41 b(virtual)g(\014le)f(con)m(taining)i(a)f (rectangular)h(subsection)e(of)h(an)g(image)g(can)g(b)s(e)f(extracted)i (and)e(op)s(ened)g(b)m(y)0 924 y(sp)s(ecifying)32 b(the)h(range)g(of)g (pixels)g(\(start:end\))g(along)h(eac)m(h)g(axis)f(to)g(b)s(e)f (extracted)i(from)e(the)h(original)g(image.)0 1037 y(One)d(can)h(also)h (sp)s(ecify)e(an)h(optional)h(pixel)f(incremen)m(t)g (\(start:end:step\))h(for)f(eac)m(h)h(axis)f(of)g(the)g(input)e(image.) 0 1149 y(A)f(pixel)f(step)h(=)f(1)h(will)g(b)s(e)f(assumed)f(if)i(it)g (is)f(not)h(sp)s(eci\014ed.)39 b(If)27 b(the)h(start)g(pixel)g(is)f (larger)i(then)e(the)h(end)e(pixel,)0 1262 y(then)32 b(the)g(image)h(will)f(b)s(e)f(\015ipp)s(ed)f(\(pro)s(ducing)h(a)h (mirror)g(image\))h(along)g(that)f(dimension.)45 b(An)32 b(asterisk,)h('*',)0 1375 y(ma)m(y)39 b(b)s(e)e(used)h(to)h(sp)s(ecify) f(the)g(en)m(tire)h(range)g(of)f(an)h(axis,)i(and)c('-*')j(will)e (\015ip)g(the)g(en)m(tire)h(axis.)65 b(The)38 b(input)0 1488 y(image)31 b(can)f(b)s(e)f(in)g(the)h(primary)f(arra)m(y)-8 b(,)31 b(in)e(an)g(image)i(extension,)g(or)f(con)m(tained)g(in)g(a)g(v) m(ector)h(cell)g(of)f(a)g(binary)0 1601 y(table.)40 b(In)25 b(the)h(later)h(2)f(cases)h(the)f(extension)h(name)f(or)f(n)m(um)m(b)s (er)g(m)m(ust)h(b)s(e)f(sp)s(eci\014ed)g(b)s(efore)h(the)g(image)h (section)0 1714 y(sp)s(eci\014er.)0 1874 y(Examples:)95 2157 y Fe(myfile.fits[1:512:2,)43 b(2:512:2])i(-)95 b(open)47 b(a)h(256x256)d(pixel)i(image)668 2270 y(consisting)e(of)i(the)g(odd)g (numbered)f(columns)g(\(1st)g(axis\))h(and)668 2383 y(the)g(even)g (numbered)e(rows)i(\(2nd)g(axis\))f(of)h(the)g(image)f(in)i(the)668 2496 y(primary)e(array)g(of)i(the)e(file.)95 2721 y(myfile.fits[*,)e (512:256])i(-)h(open)g(an)g(image)g(consisting)e(of)i(all)g(the)g (columns)668 2834 y(in)g(the)g(input)g(image,)f(but)h(only)f(rows)h (256)g(through)f(512.)668 2947 y(The)h(image)f(will)h(be)g(flipped)f (along)g(the)h(2nd)g(axis)g(since)668 3060 y(the)g(starting)f(pixel)g (is)h(greater)f(than)h(the)g(ending)f(pixel.)95 3286 y(myfile.fits[*:2,)e(512:256:2])h(-)i(same)g(as)g(above)f(but)h (keeping)f(only)668 3399 y(every)h(other)f(row)h(and)g(column)f(in)h (the)g(input)f(image.)95 3625 y(myfile.fits[-*,)e(*])j(-)h(copy)e(the)h (entire)f(image,)g(flipping)g(it)h(along)668 3738 y(the)g(first)f (axis.)95 3963 y(myfile.fits[3][1:256,1:256)o(])c(-)47 b(opens)g(a)g(subsection)e(of)i(the)g(image)g(that)668 4076 y(is)g(in)h(the)e(3rd)h(extension)f(of)h(the)g(file.)95 4302 y(myfile.fits[4;)d(images\(12\)][1:10,1:10])e(-)48 b(open)e(an)h(image)g(consisting)286 4415 y(of)h(the)e(first)h(10)g (pixels)f(in)h(both)g(dimensions.)e(The)i(original)286 4528 y(image)g(resides)f(in)h(the)g(12th)f(row)h(of)g(the)g('images')f (vector)286 4641 y(column)g(in)i(the)f(table)f(in)h(the)g(4th)g (extension)e(of)i(the)g(file.)0 4924 y Fj(When)23 b(CFITSIO)f(op)s(ens) h(an)g(image)h(section)h(it)f(\014rst)f(creates)h(a)g(temp)s(orary)f (\014le)h(con)m(taining)h(the)e(image)i(section)0 5036 y(plus)30 b(a)h(cop)m(y)h(of)f(an)m(y)g(other)g(HDUs)g(in)g(the)g (\014le.)42 b(\(If)31 b(a)g(`#')g(c)m(haracter)h(is)f(app)s(ended)e(to) j(the)f(name)f(or)h(n)m(um)m(b)s(er)0 5149 y(of)i(the)g(image)i(HDU,)e (as)h(in)e("m)m(y\014le.\014ts[1#][1:200,1:200)q(]",)40 b(then)33 b(the)g(other)g(HDUs)h(in)e(the)h(input)g(\014le)g(will)0 5262 y(not)j(b)s(e)f(copied)i(in)m(to)f(memory\).)58 b(This)35 b(temp)s(orary)g(\014le)h(is)g(then)f(op)s(ened)h(b)m(y)f (the)h(application)h(program,)h(so)0 5375 y(it)32 b(is)g(not)f(p)s (ossible)h(to)g(write)g(to)g(or)f(mo)s(dify)g(the)h(input)e(\014le)i (when)f(sp)s(ecifying)g(an)g(image)i(section.)45 b(Note)33 b(that)0 5488 y(CFITSIO)27 b(automatically)32 b(up)s(dates)c(the)h(w)m (orld)f(co)s(ordinate)i(system)f(k)m(eyw)m(ords)g(in)f(the)h(header)g (of)g(the)g(image)0 5601 y(section,)h(if)f(they)g(exist,)h(so)f(that)g (the)g(co)s(ordinate)h(asso)s(ciated)g(with)e(eac)m(h)i(pixel)f(in)g (the)g(image)h(section)g(will)f(b)s(e)0 5714 y(computed)h(correctly)-8 b(.)p eop end %%Page: 138 146 TeXDict begin 138 145 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.138) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(138)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (section.10.9) cvn /DEST pdfmark end 0 464 a 91 x Ff(10.9)136 b(Image)46 b(T)-11 b(ransform)44 b(Filters)0 807 y Fj(CFITSIO)33 b(can)h(apply)g(a)h(user-sp)s(eci\014ed)e (mathematical)j(function)e(to)h(the)g(v)-5 b(alue)34 b(of)h(ev)m(ery)g(pixel)f(in)g(a)h(FITS)0 920 y(image,)29 b(th)m(us)e(creating)h(a)g(new)e(virtual)h(image)i(in)d(computer)h (memory)g(that)h(is)f(then)f(op)s(ened)h(and)f(read)h(b)m(y)g(the)0 1033 y(application)32 b(program.)40 b(The)30 b(original)i(FITS)d(image) j(is)e(not)h(mo)s(di\014ed)e(b)m(y)h(this)h(pro)s(cess.)0 1193 y(The)20 b(image)j(transformation)e(sp)s(eci\014er)f(is)h(app)s (ended)e(to)j(the)f(input)f(FITS)h(\014le)g(name)g(and)f(is)h(enclosed) h(in)e(square)0 1306 y(brac)m(k)m(ets.)42 b(It)29 b(b)s(egins)f(with)h (the)g(letters)i('PIX')e(to)h(distinguish)e(it)i(from)e(other)i(t)m(yp) s(es)f(of)g(FITS)f(\014le)h(\014lters)g(that)0 1419 y(are)36 b(recognized)i(b)m(y)e(CFITSIO.)e(The)i(image)h(transforming)f (function)f(ma)m(y)i(use)f(an)m(y)g(of)g(the)h(mathematical)0 1532 y(op)s(erators)44 b(listed)h(in)f(the)h(follo)m(wing)h('Ro)m(w)f (Filtering)g(Sp)s(eci\014cation')g(section)h(of)e(this)h(do)s(cumen)m (t.)82 b(Some)0 1645 y(examples)31 b(of)f(image)i(transform)e (\014lters)g(are:)48 1913 y Fe([pix)46 b(X)i(*)f(2.0])715 b(-)48 b(multiply)d(each)i(pixel)f(by)h(2.0)48 2026 y([pix)f (sqrt\(X\)])714 b(-)48 b(take)e(the)h(square)f(root)h(of)g(each)g (pixel)48 2139 y([pix)f(X)i(+)f(#ZEROPT)571 b(-)48 b(add)e(the)h(value) g(of)g(the)g(ZEROPT)f(keyword)48 2252 y([pix)g(X>0)h(?)h(log10\(X\))d (:)j(-99.])e(-)i(if)f(the)g(pixel)f(value)g(is)i(greater)1480 2365 y(than)e(0,)h(compute)f(the)h(base)g(10)g(log,)1480 2478 y(else)f(set)h(the)g(pixel)f(=)i(-99.)0 2746 y Fj(Use)24 b(the)g(letter)h('X')f(in)f(the)h(expression)g(to)g(represen)m(t)g(the) g(curren)m(t)f(pixel)h(v)-5 b(alue)24 b(in)f(the)h(image.)40 b(The)23 b(expression)0 2859 y(is)38 b(ev)-5 b(aluated)39 b(indep)s(enden)m(tly)e(for)g(eac)m(h)i(pixel)f(in)g(the)g(image)h(and) e(ma)m(y)h(b)s(e)g(a)g(function)f(of)h(1\))h(the)f(original)0 2971 y(pixel)32 b(v)-5 b(alue,)32 b(2\))g(the)f(v)-5 b(alue)32 b(of)f(other)h(pixels)f(in)g(the)g(image)i(at)f(a)f(giv)m(en) i(relativ)m(e)g(o\013set)f(from)f(the)g(p)s(osition)h(of)0 3084 y(the)d(pixel)f(that)h(is)g(b)s(eing)f(ev)-5 b(aluated,)30 b(and)e(3\))h(the)g(v)-5 b(alue)29 b(of)f(an)m(y)h(header)f(k)m(eyw)m (ords.)41 b(Header)29 b(k)m(eyw)m(ord)g(v)-5 b(alues)0 3197 y(are)31 b(represen)m(ted)f(b)m(y)g(the)h(name)f(of)h(the)f(k)m (eyw)m(ord)h(preceded)f(b)m(y)h(the)f('#')h(sign.)0 3357 y(T)-8 b(o)35 b(access)h(the)f(the)g(v)-5 b(alue)35 b(of)g(adjacen)m(t) h(pixels)f(in)f(the)h(image,)i(sp)s(ecify)e(the)g(\(1-D\))h(o\013set)g (from)e(the)h(curren)m(t)0 3470 y(pixel)c(in)f(curly)g(brac)m(k)m(ets.) 42 b(F)-8 b(or)31 b(example)48 3738 y Fe([pix)94 b(\(x{-1})46 b(+)i(x)f(+)h(x{+1}\))e(/)h(3])0 4006 y Fj(will)25 b(replace)g(eac)m(h) h(pixel)f(v)-5 b(alue)25 b(with)f(the)h(running)e(mean)i(of)f(the)h(v) -5 b(alues)25 b(of)g(that)g(pixel)g(and)f(it's)h(2)g(neigh)m(b)s(oring) 0 4119 y(pixels.)40 b(Note)30 b(that)g(in)e(this)g(notation)i(the)f (image)h(is)f(treated)g(as)g(a)g(1-D)h(arra)m(y)-8 b(,)30 b(where)e(eac)m(h)i(ro)m(w)f(of)g(the)g(image)0 4232 y(\(or)c(higher)f(dimensional)g(cub)s(e\))h(is)f(app)s(ended)f(one)h (after)h(another)g(in)f(one)h(long)g(arra)m(y)g(of)f(pixels.)39 b(It)25 b(is)f(p)s(ossible)0 4345 y(to)35 b(refer)f(to)h(pixels)f(in)g (the)g(ro)m(ws)g(ab)s(o)m(v)m(e)h(or)g(b)s(elo)m(w)f(the)g(curren)m(t)g (pixel)h(b)m(y)f(using)f(the)h(v)-5 b(alue)35 b(of)f(the)h(NAXIS1)0 4458 y(header)30 b(k)m(eyw)m(ord.)41 b(F)-8 b(or)32 b(example)48 4726 y Fe([pix)46 b(\(x{-#NAXIS1})f(+)i(x)h(+)f(x{#NAXIS1}\))e(/)i(3])0 4994 y Fj(will)34 b(compute)f(the)h(mean)f(of)g(eac)m(h)i(image)f (pixel)g(and)e(the)i(pixels)f(immediately)i(ab)s(o)m(v)m(e)f(and)f(b)s (elo)m(w)g(it)h(in)f(the)0 5107 y(adjacen)m(t)27 b(ro)m(ws)f(of)g(the)f (image.)41 b(The)25 b(follo)m(wing)i(more)f(complex)h(example)f (creates)h(a)f(smo)s(othed)g(virtual)g(image)0 5220 y(where)k(eac)m(h)h (pixel)g(is)g(a)f(3)h(x)f(3)h(b)s(o)m(xcar)g(a)m(v)m(erage)i(of)d(the)h (input)e(image)j(pixels:)95 5488 y Fe([pix)47 b(\(X)g(+)h(X{-1})e(+)i (X{+1})286 5601 y(+)g(X{-#NAXIS1})d(+)i(X{-#NAXIS1)e(-)i(1})h(+)f (X{-#NAXIS1)e(+)j(1})286 5714 y(+)g(X{#NAXIS1})d(+)i(X{#NAXIS1)f(-)h (1})g(+)h(X{#NAXIS1)d(+)i(1}\))g(/)h(9.])p eop end %%Page: 139 147 TeXDict begin 139 146 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.139) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.10.)73 b(COLUMN)30 b(AND)h(KEYW)m(ORD)g(FIL)-8 b(TERING)31 b(SPECIFICA)-8 b(TION)984 b Fj(139)0 555 y(If)31 b(the)h(pixel)g(o\013set)h(extends)f (b)s(ey)m(ond)f(the)h(\014rst)f(or)h(last)h(pixel)f(in)f(the)h(image,)i (the)e(function)g(will)g(ev)-5 b(aluate)33 b(to)0 668 y(unde\014ned,)28 b(or)j(NULL.)0 828 y(F)-8 b(or)39 b(complex)g(or)g (commonly)g(used)e(image)j(\014ltering)f(op)s(erations,)i(one)d(can)h (write)g(the)f(expression)h(in)m(to)g(an)0 941 y(external)i(text)h (\014le)f(and)f(then)g(imp)s(ort)g(it)h(in)m(to)h(the)e(\014lter)h (using)f(the)h(syn)m(tax)g('[pix)g(@\014lename.txt]'.)72 b(The)0 1054 y(mathematical)29 b(expression)e(can)g(extend)g(o)m(v)m (er)i(m)m(ultiple)e(lines)g(of)h(text)g(in)e(the)h(\014le.)40 b(An)m(y)27 b(lines)g(in)g(the)g(external)0 1167 y(text)h(\014le)e (that)i(b)s(egin)e(with)g(2)h(slash)f(c)m(haracters)i(\('//'\))h(will)e (b)s(e)f(ignored)h(and)f(ma)m(y)h(b)s(e)f(used)g(to)h(add)f(commen)m (ts)0 1280 y(in)m(to)31 b(the)g(\014le.)0 1440 y(By)c(default,)g(the)f (datat)m(yp)s(e)i(of)e(the)g(resulting)h(image)g(will)g(b)s(e)e(the)i (same)f(as)h(the)f(original)i(image,)g(but)e(one)g(ma)m(y)0 1553 y(force)31 b(a)g(di\013eren)m(t)g(datat)m(yp)s(e)g(b)m(y)f(app)s (ended)f(a)h(co)s(de)h(letter)h(to)f(the)f('pix')h(k)m(eyw)m(ord:)286 1786 y Fe(pixb)95 b(-)g(8-bit)46 b(byte)190 b(image)46 b(with)h(BITPIX)f(=)143 b(8)286 1898 y(pixi)95 b(-)47 b(16-bit)f(integer)g(image)g(with)h(BITPIX)f(=)95 b(16)286 2011 y(pixj)g(-)47 b(32-bit)f(integer)g(image)g(with)h(BITPIX)f(=)95 b(32)286 2124 y(pixr)g(-)47 b(32-bit)f(float)142 b(image)46 b(with)h(BITPIX)f(=)i(-32)286 2237 y(pixd)95 b(-)47 b(64-bit)f(float) 142 b(image)46 b(with)h(BITPIX)f(=)i(-64)0 2470 y Fj(Also)23 b(b)m(y)f(default,)j(an)m(y)d(other)h(HDUs)g(in)f(the)g(input)g(\014le) g(will)h(b)s(e)e(copied)i(without)g(c)m(hange)g(to)g(the)g(output)f (virtual)0 2583 y(FITS)k(\014le,)h(but)f(one)g(ma)m(y)h(discard)f(the)h (other)f(HDUs)h(b)m(y)f(adding)g(the)h(n)m(um)m(b)s(er)e('1')i(to)g (the)g('pix')f(k)m(eyw)m(ord)h(\(and)0 2696 y(follo)m(wing)32 b(an)m(y)f(optional)g(datat)m(yp)s(e)g(co)s(de)g(letter\).)42 b(F)-8 b(or)32 b(example:)239 2928 y Fe(myfile.fits[3][pixr1)90 b(sqrt\(X\)])0 3161 y Fj(will)23 b(create)i(a)e(virtual)g(FITS)f (\014le)h(con)m(taining)h(only)f(a)g(primary)f(arra)m(y)i(image)g(with) e(32-bit)i(\015oating)g(p)s(oin)m(t)f(pixels)0 3274 y(that)29 b(ha)m(v)m(e)h(a)f(v)-5 b(alue)30 b(equal)f(to)g(the)g(square)g(ro)s (ot)g(of)g(the)g(pixels)f(in)h(the)g(image)h(that)f(is)g(in)f(the)h (3rd)f(extension)i(of)0 3387 y(the)h('m)m(y\014le.\014ts')g(\014le.)0 3537 y SDict begin H.S end 0 3537 a 0 3537 a SDict begin 13.6 H.A end 0 3537 a 0 3537 a SDict begin [/View [/XYZ H.V]/Dest (section.10.10) cvn /DEST pdfmark end 0 3537 a 179 x Ff(10.10)136 b(Column)45 b(and)g(Keyw)l(ord)g(Filtering)h(Sp)t (eci\014cation)0 3966 y Fj(The)27 b(optional)i(column/k)m(eyw)m(ord)g (\014ltering)f(sp)s(eci\014er)f(is)h(used)f(to)i(mo)s(dify)e(the)h (column)g(structure)f(and/or)h(the)0 4079 y(header)38 b(k)m(eyw)m(ords)h(in)f(the)h(HDU)g(that)h(w)m(as)f(selected)h(with)e (the)h(previous)f(HDU)h(lo)s(cation)h(sp)s(eci\014er.)65 b(This)0 4192 y(\014ltering)42 b(sp)s(eci\014er)f(m)m(ust)h(b)s(e)f (enclosed)i(in)e(square)h(brac)m(k)m(ets)h(and)e(can)h(b)s(e)f (distinguished)g(from)h(a)g(general)0 4305 y(ro)m(w)d(\014lter)g(sp)s (eci\014er)f(\(describ)s(ed)g(b)s(elo)m(w\))h(b)m(y)g(the)g(fact)h (that)f(it)g(b)s(egins)f(with)h(the)g(string)g('col)h(')f(and)f(is)h (not)0 4418 y(immediately)30 b(follo)m(w)m(ed)g(b)m(y)e(an)g(equals)h (sign.)40 b(The)28 b(original)h(\014le)f(is)h(not)f(c)m(hanged)h(b)m(y) f(this)h(\014ltering)f(op)s(eration,)0 4531 y(and)c(instead)h(the)g(mo) s(di\014cations)g(are)g(made)g(on)f(a)h(cop)m(y)h(of)e(the)h(input)f (FITS)g(\014le)h(\(usually)g(in)f(memory\),)i(whic)m(h)0 4644 y(also)31 b(con)m(tains)g(a)g(cop)m(y)g(of)f(all)h(the)f(other)g (HDUs)h(in)f(the)g(\014le.)41 b(\(If)30 b(a)g(`#')h(c)m(haracter)g(is)f (app)s(ended)f(to)i(the)f(name)0 4757 y(or)d(n)m(um)m(b)s(er)e(of)i (the)g(table)g(HDU)h(then)e(only)h(the)g(primary)f(arra)m(y)-8 b(,)28 b(and)e(none)h(of)g(the)f(other)h(HDUs)h(in)e(the)h(input)0 4869 y(\014le)i(will)f(b)s(e)g(copied)h(in)m(to)g(memory\).)41 b(This)27 b(temp)s(orary)h(\014le)h(is)f(passed)g(to)h(the)g (application)h(program)e(and)g(will)0 4982 y(p)s(ersist)e(only)i(un)m (til)f(the)g(\014le)g(is)h(closed)f(or)g(un)m(til)h(the)f(program)g (exits,)i(unless)d(the)h(out\014le)h(sp)s(eci\014er)e(\(see)i(ab)s(o)m (v)m(e\))0 5095 y(is)i(also)i(supplied.)0 5255 y(The)f(column/k)m(eyw)m (ord)h(\014lter)f(can)g(b)s(e)g(used)f(to)i(p)s(erform)e(the)i(follo)m (wing)g(op)s(erations.)44 b(More)32 b(than)f(one)g(op)s(er-)0 5368 y(ation)g(ma)m(y)g(b)s(e)f(sp)s(eci\014ed)g(b)m(y)g(separating)h (them)f(with)h(commas)f(or)h(semi-colons.)136 5601 y Fc(\017)46 b Fj(Cop)m(y)36 b(only)g(a)g(sp)s(eci\014ed)g(list)g(of)g (columns)g(columns)f(to)i(the)f(\014ltered)g(input)f(\014le.)57 b(The)36 b(list)g(of)g(column)227 5714 y(name)41 b(should)e(b)s(e)g (separated)i(b)m(y)f(commas)h(or)f(semi-colons.)72 b(Wild)41 b(card)f(c)m(haracters)h(ma)m(y)g(b)s(e)f(used)p eop end %%Page: 140 148 TeXDict begin 140 147 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.140) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(140)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)227 555 y Fj(in)38 b(the)f(column)h(names)g(to)g(matc)m(h)g(m)m (ultiple)h(columns.)62 b(If)37 b(the)h(expression)g(con)m(tains)g(b)s (oth)f(a)h(list)h(of)227 668 y(columns)29 b(to)h(b)s(e)f(included)g (and)g(columns)g(to)h(b)s(e)e(deleted,)j(then)e(all)h(the)g(columns)f (in)g(the)h(original)g(table)227 781 y(except)36 b(the)e(explicitly)i (deleted)f(columns)f(will)h(app)s(ear)e(in)h(the)h(\014ltered)f(table)h (\(i.e.,)i(there)e(is)f(no)g(need)227 894 y(to)d(explicitly)h(list)f (the)g(columns)f(to)h(b)s(e)f(included)f(if)i(an)m(y)f(columns)h(are)f (b)s(eing)g(deleted\).)136 1068 y Fc(\017)46 b Fj(Delete)32 b(a)d(column)g(or)g(k)m(eyw)m(ord)h(b)m(y)f(listing)h(the)f(name)g (preceded)g(b)m(y)g(a)g(min)m(us)g(sign)g(or)g(an)g(exclamation)227 1181 y(mark)c(\(!\),)h(e.g.,)i('-TIME')d(will)g(delete)h(the)e(TIME)h (column)f(if)g(it)i(exists,)g(otherwise)f(the)g(TIME)f(k)m(eyw)m(ord.) 227 1294 y(An)35 b(error)f(is)h(returned)e(if)i(neither)f(a)i(column)e (nor)g(k)m(eyw)m(ord)h(with)g(this)f(name)h(exists.)54 b(Note)36 b(that)g(the)227 1407 y(exclamation)27 b(p)s(oin)m(t,)g(')10 b(!',)27 b(is)e(a)g(sp)s(ecial)h(UNIX)f(c)m(haracter,)j(so)d(if)g(it)h (is)f(used)f(on)h(the)g(command)g(line)g(rather)227 1520 y(than)33 b(en)m(tered)h(at)g(a)g(task)g(prompt,)f(it)h(m)m(ust)f(b)s (e)g(preceded)g(b)m(y)g(a)h(bac)m(kslash)g(to)g(force)g(the)f(UNIX)h (shell)227 1633 y(to)d(ignore)g(it.)136 1808 y Fc(\017)46 b Fj(Rename)29 b(an)g(existing)g(column)f(or)h(k)m(eyw)m(ord)g(with)f (the)h(syn)m(tax)g('NewName)h(==)e(OldName'.)40 b(An)28 b(error)227 1920 y(is)j(returned)e(if)h(neither)h(a)f(column)g(nor)g(k) m(eyw)m(ord)h(with)f(this)h(name)f(exists.)136 2095 y Fc(\017)46 b Fj(App)s(end)37 b(a)j(new)f(column)f(or)i(k)m(eyw)m(ord)f (to)h(the)f(table.)68 b(T)-8 b(o)40 b(create)g(a)g(column,)h(giv)m(e)g (the)e(new)g(name,)227 2208 y(optionally)c(follo)m(w)m(ed)f(b)m(y)f (the)g(data)h(t)m(yp)s(e)f(in)f(paren)m(theses,)i(follo)m(w)m(ed)h(b)m (y)e(a)g(single)h(equals)f(sign)g(and)f(an)227 2321 y(expression)j(to)h (b)s(e)e(used)g(to)i(compute)f(the)g(v)-5 b(alue)35 b(\(e.g.,)j('new)m (col\(1J\))f(=)e(0')g(will)h(create)g(a)f(new)g(32-bit)227 2434 y(in)m(teger)i(column)d(called)j('new)m(col')f(\014lled)f(with)g (zeros\).)55 b(The)35 b(data)g(t)m(yp)s(e)h(is)f(sp)s(eci\014ed)f (using)g(the)i(same)227 2547 y(syn)m(tax)j(that)g(is)f(allo)m(w)m(ed)i (for)e(the)g(v)-5 b(alue)39 b(of)f(the)g(FITS)f(TF)m(ORMn)h(k)m(eyw)m (ord)h(\(e.g.,)j('I',)d('J',)f('E',)h('D',)227 2660 y(etc.)66 b(for)38 b(binary)f(tables,)42 b(and)37 b('I8',)k(F12.3',)i('E20.12',)g (etc.)65 b(for)38 b(ASCI)s(I)f(tables\).)66 b(If)37 b(the)i(data)g(t)m (yp)s(e)227 2773 y(is)c(not)g(sp)s(eci\014ed)f(then)g(an)g(appropriate) h(data)g(t)m(yp)s(e)g(will)g(b)s(e)f(c)m(hosen)h(dep)s(ending)e(on)h (the)h(form)f(of)h(the)227 2885 y(expression)44 b(\(ma)m(y)g(b)s(e)f(a) h(c)m(haracter)i(string,)h(logical,)j(bit,)d(long)d(in)m(teger,)49 b(or)43 b(double)h(column\).)80 b(An)227 2998 y(appropriate)39 b(v)m(ector)i(coun)m(t)e(\(in)g(the)g(case)h(of)f(binary)f(tables\))i (will)f(also)h(b)s(e)e(added)g(if)h(not)g(explicitly)227 3111 y(sp)s(eci\014ed.)227 3255 y(When)26 b(creating)h(a)f(new)f(k)m (eyw)m(ord,)j(the)e(k)m(eyw)m(ord)g(name)g(m)m(ust)g(b)s(e)f(preceded)g (b)m(y)h(a)g(p)s(ound)e(sign)h('#',)j(and)227 3368 y(the)h(expression)f (m)m(ust)g(ev)-5 b(aluate)30 b(to)f(a)g(scalar)g(\(i.e.,)h(cannot)f(ha) m(v)m(e)h(a)f(column)f(name)g(in)g(the)h(expression\).)227 3481 y(The)j(commen)m(t)i(string)f(for)f(the)h(k)m(eyw)m(ord)h(ma)m(y)f (b)s(e)f(sp)s(eci\014ed)g(in)g(paren)m(theses)h(immediately)h(follo)m (wing)227 3594 y(the)27 b(k)m(eyw)m(ord)g(name)f(\(instead)h(of)g (supplying)e(a)i(data)g(t)m(yp)s(e)g(as)f(in)g(the)h(case)g(of)g (creating)h(a)f(new)f(column\).)227 3707 y(If)e(the)h(k)m(eyw)m(ord)g (name)f(ends)g(with)g(a)h(p)s(ound)d(sign)i('#',)i(then)e(c\014tsio)i (will)e(substitute)h(the)f(n)m(um)m(b)s(er)f(of)i(the)227 3820 y(most)31 b(recen)m(tly)h(referenced)e(column)h(for)f(the)h(#)f(c) m(haracter)i(.)41 b(This)29 b(is)i(esp)s(ecially)h(useful)d(when)h (writing)227 3932 y(a)c(column-related)g(k)m(eyw)m(ord)g(lik)m(e)g (TUNITn)e(for)h(a)h(newly)f(created)h(column,)g(as)g(sho)m(wn)e(in)h (the)g(follo)m(wing)227 4045 y(examples.)227 4189 y(COMMENT)30 b(and)g(HISTOR)-8 b(Y)30 b(k)m(eyw)m(ords)g(ma)m(y)h(also)h(b)s(e)e (created)h(with)f(the)h(follo)m(wing)g(syn)m(tax:)370 4393 y Fe(#COMMENT)46 b(=)h('This)g(is)g(a)g(comment)f(keyword')370 4506 y(#HISTORY)g(=)h('This)g(is)g(a)g(history)f(keyword')227 4710 y Fj(Note)d(that)f(the)f(equal)h(sign)f(and)f(the)i(quote)f(c)m (haracters)i(will)f(b)s(e)e(remo)m(v)m(ed,)45 b(so)d(that)f(the)h (resulting)227 4823 y(header)30 b(k)m(eyw)m(ords)h(in)f(these)h(cases)g (will)g(lo)s(ok)g(lik)m(e)h(this:)370 5027 y Fe(COMMENT)46 b(This)h(is)g(a)h(comment)d(keyword)370 5140 y(HISTORY)h(This)h(is)g(a) h(history)d(keyword)227 5344 y Fj(These)29 b(t)m(w)m(o)h(sp)s(ecial)f (k)m(eyw)m(ords)h(are)f(alw)m(a)m(ys)h(app)s(ended)d(to)j(the)f(end)f (of)h(the)g(header)g(and)f(will)h(not)g(a\013ect)227 5457 y(an)m(y)i(previously)f(existing)h(COMMENT)f(or)h(HISTOR)-8 b(Y)30 b(k)m(eyw)m(ords.)227 5601 y(It)j(is)f(p)s(ossible)h(to)g (delete)h(an)e(existing)i(k)m(eyw)m(ord)f(using)f(a)g(preceding)h Fe('-')p Fj(.)46 b(Either)33 b(of)f(these)h(examples)227 5714 y(will)e(delete)h(the)e(k)m(eyw)m(ord)h(named)f Fe(VEL)p Fj(.)p eop end %%Page: 141 149 TeXDict begin 141 148 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.141) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.10.)73 b(COLUMN)30 b(AND)h(KEYW)m(ORD)g(FIL)-8 b(TERING)31 b(SPECIFICA)-8 b(TION)984 b Fj(141)323 555 y Fe(-VEL;)323 668 y(-#VEL;)136 863 y Fc(\017)46 b Fj(Recompute)f(\(o)m(v)m(erwrite\))i(the)d(v)-5 b(alues)44 b(in)g(an)g(existing)i(column)e(or)g(k)m(eyw)m(ord)g(b)m(y)g (giving)i(the)e(name)227 976 y(follo)m(w)m(ed)32 b(b)m(y)f(an)f(equals) h(sign)f(and)g(an)g(arithmetic)i(expression.)0 1205 y(The)23 b(expression)g(that)i(is)e(used)g(when)g(app)s(ending)f(or)h (recomputing)h(columns)f(or)h(k)m(eyw)m(ords)g(can)g(b)s(e)f (arbitrarily)0 1318 y(complex)36 b(and)g(ma)m(y)g(b)s(e)f(a)h(function) g(of)g(other)g(header)g(k)m(eyw)m(ord)g(v)-5 b(alues)36 b(and)f(other)h(columns)g(\(in)g(the)g(same)0 1431 y(ro)m(w\).)63 b(The)37 b(full)g(syn)m(tax)i(and)e(a)m(v)-5 b(ailable)40 b(functions)d(for)g(the)h(expression)f(are)h(describ)s(ed)f(b)s(elo)m (w)h(in)f(the)h(ro)m(w)0 1544 y(\014lter)30 b(sp)s(eci\014cation)i (section.)0 1704 y(If)27 b(the)h(expression)g(con)m(tains)g(b)s(oth)f (a)h(list)h(of)f(columns)f(to)h(b)s(e)g(included)e(and)i(columns)f(to)h (b)s(e)f(deleted,)j(then)d(all)0 1817 y(the)34 b(columns)g(in)g(the)g (original)h(table)g(except)g(the)f(explicitly)i(deleted)f(columns)e (will)i(app)s(ear)e(in)h(the)g(\014ltered)0 1930 y(table.)40 b(If)26 b(no)g(columns)f(to)i(b)s(e)f(deleted)g(are)h(sp)s(eci\014ed,)f (then)g(only)g(the)h(columns)e(that)i(are)f(explicitly)i(listed)f(will) 0 2043 y(b)s(e)k(included)g(in)g(the)h(\014ltered)f(output)h(table.)45 b(T)-8 b(o)32 b(include)f(all)i(the)e(columns,)h(add)f(the)h('*')g (wildcard)g(sp)s(eci\014er)0 2156 y(at)f(the)g(end)e(of)i(the)f(list,)i (as)e(sho)m(wn)g(in)g(the)h(examples.)0 2316 y(F)-8 b(or)33 b(complex)f(or)g(commonly)h(used)e(op)s(erations,)i(one)f(can)h(place)g (the)f(op)s(erations)g(in)m(to)h(an)f(external)h(text)g(\014le)0 2429 y(and)39 b(imp)s(ort)h(it)g(in)m(to)h(the)f(column)g(\014lter)g (using)f(the)h(syn)m(tax)h('[col)g(@\014lename.txt]'.)71 b(The)39 b(op)s(erations)i(can)0 2541 y(extend)35 b(o)m(v)m(er)h(m)m (ultiple)g(lines)f(of)g(the)g(\014le,)h(but)e(m)m(ultiple)i(op)s (erations)f(m)m(ust)f(still)i(b)s(e)e(separated)i(b)m(y)e(commas)0 2654 y(or)e(semi-colons.)47 b(An)m(y)32 b(lines)h(in)f(the)g(external)h (text)g(\014le)f(that)h(b)s(egin)e(with)h(2)h(slash)e(c)m(haracters)j (\('//'\))g(will)f(b)s(e)0 2767 y(ignored)d(and)g(ma)m(y)h(b)s(e)f (used)g(to)h(add)e(commen)m(ts)j(in)m(to)f(the)g(\014le.)0 2927 y(It)36 b(is)f(p)s(ossible)g(to)h(use)g(wildcard)f(syn)m(tax)h(to) g(delete)h(either)f(k)m(eyw)m(ords)g(or)f(columns)g(that)h(matc)m(h)h (a)f(pattern.)0 3040 y(Recall)c(that)f(to)g(delete)h(either)f(a)f(k)m (eyw)m(ord)h(or)f(a)h(column,)g(precede)f(its)h(name)f(with)g(a)h Fe('-')f Fj(c)m(haracter.)0 3201 y(Wildcard)d(patterns)f(are:)39 b Fe('*')p Fj(,)27 b(whic)m(h)f(matc)m(hes)i(an)m(y)f(string)f(of)h(c)m (haracters;)i Fe('?')p Fj(,)e(whic)m(h)f(matc)m(hes)h(an)m(y)g(single)0 3313 y(c)m(haracter;)32 b(and)e Fe('#')f Fj(whic)m(h)i(matc)m(hes)g(an) m(y)g(n)m(umerical)g(string.)40 b(F)-8 b(or)32 b(example)f(these)f (statemen)m(ts:)95 3523 y Fe(-VEL*;)333 b(#)47 b(remove)f(single)h (column)f(\(or)h(keyword\))e(beginning)g(with)i(VEL)95 3636 y(-VEL_?;)285 b(#)47 b(remove)f(single)h(column)f(\(or)h (keyword\))e(VEL_?)h(where)h(?)g(is)g(any)g(character)95 3749 y(-#DEC_*;)237 b(#)47 b(remove)f(single)h(keyword)e(beginning)h (with)g(DEC_)95 3862 y(-#TUNIT#;)189 b(#)47 b(remove)f(single)h (keyword)e(TUNIT)i(ending)f(w.)h(number)0 4071 y Fj(will)28 b(remo)m(v)m(e)h(the)e(columns)h(or)f(k)m(eyw)m(ords)h(as)f(noted.)40 b(Be)29 b(a)m(w)m(are)f(that)g(if)g(a)g Fe('#')e Fj(is)i(not)f(presen)m (t,)i(the)e(CFITSIO)0 4184 y(engine)k(will)g(c)m(hec)m(k)g(for)g (columns)f(with)g(the)g(giv)m(en)i(name)e(\014rst,)g(follo)m(w)m(ed)i (b)m(y)e(k)m(eyw)m(ords.)0 4344 y(The)21 b(ab)s(o)m(v)m(e)i (expressions)e(will)g(only)h(delete)g(the)g Fa(\014rst)g Fj(item)g(whic)m(h)f(matc)m(hes)i(the)f(pattern.)37 b(If)21 b(follo)m(wing)i(columns)0 4457 y(or)38 b(k)m(eyw)m(ords)f(in)h(the)g (same)g(CHDU)f(matc)m(h)i(the)f(pattern,)h(they)f(will)g(not)g(b)s(e)f (deleted.)63 b(T)-8 b(o)38 b(delete)h Fa(zer)-5 b(o)40 b(or)0 4570 y(mor)-5 b(e)32 b Fj(k)m(eyw)m(ords)e(that)h(matc)m(h)h (the)e(pattern,)h(add)f(a)g(trailing)i Fe('+')p Fj(.)95 4780 y Fe(-VEL*;)381 b(#)47 b(remove)f(all)h(columns)f(\(or)h (keywords\))e(beginning)g(with)i(VEL)95 4893 y(-VEL_?;)333 b(#)47 b(remove)f(all)h(columns)f(\(or)h(keyword\))e(VEL_?)i(where)f(?) i(is)f(any)g(character)95 5005 y(-#DEC_*+;)237 b(#)47 b(remove)f(all)h(keywords)f(beginning)f(with)i(DEC_)95 5118 y(-#TUNIT#+;)189 b(#)47 b(remove)f(all)h(keywords)f(TUNIT)g (ending)g(w.)h(number)0 5328 y Fj(Note)c(that,)i(as)d(a)f(0-or-more)i (matc)m(hing)g(pattern,)h(this)e(form)f(will)g(succeed)h(if)g(the)f (requested)h(column)f(or)0 5441 y(k)m(eyw)m(ord)32 b(is)f(not)g(presen) m(t.)43 b(In)31 b(that)g(case,)i(the)e(deletion)i(expression)e(will)g (silen)m(tly)h(pro)s(ceed)f(as)h(if)f(no)g(deletion)0 5554 y(w)m(as)g(requested.)0 5714 y(Examples:)p eop end %%Page: 142 150 TeXDict begin 142 149 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.142) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(142)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)143 555 y Fe([col)47 b(Time,)f(rate])667 b(-)47 b(only)g(the)g(Time)g(and)g(rate)f(columns)g(will)1670 668 y(appear)h(in)g(the)g(filtered)e(input)i(file.)143 894 y([col)g(Time,)f(*raw])667 b(-)47 b(include)f(the)h(Time)g(column)f (and)h(any)g(other)1670 1007 y(columns)f(whose)h(name)f(ends)h(with)g ('raw'.)143 1233 y([col)g(-TIME,)f(Good)h(==)g(STATUS])141 b(-)47 b(deletes)f(the)h(TIME)g(column)f(and)1670 1346 y(renames)g(the)h(status)f(column)g(to)i('Good')143 1571 y([col)f(PI=PHA)f(*)h(1.1)g(+)h(0.2;)e(#TUNIT#\(column)e(units\))i(=)i ('counts';*])1575 1684 y(-)f(creates)f(new)h(PI)g(column)f(from)h(PHA)g (values)1670 1797 y(and)g(also)g(writes)f(the)h(TUNITn)f(keyword)1670 1910 y(for)h(the)g(new)g(column.)94 b(The)47 b(final)f('*')1670 2023 y(expression)f(means)i(preserve)e(all)i(the)1670 2136 y(columns)f(in)h(the)g(input)g(table)f(in)h(the)1670 2249 y(virtual)f(output)g(table;)94 b(without)46 b(the)h('*')1670 2362 y(the)g(output)f(table)h(would)f(only)h(contain)1670 2475 y(the)g(single)f('PI')h(column.)143 2700 y([col)g(rate)f(=)i (rate/exposure;)c(TUNIT#\(&\))h(=)j('counts/s';*])1575 2813 y(-)f(recomputes)e(the)i(rate)g(column)f(by)h(dividing)1670 2926 y(it)h(by)f(the)g(EXPOSURE)e(keyword)h(value.)g(This)1670 3039 y(also)h(modifies)f(the)h(value)f(of)h(the)g(TUNITn)1670 3152 y(keyword)f(for)h(this)g(column.)f(The)h(use)f(of)i(the)1670 3265 y('&')f(character)f(for)h(the)f(keyword)g(comment)1670 3378 y(string)h(means)f(preserve)f(the)i(existing)1670 3491 y(comment)f(string)g(for)h(that)g(keyword.)e(The)1670 3604 y(final)i('*')g(preserves)e(all)i(the)g(columns)1670 3717 y(in)h(the)f(input)f(table)g(in)h(the)g(virtual)1670 3830 y(output)g(table.)0 4035 y SDict begin H.S end 0 4035 a 0 4035 a SDict begin 13.6 H.A end 0 4035 a 0 4035 a SDict begin [/View [/XYZ H.V]/Dest (section.10.11) cvn /DEST pdfmark end 0 4035 a 177 x Ff(10.11)136 b(Ro)l(w)46 b(Filtering)g(Sp)t (eci\014cation)0 4472 y Fj(When)29 b(en)m(tering)h(the)f(name)g(of)g(a) g(FITS)f(table)i(that)g(is)e(to)i(b)s(e)e(op)s(ened)h(b)m(y)f(a)i (program,)f(an)g(optional)h(ro)m(w)f(\014lter)0 4585 y(ma)m(y)i(b)s(e)g(sp)s(eci\014ed)f(to)h(select)h(a)g(subset)e(of)h (the)g(ro)m(ws)f(in)h(the)g(table.)43 b(A)31 b(temp)s(orary)f(new)g (FITS)g(\014le)h(is)g(created)0 4698 y(on)40 b(the)f(\015y)g(whic)m(h)h (con)m(tains)h(only)e(those)h(ro)m(ws)g(for)f(whic)m(h)h(the)g(ro)m(w)f (\014lter)h(expression)f(ev)-5 b(aluates)42 b(to)e(true.)0 4811 y(The)29 b(primary)f(arra)m(y)i(and)f(an)m(y)g(other)h(extensions) g(in)f(the)g(input)g(\014le)g(are)h(also)g(copied)g(to)g(the)g(temp)s (orary)f(\014le.)0 4924 y(\(If)35 b(a)h(`#')f(c)m(haracter)i(is)e(app)s (ended)e(to)j(the)g(name)f(or)g(n)m(um)m(b)s(er)f(of)h(the)g(table)h (HDU)g(then)f(only)g(the)h(primary)0 5036 y(arra)m(y)-8 b(,)37 b(and)d(none)h(of)g(the)g(other)g(HDUs)h(in)e(the)i(input)e (\014le)g(will)i(b)s(e)e(copied)h(in)m(to)h(the)f(temp)s(orary)g (\014le\).)54 b(The)0 5149 y(original)30 b(FITS)f(\014le)g(is)g(closed) h(and)e(the)i(new)e(virtual)i(\014le)f(is)g(op)s(ened)f(b)m(y)h(the)h (application)g(program.)40 b(The)29 b(ro)m(w)0 5262 y(\014lter)37 b(expression)g(is)h(enclosed)g(in)f(square)g(brac)m(k)m(ets)i(follo)m (wing)g(the)e(\014le)h(name)f(and)g(extension)h(name)f(\(e.g.,)0 5375 y('\014le.\014ts[ev)m(en)m(ts][GRADE==50]')29 b(selects)d(only)f (those)h(ro)m(ws)f(where)f(the)h(GRADE)h(column)f(v)-5 b(alue)25 b(equals)g(50\).)0 5488 y(When)33 b(dealing)h(with)f(tables)g (where)g(eac)m(h)h(ro)m(w)f(has)g(an)g(asso)s(ciated)i(time)f(and/or)f (2D)g(spatial)i(p)s(osition,)f(the)0 5601 y(ro)m(w)e(\014lter)h (expression)e(can)i(also)g(b)s(e)f(used)f(to)i(select)h(ro)m(ws)e (based)g(on)g(the)g(times)h(in)f(a)g(Go)s(o)s(d)g(Time)g(In)m(terv)-5 b(als)0 5714 y(\(GTI\))31 b(extension,)g(or)f(on)h(spatial)g(p)s (osition)g(as)f(giv)m(en)i(in)e(a)g(SA)m(O-st)m(yle)i(region)f(\014le.) p eop end %%Page: 143 151 TeXDict begin 143 150 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.143) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.11.)73 b(R)m(O)m(W)31 b(FIL)-8 b(TERING)31 b(SPECIFICA)-8 b(TION)1936 b Fj(143)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.11.1) cvn /DEST pdfmark end 0 464 a 91 x Fd(10.11.1)113 b(General)38 b(Syn)m(tax)0 774 y Fj(The)32 b(ro)m(w)h(\014ltering)g(expression)g(can)g(b)s(e)f(an)h (arbitrarily)g(complex)g(series)g(of)g(op)s(erations)g(p)s(erformed)f (on)g(con-)0 887 y(stan)m(ts,)39 b(k)m(eyw)m(ord)e(v)-5 b(alues,)38 b(and)e(column)g(data)i(tak)m(en)f(from)f(the)h(sp)s (eci\014ed)e(FITS)h(T)-8 b(ABLE)37 b(extension.)59 b(The)0 1000 y(expression)37 b(m)m(ust)h(ev)-5 b(aluate)39 b(to)g(a)f(b)s(o)s (olean)g(v)-5 b(alue)38 b(for)f(eac)m(h)i(ro)m(w)f(of)g(the)f(table,)k (where)c(a)h(v)-5 b(alue)39 b(of)e(F)-10 b(ALSE)0 1113 y(means)30 b(that)h(the)g(ro)m(w)f(will)h(b)s(e)f(excluded.)0 1273 y(F)-8 b(or)34 b(complex)g(or)g(commonly)f(used)g(\014lters,)h (one)g(can)g(place)g(the)g(expression)f(in)m(to)h(a)g(text)g(\014le)g (and)f(imp)s(ort)f(it)0 1386 y(in)m(to)38 b(the)e(ro)m(w)h(\014lter)g (using)f(the)h(syn)m(tax)g('[@\014lename.txt]'.)61 b(The)36 b(expression)h(can)f(b)s(e)g(arbitrarily)h(complex)0 1499 y(and)27 b(extend)i(o)m(v)m(er)g(m)m(ultiple)g(lines)f(of)g(the)h (\014le.)40 b(An)m(y)28 b(lines)g(in)g(the)g(external)h(text)g(\014le)f (that)h(b)s(egin)f(with)g(2)g(slash)0 1612 y(c)m(haracters)k(\('//'\))g (will)f(b)s(e)f(ignored)g(and)g(ma)m(y)h(b)s(e)f(used)f(to)i(add)f (commen)m(ts)h(in)m(to)h(the)e(\014le.)0 1772 y(Keyw)m(ord)37 b(and)f(column)g(data)i(are)f(referenced)g(b)m(y)g(name.)60 b(An)m(y)37 b(string)f(of)h(c)m(haracters)i(not)e(surrounded)d(b)m(y)0 1885 y(quotes)41 b(\(ie,)j(a)d(constan)m(t)h(string\))f(or)f(follo)m(w) m(ed)i(b)m(y)f(an)f(op)s(en)g(paren)m(theses)h(\(ie,)j(a)d(function)f (name\))h(will)g(b)s(e)0 1998 y(initially)d(in)m(terpreted)e(as)h(a)g (column)f(name)g(and)g(its)h(con)m(ten)m(ts)h(for)e(the)h(curren)m(t)f (ro)m(w)g(inserted)g(in)m(to)i(the)e(ex-)0 2111 y(pression.)k(If)28 b(no)h(suc)m(h)g(column)g(exists,)h(a)g(k)m(eyw)m(ord)f(of)h(that)f (name)g(will)h(b)s(e)e(searc)m(hed)i(for)f(and)f(its)i(v)-5 b(alue)29 b(used,)0 2223 y(if)36 b(found.)55 b(T)-8 b(o)36 b(force)g(the)g(name)g(to)h(b)s(e)e(in)m(terpreted)h(as)g(a)g(k)m(eyw)m (ord)g(\(in)g(case)g(there)g(is)g(b)s(oth)f(a)h(column)g(and)0 2336 y(k)m(eyw)m(ord)41 b(with)e(the)i(same)f(name\),)j(precede)d(the)h (k)m(eyw)m(ord)f(name)g(with)g(a)h(single)f(p)s(ound)e(sign,)43 b('#',)g(as)d(in)0 2449 y('#NAXIS2'.)g(Due)27 b(to)g(the)f (generalities)j(of)d(FITS)g(column)g(and)g(k)m(eyw)m(ord)h(names,)g(if) f(the)h(column)f(or)g(k)m(eyw)m(ord)0 2562 y(name)33 b(con)m(tains)h(a)f(space)h(or)f(a)g(c)m(haracter)h(whic)m(h)f(migh)m (t)h(app)s(ear)e(as)h(an)g(arithmetic)h(term)f(then)g(enclose)h(the)0 2675 y(name)c(in)g('$')i(c)m(haracters)g(as)e(in)g($MAX)i(PHA$)f(or)f (#$MAX-PHA$.)43 b(Names)31 b(are)f(case)i(insensitiv)m(e.)0 2835 y(T)-8 b(o)32 b(access)g(a)g(table)g(en)m(try)g(in)f(a)h(ro)m(w)f (other)h(than)f(the)g(curren)m(t)g(one,)h(follo)m(w)h(the)e(column's)h (name)f(with)g(a)h(ro)m(w)0 2948 y(o\013set)37 b(within)e(curly)g (braces.)57 b(F)-8 b(or)36 b(example,)i('PHA)p Fc(f)p Fj(-3)p Fc(g)p Fj(')g(will)e(ev)-5 b(aluate)38 b(to)e(the)g(v)-5 b(alue)36 b(of)g(column)f(PHA,)i(3)0 3061 y(ro)m(ws)28 b(ab)s(o)m(v)m(e)i(the)e(ro)m(w)h(curren)m(tly)f(b)s(eing)g(pro)s (cessed.)40 b(One)28 b(cannot)h(sp)s(ecify)f(an)g(absolute)h(ro)m(w)f (n)m(um)m(b)s(er,)g(only)h(a)0 3174 y(relativ)m(e)j(o\013set.)42 b(Ro)m(ws)31 b(that)g(fall)g(outside)g(the)f(table)h(will)g(b)s(e)f (treated)h(as)g(unde\014ned,)d(or)j(NULLs.)0 3334 y(Bo)s(olean)h(op)s (erators)f(can)g(b)s(e)f(used)f(in)i(the)f(expression)h(in)f(either)h (their)g(F)-8 b(ortran)31 b(or)f(C)h(forms.)40 b(The)30 b(follo)m(wing)0 3447 y(b)s(o)s(olean)g(op)s(erators)h(are)g(a)m(v)-5 b(ailable:)191 3698 y Fe("equal")428 b(.eq.)46 b(.EQ.)h(==)95 b("not)46 b(equal")476 b(.ne.)94 b(.NE.)h(!=)191 3811 y("less)46 b(than")238 b(.lt.)46 b(.LT.)h(<)143 b("less)46 b(than/equal")188 b(.le.)94 b(.LE.)h(<=)47 b(=<)191 3923 y("greater)e(than")95 b(.gt.)46 b(.GT.)h(>)143 b("greater)45 b(than/equal")g(.ge.)94 b(.GE.)h(>=)47 b(=>)191 4036 y("or")572 b(.or.)46 b(.OR.)h(||)95 b("and")762 b(.and.)46 b(.AND.)h(&&)191 4149 y("negation")236 b(.not.)46 b(.NOT.)h(!)95 b("approx.)45 b(equal\(1e-7\)")92 b(~)0 4400 y Fj(Note)32 b(that)g(the)f(exclamation)i(p)s(oin)m(t,)e(')10 b(!',)33 b(is)e(a)g(sp)s(ecial)g(UNIX)h(c)m(haracter,)h(so)e(if)g(it)g(is)g (used)f(on)h(the)g(command)0 4513 y(line)i(rather)f(than)h(en)m(tered)g (at)g(a)g(task)g(prompt,)g(it)g(m)m(ust)f(b)s(e)g(preceded)h(b)m(y)f(a) h(bac)m(kslash)g(to)h(force)f(the)g(UNIX)0 4626 y(shell)e(to)g(ignore)g (it.)0 4786 y(The)h(expression)g(ma)m(y)i(also)f(include)f(arithmetic)i (op)s(erators)f(and)f(functions.)47 b(T)-8 b(rigonometric)34 b(functions)e(use)0 4899 y(radians,)23 b(not)g(degrees.)38 b(The)22 b(follo)m(wing)h(arithmetic)g(op)s(erators)g(and)e(functions)g (can)i(b)s(e)e(used)g(in)h(the)g(expression)0 5012 y(\(function)38 b(names)f(are)h(case)g(insensitiv)m(e\).)64 b(A)37 b(n)m(ull)h(v)-5 b(alue)38 b(will)f(b)s(e)g(returned)g(in)g(case)h(of)g(illegal)i(op)s (erations)0 5125 y(suc)m(h)30 b(as)h(divide)f(b)m(y)g(zero,)i (sqrt\(negativ)m(e\))h(log\(negativ)m(e\),)h(log10\(negativ)m(e\),)i (arccos\(.gt.)43 b(1\),)32 b(arcsin\(.gt.)42 b(1\).)191 5375 y Fe("addition")474 b(+)j("subtraction")d(-)191 5488 y("multiplication")186 b(*)477 b("division")618 b(/)191 5601 y("negation")474 b(-)j("exponentiation")330 b(**)143 b(^)191 5714 y("absolute)45 b(value")189 b(abs\(x\))237 b("cosine")762 b(cos\(x\))p eop end %%Page: 144 152 TeXDict begin 144 151 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.144) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(144)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)191 555 y Fe("sine")666 b(sin\(x\))237 b("tangent")714 b(tan\(x\))191 668 y("arc)47 b(cosine")379 b(arccos\(x\))93 b("arc)47 b(sine")667 b(arcsin\(x\))191 781 y("arc)47 b(tangent")331 b(arctan\(x\))93 b("arc)47 b(tangent")523 b(arctan2\(y,x\))191 894 y("hyperbolic)45 b(cos")189 b(cosh\(x\))g("hyperbolic)45 b(sin")381 b(sinh\(x\))191 1007 y("hyperbolic)45 b(tan")189 b(tanh\(x\))g("round)47 b(to)g(nearest)f(int")94 b(round\(x\))191 1120 y("round)46 b(down)h(to)g(int")f(floor\(x\))141 b("round)47 b(up)g(to)g(int")333 b(ceil\(x\))191 1233 y("exponential")d(exp\(x\))237 b("square)46 b(root")524 b(sqrt\(x\))191 1346 y("natural)45 b(log")333 b(log\(x\))237 b("common)46 b(log")572 b(log10\(x\))191 1458 y("modulus")522 b(x)48 b(\045)f(y)286 b("random)46 b(#)i([0.0,1.0\)")188 b(random\(\))191 1571 y("random)46 b(Gaussian")140 b(randomn\(\))93 b("random)46 b(Poisson")380 b(randomp\(x\))191 1684 y("minimum")522 b(min\(x,y\))141 b("maximum")714 b(max\(x,y\))191 1797 y("cumulative)45 b(sum")189 b(accum\(x\))141 b("sequential)45 b(difference")g (seqdiff\(x\))191 1910 y("if-then-else")282 b(b?x:y)191 2023 y("angular)45 b(separation")93 b(angsep\(ra1,dec1,ra2,de2\))41 b(\(all)47 b(in)g(degrees\))191 2136 y("substring")283 b(strmid\(s,p,n\))44 b("string)i(search")428 b(strstr\(s,r\))0 2382 y Fj(Three)30 b(di\013eren)m(t)h(random)f(n)m(um)m(b)s(er)f (functions)h(are)h(pro)m(vided:)41 b(random\(\),)30 b(with)h(no)f (argumen)m(ts,)h(pro)s(duces)f(a)0 2495 y(uniform)g(random)f(deviate)k (b)s(et)m(w)m(een)e(0)g(and)f(1;)i(randomn\(\),)e(also)i(with)e(no)h (argumen)m(ts,)g(pro)s(duces)f(a)h(normal)0 2608 y(\(Gaussian\))k (random)e(deviate)j(with)e(zero)h(mean)f(and)g(unit)f(standard)h (deviation;)j(randomp\(x\))d(pro)s(duces)f(a)0 2721 y(P)m(oisson)27 b(random)f(deviate)h(whose)f(exp)s(ected)h(n)m(um)m(b)s(er)e(of)h(coun) m(ts)h(is)g(X.)f(X)h(ma)m(y)g(b)s(e)e(an)m(y)i(p)s(ositiv)m(e)g(real)g (n)m(um)m(b)s(er)0 2833 y(of)k(exp)s(ected)f(coun)m(ts,)h(including)f (fractional)i(v)-5 b(alues,)31 b(but)f(the)g(return)g(v)-5 b(alue)31 b(is)f(an)g(in)m(teger.)0 2994 y(When)d(the)g(random)g (functions)f(are)i(used)e(in)h(a)h(v)m(ector)g(expression,)g(b)m(y)f (default)h(the)f(same)h(random)e(v)-5 b(alue)28 b(will)0 3107 y(b)s(e)g(used)f(when)h(ev)-5 b(aluating)30 b(eac)m(h)f(elemen)m (t)h(of)f(the)g(v)m(ector.)41 b(If)28 b(di\013eren)m(t)h(random)f(n)m (um)m(b)s(ers)f(are)i(desired,)f(then)0 3219 y(the)37 b(name)g(of)g(a)g(v)m(ector)i(column)e(should)e(b)s(e)i(supplied)e(as)i (the)h(single)f(argumen)m(t)g(to)h(the)f(random)f(function)0 3332 y(\(e.g.,)31 b("\015ux)c(+)h(0.1)h(*)g(random\(\015ux\)",)f(where) g("\015ux')g(is)g(the)g(name)h(of)f(a)h(v)m(ector)h(column\).)40 b(This)27 b(will)i(create)h(a)0 3445 y(v)m(ector)d(of)f(random)f(n)m (um)m(b)s(ers)f(that)i(will)g(b)s(e)f(used)f(in)i(sequence)g(when)e(ev) -5 b(aluating)27 b(eac)m(h)g(elemen)m(t)g(of)f(the)f(v)m(ector)0 3558 y(expression.)0 3718 y(An)31 b(alternate)i(syn)m(tax)f(for)f(the)g (min)g(and)g(max)g(functions)g(has)g(only)g(a)h(single)g(argumen)m(t)g (whic)m(h)f(should)f(b)s(e)h(a)0 3831 y(v)m(ector)g(v)-5 b(alue)30 b(\(see)g(b)s(elo)m(w\).)41 b(The)29 b(result)g(will)h(b)s(e) e(the)i(minim)m(um/maxim)m(um)f(elemen)m(t)h(con)m(tained)h(within)e (the)0 3944 y(v)m(ector.)0 4104 y(The)35 b(accum\(x\))i(function)f (forms)f(the)h(cum)m(ulativ)m(e)i(sum)d(of)h(x,)h(elemen)m(t)h(b)m(y)e (elemen)m(t.)58 b(V)-8 b(ector)38 b(columns)e(are)0 4217 y(supp)s(orted)h(simply)h(b)m(y)g(p)s(erforming)f(the)i(summation)g (pro)s(cess)f(through)f(all)j(the)f(v)-5 b(alues.)65 b(Null)39 b(v)-5 b(alues)39 b(are)0 4330 y(treated)30 b(as)f(0.)41 b(The)29 b(seqdi\013\(x\))h(function)e(forms)h(the)g (sequen)m(tial)i(di\013erence)e(of)h(x,)f(elemen)m(t)i(b)m(y)e(elemen)m (t.)41 b(The)0 4443 y(\014rst)36 b(v)-5 b(alue)38 b(of)f(seqdi\013)g (is)g(the)g(\014rst)g(v)-5 b(alue)37 b(of)g(x.)61 b(A)37 b(single)h(n)m(ull)f(v)-5 b(alue)38 b(in)e(x)h(causes)h(a)f(pair)g(of)g (n)m(ulls)g(in)g(the)0 4556 y(output.)55 b(The)35 b(seqdi\013)g(and)g (accum)g(functions)g(are)h(functional)f(in)m(v)m(erses,)j(i.e.,)g (seqdi\013\(accum\(x\)\))f(==)e(x)g(as)0 4669 y(long)c(as)g(no)f(n)m (ull)g(v)-5 b(alues)31 b(are)g(presen)m(t.)0 4829 y(In)36 b(the)h(if-then-else)i(expression,)f("b?x:y",)i(b)c(is)h(an)g(explicit) h(b)s(o)s(olean)f(v)-5 b(alue)37 b(or)g(expression.)61 b(There)36 b(is)h(no)0 4942 y(automatic)d(t)m(yp)s(e)e(con)m(v)m (ersion)h(from)e(n)m(umeric)h(to)g(b)s(o)s(olean)g(v)-5 b(alues,)33 b(so)f(one)g(needs)f(to)i(use)e("iV)-8 b(al!=0")35 b(instead)0 5055 y(of)30 b(merely)g("iV)-8 b(al")32 b(as)e(the)g(b)s(o) s(olean)g(argumen)m(t.)41 b(x)30 b(and)f(y)h(can)g(b)s(e)f(an)m(y)h (scalar)h(data)g(t)m(yp)s(e)f(\(including)f(string\).)0 5215 y(The)22 b(angsep)g(function)f(computes)i(the)f(angular)g (separation)h(in)e(degrees)i(b)s(et)m(w)m(een)g(2)f(celestial)j(p)s (ositions,)e(where)0 5328 y(the)36 b(\014rst)f(2)h(parameters)g(giv)m (e)h(the)f(RA-lik)m(e)i(and)d(Dec-lik)m(e)j(co)s(ordinates)f(\(in)f (decimal)g(degrees\))h(of)f(the)g(\014rst)0 5441 y(p)s(osition,)31 b(and)e(the)i(3rd)f(and)g(4th)g(parameters)h(giv)m(e)h(the)e(co)s (ordinates)i(of)e(the)h(second)f(p)s(osition.)0 5601 y(The)38 b(substring)f(function)i(strmid\(S,P)-8 b(,N\))39 b(extracts)g(a)g(substring)f(from)g(S,)g(starting)h(at)g(string)g(p)s (osition)f(P)-8 b(,)0 5714 y(with)33 b(a)h(substring)f(length)h(N.)g (The)f(\014rst)g(c)m(haracter)j(p)s(osition)d(in)h(S)f(is)h(lab)s(eled) g(as)g(1.)51 b(If)33 b(P)g(is)h(0,)h(or)f(refers)f(to)p eop end %%Page: 145 153 TeXDict begin 145 152 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.145) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.11.)73 b(R)m(O)m(W)31 b(FIL)-8 b(TERING)31 b(SPECIFICA)-8 b(TION)1936 b Fj(145)0 555 y(a)35 b(p)s(osition)g(b)s(ey)m(ond)f(the)h(end)e(of)i (S,)g(then)f(the)h(extracted)h(substring)d(will)i(b)s(e)f(NULL.)h(S,)f (P)-8 b(,)36 b(and)e(N)g(ma)m(y)i(b)s(e)0 668 y(functions)30 b(of)g(other)h(columns.)0 828 y(The)39 b(string)h(searc)m(h)h(function) e(strstr\(S,R\))h(searc)m(hes)h(for)f(the)g(\014rst)f(o)s(ccurrence)h (of)g(the)g(substring)f(R)h(in)f(S.)0 941 y(The)c(result)h(is)f(an)h (in)m(teger,)i(indicating)f(the)e(c)m(haracter)i(p)s(osition)f(of)g (the)g(\014rst)e(matc)m(h)j(\(where)e(1)h(is)g(the)g(\014rst)0 1054 y(c)m(haracter)c(p)s(osition)e(of)h(S\).)f(If)g(no)h(matc)m(h)g (is)f(found,)g(then)g(strstr\(\))g(returns)f(a)i(NULL)f(v)-5 b(alue.)0 1214 y(The)38 b(follo)m(wing)i(t)m(yp)s(e)f(casting)h(op)s (erators)f(are)g(a)m(v)-5 b(ailable,)44 b(where)38 b(the)h(inclosing)h (paren)m(theses)f(are)g(required)0 1327 y(and)30 b(tak)m(en)h(from)f (the)h(C)f(language)h(usage.)42 b(Also,)31 b(the)g(in)m(teger)g(to)h (real)f(casts)g(v)-5 b(alues)30 b(to)i(double)e(precision:)764 1593 y Fe("real)46 b(to)h(integer")189 b(\(int\))46 b(x)239 b(\(INT\))46 b(x)764 1706 y("integer)f(to)i(real")190 b(\(float\))46 b(i)143 b(\(FLOAT\))45 b(i)0 1972 y Fj(In)30 b(addition,)g(sev)m(eral)i(constan)m(ts)g(are)f(built)f(in)g(for)g(use) g(in)g(n)m(umerical)h(expressions:)382 2238 y Fe(#pi)667 b(3.1415...)284 b(#e)620 b(2.7182...)382 2351 y(#deg)f(#pi/180)380 b(#row)524 b(current)46 b(row)h(number)382 2464 y(#null)428 b(undefined)45 b(value)142 b(#snull)428 b(undefined)45 b(string)0 2730 y Fj(A)40 b(string)f(constan)m(t)i(m)m(ust)e(b)s(e)g (enclosed)h(in)g(quotes)g(as)f(in)h('Crab'.)67 b(The)39 b("n)m(ull")i(constan)m(ts)f(are)g(useful)f(for)0 2843 y(conditionally)g(setting)g(table)g(v)-5 b(alues)38 b(to)g(a)g(NULL,)g (or)g(unde\014ned,)f(v)-5 b(alue)39 b(\(eg.,)i("col1==-99)f(?)62 b(#NULL)38 b(:)0 2955 y(col1"\).)0 3116 y(There)27 b(is)g(also)i(a)e (function)g(for)h(testing)g(if)f(t)m(w)m(o)i(v)-5 b(alues)28 b(are)g(close)g(to)h(eac)m(h)f(other,)h(i.e.,)g(if)e(they)h(are)g ("near")g(eac)m(h)0 3229 y(other)c(to)h(within)e(a)h(user)g(sp)s (eci\014ed)f(tolerance.)40 b(The)24 b(argumen)m(ts,)h(v)-5 b(alue)p 2502 3229 28 4 v 34 w(1)24 b(and)f(v)-5 b(alue)p 2979 3229 V 33 w(2)25 b(can)f(b)s(e)f(in)m(teger)i(or)f(real)0 3341 y(and)32 b(represen)m(t)h(the)g(t)m(w)m(o)h(v)-5 b(alues)33 b(who's)f(pro)m(ximit)m(y)i(is)f(b)s(eing)f(tested)h(to)h(b) s(e)e(within)g(the)h(sp)s(eci\014ed)f(tolerance,)0 3454 y(also)f(an)g(in)m(teger)g(or)g(real:)955 3720 y Fe(near\(value_1,)44 b(value_2,)h(tolerance\))0 3986 y Fj(When)24 b(a)i(NULL,)e(or)h (unde\014ned,)f(v)-5 b(alue)25 b(is)g(encoun)m(tered)g(in)g(the)f(FITS) g(table,)j(the)e(expression)g(will)g(ev)-5 b(aluate)26 b(to)0 4099 y(NULL)31 b(unless)f(the)h(unde\014ned)e(v)-5 b(alue)31 b(is)g(not)g(actually)h(required)e(for)h(ev)-5 b(aluation,)33 b(e.g.)43 b("TR)m(UE)31 b(.or.)43 b(NULL")0 4212 y(ev)-5 b(aluates)32 b(to)f(TR)m(UE.)g(The)f(follo)m(wing)h(t)m(w) m(o)h(functions)e(allo)m(w)i(some)f(NULL)f(detection)i(and)e(handling:) 430 4478 y Fe("a)47 b(null)f(value?")667 b(ISNULL\(x\))430 4591 y("define)45 b(a)j(value)e(for)h(null")190 b(DEFNULL\(x,y\))0 4857 y Fj(The)36 b(former)h(returns)e(a)i(b)s(o)s(olean)g(v)-5 b(alue)37 b(of)g(TR)m(UE)g(if)g(the)g(argumen)m(t)g(x)g(is)g(NULL.)g (The)f(later)i("de\014nes")f(a)0 4970 y(v)-5 b(alue)35 b(to)g(b)s(e)e(substituted)h(for)g(NULL)g(v)-5 b(alues;)37 b(it)e(returns)e(the)h(v)-5 b(alue)35 b(of)f(x)g(if)g(x)h(is)f(not)g (NULL,)h(otherwise)f(it)0 5083 y(returns)29 b(the)i(v)-5 b(alue)31 b(of)f(y)-8 b(.)0 5235 y SDict begin H.S end 0 5235 a 0 5235 a SDict begin 13.6 H.A end 0 5235 a 0 5235 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.11.2) cvn /DEST pdfmark end 0 5235 a 146 x Fd(10.11.2)113 b(Bit)36 b(Masks)0 5601 y Fj(Bit)g(masks)f(can)h(b)s(e)f(used)f(to)i(select)h (out)e(ro)m(ws)h(from)e(bit)i(columns)f(\(TF)m(ORMn)g(=)g(#X\))h(in)f (FITS)f(\014les.)55 b(T)-8 b(o)0 5714 y(represen)m(t)30 b(the)h(mask,)g(binary)-8 b(,)30 b(o)s(ctal,)i(and)e(hex)g(formats)g (are)h(allo)m(w)m(ed:)p eop end %%Page: 146 154 TeXDict begin 146 153 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.146) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(146)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)811 555 y Fe(binary:)142 b(b0110xx1010000101xxxx00)o(01)811 668 y(octal:)190 b(o720x1)46 b(->)h(\(b111010000xxx001\))811 781 y(hex:)286 b(h0FxD)94 b(->)47 b(\(b00001111xxxx1101\))0 1016 y Fj(In)22 b(all)i(the)f(represen)m(tations,)j(an)c(x)h(or)g(X)g (is)g(allo)m(w)m(ed)i(in)d(the)h(mask)g(as)g(a)h(wild)e(card.)38 b(Note)25 b(that)e(the)g(x)g(represen)m(ts)0 1128 y(a)k(di\013eren)m(t) h(n)m(um)m(b)s(er)e(of)h(wild)f(card)h(bits)g(in)g(eac)m(h)h(represen)m (tation.)41 b(All)27 b(represen)m(tations)h(are)g(case)g(insensitiv)m (e.)0 1289 y(T)-8 b(o)28 b(construct)g(the)g(b)s(o)s(olean)f (expression)h(using)f(the)h(mask)f(as)h(the)g(b)s(o)s(olean)f(equal)h (op)s(erator)g(describ)s(ed)f(ab)s(o)m(v)m(e)0 1401 y(on)34 b(a)h(bit)g(table)h(column.)53 b(F)-8 b(or)35 b(example,)i(if)d(y)m(ou) h(had)f(a)h(7)g(bit)g(column)f(named)g(\015ags)h(in)f(a)h(FITS)f(table) i(and)0 1514 y(w)m(an)m(ted)31 b(all)g(ro)m(ws)g(ha)m(ving)g(the)f(bit) h(pattern)f(0010011,)k(the)c(selection)j(expression)d(w)m(ould)g(b)s (e:)1336 1749 y Fe(flags)47 b(==)g(b0010011)191 1862 y(or)1336 1975 y(flags)g(.eq.)f(b10011)0 2209 y Fj(It)35 b(is)g(also)h(p)s(ossible)e(to)i(test)g(if)f(a)g(range)g(of)g(bits)g (is)g(less)g(than,)h(less)f(than)g(equal,)i(greater)f(than)e(and)h (greater)0 2322 y(than)30 b(equal)h(to)g(a)g(particular)g(b)s(o)s (olean)f(v)-5 b(alue:)1336 2557 y Fe(flags)47 b(<=)g(bxxx010xx)1336 2669 y(flags)g(.gt.)f(bxxx100xx)1336 2782 y(flags)h(.le.)f(b1xxxxxxx)0 3017 y Fj(Notice)32 b(the)f(use)f(of)h(the)f(x)g(bit)h(v)-5 b(alue)31 b(to)g(limit)g(the)f(range)h(of)g(bits)f(b)s(eing)g (compared.)0 3177 y(It)i(is)h(not)f(necessary)h(to)g(sp)s(ecify)f(the)h (leading)g(\(most)g(signi\014can)m(t\))h(zero)f(\(0\))g(bits)f(in)g (the)h(mask,)g(as)g(sho)m(wn)e(in)0 3290 y(the)g(second)f(expression)g (ab)s(o)m(v)m(e.)0 3450 y(Bit)44 b(wise)f(AND,)h(OR)e(and)g(NOT)h(op)s (erations)g(are)g(also)h(p)s(ossible)e(on)h(t)m(w)m(o)h(or)f(more)g (bit)g(\014elds)f(using)h(the)0 3563 y('&'\(AND\),)35 b(')p Fc(j)p Fj('\(OR\),)g(and)e(the)h(')10 b(!'\(NOT\))34 b(op)s(erators.)51 b(All)34 b(of)f(these)h(op)s(erators)g(result)f(in)h (a)g(bit)f(\014eld)g(whic)m(h)0 3676 y(can)e(then)f(b)s(e)f(used)h (with)g(the)h(equal)g(op)s(erator.)41 b(F)-8 b(or)31 b(example:)1241 3910 y Fe(\(!flags\))45 b(==)j(b1101100)1241 4023 y(\(flags)e(&)h(b1000001\))f(==)h(bx000001)0 4258 y Fj(Bit)35 b(\014elds)f(can)g(b)s(e)f(app)s(ended)g(as)h(w)m(ell)h (using)f(the)g('+')g(op)s(erator.)53 b(Strings)33 b(can)i(b)s(e)e (concatenated)j(this)e(w)m(a)m(y)-8 b(,)0 4371 y(to)s(o.)0 4494 y SDict begin H.S end 0 4494 a 0 4494 a SDict begin 13.6 H.A end 0 4494 a 0 4494 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.11.3) cvn /DEST pdfmark end 0 4494 a 163 x Fd(10.11.3)113 b(V)-9 b(ector)36 b(Columns)0 4876 y Fj(V)-8 b(ector)37 b(columns)e(can)h(also)g(b)s(e)f(used)f(in)h (building)g(the)g(expression.)56 b(No)36 b(sp)s(ecial)g(syn)m(tax)f(is) h(required)e(if)i(one)0 4989 y(w)m(an)m(ts)46 b(to)f(op)s(erate)h(on)f (all)h(elemen)m(ts)g(of)f(the)h(v)m(ector.)86 b(Simply)44 b(use)h(the)g(column)g(name)g(as)g(for)g(a)g(scalar)0 5102 y(column.)d(V)-8 b(ector)32 b(columns)f(can)g(b)s(e)f(freely)h(in) m(termixed)h(with)e(scalar)i(columns)e(or)h(constan)m(ts)h(in)f (virtually)g(all)0 5215 y(expressions.)40 b(The)29 b(result)g(will)g(b) s(e)g(of)g(the)g(same)h(dimension)e(as)i(the)f(v)m(ector.)42 b(Tw)m(o)29 b(v)m(ectors)i(in)e(an)g(expression,)0 5328 y(though,)h(need)g(to)i(ha)m(v)m(e)f(the)g(same)g(n)m(um)m(b)s(er)e(of) h(elemen)m(ts)i(and)e(ha)m(v)m(e)h(the)g(same)g(dimensions.)0 5488 y(Arithmetic)24 b(and)e(logical)k(op)s(erations)d(are)h(all)g(p)s (erformed)d(on)i(an)g(elemen)m(t)h(b)m(y)f(elemen)m(t)i(basis.)38 b(Comparing)23 b(t)m(w)m(o)0 5601 y(v)m(ector)32 b(columns,)e(eg)h ("COL1)f(==)g(COL2",)g(th)m(us)g(results)g(in)g(another)g(v)m(ector)i (of)e(b)s(o)s(olean)h(v)-5 b(alues)30 b(indicating)0 5714 y(whic)m(h)g(elemen)m(ts)i(of)e(the)h(t)m(w)m(o)h(v)m(ectors)f (are)g(equal.)p eop end %%Page: 147 155 TeXDict begin 147 154 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.147) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.11.)73 b(R)m(O)m(W)31 b(FIL)-8 b(TERING)31 b(SPECIFICA)-8 b(TION)1936 b Fj(147)0 555 y(Eigh)m(t)31 b(functions)f(are)h(a)m(v)-5 b(ailable)33 b(that)e(op)s(erate)g(on)f(a)h(v)m(ector)h(and)d(return)h (a)g(scalar)i(result:)191 770 y Fe("minimum")284 b(MIN\(V\))475 b("maximum")714 b(MAX\(V\))191 883 y("average")284 b(AVERAGE\(V\))f ("median")762 b(MEDIAN\(V\))191 995 y("summation")188 b(SUM\(V\))475 b("standard)46 b(deviation")188 b(STDDEV\(V\))191 1108 y("#)47 b(of)g(values")94 b(NELEM\(V\))379 b("#)48 b(of)f(non-null)e(values")94 b(NVALID\(V\))0 1323 y Fj(where)40 b(V)h(represen)m(ts)g(the)g(name)g(of)h(a)f(v)m(ector)h(column)f(or)g (a)h(man)m(ually)f(constructed)g(v)m(ector)i(using)d(curly)0 1436 y(brac)m(k)m(ets)27 b(as)f(describ)s(ed)e(b)s(elo)m(w.)39 b(The)25 b(\014rst)g(6)h(of)g(these)g(functions)f(ignore)h(an)m(y)g(n)m (ull)f(v)-5 b(alues)26 b(in)f(the)h(v)m(ector)h(when)0 1549 y(computing)k(the)f(result.)41 b(The)30 b(STDDEV\(\))h(function)g (computes)f(the)h(sample)g(standard)e(deviation,)j(i.e.)42 b(it)31 b(is)0 1662 y(prop)s(ortional)f(to)h(1/SQR)-8 b(T\(N-1\))32 b(instead)f(of)g(1/SQR)-8 b(T\(N\),)31 b(where)f(N)h(is)f(NV)-10 b(ALID\(V\).)0 1822 y(The)31 b(SUM)h(function)f(literally)j(sums)d(all)h(the)g(elemen)m(ts)h(in)f (x,)g(returning)f(a)h(scalar)h(v)-5 b(alue.)45 b(If)31 b(V)h(is)g(a)g(b)s(o)s(olean)0 1935 y(v)m(ector,)40 b(SUM)c(returns)f (the)h(n)m(um)m(b)s(er)f(of)i(TR)m(UE)f(elemen)m(ts.)60 b(The)36 b(NELEM)g(function)g(returns)f(the)h(n)m(um)m(b)s(er)0 2047 y(of)h(elemen)m(ts)g(in)g(v)m(ector)h(V)e(whereas)h(NV)-10 b(ALID)36 b(return)g(the)h(n)m(um)m(b)s(er)e(of)h(non-n)m(ull)g(elemen) m(ts)i(in)e(the)h(v)m(ector.)0 2160 y(\(NELEM)28 b(also)h(op)s(erates)f (on)g(bit)f(and)g(string)h(columns,)g(returning)f(their)h(column)f (widths.\))40 b(As)27 b(an)h(example,)0 2273 y(to)42 b(test)g(whether)f(all)h(elemen)m(ts)h(of)f(t)m(w)m(o)g(v)m(ectors)h (satisfy)f(a)g(giv)m(en)g(logical)i(comparison,)g(one)e(can)g(use)f (the)0 2386 y(expression)668 2601 y Fe(SUM\()47 b(COL1)f(>)i(COL2)f(\)) g(==)g(NELEM\()f(COL1)h(\))0 2815 y Fj(whic)m(h)32 b(will)g(return)f (TR)m(UE)h(if)g(all)h(elemen)m(ts)g(of)f(COL1)g(are)g(greater)h(than)f (their)g(corresp)s(onding)f(elemen)m(ts)i(in)0 2928 y(COL2.)0 3088 y(T)-8 b(o)32 b(sp)s(ecify)f(a)i(single)f(elemen)m(t)h(of)f(a)g(v) m(ector,)i(giv)m(e)f(the)f(column)f(name)h(follo)m(w)m(ed)h(b)m(y)f(a)g (comma-separated)h(list)0 3201 y(of)c(co)s(ordinates)g(enclosed)h(in)e (square)h(brac)m(k)m(ets.)41 b(F)-8 b(or)30 b(example,)g(if)e(a)h(v)m (ector)i(column)d(named)h(PHAS)f(exists)h(in)0 3314 y(the)e(table)g(as) g(a)g(one)g(dimensional,)h(256)g(comp)s(onen)m(t)f(list)g(of)g(n)m(um)m (b)s(ers)e(from)h(whic)m(h)h(y)m(ou)g(w)m(an)m(ted)g(to)g(select)i(the) 0 3427 y(57th)j(comp)s(onen)m(t)g(for)f(use)g(in)g(the)h(expression,)f (then)h(PHAS[57])g(w)m(ould)f(do)h(the)f(tric)m(k.)45 b(Higher)32 b(dimensional)0 3540 y(arra)m(ys)41 b(of)h(data)f(ma)m(y)h (app)s(ear)f(in)f(a)i(column.)73 b(But)41 b(in)g(order)f(to)i(in)m (terpret)f(them,)j(the)e(TDIMn)e(k)m(eyw)m(ord)0 3653 y(m)m(ust)34 b(app)s(ear)g(in)g(the)g(header.)52 b(Assuming)34 b(that)h(a)f(\(4,4,4,4\))k(arra)m(y)c(is)h(pac)m(k)m(ed)g(in)m(to)g (eac)m(h)h(ro)m(w)e(of)g(a)h(column)0 3766 y(named)26 b(ARRA)-8 b(Y4D,)28 b(the)f(\(1,2,3,4\))i(comp)s(onen)m(t)e(elemen)m(t) g(of)g(eac)m(h)g(ro)m(w)g(is)f(accessed)i(b)m(y)e(ARRA)-8 b(Y4D[1,2,3,4].)0 3878 y(Arra)m(ys)33 b(up)e(to)j(dimension)e(5)h(are)f (curren)m(tly)h(supp)s(orted.)46 b(Eac)m(h)33 b(v)m(ector)h(index)e (can)h(itself)g(b)s(e)f(an)h(expression,)0 3991 y(although)39 b(it)g(m)m(ust)g(ev)-5 b(aluate)40 b(to)f(an)g(in)m(teger)h(v)-5 b(alue)39 b(within)f(the)h(b)s(ounds)d(of)j(the)g(v)m(ector.)67 b(V)-8 b(ector)40 b(columns)0 4104 y(whic)m(h)31 b(con)m(tain)h(spaces) g(or)f(arithmetic)h(op)s(erators)g(m)m(ust)f(ha)m(v)m(e)h(their)f (names)g(enclosed)h(in)f("$")h(c)m(haracters)h(as)0 4217 y(with)d($ARRA)-8 b(Y-4D$[1,2,3,4].)0 4377 y(A)45 b(more)f(C-lik)m(e)i (syn)m(tax)g(for)e(sp)s(ecifying)g(v)m(ector)j(indices)d(is)h(also)h(a) m(v)-5 b(ailable.)85 b(The)45 b(elemen)m(t)h(used)d(in)i(the)0 4490 y(preceding)28 b(example)h(alternativ)m(ely)i(could)d(b)s(e)g(sp)s (eci\014ed)g(with)f(the)i(syn)m(tax)g(ARRA)-8 b(Y4D[4][3][2][1].)45 b(Note)30 b(the)0 4603 y(rev)m(erse)40 b(order)f(of)h(indices)f(\(as)h (in)f(C\),)h(as)f(w)m(ell)i(as)e(the)h(fact)g(that)g(the)g(v)-5 b(alues)40 b(are)f(still)i(ones-based)e(\(as)h(in)0 4716 y(F)-8 b(ortran)39 b({)g(adopted)g(to)g(a)m(v)m(oid)h(am)m(biguit)m(y)g (for)f(1D)g(v)m(ectors\).)67 b(With)39 b(this)g(syn)m(tax,)i(one)e(do)s (es)f(not)h(need)f(to)0 4829 y(sp)s(ecify)30 b(all)h(of)g(the)f (indices.)41 b(T)-8 b(o)31 b(extract)h(a)f(3D)g(slice)g(of)g(this)f(4D) h(arra)m(y)-8 b(,)32 b(use)e(ARRA)-8 b(Y4D[4].)0 4989 y(V)g(ariable-length)33 b(v)m(ector)f(columns)e(are)g(not)h(supp)s (orted.)0 5149 y(V)-8 b(ectors)24 b(can)e(b)s(e)f(man)m(ually)h (constructed)h(within)e(the)h(expression)g(using)f(a)h(comma-separated) i(list)f(of)f(elemen)m(ts)0 5262 y(surrounded)35 b(b)m(y)j(curly)g (braces)h(\(')p Fc(fg)p Fj('\).)66 b(F)-8 b(or)38 b(example,)j(')p Fc(f)p Fj(1,3,6,1)p Fc(g)p Fj(')h(is)d(a)f(4-elemen)m(t)i(v)m(ector)g (con)m(taining)g(the)0 5375 y(v)-5 b(alues)26 b(1,)h(3,)g(6,)g(and)e (1.)40 b(The)25 b(v)m(ector)i(can)f(con)m(tain)h(only)f(b)s(o)s(olean,) g(in)m(teger,)j(and)c(real)h(v)-5 b(alues)26 b(\(or)g(expressions\).)0 5488 y(The)c(elemen)m(ts)i(will)f(b)s(e)f(promoted)h(to)g(the)g (highest)g(data)g(t)m(yp)s(e)g(presen)m(t.)38 b(An)m(y)22 b(elemen)m(ts)i(whic)m(h)f(are)g(themselv)m(es)0 5601 y(v)m(ectors,)40 b(will)d(b)s(e)f(expanded)g(out)h(with)g(eac)m(h)g(of) g(its)g(elemen)m(ts)i(b)s(ecoming)d(an)h(elemen)m(t)h(in)f(the)g (constructed)0 5714 y(v)m(ector.)p eop end %%Page: 148 156 TeXDict begin 148 155 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.148) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(148)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.11.4) cvn /DEST pdfmark end 0 464 a 91 x Fd(10.11.4)113 b(Ro)m(w)36 b(Access)0 774 y Fj(T)-8 b(o)32 b(access)g(a)g(table)g(en)m(try)g(in)f(a)h(ro)m(w)f(other)h (than)f(the)g(curren)m(t)g(one,)h(follo)m(w)h(the)e(column's)h(name)f (with)g(a)h(ro)m(w)0 887 y(o\013set)41 b(within)f(curly)g(braces.)71 b(F)-8 b(or)41 b(example,)j Fe(PHA{-3})39 b Fj(will)h(ev)-5 b(aluate)42 b(to)g(the)e(v)-5 b(alue)41 b(of)g(column)f(PHA,)h(3)0 1000 y(ro)m(ws)28 b(ab)s(o)m(v)m(e)i(the)e(ro)m(w)h(curren)m(tly)f(b)s (eing)g(pro)s(cessed.)40 b(One)28 b(cannot)h(sp)s(ecify)f(an)g (absolute)h(ro)m(w)f(n)m(um)m(b)s(er,)g(only)h(a)0 1113 y(relativ)m(e)j(o\013set.)42 b(Ro)m(ws)31 b(that)g(fall)g(outside)g (the)f(table)h(will)g(b)s(e)f(treated)h(as)g(unde\014ned,)d(or)j (NULLs.)0 1273 y(Using)22 b(the)g(same)g(column)g(name)g(on)g(the)g (left)g(and)f(righ)m(t)i(side)e(of)h(the)h(equals)f(sign)g(while)f (using)h(the)g Fe(COLUMN{-N})0 1386 y Fj(notation)32 b(will)e(not)h(pro)s(duce)e(the)i(desired)f(result.)40 b(F)-8 b(or)31 b(example,)668 1608 y Fe(COUNT)47 b(=)g(COUNT{-1})e(+)j (1;)142 b(#)48 b(BAD)f(-)g(do)g(not)g(use)0 1830 y Fj(will)30 b(not)g(pro)s(duce)f(an)h(increasing)h(coun)m(ter.)41 b(Suc)m(h)29 b(recursiv)m(e)i(calculations)h(are)e(often)g(not)h(p)s (ossible)e(with)h(the)0 1943 y(calculator)i(syn)m(tax.)0 2085 y SDict begin H.S end 0 2085 a 0 2085 a SDict begin 13.6 H.A end 0 2085 a 0 2085 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.11.5) cvn /DEST pdfmark end 0 2085 a 146 x Fd(10.11.5)113 b(Go)s(o)s(d)38 b(Time)g(In)m(terv)-6 b(al)37 b(Filtering)0 2450 y Fj(A)44 b(common)g(\014ltering)h(metho)s (d)e(in)m(v)m(olv)m(es)j(selecting)g(ro)m(ws)e(whic)m(h)f(ha)m(v)m(e)j (a)e(time)h(v)-5 b(alue)44 b(whic)m(h)g(lies)g(within)0 2563 y(what)37 b(is)g(called)i(a)f(Go)s(o)s(d)f(Time)g(In)m(terv)-5 b(al)38 b(or)f(GTI.)g(The)g(time)h(in)m(terv)-5 b(als)38 b(are)g(de\014ned)e(in)h(a)g(separate)i(FITS)0 2676 y(table)i (extension)g(whic)m(h)e(con)m(tains)i(2)g(columns)f(giving)g(the)h (start)f(and)g(stop)g(time)g(of)g(eac)m(h)i(go)s(o)s(d)e(in)m(terv)-5 b(al.)0 2789 y(The)34 b(\014ltering)h(op)s(eration)h(accepts)g(only)e (those)i(ro)m(ws)e(of)h(the)g(input)f(table)i(whic)m(h)e(ha)m(v)m(e)i (an)f(asso)s(ciated)h(time)0 2901 y(whic)m(h)f(falls)i(within)e(one)h (of)g(the)g(time)g(in)m(terv)-5 b(als)37 b(de\014ned)e(in)g(the)h(GTI)g (extension.)57 b(A)36 b(high)g(lev)m(el)h(function,)0 3014 y(gti\014lter\(a,b,c,d\),)44 b(is)c(a)m(v)-5 b(ailable)42 b(whic)m(h)d(ev)-5 b(aluates)41 b(eac)m(h)g(ro)m(w)e(of)h(the)f(input)g (table)h(and)f(returns)f(TR)m(UE)i(or)0 3127 y(F)-10 b(ALSE)30 b(dep)s(ending)f(whether)h(the)g(ro)m(w)h(is)f(inside)g(or)g (outside)h(the)g(go)s(o)s(d)f(time)h(in)m(terv)-5 b(al.)42 b(The)30 b(syn)m(tax)h(is)286 3372 y Fe(gtifilter\()45 b([)j("gtifile")d([,)i(expr)g([,)g("STARTCOL",)e("STOPCOL")g(])j(])f(]) g(\))191 3484 y(or)286 3597 y(gtifilter\()e([)j('gtifile')d([,)i(expr)g ([,)g('STARTCOL',)e('STOPCOL')g(])j(])f(])g(\))0 3842 y Fj(where)20 b(eac)m(h)h("[]")h(demarks)e(optional)h(parameters.)38 b(Note)21 b(that)g(the)g(quotes)f(around)g(the)g(gti\014le)i(and)d(ST) -8 b(AR)g(T/STOP)0 3955 y(column)33 b(are)h(required.)50 b(Either)34 b(single)g(or)g(double)f(quotes)h(ma)m(y)g(b)s(e)f(used.)50 b(In)33 b(cases)h(where)g(this)f(expression)0 4067 y(is)d(en)m(tered)g (on)g(the)g(Unix)g(command)g(line,)g(enclose)h(the)f(en)m(tire)h (expression)f(in)f(double)h(quotes,)g(and)g(then)f(use)0 4180 y(single)c(quotes)g(within)e(the)i(expression)f(to)h(enclose)g (the)g('gti\014le')h(and)d(other)i(terms.)38 b(It)25 b(is)f(also)h(usually)f(p)s(ossible)0 4293 y(to)38 b(do)e(the)h(rev)m (erse,)j(and)c(enclose)i(the)f(whole)g(expression)g(in)f(single)i (quotes)f(and)f(then)h(use)f(double)g(quotes)0 4406 y(within)d(the)g (expression.)50 b(The)33 b(gti\014le,)i(if)f(sp)s(eci\014ed,)f(can)h(b) s(e)f(blank)g(\(""\))i(whic)m(h)e(will)g(mean)h(to)g(use)f(the)h (\014rst)0 4519 y(extension)g(with)g(the)f(name)h("*GTI*")h(in)f(the)f (curren)m(t)h(\014le,)h(a)f(plain)f(extension)h(sp)s(eci\014er)f(\(eg,) j("+2",)g("[2]",)0 4632 y(or)30 b("[STDGTI]"\))i(whic)m(h)e(will)h(b)s (e)f(used)f(to)j(select)g(an)e(extension)h(in)f(the)h(curren)m(t)f (\014le,)h(or)f(a)h(regular)g(\014lename)0 4745 y(with)f(or)h(without)f (an)h(extension)g(sp)s(eci\014er)f(whic)m(h)g(in)g(the)h(latter)h(case) f(will)g(mean)f(to)i(use)e(the)h(\014rst)e(extension)0 4858 y(with)37 b(an)g(extension)g(name)h("*GTI*".)62 b(Expr)36 b(can)h(b)s(e)g(an)m(y)g(arithmetic)i(expression,)f (including)f(simply)g(the)0 4971 y(time)f(column)g(name.)57 b(A)36 b(v)m(ector)h(time)g(expression)e(will)h(pro)s(duce)f(a)h(v)m (ector)h(b)s(o)s(olean)f(result.)57 b(ST)-8 b(AR)g(TCOL)0 5084 y(and)27 b(STOPCOL)f(are)i(the)g(names)g(of)g(the)g(ST)-8 b(AR)g(T/STOP)26 b(columns)i(in)f(the)h(GTI)g(extension.)41 b(If)27 b(one)h(of)g(them)0 5197 y(is)i(sp)s(eci\014ed,)g(they)h(b)s (oth)f(m)m(ust)g(b)s(e.)0 5357 y(In)21 b(its)h(simplest)g(form,)i(no)d (parameters)h(need)g(to)h(b)s(e)e(pro)m(vided)g({)h(default)g(v)-5 b(alues)22 b(will)h(b)s(e)e(used.)37 b(The)21 b(expression)0 5470 y("gti\014lter\(\)")33 b(is)e(equiv)-5 b(alen)m(t)31 b(to)334 5714 y Fe(gtifilter\()45 b("",)i(TIME,)f("*START*",)f ("*STOP*")h(\))p eop end %%Page: 149 157 TeXDict begin 149 156 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.149) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.11.)73 b(R)m(O)m(W)31 b(FIL)-8 b(TERING)31 b(SPECIFICA)-8 b(TION)1936 b Fj(149)0 555 y(This)31 b(will)g(searc)m(h)h(the)g(curren)m(t)f (\014le)g(for)g(a)h(GTI)f(extension,)h(\014lter)g(the)f(TIME)g(column)g (in)g(the)h(curren)m(t)f(table,)0 668 y(using)j(ST)-8 b(AR)g(T/STOP)34 b(times)i(tak)m(en)f(from)g(columns)f(in)h(the)g(GTI)g (extension)g(with)g(names)f(con)m(taining)j(the)0 781 y(strings)32 b("ST)-8 b(AR)g(T")33 b(and)e("STOP".)46 b(The)32 b(wildcards)f(\('*'\))j(allo)m(w)g(sligh)m(t)f(v)-5 b(ariations)33 b(in)f(naming)g(con)m(v)m(en)m(tions)0 894 y(suc)m(h)38 b(as)g("TST)-8 b(AR)g(T")39 b(or)f("ST)-8 b(AR)g(TTIME".)65 b(The)37 b(same)i(default)g(v)-5 b(alues)38 b(apply)g(for)g(unsp)s(eci\014ed)f(parame-)0 1007 y(ters)f(when)f(the)h (\014rst)f(one)i(or)f(t)m(w)m(o)h(parameters)f(are)h(sp)s(eci\014ed.)56 b(The)36 b(function)f(automatically)k(searc)m(hes)e(for)0 1120 y(TIMEZER)m(O/I/F)g(k)m(eyw)m(ords)f(in)g(the)h(curren)m(t)f(and)g (GTI)g(extensions,)i(applying)f(a)f(relativ)m(e)j(time)e(o\013set,)i (if)0 1233 y(necessary)-8 b(.)0 1381 y SDict begin H.S end 0 1381 a 0 1381 a SDict begin 13.6 H.A end 0 1381 a 0 1381 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.11.6) cvn /DEST pdfmark end 0 1381 a 146 x Fd(10.11.6)113 b(Spatial)38 b(Region)g(Filtering)0 1746 y Fj(Another)g(common)g(\014ltering)g (metho)s(d)f(selects)i(ro)m(ws)f(based)g(on)f(whether)h(the)g(spatial)h (p)s(osition)e(asso)s(ciated)0 1859 y(with)32 b(eac)m(h)i(ro)m(w)e(is)h (lo)s(cated)h(within)e(a)h(giv)m(en)g(2-dimensional)g(region.)48 b(The)32 b(syn)m(tax)h(for)f(this)h(high-lev)m(el)h(\014lter)0 1972 y(is)334 2235 y Fe(regfilter\()45 b("regfilename")f([)k(,)f (Xexpr,)f(Yexpr)h([)g(,)h("wcs)e(cols")h(])g(])g(\))0 2497 y Fj(where)22 b(eac)m(h)i("[]")g(demarks)e(optional)i(parameters.) 38 b(The)22 b(region)h(\014le)g(name)f(is)h(required)f(and)g(m)m(ust)g (b)s(e)g(enclosed)0 2610 y(in)34 b(quotes.)51 b(The)33 b(remaining)h(parameters)h(are)f(optional.)52 b(There)33 b(are)i(2)f(supp)s(orted)e(formats)i(for)f(the)h(region)0 2723 y(\014le:)62 b(ASCI)s(I)39 b(\014le)h(or)h(FITS)f(binary)g(table.) 73 b(The)40 b(region)h(\014le)g(con)m(tains)h(a)f(list)g(of)g(one)g(or) g(more)g(geometric)0 2836 y(shap)s(es)30 b(\(circle,)j(ellipse,)g(b)s (o)m(x,)e(etc.\))44 b(whic)m(h)31 b(de\014nes)f(a)i(region)g(on)f(the)g (celestial)j(sphere)c(or)h(an)g(area)h(within)f(a)0 2949 y(particular)36 b(2D)g(image.)57 b(The)35 b(region)h(\014le)f(is)g(t)m (ypically)j(generated)e(using)f(an)g(image)i(displa)m(y)e(program)g (suc)m(h)0 3062 y(as)e(fv/PO)m(W)g(\(distribute)f(b)m(y)h(the)f(HEASAR) m(C\),)h(or)g(ds9)f(\(distributed)g(b)m(y)g(the)h(Smithsonian)f (Astroph)m(ysical)0 3175 y(Observ)-5 b(atory\).)69 b(Users)39 b(should)g(refer)g(to)h(the)g(do)s(cumen)m(tation)h(pro)m(vided)e(with) g(these)h(programs)f(for)h(more)0 3288 y(details)29 b(on)f(the)g(syn)m (tax)h(used)e(in)h(the)h(region)f(\014les.)40 b(The)28 b(FITS)f(region)i(\014le)f(format)h(is)f(de\014ned)f(in)h(a)g(do)s (cumen)m(t)0 3401 y(a)m(v)-5 b(ailable)33 b(from)d(the)g(FITS)g(Supp)s (ort)e(O\016ce)j(at)g(h)m(ttp://\014ts.gsfc.nasa.go)m(v/)k(registry/)c (region.h)m(tml)0 3561 y(In)21 b(its)h(simplest)g(form,)i(\(e.g.,)h (reg\014lter\("region.reg"\))h(\))c(the)g(co)s(ordinates)g(in)g(the)g (default)g('X')h(and)e('Y')h(columns)0 3674 y(will)43 b(b)s(e)g(used)f(to)i(determine)f(if)g(eac)m(h)h(ro)m(w)f(is)g(inside)g (or)g(outside)g(the)g(area)h(sp)s(eci\014ed)e(in)h(the)g(region)h (\014le.)0 3786 y(Alternate)32 b(p)s(osition)e(column)g(names,)h(or)f (expressions,)h(ma)m(y)g(b)s(e)e(en)m(tered)i(if)g(needed,)f(as)h(in) 382 4049 y Fe(regfilter\("region.reg",)41 b(XPOS,)47 b(YPOS\))0 4312 y Fj(Region)37 b(\014ltering)f(can)g(b)s(e)f(applied)g (most)h(unam)m(biguously)f(if)h(the)g(p)s(ositions)g(in)f(the)h(region) g(\014le)g(and)f(in)h(the)0 4425 y(table)g(to)g(b)s(e)e(\014ltered)h (are)h(b)s(oth)e(giv)m(e)j(in)e(terms)g(of)g(absolute)h(celestial)i(co) s(ordinate)e(units.)54 b(In)35 b(this)g(case)h(the)0 4538 y(lo)s(cations)26 b(and)d(sizes)i(of)g(the)f(geometric)i(shap)s (es)e(in)g(the)g(region)h(\014le)f(are)h(sp)s(eci\014ed)f(in)g(angular) g(units)g(on)g(the)g(sky)0 4650 y(\(e.g.,)32 b(p)s(ositions)e(giv)m(en) i(in)e(R.A.)g(and)g(Dec.)42 b(and)30 b(sizes)h(in)f(arcseconds)g(or)h (arcmin)m(utes\).)41 b(Similarly)-8 b(,)31 b(eac)m(h)h(ro)m(w)0 4763 y(of)h(the)h(\014ltered)f(table)h(will)f(ha)m(v)m(e)i(a)e (celestial)j(co)s(ordinate)e(asso)s(ciated)g(with)f(it.)50 b(This)32 b(asso)s(ciation)j(is)e(usually)0 4876 y(implemen)m(ted)39 b(using)e(a)i(set)g(of)f(so-called)i('W)-8 b(orld)39 b(Co)s(ordinate)g(System')f(\(or)h(W)m(CS\))f(FITS)g(k)m(eyw)m(ords)g (that)0 4989 y(de\014ne)27 b(the)g(co)s(ordinate)h(transformation)g (that)g(m)m(ust)f(b)s(e)f(applied)h(to)h(the)g(v)-5 b(alues)27 b(in)g(the)h('X')g(and)e('Y')i(columns)0 5102 y(to)j(calculate)i(the)d (co)s(ordinate.)0 5262 y(Alternativ)m(ely)-8 b(,)30 b(one)d(can)g(p)s (erform)e(spatial)j(\014ltering)e(using)g(unitless)h('pixel')g(co)s (ordinates)h(for)e(the)h(regions)g(and)0 5375 y(ro)m(w)33 b(p)s(ositions.)49 b(In)33 b(this)g(case)h(the)f(user)g(m)m(ust)g(b)s (e)f(careful)h(to)h(ensure)f(that)g(the)h(p)s(ositions)f(in)g(the)g(2)g (\014les)h(are)0 5488 y(self-consisten)m(t.)54 b(A)34 b(t)m(ypical)i(problem)d(is)h(that)h(the)f(region)h(\014le)f(ma)m(y)h (b)s(e)e(generated)j(using)d(a)i(binned)d(image,)0 5601 y(but)g(the)h(un)m(binned)e(co)s(ordinates)i(are)g(giv)m(en)h(in)e(the) h(ev)m(en)m(t)i(table.)48 b(The)32 b(R)m(OSA)-8 b(T)33 b(ev)m(en)m(ts)h(\014les,)g(for)e(example,)0 5714 y(ha)m(v)m(e)f(X)f (and)f(Y)g(pixel)h(co)s(ordinates)g(that)h(range)f(from)f(1)h(-)g (15360.)42 b(These)30 b(co)s(ordinates)g(are)g(t)m(ypically)h(binned)p eop end %%Page: 150 158 TeXDict begin 150 157 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.150) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(150)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fj(b)m(y)33 b(a)h(factor)g(of)f(32)h(to)g(pro)s(duce)e(a)i (480x480)i(pixel)d(image.)51 b(If)32 b(one)i(then)f(uses)g(a)g(region)h (\014le)f(generated)h(from)0 668 y(this)c(image)i(\(in)f(image)g(pixel) g(units\))g(to)g(\014lter)f(the)h(R)m(OSA)-8 b(T)30 b(ev)m(en)m(ts)i (\014le,)f(then)f(the)h(X)g(and)f(Y)g(column)h(v)-5 b(alues)0 781 y(m)m(ust)30 b(b)s(e)g(con)m(v)m(erted)i(to)f(corresp)s(onding)e (pixel)i(units)f(as)g(in:)382 1076 y Fe(regfilter\("rosat.reg",)42 b(X/32.+.5,)j(Y/32.+.5\))0 1370 y Fj(Note)h(that)f(this)f(binning)f (con)m(v)m(ersion)j(is)e(not)h(necessary)g(if)f(the)h(region)g(\014le)f (is)h(sp)s(eci\014ed)e(using)h(celestial)0 1483 y(co)s(ordinate)h (units)f(instead)g(of)g(pixel)h(units)f(b)s(ecause)g(CFITSIO)e(is)j (then)e(able)i(to)g(directly)g(compare)g(the)0 1596 y(celestial)30 b(co)s(ordinate)f(of)e(eac)m(h)i(ro)m(w)f(in)f(the)h(table)g(with)g (the)f(celestial)k(co)s(ordinates)d(in)f(the)h(region)g(\014le)g (without)0 1709 y(ha)m(ving)j(to)g(kno)m(w)f(an)m(ything)h(ab)s(out)f (ho)m(w)h(the)f(image)i(ma)m(y)f(ha)m(v)m(e)g(b)s(een)f(binned.)0 1869 y(The)f(last)h("w)m(cs)g(cols")h(parameter)f(should)e(rarely)h(b)s (e)g(needed.)40 b(If)29 b(supplied,)f(this)i(string)f(con)m(tains)i (the)e(names)0 1982 y(of)37 b(the)g(2)h(columns)f(\(space)h(or)f(comma) g(separated\))h(whic)m(h)f(ha)m(v)m(e)h(the)g(asso)s(ciated)g(W)m(CS)f (k)m(eyw)m(ords.)61 b(If)37 b(not)0 2095 y(supplied,)f(the)g(\014lter)g (will)h(scan)f(the)g(X)g(and)f(Y)h(expressions)g(for)g(column)f(names.) 58 b(If)35 b(only)h(one)h(is)f(found)e(in)0 2208 y(eac)m(h)e (expression,)e(those)h(columns)f(will)h(b)s(e)e(used,)h(otherwise)h(an) f(error)g(will)h(b)s(e)f(returned.)0 2368 y(These)g(region)h(shap)s(es) f(are)g(supp)s(orted)f(\(names)h(are)h(case)h(insensitiv)m(e\):)334 2662 y Fe(Point)428 b(\()48 b(X1,)f(Y1)g(\))715 b(<-)48 b(One)f(pixel)f(square)g(region)334 2775 y(Line)476 b(\()48 b(X1,)f(Y1,)g(X2,)f(Y2)i(\))333 b(<-)48 b(One)f(pixel)f(wide)h(region) 334 2888 y(Polygon)332 b(\()48 b(X1,)f(Y1,)g(X2,)f(Y2,)h(...)g(\))95 b(<-)48 b(Rest)e(are)h(interiors)e(with)334 3001 y(Rectangle)236 b(\()48 b(X1,)f(Y1,)g(X2,)f(Y2,)h(A)h(\))334 b(|)47 b(boundaries)e (considered)334 3114 y(Box)524 b(\()48 b(Xc,)f(Yc,)g(Wdth,)f(Hght,)g(A) i(\))143 b(V)47 b(within)f(the)h(region)334 3227 y(Diamond)332 b(\()48 b(Xc,)f(Yc,)g(Wdth,)f(Hght,)g(A)i(\))334 3340 y(Circle)380 b(\()48 b(Xc,)f(Yc,)g(R)g(\))334 3453 y(Annulus)332 b(\()48 b(Xc,)f(Yc,)g(Rin,)f(Rout)h(\))334 3566 y(Ellipse)332 b(\()48 b(Xc,)f(Yc,)g(Rx,)f(Ry,)h(A)h(\))334 3678 y(Elliptannulus)c(\() k(Xc,)f(Yc,)g(Rinx,)f(Riny,)g(Routx,)g(Routy,)g(Ain,)h(Aout)g(\))334 3791 y(Sector)380 b(\()48 b(Xc,)f(Yc,)g(Amin,)f(Amax)h(\))0 4086 y Fj(where)28 b(\(Xc,Yc\))j(is)d(the)h(co)s(ordinate)h(of)e(the)h (shap)s(e's)f(cen)m(ter;)j(\(X#,Y#\))e(are)g(the)g(co)s(ordinates)g(of) g(the)g(shap)s(e's)0 4199 y(edges;)39 b(Rxxx)c(are)g(the)h(shap)s(es')f (v)-5 b(arious)35 b(Radii)h(or)f(semima)5 b(jor/minor)36 b(axes;)i(and)d(Axxx)g(are)h(the)g(angles)g(of)0 4312 y(rotation)d(\(or)e(b)s(ounding)f(angles)i(for)f(Sector\))h(in)f (degrees.)44 b(F)-8 b(or)32 b(rotated)h(shap)s(es,)e(the)g(rotation)i (angle)f(can)g(b)s(e)0 4425 y(left)g(o\013,)h(indicating)f(no)f (rotation.)46 b(Common)31 b(alternate)i(names)e(for)h(the)f(regions)h (can)g(also)h(b)s(e)d(used:)43 b(rotb)s(o)m(x)0 4538 y(=)29 b(b)s(o)m(x;)g(rotrectangle)i(=)e(rectangle;)i(\(rot\)rhom)m (bus)e(=)f(\(rot\)diamond;)j(and)d(pie)h(=)f(sector.)42 b(When)28 b(a)i(shap)s(e's)0 4650 y(name)e(is)g(preceded)f(b)m(y)h(a)g (min)m(us)g(sign,)g('-',)i(the)e(de\014ned)e(region)j(is)f(instead)g (the)g(area)h(*outside*)g(its)f(b)s(oundary)0 4763 y(\(ie,)36 b(the)e(region)h(is)f(in)m(v)m(erted\).)53 b(All)34 b(the)g(shap)s(es)f (within)h(a)g(single)h(region)f(\014le)h(are)f(OR'd)f(together)j(to)e (create)0 4876 y(the)29 b(region,)i(and)d(the)i(order)f(is)g (signi\014can)m(t.)41 b(The)29 b(o)m(v)m(erall)i(w)m(a)m(y)g(of)e(lo)s (oking)h(at)g(region)g(\014les)f(is)g(that)h(if)f(the)h(\014rst)0 4989 y(region)f(is)g(an)g(excluded)g(region)g(then)f(a)i(dumm)m(y)d (included)h(region)i(of)f(the)g(whole)g(detector)h(is)f(inserted)f(in)h (the)0 5102 y(fron)m(t.)40 b(Then)25 b(eac)m(h)j(region)f(sp)s (eci\014cation)h(as)f(it)g(is)g(pro)s(cessed)f(o)m(v)m(errides)h(an)m (y)g(selections)i(inside)d(of)h(that)g(region)0 5215 y(sp)s(eci\014ed)36 b(b)m(y)g(previous)g(regions.)59 b(Another)37 b(w)m(a)m(y)g(of)g(thinking)f(ab)s(out)g(this)g(is)h(that) g(if)f(a)h(previous)f(excluded)0 5328 y(region)31 b(is)f(completely)i (inside)f(of)f(a)h(subsequen)m(t)e(included)h(region)h(the)g(excluded)f (region)h(is)f(ignored.)0 5488 y(The)44 b(p)s(ositional)i(co)s (ordinates)g(ma)m(y)f(b)s(e)g(giv)m(en)h(either)f(in)g(pixel)g(units,)j (decimal)e(degrees)g(or)f(hh:mm:ss.s,)0 5601 y(dd:mm:ss.s)25 b(units.)38 b(The)26 b(shap)s(e)f(sizes)i(ma)m(y)f(b)s(e)g(giv)m(en)h (in)e(pixels,)j(degrees,)f(arcmin)m(utes,)h(or)e(arcseconds.)40 b(Lo)s(ok)0 5714 y(at)31 b(examples)g(of)f(region)h(\014le)g(pro)s (duced)d(b)m(y)i(fv/PO)m(W)h(or)g(ds9)f(for)g(further)f(details)i(of)g (the)f(region)h(\014le)f(format.)p eop end %%Page: 151 159 TeXDict begin 151 158 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.151) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.11.)73 b(R)m(O)m(W)31 b(FIL)-8 b(TERING)31 b(SPECIFICA)-8 b(TION)1936 b Fj(151)0 555 y(There)31 b(are)g(three)h(lo)m(w-lev)m(el)i(functions)d (that)g(are)h(primarily)f(for)g(use)g(with)g(reg\014lter)g(function,)h (but)e(they)i(can)0 668 y(b)s(e)j(called)i(directly)-8 b(.)59 b(They)35 b(return)g(a)h(b)s(o)s(olean)g(true)g(or)g(false)h (dep)s(ending)d(on)i(whether)f(a)i(t)m(w)m(o)g(dimensional)0 781 y(p)s(oin)m(t)30 b(is)h(in)f(the)g(region)h(or)g(not.)41 b(The)30 b(p)s(ositional)h(co)s(ordinates)g(m)m(ust)f(b)s(e)g(giv)m(en) h(in)f(pixel)h(units:)191 1029 y Fe("point)46 b(in)h(a)h(circular)d (region")477 1141 y(circle\(xcntr,ycntr,radius)o(,Xco)o(lumn)o(,Yc)o (olum)o(n\))191 1367 y("point)h(in)h(an)g(elliptical)e(region")430 1480 y(ellipse\(xcntr,ycntr,xhl)o(f_w)o(dth,)o(yhlf)o(_wd)o(th,r)o (otat)o(ion)o(,Xco)o(lumn)o(,Yc)o(olum)o(n\))191 1706 y("point)h(in)h(a)h(rectangular)c(region")620 1819 y (box\(xcntr,ycntr,xfll_wdth,)o(yfll)o(_wd)o(th,r)o(otat)o(ion)o(,Xco)o (lumn)o(,Yc)o(olum)o(n\))191 2045 y(where)334 2158 y(\(xcntr,ycntr\))g (are)j(the)g(\(x,y\))f(position)g(of)h(the)g(center)f(of)h(the)g (region)334 2271 y(\(xhlf_wdth,yhlf_wdth\))42 b(are)47 b(the)g(\(x,y\))f(half)h(widths)f(of)h(the)g(region)334 2383 y(\(xfll_wdth,yfll_wdth\))42 b(are)47 b(the)g(\(x,y\))f(full)h (widths)f(of)h(the)g(region)334 2496 y(\(radius\))f(is)h(half)f(the)h (diameter)f(of)h(the)g(circle)334 2609 y(\(rotation\))e(is)i(the)g (angle\(degrees\))d(that)j(the)g(region)f(is)h(rotated)f(with)620 2722 y(respect)g(to)h(\(xcntr,ycntr\))334 2835 y(\(Xcoord,Ycoord\))d (are)j(the)g(\(x,y\))f(coordinates)f(to)i(test,)f(usually)g(column)620 2948 y(names)334 3061 y(NOTE:)g(each)h(parameter)e(can)i(itself)f(be)i (an)f(expression,)d(not)j(merely)f(a)620 3174 y(column)h(name)f(or)h (constant.)0 3299 y SDict begin H.S end 0 3299 a 0 3299 a SDict begin 13.6 H.A end 0 3299 a 0 3299 a SDict begin [/View [/XYZ H.V]/Dest (subsection.10.11.7) cvn /DEST pdfmark end 0 3299 a 164 x Fd(10.11.7)113 b(Example)38 b(Ro)m(w)f(Filters)191 3681 y Fe([)47 b(binary)f(&&)i(mag)f(<=)g(5.0])380 b(-)48 b(Extract)e(all)h(binary)f(stars)g(brighter)1766 3794 y(than)94 b(fifth)47 b(magnitude)e(\(note)h(that)1766 3907 y(the)h(initial)f(space)g(is)h(necessary)e(to)1766 4020 y(prevent)h(it)h(from)g(being)f(treated)g(as)h(a)1766 4133 y(binning)f(specification\))191 4359 y([#row)g(>=)h(125)g(&&)h (#row)e(<=)h(175])142 b(-)48 b(Extract)e(row)h(numbers)e(125)i(through) f(175)191 4585 y([IMAGE[4,5])f(.gt.)h(100])476 b(-)48 b(Extract)e(all)h(rows)f(that)h(have)g(the)1766 4698 y(\(4,5\))f(component)g(of)h(the)g(IMAGE)f(column)1766 4811 y(greater)g(than)g(100)191 5036 y([abs\(sin\(theta)e(*)j(#deg\)\)) f(<)i(0.5])e(-)i(Extract)e(all)h(rows)f(having)g(the)1766 5149 y(absolute)f(value)i(of)g(the)g(sine)g(of)g(theta)1766 5262 y(less)94 b(than)47 b(a)g(half)g(where)f(the)h(angles)1766 5375 y(are)g(tabulated)e(in)i(degrees)191 5601 y([SUM\()f(SPEC)h(>)g (3*BACKGRND)e(\)>=1])94 b(-)48 b(Extract)e(all)h(rows)f(containing)f(a) 1766 5714 y(spectrum,)g(held)i(in)g(vector)f(column)p eop end %%Page: 152 160 TeXDict begin 152 159 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.152) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(152)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)1766 555 y Fe(SPEC,)46 b(with)h(at)g(least)f(one)h(value)g(3)1766 668 y(times)f(greater)g(than)h(the)g(background)1766 781 y(level)f(held)h(in)g(a)h(keyword,)d(BACKGRND)191 1007 y([VCOL=={1,4,2}])759 b(-)48 b(Extract)e(all)h(rows)f(whose)h (vector)f(column)1766 1120 y(VCOL)h(contains)e(the)i(3-elements)e(1,)i (4,)g(and)1766 1233 y(2.)191 1458 y([@rowFilter.txt])711 b(-)48 b(Extract)e(rows)g(using)h(the)g(expression)1766 1571 y(contained)e(within)h(the)h(text)g(file)1766 1684 y(rowFilter.txt)191 1910 y([gtifilter\(\)])855 b(-)48 b(Search)e(the)h(current)f(file)g(for)h(a)h(GTI)239 2023 y(extension,)92 b(filter)i(the)47 b(TIME)239 2136 y(column)f(in)h(the)g (current)f(table,)g(using)239 2249 y(START/STOP)f(times)h(taken)g(from) 239 2362 y(columns)f(in)j(the)f(GTI)94 b(extension)191 2588 y([regfilter\("pow.reg"\)])423 b(-)48 b(Extract)e(rows)g(which)h (have)f(a)i(coordinate)1766 2700 y(\(as)f(given)f(in)h(the)g(X)h(and)f (Y)g(columns\))1766 2813 y(within)f(the)h(spatial)f(region)g(specified) 1766 2926 y(in)h(the)g(pow.reg)f(region)g(file.)191 3152 y([regfilter\("pow.reg",)c(Xs,)47 b(Ys\)])f(-)i(Same)f(as)g(above,)f (except)g(that)h(the)1766 3265 y(Xs)g(and)g(Ys)g(columns)f(will)h(be)g (used)f(to)1766 3378 y(determine)f(the)i(coordinate)e(of)i(each)1766 3491 y(row)g(in)g(the)g(table.)0 3637 y SDict begin H.S end 0 3637 a 0 3637 a SDict begin 13.6 H.A end 0 3637 a 0 3637 a SDict begin [/View [/XYZ H.V]/Dest (section.10.12) cvn /DEST pdfmark end 0 3637 a 197 x Ff(10.12)181 b(Binning)44 b(or)h(Histogramming)i(Sp)t(eci\014cation)0 4086 y Fj(The)22 b(optional)i(binning)e(sp)s(eci\014er)g(is)h(enclosed)h(in)f(square)f (brac)m(k)m(ets)j(and)d(can)h(b)s(e)f(distinguished)g(from)h(a)g (general)0 4199 y(ro)m(w)32 b(\014lter)h(sp)s(eci\014cation)g(b)m(y)f (the)h(fact)g(that)g(it)g(b)s(egins)f(with)g(the)g(k)m(eyw)m(ord)h ('bin')f(not)h(immediately)g(follo)m(w)m(ed)0 4312 y(b)m(y)41 b(an)f(equals)i(sign.)72 b(When)41 b(binning)e(is)i(sp)s(eci\014ed,)i (a)e(temp)s(orary)g(N-dimensional)g(FITS)f(primary)g(arra)m(y)0 4425 y(is)j(created)h(b)m(y)f(computing)h(the)f(histogram)h(of)f(the)g (v)-5 b(alues)44 b(in)e(the)i(sp)s(eci\014ed)e(columns)h(of)g(a)h(FITS) e(table)0 4538 y(extension.)f(After)30 b(the)f(histogram)h(is)g (computed)f(the)h(input)e(FITS)h(\014le)h(con)m(taining)h(the)e(table)i (is)e(then)g(closed)0 4650 y(and)34 b(the)h(temp)s(orary)f(FITS)g (primary)g(arra)m(y)h(is)g(op)s(ened)f(and)g(passed)g(to)h(the)g (application)h(program.)54 b(Th)m(us,)0 4763 y(the)39 b(application)h(program)f(nev)m(er)g(sees)g(the)g(original)h(FITS)e (table)i(and)e(only)h(sees)h(the)f(image)h(in)e(the)h(new)0 4876 y(temp)s(orary)32 b(\014le)h(\(whic)m(h)g(has)f(no)h(additional)g (extensions\).)49 b(Ob)m(viously)-8 b(,)34 b(the)f(application)h (program)e(m)m(ust)h(b)s(e)0 4989 y(exp)s(ecting)e(to)g(op)s(en)f(a)h (FITS)e(image)j(and)e(not)g(a)h(FITS)f(table)h(in)f(this)g(case.)0 5149 y(The)g(data)h(t)m(yp)s(e)f(of)h(the)f(FITS)g(histogram)g(image)i (ma)m(y)f(b)s(e)f(sp)s(eci\014ed)f(b)m(y)h(app)s(ending)f('b')h(\(for)h (8-bit)g(b)m(yte\),)g('i')0 5262 y(\(for)g(16-bit)g(in)m(tegers\),)h ('j')f(\(for)g(32-bit)g(in)m(teger\),)i('r')d(\(for)h(32-bit)g (\015oating)h(p)s(oin)m(ts\),)e(or)h('d')f(\(for)h(64-bit)g(double)0 5375 y(precision)j(\015oating)i(p)s(oin)m(t\))e(to)h(the)g('bin')f(k)m (eyw)m(ord)h(\(e.g.)54 b('[binr)33 b(X]')i(creates)h(a)f(real)g (\015oating)g(p)s(oin)m(t)f(image\).)0 5488 y(If)g(the)i(data)f(t)m(yp) s(e)g(is)g(not)h(explicitly)g(sp)s(eci\014ed)e(then)h(a)g(32-bit)i(in)m (teger)f(image)g(will)f(b)s(e)g(created)h(b)m(y)e(default,)0 5601 y(unless)24 b(the)i(w)m(eigh)m(ting)g(option)g(is)f(also)h(sp)s (eci\014ed)e(in)h(whic)m(h)g(case)h(the)f(image)i(will)e(ha)m(v)m(e)h (a)g(32-bit)g(\015oating)g(p)s(oin)m(t)0 5714 y(data)31 b(t)m(yp)s(e)g(b)m(y)f(default.)p eop end %%Page: 153 161 TeXDict begin 153 160 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.153) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(10.12.)113 b(BINNING)32 b(OR)e(HISTOGRAMMING)g(SPECIFICA)-8 b(TION)1223 b Fj(153)0 555 y(The)24 b(histogram)g(image)i(ma)m(y)f(ha)m(v)m(e)g (from)f(1)g(to)h(4)g(dimensions)e(\(axes\),)k(dep)s(ending)c(on)h(the)g (n)m(um)m(b)s(er)f(of)h(columns)0 668 y(that)31 b(are)g(sp)s (eci\014ed.)40 b(The)30 b(general)h(form)f(of)g(the)h(binning)e(sp)s (eci\014cation)i(is:)48 921 y Fe([bin{bijrd})92 b (Xcol=min:max:binsize,)42 b(Ycol=)47 b(...,)f(Zcol=...,)f(Tcol=...;)h (weight])0 1174 y Fj(in)39 b(whic)m(h)g(up)f(to)i(4)g(columns,)h(eac)m (h)f(corresp)s(onding)e(to)i(an)g(axis)f(of)h(the)f(image,)k(are)d (listed.)67 b(The)39 b(column)0 1287 y(names)27 b(are)h(case)h (insensitiv)m(e,)g(and)e(the)h(column)f(n)m(um)m(b)s(er)f(ma)m(y)i(b)s (e)f(giv)m(en)h(instead)g(of)g(the)g(name,)g(preceded)f(b)m(y)0 1400 y(a)32 b(p)s(ound)e(sign)i(\(e.g.,)i([bin)d(#4=1:512]\).)47 b(If)31 b(the)h(column)g(name)g(is)f(not)h(sp)s(eci\014ed,)g(then)f (CFITSIO)g(will)h(\014rst)0 1512 y(try)37 b(to)h(use)f(the)g ('preferred)f(column')i(as)f(sp)s(eci\014ed)g(b)m(y)g(the)g(CPREF)g(k)m (eyw)m(ord)h(if)f(it)g(exists)h(\(e.g.,)j('CPREF)0 1625 y(=)i('DETX,DETY'\),)h(otherwise)g(column)f(names)g('X',)h('Y',)g('Z',) f(and)f('T')i(will)f(b)s(e)f(assumed)h(for)g(eac)m(h)h(of)0 1738 y(the)37 b(4)h(axes,)i(resp)s(ectiv)m(ely)-8 b(.)62 b(In)37 b(cases)h(where)e(the)i(column)f(name)g(could)g(b)s(e)f (confused)h(with)g(an)g(arithmetic)0 1851 y(expression,)30 b(enclose)i(the)f(column)f(name)g(in)g(paren)m(theses)h(to)g(force)g (the)f(name)h(to)g(b)s(e)f(in)m(terpreted)g(literally)-8 b(.)0 2011 y(Eac)m(h)33 b(column)f(name)g(ma)m(y)h(b)s(e)f(follo)m(w)m (ed)h(b)m(y)g(an)f(equals)g(sign)h(and)e(then)h(the)g(lo)m(w)m(er)i (and)e(upp)s(er)e(range)i(of)h(the)0 2124 y(histogram,)f(and)e(the)h (size)h(of)f(the)g(histogram)h(bins,)e(separated)h(b)m(y)g(colons.)43 b(Spaces)31 b(are)g(allo)m(w)m(ed)i(b)s(efore)e(and)0 2237 y(after)e(the)g(equals)g(sign)f(but)g(not)h(within)f(the)h ('min:max:binsize')g(string.)40 b(The)29 b(min,)f(max)h(and)f(binsize)h (v)-5 b(alues)0 2350 y(ma)m(y)32 b(b)s(e)e(in)m(teger)i(or)f (\015oating)h(p)s(oin)m(t)f(n)m(um)m(b)s(ers,)f(or)h(they)g(ma)m(y)g(b) s(e)g(the)g(names)g(of)g(k)m(eyw)m(ords)g(in)g(the)g(header)g(of)0 2463 y(the)g(table.)41 b(If)30 b(the)h(latter,)h(then)e(the)g(v)-5 b(alue)31 b(of)g(that)g(k)m(eyw)m(ord)f(is)h(substituted)f(in)m(to)h (the)g(expression.)0 2623 y(Default)37 b(v)-5 b(alues)36 b(for)g(the)g(min,)h(max)f(and)g(binsize)g(quan)m(tities)h(will)f(b)s (e)f(used)h(if)f(not)i(explicitly)g(giv)m(en)g(in)f(the)0 2736 y(binning)29 b(expression)h(as)h(sho)m(wn)f(in)g(these)h (examples:)191 2989 y Fe([bin)47 b(x)g(=)g(:512:2])94 b(-)47 b(use)g(default)f(minimum)g(value)191 3102 y([bin)h(x)g(=)g (1::2])190 b(-)47 b(use)g(default)f(maximum)g(value)191 3215 y([bin)h(x)g(=)g(1:512])142 b(-)47 b(use)g(default)f(bin)h(size) 191 3328 y([bin)g(x)g(=)g(1:])286 b(-)47 b(use)g(default)f(maximum)g (value)g(and)h(bin)g(size)191 3440 y([bin)g(x)g(=)g(:512])190 b(-)47 b(use)g(default)f(minimum)g(value)g(and)h(bin)g(size)191 3553 y([bin)g(x)g(=)g(2])334 b(-)47 b(use)g(default)f(minimum)g(and)h (maximum)f(values)191 3666 y([bin)h(x])524 b(-)47 b(use)g(default)f (minimum,)g(maximum)g(and)g(bin)h(size)191 3779 y([bin)g(4])524 b(-)47 b(default)f(2-D)h(image,)f(bin)h(size)g(=)g(4)h(in)f(both)g (axes)191 3892 y([bin])619 b(-)47 b(default)f(2-D)h(image)0 4145 y Fj(CFITSIO)31 b(will)i(use)f(the)h(v)-5 b(alue)33 b(of)g(the)g(TLMINn,)f(TLMAXn,)h(and)f(TDBINn)h(k)m(eyw)m(ords,)h(if)e (they)h(exist,)h(for)0 4258 y(the)j(default)f(min,)i(max,)g(and)e (binsize,)i(resp)s(ectiv)m(ely)-8 b(.)61 b(If)36 b(they)h(do)f(not)h (exist)g(then)f(CFITSIO)f(will)i(use)f(the)0 4371 y(actual)d(minim)m (um)e(and)h(maxim)m(um)g(v)-5 b(alues)32 b(in)g(the)g(column)f(for)h (the)g(histogram)h(min)e(and)h(max)g(v)-5 b(alues.)45 b(The)0 4484 y(default)34 b(binsize)f(will)h(b)s(e)f(set)h(to)h(1,)g (or)e(\(max)h(-)g(min\))f(/)h(10.,)i(whic)m(hev)m(er)e(is)g(smaller,)h (so)e(that)i(the)e(histogram)0 4597 y(will)e(ha)m(v)m(e)g(at)g(least)h (10)f(bins)f(along)h(eac)m(h)h(axis.)0 4757 y(A)41 b(shortcut)g (notation)h(is)f(allo)m(w)m(ed)i(if)e(all)h(the)f(columns/axes)h(ha)m (v)m(e)g(the)f(same)g(binning)f(sp)s(eci\014cation.)74 b(In)0 4870 y(this)33 b(case)g(all)h(the)f(column)f(names)h(ma)m(y)g(b) s(e)f(listed)h(within)f(paren)m(theses,)i(follo)m(w)m(ed)h(b)m(y)d(the) h(\(single\))h(binning)0 4982 y(sp)s(eci\014cation,)d(as)g(in:)191 5235 y Fe([bin)47 b(\(X,Y\)=1:512:2])191 5348 y([bin)g(\(X,Y\))f(=)h (5])0 5601 y Fj(The)31 b(optional)i(w)m(eigh)m(ting)h(factor)e(is)g (the)g(last)g(item)h(in)e(the)h(binning)f(sp)s(eci\014er)g(and,)h(if)f (presen)m(t,)i(is)e(separated)0 5714 y(from)38 b(the)g(list)h(of)f (columns)g(b)m(y)g(a)h(semi-colon.)65 b(As)39 b(the)f(histogram)h(is)f (accum)m(ulated,)k(this)c(w)m(eigh)m(t)i(is)e(used)p eop end %%Page: 154 162 TeXDict begin 154 161 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.154) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(154)1528 b Fh(CHAPTER)29 b(10.)113 b(EXTENDED)30 b(FILE)h(NAME)f(SYNT)-8 b(AX)0 555 y Fj(to)35 b(incremen)m(ted)f(the)g(v)-5 b(alue)35 b(of)f(the)g(appropriated)f(bin)h(in)f(the)h(histogram.)52 b(If)34 b(the)g(w)m(eigh)m(ting)i(factor)f(is)f(not)0 668 y(sp)s(eci\014ed,)24 b(then)f(the)g(default)g(w)m(eigh)m(t)i(=)d(1) i(is)f(assumed.)37 b(The)23 b(w)m(eigh)m(ting)i(factor)f(ma)m(y)f(b)s (e)g(a)g(constan)m(t)i(in)m(teger)f(or)0 781 y(\015oating)30 b(p)s(oin)m(t)f(n)m(um)m(b)s(er,)f(or)h(the)g(name)g(of)g(a)g(k)m(eyw)m (ord)h(con)m(taining)g(the)g(w)m(eigh)m(ting)g(v)-5 b(alue.)41 b(Or)28 b(the)h(w)m(eigh)m(ting)0 894 y(factor)g(ma)m(y)g(b)s(e)e(the)h (name)g(of)h(a)f(table)h(column)f(in)g(whic)m(h)f(case)j(the)e(v)-5 b(alue)28 b(in)g(that)h(column,)f(on)g(a)h(ro)m(w)f(b)m(y)g(ro)m(w)0 1007 y(basis,)i(will)h(b)s(e)f(used.)0 1167 y(In)35 b(some)h(cases,)i (the)d(column)h(or)f(k)m(eyw)m(ord)h(ma)m(y)g(giv)m(e)h(the)f(recipro)s (cal)g(of)g(the)g(actual)h(w)m(eigh)m(t)g(v)-5 b(alue)36 b(that)g(is)0 1280 y(needed.)49 b(In)32 b(this)h(case,)i(precede)e(the) h(w)m(eigh)m(t)g(k)m(eyw)m(ord)g(or)f(column)g(name)g(b)m(y)g(a)g (slash)g('/')h(to)g(tell)g(CFITSIO)0 1393 y(to)d(use)f(the)h(recipro)s (cal)g(of)f(the)h(v)-5 b(alue)31 b(when)e(constructing)i(the)g (histogram.)0 1553 y(F)-8 b(or)25 b(complex)g(or)f(commonly)g(used)g (histograms,)i(one)e(can)h(also)g(place)g(its)f(description)g(in)m(to)h (a)g(text)g(\014le)f(and)g(im-)0 1666 y(p)s(ort)e(it)g(in)m(to)h(the)g (binning)e(sp)s(eci\014cation)i(using)e(the)i(syn)m(tax)f([bin)g (@\014lename.txt].)39 b(The)22 b(\014le's)g(con)m(ten)m(ts)i(can)e(ex-) 0 1779 y(tend)h(o)m(v)m(er)i(m)m(ultiple)f(lines,)h(although)f(it)g(m)m (ust)f(still)h(conform)f(to)h(the)g(no-spaces)g(rule)f(for)g(the)h (min:max:binsize)0 1892 y(syn)m(tax)35 b(and)f(eac)m(h)h(axis)g(sp)s (eci\014cation)h(m)m(ust)e(still)h(b)s(e)f(comma-separated.)55 b(An)m(y)34 b(lines)h(in)f(the)h(external)g(text)0 2005 y(\014le)27 b(that)g(b)s(egin)g(with)f(2)i(slash)e(c)m(haracters)j (\('//'\))g(will)e(b)s(e)f(ignored)h(and)f(ma)m(y)i(b)s(e)e(used)g(to)i (add)e(commen)m(ts)i(in)m(to)0 2118 y(the)j(\014le.)0 2278 y(Examples:)191 2537 y Fe([bini)46 b(detx,)h(dety])762 b(-)47 b(2-D,)g(16-bit)f(integer)g(histogram)1861 2650 y(of)i(DETX)e(and)h(DETY)g(columns,)e(using)1861 2763 y(default)h(values)g(for)h(the)g(histogram)1861 2876 y(range)g(and)g(binsize)191 3102 y([bin)g(\(detx,)f(dety\)=16;)f (/exposure])g(-)i(2-D,)g(32-bit)f(real)h(histogram)e(of)i(DETX)1861 3215 y(and)g(DETY)g(columns)f(with)g(a)i(bin)f(size)f(=)i(16)1861 3328 y(in)g(both)e(axes.)h(The)f(histogram)g(values)1861 3441 y(are)h(divided)f(by)h(the)g(EXPOSURE)f(keyword)1861 3554 y(value.)191 3779 y([bin)h(time=TSTART:TSTOP:0.1])280 b(-)47 b(1-D)g(lightcurve,)e(range)h(determined)f(by)1861 3892 y(the)i(TSTART)f(and)h(TSTOP)g(keywords,)1861 4005 y(with)g(0.1)g(unit)g(size)f(bins.)191 4231 y([bin)h(pha,)f (time=8000.:8100.:0.1])90 b(-)47 b(2-D)g(image)g(using)f(default)g (binning)1861 4344 y(of)i(the)e(PHA)h(column)f(for)h(the)g(X)h(axis,) 1861 4457 y(and)f(1000)g(bins)g(in)g(the)g(range)1861 4570 y(8000.)g(to)g(8100.)f(for)h(the)g(Y)h(axis.)191 4796 y([bin)f(@binFilter.txt])616 b(-)47 b(Use)g(the)g(contents)f(of)h (the)g(text)f(file)1861 4909 y(binFilter.txt)f(for)h(the)h(binning)1861 5021 y(specifications.)p eop end %%Page: 155 163 TeXDict begin 155 162 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.155) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.11) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(11)0 1687 y Fm(T)-19 b(emplate)76 b(Files)0 2180 y Fj(When)38 b(a)h(new)f(FITS)g(\014le)h(is)g(created)g(with)g(a)f(call)i(to)g (\014ts)p 2101 2180 28 4 v 32 w(create)p 2369 2180 V 35 w(\014le,)g(the)f(name)g(of)g(a)g(template)h(\014le)e(ma)m(y)0 2293 y(b)s(e)h(supplied)g(in)h(paren)m(theses)g(immediately)h(follo)m (wing)g(the)g(name)f(of)g(the)g(new)f(\014le)h(to)h(b)s(e)e(created.)71 b(This)0 2406 y(template)27 b(is)e(used)g(to)h(de\014ne)f(the)h (structure)f(of)h(one)f(or)h(more)g(HDUs)g(in)f(the)h(new)f(\014le.)39 b(The)25 b(template)i(\014le)e(ma)m(y)0 2518 y(b)s(e)32 b(another)h(FITS)f(\014le,)i(in)f(whic)m(h)f(case)i(the)f(newly)g (created)h(\014le)f(will)g(ha)m(v)m(e)h(exactly)h(the)e(same)g(k)m(eyw) m(ords)g(in)0 2631 y(eac)m(h)25 b(HDU)g(as)g(in)f(the)g(template)i (FITS)d(\014le,)j(but)d(all)j(the)e(data)h(units)e(will)i(b)s(e)f (\014lled)g(with)f(zeros.)40 b(The)24 b(template)0 2744 y(\014le)i(ma)m(y)h(also)g(b)s(e)e(an)h(ASCI)s(I)e(text)j(\014le,)g (where)f(eac)m(h)h(line)f(\(in)g(general\))i(describ)s(es)d(one)h(FITS) f(k)m(eyw)m(ord)i(record.)0 2857 y(The)j(format)h(of)f(the)h(ASCI)s(I)e (template)i(\014le)g(is)f(describ)s(ed)f(in)i(the)f(follo)m(wing)i (sections.)0 3009 y SDict begin H.S end 0 3009 a 0 3009 a SDict begin 13.6 H.A end 0 3009 a 0 3009 a SDict begin [/View [/XYZ H.V]/Dest (section.11.1) cvn /DEST pdfmark end 0 3009 a 179 x Ff(11.1)136 b(Detailed)46 b(T)-11 b(emplate)46 b(Line)f(F)-11 b(ormat)0 3438 y Fj(The)30 b(format)h(of)f(eac)m(h)i (ASCI)s(I)c(template)k(line)f(closely)h(follo)m(ws)f(the)g(format)g(of) f(a)h(FITS)f(k)m(eyw)m(ord)g(record:)95 3682 y Fe(KEYWORD)46 b(=)i(KEYVALUE)d(/)j(COMMENT)0 3926 y Fj(except)22 b(that)g(free)g (format)f(ma)m(y)h(b)s(e)f(used)f(\(e.g.,)25 b(the)d(equals)f(sign)h (ma)m(y)f(app)s(ear)g(at)h(an)m(y)g(p)s(osition)f(in)g(the)h(line\))g (and)0 4039 y(T)-8 b(AB)34 b(c)m(haracters)g(are)g(allo)m(w)m(ed)h(and) e(are)g(treated)h(the)g(same)f(as)h(space)f(c)m(haracters.)51 b(The)33 b(KEYV)-10 b(ALUE)33 b(and)0 4152 y(COMMENT)d(\014elds)g(are)h (optional.)43 b(The)30 b(equals)h(sign)f(c)m(haracter)j(is)d(also)i (optional,)g(but)e(it)h(is)f(recommended)0 4264 y(that)42 b(it)f(b)s(e)g(included)f(for)h(clarit)m(y)-8 b(.)75 b(An)m(y)41 b(template)i(line)e(that)h(b)s(egins)f(with)f(the)i(p)s (ound)d('#')i(c)m(haracter)i(is)0 4377 y(ignored)30 b(b)m(y)h(the)f (template)i(parser)e(and)g(ma)m(y)h(b)s(e)e(use)h(to)h(insert)g(commen) m(ts)g(in)m(to)g(the)g(template)h(\014le)e(itself.)0 4538 y(The)c(KEYW)m(ORD)g(name)g(\014eld)g(is)g(limited)h(to)g(8)f(c)m (haracters)h(in)f(length)h(and)e(only)h(the)g(letters)i(A-Z,)e(digits)h (0-9,)0 4650 y(and)h(the)g(h)m(yphen)f(and)h(underscore)g(c)m (haracters)h(ma)m(y)g(b)s(e)f(used,)g(without)h(an)m(y)f(em)m(b)s (edded)g(spaces.)40 b(Lo)m(w)m(ercase)0 4763 y(letters)22 b(in)f(the)h(template)g(k)m(eyw)m(ord)g(name)f(will)g(b)s(e)g(con)m(v)m (erted)i(to)f(upp)s(ercase.)36 b(Leading)22 b(spaces)f(in)g(the)h (template)0 4876 y(line)k(preceding)g(the)f(k)m(eyw)m(ord)h(name)g(are) g(generally)h(ignored,)g(except)f(if)g(the)g(\014rst)f(8)h(c)m (haracters)h(of)f(a)g(template)0 4989 y(line)f(are)h(all)g(blank,)g (then)f(the)g(en)m(tire)h(line)g(is)f(treated)h(as)f(a)h(FITS)e(commen) m(t)i(k)m(eyw)m(ord)g(\(with)f(a)h(blank)e(k)m(eyw)m(ord)0 5102 y(name\))31 b(and)f(is)g(copied)h(v)m(erbatim)g(in)m(to)g(the)g (FITS)e(header.)0 5262 y(The)37 b(KEYV)-10 b(ALUE)37 b(\014eld)g(ma)m(y)h(ha)m(v)m(e)g(an)m(y)g(allo)m(w)m(ed)h(FITS)e(data) h(t)m(yp)s(e:)54 b(c)m(haracter)39 b(string,)h(logical,)h(in)m(teger,)0 5375 y(real,)28 b(complex)g(in)m(teger,)h(or)d(complex)i(real.)40 b(In)m(teger)28 b(v)-5 b(alues)27 b(m)m(ust)f(b)s(e)g(within)g(the)h (allo)m(w)m(ed)i(range)e(of)g(a)g('signed)0 5488 y(long')h(v)-5 b(ariable;)29 b(some)f(C)e(compilers)i(only)f(suppp)s(ort)e(4-b)m(yte)j (long)g(in)m(tegers)g(with)f(a)g(range)h(from)e(-2147483648)0 5601 y(to)31 b(+2147483647,)k(whereas)30 b(other)h(C)f(compilers)h (supp)s(ort)e(8-b)m(yte)j(in)m(tegers)f(with)f(a)h(range)g(of)g(plus)e (or)i(min)m(us)0 5714 y(2**63.)1882 5942 y(155)p eop end %%Page: 156 164 TeXDict begin 156 163 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.156) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(156)2250 b Fh(CHAPTER)29 b(11.)72 b(TEMPLA)-8 b(TE)30 b(FILES)0 555 y Fj(The)23 b(c)m(haracter)h(string)f(v)-5 b(alues)24 b(need)f(not)g(b)s(e)g(enclosed)g(in)g(single)h(quote)g(c)m(haracters)g (unless)f(they)g(are)h(necessary)0 668 y(to)37 b(distinguish)e(the)i (string)f(from)f(a)i(di\013eren)m(t)g(data)f(t)m(yp)s(e)h(\(e.g.)59 b(2.0)38 b(is)e(a)g(real)h(but)f('2.0')h(is)f(a)h(string\).)58 b(The)0 781 y(k)m(eyw)m(ord)38 b(has)g(an)g(unde\014ned)d(\(n)m(ull\))k (v)-5 b(alue)38 b(if)g(the)g(template)h(record)f(only)g(con)m(tains)h (blanks)e(follo)m(wing)j(the)0 894 y("=")31 b(or)f(b)s(et)m(w)m(een)h (the)g("=")g(and)f(the)g("/")i(commen)m(t)f(\014eld)f(delimiter.)0 1054 y(String)c(k)m(eyw)m(ord)h(v)-5 b(alues)27 b(longer)g(than)f(68)h (c)m(haracters)h(\(the)f(maxim)m(um)f(length)h(that)g(will)g(\014t)f (in)g(a)h(single)g(FITS)0 1167 y(k)m(eyw)m(ord)41 b(record\))g(are)g(p) s(ermitted)f(using)g(the)h(CFITSIO)e(long)i(string)g(con)m(v)m(en)m (tion.)74 b(They)40 b(can)h(either)g(b)s(e)0 1280 y(sp)s(eci\014ed)28 b(as)i(a)f(single)h(long)f(line)h(in)e(the)i(template,)h(or)e(b)m(y)f (using)h(m)m(ultiple)h(lines)f(where)f(the)i(con)m(tin)m(uing)g(lines)0 1393 y(con)m(tain)i(the)e('CONTINUE')g(k)m(eyw)m(ord,)h(as)g(in)f(this) g(example:)95 1657 y Fe(LONGKEY)46 b(=)i('This)e(is)h(a)h(long)e (string)g(value)h(that)f(is)i(contin&')95 1770 y(CONTINUE)94 b('ued)46 b(over)h(2)g(records')f(/)h(comment)f(field)h(goes)f(here)0 2035 y Fj(The)29 b(format)h(of)g(template)h(lines)e(with)h(CONTINUE)e (k)m(eyw)m(ord)i(is)g(v)m(ery)g(strict:)41 b(3)30 b(spaces)g(m)m(ust)f (follo)m(w)i(CON-)0 2147 y(TINUE)f(and)g(the)g(rest)h(of)f(the)h(line)g (is)f(copied)h(v)m(erbatim)g(to)g(the)g(FITS)e(\014le.)0 2308 y(The)i(start)h(of)g(the)f(optional)i(COMMENT)e(\014eld)g(m)m(ust) h(b)s(e)e(preceded)i(b)m(y)f("/",)i(whic)m(h)e(is)h(used)f(to)h (separate)g(it)0 2421 y(from)e(the)g(k)m(eyw)m(ord)h(v)-5 b(alue)30 b(\014eld.)41 b(Exceptions)30 b(are)h(if)f(the)h(KEYW)m(ORD)g (name)f(\014eld)g(con)m(tains)h(COMMENT,)0 2533 y(HISTOR)-8 b(Y,)30 b(CONTINUE,)g(or)g(if)g(the)h(\014rst)f(8)g(c)m(haracters)i(of) f(the)f(template)i(line)f(are)g(blanks.)0 2694 y(More)c(than)f(one)h (Header-Data)i(Unit)e(\(HDU\))g(ma)m(y)g(b)s(e)f(de\014ned)f(in)h(the)h (template)h(\014le.)39 b(The)26 b(start)h(of)g(an)f(HDU)0 2806 y(de\014nition)k(is)g(denoted)h(with)f(a)h(SIMPLE)e(or)i(XTENSION) e(template)j(line:)0 2967 y(1\))i(SIMPLE)f(b)s(egins)g(a)h(Primary)g (HDU)g(de\014nition.)50 b(SIMPLE)33 b(ma)m(y)h(only)g(app)s(ear)f(as)h (the)g(\014rst)f(k)m(eyw)m(ord)h(in)0 3080 y(the)e(template)i(\014le.) 45 b(If)32 b(the)g(template)i(\014le)e(b)s(egins)f(with)h(XTENSION)f (instead)h(of)g(SIMPLE,)g(then)f(a)i(default)0 3192 y(empt)m(y)d (Primary)e(HDU)i(is)g(created,)h(and)d(the)i(template)h(is)e(then)g (assumed)f(to)i(de\014ne)f(the)h(k)m(eyw)m(ords)f(starting)0 3305 y(with)h(the)h(\014rst)e(extension)i(follo)m(wing)h(the)f(Primary) f(HDU.)0 3466 y(2\))35 b(XTENSION)e(marks)g(the)i(b)s(eginning)e(of)h (a)h(new)e(extension)i(HDU)f(de\014nition.)52 b(The)33 b(previous)h(HDU)h(will)0 3578 y(b)s(e)30 b(closed)h(at)g(this)f(p)s (oin)m(t)h(and)e(pro)s(cessing)i(of)f(the)h(next)f(extension)h(b)s (egins.)0 3739 y SDict begin H.S end 0 3739 a 0 3739 a SDict begin 13.6 H.A end 0 3739 a 0 3739 a SDict begin [/View [/XYZ H.V]/Dest (section.11.2) cvn /DEST pdfmark end 0 3739 a 179 x Ff(11.2)136 b(Auto-indexing)45 b(of)g(Keyw)l(ords)0 4169 y Fj(If)31 b(a)h(template)g(k)m(eyw)m(ord)g(name)f(ends)g(with)g (a)g("#")h(c)m(haracter,)i(it)e(is)f(said)g(to)h(b)s(e)f ('auto-indexed'.)44 b(Eac)m(h)32 b("#")0 4282 y(c)m(haracter)i(will)f (b)s(e)f(replaced)i(b)m(y)e(the)h(curren)m(t)g(in)m(teger)h(index)e(v) -5 b(alue,)34 b(whic)m(h)f(gets)g(reset)h(=)e(1)h(at)h(the)e(start)i (of)0 4395 y(eac)m(h)h(new)f(HDU)g(in)g(the)g(\014le)g(\(or)g(7)h(in)e (the)h(sp)s(ecial)h(case)g(of)f(a)g(GR)m(OUP)h(de\014nition\).)51 b(The)33 b(FIRST)g(indexed)0 4508 y(k)m(eyw)m(ord)c(in)f(eac)m(h)h (template)h(HDU)f(de\014nition)f(is)g(used)f(as)i(the)f('incremen)m (tor';)j(eac)m(h)e(subsequen)m(t)f(o)s(ccurrence)0 4620 y(of)k(this)f(SAME)g(k)m(eyw)m(ord)h(will)g(cause)g(the)g(index)f(v)-5 b(alue)32 b(to)g(b)s(e)f(incremen)m(ted.)44 b(This)31 b(b)s(eha)m(vior)g(can)h(b)s(e)f(rather)0 4733 y(subtle,)d(as)g (illustrated)h(in)e(the)h(follo)m(wing)h(examples)f(in)f(whic)m(h)h (the)g(TTYPE)e(k)m(eyw)m(ord)i(is)g(the)g(incremen)m(tor)g(in)0 4846 y(b)s(oth)i(cases:)95 5111 y Fe(TTYPE#)47 b(=)g(TIME)95 5224 y(TFORM#)g(=)g(1D)95 5337 y(TTYPE#)g(=)g(RATE)95 5449 y(TFORM#)g(=)g(1E)0 5714 y Fj(will)26 b(create)i(TTYPE1,)e(TF)m (ORM1,)i(TTYPE2,)f(and)e(TF)m(ORM2)i(k)m(eyw)m(ords.)40 b(But)26 b(if)g(the)g(template)h(lo)s(oks)f(lik)m(e,)p eop end %%Page: 157 165 TeXDict begin 157 164 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.157) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(11.3.)73 b(TEMPLA)-8 b(TE)30 b(P)-8 b(ARSER)30 b(DIRECTIVES)1982 b Fj(157)95 555 y Fe(TTYPE#)47 b(=)g(TIME)95 668 y(TTYPE#)g(=)g(RATE)95 781 y(TFORM#)g(=)g(1D)95 894 y(TFORM#)g(=)g(1E)0 1202 y Fj(this)31 b(results)f(in)h(a)g(FITS)f(\014les)h(with)f(TTYPE1,)h (TTYPE2,)g(TF)m(ORM2,)h(and)e(TF)m(ORM2,)i(whic)m(h)f(is)g(probably)0 1315 y(not)g(what)f(w)m(as)h(in)m(tended!)0 1509 y SDict begin H.S end 0 1509 a 0 1509 a SDict begin 13.6 H.A end 0 1509 a 0 1509 a SDict begin [/View [/XYZ H.V]/Dest (section.11.3) cvn /DEST pdfmark end 0 1509 a 197 x Ff(11.3)136 b(T)-11 b(emplate)45 b(P)l(arser)h(Directiv)l(es)0 1968 y Fj(In)29 b(addition)i(to)f(the)g(template)i(lines)e(whic)m(h)g (de\014ne)f(individual)h(k)m(eyw)m(ords,)g(the)g(template)i(parser)d (recognizes)0 2081 y(3)h(sp)s(ecial)h(directiv)m(es)g(whic)m(h)f(are)g (eac)m(h)h(preceded)f(b)m(y)f(the)h(bac)m(kslash)h(c)m(haracter:)90 b Fe(\\include,)45 b(\\group)p Fj(,)29 b(and)48 2194 y Fe(\\end)p Fj(.)0 2354 y(The)37 b('include')h(directiv)m(e)i(m)m(ust) d(b)s(e)h(follo)m(w)m(ed)h(b)m(y)f(a)g(\014lename.)63 b(It)38 b(forces)g(the)g(parser)f(to)i(temp)s(orarily)f(stop)0 2467 y(reading)d(the)g(curren)m(t)g(template)h(\014le)f(and)f(b)s(egin) h(reading)g(the)g(include)f(\014le.)55 b(Once)35 b(the)g(parser)f(reac) m(hes)i(the)0 2579 y(end)f(of)h(the)g(include)f(\014le)h(it)g(con)m (tin)m(ues)g(parsing)g(the)f(curren)m(t)h(template)h(\014le.)56 b(Include)35 b(\014les)h(can)g(b)s(e)f(nested,)0 2692 y(and)30 b(HDU)h(de\014nitions)f(can)g(span)g(m)m(ultiple)h(template)h (\014les.)0 2853 y(The)f(start)h(of)g(a)g(GR)m(OUP)h(de\014nition)e(is) h(denoted)g(with)f(the)h('group')g(directiv)m(e,)h(and)f(the)f(end)h (of)f(a)i(GR)m(OUP)0 2965 y(de\014nition)k(is)h(denoted)f(with)g(the)h ('end')f(directiv)m(e.)63 b(Eac)m(h)39 b(GR)m(OUP)e(con)m(tains)i(0)f (or)f(more)h(mem)m(b)s(er)f(blo)s(c)m(ks)0 3078 y(\(HDUs)44 b(or)f(GR)m(OUPs\).)79 b(Mem)m(b)s(er)42 b(blo)s(c)m(ks)i(of)f(t)m(yp)s (e)g(GR)m(OUP)g(can)g(con)m(tain)h(their)f(o)m(wn)g(mem)m(b)s(er)f(blo) s(c)m(ks.)0 3191 y(The)32 b(GR)m(OUP)g(de\014nition)g(itself)h(o)s (ccupies)g(one)f(FITS)g(\014le)g(HDU)h(of)f(sp)s(ecial)h(t)m(yp)s(e)f (\(GR)m(OUP)h(HDU\),)h(so)e(if)h(a)0 3304 y(template)f(sp)s(eci\014es)e (1)h(group)e(with)h(1)h(mem)m(b)s(er)f(HDU)h(lik)m(e:)0 3613 y Fe(\\group)0 3725 y(grpdescr)46 b(=)h('demo')0 3838 y(xtension)f(bintable)0 3951 y(#)h(this)g(bintable)f(has)h(0)g (cols,)f(0)i(rows)0 4064 y(\\end)0 4373 y Fj(then)30 b(the)h(parser)e(creates)j(a)f(FITS)f(\014le)g(with)g(3)h(HDUs)g(:)0 4681 y Fe(1\))47 b(dummy)g(PHDU)0 4794 y(2\))g(GROUP)g(HDU)f(\(has)h(1) h(member,)d(which)i(is)g(bintable)e(in)j(HDU)f(number)f(3\))0 4907 y(3\))h(bintable)f(\(member)g(of)h(GROUP)f(in)h(HDU)g(number)f (2\))0 5215 y Fj(T)-8 b(ec)m(hnically)32 b(sp)s(eaking,)e(the)f(GR)m (OUP)i(HDU)f(is)g(a)g(BINT)-8 b(ABLE)30 b(with)g(6)g(columns.)40 b(Applications)31 b(can)f(de\014ne)0 5328 y(additional)23 b(columns)f(in)f(a)i(GR)m(OUP)f(HDU)h(using)f(TF)m(ORMn)f(and)h(TTYPEn) f(\(where)g(n)h(is)g(7,)i(8,)h(....\))39 b(k)m(eyw)m(ords)0 5441 y(or)30 b(their)h(auto-indexing)g(equiv)-5 b(alen)m(ts.)0 5601 y(F)d(or)26 b(a)f(more)g(complicated)h(example)f(of)g(a)h (template)g(\014le)f(using)f(the)h(group)f(directiv)m(es,)k(lo)s(ok)d (at)g(the)g(sample.tpl)0 5714 y(\014le)30 b(that)h(is)g(included)e(in)i (the)f(CFITSIO)f(distribution.)p eop end %%Page: 158 166 TeXDict begin 158 165 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.158) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(158)2250 b Fh(CHAPTER)29 b(11.)72 b(TEMPLA)-8 b(TE)30 b(FILES)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (section.11.4) cvn /DEST pdfmark end 0 464 a 91 x Ff(11.4)136 b(F)-11 b(ormal)45 b(T)-11 b(emplate)46 b(Syn)l(tax)0 805 y Fj(The)30 b(template)i(syn)m(tax)f(can)f(formally)h(b)s(e)f (de\014ned)f(as)i(follo)m(ws:)191 1063 y Fe(TEMPLATE)45 b(=)j(BLOCK)e([)i(BLOCK)e(...)h(])334 1289 y(BLOCK)f(=)i({)f(HDU)g(|)h (GROUP)e(})334 1515 y(GROUP)g(=)i(\\GROUP)e([)h(BLOCK)g(...)g(])g (\\END)430 1741 y(HDU)f(=)i(XTENSION)d([)j(LINE)f(...)f(])i({)f (XTENSION)f(|)h(\\GROUP)f(|)i(\\END)f(|)g(EOF)g(})382 1967 y(LINE)f(=)i([)f(KEYWORD)f([)i(=)f(])h(])f([)g(VALUE)g(])g([)h(/)f (COMMENT)f(])191 2192 y(X)h(...)238 b(-)48 b(X)f(can)g(be)g(present)f (1)h(or)h(more)e(times)191 2305 y({)h(X)h(|)f(Y)h(})f(-)h(X)f(or)g(Y) 191 2418 y([)g(X)h(])238 b(-)48 b(X)f(is)g(optional)0 2676 y Fj(A)m(t)34 b(the)f(topmost)g(lev)m(el,)i(the)e(template)i (de\014nes)c(1)j(or)e(more)h(template)h(blo)s(c)m(ks.)49 b(Blo)s(c)m(ks)34 b(can)f(b)s(e)f(either)h(HDU)0 2789 y(\(Header)27 b(Data)h(Unit\))g(or)e(a)h(GR)m(OUP)-8 b(.)28 b(F)-8 b(or)27 b(eac)m(h)g(blo)s(c)m(k)g(the)g(parser)f(creates) i(1)f(\(or)g(more)f(for)h(GR)m(OUPs\))g(FITS)0 2902 y(\014le)j(HDUs.)0 3039 y SDict begin H.S end 0 3039 a 0 3039 a SDict begin 13.6 H.A end 0 3039 a 0 3039 a SDict begin [/View [/XYZ H.V]/Dest (section.11.5) cvn /DEST pdfmark end 0 3039 a 196 x Ff(11.5)136 b(Errors)0 3485 y Fj(In)24 b(general)h(the)f(\014ts)p 692 3485 28 4 v 33 w(execute)p 1019 3485 V 34 w(template\(\))i (function)e(tries)h(to)g(b)s(e)f(as)g(atomic)i(as)f(p)s(ossible,)g(so)f (either)h(ev)m(erything)0 3598 y(is)f(done)g(or)g(nothing)f(is)h(done.) 39 b(If)23 b(an)h(error)f(o)s(ccurs)h(during)f(parsing)g(of)h(the)g (template,)j(\014ts)p 3125 3598 V 33 w(execute)p 3452 3598 V 34 w(template\(\))0 3711 y(will)k(\(try)g(to\))h(delete)g(the)f (top)g(lev)m(el)h(BLOCK)e(\(with)h(all)g(its)h(c)m(hildren)e(if)h(an)m (y\))g(in)g(whic)m(h)f(the)h(error)f(o)s(ccurred,)0 3824 y(then)g(it)h(will)g(stop)f(reading)h(the)f(template)i(\014le)e(and)g (it)h(will)g(return)e(with)h(an)g(error.)0 3979 y SDict begin H.S end 0 3979 a 0 3979 a SDict begin 13.6 H.A end 0 3979 a 0 3979 a SDict begin [/View [/XYZ H.V]/Dest (section.11.6) cvn /DEST pdfmark end 0 3979 a 179 x Ff(11.6)136 b(Examples)0 4408 y Fj(1.)54 b(This)34 b(template)i(\014le)f(will)g (create)h(a)f(200)h(x)e(300)i(pixel)f(image,)j(with)c(4-b)m(yte)i(in)m (teger)g(pixel)f(v)-5 b(alues,)36 b(in)f(the)0 4521 y(primary)29 b(HDU:)95 4779 y Fe(SIMPLE)47 b(=)g(T)95 4891 y(BITPIX)g(=)g(32)95 5004 y(NAXIS)g(=)g(2)239 b(/)47 b(number)f(of)h(dimensions)95 5117 y(NAXIS1)g(=)g(100)95 b(/)47 b(length)f(of)h(first)g(axis)95 5230 y(NAXIS2)g(=)g(200)95 b(/)47 b(length)f(of)h(second)f(axis)95 5343 y(OBJECT)h(=)g(NGC)g(253)g(/)g(name)g(of)g(observed)f(object)0 5601 y Fj(The)35 b(allo)m(w)m(ed)i(v)-5 b(alues)36 b(of)f(BITPIX)g(are) h(8,)h(16,)h(32,)g(-32,)g(or)d(-64,)j(represen)m(ting,)f(resp)s(ectiv)m (ely)-8 b(,)39 b(8-bit)d(in)m(teger,)0 5714 y(16-bit)c(in)m(teger,)g (32-bit)f(in)m(teger,)h(32-bit)g(\015oating)f(p)s(oin)m(t,)g(or)f(64)h (bit)g(\015oating)g(p)s(oin)m(t)f(pixels.)p eop end %%Page: 159 167 TeXDict begin 159 166 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.159) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(11.6.)73 b(EXAMPLES)2993 b Fj(159)0 555 y(2.)39 b(T)-8 b(o)23 b(create)h(a)f(FITS)e(table,)26 b(the)c(template)i(\014rst)e(needs)g (to)i(include)e(XTENSION)g(=)g(T)-8 b(ABLE)23 b(or)f(BINT)-8 b(ABLE)0 668 y(to)31 b(de\014ne)e(whether)g(it)h(is)g(an)f(ASCI)s(I)g (or)g(binary)g(table,)i(and)f(NAXIS2)g(to)g(de\014ne)f(the)h(n)m(um)m (b)s(er)f(of)h(ro)m(ws)f(in)h(the)0 781 y(table.)50 b(Tw)m(o)34 b(template)g(lines)g(are)g(then)f(needed)f(to)i(de\014ne)f(the)g(name)h (\(TTYPEn\))e(and)h(FITS)g(data)h(format)0 894 y(\(TF)m(ORMn\))d(of)f (the)h(columns,)f(as)h(in)f(this)g(example:)95 1154 y Fe(xtension)46 b(=)h(bintable)95 1267 y(naxis2)g(=)g(40)95 1380 y(ttype#)g(=)g(Name)95 1492 y(tform#)g(=)g(10a)95 1605 y(ttype#)g(=)g(Npoints)95 1718 y(tform#)g(=)g(j)95 1831 y(ttype#)g(=)g(Rate)95 1944 y(tunit#)g(=)g(counts/s)95 2057 y(tform#)g(=)g(e)0 2317 y Fj(The)26 b(ab)s(o)m(v)m(e)j(example)e (de\014nes)f(a)i(n)m(ull)f(primary)f(arra)m(y)h(follo)m(w)m(ed)i(b)m(y) e(a)g(40-ro)m(w)h(binary)e(table)i(extension)g(with)f(3)0 2430 y(columns)h(called)h('Name',)h('Np)s(oin)m(ts',)f(and)f('Rate',)i (with)e(data)h(formats)f(of)g('10A')i(\(ASCI)s(I)d(c)m(haracter)i (string\),)0 2543 y('1J')k(\(in)m(teger\))i(and)d('1E')i(\(\015oating)f (p)s(oin)m(t\),)h(resp)s(ectiv)m(ely)-8 b(.)50 b(Note)34 b(that)f(the)g(other)g(required)f(FITS)g(k)m(eyw)m(ords)0 2655 y(\(BITPIX,)37 b(NAXIS,)g(NAXIS1,)h(PCOUNT,)e(GCOUNT,)h(TFIELDS,)f (and)g(END\))h(do)g(not)g(need)f(to)h(b)s(e)f(ex-)0 2768 y(plicitly)j(de\014ned)d(in)i(the)f(template)i(b)s(ecause)f(their)g(v) -5 b(alues)38 b(can)g(b)s(e)f(inferred)f(from)i(the)f(other)h(k)m(eyw)m (ords)g(in)0 2881 y(the)d(template.)55 b(This)34 b(example)i(also)g (illustrates)f(that)h(the)f(templates)h(are)f(generally)h (case-insensitiv)m(e)h(\(the)0 2994 y(k)m(eyw)m(ord)29 b(names)g(and)g(TF)m(ORMn)f(v)-5 b(alues)30 b(are)f(con)m(v)m(erted)i (to)e(upp)s(er-case)g(in)f(the)h(FITS)g(\014le\))g(and)f(that)i(string) 0 3107 y(k)m(eyw)m(ord)h(v)-5 b(alues)31 b(generally)g(do)f(not)h(need) f(to)h(b)s(e)f(enclosed)h(in)f(quotes.)p eop end %%Page: 160 168 TeXDict begin 160 167 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.160) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(160)2250 b Fh(CHAPTER)29 b(11.)72 b(TEMPLA)-8 b(TE)30 b(FILES)p eop end %%Page: 161 169 TeXDict begin 161 168 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.161) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.12) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(12)0 1687 y Fm(Lo)6 b(cal)78 b(FITS)e(Con)-6 b(v)g(en)g(tions)0 2180 y Fj(CFITSIO)29 b(supp)s(orts)g(sev)m(eral)j(lo)s(cal)g(FITS)e (con)m(v)m(en)m(tions)i(whic)m(h)f(are)g(not)g(de\014ned)e(in)i(the)f (o\016cial)j(FITS)d(stan-)0 2293 y(dard)43 b(and)g(whic)m(h)g(are)h (not)g(necessarily)g(recognized)h(or)f(supp)s(orted)e(b)m(y)h(other)h (FITS)f(soft)m(w)m(are)i(pac)m(k)-5 b(ages.)0 2406 y(Programmers)36 b(should)f(b)s(e)g(cautious)i(ab)s(out)e(using)h(these)g(features,)i (esp)s(ecially)f(if)f(the)g(FITS)f(\014les)h(that)h(are)0 2518 y(pro)s(duced)31 b(are)i(exp)s(ected)g(to)g(b)s(e)f(pro)s(cessed)g (b)m(y)h(other)f(soft)m(w)m(are)i(systems)f(whic)m(h)f(do)h(not)f(use)h (the)f(CFITSIO)0 2631 y(in)m(terface.)0 2794 y SDict begin H.S end 0 2794 a 0 2794 a SDict begin 13.6 H.A end 0 2794 a 0 2794 a SDict begin [/View [/XYZ H.V]/Dest (section.12.1) cvn /DEST pdfmark end 0 2794 a 196 x Ff(12.1)136 b(64-Bit)45 b(Long)g(In)l(tegers)0 3246 y Fj(CFITSIO)37 b(supp)s(orts)g(reading)i(and)f(writing)h(FITS)f(images)i(or)f(table)h (columns)e(con)m(taining)i(64-bit)h(in)m(teger)0 3359 y(data)26 b(v)-5 b(alues.)40 b(Supp)s(ort)23 b(for)i(64-bit)i(in)m (tegers)g(w)m(as)f(added)e(to)j(the)e(o\016cial)i(FITS)e(Standard)f(in) i(Decem)m(b)s(er)g(2005.)0 3472 y(FITS)g(64-bit)i(images)g(ha)m(v)m(e)g (BITPIX)e(=)h(64,)h(and)e(the)h(64-bit)h(binary)e(table)i(columns)f(ha) m(v)m(e)h(TF)m(ORMn)e(=)h('K'.)0 3584 y(CFITSIO)35 b(also)i(supp)s (orts)e(the)i('Q')f(v)-5 b(ariable-length)38 b(arra)m(y)f(table)h (column)e(format)h(whic)m(h)f(is)g(analogous)i(to)0 3697 y(the)31 b('P')f(column)g(format)h(except)g(that)g(the)g(arra)m(y)g (descriptor)f(is)h(stored)f(as)h(a)f(pair)h(of)f(64-bit)i(in)m(tegers.) 0 3858 y(F)-8 b(or)33 b(the)f(con)m(v)m(enience)i(of)f(C)e (programmers,)h(the)h(\014tsio.h)f(include)g(\014le)g(de\014nes)f (\(with)h(a)h(t)m(yp)s(edef)f(statemen)m(t\))0 3970 y(the)39 b('LONGLONG')g(datat)m(yp)s(e)h(to)f(b)s(e)f(equiv)-5 b(alen)m(t)40 b(to)f(an)g(appropriate)g(64-bit)h(in)m(teger)g(datat)m (yp)s(e)f(on)g(eac)m(h)0 4083 y(platform.)g(Since)27 b(there)f(is)g(curren)m(tly)g(no)g(univ)m(ersal)h(standard)e(for)h(the) g(name)g(of)h(the)f(64-bit)h(in)m(teger)h(datat)m(yp)s(e)0 4196 y(\(it)33 b(migh)m(t)f(b)s(e)f(de\014ned)g(as)h('long)g(long',)i ('long',)f(or)f(')p 1832 4196 28 4 v 1865 4196 V 66 w(in)m(t64')h(dep)s (ending)d(on)i(the)g(platform\))g(C)g(programmers)0 4309 y(ma)m(y)24 b(prefer)f(to)i(use)e(the)h('LONGLONG')h(datat)m(yp)s(e)f (when)f(declaring)i(or)e(allo)s(cating)j(64-bit)f(in)m(teger)h(quan)m (tities)0 4422 y(when)33 b(writing)h(co)s(de)g(whic)m(h)f(needs)h(to)h (run)d(on)i(m)m(ultiple)g(platforms.)52 b(Note)35 b(that)f(CFITSIO)f (will)h(implicitly)0 4535 y(con)m(v)m(ert)h(the)e(datat)m(yp)s(e)h (when)f(reading)g(or)g(writing)h(FITS)e(64-bit)j(in)m(teger)f(images)h (and)d(columns)h(with)g(data)0 4648 y(arra)m(ys)40 b(of)h(a)f (di\013eren)m(t)h(in)m(teger)g(or)f(\015oating)h(p)s(oin)m(t)f(datat)m (yp)s(e,)k(but)c(there)g(is)g(an)g(increased)g(risk)g(of)g(loss)h(of)0 4761 y(n)m(umerical)31 b(precision)f(or)h(n)m(umerical)g(o)m(v)m (er\015o)m(w)h(in)e(this)g(case.)0 4941 y SDict begin H.S end 0 4941 a 0 4941 a SDict begin 13.6 H.A end 0 4941 a 0 4941 a SDict begin [/View [/XYZ H.V]/Dest (section.12.2) cvn /DEST pdfmark end 0 4941 a 179 x Ff(12.2)136 b(Long)44 b(String)i(Keyw)l(ord)f(V)-11 b(alues.)0 5375 y Fj(The)43 b(length)i(of)f(a)g(standard)g(FITS)f(string)h(k)m(eyw)m(ord)g(is)g (limited)h(to)g(68)f(c)m(haracters)i(b)s(ecause)e(it)g(m)m(ust)g(\014t) 0 5488 y(en)m(tirely)35 b(within)e(a)h(single)h(FITS)e(header)g(k)m (eyw)m(ord)i(record.)50 b(In)33 b(some)i(instances)f(it)g(is)g (necessary)g(to)h(enco)s(de)0 5601 y(strings)29 b(longer)i(than)e(this) g(limit,)i(so)f(CFITSIO)e(supp)s(orts)g(a)h(lo)s(cal)i(con)m(v)m(en)m (tion)h(in)d(whic)m(h)h(the)f(string)h(v)-5 b(alue)30 b(is)0 5714 y(con)m(tin)m(ued)36 b(o)m(v)m(er)g(m)m(ultiple)f(k)m(eyw)m (ords.)55 b(This)34 b(con)m(tin)m(uation)i(con)m(v)m(en)m(tion)h(uses)e (an)f(amp)s(ersand)g(c)m(haracter)i(at)1882 5942 y(161)p eop end %%Page: 162 170 TeXDict begin 162 169 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.162) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(162)1741 b Fh(CHAPTER)30 b(12.)112 b(LOCAL)29 b(FITS)h(CONVENTIONS)0 555 y Fj(the)c(end)f(of)h(eac)m(h)g(substring)f(to)h(indicate)h(that)f (it)h(is)e(con)m(tin)m(ued)i(on)e(the)h(next)g(k)m(eyw)m(ord,)h(and)e (the)h(con)m(tin)m(uation)0 668 y(k)m(eyw)m(ords)40 b(all)h(ha)m(v)m(e) g(the)f(name)g(CONTINUE)f(without)h(an)g(equal)g(sign)g(in)g(column)g (9.)69 b(The)40 b(string)f(v)-5 b(alue)0 781 y(ma)m(y)33 b(b)s(e)f(con)m(tin)m(ued)h(in)g(this)f(w)m(a)m(y)h(o)m(v)m(er)h(as)f (man)m(y)g(additional)g(CONTINUE)f(k)m(eyw)m(ords)h(as)f(is)h (required.)46 b(The)0 894 y(follo)m(wing)37 b(lines)e(illustrate)h (this)f(con)m(tin)m(uation)i(con)m(v)m(en)m(tion)h(whic)m(h)c(is)i (used)e(in)h(the)g(v)-5 b(alue)36 b(of)f(the)g(STRKEY)0 1007 y(k)m(eyw)m(ord:)0 1297 y Fe(LONGSTRN=)45 b('OGIP)i(1.0')189 b(/)48 b(The)f(OGIP)f(Long)h(String)f(Convention)f(may)i(be)g(used.)0 1410 y(STRKEY)94 b(=)47 b('This)g(is)g(a)g(very)g(long)g(string)f (keyword&')93 b(/)47 b(Optional)f(Comment)0 1523 y(CONTINUE)93 b(')48 b(value)e(that)h(is)g(continued)e(over)i(3)g(keywords)f(in)h (the)g(&)95 b(')0 1636 y(CONTINUE)e('FITS)47 b(header.')e(/)j(This)e (is)h(another)f(optional)g(comment.)0 1926 y Fj(It)29 b(is)g(recommended)f(that)h(the)g(LONGSTRN)f(k)m(eyw)m(ord,)i(as)f(sho) m(wn)f(here,)h(alw)m(a)m(ys)i(b)s(e)d(included)g(in)g(an)m(y)h(HDU)0 2039 y(that)i(uses)f(this)g(longstring)h(con)m(v)m(en)m(tion)i(as)e(a)f (w)m(arning)h(to)g(an)m(y)g(soft)m(w)m(are)g(that)g(m)m(ust)g(read)f (the)h(k)m(eyw)m(ords.)41 b(A)0 2152 y(routine)d(called)g(\014ts)p 712 2152 28 4 v 33 w(write)p 947 2152 V 33 w(k)m(ey)p 1113 2152 V 33 w(longw)m(arn)g(has)f(b)s(een)g(pro)m(vided)g(in)h (CFITSIO)d(to)k(write)e(this)h(k)m(eyw)m(ord)g(if)f(it)0 2265 y(do)s(es)30 b(not)h(already)g(exist.)0 2425 y(This)f(long)h (string)f(con)m(v)m(en)m(tion)i(is)f(supp)s(orted)d(b)m(y)j(the)f (follo)m(wing)i(CFITSIO)d(routines:)191 2716 y Fe (fits_write_key_longstr)89 b(-)48 b(write)e(a)i(long)e(string)g (keyword)g(value)191 2829 y(fits_insert_key_longstr)41 b(-)48 b(insert)e(a)h(long)g(string)f(keyword)g(value)191 2942 y(fits_modify_key_longstr)41 b(-)48 b(modify)e(a)h(long)g(string)f (keyword)g(value)191 3054 y(fits_update_key_longstr)41 b(-)48 b(modify)e(a)h(long)g(string)f(keyword)g(value)191 3167 y(fits_read_key_longstr)137 b(-)48 b(read)94 b(a)48 b(long)e(string)g(keyword)g(value)191 3280 y(fits_delete_key)425 b(-)48 b(delete)e(a)h(keyword)0 3571 y Fj(The)36 b(\014ts)p 320 3571 V 32 w(read)p 524 3571 V 33 w(k)m(ey)p 690 3571 V 34 w(longstr)g(routine)h(is)f(unique)f(among)i(all)h(the)e(CFITSIO)f (routines)h(in)g(that)h(it)g(in)m(ternally)0 3684 y(allo)s(cates)f (memory)d(for)h(the)f(long)h(string)g(v)-5 b(alue;)36 b(all)e(the)g(other)g(CFITSIO)e(routines)h(that)h(deal)g(with)g(arra)m (ys)0 3797 y(require)39 b(that)h(the)g(calling)h(program)e(pre-allo)s (cate)j(adequate)e(space)g(to)g(hold)f(the)h(arra)m(y)g(of)f(data.)69 b(Conse-)0 3909 y(quen)m(tly)-8 b(,)31 b(programs)f(whic)m(h)g(use)g (the)g(\014ts)p 1443 3909 V 32 w(read)p 1647 3909 V 33 w(k)m(ey)p 1813 3909 V 34 w(longstr)g(routine)g(m)m(ust)g(b)s(e)g (careful)g(to)h(free)g(the)f(allo)s(cated)0 4022 y(memory)g(for)g(the)h (string)f(when)g(it)h(is)f(no)g(longer)h(needed.)0 4183 y(The)f(follo)m(wing)i(2)e(routines)h(also)g(ha)m(v)m(e)h(limited)f (supp)s(ort)d(for)i(this)h(long)g(string)f(con)m(v)m(en)m(tion,)286 4473 y Fe(fits_modify_key_str)43 b(-)k(modify)f(an)i(existing)d(string) h(keyword)g(value)286 4586 y(fits_update_key_str)d(-)k(update)f(a)i (string)e(keyword)g(value)0 4876 y Fj(in)24 b(that)h(they)f(will)h (correctly)g(o)m(v)m(erwrite)h(an)e(existing)h(long)g(string)f(v)-5 b(alue,)27 b(but)c(the)h(new)g(string)g(v)-5 b(alue)25 b(is)f(limited)0 4989 y(to)31 b(a)g(maxim)m(um)f(of)h(68)g(c)m (haracters)h(in)e(length.)0 5149 y(The)f(more)h(commonly)h(used)e (CFITSIO)f(routines)i(to)g(write)g(string)g(v)-5 b(alued)30 b(k)m(eyw)m(ords)g(\(\014ts)p 3254 5149 V 33 w(up)s(date)p 3563 5149 V 32 w(k)m(ey)h(and)0 5262 y(\014ts)p 127 5262 V 32 w(write)p 361 5262 V 33 w(k)m(ey\))j(do)e(not)h(supp)s(ort)d(this) i(long)h(string)g(con)m(v)m(en)m(tion)h(and)e(only)g(supp)s(ort)f (strings)h(up)f(to)i(68)g(c)m(har-)0 5375 y(acters)g(in)f(length.)48 b(This)31 b(has)h(b)s(een)g(done)g(delib)s(erately)h(to)g(prev)m(en)m (t)g(programs)f(from)g(inadv)m(erten)m(tly)i(writing)0 5488 y(k)m(eyw)m(ords)25 b(using)f(this)h(non-standard)e(con)m(v)m(en)m (tion)k(without)e(the)g(explicit)h(in)m(ten)m(t)g(of)f(the)f (programmer)h(or)f(user.)0 5601 y(The)36 b(\014ts)p 320 5601 V 32 w(write)p 554 5601 V 33 w(k)m(ey)p 720 5601 V 34 w(longstr)h(routine)f(m)m(ust)h(b)s(e)f(called)i(instead)e(to)i (write)e(long)h(strings.)59 b(This)36 b(routine)h(can)0 5714 y(also)31 b(b)s(e)f(used)g(to)h(write)f(ordinary)g(string)g(v)-5 b(alues)31 b(less)g(than)f(68)h(c)m(haracters)h(in)e(length.)p eop end %%Page: 163 171 TeXDict begin 163 170 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.163) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(12.3.)73 b(ARRA)-8 b(YS)30 b(OF)h(FIXED-LENGTH)g(STRINGS)e(IN)h(BINAR)-8 b(Y)32 b(T)-8 b(ABLES)871 b Fj(163)0 464 y SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (section.12.3) cvn /DEST pdfmark end 0 464 a 91 x Ff(12.3)136 b(Arra)l(ys)45 b(of)g(Fixed-Length)g(Strings)g(in)g(Binary)f(T)-11 b(ables)0 807 y Fj(CFITSIO)25 b(supp)s(orts)g(2)i(w)m(a)m(ys)g(to)g(sp)s(ecify)f (that)i(a)f(c)m(haracter)h(column)e(in)g(a)h(binary)f(table)i(con)m (tains)f(an)g(arra)m(y)g(of)0 920 y(\014xed-length)32 b(strings.)46 b(The)32 b(\014rst)f(w)m(a)m(y)-8 b(,)34 b(whic)m(h)e(is)g(o\016cially)i(supp)s(orted)c(b)m(y)i(the)h(FITS)e (Standard)g(do)s(cumen)m(t,)0 1033 y(uses)38 b(the)g(TDIMn)g(k)m(eyw)m (ord.)65 b(F)-8 b(or)39 b(example,)i(if)d(TF)m(ORMn)g(=)g('60A')h(and)f (TDIMn)g(=)g('\(12,5\)')i(then)e(that)0 1146 y(column)30 b(will)h(b)s(e)f(in)m(terpreted)g(as)h(con)m(taining)h(an)e(arra)m(y)h (of)g(5)f(strings,)h(eac)m(h)g(12)g(c)m(haracters)h(long.)0 1306 y(CFITSIO)j(also)j(supp)s(orts)c(a)j(lo)s(cal)h(con)m(v)m(en)m (tion)h(for)d(the)h(format)g(of)g(the)f(TF)m(ORMn)h(k)m(eyw)m(ord)g(v) -5 b(alue)37 b(of)g(the)0 1419 y(form)42 b('rAw')g(where)g('r')g(is)h (an)f(in)m(teger)i(sp)s(ecifying)e(the)g(total)j(width)c(in)h(c)m (haracters)i(of)f(the)f(column,)k(and)0 1532 y('w')36 b(is)g(an)g(in)m(teger)h(sp)s(ecifying)f(the)g(\(\014xed\))g(length)h (of)f(an)g(individual)f(unit)h(string)f(within)h(the)g(v)m(ector.)59 b(F)-8 b(or)0 1644 y(example,)29 b(TF)m(ORM1)f(=)f('120A10')j(w)m(ould) d(indicate)h(that)g(the)f(binary)g(table)h(column)f(is)g(120)i(c)m (haracters)f(wide)0 1757 y(and)42 b(consists)h(of)f(12)h(10-c)m (haracter)i(length)e(strings.)77 b(This)41 b(con)m(v)m(en)m(tion)k(is)d (recognized)i(b)m(y)e(the)g(CFITSIO)0 1870 y(routines)26 b(that)h(read)e(or)h(write)h(strings)e(in)h(binary)f(tables.)40 b(The)26 b(Binary)g(T)-8 b(able)27 b(de\014nition)e(do)s(cumen)m(t)h (sp)s(eci\014es)0 1983 y(that)i(other)f(optional)h(c)m(haracters)h(ma)m (y)e(follo)m(w)i(the)e(data)h(t)m(yp)s(e)f(co)s(de)g(in)g(the)g(TF)m (ORM)h(k)m(eyw)m(ord,)g(so)g(this)f(lo)s(cal)0 2096 y(con)m(v)m(en)m (tion)f(is)d(in)h(compliance)h(with)e(the)h(FITS)e(standard)h(although) h(other)g(FITS)f(readers)g(ma)m(y)h(not)g(recognize)0 2209 y(this)30 b(con)m(v)m(en)m(tion.)0 2353 y SDict begin H.S end 0 2353 a 0 2353 a SDict begin 13.6 H.A end 0 2353 a 0 2353 a SDict begin [/View [/XYZ H.V]/Dest (section.12.4) cvn /DEST pdfmark end 0 2353 a 197 x Ff(12.4)136 b(Keyw)l(ord)45 b(Units)h(Strings)0 2801 y Fj(One)37 b(limitation)j(of)d(the)h(curren)m(t)g(FITS)e(Standard)h(is)h(that)g (it)g(do)s(es)f(not)h(de\014ne)f(a)h(sp)s(eci\014c)f(con)m(v)m(en)m (tion)j(for)0 2914 y(recording)30 b(the)g(ph)m(ysical)h(units)f(of)g(a) g(k)m(eyw)m(ord)h(v)-5 b(alue.)41 b(The)30 b(TUNITn)f(k)m(eyw)m(ord)h (can)g(b)s(e)g(used)f(to)i(sp)s(ecify)f(the)0 3027 y(ph)m(ysical)36 b(units)f(of)g(the)h(v)-5 b(alues)36 b(in)f(a)g(table)i(column,)f(but)f (there)g(is)h(no)f(analogous)i(con)m(v)m(en)m(tion)g(for)e(k)m(eyw)m (ord)0 3140 y(v)-5 b(alues.)42 b(The)30 b(commen)m(t)h(\014eld)g(of)f (the)h(k)m(eyw)m(ord)g(is)g(often)g(used)f(for)g(this)g(purp)s(ose,)g (but)f(the)i(units)f(are)h(usually)0 3253 y(not)g(sp)s(eci\014ed)e(in)h (a)h(w)m(ell)g(de\014ned)f(format)g(that)h(FITS)f(readers)g(can)h (easily)g(recognize)h(and)e(extract.)0 3413 y(T)-8 b(o)27 b(solv)m(e)i(this)d(problem,)i(CFITSIO)d(uses)i(a)g(lo)s(cal)h(con)m(v) m(en)m(tion)h(in)e(whic)m(h)f(the)i(k)m(eyw)m(ord)f(units)f(are)i (enclosed)f(in)0 3526 y(square)20 b(brac)m(k)m(ets)j(as)e(the)f (\014rst)g(tok)m(en)i(in)f(the)f(k)m(eyw)m(ord)i(commen)m(t)f(\014eld;) j(more)d(sp)s(eci\014cally)-8 b(,)24 b(the)d(op)s(ening)f(square)0 3639 y(brac)m(k)m(et)28 b(immediately)g(follo)m(ws)f(the)g(slash)f('/') h(commen)m(t)h(\014eld)e(delimiter)h(and)f(a)g(single)h(space)g(c)m (haracter.)41 b(The)0 3752 y(follo)m(wing)32 b(examples)f(illustrate)g (k)m(eyw)m(ords)g(that)g(use)f(this)g(con)m(v)m(en)m(tion:)0 4018 y Fe(EXPOSURE=)713 b(1800.0)47 b(/)g([s])g(elapsed)f(exposure)f (time)0 4131 y(V_HELIO)h(=)763 b(16.23)47 b(/)g([km)g(s**\(-1\)])e (heliocentric)g(velocity)0 4244 y(LAMBDA)94 b(=)763 b(5400.)47 b(/)g([angstrom])e(central)h(wavelength)0 4357 y(FLUX)190 b(=)47 b(4.9033487787637465E-30)42 b(/)47 b([J/cm**2/s])e(average)h (flux)0 4622 y Fj(In)28 b(general,)h(the)g(units)e(named)h(in)g(the)h (IA)m(U\(1988\))i(St)m(yle)e(Guide)f(are)h(recommended,)f(with)g(the)h (main)f(excep-)0 4735 y(tion)j(that)g(the)f(preferred)g(unit)f(for)i (angle)g(is)f('deg')i(for)e(degrees.)0 4896 y(The)38 b(\014ts)p 322 4896 28 4 v 33 w(read)p 527 4896 V 33 w(k)m(ey)p 693 4896 V 33 w(unit)h(and)f(\014ts)p 1234 4896 V 32 w(write)p 1468 4896 V 33 w(k)m(ey)p 1634 4896 V 34 w(unit)g(routines)h(in)g(CFITSIO)e(read)i(and)f(write,)k(resp)s (ectiv)m(ely)-8 b(,)0 5008 y(the)31 b(k)m(eyw)m(ord)f(unit)g(strings)h (in)f(an)g(existing)h(k)m(eyw)m(ord.)0 5170 y SDict begin H.S end 0 5170 a 0 5170 a SDict begin 13.6 H.A end 0 5170 a 0 5170 a SDict begin [/View [/XYZ H.V]/Dest (section.12.5) cvn /DEST pdfmark end 0 5170 a 179 x Ff(12.5)136 b(HIERAR)l(CH)46 b(Con)l(v)l(en)l(tion)g(for)f(Extended)h(Keyw)l(ord)f (Names)0 5601 y Fj(CFITSIO)c(supp)s(orts)g(the)i(HIERAR)m(CH)g(k)m(eyw) m(ord)g(con)m(v)m(en)m(tion)i(whic)m(h)e(allo)m(ws)h(k)m(eyw)m(ord)f (names)g(that)h(are)0 5714 y(longer)35 b(than)f(8)h(c)m(haracters.)54 b(This)34 b(con)m(v)m(en)m(tion)i(w)m(as)f(dev)m(elop)s(ed)g(at)g(the)g (Europ)s(ean)e(Southern)g(Observ)-5 b(atory)p eop end %%Page: 164 172 TeXDict begin 164 171 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.164) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(164)1741 b Fh(CHAPTER)30 b(12.)112 b(LOCAL)29 b(FITS)h(CONVENTIONS)0 555 y Fj(\(ESO\))k(and)g(allo)m(ws)h(c)m(haracters)h(consisting)f(of)f (digits)h(0-9,)i(upp)s(er)32 b(case)j(letters)h(A-Z,)e(the)h(dash)e ('-')i(and)f(the)0 668 y(underscore)j(')p 493 668 28 4 v 33 w('.)63 b(The)37 b(comp)s(onen)m(ts)h(of)g(hierarc)m(hical)h(k)m (eyw)m(ords)f(are)g(separated)g(b)m(y)g(a)g(single)g(ASCI)s(I)e(space)0 781 y(c)m(harater.)42 b(F)-8 b(or)31 b(instance:)0 1038 y Fe(HIERARCH)46 b(ESO)g(INS)h(FOCU)g(POS)g(=)g(-0.00002500)e(/)j (Focus)e(position)0 1295 y Fj(Basically)-8 b(,)42 b(this)c(con)m(v)m (en)m(tion)h(uses)f(the)f(FITS)g(k)m(eyw)m(ord)h('HIERAR)m(CH')g(to)h (indicate)f(that)g(this)g(con)m(v)m(en)m(tion)0 1408 y(is)j(b)s(eing)f(used,)j(then)d(the)h(actual)h(k)m(eyw)m(ord)f(name)g (\()p Fe('ESO)47 b(INS)g(FOCU)g(POS')39 b Fj(in)i(this)f(example\))i(b) s(egins)e(in)0 1521 y(column)h(10.)74 b(The)41 b(equals)g(sign)g(marks) g(the)g(end)g(of)g(the)h(k)m(eyw)m(ord)f(name)g(and)g(is)g(follo)m(w)m (ed)i(b)m(y)e(the)g(usual)0 1634 y(v)-5 b(alue)37 b(and)e(commen)m(t)j (\014elds)e(just)f(as)i(in)f(standard)f(FITS)h(k)m(eyw)m(ords.)59 b(F)-8 b(urther)36 b(details)h(of)g(this)f(con)m(v)m(en)m(tion)0 1747 y(are)30 b(describ)s(ed)f(at)i(h)m(ttp://\014ts.gsfc.nasa.go)m (v/registry/hierarc)m(h)p 2323 1747 V 38 w(k)m(eyw)m(ord.h)m(tml)g(and) f(in)g(Section)g(4.4)i(of)e(the)0 1859 y(ESO)40 b(Data)i(In)m(terface)g (Con)m(trol)g(Do)s(cumen)m(t)g(that)f(is)g(link)m(ed)g(to)h(from)e(h)m (ttp://arc)m(hiv)m(e.eso.org/cms/to)t(ols-)0 1972 y(do)s(cumen)m (tation/eso-data-in)m(terface-con)m(t)q(rol.h)m(tml.)0 2133 y(This)32 b(con)m(v)m(en)m(tion)i(allo)m(ws)g(a)f(broader)f(range) h(of)g(k)m(eyw)m(ord)f(names)h(than)f(is)h(allo)m(w)m(ed)h(b)m(y)e(the) h(FITS)f(Standard.)0 2245 y(Here)f(are)g(more)f(examples)h(of)g(suc)m (h)f(k)m(eyw)m(ords:)0 2502 y Fe(HIERARCH)46 b(LONGKEYWORD)e(=)k(47.5)e (/)i(Keyword)e(has)h(>)g(8)g(characters)0 2615 y(HIERARCH)f (LONG-KEY_WORD2)d(=)48 b(52.3)f(/)g(Long)g(keyword)e(with)i(hyphen,)f (underscore)f(and)i(digit)0 2728 y(HIERARCH)f(EARTH)g(IS)h(A)h(STAR)e (=)i(F)f(/)h(Keyword)d(contains)h(embedded)f(spaces)0 2985 y Fj(CFITSIO)40 b(will)i(transparen)m(tly)g(read)g(and)f(write)g (these)i(k)m(eyw)m(ords,)i(so)d(application)h(programs)e(do)g(not)h(in) 0 3098 y(general)33 b(need)f(to)h(kno)m(w)f(an)m(ything)h(ab)s(out)f (the)g(sp)s(eci\014c)g(implemen)m(tation)i(details)f(of)g(the)f(HIERAR) m(CH)g(con-)0 3211 y(v)m(en)m(tion.)50 b(In)32 b(particular,)j (application)f(programs)e(do)h(not)h(need)e(to)i(sp)s(ecify)f(the)g (`HIERAR)m(CH')h(part)f(of)g(the)0 3324 y(k)m(eyw)m(ord)g(name)f(when)g (reading)g(or)g(writing)h(k)m(eyw)m(ords)f(\(although)h(it)g(ma)m(y)g (b)s(e)f(included)f(if)i(desired\).)46 b(When)0 3437 y(writing)35 b(a)g(k)m(eyw)m(ord,)h(CFITSIO)d(\014rst)h(c)m(hec)m(ks)i (to)f(see)g(if)g(the)g(k)m(eyw)m(ord)g(name)f(is)h(legal)h(as)f(a)g (standard)f(FITS)0 3550 y(k)m(eyw)m(ord)k(\(no)g(more)f(than)h(8)g(c)m (haracters)h(long)f(and)f(con)m(taining)i(only)e(letters,)k(digits,)f (or)e(a)g(min)m(us)e(sign)i(or)0 3663 y(underscore\).)68 b(If)39 b(so)h(it)g(writes)g(it)g(as)f(a)h(standard)f(FITS)g(k)m(eyw)m (ord,)k(otherwise)d(it)g(uses)f(the)h(hierarc)m(h)f(con-)0 3776 y(v)m(en)m(tion)34 b(to)f(write)g(the)f(k)m(eyw)m(ord.)48 b(The)32 b(maxim)m(um)g(k)m(eyw)m(ord)h(name)f(length)h(is)g(67)g(c)m (haracters,)i(whic)m(h)d(lea)m(v)m(es)0 3888 y(only)c(1)h(space)g(for)f (the)h(v)-5 b(alue)29 b(\014eld.)39 b(A)29 b(more)f(practical)i(limit)f (is)g(ab)s(out)f(40)h(c)m(haracters,)i(whic)m(h)d(lea)m(v)m(es)i (enough)0 4001 y(ro)s(om)e(for)h(most)f(k)m(eyw)m(ord)h(v)-5 b(alues.)41 b(CFITSIO)27 b(returns)g(an)h(error)h(if)f(there)h(is)f (not)h(enough)f(ro)s(om)h(for)f(b)s(oth)g(the)0 4114 y(k)m(eyw)m(ord)k(name)f(and)f(the)i(k)m(eyw)m(ord)f(v)-5 b(alue)32 b(on)f(the)h(80-c)m(haracter)h(card,)f(except)g(for)f (string-v)-5 b(alued)32 b(k)m(eyw)m(ords)0 4227 y(whic)m(h)f(are)h (simply)e(truncated)i(so)f(that)h(the)f(closing)i(quote)f(c)m(haracter) h(falls)e(in)g(column)g(80.)45 b(A)31 b(space)h(is)f(also)0 4340 y(required)f(on)g(either)h(side)f(of)h(the)f(equal)h(sign.)0 4494 y SDict begin H.S end 0 4494 a 0 4494 a SDict begin 13.6 H.A end 0 4494 a 0 4494 a SDict begin [/View [/XYZ H.V]/Dest (section.12.6) cvn /DEST pdfmark end 0 4494 a 179 x Ff(12.6)136 b(Tile-Compressed)46 b(Image)g(F)-11 b(ormat)0 4924 y Fj(CFITSIO)36 b(supp)s(orts)f(a)j(con)m(v)m(en)m(tion)i(for)d (compressing)h(n-dimensional)f(images)h(and)f(storing)h(the)g (resulting)0 5036 y(b)m(yte)i(stream)g(in)f(a)h(v)-5 b(ariable-length)41 b(column)e(in)g(a)h(FITS)f(binary)f(table.)69 b(The)39 b(general)i(principle)e(used)f(in)0 5149 y(this)c(con)m(v)m (en)m(tion)j(is)d(to)h(\014rst)f(divide)g(the)h(n-dimensional)f(image)i (in)m(to)f(a)g(rectangular)g(grid)f(of)h(subimages)f(or)0 5262 y(`tiles'.)57 b(Eac)m(h)35 b(tile)i(is)e(then)g(compressed)g(as)g (a)h(con)m(tin)m(uous)g(blo)s(c)m(k)f(of)h(data,)h(and)e(the)g (resulting)g(compressed)0 5375 y(b)m(yte)i(stream)h(is)f(stored)g(in)f (a)h(ro)m(w)g(of)g(a)h(v)-5 b(ariable)37 b(length)g(column)g(in)g(a)g (FITS)f(binary)g(table.)61 b(By)37 b(dividing)0 5488 y(the)j(image)g(in)m(to)g(tiles)h(it)f(is)f(generally)i(p)s(ossible)e (to)h(extract)h(and)d(uncompress)g(subsections)i(of)f(the)h(image)0 5601 y(without)d(ha)m(ving)h(to)g(uncompress)e(the)h(whole)g(image.)62 b(The)37 b(default)g(tiling)h(pattern)g(treats)g(eac)m(h)g(ro)m(w)f(of) h(a)0 5714 y(2-dimensional)e(image)g(\(or)f(higher)f(dimensional)h(cub) s(e\))g(as)g(a)g(tile,)j(suc)m(h)c(that)i(eac)m(h)g(tile)g(con)m(tains) g(NAXIS1)p eop end %%Page: 165 173 TeXDict begin 165 172 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.165) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(12.6.)73 b(TILE-COMPRESSED)28 b(IMA)m(GE)j(F)m(ORMA)-8 b(T)1838 b Fj(165)0 555 y(pixels)29 b(\(except)h(the)f(default)g(with)g(the)g (HCOMPRESS)e(algorithm)j(is)f(to)h(compress)f(the)g(whole)g(2D)h(image) g(as)0 668 y(a)35 b(single)g(tile\).)56 b(An)m(y)34 b(other)h (rectangular)h(tiling)g(pattern)f(ma)m(y)g(also)h(b)s(e)e(de\014ned.)52 b(In)34 b(the)h(case)h(of)f(relativ)m(ely)0 781 y(small)25 b(images)h(it)f(ma)m(y)g(b)s(e)f(su\016cien)m(t)h(to)h(compress)e(the)h (en)m(tire)g(image)h(as)f(a)g(single)h(tile,)h(resulting)d(in)h(an)f (output)0 894 y(binary)29 b(table)i(with)f(1)g(ro)m(w.)41 b(In)29 b(the)h(case)h(of)f(3-dimensional)h(data)g(cub)s(es,)e(it)i(ma) m(y)f(b)s(e)f(adv)-5 b(an)m(tageous)32 b(to)f(treat)0 1007 y(eac)m(h)i(plane)f(of)g(the)g(cub)s(e)f(as)h(a)g(separate)h(tile) g(if)f(application)h(soft)m(w)m(are)h(t)m(ypically)f(needs)f(to)g (access)i(the)e(cub)s(e)0 1120 y(on)e(a)h(plane)f(b)m(y)h(plane)f (basis.)0 1280 y(See)41 b(section)g(5.6)h(\\Image)f(Compression")f(for) g(more)h(information)g(on)f(using)g(this)g(tile-compressed)i(image)0 1393 y(format.)p eop end %%Page: 166 174 TeXDict begin 166 173 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.166) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(166)1741 b Fh(CHAPTER)30 b(12.)112 b(LOCAL)29 b(FITS)h(CONVENTIONS)p eop end %%Page: 167 175 TeXDict begin 167 174 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.167) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (chapter.13) cvn /DEST pdfmark end 0 464 a 761 x Fg(Chapter)65 b(13)0 1687 y Fm(Optimizing)76 b(Programs)0 2180 y Fj(CFITSIO)22 b(has)h(b)s(een)f(carefully)i(designed)f(to)h(obtain)g(the)f(highest)h (p)s(ossible)e(sp)s(eed)h(when)f(reading)h(and)g(writing)0 2293 y(FITS)33 b(\014les.)51 b(In)33 b(order)h(to)g(ac)m(hiev)m(e)i (the)e(b)s(est)g(p)s(erformance,)g(ho)m(w)m(ev)m(er,)i(application)g (programmers)d(m)m(ust)h(b)s(e)0 2406 y(careful)24 b(to)h(call)g(the)f (CFITSIO)f(routines)g(appropriately)i(and)e(in)h(an)f(e\016cien)m(t)j (sequence;)h(inappropriate)c(usage)0 2518 y(of)31 b(CFITSIO)d(routines) j(can)f(greatly)i(slo)m(w)f(do)m(wn)f(the)h(execution)g(sp)s(eed)f(of)g (a)h(program.)0 2679 y(The)f(maxim)m(um)h(p)s(ossible)f(I/O)h(sp)s(eed) f(of)h(CFITSIO)e(dep)s(ends)g(of)i(course)g(on)f(the)h(t)m(yp)s(e)g(of) g(computer)g(system)0 2791 y(that)j(it)g(is)g(running)d(on.)50 b(T)-8 b(o)34 b(get)h(a)f(general)g(idea)g(of)g(what)f(data)i(I/O)e(sp) s(eeds)f(are)i(p)s(ossible)f(on)h(a)g(particular)0 2904 y(mac)m(hine,)j(build)e(the)g(sp)s(eed.c)g(program)g(that)h(is)g (distributed)e(with)h(CFITSIO)f(\(t)m(yp)s(e)i('mak)m(e)g(sp)s(eed')f (in)g(the)0 3017 y(CFITSIO)e(directory\).)54 b(This)33 b(diagnostic)j(program)e(measures)h(the)f(sp)s(eed)g(of)g(writing)h (and)f(reading)g(bac)m(k)i(a)0 3130 y(test)31 b(FITS)f(image,)i(a)f (binary)e(table,)j(and)d(an)i(ASCI)s(I)e(table.)0 3290 y(The)k(follo)m(wing)h(2)g(sections)g(pro)m(vide)g(some)f(bac)m (kground)g(on)h(ho)m(w)f(CFITSIO)f(in)m(ternally)i(manages)g(the)f (data)0 3403 y(I/O)g(and)g(describ)s(es)f(some)i(strategies)h(that)f (ma)m(y)g(b)s(e)e(used)h(to)h(optimize)g(the)g(pro)s(cessing)f(sp)s (eed)f(of)h(soft)m(w)m(are)0 3516 y(that)e(uses)f(CFITSIO.)0 3735 y SDict begin H.S end 0 3735 a 0 3735 a SDict begin 13.6 H.A end 0 3735 a 0 3735 a SDict begin [/View [/XYZ H.V]/Dest (section.13.1) cvn /DEST pdfmark end 0 3735 a 197 x Ff(13.1)136 b(Ho)l(w)45 b(CFITSIO)f(Manages)i(Data)g(I/O)0 4199 y Fj(Man)m(y)22 b(CFITSIO)e(op)s(erations)i(in)m(v)m(olv)m(e)i (transferring)d(only)h(a)g(small)g(n)m(um)m(b)s(er)f(of)h(b)m(ytes)g (to)g(or)g(from)f(the)h(FITS)f(\014le)0 4312 y(\(e.g,)31 b(reading)e(a)g(k)m(eyw)m(ord,)h(or)f(writing)g(a)g(ro)m(w)g(in)f(a)h (table\);)i(it)f(w)m(ould)e(b)s(e)g(v)m(ery)i(ine\016cien)m(t)g(to)f (ph)m(ysically)h(read)0 4425 y(or)i(write)h(suc)m(h)f(small)g(blo)s(c)m (ks)h(of)f(data)h(directly)g(in)f(the)g(FITS)g(\014le)g(on)g(disk,)h (therefore)f(CFITSIO)f(main)m(tains)0 4538 y(a)38 b(set)g(of)g(in)m (ternal)h(Input{Output)c(\(IO\))j(bu\013ers)f(in)g(RAM)h(memory)g(that) g(eac)m(h)h(con)m(tain)g(one)f(FITS)f(blo)s(c)m(k)0 4650 y(\(2880)27 b(b)m(ytes\))f(of)f(data.)40 b(Whenev)m(er)25 b(CFITSIO)f(needs)g(to)i(access)g(data)g(in)f(the)g(FITS)f(\014le,)j (it)e(\014rst)f(transfers)h(the)0 4763 y(FITS)30 b(blo)s(c)m(k)h(con)m (taining)h(those)f(b)m(ytes)g(in)m(to)g(one)g(of)f(the)h(IO)f (bu\013ers)f(in)h(memory)-8 b(.)42 b(The)30 b(next)g(time)h(CFITSIO)0 4876 y(needs)36 b(to)g(access)i(b)m(ytes)e(in)g(the)g(same)h(blo)s(c)m (k)f(it)h(can)f(then)g(go)h(to)f(the)h(fast)f(IO)f(bu\013er)g(rather)h (than)g(using)g(a)0 4989 y(m)m(uc)m(h)c(slo)m(w)m(er)i(system)e(disk)g (access)h(routine.)46 b(The)32 b(n)m(um)m(b)s(er)f(of)h(a)m(v)-5 b(ailable)35 b(IO)d(bu\013ers)f(is)h(determined)g(b)m(y)g(the)0 5102 y(NIOBUF)f(parameter)g(\(in)f(\014tsio2.h\))h(and)f(is)h(curren)m (tly)f(set)h(to)g(40)g(b)m(y)g(default.)0 5262 y(Whenev)m(er)24 b(CFITSIO)f(reads)g(or)h(writes)g(data)g(it)h(\014rst)e(c)m(hec)m(ks)i (to)g(see)f(if)g(that)g(blo)s(c)m(k)h(of)f(the)g(FITS)f(\014le)g(is)h (already)0 5375 y(loaded)33 b(in)m(to)g(one)f(of)g(the)g(IO)g (bu\013ers.)44 b(If)32 b(not,)h(and)e(if)h(there)g(is)g(an)g(empt)m(y)h (IO)e(bu\013er)g(a)m(v)-5 b(ailable,)35 b(then)d(it)h(will)0 5488 y(load)g(that)h(blo)s(c)m(k)f(in)m(to)g(the)g(IO)g(bu\013er)e (\(when)h(reading)h(a)g(FITS)f(\014le\))h(or)g(will)g(initialize)i(a)e (new)f(blo)s(c)m(k)i(\(when)0 5601 y(writing)j(to)h(a)g(FITS)f (\014le\).)62 b(If)37 b(all)h(the)g(IO)e(bu\013ers)h(are)g(already)h (full,)h(it)f(m)m(ust)g(decide)f(whic)m(h)g(one)h(to)g(reuse)0 5714 y(\(generally)c(the)f(one)g(that)g(has)f(b)s(een)g(accessed)i (least)f(recen)m(tly\),)i(and)d(\015ush)f(the)i(con)m(ten)m(ts)h(bac)m (k)g(to)f(disk)f(if)g(it)1882 5942 y(167)p eop end %%Page: 168 176 TeXDict begin 168 175 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.168) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(168)1876 b Fh(CHAPTER)30 b(13.)112 b(OPTIMIZING)29 b(PR)m(OGRAMS)0 555 y Fj(has)h(b)s(een)g(mo)s(di\014ed)f(b)s(efore)h(loading)h(the)g (new)f(blo)s(c)m(k.)0 715 y(The)g(one)g(ma)5 b(jor)30 b(exception)i(to)f(the)f(ab)s(o)m(v)m(e)h(pro)s(cess)f(o)s(ccurs)g (whenev)m(er)g(a)g(large)i(con)m(tiguous)f(set)g(of)f(b)m(ytes)h(are)0 828 y(accessed,)37 b(as)d(migh)m(t)i(o)s(ccur)e(when)f(reading)i(or)f (writing)g(a)h(FITS)f(image.)54 b(In)34 b(this)g(case)h(CFITSIO)e(b)m (ypasses)0 941 y(the)i(in)m(ternal)h(IO)f(bu\013ers)f(and)g(simply)h (reads)g(or)g(writes)h(the)f(desired)g(b)m(ytes)g(directly)h(in)f(the)g (disk)g(\014le)g(with)0 1054 y(a)i(single)g(call)g(to)g(a)g(lo)m(w-lev) m(el)i(\014le)d(read)g(or)h(write)f(routine.)58 b(The)36 b(minim)m(um)g(threshold)f(for)h(the)h(n)m(um)m(b)s(er)e(of)0 1167 y(b)m(ytes)27 b(to)g(read)f(or)g(write)g(this)g(w)m(a)m(y)i(is)e (set)g(b)m(y)h(the)f(MINDIRECT)g(parameter)g(and)g(is)g(curren)m(tly)g (set)h(to)g(3)g(FITS)0 1280 y(blo)s(c)m(ks)36 b(=)g(8640)i(b)m(ytes.)58 b(This)35 b(is)h(the)g(most)g(e\016cien)m(t)i(w)m(a)m(y)f(to)g(read)e (or)h(write)h(large)g(c)m(h)m(unks)e(of)h(data.)59 b(Note)0 1393 y(that)34 b(this)f(fast)h(direct)g(IO)f(pro)s(cess)f(is)i(not)f (applicable)i(when)d(accessing)j(columns)e(of)h(data)g(in)f(a)g(FITS)g (table)0 1506 y(b)s(ecause)f(the)h(b)m(ytes)g(are)g(generally)g(not)g (con)m(tiguous)g(since)g(they)g(are)f(in)m(terlea)m(v)m(ed)j(b)m(y)e (the)f(other)h(columns)f(of)0 1619 y(data)i(in)e(the)h(table.)49 b(This)33 b(explains)g(wh)m(y)f(the)h(sp)s(eed)f(for)h(accessing)h (FITS)e(tables)i(is)f(generally)h(slo)m(w)m(er)g(than)0 1732 y(accessing)e(FITS)e(images.)0 1892 y(Giv)m(en)i(this)g(bac)m (kground)f(information,)h(the)g(general)g(strategy)h(for)e(e\016cien)m (tly)i(accessing)g(FITS)e(\014les)g(should)0 2005 y(b)s(e)e(apparen)m (t:)41 b(when)28 b(dealing)j(with)e(FITS)g(images,)i(read)e(or)h(write) g(large)g(c)m(h)m(unks)g(of)g(data)g(at)g(a)g(time)g(so)g(that)0 2118 y(the)25 b(direct)g(IO)f(mec)m(hanism)g(will)h(b)s(e)f(in)m(v)m (ok)m(ed;)k(when)c(accessing)i(FITS)e(headers)g(or)g(FITS)g(tables,)j (on)d(the)h(other)0 2230 y(hand,)35 b(once)g(a)g(particular)g(FITS)f (blo)s(c)m(k)i(has)e(b)s(een)g(loading)i(in)m(to)f(one)g(of)g(the)g(IO) f(bu\013ers,)h(try)g(to)g(access)h(all)0 2343 y(the)30 b(needed)g(information)g(in)g(that)g(blo)s(c)m(k)h(b)s(efore)f(it)g (gets)h(\015ushed)d(out)j(of)f(the)g(IO)f(bu\013er.)40 b(It)30 b(is)g(imp)s(ortan)m(t)g(to)0 2456 y(a)m(v)m(oid)e(the)f (situation)g(where)f(the)h(same)g(FITS)e(blo)s(c)m(k)i(is)g(b)s(eing)f (read)g(then)g(\015ushed)f(from)h(a)h(IO)f(bu\013er)f(m)m(ultiple)0 2569 y(times.)0 2729 y(The)30 b(follo)m(wing)i(section)f(giv)m(es)h (more)e(sp)s(eci\014c)h(suggestions)g(for)f(optimizing)i(the)e(use)g (of)h(CFITSIO.)0 2916 y SDict begin H.S end 0 2916 a 0 2916 a SDict begin 13.6 H.A end 0 2916 a 0 2916 a SDict begin [/View [/XYZ H.V]/Dest (section.13.2) cvn /DEST pdfmark end 0 2916 a 179 x Ff(13.2)136 b(Optimization)46 b(Strategies)0 3352 y Fj(1.)d(Because)32 b(the)f(data)g(in)g(FITS)f(\014les)h(is)g (alw)m(a)m(ys)h(stored)f(in)g("big-endian")h(b)m(yte)f(order,)g(where)f (the)h(\014rst)f(b)m(yte)0 3465 y(of)g(n)m(umeric)h(v)-5 b(alues)30 b(con)m(tains)i(the)e(most)h(signi\014can)m(t)g(bits)f(and)g (the)g(last)i(b)m(yte)e(con)m(tains)i(the)e(least)i(signi\014can)m(t)0 3578 y(bits,)e(CFITSIO)f(m)m(ust)h(sw)m(ap)g(the)g(order)f(of)h(the)h (b)m(ytes)f(when)f(reading)h(or)g(writing)g(FITS)g(\014les)g(when)f (running)0 3690 y(on)k(little-endian)i(mac)m(hines)f(\(e.g.,)i(Lin)m (ux)d(and)g(Microsoft)i(Windo)m(ws)e(op)s(erating)h(systems)g(running)d (on)j(PCs)0 3803 y(with)c(x86)h(CPUs\).)0 3963 y(On)21 b(relativ)m(ely)k(new)d(CPUs)g(that)h(supp)s(ort)d("SSSE3")i(mac)m (hine)h(instructions)f(\(e.g.,)k(starting)d(with)f(In)m(tel)h(Core)g(2) 0 4076 y(CPUs)e(in)h(2007,)j(and)d(in)f(AMD)i(CPUs)e(b)s(eginning)g(in) h(2011\))i(signi\014can)m(tly)f(faster)f(4-b)m(yte)h(and)e(8-b)m(yte)i (sw)m(apping)0 4189 y(algorithms)k(are)g(a)m(v)-5 b(ailable.)42 b(These)26 b(faster)h(b)m(yte)g(sw)m(apping)f(functions)g(are)h(not)g (used)e(b)m(y)i(default)f(in)g(CFITSIO)0 4302 y(\(b)s(ecause)33 b(of)g(p)s(oten)m(tial)h(co)s(de)f(p)s(ortablilit)m(y)h(issues\),)g (but)e(users)g(can)h(enable)g(them)f(on)h(supp)s(orted)e(platforms)0 4415 y(b)m(y)38 b(adding)f(the)h(appropriate)f(compiler)i(\015ags)e (\(-mssse3)i(with)e(gcc)i(or)f(icc)g(on)g(lin)m(ux\))g(when)e (compiling)j(the)0 4528 y(sw)m(appro)s(c.c)30 b(source)g(\014le,)g (whic)m(h)g(will)g(allo)m(w)i(the)e(compiler)g(to)h(generate)h(co)s(de) e(using)f(the)h(SSSE3)f(instruction)0 4641 y(set.)41 b(A)28 b(con)m(v)m(enien)m(t)i(w)m(a)m(y)f(to)g(do)g(this)f(is)g(to)h (con\014gure)f(the)g(CFITSIO)f(library)h(with)g(the)g(follo)m(wing)i (command:)95 4928 y Fe(>)96 b(./configure)44 b(--enable-ssse3)0 5215 y Fj(Note,)37 b(ho)m(w)m(ev)m(er,)h(that)d(a)g(binary)f (executable)j(\014le)e(that)g(is)g(created)h(using)e(these)h(faster)g (functions)g(will)g(only)0 5328 y(run)29 b(on)h(mac)m(hines)h(that)g (supp)s(ort)e(the)h(SSSE3)f(mac)m(hine)i(instructions.)0 5488 y(F)-8 b(or)36 b(faster)f(2-b)m(yte)i(sw)m(aps)e(on)g(virtually)g (all)h(x86-64)h(CPUs)e(\(ev)m(en)h(those)g(that)f(do)g(not)h(supp)s (ort)d(SSSE3\),)j(a)0 5601 y(v)-5 b(arian)m(t)26 b(using)e(only)g(SSE2) g(instructions)h(exists.)39 b(SSE2)24 b(is)h(enabled)f(b)m(y)h(default) g(on)f(x86)p 3066 5601 28 4 v 34 w(64)h(CPUs)f(with)h(64-bit)0 5714 y(op)s(erating)30 b(systems)f(\(and)g(is)g(also)i(automatically)h (enabled)d(b)m(y)g(the)g({enable-ssse3)i(\015ag\).)41 b(When)30 b(running)d(on)p eop end %%Page: 169 177 TeXDict begin 169 176 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.169) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(13.2.)73 b(OPTIMIZA)-8 b(TION)29 b(STRA)-8 b(TEGIES)2186 b Fj(169)0 555 y(x86)p 143 555 28 4 v 34 w(64)31 b(CPUs)g(with)f(32-bit)i(op)s (erating)g(systems,)f(these)g(faster)h(2-b)m(yte)g(sw)m(apping)f (algorithms)g(are)h(not)f(used)0 668 y(b)m(y)f(default)h(in)f(CFITSIO,) f(but)h(can)g(b)s(e)g(enabled)g(explicitly)i(with:)0 951 y Fe(./configure)45 b(--enable-sse2)0 1234 y Fj(Preliminary)f (testing)h(indicates)g(that)g(these)f(SSSE3)f(and)g(SSE2)g(based)h(b)m (yte-sw)m(apping)h(algorithms)g(can)0 1347 y(b)s(o)s(ost)31 b(the)h(CFITSIO)e(p)s(erformance)h(when)f(reading)i(or)f(writing)h (FITS)f(images)h(b)m(y)g(20\045)g(-)g(30\045)g(or)f(more.)45 b(It)0 1460 y(is)36 b(imp)s(ortan)m(t)g(to)g(note,)i(ho)m(w)m(ev)m(er,) h(that)d(compiler)g(optimization)i(m)m(ust)e(b)s(e)f(turned)f(on)i (\(e.g.,)j(b)m(y)d(using)f(the)0 1573 y(-O1)f(or)g(-O2)g(\015ags)g(in)g (gcc\))h(when)e(building)g(programs)h(that)g(use)g(these)g(fast)g(b)m (yte-sw)m(apping)h(algorithms)f(in)0 1686 y(order)d(to)h(reap)f(the)h (full)f(b)s(ene\014t)g(of)g(the)h(SSSE3)e(and)h(SSE2)g(instructions;)h (without)f(optimization,)j(the)e(co)s(de)0 1799 y(ma)m(y)f(actually)h (run)d(slo)m(w)m(er)i(than)f(when)g(using)g(more)g(traditional)i(b)m (yte-sw)m(apping)f(tec)m(hniques.)0 1959 y(2.)54 b(When)34 b(dealing)h(with)g(a)g(FITS)e(primary)h(arra)m(y)h(or)g(IMA)m(GE)g (extension,)i(it)e(is)f(more)h(e\016cien)m(t)h(to)f(read)g(or)0 2072 y(write)c(large)g(c)m(h)m(unks)f(of)g(the)h(image)g(at)h(a)e(time) h(\(at)h(least)f(3)g(FITS)f(blo)s(c)m(ks)g(=)g(8640)i(b)m(ytes\))f(so)g (that)g(the)f(direct)0 2185 y(IO)j(mec)m(hanism)h(will)f(b)s(e)g(used)g (as)g(describ)s(ed)g(in)g(the)g(previous)g(section.)51 b(Smaller)34 b(c)m(h)m(unks)f(of)g(data)h(are)g(read)0 2298 y(or)d(written)g(via)h(the)f(IO)f(bu\013ers,)g(whic)m(h)h(is)g (somewhat)g(less)g(e\016cien)m(t)i(b)s(ecause)e(of)g(the)g(extra)h(cop) m(y)f(op)s(eration)0 2411 y(and)26 b(additional)h(b)s(o)s(okk)m(eeping) g(steps)g(that)g(are)g(required.)39 b(In)26 b(principle)g(it)h(is)g (more)f(e\016cien)m(t)i(to)g(read)e(or)h(write)0 2524 y(as)i(big)g(an)g(arra)m(y)h(of)f(image)h(pixels)f(at)h(one)f(time)g (as)h(p)s(ossible,)f(ho)m(w)m(ev)m(er,)h(if)f(the)h(arra)m(y)f(b)s (ecomes)g(so)g(large)h(that)0 2636 y(the)i(op)s(erating)g(system)f (cannot)h(store)g(it)g(all)h(in)e(RAM,)h(then)f(the)h(p)s(erformance)f (ma)m(y)h(b)s(e)f(degraded)g(b)s(ecause)0 2749 y(of)g(the)f(increased)h (sw)m(apping)f(of)g(virtual)h(memory)f(to)h(disk.)0 2910 y(3.)51 b(When)33 b(dealing)i(with)e(FITS)g(tables,)j(the)e(most)g(imp) s(ortan)m(t)g(e\016ciency)g(factor)h(in)e(the)h(soft)m(w)m(are)h (design)f(is)0 3022 y(to)j(read)f(or)g(write)g(the)g(data)h(in)f(the)g (FITS)g(\014le)g(in)g(a)g(single)h(pass)f(through)f(the)h(\014le.)58 b(An)36 b(example)h(of)f(p)s(o)s(or)0 3135 y(program)g(design)h(w)m (ould)f(b)s(e)g(to)h(read)g(a)f(large,)k(3-column)d(table)g(b)m(y)g (sequen)m(tially)h(reading)f(the)f(en)m(tire)i(\014rst)0 3248 y(column,)25 b(then)f(going)h(bac)m(k)f(to)h(read)e(the)h(2nd)g (column,)h(and)e(\014nally)h(the)g(3rd)f(column;)j(this)e(ob)m(viously) g(requires)0 3361 y(3)j(passes)g(through)g(the)g(\014le)g(whic)m(h)g (could)g(triple)g(the)h(execution)g(time)g(of)f(an)g(IO)f(limited)i (program.)40 b(F)-8 b(or)27 b(small)0 3474 y(tables)k(this)f(is)h(not)f (imp)s(ortan)m(t,)h(but)f(when)f(reading)h(m)m(ulti-megab)m(yte)j (sized)e(tables)g(these)g(ine\016ciencies)h(can)0 3587 y(b)s(ecome)d(signi\014can)m(t.)41 b(The)28 b(more)h(e\016cien)m(t)h (pro)s(cedure)d(in)i(this)f(case)i(is)e(to)i(read)e(or)h(write)g(only)f (as)h(man)m(y)g(ro)m(ws)0 3700 y(of)j(the)g(table)g(as)g(will)g(\014t)g (in)m(to)g(the)g(a)m(v)-5 b(ailable)34 b(in)m(ternal)e(IO)f(bu\013ers,) h(then)f(access)i(all)f(the)g(necessary)g(columns)0 3813 y(of)f(data)h(within)e(that)i(range)f(of)g(ro)m(ws.)43 b(Then)29 b(after)j(the)f(program)g(is)g(completely)h(\014nished)e (with)g(the)i(data)f(in)0 3926 y(those)i(ro)m(ws)e(it)i(can)f(mo)m(v)m (e)i(on)e(to)g(the)h(next)f(range)g(of)g(ro)m(ws)g(that)h(will)f(\014t) g(in)g(the)g(bu\013ers,)f(con)m(tin)m(uing)i(in)f(this)0 4039 y(w)m(a)m(y)c(un)m(til)f(the)f(en)m(tire)i(\014le)f(has)f(b)s(een) g(pro)s(cessed.)39 b(By)27 b(using)f(this)h(pro)s(cedure)e(of)i (accessing)h(all)g(the)e(columns)h(of)0 4152 y(a)j(table)g(in)f (parallel)h(rather)f(than)g(sequen)m(tially)-8 b(,)32 b(eac)m(h)e(blo)s(c)m(k)g(of)g(the)f(FITS)g(\014le)g(will)g(only)h(b)s (e)e(read)i(or)f(written)0 4264 y(once.)0 4425 y(The)g(optimal)h(n)m (um)m(b)s(er)e(of)i(ro)m(ws)f(to)i(read)e(or)g(write)h(at)g(one)g(time) g(in)f(a)h(giv)m(en)g(table)h(dep)s(ends)c(on)j(the)f(width)g(of)0 4538 y(the)c(table)h(ro)m(w)f(and)f(on)h(the)g(n)m(um)m(b)s(er)e(of)i (IO)g(bu\013ers)e(that)j(ha)m(v)m(e)g(b)s(een)e(allo)s(cated)j(in)e (CFITSIO.)e(The)h(CFITSIO)0 4650 y(Iterator)h(routine)f(will)g (automatically)j(use)c(the)h(optimal-sized)i(bu\013er,)e(but)g(there)g (is)g(also)g(a)h(CFITSIO)d(routine)0 4763 y(that)31 b(will)g(return)f (the)h(optimal)h(n)m(um)m(b)s(er)d(of)i(ro)m(ws)g(for)f(a)h(giv)m(en)h (table:)43 b(\014ts)p 2629 4763 V 32 w(get)p 2781 4763 V 34 w(ro)m(wsize.)g(It)31 b(is)g(not)g(critical)h(to)0 4876 y(use)h(exactly)j(the)e(v)-5 b(alue)34 b(of)g(nro)m(ws)f(returned) f(b)m(y)i(this)g(routine,)g(as)g(long)h(as)f(one)g(do)s(es)f(not)h (exceed)h(it.)51 b(Using)0 4989 y(a)37 b(v)m(ery)g(small)g(v)-5 b(alue)37 b(ho)m(w)m(ev)m(er)h(can)f(also)g(lead)g(to)h(p)s(o)s(or)d(p) s(erformance)h(b)s(ecause)g(of)h(the)g(o)m(v)m(erhead)h(from)e(the)0 5102 y(larger)31 b(n)m(um)m(b)s(er)e(of)i(subroutine)e(calls.)0 5262 y(The)36 b(optimal)h(n)m(um)m(b)s(er)e(of)h(ro)m(ws)g(returned)f (b)m(y)i(\014ts)p 1829 5262 V 32 w(get)p 1981 5262 V 34 w(ro)m(wsize)g(is)g(v)-5 b(alid)36 b(only)g(as)h(long)g(as)f(the)h (application)0 5375 y(program)27 b(is)g(only)g(reading)h(or)f(writing)g (data)h(in)f(the)g(sp)s(eci\014ed)f(table.)41 b(An)m(y)27 b(other)g(calls)i(to)f(access)g(data)g(in)f(the)0 5488 y(table)i(header)f(w)m(ould)f(cause)i(additional)g(blo)s(c)m(ks)f(of)g (data)g(to)h(b)s(e)e(loaded)i(in)m(to)g(the)f(IO)f(bu\013ers)g (displacing)h(data)0 5601 y(from)34 b(the)h(original)h(table,)h(and)d (should)f(b)s(e)h(a)m(v)m(oided)i(during)e(the)h(critical)h(p)s(erio)s (d)e(while)g(the)h(table)h(is)e(b)s(eing)0 5714 y(read)c(or)h(written.) p eop end %%Page: 170 178 TeXDict begin 170 177 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.170) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(170)1876 b Fh(CHAPTER)30 b(13.)112 b(OPTIMIZING)29 b(PR)m(OGRAMS)0 555 y Fj(4.)39 b(Use)25 b(the)g(CFITSIO)e(Iterator)j(routine.)39 b(This)24 b(routine)h(pro)m(vides)f(a)i(more)e(`ob)5 b(ject)26 b(orien)m(ted')g(w)m(a)m(y)g(of)f(reading)0 668 y(and)34 b(writing)g(FITS)g(\014les)g(whic)m(h)h(automatically)i (uses)d(the)g(most)h(appropriate)g(data)g(bu\013er)e(size)i(to)h(ac)m (hiev)m(e)0 781 y(the)31 b(maxim)m(um)f(I/O)g(throughput.)0 941 y(5.)39 b(Use)24 b(binary)f(table)h(extensions)g(rather)f(than)h (ASCI)s(I)e(table)i(extensions)g(for)f(b)s(etter)h(e\016ciency)h(when)d (dealing)0 1054 y(with)37 b(tabular)h(data.)62 b(The)37 b(I/O)g(to)h(ASCI)s(I)e(tables)i(is)g(slo)m(w)m(er)g(b)s(ecause)g(of)f (the)h(o)m(v)m(erhead)h(in)e(formatting)h(or)0 1167 y(parsing)32 b(the)g(ASCI)s(I)f(data)i(\014elds)f(and)g(b)s(ecause)g(ASCI)s(I)f (tables)i(are)g(ab)s(out)f(t)m(wice)i(as)f(large)g(as)g(binary)e (tables)0 1280 y(that)g(ha)m(v)m(e)h(the)e(same)h(information)g(con)m (ten)m(t.)0 1440 y(6.)64 b(Design)39 b(soft)m(w)m(are)g(so)g(that)f(it) h(reads)f(the)g(FITS)f(header)h(k)m(eyw)m(ords)g(in)g(the)g(same)h (order)e(in)h(whic)m(h)g(they)0 1553 y(o)s(ccur)28 b(in)h(the)g (\014le.)40 b(When)28 b(reading)h(k)m(eyw)m(ords,)h(CFITSIO)d(searc)m (hes)i(forw)m(ard)g(starting)g(from)f(the)h(p)s(osition)g(of)0 1666 y(the)g(last)i(k)m(eyw)m(ord)e(that)h(w)m(as)g(read.)40 b(If)29 b(it)g(reac)m(hes)i(the)e(end)g(of)g(the)h(header)f(without)g (\014nding)f(the)h(k)m(eyw)m(ord,)h(it)0 1779 y(then)j(go)s(es)h(bac)m (k)g(to)h(the)e(start)h(of)g(the)g(header)f(and)g(con)m(tin)m(ues)h (the)g(searc)m(h)g(do)m(wn)f(to)h(the)g(p)s(osition)f(where)g(it)0 1892 y(started.)41 b(In)30 b(practice,)i(as)e(long)h(as)g(the)f(en)m (tire)i(FITS)d(header)h(can)h(\014t)f(at)h(one)g(time)g(in)f(the)g(a)m (v)-5 b(ailable)33 b(in)m(ternal)0 2005 y(IO)23 b(bu\013ers,)i(then)e (the)i(header)e(k)m(eyw)m(ord)i(access)g(will)f(b)s(e)g(relativ)m(ely)i (fast)e(and)g(it)g(mak)m(es)h(little)h(di\013erence)e(whic)m(h)0 2118 y(order)30 b(they)g(are)h(accessed.)0 2278 y(7.)40 b(Av)m(oid)29 b(the)e(use)h(of)f(scaling)i(\(b)m(y)f(using)f(the)h (BSCALE)e(and)h(BZER)m(O)h(or)f(TSCAL)g(and)g(TZER)m(O)f(k)m(eyw)m (ords\))0 2391 y(in)35 b(FITS)f(\014les)g(since)i(the)f(scaling)h(op)s (erations)f(add)f(to)i(the)f(pro)s(cessing)f(time)i(needed)e(to)i(read) f(or)g(write)g(the)0 2503 y(data.)k(In)24 b(some)h(cases)h(it)f(ma)m(y) g(b)s(e)f(more)g(e\016cien)m(t)i(to)g(temp)s(orarily)e(turn)g(o\013)h (the)f(scaling)i(\(using)e(\014ts)p 3490 2503 28 4 v 33 w(set)p 3634 2503 V 33 w(bscale)0 2616 y(or)30 b(\014ts)p 238 2616 V 33 w(set)p 382 2616 V 33 w(tscale\))j(and)c(then)h(read)h (or)f(write)h(the)f(ra)m(w)h(unscaled)f(v)-5 b(alues)31 b(in)f(the)g(FITS)g(\014le.)0 2777 y(8.)77 b(Av)m(oid)43 b(using)f(the)h(`implicit)g(data)h(t)m(yp)s(e)e(con)m(v)m(ersion')i (capabilit)m(y)g(in)e(CFITSIO.)f(F)-8 b(or)44 b(instance,)i(when)0 2889 y(reading)28 b(a)g(FITS)f(image)i(with)e(BITPIX)h(=)f(-32)i (\(32-bit)g(\015oating)g(p)s(oin)m(t)f(pixels\),)h(read)e(the)h(data)g (in)m(to)h(a)f(single)0 3002 y(precision)40 b(\015oating)h(p)s(oin)m(t) f(data)h(arra)m(y)f(in)g(the)g(program.)69 b(F)-8 b(orcing)41 b(CFITSIO)e(to)i(con)m(v)m(ert)g(the)f(data)h(to)g(a)0 3115 y(di\013eren)m(t)31 b(data)g(t)m(yp)s(e)f(can)h(slo)m(w)g(the)g (program.)0 3275 y(9.)57 b(Where)36 b(feasible,)i(design)e(FITS)f (binary)g(tables)h(using)f(v)m(ector)j(column)d(elemen)m(ts)i(so)f (that)g(the)g(data)h(are)0 3388 y(written)30 b(as)g(a)g(con)m(tiguous)h (set)f(of)g(b)m(ytes,)g(rather)g(than)f(as)h(single)g(elemen)m(ts)h(in) f(m)m(ultiple)g(ro)m(ws.)41 b(F)-8 b(or)30 b(example,)0 3501 y(it)36 b(is)g(faster)g(to)g(access)h(the)f(data)h(in)e(a)h(table) h(that)f(con)m(tains)h(a)f(single)g(ro)m(w)g(and)f(2)h(columns)f(with)h (TF)m(ORM)0 3614 y(k)m(eyw)m(ords)d(equal)h(to)g('10000E')h(and)e ('10000J',)j(than)d(it)g(is)g(to)h(access)g(the)g(same)f(amoun)m(t)h (of)f(data)h(in)f(a)g(table)0 3727 y(with)40 b(10000)j(ro)m(ws)d(whic)m (h)h(has)f(columns)g(with)g(the)h(TF)m(ORM)g(k)m(eyw)m(ords)g(equal)g (to)g('1E')h(and)e('1J'.)h(In)f(the)0 3840 y(former)27 b(case)i(the)f(10000)i(\015oating)f(p)s(oin)m(t)f(v)-5 b(alues)28 b(in)g(the)g(\014rst)f(column)h(are)g(all)h(written)f(in)f (a)h(con)m(tiguous)h(blo)s(c)m(k)0 3953 y(of)d(the)f(\014le)h(whic)m(h) f(can)h(b)s(e)f(read)g(or)g(written)h(quic)m(kly)-8 b(,)28 b(whereas)d(in)g(the)h(second)f(case)i(eac)m(h)g(\015oating)f(p)s(oin)m (t)f(v)-5 b(alue)0 4066 y(in)34 b(the)g(\014rst)f(column)g(is)h(in)m (terlea)m(v)m(ed)j(with)c(the)h(in)m(teger)i(v)-5 b(alue)34 b(in)g(the)g(second)g(column)f(of)h(the)g(same)h(ro)m(w)f(so)0 4179 y(CFITSIO)29 b(has)h(to)h(explicitly)h(mo)m(v)m(e)g(to)f(the)g(p)s (osition)f(of)h(eac)m(h)g(elemen)m(t)h(to)f(b)s(e)f(read)g(or)g (written.)0 4339 y(10.)45 b(Av)m(oid)33 b(the)f(use)f(of)h(v)-5 b(ariable)32 b(length)g(v)m(ector)h(columns)f(in)f(binary)g(tables,)i (since)f(an)m(y)g(reading)f(or)h(writing)0 4452 y(of)h(these)g(data)g (requires)f(that)h(CFITSIO)f(\014rst)f(lo)s(ok)j(up)d(or)i(compute)g (the)f(starting)i(address)e(of)g(eac)m(h)i(ro)m(w)f(of)0 4565 y(data)e(in)f(the)h(heap.)40 b(In)30 b(practice,)i(this)e(is)g (probably)g(not)h(a)f(signi\014can)m(t)i(e\016ciency)f(issue.)0 4725 y(11.)73 b(When)40 b(cop)m(ying)i(data)g(from)e(one)h(FITS)f (table)i(to)f(another,)j(it)e(is)e(faster)i(to)f(transfer)g(the)f(ra)m (w)h(b)m(ytes)0 4838 y(instead)28 b(of)h(reading)f(then)g(writing)g (eac)m(h)h(column)f(of)g(the)g(table.)41 b(The)28 b(CFITSIO)e(routines) i(\014ts)p 3349 4838 V 33 w(read)p 3554 4838 V 32 w(tblb)m(ytes)0 4951 y(and)36 b(\014ts)p 310 4951 V 32 w(write)p 544 4951 V 33 w(tblb)m(ytes)i(will)f(p)s(erform)e(lo)m(w-lev)m(el)k(reads)e (or)f(writes)h(of)g(an)m(y)g(con)m(tiguous)g(range)g(of)g(b)m(ytes)g (in)0 5064 y(a)d(table)g(extension.)51 b(These)33 b(routines)h(can)f(b) s(e)g(used)g(to)h(read)f(or)h(write)g(a)f(whole)h(ro)m(w)g(\(or)g(m)m (ultiple)g(ro)m(ws)f(for)0 5176 y(ev)m(en)e(greater)h(e\016ciency\))h (of)e(a)g(table)h(with)e(a)h(single)h(function)e(call.)43 b(These)31 b(routines)g(are)g(fast)g(b)s(ecause)g(they)0 5289 y(b)m(ypass)36 b(all)h(the)g(usual)f(data)h(scaling,)i(error)d(c)m (hec)m(king)i(and)e(mac)m(hine)h(dep)s(enden)m(t)e(data)i(con)m(v)m (ersion)h(that)f(is)0 5402 y(normally)g(done)g(b)m(y)f(CFITSIO,)g(and)g (they)h(allo)m(w)h(the)g(program)e(to)i(write)f(the)g(data)g(to)h(the)f (output)f(\014le)h(in)0 5515 y(exactly)30 b(the)e(same)h(b)m(yte)g (order.)40 b(F)-8 b(or)29 b(these)f(same)h(reasons,)g(these)g(routines) f(can)g(corrupt)g(the)g(FITS)g(data)h(\014le)0 5628 y(if)36 b(used)e(incorrectly)j(b)s(ecause)f(no)f(v)-5 b(alidation)37 b(or)f(mac)m(hine)g(dep)s(enden)m(t)e(con)m(v)m(ersion)j(is)f(p)s (erformed)e(b)m(y)h(these)p eop end %%Page: 171 179 TeXDict begin 171 178 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.171) cvn /DEST pdfmark end -8 191 a 0 299 a Fh(13.2.)73 b(OPTIMIZA)-8 b(TION)29 b(STRA)-8 b(TEGIES)2186 b Fj(171)0 555 y(routines.)55 b(These)35 b(routines)g(are)h(only)f(recommended)g (for)g(optimizing)h(critical)h(pieces)f(of)g(co)s(de)f(and)g(should)0 668 y(only)e(b)s(e)g(used)g(b)m(y)g(programmers)g(who)g(thoroughly)g (understand)e(the)j(in)m(ternal)g(format)g(of)f(the)h(FITS)e(tables)0 781 y(they)f(are)f(reading)h(or)f(writing.)0 941 y(12.)41 b(Another)30 b(strategy)g(for)g(impro)m(ving)f(the)h(sp)s(eed)e(of)i (writing)g(a)f(FITS)g(table,)i(similar)f(to)g(the)f(previous)g(one,)0 1054 y(is)j(to)g(directly)h(construct)f(the)f(en)m(tire)i(b)m(yte)f (stream)g(for)g(a)g(whole)g(table)g(ro)m(w)g(\(or)g(m)m(ultiple)h(ro)m (ws\))f(within)f(the)0 1167 y(application)g(program)e(and)g(then)h (write)g(it)g(to)g(the)g(FITS)f(\014le)h(with)f(\014ts)p 2520 1167 28 4 v 32 w(write)p 2754 1167 V 33 w(tblb)m(ytes.)41 b(This)29 b(a)m(v)m(oids)i(all)g(the)0 1280 y(o)m(v)m(erhead)f (normally)g(presen)m(t)f(in)g(the)h(column-orien)m(ted)g(CFITSIO)e (write)h(routines.)40 b(This)29 b(tec)m(hnique)h(should)0 1393 y(only)35 b(b)s(e)e(used)h(for)g(critical)i(applications)g(b)s (ecause)e(it)h(mak)m(es)h(the)e(co)s(de)h(more)f(di\016cult)h(to)g (understand)e(and)0 1506 y(main)m(tain,)38 b(and)d(it)h(mak)m(es)g(the) g(co)s(de)f(more)h(system)g(dep)s(enden)m(t)e(\(e.g.,)39 b(do)c(the)h(b)m(ytes)g(need)f(to)h(b)s(e)f(sw)m(app)s(ed)0 1619 y(b)s(efore)30 b(writing)g(to)h(the)g(FITS)f(\014le?\).)0 1779 y(13.)40 b(Finally)-8 b(,)29 b(external)e(factors)g(suc)m(h)e(as)i (the)f(sp)s(eed)f(of)i(the)f(data)h(storage)g(device,)h(the)f(size)g (of)f(the)g(data)h(cac)m(he,)0 1892 y(the)34 b(amoun)m(t)h(of)f(disk)g (fragmen)m(tation,)j(and)c(the)i(amoun)m(t)f(of)h(RAM)f(a)m(v)-5 b(ailable)37 b(on)d(the)g(system)g(can)h(all)g(ha)m(v)m(e)0 2005 y(a)k(signi\014can)m(t)g(impact)g(on)f(o)m(v)m(erall)j(I/O)d (e\016ciency)-8 b(.)66 b(F)-8 b(or)39 b(critical)h(applications,)i(the) c(en)m(tire)i(hardw)m(are)e(and)0 2118 y(soft)m(w)m(are)32 b(system)e(should)g(b)s(e)f(review)m(ed)i(to)h(iden)m(tify)e(an)m(y)h (p)s(oten)m(tial)h(I/O)e(b)s(ottlenec)m(ks.)p eop end %%Page: 172 180 TeXDict begin 172 179 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.172) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(172)1876 b Fh(CHAPTER)30 b(13.)112 b(OPTIMIZING)29 b(PR)m(OGRAMS)p eop end %%Page: 173 181 TeXDict begin 173 180 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.173) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (appendix.A) cvn /DEST pdfmark end 0 464 a 761 x Fg(App)5 b(endix)64 b(A)0 1687 y Fm(Index)77 b(of)h(Routines)50 2154 y Fj(\014ts)p 177 2154 28 4 v 32 w(add)p 356 2154 V 32 w(group)p 616 2154 V 33 w(mem)m(b)s(er)1208 2154 y SDict begin H.S end 1208 2154 a Fj(92)1299 2096 y SDict begin H.R end 1299 2096 a 1299 2154 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 1299 2154 a 50 2267 a Fj(\014ts)p 177 2267 28 4 v 32 w(ascii)p 380 2267 V 34 w(tform)1208 2267 y SDict begin H.S end 1208 2267 a Fj(70)1299 2208 y SDict begin H.R end 1299 2208 a 1299 2267 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1299 2267 a 50 2380 a Fj(\014ts)p 177 2380 28 4 v 32 w(binary)p 465 2380 V 32 w(tform)1208 2380 y SDict begin H.S end 1208 2380 a Fj(70)1299 2321 y SDict begin H.R end 1299 2321 a 1299 2380 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1299 2380 a 50 2493 a Fj(\014ts)p 177 2493 28 4 v 32 w(calculator)1208 2493 y SDict begin H.S end 1208 2493 a Fj(61)1299 2434 y SDict begin H.R end 1299 2434 a 1299 2493 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 1299 2493 a 50 2606 a Fj(\014ts)p 177 2606 28 4 v 32 w(calculator)p 596 2606 V 35 w(rng)1208 2606 y SDict begin H.S end 1208 2606 a Fj(61)1299 2547 y SDict begin H.R end 1299 2547 a 1299 2606 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 1299 2606 a 50 2719 a Fj(\014ts)p 177 2719 28 4 v 32 w(calc)p 359 2719 V 35 w(binning[d])1208 2719 y SDict begin H.S end 1208 2719 a Fj(62)1299 2660 y SDict begin H.R end 1299 2660 a 1299 2719 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.6) cvn H.B /ANN pdfmark end 1299 2719 a 50 2832 a Fj(\014ts)p 177 2832 28 4 v 32 w(calc)p 359 2832 V 35 w(ro)m(ws)1208 2832 y SDict begin H.S end 1208 2832 a Fj(60)1299 2773 y SDict begin H.R end 1299 2773 a 1299 2832 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 1299 2832 a 50 2945 a Fj(\014ts)p 177 2945 28 4 v 32 w(c)m(hange)p 478 2945 V 34 w(group)1208 2945 y SDict begin H.S end 1208 2945 a Fj(90)1299 2886 y SDict begin H.R end 1299 2886 a 1299 2945 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 1299 2945 a 50 3057 a Fj(\014ts)p 177 3057 28 4 v 32 w(clean)m(up)p 509 3057 V 33 w(h)m(ttps)1208 3057 y SDict begin H.S end 1208 3057 a Fj(99)1299 2999 y SDict begin H.R end 1299 2999 a 1299 3057 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 1299 3057 a 50 3170 a Fj(\014ts)p 177 3170 28 4 v 32 w(clear)p 395 3170 V 34 w(errmark)1208 3170 y SDict begin H.S end 1208 3170 a Fj(32)1299 3112 y SDict begin H.R end 1299 3112 a 1299 3170 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.1) cvn H.B /ANN pdfmark end 1299 3170 a 50 3283 a Fj(\014ts)p 177 3283 28 4 v 32 w(clear)p 395 3283 V 34 w(errmsg)1208 3283 y SDict begin H.S end 1208 3283 a Fj(32)1299 3225 y SDict begin H.R end 1299 3225 a 1299 3283 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.1) cvn H.B /ANN pdfmark end 1299 3283 a 50 3396 a Fj(\014ts)p 177 3396 28 4 v 32 w(close)p 395 3396 V 34 w(\014le)1208 3396 y SDict begin H.S end 1208 3396 a Fj(35)1299 3338 y SDict begin H.R end 1299 3338 a 1299 3396 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 1299 3396 a 50 3509 a Fj(\014ts)p 177 3509 28 4 v 32 w(compact)p 541 3509 V 34 w(group)1208 3509 y SDict begin H.S end 1208 3509 a Fj(91)1299 3450 y SDict begin H.R end 1299 3450 a 1299 3509 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 1299 3509 a 50 3622 a Fj(\014ts)p 177 3622 28 4 v 32 w(compare)p 542 3622 V 34 w(str)1208 3622 y SDict begin H.S end 1208 3622 a Fj(67)1299 3563 y SDict begin H.R end 1299 3563 a 1299 3622 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1299 3622 a 50 3735 a Fj(\014ts)p 177 3735 28 4 v 32 w(compress)p 569 3735 V 33 w(heap)1163 3735 y SDict begin H.S end 1163 3735 a Fj(116)1299 3676 y SDict begin H.R end 1299 3676 a 1299 3735 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.1) cvn H.B /ANN pdfmark end 1299 3735 a 50 3848 a Fj(\014ts)p 177 3848 28 4 v 32 w(con)m(v)m(ert)p 498 3848 V 35 w(hdr2str)1062 3848 y SDict begin H.S end 1062 3848 a Fj(40)1153 3789 y SDict begin H.R end 1153 3789 a 1153 3848 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 1153 3848 a Fj(,)1208 3848 y SDict begin H.S end 1208 3848 a Fj(86)1299 3789 y SDict begin H.R end 1299 3789 a 1299 3848 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (chapter.7) cvn H.B /ANN pdfmark end 1299 3848 a 50 3961 a Fj(\014ts)p 177 3961 28 4 v 32 w(cop)m(y)p 390 3961 V 34 w(cell2image)1208 3961 y SDict begin H.S end 1208 3961 a Fj(44)1299 3902 y SDict begin H.R end 1299 3902 a 1299 3961 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 1299 3961 a 50 4074 a Fj(\014ts)p 177 4074 28 4 v 32 w(cop)m(y)p 390 4074 V 34 w(col)1208 4074 y SDict begin H.S end 1208 4074 a Fj(57)1299 4015 y SDict begin H.R end 1299 4015 a 1299 4074 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 1299 4074 a 50 4187 a Fj(\014ts)p 177 4187 28 4 v 32 w(cop)m(y)p 390 4187 V 34 w(cols)1208 4187 y SDict begin H.S end 1208 4187 a Fj(57)1299 4128 y SDict begin H.R end 1299 4128 a 1299 4187 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 1299 4187 a 50 4299 a Fj(\014ts)p 177 4299 28 4 v 32 w(cop)m(y)p 390 4299 V 34 w(data)1163 4299 y SDict begin H.S end 1163 4299 a Fj(101)1299 4241 y SDict begin H.R end 1299 4241 a 1299 4299 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 1299 4299 a 50 4412 a Fj(\014ts)p 177 4412 28 4 v 32 w(cop)m(y)p 390 4412 V 34 w(\014le)1208 4412 y SDict begin H.S end 1208 4412 a Fj(36)1299 4354 y SDict begin H.R end 1299 4354 a 1299 4412 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 1299 4412 a 50 4525 a Fj(\014ts)p 177 4525 28 4 v 32 w(cop)m(y)p 390 4525 V 34 w(group)1208 4525 y SDict begin H.S end 1208 4525 a Fj(91)1299 4467 y SDict begin H.R end 1299 4467 a 1299 4525 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 1299 4525 a 50 4638 a Fj(\014ts)p 177 4638 28 4 v 32 w(cop)m(y)p 390 4638 V 34 w(hdu)1208 4638 y SDict begin H.S end 1208 4638 a Fj(37)1299 4580 y SDict begin H.R end 1299 4580 a 1299 4638 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 1299 4638 a 50 4751 a Fj(\014ts)p 177 4751 28 4 v 32 w(cop)m(y)p 390 4751 V 34 w(header)1208 4751 y SDict begin H.S end 1208 4751 a Fj(37)1299 4692 y SDict begin H.R end 1299 4692 a 1299 4751 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 1299 4751 a 50 4864 a Fj(\014ts)p 177 4864 28 4 v 32 w(cop)m(y)p 390 4864 V 34 w(image2cell)1208 4864 y SDict begin H.S end 1208 4864 a Fj(44)1299 4805 y SDict begin H.R end 1299 4805 a 1299 4864 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 1299 4864 a 50 4977 a Fj(\014ts)p 177 4977 28 4 v 32 w(cop)m(y)p 390 4977 V 34 w(image)p 655 4977 V 34 w(section)1208 4977 y SDict begin H.S end 1208 4977 a Fj(47)1299 4918 y SDict begin H.R end 1299 4918 a 1299 4977 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 1299 4977 a 50 5090 a Fj(\014ts)p 177 5090 28 4 v 32 w(cop)m(y)p 390 5090 V 34 w(k)m(ey)1163 5090 y SDict begin H.S end 1163 5090 a Fj(106)1299 5031 y SDict begin H.R end 1299 5031 a 1299 5090 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 1299 5090 a 50 5203 a Fj(\014ts)p 177 5203 28 4 v 32 w(cop)m(y)p 390 5203 V 34 w(mem)m(b)s(er)1208 5203 y SDict begin H.S end 1208 5203 a Fj(93)1299 5144 y SDict begin H.R end 1299 5144 a 1299 5203 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.2) cvn H.B /ANN pdfmark end 1299 5203 a 50 5316 a Fj(\014ts)p 177 5316 28 4 v 32 w(cop)m(y)p 390 5316 V 34 w(pixlist2image)1208 5316 y SDict begin H.S end 1208 5316 a Fj(62)1299 5257 y SDict begin H.R end 1299 5257 a 1299 5316 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.6) cvn H.B /ANN pdfmark end 1299 5316 a 50 5429 a Fj(\014ts)p 177 5429 28 4 v 32 w(cop)m(y)p 390 5429 V 34 w(ro)m(ws)1208 5429 y SDict begin H.S end 1208 5429 a Fj(57)1299 5370 y SDict begin H.R end 1299 5370 a 1299 5429 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 1299 5429 a 50 5541 a Fj(\014ts)p 177 5541 28 4 v 32 w(create)p 445 5541 V 35 w(disk\014le)1208 5541 y SDict begin H.S end 1208 5541 a Fj(34)1299 5483 y SDict begin H.R end 1299 5483 a 1299 5541 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 1299 5541 a 50 5654 a Fj(\014ts)p 177 5654 28 4 v 32 w(create)p 445 5654 V 35 w(\014le)1208 5654 y SDict begin H.S end 1208 5654 a Fj(34)1299 5596 y SDict begin H.R end 1299 5596 a 1299 5654 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 1299 5654 a 1419 2154 a Fj(\014ts)p 1546 2154 28 4 v 32 w(create)p 1814 2154 V 35 w(group)2701 2154 y SDict begin H.S end 2701 2154 a Fj(90)2792 2096 y SDict begin H.R end 2792 2096 a 2792 2154 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 2792 2154 a 1419 2267 a Fj(\014ts)p 1546 2267 28 4 v 32 w(create)p 1814 2267 V 35 w(hdu)2656 2267 y SDict begin H.S end 2656 2267 a Fj(100)2792 2208 y SDict begin H.R end 2792 2208 a 2792 2267 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 2792 2267 a 1419 2380 a Fj(\014ts)p 1546 2380 28 4 v 32 w(create)p 1814 2380 V 35 w(img)2701 2380 y SDict begin H.S end 2701 2380 a Fj(44)2792 2321 y SDict begin H.R end 2792 2321 a 2792 2380 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 2792 2380 a 1419 2493 a Fj(\014ts)p 1546 2493 28 4 v 32 w(create)p 1814 2493 V 35 w(mem\014le)2701 2493 y SDict begin H.S end 2701 2493 a Fj(96)2792 2434 y SDict begin H.R end 2792 2434 a 2792 2493 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 2792 2493 a 1419 2606 a Fj(\014ts)p 1546 2606 28 4 v 32 w(create)p 1814 2606 V 35 w(tbl)2701 2606 y SDict begin H.S end 2701 2606 a Fj(52)2792 2547 y SDict begin H.R end 2792 2547 a 2792 2606 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.1) cvn H.B /ANN pdfmark end 2792 2606 a 1419 2719 a Fj(\014ts)p 1546 2719 28 4 v 32 w(create)p 1814 2719 V 35 w(template)2701 2719 y SDict begin H.S end 2701 2719 a Fj(96)2792 2660 y SDict begin H.R end 2792 2660 a 2792 2719 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 2792 2719 a 1419 2832 a Fj(\014ts)p 1546 2832 28 4 v 32 w(date2str)2701 2832 y SDict begin H.S end 2701 2832 a Fj(65)2792 2773 y SDict begin H.R end 2792 2773 a 2792 2832 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.2) cvn H.B /ANN pdfmark end 2792 2832 a 1419 2945 a Fj(\014ts)p 1546 2945 28 4 v 32 w(deco)s(de)p 1848 2945 V 33 w(c)m(hksum)2701 2945 y SDict begin H.S end 2701 2945 a Fj(65)2792 2886 y SDict begin H.R end 2792 2886 a 2792 2945 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.1) cvn H.B /ANN pdfmark end 2792 2945 a 1419 3057 a Fj(\014ts)p 1546 3057 28 4 v 32 w(deco)s(de)p 1848 3057 V 33 w(tdim)2701 3057 y SDict begin H.S end 2701 3057 a Fj(55)2792 2999 y SDict begin H.R end 2792 2999 a 2792 3057 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 2792 3057 a 1419 3170 a Fj(\014ts)p 1546 3170 28 4 v 32 w(delete)p 1809 3170 V 34 w(col)2701 3170 y SDict begin H.S end 2701 3170 a Fj(56)2792 3112 y SDict begin H.R end 2792 3112 a 2792 3170 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 2792 3170 a 1419 3283 a Fj(\014ts)p 1546 3283 28 4 v 32 w(delete)p 1809 3283 V 34 w(\014le)2701 3283 y SDict begin H.S end 2701 3283 a Fj(35)2792 3225 y SDict begin H.R end 2792 3225 a 2792 3283 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 2792 3283 a 1419 3396 a Fj(\014ts)p 1546 3396 28 4 v 32 w(delete)p 1809 3396 V 34 w(hdu)2701 3396 y SDict begin H.S end 2701 3396 a Fj(37)2792 3338 y SDict begin H.R end 2792 3338 a 2792 3396 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 2792 3396 a 1419 3509 a Fj(\014ts)p 1546 3509 28 4 v 32 w(delete)p 1809 3509 V 34 w(k)m(ey)2701 3509 y SDict begin H.S end 2701 3509 a Fj(42)2792 3450 y SDict begin H.R end 2792 3450 a 2792 3509 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 2792 3509 a 1419 3622 a Fj(\014ts)p 1546 3622 28 4 v 32 w(delete)p 1809 3622 V 34 w(record)2701 3622 y SDict begin H.S end 2701 3622 a Fj(42)2792 3563 y SDict begin H.R end 2792 3563 a 2792 3622 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 2792 3622 a 1419 3735 a Fj(\014ts)p 1546 3735 28 4 v 32 w(delete)p 1809 3735 V 34 w(ro)m(wlist)2701 3735 y SDict begin H.S end 2701 3735 a Fj(56)2792 3676 y SDict begin H.R end 2792 3676 a 2792 3735 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 2792 3735 a 1419 3848 a Fj(\014ts)p 1546 3848 28 4 v 32 w(delete)p 1809 3848 V 34 w(ro)m(wrange)2701 3848 y SDict begin H.S end 2701 3848 a Fj(56)2792 3789 y SDict begin H.R end 2792 3789 a 2792 3848 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 2792 3848 a 1419 3961 a Fj(\014ts)p 1546 3961 28 4 v 32 w(delete)p 1809 3961 V 34 w(ro)m(ws)2701 3961 y SDict begin H.S end 2701 3961 a Fj(56)2792 3902 y SDict begin H.R end 2792 3902 a 2792 3961 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 2792 3961 a 1419 4074 a Fj(\014ts)p 1546 4074 28 4 v 32 w(delete)p 1809 4074 V 34 w(str)2701 4074 y SDict begin H.S end 2701 4074 a Fj(42)2792 4015 y SDict begin H.R end 2792 4015 a 2792 4074 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 2792 4074 a 1419 4187 a Fj(\014ts)p 1546 4187 28 4 v 32 w(enco)s(de)p 1848 4187 V 33 w(c)m(hksum)2701 4187 y SDict begin H.S end 2701 4187 a Fj(65)2792 4128 y SDict begin H.R end 2792 4128 a 2792 4187 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.1) cvn H.B /ANN pdfmark end 2792 4187 a 1419 4299 a Fj(\014ts)p 1546 4299 28 4 v 32 w(\014le)p 1694 4299 V 33 w(exists)2701 4299 y SDict begin H.S end 2701 4299 a Fj(98)2792 4241 y SDict begin H.R end 2792 4241 a 2792 4299 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 2792 4299 a 1419 4412 a Fj(\014ts)p 1546 4412 28 4 v 32 w(\014le)p 1694 4412 V 33 w(mo)s(de)2701 4412 y SDict begin H.S end 2701 4412 a Fj(35)2792 4354 y SDict begin H.R end 2792 4354 a 2792 4412 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 2792 4412 a 1419 4525 a Fj(\014ts)p 1546 4525 28 4 v 32 w(\014le)p 1694 4525 V 33 w(name)2701 4525 y SDict begin H.S end 2701 4525 a Fj(35)2792 4467 y SDict begin H.R end 2792 4467 a 2792 4525 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 2792 4525 a 1419 4638 a Fj(\014ts)p 1546 4638 28 4 v 32 w(\014nd)p 1731 4638 V 32 w(\014rst)p 1921 4638 V 32 w(ro)m(w)2701 4638 y SDict begin H.S end 2701 4638 a Fj(60)2792 4580 y SDict begin H.R end 2792 4580 a 2792 4638 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 2792 4638 a 1419 4751 a Fj(\014ts)p 1546 4751 28 4 v 32 w(\014nd)p 1731 4751 V 32 w(nextk)m(ey)2701 4751 y SDict begin H.S end 2701 4751 a Fj(39)2792 4692 y SDict begin H.R end 2792 4692 a 2792 4751 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2792 4751 a 1419 4864 a Fj(\014ts)p 1546 4864 28 4 v 32 w(\014nd)p 1731 4864 V 32 w(ro)m(ws)2701 4864 y SDict begin H.S end 2701 4864 a Fj(60)2792 4805 y SDict begin H.R end 2792 4805 a 2792 4864 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 2792 4864 a 1419 4977 a Fj(\014ts)p 1546 4977 28 4 v 32 w(\015ush)p 1767 4977 V 32 w(bu\013er)2701 4977 y SDict begin H.S end 2701 4977 a Fj(98)2792 4918 y SDict begin H.R end 2792 4918 a 2792 4977 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 2792 4977 a 1419 5090 a Fj(\014ts)p 1546 5090 28 4 v 32 w(\015ush)p 1767 5090 V 32 w(\014le)2701 5090 y SDict begin H.S end 2701 5090 a Fj(98)2792 5031 y SDict begin H.R end 2792 5031 a 2792 5090 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 2792 5090 a 1419 5203 a Fj(\014ts)p 1546 5203 28 4 v 32 w(free)p 1722 5203 V 33 w(memory)2509 5203 y SDict begin H.S end 2509 5203 a Fj(108)2645 5144 y SDict begin H.R end 2645 5144 a 2645 5203 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.5) cvn H.B /ANN pdfmark end 2645 5203 a Fj(,)2701 5203 y SDict begin H.S end 2701 5203 a Fj(40)2792 5144 y SDict begin H.R end 2792 5144 a 2792 5203 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2792 5203 a 1419 5316 a Fj(\014ts)p 1546 5316 28 4 v 32 w(get)p 1698 5316 V 34 w(acolparms)2656 5316 y SDict begin H.S end 2656 5316 a Fj(115)2792 5257 y SDict begin H.R end 2792 5257 a 2792 5316 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.1) cvn H.B /ANN pdfmark end 2792 5316 a 1419 5429 a Fj(\014ts)p 1546 5429 28 4 v 32 w(get)p 1698 5429 V 34 w(b)s(colparms)2656 5429 y SDict begin H.S end 2656 5429 a Fj(115)2792 5370 y SDict begin H.R end 2792 5370 a 2792 5429 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.1) cvn H.B /ANN pdfmark end 2792 5429 a 1419 5541 a Fj(\014ts)p 1546 5541 28 4 v 32 w(get)p 1698 5541 V 34 w(c)m(hksum)2701 5541 y SDict begin H.S end 2701 5541 a Fj(64)2792 5483 y SDict begin H.R end 2792 5483 a 2792 5541 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.1) cvn H.B /ANN pdfmark end 2792 5541 a 1419 5654 a Fj(\014ts)p 1546 5654 28 4 v 32 w(get)p 1698 5654 V 34 w(col)p 1842 5654 V 34 w(displa)m(y)p 2154 5654 V 33 w(width)2701 5654 y SDict begin H.S end 2701 5654 a Fj(55)2792 5596 y SDict begin H.R end 2792 5596 a 2792 5654 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 2792 5654 a 2912 2154 a Fj(\014ts)p 3039 2154 28 4 v 32 w(get)p 3191 2154 V 34 w(colname)4053 2154 y SDict begin H.S end 4053 2154 a Fj(53)4144 2096 y SDict begin H.R end 4144 2096 a 4144 2154 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 4144 2154 a 2912 2267 a Fj(\014ts)p 3039 2267 28 4 v 32 w(get)p 3191 2267 V 34 w(coln)m(um)4053 2267 y SDict begin H.S end 4053 2267 a Fj(53)4144 2208 y SDict begin H.R end 4144 2208 a 4144 2267 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 4144 2267 a 2912 2380 a Fj(\014ts)p 3039 2380 28 4 v 32 w(get)p 3191 2380 V 34 w(colt)m(yp)s(e)4053 2380 y SDict begin H.S end 4053 2380 a Fj(54)4144 2321 y SDict begin H.R end 4144 2321 a 4144 2380 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 4144 2380 a 2912 2493 a Fj(\014ts)p 3039 2493 28 4 v 32 w(get)p 3191 2493 V 34 w(compression)p 3706 2493 V 33 w(t)m(yp)s(e)4053 2493 y SDict begin H.S end 4053 2493 a Fj(50)4144 2434 y SDict begin H.R end 4144 2434 a 4144 2493 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.6) cvn H.B /ANN pdfmark end 4144 2493 a 2912 2606 a Fj(\014ts)p 3039 2606 28 4 v 32 w(get)p 3191 2606 V 34 w(eqcolt)m(yp)s(e)4053 2606 y SDict begin H.S end 4053 2606 a Fj(54)4144 2547 y SDict begin H.R end 4144 2547 a 4144 2606 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 4144 2606 a 2912 2719 a Fj(\014ts)p 3039 2719 28 4 v 32 w(get)p 3191 2719 V 34 w(errstatus)4053 2719 y SDict begin H.S end 4053 2719 a Fj(31)4144 2660 y SDict begin H.R end 4144 2660 a 4144 2719 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.1) cvn H.B /ANN pdfmark end 4144 2719 a 2912 2832 a Fj(\014ts)p 3039 2832 28 4 v 32 w(get)p 3191 2832 V 34 w(hdrp)s(os)4008 2832 y SDict begin H.S end 4008 2832 a Fj(102)4144 2773 y SDict begin H.R end 4144 2773 a 4144 2832 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.1) cvn H.B /ANN pdfmark end 4144 2832 a 2912 2945 a Fj(\014ts)p 3039 2945 28 4 v 32 w(get)p 3191 2945 V 34 w(hdrspace)4053 2945 y SDict begin H.S end 4053 2945 a Fj(38)4144 2886 y SDict begin H.R end 4144 2886 a 4144 2945 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 4144 2945 a 2912 3057 a Fj(\014ts)p 3039 3057 28 4 v 32 w(get)p 3191 3057 V 34 w(hdu)p 3378 3057 V 31 w(n)m(um)4053 3057 y SDict begin H.S end 4053 3057 a Fj(36)4144 2999 y SDict begin H.R end 4144 2999 a 4144 3057 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 4144 3057 a 2912 3170 a Fj(\014ts)p 3039 3170 28 4 v 32 w(get)p 3191 3170 V 34 w(hdu)p 3378 3170 V 31 w(t)m(yp)s(e)4053 3170 y SDict begin H.S end 4053 3170 a Fj(36)4144 3112 y SDict begin H.R end 4144 3112 a 4144 3170 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 4144 3170 a 2912 3283 a Fj(\014ts)p 3039 3283 28 4 v 32 w(get)p 3191 3283 V 34 w(hduaddr)4008 3283 y SDict begin H.S end 4008 3283 a Fj(100)4144 3225 y SDict begin H.R end 4144 3225 a 4144 3283 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 4144 3283 a 2912 3396 a Fj(\014ts)p 3039 3396 28 4 v 32 w(get)p 3191 3396 V 34 w(hduaddrll)4008 3396 y SDict begin H.S end 4008 3396 a Fj(100)4144 3338 y SDict begin H.R end 4144 3338 a 4144 3396 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 4144 3396 a 2912 3509 a Fj(\014ts)p 3039 3509 28 4 v 32 w(get)p 3191 3509 V 34 w(img)p 3371 3509 V 33 w(dim)4053 3509 y SDict begin H.S end 4053 3509 a Fj(43)4144 3450 y SDict begin H.R end 4144 3450 a 4144 3509 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 4144 3509 a 2912 3622 a Fj(\014ts)p 3039 3622 28 4 v 32 w(get)p 3191 3622 V 34 w(img)p 3371 3622 V 33 w(equivt)m(yp)s(e)4053 3622 y SDict begin H.S end 4053 3622 a Fj(43)4144 3563 y SDict begin H.R end 4144 3563 a 4144 3622 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 4144 3622 a 2912 3735 a Fj(\014ts)p 3039 3735 28 4 v 32 w(get)p 3191 3735 V 34 w(img)p 3371 3735 V 33 w(param)4053 3735 y SDict begin H.S end 4053 3735 a Fj(43)4144 3676 y SDict begin H.R end 4144 3676 a 4144 3735 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 4144 3735 a 2912 3848 a Fj(\014ts)p 3039 3848 28 4 v 32 w(get)p 3191 3848 V 34 w(img)p 3371 3848 V 33 w(size)4053 3848 y SDict begin H.S end 4053 3848 a Fj(43)4144 3789 y SDict begin H.R end 4144 3789 a 4144 3848 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 4144 3848 a 2912 3961 a Fj(\014ts)p 3039 3961 28 4 v 32 w(get)p 3191 3961 V 34 w(img)p 3371 3961 V 33 w(t)m(yp)s(e)4053 3961 y SDict begin H.S end 4053 3961 a Fj(43)4144 3902 y SDict begin H.R end 4144 3902 a 4144 3961 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 4144 3961 a 2912 4074 a Fj(\014ts)p 3039 4074 28 4 v 32 w(get)p 3191 4074 V 34 w(in)m(tt)m(yp)s(e)4053 4074 y SDict begin H.S end 4053 4074 a Fj(69)4144 4015 y SDict begin H.R end 4144 4015 a 4144 4074 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 4144 4074 a 2912 4187 a Fj(\014ts)p 3039 4187 28 4 v 32 w(get)p 3191 4187 V 34 w(k)m(ey)p 3358 4187 V 34 w(strlen)4053 4187 y SDict begin H.S end 4053 4187 a Fj(39)4144 4128 y SDict begin H.R end 4144 4128 a 4144 4187 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 4144 4187 a 2912 4299 a Fj(\014ts)p 3039 4299 28 4 v 32 w(get)p 3191 4299 V 34 w(k)m(eyclass)4053 4299 y SDict begin H.S end 4053 4299 a Fj(69)4144 4241 y SDict begin H.R end 4144 4241 a 4144 4299 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 4144 4299 a 2912 4412 a Fj(\014ts)p 3039 4412 28 4 v 32 w(get)p 3191 4412 V 34 w(k)m(eyname)4053 4412 y SDict begin H.S end 4053 4412 a Fj(68)4144 4354 y SDict begin H.R end 4144 4354 a 4144 4412 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 4144 4412 a 2912 4525 a Fj(\014ts)p 3039 4525 28 4 v 32 w(get)p 3191 4525 V 34 w(k)m(eyt)m(yp)s(e)4053 4525 y SDict begin H.S end 4053 4525 a Fj(69)4144 4467 y SDict begin H.R end 4144 4467 a 4144 4525 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 4144 4525 a 2912 4638 a Fj(\014ts)p 3039 4638 28 4 v 32 w(get)p 3191 4638 V 34 w(noise)p 3422 4638 V 33 w(bits)4053 4638 y SDict begin H.S end 4053 4638 a Fj(50)4144 4580 y SDict begin H.R end 4144 4580 a 4144 4638 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.6) cvn H.B /ANN pdfmark end 4144 4638 a 2912 4751 a Fj(\014ts)p 3039 4751 28 4 v 32 w(get)p 3191 4751 V 34 w(n)m(um)p 3400 4751 V 32 w(cols)4053 4751 y SDict begin H.S end 4053 4751 a Fj(53)4144 4692 y SDict begin H.R end 4144 4692 a 4144 4751 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 4144 4751 a 2912 4864 a Fj(\014ts)p 3039 4864 28 4 v 32 w(get)p 3191 4864 V 34 w(n)m(um)p 3400 4864 V 32 w(groups)4053 4864 y SDict begin H.S end 4053 4864 a Fj(93)4144 4805 y SDict begin H.R end 4144 4805 a 4144 4864 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.2) cvn H.B /ANN pdfmark end 4144 4864 a 2912 4977 a Fj(\014ts)p 3039 4977 28 4 v 32 w(get)p 3191 4977 V 34 w(n)m(um)p 3400 4977 V 32 w(hdus)4053 4977 y SDict begin H.S end 4053 4977 a Fj(36)4144 4918 y SDict begin H.R end 4144 4918 a 4144 4977 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 4144 4977 a 2912 5090 a Fj(\014ts)p 3039 5090 28 4 v 32 w(get)p 3191 5090 V 34 w(n)m(um)p 3400 5090 V 32 w(mem)m(b)s(ers)4053 5090 y SDict begin H.S end 4053 5090 a Fj(92)4144 5031 y SDict begin H.R end 4144 5031 a 4144 5090 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.2) cvn H.B /ANN pdfmark end 4144 5090 a 2912 5203 a Fj(\014ts)p 3039 5203 28 4 v 32 w(get)p 3191 5203 V 34 w(n)m(um)p 3400 5203 V 32 w(ro)m(ws)4053 5203 y SDict begin H.S end 4053 5203 a Fj(53)4144 5144 y SDict begin H.R end 4144 5144 a 4144 5203 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 4144 5203 a 2912 5316 a Fj(\014ts)p 3039 5316 28 4 v 32 w(get)p 3191 5316 V 34 w(ro)m(wsize)4008 5316 y SDict begin H.S end 4008 5316 a Fj(116)4144 5257 y SDict begin H.R end 4144 5257 a 4144 5316 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.1) cvn H.B /ANN pdfmark end 4144 5316 a 2912 5429 a Fj(\014ts)p 3039 5429 28 4 v 32 w(get)p 3191 5429 V 34 w(system)p 3496 5429 V 33 w(time)4053 5429 y SDict begin H.S end 4053 5429 a Fj(65)4144 5370 y SDict begin H.R end 4144 5370 a 4144 5429 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.2) cvn H.B /ANN pdfmark end 4144 5429 a 2912 5541 a Fj(\014ts)p 3039 5541 28 4 v 32 w(get)p 3191 5541 V 34 w(tb)s(col)4053 5541 y SDict begin H.S end 4053 5541 a Fj(71)4144 5483 y SDict begin H.R end 4144 5483 a 4144 5541 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 4144 5541 a 2912 5654 a Fj(\014ts)p 3039 5654 28 4 v 32 w(get)p 3191 5654 V 34 w(tile)p 3350 5654 V 34 w(dim)4053 5654 y SDict begin H.S end 4053 5654 a Fj(50)4144 5596 y SDict begin H.R end 4144 5596 a 4144 5654 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.6) cvn H.B /ANN pdfmark end 4144 5654 a 1882 5942 a Fj(173)p eop end %%Page: 174 182 TeXDict begin 174 181 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.174) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(174)2084 b Fh(APPENDIX)31 b(A.)61 b(INDEX)31 b(OF)f(R)m(OUTINES)50 543 y Fj(\014ts)p 177 543 28 4 v 32 w(get)p 329 543 V 34 w(timeout)1264 543 y SDict begin H.S end 1264 543 a Fj(99)1355 484 y SDict begin H.R end 1355 484 a 1355 543 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.2) cvn H.B /ANN pdfmark end 1355 543 a 50 656 a Fj(\014ts)p 177 656 28 4 v 32 w(get)p 329 656 V 34 w(v)m(ersion)1264 656 y SDict begin H.S end 1264 656 a Fj(66)1355 597 y SDict begin H.R end 1355 597 a 1355 656 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1355 656 a 50 769 a Fj(\014ts)p 177 769 28 4 v 32 w(hdr2str)1118 769 y SDict begin H.S end 1118 769 a Fj(40)1208 710 y SDict begin H.R end 1208 710 a 1208 769 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 1208 769 a Fj(,)1264 769 y SDict begin H.S end 1264 769 a Fj(86)1355 710 y SDict begin H.R end 1355 710 a 1355 769 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (chapter.7) cvn H.B /ANN pdfmark end 1355 769 a 50 882 a Fj(\014ts)p 177 882 28 4 v 32 w(init)p 345 882 V 33 w(h)m(ttps)1264 882 y SDict begin H.S end 1264 882 a Fj(99)1355 823 y SDict begin H.R end 1355 823 a 1355 882 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 1355 882 a 50 995 a Fj(\014ts)p 177 995 28 4 v 32 w(insert)p 432 995 V 33 w(atbl)1219 995 y SDict begin H.S end 1219 995 a Fj(101)1355 936 y SDict begin H.R end 1355 936 a 1355 995 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 1355 995 a 50 1107 a Fj(\014ts)p 177 1107 28 4 v 32 w(insert)p 432 1107 V 33 w(btbl)1219 1107 y SDict begin H.S end 1219 1107 a Fj(101)1355 1049 y SDict begin H.R end 1355 1049 a 1355 1107 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 1355 1107 a 50 1220 a Fj(\014ts)p 177 1220 28 4 v 32 w(insert)p 432 1220 V 33 w(col)1264 1220 y SDict begin H.S end 1264 1220 a Fj(56)1355 1162 y SDict begin H.R end 1355 1162 a 1355 1220 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 1355 1220 a 50 1333 a Fj(\014ts)p 177 1333 28 4 v 32 w(insert)p 432 1333 V 33 w(cols)1264 1333 y SDict begin H.S end 1264 1333 a Fj(56)1355 1275 y SDict begin H.R end 1355 1275 a 1355 1333 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 1355 1333 a 50 1446 a Fj(\014ts)p 177 1446 28 4 v 32 w(insert)p 432 1446 V 33 w(group)1264 1446 y SDict begin H.S end 1264 1446 a Fj(90)1355 1388 y SDict begin H.R end 1355 1388 a 1355 1446 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 1355 1446 a 50 1559 a Fj(\014ts)p 177 1559 28 4 v 32 w(insert)p 432 1559 V 33 w(img)1219 1559 y SDict begin H.S end 1219 1559 a Fj(100)1355 1501 y SDict begin H.R end 1355 1501 a 1355 1559 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 1355 1559 a 50 1672 a Fj(\014ts)p 177 1672 28 4 v 32 w(insert)p 432 1672 V 33 w(k)m(ey)p 598 1672 V 34 w(n)m(ull)1219 1672 y SDict begin H.S end 1219 1672 a Fj(107)1355 1613 y SDict begin H.R end 1355 1613 a 1355 1672 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.4) cvn H.B /ANN pdfmark end 1355 1672 a 50 1785 a Fj(\014ts)p 177 1785 28 4 v 32 w(insert)p 432 1785 V 33 w(k)m(ey)p 598 1785 V 34 w(TYP)1219 1785 y SDict begin H.S end 1219 1785 a Fj(107)1355 1726 y SDict begin H.R end 1355 1726 a 1355 1785 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.4) cvn H.B /ANN pdfmark end 1355 1785 a 50 1898 a Fj(\014ts)p 177 1898 28 4 v 32 w(insert)p 432 1898 V 33 w(record)1219 1898 y SDict begin H.S end 1219 1898 a Fj(107)1355 1839 y SDict begin H.R end 1355 1839 a 1355 1898 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.4) cvn H.B /ANN pdfmark end 1355 1898 a 50 2011 a Fj(\014ts)p 177 2011 28 4 v 32 w(insert)p 432 2011 V 33 w(ro)m(ws)1264 2011 y SDict begin H.S end 1264 2011 a Fj(56)1355 1952 y SDict begin H.R end 1355 1952 a 1355 2011 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 1355 2011 a 50 2124 a Fj(\014ts)p 177 2124 28 4 v 32 w(is)p 270 2124 V 33 w(reen)m(tran)m(t)1264 2124 y SDict begin H.S end 1264 2124 a Fj(76)1355 2065 y SDict begin H.R end 1355 2065 a 1355 2124 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1355 2124 a 50 2237 a Fj(\014ts)p 177 2237 28 4 v 32 w(iterate)p 465 2237 V 35 w(data)1264 2237 y SDict begin H.S end 1264 2237 a Fj(83)1355 2178 y SDict begin H.R end 1355 2178 a 1355 2237 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.6.4) cvn H.B /ANN pdfmark end 1355 2237 a 50 2349 a Fj(\014ts)p 177 2349 28 4 v 32 w(mak)m(e)p 415 2349 V 34 w(hist[d])1264 2349 y SDict begin H.S end 1264 2349 a Fj(63)1355 2291 y SDict begin H.R end 1355 2291 a 1355 2349 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.6) cvn H.B /ANN pdfmark end 1355 2349 a 50 2462 a Fj(\014ts)p 177 2462 28 4 v 32 w(mak)m(e)p 415 2462 V 34 w(k)m(ey)1264 2462 y SDict begin H.S end 1264 2462 a Fj(68)1355 2404 y SDict begin H.R end 1355 2404 a 1355 2462 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1355 2462 a 50 2575 a Fj(\014ts)p 177 2575 28 4 v 32 w(mak)m(e)p 415 2575 V 34 w(k)m(eyn)1264 2575 y SDict begin H.S end 1264 2575 a Fj(68)1355 2517 y SDict begin H.R end 1355 2517 a 1355 2575 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1355 2575 a 50 2688 a Fj(\014ts)p 177 2688 28 4 v 32 w(mak)m(e)p 415 2688 V 34 w(nk)m(ey)1264 2688 y SDict begin H.S end 1264 2688 a Fj(68)1355 2630 y SDict begin H.R end 1355 2630 a 1355 2688 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1355 2688 a 50 2801 a Fj(\014ts)p 177 2801 28 4 v 32 w(merge)p 446 2801 V 34 w(groups)1264 2801 y SDict begin H.S end 1264 2801 a Fj(91)1355 2743 y SDict begin H.R end 1355 2743 a 1355 2801 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 1355 2801 a 50 2914 a Fj(\014ts)p 177 2914 28 4 v 32 w(mo)s(dify)p 485 2914 V 32 w(card)1219 2914 y SDict begin H.S end 1219 2914 a Fj(109)1355 2855 y SDict begin H.R end 1355 2855 a 1355 2914 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.6) cvn H.B /ANN pdfmark end 1355 2914 a 50 3027 a Fj(\014ts)p 177 3027 28 4 v 32 w(mo)s(dify)p 485 3027 V 32 w(commen)m(t)1264 3027 y SDict begin H.S end 1264 3027 a Fj(42)1355 2968 y SDict begin H.R end 1355 2968 a 1355 3027 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 1355 3027 a 50 3140 a Fj(\014ts)p 177 3140 28 4 v 32 w(mo)s(dify)p 485 3140 V 32 w(k)m(ey)p 650 3140 V 34 w(n)m(ull)1219 3140 y SDict begin H.S end 1219 3140 a Fj(110)1355 3081 y SDict begin H.R end 1355 3081 a 1355 3140 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.6) cvn H.B /ANN pdfmark end 1355 3140 a 50 3253 a Fj(\014ts)p 177 3253 28 4 v 32 w(mo)s(dify)p 485 3253 V 32 w(k)m(ey)p 650 3253 V 34 w(TYP)1219 3253 y SDict begin H.S end 1219 3253 a Fj(109)1355 3194 y SDict begin H.R end 1355 3194 a 1355 3253 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.6) cvn H.B /ANN pdfmark end 1355 3253 a 50 3366 a Fj(\014ts)p 177 3366 28 4 v 32 w(mo)s(dify)p 485 3366 V 32 w(name)1264 3366 y SDict begin H.S end 1264 3366 a Fj(42)1355 3307 y SDict begin H.R end 1355 3307 a 1355 3366 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 1355 3366 a 50 3479 a Fj(\014ts)p 177 3479 28 4 v 32 w(mo)s(dify)p 485 3479 V 32 w(record)1219 3479 y SDict begin H.S end 1219 3479 a Fj(109)1355 3420 y SDict begin H.R end 1355 3420 a 1355 3479 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.6) cvn H.B /ANN pdfmark end 1355 3479 a 50 3591 a Fj(\014ts)p 177 3591 28 4 v 32 w(mo)s(dify)p 485 3591 V 32 w(v)m(ector)p 758 3591 V 35 w(len)1264 3591 y SDict begin H.S end 1264 3591 a Fj(57)1355 3533 y SDict begin H.R end 1355 3533 a 1355 3591 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 1355 3591 a 50 3704 a Fj(\014ts)p 177 3704 28 4 v 32 w(mo)m(v)-5 b(abs)p 502 3704 V 33 w(hdu)1264 3704 y SDict begin H.S end 1264 3704 a Fj(36)1355 3646 y SDict begin H.R end 1355 3646 a 1355 3704 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 1355 3704 a 50 3817 a Fj(\014ts)p 177 3817 28 4 v 32 w(mo)m(vnam)p 547 3817 V 33 w(hdu)1264 3817 y SDict begin H.S end 1264 3817 a Fj(36)1355 3759 y SDict begin H.R end 1355 3759 a 1355 3817 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 1355 3817 a 50 3930 a Fj(\014ts)p 177 3930 28 4 v 32 w(mo)m(vrel)p 476 3930 V 34 w(hdu)1264 3930 y SDict begin H.S end 1264 3930 a Fj(36)1355 3872 y SDict begin H.R end 1355 3872 a 1355 3930 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 1355 3930 a 50 4043 a Fj(\014ts)p 177 4043 28 4 v 32 w(n)m(ull)p 358 4043 V 33 w(c)m(hec)m(k)1264 4043 y SDict begin H.S end 1264 4043 a Fj(68)1355 3985 y SDict begin H.R end 1355 3985 a 1355 4043 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1355 4043 a 50 4156 a Fj(\014ts)p 177 4156 28 4 v 32 w(op)s(en)p 399 4156 V 32 w(data)1264 4156 y SDict begin H.S end 1264 4156 a Fj(32)1355 4097 y SDict begin H.R end 1355 4097 a 1355 4156 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 1355 4156 a 50 4269 a Fj(\014ts)p 177 4269 28 4 v 32 w(op)s(en)p 399 4269 V 32 w(disk\014le)1264 4269 y SDict begin H.S end 1264 4269 a Fj(32)1355 4210 y SDict begin H.R end 1355 4210 a 1355 4269 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 1355 4269 a 50 4382 a Fj(\014ts)p 177 4382 28 4 v 32 w(op)s(en)p 399 4382 V 32 w(extlist)1264 4382 y SDict begin H.S end 1264 4382 a Fj(32)1355 4323 y SDict begin H.R end 1355 4323 a 1355 4382 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 1355 4382 a 50 4495 a Fj(\014ts)p 177 4495 28 4 v 32 w(op)s(en)p 399 4495 V 32 w(\014le)1264 4495 y SDict begin H.S end 1264 4495 a Fj(32)1355 4436 y SDict begin H.R end 1355 4436 a 1355 4495 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 1355 4495 a 50 4608 a Fj(\014ts)p 177 4608 28 4 v 32 w(op)s(en)p 399 4608 V 32 w(image)1264 4608 y SDict begin H.S end 1264 4608 a Fj(32)1355 4549 y SDict begin H.R end 1355 4549 a 1355 4608 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 1355 4608 a 50 4721 a Fj(\014ts)p 177 4721 28 4 v 32 w(op)s(en)p 399 4721 V 32 w(table)1264 4721 y SDict begin H.S end 1264 4721 a Fj(32)1355 4662 y SDict begin H.R end 1355 4662 a 1355 4721 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 1355 4721 a 50 4833 a Fj(\014ts)p 177 4833 28 4 v 32 w(op)s(en)p 399 4833 V 32 w(group)1264 4833 y SDict begin H.S end 1264 4833 a Fj(92)1355 4775 y SDict begin H.R end 1355 4775 a 1355 4833 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 1355 4833 a 50 4946 a Fj(\014ts)p 177 4946 28 4 v 32 w(op)s(en)p 399 4946 V 32 w(mem)m(b)s(er)1264 4946 y SDict begin H.S end 1264 4946 a Fj(93)1355 4888 y SDict begin H.R end 1355 4888 a 1355 4946 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.2) cvn H.B /ANN pdfmark end 1355 4946 a 50 5059 a Fj(\014ts)p 177 5059 28 4 v 32 w(op)s(en)p 399 5059 V 32 w(mem\014le)1264 5059 y SDict begin H.S end 1264 5059 a Fj(95)1355 5001 y SDict begin H.R end 1355 5001 a 1355 5059 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 1355 5059 a 50 5172 a Fj(\014ts)p 177 5172 28 4 v 32 w(parse)p 417 5172 V 33 w(extn)m(um)1264 5172 y SDict begin H.S end 1264 5172 a Fj(97)1355 5114 y SDict begin H.R end 1355 5114 a 1355 5172 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 1355 5172 a 50 5285 a Fj(\014ts)p 177 5285 28 4 v 32 w(parse)p 417 5285 V 33 w(input)p 663 5285 V 32 w(\014lename)1264 5285 y SDict begin H.S end 1264 5285 a Fj(97)1355 5227 y SDict begin H.R end 1355 5227 a 1355 5285 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 1355 5285 a 50 5398 a Fj(\014ts)p 177 5398 28 4 v 32 w(parse)p 417 5398 V 33 w(input)p 663 5398 V 32 w(url)1264 5398 y SDict begin H.S end 1264 5398 a Fj(97)1355 5339 y SDict begin H.R end 1355 5339 a 1355 5398 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 1355 5398 a 50 5511 a Fj(\014ts)p 177 5511 28 4 v 32 w(parse)p 417 5511 V 33 w(range)1264 5511 y SDict begin H.S end 1264 5511 a Fj(75)1355 5452 y SDict begin H.R end 1355 5452 a 1355 5511 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1355 5511 a 50 5624 a Fj(\014ts)p 177 5624 28 4 v 32 w(parse)p 417 5624 V 33 w(ro)s(otname)1264 5624 y SDict begin H.S end 1264 5624 a Fj(98)1355 5565 y SDict begin H.R end 1355 5565 a 1355 5624 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 1355 5624 a 50 5737 a Fj(\014ts)p 177 5737 28 4 v 32 w(parse)p 417 5737 V 33 w(template)1264 5737 y SDict begin H.S end 1264 5737 a Fj(71)1355 5678 y SDict begin H.R end 1355 5678 a 1355 5737 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1355 5737 a 50 5850 a Fj(\014ts)p 177 5850 28 4 v 32 w(parse)p 417 5850 V 33 w(v)g(alue)1264 5850 y SDict begin H.S end 1264 5850 a Fj(68)1355 5791 y SDict begin H.R end 1355 5791 a 1355 5850 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1355 5850 a 1475 543 a Fj(\014ts)p 1602 543 28 4 v 32 w(pix)p 1758 543 V 33 w(to)p 1871 543 V 33 w(w)m(orld)2772 543 y SDict begin H.S end 2772 543 a Fj(87)2862 484 y SDict begin H.R end 2862 484 a 2862 543 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.7.1) cvn H.B /ANN pdfmark end 2862 543 a 1475 656 a Fj(\014ts)p 1602 656 28 4 v 32 w(read)p 1806 656 V 33 w(2d)p 1935 656 V 33 w(TYP)2726 656 y SDict begin H.S end 2726 656 a Fj(115)2862 597 y SDict begin H.R end 2862 597 a 2862 656 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2862 656 a 1475 769 a Fj(\014ts)p 1602 769 28 4 v 32 w(read)p 1806 769 V 33 w(3d)p 1935 769 V 33 w(TYP)2726 769 y SDict begin H.S end 2726 769 a Fj(115)2862 710 y SDict begin H.R end 2862 710 a 2862 769 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2862 769 a 1475 882 a Fj(\014ts)p 1602 882 28 4 v 32 w(read)p 1806 882 V 33 w(atblhdr)2726 882 y SDict begin H.S end 2726 882 a Fj(104)2862 823 y SDict begin H.R end 2862 823 a 2862 882 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 2862 882 a 1475 995 a Fj(\014ts)p 1602 995 28 4 v 32 w(read)p 1806 995 V 33 w(btblhdr)2726 995 y SDict begin H.S end 2726 995 a Fj(104)2862 936 y SDict begin H.R end 2862 936 a 2862 995 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 2862 995 a 1475 1107 a Fj(\014ts)p 1602 1107 28 4 v 32 w(read)p 1806 1107 V 33 w(card)2772 1107 y SDict begin H.S end 2772 1107 a Fj(38)2862 1049 y SDict begin H.R end 2862 1049 a 2862 1107 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2862 1107 a 1475 1220 a Fj(\014ts)p 1602 1220 28 4 v 32 w(read)p 1806 1220 V 33 w(col)2772 1220 y SDict begin H.S end 2772 1220 a Fj(59)2862 1162 y SDict begin H.R end 2862 1162 a 2862 1220 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.4) cvn H.B /ANN pdfmark end 2862 1220 a 1475 1333 a Fj(\014ts)p 1602 1333 28 4 v 32 w(read)p 1806 1333 V 33 w(col)p 1949 1333 V 34 w(bit)p 2094 1333 V 2726 1333 a SDict begin H.S end 2726 1333 a Fj(121)2862 1275 y SDict begin H.R end 2862 1275 a 2862 1333 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 2862 1333 a 1475 1446 a Fj(\014ts)p 1602 1446 28 4 v 32 w(read)p 1806 1446 V 33 w(col)p 1949 1446 V 34 w(TYP)2726 1446 y SDict begin H.S end 2726 1446 a Fj(119)2862 1388 y SDict begin H.R end 2862 1388 a 2862 1446 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 2862 1446 a 1475 1559 a Fj(\014ts)p 1602 1559 28 4 v 32 w(read)p 1806 1559 V 33 w(coln)m(ull)2772 1559 y SDict begin H.S end 2772 1559 a Fj(59)2862 1501 y SDict begin H.R end 2862 1501 a 2862 1559 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.4) cvn H.B /ANN pdfmark end 2862 1559 a 1475 1672 a Fj(\014ts)p 1602 1672 28 4 v 32 w(read)p 1806 1672 V 33 w(coln)m(ull)p 2098 1672 V 34 w(TYP)2726 1672 y SDict begin H.S end 2726 1672 a Fj(119)2862 1613 y SDict begin H.R end 2862 1613 a 2862 1672 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 2862 1672 a 1475 1785 a Fj(\014ts)p 1602 1785 28 4 v 32 w(read)p 1806 1785 V 33 w(descript)2726 1785 y SDict begin H.S end 2726 1785 a Fj(121)2862 1726 y SDict begin H.R end 2862 1726 a 2862 1785 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 2862 1785 a 1475 1898 a Fj(\014ts)p 1602 1898 28 4 v 32 w(read)p 1806 1898 V 33 w(descripts)2726 1898 y SDict begin H.S end 2726 1898 a Fj(121)2862 1839 y SDict begin H.R end 2862 1839 a 2862 1898 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 2862 1898 a 1475 2011 a Fj(\014ts)p 1602 2011 28 4 v 32 w(read)p 1806 2011 V 33 w(errmsg)2772 2011 y SDict begin H.S end 2772 2011 a Fj(32)2862 1952 y SDict begin H.R end 2862 1952 a 2862 2011 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.1) cvn H.B /ANN pdfmark end 2862 2011 a 1475 2124 a Fj(\014ts)p 1602 2124 28 4 v 32 w(read)p 1806 2124 V 33 w(ext)2726 2124 y SDict begin H.S end 2726 2124 a Fj(101)2862 2065 y SDict begin H.R end 2862 2065 a 2862 2124 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 2862 2124 a 1475 2237 a Fj(\014ts)p 1602 2237 28 4 v 32 w(read)p 1806 2237 V 33 w(grppar)p 2103 2237 V 32 w(TYP)2726 2237 y SDict begin H.S end 2726 2237 a Fj(114)2862 2178 y SDict begin H.R end 2862 2178 a 2862 2237 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2862 2237 a 1475 2349 a Fj(\014ts)p 1602 2349 28 4 v 32 w(read)p 1806 2349 V 33 w(img)2726 2349 y SDict begin H.S end 2726 2349 a Fj(114)2862 2291 y SDict begin H.R end 2862 2291 a 2862 2349 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2862 2349 a 1475 2462 a Fj(\014ts)p 1602 2462 28 4 v 32 w(read)p 1806 2462 V 33 w(img)p 1985 2462 V 33 w(co)s(ord)2772 2462 y SDict begin H.S end 2772 2462 a Fj(87)2862 2404 y SDict begin H.R end 2862 2404 a 2862 2462 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.7.1) cvn H.B /ANN pdfmark end 2862 2462 a 1475 2575 a Fj(\014ts)p 1602 2575 28 4 v 32 w(read)p 1806 2575 V 33 w(img)p 1985 2575 V 33 w(TYP)2726 2575 y SDict begin H.S end 2726 2575 a Fj(114)2862 2517 y SDict begin H.R end 2862 2517 a 2862 2575 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2862 2575 a 1475 2688 a Fj(\014ts)p 1602 2688 28 4 v 32 w(read)p 1806 2688 V 33 w(imghdr)2726 2688 y SDict begin H.S end 2726 2688 a Fj(104)2862 2630 y SDict begin H.R end 2862 2630 a 2862 2688 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 2862 2688 a 1475 2801 a Fj(\014ts)p 1602 2801 28 4 v 32 w(read)p 1806 2801 V 33 w(imgn)m(ull)2726 2801 y SDict begin H.S end 2726 2801 a Fj(114)2862 2743 y SDict begin H.R end 2862 2743 a 2862 2801 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2862 2801 a 1475 2914 a Fj(\014ts)p 1602 2914 28 4 v 32 w(read)p 1806 2914 V 33 w(imgn)m(ull)p 2134 2914 V 33 w(TYP)2726 2914 y SDict begin H.S end 2726 2914 a Fj(114)2862 2855 y SDict begin H.R end 2862 2855 a 2862 2914 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2862 2914 a 1475 3027 a Fj(\014ts)p 1602 3027 28 4 v 32 w(read)p 1806 3027 V 33 w(k)m(ey)2772 3027 y SDict begin H.S end 2772 3027 a Fj(38)2862 2968 y SDict begin H.R end 2862 2968 a 2862 3027 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2862 3027 a 1475 3140 a Fj(\014ts)p 1602 3140 28 4 v 32 w(read)p 1806 3140 V 33 w(k)m(ey)p 1972 3140 V 33 w(longstr)2726 3140 y SDict begin H.S end 2726 3140 a Fj(108)2862 3081 y SDict begin H.R end 2862 3081 a 2862 3140 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.5) cvn H.B /ANN pdfmark end 2862 3140 a 1475 3253 a Fj(\014ts)p 1602 3253 28 4 v 32 w(read)p 1806 3253 V 33 w(k)m(ey)p 1972 3253 V 33 w(triple)2726 3253 y SDict begin H.S end 2726 3253 a Fj(109)2862 3194 y SDict begin H.R end 2862 3194 a 2862 3253 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.5) cvn H.B /ANN pdfmark end 2862 3253 a 1475 3366 a Fj(\014ts)p 1602 3366 28 4 v 32 w(read)p 1806 3366 V 33 w(k)m(ey)p 1972 3366 V 33 w(unit)2772 3366 y SDict begin H.S end 2772 3366 a Fj(40)2862 3307 y SDict begin H.R end 2862 3307 a 2862 3366 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2862 3366 a 1475 3479 a Fj(\014ts)p 1602 3479 28 4 v 32 w(read)p 1806 3479 V 33 w(k)m(ey)p 1972 3479 V 33 w(TYP)2726 3479 y SDict begin H.S end 2726 3479 a Fj(108)2862 3420 y SDict begin H.R end 2862 3420 a 2862 3479 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.5) cvn H.B /ANN pdfmark end 2862 3479 a 1475 3591 a Fj(\014ts)p 1602 3591 28 4 v 32 w(read)p 1806 3591 V 33 w(k)m(eyn)2772 3591 y SDict begin H.S end 2772 3591 a Fj(39)2862 3533 y SDict begin H.R end 2862 3533 a 2862 3591 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2862 3591 a 1475 3704 a Fj(\014ts)p 1602 3704 28 4 v 32 w(read)p 1806 3704 V 33 w(k)m(eys)p 2008 3704 V 33 w(TYP)2726 3704 y SDict begin H.S end 2726 3704 a Fj(108)2862 3646 y SDict begin H.R end 2862 3646 a 2862 3704 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.5) cvn H.B /ANN pdfmark end 2862 3704 a 1475 3817 a Fj(\014ts)p 1602 3817 28 4 v 32 w(read)p 1806 3817 V 33 w(k)m(eyw)m(ord)2772 3817 y SDict begin H.S end 2772 3817 a Fj(38)2862 3759 y SDict begin H.R end 2862 3759 a 2862 3817 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2862 3817 a 1475 3930 a Fj(\014ts)p 1602 3930 28 4 v 32 w(read)p 1806 3930 V 33 w(pix)2772 3930 y SDict begin H.S end 2772 3930 a Fj(46)2862 3872 y SDict begin H.R end 2862 3872 a 2862 3930 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 2862 3930 a 1475 4043 a Fj(\014ts)p 1602 4043 28 4 v 32 w(read)p 1806 4043 V 33 w(pixn)m(ull)2772 4043 y SDict begin H.S end 2772 4043 a Fj(46)2862 3985 y SDict begin H.R end 2862 3985 a 2862 4043 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 2862 4043 a 1475 4156 a Fj(\014ts)p 1602 4156 28 4 v 32 w(read)p 1806 4156 V 33 w(record)2772 4156 y SDict begin H.S end 2772 4156 a Fj(39)2862 4097 y SDict begin H.R end 2862 4097 a 2862 4156 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2862 4156 a 1475 4269 a Fj(\014ts)p 1602 4269 28 4 v 32 w(read)p 1806 4269 V 33 w(str)2772 4269 y SDict begin H.S end 2772 4269 a Fj(38)2862 4210 y SDict begin H.R end 2862 4210 a 2862 4269 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2862 4269 a 1475 4382 a Fj(\014ts)p 1602 4382 28 4 v 32 w(read)p 1806 4382 V 33 w(string)p 2067 4382 V 33 w(k)m(ey)2772 4382 y SDict begin H.S end 2772 4382 a Fj(39)2862 4323 y SDict begin H.R end 2862 4323 a 2862 4382 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2862 4382 a 1475 4495 a Fj(\014ts)p 1602 4495 28 4 v 32 w(read)p 1806 4495 V 33 w(subset)2772 4495 y SDict begin H.S end 2772 4495 a Fj(46)2862 4436 y SDict begin H.R end 2862 4436 a 2862 4495 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 2862 4495 a 1475 4608 a Fj(\014ts)p 1602 4608 28 4 v 32 w(read)p 1806 4608 V 33 w(subset)p 2088 4608 V 32 w(TYP)2559 4608 y SDict begin H.S end 2559 4608 a Fj(115)2696 4549 y SDict begin H.R end 2696 4549 a 2696 4608 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2696 4608 a 2726 4608 a SDict begin H.S end 2726 4608 a Fj(120)2862 4549 y SDict begin H.R end 2862 4549 a 2862 4608 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 2862 4608 a 1475 4721 a Fj(\014ts)p 1602 4721 28 4 v 32 w(read)p 1806 4721 V 33 w(subsetn)m(ull)p 2237 4721 V 32 w(TYP)2559 4721 y SDict begin H.S end 2559 4721 a Fj(115)2696 4662 y SDict begin H.R end 2696 4662 a 2696 4721 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2696 4721 a 2726 4721 a SDict begin H.S end 2726 4721 a Fj(120)2862 4662 y SDict begin H.R end 2862 4662 a 2862 4721 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 2862 4721 a 1475 4833 a Fj(\014ts)p 1602 4833 28 4 v 32 w(read)p 1806 4833 V 33 w(tbl)p 1950 4833 V 33 w(co)s(ord)2772 4833 y SDict begin H.S end 2772 4833 a Fj(87)2862 4775 y SDict begin H.R end 2862 4775 a 2862 4833 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.7.1) cvn H.B /ANN pdfmark end 2862 4833 a 1475 4946 a Fj(\014ts)p 1602 4946 28 4 v 32 w(read)p 1806 4946 V 33 w(tblb)m(ytes)2726 4946 y SDict begin H.S end 2726 4946 a Fj(117)2862 4888 y SDict begin H.R end 2862 4888 a 2862 4946 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.2) cvn H.B /ANN pdfmark end 2862 4946 a 1475 5059 a Fj(\014ts)p 1602 5059 28 4 v 32 w(read)p 1806 5059 V 33 w(tdim)2772 5059 y SDict begin H.S end 2772 5059 a Fj(55)2862 5001 y SDict begin H.R end 2862 5001 a 2862 5059 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 2862 5059 a 1475 5172 a Fj(\014ts)p 1602 5172 28 4 v 32 w(read)p 1806 5172 V 33 w(w)m(cstab)2772 5172 y SDict begin H.S end 2772 5172 a Fj(86)2862 5114 y SDict begin H.R end 2862 5114 a 2862 5172 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (chapter.7) cvn H.B /ANN pdfmark end 2862 5172 a 1475 5285 a Fj(\014ts)p 1602 5285 28 4 v 32 w(rebin)p 1837 5285 V 32 w(w)m(cs[d])2772 5285 y SDict begin H.S end 2772 5285 a Fj(63)2862 5227 y SDict begin H.R end 2862 5227 a 2862 5285 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.6) cvn H.B /ANN pdfmark end 2862 5285 a 1475 5398 a Fj(\014ts)p 1602 5398 28 4 v 32 w(remo)m(v)m(e)p 1913 5398 V 35 w(group)2772 5398 y SDict begin H.S end 2772 5398 a Fj(91)2862 5339 y SDict begin H.R end 2862 5339 a 2862 5398 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 2862 5398 a 1475 5511 a Fj(\014ts)p 1602 5511 28 4 v 32 w(remo)m(v)m(e)p 1913 5511 V 35 w(mem)m(b)s(er)2772 5511 y SDict begin H.S end 2772 5511 a Fj(94)2862 5452 y SDict begin H.R end 2862 5452 a 2862 5511 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.2) cvn H.B /ANN pdfmark end 2862 5511 a 1475 5624 a Fj(\014ts)p 1602 5624 28 4 v 32 w(reop)s(en)p 1900 5624 V 32 w(\014le)2772 5624 y SDict begin H.S end 2772 5624 a Fj(96)2862 5565 y SDict begin H.R end 2862 5565 a 2862 5624 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 2862 5624 a 1475 5737 a Fj(\014ts)p 1602 5737 28 4 v 32 w(rep)s(ort)p 1880 5737 V 32 w(error)2772 5737 y SDict begin H.S end 2772 5737 a Fj(32)2862 5678 y SDict begin H.R end 2862 5678 a 2862 5737 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.1) cvn H.B /ANN pdfmark end 2862 5737 a 1475 5850 a Fj(\014ts)p 1602 5850 28 4 v 32 w(resize)p 1851 5850 V 34 w(img)2726 5850 y SDict begin H.S end 2726 5850 a Fj(101)2862 5791 y SDict begin H.R end 2862 5791 a 2862 5850 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 2862 5850 a 2982 543 a Fj(\014ts)p 3109 543 28 4 v 33 w(rms)p 3290 543 V 32 w(\015oat)4243 543 y SDict begin H.S end 4243 543 a Fj(75)4334 484 y SDict begin H.R end 4334 484 a 4334 543 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 4334 543 a 2982 656 a Fj(\014ts)p 3109 656 28 4 v 33 w(rms)p 3290 656 V 32 w(short)4243 656 y SDict begin H.S end 4243 656 a Fj(75)4334 597 y SDict begin H.R end 4334 597 a 4334 656 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 4334 656 a 2982 769 a Fj(\014ts)p 3109 769 28 4 v 33 w(select)p 3358 769 V 34 w(ro)m(ws)4243 769 y SDict begin H.S end 4243 769 a Fj(60)4334 710 y SDict begin H.R end 4334 710 a 4334 769 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 4334 769 a 2982 882 a Fj(\014ts)p 3109 882 28 4 v 33 w(set)p 3253 882 V 33 w(atbln)m(ull)4198 882 y SDict begin H.S end 4198 882 a Fj(111)4334 823 y SDict begin H.R end 4334 823 a 4334 882 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.4) cvn H.B /ANN pdfmark end 4334 882 a 2982 995 a Fj(\014ts)p 3109 995 28 4 v 33 w(set)p 3253 995 V 33 w(bscale)4198 995 y SDict begin H.S end 4198 995 a Fj(111)4334 936 y SDict begin H.R end 4334 936 a 4334 995 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.4) cvn H.B /ANN pdfmark end 4334 995 a 2982 1107 a Fj(\014ts)p 3109 1107 28 4 v 33 w(set)p 3253 1107 V 33 w(btbln)m(ull)4198 1107 y SDict begin H.S end 4198 1107 a Fj(111)4334 1049 y SDict begin H.R end 4334 1049 a 4334 1107 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.4) cvn H.B /ANN pdfmark end 4334 1107 a 2982 1220 a Fj(\014ts)p 3109 1220 28 4 v 33 w(set)p 3253 1220 V 33 w(compression)p 3767 1220 V 33 w(t)m(yp)s(e)4243 1220 y SDict begin H.S end 4243 1220 a Fj(50)4334 1162 y SDict begin H.R end 4334 1162 a 4334 1220 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.6) cvn H.B /ANN pdfmark end 4334 1220 a 2982 1333 a Fj(\014ts)p 3109 1333 28 4 v 33 w(set)p 3253 1333 V 33 w(hdrsize)4198 1333 y SDict begin H.S end 4198 1333 a Fj(102)4334 1275 y SDict begin H.R end 4334 1275 a 4334 1333 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.1) cvn H.B /ANN pdfmark end 4334 1333 a 2982 1446 a Fj(\014ts)p 3109 1446 28 4 v 33 w(set)p 3253 1446 V 33 w(hdustruc)4198 1446 y SDict begin H.S end 4198 1446 a Fj(102)4334 1388 y SDict begin H.R end 4334 1388 a 4334 1446 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 4334 1446 a 2982 1559 a Fj(\014ts)p 3109 1559 28 4 v 33 w(set)p 3253 1559 V 33 w(imgn)m(ull)4198 1559 y SDict begin H.S end 4198 1559 a Fj(111)4334 1501 y SDict begin H.R end 4334 1501 a 4334 1559 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.4) cvn H.B /ANN pdfmark end 4334 1559 a 2982 1672 a Fj(\014ts)p 3109 1672 28 4 v 33 w(set)p 3253 1672 V 33 w(noise)p 3483 1672 V 33 w(bits)4243 1672 y SDict begin H.S end 4243 1672 a Fj(50)4334 1613 y SDict begin H.R end 4334 1613 a 4334 1672 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.6) cvn H.B /ANN pdfmark end 4334 1672 a 2982 1785 a Fj(\014ts)p 3109 1785 28 4 v 33 w(set)p 3253 1785 V 33 w(tile)p 3411 1785 V 34 w(dim)4243 1785 y SDict begin H.S end 4243 1785 a Fj(50)4334 1726 y SDict begin H.R end 4334 1726 a 4334 1785 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.6) cvn H.B /ANN pdfmark end 4334 1785 a 2982 1898 a Fj(\014ts)p 3109 1898 28 4 v 33 w(set)p 3253 1898 V 33 w(timeout)4243 1898 y SDict begin H.S end 4243 1898 a Fj(99)4334 1839 y SDict begin H.R end 4334 1839 a 4334 1898 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.2) cvn H.B /ANN pdfmark end 4334 1898 a 2982 2011 a Fj(\014ts)p 3109 2011 28 4 v 33 w(set)p 3253 2011 V 33 w(tscale)4198 2011 y SDict begin H.S end 4198 2011 a Fj(111)4334 1952 y SDict begin H.R end 4334 1952 a 4334 2011 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.4) cvn H.B /ANN pdfmark end 4334 2011 a 2982 2124 a Fj(\014ts)p 3109 2124 28 4 v 33 w(sho)m(w)p 3337 2124 V 32 w(do)m(wnload)p 3745 2124 V 33 w(progress)4243 2124 y SDict begin H.S end 4243 2124 a Fj(99)4334 2065 y SDict begin H.R end 4334 2065 a 4334 2124 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.2) cvn H.B /ANN pdfmark end 4334 2124 a 2982 2237 a Fj(\014ts)p 3109 2237 28 4 v 33 w(split)p 3314 2237 V 33 w(names)4243 2237 y SDict begin H.S end 4243 2237 a Fj(67)4334 2178 y SDict begin H.R end 4334 2178 a 4334 2237 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 4334 2237 a 2982 2349 a Fj(\014ts)p 3109 2349 28 4 v 33 w(str2date)4243 2349 y SDict begin H.S end 4243 2349 a Fj(65)4334 2291 y SDict begin H.R end 4334 2291 a 4334 2349 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.2) cvn H.B /ANN pdfmark end 4334 2349 a 2982 2462 a Fj(\014ts)p 3109 2462 28 4 v 33 w(str2time)4243 2462 y SDict begin H.S end 4243 2462 a Fj(65)4334 2404 y SDict begin H.R end 4334 2404 a 4334 2462 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.2) cvn H.B /ANN pdfmark end 4334 2462 a 2982 2575 a Fj(\014ts)p 3109 2575 28 4 v 33 w(test)p 3288 2575 V 33 w(expr)4243 2575 y SDict begin H.S end 4243 2575 a Fj(61)4334 2517 y SDict begin H.R end 4334 2517 a 4334 2575 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 4334 2575 a 2982 2688 a Fj(\014ts)p 3109 2688 28 4 v 33 w(test)p 3288 2688 V 33 w(heap)4198 2688 y SDict begin H.S end 4198 2688 a Fj(116)4334 2630 y SDict begin H.R end 4334 2630 a 4334 2688 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.1) cvn H.B /ANN pdfmark end 4334 2688 a 2982 2801 a Fj(\014ts)p 3109 2801 28 4 v 33 w(test)p 3288 2801 V 33 w(k)m(eyw)m(ord)4243 2801 y SDict begin H.S end 4243 2801 a Fj(67)4334 2743 y SDict begin H.R end 4334 2743 a 4334 2801 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 4334 2801 a 2982 2914 a Fj(\014ts)p 3109 2914 28 4 v 33 w(test)p 3288 2914 V 33 w(record)4243 2914 y SDict begin H.S end 4243 2914 a Fj(67)4334 2855 y SDict begin H.R end 4334 2855 a 4334 2914 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 4334 2914 a 2982 3027 a Fj(\014ts)p 3109 3027 28 4 v 33 w(time2str)4243 3027 y SDict begin H.S end 4243 3027 a Fj(65)4334 2968 y SDict begin H.R end 4334 2968 a 4334 3027 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.2) cvn H.B /ANN pdfmark end 4334 3027 a 2982 3140 a Fj(\014ts)p 3109 3140 28 4 v 33 w(transfer)p 3449 3140 V 32 w(mem)m(b)s(er)4243 3140 y SDict begin H.S end 4243 3140 a Fj(93)4334 3081 y SDict begin H.R end 4334 3081 a 4334 3140 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.2) cvn H.B /ANN pdfmark end 4334 3140 a 2982 3253 a Fj(\014ts)p 3109 3253 28 4 v 33 w(translate)p 3490 3253 V 34 w(k)m(eyw)m(ord)4243 3253 y SDict begin H.S end 4243 3253 a Fj(73)4334 3194 y SDict begin H.R end 4334 3194 a 4334 3253 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 4334 3253 a 2982 3366 a Fj(\014ts)p 3109 3366 28 4 v 33 w(up)s(date)p 3418 3366 V 32 w(card)4243 3366 y SDict begin H.S end 4243 3366 a Fj(42)4334 3307 y SDict begin H.R end 4334 3307 a 4334 3366 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 4334 3366 a 2982 3479 a Fj(\014ts)p 3109 3479 28 4 v 33 w(up)s(date)p 3418 3479 V 32 w(c)m(hksum)4243 3479 y SDict begin H.S end 4243 3479 a Fj(64)4334 3420 y SDict begin H.R end 4334 3420 a 4334 3479 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.1) cvn H.B /ANN pdfmark end 4334 3479 a 2982 3591 a Fj(\014ts)p 3109 3591 28 4 v 33 w(up)s(date)p 3418 3591 V 32 w(k)m(ey)4243 3591 y SDict begin H.S end 4243 3591 a Fj(41)4334 3533 y SDict begin H.R end 4334 3533 a 4334 3591 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 4334 3591 a 2982 3704 a Fj(\014ts)p 3109 3704 28 4 v 33 w(up)s(date)p 3418 3704 V 32 w(k)m(ey)p 3583 3704 V 33 w(longstr)4198 3704 y SDict begin H.S end 4198 3704 a Fj(110)4334 3646 y SDict begin H.R end 4334 3646 a 4334 3704 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.7) cvn H.B /ANN pdfmark end 4334 3704 a 2982 3817 a Fj(\014ts)p 3109 3817 28 4 v 33 w(up)s(date)p 3418 3817 V 32 w(k)m(ey)p 3583 3817 V 33 w(n)m(ull)4243 3817 y SDict begin H.S end 4243 3817 a Fj(41)4334 3759 y SDict begin H.R end 4334 3759 a 4334 3817 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 4334 3817 a 2982 3930 a Fj(\014ts)p 3109 3930 28 4 v 33 w(up)s(date)p 3418 3930 V 32 w(k)m(ey)p 3583 3930 V 33 w(TYP)4198 3930 y SDict begin H.S end 4198 3930 a Fj(110)4334 3872 y SDict begin H.R end 4334 3872 a 4334 3930 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.7) cvn H.B /ANN pdfmark end 4334 3930 a 2982 4043 a Fj(\014ts)p 3109 4043 28 4 v 33 w(upp)s(ercase)4243 4043 y SDict begin H.S end 4243 4043 a Fj(67)4334 3985 y SDict begin H.R end 4334 3985 a 4334 4043 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 4334 4043 a 2982 4156 a Fj(\014ts)p 3109 4156 28 4 v 33 w(url)p 3254 4156 V 32 w(t)m(yp)s(e)4243 4156 y SDict begin H.S end 4243 4156 a Fj(35)4334 4097 y SDict begin H.R end 4334 4097 a 4334 4156 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 4334 4156 a 2982 4269 a Fj(\014ts)p 3109 4269 28 4 v 33 w(v)m(erb)s(ose)p 3438 4269 V 33 w(h)m(ttps)4243 4269 y SDict begin H.S end 4243 4269 a Fj(99)4334 4210 y SDict begin H.R end 4334 4210 a 4334 4269 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.2) cvn H.B /ANN pdfmark end 4334 4269 a 2982 4382 a Fj(\014ts)p 3109 4382 28 4 v 33 w(v)m(erify)p 3364 4382 V 33 w(c)m(hksum)4243 4382 y SDict begin H.S end 4243 4382 a Fj(64)4334 4323 y SDict begin H.R end 4334 4323 a 4334 4382 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.1) cvn H.B /ANN pdfmark end 4334 4382 a 2982 4495 a Fj(\014ts)p 3109 4495 28 4 v 33 w(v)m(erify)p 3364 4495 V 33 w(group)4243 4495 y SDict begin H.S end 4243 4495 a Fj(92)4334 4436 y SDict begin H.R end 4334 4436 a 4334 4495 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 4334 4495 a 2982 4608 a Fj(\014ts)p 3109 4608 28 4 v 33 w(w)m(orld)p 3362 4608 V 32 w(to)p 3474 4608 V 34 w(pix)4243 4608 y SDict begin H.S end 4243 4608 a Fj(87)4334 4549 y SDict begin H.R end 4334 4549 a 4334 4608 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.7.1) cvn H.B /ANN pdfmark end 4334 4608 a 2982 4721 a Fj(\014ts)p 3109 4721 28 4 v 33 w(write)p 3344 4721 V 33 w(2d)p 3473 4721 V 32 w(TYP)4198 4721 y SDict begin H.S end 4198 4721 a Fj(114)4334 4662 y SDict begin H.R end 4334 4662 a 4334 4721 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 4334 4721 a 2982 4833 a Fj(\014ts)p 3109 4833 28 4 v 33 w(write)p 3344 4833 V 33 w(3d)p 3473 4833 V 32 w(TYP)4198 4833 y SDict begin H.S end 4198 4833 a Fj(114)4334 4775 y SDict begin H.R end 4334 4775 a 4334 4833 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 4334 4833 a 2982 4946 a Fj(\014ts)p 3109 4946 28 4 v 33 w(write)p 3344 4946 V 33 w(atblhdr)4198 4946 y SDict begin H.S end 4198 4946 a Fj(103)4334 4888 y SDict begin H.R end 4334 4888 a 4334 4946 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 4334 4946 a 2982 5059 a Fj(\014ts)p 3109 5059 28 4 v 33 w(write)p 3344 5059 V 33 w(btblhdr)4198 5059 y SDict begin H.S end 4198 5059 a Fj(104)4334 5001 y SDict begin H.R end 4334 5001 a 4334 5059 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 4334 5059 a 2982 5172 a Fj(\014ts)p 3109 5172 28 4 v 33 w(write)p 3344 5172 V 33 w(c)m(hksum)4243 5172 y SDict begin H.S end 4243 5172 a Fj(64)4334 5114 y SDict begin H.R end 4334 5114 a 4334 5172 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.1) cvn H.B /ANN pdfmark end 4334 5172 a 2982 5285 a Fj(\014ts)p 3109 5285 28 4 v 33 w(write)p 3344 5285 V 33 w(col)4243 5285 y SDict begin H.S end 4243 5285 a Fj(58)4334 5227 y SDict begin H.R end 4334 5227 a 4334 5285 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.4) cvn H.B /ANN pdfmark end 4334 5285 a 2982 5398 a Fj(\014ts)p 3109 5398 28 4 v 33 w(write)p 3344 5398 V 33 w(col)p 3487 5398 V 34 w(bit)4198 5398 y SDict begin H.S end 4198 5398 a Fj(118)4334 5339 y SDict begin H.R end 4334 5339 a 4334 5398 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.3) cvn H.B /ANN pdfmark end 4334 5398 a 2982 5511 a Fj(\014ts)p 3109 5511 28 4 v 33 w(write)p 3344 5511 V 33 w(col)p 3487 5511 V 34 w(TYP)4198 5511 y SDict begin H.S end 4198 5511 a Fj(117)4334 5452 y SDict begin H.R end 4334 5452 a 4334 5511 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.3) cvn H.B /ANN pdfmark end 4334 5511 a 2982 5624 a Fj(\014ts)p 3109 5624 28 4 v 33 w(write)p 3344 5624 V 33 w(col)p 3487 5624 V 34 w(n)m(ull)4243 5624 y SDict begin H.S end 4243 5624 a Fj(58)4334 5565 y SDict begin H.R end 4334 5565 a 4334 5624 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.4) cvn H.B /ANN pdfmark end 4334 5624 a 2982 5737 a Fj(\014ts)p 3109 5737 28 4 v 33 w(write)p 3344 5737 V 33 w(coln)m(ull)4243 5737 y SDict begin H.S end 4243 5737 a Fj(58)4334 5678 y SDict begin H.R end 4334 5678 a 4334 5737 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.4) cvn H.B /ANN pdfmark end 4334 5737 a 2982 5850 a Fj(\014ts)p 3109 5850 28 4 v 33 w(write)p 3344 5850 V 33 w(coln)m(ull)p 3636 5850 V 34 w(TYP)4198 5850 y SDict begin H.S end 4198 5850 a Fj(117)4334 5791 y SDict begin H.R end 4334 5791 a 4334 5850 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.3) cvn H.B /ANN pdfmark end 4334 5850 a eop end %%Page: 175 183 TeXDict begin 175 182 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.175) cvn /DEST pdfmark end -8 191 a 3764 299 a Fj(175)50 543 y(\014ts)p 177 543 28 4 v 32 w(write)p 411 543 V 33 w(commen)m(t)1112 543 y SDict begin H.S end 1112 543 a Fj(41)1203 484 y SDict begin H.R end 1203 484 a 1203 543 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 1203 543 a 50 656 a Fj(\014ts)p 177 656 28 4 v 32 w(write)p 411 656 V 33 w(date)1112 656 y SDict begin H.S end 1112 656 a Fj(41)1203 597 y SDict begin H.R end 1203 597 a 1203 656 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 1203 656 a 50 769 a Fj(\014ts)p 177 769 28 4 v 32 w(write)p 411 769 V 33 w(descript)1067 769 y SDict begin H.S end 1067 769 a Fj(118)1203 710 y SDict begin H.R end 1203 710 a 1203 769 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.3) cvn H.B /ANN pdfmark end 1203 769 a 50 882 a Fj(\014ts)p 177 882 28 4 v 32 w(write)p 411 882 V 33 w(errmark)1112 882 y SDict begin H.S end 1112 882 a Fj(32)1203 823 y SDict begin H.R end 1203 823 a 1203 882 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.1) cvn H.B /ANN pdfmark end 1203 882 a 50 995 a Fj(\014ts)p 177 995 28 4 v 32 w(write)p 411 995 V 33 w(errmsg)1112 995 y SDict begin H.S end 1112 995 a Fj(66)1203 936 y SDict begin H.R end 1203 936 a 1203 995 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1203 995 a 50 1107 a Fj(\014ts)p 177 1107 28 4 v 32 w(write)p 411 1107 V 33 w(ext)1067 1107 y SDict begin H.S end 1067 1107 a Fj(101)1203 1049 y SDict begin H.R end 1203 1049 a 1203 1107 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 1203 1107 a 50 1220 a Fj(\014ts)p 177 1220 28 4 v 32 w(write)p 411 1220 V 33 w(exthdr)1067 1220 y SDict begin H.S end 1067 1220 a Fj(103)1203 1162 y SDict begin H.R end 1203 1162 a 1203 1220 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 1203 1220 a 50 1333 a Fj(\014ts)p 177 1333 28 4 v 32 w(write)p 411 1333 V 33 w(grphdr)1067 1333 y SDict begin H.S end 1067 1333 a Fj(103)1203 1275 y SDict begin H.R end 1203 1275 a 1203 1333 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 1203 1333 a 50 1446 a Fj(\014ts)p 177 1446 28 4 v 32 w(write)p 411 1446 V 33 w(grppar)p 708 1446 V 32 w(TYP)1067 1446 y SDict begin H.S end 1067 1446 a Fj(113)1203 1388 y SDict begin H.R end 1203 1388 a 1203 1446 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 1203 1446 a 50 1559 a Fj(\014ts)p 177 1559 28 4 v 32 w(write)p 411 1559 V 33 w(hdu)1112 1559 y SDict begin H.S end 1112 1559 a Fj(37)1203 1501 y SDict begin H.R end 1203 1501 a 1203 1559 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 1203 1559 a 50 1672 a Fj(\014ts)p 177 1672 28 4 v 32 w(write)p 411 1672 V 33 w(history)1112 1672 y SDict begin H.S end 1112 1672 a Fj(41)1203 1613 y SDict begin H.R end 1203 1613 a 1203 1672 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 1203 1672 a 50 1785 a Fj(\014ts)p 177 1785 28 4 v 32 w(write)p 411 1785 V 33 w(img)1067 1785 y SDict begin H.S end 1067 1785 a Fj(113)1203 1726 y SDict begin H.R end 1203 1726 a 1203 1785 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 1203 1785 a 50 1898 a Fj(\014ts)p 177 1898 28 4 v 32 w(write)p 411 1898 V 33 w(img)p 590 1898 V 33 w(n)m(ull)1067 1898 y SDict begin H.S end 1067 1898 a Fj(113)1203 1839 y SDict begin H.R end 1203 1839 a 1203 1898 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 1203 1898 a 50 2011 a Fj(\014ts)p 177 2011 28 4 v 32 w(write)p 411 2011 V 33 w(img)p 590 2011 V 33 w(TYP)1067 2011 y SDict begin H.S end 1067 2011 a Fj(113)1203 1952 y SDict begin H.R end 1203 1952 a 1203 2011 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 1203 2011 a 50 2124 a Fj(\014ts)p 177 2124 28 4 v 32 w(write)p 411 2124 V 33 w(imghdr)1067 2124 y SDict begin H.S end 1067 2124 a Fj(103)1203 2065 y SDict begin H.R end 1203 2065 a 1203 2124 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 1203 2124 a 50 2237 a Fj(\014ts)p 177 2237 28 4 v 32 w(write)p 411 2237 V 33 w(imgn)m(ull)1067 2237 y SDict begin H.S end 1067 2237 a Fj(113)1203 2178 y SDict begin H.R end 1203 2178 a 1203 2237 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 1203 2237 a 50 2349 a Fj(\014ts)p 177 2349 28 4 v 32 w(write)p 411 2349 V 33 w(imgn)m(ull)p 739 2349 V 33 w(TYP)1067 2349 y SDict begin H.S end 1067 2349 a Fj(113)1203 2291 y SDict begin H.R end 1203 2291 a 1203 2349 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 1203 2349 a 50 2462 a Fj(\014ts)p 177 2462 28 4 v 32 w(write)p 411 2462 V 33 w(k)m(ey)1112 2462 y SDict begin H.S end 1112 2462 a Fj(41)1203 2404 y SDict begin H.R end 1203 2404 a 1203 2462 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 1203 2462 a 50 2575 a Fj(\014ts)p 177 2575 28 4 v 32 w(write)p 411 2575 V 33 w(k)m(ey)p 577 2575 V 34 w(longstr)1067 2575 y SDict begin H.S end 1067 2575 a Fj(105)1203 2517 y SDict begin H.R end 1203 2517 a 1203 2575 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 1203 2575 a 50 2688 a Fj(\014ts)p 177 2688 28 4 v 32 w(write)p 411 2688 V 33 w(k)m(ey)p 577 2688 V 34 w(longw)m(arn)1067 2688 y SDict begin H.S end 1067 2688 a Fj(105)1203 2630 y SDict begin H.R end 1203 2630 a 1203 2688 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 1203 2688 a 50 2801 a Fj(\014ts)p 177 2801 28 4 v 32 w(write)p 411 2801 V 33 w(k)m(ey)p 577 2801 V 34 w(n)m(ull)1112 2801 y SDict begin H.S end 1112 2801 a Fj(41)1203 2743 y SDict begin H.R end 1203 2743 a 1203 2801 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 1203 2801 a 50 2914 a Fj(\014ts)p 177 2914 28 4 v 32 w(write)p 411 2914 V 33 w(k)m(ey)p 577 2914 V 34 w(template)1067 2914 y SDict begin H.S end 1067 2914 a Fj(106)1203 2855 y SDict begin H.R end 1203 2855 a 1203 2914 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 1203 2914 a 50 3027 a Fj(\014ts)p 177 3027 28 4 v 32 w(write)p 411 3027 V 33 w(k)m(ey)p 577 3027 V 34 w(triple)1067 3027 y SDict begin H.S end 1067 3027 a Fj(106)1203 2968 y SDict begin H.R end 1203 2968 a 1203 3027 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 1203 3027 a 50 3140 a Fj(\014ts)p 177 3140 28 4 v 32 w(write)p 411 3140 V 33 w(k)m(ey)p 577 3140 V 34 w(unit)1112 3140 y SDict begin H.S end 1112 3140 a Fj(42)1203 3081 y SDict begin H.R end 1203 3081 a 1203 3140 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 1203 3140 a 50 3253 a Fj(\014ts)p 177 3253 28 4 v 32 w(write)p 411 3253 V 33 w(k)m(ey)p 577 3253 V 34 w(TYP)1067 3253 y SDict begin H.S end 1067 3253 a Fj(105)1203 3194 y SDict begin H.R end 1203 3194 a 1203 3253 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 1203 3253 a 50 3366 a Fj(\014ts)p 177 3366 28 4 v 32 w(write)p 411 3366 V 33 w(k)m(eys)p 613 3366 V 34 w(TYP)1067 3366 y SDict begin H.S end 1067 3366 a Fj(106)1203 3307 y SDict begin H.R end 1203 3307 a 1203 3366 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 1203 3366 a 50 3479 a Fj(\014ts)p 177 3479 28 4 v 32 w(write)p 411 3479 V 33 w(k)m(eys)p 613 3479 V 34 w(histo)1112 3479 y SDict begin H.S end 1112 3479 a Fj(62)1203 3420 y SDict begin H.R end 1203 3420 a 1203 3479 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.6) cvn H.B /ANN pdfmark end 1203 3479 a 50 3591 a Fj(\014ts)p 177 3591 28 4 v 32 w(write)p 411 3591 V 33 w(n)m(ull)p 593 3591 V 33 w(img)1112 3591 y SDict begin H.S end 1112 3591 a Fj(45)1203 3533 y SDict begin H.R end 1203 3533 a 1203 3591 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 1203 3591 a 50 3704 a Fj(\014ts)p 177 3704 28 4 v 32 w(write)p 411 3704 V 33 w(n)m(ullro)m(ws)1112 3704 y SDict begin H.S end 1112 3704 a Fj(58)1203 3646 y SDict begin H.R end 1203 3646 a 1203 3704 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.4) cvn H.B /ANN pdfmark end 1203 3704 a 50 3817 a Fj(\014ts)p 177 3817 28 4 v 32 w(write)p 411 3817 V 33 w(pix)1112 3817 y SDict begin H.S end 1112 3817 a Fj(45)1203 3759 y SDict begin H.R end 1203 3759 a 1203 3817 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 1203 3817 a 50 3930 a Fj(\014ts)p 177 3930 28 4 v 32 w(write)p 411 3930 V 33 w(pixn)m(ull)1112 3930 y SDict begin H.S end 1112 3930 a Fj(45)1203 3872 y SDict begin H.R end 1203 3872 a 1203 3930 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 1203 3930 a 50 4043 a Fj(\014ts)p 177 4043 28 4 v 32 w(write)p 411 4043 V 33 w(record)1112 4043 y SDict begin H.S end 1112 4043 a Fj(42)1203 3985 y SDict begin H.R end 1203 3985 a 1203 4043 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 1203 4043 a 50 4156 a Fj(\014ts)p 177 4156 28 4 v 32 w(write)p 411 4156 V 33 w(subset)1112 4156 y SDict begin H.S end 1112 4156 a Fj(45)1203 4097 y SDict begin H.R end 1203 4097 a 1203 4156 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 1203 4156 a 50 4269 a Fj(\014ts)p 177 4269 28 4 v 32 w(write)p 411 4269 V 33 w(subset)p 693 4269 V 32 w(TYP)1067 4269 y SDict begin H.S end 1067 4269 a Fj(114)1203 4210 y SDict begin H.R end 1203 4210 a 1203 4269 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 1203 4269 a 50 4382 a Fj(\014ts)p 177 4382 28 4 v 32 w(write)p 411 4382 V 33 w(tblb)m(ytes)1067 4382 y SDict begin H.S end 1067 4382 a Fj(117)1203 4323 y SDict begin H.R end 1203 4323 a 1203 4382 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.2) cvn H.B /ANN pdfmark end 1203 4382 a 50 4495 a Fj(\014ts)p 177 4495 28 4 v 32 w(write)p 411 4495 V 33 w(tdim)1112 4495 y SDict begin H.S end 1112 4495 a Fj(55)1203 4436 y SDict begin H.R end 1203 4436 a 1203 4495 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 1203 4495 a 50 4608 a Fj(\014ts)p 177 4608 28 4 v 32 w(write)p 411 4608 V 33 w(theap)1067 4608 y SDict begin H.S end 1067 4608 a Fj(116)1203 4549 y SDict begin H.R end 1203 4549 a 1203 4608 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.1) cvn H.B /ANN pdfmark end 1203 4608 a eop end %%Page: 176 184 TeXDict begin 176 183 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.176) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(176)2084 b Fh(APPENDIX)31 b(A.)61 b(INDEX)31 b(OF)f(R)m(OUTINES)50 543 y Fj(\013asfm)564 543 y SDict begin H.S end 564 543 a Fj(70)655 484 y SDict begin H.R end 655 484 a 655 543 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 655 543 a 50 656 a Fj(\013bnfm)564 656 y SDict begin H.S end 564 656 a Fj(70)655 597 y SDict begin H.R end 655 597 a 655 656 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 655 656 a 50 769 a Fj(\013calc)564 769 y SDict begin H.S end 564 769 a Fj(61)655 710 y SDict begin H.R end 655 710 a 655 769 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 655 769 a 50 882 a Fj(\013calc)p 258 882 28 4 v 34 w(rng)564 882 y SDict begin H.S end 564 882 a Fj(61)655 823 y SDict begin H.R end 655 823 a 655 882 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 655 882 a 50 995 a Fj(\013ccls)564 995 y SDict begin H.S end 564 995 a Fj(57)655 936 y SDict begin H.R end 655 936 a 655 995 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 655 995 a 50 1107 a Fj(\013c)m(h)m(tps)246 b Fi(??)50 1220 y Fj(\013clos)564 1220 y SDict begin H.S end 564 1220 a Fj(35)655 1162 y SDict begin H.R end 655 1162 a 655 1220 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 655 1220 a 50 1333 a Fj(\013cmph)518 1333 y SDict begin H.S end 518 1333 a Fj(116)655 1275 y SDict begin H.R end 655 1275 a 655 1333 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.1) cvn H.B /ANN pdfmark end 655 1333 a 50 1446 a Fj(\013cmps)564 1446 y SDict begin H.S end 564 1446 a Fj(67)655 1388 y SDict begin H.R end 655 1388 a 655 1446 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 655 1446 a 50 1559 a Fj(\013cmrk)564 1559 y SDict begin H.S end 564 1559 a Fj(32)655 1501 y SDict begin H.R end 655 1501 a 655 1559 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.1) cvn H.B /ANN pdfmark end 655 1559 a 50 1672 a Fj(\013cmsg)564 1672 y SDict begin H.S end 564 1672 a Fj(32)655 1613 y SDict begin H.R end 655 1613 a 655 1672 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.1) cvn H.B /ANN pdfmark end 655 1672 a 50 1785 a Fj(\013cop)m(y)564 1785 y SDict begin H.S end 564 1785 a Fj(37)655 1726 y SDict begin H.R end 655 1726 a 655 1785 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 655 1785 a 50 1898 a Fj(\013cp)s(cl)564 1898 y SDict begin H.S end 564 1898 a Fj(57)655 1839 y SDict begin H.R end 655 1839 a 655 1898 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 655 1898 a 50 2011 a Fj(\013cp)s(dt)518 2011 y SDict begin H.S end 518 2011 a Fj(101)655 1952 y SDict begin H.R end 655 1952 a 655 2011 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 655 2011 a 50 2124 a Fj(\013cp\015)564 2124 y SDict begin H.S end 564 2124 a Fj(36)655 2065 y SDict begin H.R end 655 2065 a 655 2124 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 655 2124 a 50 2237 a Fj(\013cphd)564 2237 y SDict begin H.S end 564 2237 a Fj(37)655 2178 y SDict begin H.R end 655 2178 a 655 2237 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 655 2237 a 50 2349 a Fj(\013cpimg)564 2349 y SDict begin H.S end 564 2349 a Fj(47)655 2291 y SDict begin H.R end 655 2291 a 655 2349 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 655 2349 a 50 2462 a Fj(\013cpky)518 2462 y SDict begin H.S end 518 2462 a Fj(106)655 2404 y SDict begin H.R end 655 2404 a 655 2462 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 655 2462 a 50 2575 a Fj(\013cprw)564 2575 y SDict begin H.S end 564 2575 a Fj(57)655 2517 y SDict begin H.R end 655 2517 a 655 2575 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 655 2575 a 50 2688 a Fj(\013crhd)518 2688 y SDict begin H.S end 518 2688 a Fj(100)655 2630 y SDict begin H.R end 655 2630 a 655 2688 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 655 2688 a 50 2801 a Fj(\013crim)564 2801 y SDict begin H.S end 564 2801 a Fj(44)655 2743 y SDict begin H.R end 655 2743 a 655 2801 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 655 2801 a 50 2914 a Fj(\013cro)m(w)564 2914 y SDict begin H.S end 564 2914 a Fj(60)655 2855 y SDict begin H.R end 655 2855 a 655 2914 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 655 2914 a 50 3027 a Fj(\013crtb)564 3027 y SDict begin H.S end 564 3027 a Fj(52)655 2968 y SDict begin H.R end 655 2968 a 655 3027 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.1) cvn H.B /ANN pdfmark end 655 3027 a 50 3140 a Fj(\013dcol)564 3140 y SDict begin H.S end 564 3140 a Fj(56)655 3081 y SDict begin H.R end 655 3081 a 655 3140 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 655 3140 a 50 3253 a Fj(\013delt)564 3253 y SDict begin H.S end 564 3253 a Fj(35)655 3194 y SDict begin H.R end 655 3194 a 655 3253 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 655 3253 a 50 3366 a Fj(\013dhdu)564 3366 y SDict begin H.S end 564 3366 a Fj(37)655 3307 y SDict begin H.R end 655 3307 a 655 3366 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 655 3366 a 50 3479 a Fj(\013dk)m(ey)564 3479 y SDict begin H.S end 564 3479 a Fj(42)655 3420 y SDict begin H.R end 655 3420 a 655 3479 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 655 3479 a 50 3591 a Fj(\013dkinit)564 3591 y SDict begin H.S end 564 3591 a Fj(34)655 3533 y SDict begin H.R end 655 3533 a 655 3591 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 655 3591 a 50 3704 a Fj(\013dk)m(op)s(en) 564 3704 y SDict begin H.S end 564 3704 a Fj(32)655 3646 y SDict begin H.R end 655 3646 a 655 3704 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 655 3704 a 50 3817 a Fj(\013dopn)564 3817 y SDict begin H.S end 564 3817 a Fj(32)655 3759 y SDict begin H.R end 655 3759 a 655 3817 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 655 3817 a 50 3930 a Fj(\013drec)564 3930 y SDict begin H.S end 564 3930 a Fj(42)655 3872 y SDict begin H.R end 655 3872 a 655 3930 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 655 3930 a 50 4043 a Fj(\013dro)m(w)564 4043 y SDict begin H.S end 564 4043 a Fj(56)655 3985 y SDict begin H.R end 655 3985 a 655 4043 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 655 4043 a 50 4156 a Fj(\013drrg)564 4156 y SDict begin H.S end 564 4156 a Fj(56)655 4097 y SDict begin H.R end 655 4097 a 655 4156 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 655 4156 a 50 4269 a Fj(\013drws)564 4269 y SDict begin H.S end 564 4269 a Fj(56)655 4210 y SDict begin H.R end 655 4210 a 655 4269 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 655 4269 a 50 4382 a Fj(\013dstr)564 4382 y SDict begin H.S end 564 4382 a Fj(42)655 4323 y SDict begin H.R end 655 4323 a 655 4382 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 655 4382 a 50 4495 a Fj(\013dsum)564 4495 y SDict begin H.S end 564 4495 a Fj(65)655 4436 y SDict begin H.R end 655 4436 a 655 4495 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.1) cvn H.B /ANN pdfmark end 655 4495 a 50 4608 a Fj(\013dt2s)564 4608 y SDict begin H.S end 564 4608 a Fj(65)655 4549 y SDict begin H.R end 655 4549 a 655 4608 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.2) cvn H.B /ANN pdfmark end 655 4608 a 50 4721 a Fj(\013dtdm)564 4721 y SDict begin H.S end 564 4721 a Fj(55)655 4662 y SDict begin H.R end 655 4662 a 655 4721 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 655 4721 a 50 4833 a Fj(\013dt)m(yp)564 4833 y SDict begin H.S end 564 4833 a Fj(69)655 4775 y SDict begin H.R end 655 4775 a 655 4833 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 655 4833 a 50 4946 a Fj(\013eopn)564 4946 y SDict begin H.S end 564 4946 a Fj(32)655 4888 y SDict begin H.R end 655 4888 a 655 4946 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 655 4946 a 50 5059 a Fj(\013eqt)m(y)564 5059 y SDict begin H.S end 564 5059 a Fj(54)655 5001 y SDict begin H.R end 655 5001 a 655 5059 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 655 5059 a 50 5172 a Fj(\013esum)564 5172 y SDict begin H.S end 564 5172 a Fj(65)655 5114 y SDict begin H.R end 655 5114 a 655 5172 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.1) cvn H.B /ANN pdfmark end 655 5172 a 50 5285 a Fj(\013exest)564 5285 y SDict begin H.S end 564 5285 a Fj(98)655 5227 y SDict begin H.R end 655 5227 a 655 5285 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 655 5285 a 50 5398 a Fj(\013extn)564 5398 y SDict begin H.S end 564 5398 a Fj(97)655 5339 y SDict begin H.R end 655 5339 a 655 5398 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 655 5398 a 50 5511 a Fj(\013\013rw)564 5511 y SDict begin H.S end 564 5511 a Fj(60)655 5452 y SDict begin H.R end 655 5452 a 655 5511 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 655 5511 a 50 5624 a Fj(\013\015md)564 5624 y SDict begin H.S end 564 5624 a Fj(35)655 5565 y SDict begin H.R end 655 5565 a 655 5624 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 655 5624 a 50 5737 a Fj(\013\015nm)564 5737 y SDict begin H.S end 564 5737 a Fj(35)655 5678 y SDict begin H.R end 655 5678 a 655 5737 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 655 5737 a 50 5850 a Fj(\013\015sh)564 5850 y SDict begin H.S end 564 5850 a Fj(98)655 5791 y SDict begin H.R end 655 5791 a 655 5850 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 655 5850 a 785 543 a Fj(\013\015us)1349 543 y SDict begin H.S end 1349 543 a Fj(98)1440 484 y SDict begin H.R end 1440 484 a 1440 543 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 1440 543 a 785 656 a Fj(\013free)1157 656 y SDict begin H.S end 1157 656 a Fj(108)1293 597 y SDict begin H.R end 1293 597 a 1293 656 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.5) cvn H.B /ANN pdfmark end 1293 656 a Fj(,)1349 656 y SDict begin H.S end 1349 656 a Fj(40)1440 597 y SDict begin H.R end 1440 597 a 1440 656 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 1440 656 a 785 769 a Fj(\013fro)m(w)1349 769 y SDict begin H.S end 1349 769 a Fj(60)1440 710 y SDict begin H.R end 1440 710 a 1440 769 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 1440 769 a 785 882 a Fj(\013g2d)p 984 882 28 4 v 1303 882 a SDict begin H.S end 1303 882 a Fj(115)1440 823 y SDict begin H.R end 1440 823 a 1440 882 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 1440 882 a 785 995 a Fj(\013g3d)p 984 995 28 4 v 1303 995 a SDict begin H.S end 1303 995 a Fj(115)1440 936 y SDict begin H.R end 1440 936 a 1440 995 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 1440 995 a 785 1107 a Fj(\013gab)s(c)1349 1107 y SDict begin H.S end 1349 1107 a Fj(71)1440 1049 y SDict begin H.R end 1440 1049 a 1440 1107 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1440 1107 a 785 1220 a Fj(\013gacl)1303 1220 y SDict begin H.S end 1303 1220 a Fj(115)1440 1162 y SDict begin H.R end 1440 1162 a 1440 1220 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.1) cvn H.B /ANN pdfmark end 1440 1220 a 785 1333 a Fj(\013gb)s(cl)1303 1333 y SDict begin H.S end 1303 1333 a Fj(115)1440 1275 y SDict begin H.R end 1440 1275 a 1440 1333 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.1) cvn H.B /ANN pdfmark end 1440 1333 a 785 1446 a Fj(\013gcdw)1349 1446 y SDict begin H.S end 1349 1446 a Fj(55)1440 1388 y SDict begin H.R end 1440 1388 a 1440 1446 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 1440 1446 a 785 1559 a Fj(\013gcf)1349 1559 y SDict begin H.S end 1349 1559 a Fj(59)1440 1501 y SDict begin H.R end 1440 1501 a 1440 1559 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.4) cvn H.B /ANN pdfmark end 1440 1559 a 785 1672 a Fj(\013gcf)p 956 1672 28 4 v 1303 1672 a SDict begin H.S end 1303 1672 a Fj(119)1440 1613 y SDict begin H.R end 1440 1613 a 1440 1672 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 1440 1672 a 785 1785 a Fj(\013gc)m(ks)1349 1785 y SDict begin H.S end 1349 1785 a Fj(64)1440 1726 y SDict begin H.R end 1440 1726 a 1440 1785 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.1) cvn H.B /ANN pdfmark end 1440 1785 a 785 1898 a Fj(\013gcnn)1349 1898 y SDict begin H.S end 1349 1898 a Fj(53)1440 1839 y SDict begin H.R end 1440 1839 a 1440 1898 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 1440 1898 a 785 2011 a Fj(\013gcno)1349 2011 y SDict begin H.S end 1349 2011 a Fj(53)1440 1952 y SDict begin H.R end 1440 1952 a 1440 2011 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 1440 2011 a 785 2124 a Fj(\013gcrd)1349 2124 y SDict begin H.S end 1349 2124 a Fj(38)1440 2065 y SDict begin H.R end 1440 2065 a 1440 2124 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 1440 2124 a 785 2237 a Fj(\013gcv)1349 2237 y SDict begin H.S end 1349 2237 a Fj(59)1440 2178 y SDict begin H.R end 1440 2178 a 1440 2237 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.4) cvn H.B /ANN pdfmark end 1440 2237 a 785 2349 a Fj(\013gcv)p 976 2349 28 4 v 1303 2349 a SDict begin H.S end 1303 2349 a Fj(119)1440 2291 y SDict begin H.R end 1440 2291 a 1440 2349 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 1440 2349 a 785 2462 a Fj(\013gcx)1303 2462 y SDict begin H.S end 1303 2462 a Fj(121)1440 2404 y SDict begin H.R end 1440 2404 a 1440 2462 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 1440 2462 a 785 2575 a Fj(\013gdes)1303 2575 y SDict begin H.S end 1303 2575 a Fj(121)1440 2517 y SDict begin H.R end 1440 2517 a 1440 2575 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 1440 2575 a 785 2688 a Fj(\013gdess)1303 2688 y SDict begin H.S end 1303 2688 a Fj(121)1440 2630 y SDict begin H.R end 1440 2630 a 1440 2688 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 1440 2688 a 785 2801 a Fj(\013gerr)1349 2801 y SDict begin H.S end 1349 2801 a Fj(31)1440 2743 y SDict begin H.R end 1440 2743 a 1440 2801 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.1) cvn H.B /ANN pdfmark end 1440 2801 a 785 2914 a Fj(\013gextn)1303 2914 y SDict begin H.S end 1303 2914 a Fj(101)1440 2855 y SDict begin H.R end 1440 2855 a 1440 2914 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 1440 2914 a 785 3027 a Fj(\013ggp)p 984 3027 28 4 v 1303 3027 a SDict begin H.S end 1303 3027 a Fj(114)1440 2968 y SDict begin H.R end 1440 2968 a 1440 3027 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 1440 3027 a 785 3140 a Fj(\013ghad)1303 3140 y SDict begin H.S end 1303 3140 a Fj(100)1440 3081 y SDict begin H.R end 1440 3081 a 1440 3140 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 1440 3140 a 785 3253 a Fj(\013gh)m(bn)1303 3253 y SDict begin H.S end 1303 3253 a Fj(104)1440 3194 y SDict begin H.R end 1440 3194 a 1440 3253 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 1440 3253 a 785 3366 a Fj(\013ghdn)1349 3366 y SDict begin H.S end 1349 3366 a Fj(36)1440 3307 y SDict begin H.R end 1440 3307 a 1440 3366 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 1440 3366 a 785 3479 a Fj(\013ghdt)1349 3479 y SDict begin H.S end 1349 3479 a Fj(36)1440 3420 y SDict begin H.R end 1440 3420 a 1440 3479 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 1440 3479 a 785 3591 a Fj(\013ghpr)1303 3591 y SDict begin H.S end 1303 3591 a Fj(104)1440 3533 y SDict begin H.R end 1440 3533 a 1440 3591 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 1440 3591 a 785 3704 a Fj(\013ghps)1303 3704 y SDict begin H.S end 1303 3704 a Fj(102)1440 3646 y SDict begin H.R end 1440 3646 a 1440 3704 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.1) cvn H.B /ANN pdfmark end 1440 3704 a 785 3817 a Fj(\013ghsp)1349 3817 y SDict begin H.S end 1349 3817 a Fj(38)1440 3759 y SDict begin H.R end 1440 3759 a 1440 3817 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 1440 3817 a 785 3930 a Fj(\013gh)m(tb)1303 3930 y SDict begin H.S end 1303 3930 a Fj(104)1440 3872 y SDict begin H.R end 1440 3872 a 1440 3930 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 1440 3930 a 785 4043 a Fj(\013gics)1349 4043 y SDict begin H.S end 1349 4043 a Fj(87)1440 3985 y SDict begin H.R end 1440 3985 a 1440 4043 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.7.1) cvn H.B /ANN pdfmark end 1440 4043 a 785 4156 a Fj(\013gidm)1349 4156 y SDict begin H.S end 1349 4156 a Fj(43)1440 4097 y SDict begin H.R end 1440 4097 a 1440 4156 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 1440 4156 a 785 4269 a Fj(\013gidt)1349 4269 y SDict begin H.S end 1349 4269 a Fj(43)1440 4210 y SDict begin H.R end 1440 4210 a 1440 4269 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 1440 4269 a 785 4382 a Fj(\013giet)1349 4382 y SDict begin H.S end 1349 4382 a Fj(43)1440 4323 y SDict begin H.R end 1440 4323 a 1440 4382 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 1440 4382 a 785 4495 a Fj(\013gipr)1349 4495 y SDict begin H.S end 1349 4495 a Fj(43)1440 4436 y SDict begin H.R end 1440 4436 a 1440 4495 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 1440 4495 a 785 4608 a Fj(\013gisz)1349 4608 y SDict begin H.S end 1349 4608 a Fj(43)1440 4549 y SDict begin H.R end 1440 4549 a 1440 4608 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 1440 4608 a 785 4721 a Fj(\013gk)m(cl)1349 4721 y SDict begin H.S end 1349 4721 a Fj(69)1440 4662 y SDict begin H.R end 1440 4662 a 1440 4721 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1440 4721 a 785 4833 a Fj(\013gk)m(ey)1349 4833 y SDict begin H.S end 1349 4833 a Fj(38)1440 4775 y SDict begin H.R end 1440 4775 a 1440 4833 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 1440 4833 a 785 4946 a Fj(\013gkls)1303 4946 y SDict begin H.S end 1303 4946 a Fj(108)1440 4888 y SDict begin H.R end 1440 4888 a 1440 4946 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.5) cvn H.B /ANN pdfmark end 1440 4946 a 785 5059 a Fj(\013gksl)1349 5059 y SDict begin H.S end 1349 5059 a Fj(39)1440 5001 y SDict begin H.R end 1440 5001 a 1440 5059 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 1440 5059 a 785 5172 a Fj(\013gkn)p 987 5172 28 4 v 1303 5172 a SDict begin H.S end 1303 5172 a Fj(108)1440 5114 y SDict begin H.R end 1440 5114 a 1440 5172 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.5) cvn H.B /ANN pdfmark end 1440 5172 a 785 5285 a Fj(\013gknm)1349 5285 y SDict begin H.S end 1349 5285 a Fj(68)1440 5227 y SDict begin H.R end 1440 5227 a 1440 5285 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 1440 5285 a 785 5398 a Fj(\013gky)1349 5398 y SDict begin H.S end 1349 5398 a Fj(38)1440 5339 y SDict begin H.R end 1440 5339 a 1440 5398 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 1440 5398 a 785 5511 a Fj(\013gkyn)1349 5511 y SDict begin H.S end 1349 5511 a Fj(39)1440 5452 y SDict begin H.R end 1440 5452 a 1440 5511 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 1440 5511 a 785 5624 a Fj(\013gkyt)1303 5624 y SDict begin H.S end 1303 5624 a Fj(109)1440 5565 y SDict begin H.R end 1440 5565 a 1440 5624 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.5) cvn H.B /ANN pdfmark end 1440 5624 a 785 5737 a Fj(\013gky)p 984 5737 28 4 v 1303 5737 a SDict begin H.S end 1303 5737 a Fj(108)1440 5678 y SDict begin H.R end 1440 5678 a 1440 5737 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.5) cvn H.B /ANN pdfmark end 1440 5737 a 785 5850 a Fj(\013gmcp)1349 5850 y SDict begin H.S end 1349 5850 a Fj(93)1440 5791 y SDict begin H.R end 1440 5791 a 1440 5850 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.2) cvn H.B /ANN pdfmark end 1440 5850 a 1570 543 a Fj(\013gmng)2167 543 y SDict begin H.S end 2167 543 a Fj(93)2258 484 y SDict begin H.R end 2258 484 a 2258 543 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.2) cvn H.B /ANN pdfmark end 2258 543 a 1570 656 a Fj(\013gmop)2167 656 y SDict begin H.S end 2167 656 a Fj(93)2258 597 y SDict begin H.R end 2258 597 a 2258 656 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.2) cvn H.B /ANN pdfmark end 2258 656 a 1570 769 a Fj(\013gmrm)2167 769 y SDict begin H.S end 2167 769 a Fj(94)2258 710 y SDict begin H.R end 2258 710 a 2258 769 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.2) cvn H.B /ANN pdfmark end 2258 769 a 1570 882 a Fj(\013gmsg)2167 882 y SDict begin H.S end 2167 882 a Fj(32)2258 823 y SDict begin H.R end 2258 823 a 2258 882 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.1) cvn H.B /ANN pdfmark end 2258 882 a 1570 995 a Fj(\013gm)m(tf)2167 995 y SDict begin H.S end 2167 995 a Fj(93)2258 936 y SDict begin H.R end 2258 936 a 2258 995 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.2) cvn H.B /ANN pdfmark end 2258 995 a 1570 1107 a Fj(\013gncl)2167 1107 y SDict begin H.S end 2167 1107 a Fj(53)2258 1049 y SDict begin H.R end 2258 1049 a 2258 1107 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 2258 1107 a 1570 1220 a Fj(\013gnrw)2167 1220 y SDict begin H.S end 2167 1220 a Fj(53)2258 1162 y SDict begin H.R end 2258 1162 a 2258 1220 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 2258 1220 a 1570 1333 a Fj(\013gnxk)2167 1333 y SDict begin H.S end 2167 1333 a Fj(39)2258 1275 y SDict begin H.R end 2258 1275 a 2258 1333 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2258 1333 a 1570 1446 a Fj(\013gpf)2122 1446 y SDict begin H.S end 2122 1446 a Fj(114)2258 1388 y SDict begin H.R end 2258 1388 a 2258 1446 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2258 1446 a 1570 1559 a Fj(\013gpf)p 1752 1559 28 4 v 2122 1559 a SDict begin H.S end 2122 1559 a Fj(114)2258 1501 y SDict begin H.R end 2258 1501 a 2258 1559 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2258 1559 a 1570 1672 a Fj(\013gp)m(v)2122 1672 y SDict begin H.S end 2122 1672 a Fj(114)2258 1613 y SDict begin H.R end 2258 1613 a 2258 1672 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2258 1672 a 1570 1785 a Fj(\013gp)m(v)p 1769 1785 28 4 v 2122 1785 a SDict begin H.S end 2122 1785 a Fj(114)2258 1726 y SDict begin H.R end 2258 1726 a 2258 1785 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2258 1785 a 1570 1898 a Fj(\013gp)m(xv)2167 1898 y SDict begin H.S end 2167 1898 a Fj(46)2258 1839 y SDict begin H.R end 2258 1839 a 2258 1898 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 2258 1898 a 1570 2011 a Fj(\013gp)m(xf)2167 2011 y SDict begin H.S end 2167 2011 a Fj(46)2258 1952 y SDict begin H.R end 2258 1952 a 2258 2011 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 2258 2011 a 1570 2124 a Fj(\013grec)2167 2124 y SDict begin H.S end 2167 2124 a Fj(39)2258 2065 y SDict begin H.R end 2258 2065 a 2258 2124 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2258 2124 a 1570 2237 a Fj(\013grsz)2122 2237 y SDict begin H.S end 2122 2237 a Fj(116)2258 2178 y SDict begin H.R end 2258 2178 a 2258 2237 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.1) cvn H.B /ANN pdfmark end 2258 2237 a 1570 2349 a Fj(\013gsdt)2167 2349 y SDict begin H.S end 2167 2349 a Fj(65)2258 2291 y SDict begin H.R end 2258 2291 a 2258 2349 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.2) cvn H.B /ANN pdfmark end 2258 2349 a 1570 2462 a Fj(\013gsf)p 1737 2462 28 4 v 1955 2462 a SDict begin H.S end 1955 2462 a Fj(115)2091 2404 y SDict begin H.R end 2091 2404 a 2091 2462 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2091 2462 a 2122 2462 a SDict begin H.S end 2122 2462 a Fj(120)2258 2404 y SDict begin H.R end 2258 2404 a 2258 2462 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 2258 2462 a 1570 2575 a Fj(\013gsky)2167 2575 y SDict begin H.S end 2167 2575 a Fj(39)2258 2517 y SDict begin H.R end 2258 2517 a 2258 2575 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2258 2575 a 1570 2688 a Fj(\013gstm)2167 2688 y SDict begin H.S end 2167 2688 a Fj(65)2258 2630 y SDict begin H.R end 2258 2630 a 2258 2688 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.2) cvn H.B /ANN pdfmark end 2258 2688 a 1570 2801 a Fj(\013gstr)2167 2801 y SDict begin H.S end 2167 2801 a Fj(38)2258 2743 y SDict begin H.R end 2258 2743 a 2258 2801 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2258 2801 a 1570 2914 a Fj(\013gsv)2167 2914 y SDict begin H.S end 2167 2914 a Fj(46)2258 2855 y SDict begin H.R end 2258 2855 a 2258 2914 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 2258 2914 a 1570 3027 a Fj(\013gsv)p 1757 3027 28 4 v 1955 3027 a SDict begin H.S end 1955 3027 a Fj(115)2091 2968 y SDict begin H.R end 2091 2968 a 2091 3027 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2091 3027 a 2122 3027 a SDict begin H.S end 2122 3027 a Fj(120)2258 2968 y SDict begin H.R end 2258 2968 a 2258 3027 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.4) cvn H.B /ANN pdfmark end 2258 3027 a 1570 3140 a Fj(\013gtam)2167 3140 y SDict begin H.S end 2167 3140 a Fj(92)2258 3081 y SDict begin H.R end 2258 3081 a 2258 3140 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 2258 3140 a 1570 3253 a Fj(\013gtbb)2122 3253 y SDict begin H.S end 2122 3253 a Fj(117)2258 3194 y SDict begin H.R end 2258 3194 a 2258 3253 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.2) cvn H.B /ANN pdfmark end 2258 3253 a 1570 3366 a Fj(\013gtc)m(h)2167 3366 y SDict begin H.S end 2167 3366 a Fj(90)2258 3307 y SDict begin H.R end 2258 3307 a 2258 3366 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 2258 3366 a 1570 3479 a Fj(\013gtcl)2167 3479 y SDict begin H.S end 2167 3479 a Fj(54)2258 3420 y SDict begin H.R end 2258 3420 a 2258 3479 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 2258 3479 a 1570 3591 a Fj(\013gtcm)2167 3591 y SDict begin H.S end 2167 3591 a Fj(91)2258 3533 y SDict begin H.R end 2258 3533 a 2258 3591 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 2258 3591 a 1570 3704 a Fj(\013gtcp)2167 3704 y SDict begin H.S end 2167 3704 a Fj(91)2258 3646 y SDict begin H.R end 2258 3646 a 2258 3704 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 2258 3704 a 1570 3817 a Fj(\013gtcr)2167 3817 y SDict begin H.S end 2167 3817 a Fj(90)2258 3759 y SDict begin H.R end 2258 3759 a 2258 3817 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 2258 3817 a 1570 3930 a Fj(\013gtcs)2167 3930 y SDict begin H.S end 2167 3930 a Fj(87)2258 3872 y SDict begin H.R end 2258 3872 a 2258 3930 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.7.1) cvn H.B /ANN pdfmark end 2258 3930 a 1570 4043 a Fj(\013gtdm)2167 4043 y SDict begin H.S end 2167 4043 a Fj(55)2258 3985 y SDict begin H.R end 2258 3985 a 2258 4043 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 2258 4043 a 1570 4156 a Fj(\013gthd)2167 4156 y SDict begin H.S end 2167 4156 a Fj(71)2258 4097 y SDict begin H.R end 2258 4097 a 2258 4156 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 2258 4156 a 1570 4269 a Fj(\013gtis)2167 4269 y SDict begin H.S end 2167 4269 a Fj(90)2258 4210 y SDict begin H.R end 2258 4210 a 2258 4269 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 2258 4269 a 1570 4382 a Fj(\013gtmg)2167 4382 y SDict begin H.S end 2167 4382 a Fj(91)2258 4323 y SDict begin H.R end 2258 4323 a 2258 4382 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 2258 4382 a 1570 4495 a Fj(\013gtmo)2167 4495 y SDict begin H.S end 2167 4495 a Fj(99)2258 4436 y SDict begin H.R end 2258 4436 a 2258 4495 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.2) cvn H.B /ANN pdfmark end 2258 4495 a 1570 4608 a Fj(\013gtnm)2167 4608 y SDict begin H.S end 2167 4608 a Fj(92)2258 4549 y SDict begin H.R end 2258 4549 a 2258 4608 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.2) cvn H.B /ANN pdfmark end 2258 4608 a 1570 4721 a Fj(\013gtop)2167 4721 y SDict begin H.S end 2167 4721 a Fj(92)2258 4662 y SDict begin H.R end 2258 4662 a 2258 4721 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 2258 4721 a 1570 4833 a Fj(\013gtrm)2167 4833 y SDict begin H.S end 2167 4833 a Fj(91)2258 4775 y SDict begin H.R end 2258 4775 a 2258 4833 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 2258 4833 a 1570 4946 a Fj(\013gtvf)2167 4946 y SDict begin H.S end 2167 4946 a Fj(92)2258 4888 y SDict begin H.R end 2258 4888 a 2258 4946 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.8.1) cvn H.B /ANN pdfmark end 2258 4946 a 1570 5059 a Fj(\013gun)m(t)2167 5059 y SDict begin H.S end 2167 5059 a Fj(40)2258 5001 y SDict begin H.R end 2258 5001 a 2258 5059 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.1) cvn H.B /ANN pdfmark end 2258 5059 a 1570 5172 a Fj(\013hdef)2122 5172 y SDict begin H.S end 2122 5172 a Fj(102)2258 5114 y SDict begin H.R end 2258 5114 a 2258 5172 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.1) cvn H.B /ANN pdfmark end 2258 5172 a 1570 5285 a Fj(\016bin)2122 5285 y SDict begin H.S end 2122 5285 a Fj(101)2258 5227 y SDict begin H.R end 2258 5227 a 2258 5285 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 2258 5285 a 1570 5398 a Fj(\016cls)2167 5398 y SDict begin H.S end 2167 5398 a Fj(56)2258 5339 y SDict begin H.R end 2258 5339 a 2258 5398 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 2258 5398 a 1570 5511 a Fj(\016col)2167 5511 y SDict begin H.S end 2167 5511 a Fj(56)2258 5452 y SDict begin H.R end 2258 5452 a 2258 5511 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 2258 5511 a 1570 5624 a Fj(\016\014le)2167 5624 y SDict begin H.S end 2167 5624 a Fj(97)2258 5565 y SDict begin H.R end 2258 5565 a 2258 5624 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 2258 5624 a 1570 5737 a Fj(\016h)m(tps)2167 5737 y SDict begin H.S end 2167 5737 a Fj(99)2258 5678 y SDict begin H.R end 2258 5678 a 2258 5737 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 2258 5737 a 1570 5850 a Fj(\016img)2122 5850 y SDict begin H.S end 2122 5850 a Fj(100)2258 5791 y SDict begin H.R end 2258 5791 a 2258 5850 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 2258 5850 a 2388 543 a Fj(\016kls)2788 543 y SDict begin H.S end 2788 543 a Fj(107)2924 484 y SDict begin H.R end 2924 484 a 2924 543 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.4) cvn H.B /ANN pdfmark end 2924 543 a 2388 656 a Fj(\016kyu)2788 656 y SDict begin H.S end 2788 656 a Fj(107)2924 597 y SDict begin H.R end 2924 597 a 2924 656 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.4) cvn H.B /ANN pdfmark end 2924 656 a 2388 769 a Fj(\016ky)p 2565 769 28 4 v 2788 769 a SDict begin H.S end 2788 769 a Fj(107)2924 710 y SDict begin H.R end 2924 710 a 2924 769 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.4) cvn H.B /ANN pdfmark end 2924 769 a 2388 882 a Fj(\016mem)2833 882 y SDict begin H.S end 2833 882 a Fj(96)2924 823 y SDict begin H.R end 2924 823 a 2924 882 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 2924 882 a 2388 995 a Fj(\016nit)2833 995 y SDict begin H.S end 2833 995 a Fj(34)2924 936 y SDict begin H.R end 2924 936 a 2924 995 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 2924 995 a 2388 1107 a Fj(\016n)m(tt)m(yp)2833 1107 y SDict begin H.S end 2833 1107 a Fj(69)2924 1049 y SDict begin H.R end 2924 1049 a 2924 1107 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 2924 1107 a 2388 1220 a Fj(\016opn)2833 1220 y SDict begin H.S end 2833 1220 a Fj(32)2924 1162 y SDict begin H.R end 2924 1162 a 2924 1220 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 2924 1220 a 2388 1333 a Fj(\016rec)2788 1333 y SDict begin H.S end 2788 1333 a Fj(107)2924 1275 y SDict begin H.R end 2924 1275 a 2924 1333 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.4) cvn H.B /ANN pdfmark end 2924 1333 a 2388 1446 a Fj(\016ro)m(w)2833 1446 y SDict begin H.S end 2833 1446 a Fj(56)2924 1388 y SDict begin H.R end 2924 1388 a 2924 1446 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 2924 1446 a 2388 1559 a Fj(\016tab)2788 1559 y SDict begin H.S end 2788 1559 a Fj(101)2924 1501 y SDict begin H.R end 2924 1501 a 2924 1559 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 2924 1559 a 2388 1672 a Fj(\016ter)2833 1672 y SDict begin H.S end 2833 1672 a Fj(83)2924 1613 y SDict begin H.R end 2924 1613 a 2924 1672 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.6.4) cvn H.B /ANN pdfmark end 2924 1672 a 2388 1785 a Fj(\016url)2833 1785 y SDict begin H.S end 2833 1785 a Fj(97)2924 1726 y SDict begin H.R end 2924 1726 a 2924 1785 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 2924 1785 a 2388 1898 a Fj(\013k)m(eyn)2833 1898 y SDict begin H.S end 2833 1898 a Fj(68)2924 1839 y SDict begin H.R end 2924 1839 a 2924 1898 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 2924 1898 a 2388 2011 a Fj(\013mahd)2833 2011 y SDict begin H.S end 2833 2011 a Fj(36)2924 1952 y SDict begin H.R end 2924 1952 a 2924 2011 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 2924 2011 a 2388 2124 a Fj(\013mcom)2833 2124 y SDict begin H.S end 2833 2124 a Fj(42)2924 2065 y SDict begin H.R end 2924 2065 a 2924 2124 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 2924 2124 a 2388 2237 a Fj(\013mcrd)2788 2237 y SDict begin H.S end 2788 2237 a Fj(109)2924 2178 y SDict begin H.R end 2924 2178 a 2924 2237 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.6) cvn H.B /ANN pdfmark end 2924 2237 a 2388 2349 a Fj(\013mkky)2833 2349 y SDict begin H.S end 2833 2349 a Fj(68)2924 2291 y SDict begin H.R end 2924 2291 a 2924 2349 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 2924 2349 a 2388 2462 a Fj(\013mkls)2788 2462 y SDict begin H.S end 2788 2462 a Fj(109)2924 2404 y SDict begin H.R end 2924 2404 a 2924 2462 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.6) cvn H.B /ANN pdfmark end 2924 2462 a 2388 2575 a Fj(\013mkyu)2788 2575 y SDict begin H.S end 2788 2575 a Fj(110)2924 2517 y SDict begin H.R end 2924 2517 a 2924 2575 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.6) cvn H.B /ANN pdfmark end 2924 2575 a 2388 2688 a Fj(\013mky)p 2618 2688 28 4 v 2788 2688 a SDict begin H.S end 2788 2688 a Fj(109)2924 2630 y SDict begin H.R end 2924 2630 a 2924 2688 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.6) cvn H.B /ANN pdfmark end 2924 2688 a 2388 2801 a Fj(\013mnam)2833 2801 y SDict begin H.S end 2833 2801 a Fj(42)2924 2743 y SDict begin H.R end 2924 2743 a 2924 2801 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 2924 2801 a 2388 2914 a Fj(\013mnhd)2833 2914 y SDict begin H.S end 2833 2914 a Fj(36)2924 2855 y SDict begin H.R end 2924 2855 a 2924 2914 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 2924 2914 a 2388 3027 a Fj(\013mrec)2788 3027 y SDict begin H.S end 2788 3027 a Fj(109)2924 2968 y SDict begin H.R end 2924 2968 a 2924 3027 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.6) cvn H.B /ANN pdfmark end 2924 3027 a 2388 3140 a Fj(\013mrhd)2833 3140 y SDict begin H.S end 2833 3140 a Fj(36)2924 3081 y SDict begin H.R end 2924 3081 a 2924 3140 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 2924 3140 a 2388 3253 a Fj(\013m)m(v)m(ec)2833 3253 y SDict begin H.S end 2833 3253 a Fj(57)2924 3194 y SDict begin H.R end 2924 3194 a 2924 3253 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.3) cvn H.B /ANN pdfmark end 2924 3253 a 2388 3366 a Fj(\013nc)m(hk)2833 3366 y SDict begin H.S end 2833 3366 a Fj(68)2924 3307 y SDict begin H.R end 2924 3307 a 2924 3366 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 2924 3366 a 2388 3479 a Fj(\013nk)m(ey)2833 3479 y SDict begin H.S end 2833 3479 a Fj(68)2924 3420 y SDict begin H.R end 2924 3420 a 2924 3479 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 2924 3479 a 2388 3591 a Fj(\013omem)2833 3591 y SDict begin H.S end 2833 3591 a Fj(95)2924 3533 y SDict begin H.R end 2924 3533 a 2924 3591 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 2924 3591 a 2388 3704 a Fj(\013op)s(en)2833 3704 y SDict begin H.S end 2833 3704 a Fj(32)2924 3646 y SDict begin H.R end 2924 3646 a 2924 3704 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 2924 3704 a 2388 3817 a Fj(\013p2d)p 2593 3817 28 4 v 2788 3817 a SDict begin H.S end 2788 3817 a Fj(114)2924 3759 y SDict begin H.R end 2924 3759 a 2924 3817 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2924 3817 a 2388 3930 a Fj(\013p3d)p 2593 3930 28 4 v 2788 3930 a SDict begin H.S end 2788 3930 a Fj(114)2924 3872 y SDict begin H.R end 2924 3872 a 2924 3930 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2924 3930 a 2388 4043 a Fj(\013p)s(c)m(ks) 2833 4043 y SDict begin H.S end 2833 4043 a Fj(64)2924 3985 y SDict begin H.R end 2924 3985 a 2924 4043 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.1) cvn H.B /ANN pdfmark end 2924 4043 a 2388 4156 a Fj(\013p)s(cl)2833 4156 y SDict begin H.S end 2833 4156 a Fj(58)2924 4097 y SDict begin H.R end 2924 4097 a 2924 4156 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.4) cvn H.B /ANN pdfmark end 2924 4156 a 2388 4269 a Fj(\013p)s(cls)2788 4269 y SDict begin H.S end 2788 4269 a Fj(117)2924 4210 y SDict begin H.R end 2924 4210 a 2924 4269 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.3) cvn H.B /ANN pdfmark end 2924 4269 a 2388 4382 a Fj(\013p)s(cl)p 2565 4382 28 4 v 2788 4382 a SDict begin H.S end 2788 4382 a Fj(118)2924 4323 y SDict begin H.R end 2924 4323 a 2924 4382 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.3) cvn H.B /ANN pdfmark end 2924 4382 a 2388 4495 a Fj(\013p)s(clu)2833 4495 y SDict begin H.S end 2833 4495 a Fj(58)2924 4436 y SDict begin H.R end 2924 4436 a 2924 4495 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.4) cvn H.B /ANN pdfmark end 2924 4495 a 2388 4608 a Fj(\013p)s(cn)2833 4608 y SDict begin H.S end 2833 4608 a Fj(58)2924 4549 y SDict begin H.R end 2924 4549 a 2924 4608 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.4) cvn H.B /ANN pdfmark end 2924 4608 a 2388 4721 a Fj(\013p)s(cn)p 2591 4721 28 4 v 2788 4721 a SDict begin H.S end 2788 4721 a Fj(117)2924 4662 y SDict begin H.R end 2924 4662 a 2924 4721 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.3) cvn H.B /ANN pdfmark end 2924 4721 a 2388 4833 a Fj(\013p)s(com)2833 4833 y SDict begin H.S end 2833 4833 a Fj(41)2924 4775 y SDict begin H.R end 2924 4775 a 2924 4833 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 2924 4833 a 2388 4946 a Fj(\013p)s(dat)2833 4946 y SDict begin H.S end 2833 4946 a Fj(41)2924 4888 y SDict begin H.R end 2924 4888 a 2924 4946 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 2924 4946 a 2388 5059 a Fj(\013p)s(des)2788 5059 y SDict begin H.S end 2788 5059 a Fj(118)2924 5001 y SDict begin H.R end 2924 5001 a 2924 5059 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.3) cvn H.B /ANN pdfmark end 2924 5059 a 2388 5172 a Fj(\013p)s(extn)2788 5172 y SDict begin H.S end 2788 5172 a Fj(101)2924 5114 y SDict begin H.R end 2924 5114 a 2924 5172 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 2924 5172 a 2388 5285 a Fj(\013pgp)p 2593 5285 28 4 v 2788 5285 a SDict begin H.S end 2788 5285 a Fj(113)2924 5227 y SDict begin H.R end 2924 5227 a 2924 5285 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 2924 5285 a 2388 5398 a Fj(\013ph)m(bn)2788 5398 y SDict begin H.S end 2788 5398 a Fj(104)2924 5339 y SDict begin H.R end 2924 5339 a 2924 5398 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 2924 5398 a 2388 5511 a Fj(\013phext)2788 5511 y SDict begin H.S end 2788 5511 a Fj(103)2924 5452 y SDict begin H.R end 2924 5452 a 2924 5511 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 2924 5511 a 2388 5624 a Fj(\013phis)2833 5624 y SDict begin H.S end 2833 5624 a Fj(41)2924 5565 y SDict begin H.R end 2924 5565 a 2924 5624 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 2924 5624 a 2388 5737 a Fj(\013phpr)2788 5737 y SDict begin H.S end 2788 5737 a Fj(103)2924 5678 y SDict begin H.R end 2924 5678 a 2924 5737 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 2924 5737 a 2388 5850 a Fj(\013phps)2788 5850 y SDict begin H.S end 2788 5850 a Fj(103)2924 5791 y SDict begin H.R end 2924 5791 a 2924 5850 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 2924 5850 a 3054 543 a Fj(\013ph)m(tb)3472 543 y SDict begin H.S end 3472 543 a Fj(103)3609 484 y SDict begin H.R end 3609 484 a 3609 543 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.2) cvn H.B /ANN pdfmark end 3609 543 a 3054 656 a Fj(\013pkls)3472 656 y SDict begin H.S end 3472 656 a Fj(105)3609 597 y SDict begin H.R end 3609 597 a 3609 656 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 3609 656 a 3054 769 a Fj(\013pkn)p 3262 769 28 4 v 3472 769 a SDict begin H.S end 3472 769 a Fj(106)3609 710 y SDict begin H.R end 3609 710 a 3609 769 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 3609 769 a 3054 882 a Fj(\013pktp)3472 882 y SDict begin H.S end 3472 882 a Fj(106)3609 823 y SDict begin H.R end 3609 823 a 3609 882 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 3609 882 a 3054 995 a Fj(\013pky)3518 995 y SDict begin H.S end 3518 995 a Fj(41)3609 936 y SDict begin H.R end 3609 936 a 3609 995 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 3609 995 a 3054 1107 a Fj(\013pkyt)3472 1107 y SDict begin H.S end 3472 1107 a Fj(106)3609 1049 y SDict begin H.R end 3609 1049 a 3609 1107 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 3609 1107 a 3054 1220 a Fj(\013pkyu)3518 1220 y SDict begin H.S end 3518 1220 a Fj(41)3609 1162 y SDict begin H.R end 3609 1162 a 3609 1220 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 3609 1220 a 3054 1333 a Fj(\013pky)p 3259 1333 28 4 v 3472 1333 a SDict begin H.S end 3472 1333 a Fj(105)3609 1275 y SDict begin H.R end 3609 1275 a 3609 1333 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 3609 1333 a 3054 1446 a Fj(\013plsw)3472 1446 y SDict begin H.S end 3472 1446 a Fj(105)3609 1388 y SDict begin H.R end 3609 1388 a 3609 1446 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.3) cvn H.B /ANN pdfmark end 3609 1446 a 3054 1559 a Fj(\013pmrk)3518 1559 y SDict begin H.S end 3518 1559 a Fj(32)3609 1501 y SDict begin H.R end 3609 1501 a 3609 1559 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.1) cvn H.B /ANN pdfmark end 3609 1559 a 3054 1672 a Fj(\013pmsg)3518 1672 y SDict begin H.S end 3518 1672 a Fj(66)3609 1613 y SDict begin H.R end 3609 1613 a 3609 1672 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 3609 1672 a 3054 1785 a Fj(\013pn)m(ul)3472 1785 y SDict begin H.S end 3472 1785 a Fj(111)3609 1726 y SDict begin H.R end 3609 1726 a 3609 1785 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.4) cvn H.B /ANN pdfmark end 3609 1785 a 3054 1898 a Fj(\013ppn)3472 1898 y SDict begin H.S end 3472 1898 a Fj(113)3609 1839 y SDict begin H.R end 3609 1839 a 3609 1898 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 3609 1898 a 3054 2011 a Fj(\013ppn)p 3265 2011 28 4 v 3472 2011 a SDict begin H.S end 3472 2011 a Fj(113)3609 1952 y SDict begin H.R end 3609 1952 a 3609 2011 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 3609 2011 a 3054 2124 a Fj(\013ppr)3472 2124 y SDict begin H.S end 3472 2124 a Fj(113)3609 2065 y SDict begin H.R end 3609 2065 a 3609 2124 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 3609 2124 a 3054 2237 a Fj(\013pprn)3518 2237 y SDict begin H.S end 3518 2237 a Fj(45)3609 2178 y SDict begin H.R end 3609 2178 a 3609 2237 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 3609 2237 a 3054 2349 a Fj(\013ppru)3472 2349 y SDict begin H.S end 3472 2349 a Fj(113)3609 2291 y SDict begin H.R end 3609 2291 a 3609 2349 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 3609 2349 a 3054 2462 a Fj(\013ppr)p 3250 2462 28 4 v 3472 2462 a SDict begin H.S end 3472 2462 a Fj(113)3609 2404 y SDict begin H.R end 3609 2404 a 3609 2462 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 3609 2462 a 3054 2575 a Fj(\013pp)m(x)3518 2575 y SDict begin H.S end 3518 2575 a Fj(45)3609 2517 y SDict begin H.R end 3609 2517 a 3609 2575 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 3609 2575 a 3054 2688 a Fj(\013pp)m(xn)3518 2688 y SDict begin H.S end 3518 2688 a Fj(45)3609 2630 y SDict begin H.R end 3609 2630 a 3609 2688 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 3609 2688 a 3054 2801 a Fj(\013prec)3518 2801 y SDict begin H.S end 3518 2801 a Fj(42)3609 2743 y SDict begin H.R end 3609 2743 a 3609 2801 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 3609 2801 a 3054 2914 a Fj(\013prwu)3518 2914 y SDict begin H.S end 3518 2914 a Fj(58)3609 2855 y SDict begin H.R end 3609 2855 a 3609 2914 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.4) cvn H.B /ANN pdfmark end 3609 2914 a 3054 3027 a Fj(\013pscl)3472 3027 y SDict begin H.S end 3472 3027 a Fj(111)3609 2968 y SDict begin H.R end 3609 2968 a 3609 3027 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.4) cvn H.B /ANN pdfmark end 3609 3027 a 3054 3140 a Fj(\013pss)3518 3140 y SDict begin H.S end 3518 3140 a Fj(45)3609 3081 y SDict begin H.R end 3609 3081 a 3609 3140 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.5) cvn H.B /ANN pdfmark end 3609 3140 a 3054 3253 a Fj(\013pss)p 3235 3253 28 4 v 3472 3253 a SDict begin H.S end 3472 3253 a Fj(114)3609 3194 y SDict begin H.R end 3609 3194 a 3609 3253 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.5) cvn H.B /ANN pdfmark end 3609 3253 a 3054 3366 a Fj(\013psv)m(c)3518 3366 y SDict begin H.S end 3518 3366 a Fj(68)3609 3307 y SDict begin H.R end 3609 3307 a 3609 3366 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 3609 3366 a 3054 3479 a Fj(\013ptbb)3472 3479 y SDict begin H.S end 3472 3479 a Fj(117)3609 3420 y SDict begin H.R end 3609 3420 a 3609 3479 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.2) cvn H.B /ANN pdfmark end 3609 3479 a 3054 3591 a Fj(\013ptdm)3518 3591 y SDict begin H.S end 3518 3591 a Fj(55)3609 3533 y SDict begin H.R end 3609 3533 a 3609 3591 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.2) cvn H.B /ANN pdfmark end 3609 3591 a 3054 3704 a Fj(\013pthp)3472 3704 y SDict begin H.S end 3472 3704 a Fj(116)3609 3646 y SDict begin H.R end 3609 3646 a 3609 3704 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.1) cvn H.B /ANN pdfmark end 3609 3704 a 3054 3817 a Fj(\013pun)m(t)3518 3817 y SDict begin H.S end 3518 3817 a Fj(42)3609 3759 y SDict begin H.R end 3609 3759 a 3609 3817 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 3609 3817 a 3054 3930 a Fj(\013rdef)3472 3930 y SDict begin H.S end 3472 3930 a Fj(102)3609 3872 y SDict begin H.R end 3609 3872 a 3609 3930 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 3609 3930 a 3054 4043 a Fj(\013reop)s(en)3518 4043 y SDict begin H.S end 3518 4043 a Fj(96)3609 3985 y SDict begin H.R end 3609 3985 a 3609 4043 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 3609 4043 a 3054 4156 a Fj(\013rprt)3518 4156 y SDict begin H.S end 3518 4156 a Fj(32)3609 4097 y SDict begin H.R end 3609 4097 a 3609 4156 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.1) cvn H.B /ANN pdfmark end 3609 4156 a 3054 4269 a Fj(\013rsim)3472 4269 y SDict begin H.S end 3472 4269 a Fj(101)3609 4210 y SDict begin H.R end 3609 4210 a 3609 4269 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.2) cvn H.B /ANN pdfmark end 3609 4269 a 3054 4382 a Fj(\013rtnm)3518 4382 y SDict begin H.S end 3518 4382 a Fj(98)3609 4323 y SDict begin H.R end 3609 4323 a 3609 4382 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 3609 4382 a 3054 4495 a Fj(\013rwrg)3518 4495 y SDict begin H.S end 3518 4495 a Fj(75)3609 4436 y SDict begin H.R end 3609 4436 a 3609 4495 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 3609 4495 a 3054 4608 a Fj(\013s2dt)3518 4608 y SDict begin H.S end 3518 4608 a Fj(65)3609 4549 y SDict begin H.R end 3609 4549 a 3609 4608 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.2) cvn H.B /ANN pdfmark end 3609 4608 a 3054 4721 a Fj(\013s2tm)3518 4721 y SDict begin H.S end 3518 4721 a Fj(65)3609 4662 y SDict begin H.R end 3609 4662 a 3609 4721 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.2) cvn H.B /ANN pdfmark end 3609 4721 a 3054 4833 a Fj(\013shdwn)3518 4833 y SDict begin H.S end 3518 4833 a Fj(99)3609 4775 y SDict begin H.R end 3609 4775 a 3609 4833 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.2) cvn H.B /ANN pdfmark end 3609 4833 a 3054 4946 a Fj(\013sn)m(ul)3472 4946 y SDict begin H.S end 3472 4946 a Fj(111)3609 4888 y SDict begin H.R end 3609 4888 a 3609 4946 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.4) cvn H.B /ANN pdfmark end 3609 4946 a 3054 5059 a Fj(\013sro)m(w)3518 5059 y SDict begin H.S end 3518 5059 a Fj(60)3609 5001 y SDict begin H.R end 3609 5001 a 3609 5059 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 3609 5059 a 3054 5172 a Fj(\013stmo)3518 5172 y SDict begin H.S end 3518 5172 a Fj(99)3609 5114 y SDict begin H.R end 3609 5114 a 3609 5172 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.2) cvn H.B /ANN pdfmark end 3609 5172 a 3054 5285 a Fj(\013texp)3518 5285 y SDict begin H.S end 3518 5285 a Fj(61)3609 5227 y SDict begin H.R end 3609 5227 a 3609 5285 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.7.5) cvn H.B /ANN pdfmark end 3609 5285 a 3054 5398 a Fj(\013thdu)3518 5398 y SDict begin H.S end 3518 5398 a Fj(36)3609 5339 y SDict begin H.R end 3609 5339 a 3609 5398 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 3609 5398 a 3054 5511 a Fj(\013theap)3472 5511 y SDict begin H.S end 3472 5511 a Fj(116)3609 5452 y SDict begin H.R end 3609 5452 a 3609 5511 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.6.1) cvn H.B /ANN pdfmark end 3609 5511 a 3054 5624 a Fj(\013tk)m(ey)3518 5624 y SDict begin H.S end 3518 5624 a Fj(67)3609 5565 y SDict begin H.R end 3609 5565 a 3609 5624 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 3609 5624 a 3054 5737 a Fj(\013tm2s)3518 5737 y SDict begin H.S end 3518 5737 a Fj(65)3609 5678 y SDict begin H.R end 3609 5678 a 3609 5737 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.2) cvn H.B /ANN pdfmark end 3609 5737 a 3054 5850 a Fj(\013tn)m(ul)3472 5850 y SDict begin H.S end 3472 5850 a Fj(111)3609 5791 y SDict begin H.R end 3609 5791 a 3609 5850 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.4) cvn H.B /ANN pdfmark end 3609 5850 a eop end %%Page: 177 185 TeXDict begin 177 184 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.177) cvn /DEST pdfmark end -8 191 a 3764 299 a Fj(177)50 543 y(\013topn)501 543 y SDict begin H.S end 501 543 a Fj(32)592 484 y SDict begin H.R end 592 484 a 592 543 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 592 543 a 50 656 a Fj(\013tplt)501 656 y SDict begin H.S end 501 656 a Fj(96)592 597 y SDict begin H.R end 592 597 a 592 656 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.1) cvn H.B /ANN pdfmark end 592 656 a 50 769 a Fj(\013trec)501 769 y SDict begin H.S end 501 769 a Fj(67)592 710 y SDict begin H.R end 592 710 a 592 769 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 592 769 a 50 882 a Fj(\013tscl)455 882 y SDict begin H.S end 455 882 a Fj(111)592 823 y SDict begin H.R end 592 823 a 592 882 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.9.4) cvn H.B /ANN pdfmark end 592 882 a 50 995 a Fj(\013ucrd)501 995 y SDict begin H.S end 501 995 a Fj(42)592 936 y SDict begin H.R end 592 936 a 592 995 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 592 995 a 50 1107 a Fj(\013ukls)455 1107 y SDict begin H.S end 455 1107 a Fj(110)592 1049 y SDict begin H.R end 592 1049 a 592 1107 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.7) cvn H.B /ANN pdfmark end 592 1107 a 50 1220 a Fj(\013uky)501 1220 y SDict begin H.S end 501 1220 a Fj(41)592 1162 y SDict begin H.R end 592 1162 a 592 1220 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 592 1220 a 50 1333 a Fj(\013ukyu)501 1333 y SDict begin H.S end 501 1333 a Fj(41)592 1275 y SDict begin H.R end 592 1275 a 592 1333 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.4.2) cvn H.B /ANN pdfmark end 592 1333 a 50 1446 a Fj(\013uky)p 255 1446 28 4 v 455 1446 a SDict begin H.S end 455 1446 a Fj(110)592 1388 y SDict begin H.R end 592 1388 a 592 1446 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.3.7) cvn H.B /ANN pdfmark end 592 1446 a 50 1559 a Fj(\013up)s(c)m(h)501 1559 y SDict begin H.S end 501 1559 a Fj(67)592 1501 y SDict begin H.R end 592 1501 a 592 1559 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 592 1559 a 50 1672 a Fj(\013up)s(c)m(k)501 1672 y SDict begin H.S end 501 1672 a Fj(64)592 1613 y SDict begin H.R end 592 1613 a 592 1672 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.1) cvn H.B /ANN pdfmark end 592 1672 a 50 1785 a Fj(\013urlt)501 1785 y SDict begin H.S end 501 1785 a Fj(35)592 1726 y SDict begin H.R end 592 1726 a 592 1785 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.2) cvn H.B /ANN pdfmark end 592 1785 a 50 1898 a Fj(\013v)m(c)m(ks)501 1898 y SDict begin H.S end 501 1898 a Fj(64)592 1839 y SDict begin H.R end 592 1839 a 592 1898 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.1) cvn H.B /ANN pdfmark end 592 1898 a 50 2011 a Fj(\013v)m(ers)501 2011 y SDict begin H.S end 501 2011 a Fj(66)592 1952 y SDict begin H.R end 592 1952 a 592 2011 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.5.8.3) cvn H.B /ANN pdfmark end 592 2011 a 50 2124 a Fj(\013vh)m(tps)501 2124 y SDict begin H.S end 501 2124 a Fj(99)592 2065 y SDict begin H.R end 592 2065 a 592 2124 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (subsection.9.1.2) cvn H.B /ANN pdfmark end 592 2124 a 50 2237 a Fj(\013wldp)501 2237 y SDict begin H.S end 501 2237 a Fj(87)592 2178 y SDict begin H.R end 592 2178 a 592 2237 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.7.1) cvn H.B /ANN pdfmark end 592 2237 a 50 2349 a Fj(\013wrhdu)501 2349 y SDict begin H.S end 501 2349 a Fj(37)592 2291 y SDict begin H.R end 592 2291 a 592 2349 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.5.3) cvn H.B /ANN pdfmark end 592 2349 a 50 2462 a Fj(\013xyp)m(x)501 2462 y SDict begin H.S end 501 2462 a Fj(87)592 2404 y SDict begin H.R end 592 2404 a 592 2462 a SDict begin [/Color [1 0 0]/H /I/Border [0 0 1]BorderArrayPatch/Subtype /Link/Dest (section.7.1) cvn H.B /ANN pdfmark end 592 2462 a eop end %%Page: 178 186 TeXDict begin 178 185 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.178) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(178)2084 b Fh(APPENDIX)31 b(A.)61 b(INDEX)31 b(OF)f(R)m(OUTINES)p eop end %%Page: 179 187 TeXDict begin 179 186 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.179) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (appendix.B) cvn /DEST pdfmark end 0 464 a 761 x Fg(App)5 b(endix)64 b(B)0 1687 y Fm(P)-6 b(arameter)77 b(De\014nitions)0 2180 y Fe(anynul)142 b(-)47 b(set)g(to)g(TRUE)g(\(=1\))f(if)i(any)e (returned)g(values)g(are)h(undefined,)e(else)i(FALSE)0 2293 y(array)190 b(-)47 b(array)f(of)i(numerical)d(data)h(values)h(to)g (read)f(or)i(write)0 2406 y(ascii)190 b(-)47 b(encoded)f(checksum)f (string)0 2518 y(binspec)94 b(-)47 b(the)g(input)f(table)h(binning)e (specifier)0 2631 y(bitpix)142 b(-)47 b(bits)g(per)g(pixel.)f(The)h (following)e(symbolic)g(mnemonics)h(are)h(predefined:)716 2744 y(BYTE_IMG)141 b(=)i(8)47 b(\(unsigned)f(char\))716 2857 y(SHORT_IMG)93 b(=)i(16)47 b(\(signed)f(short)g(integer\))716 2970 y(LONG_IMG)141 b(=)95 b(32)47 b(\(signed)f(long)h(integer\))716 3083 y(LONGLONG_IMG)d(=)96 b(64)47 b(\(signed)f(long)g(64-bit)g (integer\))716 3196 y(FLOAT_IMG)93 b(=)47 b(-32)g(\(float\))716 3309 y(DOUBLE_IMG)e(=)i(-64)g(\(double\).)525 3422 y(Two)g(additional)e (values,)h(USHORT_IMG)f(and)i(ULONG_IMG)e(are)i(also)f(available)525 3535 y(for)h(creating)e(unsigned)h(integer)g(images.)93 b(These)47 b(are)g(equivalent)e(to)525 3648 y(creating)h(a)h(signed)f (integer)g(image)g(with)h(BZERO)f(offset)g(keyword)g(values)525 3760 y(of)h(32768)g(or)g(2147483648,)d(respectively,)h(which)h(is)h (the)g(convention)e(that)525 3873 y(FITS)i(uses)f(to)h(store)g (unsigned)e(integers.)0 3986 y(card)238 b(-)47 b(header)f(record)g(to)h (be)h(read)e(or)h(written)f(\(80)h(char)g(max,)f(null-terminated\))0 4099 y(casesen)94 b(-)47 b(CASESEN)f(\(=1\))g(for)h(case-sensitive)d (string)i(matching,)g(else)g(CASEINSEN)g(\(=0\))0 4212 y(cmopt)190 b(-)47 b(grouping)f(table)g("compact")f(option)h (parameter.)f(Allowed)h(values)g(are:)525 4325 y(OPT_CMT_MBR)f(and)i (OPT_CMT_MBR_DEL.)0 4438 y(colname)94 b(-)47 b(name)g(of)g(the)g (column)f(\(null-terminated\))0 4551 y(colnum)142 b(-)47 b(column)f(number)g(\(first)g(column)g(=)i(1\))0 4664 y(colspec)94 b(-)47 b(the)g(input)f(file)h(column)f(specification;)e (used)j(to)g(delete,)f(create,)f(or)j(rename)525 4777 y(table)e(columns)0 4890 y(comment)94 b(-)47 b(the)g(keyword)f(comment) g(field)g(\(72)h(char)f(max,)h(null-terminated\))0 5002 y(complm)142 b(-)47 b(should)f(the)h(checksum)f(be)h(complemented?)0 5115 y(comptype)f(-)h(compression)e(algorithm)g(to)i(use:)g(GZIP_1,)f (RICE_1,)f(HCOMPRESS_1,)g(or)i(PLIO_1)0 5228 y(coordtype-)e(type)i(of)g (coordinate)e(projection)g(\(-SIN,)h(-TAN,)g(-ARC,)h(-NCP,)525 5341 y(-GLS,)f(-MER,)h(or)g(-AIT\))0 5454 y(cpopt)190 b(-)47 b(grouping)f(table)g(copy)h(option)f(parameter.)f(Allowed)g (values)i(are:)525 5567 y(OPT_GCP_GPT,)d(OPT_GCP_MBR,)h(OPT_GCP_ALL,)f (OPT_MCP_ADD,)h(OPT_MCP_NADD,)525 5680 y(OPT_MCP_REPL,)f(amd)j (OPT_MCP_MOV.)1882 5942 y Fj(179)p eop end %%Page: 180 188 TeXDict begin 180 187 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.180) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(180)1822 b Fh(APPENDIX)31 b(B.)61 b(P)-8 b(ARAMETER)30 b(DEFINITIONS)0 555 y Fe(create_col-)45 b(If)i(TRUE,)f(then)h(insert)f(a)h(new)g (column)f(in)i(the)f(table,)f(otherwise)525 668 y(overwrite)f(the)i (existing)f(column.)0 781 y(current)94 b(-)47 b(if)g(TRUE,)g(then)f (the)h(current)f(HDU)h(will)f(be)i(copied)0 894 y(dataok)142 b(-)47 b(was)g(the)g(data)f(unit)h(verification)e(successful)g(\(=1\))h (or)525 1007 y(not)h(\(=)g(-1\).)94 b(Equals)47 b(zero)f(if)h(the)g (DATASUM)f(keyword)g(is)h(not)g(present.)0 1120 y(datasum)94 b(-)47 b(32-bit)f(1's)h(complement)e(checksum)h(for)g(the)h(data)g (unit)0 1233 y(dataend)94 b(-)47 b(address)f(\(in)h(bytes\))f(of)h(the) g(end)g(of)g(the)g(HDU)0 1346 y(datastart-)e(address)h(\(in)h(bytes\))f (of)h(the)g(start)f(of)h(the)g(data)g(unit)0 1458 y(datatype)f(-)h (specifies)e(the)i(data)g(type)f(of)i(the)f(value.)93 b(Allowed)46 b(value)h(are:)94 b(TSTRING,)525 1571 y(TLOGICAL,)45 b(TBYTE,)h(TSBYTE,)g(TSHORT,)g(TUSHORT,)g(TINT,)g(TUINT,)g(TLONG,)g (TULONG,)525 1684 y(TFLOAT,)g(TDOUBLE,)f(TCOMPLEX,)h(and)h(TDBLCOMPLEX) 0 1797 y(datestr)94 b(-)47 b(FITS)g(date/time)e(string:)h ('YYYY-MM-DDThh:mm:ss.dd)o(d',)41 b('YYYY-MM-dd',)525 1910 y(or)47 b('dd/mm/yy')0 2023 y(day)286 b(-)47 b(calendar)f(day)g (\(UTC\))h(\(1-31\))0 2136 y(decimals)f(-)h(number)f(of)h(decimal)f (places)g(to)h(be)h(displayed)0 2249 y(deltasize)d(-)j(increment)d(for) i(allocating)e(more)i(memory)0 2362 y(dim1)238 b(-)47 b(declared)f(size)g(of)h(the)g(first)g(dimension)e(of)i(the)g(image)f (or)i(cube)e(array)0 2475 y(dim2)238 b(-)47 b(declared)f(size)g(of)h (the)g(second)f(dimension)g(of)h(the)g(data)f(cube)h(array)0 2588 y(dispwidth)e(-)j(display)e(width)g(of)h(a)h(column)e(=)h(length)f (of)h(string)f(that)h(will)g(be)g(read)0 2700 y(dtype)190 b(-)47 b(data)g(type)f(of)h(the)g(keyword)f(\('C',)h('L',)f('I',)h('F') g(or)g('X'\))764 2813 y(C)g(=)h(character)d(string)764 2926 y(L)i(=)h(logical)764 3039 y(I)f(=)h(integer)764 3152 y(F)f(=)h(floating)d(point)h(number)764 3265 y(X)h(=)h(complex,)d (e.g.,)h("\(1.23,)g(-4.56\)")0 3378 y(err_msg)94 b(-)47 b(error)f(message)g(on)h(the)g(internal)f(stack)g(\(80)h(chars)f(max\)) 0 3491 y(err_text)g(-)h(error)f(message)g(string)g(corresponding)e(to)k (error)e(number)g(\(30)h(chars)f(max\))0 3604 y(exact)190 b(-)47 b(TRUE)g(\(=1\))f(if)h(the)g(strings)f(match)h(exactly;)525 3717 y(FALSE)f(\(=0\))h(if)g(wildcards)e(are)i(used)0 3830 y(exclist)94 b(-)47 b(array)f(of)i(pointers)d(to)i(keyword)f (names)g(to)i(be)f(excluded)e(from)i(search)0 3942 y(exists)142 b(-)47 b(flag)g(indicating)e(whether)g(the)i(file)g(or)g(compressed)e (file)i(exists)f(on)h(disk)0 4055 y(expr)238 b(-)47 b(boolean)f(or)h (arithmetic)e(expression)0 4168 y(extend)142 b(-)47 b(TRUE)g(\(=1\))f (if)h(FITS)g(file)g(may)g(have)f(extensions,)f(else)i(FALSE)f(\(=0\))0 4281 y(extname)94 b(-)47 b(value)f(of)i(the)e(EXTNAME)g(keyword)g (\(null-terminated\))0 4394 y(extspec)94 b(-)47 b(the)g(extension)e(or) i(HDU)g(specifier;)e(a)j(number)e(or)h(name,)f(version,)g(and)h(type)0 4507 y(extver)142 b(-)47 b(value)f(of)i(the)e(EXTVER)h(keyword)e(=)j (integer)e(version)f(number)0 4620 y(filename)h(-)h(full)g(name)f(of)h (the)g(FITS)g(file,)f(including)g(optional)f(HDU)i(and)g(filtering)e (specs)0 4733 y(filetype)h(-)h(type)g(of)g(file)f(\(file://,)g(ftp://,) g(http://,)f(etc.\))0 4846 y(filter)142 b(-)47 b(the)g(input)f(file)h (filtering)e(specifier)0 4959 y(firstchar-)g(starting)h(byte)g(in)h (the)g(row)g(\(first)f(byte)h(of)g(row)g(=)g(1\))0 5072 y(firstfailed)e(-)i(member)f(HDU)h(ID)g(\(if)g(positive\))f(or)h (grouping)e(table)i(GRPIDn)f(index)525 5185 y(value)g(\(if)h (negative\))f(that)g(failed)g(grouping)g(table)g(verification.)0 5297 y(firstelem-)f(first)h(element)g(in)h(a)h(vector)e(\(ignored)f (for)i(ASCII)g(tables\))0 5410 y(firstrow)f(-)h(starting)f(row)g (number)h(\(first)f(row)h(of)g(table)f(=)i(1\))0 5523 y(following-)d(if)i(TRUE,)g(any)f(HDUs)h(following)e(the)i(current)f (HDU)h(will)g(be)g(copied)0 5636 y(fpixel)142 b(-)47 b(coordinate)e(of)i(the)g(first)f(pixel)h(to)g(be)g(read)g(or)g (written)f(in)h(the)p eop end %%Page: 181 189 TeXDict begin 181 188 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.181) cvn /DEST pdfmark end -8 191 a 3764 299 a Fj(181)525 555 y Fe(FITS)47 b(array.)93 b(The)47 b(array)g(must)f(be)i(of)f (length)f(NAXIS)g(and)h(have)g(values)f(such)525 668 y(that)h(fpixel[0])e(is)i(in)g(the)g(range)g(1)g(to)g(NAXIS1,)f (fpixel[1])f(is)i(in)h(the)525 781 y(range)e(1)i(to)f(NAXIS2,)f(etc.)0 894 y(fptr)238 b(-)47 b(pointer)f(to)h(a)g('fitsfile')e(structure)h (describing)f(the)i(FITS)f(file.)0 1007 y(frac)238 b(-)47 b(factional)e(part)i(of)g(the)g(keyword)f(value)0 1120 y(gcount)142 b(-)47 b(number)f(of)h(groups)f(in)i(the)e(primary)g (array)h(\(usually)e(=)j(1\))0 1233 y(gfptr)190 b(-)47 b(fitsfile*)e(pointer)h(to)h(a)h(grouping)d(table)i(HDU.)0 1346 y(group)190 b(-)47 b(GRPIDn/GRPLCn)d(index)j(value)f(identifying)f (a)i(grouping)f(table)g(HDU,)h(or)525 1458 y(data)g(group)f(number)g (\(=0)h(for)g(non-grouped)e(data\))0 1571 y(grouptype)g(-)j(Grouping)d (table)i(parameter)e(that)i(specifies)e(the)i(columns)f(to)h(be)525 1684 y(created)f(in)h(a)g(grouping)f(table)g(HDU.)h(Allowed)f(values)g (are:)h(GT_ID_ALL_URI,)525 1797 y(GT_ID_REF,)e(GT_ID_POS,)g(GT_ID_ALL,) g(GT_ID_REF_URI,)f(and)j(GT_ID_POS_URI.)0 1910 y(grpname)94 b(-)47 b(value)f(to)i(use)e(for)h(the)g(GRPNAME)f(keyword)g(value.)0 2023 y(hdunum)142 b(-)47 b(sequence)f(number)g(of)h(the)g(HDU)g (\(Primary)e(array)i(=)g(1\))0 2136 y(hduok)190 b(-)47 b(was)g(the)g(HDU)g(verification)d(successful)h(\(=1\))i(or)525 2249 y(not)g(\(=)g(-1\).)94 b(Equals)47 b(zero)f(if)h(the)g(CHECKSUM)f (keyword)g(is)h(not)g(present.)0 2362 y(hdusum)142 b(-)47 b(32)g(bit)g(1's)g(complement)e(checksum)h(for)g(the)h(entire)f(CHDU)0 2475 y(hdutype)94 b(-)47 b(HDU)g(type:)f(IMAGE_HDU)g(\(0\),)g (ASCII_TBL)f(\(1\),)i(BINARY_TBL)e(\(2\),)i(ANY_HDU)f(\(-1\))0 2588 y(header)142 b(-)47 b(returned)f(character)f(string)h(containing)f (all)i(the)g(keyword)f(records)0 2700 y(headstart-)f(starting)h (address)f(\(in)i(bytes\))f(of)i(the)e(CHDU)0 2813 y(heapsize)g(-)h (size)g(of)g(the)g(binary)f(table)g(heap,)h(in)g(bytes)0 2926 y(history)94 b(-)47 b(the)g(HISTORY)f(keyword)g(comment)f(string)h (\(70)h(char)g(max,)g(null-terminated\))0 3039 y(hour)238 b(-)47 b(hour)g(within)f(day)h(\(UTC\))f(\(0)h(-)h(23\))0 3152 y(inc)286 b(-)47 b(sampling)f(interval)f(for)i(pixels)f(in)h(each) g(FITS)g(dimension)0 3265 y(inclist)94 b(-)47 b(array)f(of)i(pointers)d (to)i(matching)f(keyword)g(names)0 3378 y(incolnum)g(-)h(input)f (column)g(number;)g(range)h(=)g(1)h(to)f(TFIELDS)0 3491 y(infile)142 b(-)47 b(the)g(input)f(filename,)g(including)f(path)h(if)i (specified)0 3604 y(infptr)142 b(-)47 b(pointer)f(to)h(a)g('fitsfile')e (structure)h(describing)f(the)i(input)f(FITS)h(file.)0 3717 y(intval)142 b(-)47 b(integer)f(part)g(of)i(the)f(keyword)e(value) 0 3830 y(iomode)142 b(-)47 b(file)g(access)f(mode:)g(either)g(READONLY) g(\(=0\))g(or)i(READWRITE)d(\(=1\))0 3942 y(keyname)94 b(-)47 b(name)g(of)g(a)g(keyword)f(\(8)h(char)g(max,)g (null-terminated\))0 4055 y(keynum)142 b(-)47 b(position)f(of)h (keyword)f(in)h(header)f(\(1st)g(keyword)g(=)i(1\))0 4168 y(keyroot)94 b(-)47 b(root)g(string)f(for)h(the)g(keyword)e(name)i (\(5)g(char)g(max,)f(null-terminated\))0 4281 y(keysexist-)f(number)h (of)h(existing)f(keyword)g(records)f(in)j(the)f(CHU)0 4394 y(keytype)94 b(-)47 b(header)f(record)g(type:)h(-1=delete;)92 b(0=append)46 b(or)h(replace;)907 4507 y(1=append;)e(2=this)h(is)h(the) g(END)g(keyword)0 4620 y(longstr)94 b(-)47 b(arbitrarily)e(long)h (string)g(keyword)g(value)h(\(null-terminated\))0 4733 y(lpixel)142 b(-)47 b(coordinate)e(of)i(the)g(last)g(pixel)f(to)h(be)g (read)g(or)g(written)f(in)h(the)525 4846 y(FITS)g(array.)93 b(The)47 b(array)g(must)f(be)i(of)f(length)f(NAXIS)g(and)h(have)g (values)f(such)525 4959 y(that)h(lpixel[0])e(is)i(in)g(the)g(range)g(1) g(to)g(NAXIS1,)f(lpixel[1])f(is)i(in)h(the)525 5072 y(range)e(1)i(to)f (NAXIS2,)f(etc.)0 5185 y(match)190 b(-)47 b(TRUE)g(\(=1\))f(if)h(the)g (2)h(strings)e(match,)g(else)g(FALSE)h(\(=0\))0 5297 y(maxdim)142 b(-)47 b(maximum)f(number)g(of)h(values)f(to)h(return)0 5410 y(member)142 b(-)47 b(row)g(number)f(of)h(a)h(grouping)d(table)i (member)f(HDU.)0 5523 y(memptr)142 b(-)47 b(pointer)f(to)h(the)g(a)g (FITS)g(file)g(in)g(memory)0 5636 y(mem_realloc)e(-)i(pointer)f(to)h(a) h(function)d(for)i(reallocating)e(more)h(memory)p eop end %%Page: 182 190 TeXDict begin 182 189 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.182) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(182)1822 b Fh(APPENDIX)31 b(B.)61 b(P)-8 b(ARAMETER)30 b(DEFINITIONS)0 555 y Fe(memsize)94 b(-)47 b(size)g(of)g(the)g(memory)f(block)g (allocated)f(for)i(the)g(FITS)g(file)0 668 y(mfptr)190 b(-)47 b(fitsfile*)e(pointer)h(to)h(a)h(grouping)d(table)i(member)f (HDU.)0 781 y(mgopt)190 b(-)47 b(grouping)f(table)g(merge)g(option)g (parameter.)f(Allowed)h(values)g(are:)525 894 y(OPT_MRG_COPY,)e(and)j (OPT_MRG_MOV.)0 1007 y(minute)142 b(-)47 b(minute)f(within)g(hour)h (\(UTC\))f(\(0)h(-)h(59\))0 1120 y(month)190 b(-)47 b(calendar)f(month) g(\(UTC\))g(\(1)h(-)h(12\))0 1233 y(morekeys)e(-)h(space)f(in)i(the)e (header)h(for)f(this)h(many)g(more)f(keywords)0 1346 y(n_good_rows)f(-)i(number)f(of)h(rows)g(evaluating)e(to)i(TRUE)0 1458 y(namelist)f(-)h(string)f(containing)f(a)j(comma)e(or)h(space)f (delimited)g(list)g(of)i(names)0 1571 y(naxes)190 b(-)47 b(size)g(of)g(each)f(dimension)g(in)h(the)g(FITS)f(array)0 1684 y(naxis)190 b(-)47 b(number)f(of)h(dimensions)e(in)i(the)g(FITS)g (array)0 1797 y(naxis1)142 b(-)47 b(length)f(of)h(the)g(X/first)f(axis) h(of)g(the)g(FITS)f(array)0 1910 y(naxis2)142 b(-)47 b(length)f(of)h(the)g(Y/second)f(axis)g(of)i(the)e(FITS)h(array)0 2023 y(naxis3)142 b(-)47 b(length)f(of)h(the)g(Z/third)f(axis)h(of)g (the)g(FITS)f(array)0 2136 y(nbytes)142 b(-)47 b(number)f(of)h(bytes)g (or)g(characters)e(to)i(read)g(or)g(write)0 2249 y(nchars)142 b(-)47 b(number)f(of)h(characters)e(to)i(read)g(or)g(write)0 2362 y(nelements-)e(number)h(of)h(data)g(elements)e(to)j(read)e(or)h (write)0 2475 y(newfptr)94 b(-)47 b(returned)f(pointer)f(to)j(the)e (reopened)g(file)0 2588 y(newveclen-)f(new)i(value)f(for)h(the)g (column)f(vector)g(repeat)g(parameter)0 2700 y(nexc)238 b(-)47 b(number)f(of)h(names)g(in)g(the)g(exclusion)e(list)i(\(may)f(=) i(0\))0 2813 y(nfound)142 b(-)47 b(number)f(of)h(keywords)f(found)g (\(highest)g(keyword)g(number\))0 2926 y(nkeys)190 b(-)47 b(number)f(of)h(keywords)f(in)h(the)g(sequence)0 3039 y(ninc)238 b(-)47 b(number)f(of)h(names)g(in)g(the)g(inclusion)e(list)0 3152 y(nmembers)h(-)h(Number)f(of)h(grouping)f(table)g(members)g (\(NAXIS2)g(value\).)0 3265 y(nmove)190 b(-)47 b(number)f(of)h(HDUs)g (to)g(move)g(\(+)g(or)g(-\),)g(relative)f(to)h(current)f(position)0 3378 y(nocomments)f(-)i(if)h(equal)e(to)h(TRUE,)g(then)f(no)h (commentary)e(keywords)h(will)h(be)g(copied)0 3491 y(noisebits-)e (number)h(of)h(bits)g(to)g(ignore)f(when)h(compressing)e(floating)g (point)h(images)0 3604 y(nrows)190 b(-)47 b(number)f(of)h(rows)g(in)g (the)g(table)0 3717 y(nstart)142 b(-)47 b(first)f(integer)g(value)0 3830 y(nullarray-)f(set)i(to)g(TRUE)g(\(=1\))f(if)i(corresponding)c (data)i(element)g(is)h(undefined)0 3942 y(nulval)142 b(-)47 b(numerical)e(value)i(to)g(represent)e(undefined)g(pixels)0 4055 y(nulstr)142 b(-)47 b(character)e(string)h(used)h(to)g(represent)e (undefined)h(values)g(in)h(ASCII)f(table)0 4168 y(numval)142 b(-)47 b(numerical)e(data)i(value,)f(of)h(the)g(appropriate)e(data)h (type)0 4281 y(offset)142 b(-)47 b(byte)g(offset)f(in)h(the)g(heap)f (or)i(data)e(unit)h(to)g(the)g(first)f(element)g(of)h(the)g(vector)0 4394 y(openfptr)f(-)h(pointer)f(to)h(a)g(currently)f(open)g(FITS)h (file)0 4507 y(overlap)94 b(-)47 b(number)f(of)h(bytes)g(in)g(the)g (binary)f(table)g(heap)h(pointed)f(to)h(by)g(more)g(than)f(1)525 4620 y(descriptor)0 4733 y(outcolnum-)f(output)h(column)g(number;)g (range)g(=)i(1)f(to)g(TFIELDS)f(+)i(1)0 4846 y(outfile)94 b(-)47 b(and)g(optional)e(output)i(filename;)e(the)i(input)f(file)h (will)f(be)i(copied)e(to)h(this)f(prior)525 4959 y(to)h(opening)f(the)h (file)0 5072 y(outfptr)94 b(-)47 b(pointer)f(to)h(a)g('fitsfile')e (structure)h(describing)f(the)i(output)f(FITS)g(file.)0 5185 y(pcount)142 b(-)47 b(value)f(of)i(the)e(PCOUNT)h(keyword)e(=)j (size)e(of)i(binary)e(table)g(heap)0 5297 y(previous)g(-)h(if)g(TRUE,)g (any)f(previous)g(HDUs)h(in)g(the)g(input)f(file)h(will)f(be)i(copied.) 0 5410 y(repeat)142 b(-)47 b(length)f(of)h(column)f(vector)g(\(e.g.)h (12J\);)f(==)h(1)h(for)f(ASCII)f(table)0 5523 y(rmopt)190 b(-)47 b(grouping)f(table)g(remove)g(option)g(parameter.)f(Allowed)h (values)g(are:)525 5636 y(OPT_RM_GPT,)f(OPT_RM_ENTRY,)f(OPT_RM_MBR,)h (and)i(OPT_RM_ALL.)p eop end %%Page: 183 191 TeXDict begin 183 190 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.183) cvn /DEST pdfmark end -8 191 a 3764 299 a Fj(183)0 555 y Fe(rootname)46 b(-)h(root)g(filename,)e(minus)h(any)h(extension)e (or)j(filtering)d(specifications)0 668 y(rot)286 b(-)47 b(celestial)e(coordinate)g(rotation)h(angle)g(\(degrees\))0 781 y(rowlen)142 b(-)47 b(length)f(of)h(a)h(table)e(row,)h(in)g (characters)e(or)i(bytes)0 894 y(rowlist)94 b(-)47 b(sorted)f(list)h (of)g(row)g(numbers)f(to)h(be)g(deleted)f(from)g(the)h(table)0 1007 y(rownum)142 b(-)47 b(number)f(of)h(the)g(row)g(\(first)f(row)h(=) h(1\))0 1120 y(rowrange)e(-)h(list)g(of)g(rows)f(or)i(row)f(ranges:)e ('3,6-8,12,56-80')f(or)j('500-')0 1233 y(row_status)e(-)i(array)g(of)g (True/False)e(results)h(for)h(each)f(row)h(that)g(was)g(evaluated)0 1346 y(scale)190 b(-)47 b(linear)f(scaling)g(factor;)g(true)g(value)h (=)g(\(FITS)g(value\))f(*)h(scale)f(+)i(zero)0 1458 y(second)142 b(-)47 b(second)f(within)g(minute)g(\(0)h(-)h(60.9999999999\))c(\(leap) i(second!\))0 1571 y(section)94 b(-)47 b(section)f(of)h(image)f(to)i (be)f(copied)f(\(e.g.)g(21:80,101:200\))0 1684 y(simple)142 b(-)47 b(TRUE)g(\(=1\))f(if)h(FITS)g(file)g(conforms)e(to)i(the)g (Standard,)f(else)g(FALSE)h(\(=0\))0 1797 y(space)190 b(-)47 b(number)f(of)h(blank)g(spaces)f(to)h(leave)f(between)g(ASCII)g (table)h(columns)0 1910 y(status)142 b(-)47 b(returned)f(error)g (status)g(code)h(\(0)g(=)g(OK\))0 2023 y(sum)286 b(-)47 b(32)g(bit)g(unsigned)f(checksum)f(value)0 2136 y(tbcol)190 b(-)47 b(byte)g(position)e(in)i(row)g(to)g(start)g(of)g(column)f(\(1st) h(col)g(has)g(tbcol)f(=)h(1\))0 2249 y(tdisp)190 b(-)47 b(Fortran)f(style)g(display)g(format)g(for)h(the)g(table)f(column)0 2362 y(tdimstr)94 b(-)47 b(the)g(value)f(of)h(the)g(TDIMn)g(keyword)0 2475 y(templt)142 b(-)47 b(template)f(string)g(used)g(in)h(comparison)e (\(null-terminated\))0 2588 y(tfields)94 b(-)47 b(number)f(of)h(fields) f(\(columns\))g(in)h(the)g(table)0 2700 y(tfopt)190 b(-)47 b(grouping)f(table)g(member)g(transfer)g(option)g(parameter.)f(Allowed) g(values)i(are:)525 2813 y(OPT_MCP_ADD,)d(and)j(OPT_MCP_MOV.)0 2926 y(tform)190 b(-)47 b(format)f(of)h(the)g(column)f (\(null-terminated\);)d(allowed)j(values)g(are:)525 3039 y(ASCII)g(tables:)94 b(Iw,)47 b(Aw,)g(Fww.dd,)f(Eww.dd,)f(or)j(Dww.dd) 525 3152 y(Binary)e(tables:)g(rL,)h(rX,)g(rB,)g(rI,)g(rJ,)f(rA,)h(rAw,) g(rE,)g(rD,)g(rC,)g(rM)525 3265 y(where)f('w'=width)g(of)h(the)g (field,)f('d'=no.)g(of)h(decimals,)e('r'=repeat)g(count.)525 3378 y(Variable)h(length)g(array)g(columns)g(are)h(denoted)f(by)h(a)g ('1P')g(before)f(the)h(data)f(type)525 3491 y(character)f(\(e.g.,)h ('1PJ'\).)94 b(When)47 b(creating)e(a)j(binary)e(table,)g(2)h(addition) f(tform)525 3604 y(data)h(type)f(codes)h(are)g(recognized)e(by)i (CFITSIO:)e('rU')i(and)g('rV')f(for)h(unsigned)525 3717 y(16-bit)f(and)h(unsigned)f(32-bit)g(integer,)f(respectively.)0 3942 y(theap)190 b(-)47 b(zero)g(indexed)e(byte)i(offset)f(of)h (starting)f(address)g(of)h(the)g(heap)525 4055 y(relative)f(to)h(the)g (beginning)e(of)i(the)g(binary)f(table)g(data)0 4168 y(tilesize)g(-)h(array)f(of)i(length)e(NAXIS)g(that)h(specifies)e(the)i (dimensions)e(of)525 4281 y(the)i(image)f(compression)f(tiles)0 4394 y(ttype)190 b(-)47 b(label)f(or)i(name)e(for)h(table)f(column)h (\(null-terminated\))0 4507 y(tunit)190 b(-)47 b(physical)f(unit)g(for) h(table)f(column)h(\(null-terminated\))0 4620 y(typechar)f(-)h (symbolic)f(code)g(of)h(the)g(table)g(column)f(data)g(type)0 4733 y(typecode)g(-)h(data)g(type)f(code)h(of)g(the)g(table)f(column.) 94 b(The)47 b(negative)e(of)525 4846 y(the)i(value)f(indicates)g(a)h (variable)f(length)g(array)g(column.)764 4959 y(Datatype)618 b(typecode)189 b(Mnemonic)764 5072 y(bit,)46 b(X)907 b(1)381 b(TBIT)764 5185 y(byte,)46 b(B)811 b(11)381 b(TBYTE)764 5297 y(logical,)45 b(L)668 b(14)381 b(TLOGICAL)764 5410 y(ASCII)46 b(character,)f(A)286 b(16)381 b(TSTRING)764 5523 y(short)46 b(integer,)g(I)381 b(21)g(TSHORT)764 5636 y(integer,)45 b(J)668 b(41)381 b(TINT32BIT)46 b(\(same)g(as)h (TLONG\))p eop end %%Page: 184 192 TeXDict begin 184 191 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.184) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(184)1822 b Fh(APPENDIX)31 b(B.)61 b(P)-8 b(ARAMETER)30 b(DEFINITIONS)764 555 y Fe(long)46 b(long)h(integer,)e(K)191 b(81)381 b(TLONGLONG)764 668 y(real,)46 b(E)811 b(42)381 b(TFLOAT)764 781 y(double)46 b(precision,)f(D)238 b(82)381 b(TDOUBLE)764 894 y(complex,)45 b(C)668 b(83)381 b(TCOMPLEX)764 1007 y(double)46 b(complex,)f(M)286 b(163)381 b(TDBLCOMPLEX)0 1120 y(unit)238 b(-)47 b(the)g(physical)e (unit)i(string)f(\(e.g.,)g('km/s'\))g(for)h(a)g(keyword)0 1233 y(unused)142 b(-)47 b(number)f(of)h(unused)f(bytes)h(in)g(the)g (binary)f(table)g(heap)0 1346 y(urltype)94 b(-)47 b(the)g(file)g(type)f (of)h(the)g(FITS)g(file)g(\(file://,)e(ftp://,)h(mem://,)f(etc.\))0 1458 y(validheap-)g(returned)h(value)g(=)h(FALSE)g(if)g(any)g(of)g(the) g(variable)e(length)i(array)525 1571 y(address)f(are)h(outside)f(the)g (valid)h(range)f(of)h(addresses)f(in)h(the)g(heap)0 1684 y(value)190 b(-)47 b(the)g(keyword)f(value)g(string)g(\(70)h(char)g (max,)f(null-terminated\))0 1797 y(version)94 b(-)47 b(current)f(version)g(number)g(of)h(the)g(CFITSIO)f(library)0 1910 y(width)190 b(-)47 b(width)f(of)i(the)e(character)g(string)g (field)0 2023 y(xcol)238 b(-)47 b(number)f(of)h(the)g(column)f (containing)f(the)i(X)h(coordinate)d(values)0 2136 y(xinc)238 b(-)47 b(X)g(axis)g(coordinate)e(increment)g(at)j(reference)d(pixel)h (\(deg\))0 2249 y(xpix)238 b(-)47 b(X)g(axis)g(pixel)f(location)0 2362 y(xpos)238 b(-)47 b(X)g(axis)g(celestial)e(coordinate)g(\(usually) h(RA\))h(\(deg\))0 2475 y(xrefpix)94 b(-)47 b(X)g(axis)g(reference)e (pixel)i(array)f(location)0 2588 y(xrefval)94 b(-)47 b(X)g(axis)g(coordinate)e(value)h(at)i(the)f(reference)e(pixel)h (\(deg\))0 2700 y(ycol)238 b(-)47 b(number)f(of)h(the)g(column)f (containing)f(the)i(X)h(coordinate)d(values)0 2813 y(year)238 b(-)47 b(calendar)f(year)g(\(e.g.)h(1999,)f(2000,)g(etc\))0 2926 y(yinc)238 b(-)47 b(Y)g(axis)g(coordinate)e(increment)g(at)j (reference)d(pixel)h(\(deg\))0 3039 y(ypix)238 b(-)47 b(y)g(axis)g(pixel)f(location)0 3152 y(ypos)238 b(-)47 b(y)g(axis)g(celestial)e(coordinate)g(\(usually)h(DEC\))h(\(deg\))0 3265 y(yrefpix)94 b(-)47 b(Y)g(axis)g(reference)e(pixel)i(array)f (location)0 3378 y(yrefval)94 b(-)47 b(Y)g(axis)g(coordinate)e(value)h (at)i(the)f(reference)e(pixel)h(\(deg\))0 3491 y(zero)238 b(-)47 b(scaling)f(offset;)g(true)g(value)h(=)g(\(FITS)f(value\))h(*)g (scale)f(+)i(zero)p eop end %%Page: 185 193 TeXDict begin 185 192 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.185) cvn /DEST pdfmark end -8 191 a 0 464 a SDict begin H.S end 0 464 a 0 464 a SDict begin 13.6 H.A end 0 464 a 0 464 a SDict begin [/View [/XYZ H.V]/Dest (appendix.C) cvn /DEST pdfmark end 0 464 a 761 x Fg(App)5 b(endix)64 b(C)0 1687 y Fm(CFITSIO)76 b(Error)h(Status)h(Co)6 b(des)0 2180 y Fj(The)28 b(follo)m(wing)h(table)g(lists)g(all)g(the)f(error)g (status)g(co)s(des)g(used)f(b)m(y)h(CFITSIO.)f(Programmers)h(are)g (encouraged)0 2293 y(to)37 b(use)e(the)h(sym)m(b)s(olic)h(mnemonics)e (\(de\014ned)g(in)h(the)g(\014le)g(\014tsio.h\))h(rather)e(than)h(the)g (actual)h(in)m(teger)h(status)0 2406 y(v)-5 b(alues)31 b(to)g(impro)m(v)m(e)g(the)g(readabilit)m(y)g(of)g(their)f(co)s(de.)48 2665 y Fe(Symbolic)45 b(Const)190 b(Value)237 b(Meaning)48 2778 y(--------------)187 b(-----)94 b(------------------------)o(----) o(---)o(----)o(----)o(--)1002 2891 y(0)191 b(OK,)47 b(no)g(error)48 3004 y(SAME_FILE)427 b(101)190 b(input)46 b(and)h(output)f(files)h(are) g(the)f(same)48 3117 y(TOO_MANY_FILES)187 b(103)j(tried)46 b(to)h(open)g(too)g(many)g(FITS)f(files)h(at)g(once)48 3230 y(FILE_NOT_OPENED)139 b(104)190 b(could)46 b(not)h(open)g(the)g (named)f(file)48 3343 y(FILE_NOT_CREATED)91 b(105)190 b(could)46 b(not)h(create)f(the)h(named)g(file)48 3456 y(WRITE_ERROR)331 b(106)190 b(error)46 b(writing)g(to)h(FITS)g(file)48 3569 y(END_OF_FILE)331 b(107)190 b(tried)46 b(to)h(move)g(past)g(end)g (of)g(file)48 3681 y(READ_ERROR)379 b(108)190 b(error)46 b(reading)g(from)h(FITS)f(file)48 3794 y(FILE_NOT_CLOSED)139 b(110)190 b(could)46 b(not)h(close)g(the)f(file)48 3907 y(ARRAY_TOO_BIG)235 b(111)190 b(array)46 b(dimensions)f(exceed)h (internal)g(limit)48 4020 y(READONLY_FILE)235 b(112)190 b(Cannot)46 b(write)g(to)i(readonly)d(file)48 4133 y(MEMORY_ALLOCATION) e(113)190 b(Could)46 b(not)h(allocate)f(memory)48 4246 y(BAD_FILEPTR)331 b(114)190 b(invalid)46 b(fitsfile)f(pointer)48 4359 y(NULL_INPUT_PTR)187 b(115)j(NULL)47 b(input)f(pointer)g(to)h (routine)48 4472 y(SEEK_ERROR)379 b(116)190 b(error)46 b(seeking)g(position)g(in)h(file)48 4585 y(BAD_NETTIMEOUT)187 b(117)j(bad)47 b(value)f(for)h(file)g(download)e(timeout)h(setting)48 4811 y(BAD_URL_PREFIX)235 b(121)142 b(invalid)46 b(URL)h(prefix)f(on)h (file)g(name)48 4924 y(TOO_MANY_DRIVERS)139 b(122)j(tried)46 b(to)h(register)f(too)h(many)g(IO)g(drivers)48 5036 y (DRIVER_INIT_FAILED)c(123)142 b(driver)46 b(initialization)e(failed)48 5149 y(NO_MATCHING_DRIVER)f(124)142 b(matching)45 b(driver)i(is)g(not)g (registered)48 5262 y(URL_PARSE_ERROR)187 b(125)142 b(failed)46 b(to)h(parse)g(input)f(file)h(URL)48 5375 y(RANGE_PARSE_ERROR)91 b(126)142 b(parse)46 b(error)h(in)g(range)f(list)48 5601 y(SHARED_BADARG)235 b(151)190 b(bad)47 b(argument)e(in)j(shared)e (memory)g(driver)48 5714 y(SHARED_NULPTR)235 b(152)190 b(null)47 b(pointer)e(passed)h(as)i(an)f(argument)1882 5942 y Fj(185)p eop end %%Page: 186 194 TeXDict begin 186 193 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.186) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(186)1589 b Fh(APPENDIX)31 b(C.)61 b(CFITSIO)29 b(ERR)m(OR)h(ST)-8 b(A)g(TUS)30 b(CODES)48 555 y Fe(SHARED_TABFULL)187 b(153)j(no)47 b(more)g(free)f(shared)g(memory)h(handles)48 668 y(SHARED_NOTINIT)187 b(154)j(shared)46 b(memory)g(driver)g(is)h(not)g(initialized)48 781 y(SHARED_IPCERR)235 b(155)190 b(IPC)47 b(error)f(returned)g(by)h(a) g(system)f(call)48 894 y(SHARED_NOMEM)283 b(156)190 b(no)47 b(memory)f(in)h(shared)f(memory)h(driver)48 1007 y(SHARED_AGAIN)283 b(157)190 b(resource)45 b(deadlock)h(would)g(occur)48 1120 y(SHARED_NOFILE)235 b(158)190 b(attempt)46 b(to)h(open/create)e (lock)h(file)h(failed)48 1233 y(SHARED_NORESIZE)139 b(159)190 b(shared)46 b(memory)g(block)g(cannot)h(be)g(resized)f(at)h(the)g (moment)48 1458 y(HEADER_NOT_EMPTY)91 b(201)190 b(header)46 b(already)g(contains)f(keywords)48 1571 y(KEY_NO_EXIST)283 b(202)190 b(keyword)46 b(not)h(found)f(in)h(header)48 1684 y(KEY_OUT_BOUNDS)187 b(203)j(keyword)46 b(record)g(number)g(is)h (out)g(of)g(bounds)48 1797 y(VALUE_UNDEFINED)139 b(204)190 b(keyword)46 b(value)g(field)g(is)i(blank)48 1910 y(NO_QUOTE)475 b(205)190 b(string)46 b(is)h(missing)f(the)h(closing)f(quote)48 2023 y(BAD_INDEX_KEY)235 b(206)190 b(illegal)46 b(indexed)g(keyword)f (name)i(\(e.g.)f('TFORM1000'\))48 2136 y(BAD_KEYCHAR)331 b(207)190 b(illegal)46 b(character)f(in)i(keyword)f(name)h(or)g(card)48 2249 y(BAD_ORDER)427 b(208)190 b(required)45 b(keywords)h(out)h(of)g (order)48 2362 y(NOT_POS_INT)331 b(209)190 b(keyword)46 b(value)g(is)h(not)g(a)h(positive)d(integer)48 2475 y(NO_END)571 b(210)190 b(couldn't)45 b(find)i(END)g(keyword)48 2588 y(BAD_BITPIX)379 b(211)190 b(illegal)46 b(BITPIX)g(keyword)g(value)48 2700 y(BAD_NAXIS)427 b(212)190 b(illegal)46 b(NAXIS)g(keyword)g(value) 48 2813 y(BAD_NAXES)427 b(213)190 b(illegal)46 b(NAXISn)g(keyword)g (value)48 2926 y(BAD_PCOUNT)379 b(214)190 b(illegal)46 b(PCOUNT)g(keyword)g(value)48 3039 y(BAD_GCOUNT)379 b(215)190 b(illegal)46 b(GCOUNT)g(keyword)g(value)48 3152 y(BAD_TFIELDS)331 b(216)190 b(illegal)46 b(TFIELDS)g(keyword)f(value)48 3265 y(NEG_WIDTH)427 b(217)190 b(negative)45 b(table)i(row)g(size)48 3378 y(NEG_ROWS)475 b(218)190 b(negative)45 b(number)i(of)g(rows)f(in)i (table)48 3491 y(COL_NOT_FOUND)235 b(219)190 b(column)46 b(with)h(this)f(name)h(not)g(found)f(in)h(table)48 3604 y(BAD_SIMPLE)379 b(220)190 b(illegal)46 b(value)g(of)h(SIMPLE)f (keyword)48 3717 y(NO_SIMPLE)427 b(221)190 b(Primary)46 b(array)g(doesn't)g(start)g(with)h(SIMPLE)48 3830 y(NO_BITPIX)427 b(222)190 b(Second)46 b(keyword)g(not)h(BITPIX)48 3942 y(NO_NAXIS)475 b(223)190 b(Third)46 b(keyword)g(not)h(NAXIS)48 4055 y(NO_NAXES)475 b(224)190 b(Couldn't)45 b(find)i(all)g(the)g (NAXISn)f(keywords)48 4168 y(NO_XTENSION)331 b(225)190 b(HDU)47 b(doesn't)f(start)g(with)h(XTENSION)e(keyword)48 4281 y(NOT_ATABLE)379 b(226)190 b(the)47 b(CHDU)f(is)i(not)f(an)g (ASCII)f(table)g(extension)48 4394 y(NOT_BTABLE)379 b(227)190 b(the)47 b(CHDU)f(is)i(not)f(a)g(binary)f(table)g(extension)48 4507 y(NO_PCOUNT)427 b(228)190 b(couldn't)45 b(find)i(PCOUNT)f(keyword) 48 4620 y(NO_GCOUNT)427 b(229)190 b(couldn't)45 b(find)i(GCOUNT)f (keyword)48 4733 y(NO_TFIELDS)379 b(230)190 b(couldn't)45 b(find)i(TFIELDS)f(keyword)48 4846 y(NO_TBCOL)475 b(231)190 b(couldn't)45 b(find)i(TBCOLn)f(keyword)48 4959 y(NO_TFORM)475 b(232)190 b(couldn't)45 b(find)i(TFORMn)f(keyword)48 5072 y(NOT_IMAGE)427 b(233)190 b(the)47 b(CHDU)f(is)i(not)f(an)g(IMAGE) f(extension)48 5185 y(BAD_TBCOL)427 b(234)190 b(TBCOLn)46 b(keyword)g(value)g(<)i(0)f(or)g(>)h(rowlength)48 5297 y(NOT_TABLE)427 b(235)190 b(the)47 b(CHDU)f(is)i(not)f(a)g(table)48 5410 y(COL_TOO_WIDE)283 b(236)190 b(column)46 b(is)h(too)g(wide)g(to)g (fit)g(in)g(table)48 5523 y(COL_NOT_UNIQUE)187 b(237)j(more)47 b(than)f(1)i(column)e(name)g(matches)g(template)48 5636 y(BAD_ROW_WIDTH)235 b(241)190 b(sum)47 b(of)g(column)f(widths)g(not)h (=)h(NAXIS1)p eop end %%Page: 187 195 TeXDict begin 187 194 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.187) cvn /DEST pdfmark end -8 191 a 3764 299 a Fj(187)48 555 y Fe(UNKNOWN_EXT)331 b(251)190 b(unrecognizable)44 b(FITS)i(extension)g(type)48 668 y(UNKNOWN_REC)331 b(252)190 b(unknown)46 b(record;)g(1st)g(keyword)g(not)h(SIMPLE)f(or)h(XTENSION) 48 781 y(END_JUNK)475 b(253)190 b(END)47 b(keyword)f(is)h(not)g(blank) 48 894 y(BAD_HEADER_FILL)139 b(254)190 b(Header)46 b(fill)h(area)f (contains)g(non-blank)f(chars)48 1007 y(BAD_DATA_FILL)235 b(255)190 b(Illegal)46 b(data)g(fill)h(bytes)f(\(not)h(zero)g(or)g (blank\))48 1120 y(BAD_TFORM)427 b(261)190 b(illegal)46 b(TFORM)g(format)g(code)48 1233 y(BAD_TFORM_DTYPE)139 b(262)190 b(unrecognizable)44 b(TFORM)i(data)h(type)f(code)48 1346 y(BAD_TDIM)475 b(263)190 b(illegal)46 b(TDIMn)g(keyword)g(value)48 1458 y(BAD_HEAP_PTR)283 b(264)190 b(invalid)46 b(BINTABLE)f(heap)i (pointer)f(is)h(out)g(of)g(range)48 1684 y(BAD_HDU_NUM)331 b(301)190 b(HDU)47 b(number)f(<)h(1)48 1797 y(BAD_COL_NUM)331 b(302)190 b(column)46 b(number)g(<)i(1)f(or)g(>)h(tfields)48 1910 y(NEG_FILE_POS)283 b(304)190 b(tried)46 b(to)h(move)g(to)g (negative)f(byte)g(location)g(in)h(file)48 2023 y(NEG_BYTES)427 b(306)190 b(tried)46 b(to)h(read)g(or)g(write)g(negative)e(number)h(of) h(bytes)48 2136 y(BAD_ROW_NUM)331 b(307)190 b(illegal)46 b(starting)f(row)i(number)f(in)h(table)48 2249 y(BAD_ELEM_NUM)283 b(308)190 b(illegal)46 b(starting)f(element)h(number)g(in)h(vector)48 2362 y(NOT_ASCII_COL)235 b(309)190 b(this)47 b(is)g(not)g(an)g(ASCII)f (string)g(column)48 2475 y(NOT_LOGICAL_COL)139 b(310)190 b(this)47 b(is)g(not)g(a)g(logical)f(data)h(type)f(column)48 2588 y(BAD_ATABLE_FORMAT)d(311)190 b(ASCII)46 b(table)h(column)f(has)h (wrong)f(format)48 2700 y(BAD_BTABLE_FORMAT)d(312)190 b(Binary)46 b(table)g(column)g(has)h(wrong)g(format)48 2813 y(NO_NULL)523 b(314)190 b(null)47 b(value)f(has)h(not)g(been)f (defined)48 2926 y(NOT_VARI_LEN)283 b(317)190 b(this)47 b(is)g(not)g(a)g(variable)f(length)g(column)48 3039 y(BAD_DIMEN)427 b(320)190 b(illegal)46 b(number)g(of)h(dimensions)e(in)i(array)48 3152 y(BAD_PIX_NUM)331 b(321)190 b(first)46 b(pixel)h(number)f(greater) g(than)g(last)h(pixel)48 3265 y(ZERO_SCALE)379 b(322)190 b(illegal)46 b(BSCALE)g(or)h(TSCALn)f(keyword)g(=)h(0)48 3378 y(NEG_AXIS)475 b(323)190 b(illegal)46 b(axis)g(length)g(<)i(1)48 3604 y(NOT_GROUP_TABLE)330 b(340)142 b(Grouping)46 b(function)f(error) 48 3717 y(HDU_ALREADY_MEMBER)186 b(341)48 3830 y(MEMBER_NOT_FOUND)282 b(342)48 3942 y(GROUP_NOT_FOUND)330 b(343)48 4055 y(BAD_GROUP_ID)474 b(344)48 4168 y(TOO_MANY_HDUS_TRACKED)42 b(345)48 4281 y(HDU_ALREADY_TRACKED)138 b(346)48 4394 y(BAD_OPTION)570 b(347)48 4507 y(IDENTICAL_POINTERS)186 b(348)48 4620 y(BAD_GROUP_ATTACH)282 b(349)48 4733 y(BAD_GROUP_DETACH)g(350)48 4959 y(NGP_NO_MEMORY)426 b(360)238 b(malloc)46 b(failed)48 5072 y(NGP_READ_ERR)474 b(361)238 b(read)46 b(error)h(from)f(file)48 5185 y(NGP_NUL_PTR)522 b(362)238 b(null)46 b(pointer)g(passed)g(as)h (an)g(argument.)1575 5297 y(Passing)f(null)g(pointer)g(as)h(a)h(name)f (of)1575 5410 y(template)f(file)g(raises)g(this)h(error)48 5523 y(NGP_EMPTY_CURLINE)234 b(363)k(line)46 b(read)h(seems)f(to)h(be)h (empty)e(\(used)1575 5636 y(internally\))p eop end %%Page: 188 196 TeXDict begin 188 195 bop 0 0 a SDict begin /product where{pop product(Distiller)search{pop pop pop version(.)search{exch pop exch pop(3011)eq{gsave newpath 0 0 moveto closepath clip/Courier findfont 10 scalefont setfont 72 72 moveto(.)show grestore}if}{pop}ifelse}{pop}ifelse}if end 0 0 a -8 191 a SDict begin H.S end -8 191 a -8 191 a SDict begin H.R end -8 191 a -8 191 a SDict begin [/View [/XYZ H.V]/Dest (page.188) cvn /DEST pdfmark end -8 191 a 0 299 a Fj(188)1589 b Fh(APPENDIX)31 b(C.)61 b(CFITSIO)29 b(ERR)m(OR)h(ST)-8 b(A)g(TUS)30 b(CODES)48 555 y Fe(NGP_UNREAD_QUEUE_FULL)42 b(364)238 b(cannot)46 b(unread)g(more)g(then)h(1)g(line)g(\(or)g (single)1575 668 y(line)g(twice\))48 781 y(NGP_INC_NESTING)330 b(365)238 b(too)46 b(deep)h(include)f(file)h(nesting)e(\(infinite)1575 894 y(loop,)h(template)g(includes)f(itself)i(?\))48 1007 y(NGP_ERR_FOPEN)426 b(366)238 b(fopen\(\))45 b(failed,)h(cannot)g(open) h(template)e(file)48 1120 y(NGP_EOF)714 b(367)238 b(end)46 b(of)i(file)e(encountered)f(and)i(not)g(expected)48 1233 y(NGP_BAD_ARG)522 b(368)238 b(bad)46 b(arguments)g(passed.)g(Usually)f (means)1575 1346 y(internal)h(parser)g(error.)g(Should)g(not)h(happen) 48 1458 y(NGP_TOKEN_NOT_EXPECT)90 b(369)238 b(token)46 b(not)h(expected)e(here)48 1684 y(BAD_I2C)523 b(401)190 b(bad)47 b(int)g(to)g(formatted)e(string)h(conversion)48 1797 y(BAD_F2C)523 b(402)190 b(bad)47 b(float)f(to)h(formatted)f (string)g(conversion)48 1910 y(BAD_INTKEY)379 b(403)190 b(can't)46 b(interpret)g(keyword)f(value)i(as)g(integer)48 2023 y(BAD_LOGICALKEY)187 b(404)j(can't)46 b(interpret)g(keyword)f (value)i(as)g(logical)48 2136 y(BAD_FLOATKEY)283 b(405)190 b(can't)46 b(interpret)g(keyword)f(value)i(as)g(float)48 2249 y(BAD_DOUBLEKEY)235 b(406)190 b(can't)46 b(interpret)g(keyword)f (value)i(as)g(double)48 2362 y(BAD_C2I)523 b(407)190 b(bad)47 b(formatted)e(string)h(to)h(int)g(conversion)48 2475 y(BAD_C2F)523 b(408)190 b(bad)47 b(formatted)e(string)h(to)h (float)g(conversion)48 2588 y(BAD_C2D)523 b(409)190 b(bad)47 b(formatted)e(string)h(to)h(double)f(conversion)48 2700 y(BAD_DATATYPE)283 b(410)190 b(illegal)46 b(datatype)f(code)i(value)48 2813 y(BAD_DECIM)427 b(411)190 b(bad)47 b(number)f(of)h(decimal)f (places)g(specified)48 2926 y(NUM_OVERFLOW)283 b(412)190 b(overflow)45 b(during)i(data)f(type)h(conversion)48 3039 y(DATA_COMPRESSION_ERR)137 b(413)95 b(error)46 b(compressing)f (image)48 3152 y(DATA_DECOMPRESSION_ERR)c(414)95 b(error)46 b(uncompressing)f(image)48 3378 y(BAD_DATE)475 b(420)190 b(error)46 b(in)h(date)g(or)g(time)g(conversion)48 3604 y(PARSE_SYNTAX_ERR)91 b(431)190 b(syntax)46 b(error)g(in)i(parser)e (expression)48 3717 y(PARSE_BAD_TYPE)187 b(432)j(expression)45 b(did)i(not)g(evaluate)e(to)i(desired)f(type)48 3830 y(PARSE_LRG_VECTOR)91 b(433)190 b(vector)46 b(result)g(too)h(large)f (to)i(return)e(in)h(array)48 3942 y(PARSE_NO_OUTPUT)139 b(434)190 b(data)47 b(parser)f(failed)g(not)h(sent)f(an)h(out)g(column) 48 4055 y(PARSE_BAD_COL)235 b(435)190 b(bad)47 b(data)f(encounter)g (while)g(parsing)g(column)48 4168 y(PARSE_BAD_OUTPUT)91 b(436)190 b(Output)46 b(file)h(not)g(of)g(proper)f(type)48 4394 y(ANGLE_TOO_BIG)235 b(501)190 b(celestial)45 b(angle)i(too)f (large)h(for)g(projection)48 4507 y(BAD_WCS_VAL)331 b(502)190 b(bad)47 b(celestial)e(coordinate)g(or)i(pixel)g(value)48 4620 y(WCS_ERROR)427 b(503)190 b(error)46 b(in)h(celestial)f (coordinate)f(calculation)48 4733 y(BAD_WCS_PROJ)283 b(504)190 b(unsupported)45 b(type)h(of)h(celestial)f(projection)48 4846 y(NO_WCS_KEY)379 b(505)190 b(celestial)45 b(coordinate)g(keywords) h(not)h(found)48 4959 y(APPROX_WCS_KEY)187 b(506)j(approximate)45 b(wcs)i(keyword)e(values)h(were)h(returned)p eop end %%Trailer userdict /end-hook known{end-hook}if %%EOF cfitsio-3.47/docs/cfitsio.tex0000644000225700000360000172464613464573431015545 0ustar cagordonlhea\documentclass[11pt]{book} \input{html.sty} \htmladdtonavigation {\begin{rawhtml} FITSIO Home \end{rawhtml}} \oddsidemargin=0.00in \evensidemargin=0.00in \textwidth=6.5in %\topmargin=0.0in \textheight=8.75in \parindent=0cm \parskip=0.2cm \begin{document} \pagenumbering{roman} \begin{titlepage} \normalsize \vspace*{4.0cm} \begin{center} {\Huge \bf CFITSIO User's Reference Guide}\\ \end{center} \medskip \medskip \begin{center} {\LARGE \bf An Interface to FITS Format Files}\\ \end{center} \begin{center} {\LARGE \bf for C Programmers}\\ \end{center} \medskip \medskip \begin{center} {\Large Version 3.4 \\} \end{center} \bigskip \vskip 2.5cm \begin{center} {HEASARC\\ Code 662\\ Goddard Space Flight Center\\ Greenbelt, MD 20771\\ USA} \end{center} \vfill \bigskip \begin{center} {\Large May 2019\\} \end{center} \vfill \end{titlepage} \clearpage \tableofcontents \chapter{Introduction } \pagenumbering{arabic} \section{ A Brief Overview} CFITSIO is a machine-independent library of routines for reading and writing data files in the FITS (Flexible Image Transport System) data format. It can also read IRAF format image files and raw binary data arrays by converting them on the fly into a virtual FITS format file. This library is written in ANSI C and provides a powerful yet simple interface for accessing FITS files which will run on most commonly used computers and workstations. CFITSIO supports all the features described in the official definition of the FITS format and can read and write all the currently defined types of extensions, including ASCII tables (TABLE), Binary tables (BINTABLE) and IMAGE extensions. The CFITSIO routines insulate the programmer from having to deal with the complicated formatting details in the FITS file, however, it is assumed that users have a general knowledge about the structure and usage of FITS files. CFITSIO also contains a set of Fortran callable wrapper routines which allow Fortran programs to call the CFITSIO routines. See the companion ``FITSIO User's Guide'' for the definition of the Fortran subroutine calling sequences. These wrappers replace the older Fortran FITSIO library which is no longer supported. The CFITSIO package was initially developed by the HEASARC (High Energy Astrophysics Science Archive Research Center) at the NASA Goddard Space Flight Center to convert various existing and newly acquired astronomical data sets into FITS format and to further analyze data already in FITS format. New features continue to be added to CFITSIO in large part due to contributions of ideas or actual code from users of the package. The Integral Science Data Center in Switzerland, and the XMM/ESTEC project in The Netherlands made especially significant contributions that resulted in many of the new features that appeared in v2.0 of CFITSIO. \section{Sources of FITS Software and Information} The latest version of the CFITSIO source code, documentation, and example programs are available on the Web or via anonymous ftp from: \begin{verbatim} http://heasarc.gsfc.nasa.gov/fitsio ftp://legacy.gsfc.nasa.gov/software/fitsio/c \end{verbatim} Any questions, bug reports, or suggested enhancements related to the CFITSIO package should be sent to the FTOOLS Help Desk at the HEASARC: \begin{verbatim} http://heasarc.gsfc.nasa.gov/cgi-bin/ftoolshelp \end{verbatim} This User's Guide assumes that readers already have a general understanding of the definition and structure of FITS format files. Further information about FITS formats is available from the FITS Support Office at {\tt http://fits.gsfc.nasa.gov}. In particular, the 'FITS Standard' gives the authoritative definition of the FITS data format. Other documents available at that Web site provide additional historical background and practical advice on using FITS files. The HEASARC also provides a very sophisticated FITS file analysis program called `Fv' which can be used to display and edit the contents of any FITS file as well as construct new FITS files from scratch. Fv is freely available for most Unix platforms, Mac PCs, and Windows PCs. CFITSIO users may also be interested in the FTOOLS package of programs that can be used to manipulate and analyze FITS format files. Fv and FTOOLS are available from their respective Web sites at: \begin{verbatim} http://fv.gsfc.nasa.gov http://heasarc.gsfc.nasa.gov/ftools \end{verbatim} \section{Acknowledgments} The development of the many powerful features in CFITSIO was made possible through collaborations with many people or organizations from around the world. The following in particular have made especially significant contributions: Programmers from the Integral Science Data Center, Switzerland (namely, Jurek Borkowski, Bruce O'Neel, and Don Jennings), designed the concept for the plug-in I/O drivers that was introduced with CFITSIO 2.0. The use of `drivers' greatly simplified the low-level I/O, which in turn made other new features in CFITSIO (e.g., support for compressed FITS files and support for IRAF format image files) much easier to implement. Jurek Borkowski wrote the Shared Memory driver, and Bruce O'Neel wrote the drivers for accessing FITS files over the network using the FTP, HTTP, and ROOT protocols. Also, in 2009, Bruce O'Neel was the key developer of the thread-safe version of CFITSIO. The ISDC also provided the template parsing routines (written by Jurek Borkowski) and the hierarchical grouping routines (written by Don Jennings). The ISDC DAL (Data Access Layer) routines are layered on top of CFITSIO and make extensive use of these features. Giuliano Taffoni and Andrea Barisani, at INAF, University of Trieste, Italy, implemented the I/O driver routines for accessing FITS files on the computational grids using the gridftp protocol. Uwe Lammers (XMM/ESA/ESTEC, The Netherlands) designed the high-performance lexical parsing algorithm that is used to do on-the-fly filtering of FITS tables. This algorithm essentially pre-compiles the user-supplied selection expression into a form that can be rapidly evaluated for each row. Peter Wilson (RSTX, NASA/GSFC) then wrote the parsing routines used by CFITSIO based on Lammers' design, combined with other techniques such as the CFITSIO iterator routine to further enhance the data processing throughput. This effort also benefited from a much earlier lexical parsing routine that was developed by Kent Blackburn (NASA/GSFC). More recently, Craig Markwardt (NASA/GSFC) implemented additional functions (median, average, stddev) and other enhancements to the lexical parser. The CFITSIO iterator function is loosely based on similar ideas developed for the XMM Data Access Layer. Peter Wilson (RSTX, NASA/GSFC) wrote the complete set of Fortran-callable wrappers for all the CFITSIO routines, which in turn rely on the CFORTRAN macro developed by Burkhard Burow. The syntax used by CFITSIO for filtering or binning input FITS files is based on ideas developed for the AXAF Science Center Data Model by Jonathan McDowell, Antonella Fruscione, Aneta Siemiginowska and Bill Joye. See http://heasarc.gsfc.nasa.gov/docs/journal/axaf7.html for further description of the AXAF Data Model. The file decompression code were taken directly from the gzip (GNU zip) program developed by Jean-loup Gailly and others. The new compressed image data format (where the image is tiled and the compressed byte stream from each tile is stored in a binary table) was implemented in collaboration with Richard White (STScI), Perry Greenfield (STScI) and Doug Tody (NOAO). Doug Mink (SAO) provided the routines for converting IRAF format images into FITS format. Martin Reinecke (Max Planck Institute, Garching)) provided the modifications to cfortran.h that are necessary to support 64-bit integer values when calling C routines from fortran programs. The cfortran.h macros were originally developed by Burkhard Burow (CERN). Julian Taylor (ESO, Garching) provided the fast byte-swapping algorithms that use the SSE2 and SSSE3 machine instructions available on x86\_64 CPUs. In addition, many other people have made valuable contributions to the development of CFITSIO. These include (with apologies to others that may have inadvertently been omitted): Steve Allen, Carl Akerlof, Keith Arnaud, Morten Krabbe Barfoed, Kent Blackburn, G Bodammer, Romke Bontekoe, Lucio Chiappetti, Keith Costorf, Robin Corbet, John Davis, Richard Fink, Ning Gan, Emily Greene, Gretchen Green, Joe Harrington, Cheng Ho, Phil Hodge, Jim Ingham, Yoshitaka Ishisaki, Diab Jerius, Mark Levine, Todd Karakaskian, Edward King, Scott Koch, Claire Larkin, Rob Managan, Eric Mandel, Richard Mathar, John Mattox, Carsten Meyer, Emi Miyata, Stefan Mochnacki, Mike Noble, Oliver Oberdorf, Clive Page, Arvind Parmar, Jeff Pedelty, Tim Pearson, Philippe Prugniel, Maren Purves, Scott Randall, Chris Rogers, Arnold Rots, Rob Seaman, Barry Schlesinger, Robin Stebbins, Andrew Szymkowiak, Allyn Tennant, Peter Teuben, James Theiler, Doug Tody, Shiro Ueno, Steve Walton, Archie Warnock, Alan Watson, Dan Whipple, Wim Wimmers, Peter Young, Jianjun Xu, and Nelson Zarate. \section{Legal Stuff} Copyright (Unpublished--all rights reserved under the copyright laws of the United States), U.S. Government as represented by the Administrator of the National Aeronautics and Space Administration. No copyright is claimed in the United States under Title 17, U.S. Code. Permission to freely use, copy, modify, and distribute this software and its documentation without fee is hereby granted, provided that this copyright notice and disclaimer of warranty appears in all copies. DISCLAIMER: THE SOFTWARE IS PROVIDED 'AS IS' WITHOUT ANY WARRANTY OF ANY KIND, EITHER EXPRESSED, IMPLIED, OR STATUTORY, INCLUDING, BUT NOT LIMITED TO, ANY WARRANTY THAT THE SOFTWARE WILL CONFORM TO SPECIFICATIONS, ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND FREEDOM FROM INFRINGEMENT, AND ANY WARRANTY THAT THE DOCUMENTATION WILL CONFORM TO THE SOFTWARE, OR ANY WARRANTY THAT THE SOFTWARE WILL BE ERROR FREE. IN NO EVENT SHALL NASA BE LIABLE FOR ANY DAMAGES, INCLUDING, BUT NOT LIMITED TO, DIRECT, INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES, ARISING OUT OF, RESULTING FROM, OR IN ANY WAY CONNECTED WITH THIS SOFTWARE, WHETHER OR NOT BASED UPON WARRANTY, CONTRACT, TORT , OR OTHERWISE, WHETHER OR NOT INJURY WAS SUSTAINED BY PERSONS OR PROPERTY OR OTHERWISE, AND WHETHER OR NOT LOSS WAS SUSTAINED FROM, OR AROSE OUT OF THE RESULTS OF, OR USE OF, THE SOFTWARE OR SERVICES PROVIDED HEREUNDER." \chapter{ Creating the CFITSIO Library } \section{Building the Library} The CFITSIO code is contained in about 40 C source files (*.c) and header files (*.h). On VAX/VMS systems 2 assembly-code files (vmsieeed.mar and vmsieeer.mar) are also needed. CFITSIO is written in ANCI C and should be compatible with most existing C and C++ compilers. Cray supercomputers are currently not supported. \subsection{Unix Systems} The CFITSIO library is built on Unix systems by typing: \begin{verbatim} > ./configure [--prefix=/target/installation/path] [--enable-reentrant] [--enable-sse2] [--enable-ssse3] > make (or 'make shared') > make install (this step is optional) \end{verbatim} at the operating system prompt. The configure command customizes the Makefile for the particular system, then the `make' command compiles the source files and builds the library. Type `./configure' and not simply `configure' to ensure that the configure script in the current directory is run and not some other system-wide configure script. The optional 'prefix' argument to configure gives the path to the directory where the CFITSIO library and include files should be installed via the later 'make install' command. For example, \begin{verbatim} > ./configure --prefix=/usr1/local \end{verbatim} will cause the 'make install' command to copy the CFITSIO libcfitsio file to /usr1/local/lib and the necessary include files to /usr1/local/include (assuming of course that the process has permission to write to these directories). All the available configure options can be seen by entering the command \begin{verbatim} > ./configure --help \end{verbatim} Some of the more useful options are described below: The --enable-reentrant option will attempt to configure CFITSIO so that it can be used in multi-threaded programs. See the "Using CFITSIO in Multi-threaded Environments" section, below, for more details. The --enable-sse2 and --enable-ssse3 options will cause configure to attempt to build CFITSIO using faster byte-swapping algorithms. See the "Optimizing Programs" chapter of this manual for more information about these options. The --with-gsiftp-flavour and --with-gsiftp options enable support for the Globus Toolkit gsiftp protocal. See the "Extended File Name Syntax" chapter for more information. The --with-bzip2 option enables support for reading FITS files that have been externally compressed by the bzip2 algorithm. This requires that the CFITSIO library, and all applications program that use CFITSIO, to be linked to include the libbz2 library. The 'make shared' option builds a shared or dynamic version of the CFITSIO library. When using the shared library the executable code is not copied into your program at link time and instead the program locates the necessary library code at run time, normally through LD\_LIBRARY\_PATH or some other method. The advantages of using a shared library are: \begin{verbatim} 1. Less disk space if you build more than 1 program 2. Less memory if more than one copy of a program using the shared library is running at the same time since the system is smart enough to share copies of the shared library at run time. 3. Possibly easier maintenance since a new version of the shared library can be installed without relinking all the software that uses it (as long as the subroutine names and calling sequences remain unchanged). 4. No run-time penalty. \end{verbatim} The disadvantages are: \begin{verbatim} 1. More hassle at runtime. You have to either build the programs specially or have LD_LIBRARY_PATH set right. 2. There may be a slight start up penalty, depending on where you are reading the shared library and the program from and if your CPU is either really slow or really heavily loaded. \end{verbatim} On Mac OS X platforms the 'make shared' command works like on other UNIX platforms, but a .dylib file will be created instead of .so. If installed in a nonstandard location, add its location to the DYLD\_LIBRARY\_PATH environment variable so that the library can be found at run time. On HP/UX systems, the environment variable CFLAGS should be set to -Ae before running configure to enable "extended ANSI" features. By default, a set of Fortran-callable wrapper routines are also built and included in the CFITSIO library. If these wrapper routines are not needed (i.e., the CFITSIO library will not be linked to any Fortran applications which call FITSIO subroutines) then they may be omitted from the build by typing 'make all-nofitsio' instead of simply typing 'make'. This will reduce the size of the CFITSIO library slightly. It may not be possible to statically link programs that use CFITSIO on some platforms (namely, on Solaris 2.6) due to the network drivers (which provide FTP and HTTP access to FITS files). It is possible to make both a dynamic and a static version of the CFITSIO library, but network file access will not be possible using the static version. \subsection{VMS} On VAX/VMS and ALPHA/VMS systems the make\_gfloat.com command file may be executed to build the cfitsio.olb object library using the default G-floating point option for double variables. The make\_dfloat.com and make\_ieee.com files may be used instead to build the library with the other floating point options. Note that the getcwd function that is used in the group.c module may require that programs using CFITSIO be linked with the ALPHA\$LIBRARY:VAXCRTL.OLB library. See the example link line in the next section of this document. \subsection{Windows PCs} A precompiled DLL version of CFITSIO (not necessarily the latest version) is available on the CFITSIO web site. The CFITSIO library may also be built from the source code using the CMake build system. See the "README.win" file in the CFITSIO source distribution for more information. \subsection{Macintosh PCs} When building on Mac OS-X, users should follow the Unix instructions, above. See the README.MacOS file for instructions on building a Universal Binary that supports both Intel and PowerPC CPUs. \section{Testing the Library} The CFITSIO library should be tested by building and running the testprog.c program that is included with the release. On Unix systems, type: \begin{verbatim} % make testprog % testprog > testprog.lis % diff testprog.lis testprog.out % cmp testprog.fit testprog.std \end{verbatim} On VMS systems, (assuming cc is the name of the C compiler command), type: \begin{verbatim} $ cc testprog.c $ link testprog, cfitsio/lib, alpha$library:vaxcrtl/lib $ run testprog \end{verbatim} The test program should produce a FITS file called `testprog.fit' that is identical to the `testprog.std' FITS file included with this release. The diagnostic messages (which were piped to the file testprog.lis in the Unix example) should be identical to the listing contained in the file testprog.out. The 'diff' and 'cmp' commands shown above should not report any differences in the files. (There may be some minor format differences, such as the presence or absence of leading zeros, or 3 digit exponents in numbers, which can be ignored). The Fortran wrappers in CFITSIO may be tested with the testf77 program on Unix systems with: \begin{verbatim} % f77 -o testf77 testf77.f -L. -lcfitsio -lnsl -lsocket or % f77 -f -o testf77 testf77.f -L. -lcfitsio (under SUN O/S) or % f77 -o testf77 testf77.f -Wl,-L. -lcfitsio -lm -lnsl -lsocket (HP/UX) % testf77 > testf77.lis % diff testf77.lis testf77.out % cmp testf77.fit testf77.std \end{verbatim} On machines running SUN O/S, Fortran programs must be compiled with the '-f' option to force double precision variables to be aligned on 8-byte boundarys to make the fortran-declared variables compatible with C. A similar compiler option may be required on other platforms. Failing to use this option may cause the program to crash on FITSIO routines that read or write double precision variables. Also note that on some systems, the output listing of the testf77 program may differ slightly from the testf77.std template, if leading zeros are not printed by default before the decimal point when using F format. A few other utility programs are included with CFITSIO; the first four of this programs can be compiled an linked by typing `make program\_name' where `program\_name' is the actual name of the program: \begin{verbatim} speed - measures the maximum throughput (in MB per second) for writing and reading FITS files with CFITSIO. listhead - lists all the header keywords in any FITS file fitscopy - copies any FITS file (especially useful in conjunction with the CFITSIO's extended input filename syntax). cookbook - a sample program that performs common read and write operations on a FITS file. iter_a, iter_b, iter_c - examples of the CFITSIO iterator routine \end{verbatim} \section{Linking Programs with CFITSIO} When linking applications software with the CFITSIO library, several system libraries usually need to be specified on the link command line. On Unix systems, the most reliable way to determine what libraries are required is to type 'make testprog' and see what libraries the configure script has added. The typical libraries that need to be added are -lm (the math library) and -lnsl and -lsocket (needed only for FTP and HTTP file access). These latter 2 libraries are not needed on VMS and Windows platforms, because FTP file access is not currently supported on those platforms. Note that when upgrading to a newer version of CFITSIO it is usually necessary to recompile, as well as relink, the programs that use CFITSIO, because the definitions in fitsio.h often change. \section{Using CFITSIO in Multi-threaded Environments} CFITSIO can be used either with the POSIX pthreads interface or the OpenMP interface for multi-threaded parallel programs. When used in a multi-threaded environment, the CFITSIO library *must* be built using the -D\_REENTRANT compiler directive. This can be done using the following build commands: \begin{verbatim} >./configure --enable-reentrant > make \end{verbatim} A function called fits\_is\_reentrant is available to test whether or not CFITSIO was compiled with the -D\_REENTRANT directive. When this feature is enabled, multiple threads can call any of the CFITSIO routines to simultaneously read or write separate FITS files. Multiple threads can also read data from the same FITS file simultaneously, as long as the file was opened independently by each thread. This relies on the operating system to correctly deal with reading the same file by multiple processes. Different threads should not share the same 'fitsfile' pointer to read an opened FITS file, unless locks are placed around the calls to the CFITSIO reading routines. Different threads should never try to write to the same FITS file. \section{Getting Started with CFITSIO} In order to effectively use the CFITSIO library it is recommended that new users begin by reading the ``CFITSIO Quick Start Guide''. It contains all the basic information needed to write programs that perform most types of operations on FITS files. The set of example FITS utility programs that are available from the CFITSIO web site are also very useful for learning how to use CFITSIO. To learn even more about the capabilities of the CFITSIO library the following steps are recommended: 1. Read the following short `FITS Primer' chapter for an overview of the structure of FITS files. 2. Review the Programming Guidelines in Chapter 4 to become familiar with the conventions used by the CFITSIO interface. 3. Refer to the cookbook.c, listhead.c, and fitscopy.c programs that are included with this release for examples of routines that perform various common FITS file operations. Type 'make program\_name' to compile and link these programs on Unix systems. 4. Write a simple program to read or write a FITS file using the Basic Interface routines described in Chapter 5. 5. Scan through the more specialized routines that are described in the following chapters to become familiar with the functionality that they provide. \section{Example Program} The following listing shows an example of how to use the CFITSIO routines in a C program. Refer to the cookbook.c program that is included with the CFITSIO distribution for other example routines. This program creates a new FITS file, containing a FITS image. An `EXPOSURE' keyword is written to the header, then the image data are written to the FITS file before closing the FITS file. \begin{verbatim} #include "fitsio.h" /* required by every program that uses CFITSIO */ main() { fitsfile *fptr; /* pointer to the FITS file; defined in fitsio.h */ int status, ii, jj; long fpixel = 1, naxis = 2, nelements, exposure; long naxes[2] = { 300, 200 }; /* image is 300 pixels wide by 200 rows */ short array[200][300]; status = 0; /* initialize status before calling fitsio routines */ fits_create_file(&fptr, "testfile.fits", &status); /* create new file */ /* Create the primary array image (16-bit short integer pixels */ fits_create_img(fptr, SHORT_IMG, naxis, naxes, &status); /* Write a keyword; must pass the ADDRESS of the value */ exposure = 1500.; fits_update_key(fptr, TLONG, "EXPOSURE", &exposure, "Total Exposure Time", &status); /* Initialize the values in the image with a linear ramp function */ for (jj = 0; jj < naxes[1]; jj++) for (ii = 0; ii < naxes[0]; ii++) array[jj][ii] = ii + jj; nelements = naxes[0] * naxes[1]; /* number of pixels to write */ /* Write the array of integers to the image */ fits_write_img(fptr, TSHORT, fpixel, nelements, array[0], &status); fits_close_file(fptr, &status); /* close the file */ fits_report_error(stderr, status); /* print out any error messages */ return( status ); } \end{verbatim} \chapter{ A FITS Primer } This section gives a brief overview of the structure of FITS files. Users should refer to the documentation available from the FITS Support OFfice, as described in the introduction, for more detailed information on FITS formats. FITS was first developed in the late 1970's as a standard data interchange format between various astronomical observatories. Since then FITS has become the standard data format supported by most astronomical data analysis software packages. A FITS file consists of one or more Header + Data Units (HDUs), where the first HDU is called the `Primary HDU', or `Primary Array'. The primary array contains an N-dimensional array of pixels, such as a 1-D spectrum, a 2-D image, or a 3-D data cube. Six different primary data types are supported: Unsigned 8-bit bytes, 16-bit, 32-bit, and 64-bit signed integers, and 32 and 64-bit floating point reals. FITS also has a convention for storing 16, 32-bit, and 64-bit unsigned integers (see the later section entitled `Unsigned Integers' for more details). The primary HDU may also consist of only a header with a null array containing no data pixels. Any number of additional HDUs may follow the primary array; these additional HDUs are called FITS `extensions'. There are currently 3 types of extensions defined by the FITS standard: \begin{itemize} \item Image Extension - a N-dimensional array of pixels, like in a primary array \item ASCII Table Extension - rows and columns of data in ASCII character format \item Binary Table Extension - rows and columns of data in binary representation \end{itemize} In each case the HDU consists of an ASCII Header Unit followed by an optional Data Unit. For historical reasons, each Header or Data unit must be an exact multiple of 2880 8-bit bytes long. Any unused space is padded with fill characters (ASCII blanks or zeros). Each Header Unit consists of any number of 80-character keyword records or `card images' which have the general form: \begin{verbatim} KEYNAME = value / comment string NULLKEY = / comment: This keyword has no value \end{verbatim} The keyword names may be up to 8 characters long and can only contain uppercase letters, the digits 0-9, the hyphen, and the underscore character. The keyword name is (usually) followed by an equals sign and a space character (= ) in columns 9 - 10 of the record, followed by the value of the keyword which may be either an integer, a floating point number, a character string (enclosed in single quotes), or a boolean value (the letter T or F). A keyword may also have a null or undefined value if there is no specified value string, as in the second example, above The last keyword in the header is always the `END' keyword which has no value or comment fields. There are many rules governing the exact format of a keyword record (see the FITS Standard) so it is better to rely on standard interface software like CFITSIO to correctly construct or to parse the keyword records rather than try to deal directly with the raw FITS formats. Each Header Unit begins with a series of required keywords which depend on the type of HDU. These required keywords specify the size and format of the following Data Unit. The header may contain other optional keywords to describe other aspects of the data, such as the units or scaling values. Other COMMENT or HISTORY keywords are also frequently added to further document the data file. The optional Data Unit immediately follows the last 2880-byte block in the Header Unit. Some HDUs do not have a Data Unit and only consist of the Header Unit. If there is more than one HDU in the FITS file, then the Header Unit of the next HDU immediately follows the last 2880-byte block of the previous Data Unit (or Header Unit if there is no Data Unit). The main required keywords in FITS primary arrays or image extensions are: \begin{itemize} \item BITPIX -- defines the data type of the array: 8, 16, 32, 64, -32, -64 for unsigned 8--bit byte, 16--bit signed integer, 32--bit signed integer, 32--bit IEEE floating point, and 64--bit IEEE double precision floating point, respectively. \item NAXIS -- the number of dimensions in the array, usually 0, 1, 2, 3, or 4. \item NAXISn -- (n ranges from 1 to NAXIS) defines the size of each dimension. \end{itemize} FITS tables start with the keyword XTENSION = `TABLE' (for ASCII tables) or XTENSION = `BINTABLE' (for binary tables) and have the following main keywords: \begin{itemize} \item TFIELDS -- number of fields or columns in the table \item NAXIS2 -- number of rows in the table \item TTYPEn -- for each column (n ranges from 1 to TFIELDS) gives the name of the column \item TFORMn -- the data type of the column \item TUNITn -- the physical units of the column (optional) \end{itemize} Users should refer to the FITS Support Office at {\tt http://fits.gsfc.nasa.gov} for further information about the FITS format and related software packages. \chapter{ Programming Guidelines } \section{CFITSIO Definitions} Any program that uses the CFITSIO interface must include the fitsio.h header file with the statement \begin{verbatim} #include "fitsio.h" \end{verbatim} This header file contains the prototypes for all the CFITSIO user interface routines as well as the definitions of various constants used in the interface. It also defines a C structure of type `fitsfile' that is used by CFITSIO to store the relevant parameters that define the format of a particular FITS file. Application programs must define a pointer to this structure for each FITS file that is to be opened. This structure is initialized (i.e., memory is allocated for the structure) when the FITS file is first opened or created with the fits\_open\_file or fits\_create\_file routines. This fitsfile pointer is then passed as the first argument to every other CFITSIO routine that operates on the FITS file. Application programs must not directly read or write elements in this fitsfile structure because the definition of the structure may change in future versions of CFITSIO. A number of symbolic constants are also defined in fitsio.h for the convenience of application programmers. Use of these symbolic constants rather than the actual numeric value will help to make the source code more readable and easier for others to understand. \begin{verbatim} String Lengths, for use when allocating character arrays: #define FLEN_FILENAME 1025 /* max length of a filename */ #define FLEN_KEYWORD 72 /* max length of a keyword */ #define FLEN_CARD 81 /* max length of a FITS header card */ #define FLEN_VALUE 71 /* max length of a keyword value string */ #define FLEN_COMMENT 73 /* max length of a keyword comment string */ #define FLEN_ERRMSG 81 /* max length of a CFITSIO error message */ #define FLEN_STATUS 31 /* max length of a CFITSIO status text string */ Note that FLEN_KEYWORD is longer than the nominal 8-character keyword name length because the HIERARCH convention supports longer keyword names. Access modes when opening a FITS file: #define READONLY 0 #define READWRITE 1 BITPIX data type code values for FITS images: #define BYTE_IMG 8 /* 8-bit unsigned integers */ #define SHORT_IMG 16 /* 16-bit signed integers */ #define LONG_IMG 32 /* 32-bit signed integers */ #define LONGLONG_IMG 64 /* 64-bit signed integers */ #define FLOAT_IMG -32 /* 32-bit single precision floating point */ #define DOUBLE_IMG -64 /* 64-bit double precision floating point */ The following 4 data type codes are also supported by CFITSIO: #define SBYTE_IMG 10 /* 8-bit signed integers, equivalent to */ /* BITPIX = 8, BSCALE = 1, BZERO = -128 */ #define USHORT_IMG 20 /* 16-bit unsigned integers, equivalent to */ /* BITPIX = 16, BSCALE = 1, BZERO = 32768 */ #define ULONG_IMG 40 /* 32-bit unsigned integers, equivalent to */ /* BITPIX = 32, BSCALE = 1, BZERO = 2147483648 */ #define ULONGLONG_IMG 80 /* 64-bit unsigned integers, equivalent to */ /* BITPIX = 64, BSCALE = 1, BZERO = 9223372036854775808*/ Codes for the data type of binary table columns and/or for the data type of variables when reading or writing keywords or data: DATATYPE TFORM CODE #define TBIT 1 /* 'X' */ #define TBYTE 11 /* 8-bit unsigned byte, 'B' */ #define TLOGICAL 14 /* logicals (int for keywords */ /* and char for table cols 'L' */ #define TSTRING 16 /* ASCII string, 'A' */ #define TSHORT 21 /* signed short, 'I' */ #define TLONG 41 /* signed long, */ #define TLONGLONG 81 /* 64-bit long signed integer 'K' */ #define TFLOAT 42 /* single precision float, 'E' */ #define TDOUBLE 82 /* double precision float, 'D' */ #define TCOMPLEX 83 /* complex (pair of floats) 'C' */ #define TDBLCOMPLEX 163 /* double complex (2 doubles) 'M' */ The following data type codes are also supported by CFITSIO: #define TINT 31 /* int */ #define TSBYTE 12 /* 8-bit signed byte, 'S' */ #define TUINT 30 /* unsigned int 'V' */ #define TUSHORT 20 /* unsigned short 'U' */ #define TULONG 40 /* unsigned long */ #define TULONGLONG 80 /* unsigned long long 'W' */ The following data type code is only for use with fits\_get\_coltype #define TINT32BIT 41 /* signed 32-bit int, 'J' */ HDU type code values (value returned when moving to new HDU): #define IMAGE_HDU 0 /* Primary Array or IMAGE HDU */ #define ASCII_TBL 1 /* ASCII table HDU */ #define BINARY_TBL 2 /* Binary table HDU */ #define ANY_HDU -1 /* matches any type of HDU */ Column name and string matching case-sensitivity: #define CASESEN 1 /* do case-sensitive string match */ #define CASEINSEN 0 /* do case-insensitive string match */ Logical states (if TRUE and FALSE are not already defined): #define TRUE 1 #define FALSE 0 Values to represent undefined floating point numbers: #define FLOATNULLVALUE -9.11912E-36F #define DOUBLENULLVALUE -9.1191291391491E-36 Image compression algorithm definitions #define RICE_1 11 #define GZIP_1 21 #define GZIP_2 22 #define PLIO_1 31 #define HCOMPRESS_1 41 #define NOCOMPRESS -1 #define NO_DITHER -1 #define SUBTRACTIVE_DITHER_1 1 #define SUBTRACTIVE_DITHER_2 2 \end{verbatim} \section{Current Header Data Unit (CHDU)} The concept of the Current Header and Data Unit, or CHDU, is fundamental to the use of the CFITSIO library. A simple FITS image may only contain a single Header and Data unit (HDU), but in general FITS files can contain multiple Header Data Units (also known as `extensions'), concatenated one after the other in the file. The user can specify which HDU should be initially opened at run time by giving the HDU name or number after the root file name. For example, 'myfile.fits[4]' opens the 5th HDU in the file (note that the numbering starts with 0), and 'myfile.fits[EVENTS] opens the HDU with the name 'EVENTS' (as defined by the EXTNAME or HDUNAME keywords). If no HDU is specified then CFITSIO opens the first HDU (the primary array) by default. The CFITSIO routines which read and write data only operate within the opened HDU, Other CFITSIO routines are provided to move to and open any other existing HDU within the FITS file or to append or insert new HDUs in the FITS file. \section{Function Names and Variable Datatypes} Most of the CFITSIO routines have both a short name as well as a longer descriptive name. The short name is only 5 or 6 characters long and is similar to the subroutine name in the Fortran-77 version of FITSIO. The longer name is more descriptive and it is recommended that it be used instead of the short name to more clearly document the source code. Many of the CFITSIO routines come in families which differ only in the data type of the associated parameter(s). The data type of these routines is indicated by the suffix of the routine name. The short routine names have a 1 or 2 character suffix (e.g., 'j' in 'ffpkyj') while the long routine names have a 4 character or longer suffix as shown in the following table: \begin{verbatim} Long Short Data Names Names Type ----- ----- ---- _bit x bit _byt b unsigned byte _sbyt sb signed byte _sht i short integer _lng j long integer _lnglng jj 8-byte LONGLONG integer (see note below) _usht ui unsigned short integer _ulng uj unsigned long integer _ulnglng ujj unsigned long long integer _uint uk unsigned int integer _int k int integer _flt e real exponential floating point (float) _fixflt f real fixed-decimal format floating point (float) _dbl d double precision real floating-point (double) _fixdbl g double precision fixed-format floating point (double) _cmp c complex reals (pairs of float values) _fixcmp fc complex reals, fixed-format floating point _dblcmp m double precision complex (pairs of double values) _fixdblcmp fm double precision complex, fixed-format floating point _log l logical (int) _str s character string \end{verbatim} The logical data type corresponds to `int' for logical keyword values, and `byte' for logical binary table columns. In other words, the value when writing a logical keyword must be stored in an `int' variable, and must be stored in a `char' array when reading or writing to `L' columns in a binary table. Implicit data type conversion is not supported for logical table columns, but is for keywords, so a logical keyword may be read and cast to any numerical data type; a returned value = 0 indicates false, and any other value = true. The `int' data type may be 2 bytes long on some old PC compilers, but otherwise it is nearly always 4 bytes long. Some 64-bit machines, like the Alpha/OSF, define the `short', `int', and `long' integer data types to be 2, 4, and 8 bytes long, respectively. Because there is no universal C compiler standard for the name of the 8-byte integer datatype, the fitsio.h include file typedef's 'LONGLONG' to be equivalent to an appropriate 8-byte integer data type on each supported platform. For maximum software portability it is recommended that this LONGLONG datatype be used to define 8-byte integer variables rather than using the native data type name on a particular platform. On most 32-bit Unix and Mac OS-X operating systems LONGLONG is equivalent to the intrinsic 'long long' 8-byte integer datatype. On 64-bit systems (which currently includes Alpha OSF/1, 64-bit Sun Solaris, 64-bit SGI MIPS, and 64-bit Itanium and Opteron PC systems), LONGLONG is simply typedef'ed to be equivalent to 'long'. Microsoft Visual C++ Version 6.0 does not define a 'long long' data type, so LONGLONG is typedef'ed to be equivalent to the '\_\_int64' data type on 32-bit windows systems when using Visual C++. A related issue that affects the portability of software is how to print out the value of a 'LONGLONG' variable with printf. Developers may find it convenient to use the following preprocessing statements in their C programs to handle this in a machine-portable manner: \begin{verbatim} #if defined(_MSC_VER) /* Microsoft Visual C++ */ printf("%I64d", longlongvalue); #elif (USE_LL_SUFFIX == 1) printf("%lld", longlongvalue); #else printf("%ld", longlongvalue); #endif \end{verbatim} Similarly, the name of the C utility routine that converts a character string of digits into a 8-byte integer value is platform dependent: \begin{verbatim} #if defined(_MSC_VER) /* Microsoft Visual C++ */ /* VC++ 6.0 does not seem to have an 8-byte conversion routine */ #elif (USE_LL_SUFFIX == 1) longlongvalue = atoll(*string); #else longlongvalue = atol(*string); #endif \end{verbatim} When dealing with the FITS byte data type it is important to remember that the raw values (before any scaling by the BSCALE and BZERO, or TSCALn and TZEROn keyword values) in byte arrays (BITPIX = 8) or byte columns (TFORMn = 'B') are interpreted as unsigned bytes with values ranging from 0 to 255. Some C compilers define a 'char' variable as signed, so it is important to explicitly declare a numeric char variable as 'unsigned char' to avoid any ambiguity One feature of the CFITSIO routines is that they can operate on a `X' (bit) column in a binary table as though it were a `B' (byte) column. For example a `11X' data type column can be interpreted the same as a `2B' column (i.e., 2 unsigned 8-bit bytes). In some instances, it can be more efficient to read and write whole bytes at a time, rather than reading or writing each individual bit. The complex and double precision complex data types are not directly supported in ANSI C so these data types should be interpreted as pairs of float or double values, respectively, where the first value in each pair is the real part, and the second is the imaginary part. \section{Support for Unsigned Integers and Signed Bytes} Although FITS does not directly support unsigned integers as one of its fundamental data types, FITS can still be used to efficiently store unsigned integer data values in images and binary tables. The convention used in FITS files is to store the unsigned integers as signed integers with an associated offset (specified by the BZERO or TZEROn keyword). For example, to store unsigned 16-bit integer values in a FITS image the image would be defined as a signed 16-bit integer (with BITPIX keyword = SHORT\_IMG = 16) with the keywords BSCALE = 1.0 and BZERO = 32768. Thus the unsigned values of 0, 32768, and 65535, for example, are physically stored in the FITS image as -32768, 0, and 32767, respectively; CFITSIO automatically adds the BZERO offset to these values when they are read. Similarly, in the case of unsigned 32-bit integers the BITPIX keyword would be equal to LONG\_IMG = 32 and BZERO would be equal to 2147483648 (i.e. 2 raised to the 31st power). The CFITSIO interface routines will efficiently and transparently apply the appropriate offset in these cases so in general application programs do not need to be concerned with how the unsigned values are actually stored in the FITS file. As a convenience for users, CFITSIO has several predefined constants for the value of BITPIX (USHORT\_IMG, ULONG\_IMG, ULONGLONG\_IMG) and for the TFORMn value in the case of binary tables (`U', `V', and `W') which programmers can use when creating FITS files containing unsigned integer values. The following code fragment illustrates how to write a FITS 1-D primary array of unsigned 16-bit integers: \begin{verbatim} unsigned short uarray[100]; int naxis, status; long naxes[10], group, firstelem, nelements; ... status = 0; naxis = 1; naxes[0] = 100; fits_create_img(fptr, USHORT_IMG, naxis, naxes, &status); firstelem = 1; nelements = 100; fits_write_img(fptr, TUSHORT, firstelem, nelements, uarray, &status); ... \end{verbatim} In the above example, the 2nd parameter in fits\_create\_img tells CFITSIO to write the header keywords appropriate for an array of 16-bit unsigned integers (i.e., BITPIX = 16 and BZERO = 32768). Then the fits\_write\_img routine writes the array of unsigned short integers (uarray) into the primary array of the FITS file. Similarly, a 32-bit unsigned integer image may be created by setting the second parameter in fits\_create\_img equal to `ULONG\_IMG' and by calling the fits\_write\_img routine with the second parameter = TULONG to write the array of unsigned long image pixel values. An analogous set of routines are available for reading or writing unsigned integer values and signed byte values in a FITS binary table extension. When specifying the TFORMn keyword value which defines the format of a column, CFITSIO recognizes 4 additional data type codes besides those already defined in the FITS standard: `U' meaning a 16-bit unsigned integer column, `V' for a 32-bit unsigned integer column, `W' for a 64-bit unsigned integer column, and 'S' for a signed byte column. These non-standard data type codes are not actually written into the FITS file but instead are just used internally within CFITSIO. The following code fragment illustrates how to use these features: \begin{verbatim} unsigned short uarray[100]; unsigned int varray[100]; int colnum, tfields, status; long nrows, firstrow, firstelem, nelements, pcount; char extname[] = "Test_table"; /* extension name */ /* define the name, data type, and physical units for 4 columns */ char *ttype[] = { "Col_1", "Col_2", "Col_3", "Col_4" }; char *tform[] = { "1U", "1V", "1W", "1S"}; /* special CFITSIO codes */ char *tunit[] = { " ", " ", " ", " " }; ... /* write the header keywords */ status = 0; nrows = 1; tfields = 3 pcount = 0; fits_create_tbl(fptr, BINARY_TBL, nrows, tfields, ttype, tform, tunit, extname, &status); /* write the unsigned shorts to the 1st column */ colnum = 1; firstrow = 1; firstelem = 1; nelements = 100; fits_write_col(fptr, TUSHORT, colnum, firstrow, firstelem, nelements, uarray, &status); /* now write the unsigned longs to the 2nd column */ colnum = 2; fits_write_col(fptr, TUINT, colnum, firstrow, firstelem, nelements, varray, &status); ... \end{verbatim} Note that the non-standard TFORM values for the 3 columns, `U', `V', and `W' tell CFITSIO to write the keywords appropriate for unsigned 16-bit, unsigned 32-bit and unsigned 64-bit integers, respectively (i.e., TFORMn = '1I' and TZEROn = 32768 for unsigned 16-bit integers, TFORMn = '1J' and TZEROn = 2147483648 for unsigned 32-bit integers, and TFORMn = '1K' and TZEROn = 9223372036854775808 for unsigned 64-bit integers). The 'S' TFORMn value tells CFITSIO to write the keywords appropriate for a signed 8-bit byte column with TFORMn = '1B' and TZEROn = -128. The calls to fits\_write\_col then write the arrays of unsigned integer values to the columns. \section{Dealing with Character Strings} The character string values in a FITS header or in an ASCII column in a FITS table extension are generally padded out with non-significant space characters (ASCII 32) to fill up the header record or the column width. When reading a FITS string value, the CFITSIO routines will strip off these non-significant trailing spaces and will return a null-terminated string value containing only the significant characters. Leading spaces in a FITS string are considered significant. If the string contains all blanks, then CFITSIO will return a single blank character, i.e, the first blank is considered to be significant, since it distinguishes the string from a null or undefined string, but the remaining trailing spaces are not significant. Similarly, when writing string values to a FITS file the CFITSIO routines expect to get a null-terminated string as input; CFITSIO will pad the string with blanks if necessary when writing it to the FITS file. When calling CFITSIO routines that return a character string it is vital that the size of the char array be large enough to hold the entire string of characters, otherwise CFITSIO will overwrite whatever memory locations follow the char array, possibly causing the program to execute incorrectly. This type of error can be difficult to debug, so programmers should always ensure that the char arrays are allocated enough space to hold the longest possible string, {\bf including} the terminating NULL character. The fitsio.h file contains the following defined constants which programmers are strongly encouraged to use whenever they are allocating space for char arrays: \begin{verbatim} #define FLEN_FILENAME 1025 /* max length of a filename */ #define FLEN_KEYWORD 72 /* max length of a keyword */ #define FLEN_CARD 81 /* length of a FITS header card */ #define FLEN_VALUE 71 /* max length of a keyword value string */ #define FLEN_COMMENT 73 /* max length of a keyword comment string */ #define FLEN_ERRMSG 81 /* max length of a CFITSIO error message */ #define FLEN_STATUS 31 /* max length of a CFITSIO status text string */ \end{verbatim} For example, when declaring a char array to hold the value string of FITS keyword, use the following statement: \begin{verbatim} char value[FLEN_VALUE]; \end{verbatim} Note that FLEN\_KEYWORD is longer than needed for the nominal 8-character keyword name because the HIERARCH convention supports longer keyword names. \section{Implicit Data Type Conversion} The CFITSIO routines that read and write numerical data can perform implicit data type conversion. This means that the data type of the variable or array in the program does not need to be the same as the data type of the value in the FITS file. Data type conversion is supported for numerical and string data types (if the string contains a valid number enclosed in quotes) when reading a FITS header keyword value and for numeric values when reading or writing values in the primary array or a table column. CFITSIO returns status = NUM\_OVERFLOW if the converted data value exceeds the range of the output data type. Implicit data type conversion is not supported within binary tables for string, logical, complex, or double complex data types. In addition, any table column may be read as if it contained string values. In the case of numeric columns the returned string will be formatted using the TDISPn display format if it exists. \section{Data Scaling} When reading numerical data values in the primary array or a table column, the values will be scaled automatically by the BSCALE and BZERO (or TSCALn and TZEROn) header values if they are present in the header. The scaled data that is returned to the reading program will have \begin{verbatim} output value = (FITS value) * BSCALE + BZERO \end{verbatim} (a corresponding formula using TSCALn and TZEROn is used when reading from table columns). In the case of integer output values the floating point scaled value is truncated to an integer (not rounded to the nearest integer). The fits\_set\_bscale and fits\_set\_tscale routines (described in the `Advanced' chapter) may be used to override the scaling parameters defined in the header (e.g., to turn off the scaling so that the program can read the raw unscaled values from the FITS file). When writing numerical data to the primary array or to a table column the data values will generally be automatically inversely scaled by the value of the BSCALE and BZERO (or TSCALn and TZEROn) keyword values if they they exist in the header. These keywords must have been written to the header before any data is written for them to have any immediate effect. One may also use the fits\_set\_bscale and fits\_set\_tscale routines to define or override the scaling keywords in the header (e.g., to turn off the scaling so that the program can write the raw unscaled values into the FITS file). If scaling is performed, the inverse scaled output value that is written into the FITS file will have \begin{verbatim} FITS value = ((input value) - BZERO) / BSCALE \end{verbatim} (a corresponding formula using TSCALn and TZEROn is used when writing to table columns). Rounding to the nearest integer, rather than truncation, is performed when writing integer data types to the FITS file. \section{Support for IEEE Special Values} The ANSI/IEEE-754 floating-point number standard defines certain special values that are used to represent such quantities as Not-a-Number (NaN), denormalized, underflow, overflow, and infinity. (See the Appendix in the FITS standard or the FITS User's Guide for a list of these values). The CFITSIO routines that read floating point data in FITS files recognize these IEEE special values and by default interpret the overflow and infinity values as being equivalent to a NaN, and convert the underflow and denormalized values into zeros. In some cases programmers may want access to the raw IEEE values, without any modification by CFITSIO. This can be done by calling the fits\_read\_img or fits\_read\_col routines while specifying 0.0 as the value of the NULLVAL parameter. This will force CFITSIO to simply pass the IEEE values through to the application program without any modification. This is not fully supported on VAX/VMS machines, however, where there is no easy way to bypass the default interpretation of the IEEE special values. This is also not supported when reading floating-point images that have been compressed with the FITS tiled image compression convention that is discussed in section 5.6; the pixels values in tile compressed images are represented by scaled integers, and a reserved integer value (not a NaN) is used to represent undefined pixels. \section{Error Status Values and the Error Message Stack} Nearly all the CFITSIO routines return an error status value in 2 ways: as the value of the last parameter in the function call, and as the returned value of the function itself. This provides some flexibility in the way programmers can test if an error occurred, as illustrated in the following 2 code fragments: \begin{verbatim} if ( fits_write_record(fptr, card, &status) ) printf(" Error occurred while writing keyword."); or, fits_write_record(fptr, card, &status); if ( status ) printf(" Error occurred while writing keyword."); \end{verbatim} A listing of all the CFITSIO status code values is given at the end of this document. Programmers are encouraged to use the symbolic mnemonics (defined in fitsio.h) rather than the actual integer status values to improve the readability of their code. The CFITSIO library uses an `inherited status' convention for the status parameter which means that if a routine is called with a positive input value of the status parameter as input, then the routine will exit immediately without changing the value of the status parameter. Thus, if one passes the status value returned from each CFITSIO routine as input to the next CFITSIO routine, then whenever an error is detected all further CFITSIO processing will cease. This convention can simplify the error checking in application programs because it is not necessary to check the value of the status parameter after every single CFITSIO routine call. If a program contains a sequence of several CFITSIO calls, one can just check the status value after the last call. Since the returned status values are generally distinctive, it should be possible to determine which routine originally returned the error status. CFITSIO also maintains an internal stack of error messages (80-character maximum length) which in many cases provide a more detailed explanation of the cause of the error than is provided by the error status number alone. It is recommended that the error message stack be printed out whenever a program detects a CFITSIO error. The function fits\_report\_error will print out the entire error message stack, or alternatively one may call fits\_read\_errmsg to get the error messages one at a time. \section{Variable-Length Arrays in Binary Tables} CFITSIO provides easy-to-use support for reading and writing data in variable length fields of a binary table. The variable length columns have TFORMn keyword values of the form `1Pt(len)' or `1Qt(len)' where `t' is the data type code (e.g., I, J, E, D, etc.) and `len' is an integer specifying the maximum length of the vector in the table. The 'P' type variable length columns use 32-bit array length and byte offset values, whereas the 'Q' type columns use 64-bit values, which may be required when dealing with large arrays. CFITSIO supports a local convention that interprets the 'P' type descriptors as unsigned 32-bit integers, which provides a factor of 2 greater range for the array length or heap address than is possible with 32-bit 'signed' integers. Note, however, that other software packages may not support this convention, and may be unable to read thees extended range variable length records. If the value of `len' is not specified when the table is created (e.g., if the TFORM keyword value is simply specified as '1PE' instead of '1PE(400) ), then CFITSIO will automatically scan the table when it is closed to determine the maximum length of the vector and will append this value to the TFORMn value. The same routines that read and write data in an ordinary fixed length binary table extension are also used for variable length fields, however, the routine parameters take on a slightly different interpretation as described below. All the data in a variable length field is written into an area called the `heap' which follows the main fixed-length FITS binary table. The size of the heap, in bytes, is specified by the PCOUNT keyword in the FITS header. When creating a new binary table, the initial value of PCOUNT should usually be set to zero. CFITSIO will recompute the size of the heap as the data is written and will automatically update the PCOUNT keyword value when the table is closed. When writing variable length data to a table, CFITSIO will automatically extend the size of the heap area if necessary, so that any following HDUs do not get overwritten. By default the heap data area starts immediately after the last row of the fixed-length table. This default starting location may be overridden by the THEAP keyword, but this is not recommended. If additional rows of data are added to the table, CFITSIO will automatically shift the the heap down to make room for the new rows, but it is obviously be more efficient to initially create the table with the necessary number of blank rows, so that the heap does not needed to be constantly moved. When writing row of data to a variable length field the entire array of values for a given row of the table must be written with a single call to fits\_write\_col. The total length of the array is given by nelements + firstelem - 1. Additional elements cannot be appended to an existing vector at a later time since any attempt to do so will simply overwrite all the previously written data and the new data will be written to a new area of the heap. The fits\_compress\_heap routine is provided to compress the heap and recover any unused space. To avoid having to deal with this issue, it is recommended that rows in a variable length field should only be written once. An exception to this general rule occurs when setting elements of an array as undefined. It is allowed to first write a dummy value into the array with fits\_write\_col, and then call fits\_write\_col\_nul to flag the desired elements as undefined. Note that the rows of a table, whether fixed or variable length, do not have to be written consecutively and may be written in any order. When writing to a variable length ASCII character field (e.g., TFORM = '1PA') only a single character string can be written. The `firstelem' and `nelements' parameter values in the fits\_write\_col routine are ignored and the number of characters to write is simply determined by the length of the input null-terminated character string. The fits\_write\_descript routine is useful in situations where multiple rows of a variable length column have the identical array of values. One can simply write the array once for the first row, and then use fits\_write\_descript to write the same descriptor values into the other rows; all the rows will then point to the same storage location thus saving disk space. When reading from a variable length array field one can only read as many elements as actually exist in that row of the table; reading does not automatically continue with the next row of the table as occurs when reading an ordinary fixed length table field. Attempts to read more than this will cause an error status to be returned. One can determine the number of elements in each row of a variable column with the fits\_read\_descript routine. \section{Multiple Access to the Same FITS File} CFITSIO supports simultaneous read and write access to different HDUs in the same FITS file in some circumstances, as described below: \begin{itemize} \item Multi-threaded programs When CFITSIO is compiled with the -D\_REENTRANT directive (as can be tested with the fits\_is\_reentrant function) different threads can call any of the CFITSIO routines to simultaneously read or write separate FITS files. Multiple threads can also read data from the same FITS file simultaneously, as long as the file was opened independently by each thread. This relies on the operating system to correctly deal with reading the same file by multiple processes. Different threads should not share the same 'fitsfile' pointer to read an opened FITS file, unless locks are placed around the calls to the CFITSIO reading routines. Different threads should never try to write to the same FITS file. \item Multiple read access to the same FITS file within a single program/thread A single process may open the same FITS file with READONLY access multiple times, and thus create multiple 'fitsfile*' pointers to that same file within CFITSIO. This relies on the operating system's ability to open a single file multiple times and correctly manage the subsequent read requests directed to the different C 'file*' pointers, which actually all point to the same file. CFITSIO simply executes the read requests to the differnet 'fitsfile*' pointers the same as if they were physically different files. \item Multiple write access to the same FITS file within a single program/thread CFITSIO supports opening the same FITS file multiple times with WRITE access, but it only physically opens the file (at the operating system level) once, on the first call to fits\_open\_file. If fits\_open\_file is subsequently called to open the same file again, CFITSIO will recognize that the file is already open, and will return a new 'fitsfile*' pointer that logically points to the first 'fitsfile*' pointer, without actually opening the file a second time. The application program can then treat the 2 'fitsfile*' pointers as if they point to different files, and can seemingly move to and write data to 2 different HDUs within the same file. However, each time the application program switches which 'fitsfile*' pointer it is writing to, CFITSIO will flush any internal buffers that contain data written to the first 'fitsfile*' pointer, then move to the HDU that the other 'fitsfile*' pointer is writing to. Obviously, this may add a significant amount of computational overhead if the application program uses this feature to frequently switch back and forth between writing to 2 (or more) HDUs in the same file, so this capability should be used judiciously. Note that CFITSIO will not allow a FITS file to be opened a second time with READWRITE access if it was opened previously with READONLY access. \end{itemize} \section{When the Final Size of the FITS HDU is Unknown} It is not required to know the total size of a FITS data array or table before beginning to write the data to the FITS file. In the case of the primary array or an image extension, one should initially create the array with the size of the highest dimension (largest NAXISn keyword) set to a dummy value, such as 1. Then after all the data have been written and the true dimensions are known, then the NAXISn value should be updated using the fits\_update\_key routine before moving to another extension or closing the FITS file. When writing to FITS tables, CFITSIO automatically keeps track of the highest row number that is written to, and will increase the size of the table if necessary. CFITSIO will also automatically insert space in the FITS file if necessary, to ensure that the data 'heap', if it exists, and/or any additional HDUs that follow the table do not get overwritten as new rows are written to the table. As a general rule it is best to specify the initial number of rows = 0 when the table is created, then let CFITSIO keep track of the number of rows that are actually written. The application program should not manually update the number of rows in the table (as given by the NAXIS2 keyword) since CFITSIO does this automatically. If a table is initially created with more than zero rows, then this will usually be considered as the minimum size of the table, even if fewer rows are actually written to the table. Thus, if a table is initially created with NAXIS2 = 20, and CFITSIO only writes 10 rows of data before closing the table, then NAXIS2 will remain equal to 20. If however, 30 rows of data are written to this table, then NAXIS2 will be increased from 20 to 30. The one exception to this automatic updating of the NAXIS2 keyword is if the application program directly modifies the value of NAXIS2 (up or down) itself just before closing the table. In this case, CFITSIO does not update NAXIS2 again, since it assumes that the application program must have had a good reason for changing the value directly. This is not recommended, however, and is only provided for backward compatibility with software that initially creates a table with a large number of rows, than decreases the NAXIS2 value to the actual smaller value just before closing the table. \section{CFITSIO Size Limitations} CFITSIO places very few restrictions on the size of FITS files that it reads or writes. There are a few limits, however, that may affect some extreme cases: 1. The maximum number of FITS files that may be simultaneously opened by CFITSIO is set by NMAXFILES, as defined in fitsio2.h. The current default value is 1000, but this may be increased if necessary. Note that CFITSIO allocates NIOBUF * 2880 bytes of I/O buffer space for each file that is opened. The default value of NIOBUF is 40 (defined in fitsio.h), so this amounts to more than 115K of memory for each opened file (or 115 MB for 1000 opened files). Note that the underlying operating system, may have a lower limit on the number of files that can be opened simultaneously. 2. It used to be common for computer systems to only support disk files up to 2**31 bytes = 2.1 GB in size, but most systems now support larger files. CFITSIO can optionally read and write these so-called 'large files' that are greater than 2.1 GB on platforms where they are supported, but this usually requires that special compiler option flags be specified to turn on this option. On linux and solaris systems the compiler flags are '-D\_LARGEFILE\_SOURCE' and `-D\_FILE\_OFFSET\_BITS=64'. These flags may also work on other platforms but this has not been tested. Starting with version 3.0 of CFITSIO, the default Makefile that is distributed with CFITSIO will include these 2 compiler flags when building on Solaris and Linux PC systems. Users on other platforms will need to add these compiler flags manually if they want to support large files. In most cases it appears that it is not necessary to include these compiler flags when compiling application code that call the CFITSIO library routines. When CFITSIO is built with large file support (e.g., on Solaris and Linux PC system by default) then it can read and write FITS data files on disk that have any of these conditions: \begin{itemize} \item FITS files larger than 2.1 GB in size \item FITS images containing greater than 2.1 G pixels \item FITS images that have one dimension with more than 2.1 G pixels (as given by one of the NAXISn keyword) \item FITS tables containing more than 2.1E09 rows (given by the NAXIS2 keyword), or with rows that are more than 2.1 GB wide (given by the NAXIS1 keyword) \item FITS binary tables with a variable-length array heap that is larger than 2.1 GB (given by the PCOUNT keyword) \end{itemize} The current maximum FITS file size supported by CFITSIO is about 6 terabytes (containing 2**31 FITS blocks, each 2880 bytes in size). Currently, support for large files in CFITSIO has been tested on the Linux, Solaris, and IBM AIX operating systems. Note that when writing application programs that are intended to support large files it is important to use 64-bit integer variables to store quantities such as the dimensions of images, or the number of rows in a table. These programs must also call the special versions of some of the CFITSIO routines that have been adapted to support 64-bit integers. The names of these routines end in 'll' ('el' 'el') to distinguish them from the 32-bit integer version (e.g., fits\_get\_num\_rowsll). \chapter{Basic CFITSIO Interface Routines } This chapter describes the basic routines in the CFITSIO user interface that provide all the functions normally needed to read and write most FITS files. It is recommended that these routines be used for most applications and that the more advanced routines described in the next chapter only be used in special circumstances when necessary. The following conventions are used in this chapter in the description of each function: 1. Most functions have 2 names: a long descriptive name and a short concise name. Both names are listed on the first line of the following descriptions, separated by a slash (/) character. Programmers may use either name in their programs but the long names are recommended to help document the code and make it easier to read. 2. A right arrow symbol ($>$) is used in the function descriptions to separate the input parameters from the output parameters in the definition of each routine. This symbol is not actually part of the C calling sequence. 3. The function parameters are defined in more detail in the alphabetical listing in Appendix B. 4. The first argument in almost all the functions is a pointer to a structure of type `fitsfile'. Memory for this structure is allocated by CFITSIO when the FITS file is first opened or created and is freed when the FITS file is closed. 5. The last argument in almost all the functions is the error status parameter. It must be equal to 0 on input, otherwise the function will immediately exit without doing anything. A non-zero output value indicates that an error occurred in the function. In most cases the status value is also returned as the value of the function itself. \section{CFITSIO Error Status Routines} \begin{description} \item[1 ] Return a descriptive text string (30 char max.) corresponding to a CFITSIO error status code.\label{ffgerr} \end{description} \begin{verbatim} void fits_get_errstatus / ffgerr (int status, > char *err_text) \end{verbatim} \begin{description} \item[2 ] Return the top (oldest) 80-character error message from the internal CFITSIO stack of error messages and shift any remaining messages on the stack up one level. Call this routine repeatedly to get each message in sequence. The function returns a value = 0 and a null error message when the error stack is empty. \label{ffgmsg} \end{description} \begin{verbatim} int fits_read_errmsg / ffgmsg (char *err_msg) \end{verbatim} \begin{description} \item[3 ] Print out the error message corresponding to the input status value and all the error messages on the CFITSIO stack to the specified file stream (normally to stdout or stderr). If the input status value = 0 then this routine does nothing. \label{ffrprt} \end{description} \begin{verbatim} void fits_report_error / ffrprt (FILE *stream, status) \end{verbatim} \begin{description} \item[4 ]The fits\_write\_errmark routine puts an invisible marker on the CFITSIO error stack. The fits\_clear\_errmark routine can then be used to delete any more recent error messages on the stack, back to the position of the marker. This preserves any older error messages on the stack. The fits\_clear\_errmsg routine simply clears all the messages (and marks) from the stack. These routines are called without any arguments. \label{ffpmrk} \label{ffcmsg} \end{description} \begin{verbatim} void fits_write_errmark / ffpmrk (void) void fits_clear_errmark / ffcmrk (void) void fits_clear_errmsg / ffcmsg (void) \end{verbatim} \section{FITS File Access Routines} \begin{description} \item[1 ] Open an existing data file. \label{ffopen} \begin{verbatim} int fits_open_file / ffopen (fitsfile **fptr, char *filename, int iomode, > int *status) int fits_open_diskfile / ffdkopen (fitsfile **fptr, char *filename, int iomode, > int *status) int fits_open_data / ffdopn (fitsfile **fptr, char *filename, int iomode, > int *status) int fits_open_table / fftopn (fitsfile **fptr, char *filename, int iomode, > int *status) int fits_open_image / ffiopn (fitsfile **fptr, char *filename, int iomode, > int *status) int fits_open_extlist / ffeopn (fitsfile **fptr, char *filename, int iomode, char *extlist, > int *hdutype, int *status) \end{verbatim} The iomode parameter determines the read/write access allowed in the file and can have values of READONLY (0) or READWRITE (1). The filename parameter gives the name of the file to be opened, followed by an optional argument giving the name or index number of the extension within the FITS file that should be moved to and opened (e.g., \verb-myfile.fits+3- or \verb-myfile.fits[3]- moves to the 3rd extension within the file, and \verb-myfile.fits[events]- moves to the extension with the keyword EXTNAME = 'EVENTS'). The fits\_open\_diskfile routine is similar to the fits\_open\_file routine except that it does not support the extended filename syntax in the input file name. This routine simply tries to open the specified input file on magnetic disk. This routine is mainly for use in cases where the filename (or directory path) contains square or curly bracket characters that would confuse the extended filename parser. The fits\_open\_data routine is similar to the fits\_open\_file routine except that it will move to the first HDU containing significant data, if a HDU name or number to open was not explicitly specified as part of the filename. In this case, it will look for the first IMAGE HDU with NAXIS greater than 0, or the first table that does not contain the strings `GTI' (Good Time Interval extension) or `OBSTABLE' in the EXTNAME keyword value. The fits\_open\_table and fits\_open\_image routines are similar to fits\_open\_data except they will move to the first significant table HDU or image HDU in the file, respectively, if a HDU name or number is not specified as part of the filename. The fits\_open\_extname routine opens the file and attempts to move to a 'useful' HDU. If after opening the file CFITSIO is pointing to null primary array, then CFITSIO will attempt to move to the first extension that has an EXTNAME or HDUNAME keyword value that matches one of the names in the input extlist space-delimited list of names. If that fails, then CFITSIO simply moves to the 2nd HDU in the file. IRAF images (.imh format files) and raw binary data arrays may also be opened with READONLY access. CFITSIO will automatically test if the input file is an IRAF image, and if, so will convert it on the fly into a virtual FITS image before it is opened by the application program. If the input file is a raw binary data array of numbers, then the data type and dimensions of the array must be specified in square brackets following the name of the file (e.g. 'rawfile.dat[i512,512]' opens a 512 x 512 short integer image). See the `Extended File Name Syntax' chapter for more details on how to specify the raw file name. The raw file is converted on the fly into a virtual FITS image in memory that is then opened by the application program with READONLY access. Programs can read the input file from the 'stdin' file stream if a dash character ('-') is given as the filename. Files can also be opened over the network using FTP or HTTP protocols by supplying the appropriate URL as the filename. The HTTPS and FTPS protocols are also supported if the CFITSIO build includes the libcurl library. (If the CFITSIO 'configure' script finds a usable libcurl library on your system, it will automatically be included in the build.) The input file can be modified in various ways to create a virtual file (usually stored in memory) that is then opened by the application program by supplying a filtering or binning specifier in square brackets following the filename. Some of the more common filtering methods are illustrated in the following paragraphs, but users should refer to the 'Extended File Name Syntax' chapter for a complete description of the full file filtering syntax. When opening an image, a rectangular subset of the physical image may be opened by listing the first and last pixel in each dimension (and optional pixel skipping factor): \begin{verbatim} myimage.fits[101:200,301:400] \end{verbatim} will create and open a 100x100 pixel virtual image of that section of the physical image, and \verb+myimage.fits[*,-*]+ opens a virtual image that is the same size as the physical image but has been flipped in the vertical direction. When opening a table, the filtering syntax can be used to add or delete columns or keywords in the virtual table: \verb-myfile.fits[events][col !time; PI = PHA*1.2]- opens a virtual table in which the TIME column has been deleted and a new PI column has been added with a value 1.2 times that of the PHA column. Similarly, one can filter a table to keep only those rows that satisfy a selection criterion: \verb-myfile.fits[events][pha > 50]- creates and opens a virtual table containing only those rows with a PHA value greater than 50. A large number of boolean and mathematical operators can be used in the selection expression. One can also filter table rows using 'Good Time Interval' extensions, and spatial region filters as in \verb-myfile.fits[events][gtifilter()]- and \verb-myfile.fits[events][regfilter( "stars.rng")]-. Finally, table columns may be binned or histogrammed to generate a virtual image. For example, \verb-myfile.fits[events][bin (X,Y)=4]- will result in a 2-dimensional image calculated by binning the X and Y columns in the event table with a bin size of 4 in each dimension. The TLMINn and TLMAXn keywords will be used by default to determine the range of the image. A single program can open the same FITS file more than once and then treat the resulting fitsfile pointers as though they were completely independent FITS files. Using this facility, a program can open a FITS file twice, move to 2 different extensions within the file, and then read and write data in those extensions in any order. \end{description} \begin{description} \item[2 ] Create and open a new empty output FITS file. \label{ffinit} \begin{verbatim} int fits_create_file / ffinit (fitsfile **fptr, char *filename, > int *status) int fits_create_diskfile / ffdkinit (fitsfile **fptr, char *filename, > int *status) \end{verbatim} An error will be returned if the specified file already exists, unless the filename is prefixed with an exclamation point (!). In that case CFITSIO will overwrite (delete) any existing file with the same name. Note that the exclamation point is a special UNIX character so if it is used on the command line it must be preceded by a backslash to force the UNIX shell to accept the character as part of the filename. The output file will be written to the 'stdout' file stream if a dash character ('-') or the string 'stdout' is given as the filename. Similarly, '-.gz' or 'stdout.gz' will cause the file to be gzip compressed before it is written out to the stdout stream. Optionally, the name of a template file that is used to define the structure of the new file may be specified in parentheses following the output file name. The template file may be another FITS file, in which case the new file, at the time it is opened, will be an exact copy of the template file except that the data structures (images and tables) will be filled with zeros. Alternatively, the template file may be an ASCII format text file containing directives that define the keywords to be created in each HDU of the file. See the 'Extended File Name Syntax' section for a complete description of the template file syntax. The fits\_create\_diskfile routine is similar to the fits\_create\_file routine except that it does not support the extended filename syntax in the input file name. This routine simply tries to create the specified file on magnetic disk. This routine is mainly for use in cases where the filename (or directory path) contains square or curly bracket characters that would confuse the extended filename parser. \end{description} \begin{description} \item[3 ] Close a previously opened FITS file. The first routine simply closes the file, whereas the second one also DELETES the file, which can be useful in cases where a FITS file has been partially created, but then an error occurs which prevents it from being completed. Note that these routines behave differently than most other CFITSIO routines if the input value of the `status' parameter is not zero: Instead of simply returning to the calling program without doing anything, these routines effectively ignore the input status value and still attempt to close or delete the file. \label{ffclos} \label{ffdelt} \end{description} \begin{verbatim} int fits_close_file / ffclos (fitsfile *fptr, > int *status) int fits_delete_file / ffdelt (fitsfile *fptr, > int *status) \end{verbatim} \begin{description} \item[4 ]Return the name, I/O mode (READONLY or READWRITE), and/or the file type (e.g. 'file://', 'ftp://') of the opened FITS file. \label{ffflnm} \label{ffflmd} \label{ffurlt} \end{description} \begin{verbatim} int fits_file_name / ffflnm (fitsfile *fptr, > char *filename, int *status) int fits_file_mode / ffflmd (fitsfile *fptr, > int *iomode, int *status) int fits_url_type / ffurlt (fitsfile *fptr, > char *urltype, int *status) \end{verbatim} \section{HDU Access Routines} The following functions perform operations on Header-Data Units (HDUs) as a whole. \begin{description} \item[1 ] Move to a different HDU in the file. The first routine moves to a specified absolute HDU number (starting with 1 for the primary array) in the FITS file, and the second routine moves a relative number HDUs forward or backward from the current HDU. A null pointer may be given for the hdutype parameter if it's value is not needed. The third routine moves to the (first) HDU which has the specified extension type and EXTNAME and EXTVER keyword values (or HDUNAME and HDUVER keywords). The hdutype parameter may have a value of IMAGE\_HDU, ASCII\_TBL, BINARY\_TBL, or ANY\_HDU where ANY\_HDU means that only the extname and extver values will be used to locate the correct extension. If the input value of extver is 0 then the EXTVER keyword is ignored and the first HDU with a matching EXTNAME (or HDUNAME) keyword will be found. If no matching HDU is found in the file then the current HDU will remain unchanged and a status = BAD\_HDU\_NUM will be returned. \label{ffmahd} \label{ffmrhd} \label{ffmnhd} \end{description} \begin{verbatim} int fits_movabs_hdu / ffmahd (fitsfile *fptr, int hdunum, > int *hdutype, int *status) int fits_movrel_hdu / ffmrhd (fitsfile *fptr, int nmove, > int *hdutype, int *status) int fits_movnam_hdu / ffmnhd (fitsfile *fptr, int hdutype, char *extname, int extver, > int *status) \end{verbatim} \begin{description} \item[2 ] Return the total number of HDUs in the FITS file. This returns the number of completely defined HDUs in the file. If a new HDU has just been added to the FITS file, then that last HDU will only be counted if it has been closed, or if data has been written to the HDU. The current HDU remains unchanged by this routine. \label{ffthdu} \end{description} \begin{verbatim} int fits_get_num_hdus / ffthdu (fitsfile *fptr, > int *hdunum, int *status) \end{verbatim} \begin{description} \item[3 ] Return the number of the current HDU (CHDU) in the FITS file (where the primary array = 1). This function returns the HDU number rather than a status value. \label{ffghdn} \end{description} \begin{verbatim} int fits_get_hdu_num / ffghdn (fitsfile *fptr, > int *hdunum) \end{verbatim} \begin{description} \item[4 ] Return the type of the current HDU in the FITS file. The possible values for hdutype are: IMAGE\_HDU, ASCII\_TBL, or BINARY\_TBL. \label{ffghdt} \end{description} \begin{verbatim} int fits_get_hdu_type / ffghdt (fitsfile *fptr, > int *hdutype, int *status) \end{verbatim} \begin{description} \item[5 ] Copy all or part of the HDUs in the FITS file associated with infptr and append them to the end of the FITS file associated with outfptr. If 'previous' is true (not 0), then any HDUs preceding the current HDU in the input file will be copied to the output file. Similarly, 'current' and 'following' determine whether the current HDU, and/or any following HDUs in the input file will be copied to the output file. Thus, if all 3 parameters are true, then the entire input file will be copied. On exit, the current HDU in the input file will be unchanged, and the last HDU in the output file will be the current HDU. \label{ffcpfl} \end{description} \begin{verbatim} int fits_copy_file / ffcpfl (fitsfile *infptr, fitsfile *outfptr, int previous, int current, int following, > int *status) \end{verbatim} \begin{description} \item[6 ] Copy the current HDU from the FITS file associated with infptr and append it to the end of the FITS file associated with outfptr. Space may be reserved for MOREKEYS additional keywords in the output header. \label{ffcopy} \end{description} \begin{verbatim} int fits_copy_hdu / ffcopy (fitsfile *infptr, fitsfile *outfptr, int morekeys, > int *status) \end{verbatim} \begin{description} \item[7 ] Write the current HDU in the input FITS file to the output FILE stream (e.g., to stdout). \label{ffwrhdu} \end{description} \begin{verbatim} int fits_write_hdu / ffwrhdu (fitsfile *infptr, FILE *stream, > int *status) \end{verbatim} \begin{description} \item[8 ] Copy the header (and not the data) from the CHDU associated with infptr to the CHDU associated with outfptr. If the current output HDU is not completely empty, then the CHDU will be closed and a new HDU will be appended to the output file. An empty output data unit will be created with all values initially = 0). \label{ffcphd} \end{description} \begin{verbatim} int fits_copy_header / ffcphd (fitsfile *infptr, fitsfile *outfptr, > int *status) \end{verbatim} \begin{description} \item[9 ] Delete the CHDU in the FITS file. Any following HDUs will be shifted forward in the file, to fill in the gap created by the deleted HDU. In the case of deleting the primary array (the first HDU in the file) then the current primary array will be replace by a null primary array containing the minimum set of required keywords and no data. If there are more extensions in the file following the one that is deleted, then the the CHDU will be redefined to point to the following extension. If there are no following extensions then the CHDU will be redefined to point to the previous HDU. The output hdutype parameter returns the type of the new CHDU. A null pointer may be given for hdutype if the returned value is not needed. \label{ffdhdu} \end{description} \begin{verbatim} int fits_delete_hdu / ffdhdu (fitsfile *fptr, > int *hdutype, int *status) \end{verbatim} \section{Header Keyword Read/Write Routines} These routines read or write keywords in the Current Header Unit (CHU). Wild card characters (*, ?, or \#) may be used when specifying the name of the keyword to be read: a '?' will match any single character at that position in the keyword name and a '*' will match any length (including zero) string of characters. The '\#' character will match any consecutive string of decimal digits (0 - 9). When a wild card is used the routine will only search for a match from the current header position to the end of the header and will not resume the search from the top of the header back to the original header position as is done when no wildcards are included in the keyword name. The fits\_read\_record routine may be used to set the starting position when doing wild card searches. A status value of KEY\_NO\_EXIST is returned if the specified keyword to be read is not found in the header. \subsection{Keyword Reading Routines} \begin{description} \item[1 ] Return the number of existing keywords (not counting the END keyword) and the amount of space currently available for more keywords. It returns morekeys = -1 if the header has not yet been closed. Note that CFITSIO will dynamically add space if required when writing new keywords to a header so in practice there is no limit to the number of keywords that can be added to a header. A null pointer may be entered for the morekeys parameter if it's value is not needed. \label{ffghsp} \end{description} \begin{verbatim} int fits_get_hdrspace / ffghsp (fitsfile *fptr, > int *keysexist, int *morekeys, int *status) \end{verbatim} \begin{description} \item[2 ] Return the specified keyword. In the first routine, the datatype parameter specifies the desired returned data type of the keyword value and can have one of the following symbolic constant values: TSTRING, TLOGICAL (== int), TBYTE, TSHORT, TUSHORT, TINT, TUINT, TLONG, TULONG, TLONGLONG, TFLOAT, TDOUBLE, TCOMPLEX, and TDBLCOMPLEX. Within the context of this routine, TSTRING corresponds to a 'char*' data type, i.e., a pointer to a character array. Data type conversion will be performed for numeric values if the keyword value does not have the same data type. If the value of the keyword is undefined (i.e., the value field is blank) then an error status = VALUE\_UNDEFINED will be returned. The second routine returns the keyword value as a character string (a literal copy of what is in the value field) regardless of the intrinsic data type of the keyword. The third routine returns the entire 80-character header record of the keyword, with any trailing blank characters stripped off. The fourth routine returns the (next) header record that contains the literal string of characters specified by the 'string' argument. If a NULL comment pointer is supplied then the comment string will not be returned. \label{ffgky} \label{ffgkey} \label{ffgcrd} \end{description} \begin{verbatim} int fits_read_key / ffgky (fitsfile *fptr, int datatype, char *keyname, > DTYPE *value, char *comment, int *status) int fits_read_keyword / ffgkey (fitsfile *fptr, char *keyname, > char *value, char *comment, int *status) int fits_read_card / ffgcrd (fitsfile *fptr, char *keyname, > char *card, int *status) int fits_read_str / ffgstr (fitsfile *fptr, char *string, > char *card, int *status) \end{verbatim} \begin{description} \item[3 ] Read a string-valued keyword and return the string length, the value string, and/or the comment field. The first routine, ffgksl, simply returns the length of the character string value of the specified keyword. The second routine, ffgsky, also returns up to maxchar characters of the keyword value string, starting with the firstchar character, and the keyword comment string (unless the input value of comm = NULL). The valuelen argument returns the total length of the keyword value string regardless of how much of the string is actually returned (which depends on the value of the firstchar and maxchar arguments). Note that the value character string argument must be allocated large enough to also hold the null terminator at the end of the returned string. These routines support string keywords that use the CONTINUE convention to continue long string values over multiple FITS header records. Normally, string-valued keywords have a maximum length of 68 characters, however, CONTINUE'd string keywords may be arbitrarily long. \label{ffgksl} \label{ffgsky} \end{description} \begin{verbatim} int fits_get_key_strlen / ffgksl (fitsfile *fptr, const char *keyname, int *length, int *status); int fits_read_string_key / ffgsky (fitsfile *fptr, const char *keyname, int firstchar, int maxchar, char *value, int *valuelen, char *comm, int *status); \end{verbatim} \begin{description} \item[4 ] Return the nth header record in the CHU. The first keyword in the header is at keynum = 1; if keynum = 0 then these routines simply reset the internal CFITSIO pointer to the beginning of the header so that subsequent keyword operations will start at the top of the header (e.g., prior to searching for keywords using wild cards in the keyword name). The first routine returns the entire 80-character header record (with trailing blanks truncated), while the second routine parses the record and returns the name, value, and comment fields as separate (blank truncated) character strings. If a NULL comment pointer is given on input, then the comment string will not be returned. \label{ffgrec} \label{ffgkyn} \end{description} \begin{verbatim} int fits_read_record / ffgrec (fitsfile *fptr, int keynum, > char *card, int *status) int fits_read_keyn / ffgkyn (fitsfile *fptr, int keynum, > char *keyname, char *value, char *comment, int *status) \end{verbatim} \begin{description} \item[5 ] Return the next keyword whose name matches one of the strings in 'inclist' but does not match any of the strings in 'exclist'. The strings in inclist and exclist may contain wild card characters (*, ?, and \#) as described at the beginning of this section. This routine searches from the current header position to the end of the header, only, and does not continue the search from the top of the header back to the original position. The current header position may be reset with the ffgrec routine. Note that nexc may be set = 0 if there are no keywords to be excluded. This routine returns status = KEY\_NO\_EXIST if a matching keyword is not found. \label{ffgnxk} \end{description} \begin{verbatim} int fits_find_nextkey / ffgnxk (fitsfile *fptr, char **inclist, int ninc, char **exclist, int nexc, > char *card, int *status) \end{verbatim} \begin{description} \item[6 ] Return the physical units string from an existing keyword. This routine uses a local convention, shown in the following example, in which the keyword units are enclosed in square brackets in the beginning of the keyword comment field. A null string is returned if no units are defined for the keyword. \label{ffgunt} \end{description} \begin{verbatim} VELOCITY= 12.3 / [km/s] orbital speed int fits_read_key_unit / ffgunt (fitsfile *fptr, char *keyname, > char *unit, int *status) \end{verbatim} \begin{description} \item[7 ] Concatenate the header keywords in the CHDU into a single long string of characters. This provides a convenient way of passing all or part of the header information in a FITS HDU to other subroutines. Each 80-character fixed-length keyword record is appended to the output character string, in order, with no intervening separator or terminating characters. The last header record is terminated with a NULL character. These routine allocates memory for the returned character array, so the calling program must free the memory when finished. The cleanest way to do this is to call the fits\_free\_memory routine. There are 2 related routines: fits\_hdr2str simply concatenates all the existing keywords in the header; fits\_convert\_hdr2str is similar, except that if the CHDU is a tile compressed image (stored in a binary table) then it will first convert that header back to that of the corresponding normal FITS image before concatenating the keywords. Selected keywords may be excluded from the returned character string. If the second parameter (nocomments) is TRUE (nonzero) then any COMMENT, HISTORY, or blank keywords in the header will not be copied to the output string. The 'exclist' parameter may be used to supply a list of keywords that are to be excluded from the output character string. Wild card characters (*, ?, and \#) may be used in the excluded keyword names. If no additional keywords are to be excluded, then set nexc = 0 and specify NULL for the the **exclist parameter. \label{ffhdr2str} \end{description} \begin{verbatim} int fits_hdr2str / ffhdr2str (fitsfile *fptr, int nocomments, char **exclist, int nexc, > char **header, int *nkeys, int *status) int fits_convert_hdr2str / ffcnvthdr2str (fitsfile *fptr, int nocomments, char **exclist, int nexc, > char **header, int *nkeys, int *status) int fits_free_memory / fffree (char *header, > int *status); \end{verbatim} \subsection{Keyword Writing Routines} \begin{description} \item[1 ] Write a keyword of the appropriate data type into the CHU. The first routine simply appends a new keyword whereas the second routine will update the value and comment fields of the keyword if it already exists, otherwise it appends a new keyword. Note that the address to the value, and not the value itself, must be entered. The datatype parameter specifies the data type of the keyword value with one of the following values: TSTRING, TLOGICAL (== int), TBYTE, TSHORT, TUSHORT, TINT, TUINT, TLONG, TLONGLONG, TULONG, TFLOAT, TDOUBLE. Within the context of this routine, TSTRING corresponds to a 'char*' data type, i.e., a pointer to a character array. A null pointer may be entered for the comment parameter in which case the keyword comment field will be unmodified or left blank. \label{ffpky} \label{ffuky} \end{description} \begin{verbatim} int fits_write_key / ffpky (fitsfile *fptr, int datatype, char *keyname, DTYPE *value, char *comment, > int *status) int fits_update_key / ffuky (fitsfile *fptr, int datatype, char *keyname, DTYPE *value, char *comment, > int *status) \end{verbatim} \begin{description} \item[2 ] Write a keyword with a null or undefined value (i.e., the value field in the keyword is left blank). The first routine simply appends a new keyword whereas the second routine will update the value and comment fields of the keyword if it already exists, otherwise it appends a new keyword. A null pointer may be entered for the comment parameter in which case the keyword comment field will be unmodified or left blank. \label{ffpkyu} \label{ffukyu} \end{description} \begin{verbatim} int fits_write_key_null / ffpkyu (fitsfile *fptr, char *keyname, char *comment, > int *status) int fits_update_key_null / ffukyu (fitsfile *fptr, char *keyname, char *comment, > int *status) \end{verbatim} \begin{description} \item[3 ] Write (append) a COMMENT or HISTORY keyword to the CHU. The comment or history string will be continued over multiple keywords if it is longer than 70 characters. \label{ffpcom} \label{ffphis} \end{description} \begin{verbatim} int fits_write_comment / ffpcom (fitsfile *fptr, char *comment, > int *status) int fits_write_history / ffphis (fitsfile *fptr, char *history, > int *status) \end{verbatim} \begin{description} \item[4 ] Write the DATE keyword to the CHU. The keyword value will contain the current system date as a character string in 'yyyy-mm-ddThh:mm:ss' format. If a DATE keyword already exists in the header, then this routine will simply update the keyword value with the current date. \label{ffpdat} \end{description} \begin{verbatim} int fits_write_date / ffpdat (fitsfile *fptr, > int *status) \end{verbatim} \begin{description} \item[5 ]Write a user specified keyword record into the CHU. This is a low--level routine which can be used to write any arbitrary record into the header. The record must conform to the all the FITS format requirements. \label{ffprec} \end{description} \begin{verbatim} int fits_write_record / ffprec (fitsfile *fptr, char *card, > int *status) \end{verbatim} \begin{description} \item[6 ]Update an 80-character record in the CHU. If a keyword with the input name already exists, then it is overwritten by the value of card. This could modify the keyword name as well as the value and comment fields. If the keyword doesn't already exist then a new keyword card is appended to the header. \label{ffucrd} \end{description} \begin{verbatim} int fits_update_card / ffucrd (fitsfile *fptr, char *keyname, char *card, > int *status) \end{verbatim} \begin{description} \item[7 ] Modify (overwrite) the comment field of an existing keyword. \label{ffmcom} \end{description} \begin{verbatim} int fits_modify_comment / ffmcom (fitsfile *fptr, char *keyname, char *comment, > int *status) \end{verbatim} \begin{description} \item[8 ] Write the physical units string into an existing keyword. This routine uses a local convention, shown in the following example, in which the keyword units are enclosed in square brackets in the beginning of the keyword comment field. \label{ffpunt} \end{description} \begin{verbatim} VELOCITY= 12.3 / [km/s] orbital speed int fits_write_key_unit / ffpunt (fitsfile *fptr, char *keyname, char *unit, > int *status) \end{verbatim} \begin{description} \item[9 ] Rename an existing keyword, preserving the current value and comment fields. \label{ffmnam} \end{description} \begin{verbatim} int fits_modify_name / ffmnam (fitsfile *fptr, char *oldname, char *newname, > int *status) \end{verbatim} \begin{description} \item[10] Delete a keyword record. The space occupied by the keyword is reclaimed by moving all the following header records up one row in the header. The first routine deletes a keyword at a specified position in the header (the first keyword is at position 1), whereas the second routine deletes a specifically named keyword. Wild card characters may be used when specifying the name of the keyword to be deleted. The third routine deletes the (next) keyword that contains the literal character string specified by the 'string' argument.\label{ffdrec} \label{ffdkey} \end{description} \begin{verbatim} int fits_delete_record / ffdrec (fitsfile *fptr, int keynum, > int *status) int fits_delete_key / ffdkey (fitsfile *fptr, char *keyname, > int *status) int fits_delete_str / ffdstr (fitsfile *fptr, char *string, > int *status) \end{verbatim} \section{Primary Array or IMAGE Extension I/O Routines} These routines read or write data values in the primary data array (i.e., the first HDU in a FITS file) or an IMAGE extension. There are also routines to get information about the data type and size of the image. Users should also read the following chapter on the CFITSIO iterator function which provides a more `object oriented' method of reading and writing images. The iterator function is a little more complicated to use, but the advantages are that it usually takes less code to perform the same operation, and the resulting program often runs faster because the FITS files are read and written using the most efficient block size. C programmers should note that the ordering of arrays in FITS files, and hence in all the CFITSIO calls, is more similar to the dimensionality of arrays in Fortran rather than C. For instance if a FITS image has NAXIS1 = 100 and NAXIS2 = 50, then a 2-D array just large enough to hold the image should be declared as array[50][100] and not as array[100][50]. The `datatype' parameter specifies the data type of the `nulval' and `array' pointers and can have one of the following values: TBYTE, TSBYTE, TSHORT, TUSHORT, TINT, TUINT, TLONG, TLONGLONG, TULONG, TULONGLONG, TFLOAT, TDOUBLE. Automatic data type conversion is performed if the data type of the FITS array (as defined by the BITPIX keyword) differs from that specified by 'datatype'. The data values are also automatically scaled by the BSCALE and BZERO keyword values as they are being read or written in the FITS array. \begin{description} \item[1 ] Get the data type or equivalent data type of the image. The first routine returns the physical data type of the FITS image, as given by the BITPIX keyword, with allowed values of BYTE\_IMG (8), SHORT\_IMG (16), LONG\_IMG (32), LONGLONG\_IMG (64), FLOAT\_IMG (-32), and DOUBLE\_IMG (-64). The second routine is similar, except that if the image pixel values are scaled, with non-default values for the BZERO and BSCALE keywords, then the routine will return the 'equivalent' data type that is needed to store the scaled values. For example, if BITPIX = 16 and BSCALE = 0.1 then the equivalent data type is FLOAT\_IMG. Similarly if BITPIX = 16, BSCALE = 1, and BZERO = 32768, then the the pixel values span the range of an unsigned short integer and the returned data type will be USHORT\_IMG. \label{ffgidt} \end{description} \begin{verbatim} int fits_get_img_type / ffgidt (fitsfile *fptr, > int *bitpix, int *status) int fits_get_img_equivtype / ffgiet (fitsfile *fptr, > int *bitpix, int *status) \end{verbatim} \begin{description} \item[2 ] Get the number of dimensions, and/or the size of each dimension in the image . The number of axes in the image is given by naxis, and the size of each dimension is given by the naxes array (a maximum of maxdim dimensions will be returned). \label{ffgidm} \label{ffgisz} \label{ffgipr} \end{description} \begin{verbatim} int fits_get_img_dim / ffgidm (fitsfile *fptr, > int *naxis, int *status) int fits_get_img_size / ffgisz (fitsfile *fptr, int maxdim, > long *naxes, int *status) int fits_get_img_sizell / ffgiszll (fitsfile *fptr, int maxdim, > LONGLONG *naxes, int *status) int fits_get_img_param / ffgipr (fitsfile *fptr, int maxdim, > int *bitpix, int *naxis, long *naxes, int *status) int fits_get_img_paramll / ffgiprll (fitsfile *fptr, int maxdim, > int *bitpix, int *naxis, LONGLONG *naxes, int *status) \end{verbatim} \begin{description} \item[3 ]Create a new primary array or IMAGE extension with a specified data type and size. If the FITS file is currently empty then a primary array is created, otherwise a new IMAGE extension is appended to the file. \label{ffcrim} \end{description} \begin{verbatim} int fits_create_img / ffcrim ( fitsfile *fptr, int bitpix, int naxis, long *naxes, > int *status) int fits_create_imgll / ffcrimll ( fitsfile *fptr, int bitpix, int naxis, LONGLONG *naxes, > int *status) \end{verbatim} \begin{description} \item[4 ] Copy an n-dimensional image in a particular row and column of a binary table (in a vector column) to or from a primary array or image extension. The 'cell2image' routine will append a new image extension (or primary array) to the output file. Any WCS keywords associated with the input column image will be translated into the appropriate form for an image extension. Any other keywords in the table header that are not specifically related to defining the binary table structure or to other columns in the table will also be copied to the header of the output image. The 'image2cell' routine will copy the input image into the specified row and column of the current binary table in the output file. The binary table HDU must exist before calling this routine, but it may be empty, with no rows or columns of data. The specified column (and row) will be created if it does not already exist. The 'copykeyflag' parameter controls which keywords are copied from the input image to the header of the output table: 0 = no keywords will be copied, 1 = all keywords will be copied (except those keywords that would be invalid in the table header), and 2 = copy only the WCS keywords. \label{copycell} \end{description} \begin{verbatim} int fits_copy_cell2image (fitsfile *infptr, fitsfile *outfptr, char *colname, long rownum, > int *status) int fits_copy_image2cell (fitsfile *infptr, fitsfile *outfptr, char *colname, long rownum, int copykeyflag > int *status) \end{verbatim} \begin{description} \item[5 ] Write a rectangular subimage (or the whole image) to the FITS data array. The fpixel and lpixel arrays give the coordinates of the first (lower left corner) and last (upper right corner) pixels in FITS image to be written to. \label{ffpss} \end{description} \begin{verbatim} int fits_write_subset / ffpss (fitsfile *fptr, int datatype, long *fpixel, long *lpixel, DTYPE *array, > int *status) \end{verbatim} \begin{description} \item[6 ] Write pixels into the FITS data array. 'fpixel' is an array of length NAXIS which gives the coordinate of the starting pixel to be written to, such that fpixel[0] is in the range 1 to NAXIS1, fpixel[1] is in the range 1 to NAXIS2, etc. The first pair of routines simply writes the array of pixels to the FITS file (doing data type conversion if necessary) whereas the second routines will substitute the appropriate FITS null value for any elements which are equal to the input value of nulval (note that this parameter gives the address of the null value, not the null value itself). For integer FITS arrays, the FITS null value is defined by the BLANK keyword (an error is returned if the BLANK keyword doesn't exist). For floating point FITS arrays the special IEEE NaN (Not-a-Number) value will be written into the FITS file. If a null pointer is entered for nulval, then the null value is ignored and this routine behaves the same as fits\_write\_pix. \label{ffppx} \label{ffppxn} \end{description} \begin{verbatim} int fits_write_pix / ffppx (fitsfile *fptr, int datatype, long *fpixel, LONGLONG nelements, DTYPE *array, int *status); int fits_write_pixll / ffppxll (fitsfile *fptr, int datatype, LONGLONG *fpixel, LONGLONG nelements, DTYPE *array, int *status); int fits_write_pixnull / ffppxn (fitsfile *fptr, int datatype, long *fpixel, LONGLONG nelements, DTYPE *array, DTYPE *nulval, > int *status); int fits_write_pixnullll / ffppxnll (fitsfile *fptr, int datatype, LONGLONG *fpixel, LONGLONG nelements, DTYPE *array, DTYPE *nulval, > int *status); \end{verbatim} \begin{description} \item[7 ] Set FITS data array elements equal to the appropriate null pixel value. For integer FITS arrays, the FITS null value is defined by the BLANK keyword (an error is returned if the BLANK keyword doesn't exist). For floating point FITS arrays the special IEEE NaN (Not-a-Number) value will be written into the FITS file. Note that 'firstelem' is a scalar giving the offset to the first pixel to be written in the equivalent 1-dimensional array of image pixels. \label{ffpprn} \end{description} \begin{verbatim} int fits_write_null_img / ffpprn (fitsfile *fptr, LONGLONG firstelem, LONGLONG nelements, > int *status) \end{verbatim} \begin{description} \item[8 ] Read a rectangular subimage (or the whole image) from the FITS data array. The fpixel and lpixel arrays give the coordinates of the first (lower left corner) and last (upper right corner) pixels to be read from the FITS image. Undefined FITS array elements will be returned with a value = *nullval, (note that this parameter gives the address of the null value, not the null value itself) unless nulval = 0 or *nulval = 0, in which case no checks for undefined pixels will be performed. \label{ffgsv} \end{description} \begin{verbatim} int fits_read_subset / ffgsv (fitsfile *fptr, int datatype, long *fpixel, long *lpixel, long *inc, DTYPE *nulval, > DTYPE *array, int *anynul, int *status) \end{verbatim} \begin{description} \item[9 ] Read pixels from the FITS data array. 'fpixel' is the starting pixel location and is an array of length NAXIS such that fpixel[0] is in the range 1 to NAXIS1, fpixel[1] is in the range 1 to NAXIS2, etc. The nelements parameter specifies the number of pixels to read. If fpixel is set to the first pixel, and nelements is set equal to the NAXIS1 value, then this routine would read the first row of the image. Alternatively, if nelements is set equal to NAXIS1 * NAXIS2 then it would read an entire 2D image, or the first plane of a 3-D datacube. The first 2 routines will return any undefined pixels in the FITS array equal to the value of *nullval (note that this parameter gives the address of the null value, not the null value itself) unless nulval = 0 or *nulval = 0, in which case no checks for undefined pixels will be performed. The second 2 routines are similar except that any undefined pixels will have the corresponding nullarray element set equal to TRUE (= 1). \label{ffgpxv} \label{ffgpxf} \end{description} \begin{verbatim} int fits_read_pix / ffgpxv (fitsfile *fptr, int datatype, long *fpixel, LONGLONG nelements, DTYPE *nulval, > DTYPE *array, int *anynul, int *status) int fits_read_pixll / ffgpxvll (fitsfile *fptr, int datatype, LONGLONG *fpixel, LONGLONG nelements, DTYPE *nulval, > DTYPE *array, int *anynul, int *status) int fits_read_pixnull / ffgpxf (fitsfile *fptr, int datatype, long *fpixel, LONGLONG nelements, > DTYPE *array, char *nullarray, int *anynul, int *status) int fits_read_pixnullll / ffgpxfll (fitsfile *fptr, int datatype, LONGLONG *fpixel, LONGLONG nelements, > DTYPE *array, char *nullarray, int *anynul, int *status) \end{verbatim} \begin{description} \item[10] Copy a rectangular section of an image and write it to a new FITS primary image or image extension. The new image HDU is appended to the end of the output file; all the keywords in the input image will be copied to the output image. The common WCS keywords will be updated if necessary to correspond to the coordinates of the section. The format of the section expression is same as specifying an image section using the extended file name syntax (see "Image Section" in Chapter 10). (Examples: "1:100,1:200", "1:100:2, 1:*:2", "*, -*"). \label{ffcpimg} \end{description} \begin{verbatim} int fits_copy_image_section / ffcpimg (fitsfile *infptr, fitsfile *outfptr, char *section, int *status) \end{verbatim} \section{Image Compression} CFITSIO transparently supports the 2 methods of image compression described below. 1) The entire FITS file may be externally compressed with the gzip or Unix compress utility programs, producing a *.gz or *.Z file, respectively. When reading compressed files of this type, CFITSIO first uncompresses the entire file into memory before performing the requested read operations. Output files can be directly written in the gzip compressed format if the user-specified filename ends with `.gz'. In this case, CFITSIO initially writes the uncompressed file in memory and then compresses it and writes it to disk when the FITS file is closed, thus saving user disk space. Read and write access to these compressed FITS files is generally quite fast since all the I/O is performed in memory; the main limitation with this technique is that there must be enough available memory (or swap space) to hold the entire uncompressed FITS file. 2) CFITSIO also supports the FITS tiled image compression convention in which the image is subdivided into a grid of rectangular tiles, and each tile of pixels is individually compressed. The details of this FITS compression convention are described at the FITS Support Office web site at http://fits.gsfc.nasa.gov/fits\_registry.html, and in the fpackguide pdf file that is included with the CFITSIO source file distributions Basically, the compressed image tiles are stored in rows of a variable length array column in a FITS binary table, however CFITSIO recognizes that this binary table extension contains an image and treats it as if it were an IMAGE extension. This tile-compressed format is especially well suited for compressing very large images because a) the FITS header keywords remain uncompressed for rapid read access, and because b) it is possible to extract and uncompress sections of the image without having to uncompress the entire image. This format is also much more effective in compressing floating point images than simply compressing the image using gzip or compress because it approximates the floating point values with scaled integers which can then be compressed more efficiently. Currently CFITSIO supports 3 general purpose compression algorithms plus one other special-purpose compression technique that is designed for data masks with positive integer pixel values. The 3 general purpose algorithms are GZIP, Rice, and HCOMPRESS, and the special purpose algorithm is the IRAF pixel list compression technique (PLIO). There are 2 variants of the GZIP algorithm: GZIP\_1 compresses the array of image pixel value normally with the GZIP algorithm, while GZIP\_2 first shuffles the bytes in all the pixel values so that the most-significant byte of every pixel appears first, followed by the less significant bytes in sequence. GZIP\_2 may be more effective in cases where the most significant byte in most of the image pixel values contains the same bit pattern. In principle, any number of other compression algorithms could also be supported by the FITS tiled image compression convention. The FITS image can be subdivided into any desired rectangular grid of compression tiles. With the GZIP, Rice, and PLIO algorithms, the default is to take each row of the image as a tile. The HCOMPRESS algorithm is inherently 2-dimensional in nature, so the default in this case is to take 16 rows of the image per tile. In most cases it makes little difference what tiling pattern is used, so the default tiles are usually adequate. In the case of very small images, it could be more efficient to compress the whole image as a single tile. Note that the image dimensions are not required to be an integer multiple of the tile dimensions; if not, then the tiles at the edges of the image will be smaller than the other tiles. The 4 supported image compression algorithms are all 'loss-less' when applied to integer FITS images; the pixel values are preserved exactly with no loss of information during the compression and uncompression process. In addition, the HCOMPRESS algorithm supports a 'lossy' compression mode that will produce larger amount of image compression. This is achieved by specifying a non-zero value for the HCOMPRESS ``scale'' parameter. Since the amount of compression that is achieved depends directly on the RMS noise in the image, it is usually more convention to specify the HCOMPRESS scale factor relative to the RMS noise. Setting s = 2.5 means use a scale factor that is 2.5 times the calculated RMS noise in the image tile. In some cases it may be desirable to specify the exact scaling to be used, instead of specifying it relative to the calculated noise value. This may be done by specifying the negative of desired scale value (typically in the range -2 to -100). Very high compression factors (of 100 or more) can be achieved by using large HCOMPRESS scale values, however, this can produce undesirable ``blocky'' artifacts in the compressed image. A variation of the HCOMPRESS algorithm (called HSCOMPRESS) can be used in this case to apply a small amount of smoothing of the image when it is uncompressed to help cover up these artifacts. This smoothing is purely cosmetic and does not cause any significant change to the image pixel values. Floating point FITS images (which have BITPIX = -32 or -64) usually contain too much ``noise'' in the least significant bits of the mantissa of the pixel values to be effectively compressed with any lossless algorithm. Consequently, floating point images are first quantized into scaled integer pixel values (and thus throwing away much of the noise) before being compressed with the specified algorithm (either GZIP, Rice, or HCOMPRESS). This technique produces much higher compression factors than simply using the GZIP utility to externally compress the whole FITS file, but it also means that the original floating value pixel values are not exactly preserved. When done properly, this integer scaling technique will only discard the insignificant noise while still preserving all the real information in the image. The amount of precision that is retained in the pixel values is controlled by the "quantization level" parameter, q. Larger values of q will result in compressed images whose pixels more closely match the floating point pixel values, but at the same time the amount of compression that is achieved will be reduced. Users should experiment with different values for this parameter to determine the optimal value that preserves all the useful information in the image, without needlessly preserving all the ``noise'' which will hurt the compression efficiency. The default value for the quantization scale factor is 4.0, which means that scaled integer pixel values will be quantized such that the difference between adjacent integer values will be 1/4th of the noise level in the image background. CFITSIO uses an optimized algorithm to accurately estimate the noise in the image. As an example, if the RMS noise in the background pixels of an image = 32.0, then the spacing between adjacent scaled integer pixel values will equal 8.0 by default. Note that the RMS noise is independently calculated for each tile of the image, so the resulting integer scaling factor may fluctuate slightly for each tile. In some cases it may be desirable to specify the exact quantization level to be used, instead of specifying it relative to the calculated noise value. This may be done by specifying the negative of desired quantization level for the value of q. In the previous example, one could specify q = -8.0 so that the quantized integer levels differ by exactly 8.0. Larger negative values for q means that the levels are more coarsely spaced, and will produce higher compression factors. When floating point images are being quantized, one must also specify what quantization method is to be used. The default algorithm is called ``SUBTRACTIVE\_DITHER\_1''. A second variation called ``SUBTRACTIVE\_DITHER\_2'' is also available, which does the same thing except that any pixels with a value of 0.0 are not dithered and instead the zero values are exactly preserved in the compressed image. One may also turn off dithering completely with the ``NO\_DITHER'' option, but this is not recommended because it can cause larger systematic errors in measurements of the position or brightness of objects in the compressed image. There are 3 methods for specifying all the parameters needed to write a FITS image in the tile compressed format. The parameters may either be specified at run time as part of the file name of the output compressed FITS file, or the writing program may call a set of helper CFITSIO subroutines that are provided for specifying the parameter values, or ``compression directive'' keywords may be added to the header of each image HDU to specify the compression parameters. These 3 methods are described below. 1) At run time, when specifying the name of the output FITS file to be created, the user can indicate that images should be written in tile-compressed format by enclosing the compression parameters in square brackets following the root disk file name in the following format: \begin{verbatim} [compress NAME T1,T2; q[z] QLEVEL, s HSCALE] \end{verbatim} where \begin{verbatim} NAME = algorithm name: GZIP, Rice, HCOMPRESS, HSCOMPRSS or PLIO may be abbreviated to the first letter (or HS for HSCOMPRESS) T1,T2 = tile dimension (e.g. 100,100 for square tiles 100 pixels wide) QLEVEL = quantization level for floating point FITS images HSCALE = HCOMPRESS scale factor; default = 0 which is lossless. \end{verbatim} Here are a few examples of this extended syntax: \begin{verbatim} myfile.fit[compress] - use the default compression algorithm (Rice) and the default tile size (row by row) myfile.fit[compress G] - use the specified compression algorithm; myfile.fit[compress R] only the first letter of the algorithm myfile.fit[compress P] should be given. myfile.fit[compress H] myfile.fit[compress R 100,100] - use Rice and 100 x 100 pixel tiles myfile.fit[compress R; q 10.0] - quantization level = (RMS-noise) / 10. myfile.fit[compress R; qz 10.0] - quantization level = (RMS-noise) / 10. also use the SUBTRACTIVE_DITHER_2 quantization method myfile.fit[compress HS; s 2.0] - HSCOMPRESS (with smoothing) and scale = 2.0 * RMS-noise \end{verbatim} 2) Before calling the CFITSIO routine to write the image header keywords (e.g., fits\_create\_image) the programmer can call the routines described below to specify the compression algorithm and the tiling pattern that is to be used. There are routines for specifying the various compression parameters and similar routines to return the current values of the parameters: \label{ffsetcomp} \label{ffgetcomp} \begin{verbatim} int fits_set_compression_type(fitsfile *fptr, int comptype, int *status) int fits_set_tile_dim(fitsfile *fptr, int ndim, long *tilesize, int *status) int fits_set_quantize_level(fitsfile *fptr, float qlevel, int *status) int fits_set_quantize_method(fitsfile *fptr, int method, int *status) int fits_set_quantize_dither(fitsfile *fptr, int dither, int *status) int fits_set_dither_seed(fitsfile *fptr, int seed, int *status) int fits_set_dither_offset(fitsfile *fptr, int offset, int *status) int fits_set_lossy_int(fitsfile *fptr, int lossy_int, int *status) this forces integer image to be converted to floats, then quantized int fits_set_huge_hdu(fitsfile *fptr, int huge, int *status); this should be called when the compressed image size is more than 4 GB. int fits_set_hcomp_scale(fitsfile *fptr, float scale, int *status) int fits_set_hcomp_smooth(fitsfile *fptr, int smooth, int *status) Set smooth = 1 to apply smoothing when uncompressing the image int fits_get_compression_type(fitsfile *fptr, int *comptype, int *status) int fits_get_tile_dim(fitsfile *fptr, int ndim, long *tilesize, int *status) int fits_get_quantize_level(fitsfile *fptr, float *level, int *status) int fits_get_hcomp_scale(fitsfile *fptr, float *scale, int *status) \end{verbatim} Several symbolic constants are defined for use as the value of the `comptype' parameter: GZIP\_1, GZIP\_2, RICE\_1, HCOMPRESS\_1 or PLIO\_1. Entering NULL for comptype will turn off the tile-compression and cause normal FITS images to be written. There are also defined symbolic constants for the quantization method: ``SUBTRACTIVE\_DITHER\_1'', ``SUBTRACTIVE\_DITHER\_2'', and ``NO\_DITHER''. 3) CFITSIO will uses the values of the following keywords, if they are present in the header of the image HDU, to determine how to compress that HDU. These keywords override any compression parameters that were specified with the previous 2 methods. \begin{verbatim} FZALGOR - 'RICE_1' , 'GZIP_1', 'GZIP_2', 'HCOMPRESS_1', 'PLIO_1', 'NONE' FZTILE - 'ROW', 'WHOLE', or '(n,m)' FZQVALUE - float value (default = 4.0) FZQMETHD - 'SUBTRACTIVE_DITHER_1', 'SUBTRACTIVE_DITHER_2', 'NO_DITHER' FZDTHRSD - 'CLOCK', 'CHECKSUM', 1 - 10000 FZINT2F - T, or F: Convert integers to floats, then quantize? FZHSCALE - float value (default = 0). Hcompress scale value. \end{verbatim} No special action is required by software when read tile-compressed images because all the CFITSIO routines that read normal uncompressed FITS images also transparently read images in the tile-compressed format; CFITSIO essentially treats the binary table that contains the compressed tiles as if it were an IMAGE extension. The following 2 routines are available for compressing or or decompressing an image: \begin{verbatim} int fits_img_compress(fitsfile *infptr, fitsfile *outfptr, int *status); int fits_img_decompress (fitsfile *infptr, fitsfile *outfptr, int *status); \end{verbatim} Before calling the compression routine, the compression parameters must first be defined in one of the 3 way described in the previous paragraphs. There is also a routine to determine if the current HDU contains a tile compressed image (it returns 1 or 0): \begin{verbatim} int fits_is_compressed_image(fitsfile *fptr, int *status); \end{verbatim} A small example program called 'imcopy' is included with CFITSIO that can be used to compress (or uncompress) any FITS image. This program can be used to experiment with the various compression options on existing FITS images as shown in these examples: \begin{verbatim} 1) imcopy infile.fit 'outfile.fit[compress]' This will use the default compression algorithm (Rice) and the default tile size (row by row) 2) imcopy infile.fit 'outfile.fit[compress GZIP]' This will use the GZIP compression algorithm and the default tile size (row by row). The allowed compression algorithms are Rice, GZIP, and PLIO. Only the first letter of the algorithm name needs to be specified. 3) imcopy infile.fit 'outfile.fit[compress G 100,100]' This will use the GZIP compression algorithm and 100 X 100 pixel tiles. 4) imcopy infile.fit 'outfile.fit[compress R 100,100; qz 10.0]' This will use the Rice compression algorithm, 100 X 100 pixel tiles, and quantization level = RMSnoise / 10.0 (assuming the input image has a floating point data type). By specifying qz instead of q, this means use the subtractive dither2 quantization method. 5) imcopy infile.fit outfile.fit If the input file is in tile-compressed format, then it will be uncompressed to the output file. Otherwise, it simply copies the input image to the output image. 6) imcopy 'infile.fit[1001:1500,2001:2500]' outfile.fit This extracts a 500 X 500 pixel section of the much larger input image (which may be in tile-compressed format). The output is a normal uncompressed FITS image. 7) imcopy 'infile.fit[1001:1500,2001:2500]' outfile.fit.gz Same as above, except the output file is externally compressed using the gzip algorithm. \end{verbatim} \section{ASCII and Binary Table Routines} These routines perform read and write operations on columns of data in FITS ASCII or Binary tables. Note that in the following discussions, the first row and column in a table is at position 1 not 0. Users should also read the following chapter on the CFITSIO iterator function which provides a more `object oriented' method of reading and writing table columns. The iterator function is a little more complicated to use, but the advantages are that it usually takes less code to perform the same operation, and the resulting program often runs faster because the FITS files are read and written using the most efficient block size. \subsection{Create New Table} \begin{description} \item[1 ]Create a new ASCII or bintable table extension. If the FITS file is currently empty then a dummy primary array will be created before appending the table extension to it. The tbltype parameter defines the type of table and can have values of ASCII\_TBL or BINARY\_TBL. The naxis2 parameter gives the initial number of rows to be created in the table, and should normally be set = 0. CFITSIO will automatically increase the size of the table as additional rows are written. A non-zero number of rows may be specified to reserve space for that many rows, even if a fewer number of rows will be written. The tunit and extname parameters are optional and a null pointer may be given if they are not defined. The FITS Standard recommends that only letters, digits, and the underscore character be used in column names (the ttype parameter) with no embedded spaces. Trailing blank characters are not significant. \label{ffcrtb} \end{description} \begin{verbatim} int fits_create_tbl / ffcrtb (fitsfile *fptr, int tbltype, LONGLONG naxis2, int tfields, char *ttype[], char *tform[], char *tunit[], char *extname, int *status) \end{verbatim} \subsection{Column Information Routines} \begin{description} \item[1 ] Get the number of rows or columns in the current FITS table. The number of rows is given by the NAXIS2 keyword and the number of columns is given by the TFIELDS keyword in the header of the table. \label{ffgnrw} \end{description} \begin{verbatim} int fits_get_num_rows / ffgnrw (fitsfile *fptr, > long *nrows, int *status); int fits_get_num_rowsll / ffgnrwll (fitsfile *fptr, > LONGLONG *nrows, int *status); int fits_get_num_cols / ffgncl (fitsfile *fptr, > int *ncols, int *status); \end{verbatim} \begin{description} \item[2 ] Get the table column number (and name) of the column whose name matches an input template name. If casesen = CASESEN then the column name match will be case-sensitive, whereas if casesen = CASEINSEN then the case will be ignored. As a general rule, the column names should be treated as case INsensitive. The input column name template may be either the exact name of the column to be searched for, or it may contain wild card characters (*, ?, or \#), or it may contain the integer number of the desired column (with the first column = 1). The `*' wild card character matches any sequence of characters (including zero characters) and the `?' character matches any single character. The \# wildcard will match any consecutive string of decimal digits (0-9). If more than one column name in the table matches the template string, then the first match is returned and the status value will be set to COL\_NOT\_UNIQUE as a warning that a unique match was not found. To find the other cases that match the template, call the routine again leaving the input status value equal to COL\_NOT\_UNIQUE and the next matching name will then be returned. Repeat this process until a status = COL\_NOT\_FOUND is returned. The FITS Standard recommends that only letters, digits, and the underscore character be used in column names (with no embedded spaces). Trailing blank characters are not significant. \label{ffgcno} \label{ffgcnn} \end{description} \begin{verbatim} int fits_get_colnum / ffgcno (fitsfile *fptr, int casesen, char *templt, > int *colnum, int *status) int fits_get_colname / ffgcnn (fitsfile *fptr, int casesen, char *templt, > char *colname, int *colnum, int *status) \end{verbatim} \begin{description} \item[3 ] Return the data type, vector repeat value, and the width in bytes of a column in an ASCII or binary table. Allowed values for the data type in ASCII tables are: TSTRING, TSHORT, TLONG, TFLOAT, and TDOUBLE. Binary tables also support these types: TLOGICAL, TBIT, TBYTE, TLONGLONG, TCOMPLEX and TDBLCOMPLEX. The negative of the data type code value is returned if it is a variable length array column. Note that in the case of a 'J' 32-bit integer binary table column, this routine will return data type = TINT32BIT (which in fact is equivalent to TLONG). With most current C compilers, a value in a 'J' column has the same size as an 'int' variable, and may not be equivalent to a 'long' variable, which is 64-bits long on an increasing number of compilers. The 'repeat' parameter returns the vector repeat count on the binary table TFORMn keyword value. (ASCII table columns always have repeat = 1). The 'width' parameter returns the width in bytes of a single column element (e.g., a '10D' binary table column will have width = 8, an ASCII table 'F12.2' column will have width = 12, and a binary table'60A' character string column will have width = 60); Note that CFITSIO supports the local convention for specifying arrays of fixed length strings within a binary table character column using the syntax TFORM = 'rAw' where 'r' is the total number of characters (= the width of the column) and 'w' is the width of a unit string within the column. Thus if the column has TFORM = '60A12' then this means that each row of the table contains 5 12-character substrings within the 60-character field, and thus in this case this routine will return typecode = TSTRING, repeat = 60, and width = 12. (The TDIMn keyword may also be used to specify the unit string length; The pair of keywords TFORMn = '60A' and TDIMn = '(12,5)' would have the same effect as TFORMn = '60A12'). The number of substrings in any binary table character string field can be calculated by (repeat/width). A null pointer may be given for any of the output parameters that are not needed. The second routine, fit\_get\_eqcoltype is similar except that in the case of scaled integer columns it returns the 'equivalent' data type that is needed to store the scaled values, and not necessarily the physical data type of the unscaled values as stored in the FITS table. For example if a '1I' column in a binary table has TSCALn = 1 and TZEROn = 32768, then this column effectively contains unsigned short integer values, and thus the returned value of typecode will be TUSHORT, not TSHORT. Similarly, if a column has TTYPEn = '1I' and TSCALn = 0.12, then the returned typecode will be TFLOAT. \label{ffgtcl} \end{description} \begin{verbatim} int fits_get_coltype / ffgtcl (fitsfile *fptr, int colnum, > int *typecode, long *repeat, long *width, int *status) int fits_get_coltypell / ffgtclll (fitsfile *fptr, int colnum, > int *typecode, LONGLONG *repeat, LONGLONG *width, int *status) int fits_get_eqcoltype / ffeqty (fitsfile *fptr, int colnum, > int *typecode, long *repeat, long *width, int *status) int fits_get_eqcoltypell / ffeqtyll (fitsfile *fptr, int colnum, > int *typecode, LONGLONG *repeat, LONGLONG *width, int *status) \end{verbatim} \begin{description} \item[4 ] Return the display width of a column. This is the length of the string that will be returned by the fits\_read\_col routine when reading the column as a formatted string. The display width is determined by the TDISPn keyword, if present, otherwise by the data type of the column. \label{ffgcdw} \end{description} \begin{verbatim} int fits_get_col_display_width / ffgcdw (fitsfile *fptr, int colnum, > int *dispwidth, int *status) \end{verbatim} \begin{description} \item[5 ] Return the number of and size of the dimensions of a table column in a binary table. Normally this information is given by the TDIMn keyword, but if this keyword is not present then this routine returns naxis = 1 and naxes[0] equal to the repeat count in the TFORM keyword. \label{ffgtdm} \end{description} \begin{verbatim} int fits_read_tdim / ffgtdm (fitsfile *fptr, int colnum, int maxdim, > int *naxis, long *naxes, int *status) int fits_read_tdimll / ffgtdmll (fitsfile *fptr, int colnum, int maxdim, > int *naxis, LONGLONG *naxes, int *status) \end{verbatim} \begin{description} \item[6 ] Decode the input TDIMn keyword string (e.g. '(100,200)') and return the number of and size of the dimensions of a binary table column. If the input tdimstr character string is null, then this routine returns naxis = 1 and naxes[0] equal to the repeat count in the TFORM keyword. This routine is called by fits\_read\_tdim. \label{ffdtdm} \end{description} \begin{verbatim} int fits_decode_tdim / ffdtdm (fitsfile *fptr, char *tdimstr, int colnum, int maxdim, > int *naxis, long *naxes, int *status) int fits_decode_tdimll / ffdtdmll (fitsfile *fptr, char *tdimstr, int colnum, int maxdim, > int *naxis, LONGLONG *naxes, int *status) \end{verbatim} \begin{description} \item[7 ] Write a TDIMn keyword whose value has the form '(l,m,n...)' where l, m, n... are the dimensions of a multidimensional array column in a binary table. \label{ffptdm} \end{description} \begin{verbatim} int fits_write_tdim / ffptdm (fitsfile *fptr, int colnum, int naxis, long *naxes, > int *status) int fits_write_tdimll / ffptdmll (fitsfile *fptr, int colnum, int naxis, LONGLONG *naxes, > int *status) \end{verbatim} \subsection{Routines to Edit Rows or Columns} \begin{description} \item[1 ] Insert or delete rows in an ASCII or binary table. When inserting rows all the rows following row FROW are shifted down by NROWS rows; if FROW = 0 then the blank rows are inserted at the beginning of the table. Note that it is *not* necessary to insert rows in a table before writing data to those rows (indeed, it would be inefficient to do so). Instead one may simply write data to any row of the table, whether that row of data already exists or not. The first delete routine deletes NROWS consecutive rows starting with row FIRSTROW. The second delete routine takes an input string that lists the rows or row ranges (e.g., '5-10,12,20-30'), whereas the third delete routine takes an input integer array that specifies each individual row to be deleted. In both latter cases, the input list of rows to delete must be sorted in ascending order. These routines update the NAXIS2 keyword to reflect the new number of rows in the table. \label{ffirow} \label{ffdrow} \label{ffdrws} \label{ffdrrg} \end{description} \begin{verbatim} int fits_insert_rows / ffirow (fitsfile *fptr, LONGLONG firstrow, LONGLONG nrows, > int *status) int fits_delete_rows / ffdrow (fitsfile *fptr, LONGLONG firstrow, LONGLONG nrows, > int *status) int fits_delete_rowrange / ffdrrg (fitsfile *fptr, char *rangelist, > int *status) int fits_delete_rowlist / ffdrws (fitsfile *fptr, long *rowlist, long nrows, > int *status) int fits_delete_rowlistll / ffdrwsll (fitsfile *fptr, LONGLONG *rowlist, LONGLONG nrows, > int *status) \end{verbatim} \begin{description} \item[2 ] Insert or delete column(s) in an ASCII or binary table. When inserting, COLNUM specifies the column number that the (first) new column should occupy in the table. NCOLS specifies how many columns are to be inserted. Any existing columns from this position and higher are shifted over to allow room for the new column(s). The index number on all the following keywords will be incremented or decremented if necessary to reflect the new position of the column(s) in the table: TBCOLn, TFORMn, TTYPEn, TUNITn, TNULLn, TSCALn, TZEROn, TDISPn, TDIMn, TLMINn, TLMAXn, TDMINn, TDMAXn, TCTYPn, TCRPXn, TCRVLn, TCDLTn, TCROTn, and TCUNIn. \label{fficol} \label{fficls} \label{ffdcol} \end{description} \begin{verbatim} int fits_insert_col / fficol (fitsfile *fptr, int colnum, char *ttype, char *tform, > int *status) int fits_insert_cols / fficls (fitsfile *fptr, int colnum, int ncols, char **ttype, char **tform, > int *status) int fits_delete_col / ffdcol(fitsfile *fptr, int colnum, > int *status) \end{verbatim} \begin{description} \item[3 ] Copy column(s) between HDUs. If create\_col = TRUE, then new column(s) will be inserted in the output table, starting at position `outcolumn', otherwise the existing output column(s) will be overwritten (in which case they must have a compatible data type). The first form copies a single column incolnum to outcolnum. Copying within the same HDU is permitted. The second form copies ncols columns from the input, starting at column incolnum to the output, starting at outcolnum. For the second form, the input and output must be different HDUs. If outcolnum is greater than the number of column in the output table, then the new column(s) will be appended to the end of the table. Note that the first column in a table is at colnum = 1. The standard indexed keywords that related to the columns (e.g., TDISPn, TUNITn, TCRPXn, TCDLTn, etc.) will also be copied. \label{ffcpcl} \label{ffccls} \end{description} \begin{verbatim} int fits_copy_col / ffcpcl (fitsfile *infptr, fitsfile *outfptr, int incolnum, int outcolnum, int create_col, > int *status); int fits_copy_cols / ffccls (fitsfile *infptr, fitsfile *outfptr, int incolnum, int outcolnum, int ncols, int create_col, > int *status); \end{verbatim} \begin{description} \item[4 ] Copy 'nrows' consecutive rows from one table to another, beginning with row 'firstrow'. These rows will be appended to any existing rows in the output table. Note that the first row in a table is at row = 1. \label{ffcprw} \end{description} \begin{verbatim} int fits_copy_rows / ffcprw (fitsfile *infptr, fitsfile *outfptr, LONGLONG firstrow, LONGLONG nrows, > int *status); \end{verbatim} \begin{description} \item[5 ] Modify the vector length of a binary table column (e.g., change a column from TFORMn = '1E' to '20E'). The vector length may be increased or decreased from the current value. \label{ffmvec} \end{description} \begin{verbatim} int fits_modify_vector_len / ffmvec (fitsfile *fptr, int colnum, LONGLONG newveclen, > int *status) \end{verbatim} \subsection{Read and Write Column Data Routines} The following routines write or read data values in the current ASCII or binary table extension. If a write operation extends beyond the current size of the table, then the number of rows in the table will automatically be increased and the NAXIS2 keyword value will be updated. Attempts to read beyond the end of the table will result in an error. Automatic data type conversion is performed for numerical data types (only) if the data type of the column (defined by the TFORMn keyword) differs from the data type of the array in the calling routine. ASCII and binary tables support the following data type values: TSTRING, TBYTE, TSBYTE, TSHORT, TUSHORT, TINT, TUINT, TLONG, TLONGLONG, TULONG, TULONGLONG, TFLOAT, or TDOUBLE. Binary tables also support TLOGICAL (internally mapped to the `char' data type), TCOMPLEX, and TDBLCOMPLEX. Note that it is *not* necessary to insert rows in a table before writing data to those rows (indeed, it would be inefficient to do so). Instead, one may simply write data to any row of the table, whether that row of data already exists or not. Individual bits in a binary table 'X' or 'B' column may be read/written to/from a *char array by specifying the TBIT datatype. The *char array will be interpreted as an array of logical TRUE (1) or FALSE (0) values that correspond to the value of each bit in the FITS 'X' or 'B' column. Alternatively, the values in a binary table 'X' column may be read/written 8 bits at a time to/from an array of 8-bit integers by specifying the TBYTE datatype. Note that within the context of these routines, the TSTRING data type corresponds to a C 'char**' data type, i.e., a pointer to an array of pointers to an array of characters. This is different from the keyword reading and writing routines where TSTRING corresponds to a C 'char*' data type, i.e., a single pointer to an array of characters. When reading strings from a table, the char arrays obviously must have been allocated long enough to hold the whole FITS table string. Numerical data values are automatically scaled by the TSCALn and TZEROn keyword values (if they exist). In the case of binary tables with vector elements, the 'felem' parameter defines the starting element (beginning with 1, not 0) within the cell (a cell is defined as the intersection of a row and a column and may contain a single value or a vector of values). The felem parameter is ignored when dealing with ASCII tables. Similarly, in the case of binary tables the 'nelements' parameter specifies the total number of vector values to be read or written (continuing on subsequent rows if required) and not the number of table cells. \begin{description} \item[1 ] Write elements into an ASCII or binary table column. \end{description} The first routine simply writes the array of values to the FITS file (doing data type conversion if necessary) whereas the second routine will substitute the appropriate FITS null value for all elements which are equal to the input value of nulval (note that this parameter gives the address of nulval, not the null value itself). For integer columns the FITS null value is defined by the TNULLn keyword (an error is returned if the keyword doesn't exist). For floating point columns the special IEEE NaN (Not-a-Number) value will be written into the FITS file. If a null pointer is entered for nulval, then the null value is ignored and this routine behaves the same as the first routine. The third routine simply writes undefined pixel values to the column. The fourth routine fills every column in the table with null values, in the specified rows (ignoring any columns that do not have a defined null value). \label{ffpcl} \label{ffpcn} \label{ffpclu} \begin{verbatim} int fits_write_col / ffpcl (fitsfile *fptr, int datatype, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, DTYPE *array, > int *status) int fits_write_colnull / ffpcn (fitsfile *fptr, int datatype, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, DTYPE *array, DTYPE *nulval, > int *status) int fits_write_col_null / ffpclu (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, > int *status) int fits_write_nullrows / ffprwu (fitsfile *fptr, LONGLONG firstrow, LONGLONG nelements, > int *status) \end{verbatim} \begin{description} \item[2 ] Read elements from an ASCII or binary table column. The data type parameter specifies the data type of the `nulval' and `array' pointers; Undefined array elements will be returned with a value = *nullval, (note that this parameter gives the address of the null value, not the null value itself) unless nulval = 0 or *nulval = 0, in which case no checking for undefined pixels will be performed. The second routine is similar except that any undefined pixels will have the corresponding nullarray element set equal to TRUE (= 1). Any column, regardless of it's intrinsic data type, may be read as a string. It should be noted however that reading a numeric column as a string is 10 - 100 times slower than reading the same column as a number due to the large overhead in constructing the formatted strings. The display format of the returned strings will be determined by the TDISPn keyword, if it exists, otherwise by the data type of the column. The length of the returned strings (not including the null terminating character) can be determined with the fits\_get\_col\_display\_width routine. The following TDISPn display formats are currently supported: \begin{verbatim} Iw.m Integer Ow.m Octal integer Zw.m Hexadecimal integer Fw.d Fixed floating point Ew.d Exponential floating point Dw.d Exponential floating point Gw.d General; uses Fw.d if significance not lost, else Ew.d \end{verbatim} where w is the width in characters of the displayed values, m is the minimum number of digits displayed, and d is the number of digits to the right of the decimal. The .m field is optional. \label{ffgcv} \label{ffgcf} \end{description} \begin{verbatim} int fits_read_col / ffgcv (fitsfile *fptr, int datatype, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, DTYPE *nulval, DTYPE *array, int *anynul, int *status) int fits_read_colnull / ffgcf (fitsfile *fptr, int datatype, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, DTYPE *array, char *nullarray, int *anynul, int *status) \end{verbatim} \subsection{Row Selection and Calculator Routines} These routines all parse and evaluate an input string containing a user defined arithmetic expression. The first 3 routines select rows in a FITS table, based on whether the expression evaluates to true (not equal to zero) or false (zero). The other routines evaluate the expression and calculate a value for each row of the table. The allowed expression syntax is described in the row filter section in the `Extended File Name Syntax' chapter of this document. The expression may also be written to a text file, and the name of the file, prepended with a '@' character may be supplied for the 'expr' parameter (e.g. '@filename.txt'). The expression in the file can be arbitrarily complex and extend over multiple lines of the file. Lines that begin with 2 slash characters ('//') will be ignored and may be used to add comments to the file. \begin{description} \item[1 ] Evaluate a boolean expression over the indicated rows, returning an array of flags indicating which rows evaluated to TRUE/FALSE. Upon return, *n\_good\_rows contains the number of rows that evaluate to TRUE. \label{fffrow} \end{description} \begin{verbatim} int fits_find_rows / fffrow (fitsfile *fptr, char *expr, long firstrow, long nrows, > long *n_good_rows, char *row_status, int *status) \end{verbatim} \begin{description} \item[2 ] Find the first row which satisfies the input boolean expression \label{ffffrw} \end{description} \begin{verbatim} int fits_find_first_row / ffffrw (fitsfile *fptr, char *expr, > long *rownum, int *status) \end{verbatim} \begin{description} \item[3 ]Evaluate an expression on all rows of a table. If the input and output files are not the same, copy the TRUE rows to the output file; if the output table is not empty, then this routine will append the new selected rows after the existing rows. If the files are the same, delete the FALSE rows (preserve the TRUE rows). \label{ffsrow} \end{description} \begin{verbatim} int fits_select_rows / ffsrow (fitsfile *infptr, fitsfile *outfptr, char *expr, > int *status ) \end{verbatim} \begin{description} \item[4 ] Calculate an expression for the indicated rows of a table, returning the results, cast as datatype (TSHORT, TDOUBLE, etc), in array. If nulval==NULL, UNDEFs will be zeroed out. For vector results, the number of elements returned may be less than nelements if nelements is not an even multiple of the result dimension. Call fits\_test\_expr to obtain the dimensions of the results. \label{ffcrow} \end{description} \begin{verbatim} int fits_calc_rows / ffcrow (fitsfile *fptr, int datatype, char *expr, long firstrow, long nelements, void *nulval, > void *array, int *anynul, int *status) \end{verbatim} \begin{description} \item[5 ]Evaluate an expression and write the result either to a column (if the expression is a function of other columns in the table) or to a keyword (if the expression evaluates to a constant and is not a function of other columns in the table). In the former case, the parName parameter is the name of the column (which may or may not already exist) into which to write the results, and parInfo contains an optional TFORM keyword value if a new column is being created. If a TFORM value is not specified then a default format will be used, depending on the expression. If the expression evaluates to a constant, then the result will be written to the keyword name given by the parName parameter, and the parInfo parameter may be used to supply an optional comment for the keyword. If the keyword does not already exist, then the name of the keyword must be preceded with a '\#' character, otherwise the result will be written to a column with that name. \label{ffcalc} \end{description} \begin{verbatim} int fits_calculator / ffcalc (fitsfile *infptr, char *expr, fitsfile *outfptr, char *parName, char *parInfo, > int *status) \end{verbatim} \begin{description} \item[6 ] This calculator routine is similar to the previous routine, except that the expression is only evaluated over the specified row ranges. nranges specifies the number of row ranges, and firstrow and lastrow give the starting and ending row number of each range. \label{ffcalcrng} \end{description} \begin{verbatim} int fits_calculator_rng / ffcalc_rng (fitsfile *infptr, char *expr, fitsfile *outfptr, char *parName, char *parInfo, int nranges, long *firstrow, long *lastrow > int *status) \end{verbatim} \begin{description} \item[7 ]Evaluate the given expression and return dimension and type information on the result. The returned dimensions correspond to a single row entry of the requested expression, and are equivalent to the result of fits\_read\_tdim(). Note that strings are considered to be one element regardless of string length. If maxdim == 0, then naxes is optional. \label{fftexp} \end{description} \begin{verbatim} int fits_test_expr / fftexp (fitsfile *fptr, char *expr, int maxdim > int *datatype, long *nelem, int *naxis, long *naxes, int *status) \end{verbatim} \subsection{Column Binning or Histogramming Routines} The following routines may be useful when performing histogramming operations on column(s) of a table to generate an image in a primary array or image extension. \begin{description} \item[1 ] Calculate the histogramming parameters (min, max, and bin size for each axis of the histogram, based on a variety of possible input parameters. If the input names of the columns to be binned are null, then the routine will first look for the CPREF = "NAME1, NAME2, ..." keyword which lists the preferred columns. If not present, then the routine will assume the column names X, Y, Z, and T for up to 4 axes (as specified by the NAXIS parameter). MININ and MAXIN are input arrays that give the minimum and maximum value for the histogram, along each axis. Alternatively, the name of keywords that give the min, max, and binsize may be give with the MINNAME, MAXNAME, and BINNAME array parameters. If the value = DOUBLENULLVALUE and no keyword names are given, then the routine will use the TLMINn and TLMAXn keywords, if present, or the actual min and/or max values in the column. The ``d'' version has double precision floating point outputs as noted in the calling signature. The version without ``d'' has single precision floating point outputs. BINSIZEIN is an array giving the binsize along each axis. If the value = DOUBLENULLVALUE, and a keyword name is not specified with BINNAME, then this routine will first look for the TDBINn keyword, or else will use a binsize = 1, or a binsize that produces 10 histogram bins, which ever is smaller. \label{calcbinning} \end{description} \begin{verbatim} int fits_calc_binning[d] Input parameters: (fitsfile *fptr, /* IO - pointer to table to be binned */ int naxis, /* I - number of axes/columns in the binned image */ char colname[4][FLEN_VALUE], /* I - optional column names */ double *minin, /* I - optional lower bound value for each axis */ double *maxin, /* I - optional upper bound value, for each axis */ double *binsizein, /* I - optional bin size along each axis */ char minname[4][FLEN_VALUE], /* I - optional keywords for min */ char maxname[4][FLEN_VALUE], /* I - optional keywords for max */ char binname[4][FLEN_VALUE], /* I - optional keywords for binsize */ Output parameters: int *colnum, /* O - column numbers, to be binned */ long *naxes, /* O - number of bins in each histogram axis */ float[double] *amin, /* O - lower bound of the histogram axes */ float[double] *amax, /* O - upper bound of the histogram axes */ float[double] *binsize, /* O - width of histogram bins/pixels on each axis */ int *status) \end{verbatim} \begin{description} \item[2 ] Copy the relevant keywords from the header of the table that is being binned, to the the header of the output histogram image. This will not copy the table structure keywords (e.g., NAXIS, TFORMn, TTYPEn, etc.) nor will it copy the keywords that apply to other columns of the table that are not used to create the histogram. This routine will translate the names of the World Coordinate System (WCS) keywords for the binned columns into the form that is need for a FITS image (e.g., the TCTYPn table keyword will be translated to the CTYPEn image keyword). \label{copypixlist2image} \end{description} \begin{verbatim} int fits_copy_pixlist2image (fitsfile *infptr, /* I - pointer to input HDU */ fitsfile *outfptr, /* I - pointer to output HDU */ int firstkey, /* I - first HDU keyword to start with */ int naxis, /* I - number of axes in the image */ int *colnum, /* I - numbers of the columns to be binned */ int *status) /* IO - error status */ \end{verbatim} \begin{description} \item[3 ] Write a set of default WCS keywords to the histogram header, IF the WCS keywords do not already exist. This will create a linear WCS where the coordinate types are equal to the original column names. \label{writekeyshisto} \end{description} \begin{verbatim} int fits_write_keys_histo (fitsfile *fptr, /* I - pointer to table to be binned */ fitsfile *histptr, /* I - pointer to output histogram image HDU */ int naxis, /* I - number of axes in the histogram image */ int *colnum, /* I - column numbers of the binned columns */ int *status) \end{verbatim} \begin{description} \item[4 ] Update the WCS keywords in a histogram image header that give the location of the reference pixel (CRPIXn), and the pixel size (CDELTn), in the binned image. The ``d'' version has double precision floating point inputs as noted in the calling signature. The version without ``d'' has single precision floating point inputs. \label{rebinwcs} \end{description} \begin{verbatim} int fits_rebin_wcs[d] (fitsfile *fptr, /* I - pointer to table to be binned */ int naxis, /* I - number of axes in the histogram image */ float[double] *amin, /* I - first pixel include in each axis */ float[double] *binsize, /* I - binning factor for each axis */ int *status) \end{verbatim} \begin{description} \item[5 ] Bin the values in the input table columns, and write the histogram array to the output FITS image (histptr). The ``d'' version has double precision floating point inputs as noted in the calling signature. The version without ``d'' has single precision floating point inputs. \label{makehist} \end{description} \begin{verbatim} int fits_make_hist[d] (fitsfile *fptr, /* I - pointer to table with X and Y cols; */ fitsfile *histptr, /* I - pointer to output FITS image */ int bitpix, /* I - datatype for image: 16, 32, -32, etc */ int naxis, /* I - number of axes in the histogram image */ long *naxes, /* I - size of axes in the histogram image */ int *colnum, /* I - column numbers (array length = naxis) */ float[double] *amin, /* I - minimum histogram value, for each axis */ float[double] *amax, /* I - maximum histogram value, for each axis */ float[double] *binsize, /* I - bin size along each axis */ float[double] weight, /* I - binning weighting factor (FLOATNULLVALUE */ /* for no weighting) */ int wtcolnum, /* I - keyword or col for weight (or NULL) */ int recip, /* I - use reciprocal of the weight? 0 or 1 */ char *selectrow, /* I - optional array (length = no. of */ /* rows in the table). If the element is true */ /* then the corresponding row of the table will */ /* be included in the histogram, otherwise the */ /* row will be skipped. Ingnored if *selectrow */ /* is equal to NULL. */ int *status) \end{verbatim} \section{Utility Routines} \subsection{File Checksum Routines} The following routines either compute or validate the checksums for the CHDU. The DATASUM keyword is used to store the numerical value of the 32-bit, 1's complement checksum for the data unit alone. If there is no data unit then the value is set to zero. The numerical value is stored as an ASCII string of digits, enclosed in quotes, because the value may be too large to represent as a 32-bit signed integer. The CHECKSUM keyword is used to store the ASCII encoded COMPLEMENT of the checksum for the entire HDU. Storing the complement, rather than the actual checksum, forces the checksum for the whole HDU to equal zero. If the file has been modified since the checksums were computed, then the HDU checksum will usually not equal zero. These checksum keyword conventions are based on a paper by Rob Seaman published in the proceedings of the ADASS IV conference in Baltimore in November 1994 and a later revision in June 1995. See Appendix B for the definition of the parameters used in these routines. \begin{description} \item[1 ] Compute and write the DATASUM and CHECKSUM keyword values for the CHDU into the current header. If the keywords already exist, their values will be updated only if necessary (i.e., if the file has been modified since the original keyword values were computed). \label{ffpcks} \end{description} \begin{verbatim} int fits_write_chksum / ffpcks (fitsfile *fptr, > int *status) \end{verbatim} \begin{description} \item[2 ] Update the CHECKSUM keyword value in the CHDU, assuming that the DATASUM keyword exists and already has the correct value. This routine calculates the new checksum for the current header unit, adds it to the data unit checksum, encodes the value into an ASCII string, and writes the string to the CHECKSUM keyword. \label{ffupck} \end{description} \begin{verbatim} int fits_update_chksum / ffupck (fitsfile *fptr, > int *status) \end{verbatim} \begin{description} \item[3 ] Verify the CHDU by computing the checksums and comparing them with the keywords. The data unit is verified correctly if the computed checksum equals the value of the DATASUM keyword. The checksum for the entire HDU (header plus data unit) is correct if it equals zero. The output DATAOK and HDUOK parameters in this routine are integers which will have a value = 1 if the data or HDU is verified correctly, a value = 0 if the DATASUM or CHECKSUM keyword is not present, or value = -1 if the computed checksum is not correct. \label{ffvcks} \end{description} \begin{verbatim} int fits_verify_chksum / ffvcks (fitsfile *fptr, > int *dataok, int *hduok, int *status) \end{verbatim} \begin{description} \item[4 ] Compute and return the checksum values for the CHDU without creating or modifying the CHECKSUM and DATASUM keywords. This routine is used internally by ffvcks, but may be useful in other situations as well. \label{ffgcks} \end{description} \begin{verbatim} int fits_get_chksum/ /ffgcks (fitsfile *fptr, > unsigned long *datasum, unsigned long *hdusum, int *status) \end{verbatim} \begin{description} \item[5 ] Encode a checksum value into a 16-character string. If complm is non-zero (true) then the 32-bit sum value will be complemented before encoding. \label{ffesum} \end{description} \begin{verbatim} int fits_encode_chksum / ffesum (unsigned long sum, int complm, > char *ascii); \end{verbatim} \begin{description} \item[6 ] Decode a 16-character checksum string into a unsigned long value. If is non-zero (true). then the 32-bit sum value will be complemented after decoding. The checksum value is also returned as the value of the function. \label{ffdsum} \end{description} \begin{verbatim} unsigned long fits_decode_chksum / ffdsum (char *ascii, int complm, > unsigned long *sum); \end{verbatim} \subsection{Date and Time Utility Routines} The following routines help to construct or parse the FITS date/time strings. Starting in the year 2000, the FITS DATE keyword values (and the values of other `DATE-' keywords) must have the form 'YYYY-MM-DD' (date only) or 'YYYY-MM-DDThh:mm:ss.ddd...' (date and time) where the number of decimal places in the seconds value is optional. These times are in UTC. The older 'dd/mm/yy' date format may not be used for dates after 01 January 2000. See Appendix B for the definition of the parameters used in these routines. \begin{description} \item[1 ] Get the current system date. C already provides standard library routines for getting the current date and time, but this routine is provided for compatibility with the Fortran FITSIO library. The returned year has 4 digits (1999, 2000, etc.) \label{ffgsdt} \end{description} \begin{verbatim} int fits_get_system_date/ffgsdt ( > int *day, int *month, int *year, int *status ) \end{verbatim} \begin{description} \item[2 ] Get the current system date and time string ('YYYY-MM-DDThh:mm:ss'). The time will be in UTC/GMT if available, as indicated by a returned timeref value = 0. If the returned value of timeref = 1 then this indicates that it was not possible to convert the local time to UTC, and thus the local time was returned. \end{description} \begin{verbatim} int fits_get_system_time/ffgstm (> char *datestr, int *timeref, int *status) \end{verbatim} \begin{description} \item[3 ] Construct a date string from the input date values. If the year is between 1900 and 1998, inclusive, then the returned date string will have the old FITS format ('dd/mm/yy'), otherwise the date string will have the new FITS format ('YYYY-MM-DD'). Use fits\_time2str instead to always return a date string using the new FITS format. \label{ffdt2s} \end{description} \begin{verbatim} int fits_date2str/ffdt2s (int year, int month, int day, > char *datestr, int *status) \end{verbatim} \begin{description} \item[4 ] Construct a new-format date + time string ('YYYY-MM-DDThh:mm:ss.ddd...'). If the year, month, and day values all = 0 then only the time is encoded with format 'hh:mm:ss.ddd...'. The decimals parameter specifies how many decimal places of fractional seconds to include in the string. If `decimals' is negative, then only the date will be return ('YYYY-MM-DD'). \end{description} \begin{verbatim} int fits_time2str/fftm2s (int year, int month, int day, int hour, int minute, double second, int decimals, > char *datestr, int *status) \end{verbatim} \begin{description} \item[5 ] Return the date as read from the input string, where the string may be in either the old ('dd/mm/yy') or new ('YYYY-MM-DDThh:mm:ss' or 'YYYY-MM-DD') FITS format. Null pointers may be supplied for any unwanted output date parameters. \end{description} \begin{verbatim} int fits_str2date/ffs2dt (char *datestr, > int *year, int *month, int *day, int *status) \end{verbatim} \begin{description} \item[6 ] Return the date and time as read from the input string, where the string may be in either the old or new FITS format. The returned hours, minutes, and seconds values will be set to zero if the input string does not include the time ('dd/mm/yy' or 'YYYY-MM-DD') . Similarly, the returned year, month, and date values will be set to zero if the date is not included in the input string ('hh:mm:ss.ddd...'). Null pointers may be supplied for any unwanted output date and time parameters. \end{description} \begin{verbatim} int fits_str2time/ffs2tm (char *datestr, > int *year, int *month, int *day, int *hour, int *minute, double *second, int *status) \end{verbatim} \subsection{General Utility Routines} The following utility routines may be useful for certain applications. \begin{description} \item[1 ] Return the revision number of the CFITSIO library. The revision number will be incremented with each new release of CFITSIO. \label{ffvers} \end{description} \begin{verbatim} float fits_get_version / ffvers ( > float *version) \end{verbatim} \begin{description} \item[2 ] Write an 80-character message to the CFITSIO error stack. Application programs should not normally write to the stack, but there may be some situations where this is desirable. \label{ffpmsg} \end{description} \begin{verbatim} void fits_write_errmsg / ffpmsg (char *err_msg) \end{verbatim} \begin{description} \item[3 ] Convert a character string to uppercase (operates in place). \label{ffupch} \end{description} \begin{verbatim} void fits_uppercase / ffupch (char *string) \end{verbatim} \begin{description} \item[4 ] Compare the input template string against the reference string to see if they match. The template string may contain wildcard characters: '*' will match any sequence of characters (including zero characters) and '?' will match any single character in the reference string. The '\#' character will match any consecutive string of decimal digits (0 - 9). If casesen = CASESEN = TRUE then the match will be case sensitive, otherwise the case of the letters will be ignored if casesen = CASEINSEN = FALSE. The returned MATCH parameter will be TRUE if the 2 strings match, and EXACT will be TRUE if the match is exact (i.e., if no wildcard characters were used in the match). Both strings must be 68 characters or less in length. \label{ffcmps} \end{description} \begin{verbatim} void fits_compare_str / ffcmps (char *templt, char *string, int casesen, > int *match, int *exact) \end{verbatim} \begin{description} \item[5 ]Split a string containing a list of names (typically file names or column names) into individual name tokens by a sequence of calls to fits\_split\_names. The names in the list must be delimited by a comma and/or spaces. This routine ignores spaces and commas that occur within parentheses, brackets, or curly brackets. It also strips any leading and trailing blanks from the returned name. This routine is similar to the ANSI C 'strtok' function: The first call to fits\_split\_names has a non-null input string. It finds the first name in the string and terminates it by overwriting the next character of the string with a null terminator and returns a pointer to the name. Each subsequent call, indicated by a NULL value of the input string, returns the next name, searching from just past the end of the previous name. It returns NULL when no further names are found. \label{splitnames} \end{description} \begin{verbatim} char *fits_split_names(char *namelist) \end{verbatim} The following example shows how a string would be split into 3 names: \begin{verbatim} myfile[1][bin (x,y)=4], file2.fits file3.fits ^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^ ^^^^^^^^^^ 1st name 2nd name 3rd name \end{verbatim} \begin{description} \item[6 ] Test that the keyword name contains only legal characters (A-Z,0-9, hyphen, and underscore) or that the keyword record contains only legal printable ASCII characters \label{fftkey} \label{fftrec} \end{description} \begin{verbatim} int fits_test_keyword / fftkey (char *keyname, > int *status) int fits_test_record / fftrec (char *card, > int *status) \end{verbatim} \begin{description} \item[7 ] Test whether the current header contains any NULL (ASCII 0) characters. These characters are illegal in the header, but they will go undetected by most of the CFITSIO keyword header routines, because the null is interpreted as the normal end-of-string terminator. This routine returns the position of the first null character in the header, or zero if there are no nulls. For example a returned value of 110 would indicate that the first NULL is located in the 30th character of the second keyword in the header (recall that each header record is 80 characters long). Note that this is one of the few CFITSIO routines in which the returned value is not necessarily equal to the status value). \label{ffnchk} \end{description} \begin{verbatim} int fits_null_check / ffnchk (char *card, > int *status) \end{verbatim} \begin{description} \item[8 ] Parse a header keyword record and return the name of the keyword, and the length of the name. The keyword name normally occupies the first 8 characters of the record, except under the HIERARCH convention where the name can be up to 70 characters in length. \label{ffgknm} \end{description} \begin{verbatim} int fits_get_keyname / ffgknm (char *card, > char *keyname, int *keylength, int *status) \end{verbatim} \begin{description} \item[9 ] Parse a header keyword record, returning the value (as a literal character string) and comment strings. If the keyword has no value (columns 9-10 not equal to '= '), then a null value string is returned and the comment string is set equal to column 9 - 80 of the input string. \label{ffpsvc} \end{description} \begin{verbatim} int fits_parse_value / ffpsvc (char *card, > char *value, char *comment, int *status) \end{verbatim} \begin{description} \item[10] Construct a properly formated 80-character header keyword record from the input keyword name, keyword value, and keyword comment strings. Hierarchical keyword names (e.g., "ESO TELE CAM") are supported. The value string may contain an integer, floating point, logical, or quoted character string (e.g., "12", "15.7", "T", or "'NGC 1313'"). \label{ffmkky} \end{description} \begin{verbatim} int fits_make_key / ffmkky (const char *keyname, const char *value, const char *comment, > char *card, int *status) \end{verbatim} \begin{description} \item[11] Construct an array indexed keyword name (ROOT + nnn). This routine appends the sequence number to the root string to create a keyword name (e.g., 'NAXIS' + 2 = 'NAXIS2') \label{ffkeyn} \end{description} \begin{verbatim} int fits_make_keyn / ffkeyn (char *keyroot, int value, > char *keyname, int *status) \end{verbatim} \begin{description} \item[12] Construct a sequence keyword name (n + ROOT). This routine concatenates the sequence number to the front of the root string to create a keyword name (e.g., 1 + 'CTYP' = '1CTYP') \label{ffnkey} \end{description} \begin{verbatim} int fits_make_nkey / ffnkey (int value, char *keyroot, > char *keyname, int *status) \end{verbatim} \begin{description} \item[13] Determine the data type of a keyword value string. This routine parses the keyword value string to determine its data type. Returns 'C', 'L', 'I', 'F' or 'X', for character string, logical, integer, floating point, or complex, respectively. \label{ffdtyp} \end{description} \begin{verbatim} int fits_get_keytype / ffdtyp (char *value, > char *dtype, int *status) \end{verbatim} \begin{description} \item[14] Determine the integer data type of an integer keyword value string. The returned datatype value is the minimum integer datatype (starting from top of the following list and working down) required to store the integer value: \end{description} \begin{verbatim} Data Type Range TSBYTE: -128 to 127 TBYTE: 128 to 255 TSHORT: -32768 to 32767 TUSHORT: 32768 to 65535 TINT -2147483648 to 2147483647 TUINT 2147483648 to 4294967295 TLONGLONG -9223372036854775808 to 9223372036854775807 \end{verbatim} \begin{description} \item[ ] The *neg parameter returns 1 if the input value is negative and returns 0 if it is non-negative.\label{ffinttyp} \end{description} \begin{verbatim} int fits_get_inttype / ffinttyp (char *value, > int *datatype, int *neg, int *status) \end{verbatim} \begin{description} \item[15] Return the class of an input header record. The record is classified into one of the following categories (the class values are defined in fitsio.h). Note that this is one of the few CFITSIO routines that does not return a status value. \label{ffgkcl} \end{description} \begin{verbatim} Class Value Keywords TYP_STRUC_KEY 10 SIMPLE, BITPIX, NAXIS, NAXISn, EXTEND, BLOCKED, GROUPS, PCOUNT, GCOUNT, END XTENSION, TFIELDS, TTYPEn, TBCOLn, TFORMn, THEAP, and the first 4 COMMENT keywords in the primary array that define the FITS format. TYP_CMPRS_KEY 20 The keywords used in the compressed image or table format, including ZIMAGE, ZCMPTYPE, ZNAMEn, ZVALn, ZTILEn, ZBITPIX, ZNAXISn, ZSCALE, ZZERO, ZBLANK TYP_SCAL_KEY 30 BSCALE, BZERO, TSCALn, TZEROn TYP_NULL_KEY 40 BLANK, TNULLn TYP_DIM_KEY 50 TDIMn TYP_RANG_KEY 60 TLMINn, TLMAXn, TDMINn, TDMAXn, DATAMIN, DATAMAX TYP_UNIT_KEY 70 BUNIT, TUNITn TYP_DISP_KEY 80 TDISPn TYP_HDUID_KEY 90 EXTNAME, EXTVER, EXTLEVEL, HDUNAME, HDUVER, HDULEVEL TYP_CKSUM_KEY 100 CHECKSUM, DATASUM TYP_WCS_KEY 110 WCS keywords defined in the the WCS papers, including: CTYPEn, CUNITn, CRVALn, CRPIXn, CROTAn, CDELTn CDj_is, PVj_ms, LONPOLEs, LATPOLEs TCTYPn, TCTYns, TCUNIn, TCUNns, TCRVLn, TCRVns, TCRPXn, TCRPks, TCDn_k, TCn_ks, TPVn_m, TPn_ms, TCDLTn, TCROTn jCTYPn, jCTYns, jCUNIn, jCUNns, jCRVLn, jCRVns, iCRPXn, iCRPns, jiCDn, jiCDns, jPVn_m, jPn_ms, jCDLTn, jCROTn (i,j,m,n are integers, s is any letter) TYP_REFSYS_KEY 120 EQUINOXs, EPOCH, MJD-OBSs, RADECSYS, RADESYSs, DATE-OBS TYP_COMM_KEY 130 COMMENT, HISTORY, (blank keyword) TYP_CONT_KEY 140 CONTINUE TYP_USER_KEY 150 all other keywords int fits_get_keyclass / ffgkcl (char *card) \end{verbatim} \begin{description} \item[16] Parse the 'TFORM' binary table column format string. This routine parses the input TFORM character string and returns the integer data type code, the repeat count of the field, and, in the case of character string fields, the length of the unit string. See Appendix B for the allowed values for the returned typecode parameter. A null pointer may be given for any output parameters that are not needed. \label{ffbnfm} \end{description} \begin{verbatim} int fits_binary_tform / ffbnfm (char *tform, > int *typecode, long *repeat, long *width, int *status) int fits_binary_tformll / ffbnfmll (char *tform, > int *typecode, LONGLONG *repeat, long *width, int *status) \end{verbatim} \begin{description} \item[17] Parse the 'TFORM' keyword value that defines the column format in an ASCII table. This routine parses the input TFORM character string and returns the data type code, the width of the column, and (if it is a floating point column) the number of decimal places to the right of the decimal point. The returned data type codes are the same as for the binary table, with the following additional rules: integer columns that are between 1 and 4 characters wide are defined to be short integers (code = TSHORT). Wider integer columns are defined to be regular integers (code = TLONG). Similarly, Fixed decimal point columns (with TFORM = 'Fw.d') are defined to be single precision reals (code = TFLOAT) if w is between 1 and 7 characters wide, inclusive. Wider 'F' columns will return a double precision data code (= TDOUBLE). 'Ew.d' format columns will have datacode = TFLOAT, and 'Dw.d' format columns will have datacode = TDOUBLE. A null pointer may be given for any output parameters that are not needed. \label{ffasfm} \end{description} \begin{verbatim} int fits_ascii_tform / ffasfm (char *tform, > int *typecode, long *width, int *decimals, int *status) \end{verbatim} \begin{description} \item[18] Calculate the starting column positions and total ASCII table width based on the input array of ASCII table TFORM values. The SPACE input parameter defines how many blank spaces to leave between each column (it is recommended to have one space between columns for better human readability). \label{ffgabc} \end{description} \begin{verbatim} int fits_get_tbcol / ffgabc (int tfields, char **tform, int space, > long *rowlen, long *tbcol, int *status) \end{verbatim} \begin{description} \item[19] Parse a template header record and return a formatted 80-character string suitable for appending to (or deleting from) a FITS header file. This routine is useful for parsing lines from an ASCII template file and reformatting them into legal FITS header records. The formatted string may then be passed to the fits\_write\_record, ffmcrd, or fits\_delete\_key routines to append or modify a FITS header record. \label{ffgthd} \end{description} \begin{verbatim} int fits_parse_template / ffgthd (char *templt, > char *card, int *keytype, int *status) \end{verbatim} The input templt character string generally should contain 3 tokens: (1) the KEYNAME, (2) the VALUE, and (3) the COMMENT string. The TEMPLATE string must adhere to the following format: \begin{description} \item[- ] The KEYNAME token must begin in columns 1-8 and be a maximum of 8 characters long. A legal FITS keyword name may only contain the characters A-Z, 0-9, and '-' (minus sign) and underscore. This routine will automatically convert any lowercase characters to uppercase in the output string. If the first 8 characters of the template line are blank then the remainder of the line is considered to be a FITS comment (with a blank keyword name). \end{description} \begin{description} \item[- ] The VALUE token must be separated from the KEYNAME token by one or more spaces and/or an '=' character. The data type of the VALUE token (numeric, logical, or character string) is automatically determined and the output CARD string is formatted accordingly. The value token may be forced to be interpreted as a string (e.g. if it is a string of numeric digits) by enclosing it in single quotes. If the value token is a character string that contains 1 or more embedded blank space characters or slash ('/') characters then the entire character string must be enclosed in single quotes. \end{description} \begin{description} \item[- ] The COMMENT token is optional, but if present must be separated from the VALUE token by a blank space or a '/' character. \end{description} \begin{description} \item[- ] One exception to the above rules is that if the first non-blank character in the first 8 characters of the template string is a minus sign ('-') followed by a single token, or a single token followed by an equal sign, then it is interpreted as the name of a keyword which is to be deleted from the FITS header. \end{description} \begin{description} \item[- ] The second exception is that if the template string starts with a minus sign and is followed by 2 tokens (without an equals sign between them) then the second token is interpreted as the new name for the keyword specified by first token. In this case the old keyword name (first token) is returned in characters 1-8 of the returned CARD string, and the new keyword name (the second token) is returned in characters 41-48 of the returned CARD string. These old and new names may then be passed to the ffmnam routine which will change the keyword name. \end{description} The keytype output parameter indicates how the returned CARD string should be interpreted: \begin{verbatim} keytype interpretation ------- ------------------------------------------------- -2 Rename the keyword with name = the first 8 characters of CARD to the new name given in characters 41 - 48 of CARD. -1 delete the keyword with this name from the FITS header. 0 append the CARD string to the FITS header if the keyword does not already exist, otherwise update the keyword value and/or comment field if is already exists. 1 This is a HISTORY or COMMENT keyword; append it to the header 2 END record; do not explicitly write it to the FITS file. \end{verbatim} EXAMPLES: The following lines illustrate valid input template strings: \begin{verbatim} INTVAL 7 / This is an integer keyword RVAL 34.6 / This is a floating point keyword EVAL=-12.45E-03 / This is a floating point keyword in exponential notation lval F / This is a boolean keyword This is a comment keyword with a blank keyword name SVAL1 = 'Hello world' / this is a string keyword SVAL2 '123.5' this is also a string keyword sval3 123+ / this is also a string keyword with the value '123+ ' # the following template line deletes the DATE keyword - DATE # the following template line modifies the NAME keyword to OBJECT - NAME OBJECT \end{verbatim} \begin{description} \item[20] Translate a keyword name into a new name, based on a set of patterns. This routine is useful for translating keywords in cases such as adding or deleting columns in a table, or copying a column from one table to another, or extracting an array from a cell in a binary table column into an image extension. In these cases, it is necessary to translate the names of the keywords associated with the original table column(s) into the appropriate keyword name in the final file. For example, if column 2 is deleted from a table, then the value of 'n' in all the TFORMn and TTYPEn keywords for columns 3 and higher must be decremented by 1. Even more complex translations are sometimes needed to convert the WCS keywords when extracting an image out of a table column cell into a separate image extension. The user passes an array of patterns to be matched. Input pattern number i is pattern[i][0], and output pattern number i is pattern[i][1]. Keywords are matched against the input patterns. If a match is found then the keyword is re-written according to the output pattern. Order is important. The first match is accepted. The fastest match will be made when templates with the same first character are grouped together. Several characters have special meanings: \begin{verbatim} i,j - single digits, preserved in output template n - column number of one or more digits, preserved in output template m - generic number of one or more digits, preserved in output template a - coordinate designator, preserved in output template # - number of one or more digits ? - any character * - only allowed in first character position, to match all keywords; only useful as last pattern in the list \end{verbatim} i, j, n, and m are returned by the routine. For example, the input pattern "iCTYPn" will match "1CTYP5" (if n\_value is 5); the output pattern "CTYPEi" will be re-written as "CTYPE1". Notice that "i" is preserved. The following output patterns are special: "-" - do not copy a keyword that matches the corresponding input pattern "+" - copy the input unchanged The inrec string could be just the 8-char keyword name, or the entire 80-char header record. Characters 9 - 80 in the input string simply get appended to the translated keyword name. If n\_range = 0, then only keywords with 'n' equal to n\_value will be considered as a pattern match. If n\_range = +1, then all values of 'n' greater than or equal to n\_value will be a match, and if -1, then values of 'n' less than or equal to n\_value will match.\label{translatekey} \end{description} \begin{verbatim} int fits_translate_keyword( char *inrec, /* I - input string */ char *outrec, /* O - output converted string, or */ /* a null string if input does not */ /* match any of the patterns */ char *patterns[][2],/* I - pointer to input / output string */ /* templates */ int npat, /* I - number of templates passed */ int n_value, /* I - base 'n' template value of interest */ int n_offset, /* I - offset to be applied to the 'n' */ /* value in the output string */ int n_range, /* I - controls range of 'n' template */ /* values of interest (-1,0, or +1) */ int *pat_num, /* O - matched pattern number (0 based) or -1 */ int *i, /* O - value of i, if any, else 0 */ int *j, /* O - value of j, if any, else 0 */ int *m, /* O - value of m, if any, else 0 */ int *n, /* O - value of n, if any, else 0 */ int *status) /* IO - error status */ \end{verbatim} \begin{description} \item[ ] Here is an example of some of the patterns used to convert the keywords associated with an image in a cell of a table column into the keywords appropriate for an IMAGE extension: \end{description} \begin{verbatim} char *patterns[][2] = {{"TSCALn", "BSCALE" }, /* Standard FITS keywords */ {"TZEROn", "BZERO" }, {"TUNITn", "BUNIT" }, {"TNULLn", "BLANK" }, {"TDMINn", "DATAMIN" }, {"TDMAXn", "DATAMAX" }, {"iCTYPn", "CTYPEi" }, /* Coordinate labels */ {"iCTYna", "CTYPEia" }, {"iCUNIn", "CUNITi" }, /* Coordinate units */ {"iCUNna", "CUNITia" }, {"iCRVLn", "CRVALi" }, /* WCS keywords */ {"iCRVna", "CRVALia" }, {"iCDLTn", "CDELTi" }, {"iCDEna", "CDELTia" }, {"iCRPXn", "CRPIXi" }, {"iCRPna", "CRPIXia" }, {"ijPCna", "PCi_ja" }, {"ijCDna", "CDi_ja" }, {"iVn_ma", "PVi_ma" }, {"iSn_ma", "PSi_ma" }, {"iCRDna", "CRDERia" }, {"iCSYna", "CSYERia" }, {"iCROTn", "CROTAi" }, {"WCAXna", "WCSAXESa"}, {"WCSNna", "WCSNAMEa"}}; \end{verbatim} \begin{description} \item[21] Translate the keywords in the input HDU into the keywords that are appropriate for the output HDU. This is a driver routine that calls the previously described routine. \end{description} \begin{verbatim} int fits_translate_keywords( fitsfile *infptr, /* I - pointer to input HDU */ fitsfile *outfptr, /* I - pointer to output HDU */ int firstkey, /* I - first HDU record number to start with */ char *patterns[][2],/* I - pointer to input / output keyword templates */ int npat, /* I - number of templates passed */ int n_value, /* I - base 'n' template value of interest */ int n_offset, /* I - offset to be applied to the 'n' */ /* value in the output string */ int n_range, /* I - controls range of 'n' template */ /* values of interest (-1,0, or +1) */ int *status) /* IO - error status */ \end{verbatim} \begin{description} \item[22] Parse the input string containing a list of rows or row ranges, and return integer arrays containing the first and last row in each range. For example, if rowlist = "3-5, 6, 8-9" then it will return numranges = 3, rangemin = 3, 6, 8 and rangemax = 5, 6, 9. At most, 'maxranges' number of ranges will be returned. 'maxrows' is the maximum number of rows in the table; any rows or ranges larger than this will be ignored. The rows must be specified in increasing order, and the ranges must not overlap. A minus sign may be use to specify all the rows to the upper or lower bound, so "50-" means all the rows from 50 to the end of the table, and "-" means all the rows in the table, from 1 - maxrows. \label{ffrwrg} \end{description} \begin{verbatim} int fits_parse_range / ffrwrg(char *rowlist, LONGLONG maxrows, int maxranges, > int *numranges, long *rangemin, long *rangemax, int *status) int fits_parse_rangell / ffrwrgll(char *rowlist, LONGLONG maxrows, int maxranges, > int *numranges, LONGLONG *rangemin, LONGLONG *rangemax, int *status) \end{verbatim} \begin{description} \item[23] Check that the Header fill bytes (if any) are all blank. These are the bytes that may follow END keyword and before the beginning of data unit, or the end of the HDU if there is no data unit. \label{ffchfl} \end{description} \begin{verbatim} int ffchfl(fitsfile *fptr, > int *status) \end{verbatim} \begin{description} \item[24] Check that the Data fill bytes (if any) are all zero (for IMAGE or BINARY Table HDU) or all blanks (for ASCII table HDU). These file bytes may be located after the last valid data byte in the HDU and before the physical end of the HDU. \label{ffcdfl} \end{description} \begin{verbatim} int ffcdfl(fitsfile *fptr, > int *status) \end{verbatim} \begin{description} \item[25] Estimate the root-mean-squared (RMS) noise in an image. These routines are mainly for use with the Hcompress image compression algorithm. They return an estimate of the RMS noise in the background pixels of the image. This robust algorithm (written by Richard White, STScI) first attempts to estimate the RMS value as 1.68 times the median of the absolute differences between successive pixels in the image. If the median = 0, then the algorithm falls back to computing the RMS of the difference between successive pixels, after several N-sigma rejection cycles to remove extreme values. The input parameters are: the array of image pixel values (either float or short values), the number of values in the array, the value that is used to represent null pixels (enter a very large number if there are no null pixels). \label{imageRMS} \end{description} \begin{verbatim} int fits_rms_float (float fdata[], int npix, float in_null_value, > double *rms, int *status) int fits_rms_short (short fdata[], int npix, short in_null_value, > double *rms, int *status) \end{verbatim} \begin{description} \item[26] Was CFITSIO compiled with the -D\_REENTRANT directive so that it may be safely used in multi-threaded environments? The following function returns 1 if yes, 0 if no. Note, however, that even if the -D\_REENTRANT directive was specified, this does not guarantee that the CFITSIO routines are thread-safe, because some compilers may not support this feature.\label{reentrant} \end{description} \begin{verbatim} int fits_is_reentrant(void) \end{verbatim} \chapter{ The CFITSIO Iterator Function } The fits\_iterate\_data function in CFITSIO provides a unique method of executing an arbitrary user-supplied `work' function that operates on rows of data in FITS tables or on pixels in FITS images. Rather than explicitly reading and writing the FITS images or columns of data, one instead calls the CFITSIO iterator routine, passing to it the name of the user's work function that is to be executed along with a list of all the table columns or image arrays that are to be passed to the work function. The CFITSIO iterator function then does all the work of allocating memory for the arrays, reading the input data from the FITS file, passing them to the work function, and then writing any output data back to the FITS file after the work function exits. Because it is often more efficient to process only a subset of the total table rows at one time, the iterator function can determine the optimum amount of data to pass in each iteration and repeatedly call the work function until the entire table been processed. For many applications this single CFITSIO iterator function can effectively replace all the other CFITSIO routines for reading or writing data in FITS images or tables. Using the iterator has several important advantages over the traditional method of reading and writing FITS data files: \begin{itemize} \item It cleanly separates the data I/O from the routine that operates on the data. This leads to a more modular and `object oriented' programming style. \item It simplifies the application program by eliminating the need to allocate memory for the data arrays and eliminates most of the calls to the CFITSIO routines that explicitly read and write the data. \item It ensures that the data are processed as efficiently as possible. This is especially important when processing tabular data since the iterator function will calculate the most efficient number of rows in the table to be passed at one time to the user's work function on each iteration. \item Makes it possible for larger projects to develop a library of work functions that all have a uniform calling sequence and are all independent of the details of the FITS file format. \end{itemize} There are basically 2 steps in using the CFITSIO iterator function. The first step is to design the work function itself which must have a prescribed set of input parameters. One of these parameters is a structure containing pointers to the arrays of data; the work function can perform any desired operations on these arrays and does not need to worry about how the input data were read from the file or how the output data get written back to the file. The second step is to design the driver routine that opens all the necessary FITS files and initializes the input parameters to the iterator function. The driver program calls the CFITSIO iterator function which then reads the data and passes it to the user's work function. The following 2 sections describe these steps in more detail. There are also several example programs included with the CFITSIO distribution which illustrate how to use the iterator function. \section{The Iterator Work Function} The user-supplied iterator work function must have the following set of input parameters (the function can be given any desired name): \begin{verbatim} int user_fn( long totaln, long offset, long firstn, long nvalues, int narrays, iteratorCol *data, void *userPointer ) \end{verbatim} \begin{itemize} \item totaln -- the total number of table rows or image pixels that will be passed to the work function during 1 or more iterations. \item offset -- the offset applied to the first table row or image pixel to be passed to the work function. In other words, this is the number of rows or pixels that are skipped over before starting the iterations. If offset = 0, then all the table rows or image pixels will be passed to the work function. \item firstn -- the number of the first table row or image pixel (starting with 1) that is being passed in this particular call to the work function. \item nvalues -- the number of table rows or image pixels that are being passed in this particular call to the work function. nvalues will always be less than or equal to totaln and will have the same value on each iteration, except possibly on the last call which may have a smaller value. \item narrays -- the number of arrays of data that are being passed to the work function. There is one array for each image or table column. \item *data -- array of structures, one for each column or image. Each structure contains a pointer to the array of data as well as other descriptive parameters about that array. \item *userPointer -- a user supplied pointer that can be used to pass ancillary information from the driver function to the work function. This pointer is passed to the CFITSIO iterator function which then passes it on to the work function without any modification. It may point to a single number, to an array of values, to a structure containing an arbitrary set of parameters of different types, or it may be a null pointer if it is not needed. The work function must cast this pointer to the appropriate data type before using it it. \end{itemize} The totaln, offset, narrays, data, and userPointer parameters are guaranteed to have the same value on each iteration. Only firstn, nvalues, and the arrays of data pointed to by the data structures may change on each iterative call to the work function. Note that the iterator treats an image as a long 1-D array of pixels regardless of it's intrinsic dimensionality. The total number of pixels is just the product of the size of each dimension, and the order of the pixels is the same as the order that they are stored in the FITS file. If the work function needs to know the number and size of the image dimensions then these parameters can be passed via the userPointer structure. The iteratorCol structure is currently defined as follows: \begin{verbatim} typedef struct /* structure for the iterator function column information */ { /* structure elements required as input to fits_iterate_data: */ fitsfile *fptr; /* pointer to the HDU containing the column or image */ int colnum; /* column number in the table; ignored for images */ char colname[70]; /* name (TTYPEn) of the column; null for images */ int datatype; /* output data type (converted if necessary) */ int iotype; /* type: InputCol, InputOutputCol, or OutputCol */ /* output structure elements that may be useful for the work function: */ void *array; /* pointer to the array (and the null value) */ long repeat; /* binary table vector repeat value; set */ /* equal to 1 for images */ long tlmin; /* legal minimum data value, if any */ long tlmax; /* legal maximum data value, if any */ char unit[70]; /* physical unit string (BUNIT or TUNITn) */ char tdisp[70]; /* suggested display format; null if none */ } iteratorCol; \end{verbatim} Instead of directly reading or writing the elements in this structure, it is recommended that programmers use the access functions that are provided for this purpose. The first five elements in this structure must be initially defined by the driver routine before calling the iterator routine. The CFITSIO iterator routine uses this information to determine what column or array to pass to the work function, and whether the array is to be input to the work function, output from the work function, or both. The CFITSIO iterator function fills in the values of the remaining structure elements before passing it to the work function. The array structure element is a pointer to the actual data array and it must be cast to the correct data type before it is used. The `repeat' structure element give the number of data values in each row of the table, so that the total number of data values in the array is given by repeat * nvalues. In the case of image arrays and ASCII tables, repeat will always be equal to 1. When the data type is a character string, the array pointer is actually a pointer to an array of string pointers (i.e., char **array). The other output structure elements are provided for convenience in case that information is needed within the work function. Any other information may be passed from the driver routine to the work function via the userPointer parameter. Upon completion, the work routine must return an integer status value, with 0 indicating success and any other value indicating an error which will cause the iterator function to immediately exit at that point. Return status values in the range 1 -- 1000 should be avoided since these are reserved for use by CFITSIO. A return status value of -1 may be used to force the CFITSIO iterator function to stop at that point and return control to the driver routine after writing any output arrays to the FITS file. CFITSIO does not considered this to be an error condition, so any further processing by the application program will continue normally. \section{The Iterator Driver Function} The iterator driver function must open the necessary FITS files and position them to the correct HDU. It must also initialize the following parameters in the iteratorCol structure (defined above) for each column or image before calling the CFITSIO iterator function. Several `constructor' routines are provided in CFITSIO for this purpose. \begin{itemize} \item *fptr -- The fitsfile pointer to the table or image. \item colnum -- the number of the column in the table. This value is ignored in the case of images. If colnum equals 0, then the column name will be used to identify the column to be passed to the work function. \item colname -- the name (TTYPEn keyword) of the column. This is only required if colnum = 0 and is ignored for images. \item datatype -- The desired data type of the array to be passed to the work function. For numerical data the data type does not need to be the same as the actual data type in the FITS file, in which case CFITSIO will do the conversion. Allowed values are: TSTRING, TLOGICAL, TBYTE, TSBYTE, TSHORT, TUSHORT, TINT, TLONG, TULONG, TFLOAT, TDOUBLE. If the input value of data type equals 0, then the existing data type of the column or image will be used without any conversion. \item iotype -- defines whether the data array is to be input to the work function (i.e, read from the FITS file), or output from the work function (i.e., written to the FITS file) or both. Allowed values are InputCol, OutputCol, or InputOutputCol. Variable-length array columns are supported as InputCol or InputOutputCol types, but may not be used for an OutputCol type. \end{itemize} After the driver routine has initialized all these parameters, it can then call the CFITSIO iterator function: \begin{verbatim} int fits_iterate_data(int narrays, iteratorCol *data, long offset, long nPerLoop, int (*workFn)( ), void *userPointer, int *status); \end{verbatim} \begin{itemize} \item narrays -- the number of columns or images that are to be passed to the work function. \item *data -- pointer to array of structures containing information about each column or image. \item offset -- if positive, this number of rows at the beginning of the table (or pixels in the image) will be skipped and will not be passed to the work function. \item nPerLoop - specifies the number of table rows (or number of image pixels) that are to be passed to the work function on each iteration. If nPerLoop = 0 then CFITSIO will calculate the optimum number for greatest efficiency. If nPerLoop is negative, then all the rows or pixels will be passed at one time, and the work function will only be called once. If any variable length arrays are being processed, then the nPerLoop value is ignored, and the iterator will always process one row of the table at a time. \item *workFn - the name (actually the address) of the work function that is to be called by fits\_iterate\_data. \item *userPointer - this is a user supplied pointer that can be used to pass ancillary information from the driver routine to the work function. It may point to a single number, an array, or to a structure containing an arbitrary set of parameters. \item *status - The CFITSIO error status. Should = 0 on input; a non-zero output value indicates an error. \end{itemize} When fits\_iterate\_data is called it first allocates memory to hold all the requested columns of data or image pixel arrays. It then reads the input data from the FITS tables or images into the arrays then passes the structure with pointers to these data arrays to the work function. After the work function returns, the iterator function writes any output columns of data or images back to the FITS files. It then repeats this process for any remaining sets of rows or image pixels until it has processed the entire table or image or until the work function returns a non-zero status value. The iterator then frees the memory that it initially allocated and returns control to the driver routine that called it. \section{Guidelines for Using the Iterator Function} The totaln, offset, firstn, and nvalues parameters that are passed to the work function are useful for determining how much of the data has been processed and how much remains left to do. On the very first call to the work function firstn will be equal to offset + 1; the work function may need to perform various initialization tasks before starting to process the data. Similarly, firstn + nvalues - 1 will be equal to totaln on the last iteration, at which point the work function may need to perform some clean up operations before exiting for the last time. The work function can also force an early termination of the iterations by returning a status value = -1. The narrays and iteratorCol.datatype arguments allow the work function to double check that the number of input arrays and their data types have the expected values. The iteratorCol.fptr and iteratorCol.colnum structure elements can be used if the work function needs to read or write the values of other keywords in the FITS file associated with the array. This should generally only be done during the initialization step or during the clean up step after the last set of data has been processed. Extra FITS file I/O during the main processing loop of the work function can seriously degrade the speed of the program. If variable-length array columns are being processed, then the iterator will operate on one row of the table at a time. In this case the the repeat element in the interatorCol structure will be set equal to the number of elements in the current row that is being processed. One important feature of the iterator is that the first element in each array that is passed to the work function gives the value that is used to represent null or undefined values in the array. The real data then begins with the second element of the array (i.e., array[1], not array[0]). If the first array element is equal to zero, then this indicates that all the array elements have defined values and there are no undefined values. If array[0] is not equal to zero, then this indicates that some of the data values are undefined and this value (array[0]) is used to represent them. In the case of output arrays (i.e., those arrays that will be written back to the FITS file by the iterator function after the work function exits) the work function must set the first array element to the desired null value if necessary, otherwise the first element should be set to zero to indicate that there are no null values in the output array. CFITSIO defines 2 values, FLOATNULLVALUE and DOUBLENULLVALUE, that can be used as default null values for float and double data types, respectively. In the case of character string data types, a null string is always used to represent undefined strings. In some applications it may be necessary to recursively call the iterator function. An example of this is given by one of the example programs that is distributed with CFITSIO: it first calls a work function that writes out a 2D histogram image. That work function in turn calls another work function that reads the `X' and `Y' columns in a table to calculate the value of each 2D histogram image pixel. Graphically, the program structure can be described as: \begin{verbatim} driver --> iterator --> work1_fn --> iterator --> work2_fn \end{verbatim} Finally, it should be noted that the table columns or image arrays that are passed to the work function do not all have to come from the same FITS file and instead may come from any combination of sources as long as they have the same length. The length of the first table column or image array is used by the iterator if they do not all have the same length. \section{Complete List of Iterator Routines} All of the iterator routines are listed below. Most of these routines do not have a corresponding short function name. \begin{description} \item[1 ] Iterator `constructor' functions that set the value of elements in the iteratorCol structure that define the columns or arrays. These set the fitsfile pointer, column name, column number, datatype, and iotype, respectively. The last 2 routines allow all the parameters to be set with one function call (one supplies the column name, the other the column number). \label{ffiterset} \end{description} \begin{verbatim} int fits_iter_set_file(iteratorCol *col, fitsfile *fptr); int fits_iter_set_colname(iteratorCol *col, char *colname); int fits_iter_set_colnum(iteratorCol *col, int colnum); int fits_iter_set_datatype(iteratorCol *col, int datatype); int fits_iter_set_iotype(iteratorCol *col, int iotype); int fits_iter_set_by_name(iteratorCol *col, fitsfile *fptr, char *colname, int datatype, int iotype); int fits_iter_set_by_num(iteratorCol *col, fitsfile *fptr, int colnum, int datatype, int iotype); \end{verbatim} \begin{description} \item[2 ] Iterator `accessor' functions that return the value of the element in the iteratorCol structure that describes a particular data column or array \label{ffiterget} \end{description} \begin{verbatim} fitsfile * fits_iter_get_file(iteratorCol *col); char * fits_iter_get_colname(iteratorCol *col); int fits_iter_get_colnum(iteratorCol *col); int fits_iter_get_datatype(iteratorCol *col); int fits_iter_get_iotype(iteratorCol *col); void * fits_iter_get_array(iteratorCol *col); long fits_iter_get_tlmin(iteratorCol *col); long fits_iter_get_tlmax(iteratorCol *col); long fits_iter_get_repeat(iteratorCol *col); char * fits_iter_get_tunit(iteratorCol *col); char * fits_iter_get_tdisp(iteratorCol *col); \end{verbatim} \begin{description} \item[3 ] The CFITSIO iterator function \label{ffiter} \end{description} \begin{verbatim} int fits_iterate_data(int narrays, iteratorCol *data, long offset, long nPerLoop, int (*workFn)( long totaln, long offset, long firstn, long nvalues, int narrays, iteratorCol *data, void *userPointer), void *userPointer, int *status); \end{verbatim} \chapter{ World Coordinate System Routines } The FITS community has adopted a set of keyword conventions that define the transformations needed to convert between pixel locations in an image and the corresponding celestial coordinates on the sky, or more generally, that define world coordinates that are to be associated with any pixel location in an n-dimensional FITS array. CFITSIO is distributed with a a few self-contained World Coordinate System (WCS) routines, however, these routines DO NOT support all the latest WCS conventions, so it is STRONGLY RECOMMENDED that software developers use a more robust external WCS library. Several recommended libraries are: \begin{verbatim} WCSLIB - supported by Mark Calabretta WCSTools - supported by Doug Mink AST library - developed by the U.K. Starlink project \end{verbatim} More information about the WCS keyword conventions and links to all of these WCS libraries can be found on the FITS Support Office web site at http://fits.gsfc.nasa.gov under the WCS link. The functions provided in these external WCS libraries will need access to the WCS keywords contained in the FITS file headers. One convenient way to pass this information to the external library is to use the fits\_hdr2str routine in CFITSIO (defined below) to copy the header keywords into one long string, and then pass this string to an interface routine in the external library that will extract the necessary WCS information (e.g., the 'wcspih' routine in the WCSLIB library and the 'astFitsChan' and 'astPutCards' functions in the AST library). \begin{description} \item[1 ] Concatenate the header keywords in the CHDU into a single long string of characters. Each 80-character fixed-length keyword record is appended to the output character string, in order, with no intervening separator or terminating characters. The last header record is terminated with a NULL character. This routine allocates memory for the returned character array, so the calling program must free the memory when finished. There are 2 related routines: fits\_hdr2str simply concatenates all the existing keywords in the header; fits\_convert\_hdr2str is similar, except that if the CHDU is a tile compressed image (stored in a binary table) then it will first convert that header back to that of a normal FITS image before concatenating the keywords. Selected keywords may be excluded from the returned character string. If the second parameter (nocomments) is TRUE (nonzero) then any COMMENT, HISTORY, or blank keywords in the header will not be copied to the output string. The 'exclist' parameter may be used to supply a list of keywords that are to be excluded from the output character string. Wild card characters (*, ?, and \#) may be used in the excluded keyword names. If no additional keywords are to be excluded, then set nexc = 0 and specify NULL for the the **exclist parameter. \label{hdr2str} \end{description} \begin{verbatim} int fits_hdr2str (fitsfile *fptr, int nocomments, char **exclist, int nexc, > char **header, int *nkeys, int *status) int fits_convert_hdr2str / ffcnvthdr2str (fitsfile *fptr, int nocomments, char **exclist, int nexc, > char **header, int *nkeys, int *status) \end{verbatim} \begin{description} \item[2 ] The following CFITSIO routine is specifically designed for use in conjunction with the WCSLIB library. It is not expected that applications programmers will call this routine directly, but it is documented here for completeness. This routine extracts arrays from a binary table that contain WCS information using the -TAB table lookup convention. See the documentation provided with the WCSLIB library for more information. \label{wcstab} \end{description} \begin{verbatim} int fits_read_wcstab (fitsfile *fptr, int nwtb, wtbarr *wtb, int *status); \end{verbatim} \section{ Self-contained WCS Routines} The following routines DO NOT support the more recent WCS conventions that have been approved as part of the FITS standard. Consequently, the following routines ARE NOW DEPRECATED. It is STRONGLY RECOMMENDED that software developers not use these routines, and instead use an external WCS library, as described in the previous section. These routines are included mainly for backward compatibility with existing software. They support the following standard map projections: -SIN, -TAN, -ARC, -NCP, -GLS, -MER, and -AIT (these are the legal values for the coordtype parameter). These routines are based on similar functions in Classic AIPS. All the angular quantities are given in units of degrees. \begin{description} \item[1 ] Get the values of the basic set of standard FITS celestial coordinate system keywords from the header of a FITS image (i.e., the primary array or an IMAGE extension). These values may then be passed to the fits\_pix\_to\_world and fits\_world\_to\_pix routines that perform the coordinate transformations. If any or all of the WCS keywords are not present, then default values will be returned. If the first coordinate axis is the declination-like coordinate, then this routine will swap them so that the longitudinal-like coordinate is returned as the first axis. The first routine (ffgics) returns the primary WCS, whereas the second routine returns the particular version of the WCS specified by the 'version' parameter, which much be a character ranging from 'A' to 'Z' (or a blank character, which is equivalent to calling ffgics). If the file uses the newer 'CDj\_i' WCS transformation matrix keywords instead of old style 'CDELTn' and 'CROTA2' keywords, then this routine will calculate and return the values of the equivalent old-style keywords. Note that the conversion from the new-style keywords to the old-style values is sometimes only an approximation, so if the approximation is larger than an internally defined threshold level, then CFITSIO will still return the approximate WCS keyword values, but will also return with status = APPROX\_WCS\_KEY, to warn the calling program that approximations have been made. It is then up to the calling program to decide whether the approximations are sufficiently accurate for the particular application, or whether more precise WCS transformations must be performed using new-style WCS keywords directly. \label{ffgics} \end{description} \begin{verbatim} int fits_read_img_coord / ffgics (fitsfile *fptr, > double *xrefval, double *yrefval, double *xrefpix, double *yrefpix, double *xinc, double *yinc, double *rot, char *coordtype, int *status) int fits_read_img_coord_version / ffgicsa (fitsfile *fptr, char version, > double *xrefval, double *yrefval, double *xrefpix, double *yrefpix, double *xinc, double *yinc, double *rot, char *coordtype, int *status) \end{verbatim} \begin{description} \item[2 ] Get the values of the standard FITS celestial coordinate system keywords from the header of a FITS table where the X and Y (or RA and DEC) coordinates are stored in 2 separate columns of the table (as in the Event List table format that is often used by high energy astrophysics missions). These values may then be passed to the fits\_pix\_to\_world and fits\_world\_to\_pix routines that perform the coordinate transformations. \label{ffgtcs} \end{description} \begin{verbatim} int fits_read_tbl_coord / ffgtcs (fitsfile *fptr, int xcol, int ycol, > double *xrefval, double *yrefval, double *xrefpix, double *yrefpix, double *xinc, double *yinc, double *rot, char *coordtype, int *status) \end{verbatim} \begin{description} \item[3 ] Calculate the celestial coordinate corresponding to the input X and Y pixel location in the image. \label{ffwldp} \end{description} \begin{verbatim} int fits_pix_to_world / ffwldp (double xpix, double ypix, double xrefval, double yrefval, double xrefpix, double yrefpix, double xinc, double yinc, double rot, char *coordtype, > double *xpos, double *ypos, int *status) \end{verbatim} \begin{description} \item[4 ] Calculate the X and Y pixel location corresponding to the input celestial coordinate in the image. \label{ffxypx} \end{description} \begin{verbatim} int fits_world_to_pix / ffxypx (double xpos, double ypos, double xrefval, double yrefval, double xrefpix, double yrefpix, double xinc, double yinc, double rot, char *coordtype, > double *xpix, double *ypix, int *status) \end{verbatim} \chapter{ Hierarchical Grouping Routines } These functions allow for the creation and manipulation of FITS HDU Groups, as defined in "A Hierarchical Grouping Convention for FITS" by Jennings, Pence, Folk and Schlesinger: https://fits.gsfc.nasa.gov/registry/grouping/grouping.pdf A group is a collection of HDUs whose association is defined by a {\it grouping table}. HDUs which are part of a group are referred to as {\it member HDUs} or simply as {\it members}. Grouping table member HDUs may themselves be grouping tables, thus allowing for the construction of open-ended hierarchies of HDUs. Grouping tables contain one row for each member HDU. The grouping table columns provide identification information that allows applications to reference or "point to" the member HDUs. Member HDUs are expected, but not required, to contain a set of GRPIDn/GRPLCn keywords in their headers for each grouping table that they are referenced by. In this sense, the GRPIDn/GRPLCn keywords "link" the member HDU back to its Grouping table. Note that a member HDU need not reside in the same FITS file as its grouping table, and that a given HDU may be referenced by up to 999 grouping tables simultaneously. Grouping tables are implemented as FITS binary tables with up to six pre-defined column TTYPEn values: 'MEMBER\_XTENSION', 'MEMBER\_NAME', 'MEMBER\_VERSION', 'MEMBER\_POSITION', 'MEMBER\_URI\_TYPE' and 'MEMBER\_LOCATION'. The first three columns allow member HDUs to be identified by reference to their XTENSION, EXTNAME and EXTVER keyword values. The fourth column allows member HDUs to be identified by HDU position within their FITS file. The last two columns identify the FITS file in which the member HDU resides, if different from the grouping table FITS file. Additional user defined "auxiliary" columns may also be included with any grouping table. When a grouping table is copied or modified the presence of auxiliary columns is always taken into account by the grouping support functions; however, the grouping support functions cannot directly make use of this data. If a grouping table column is defined but the corresponding member HDU information is unavailable then a null value of the appropriate data type is inserted in the column field. Integer columns (MEMBER\_POSITION, MEMBER\_VERSION) are defined with a TNULLn value of zero (0). Character field columns (MEMBER\_XTENSION, MEMBER\_NAME, MEMBER\_URI\_TYPE, MEMBER\_LOCATION) utilize an ASCII null character to denote a null field value. The grouping support functions belong to two basic categories: those that work with grouping table HDUs (ffgt**) and those that work with member HDUs (ffgm**). Two functions, fits\_copy\_group() and fits\_remove\_group(), have the option to recursively copy/delete entire groups. Care should be taken when employing these functions in recursive mode as poorly defined groups could cause unpredictable results. The problem of a grouping table directly or indirectly referencing itself (thus creating an infinite loop) is protected against; in fact, neither function will attempt to copy or delete an HDU twice. \section{Grouping Table Routines} \begin{description} \item[1 ]Create (append) a grouping table at the end of the current FITS file pointed to by fptr. The grpname parameter provides the grouping table name (GRPNAME keyword value) and may be set to NULL if no group name is to be specified. The grouptype parameter specifies the desired structure of the grouping table and may take on the values: GT\_ID\_ALL\_URI (all columns created), GT\_ID\_REF (ID by reference columns), GT\_ID\_POS (ID by position columns), GT\_ID\_ALL (ID by reference and position columns), GT\_ID\_REF\_URI (ID by reference and FITS file URI columns), and GT\_ID\_POS\_URI (ID by position and FITS file URI columns). \label{ffgtcr} \end{description} \begin{verbatim} int fits_create_group / ffgtcr (fitsfile *fptr, char *grpname, int grouptype, > int *status) \end{verbatim} \begin{description} \item[2 ]Create (insert) a grouping table just after the CHDU of the current FITS file pointed to by fptr. All HDUs below the the insertion point will be shifted downwards to make room for the new HDU. The grpname parameter provides the grouping table name (GRPNAME keyword value) and may be set to NULL if no group name is to be specified. The grouptype parameter specifies the desired structure of the grouping table and may take on the values: GT\_ID\_ALL\_URI (all columns created), GT\_ID\_REF (ID by reference columns), GT\_ID\_POS (ID by position columns), GT\_ID\_ALL (ID by reference and position columns), GT\_ID\_REF\_URI (ID by reference and FITS file URI columns), and GT\_ID\_POS\_URI (ID by position and FITS file URI columns) \label{ffgtis}. \end{description} \begin{verbatim} int fits_insert_group / ffgtis (fitsfile *fptr, char *grpname, int grouptype, > int *status) \end{verbatim} \begin{description} \item[3 ]Change the structure of an existing grouping table pointed to by gfptr. The grouptype parameter (see fits\_create\_group() for valid parameter values) specifies the new structure of the grouping table. This function only adds or removes grouping table columns, it does not add or delete group members (i.e., table rows). If the grouping table already has the desired structure then no operations are performed and function simply returns with a (0) success status code. If the requested structure change creates new grouping table columns, then the column values for all existing members will be filled with the null values appropriate to the column type. \label{ffgtch} \end{description} \begin{verbatim} int fits_change_group / ffgtch (fitsfile *gfptr, int grouptype, > int *status) \end{verbatim} \begin{description} \item[4 ]Remove the group defined by the grouping table pointed to by gfptr, and optionally all the group member HDUs. The rmopt parameter specifies the action to be taken for all members of the group defined by the grouping table. Valid values are: OPT\_RM\_GPT (delete only the grouping table) and OPT\_RM\_ALL (recursively delete all HDUs that belong to the group). Any groups containing the grouping table gfptr as a member are updated, and if rmopt == OPT\_RM\_GPT all members have their GRPIDn and GRPLCn keywords updated accordingly. If rmopt == OPT\_RM\_ALL, then other groups that contain the deleted members of gfptr are updated to reflect the deletion accordingly. \label{ffgtrm} \end{description} \begin{verbatim} int fits_remove_group / ffgtrm (fitsfile *gfptr, int rmopt, > int *status) \end{verbatim} \begin{description} \item[5 ]Copy (append) the group defined by the grouping table pointed to by infptr, and optionally all group member HDUs, to the FITS file pointed to by outfptr. The cpopt parameter specifies the action to be taken for all members of the group infptr. Valid values are: OPT\_GCP\_GPT (copy only the grouping table) and OPT\_GCP\_ALL (recursively copy ALL the HDUs that belong to the group defined by infptr). If the cpopt == OPT\_GCP\_GPT then the members of infptr have their GRPIDn and GRPLCn keywords updated to reflect the existence of the new grouping table outfptr, since they now belong to the new group. If cpopt == OPT\_GCP\_ALL then the new grouping table outfptr only contains pointers to the copied member HDUs and not the original member HDUs of infptr. Note that, when cpopt == OPT\_GCP\_ALL, all members of the group defined by infptr will be copied to a single FITS file pointed to by outfptr regardless of their file distribution in the original group. \label{ffgtcp} \end{description} \begin{verbatim} int fits_copy_group / ffgtcp (fitsfile *infptr, fitsfile *outfptr, int cpopt, > int *status) \end{verbatim} \begin{description} \item[6 ] Merge the two groups defined by the grouping table HDUs infptr and outfptr by combining their members into a single grouping table. All member HDUs (rows) are copied from infptr to outfptr. If mgopt == OPT\_MRG\_COPY then infptr continues to exist unaltered after the merge. If the mgopt == OPT\_MRG\_MOV then infptr is deleted after the merge. In both cases, the GRPIDn and GRPLCn keywords of the member HDUs are updated accordingly. \label{ffgtmg} \end{description} \begin{verbatim} int fits_merge_groups / ffgtmg (fitsfile *infptr, fitsfile *outfptr, int mgopt, > int *status) \end{verbatim} \begin{description} \item[7 ]"Compact" the group defined by grouping table pointed to by gfptr. The compaction is achieved by merging (via fits\_merge\_groups()) all direct member HDUs of gfptr that are themselves grouping tables. The cmopt parameter defines whether the merged grouping table HDUs remain after merging (cmopt == OPT\_CMT\_MBR) or if they are deleted after merging (cmopt == OPT\_CMT\_MBR\_DEL). If the grouping table contains no direct member HDUs that are themselves grouping tables then this function does nothing. Note that this function is not recursive, i.e., only the direct member HDUs of gfptr are considered for merging. \label{ffgtcm} \end{description} \begin{verbatim} int fits_compact_group / ffgtcm (fitsfile *gfptr, int cmopt, > int *status) \end{verbatim} \begin{description} \item[8 ]Verify the integrity of the grouping table pointed to by gfptr to make sure that all group members are accessible and that all links to other grouping tables are valid. The firstfailed parameter returns the member ID (row number) of the first member HDU to fail verification (if positive value) or the first group link to fail (if negative value). If gfptr is successfully verified then firstfailed contains a return value of 0. \label{ffgtvf} \end{description} \begin{verbatim} int fits_verify_group / ffgtvf (fitsfile *gfptr, > long *firstfailed, int *status) \end{verbatim} \begin{description} \item[9 ] Open a grouping table that contains the member HDU pointed to by mfptr. The grouping table to open is defined by the grpid parameter, which contains the keyword index value of the GRPIDn/GRPLCn keyword(s) that link the member HDU mfptr to the grouping table. If the grouping table resides in a file other than the member HDUs file then an attempt is first made to open the file readwrite, and failing that readonly. A pointer to the opened grouping table HDU is returned in gfptr. Note that it is possible, although unlikely and undesirable, for the GRPIDn/GRPLCn keywords in a member HDU header to be non-continuous, e.g., GRPID1, GRPID2, GRPID5, GRPID6. In such cases, the grpid index value specified in the function call shall identify the (grpid)th GRPID value. In the above example, if grpid == 3, then the group specified by GRPID5 would be opened. \label{ffgtop} \end{description} \begin{verbatim} int fits_open_group / ffgtop (fitsfile *mfptr, int grpid, > fitsfile **gfptr, int *status) \end{verbatim} \begin{description} \item[10] Add a member HDU to an existing grouping table pointed to by gfptr. The member HDU may either be pointed to mfptr (which must be positioned to the member HDU) or, if mfptr == NULL, identified by the hdupos parameter (the HDU position number, Primary array == 1) if both the grouping table and the member HDU reside in the same FITS file. The new member HDU shall have the appropriate GRPIDn and GRPLCn keywords created in its header. Note that if the member HDU is already a member of the group then it will not be added a second time. \label{ffgtam} \end{description} \begin{verbatim} int fits_add_group_member / ffgtam (fitsfile *gfptr, fitsfile *mfptr, int hdupos, > int *status) \end{verbatim} \section{Group Member Routines} \begin{description} \item[1 ] Return the number of member HDUs in a grouping table gfptr. The number of member HDUs is just the NAXIS2 value (number of rows) of the grouping table. \label{ffgtnm} \end{description} \begin{verbatim} int fits_get_num_members / ffgtnm (fitsfile *gfptr, > long *nmembers, int *status) \end{verbatim} \begin{description} \item[2 ] Return the number of groups to which the HDU pointed to by mfptr is linked, as defined by the number of GRPIDn/GRPLCn keyword records that appear in its header. Note that each time this function is called, the indices of the GRPIDn/GRPLCn keywords are checked to make sure they are continuous (ie no gaps) and are re-enumerated to eliminate gaps if found. \label{ffgmng} \end{description} \begin{verbatim} int fits_get_num_groups / ffgmng (fitsfile *mfptr, > long *nmembers, int *status) \end{verbatim} \begin{description} \item[3 ] Open a member of the grouping table pointed to by gfptr. The member to open is identified by its row number within the grouping table as given by the parameter 'member' (first member == 1) . A fitsfile pointer to the opened member HDU is returned as mfptr. Note that if the member HDU resides in a FITS file different from the grouping table HDU then the member file is first opened readwrite and, failing this, opened readonly. \label{ffgmop} \end{description} \begin{verbatim} int fits_open_member / ffgmop (fitsfile *gfptr, long member, > fitsfile **mfptr, int *status) \end{verbatim} \begin{description} \item[4 ]Copy (append) a member HDU of the grouping table pointed to by gfptr. The member HDU is identified by its row number within the grouping table as given by the parameter 'member' (first member == 1). The copy of the group member HDU will be appended to the FITS file pointed to by mfptr, and upon return mfptr shall point to the copied member HDU. The cpopt parameter may take on the following values: OPT\_MCP\_ADD which adds a new entry in gfptr for the copied member HDU, OPT\_MCP\_NADD which does not add an entry in gfptr for the copied member, and OPT\_MCP\_REPL which replaces the original member entry with the copied member entry. \label{ffgmcp} \end{description} \begin{verbatim} int fits_copy_member / ffgmcp (fitsfile *gfptr, fitsfile *mfptr, long member, int cpopt, > int *status) \end{verbatim} \begin{description} \item[5 ]Transfer a group member HDU from the grouping table pointed to by infptr to the grouping table pointed to by outfptr. The member HDU to transfer is identified by its row number within infptr as specified by the parameter 'member' (first member == 1). If tfopt == OPT\_MCP\_ADD then the member HDU is made a member of outfptr and remains a member of infptr. If tfopt == OPT\_MCP\_MOV then the member HDU is deleted from infptr after the transfer to outfptr. \label{ffgmtf} \end{description} \begin{verbatim} int fits_transfer_member / ffgmtf (fitsfile *infptr, fitsfile *outfptr, long member, int tfopt, > int *status) \end{verbatim} \begin{description} \item[6 ]Remove a member HDU from the grouping table pointed to by gfptr. The member HDU to be deleted is identified by its row number in the grouping table as specified by the parameter 'member' (first member == 1). The rmopt parameter may take on the following values: OPT\_RM\_ENTRY which removes the member HDU entry from the grouping table and updates the member's GRPIDn/GRPLCn keywords, and OPT\_RM\_MBR which removes the member HDU entry from the grouping table and deletes the member HDU itself. \label{ffgmrm} \end{description} \begin{verbatim} int fits_remove_member / ffgmrm (fitsfile *gfptr, long member, int rmopt, > int *status) \end{verbatim} \chapter{ Specialized CFITSIO Interface Routines } The basic interface routines described previously are recommended for most uses, but the routines described in this chapter are also available if necessary. Some of these routines perform more specialized function that cannot easily be done with the basic interface routines while others duplicate the functionality of the basic routines but have a slightly different calling sequence. See Appendix B for the definition of each function parameter. \section{FITS File Access Routines} \subsection{File Access} \begin{description} \item[1 ] Open an existing FITS file residing in core computer memory. This routine is analogous to fits\_open\_file. The 'filename' is currently ignored by this routine and may be any arbitrary string. In general, the application must have preallocated an initial block of memory to hold the FITS file prior to calling this routine: 'memptr' points to the starting address and 'memsize' gives the initial size of the block of memory. 'mem\_realloc' is a pointer to an optional function that CFITSIO can call to allocate additional memory, if needed (only if mode = READWRITE), and is modeled after the standard C 'realloc' function; a null pointer may be given if the initial allocation of memory is all that will be required (e.g., if the file is opened with mode = READONLY). The 'deltasize' parameter may be used to suggest a minimum amount of additional memory that should be allocated during each call to the memory reallocation function. By default, CFITSIO will reallocate enough additional space to hold the entire currently defined FITS file (as given by the NAXISn keywords) or 1 FITS block (= 2880 bytes), which ever is larger. Values of deltasize less than 2880 will be ignored. Since the memory reallocation operation can be computationally expensive, allocating a larger initial block of memory, and/or specifying a larger deltasize value may help to reduce the number of reallocation calls and make the application program run faster. Note that values of the memptr and memsize pointers will be updated by CFITSIO if the location or size of the FITS file in memory should change as a result of allocating more memory. \label{ffomem} \end{description} \begin{verbatim} int fits_open_memfile / ffomem (fitsfile **fptr, const char *filename, int mode, void **memptr, size_t *memsize, size_t deltasize, void *(*mem_realloc)(void *p, size_t newsize), int *status) \end{verbatim} \begin{description} \item[2 ] Create a new FITS file residing in core computer memory. This routine is analogous to fits\_create\_file. In general, the application must have preallocated an initial block of memory to hold the FITS file prior to calling this routine: 'memptr' points to the starting address and 'memsize' gives the initial size of the block of memory. 'mem\_realloc' is a pointer to an optional function that CFITSIO can call to allocate additional memory, if needed, and is modeled after the standard C 'realloc' function; a null pointer may be given if the initial allocation of memory is all that will be required. The 'deltasize' parameter may be used to suggest a minimum amount of additional memory that should be allocated during each call to the memory reallocation function. By default, CFITSIO will reallocate enough additional space to hold 1 FITS block (= 2880 bytes) and values of deltasize less than 2880 will be ignored. Since the memory reallocation operation can be computationally expensive, allocating a larger initial block of memory, and/or specifying a larger deltasize value may help to reduce the number of reallocation calls and make the application program run faster. Note that values of the memptr and memsize pointers will be updated by CFITSIO if the location or size of the FITS file in memory should change as a result of allocating more memory. \label{ffimem} \end{description} \begin{verbatim} int fits_create_memfile / ffimem (fitsfile **fptr, void **memptr, size_t *memsize, size_t deltasize, void *(*mem_realloc)(void *p, size_t newsize), int *status) \end{verbatim} \begin{description} \item[3 ] Reopen a FITS file that was previously opened with fits\_open\_file or fits\_create\_file. The new fitsfile pointer may then be treated as a separate file, and one may simultaneously read or write to 2 (or more) different extensions in the same file. The fits\_open\_file routine (above) automatically detects cases where a previously opened file is being opened again, and then internally call fits\_reopen\_file, so programs should rarely need to explicitly call this routine. \label{ffreopen} \end{description} \begin{verbatim} int fits_reopen_file / ffreopen (fitsfile *openfptr, fitsfile **newfptr, > int *status) \end{verbatim} \begin{description} \item[4 ] Create a new FITS file, using a template file to define its initial size and structure. The template may be another FITS HDU or an ASCII template file. If the input template file name pointer is null, then this routine behaves the same as fits\_create\_file. The currently supported format of the ASCII template file is described under the fits\_parse\_template routine (in the general Utilities section) \label{fftplt} \end{description} \begin{verbatim} int fits_create_template / fftplt (fitsfile **fptr, char *filename, char *tpltfile > int *status) \end{verbatim} \begin{description} \item[5 ] Parse the input filename or URL into its component parts, namely: \begin{itemize} \item the file type (file://, ftp://, http://, etc), \item the base input file name, \item the name of the output file that the input file is to be copied to prior to opening, \item the HDU or extension specification, \item the filtering specifier, \item the binning specifier, \item the column specifier, \item and the image pixel filtering specifier. \end{itemize} A null pointer (0) may be be specified for any of the output string arguments that are not needed. Null strings will be returned for any components that are not present in the input file name. The calling routine must allocate sufficient memory to hold the returned character strings. Allocating the string lengths equal to FLEN\_FILENAME is guaranteed to be safe. These routines are mainly for internal use by other CFITSIO routines. \label{ffiurl} \end{description} \begin{verbatim} int fits_parse_input_url / ffiurl (char *filename, > char *filetype, char *infile, char *outfile, char *extspec, char *filter, char *binspec, char *colspec, int *status) int fits_parse_input_filename / ffifile (char *filename, > char *filetype, char *infile, char *outfile, char *extspec, char *filter, char *binspec, char *colspec, char *pixspec, int *status) \end{verbatim} \begin{description} \item[6 ] Parse the input filename and return the HDU number that would be moved to if the file were opened with fits\_open\_file. The returned HDU number begins with 1 for the primary array, so for example, if the input filename = `myfile.fits[2]' then hdunum = 3 will be returned. CFITSIO does not open the file to check if the extension actually exists if an extension number is specified. If an extension name is included in the file name specification (e.g. `myfile.fits[EVENTS]' then this routine will have to open the FITS file and look for the position of the named extension, then close file again. This is not possible if the file is being read from the stdin stream, and an error will be returned in this case. If the filename does not specify an explicit extension (e.g. 'myfile.fits') then hdunum = -99 will be returned, which is functionally equivalent to hdunum = 1. This routine is mainly used for backward compatibility in the ftools software package and is not recommended for general use. It is generally better and more efficient to first open the FITS file with fits\_open\_file, then use fits\_get\_hdu\_num to determine which HDU in the file has been opened, rather than calling fits\_parse\_input\_url followed by a call to fits\_open\_file. \label{ffextn} \end{description} \begin{verbatim} int fits_parse_extnum / ffextn (char *filename, > int *hdunum, int *status) \end{verbatim} \begin{description} \item[7 ]Parse the input file name and return the root file name. The root name includes the file type if specified, (e.g. 'ftp://' or 'http://') and the full path name, to the extent that it is specified in the input filename. It does not include the HDU name or number, or any filtering specifications. The calling routine must allocate sufficient memory to hold the returned rootname character string. Allocating the length equal to FLEN\_FILENAME is guaranteed to be safe. \label{ffrtnm} \end{description} \begin{verbatim} int fits_parse_rootname / ffrtnm (char *filename, > char *rootname, int *status); \end{verbatim} \begin{description} \item[8 ]Test if the input file or a compressed version of the file (with a .gz, .Z, .z, or .zip extension) exists on disk. The returned value of the 'exists' parameter will have 1 of the 4 following values: \begin{verbatim} 2: the file does not exist, but a compressed version does exist 1: the disk file does exist 0: neither the file nor a compressed version of the file exist -1: the input file name is not a disk file (could be a ftp, http, smem, or mem file, or a file piped in on the STDIN stream) \end{verbatim} \label{ffexist} \end{description} \begin{verbatim} int fits_file_exists / ffexist (char *filename, > int *exists, int *status); \end{verbatim} \begin{description} \item[9 ]Flush any internal buffers of data to the output FITS file. These routines rarely need to be called, but can be useful in cases where other processes need to access the same FITS file in real time, either on disk or in memory. These routines also help to ensure that if the application program subsequently aborts then the FITS file will have been closed properly. The first routine, fits\_flush\_file is more rigorous and completely closes, then reopens, the current HDU, before flushing the internal buffers, thus ensuring that the output FITS file is identical to what would be produced if the FITS was closed at that point (i.e., with a call to fits\_close\_file). The second routine, fits\_flush\_buffer simply flushes the internal CFITSIO buffers of data to the output FITS file, without updating and closing the current HDU. This is much faster, but there may be circumstances where the flushed file does not completely reflect the final state of the file as it will exist when the file is actually closed. A typical use of these routines would be to flush the state of a FITS table to disk after each row of the table is written. It is recommend that fits\_flush\_file be called after the first row is written, then fits\_flush\_buffer may be called after each subsequent row is written. Note that this latter routine will not automatically update the NAXIS2 keyword which records the number of rows of data in the table, so this keyword must be explicitly updated by the application program after each row is written. \label{ffflus} \end{description} \begin{verbatim} int fits_flush_file / ffflus (fitsfile *fptr, > int *status) int fits_flush_buffer / ffflsh (fitsfile *fptr, 0, > int *status) (Note: The second argument must be 0). \end{verbatim} \begin{description} \item[10 ] Wrapper functions for global initialization and cleanup of the libcurl library used when accessing files with the HTTPS or FTPS protocols. If an HTTPS/FTPS file transfer is to be performed, it is recommended that you call the init function once near the start of your program before any file\_open calls, and before creating any threads. The cleanup function should be called after all HTTPS/FTPS file accessing is completed, and after all threads are completed. The functions return 0 upon successful initialization and cleanup. These are NOT THREAD-SAFE. \label{ffihtps} \end{description} \begin{verbatim} int fits_init_https / ffihtps () int fits_cleanup_https / ffchtps () \end{verbatim} \subsection{Download Utility Functions} These routines do not need to be called for normal file accessing. They are primarily intended to help with debugging and diagnosing issues which occur during file downloads. These routines are NOT THREAD-SAFE. \begin{description} \item[1 ] Toggle the verbosity of the libcurl library diagnostic output when accessing files with the HTTPS or FTPS protocol. `flag' = 1 turns the output on, 0 turns it off (the default). \label{ffvhtps} \end{description} \begin{verbatim} void fits_verbose_https / ffvhtps (int flag) \end{verbatim} \begin{description} \item[2] If `flag' is set to 1, this will display (to stderr) a progress bar during an https file download. (This is not yet implemented for other file transfer protocols.) `flag' = 0 by default. \label{ffshdwn} \end{description} \begin{verbatim} void fits_show_download_progress / ffshdwn (int flag) \end{verbatim} \begin{description} \item[3] The timeout setting (in seconds) determines the maximum time allowed for a net download to complete. If a download has not finished within the allowed time, the file transfer will terminate and the CFITSIO calling function will return with an error. Use fits\_get\_timeout will see the current timeout setting and fits\_set\_timeout to change the setting. This adjustmant may be particularly useful when having trouble downloading large files over slow connections. \label{ffgtmo} \end{description} \begin{verbatim} int fits_get_timeout / ffgtmo () int fits_set_timeout / ffstmo (int seconds, > int *status) \end{verbatim} \section{HDU Access Routines} \begin{description} \item[1 ] Get the byte offsets in the FITS file to the start of the header and the start and end of the data in the CHDU. The difference between headstart and dataend equals the size of the CHDU. If the CHDU is the last HDU in the file, then dataend is also equal to the size of the entire FITS file. Null pointers may be input for any of the address parameters if their values are not needed. \label{ffghad} \end{description} \begin{verbatim} int fits_get_hduaddr / ffghad (only supports files up to 2.1 GB in size) (fitsfile *fptr, > long *headstart, long *datastart, long *dataend, int *status) int fits_get_hduaddrll / ffghadll (supports large files) (fitsfile *fptr, > LONGLONG *headstart, LONGLONG *datastart, LONGLONG *dataend, int *status) \end{verbatim} \begin{description} \item[2 ] Create (append) a new empty HDU at the end of the FITS file. This is now the CHDU but it is completely empty and has no header keywords. It is recommended that fits\_create\_img or fits\_create\_tbl be used instead of this routine. \label{ffcrhd} \end{description} \begin{verbatim} int fits_create_hdu / ffcrhd (fitsfile *fptr, > int *status) \end{verbatim} \begin{description} \item[3 ] Insert a new IMAGE extension immediately following the CHDU, or insert a new Primary Array at the beginning of the file. Any following extensions in the file will be shifted down to make room for the new extension. If the CHDU is the last HDU in the file then the new image extension will simply be appended to the end of the file. One can force a new primary array to be inserted at the beginning of the FITS file by setting status = PREPEND\_PRIMARY prior to calling the routine. In this case the old primary array will be converted to an IMAGE extension. The new extension (or primary array) will become the CHDU. Refer to Chapter 9 for a list of pre-defined bitpix values. \label{ffiimg} \end{description} \begin{verbatim} int fits_insert_img / ffiimg (fitsfile *fptr, int bitpix, int naxis, long *naxes, > int *status) int fits_insert_imgll / ffiimgll (fitsfile *fptr, int bitpix, int naxis, LONGLONG *naxes, > int *status) \end{verbatim} \begin{description} \item[4 ] Insert a new ASCII or binary table extension immediately following the CHDU. Any following extensions will be shifted down to make room for the new extension. If there are no other following extensions then the new table extension will simply be appended to the end of the file. If the FITS file is currently empty then this routine will create a dummy primary array before appending the table to it. The new extension will become the CHDU. The tunit and extname parameters are optional and a null pointer may be given if they are not defined. When inserting an ASCII table with fits\_insert\_atbl, a null pointer may given for the *tbcol parameter in which case each column of the table will be separated by a single space character. Similarly, if the input value of rowlen is 0, then CFITSIO will calculate the default rowlength based on the tbcol and ttype values. Under normal circumstances, the nrows paramenter should have a value of 0; CFITSIO will automatically update the number of rows as data is written to the table. When inserting a binary table with fits\_insert\_btbl, if there are following extensions in the file and if the table contains variable length array columns then pcount must specify the expected final size of the data heap, otherwise pcount must = 0. \label{ffitab} \label{ffibin} \end{description} \begin{verbatim} int fits_insert_atbl / ffitab (fitsfile *fptr, LONGLONG rowlen, LONGLONG nrows, int tfields, char *ttype[], long *tbcol, char *tform[], char *tunit[], char *extname, > int *status) int fits_insert_btbl / ffibin (fitsfile *fptr, LONGLONG nrows, int tfields, char **ttype, char **tform, char **tunit, char *extname, long pcount, > int *status) \end{verbatim} \begin{description} \item[5 ] Modify the size, dimensions, and/or data type of the current primary array or image extension. If the new image, as specified by the input arguments, is larger than the current existing image in the FITS file then zero fill data will be inserted at the end of the current image and any following extensions will be moved further back in the file. Similarly, if the new image is smaller than the current image then any following extensions will be shifted up towards the beginning of the FITS file and the image data will be truncated to the new size. This routine rewrites the BITPIX, NAXIS, and NAXISn keywords with the appropriate values for the new image. \label{ffrsim} \end{description} \begin{verbatim} int fits_resize_img / ffrsim (fitsfile *fptr, int bitpix, int naxis, long *naxes, > int *status) int fits_resize_imgll / ffrsimll (fitsfile *fptr, int bitpix, int naxis, LONGLONG *naxes, > int *status) \end{verbatim} \begin{description} \item[6 ] Copy the data (and not the header) from the CHDU associated with infptr to the CHDU associated with outfptr. This will overwrite any data previously in the output CHDU. This low level routine is used by fits\_copy\_hdu, but it may also be useful in certain application programs that want to copy the data from one FITS file to another but also want to modify the header keywords. The required FITS header keywords which define the structure of the HDU must be written to the output CHDU before calling this routine. \label{ffcpdt} \end{description} \begin{verbatim} int fits_copy_data / ffcpdt (fitsfile *infptr, fitsfile *outfptr, > int *status) \end{verbatim} \begin{description} \item[7 ] Read or write a specified number of bytes starting at the specified byte offset from the start of the extension data unit. These low level routine are intended mainly for accessing the data in non-standard, conforming extensions, and should not be used for standard IMAGE, TABLE, or BINTABLE extensions. \label{ffgextn} \end{description} \begin{verbatim} int fits_read_ext / ffgextn (fitsfile *fptr, LONGLONG offset, LONGLONG nbytes, void *buffer) int fits_write_ext / ffpextn (fitsfile *fptr, LONGLONG offset, LONGLONG nbytes, void *buffer) \end{verbatim} \begin{description} \item[8 ] This routine forces CFITSIO to rescan the current header keywords that define the structure of the HDU (such as the NAXIS and BITPIX keywords) so that it reinitializes the internal buffers that describe the HDU structure. This routine is useful for reinitializing the structure of an HDU if any of the required keywords (e.g., NAXISn) have been modified. In practice it should rarely be necessary to call this routine because CFITSIO internally calls it in most situations. \label{ffrdef} \end{description} \begin{verbatim} int fits_set_hdustruc / ffrdef (fitsfile *fptr, > int *status) (DEPRECATED) \end{verbatim} \section{Specialized Header Keyword Routines} \subsection{Header Information Routines} \begin{description} \item[1 ] Reserve space in the CHU for MOREKEYS more header keywords. This routine may be called to allocate space for additional keywords at the time the header is created (prior to writing any data). CFITSIO can dynamically add more space to the header when needed, however it is more efficient to preallocate the required space if the size is known in advance. \label{ffhdef} \end{description} \begin{verbatim} int fits_set_hdrsize / ffhdef (fitsfile *fptr, int morekeys, > int *status) \end{verbatim} \begin{description} \item[2 ] Return the number of keywords in the header (not counting the END keyword) and the current position in the header. The position is the number of the keyword record that will be read next (or one greater than the position of the last keyword that was read). A value of 1 is returned if the pointer is positioned at the beginning of the header. \label{ffghps} \end{description} \begin{verbatim} int fits_get_hdrpos / ffghps (fitsfile *fptr, > int *keysexist, int *keynum, int *status) \end{verbatim} \subsection{Read and Write the Required Keywords} \begin{description} \item[1 ] Write the required extension header keywords into the CHU. These routines are not required, and instead the appropriate header may be constructed by writing each individual keyword in the proper sequence. The simpler fits\_write\_imghdr routine is equivalent to calling fits\_write\_grphdr with the default values of simple = TRUE, pcount = 0, gcount = 1, and extend = TRUE. The PCOUNT, GCOUNT and EXTEND keywords are not required in the primary header and are only written if pcount is not equal to zero, gcount is not equal to zero or one, and if extend is TRUE, respectively. When writing to an IMAGE extension, the SIMPLE and EXTEND parameters are ignored. It is recommended that fits\_create\_image or fits\_create\_tbl be used instead of these routines to write the required header keywords. The general fits\_write\_exthdr routine may be used to write the header of any conforming FITS extension. \label{ffphpr} \label{ffphps} \end{description} \begin{verbatim} int fits_write_imghdr / ffphps (fitsfile *fptr, int bitpix, int naxis, long *naxes, > int *status) int fits_write_imghdrll / ffphpsll (fitsfile *fptr, int bitpix, int naxis, LONGLONG *naxes, > int *status) int fits_write_grphdr / ffphpr (fitsfile *fptr, int simple, int bitpix, int naxis, long *naxes, LONGLONG pcount, LONGLONG gcount, int extend, > int *status) int fits_write_grphdrll / ffphprll (fitsfile *fptr, int simple, int bitpix, int naxis, LONGLONG *naxes, LONGLONG pcount, LONGLONG gcount, int extend, > int *status) int fits_write_exthdr /ffphext (fitsfile *fptr, char *xtension, int bitpix, int naxis, long *naxes, LONGLONG pcount, LONGLONG gcount, > int *status) \end{verbatim} \begin{description} \item[2 ] Write the ASCII table header keywords into the CHU. The optional TUNITn and EXTNAME keywords are written only if the input pointers are not null. A null pointer may given for the *tbcol parameter in which case a single space will be inserted between each column of the table. Similarly, if rowlen is given = 0, then CFITSIO will calculate the default rowlength based on the tbcol and ttype values. \label{ffphtb} \end{description} \begin{verbatim} int fits_write_atblhdr / ffphtb (fitsfile *fptr, LONGLONG rowlen, LONGLONG nrows, int tfields, char **ttype, long *tbcol, char **tform, char **tunit, char *extname, > int *status) \end{verbatim} \begin{description} \item[3 ] Write the binary table header keywords into the CHU. The optional TUNITn and EXTNAME keywords are written only if the input pointers are not null. The pcount parameter, which specifies the size of the variable length array heap, should initially = 0; CFITSIO will automatically update the PCOUNT keyword value if any variable length array data is written to the heap. The TFORM keyword value for variable length vector columns should have the form 'Pt(len)' or '1Pt(len)' where `t' is the data type code letter (A,I,J,E,D, etc.) and `len' is an integer specifying the maximum length of the vectors in that column (len must be greater than or equal to the longest vector in the column). If `len' is not specified when the table is created (e.g., the input TFORMn value is just '1Pt') then CFITSIO will scan the column when the table is first closed and will append the maximum length to the TFORM keyword value. Note that if the table is subsequently modified to increase the maximum length of the vectors then the modifying program is responsible for also updating the TFORM keyword value. \label{ffphbn} \end{description} \begin{verbatim} int fits_write_btblhdr / ffphbn (fitsfile *fptr, LONGLONG nrows, int tfields, char **ttype, char **tform, char **tunit, char *extname, LONGLONG pcount, > int *status) \end{verbatim} \begin{description} \item[4 ] Read the required keywords from the CHDU (image or table). When reading from an IMAGE extension the SIMPLE and EXTEND parameters are ignored. A null pointer may be supplied for any of the returned parameters that are not needed. \label{ffghpr} \label{ffghtb} \label{ffghbn} \end{description} \begin{verbatim} int fits_read_imghdr / ffghpr (fitsfile *fptr, int maxdim, > int *simple, int *bitpix, int *naxis, long *naxes, long *pcount, long *gcount, int *extend, int *status) int fits_read_imghdrll / ffghprll (fitsfile *fptr, int maxdim, > int *simple, int *bitpix, int *naxis, LONGLONG *naxes, long *pcount, long *gcount, int *extend, int *status) int fits_read_atblhdr / ffghtb (fitsfile *fptr,int maxdim, > long *rowlen, long *nrows, int *tfields, char **ttype, LONGLONG *tbcol, char **tform, char **tunit, char *extname, int *status) int fits_read_atblhdrll / ffghtbll (fitsfile *fptr,int maxdim, > LONGLONG *rowlen, LONGLONG *nrows, int *tfields, char **ttype, long *tbcol, char **tform, char **tunit, char *extname, int *status) int fits_read_btblhdr / ffghbn (fitsfile *fptr, int maxdim, > long *nrows, int *tfields, char **ttype, char **tform, char **tunit, char *extname, long *pcount, int *status) int fits_read_btblhdrll / ffghbnll (fitsfile *fptr, int maxdim, > LONGLONG *nrows, int *tfields, char **ttype, char **tform, char **tunit, char *extname, long *pcount, int *status) \end{verbatim} \subsection{Write Keyword Routines} These routines simply append a new keyword to the header and do not check to see if a keyword with the same name already exists. In general it is preferable to use the fits\_update\_key routine to ensure that the same keyword is not written more than once to the header. See Appendix B for the definition of the parameters used in these routines. \begin{description} \item[1 ] Write (append) a new keyword of the appropriate data type into the CHU. A null pointer may be entered for the comment parameter, which will cause the comment field of the keyword to be left blank. The flt, dbl, cmp, and dblcmp versions of this routine have the added feature that if the 'decimals' parameter is negative, then the 'G' display format rather then the 'E' format will be used when constructing the keyword value, taking the absolute value of 'decimals' for the precision. This will suppress trailing zeros, and will use a fixed format rather than an exponential format, depending on the magnitude of the value. \label{ffpkyx} \end{description} \begin{verbatim} int fits_write_key_str / ffpkys (fitsfile *fptr, char *keyname, char *value, char *comment, > int *status) int fits_write_key_[log, lng] / ffpky[lj] (fitsfile *fptr, char *keyname, DTYPE numval, char *comment, > int *status) int fits_write_key_[flt, dbl, fixflg, fixdbl] / ffpky[edfg] (fitsfile *fptr, char *keyname, DTYPE numval, int decimals, char *comment, > int *status) int fits_write_key_[cmp, dblcmp, fixcmp, fixdblcmp] / ffpk[yc,ym,fc,fm] (fitsfile *fptr, char *keyname, DTYPE *numval, int decimals, char *comment, > int *status) \end{verbatim} \begin{description} \item[2 ] Write (append) a string valued keyword into the CHU which may be longer than 68 characters in length. This uses the Long String Keyword convention that is described in the`Local FITS Conventions' section in Chapter 4. Since this uses a non-standard FITS convention to encode the long keyword string, programs which use this routine should also call the fits\_write\_key\_longwarn routine to add some COMMENT keywords to warn users of the FITS file that this convention is being used. The fits\_write\_key\_longwarn routine also writes a keyword called LONGSTRN to record the version of the longstring convention that has been used, in case a new convention is adopted at some point in the future. If the LONGSTRN keyword is already present in the header, then fits\_write\_key\_longwarn will simply return without doing anything. \label{ffpkls} \label{ffplsw} \end{description} \begin{verbatim} int fits_write_key_longstr / ffpkls (fitsfile *fptr, char *keyname, char *longstr, char *comment, > int *status) int fits_write_key_longwarn / ffplsw (fitsfile *fptr, > int *status) \end{verbatim} \begin{description} \item[3 ] Write (append) a numbered sequence of keywords into the CHU. The starting index number (nstart) must be greater than 0. One may append the same comment to every keyword (and eliminate the need to have an array of identical comment strings, one for each keyword) by including the ampersand character as the last non-blank character in the (first) COMMENTS string parameter. This same string will then be used for the comment field in all the keywords. One may also enter a null pointer for the comment parameter to leave the comment field of the keyword blank. \label{ffpknx} \end{description} \begin{verbatim} int fits_write_keys_str / ffpkns (fitsfile *fptr, char *keyroot, int nstart, int nkeys, char **value, char **comment, > int *status) int fits_write_keys_[log, lng] / ffpkn[lj] (fitsfile *fptr, char *keyroot, int nstart, int nkeys, DTYPE *numval, char **comment, int *status) int fits_write_keys_[flt, dbl, fixflg, fixdbl] / ffpkne[edfg] (fitsfile *fptr, char *keyroot, int nstart, int nkey, DTYPE *numval, int decimals, char **comment, > int *status) \end{verbatim} \begin{description} \item[4 ]Copy an indexed keyword from one HDU to another, modifying the index number of the keyword name in the process. For example, this routine could read the TLMIN3 keyword from the input HDU (by giving keyroot = `TLMIN' and innum = 3) and write it to the output HDU with the keyword name TLMIN4 (by setting outnum = 4). If the input keyword does not exist, then this routine simply returns without indicating an error. \label{ffcpky} \end{description} \begin{verbatim} int fits_copy_key / ffcpky (fitsfile *infptr, fitsfile *outfptr, int innum, int outnum, char *keyroot, > int *status) \end{verbatim} \begin{description} \item[5 ]Write (append) a `triple precision' keyword into the CHU in F28.16 format. The floating point keyword value is constructed by concatenating the input integer value with the input double precision fraction value (which must have a value between 0.0 and 1.0). The ffgkyt routine should be used to read this keyword value, because the other keyword reading routines will not preserve the full precision of the value. \label{ffpkyt} \end{description} \begin{verbatim} int fits_write_key_triple / ffpkyt (fitsfile *fptr, char *keyname, long intval, double frac, char *comment, > int *status) \end{verbatim} \begin{description} \item[6 ]Write keywords to the CHDU that are defined in an ASCII template file. The format of the template file is described under the fits\_parse\_template routine. \label{ffpktp} \end{description} \begin{verbatim} int fits_write_key_template / ffpktp (fitsfile *fptr, const char *filename, > int *status) \end{verbatim} \subsection{Insert Keyword Routines} These insert routines are somewhat less efficient than the `update' or `write' keyword routines because the following keywords in the header must be shifted down to make room for the inserted keyword. See Appendix B for the definition of the parameters used in these routines. \begin{description} \item[1 ] Insert a new keyword record into the CHU at the specified position (i.e., immediately preceding the (keynum)th keyword in the header.) \label{ffirec} \end{description} \begin{verbatim} int fits_insert_record / ffirec (fitsfile *fptr, int keynum, char *card, > int *status) \end{verbatim} \begin{description} \item[2 ] Insert a new keyword into the CHU. The new keyword is inserted immediately following the last keyword that has been read from the header. The `longstr' version has the same functionality as the `str' version except that it also supports the local long string keyword convention for strings longer than 68 characters. A null pointer may be entered for the comment parameter which will cause the comment field to be left blank. The flt, dbl, cmp, and dblcmp versions of this routine have the added feature that if the 'decimals' parameter is negative, then the 'G' display format rather then the 'E' format will be used when constructing the keyword value, taking the absolute value of 'decimals' for the precision. This will suppress trailing zeros, and will use a fixed format rather than an exponential format, depending on the magnitude of the value. \label{ffikyx} \end{description} \begin{verbatim} int fits_insert_card / ffikey (fitsfile *fptr, char *card, > int *status) int fits_insert_key_[str, longstr] / ffi[kys, kls] (fitsfile *fptr, char *keyname, char *value, char *comment, > int *status) int fits_insert_key_[log, lng] / ffiky[lj] (fitsfile *fptr, char *keyname, DTYPE numval, char *comment, > int *status) int fits_insert_key_[flt, fixflt, dbl, fixdbl] / ffiky[edfg] (fitsfile *fptr, char *keyname, DTYPE numval, int decimals, char *comment, > int *status) int fits_insert_key_[cmp, dblcmp, fixcmp, fixdblcmp] / ffik[yc,ym,fc,fm] (fitsfile *fptr, char *keyname, DTYPE *numval, int decimals, char *comment, > int *status) \end{verbatim} \begin{description} \item[3 ] Insert a new keyword with an undefined, or null, value into the CHU. The value string of the keyword is left blank in this case. \label{ffikyu} \end{description} \begin{verbatim} int fits_insert_key_null / ffikyu (fitsfile *fptr, char *keyname, char *comment, > int *status) \end{verbatim} \subsection{Read Keyword Routines} Wild card characters may be used when specifying the name of the keyword to be read. \begin{description} \item[1 ] Read a keyword value (with the appropriate data type) and comment from the CHU. If a NULL comment pointer is given on input, then the comment string will not be returned. If the value of the keyword is not defined (i.e., the value field is blank) then an error status = VALUE\_UNDEFINED will be returned and the input value will not be changed (except that ffgkys will reset the value to a null string). \label{ffgkyx} \label{ffgkls} \end{description} \begin{verbatim} int fits_read_key_str / ffgkys (fitsfile *fptr, char *keyname, > char *value, char *comment, int *status); NOTE: after calling the following routine, programs must explicitly free the memory allocated for 'longstr' after it is no longer needed by calling fits_free_memory. int fits_read_key_longstr / ffgkls (fitsfile *fptr, char *keyname, > char **longstr, char *comment, int *status) int fits_free_memory / fffree (char *longstr, > int *status); int fits_read_key_[log, lng, flt, dbl, cmp, dblcmp] / ffgky[ljedcm] (fitsfile *fptr, char *keyname, > DTYPE *numval, char *comment, int *status) int fits_read_key_lnglng / ffgkyjj (fitsfile *fptr, char *keyname, > LONGLONG *numval, char *comment, int *status) \end{verbatim} \begin{description} \item[2 ] Read a sequence of indexed keyword values (e.g., NAXIS1, NAXIS2, ...). The input starting index number (nstart) must be greater than 0. If the value of any of the keywords is not defined (i.e., the value field is blank) then an error status = VALUE\_UNDEFINED will be returned and the input value for the undefined keyword(s) will not be changed. These routines do not support wild card characters in the root name. If there are no indexed keywords in the header with the input root name then these routines do not return a non-zero status value and instead simply return nfound = 0. \label{ffgknx} \end{description} \begin{verbatim} int fits_read_keys_str / ffgkns (fitsfile *fptr, char *keyname, int nstart, int nkeys, > char **value, int *nfound, int *status) int fits_read_keys_[log, lng, flt, dbl] / ffgkn[ljed] (fitsfile *fptr, char *keyname, int nstart, int nkeys, > DTYPE *numval, int *nfound, int *status) \end{verbatim} \begin{description} \item[3 ] Read the value of a floating point keyword, returning the integer and fractional parts of the value in separate routine arguments. This routine may be used to read any keyword but is especially useful for reading the 'triple precision' keywords written by ffpkyt. \label{ffgkyt} \end{description} \begin{verbatim} int fits_read_key_triple / ffgkyt (fitsfile *fptr, char *keyname, > long *intval, double *frac, char *comment, int *status) \end{verbatim} \subsection{Modify Keyword Routines} These routines modify the value of an existing keyword. An error is returned if the keyword does not exist. Wild card characters may be used when specifying the name of the keyword to be modified. See Appendix B for the definition of the parameters used in these routines. \begin{description} \item[1 ] Modify (overwrite) the nth 80-character header record in the CHU. \label{ffmrec} \end{description} \begin{verbatim} int fits_modify_record / ffmrec (fitsfile *fptr, int keynum, char *card, > int *status) \end{verbatim} \begin{description} \item[2 ] Modify (overwrite) the 80-character header record for the named keyword in the CHU. This can be used to overwrite the name of the keyword as well as its value and comment fields. \label{ffmcrd} \end{description} \begin{verbatim} int fits_modify_card / ffmcrd (fitsfile *fptr, char *keyname, char *card, > int *status) \end{verbatim} \begin{description} \item[5 ] Modify the value and comment fields of an existing keyword in the CHU. The `longstr' version has the same functionality as the `str' version except that it also supports the local long string keyword convention for strings longer than 68 characters. Optionally, one may modify only the value field and leave the comment field unchanged by setting the input COMMENT parameter equal to the ampersand character (\&) or by entering a null pointer for the comment parameter. The flt, dbl, cmp, and dblcmp versions of this routine have the added feature that if the 'decimals' parameter is negative, then the 'G' display format rather then the 'E' format will be used when constructing the keyword value, taking the absolute value of 'decimals' for the precision. This will suppress trailing zeros, and will use a fixed format rather than an exponential format, depending on the magnitude of the value. \label{ffmkyx} \end{description} \begin{verbatim} int fits_modify_key_[str, longstr] / ffm[kys, kls] (fitsfile *fptr, char *keyname, char *value, char *comment, > int *status); int fits_modify_key_[log, lng] / ffmky[lj] (fitsfile *fptr, char *keyname, DTYPE numval, char *comment, > int *status) int fits_modify_key_[flt, dbl, fixflt, fixdbl] / ffmky[edfg] (fitsfile *fptr, char *keyname, DTYPE numval, int decimals, char *comment, > int *status) int fits_modify_key_[cmp, dblcmp, fixcmp, fixdblcmp] / ffmk[yc,ym,fc,fm] (fitsfile *fptr, char *keyname, DTYPE *numval, int decimals, char *comment, > int *status) \end{verbatim} \begin{description} \item[6 ] Modify the value of an existing keyword to be undefined, or null. The value string of the keyword is set to blank. Optionally, one may leave the comment field unchanged by setting the input COMMENT parameter equal to the ampersand character (\&) or by entering a null pointer. \label{ffmkyu} \end{description} \begin{verbatim} int fits_modify_key_null / ffmkyu (fitsfile *fptr, char *keyname, char *comment, > int *status) \end{verbatim} \subsection{Update Keyword Routines} \begin{description} \item[1 ] These update routines modify the value, and optionally the comment field, of the keyword if it already exists, otherwise the new keyword is appended to the header. A separate routine is provided for each keyword data type. The `longstr' version has the same functionality as the `str' version except that it also supports the local long string keyword convention for strings longer than 68 characters. A null pointer may be entered for the comment parameter which will leave the comment field unchanged or blank. The flt, dbl, cmp, and dblcmp versions of this routine have the added feature that if the 'decimals' parameter is negative, then the 'G' display format rather then the 'E' format will be used when constructing the keyword value, taking the absolute value of 'decimals' for the precision. This will suppress trailing zeros, and will use a fixed format rather than an exponential format, depending on the magnitude of the value. \label{ffukyx} \end{description} \begin{verbatim} int fits_update_key_[str, longstr] / ffu[kys, kls] (fitsfile *fptr, char *keyname, char *value, char *comment, > int *status) int fits_update_key_[log, lng] / ffuky[lj] (fitsfile *fptr, char *keyname, DTYPE numval, char *comment, > int *status) int fits_update_key_[flt, dbl, fixflt, fixdbl] / ffuky[edfg] (fitsfile *fptr, char *keyname, DTYPE numval, int decimals, char *comment, > int *status) int fits_update_key_[cmp, dblcmp, fixcmp, fixdblcmp] / ffuk[yc,ym,fc,fm] (fitsfile *fptr, char *keyname, DTYPE *numval, int decimals, char *comment, > int *status) \end{verbatim} \section{Define Data Scaling and Undefined Pixel Parameters} These routines set or modify the internal parameters used by CFITSIO to either scale the data or to represent undefined pixels. Generally CFITSIO will scale the data according to the values of the BSCALE and BZERO (or TSCALn and TZEROn) keywords, however these routines may be used to override the keyword values. This may be useful when one wants to read or write the raw unscaled values in the FITS file. Similarly, CFITSIO generally uses the value of the BLANK or TNULLn keyword to signify an undefined pixel, but these routines may be used to override this value. These routines do not create or modify the corresponding header keyword values. See Appendix B for the definition of the parameters used in these routines. \begin{description} \item[1 ] Reset the scaling factors in the primary array or image extension; does not change the BSCALE and BZERO keyword values and only affects the automatic scaling performed when the data elements are written/read to/from the FITS file. When reading from a FITS file the returned data value = (the value given in the FITS array) * BSCALE + BZERO. The inverse formula is used when writing data values to the FITS file. \label{ffpscl} \end{description} \begin{verbatim} int fits_set_bscale / ffpscl (fitsfile *fptr, double scale, double zero, > int *status) \end{verbatim} \begin{description} \item[2 ] Reset the scaling parameters for a table column; does not change the TSCALn or TZEROn keyword values and only affects the automatic scaling performed when the data elements are written/read to/from the FITS file. When reading from a FITS file the returned data value = (the value given in the FITS array) * TSCAL + TZERO. The inverse formula is used when writing data values to the FITS file. \label{fftscl} \end{description} \begin{verbatim} int fits_set_tscale / fftscl (fitsfile *fptr, int colnum, double scale, double zero, > int *status) \end{verbatim} \begin{description} \item[3 ] Define the integer value to be used to signify undefined pixels in the primary array or image extension. This is only used if BITPIX = 8, 16, or 32. This does not create or change the value of the BLANK keyword in the header. \label{ffpnul} \end{description} \begin{verbatim} int fits_set_imgnull / ffpnul (fitsfile *fptr, LONGLONG nulval, > int *status) \end{verbatim} \begin{description} \item[4 ] Define the string to be used to signify undefined pixels in a column in an ASCII table. This does not create or change the value of the TNULLn keyword. \label{ffsnul} \end{description} \begin{verbatim} int fits_set_atblnull / ffsnul (fitsfile *fptr, int colnum, char *nulstr, > int *status) \end{verbatim} \begin{description} \item[5 ] Define the value to be used to signify undefined pixels in an integer column in a binary table (where TFORMn = 'B', 'I', or 'J'). This does not create or change the value of the TNULLn keyword. \label{fftnul} \end{description} \begin{verbatim} int fits_set_btblnull / fftnul (fitsfile *fptr, int colnum, LONGLONG nulval, > int *status) \end{verbatim} \section{Specialized FITS Primary Array or IMAGE Extension I/O Routines} These routines read or write data values in the primary data array (i.e., the first HDU in the FITS file) or an IMAGE extension. Automatic data type conversion is performed for if the data type of the FITS array (as defined by the BITPIX keyword) differs from the data type of the array in the calling routine. The data values are automatically scaled by the BSCALE and BZERO header values as they are being written or read from the FITS array. Unlike the basic routines described in the previous chapter, most of these routines specifically support the FITS random groups format. See Appendix B for the definition of the parameters used in these routines. The more primitive reading and writing routines (i. e., ffppr\_, ffppn\_, ffppn, ffgpv\_, or ffgpf\_) simply treat the primary array as a long 1-dimensional array of pixels, ignoring the intrinsic dimensionality of the array. When dealing with a 2D image, for example, the application program must calculate the pixel offset in the 1-D array that corresponds to any particular X, Y coordinate in the image. C programmers should note that the ordering of arrays in FITS files, and hence in all the CFITSIO calls, is more similar to the dimensionality of arrays in Fortran rather than C. For instance if a FITS image has NAXIS1 = 100 and NAXIS2 = 50, then a 2-D array just large enough to hold the image should be declared as array[50][100] and not as array[100][50]. For convenience, higher-level routines are also provided to specifically deal with 2D images (ffp2d\_ and ffg2d\_) and 3D data cubes (ffp3d\_ and ffg3d\_). The dimensionality of the FITS image is passed by the naxis1, naxis2, and naxis3 parameters and the declared dimensions of the program array are passed in the dim1 and dim2 parameters. Note that the dimensions of the program array may be larger than the dimensions of the FITS array. For example if a FITS image with NAXIS1 = NAXIS2 = 400 is read into a program array which is dimensioned as 512 x 512 pixels, then the image will just fill the lower left corner of the array with pixels in the range 1 - 400 in the X an Y directions. This has the effect of taking a contiguous set of pixel value in the FITS array and writing them to a non-contiguous array in program memory (i.e., there are now some blank pixels around the edge of the image in the program array). The most general set of routines (ffpss\_, ffgsv\_, and ffgsf\_) may be used to transfer a rectangular subset of the pixels in a FITS N-dimensional image to or from an array which has been declared in the calling program. The fpixel and lpixel parameters are integer arrays which specify the starting and ending pixel coordinate in each dimension (starting with 1, not 0) of the FITS image that is to be read or written. It is important to note that these are the starting and ending pixels in the FITS image, not in the declared array in the program. The array parameter in these routines is treated simply as a large one-dimensional array of the appropriate data type containing the pixel values; The pixel values in the FITS array are read/written from/to this program array in strict sequence without any gaps; it is up to the calling routine to correctly interpret the dimensionality of this array. The two FITS reading routines (ffgsv\_ and ffgsf\_ ) also have an `inc' parameter which defines the data sampling interval in each dimension of the FITS array. For example, if inc[0]=2 and inc[1]=3 when reading a 2-dimensional FITS image, then only every other pixel in the first dimension and every 3rd pixel in the second dimension will be returned to the 'array' parameter. Two types of routines are provided to read the data array which differ in the way undefined pixels are handled. The first type of routines (e.g., ffgpv\_) simply return an array of data elements in which undefined pixels are set equal to a value specified by the user in the `nulval' parameter. An additional feature of these routines is that if the user sets nulval = 0, then no checks for undefined pixels will be performed, thus reducing the amount of CPU processing. The second type of routines (e.g., ffgpf\_) returns the data element array and, in addition, a char array that indicates whether the value of the corresponding data pixel is undefined (= 1) or defined (= 0). The latter type of routines may be more convenient to use in some circumstances, however, it requires an additional array of logical values which can be unwieldy when working with large data arrays. \begin{description} \item[1 ] Write elements into the FITS data array. \label{ffppr} \label{ffpprx} \label{ffppn} \label{ffppnx} \end{description} \begin{verbatim} int fits_write_img / ffppr (fitsfile *fptr, int datatype, LONGLONG firstelem, LONGLONG nelements, DTYPE *array, int *status); int fits_write_img_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffppr[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelements, DTYPE *array, > int *status); int fits_write_imgnull / ffppn (fitsfile *fptr, int datatype, LONGLONG firstelem, LONGLONG nelements, DTYPE *array, DTYPE *nulval, > int *status); int fits_write_imgnull_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffppn[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelements, DTYPE *array, DTYPE nulval, > int *status); \end{verbatim} \begin{description} \item[2 ]Set data array elements as undefined. \label{ffppru} \end{description} \begin{verbatim} int fits_write_img_null / ffppru (fitsfile *fptr, long group, LONGLONG firstelem, LONGLONG nelements, > int *status) \end{verbatim} \begin{description} \item[3 ] Write values into group parameters. This routine only applies to the `Random Grouped' FITS format which has been used for applications in radio interferometry, but is officially deprecated for future use. \label{ffpgpx} \end{description} \begin{verbatim} int fits_write_grppar_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffpgp[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, long group, long firstelem, long nelements, > DTYPE *array, int *status) \end{verbatim} \begin{description} \item[4 ] Write a 2-D or 3-D image into the data array. \label{ffp2dx} \label{ffp3dx} \end{description} \begin{verbatim} int fits_write_2d_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffp2d[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, long group, LONGLONG dim1, LONGLONG naxis1, LONGLONG naxis2, DTYPE *array, > int *status) int fits_write_3d_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffp3d[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, long group, LONGLONG dim1, LONGLONG dim2, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, DTYPE *array, > int *status) \end{verbatim} \begin{description} \item[5 ] Write an arbitrary data subsection into the data array. \label{ffpssx} \end{description} \begin{verbatim} int fits_write_subset_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffpss[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, long group, long naxis, long *naxes, long *fpixel, long *lpixel, DTYPE *array, > int *status) \end{verbatim} \begin{description} \item[6 ] Read elements from the FITS data array. \label{ffgpv} \label{ffgpvx} \label{ffgpf} \label{ffgpfx} \end{description} \begin{verbatim} int fits_read_img / ffgpv (fitsfile *fptr, int datatype, long firstelem, long nelements, DTYPE *nulval, > DTYPE *array, int *anynul, int *status) int fits_read_img_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffgpv[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, long group, long firstelem, long nelements, DTYPE nulval, > DTYPE *array, int *anynul, int *status) int fits_read_imgnull / ffgpf (fitsfile *fptr, int datatype, long firstelem, long nelements, > DTYPE *array, char *nullarray, int *anynul, int *status) int fits_read_imgnull_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffgpf[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, long group, long firstelem, long nelements, > DTYPE *array, char *nullarray, int *anynul, int *status) \end{verbatim} \begin{description} \item[7 ] Read values from group parameters. This routine only applies to the `Random Grouped' FITS format which has been used for applications in radio interferometry, but is officially deprecated for future use. \label{ffggpx} \end{description} \begin{verbatim} int fits_read_grppar_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffggp[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, long group, long firstelem, long nelements, > DTYPE *array, int *status) \end{verbatim} \begin{description} \item[8 ] Read 2-D or 3-D image from the data array. Undefined pixels in the array will be set equal to the value of 'nulval', unless nulval=0 in which case no testing for undefined pixels will be performed. \label{ffg2dx} \label{ffg3dx} \end{description} \begin{verbatim} int fits_read_2d_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffg2d[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, long group, DTYPE nulval, LONGLONG dim1, LONGLONG naxis1, LONGLONG naxis2, > DTYPE *array, int *anynul, int *status) int fits_read_3d_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffg3d[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, long group, DTYPE nulval, LONGLONG dim1, LONGLONG dim2, LONGLONG naxis1, LONGLONG naxis2, LONGLONG naxis3, > DTYPE *array, int *anynul, int *status) \end{verbatim} \begin{description} \item[9 ] Read an arbitrary data subsection from the data array. \label{ffgsvx} \label{ffgsfx} \end{description} \begin{verbatim} int fits_read_subset_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffgsv[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, int group, int naxis, long *naxes, long *fpixel, long *lpixel, long *inc, DTYPE nulval, > DTYPE *array, int *anynul, int *status) int fits_read_subsetnull_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffgsf[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, int group, int naxis, long *naxes, long *fpixel, long *lpixel, long *inc, > DTYPE *array, char *nullarray, int *anynul, int *status) \end{verbatim} \section{Specialized FITS ASCII and Binary Table Routines} \subsection{General Column Routines} \begin{description} \item[1 ] Get information about an existing ASCII or binary table column. A null pointer may be given for any of the output parameters that are not needed. DATATYPE is a character string which returns the data type of the column as defined by the TFORMn keyword (e.g., 'I', 'J','E', 'D', etc.). In the case of an ASCII character column, typecode will have a value of the form 'An' where 'n' is an integer expressing the width of the field in characters. For example, if TFORM = '160A8' then ffgbcl will return typechar='A8' and repeat=20. All the returned parameters are scalar quantities. \label{ffgacl} \label{ffgbcl} \end{description} \begin{verbatim} int fits_get_acolparms / ffgacl (fitsfile *fptr, int colnum, > char *ttype, long *tbcol, char *tunit, char *tform, double *scale, double *zero, char *nulstr, char *tdisp, int *status) int fits_get_bcolparms / ffgbcl (fitsfile *fptr, int colnum, > char *ttype, char *tunit, char *typechar, long *repeat, double *scale, double *zero, long *nulval, char *tdisp, int *status) int fits_get_bcolparmsll / ffgbclll (fitsfile *fptr, int colnum, > char *ttype, char *tunit, char *typechar, LONGLONG *repeat, double *scale, double *zero, LONGLONG *nulval, char *tdisp, int *status) \end{verbatim} \begin{description} \item[2 ] Return optimal number of rows to read or write at one time for maximum I/O efficiency. Refer to the ``Optimizing Code'' section in Chapter 5 for more discussion on how to use this routine. \label{ffgrsz} \end{description} \begin{verbatim} int fits_get_rowsize / ffgrsz (fitsfile *fptr, long *nrows, *status) \end{verbatim} \begin{description} \item[3 ] Define the zero indexed byte offset of the 'heap' measured from the start of the binary table data. By default the heap is assumed to start immediately following the regular table data, i.e., at location NAXIS1 x NAXIS2. This routine is only relevant for binary tables which contain variable length array columns (with TFORMn = 'Pt'). This routine also automatically writes the value of theap to a keyword in the extension header. This routine must be called after the required keywords have been written (with ffphbn) but before any data is written to the table. \label{ffpthp} \end{description} \begin{verbatim} int fits_write_theap / ffpthp (fitsfile *fptr, long theap, > int *status) \end{verbatim} \begin{description} \item[4 ] Test the contents of the binary table variable array heap, returning the size of the heap, the number of unused bytes that are not currently pointed to by any of the descriptors, and the number of bytes which are pointed to by multiple descriptors. It also returns valid = FALSE if any of the descriptors point to invalid addresses out of range of the heap. \label{fftheap} \end{description} \begin{verbatim} int fits_test_heap / fftheap (fitsfile *fptr, > LONGLONG *heapsize, LONGLONG *unused, LONGLONG *overlap, int *validheap, int *status) \end{verbatim} \begin{description} \item[5 ] Re-pack the vectors in the binary table variable array heap to recover any unused space. Normally, when a vector in a variable length array column is rewritten the previously written array remains in the heap as wasted unused space. This routine will repack the arrays that are still in use, thus eliminating any bytes in the heap that are no longer in use. Note that if several vectors point to the same bytes in the heap, then this routine will make duplicate copies of the bytes for each vector, which will actually expand the size of the heap. \label{ffcmph} \end{description} \begin{verbatim} int fits_compress_heap / ffcmph (fitsfile *fptr, > int *status) \end{verbatim} \subsection{Low-Level Table Access Routines} The following 2 routines provide low-level access to the data in ASCII or binary tables and are mainly useful as an efficient way to copy all or part of a table from one location to another. These routines simply read or write the specified number of consecutive bytes in an ASCII or binary table, without regard for column boundaries or the row length in the table. These routines do not perform any machine dependent data conversion or byte swapping. See Appendix B for the definition of the parameters used in these routines. \begin{description} \item[1 ] Read or write a consecutive array of bytes from an ASCII or binary table \label{ffgtbb} \label{ffptbb} \end{description} \begin{verbatim} int fits_read_tblbytes / ffgtbb (fitsfile *fptr, LONGLONG firstrow, LONGLONG firstchar, LONGLONG nchars, > unsigned char *values, int *status) int fits_write_tblbytes / ffptbb (fitsfile *fptr, LONGLONG firstrow, LONGLONG firstchar, LONGLONG nchars, unsigned char *values, > int *status) \end{verbatim} \subsection{Write Column Data Routines} \begin{description} \item[1 ] Write elements into an ASCII or binary table column (in the CDU). The data type of the array is implied by the suffix of the routine name. \label{ffpcls} \end{description} \begin{verbatim} int fits_write_col_str / ffpcls (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, char **array, > int *status) int fits_write_col_[log,byt,sht,usht,int,uint,lng,ulng,lnglng,ulnglng,flt,dbl,cmp,dblcmp] / ffpcl[l,b,i,ui,k,uk,j,uj,jj,ujj,e,d,c,m] (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, DTYPE *array, > int *status) \end{verbatim} \begin{description} \item[2 ] Write elements into an ASCII or binary table column substituting the appropriate FITS null value for any elements that are equal to the nulval parameter. \label{ffpcnx} \end{description} \begin{verbatim} int fits_write_colnull_[log, byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffpcn[l,b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, DTYPE *array, DTYPE nulval, > int *status) \end{verbatim} \begin{description} \item[3 ] Write string elements into a binary table column (in the CDU) substituting the FITS null value for any elements that are equal to the nulstr string. \label{ffpcns} \end{description} \begin{verbatim} int fits_write_colnull_str / ffpcns (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, char **array, char *nulstr, > int *status) \end{verbatim} \begin{description} \item[4 ] Write bit values into a binary byte ('B') or bit ('X') table column (in the CDU). Larray is an array of characters corresponding to the sequence of bits to be written. If an element of larray is true (not equal to zero) then the corresponding bit in the FITS table is set to 1, otherwise the bit is set to 0. The 'X' column in a FITS table is always padded out to a multiple of 8 bits where the bit array starts with the most significant bit of the byte and works down towards the 1's bit. For example, a '4X' array, with the first bit = 1 and the remaining 3 bits = 0 is equivalent to the 8-bit unsigned byte decimal value of 128 ('1000 0000B'). In the case of 'X' columns, CFITSIO can write to all 8 bits of each byte whether they are formally valid or not. Thus if the column is defined as '4X', and one calls ffpclx with firstbit=1 and nbits=8, then all 8 bits will be written into the first byte (as opposed to writing the first 4 bits into the first row and then the next 4 bits into the next row), even though the last 4 bits of each byte are formally not defined and should all be set = 0. It should also be noted that it is more efficient to write 'X' columns an entire byte at a time, instead of bit by bit. Any of the CFITSIO routines that write to columns (e.g. fits\_write\_col\_byt) may be used for this purpose. These routines will interpret 'X' columns as though they were 'B' columns (e.g., '1X' through '8X' is equivalent to '1B', and '9X' through '16X' is equivalent to '2B'). \label{ffpclx} \end{description} \begin{verbatim} int fits_write_col_bit / ffpclx (fitsfile *fptr, int colnum, LONGLONG firstrow, long firstbit, long nbits, char *larray, > int *status) \end{verbatim} \begin{description} \item[5 ] Write the descriptor for a variable length column in a binary table. This routine can be used in conjunction with ffgdes to enable 2 or more arrays to point to the same storage location to save storage space if the arrays are identical. \label{ffpdes} \end{description} \begin{verbatim} int fits_write_descript / ffpdes (fitsfile *fptr, int colnum, LONGLONG rownum, LONGLONG repeat, LONGLONG offset, > int *status) \end{verbatim} \subsection{Read Column Data Routines} Two types of routines are provided to get the column data which differ in the way undefined pixels are handled. The first set of routines (ffgcv) simply return an array of data elements in which undefined pixels are set equal to a value specified by the user in the 'nullval' parameter. If nullval = 0, then no checks for undefined pixels will be performed, thus increasing the speed of the program. The second set of routines (ffgcf) returns the data element array and in addition a logical array of flags which defines whether the corresponding data pixel is undefined. See Appendix B for the definition of the parameters used in these routines. Any column, regardless of it's intrinsic data type, may be read as a string. It should be noted however that reading a numeric column as a string is 10 - 100 times slower than reading the same column as a number due to the large overhead in constructing the formatted strings. The display format of the returned strings will be determined by the TDISPn keyword, if it exists, otherwise by the data type of the column. The length of the returned strings (not including the null terminating character) can be determined with the fits\_get\_col\_display\_width routine. The following TDISPn display formats are currently supported: \begin{verbatim} Iw.m Integer Ow.m Octal integer Zw.m Hexadecimal integer Fw.d Fixed floating point Ew.d Exponential floating point Dw.d Exponential floating point Gw.d General; uses Fw.d if significance not lost, else Ew.d \end{verbatim} where w is the width in characters of the displayed values, m is the minimum number of digits displayed, and d is the number of digits to the right of the decimal. The .m field is optional. \begin{description} \item[1 ] Read elements from an ASCII or binary table column (in the CDU). These routines return the values of the table column array elements. Undefined array elements will be returned with a value = nulval, unless nulval = 0 (or = ' ' for ffgcvs) in which case no checking for undefined values will be performed. The anynul parameter is set to true if any of the returned elements are undefined. \label{ffgcvx} \end{description} \begin{verbatim} int fits_read_col_str / ffgcvs (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, char *nulstr, > char **array, int *anynul, int *status) int fits_read_col_[log,byt,sht,usht,int,uint,lng,ulng, lnglng, ulnglng, flt, dbl, cmp, dblcmp] / ffgcv[l,b,i,ui,k,uk,j,uj,jj,ujj,e,d,c,m] (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, DTYPE nulval, > DTYPE *array, int *anynul, int *status) \end{verbatim} \begin{description} \item[2 ] Read elements and null flags from an ASCII or binary table column (in the CHDU). These routines return the values of the table column array elements. Any undefined array elements will have the corresponding nullarray element set equal to TRUE. The anynul parameter is set to true if any of the returned elements are undefined. \label{ffgcfx} \end{description} \begin{verbatim} int fits_read_colnull_str / ffgcfs (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, > char **array, char *nullarray, int *anynul, int *status) int fits_read_colnull_[log,byt,sht,usht,int,uint,lng,ulng,lnglng,ulnglng,flt,dbl,cmp,dblcmp] / ffgcf[l,b,i,ui,k,uk,j,uj,jj,ujj,e,d,c,m] (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstelem, LONGLONG nelements, > DTYPE *array, char *nullarray, int *anynul, int *status) \end{verbatim} \begin{description} \item[3 ] Read an arbitrary data subsection from an N-dimensional array in a binary table vector column. Undefined pixels in the array will be set equal to the value of 'nulval', unless nulval=0 in which case no testing for undefined pixels will be performed. The first and last rows in the table to be read are specified by fpixel(naxis+1) and lpixel(naxis+1), and hence are treated as the next higher dimension of the FITS N-dimensional array. The INC parameter specifies the sampling interval in each dimension between the data elements that will be returned. \label{ffgsvx2} \end{description} \begin{verbatim} int fits_read_subset_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffgsv[b,i,ui,k,uk,j,uj,jj,ull,e,d] (fitsfile *fptr, int colnum, int naxis, long *naxes, long *fpixel, long *lpixel, long *inc, DTYPE nulval, > DTYPE *array, int *anynul, int *status) \end{verbatim} \begin{description} \item[4 ] Read an arbitrary data subsection from an N-dimensional array in a binary table vector column. Any Undefined pixels in the array will have the corresponding 'nullarray' element set equal to TRUE. The first and last rows in the table to be read are specified by fpixel(naxis+1) and lpixel(naxis+1), and hence are treated as the next higher dimension of the FITS N-dimensional array. The INC parameter specifies the sampling interval in each dimension between the data elements that will be returned. \label{ffgsfx2} \end{description} \begin{verbatim} int fits_read_subsetnull_[byt, sht, usht, int, uint, lng, ulng, lnglng, ulnglng, flt, dbl] / ffgsf[b,i,ui,k,uk,j,uj,jj,ujj,e,d] (fitsfile *fptr, int colnum, int naxis, long *naxes, long *fpixel, long *lpixel, long *inc, > DTYPE *array, char *nullarray, int *anynul, int *status) \end{verbatim} \begin{description} \item[5 ] Read bit values from a byte ('B') or bit (`X`) table column (in the CDU). Larray is an array of logical values corresponding to the sequence of bits to be read. If larray is true then the corresponding bit was set to 1, otherwise the bit was set to 0. The 'X' column in a FITS table is always padded out to a multiple of 8 bits where the bit array starts with the most significant bit of the byte and works down towards the 1's bit. For example, a '4X' array, with the first bit = 1 and the remaining 3 bits = 0 is equivalent to the 8-bit unsigned byte value of 128. Note that in the case of 'X' columns, CFITSIO can read all 8 bits of each byte whether they are formally valid or not. Thus if the column is defined as '4X', and one calls ffgcx with firstbit=1 and nbits=8, then all 8 bits will be read from the first byte (as opposed to reading the first 4 bits from the first row and then the first 4 bits from the next row), even though the last 4 bits of each byte are formally not defined. It should also be noted that it is more efficient to read 'X' columns an entire byte at a time, instead of bit by bit. Any of the CFITSIO routines that read columns (e.g. fits\_read\_col\_byt) may be used for this purpose. These routines will interpret 'X' columns as though they were 'B' columns (e.g., '8X' is equivalent to '1B', and '16X' is equivalent to '2B'). \label{ffgcx} \end{description} \begin{verbatim} int fits_read_col_bit / ffgcx (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG firstbit, LONGLONG nbits, > char *larray, int *status) \end{verbatim} \begin{description} \item[6 ] Read any consecutive set of bits from an 'X' or 'B' column and interpret them as an unsigned n-bit integer. nbits must be less than 16 or 32 in ffgcxui and ffgcxuk, respectively. If nrows is greater than 1, then the same set of bits will be read from each row, starting with firstrow. The bits are numbered with 1 = the most significant bit of the first element of the column. \label{ffgcxui} \end{description} \begin{verbatim} int fits_read_col_bit_[usht, uint] / ffgcx[ui,uk] (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG, nrows, long firstbit, long nbits, > DTYPE *array, int *status) \end{verbatim} \begin{description} \item[7 ] Return the descriptor for a variable length column in a binary table. The descriptor consists of 2 integer parameters: the number of elements in the array and the starting offset relative to the start of the heap. The first pair of routine returns a single descriptor whereas the second pair of routine returns the descriptors for a range of rows in the table. The only difference between the 2 routines in each pair is that one returns the parameters as 'long' integers, whereas the other returns the values as 64-bit 'LONGLONG' integers. \label{ffgdes} \end{description} \begin{verbatim} int fits_read_descript / ffgdes (fitsfile *fptr, int colnum, LONGLONG rownum, > long *repeat, long *offset, int *status) int fits_read_descriptll / ffgdesll (fitsfile *fptr, int colnum, LONGLONG rownum, > LONGLONG *repeat, LONGLONG *offset, int *status) int fits_read_descripts / ffgdess (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG nrows > long *repeat, long *offset, int *status) int fits_read_descriptsll / ffgdessll (fitsfile *fptr, int colnum, LONGLONG firstrow, LONGLONG nrows > LONGLONG *repeat, LONGLONG *offset, int *status) \end{verbatim} \chapter{ Extended File Name Syntax } \section{Overview} CFITSIO supports an extended syntax when specifying the name of the data file to be opened or created that includes the following features: \begin{itemize} \item CFITSIO can read IRAF format images which have header file names that end with the '.imh' extension, as well as reading and writing FITS files, This feature is implemented in CFITSIO by first converting the IRAF image into a temporary FITS format file in memory, then opening the FITS file. Any of the usual CFITSIO routines then may be used to read the image header or data. Similarly, raw binary data arrays can be read by converting them on the fly into virtual FITS images. \item FITS files on the Internet can be read (and sometimes written) using the FTP, HTTP, HTTPS, FTPS, or ROOT protocols. \item FITS files can be piped between tasks on the stdin and stdout streams. \item FITS files can be read and written in shared memory. This can potentially achieve better data I/O performance compared to reading and writing the same FITS files on magnetic disk. \item Compressed FITS files in gzip or Unix COMPRESS format can be directly read. \item Output FITS files can be written directly in compressed gzip format, thus saving disk space. \item FITS table columns can be created, modified, or deleted 'on-the-fly' as the table is opened by CFITSIO. This creates a virtual FITS file containing the modifications that is then opened by the application program. \item Table rows may be selected, or filtered out, on the fly when the table is opened by CFITSIO, based on an user-specified expression. Only rows for which the expression evaluates to 'TRUE' are retained in the copy of the table that is opened by the application program. \item Histogram images may be created on the fly by binning the values in table columns, resulting in a virtual N-dimensional FITS image. The application program then only sees the FITS image (in the primary array) instead of the original FITS table. \end{itemize} The latter 3 table filtering features in particular add very powerful data processing capabilities directly into CFITSIO, and hence into every task that uses CFITSIO to read or write FITS files. For example, these features transform a very simple program that just copies an input FITS file to a new output file (like the `fitscopy' program that is distributed with CFITSIO) into a multipurpose FITS file processing tool. By appending fairly simple qualifiers onto the name of the input FITS file, the user can perform quite complex table editing operations (e.g., create new columns, or filter out rows in a table) or create FITS images by binning or histogramming the values in table columns. In addition, these functions have been coded using new state-of-the art algorithms that are, in some cases, 10 - 100 times faster than previous widely used implementations. Before describing the complete syntax for the extended FITS file names in the next section, here are a few examples of FITS file names that give a quick overview of the allowed syntax: \begin{itemize} \item {\tt myfile.fits}: the simplest case of a FITS file on disk in the current directory. \item {\tt myfile.imh}: opens an IRAF format image file and converts it on the fly into a temporary FITS format image in memory which can then be read with any other CFITSIO routine. \item {\tt rawfile.dat[i512,512]}: opens a raw binary data array (a 512 x 512 short integer array in this case) and converts it on the fly into a temporary FITS format image in memory which can then be read with any other CFITSIO routine. \item {\tt myfile.fits.gz}: if this is the name of a new output file, the '.gz' suffix will cause it to be compressed in gzip format when it is written to disk. \item {\tt myfile.fits.gz[events, 2]}: opens and uncompresses the gzipped file myfile.fits then moves to the extension with the keywords EXTNAME = 'EVENTS' and EXTVER = 2. \item {\tt -}: a dash (minus sign) signifies that the input file is to be read from the stdin file stream, or that the output file is to be written to the stdout stream. See also the stream:// driver which provides a more efficient, but more restricted method of reading or writing to the stdin or stdout streams. \item {\tt ftp://legacy.gsfc.nasa.gov/test/vela.fits}: FITS files in any ftp archive site on the Internet may be directly opened with read-only access. \item {\tt http://legacy.gsfc.nasa.gov/software/test.fits}: any valid URL to a FITS file on the Web may be opened with read-only access. \item {\tt root://legacy.gsfc.nasa.gov/test/vela.fits}: similar to ftp access except that it provides write as well as read access to the files across the network. This uses the root protocol developed at CERN. \item {\tt shmem://h2[events]}: opens the FITS file in a shared memory segment and moves to the EVENTS extension. \item {\tt mem://}: creates a scratch output file in core computer memory. The resulting 'file' will disappear when the program exits, so this is mainly useful for testing purposes when one does not want a permanent copy of the output file. \item {\tt myfile.fits[3; Images(10)]}: opens a copy of the image contained in the 10th row of the 'Images' column in the binary table in the 3th extension of the FITS file. The virtual file that is opened by the application just contains this single image in the primary array. \item {\tt myfile.fits[1:512:2, 1:512:2]}: opens a section of the input image ranging from the 1st to the 512th pixel in X and Y, and selects every second pixel in both dimensions, resulting in a 256 x 256 pixel input image in this case. \item {\tt myfile.fits[EVENTS][col Rad = sqrt(X**2 + Y**2)]}: creates and opens a virtual file on the fly that is identical to myfile.fits except that it will contain a new column in the EVENTS extension called 'Rad' whose value is computed using the indicated expression which is a function of the values in the X and Y columns. \item {\tt myfile.fits[EVENTS][PHA > 5]}: creates and opens a virtual FITS files that is identical to 'myfile.fits' except that the EVENTS table will only contain the rows that have values of the PHA column greater than 5. In general, any arbitrary boolean expression using a C or Fortran-like syntax, which may combine AND and OR operators, may be used to select rows from a table. \item {\tt myfile.fits[EVENTS][bin (X,Y)=1,2048,4]}: creates a temporary FITS primary array image which is computed on the fly by binning (i.e, computing the 2-dimensional histogram) of the values in the X and Y columns of the EVENTS extension. In this case the X and Y coordinates range from 1 to 2048 and the image pixel size is 4 units in both dimensions, so the resulting image is 512 x 512 pixels in size. \item The final example combines many of these feature into one complex expression (it is broken into several lines for clarity): \begin{verbatim} ftp://legacy.gsfc.nasa.gov/data/sample.fits.gz[EVENTS] [col phacorr = pha * 1.1 - 0.3][phacorr >= 5.0 && phacorr <= 14.0] [bin (X,Y)=32] \end{verbatim} In this case, CFITSIO (1) copies and uncompresses the FITS file from the ftp site on the legacy machine, (2) moves to the 'EVENTS' extension, (3) calculates a new column called 'phacorr', (4) selects the rows in the table that have phacorr in the range 5 to 14, and finally (5) bins the remaining rows on the X and Y column coordinates, using a pixel size = 32 to create a 2D image. All this processing is completely transparent to the application program, which simply sees the final 2-D image in the primary array of the opened file. \end{itemize} The full extended CFITSIO FITS file name can contain several different components depending on the context. These components are described in the following sections: \begin{verbatim} When creating a new file: filetype://BaseFilename(templateName)[compress] When opening an existing primary array or image HDU: filetype://BaseFilename(outName)[HDUlocation][ImageSection][pixFilter] When opening an existing table HDU: filetype://BaseFilename(outName)[HDUlocation][colFilter][rowFilter][binSpec] \end{verbatim} The filetype, BaseFilename, outName, HDUlocation, ImageSection, and pixFilter components, if present, must be given in that order, but the colFilter, rowFilter, and binSpec specifiers may follow in any order. Regardless of the order, however, the colFilter specifier, if present, will be processed first by CFITSIO, followed by the rowFilter specifier, and finally by the binSpec specifier. \section{Filetype} The type of file determines the medium on which the file is located (e.g., disk or network) and, hence, which internal device driver is used by CFITSIO to read and/or write the file. Currently supported types are \begin{verbatim} file:// - file on local magnetic disk (default) ftp:// - a readonly file accessed with the anonymous FTP protocol. It also supports ftp://username:password@hostname/... for accessing password-protected ftp sites. http:// - a readonly file accessed with the HTTP protocol. It supports username:password just like the ftp driver. Proxy HTTP servers are supported using the http_proxy environment variable (see following note). https:// - a readonly file accessed with the HTTPS protocol. This is available only if CFITSIO was built with the libcurl library (see the following note). ftps:// - a readonly file accessed with the FTPS protocol. This is available only if CFITSIO was built with the libcurl library. stream:// - special driver to read an input FITS file from the stdin stream, and/or write an output FITS file to the stdout stream. This driver is fragile and has limited functionality (see the following note). gsiftp:// - access files on a computational grid using the gridftp protocol in the Globus toolkit (see following note). root:// - uses the CERN root protocol for writing as well as reading files over the network (see following note). shmem:// - opens or creates a file which persists in the computer's shared memory (see following note). mem:// - opens a temporary file in core memory. The file disappears when the program exits so this is mainly useful for test purposes when a permanent output file is not desired. \end{verbatim} If the filetype is not specified, then type file:// is assumed. The double slashes '//' are optional and may be omitted in most cases. \subsection{Notes about HTTP proxy servers} A proxy HTTP server may be used by defining the address (URL) and port number of the proxy server with the http\_proxy environment variable. For example \begin{verbatim} setenv http_proxy http://heasarc.gsfc.nasa.gov:3128 \end{verbatim} will cause CFITSIO to use port 3128 on the heasarc proxy server whenever reading a FITS file with HTTP. \subsection{Notes about HTTPS and FTPS file access} CFITSIO depends upon the availability of the libcurl library in order to perform HTTPS/FTPS file access. (This should be the development version of the library, as it contains the curl.h header file required by the CFITSIO code.) The CFITSIO 'configure' script will search for this library on your system, and if it finds it it will automatically be incorporated into the build. Note that if you have this library package on your system, you will also have the 'curl-config' executable. You can run the 'curl-config' executable with various options to learn more about the features of your libcurl installation. If the CFITSIO 'configure' succeeded in finding a usable libcurl, you will see the flag '-DCFITSIO\_HAVE\_CURL=1' in the CFITSIO Makefile and in the compilation output. If 'configure' is unable to find a usable libcurl, CFITSIO will still build but it won't have HTTPS/FTPS capability. The libcurl package is normally included as part of Xcode on Macs. However on Linux platforms you may need to manually install it. This can be easily done on Ubuntu Linux using the 'apt get' command to retrieve the libcurl4-openssl-dev or the libcurl4-gnutls-dev packages. When accessing a file with HTTPS or FTPS, the default CFITSIO behavior is to attempt to verify both the host name and the SSL certificate. If it cannot, it will still perform the file access but will issue a warning to the terminal window. The user can override this behavior to force CFITSIO to only allow file transfers when the host name and SSL certificate have been successfully verified. This is done by setting the CFITSIO\_VERIFY\_HTTPS environment variable to 'True'. ie. in a csh shell: setenv CFITSIO\_VERIFY\_HTTPS True the default setting for this is 'False'. CFITSIO has 3 functions which apply specifically to HTTPS/FTPS access: fits\_init\_https, fits\_cleanup\_https, and fits\_verbose\_https. It is recommended that you call the init and cleanup functions near the beginning and end of your program respectively. For more information about these functions, please see the 'FITS File Access Routines' section in the preceding chapter ('Specialized CFITSIO Interface Routines'). \subsection{Notes about the stream filetype driver} The stream driver can be used to efficiently read a FITS file from the stdin file stream or write a FITS to the stdout file stream. However, because these input and output streams must be accessed sequentially, the FITS file reading or writing application must also read and write the file sequentially, at least within the tolerances described below. CFITSIO supports 2 different methods for accessing FITS files on the stdin and stdout streams. The original method, which is invoked by specifying a dash character, "-", as the name of the file when opening or creating it, works by storing a complete copy of the entire FITS file in memory. In this case, when reading from stdin, CFITSIO will copy the entire stream into memory before doing any processing of the file. Similarly, when writing to stdout, CFITSIO will create a copy of the entire FITS file in memory, before finally flushing it out to the stdout stream when the FITS file is closed. Buffering the entire FITS file in this way allows the application to randomly access any part of the FITS file, in any order, but it also requires that the user have sufficient available memory (or virtual memory) to store the entire file, which may not be possible in the case of very large files. The newer stream filetype provides a more memory-efficient method of accessing FITS files on the stdin or stdout streams. Instead of storing a copy of the entire FITS file in memory, CFITSIO only uses a set of internal buffer which by default can store 40 FITS blocks, or about 100K bytes of the FITS file. The application program must process the FITS file sequentially from beginning to end, within this 100K buffer. Generally speaking the application program must conform to the following restrictions: \begin{itemize} \item The program must finish reading or writing the header keywords before reading or writing any data in the HDU. \item The HDU can contain at most about 1400 header keywords. This is the maximum that can fit in the nominal 40 FITS block buffer. In principle, this limit could be increased by recompiling CFITSIO with a larger buffer limit, which is set by the NIOBUF parameter in fitsio2.h. \item The program must read or write the data in a sequential manner from the beginning to the end of the HDU. Note that CFITSIO's internal 100K buffer allows a little latitude in meeting this requirement. \item The program cannot move back to a previous HDU in the FITS file. \item Reading or writing of variable length array columns in binary tables is not supported on streams, because this requires moving back and forth between the fixed-length portion of the binary table and the following heap area where the arrays are actually stored. \item Reading or writing of tile-compressed images is not supported on streams, because the images are internally stored using variable length arrays. \end{itemize} \subsection{Notes about the gsiftp filetype} DEPENDENCIES: Globus toolkit (2.4.3 or higher) (GT) should be installed. There are two different ways to install GT: 1) goto the globus toolkit web page www.globus.org and follow the download and compilation instructions; 2) goto the Virtual Data Toolkit web page http://vdt.cs.wisc.edu/ and follow the instructions (STRONGLY SUGGESTED); Once a globus client has been installed in your system with a specific flavour it is possible to compile and install the CFITSIO libraries. Specific configuration flags must be used: 1) --with-gsiftp[[=PATH]] Enable Globus Toolkit gsiftp protocol support PATH=GLOBUS\_LOCATION i.e. the location of your globus installation 2) --with-gsiftp-flavour[[=PATH] defines the specific Globus flavour ex. gcc32 Both the flags must be used and it is mandatory to set both the PATH and the flavour. USAGE: To access files on a gridftp server it is necessary to use a gsiftp prefix: example: gsiftp://remote\_server\_fqhn/directory/filename The gridftp driver uses a local buffer on a temporary file the file is located in the /tmp directory. If you have special permissions on /tmp or you do not have a /tmp directory, it is possible to force another location setting the GSIFTP\_TMPFILE environment variable (ex. export GSIFTP\_TMPFILE=/your/location/yourtmpfile). Grid FTP supports multi channel transfer. By default a single channel transmission is available. However, it is possible to modify this behavior setting the GSIFTP\_STREAMS environment variable (ex. export GSIFTP\_STREAMS=8). \subsection{Notes about the root filetype} The original rootd server can be obtained from: \verb-ftp://root.cern.ch/root/rootd.tar.gz- but, for it to work correctly with CFITSIO one has to use a modified version which supports a command to return the length of the file. This modified version is available in rootd subdirectory in the CFITSIO ftp area at \begin{verbatim} ftp://legacy.gsfc.nasa.gov/software/fitsio/c/root/rootd.tar.gz. \end{verbatim} This small server is started either by inetd when a client requests a connection to a rootd server or by hand (i.e. from the command line). The rootd server works with the ROOT TNetFile class. It allows remote access to ROOT database files in either read or write mode. By default TNetFile assumes port 432 (which requires rootd to be started as root). To run rootd via inetd add the following line to /etc/services: \begin{verbatim} rootd 432/tcp \end{verbatim} and to /etc/inetd.conf, add the following line: \begin{verbatim} rootd stream tcp nowait root /user/rdm/root/bin/rootd rootd -i \end{verbatim} Force inetd to reread its conf file with \verb+kill -HUP +. You can also start rootd by hand running directly under your private account (no root system privileges needed). For example to start rootd listening on port 5151 just type: \verb+rootd -p 5151+ Notice that no \& is needed. Rootd will go into background by itself. \begin{verbatim} Rootd arguments: -i says we were started by inetd -p port# specifies a different port to listen on -d level level of debug info written to syslog 0 = no debug (default) 1 = minimum 2 = medium 3 = maximum \end{verbatim} Rootd can also be configured for anonymous usage (like anonymous ftp). To setup rootd to accept anonymous logins do the following (while being logged in as root): \begin{verbatim} - Add the following line to /etc/passwd: rootd:*:71:72:Anonymous rootd:/var/spool/rootd:/bin/false where you may modify the uid, gid (71, 72) and the home directory to suite your system. - Add the following line to /etc/group: rootd:*:72:rootd where the gid must match the gid in /etc/passwd. - Create the directories: mkdir /var/spool/rootd mkdir /var/spool/rootd/tmp chmod 777 /var/spool/rootd/tmp Where /var/spool/rootd must match the rootd home directory as specified in the rootd /etc/passwd entry. - To make writeable directories for anonymous do, for example: mkdir /var/spool/rootd/pub chown rootd:rootd /var/spool/rootd/pub \end{verbatim} That's all. Several additional remarks: you can login to an anonymous server either with the names "anonymous" or "rootd". The password should be of type user@host.do.main. Only the @ is enforced for the time being. In anonymous mode the top of the file tree is set to the rootd home directory, therefore only files below the home directory can be accessed. Anonymous mode only works when the server is started via inetd. \subsection{Notes about the shmem filetype:} Shared memory files are currently supported on most Unix platforms, where the shared memory segments are managed by the operating system kernel and `live' independently of processes. They are not deleted (by default) when the process which created them terminates, although they will disappear if the system is rebooted. Applications can create shared memory files in CFITSIO by calling: \begin{verbatim} fit_create_file(&fitsfileptr, "shmem://h2", &status); \end{verbatim} where the root `file' names are currently restricted to be 'h0', 'h1', 'h2', 'h3', etc., up to a maximum number defined by the the value of SHARED\_MAXSEG (equal to 16 by default). This is a prototype implementation of the shared memory interface and a more robust interface, which will have fewer restrictions on the number of files and on their names, may be developed in the future. When opening an already existing FITS file in shared memory one calls the usual CFITSIO routine: \begin{verbatim} fits_open_file(&fitsfileptr, "shmem://h7", mode, &status) \end{verbatim} The file mode can be READWRITE or READONLY just as with disk files. More than one process can operate on READONLY mode files at the same time. CFITSIO supports proper file locking (both in READONLY and READWRITE modes), so calls to fits\_open\_file may be locked out until another other process closes the file. When an application is finished accessing a FITS file in a shared memory segment, it may close it (and the file will remain in the system) with fits\_close\_file, or delete it with fits\_delete\_file. Physical deletion is postponed until the last process calls ffclos/ffdelt. fits\_delete\_file tries to obtain a READWRITE lock on the file to be deleted, thus it can be blocked if the object was not opened in READWRITE mode. A shared memory management utility program called `smem', is included with the CFITSIO distribution. It can be built by typing `make smem'; then type `smem -h' to get a list of valid options. Executing smem without any options causes it to list all the shared memory segments currently residing in the system and managed by the shared memory driver. To get a list of all the shared memory objects, run the system utility program `ipcs [-a]'. \section{Base Filename} The base filename is the name of the file optionally including the director/subdirectory path, and in the case of `ftp', `http', and `root' filetypes, the machine identifier. Examples: \begin{verbatim} myfile.fits !data.fits /data/myfile.fits fits.gsfc.nasa.gov/ftp/sampledata/myfile.fits.gz \end{verbatim} When creating a new output file on magnetic disk (of type file://) if the base filename begins with an exclamation point (!) then any existing file with that same basename will be deleted prior to creating the new FITS file. Otherwise if the file to be created already exists, then CFITSIO will return an error and will not overwrite the existing file. Note that the exclamation point, '!', is a special UNIX character, so if it is used on the command line rather than entered at a task prompt, it must be preceded by a backslash to force the UNIX shell to pass it verbatim to the application program. If the output disk file name ends with the suffix '.gz', then CFITSIO will compress the file using the gzip compression algorithm before writing it to disk. This can reduce the amount of disk space used by the file. Note that this feature requires that the uncompressed file be constructed in memory before it is compressed and written to disk, so it can fail if there is insufficient available memory. An input FITS file may be compressed with the gzip or Unix compress algorithms, in which case CFITSIO will uncompress the file on the fly into a temporary file (in memory or on disk). Compressed files may only be opened with read-only permission. When specifying the name of a compressed FITS file it is not necessary to append the file suffix (e.g., `.gz' or `.Z'). If CFITSIO cannot find the input file name without the suffix, then it will automatically search for a compressed file with the same root name. In the case of reading ftp and http type files, CFITSIO generally looks for a compressed version of the file first, before trying to open the uncompressed file. By default, CFITSIO copies (and uncompressed if necessary) the ftp or http FITS file into memory on the local machine before opening it. This will fail if the local machine does not have enough memory to hold the whole FITS file, so in this case, the output filename specifier (see the next section) can be used to further control how CFITSIO reads ftp and http files. If the input file is an IRAF image file (*.imh file) then CFITSIO will automatically convert it on the fly into a virtual FITS image before it is opened by the application program. IRAF images can only be opened with READONLY file access. Similarly, if the input file is a raw binary data array, then CFITSIO will convert it on the fly into a virtual FITS image with the basic set of required header keywords before it is opened by the application program (with READONLY access). In this case the data type and dimensions of the image must be specified in square brackets following the filename (e.g. rawfile.dat[ib512,512]). The first character (case insensitive) defines the data type of the array: \begin{verbatim} b 8-bit unsigned byte i 16-bit signed integer u 16-bit unsigned integer j 32-bit signed integer r or f 32-bit floating point d 64-bit floating point \end{verbatim} An optional second character specifies the byte order of the array values: b or B indicates big endian (as in FITS files and the native format of SUN UNIX workstations and Mac PCs) and l or L indicates little endian (native format of DEC OSF workstations and IBM PCs). If this character is omitted then the array is assumed to have the native byte order of the local machine. These data type characters are then followed by a series of one or more integer values separated by commas which define the size of each dimension of the raw array. Arrays with up to 5 dimensions are currently supported. Finally, a byte offset to the position of the first pixel in the data file may be specified by separating it with a ':' from the last dimension value. If omitted, it is assumed that the offset = 0. This parameter may be used to skip over any header information in the file that precedes the binary data. Further examples: \begin{verbatim} raw.dat[b10000] 1-dimensional 10000 pixel byte array raw.dat[rb400,400,12] 3-dimensional floating point big-endian array img.fits[ib512,512:2880] reads the 512 x 512 short integer array in a FITS file, skipping over the 2880 byte header \end{verbatim} One special case of input file is where the filename = `-' (a dash or minus sign) or 'stdin' or 'stdout', which signifies that the input file is to be read from the stdin stream, or written to the stdout stream if a new output file is being created. In the case of reading from stdin, CFITSIO first copies the whole stream into a temporary FITS file (in memory or on disk), and subsequent reading of the FITS file occurs in this copy. When writing to stdout, CFITSIO first constructs the whole file in memory (since random access is required), then flushes it out to the stdout stream when the file is closed. In addition, if the output filename = '-.gz' or 'stdout.gz' then it will be gzip compressed before being written to stdout. This ability to read and write on the stdin and stdout steams allows FITS files to be piped between tasks in memory rather than having to create temporary intermediate FITS files on disk. For example if task1 creates an output FITS file, and task2 reads an input FITS file, the FITS file may be piped between the 2 tasks by specifying \begin{verbatim} task1 - | task2 - \end{verbatim} where the vertical bar is the Unix piping symbol. This assumes that the 2 tasks read the name of the FITS file off of the command line. \section{Output File Name when Opening an Existing File} An optional output filename may be specified in parentheses immediately following the base file name to be opened. This is mainly useful in those cases where CFITSIO creates a temporary copy of the input FITS file before it is opened and passed to the application program. This happens by default when opening a network FTP or HTTP-type file, when reading a compressed FITS file on a local disk, when reading from the stdin stream, or when a column filter, row filter, or binning specifier is included as part of the input file specification. By default this temporary file is created in memory. If there is not enough memory to create the file copy, then CFITSIO will exit with an error. In these cases one can force a permanent file to be created on disk, instead of a temporary file in memory, by supplying the name in parentheses immediately following the base file name. The output filename can include the '!' clobber flag. Thus, if the input filename to CFITSIO is: \verb+file1.fits.gz(file2.fits)+ then CFITSIO will uncompress `file1.fits.gz' into the local disk file `file2.fits' before opening it. CFITSIO does not automatically delete the output file, so it will still exist after the application program exits. The output filename "mem://" is also allowed, which will write the output file into memory, and also allow write access to the file. This 'file' will disappear when it is closed, but this may be useful for some applications which only need to modify a temporary copy of the file. In some cases, several different temporary FITS files will be created in sequence, for instance, if one opens a remote file using FTP, then filters rows in a binary table extension, then create an image by binning a pair of columns. In this case, the remote file will be copied to a temporary local file, then a second temporary file will be created containing the filtered rows of the table, and finally a third temporary file containing the binned image will be created. In cases like this where multiple files are created, the outfile specifier will be interpreted the name of the final file as described below, in descending priority: \begin{itemize} \item as the name of the final image file if an image within a single binary table cell is opened or if an image is created by binning a table column. \item as the name of the file containing the filtered table if a column filter and/or a row filter are specified. \item as the name of the local copy of the remote FTP or HTTP file. \item as the name of the uncompressed version of the FITS file, if a compressed FITS file on local disk has been opened. \item otherwise, the output filename is ignored. \end{itemize} The output file specifier is useful when reading FTP or HTTP-type FITS files since it can be used to create a local disk copy of the file that can be reused in the future. If the output file name = `*' then a local file with the same name as the network file will be created. Note that CFITSIO will behave differently depending on whether the remote file is compressed or not as shown by the following examples: \begin{itemize} \item \verb+ftp://remote.machine/tmp/myfile.fits.gz(*)+ - the remote compressed file is copied to the local compressed file `myfile.fits.gz', which is then uncompressed in local memory before being opened and passed to the application program. \item \verb+ftp://remote.machine/tmp/myfile.fits.gz(myfile.fits)+ - the remote compressed file is copied and uncompressed into the local file `myfile.fits'. This example requires less local memory than the previous example since the file is uncompressed on disk instead of in memory. \item \verb+ftp://remote.machine/tmp/myfile.fits(myfile.fits.gz)+ - this will usually produce an error since CFITSIO itself cannot compress files. \end{itemize} The exact behavior of CFITSIO in the latter case depends on the type of ftp server running on the remote machine and how it is configured. In some cases, if the file `myfile.fits.gz' exists on the remote machine, then the server will copy it to the local machine. In other cases the ftp server will automatically create and transmit a compressed version of the file if only the uncompressed version exists. This can get rather confusing, so users should use a certain amount of caution when using the output file specifier with FTP or HTTP file types, to make sure they get the behavior that they expect. \section{Template File Name when Creating a New File} When a new FITS file is created with a call to fits\_create\_file, the name of a template file may be supplied in parentheses immediately following the name of the new file to be created. This template is used to define the structure of one or more HDUs in the new file. The template file may be another FITS file, in which case the newly created file will have exactly the same keywords in each HDU as in the template FITS file, but all the data units will be filled with zeros. The template file may also be an ASCII text file, where each line (in general) describes one FITS keyword record. The format of the ASCII template file is described in the following Template Files chapter. \section{Image Tile-Compression Specification} When specifying the name of the output FITS file to be created, the user can indicate that images should be written in tile-compressed format (see section 5.5, ``Primary Array or IMAGE Extension I/O Routines'') by enclosing the compression parameters in square brackets following the root disk file name. Here are some examples of the syntax for specifying tile-compressed output images: \begin{verbatim} myfile.fit[compress] - use Rice algorithm and default tile size myfile.fit[compress GZIP] - use the specified compression algorithm; myfile.fit[compress Rice] only the first letter of the algorithm myfile.fit[compress PLIO] name is required. myfile.fit[compress Rice 100,100] - use 100 x 100 pixel tile size myfile.fit[compress Rice 100,100;2] - as above, and use noisebits = 2 \end{verbatim} \section{HDU Location Specification} The optional HDU location specifier defines which HDU (Header-Data Unit, also known as an `extension') within the FITS file to initially open. It must immediately follow the base file name (or the output file name if present). If it is not specified then the first HDU (the primary array) is opened. The HDU location specifier is required if the colFilter, rowFilter, or binSpec specifiers are present, because the primary array is not a valid HDU for these operations. The HDU may be specified either by absolute position number, starting with 0 for the primary array, or by reference to the HDU name, and optionally, the version number and the HDU type of the desired extension. The location of an image within a single cell of a binary table may also be specified, as described below. The absolute position of the extension is specified either by enclosed the number in square brackets (e.g., `[1]' = the first extension following the primary array) or by preceded the number with a plus sign (`+1'). To specify the HDU by name, give the name of the desired HDU (the value of the EXTNAME or HDUNAME keyword) and optionally the extension version number (value of the EXTVER keyword) and the extension type (value of the XTENSION keyword: IMAGE, ASCII or TABLE, or BINTABLE), separated by commas and all enclosed in square brackets. If the value of EXTVER and XTENSION are not specified, then the first extension with the correct value of EXTNAME is opened. The extension name and type are not case sensitive, and the extension type may be abbreviated to a single letter (e.g., I = IMAGE extension or primary array, A or T = ASCII table extension, and B = binary table BINTABLE extension). If the HDU location specifier is equal to `[PRIMARY]' or `[P]', then the primary array (the first HDU) will be opened. An optional pound sign character ("\#") may be appended to the extension name or number to signify that any other extensions in the file should be ignored during any subsequent file filtering operations. For example, when doing row filtering operations on a table extension, CFITSIO normally creates a copy of the filtered table in memory, along with a verbatim copy of all the other extensions in the input FITS file. If the pound sign is appended to the table extension name, then only that extension, and none of the other extensions in the file, will by copied to memory, as in the following example: \begin{verbatim} myfile.fit[events#][TIME > 10000] \end{verbatim} FITS images are most commonly stored in the primary array or an image extension, but images can also be stored as a vector in a single cell of a binary table (i.e. each row of the vector column contains a different image). Such an image can be opened with CFITSIO by specifying the desired column name and the row number after the binary table HDU specifier as shown in the following examples. The column name is separated from the HDU specifier by a semicolon and the row number is enclosed in parentheses. In this case CFITSIO copies the image from the table cell into a temporary primary array before it is opened. The application program then just sees the image in the primary array, without any extensions. The particular row to be opened may be specified either by giving an absolute integer row number (starting with 1 for the first row), or by specifying a boolean expression that evaluates to TRUE for the desired row. The first row that satisfies the expression will be used. The row selection expression has the same syntax as described in the Row Filter Specifier section, below. Examples: \begin{verbatim} myfile.fits[3] - open the 3rd HDU following the primary array myfile.fits+3 - same as above, but using the FTOOLS-style notation myfile.fits[EVENTS] - open the extension that has EXTNAME = 'EVENTS' myfile.fits[EVENTS, 2] - same as above, but also requires EXTVER = 2 myfile.fits[events,2,b] - same, but also requires XTENSION = 'BINTABLE' myfile.fits[3; images(17)] - opens the image in row 17 of the 'images' column in the 3rd extension of the file. myfile.fits[3; images(exposure > 100)] - as above, but opens the image in the first row that has an 'exposure' column value greater than 100. \end{verbatim} \section{Image Section} A virtual file containing a rectangular subsection of an image can be extracted and opened by specifying the range of pixels (start:end) along each axis to be extracted from the original image. One can also specify an optional pixel increment (start:end:step) for each axis of the input image. A pixel step = 1 will be assumed if it is not specified. If the start pixel is larger then the end pixel, then the image will be flipped (producing a mirror image) along that dimension. An asterisk, '*', may be used to specify the entire range of an axis, and '-*' will flip the entire axis. The input image can be in the primary array, in an image extension, or contained in a vector cell of a binary table. In the later 2 cases the extension name or number must be specified before the image section specifier. Examples: \begin{verbatim} myfile.fits[1:512:2, 2:512:2] - open a 256x256 pixel image consisting of the odd numbered columns (1st axis) and the even numbered rows (2nd axis) of the image in the primary array of the file. myfile.fits[*, 512:256] - open an image consisting of all the columns in the input image, but only rows 256 through 512. The image will be flipped along the 2nd axis since the starting pixel is greater than the ending pixel. myfile.fits[*:2, 512:256:2] - same as above but keeping only every other row and column in the input image. myfile.fits[-*, *] - copy the entire image, flipping it along the first axis. myfile.fits[3][1:256,1:256] - opens a subsection of the image that is in the 3rd extension of the file. myfile.fits[4; images(12)][1:10,1:10] - open an image consisting of the first 10 pixels in both dimensions. The original image resides in the 12th row of the 'images' vector column in the table in the 4th extension of the file. \end{verbatim} When CFITSIO opens an image section it first creates a temporary file containing the image section plus a copy of any other HDUs in the file. (If a `\#' character is appended to the name or number of the image HDU, as in "myfile.fits[1\#][1:200,1:200]", then the other HDUs in the input file will not be copied into memory). This temporary file is then opened by the application program, so it is not possible to write to or modify the input file when specifying an image section. Note that CFITSIO automatically updates the world coordinate system keywords in the header of the image section, if they exist, so that the coordinate associated with each pixel in the image section will be computed correctly. \section{Image Transform Filters} CFITSIO can apply a user-specified mathematical function to the value of every pixel in a FITS image, thus creating a new virtual image in computer memory that is then opened and read by the application program. The original FITS image is not modified by this process. The image transformation specifier is appended to the input FITS file name and is enclosed in square brackets. It begins with the letters 'PIX' to distinguish it from other types of FITS file filters that are recognized by CFITSIO. The image transforming function may use any of the mathematical operators listed in the following 'Row Filtering Specification' section of this document. Some examples of image transform filters are: \begin{verbatim} [pix X * 2.0] - multiply each pixel by 2.0 [pix sqrt(X)] - take the square root of each pixel [pix X + #ZEROPT - add the value of the ZEROPT keyword [pix X>0 ? log10(X) : -99.] - if the pixel value is greater than 0, compute the base 10 log, else set the pixel = -99. \end{verbatim} Use the letter 'X' in the expression to represent the current pixel value in the image. The expression is evaluated independently for each pixel in the image and may be a function of 1) the original pixel value, 2) the value of other pixels in the image at a given relative offset from the position of the pixel that is being evaluated, and 3) the value of any header keywords. Header keyword values are represented by the name of the keyword preceded by the '\#' sign. To access the the value of adjacent pixels in the image, specify the (1-D) offset from the current pixel in curly brackets. For example \begin{verbatim} [pix (x{-1} + x + x{+1}) / 3] \end{verbatim} will replace each pixel value with the running mean of the values of that pixel and it's 2 neighboring pixels. Note that in this notation the image is treated as a 1-D array, where each row of the image (or higher dimensional cube) is appended one after another in one long array of pixels. It is possible to refer to pixels in the rows above or below the current pixel by using the value of the NAXIS1 header keyword. For example \begin{verbatim} [pix (x{-#NAXIS1} + x + x{#NAXIS1}) / 3] \end{verbatim} will compute the mean of each image pixel and the pixels immediately above and below it in the adjacent rows of the image. The following more complex example creates a smoothed virtual image where each pixel is a 3 x 3 boxcar average of the input image pixels: \begin{verbatim} [pix (X + X{-1} + X{+1} + X{-#NAXIS1} + X{-#NAXIS1 - 1} + X{-#NAXIS1 + 1} + X{#NAXIS1} + X{#NAXIS1 - 1} + X{#NAXIS1 + 1}) / 9.] \end{verbatim} If the pixel offset extends beyond the first or last pixel in the image, the function will evaluate to undefined, or NULL. For complex or commonly used image filtering operations, one can write the expression into an external text file and then import it into the filter using the syntax '[pix @filename.txt]'. The mathematical expression can extend over multiple lines of text in the file. Any lines in the external text file that begin with 2 slash characters ('//') will be ignored and may be used to add comments into the file. By default, the datatype of the resulting image will be the same as the original image, but one may force a different datatype by appended a code letter to the 'pix' keyword: \begin{verbatim} pixb - 8-bit byte image with BITPIX = 8 pixi - 16-bit integer image with BITPIX = 16 pixj - 32-bit integer image with BITPIX = 32 pixr - 32-bit float image with BITPIX = -32 pixd - 64-bit float image with BITPIX = -64 \end{verbatim} Also by default, any other HDUs in the input file will be copied without change to the output virtual FITS file, but one may discard the other HDUs by adding the number '1' to the 'pix' keyword (and following any optional datatype code letter). For example: \begin{verbatim} myfile.fits[3][pixr1 sqrt(X)] \end{verbatim} will create a virtual FITS file containing only a primary array image with 32-bit floating point pixels that have a value equal to the square root of the pixels in the image that is in the 3rd extension of the 'myfile.fits' file. \section{Column and Keyword Filtering Specification} The optional column/keyword filtering specifier is used to modify the column structure and/or the header keywords in the HDU that was selected with the previous HDU location specifier. This filtering specifier must be enclosed in square brackets and can be distinguished from a general row filter specifier (described below) by the fact that it begins with the string 'col ' and is not immediately followed by an equals sign. The original file is not changed by this filtering operation, and instead the modifications are made on a copy of the input FITS file (usually in memory), which also contains a copy of all the other HDUs in the file. (If a `\#' character is appended to the name or number of the table HDU then only the primary array, and none of the other HDUs in the input file will be copied into memory). This temporary file is passed to the application program and will persist only until the file is closed or until the program exits, unless the outfile specifier (see above) is also supplied. The column/keyword filter can be used to perform the following operations. More than one operation may be specified by separating them with commas or semi-colons. \begin{itemize} \item Copy only a specified list of columns columns to the filtered input file. The list of column name should be separated by commas or semi-colons. Wild card characters may be used in the column names to match multiple columns. If the expression contains both a list of columns to be included and columns to be deleted, then all the columns in the original table except the explicitly deleted columns will appear in the filtered table (i.e., there is no need to explicitly list the columns to be included if any columns are being deleted). \item Delete a column or keyword by listing the name preceded by a minus sign or an exclamation mark (!), e.g., '-TIME' will delete the TIME column if it exists, otherwise the TIME keyword. An error is returned if neither a column nor keyword with this name exists. Note that the exclamation point, '!', is a special UNIX character, so if it is used on the command line rather than entered at a task prompt, it must be preceded by a backslash to force the UNIX shell to ignore it. \item Rename an existing column or keyword with the syntax 'NewName == OldName'. An error is returned if neither a column nor keyword with this name exists. \item Append a new column or keyword to the table. To create a column, give the new name, optionally followed by the data type in parentheses, followed by a single equals sign and an expression to be used to compute the value (e.g., 'newcol(1J) = 0' will create a new 32-bit integer column called 'newcol' filled with zeros). The data type is specified using the same syntax that is allowed for the value of the FITS TFORMn keyword (e.g., 'I', 'J', 'E', 'D', etc. for binary tables, and 'I8', F12.3', 'E20.12', etc. for ASCII tables). If the data type is not specified then an appropriate data type will be chosen depending on the form of the expression (may be a character string, logical, bit, long integer, or double column). An appropriate vector count (in the case of binary tables) will also be added if not explicitly specified. When creating a new keyword, the keyword name must be preceded by a pound sign '\#', and the expression must evaluate to a scalar (i.e., cannot have a column name in the expression). The comment string for the keyword may be specified in parentheses immediately following the keyword name (instead of supplying a data type as in the case of creating a new column). If the keyword name ends with a pound sign '\#', then cfitsio will substitute the number of the most recently referenced column for the \# character . This is especially useful when writing a column-related keyword like TUNITn for a newly created column, as shown in the following examples. COMMENT and HISTORY keywords may also be created with the following syntax: \begin{verbatim} #COMMENT = 'This is a comment keyword' #HISTORY = 'This is a history keyword' \end{verbatim} Note that the equal sign and the quote characters will be removed, so that the resulting header keywords in these cases will look like this: \begin{verbatim} COMMENT This is a comment keyword HISTORY This is a history keyword \end{verbatim} These two special keywords are always appended to the end of the header and will not affect any previously existing COMMENT or HISTORY keywords. It is possible to delete an existing keyword using a preceding \verb+'-'+. Either of these examples will delete the keyword named \verb+VEL+. \begin{verbatim} -VEL; -#VEL; \end{verbatim} \item Recompute (overwrite) the values in an existing column or keyword by giving the name followed by an equals sign and an arithmetic expression. \end{itemize} The expression that is used when appending or recomputing columns or keywords can be arbitrarily complex and may be a function of other header keyword values and other columns (in the same row). The full syntax and available functions for the expression are described below in the row filter specification section. If the expression contains both a list of columns to be included and columns to be deleted, then all the columns in the original table except the explicitly deleted columns will appear in the filtered table. If no columns to be deleted are specified, then only the columns that are explicitly listed will be included in the filtered output table. To include all the columns, add the '*' wildcard specifier at the end of the list, as shown in the examples. For complex or commonly used operations, one can place the operations into an external text file and import it into the column filter using the syntax '[col @filename.txt]'. The operations can extend over multiple lines of the file, but multiple operations must still be separated by commas or semi-colons. Any lines in the external text file that begin with 2 slash characters ('//') will be ignored and may be used to add comments into the file. It is possible to use wildcard syntax to delete either keywords or columns that match a pattern. Recall that to delete either a keyword or a column, precede its name with a \verb+'-'+ character. Wildcard patterns are: \verb+'*'+, which matches any string of characters; \verb+'?'+, which matches any single character; and \verb+'#'+ which matches any numerical string. For example these statements: \begin{verbatim} -VEL*; # remove single column (or keyword) beginning with VEL -VEL_?; # remove single column (or keyword) VEL_? where ? is any character -#DEC_*; # remove single keyword beginning with DEC_ -#TUNIT#; # remove single keyword TUNIT ending w. number \end{verbatim} will remove the columns or keywords as noted. Be aware that if a \verb+'#'+ is not present, the CFITSIO engine will check for columns with the given name first, followed by keywords. The above expressions will only delete the {\it first} item which matches the pattern. If following columns or keywords in the same CHDU match the pattern, they will not be deleted. To delete {\it zero or more} keywords that match the pattern, add a trailing \verb|'+'|. \begin{verbatim} -VEL*; # remove all columns (or keywords) beginning with VEL -VEL_?; # remove all columns (or keyword) VEL_? where ? is any character -#DEC_*+; # remove all keywords beginning with DEC_ -#TUNIT#+; # remove all keywords TUNIT ending w. number \end{verbatim} Note that, as a 0-or-more matching pattern, this form will succeed if the requested column or keyword is not present. In that case, the deletion expression will silently proceed as if no deletion was requested. Examples: \begin{verbatim} [col Time, rate] - only the Time and rate columns will appear in the filtered input file. [col Time, *raw] - include the Time column and any other columns whose name ends with 'raw'. [col -TIME, Good == STATUS] - deletes the TIME column and renames the status column to 'Good' [col PI=PHA * 1.1 + 0.2; #TUNIT#(column units) = 'counts';*] - creates new PI column from PHA values and also writes the TUNITn keyword for the new column. The final '*' expression means preserve all the columns in the input table in the virtual output table; without the '*' the output table would only contain the single 'PI' column. [col rate = rate/exposure; TUNIT#(&) = 'counts/s';*] - recomputes the rate column by dividing it by the EXPOSURE keyword value. This also modifies the value of the TUNITn keyword for this column. The use of the '&' character for the keyword comment string means preserve the existing comment string for that keyword. The final '*' preserves all the columns in the input table in the virtual output table. \end{verbatim} \section{Row Filtering Specification} When entering the name of a FITS table that is to be opened by a program, an optional row filter may be specified to select a subset of the rows in the table. A temporary new FITS file is created on the fly which contains only those rows for which the row filter expression evaluates to true. The primary array and any other extensions in the input file are also copied to the temporary file. (If a `\#' character is appended to the name or number of the table HDU then only the primary array, and none of the other HDUs in the input file will be copied into the temporary file). The original FITS file is closed and the new virtual file is opened by the application program. The row filter expression is enclosed in square brackets following the file name and extension name (e.g., 'file.fits[events][GRADE==50]' selects only those rows where the GRADE column value equals 50). When dealing with tables where each row has an associated time and/or 2D spatial position, the row filter expression can also be used to select rows based on the times in a Good Time Intervals (GTI) extension, or on spatial position as given in a SAO-style region file. \subsection{General Syntax} The row filtering expression can be an arbitrarily complex series of operations performed on constants, keyword values, and column data taken from the specified FITS TABLE extension. The expression must evaluate to a boolean value for each row of the table, where a value of FALSE means that the row will be excluded. For complex or commonly used filters, one can place the expression into a text file and import it into the row filter using the syntax '[@filename.txt]'. The expression can be arbitrarily complex and extend over multiple lines of the file. Any lines in the external text file that begin with 2 slash characters ('//') will be ignored and may be used to add comments into the file. Keyword and column data are referenced by name. Any string of characters not surrounded by quotes (ie, a constant string) or followed by an open parentheses (ie, a function name) will be initially interpreted as a column name and its contents for the current row inserted into the expression. If no such column exists, a keyword of that name will be searched for and its value used, if found. To force the name to be interpreted as a keyword (in case there is both a column and keyword with the same name), precede the keyword name with a single pound sign, '\#', as in '\#NAXIS2'. Due to the generalities of FITS column and keyword names, if the column or keyword name contains a space or a character which might appear as an arithmetic term then enclose the name in '\$' characters as in \$MAX PHA\$ or \#\$MAX-PHA\$. Names are case insensitive. To access a table entry in a row other than the current one, follow the column's name with a row offset within curly braces. For example, 'PHA\{-3\}' will evaluate to the value of column PHA, 3 rows above the row currently being processed. One cannot specify an absolute row number, only a relative offset. Rows that fall outside the table will be treated as undefined, or NULLs. Boolean operators can be used in the expression in either their Fortran or C forms. The following boolean operators are available: \begin{verbatim} "equal" .eq. .EQ. == "not equal" .ne. .NE. != "less than" .lt. .LT. < "less than/equal" .le. .LE. <= =< "greater than" .gt. .GT. > "greater than/equal" .ge. .GE. >= => "or" .or. .OR. || "and" .and. .AND. && "negation" .not. .NOT. ! "approx. equal(1e-7)" ~ \end{verbatim} Note that the exclamation point, '!', is a special UNIX character, so if it is used on the command line rather than entered at a task prompt, it must be preceded by a backslash to force the UNIX shell to ignore it. The expression may also include arithmetic operators and functions. Trigonometric functions use radians, not degrees. The following arithmetic operators and functions can be used in the expression (function names are case insensitive). A null value will be returned in case of illegal operations such as divide by zero, sqrt(negative) log(negative), log10(negative), arccos(.gt. 1), arcsin(.gt. 1). \begin{verbatim} "addition" + "subtraction" - "multiplication" * "division" / "negation" - "exponentiation" ** ^ "absolute value" abs(x) "cosine" cos(x) "sine" sin(x) "tangent" tan(x) "arc cosine" arccos(x) "arc sine" arcsin(x) "arc tangent" arctan(x) "arc tangent" arctan2(y,x) "hyperbolic cos" cosh(x) "hyperbolic sin" sinh(x) "hyperbolic tan" tanh(x) "round to nearest int" round(x) "round down to int" floor(x) "round up to int" ceil(x) "exponential" exp(x) "square root" sqrt(x) "natural log" log(x) "common log" log10(x) "modulus" x % y "random # [0.0,1.0)" random() "random Gaussian" randomn() "random Poisson" randomp(x) "minimum" min(x,y) "maximum" max(x,y) "cumulative sum" accum(x) "sequential difference" seqdiff(x) "if-then-else" b?x:y "angular separation" angsep(ra1,dec1,ra2,de2) (all in degrees) "substring" strmid(s,p,n) "string search" strstr(s,r) \end{verbatim} Three different random number functions are provided: random(), with no arguments, produces a uniform random deviate between 0 and 1; randomn(), also with no arguments, produces a normal (Gaussian) random deviate with zero mean and unit standard deviation; randomp(x) produces a Poisson random deviate whose expected number of counts is X. X may be any positive real number of expected counts, including fractional values, but the return value is an integer. When the random functions are used in a vector expression, by default the same random value will be used when evaluating each element of the vector. If different random numbers are desired, then the name of a vector column should be supplied as the single argument to the random function (e.g., "flux + 0.1 * random(flux)", where "flux' is the name of a vector column). This will create a vector of random numbers that will be used in sequence when evaluating each element of the vector expression. An alternate syntax for the min and max functions has only a single argument which should be a vector value (see below). The result will be the minimum/maximum element contained within the vector. The accum(x) function forms the cumulative sum of x, element by element. Vector columns are supported simply by performing the summation process through all the values. Null values are treated as 0. The seqdiff(x) function forms the sequential difference of x, element by element. The first value of seqdiff is the first value of x. A single null value in x causes a pair of nulls in the output. The seqdiff and accum functions are functional inverses, i.e., seqdiff(accum(x)) == x as long as no null values are present. In the if-then-else expression, "b?x:y", b is an explicit boolean value or expression. There is no automatic type conversion from numeric to boolean values, so one needs to use "iVal!=0" instead of merely "iVal" as the boolean argument. x and y can be any scalar data type (including string). The angsep function computes the angular separation in degrees between 2 celestial positions, where the first 2 parameters give the RA-like and Dec-like coordinates (in decimal degrees) of the first position, and the 3rd and 4th parameters give the coordinates of the second position. The substring function strmid(S,P,N) extracts a substring from S, starting at string position P, with a substring length N. The first character position in S is labeled as 1. If P is 0, or refers to a position beyond the end of S, then the extracted substring will be NULL. S, P, and N may be functions of other columns. The string search function strstr(S,R) searches for the first occurrence of the substring R in S. The result is an integer, indicating the character position of the first match (where 1 is the first character position of S). If no match is found, then strstr() returns a NULL value. The following type casting operators are available, where the inclosing parentheses are required and taken from the C language usage. Also, the integer to real casts values to double precision: \begin{verbatim} "real to integer" (int) x (INT) x "integer to real" (float) i (FLOAT) i \end{verbatim} In addition, several constants are built in for use in numerical expressions: \begin{verbatim} #pi 3.1415... #e 2.7182... #deg #pi/180 #row current row number #null undefined value #snull undefined string \end{verbatim} A string constant must be enclosed in quotes as in 'Crab'. The "null" constants are useful for conditionally setting table values to a NULL, or undefined, value (eg., "col1==-99 ? \#NULL : col1"). There is also a function for testing if two values are close to each other, i.e., if they are "near" each other to within a user specified tolerance. The arguments, value\_1 and value\_2 can be integer or real and represent the two values who's proximity is being tested to be within the specified tolerance, also an integer or real: \begin{verbatim} near(value_1, value_2, tolerance) \end{verbatim} When a NULL, or undefined, value is encountered in the FITS table, the expression will evaluate to NULL unless the undefined value is not actually required for evaluation, e.g. "TRUE .or. NULL" evaluates to TRUE. The following two functions allow some NULL detection and handling: \begin{verbatim} "a null value?" ISNULL(x) "define a value for null" DEFNULL(x,y) \end{verbatim} The former returns a boolean value of TRUE if the argument x is NULL. The later "defines" a value to be substituted for NULL values; it returns the value of x if x is not NULL, otherwise it returns the value of y. \subsection{Bit Masks} Bit masks can be used to select out rows from bit columns (TFORMn = \#X) in FITS files. To represent the mask, binary, octal, and hex formats are allowed: \begin{verbatim} binary: b0110xx1010000101xxxx0001 octal: o720x1 -> (b111010000xxx001) hex: h0FxD -> (b00001111xxxx1101) \end{verbatim} In all the representations, an x or X is allowed in the mask as a wild card. Note that the x represents a different number of wild card bits in each representation. All representations are case insensitive. To construct the boolean expression using the mask as the boolean equal operator described above on a bit table column. For example, if you had a 7 bit column named flags in a FITS table and wanted all rows having the bit pattern 0010011, the selection expression would be: \begin{verbatim} flags == b0010011 or flags .eq. b10011 \end{verbatim} It is also possible to test if a range of bits is less than, less than equal, greater than and greater than equal to a particular boolean value: \begin{verbatim} flags <= bxxx010xx flags .gt. bxxx100xx flags .le. b1xxxxxxx \end{verbatim} Notice the use of the x bit value to limit the range of bits being compared. It is not necessary to specify the leading (most significant) zero (0) bits in the mask, as shown in the second expression above. Bit wise AND, OR and NOT operations are also possible on two or more bit fields using the '\&'(AND), '$|$'(OR), and the '!'(NOT) operators. All of these operators result in a bit field which can then be used with the equal operator. For example: \begin{verbatim} (!flags) == b1101100 (flags & b1000001) == bx000001 \end{verbatim} Bit fields can be appended as well using the '+' operator. Strings can be concatenated this way, too. \subsection{Vector Columns} Vector columns can also be used in building the expression. No special syntax is required if one wants to operate on all elements of the vector. Simply use the column name as for a scalar column. Vector columns can be freely intermixed with scalar columns or constants in virtually all expressions. The result will be of the same dimension as the vector. Two vectors in an expression, though, need to have the same number of elements and have the same dimensions. Arithmetic and logical operations are all performed on an element by element basis. Comparing two vector columns, eg "COL1 == COL2", thus results in another vector of boolean values indicating which elements of the two vectors are equal. Eight functions are available that operate on a vector and return a scalar result: \begin{verbatim} "minimum" MIN(V) "maximum" MAX(V) "average" AVERAGE(V) "median" MEDIAN(V) "summation" SUM(V) "standard deviation" STDDEV(V) "# of values" NELEM(V) "# of non-null values" NVALID(V) \end{verbatim} where V represents the name of a vector column or a manually constructed vector using curly brackets as described below. The first 6 of these functions ignore any null values in the vector when computing the result. The STDDEV() function computes the sample standard deviation, i.e. it is proportional to 1/SQRT(N-1) instead of 1/SQRT(N), where N is NVALID(V). The SUM function literally sums all the elements in x, returning a scalar value. If V is a boolean vector, SUM returns the number of TRUE elements. The NELEM function returns the number of elements in vector V whereas NVALID return the number of non-null elements in the vector. (NELEM also operates on bit and string columns, returning their column widths.) As an example, to test whether all elements of two vectors satisfy a given logical comparison, one can use the expression \begin{verbatim} SUM( COL1 > COL2 ) == NELEM( COL1 ) \end{verbatim} which will return TRUE if all elements of COL1 are greater than their corresponding elements in COL2. To specify a single element of a vector, give the column name followed by a comma-separated list of coordinates enclosed in square brackets. For example, if a vector column named PHAS exists in the table as a one dimensional, 256 component list of numbers from which you wanted to select the 57th component for use in the expression, then PHAS[57] would do the trick. Higher dimensional arrays of data may appear in a column. But in order to interpret them, the TDIMn keyword must appear in the header. Assuming that a (4,4,4,4) array is packed into each row of a column named ARRAY4D, the (1,2,3,4) component element of each row is accessed by ARRAY4D[1,2,3,4]. Arrays up to dimension 5 are currently supported. Each vector index can itself be an expression, although it must evaluate to an integer value within the bounds of the vector. Vector columns which contain spaces or arithmetic operators must have their names enclosed in "\$" characters as with \$ARRAY-4D\$[1,2,3,4]. A more C-like syntax for specifying vector indices is also available. The element used in the preceding example alternatively could be specified with the syntax ARRAY4D[4][3][2][1]. Note the reverse order of indices (as in C), as well as the fact that the values are still ones-based (as in Fortran -- adopted to avoid ambiguity for 1D vectors). With this syntax, one does not need to specify all of the indices. To extract a 3D slice of this 4D array, use ARRAY4D[4]. Variable-length vector columns are not supported. Vectors can be manually constructed within the expression using a comma-separated list of elements surrounded by curly braces ('\{\}'). For example, '\{1,3,6,1\}' is a 4-element vector containing the values 1, 3, 6, and 1. The vector can contain only boolean, integer, and real values (or expressions). The elements will be promoted to the highest data type present. Any elements which are themselves vectors, will be expanded out with each of its elements becoming an element in the constructed vector. \subsection{Row Access} To access a table entry in a row other than the current one, follow the column's name with a row offset within curly braces. For example, \verb+PHA{-3}+ will evaluate to the value of column PHA, 3 rows above the row currently being processed. One cannot specify an absolute row number, only a relative offset. Rows that fall outside the table will be treated as undefined, or NULLs. Using the same column name on the left and right side of the equals sign while using the \verb+COLUMN{-N}+ notation will not produce the desired result. For example, \begin{verbatim} COUNT = COUNT{-1} + 1; # BAD - do not use \end{verbatim} will not produce an increasing counter. Such recursive calculations are often not possible with the calculator syntax. \subsection{Good Time Interval Filtering} A common filtering method involves selecting rows which have a time value which lies within what is called a Good Time Interval or GTI. The time intervals are defined in a separate FITS table extension which contains 2 columns giving the start and stop time of each good interval. The filtering operation accepts only those rows of the input table which have an associated time which falls within one of the time intervals defined in the GTI extension. A high level function, gtifilter(a,b,c,d), is available which evaluates each row of the input table and returns TRUE or FALSE depending whether the row is inside or outside the good time interval. The syntax is \begin{verbatim} gtifilter( [ "gtifile" [, expr [, "STARTCOL", "STOPCOL" ] ] ] ) or gtifilter( [ 'gtifile' [, expr [, 'STARTCOL', 'STOPCOL' ] ] ] ) \end{verbatim} where each "[]" demarks optional parameters. Note that the quotes around the gtifile and START/STOP column are required. Either single or double quotes may be used. In cases where this expression is entered on the Unix command line, enclose the entire expression in double quotes, and then use single quotes within the expression to enclose the 'gtifile' and other terms. It is also usually possible to do the reverse, and enclose the whole expression in single quotes and then use double quotes within the expression. The gtifile, if specified, can be blank ("") which will mean to use the first extension with the name "*GTI*" in the current file, a plain extension specifier (eg, "+2", "[2]", or "[STDGTI]") which will be used to select an extension in the current file, or a regular filename with or without an extension specifier which in the latter case will mean to use the first extension with an extension name "*GTI*". Expr can be any arithmetic expression, including simply the time column name. A vector time expression will produce a vector boolean result. STARTCOL and STOPCOL are the names of the START/STOP columns in the GTI extension. If one of them is specified, they both must be. In its simplest form, no parameters need to be provided -- default values will be used. The expression "gtifilter()" is equivalent to \begin{verbatim} gtifilter( "", TIME, "*START*", "*STOP*" ) \end{verbatim} This will search the current file for a GTI extension, filter the TIME column in the current table, using START/STOP times taken from columns in the GTI extension with names containing the strings "START" and "STOP". The wildcards ('*') allow slight variations in naming conventions such as "TSTART" or "STARTTIME". The same default values apply for unspecified parameters when the first one or two parameters are specified. The function automatically searches for TIMEZERO/I/F keywords in the current and GTI extensions, applying a relative time offset, if necessary. \subsection{Spatial Region Filtering} Another common filtering method selects rows based on whether the spatial position associated with each row is located within a given 2-dimensional region. The syntax for this high-level filter is \begin{verbatim} regfilter( "regfilename" [ , Xexpr, Yexpr [ , "wcs cols" ] ] ) \end{verbatim} where each "[]" demarks optional parameters. The region file name is required and must be enclosed in quotes. The remaining parameters are optional. There are 2 supported formats for the region file: ASCII file or FITS binary table. The region file contains a list of one or more geometric shapes (circle, ellipse, box, etc.) which defines a region on the celestial sphere or an area within a particular 2D image. The region file is typically generated using an image display program such as fv/POW (distribute by the HEASARC), or ds9 (distributed by the Smithsonian Astrophysical Observatory). Users should refer to the documentation provided with these programs for more details on the syntax used in the region files. The FITS region file format is defined in a document available from the FITS Support Office at http://fits.gsfc.nasa.gov/ registry/ region.html In its simplest form, (e.g., regfilter("region.reg") ) the coordinates in the default 'X' and 'Y' columns will be used to determine if each row is inside or outside the area specified in the region file. Alternate position column names, or expressions, may be entered if needed, as in \begin{verbatim} regfilter("region.reg", XPOS, YPOS) \end{verbatim} Region filtering can be applied most unambiguously if the positions in the region file and in the table to be filtered are both give in terms of absolute celestial coordinate units. In this case the locations and sizes of the geometric shapes in the region file are specified in angular units on the sky (e.g., positions given in R.A. and Dec. and sizes in arcseconds or arcminutes). Similarly, each row of the filtered table will have a celestial coordinate associated with it. This association is usually implemented using a set of so-called 'World Coordinate System' (or WCS) FITS keywords that define the coordinate transformation that must be applied to the values in the 'X' and 'Y' columns to calculate the coordinate. Alternatively, one can perform spatial filtering using unitless 'pixel' coordinates for the regions and row positions. In this case the user must be careful to ensure that the positions in the 2 files are self-consistent. A typical problem is that the region file may be generated using a binned image, but the unbinned coordinates are given in the event table. The ROSAT events files, for example, have X and Y pixel coordinates that range from 1 - 15360. These coordinates are typically binned by a factor of 32 to produce a 480x480 pixel image. If one then uses a region file generated from this image (in image pixel units) to filter the ROSAT events file, then the X and Y column values must be converted to corresponding pixel units as in: \begin{verbatim} regfilter("rosat.reg", X/32.+.5, Y/32.+.5) \end{verbatim} Note that this binning conversion is not necessary if the region file is specified using celestial coordinate units instead of pixel units because CFITSIO is then able to directly compare the celestial coordinate of each row in the table with the celestial coordinates in the region file without having to know anything about how the image may have been binned. The last "wcs cols" parameter should rarely be needed. If supplied, this string contains the names of the 2 columns (space or comma separated) which have the associated WCS keywords. If not supplied, the filter will scan the X and Y expressions for column names. If only one is found in each expression, those columns will be used, otherwise an error will be returned. These region shapes are supported (names are case insensitive): \begin{verbatim} Point ( X1, Y1 ) <- One pixel square region Line ( X1, Y1, X2, Y2 ) <- One pixel wide region Polygon ( X1, Y1, X2, Y2, ... ) <- Rest are interiors with Rectangle ( X1, Y1, X2, Y2, A ) | boundaries considered Box ( Xc, Yc, Wdth, Hght, A ) V within the region Diamond ( Xc, Yc, Wdth, Hght, A ) Circle ( Xc, Yc, R ) Annulus ( Xc, Yc, Rin, Rout ) Ellipse ( Xc, Yc, Rx, Ry, A ) Elliptannulus ( Xc, Yc, Rinx, Riny, Routx, Routy, Ain, Aout ) Sector ( Xc, Yc, Amin, Amax ) \end{verbatim} where (Xc,Yc) is the coordinate of the shape's center; (X\#,Y\#) are the coordinates of the shape's edges; Rxxx are the shapes' various Radii or semimajor/minor axes; and Axxx are the angles of rotation (or bounding angles for Sector) in degrees. For rotated shapes, the rotation angle can be left off, indicating no rotation. Common alternate names for the regions can also be used: rotbox = box; rotrectangle = rectangle; (rot)rhombus = (rot)diamond; and pie = sector. When a shape's name is preceded by a minus sign, '-', the defined region is instead the area *outside* its boundary (ie, the region is inverted). All the shapes within a single region file are OR'd together to create the region, and the order is significant. The overall way of looking at region files is that if the first region is an excluded region then a dummy included region of the whole detector is inserted in the front. Then each region specification as it is processed overrides any selections inside of that region specified by previous regions. Another way of thinking about this is that if a previous excluded region is completely inside of a subsequent included region the excluded region is ignored. The positional coordinates may be given either in pixel units, decimal degrees or hh:mm:ss.s, dd:mm:ss.s units. The shape sizes may be given in pixels, degrees, arcminutes, or arcseconds. Look at examples of region file produced by fv/POW or ds9 for further details of the region file format. There are three low-level functions that are primarily for use with regfilter function, but they can be called directly. They return a boolean true or false depending on whether a two dimensional point is in the region or not. The positional coordinates must be given in pixel units: \begin{verbatim} "point in a circular region" circle(xcntr,ycntr,radius,Xcolumn,Ycolumn) "point in an elliptical region" ellipse(xcntr,ycntr,xhlf_wdth,yhlf_wdth,rotation,Xcolumn,Ycolumn) "point in a rectangular region" box(xcntr,ycntr,xfll_wdth,yfll_wdth,rotation,Xcolumn,Ycolumn) where (xcntr,ycntr) are the (x,y) position of the center of the region (xhlf_wdth,yhlf_wdth) are the (x,y) half widths of the region (xfll_wdth,yfll_wdth) are the (x,y) full widths of the region (radius) is half the diameter of the circle (rotation) is the angle(degrees) that the region is rotated with respect to (xcntr,ycntr) (Xcoord,Ycoord) are the (x,y) coordinates to test, usually column names NOTE: each parameter can itself be an expression, not merely a column name or constant. \end{verbatim} \subsection{Example Row Filters} \begin{verbatim} [ binary && mag <= 5.0] - Extract all binary stars brighter than fifth magnitude (note that the initial space is necessary to prevent it from being treated as a binning specification) [#row >= 125 && #row <= 175] - Extract row numbers 125 through 175 [IMAGE[4,5] .gt. 100] - Extract all rows that have the (4,5) component of the IMAGE column greater than 100 [abs(sin(theta * #deg)) < 0.5] - Extract all rows having the absolute value of the sine of theta less than a half where the angles are tabulated in degrees [SUM( SPEC > 3*BACKGRND )>=1] - Extract all rows containing a spectrum, held in vector column SPEC, with at least one value 3 times greater than the background level held in a keyword, BACKGRND [VCOL=={1,4,2}] - Extract all rows whose vector column VCOL contains the 3-elements 1, 4, and 2. [@rowFilter.txt] - Extract rows using the expression contained within the text file rowFilter.txt [gtifilter()] - Search the current file for a GTI extension, filter the TIME column in the current table, using START/STOP times taken from columns in the GTI extension [regfilter("pow.reg")] - Extract rows which have a coordinate (as given in the X and Y columns) within the spatial region specified in the pow.reg region file. [regfilter("pow.reg", Xs, Ys)] - Same as above, except that the Xs and Ys columns will be used to determine the coordinate of each row in the table. \end{verbatim} \section{ Binning or Histogramming Specification} The optional binning specifier is enclosed in square brackets and can be distinguished from a general row filter specification by the fact that it begins with the keyword 'bin' not immediately followed by an equals sign. When binning is specified, a temporary N-dimensional FITS primary array is created by computing the histogram of the values in the specified columns of a FITS table extension. After the histogram is computed the input FITS file containing the table is then closed and the temporary FITS primary array is opened and passed to the application program. Thus, the application program never sees the original FITS table and only sees the image in the new temporary file (which has no additional extensions). Obviously, the application program must be expecting to open a FITS image and not a FITS table in this case. The data type of the FITS histogram image may be specified by appending 'b' (for 8-bit byte), 'i' (for 16-bit integers), 'j' (for 32-bit integer), 'r' (for 32-bit floating points), or 'd' (for 64-bit double precision floating point) to the 'bin' keyword (e.g. '[binr X]' creates a real floating point image). If the data type is not explicitly specified then a 32-bit integer image will be created by default, unless the weighting option is also specified in which case the image will have a 32-bit floating point data type by default. The histogram image may have from 1 to 4 dimensions (axes), depending on the number of columns that are specified. The general form of the binning specification is: \begin{verbatim} [bin{bijrd} Xcol=min:max:binsize, Ycol= ..., Zcol=..., Tcol=...; weight] \end{verbatim} in which up to 4 columns, each corresponding to an axis of the image, are listed. The column names are case insensitive, and the column number may be given instead of the name, preceded by a pound sign (e.g., [bin \#4=1:512]). If the column name is not specified, then CFITSIO will first try to use the 'preferred column' as specified by the CPREF keyword if it exists (e.g., 'CPREF = 'DETX,DETY'), otherwise column names 'X', 'Y', 'Z', and 'T' will be assumed for each of the 4 axes, respectively. In cases where the column name could be confused with an arithmetic expression, enclose the column name in parentheses to force the name to be interpreted literally. Each column name may be followed by an equals sign and then the lower and upper range of the histogram, and the size of the histogram bins, separated by colons. Spaces are allowed before and after the equals sign but not within the 'min:max:binsize' string. The min, max and binsize values may be integer or floating point numbers, or they may be the names of keywords in the header of the table. If the latter, then the value of that keyword is substituted into the expression. Default values for the min, max and binsize quantities will be used if not explicitly given in the binning expression as shown in these examples: \begin{verbatim} [bin x = :512:2] - use default minimum value [bin x = 1::2] - use default maximum value [bin x = 1:512] - use default bin size [bin x = 1:] - use default maximum value and bin size [bin x = :512] - use default minimum value and bin size [bin x = 2] - use default minimum and maximum values [bin x] - use default minimum, maximum and bin size [bin 4] - default 2-D image, bin size = 4 in both axes [bin] - default 2-D image \end{verbatim} CFITSIO will use the value of the TLMINn, TLMAXn, and TDBINn keywords, if they exist, for the default min, max, and binsize, respectively. If they do not exist then CFITSIO will use the actual minimum and maximum values in the column for the histogram min and max values. The default binsize will be set to 1, or (max - min) / 10., whichever is smaller, so that the histogram will have at least 10 bins along each axis. A shortcut notation is allowed if all the columns/axes have the same binning specification. In this case all the column names may be listed within parentheses, followed by the (single) binning specification, as in: \begin{verbatim} [bin (X,Y)=1:512:2] [bin (X,Y) = 5] \end{verbatim} The optional weighting factor is the last item in the binning specifier and, if present, is separated from the list of columns by a semi-colon. As the histogram is accumulated, this weight is used to incremented the value of the appropriated bin in the histogram. If the weighting factor is not specified, then the default weight = 1 is assumed. The weighting factor may be a constant integer or floating point number, or the name of a keyword containing the weighting value. Or the weighting factor may be the name of a table column in which case the value in that column, on a row by row basis, will be used. In some cases, the column or keyword may give the reciprocal of the actual weight value that is needed. In this case, precede the weight keyword or column name by a slash '/' to tell CFITSIO to use the reciprocal of the value when constructing the histogram. For complex or commonly used histograms, one can also place its description into a text file and import it into the binning specification using the syntax [bin @filename.txt]. The file's contents can extend over multiple lines, although it must still conform to the no-spaces rule for the min:max:binsize syntax and each axis specification must still be comma-separated. Any lines in the external text file that begin with 2 slash characters ('//') will be ignored and may be used to add comments into the file. Examples: \begin{verbatim} [bini detx, dety] - 2-D, 16-bit integer histogram of DETX and DETY columns, using default values for the histogram range and binsize [bin (detx, dety)=16; /exposure] - 2-D, 32-bit real histogram of DETX and DETY columns with a bin size = 16 in both axes. The histogram values are divided by the EXPOSURE keyword value. [bin time=TSTART:TSTOP:0.1] - 1-D lightcurve, range determined by the TSTART and TSTOP keywords, with 0.1 unit size bins. [bin pha, time=8000.:8100.:0.1] - 2-D image using default binning of the PHA column for the X axis, and 1000 bins in the range 8000. to 8100. for the Y axis. [bin @binFilter.txt] - Use the contents of the text file binFilter.txt for the binning specifications. \end{verbatim} \chapter{Template Files } When a new FITS file is created with a call to fits\_create\_file, the name of a template file may be supplied in parentheses immediately following the name of the new file to be created. This template is used to define the structure of one or more HDUs in the new file. The template file may be another FITS file, in which case the newly created file will have exactly the same keywords in each HDU as in the template FITS file, but all the data units will be filled with zeros. The template file may also be an ASCII text file, where each line (in general) describes one FITS keyword record. The format of the ASCII template file is described in the following sections. \section{Detailed Template Line Format} The format of each ASCII template line closely follows the format of a FITS keyword record: \begin{verbatim} KEYWORD = KEYVALUE / COMMENT \end{verbatim} except that free format may be used (e.g., the equals sign may appear at any position in the line) and TAB characters are allowed and are treated the same as space characters. The KEYVALUE and COMMENT fields are optional. The equals sign character is also optional, but it is recommended that it be included for clarity. Any template line that begins with the pound '\#' character is ignored by the template parser and may be use to insert comments into the template file itself. The KEYWORD name field is limited to 8 characters in length and only the letters A-Z, digits 0-9, and the hyphen and underscore characters may be used, without any embedded spaces. Lowercase letters in the template keyword name will be converted to uppercase. Leading spaces in the template line preceding the keyword name are generally ignored, except if the first 8 characters of a template line are all blank, then the entire line is treated as a FITS comment keyword (with a blank keyword name) and is copied verbatim into the FITS header. The KEYVALUE field may have any allowed FITS data type: character string, logical, integer, real, complex integer, or complex real. Integer values must be within the allowed range of a 'signed long' variable; some C compilers only suppport 4-byte long integers with a range from -2147483648 to +2147483647, whereas other C compilers support 8-byte integers with a range of plus or minus 2**63. The character string values need not be enclosed in single quote characters unless they are necessary to distinguish the string from a different data type (e.g. 2.0 is a real but '2.0' is a string). The keyword has an undefined (null) value if the template record only contains blanks following the "=" or between the "=" and the "/" comment field delimiter. String keyword values longer than 68 characters (the maximum length that will fit in a single FITS keyword record) are permitted using the CFITSIO long string convention. They can either be specified as a single long line in the template, or by using multiple lines where the continuing lines contain the 'CONTINUE' keyword, as in this example: \begin{verbatim} LONGKEY = 'This is a long string value that is contin&' CONTINUE 'ued over 2 records' / comment field goes here \end{verbatim} The format of template lines with CONTINUE keyword is very strict: 3 spaces must follow CONTINUE and the rest of the line is copied verbatim to the FITS file. The start of the optional COMMENT field must be preceded by "/", which is used to separate it from the keyword value field. Exceptions are if the KEYWORD name field contains COMMENT, HISTORY, CONTINUE, or if the first 8 characters of the template line are blanks. More than one Header-Data Unit (HDU) may be defined in the template file. The start of an HDU definition is denoted with a SIMPLE or XTENSION template line: 1) SIMPLE begins a Primary HDU definition. SIMPLE may only appear as the first keyword in the template file. If the template file begins with XTENSION instead of SIMPLE, then a default empty Primary HDU is created, and the template is then assumed to define the keywords starting with the first extension following the Primary HDU. 2) XTENSION marks the beginning of a new extension HDU definition. The previous HDU will be closed at this point and processing of the next extension begins. \section{Auto-indexing of Keywords} If a template keyword name ends with a "\#" character, it is said to be 'auto-indexed'. Each "\#" character will be replaced by the current integer index value, which gets reset = 1 at the start of each new HDU in the file (or 7 in the special case of a GROUP definition). The FIRST indexed keyword in each template HDU definition is used as the 'incrementor'; each subsequent occurrence of this SAME keyword will cause the index value to be incremented. This behavior can be rather subtle, as illustrated in the following examples in which the TTYPE keyword is the incrementor in both cases: \begin{verbatim} TTYPE# = TIME TFORM# = 1D TTYPE# = RATE TFORM# = 1E \end{verbatim} will create TTYPE1, TFORM1, TTYPE2, and TFORM2 keywords. But if the template looks like, \begin{verbatim} TTYPE# = TIME TTYPE# = RATE TFORM# = 1D TFORM# = 1E \end{verbatim} this results in a FITS files with TTYPE1, TTYPE2, TFORM2, and TFORM2, which is probably not what was intended! \section{Template Parser Directives} In addition to the template lines which define individual keywords, the template parser recognizes 3 special directives which are each preceded by the backslash character: \verb+ \include, \group+, and \verb+ \end+. The 'include' directive must be followed by a filename. It forces the parser to temporarily stop reading the current template file and begin reading the include file. Once the parser reaches the end of the include file it continues parsing the current template file. Include files can be nested, and HDU definitions can span multiple template files. The start of a GROUP definition is denoted with the 'group' directive, and the end of a GROUP definition is denoted with the 'end' directive. Each GROUP contains 0 or more member blocks (HDUs or GROUPs). Member blocks of type GROUP can contain their own member blocks. The GROUP definition itself occupies one FITS file HDU of special type (GROUP HDU), so if a template specifies 1 group with 1 member HDU like: \begin{verbatim} \group grpdescr = 'demo' xtension bintable # this bintable has 0 cols, 0 rows \end \end{verbatim} then the parser creates a FITS file with 3 HDUs : \begin{verbatim} 1) dummy PHDU 2) GROUP HDU (has 1 member, which is bintable in HDU number 3) 3) bintable (member of GROUP in HDU number 2) \end{verbatim} Technically speaking, the GROUP HDU is a BINTABLE with 6 columns. Applications can define additional columns in a GROUP HDU using TFORMn and TTYPEn (where n is 7, 8, ....) keywords or their auto-indexing equivalents. For a more complicated example of a template file using the group directives, look at the sample.tpl file that is included in the CFITSIO distribution. \section{Formal Template Syntax} The template syntax can formally be defined as follows: \begin{verbatim} TEMPLATE = BLOCK [ BLOCK ... ] BLOCK = { HDU | GROUP } GROUP = \GROUP [ BLOCK ... ] \END HDU = XTENSION [ LINE ... ] { XTENSION | \GROUP | \END | EOF } LINE = [ KEYWORD [ = ] ] [ VALUE ] [ / COMMENT ] X ... - X can be present 1 or more times { X | Y } - X or Y [ X ] - X is optional \end{verbatim} At the topmost level, the template defines 1 or more template blocks. Blocks can be either HDU (Header Data Unit) or a GROUP. For each block the parser creates 1 (or more for GROUPs) FITS file HDUs. \section{Errors} In general the fits\_execute\_template() function tries to be as atomic as possible, so either everything is done or nothing is done. If an error occurs during parsing of the template, fits\_execute\_template() will (try to) delete the top level BLOCK (with all its children if any) in which the error occurred, then it will stop reading the template file and it will return with an error. \section{Examples} 1. This template file will create a 200 x 300 pixel image, with 4-byte integer pixel values, in the primary HDU: \begin{verbatim} SIMPLE = T BITPIX = 32 NAXIS = 2 / number of dimensions NAXIS1 = 100 / length of first axis NAXIS2 = 200 / length of second axis OBJECT = NGC 253 / name of observed object \end{verbatim} The allowed values of BITPIX are 8, 16, 32, -32, or -64, representing, respectively, 8-bit integer, 16-bit integer, 32-bit integer, 32-bit floating point, or 64 bit floating point pixels. 2. To create a FITS table, the template first needs to include XTENSION = TABLE or BINTABLE to define whether it is an ASCII or binary table, and NAXIS2 to define the number of rows in the table. Two template lines are then needed to define the name (TTYPEn) and FITS data format (TFORMn) of the columns, as in this example: \begin{verbatim} xtension = bintable naxis2 = 40 ttype# = Name tform# = 10a ttype# = Npoints tform# = j ttype# = Rate tunit# = counts/s tform# = e \end{verbatim} The above example defines a null primary array followed by a 40-row binary table extension with 3 columns called 'Name', 'Npoints', and 'Rate', with data formats of '10A' (ASCII character string), '1J' (integer) and '1E' (floating point), respectively. Note that the other required FITS keywords (BITPIX, NAXIS, NAXIS1, PCOUNT, GCOUNT, TFIELDS, and END) do not need to be explicitly defined in the template because their values can be inferred from the other keywords in the template. This example also illustrates that the templates are generally case-insensitive (the keyword names and TFORMn values are converted to upper-case in the FITS file) and that string keyword values generally do not need to be enclosed in quotes. \chapter{ Local FITS Conventions } CFITSIO supports several local FITS conventions which are not defined in the official FITS standard and which are not necessarily recognized or supported by other FITS software packages. Programmers should be cautious about using these features, especially if the FITS files that are produced are expected to be processed by other software systems which do not use the CFITSIO interface. \section{64-Bit Long Integers} CFITSIO supports reading and writing FITS images or table columns containing 64-bit integer data values. Support for 64-bit integers was added to the official FITS Standard in December 2005. FITS 64-bit images have BITPIX = 64, and the 64-bit binary table columns have TFORMn = 'K'. CFITSIO also supports the 'Q' variable-length array table column format which is analogous to the 'P' column format except that the array descriptor is stored as a pair of 64-bit integers. For the convenience of C programmers, the fitsio.h include file defines (with a typedef statement) the 'LONGLONG' datatype to be equivalent to an appropriate 64-bit integer datatype on each platform. Since there is currently no universal standard for the name of the 64-bit integer datatype (it might be defined as 'long long', 'long', or '\_\_int64' depending on the platform) C programmers may prefer to use the 'LONGLONG' datatype when declaring or allocating 64-bit integer quantities when writing code which needs to run on multiple platforms. Note that CFITSIO will implicitly convert the datatype when reading or writing FITS 64-bit integer images and columns with data arrays of a different integer or floating point datatype, but there is an increased risk of loss of numerical precision or numerical overflow in this case. \section{Long String Keyword Values.} The length of a standard FITS string keyword is limited to 68 characters because it must fit entirely within a single FITS header keyword record. In some instances it is necessary to encode strings longer than this limit, so CFITSIO supports a local convention in which the string value is continued over multiple keywords. This continuation convention uses an ampersand character at the end of each substring to indicate that it is continued on the next keyword, and the continuation keywords all have the name CONTINUE without an equal sign in column 9. The string value may be continued in this way over as many additional CONTINUE keywords as is required. The following lines illustrate this continuation convention which is used in the value of the STRKEY keyword: \begin{verbatim} LONGSTRN= 'OGIP 1.0' / The OGIP Long String Convention may be used. STRKEY = 'This is a very long string keyword&' / Optional Comment CONTINUE ' value that is continued over 3 keywords in the & ' CONTINUE 'FITS header.' / This is another optional comment. \end{verbatim} It is recommended that the LONGSTRN keyword, as shown here, always be included in any HDU that uses this longstring convention as a warning to any software that must read the keywords. A routine called fits\_write\_key\_longwarn has been provided in CFITSIO to write this keyword if it does not already exist. This long string convention is supported by the following CFITSIO routines: \begin{verbatim} fits_write_key_longstr - write a long string keyword value fits_insert_key_longstr - insert a long string keyword value fits_modify_key_longstr - modify a long string keyword value fits_update_key_longstr - modify a long string keyword value fits_read_key_longstr - read a long string keyword value fits_delete_key - delete a keyword \end{verbatim} The fits\_read\_key\_longstr routine is unique among all the CFITSIO routines in that it internally allocates memory for the long string value; all the other CFITSIO routines that deal with arrays require that the calling program pre-allocate adequate space to hold the array of data. Consequently, programs which use the fits\_read\_key\_longstr routine must be careful to free the allocated memory for the string when it is no longer needed. The following 2 routines also have limited support for this long string convention, \begin{verbatim} fits_modify_key_str - modify an existing string keyword value fits_update_key_str - update a string keyword value \end{verbatim} in that they will correctly overwrite an existing long string value, but the new string value is limited to a maximum of 68 characters in length. The more commonly used CFITSIO routines to write string valued keywords (fits\_update\_key and fits\_write\_key) do not support this long string convention and only support strings up to 68 characters in length. This has been done deliberately to prevent programs from inadvertently writing keywords using this non-standard convention without the explicit intent of the programmer or user. The fits\_write\_key\_longstr routine must be called instead to write long strings. This routine can also be used to write ordinary string values less than 68 characters in length. \section{Arrays of Fixed-Length Strings in Binary Tables} CFITSIO supports 2 ways to specify that a character column in a binary table contains an array of fixed-length strings. The first way, which is officially supported by the FITS Standard document, uses the TDIMn keyword. For example, if TFORMn = '60A' and TDIMn = '(12,5)' then that column will be interpreted as containing an array of 5 strings, each 12 characters long. CFITSIO also supports a local convention for the format of the TFORMn keyword value of the form 'rAw' where 'r' is an integer specifying the total width in characters of the column, and 'w' is an integer specifying the (fixed) length of an individual unit string within the vector. For example, TFORM1 = '120A10' would indicate that the binary table column is 120 characters wide and consists of 12 10-character length strings. This convention is recognized by the CFITSIO routines that read or write strings in binary tables. The Binary Table definition document specifies that other optional characters may follow the data type code in the TFORM keyword, so this local convention is in compliance with the FITS standard although other FITS readers may not recognize this convention. \section{Keyword Units Strings} One limitation of the current FITS Standard is that it does not define a specific convention for recording the physical units of a keyword value. The TUNITn keyword can be used to specify the physical units of the values in a table column, but there is no analogous convention for keyword values. The comment field of the keyword is often used for this purpose, but the units are usually not specified in a well defined format that FITS readers can easily recognize and extract. To solve this problem, CFITSIO uses a local convention in which the keyword units are enclosed in square brackets as the first token in the keyword comment field; more specifically, the opening square bracket immediately follows the slash '/' comment field delimiter and a single space character. The following examples illustrate keywords that use this convention: \begin{verbatim} EXPOSURE= 1800.0 / [s] elapsed exposure time V_HELIO = 16.23 / [km s**(-1)] heliocentric velocity LAMBDA = 5400. / [angstrom] central wavelength FLUX = 4.9033487787637465E-30 / [J/cm**2/s] average flux \end{verbatim} In general, the units named in the IAU(1988) Style Guide are recommended, with the main exception that the preferred unit for angle is 'deg' for degrees. The fits\_read\_key\_unit and fits\_write\_key\_unit routines in CFITSIO read and write, respectively, the keyword unit strings in an existing keyword. \section{HIERARCH Convention for Extended Keyword Names} CFITSIO supports the HIERARCH keyword convention which allows keyword names that are longer than 8 characters. This convention was developed at the European Southern Observatory (ESO) and allows characters consisting of digits 0-9, upper case letters A-Z, the dash '-' and the underscore '\_'. The components of hierarchical keywords are separated by a single ASCII space charater. For instance: \begin{verbatim} HIERARCH ESO INS FOCU POS = -0.00002500 / Focus position \end{verbatim} Basically, this convention uses the FITS keyword 'HIERARCH' to indicate that this convention is being used, then the actual keyword name ({\tt'ESO INS FOCU POS'} in this example) begins in column 10. The equals sign marks the end of the keyword name and is followed by the usual value and comment fields just as in standard FITS keywords. Further details of this convention are described at http://fits.gsfc.nasa.gov/registry/hierarch\_keyword.html and in Section 4.4 of the ESO Data Interface Control Document that is linked to from http://archive.eso.org/cms/tools-documentation/eso-data-interface-control.html. This convention allows a broader range of keyword names than is allowed by the FITS Standard. Here are more examples of such keywords: \begin{verbatim} HIERARCH LONGKEYWORD = 47.5 / Keyword has > 8 characters HIERARCH LONG-KEY_WORD2 = 52.3 / Long keyword with hyphen, underscore and digit HIERARCH EARTH IS A STAR = F / Keyword contains embedded spaces \end{verbatim} CFITSIO will transparently read and write these keywords, so application programs do not in general need to know anything about the specific implementation details of the HIERARCH convention. In particular, application programs do not need to specify the `HIERARCH' part of the keyword name when reading or writing keywords (although it may be included if desired). When writing a keyword, CFITSIO first checks to see if the keyword name is legal as a standard FITS keyword (no more than 8 characters long and containing only letters, digits, or a minus sign or underscore). If so it writes it as a standard FITS keyword, otherwise it uses the hierarch convention to write the keyword. The maximum keyword name length is 67 characters, which leaves only 1 space for the value field. A more practical limit is about 40 characters, which leaves enough room for most keyword values. CFITSIO returns an error if there is not enough room for both the keyword name and the keyword value on the 80-character card, except for string-valued keywords which are simply truncated so that the closing quote character falls in column 80. A space is also required on either side of the equal sign. \section{Tile-Compressed Image Format} CFITSIO supports a convention for compressing n-dimensional images and storing the resulting byte stream in a variable-length column in a FITS binary table. The general principle used in this convention is to first divide the n-dimensional image into a rectangular grid of subimages or `tiles'. Each tile is then compressed as a continuous block of data, and the resulting compressed byte stream is stored in a row of a variable length column in a FITS binary table. By dividing the image into tiles it is generally possible to extract and uncompress subsections of the image without having to uncompress the whole image. The default tiling pattern treats each row of a 2-dimensional image (or higher dimensional cube) as a tile, such that each tile contains NAXIS1 pixels (except the default with the HCOMPRESS algorithm is to compress the whole 2D image as a single tile). Any other rectangular tiling pattern may also be defined. In the case of relatively small images it may be sufficient to compress the entire image as a single tile, resulting in an output binary table with 1 row. In the case of 3-dimensional data cubes, it may be advantageous to treat each plane of the cube as a separate tile if application software typically needs to access the cube on a plane by plane basis. See section 5.6 ``Image Compression'' for more information on using this tile-compressed image format. \chapter{ Optimizing Programs } CFITSIO has been carefully designed to obtain the highest possible speed when reading and writing FITS files. In order to achieve the best performance, however, application programmers must be careful to call the CFITSIO routines appropriately and in an efficient sequence; inappropriate usage of CFITSIO routines can greatly slow down the execution speed of a program. The maximum possible I/O speed of CFITSIO depends of course on the type of computer system that it is running on. To get a general idea of what data I/O speeds are possible on a particular machine, build the speed.c program that is distributed with CFITSIO (type 'make speed' in the CFITSIO directory). This diagnostic program measures the speed of writing and reading back a test FITS image, a binary table, and an ASCII table. The following 2 sections provide some background on how CFITSIO internally manages the data I/O and describes some strategies that may be used to optimize the processing speed of software that uses CFITSIO. \section{How CFITSIO Manages Data I/O} Many CFITSIO operations involve transferring only a small number of bytes to or from the FITS file (e.g, reading a keyword, or writing a row in a table); it would be very inefficient to physically read or write such small blocks of data directly in the FITS file on disk, therefore CFITSIO maintains a set of internal Input--Output (IO) buffers in RAM memory that each contain one FITS block (2880 bytes) of data. Whenever CFITSIO needs to access data in the FITS file, it first transfers the FITS block containing those bytes into one of the IO buffers in memory. The next time CFITSIO needs to access bytes in the same block it can then go to the fast IO buffer rather than using a much slower system disk access routine. The number of available IO buffers is determined by the NIOBUF parameter (in fitsio2.h) and is currently set to 40 by default. Whenever CFITSIO reads or writes data it first checks to see if that block of the FITS file is already loaded into one of the IO buffers. If not, and if there is an empty IO buffer available, then it will load that block into the IO buffer (when reading a FITS file) or will initialize a new block (when writing to a FITS file). If all the IO buffers are already full, it must decide which one to reuse (generally the one that has been accessed least recently), and flush the contents back to disk if it has been modified before loading the new block. The one major exception to the above process occurs whenever a large contiguous set of bytes are accessed, as might occur when reading or writing a FITS image. In this case CFITSIO bypasses the internal IO buffers and simply reads or writes the desired bytes directly in the disk file with a single call to a low-level file read or write routine. The minimum threshold for the number of bytes to read or write this way is set by the MINDIRECT parameter and is currently set to 3 FITS blocks = 8640 bytes. This is the most efficient way to read or write large chunks of data. Note that this fast direct IO process is not applicable when accessing columns of data in a FITS table because the bytes are generally not contiguous since they are interleaved by the other columns of data in the table. This explains why the speed for accessing FITS tables is generally slower than accessing FITS images. Given this background information, the general strategy for efficiently accessing FITS files should be apparent: when dealing with FITS images, read or write large chunks of data at a time so that the direct IO mechanism will be invoked; when accessing FITS headers or FITS tables, on the other hand, once a particular FITS block has been loading into one of the IO buffers, try to access all the needed information in that block before it gets flushed out of the IO buffer. It is important to avoid the situation where the same FITS block is being read then flushed from a IO buffer multiple times. The following section gives more specific suggestions for optimizing the use of CFITSIO. \section{Optimization Strategies} 1. Because the data in FITS files is always stored in "big-endian" byte order, where the first byte of numeric values contains the most significant bits and the last byte contains the least significant bits, CFITSIO must swap the order of the bytes when reading or writing FITS files when running on little-endian machines (e.g., Linux and Microsoft Windows operating systems running on PCs with x86 CPUs). On relatively new CPUs that support "SSSE3" machine instructions (e.g., starting with Intel Core 2 CPUs in 2007, and in AMD CPUs beginning in 2011) significantly faster 4-byte and 8-byte swapping algorithms are available. These faster byte swapping functions are not used by default in CFITSIO (because of potential code portablility issues), but users can enable them on supported platforms by adding the appropriate compiler flags (-mssse3 with gcc or icc on linux) when compiling the swapproc.c source file, which will allow the compiler to generate code using the SSSE3 instruction set. A convenient way to do this is to configure the CFITSIO library with the following command: \begin{verbatim} > ./configure --enable-ssse3 \end{verbatim} Note, however, that a binary executable file that is created using these faster functions will only run on machines that support the SSSE3 machine instructions. For faster 2-byte swaps on virtually all x86-64 CPUs (even those that do not support SSSE3), a variant using only SSE2 instructions exists. SSE2 is enabled by default on x86\_64 CPUs with 64-bit operating systems (and is also automatically enabled by the --enable-ssse3 flag). When running on x86\_64 CPUs with 32-bit operating systems, these faster 2-byte swapping algorithms are not used by default in CFITSIO, but can be enabled explicitly with: \begin{verbatim} ./configure --enable-sse2 \end{verbatim} Preliminary testing indicates that these SSSE3 and SSE2 based byte-swapping algorithms can boost the CFITSIO performance when reading or writing FITS images by 20\% - 30\% or more. It is important to note, however, that compiler optimization must be turned on (e.g., by using the -O1 or -O2 flags in gcc) when building programs that use these fast byte-swapping algorithms in order to reap the full benefit of the SSSE3 and SSE2 instructions; without optimization, the code may actually run slower than when using more traditional byte-swapping techniques. 2. When dealing with a FITS primary array or IMAGE extension, it is more efficient to read or write large chunks of the image at a time (at least 3 FITS blocks = 8640 bytes) so that the direct IO mechanism will be used as described in the previous section. Smaller chunks of data are read or written via the IO buffers, which is somewhat less efficient because of the extra copy operation and additional bookkeeping steps that are required. In principle it is more efficient to read or write as big an array of image pixels at one time as possible, however, if the array becomes so large that the operating system cannot store it all in RAM, then the performance may be degraded because of the increased swapping of virtual memory to disk. 3. When dealing with FITS tables, the most important efficiency factor in the software design is to read or write the data in the FITS file in a single pass through the file. An example of poor program design would be to read a large, 3-column table by sequentially reading the entire first column, then going back to read the 2nd column, and finally the 3rd column; this obviously requires 3 passes through the file which could triple the execution time of an IO limited program. For small tables this is not important, but when reading multi-megabyte sized tables these inefficiencies can become significant. The more efficient procedure in this case is to read or write only as many rows of the table as will fit into the available internal IO buffers, then access all the necessary columns of data within that range of rows. Then after the program is completely finished with the data in those rows it can move on to the next range of rows that will fit in the buffers, continuing in this way until the entire file has been processed. By using this procedure of accessing all the columns of a table in parallel rather than sequentially, each block of the FITS file will only be read or written once. The optimal number of rows to read or write at one time in a given table depends on the width of the table row and on the number of IO buffers that have been allocated in CFITSIO. The CFITSIO Iterator routine will automatically use the optimal-sized buffer, but there is also a CFITSIO routine that will return the optimal number of rows for a given table: fits\_get\_rowsize. It is not critical to use exactly the value of nrows returned by this routine, as long as one does not exceed it. Using a very small value however can also lead to poor performance because of the overhead from the larger number of subroutine calls. The optimal number of rows returned by fits\_get\_rowsize is valid only as long as the application program is only reading or writing data in the specified table. Any other calls to access data in the table header would cause additional blocks of data to be loaded into the IO buffers displacing data from the original table, and should be avoided during the critical period while the table is being read or written. 4. Use the CFITSIO Iterator routine. This routine provides a more `object oriented' way of reading and writing FITS files which automatically uses the most appropriate data buffer size to achieve the maximum I/O throughput. 5. Use binary table extensions rather than ASCII table extensions for better efficiency when dealing with tabular data. The I/O to ASCII tables is slower because of the overhead in formatting or parsing the ASCII data fields and because ASCII tables are about twice as large as binary tables that have the same information content. 6. Design software so that it reads the FITS header keywords in the same order in which they occur in the file. When reading keywords, CFITSIO searches forward starting from the position of the last keyword that was read. If it reaches the end of the header without finding the keyword, it then goes back to the start of the header and continues the search down to the position where it started. In practice, as long as the entire FITS header can fit at one time in the available internal IO buffers, then the header keyword access will be relatively fast and it makes little difference which order they are accessed. 7. Avoid the use of scaling (by using the BSCALE and BZERO or TSCAL and TZERO keywords) in FITS files since the scaling operations add to the processing time needed to read or write the data. In some cases it may be more efficient to temporarily turn off the scaling (using fits\_set\_bscale or fits\_set\_tscale) and then read or write the raw unscaled values in the FITS file. 8. Avoid using the `implicit data type conversion' capability in CFITSIO. For instance, when reading a FITS image with BITPIX = -32 (32-bit floating point pixels), read the data into a single precision floating point data array in the program. Forcing CFITSIO to convert the data to a different data type can slow the program. 9. Where feasible, design FITS binary tables using vector column elements so that the data are written as a contiguous set of bytes, rather than as single elements in multiple rows. For example, it is faster to access the data in a table that contains a single row and 2 columns with TFORM keywords equal to '10000E' and '10000J', than it is to access the same amount of data in a table with 10000 rows which has columns with the TFORM keywords equal to '1E' and '1J'. In the former case the 10000 floating point values in the first column are all written in a contiguous block of the file which can be read or written quickly, whereas in the second case each floating point value in the first column is interleaved with the integer value in the second column of the same row so CFITSIO has to explicitly move to the position of each element to be read or written. 10. Avoid the use of variable length vector columns in binary tables, since any reading or writing of these data requires that CFITSIO first look up or compute the starting address of each row of data in the heap. In practice, this is probably not a significant efficiency issue. 11. When copying data from one FITS table to another, it is faster to transfer the raw bytes instead of reading then writing each column of the table. The CFITSIO routines fits\_read\_tblbytes and fits\_write\_tblbytes will perform low-level reads or writes of any contiguous range of bytes in a table extension. These routines can be used to read or write a whole row (or multiple rows for even greater efficiency) of a table with a single function call. These routines are fast because they bypass all the usual data scaling, error checking and machine dependent data conversion that is normally done by CFITSIO, and they allow the program to write the data to the output file in exactly the same byte order. For these same reasons, these routines can corrupt the FITS data file if used incorrectly because no validation or machine dependent conversion is performed by these routines. These routines are only recommended for optimizing critical pieces of code and should only be used by programmers who thoroughly understand the internal format of the FITS tables they are reading or writing. 12. Another strategy for improving the speed of writing a FITS table, similar to the previous one, is to directly construct the entire byte stream for a whole table row (or multiple rows) within the application program and then write it to the FITS file with fits\_write\_tblbytes. This avoids all the overhead normally present in the column-oriented CFITSIO write routines. This technique should only be used for critical applications because it makes the code more difficult to understand and maintain, and it makes the code more system dependent (e.g., do the bytes need to be swapped before writing to the FITS file?). 13. Finally, external factors such as the speed of the data storage device, the size of the data cache, the amount of disk fragmentation, and the amount of RAM available on the system can all have a significant impact on overall I/O efficiency. For critical applications, the entire hardware and software system should be reviewed to identify any potential I/O bottlenecks. \appendix \chapter{Index of Routines } \begin{tabular}{lr} fits\_add\_group\_member & \pageref{ffgtam} \\ fits\_ascii\_tform & \pageref{ffasfm} \\ fits\_binary\_tform & \pageref{ffbnfm} \\ fits\_calculator & \pageref{ffcalc} \\ fits\_calculator\_rng & \pageref{ffcalcrng} \\ fits\_calc\_binning[d] & \pageref{calcbinning} \\ fits\_calc\_rows & \pageref{ffcrow} \\ fits\_change\_group & \pageref{ffgtch} \\ fits\_cleanup\_https & \pageref{ffihtps} \\ fits\_clear\_errmark & \pageref{ffpmrk} \\ fits\_clear\_errmsg & \pageref{ffcmsg} \\ fits\_close\_file & \pageref{ffclos} \\ fits\_compact\_group & \pageref{ffgtcm} \\ fits\_compare\_str & \pageref{ffcmps} \\ fits\_compress\_heap & \pageref{ffcmph} \\ fits\_convert\_hdr2str & \pageref{ffhdr2str}, \pageref{hdr2str} \\ fits\_copy\_cell2image & \pageref{copycell} \\ fits\_copy\_col & \pageref{ffcpcl} \\ fits\_copy\_cols & \pageref{ffccls} \\ fits\_copy\_data & \pageref{ffcpdt} \\ fits\_copy\_file & \pageref{ffcpfl} \\ fits\_copy\_group & \pageref{ffgtcp} \\ fits\_copy\_hdu & \pageref{ffcopy} \\ fits\_copy\_header & \pageref{ffcphd} \\ fits\_copy\_image2cell & \pageref{copycell} \\ fits\_copy\_image\_section & \pageref{ffcpimg} \\ fits\_copy\_key & \pageref{ffcpky} \\ fits\_copy\_member & \pageref{ffgmcp} \\ fits\_copy\_pixlist2image & \pageref{copypixlist2image} \\ fits\_copy\_rows & \pageref{ffcprw} \\ fits\_create\_diskfile & \pageref{ffinit} \\ fits\_create\_file & \pageref{ffinit} \\ \end{tabular} \begin{tabular}{lr} fits\_create\_group & \pageref{ffgtcr} \\ fits\_create\_hdu & \pageref{ffcrhd} \\ fits\_create\_img & \pageref{ffcrim} \\ fits\_create\_memfile & \pageref{ffimem} \\ fits\_create\_tbl & \pageref{ffcrtb} \\ fits\_create\_template & \pageref{fftplt} \\ fits\_date2str & \pageref{ffdt2s} \\ fits\_decode\_chksum & \pageref{ffdsum} \\ fits\_decode\_tdim & \pageref{ffdtdm} \\ fits\_delete\_col & \pageref{ffdcol} \\ fits\_delete\_file & \pageref{ffdelt} \\ fits\_delete\_hdu & \pageref{ffdhdu} \\ fits\_delete\_key & \pageref{ffdkey} \\ fits\_delete\_record & \pageref{ffdrec} \\ fits\_delete\_rowlist & \pageref{ffdrws} \\ fits\_delete\_rowrange & \pageref{ffdrrg} \\ fits\_delete\_rows & \pageref{ffdrow} \\ fits\_delete\_str & \pageref{ffdkey} \\ fits\_encode\_chksum & \pageref{ffesum} \\ fits\_file\_exists & \pageref{ffexist} \\ fits\_file\_mode & \pageref{ffflmd} \\ fits\_file\_name & \pageref{ffflnm} \\ fits\_find\_first\_row & \pageref{ffffrw} \\ fits\_find\_nextkey & \pageref{ffgnxk} \\ fits\_find\_rows & \pageref{fffrow} \\ fits\_flush\_buffer & \pageref{ffflus} \\ fits\_flush\_file & \pageref{ffflus} \\ fits\_free\_memory & \pageref{ffgkls}, \pageref{ffhdr2str} \\ fits\_get\_acolparms & \pageref{ffgacl} \\ fits\_get\_bcolparms & \pageref{ffgbcl} \\ fits\_get\_chksum & \pageref{ffgcks} \\ fits\_get\_col\_display\_width & \pageref{ffgcdw} \\ \end{tabular} \begin{tabular}{lr} fits\_get\_colname & \pageref{ffgcnn} \\ fits\_get\_colnum & \pageref{ffgcno} \\ fits\_get\_coltype & \pageref{ffgtcl} \\ fits\_get\_compression\_type & \pageref{ffgetcomp} \\ fits\_get\_eqcoltype & \pageref{ffgtcl} \\ fits\_get\_errstatus & \pageref{ffgerr} \\ fits\_get\_hdrpos & \pageref{ffghps} \\ fits\_get\_hdrspace & \pageref{ffghsp} \\ fits\_get\_hdu\_num & \pageref{ffghdn} \\ fits\_get\_hdu\_type & \pageref{ffghdt} \\ fits\_get\_hduaddr & \pageref{ffghad} \\ fits\_get\_hduaddrll & \pageref{ffghad} \\ fits\_get\_img\_dim & \pageref{ffgidm} \\ fits\_get\_img\_equivtype & \pageref{ffgidt} \\ fits\_get\_img\_param & \pageref{ffgipr} \\ fits\_get\_img\_size & \pageref{ffgisz} \\ fits\_get\_img\_type & \pageref{ffgidt} \\ fits\_get\_inttype & \pageref{ffinttyp} \\ fits\_get\_key\_strlen & \pageref{ffgksl} \\ fits\_get\_keyclass & \pageref{ffgkcl} \\ fits\_get\_keyname & \pageref{ffgknm} \\ fits\_get\_keytype & \pageref{ffdtyp} \\ fits\_get\_noise\_bits & \pageref{ffgetcomp} \\ fits\_get\_num\_cols & \pageref{ffgnrw} \\ fits\_get\_num\_groups & \pageref{ffgmng} \\ fits\_get\_num\_hdus & \pageref{ffthdu} \\ fits\_get\_num\_members & \pageref{ffgtnm} \\ fits\_get\_num\_rows & \pageref{ffgnrw} \\ fits\_get\_rowsize & \pageref{ffgrsz} \\ fits\_get\_system\_time & \pageref{ffdt2s} \\ fits\_get\_tbcol & \pageref{ffgabc} \\ fits\_get\_tile\_dim & \pageref{ffgetcomp} \\ \end{tabular} \newpage \begin{tabular}{lr} fits\_get\_timeout & \pageref{ffgtmo} \\ fits\_get\_version & \pageref{ffvers} \\ fits\_hdr2str & \pageref{ffhdr2str}, \pageref{hdr2str} \\ fits\_init\_https & \pageref{ffihtps} \\ fits\_insert\_atbl & \pageref{ffitab} \\ fits\_insert\_btbl & \pageref{ffibin} \\ fits\_insert\_col & \pageref{fficol} \\ fits\_insert\_cols & \pageref{fficls} \\ fits\_insert\_group & \pageref{ffgtis} \\ fits\_insert\_img & \pageref{ffiimg} \\ fits\_insert\_key\_null & \pageref{ffikyu} \\ fits\_insert\_key\_TYP & \pageref{ffikyx} \\ fits\_insert\_record & \pageref{ffirec} \\ fits\_insert\_rows & \pageref{ffirow} \\ fits\_is\_reentrant & \pageref{reentrant} \\ fits\_iterate\_data & \pageref{ffiter} \\ fits\_make\_hist[d] & \pageref{makehist} \\ fits\_make\_key & \pageref{ffmkky} \\ fits\_make\_keyn & \pageref{ffkeyn} \\ fits\_make\_nkey & \pageref{ffnkey} \\ fits\_merge\_groups & \pageref{ffgtmg} \\ fits\_modify\_card & \pageref{ffmcrd} \\ fits\_modify\_comment & \pageref{ffmcom} \\ fits\_modify\_key\_null & \pageref{ffmkyu} \\ fits\_modify\_key\_TYP & \pageref{ffmkyx} \\ fits\_modify\_name & \pageref{ffmnam} \\ fits\_modify\_record & \pageref{ffmrec} \\ fits\_modify\_vector\_len & \pageref{ffmvec} \\ fits\_movabs\_hdu & \pageref{ffmahd} \\ fits\_movnam\_hdu & \pageref{ffmnhd} \\ fits\_movrel\_hdu & \pageref{ffmrhd} \\ fits\_null\_check & \pageref{ffnchk} \\ fits\_open\_data & \pageref{ffopen} \\ fits\_open\_diskfile & \pageref{ffopen} \\ fits\_open\_extlist & \pageref{ffopen} \\ fits\_open\_file & \pageref{ffopen} \\ fits\_open\_image & \pageref{ffopen} \\ fits\_open\_table & \pageref{ffopen} \\ fits\_open\_group & \pageref{ffgtop} \\ fits\_open\_member & \pageref{ffgmop} \\ fits\_open\_memfile & \pageref{ffomem} \\ fits\_parse\_extnum & \pageref{ffextn} \\ fits\_parse\_input\_filename & \pageref{ffiurl} \\ fits\_parse\_input\_url & \pageref{ffiurl} \\ fits\_parse\_range & \pageref{ffrwrg} \\ fits\_parse\_rootname & \pageref{ffrtnm} \\ fits\_parse\_template & \pageref{ffgthd} \\ fits\_parse\_value & \pageref{ffpsvc} \\ \end{tabular} \begin{tabular}{lr} fits\_pix\_to\_world & \pageref{ffwldp} \\ fits\_read\_2d\_TYP & \pageref{ffg2dx} \\ fits\_read\_3d\_TYP & \pageref{ffg3dx} \\ fits\_read\_atblhdr & \pageref{ffghtb} \\ fits\_read\_btblhdr & \pageref{ffghbn} \\ fits\_read\_card & \pageref{ffgcrd} \\ fits\_read\_col & \pageref{ffgcv} \\ fits\_read\_col\_bit\_ & \pageref{ffgcx} \\ fits\_read\_col\_TYP & \pageref{ffgcvx} \\ fits\_read\_colnull & \pageref{ffgcf} \\ fits\_read\_colnull\_TYP & \pageref{ffgcfx} \\ fits\_read\_descript & \pageref{ffgdes} \\ fits\_read\_descripts & \pageref{ffgdes} \\ fits\_read\_errmsg & \pageref{ffgmsg} \\ fits\_read\_ext & \pageref{ffgextn} \\ fits\_read\_grppar\_TYP & \pageref{ffggpx} \\ fits\_read\_img & \pageref{ffgpv} \\ fits\_read\_img\_coord & \pageref{ffgics} \\ fits\_read\_img\_TYP & \pageref{ffgpvx} \\ fits\_read\_imghdr & \pageref{ffghpr} \\ fits\_read\_imgnull & \pageref{ffgpf} \\ fits\_read\_imgnull\_TYP & \pageref{ffgpfx} \\ fits\_read\_key & \pageref{ffgky} \\ fits\_read\_key\_longstr & \pageref{ffgkls} \\ fits\_read\_key\_triple & \pageref{ffgkyt} \\ fits\_read\_key\_unit & \pageref{ffgunt} \\ fits\_read\_key\_TYP & \pageref{ffgkyx} \\ fits\_read\_keyn & \pageref{ffgkyn} \\ fits\_read\_keys\_TYP & \pageref{ffgknx} \\ fits\_read\_keyword & \pageref{ffgkey} \\ fits\_read\_pix & \pageref{ffgpxv} \\ fits\_read\_pixnull & \pageref{ffgpxf} \\ fits\_read\_record & \pageref{ffgrec} \\ fits\_read\_str & \pageref{ffgcrd} \\ fits\_read\_string\_key & \pageref{ffgsky} \\ fits\_read\_subset & \pageref{ffgsv} \\ fits\_read\_subset\_TYP & \pageref{ffgsvx} \pageref{ffgsvx2}\\ fits\_read\_subsetnull\_TYP & \pageref{ffgsfx} \pageref{ffgsfx2} \\ fits\_read\_tbl\_coord & \pageref{ffgtcs} \\ fits\_read\_tblbytes & \pageref{ffgtbb} \\ fits\_read\_tdim & \pageref{ffgtdm} \\ fits\_read\_wcstab & \pageref{wcstab} \\ fits\_rebin\_wcs[d] & \pageref{rebinwcs} \\ fits\_remove\_group & \pageref{ffgtrm} \\ fits\_remove\_member & \pageref{ffgmrm} \\ fits\_reopen\_file & \pageref{ffreopen} \\ fits\_report\_error & \pageref{ffrprt} \\ fits\_resize\_img & \pageref{ffrsim} \\ \end{tabular} \begin{tabular}{lr} fits\_rms\_float & \pageref{imageRMS} \\ fits\_rms\_short & \pageref{imageRMS} \\ fits\_select\_rows & \pageref{ffsrow} \\ fits\_set\_atblnull & \pageref{ffsnul} \\ fits\_set\_bscale & \pageref{ffpscl} \\ fits\_set\_btblnull & \pageref{fftnul} \\ fits\_set\_compression\_type & \pageref{ffsetcomp} \\ fits\_set\_hdrsize & \pageref{ffhdef} \\ fits\_set\_hdustruc & \pageref{ffrdef} \\ fits\_set\_imgnull & \pageref{ffpnul} \\ fits\_set\_noise\_bits & \pageref{ffsetcomp} \\ fits\_set\_tile\_dim & \pageref{ffsetcomp} \\ fits\_set\_timeout & \pageref{ffgtmo} \\ fits\_set\_tscale & \pageref{fftscl} \\ fits\_show\_download\_progress & \pageref{ffshdwn} \\ fits\_split\_names & \pageref{splitnames} \\ fits\_str2date & \pageref{ffdt2s} \\ fits\_str2time & \pageref{ffdt2s} \\ fits\_test\_expr & \pageref{fftexp} \\ fits\_test\_heap & \pageref{fftheap} \\ fits\_test\_keyword & \pageref{fftkey} \\ fits\_test\_record & \pageref{fftrec} \\ fits\_time2str & \pageref{ffdt2s} \\ fits\_transfer\_member & \pageref{ffgmtf} \\ fits\_translate\_keyword & \pageref{translatekey} \\ fits\_update\_card & \pageref{ffucrd} \\ fits\_update\_chksum & \pageref{ffupck} \\ fits\_update\_key & \pageref{ffuky} \\ fits\_update\_key\_longstr & \pageref{ffukyx} \\ fits\_update\_key\_null & \pageref{ffukyu} \\ fits\_update\_key\_TYP & \pageref{ffukyx} \\ fits\_uppercase & \pageref{ffupch} \\ fits\_url\_type & \pageref{ffurlt} \\ fits\_verbose\_https & \pageref{ffvhtps} \\ fits\_verify\_chksum & \pageref{ffvcks} \\ fits\_verify\_group & \pageref{ffgtvf} \\ fits\_world\_to\_pix & \pageref{ffxypx} \\ fits\_write\_2d\_TYP & \pageref{ffp2dx} \\ fits\_write\_3d\_TYP & \pageref{ffp3dx} \\ fits\_write\_atblhdr & \pageref{ffphtb} \\ fits\_write\_btblhdr & \pageref{ffphbn} \\ fits\_write\_chksum & \pageref{ffpcks} \\ fits\_write\_col & \pageref{ffpcl} \\ fits\_write\_col\_bit & \pageref{ffpclx} \\ fits\_write\_col\_TYP & \pageref{ffpcls} \\ fits\_write\_col\_null & \pageref{ffpclu} \\ fits\_write\_colnull & \pageref{ffpcn} \\ fits\_write\_colnull\_TYP & \pageref{ffpcnx} \\ \end{tabular} \newpage \begin{tabular}{lr} fits\_write\_comment & \pageref{ffpcom} \\ fits\_write\_date & \pageref{ffpdat} \\ fits\_write\_descript & \pageref{ffpdes} \\ fits\_write\_errmark & \pageref{ffpmrk} \\ fits\_write\_errmsg & \pageref{ffpmsg} \\ fits\_write\_ext & \pageref{ffgextn} \\ fits\_write\_exthdr & \pageref{ffphps} \\ fits\_write\_grphdr & \pageref{ffphpr} \\ fits\_write\_grppar\_TYP & \pageref{ffpgpx} \\ fits\_write\_hdu & \pageref{ffwrhdu} \\ fits\_write\_history & \pageref{ffphis} \\ fits\_write\_img & \pageref{ffppr} \\ fits\_write\_img\_null & \pageref{ffppru} \\ fits\_write\_img\_TYP & \pageref{ffpprx} \\ fits\_write\_imghdr & \pageref{ffphps} \\ fits\_write\_imgnull & \pageref{ffppn} \\ fits\_write\_imgnull\_TYP & \pageref{ffppnx} \\ fits\_write\_key & \pageref{ffpky} \\ fits\_write\_key\_longstr & \pageref{ffpkls} \\ fits\_write\_key\_longwarn & \pageref{ffplsw} \\ fits\_write\_key\_null & \pageref{ffpkyu} \\ fits\_write\_key\_template & \pageref{ffpktp} \\ fits\_write\_key\_triple & \pageref{ffpkyt} \\ fits\_write\_key\_unit & \pageref{ffpunt} \\ fits\_write\_key\_TYP & \pageref{ffpkyx} \\ fits\_write\_keys\_TYP & \pageref{ffpknx} \\ fits\_write\_keys\_histo & \pageref{writekeyshisto} \\ fits\_write\_null\_img & \pageref{ffpprn} \\ fits\_write\_nullrows & \pageref{ffpclu} \\ fits\_write\_pix & \pageref{ffppx} \\ fits\_write\_pixnull & \pageref{ffppxn} \\ fits\_write\_record & \pageref{ffprec} \\ fits\_write\_subset & \pageref{ffpss} \\ fits\_write\_subset\_TYP & \pageref{ffpssx} \\ fits\_write\_tblbytes & \pageref{ffptbb} \\ fits\_write\_tdim & \pageref{ffptdm} \\ fits\_write\_theap & \pageref{ffpthp} \\ \end{tabular} \newpage \begin{tabular}{lr} ffasfm & \pageref{ffasfm} \\ ffbnfm & \pageref{ffbnfm} \\ ffcalc & \pageref{ffcalc} \\ ffcalc\_rng & \pageref{ffcalcrng} \\ ffccls & \pageref{ffccls} \\ ffchtps & \pageref{ffchtps} \\ ffclos & \pageref{ffclos} \\ ffcmph & \pageref{ffcmph} \\ ffcmps & \pageref{ffcmps} \\ ffcmrk & \pageref{ffpmrk} \\ ffcmsg & \pageref{ffcmsg} \\ ffcopy & \pageref{ffcopy} \\ ffcpcl & \pageref{ffcpcl} \\ ffcpdt & \pageref{ffcpdt} \\ ffcpfl & \pageref{ffcpfl} \\ ffcphd & \pageref{ffcphd} \\ ffcpimg & \pageref{ffcpimg} \\ ffcpky & \pageref{ffcpky} \\ ffcprw & \pageref{ffcprw} \\ ffcrhd & \pageref{ffcrhd} \\ ffcrim & \pageref{ffcrim} \\ ffcrow & \pageref{ffcrow} \\ ffcrtb & \pageref{ffcrtb} \\ ffdcol & \pageref{ffdcol} \\ ffdelt & \pageref{ffdelt} \\ ffdhdu & \pageref{ffdhdu} \\ ffdkey & \pageref{ffdkey} \\ ffdkinit & \pageref{ffinit} \\ ffdkopen & \pageref{ffopen} \\ ffdopn & \pageref{ffopen} \\ ffdrec & \pageref{ffdrec} \\ ffdrow & \pageref{ffdrow} \\ ffdrrg & \pageref{ffdrrg} \\ ffdrws & \pageref{ffdrws} \\ ffdstr & \pageref{ffdkey} \\ ffdsum & \pageref{ffdsum} \\ ffdt2s & \pageref{ffdt2s} \\ ffdtdm & \pageref{ffdtdm} \\ ffdtyp & \pageref{ffdtyp} \\ ffeopn & \pageref{ffopen} \\ ffeqty & \pageref{ffgtcl} \\ ffesum & \pageref{ffesum} \\ ffexest & \pageref{ffexist} \\ ffextn & \pageref{ffextn} \\ ffffrw & \pageref{ffffrw} \\ ffflmd & \pageref{ffflmd} \\ ffflnm & \pageref{ffflnm} \\ ffflsh & \pageref{ffflus} \\ \end{tabular} \begin{tabular}{lr} ffflus & \pageref{ffflus} \\ fffree & \pageref{ffgkls}, \pageref{ffhdr2str} \\ fffrow & \pageref{fffrow} \\ ffg2d\_ & \pageref{ffg2dx} \\ ffg3d\_ & \pageref{ffg3dx} \\ ffgabc & \pageref{ffgabc} \\ ffgacl & \pageref{ffgacl} \\ ffgbcl & \pageref{ffgbcl} \\ ffgcdw & \pageref{ffgcdw} \\ ffgcf & \pageref{ffgcf} \\ ffgcf\_ & \pageref{ffgcfx} \\ ffgcks & \pageref{ffgcks} \\ ffgcnn & \pageref{ffgcnn} \\ ffgcno & \pageref{ffgcno} \\ ffgcrd & \pageref{ffgcrd} \\ ffgcv & \pageref{ffgcv} \\ ffgcv\_ & \pageref{ffgcvx} \\ ffgcx & \pageref{ffgcx} \\ ffgdes & \pageref{ffgdes} \\ ffgdess & \pageref{ffgdes} \\ ffgerr & \pageref{ffgerr} \\ ffgextn & \pageref{ffgextn} \\ ffggp\_ & \pageref{ffggpx} \\ ffghad & \pageref{ffghad} \\ ffghbn & \pageref{ffghbn} \\ ffghdn & \pageref{ffghdn} \\ ffghdt & \pageref{ffghdt} \\ ffghpr & \pageref{ffghpr} \\ ffghps & \pageref{ffghps} \\ ffghsp & \pageref{ffghsp} \\ ffghtb & \pageref{ffghtb} \\ ffgics & \pageref{ffgics} \\ ffgidm & \pageref{ffgidm} \\ ffgidt & \pageref{ffgidt} \\ ffgiet & \pageref{ffgidt} \\ ffgipr & \pageref{ffgipr} \\ ffgisz & \pageref{ffgisz} \\ ffgkcl & \pageref{ffgkcl} \\ ffgkey & \pageref{ffgkey} \\ ffgkls & \pageref{ffgkls} \\ ffgksl & \pageref{ffgksl} \\ ffgkn\_ & \pageref{ffgknx} \\ ffgknm & \pageref{ffgknm} \\ ffgky & \pageref{ffgky} \\ ffgkyn & \pageref{ffgkyn} \\ ffgkyt & \pageref{ffgkyt} \\ ffgky\_ & \pageref{ffgkyx} \\ ffgmcp & \pageref{ffgmcp} \\ \end{tabular} \begin{tabular}{lr} ffgmng & \pageref{ffgmng} \\ ffgmop & \pageref{ffgmop} \\ ffgmrm & \pageref{ffgmrm} \\ ffgmsg & \pageref{ffgmsg} \\ ffgmtf & \pageref{ffgmtf} \\ ffgncl & \pageref{ffgnrw} \\ ffgnrw & \pageref{ffgnrw} \\ ffgnxk & \pageref{ffgnxk} \\ ffgpf & \pageref{ffgpf} \\ ffgpf\_ & \pageref{ffgpfx} \\ ffgpv & \pageref{ffgpv} \\ ffgpv\_ & \pageref{ffgpvx} \\ ffgpxv & \pageref{ffgpxv} \\ ffgpxf & \pageref{ffgpxf} \\ ffgrec & \pageref{ffgrec} \\ ffgrsz & \pageref{ffgrsz} \\ ffgsdt & \pageref{ffdt2s} \\ ffgsf\_ & \pageref{ffgsfx} \pageref{ffgsfx2} \\ ffgsky & \pageref{ffgsky} \\ ffgstm & \pageref{ffdt2s} \\ ffgstr & \pageref{ffgcrd} \\ ffgsv & \pageref{ffgsv} \\ ffgsv\_ & \pageref{ffgsvx} \pageref{ffgsvx2}\\ ffgtam & \pageref{ffgtam} \\ ffgtbb & \pageref{ffgtbb} \\ ffgtch & \pageref{ffgtch} \\ ffgtcl & \pageref{ffgtcl} \\ ffgtcm & \pageref{ffgtcm} \\ ffgtcp & \pageref{ffgtcp} \\ ffgtcr & \pageref{ffgtcr} \\ ffgtcs & \pageref{ffgtcs} \\ ffgtdm & \pageref{ffgtdm} \\ ffgthd & \pageref{ffgthd} \\ ffgtis & \pageref{ffgtis} \\ ffgtmg & \pageref{ffgtmg} \\ ffgtmo & \pageref{ffgtmo} \\ ffgtnm & \pageref{ffgtnm} \\ ffgtop & \pageref{ffgtop} \\ ffgtrm & \pageref{ffgtrm} \\ ffgtvf & \pageref{ffgtvf} \\ ffgunt & \pageref{ffgunt} \\ ffhdef & \pageref{ffhdef} \\ ffibin & \pageref{ffibin} \\ fficls & \pageref{fficls} \\ fficol & \pageref{fficol} \\ ffifile & \pageref{ffiurl} \\ ffihtps & \pageref{ffihtps} \\ ffiimg & \pageref{ffiimg} \\ \end{tabular} \begin{tabular}{lr} ffikls & \pageref{ffikyx} \\ ffikyu & \pageref{ffikyu} \\ ffiky\_ & \pageref{ffikyx} \\ ffimem & \pageref{ffimem} \\ ffinit & \pageref{ffinit} \\ ffinttyp & \pageref{ffinttyp} \\ ffiopn & \pageref{ffopen} \\ ffirec & \pageref{ffirec} \\ ffirow & \pageref{ffirow} \\ ffitab & \pageref{ffitab} \\ ffiter & \pageref{ffiter} \\ ffiurl & \pageref{ffiurl} \\ ffkeyn & \pageref{ffkeyn} \\ ffmahd & \pageref{ffmahd} \\ ffmcom & \pageref{ffmcom} \\ ffmcrd & \pageref{ffmcrd} \\ ffmkky & \pageref{ffmkky} \\ ffmkls & \pageref{ffmkyx} \\ ffmkyu & \pageref{ffmkyu} \\ ffmky\_ & \pageref{ffmkyx} \\ ffmnam & \pageref{ffmnam} \\ ffmnhd & \pageref{ffmnhd} \\ ffmrec & \pageref{ffmrec} \\ ffmrhd & \pageref{ffmrhd} \\ ffmvec & \pageref{ffmvec} \\ ffnchk & \pageref{ffnchk} \\ ffnkey & \pageref{ffnkey} \\ ffomem & \pageref{ffomem} \\ ffopen & \pageref{ffopen} \\ ffp2d\_ & \pageref{ffp2dx} \\ ffp3d\_ & \pageref{ffp3dx} \\ ffpcks & \pageref{ffpcks} \\ ffpcl & \pageref{ffpcl} \\ ffpcls & \pageref{ffpcls} \\ ffpcl\_ & \pageref{ffpclx} \\ ffpclu & \pageref{ffpclu} \\ ffpcn & \pageref{ffpcn} \\ ffpcn\_ & \pageref{ffpcnx} \\ ffpcom & \pageref{ffpcom} \\ ffpdat & \pageref{ffpdat} \\ ffpdes & \pageref{ffpdes} \\ ffpextn & \pageref{ffgextn} \\ ffpgp\_ & \pageref{ffpgpx} \\ ffphbn & \pageref{ffphbn} \\ ffphext & \pageref{ffphpr} \\ ffphis & \pageref{ffphis} \\ ffphpr & \pageref{ffphpr} \\ ffphps & \pageref{ffphps} \\ \end{tabular} \begin{tabular}{lr} ffphtb & \pageref{ffphtb} \\ ffpkls & \pageref{ffpkls} \\ ffpkn\_ & \pageref{ffpknx} \\ ffpktp & \pageref{ffpktp} \\ ffpky & \pageref{ffpky} \\ ffpkyt & \pageref{ffpkyt} \\ ffpkyu & \pageref{ffpkyu} \\ ffpky\_ & \pageref{ffpkyx} \\ ffplsw & \pageref{ffplsw} \\ ffpmrk & \pageref{ffpmrk} \\ ffpmsg & \pageref{ffpmsg} \\ ffpnul & \pageref{ffpnul} \\ ffppn & \pageref{ffppn} \\ ffppn\_ & \pageref{ffppnx} \\ ffppr & \pageref{ffppr} \\ ffpprn & \pageref{ffpprn} \\ ffppru & \pageref{ffppru} \\ ffppr\_ & \pageref{ffpprx} \\ ffppx & \pageref{ffppx} \\ ffppxn & \pageref{ffppxn} \\ ffprec & \pageref{ffprec} \\ ffprwu & \pageref{ffpclu} \\ ffpscl & \pageref{ffpscl} \\ ffpss & \pageref{ffpss} \\ ffpss\_ & \pageref{ffpssx} \\ ffpsvc & \pageref{ffpsvc} \\ ffptbb & \pageref{ffptbb} \\ ffptdm & \pageref{ffptdm} \\ ffpthp & \pageref{ffpthp} \\ ffpunt & \pageref{ffpunt} \\ ffrdef & \pageref{ffrdef} \\ ffreopen & \pageref{ffreopen} \\ ffrprt & \pageref{ffrprt} \\ ffrsim & \pageref{ffrsim} \\ ffrtnm & \pageref{ffrtnm} \\ ffrwrg & \pageref{ffrwrg} \\ ffs2dt & \pageref{ffdt2s} \\ ffs2tm & \pageref{ffdt2s} \\ ffshdwn & \pageref{ffshdwn} \\ ffsnul & \pageref{ffsnul} \\ ffsrow & \pageref{ffsrow} \\ ffstmo & \pageref{ffgtmo} \\ fftexp & \pageref{fftexp} \\ ffthdu & \pageref{ffthdu} \\ fftheap & \pageref{fftheap} \\ fftkey & \pageref{fftkey} \\ fftm2s & \pageref{ffdt2s} \\ fftnul & \pageref{fftnul} \\ \end{tabular} \newpage \begin{tabular}{lr} fftopn & \pageref{ffopen} \\ fftplt & \pageref{fftplt} \\ fftrec & \pageref{fftrec} \\ fftscl & \pageref{fftscl} \\ ffucrd & \pageref{ffucrd} \\ ffukls & \pageref{ffukyx} \\ ffuky & \pageref{ffuky} \\ ffukyu & \pageref{ffukyu} \\ ffuky\_ & \pageref{ffukyx} \\ ffupch & \pageref{ffupch} \\ ffupck & \pageref{ffupck} \\ ffurlt & \pageref{ffurlt} \\ ffvcks & \pageref{ffvcks} \\ ffvers & \pageref{ffvers} \\ ffvhtps & \pageref{ffvhtps} \\ ffwldp & \pageref{ffwldp} \\ ffwrhdu & \pageref{ffwrhdu} \\ ffxypx & \pageref{ffxypx} \\ \end{tabular} \chapter{Parameter Definitions } \begin{verbatim} anynul - set to TRUE (=1) if any returned values are undefined, else FALSE array - array of numerical data values to read or write ascii - encoded checksum string binspec - the input table binning specifier bitpix - bits per pixel. The following symbolic mnemonics are predefined: BYTE_IMG = 8 (unsigned char) SHORT_IMG = 16 (signed short integer) LONG_IMG = 32 (signed long integer) LONGLONG_IMG = 64 (signed long 64-bit integer) FLOAT_IMG = -32 (float) DOUBLE_IMG = -64 (double). Two additional values, USHORT_IMG and ULONG_IMG are also available for creating unsigned integer images. These are equivalent to creating a signed integer image with BZERO offset keyword values of 32768 or 2147483648, respectively, which is the convention that FITS uses to store unsigned integers. card - header record to be read or written (80 char max, null-terminated) casesen - CASESEN (=1) for case-sensitive string matching, else CASEINSEN (=0) cmopt - grouping table "compact" option parameter. Allowed values are: OPT_CMT_MBR and OPT_CMT_MBR_DEL. colname - name of the column (null-terminated) colnum - column number (first column = 1) colspec - the input file column specification; used to delete, create, or rename table columns comment - the keyword comment field (72 char max, null-terminated) complm - should the checksum be complemented? comptype - compression algorithm to use: GZIP_1, RICE_1, HCOMPRESS_1, or PLIO_1 coordtype- type of coordinate projection (-SIN, -TAN, -ARC, -NCP, -GLS, -MER, or -AIT) cpopt - grouping table copy option parameter. Allowed values are: OPT_GCP_GPT, OPT_GCP_MBR, OPT_GCP_ALL, OPT_MCP_ADD, OPT_MCP_NADD, OPT_MCP_REPL, amd OPT_MCP_MOV. create_col- If TRUE, then insert a new column in the table, otherwise overwrite the existing column. current - if TRUE, then the current HDU will be copied dataok - was the data unit verification successful (=1) or not (= -1). Equals zero if the DATASUM keyword is not present. datasum - 32-bit 1's complement checksum for the data unit dataend - address (in bytes) of the end of the HDU datastart- address (in bytes) of the start of the data unit datatype - specifies the data type of the value. Allowed value are: TSTRING, TLOGICAL, TBYTE, TSBYTE, TSHORT, TUSHORT, TINT, TUINT, TLONG, TULONG, TFLOAT, TDOUBLE, TCOMPLEX, and TDBLCOMPLEX datestr - FITS date/time string: 'YYYY-MM-DDThh:mm:ss.ddd', 'YYYY-MM-dd', or 'dd/mm/yy' day - calendar day (UTC) (1-31) decimals - number of decimal places to be displayed deltasize - increment for allocating more memory dim1 - declared size of the first dimension of the image or cube array dim2 - declared size of the second dimension of the data cube array dispwidth - display width of a column = length of string that will be read dtype - data type of the keyword ('C', 'L', 'I', 'F' or 'X') C = character string L = logical I = integer F = floating point number X = complex, e.g., "(1.23, -4.56)" err_msg - error message on the internal stack (80 chars max) err_text - error message string corresponding to error number (30 chars max) exact - TRUE (=1) if the strings match exactly; FALSE (=0) if wildcards are used exclist - array of pointers to keyword names to be excluded from search exists - flag indicating whether the file or compressed file exists on disk expr - boolean or arithmetic expression extend - TRUE (=1) if FITS file may have extensions, else FALSE (=0) extname - value of the EXTNAME keyword (null-terminated) extspec - the extension or HDU specifier; a number or name, version, and type extver - value of the EXTVER keyword = integer version number filename - full name of the FITS file, including optional HDU and filtering specs filetype - type of file (file://, ftp://, http://, etc.) filter - the input file filtering specifier firstchar- starting byte in the row (first byte of row = 1) firstfailed - member HDU ID (if positive) or grouping table GRPIDn index value (if negative) that failed grouping table verification. firstelem- first element in a vector (ignored for ASCII tables) firstrow - starting row number (first row of table = 1) following- if TRUE, any HDUs following the current HDU will be copied fpixel - coordinate of the first pixel to be read or written in the FITS array. The array must be of length NAXIS and have values such that fpixel[0] is in the range 1 to NAXIS1, fpixel[1] is in the range 1 to NAXIS2, etc. fptr - pointer to a 'fitsfile' structure describing the FITS file. frac - factional part of the keyword value gcount - number of groups in the primary array (usually = 1) gfptr - fitsfile* pointer to a grouping table HDU. group - GRPIDn/GRPLCn index value identifying a grouping table HDU, or data group number (=0 for non-grouped data) grouptype - Grouping table parameter that specifies the columns to be created in a grouping table HDU. Allowed values are: GT_ID_ALL_URI, GT_ID_REF, GT_ID_POS, GT_ID_ALL, GT_ID_REF_URI, and GT_ID_POS_URI. grpname - value to use for the GRPNAME keyword value. hdunum - sequence number of the HDU (Primary array = 1) hduok - was the HDU verification successful (=1) or not (= -1). Equals zero if the CHECKSUM keyword is not present. hdusum - 32 bit 1's complement checksum for the entire CHDU hdutype - HDU type: IMAGE_HDU (0), ASCII_TBL (1), BINARY_TBL (2), ANY_HDU (-1) header - returned character string containing all the keyword records headstart- starting address (in bytes) of the CHDU heapsize - size of the binary table heap, in bytes history - the HISTORY keyword comment string (70 char max, null-terminated) hour - hour within day (UTC) (0 - 23) inc - sampling interval for pixels in each FITS dimension inclist - array of pointers to matching keyword names incolnum - input column number; range = 1 to TFIELDS infile - the input filename, including path if specified infptr - pointer to a 'fitsfile' structure describing the input FITS file. intval - integer part of the keyword value iomode - file access mode: either READONLY (=0) or READWRITE (=1) keyname - name of a keyword (8 char max, null-terminated) keynum - position of keyword in header (1st keyword = 1) keyroot - root string for the keyword name (5 char max, null-terminated) keysexist- number of existing keyword records in the CHU keytype - header record type: -1=delete; 0=append or replace; 1=append; 2=this is the END keyword longstr - arbitrarily long string keyword value (null-terminated) lpixel - coordinate of the last pixel to be read or written in the FITS array. The array must be of length NAXIS and have values such that lpixel[0] is in the range 1 to NAXIS1, lpixel[1] is in the range 1 to NAXIS2, etc. match - TRUE (=1) if the 2 strings match, else FALSE (=0) maxdim - maximum number of values to return member - row number of a grouping table member HDU. memptr - pointer to the a FITS file in memory mem_realloc - pointer to a function for reallocating more memory memsize - size of the memory block allocated for the FITS file mfptr - fitsfile* pointer to a grouping table member HDU. mgopt - grouping table merge option parameter. Allowed values are: OPT_MRG_COPY, and OPT_MRG_MOV. minute - minute within hour (UTC) (0 - 59) month - calendar month (UTC) (1 - 12) morekeys - space in the header for this many more keywords n_good_rows - number of rows evaluating to TRUE namelist - string containing a comma or space delimited list of names naxes - size of each dimension in the FITS array naxis - number of dimensions in the FITS array naxis1 - length of the X/first axis of the FITS array naxis2 - length of the Y/second axis of the FITS array naxis3 - length of the Z/third axis of the FITS array nbytes - number of bytes or characters to read or write nchars - number of characters to read or write nelements- number of data elements to read or write newfptr - returned pointer to the reopened file newveclen- new value for the column vector repeat parameter nexc - number of names in the exclusion list (may = 0) nfound - number of keywords found (highest keyword number) nkeys - number of keywords in the sequence ninc - number of names in the inclusion list nmembers - Number of grouping table members (NAXIS2 value). nmove - number of HDUs to move (+ or -), relative to current position nocomments - if equal to TRUE, then no commentary keywords will be copied noisebits- number of bits to ignore when compressing floating point images nrows - number of rows in the table nstart - first integer value nullarray- set to TRUE (=1) if corresponding data element is undefined nulval - numerical value to represent undefined pixels nulstr - character string used to represent undefined values in ASCII table numval - numerical data value, of the appropriate data type offset - byte offset in the heap or data unit to the first element of the vector openfptr - pointer to a currently open FITS file overlap - number of bytes in the binary table heap pointed to by more than 1 descriptor outcolnum- output column number; range = 1 to TFIELDS + 1 outfile - and optional output filename; the input file will be copied to this prior to opening the file outfptr - pointer to a 'fitsfile' structure describing the output FITS file. pcount - value of the PCOUNT keyword = size of binary table heap previous - if TRUE, any previous HDUs in the input file will be copied. repeat - length of column vector (e.g. 12J); == 1 for ASCII table rmopt - grouping table remove option parameter. Allowed values are: OPT_RM_GPT, OPT_RM_ENTRY, OPT_RM_MBR, and OPT_RM_ALL. rootname - root filename, minus any extension or filtering specifications rot - celestial coordinate rotation angle (degrees) rowlen - length of a table row, in characters or bytes rowlist - sorted list of row numbers to be deleted from the table rownum - number of the row (first row = 1) rowrange - list of rows or row ranges: '3,6-8,12,56-80' or '500-' row_status - array of True/False results for each row that was evaluated scale - linear scaling factor; true value = (FITS value) * scale + zero second - second within minute (0 - 60.9999999999) (leap second!) section - section of image to be copied (e.g. 21:80,101:200) simple - TRUE (=1) if FITS file conforms to the Standard, else FALSE (=0) space - number of blank spaces to leave between ASCII table columns status - returned error status code (0 = OK) sum - 32 bit unsigned checksum value tbcol - byte position in row to start of column (1st col has tbcol = 1) tdisp - Fortran style display format for the table column tdimstr - the value of the TDIMn keyword templt - template string used in comparison (null-terminated) tfields - number of fields (columns) in the table tfopt - grouping table member transfer option parameter. Allowed values are: OPT_MCP_ADD, and OPT_MCP_MOV. tform - format of the column (null-terminated); allowed values are: ASCII tables: Iw, Aw, Fww.dd, Eww.dd, or Dww.dd Binary tables: rL, rX, rB, rI, rJ, rA, rAw, rE, rD, rC, rM where 'w'=width of the field, 'd'=no. of decimals, 'r'=repeat count. Variable length array columns are denoted by a '1P' before the data type character (e.g., '1PJ'). When creating a binary table, 2 addition tform data type codes are recognized by CFITSIO: 'rU' and 'rV' for unsigned 16-bit and unsigned 32-bit integer, respectively. theap - zero indexed byte offset of starting address of the heap relative to the beginning of the binary table data tilesize - array of length NAXIS that specifies the dimensions of the image compression tiles ttype - label or name for table column (null-terminated) tunit - physical unit for table column (null-terminated) typechar - symbolic code of the table column data type typecode - data type code of the table column. The negative of the value indicates a variable length array column. Datatype typecode Mnemonic bit, X 1 TBIT byte, B 11 TBYTE logical, L 14 TLOGICAL ASCII character, A 16 TSTRING short integer, I 21 TSHORT integer, J 41 TINT32BIT (same as TLONG) long long integer, K 81 TLONGLONG real, E 42 TFLOAT double precision, D 82 TDOUBLE complex, C 83 TCOMPLEX double complex, M 163 TDBLCOMPLEX unit - the physical unit string (e.g., 'km/s') for a keyword unused - number of unused bytes in the binary table heap urltype - the file type of the FITS file (file://, ftp://, mem://, etc.) validheap- returned value = FALSE if any of the variable length array address are outside the valid range of addresses in the heap value - the keyword value string (70 char max, null-terminated) version - current version number of the CFITSIO library width - width of the character string field xcol - number of the column containing the X coordinate values xinc - X axis coordinate increment at reference pixel (deg) xpix - X axis pixel location xpos - X axis celestial coordinate (usually RA) (deg) xrefpix - X axis reference pixel array location xrefval - X axis coordinate value at the reference pixel (deg) ycol - number of the column containing the X coordinate values year - calendar year (e.g. 1999, 2000, etc) yinc - Y axis coordinate increment at reference pixel (deg) ypix - y axis pixel location ypos - y axis celestial coordinate (usually DEC) (deg) yrefpix - Y axis reference pixel array location yrefval - Y axis coordinate value at the reference pixel (deg) zero - scaling offset; true value = (FITS value) * scale + zero \end{verbatim} \chapter{CFITSIO Error Status Codes } The following table lists all the error status codes used by CFITSIO. Programmers are encouraged to use the symbolic mnemonics (defined in the file fitsio.h) rather than the actual integer status values to improve the readability of their code. \begin{verbatim} Symbolic Const Value Meaning -------------- ----- ----------------------------------------- 0 OK, no error SAME_FILE 101 input and output files are the same TOO_MANY_FILES 103 tried to open too many FITS files at once FILE_NOT_OPENED 104 could not open the named file FILE_NOT_CREATED 105 could not create the named file WRITE_ERROR 106 error writing to FITS file END_OF_FILE 107 tried to move past end of file READ_ERROR 108 error reading from FITS file FILE_NOT_CLOSED 110 could not close the file ARRAY_TOO_BIG 111 array dimensions exceed internal limit READONLY_FILE 112 Cannot write to readonly file MEMORY_ALLOCATION 113 Could not allocate memory BAD_FILEPTR 114 invalid fitsfile pointer NULL_INPUT_PTR 115 NULL input pointer to routine SEEK_ERROR 116 error seeking position in file BAD_NETTIMEOUT 117 bad value for file download timeout setting BAD_URL_PREFIX 121 invalid URL prefix on file name TOO_MANY_DRIVERS 122 tried to register too many IO drivers DRIVER_INIT_FAILED 123 driver initialization failed NO_MATCHING_DRIVER 124 matching driver is not registered URL_PARSE_ERROR 125 failed to parse input file URL RANGE_PARSE_ERROR 126 parse error in range list SHARED_BADARG 151 bad argument in shared memory driver SHARED_NULPTR 152 null pointer passed as an argument SHARED_TABFULL 153 no more free shared memory handles SHARED_NOTINIT 154 shared memory driver is not initialized SHARED_IPCERR 155 IPC error returned by a system call SHARED_NOMEM 156 no memory in shared memory driver SHARED_AGAIN 157 resource deadlock would occur SHARED_NOFILE 158 attempt to open/create lock file failed SHARED_NORESIZE 159 shared memory block cannot be resized at the moment HEADER_NOT_EMPTY 201 header already contains keywords KEY_NO_EXIST 202 keyword not found in header KEY_OUT_BOUNDS 203 keyword record number is out of bounds VALUE_UNDEFINED 204 keyword value field is blank NO_QUOTE 205 string is missing the closing quote BAD_INDEX_KEY 206 illegal indexed keyword name (e.g. 'TFORM1000') BAD_KEYCHAR 207 illegal character in keyword name or card BAD_ORDER 208 required keywords out of order NOT_POS_INT 209 keyword value is not a positive integer NO_END 210 couldn't find END keyword BAD_BITPIX 211 illegal BITPIX keyword value BAD_NAXIS 212 illegal NAXIS keyword value BAD_NAXES 213 illegal NAXISn keyword value BAD_PCOUNT 214 illegal PCOUNT keyword value BAD_GCOUNT 215 illegal GCOUNT keyword value BAD_TFIELDS 216 illegal TFIELDS keyword value NEG_WIDTH 217 negative table row size NEG_ROWS 218 negative number of rows in table COL_NOT_FOUND 219 column with this name not found in table BAD_SIMPLE 220 illegal value of SIMPLE keyword NO_SIMPLE 221 Primary array doesn't start with SIMPLE NO_BITPIX 222 Second keyword not BITPIX NO_NAXIS 223 Third keyword not NAXIS NO_NAXES 224 Couldn't find all the NAXISn keywords NO_XTENSION 225 HDU doesn't start with XTENSION keyword NOT_ATABLE 226 the CHDU is not an ASCII table extension NOT_BTABLE 227 the CHDU is not a binary table extension NO_PCOUNT 228 couldn't find PCOUNT keyword NO_GCOUNT 229 couldn't find GCOUNT keyword NO_TFIELDS 230 couldn't find TFIELDS keyword NO_TBCOL 231 couldn't find TBCOLn keyword NO_TFORM 232 couldn't find TFORMn keyword NOT_IMAGE 233 the CHDU is not an IMAGE extension BAD_TBCOL 234 TBCOLn keyword value < 0 or > rowlength NOT_TABLE 235 the CHDU is not a table COL_TOO_WIDE 236 column is too wide to fit in table COL_NOT_UNIQUE 237 more than 1 column name matches template BAD_ROW_WIDTH 241 sum of column widths not = NAXIS1 UNKNOWN_EXT 251 unrecognizable FITS extension type UNKNOWN_REC 252 unknown record; 1st keyword not SIMPLE or XTENSION END_JUNK 253 END keyword is not blank BAD_HEADER_FILL 254 Header fill area contains non-blank chars BAD_DATA_FILL 255 Illegal data fill bytes (not zero or blank) BAD_TFORM 261 illegal TFORM format code BAD_TFORM_DTYPE 262 unrecognizable TFORM data type code BAD_TDIM 263 illegal TDIMn keyword value BAD_HEAP_PTR 264 invalid BINTABLE heap pointer is out of range BAD_HDU_NUM 301 HDU number < 1 BAD_COL_NUM 302 column number < 1 or > tfields NEG_FILE_POS 304 tried to move to negative byte location in file NEG_BYTES 306 tried to read or write negative number of bytes BAD_ROW_NUM 307 illegal starting row number in table BAD_ELEM_NUM 308 illegal starting element number in vector NOT_ASCII_COL 309 this is not an ASCII string column NOT_LOGICAL_COL 310 this is not a logical data type column BAD_ATABLE_FORMAT 311 ASCII table column has wrong format BAD_BTABLE_FORMAT 312 Binary table column has wrong format NO_NULL 314 null value has not been defined NOT_VARI_LEN 317 this is not a variable length column BAD_DIMEN 320 illegal number of dimensions in array BAD_PIX_NUM 321 first pixel number greater than last pixel ZERO_SCALE 322 illegal BSCALE or TSCALn keyword = 0 NEG_AXIS 323 illegal axis length < 1 NOT_GROUP_TABLE 340 Grouping function error HDU_ALREADY_MEMBER 341 MEMBER_NOT_FOUND 342 GROUP_NOT_FOUND 343 BAD_GROUP_ID 344 TOO_MANY_HDUS_TRACKED 345 HDU_ALREADY_TRACKED 346 BAD_OPTION 347 IDENTICAL_POINTERS 348 BAD_GROUP_ATTACH 349 BAD_GROUP_DETACH 350 NGP_NO_MEMORY 360 malloc failed NGP_READ_ERR 361 read error from file NGP_NUL_PTR 362 null pointer passed as an argument. Passing null pointer as a name of template file raises this error NGP_EMPTY_CURLINE 363 line read seems to be empty (used internally) NGP_UNREAD_QUEUE_FULL 364 cannot unread more then 1 line (or single line twice) NGP_INC_NESTING 365 too deep include file nesting (infinite loop, template includes itself ?) NGP_ERR_FOPEN 366 fopen() failed, cannot open template file NGP_EOF 367 end of file encountered and not expected NGP_BAD_ARG 368 bad arguments passed. Usually means internal parser error. Should not happen NGP_TOKEN_NOT_EXPECT 369 token not expected here BAD_I2C 401 bad int to formatted string conversion BAD_F2C 402 bad float to formatted string conversion BAD_INTKEY 403 can't interpret keyword value as integer BAD_LOGICALKEY 404 can't interpret keyword value as logical BAD_FLOATKEY 405 can't interpret keyword value as float BAD_DOUBLEKEY 406 can't interpret keyword value as double BAD_C2I 407 bad formatted string to int conversion BAD_C2F 408 bad formatted string to float conversion BAD_C2D 409 bad formatted string to double conversion BAD_DATATYPE 410 illegal datatype code value BAD_DECIM 411 bad number of decimal places specified NUM_OVERFLOW 412 overflow during data type conversion DATA_COMPRESSION_ERR 413 error compressing image DATA_DECOMPRESSION_ERR 414 error uncompressing image BAD_DATE 420 error in date or time conversion PARSE_SYNTAX_ERR 431 syntax error in parser expression PARSE_BAD_TYPE 432 expression did not evaluate to desired type PARSE_LRG_VECTOR 433 vector result too large to return in array PARSE_NO_OUTPUT 434 data parser failed not sent an out column PARSE_BAD_COL 435 bad data encounter while parsing column PARSE_BAD_OUTPUT 436 Output file not of proper type ANGLE_TOO_BIG 501 celestial angle too large for projection BAD_WCS_VAL 502 bad celestial coordinate or pixel value WCS_ERROR 503 error in celestial coordinate calculation BAD_WCS_PROJ 504 unsupported type of celestial projection NO_WCS_KEY 505 celestial coordinate keywords not found APPROX_WCS_KEY 506 approximate wcs keyword values were returned \end{verbatim} \end{document} cfitsio-3.47/docs/cfitsio.toc0000644000225700000360000002640113464573431015511 0ustar cagordonlhea\contentsline {chapter}{\numberline {1}Introduction }{1}{chapter.1} \contentsline {section}{\numberline {1.1} A Brief Overview}{1}{section.1.1} \contentsline {section}{\numberline {1.2}Sources of FITS Software and Information}{1}{section.1.2} \contentsline {section}{\numberline {1.3}Acknowledgments}{2}{section.1.3} \contentsline {section}{\numberline {1.4}Legal Stuff}{4}{section.1.4} \contentsline {chapter}{\numberline {2} Creating the CFITSIO Library }{5}{chapter.2} \contentsline {section}{\numberline {2.1}Building the Library}{5}{section.2.1} \contentsline {subsection}{\numberline {2.1.1}Unix Systems}{5}{subsection.2.1.1} \contentsline {subsection}{\numberline {2.1.2}VMS}{7}{subsection.2.1.2} \contentsline {subsection}{\numberline {2.1.3}Windows PCs}{7}{subsection.2.1.3} \contentsline {subsection}{\numberline {2.1.4}Macintosh PCs}{7}{subsection.2.1.4} \contentsline {section}{\numberline {2.2}Testing the Library}{7}{section.2.2} \contentsline {section}{\numberline {2.3}Linking Programs with CFITSIO}{9}{section.2.3} \contentsline {section}{\numberline {2.4}Using CFITSIO in Multi-threaded Environments}{9}{section.2.4} \contentsline {section}{\numberline {2.5}Getting Started with CFITSIO}{9}{section.2.5} \contentsline {section}{\numberline {2.6}Example Program}{10}{section.2.6} \contentsline {chapter}{\numberline {3} A FITS Primer }{13}{chapter.3} \contentsline {chapter}{\numberline {4} Programming Guidelines }{15}{chapter.4} \contentsline {section}{\numberline {4.1}CFITSIO Definitions}{15}{section.4.1} \contentsline {section}{\numberline {4.2}Current Header Data Unit (CHDU)}{18}{section.4.2} \contentsline {section}{\numberline {4.3}Function Names and Variable Datatypes}{18}{section.4.3} \contentsline {section}{\numberline {4.4}Support for Unsigned Integers and Signed Bytes}{20}{section.4.4} \contentsline {section}{\numberline {4.5}Dealing with Character Strings}{22}{section.4.5} \contentsline {section}{\numberline {4.6}Implicit Data Type Conversion}{23}{section.4.6} \contentsline {section}{\numberline {4.7}Data Scaling}{23}{section.4.7} \contentsline {section}{\numberline {4.8}Support for IEEE Special Values}{24}{section.4.8} \contentsline {section}{\numberline {4.9}Error Status Values and the Error Message Stack}{24}{section.4.9} \contentsline {section}{\numberline {4.10}Variable-Length Arrays in Binary Tables}{25}{section.4.10} \contentsline {section}{\numberline {4.11}Multiple Access to the Same FITS File}{27}{section.4.11} \contentsline {section}{\numberline {4.12}When the Final Size of the FITS HDU is Unknown}{27}{section.4.12} \contentsline {section}{\numberline {4.13}CFITSIO Size Limitations}{28}{section.4.13} \contentsline {chapter}{\numberline {5}Basic CFITSIO Interface Routines }{31}{chapter.5} \contentsline {section}{\numberline {5.1}CFITSIO Error Status Routines}{31}{section.5.1} \contentsline {section}{\numberline {5.2}FITS File Access Routines}{32}{section.5.2} \contentsline {section}{\numberline {5.3}HDU Access Routines}{35}{section.5.3} \contentsline {section}{\numberline {5.4}Header Keyword Read/Write Routines}{37}{section.5.4} \contentsline {subsection}{\numberline {5.4.1}Keyword Reading Routines}{38}{subsection.5.4.1} \contentsline {subsection}{\numberline {5.4.2}Keyword Writing Routines}{40}{subsection.5.4.2} \contentsline {section}{\numberline {5.5}Primary Array or IMAGE Extension I/O Routines}{43}{section.5.5} \contentsline {section}{\numberline {5.6}Image Compression}{47}{section.5.6} \contentsline {section}{\numberline {5.7}ASCII and Binary Table Routines}{52}{section.5.7} \contentsline {subsection}{\numberline {5.7.1}Create New Table}{52}{subsection.5.7.1} \contentsline {subsection}{\numberline {5.7.2}Column Information Routines}{53}{subsection.5.7.2} \contentsline {subsection}{\numberline {5.7.3}Routines to Edit Rows or Columns}{55}{subsection.5.7.3} \contentsline {subsection}{\numberline {5.7.4}Read and Write Column Data Routines}{57}{subsection.5.7.4} \contentsline {subsection}{\numberline {5.7.5}Row Selection and Calculator Routines}{59}{subsection.5.7.5} \contentsline {subsection}{\numberline {5.7.6}Column Binning or Histogramming Routines}{61}{subsection.5.7.6} \contentsline {section}{\numberline {5.8}Utility Routines}{64}{section.5.8} \contentsline {subsection}{\numberline {5.8.1}File Checksum Routines}{64}{subsection.5.8.1} \contentsline {subsection}{\numberline {5.8.2}Date and Time Utility Routines}{65}{subsection.5.8.2} \contentsline {subsection}{\numberline {5.8.3}General Utility Routines}{66}{subsection.5.8.3} \contentsline {chapter}{\numberline {6} The CFITSIO Iterator Function }{77}{chapter.6} \contentsline {section}{\numberline {6.1}The Iterator Work Function}{78}{section.6.1} \contentsline {section}{\numberline {6.2}The Iterator Driver Function}{80}{section.6.2} \contentsline {section}{\numberline {6.3}Guidelines for Using the Iterator Function}{81}{section.6.3} \contentsline {section}{\numberline {6.4}Complete List of Iterator Routines}{82}{section.6.4} \contentsline {chapter}{\numberline {7} World Coordinate System Routines }{85}{chapter.7} \contentsline {section}{\numberline {7.1} Self-contained WCS Routines}{86}{section.7.1} \contentsline {chapter}{\numberline {8} Hierarchical Grouping Routines }{89}{chapter.8} \contentsline {section}{\numberline {8.1}Grouping Table Routines}{90}{section.8.1} \contentsline {section}{\numberline {8.2}Group Member Routines}{92}{section.8.2} \contentsline {chapter}{\numberline {9} Specialized CFITSIO Interface Routines }{95}{chapter.9} \contentsline {section}{\numberline {9.1}FITS File Access Routines}{95}{section.9.1} \contentsline {subsection}{\numberline {9.1.1}File Access}{95}{subsection.9.1.1} \contentsline {subsection}{\numberline {9.1.2}Download Utility Functions}{99}{subsection.9.1.2} \contentsline {section}{\numberline {9.2}HDU Access Routines}{100}{section.9.2} \contentsline {section}{\numberline {9.3}Specialized Header Keyword Routines}{102}{section.9.3} \contentsline {subsection}{\numberline {9.3.1}Header Information Routines}{102}{subsection.9.3.1} \contentsline {subsection}{\numberline {9.3.2}Read and Write the Required Keywords}{102}{subsection.9.3.2} \contentsline {subsection}{\numberline {9.3.3}Write Keyword Routines}{104}{subsection.9.3.3} \contentsline {subsection}{\numberline {9.3.4}Insert Keyword Routines}{106}{subsection.9.3.4} \contentsline {subsection}{\numberline {9.3.5}Read Keyword Routines}{107}{subsection.9.3.5} \contentsline {subsection}{\numberline {9.3.6}Modify Keyword Routines}{109}{subsection.9.3.6} \contentsline {subsection}{\numberline {9.3.7}Update Keyword Routines}{110}{subsection.9.3.7} \contentsline {section}{\numberline {9.4}Define Data Scaling and Undefined Pixel Parameters}{111}{section.9.4} \contentsline {section}{\numberline {9.5}Specialized FITS Primary Array or IMAGE Extension I/O Routines}{112}{section.9.5} \contentsline {section}{\numberline {9.6}Specialized FITS ASCII and Binary Table Routines}{115}{section.9.6} \contentsline {subsection}{\numberline {9.6.1}General Column Routines}{115}{subsection.9.6.1} \contentsline {subsection}{\numberline {9.6.2}Low-Level Table Access Routines}{117}{subsection.9.6.2} \contentsline {subsection}{\numberline {9.6.3}Write Column Data Routines}{117}{subsection.9.6.3} \contentsline {subsection}{\numberline {9.6.4}Read Column Data Routines}{118}{subsection.9.6.4} \contentsline {chapter}{\numberline {10} Extended File Name Syntax }{123}{chapter.10} \contentsline {section}{\numberline {10.1}Overview}{123}{section.10.1} \contentsline {section}{\numberline {10.2}Filetype}{126}{section.10.2} \contentsline {subsection}{\numberline {10.2.1}Notes about HTTP proxy servers}{127}{subsection.10.2.1} \contentsline {subsection}{\numberline {10.2.2}Notes about HTTPS and FTPS file access}{127}{subsection.10.2.2} \contentsline {subsection}{\numberline {10.2.3}Notes about the stream filetype driver}{128}{subsection.10.2.3} \contentsline {subsection}{\numberline {10.2.4}Notes about the gsiftp filetype}{128}{subsection.10.2.4} \contentsline {subsection}{\numberline {10.2.5}Notes about the root filetype}{129}{subsection.10.2.5} \contentsline {subsection}{\numberline {10.2.6}Notes about the shmem filetype:}{131}{subsection.10.2.6} \contentsline {section}{\numberline {10.3}Base Filename}{131}{section.10.3} \contentsline {section}{\numberline {10.4}Output File Name when Opening an Existing File}{133}{section.10.4} \contentsline {section}{\numberline {10.5}Template File Name when Creating a New File}{135}{section.10.5} \contentsline {section}{\numberline {10.6}Image Tile-Compression Specification}{135}{section.10.6} \contentsline {section}{\numberline {10.7}HDU Location Specification}{135}{section.10.7} \contentsline {section}{\numberline {10.8}Image Section}{137}{section.10.8} \contentsline {section}{\numberline {10.9}Image Transform Filters}{138}{section.10.9} \contentsline {section}{\numberline {10.10}Column and Keyword Filtering Specification}{139}{section.10.10} \contentsline {section}{\numberline {10.11}Row Filtering Specification}{142}{section.10.11} \contentsline {subsection}{\numberline {10.11.1}General Syntax}{143}{subsection.10.11.1} \contentsline {subsection}{\numberline {10.11.2}Bit Masks}{145}{subsection.10.11.2} \contentsline {subsection}{\numberline {10.11.3}Vector Columns}{146}{subsection.10.11.3} \contentsline {subsection}{\numberline {10.11.4}Row Access}{148}{subsection.10.11.4} \contentsline {subsection}{\numberline {10.11.5}Good Time Interval Filtering}{148}{subsection.10.11.5} \contentsline {subsection}{\numberline {10.11.6}Spatial Region Filtering}{149}{subsection.10.11.6} \contentsline {subsection}{\numberline {10.11.7}Example Row Filters}{151}{subsection.10.11.7} \contentsline {section}{\numberline {10.12} Binning or Histogramming Specification}{152}{section.10.12} \contentsline {chapter}{\numberline {11}Template Files }{155}{chapter.11} \contentsline {section}{\numberline {11.1}Detailed Template Line Format}{155}{section.11.1} \contentsline {section}{\numberline {11.2}Auto-indexing of Keywords}{156}{section.11.2} \contentsline {section}{\numberline {11.3}Template Parser Directives}{157}{section.11.3} \contentsline {section}{\numberline {11.4}Formal Template Syntax}{158}{section.11.4} \contentsline {section}{\numberline {11.5}Errors}{158}{section.11.5} \contentsline {section}{\numberline {11.6}Examples}{158}{section.11.6} \contentsline {chapter}{\numberline {12} Local FITS Conventions }{161}{chapter.12} \contentsline {section}{\numberline {12.1}64-Bit Long Integers}{161}{section.12.1} \contentsline {section}{\numberline {12.2}Long String Keyword Values.}{161}{section.12.2} \contentsline {section}{\numberline {12.3}Arrays of Fixed-Length Strings in Binary Tables}{163}{section.12.3} \contentsline {section}{\numberline {12.4}Keyword Units Strings}{163}{section.12.4} \contentsline {section}{\numberline {12.5}HIERARCH Convention for Extended Keyword Names}{163}{section.12.5} \contentsline {section}{\numberline {12.6}Tile-Compressed Image Format}{164}{section.12.6} \contentsline {chapter}{\numberline {13} Optimizing Programs }{167}{chapter.13} \contentsline {section}{\numberline {13.1}How CFITSIO Manages Data I/O}{167}{section.13.1} \contentsline {section}{\numberline {13.2}Optimization Strategies}{168}{section.13.2} \contentsline {chapter}{\numberline {A}Index of Routines }{173}{appendix.A} \contentsline {chapter}{\numberline {B}Parameter Definitions }{179}{appendix.B} \contentsline {chapter}{\numberline {C}CFITSIO Error Status Codes }{185}{appendix.C} cfitsio-3.47/docs/cfortran.doc0000644000225700000360000027237313464573431015662 0ustar cagordonlhea/* cfortran.doc 4.3 */ /* www-zeus.desy.de/~burow OR anonymous ftp@zebra.desy.de */ /* Burkhard Burow burow@desy.de 1990 - 1998. */ See Licensing information at the end of this file. cfortran.h : Interfacing C or C++ and FORTRAN Supports: Alpha and VAX VMS, Alpha OSF, DECstation and VAX Ultrix, IBM RS/6000, Silicon Graphics, Sun, CRAY, Apollo, HP9000, LynxOS, Convex, Absoft, f2c, g77, NAG f90, PowerStation Fortran with Visual C++, NEC SX-4, Portland Group. C and C++ are generally equivalent as far as cfortran.h is concerned. Unless explicitly noted otherwise, mention of C implicitly includes C++. C++ compilers tested include: SunOS> CC +p +w # Clean compiles. IRIX> CC # Clean compiles. IRIX> CC -fullwarn # Still some warnings to be overcome. GNU> g++ -Wall # Compiles are clean, other than warnings for unused # cfortran.h static routines. N.B.: The best documentation on interfacing C or C++ and Fortran is in the chapter named something like 'Interfacing C and Fortran' to be found in the user's guide of almost every Fortran compiler. Understanding this information for one or more Fortran compilers greatly clarifies the aims and actions of cfortran.h. Such a chapter generally also addresses issues orthogonal to cfortran.h, for example the order of array indices, the index of the first element, as well as compiling and linking issues. 0 Short Summary of the Syntax Required to Create the Interface -------------------------------------------------------------- e.g. Prototyping a FORTRAN subroutine for C: /* PROTOCCALLSFSUBn is optional for C, but mandatory for C++. */ PROTOCCALLSFSUB2(SUB_NAME,sub_name,STRING,PINT) #define SUB_NAME(A,B) CCALLSFSUB2(SUB_NAME,sub_name,STRING,PINT, A,B) ^ - - number of arguments _____| | STRING BYTE PBYTE BYTEV(..)| / | STRINGV DOUBLE PDOUBLE DOUBLEV(..)| / | PSTRING FLOAT PFLOAT FLOATV(..)| types of arguments ____ / | PNSTRING INT PINT INTV(..)| \ | PPSTRING LOGICAL PLOGICAL LOGICALV(..)| \ | PSTRINGV LONG PLONG LONGV(..)| \ | ZTRINGV SHORT PSHORT SHORTV(..)| | PZTRINGV ROUTINE PVOID SIMPLE | - - e.g. Prototyping a FORTRAN function for C: /* PROTOCCALLSFFUNn is mandatory for both C and C++. */ PROTOCCALLSFFUN1(INT,FUN_NAME,fun_name,STRING) #define FUN_NAME(A) CCALLSFFUN1(FUN_NAME,fun_name,STRING, A) e.g. calling FUN_NAME from C: {int a; a = FUN_NAME("hello");} e.g. Creating a FORTRAN-callable wrapper for a C function returning void, with a 7 dimensional integer array argument: [Not supported from C++.] FCALLSCSUB1(csub_name,CSUB_NAME,csub_name,INTVVVVVVV) e.g. Creating a FORTRAN-callable wrapper for other C functions: FCALLSCFUN1(STRING,cfun_name,CFUN_NAME,cfun_name,INT) [ ^-- BYTE, DOUBLE, FLOAT, INT, LOGICAL, LONG, SHORT, VOID are other types returned by functions. ] e.g. COMMON BLOCKs: FORTRAN: common /fcb/ v,w,x character *(13) v, w(4), x(3,2) C: typedef struct { char v[13],w[4][13],x[2][3][13]; } FCB_DEF; #define FCB COMMON_BLOCK(FCB,fcb) COMMON_BLOCK_DEF(FCB_DEF,FCB); FCB_DEF FCB; /* Define, i.e. allocate memory, in exactly one *.c file. */ e.g. accessing FCB in C: printf("%.13s",FCB.v); I Introduction -------------- cfortran.h is an easy-to-use powerful bridge between C and FORTRAN. It provides a completely transparent, machine independent interface between C and FORTRAN routines (= subroutines and/or functions) and global data, i.e. structures and COMMON blocks. The complete cfortran.h package consists of 4 files: the documentation in cfortran.doc, the engine cfortran.h, examples in cfortest.c and cfortex.f/or. [cfortex.for under VMS, cfortex.f on other machines.] The cfortran.h package continues to be developed. The most recent version is available via www at http://www-zeus.desy.de/~burow or via anonymous ftp at zebra.desy.de (131.169.2.244). The examples may be run using one of the following sets of instructions: N.B. Unlike earlier versions, cfortran.h 3.0 and later versions automatically uses the correct ANSI ## or pre-ANSI /**/ preprocessor operator as required by the C compiler. N.B. As a general rule when trying to determine how to link C and Fortran, link a trivial Fortran program using the Fortran compilers verbose option, in order to see how the Fortran compiler drives the linker. e.g. unix> cat f.f END unix> f77 -v f.f .. lots of info. follows ... N.B. If using a C main(), i.e. Fortran PROGRAM is not entry of the executable, and if the link bombs with a complaint about a missing "MAIN" (e.g. MAIN__, MAIN_, f90_main or similar), then Fortran has hijacked the entry point to the executable and wishes to call the rest of the executable via "MAIN". This can usually be satisfied by doing e.g. 'cc -Dmain=MAIN__ ...' but often kills the command line arguments in argv and argc. The f77 verbose option, usually -v, may point to a solution. RS/6000> # Users are strongly urged to use f77 -qextname and cc -Dextname RS/6000> # Use -Dextname=extname if extname is a symbol used in the C code. RS/6000> xlf -c -qextname cfortex.f RS/6000> cc -c -Dextname cfortest.c RS/6000> xlf -o cfortest cfortest.o cfortex.o && cfortest DECFortran> #Only DECstations with DECFortran for Ultrix RISC Systems. DECFortran> cc -c -DDECFortran cfortest.c DECFortran> f77 -o cfortest cfortest.o cfortex.f && cfortest IRIX xxxxxx 5.2 02282015 IP20 mips MIPS> # DECstations and Silicon Graphics using the MIPS compilers. MIPS> cc -o cfortest cfortest.c cfortex.f -lI77 -lU77 -lF77 && cfortest MIPS> # Can also let f77 drive linking, e.g. MIPS> cc -c cfortest.c MIPS> f77 -o cfortest cfortest.o cfortex.f && cfortest Apollo> # Some 'C compiler 68K Rev6.8' break. [See Section II o) Notes: Apollo] Apollo> f77 -c cfortex.f && cc -o cfortest cfortest.c cfortex.o && cfortest VMS> define lnk$library sys$library:vaxcrtl VMS> cc cfortest.c VMS> fortran cfortex.for VMS> link/exec=cfortest cfortest,cfortex VMS> run cfortest OSF1 xxxxxx V3.0 347 alpha Alpha/OSF> # Probably better to let cc drive linking, e.g. Alpha/OSF> f77 -c cfortex.f Alpha/OSF> cc -o cfortest cfortest.c cfortex.o -lUfor -lfor -lFutil -lots -lm Alpha/OSF> cfortest Alpha/OSF> # Else may need 'cc -Dmain=MAIN__' to let f77 drive linking. Sun> # Some old cc(1) need a little help. [See Section II o) Notes: Sun] Sun> f77 -o cfortest cfortest.c cfortex.f -lc -lm && cfortest Sun> # Some older f77 may require 'cc -Dmain=MAIN_'. CRAY> cft77 cfortex.f CRAY> cc -c cfortest.c CRAY> segldr -o cfortest.e cfortest.o cfortex.o CRAY> ./cfortest.e NEC> cc -c -Xa cfortest.c NEC> f77 -o cfortest cfortest.o cfortex.f && cfortest VAX/Ultrix/cc> # For cc on VAX Ultrix only, do the following once to cfortran.h. VAX/Ultrix/cc> mv cfortran.h cftmp.h && grep -v "^#pragma" cfortran.h VAX/Ultrix/f77> # In the following, 'CC' is either 'cc' or 'gcc -ansi'. NOT'vcc' VAX/Ultrix/f77> CC -c -Dmain=MAIN_ cfortest.c VAX/Ultrix/f77> f77 -o cfortest cfortex.f cfortest.o && cfortest LynxOS> # In the following, 'CC' is either 'cc' or 'gcc -ansi'. LynxOS> # Unfortunately cc is easily overwhelmed by cfortran.h, LynxOS> # and won't compile some of the cfortest.c demos. LynxOS> f2c -R cfortex.f LynxOS> CC -Dlynx -o cfortest cfortest.c cfortex.c -lf2c && cfortest HP9000> # Tested with HP-UX 7.05 B 9000/380 and with A.08.07 A 9000/730 HP9000> # CC may be either 'c89 -Aa' or 'cc -Aa' HP9000> # Depending on the compiler version, you may need to include the HP9000> # option '-tp,/lib/cpp' or worse, you'll have to stick to the K&R C. HP9000> # [See Section II o) Notes: HP9000] HP9000> # Users are strongly urged to use f77 +ppu and cc -Dextname HP9000> # Use -Dextname=extname if extname is a symbol used in the C code. HP9000> CC -Dextname -c cfortest.c HP9000> f77 +ppu cfortex.f -o cfortest cfortest.o && cfortest HP9000> # Older f77 may need HP9000> f77 -c cfortex.f HP9000> CC -o cfortest cfortest.c cfortex.o -lI77 -lF77 && cfortest HP0000> # If old-style f77 +800 compiled objects are required: HP9000> # #define hpuxFortran800 HP9000> cc -c -Aa -DhpuxFortran800 cfortest.c HP9000> f77 +800 -o cfortest cfortest.o cfortex.f f2c> # In the following, 'CC' is any C compiler. f2c> f2c -R cfortex.f f2c> CC -o cfortest -Df2cFortran cfortest.c cfortex.c -lf2c && cfortest Portland Group $ # Presumably other C compilers also work. Portland Group $ pgcc -DpgiFortran -c cfortest.c Portland Group $ pgf77 -o cfortest cfortex.f cfortest.o && cfortest NAGf90> # cfortex.f is distributed with Fortran 77 style comments. NAGf90> # To convert to f90 style comments do the following once to cfortex.f: NAGf90> mv cfortex.f cf_temp.f && sed 's/^C/\!/g' cf_temp.f > cfortex.f NAGf90> # In the following, 'CC' is any C compiler. NAGf90> CC -c -DNAGf90Fortran cfortest.c NAGf90> f90 -o cfortest cfortest.o cfortex.f && cfortest PC> # On a PC with PowerStation Fortran and Visual_C++ PC> cl /c cftest.c PC> fl32 cftest.obj cftex.for GNU> # GNU Fortran GNU> # See Section VI caveat on using 'gcc -traditional'. GNU> gcc -ansi -Wall -O -c -Df2cFortran cfortest.c GNU> g77 -ff2c -o cfortest cfortest.o cfortex.f && cfortest AbsoftUNIX> # Absoft Fortran for all UNIX based operating systems. AbsoftUNIX> # e.g. Linux or Next on Intel or Motorola68000. AbsoftUNIX> # Absoft f77 -k allows Fortran routines to be safely called from C. AbsoftUNIX> gcc -ansi -Wall -O -c -DAbsoftUNIXFortran cfortest.c AbsoftUNIX> f77 -k -o cfortest cfortest.o cfortex.f && cfortest AbsoftPro> # Absoft Pro Fortran for MacOS AbsoftPro> # Use #define AbsoftProFortran CLIPPER> # INTERGRAPH CLIX using CLIPPER C and Fortran compilers. CLIPPER> # N.B. - User, not cfortran.h, is responsible for CLIPPER> # f77initio() and f77uninitio() if required. CLIPPER> # - LOGICAL values are not mentioned in CLIPPER doc.s, CLIPPER> # so they may not yet be correct in cfortran.h. CLIPPER> # - K&R mode (-knr or Ac=knr) breaks FLOAT functions CLIPPER> # (see CLIPPER doc.s) and cfortran.h does not fix it up. CLIPPER> # [cfortran.h ok for old sun C which made the same mistake.] CLIPPER> acc cfortest.c -c -DCLIPPERFortran CLIPPER> af77 cfortex.f cfortest.o -o cfortest By changing the SELECTion ifdef of cfortest.c and recompiling one can try out a few dozen different few-line examples. The benefits of using cfortran.h include: 1. Machine/OS/compiler independent mixing of C and FORTRAN. 2. Identical (within syntax) calls across languages, e.g. C FORTRAN CALL HBOOK1(1,'pT spectrum of pi+',100,0.,5.,0.) /* C*/ HBOOK1(1,"pT spectrum of pi+",100,0.,5.,0.); 3. Each routine need only be set up once in its lifetime. e.g. /* Setting up a FORTRAN routine to be called by C. ID,...,VMX are merely the names of arguments. These tags must be unique w.r.t. each other but are otherwise arbitrary. */ PROTOCCALLSFSUB6(HBOOK1,hbook1,INT,STRING,INT,FLOAT,FLOAT,FLOAT) #define HBOOK1(ID,CHTITLE,NX,XMI,XMA,VMX) \ CCALLSFSUB6(HBOOK1,hbook1,INT,STRING,INT,FLOAT,FLOAT,FLOAT, \ ID,CHTITLE,NX,XMI,XMA,VMX) 4. Source code is NOT required for the C routines exported to FORTRAN, nor for the FORTRAN routines imported to C. In fact, routines are most easily prototyped using the information in the routines' documentation. 5. Routines, and the code calling them, can be coded naturally in the language of choice. C routines may be coded with the natural assumption of being called only by C code. cfortran.h does all the required work for FORTRAN code to call C routines. Similarly it also does all the work required for C to call FORTRAN routines. Therefore: - C programmers need not embed FORTRAN argument passing mechanisms into their code. - FORTRAN code need not be converted into C code. i.e. The honed and time-honored FORTRAN routines are called by C. 6. cfortran.h is a single ~1700 line C include file; portable to most remaining, if not all, platforms. 7. STRINGS and VECTORS of STRINGS along with the usual simple arguments to routines are supported as are functions returning STRINGS or numbers. Arrays of pointers to strings and values of structures as C arguments, will soon be implemented. After learning the machinery of cfortran.h, users can expand it to create custom types of arguments. [This requires no modification to cfortran.h, all the preprocessor directives required to implement the custom types can be defined outside cfortran.h] 8. cfortran.h requires each routine to be exported to be explicitly set up. While is usually only be done once in a header file it would be best if applications were required to do no work at all in order to cross languages. cfortran.h's simple syntax could be a convenient back-end for a program which would export FORTRAN or C routines directly from the source code. ----- Example 1 - cfortran.h has been used to make the C header file hbook.h, which then gives any C programmer, e.g. example.c, full and completely transparent access to CERN's HBOOK library of routines. Each HBOOK routine required about 3 lines of simple code in hbook.h. The example also demonstrates how FORTRAN common blocks are defined and used. /* hbook.h */ #include "cfortran.h" : PROTOCCALLSFSUB6(HBOOK1,hbook1,INT,STRING,INT,FLOAT,FLOAT,FLOAT) #define HBOOK1(ID,CHTITLE,NX,XMI,XMA,VMX) \ CCALLSFSUB6(HBOOK1,hbook1,INT,STRING,INT,FLOAT,FLOAT,FLOAT, \ ID,CHTITLE,NX,XMI,XMA,VMX) : /* end hbook.h */ /* example.c */ #include "hbook.h" : typedef struct { int lines; int status[SIZE]; float p[SIZE]; /* momentum */ } FAKE_DEF; #define FAKE COMMON_BLOCK(FAKE,fake) COMMON_BLOCK_DEF(FAKE_DEF,FAKE); : main () { : HBOOK1(1,"pT spectrum of pi+",100,0.,5.,0.); /* c.f. the call in FORTRAN: CALL HBOOK1(1,'pT spectrum of pi+',100,0.,5.,0.) */ : FAKE.p[7]=1.0; : } N.B. i) The routine is language independent. ii) hbook.h is machine independent. iii) Applications using routines via cfortran.h are machine independent. ----- Example 2 - Many VMS System calls are most easily called from FORTRAN, but cfortran.h now gives that ease in C. #include "cfortran.h" PROTOCCALLSFSUB3(LIB$SPAWN,lib$spawn,STRING,STRING,STRING) #define LIB$SPAWN(command,input_file,output_file) \ CCALLSFSUB3(LIB$SPAWN,lib$spawn,STRING,STRING,STRING, \ command,input_file,output_file) main () { LIB$SPAWN("set term/width=132","",""); } Obviously the cfortran.h command above could be put into a header file along with the description of the other system calls, but as this example shows, it's not much hassle to set up cfortran.h for even a single call. ----- Example 3 - cfortran.h and the source cstring.c create the cstring.obj library which gives FORTRAN access to all the functions in C's system library described by the system's C header file string.h. C EXAMPLE.FOR PROGRAM EXAMPLE DIMENSION I(20), J(30) : CALL MEMCPY(I,J,7) : END /* cstring.c */ #include /* string.h prototypes memcpy() */ #include "cfortran.h" : FCALLSCSUB3(memcpy,MEMCPY,memcpy,PVOID,PVOID,INT) : The simplicity exhibited in the above example exists for many but not all machines. Note 4. of Section II ii) details the limitations and describes tools which try to maintain the best possible interface when FORTRAN calls C routines. ----- II Using cfortran.h ------------------- The user is asked to look at the source files cfortest.c and cfortex.f for clarification by example. o) Notes: o Specifying the Fortran compiler cfortran.h generates interfaces for the default Fortran compiler. The default can be overridden by defining, . in the code, e.g.: #define NAGf90Fortran OR . in the compile directive, e.g.: unix> cc -DNAGf90Fortran one of the following before including cfortran.h: NAGf90Fortran f2cFortran hpuxFortran apolloFortran sunFortran IBMR2Fortran CRAYFortran mipsFortran DECFortran vmsFortran CONVEXFortran PowerStationFortran AbsoftUNIXFortran SXFortran pgiFortran AbsoftProFortran This also allows crosscompilation. If wanted, NAGf90Fortran, f2cFortran, DECFortran, AbsoftUNIXFortran, AbsoftProFortran and pgiFortran must be requested by the user. o /**/ cfortran.h (ab)uses the comment kludge /**/ when the ANSI C preprocessor catenation operator ## doesn't exist. In at least MIPS C, this kludge is sensitive to blanks surrounding arguments to macros. Therefore, for applications using non-ANSI C compilers, the argtype_i, routine_name, routine_type and common_block_name arguments to the PROTOCCALLSFFUNn, CCALLSFSUB/FUNn, FCALLSCSUB/FUNn and COMMON_BLOCK macros --- MUST NOT --- be followed by any white space characters such as blanks, tabs or newlines. o LOGICAL FORTRAN LOGICAL values of .TRUE. and .FALSE. do not agree with the C representation of TRUE and FALSE on all machines. cfortran.h does the conversion for LOGICAL and PLOGICAL arguments and for functions returning LOGICAL. Users must convert arrays of LOGICALs from C to FORTRAN with the C2FLOGICALV(array_name, elements_in_array); macro. Similarly, arrays of LOGICAL values may be converted from the FORTRAN into C representation by using F2CLOGICALV(array_name, elements_in_array); When C passes or returns LOGICAL values to FORTRAN, by default cfortran.h only makes the minimal changes required to the value. [e.g. Set/Unset the single relevant bit or do nothing for FORTRAN compilers which use 0 as FALSE and treat all other values as TRUE.] Therefore cfortran.h will pass LOGICALs to FORTRAN which do not have an identical representation to .TRUE. or .FALSE. This is fine except for abuses of FORTRAN/77 in the style of: logical l if (l .eq. .TRUE.) ! (1) instead of the correct: if (l .eqv. .TRUE.) ! (2) or: if (l) ! (3) For FORTRAN code which treats LOGICALs from C in the method of (1), LOGICAL_STRICT must be defined before including cfortran.h, either in the code, "#define LOGICAL_STRICT", or compile with "cc -DLOGICAL_STRICT". There is no reason to use LOGICAL_STRICT for FORTRAN code which does not do (1). At least the IBM's xlf and the Apollo's f77 do not even allow code along the lines of (1). DECstations' DECFortran and MIPS FORTRAN compilers use different internal representations for LOGICAL values. [Both compilers are usually called f77, although when both are installed on a single machine the MIPS' one is usually renamed. (e.g. f772.1 for version 2.10.)] cc doesn't know which FORTRAN compiler is present, so cfortran.h assumes MIPS f77. To use cc with DECFortran define the preprocessor constant 'DECFortran'. e.g. i) cc -DDECFortran -c the_code.c or ii) #define DECFortran /* in the C code or add to cfortran.h. */ MIPS f77 [SGI and DECstations], f2c, and f77 on VAX Ultrix treat .eqv./.neqv. as .eq./.ne.. Therefore, for these compilers, LOGICAL_STRICT is defined by default in cfortran.h. [The Sun and HP compilers have not been tested, so they may also require LOGICAL_STRICT as the default.] o SHORT and BYTE They are irrelevant for the CRAY where FORTRAN has no equivalent to C's short. Similarly BYTE is irrelevant for f2c and for VAX Ultrix f77 and fort. The author has tested SHORT and BYTE with a modified cfortest.c/cfortex.f on all machines supported except for the HP9000 and the Sun. BYTE is a signed 8-bit quantity, i.e. values are -128 to 127, on all machines except for the SGI [at least for MIPS Computer Systems 2.0.] On the SGI it is an unsigned 8-bit quantity, i.e. values are 0 to 255, although the SGI 'FORTRAN 77 Programmers Guide' claims BYTE is signed. Perhaps MIPS 2.0 is dated, since the DECstations using MIPS 2.10 f77 have a signed BYTE. To minimize the difficulties of signed and unsigned BYTE, cfortran.h creates the type 'INTEGER_BYTE' to agree with FORTRAN's BYTE. Users may define SIGNED_BYTE or UNSIGNED_BYTE, before including cfortran.h, to specify FORTRAN's BYTE. If neither is defined, cfortran.h assumes SIGNED_BYTE. o CRAY The type DOUBLE in cfortran.h corresponds to FORTRAN's DOUBLE PRECISION. The type FLOAT in cfortran.h corresponds to FORTRAN's REAL. On a classic CRAY [i.e. all models except for the t3e]: ( 64 bit) C float == C double == Fortran REAL (128 bit) C long double == Fortran DOUBLE PRECISION Therefore when moving a mixed C and FORTRAN app. to/from a classic CRAY, either the C code will have to change, or the FORTRAN code and cfortran.h declarations will have to change. DOUBLE_PRECISION is a cfortran.h macro which provides the former option, i.e. the C code is automatically changed. DOUBLE_PRECISION is 'long double' on classic CRAY and 'double' elsewhere. DOUBLE_PRECISION thus corresponds to FORTRAN's DOUBLE PRECISION on all machines, including classic CRAY. On a classic CRAY with the fortran compiler flag '-dp': Fortran DOUBLE PRECISION thus is also the faster 64bit type. (This switch is often used since the application is usually satisfied by 64 bit precision and the application needs the speed.) DOUBLE_PRECISION is thus not required in this case, since the classic CRAY behaves like all other machines. If DOUBLE_PRECISION is used nonetheless, then on the classic CRAY the default cfortran.h behavior must be overridden, for example by the C compiler option '-DDOUBLE_PRECISION=double'. On a CRAY t3e: (32 bit) C float == Fortran Unavailable (64 bit) C double == C long double == Fortran REAL == Fortran DOUBLE PRECISION Notes: - (32 bit) is available as Fortran REAL*4 and (64 bit) is available as Fortran REAL*8. Since cfortran.h is all about more portability, not about less portability, the use of the nonstandard REAL*4 and REAL*8 is strongly discouraged. - Fortran DOUBLE PRECISION is folded to REAL with the following warning: 'DOUBLE PRECISION is not supported on this platform. REAL will be used.' Similarly, Fortran REAL*16 is mapped to REAL*8 with a warning. This behavior differs from that of other machines, including the classic CRAY. FORTRAN_REAL is thus introduced for the t3e, just as DOUBLE_PRECISION is introduced for the classic CRAY. FORTRAN_REAL is 'double' on t3e and 'float' elsewhere. FORTRAN_REAL thus corresponds to FORTRAN's REAL on all machines, including t3e. o f2c f2c, by default promotes REAL functions to double. cfortran.h does not (yet) support this, so the f2c -R option must be used to turn this promotion off. o f2c [Thanks to Dario Autiero for pointing out the following.] f2c has a strange feature in that either one or two underscores are appended to a Fortran name of a routine or common block, depending on whether or not the original name contains an underscore. S.I. Feldman et al., "A fortran to C converter", Computing Science Technical Report No. 149. page 2, chapter 2: INTERLANGUAGE conventions ........... To avoid conflict with the names of library routines and with names that f2c generates, Fortran names may have one or two underscores appended. Fortran names are forced to lower case (unless the -U option described in Appendix B is in effect); external names, i.e. the names of fortran procedures and common blocks, have a single underscore appended if they do not contain any underscore and have a pair of underscores appended if they do contain underscores. Thus fortran subroutines names ABC, A_B_C and A_B_C_ result in C functions named abc_, a_b_c__ and a_b_c___. ........... cfortran.h is unable to change the naming convention on a name by name basis. Fortran routine and common block names which do not contain an underscore are unaffected by this feature. Names which do contain an underscore may use the following work-around: /* First 2 lines are a completely standard cfortran.h interface to the Fortran routine E_ASY . */ PROTOCCALLSFSUB2(E_ASY,e_asy, PINT, INT) #define E_ASY(A,B) CCALLSFSUB2(E_ASY,e_asy, PINT, INT, A, B) #ifdef f2cFortran #define e_asy_ e_asy__ #endif /* Last three lines are a work-around for the strange f2c naming feature. */ o NAG f90 The Fortran 77 subset of Fortran 90 is supported. Extending cfortran.h to interface C with all of Fortran 90 has not yet been examined. The NAG f90 library hijacks the main() of any program and starts the user's program with a call to: void f90_main(void); While this in itself is only a minor hassle, a major problem arises because NAG f90 provides no mechanism to access command line arguments. At least version 'NAGWare f90 compiler Version 1.1(334)' appended _CB to common block names instead of the usual _. To fix, add this to cfortran.h: #ifdef old_NAG_f90_CB_COMMON #define COMMON_BLOCK CFC_ /* for all other Fortran compilers */ #else #define COMMON_BLOCK(UN,LN) _(LN,_CB) #endif o RS/6000 Using "xlf -qextname ...", which appends an underscore, '_', to all FORTRAN external references, requires "cc -Dextname ..." so that cfortran.h also generates these underscores. Use -Dextname=extname if extname is a symbol used in the C code. The use of "xlf -qextname" is STRONGLY ENCOURAGED, since it allows for transparent naming schemes when mixing C and Fortran. o HP9000 Using "f77 +ppu ...", which appends an underscore, '_', to all FORTRAN external references, requires "cc -Dextname ..." so that cfortran.h also generates these underscores. Use -Dextname=extname if extname is a symbol used in the C code. The use of "f77 +ppu" is STRONGLY ENCOURAGED, since it allows for transparent naming schemes when mixing C and Fortran. At least one release of the HP /lib/cpp.ansi preprocessor is broken and will go into an infinite loop when trying to process cfortran.h with the ## catenation operator. The K&R version of cfortran.h must then be used and the K&R preprocessor must be specified. e.g. HP9000> cc -Aa -tp,/lib/cpp -c source.c The same problem with a similar solution exists on the Apollo. An irrelevant error message '0: extraneous name /usr/include' will appear for each source file due to another HP bug, and can be safely ignored. e.g. 'cc -v -c -Aa -tp,/lib/cpp cfortest.c' will show that the driver passes '-I /usr/include' instead of '-I/usr/include' to /lib/cpp On some machines the above error causes compilation to stop; one must then use K&R C, as with old HP compilers which don't support function prototyping. cfortran.h has to be informed that K&R C is to being used, e.g. HP9000> cc -D__CF__KnR -c source.c o AbsoftUNIXFortran By default, cfortran.h follows the default AbsoftUNIX/ProFortran and prepends _C to each COMMON BLOCK name. To override the cfortran.h behavior #define COMMON_BLOCK(UN,LN) before #including cfortran.h. [Search for COMMON_BLOCK in cfortran.h for examples.] o Apollo On at least one release, 'C compiler 68K Rev6.8(168)', the default C preprocessor, from cc -A xansi or cc -A ansi, enters an infinite loop when using cfortran.h. This Apollo bug can be circumvented by using: . cc -DANSI_C_preprocessor=0 to force use of /**/, instead of '##'. AND . The pre-ANSI preprocessor, i.e. use cc -Yp,/usr/lib The same problem with a similar solution exists on the HP. o Sun Old versions of cc(1), say <~1986, may require help for cfortran.h applications: . #pragma may not be understood, hence cfortran.h and cfortest.c may require sun> mv cfortran.h cftmp.h && grep -v "^#pragma" cfortran.h sun> mv cfortest.c cftmp.c && grep -v "^#pragma" cfortest.c . Old copies of math.h may not include the following from a newer math.h. [For an ancient math.h on a 386 or sparc, get similar from a new math.h.] #ifdef mc68000 /* 5 lines Copyright (c) 1988 by Sun Microsystems, Inc. */ #define FLOATFUNCTIONTYPE int #define RETURNFLOAT(x) return (*(int *)(&(x))) #define ASSIGNFLOAT(x,y) *(int *)(&x) = y #endif o CRAY, Sun, Apollo [pre 6.8 cc], VAX Ultrix and HP9000 Only FORTRAN routines with less than 15 arguments can be prototyped for C, since these compilers don't allow more than 31 arguments to a C macro. This can be overcome, [see Section IV], with access to any C compiler without this limitation, e.g. gcc, on ANY machine. o VAX Ultrix vcc (1) with f77 is not supported. Although: VAXUltrix> f77 -c cfortex.f VAXUltrix> vcc -o cfortest cfortest.c cfortex.o -lI77 -lU77 -lF77 && cfortest will link and run. However, the FORTRAN standard I/O is NOT merged with the stdin and stdout of C, and instead uses the files fort.6 and fort.5. For vcc, f77 can't drive the linking, as for gcc and cc, since vcc objects must be linked using lk (1). f77 -v doesn't tell much, and without VAX Ultrix manuals, the author can only wait for the info. required. fort (1) is not supported. Without VAX Ultrix manuals the author cannot convince vcc/gcc/cc and fort to generate names of routines and COMMON blocks that match at the linker, lk (1). i.e. vcc/gcc/cc prepend a single underscore to external references, e.g. NAME becomes _NAME, while fort does not modify the references. So ... either fort has prepend an underscore to external references, or vcc/gcc/cc have to generate unmodified names. man 1 fort mentions JBL, is JBL the only way? o VAX VMS C The compiler 'easily' exhausts its table space and generates: %CC-F-BUGCHECK, Compiler bug check during parser phase . Submit an SPR with a problem description. At line number 777 in DISK:[DIR]FILE.C;1. where the line given, '777', includes a call across C and FORTRAN via cfortran.h, usually with >7 arguments and/or very long argument expressions. This SPR can be staved off, with the simple modification to cfortran.h, such that the relevant CCALLSFSUBn (or CCALLSFFUNn or FCALLSCFUNn) is not cascaded up to CCALLSFSUB14, and instead has its own copy of the contents of CCALLSFSUB14. [If these instructions are not obvious after examining cfortran.h please contact the author.] [Thanks go to Mark Kyprianou (kyp@stsci.edu) for this solution.] o Mips compilers e.g. DECstations and SGI, require applications with a C main() and calls to GETARG(3F), i.e. FORTRAN routines returning the command line arguments, to use two macros as shown: : CF_DECLARE_GETARG; /* This must be external to all routines. */ : main(int argc, char *argv[]) { : CF_SET_GETARG(argc,argv); /* This must precede any calls to GETARG(3F). */ : } The macros are null and benign on all other systems. Sun's GETARG(3F) also doesn't work with a generic C main() and perhaps a workaround similar to the Mips' one exists. o Alpha/OSF Using the DEC Fortran and the DEC C compilers of DEC OSF/1 [RT] V1.2 (Rev. 10), Fortran, when called from C, has occasional trouble using a routine received as a dummy argument. e.g. In the following the Fortran routine 'e' will crash when it tries to use the C routine 'c' or the Fortran routine 'f'. The example works on other systems. C FORTRAN /* C */ integer function f() #include f = 2 int f_(); return int e_(int (*u)()); end int c(){ return 1;} integer function e(u) int d (int (*u)()) { return u();} integer u external u main() e=u() { /* Calls to d work. */ return printf("d (c ) returns %d.\n",d (c )); end printf("d (f_) returns %d.\n",d (f_)); /* Calls to e_ crash. */ printf("e_(c ) returns %d.\n",e_(c )); printf("e_(f_) returns %d.\n",e_(f_)); } Solutions to the problem are welcomed! A kludge which allows the above example to work correctly, requires an extra argument to be given when calling the dummy argument function. i.e. Replacing 'e=u()' by 'e=u(1)' allows the above example to work. o The FORTRAN routines are called using macro expansions, therefore the usual caveats for expressions in arguments apply. The expressions to the routines may be evaluated more than once, leading to lower performance and in the worst case bizarre bugs. o For those who wish to use cfortran.h in large applications. [See Section IV.] This release is intended to make it easy to get applications up and running. This implies that applications are not as efficient as they could be: - The current mechanism is inefficient if a single header file is used to describe a large library of FORTRAN functions. Code for a static wrapper fn. is generated in each piece of C source code for each FORTRAN function specified with the CCALLSFFUNn statement, irrespective of whether or not the function is ever called. - Code for several static utility routines internal to cfortran.h is placed into any source code which #includes cfortran.h. These routines should probably be in a library. i) Calling FORTRAN routines from C: -------------------------------- The FORTRAN routines are defined by one of the following two instructions: for a SUBROUTINE: /* PROTOCCALLSFSUBn is optional for C, but mandatory for C++. */ PROTOCCALLSFSUBn(ROUTINE_NAME,routine_name,argtype_1,...,argtype_n) #define Routine_name(argname_1,..,argname_n) \ CCALLSFSUBn(ROUTINE_NAME,routine_name,argtype_1,...,argtype_n, \ argname_1,..,argname_n) for a FUNCTION: PROTOCCALLSFFUNn(routine_type,ROUTINE_NAME,routine_name,argtype_1,...,argtype_n) #define Routine_name(argname_1,..,argname_n) \ CCALLSFFUNn(ROUTINE_NAME,routine_name,argtype_1,...,argtype_n, \ argname_1,..,argname_n) Where: 'n' = 0->14 [SUBROUTINE's ->27] (easily expanded in cfortran.h to > 14 [27]) is the number of arguments to the routine. Routine_name = C name of the routine (IN UPPER CASE LETTERS).[see 2.below] ROUTINE_NAME = FORTRAN name of the routine (IN UPPER CASE LETTERS). routine_name = FORTRAN name of the routine (IN lower case LETTERS). routine_type = the type of argument returned by FORTRAN functions. = BYTE, DOUBLE, FLOAT, INT, LOGICAL, LONG, SHORT, STRING, VOID. [Instead of VOID one would usually use CCALLSFSUBn. VOID forces a wrapper function to be used.] argtype_i = the type of argument passed to the FORTRAN routine and must be consistent in the definition and prototyping of the routine s.a. = BYTE, DOUBLE, FLOAT, INT, LOGICAL, LONG, SHORT, STRING. For vectors, i.e. 1 dim. arrays use = BYTEV, DOUBLEV, FLOATV, INTV, LOGICALV, LONGV, SHORTV, STRINGV, ZTRINGV. For vectors of vectors, i.e. 2 dim. arrays use = BYTEVV, DOUBLEVV, FLOATVV, INTVV, LOGICALVV, LONGVV, SHORTVV. For n-dim. arrays, 1<=n<=7 [7 is the maximum in Fortran 77], = BYTEV..nV's..V, DOUBLEV..V, FLOATV..V, INTV..V, LOGICALV..V, LONGV..V, SHORTV..V. N.B. Array dimensions and types are checked by the C compiler. For routines changing the values of an argument, the keyword is prepended by a 'P'. = PBYTE, PDOUBLE, PFLOAT, PINT, PLOGICAL, PLONG, PSHORT, PSTRING, PSTRINGV, PZTRINGV. For EXTERNAL procedures passed as arguments use = ROUTINE. For exceptional arguments which require no massaging to fit the argument passing mechanisms use = PVOID. The argument is cast and passed as (void *). Although PVOID could be used to describe all array arguments on most (all?) machines , it shouldn't be because the C compiler can no longer check the type and dimension of the array. argname_i = any valid unique C tag, but must be consistent in the definition as shown. Notes: 1. cfortran.h may be expanded to handle a more argument type. To suppport new arguments requiring complicated massaging when passed between Fortran and C, the user will have to understand cfortran.h and follow its code and mechanisms. To define types requiring little or no massaging when passed between Fortran and C, the pseudo argument type SIMPLE may be used. For a user defined type called 'newtype', the definitions required are: /* The following 7 lines are required verbatim. 'newtype' is the name of the new user defined argument type. */ #define newtype_cfV( T,A,B,F) SIMPLE_cfV(T,A,B,F) #define newtype_cfSEP(T, B) SIMPLE_cfSEP(T,B) #define newtype_cfINT(N,A,B,X,Y,Z) SIMPLE_cfINT(N,A,B,X,Y,Z) #define newtype_cfSTR(N,T,A,B,C,D,E) SIMPLE_cfSTR(N,T,A,B,C,D,E) #define newtype_cfCC( T,A,B) SIMPLE_cfCC(T,A,B) #define newtype_cfAA( T,A,B) newtype_cfB(T,A) /* Argument B not used. */ #define newtype_cfU( T,A) newtype_cfN(T,A) /* 'parameter_type(A)' is a declaration for 'A' and describes the type of the parameter expected by the Fortran function. This type will be used in the prototype for the function, if using ANSI C, and to declare the argument used by the intermediate function if calling a Fortran FUNCTION. Valid 'parameter_type(A)' include: int A void (*A)() double A[17] */ #define newtype_cfN( T,A) parameter_type(A) /* Argument T not used. */ /* Before any argument of the new type is passed to the Fortran routine, it may be massaged as given by 'massage(A)'. */ #define newtype_cfB( T,A) massage(A) /* Argument T not used. */ An example of a simple user defined type is given cfortex.f and cfortest.c. Two uses of SIMPLE user defined types are [don't show the 7 verbatim #defines]: /* Pass the address of a structure, using a type called PSTRUCT */ #define PSTRUCT_cfN( T,A) void *A #define PSTRUCT_cfB( T,A) (void *) &(A) /* Pass an integer by value, (not standard F77 ), using a type called INTVAL */ #define INTVAL_cfN( T,A) int A #define INTVAL_cfB( T,A) (A) [If using VAX VMS, surrounding the #defines with "#pragma (no)standard" allows the %CC-I-PARAMNOTUSED messages to be avoided.] Upgrades to cfortran.h try to be, and have been, backwards compatible. This compatibility cannot be offered to user defined types. SIMPLE user defined types are less of a risk since they require so little effort in their creation. If a user defined type is required in more than one C header file of interfaces to libraries of Fortran routines, good programming practice, and ease of code maintenance, suggests keeping any user defined type within a single file which is #included as required. To date, changes to the SIMPLE macros were introduced in versions 2.6, 3.0 and 3.2 of cfortran.h. 2. Routine_name is the name of the macro which the C programmer will use in order to call a FORTRAN routine. In theory Routine_name could be any valid and unique name, but in practice, the name of the FORTRAN routine in UPPER CASE works everywhere and would seem to be an obvious choice. 3. cfortran.h encourages the exact specification of the type and dimension of array parameters because it allows the C compiler to detect errors in the arguments when calling the routine. cfortran.h does not strictly require the exact specification since the argument is merely the address of the array and is passed on to the calling routine. Any array parameter could be declared as PVOID, but this circumvents C's compiletime ability to check the correctness of arguments and is therefore discouraged. Passing the address of these arguments implies that PBYTEV, PFLOATV, ... , PDOUBLEVV, ... don't exist in cfortran.h, since by default the routine and the calling code share the same array, i.e. the same values at the same memory location. These comments do NOT apply to arrays of (P)S/ZTRINGV. For these parameters, cfortran.h passes a massaged copy of the array to the routine. When the routine returns, S/ZTRINGV ignores the copy, while PS/ZTRINGV replaces the calling code's original array with copy, which may have been modified by the called routine. 4. (P)STRING(V): - STRING - If the argument is a fixed length character array, e.g. char ar[8];, the string is blank, ' ', padded on the right to fill out the array before being passed to the FORTRAN routine. The useful size of the string is the same in both languages, e.g. ar[8] is passed as character*7. If the argument is a pointer, the string cannot be blank padded, so the length is passed as strlen(argument). On return from the FORTRAN routine, pointer arguments are not disturbed, but arrays have the terminating '\0' replaced to its original position. i.e. The padding blanks are never visible to the C code. - PSTRING - The argument is massaged as with STRING before being passed to the FORTRAN routine. On return, the argument has all trailing blanks removed, regardless of whether the argument was a pointer or an array. - (P)STRINGV - Passes a 1- or 2-dimensional char array. e.g. char a[7],b[6][8]; STRINGV may thus also pass a string constant, e.g. "hiho". (P)STRINGV does NOT pass a pointer, e.g. char *, to either a 1- or a 2-dimensional array, since it cannot determine the array dimensions. A pointer can only be passed using (P)ZTRINGV. N.B. If a C routine receives a character array argument, e.g. char a[2][3], such an argument is actually a pointer and my thus not be passed by (P)STRINGV. Instead (P)ZTRINGV must be used. - STRINGV - The elements of the argument are copied into space malloc'd, and each element is padded with blanks. The useful size of each element is the same in both languages. Therefore char bb[6][8]; is equivalent to character*7 bb(6). On return from the routine the malloc'd space is simply released. - PSTRINGV - Since FORTRAN has no trailing '\0', elements in an array of strings are contiguous. Therefore each element of the C array is padded with blanks and strip out C's trailing '\0'. After returning from the routine, the trailing '\0' is reinserted and kill the trailing blanks in each element. - SUMMARY: STRING(V) arguments are blank padded during the call to the FORTRAN routine, but remain original in the C code. (P)STRINGV arguments are blank padded for the FORTRAN call, and after returning from FORTRAN trailing blanks are stripped off. 5. (P)ZTRINGV: - (P)ZTRINGV - is identical to (P)STRINGV, except that the dimensions of the array of strings is explicitly specified, which thus also allows a pointer to be passed. (P)ZTRINGV can thus pass a 1- or 2-dimensional char array, e.g. char b[6][8], or it can pass a pointer to such an array, e.g. char *p;. ZTRINGV may thus also pass a string constant, e.g. "hiho". If passing a 1-dimensional array, routine_name_ELEMS_j (see below) must be 1. [Users of (P)ZTRINGV should examine cfortest.c for examples.]: - (P)ZTRINGV must thus be used instead of (P)STRINGV whenever sizeof() can't be used to determine the dimensions of the array of string or strings. e.g. when calling FORTRAN from C with a char * received by C as an argument. - There is no (P)ZTRING type, since (P)ZTRINGV can pass a 1-dimensional array or a pointer to such an array, e.g. char a[7], *b; If passing a 1-dimensional array, routine_name_ELEMS_j (see below) must be 1. - To specify the numbers of elements, routine_name_ELEMS_j and routine_name_ELEMLEN_j must be defined as shown below before interfacing the routine with CCALLSFSUBn, PROTOCCALLSFFUNn, etc. #define routine_name_ELEMS_j ZTRINGV_ARGS(k) [..ARGS for subroutines, ..ARGF for functions.] or #define routine_name_ELEMS_j ZTRINGV_NUM(l) Where: routine_name is as above. j [1-n], is the argument being specifying. k [1-n], the value of the k'th argument is the dynamic number of elements for argument j. The k'th argument must be of type BYTE, DOUBLE, FLOAT, INT, LONG or SHORT. l the number of elements for argument j. This must be an integer constant available at compile time. i.e. it is static. - Similarly to specify the useful length, [i.e. don't count C's trailing '\0',] of each element: #define routine_name_ELEMLEN_j ZTRINGV_ARGS(m) [..ARGS for subroutines, ..ARGF for functions.] or #define routine_name_ELEMLEN_j ZTRINGV_NUM(q) Where: m [1-n], as for k but this is the length of each element. q as for l but this is the length of each element. 6. ROUTINE The argument is an EXTERNAL procedure. When C passes a routine to Fortran, the language of the function must be specified as follows: [The case of some_*_function must be given as shown.] When C passes a C routine to a Fortran: FORTRAN_ROUTINE(arg1, .... , C_FUNCTION(SOME_C_FUNCTION,some_c_function), ...., argn); and similarly when C passes a Fortran routine to Fortran: FORTRAN_ROUTINE(arg1, .... , FORTRAN_FUNCTION(SOME_FORT_FUNCTION,some_fort_function), ...., argn); If fcallsc has been redefined; the same definition of fcallsc used when creating the wrapper for 'some_c_function' must also be defined when C_FUNCTION is used. See ii) 4. of this section for when and how to redefine fcallsc. ROUTINE was introduced with cfortran.h version 2.6. Earlier versions of cfortran.h used PVOID to pass external procedures as arguments. Using PVOID for this purpose is no longer recommended since it won't work 'as is' for apolloFortran, hpuxFortran800, AbsoftUNIXFortran, AbsoftProFortran. 7. CRAY only: In a given piece of source code, where FFUNC is any FORTRAN routine, FORTRAN_FUNCTION(FFUNC,ffunc) disallows a previous #define FFUNC(..) CCALLSFSUBn(FFUNC,ffunc,...) [ or CCALLSFFUNn] in order to make the UPPER CASE FFUNC callable from C. #define Ffunc(..) ... is OK though, as are obviously any other names. ii) Calling C routines from FORTRAN: -------------------------------- Each of the following two statements to export a C routine to FORTRAN create FORTRAN 'wrappers', written in C, which must be compiled and linked along with the original C routines and with the FORTRAN calling code. FORTRAN callable 'wrappers' may also be created for C macros. i.e. in this section, the term 'C function' may be replaced by 'C macro'. for C functions returning void: FCALLSCSUBn( Routine_name,ROUTINE_NAME,routine_name,argtype_1,...,argtype_n) for all other C functions: FCALLSCFUNn(routine_type,Routine_name,ROUTINE_NAME,routine_name,argtype_1,...,argtype_n) Where: 'n' = 0->27 (easily expanded to > 27) stands for the number of arguments to the routine. Routine_name = the C name of the routine. [see 9. below] ROUTINE_NAME = the FORTRAN name of the routine (IN UPPER CASE LETTERS). routine_name = the FORTRAN name of the routine (IN lower case LETTERS). routine_type = the type of argument returned by C functions. = BYTE, DOUBLE, FLOAT, INT, LOGICAL, LONG, SHORT, STRING, VOID. [Instead of VOID, FCALLSCSUBn is recommended.] argtype_i = the type of argument passed to the FORTRAN routine and must be consistent in the definition and prototyping of the routine = BYTE, DOUBLE, FLOAT, INT, LOGICAL, LONG, SHORT, STRING. For vectors, i.e. 1 dim. arrays use = BYTEV, DOUBLEV, FLOATV, INTV, LOGICALV, LONGV, SHORTV, STRINGV. For vectors of vectors, 2 dim. arrays use = BYTEVV, DOUBLEVV, FLOATVV, INTVV, LOGICALVV, LONGVV, SHORTVV. For n-dim. arrays use = BYTEV..nV's..V, DOUBLEV..V, FLOATV..V, INTV..V, LOGICALV..V, LONGV..V, SHORTV..V. For routines changing the values of an argument, the keyword is prepended by a 'P'. = PBYTE, PDOUBLE, PFLOAT, PINT, PLOGICAL, PLONG, PSHORT, PSTRING, PNSTRING, PPSTRING, PSTRINGV. For EXTERNAL procedures passed as arguments use = ROUTINE. For exceptional arguments which require no massaging to fit the argument passing mechanisms use = PVOID. The argument is cast and passed as (void *). Notes: 0. For Fortran calling C++ routines, C++ does NOT easily allow support for: STRINGV. BYTEVV, DOUBLEVV, FLOATVV, INTVV, LOGICALVV, LONGVV, SHORTVV. BYTEV..V, DOUBLEV..V, FLOATV..V, INTV..V, LOGICALV..V, LONGV..V, SHORTV..V. Though there are ways to get around this restriction, the restriction is not serious since these types are unlikely to be used as arguments for a C++ routine. 1. FCALLSCSUB/FUNn expect that the routine to be 'wrapped' has been properly prototyped, or at least declared. 2. cfortran.h may be expanded to handle a new argument type not already among the above. 3. cfortran.h encourages the exact specification of the type and dimension of array parameters because it allows the C compiler to detect errors in the arguments when declaring the routine using FCALLSCSUB/FUNn, assuming the routine to be 'wrapped' has been properly prototyped. cfortran.h does not strictly require the exact specification since the argument is merely the address of the array and is passed on to the calling routine. Any array parameter could be declared as PVOID, but this circumvents C's compiletime ability to check the correctness of arguments and is therefore discouraged. Passing the address of these arguments implies that PBYTEV, PFLOATV, ... , PDOUBLEVV, ... don't exist in cfortran.h, since by default the routine and the calling code share the same array, i.e. the same values at the same memory location. These comments do NOT apply to arrays of (P)STRINGV. For these parameters, cfortran.h passes a massaged copy of the array to the routine. When the routine returns, STRINGV ignores the copy, while PSTRINGV replaces the calling code's original array with copy, which may have been modified by the called routine. 4. (P(N))STRING arguments have any trailing blanks removed before being passed to C, the same holds true for each element in (P)STRINGV. Space is malloc'd in all cases big enough to hold the original string (elements) as well as C's terminating '\0'. i.e. The useful size of the string (elements) is the same in both languages. P(N)STRING(V) => the string (elements) will be copied from the malloc'd space back into the FORTRAN bytes. If one of the two escape mechanisms mentioned below for PNSTRING has been used, the copying back to FORTRAN is obviously not relevant. 5. (PN)STRING's, [NOT PSTRING's nor (P)STRINGV's,] behavior may be overridden in two cases. In both cases PNSTRING and STRING behave identically. a) If a (PN)STRING argument's first 4 bytes are all the NUL character, i.e. '\0\0\0\0' the NULL pointer is passed to the C routine. b) If the characters of a (PN)STRING argument contain at least one HEX-00, i.e. the NUL character, i.e. C strings' terminating '\0', the address of the string is simply passed to the C routine. i.e. The argument is treated in this case as it would be with PPSTRING, to which we refer the reader for more detail. Mechanism a) overrides b). Therefore, to use this mechanism to pass the NULL string, "", to C, the first character of the string must obviously be the NUL character, but of the first 4 characters in the string, at least one must not be HEX-00. Example: C FORTRAN /* C */ character*40 str #include "cfortran.h" C Set up a NULL as : void cs(char *s) {if (s) printf("%s.\n",s);} C i) 4 NUL characters. FCALLSCSUB1(cs,CS,cs,STRING) C ii) NULL pointer. character*4 NULL NULL = CHAR(0)//CHAR(0)//CHAR(0)//CHAR(0) data str/'just some string'/ C Passing the NULL pointer to cs. call cs(NULL) C Passing a copy of 'str' to cs. call cs(str) C Passing address of 'str' to cs. Trailing blanks NOT killed. str(40:) = NULL call cs(str) end Strings passed from Fortran to C via (PN)STRING must not have undefined contents, otherwise undefined behavior will result, since one of the above two escape mechanisms may occur depending on the contents of the string. This is not be a problem for STRING arguments, which are read-only in the C routine and hence must have a well defined value when being passed in. PNSTRING arguments require special care. Even if they are write-only in the C routine, PNSTRING's above two escape mechanisms require that the value of the argument be well defined when being passed in from Fortran to C. Therefore, unless one or both of PNSTRING's escape mechanisms are required, PSTRING should be used instead of PNSTRING. Prior to version 2.8, PSTRING did have the above two escape mechanisms, but they were removed from PSTRING to allow strings with undefined contents to be passed in. PNSTRING behaves like the old PSTRING. [Thanks go to Paul Dubois (dubios@icf.llnl.gov) for pointing out that PSTRING must allow for strings with undefined contents to be passed in.] Example: C FORTRAN /* C */ character*10 s,sn #include "cfortran.h" void ps(char *s) {strcpy(s,"hello");} C Can call ps with undef. s. FCALLSCSUB1(ps,PS,ps,PSTRING) call ps(s) FCALLSCSUB1(ps,PNS,pns,PNSTRING) print *,s,'=s' C Can't call pns with undef. s. C e.g. If first 4 bytes of s were C "\0\0\0\0", ps would try C to copy to NULL because C of PNSTRING mechanism. sn = "" call pns(sn) print *,sn,'=sn' end 6. PPSTRING The address of the string argument is simply passed to the C routine. Therefore the C routine and the FORTRAN calling code share the same string at the same memory location. If the C routine modifies the string, the string will also be modified for the FORTRAN calling code. The user is responsible for negociating the differences in representation of a string in Fortran and in C, i.e. the differences are not automatically resolved as they are for (P(N)STRING(V). This mechanism is provided for two reasons: - Some C routines require the string to exist at the given memory location, after the C routine has exited. Recall that for the usual (P(N)STRING(V) mechanism, a copy of the FORTRAN string is given to the C routine, and this copy ceases to exist after returning to the FORTRAN calling code. - This mechanism can save runtime CPU cycles over (P(N)STRING(V), since it does not perform their malloc, copy and kill trailing blanks of the string to be passed. Only in a small minority of cases does the potential benefit of the saved CPU cycles outweigh the programming effort required to manually resolve the differences in representation of a string in Fortran and in C. For arguments passed via PPSTRING, the argument passed may also be an array of strings. 7. ROUTINE ANSI C requires that the type of the value returned by the routine be known, For all ROUTINE arguments passed from Fortran to C, the type of ROUTINE is specified by defining a cast as follows: #undef ROUTINE_j #define ROUTINE_j (cast) where: j [1-n], is the argument being specifying. (cast) is a cast matching that of the argument expected by the C function protoytpe for which a wrapper is being defined. e.g. To create a Fortran wrapper for qsort(3C): #undef ROUTINE_4 #define ROUTINE_4 (int (*)(void *,void *)) FCALLSCSUB4(qsort,FQSORT,fqsort,PVOID,INT,INT,ROUTINE) In order to maintain backward compatibility, cfortran.h defines a generic cast for ROUTINE_1, ROUTINE_2, ..., ROUTINE_27. The user's definition is therefore strictly required only for DEC C, which at the moment is the only compiler which insists on the correct cast for pointers to functions. When using the ROUTINE argument inside some Fortran code: - it is difficult to pass a C routine as the parameter, since in many Fortran implementations, Fortran has no access to the normal C namespace. e.g. For most UNIX, Fortran implicitly only has access to C routines ending in _. If the calling Fortran code receives the routine as a parameter it can of course easily pass it along. - if a Fortran routine is passed directly as the parameter, the called C routine must call the parameter routine using the Fortran argument passing conventions. - if a Fortran routine is to be passed as the parameter, but if Fortran can be made to pass a C routine as the parameter, then it may be best to pass a C-callable wrapper for the Fortran routine. The called C routine is thus spared all Fortran argument passing conventions. cfortran.h can be used to create such a C-callable wrapper to the parameter Fortran routine. ONLY PowerStationFortran: This Fortran provides no easy way to pass a Fortran routine as an argument to a C routine. The problem arises because in Fortran the stack is cleared by the called routine, while in C/C++ it is cleared by the caller. The C/C++ stack clearing behavior can be changed to that of Fortran by using stdcall__ in the function prototype. The stdcall__ cannot be applied in this case since the called C routine expects the ROUTINE parameter to be a C routine and does not know that it should apply stdcall__. In principle the cfortran.h generated Fortran callable wrapper for the called C routine should be able to massage the ROUTINE argument such that stdcall__ is performed, but it is not yet known how this could be easily done. 8. THE FOLLOWING INSTRUCTIONS ARE NOT REQUIRED FOR VAX VMS ------------ (P)STRINGV information [NOT required for VAX VMS]: cfortran.h cannot convert the FORTRAN vector of STRINGS to the required C vector of STRINGS without explicitly knowing the number of elements in the vector. The application must do one of the following for each (P)STRINGV argument in a routine before that routine's FCALLSCFUNn/SUBn is called: #define routine_name_STRV_Ai NUM_ELEMS(j) or #define routine_name_STRV_Ai NUM_ELEM_ARG(k) or #define routine_name_STRV_Ai TERM_CHARS(l,m) where: routine_name is as above. i [i=1->n.] specifies the argument number of a STRING VECTOR. j would specify a fixed number of elements. k [k=1->n. k!=i] would specify an integer argument which specifies the number of elements. l [char] the terminating character at the beginning of an element, indicating to cfortran.h that the preceding elements in the vector are the valid ones. m [m=1-...] the number of terminating characters required to appear at the beginning of the terminating string element. The terminating element is NOT passed on to the C routine. e.g. #define ce_STRV_A1 TERM_CHARS(' ',2) FCALLSCSUB1(ce,CE,ce,STRINGV) cfortran.h will pass on all elements, in the 1st and only argument to the C routine ce, of the STRING VECTOR until, but not including, the first string element beginning with 2 blank, ' ', characters. 9. INSTRUCTIONS REQUIRED ONLY FOR FORTRAN COMPILERS WHICH GENERATE ------------- ROUTINE NAMES WHICH ARE UNDISTINGUISHABLE FROM C ROUTINE NAMES i.e. VAX VMS AbsoftUNIXFortran (AbsoftProFortran ok, since it uses Uppercase names.) HP9000 if not using the +ppu option of f77 IBM RS/6000 if not using the -qextname option of xlf Call them the same_namespace compilers. FCALLSCSUBn(...) and FCALLSCFUNn(...), when compiled, are expanded into 'wrapper' functions, so called because they wrap around the original C functions and interface the format of the original C functions' arguments and return values with the format of the FORTRAN call. Ideally one wants to be able to call the C routine from FORTRAN using the same name as the original C name. This is not a problem for FORTRAN compilers which append an underscore, '_', to the names of routines, since the original C routine has the name 'name', and the FORTRAN wrapper is called 'name_'. Similarly, if the FORTRAN compiler generates upper case names for routines, the original C routine 'name' can have a wrapper called 'NAME', [Assuming the C routine name is not in upper case.] For these compilers, e.g. Mips, CRAY, IBM RS/6000 'xlf -qextname', HP-UX 'f77 +ppu', the naming of the wrappers is done automatically. For same_namespace compilers things are not as simple, but cfortran.h tries to provide tools and guidelines to minimize the costs involved in meeting their constraints. The following two options can provide same_namespace compilers with distinct names for the wrapper and the original C function. These compilers are flagged by cfortran.h with the CF_SAME_NAMESPACE constant, so that the change in the C name occurs only when required. For the remainder of the discussion, routine names generated by FORTRAN compilers are referred to in lower case, these names should be read as upper case for the appropriate compilers. HP9000: (When f77 +ppu is not used.) f77 has a -U option which forces uppercase external names to be generated. Unfortunately, cc does not handle recursive macros. Hence, if one wished to use -U for separate C and FORTRAN namespaces, one would have to adopt a different convention of naming the macros which allow C to call FORTRAN subroutines. (Functions are not a problem.) The macros are currently the uppercase of the original FORTRAN name, and would have to be changed to lower case or mixed case, or to a different name. (Lower case would of course cause conflicts on many other machines.) Therefore, it is suggested that f77 -U not be used, and instead that Option a) or Option b) outlined below be used. VAX/VMS: For the name used by FORTRAN in calling a C routine to be the same as that of the C routine, the source code of the C routine is required. A preprocessor directive can then force the C compiler to generate a different name for the C routine. e.g. #if defined(vms) #define name name_ #endif void name() {printf("name: was called.\n");} FCALLSCSUB0(name,NAME,name) In the above, the C compiler generates the original routine with the name 'name_' and a wrapper called 'NAME'. This assumes that the name of the routine, as seen by the C programmer, is not in upper case. The VAX VMS linker is not case sensitive, allowing cfortran.h to export the upper case name as the wrapper, which then doesn't conflict with the routine name in C. Since the IBM, HP and AbsoftUNIXFortran platforms have case sensitive linkers this technique is not available to them. The above technique is required even if the C name is in mixed case, see Option a) for the other compilers, but is obviously not required when Option b) is used. Option a) Mixed Case names for the C routines to be called by FORTRAN. If the original C routines have mixed case names, there are no name space conflicts. Nevertheless for VAX/VMS, the technique outlined above must also used. Option b) Modifying the names of C routines when used by FORTRAN: The more robust naming mechanism, which guarantees portability to all machines, 'renames' C routines when called by FORTRAN. Indeed, one must change the names on same_namespace compilers when FORTRAN calls C routines for which the source is unavailable. [Even when the source is available, renaming may be preferable to Option a) for large libraries of C routines.] Obviously, if done for a single type of machine, it must be done for all machines since the names of routines used in FORTRAN code cannot be easily redefined for different machines. The simplest way to achieve this end is to do explicitly give the modified FORTRAN name in the FCALLSCSUBn(...) and FCALLSCFUNn(...) declarations. e.g. FCALLSCSUB0(name,CFNAME,cfname) This allows FORTRAN to call the C routine 'name' as 'cfname'. Any name can of course be used for a given routine when it is called from FORTRAN, although this is discouraged due to the confusion it is sure to cause. e.g. Bizarre, but valid and allowing C's 'call_back' routine to be called from FORTRAN as 'abcd': FCALLSCSUB0(call_back,ABCD,abcd) cfortran.h also provides preprocessor directives for a systematic 'renaming' of the C routines when they are called from FORTRAN. This is done by redefining the fcallsc macro before the FCALLSCSUB/FUN/n declarations as follows: #undef fcallsc #define fcallsc(UN,LN) preface_fcallsc(CF,cf,UN,LN) FCALLSCSUB0(hello,HELLO,hello) Will cause C's routine 'hello' to be known in FORTRAN as 'cfhello'. Similarly all subsequent FCALLSCSUB/FUN/n declarations will generate wrappers to allow FORTRAN to call C with the C routine's name prefaced by 'cf'. The following has the same effect, with subsequent FCALLSCSUB/FUN/n's appending the modifier to the original C routines name. #undef fcallsc #define fcallsc(UN,LN) append_fcallsc(Y,y,UN,LN) FCALLSCSUB0(Xroutine,ROUTINE,routine) Hence, C's Xroutine is called from FORTRAN as: CALL XROUTINEY() The original behavior of FCALLSCSUB/FUN/n, where FORTRAN routine names are left identical to those of C, is returned using: #undef fcallsc #define fcallsc(UN,LN) orig_fcallsc(UN,LN) In C, when passing a C routine, i.e. its wrapper, as an argument to a FORTRAN routine, the FORTRAN name declared is used and the correct fcallsc must be in effect. E.g. Passing 'name' and 'routine' of the above examples to the FORTRAN routines, FT1 and FT2, respectively: /* This might not be needed if fcallsc is already orig_fcallsc. */ #undef fcallsc #define fcallsc(UN,LN) orig_fcallsc(UN,LN) FT1(C_FUNCTION(CFNAME,cfname)); #undef fcallsc #define fcallsc(UN,LN) append_fcallsc(Y,y,UN,LN) FT1(C_FUNCTION(XROUTINE,xroutine)); If the names of C routines are modified when used by FORTRAN, fcallsc would usually be defined once in a header_file.h for the application. This definition would then be used and be valid for the entire application and fcallsc would at no point need to be redefined. ONCE AGAIN: THE DEFINITIONS, INSTRUCTIONS, DECLARATIONS AND DIFFICULTIES DESCRIBED HERE, NOTE 9. of II ii), APPLY ONLY FOR VAX VMS, IBM RS/6000 WITHOUT THE -qextname OPTION FOR xlf, OR HP-UX WITHOUT THE +ppu OPTION FOR f77 AbsoftUNIXFortran AND APPLY ONLY WHEN CREATING WRAPPERS WHICH ENABLE FORTRAN TO CALL C ROUTINES. iii) Using C to manipulate FORTRAN COMMON BLOCKS: ------------------------------------------------------- FORTRAN common blocks are set up with the following three constructs: 1. #define Common_block_name COMMON_BLOCK(COMMON_BLOCK_NAME,common_block_name) Common_block_name is in UPPER CASE. COMMON_BLOCK_NAME is in UPPER CASE. common_block_name is in lower case. [Common_block_name actually follows the same 'rules' as Routine_name in Note 2. of II i).] This construct exists to ensure that C code accessing the common block is machine independent. 2. COMMON_BLOCK_DEF(TYPEDEF_OF_STRUCT, Common_block_name); where typedef { ... } TYPEDEF_OF_STRUCT; declares the structure which maps on to the common block. The #define of Common_block_name must come before the use of COMMON_BLOCK_DEF. 3. In exactly one of the C source files, storage should be set aside for the common block with the definition: TYPEDEF_OF_STRUCT Common_block_name; The above definition may have to be omitted on some machines for a common block which is initialized by Fortran BLOCK DATA or is declared with a smaller size in the C routines than in the Fortran routines. The rules for common blocks are not well defined when linking/loading a mixture of C and Fortran, but the following information may help resolve problems. From the 2nd or ANSI ed. of K&R C, p.31, last paragraph: i) An external variable must be defined, exactly once, outside of any function; this sets aside storage for it. ii) The variable must also be declared in each function that wants to access it; ... The declaration ... may be implicit from context. In Fortran, every routine says 'common /bar/ foo', i.e. part ii) of the above, but there's no part i) requirement. cc/ld on some machines don't require i) either. Therefore, when handling Fortran, and sometimes C, the loader/linker must automagically set aside storage for common blocks. Some loaders, including at least one for the CRAY, turn off the 'automagically set aside storage' capability for Fortran common blocks, if any C object declares that common block. Therefore, C code should define, i.e. set aside storage, for the the common block as shown above. e.g. C Fortran common /fcb/ v,w,x character *(13) v, w(4), x(3,2) /* C */ typedef struct { char v[13],w[4][13],x[2][3][13]; } FCB_DEF; #define Fcb COMMON_BLOCK(FCB,fcb) COMMON_BLOCK_DEF(FCB_DEF,Fcb); FCB_DEF Fcb; /* Definition, which sets aside storage for Fcb, */ /* may appear in at most one C source file. */ C programs can place a string (or a multidimensional array of strings) into a FORTRAN common block using the following call: C2FCBSTR( CSTR, FSTR,DIMENSIONS); where: CSTR is a pointer to the first element of C's copy of the string (array). The C code must use a duplicate of, not the original, common block string, because the FORTRAN common block does not allocate space for C strings' terminating '\0'. FSTR is a pointer to the first element of the string (array) in the common block. DIMENSIONS is the number of dimensions of string array. e.g. char a[10] has DIMENSIONS=0. char aa[10][17] has DIMENSIONS=1. etc... C2FCBSTR will copy the string (array) from CSTR to FSTR, padding with blanks, ' ', the trailing characters as required. C2FCBSTR uses DIMENSIONS and FSTR to determine the lengths of the individual string elements and the total number of elements in the string array. Note that: - the number of string elements in CSTR and FSTR are identical. - for arrays of strings, the useful lengths of strings in CSTR and FSTR must be the same. i.e. CSTR elements each have 1 extra character to accommodate the terminating '\0'. - On most non-ANSI compilers, the DIMENSION argument cannot be prepended by any blanks. FCB2CSTR( FSTR, CSTR,DIMENSIONS) is the inverse of C2FCBSTR, and shares the same arguments and caveats. FCB2CSTR copies each string element of FSTR to CSTR, minus FORTRAN strings' trailing blanks. cfortran.h USERS ARE STRONGLY URGED TO EXAMINE THE COMMON BLOCK EXAMPLES IN cfortest.c AND cfortex.f. The use of strings in common blocks is demonstrated, along with a suggested way for C to imitate FORTRAN EQUIVALENCE'd variables. ===> USERS OF CFORTRAN.H NEED READ NO FURTHER <=== III Some Musings ---------------- cfortran.h is simple enough to be used by the most basic of applications, i.e. making a single C/FORTRAN routine available to the FORTRAN/C programmers. Yet cfortran.h is powerful enough to easily make entire C/FORTRAN libraries available to FORTRAN/C programmers. cfortran.h is the ideal tool for FORTRAN libraries which are being (re)written in C, but are to (continue to) support FORTRAN users. It allows the routines to be written in 'natural C', without having to consider the FORTRAN argument passing mechanisms of any machine. It also allows C code accessing these rewritten routines, to use the C entry point. Without cfortran.h, one risks the perverse practice of C code calling a C function using FORTRAN argument passing mechanisms! Perhaps the philosophy and mechanisms of cfortran.h could be used and extended to create other language bridges such as ADAFORTRAN, CPASCAL, COCCAM, etc. The code generation machinery inside cfortran.h, i.e. the global structure is quite good, being clean and workable as seen by its ability to meet the needs and constraints of many different compilers. Though the individual instructions of the A..., C..., T..., R... and K... tables deserve to be cleaned up. IV Getting Serious with cfortran.h ----------------------------------- cfortran.h is set up to be as simple as possible for the casual user. While this ease of use will always be present, 'hooks', i.e. preprocessor directives, are required in cfortran.h so that some of the following 'inefficiencies' can be eliminated if they cause difficulties: o cfortran.h contains a few small routines for string manipulation. These routines are declared static and are included and compiled in all source code which uses cfortran.h. Hooks should be provided in cfortran.h to create an object file of these routines, allowing cfortran.h to merely prototypes these routines in the application source code. This is the only 'problem' which afflicts both halves of cfortran.h. The remaining discussion refers to the C calls FORTRAN half only. o Similar to the above routines, cfortran.h generates code for a 'wrapper' routine for each FUNCTION exported from FORTRAN. Again cfortran.h needs preprocessor directives to create a single object file of these routines, and to merely prototype them in the applications. o Libraries often contain hundreds of routines. While the preprocessor makes quick work of generating the required interface code from cfortran.h and the application.h's, it may be convenient for very large stable libraries to have final_application.h's which already contain the interface code, i.e. these final_application.h's would not require cfortran.h. [The convenience can be imagined for the VAX VMS CC compiler which has a fixed amount of memory for preprocessor directives. Not requiring cfortran.h, with its hundreds of directives, could help prevent this compiler from choking on its internal limits quite so often.] With a similar goal in mind, cfortran.h defines 100's of preprocessor directives. There is always the potential that these will clash with other tags in the users code, so final_applications.h, which don't require cfortran.h, also provide the solution. In the same vein, routines with more than 14 arguments can not be interfaced by cfortran.h with compilers which limit C macros to 31 arguments. To resolve this difficulty, final_application.h's can be created on a compiler without this limitation. Therefore, new machinery is required to do: application.h + cfortran.h => final_application.h The following example may help clarify the means and ends: If the following definition of the HBOOK1 routine, the /*commented_out_part*/, is passed through the preprocessor [perhaps #undefing and #defining preprocessor constants if creating an application.h for compiler other than that of the preprocessor being used, e.g. cpp -Umips -DCRAY ... ] : #include "cfortran.h" PROTOCCALLSFSUB6(HBOOK1,hbook1,INT,STRING,INT,FLOAT,FLOAT,FLOAT) /*#define HBOOK1(ID,CHTITLE,NX,XMI,XMA,VMX) \*/ CCALLSFSUB6(HBOOK1,hbook1,INT,STRING,INT,FLOAT,FLOAT,FLOAT, \ ID,CHTITLE,NX,XMI,XMA,VMX) A function prototype is produced by the PROTOCCALLSFSUB6(...). Interface code is produced, based on the 'variables', ID,CHTITLE,NX,XMI,XMA,VMX, which will correctly massage a HBOOK1 call. Therefore, adding the #define line: 'prototype code' #define HBOOK1(ID,CHTITLE,NX,XMI,XMA,VMX) \ 'interface code'(ID,CHTITLE,NX,XMI,XMA,VMX) which is placed into final_application.h. The only known limitation of the above method does not allow the 'variable' names to include B1,B2,...,B9,BA,BB,... Obviously the machinery to automatically generate final_applications.h from cfortran.h and applications.h needs more than just some preprocessor directives, but a fairly simple unix shell script should be sufficient. Any takers? V Machine Dependencies of cfortran.h ------------------------------------ Porting cfortran.h applications, e.g. the hbook.h and cstring.c mentioned above, to other machines is trivial since they are machine independent. Porting cfortran.h requires a solid knowledge of the new machines C preprocessor, and its FORTRAN argument passing mechanisms. Logically cfortran.h exists as two halves, a "C CALLS FORTRAN" and a "FORTRAN CALLS C" utility. In some cases it may be perfectly reasonable to port only 'one half' of cfortran.h onto a new system. The lucky programmer porting cfortran.h to a new machine, must discover the FORTRAN argument passing mechanisms. A safe starting point is to assume that variables and arrays are simply passed by reference, but nothing is guaranteed. Strings, and n-dimensional arrays of strings are a different story. It is doubtful that any systems do it quite like VAX VMS does it, so that a UNIX or f2c versions may provide an easier starting point. cfortran.h uses and abuses the preprocessor's ## operator. Although the ## operator does not exist in many compilers, many kludges do. cfortran.h uses /**/ with no space allowed between the slashes, '/', and the macros or tags to be concatenated. e.g. #define concat(a,b) a/**/b /* works*/ main() { concat(pri,ntf)("hello"); /* e.g. */ } N.B. On some compilers without ##, /**/ may also not work. The author may be able to offer alternate kludges. VI Bugs in vendors C compilers and other curiosities ---------------------------------------------------- 1. ULTRIX xxxxxx 4.3 1 RISC Condolences to long suffering ultrix users! DEC supplies a working C front end for alpha/OSF, but not for ultrix. From K&R ANSI C p. 231: ultrix> cat cat.c #define cat(x, y) x ## y #define xcat(x,y) cat(x,y) cat(cat(1,2),3) xcat(xcat(1,2),3) ultrix> cc -E cat.c 123 <---- Should be: cat(1,2)3 123 <---- Correct. ultrix> The problem for cfortran.h, preventing use of -std and -std1: ultrix> cat c.c #define cat(x, y) x ## y #define xcat(x,y) cat(x,y) #define AB(X) X+X #define C(E,F,G) cat(E,F)(G) #define X(E,F,G) xcat(E,F)(G) C(A,B,2) X(A,B,2) ultrix> cc -std1 -E c.c 2+2 AB (2) <---- ????????????? ultrix> ultrix> cc -std0 -E c.c 2+2 AB(2) <---- ????????????? ultrix> Due to further ultrix preprocessor problems, for all definitions of definitions with arguments, cfortran.h >= 3.0 includes the arguments and recommends the same, even though it is not required by ANSI C. e.g. Users are advised to do #define fcallsc(UN,LN) orig_fcallsc(UN,LN) instead of #define fcallsc orig_fcallsc since ultrix fails to properly preprocess the latter example. CRAY used to (still does?) occasionally trip up on this problem. 2. ConvexOS convex C210 11.0 convex In a program with a C main, output to LUN=6=* from Fortran goes into $pwd/fort.6 instead of stdout. Presumably, a magic incantation can be called from the C main in order to properly initialize the Fortran I/O. 3. SunOS 5.3 Generic_101318-69 sun4m sparc The default data and code alignments produced by cc, gcc and f77 are compatible. If deviating from the defaults, consistent alignment options must be used across all objects compiled by cc and f77. [Does gcc provide such options?] 4. SunOS 5.3 Generic_101318-69 sun4m sparc with cc: SC3.0.1 13 Jul 1994 or equivalently ULTRIX 4.4 0 RISC using cc -oldc are K&R C preprocessors that suffer from infinite loop macros, e.g. zedy03> cat src.c #include "cfortran.h" PROTOCCALLSFFUN1(INT,FREV,frev, INTV) #define FREV(A1) CCALLSFFUN1( FREV,frev, INTV, A1) /* To avoid the problem, deletete these ---^^^^--- spaces. */ main() { static int a[] = {1,2}; FREV(a); return EXIT_SUCCESS; } zedy03> cc -c -Xs -v -DMAX_PREPRO_ARGS=31 -D__CF__KnR src.c "src.c", line 4: FREV: actuals too long "src.c", line 4: FREV: actuals too long .... 3427 more lines of the same message "src.c", line 4: FREV: actuals too long cc : Fatal error in /usr/ccs/lib/cpp Segmentation fault (core dumped) 5. Older sun C compilers To link to f77 objects, older sun C compilers require the math.h macros: #define RETURNFLOAT(x) { union {double _d; float _f; } _kluge; \ _kluge._f = (x); return _kluge._d; } #define ASSIGNFLOAT(x,y) { union {double _d; float _f; } _kluge; \ _kluge._d = (y); x = _kluge._f; } Unfortunately, in at least some copies of the sun math.h, the semi-colon for 'float _f;' is left out, leading to compiler warnings. The solution is to correct math.h, or to change cfortran.h to #define RETURNFLOAT(x) and ASSIGNFLOAT(x,y) instead of including math.h. 6. gcc version 2.6.3 and probably all other versions as well Unlike all other C compilers supported by cfortran.h, 'gcc -traditional' promotes to double all functions returning float as demonstrated bu the following example. /* m.c */ #include int main() { FLOAT_FUNCTION d(); float f; f = d(); printf("%f\n",f); return 0; } /* d.c */ float d() { return -123.124; } burow[29] gcc -c -traditional d.c burow[30] gcc -DFLOAT_FUNCTION=float m.c d.o && a.out 0.000000 burow[31] gcc -DFLOAT_FUNCTION=double m.c d.o && a.out -123.124001 burow[32] Thus, 'gcc -traditional' is not supported by cfortran.h. Support would require the same RETURNFLOAT, etc. macro machinery present in old sun math.h, before sun gave up the same promotion. 7. CRAY At least some versions of the t3e and t3d C preprocessor are broken in the fashion described below. At least some versions of the t90 C preprocessor do not have this problem. On the CRAY, all Fortran names are converted to uppercase. Generally the uppercase name is also used for the macro interface created by cfortran.h. For example, in the following interface, EASY is both the name of the macro in the original C code and EASY is the name of the resulting function to be called. #define EASY(A,B) CCALLSFSUB2(EASY,easy, PINT, INTV, A, B) The fact that a macro called EASY() expands to a function called EASY() is not a problem for a working C preprocessor. From Kernighan and Ritchie, 2nd edition, p.230: In both kinds of macro, the replacement token sequence is repeatedly rescanned for more identifiers. However, once a given identifier has been replaced in a given expansion, it is not replaced if it turns up again during rescanning; instead it is left unchanged. Unfortunately, some CRAY preprocessors are broken and don't obey the above rule. A work-around is for the user to NOT use the uppercase name of the name of the macro interface provided by cfortran.h. For example: #define Easy(A,B) CCALLSFSUB2(EASY,easy, PINT, INTV, A, B) Luckily, the above work-around is not required since the following work-around within cfortran.h also circumvents the bug: /* (UN), not UN, is required in order to get around CRAY preprocessor bug.*/ #define CFC_(UN,LN) (UN) /* Uppercase FORTRAN symbols. */ Aside: The Visual C++ compiler is happy with UN, but barfs on (UN), so either (UN) causes nonstandard C/C++ or Visual C++ is broken. VII History and Acknowledgements -------------------------------- 1.0 - Supports VAX VMS using C 3.1 and FORTRAN 5.4. Oct. '90. 1.0 - Supports Silicon Graphics w. Mips Computer 2.0 f77 and cc. Feb. '91. [Port of C calls FORTRAN half only.] 1.1 - Supports Mips Computer System 2.0 f77 and cc. Mar. '91. [Runs on at least: Silicon Graphics IRIX 3.3.1 DECstations with Ultrix V4.1] 1.2 - Internals made simpler, smaller, faster, stronger. May '91. - Mips version works on IBM RS/6000, this is now called the unix version. 1.3 - UNIX and VAX VMS versions are merged into a single cfortran.h. July '91. - C can help manipulate (arrays of) strings in FORTRAN common blocks. - Dimensions of string arrays arguments can be explicit. - Supports Apollo DomainOS 10.2 (sys5.3) with f77 10.7 and cc 6.7. 2.0 - Improved code generation machinery creates K&R or ANSI C. Aug. '91. - Supports Sun, CRAY. f2c with vcc on VAX Ultrix. - cfortran.h macros now require routine and COMMON block names in both upper and lower case. No changes required to applications though. - PROTOCCALLSFSUBn is eliminated, with no loss to cfortran.h performance. - Improved tools and guidelines for naming C routines called by FORTRAN. 2.1 - LOGICAL correctly supported across all machines. Oct. '91. - Improved support for DOUBLE PRECISION on the CRAY. - HP9000 fully supported. - VAX Ultrix cc or gcc with f77 now supported. 2.2 - SHORT, i.e. INTEGER*2, and BYTE now supported. Dec. '91. - LOGICAL_STRICT introduced. More compact and robust internal tables. - typeV and typeVV for type = BYTE, DOUBLE, FLOAT, INT, LOGICAL, LONG,SHORT. - FORTRAN passing strings and NULL pointer to C routines improved. 2.3 - Extraneous arguments removed from many internal tables. May '92. - Introduce pseudo argument type SIMPLE for user defined types. - LynxOS using f2c supported. (Tested with LynxOS 2.0 386/AT.) 2.4 - Separation of internal C and Fortran compilation directives. Oct. '92. - f2c and NAG f90 supported on all machines. 2.5 - Minor mod.s to source and/or doc for HP9000, f2c, and NAG f90. Nov. '92. 2.6 - Support external procedures as arguments with type ROUTINE. Dec. '92. 2.7 - Support Alpha VMS. Support HP9000 f77 +ppu Jan. '93. - Support arrays with up to 7 dimensions. - Minor mod. of Fortran NULL to C via (P)STRING. - Specify the type of ROUTINE passed from Fortran to C [ANSI C requirement.] - Macros never receive a null parameter [RS/6000 requirement.] 2.8 - PSTRING for Fortran calls C no longer provides escape to pass April'93. NULL pointer nor to pass address of original string. PNSTRING introduced with old PSTRING's behavior. PPSTRING introduced to always pass original address of string. - Support Alpha/OSF. - Document that common blocks used in C should be declared AND defined. 3.0 - Automagic handling of ANSI ## versus K&R /**/ preprocessor op. March'95. - Less chance of name space collisions between cfortran.h and other codes. - SIMPLE macros, supporting user defined types, have changed names. 3.1 - Internal macro name _INT not used. Conflicted with IRIX 5.3. May '95. - SunOS, all versions, should work out of the box. - ZTRINGV_ARGS|F(k) may no longer point to a PDOUBLE or PFLOAT argument. - ConvexOS 11.0 supported. 3.2 - __hpux no longer needs to be restricted to MAX_PREPRO_ARGS=31. Oct. '95. - PSTRING bug fixed. - ZTRINGV_ARGS|F(k) may not point to a PBYTE,PINT,PLONG or PSHORT argument. - (P)ZTRINGV machinery improved. Should lead to fewer compiler warnings. (P)ZTRINGV no longer limits recursion or the nesting of routines. - SIMPLE macros, supporting user defined types, have changed slightly. 3.3 - Supports PowerStation Fortran with Visual C++. Nov. '95. - g77 should work using f2cFortran, though no changes made for it. - (PROTO)CCALLSFFUN10 extended to (PROTO)CCALLSFFUN14. - FCALLSCFUN10 and SUB10 extended to FCALLSCFUN14 and SUB14. 3.4 - C++ supported, Dec. '95. but it required the reintroduction of PROTOCCALLSFSUBn for users. - HP-UX f77 +800 supported. 3.5 - Absoft UNIX Fortran supported. Sept.'96. 3.6 - Minor corrections to cfortran.doc. Oct. '96. - Fixed bug for 15th argument. [Thanks to Tom Epperly at Aspen Tech.] - For AbsoftUNIXFortran, obey default of prepending _C to COMMON BLOCK name. - Fortran calling C with ROUTINE argument fixed and cleaned up. 3.7 - Circumvent IBM and HP "null argument" preprocessor warning. Oct. '96 3.8 - (P)STRINGV and (P)ZTRINGV can pass a 1- or 2-dim. char array. Feb. '97 (P)ZTRINGV thus effectively also provides (P)ZTRING. - (P)ZTRINGV accepts a (char *) pointer. 3.9 - Bug fixed for *VVVVV. May '97 - f2c: Work-around for strange underscore-dependent naming feature. - NEC SX-4 supported. - CRAY: LOGICAL conversion uses _btol and _ltob from CRAY's fortran.h. - CRAY: Avoid bug of some versions of the C preprocessor. - CRAY T3E: FORTRAN_REAL introduced. 4.0 - new/delete now used for C++. malloc/free still used for C. Jan. '98 - FALSE no longer is defined by cfortran.h . - Absoft Pro Fortran for MacOS supported. 4.1 - COMMA and COLON no longer are defined by cfortran.h . April'98 - Bug fixed when 10th arg. or beyond is a string. [Rob Lucchesi of NASA-Goddard pointed out this bug.] - CCALLSFSUB/FUN extended from 14 to 27 arguments. - Workaround SunOS CC 4.2 cast bug. [Thanks to Savrak SAR of CERN.] 4.2 - Portland Group needs -DpgiFortran . [Thank George Lai of NASA.] June '98 4.3 - (PROTO)CCALLSFSUB extended from 20 to 27 arguments. July '98 ['Support' implies these and more recent releases of the respective OS/compilers/linkers can be used with cfortran.h. Earlier releases may also work.] Acknowledgements: - CERN very generously sponsored a week in 1994 for me to work on cfortran.h. - M.L.Luvisetto (Istituto Nazionale Fisica Nucleare - Centro Nazionale Analisi Fotogrammi, Bologna, Italy) provided all the support for the port to the CRAY. Marisa's encouragement and enthusiasm was also much appreciated. - J.Bunn (CERN) supported the port to PowerStation Fortran with Visual C++. - Paul Schenk (UC Riverside, CERN PPE/OPAL) in June 1993 extended cfortran.h 2.7 to have C++ call Fortran. This was the starting point for full C++ in 3.4. - Glenn P.Davis of University Corp. for Atmospheric Research (UCAR) / Unidata supported the NEC SX-4 port and helped understand the CRAY. - Tony Goelz of Absoft Corporation ported cfortran.h to Absoft. - Though cfortran.h has been created in my 'copious' free time, I thank NSERC for their generous support of my grad. student and postdoc years. - Univ.Toronto, DESY, CERN and others have provided time on their computers. THIS PACKAGE, I.E. CFORTRAN.H, THIS DOCUMENT, AND THE CFORTRAN.H EXAMPLE PROGRAMS ARE PROPERTY OF THE AUTHOR WHO RESERVES ALL RIGHTS. THIS PACKAGE AND THE CODE IT PRODUCES MAY BE FREELY DISTRIBUTED WITHOUT FEES, SUBJECT TO THE FOLLOWING RESTRICTIONS: - YOU MUST ACCOMPANY ANY COPIES OR DISTRIBUTION WITH THIS (UNALTERED) NOTICE. - YOU MAY NOT RECEIVE MONEY FOR THE DISTRIBUTION OR FOR ITS MEDIA (E.G. TAPE, DISK, COMPUTER, PAPER.) - YOU MAY NOT PREVENT OTHERS FROM COPYING IT FREELY. - YOU MAY NOT DISTRIBUTE MODIFIED VERSIONS WITHOUT CLEARLY DOCUMENTING YOUR CHANGES AND NOTIFYING THE AUTHOR. - YOU MAY NOT MISREPRESENTED THE ORIGIN OF THIS SOFTWARE, EITHER BY EXPLICIT CLAIM OR BY OMISSION. THE INTENT OF THE ABOVE TERMS IS TO ENSURE THAT THE CFORTRAN.H PACKAGE NOT BE USED FOR PROFIT MAKING ACTIVITIES UNLESS SOME ROYALTY ARRANGEMENT IS ENTERED INTO WITH ITS AUTHOR. THIS SOFTWARE IS PROVIDED "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE SOFTWARE IS WITH YOU. SHOULD THE SOFTWARE PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. THE AUTHOR IS NOT RESPONSIBLE FOR ANY SUPPORT OR SERVICE OF THE CFORTRAN.H PACKAGE. Burkhard Burow burow@desy.de P.S. Your comments and questions are welcomed and usually promptly answered. VAX VMS and Ultrix, Alpha, OSF, Silicon Graphics (SGI), DECstation, Mips RISC, Sun, CRAY, Convex, IBM RS/6000, Apollo DomainOS, HP, LynxOS, f2c, NAG, Absoft, NEC SX-4, PowerStation and Visual C++ are registered trademarks of their respective owners. ============================================================================ ADDITIONAL LICENSING INFORMATION (added by W D Pence on 4 October 2007) The author of cfortran has subsequently stated that cfortran.h may optionally be used and distributed under the GNU Library General Public License (LGPL). This statement was made in an email to Kevin McCarty, which is reproduced below: ---------------------------------------- Date: Tue, 22 Oct 2002 12:48:00 -0400 From: Burkhard D Steinmacher-burow To: Kevin B. McCarty Subject: Re: CFortran licensing question Kevin, [Just noticed that I didn't send this yesterady.] I have no time right now to read through licenses. IIRC, library GPL is fairly unrestrictive, so I'll choose that. So..... You may consider this e-mail as a notice that as an alternative to any other cfortran licenses, I hereby relase all versions and all parts of cfortran under the the Library GPL license. From among these licenses, the user is free to choose the license or licenses under which cfortran is used. Contact me if you'd like to be able to choose another license. Burkhard steinmac@us.ibm.com, (914)945-3756, Fax 3684, Tieline 862 ------------------------------------------ /* end: cfortran.doc */ cfitsio-3.47/docs/fitsio.doc0000644000225700000360000117537513464573431015346 0ustar cagordonlhea FITSIO - An Interface to FITS Format Files for Fortran Programmers William D Pence, HEASARC, NASA/GSFC Version 3.0 [Note: This file contains various formatting command symbols in the first column which are used when generating the LATeX version of this document.] *I. Introduction This document describes the Fortran-callable subroutine interface that is provided as part of the CFITSIO library (which is written in ANSI C). This is a companion document to the CFITSIO User's Guide which should be consulted for further information about the underlying CFITSIO library. In the remainder of this document, the terms FITSIO and CFITSIO are interchangeable and refer to the same library. FITSIO/CFITSIO is a machine-independent library of routines for reading and writing data files in the FITS (Flexible Image Transport System) data format. It can also read IRAF format image files and raw binary data arrays by converting them on the fly into a virtual FITS format file. This library was written to provide a powerful yet simple interface for accessing FITS files which will run on most commonly used computers and workstations. FITSIO supports all the features described in the official definition of the FITS format and can read and write all the currently defined types of extensions, including ASCII tables (TABLE), Binary tables (BINTABLE) and IMAGE extensions. The FITSIO subroutines insulate the programmer from having to deal with the complicated formatting details in the FITS file, however, it is assumed that users have a general knowledge about the structure and usage of FITS files. The CFITSIO package was initially developed by the HEASARC (High Energy Astrophysics Science Archive Research Center) at the NASA Goddard Space Flight Center to convert various existing and newly acquired astronomical data sets into FITS format and to further analyze data already in FITS format. New features continue to be added to CFITSIO in large part due to contributions of ideas or actual code from users of the package. The Integral Science Data Center in Switzerland, and the XMM/ESTEC project in The Netherlands made especially significant contributions that resulted in many of the new features that appeared in v2.0 of CFITSIO. The latest version of the CFITSIO source code, documentation, and example programs are available on the World-Wide Web or via anonymous ftp from: - http://heasarc.gsfc.nasa.gov/fitsio ftp://legacy.gsfc.nasa.gov/software/fitsio/c - \newpage Any questions, bug reports, or suggested enhancements related to the CFITSIO package should be sent to the FTOOLS Help Desk at the HEASARC: - http://heasarc.gsfc.nasa.gov/cgi-bin/ftoolshelp - This User's Guide assumes that readers already have a general understanding of the definition and structure of FITS format files. Further information about FITS formats is available from the FITS Support Office at {\tt http://fits.gsfc.nasa.gov}. In particular, the 'FITS Standard' gives the authoritative definition of the FITS data format. Other documents available at that Web site provide additional historical background and practical advice on using FITS files. The HEASARC also provides a very sophisticated FITS file analysis program called `Fv' which can be used to display and edit the contents of any FITS file as well as construct new FITS files from scratch. Fv is freely available for most Unix platforms, Mac PCs, and Windows PCs. CFITSIO users may also be interested in the FTOOLS package of programs that can be used to manipulate and analyze FITS format files. Fv and FTOOLS are available from their respective Web sites at: - http://fv.gsfc.nasa.gov http://heasarc.gsfc.nasa.gov/ftools - *II. Creating FITSIO/CFITSIO **A. Building the Library To use the FITSIO subroutines one must first build the CFITSIO library, which requires a C compiler. gcc is ideal, or most other ANSI-C compilers will also work. The CFITSIO code is contained in about 40 C source files (*.c) and header files (*.h). On VAX/VMS systems 2 assembly-code files (vmsieeed.mar and vmsieeer.mar) are also needed. The Fortran interface subroutines to the C CFITSIO routines are located in the f77\_wrap1.c, through f77\_wrap4.c files. These are relatively simple 'wrappers' that translate the arguments in the Fortran subroutine into the appropriate format for the corresponding C routine. This translation is performed transparently to the user by a set of C macros located in the cfortran.h file. Unfortunately cfortran.h does not support every combination of C and Fortran compilers so the Fortran interface is not supported on all platforms. (see further notes below). A standard combination of C and Fortran compilers will be assumed by default, but one may also specify a particular Fortran compiler by doing: - > setenv CFLAGS -DcompilerName=1 - (where 'compilerName' is the name of the compiler) before running the configure command. The currently recognized compiler names are: - g77Fortran IBMR2Fortran CLIPPERFortran pgiFortran NAGf90Fortran f2cFortran hpuxFortran apolloFortran sunFortran CRAYFortran mipsFortran DECFortran vmsFortran CONVEXFortran PowerStationFortran AbsoftUNIXFortran AbsoftProFortran SXFortran - Alternatively, one may edit the CFLAGS line in the Makefile to add the '-DcompilerName' flag after running the './configure' command. The CFITSIO library is built on Unix systems by typing: - > ./configure [--prefix=/target/installation/path] [--enable-sse2] [--enable-ssse3] > make (or 'make shared') > make install (this step is optional) - at the operating system prompt. The configure command customizes the Makefile for the particular system, then the `make' command compiles the source files and builds the library. Type `./configure' and not simply `configure' to ensure that the configure script in the current directory is run and not some other system-wide configure script. The optional 'prefix' argument to configure gives the path to the directory where the CFITSIO library and include files should be installed via the later 'make install' command. For example, - > ./configure --prefix=/usr1/local - will cause the 'make install' command to copy the CFITSIO libcfitsio file to /usr1/local/lib and the necessary include files to /usr1/local/include (assuming of course that the process has permission to write to these directories). The optional --enable-sse2 and --enable-ssse3 flags will cause configure to attempt to build CFITSIO using faster byte-swapping algorithms. See the "Optimizing Programs" section of this manual for more information about these options. By default, the Makefile will be configured to build the set of Fortran-callable wrapper routines whose calling sequences are described later in this document. The 'make shared' option builds a shared or dynamic version of the CFITSIO library. When using the shared library the executable code is not copied into your program at link time and instead the program locates the necessary library code at run time, normally through LD\_LIBRARY\_PATH or some other method. The advantages of using a shared library are: - 1. Less disk space if you build more than 1 program 2. Less memory if more than one copy of a program using the shared library is running at the same time since the system is smart enough to share copies of the shared library at run time. 3. Possibly easier maintenance since a new version of the shared library can be installed without relinking all the software that uses it (as long as the subroutine names and calling sequences remain unchanged). 4. No run-time penalty. - The disadvantages are: - 1. More hassle at runtime. You have to either build the programs specially or have LD_LIBRARY_PATH set right. 2. There may be a slight start up penalty, depending on where you are reading the shared library and the program from and if your CPU is either really slow or really heavily loaded. - On HP/UX systems, the environment variable CFLAGS should be set to -Ae before running configure to enable "extended ANSI" features. It may not be possible to statically link programs that use CFITSIO on some platforms (namely, on Solaris 2.6) due to the network drivers (which provide FTP and HTTP access to FITS files). It is possible to make both a dynamic and a static version of the CFITSIO library, but network file access will not be possible using the static version. On VAX/VMS and ALPHA/VMS systems the make\_gfloat.com command file may be executed to build the cfitsio.olb object library using the default G-floating point option for double variables. The make\_dfloat.com and make\_ieee.com files may be used instead to build the library with the other floating point options. Note that the getcwd function that is used in the group.c module may require that programs using CFITSIO be linked with the ALPHA\$LIBRARY:VAXCRTL.OLB library. See the example link line in the next section of this document. On Windows IBM-PC type platforms the situation is more complicated because of the wide variety of Fortran compilers that are available and because of the inherent complexities of calling the CFITSIO C routines from Fortran. Two different versions of the CFITSIO dll library are available, compiled with the Borland C++ compiler and the Microsoft Visual C++ compiler, respectively, in the files cfitsiodll\_2xxx\_borland.zip and cfitsiodll\_3xxx\_vcc.zip, where '3xxx' represents the current release number. Both these dll libraries contain a set of Fortran wrapper routines which may be compatible with some, but probably not all, available Fortran compilers. To test if they are compatible, compile the program testf77.f and try linking to these dll libraries. If these libraries do not work with a particular Fortran compiler, then it may be necessary to modify the file "cfortran.h" to support that particular combination of C and Fortran compilers, and then rebuild the CFITSIO dll library. This will require, however, some expertise in mixed language programming. CFITSIO should be compatible with most current ANCI C and C++ compilers: Cray supercomputers are currently not supported. **B. Testing the Library The CFITSIO library should be tested by building and running the testprog.c program that is included with the release. On Unix systems type: - % make testprog % testprog > testprog.lis % diff testprog.lis testprog.out % cmp testprog.fit testprog.std - On VMS systems, (assuming cc is the name of the C compiler command), type: - $ cc testprog.c $ link testprog, cfitsio/lib, alpha$library:vaxcrtl/lib $ run testprog - The testprog program should produce a FITS file called `testprog.fit' that is identical to the `testprog.std' FITS file included with this release. The diagnostic messages (which were piped to the file testprog.lis in the Unix example) should be identical to the listing contained in the file testprog.out. The 'diff' and 'cmp' commands shown above should not report any differences in the files. (There may be some minor formatting differences, such as the presence or absence of leading zeros, or 3 digit exponents in numbers, which can be ignored). The Fortran wrappers in CFITSIO may be tested with the testf77 program. On Unix systems the fortran compilation and link command may be called 'f77' or 'g77', depending on the system. - % f77 -o testf77 testf77.f -L. -lcfitsio -lnsl -lsocket or % f77 -f -o testf77 testf77.f -L. -lcfitsio (under SUN O/S) or % f77 -o testf77 testf77.f -Wl,-L. -lcfitsio -lm -lnsl -lsocket (HP/UX) or % g77 -o testf77 -s testf77.f -lcfitsio -lcc_dynamic -lncurses (Mac OS-X) % testf77 > testf77.lis % diff testf77.lis testf77.out % cmp testf77.fit testf77.std - On machines running SUN O/S, Fortran programs must be compiled with the '-f' option to force double precision variables to be aligned on 8-byte boundaries to make the fortran-declared variables compatible with C. A similar compiler option may be required on other platforms. Failing to use this option may cause the program to crash on FITSIO routines that read or write double precision variables. On Windows platforms, linking Fortran programs with a C library often depends on the particular compilers involved. Some users have found the following commands work when using the Intel Fortran compiler: - ifort /libs.dll cfitsio.lib /MD testf77.f /Gm or possibly, ifort /libs:dll cfitsio.lib /MD /fpp /extfpp:cfortran.h,fitsio.h /iface:cvf testf77.f - Also note that on some systems the output listing of the testf77 program may differ slightly from the testf77.std template if leading zeros are not printed by default before the decimal point when using F format. A few other utility programs are included with CFITSIO: - speed - measures the maximum throughput (in MB per second) for writing and reading FITS files with CFITSIO listhead - lists all the header keywords in any FITS file fitscopy - copies any FITS file (especially useful in conjunction with the CFITSIO's extended input filename syntax) cookbook - a sample program that performs common read and write operations on a FITS file. iter_a, iter_b, iter_c - examples of the CFITSIO iterator routine - The first 4 of these utility programs can be compiled and linked by typing - % make program_name - **C. Linking Programs with FITSIO When linking applications software with the FITSIO library, several system libraries usually need to be specified on the link command line. On Unix systems, the most reliable way to determine what libraries are required is to type 'make testprog' and see what libraries the configure script has added. The typical libraries that may need to be added are -lm (the math library) and -lnsl and -lsocket (needed only for FTP and HTTP file access). These latter 2 libraries are not needed on VMS and Windows platforms, because FTP file access is not currently supported on those platforms. Note that when upgrading to a newer version of CFITSIO it is usually necessary to recompile, as well as relink, the programs that use CFITSIO, because the definitions in fitsio.h often change. **D. Getting Started with FITSIO In order to effectively use the FITSIO library as quickly as possible, it is recommended that new users follow these steps: 1. Read the following `FITS Primer' chapter for a brief overview of the structure of FITS files. This is especially important for users who have not previously dealt with the FITS table and image extensions. 2. Write a simple program to read or write a FITS file using the Basic Interface routines. 3. Refer to the cookbook.f program that is included with this release for examples of routines that perform various common FITS file operations. 4. Read Chapters 4 and 5 to become familiar with the conventions and advanced features of the FITSIO interface. 5. Scan through the more extensive set of routines that are provided in the `Advanced Interface'. These routines perform more specialized functions than are provided by the Basic Interface routines. **E. Example Program The following listing shows an example of how to use the FITSIO routines in a Fortran program. Refer to the cookbook.f program that is included with the FITSIO distribution for examples of other FITS programs. - program writeimage C Create a FITS primary array containing a 2-D image integer status,unit,blocksize,bitpix,naxis,naxes(2) integer i,j,group,fpixel,nelements,array(300,200) character filename*80 logical simple,extend status=0 C Name of the FITS file to be created: filename='ATESTFILE.FITS' C Get an unused Logical Unit Number to use to create the FITS file call ftgiou(unit,status) C create the new empty FITS file blocksize=1 call ftinit(unit,filename,blocksize,status) C initialize parameters about the FITS image (300 x 200 16-bit integers) simple=.true. bitpix=16 naxis=2 naxes(1)=300 naxes(2)=200 extend=.true. C write the required header keywords call ftphpr(unit,simple,bitpix,naxis,naxes,0,1,extend,status) C initialize the values in the image with a linear ramp function do j=1,naxes(2) do i=1,naxes(1) array(i,j)=i+j end do end do C write the array to the FITS file group=1 fpixel=1 nelements=naxes(1)*naxes(2) call ftpprj(unit,group,fpixel,nelements,array,status) C write another optional keyword to the header call ftpkyj(unit,'EXPOSURE',1500,'Total Exposure Time',status) C close the file and free the unit number call ftclos(unit, status) call ftfiou(unit, status) end - **F. Legal Stuff Copyright (Unpublished--all rights reserved under the copyright laws of the United States), U.S. Government as represented by the Administrator of the National Aeronautics and Space Administration. No copyright is claimed in the United States under Title 17, U.S. Code. Permission to freely use, copy, modify, and distribute this software and its documentation without fee is hereby granted, provided that this copyright notice and disclaimer of warranty appears in all copies. DISCLAIMER: THE SOFTWARE IS PROVIDED 'AS IS' WITHOUT ANY WARRANTY OF ANY KIND, EITHER EXPRESSED, IMPLIED, OR STATUTORY, INCLUDING, BUT NOT LIMITED TO, ANY WARRANTY THAT THE SOFTWARE WILL CONFORM TO SPECIFICATIONS, ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND FREEDOM FROM INFRINGEMENT, AND ANY WARRANTY THAT THE DOCUMENTATION WILL CONFORM TO THE SOFTWARE, OR ANY WARRANTY THAT THE SOFTWARE WILL BE ERROR FREE. IN NO EVENT SHALL NASA BE LIABLE FOR ANY DAMAGES, INCLUDING, BUT NOT LIMITED TO, DIRECT, INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES, ARISING OUT OF, RESULTING FROM, OR IN ANY WAY CONNECTED WITH THIS SOFTWARE, WHETHER OR NOT BASED UPON WARRANTY, CONTRACT, TORT , OR OTHERWISE, WHETHER OR NOT INJURY WAS SUSTAINED BY PERSONS OR PROPERTY OR OTHERWISE, AND WHETHER OR NOT LOSS WAS SUSTAINED FROM, OR AROSE OUT OF THE RESULTS OF, OR USE OF, THE SOFTWARE OR SERVICES PROVIDED HEREUNDER." **G. Acknowledgments The development of many of the powerful features in CFITSIO was made possible through collaborations with many people or organizations from around the world. The following, in particular, have made especially significant contributions: Programmers from the Integral Science Data Center, Switzerland (namely, Jurek Borkowski, Bruce O'Neel, and Don Jennings), designed the concept for the plug-in I/O drivers that was introduced with CFITSIO 2.0. The use of `drivers' greatly simplified the low-level I/O, which in turn made other new features in CFITSIO (e.g., support for compressed FITS files and support for IRAF format image files) much easier to implement. Jurek Borkowski wrote the Shared Memory driver, and Bruce O'Neel wrote the drivers for accessing FITS files over the network using the FTP, HTTP, and ROOT protocols. The ISDC also provided the template parsing routines (written by Jurek Borkowski) and the hierarchical grouping routines (written by Don Jennings). The ISDC DAL (Data Access Layer) routines are layered on top of CFITSIO and make extensive use of these features. Uwe Lammers (XMM/ESA/ESTEC, The Netherlands) designed the high-performance lexical parsing algorithm that is used to do on-the-fly filtering of FITS tables. This algorithm essentially pre-compiles the user-supplied selection expression into a form that can be rapidly evaluated for each row. Peter Wilson (RSTX, NASA/GSFC) then wrote the parsing routines used by CFITSIO based on Lammers' design, combined with other techniques such as the CFITSIO iterator routine to further enhance the data processing throughput. This effort also benefited from a much earlier lexical parsing routine that was developed by Kent Blackburn (NASA/GSFC). More recently, Craig Markwardt (NASA/GSFC) implemented additional functions (median, average, stddev) and other enhancements to the lexical parser. The CFITSIO iterator function is loosely based on similar ideas developed for the XMM Data Access Layer. Peter Wilson (RSTX, NASA/GSFC) wrote the complete set of Fortran-callable wrappers for all the CFITSIO routines, which in turn rely on the CFORTRAN macro developed by Burkhard Burow. The syntax used by CFITSIO for filtering or binning input FITS files is based on ideas developed for the AXAF Science Center Data Model by Jonathan McDowell, Antonella Fruscione, Aneta Siemiginowska and Bill Joye. See http://heasarc.gsfc.nasa.gov/docs/journal/axaf7.html for further description of the AXAF Data Model. The file decompression code were taken directly from the gzip (GNU zip) program developed by Jean-loup Gailly and others. Doug Mink, SAO, provided the routines for converting IRAF format images into FITS format. Martin Reinecke (Max Planck Institute, Garching)) provided the modifications to cfortran.h that are necessary to support 64-bit integer values when calling C routines from fortran programs. The cfortran.h macros were originally developed by Burkhard Burow (CERN). Julian Taylor (ESO, Garching) provided the fast byte-swapping algorithms that use the SSE2 and SSSE3 machine instructions available on x86\_64 CPUs. In addition, many other people have made valuable contributions to the development of CFITSIO. These include (with apologies to others that may have inadvertently been omitted): Steve Allen, Carl Akerlof, Keith Arnaud, Morten Krabbe Barfoed, Kent Blackburn, G Bodammer, Romke Bontekoe, Lucio Chiappetti, Keith Costorf, Robin Corbet, John Davis, Richard Fink, Ning Gan, Emily Greene, Joe Harrington, Cheng Ho, Phil Hodge, Jim Ingham, Yoshitaka Ishisaki, Diab Jerius, Mark Levine, Todd Karakaskian, Edward King, Scott Koch, Claire Larkin, Rob Managan, Eric Mandel, John Mattox, Carsten Meyer, Emi Miyata, Stefan Mochnacki, Mike Noble, Oliver Oberdorf, Clive Page, Arvind Parmar, Jeff Pedelty, Tim Pearson, Maren Purves, Scott Randall, Chris Rogers, Arnold Rots, Barry Schlesinger, Robin Stebbins, Andrew Szymkowiak, Allyn Tennant, Peter Teuben, James Theiler, Doug Tody, Shiro Ueno, Steve Walton, Archie Warnock, Alan Watson, Dan Whipple, Wim Wimmers, Peter Young, Jianjun Xu, and Nelson Zarate. *III. A FITS Primer This section gives a brief overview of the structure of FITS files. Users should refer to the documentation available from the FITS Support Office, as described in the introduction, for more detailed information on FITS formats. FITS was first developed in the late 1970's as a standard data interchange format between various astronomical observatories. Since then FITS has become the defacto standard data format supported by most astronomical data analysis software packages. A FITS file consists of one or more Header + Data Units (HDUs), where the first HDU is called the `Primary HDU', or `Primary Array'. The primary array contains an N-dimensional array of pixels, such as a 1-D spectrum, a 2-D image, or a 3-D data cube. Six different primary datatypes are supported: Unsigned 8-bit bytes, 16, 32, and 64-bit signed integers, and 32 and 64-bit floating point reals. FITS also has a convention for storing unsigned integers (see the later section entitled `Unsigned Integers' for more details). The primary HDU may also consist of only a header with a null array containing no data pixels. Any number of additional HDUs may follow the primary array; these additional HDUs are called FITS `extensions'. There are currently 3 types of extensions defined by the FITS standard: \begin{itemize} \item Image Extension - a N-dimensional array of pixels, like in a primary array \item ASCII Table Extension - rows and columns of data in ASCII character format \item Binary Table Extension - rows and columns of data in binary representation \end{itemize} In each case the HDU consists of an ASCII Header Unit followed by an optional Data Unit. For historical reasons, each Header or Data unit must be an exact multiple of 2880 8-bit bytes long. Any unused space is padded with fill characters (ASCII blanks or zeros). Each Header Unit consists of any number of 80-character keyword records or `card images' which have the general form: - KEYNAME = value / comment string NULLKEY = / comment: This keyword has no value - The keyword names may be up to 8 characters long and can only contain uppercase letters, the digits 0-9, the hyphen, and the underscore character. The keyword name is (usually) followed by an equals sign and a space character (= ) in columns 9 - 10 of the record, followed by the value of the keyword which may be either an integer, a floating point number, a character string (enclosed in single quotes), or a boolean value (the letter T or F). A keyword may also have a null or undefined value if there is no specified value string, as in the second example. The last keyword in the header is always the `END' keyword which has no value or comment fields. There are many rules governing the exact format of a keyword record (see the FITS Standard) so it is better to rely on standard interface software like FITSIO to correctly construct or to parse the keyword records rather than try to deal directly with the raw FITS formats. Each Header Unit begins with a series of required keywords which depend on the type of HDU. These required keywords specify the size and format of the following Data Unit. The header may contain other optional keywords to describe other aspects of the data, such as the units or scaling values. Other COMMENT or HISTORY keywords are also frequently added to further document the data file. The optional Data Unit immediately follows the last 2880-byte block in the Header Unit. Some HDUs do not have a Data Unit and only consist of the Header Unit. If there is more than one HDU in the FITS file, then the Header Unit of the next HDU immediately follows the last 2880-byte block of the previous Data Unit (or Header Unit if there is no Data Unit). The main required keywords in FITS primary arrays or image extensions are: \begin{itemize} \item BITPIX -- defines the datatype of the array: 8, 16, 32, 64, -32, -64 for unsigned 8--bit byte, 16--bit signed integer, 32--bit signed integer, 64--bit signed integer, 32--bit IEEE floating point, and 64--bit IEEE double precision floating point, respectively. \item NAXIS -- the number of dimensions in the array, usually 0, 1, 2, 3, or 4. \item NAXISn -- (n ranges from 1 to NAXIS) defines the size of each dimension. \end{itemize} FITS tables start with the keyword XTENSION = `TABLE' (for ASCII tables) or XTENSION = `BINTABLE' (for binary tables) and have the following main keywords: \begin{itemize} \item TFIELDS -- number of fields or columns in the table \item NAXIS2 -- number of rows in the table \item TTYPEn -- for each column (n ranges from 1 to TFIELDS) gives the name of the column \item TFORMn -- the datatype of the column \item TUNITn -- the physical units of the column (optional) \end{itemize} Users should refer to the FITS Support Office at {\tt http://fits.gsfc.nasa.gov} for further information about the FITS format and related software packages. *V. FITSIO Conventions and Guidelines **A. CFITSIO Size Limitations CFITSIO places few restrictions on the size of FITS files that it reads or writes. There are a few limits, however, which may affect some extreme cases: 1. The maximum number of FITS files that may be simultaneously opened by CFITSIO is set by NMAXFILES, as defined in fitsio2.h. The current default value is 1000, but this may be increased if necessary. Note that CFITSIO allocates NIOBUF * 2880 bytes of I/O buffer space for each file that is opened. The default value of NIOBUF is 40 (defined in fitsio.h), so this amounts to more than 115K of memory for each opened file (or 115 MB for 1000 opened files). Note that the underlying operating system, may have a lower limit on the number of files that can be opened simultaneously. 2. By default, CFITSIO can handle FITS files up to 2.1 GB in size (2**31 bytes). This file size limit is often imposed by 32-bit operating systems. More recently, as 64-bit operating systems become more common, an industry-wide standard (at least on Unix systems) has been developed to support larger sized files (see http://ftp.sas.com/standards/large.file/). Starting with version 2.1 of CFITSIO, larger FITS files up to 6 terabytes in size may be read and written on supported platforms. In order to support these larger files, CFITSIO must be compiled with the '-D\_LARGEFILE\_SOURCE' and `-D\_FILE\_OFFSET\_BITS=64' compiler flags. Some platforms may also require the `-D\_LARGE\_FILES' compiler flag. This causes the compiler to allocate 8-bytes instead of 4-bytes for the `off\_t' datatype which is used to store file offset positions. It appears that in most cases it is not necessary to also include these compiler flags when compiling programs that link to the CFITSIO library. If CFITSIO is compiled with the -D\_LARGEFILE\_SOURCE and -D\_FILE\_OFFSET\_BITS=64 flags on a platform that supports large files, then it can read and write FITS files that contain up to 2**31 2880-byte FITS records, or approximately 6 terabytes in size. It is still required that the value of the NAXISn and PCOUNT keywords in each extension be within the range of a signed 4-byte integer (max value = 2,147,483,648). Thus, each dimension of an image (given by the NAXISn keywords), the total width of a table (NAXIS1 keyword), the number of rows in a table (NAXIS2 keyword), and the total size of the variable-length array heap in binary tables (PCOUNT keyword) must be less than this limit. Currently, support for large files within CFITSIO has been tested on the Linux, Solaris, and IBM AIX operating systems. **B. Multiple Access to the Same FITS File CFITSIO supports simultaneous read and write access to multiple HDUs in the same FITS file. Thus, one can open the same FITS file twice within a single program and move to 2 different HDUs in the file, and then read and write data or keywords to the 2 extensions just as if one were accessing 2 completely separate FITS files. Since in general it is not possible to physically open the same file twice and then expect to be able to simultaneously (or in alternating succession) write to 2 different locations in the file, CFITSIO recognizes when the file to be opened (in the call to fits\_open\_file) has already been opened and instead of actually opening the file again, just logically links the new file to the old file. (This only applies if the file is opened more than once within the same program, and does not prevent the same file from being simultaneously opened by more than one program). Then before CFITSIO reads or writes to either (logical) file, it makes sure that any modifications made to the other file have been completely flushed from the internal buffers to the file. Thus, in principle, one could open a file twice, in one case pointing to the first extension and in the other pointing to the 2nd extension and then write data to both extensions, in any order, without danger of corrupting the file, There may be some efficiency penalties in doing this however, since CFITSIO has to flush all the internal buffers related to one file before switching to the other, so it would still be prudent to minimize the number of times one switches back and forth between doing I/O to different HDUs in the same file. **C. Current Header Data Unit (CHDU) In general, a FITS file can contain multiple Header Data Units, also called extensions. CFITSIO only operates within one HDU at any given time, and the currently selected HDU is called the Current Header Data Unit (CHDU). When a FITS file is first created or opened the CHDU is automatically defined to be the first HDU (i.e., the primary array). CFITSIO routines are provided to move to and open any other existing HDU within the FITS file or to append or insert a new HDU in the FITS file which then becomes the CHDU. **D. Subroutine Names All FITSIO subroutine names begin with the letters 'ft' to distinguish them from other subroutines and are 5 or 6 characters long. Users should not name their own subroutines beginning with 'ft' to avoid conflicts. (The SPP interface routines all begin with 'fs'). Subroutines which read or get information from the FITS file have names beginning with 'ftg...'. Subroutines which write or put information into the FITS file have names beginning with 'ftp...'. **E. Subroutine Families and Datatypes Many of the subroutines come in families which differ only in the datatype of the associated parameter(s) . The datatype of these subroutines is indicated by the last letter of the subroutine name (e.g., 'j' in 'ftpkyj') as follows: - x - bit b - character*1 (unsigned byte) i - short integer (I*2) j - integer (I*4, 32-bit integer) k - long long integer (I*8, 64-bit integer) e - real exponential floating point (R*4) f - real fixed-format floating point (R*4) d - double precision real floating-point (R*8) g - double precision fixed-format floating point (R*8) c - complex reals (pairs of R*4 values) m - double precision complex (pairs of R*8 values) l - logical (L*4) s - character string - When dealing with the FITS byte datatype, it is important to remember that the raw values (before any scaling by the BSCALE and BZERO, or TSCALn and TZEROn keyword values) in byte arrays (BITPIX = 8) or byte columns (TFORMn = 'B') are interpreted as unsigned bytes with values ranging from 0 to 255. Some Fortran compilers support a non-standard byte datatype such as INTEGER*1, LOGICAL*1, or BYTE, which can sometimes be used instead of CHARACTER*1 variables. Many machines permit passing a numeric datatype (such as INTEGER*1) to the FITSIO subroutines which are expecting a CHARACTER*1 datatype, but this technically violates the Fortran-77 standard and is not supported on all machines (e.g., on a VAX/VMS machine one must use the VAX-specific \%DESCR function). One feature of the CFITSIO routines is that they can operate on a `X' (bit) column in a binary table as though it were a `B' (byte) column. For example a `11X' datatype column can be interpreted the same as a `2B' column (i.e., 2 unsigned 8-bit bytes). In some instances, it can be more efficient to read and write whole bytes at a time, rather than reading or writing each individual bit. The double precision complex datatype is not a standard Fortran-77 datatype. If a particular Fortran compiler does not directly support this datatype, then one may instead pass an array of pairs of double precision values to these subroutines. The first value in each pair is the real part, and the second is the imaginary part. **F. Implicit Data Type Conversion The FITSIO routines that read and write numerical data can perform implicit data type conversion. This means that the data type of the variable or array in the program does not need to be the same as the data type of the value in the FITS file. Data type conversion is supported for numerical and string data types (if the string contains a valid number enclosed in quotes) when reading a FITS header keyword value and for numeric values when reading or writing values in the primary array or a table column. CFITSIO returns status = NUM\_OVERFLOW if the converted data value exceeds the range of the output data type. Implicit data type conversion is not supported within binary tables for string, logical, complex, or double complex data types. In addition, any table column may be read as if it contained string values. In the case of numeric columns the returned string will be formatted using the TDISPn display format if it exists. **G. Data Scaling When reading numerical data values in the primary array or a table column, the values will be scaled automatically by the BSCALE and BZERO (or TSCALn and TZEROn) header keyword values if they are present in the header. The scaled data that is returned to the reading program will have - output value = (FITS value) * BSCALE + BZERO - (a corresponding formula using TSCALn and TZEROn is used when reading from table columns). In the case of integer output values the floating point scaled value is truncated to an integer (not rounded to the nearest integer). The ftpscl and fttscl subroutines may be used to override the scaling parameters defined in the header (e.g., to turn off the scaling so that the program can read the raw unscaled values from the FITS file). When writing numerical data to the primary array or to a table column the data values will generally be automatically inversely scaled by the value of the BSCALE and BZERO (or TSCALn and TZEROn) header keyword values if they they exist in the header. These keywords must have been written to the header before any data is written for them to have any effect. Otherwise, one may use the ftpscl and fttscl subroutines to define or override the scaling keywords in the header (e.g., to turn off the scaling so that the program can write the raw unscaled values into the FITS file). If scaling is performed, the inverse scaled output value that is written into the FITS file will have - FITS value = ((input value) - BZERO) / BSCALE - (a corresponding formula using TSCALn and TZEROn is used when writing to table columns). Rounding to the nearest integer, rather than truncation, is performed when writing integer datatypes to the FITS file. **H. Error Status Values and the Error Message Stack The last parameter in nearly every FITSIO subroutine is the error status value which is both an input and an output parameter. A returned positive value for this parameter indicates an error was detected. A listing of all the FITSIO status code values is given at the end of this document. The FITSIO library uses an `inherited status' convention for the status parameter which means that if a subroutine is called with a positive input value of the status parameter, then the subroutine will exit immediately without changing the value of the status parameter. Thus, if one passes the status value returned from each FITSIO routine as input to the next FITSIO subroutine, then whenever an error is detected all further FITSIO processing will cease. This convention can simplify the error checking in application programs because it is not necessary to check the value of the status parameter after every single FITSIO subroutine call. If a program contains a sequence of several FITSIO calls, one can just check the status value after the last call. Since the returned status values are generally distinctive, it should be possible to determine which subroutine originally returned the error status. FITSIO also maintains an internal stack of error messages (80-character maximum length) which in many cases provide a more detailed explanation of the cause of the error than is provided by the error status number alone. It is recommended that the error message stack be printed out whenever a program detects a FITSIO error. To do this, call the FTGMSG routine repeatedly to get the successive messages on the stack. When the stack is empty FTGMSG will return a blank string. Note that this is a `First In -- First Out' stack, so the oldest error message is returned first by ftgmsg. **I. Variable-Length Array Facility in Binary Tables FITSIO provides easy-to-use support for reading and writing data in variable length fields of a binary table. The variable length columns have TFORMn keyword values of the form `1Pt(len)' or `1Qt(len)' where `t' is the datatype code (e.g., I, J, E, D, etc.) and `len' is an integer specifying the maximum length of the vector in the table. If the value of `len' is not specified when the table is created (e.g., if the TFORM keyword value is simply specified as '1PE' instead of '1PE(400) ), then FITSIO will automatically scan the table when it is closed to determine the maximum length of the vector and will append this value to the TFORMn value. The same routines which read and write data in an ordinary fixed length binary table extension are also used for variable length fields, however, the subroutine parameters take on a slightly different interpretation as described below. All the data in a variable length field is written into an area called the `heap' which follows the main fixed-length FITS binary table. The size of the heap, in bytes, is specified with the PCOUNT keyword in the FITS header. When creating a new binary table, the initial value of PCOUNT should usually be set to zero. FITSIO will recompute the size of the heap as the data is written and will automatically update the PCOUNT keyword value when the table is closed. When writing variable length data to a table, CFITSIO will automatically extend the size of the heap area if necessary, so that any following HDUs do not get overwritten. By default the heap data area starts immediately after the last row of the fixed-length table. This default starting location may be overridden by the THEAP keyword, but this is not recommended. If additional rows of data are added to the table, CFITSIO will automatically shift the the heap down to make room for the new rows, but it is obviously be more efficient to initially create the table with the necessary number of blank rows, so that the heap does not needed to be constantly moved. When writing to a variable length field, the entire array of values for a given row of the table must be written with a single call to FTPCLx. The total length of the array is calculated from (NELEM+FELEM-1). One cannot append more elements to an existing field at a later time; any attempt to do so will simply overwrite all the data which was previously written. Note also that the new data will be written to a new area of the heap and the heap space used by the previous write cannot be reclaimed. For this reason it is advised that each row of a variable length field only be written once. An exception to this general rule occurs when setting elements of an array as undefined. One must first write a dummy value into the array with FTPCLx, and then call FTPCLU to flag the desired elements as undefined. (Do not use the FTPCNx family of routines with variable length fields). Note that the rows of a table, whether fixed or variable length, do not have to be written consecutively and may be written in any order. When writing to a variable length ASCII character field (e.g., TFORM = '1PA') only a single character string written. FTPCLS writes the whole length of the input string (minus any trailing blank characters), thus the NELEM and FELEM parameters are ignored. If the input string is completely blank then FITSIO will write one blank character to the FITS file. Similarly, FTGCVS and FTGCFS read the entire string (truncated to the width of the character string argument in the subroutine call) and also ignore the NELEM and FELEM parameters. The FTPDES subroutine is useful in situations where multiple rows of a variable length column have the identical array of values. One can simply write the array once for the first row, and then use FTPDES to write the same descriptor values into the other rows (use the FTGDES routine to read the first descriptor value); all the rows will then point to the same storage location thus saving disk space. When reading from a variable length array field one can only read as many elements as actually exist in that row of the table; reading does not automatically continue with the next row of the table as occurs when reading an ordinary fixed length table field. Attempts to read more than this will cause an error status to be returned. One can determine the number of elements in each row of a variable column with the FTGDES subroutine. **I. Support for IEEE Special Values The ANSI/IEEE-754 floating-point number standard defines certain special values that are used to represent such quantities as Not-a-Number (NaN), denormalized, underflow, overflow, and infinity. (See the Appendix in the FITS standard or the FITS User's Guide for a list of these values). The FITSIO subroutines that read floating point data in FITS files recognize these IEEE special values and by default interpret the overflow and infinity values as being equivalent to a NaN, and convert the underflow and denormalized values into zeros. In some cases programmers may want access to the raw IEEE values, without any modification by FITSIO. This can be done by calling the FTGPVx or FTGCVx routines while specifying 0.0 as the value of the NULLVAL parameter. This will force FITSIO to simply pass the IEEE values through to the application program, without any modification. This does not work for double precision values on VAX/VMS machines, however, where there is no easy way to bypass the default interpretation of the IEEE special values. This is also not supported when reading floating-point images that have been compressed with the FITS tiled image compression convention that is discussed in section 5.6; the pixels values in tile compressed images are represented by scaled integers, and a reserved integer value (not a NaN) is used to represent undefined pixels. **J. When the Final Size of the FITS HDU is Unknown It is not required to know the total size of a FITS data array or table before beginning to write the data to the FITS file. In the case of the primary array or an image extension, one should initially create the array with the size of the highest dimension (largest NAXISn keyword) set to a dummy value, such as 1. Then after all the data have been written and the true dimensions are known, then the NAXISn value should be updated using the fits\_ update\_key routine before moving to another extension or closing the FITS file. When writing to FITS tables, CFITSIO automatically keeps track of the highest row number that is written to, and will increase the size of the table if necessary. CFITSIO will also automatically insert space in the FITS file if necessary, to ensure that the data 'heap', if it exists, and/or any additional HDUs that follow the table do not get overwritten as new rows are written to the table. As a general rule it is best to specify the initial number of rows = 0 when the table is created, then let CFITSIO keep track of the number of rows that are actually written. The application program should not manually update the number of rows in the table (as given by the NAXIS2 keyword) since CFITSIO does this automatically. If a table is initially created with more than zero rows, then this will usually be considered as the minimum size of the table, even if fewer rows are actually written to the table. Thus, if a table is initially created with NAXIS2 = 20, and CFITSIO only writes 10 rows of data before closing the table, then NAXIS2 will remain equal to 20. If however, 30 rows of data are written to this table, then NAXIS2 will be increased from 20 to 30. The one exception to this automatic updating of the NAXIS2 keyword is if the application program directly modifies the value of NAXIS2 (up or down) itself just before closing the table. In this case, CFITSIO does not update NAXIS2 again, since it assumes that the application program must have had a good reason for changing the value directly. This is not recommended, however, and is only provided for backward compatibility with software that initially creates a table with a large number of rows, than decreases the NAXIS2 value to the actual smaller value just before closing the table. **K. Local FITS Conventions supported by FITSIO CFITSIO supports several local FITS conventions which are not defined in the official FITS standard and which are not necessarily recognized or supported by other FITS software packages. Programmers should be cautious about using these features, especially if the FITS files that are produced are expected to be processed by other software systems which do not use the CFITSIO interface. ***1. Support for Long String Keyword Values. The length of a standard FITS string keyword is limited to 68 characters because it must fit entirely within a single FITS header keyword record. In some instances it is necessary to encode strings longer than this limit, so FITSIO supports a local convention in which the string value is continued over multiple keywords. This continuation convention uses an ampersand character at the end of each substring to indicate that it is continued on the next keyword, and the continuation keywords all have the name CONTINUE without an equal sign in column 9. The string value may be continued in this way over as many additional CONTINUE keywords as is required. The following lines illustrate this continuation convention which is used in the value of the STRKEY keyword: - LONGSTRN= 'OGIP 1.0' / The OGIP Long String Convention may be used. STRKEY = 'This is a very long string keyword&' / Optional Comment CONTINUE ' value that is continued over 3 keywords in the & ' CONTINUE 'FITS header.' / This is another optional comment. - It is recommended that the LONGSTRN keyword, as shown here, always be included in any HDU that uses this longstring convention. A subroutine called FTPLSW has been provided in CFITSIO to write this keyword if it does not already exist. This long string convention is supported by the following FITSIO subroutines that deal with string-valued keywords: - ftgkys - read a string keyword ftpkls - write (append) a string keyword ftikls - insert a string keyword ftmkls - modify the value of an existing string keyword ftukls - update an existing keyword, or write a new keyword ftdkey - delete a keyword - These routines will transparently read, write, or delete a long string value in the FITS file, so programmers in general do not have to be concerned about the details of the convention that is used to encode the long string in the FITS header. When reading a long string, one must ensure that the character string parameter used in these subroutine calls has been declared long enough to hold the entire string, otherwise the returned string value will be truncated. Note that the more commonly used FITSIO subroutine to write string valued keywords (FTPKYS) does NOT support this long string convention and only supports strings up to 68 characters in length. This has been done deliberately to prevent programs from inadvertently writing keywords using this non-standard convention without the explicit intent of the programmer or user. The FTPKLS subroutine must be called instead to write long strings. This routine can also be used to write ordinary string values less than 68 characters in length. ***2. Arrays of Fixed-Length Strings in Binary Tables CFITSIO supports 2 ways to specify that a character column in a binary table contains an array of fixed-length strings. The first way, which is officially supported by the FITS Standard document, uses the TDIMn keyword. For example, if TFORMn = '60A' and TDIMn = '(12,5)' then that column will be interpreted as containing an array of 5 strings, each 12 characters long. FITSIO also supports a local convention for the format of the TFORMn keyword value of the form 'rAw' where 'r' is an integer specifying the total width in characters of the column, and 'w' is an integer specifying the (fixed) length of an individual unit string within the vector. For example, TFORM1 = '120A10' would indicate that the binary table column is 120 characters wide and consists of 12 10-character length strings. This convention is recognized by the FITSIO subroutines that read or write strings in binary tables. The Binary Table definition document specifies that other optional characters may follow the datatype code in the TFORM keyword, so this local convention is in compliance with the FITS standard, although other FITS readers are not required to recognize this convention. ***3. Keyword Units Strings One deficiency of the current FITS Standard is that it does not define a specific convention for recording the physical units of a keyword value. The TUNITn keyword can be used to specify the physical units of the values in a table column, but there is no analogous convention for keyword values. The comment field of the keyword is often used for this purpose, but the units are usually not specified in a well defined format that FITS readers can easily recognize and extract. To solve this deficiency, FITSIO uses a local convention in which the keyword units are enclosed in square brackets as the first token in the keyword comment field; more specifically, the opening square bracket immediately follows the slash '/' comment field delimiter and a single space character. The following examples illustrate keywords that use this convention: - EXPOSURE= 1800.0 / [s] elapsed exposure time V_HELIO = 16.23 / [km s**(-1)] heliocentric velocity LAMBDA = 5400. / [angstrom] central wavelength FLUX = 4.9033487787637465E-30 / [J/cm**2/s] average flux - In general, the units named in the IAU(1988) Style Guide are recommended, with the main exception that the preferred unit for angle is 'deg' for degrees. The FTPUNT and FTGUNT subroutines in FITSIO write and read, respectively, the keyword unit strings in an existing keyword. ***4. HIERARCH Convention for Extended Keyword Names CFITSIO supports the HIERARCH keyword convention which allows keyword names that are longer then 8 characters and may contain the full range of printable ASCII text characters. This convention was developed at the European Southern Observatory (ESO) to support hierarchical FITS keyword such as: - HIERARCH ESO INS FOCU POS = -0.00002500 / Focus position - Basically, this convention uses the FITS keyword 'HIERARCH' to indicate that this convention is being used, then the actual keyword name ({\tt'ESO INS FOCU POS'} in this example) begins in column 10 and can contain any printable ASCII text characters, including spaces. The equals sign marks the end of the keyword name and is followed by the usual value and comment fields just as in standard FITS keywords. Further details of this convention are described at http://fits.gsfc.nasa.gov/registry/hierarch\_keyword.html and in Section 4.4 of the ESO Data Interface Control Document that is linked to from http://archive.eso.org/cms/tools-documentation/eso-data-interface-control.html. This convention allows a much broader range of keyword names than is allowed by the FITS Standard. Here are more examples of such keywords: - HIERARCH LongKeyword = 47.5 / Keyword has > 8 characters, and mixed case HIERARCH XTE$TEMP = 98.6 / Keyword contains the '$' character HIERARCH Earth is a star = F / Keyword contains embedded spaces - CFITSIO will transparently read and write these keywords, so application programs do not in general need to know anything about the specific implementation details of the HIERARCH convention. In particular, application programs do not need to specify the `HIERARCH' part of the keyword name when reading or writing keywords (although it may be included if desired). When writing a keyword, CFITSIO first checks to see if the keyword name is legal as a standard FITS keyword (no more than 8 characters long and containing only letters, digits, or a minus sign or underscore). If so it writes it as a standard FITS keyword, otherwise it uses the hierarch convention to write the keyword. The maximum keyword name length is 67 characters, which leaves only 1 space for the value field. A more practical limit is about 40 characters, which leaves enough room for most keyword values. CFITSIO returns an error if there is not enough room for both the keyword name and the keyword value on the 80-character card, except for string-valued keywords which are simply truncated so that the closing quote character falls in column 80. In the current implementation, CFITSIO preserves the case of the letters when writing the keyword name, but it is case-insensitive when reading or searching for a keyword. The current implementation allows any ASCII text character (ASCII 32 to ASCII 126) in the keyword name except for the '=' character. A space is also required on either side of the equal sign. **L. Optimizing Code for Maximum Processing Speed CFITSIO has been carefully designed to obtain the highest possible speed when reading and writing FITS files. In order to achieve the best performance, however, application programmers must be careful to call the CFITSIO routines appropriately and in an efficient sequence; inappropriate usage of CFITSIO routines can greatly slow down the execution speed of a program. The maximum possible I/O speed of CFITSIO depends of course on the type of computer system that it is running on. To get a general idea of what data I/O speeds are possible on a particular machine, build the speed.c program that is distributed with CFITSIO (type 'make speed' in the CFITSIO directory). This diagnostic program measures the speed of writing and reading back a test FITS image, a binary table, and an ASCII table. The following 2 sections provide some background on how CFITSIO internally manages the data I/O and describes some strategies that may be used to optimize the processing speed of software that uses CFITSIO. ***1. Background Information: How CFITSIO Manages Data I/O Many CFITSIO operations involve transferring only a small number of bytes to or from the FITS file (e.g, reading a keyword, or writing a row in a table); it would be very inefficient to physically read or write such small blocks of data directly in the FITS file on disk, therefore CFITSIO maintains a set of internal Input--Output (IO) buffers in RAM memory that each contain one FITS block (2880 bytes) of data. Whenever CFITSIO needs to access data in the FITS file, it first transfers the FITS block containing those bytes into one of the IO buffers in memory. The next time CFITSIO needs to access bytes in the same block it can then go to the fast IO buffer rather than using a much slower system disk access routine. The number of available IO buffers is determined by the NIOBUF parameter (in fitsio2.h) and is currently set to 40. Whenever CFITSIO reads or writes data it first checks to see if that block of the FITS file is already loaded into one of the IO buffers. If not, and if there is an empty IO buffer available, then it will load that block into the IO buffer (when reading a FITS file) or will initialize a new block (when writing to a FITS file). If all the IO buffers are already full, it must decide which one to reuse (generally the one that has been accessed least recently), and flush the contents back to disk if it has been modified before loading the new block. The one major exception to the above process occurs whenever a large contiguous set of bytes are accessed, as might occur when reading or writing a FITS image. In this case CFITSIO bypasses the internal IO buffers and simply reads or writes the desired bytes directly in the disk file with a single call to a low-level file read or write routine. The minimum threshold for the number of bytes to read or write this way is set by the MINDIRECT parameter and is currently set to 3 FITS blocks = 8640 bytes. This is the most efficient way to read or write large chunks of data. Note that this fast direct IO process is not applicable when accessing columns of data in a FITS table because the bytes are generally not contiguous since they are interleaved by the other columns of data in the table. This explains why the speed for accessing FITS tables is generally slower than accessing FITS images. Given this background information, the general strategy for efficiently accessing FITS files should now be apparent: when dealing with FITS images, read or write large chunks of data at a time so that the direct IO mechanism will be invoked; when accessing FITS headers or FITS tables, on the other hand, once a particular FITS block has been loading into one of the IO buffers, try to access all the needed information in that block before it gets flushed out of the IO buffer. It is important to avoid the situation where the same FITS block is being read then flushed from a IO buffer multiple times. The following section gives more specific suggestions for optimizing the use of CFITSIO. ***2. Optimization Strategies 1. Because the data in FITS files is always stored in "big-endian" byte order, where the first byte of numeric values contains the most significant bits and the last byte contains the least significant bits, CFITSIO must swap the order of the bytes when reading or writing FITS files when running on little-endian machines (e.g., Linux and Microsoft Windows operating systems running on PCs with x86 CPUs). On fairly new CPUs that support "SSSE3" machine instructions (e.g., starting with Intel Core 2 CPUs in 2007, and in AMD CPUs beginning in 2011) significantly faster 4-byte and 8-byte swapping algorithms are available. These faster byte swapping functions are not used by default in CFITSIO (because of the potential code portablility issues), but users can enable them on supported platforms by adding the appropriate compiler flags (-mssse3 with gcc or icc on linux) when compiling the swapproc.c source file, which will allow the compiler to generate code using the SSSE3 instruction set. A convenient way to do this is to configure the CFITSIO library with the following command: - > ./configure --enable-ssse3 - Note, however, that a binary executable file that is created using these faster functions will only run on machines that support the SSSE3 machine instructions. It will crash on machines that do not support them. For faster 2-byte swaps on virtually all x86-64 CPUs (even those that do not support SSSE3), a variant using only SSE2 instructions exists. SSE2 is enabled by default on x86\_64 CPUs with 64-bit operating systems (and is also automatically enabled by the --enable-ssse3 flag). When running on x86\_64 CPUs with 32-bit operating systems, these faster 2-byte swapping algorithms are not used by default in CFITSIO, but can be enabled explicitly with: - ./configure --enable-sse2 - Preliminary testing indicates that these SSSE3 and SSE2 based byte-swapping algorithms can boost the CFITSIO performance when reading or writing FITS images by 20\% - 30\% or more. It is important to note, however, that compiler optimization must be turned on (e.g., by using the -O1 or -O2 flags in gcc) when building programs that use these fast byte-swapping algorithms in order to reap the full benefit of the SSSE3 and SSE2 instructions; without optimization, the code may actually run slower than when using more traditional byte-swapping techniques. 2. When dealing with a FITS primary array or IMAGE extension, it is more efficient to read or write large chunks of the image at a time (at least 3 FITS blocks = 8640 bytes) so that the direct IO mechanism will be used as described in the previous section. Smaller chunks of data are read or written via the IO buffers, which is somewhat less efficient because of the extra copy operation and additional bookkeeping steps that are required. In principle it is more efficient to read or write as big an array of image pixels at one time as possible, however, if the array becomes so large that the operating system cannot store it all in RAM, then the performance may be degraded because of the increased swapping of virtual memory to disk. 3. When dealing with FITS tables, the most important efficiency factor in the software design is to read or write the data in the FITS file in a single pass through the file. An example of poor program design would be to read a large, 3-column table by sequentially reading the entire first column, then going back to read the 2nd column, and finally the 3rd column; this obviously requires 3 passes through the file which could triple the execution time of an I/O limited program. For small tables this is not important, but when reading multi-megabyte sized tables these inefficiencies can become significant. The more efficient procedure in this case is to read or write only as many rows of the table as will fit into the available internal I/O buffers, then access all the necessary columns of data within that range of rows. Then after the program is completely finished with the data in those rows it can move on to the next range of rows that will fit in the buffers, continuing in this way until the entire file has been processed. By using this procedure of accessing all the columns of a table in parallel rather than sequentially, each block of the FITS file will only be read or written once. The optimal number of rows to read or write at one time in a given table depends on the width of the table row, on the number of I/O buffers that have been allocated in FITSIO, and also on the number of other FITS files that are open at the same time (since one I/O buffer is always reserved for each open FITS file). Fortunately, a FITSIO routine is available that will return the optimal number of rows for a given table: call ftgrsz(unit, nrows, status). It is not critical to use exactly the value of nrows returned by this routine, as long as one does not exceed it. Using a very small value however can also lead to poor performance because of the overhead from the larger number of subroutine calls. The optimal number of rows returned by ftgrsz is valid only as long as the application program is only reading or writing data in the specified table. Any other calls to access data in the table header would cause additional blocks of data to be loaded into the I/O buffers displacing data from the original table, and should be avoided during the critical period while the table is being read or written. 4. Use binary table extensions rather than ASCII table extensions for better efficiency when dealing with tabular data. The I/O to ASCII tables is slower because of the overhead in formatting or parsing the ASCII data fields, and because ASCII tables are about twice as large as binary tables with the same information content. 5. Design software so that it reads the FITS header keywords in the same order in which they occur in the file. When reading keywords, FITSIO searches forward starting from the position of the last keyword that was read. If it reaches the end of the header without finding the keyword, it then goes back to the start of the header and continues the search down to the position where it started. In practice, as long as the entire FITS header can fit at one time in the available internal I/O buffers, then the header keyword access will be very fast and it makes little difference which order they are accessed. 6. Avoid the use of scaling (by using the BSCALE and BZERO or TSCAL and TZERO keywords) in FITS files since the scaling operations add to the processing time needed to read or write the data. In some cases it may be more efficient to temporarily turn off the scaling (using ftpscl or fttscl) and then read or write the raw unscaled values in the FITS file. 7. Avoid using the 'implicit datatype conversion' capability in FITSIO. For instance, when reading a FITS image with BITPIX = -32 (32-bit floating point pixels), read the data into a single precision floating point data array in the program. Forcing FITSIO to convert the data to a different datatype can significantly slow the program. 8. Where feasible, design FITS binary tables using vector column elements so that the data are written as a contiguous set of bytes, rather than as single elements in multiple rows. For example, it is faster to access the data in a table that contains a single row and 2 columns with TFORM keywords equal to '10000E' and '10000J', than it is to access the same amount of data in a table with 10000 rows which has columns with the TFORM keywords equal to '1E' and '1J'. In the former case the 10000 floating point values in the first column are all written in a contiguous block of the file which can be read or written quickly, whereas in the second case each floating point value in the first column is interleaved with the integer value in the second column of the same row so CFITSIO has to explicitly move to the position of each element to be read or written. 9. Avoid the use of variable length vector columns in binary tables, since any reading or writing of these data requires that CFITSIO first look up or compute the starting address of each row of data in the heap. In practice, this is probably not a significant efficiency issue. 10. When copying data from one FITS table to another, it is faster to transfer the raw bytes instead of reading then writing each column of the table. The FITSIO subroutines FTGTBS and FTPTBS (for ASCII tables), and FTGTBB and FTPTBB (for binary tables) will perform low-level reads or writes of any contiguous range of bytes in a table extension. These routines can be used to read or write a whole row (or multiple rows) of a table with a single subroutine call. These routines are fast because they bypass all the usual data scaling, error checking and machine dependent data conversion that is normally done by FITSIO, and they allow the program to write the data to the output file in exactly the same byte order. For these same reasons, use of these routines can be somewhat risky because no validation or machine dependent conversion is performed by these routines. In general these routines are only recommended for optimizing critical pieces of code and should only be used by programmers who thoroughly understand the internal byte structure of the FITS tables they are reading or writing. 11. Another strategy for improving the speed of writing a FITS table, similar to the previous one, is to directly construct the entire byte stream for a whole table row (or multiple rows) within the application program and then write it to the FITS file with ftptbb. This avoids all the overhead normally present in the column-oriented CFITSIO write routines. This technique should only be used for critical applications, because it makes the code more difficult to understand and maintain, and it makes the code more system dependent (e.g., do the bytes need to be swapped before writing to the FITS file?). 12. Finally, external factors such as the type of magnetic disk controller (SCSI or IDE), the size of the disk cache, the average seek speed of the disk, the amount of disk fragmentation, and the amount of RAM available on the system can all have a significant impact on overall I/O efficiency. For critical applications, a system administrator should review the proposed system hardware to identify any potential I/O bottlenecks. *VII. Basic Interface Routines This section defines a basic set of subroutines that can be used to perform the most common types of read and write operations on FITS files. New users should start with these subroutines and then, as needed, explore the more advance routines described in the following chapter to perform more complex or specialized operations. A right arrow symbol ($>$) is used to separate the input parameters from the output parameters in the definition of each routine. This symbol is not actually part of the calling sequence. Note that the status parameter is both an input and an output parameter and must be initialized = 0 prior to calling the FITSIO subroutines. Refer to Chapter 9 for the definition of all the parameters used by these interface routines. **A. FITSIO Error Status Routines \label{FTVERS} >1 Return the current version number of the fitsio library. The version number will be incremented with each new > release of CFITSIO. - FTVERS( > version) - >2 Return the descriptive text string corresponding to a FITSIO error status code. The 30-character length string contains a brief > description of the cause of the error. - FTGERR(status, > errtext) - >3 Return the top (oldest) 80-character error message from the internal FITSIO stack of error messages and shift any remaining messages on the stack up one level. Any FITSIO error will generate one or more messages on the stack. Call this routine repeatedly to get each message in sequence. The error stack is empty > when a blank string is returned. - FTGMSG( > errmsg) - >4 The FTPMRK routine puts an invisible marker on the CFITSIO error stack. The FTCMRK routine can then be used to delete any more recent error messages on the stack, back to the position of the marker. This preserves any older error messages on the stack. FTCMSG simply clears the entire error message stack. > These routines are called without any arguments. - FTPMRK FTCMRK FTCMSG - >5 Print out the error message corresponding to the input status value and all the error messages on the FITSIO stack to the specified file stream (stream can be either the string 'STDOUT' or 'STDERR'). > If the input status value = 0 then this routine does nothing. - FTRPRT (stream, > status) - >6 Write an 80-character message to the FITSIO error stack. Application programs should not normally write to the stack, but there may be > some situations where this is desirable. - FTPMSG(errmsg) - **B. File I/O Routines >1 Open an existing FITS file with readonly or readwrite access. This routine always opens the primary array (the first HDU) of the file, and does not move to a following extension, if one was specified as part of the filename. Use the FTNOPN routine to automatically move to the extension. This routine will also open IRAF images (.imh format files) and raw binary data arrays with READONLY access by first converting them on the fly into virtual FITS images. See the `Extended File Name Syntax' chapter for more details. The FTDKOPN routine simply opens the specified file without trying to interpret the filename using the extended > filename syntax. - FTOPEN(unit,filename,rwmode, > blocksize,status) FTDKOPN(unit,filename,rwmode, > blocksize,status) - >2 Open an existing FITS file with readonly or readwrite access and move to a following extension, if one was specified as part of the filename. (e.g., 'filename.fits+2' or 'filename.fits[2]' will move to the 3rd HDU in the file). Note that this routine differs from FTOPEN in that it does not > have the redundant blocksize argument. - FTNOPN(unit,filename,rwmode, > status) - >3 Open an existing FITS file with readonly or readwrite access and then move to the first HDU containing significant data, if a) an HDU name or number to open was not explicitly specified as part of the filename, and b) if the FITS file contains a null primary array (i.e., NAXIS = 0). In this case, it will look for the first IMAGE HDU with NAXIS > 0, or the first table that does not contain the strings `GTI' (Good Time Interval) or `OBSTABLE' in the EXTNAME keyword value. FTTOPN is similar, except it will move to the first significant table HDU (skipping over any image HDUs) in the file if a specific HDU name or number is not specified. FTIOPN will move to the first non-null > image HDU, skipping over any tables. - FTDOPN(unit,filename,rwmode, > status) FTTOPN(unit,filename,rwmode, > status) FTIOPN(unit,filename,rwmode, > status) - >4 Open and initialize a new empty FITS file. A template file may also be specified to define the structure of the new file (see section 4.2.4). The FTDKINIT routine simply creates the specified file without trying to interpret the filename using the extended > filename syntax. - FTINIT(unit,filename,blocksize, > status) FTDKINIT(unit,filename,blocksize, > status) - >>5 Close a FITS file previously opened with ftopen or ftinit - FTCLOS(unit, > status) - >6 Move to a specified (absolute) HDU in the FITS file (nhdu = 1 for the > FITS primary array) - FTMAHD(unit,nhdu, > hdutype,status) - >7 Create a primary array (if none already exists), or insert a new IMAGE extension immediately following the CHDU, or insert a new Primary Array at the beginning of the file. Any following extensions in the file will be shifted down to make room for the new extension. If the CHDU is the last HDU in the file then the new image extension will simply be appended to the end of the file. One can force a new primary array to be inserted at the beginning of the FITS file by setting status = -9 prior to calling the routine. In this case the existing primary array will be converted to an IMAGE extension. The new extension (or primary array) will become the CHDU. The FTIIMGLL routine is identical to the FTIIMG routine except that the 4th parameter (the length of each axis) is an array of 64-bit integers rather than an array > of 32-bit integers. - FTIIMG(unit,bitpix,naxis,naxes, > status) FTIIMGLL(unit,bitpix,naxis,naxesll, > status) - >8 Insert a new ASCII TABLE extension immediately following the CHDU. Any following extensions will be shifted down to make room for the new extension. If there are no other following extensions then the new table extension will simply be appended to the end of the file. The new extension will become the CHDU. The FTITABLL routine is identical to the FTITAB routine except that the 2nd and 3rd parameters (that give the size of the table) are 64-bit integers rather than 32-bit integers. Under normal circumstances, the nrows and nrowsll paramenters should have a value of 0; CFITSIO will automatically update > the number of rows as data is written to the table. - FTITAB(unit,rowlen,nrows,tfields,ttype,tbcol,tform,tunit,extname, > status) FTITABLL(unit,rowlenll,nrowsll,tfields,ttype,tbcol,tform,tunit,extname, > status) - >9 Insert a new binary table extension immediately following the CHDU. Any following extensions will be shifted down to make room for the new extension. If there are no other following extensions then the new bintable extension will simply be appended to the end of the file. The new extension will become the CHDU. The FTIBINLL routine is identical to the FTIBIN routine except that the 2nd parameter (that gives the length of the table) is a 64-bit integer rather than a 32-bit integer. Under normal circumstances, the nrows and nrowsll paramenters should have a value of 0; CFITSIO will automatically update > the number of rows as data is written to the table. - FTIBIN(unit,nrows,tfields,ttype,tform,tunit,extname,varidat > status) FTIBINLL(unit,nrowsll,tfields,ttype,tform,tunit,extname,varidat > status) - **C. Keyword I/O Routines >>1 Put (append) an 80-character record into the CHU. - FTPREC(unit,card, > status) - >2 Put (append) a new keyword of the appropriate datatype into the CHU. The E and D versions of this routine have the added feature that if the 'decimals' parameter is negative, then the 'G' display format rather then the 'E' format will be used when constructing the keyword value, taking the absolute value of 'decimals' for the precision. This will suppress trailing zeros, and will use a fixed format rather than an exponential format, > depending on the magnitude of the value. - FTPKY[JKLS](unit,keyword,keyval,comment, > status) FTPKY[EDFG](unit,keyword,keyval,decimals,comment, > status) - >3 Get the nth 80-character header record from the CHU. The first keyword in the header is at key\_no = 1; if key\_no = 0 then this subroutine simple moves the internal pointer to the beginning of the header so that subsequent keyword operations will start at the top of > the header; it also returns a blank card value in this case. - FTGREC(unit,key_no, > card,status) - >4 Get a keyword value (with the appropriate datatype) and comment from > the CHU - FTGKY[EDJKLS](unit,keyword, > keyval,comment,status) - >>5 Delete an existing keyword record. - FTDKEY(unit,keyword, > status) - **D. Data I/O Routines The following routines read or write data values in the current HDU of the FITS file. Automatic datatype conversion will be attempted for numerical datatypes if the specified datatype is different from the actual datatype of the FITS array or table column. >>1 Write elements into the primary data array or image extension. - FTPPR[BIJKED](unit,group,fpixel,nelements,values, > status) - >2 Read elements from the primary data array or image extension. Undefined array elements will be returned with a value = nullval, unless nullval = 0 in which case no checks for undefined pixels will be performed. The anyf parameter is set to true (= .true.) if any of the returned > elements were undefined. - FTGPV[BIJKED](unit,group,fpixel,nelements,nullval, > values,anyf,status) - >3 Write elements into an ASCII or binary table column. The `felem' parameter applies only to vector columns in binary tables and is > ignored when writing to ASCII tables. - FTPCL[SLBIJKEDCM](unit,colnum,frow,felem,nelements,values, > status) - >4 Read elements from an ASCII or binary table column. Undefined array elements will be returned with a value = nullval, unless nullval = 0 (or = ' ' for ftgcvs) in which case no checking for undefined values will be performed. The ANYF parameter is set to true if any of the returned elements are undefined. Any column, regardless of it's intrinsic datatype, may be read as a string. It should be noted however that reading a numeric column as a string is 10 - 100 times slower than reading the same column as a number due to the large overhead in constructing the formatted strings. The display format of the returned strings will be determined by the TDISPn keyword, if it exists, otherwise by the datatype of the column. The length of the returned strings can be determined with the ftgcdw routine. The following TDISPn display formats are currently supported: - Iw.m Integer Ow.m Octal integer Zw.m Hexadecimal integer Fw.d Fixed floating point Ew.d Exponential floating point Dw.d Exponential floating point Gw.d General; uses Fw.d if significance not lost, else Ew.d - where w is the width in characters of the displayed values, m is the minimum number of digits displayed, and d is the number of digits to the right of the > decimal. The .m field is optional. - FTGCV[SBIJKEDCM](unit,colnum,frow,felem,nelements,nullval, > values,anyf,status) - >5 Get the table column number and full name of the column whose name matches the input template string. See the `Advanced Interface Routines' > chapter for a full description of this routine. - FTGCNN(unit,casesen,coltemplate, > colname,colnum,status) - *VIII Advanced Interface Subroutines This chapter defines all the available subroutines in the FITSIO user interface. For completeness, the basic subroutines described in the previous chapter are also repeated here. A right arrow symbol is used here to separate the input parameters from the output parameters in the definition of each subroutine. This symbol is not actually part of the calling sequence. An alphabetical list and definition of all the parameters is given at the end of this section. **A. FITS File Open and Close Subroutines: \label{FTOPEN} >1 Open an existing FITS file with readonly or readwrite access. The FTDKOPN routine simply opens the specified file without trying to interpret the filename using the extended filename syntax. FTDOPN opens the file and also moves to the first HDU containing significant data, if no specific HDU is specified as part of the filename. FTTOPN and FTIOPN are similar except that they will move to the first table HDU or image HDU, respectively, >if a HDU name or number is not specified as part of the filename. - FTOPEN(unit,filename,rwmode, > blocksize,status) FTDKOPN(unit,filename,rwmode, > blocksize,status) FTDOPN(unit,filename,rwmode, > status) FTTOPN(unit,filename,rwmode, > status) FTIOPN(unit,filename,rwmode, > status) - >2 Open an existing FITS file with readonly or readwrite access and move to a following extension, if one was specified as part of the filename. (e.g., 'filename.fits+2' or 'filename.fits[2]' will move to the 3rd HDU in the file). Note that this routine differs from FTOPEN in that it does not > have the redundant blocksize argument. - FTNOPN(unit,filename,rwmode, > status) - >3 Reopen a FITS file that was previously opened with FTOPEN, FTNOPN, or FTINIT. The newunit number may then be treated as a separate file, and one may simultaneously read or write to 2 (or more) different extensions in the same file. The FTOPEN and FTNOPN routines (above) automatically detects cases where a previously opened file is being opened again, and then internally call FTREOPEN, so programs should rarely > need to explicitly call this routine. - FTREOPEN(unit, > newunit, status) - >4 Open and initialize a new empty FITS file. The FTDKINIT routine simply creates the specified file without trying to interpret the filename using the extended > filename syntax. - FTINIT(unit,filename,blocksize, > status) FTDKINIT(unit,filename,blocksize, > status) - >5 Create a new FITS file, using a template file to define its initial size and structure. The template may be another FITS HDU or an ASCII template file. If the input template file name is blank, then this routine behaves the same as FTINIT. The currently supported format of the ASCII template file is described under the fits\_parse\_template routine (in the general Utilities section), but this may change slightly later releases of > CFITSIO. - FTTPLT(unit, filename, tplfilename, > status) - >6 Flush internal buffers of data to the output FITS file previously opened with ftopen or ftinit. The routine usually never needs to be called, but doing so will ensure that if the program subsequently aborts, then the FITS file will > have at least been closed properly. - FTFLUS(unit, > status) - >>7 Close a FITS file previously opened with ftopen or ftinit - FTCLOS(unit, > status) - >8 Close and DELETE a FITS file previously opened with ftopen or ftinit. This routine may be useful in cases where a FITS file is created, but > an error occurs which prevents the complete file from being written. - FTDELT(unit, > status) - >9 Get the value of an unused I/O unit number which may then be used as input to FTOPEN or FTINIT. This routine searches for the first unused unit number in the range from with 99 down to 50. This routine just keeps an internal list of the allocated unit numbers and does not physically check that the Fortran unit is available (to be compatible with the SPP version of FITSIO). Thus users must not independently allocate any unit numbers in the range 50 - 99 if this routine is also to be used in the same program. This routine is provided for convenience only, and it is not required > that the unit numbers used by FITSIO be allocated by this routine. - FTGIOU( > iounit, status) - >10 Free (deallocate) an I/O unit number which was previously allocated with FTGIOU. All previously allocated unit numbers may be > deallocated at once by calling FTFIOU with iounit = -1. - FTFIOU(iounit, > status) - >11 Return the Fortran unit number that corresponds to the C fitsfile pointer value, or vice versa. These 2 C routines may be useful in mixed language programs where both C and Fortran subroutines need to access the same file. For example, if a FITS file is opened with unit 12 by a Fortran subroutine, then a C routine within the same program could get the fitfile pointer value to access the same file by calling 'fptr = CUnit2FITS(12)'. These routines return a value >of zero if an error occurs. - int CFITS2Unit(fitsfile *ptr); fitsfile* CUnit2FITS(int unit); - >11 Parse the input filename and return the HDU number that would be moved to if the file were opened with FTNOPN. The returned HDU number begins with 1 for the primary array, so for example, if the input filename = `myfile.fits[2]' then hdunum = 3 will be returned. FITSIO does not open the file to check if the extension actually exists if an extension number is specified. If an extension *name* is included in the file name specification (e.g. `myfile.fits[EVENTS]' then this routine will have to open the FITS file and look for the position of the named extension, then close file again. This is not possible if the file is being read from the stdin stream, and an error will be returned in this case. If the filename does not specify an explicit extension (e.g. 'myfile.fits') then hdunum = -99 will be returned, which is functionally equivalent to hdunum = 1. This routine is mainly used for backward compatibility in the ftools software package and is not recommended for general use. It is generally better and more efficient to first open the FITS file with FTNOPN, then use FTGHDN to determine which HDU in the file has been opened, rather than calling > FTEXTN followed by a call to FTNOPN. - FTEXTN(filename, > nhdu, status) - >>12 Return the name of the opened FITS file. - FTFLNM(unit, > filename, status) - >>13 Return the I/O mode of the open FITS file (READONLY = 0, READWRITE = 1). - FTFLMD(unit, > iomode, status) - >14 Return the file type of the opened FITS file (e.g. 'file://', 'ftp://', > etc.). - FTURLT(unit, > urltype, status) - >15 Parse the input filename or URL into its component parts: the file type (file://, ftp://, http://, etc), the base input file name, the name of the output file that the input file is to be copied to prior to opening, the HDU or extension specification, the filtering specifier, the binning specifier, and the column specifier. Blank strings will be returned for any components that are not present >in the input file name. - FTIURL(filename, > filetype, infile, outfile, extspec, filter, binspec, colspec, status) - >16 Parse the input file name and return the root file name. The root name includes the file type if specified, (e.g. 'ftp://' or 'http://') and the full path name, to the extent that it is specified in the input filename. It does not include the HDU name or number, or any filtering >specifications. - FTRTNM(filename, > rootname, status) - >16 Test if the input file or a compressed version of the file (with a .gz, .Z, .z, or .zip extension) exists on disk. The returned value of the 'exists' parameter will have 1 of the 4 following values: - 2: the file does not exist, but a compressed version does exist 1: the disk file does exist 0: neither the file nor a compressed version of the file exist -1: the input file name is not a disk file (could be a ftp, http, smem, or mem file, or a file piped in on the STDIN stream) - > - FTEXIST(filename, > exists, status); - **B. HDU-Level Operations \label{FTMAHD} When a FITS file is first opened or created, the internal buffers in FITSIO automatically point to the first HDU in the file. The following routines may be used to move to another HDU in the file. Note that the HDU numbering convention used in FITSIO denotes the primary array as the first HDU, the first extension in a FITS file is the second HDU, and so on. >1 Move to a specified (absolute) HDU in the FITS file (nhdu = 1 for the > FITS primary array) - FTMAHD(unit,nhdu, > hdutype,status) - >>2 Move to a new (existing) HDU forward or backwards relative to the CHDU - FTMRHD(unit,nmove, > hdutype,status) - >3 Move to the (first) HDU which has the specified extension type and EXTNAME (or HDUNAME) and EXTVER keyword values. The hdutype parameter may have a value of IMAGE\_HDU (0), ASCII\_TBL (1), BINARY\_TBL (2), or ANY\_HDU (-1) where ANY\_HDU means that only the extname and extver values will be used to locate the correct extension. If the input value of extver is 0 then the EXTVER keyword is ignored and the first HDU with a matching EXTNAME (or HDUNAME) keyword will be found. If no matching HDU is found in the file then the current HDU will remain unchanged > and a status = BAD\_HDU\_NUM (301) will be returned. - FTMNHD(unit, hdutype, extname, extver, > status) - >>4 Get the number of the current HDU in the FITS file (primary array = 1) - FTGHDN(unit, > nhdu) - >5 Return the type of the current HDU in the FITS file. The possible > values for hdutype are IMAGE\_HDU (0), ASCII\_TBL (1), or BINARY\_TBL (2). - FTGHDT(unit, > hdutype, status) - >6 Return the total number of HDUs in the FITS file. > The CHDU remains unchanged. - FTTHDU(unit, > hdunum, status) - >7 Create (append) a new empty HDU at the end of the FITS file. This new HDU becomes the Current HDU, but it is completely empty and contains no header keywords or data. It is recommended that FTIIMG, FTITAB or > FTIBIN be used instead of this routine. - FTCRHD(unit, > status) - >8 Create a primary array (if none already exists), or insert a new IMAGE extension immediately following the CHDU, or insert a new Primary Array at the beginning of the file. Any following extensions in the file will be shifted down to make room for the new extension. If the CHDU is the last HDU in the file then the new image extension will simply be appended to the end of the file. One can force a new primary array to be inserted at the beginning of the FITS file by setting status = -9 prior to calling the routine. In this case the existing primary array will be converted to an IMAGE extension. The new extension (or primary array) will become the CHDU. The FTIIMGLL routine is identical to the FTIIMG routine except that the 4th parameter (the length of each axis) is an array of 64-bit integers rather than an array > of 32-bit integers. - FTIIMG(unit,bitpix,naxis,naxes, > status) FTIIMGLL(unit,bitpix,naxis,naxesll, > status) - >9 Insert a new ASCII TABLE extension immediately following the CHDU. Any following extensions will be shifted down to make room for the new extension. If there are no other following extensions then the new table extension will simply be appended to the end of the file. The new extension will become the CHDU. The FTITABLL routine is identical to the FTITAB routine except that the 2nd and 3rd parameters (that give the size of the table) are 64-bit integers rather than > 32-bit integers. - FTITAB(unit,rowlen,nrows,tfields,ttype,tbcol,tform,tunit,extname, > status) FTITABLL(unit,rowlenll,nrowsll,tfields,ttype,tbcol,tform,tunit,extname, > status) - >10 Insert a new binary table extension immediately following the CHDU. Any following extensions will be shifted down to make room for the new extension. If there are no other following extensions then the new bintable extension will simply be appended to the end of the file. The new extension will become the CHDU. The FTIBINLL routine is identical to the FTIBIN routine except that the 2nd parameter (that gives the length of the table) is a 64-bit integer rather than > a 32-bit integer. - FTIBIN(unit,nrows,tfields,ttype,tform,tunit,extname,varidat > status) FTIBINLL(unit,nrowsll,tfields,ttype,tform,tunit,extname,varidat > status) - >11 Resize an image by modifing the size, dimensions, and/or datatype of the current primary array or image extension. If the new image, as specified by the input arguments, is larger than the current existing image in the FITS file then zero fill data will be inserted at the end of the current image and any following extensions will be moved further back in the file. Similarly, if the new image is smaller than the current image then any following extensions will be shifted up towards the beginning of the FITS file and the image data will be truncated to the new size. This routine rewrites the BITPIX, NAXIS, and NAXISn keywords with the appropriate values for new image. The FTRSIMLL routine is identical to the FTRSIM routine except that the 4th parameter (the length of each axis) is an array of 64-bit integers rather than an array > of 32-bit integers. - FTRSIM(unit,bitpix,naxis,naxes,status) FTRSIMLL(unit,bitpix,naxis,naxesll,status) - >12 Delete the CHDU in the FITS file. Any following HDUs will be shifted forward in the file, to fill in the gap created by the deleted HDU. In the case of deleting the primary array (the first HDU in the file) then the current primary array will be replace by a null primary array containing the minimum set of required keywords and no data. If there are more extensions in the file following the one that is deleted, then the the CHDU will be redefined to point to the following extension. If there are no following extensions then the CHDU will be redefined to point to the previous HDU. The output HDUTYPE parameter indicates the type of the new CHDU after > the previous CHDU has been deleted. - FTDHDU(unit, > hdutype,status) - >13 Copy all or part of the input FITS file and append it to the end of the output FITS file. If 'previous' (an integer parameter) is not equal to 0, then any HDUs preceding the current HDU in the input file will be copied to the output file. Similarly, 'current' and 'following' determine whether the current HDU, and/or any following HDUs in the input file will be copied to the output file. If all 3 parameters are not equal to zero, then the entire input file will be copied. On return, the current HDU in the input file will be unchanged, and the last copied HDU will be the > current HDU in the output file. - FTCPFL(iunit, ounit, previous, current, following, > status) - >14 Copy the entire CHDU from the FITS file associated with IUNIT to the CHDU of the FITS file associated with OUNIT. The output HDU must be empty and not already contain any keywords. Space will be reserved for MOREKEYS additional keywords in the output header if there is not already enough > space. - FTCOPY(iunit,ounit,morekeys, > status) - >15 Copy the header (and not the data) from the CHDU associated with inunit to the CHDU associated with outunit. If the current output HDU is not completely empty, then the CHDU will be closed and a new HDU will be appended to the output file. This routine will automatically transform the necessary keywords when copying a primary array to and image extension, or an image extension to a primary array. > An empty output data unit will be created (all values = 0). - FTCPHD(inunit, outunit, > status) - >16 Copy just the data from the CHDU associated with IUNIT to the CHDU associated with OUNIT. This will overwrite any data previously in the OUNIT CHDU. This low level routine is used by FTCOPY, but it may also be useful in certain application programs which want to copy the data from one FITS file to another but also want to modify the header keywords in the process. all the required header keywords must be written to the OUNIT CHDU before calling > this routine - FTCPDT(iunit,ounit, > status) - **C. Define or Redefine the structure of the CHDU \label{FTRDEF} It should rarely be necessary to call the subroutines in this section. FITSIO internally calls these routines whenever necessary, so any calls to these routines by application programs will likely be redundant. >1 This routine forces FITSIO to scan the current header keywords that define the structure of the HDU (such as the NAXISn, PCOUNT and GCOUNT keywords) so that it can initialize the internal buffers that describe the HDU structure. This routine may be used instead of the more complicated calls to ftpdef, ftadef or ftbdef. This routine is also very useful for reinitializing the structure of an HDU, if the number of rows in a table, as specified by the NAXIS2 keyword, > has been modified from its initial value. - FTRDEF(unit, > status) (DEPRECATED) - >2 Define the structure of the primary array or IMAGE extension. When writing GROUPed FITS files that by convention set the NAXIS1 keyword equal to 0, ftpdef must be called with naxes(1) = 1, NOT 0, otherwise FITSIO will report an error status=308 when trying to write data to a group. Note: it is usually simpler to call FTRDEF rather > than this routine. - FTPDEF(unit,bitpix,naxis,naxes,pcount,gcount, > status) (DEPRECATED) - >3 Define the structure of an ASCII table (TABLE) extension. Note: it > is usually simpler to call FTRDEF rather than this routine. - FTADEF(unit,rowlen,tfields,tbcol,tform,nrows > status) (DEPRECATED) - >4 Define the structure of a binary table (BINTABLE) extension. Note: it > is usually simpler to call FTRDEF rather than this routine. - FTBDEF(unit,tfields,tform,varidat,nrows > status) (DEPRECATED) - >5 Define the size of the Current Data Unit, overriding the length of the data unit as previously defined by ftpdef, ftadef, or ftbdef. This is useful if one does not know the total size of the data unit until after the data have been written. The size (in bytes) of an ASCII or Binary table is given by NAXIS1 * NAXIS2. (Note that to determine the value of NAXIS1 it is often more convenient to read the value of the NAXIS1 keyword from the output file, rather than computing the row length directly from all the TFORM keyword values). Note: it > is usually simpler to call FTRDEF rather than this routine. - FTDDEF(unit,bytlen, > status) (DEPRECATED) - >6 Define the zero indexed byte offset of the 'heap' measured from the start of the binary table data. By default the heap is assumed to start immediately following the regular table data, i.e., at location NAXIS1 x NAXIS2. This routine is only relevant for binary tables which contain variable length array columns (with TFORMn = 'Pt'). This subroutine also automatically writes the value of theap to a keyword in the extension header. This subroutine must be called after the required keywords have been written (with ftphbn) and after the table structure has been defined > (with ftbdef) but before any data is written to the table. - FTPTHP(unit,theap, > status) - **D. FITS Header I/O Subroutines ***1. Header Space and Position Routines \label{FTHDEF} >1 Reserve space in the CHU for MOREKEYS more header keywords. This subroutine may be called to reserve space for keywords which are to be written at a later time, after the data unit or subsequent extensions have been written to the FITS file. If this subroutine is not explicitly called, then the initial size of the FITS header will be limited to the space available at the time that the first data is written to the associated data unit. FITSIO has the ability to dynamically add more space to the header if needed, however it is more efficient > to preallocate the required space if the size is known in advance. - FTHDEF(unit,morekeys, > status) - >2 Return the number of existing keywords in the CHU (NOT including the END keyword which is not considered a real keyword) and the remaining space available to write additional keywords in the CHU. (returns KEYSADD = -1 if the header has not yet been closed). Note that FITSIO will attempt to dynamically add space for more > keywords if required when appending new keywords to a header. - FTGHSP(iunit, > keysexist,keysadd,status) - >3 Return the number of keywords in the header and the current position in the header. This returns the number of the keyword record that will be read next (or one greater than the position of the last keyword that was read or written). A value of 1 is returned if the pointer is > positioned at the beginning of the header. - FTGHPS(iunit, > keysexist,key_no,status) - ***2. Read or Write Standard Header Routines \label{FTPHPR} These subroutines provide a simple method of reading or writing most of the keyword values that are normally required in a FITS files. These subroutines are provided for convenience only and are not required to be used. If preferred, users may call the lower-level subroutines described in the previous section to individually read or write the required keywords. Note that in most cases, the required keywords such as NAXIS, TFIELD, TTYPEn, etc, which define the structure of the HDU must be written to the header before any data can be written to the image or table. >1 Put the primary header or IMAGE extension keywords into the CHU. There are 2 available routines: The simpler FTPHPS routine is equivalent to calling ftphpr with the default values of SIMPLE = true, pcount = 0, gcount = 1, and EXTEND = true. PCOUNT, GCOUNT and EXTEND keywords are not required in the primary header and are only written if pcount is not equal to zero, gcount is not equal to zero or one, and if extend is TRUE, respectively. When writing to an IMAGE extension, the >SIMPLE and EXTEND parameters are ignored. - FTPHPS(unit,bitpix,naxis,naxes, > status) FTPHPR(unit,simple,bitpix,naxis,naxes,pcount,gcount,extend, > status) - >2 Get primary header or IMAGE extension keywords from the CHU. When reading from an IMAGE extension the SIMPLE and EXTEND parameters are > ignored. - FTGHPR(unit,maxdim, > simple,bitpix,naxis,naxes,pcount,gcount,extend, status) - >3 Put the ASCII table header keywords into the CHU. The optional TUNITn and EXTNAME keywords are written only if the input string >values are not blank. - FTPHTB(unit,rowlen,nrows,tfields,ttype,tbcol,tform,tunit,extname, > status) - >>4 Get the ASCII table header keywords from the CHU - FTGHTB(unit,maxdim, > rowlen,nrows,tfields,ttype,tbcol,tform,tunit, extname,status) - >5 Put the binary table header keywords into the CHU. The optional TUNITn and EXTNAME keywords are written only if the input string values are not blank. The pcount parameter, which specifies the size of the variable length array heap, should initially = 0; FITSIO will automatically update the PCOUNT keyword value if any variable length array data is written to the heap. The TFORM keyword value for variable length vector columns should have the form 'Pt(len)' or '1Pt(len)' where `t' is the data type code letter (A,I,J,E,D, etc.) and `len' is an integer specifying the maximum length of the vectors in that column (len must be greater than or equal to the longest vector in the column). If `len' is not specified when the table is created (e.g., the input TFORMn value is just '1Pt') then FITSIO will scan the column when the table is first closed and will append the maximum length to the TFORM keyword value. Note that if the table is subsequently modified to increase the maximum length of the vectors then the modifying program is responsible for also updating the TFORM > keyword value. - FTPHBN(unit,nrows,tfields,ttype,tform,tunit,extname,varidat, > status) - >>6 Get the binary table header keywords from the CHU - FTGHBN(unit,maxdim, > nrows,tfields,ttype,tform,tunit,extname,varidat, status) - ***3. Write Keyword Subroutines \label{FTPREC} >>1 Put (append) an 80-character record into the CHU. - FTPREC(unit,card, > status) - >2 Put (append) a COMMENT keyword into the CHU. Multiple COMMENT keywords > will be written if the input comment string is longer than 72 characters. - FTPCOM(unit,comment, > status) - >3 Put (append) a HISTORY keyword into the CHU. Multiple HISTORY keywords > will be written if the input history string is longer than 72 characters. - FTPHIS(unit,history, > status) - >4 Put (append) the DATE keyword into the CHU. The keyword value will contain the current system date as a character string in 'dd/mm/yy' format. If a DATE keyword already exists in the header, then this subroutine will > simply update the keyword value in-place with the current date. - FTPDAT(unit, > status) - >5 Put (append) a new keyword of the appropriate datatype into the CHU. Note that FTPKYS will only write string values up to 68 characters in length; longer strings will be truncated. The FTPKLS routine can be used to write longer strings, using a non-standard FITS convention. The E and D versions of this routine have the added feature that if the 'decimals' parameter is negative, then the 'G' display format rather then the 'E' format will be used when constructing the keyword value, taking the absolute value of 'decimals' for the precision. This will suppress trailing zeros, and will use a fixed format rather than an exponential format, > depending on the magnitude of the value. - FTPKY[JKLS](unit,keyword,keyval,comment, > status) FTPKY[EDFG](unit,keyword,keyval,decimals,comment, > status) - >6 Put (append) a string valued keyword into the CHU which may be longer than 68 characters in length. This uses the Long String Keyword convention that is described in the "Usage Guidelines and Suggestions" section of this document. Since this uses a non-standard FITS convention to encode the long keyword string, programs which use this routine should also call the FTPLSW routine to add some COMMENT keywords to warn users of the FITS file that this convention is being used. FTPLSW also writes a keyword called LONGSTRN to record the version of the longstring convention that has been used, in case a new convention is adopted at some point in the future. If the LONGSTRN keyword is already present in the header, then FTPLSW will > simply return and will not write duplicate keywords. - FTPKLS(unit,keyword,keyval,comment, > status) FTPLSW(unit, > status) - >7 Put (append) a new keyword with an undefined, or null, value into the CHU. > The value string of the keyword is left blank in this case. - FTPKYU(unit,keyword,comment, > status) - >8 Put (append) a numbered sequence of keywords into the CHU. One may append the same comment to every keyword (and eliminate the need to have an array of identical comment strings, one for each keyword) by including the ampersand character as the last non-blank character in the (first) COMMENTS string parameter. This same string will then be used for the comment field in all the keywords. (Note that the SPP version of these routines only supports a single comment > string). - FTPKN[JKLS](unit,keyroot,startno,no_keys,keyvals,comments, > status) FTPKN[EDFG](unit,keyroot,startno,no_keys,keyvals,decimals,comments, > status) - >9 Copy an indexed keyword from one HDU to another, modifying the index number of the keyword name in the process. For example, this routine could read the TLMIN3 keyword from the input HDU (by giving keyroot = "TLMIN" and innum = 3) and write it to the output HDU with the keyword name TLMIN4 (by setting outnum = 4). If the input keyword does not exist, then this routine simply > returns without indicating an error. - FTCPKY(inunit, outunit, innum, outnum, keyroot, > status) - >10 Put (append) a 'triple precision' keyword into the CHU in F28.16 format. The floating point keyword value is constructed by concatenating the input integer value with the input double precision fraction value (which must have a value between 0.0 and 1.0). The FTGKYT routine should be used to read this keyword value, because the other keyword reading > subroutines will not preserve the full precision of the value. - FTPKYT(unit,keyword,intval,dblval,comment, > status) - >11 Write keywords to the CHDU that are defined in an ASCII template file. The format of the template file is described under the ftgthd > routine below. - FTPKTP(unit, filename, > status) - >12 Append the physical units string to an existing keyword. This routine uses a local convention, shown in the following example, in which the keyword units are enclosed in square brackets in the > beginning of the keyword comment field. - VELOCITY= 12.3 / [km/s] orbital speed FTPUNT(unit,keyword,units, > status) - ***4. Insert Keyword Subroutines \label{FTIREC} >1 Insert a new keyword record into the CHU at the specified position (i.e., immediately preceding the (keyno)th keyword in the header.) This 'insert record' subroutine is somewhat less efficient then the 'append record' subroutine (FTPREC) described above because > the remaining keywords in the header have to be shifted down one slot. - FTIREC(unit,key_no,card, > status) - >2 Insert a new keyword into the CHU. The new keyword is inserted immediately following the last keyword that has been read from the header. The FTIKLS subroutine works the same as the FTIKYS subroutine, except it also supports long string values greater than 68 characters in length. These 'insert keyword' subroutines are somewhat less efficient then the 'append keyword' subroutines described above because the remaining > keywords in the header have to be shifted down one slot. - FTIKEY(unit, card, > status) FTIKY[JKLS](unit,keyword,keyval,comment, > status) FTIKLS(unit,keyword,keyval,comment, > status) FTIKY[EDFG](unit,keyword,keyval,decimals,comment, > status) - >3 Insert a new keyword with an undefined, or null, value into the CHU. > The value string of the keyword is left blank in this case. - FTIKYU(unit,keyword,comment, > status) - ***5. Read Keyword Subroutines \label{FTGREC} These routines return the value of the specified keyword(s). Wild card characters (*, ?, or \#) may be used when specifying the name of the keyword to be read: a '?' will match any single character at that position in the keyword name and a '*' will match any length (including zero) string of characters. The '\#' character will match any consecutive string of decimal digits (0 - 9). Note that when a wild card is used in the input keyword name, the routine will only search for a match from the current header position to the end of the header. It will not resume the search from the top of the header back to the original header position as is done when no wildcards are included in the keyword name. If the desired keyword string is 8-characters long (the maximum length of a keyword name) then a '*' may be appended as the ninth character of the input name to force the keyword search to stop at the end of the header (e.g., 'COMMENT *' will search for the next COMMENT keyword). The ffgrec routine may be used to set the starting position when doing wild card searches. >1 Get the nth 80-character header record from the CHU. The first keyword in the header is at key\_no = 1; if key\_no = 0 then this subroutine simple moves the internal pointer to the beginning of the header so that subsequent keyword operations will start at the top of > the header; it also returns a blank card value in this case. - FTGREC(unit,key_no, > card,status) - >2 Get the name, value (as a string), and comment of the nth keyword in CHU. This routine also checks that the returned keyword name (KEYWORD) contains only legal ASCII characters. Call FTGREC and FTPSVC to bypass this error > check. - FTGKYN(unit,key_no, > keyword,value,comment,status) - >>3 Get the 80-character header record for the named keyword - FTGCRD(unit,keyword, > card,status) - >4 Get the next keyword whose name matches one of the strings in 'inclist' but does not match any of the strings in 'exclist'. The strings in inclist and exclist may contain wild card characters (*, ?, and \#) as described at the beginning of this section. This routine searches from the current header position to the end of the header, only, and does not continue the search from the top of the header back to the original position. The current header position may be reset with the ftgrec routine. Note that nexc may be set = 0 if there are no keywords to be excluded. This routine returns status = 202 if a matching > keyword is not found. - FTGNXK(unit,inclist,ninc,exclist,nexc, > card,status) - >5 Get the literal keyword value as a character string. Regardless of the datatype of the keyword, this routine simply returns the string of characters in the value field of the keyword along with > the comment field. - FTGKEY(unit,keyword, > value,comment,status) - >6 Get a keyword value (with the appropriate datatype) and comment from > the CHU - FTGKY[EDJKLS](unit,keyword, > keyval,comment,status) - >7 Read a string-valued keyword and return the string length, the value string, and/or the comment field. The first routine, FTGKSL, simply returns the length of the character string value of the specified keyword. The second routine, FTGSKY, also returns up to maxchar characters of the keyword value string, starting with the firstchar character, and the keyword comment string. The length argument returns the total length of the keyword value string regardless of how much of the string is actually returned (which depends on the value of the firstchar and maxchar arguments). These routines support string keywords that use the CONTINUE convention to continue long string values over multiple FITS header records. Normally, string-valued keywords have a maximum length of 68 characters, however, > CONTINUE'd string keywords may be arbitrarily long. - FTGKSL(unit,keyword, > length,status) FTGSKY(unit,keyword,firstchar,maxchar,> keyval,length,comment,status) - >8 Get a sequence of numbered keyword values. These > routines do not support wild card characters in the root name. - FTGKN[EDJKLS](unit,keyroot,startno,max_keys, > keyvals,nfound,status) - >9 Get the value of a floating point keyword, returning the integer and fractional parts of the value in separate subroutine arguments. This subroutine may be used to read any keyword but is especially > useful for reading the 'triple precision' keywords written by FTPKYT. - FTGKYT(unit,keyword, > intval,dblval,comment,status) - >10 Get the physical units string in an existing keyword. This routine uses a local convention, shown in the following example, in which the keyword units are enclosed in square brackets in the beginning of the keyword comment field. A blank string is returned if no units are defined > for the keyword. - VELOCITY= 12.3 / [km/s] orbital speed FTGUNT(unit,keyword, > units,status) - ***6. Modify Keyword Subroutines \label{FTMREC} Wild card characters, as described in the Read Keyword section, above, may be used when specifying the name of the keyword to be modified. >>1 Modify (overwrite) the nth 80-character header record in the CHU - FTMREC(unit,key_no,card, > status) - >2 Modify (overwrite) the 80-character header record for the named keyword in the CHU. This can be used to overwrite the name of the keyword as > well as its value and comment fields. - FTMCRD(unit,keyword,card, > status) - >3 Modify (overwrite) the name of an existing keyword in the CHU > preserving the current value and comment fields. - FTMNAM(unit,oldkey,keyword, > status) - >>4 Modify (overwrite) the comment field of an existing keyword in the CHU - FTMCOM(unit,keyword,comment, > status) - >5 Modify the value and comment fields of an existing keyword in the CHU. The FTMKLS subroutine works the same as the FTMKYS subroutine, except it also supports long string values greater than 68 characters in length. Optionally, one may modify only the value field and leave the comment field unchanged by setting the input COMMENT parameter equal to the ampersand character (\&). The E and D versions of this routine have the added feature that if the 'decimals' parameter is negative, then the 'G' display format rather then the 'E' format will be used when constructing the keyword value, taking the absolute value of 'decimals' for the precision. This will suppress trailing zeros, and will use a fixed format rather than an exponential format, > depending on the magnitude of the value. - FTMKY[JKLS](unit,keyword,keyval,comment, > status) FTMKLS(unit,keyword,keyval,comment, > status) FTMKY[EDFG](unit,keyword,keyval,decimals,comment, > status) - >6 Modify the value of an existing keyword to be undefined, or null. The value string of the keyword is set to blank. Optionally, one may leave the comment field unchanged by setting the > input COMMENT parameter equal to the ampersand character (\&). - FTMKYU(unit,keyword,comment, > status) - ***7. Update Keyword Subroutines \label{FTUCRD} >1 Update an 80-character record in the CHU. If the specified keyword already exists then that header record will be replaced with the input CARD string. If it does not exist then the new record will be added to the header. The FTUKLS subroutine works the same as the FTUKYS subroutine, except > it also supports long string values greater than 68 characters in length. - FTUCRD(unit,keyword,card, > status) - >2 Update the value and comment fields of a keyword in the CHU. The specified keyword is modified if it already exists (by calling FTMKYx) otherwise a new keyword is created by calling FTPKYx. The E and D versions of this routine have the added feature that if the 'decimals' parameter is negative, then the 'G' display format rather then the 'E' format will be used when constructing the keyword value, taking the absolute value of 'decimals' for the precision. This will suppress trailing zeros, and will use a fixed format rather than an exponential format, > depending on the magnitude of the value. - FTUKY[JKLS](unit,keyword,keyval,comment, > status) FTUKLS(unit,keyword,keyval,comment, > status) FTUKY[EDFG](unit,keyword,keyval,decimals,comment, > status) - >3 Update the value of an existing keyword to be undefined, or null, or insert a new undefined-value keyword if it doesn't already exist. > The value string of the keyword is left blank in this case. - FTUKYU(unit,keyword,comment, > status) - ***8. Delete Keyword Subroutines \label{FTDREC} >1 Delete an existing keyword record. The space previously occupied by the keyword is reclaimed by moving all the following header records up one row in the header. The first routine deletes a keyword at a specified position in the header (the first keyword is at position 1), whereas the second routine deletes a specifically named keyword. Wild card characters, as described in the Read Keyword section, above, may be used when specifying the name of the keyword to be deleted > (be careful!). - FTDREC(unit,key_no, > status) FTDKEY(unit,keyword, > status) - **F. Data Scaling and Undefined Pixel Parameters \label{FTPSCL} These subroutines define or modify the internal parameters used by FITSIO to either scale the data or to represent undefined pixels. Generally FITSIO will scale the data according to the values of the BSCALE and BZERO (or TSCALn and TZEROn) keywords, however these subroutines may be used to override the keyword values. This may be useful when one wants to read or write the raw unscaled values in the FITS file. Similarly, FITSIO generally uses the value of the BLANK or TNULLn keyword to signify an undefined pixel, but these routines may be used to override this value. These subroutines do not create or modify the corresponding header keyword values. >1 Reset the scaling factors in the primary array or image extension; does not change the BSCALE and BZERO keyword values and only affects the automatic scaling performed when the data elements are written/read to/from the FITS file. When reading from a FITS file the returned data value = (the value given in the FITS array) * BSCALE + BZERO. The inverse formula is used when writing data values to the FITS file. (NOTE: BSCALE and BZERO must be declared as Double Precision > variables). - FTPSCL(unit,bscale,bzero, > status) - >2 Reset the scaling parameters for a table column; does not change the TSCALn or TZEROn keyword values and only affects the automatic scaling performed when the data elements are written/read to/from the FITS file. When reading from a FITS file the returned data value = (the value given in the FITS array) * TSCAL + TZERO. The inverse formula is used when writing data values to the FITS file. (NOTE: TSCAL and TZERO must be declared as Double Precision > variables). - FTTSCL(unit,colnum,tscal,tzero, > status) - >3 Define the integer value to be used to signify undefined pixels in the primary array or image extension. This is only used if BITPIX = 8, 16, 32. or 64 This does not create or change the value of the BLANK keyword in the header. FTPNULLL is identical to FTPNUL except that the blank > value is a 64-bit integer instead of a 32-bit integer. - FTPNUL(unit,blank, > status) FTPNULLL(unit,blankll, > status) - >4 Define the string to be used to signify undefined pixels in a column in an ASCII table. This does not create or change the value > of the TNULLn keyword. - FTSNUL(unit,colnum,snull > status) - >5 Define the value to be used to signify undefined pixels in an integer column in a binary table (where TFORMn = 'B', 'I', 'J', or 'K'). This does not create or change the value of the TNULLn keyword. FTTNULLL is identical to FTTNUL except that the tnull > value is a 64-bit integer instead of a 32-bit integer. - FTTNUL(unit,colnum,tnull > status) FTTNULLL(unit,colnum,tnullll > status) - **G. FITS Primary Array or IMAGE Extension I/O Subroutines \label{FTPPR} These subroutines put or get data values in the primary data array (i.e., the first HDU in the FITS file) or an IMAGE extension. The data array is represented as a single one-dimensional array of pixels regardless of the actual dimensionality of the array, and the FPIXEL parameter gives the position within this 1-D array of the first pixel to read or write. Automatic data type conversion is performed for numeric data (except for complex data types) if the data type of the primary array (defined by the BITPIX keyword) differs from the data type of the array in the calling subroutine. The data values are also scaled by the BSCALE and BZERO header values as they are being written or read from the FITS array. The ftpscl subroutine MUST be called to define the scaling parameters when writing data to the FITS array or to override the default scaling value given in the header when reading the FITS array. Two sets of subroutines are provided to read the data array which differ in the way undefined pixels are handled. The first set of routines (FTGPVx) simply return an array of data elements in which undefined pixels are set equal to a value specified by the user in the 'nullval' parameter. An additional feature of these subroutines is that if the user sets nullval = 0, then no checks for undefined pixels will be performed, thus increasing the speed of the program. The second set of routines (FTGPFx) returns the data element array and, in addition, a logical array which defines whether the corresponding data pixel is undefined. The latter set of subroutines may be more convenient to use in some circumstances, however, it requires an additional array of logical values which can be unwieldy when working with large data arrays. Also for programmer convenience, sets of subroutines to directly read or write 2 and 3 dimensional arrays have been provided, as well as a set of subroutines to read or write any contiguous rectangular subset of pixels within the n-dimensional array. >1 Get the data type of the image (= BITPIX value). Possible returned values are: 8, 16, 32, 64, -32, or -64 corresponding to unsigned byte, signed 2-byte integer, signed 4-byte integer, signed 8-byte integer, real, and double. The second subroutine is similar to FTGIDT, except that if the image pixel values are scaled, with non-default values for the BZERO and BSCALE keywords, then this routine will return the 'equivalent' data type that is needed to store the scaled values. For example, if BITPIX = 16 and BSCALE = 0.1 then the equivalent data type is floating point, and -32 will be returned. There are 2 special cases: if the image contains unsigned 2-byte integer values, with BITPIX = 16, BSCALE = 1, and BZERO = 32768, then this routine will return a non-standard value of 20 for the bitpix value. Similarly if the image contains unsigned 4-byte integers, then bitpix will > be returned with a value of 40. - FTGIDT(unit, > bitpix,status) FTGIET(unit, > bitpix,status) - >>2 Get the dimension (number of axes = NAXIS) of the image - FTGIDM(unit, > naxis,status) - >3 Get the size of all the dimensions of the image. The FTGISZLL > routine returns an array of 64-bit integers instead of 32-bit integers. - FTGISZ(unit, maxdim, > naxes,status) FTGISZLL(unit, maxdim, > naxesll,status) - >4 Get the parameters that define the type and size of the image. This routine simply combines calls to the above 3 routines. The FTGIPRLL > routine returns an array of 64-bit integers instead of 32-bit integers. - FTGIPR(unit, maxdim, > bitpix, naxis, naxes, int *status) FTGIPRLL(unit, maxdim, > bitpix, naxis, naxesll, int *status) - >>5 Put elements into the data array - FTPPR[BIJKED](unit,group,fpixel,nelements,values, > status) - >6 Put elements into the data array, substituting the appropriate FITS null value for all elements which are equal to the value of NULLVAL. For integer FITS arrays, the null value defined by the previous call to FTPNUL will be substituted; for floating point FITS arrays (BITPIX = -32 or -64) then the special IEEE NaN (Not-a-Number) value will be > substituted. - FTPPN[BIJKED](unit,group,fpixel,nelements,values,nullval > status) - >>7 Set data array elements as undefined - FTPPRU(unit,group,fpixel,nelements, > status) - >8 Get elements from the data array. Undefined array elements will be returned with a value = nullval, unless nullval = 0 in which case no > checks for undefined pixels will be performed. - FTGPV[BIJKED](unit,group,fpixel,nelements,nullval, > values,anyf,status) - >9 Get elements and nullflags from data array. Any undefined array elements will have the corresponding flagvals element > set equal to .TRUE. - FTGPF[BIJKED](unit,group,fpixel,nelements, > values,flagvals,anyf,status) - >>10 Put values into group parameters - FTPGP[BIJKED](unit,group,fparm,nparm,values, > status) - >>11 Get values from group parameters - FTGGP[BIJKED](unit,group,fparm,nparm, > values,status) - The following 4 subroutines transfer FITS images with 2 or 3 dimensions to or from a data array which has been declared in the calling program. The dimensionality of the FITS image is passed by the naxis1, naxis2, and naxis3 parameters and the declared dimensions of the program array are passed in the dim1 and dim2 parameters. Note that the program array does not have to have the same dimensions as the FITS array, but must be at least as big. For example if a FITS image with NAXIS1 = NAXIS2 = 400 is read into a program array which is dimensioned as 512 x 512 pixels, then the image will just fill the lower left corner of the array with pixels in the range 1 - 400 in the X an Y directions. This has the effect of taking a contiguous set of pixel value in the FITS array and writing them to a non-contiguous array in program memory (i.e., there are now some blank pixels around the edge of the image in the program array). >>11 Put 2-D image into the data array - FTP2D[BIJKED](unit,group,dim1,naxis1,naxis2,image, > status) - >>12 Put 3-D cube into the data array - FTP3D[BIJKED](unit,group,dim1,dim2,naxis1,naxis2,naxis3,cube, > status) - >13 Get 2-D image from the data array. Undefined pixels in the array will be set equal to the value of 'nullval', unless nullval=0 in which case no testing for undefined pixels will > be performed. - FTG2D[BIJKED](unit,group,nullval,dim1,naxis1,naxis2, > image,anyf,status) - >14 Get 3-D cube from the data array. Undefined pixels in the array will be set equal to the value of 'nullval', unless nullval=0 in which case no testing for undefined pixels will > be performed. - FTG3D[BIJKED](unit,group,nullval,dim1,dim2,naxis1,naxis2,naxis3, > cube,anyf,status) - The following subroutines transfer a rectangular subset of the pixels in a FITS N-dimensional image to or from an array which has been declared in the calling program. The fpixels and lpixels parameters are integer arrays which specify the starting and ending pixels in each dimension of the FITS image that are to be read or written. (Note that these are the starting and ending pixels in the FITS image, not in the declared array). The array parameter is treated simply as a large one-dimensional array of the appropriate datatype containing the pixel values; The pixel values in the FITS array are read/written from/to this program array in strict sequence without any gaps; it is up to the calling routine to correctly interpret the dimensionality of this array. The two families of FITS reading routines (FTGSVx and FTGSFx subroutines) also have an 'incs' parameter which defines the data sampling interval in each dimension of the FITS array. For example, if incs(1)=2 and incs(2)=3 when reading a 2-dimensional FITS image, then only every other pixel in the first dimension and every 3rd pixel in the second dimension will be returned in the 'array' parameter. [Note: the FTGSSx family of routines which were present in previous versions of FITSIO have been superseded by the more general FTGSVx family of routines.] >>15 Put an arbitrary data subsection into the data array. - FTPSS[BIJKED](unit,group,naxis,naxes,fpixels,lpixels,array, > status) - >16 Get an arbitrary data subsection from the data array. Undefined pixels in the array will be set equal to the value of 'nullval', unless nullval=0 in which case no testing for undefined pixels will > be performed. - FTGSV[BIJKED](unit,group,naxis,naxes,fpixels,lpixels,incs,nullval, > array,anyf,status) - >17 Get an arbitrary data subsection from the data array. Any Undefined pixels in the array will have the corresponding 'flagvals' > element set equal to .TRUE. - FTGSF[BIJKED](unit,group,naxis,naxes,fpixels,lpixels,incs, > array,flagvals,anyf,status) - **H. FITS ASCII and Binary Table Data I/O Subroutines ***1. Column Information Subroutines \label{FTGCNO} >1 Get the number of rows or columns in the current FITS table. The number of rows is given by the NAXIS2 keyword and the number of columns is given by the TFIELDS keyword in the header of the table. The FTGNRWLL routine is identical to FTGNRW except that the number of rows is returned as a 64-bit integer rather > than a 32-bit integer. - FTGNRW(unit, > nrows, status) FTGNRWLL(unit, > nrowsll, status) FTGNCL(unit, > ncols, status) - >2 Get the table column number (and name) of the column whose name matches an input template name. The table column names are defined by the TTYPEn keywords in the FITS header. If a column does not have a TTYPEn keyword, then these routines assume that the name consists of all blank characters. These 2 subroutines perform the same function except that FTGCNO only returns the number of the matching column whereas FTGCNN also returns the name of the column. If CASESEN = .true. then the column name match will be case-sensitive. The input column name template (COLTEMPLATE) is (1) either the exact name of the column to be searched for, or (2) it may contain wild cards characters (*, ?, or \#), or (3) it may contain the number of the desired column (where the number is expressed as ASCII digits). The first 2 wild cards behave similarly to UNIX filename matching: the '*' character matches any sequence of characters (including zero characters) and the '?' character matches any single character. The \# wildcard will match any consecutive string of decimal digits (0-9). As an example, the template strings 'AB?DE', 'AB*E', and 'AB*CDE' will all match the string 'ABCDE'. If more than one column name in the table matches the template string, then the first match is returned and the status value will be set to 237 as a warning that a unique match was not found. To find the other cases that match the template, simply call the subroutine again leaving the input status value equal to 237 and the next matching name will then be returned. Repeat this process until a status = 219 (column name not found) is returned. If these subroutines fail to match the template to any of the columns in the table, they lastly check if the template can be interpreted as a simple positive integer (e.g., '7', or '512') and if so, they return that column number. If no matches are found then a status = 219 error is returned. Note that the FITS Standard recommends that only letters, digits, and the underscore character be used in column names (with no embedded >spaces in the name). Trailing blank characters are not significant. - FTGCNO(unit,casesen,coltemplate, > colnum,status) FTGCNN(unit,casesen,coltemplate, > colname,colnum,status) - >3 Get the datatype of a column in an ASCII or binary table. This routine returns an integer code value corresponding to the datatype of the column. (See the FTBNFM and FTASFM subroutines in the Utilities section of this document for a list of the code values). The vector repeat count (which is alway 1 for ASCII table columns) is also returned. If the specified column has an ASCII character datatype (code = 16) then the width of a unit string in the column is also returned. Note that this routine supports the local convention for specifying arrays of strings within a binary table character column, using the syntax TFORM = 'rAw' where 'r' is the total number of characters (= the width of the column) and 'w' is the width of a unit string within the column. Thus if the column has TFORM = '60A12' then this routine will return datacode = 16, repeat = 60, and width = 12. (The TDIMn keyword may also be used to specify the unit string length; The pair of keywords TFORMn = '60A' and TDIMn = '(12,5)' would have the same effect as TFORMn = '60A12'). The second routine, FTEQTY is similar except that in the case of scaled integer columns it returns the 'equivalent' data type that is needed to store the scaled values, and not necessarily the physical data type of the unscaled values as stored in the FITS table. For example if a '1I' column in a binary table has TSCALn = 1 and TZEROn = 32768, then this column effectively contains unsigned short integer values, and thus the returned value of typecode will be the code for an unsigned short integer, not a signed short integer. Similarly, if a column has TTYPEn = '1I' and TSCALn = 0.12, then the returned typecode > will be the code for a 'real' column. - FTGTCL(unit,colnum, > datacode,repeat,width,status) FTEQTY(unit,colnum, > datacode,repeat,width,status) - >4 Return the display width of a column. This is the length of the string that will be returned when reading the column as a formatted string. The display width is determined by the TDISPn keyword, if present, otherwise by the data > type of the column. - FTGCDW(unit, colnum, > dispwidth, status) - >5 Get information about an existing ASCII table column. (NOTE: TSCAL and TZERO must be declared as Double Precision variables). All the > returned parameters are scalar quantities. - FTGACL(unit,colnum, > ttype,tbcol,tunit,tform,tscal,tzero,snull,tdisp,status) - >6 Get information about an existing binary table column. (NOTE: TSCAL and TZERO must be declared as Double Precision variables). DATATYPE is a character string which returns the datatype of the column as defined by the TFORMn keyword (e.g., 'I', 'J','E', 'D', etc.). In the case of an ASCII character column, DATATYPE will have a value of the form 'An' where 'n' is an integer expressing the width of the field in characters. For example, if TFORM = '160A8' then FTGBCL will return DATATYPE='A8' and REPEAT=20. All the returned parameters are scalar > quantities. - FTGBCL(unit,colnum, > ttype,tunit,datatype,repeat,tscal,tzero,tnull,tdisp,status) - >7 Put (append) a TDIMn keyword whose value has the form '(l,m,n...)' where l, m, n... are the dimensions of a multidimensional array > column in a binary table. - FTPTDM(unit,colnum,naxis,naxes, > status) - >8 Return the number of and size of the dimensions of a table column. Normally this information is given by the TDIMn keyword, but if this keyword is not present then this routine returns NAXIS = 1 > and NAXES(1) equal to the repeat count in the TFORM keyword. - FTGTDM(unit,colnum,maxdim, > naxis,naxes,status) - >9 Decode the input TDIMn keyword string (e.g. '(100,200)') and return the number of and size of the dimensions of a binary table column. If the input tdimstr character string is null, then this routine returns naxis = 1 and naxes[0] equal to the repeat count in the TFORM keyword. This routine > is called by FTGTDM. - FTDTDM(unit,tdimstr,colnum,maxdim, > naxis,naxes, status) - >10 Return the optimal number of rows to read or write at one time for maximum I/O efficiency. Refer to the ``Optimizing Code'' section > in Chapter 5 for more discussion on how to use this routine. - FTGRSZ(unit, > nrows,status) - ***2. Low-Level Table Access Subroutines \label{FTGTBS} The following subroutines provide low-level access to the data in ASCII or binary tables and are mainly useful as an efficient way to copy all or part of a table from one location to another. These routines simply read or write the specified number of consecutive bytes in an ASCII or binary table, without regard for column boundaries or the row length in the table. The first two subroutines read or write consecutive bytes in a table to or from a character string variable, while the last two subroutines read or write consecutive bytes to or from a variable declared as a numeric data type (e.g., INTEGER, INTEGER*2, REAL, DOUBLE PRECISION). These routines do not perform any machine dependent data conversion or byte swapping, except that conversion to/from ASCII format is performed by the FTGTBS and FTPTBS routines on machines which do not use ASCII character codes in the internal data representations (e.g., on IBM mainframe computers). >1 Read a consecutive string of characters from an ASCII table into a character variable (spanning columns and multiple rows if necessary) This routine should not be used with binary tables because of > complications related to passing string variables between C and Fortran. - FTGTBS(unit,frow,startchar,nchars, > string,status) - >2 Write a consecutive string of characters to an ASCII table from a character variable (spanning columns and multiple rows if necessary) This routine should not be used with binary tables because of > complications related to passing string variables between C and Fortran. - FTPTBS(unit,frow,startchar,nchars,string, > status) - >3 Read a consecutive array of bytes from an ASCII or binary table into a numeric variable (spanning columns and multiple rows if necessary). The array parameter may be declared as any numerical datatype as long as the array is at least 'nchars' bytes long, e.g., if nchars = 17, > then declare the array as INTEGER*4 ARRAY(5). - FTGTBB(unit,frow,startchar,nchars, > array,status) - >4 Write a consecutive array of bytes to an ASCII or binary table from a numeric variable (spanning columns and multiple rows if necessary) The array parameter may be declared as any numerical datatype as long as the array is at least 'nchars' bytes long, e.g., if nchars = 17, > then declare the array as INTEGER*4 ARRAY(5). - FTPTBB(unit,frow,startchar,nchars,array, > status) - ***3. Edit Rows or Columns \label{FTIROW} >1 Insert blank rows into an existing ASCII or binary table (in the CDU). All the rows FOLLOWING row FROW are shifted down by NROWS rows. If FROW or FROWLL equals 0 then the blank rows are inserted at the beginning of the table. These routines modify the NAXIS2 keyword to reflect the new number of rows in the table. Note that it is *not* necessary to insert rows in a table before writing data to those rows (indeed, it would be inefficient to do so). Instead, one may simply write data to any row of the table, whether that > row of data already exists or not. - FTIROW(unit,frow,nrows, > status) FTIROWLL(unit,frowll,nrowsll, > status) - >2 Delete rows from an existing ASCII or binary table (in the CDU). The NROWS (or NROWSLL) is the number of rows are deleted, starting with row FROW (or FROWLL), and any remaining rows in the table are shifted up to fill in the space. These routines modify the NAXIS2 keyword to reflect the new number > of rows in the table. - FTDROW(unit,frow,nrows, > status) FTDROWLL(unit,frowll,nrowsll, > status) - >3 Delete a list of rows from an ASCII or binary table (in the CDU). In the first routine, 'rowrange' is a character string listing the rows or row ranges to delete (e.g., '2-4, 5, 8-9'). In the second routine, 'rowlist' is an integer array of row numbers to be deleted from the table. nrows is the number of row numbers in the list. The first row in the table is 1 not 0. The list of row numbers > must be sorted in ascending order. - FTDRRG(unit,rowrange, > status) FTDRWS(unit,rowlist,nrows, > status) - >4 Insert a blank column (or columns) into an existing ASCII or binary table (in the CDU). COLNUM specifies the column number that the (first) new column should occupy in the table. NCOLS specifies how many columns are to be inserted. Any existing columns from this position and higher are moved over to allow room for the new column(s). The index number on all the following keywords will be incremented if necessary to reflect the new position of the column(s) in the table: TBCOLn, TFORMn, TTYPEn, TUNITn, TNULLn, TSCALn, TZEROn, TDISPn, TDIMn, TLMINn, TLMAXn, TDMINn, TDMAXn, TCTYPn, TCRPXn, TCRVLn, TCDLTn, TCROTn, > and TCUNIn. - FTICOL(unit,colnum,ttype,tform, > status) FTICLS(unit,colnum,ncols,ttype,tform, > status) - >5 Modify the vector length of a binary table column (e.g., change a column from TFORMn = '1E' to '20E'). The vector > length may be increased or decreased from the current value. - FTMVEC(unit,colnum,newveclen, > status) - >6 Delete a column from an existing ASCII or binary table (in the CDU). The index number of all the keywords listed above (for FTICOL) will be decremented if necessary to reflect the new position of the column(s) in the table. Those index keywords that refer to the deleted column will also be deleted. Note that the physical size of the FITS file will not be reduced by this operation, and the empty FITS blocks if any > at the end of the file will be padded with zeros. - FTDCOL(unit,colnum, > status) - >7 Copy a column from one HDU to another (or to the same HDU). If createcol = TRUE, then a new column will be inserted in the output table, at position `outcolumn', otherwise the existing output column will be overwritten (in which case it must have a compatible datatype). > Note that the first column in a table is at colnum = 1. - FTCPCL(inunit,outunit,incolnum,outcolnum,createcol, > status); - ***4. Read and Write Column Data Routines \label{FTPCLS} These subroutines put or get data values in the current ASCII or Binary table extension. Automatic data type conversion is performed for numerical data types (B,I,J,E,D) if the data type of the column (defined by the TFORM keyword) differs from the data type of the calling subroutine. The data values are also scaled by the TSCALn and TZEROn header values as they are being written to or read from the FITS array. The fttscl subroutine MUST be used to define the scaling parameters when writing data to the table or to override the default scaling values given in the header when reading from the table. Note that it is *not* necessary to insert rows in a table before writing data to those rows (indeed, it would be inefficient to do so). Instead, one may simply write data to any row of the table, whether that row of data already exists or not. In the case of binary tables with vector elements, the 'felem' parameter defines the starting pixel within the element vector. This parameter is ignored with ASCII tables. Similarly, in the case of binary tables the 'nelements' parameter specifies the total number of vector values read or written (continuing on subsequent rows if required) and not the number of table elements. Two sets of subroutines are provided to get the column data which differ in the way undefined pixels are handled. The first set of routines (FTGCV) simply return an array of data elements in which undefined pixels are set equal to a value specified by the user in the 'nullval' parameter. An additional feature of these subroutines is that if the user sets nullval = 0, then no checks for undefined pixels will be performed, thus increasing the speed of the program. The second set of routines (FTGCF) returns the data element array and in addition a logical array of flags which defines whether the corresponding data pixel is undefined. Any column, regardless of it's intrinsic datatype, may be read as a string. It should be noted however that reading a numeric column as a string is 10 - 100 times slower than reading the same column as a number due to the large overhead in constructing the formatted strings. The display format of the returned strings will be determined by the TDISPn keyword, if it exists, otherwise by the datatype of the column. The length of the returned strings can be determined with the ftgcdw routine. The following TDISPn display formats are currently supported: - Iw.m Integer Ow.m Octal integer Zw.m Hexadecimal integer Fw.d Fixed floating point Ew.d Exponential floating point Dw.d Exponential floating point Gw.d General; uses Fw.d if significance not lost, else Ew.d - where w is the width in characters of the displayed values, m is the minimum number of digits displayed, and d is the number of digits to the right of the decimal. The .m field is optional. >1 Put elements into an ASCII or binary table column (in the CDU). (The SPP FSPCLS routine has an additional integer argument after the VALUES character string which specifies the size of the 1st dimension of this 2-D CHAR array). The alternate version of these routines, whose names end in 'LL' after the datatype character, support large tables with more then 2*31 rows. When calling these routines, the frow and felem parameters > *must* be 64-bit integer*8 variables, instead of normal 4-byte integers. - FTPCL[SLBIJKEDCM](unit,colnum,frow,felem,nelements,values, > status) FTPCL[LBIJKEDCM]LL(unit,colnum,frow,felem,nelements,values, > status) - >2 Put elements into an ASCII or binary table column (in the CDU) substituting the appropriate FITS null value for any elements that are equal to NULLVAL. For ASCII TABLE extensions, the null value defined by the previous call to FTSNUL will be substituted; For integer FITS columns, in a binary table the null value defined by the previous call to FTTNUL will be substituted; For floating point FITS columns a special IEEE NaN (Not-a-Number) value will be substituted. The alternate version of these routines, whose names end in 'LL' after the datatype character, support large tables with more then 2*31 rows. When calling these routines, the frow and felem parameters > *must* be 64-bit integer*8 variables, instead of normal 4-byte integers. - FTPCN[SBIJKED](unit,colnum,frow,felem,nelements,values,nullval > status) FTPCN[SBIJKED]LL(unit,colnum,(I*8) frow,(I*8) felem,nelements,values, nullval > status) - >3 Put bit values into a binary byte ('B') or bit ('X') table column (in the CDU). LRAY is an array of logical values corresponding to the sequence of bits to be written. If LRAY is true then the corresponding bit is set to 1, otherwise the bit is set to 0. Note that in the case of 'X' columns, FITSIO will write to all 8 bits of each byte whether they are formally valid or not. Thus if the column is defined as '4X', and one calls FTPCLX with fbit=1 and nbit=8, then all 8 bits will be written into the first byte (as opposed to writing the first 4 bits into the first row and then the next 4 bits into the next row), even though the last 4 bits of each byte are formally > not defined. - FTPCLX(unit,colnum,frow,fbit,nbit,lray, > status) - >>4 Set table elements in a column as undefined - FTPCLU(unit,colnum,frow,felem,nelements, > status) - >5 Get elements from an ASCII or binary table column (in the CDU). These routines return the values of the table column array elements. Undefined array elements will be returned with a value = nullval, unless nullval = 0 (or = ' ' for ftgcvs) in which case no checking for undefined values will be performed. The ANYF parameter is set to true if any of the returned elements are undefined. (Note: the ftgcl routine simple gets an array of logical data values without any checks for undefined values; use the ftgcfl routine to check for undefined logical elements). (The SPP FSGCVS routine has an additional integer argument after the VALUES character string which specifies the size of the 1st dimension of this 2-D CHAR array). The alternate version of these routines, whose names end in 'LL' after the datatype character, support large tables with more then 2*31 rows. When calling these routines, the frow and felem parameters > *must* be 64-bit integer*8 variables, instead of normal 4-byte integers. - FTGCL(unit,colnum,frow,felem,nelements, > values,status) FTGCV[SBIJKEDCM](unit,colnum,frow,felem,nelements,nullval, > values,anyf,status) FTGCV[BIJKEDCM]LL(unit,colnum,(I*8) frow, (I*8) felem, nelements, nullval, > values,anyf,status) - >6 Get elements and null flags from an ASCII or binary table column (in the CHDU). These routines return the values of the table column array elements. Any undefined array elements will have the corresponding flagvals element set equal to .TRUE. The ANYF parameter is set to true if any of the returned elements are undefined. (The SPP FSGCFS routine has an additional integer argument after the VALUES character string which specifies the size of the 1st dimension of this 2-D CHAR array). The alternate version of these routines, whose names end in 'LL' after the datatype character, support large tables with more then 2*31 rows. When calling these routines, the frow and felem parameters > *must* be 64-bit integer*8 variables, instead of normal 4-byte integers. - FTGCF[SLBIJKEDCM](unit,colnum,frow,felem,nelements, > values,flagvals,anyf,status) FTGCF[BIJKED]LL(unit,colnum, (I*8) frow, (I*8) felem,nelements, > values,flagvals,anyf,status) - >7 Get an arbitrary data subsection from an N-dimensional array in a binary table vector column. Undefined pixels in the array will be set equal to the value of 'nullval', unless nullval=0 in which case no testing for undefined pixels will be performed. The first and last rows in the table to be read are specified by fpixels(naxis+1) and lpixels(naxis+1), and hence are treated as the next higher dimension of the FITS N-dimensional array. The INCS parameter specifies the sampling interval in > each dimension between the data elements that will be returned. - FTGSV[BIJKED](unit,colnum,naxis,naxes,fpixels,lpixels,incs,nullval, > array,anyf,status) - >8 Get an arbitrary data subsection from an N-dimensional array in a binary table vector column. Any Undefined pixels in the array will have the corresponding 'flagvals' element set equal to .TRUE. The first and last rows in the table to be read are specified by fpixels(naxis+1) and lpixels(naxis+1), and hence are treated as the next higher dimension of the FITS N-dimensional array. The INCS parameter specifies the sampling interval in each dimension between the data elements that will be > returned. - FTGSF[BIJKED](unit,colnum,naxis,naxes,fpixels,lpixels,incs, > array,flagvals,anyf,status) - >9 Get bit values from a byte ('B') or bit (`X`) table column (in the CDU). LRAY is an array of logical values corresponding to the sequence of bits to be read. If LRAY is true then the corresponding bit was set to 1, otherwise the bit was set to 0. Note that in the case of 'X' columns, FITSIO will read all 8 bits of each byte whether they are formally valid or not. Thus if the column is defined as '4X', and one calls FTGCX with fbit=1 and nbit=8, then all 8 bits will be read from the first byte (as opposed to reading the first 4 bits from the first row and then the first 4 bits from the next row), even though the last 4 bits of > each byte are formally not defined. - FTGCX(unit,colnum,frow,fbit,nbit, > lray,status) - >10 Read any consecutive set of bits from an 'X' or 'B' column and interpret them as an unsigned n-bit integer. NBIT must be less than or equal to 16 when calling FTGCXI, and less than or equal to 32 when calling FTGCXJ; there is no limit on the value of NBIT for FTGCXD, but the returned double precision value only has 48 bits of precision on most 32-bit word machines. The NBITS bits are interpreted as an unsigned integer unless NBITS = 16 (in FTGCXI) or 32 (in FTGCXJ) in which case the string of bits are interpreted as 16-bit or 32-bit 2's complement signed integers. If NROWS is greater than 1 then the same set of bits will be read from sequential rows in the table starting with row FROW. Note that the numbering convention used here for the FBIT parameter adopts 1 for the first element of the > vector of bits; this is the Most Significant Bit of the integer value. - FTGCX[IJD](unit,colnum,frow,nrows,fbit,nbit, > array,status) - >11 Get the descriptor for a variable length column in a binary table. The descriptor consists of 2 integer parameters: the number of elements in the array and the starting offset relative to the start of the heap. The first routine returns a single descriptor whereas the second routine > returns the descriptors for a range of rows in the table. - FTGDES(unit,colnum,rownum, > nelements,offset,status) FTGDESLL(unit,colnum,rownum, > nelementsll,offsetll,status) FTGDESS(unit,colnum,firstrow,nrows > nelements,offset, status) FTGDESSLL(unit,colnum,firstrow,nrows > nelementsll,offsetll, status) - >12 Write the descriptor for a variable length column in a binary table. These subroutines can be used in conjunction with FTGDES to enable 2 or more arrays to point to the same storage location to save > storage space if the arrays are identical. - FTPDES(unit,colnum,rownum,nelements,offset, > status) FTPDESLL(unit,colnum,rownum,nelementsll,offsetll, > status) - **I. Row Selection and Calculator Routines \label{FTFROW} These routines all parse and evaluate an input string containing a user defined arithmetic expression. The first 3 routines select rows in a FITS table, based on whether the expression evaluates to true (not equal to zero) or false (zero). The other routines evaluate the expression and calculate a value for each row of the table. The allowed expression syntax is described in the row filter section in the earlier `Extended File Name Syntax' chapter of this document. The expression may also be written to a text file, and the name of the file, prepended with a '@' character may be supplied for the 'expr' parameter (e.g. '@filename.txt'). The expression in the file can be arbitrarily complex and extend over multiple lines of the file. Lines that begin with 2 slash characters ('//') will be ignored and may be used to add comments to the file. >1 Evaluate a boolean expression over the indicated rows, returning an > array of flags indicating which rows evaluated to TRUE/FALSE - FTFROW(unit,expr,firstrow, nrows, > n_good_rows, row_status, status) - >>2 Find the first row which satisfies the input boolean expression - FTFFRW(unit, expr, > rownum, status) - >3 Evaluate an expression on all rows of a table. If the input and output files are not the same, copy the TRUE rows to the output file; if the output table is not empty, then this routine will append the new selected rows after the existing rows. If the >files are the same, delete the FALSE rows (preserve the TRUE rows). - FTSROW(inunit, outunit, expr, > status) - >4 Calculate an expression for the indicated rows of a table, returning the results, cast as datatype (TSHORT, TDOUBLE, etc), in array. If nulval==NULL, UNDEFs will be zeroed out. For vector results, the number of elements returned may be less than nelements if nelements is not an even multiple of the result dimension. Call FTTEXP to obtain >the dimensions of the results. - FTCROW(unit,datatype,expr,firstrow,nelements,nulval, > array,anynul,status) - >5 Evaluate an expression and write the result either to a column (if the expression is a function of other columns in the table) or to a keyword (if the expression evaluates to a constant and is not a function of other columns in the table). In the former case, the parName parameter is the name of the column (which may or may not already exist) into which to write the results, and parInfo contains an optional TFORM keyword value if a new column is being created. If a TFORM value is not specified then a default format will be used, depending on the expression. If the expression evaluates to a constant, then the result will be written to the keyword name given by the parName parameter, and the parInfo parameter may be used to supply an optional comment for the keyword. If the keyword does not already exist, then the name of the keyword must be preceded with a '\#' character, >otherwise the result will be written to a column with that name. - FTCALC(inunit, expr, outunit, parName, parInfo, > status) - >6 This calculator routine is similar to the previous routine, except that the expression is only evaluated over the specified row ranges. nranges specifies the number of row ranges, and firstrow >and lastrow give the starting and ending row number of each range. - FTCALC_RNG(inunit, expr, outunit, parName, parInfo, nranges, firstrow, lastrow, > status) - >7 Evaluate the given expression and return dimension and type information on the result. The returned dimensions correspond to a single row entry of the requested expression, and are equivalent to the result of fits\_read\_tdim(). Note that strings are considered to be one element regardless of string length. >If maxdim == 0, then naxes is optional. - FTTEXP(unit, expr, maxdim > datatype, nelem, naxis, naxes, status) - **J. Celestial Coordinate System Subroutines \label{FTGICS} The FITS community has adopted a set of keyword conventions that define the transformations needed to convert between pixel locations in an image and the corresponding celestial coordinates on the sky, or more generally, that define world coordinates that are to be associated with any pixel location in an n-dimensional FITS array. CFITSIO is distributed with a couple of self-contained World Coordinate System (WCS) routines, however, these routines DO NOT support all the latest WCS conventions, so it is STRONGLY RECOMMENDED that software developers use a more robust external WCS library. Several recommended libraries are: - WCSLIB - supported by Mark Calabretta WCSTools - supported by Doug Mink AST library - developed by the U.K. Starlink project - More information about the WCS keyword conventions and links to all of these WCS libraries can be found on the FITS Support Office web site at http://fits.gsfc.nasa.gov under the WCS link. The functions provided in these external WCS libraries will need access to the WCS information contained in the FITS file headers. One convenient way to pass this information to the external library is to use FITSIO to copy the header keywords into one long character string, and then pass this string to an interface routine in the external library that will extract the necessary WCS information (e.g., see the astFitsChan and astPutCards routines in the Starlink AST library). The following FITSIO routines DO NOT support the more recent WCS conventions that have been approved as part of the FITS standard. Consequently, the following routines ARE NOW DEPRECATED. It is STRONGLY RECOMMENDED that software developers not use these routines, and instead use an external WCS library, as described above. These routines are included mainly for backward compatibility with existing software. They support the following standard map projections: -SIN, -TAN, -ARC, -NCP, -GLS, -MER, and -AIT (these are the legal values for the coordtype parameter). These routines are based on similar functions in Classic AIPS. All the angular quantities are given in units of degrees. >1 Get the values of all the standard FITS celestial coordinate system keywords from the header of a FITS image (i.e., the primary array or an image extension). These values may then be passed to the subroutines that perform the coordinate transformations. If any or all of the WCS keywords are not present, then default values will be returned. If the first coordinate axis is the declination-like coordinate, then this routine will swap them so that the longitudinal-like coordinate is returned as the first axis. If the file uses the newer 'CDj\_i' WCS transformation matrix keywords instead of old style 'CDELTn' and 'CROTA2' keywords, then this routine will calculate and return the values of the equivalent old-style keywords. Note that the conversion from the new-style keywords to the old-style values is sometimes only an approximation, so if the approximation is larger than an internally defined threshold level, then CFITSIO will still return the approximate WCS keyword values, but will also return with status = 506, to warn the calling program that approximations have been made. It is then up to the calling program to decide whether the approximations are sufficiently accurate for the particular application, or whether more precise WCS transformations must be > performed using new-style WCS keywords directly. - FTGICS(unit, > xrval,yrval,xrpix,yrpix,xinc,yinc,rot,coordtype,status) - >2 Get the values of all the standard FITS celestial coordinate system keywords from the header of a FITS table where the X and Y (or RA and DEC coordinates are stored in 2 separate columns of the table. These values may then be passed to the subroutines that perform the > coordinate transformations. - FTGTCS(unit,xcol,ycol, > xrval,yrval,xrpix,yrpix,xinc,yinc,rot,coordtype,status) - >3 Calculate the celestial coordinate corresponding to the input > X and Y pixel location in the image. - FTWLDP(xpix,ypix,xrval,yrval,xrpix,yrpix,xinc,yinc,rot, coordtype, > xpos,ypos,status) - >4 Calculate the X and Y pixel location corresponding to the input > celestial coordinate in the image. - FTXYPX(xpos,ypos,xrval,yrval,xrpix,yrpix,xinc,yinc,rot, coordtype, > xpix,ypix,status) - **K. File Checksum Subroutines \label{FTPCKS} The following routines either compute or validate the checksums for the CHDU. The DATASUM keyword is used to store the numerical value of the 32-bit, 1's complement checksum for the data unit alone. If there is no data unit then the value is set to zero. The numerical value is stored as an ASCII string of digits, enclosed in quotes, because the value may be too large to represent as a 32-bit signed integer. The CHECKSUM keyword is used to store the ASCII encoded COMPLEMENT of the checksum for the entire HDU. Storing the complement, rather than the actual checksum, forces the checksum for the whole HDU to equal zero. If the file has been modified since the checksums were computed, then the HDU checksum will usually not equal zero. These checksum keyword conventions are based on a paper by Rob Seaman published in the proceedings of the ADASS IV conference in Baltimore in November 1994 and a later revision in June 1995. >1 Compute and write the DATASUM and CHECKSUM keyword values for the CHDU into the current header. The DATASUM value is the 32-bit checksum for the data unit, expressed as a decimal integer enclosed in single quotes. The CHECKSUM keyword value is a 16-character string which is the ASCII-encoded value for the complement of the checksum for the whole HDU. If these keywords already exist, their values will be updated only if necessary (i.e., if the file has been modified > since the original keyword values were computed). - FTPCKS(unit, > status) - >2 Update the CHECKSUM keyword value in the CHDU, assuming that the DATASUM keyword exists and already has the correct value. This routine calculates the new checksum for the current header unit, adds it to the data unit checksum, encodes the value into an ASCII string, and writes > the string to the CHECKSUM keyword. - FTUCKS(unit, > status) - >3 Verify the CHDU by computing the checksums and comparing them with the keywords. The data unit is verified correctly if the computed checksum equals the value of the DATASUM keyword. The checksum for the entire HDU (header plus data unit) is correct if it equals zero. The output DATAOK and HDUOK parameters in this subroutine are integers which will have a value = 1 if the data or HDU is verified correctly, a value = 0 if the DATASUM or CHECKSUM keyword is not present, or value = -1 > if the computed checksum is not correct. - FTVCKS(unit, > dataok,hduok,status) - >4 Compute and return the checksum values for the CHDU (as double precision variables) without creating or modifying the CHECKSUM and DATASUM keywords. This routine is used internally by > FTVCKS, but may be useful in other situations as well. - FTGCKS(unit, > datasum,hdusum,status) - >5 Encode a checksum value (stored in a double precision variable) into a 16-character string. If COMPLEMENT = .true. then the 32-bit > sum value will be complemented before encoding. - FTESUM(sum,complement, > checksum) - >6 Decode a 16 character checksum string into a double precision value. If COMPLEMENT = .true. then the 32-bit sum value will be complemented > after decoding. - FTDSUM(checksum,complement, > sum) - **L. Date and Time Utility Routines \label{FTGSDT} The following routines help to construct or parse the FITS date/time strings. Starting in the year 2000, the FITS DATE keyword values (and the values of other `DATE-' keywords) must have the form 'YYYY-MM-DD' (date only) or 'YYYY-MM-DDThh:mm:ss.ddd...' (date and time) where the number of decimal places in the seconds value is optional. These times are in UTC. The older 'dd/mm/yy' date format may not be used for dates after 01 January 2000. >1 Get the current system date. The returned year has 4 digits > (1999, 2000, etc.) - FTGSDT( > day, month, year, status ) - >2 Get the current system date and time string ('YYYY-MM-DDThh:mm:ss'). The time will be in UTC/GMT if available, as indicated by a returned timeref value = 0. If the returned value of timeref = 1 then this indicates that it was not possible to convert the local time to UTC, and thus the local >time was returned. - FTGSTM(> datestr, timeref, status) - >3 Construct a date string from the input date values. If the year is between 1900 and 1998, inclusive, then the returned date string will have the old FITS format ('dd/mm/yy'), otherwise the date string will have the new FITS format ('YYYY-MM-DD'). Use FTTM2S instead > to always return a date string using the new FITS format. - FTDT2S( year, month, day, > datestr, status) - >4 Construct a new-format date + time string ('YYYY-MM-DDThh:mm:ss.ddd...'). If the year, month, and day values all = 0 then only the time is encoded with format 'hh:mm:ss.ddd...'. The decimals parameter specifies how many decimal places of fractional seconds to include in the string. If `decimals' > is negative, then only the date will be return ('YYYY-MM-DD'). - FTTM2S( year, month, day, hour, minute, second, decimals, > datestr, status) - >5 Return the date as read from the input string, where the string may be in either the old ('dd/mm/yy') or new ('YYYY-MM-DDThh:mm:ss' or >'YYYY-MM-DD') FITS format. - FTS2DT(datestr, > year, month, day, status) - >6 Return the date and time as read from the input string, where the string may be in either the old or new FITS format. The returned hours, minutes, and seconds values will be set to zero if the input string does not include the time ('dd/mm/yy' or 'YYYY-MM-DD') . Similarly, the returned year, month, and date values will be set to zero if the >date is not included in the input string ('hh:mm:ss.ddd...'). - FTS2TM(datestr, > year, month, day, hour, minute, second, status) - **M. General Utility Subroutines \label{FTGHAD} The following utility subroutines may be useful for certain applications: >>1 Return the starting byte address of the CHDU and the next HDU. - FTGHAD(iunit, > curaddr, nextaddr) - >>2 Convert a character string to uppercase (operates in place). - FTUPCH(string) - >3 Compare the input template string against the reference string to see if they match. The template string may contain wildcard characters: '*' will match any sequence of characters (including zero characters) and '?' will match any single character in the reference string. The '\#' character will match any consecutive string of decimal digits (0 - 9). If CASESN = .true. then the match will be case sensitive. The returned MATCH parameter will be .true. if the 2 strings match, and EXACT will be .true. if the match is exact (i.e., if no wildcard characters were used in the match). > Both strings must be 68 characters or less in length. - FTCMPS(str_template, string, casesen, > match, exact) - >4 Test that the keyword name contains only legal characters: A-Z,0-9, > hyphen, and underscore. - FTTKEY(keyword, > status) - >5 Test that the keyword record contains only legal printable ASCII > characters - FTTREC(card, > status) - >6 Test whether the current header contains any NULL (ASCII 0) characters. These characters are illegal in the header, but they will go undetected by most of the CFITSIO keyword header routines, because the null is interpreted as the normal end-of-string terminator. This routine returns the position of the first null character in the header, or zero if there are no nulls. For example a returned value of 110 would indicate that the first NULL is located in the 30th character of the second keyword in the header (recall that each header record is 80 characters long). Note that this is one of the few FITSIO routines in which the returned > value is not necessarily equal to the status value). - FTNCHK(unit, > status) - >7 Parse a header keyword record and return the name of the keyword and the length of the name. The keyword name normally occupies the first 8 characters of the record, except under the HIERARCH convention where the name can > be up to 70 characters in length. - FTGKNM(card, > keyname, keylength, staThe '\#' character will match any consecutive string of decimal digits (0 - 9). tus) - >8 Parse a header keyword record. This subroutine parses the input header record to return the value (as a character string) and comment strings. If the keyword has no value (columns 9-10 not equal to '= '), then the value string is returned blank and the comment string is set equal to column 9 - 80 of the > input string. - FTPSVC(card, > value,comment,status) - >9 Construct a properly formated 80-character header keyword record from the input keyword name, keyword value, and keyword comment strings. Hierarchical keyword names (e.g., "ESO TELE CAM") are supported. The value string may contain an integer, floating point, logical, or quoted character string (e.g., "12", "15.7", "T", > or "'NGC 1313'"). - FTMKKY(keyname, value, comment, > card, status) - >10 Construct a sequence keyword name (ROOT + nnn). This subroutine appends the sequence number to the root string to create > a keyword name (e.g., 'NAXIS' + 2 = 'NAXIS2') - FTKEYN(keyroot,seq_no, > keyword,status) - >11 Construct a sequence keyword name (n + ROOT). This subroutine concatenates the sequence number to the front of the > root string to create a keyword name (e.g., 1 + 'CTYP' = '1CTYP') - FTNKEY(seq_no,keyroot, > keyword,status) - >12 Determine the datatype of a keyword value string. This subroutine parses the keyword value string (usually columns 11-30 > of the header record) to determine its datatype. - FTDTYP(value, > dtype,status) - >13 Return the class of input header record. The record is classified into one of the following categories (the class values are defined in fitsio.h). Note that this is one of the few FITSIO > routines that does not return a status value. - Class Value Keywords TYP_STRUC_KEY 10 SIMPLE, BITPIX, NAXIS, NAXISn, EXTEND, BLOCKED, GROUPS, PCOUNT, GCOUNT, END XTENSION, TFIELDS, TTYPEn, TBCOLn, TFORMn, THEAP, and the first 4 COMMENT keywords in the primary array that define the FITS format. TYP_CMPRS_KEY 20 The keywords used in the compressed image or table format, including ZIMAGE, ZCMPTYPE, ZNAMEn, ZVALn, ZTILEn, ZBITPIX, ZNAXISn, ZSCALE, ZZERO, ZBLANK TYP_SCAL_KEY 30 BSCALE, BZERO, TSCALn, TZEROn TYP_NULL_KEY 40 BLANK, TNULLn TYP_DIM_KEY 50 TDIMn TYP_RANG_KEY 60 TLMINn, TLMAXn, TDMINn, TDMAXn, DATAMIN, DATAMAX TYP_UNIT_KEY 70 BUNIT, TUNITn TYP_DISP_KEY 80 TDISPn TYP_HDUID_KEY 90 EXTNAME, EXTVER, EXTLEVEL, HDUNAME, HDUVER, HDULEVEL TYP_CKSUM_KEY 100 CHECKSUM, DATASUM TYP_WCS_KEY 110 CTYPEn, CUNITn, CRVALn, CRPIXn, CROTAn, CDELTn CDj_is, PVj_ms, LONPOLEs, LATPOLEs TCTYPn, TCTYns, TCUNIn, TCUNns, TCRVLn, TCRVns, TCRPXn, TCRPks, TCDn_k, TCn_ks, TPVn_m, TPn_ms, TCDLTn, TCROTn jCTYPn, jCTYns, jCUNIn, jCUNns, jCRVLn, jCRVns, iCRPXn, iCRPns, jiCDn, jiCDns, jPVn_m, jPn_ms, jCDLTn, jCROTn (i,j,m,n are integers, s is any letter) TYP_REFSYS_KEY 120 EQUINOXs, EPOCH, MJD-OBSs, RADECSYS, RADESYSs TYP_COMM_KEY 130 COMMENT, HISTORY, (blank keyword) TYP_CONT_KEY 140 CONTINUE TYP_USER_KEY 150 all other keywords class = FTGKCL (char *card) - >14 Parse the 'TFORM' binary table column format string. This subroutine parses the input TFORM character string and returns the integer datatype code, the repeat count of the field, and, in the case of character string fields, the length of the unit string. The following datatype codes are returned (the negative of the value is returned > if the column contains variable-length arrays): - Datatype DATACODE value bit, X 1 byte, B 11 logical, L 14 ASCII character, A 16 short integer, I 21 integer, J 41 real, E 42 double precision, D 82 complex 83 double complex 163 FTBNFM(tform, > datacode,repeat,width,status) - >15 Parse the 'TFORM' keyword value that defines the column format in an ASCII table. This routine parses the input TFORM character string and returns the datatype code, the width of the column, and (if it is a floating point column) the number of decimal places to the right of the decimal point. The returned datatype codes are the same as for the binary table, listed above, with the following additional rules: integer columns that are between 1 and 4 characters wide are defined to be short integers (code = 21). Wider integer columns are defined to be regular integers (code = 41). Similarly, Fixed decimal point columns (with TFORM = 'Fw.d') are defined to be single precision reals (code = 42) if w is between 1 and 7 characters wide, inclusive. Wider 'F' columns will return a double precision data code (= 82). 'Ew.d' format columns will have datacode = 42, > and 'Dw.d' format columns will have datacode = 82. - FTASFM(tform, > datacode,width,decimals,status) - >16 Calculate the starting column positions and total ASCII table width based on the input array of ASCII table TFORM values. The SPACE input parameter defines how many blank spaces to leave between each column (it is recommended to have one space between columns for better human > readability). - FTGABC(tfields,tform,space, > rowlen,tbcol,status) - >17 Parse a template string and return a formatted 80-character string suitable for appending to (or deleting from) a FITS header file. This subroutine is useful for parsing lines from an ASCII template file and reformatting them into legal FITS header records. The formatted string may then be passed to the FTPREC, FTMCRD, or FTDKEY subroutines > to append or modify a FITS header record. - FTGTHD(template, > card,hdtype,status) - The input TEMPLATE character string generally should contain 3 tokens: (1) the KEYNAME, (2) the VALUE, and (3) the COMMENT string. The TEMPLATE string must adhere to the following format: >- The KEYNAME token must begin in columns 1-8 and be a maximum of 8 characters long. If the first 8 characters of the template line are blank then the remainder of the line is considered to be a FITS comment (with a blank keyword name). A legal FITS keyword name may only contain the characters A-Z, 0-9, and '-' (minus sign) and underscore. This subroutine will automatically convert any lowercase characters to uppercase in the output string. If KEYNAME = 'COMMENT' or 'HISTORY' then the remainder of the line is considered to be a FITS > COMMENT or HISTORY record, respectively. >- The VALUE token must be separated from the KEYNAME token by one or more spaces and/or an '=' character. The datatype of the VALUE token (numeric, logical, or character string) is automatically determined and the output CARD string is formatted accordingly. The value token may be forced to be interpreted as a string (e.g. if it is a string of numeric digits) by enclosing it in single quotes. If the value token is a character string that contains 1 or more embedded blank space characters or slash ('/') characters then the > entire character string must be enclosed in single quotes. >- The COMMENT token is optional, but if present must be separated from > the VALUE token by a blank space or a '/' character. >- One exception to the above rules is that if the first non-blank character in the template string is a minus sign ('-') followed by a single token, or a single token followed by an equal sign, then it is interpreted as the name of a keyword which is to be > deleted from the FITS header. >- The second exception is that if the template string starts with a minus sign and is followed by 2 tokens then the second token is interpreted as the new name for the keyword specified by first token. In this case the old keyword name (first token) is returned in characters 1-8 of the returned CARD string, and the new keyword name (the second token) is returned in characters 41-48 of the returned CARD string. These old and new names may then be passed to the FTMNAM subroutine which will change > the keyword name. The HDTYPE output parameter indicates how the returned CARD string should be interpreted: - hdtype interpretation ------ ------------------------------------------------- -2 Modify the name of the keyword given in CARD(1:8) to the new name given in CARD(41:48) -1 CARD(1:8) contains the name of a keyword to be deleted from the FITS header. 0 append the CARD string to the FITS header if the keyword does not already exist, otherwise update the value/comment if the keyword is already present in the header. 1 simply append this keyword to the FITS header (CARD is either a HISTORY or COMMENT keyword). 2 This is a FITS END record; it should not be written to the FITS header because FITSIO automatically appends the END record when the header is closed. - EXAMPLES: The following lines illustrate valid input template strings: - INTVAL 7 This is an integer keyword RVAL 34.6 / This is a floating point keyword EVAL=-12.45E-03 This is a floating point keyword in exponential notation lval F This is a boolean keyword This is a comment keyword with a blank keyword name SVAL1 = 'Hello world' / this is a string keyword SVAL2 '123.5' this is also a string keyword sval3 123+ / this is also a string keyword with the value '123+ ' # the following template line deletes the DATE keyword - DATE # the following template line modifies the NAME keyword to OBJECT - NAME OBJECT - >18 Parse the input string containing a list of rows or row ranges, and return integer arrays containing the first and last row in each range. For example, if rowlist = "3-5, 6, 8-9" then it will return numranges = 3, rangemin = 3, 6, 8 and rangemax = 5, 6, 9. At most, 'maxranges' number of ranges will be returned. 'maxrows' is the maximum number of rows in the table; any rows or ranges larger than this will be ignored. The rows must be specified in increasing order, and the ranges must not overlap. A minus sign may be use to specify all the rows to the upper or lower bound, so "50-" means all the rows from 50 to the end of the table, and "-" > means all the rows in the table, from 1 - maxrows. - FTRWRG(rowlist, maxrows, maxranges, > numranges, rangemin, rangemax, status) - *VI. The CFITSIO Iterator Function The fits\_iterate\_data function in CFITSIO provides a unique method of executing an arbitrary user-supplied `work' function that operates on rows of data in FITS tables or on pixels in FITS images. Rather than explicitly reading and writing the FITS images or columns of data, one instead calls the CFITSIO iterator routine, passing to it the name of the user's work function that is to be executed along with a list of all the table columns or image arrays that are to be passed to the work function. The CFITSIO iterator function then does all the work of allocating memory for the arrays, reading the input data from the FITS file, passing them to the work function, and then writing any output data back to the FITS file after the work function exits. Because it is often more efficient to process only a subset of the total table rows at one time, the iterator function can determine the optimum amount of data to pass in each iteration and repeatedly call the work function until the entire table been processed. For many applications this single CFITSIO iterator function can effectively replace all the other CFITSIO routines for reading or writing data in FITS images or tables. Using the iterator has several important advantages over the traditional method of reading and writing FITS data files: \begin{itemize} \item It cleanly separates the data I/O from the routine that operates on the data. This leads to a more modular and `object oriented' programming style. \item It simplifies the application program by eliminating the need to allocate memory for the data arrays and eliminates most of the calls to the CFITSIO routines that explicitly read and write the data. \item It ensures that the data are processed as efficiently as possible. This is especially important when processing tabular data since the iterator function will calculate the most efficient number of rows in the table to be passed at one time to the user's work function on each iteration. \item Makes it possible for larger projects to develop a library of work functions that all have a uniform calling sequence and are all independent of the details of the FITS file format. \end{itemize} There are basically 2 steps in using the CFITSIO iterator function. The first step is to design the work function itself which must have a prescribed set of input parameters. One of these parameters is a structure containing pointers to the arrays of data; the work function can perform any desired operations on these arrays and does not need to worry about how the input data were read from the file or how the output data get written back to the file. The second step is to design the driver routine that opens all the necessary FITS files and initializes the input parameters to the iterator function. The driver program calls the CFITSIO iterator function which then reads the data and passes it to the user's work function. Further details on using the iterator function can be found in the companion CFITSIO User's Guide, and in the iter\_a.f, iter\_b.f and iter\_c.f example programs. *IV. Extended File Name Syntax **A. Overview CFITSIO supports an extended syntax when specifying the name of the data file to be opened or created that includes the following features: \begin{itemize} \item CFITSIO can read IRAF format images which have header file names that end with the '.imh' extension, as well as reading and writing FITS files, This feature is implemented in CFITSIO by first converting the IRAF image into a temporary FITS format file in memory, then opening the FITS file. Any of the usual CFITSIO routines then may be used to read the image header or data. Similarly, raw binary data arrays can be read by converting them on the fly into virtual FITS images. \item FITS files on the Internet can be read (and sometimes written) using the FTP, HTTP, or ROOT protocols. \item FITS files can be piped between tasks on the stdin and stdout streams. \item FITS files can be read and written in shared memory. This can potentially achieve much better data I/O performance compared to reading and writing the same FITS files on magnetic disk. \item Compressed FITS files in gzip or Unix COMPRESS format can be directly read. \item Output FITS files can be written directly in compressed gzip format, thus saving disk space. \item FITS table columns can be created, modified, or deleted 'on-the-fly' as the table is opened by CFITSIO. This creates a virtual FITS file containing the modifications that is then opened by the application program. \item Table rows may be selected, or filtered out, on the fly when the table is opened by CFITSIO, based on an arbitrary user-specified expression. Only rows for which the expression evaluates to 'TRUE' are retained in the copy of the table that is opened by the application program. \item Histogram images may be created on the fly by binning the values in table columns, resulting in a virtual N-dimensional FITS image. The application program then only sees the FITS image (in the primary array) instead of the original FITS table. \end{itemize} The latter 3 features in particular add very powerful data processing capabilities directly into CFITSIO, and hence into every task that uses CFITSIO to read or write FITS files. For example, these features transform a very simple program that just copies an input FITS file to a new output file (like the `fitscopy' program that is distributed with CFITSIO) into a multipurpose FITS file processing tool. By appending fairly simple qualifiers onto the name of the input FITS file, the user can perform quite complex table editing operations (e.g., create new columns, or filter out rows in a table) or create FITS images by binning or histogramming the values in table columns. In addition, these functions have been coded using new state-of-the art algorithms that are, in some cases, 10 - 100 times faster than previous widely used implementations. Before describing the complete syntax for the extended FITS file names in the next section, here are a few examples of FITS file names that give a quick overview of the allowed syntax: \begin{itemize} \item {\tt 'myfile.fits'}: the simplest case of a FITS file on disk in the current directory. \item {\tt 'myfile.imh'}: opens an IRAF format image file and converts it on the fly into a temporary FITS format image in memory which can then be read with any other CFITSIO routine. \item {\tt rawfile.dat[i512,512]}: opens a raw binary data array (a 512 x 512 short integer array in this case) and converts it on the fly into a temporary FITS format image in memory which can then be read with any other CFITSIO routine. \item {\tt myfile.fits.gz}: if this is the name of a new output file, the '.gz' suffix will cause it to be compressed in gzip format when it is written to disk. \item {\tt 'myfile.fits.gz[events, 2]'}: opens and uncompresses the gzipped file myfile.fits then moves to the extension which has the keywords EXTNAME = 'EVENTS' and EXTVER = 2. \item {\tt '-'}: a dash (minus sign) signifies that the input file is to be read from the stdin file stream, or that the output file is to be written to the stdout stream. \item {\tt 'ftp://legacy.gsfc.nasa.gov/test/vela.fits'}: FITS files in any ftp archive site on the Internet may be directly opened with read-only access. \item {\tt 'http://legacy.gsfc.nasa.gov/software/test.fits'}: any valid URL to a FITS file on the Web may be opened with read-only access. \item {\tt 'root://legacy.gsfc.nasa.gov/test/vela.fits'}: similar to ftp access except that it provides write as well as read access to the files across the network. This uses the root protocol developed at CERN. \item {\tt 'shmem://h2[events]'}: opens the FITS file in a shared memory segment and moves to the EVENTS extension. \item {\tt 'mem://'}: creates a scratch output file in core computer memory. The resulting 'file' will disappear when the program exits, so this is mainly useful for testing purposes when one does not want a permanent copy of the output file. \item {\tt 'myfile.fits[3; Images(10)]'}: opens a copy of the image contained in the 10th row of the 'Images' column in the binary table in the 3th extension of the FITS file. The application just sees this single image as the primary array. \item {\tt 'myfile.fits[1:512:2, 1:512:2]'}: opens a section of the input image ranging from the 1st to the 512th pixel in X and Y, and selects every second pixel in both dimensions, resulting in a 256 x 256 pixel image in this case. \item {\tt 'myfile.fits[EVENTS][col Rad = sqrt(X**2 + Y**2)]'}: creates and opens a temporary file on the fly (in memory or on disk) that is identical to myfile.fits except that it will contain a new column in the EVENTS extension called 'Rad' whose value is computed using the indicated expression which is a function of the values in the X and Y columns. \item {\tt 'myfile.fits[EVENTS][PHA > 5]'}: creates and opens a temporary FITS files that is identical to 'myfile.fits' except that the EVENTS table will only contain the rows that have values of the PHA column greater than 5. In general, any arbitrary boolean expression using a C or Fortran-like syntax, which may combine AND and OR operators, may be used to select rows from a table. \item {\tt 'myfile.fits[EVENTS][bin (X,Y)=1,2048,4]'}: creates a temporary FITS primary array image which is computed on the fly by binning (i.e, computing the 2-dimensional histogram) of the values in the X and Y columns of the EVENTS extension. In this case the X and Y coordinates range from 1 to 2048 and the image pixel size is 4 units in both dimensions, so the resulting image is 512 x 512 pixels in size. \item The final example combines many of these feature into one complex expression (it is broken into several lines for clarity): - 'ftp://legacy.gsfc.nasa.gov/data/sample.fits.gz[EVENTS] [col phacorr = pha * 1.1 - 0.3][phacorr >= 5.0 && phacorr <= 14.0] [bin (X,Y)=32]' - In this case, CFITSIO (1) copies and uncompresses the FITS file from the ftp site on the legacy machine, (2) moves to the 'EVENTS' extension, (3) calculates a new column called 'phacorr', (4) selects the rows in the table that have phacorr in the range 5 to 14, and finally (5) bins the remaining rows on the X and Y column coordinates, using a pixel size = 32 to create a 2D image. All this processing is completely transparent to the application program, which simply sees the final 2-D image in the primary array of the opened file. \end{itemize} The full extended CFITSIO FITS file name can contain several different components depending on the context. These components are described in the following sections: - When creating a new file: filetype://BaseFilename(templateName) When opening an existing primary array or image HDU: filetype://BaseFilename(outName)[HDUlocation][ImageSection] When opening an existing table HDU: filetype://BaseFilename(outName)[HDUlocation][colFilter][rowFilter][binSpec] - The filetype, BaseFilename, outName, HDUlocation, and ImageSection components, if present, must be given in that order, but the colFilter, rowFilter, and binSpec specifiers may follow in any order. Regardless of the order, however, the colFilter specifier, if present, will be processed first by CFITSIO, followed by the rowFilter specifier, and finally by the binSpec specifier. **A. Filetype The type of file determines the medium on which the file is located (e.g., disk or network) and, hence, which internal device driver is used by CFITSIO to read and/or write the file. Currently supported types are - file:// - file on local magnetic disk (default) ftp:// - a readonly file accessed with the anonymous FTP protocol. It also supports ftp://username:password@hostname/... for accessing password-protected ftp sites. http:// - a readonly file accessed with the HTTP protocol. It supports username:password just like the ftp driver. Proxy HTTP servers are supported using the http_proxy environment variable (see following note). stream:// - special driver to read an input FITS file from the stdin stream, and/or write an output FITS file to the stdout stream. This driver is fragile and has limited functionality (see the following note). gsiftp:// - access files on a computational grid using the gridftp protocol in the Globus toolkit (see following note). root:// - uses the CERN root protocol for writing as well as reading files over the network. shmem:// - opens or creates a file which persists in the computer's shared memory. mem:// - opens a temporary file in core memory. The file disappears when the program exits so this is mainly useful for test purposes when a permanent output file is not desired. - If the filetype is not specified, then type file:// is assumed. The double slashes '//' are optional and may be omitted in most cases. ***1. Notes about HTTP proxy servers A proxy HTTP server may be used by defining the address (URL) and port number of the proxy server with the http\_proxy environment variable. For example - setenv http_proxy http://heasarc.gsfc.nasa.gov:3128 - will cause CFITSIO to use port 3128 on the heasarc proxy server whenever reading a FITS file with HTTP. ***2. Notes about the stream filetype driver The stream driver can be used to efficiently read a FITS file from the stdin file stream or write a FITS to the stdout file stream. However, because these input and output streams must be accessed sequentially, the FITS file reading or writing application must also read and write the file sequentially, at least within the tolerances described below. CFITSIO supports 2 different methods for accessing FITS files on the stdin and stdout streams. The original method, which is invoked by specifying a dash character, "-", as the name of the file when opening or creating it, works by storing a complete copy of the entire FITS file in memory. In this case, when reading from stdin, CFITSIO will copy the entire stream into memory before doing any processing of the file. Similarly, when writing to stdout, CFITSIO will create a copy of the entire FITS file in memory, before finally flushing it out to the stdout stream when the FITS file is closed. Buffering the entire FITS file in this way allows the application to randomly access any part of the FITS file, in any order, but it also requires that the user have sufficient available memory (or virtual memory) to store the entire file, which may not be possible in the case of very large files. The newer stream filetype provides a more memory-efficient method of accessing FITS files on the stdin or stdout streams. Instead of storing a copy of the entire FITS file in memory, CFITSIO only uses a set of internal buffer which by default can store 40 FITS blocks, or about 100K bytes of the FITS file. The application program must process the FITS file sequentially from beginning to end, within this 100K buffer. Generally speaking the application program must conform to the following restrictions: \begin{itemize} \item The program must finish reading or writing the header keywords before reading or writing any data in the HDU. \item The HDU can contain at most about 1400 header keywords. This is the maximum that can fit in the nominal 40 FITS block buffer. In principle, this limit could be increased by recompiling CFITSIO with a larger buffer limit, which is set by the NIOBUF parameter in fitsio2.h. \item The program must read or write the data in a sequential manner from the beginning to the end of the HDU. Note that CFITSIO's internal 100K buffer allows a little latitude in meeting this requirement. \item The program cannot move back to a previous HDU in the FITS file. \item Reading or writing of variable length array columns in binary tables is not supported on streams, because this requires moving back and forth between the fixed-length portion of the binary table and the following heap area where the arrays are actually stored. \item Reading or writing of tile-compressed images is not supported on streams, because the images are internally stored using variable length arrays. \end{itemize} ***3. Notes about the gsiftp filetype DEPENDENCIES: Globus toolkit (2.4.3 or higher) (GT) should be installed. There are two different ways to install GT: 1) goto the globus toolkit web page www.globus.org and follow the download and compilation instructions; 2) goto the Virtual Data Toolkit web page http://vdt.cs.wisc.edu/ and follow the instructions (STRONGLY SUGGESTED); Once a globus client has been installed in your system with a specific flavour it is possible to compile and install the CFITSIO libraries. Specific configuration flags must be used: 1) --with-gsiftp[[=PATH]] Enable Globus Toolkit gsiftp protocol support PATH=GLOBUS\_LOCATION i.e. the location of your globus installation 2) --with-gsiftp-flavour[[=PATH] defines the specific Globus flavour ex. gcc32 Both the flags must be used and it is mandatory to set both the PATH and the flavour. USAGE: To access files on a gridftp server it is necessary to use a gsiftp prefix: example: gsiftp://remote\_server\_fqhn/directory/filename The gridftp driver uses a local buffer on a temporary file the file is located in the /tmp directory. If you have special permissions on /tmp or you do not have a /tmp directory, it is possible to force another location setting the GSIFTP\_TMPFILE environment variable (ex. export GSIFTP\_TMPFILE=/your/location/yourtmpfile). Grid FTP supports multi channel transfer. By default a single channel transmission is available. However, it is possible to modify this behavior setting the GSIFTP\_STREAMS environment variable (ex. export GSIFTP\_STREAMS=8). ***4. Notes about the root filetype The original rootd server can be obtained from: \verb-ftp://root.cern.ch/root/rootd.tar.gz- but, for it to work correctly with CFITSIO one has to use a modified version which supports a command to return the length of the file. This modified version is available in rootd subdirectory in the CFITSIO ftp area at - ftp://legacy.gsfc.nasa.gov/software/fitsio/c/root/rootd.tar.gz. - This small server is started either by inetd when a client requests a connection to a rootd server or by hand (i.e. from the command line). The rootd server works with the ROOT TNetFile class. It allows remote access to ROOT database files in either read or write mode. By default TNetFile assumes port 432 (which requires rootd to be started as root). To run rootd via inetd add the following line to /etc/services: - rootd 432/tcp - and to /etc/inetd.conf, add the following line: - rootd stream tcp nowait root /user/rdm/root/bin/rootd rootd -i - Force inetd to reread its conf file with "kill -HUP ". You can also start rootd by hand running directly under your private account (no root system privileges needed). For example to start rootd listening on port 5151 just type: \verb+rootd -p 5151+ Notice: no \& is needed. Rootd will go into background by itself. - Rootd arguments: -i says we were started by inetd -p port# specifies a different port to listen on -d level level of debug info written to syslog 0 = no debug (default) 1 = minimum 2 = medium 3 = maximum - Rootd can also be configured for anonymous usage (like anonymous ftp). To setup rootd to accept anonymous logins do the following (while being logged in as root): - - Add the following line to /etc/passwd: rootd:*:71:72:Anonymous rootd:/var/spool/rootd:/bin/false where you may modify the uid, gid (71, 72) and the home directory to suite your system. - Add the following line to /etc/group: rootd:*:72:rootd where the gid must match the gid in /etc/passwd. - Create the directories: mkdir /var/spool/rootd mkdir /var/spool/rootd/tmp chmod 777 /var/spool/rootd/tmp Where /var/spool/rootd must match the rootd home directory as specified in the rootd /etc/passwd entry. - To make writeable directories for anonymous do, for example: mkdir /var/spool/rootd/pub chown rootd:rootd /var/spool/rootd/pub - That's all. Several additional remarks: you can login to an anonymous server either with the names "anonymous" or "rootd". The password should be of type user@host.do.main. Only the @ is enforced for the time being. In anonymous mode the top of the file tree is set to the rootd home directory, therefore only files below the home directory can be accessed. Anonymous mode only works when the server is started via inetd. ***5. Notes about the shmem filetype: Shared memory files are currently supported on most Unix platforms, where the shared memory segments are managed by the operating system kernel and `live' independently of processes. They are not deleted (by default) when the process which created them terminates, although they will disappear if the system is rebooted. Applications can create shared memory files in CFITSIO by calling: - fit_create_file(&fitsfileptr, "shmem://h2", &status); - where the root `file' names are currently restricted to be 'h0', 'h1', 'h2', 'h3', etc., up to a maximum number defined by the the value of SHARED\_MAXSEG (equal to 16 by default). This is a prototype implementation of the shared memory interface and a more robust interface, which will have fewer restrictions on the number of files and on their names, may be developed in the future. When opening an already existing FITS file in shared memory one calls the usual CFITSIO routine: - fits_open_file(&fitsfileptr, "shmem://h7", mode, &status) - The file mode can be READWRITE or READONLY just as with disk files. More than one process can operate on READONLY mode files at the same time. CFITSIO supports proper file locking (both in READONLY and READWRITE modes), so calls to fits\_open\_file may be locked out until another other process closes the file. When an application is finished accessing a FITS file in a shared memory segment, it may close it (and the file will remain in the system) with fits\_close\_file, or delete it with fits\_delete\_file. Physical deletion is postponed until the last process calls ffclos/ffdelt. fits\_delete\_file tries to obtain a READWRITE lock on the file to be deleted, thus it can be blocked if the object was not opened in READWRITE mode. A shared memory management utility program called `smem', is included with the CFITSIO distribution. It can be built by typing `make smem'; then type `smem -h' to get a list of valid options. Executing smem without any options causes it to list all the shared memory segments currently residing in the system and managed by the shared memory driver. To get a list of all the shared memory objects, run the system utility program `ipcs [-a]'. **B. Base Filename The base filename is the name of the file optionally including the director/subdirectory path, and in the case of `ftp', `http', and `root' filetypes, the machine identifier. Examples: - myfile.fits !data.fits /data/myfile.fits fits.gsfc.nasa.gov/ftp/sampledata/myfile.fits.gz - When creating a new output file on magnetic disk (of type file://) if the base filename begins with an exclamation point (!) then any existing file with that same basename will be deleted prior to creating the new FITS file. Otherwise if the file to be created already exists, then CFITSIO will return an error and will not overwrite the existing file. Note that the exclamation point, '!', is a special UNIX character, so if it is used on the command line rather than entered at a task prompt, it must be preceded by a backslash to force the UNIX shell to pass it verbatim to the application program. If the output disk file name ends with the suffix '.gz', then CFITSIO will compress the file using the gzip compression algorithm before writing it to disk. This can reduce the amount of disk space used by the file. Note that this feature requires that the uncompressed file be constructed in memory before it is compressed and written to disk, so it can fail if there is insufficient available memory. An input FITS file may be compressed with the gzip or Unix compress algorithms, in which case CFITSIO will uncompress the file on the fly into a temporary file (in memory or on disk). Compressed files may only be opened with read-only permission. When specifying the name of a compressed FITS file it is not necessary to append the file suffix (e.g., `.gz' or `.Z'). If CFITSIO cannot find the input file name without the suffix, then it will automatically search for a compressed file with the same root name. In the case of reading ftp and http type files, CFITSIO generally looks for a compressed version of the file first, before trying to open the uncompressed file. By default, CFITSIO copies (and uncompressed if necessary) the ftp or http FITS file into memory on the local machine before opening it. This will fail if the local machine does not have enough memory to hold the whole FITS file, so in this case, the output filename specifier (see the next section) can be used to further control how CFITSIO reads ftp and http files. If the input file is an IRAF image file (*.imh file) then CFITSIO will automatically convert it on the fly into a virtual FITS image before it is opened by the application program. IRAF images can only be opened with READONLY file access. Similarly, if the input file is a raw binary data array, then CFITSIO will convert it on the fly into a virtual FITS image with the basic set of required header keywords before it is opened by the application program (with READONLY access). In this case the data type and dimensions of the image must be specified in square brackets following the filename (e.g. rawfile.dat[ib512,512]). The first character (case insensitive) defines the datatype of the array: - b 8-bit unsigned byte i 16-bit signed integer u 16-bit unsigned integer j 32-bit signed integer r or f 32-bit floating point d 64-bit floating point - An optional second character specifies the byte order of the array values: b or B indicates big endian (as in FITS files and the native format of SUN UNIX workstations and Mac PCs) and l or L indicates little endian (native format of DEC OSF workstations and IBM PCs). If this character is omitted then the array is assumed to have the native byte order of the local machine. These datatype characters are then followed by a series of one or more integer values separated by commas which define the size of each dimension of the raw array. Arrays with up to 5 dimensions are currently supported. Finally, a byte offset to the position of the first pixel in the data file may be specified by separating it with a ':' from the last dimension value. If omitted, it is assumed that the offset = 0. This parameter may be used to skip over any header information in the file that precedes the binary data. Further examples: - raw.dat[b10000] 1-dimensional 10000 pixel byte array raw.dat[rb400,400,12] 3-dimensional floating point big-endian array img.fits[ib512,512:2880] reads the 512 x 512 short integer array in a FITS file, skipping over the 2880 byte header - One special case of input file is where the filename = `-' (a dash or minus sign) or 'stdin' or 'stdout', which signifies that the input file is to be read from the stdin stream, or written to the stdout stream if a new output file is being created. In the case of reading from stdin, CFITSIO first copies the whole stream into a temporary FITS file (in memory or on disk), and subsequent reading of the FITS file occurs in this copy. When writing to stdout, CFITSIO first constructs the whole file in memory (since random access is required), then flushes it out to the stdout stream when the file is closed. In addition, if the output filename = '-.gz' or 'stdout.gz' then it will be gzip compressed before being written to stdout. This ability to read and write on the stdin and stdout steams allows FITS files to be piped between tasks in memory rather than having to create temporary intermediate FITS files on disk. For example if task1 creates an output FITS file, and task2 reads an input FITS file, the FITS file may be piped between the 2 tasks by specifying - task1 - | task2 - - where the vertical bar is the Unix piping symbol. This assumes that the 2 tasks read the name of the FITS file off of the command line. **C. Output File Name when Opening an Existing File An optional output filename may be specified in parentheses immediately following the base file name to be opened. This is mainly useful in those cases where CFITSIO creates a temporary copy of the input FITS file before it is opened and passed to the application program. This happens by default when opening a network FTP or HTTP-type file, when reading a compressed FITS file on a local disk, when reading from the stdin stream, or when a column filter, row filter, or binning specifier is included as part of the input file specification. By default this temporary file is created in memory. If there is not enough memory to create the file copy, then CFITSIO will exit with an error. In these cases one can force a permanent file to be created on disk, instead of a temporary file in memory, by supplying the name in parentheses immediately following the base file name. The output filename can include the '!' clobber flag. Thus, if the input filename to CFITSIO is: \verb+file1.fits.gz(file2.fits)+ then CFITSIO will uncompress `file1.fits.gz' into the local disk file `file2.fits' before opening it. CFITSIO does not automatically delete the output file, so it will still exist after the application program exits. In some cases, several different temporary FITS files will be created in sequence, for instance, if one opens a remote file using FTP, then filters rows in a binary table extension, then create an image by binning a pair of columns. In this case, the remote file will be copied to a temporary local file, then a second temporary file will be created containing the filtered rows of the table, and finally a third temporary file containing the binned image will be created. In cases like this where multiple files are created, the outfile specifier will be interpreted the name of the final file as described below, in descending priority: \begin{itemize} \item as the name of the final image file if an image within a single binary table cell is opened or if an image is created by binning a table column. \item as the name of the file containing the filtered table if a column filter and/or a row filter are specified. \item as the name of the local copy of the remote FTP or HTTP file. \item as the name of the uncompressed version of the FITS file, if a compressed FITS file on local disk has been opened. \item otherwise, the output filename is ignored. \end{itemize} The output file specifier is useful when reading FTP or HTTP-type FITS files since it can be used to create a local disk copy of the file that can be reused in the future. If the output file name = `*' then a local file with the same name as the network file will be created. Note that CFITSIO will behave differently depending on whether the remote file is compressed or not as shown by the following examples: \begin{itemize} \item `ftp://remote.machine/tmp/myfile.fits.gz(*)' - the remote compressed file is copied to the local compressed file `myfile.fits.gz', which is then uncompressed in local memory before being opened and passed to the application program. \item `ftp://remote.machine/tmp/myfile.fits.gz(myfile.fits)' - the remote compressed file is copied and uncompressed into the local file `myfile.fits'. This example requires less local memory than the previous example since the file is uncompressed on disk instead of in memory. \item `ftp://remote.machine/tmp/myfile.fits(myfile.fits.gz)' - this will usually produce an error since CFITSIO itself cannot compress files. \end{itemize} The exact behavior of CFITSIO in the latter case depends on the type of ftp server running on the remote machine and how it is configured. In some cases, if the file `myfile.fits.gz' exists on the remote machine, then the server will copy it to the local machine. In other cases the ftp server will automatically create and transmit a compressed version of the file if only the uncompressed version exists. This can get rather confusing, so users should use a certain amount of caution when using the output file specifier with FTP or HTTP file types, to make sure they get the behavior that they expect. **D. Template File Name when Creating a New File When a new FITS file is created with a call to fits\_create\_file, the name of a template file may be supplied in parentheses immediately following the name of the new file to be created. This template is used to define the structure of one or more HDUs in the new file. The template file may be another FITS file, in which case the newly created file will have exactly the same keywords in each HDU as in the template FITS file, but all the data units will be filled with zeros. The template file may also be an ASCII text file, where each line (in general) describes one FITS keyword record. The format of the ASCII template file is described below. **E. Image Tile-Compression Specification When specifying the name of the output FITS file to be created, the user can indicate that images should be written in tile-compressed format (see section 5.5, ``Primary Array or IMAGE Extension I/O Routines'') by enclosing the compression parameters in square brackets following the root disk file name. Here are some examples of the syntax for specifying tile-compressed output images: - myfile.fit[compress] - use Rice algorithm and default tile size myfile.fit[compress GZIP] - use the specified compression algorithm; myfile.fit[compress Rice] only the first letter of the algorithm myfile.fit[compress PLIO] name is required. myfile.fit[compress Rice 100,100] - use 100 x 100 pixel tile size myfile.fit[compress Rice 100,100;2] - as above, and use noisebits = 2 - **F. HDU Location Specification The optional HDU location specifier defines which HDU (Header-Data Unit, also known as an `extension') within the FITS file to initially open. It must immediately follow the base file name (or the output file name if present). If it is not specified then the first HDU (the primary array) is opened. The HDU location specifier is required if the colFilter, rowFilter, or binSpec specifiers are present, because the primary array is not a valid HDU for these operations. The HDU may be specified either by absolute position number, starting with 0 for the primary array, or by reference to the HDU name, and optionally, the version number and the HDU type of the desired extension. The location of an image within a single cell of a binary table may also be specified, as described below. The absolute position of the extension is specified either by enclosed the number in square brackets (e.g., `[1]' = the first extension following the primary array) or by preceded the number with a plus sign (`+1'). To specify the HDU by name, give the name of the desired HDU (the value of the EXTNAME or HDUNAME keyword) and optionally the extension version number (value of the EXTVER keyword) and the extension type (value of the XTENSION keyword: IMAGE, ASCII or TABLE, or BINTABLE), separated by commas and all enclosed in square brackets. If the value of EXTVER and XTENSION are not specified, then the first extension with the correct value of EXTNAME is opened. The extension name and type are not case sensitive, and the extension type may be abbreviated to a single letter (e.g., I = IMAGE extension or primary array, A or T = ASCII table extension, and B = binary table BINTABLE extension). If the HDU location specifier is equal to `[PRIMARY]' or `[P]', then the primary array (the first HDU) will be opened. FITS images are most commonly stored in the primary array or an image extension, but images can also be stored as a vector in a single cell of a binary table (i.e. each row of the vector column contains a different image). Such an image can be opened with CFITSIO by specifying the desired column name and the row number after the binary table HDU specifier as shown in the following examples. The column name is separated from the HDU specifier by a semicolon and the row number is enclosed in parentheses. In this case CFITSIO copies the image from the table cell into a temporary primary array before it is opened. The application program then just sees the image in the primary array, without any extensions. The particular row to be opened may be specified either by giving an absolute integer row number (starting with 1 for the first row), or by specifying a boolean expression that evaluates to TRUE for the desired row. The first row that satisfies the expression will be used. The row selection expression has the same syntax as described in the Row Filter Specifier section, below. Examples: - myfile.fits[3] - open the 3rd HDU following the primary array myfile.fits+3 - same as above, but using the FTOOLS-style notation myfile.fits[EVENTS] - open the extension that has EXTNAME = 'EVENTS' myfile.fits[EVENTS, 2] - same as above, but also requires EXTVER = 2 myfile.fits[events,2,b] - same, but also requires XTENSION = 'BINTABLE' myfile.fits[3; images(17)] - opens the image in row 17 of the 'images' column in the 3rd extension of the file. myfile.fits[3; images(exposure > 100)] - as above, but opens the image in the first row that has an 'exposure' column value greater than 100. - **G. Image Section A virtual file containing a rectangular subsection of an image can be extracted and opened by specifying the range of pixels (start:end) along each axis to be extracted from the original image. One can also specify an optional pixel increment (start:end:step) for each axis of the input image. A pixel step = 1 will be assumed if it is not specified. If the start pixel is larger then the end pixel, then the image will be flipped (producing a mirror image) along that dimension. An asterisk, '*', may be used to specify the entire range of an axis, and '-*' will flip the entire axis. The input image can be in the primary array, in an image extension, or contained in a vector cell of a binary table. In the later 2 cases the extension name or number must be specified before the image section specifier. Examples: - myfile.fits[1:512:2, 2:512:2] - open a 256x256 pixel image consisting of the odd numbered columns (1st axis) and the even numbered rows (2nd axis) of the image in the primary array of the file. myfile.fits[*, 512:256] - open an image consisting of all the columns in the input image, but only rows 256 through 512. The image will be flipped along the 2nd axis since the starting pixel is greater than the ending pixel. myfile.fits[*:2, 512:256:2] - same as above but keeping only every other row and column in the input image. myfile.fits[-*, *] - copy the entire image, flipping it along the first axis. myfile.fits[3][1:256,1:256] - opens a subsection of the image that is in the 3rd extension of the file. myfile.fits[4; images(12)][1:10,1:10] - open an image consisting of the first 10 pixels in both dimensions. The original image resides in the 12th row of the 'images' vector column in the table in the 4th extension of the file. - When CFITSIO opens an image section it first creates a temporary file containing the image section plus a copy of any other HDUs in the file. This temporary file is then opened by the application program, so it is not possible to write to or modify the input file when specifying an image section. Note that CFITSIO automatically updates the world coordinate system keywords in the header of the image section, if they exist, so that the coordinate associated with each pixel in the image section will be computed correctly. **H. Image Transform Filters CFITSIO can apply a user-specified mathematical function to the value of every pixel in a FITS image, thus creating a new virtual image in computer memory that is then opened and read by the application program. The original FITS image is not modified by this process. The image transformation specifier is appended to the input FITS file name and is enclosed in square brackets. It begins with the letters 'PIX' to distinguish it from other types of FITS file filters that are recognized by CFITSIO. The image transforming function may use any of the mathematical operators listed in the following 'Row Filtering Specification' section of this document. Some examples of image transform filters are: - [pix X * 2.0] - multiply each pixel by 2.0 [pix sqrt(X)] - take the square root of each pixel [pix X + #ZEROPT - add the value of the ZEROPT keyword [pix X>0 ? log10(X) : -99.] - if the pixel value is greater than 0, compute the base 10 log, else set the pixel = -99. - Use the letter 'X' in the expression to represent the current pixel value in the image. The expression is evaluated independently for each pixel in the image and may be a function of 1) the original pixel value, 2) the value of other pixels in the image at a given relative offset from the position of the pixel that is being evaluated, and 3) the value of any header keywords. Header keyword values are represented by the name of the keyword preceded by the '\#' sign. To access the the value of adjacent pixels in the image, specify the (1-D) offset from the current pixel in curly brackets. For example - [pix (x{-1} + x + x{+1}) / 3] - will replace each pixel value with the running mean of the values of that pixel and it's 2 neighboring pixels. Note that in this notation the image is treated as a 1-D array, where each row of the image (or higher dimensional cube) is appended one after another in one long array of pixels. It is possible to refer to pixels in the rows above or below the current pixel by using the value of the NAXIS1 header keyword. For example - [pix (x{-#NAXIS1} + x + x{#NAXIS1}) / 3] - will compute the mean of each image pixel and the pixels immediately above and below it in the adjacent rows of the image. The following more complex example creates a smoothed virtual image where each pixel is a 3 x 3 boxcar average of the input image pixels: - [pix (X + X{-1} + X{+1} + X{-#NAXIS1} + X{-#NAXIS1 - 1} + X{-#NAXIS1 + 1} + X{#NAXIS1} + X{#NAXIS1 - 1} + X{#NAXIS1 + 1}) / 9.] - If the pixel offset extends beyond the first or last pixel in the image, the function will evaluate to undefined, or NULL. For complex or commonly used image filtering operations, one can write the expression into an external text file and then import it into the filter using the syntax '[pix @filename.txt]'. The mathematical expression can extend over multiple lines of text in the file. Any lines in the external text file that begin with 2 slash characters ('//') will be ignored and may be used to add comments into the file. By default, the datatype of the resulting image will be the same as the original image, but one may force a different datatype by appended a code letter to the 'pix' keyword: - pixb - 8-bit byte image with BITPIX = 8 pixi - 16-bit integer image with BITPIX = 16 pixj - 32-bit integer image with BITPIX = 32 pixr - 32-bit float image with BITPIX = -32 pixd - 64-bit float image with BITPIX = -64 - Also by default, any other HDUs in the input file will be copied without change to the output virtual FITS file, but one may discard the other HDUs by adding the number '1' to the 'pix' keyword (and following any optional datatype code letter). For example: - myfile.fits[3][pixr1 sqrt(X)] - will create a virtual FITS file containing only a primary array image with 32-bit floating point pixels that have a value equal to the square root of the pixels in the image that is in the 3rd extension of the 'myfile.fits' file. **I. Column and Keyword Filtering Specification The optional column/keyword filtering specifier is used to modify the column structure and/or the header keywords in the HDU that was selected with the previous HDU location specifier. This filtering specifier must be enclosed in square brackets and can be distinguished from a general row filter specifier (described below) by the fact that it begins with the string 'col ' and is not immediately followed by an equals sign. The original file is not changed by this filtering operation, and instead the modifications are made on a copy of the input FITS file (usually in memory), which also contains a copy of all the other HDUs in the file. This temporary file is passed to the application program and will persist only until the file is closed or until the program exits, unless the outfile specifier (see above) is also supplied. The column/keyword filter can be used to perform the following operations. More than one operation may be specified by separating them with commas or semi-colons. \begin{itemize} \item Copy only a specified list of columns columns to the filtered input file. The list of column name should be separated by commas or semi-colons. Wild card characters may be used in the column names to match multiple columns. If the expression contains both a list of columns to be included and columns to be deleted, then all the columns in the original table except the explicitly deleted columns will appear in the filtered table (i.e., there is no need to explicitly list the columns to be included if any columns are being deleted). \item Delete a column or keyword by listing the name preceded by a minus sign or an exclamation mark (!), e.g., '-TIME' will delete the TIME column if it exists, otherwise the TIME keyword. An error is returned if neither a column nor keyword with this name exists. Note that the exclamation point, '!', is a special UNIX character, so if it is used on the command line rather than entered at a task prompt, it must be preceded by a backslash to force the UNIX shell to ignore it. \item Rename an existing column or keyword with the syntax 'NewName == OldName'. An error is returned if neither a column nor keyword with this name exists. \item Append a new column or keyword to the table. To create a column, give the new name, optionally followed by the datatype in parentheses, followed by a single equals sign and an expression to be used to compute the value (e.g., 'newcol(1J) = 0' will create a new 32-bit integer column called 'newcol' filled with zeros). The datatype is specified using the same syntax that is allowed for the value of the FITS TFORMn keyword (e.g., 'I', 'J', 'E', 'D', etc. for binary tables, and 'I8', F12.3', 'E20.12', etc. for ASCII tables). If the datatype is not specified then an appropriate datatype will be chosen depending on the form of the expression (may be a character string, logical, bit, long integer, or double column). An appropriate vector count (in the case of binary tables) will also be added if not explicitly specified. When creating a new keyword, the keyword name must be preceded by a pound sign '\#', and the expression must evaluate to a scalar (i.e., cannot have a column name in the expression). The comment string for the keyword may be specified in parentheses immediately following the keyword name (instead of supplying a datatype as in the case of creating a new column). If the keyword name ends with a pound sign '\#', then cfitsio will substitute the number of the most recently referenced column for the \# character . This is especially useful when writing a column-related keyword like TUNITn for a newly created column, as shown in the following examples. COMMENT and HISTORY keywords may also be created with the following syntax: - #COMMENT = 'This is a comment keyword' #HISTORY = 'This is a history keyword' - Note that the equal sign and the quote characters will be removed, so that the resulting header keywords in these cases will look like this: - COMMENT This is a comment keyword HISTORY This is a history keyword - These two special keywords are always appended to the end of the header and will not affect any previously existing COMMENT or HISTORY keywords. \item Recompute (overwrite) the values in an existing column or keyword by giving the name followed by an equals sign and an arithmetic expression. \end{itemize} The expression that is used when appending or recomputing columns or keywords can be arbitrarily complex and may be a function of other header keyword values and other columns (in the same row). The full syntax and available functions for the expression are described below in the row filter specification section. If the expression contains both a list of columns to be included and columns to be deleted, then all the columns in the original table except the explicitly deleted columns will appear in the filtered table. If no columns to be deleted are specified, then only the columns that are explicitly listed will be included in the filtered output table. To include all the columns, add the '*' wildcard specifier at the end of the list, as shown in the examples. For complex or commonly used operations, one can also place the operations into an external text file and import it into the column filter using the syntax '[col @filename.txt]'. The operations can extend over multiple lines of the file, but multiple operations must still be separated by commas or semi-colons. Any lines in the external text file that begin with 2 slash characters ('//') will be ignored and may be used to add comments into the file. Examples: - [col Time, rate] - only the Time and rate columns will appear in the filtered input file. [col Time, *raw] - include the Time column and any other columns whose name ends with 'raw'. [col -TIME; Good == STATUS] - deletes the TIME column and renames the status column to 'Good' [col PI=PHA * 1.1 + 0.2; #TUNIT#(column units) = 'counts';*] - creates new PI column from PHA values and also writes the TUNITn keyword for the new column. The final '*' expression means preserve all the columns in the input table in the virtual output table; without the '*' the output table would only contain the single 'PI' column. [col rate = rate/exposure, TUNIT#(&) = 'counts/s';*] - recomputes the rate column by dividing it by the EXPOSURE keyword value. This also modifies the value of the TUNITn keyword for this column. The use of the '&' character for the keyword comment string means preserve the existing comment string for that keyword. The final '*' preserves all the columns in the input table in the virtual output table. - **J. Row Filtering Specification When entering the name of a FITS table that is to be opened by a program, an optional row filter may be specified to select a subset of the rows in the table. A temporary new FITS file is created on the fly which contains only those rows for which the row filter expression evaluates to true. (The primary array and any other extensions in the input file are also copied to the temporary file). The original FITS file is closed and the new virtual file is opened by the application program. The row filter expression is enclosed in square brackets following the file name and extension name (e.g., 'file.fits[events][GRADE==50]' selects only those rows where the GRADE column value equals 50). When dealing with tables where each row has an associated time and/or 2D spatial position, the row filter expression can also be used to select rows based on the times in a Good Time Intervals (GTI) extension, or on spatial position as given in a SAO-style region file. ***1. General Syntax The row filtering expression can be an arbitrarily complex series of operations performed on constants, keyword values, and column data taken from the specified FITS TABLE extension. The expression must evaluate to a boolean value for each row of the table, where a value of FALSE means that the row will be excluded. For complex or commonly used filters, one can place the expression into a text file and import it into the row filter using the syntax '[@filename.txt]'. The expression can be arbitrarily complex and extend over multiple lines of the file. Any lines in the external text file that begin with 2 slash characters ('//') will be ignored and may be used to add comments into the file. Keyword and column data are referenced by name. Any string of characters not surrounded by quotes (ie, a constant string) or followed by an open parentheses (ie, a function name) will be initially interpreted as a column name and its contents for the current row inserted into the expression. If no such column exists, a keyword of that name will be searched for and its value used, if found. To force the name to be interpreted as a keyword (in case there is both a column and keyword with the same name), precede the keyword name with a single pound sign, '\#', as in '\#NAXIS2'. Due to the generalities of FITS column and keyword names, if the column or keyword name contains a space or a character which might appear as an arithmetic term then enclose the name in '\$' characters as in \$MAX PHA\$ or \#\$MAX-PHA\$. Names are case insensitive. To access a table entry in a row other than the current one, follow the column's name with a row offset within curly braces. For example, 'PHA\{-3\}' will evaluate to the value of column PHA, 3 rows above the row currently being processed. One cannot specify an absolute row number, only a relative offset. Rows that fall outside the table will be treated as undefined, or NULLs. Boolean operators can be used in the expression in either their Fortran or C forms. The following boolean operators are available: - "equal" .eq. .EQ. == "not equal" .ne. .NE. != "less than" .lt. .LT. < "less than/equal" .le. .LE. <= =< "greater than" .gt. .GT. > "greater than/equal" .ge. .GE. >= => "or" .or. .OR. || "and" .and. .AND. && "negation" .not. .NOT. ! "approx. equal(1e-7)" ~ - Note that the exclamation point, '!', is a special UNIX character, so if it is used on the command line rather than entered at a task prompt, it must be preceded by a backslash to force the UNIX shell to ignore it. The expression may also include arithmetic operators and functions. Trigonometric functions use radians, not degrees. The following arithmetic operators and functions can be used in the expression (function names are case insensitive). A null value will be returned in case of illegal operations such as divide by zero, sqrt(negative) log(negative), log10(negative), arccos(.gt. 1), arcsin(.gt. 1). - "addition" + "subtraction" - "multiplication" * "division" / "negation" - "exponentiation" ** ^ "absolute value" abs(x) "cosine" cos(x) "sine" sin(x) "tangent" tan(x) "arc cosine" arccos(x) "arc sine" arcsin(x) "arc tangent" arctan(x) "arc tangent" arctan2(y,x) "hyperbolic cos" cosh(x) "hyperbolic sin" sinh(x) "hyperbolic tan" tanh(x) "round to nearest int" round(x) "round down to int" floor(x) "round up to int" ceil(x) "exponential" exp(x) "square root" sqrt(x) "natural log" log(x) "common log" log10(x) "modulus" x % y "random # [0.0,1.0)" random() "random Gaussian" randomn() "random Poisson" randomp(x) "minimum" min(x,y) "maximum" max(x,y) "cumulative sum" accum(x) "sequential difference" seqdiff(x) "if-then-else" b?x:y "angular separation" angsep(ra1,dec1,ra2,de2) (all in degrees) "substring" strmid(s,p,n) "string search" strstr(s,r) - Three different random number functions are provided: random(), with no arguments, produces a uniform random deviate between 0 and 1; randomn(), also with no arguments, produces a normal (Gaussian) random deviate with zero mean and unit standard deviation; randomp(x) produces a Poisson random deviate whose expected number of counts is X. X may be any positive real number of expected counts, including fractional values, but the return value is an integer. When the random functions are used in a vector expression, by default the same random value will be used when evaluating each element of the vector. If different random numbers are desired, then the name of a vector column should be supplied as the single argument to the random function (e.g., "flux + 0.1 * random(flux)", where "flux' is the name of a vector column). This will create a vector of random numbers that will be used in sequence when evaluating each element of the vector expression. An alternate syntax for the min and max functions has only a single argument which should be a vector value (see below). The result will be the minimum/maximum element contained within the vector. The accum(x) function forms the cumulative sum of x, element by element. Vector columns are supported simply by performing the summation process through all the values. Null values are treated as 0. The seqdiff(x) function forms the sequential difference of x, element by element. The first value of seqdiff is the first value of x. A single null value in x causes a pair of nulls in the output. The seqdiff and accum functions are functional inverses, i.e., seqdiff(accum(x)) == x as long as no null values are present. In the if-then-else expression, "b?x:y", b is an explicit boolean value or expression. There is no automatic type conversion from numeric to boolean values, so one needs to use "iVal!=0" instead of merely "iVal" as the boolean argument. x and y can be any scalar data type (including string). The angsep function computes the angular separation in degrees between 2 celestial positions, where the first 2 parameters give the RA-like and Dec-like coordinates (in decimal degrees) of the first position, and the 3rd and 4th parameters give the coordinates of the second position. The substring function strmid(S,P,N) extracts a substring from S, starting at string position P, with a substring length N. The first character position in S is labeled as 1. If P is 0, or refers to a position beyond the end of S, then the extracted substring will be NULL. S, P, and N may be functions of other columns. The string search function strstr(S,R) searches for the first occurrence of the substring R in S. The result is an integer, indicating the character position of the first match (where 1 is the first character position of S). If no match is found, then strstr() returns a NULL value. The following type casting operators are available, where the enclosing parentheses are required and taken from the C language usage. Also, the integer to real casts values to double precision: - "real to integer" (int) x (INT) x "integer to real" (float) i (FLOAT) i - In addition, several constants are built in for use in numerical expressions: - #pi 3.1415... #e 2.7182... #deg #pi/180 #row current row number #null undefined value #snull undefined string - A string constant must be enclosed in quotes as in 'Crab'. The "null" constants are useful for conditionally setting table values to a NULL, or undefined, value (eg., "col1==-99 ? \#NULL : col1"). There is also a function for testing if two values are close to each other, i.e., if they are "near" each other to within a user specified tolerance. The arguments, value\_1 and value\_2 can be integer or real and represent the two values who's proximity is being tested to be within the specified tolerance, also an integer or real: - near(value_1, value_2, tolerance) - When a NULL, or undefined, value is encountered in the FITS table, the expression will evaluate to NULL unless the undefined value is not actually required for evaluation, e.g. "TRUE .or. NULL" evaluates to TRUE. The following two functions allow some NULL detection and handling: - "a null value?" ISNULL(x) "define a value for null" DEFNULL(x,y) - The former returns a boolean value of TRUE if the argument x is NULL. The later "defines" a value to be substituted for NULL values; it returns the value of x if x is not NULL, otherwise it returns the value of y. ***2. Bit Masks Bit masks can be used to select out rows from bit columns (TFORMn = \#X) in FITS files. To represent the mask, binary, octal, and hex formats are allowed: - binary: b0110xx1010000101xxxx0001 octal: o720x1 -> (b111010000xxx001) hex: h0FxD -> (b00001111xxxx1101) - In all the representations, an x or X is allowed in the mask as a wild card. Note that the x represents a different number of wild card bits in each representation. All representations are case insensitive. To construct the boolean expression using the mask as the boolean equal operator described above on a bit table column. For example, if you had a 7 bit column named flags in a FITS table and wanted all rows having the bit pattern 0010011, the selection expression would be: - flags == b0010011 or flags .eq. b10011 - It is also possible to test if a range of bits is less than, less than equal, greater than and greater than equal to a particular boolean value: - flags <= bxxx010xx flags .gt. bxxx100xx flags .le. b1xxxxxxx - Notice the use of the x bit value to limit the range of bits being compared. It is not necessary to specify the leading (most significant) zero (0) bits in the mask, as shown in the second expression above. Bit wise AND, OR and NOT operations are also possible on two or more bit fields using the '\&'(AND), '$|$'(OR), and the '!'(NOT) operators. All of these operators result in a bit field which can then be used with the equal operator. For example: - (!flags) == b1101100 (flags & b1000001) == bx000001 - Bit fields can be appended as well using the '+' operator. Strings can be concatenated this way, too. ***3. Vector Columns Vector columns can also be used in building the expression. No special syntax is required if one wants to operate on all elements of the vector. Simply use the column name as for a scalar column. Vector columns can be freely intermixed with scalar columns or constants in virtually all expressions. The result will be of the same dimension as the vector. Two vectors in an expression, though, need to have the same number of elements and have the same dimensions. The only places a vector column cannot be used (for now, anyway) are the SAO region functions and the NEAR boolean function. Arithmetic and logical operations are all performed on an element by element basis. Comparing two vector columns, eg "COL1 == COL2", thus results in another vector of boolean values indicating which elements of the two vectors are equal. Eight functions are available that operate on a vector and return a scalar result: - "minimum" MIN(V) "maximum" MAX(V) "average" AVERAGE(V) "median" MEDIAN(V) "summation" SUM(V) "standard deviation" STDDEV(V) "# of values" NELEM(V) "# of non-null values" NVALID(V) - where V represents the name of a vector column or a manually constructed vector using curly brackets as described below. The first 6 of these functions ignore any null values in the vector when computing the result. The STDDEV() function computes the sample standard deviation, i.e. it is proportional to 1/SQRT(N-1) instead of 1/SQRT(N), where N is NVALID(V). The SUM function literally sums all the elements in x, returning a scalar value. If x is a boolean vector, SUM returns the number of TRUE elements. The NELEM function returns the number of elements in vector x whereas NVALID return the number of non-null elements in the vector. (NELEM also operates on bit and string columns, returning their column widths.) As an example, to test whether all elements of two vectors satisfy a given logical comparison, one can use the expression - SUM( COL1 > COL2 ) == NELEM( COL1 ) - which will return TRUE if all elements of COL1 are greater than their corresponding elements in COL2. To specify a single element of a vector, give the column name followed by a comma-separated list of coordinates enclosed in square brackets. For example, if a vector column named PHAS exists in the table as a one dimensional, 256 component list of numbers from which you wanted to select the 57th component for use in the expression, then PHAS[57] would do the trick. Higher dimensional arrays of data may appear in a column. But in order to interpret them, the TDIMn keyword must appear in the header. Assuming that a (4,4,4,4) array is packed into each row of a column named ARRAY4D, the (1,2,3,4) component element of each row is accessed by ARRAY4D[1,2,3,4]. Arrays up to dimension 5 are currently supported. Each vector index can itself be an expression, although it must evaluate to an integer value within the bounds of the vector. Vector columns which contain spaces or arithmetic operators must have their names enclosed in "\$" characters as with \$ARRAY-4D\$[1,2,3,4]. A more C-like syntax for specifying vector indices is also available. The element used in the preceding example alternatively could be specified with the syntax ARRAY4D[4][3][2][1]. Note the reverse order of indices (as in C), as well as the fact that the values are still ones-based (as in Fortran -- adopted to avoid ambiguity for 1D vectors). With this syntax, one does not need to specify all of the indices. To extract a 3D slice of this 4D array, use ARRAY4D[4]. Variable-length vector columns are not supported. Vectors can be manually constructed within the expression using a comma-separated list of elements surrounded by curly braces ('\{\}'). For example, '\{1,3,6,1\}' is a 4-element vector containing the values 1, 3, 6, and 1. The vector can contain only boolean, integer, and real values (or expressions). The elements will be promoted to the highest datatype present. Any elements which are themselves vectors, will be expanded out with each of its elements becoming an element in the constructed vector. ***4. Good Time Interval Filtering A common filtering method involves selecting rows which have a time value which lies within what is called a Good Time Interval or GTI. The time intervals are defined in a separate FITS table extension which contains 2 columns giving the start and stop time of each good interval. The filtering operation accepts only those rows of the input table which have an associated time which falls within one of the time intervals defined in the GTI extension. A high level function, gtifilter(a,b,c,d), is available which evaluates each row of the input table and returns TRUE or FALSE depending whether the row is inside or outside the good time interval. The syntax is - gtifilter( [ "gtifile" [, expr [, "STARTCOL", "STOPCOL" ] ] ] ) - where each "[]" demarks optional parameters. Note that the quotes around the gtifile and START/STOP column are required. Either single or double quotes may be used. In cases where this expression is entered on the Unix command line, enclose the entire expression in double quotes, and then use single quotes within the expression to enclose the 'gtifile' and other terms. It is also usually possible to do the reverse, and enclose the whole expression in single quotes and then use double quotes within the expression. The gtifile, if specified, can be blank ("") which will mean to use the first extension with the name "*GTI*" in the current file, a plain extension specifier (eg, "+2", "[2]", or "[STDGTI]") which will be used to select an extension in the current file, or a regular filename with or without an extension specifier which in the latter case will mean to use the first extension with an extension name "*GTI*". Expr can be any arithmetic expression, including simply the time column name. A vector time expression will produce a vector boolean result. STARTCOL and STOPCOL are the names of the START/STOP columns in the GTI extension. If one of them is specified, they both must be. In its simplest form, no parameters need to be provided -- default values will be used. The expression "gtifilter()" is equivalent to - gtifilter( "", TIME, "*START*", "*STOP*" ) - This will search the current file for a GTI extension, filter the TIME column in the current table, using START/STOP times taken from columns in the GTI extension with names containing the strings "START" and "STOP". The wildcards ('*') allow slight variations in naming conventions such as "TSTART" or "STARTTIME". The same default values apply for unspecified parameters when the first one or two parameters are specified. The function automatically searches for TIMEZERO/I/F keywords in the current and GTI extensions, applying a relative time offset, if necessary. ***5. Spatial Region Filtering Another common filtering method selects rows based on whether the spatial position associated with each row is located within a given 2-dimensional region. The syntax for this high-level filter is - regfilter( "regfilename" [ , Xexpr, Yexpr [ , "wcs cols" ] ] ) - where each "[]" demarks optional parameters. The region file name is required and must be enclosed in quotes. The remaining parameters are optional. There are 2 supported formats for the region file: ASCII file or FITS binary table. The region file contains a list of one or more geometric shapes (circle, ellipse, box, etc.) which defines a region on the celestial sphere or an area within a particular 2D image. The region file is typically generated using an image display program such as fv/POW (distribute by the HEASARC), or ds9 (distributed by the Smithsonian Astrophysical Observatory). Users should refer to the documentation provided with these programs for more details on the syntax used in the region files. The FITS region file format is defined in a document available from the FITS Support Office at http://fits.gsfc.nasa.gov/ registry/ region.html In its simplest form, (e.g., regfilter("region.reg") ) the coordinates in the default 'X' and 'Y' columns will be used to determine if each row is inside or outside the area specified in the region file. Alternate position column names, or expressions, may be entered if needed, as in - regfilter("region.reg", XPOS, YPOS) - Region filtering can be applied most unambiguously if the positions in the region file and in the table to be filtered are both give in terms of absolute celestial coordinate units. In this case the locations and sizes of the geometric shapes in the region file are specified in angular units on the sky (e.g., positions given in R.A. and Dec. and sizes in arcseconds or arcminutes). Similarly, each row of the filtered table will have a celestial coordinate associated with it. This association is usually implemented using a set of so-called 'World Coordinate System' (or WCS) FITS keywords that define the coordinate transformation that must be applied to the values in the 'X' and 'Y' columns to calculate the coordinate. Alternatively, one can perform spatial filtering using unitless 'pixel' coordinates for the regions and row positions. In this case the user must be careful to ensure that the positions in the 2 files are self-consistent. A typical problem is that the region file may be generated using a binned image, but the unbinned coordinates are given in the event table. The ROSAT events files, for example, have X and Y pixel coordinates that range from 1 - 15360. These coordinates are typically binned by a factor of 32 to produce a 480x480 pixel image. If one then uses a region file generated from this image (in image pixel units) to filter the ROSAT events file, then the X and Y column values must be converted to corresponding pixel units as in: - regfilter("rosat.reg", X/32.+.5, Y/32.+.5) - Note that this binning conversion is not necessary if the region file is specified using celestial coordinate units instead of pixel units because CFITSIO is then able to directly compare the celestial coordinate of each row in the table with the celestial coordinates in the region file without having to know anything about how the image may have been binned. The last "wcs cols" parameter should rarely be needed. If supplied, this string contains the names of the 2 columns (space or comma separated) which have the associated WCS keywords. If not supplied, the filter will scan the X and Y expressions for column names. If only one is found in each expression, those columns will be used, otherwise an error will be returned. These region shapes are supported (names are case insensitive): - Point ( X1, Y1 ) <- One pixel square region Line ( X1, Y1, X2, Y2 ) <- One pixel wide region Polygon ( X1, Y1, X2, Y2, ... ) <- Rest are interiors with Rectangle ( X1, Y1, X2, Y2, A ) | boundaries considered Box ( Xc, Yc, Wdth, Hght, A ) V within the region Diamond ( Xc, Yc, Wdth, Hght, A ) Circle ( Xc, Yc, R ) Annulus ( Xc, Yc, Rin, Rout ) Ellipse ( Xc, Yc, Rx, Ry, A ) Elliptannulus ( Xc, Yc, Rinx, Riny, Routx, Routy, Ain, Aout ) Sector ( Xc, Yc, Amin, Amax ) - where (Xc,Yc) is the coordinate of the shape's center; (X\#,Y\#) are the coordinates of the shape's edges; Rxxx are the shapes' various Radii or semi-major/minor axes; and Axxx are the angles of rotation (or bounding angles for Sector) in degrees. For rotated shapes, the rotation angle can be left off, indicating no rotation. Common alternate names for the regions can also be used: rotbox = box; rotrectangle = rectangle; (rot)rhombus = (rot)diamond; and pie = sector. When a shape's name is preceded by a minus sign, '-', the defined region is instead the area *outside* its boundary (ie, the region is inverted). All the shapes within a single region file are OR'd together to create the region, and the order is significant. The overall way of looking at region files is that if the first region is an excluded region then a dummy included region of the whole detector is inserted in the front. Then each region specification as it is processed overrides any selections inside of that region specified by previous regions. Another way of thinking about this is that if a previous excluded region is completely inside of a subsequent included region the excluded region is ignored. The positional coordinates may be given either in pixel units, decimal degrees or hh:mm:ss.s, dd:mm:ss.s units. The shape sizes may be given in pixels, degrees, arcminutes, or arcseconds. Look at examples of region file produced by fv/POW or ds9 for further details of the region file format. There are three functions that are primarily for use with SAO region files and the FSAOI task, but they can be used directly. They return a boolean true or false depending on whether a two dimensional point is in the region or not: - "point in a circular region" circle(xcntr,ycntr,radius,Xcolumn,Ycolumn) "point in an elliptical region" ellipse(xcntr,ycntr,xhlf_wdth,yhlf_wdth,rotation,Xcolumn,Ycolumn) "point in a rectangular region" box(xcntr,ycntr,xfll_wdth,yfll_wdth,rotation,Xcolumn,Ycolumn) where (xcntr,ycntr) are the (x,y) position of the center of the region (xhlf_wdth,yhlf_wdth) are the (x,y) half widths of the region (xfll_wdth,yfll_wdth) are the (x,y) full widths of the region (radius) is half the diameter of the circle (rotation) is the angle(degrees) that the region is rotated with respect to (xcntr,ycntr) (Xcoord,Ycoord) are the (x,y) coordinates to test, usually column names NOTE: each parameter can itself be an expression, not merely a column name or constant. - ***5. Example Row Filters - [ binary && mag <= 5.0] - Extract all binary stars brighter than fifth magnitude (note that the initial space is necessary to prevent it from being treated as a binning specification) [#row >= 125 && #row <= 175] - Extract row numbers 125 through 175 [IMAGE[4,5] .gt. 100] - Extract all rows that have the (4,5) component of the IMAGE column greater than 100 [abs(sin(theta * #deg)) < 0.5] - Extract all rows having the absolute value of the sine of theta less than a half where the angles are tabulated in degrees [SUM( SPEC > 3*BACKGRND )>=1] - Extract all rows containing a spectrum, held in vector column SPEC, with at least one value 3 times greater than the background level held in a keyword, BACKGRND [VCOL=={1,4,2}] - Extract all rows whose vector column VCOL contains the 3-elements 1, 4, and 2. [@rowFilter.txt] - Extract rows using the expression contained within the text file rowFilter.txt [gtifilter()] - Search the current file for a GTI extension, filter the TIME column in the current table, using START/STOP times taken from columns in the GTI extension [regfilter("pow.reg")] - Extract rows which have a coordinate (as given in the X and Y columns) within the spatial region specified in the pow.reg region file. [regfilter("pow.reg", Xs, Ys)] - Same as above, except that the Xs and Ys columns will be used to determine the coordinate of each row in the table. - **K. Binning or Histogramming Specification The optional binning specifier is enclosed in square brackets and can be distinguished from a general row filter specification by the fact that it begins with the keyword 'bin' not immediately followed by an equals sign. When binning is specified, a temporary N-dimensional FITS primary array is created by computing the histogram of the values in the specified columns of a FITS table extension. After the histogram is computed the input FITS file containing the table is then closed and the temporary FITS primary array is opened and passed to the application program. Thus, the application program never sees the original FITS table and only sees the image in the new temporary file (which has no additional extensions). Obviously, the application program must be expecting to open a FITS image and not a FITS table in this case. The data type of the FITS histogram image may be specified by appending 'b' (for 8-bit byte), 'i' (for 16-bit integers), 'j' (for 32-bit integer), 'r' (for 32-bit floating points), or 'd' (for 64-bit double precision floating point) to the 'bin' keyword (e.g. '[binr X]' creates a real floating point image). If the datatype is not explicitly specified then a 32-bit integer image will be created by default, unless the weighting option is also specified in which case the image will have a 32-bit floating point data type by default. The histogram image may have from 1 to 4 dimensions (axes), depending on the number of columns that are specified. The general form of the binning specification is: - [bin{bijrd} Xcol=min:max:binsize, Ycol= ..., Zcol=..., Tcol=...; weight] - in which up to 4 columns, each corresponding to an axis of the image, are listed. The column names are case insensitive, and the column number may be given instead of the name, preceded by a pound sign (e.g., [bin \#4=1:512]). If the column name is not specified, then CFITSIO will first try to use the 'preferred column' as specified by the CPREF keyword if it exists (e.g., 'CPREF = 'DETX,DETY'), otherwise column names 'X', 'Y', 'Z', and 'T' will be assumed for each of the 4 axes, respectively. In cases where the column name could be confused with an arithmetic expression, enclose the column name in parentheses to force the name to be interpreted literally. Each column name may be followed by an equals sign and then the lower and upper range of the histogram, and the size of the histogram bins, separated by colons. Spaces are allowed before and after the equals sign but not within the 'min:max:binsize' string. The min, max and binsize values may be integer or floating point numbers, or they may be the names of keywords in the header of the table. If the latter, then the value of that keyword is substituted into the expression. Default values for the min, max and binsize quantities will be used if not explicitly given in the binning expression as shown in these examples: - [bin x = :512:2] - use default minimum value [bin x = 1::2] - use default maximum value [bin x = 1:512] - use default bin size [bin x = 1:] - use default maximum value and bin size [bin x = :512] - use default minimum value and bin size [bin x = 2] - use default minimum and maximum values [bin x] - use default minimum, maximum and bin size [bin 4] - default 2-D image, bin size = 4 in both axes [bin] - default 2-D image - CFITSIO will use the value of the TLMINn, TLMAXn, and TDBINn keywords, if they exist, for the default min, max, and binsize, respectively. If they do not exist then CFITSIO will use the actual minimum and maximum values in the column for the histogram min and max values. The default binsize will be set to 1, or (max - min) / 10., whichever is smaller, so that the histogram will have at least 10 bins along each axis. A shortcut notation is allowed if all the columns/axes have the same binning specification. In this case all the column names may be listed within parentheses, followed by the (single) binning specification, as in: - [bin (X,Y)=1:512:2] [bin (X,Y) = 5] - The optional weighting factor is the last item in the binning specifier and, if present, is separated from the list of columns by a semi-colon. As the histogram is accumulated, this weight is used to incremented the value of the appropriated bin in the histogram. If the weighting factor is not specified, then the default weight = 1 is assumed. The weighting factor may be a constant integer or floating point number, or the name of a keyword containing the weighting value. Or the weighting factor may be the name of a table column in which case the value in that column, on a row by row basis, will be used. In some cases, the column or keyword may give the reciprocal of the actual weight value that is needed. In this case, precede the weight keyword or column name by a slash '/' to tell CFITSIO to use the reciprocal of the value when constructing the histogram. For complex or commonly used histograms, one can also place its description into a text file and import it into the binning specification using the syntax '[bin @filename.txt]'. The file's contents can extend over multiple lines, although it must still conform to the no-spaces rule for the min:max:binsize syntax and each axis specification must still be comma-separated. Any lines in the external text file that begin with 2 slash characters ('//') will be ignored and may be used to add comments into the file. Examples: - [bini detx, dety] - 2-D, 16-bit integer histogram of DETX and DETY columns, using default values for the histogram range and binsize [bin (detx, dety)=16; /exposure] - 2-D, 32-bit real histogram of DETX and DETY columns with a bin size = 16 in both axes. The histogram values are divided by the EXPOSURE keyword value. [bin time=TSTART:TSTOP:0.1] - 1-D lightcurve, range determined by the TSTART and TSTOP keywords, with 0.1 unit size bins. [bin pha, time=8000.:8100.:0.1] - 2-D image using default binning of the PHA column for the X axis, and 1000 bins in the range 8000. to 8100. for the Y axis. [bin @binFilter.txt] - Use the contents of the text file binFilter.txt for the binning specifications. - *V. Template Files When a new FITS file is created with a call to fits\_create\_file, the name of a template file may be supplied in parentheses immediately following the name of the new file to be created. This template is used to define the structure of one or more HDUs in the new file. The template file may be another FITS file, in which case the newly created file will have exactly the same keywords in each HDU as in the template FITS file, but all the data units will be filled with zeros. The template file may also be an ASCII text file, where each line (in general) describes one FITS keyword record. The format of the ASCII template file is described in the following sections. **A Detailed Template Line Format The format of each ASCII template line closely follows the format of a FITS keyword record: - KEYWORD = KEYVALUE / COMMENT - except that free format may be used (e.g., the equals sign may appear at any position in the line) and TAB characters are allowed and are treated the same as space characters. The KEYVALUE and COMMENT fields are optional. The equals sign character is also optional, but it is recommended that it be included for clarity. Any template line that begins with the pound '\#' character is ignored by the template parser and may be use to insert comments into the template file itself. The KEYWORD name field is limited to 8 characters in length and only the letters A-Z, digits 0-9, and the hyphen and underscore characters may be used, without any embedded spaces. Lowercase letters in the template keyword name will be converted to uppercase. Leading spaces in the template line preceding the keyword name are generally ignored, except if the first 8 characters of a template line are all blank, then the entire line is treated as a FITS comment keyword (with a blank keyword name) and is copied verbatim into the FITS header. The KEYVALUE field may have any allowed FITS data type: character string, logical, integer, real, complex integer, or complex real. Integer values must be within the allowed range of a 'signed long' variable; some C compilers only suppport 4-byte long integers with a range from -2147483648 to +2147483647, whereas other C compilers support 8-byte integers with a range of plus or minus 2**63. The character string values need not be enclosed in single quote characters unless they are necessary to distinguish the string from a different data type (e.g. 2.0 is a real but '2.0' is a string). The keyword has an undefined (null) value if the template record only contains blanks following the "=" or between the "=" and the "/" comment field delimiter. String keyword values longer than 68 characters (the maximum length that will fit in a single FITS keyword record) are permitted using the CFITSIO long string convention. They can either be specified as a single long line in the template, or by using multiple lines where the continuing lines contain the 'CONTINUE' keyword, as in this example: - LONGKEY = 'This is a long string value that is contin&' CONTINUE 'ued over 2 records' / comment field goes here - The format of template lines with CONTINUE keyword is very strict: 3 spaces must follow CONTINUE and the rest of the line is copied verbatim to the FITS file. The start of the optional COMMENT field must be preceded by "/", which is used to separate it from the keyword value field. Exceptions are if the KEYWORD name field contains COMMENT, HISTORY, CONTINUE, or if the first 8 characters of the template line are blanks. More than one Header-Data Unit (HDU) may be defined in the template file. The start of an HDU definition is denoted with a SIMPLE or XTENSION template line: 1) SIMPLE begins a Primary HDU definition. SIMPLE may only appear as the first keyword in the template file. If the template file begins with XTENSION instead of SIMPLE, then a default empty Primary HDU is created, and the template is then assumed to define the keywords starting with the first extension following the Primary HDU. 2) XTENSION marks the beginning of a new extension HDU definition. The previous HDU will be closed at this point and processing of the next extension begins. **B Auto-indexing of Keywords If a template keyword name ends with a "\#" character, it is said to be 'auto-indexed'. Each "\#" character will be replaced by the current integer index value, which gets reset = 1 at the start of each new HDU in the file (or 7 in the special case of a GROUP definition). The FIRST indexed keyword in each template HDU definition is used as the 'incrementor'; each subsequent occurrence of this SAME keyword will cause the index value to be incremented. This behavior can be rather subtle, as illustrated in the following examples in which the TTYPE keyword is the incrementor in both cases: - TTYPE# = TIME TFORM# = 1D TTYPE# = RATE TFORM# = 1E - will create TTYPE1, TFORM1, TTYPE2, and TFORM2 keywords. But if the template looks like, - TTYPE# = TIME TTYPE# = RATE TFORM# = 1D TFORM# = 1E - this results in a FITS files with TTYPE1, TTYPE2, TFORM2, and TFORM2, which is probably not what was intended! **C Template Parser Directives In addition to the template lines which define individual keywords, the template parser recognizes 3 special directives which are each preceded by the backslash character: \verb+ \include, \group+, and \verb+ \end+. The 'include' directive must be followed by a filename. It forces the parser to temporarily stop reading the current template file and begin reading the include file. Once the parser reaches the end of the include file it continues parsing the current template file. Include files can be nested, and HDU definitions can span multiple template files. The start of a GROUP definition is denoted with the 'group' directive, and the end of a GROUP definition is denoted with the 'end' directive. Each GROUP contains 0 or more member blocks (HDUs or GROUPs). Member blocks of type GROUP can contain their own member blocks. The GROUP definition itself occupies one FITS file HDU of special type (GROUP HDU), so if a template specifies 1 group with 1 member HDU like: - \group grpdescr = 'demo' xtension bintable # this bintable has 0 cols, 0 rows \end - then the parser creates a FITS file with 3 HDUs : - 1) dummy PHDU 2) GROUP HDU (has 1 member, which is bintable in HDU number 3) 3) bintable (member of GROUP in HDU number 2) - Technically speaking, the GROUP HDU is a BINTABLE with 6 columns. Applications can define additional columns in a GROUP HDU using TFORMn and TTYPEn (where n is 7, 8, ....) keywords or their auto-indexing equivalents. For a more complicated example of a template file using the group directives, look at the sample.tpl file that is included in the CFITSIO distribution. **D Formal Template Syntax The template syntax can formally be defined as follows: - TEMPLATE = BLOCK [ BLOCK ... ] BLOCK = { HDU | GROUP } GROUP = \GROUP [ BLOCK ... ] \END HDU = XTENSION [ LINE ... ] { XTENSION | \GROUP | \END | EOF } LINE = [ KEYWORD [ = ] ] [ VALUE ] [ / COMMENT ] X ... - X can be present 1 or more times { X | Y } - X or Y [ X ] - X is optional - At the topmost level, the template defines 1 or more template blocks. Blocks can be either HDU (Header Data Unit) or a GROUP. For each block the parser creates 1 (or more for GROUPs) FITS file HDUs. **E Errors In general the fits\_execute\_template() function tries to be as atomic as possible, so either everything is done or nothing is done. If an error occurs during parsing of the template, fits\_execute\_template() will (try to) delete the top level BLOCK (with all its children if any) in which the error occurred, then it will stop reading the template file and it will return with an error. **F Examples 1. This template file will create a 200 x 300 pixel image, with 4-byte integer pixel values, in the primary HDU: - SIMPLE = T BITPIX = 32 NAXIS = 2 / number of dimensions NAXIS1 = 100 / length of first axis NAXIS2 = 200 / length of second axis OBJECT = NGC 253 / name of observed object - The allowed values of BITPIX are 8, 16, 32, -32, or -64, representing, respectively, 8-bit integer, 16-bit integer, 32-bit integer, 32-bit floating point, or 64 bit floating point pixels. 2. To create a FITS table, the template first needs to include XTENSION = TABLE or BINTABLE to define whether it is an ASCII or binary table, and NAXIS2 to define the number of rows in the table. Two template lines are then needed to define the name (TTYPEn) and FITS data format (TFORMn) of the columns, as in this example: - xtension = bintable naxis2 = 40 ttype# = Name tform# = 10a ttype# = Npoints tform# = j ttype# = Rate tunit# = counts/s tform# = e - The above example defines a null primary array followed by a 40-row binary table extension with 3 columns called 'Name', 'Npoints', and 'Rate', with data formats of '10A' (ASCII character string), '1J' (integer) and '1E' (floating point), respectively. Note that the other required FITS keywords (BITPIX, NAXIS, NAXIS1, PCOUNT, GCOUNT, TFIELDS, and END) do not need to be explicitly defined in the template because their values can be inferred from the other keywords in the template. This example also illustrates that the templates are generally case-insensitive (the keyword names and TFORMn values are converted to upper-case in the FITS file) and that string keyword values generally do not need to be enclosed in quotes. *IX Summary of all FITSIO User-Interface Subroutines Error Status Routines page~\pageref{FTVERS} - FTVERS( > version) FTGERR(status, > errtext) FTGMSG( > errmsg) FTRPRT (stream, > status) FTPMSG(errmsg) FTPMRK FTCMSG FTCMRK - FITS File Open and Close Subroutines: page~\pageref{FTOPEN} - FTOPEN(unit,filename,rwmode, > blocksize,status) FTDKOPN(unit,filename,rwmode, > blocksize,status) FTNOPN(unit,filename,rwmode, > status) FTDOPN(unit,filename,rwmode, > status) FTTOPN(unit,filename,rwmode, > status) FTIOPN(unit,filename,rwmode, > status) FTREOPEN(unit, > newunit, status) FTINIT(unit,filename,blocksize, > status) FTDKINIT(unit,filename,blocksize, > status) FTTPLT(unit, filename, tplfilename, > status) FTFLUS(unit, > status) FTCLOS(unit, > status) FTDELT(unit, > status) FTGIOU( > iounit, status) FTFIOU(iounit, > status) CFITS2Unit(fitsfile *ptr) (C routine) CUnit2FITS(int unit) (C routine) FTEXTN(filename, > nhdu, status) FTFLNM(unit, > filename, status) FTFLMD(unit, > iomode, status) FTURLT(unit, > urltype, status) FTIURL(filename, > filetype, infile, outfile, extspec, filter, binspec, colspec, status) FTRTNM(filename, > rootname, status) FTEXIST(filename, > exist, status) - HDU-Level Operations: page~\pageref{FTMAHD} - FTMAHD(unit,nhdu, > hdutype,status) FTMRHD(unit,nmove, > hdutype,status) FTGHDN(unit, > nhdu) FTMNHD(unit, hdutype, extname, extver, > status) FTGHDT(unit, > hdutype, status) FTTHDU(unit, > hdunum, status) FTCRHD(unit, > status) FTIIMG(unit,bitpix,naxis,naxes, > status) FTITAB(unit,rowlen,nrows,tfields,ttype,tbcol,tform,tunit,extname, > status) FTIBIN(unit,nrows,tfields,ttype,tform,tunit,extname,varidat > status) FTRSIM(unit,bitpix,naxis,naxes,status) FTDHDU(unit, > hdutype,status) FTCPFL(iunit,ounit,previous, current, following, > status) FTCOPY(iunit,ounit,morekeys, > status) FTCPHD(inunit, outunit, > status) FTCPDT(iunit,ounit, > status) - Subroutines to specify or modify the structure of the CHDU: page~\pageref{FTRDEF} - FTRDEF(unit, > status) (DEPRECATED) FTPDEF(unit,bitpix,naxis,naxes,pcount,gcount, > status) (DEPRECATED) FTADEF(unit,rowlen,tfields,tbcol,tform,nrows > status) (DEPRECATED) FTBDEF(unit,tfields,tform,varidat,nrows > status) (DEPRECATED) FTDDEF(unit,bytlen, > status) (DEPRECATED) FTPTHP(unit,theap, > status) - Header Space and Position Subroutines: page~\pageref{FTHDEF} - FTHDEF(unit,morekeys, > status) FTGHSP(iunit, > keysexist,keysadd,status) FTGHPS(iunit, > keysexist,key_no,status) - Read or Write Standard Header Subroutines: page~\pageref{FTPHPR} - FTPHPS(unit,bitpix,naxis,naxes, > status) FTPHPR(unit,simple,bitpix,naxis,naxes,pcount,gcount,extend, > status) FTGHPR(unit,maxdim, > simple,bitpix,naxis,naxes,pcount,gcount,extend, status) FTPHTB(unit,rowlen,nrows,tfields,ttype,tbcol,tform,tunit,extname, > status) FTGHTB(unit,maxdim, > rowlen,nrows,tfields,ttype,tbcol,tform,tunit, extname,status) FTPHBN(unit,nrows,tfields,ttype,tform,tunit,extname,varidat > status) FTGHBN(unit,maxdim, > nrows,tfields,ttype,tform,tunit,extname,varidat, status) - Write Keyword Subroutines: page~\pageref{FTPREC} - FTPREC(unit,card, > status) FTPCOM(unit,comment, > status) FTPHIS(unit,history, > status) FTPDAT(unit, > status) FTPKY[JKLS](unit,keyword,keyval,comment, > status) FTPKY[EDFG](unit,keyword,keyval,decimals,comment, > status) FTPKLS(unit,keyword,keyval,comment, > status) FTPLSW(unit, > status) FTPKYU(unit,keyword,comment, > status) FTPKN[JKLS](unit,keyroot,startno,no_keys,keyvals,comments, > status) FTPKN[EDFG](unit,keyroot,startno,no_keys,keyvals,decimals,comments, > status) FTCPKYinunit, outunit, innum, outnum, keyroot, > status) FTPKYT(unit,keyword,intval,dblval,comment, > status) FTPKTP(unit, filename, > status) FTPUNT(unit,keyword,units, > status) - Insert Keyword Subroutines: page~\pageref{FTIREC} - FTIREC(unit,key_no,card, > status) FTIKY[JKLS](unit,keyword,keyval,comment, > status) FTIKLS(unit,keyword,keyval,comment, > status) FTIKY[EDFG](unit,keyword,keyval,decimals,comment, > status) FTIKYU(unit,keyword,comment, > status) - Read Keyword Subroutines: page~\pageref{FTGREC} - FTGREC(unit,key_no, > card,status) FTGKYN(unit,key_no, > keyword,value,comment,status) FTGCRD(unit,keyword, > card,status) FTGNXK(unit,inclist,ninc,exclist,nexc, > card,status) FTGKEY(unit,keyword, > value,comment,status) FTGKY[EDJKLS](unit,keyword, > keyval,comment,status) FTGKSL(unit,keyword, > length,status) FTGSKY(unit,keyword,firstchar,maxchar,> keyval,length,comment,status) FTGKN[EDJKLS](unit,keyroot,startno,max_keys, > keyvals,nfound,status) FTGKYT(unit,keyword, > intval,dblval,comment,status) FTGUNT(unit,keyword, > units,status) - Modify Keyword Subroutines: page~\pageref{FTMREC} - FTMREC(unit,key_no,card, > status) FTMCRD(unit,keyword,card, > status) FTMNAM(unit,oldkey,keyword, > status) FTMCOM(unit,keyword,comment, > status) FTMKY[JKLS](unit,keyword,keyval,comment, > status) FTMKLS(unit,keyword,keyval,comment, > status) FTMKY[EDFG](unit,keyword,keyval,decimals,comment, > status) FTMKYU(unit,keyword,comment, > status) - Update Keyword Subroutines: page~\pageref{FTUCRD} - FTUCRD(unit,keyword,card, > status) FTUKY[JKLS](unit,keyword,keyval,comment, > status) FTUKLS(unit,keyword,keyval,comment, > status) FTUKY[EDFG](unit,keyword,keyval,decimals,comment, > status) FTUKYU(unit,keyword,comment, > status) - Delete Keyword Subroutines: page~\pageref{FTDREC} - FTDREC(unit,key_no, > status) FTDKEY(unit,keyword, > status) - Define Data Scaling Parameters and Undefined Pixel Flags: page~\pageref{FTPSCL} - FTPSCL(unit,bscale,bzero, > status) FTTSCL(unit,colnum,tscal,tzero, > status) FTPNUL(unit,blank, > status) FTSNUL(unit,colnum,snull > status) FTTNUL(unit,colnum,tnull > status) - FITS Primary Array or IMAGE Extension I/O Subroutines: page~\pageref{FTPPR} - FTGIDT(unit, > bitpix,status) FTGIET(unit, > bitpix,status) FTGIDM(unit, > naxis,status) FTGISZ(unit, maxdim, > naxes,status) FTGIPR(unit, maxdim, > bitpix,naxis,naxes,status) FTPPR[BIJKED](unit,group,fpixel,nelements,values, > status) FTPPN[BIJKED](unit,group,fpixel,nelements,values,nullval > status) FTPPRU(unit,group,fpixel,nelements, > status) FTGPV[BIJKED](unit,group,fpixel,nelements,nullval, > values,anyf,status) FTGPF[BIJKED](unit,group,fpixel,nelements, > values,flagvals,anyf,status) FTPGP[BIJKED](unit,group,fparm,nparm,values, > status) FTGGP[BIJKED](unit,group,fparm,nparm, > values,status) FTP2D[BIJKED](unit,group,dim1,naxis1,naxis2,image, > status) FTP3D[BIJKED](unit,group,dim1,dim2,naxis1,naxis2,naxis3,cube, > status) FTG2D[BIJKED](unit,group,nullval,dim1,naxis1,naxis2, > image,anyf,status) FTG3D[BIJKED](unit,group,nullval,dim1,dim2,naxis1,naxis2,naxis3, > cube,anyf,status) FTPSS[BIJKED](unit,group,naxis,naxes,fpixels,lpixels,array, > status) FTGSV[BIJKED](unit,group,naxis,naxes,fpixels,lpixels,incs,nullval, > array,anyf,status) FTGSF[BIJKED](unit,group,naxis,naxes,fpixels,lpixels,incs, > array,flagvals,anyf,status) - Table Column Information Subroutines: page~\pageref{FTGCNO} - FTGNRW(unit, > nrows, status) FTGNCL(unit, > ncols, status) FTGCNO(unit,casesen,coltemplate, > colnum,status) FTGCNN(unit,casesen,coltemplate, > colnam,colnum,status) FTGTCL(unit,colnum, > datacode,repeat,width,status) FTEQTY(unit,colnum, > datacode,repeat,width,status) FTGCDW(unit,colnum, > dispwidth,status) FTGACL(unit,colnum, > ttype,tbcol,tunit,tform,tscal,tzero,snull,tdisp,status) FTGBCL(unit,colnum, > ttype,tunit,datatype,repeat,tscal,tzero,tnull,tdisp,status) FTPTDM(unit,colnum,naxis,naxes, > status) FTGTDM(unit,colnum,maxdim, > naxis,naxes,status) FTDTDM(unit,tdimstr,colnum,maxdim, > naxis,naxes, status) FTGRSZ(unit, > nrows,status) - Low-Level Table Access Subroutines: page~\pageref{FTGTBS} - FTGTBS(unit,frow,startchar,nchars, > string,status) FTPTBS(unit,frow,startchar,nchars,string, > status) FTGTBB(unit,frow,startchar,nchars, > array,status) FTPTBB(unit,frow,startchar,nchars,array, > status) - Edit Rows or Columns page~\pageref{FTIROW} - FTIROW(unit,frow,nrows, > status) FTDROW(unit,frow,nrows, > status) FTDRRG(unit,rowrange, > status) FTDRWS(unit,rowlist,nrows, > status) FTICOL(unit,colnum,ttype,tform, > status) FTICLS(unit,colnum,ncols,ttype,tform, > status) FTMVEC(unit,colnum,newveclen, > status) FTDCOL(unit,colnum, > status) FTCPCL(inunit,outunit,incolnum,outcolnum,createcol, > status); - Read and Write Column Data Routines page~\pageref{FTPCLS} - FTPCL[SLBIJKEDCM](unit,colnum,frow,felem,nelements,values, > status) FTPCN[BIJKED](unit,colnum,frow,felem,nelements,values,nullval > status) FTPCLX(unit,colnum,frow,fbit,nbit,lray, > status) FTPCLU(unit,colnum,frow,felem,nelements, > status) FTGCL(unit,colnum,frow,felem,nelements, > values,status) FTGCV[SBIJKEDCM](unit,colnum,frow,felem,nelements,nullval, > values,anyf,status) FTGCF[SLBIJKEDCM](unit,colnum,frow,felem,nelements, > values,flagvals,anyf,status) FTGSV[BIJKED](unit,colnum,naxis,naxes,fpixels,lpixels,incs,nullval, > array,anyf,status) FTGSF[BIJKED](unit,colnum,naxis,naxes,fpixels,lpixels,incs, > array,flagvals,anyf,status) FTGCX(unit,colnum,frow,fbit,nbit, > lray,status) FTGCX[IJD](unit,colnum,frow,nrows,fbit,nbit, > array,status) FTGDES(unit,colnum,rownum, > nelements,offset,status) FTPDES(unit,colnum,rownum,nelements,offset, > status) - Row Selection and Calculator Routines: page~\pageref{FTFROW} - FTFROW(unit,expr,firstrow, nrows, > n_good_rows, row_status, status) FTFFRW(unit, expr, > rownum, status) FTSROW(inunit, outunit, expr, > status ) FTCROW(unit,datatype,expr,firstrow,nelements,nulval, > array,anynul,status) FTCALC(inunit, expr, outunit, parName, parInfo, > status) FTCALC_RNG(inunit, expr, outunit, parName, parInfo, nranges, firstrow, lastrow, > status) FTTEXP(unit, expr, > datatype, nelem, naxis, naxes, status) - Celestial Coordinate System Subroutines: page~\pageref{FTGICS} - FTGICS(unit, > xrval,yrval,xrpix,yrpix,xinc,yinc,rot,coordtype,status) FTGTCS(unit,xcol,ycol, > xrval,yrval,xrpix,yrpix,xinc,yinc,rot,coordtype,status) FTWLDP(xpix,ypix,xrval,yrval,xrpix,yrpix,xinc,yinc,rot, coordtype, > xpos,ypos,status) FTXYPX(xpos,ypos,xrval,yrval,xrpix,yrpix,xinc,yinc,rot, coordtype, > xpix,ypix,status) - File Checksum Subroutines: page~\pageref{FTPCKS} - FTPCKS(unit, > status) FTUCKS(unit, > status) FTVCKS(unit, > dataok,hduok,status) FTGCKS(unit, > datasum,hdusum,status) FTESUM(sum,complement, > checksum) FTDSUM(checksum,complement, > sum) - Time and Date Utility Subroutines: page~\pageref{FTGSDT} - FTGSDT( > day, month, year, status ) FTGSTM(> datestr, timeref, status) FTDT2S( year, month, day, > datestr, status) FTTM2S( year, month, day, hour, minute, second, decimals, > datestr, status) FTS2DT(datestr, > year, month, day, status) FTS2TM(datestr, > year, month, day, hour, minute, second, status) - General Utility Subroutines: page~\pageref{FTGHAD} - FTGHAD(unit, > curaddr,nextaddr) FTUPCH(string) FTCMPS(str_template,string,casesen, > match,exact) FTTKEY(keyword, > status) FTTREC(card, > status) FTNCHK(unit, > status) FTGKNM(unit, > keyword, keylength, status) FTMKKY(keyword, value,comment, > card, status) FTPSVC(card, > value,comment,status) FTKEYN(keyroot,seq_no, > keyword,status) FTNKEY(seq_no,keyroot, > keyword,status) FTDTYP(value, > dtype,status) class = FTGKCL(card) FTASFM(tform, > datacode,width,decimals,status) FTBNFM(tform, > datacode,repeat,width,status) FTGABC(tfields,tform,space, > rowlen,tbcol,status) FTGTHD(template, > card,hdtype,status) FTRWRG(rowlist, maxrows, maxranges, > numranges, rangemin, rangemax, status) - *X. Parameter Definitions - anyf - (logical) set to TRUE if any of the returned data values are undefined array - (any datatype except character) array of bytes to be read or written. bitpix - (integer) bits per pixel: 8, 16, 32, -32, or -64 blank - (integer) value used for undefined pixels in integer primary array blank - (integer*8) value used for undefined pixels in integer primary array blocksize - (integer) 2880-byte logical record blocking factor (if 0 < blocksize < 11) or the actual block size in bytes (if 10 < blocksize < 28800). As of version 3.3 of FITSIO, blocksizes greater than 2880 are no longer supported. bscale - (double precision) scaling factor for the primary array bytlen - (integer) length of the data unit, in bytes bzero - (double precision) zero point for primary array scaling card - (character*80) header record to be read or written casesen - (logical) will string matching be case sensitive? checksum - (character*16) encoded checksum string colname - (character) ASCII name of the column colnum - (integer) number of the column (first column = 1) coltemplate - (character) template string to be matched to column names comment - (character) the keyword comment field comments - (character array) keyword comment fields compid - (integer) the type of computer that the program is running on complement - (logical) should the checksum be complemented? coordtype - (character) type of coordinate projection (-SIN, -TAN, -ARC, -NCP, -GLS, -MER, or -AIT) cube - 3D data cube of the appropriate datatype curaddr - (integer) starting address (in bytes) of the CHDU current - (integer) if not equal to 0, copy the current HDU datacode - (integer) symbolic code of the binary table column datatype dataok - (integer) was the data unit verification successful (=1) or not (= -1). Equals zero if the DATASUM keyword is not present. datasum - (double precision) 32-bit 1's complement checksum for the data unit datatype - (character) datatype (format) of the binary table column datestr - (string) FITS date/time string: 'YYYY-MM-DDThh:mm:ss.ddd', 'YYYY-MM-dd', or 'dd/mm/yy' day - (integer) current day of the month dblval - (double precision) fractional part of the keyword value decimals - (integer) number of decimal places to be displayed dim1 - (integer) actual size of the first dimension of the image or cube array dim2 - (integer) actual size of the second dimension of the cube array dispwidth - (integer) - the display width (length of string) for a column dtype - (character) datatype of the keyword ('C', 'L', 'I', or 'F') C = character string L = logical I = integer F = floating point number errmsg - (character*80) oldest error message on the internal stack errtext - (character*30) descriptive error message corresponding to error number casesen - (logical) true if column name matching is case sensitive exact - (logical) do the strings match exactly, or were wildcards used? exclist (character array) list of names to be excluded from search exists - flag indicating whether the file or compressed file exists on disk extend - (logical) true if there may be extensions following the primary data extname - (character) value of the EXTNAME keyword (if not blank) fbit - (integer) first bit in the field to be read or written felem - (integer) first pixel of the element vector (ignored for ASCII tables) filename - (character) name of the FITS file flagvals - (logical array) True if corresponding data element is undefined following - (integer) if not equal to 0, copy all following HDUs in the input file fparm - (integer) sequence number of the first group parameter to read or write fpixel - (integer) the first pixel position fpixels - (integer array) the first included pixel in each dimension frow - (integer) beginning row number (first row of table = 1) frowll - (integer*8) beginning row number (first row of table = 1) gcount - (integer) value of the GCOUNT keyword (usually = 1) group - (integer) sequence number of the data group (=0 for non-grouped data) hdtype - (integer) header record type: -1=delete; 0=append or replace; 1=append; 2=this is the END keyword hduok - (integer) was the HDU verification successful (=1) or not (= -1). Equals zero if the CHECKSUM keyword is not present. hdusum - (double precision) 32 bit 1's complement checksum for the entire CHDU hdutype - (integer) type of HDU: 0 = primary array or IMAGE, 1 = ASCII table, 2 = binary table, -1 = any HDU type or unknown type history - (character) the HISTORY keyword comment string hour - (integer) hour from 0 - 23 image - 2D image of the appropriate datatype inclist (character array) list of names to be included in search incs - (integer array) sampling interval for pixels in each FITS dimension intval - (integer) integer part of the keyword value iounit - (integer) value of an unused I/O unit number iunit - (integer) logical unit number associated with the input FITS file, 1-300 key_no - (integer) sequence number (starting with 1) of the keyword record keylength - (integer) length of the keyword name keyroot - (character) root string for the keyword name keysadd -(integer) number of new keyword records which can fit in the CHU keysexist - (integer) number of existing keyword records in the CHU keyval - value of the keyword in the appropriate datatype keyvals - (array) value of the keywords in the appropriate datatype keyword - (character*8) name of a keyword lray - (logical array) array of logical values corresponding to the bit array lpixels - (integer array) the last included pixel in each dimension match - (logical) do the 2 strings match? maxdim - (integer) dimensioned size of the NAXES, TTYPE, TFORM or TUNIT arrays max_keys - (integer) maximum number of keywords to search for minute - (integer) minute of an hour (0 - 59) month - (integer) current month of the year (1 - 12) morekeys - (integer) will leave space in the header for this many more keywords naxes - (integer array) size of each dimension in the FITS array naxesll - (integer*8 array) size of each dimension in the FITS array naxis - (integer) number of dimensions in the FITS array naxis1 - (integer) length of the X/first axis of the FITS array naxis2 - (integer) length of the Y/second axis of the FITS array naxis3 - (integer) length of the Z/third axis of the FITS array nbit - (integer) number of bits in the field to read or write nchars - (integer) number of characters to read and return ncols - (integer) number of columns nelements - (integer) number of data elements to read or write nelementsll - (integer*8) number of data elements to read or write nexc (integer) number of names in the exclusion list (may = 0) nhdu - (integer) absolute number of the HDU (1st HDU = 1) ninc (integer) number of names in the inclusion list nmove - (integer) number of HDUs to move (+ or -), relative to current position nfound - (integer) number of keywords found (highest keyword number) no_keys - (integer) number of keywords to write in the sequence nparm - (integer) number of group parameters to read or write nrows - (integer) number of rows in the table nrowsll - (integer*8) number of rows in the table nullval - value to represent undefined pixels, of the appropriate datatype nextaddr - (integer) starting address (in bytes) of the HDU following the CHDU offset - (integer) byte offset in the heap to the first element of the array offsetll - (integer*8) byte offset in the heap to the first element of the array oldkey - (character) old name of keyword to be modified ounit - (integer) logical unit number associated with the output FITS file 1-300 pcount - (integer) value of the PCOUNT keyword (usually = 0) previous - (integer) if not equal to 0, copy all previous HDUs in the input file repeat - (integer) length of element vector (e.g. 12J); ignored for ASCII table rot - (double precision) celestial coordinate rotation angle (degrees) rowlen - (integer) length of a table row, in characters or bytes rowlenll - (integer*8) length of a table row, in characters or bytes rowlist - (integer array) list of row numbers to be deleted in increasing order rownum - (integer) number of the row (first row = 1) rowrange- (string) list of rows or row ranges to be deleted rwmode - (integer) file access mode: 0 = readonly, 1 = readwrite second (double)- second within minute (0 - 60.9999999999) (leap second!) seq_no - (integer) the sequence number to append to the keyword root name simple - (logical) does the FITS file conform to all the FITS standards snull - (character) value used to represent undefined values in ASCII table space - (integer) number of blank spaces to leave between ASCII table columns startchar - (integer) first character in the row to be read startno - (integer) value of the first keyword sequence number (usually 1) status - (integer) returned error status code (0 = OK) str_template (character) template string to be matched to reference string stream - (character) output stream for the report: either 'STDOUT' or 'STDERR' string - (character) character string sum - (double precision) 32 bit unsigned checksum value tbcol - (integer array) column number of the first character in the field(s) tdisp - (character) Fortran type display format for the table column template-(character) template string for a FITS header record tfields - (integer) number of fields (columns) in the table tform - (character array) format of the column(s); allowed values are: For ASCII tables: Iw, Aw, Fww.dd, Eww.dd, or Dww.dd For binary tables: rL, rX, rB, rI, rJ, rA, rAw, rE, rD, rC, rM where 'w'=width of the field, 'd'=no. of decimals, 'r'=repeat count Note that the 'rAw' form is non-standard extension to the TFORM keyword syntax that is not specifically defined in the Binary Tables definition document. theap - (integer) zero indexed byte offset of starting address of the heap relative to the beginning of the binary table data tnull - (integer) value used to represent undefined values in binary table tnullll - (integer*8) value used to represent undefined values in binary table ttype - (character array) label for table column(s) tscal - (double precision) scaling factor for table column tunit - (character array) physical unit for table column(s) tzero - (double precision) scaling zero point for table column unit - (integer) logical unit number associated with the FITS file (1-300) units - (character) the keyword units string (e.g., 'km/s') value - (character) the keyword value string values - array of data values of the appropriate datatype varidat - (integer) size in bytes of the 'variable length data area' following the binary table data (usually = 0) version - (real) current revision number of the library width - (integer) width of the character string field xcol - (integer) number of the column containing the X coordinate values xinc - (double precision) X axis coordinate increment at reference pixel (deg) xpix - (double precision) X axis pixel location xpos - (double precision) X axis celestial coordinate (usually RA) (deg) xrpix - (double precision) X axis reference pixel array location xrval - (double precision) X axis coordinate value at the reference pixel (deg) ycol - (integer) number of the column containing the X coordinate values year - (integer) last 2 digits of the year (00 - 99) yinc - (double precision) Y axis coordinate increment at reference pixel (deg) ypix - (double precision) y axis pixel location ypos - (double precision) y axis celestial coordinate (usually DEC) (deg) yrpix - (double precision) Y axis reference pixel array location yrval - (double precision) Y axis coordinate value at the reference pixel (deg) - *XI. FITSIO Error Status Codes - Status codes in the range -99 to -999 and 1 to 999 are reserved for future FITSIO use. 0 OK, no error 101 input and output files are the same 103 too many FITS files open at once; all internal buffers full 104 error opening existing file 105 error creating new FITS file; (does a file with this name already exist?) 106 error writing record to FITS file 107 end-of-file encountered while reading record from FITS file 108 error reading record from file 110 error closing FITS file 111 internal array dimensions exceeded 112 Cannot modify file with readonly access 113 Could not allocate memory 114 illegal logical unit number; must be between 1 - 300, inclusive 115 NULL input pointer to routine 116 error seeking position in file 121 invalid URL prefix on file name 122 tried to register too many IO drivers 123 driver initialization failed 124 matching driver is not registered 125 failed to parse input file URL 126 parse error in range list 151 bad argument in shared memory driver 152 null pointer passed as an argument 153 no more free shared memory handles 154 shared memory driver is not initialized 155 IPC error returned by a system call 156 no memory in shared memory driver 157 resource deadlock would occur 158 attempt to open/create lock file failed 159 shared memory block cannot be resized at the moment 201 header not empty; can't write required keywords 202 specified keyword name was not found in the header 203 specified header record number is out of bounds 204 keyword value field is blank 205 keyword value string is missing the closing quote character 206 illegal indexed keyword name (e.g. 'TFORM1000') 207 illegal character in keyword name or header record 208 keyword does not have expected name. Keyword out of sequence? 209 keyword does not have expected integer value 210 could not find the required END header keyword 211 illegal BITPIX keyword value 212 illegal NAXIS keyword value 213 illegal NAXISn keyword value: must be 0 or positive integer 214 illegal PCOUNT keyword value 215 illegal GCOUNT keyword value 216 illegal TFIELDS keyword value 217 negative ASCII or binary table width value (NAXIS1) 218 negative number of rows in ASCII or binary table (NAXIS2) 219 column name (TTYPE keyword) not found 220 illegal SIMPLE keyword value 221 could not find the required SIMPLE header keyword 222 could not find the required BITPIX header keyword 223 could not find the required NAXIS header keyword 224 could not find all the required NAXISn keywords in the header 225 could not find the required XTENSION header keyword 226 the CHDU is not an ASCII table extension 227 the CHDU is not a binary table extension 228 could not find the required PCOUNT header keyword 229 could not find the required GCOUNT header keyword 230 could not find the required TFIELDS header keyword 231 could not find all the required TBCOLn keywords in the header 232 could not find all the required TFORMn keywords in the header 233 the CHDU is not an IMAGE extension 234 illegal TBCOL keyword value; out of range 235 this operation only allowed for ASCII or BINARY table extension 236 column is too wide to fit within the specified width of the ASCII table 237 the specified column name template matched more than one column name 241 binary table row width is not equal to the sum of the field widths 251 unrecognizable type of FITS extension 252 unrecognizable FITS record 253 END keyword contains non-blank characters in columns 9-80 254 Header fill area contains non-blank characters 255 Data fill area contains non-blank on non-zero values 261 unable to parse the TFORM keyword value string 262 unrecognizable TFORM datatype code 263 illegal TDIMn keyword value 301 illegal HDU number; less than 1 or greater than internal buffer size 302 column number out of range (1 - 999) 304 attempt to move to negative file record number 306 attempted to read or write a negative number of bytes in the FITS file 307 illegal starting row number for table read or write operation 308 illegal starting element number for table read or write operation 309 attempted to read or write character string in non-character table column 310 attempted to read or write logical value in non-logical table column 311 illegal ASCII table TFORM format code for attempted operation 312 illegal binary table TFORM format code for attempted operation 314 value for undefined pixels has not been defined 317 attempted to read or write descriptor in a non-descriptor field 320 number of array dimensions out of range 321 first pixel number is greater than the last pixel number 322 attempt to set BSCALE or TSCALn scaling parameter = 0 323 illegal axis length less than 1 340 NOT_GROUP_TABLE 340 Grouping function error 341 HDU_ALREADY_MEMBER 342 MEMBER_NOT_FOUND 343 GROUP_NOT_FOUND 344 BAD_GROUP_ID 345 TOO_MANY_HDUS_TRACKED 346 HDU_ALREADY_TRACKED 347 BAD_OPTION 348 IDENTICAL_POINTERS 349 BAD_GROUP_ATTACH 350 BAD_GROUP_DETACH 360 NGP_NO_MEMORY malloc failed 361 NGP_READ_ERR read error from file 362 NGP_NUL_PTR null pointer passed as an argument. Passing null pointer as a name of template file raises this error 363 NGP_EMPTY_CURLINE line read seems to be empty (used internally) 364 NGP_UNREAD_QUEUE_FULL cannot unread more then 1 line (or single line twice) 365 NGP_INC_NESTING too deep include file nesting (infinite loop, template includes itself ?) 366 NGP_ERR_FOPEN fopen() failed, cannot open template file 367 NGP_EOF end of file encountered and not expected 368 NGP_BAD_ARG bad arguments passed. Usually means internal parser error. Should not happen 369 NGP_TOKEN_NOT_EXPECT token not expected here 401 error attempting to convert an integer to a formatted character string 402 error attempting to convert a real value to a formatted character string 403 cannot convert a quoted string keyword to an integer 404 attempted to read a non-logical keyword value as a logical value 405 cannot convert a quoted string keyword to a real value 406 cannot convert a quoted string keyword to a double precision value 407 error attempting to read character string as an integer 408 error attempting to read character string as a real value 409 error attempting to read character string as a double precision value 410 bad keyword datatype code 411 illegal number of decimal places while formatting floating point value 412 numerical overflow during implicit datatype conversion 413 error compressing image 414 error uncompressing image 420 error in date or time conversion 431 syntax error in parser expression 432 expression did not evaluate to desired type 433 vector result too large to return in array 434 data parser failed not sent an out column 435 bad data encounter while parsing column 436 parse error: output file not of proper type 501 celestial angle too large for projection 502 bad celestial coordinate or pixel value 503 error in celestial coordinate calculation 504 unsupported type of celestial projection 505 required celestial coordinate keywords not found 506 approximate wcs keyword values were returned - \end{document} cfitsio-3.47/docs/fitsio.pdf0000644000225700000360000250615413464573431015344 0ustar cagordonlhea%PDF-1.4 %Çì¢ 5 0 obj <> stream xœuUM5½Ï¯è¶D;.—Ëe$$DX&\‡°»Y²»$þ?¯ìéiFcÙõõ^½ªù°Ä@K´Ïé÷úþðìJ—»§C\^á{wøp n°œ~®ï—¯Ž0ªKÊA«Òr|wδJà´äª!-Çûïî¥%Qrßù5…‹Vwô+…ªÊÉýŒ÷\c‘r6HÍýèWÖR&÷Æl[«YÝ“KÆû-¼ˆ¹ »~E„T³d÷…E mÝ”K ¢ê^u¯FTÜß{²?Ϧ7ý2•T¦°¿¿ï @H²a\K eYEB¬¨o€î¹Õ “R9snHs>þ¾{¡RX)»Çž=6™m? x±Zq„∛{ï9¡¸•¥†©T¨½' ’Oî·æ#Aú)i6ƒw9[Qro=#|)â®G'²¶_Aµ¤)Ôã¸tN’DæôGOA£f1ü¬5(ZöÒ7†Ð œm•Tu÷•… „QIèÍ?æ-ÏD¼ß¾§N´j «ªµfe2ùYƒN˜7«ö>°–€Îÿ»Îí¹·)F™x˜owö; J_%i¹0âÞý‡Š)X)¹Ðt:!…/œ.P?»ÂdR†HJ2*œ¹U(ú§Ö¿øŠ6`5‘'B›˜­ I=¡þœ[#ã<[ÀîcçÖ„ Ñr(uÛâ)à_¡÷ÁQd½Ži$ÞÛ u2ÕlƒpV?Jì§T¡«i"^?áóšlŠòendstream endobj 6 0 obj 839 endobj 17 0 obj <> stream xœ+T0Ð3T0A(œË¥d®^Ìe àÄé\…\†` P*9WÁ)¨ÈÐ(¢gi`i¨’ÆÑm¨`n¤`fa¢” ÉåŠÖÈÔ4Ò3777†3bC¼¸\C¸”Eendstream endobj 18 0 obj 99 endobj 22 0 obj <> stream xœíšYsݶÇß•/qÉÎ\ÀÁú˜8[;i›Æ×íC’GªO,)±›¶é§ïÿ€q¸ÜE¶å-F ðãÿ,À/ÕéâŸáïùåÙ½oÂæÉ‹3µù¿OÎ~9Ó¹Âføs~¹ùd‡JqclbЛÝã³þa½ fã|è’ßì.Ͼmî·[ÕEã£Íu«º¤ƒ¦¹jMêYjþÕj´‘´oþ‰bMÖZ?›Dñ‹v«;o‰Ò÷»?¡wc1ž.©”»ÜtJ›ÝWg»?|Ûèv› n%jþØn©‹)·J¸ŠÞ£UÜ ÑRlž£W¯¬±ãÛ’ê”ò®¹ÀÝa¿ÖËóÖuZ%ãdOQn­Š_ð¸Öè©<Ãcµïà1;»‹3šÁ¸0 .Úe[ÒéË Þ“”Cž<×YGd‡azyž0¥Év¡yÄ“’B²aÏêHš'¨ÀÓ„&>o·¦#<ÆéQ¶Ùá²yð†dÉ_y Ú(k›{-•q™KKX†YKÃKko9?$ççÞ7ÚÈeÞZ‹žíf«¿á8e®éðXxéµ>J7Ÿ´¶#Ì“Ç"òˆ­M“3T|V..V ¯ê=ž7òh—=dtóc-Çzqs¦ù ï]Ûø¡ÖyÞny(6,ÙøoÖ¿µ[O±3¸ìp7™Î`®péá®Ûy´î«WxQ­0»¹~9Ve^(‚« K7k´–k›—,ºü•–f3v„‹%v¦b·k£í·h4šÕ˹à€hN>ðL› ‘ðºiƒÊ1mä©ÐöÖP¸ïx~ ¼u½£ Þ!a?±É0ÆxX„#÷5ƒ • FbtÝr¥Y—¬óÞÇÍ3¤\êæ?Ù…”á=ˈY&BǤa<¸^ðÙ i”ÇHÙ ÁŽma;ÆŠ 0Öbî`è~‡ØeØ‚ï|Hë°½w¡p7ôp@ðlåî ^GàBUÁ«âu²Þ‰å®Ï̬Ԯ.¸ ÏÉ€^ÔŠn =¯â zwÞ:…ëêç*…ŸUåú¯Ð;¡SÁÛæçŠ^ïÆl§³þ¹`o¬ -ë;súÚÌé)æÖ"&€Û|ÌÜ âTy쀬ù™9­2ÃëÏ‹þŒå&AÖë× ØGÜ–FÔú.¬Ç»ØÛÛFi¦hXh'©Z¢”F”úºP ¥[Óœ·¥‰7vUºnÑCÎ>+6©sWçDÛj«Ö„ÎùIÈ*<´wdù?XزyLì­Ãt¬¥DùJcyUÏÛ<ß•¥L±”aIUTº$OÆäÑÇXnÄ¡.ÎöÀÈR§ÁÒ×9¹e\É59òAf’.[“)±$ ŒÓg\7@d.]Ӕζ¯$2^¶&놡F'óv'd“(àkã"3…ÏiÈøã›·d»äŒŒ¾–ïMèÉ Aã‹%ñ•KCÓE?å*E¸Äò¨ä¹X4Üç£õÓÙ|Vkô•IÍÚ¬û=À#NñÀĻù4‚6ÍÌîɥݯšÔûÎÞ®q‚zíjùƒ*P¢¯’1ÙwvsôÒÿ7jWqƬ›´BéVœ{˜fN¾Fyo¬ÆþÛ µø&y!­'t1—€;M»=ï^ˆš;èàÛ=yµ?c]½·0"ûlJÂ$Ì\øúÙŽæxÓY;å‚ݹp%kÇß¾59ïV{ºîJV®I”)“uåI@ùhnµûŒ*•惨U— íÒ-´ÿ½#2³çRÜö^ƹ; ä˜oz> ‰´ª‰Âë1¢¸\øfY¨°ò¾ÓXÙ/[Y… ¹•‚çL¡ëȤæSÜ…°Ç\[ê`Ά$ôù&òo“t3…t½§æ»f|ü~MÞ}9>Þ÷å`‹bœßµ˜;¯Á„PüÖòº¯ŒâjCË´O¤Ø„|ÔÖsþlìD¥ýù·"Qn"™¿´f©MB cPàönçà¶ãÓìÐ)øzO‚ãTÄJ#Ô̽YÄ>oïç[=miÄž.#_¶Ážê5OtÁž·±ü’B«æº˜ÿó4$Þãqƒg7‘·%U$ØÍ.bt¹¯÷ÆÞœ"Ô¢×éÊÝ€Å1—; ‚Y¤|RcÁ¢H½‰¸Aì1ý¼âö˜Tÿmbá( ª «Ö²ß^¬%ûYè;oÛþ&4Muë5J+Ù‡lÒmà03÷­Iâ³þä<4 ˆ€íÍóÈï‚b ;3‰1nÁ¡»W¤ìN F(æùÄw[ÒyÕʯ Øw{±ß[´^ ˜ì*´o,LЊ«;UË`w9¯û­&Üçû7FWwJž­ÿ½Mj ¤ˆœ§vþ<ûvûíê±wx)²Qošù üR†:DÒC4~§FWÄÛåòѰù6†î+;/ÅÂ÷Ivcñp>‡“^7ŠYºxiÌ ”ë¶íl!qØSqäC,Ó(Y|ÿ‡v-ƒR¸Ùbê‰øçl«l¢v³cs¬ÂÖõÙ—uPåfù¸ÁS(ž£+Ë\9à8fo/©þ…ž©Èýa€8œ4>®º¯³ùÇTÎy¹ÉTMœ“ Ù&‚Ýð ™¹SS¹àîí훳l˜ #?`|û펭Á³ã BÝ„(\³ëé±ã§]N¬¦äé% )gÛ,zµ.Šå]á±lÃ3äõ9AŠN‚M%ìøÀlô›Ï홺ƒvJn Ô•À`YBˆ0È?Î×jP¹|îh4ŽûjÖ-“} è ç€÷o0!Âä2Ðy”!Ýk¡ó N:óT²ËóÔ_ð©yØýÖqXbOy5Ù8lukæYܾf+ÊAž¼ê·ñx:?\õŒûåÐT³‰½f3²6úó(*ž²3—Ý9/Sרš°¶êØÎ¯¬p%…'¤nÐoÞ…y—…~—~ª2²+ª‰­Lmcˉ…—?Ð’ÃâÌc±[’Å ÅÔ™£Ù˜7E¢†+è7[Ì(˜Dñé—*üÈg»³¿áçÿ[\Žendstream endobj 23 0 obj 2270 endobj 29 0 obj <> stream xœíœËrܸ†÷ªM½)bºGìÉ9ðU„DàbxCL&™; øK†d©bÊB½ ñ Ç`:ùúøBBôs W@†ÓfƒA¿{ÅÐüÈ€1Eq÷eÎ ÀÝ1 ŠÒ4â-6f©–VvÑbä„IÆY«:Ï¡Yšá\ä„‘Î@b5&ŒqCã®ÃN™¡rÁ !ý÷P>„‹”žÓÓmx.Î4>}ª†”ÐÂ«è‘æs–q2'–w“­ÅD ƒXâ{ OܵÇä5#ñd8„ ñ¤É Нtù‚›‘æÜÐhj¾É°ƒa¢çÈ(«9é=@ÎÀ;!gw‡Üü„ßC—óMøÑr°Ä[,nNïd†íf±#jhQÔ}·DIÀáìÎp&r¦2g½Ù7ÚÆ¶ÁìËFJ…GrAÓNU틊…®hŠ pƒû¸d‚—œqÁŠcÞnì‚MvÁOÑJJ«QœXÀ›Æv^é䌭WÉh'|+TXN7³)(ô6ùû¡µ³~5ìK5Ê!ýÉð’+Ic&fïï[È}rÒª‰“–CÁz©“ÎNÆn¦C8æKMO9ƒ.C^øž_£³V!Ð5ŠE¼Žg¤§±w4†B"ooú(êÅ4£Œ_åÁªÿ)§Üóê4Šþ}Õ®]=Ý=‰~Rì;«O•»•y¦¼N5“!ÈÌøjÌcäaó]ÕÜ)RÔ'$<§¦è¦­X˜ãí‚°_‡j( ØÿÜù­.çËàs kãæ­™±Ð™©LÀ¯rß/|/*Jiá ‡“K™$¢êE›pSLnø2Ó?©º›jHr¦"_IäÜ4Ô?YÔ°«9DŒs´:dž_àƒvön€˜’³¢ˆ]à]œ«Û2⪃F\”Ã7EH¹ŠBª4@êççy§!CÞ$÷ókÖƒ Z)šß îù‘UM‡Ñüòþ\•i̤h}Î-§2?Vñu1§þ¼ÅبŠ)´ZuËZ‚>–q¤¨ª1äß{_qàxѶâ!'YÛšÒ‚£Ø‹Ï“ðµÁÿ0I¼C 7na ŸäÚ™ìS± pú·pÀ%ªwù¬‡éÊ‚qwÍ!{³B5JŸJi0ù>‰øÞ+ã×»=Öq~ãeE5¼bÉ[FÜ‚0’ˆ K…ÞãfÀ ù”Û±œÈˆ™åD{IÓÓÁ æäèî ¥Óû·I1‹ÿ$ÃçB.í–æþVrhº¢(V·HÑHnŠl(ª…Ý0Q,r˜Š”©Ã  i÷PŽŠôYÇÉÎüÚŸŒ)e3‚þ¦²>ÿQ,Ƹ)1i©´²tJKàI¡µtÑ–üSÁÚ330o·bjÔØ9ô銮e0õcð"Ûu¬ô¸Ø¾¥ä.ñ”ã‡iUÄÉäØÚ³ÍÙ_àçÿÑ>ôendstream endobj 30 0 obj 2776 endobj 36 0 obj <> stream xœíœK“Û¸ÇïSù:’añ~äèÄÙõîf“Ør.©â׬k={½±½ß>ÝA4)ˆâŒ£x¦¦\¦D‰ÿèn4ôaÁ™XpüëþyuñÍS·¸üxÁß¿ˋ"Xtÿ½¼Zq굌|hã?€ïç‚ÕJZ­´j~IøHë囌÷$5Xí‹òíA¨ñÒb/ÃÇ¡„Y''‚k=“.Ü€Ü[áè2Ž]sª‰< "gš?ØÂ@™BA$V¦Y©±jjiô<hˆ™w6Ö¡l”ºçm3ÃÃ{G.‡BJy‰’¨Lzúš{ˆº±ÄŠ8_!ÎØ­ (‹~‹ (‚öDÍÖ5‰#R”gfâó)D æï­DY Ôi$Ð:á¿/xç†cH@~ó¼âç ¨d¨‚Î¥Ž9˜%'©L°<«Q¶<œQ8ÃÀé<ÌÙ k*@•ÍT=4×éÒgåRr ½5x/ÀI¾ý-)¦VH>ˆZJ¸qf¹~æ0}´Ë…­E¼8BDÜ6åt)Xf…:y| D<òÚz0 òhiK ˜Åþå¢ĸ¯{kX6ƒbdv ,U|ÇG­ŽAq!+Oyù@ë¹þåºíã°•„|8ë Ñ͘7ó<8‹§pý œEÛÇ%x1éë¡®¾HŒ¾¨ñâ*ÂMï\f¶sÄMäòÙÏŃè[Ö—ugaÙA;)ÒÆ‹æëkk—pP Ñ:/¹¥tŸ|”öß´¯¤ê€lkî‹,éé`jÎæÚ Ü>Lè)L®Z¯™äá"ؼ/œV’Šè²* 27 ` O7 ϸZ+iRÔVçt><Ä‘Ît0^J]Ø-…Ás· 4+%z°w§‰ ÄÀœÙÛøŸ‰_ˆé ¿Ôò¶ð÷_tïC1 p½BMme¾’ µ„±QJöpx)t4õ6¡&±Ëõ(C¨Ÿš[zM¤l˜|RÕÈ’¡××@LÁ—»`íZœ[hî¬'èå€~Ëx2Sw&ægWXüt©d> stream xœíX[o\5~_ñ#öÑF:®=¾Œý%E@E¡Yž%i¢JÙ-í–ÿžo|ÎY{ÓÝ’ ¢Ufí¹yæóŒg_-­qK+Óÿ³õâÁS^^nvù%>—‹W W–Ó¿³õòó˜aÅ[Üru±¥Ý’i™r0Ø\­?ª·z°†ˆœcõB“afÿÓêkˆ{׋›ŒÍа:‡ÔC=xÙ\PO„$—]VßjR«¶s¢gBˆLÝsbuª‡ˆvy4µïéàs1œ–ƒ·†])£É¢£2“ƒÊAµ¥b¬S_è`rN1«ç BpDêö²FN=ƒÔ|,u5óN¥lB‚{ˆ Ù@ÝîZdRâÔ/£Ëɦ¦F”7SÏ¡Ê'±ñXN^J¥ßìμã„ÚGº8„+zõÊ^ë!ïCÙ3=š"!k«i%ä¼HŸ¿¶z†C™o ×)ÐÜ—v-t‹ýàY(‡èZ|€/±8Ì&W €5è}Tÿ:¦5” ’Ëß¼'Oï@@0tÞÄÜ~Ÿîbb~GH8/7À Õ¾oB$õM½„L“:òAý1ªó\’úMÃe,†ë8ëÙê!Û`b¤»Á½EÞur2i„w½ ~#ô&C=¸ðù†¾;)XQ†’úN{gb˜X:xl¥’Ř9tV^‹`4¦[õݶ“nX<ÛQ£}ö¾I¼Õ¾R®€á³‘æñßã?X§ÏÊ`h@œzXpGzXæTau%°‘*t§Ð=m¬/xM²_zÀ‰ÔXÏb¼|Èüß[´d­ÌѸ’Á¿6šÑ6i?†¶ØÐÖ½*;¨Md²{ N¾¢€Â½ÈÑÇhíCÃëû–Œ¸˜Ã#ðšEŽÁ+„Wÿ“Òñ¾ •÷j0ÇÅ£o¾§È|¼ùþ]·B׃§öÆ×€7zà\çW·{Æ9íñÐЇð€÷h[VzL¶ö' ‹kíPµ`¾£žÕY’K`T5k’4ZGU³IG_G”ÐD¡ç¿63×Þ˾§Æ¬¾’±!—€2)ÓùìRÐíÈ€Ï Úî@8;´Î-@âZê,‹£YŸ'ÿRÈ Ó¼À]¡Ü«Úh9½Å­y3þLüQ ²œ§úz3e‹ût¦Ñ)l¡Xß8s¡Òù=3‡”ÕÏ»ÅNëK8ŽÁTÇÙ9ó¢…l³“=DªÏa´2ùœ55*V zjÇœ³ÿx±útÌ¿kùÇ‹;Ø¡# îŽ> stream xœÅ\Ys]Å~W¹òô–{SÖñ™}&oÆBŠ@Å(Eª Â’—`KÆF&ίOwÏÖ³œ{eC%¸ù,³ôôòõ×}ôÓ麈Óÿ¤ÿ?yuòà±;}ööd=ýþ}vòÓ‰ NÓÿž¼:ýäò§r]¬•öôüéI|Yœ:yjœ:=uòÝîÑþl]ŒÕÎÛÝóý™\¤Jí.öëìj×°{®¹ûy/– ƒ»«=\Sƈݛý™rvñ;#y圴ÿ<ÿKœ[/Î;s³hüéù—'çøn÷ ºZ£w×{#½¢áÂâ ë¢¥ÚînàQ¿©üîV¥½°€[ú°»'ðš2JI6À _øUx¶"l0S~'.PH×ÖWaW™Wxû‚ÁĪP.°z­ƒqåâœS»·pÛêÅ «*·ãZ×Õáª4\RÂRËýW¸,k=Ü¿*÷AÒÖ¦¼X`ƒ|Ðú$L*àIï4d¥¥4œOYÝ8\¨ömZ²50‘Z¼·Rð½]áý€ãï>Û”¤Q°#Ãgˆ/:Ðvñž¹®ãœÁ3ppq‘Rizäe^]ù¯þ_tÂ×ë°-Ôb´Ê[v¶‘#{‰­×ʪk-r¹nwk|µi ÏÉXš^·Mi=lS¹%Píwh&R*øûIu¤iÅ«ÀkðÔ¢M<Šéõ¨q\›³ìS\ª[´ÍJ`àÆóúvž Ey–dy†‡hÐê/£«ÉõŒb:±ø°‚'a÷MS|Àøñk\‘[ÐUá*Ÿ_I›°«æ{ÂÃz›0‹ñý®ØÀ/ƒ©Ûr 0ò”·VšîÂÑ®ZGPUtÇÁÑL²jÁL¥®ÓئUWÀgÁ†¢ë <ßW{ÙÉGyð¿0é£:ÿ÷û2Å‚ƒ(p¶!I˜Øòi0”ábeÛ»ˆ« A1-GÕH^ÍYÕ)ë÷5Y–àUŠe•¡o¢Û ]k—Õu)»Q“ýhðm½æSÂUONT¹êD SÔ›8O€(·¡½ðB“¥è%8áAM•ÊjJW¿©°PMAżðd i÷d _Pß7Þüª÷樻¿gg ..ì>lj±âv¢©MЈ.âÓ©·Â…îvÙ;ƒ}Éæ…Å“ž¦Èc¤-Kp²Óæ…çîýåh2ÕP.Ó*­à¾7Ç))Õ8åÛÁ/´qìyh³Ç‘”Ǝɼi\f Ñ¿Sd v‘~Sÿq3*ä`˜¥Çdúõ3 S ÚÔ_-5ÅnöÒu—£§æÎþe‰ï§1庾þ MIþæf’„„f"ÊjÓÍ'ä‰ËGàÄÜ7‡¢5öf…/Gß*å¶Ê¶–ùloê»SDŒ36ð*‰¥ )lؤ)`„U˜e$]tžû°VA3Œ›8ÆýMkQÚ°q±ïÒ3% áˆÆndÔ ºKzeÁµ¤lwD•(ö@ôCRZ»{3(Õš„ŽãadìPªÖ„RG ö„¢ ïXAó»`‘”þ6s׳8US­>¨ú||åu 1¡Ÿ›Ž«w°|È”¥»Ó9æô°Ãà$®Dñ‚Îr=½k*C«Y¬ÙCÔg¤gÑšœ°}{ÎTYµÑóo¸Õáâ“r6@.ŽÚ:^õ›sÌó$?Ç*ò‹iÁïîrÌ.S¬RkH“v(˜¬sY'Ñx²-q¡¡ «a W}+®Õk]ÿ= Vµ8M ´£0Ífï‚st¯ÑCL<ØæjIZx¼ÉZÔ*G&½4£ÉV9zbÎp8™õC¶µÄ0û«‡íˆ’‹nR˜ÀŸ, ÔÚC€Ã“Š–À›fÃÁÝ€÷"t¤ Ó…†Ã‰›³2æVqaº›,¤¡Yh0rÓÝÇĆÕÁ¶î)pÌ´C¯¹£ ;Œ _¹iuÏð›ôŸöÞÒ÷ª‚3 cäüòà†€´†4*…$é—Ö¨ïš+qï¯1ˆŒŽRË@ØuªhI1ÀØÜ½=¬ £N=iGוá Ωáðô}Ζy·W´t1‡Y7L@VaŽ¥`¯pgNQ”DI˘©è“¾ÓØ#ÉãDJÀ™)ªäAoh¤(Y³A±54YöÆ·­›~‰`êq’fLI ù0½×àÒå8ìú—|)"Ç´ëÖóßë6d*¿†w£˜րDZjYxÈDI3–‚Ó‘g¨òõ'N¡Ç°Û$t7¹C†Äi©dl©›Bd±Žn¸ŽZ³uE˜®lЧ‹Âf÷~b^™Š•<¦”uŽô[O¦ÓÚŸSÓ— [øpž$'·‘V}4²üÐÁ &Ã'°È¯ ê ‰<šUÌòÝqt“UÏAÛóLd™dù\Š(3»b:]dϪ ‰—õ\á™R\'Î^˜É`vâ7{ÉDÔ” AS<«u-HWÖ†öŠ|Ìêù‚ØÙ4t\\eÏòÍYá)¨Df£ŸDÜ( Á¬­B?b-<êI¹É–AY©)où,ÑÚ€¢³Í|·ëàB˜æßV}cf< (Ÿx?T1jkV1ÁyŠŽõÔ°ÀÓ ·!¼áúf0¯î$±Þ(œa]ò¢¯i ?Ö4›0­if2X·ˆ*_Ûâ+"Tˆ"ý]ÕÓº€2XŽä&wžÒz÷›Âç¶–e;åÁ \ÇεOÜ%S€éG›¾MõdHö&¸Œ1ˆ¤ >+&sÞ~@Æœ…¡í¨ñ1ÍÙÖø,ÅYe‰M;Óñ7­tlð)sžLÅÑF„© ŒúÓÞÏÂ3´)»„u-™¦ÄÜüõÌ4ßIÆõ @\SmdWužƒÌœå}˜Í *´ÎÒ€ªH%äÜ6·•&å„¶¬"ʼ,#‚±0ª4/bý ^ëÿ礣´ÅÃ+Åb|¯uŸì³U} Vµûå9Ÿö˜ÙGg²iܯþ$¾YÕ¼Ó$!4{qèc<Ù¾Wgfè kË|ƒ’=ƶf !g¡-2‹N"‘Õ´÷60þõ¯°$k5,éáLu¬rú@óaùù¤µâ…¢lqL‰0C/Å€ óõA¡ŸSr¿yc ç@.˜=8® U !e¬`íf|Êô­l Óÿh ÞÏÖÐñp).ïÇ V,®( §ð²4Ý14öªÆmë.Dɸ­¤¾©ÉÐfו—[ojÿìšš‚òŽWð`6‹`Ï{#!‘´Áb‹|•.6l"ü×UcÇ„½¾ÕRIM¼‘!¶¢$ëà6ðC¦Ygùù$AMÅœVZ=fMoqû–•ãâ𬲾Q5£Èü]  Ò½w08ÜÇ}Ä®6Ó cýF`ΜQ±ÒjP¤â¶ ˆmæ´Œ´¦$HÌœç–=k›¹Ìûèf­7¤¹›†„!l+ŸyqNo™`•ÅnßâVà ÚŠèõÄÔ˜¹7ð/¦âQ–m¼Ié ¦ã+Ò6qX¦>9ìËjO¼œP;'MÑQ'Zßmf"“Êi}tÎ T®Oλ\J¡fšB§êð<ÁïK')nbµNÅ,å¦K?òˆ)5¸Vv·›pQc„!±è)¼sµV I!¿ë]«åØ÷Fc;‰çR‘f TBSªºgÞïPN8o‘Ì'Mô3SíÈ+^â}É‘#)…–*]î_ÊHBnºQiio.ЗaÝ) G ù×(„vx\0=È’ hÄža:n ŠÓudòÒ|È6ñ øbÞ’ u 6†ÎŽù¬$®<èó(™¼gd§+Ö¦óXÈMÊí#:g¨c F4ð#4Àí0ïu G E„IG¨m?´Ðß6¦zõŒ˜WI“EX’)Ifˆ}g»ž£t6"Õ?‘൨çc´;Ö’ôUј‡m_ìCR‚sçM“¬gê²q†×e¢8?ø ΄£t5o‰XÔhb‚æ{eÉëU"Tƒ4âT9Ï:w2bõkÕ«Ã…¼6€³ÖôwÿcÏTuf59gšA±¬ŸšÝG›Ü`þM¢U\‰ïšŸe""”ç§õ–*äõXQQbéæíÄ—íU C'ÂëXxïrÒÏwؽ~Pqâêv d¼=¥ïë“躂§oZ(bõQÜŽx4ŽáCˆH )T$"sqÊ™P­€Ûm~º¼;vo|È€Òw )aªØrŽ1:ˆy誇UÄ8p¨{ŸY…ê<ÐE‘ ¬(«›K©I¡àZ$|‡&9µÆ^îHþX› rIÕÐâ„Xp^6lcÁÙֺп¬êÆ[m S’$ß¼mc‰Ð]{ëM¼ˆ™AÛÐN‡ª?ŽÍ¦9 ±›¹yUÔþw¨iSöµÆ6™´®L Rïfþ1„ÈÅkÞAËŽ1ü´ÿÃß­‚”åêÌþUÜ–±¢ ?i¯!h êBÿP'hZáÇ8ÁügŽ?¿k,ß.%¦(E’ µšë¡ûmJÑófÓV·µìâÅT³¿ÆFk©ê† ¶L¬åæÒ ¤¹ 2ãG”Ǫ´]]•º9îÔ„Î>“›çGàfùQžð!Ójãã£Ò¸ê÷…–ë<Ûý¥L´ß¤¼b]\aÜ«“x1æŸÓº[ןöXFp6̺/åCtÅ¢6Ì44fRžÆS‹Qaˆ‡r5t^3Iþ¨šÖŒc†¢6?'JÊÚ|û:o»fßNtØhâ _3ý”öcÇåL[¬C ~ ¥±!2©Ü˜ú¦d†éUÕPÖró„ƒnÚ©«Iþ?Â}þæ°±ó2H&mÒ±Mr?Ãm5™î‹64˜&WÈMÒ³ìN Jˆ'£é»Ž™;Æ5Å¢ Д"jfø4$'UÍ·øF^zR‚ªA?~†²†èX™]O•·Ã.-ÎJ\æL|¼Ø#÷¦pŒ»åçzá=*%ª‚š>¥ïJºLû,~¹²Ý~‰hS9ò¢Ó˜q)Mzy&m¤Rú¿c]ÔF¥‰Í”<³úXŽÖéô¡ogî,3ä¥l|YǪ7ßW±xMŒl›Ì¡¯áXÑ7XÿfßÕmv˜ÅŠdIz’Ô²ÂÒ"ˆ´åD.'UXõkÝ%yþj •‹\DYl7åÚ»úàƒ"¶·“3±ý\ÄöËlÂ7åâUyðÁìè_” ŠçIs$ý/žb¶óø‰Tˆê-"!ýéùÉßàϘ´˜µendstream endobj 47 0 obj 4589 endobj 53 0 obj <> stream xœåZÝsÇW¹ò7Ü»)ß²ó=Ã[Bˆ“Ž1Èå—«rèŒDtÂlå¯OwÏWÏÞÜI`Þ…tÌÎöôôt÷ï×=÷n5Ob5ãßôûìòäás·:¿9™WßÀ¿ó“w'‚&¬Ò¯³ËÕ_Oa’02…9ˆÕé«“ø¶X9¹²^Oððôòä§AŽæçÓÁl%ølÂd5¼pº…Iǵšœ A ÿÅ‚×aøË(‡gãZLZ'‡Sšã¥ÐÓ:úFˆÄh†i\;ç')ÔðOœâƒRbø÷˜_vÎ:xCÉIí†ïpPJiíð·QOÞ;†`öã:›­ÊDÆ7…¥ÇýµÖX§ ®A9'BˆûÄ-]ÒMÆ 3Ü‚”Õ5ûq=£*B¸áø6°;Ì𠨥µr¸ÁÅñNïGºZ)†×£D5Õ°ƒÍ_Õ×Òdgåð5®a@´^Ö i ;Ûá|Uå4Ïnøu\ëI)$[øx4¶§UØœªS®¬'ót5‹I5:± žñ_\O*ÍçÅœRìñJølmý¢~Ü´F9+Óë‹—°ùÉÚà}#(h¦À î#À¨Ù·¾ó6ŸÄfDo^MÖgï>´¡ð Øãj:‹:xÁÝÎ ýþqõË¿ÙY™‡2‡8pÖÖ…¥S<áüMv6*7iéìðf4z‚ƒˆãñ˜ÀúÌŽÉÊ9d¥t䪸h•`âvg9iåÐ Ñ¡Œ´É³@“­“ÍÖ`cgMÇ<«ºd< íÐtýns¶¢uެ¨ $Å\´µ¢R˜d:kLŽs1+žÒGRŸ¢&11½H>hd++Å ®£ 8#f£mßÇßÀL-&©ÈÆe?æ DÕ5Ë“)*í!¿0óK˜tjÒc©öQR7æ/íyþÒfò*Àq(P.žè¡HÃø÷®*Pü÷aùAóPSØÒ:†}Š“1#€Á `úA•=¹Tšóªž•Á©^•ÁMïõÍèáƒT:•1¶ÎntSðNúcyü°·â9Éqm[׉/Ëàë2ñª'ñUYð}y¼ãúäÁ·ENÝÌEøKgb9….uN‘9:s¬‚$°0ø2¤EHØ?–ð÷¬¢Ôô •àŽ fÊÛÆ›á!D»%çgQÁ–e`‘²µ³ºFÈ%0YöC&…àP’Æa<âœíuñ›]Ö 4½„ú}Þâ»pà‘fŠüB‚*’&È$Ö“7ø’… vWwh!™¤ÖŒAoQ¤{ÈüÌ¢LÔ¶¦íœ–³Pi=Ï÷ÑÌfañ½m‚×%ó³çƒ +n™€âîWrLäW#º‡Ö]循«±5êÂUfc< Þ#ØÉv"Ü1+d.¶3cÁ¨¢m‡‡¹âTvnÜõ¬øh…!ö˜½”Óº‘Ù0Êà» "tû¬zQ†’&ŠvK¢–âèm ù#ølCT§8t¦ ‘jlA¥ `uXq3•²(¬§–U[+ˆÅ’˜¦]X8¶þ.0úã.ò2KœN '1®© ‘³@ÕI!gd Ì K"/^$Ùà}51Pºj¢bJ×@´e‰ƒÓ&¥8¡–8望+J{ÛçYèI6 ƒf½’\=Ôö5²eÅgeÑXZåèØcœ¶ ¯¿‡<ç! ®ëhª/€ ï×klWpBö§êÊ5¼0QÄèe&‡hëñ!–Ç=¶®v˦QH®œKÕ  ,¹Ê'ëønz…ašµøúÐI9ì}jHXN<ªLâèùGª ¼>Zñz¨ eˆ( p6m|³'`tFE„®Êñ<¡UÅÏV2];P.*ô0Ê¿©Õ>ÙK´Y‹*P!¨ ‘:!êl¥-9Âma¸}UWc‰»³R71k[0üM¢m¨„vD„î“– %׷ňM7‹ÏBD?7yjzFôæ@üv jEÜ¢TF†±xÛŽ=¶[{Fñ–/!MMêûÑÈ(‚èc@ApZÅ÷…«ì‰Xd¨-'š«‘ëêÿéäŒFTC*¤ÁWiËš#‡u0Ì’¤o;ÅÊñVNµì[)KªýÖÝ¡8­¨–%Éb&|Ùº6ïÒÐŽ• 1 1©¬³ÏöMZ<ÀÞ† <Á7Õo¥MõÜ6J${S$8=;DÂG¶ƒŽ˜œ LÉ#íÊó­1ªºd•©òÀSŸwËJ6¡æNȉnMFOì8=Ž›v·áxÑí<kmì#±®6¶lú°ƒ#Gqm%ÊÚ¥¦®0SÄŠ#Œ%`vúEzݯôt Øt+Ó%Ò-JÑ[|ÇRd4Ú5j‰,ït±CíUê7ŠûÀ‡ô3U[ýr¨ô\¡km=ât˼¹ç–ÙŽèýÛ¥f+cD›ÈÚ¥òjsüÍüüÛÜ^-ÛÁÿé0%xFâúã·jÖÛ­ ;æ¨+.¢# ••jä¥ÍÓØM¸T¿ŒÝä¬Y Ì‰Û õ¡I¥”ËзÇÓïuç|2é&¦va»y²Q¢Cz"HÞIfªëÆdFìYu¸÷´Œ{­‚M#¯îèªÚþÏùg!ÜDB‚› W¹¼–CˆiÖ%ÑgiK[”l»w„䀅Çê•Åïò Ç%•@@ŸÖÀˆÂ¾Azøä@¶pêx±h\Œ…d‘ƒ×•0~Ã8;¤éªé&b½2‘ZÕ¦6¸ƒ%âÊãAy 7Á[FM7ªÖí͆הңHÛ$'`Þ˾sé9&×}Z®|öÜÐò]Û&ÎX÷‡róÑ«I~Gi†ŠÙ~à(r¯¡½b¥2¼èÛÛ*à߉&EÚoÁ4%žÕÛv‡·¸± Tcô’Q¤6ø#œŒs†÷;ûÕ뮜ÑoÍjäÄ삽¯ø• ‚\èKÜ9¦kóÄð£eZd¸ ˜§â>äLØÔn¹¯Ž¾ªbÝv„)ÑeaºÏa„U‚ œN¶Ù¡§{'rÇ¥}Í|CZ3½=%¤'6Éðx§·y‰Ÿ‚u*³•ËÞÍ]W¾„Î˲ý^ä%W — g•PÈÇgÜvæÊRZºá]R B-%–ç&4HtüšwCŒ¨ÎáÃn޽€«bç ‘Ú û@q›-ÑÂ@çÖ|Aô©gr™[ÆàÿË›¢±j’÷ºD ïT|Ú5ܧÝ!hOÈÑPP ÑÙ÷²]ÚýðôEk²a3_½2­c˜ÑCôz9ùòU'l¾+2å±ÒÌý¬t’<'A½B47Óë<2†´!ÖÜ<Æ8W‡Z8)ÜîÙÃáì¨ „G¼Z^öç×àÆŸó¥LLäLåkjÑ`g_:øÌ†zçî¾|ƒ÷RbùéÉéŸÿo¾/Q//Þ—o%ìz¶zÛ15šíÉéÉ÷ð÷`aŒ endstream endobj 54 0 obj 2697 endobj 58 0 obj <> stream xœ½ZYsÉöóÄþˆ~£{ƒiÕ}8ÂŽvåàX`¼¶ÃøAH )¬ƒs×ø×;³Î¬>Ä€±!4ju]YY™_~™5o;6òŽáÿôûørsðÌv§ï7¬û~N7o7«`78šS®¿¶Ê8XPánÁvÚÚ{GkÇ ‰´ö° 9:gÇM`Wåui7ÎNŽÖ­ñd༜‡öªÓ:ÎÐ$ʨØÁsØïœ@ƒá˼¬5" žjÈÃ`èO.r=èÜ [¢l<êTmÁTð$ª ž„T¸„ÒpÐŽ3\µ±wÝ_ /É­¡+á>à$n„óî¿[.õõN—¾à'd#dÞ"ïE~8AXÜ=ÙÖ’Ê5ºêÜ{ž´oÁl‰rwµ}¦}ø'Aûh. õˆÂºÝ `U”Äk•„ç$¼“HP[,û¶ŸgG ŽÜ߆î üüø·hèiÂr2óñ a³àÚgxnTZÒ9ãÙ1Þ¿E x”Å:P˜:ÏÒptaæ8¾…ÐŒRA ƒ?-CÍAhÇ0Ò•¦q‚Pµ4P„€ØK¡zÁ¸ÞcGàÿE_\á{XbÌë¬/Ü#ð#÷Cô€»¯ÂÝ/úvŸùs²n@TðÙ}$…€‰qzMÒ³`ë¹Ñd[‘sW°Y%L‹'ìÞyUÿeà|ÜQ_ÿ+øú¬ñ ²'¼¯$jÏó[bb‘D'!o£!iæ+F [ñà‹&G¦ @æÀˆ ˆCãT cD–ˆLŒ¹àQEëÀ?õ-” i›Œ¾µ~P8ü=vä¡c:(äN¿Y@åàLíÖå²÷ëTKOÄŠÊÁ“ Sh– @[É3•S…"´Þ,„j>ŸáÒSòVÊ]ЇÀ[ƒ«Ošˆ†›(×Â4ÊïYæyõiÑÙÝ¡%p@úÊŽ e°.t ìÁà1MRœò¶|Êé¥aªh\ bâ]_æ¯Q‡ˆq>ÌuLlHV šÿ/êì¢sÖ!×(ä^®sUÔ B&à݈óÚ ²Xˆëþ›l,0®Á3\Î-2o£¢ ‡Ž “j0íMÀ!ޝ¢ê”tdÄYÃÓšÉà—…à%¾¿Û<Ý¼í¤ (Ï:ÖuÊ€*×Iñß8,aÜ=Ü>ê>¼ûøjsð—Žo~»?߃_‡?t¿ÛÜ?ìž®–6ÚL2×6”÷£¸ :V8ÏŸdoê¦x S‘ú'ýÜί*q¹[X®ä¬bqZH‡LVÓ™6æÚÊ ' *o?«AŒ5'ÑcÙÿNƒ\bÌ„e`5Õ¨‘g „"«–“À1=¿‰5¤`”ã ÆŽ·X…:âó9‘E&p ³àA3y›')ÒTçhœò×A““niÌ'd€(ìrDšg5ò‡ý¡oåw$a âN”ü&2T)V‘å¬8 ŠO 0î:ÑZx ÔÌy,Ül"ÆUÍí©¸3ŘÄpõ*ŒäÓ™dë§Õcp-¢Ê‚[1FaÉÜ™)Û‚Yp5³&Dœ0åÛ,“.R- ©hüÕ퉯'- CêW?ìTCïrŒˆºÕþæ°}eñάÉTpž¹­IÌ™´œ/û.àP”,LÈÉ„Š}¨)Ì|Œ°U½ÓãnÜ$¥'‹½Kf>”­|U²Ÿ11­Çжt4§53„E¬£†}ÝvµÈ6øNl³äEL¯äòM*EƒHðån|NhE *½Øõü=*· ’ojb=£’èM$ Nülæý9•ç ësj;A+t&â‡oZü# ÕÙ—<©Á}HžÄÔÍ„¾‘lB^ò†åÂm›m  ˜ÂË"®)Xª•¥Ç£÷H,žEE¢^‘ßép›BÁkâqÇK$å„@¬R–ýÏÈe.¤ìWÕŠm“Ù$ nŠ/B¢¹®¶º¡œÄRÑ}Îàѧ*Å;K‹ Ÿ J›š7ÞX‰éÿ<ê=Ë¢àªUâîDŒ6>- „Ü7Õ¢ZÛàT3®uÿ™Å)šúMÓtPŠÄºœ¹täÌš–·IæCø¾¢]€K¦Bþ¼è —ó”B—ñ>«QddÖòeòó WÆ:ÖtóÅÉË›Ñ{… fèÃÊ„áÙ³$YfY‚]ªf \j™‰„^Øh^.Å&Ø5S4ßÕ… W_QªnŒ™Ø( €Š¶ÀCý‚I¬¤­²6Éc92íhV…žùaN·®’uÉ6àµ`Û8™5Y¸tš`ã-ƒKºkc½Âu/]|³Ég~­`±§ÉÎË%'ùì|cDÒµ¤ |ïÂU Yj!AÁÙ÷¢Rdˆ`*&¤0»>H…‹¬B‚Ö¢á®]ÌH!G)ü *=$ÔKªxÿùrÊš¼ëz)ü|éÅ‚$ÌÖgßɰ–4¶mcE Ûï „.\©,´½RX&~“D3²–³Û¹=pí«=àîèxëšqG–ˆ.f¨7Q÷‚)oÊ8÷m/ÆÂùîq1&Ð;ˆ¨“rEbº©FÆ8½'&×°3ú˜¸HØ¢Ò-É’hÌ·V g&øóq‰3T»ýYÒÂÃý·¡°Ç<Í/2ŠXÎlxà“wV9U  AZŽ3¦›4^/ k ¶ž° ·BV5ár<„^àò2^¥Z7pÑuZ½`Õu+X‡Ø!U¸øªšvtý- 8È1eãéNZ\[Nuÿ{‚CÏ”£E7 „œqÓ5T2èpDL!4Ç 6L&> stream xœµ\ëo·ïgÁÄ!_|WäVË7Y ìÄŽ]$­+M‹8@ô²,Øzز»ýç;ÃçË=lµA×ç]rHçñ›áÐoãÀ#þÿ<<ÛÙýÑ,N®vÆÅ·ðÿ“·;Ì7XÄ?Ï÷ ãðfp£c‹½—;¡7[¾ÐVðqïlç—¥\©_÷þ­£­¹àƒãÐaï}½Z‹ÁçØòÉŠ ÎYé–V|ùlµfƒ”Êðå^ió(¼Ò.„·È.ùJ-xÏ™8§¡É8XÇ”´çƒ•#QË™\>ÅOþ'–‡‘¿EÂfà@àñ Imb'£=Ÿ¯Ö ˆrÃhƒ`ιÖË]˜[œR ôstÌ)=Ã,mPè~JKù¹æÜ L/ÖÀ Ü |=ƒ>ËS|\âã ñqwøxŸíããHŸ‰Aéöð»½?ÿ²ü¿=ÂÇ×ÛÓÀŽ¿ã‹³[Žý8¸fØ xü3Oà_7ÒÆ‘±ŠØ³Üü|çæÏsïýüë47>ÏÄnž·o—Æ{€oòª}Ç—¹ãOyUO§ ãÝÄÍ<Ë/¦Ì l ý|;.ç>­!á5zô²È¢¡,¢:¿YqÔ$%@¬µ1°dÊe9¡G‰¤Q¤S0”J­9ƒ½‰~_ ÿ‹™úÇ•5áã—@S¹Ö¡(]é…\£xòAk£%Œ:ï¬â@¾ƒ)ašŒpTúŸ–¥@C´w,ÎÓ±|U4òM1JŦ|‡*ž,žPÃȸë#PÁLÁnH.€–.ëËcŸw‡¡Ÿ}_%nœÚ÷ð]k¡„gøkÏ]-Òöp!—÷J¿<$Àå ”%\¬P*0¤ Yx¤J¸w„Lãdfjtifh÷òî¨å}?˜Sr¹†–`ìa/¿YÁ`Ú-ýüFæ·—läe¡uš ¼É¿ŽS·(t\[oõ÷ ÁLivš¡7ixñ®Ææ'ÁÁ­Ó‚×8oålY÷K$ˆë6sr/¤Bɧ*p]˜uÞýÙ 5̦!Aà љzÃW0=٠݇ô½ÔažU£.d÷aÁiv8fœ³ÉŠ‚Âr½':bIâËf‹*µ«;*N³ó> 99¤è.ÙØ ´_ŸLþÖ7hý·uДx^C ïá|àÂvï ŒIö —ÿ*7!ˆMPhrG4×h£4;[i tK»"¤$`ŒŸ2Xê Æ‡8>(Ì®K)£ý¬àÆiúºèoÙE²CiÞ€¡V5”E^ ðâ¦ÁÀR)ýËyqM’ô²Á-¨¡ŽD[Ð-¯R…IÒ‚¡DÀ‡r ÃÚžg‡è½9ê29º/´. èå/ø÷u~\Öø¸">|@¦Ó­^~•_î–—ïóËýò²8Þ“üë¸×‡:¥«I/¯¨O/÷Wè´¸q 3éóú¹ô±h$#Ä/JÃsOG§áóåf:¯ò»_sCÜJ«‡0t$n]Ãíãz¿ö3¨yÓcÒ:¿¼êñƒ´ätRÒ€ê0åÇ/×=šÇ” < œ½õäÈ˲h1ûużìJˆÜŸev½Ž|T\8üòbI1[j?tÖÛÎ×ÕìÔhá/’ÌþU¯Ó»Þ’ŽÊË2æ‹ÅÇMdqêÆýýi›îV*¤lD+™xàÑê«Zw¯ÒêD_‘ÊB.Óà¦éŽ/™$¦æ²§Æ§åee”¦l|S±‰HÁFX]¬aÀÇk®!~ç_D¯ˆŽÅ@0H’÷hã,@/®§àÝÖ â®aW™[9$UFC)Ô\‹¥.‚xÒ>šÃFÅO ˆ•wo$7P£’…ë®Aȸ†Ì&àš@HŠOD3È-)("up îôŽU'·ã?™Tñ×heÀÚ)= ÷ƒØ÷Yíƒ Ý+Œ‚f ?"ùˆh­8M¶HÏ,šO\NÐÂïÒ³@ Œî¯{ó© ˜…†SŠd8#ƒ­‘IF9pO^÷`9ÙÐ/q} e{V§N¨â„¤žÅßlâÓßÒF6‚6à K¨ÞGþœUô­åç$ͼôö€‰ò¨€Iï“æ%̯OR©¾˜U¬C"Ä0IƒfM:1«˜®E€;ð2©Ëc÷—xT©#ÈH¹¹qE‹ÈI%ÂMDÕxŒŒ Ô¸dÄF$3J´­µyZü–Çò¯¿Åpø¼Lå^IQ3×L’D»‘¦×©ÈÑÉÞ£‹þÁlaš–¾½¾IX6°ÑP‘8m¤by*ƒ$“t¥×¼¬07ŨÁCõbTôn•V ‹^ev×ÂÞ³‘;ïÚê)ùµÐΧTºÒ³OY2o§…}ŒøÙ~ËÒ•:šdÞyCˆ~ýÏ8ˆ©ÿ9œÂßnµ'b7I Œ•0ÆÔÜxfÄ6œ¦оõä7X|ÊE«€0;P;¦)„„6èiz]Tçã`”KÚ2±;$‘Šsþ¶†!2Bs4¢'hÓH„c(„•ttÕ¥ŠóJøsZð3Dà› ¶hN›YItÍfxCÃèbÛjsY†Ä$!¶ˆð$}yásóyO¿á®›Â'GÑ…âf É‹Õ$Á‡II.’’|$ún|•ä\͸ˆiPŠ1DÄN^Ô\PZšrÈ2å8l‡¡(ŽhÆÄd¢ +°á\‡@B3<Íö·Œ°æâ¬š™’ÔOiÝb€ÞXëÒýpqmHçÇ“ÆÃÚÞvNƒ%Î(–N¹ÿ-¢„}ýÜ?þD;.­W¯Ç+ÇpžYý‰Iö](›÷WsÑMGž¾Üfx¨<ô9ãLÎÄ)Pâgd j8kšä3ÉWÉç”8ú?U^–líu/ùH2u,¿,}H¦¸Lÿp&Wµ)AU1+'¨ˆeœÆ]HÑp¿ÅEVökˆ@D# @ÎÊÌâ!C¡ÜDà{ñu ¦øH<·‚Hü­óC€”1>¯|‰"V“¼¤§/dˆÏî^ÜáJϹ‘|ì0f«}Ø‚[õÁ ?Ýið¯FwJÊÔ`‡ÝÚØÒZ2h´[™lߨËÈrmÔëöU€Á8¦x¦1@ØÇíçW¨"B‡”wI6Ë‚QL;®[cÉPߢº­ƒFäÒ8h¡}¥Ä|j&ÎJhZ  “?­tVÓ­jbéz«ÐØXA6 ‰KЈ ÒÆÝUÿñV@#Vhðb™eÇ 3í'ˆr÷Ï93Bq7jÐ9I…6^Igk]ŸÆI¸¯q ˆ’ÓV3¹ª”mP®tp’0œSô{KT”„|Ì’a„¯B- ¡9—¾LŽ*àB«.ªˆœŒQÛŒ ÅTƒbÖÖè§Ž—¡]%Ž)ÎCI[öÆÇAª—„Ð Qyí¿¥»ŒCN»º˜Øõb•÷½©¦¾Pð†‚Š¹çýH¹:!êGÊÁ3ÚåWM¢œ¶;(–'h©•ÔÞ•da&Ybiɽ«è¹X‰G¦Ñ¤öÈ4f€âdÄ  6N&„Dqä©r(v„kåS/¼PJö¯2¨É¶dÓB@Àç©6¯]p•tâ“)Ç<žZZ>01uê$‰N2½B®|¸æRÅæ©6Tìú·“ [R±Ë,±$ÁÀ"¢!¹.šøàÖæãç“ ê˜s!õ_7éåà0¬%àgUiãϭЄõ:uEó  "¢&º{Y´mÖ]™Ú»¢dÌY®ë©k‡’Š@¸¤F_ÆL‘fÑâfs#ñû+Ek¬7'ñzºœ &x B¬™kÓ“óv¹«Ç‰j\Uލ…|h¢P²3_„eŒ9÷ë]ܦüõÄç mq¹þ¯@˜¾¯SÜ2œžM/k®Â5)Ù)QŽDçØ—ž½F¶ÕIï’n =ÐÏWØ“A¢3¤#zÆfÞó~Èç_bÞŠä{`‹ëØ|ÉdÇ¥’Éß:LÈPwŒ>øáÊó“…êãSØ 'Ô1AcQ®[ïY!¬æ$NœÆÌ©:TH­hY@U&2W Ü뇣Î6ûæŸíŸRo,-Ys0u戕;·8öt¶(žî:þ\žTTŽÎcüDZ>vÐæúèÆ¶–›Ô,‰7K9ôL[ç Š#­J:$¨‰ÒŽó4×$.¨N£ ˆÀ$ŸXEâ»{–Œ¬¥‰*•±¨:p©öÂÓd{Jû6XkM›Zšæoæ ¯ìÍ·Ä#ýë"Ü™>Yâ&n'EÚG=¹épÌÐZãƒv³¢zÃHÊš‹­ëIžµ:÷ý»j1©t–’.ÃG“ˆŠhñÑÃÉéV@éÁ-K4Óã¾bE×±Ñ:G7Øv¾X|Û' }:^Wg¨ä¨g²‰;#éˆotÛGS‚Kn?±’ÅY/Hûå°fÒ¨Ôò‚é.‘±?bUê„17!UyF΃£iO›ƒÞ~¦0†§Œ ,ÔÒ„ »¡6a‹¶mƒnñ ð®ªðäš/n|Ul(9î çXšÍ¤>»66]T ¬šK4u£.˜(bWûB3‘yî*÷.-m{w‚;“®ô3ý~n4UòØä^åºU¸t”×ûã¹`}…Å›/&Ûˆ0^™?¯|¦ò±ðƒ;À =-èáMQUþ*ˆu Ó ÎǬ\Á+ªÜöR¡€Ç…BŠN%.nDŒnZ‚jí(vªkYW ˆ¾ŽËdÔµ/‰«ÓL{`ëÑ=²=¦ )QÈ…šsõ‘eu²žT'°¦aW’ìÌ.V§´£,Õ¥à£7åc“[ï83]àíNê\ÚÄ8…zNpë‚ ÊnEJŽ!¥®Gé5…ЫoÆy;Saô^ÐOO{ÁvjŸHkô’ qVŠy4½Âcü)‚$e]Ó(Y Ë«d.%Þåñz£à?ÚÛùaçíB@hæoØ!»14Ðda+ô³xiÿáÓݧß/Þ¿»>ÞÙýyÁvvŸàãᳯá§ß,þ´óèéâ‡[^æ—”ZãÍ}=hnôû)£VmÓM{ŠܬGÅñþ=¸·ÑÃÿ½Ú°"'üÿ÷93Yѳ–ýIÍ'ÿ(À“€Ø\¿H…`:Òª}éæj>’6Ø¢šOH¾'’\Nk:E`ߦ08D,¹®¹¤ûûJÑÑÑ÷|MÊb×Å9x¨UÎL ´Ônæä¯ ½Pñz°ýrÊò ¸¢rŸSúä¯ob’%&‰/íÛt™ÑÖKÙ”’`A†ÿw+F‰Ç›¨\ñÚáU|¤;PG¹–Äy™T—âÓX<â¯CÒ «.¾\åKLóKr ð:vr‚Üy#u%…)A©‰×ÆÎzD«ª–t±ª\—ê^0;O+”È¥TpSÝМ֭œôÆ$×øòì:WÑøÖ{q–¿ø_Í¿Ûð1N<Þ+W¹ùñ¥{·ì¸làao/ ?–1/zò±ïÞ˽lXŸ(™^ˆìÞs=I¢+éý¼WÓUZGiÕ ÃŸ¾ êk0—DOÆŠðÒÛ—˜íVº1êo²öù ªÕBÙv›µ­Ü Qs¨þ:O|OP´Ë޼¢·móŽtEƒløÕÌl²Ó¹–QÈ®z-Ë;{2#Ã݉~앬uïdž%½Rt&™Í•Pͽ«I6ÝC’vþFas±endstream endobj 64 0 obj 4486 endobj 68 0 obj <> stream xœ½\isÇ‘ÝÏXýˆ ÅFìÌšÓì:»ÊßHJ–¸!ɔ۫°6 @‚´p8(qýfÖ™U=P¤­09¬î®3óåË£ûíjÄjÄÿÒßÇç˜V§×ãê+øÿéÁÛnX¥¿ŽÏWá&% eð£«Ã—ñi±šäÊ:=¹:çè\ â Ð?qÀtEá§›áÏ uC{ÉË®ãí³IõNB˜*|Ýr ;k¡$AÍ> |33Ä” Þœ²7$^aÞÈÌ‚ÎëVQ•Vƒ—¢ãራzo| '|Vþx_­K–œ|öUhÞQ)ÁÿJ]~QçþÒøMm|ZׯJã£òë‡z¹ŠÊ?jã3úLn<,_#‚¬_SÁ¡Ä#Í'.§ÜyÖCîu·»HÙ©ãa±ð™£Ï³bÂA,°¹D•¯Ë¡Ué$bTµè¦ ÷âw5ß!GíΛºš7ܶ²fúŒ³â÷ƒlå*Ô¼Ï=pJÚ2œ ¥šP‹ºŒ_› ë;ªXËã[Œ~ŸsœÎzÙYræ° (®u½âVb$âdÓ(n0“§Õ¸¡âE ÚR0@}j÷ºc]w¤Úo¸þ/7Œ„_qÒv^gòrwOçU4öÍ™ìIq.šq nÙÉ–ê …®™³ø—*/d¨ÝÃ-Ƽ(\ª?èd©wAýQöÿÊéÎÕ†‰™¼àăõ"ß×)½Úýø»=Ö—ˆëåÔžN9›7îf xY`¿ ƒü3>#¥´‹0A%BPñ²D Ž@ì±ÃPåÿ ×+Ñ9ä“E ÙŽÐ…š¼¥Í•4V"L¾µ“Õ”„ra$%šU6ÐÙÚS%§ïÈð¯sÄ•ÐÐË@eKod ±7©tî-ò î]âÂVºž×–A°ýyíù,·ã„Á—0°§Op{§É{±þÓMvB‘ï6°ã£€A¾ÂËÂk·þ·ƒnv“ì.è–ö$ŸÑðü’69éJ* ÍŽ…Iå~ëàÒ‘Ó‚ )ìeœ âò•Bóöh#ËoÃÞF# Z;÷?톡óiÂØ©u6¯GN"ŸÕ$\þ‰­qÓ½Ñô:²¡ƒç‘Éqã-eÖzâ6´ØóYõ‘NÛ­M´£.>ÕD…ô2î8"+•Ìò<;ÚV@pàçç3õ[”ei§‰ÕÒ÷Ií·^?I¢£ ñcîàÇú`Lx›öyXT>,±Ypîq “R̦Tï&5glA ¥qG=gã1Ú¬Ž½Gb\.p* ¨$,]ðe˜P|6¥‘º(‹:²¹ÔŠ÷“i¼) ¼KyïÚ¸`,f‡ÛÓnVéÿ¸ÙÍ2Dù u¯4•gÉÊIû£ Ì9\&¯œ4á€ioÁ6/]+2ÏW­¤–Í¥§Ý@EØÜ™Ö¾ŒèÚe|!"vXïœÉ üO¤5½Îª«ÌTÁÏÊ€Be1JLe"Väý@M?+QO!,I7l4…"Ö)«Q>0ø˜%8rÔO!ÁMõ=fÒ&o°g©-bNÜš–ç¥B£6*o BÐe•”`ü*Òóö‚çÙd-ü#À¤H+‰íÜRÀ€Y)FƘ.ša¡ÃC´µÚ€47I KLtE7…!A9:1δ¾Û(7³@îÃåû"Ç…òük•52o¢0\”ÀØ$vk ±È ϳ‹“ù®Kªž}"É#t¢Kä㨥$'I@è¿.¨MúHQ> çù,.d2tR¬^ùQ“¨O–€¼Ô²ö×I'¥UªÉÈú£¦l'[]ëÆ @˜GJ ,NÜÒþË,’‚ÄÍi­r#ꨚÖ. ;BúïFw[²Œp bèbZ4`Nì—΢Qe]Pè£j0ˆ°P¦ÜÑ20Ø8ÙZí$Q2dKPä¦)<†umšÄ¢®å^ËÓ¾pµ*â3:©Ö 1‡ÄX˜Ú¬GÐ  ‹NÌ‘·È‰$ëAD²RÅçUb =j­@Äm Ž~È$ 3GŸ$Ô4yB*jŠ ìA@ p‚ù*³[¢b¤jMGÕ{d|õW’'zì¾µ C®àõŒ‰ ç .Ðå0œ.$ÃÆ$•˜5Ï;zJ”™¿4)·· ma†âÞZ‘4îõ"Ïa$À«߬ÿºB„Üî£àaGoû¯ð÷·0?`‘ZoX H¦Õ?ÄqG?þQé2›–¶c˜Çzܯº#…j¬Ìò‘ì@ÙÔ1îÙ—‡ß¼])*Æì½[ç¡ï•ôh5–m=~zððé·«›«Ûÿ¶¿Æ??{=ýbõo_>]}¿XÎÕ†Ir9jƒ†a`¤%]Ȱ¾jµ£•£aNüuQæBÞ‡nKˆ¨Ÿ$²ʶ‰—¹¶“àMMÁè€ 3õ*ŒOYÂe#çþbÆ,Ìö½Ü–ƒzj8†‰‰Wcp3[ÿ¼rÞ[†­5a ?¢G°DK50S±ð³z½>ÄÒ%%Ï„z¨‚®‚f]F7ÞŽhÝäúŸÑ¡Ð~"˜[ǾÁ ©À¾ç^Ýs–nv&<1oŒï ˆ^öÎh\G¹a¯YI àh!¾”†±±¬Šñ©$£xöÒ)â2KÀì4%ÖItf…Ü]sÒe6xq«üU& $:u\x àv?oöCâl(ôÏ—”·ÕZ>^ˆ6¿Î‚ă°ÇEXûÐx‘i[*°˜þaí> q]Zô%­*3~: 25x‹ÃÀ„"ÐÍB…^k‹·¨ÑC)i¨ê—pU+1Xc{d`ïÖì²ARÂIÛO¿5@Dû­y]YSÖ\îײ! û$ø3–‰‘pž~Á¦˜€PzœÐVt6%ž^bru€|†G‚=¬#U­Àïà~Ô[.qÞ*ÐBžÁW]¬ÊGæR¡ãå÷ÉÂü.'#n˜*<ëÚI3p°;³þ*E,"4¾‚ÂÞ‰&þé4å5¡ÅMú?ż0˜WËä•m±Õ¨î†ÖÒÉA„¢ë&ê Ðñhb·1œ mˆ„~WèìeÃÁJlkg Sz°ÐrÙVJme­uJ!®twÕ+t:I±$bN‰*E3ö ½¡ü›dI‘æ³_^›à#¸Š;h£tc oMž¥N€W é£Zœ¶ÂÞNbš‹M ÅÓNôF ÓžXBaC|˛̭œÀݰ‹¬7sÙd?q÷ZíhÒ;Ù~¼M)!¦ŠPßQÉêôCßœ ¡¥¥7gd|gøý´þi“‹Q$Ñ•Gúê“+¯t”Å'ñÓ££¤1Ö0rU'NÄ·yP$™N*¸óï+îü Ü""¸]V!EÀ¤)áZa¨0Tå(>¼\tÆæ©zšÔì„û͎䨑û³bÁ¯Ý}[™R«)±ÒaG¬2=æ:¨£|““-žÇÖ»}Žåæ8ª’ÁÝgçFð=ZŒGf9&Ì9CédÉ‚쨃0ŠÆÞ ãmcfw^AíˆYÿ ú„i‚°q‡B’×—âäŠ(³í‚§fï²á{s1‚¥}ªÿIÂ^X¤À19c²T([„ †‰°(¡Š±q#]Dª ð³Þ¥¶ZÄ–“ äy½àœz6龯Ìò3Æ@EcûÓëÚeïã<87¡Sи%‘ƒz”õ,p ©nŽ´çP¥â+FJœ‰„Ðø· èdò“¢ 0jc–ùIÚf–rŸTVQvÂÜÅ‹gâý=ÛÈ»4gã/ÑpFèùÓèx¯=Äãº{¤19²hÖñá™ÃË@ê<–VA¹ e†1-Ô_%£m,¼˜UùÕ˜×9*ªÜîâ|;*§²EgwQr&=-Ìvá«V~ÂTïb‘^¤• ‹J IPëg"ˆäÄF ;ExGœö³«\šäB è·Y^ºu#q ¯ê (C£­¤¿Ñ½:çí¶!G¤gHÞæ²â–µ|åIEü7Å:!ßšsS´FDp!ñ$þ„»ûÊRø°Û›m2hÁþÔP!F{;Þ~ÈZ™Uy^ñ0SåÌð›<ÑVã{ÝÊQ2SˆBFC>†"³†üû— ˜Ó\úÚ­Ö÷*U9þÞ4WÙ+ß²l´*pï«KÜÇû»(ó,0˜õA¶ñ[*È!~*G^¦ïÁ‘Ά÷÷»+ÄÐìFÀV§.”T´uDq÷¶!Û—- k\Ãdvb’›n¬Aˆ,ç`BÌ(`åhQk°¿Ë`¦  ‘ƒ?TRù‡Hæ¤w¢)KëM‚9u%=3‹fŒChHò”á>òíɪ1ÄJ4ôQºk^¶£öxƒ-V¦#ƒ˜°MÈêíÞ6éïba8-rHdýAVȹ…k‹€2Åö‚áxœê‘ˆ)®Ã‹R¥‚dR±5¶·5 aÐ’“&UÀ|@¿°:þAYF8 ŠÞ³RÐå4ŒQa1Mí§L˯Á0CÎ5`a!õÝ~/OÝÅÊÇO>u‡ÃÒ™wZD+w P_¶±þ¿rúå ߤ\¼åøi¸¢<ƒ™€ ¬ð&õƒÀÓý+$&šmVU@M¿Ò¦ßZh¡–Û…€`<ŹfêlŽbäC*ï­L ¥§ î@ªwëÿÌ.ì$ù-¼’p? Ò]} žïçÒ–<’¦¦#cÝŽ|X;8¤£PÜ,Òˆ’Ô‰Dzƒï ö5"l„ž!2Gm5h Ì Bz›Ø—Ò,5ãKv¾1ps§bé}ËlœòEnÔ•åuž(¯ôÐåBhóN$Lš½¿I‡ÐlK£ú×üsyõB^‡7vqÞÝ{Í;DÑ­m=L3s"¿‘ÕØå(Å$€¤JF$먭þȼc”-1N¼y°KSqœ„«òÄ´* I\éÇ¥RÅyx{+D/Š;3+—šåÙõÂ@\k&ÞLÒ2JÉ^ ¦©UÏr³2Q•z|ÜÑQ¾¥ö1VMI.S–ùôó–ϼ§øJML´3u¬q€iáeœ5÷ñqY*b$'ú_gª¢ÙO5û\Ÿûøæe­­õc8—ÃÓ¹f¹TQ0•~¤D ÷Tà7ïÈШôs»ƒBá l÷8Íýi7J;Õrù;¸½÷z"¦JÄú‚ °2oÖt±«w&„±ÎÍägá}ˆ8qv¶j†¤,&èb¢˜kcBö%¯œ•Î ¹Ã«kó×gf$IÔ‚f€ÝVåKƒ—Ñ-Ÿ`ýrfíä Œk ùeëº;ÄÇV‰J¨“ž†¨^Æ£CÏa·^tùK£C÷ [ñsE­BÖV;F…‹ÐŸ‹ê',•Ê,Mo:hǼë%µ oì-éò.‹TñmãN•gÙ‘&†[u•«[MÏKmÔ´‹¸O¬6ÌPÛÊ=?À€µ *´G¶/â¶Ðž€Žùƒ¥½°û³=pÙ±6ª‰zG‹$àØKmY]'«bégü"]V9XjB$ª-Î˧»·ä§±'9h†½‚c"•_tLiBHy©R>_Ç×®‹ó²ü²z¦#œ„4u@ÈèT>ÏÚ”¶u)uYñø/DŠßTÍ#Ië™ä‚(‰Pr¾+ƒ"Ž-ÁúHº…︢nõFÝ,1YJ‘8+°'»â*5„ê£/‚aÏq&ϯÌý ¼LÎRïÐõ¨1–|RáŽJO's 5-Í߸=¶"§þ ïð“Ró[NµšØ0â2kë’5ÁçÙñîhhý±vн²Ë›’†Øù'Ègëæ¯¨q%gó:§œ3oH Sç4¯¡o˜]†LòÎ/ÐÍ’o´¬•þ–‡ÍØ=HñžzÑ›É(__3¬ÏìI葘ï·Å‚ ôA ÿ4&5s²»QeîZúüW’už ›Fâ"•ûæï(åÚ’ôÛR„·û´GýaúV‹£Abº ÍlÈ·f¯î’ÈêÞi¡ÜµˆjŒNM)¢ú™ðø"l³ÓD¢w}5ß-Ô¶=,áÝ/ÄМùÒëžøâq‰0ì¨þLŸÁéJ˜7'~²Bh¾Èˆä kJ<#ˇÚ/§ì~ôX›bÎMcdÀržS*ç[JÌÅTßr­’ž#[óGŒ› ’ Ý8 ùä{+Ĺo+¸g¹<2*·TŒîÛ;ª¯‡"ܦ‰er4‹È"¦g@¶¶‡wRœÊ’Ò ÑI 4ŸjÑ‚+…úÏöý{ñ„mØ\ä#mô0•8¤R¾?øY‰tÑendstream endobj 69 0 obj 5771 endobj 73 0 obj <> stream xœÕÙr\Åõ]á#ô@Ê3)Ïõí½Û©")I!X©‚TÐfÉekÁ’çësN¯§—;É@\ŒF}»OwŸ}»ú~žØþŒÿâÏ㋽'_™ý³›½yÿøÿlïû=æ'ìÇÇû8€IŒÃÈäfÇö^ì…Õlßð}må.ö¾YéµúçÁ_`¶`t6|rœÀ¤?®7b2Æ9¶útÍ&ç¬t«Ö|õåzÃ&)•᫃2çã0*¤]}£À®øZ­&çÌNœSˆ0ež¬ãNJºò£µ›#PË™\ýYøO¬¾€?AÀfâàOke´‰sœŒ®|¶Þ(Ê £þŠ8çZ¯žÀÙâJ€'˜£{öð ³tBði÷™œ„Ôѹ‰øÜ. s. •¯ù49KÀŒ˜fÆ8âi?Íû¬­˜|uŠ5œôf=Opçôê+É¥Z½Ì‹/×{r ÎÇòI;2ñ¼<>…ÇFLB­>Ã+èYÌ&šG~¦pN®Þ y”ÜšÕ!L`ÆÎéè;ü΄”2ܼæ;<ôÙÞÁï¾I(d³À“ ¥Sx)œ0ÑÀO4ÐJ%;˜JDèYÓ @ÉÙÄg·z ·r ¸TürTö„Óm„Ì®ó¯Òq¼‹”óÄâà*e4OÇÅÝ®`þÛ)lã”\à=ä$5ĤâÚߎKÀ”:8¦%ò£tÑc„©4ÀÀJÂÍÓ …¡7"GÊÎ(8<¼,L|Î8³€Ë2;ÝI8Š#²r¹¼ Ž­‘9@¨,é•rçC(Ÿ«ÙEœÌ,bL#‰ËÓë"áñœ†Ryµ“htŒ¸Ó°\§%xò¸„k›—(ˆ’ \Âd8Ùô¼@À9·8ÇL³sñþ¸a9-Þ~“®¿a~Î<`¡EÞüØß—¦ÌT|[Ñ%M<ÍOP#°«‹ dàáàš3<¸Ÿ(X=H 8€SªŸö'*Cˆ€ÈËÖHò`BvÀ­Tß^–<ÏædÄ??ëÁgK%Åëàô]tzLk£=)@íƒ Iœ©A?q)¨ë µbæÀÓx” Ù¤­l$¨tÔånáÎjþîÁgÜYZàã~œúÑi†›ÜÆß…?’ÿÆó@Œ `Cø@ ŽÛf^ Z4¿dÖßßgG’XíOOeðu|YoÒ ˜œyç‰Õ‹øñ,àöÂo`Á i N'ëN§ÁÇið:¾)ƒWypx×òøm¼]¸ë1Í“u Hºsâ×|‘¯‰Å™ ð/{Í! zÍÖ¨oƼ?–ñ¿ƒ»ö9§ÖÌà³ò`W™FýTTJ-ÓIå.Zåp´¨(ó2Xf~¸` úÞäÁÃÑà»2ø4þ0ZóS<ºè DCÐT³¡§§ËÛHχ(ﻵdö÷ã  ù)RÐÆ­7TŠ×EKO-8±^ÙÌÕ¡'qOãé⺨ŠPáhmÿâŸ~Çp,@E˜¢f 8£F;,Š· ñ!yð}ùêƒöpFP5YvÂë¾Þ¢ñBÊ`ðõ]íCïÂ]{þâ g&'QêÈÉ ŸøŠê, !EÀƒfª7$öÀdH{{$ÈàIY˜uëeˆ- n^’˜)N øÚ÷€;¯ÈÜ«B§atD°ÿ]»kh·oÌÖP£>~Ê^Çu‰†"Ž•´Môìs2þE‚;¢¹áh„vÉ>pí5¸CÌFÂË¡Ê× Õ$´‹û…ÈÎçÍ^ö\yç 7v¨¯Â º/¶ñ©âиRå†x˜‰b‘`­Ù>Ø0q EPtUïu¤É€Ó`“4ååh,ó1}åG ä3~uV¥M£V³9„H»èF"þX4Íyñi¨Œ¤à™ Ä\sÚY‰ÂàD N fÐh"¢Œ.º¬>)°+Ù8‹r÷ Š¥(ì8V@n˜Øb‡ˆ™»LÌÔ)ÙŠ=ºm%*õ=ûô„¿è9D y®¥Ïâ•“ÿ\LŽ>\ô‹œ¾+œ’OlV£˜øµ3Š!ñÆ•õœQç½ÛA*}Í$"Œ„ÞK¨³ë¼pï:ŒÊò¤Õ‚HÔ÷¬lÚ´F0°x•ÒMúœƒØˆ½Oá<ùwFÌu-t9Á¾ó1¢­Ð` M4ÿó¤säj¼·²˜$[*@#Þ˜„ns×–[¼§§iPTG©©šZ¹¼!ñΜàcG8+²ÅRêÈ“¨¬º¿|mÖÇæY·•¦¯|à—7¶¯oÔÖ9?ЧúäЃŽüÑÇGdÞ«ˆÛ­ÂûÃM”¼§€D v¿œ&j¸N*vUþÿ”säÅæ  ·ð$$6ÁçKü|……èã”(4ãÐv”àWކá"š\`(ô$®j޸˵}O֯º®…‰¨Y6e(,c œ‹å?R•aë¾€ÄÔrÕ¡^=[¸¾ÌNuy¡)ƒ&Nn(B)–0øYY3Õgí*FÇR_{Z*bÅoW£Ý ôËq¾Y¿yƒ…LÄè ã7ÁRvI‰qv óM bó¿Âí–£ ­Cˆ? E®?¤ü3š&«¬ ÌýÀÛ·&bAçž­Œ¡'‘áÛM9}Üöóä. _ (áe9ú™ÕM8)OI?ÊËs£ 2´Áb¥‘9ŽRëµÚ\ìW¹•«À¤.H FëVpJP|w¡+í°±˜BnjcGåI×Ï"ÕB¡¿ˆ@ÉÌŒŠÈmÎ%ö´ü°Vr‚ç¶}§j9*Ò1x4´”O,€7¥wi=åªTÉR¸ângŸ¥§‡_íZEâs_ç'/êä–Vš;Œí*²®jªÁk5¤”šZ…I^ðe,ác¢œõìŽWUIšîŒiRQ¯|%ÕŠRHW´`Xh_æÃ¶M“äoаLOηdN.™æî]SŒrc6 ˆ¢PŽÊ†‹µÍüÂNÂníMó`7®kZµÉF+ùç‚ÔÝ/îx½$hN~JÊÞ¬>Zû¬𑨑Rå0= ùGh3 î~–NòŠè?\5¨ŽVêO/§Bµð½½@…,Ÿbó=ÅÑ›r ežP”äEXš,Ö±S`X5(Õ?!©î¯ÙºÈK”)a«â²pÿÎC¬¾+®àbÙÌ·6e§Å4ªÆ@Ø6ÆFù‹„«…êj¬Qzü,5ŽŠ•©é+’¼cŠQzÞ÷-óW“ÓÞ–ÃZ¡Vï¦0îûÛËPA­Ýîh mu w>rTò›žÊódcLumÑ¿â¼ðJr_wó}}\´ç»U‡ð&‹ƒ”Û_àŒÉÜ ð<ÌX¸b]=µzEvÇ6)`xêŸÃ2rÕµLU¦oº²ŽF¢— ñÒ» ½9½×Ù»oq×,R¶ö#ZªØG©‘ÃÓ¸bƒ÷–*ÏM”3s_1þ@Àli‡ô>¡0©ÓŠX%R*5MÖfo¹Ê7Ög¶Ì¨ÏäÀ3«‹mY/õÖÌÂk°‡…?!D~Ÿð+d*£n[õ÷’á ›xf´íó<7rP«·ØƒDÎ$Üé_gÇ–y.\êuI¥¾Q5;_}øšÀî%»¤àã Õ ¬Úò~À,|©ŸH"¹IíU^Mx»d[ €(Žs íàÍ-¹8}ŒÕ½¥+¦ô+^ÑЃ¶1’~ÿ´5Øxƒ:.N”|ßÖþ†‚\³»>2þÀ„è\VkïdW«KÿÞ|ÅA[cØ‹|ù ÿ^_»F-4”¢ZÞ¥2þí»ÖaM e"'F·–ቷãQ£i㓽ŠˆÛ…÷¨”„?£À<ª%ç ±ˆ¹Ú%±IX$Ö$ð›æf5(dgáÈíe¢íJv# 3ð%›¦éaCY¢/Þ|°÷7ø÷n~ÿØendstream endobj 74 0 obj 4179 endobj 78 0 obj <> stream xœÍ[Ys·~gô#ø’ònJ;Ü€ßl'’•Ø‘c3Ƀr­–⋇xXV~}ºqucCŠ’ª’r™ÚÅÙhôñu7öÍþ8ˆýÿËÿîÎöž|ïö¯÷ÆýgðÿñÞ›=ìçvgû_À % ecûG{i¶Øwrßz=¹p¶÷ãJ®ÍjXËÁ9§V*~Ù89úÕ7ë\=_oÄà}fõ×µ\ýe½Qƒ”ÒÚÜÄèbÏ3è‘vN¯¾Ã­“«ï×JBذzA3Ÿ­Õà„Wº7#®n¼[}‹| =Ö*£V?Àpm­ÄêŸk ô_hñ^­p5çB«¯qc?Œ£X=Å…³n>ÔK¡qQ„i8 @”ýëàÏÀ8à cœ¶r°ÀºƒC`—[›4F{>f“mÔç !=…eWGøçÿ\០`ôCjõ¿¿Æ?qàK$Î V×øuÀ?‡uÈkœ†Q˜Õ®.{šWäóNë~Cí€É¶ôÞÆîÔûio‡Ojã·4ò°£‘RÚâõ_ׯj<ªŽ]m$’ŽÊy4ÛýÍ9+Èmé@‚«ßìüáÇÊM#ǸÀe=òu¼ÊÝÄÉwøç1üÁ•q¹º¦Ïÿ®‰ú¨ÿ²6^fŽºÒHv¡¿Ý}¡—½5?¯Ÿv½9ÔxÕ[·õÓ9ukN¨ññ/NI1¨ª•G=ÎÝ4Â@ýh)œnˆècÞI+Ûldð`/ö7B ÆŽ2m÷¤Þ`¼ß-g‚B–f¹ˆ_ÍãtH&ꦎ¹nå"®åêŸ!ÏË„õ,ÓFB'*ÆFšÁ'ÚЈ¾.öümœÛª£¬9E99'#xÿl&l £0(ãá –5žÐèm ëxp!N>Ç)nжì嬌gH¹µÞÙ¸¬vqY6èZ~)• MsÚØ)䑆}¥Òe-guä™–ƒqŠd$–½\¢â–zhø%56ýé``P*ÿN'Œl ¬½Œ¡Çiÿ¼'îwjðæ^r{ïn{@;X-˜_Šbw¼áGÓƒR:$ޝ›¦mº*$Ò‚ƒeœÞ®®åL´˜Fâ]¡¥ÃuÁwçÓ£W¿[°š±¡RŽš­ 4ç3X9†ÌWœB“‘ž“5Xxƒä¤Sšf,noÁ? ›ÔAk¯d9ƒ´ž‹žÕ6q'ê­ Y7²P;W®ÀAW X:‡r~¨™\f<ÃPLçhz˜$u+›0¶ç›³£%1ÜδԆi¯Èä¬Î"1Âù‡$Kr ÷ÿŸ:‡fO5ÐjBð…ÏêÈmAYiøm…÷~%Læ&;É=N××™ƒäÓN°‚[°ÆHœw ãô°/¢·µñ¸¤„ÁçݶüiÕ#ïœÎômíÿ²ŸfÑÀMºîõïzä3ì~HZ7˜ ŠÔ`ZZÓ`eç·õÆ&1TüÊv;&fw#‰CZóªwš-—©y(ÑßéiíNýµñ qz×òºGÈu&–Û›ÔˆRYþ«Úø”F>¯ÔøCÓ_>¾hcžzAÒ¥»¡èw²•ɪvHÅôqqö5©oœ^#èYÚ© SГ÷¾I2W™k`´~éMWßRãŸÎDŠŸ#´âRt«+ïè /CùæØ!:)“6Á4zWÕ.ØwÝœ :åŒSùø‘¥Û‰Z>ì 99q¿²–0s×ML]ö$`×Spº¦×½= [`Ï[~íóÕY&â–¯Y8Ô’]#jcŠwûïfU3!öXÁͺiNº¼C™„¨ áÄ0¿mEç¤\yÍŽj>È"ÍåâEmüŒ³ ^Œn‰Ý¿õ,ã«æ„wYƒÃŽæÎ“\­¯M&ë!6ýœ‹Ù3$æâô®+ì:[@²àg7Pñl ²tdMŽÈ¾œutìÀ6Þ}2ãQÕÏŠM¨r®ª~‚°SÏU#sˆsµÀ¢;)í Y%03×Ï®U?kå-± ‹uhäYoͤÞï6Š1Ûöô²ˆm¾Òt£sõìA¤¢ U]‹xµÀÒ¹™lŽÇìmÁŸÓã—ƒ!'>¥˜%ˆ—äì֫§´ÈÏU†)³÷Œ~yïèBÖÏÜÙeØ$6tm±ÉR£Wó[˨ƒX~D,¿9}¼y.ŠÙM·¿¿h]y»"}k¬EñqÖw{Ÿ‹;oHaú3K +k±lGéó\+ã,M cŒ6«G”ì`!~“%Ü(a±Òë?#¿K*Ž¡¼/+Á2ˆ%üoãúHPh1tów§…1?läù‰]“UD×V3r,a–ØÕ o³´œ”ù!æ)?£Ê~,¹ó*tÏÆý‚hç#BN‰ó0É2…½”"w†¹ÄÅ0 ÛÔ+.)‘Ƴo5¯w¼P%–^ÆìZ“Þø=\÷ˆYG‘üé¶x樱k]V3ýó1×0îŒÎœ·UuL4IpÍÚÊH’s‰Îd£³›N5: ’=€¬ÁTV èh]5> ƒU´¥?jÒR¤~H¿ýH¿C*dz+0J`žeÄRV¨øHQ"-Ú–~%c˜¯á|@¦ƒu£C)S²àPàu!`Ôh%fÒ„‰¡£óƒƒý£_òÂ(|^0ÎHáu²ÞZ­RÌ B˼€£ÖÙ³,j,¡Wz¼à´o‹EÙ«ùûÄ8ŠŸÄêÄ´‹ÇdmPQ˜zõ* u…]%¤Í¿Ö¤u¸BÉþëÆæeûVrãÉôàý۵ħ$Y{'yÍœ¿? ‰ü±«ÅZÎ~øÛ¥@×{üÙµ—“£”„¬.fßèôˆ†±‰ÌÚ¯Ì(uê,%áoÑÍ‹¦"¨â%b]*5­–¼5¢[u{I¶Š1ØÁœ°lx]¶”_M(þ—`²Ötˆ²D[ÏCw¼a&³nQ?V#›+‘Á-ú¥Š" ŸÂ”ÖI7Fz‘¹€¢gŠHšP¯ÿQÏ;¦ÐeÝH_‹ Ð/"t¸O¿¥·±Š@”L|fSm¶þ;X;<:ð%ë6¿åµÁŸ}Š| B.ƒ†eÅ¢n&æ7uå\Cdp ½¢¾5³ºF=Í6AÂD¨¨ÓS†!€:_p+¤b'úøÄ¦=(CADpß+ÒuÔŒ);â ¤Š[â†]¨ÈåÇ‘êS+mævT¤Ä¹¶2ÎA8ËjâMk‘Ë7It^í-9‡zE³›ÌŠ“-9V͉æµr8Æç8&¢¯Ñaî/«¯ªšÕŸ•E'ZÂñ_ªO?ä±Å1#“A†PyqógÙRçJí£¦#w½@ß vÜ(äÔ)©DòTž•Êñ ŒŠ¼ï…J‹åÙ1‘Se}"§åªlãºvM"¾¤•Øóœ“Öǰ'Aì¡örík½ v°¥Ã{“&tŠäÙÿøye¼„¢ ¨®Ý¼ÐhFôkÆò½.µoùRYÜ(­á/YºÏ·$È*²qþÖÇD§ ßáÕœ÷¼_™Iã£$ÁA jR¾câ…uR¼ÉS”¥ u\Y…jŒ Y³ÚÀž .Š1„ñ<ˆÐO«JÒ¢k2aêšçá倯sä(‡š„x(F$_Ó´ñš˜6 lÚRçóaè÷zêM& eÉDsüÀå˜Fô×f°² Ñ$'Ëé¸ö5V’”û`\O ók-dl둘‰1ĺœŽ?cïJdÀ§h6ÇÖžÐùnA¤¶3~:¾^7¶ ;™¡ÂØÈN–rÇŒ}ÇѰ EòÐ0˜cLrÐõ ³µrU$"MË@S+Ñ=¯‡ùÃrú+üùxOÃÄ7´è_Òà¤I¨ÄµfŸ78&úÒÍÍ1uYÊⵚÅÆ¯WÿQi Ò F#ÓÕŸ¸€§Ÿ t±s*a2˜7A`åø­/¹œI{óòϹ"ï&ˆ9‡E€®T’£Ùs¶6ä™<ˆ›d cêS/*¦‘« Š‘âsó`Å(N½‡;ï ¥³dÙº·]‰e(Ž6Nç¬äÏë(}:sY~/¿ ÓQNºqÕ+é‚Qó,$È‹)ÓË+ß÷^“Š%‰-dçIˆÐXg!RÞp‘}!Ê:5 1 oòvüéÏE#¦g/eº ª/BëE–rÇXbž!3=®§Ô×Ì&ÝñÚu’,k°K‰;¶iËOÍÌN (…œØQcern‡Üæ$·ÃX;M²Å—ôYØ‹ÞOòúNk|Ç3lõ©k£` 8Ùƒo Û–`ϱPÕ˜Fuði¤²]Œ°›…™kŒè„yŒꪲÝËíÍTœoÅR*Š zû T§ÎGSŠÏoGSbŽL\ ©s¦•Ù˜uÐ<ÉÄX”L³°M £u?v^L¡4óÔðcZw)•J3½§Ø|¬úÖ‰­c·RlVv+Ÿòq)_¤LW÷w[½Z&-›Óň8²P´áKÊJƒ®ZÂb/-×ù%ÉE @XÝ­ÁÅ;<âñqÑ„™ÁIõ' ø­$Õâ©{ß(!÷3’Å“œa!ž:·qÓÒSfVž¤*¸¿WyÒTyŠ?T>H$ú­q&×u"ÀÅR›åªD/6”š6Ò*)åB“0ñÉOéOÚôôü Âÿq™ LYUF#ªQ~ gvyþnÝ ¤_µé7›Bx™~â#1´êÁÇNÝ(yAÛàÍÆ/„˜|]A„e+–iòáUc¢GüàªOúU’Õ€»Tò~ÃbýÛŽÚ'%Ârå/ldçcj¨,Œ7kÚß}kÃy¨²w¨N™½¸7Ñ7TÉ)ƒD{—eÞcúÓIøÄƒ7e}4QÝÔ4 ²‹.rJD#§½‘YïóÖFAØ hŠí,í0‡=Ö_¢X·$Ãw¿÷èþðŒ&1üËFòWüé`ïoðß"b“Vendstream endobj 79 0 obj 4071 endobj 83 0 obj <> stream xœµZYs·~gùGðM3.íhp©ÊƒäHŠ\*'‘˜ÊƒªpyG$Wæ!1úõéÆÙ˜ÁpIm•É%Ðh4úüØßwÇíŽø/þ>¸ØyñÁìž\oáÿ“ßw˜'Ø¿.v_íã02¸Ñ±Ý½ã°ší¾«­`rïbç×Îöêß{?µ`”š >8 öè§~%cœcÝ_{68g¥ë^ö¼û{¿bƒ”Êðn¯Ð¼£BÚîŒ `Ûñ^uŒsfÎ)G 븓’®|Ù»12µœÉîNYøOt¿ÀÎo‘±80xÓ#+£M¤qB0ºòc¿RÀ”F þ†œs­» [¹~‚9ºçœŸa–~AŸµöWQ¡+P†aν² mÜÀG›41šQwG½„=˜±Ý>ö+ÉÅ …ín@:k5gÝiC:Ô+9òAÙ÷+îGM·•ç=Çc‰òaÓ—¯á8lÝYš¸ ü4ì~ösNtÿIÓA-Z©tj×j‘ ¶&¹šñ F°Óe£ Qk£e<&2JÇ»gxéUrЃ‘¥«Ó¢F>—?ƒFŒnœ‚»¤=:¯<l`ðf«»uáFäȾǸÆÁ!¹×ã02)º/½ð„¬}œ/=z„û80| ©o°‰DF6X·â#±¹‚œßC›31(­ºkÔ·Ò i”€kÛÝ–U~»‘ÂÛÄZÀ^8àªD%|H¸%?ø¡ìÜÏ©dr H­Œæq5µJªZùã`”³AwÅ¥ï‚ö9c&9Ÿ1d>n¯TJ •¤²ÓeÓï†H‚B0(b»{ïwö~ü5U{)¡Ø3Õý«wžŽ'çÐcbo%L:Òø:¶^ùD6œš5šúÞyɪ+Á0 ×ÄÝ7QÄ[Q³¸+06´¬lŠ(MçŽZH=Hˆ ÈXꀭÒB‹WYVgŸº]Œ ©„ýá=€eÛ™cZýÑOÂ"¨mu¨´Jô’¾ µ l¯mŠYTGk‡ƒ¸LÑ ÙOsC¢&W’ÌbF6”ÿ\Æ’Ç(E©IfÁ²VX—º¤Q¾µ"…®‚ã!Eíámè…ÆZ‚ }꣨ãU¾î“¾²•Ú„¹;Â<ì§á×ëPx÷Q¥ÐE!÷(~!‹ß*€p6½d?T uU” •œ© ËA«ìÄÄs›¹c ʶ¦{OQÚ™ÈèK‘SÄ­›¡>‡q÷'a=¯êÞxqÀ;R&£Ž1Ë –+ì2–‚h¢hÍÛTˆ§‰ ˜WIÕ.’ÁÐq"”£ ¸¿E<¤¸®ƒ!eäIãBf.Âi ÛŽPrµ†][ •;™¤ëàQ´¤’ZKOåRg=ÏwgßMèYj L…¢HôËG–_,»2$%¥ÐO‚aŽˆ/…Õ¨¶f‹*ôÄt(8*À™‚^ZÂGØ~ 61t…¶>ø*bœTXX·TÂÄlGa+L$$²ök¢¬Ål” Õc Ú€¬·§Ž(ýbM´£7u-p„÷c»M,³MÇâ*¦SªA8ã1ÎCa36I3!~ 3Ó%¤ ÆÙGrñµ4UUQ¿ØC’bu•ž WÃô´» ¶ç¯±í ŠÑñcA´„ïh ÷磣¥§¶À¢“O|¬d“B=Gã‘…Ë "TYí ”ñi¤‰&¸•ÔC¬Ë§1_e×là‡ªI`Lr,)ëAFñNZŽZ·,í¬”U[õž»áí®q‚rаe÷ÐÊß|L`Èí4%UñrÙèz ]‡ßSÈa¿8)+Ip=GáF”“;Õosí^w¸ Ý«K°ÔK±­ÉãÕ®Á»ØÃ‚!Êm[£Ü»{ZT?<Ë"N¯x¼îrÃ3»¹ÁÞûga¼»¶]‹X‰†e‰|ñz É} e’æ … pxK”y±µ¾÷ª.{ík¨<ú-VŽÅžCP‰Iô4÷ƒ°‡×Ô´4Ò`ºDß ÏbɃjca]Šš¥Žã»bÉo IcS:ÞIî¯èïwD¦W}º--^ó  7ëéÓv°ž«4`ûâƒÝ…*u‚‡çˆ`…•µ# Æà°b4rÄ`Ð52îªÁo30|œÁ®u4.Ô Éb-ÀJ@MýèQ´óÍŠïp¥‡M¬³~ª}’ 2)°¤”7Š-&*§£›Üߢ÷–Ö­„ ^H5Åî}ý¨#Iýè爔¨ ø¥mæ‹ÒV¥–céÉrñæeõIÙWŒÆ0aá> r>…ÍÔgøã&S屋¼yù Ot™@пéðÐ/á68J|Â7q <$Þ­~wÄ¿‚ÀÔ;ü:õþ ÌÆÑ’Ã%ÑðíŒF_•A„PåáÙž¿ÊƒûÕ"±ï ÀäùM™¿¤G˜oÖ¢<ËŸ.Ë4~íÂYö‡ç#@²D¶*d‰ò8AØ4O~R++UFâ£HßIXù¤&²) ›h­«â(×™p¿v”[üÓÏ>Ç·™ëYKOÏóຠžS5ÇOeúS¼.ƒ…û·Æ©qŸ4¸nXá¦÷‡ ïö3ÃÝ>h #1æ>%ô¨h¤§½nö2ó)æºk ~ ëò /”¿õÔ²¹Òèû8“že£ý7}"Ô%…x“~®IŽ‹D[4X„8o+¦¡„óÖàEkc2éuË hü' /„2)1€(óc3£ç-Kµkë¡É0Åø;½W•HáµØ2Ò% 0=Xð¼6õ%MótâÇ"š%¢¥ÁèNG³;WU„¸øAÞã|’!JÅ(n‘ Îæ?ÝͪÍú3þ@+Ô•ªªû¤Rý2S\ª:^Çño.ƒÍŽJn^.ZÇ­9§gF•䬆Ð44%‘˜$•éªÄŸ›J>̃jŠªƒxŒ«¥?Ã/“.ñ먕¨Ÿ¢®÷E¬×™z(ƒoòà»2Xø~ÌŸžUþ²jW=bð·Yè›bÆý˜B“­K=ËŽEÒa¨Ûïg’ä,vÚ¯lŸ`É?[‰°ªœÁ‹ŒwÏìá‰ò"®[npUàUíZÑ‹nóàuµ<)£¹è;]o.Èé|OëÐÜi´¶7~Äû¾E'ÇTgÞ-4m¼|,/:šø^LܼJj!³‘A?Ƀ¥<úZ1?aÉó–Žo¨ºæ(©i—ºvlGÞ©žlCÞÍtv™~-ƒGìNÄ&Èy{Цœ·=;õ“ø:ͤ8è§\ ¼=¾ÕYŠÅÒy½/y‹d U€e˜xˆ·"½uâ6æ¼hQnÅÕˆ@3µrá59I‚*ßîߦàÔ›–7E=Ò—gn|6×%Qz±SeáÔW}Î4¹ûÍ`²äþfâ$º!]Ú\É¥e¹­â;E½ù.ↇEÊ£º¿´ýv›ùß•œÓy²( Íʨ.W%ß®ûif6|ù!è&e5é—‰ç©{rDÒÅ'Ú‰‹U)_Øù €Y}ªr_åø.Þ2ÄD‚Ùc]G}ÕEØ›“ê./,`ê®.2Ëòeò£š<¤!¿‡µ°^ôû?†Ÿ°ãmv¯÷vþÿþ.ï$Kendstream endobj 84 0 obj 3313 endobj 88 0 obj <> stream xœÅ[ÛvÅ}W~Bož!ÖdúÞµx0¾p °Ž€,ȃ‘d[D–„%ü|ªªoÕ3}dÉ$+x!{úR]½k×®>G¿îΓØñOúûðõÎ_ž¹Ý——;óî§ðÿË_wuØM¾Þýd”€–)ÌAìn^ìÄÑb×É]ëõ$äîæõ΃Í0rrΩÁÒ?öœ“œýðå¸'‡Ç㞘´ÖvøtT“^ÙáÁ(ñ¥RrØ÷ ¾fØ@Ëä¼z8€O°»sÖ¥'kÌ?6_€]°4³K[9Y°lsÖ„1õÑž÷ÙÓÒOÒïî©,!v>†õ†·øã à?§yb8ÃáñÇTº¼Á×mg|‹kî)=)œ{OºI”E‚¬SÂð{™â$ϧ€ÉŒSð6.ó*­@!!kÍÄ'eÆãd²^yš¢L.a“?/Gµ±î&2s€g7ü³7ü]iü½6žóá¹ñ¨4^æ'tQñP“±³Œ:DÓÑ´á4ý0à/ÜÄ‹âø‹ì–8ëEÙ÷OC9’³Æ³Ã}nC6ì¤4¾æ“å×§½m׉~îMtU/ØÁà1á_±í~íxVŸSG§ëxR;^²Ñ¹#\:¾àÇÌ™—½=ÌežÚ&z;–]qØäÏF<[ À3%šñQ+å)¯PæÇ«Úõºte»øi,Ï1├¼ßp'kX°¸©£þ+…QŒ ÑÄßšq²ë^,]ÖXªPSŒðl™-¯šá0¨é:v_¶ˆ8‘Ë >Í*dpës´b¦íœö ¨Ë3–xÓCbX1’Fr~ݬ”Ïûp…‚eDÈ[gh×Ag 8h5ÙÅ_¨pLt¼~)´.Z–8+Gû¶êe¥I#§3 ‹¯é¬,ˆ[&‚ë-îÛeå¬hY­ò>ŸJ|“ç˼«Sžd¢ê´hßšÙþ\áìq êÆK´Õ€ÉÞPeàÚc·ø¿Ë­7ùÍÌžú\5Gª·ošóIyÿy}¿)ûM\¬°—…Vé³üe±ý<§B–$ ðp‚âõ/w6ýÓëEñÙ[¾lbÆf8Ž9+P=ÍO5Ÿ²“¼*hþ¸´Ußn¼â?|ÄCeMDo·ðnzÂIó{‰ÙDï¡„;ºµü¨ÙýM ¡[ÈÆ×•0«lb|XW`Z¡B䢤]/œùq¿çÃeGL³ÍI®;žñÔÝÓY 4‰b½ïªwÞõ6[ïªt|ÎÚXÉ ^väÇMB‰ëCØãy9äó¶OfS£§Þç6WiÚµ`î¢ú´jø?.£5Ž{ûÀb aÕLu뀫ûw§€»W-{\(OßÔ×_sNÎ¥ñYo¢{õUAç€3¥m®g†õ ë{¥mÓ;ÈþF!î™=o{üqÞ ©ë^@&ÍY³ƒê뱃€{Q“„;Å[ÁYžÝ(òR [/ȺDþaAÒyN(·Ëü/ ~r*‹ Ù°P?j»¯bì¸Y-%õ÷VMÑŒš‚2Kõ³ÞÙÕSùùn!x·’»øµ&,ž­·„ öŽª'NäòhA°Î'–¦Ë‰2“¯ÿ&7ºVÅ{)¿+àD´•t-UNGÃ,EÑÉQNù³¦Q¡n‘a°ãü ! ñâLLvV€´c|o3 2p 9`±š„óèBy19í#½)-u€}ÈÉÀ“‰˜Š‚A^¹ônØ X´Y3>ÄM:/f 7Œ6í(/Í“”Rª acÊÂNèjÐk ˆìn=9_Ï`<0,î­tíwV//â£Éå¹õçúxš/OòÃ%:Çï4•¼©ßñ¨áIHIÿ=b¤³I^gM7—i:È:uÝ€ÆG›¢5¤Yã$W”Jg‹œå©§vømqâ¬rì5^ä 9éfßÌ1iNø4H²Yùª™uÀPI†–•Ø!‘¾‹ZÊI"“û;°”„x%ìª3†¨¹µŠ7Î… Н¬¥…_à?n$YŒ™èß[±˜!C:‘ F³Ñ³(Þƒíï×ÉjG<ôÎ0vPËù5„r G6LeáýjMiŒEnr_K¹éòœx>*Ò®>=üÇÊb‡8irkÕ¬ëY<aˆÊ¤…ü¨isÈd ÷"ÖÄ,®ºïWe«QìæxmâJ¡Ê3 â³Â ñ£€°‘ pá:<ò(PÑQw×yÌ)Ë G{ë:lgõÀñ"cEªI‘¨¤Äˆ÷ú´ÚÎZŒ9Oõˆfúè¬Â02,˜^¯û^‘ƒ&¬{|݃t‡ÃÂÉTfC>,­y€\´ëæ¸(›×ô¹ÍQí¶:4€­SÙ íÑJAâŽÁýÔÆJ˜k2Iu7¾Hîö–»=¡FÌ)8)I@YRe‡«K΋‰k±Ü ‰ x{³kði¦ÓlÆ„ ª«@Nt’éžÃ\)Ø“òÛ Ã% „z±QG·ëáä ØÇoµg‹ì&•Ñ>ºk^J±¶I±añøK‹ëp—ÚQ`“ƒÿ±æ‚Ì"…½‰K|%½‚Ÿ)bMDUš^Û9¯H<Ú¸‡ôíüf¤`rªOÖ=®bb„c SÎY[F«ˆZiâ¥9:¶f]ýx5k¦\ÑHfHt?yiö7Ähc°Up·³f—:Ëi»l0mÀA¥™À~œIX PÆJ ¼î¡;ó™5ýÐb+Z›lA+³"%޼C˜ËN>h¼M’˜ôLÜa“aKÐnÛ»íJ›’Ї.t!k–Ò9)á*Èc7Êm•CuyO ¡ßk$õL|UÃï|K–ŠÝÙÞa3¤sxÇsÒ-ðædWÞwã$ eFÇQü²=šx¸_ œ¼\asÎÄV¶tTxÔÄo,¹”M--ÏœLj‹VЧ}@\ õ^äF7ƒÔ'Ë” öv ? ÌF€÷P]’é¦ç)˜<^Ͳ(I’>“°°«³ß2Ã΢¤ Î,÷ ¾…0ì†*²Iz”Ö3h¤¸Á0Ÿ ˜ 4R—‹FIWjŒæbÂb~¼8±j¤Sѵ0ŧmnŠN\^é´NÆ`P•ÒJàc>Èßݡχ(ÙÅBÿt†s…hÿ;û0‘s,NË.èk>( cOp޾X÷ÀNê÷ž!ä`"2í¯í²t ’VÞÔ™?éûCÊjr +ts‹ðuì{Bì DßP aN$ÃøÊ8Ÿ‰Nföîc«#¢û&Œ¢ãhBØëP~vø®È­4܃*ŒÞ2Úæí*`›Ghy€ñf¸—ÑYõ>®h%ÙŒ€’’íï‡íLéùû·AÄVÜÔªú³2gòŠ´–©Bìi oÙê(Žÿ/œ¤Ïä.+Yî4þŒÅáÉt<Îd_?%îJÿ²œþFd ¥™lù\Ÿí {Gª¤Sв8&9 Ò⢢H³¶Ñ±ÆT=â=üÞ—±Ö Sƒܾ1¼;­ýZ°)ˆl¼FÐ»Ž J„-Fáļ±ša†ó¹ˆæuÜŒA·„ö{u^C¶Â³ 3N‹‘ÔØLç©Ò pv¹g^@Ãp‹'ö°ÎA[8¹Á‹Îñ:$@”ÜO›ÔÃ'cæÜƒˆ/í,̨iD´KxàW|c($`%Bœs#ÂEô®P¼¶ñ+LˆŸ/XÎ!lÅû ãrígZã€UüÌ!‡”Z1Ðö`"€¦`Z@öÁèCÔ9žƒí“@!8ß!Ì›-aÒøL˜v ”Ye—ŽèR:Žú2öD<ìª^¡<Ádê×-ß4}4z3R’‰ID&`ÂBþ3§uØÏÁ`}°nÖœ‡‡ŠWÐ:þLÃG0YüZðÓ¦hC5# Ÿà;À>CiMECe›^‹/ðÛž/ù •*¢±Õ_(Á³¿¬â¢ƒ„¯óoùäÞO ©Œœž7·j¢å·Šá]š:b¼2΃Q¥S-%ú¥Yfð¶ôª á˜éŠZ· A.†ÔßaÊùqëºEš\·t*óü>è-j¦&§~½ßj> Åj¾~ ‡Vš™ª«e-FÓrzd@c’m‘ q2á–I¶[çm‰æuFIyî5WüÖ¿ ôÌ º‹ºÏàÇßËh–F‘\cCY¡‡›Y©dG ˾fú–ß¿ð_}ëÊlUþU8¿ÌÔ…»5wƒ;1O£K¶è#6¬¹~ÉÃ>éÂDßö«%Èλ~B,5ÚfA”¼ œYÝE°[ ºh”õ #w•#ºÏ8Ç‹±‰0yg8»=}qåHRQ¨ü•ÇFÌŸôÑ‹nr0HüFÜ`7;ߟÿÚùendstream endobj 89 0 obj 3848 endobj 93 0 obj <> stream xœµ]Y“]·q~gô#¦òâ{]œ«ƒõy“Q²#+ 5Š•²R•ËyÈpÉ\$ê×»»±u8w†KìritÖF/_/€>[êlÁÿæ^>¿÷éÃõìúå½åì øßõ½Ÿï)jp–ÿqùüìÐHiøå—¨Î.þv/õVg«>óÁàãÅó{Ý©½Û-{÷?‚FñÚèCÔÐéâ þëþÜÖ5Fµûr¯1wŸíõî›ý¹:XëV½»hm>O¿váWÃî4Ìu€ßµ ­ùˆÐd9„¨£µ¼çgû¸äAƒVv÷Güà?f÷5Ìü¼4 ð`C­~Ím¢1Š÷üvî`P½*Þà?°ÖÚûݧ°¶¼ %gTäsŽã­*ðm¼DOyç™ ç@ŒUŘèŠù¼‘0­!¨¥N‡æÖïþm®WàevÙ[XcX*]bt|_bS1Ì—0k ›Ð>,P"ïǯyf]UÙÉþe¯Nìáx äó[ÖÅóó»+Ð8X^¬ ´ÖD¬WPâ!vv0ª8§ú+²@™ž}¿ÀïFÜýf4Fû@\ÊŒÍ^©évßIVfC~vË{÷šÆä»æã7<Ö‹=²Õîàªý7üŽd 0ºñå¸qûiF`…Øùhb³ã<r®ÌÁùE§±ØÉ–é•]azc1­Gf‰pz·àæøìØîà 4ñ‘¨é<´ˆµ—YûãpøÉv‡09Ô¤ Ôª±“ƃŒ p^0î=yÈÛÑ¢Ý6YÇ싲PËJ‡ò'lÜ ý1jY#+LCßñʘ cœ¡ïaYœVüÇ‹=¨e½8Cý˜–ú:±Ñ_Ca£´G·hba@Ÿ¯ŒãËr¢å<- ƒüâT8-ÍCœæbHÓåe:×計 ¸½°à§žÀq%²ÃçýGlÅšn-«…öÂMI>Ãy‚‡yúã-Õó` á™ÎÃí#ñ£æc½kâ2P.ïh“5CÄ©v_ÁŸü3qõTÖ 7F²$[ìX4Öb «àËÒs#H[X}¬Z ’Z«bˆ%:!œ†ÏÞ[ïêÄŒÊw2ÁÝ’F¦BU:’Â'kd€Ìƒ~·Oº/ ¥Ó?ÀöšÔÍÑxffóð\á,_íá8A->Ü·8ÈB†WL]s¿ZÄlç¸þ²ɰyi· *v¦[GÁÌ54tÑ Çº§†][£åò‰·¬>ÀÄ…¹F³Ì´ Öi§Ü]ª§ÿjŒ‰š:›½Ø_ŒÑØTo)%QP<Ž`RâiïÄAò]I펂Ýó…M×$: é¬ïpríxÙ2›Ý?lÎ€ÚÆzP¬8 Ê¯î]üþ¯¬AŽVèg€Û”Ž»†Õ@ó|†ôðnv»Üup«‰»§8›2ÆmjÆÖ°²›½A¤JäX­2«·»g4(ê°ñ/ï@û\µ.×4»ƒÑŸïݰÆ5·„c3*М¯ ™³Øï%4C=eÝ &Ãyxƒ'›öÆ ÀãÆë?¯@‡yÕlÓ@Vààã7x¬k0!ÿ† xVhzXÿ§6ÖsÜ .Û³Æ/ö@;çàX^!ßxàKÿ†N‡6Š¥#’è_R`º·¸8€,Kì{¼Ú#ìXÍ|/We²¨ÇƒIqü‚ŒI ¸íïï A,lÔ8¼&ew¯Û ÏpPpoýq½m1¬¸µ~‰$Xh…O _dq²Ž;rƒ†ò(5_™©ó›”e{E–0 4p5@¸V\r®S=Õ¯šÙ«„´’Ô:{<‘ô§C‹˜ö¡ù£¦†žÕËp¶ÊA÷Ç­e&â-œãuûr ÿú{ÔÆ—DÇEQ«6|û ·ÁV 5^¦…´¡8RžÞ/ü4=À÷'œÏ_4‚¿Lj¤È\…ª¶ÎÀ!àÒWô O³8Ø"ô©›øt"VEi .'¨î²pÆèÀ·„̇$<Êõוþ¶ÁƧ6Wš” › Û?ÇMûƒ_Ó¼ÝW&!là+ÜM C·)Ùa!®ÍŒ xÆT_°Ûr%ÒUá½´Œf<–;,-«MïߥÀãc(íM4jt ˆÝ$™lJ}æt0 /³¹×šáh–pÍk ¶µOž¼l¡Éϛ엀jé9A ØvÓJô sç :ùCXµg~ÄàŒSiVÿLãõÌÖ }@übÔ›âIìç‡j&¢Ù7˜ŸuÖ§(‰Wä˹×<ӹќKO¡›Z£øÀ“±Â´ã¢E9+ÁÁ)`´a#÷“gÅd®ÅW^ ¸Á5ŸL®Ù¸Pâ#Û×Å)îÕ,?B37愵¹e!K³µ áF Ê›dÑ"‹1pƒWiPôŽ·ÄÝ- ›Ì‚c·XºcoœJ‘:Ö¸K0(¶Å¦HÓeY{KÔæ$•1&D^à¡óÍíܘMb{¯²QħQÒqF¥(Zô¨úóoqÆ”ïy§uRÿ8DOdN-jB‰EtÜR ÂQ"bl¦žŒ.ïSÄG‰b³‚!ë—¹¡¯©“/ݹáŒ5Pä~š %­„A ëߤ¤ïÞœÆÂZK Äúû±Ö(lèÉiCéDÉPËJoáï­£Ö`¨» $ ¥ãùJ&ŠÌ‚’ ”Žal–¢îá’$ŸÅà˜Ù–Ž>jÄÂ,,î0Xûúì3*‚ý,ÈÙ… È‡Mƒ6]ƒ¿±µ…Öɇ©±12&„U`{A"©(,åÄ"ØÑ·U¼f0ÓæÝŽEw&gPVBU3['|JÝûAg"r6žì S½E ôkïrB”ðv j“• Â@’¿^ܧ®,ã£0hæ,öžm~ç0>e‘§D®âeênC¨º¢oñr2ÔL¢Ž)\¬Axyj d ù'o‚fË^Z`½öÊ}’ÛYD`æ ±ØÁ¡óUÒbÏSòŒõU YRBu9²@ˆ°Ê©t#2:âcg‰c³È" }¿×¬8±ý…ÁyýJ0ûŠ5^ìëxY¢ÕÿÓ¯*¿­žŠÏÓJËä>uh³Êƒ‘y' ƒ6Wûå >NN‡® xµµ\bNÿ^xsfUsÅMá¦ZBSÃKq®3€m2*_fY *½v^ÍÂc¿NË%—„g¥®x=QPÁ¤ « JT‘˜e¦‹{‚‚\”“ ‰ÖEVæÕ@…Ü@ ÚfŠ=‡Ê¬Ãp •¡ò†B$[™¦Ì­óÒ¹Áþd8Ëá¯Ö‘cÑ¥ùZÄÿh ø{ûŽØÄ'm>s¤oɶoÀ3:¥šëSlû.ÑX¤‡pd޹JN¼­9ÄG“¥N¥ò°?ÆP¢x^SÔ¸µæ}`œƒ:ÖAi½¸ƒVÞ™ê÷!| Ÿs ¦YÙ€m¹^5PÅ.×Ï%*IXóS“†ã6ÆNõÜq¬G>õ¦â³í²PN‚n“ Ædm}cn¢sfî$J|Õ’KÓ\„§.'¦¦¯",oý²¹c‚c+LVàæÏ¼ðlÆR¨›„úDß*K©oŒf–É«ÁÂÀˆuEseRÒQSz /ÛBú{ÄË$Sž×sñ9¶ŠI)ƒ,È+¸œê/ í¾Ù;ºéÑËêkiZš0ñH40,NÍR-É%!‘Oš™‹Hίsާ+†hOpš‡u1O€79^BgÁ š•faV´¿ÑŠ]„Q¢šsÉ OÍÚ÷éÚû(Ïà»[˜ _ù€Àï Tî*JÜ÷#¡°ávP(€,t‹Í*…×&Þ9}‘ë7+Wt ŸŠn%fKK$nʰhzi‰Tùá8ØŸés67Tw¾Úˆ°È¥Q´Œ1”:|vÏòÄUaúu¸ÚË® cê?c¯D ) šUai¹ ‚8$£·úž® ¯è ƒ»†L™IÙÂå÷ófHI—¼ä£‰ÑÛ,ÖÊÛ<]hX´„ïøvËg!¡wS–U_yçY˜ègf‚^ÏæAƳšJå…}M)’À®Åçâk¸º+RVŸ–; ~ØÃœ&ù36s|¤%à%nV}¸äæœJ¯5bh–†=³–Q·Æ’-˜Ö/²"¬ÎÃiJ:¿Q(¹ý+©'[ócjƒŽÖÙð<Íû$‹†……b&aÊXÛéæ$çÊ‹òešƒ@£ìRñæ<þÀý;âuÏqÞ?íAg¥)ƒ›Á‘52T±tþ©L"Ê U]…Ñx|2ãÚ!ùîäé®ô* Z­ãL))·ˆÒôrgŒûÀ-ë„}M5±Œ»¬ÁfÑf‡yÌt¶c(ÉÙ~t¤4õB>ææ_•Ô-Œš½îۢܲؤ5vÏ•7ÝXÐã!{Ÿ2½î“GÊçvu—3Hq“C6ÊI3’‚ê@¸*3Óëhw°(eó2øm–îÅX°™ ¯,»NWÔx®ˆ5ªvëx9ų yì*xÒ®YÏö;?:Á,fƒÞ2(˜Ñgä@—þë¾^“¸CÍAºˆÑ(¦{(†ïJu%Üg—À(piõG¬4 @ÙRaaɒݺ?QN)ò:vÚ{+–˜žNÒw¹»ì‡+’pë† Õ Ééðü9)”ÀNƒLs¯"˜ÇnNϼ÷‚…yœl&\‡Ò&wÕ,z†šÄ]Î Qc}ŸÌƒTž£µŸ¯ïš Þ"2µ—cE R€ÉGïžx›Á¸;õô…õ”'Î0׸änäÂÖ)Çbj›2`²ÐØÉ+hÝÃ&03ÊK0£é(üó¢`öÀ–ÓT}CÝ7µôvöj×øNÌýÄö ª ÀSÊJMóÒ—nÕÖâX)L-®À4Ã4Kè°øEE`O³eâ)’îÆÆ¼Ü±ÉÄ÷ ]n>,:á¼™Ww½Ÿë/þ´²"ÓôO©0"y‚éE•0$‚®š¿Ì›r¾÷2ð•òü‹òœŸ¶\ t»8q¥r\âÚ÷‚À-Ö`u+í/¦cË<äˆ|ÚÒ:räNóuý’­°Ñ6K ’°ÉI—.˜ %þ|Ûd†|ßCËpا2(™%«E.¹î/[Âæÿ'M꼦˜q¨„î8B† uGl#>6Ë<€µîû=fzN€qþW E3ó"ÈŸ_æË~§ _¢º4ÃãˆÜ›WüÊ W¶O£ ÎCWO3-ߎðuF‰r jÔ pQ¿“AÈK½sL/½¿á ú@º5ٯϹéy…Å´Tß·:Uæ6†WN–¹%¦©ñ·«qôêÜɧ#kí¡,.uìZ–¼Æ“kÙfQö©·6‹4õnÏòm:vy hÚ³UŒ‰Ëm7Ýî7°DZ‹ã´”Úw8ª%‡í·Ñ*²X…ïséû¹Ë#_KÍ›k|ðq¿ê‰ ËK"þÈrØL©&&Ï?uÙ€É#*]uÁOM4’÷³êØá™<5³ÇåÞŒ¼êºU2I` —Å>ã4%î2å ù’™hiÃÊà ÜZ-µÊô«AçÅÓÍ%Ž¢>òØBðÛ*Œ>Ê•Ót‹k=áÃn=Hا×:5tz Õ£ üJ–|í£Èm5$N®²¼½9-?é"8ìÅÓo}°"ÅÁ½„ÅÒ_wø¿+)OCläŽëné{Æ÷Ÿ_ÜûOøï?–l…Äendstream endobj 94 0 obj 6240 endobj 98 0 obj <> stream xœ¥Z[—·Îó$?b»Ïñ4­»”7ƒ‰/‰1ëC.ÎÃšÝ ° ˜“_Ÿ*ݪ¤ÖâÌЕTú¾ª¯Jýz¿.b¿âùï'/ww~pû‹_vëþKøs±{½ñ}þëÉËýÝ3xH ¸²„5ˆýÙ³]z[ìÜ[¯!÷g/wÿ˜äl¦e–‹sNM.þãà|Xäê§Ïge¦{óA-΋UMßàO)•sÓŸg9ýe–aqVÚéñ¬a¿êéÛù §ûóA,Z'§/àŽ÷ΆéˆAûé;øe­2ª<¨-Œ'–¼ÓY´çBÓ£ù`ðv0ÿ<ûsf ‚ñ—ÕÚΎ°S‡?øà!ß9¨-†ô@²ª­™ÎáÑ7óA/JY˜ò[¸á½…E]?\ì_´ Óóa]|XÝj§§°­…”Í“yŠìî“Y9ü9=ŸU|NÀ̓òëb`ÄŸ¦dPŠnN¿Â3N£ƒ§ïɃ/Š)|$›“0"3“…}vz€¯ù VÇ'ö ^5v*¯Õ)E+ K·ô ]L«’JOŸáôDœí%ó¥eåJ«é’9ëÞûi®Và' /¿¢§ØÈ782€"LïpG…ÁÒÐG¾éº ãHJK»äï”ñ‹x †MqVƒÍƒô˺:ËÇO6 Ìô|7ÐM«ˆI&Ìò³ÁàXu÷œð¸'@ØÉž¾ÁY4Hã=Ãéh핌CdHëÙ{ù¢œ·f–jÿ ÂÞÁ^¼¤'›yGeLÓ®29²ãúMèëlÕÑ0¡ ‡®e8z§92; }€¾r-†t¹IÖÐ?ìÍ [ÛBç (÷ý<À0Y¸£áÏL€SÁÇ?`ûç¾CYºÅèU ©‚覽Á÷Áºô€]£1d&WjßöQ_CˆH bzO1ñrô(Æ+Ø&­óxc¡þ“11FÀÔ c0ìKxÔ·$4ã(q:ò•ÀŽ383(ã¸/q ëb½ü˜Wí™ugâ‚+ïe¶+Q erµ´d|NG^ ]\/]Aø*2Q¢ã"QLðÉO*Þójtp|5mæaƒÑ‹57#•ADó…O“)6 šB¿k£Ú{ÌÕrÕ’‘m,òXY´éÙRw7Úæ1Ì¿FFþGx3£Wž]«/ã2´ì‰cñ¢¢) yIMwç²Û·ÃòœeŽËvì©c†‰)V–T6ÙÉC4Gª*$«*‰ùqÌÄ×(¨rB49p'„%»{˜l QCF‰-Ç93,@t_ÄÀù ¾]…ŽÎC—Haã ZÚ ˜¸`a“'qB0êBim ˜;4 ÍÿU$Äè+€‹ÿ¿2à@B§yZļæ }-lÊù܉)ÄÂ.„u£Ô@©†”Ø©tâs“ÅRdö‹×¢ànì*˜‹=µ-!Ñ…§½ÑÙXl)ᣊ¦¡dH>ß6ê¦,­zRyš&Žø}DWÑ„ädÎÿ[s¬Ï爜Öj—GD^v•™R$56ÑÑ+­þzm¬RL=‘t™ "…ö‰…0 ðôä'+³Š›¦Dô'±¼•W›hW™ò©×™,ÎfJøý•ÁÜÃ-›J¯ûg»‡»×{€6–›°¿—Þb^ß› Ì+Ø»vw|·ûæöéîÎã½ØÝù ÿw÷û{ð׃/ö¿Ûݰx²²m ÁRÙJ([E3‹ÉÕmxqÖ!4a˜UX?Î KÆMHÇd‘7×X+8ý±Êèôà‘´)*Ý>¶w%xC:Ðe¹éb²[},önªbÇ17º0gx%d â›|Š÷oÚhÓìûªâ¾7y²$¹wM]‹ôn 'æM×(Ž>A ‹1¦qoÈ7…;6( Uokb'í;ÚŸR´­€1dz+JN¦’ìË#{¹¾ËBÈÒ•MÍÈÔ,Óªõá´x£\ŒÄÂ,e[Ÿ%9 )å)Ø?aJvκ‚b¥á‚WYf¤ô.<¯'«,Ùß3ê 1Éâ^‰ý'"$…½'H–_y¦UÞÓDD9­-Ê¢óVmÞp\–ªáŠPÈ‹¬à7`ȱ†è¹+ JKØn2FeuhõÂJŸ@Zœû½coz^é¬`°<Ò;5rÑÍM‘ #9Ûð´ òZÜÝÌM ¡þ ‰ úU yÀ5ö;0§e±PϤ•j„äL]( ÚéóYÊ!z‰ù™ieÖdíÄò Õu:umÅÙ4Àe…'3õ ‰uÚ¥A7ð2÷4®©4g™©0,‚Û%ÆÙkÖõÝôcF¨IÆ!c°ù²—X–Àh•áÙ÷ rcXõÖUxÏ2Ž ¦ö cìõa!ù4ŽÛÍ’jìÁŒóÔ_R«Žý%šuÒ¬¦$ý™PÊkX°îo™õ/“½Æ\^wMÒéŒG•)¬còYG“„WÔ¼€eÌô§Jpn¤ù cYÞ¶žGe5µÎsu,ÝÆõ«¤ƒâ‘ÃP-³<…I@žž0™\5Û3h#JÍöš;è€ÈCJþ Tc õ¦¯6)Éth®jµ½ÙÆZkmÊÞî›é}mwŽ1t[wmNàP¬Ö»ÆÎk<ðaçB©JY”ï8Iæ4˜‘²=–¡gsgAöU*Cõ‘Z¥¤†—”95«27±Q³y)y‘OŸ²×ZU”š!>G®A ³òs“âºÞš .zšz,MS¾`˜vZåzƒm°­ŠV°öÕÜ4ç1Ôu×¶iÑ:^/ÃÜ©®vÙ‹ \²„¹”D„£Öé»RÍ)pÄeô躸+˜Dù)⋦EÙ¶îYÔ¯ª£¾Œ$IMëB’ñ ÜÅlz1Çv¸&I;ým+#~lF³æÌHîà`ÏcU•ŽQj5Â<ãÐÆ=ıh- ‡ÈAq¤—Y®ž‘·›d"²gÚ”QݸÑ/Ý«Nè£ôb‹úÃãÜÜ䢖3×kÔëüø.ÚÑ!2Œš¦,±SÚò,Üwsê÷¨ ìÏG]ËA”ÐéPþ>A¥öÔA”°²A7;Õ9lz§X[ü«<ïµå6O~àéB†ŽL@ÂõT>;MQÙ@œ½lW„¦r,¼¨g«Ô¨Bt±^Šø÷·‹M[ovaº®ÑŽ’d<#Õ^bsê~ž ®ÿØj¥äˆ÷%¸Sølðþ®‰tÜ"ûºõ7¥1¬K+׆ª›6î\£‘Ô¯jã‡­Ôæ‹”Aní#w·Œk(8Oéú4Çêºý!«F7 ‹dœI´d,È‘4xŒh½¦8OÃ_QÞ,£Ÿ78>OÈ‹SŽ#´„î<à:'Ë’/ujŽÙ° +"ެª_Æ(ÆIj4'|ÒÝçÌy”ëQ¬0ù‡v¨©¢¿B'ð£zll»UD½ómùUü°A³ˆÔæD`‘u,sK5‹QÎo¿ø!c¢—ÃOk°Ï¢sŒ¥tŸã~áÛl^ËèU ³a…ýÕÅ€ßd¦®AÚ[@n®Ïˆ¸ß#ªÁ­ÍØÃ"up– ¶‹w ->ÌÞ¥ŠŠ-“}mÅt ¬Å/X™ìm_b¿ÖüûìÓcF'Ëy¯'Eˆæ#¨m=Œ/¥ýµžµŠ˜’)N…¥³¾fý°†rYjñ£×d…“ÇL¬}¼xÁ8ÚgÝC³-AÙ‰f“°+èRc³ÏU-p·8×K1 ÛÃùº¥YEK1P¦7H™a`¡9|ïÒ}Õ’œnôEݾmö6%-? +êÒ—ã5|w5^sþ;ý ½XðÀÛÒÿ”,JŠVäÊÌhÛªuA´ãŠ&å ̩̚Œ£coƶ›Ô`AøcÅô¦¨/‘§6´\K9^¯ ;”ŽØÍôx8ëºÀÌ?®ìû"aÌ,6bø¢æì°V®ŸJéÎè¸Q›ú)Yüi½é*áâeǨ¶æÈ‰$ú¢M$Ù¾“\Ä;Ç+æÁ s,l3R¬ñõ#!¬U`ßr6ú5>8æ%tæØH RÀ廯77 m6 Ú›ñXškבj…ojã…qætq¼íu¥Ú¿¨HhL_–É鯕·Û8"±´ˆ 8é.‡t]”øƒ³cæ™¶Ázú;zÏÔšk?]®c6g¾ñ‡»ÿgî:@endstream endobj 99 0 obj 3362 endobj 103 0 obj <> stream xœe=o! †w~£ÎÁ†;ã1‰Ò´ú‘°UR5Ó Qÿ¿TÓ;)H!Kæy#n>"ùØöZ/³ÛœÄ_\ôG;Wwsôøµ\f¿«[5*ùúí–4ya?•ŒvYg÷Fà0~ÖgK$꜕-T¿ ܇!¡ˆ*Ác T-YaÞÂ@˜ó( õΖnÊNÖM¦ms­ÏT¹7±(kÎ}r4®Ò”á©][ ^lò±‰Ù¡©d’•Ñ”¨OžÃ0š”…zàµÌ> stream xœÍ[Ys·~g\É_Ø7Ï&Ú1îC©<ØŽ+q”ĦRVªLŠ2©Eɺ•_Ÿnœ f¹”˜J¤¢´Ä`€F£¯ýeÃf¾aø7ýÿðéÑgßÙÍùË#¶ùüœýrÄÄMúïáÓÍÇ0Ém›fsüóQ|™o¬Øh+7ÇO~œ¾ÜîØ¬²ÎLÛ˜…àRN'[6{à óÓó4êÅôjËg/¼òÓ£-ŒI­ùôb»“ÖÌn’¸’“Ö ó¯ã?ǽÕl帷ֳ’ÞmŽ¿=:þíÓçø–ž%“Ó×°•Ô‚‹é^؉ë¦ãíŽÏÎZ)¦ïq*Œ{>ýG…bZã¶lVÂ)­¦Çø·ÞNOq‚ñŽ ¸%¥×’Δq|š=ó‘4?sÃD& ¶–@6Ò€!@¶R^Ãb¶@Ïô6ÓjÖZàGœU°›‚‰BªéaøÄrKÎÎÁëË϶zº‚<Ÿ•™Î·dÝ7[>ñ´®€{oa ¸øÈ¦ÓJœJÍR¦ê"õÕŸ‘L˜ª=l*Ý̸Zîô¦e\ïä“ÒzÓ/‰3ßÂ’ÎÏù¸ƒ1p«<ÔʆcÅøÄ(k™J6~ß²Ü%öávuæëÅ¡ñ%\_¹Y[Qȱ¦(‰´‹bd¾VÁJ”Ð(Ÿ>Ù¢@€d€€jŸF\.ON蟮KjúµÁ;Ðò|ÈX¼G£{V$^ ¸<aB$ÁƒhŸá›>\cZÏr“6a<>I§ëØ <•Ê÷¢Ê@Ÿ:pQwËep·<ˆ/€Ô0%V&>Å‘ÜÖ¯êãì#%cÙ»KüÝq 'G€lNÚa-ˆ¶&¿õº" Ü”F‹T¥ôè›e~¹7%zBîs'áÚµ1™o LQ#Ü&•D“Iô·•j˜wNŒÜbòiùÔe“ SqÑK<ƒá §Íî-ÆÅẄGv½éŒÀM¶˜Ê‚` `q”½©Ã1ê뢲˜UeÊ3³Öiy0Œ‚méRT@«’RQ?~Š °ÒG]øGQ!PWµ?=úhõ ‹{©÷Î&棭"Js֪ђ¢ß²ŸD Rø÷&ê–ÞŽ¨0²• F†È%"nK „Î.%.—@) _c…%X®-œ÷è¶ Ð‘¶÷ëdw„]`x¸p·¯uxIëJã cÛØQô±h´;ûWH ¿'¡¡•F­’Ç9n¨)Š Ú;hª½;ÙöAW„¿*_J&¥Úé')¨²DúqF´ÒCý¯î—ÞÛ¶Iî}|=¤ ¢ë:„œqý£  šÀîöˆP.àeÌbèc*·îVÄ]M´áYZ,Õ+È2³:¼Ã§oJ¤ù¨ ¡¡È‹ú.f}ú#<ÕS=Cñr Ü´%áìÕÀ7¸- Õƒ©ŒVãVÖøq€ü`[ÞAèí!¢a(p#H7YfH|LƒÛÇ›ÔbZ k#ÿ\%Ö©1’°–Ÿ9°á›­hŽ’OÈŸ Þ ª®Ê¸Ý Ä“¶ ÁÕàT(§Ÿòe„<<.Œ²@Ù%SÐôù õ˜ôüVä”âËs>ƒ¬.ö·bèäÇû㔺ÿçE6Ècò±†ûÔ´2 †Bš¤ûÖûEœîy`1T{¨õ.Xz¸jîšh³ÐlûÓ´äZ8÷8]1‹w  …ÄpãŽñeHÜä2®ð¯ ^ñhcîÃ¥`IÂG"©ä&Fiš…§ÄÇ¢DpÑ[¢NCø ¡ßÈÖñ_¸ð.Þ¼à%ËÔÄ^ÄLç|kΔ„a&y'©ä’ 9É¿xÃ`ô1\EÎ ‰j óK@DiŽ’¿Ë<'^+‘º’ð”1¢¯*Yë\qIƒ§¸mPƒÉúr±¾²Áî…"ÈF³´äH§=Gðùœ¤¾ ‡»ó 0pV‘ü–à^®x‚"Ú5¨„_ŒÓ,‘Ö¡Žt8ø}" Ðã¬n²Â4¶Š¤ô Õå$Up èì5[{‘qúx3dœuãn þ†¢¸÷Ȇbí8â“kdët'¼Fj€yáÞ(+@´¯èŒÊjà'ñ(Û" %³°Lndbñ]u‚Gøú¼xáôl¹¯aM“bš­ÍíË‚´:ÝÖ(#ðˆ¢9"Êi‰}2?Šê¯Olyš~:ÒǬ]ÂN^К¾ÒfkÒœj5€dÓžµ.‘ê6fÄE‹–Û|ÆÒG`åˆF?~Hb9b†‹ÅÈ©„eËL,Àv4˜B/`@>Ǩ7ˆa²Vr¹e+¹láv]f-%C´â< °ËP³4ÞéFôh"2EÅ>jæ ì¹’»HbèIš®XÐÕ(«¯*jo…˜ºœP|¸Õ!U‡`t„»¬å[uìú"³¸-³ÌNL;ÊæM{¬}‰”®‡þ¥^]—0$š«TƒòA¬¼˜•ø˜úF+Çqð ´i3‰IÑJXê»ëEÚö ÌC•GÏ;˜Îk ¢l§EE'0‹mj‹"vg³ã1¾4I½‚·A(£åçªd<æ¾u6TyÍt ^’Y^¶*H‚hÆ,ôÐûÛš¬iÉEö±å©Ž†li}LUº×U#.«„€´>”¾í€®÷Ð'”ZÍ6‚¯yý²ót] Mf1¸&dá!9Ãçƒ=Þ˜UÕe$141»vQ{<¸‘O †Æ¤ˆ•Ë”y² ÙšfQÒøL÷©-U»tÔ¨”™§æ«å!Átm~JšXX[ÕµpTÓ{ÝË…]Áv› §Ö‚¤^[ô¾#¢E´%'ÊÕÿ>3Ç95±È¾­6 ”ô›§÷•ðä2q@%¾¹1½HĉzKM&†æþˆ”\<~ë>É6§xñ´UÄsSz#'yM¨µn›i,‚Z7è[3ÌŒ}ð£ˆó´Ý—߯øK«xůFX"÷´H‘ /²z‚={Ư‰ž“øålM6R„æ¨:çÝ5Aä>gWx!«˜Êê·^C¤Ö°€P9ú !W¢VÁiº… þ훂 ŠÖ]Hñ/?¹›u&uMrFÛ&C÷Ÿ× W 0¡øô›èvûKüˆÕœÄM#»þTÊdž{ýªfšoG™r¾‹ñ¼19J»_œAMœ ¼ç"¥z°Pu•»˜­HZî2Ø%>ÒÁ“œIy\–yBâÓt! PÉmBÕ=O…oì©Èw}x… çܰˆ/lüZª9u,¤’ÓT›DƦ$›RD;$[ùeU¶{Èÿ›îÅh¥÷xëTí@Zk@L½ƒÿU¹Š2þYA2okPCLÚ ;–Êæm¤P޲Ìdã]¶¤†ÝØ^b­#1«£Å¥„ã /%æý‘Š.Mó"A= E‹Ôƒ ¾‰C0.Íö< Äî [cA<µ`ò&âùÅ·äÚ #ŠAá-eØÿwrZÓDáNÁV+|ˆ°¦ŒÏz*÷ÿGXG)äý·ƒFO¨‹Å°$® òçÕ… ‹Fô’a2¶oF½‘§J5XÎèä­·Ô},œ;´%…Ú¢Ág`PîY`KÛuÖEŽ‘bþ í:5Pô•kxqz¯‹bMhtùQg!HÍIàÀÉ„ðôf†HÃúþƒ;8®kÊ’ùÌÁ–¶}Œ5A‹òWjt-Bµ*DÐRçkÆŠ×H l†=N„ ³Æv‹Î²Ø’âiÎr-š„H›ØCõõÖslÔ¥´#wx¼6 Dš,ú6WN„Ö®K<îé¡Ä\“­$¥q=¸»“âfŸJå.T‡vÚšL)†éWŽ~åûZƒB»p[·Þ#†X‹9nM×ÁJš­óÔ&)”´¿±²ÁÇuÕQÇDo¶“¤î6$ä²R¼(®ËJs©‹D›à]HwbyÑ¥V«kåsoñÌ‹kKŸ ò@Ûäm0—+Æ:DN3Øv™%­Ø/“x)%¹Ð”Ïs|pm+pö¾ºoŽ y¸ª(9ó ÚÖºÕw=…$ó7lÍÏ8U{ =k#ŒšKÆw/`$aY+~{û×_F€ž”ª>ÌŽ°Z†ž4} Q/@uÑ Z^åÿ÷àËC k´7ÕI¢Ým%-n²‹ßÞÀ2r䆨.;«ówº°]9SŒ¸[ˆ¾A¡1AØÀwKM˜e$I&’—¾j\#f^­b–þÎN¾K›ˆ£I¡ ·&”ÒùðÅÀ'ƒÒ35A©“VVääýP÷°JÜݲ#~œ`"ºÑö)ýTŒ\“Îm¿ƒ¤HQ\·ÚÕBc¬;bw°žÔ“.F@#‰­ Y¹$ð5m²˜Š\:p¥ÊoKÒ¿”¢I§gƸhu_=Öd›ZTí%?ð«XwIeç³ï”kâLÐÛ.«÷X5ZNÿÄîã?Ø“=ý5=ÐÌÿ÷øb¹ 7øÁ\  5¿ÄC6)L‡9ŸÕéqV·ÂW0#­`!]DñÍ«:ˆ_Ýñ˜ŠYáøüU}þ¢ >®ƒWeð¼ †ïœeÿ¿vއÅômù§á9­iƒ…>î$i±|l°;.ƒuæã2GÖ"¶m?¡|Í3ß—Á·uðY|QÏòi¢aŽÏOês܉y¹gxP@pà“ߌ^¸,ƒ¯å5·X¡øå¬JØÔ%cä«ã£ÀßÿK¤ÅÌendstream endobj 109 0 obj 4104 endobj 115 0 obj <> stream xœÅ\YÇ‘~'ï_˜7uêRå)Àö®|,dyWœ$X<äX¤ k†5ÔÊþóŽÈ3"3« K جÊ32Ž/ެ×Wë"®Vü?ÿýüÛ'~æ®^¼y²^ýþ¼xòú‰ˆ ®ò_Ï¿½úÍ54ž,a âêú«'©·¸ròÊz½ÀËëoŸüy'öf§÷æ/×ÿ =” =dð‹±Ðéúþçþ çB»ßïÅ‚×a÷ë½ÜýÏþ ­“»ëØÆK¡w·§ŸÁSÃî̵Às)Ã"t>(é—U¨Ýo÷8¶³n÷ìçƒR‚Žö‡0‹6l:x…¶«[-í÷GÌZõãiÓ´UNœCÞëÖéDiËybU»—ûL¯u0»¿ÁS¿.F›Ý7{%qÝjx ;Ûýˆ3I)-<ýa;•ÆìîaëßízQJ¹»…ŸBÂ~Ôî®|¾Ý$¬Þ;KÆ|S ¬ïÕÐ\¹%xçTÁ.RížáâN6®3ˆ&hS¼Â‡ë¢Lß™¼wJÁââÃÔÎÃÂV8]owÏqxmàL^ò%’}à?ŸÇeJ¥Éˆ«ÏHã786ü÷}¤›Št!xM$°Dš‰¼¹m oæ6¸b|Ñ V'ù›8`9KúÞï‘«¤ …ÉïöȬáÀÓ^Ìâ$_Ç¡‚Ñq:<9[¨ê„GªâOéD$0P>a…®ÎÏpÔ7ÈŸÆ8+SÙ¼lœ«ÐÓ~ÍF'~O%°„ФÏ˶äÒ‰p(T8L¶ÊDŒÛÔÚ‘÷¤|Q‰á Ñabé,Lv+´8À ¥¤’»ÿ‚¥È ¹úÒ„Ÿ ”tkìü²ÒŸŠÑ«Ö6w³+ræ8—“ÐQMHÚ€'Cøt¶ Oå…À‰§¡éœø”˘¼à$ÚGA~çâšUÃØ²jΨ«»š°àyÅ…LŠ Á"XUÅ _¹`‹ƒcu˜–2lè0ÔQ…ª–ˆ2‹5øìË]eM"M„ä)ÜD£ý¢kýrÓ‰E€þø &¼ßèz¿W>ïo5ªIêš5Êø3ÊÒ"ÊX°°(@…~Q€Lð‰ŒC_gn•=á1´=4¡’—H*ÆJLòî°‰Ž<”\’â)ÐÊN‘%öV®·Y”Ý_”¬2YV@¸›£ ./(ØS…Ž,TV9Æ 9úËïÚ*b8i–JUÊz€wº “©=]!¬EálϘìBÔ!Í"AV¡è6Z9庑Á-Ÿ{J뉶a(ˆbåCÔ5I×YÉ@ŠA¸2’ÆoÀ"‰-ªÃ“–uTJ;G¤¡ªÓI«¨ ±¸ÁÈ£yÐaóƒ$ ±è'@M¯ VzàÜј—yeÐÅå=8RD8WiI Ê3Ê?‡è¼iÅu›§ˆCVì3åÃ;Q¹ÄrœÒÎÝÌÜ,m(‰ÕD VÉùŠnøð¢9¤™D8Ä’u¸rÑw]Mt™(–*Sl¨ˆµ‚ šÉ 1â›ÚK„ŠAþNUáýû|X«ábÇpN¡­6izØãM3˜ƒÔcwj£–W—æwÍ@3ÈÇ{íõÝäõm} U&7*™™”:ÊLÊF7½ÊZ3…nw8¦Õ‘wó©ØU×Ñ®6”ˆPúŽ \„gÈy¡Ì ·ÐÆ>Ú™÷fë¸Í°øçÉOÜ2C~M«õê%)C, ¼Šº@%W"û©e· ±Å…ùm×Ò$„c¦ÉâÀ–ÊÓÿg/,‡/‚ÓyÄIœh„%?Êh=Žs@Y:é‘^Ä“¯Cv~û÷( ÌeôÀ%Á ènn¾³ ²é2ãÊ´™³/®òv ­ †S–1³ô.ã¬@A}dUO²Å þ¤ÞÖÑ2ÈÃo-cæœÒ~÷i"þ,,/löý¬^„¹H­n‘ó‡©üu‚+«Å h…ðB&ÊwNP!šûäÃ>ÎD×…$ÜÞTxqϹ:ÿTÂQT‚*Ú€*Ü×”*Ó¤m M§R[±”÷ ’$‚pD²%Gô¤µ½ÏHT1³k¦XM›Žî!é÷аþ^ ûi!£ûÊ£o'‚HF½£œ0Ó‚0¬ÛVjÚÅ㣺©1eïCs¿ÓÙé³ÑB3âtÉ}ÖÐü/­bàû&)ÆK!Ç ÆEÙø.Kà‚*[ê¹]P fÂT•û±6ýÒl!.ÿ?mðíttþyà ôbõ?™, ‘0uŸ0 ÞW£!y‘Ì7*,Øù ”7UÐÞ,'4—¦Ò‡¸eHîlM³ `K¨…¢uËÔ\F$®‰q¾ ¢¥?Ó£%‹%|Ïe£ O'é"3Ë—.0¸nÐÙ¢A·ôŽ@]æ7 ìb3˜®g6øOqf‹XÃ9êÍ’¦ÚG!‡J>ªMÑÎ ZcgÜŒ±å¹… új8bâ÷âñ=4¹ žt¶¡3Cm²¡W›âÄÄ>Y6¶¤Š qß] U’KIƒÚ¤,ÂøáÚ!Ö9À/žz(ÁN½áQ8cø)/¶OªŽ¡²¶Ÿ¹1LJßNŒÚYü†sQ=W‰]¡S Ë6qÜRg(1¨l§gñdÈž°[j~ù´X¦Ø70ØÜ˜"CÆtb 8êIk ®@I‹bÍ#0T1J•3¿ßSþšbí‚9ˆüü¿ýw µ©<´Ò†`é¶.Ø=yP1;šÒ9É;uÈfÎa{[s·¡Â’W;ç²×Œ<œËš·u­Á7=‰¬ånÀ$~?$—¬òp¶kÍòjew–WeW"€2m]ÛDB˜©×ºX¼À÷[’Êk´w˜!Gg‰„‰\™<)gCä¸ßÓèüÙŸ ÀŸ*ÚI’…é§šò~Œÿ\æÂC7*f/ŽE`¸"¤á¡¢WP †×n+¸1¼QGúÃ9&e|')»´óÇ8'2'Ý6E‰B¶âžjHaFLAº¥K,MÓq{“ƒëÞQý‡@¤…Å[kL_Ìܪõ_¶N5gf¸‚ªaéxñ…ÒfA¡ƒª0‘³oÄJ M8†èÑ/rçM§©£›e»ü– ˜øš„±Z¿¯Û© Éöà¸+AEmF¯Úv`X«‚¦`dZú@0h]ÿ3¦ÈDð„H÷Ie9TΜî6nÙ™.µ?˜´×Eˆ£}Jà¹ÃDšß¤b—‚Éæ` <Ú1TNæ– «NŠ}ÓHdH5µÏ„ªàZWAsd5ÉÂ@¬&©ùCî 'y‘ÝãD;nJΉÉOÌ ¾1æ÷'|dÖIØsÄÝQªe.LŒ,÷WÀë©PƒÚm¿H=à§ûT­¨5*šž8­À‘`ѧmDA‘%¶÷t3hã/ö¹²ñqaL*“&¥ú&ÞoÖð}-Is©c“U0Ïúj¤ŠW;%Ň¾Ó÷ Ga…™ŒH1ž¹ë–£AA“€?w?³Æ!õDŒˆv9êoVÍ!]HÎ^®F7ö'[>vÍ&\•ˆpˆ™»b0šaxÙÊ}FRŠ€¨I~lœ$„&áOšÑïEŪÕOž\ÿòXÝjHÙŒŸjhôªcÜ#Y|k|ç"ß$ ÄãùˆÕµgc¼;•ŽÇ LSJœl­ñPõ©‡ñ4ÚAwG„hœ6­AFìG2Cq£Òí$¼ñù/¤U< •ú¯E·wÐàü]F®(ÜìhÕî7yÿRqU~®+Ò¼Üãè*ù¸êLŒŠ8&ПRY43Ëh,$ —*††x: q^bÛ‰Þ$ùX–¥M@c¿ô<6DM*þD¥äúj~'ßC!§]…T±åÀ¾/$ŠŒ—6fÖ˜ûÇÌ/œ)IBT™è)¼ð‘žÂƈü¯j¢?g$psܱ©tN4•BRvO%ñtR¦Íÿ›%Ú ‡ CôBˆí½õÔ8ÝÚ™½jκ45é@Û3RlXÂpäYÉ>]œÆÝÂ’X±Õ³ß7Ù R,÷¨BŽâ¥Ÿ yƒêøâÈÑ©IçZc6<†(î-îú´mšØïw ‡+®,a?©ÇwÌyÌçAb<Ñ]3ëñ°ÕQ ™h9§Ÿ|Éì ÁÓŸíðKß“B~Z3Q¬ñ¿ŸÂºPDlH ü þu»,;ÚÖïðp¬»­˜ùeö™\'Ê LO³u©˜"†ù$¾NÚ¯¨¹Øs^6Á×Ò̱5Á.ÚCn%À‚X»–A›oÏo@ô7;é¶½é;oº%Ór%—ÈΠ˶Ù»²/»ž5½ûK¦á™8jÚÄ«¸ÀÉ­êå§»8hÇ‹Û7[ed‰ÎØÈÏr³f¹† ¦Qý rT_»ÄÊj.­?ù‰ÚÿgU˜—üt/7R1KœIZöµ»v=ºf‡ÄxM/¹Ñšp))iæ hZMLîð©ŒmßõÒC™è®iA" ·M ó»ö‰–|»‹þ<O¹F¬Ýdébþè"œ‰9+‚qIõqW@q ~_i3%LT+·³øÙ(MVT§~=™RÝ$ëR¡Ѫü+ E+©ìpk 9;ª?~ÑŽ’_æµéË‚,˜›I{öUY½¶Kh1`–®¤¢Mð6Nœ¾j?ª?l?¬¿ª¿¾ž ô¦=\êÃíá›É@ÏYŸòó®ý¼aý»§h†I72×}ûù¶þœªMC2“„`äŸð. ¤1µ¨&%ÿØ0¯<+9ÀqS~<©ä{·xÝ]œ)Ÿ³e—i]Åà¾]XOæ'c?â z!V[#œ8¥E§ÞÏ4â4¶#·¯â¦W¹¶ŠB˜‹³U´Üî‚=ú2|¾ðŠëÊ„9¥Ãkvô+%,“/6}|ýäáÿc˜'Rendstream endobj 116 0 obj 5166 endobj 120 0 obj <> stream xœ½<Ù’\Ev~nóõFA_å¾8Â# ƒeÏÆÐÄ8bp„[jh–º%!ÁÀ×ûœ“Ûɼy«J 1º«òfž}Ïûj'¹øÿüïÓþæw·ß_ˆÝçðs{ñêBÒ‚]þçé‹ÝÃ+XvJ,Î)·»úö"=,w^í¬×»«ÿØ?:\ŠÅ:ãƒÛ?;\ªE)©õþú –è„qÿ2ÕþÍA.QE÷ßà3m­Ü¿>\jï–°7¸SÐÞ+÷?Wÿ™Î6‹^âÙÖ.Fǰ»úãÅÕ'ÿØÿö×Voöiá¬Ù_.å¼×jÿ%,0AJ8«,ðaÿH¡ð›÷  ü(@ȯÚ÷€)ˆ²1Ñæ!¯H c@M4êKYðƒ½PrìþéÁÀÇR) Fù„Ë,Ö†ý·:>æÙ÷?â÷nAh@Ï€Ñ@Àáy‰O{$0+8%ùÊï íð´ÎŠ˜¿DîÝxw l/C…Ê«òva1 |éaâYÃyk<-ÏðxÇŽþ™ŽVÚÐBT%À÷ŒµÅïìŠèð?]ˆŽþ—z° ~ÿÑ„¼ßÔ#A§°"#ÞP"@]á3°‡W7`+´oð¤¸€Š¬)Žà7m?<Ïj8/J¯“F€"ë2ôy#Eê]hÞø6둨ç|¶Àå‰S!㡼lÏä½½t•Ëu‚…cl _l—%.hÕ¶KP#'F—™H—Rgë´ªd¯D{;9§c¡>“ÑOawÀqxΓûƒ#,Ò Ì³†‹øM[Jöã ni"mùcSÒ¼;80®%ÈзZ£? r4‚׌ŸpO {ÿ]•Cã™<­¿¡À˜°€ÁãÒÂÀöF€É±¬þÝ X #×Tê&[Y‚ÉïÔ¡|øo™ÈW-c,ÖOÂã p=+ÐñjEǢ兎h¶à¡œ÷\$4Í€}Ûöx´Ò‹ ä‰AT œÑ})`ÑX‰&‡|c;4û»Á¢³ìr–ž¶F–GìGâ8˜ˆMñ±Š|A‡Æ¥V–,ÓÌJ6ÔßNl°\7S¸R Gмí žµ]~J†O9ˆd±|øÜË‘Ú` ˜?¨Ÿa¤c, €Yá_Ó–Gà+/ ”BŸ~Ùvg Ћ* , 3”…%ÆqYabÜè`*ª•ìXÆ ™%¿¨ÿù ö@!Äý÷a"Kèß!hQûÏðopW^ñ(-œ›­B !7²ùfdÊðGÍ2­Øˆß#‰ÉÚÊ&è€Ur”LzW¶“'d«"½Î0!F]7h†+K"DVƒ®Kô¢’&\ÌFu^¦,MÊí€%Èi;kjàÂì‚0͸îå÷9wÈi‡-’ÖÖoùÆÉ³[ Ìʳ3ΠÁì§8`Ê“&˜o›»E „#ï˜ß~Ö–öÒJ§È‰qð–´E';;$¸ól+¦Ow¡DÕ€fý{͸©ðg_Ndé}y¥Î·(À ˹ˆB“Ë1zeÞ=;A{ €üt¸5Š„ð@å@šw°,h €bQðÒ>\^ Ç"†ëRx.Õëp]£ÑÐÄ^–ž7õ¹T%éÁÍ6­ëè` õB»ðgÌcHY+;M“ƒtû‡‡Â¾¯êÊ?$´dLŸà¯>פ¼!ÿ$d,ÁÍm\U²ñ¤¹¢8$`Oñ›Ë«-·½”Ń ú =XÅBY$MòÊL _¶‡Zò#Ÿ †–ÇŸ9v¦}ŒêE;Åmó1…ËFìmúGMx™{¿4‚;uŒTžµ…E¶@µÎbj´ò’¨ [F¼yzŒ7â*\P€áø&b1œe#QM¹@É·üRÙÅù#IQQLæ ñôOò&OX­Í±”dRßžx¢$\~£ÖÝ'×H´mÕOŒ²]-½=ÿsËB:ç”îÓ™UnJÝDŒ}øk©IUÌUу™W¸K†43Ó›ŒÉ-“U‘7g´7+A¢ªÎ¥ ËÚzéÖ“&q*6ùóÍØjê,Q:Fg‰;£³·ƒ?Ûaöi5#[‰U U`á×d–$Ón4qžf/¤Xh¬^Ï€ì%z^ôá1Uys&qÝíüi*½…<™æ  *;[î„×®»mU$B=¹MX Ù•ƒÁeÔŠ:ÑÎ)¹³ËR¥rÔ<Ö´Bÿ´ó=C×Â&_ç 3édv~^5Ÿvd²ôJ,"6ub­¾zTçKÇf*ðÛhèâÝ”&¨ä†¹Äâ^`3ñ4Cs¨68ÇÞîWI)$,T,£^ŠæöÆ$þ¥R†î A%Ý¡±ŽîJä˜%'L:µŒÒa)bìÁæ5¶´¯í“´ Q¦÷- »O‘8&,˜ë};wó¹²\Ȱ*²` n<ÈÂ/”Bõ9âÞû‘ƒ›d–1ÄØŽPòl‘©[ÏÄmÚfd5¥gÕ5 o¿1”~$4GéDœ?°0ËkÍoèÆJ[ŒÉ܃Qz-DF+¯A;ŠÌÕ9q³2¸ãƒƒ=ƒwYvņ.‹Á ûhÉÛ”:²ZS4v$Vꎸ |î6å91NŒX?¤ð,gDV®:ò½£Ú,²Ýõê”ÉÜ;•1Æ5QԜϧŽý{ÉrE}8Xtçë[”Å£‡çLÀxTòÓ‰€ñɾõÆ‚žî’k41Ì£‰qí×Yè4jOJD³Õ3àÀD‡ó€Ó$Pì¼ÑØ÷ LˆÉfU#JÌžäl£À.Ã:§Y7sZ~S¨b¸×DAfßœ?x3qOˆlÀ¬•8:ÜÉ­±‚íËB ÷rR1‰™˜—BŸæGzKí<Y·fÊZFÁÒŒaëÍ0:PÞ¸üÞå#ukiôê©6ºŸ^J]ª²óÖŽiV¡PGX¢ãêÒdÆ¥4Ý9ú\ôÄ{Bख–CÀhX‘(÷¨õya`\œÕ´8ïerÙGÆjòH àR¢6Ž—ê`0j%kð}¬%×´aâqŠ.A„p†S •çÔ€YQã§ ©[4ý{xØ- >õÙÕův ©Ž†—aÕâp²é§¡>¾xðøO»7¯ß~sñàï;yñà?ð?ÿúþyüûÝ¿\|öx÷Åæ”t?ZƤ£H3¢ŠÚsi\šæ@pRäoè¥~µú ›™z>DbÜ&z]ØE|xü¤ÅJd‡Îì&5˜¤¯:|™fœ]i«µ±„& ‰Þÿï·ír(ªß‚ gQ;jL‹}œ‰Ú„m°¶d°ƒNÊÐàfNC¡ýƘÜð`&j%­Ð}x”´–#J­÷¼Yw-8ý{þTbP8ópãffp®u,.BÀ¯_÷©êí˜\Ðd¥$ÕÙ±šÆ(RÔãºX¢Û×}²—×Ár‰qÒvõFZº1iµÌŸŠÏTšÏ醺±VLrç³è¯X7ŽUûk 8ÔçÇ"˜¡u”¿ß4ÞÅm qŠþ ‘<ų Ñ.^á1sï ÕÔ;lÛ œB3nˆ]@€Üç:®b¨OÒR´rJŸºÒÑ$°*=H ¢N%×¾M'/$¥»óQÅ®ìNå 5Ll­Ë{«éòàF“Z¬6üêÈŠ!ËG9jᨩ]¿ÁjMÈÁ0 Ú‚ÆÐ¼Ø%… —có±bµêÖ()ý4ÿ@ÂKm¯Yuz÷¤=]ò5ʦZç68ú³ÕÇS?b„ !™íZT;Ëx05¯±è¤³ÓjSð¹6Ò¶­–&xRKo)ùpˆÂ’ˆÄJ‡IšÙPù8lè±$Õ×°à/·ÏõYžõ UUˆ?רîÂñÑ úæÓäÁ) c EŸ&F1/Æ1ß–&]3ëÌfÛ¯°¶çèœ40n¢B›1Ÿö OÜ—Bïïí€ñ¤ J6[Y÷HjD©|@Ù!_jbŒíËÚ÷ÓƒJ1/ºº«0™MÕþaœÜ$5z1J炼ºèÓ$+Òw7©L ©ÄnÛê<R½ïlj¦\ͦO“rÖ¸ Á˜Ê yx„Ó ŽÂ¡±nÒXí‘€‡†½D˜ÚÀÕlÔ²ëQi9¢‰.EwªkÐ|šsï%~¥+jÛñ+qŽbÉÿìæY#«©_Ü(I§ÉÆL«Þy1 aS÷vVôÆ,+-ON—ƒ¬ðÖËŒãÿWæ÷ÙF÷i‡1¶ÂYj»U1z§ÉõtE&Nàd}ý¡¼È—fùÑו©v÷ý¬N7RÞýšìºö®¤¢Ú· мÄf×÷å$Ÿ˜´¬@áè ú)vp¸“˜™£´;6º!ôN• (å—(»áÆ †òc8ýHÉ<ÊHöïêpöñ,$³E Û茄E —­Œ±‘-†ñºT…ÿWä™Î}†Œ•4žµ®R)e©ðÿ.,×Q˜Ì‹K€¨—è:œJÚ¬Øæ$<á·Õ¢LöyÅ)ôLT[¥g%!`ø PòrDi,N±Ë޼8…npUœ"©CÏq¼˜”*è1âÑý ®Ò¦Ê®Û`à¯likŽ;LšUX·yÐPŸ9ïP6g‘Ç{7uªø]:6¥\q"æª#¢²‹cËíš¾°À¨~ìU´ÆMìM9‰¥a¯ó 5€&ï&h[šô„9:.‚ÉJ¹  ›æQw–ÓClÓôê±ä/˜ ’nÝ]d“À @’;ÔÙÞ÷;\r ¿„õ{7š|œ2hó3—ÎzÞèRmÒV)‡+äå Õt:m–œ‰okò}õ£G(\ìÒ-åýqí£Ú¼˜ÅnØ»{–_rêÓËh[—ôïھÅp‘ %?æY|aÖ1Ÿ0˜/ˆéíâvbn‡»Áâ&4ùòKz+nчÚm¿Y§ ´nZ:Ï$tÇ™ãSµëKå‰*cmïšúzòj¼KÅd~óÈ#®^¿îDyK-‰³nÛª IØ ô·CÏ¡§ú´¹¥&¥çšìÇ4ÿ°´3C DÆ—«|C‹$[åyqöSD"M¯x“]`Ú3ó-òNÖKòn%µY𕋘”{Þ“c½fßšù‘%B®ô­—‹QÀo»Ðc2¯x×pëd*1Ölê I—ãv¯ÿ*É=Ë`šØ'{ˆÑÛëbÒxç…Kw6i«‹´l k}¯¦Ü©Â—Z¨ÓU)^Êâ%©Ncõý –Æ9w£;%½n'Ž·…¯ÇRYé[<™ó³k¹Í1$L.­3‡$Ó˜þ>œS»úæ©í†S¢¯ÉƒÅ8åjäsÞkr¼5}íQ×ÿ¿¯oae[Ö!è]Bv8+n”¸]XéoWõìÀåçê‚*a}¢BoØßƒ ’/ìÆ,’ bicµk(æú”NàÚ‰VÓØ=ØE3­ÅÆâïvÝ1[³ÞµÌ^é·­5EpZ4ù²»©e{xR·ªw?%’î©@/èI“ôØg(Ÿ²»ý ÅfŠ×n†¹ªcOÌõámi®Šé&“âc!© 2ä”*QÊü~eO`ó“æ$ßã)ÁPìÏ3ñ¾6ìÙ¨̓zǯ—NÍþÓë­0'Ÿ½n,Î å}çìd±šŒ¡ëïé$ÀçÞ(/Ûñf„Ra?‰/p­~2¿ˆ¢Öÿ¾¸øF¥endstream endobj 121 0 obj 5393 endobj 125 0 obj <> stream xœÅ\Y“Çqöóš¡ß0o˜qp]G×ñháeR\ZŠõ°ØwaàÿzgÖ™Y]Õ3 B”V=ÕudåñåÕßíæIìfüOú÷æåÅã?ÛÝÝ›‹y÷øÿ»‹ï.D°KÿܼÜ}tƒ„„'“Ÿ½Ø]}{ß;+wÆé ~¼zyñ·½8,{sXþ~õ_ð†ì £§YÃKW·0ðãÃ¥š¬õ^ì?;ˆÉ{§ýþ?rÿÅáRLZ/Vî¯ê˜OãS¥ÝþÏðTx˜Öî5¬6.­ó“œÝþ÷nÝ?ÁáþO¥IœzÿÕárI´_è€ÿ†RNRÐ=áÃIJiÌþOe{ÿSþ"ÛùÓAÒ5š‰ËršçÖø WÓð®§Å·?GÊLb^öÀˆeû¯ËqF¯”€‘æ†Ýæ •þx¸”tNI~N‡–VÄKá×x™nåRͰ°÷ôrœ˜ÕþÇJ³ï—z‚ΚþùìN{zuvZŒ×ûàÎØü 8\‰Ú¿=8‹‰ý‡x\ô6û7¸Íe±FæuÌlö¯ë’ð' ÕJ¨ýñPv ½„%€ –IÉ¿„ñ6RzÁÝÕÕ¯ùËwð?Ÿá0دÕûê‚åx,©4nRi ÕþçÊ ÏóÀxV«Ôþ¾NS~}…‡…§†qW˨^3nßfTåéRx4²Å§‘b‹4äõ¯¼åÈÆŸ5¤_&™Å“Ü —§¹…i ËÄ{ÁYµÁ{J£—¹ìÑ h ¾h¹5’Ç/:ñÌ¢lfþËárþðJf‘…‘q®ù¢ÌA.WG&‡06Sæ±aø«:×m¢ˆôTˆ>:äé>‡#’è2ÒèR(˜v–‘T(ÆäÿŠ·ä@v#7¾nï%…°" å›,w‘x³ÐôVÞIe½Y_NUW{‰òaŒ5eL?¥¥¢Vp;;ÒF¢RX–Éí®þxqõ zÈê_P° t’0‹€{ƒ}ŽL»€¼y¼@ SHP/ÊÐàõEïÔBŽtÖ è‚œ f?'²&.»{ݵReŸEE”`GQ¶d¦v#I6v˜×JªD‘I™Àêâkät(G^a=]Œ-®RUx$&Àž)? ê6“"(ÜÅ»HÂë÷Á|èJÏeEÉÁ  öµ z2Û©Êj—Àøðn¾]Ô”‰q4¨à–¡úÆ!šQdåûîÜ„7õlÔ>€ÏÂÕ[ÃzÀý}¨’– ÀË€ ¦ U(óÂ!‘O—wÃ4a;å+:ÓU„Þw‡ÎŽ9W‘DÒßEi€ vÅkà†Œ¬p¨l`h¤}Ƕãöôâ(åeaË ?”Œ 4߆6D Žõt2žÙƒR¿­óWúw0#ŒW•—Óf­0õYÄ;zVu™Èéñ˜Y|œƒ ÌÀI˜A²&är1ƒG± ¹QÉ%èÎ1ÐE¶FŒÛ@`¾Ö a åGKÑÈ#·uÄ +ý¿ôUu8žÖùf2*®c®ã®ðö²‡ `Jÿ ÷H¡ÕÏé5ÚÖÞ2ã.…më¶Õ—¤g‰³çi>³¶Ä³ë€ëV~![©|I¸)ûvTMW®ªÚƒîÄm‚J²¾9PŒÄAèDgÓýMR¼Xɶ¿$Ù4á˜íƒÊþUJ*6Ã?½ºøòâ»Ç-¤’à’ÝÎYXÅíÀgŸñß›—=¹xüäóÝßÿøìâñ_vââñgø_}ñ1üóä“Ý¿]|úd÷å“V¨ÚÜ,v:P;f®¶¼ýt¡Ãm ¯™þ¾…4 Ù¶·]:Ô}9MÒÉ̾·òòJܲr¹­€õmLÁÉ³Ò èÐ¥<ÁоChH<Á±ØÃ§'Ùÿ >j„UèÅHQÜQŠòû?rÒZ1s F]žw̾gs0@{“ÌPZ“k5¥•߯“jÄ»¸xüâAá fjïØìç€Ú Õ¢þPDé2\i¶¬…®-¥P¡ü#N›¶Õ-õDÏ4zYÅH܊ͯÑ€([3ÖÛéõj1|Xqh.ÓKGÊ,%ì1Z+s :c‹o±±˜½  B4&Ÿ1©!z¹”DüW£Ÿ¯7FÖ(¿¢ôhb“ƒXGIý(‚SYrÒÓ4dˆXhýú#eõXäe KèÈôE-ižw’3&vå&áMñ:TÍÅ’ÑMúˆ,ÅYݪµ·š‚Ü8Õ,Æ›­Ó„O bjürP[B’ùûI‡ OI5ˆeÊqÑa7ÂbÄAÏ-Ňa‰•+çCªâÜ{éUUfÈm|cR hhR W®ý <£ò„;×WÀõz?dÕšÕ\¤Õñ¼BÄל²ƒ$[ö ŠŠpR±UQ‘]m=We¨ÇcÛõv¯g¶xÏLÛñlPQx´œ¦ñºÓV0J¹%D_8G3S9¿k…>lJ×"i8ë¥G»«Fý¢—lc¨¹V(ÜÈŠ„›Ø£œÒÚp^^î@x˜²ökº…ÊÒQ Z»àÒÎI¢Ù1ŠWÐz­J2xNÓ3è™1º¢Î¬‚Öå%Â1 jËé¶ÉßÕß«E!A³hVüdMqÙ»ey[ž oR±•«©×!Íó%žÇ ¡ElU}’è02ù]<ö,y#Vh/­ T¼§ç:»N ÐOMáÕ–,e2 ¶‰ê¬Ê¨Íª¤×eÔÈØMupªÍF>…•äòv@{r˜2×ÝçÂÓf¢ :«ÙÚD'ݺ›w%o×Ðj¢ VH¼™/—ä€ÛÐ :°ŽœQg +5l"Ç$XÀm²#W„#À™~^ysÀßÖ$È D¥-µ>ɤbd¦î½AÀ4SWh¸¤©¹ˆéÀC€˜Î±2¬«À9F+WŠC±:JÙ$­Ã psε‘s20#g!Uzv{TžW'¼Ž}:p”&1²£06Yü¶5¤5Í‘0±hø+¥tˆÚïi“ ã¼£WJë "‚7C„VòUVÉ)jP7ê@¢s9…¹J´[–¬Íå茜"žÓ˜X&^Zõxl׋'–תˉ¼OFµâ{`D0½²TªãxDÍ`6ä”CLÞíŠzð7A¥ëžqêŨ ôᘎDЈ'âJ”¸K’ä˜1y|ˆEëFè¦o;¼÷®uDAn-)+7`¬rYyJ³­:Y§`Ÿƒ·*)Òw*çõ»Ñ kl4¤©Úöñ`²ÂµI?Ú÷èZ€ÊFÞI‹%i± [c^ÂëÀ±ÖÎ-5j™UºrwØ-m$K¿¢Xò@ÖO°7Lhü xÇÍAó!‘exʺ·ÀÀÛjŽ S*dÊç¥I¬ì'dƒs[<¦±>n¨*Ò’9¾ÎùÍ!¿3è2“Ê—f?ÒP–ýå¿‚åW€ÌÇ K®›]8q*Ž;zåµ7«©üºu'²ñ@VÕ¢¦8Õ¢µR¯ƒ¾¬ìB×¾¬aê…ëuë‚Ó%tI`÷2ˆG:~]¦îY¨úÊ›¢Üka5ÞŒ-j¶lœ9A!Br² ƒ%3§~‚§ ‘ªÎ ÿÜèC OI1õ…#Z~U&ݤ_-ÿ»û\`ñ‡÷û² ¹V1¶$¨!)ôXG–Œ ÇN›[8ǨA^´ÀL>ç–´ 9ôULD#éyv­uâ’¿ öÒ,õ·E°KO»A‰A8Ø8ЕŽG=êõ' Hp£6ÄÍæN£×Q,š{ w\>YØ´pqGnÎh™þ6õÏIO;¼èmXî[k‹B$мCq3ùÏQͯÿDb%Ù-%\wáQønCE'\\®Cß`€,}¬gBZ–Nu¿4Rµ+N–²ü8zª¼øcmi¬"«Äјk@âç´q¢dŒ«K`ÞÛW´³„ÜßÎ9¿DñÙ[" ÃÌ*h†ýÇ3„‰}RßdÆ×:öË=° $œW³ùÀD…vÈ>©_;ù:–^TŸƒÝ!Õ†£ðBÂëê˜òZdásÃÜ6GýªÏÔâÕå說îV"„\\Óôr¬QÔ&N¹øM²[2Š4s`”MÀF!D¡DŠ Q¦Ã¼—Àí<öò.ûÅ^=÷º¶ÃŽQS+‰%uÏŨP¨è6 Göñ¬+«ûPܳݺp.œ =r6tÇ$F‚pçDo ä¦ÐjÓ&˜‰ÉÚψ+|,gþ‰œ¹®ÖKgÔ°p E‚rÓÀû^RΌ֖Ĉ»kÚ«gIÚ¤§ç6©q7ØVY>mQâ œÐútfHh~¢Ï~Y‘‹ãqÂ7'MFˆkÆH€}ǯ á™ÊWîF;Ã…©Æß¨yÙh)àÓéãAËtrR_Œ\™.P«¾Å( TSÌ kHkdcÕNËs¹cJFŸ3í¨'[5|›,H8âv~O²ˆè*P2®?ÇñÅ׉j ÖfÙóXîD‡fŠS¬¶rÖ4ñ˜"«Ã‡ŒÎe¿âEºÆƒ¾ªQ zÚ Ã\‹tl ÚÔo½ª?çOI¾ãEƒ­>\tÆ—ðóR4<޶Y¾ÃW€BÑ(š&ëB´±ÿ §]³LlÚ®¬(Fž…%H`ÐYÙ&d*éós8KóŒï–„\Ú\rQQnÖáÈž‘l×£< ©¨«o?J÷&›¬Vn gQÞØÜkv[_c}e…”w÷¬×}%áŠ4L;âm9Ìëh¼Œx¥Ö⥞—ˆŠ% ¬€‰€¢§ õœ–iüƒDQ®Ý îHå.Ñ1°• ³ƒ=”û%Ö¶ä"i ×)üèex5ï²,mz¸‰V×¢ â,ÚUW9µ‰ñà¥c8ÌÇjÄ\Ê5û*»´Åã*–×C:A÷‘Ú9ðãgB¨ð笓5ÍwRa`Rùø25?9¿úŽØS¼o&S“BDÝ,šÞ8‚AÈ\£Þx e£»vº§(ƒ§Gåg"°udù9¢D«-lŸj¯ Å3¢·¼èŽD~yqá\ÿЕµ4Ÿ%ñ’vÂá€QûE¬Ù4ì&äk²_Dt‚•¯“ Z7‰æúp­³ÖM”ö@-~]J];¹ÌžÌE°}™íK yÞÊç<{vŒÜHù¹ññ–À¸Êÿ3%.$®=•Œng­¿È$é}”+7ˆ¢Ù±`!Ù/Í-&Å´‰‚^Ëj¿ámAÓ$1n°ÈØœLÕ´ñaÁ¾ A“ßÀI0þŒæ ”I½m Úš;¨zhÙ–Ri阥 A€^ð«”÷Í¿•ÅÞ…Írñ4x¿'‡þ¬.$¹œ-GZžïRýËäèu)æ“n GôGí“òAŽ//þB¾ ­endstream endobj 126 0 obj 5544 endobj 130 0 obj <> stream xœÕ\YoÇ~WŒü¾Ù5¼“¾y°ã3p.YqœØBñ’l^–¨Xþ÷©ª¾ªgz–KK"—³==Ýu×WÕóý‘˜ä‘Àÿóï“«G¿yì.^>GŸÀ¿‹Gß?’4à(ÿ:¹:úà Ò®LQDyôäüQº[yuä‚™¤:zrõèëÙÚÍ´U“÷^o,ý±ó!NJ„ÍÛŒ1Ñnþ¶U›¶fÒZZ·y¼Õ fÐnóçíNOJ)çhÈüÓ)ôæ³íNN!D¸ùOðÍGð–“q›·R ¿y.ÿq«'猳|üçÛÊG)<Þ wmhIZâ´„Ûåc0‘æÿ¿pÿp«=ÜIC¢€5Áv•°ºü‰Kô1ÊÍ?ê iOȳ^±ýÿëÉ€ @3FP2‰4}r t”@:¿ÍÑR§pÜ.Üi1yco€æÂa€àzRªäßÁo?IƒV0ƒ‚µ½jŸ¶/¶;1Y§ 0á†æ²°a6ö.Zød7Ïë®Û×g@¯'­0$„I†`7Ç0R÷åæj+&ç…‰1ß.ŒÙ\Ò'Ë{^?á'¾„ ÐèܦÉ”ÎlNñaò„”0Þä'á[o»ýn ¼ŽDñGÜ®ÔÊë°¹…™ì„Pùé |/aJ£`Ò!«40éóGOÞýšÉÛ10ìz Ô¶NZœß ’švsކÉX\—±tJnž5u8Ãï%¬×â¾áƒõ°…Wi€9UƧPoLT45Ô¦~^4ðš?ÃÀ'©> ‘›“zçºBò:ç¡I  ˆm7™ºÍÎq$>5ÒÆÙuôeùP¯¤(mpV©ì懦>Œõ–Ô=Ð#MßJIšz:ø `%={ ’*F¸ni{Œuq•Qz¸Ï»-ò_+„-ª9â›)‹ò2E/l¦üå¦à•K‚OóÑ‘àPh¼4H{'/|¢gí g¸1AÄé“Ì8%"Ÿ`JÈE&¢5³õ•m¸ç]ÞôŒ«uB¥½ß¦1åÁY­ \ ‚bÂÖ„²]c"üͦ~Ÿ—¼Ù|³Eí …Ë2ÞaîàY{4=õÎqÉh›Ä¹ÀÈd&(^£g‚v&²… ÚÙ,8‘׺g>çBtœÃø#4ïzÚ¸8ÖdÔž·®ÉùÁ`~AKÙ@¼æ íbtóHyNꄉNÈsGí‘hw Ýš;#H‹´Ç-Ý©U\Ѽ"†LrïpL–³!U6›¸÷ErEÍ ß̪°§gâƒÉpH¹À9„ß´©›^]·9ÊÚH“2)I“l ‰¢×½&õ¦W+K΀iGÓž^]ðXë=Ü5Hµö›_—kß&+m"^ƒI=}Í¥"?¡ÝrÞniÚsÛ8ù³_\ºGå¹H‹Á~KUÍÆl¸eæ?°— §q³…U1çÀ”é·yLòÌ&ôAÔtLÁ‘®Vë5¬_‰Í~Áõ5òU~ ØáL•9ɱ?]Ür‚£ŸácüB7 ˆƒÒŸ'e.b}»yHt¶nŠÁ#7Ë=XA¬q!]|Ù.>¯/F#Ïê'Tg!x2´§tñÇvÏ¿§\$ÆÐUÜ9n÷ùb»/ëvoúíÞ%ß„cˆ€×ÝÎë¢5à‹|OO„ÏÚ€wëEµo™ß.–yït{¸KÇçfæ˜ö°÷ʶÌF³«ŸŽØt—ù <»x}.F¥ûýƒ€‚EQE@¿[â²2‹èqQ$ÃŽ¾ç.À£òý¤eÊÒ0¤²«ß›Ÿ•¹8[PùE•+ÒûËFeºøÜz׿[†K}Þ.׋—áÒës~±Œl³ß3g³I"huéÂ͈Æý ·xlö©íù¨x^-óë^¡1ð ùHÎcN†íâÕ mÀ9Ñ^Þ&A‰I"<¨2ÎçáD=]õ´ªù+üñ”oS§#éÎmuQgÅw-v9tFL9ƒeªt¶"ÉÉÚø·Jøüi×¾~ È'G{/ Â>\ü\Xp>ºýõˆ/§#Êfÿ¿Ò§ûŒ~Ä0wÆÍü¹°ódó;¯Š]ïÙIVªDK£Æ89XãíH]ašb½l‚Óèzž \ÄãzñÝv»É†öñŸ3.ëEžñg®KþÕÏEòOFrr5"qÛîY§#ƒ(æ̘ð?dÌåž°ð¢¸Ö4ÏIï~y„üùv!/öò“¤ÄFŸ²»…× ÓÝ9<»ãY Ò%ãþ;dÐ7šPÐLD[Z&Ŭ(0ˆ¤}}ÌÓÔ9°‚0ÔEºu<å­„SÕ‘îK2n³+Ïúx‹ù¯³]9ƒ¡`_ä©tÅÔ ½1eR;ÆÈpÈ@e‚ÞCx1a>l“;å¶ëà(egp;òÔÆ&„…Abý´n<{Dp“6‡ ÷"WÑMf‰]u K»¨ :&“E½ë!de=9ÆhR"ZZ’Ôã1•¡u^¢eÑ$û„+뀥ìÐÊ;˜¼!´ôŠÏ–a/¤¬K0~Ɖð¹‹]ˆŠ¶­8‘Õêq*¢Zø2Ú'ÙRÞ"æÃÑÚ“‡)‰½´*‡èn\W/OmõBVHü}S¬ÿQ©ï£$rQ÷°ÿ)>-Ò7i6¤Á?‘¨ZšWSMR‚ıš$ʼ“T-È„T>ÕXp¹:,låÕ• !Zã¤\_"›s¹F¬ÌÐE4–¯ñº™—ïð{`dÍõú‡TÝÙ4ée‚RŠË iòPÙ,pZ^-‹ÈX)mÓØ½¦+á¼I/9àÚ˜'eŠ2vs´U¤ŠFÚhÈÕû"²‹¨³¶i”gæø+X…°”»þÆÆHÂ`©¸sØp(V² °5J.÷L *¯•ì -SÍJtU»Xµ€™5&HèR£'ÍÉ{DSÉdêc´õ,-žÇ¸šUÁLµM ëÂxK‚±šo±â¼M•:è·.…å\C»Ž[‹Êb!÷X¼Œ—ofH4„6ttûi^½ö…&¡#)ª‹`"Ì@|Vh‚{ÑÔ•ýÿFT€@7-1"—h–¢=«ó&‰ò'ªaR€´éÞÂg::±0E¸Õ¹Goƒiš¶›*°?›'×’–HåFÀGc)>l~C“l µù¶Šø…å6tY˜Æ‡cÉõãm”@3«×Cv1oWbœd5¯Ù˜ˆ-kÙC¡D6Zµ§æwÛXÃB©Å¢ÅØHƒ±2’溧ûsû…Óª³ô¬>=œê³O›Ø÷aªˆ&3sˆ5&ú{ýæ%oðQTò×árí_‘ð›T§êk†I¨Óæ{¡füO­HÏÝç']Ë ]ïSц‘ d@–q°¶LÁ(À`3Í!`` F£ d>eŒ sÚIdê 8K/—Í3(w³pcÑýˆ`%BAÛºÑ6ÃÍvÞÜ´ñGzœ_Ó-†Çdšôž#½Æóøµà®æ±³®¼aàè©¿‚'M°ï‘–¦9fþgbÀdA‚(×—HmÚ å³ÝB„œQù7‹£‡)`B1j( 7âª:À ‘rÈä1¸»HÈeö¸ÈEkm³O¿Û÷Sî²C)/b¿hèÂŽ­Œ5]',a°_n¥”TAµÿ þýÆ~Yš HBŠiËfÍý·½õ Öåºô\'xBR\BL9}‚Se á}Èr EPž¨ž‹ëQn††2cs>,],Ð8"jO|ͧYÓ3ËYª›©@A/¶æc½RBæ,í;ÒBÕŸ™G« +³St +»¥*kx¨|ÃT_u¡åu†‰u˜£#tòÀw2Þƒâóž÷"ñ·M˜x×:??éwdHÒ;áU+R´Íüè ]~8E‹tª‚.•‹óBnS?¼ì|ê ÀþX *S…ªxS“¨~-Ã,Õ–7öÈ H"5ácOBÐ}<ÄÁ,Œ»´¤’P‹CXÔà:’ûëùƒÃ']°3`@±RË0ƒøjßC~Éi ÷/Š1æçÈ.b»ò\U`T DHÇŽ&$+E4<.õG™)Õ ¹þPüÙG·‹Zw _ë2~ÙFJÕaYã"|M4[ÓìºÑ¶4¼¶p‰W§Û|c:•£© žA…]ÙâÓUH£Ó¥Q›xräÈúûБ´[ó2ÏýX1²xˆñÐjt3 ¤Ð½ðÖf%ä*¢’ عVwNCõ° RHH—…‰<ˆpS´±h ÃáÙcfÌÙƒë¤è&l-)ËÀEFï‡((«é´ïÇ+×¼êçˬkÑV“ƒ©\KŽ#Sb—ò ¤Æòˆ^ù©ÖÓŠF³°ivÆ•‹(wÆ,zYúí•i¹1#3OœŒóä.VÀÞ¶…ÍÃÅʧHrßK¸¡ï×M Ö"IÀ˜'к1z33Á³s³ˆù4M„ÔØSQM’_¥~YX]ŘÔ1¡DoT.Ìêž-h,dhŽ)Ÿã&4Å[ ½íÉœÁèü^õ,¤ë½6A–ÿø6Ð9 mê&Ԓд9õ§ÎçÎ`vÏÞ“£ã];/;zAŽk/Èù ß!c• &½«Æ}:’Þ7sYïjï¿9¡øÃkÇ_ŠsW`9•_LÒNÝÞõ%4íÅ4äjm@ [OˆJ­¿™&½_GcÕܳFÄ6½¨G¢Xt¨J‡Q’«ÓËlò»}´¢ƒåÅ6ì¥;i¬ µììïÍj˜_Š ‹Î (–p>ÞÅ œoì8ÿ¯¹Ip¾ËlÝ›½9"¡ÒvS—V냳Àz#¾q¯ [d† ðÈ™MpìžèÆì©?tµ‡ ű-Ÿ½ÄaÖôcÌ„o‚Y9ôQÒÏ_âð">µtk”F¤š(ÑÅYϺRÉÊô°ncÉf½ó=溈J‹Ôú\9S±OÆjÔŸ¼#YYˆEÁ˜á®ÃW oEàÁ:­›qÒ{¨ö¼J‡j鑎^b|ý:4_}1 Ö{Û[°–o‰IO7³€`¤Q¬¤3ýhߎhÄÔs?›©Ë`Y`‹ÑëìmP¥wà¾UwÁfR09ùÙŠ‹~;÷àðý(mã0da°S\În[ñ¤Á†}—:uX{ÜdŽæ÷¢0L5»XíËÛfí»¬ ë«¸jy-cyÀ¨–Ü2”Ée‡Ô^ ÷Š%÷"Ü#–RW$˜¬cd7¹êqX Jƒgjê7Y• Ü=1w›ðŸž5Ôÿ¡ð·úÆQ»gjO°¹Û¥s8W ʼnbroL$Dª/®ÌE“|BÌkê¼H¯Ù׳ùWhÜ#~/vàå°1ŒéÁòpœ †_úçYoäV;ÊRk‘ìŒvàfH‰´Ú 9Ä‘Vi`r”f¯ëŒ‹‡è ÇòËÅF…6ÌØ½ã9ÉR“üˆK‡.ªËžß´©u1ìaž•‚U¾ ( _Ñì:Ai$·z-nþ'eôê9RJ3g Q¹»íæ²ö…ÃýÆj«|®2wÆ&/ô{¦ÌLinº°iV’# kïßëN&=ks°ÒXm°_K…‡5Š1WCï-F‚}ôäÑ_áÿÿYVendstream endobj 131 0 obj 5357 endobj 135 0 obj <> stream xœÅ\Y“·‘öóØ?bÞ¶Ûv 7êÁ¢DÙtH–DŽí[±äðÂäŒ.šÖ¿w&ÎLPÝ=C{¥Ø¬BáHäñå|9OârÆÓŸ×o/ÚËÝ—ûƒ˜´6Nî®j›Gñ©Ò~÷žŠºu; £MûƒóË$g¿ûtÍu»ÇØÜÃ?*uâ¥Ð»§ûƒNôbhƒ/ ”“tNøp’RZ»ûS™Þ_Ê/2?í%£é¸ô!§y60ÆSM÷"¬¿þ);‰Ùì~+f»?—/b‹RZjèf›'€Túl´vI^§EK'â¦ðm<¤]9¨^–¸9ßÄoŒ»—û0YòûE¥`}ñÌ_›IiµûÇ^IÜúÝÏûÃÈàÜîý^ÂVIcv·Ð|¨'¥ô"±c¥í¤íîŸ{£'g¥¾Ù‡þÔî9ÐËhšÜÔ7µ—W@”ðÐå‘`˜¢„æÒÁ·3ëò-6·ÖY&.•ÎÓsÂî¾ÍÓ¸NcCÃS&š»ú'&'ïßW&û¦×ôG€ÇVPúÔ÷Í6”™2¼Ž“œA$òâq€—Þï‘ Ô °"‹"¦ôö0¢÷N©cô¨°Éà„Osž&Tø¶4ÌëU> jæ%S&~v[ᆱOÓœ¥õ¤+²‹Ï*{a›Ÿ±“eœ¼À%mží•ñKæXå‹ä:dz„‚?gÉ–9XCrÏá§2ñßq´ç•n…I`Q œ@ •åvÀFiYÞYº¨÷¬›`–Ioy<U 5EÃ-Ðôª¾OÚÀζÑTWª¥Ïs•È´É´~D2ˆÉ?ñ0é)Òí.kÿRGƒJ_ˆò…¸û>´V…Ûòèêâ«‹ï/< ¶fãáouiAÀ§Ù£y{øøâÁãÏ/úáÝË‹½þ€ÿ{øåÇðÇãO.qñèñåWgš=X7°Â¥UËäu4}_ nƒÅÚ¾x‚LåÁjé«¡ú Ķñ{/Ýî¯H ÛAxûÒDM “‡b¢AŒPe_gy» Ú1«»6ºyt k§å-h ¦È ªˆ3×û¾>h‚ UÒ$a*³ø(TÕlü+™ !‘‘—_/)0h¦h0+5{PÆÃ°–2:±"(¯÷µ¡Y_a¿TIuúÕQž±9aëÊëßÕ‡ì=|é'ЬƒKÉ3}Á6‹((ìVy˜ÙL”ƒ:€¢„ À%¢¿ë(%bär?Ä=€yn{š@3´ 'L5"`~™íPv›q‰mÆÝ#j¦ŠKìáÃÂxôrÈ‘qeË‘1o÷¦.1õhQÿ¼+è‰Z²[nOúb ؈÷'Ö­Äcö1 ›lQ 7EÏ+^ë™kbó쬫1´„™Ç–*‹±Þ#t¥Ö:û&c÷Ñ„Ùýaq´fehìßuø’!.üÖ T—œƒŽ°{e¦ÅÎ`o‘8ti Õß72>°ðJš@­Óf…»+hýâ"± ¢]“âˆô)ÔÄöEAX}Ê,µsœÊ<­ÄdI‘ÌÀd7 gÐ&pÔTCÁie„oéÖ‹D×訤‹³èÿœ®NâÔ¢ƒOÆT¸ y1Fq‰hЛà¿(#ÃäžG°ñ–šM”ž¼ü[Q<e£YÑhÔ%×´`æÅ"GS=‘ªÁIVÇd3ª_ð1õ¦@tdýî\ПG«¤=²±¦þja¦Ž*l€‚lA3ë³nеÖ+­¼=ì1m³qêA¡ª{¯)^ÉÔâ€åtø.˜ k3Šäã®ø «½«bDZ®x!¥{hyád=TÚ ÛGœØÒòMýU(lL#0¨Á1HæÃÎKh<¸Êèõgmd%?‚Ã5Âd“>{„×4ü/F[ §žF½€¢ôY†¾¬€ÿ&QœªžV$ó$È¢Ê( Oô_¢™W r ßº¢ kPî=d‰ Àã€nŒ˜‰´RSÈ@çÑ‘éxðÄ_ DV†S"Ð\%ígé¤1¼åôŒP5!9èæüõÉÃQ e¨;Õ$P†ô¡eû[Áà°‰Oqõ€KÀº[㨓ބî#âÊÝÔo^ÇyhÛ Ž)ØÔÏ.®~ýwðÈ4îìj74G¢¦ï +±‘(¦ÙÒóvp ýt[)ëk6✔ b¸4HÃ(³ÎÒ P–éb`h¤ÁH®tÀ¬†ÂžÞ*Òrfs^Qõü3’ ¡"ŵØóèH,G †ç´ ›_Ö.t6‡àS ‹mÅn@®qñÌÓîšAbjˆú-:븄±ÉnXáLS›·¥ëi¼!¿"oˆFESs—¨Á=¤ <YŒa‹º˜ƒT$´rŠÑäDŒü]¹“ÁÅÁPån²‰øø9ÅŽOä89òá>+S’" Ù€J@‡ÄkaÿuA' DìlíùoÈS<*¾-8ÿ.ÄàdPõ_ïŠ5,K,Òj¢a¯1¥@¦ˆ&h™a"zcŠW‘ù:Ï#ÍÕÙ…fÂ\çE²ÌÆMõY¿Þ#E@ñJÅ™™€¶µ9ƒ^B ðXåà-uaRúÀ¹Öí®ÝFÞ ‹á@- RÍcý–]] #™…cu£Ãv؉$<‚à l«¡Høi­v±)d“KíŒ ‘h¬à8@ý±Žþ‘ì'ºù&Ö’ãJ’¡£|âgà¸s(B5Û¶Š„—Öë‹­£_3Ov.ŠœB®ì‚Ý'Ì͘7ƒPªÉoÓLņG“ÜÒûHNz¡ cAiô3"9pB:Võ,Ø¢äÏD*qÿ¾æ 6=ÃAÕUn#uÀ³WiOq•6“W —àæštDª!ᣠÂhüEyTLÞç!rC˜Ox¾Ä6>¤`~?Õ~‚:Í >E €jôǧ‡WõáÓ܃Ä÷Ïêû7tNùáËò`žä¯ë–OëW—‡Õ‡Ÿ•‡jO¿Ÿr&½ü­~ð¨<|R~‘v¾”ø6R>œ˜°B/­ñj‰‚:¦«rI°O²8G0:ØH¯ut±º‡@R¥¥Z¸ç.ôÝ|Á»XÖgÙKA'¯ô¹6þÄ ‚Eá5ôlW\rÀ®¿:®IÃør˜i*R"o.YEÞDJè^𠔈I|ÕF+½ÅÙ‰É:žC*@›»À%d  @:óˆ<Ô™iÁa?ÜYS»Ì,f#U¶C¥MQ%4A8“ø`T!‹Y)Zsa]…Ý„~û]•8’Æ §s+ÐvÚ t‘lÚ×?ðH97ã#á7%­‚®Èí~@˜=^ÄH Ș/°à´B“´¦†¨k"†–Pš°! \rDÝ”ëȤd¼£òÇY†uZ9&‚ìÌ0IÝcÛU ,½ˆ)€D/Ž£‰h8ïf•¨Q’¤šR”„ú˜¶;h!¥=g6i­®=ú û°-NÉβR­Á¾Ià~çÚ Øï! Ž1AƒÝ\p—³®z~›Šæ¥Ûqý5ìäGr"­SYPâÒo“ü’­í渷s$>±Î´€I@]Ï! ÈÇ–ÖQu¿2~©`AEÛǤ9ìv¯‚(«ƒè‘ò‡—±6£êÁ¶§%‘bç†P½¥"õ:v´¯„{ 0¿Ö²ñ|A7„˜†µk›þªš’afA‹jÜQÄF-†ˆq´³ýQ%d(º"¡Züfð:”‡’,qJìÖéÜÆ9 ÌÞrþRF%C$Ô{¿Ä¿úÉ=Z]59YdŽ›¬aÚ7ÞÑnÜZes9 ˜z5âÕ²ç:’ \ KqY¶P2‚šã~-11€ 1VÊË0~®g x*Ôĺc’oWÄE.;cɆQ'c¤q…Dc0‘x*Ä;Çb‘@ï õÌqšE@ÌtÅ·Hþ˜Û?9Ãá—@!è% ;áÛ&ϱÌÓ|è\Ç"ƒåØÌuÀjfR0ŸqÊb™ÃN|€”…× {˜ÂÞÌY€åÀÕdØ{heÖÖΜµnŸšûÕV'¸Taÿ™im2‰V›µ‚aÄÙY%JþѬsë`­ºrêfÅçη¶´I5x£»(8J´ÙíYÑÿÏç:r-PÑž^+÷’€BÒ5†I}vð6…'ØÏ(@áâs]þtªäçeLȵ šN@uL„«6uH:£§¡N~Ô£rs'“JŽåÇgYN&¸».ŽPw‹Éìûë”rùÂBÄ"õJ¹Œ˜,-%ú¦j«ÂRbAÕ”ýfÕÞç4ê-9ÇŠ­ðÿ\Òômi}S² ±ü0Ô‰ùî[ÂuØßµðŠuó`ßJ°ô°[ÎU6 Òñr.Ìâ4þJº¿GIW>ŸpVYÖ6/Ë ¦AÞ±ŸÍ‚é;Öuå¨~ qkËãÅ"“íº. ¦ö¤¬+,§fmpÍÝwUW£ê®LSžZ—4{z¬šë¾ç&NªæŠà›^¾@ –1¥Jgtx•ó³œ5ÇÝR²+?Vè¶>â»O‹Ä3Q<ŸvZ¡XcöSH R‹ÄK µTñ~Ÿ¡õ½‰¤¨ù!R…ìm-‹J8#¥Í:®r¢Èë˜=•¤ˆÔ´±Bg =N:†È$¤'¤9ÖÈ\¾›ÜR~±“\â/ pD™­¤\ø›¼“G΋³¨oÂÞ£ô= ¥ËéŸpoMÈ1ÙL7uš;ËùØðî@ôõâ£=¹™](ˆÅÊ©•e¿oóÑÁ[ñxÁ’£ÇéqE~„1Ö˜ävRžµr»¿ì1Ï j¯{€1}#WÂCA{øØÑOnjÃp°ÂON»4¶!|Q;‚÷ 8DÄ+¬}O«Æ—+é]Z1Ȱb8×.»Ïq“ŒÂˆBœUXè`é½vé§Œ åÔeß‹ÉÍ>“gÕ#ÝõÏK;I˜’PVh¹}j“ðO'&8ô‰˜òýpµV¸Š[–pæåDëPÍd¶*êÞqùÊ7÷¹%ÏÚvþÆAûõ¶.:Â6ÖÖˆ‹“€K3«• ßyZHQÕ$)ëÍ3Ò'†X€•ba±Ý›^®ÑùB£ñMDò‹kpXKs9¬h—~dzÕ%ÀâdŒÚmhŠ]NB™Xd";ž2TåM:|Fez ¤N’:£)³÷²EÄÓŸökð4(Þ2 ãèàTÜ÷¶3A"hÓ–±÷¼•ŽDö*ÖÒ5<ý»*ÈG…Wx&ßõççí* æÌ«ó‰Í]z]½Ç²X«“ÒõáM÷LɱZù2ÉÊnè㨣õ¼<Pnöó3p˜B˜µÏv!‘ºeí=u½i ˆßœî*p¥ô!T²Iv¯ë,ñ’¡ùM(«j¢N1l?¼xßKUϾ0fÿ-+P;È”±zÁç˜ %ï\’kt]­#Ê7³Á/ŸêØš6 H1oÜd™&L]" ùž°æ›noÜ2àŒ5+TOD›©D¹':†Bin…J´"×B A–T1®¼ t"¬Z_IY(4ø] Öâð|¥—³iàGêXº®Äœ4ñ·¥‰Ç5²3«Ã¶þßVaöÈYÞLQoÒø`îÏ–Üú’#\nH<íî¼ÞER­¯-}´e̦DÛMÖx% ‚¨¡‘z•ø=m‘qCØå8÷2Dižç€°°AüZ0–î%ùiœ°VÁ(m”ã³ÓU‘ÜòК4imÂTÐv¦ŒÛ¿z®ºÑ(l—dã&™…_v€Ë±†ÄêÆõ¨Ì¬É%ZâÞ)r"“6žöO‹û ºY]H“—8LEI žäi(+÷Ÿt3nŸÞ¸j!’´)WËäiMÞPœ¥G3$FRÚëPÕŠ%¹Áø™aé‘"q¬ Æ|™í•™kŸ0ã0b‰6B`1ª±ê¬> stream xœ­]ë“$Åqÿ~VøoØoÌ8n[]ïî B–¬åpGp·{Z0Üîa8àäÞ™õ̬Îꙹ%„æfº««³òñËç~5OêjÆÿåÿ¿}ýì·Ÿ‡«ûžÍWŸÀ÷Ͼ¦âWùÿn__}xßL뼪«›¿?Kw«« ¯üb'¥¯n^?û¯ƒ=ºÃtÔSÁÖøë°¬“ž—ÃߎJ©i]ÜáwG}øüx=OË:‡Ùþp¼VÓ²¬kúéãŒQÎþt¼Ö‡ßã¯ÖZ¸>øAÍ~pAþ ·}¿µÚåps¼†‹Vöð)|4 <ÕÃÒðôu±+{6ýü»ã:O³ÒËá?ñ¶ušaÛöaµ àgãŵúª¼íUÍ÷S'ßÞ´kqA½Àâž^ðç¶»ôÒÚ/…Ëbà÷²*Ýü€ÞÆÓMÞáôì ¹0­hWN-ôùâxíà£ê¿oþG §GŽ:Í œîÍœ¨‚C„ƒÄ ¯ó/×fFB¯é‚Wðk•Ö‡_”Zk¥Âá›Â?³ Ví»×ðÝä}ð¶|\‚' Ý¥ýYà‡zÏ ØÇpÂËâa©víwå‚w°Rpð|sø9¿š ÝG¹÷ë´º‡„Eß¶‡á^ƒšðÍíÑ„É:çÊåø;îá¡ýóþHöǾ‡WVñ\ÒSƒ1t™Wð»['ç–ÃOGg§àãpíú.oùÅaŽãnÿŽÿ ¸ýñÚùòðÀƒÕÉ¥Œø/òœðFo|Cß^/nAÏñ¿ÇëÂX¸9Ìt*ÚXòˆö]¾/€€V°ÚOÚ*«_u˜®›÷{‹ç¸E 'œ©¾:Ûè‘ÈóÐn$T~Ӿœ%ÓG¯ç5otV”é5üú5_IìéÝíÊFaü×Û*jäê(L™¨× \œŸu¢mæ‡|P~0vg=ˆ&Ïß6>'W>Ð¥ˆÀ ÿý¿‡r—Ÿm¤ík|2õJîÄm2Y1 #€9?Fe<|GÔ9ë/Ú6ÈÁ}À +ºãÖ’dÉ£Ý䲯š«ZV¼šp:W ˆ'´íaøöT« ^|°S[#÷gåhÂêã€dJi 2ƒ™ÃT5îû l aFÂt/ßf’¢‰!$Å_»6ÁzhkTÉxŽO p<~$ù‡D,«×¢‹“|o—|îþélBÚWMwDÙIôŠ¢ãÖ%‘-+g0pˆ ‹6Î]ÖøO‚Ú& #ÜÏñNÉÝîþz‡+ÂBFq¡þ¿_€šŽ ,µ–£ªØ^2 ^ðáR>²ZÁ^• &„ °ò‹âÛ³7Ú4~ì¥ øb"ü¹!£o=aLb3éI®£]Z‘"8íDÎG,@0!;n€3¨No ³%Cm ˆÄ3mùQ’œl‡,lϼ.[4òÂBåµÝ›©i瀄û®þÎ š=Ãﮀ±ÛËdv2͸Ý9SZ€&ã”ŒŽ¨<àÏÁ·úFP `úsT&Yë7u²Q™¥ÞvËlRÄzA>—h ÀBø<á:ä¬ËRMŠCÝ àÝ:í ëÝ2>å«G±ááÓdfΜÅzš=]¹z^WÙÚÜVÜæ·Ò±•XIØ.@VÊ€µw¸šh 3#€¶‘Ì@æÀöÀÆ›=Ë‘Q!12ü[ñꌉ5È'2bóÕÉ\„æâEcÂ6‹ ИЙ°€hÅ»ˆ5Ø¿¸}×+)"ÉÈÂxŒD³ìéh”«{j¡pË ÷ÞfÅ8ôÉÓ¡ØÂ“÷B|ÔqÐì}·1,`œOÁâ„#ûxX-!|Dº3ƒÅبêõ®…¸·m†ÛÎwÀ•}³$†%;’|•ï£~U«Ñ\>¶èªš¡WiEâPš€–ʈHŒµx Šq­ÖEõNMÏ;ë ¤¾i>úM†ÈAÿÍPTûö\;qEï@üAæu¯Ýzp‚ hü‡1G®c4cÇ& Lt_ LØ¡çPÕË]v`6Ä.çÅòSˆŽñUn|uVÔd'÷\Vb†DÒ)sŽœF¨ Õ+’ðS®N²CP6L¸2µ¨þÉ…’7¸^ƒâé$ç<³ ^ŸgìZ\"Ó2[£Hè­DÊ:H$*TVÍ6ˆQr£p.‹MH\/|O)F—w¸+á¯Í±qkX¯ËÁç%`ÄÓª'U5cä2£©¯ƒÁŽuѵÁ%[—ÂEåÛG)\ÄçKáe±`:ØÏEØ´ñ,OÄÌмúM’4à¡•㑯xê.P?Kò~’’ð#7HŽv-õû2]u¿³|µËï%£ˆ7siŸOþŠ’ß(IZ"47j™qCE¾h¾ÒÜó¨JD­xTvÝj~ îÈÈ©d[p§ °ÍÕÍŸžÝüËŒnl]’<ð1âöm8&Jy:¡{ I Ìñ¶š$ôÍüƒýj³9%dÙ´q@5*‚‡¡MåÞ Âã  4‹ü¬©â)ú0½Ê±ð¡»…¼ž].vµ À´‡/u¿K† °I[$~†ZFlã‰Rtõ¶Ó7Ž¢=¼vž'TÝùþÒ€&V¼Øª öTH%Dzü5”Ã/È…+@?¶-d ¦‰­Ï@4’ŠË,eBØL Ï4íEƒé‹Š.Ó-G‹Ì/?`i^àIRX!I;l4?j!"ÂìAVÞkÄþÙ`Óx×v¾àÆÙBÁÄçÿ—廆^Kä“Y㑽Gžö$È,]mÁ¢E'Êå]KUˆœ™w‰.Óˆ{ù™m UÌí³ÀEÍ{è­ÅbŽul²Áª ;n3­Öa±ÃÚVƒá÷a "¸dæŠÐpD“$  À}Ù"1ˆý@eƒÇÙ|ϒƺ˜EBm} gìÀ0lŽ ÷OL:¡žq&j?²•÷Ý“èóQÍî/*&%[]ÊcÛyÅJ^å ½k™C<ðTؘ‚Ì]Ôúël-üdb-Jì°‰dŒRI‘Vû7øä½ùEã²OðöeÒ-WޝOXõõŽODƒÓÞ$÷%û¢Öïx`AðZ¸wdfÔ)Þ{Ìõ<™Ü:ð@ÁŠÕ\¸àñ8D>NðQßß Ë€ÓžoÅm5õ9¼zh³†ÈBMg‘ë¼æù q5Máó܈jº1Ô ª“»ÿL‚',;0j¼…-÷<™œgaY$t³<}ìë* Úª"DgÁü´„ÕTÞËHÔgÈ0¯øFðã‹ÐjYÎðãQ¿Ø3Ϫæ¥$³â"ßn0S" ÷¶±­P¥Ó=½ƒ‹ÂqŸ c–ßÄÅÇ®Š­Êþ¦<`€˜”¯`‡l/t)ßåĆv‡¯ÊOí$ëÕDŸó¨mI4ø„ÄŽõBëáÿZ2ð¢E±ÀÔZ™èy9ãóA.9™…ɾ3ÁµÌcÚùNOr´áMÜJ1Ów¢¯&øøåÀô¾Ý,–у~‹úÉõÎFW†—fÖ}\ }O……ý4UHG»Ên2¾‘”âU?©,ôñ£âÑ™•¦.Èsºzî®( èn_ƒ¤÷É[źû»Þ°6Š6E³kÉstbÒxÙô&{&gÙúKƒ¡±L  Ñ·õ¾¶‰ ÕJ¶P"_ð= ÛÈcUû>&ú² €tT]B1ªGêxJ¬G΂.äUÊÊÙ#…ø¤ÒD$7;zò~UŽ-(Ÿµ^Ÿ¶zNàÇ}éúòX/ü€Õ«špxBss ‚5ãFþÚN¨±PÞ ƒÀý¤¼*o¤ [³ÄøÊ6•dB¨ä"õí_qUˆ/h™æÉ‰ º¤p}GCVP{ÆdÄ€o†—>]Ç®'»ÉqäG’Ùæ½SŒW=¯Þ*5éÒþˆdÄ`)~§Rééz*WüëÑ!jåç¹he!‰5)yr»Ý¦©,¸æóºf,âe³6ÞgÑrtJÉP¾ärel!å•eõ-ø‘%PIðºaªe5£zc!EAü†ûbpYÏLœgŽà ¹_$x•óŽÎwš9¶§TJK2ȵ–„DSUµ¬‚ží¾´lk.yŽ€Ö}8Jz©ÎùTG —ı­Í p˜×¾Èß« ‰J;«–¬\ÜÑì«V ×êò÷qe|/ê,""¥ð9‡.ça KUQåšYSK¼R ;¯’ ƒP¬(¿Œ›¡m†SY™—\úμ°¶4±U 49!ÅC‰!SK¡^8@!‰aBÌë]‚k\cÊKžÇÃ9®*EJ¥h4Á~›æŒÐ¥†yc…5Ý"ª‰ºøo²ó²N‚ºËAb׺Úò>? Ø„€$ÒýA¬ÎËV[w–‚Éî\$¬iõ1 Mí<Ÿ 4lŸó±ÊcÁraKñÙó®žéq–!šÞÄDŸÛ6!b‡ùÖùo‰¯¨*‘CçyØH̲L³›r©Ô&zYÜuÒá;ZHÞx/ ˆëö]‰åY¥idUÕmà(d/öÙÅëÔ ]Ð)^D«î^Õ*·V·@^üÂHWÜ4Á¤Ãjki›ö”1 ½z§´¿ †X9*gФâ¶3·MáR£\[‘àÇÌÄ1W%²èD=Ÿ”ØãMp«ÉÑMb:3 °×Kӭؘ€Éèg !Z®M-U¢XL'ÌŠ›RÜþ"}Dõö$ÍTJª/469©pR3åë‚‹åÒö|».Ik)9·~̶ï2•! •€.I>W%üm6Ð`«æ‘¹m­½ÊPh P ¥{¢Ñv¢¯¿šƒ¸¤s¢¼n—˜‘Ú­åéÚ˜vTëÞ´$f›#‘¸»Â¾ p­=ÿÐp0“×µ-9~¡ÍÏ:#dPñœ¥NúÍ<…܈¯ÌL\ÒÍQäq&òÔ¯º«Ô•ðÂUÇ‚Æ2MlM­ÏÃ6ß äDï¿sá°ùûnŒÚ£Á²Žäá/¤AøÝrîZ»quÅ}½èrðÑO ˆ,Ö+2Oœ0h!¤&q±Ú¢ÉMT \ûïÇ4°•Uf×~)-¾­n½à *ïÈä½õ‚_ja²O£÷c¹°P,Ó9G.p)7¨¦'U!ÃÜæT ¢>]3fiªqXŒ"bEZ‹¢±Àqލ —Å:±•ägü^Øû=Ù &J½žãt¥KÄþy6,âjÓPLµN9Û«™ÉÍ’Ú d—&Ûá+åaE…èTgr ›GBòb¥ºn©Þ%Û“HnOGÖ ßŽ£¬ˆ¥a'][xtWXì•×ÇÛeÂÒ?)«ñ£Eï[SÚ%jõë¾SãÔ\­{»¬Ái;&¯õØä˜J*C»|fS&[§RnÏò §×-Íf<Î6*{ÉÅyÈc•†±Ý¼ âVñ®‹éšYbê }‰}Mm%9·ëXen%K¿ Ì“€ØJPDˆˆ™hÍY gišÈ‚Â4§â^xXB¼C†ŒiÚ¤IÜ®¾‰ÑפoÊ<\Ô:>ÀUOÊ0ôwÞÄ• žÎÈ¢Ä4fܦZðÝŽI"dëdÊãM‡™˜í RhXÐè6fºÏ—'b… ¤AÌPÞÇ×b!&sC"‘¸Ùû ¥•ƒyéÀ(1!µçšãœnò('2Õé’2ÊçÙ»:}ÄrëC£qz4— §F쥓³œ¥À¥K‚ HãŒ,g™ã!·Ÿ<|šŠã#V&CÅå°T(Ê¬ÓæH𔥯f#_¾ã©§ ; a'ÖXPeñâ«2¤K˜J¦ µÚÌAÛ‘¿w8I<øEm’î‘\Ãþ§MÓf¸"mKØ7Dæ* >E– ±–Ndë’!QúÔ}ªìó.Mb黦ÓÜ4«Ø*çR,8Â<,õk1¿‘ðmè*Ч“¡«²±QÚ/OŒWºÒt®v•—DB!fA>|Aåâ`³SuoCÿîMKÓïjÅÌ;{±µr>Þ/Ö©P~(Qá@XeÛ§Ï£übàœ«0!hYœ…Ä짇©¥üÐΊœ¦è‡©­ª ð”»ò˜3Ñò6q,thŠ‹Õ4Ž ×HH„Ô1H-Æ)ІnóÉÚN;wu‘QìE•rx¸ä§²©ñBp³ŸÜéÈÚ’‚×䓉:/vR ñ‡£/H¢c?{~£DTåÕ‚é³Úêä#1\8Ckªç^mÄ…î|m&Eß ;ˆ%8%acÄ” ±nŽ›‘`ç§Æ“Šîö·.>Kq@x Û—ÚºP¥iã“xfŒXkKëí¬ ô È2*Cç/¢­uùxÙ¥…ƒبj23Zê %™õ;;0`ÏQ@$ɤG®`’\AÄIª€³/‰—G°‰§&ŒõZÆ¥‘ŸÔ gp¶k{µ£]ÙØžÚ›Òµ¯f·”zH^4´Ìc ï×Sþ›LQ ù³3›–ÆîOͼ'Þ/I¬Ö;WN#Oz½ ûsgŽ A?1ÅO Šu:ÅŽeËçúÈÎ#ŽnÛCGx¿ð*íÅ]¤qv2²#`Ra‹!ûïì|´sðõïrÄž)±0%MŠbºLQ¼Ûð‚Ý“ÆÈGÝx–5E#·J31,;Çþí0Ï®Ž/JxR‰/ÉDþ¾ÿ$kyÚ:mi¤[àEà…œÂµÜž˜Ë±Àx¸:SéŸÛBš©/³H͵éuiÒ4+1²*ÙªøÂšX ÙçäeR¾? ûh(%b4`Œè8¢ÈŸ±9ùךxíïØ1‹w¦ÎÃbxÒ&9UëÅƒÊ èǹÆõ\Òù]a#ŽqQiÄÑ…’·•qjâEñÖsWÍ©¢­A¸dªÚ$¾7ÇZäÊ}X’·‡Û}¤À‡„bXgnÀ«NÈ´ë€JÃȺ¿RŸ'vH´°ŸNÆÄ¯,3×a|Õv´P{3? )^BCÀ@@ŠÂ»Ð ‹bÆfr.jÄCÙi]×¾õ]Ðò1-ž0Uýø´b#+–Až,6r—•A"¸ óîXö2Fn`[=$ »Á›]J!u`•‡eè#¢Ÿ4%¶î»•²ü¡(Û6í׋ciŽK…ð kóÅzj|ô²øwo®­Ó²Ø›È¶!r—Ûõì5ü¸_®øò~¹D†^”P#« ÖòÆ„e²ºzéå?\Õ狇ÔbWªÆø:²EËodÀ«‰fQÎRL$•åÇàYå¶¼¥Ôº‰#ï>kî5Iª‘¿o™Cò µ5ÎuÐ6Êа0©Œdà>wƒÈN/“ú„ÅLzE‡5í}íÊëº8< sñœi[}7ÓuàÝÔ¯ÅR†t5«•¦ð2G§DÛ*à÷7Ïþ ÿûß÷endstream endobj 141 0 obj 6657 endobj 145 0 obj <> stream xœµ]Y“$Er~ãGÌÛVItmÆa˜Vˆ=dì 1ÃHfBÍ44ØÂt;Àê×Ë=N÷Ϭªi £:+32?>?ëûçËI=_ðßòÿ×ß=ûí§áùýÏ–ç€ÿîŸ}ÿL¥ž—ÿ½þîù¿¾„›”†+§¸DõüåWÏòÓêyÐÏýjOðåËïžýÏAÝa9ºÿ}ùïð„Qì oO‹…‡^ÞÁoÌ)„ÕáGuŠqµñð»£>|r¼Q'k]Ї—ýžòUc×çpUE6,¼ít¼ k<ée=üþˆ·ÂÛWøÇ”AV­ìáÅñÆÁ 6:zÃÀ ZŸ´¢s‹'­µ÷‡¿´é½jŸÈtþrÔôÃÀm }Zïxo³ð¬J«Å§ÿ .R‹;üW Ü¢Ÿµ'òˆÑwZf['€»ôññFÓ›pHòuY´* ?Æ›r*7fǘçóÌc]}ãhéeåoë†û¼·Þþ9/ÖÀ#ý6Ä¿û“7ðÉmôAÁq~~̯†…ÃÉÚUá t+ßäõøÅ¾Ä½t'gíáõ÷T{¸…AÞôƒ&à›¿Á#vrUéÆÇþ-|4+Nn…që`äé»rp&¾ƒµÀ䃷iÌ`ž°u𥠆 ò-%ì½DF /Ó`’¸Á˜Ã0ž3'ܰ~ñ×àOqõu±ÆÀ, ø/Ç›%Gô‡oêû<" ½žüZù°Ûn{Ó(æpß_õ^¾T} i^Yt6í܈»w[¶Ù iü³ ÑoÏ÷à›Ýûx?àrýÉÐ/¿iM›O|€£÷Ãüó^¤-\Ìáï}pÑ7eÕ7 vÓ/:/¾OI½ÊÃ+à3òÎÇNx¸< Ì%ÆúЋÀ´w£^ŃT'ç‚×õÊÏYf¨…ìü·ýà ™ôÉ“í¾2«5xJÁíé¿ã_"¼ ˆzQÖ~:šôµ"TB(÷ç.ûÊÕ ét2A0#ŸOqš2½÷ë>¹/óî8 ²;ýB:A${4t:d6×G .¿éÆß:|F£p™u‚K/|Ìt¿¬§à+Ý3¦­ûñ“Ä5Èâo;ñ“óèôŒ;,,^ÕsE]PÞ¡ýJ¨¸S¶Àoú{@úÁÜa6Y? ¸$9ÓGϳóz‰™ÎVTXäÁ¯û fÉ;”xÄÅ• äŠò¬sªŸf¬SÎW+Ûà&„s²òiû$/ãƒu³?|‘å³ÓYîÃÖàêÉÓe·ýbG²Å·õO}–o2½Y3×u)“KÌü†q¥²ÀÛQtM”ˆ'÷ÞâѨmîÀótŠ_¥Jí±Pºõ£Ž»«ëˆgyocôªŒ®üñØÇ$4õØUÎáu¥Ûö»Á*ÂïÊ*`Ü/¨°NìØâkªpÚûUÂ^mø™ƒ‘+6Y¸©X8W 3a9»N„•tÅ]4<éËv eÉ UG!Vf1P5 V§grÂ1ûè=ð5’RèîâáDQ§üþ/ «3 ¿6VËäCð,uMKÝ xÇ]Z9Ì#-Ù»¼|lÓÐ!ï™¶(“'ÊÂ×ß•wyyYúdM8^«Jê|Yµ8Ÿä\Mª…,÷¿«KBΔZ~…·/02¾ÅWäùéè,ÈT½R1Ñ5kÅB_t¾ê²)+Ñ$¿8«Š{¦¾.Û²ä,f#–ÁMÝ.þ:%£t*¤+«  Þ?H4'1±Òà1v6èw£®´!‘6Uía:"EÄÝZègO€”€‰Ë$’Ht#/Šâ,ó°µP†áy‰6†ˆÌ²‚ÏàJ1Î{+`¿z.]À__pÿDžþ!±…Žþä›Þæ«7À[q!19Ñâ$ÄÓɰ6b±¹¶K’P€Ô丂Œ±"æP{—ùÓ5)h‘p&Q+·‰×£Š“9Qöj6'P©˜däÛÎ6\YóDâ|OÔ›b<.§=£¸ê£ïŽ`Õ<=ë":×`“ ûY-žN€X¹¤]ºw1 ³$Sï•M›…I‰`=Æ™V9Ô¸®eÚ TÛ%s5£ØßÒ½L/@ö"†lŒ_ëD¶°RgvŒ% ]Xµ&Æü9ë0ÅÛtKž‹[ü  Q¯%vW q!؇ýjr P!ö> Ó|(ëïú 6àT×!õÆå¸=Ñ>eQÇUÄ´ùu°1ö«iŸ!ë-ÉÌãÖ3àîÏà û>cè~ßk]†#"SJo$!"«ŠŸ]$Bí‰^›$xT³DQ’zFð³HèGƒn¢»E ÁE‚3>1JñÜá,²³ÐY_öv4fª;,,ÀÕF]5uBÙ%Û žøs D¿‚¨Ñ²ý¥‰€"±âj²Ö+û Œè‹Ù膯™e¨4'ÐUÌŽbœ1™i­›&‚` cB!o¹*½ŒEÊ7ÈÑe8ÓæÅÃ9ÐcIõÈ:,LR}•ïIœÑƺëï$‡>ø`“ ÄÞ}Õ!„s ¶mõ*—èlÓBUYênAíªr›t6•ë©k•°Þm„‹v²³NªŒô>ŽŠ'@'C"8ÁÙNØXo¸áŠÊîÎæw…L¼ª¶˜ÑèwO5ò~ÚkM‡:VÝ•®°ñö‡<[ô)½¡WGORÞ7d Á¢&ˆûè¶ìÚ¼’ÉŽ66$RïLô}Û¨*#Wçýӌ䴦Æõ`n%"™âDjö7ôÊËóÊJŠå—ÓIl äÒg`÷¶±>i“¯uØž#4ÊÅÍã˽¢HªÅ&7{™É ¹+–6CC“}ƒä|âc©#-&?ø_ð LÄ®Ü I.%Y{1AŒáŽ,EaO$HA&88Òàmÿ(rç¥2_⨟S´EÔè¤(A´5*¢"Í¡A_þÚ Hõi¼Câd„+#A§aòÉ»r$žQl²ŽG|‹¥šöcÔ'ÝÖ@‘“¾Ü¥ð|Ûj3Õfí+B^ˆ~€ÕK‘Õ6È™¨ ✮&JRUŒŽº˜6Ó¹4惵P|äbhYG›,Ûkš:fßê`&Ôo€bÏì^ÇÝ‚ž‹_ —Ukµ{d˜Ï·ãQ[ê¥Nþ‚ºt:`¥•`cVÇRõœðÆ)™gË·3˜¼€­})!Y¨`,h0•ESÏ¥+Ø¿uÔd>ÍV|;ƒ¦@ƒ,. ΊÞÎü®È±K¿óE\t@–g½gÓÛ‰áaË™…{¸™a3䥥‡í ƒ1"ÙPG»ˆ yññÙɼnþžñÃÜ™iùÎr­Ôsi¯)Ç`ø"ßýGkH¾ß­ÖxHÚ;ólM§a¡#’!§ºY¥’%õÎè }ºjŠ_Ýsçv´ÌëÐTÒ"¿&«”´#f!*îT†nBD427_›°_¼DÉ\ÐfÏVÒ-¾$<t˜ì‰izÛö즇®§•¤lË!ùs“Z“ƒF] Ù0•Þ°³ˆK!Æí"¶ ª¢HvÜDÒ…d Iî<2zwФ%RTàl+w^ ºÄ9‚CÖ3JŽ’NgJ¨ìW"Å’Ç¢ü1{1·*uK°Ãñ@~ËxcÞ·¤˜!/à“·ü\·óF+ã‚ ?‘0-ûPÉ!æo癵 0È™Ý> ‰!ÕÐõ%Q€5‹š*Å#úA]ŠÄeÛGwEòMš‹ˆnv“oîÜÚ¥÷DžG0Ð(raS8 yï¹${´¨'D$ÚnN½^¶"åÙfN‘rQÜSŒfMr½_Û'^œJþ0m¶?æDºd©: :’v’«IÊw‡¸Åk4¯•»Ên¸T3Ü$I¹Ê[Idk§\©œçÔT3 ²Öˆ“u8ævîe™Aü²¬'.'‚MôÍnQ7%d/¤ãћɠœ kþZÙ3Î6$§B’²&ÄrÁÙ®Ü6û€«7jœÅ~a¨2fÁÃÎ&«2àÑ«T.Å95Á°,]¤Þ¢¦ëûµr«Ó+}›AIµÞp|¾ÛÈ0-9Ö*š’s——ÍÙqÊçç<8$7cÂò"Ò¢:+©jé9·Eùºž°ò‹Yžú¬†¤¥oç’Ò>¨îóRI¼ ¼šœ¶Lßiº´*! Ô¬Ý[Å?X]hSºSEˆÝ †?g ¢æ¦<»šSmVòÐ # ã¿‘D|U(-ªŸ@˜TŒI ÷sÀNÊý¥Ñns©ª°mŢЮ‹]sgÈ«“!+^«Cœ¦•[—˜¢—“rÝLoã .=ßÜîÔ{Ç ãýd³ä¨g¦Ê´ –r¶Ëƒ¨Æ/Ï%iÖà®Â¨k5PN¦á‹=-WR`™ªî€ØRDÆìÝš]ƒòbÁ&†NB ¶Ì.nWÔÛær¥ž¸¤×2_ d5™•+¢) ›™ËÚD‚§‡¼UÁ0†¿ ˆK;u>Q›áìÔA þ-¹f†$Ä׉Z?”šÉ®°j¡`ƒã¸eDCÿ‹x¢[úÕ\¤ÄŠ®žªdÑ[Lô‚bƒ”Ç%ÕÑ\%ï„ÉO^Š”\©Ú°zókiç²nÄñJ.Õ¤2r!z´µrk{Œæ“Ò^ªðvøÕ¯‡ªR¥Hà‹,ûÆx­!CH „3^·V繬B™'ñÉÞ&§ß ŠÇ“'ŸH¦8©\&)Ù;å¥Ä¡¿6qWq[ŽŽ˜dp÷ˆ}¯“!±²uÌ6›C™Ä:Ä8F’ãGc6lîг>ÇÄ*ë56èÐ)§-›xî\‚]ðô˜!LUíÚSU°+.%]¤’n› wýøÈ>Âë’Bi€ìtZÐX·&79ñ0ÐåWÇî4(#Ù½hæÅ€™SË)8­V {ˆ/P¾|2XÌùÑ1ê,¡ÎJeÅ“ÞïX`)> Ì9 &¥Uáò­vRa*ÇÆ¼É^ƒï ûº>ò¶¿¦ý#ÌÕœuR$£á½1ÔmÞ Jê5»kï¦öI’Òo,g‰8øzë$r±w@ ð ƒÿlÉØ»™VÄ!yq!&ÚT©¸„¼—àˆ™ëñ¯•ˆEHëeV\ÿ: ²;ÜÞìŸ5Ä\$;¹›õHj@|d…€[ a>Of).zäÿ©GÔ¢º­ËƒŠ5½l‘}‘C$Ö¥5³ ŽþvLvž×°ƒ$‘ë|޼×áÕ|Ú¼[E‰>âÇ Cðï§ò™^2éWBz« f‘©x£Ÿ‚û¿/¦?ÚIÉu¼xvéÿ; '¡k(&ò¦ú ÍÂk Ò$ÜA’0J´Ð ­¥.µ$I¨®Í›!z)”Ê$†¨<0úðÌ?ãpËÀœËRÏj³¡Â¥Œ°’¹áé~“ÚÓ1‚‰[³Õr $í/À+sj8r¹¡¥†ÿ#sˆ>Ñq§€£–E'õw&/¸ ‘m(¸ebÜK½®CƒL¹ÐñL‹>egœä/â§äCcÁöcClëºÛ­;‡‡ÜÌAw•e)È_G÷ÅWEªCf<_>¢`GHÅ;¦%Èhü%1©Q½¾#“5ð¶J.‡töDSzh¶¬2”@b$¿[Î$ß/—ùsæ˜SÔEW |ŠÌP™…çJ=®èzÉ9Š¢ ­‚ª]‰Ûd…ÂÏŠ r1Ì…mh”¦t>*C“™{4éñºéU7):Ôßð=ñ~KÊ*Ï·ˆ“åèÔZ)hf`42iÖ€¶BÛ %UÜAe,³²¿r¶Y.Ñ­ìÙ¤öBj§rIC'Ær÷?ŠnKq»o#C“ 'Aú0¶f=‡ãÓëÌÕ¹]µ>ñÒÜ.é탞åùÞåˆF½*÷¯É™w,µhˆ@’¾SÜ] /þýÜ“€,i6kë ï9þò^$G/O•Ì]…¶­HÃ+ÞË–±Uîy tâdj!é ±™M^?×,-ŒwÈBg9;eRÔ¶ˆÛKÆ}Xùˆ…ž×ßàUx¿‚ɰã0¬€ÉK›Û  [MZ{±`V‹ŸKñF¢8émçâ[ôÖ šØ¦ãOhi_"3¶Akjm©÷»vp¢YƬ'Vß¶¶(K3‘k?LnJÌÖ[ýÖ–0¤R›´²—y®ûØv=,l.è|è¼,–SýN1ßÛo€º•U%µ­šàÅPJ+?ìý ¶KË0g]ne•ÏNϸWÁ1G>bÜ«£R˜â’åãÉÏs®D;)q´ÃÃJš@”`v-RÞ©ÊØiyŸ*ª{êj»’ÁЂ‡½:Kgd²$(È?fcOvˆì &îÞ¦°JDÜñu-¾`IÅÝ¥´ê4ñ*¥è•míĉƒpÚм­¤[“ n£C÷yìT¼Ê]«Õ]»¬³w (;+sþsyk¸6èš–¯:Í9µ£ä«¯Fð EˆrýTº·*/Ä™¶•æí§ï8T›gÏé{.@9ðõ_ ÌIaÞÑÙ˜«>†´pB|LeJ&“‹@zWÁ¦³tK€¥‚smáXm1ÕëZ8¦©²Ý‘[ÿ Rƒ¹¯Žõ×xòïÖ¨$ÚòDâhwå˜H9c‰Á¢¬“¶®äqšÍQ²=½oø¾Ïbe ¸á;gñ‰ÖlŽ ä¢W–ÏzéC”‰Ð}Q~Ÿƒmê÷Ê] D„·4æºÉ^j’äÌ Ö…ãÎæåØUu~›@aþA±¼wÈ&cî²R±kC‹æòÌY=çSõè$5B²›î^~¨m¦îû›p‰“›¬1Oðbi´ÌùÄ @øº5!ÖkAUÙ(®.˜¨^]Ë » ¬)UnÉ?m#ˆèuI*KŽJÌ‘<д£—|«èÙñ¡ü4ÎÙ4]ÖäœBº9Øø]âW§¬Ø8pÎ …y“}ØZ·ì¯Ò÷{cùÞ@§œÌpgutP± ÓɹRÒ ­XMÛì ÷aÊù¸R–-PS«ý»Lf¤æ^¾;ÞiÎDCŠÒ0¿Â à"¡ßT­j±óšðCmmľVÃou‰±„iy—ð* ==«¹ A .ìÖ(Tı¨íŸªqÁÒ–›éËÒE|§®ŒùÊI@bû®/·è†u%ÕÈnˆKí©¦í,%K®ù$=ü…¿â–Ê+7²žˆš!ÖE'kR}!¤áÖ W§be0ø`ê>H¦ÐF“ϲ—\}\Дm/¥j ]ÎF¥½ÁyÙX3Ÿ\n%8¤ù’œ‘öØl ¤É_QÎø®¿#hGaéo R9Ó¹óPgý®1È‚È[1>esw¹½–BµìVÛÝö^: ŠýÒ>ºÕìÕeÇ;®‹y•ú²Jþ:ö„µ‚¨–.C*㉶–ˆ•ô’“BƒzµSÿÅ'b¥íº¬}ÃHëÍaÊ{†_M´Q€DS±Ç…²B¶ú®?ðR³é.—%Im«h*ùG/Ÿý'üûÿfxsÃendstream endobj 146 0 obj 6799 endobj 150 0 obj <> stream xœ½]K“·‘Þó„ÿanîvpŠ…7p؃%k×´µ¦µ¢×޵÷0âP3²I)‘’¥_¿™H PÕÕCÚáÙÓU…ùøòì·—ó$.gü_þ÷ù«‹Çÿí.o¿»˜/ÿþ»½x{!â —ùŸç¯.?y7)ßLaâòÙ×éiqéä¥õzòòÙ«‹¿ôѦ£œœsê ࿸òó;^‰Ikãäá÷Ç+¥ü¼=<ƒ“óbVt“Rp›ò‡ÿ8Âg9<Á'½ÁÀ“òð+øïs¼O¾<^Sº)ˆÙþ÷x¥ãý*Ž'gϞ⛤”ÖÂÐ𴛤0ùý.ïS^‡: —gᬣYx¯hÒRhœ’zÒ&°ç}Ä÷;Ì+ šOR0q#áz—ö»:Çß— O2LÎJ› j<ÞûÏ~ û[Áö ˆ;ͶêÙ lL;’nô—BOJ[‰÷]å¯Ô<9Bº_ÃVÎNÃvM°èYàyúNÀôLÚ˜ÆÕe3‡×° 7OʇÃ;ÀÀeÓÞ ×Õ¤LÜ‰É +Õá›øR¤éët§°úp _ T;¼„;½˜úËz½>ôS$¯SÖÔáÅá>Í_ÛÃ×ø¥™,Üšæ¤E™ŽÄÊ“2À„OŽ@!#…×iÓ½µZÅýÃõ7]ÿ Øt$¦ÕÚÅ]DZ€ê¿KÎÃuøRIcùRÿŽTJ:x-ûúþˆD×J~€W e]`—G\ `ÿ?¿xöË¿ËÍ0»wðHZ $tYœÑ&cãyб÷uNÒz|P3~ðîNÄ FÓ>:áé£tb|ýÆù†Î³7sàìñC%*›Mª>T–&Ø—wõM4W¤ÛîJà³Lô»©âP÷ ÷JƒîüËû¤ÎÑÞ¬2¦² ÄflÔ˜ ,–A~6Ü5&0³Ú¡™å½®OoODž>Ç2Ix‘Vˆf:³½Ò*šªÊTã!ßÔoãÉz…,emð‘Ía£…/Šôfäk°Gò 1Ð Ti3)™6Œ¡üâýΦ%ß&¹M`,‰ .Æø(/ }þ‘ô’ªz'1YfxÆ×‰ŠVÎñå}š1ߣ伸ÂϺ«Ããýïëý/Ë+n*ŠÖHHêwI'Ò_õÓqÝ"(™%Q*ʉ >ìyáǼGvÖŒI[Ùa¬²ÊR`ôÀÁ3(Qø@ÚU€Êv7¯P0k­7ì†kä‹oE4$¢D±.q=ž[ÆEMÙÜM¯a“x‡C˜Ipã1bèú0³œyœàÙ3™ç»ÈÃ_eâEÇt´Or"½©B²2QØ!=®Ôÿ\þb’Áö×ysØg ªlýÈDïDÁRFuk¸Þ¸©ò×#.ÍNbn„±Œ÷Ž.÷6F&£»5<¿©¢ó¾ÎÈýêŒPVòF)A:µ¦äû£Ðn øÈT~ßï<ÊË#´àÀ¬mÀzŽÜ¯A!Gäj ŽÄ½–ÖD^ËN˜–ã0ÛrWÇ©¯D( *5åuF9qZŽÉÊ .åÒ ¼iWó¿—HˆUQ`­pz[0HšÀŸJ²îO¿g¼aÂ}$e‚fTVÑǦ:…ú© ­$YšÞM’Œ`á™%ðêVoB\}½Îfò~p«à\X•ufB%ÜÂá ý5°@Ä*–K: ›æß™à½æ(bqÓ 1vý±Á6ðb$¡I$lMKµwŒ1B‘€?íkÍU ê9K2(ý† ˆÆhÈ$†ß‘ÝTÈÕ0d¶ž?ô&Ý ·¤ 2Yuø# Õ¢h|ñ,ôI¸Æðe½µ;óÙ³‹/.Þ^*5Ù°ʥÓý¥±°mÒcPé“'Ÿü×å»oß¿¸xü§Kqñø7øŸüáSøçɯ/ÿíâ³'—_¬›Z÷•‚M¸ø`ñ5“°)àôPZ®¯Åx;ÙÁZ,XAÙ¬¥7w¸åiLR£L=t¬W×7bâ<§Î÷ëâƒ6pKwŸT°3 CU%,P& ?²ž¶S(S$ãš]£ëV UÇÜ´0·Ìµª¦lZÒ°µ®Õ4e˜.…p æd†Ž´HfrïôÁ БO¡` 6*Î}ÉØFÔ·ÙYœÝIà¹åR˜1G ×ýBd!ŠÇ"É& ¥Ð¡Ó¾U§Œ: *¦îàê~É8£Ûç0²Ûy2´Úãÿ&]_a €(úWÒEõi5û}˜&š ú]Ä‘#L}šNR¸8‡¡ "tžå@@[o›Á¦üf=Ò õÓ›Æ`ººS U¤hÐŒAúŒIð• 8JgÑ´“Ûtʉ!}Ò:1- a^L#¼ ~ê9bh£jd8 ãaŒ¶ÎèYq?7méýP¡¡ÎCÉCÈq͵LøDÚ´`£ ‰ÕçRŒö#9e”'ã"<çr`"ÚDþœLÚÇÝYµÁ*ÄFxÚ#Ï‘—.äƒa­O™Ørsü„xËhF„õq÷,óÍåÍì¯ù°4Ÿç ú.û³1@H"Â\啨”wðʘ¹2³Š©£ú¿ý²rd¾D7ê…ùÇñt•-•É›®ºp ³ûD|€ç\[á+¹96Ü…h¤ƒ½ø9I×vlˆ»½‰œ­qîù“ÛÞât¬ŠÊ"HPÁyíM5ªI›Ñ“Àz–1…Áßsg*m`vƒØŽ óF86½½çɵÔ9 †ÔSª†aà#Po®þ‰áÁÿq 48¡g+â•ç/8dÃGz«b³âtŒ¼’6‘ä Ò Lo*ï3¿ý>¦üMo^%œh­@Ü?{KäAj½ e.t|ÀõCå tvÌ;x³!Y©=P(”1&J~vvvH… .FVÖ=µõɾË<YÝö °HÏå 7©îbžMW©ÔC@f,¼ƒAv˜Óµn2X~ }rÐkÌógñ™*4¯hi­J'õÉ#Ù?²HwΊÛÃ}«En*cR\+;Í!œ X·~µÔ‘>¦5h¡»Äh…ãì…Û£æuÕÙÀ,•ØüŸšE‡;Ì1©îŒ­%W1ÈCÐ%NæÔW®±§LÀø›‚q4‹E ÌðS°k×À£‹ü@JlpÇ©QHC·I¤>Ó”–¯ÇBÄMq`óm«š"Û²|:ö^ÄðÞJ숣)$ÊZ”©aU#ûò0°«ÕBç#6544¶¸Ù¢KHk•Ò•á™A]K-ßôKg®qeœ®Žô¨)qÕz= Š"^gœ²ÉðÉ4½3þ™c­‰Í+Æi£7ã 5½™€Q1R´ªÒ5¯ZÛçÅFbr´bcLJ96Á+šË×–gj%ÔZª”HÓ Ì@ |'”PZbRJT¶á×Êù{ M¬×”gd×2+1ØåEî Ô”+÷ö¨çšL…½÷Ñá`É»Œg › pβ]¦ºõÊónRT¸Mfœý&ç7ì„;eI[±²KÏ{y¯Õüd-Ƕ"f±ÚˆÓŠ­ˆ)ÃX)W·(ôøcîÇs.sN­ai­XÔÜ´Ö„ˆs•BZj-pKçà Š%ÎaéâŒs”Ö‘vfmÈkSßn!hbG19™‹üf,ÄøÛðOZ[`»51Þ²y*!¦“yWÜjº_j ÌÔqçuoÙÕØtfjU˜s–ña~T –³'ÊõXæ$fqÁÉë«ZO3ªÁ:e¹'³‡ù`i‡ˆ¬KÖ5…7)ÁÌn~Ër¬p•‚ÿ6×7ÙÀ‚®\ïF“TaÂvSVØ‹Â@dÊqÞ‹ÍÁYoþDuEñõ2╹ÛÏ[œ]Œ–MXúζ‹óIšj¨üáõ¢È½5Tž£º$ª'ýZÎy¼]hw’¥é¸P-Ù_±M¼âéͼÝÕF¢ø:ݲ3ß{(Ée`ʨ²û†¨Î û‚ÈÖKbîrhQÒîÁ²6Ol™ª«½Øª®NE–naX™é²r ߯=p$mÛ¦øŠ ×põ}ÑUž÷i–ÓÉ?ù`W:ב„s£VkfK@}-T:u)ׇôüœúÈÉ{|A¦ÝA“÷‡’Åàxž(¬m òÓzÖýZÏ¿ Žš¨óT1G÷k”¢#üˆ*á1GåÚPB‰^ó3.„ 6Éà×sÛ,O¹¯P¼=ŠËF{sÞ¹ä50»rØ!œNl0êaê7ÏO·A´Øc2Ä€3(ÄZ¦jor¤åòtOY=9/öð·ŠùƾO>7<‡q±Þvõ1’U³DÙˆc‡‡ëºòc¬< +Q¥Åéà½Ùèìjõá)¤`+=ÃdÜâèµáµÅ‹“˜ì\Pt)AÁ|Œhl*jÝŽÆ’¿±,Qèª+ÎÏOÄãÃ5}Z`be±ËÇ7 CÄ­å`ä:ájðb¬¬*évæ»AYSS±:8˜GÄtûU+U YOñð?Ç&D‡Ü >r¢n[{wÝ.ª˜ žJ±;áŠcÒÕâÊAÌD_u4<–àã"§Zlo‚øüÜ wc©ûH÷Ûe€£“FŒ ß—+CøK'X;óå¬5&þ»Y6gÌ¿·ä=n8Àì3XÙ[Þ0Ìmlg”t'D È :•ϲDXžžÛB›¼Ž¦]Kîž1%pä®îÊZò×Ó¾á5ª´(Öw|6µð*º¶FÕ§]6ß¾tÃÖ<_SåǪd)»¬:“ T½Ü7˜ ³“à™,ã׸/žžþž9ëÑþܶ#%iC_öGÉà”,æLÞÔl Psç{Ó+l—œ`ùfÍ ”É5à¶B~ð°al7 Ej£Á°Ó$Ý•É1 @A²ð§QƒŒ;®Ká_5]GS]´]i;:ëõàsý©¶@?(Ȫ®®—ÖPöÉ©¼àÓ‘á&\›HØ”ëQ\GfO倹âür‡žRÖEÔMhßÙSE@ƒœb Î̵µ±cRˆB6L¹íÆ/#¡gb°eÕ”är‘óáXŒ¹6ÈöQ÷)À·2­ä³»iÖí1¦Q5T—yÊ¡°æ RGÉEs¤ÕšÃ¥á½ï¹ )kû[uoXøµ; ÍY8Û=J·dg=’¥5 Û'ÙQGß4{ºÍ!±Ñ“#¬öÈKÝiÒWƒÞc*ä–cé\âvÓ1Y›Ž}Ž+±³šSHNLÊ)„¥ëWÛ* ÛoyÅû‹-[yážá +cÌçÓØ_ Y>u Cóõúo´ñ  Úxìsf颌œ:Š¥~_s4ÒÔzŒuóŠFhéŒ&Rès£ÞÄ ±ºSé[´¦Æ*éÝ¡vV+BØû®¡ûç«…Pg¥võ5£y°žÂÇhn»ÝØGÉ I,.lªñX96CÙÙŸ°Ï?UF-§ÄدN¸Í«ÁY$ª>eÇí˜`¢¯J7Ï~WßÀ| ·/È 35:•P¯вžƒ’~ áŒ@yÓV„Ž@ò#¹sið¬u¡u ͆FŒ¡Zççþ¨MhÕ%f=y~^c7=$*I‰“bhg¼GçP‡ùWGT I2jñ¥_ÒZ_1VEì’S¹<¯´CYºa¼ñ3,/v!Æèu«„ÐËÝù×–˜¨×±Öê„J‡QUÐOƒi!™ç9F2H7x»Ö,ÕJÖ%,ÕÊ,ÇjeÑ£C[—»$Ø3È‚+tª´êÛHÍe ޳Üǘ‰YÚóŸÅ%QÞK2›Æ%éOéÔ#£@ï¿qTOØ´G¼Û3;™-`ÿCnÿ*ºz¼µlб‡ ,œùNI“[lÿì¼ î.;qè³Û8º—”óIÅ¢ñÍ<&S L2º!u€Ø²•!Õ0|Ä8l:‚#ëù|j bZiŒ{§ÄYñYzf }ÇöÈgáò+ ûr_TÌÕT»FV+Ùü\ ±mІ­ÿåùœú„ð²›O‡ÿ_b¦E)RTX³æcÍÁ,›ú4:\üÈœélŒYÑó8.,ªQ–9ëAê¢l¦„ª–¬;¬°¤ÁWJ*¨*,—¢|ìDýG¾¸×OGÚšJT‡•}ï¶Xdhj½eyR,z˪TpiÝÇv˜ UÜ8slRÉÈvå·b~®ÆP¾sóû­ù¢K=¹šÓÅåTÛz{ÜÕÅ_n¹Ë©ÝdˆÙ>|µX–æÈZ[ÁFæ¡ås=ÃÄ¡;œßý”„¼ZsÕ4"±±ô¹9¹“¿r­å"ו¢6•r‚dh–ÕJŠ0fÕ×ÙÖÑÚ_ ‰K@€Å ˆõ,÷° ¢ÒëÐÌc{8a{H¿ÛÔôñW¥~¨ÂßSž*—=rðSÕ:á±~P”×ÏO‡~X=÷u9Gݨ¦¬Jóæ8×e=ð&›",«žÂNÁÊðÈ,³ÝOäý‘ÿ”v:ꌓen<Øæ(46.ŸKËZíÓ/OT=d9‰pnèåå¼¥8›Þ09…ÙÊå¨Àˆé~šøá˜~ŽÐ¥¬A®Q5¼ ¯k\dS`ó¡Ð 'Œ¡“}Ð)½­;XEU¦èÞ©62”†ö_\ü?éJ'endstream endobj 151 0 obj 6689 endobj 155 0 obj <> stream xœÍ\Y“Çq~G0üöI˜qp›]w•"ø Ñ%›:L.­PX~°¸‚{€X ôë™ueugÏÎ.V²É 8è®3+Ï/³úÇ“yR'3þ[þÿìòÑ߆“—7擯ῗ~|¤¨ÁIù߳˓_ŸA#¥áÉ”æ¤NÎ^<ʽÕIÐ'>Ú ^ž]>úïÞ;üïÎþz5ôðvš-t:;‡†_íOÍBJj÷»½šRŠ6í~µ×»?ïOÕd­ zwÖÛü&?56î¾…§*Á°aga¶ibšôw¿ÝcóàÃî÷Ø<Â?¦ µ²»ïö§±Éñ‚ZOZñ5áÃIkíýîmyÿÕ~±åüq¯ù‹Ûzšgs|‡³Yè«h·Øûßà‘ñ“šÝîkÜr³Ú}ßzä“1 ZZV[€Túfªy#’½.›ÖAåCñ´œÊ©™aâ”òá<ÛÓ ažk ðÕ^‡ÉÙÙì~‚åÅèCؽ†å© {ù®S÷yë^¶kïh&ëÚ€°ËW½wkxƒçÉ9µû°×xÆVïžìMœfeÍîcf='Xf}ø~o¨·b‹x‹¶“Ñz;vN“ónw ´›¼ÞÒ›²™À‡Æçç}qçÂ:ó.‚1ýQ¦[kŠƒ\à˜þ>c|_ÎU³ã¹~Ï97Ãï~XlY‹˜a\’/´Ópj×{䣠U•C  PÆØ¤ùÖ*‰œnÃðeƒÉÙNÅPÇÊ—ÿþH PÉèÊAEÖ]êsÞX¥Úš¸p½ê žÃÉ% ÓÇÝ B;_fAÎgYŠ#¶X®A×…Éúrd$ Ò6ŸíG@ |k ¼7q$aMñà5, Ï[û0¯ª@4¥GUFïK~Åõ]>˜éýÞÙ Eæ×GÎãf_à_a=ylJçUÖü»þ´¨´uߢ¤E0‡³ßýGW'Ìü5OsVº¤nKU8.£L4Ye'Û{R©‰E›3QÁFe{Z þøÿ@KHû ‹ž_| 3¦0¥v[jý{ÜÙ<+…‚CûýNá› ÿ˜ñèçêACî¾€ŸzÎd¢^¯PI€êŒ¨oò©˜hzÿu?Nz ÷M{xÝ[^µ‡/¡%hÃ9{åáO½åÛöðõ¡î0ÑW‡'z?샽¯?ˤYÚÓq,¢1Pé²?}Ò~¬N»§|6í¤hŸÄ/? §W¾íÏÛÃ_´_‘NÚWöïìýf`õû WO”‡´jäM¡.ûy_fd04&¹M³ÍÍ]ˆ\Õ_Zã¬êü×ï wÀ†2J?(k:a\=&²i'´›#µù©ñ5ü©k\ðñšÑƒ\ÁàµDÊa å×yUvŽ‘”ï~ê•çL>Ùã›|²Ã¢ëž;§ÈÚóH|‹Ž7ŸIwêoýë=ÎÑ@(WÛtþ]—ìWM„éðÎê’f³ðIéT¿èì!Z…× ’DVx"p'3c…WÒ)½-<ëô0ò)2ée{x)ñÖZ&³¶–¢ÅfÓó¹–àdv´i£Ü4§$„o©z~¶Ì=ÓŠÅàyTÖ]kMgÄÏ~iŠ*³K«TÊÊm*àü㊿Á½åP«Ähì!Æ`9FOú3<)ÜCŸõ]¢4·–}Ž -,mŽÜ«eû¹FÿœçÄé~[?n½.ŠMÝâ̼"בŽ×À*MÇ7?·ÄéÎŒqzÛeõÉùÐÂ:¹q„È ½ÝgÕWíÝ»îžsg¹‡’´I3X9äɤ°hÿw„Ç Ê|B&[§¼ÙÑYé`È« V.›«‹Ä,ÐÂE!·Æsô~ÃËýíÑä2xÍý`µš´êV¨xß ®NÁ¼úš°ûndÂXdô´$[4Æ Ó] ¬#|q­C$Ö~ô½0ÕñÛ†1\enÇü¹ã~»1 ð— HŸ/µ;¼ç «¶¨‰ oÈ,(¡}dâüž‰Tgp¤ ‚ÇkÍBêL_uŵ„O Md& ?Yƒ¬UTÙ‘+¤¹.*hÇŒ#+\àðëëeÑûõÇà…õXj[dꢇ4®£h[çmk¬Gì¡ [#t—øêàY˜—;çú¸Ý4ϸ«®Ê)Ψ×EQÀ h45ð‡De>°6?¯Ø"S¥ÊZ—©¼%o (QMúY?”-=ä,á‚Ûzx`^ÏÊTºª»«†²WpÏ*+«¬>컥Ýd:†‰ß›,± CKNéÄ4‰v{ÊÍ‹ö–ÌËz¤]¢å(Ó¤-)-d’BÚ"#è@Œx¹H“b‹àšŒzípfD;OIUߘÙ/™¸/!;ÌŒ`ægDì^” ØƒÀâÍT)(Æi«Þ®¢²Räå¦ ú‡•Ñißé›q§Û;ýÐÂÌ×µ÷ `øÛ®Qâç‰!Xdÿ¶Ï1#Ýÿ¬ é7íõÑD£–Wå½á À”>Ÿ¸å„GÖÛ½ö>‰–÷­Ãg;@ùnìDŒgÙ–^l€ü‘yæ,øór”È^q–&£²áÙÑ1\q<»wGŸÝ»¦Ϋ·=™LëÆª†CfIQ”þÃù>ï'4´¬ ÿ u-eeÏØõJZä‡ÎÅ?ˆ9‹6þ¤S=OõùBºØ©ž7ût1* áTZ‹¬ /³k«» ûßbÐa„S°óVÊÎúb–W~Áâ2)‡ í"óe…|õ•肼ƒb1Æ‘@…6õGD â9.>B~Š+æ.KXˆädzÞÕ¿rn2Zñ)zsSà£BgØV@êõrô{Qüñ85œaHQãèåÝSbTóRNšah%ËLÌdœÿýÑ­Ôtít;¨nÆBàøY /¥¹ðò‰{å×¥4#ÓkÞtáHÌ—Ï0ä|² ~à<” U¢¢!Ka¬å@ŠÌ9šÄÁEtz5Xeg¶ÈÀ#d`ÒL§¼F@&¥Ã(Jé!†–XèÀ™ù:/^ ­ yiU±Ñfè/DLxµÓ÷]l ² Wè̯ òج¤HÂ9/ÅJˆN´TâZ¼p¾…žrYóX•ƒêZe‘pIn›•‘„ ¤ l>Œ>`7ª«1Æ-d…岤„ÓÖsª« ï—’$¤Â)ÁöÕTàr‹…k4‰U4¶Y‚¿ùläDæåØKòÎÇóqq»‰½?a“â+­ânÚWZè=ªDrf›­hYî˜"Q"› rzdagD™ÐpœüÞGFy°¶ît”QcûͲ¡§Ø*ù]²³ï(û"žB¥¢Çx!ÞýÀ¤PP˜îYŽÎè}¹ø7rs3<4M“â…€WbKÖŸ­®v*rBÙBŸ…DM˜aj³n³`æ\iæ@},Àý…ŽïòÃñk^ˆÓ‡|_|”Î Tú¶7µ°r²GÂxÖ„8§6Käx’¤¨“;ˆÁû¤‚˜Þz°4Pv©B¯nŹl`j};„æ>zZÖ:c¼%Sr[þ¦”-JؤÃd'Ç9™H• ^,͉ ¿’Ø,0X”ÖnvŠ+VU®bž† äK|SàÊM[@•‹££t°t`ë|?QÉê NK›âN‰K´·¯—5`­® ”»óvÛÖ”‚MQ§÷NŒY©å–ƒEU©Nß7À5£AX9ß&^Ô'lE" ‰Òó*«¯sšE\(ãO)×ß ÑÉEâ¬õ4oâ4g³p#X¬ÁN>„]-wIVøCŠa»F$g˜5{=š‚ç”É¢‰Ä*—EüÁd÷ÅC^éÊÀÚ9'3ôýoÁ`é®~x¥Ùé̬F»/‘ÇKpùëyXÇ%ãMÝϯ^Ó¹cyèû_‹3mí2fÎPw¦g%™&K » âºK`0¯ËͰ …Q.^¦ƒyA­œI@kQVõ(AK.e©TY¹”¸ŒaAõêÉ€ 0+«9ŒO¶¥•Y­‹²4ÞúFªõ'z9añÌ"@½ ,WivrUÊkÜÆ@ xoø¤X-ƒNt7unIíZ^± “u†Ì±hºXŽ*v¹ø‘n-;KüŽO·1HK—KÇXÍ‚(¦¨~žÉ ïÃX&BZŽ2$£PÒ-9T¶J—ÚûÛt¾™¥‚)Æò¹òBÁÆq×j·v\íçyUÂ>tùcÅÎ%×YŒÖX©ÿYɱ¤“àÄ ÀÞ¶…Ýœ«]xI›ÅkÈ*­Cj;y»6(’›G1w°Q؅αõVÍã èAy.èF…5ØQ¤QëÉØ^µe_Ü%‰1^,Ÿ3ºµu•!O…F£—µrâÐRT'N ×õj9i-D•«§›Êð9¿\kí}…æ‚ß¼‘šËåçU ‹ä½»c‰íò~æÕjÒÑYÁ 4‚W ƒ£Ý"‡\à¯ÂÓÀ‘¨¦îàRf[^Mìp¬Ãäo°ƒz­Y—¼·jYË lƓǗÖUð&ïsSŒùnì ·B%ž}¸MZ~\Â’ÆË”-ÉqõÀ9НÞÎvñÛ–g­kÙ¿¬G¢±dkÃQ—~ùñâú rÂÂî’‹ª³ždàŠ]Q»âcû¾±ð˜ºoàÃ<ê 1¤t/ZØË@« 3%& â¦x]ò߯¥¦Sæ«Å¹;VNø8«<ŠÝƒ K)«L{kJíT¨¥÷¨¬À D‹Ìä6¥Þ~dß fkó%GîñÙ1B[Ó®y²ó¬sñ.B²1aôBb}DŒ“‚Šý¹õ~Ž’¨Ár (z3^ÍïÐ(K˜imvEÍ@Ûlhh'eS¾ñƒÉͨðRu‘½fûj«‡¼É¸³¡u´†´©MÖÊØ ŽóoÍ8]K`ò|óˆ1âõ?¨ ¢Ø<­‹½¨Ãõ=ßì)KlÄâí'`†ÀïͱªCÀËiÌø®Á¯?ü ‘ðO5ªæ@H'x‚ÿt®?O±ºÜ«o˜´šÞzOÄq<ýº÷‹iÖá›àÓ±€§b‰óÆ7 Æ›KOú´¦I ]ùN ¨EÒ–Ì¥«õûn•èÁ•‚ù¬ê„­ø©`Oe3€¾"Œ+×ëäÉ UŠûä¶ ÆADÃÌnU-ŽwtüriRïþàzS f-vùúIû2UFÛúYÃJˆ‚Ê?†öȪ§zÄZäH޲_Nð›ŽLذ~˜AŸ sÜYjfHø™è3¯«¢ tRºŸCŽïjB{À¢oÿðHNú ®ZÊ=óéÌ,H¨ì8“Þ´Ÿ€b¡T´êPÌÆÒwÃ]• EܵB(ù¢›Tã‡KFé`I–3]@õJ–åm*jíl—Cæ’²øpÂ8Ø">SH…jÇ@k°Üiæ¤J‘ºç¼œo™z¹!úúÞú^9d×HÎ}î‚`0 ê7% ÔdˆÎ,CcFXÔH¨ÂX7‰å¡Ê 6ÈꙜDó÷xPTš«ÜœÖ Ž:SÂÁö%¾ÌÉûËèèöÎð~L oûkJ—m£îŒAû=ß|9ʸyšM3(yÊôضðô7Åβ6jOŸ¿ëlµsð·ž‘¡%R¸U†ÖSùkD}U86äyÊêGbÄ´ØÚØ¡f—n­>”íà£u²_¬µ|Ó9u…oÓTýU®s×pi¸ù+YæUÑàÕawáe¶4ù“ã1Ï ü!f­ 'oÆŒ¥ñ]†.î—¶ª*>è¦â™½«…zYJ6¸r¤S*<» 09SÃÆµ,n™Ë/{cÙü#={ÔÒ¬ÁŸP!ºz>XZFvÌSÇë’åüWøz¨÷np.t<–ðYN+Íñá“‘!i-®—Ö²v³]ÉRë»…žeã‹O(b܉¥‡©ÕÝÂÄÄðS䌥éõ'Ç ú¼Æ ¢mkú y:Ä‘õò¥¨ØæfyñP¤h¦e¥Ðצa]è,}­·“‡ù›ÑcäG»Ç´õãÎDìéà7 ê·îÆ%qŽ:¨ ƒ“kCF‹V´~tƒ%ÆìlÛËç+Î"^È'G¹xÔ  Êœ„}+ fçÊQf·°(«‰gìÆìKÂòYrÔꀵšÖndÞo×ȲãÑÑ·U*§u»Þ…u¼(ÌÉfÚüóºî†á›žZ,¡j&Åè±4¹Ú$C\=DYXÍ`mcÀyqÏÿ°û1^à@Š)5Ý€ز»TKDéåŽù’QþЛHùrþm Š_‰ XˆË}ó!˜« ðâ0Þ±Àäùm¨ìb5:ܘÐè»L°>Ôú#%£h¼+YÕ!œü•ܨɹdNªä¢•«$J ÷˜…2°™+xùqȺo|) F©ãå¨Ym_í`)\„wa bƒ@.B•ˆÍ,š”TÊ2\íœÊ¡ÆE} ŠÃ~(ÁÊ’¸1«ã9¶Æ¼*T2ô©Fü®Õ©†lªü~\”†Q ¢YäÃ/‘Gcå4Ä‹£«5^Î ‰a®2*j}BTtÓd„TËÃKþÉzDÊÓ`]ò×µ<ûÑSñ´Ú¬wUÔD;Ãs†Í˜v@4þ?¦\«kù¶–o ’r’æ`àß:Ò¯(䲜CÊpo$§xòTøÏ¾ÔësäWc¦rɦrq‡N4Çû"<]}œ&¯ße¾_x)g®I'(wLæq?~:‡¬~ò-ø_‰Nóú“Ͻªt­ukUÉ•¤Ùÿ¾ºÙÁ.d€Jp> stream xœµ<Ùr7’ûÌÐGðMÝu÷1û ÉòX³3¶¬cv7f4)“ZQ$uplÏ×O&Î ÕÝ4¹áp«ˆB‰DÞ™ÀÇC6ñC†ÿ¥O>½´‡gŸØááÿ³ƒã¸Z;«V7u¶Ÿâ£Ö|õi½AÈ S«+ŒtúÐ;g_½ËtqYß¾…+Å…À)àaÒJ‘OÎkÏã5Ž}ìT¦S^°Ç)¼ÐfR&€Ý´ž€¤V¿T!â”VJæ0“†Æ´jky?ú:-Èr·:[ë‰1îdYìíÀ“<#—6BÌq?Mõ,Ä-ûa.ò0%B*º‚Ì„BQ2<§[û/™DfN„QéqO5Gîƒ@&¦=F¯UÀ32Ài}Ag|õ ¶ Ë)vß•Ï#4ó¤ ·1¬P,4Ã^Øq°/Ðé$ÏpS_€×“1°[¸\ €NK[§ ü‘´á¶–‰\rr…$¤yRž TæiöK*ˆoHí<ìWgþ„# èÐùz+_&üÑÉ.às©æd--àÈù|‘ðÏ“²ÊT¹tÆÅ¯óX£`˜Æ;èIaܬ~Æ÷À–°ÝWkBété\N™¤Á ÈTDÌiÓÊS¸ËÂéÌðÊLÎ ƒð° [¼É»,™£j¹.=W’N…]U¤ùJµ—ØeB%êsÊå#"ô¿A°¬o”éKÐyfA“ü¿r°ï|õ~-–x%nº”_ÖÂÃ3hÌ«º™~ZYðQ&žH݈¸%[´wiH\¶Ð ’y¡3Üxo•“ ,;i$:P â:õE¤TdPýݱG}»Lè ¨´0ÅÙŸ$²ÛC··¡Ùë.·\UA °&’v y ’Îf‘¬ê=L…0’RcåÖÁzÚ3zà ,$xæÒ玎rߥ­$w&fRèͰNøœH¶7$FBå|’ŠÏVí%lÖxÕ„¼ËHÉnÈ43¤¾™0´ Ž!¡¦U—•®’ü–hzj5UÊýy“ƒ:É2ÀÐ….†¶Ïi5R+½_EÙû…Z~:«{ßÌ÷ÏÒ+K"cÆZ§að¤ÆZžYæYìÑó,RÌ’rÊNF4nÝ!‚‡íAÛ¸Ú8fîŸ^…. ›¤÷Œò Œv)çàš”F1z/¸ Ôê?‘Ï5GKþ-¾÷´üo𤥱<ŠOí8BÈ&Ř€}û„߈,E¥q“eÑgÚâ:'c5 œÏš`ØN\3MëÁfEºMýâkåÈ# ëòuOrÜÃÂgh“|dþ 3 ëmFÑ!—s¹bŠ*h••Xö ÅðÃF4¹ƒ•„ý®€J|Áž‰¢ÒЩˆ“AiH鑲Œ°•èlÁã>ÂÅhžW½Ý´°¤Š4ªת„côX—Ua¾OŽ/ÈD•™áw,ƒQÂWêMâ!´ùýYB S 6Ô%öX¡ï¢Õ!p¢ÕoÏq„ н’RØai%¯7`§µò¯+½g*-^’à|@¦v`ÝK/oO¥Î4Têl ÒE¶ò<¸™ûÒ^ŠGe'…2³ôQM!C8¶W0¦lÙMO| "8%$µQ£&ÆÀð`R.x÷ûmXAà™g¦T«2"ƒ€*2™A:å×à3[“W!¦€ñZ:ZÉð{ô¨¬Í@ÎKöÈ»;‰"ZM‘H+ÂNÒÊlNûIHÚ>¯äO\«v¥¤GW”µxP+%å߃4Ö*£;á¿+˜rZaæ:(•¡ÈŸQ4)ÇNT—ž‰RìšE4Ð]MB Ÿ)d¸R[æ[øàzÈ„xH¤'#"»!ò7ìˆL*%Î1n!¢+X„ˆÒ^N»¬Œâ¦EÙ›¹O;Ž`•´VjÇÑëÙÿÂ4¶gšeÏø÷T[â&~q#Å“R>®º4)SbÄÙ˜ªÂ †¸B³ä%¾ª ñenh‚ à§¡õ¿ÍCÈÛÛ‰ ˆ¹‹„ ’(È¢ÊÈ$c,ÑeÙÎI1ÌvÄÌ2jò%©ð®b5= )¢bæ`[«8I ¢¥íf†* Gõ’+1Ô ûýJDUeê¨6£1Ú)Oœ<¬qN]¢î”Q!ý€iÆ%ìÆˆJmÖ·1¸W”ExGýóE¢ü=þ9ØTÀëºH'±='»5)œæË.!—”<Ž„³å q&3äOnPÞw¼)KŠFz°`h íyŠŒ‚‘æøŒÎcæDªÀ¾éãEÊd ÜÁV‘ cÕmUA¤$>R "bŒ¯=µ]4ÆØ’/ƒ€Ij¹Õ¡Rü4"°u3Ë|$ÎÅMUh´xhðj‚#ýÓL'£/:oJj$ÿÆÛZ D¶R,§©É܆s7qwè ^ЀâodPªÈ4j+a“¤™£99EXæ9 Û˜haZݳÖÜÅÇž¹bþt#ƒõ¢ç:{4rŸT)MøwøØð yÉ4¸P1ËÙÃd v¡ˆï>¶jP*:ƒB1€U¶nn‘ˆ’{Mÿ9Í"fD`÷@§¸&²9€{9³Â–“Ÿ­å5/Ý@Æ!|û–iÆ6|’l!Ã]®Èé@wÕ¤+ÒüÀâB“€…øp2˜”·»r¿É}"zq‘-|ôÈ µ\PÐHûù:bàaîr]b{LvÝ1"2žYdž¢oú½KÉk–HQCˆa¹ ±ó$ÃŒ‚D¶ÓôǨ€Y{Z _ÊBçÆuA«Ü½±±HïTu|t>$÷-öÙ(‘—#ŠÂR»å|žýK‰íˆÉMT\IÝš kˆ–¶Î¢ŠóJþ¿’ïñ0ÇŒŸ^Ìm8â6ÏÍëQ4‚(Õʇ]%eÐèKÝE“É´KÚ¹6KVc ìrÛ£×¢zGbl²†è Ûä%ÿÐä%a ’uÛ¤aÏâÀϲÕãÏ üÁ4\ðÓVoðç%þ„.ÿ±Þù˜GšbŒó•CÂðvgÅJ#«mÔ‚È ÿü­´®„wà¶ W¿-ï/êûãÒx]?—Æ·µ÷¤6ê¬:Ò¯õýui¼tS?Ñá•w)m’ßÕž€ ö‹¾‹9ο""ÿ¾-xÅrSôTê#à‘í¤Ç Á·¡VÔF™P Ÿaú}kÆt]õWõýW¥ñï«Úº)­¼6þ}]Z¬:íÊÅmW¥ñ¤6ÖM»,O_F›BÂÌ·ð‡6¢#‘éñ½¨«æ³üHûRûþÖì&naØ®ÇøƒÕM«'øóuj9kpËÈîé­ÚÍ-‹»w\»Uœœ¨wˆ¨Šæ ÃÅ ÈŸoØä7¸Í ÷Ëèý?¶ÓC;g~<›í>žÏöã›ÂCo’ ¥.Ò. 6#¿¬<þTÜKü3ü„.lù)Þ 3 v´¯¦4êÚø¬4nV­ ŒžØ³mÿSýàhÄ)Uê ÙW”§£©dàŠ×–{Rã§‘>kzføy$»obxT‚*) Ê”/e: `úDsn2jëA:»XRp†/«Æ€—ö·ÊÆ@‘£Ê—˜L3$.¤ ä`›^ˆ¯°M!?^KËSk–duþ<øRîà/ü?ÈjÌÁäm)É ´”f`7þoÜ+G1ôޏ4€ñšYe.Yͧ“eÃ|÷.ghæÃ¢á<*âî*H–qfÃXp5ŒE×Öb®#-¤ ˜·%µiŒa”—8éx"˜UvR]HDSë=×òÖY¸°©ä%°YË—Ya^2¬B!^HSí7|øQÉCìÁj)å4+¾Îå5ô_ \Ú¼wN"Í,q;âm=Ú³è`ÃBBáïrÂnñëaaá`DµØcð>ÊÁyB6´;T3.¤ë‹z®çÍZä³FàÐMHxÇÚø­¡u2Xe{:–uðzŽ#GrQ†Gr/f˜µB!kbü°‰9"Èêç’„6á$  ï<“#, <¿ŒÁ}²Z¶sXIQ¤ ÄÝšKÁyQz".ц*}õ }ÑR‰¸X“(ÍÝ%€! ¥äþÉ€(õ"ZãðU¼‘èaOLH7g1˜³†íI§šƒäû`!mÙúèdYޝ¤Ôî(ÀO«éþ´Þ²ø®7VµÞÝÓÉXfÃÑD1i&ʳ•Žc\@MLJXÅãÐW ‰‡?„™˜ §!U¤eÐÇR`¯€¼§Í¤Rù2àÆ t`“ ®Zæß:£i r©;n†ÙH”K K6@V[ÍlW--€ Â<­D‚,ø5TQç²VÞ†X}=×5ŸæJèúò4Ͱ¥ m8´­Ðöy{µc£ m¬£.Úxf4àž‡š5™7@7Ø~:ŽîX] Z-Wz §SgÐÈnÏ´v¬ßc عÐGR'¦BV\ö´ÜØÎJo9d†ãçß–úÉ 9´JÏáÉÝ—H)ÅþÓ*ÕüÈmtNî6TÓ8æÞs»šÅZ¾&‘;7¯›ôm€EwU^Q—„ϺƒÀ1UM ^D½gän!Ó#>hö”z>Í)FœÐ¢µ¼`Mç2sÐXh²-”–×ê„‹¥Äl!ÌR,–hÇRê˜nÄ(¨v §$€Ö GkNwž¿Çá…,07(P ¹-J´*”$/‘c[Ú¨<-§EÏš¦ê˜mM5žÆc®ØÏv ©})é³QËν‹hzÅ,`]µÁïzvG­k^Ê„WÕÐxZyã­ )1†^•˜hUÛBUzßÙ öx4˜6h,$†ª©TX)¿ÐÕzˆ»Ž*Ú†æ÷?ªX«ÔRš2"V¥¢"éH[ñ³¼trS)m–éÀɮӇäŽbnv~HžÒËÎL'-‰\t]¶•7ãÞ–á=ÞD¨6m>põ¸Ø-VôzîòéxÆx•ñ³ð̆Z"XyU±aâCtȃöää¬9ŽñÈS­ SRz]ëjL Re8ºñ„c*-÷\‘ˆ yNññã’‰rR‘ÕrÆ6P¾×ã.v{ô.ø‚ÅÔVd%Ï£KüoËäÕhiH&…RÈ(½\çExB±‡]pCÃûÝû>6„¯¾K­9-ôÍ:'Ÿ¦Àº,¤vrŠ0GvÉG)Ü^óDK™À­YÚX£×z᛽Ƹ¹dòYn¯¦7HnïsŠY{µ+!Øf†¶%±JÊdd‘ãF¥«,¸ û¼õdʼJ•¸î@ÏÁ"ßY¢©¹ëÎ-ÞÏáu°†‚FØ£¤2€°¥ŽüÇ Cö èˆx òNURûª„¿-‘t2ïí}x¦QO²ç?ÄÉL!Öµ_ų&þÜ–Ïu~#æ¨Qì6¯µ@:îÒØ-±ìw2¦ŒÔ®#&ÚÒ•åÀuö…šªÁUéŽ®Í ‰ÛŽÊŽê5φapÍj™“Ï@9ßpïìëKŒpt + kPQ¨Vïä&¨Æy¨Xûò2ž´ªvÁH­°@ô„|“t{ÖˆýÔø}Ö _Sãw­‚`žÈe¢<ž–Æ7u”õ}«grJþáÖ"™^y¯á­€#µèl8 »ÇC? ór‰t1·hЬRl®çÌfy†[gªœ­Çw3•«ªÚ×ÙFo%ý–c~Κòä!wÈâyeÔ§sÇ4vô¢"Gœoï‘æ/›þù¶)iÅ2Ä­¼C%ãî>¦·«åŽD˜g1˜Vèâàã¨h±óÃí`Ü/ÝU5’b¦Òwíá8>Š1.tƇêdP"OŒøÓ´EÀˆ3Æ<õ–ë&kØ'÷ûÏÂ&£á³GÅcÂNä™ÝM2ª¿¿è‡iÐT(æŒêÞçpI@ç}{Þ=„±Ìr Aþ¾Õ”y’˜Î×M¸í…óY—ÜÉÐIkÜ®ÂD|Äî)ìÙ¨d¼aFÏŽ0.Ö †h¦SàB½S`l*R9ßÅðÖRR*cfÏ£0G†‡¯ 7äÑQQ¶èHFYŽz6¶Áe'ÏêZyžÅîüfï`‰çdÍîs²Ù$&ü_ÍÇß4Èixž/ŸŒ›Wì’¬Ø0ÏE‚ƒ·7ޤš“î,Œ^Â-NÞSoŽ­”Šk´D@[ üÍÊÖáÅZL’ Ô·¥ý´ÜE jâ=™Ìù:Þ'“£J†Õß²”øÞ¯‡ ³Dàû+ëšB%'5UgùiMî«#'²D4Y¯&E5¾ZEpÞû¥Ö’'rDŽ„“ø?á¨&UÏÁõ@VEª\ªÕ3u6òB¼Á?›1c:†”CU¯*EpŠÆô›ñbw(åqD9ÃcW£ÕD¥Ò¸Ï^üpðñÜfnÝ…Ü!¨npîЀÆfïñ}òüàèù_¿|ºy{pô_‡üàè[üyòâ)üóüëÃ;xöüð‡Åû};c>Ýï+¬Æè¶A_œ¥K~ïCB”Í9XDª_”º±A¢Rêî~Žx¼òÕH@Œ|ÂYW““‹Œ‘}°J5FÍò‚c]Årå†oBâøØÉX¼ûÍ\k|X8ŽUnXšJî´£×Xm3O[U(ò>AA«Íœ•ZO3×DÈYÂÁ]lëNM<Çft¬ùÆä™¡¶±3´p}zP›Û®DÍ}šÓÑ&Æ/æw2:zßåH’”‹œš¸Öã £L¬¯¸c°Va&,qŒúDüª™°ÜC,Ô¥ÐO<ýÅ'Sü›i.ˆ4»¢R²ãÕ³Le•dŒ£†nóf[MìÒ6i†aj;-]ãþÜϽ½[oðÖÙä§q¸£’Ÿnµ(@aðÒm Áމ"Z[&"~‘óRéìVü^È™·ÜpÐ0=Mè«gÎüTG–“Û¸4ÓÉà®Fwý‹Núáà_ZÎäendstream endobj 161 0 obj 5826 endobj 165 0 obj <> stream xœÕ][Çq~'ÿ†}0 sÑô}:†ØŠí$–-[^',^î’KB$W"µ‘è_Ÿªê[uOÍÙ³Ü̓-˜<šéék]¾ºµ¾;›'u6ã?ùïË7O>û*œ]¿2Ÿýþýä»'Šœå¿.ßœýò) O¦8GuvþâIúZ}æ;ÁËó7OþºÓ{·³{÷·óÿ‚/Œê¾ðvš-|t~ ?ßÌBŒj÷{5ŸظûÅ^ïþ°?¨ÉZôî¼µùUzjì²û žªÝi7ía‰“ž—ݯ÷Ø<ø°ûOl¾ÀÿLîdÑÊîþ´?8èÄFÇ| ´ž´âs‡“ÖÚûÝïëôþ»þbÓùý^ó1†Žkzšgcü G³ð­¢Õâ×ÿŒŸÔìv¿Á(7«ÝŸë©ÇhŒ‚–ú†Ù– à.}±?hÞ»d¯ó¢uPéPúc<äS9˜Ž1N^šÍîeÛ³W0%Ø^³{¿?Ø`'çôîrOkÝÀY¼Ýë09 ŸýïÞPcµ{^[´·ßÃ2—ÅÃâjŸé󃃓°~wÿöº¼zÝÚ˜eš•5»Úa2n†~áýÎ+¶…Ý›=,Ȩàw·m—{&Ø O«šçÉše÷¬½ßOÆØ˜Vƒ“¸joÓB´±Ô.„ Ï}r‘W›_ïñ“ƒ3¬ÙR‡/à_£ªÝ7Ãþ`·ö‡èÅ„èahZ‡@²Q®ÊÌ Ç~t0y¼e}¾ßã© ë¥Ý¦;Ü2{ì[Ç|.ÑY:ìÅMŽ >o¿ø±à¬ggò €Žq¾JÑ|ŸÕóÿ€}ZhódüÊ“ j©ûæÔЧ‰Ä×<ÉûWzPf<ë´àܻ˔û:×Uks±Þqxãg²Æ ÁÐÒŒ´ss?ãÞÓ$œwcGÏŸ;Û;ßò96 †uÿ#£Œá¨¿mK¨|Âÿ`¬æh€î¬‹øFÁ¯×b,‘†1Ž8äA´š;ÎÃÅÅíþµN’GváòG‚Vgç_<9ÿ—¿Â. ¼A‰fHôƒØ,¿P^c¤ž/ð÷ þñÿ¸F ™g¥v¿ÅÅ]Å9'ɑڽÃ?®KÆ%ì~Јр^)_Üiù ~~èhH$ùÝgí£ßÖ÷ÏÛGêÃÚÛúð]{HŒ½ÐL^Ö÷í=Ê9T{0Ò¿¡œœwKúë²¶~ÙZ_HC´‡—íá÷|ÚëoÞׇŸ"S£ói½å+ YãÜ4/EÖ¼i¯_µŸ?¦ŸH\Ï×;5Ÿ_¿ëÏÛ§A{¶?xþ‚¿ÏkËŸÖ5·g¿Ã?þ·°£–ˆ¯üIdçÿŸ¨ÃÆ€‹gç}ÓC~ø½tÞ¯¤–ïÓâ¿—èçy£¶OêûŸ¶÷Ÿ´÷§¿6(5SÔ…€Þ ^ÒA“œ¸ßAÓû‹ÊýÝÒíÜ«„*ô ‡ˆR¼âûòQí£œ4#‡_'¶ü§8ûÆòŒQŸIÓ½ª¯:*i g4‰ñ튋‘u/WÌ[Ïû}wÞ+¸šÚPMT>ÿ¼ÁZ˜âhvmDø @°ü¤;\ùj?_C3šÎ`eˆ`iX¦¤/Fu ס0yMÀ£Eg¨j=hoglcG\ýC³pX?u© "³ †ˆp±ƒe™ø‘_13îõ_íŒðQª¹Á†Ì®Žï·„¸½,0¿jPôö´“6,…bé 1jž³ö 5ºn˪Ci`…ˆv€Ã\šØÎÚ:Pù¶œVzŠSö XÕÍ¥µI¢0oA/ “Ùшª¢Úü0,œü¤?Ào4T9Í´>Ú/”.QX£QY.Á‚oÒk„׬«d̈‘ü€ Œ}Ë ‚úeëZ²=; «ŽŒ½¡Ø‚SrÚÓ2T‹Û¦ÝÜ fx&¤˜ûƒs`4|YÕ=åð¹vT_ŸŒÕEû-mU›y¢U¤ãätå‚јNÃùËFlßß+Á®CAîÑÌ_ªñ౟M›­¬m#f­1gÄWxÎ •ÈGt|…bB![ÞL:Tç°ÅÞ4‰†ƒ`Æ€¶!N(ÛÐÿâ‚Ç„lkDÞ*sÎ&c銷™@‘mKuÁ¿Ñ%· –â§Hz(î6¤ª—MiVôA;`‘.L§–×Çu?&Í@3a8Øjk8iA cþÄaž”2k ƒ³m¿V§“i]1Œp_&}³Ç‹¼<:æâZB†u ÿ÷ºµ&éâÍC4¦LØù£BÁ ¤¡”?ó“d^ùàмU ›²*ö‚&6÷Öoxš–à+×{ϱÓËF¦.¢³µnað=s·á‡[ßVÈ`Ów:¦ÙÔ! [?d!Îôõ®°¯×óyÙsÉ-Ÿ•#'€O¨ƒ­%Ñ…Fg‚Aqò…-.ÐyhIWWžkÅrVÖˆ ¢ Û¦n«wãîÜ3€aÒ¬ÇF­Ò'ŒwÛ' 8uŽÃ<ô×ûJö(”gòªïþZ†Œÿ²µ¬_¯°îS”½æñ]FºéCSH7Ë\œ!ðsE>œÍ°—L>ÎmÒ<ÊýhH8¬Œï:›emÔ`½Qc¼§¸ÈSQÎ3xôCö:d´ß\èß0Ö@² ޵Û´/}Ð$>mî$Ñf äœÜDiù›‡°ª‰Å{N ¤4g Á‹;Ù$ (ZÀ0r†±I%»ë6xR%æg]ð]ñ½œ™mÇ úá*ëpú¾þqZï£)ØyRYØ!âétÿÁ*Cˆà¨ÃÛΚ4ˆˆü󦔑–ܧ²2©^¬‘Ë¥€yû`Nãk€Â‚å1§!ªS—$ÙJtiöA1 r÷êhCEáâQE “éÜs yÿz­$Ì÷N¦EÓŒ'4Œ C\wÖC#æ¡ ›ÌµžŒÕ±Ë§É(„k'Ú»XQ3Ž]¤MŠD6êgT)¦£7P0ƒ:õšÕÁmîrXHŒöäU.Á¡PâdE†Žak°ý{ㄆ€%ß>d#c³o²!‹1cظµÉzLó ¡[E;¸î±Š,â·Ð!™nF=!¯·k`DÔëWiDN Ó§¦ãFBê ø…ÍÆHb@øÕé(ª:Öƒ˜<Îý^C~±ã„¼Ÿn Ý^&HD[mæeMÝ;ÅŸ¾Zk¦!†ÝO¢ÒR´·Öh[çzÓº8$DïÑ=è8h( £z"Ö˜þ¾ ¬ø´#úa )Âx Á˜Ãàq[æÂÔ äÏÿ\“<«€›£[5y²‚jÈ_ȼ¢BÏ+eÎ ä)“ÙÃg¡jÖÑ †_n¢™¦£gÅ8`$k¤ã^©Ìøšì`¶÷‹PT[ÓÜÑõv»¨i còJ5[PÑd*WTƒ‚ñòjÞÞê6B(®à§²”¢²Ž ‚o›‘|¯Ô»Ë ›ý pÃhµÍôe„åeÁ0KoˆÞŠŸJ¢°~Ó³…Õž0ÆÚÑýÎ+Ùs2e¿ÓT\hŽ…[Ê!\a½Óµ3ž•#×®.ZNp!'ÇSŸƒóvM¹ÖÖN6x{' Í–^aË5Ñ–mza¥poVh&TÜéVѲ°é´æˆI¤,‚3§·³:n6cLÕ Z µõ6vAãF ¶| ’m¦á²pÙ&GäÕå¢1ÙmÃôð y”¾c'z;J`– BŽÐðq —@”™”à‘BJ )¢“Ó¿‹•aûPN¡ŠÎž©œ%d”ï@Y©‚vHP ¢‹¹Rk¼wÛ8ï&À†dœ*9rx_³Î3„¢íêõÇŠ¢õ‘Œ$ÁUFA³Ó½âTÛÓðV@¼àPØ€G‰NÊñÖÀ gaœB„-ÂÎ}Ú{Åõ›,¤RjC/ñ{¯%r;Uƒ°Z×S¹KÁ°¾ç•зE‡qÎÇ£®ª‚ìLüøhhÒÔO m{^ã´CÛž<¤KÕ.?M–%Ú;ÏZkü*þ÷’:ñRÞÀ fB<Ù¥½PgVFãž=ÆýRþV9X,£ »üZõ7Ê@èL w†×µDŸw…×Dt˜Ë‰é1&*ð‘ßÕ Ü5Ä¢(QÉûaÄ‹48ˆq‚c*§”nÀh›^<íR´¯‰„µ‰Å ¥&ÉY¦‰r˜¾"Ïo£Éu’¯`›¯„¶¬&îÊXÔ1ɪSŠvªO¡Œ~#?·=ñTÚÛÊaö +µa:s³©rtJfDcjú±KLø¸¹Û€%—±q°ÔyÅù X²ic¯,k§N›ÏÚÀ0:Ù,qñL Þ$; Ã4¿¨…‚«Ž‰ìúŽAÜG˜¿¢Ž“õë}Zû—ëÜe)Q}ÑÃrY²!×™šÉ ŒáªØUv4ŸrW³$»¶ƒf¦*¾í%8YAQ²‚`›0N¸©òz?©týó}-ºü¤à•GwCO¼„éP6¦W0èEσêÄþ3Ø{zóvÞ‘\½Õ!âÁž@¢J¥þwŒŸ˜%S‡?bƒb¡çR°FM¢ØŠ¢‘)+%W=õ"Üb¥jÖP¼p“Ø3:kƒmX3Å]œ¨ÒD®÷Cîgzžj–3…dè5– X€°!†R¡f1³/X ±il¥#pryf`(…±;¬(ž§yQíp*Œ€£µhÔãk‹º¢|ÿšz=¥#•‡ÿ ðŒç-ß¶Ž»…Ä-ŸƒøQÅ’‡šLô©jÃX•Ù5ò.¼€‘–Ù ñ{C“ÆÌ<²½ U=MÎ`(öUa‰™µ•IY_8Má{ƒ^qM®ž2zÛ@SíRY÷L"ç~ïßeæB¶-ÌU²]³1sRÑÖ* |¬hkVÄR[´%Yb¬ƒšôPR:T\6R}ÊÁÁ,Wg\óöikz‹J”ó}ÙàZΧÜoXeÐ2ZÕ}Ÿ¼¸Q‡Ta¸%Jæñã8ÿ´ótðCÌñVR’¡ãÒŸöXéß0Ìš":'Y_=#¤A Ò ŽÀä:Ø–D¨_ë3[’Y“[ÄÈÚþ“FsBËèm°ÉÙ°h "‰Žš‰U4ZŒ÷HéÿõåÏÐØÀl °ýFm³Ígò›ÖgÏÈE¿‡ nºØ;VæXø‡ö³W4ƒqÄî´VêÝb{ÁŸ'–U㮺 U£¦bn eXÏɇºŠeõù#üþœ*¶apŒÓzŽúú÷ÙWQ§s·×AŽ‚JuYÇù¼ /'À¨ÁÐ(uÕ6q¸øä¢¹i>V1 æø @»>©¸n#MPw)“9MÐù1M¨Ù/¦G®N@ª—y©Ò„B—ƒüÙ>:*ƒÓ0l©Ý¶¼c¼æÄà]fÃHg&§%—Èuã,û¬}ÙóÛÅ¢ÝSNRºd DC錋7« 3ÛÀ{;{]^“™›oÈ™~ÎC¯ìbf2Tvj ™šÒógu¾}‰¶ 1-øe(Cœ»KÒÃgzH Ž$åqù#µØòº1ÿvµïùžî¦²šcÿ¦pR8Gådù6"ZÂ䯼–}bMàã(õøCr31-äP©åýõjû éÆŒ…ÿsíØÿ—Ä`)¨/DæˆBg³V»GeDrbµ ‹òøIN oYE¡`®z@Ç*n×f„ÏÝa–ÖAÍ ^Eí[°¾™ºã…ã8Ëð¦‡N†K®\ž¤KEnÇòã©îøu«»Fç(]w;ºo)9VúµË6’`¢žæ{A€…?ÖŠ‘L±@…Qœ¤ E Òë´LFR Ÿ}²oí´HW\~¼Ú Ô^ŽW¥ûšNP1%ð¶¸È9R€(_á“3¾+Ä`˜oi¬ÌEvÀ &á«Á×”Š,9[m׫Ӗõ<óîÖ$À¢H)¢%-Åß Ï…ìk¹ìaÒR”~U(á”8¯bÙ ¹°"a¿â\ˆ'è·RiŽp!è¿l\=2¤ÃÈÙÆ}Ê Õ¸I¹Éòþ}u™ ØO—™EøOe.äîòf³74]”ñ W+%Ú-Ž+-®¨ŽÚDŸïú¨® 3—4%ú?Q\B(.Èšê^Edêäz‰ÞºÎïcAß*3žž ôËÖÅŠsðÒÞÞ½tч„´©nèUVsNÚ/FsŽß/øÞå"”PÄñIñà`2úRhÛìËÕjC}ƒ|Á­xÙa}º©N7d#fIMJîË©K²­¤HªÚ@ç@4˜O,Tµ]­9½¿Ni°Pض<ë5¿|ÅÀ Àm Œ\Ÿ6Á 6iа„ôu½ŠÞmÅÕ©îòˆ¾>r+·€]°•»ƒÌª o~ù˜{ÉÚ ßÉ:Ü<Ð%e¤«ÖH—)èÁˆx7ÑÊØäZ#aÉQ›éF Q!296ɯ”Kä»VÚ•%€ç¼"¼Îp‘S7[ù{/Þ]ŽÜŸ7Ø¿Ý1ò[\B ÍÊ·¸0}¿5R™MË\³ž8©Žîõ>ÏêêvÞ¥ü·œn-¹ ï²eëR\óH6׃ö×,±ïó ”Û&¥Åz¢qùZ¶ Þæmº‡G$kqÌQKžpüÚ“Œs¦V‰/ KÁ¾£”’z6-ñežLŒÁ.ð‘Âl0T{hä÷˜«·»_Ò @ÊHò ]*¢Ôˤ­ÅübXœñTÛ¶Ä<ëäþ¡K ª£úôæìƒ£Ôöôƒ Û2K:^O.¦â©üúü°ÁH}¿ùÌJ‡Èf†åü“²‘¨—<ÿ:õm^oM—¨;€,x‘ÇۥȕÛBøï 04“Kwtndû—jÃKehÛUº½×¤|W&…ìÑ…’M$xÒbí.œ1Ø<9õY¬ £kˆ‚rϤÌd XÕ³á9¤7m9%óÜÒUr,uáZ ’ç&v¢¤Ÿ°¾ÝD¸ Ç$›§²#sˆj®nß(¹Ë-XrHJ¥ŽòkW».xåžjĨ$]%‹Üë’3*Ü_º2ãǸÉ&ø„;“c~î¯>·:—ö²¯ïcf6þÙ¾Ju ®×iÈa°b˜79H<ûæ pNWεéÌn`1-—ûT.ùI‹mV&Ü/“„š3¡­ÆõlU6޼—õ 'Ϊ"˜ëncÞ2|p9ê îà¯ÎŸüþù?ˆL7‚endstream endobj 166 0 obj 6271 endobj 170 0 obj <> stream xœ­]Û’Çq}‡þ† =Í8¸£®{µ~ $’a‡(ÙÔ:ì°èp—hXˆ$Ì‹^™uͬÊî™Y"-gº«««òzòdÍ_o–“ºYðåÿï_?ûõçáæÅwÏ–›Oáß‹g}¦Ò7åÿî_ßüæ.2 >9­Ëªnî¾~–ïV7AßøhOJßܽ~öçƒ=ºÃé¨O!sPð&}p—å¤M8üñxkNZkïÿv¼U'k]Ї;ü4Dµ˜Ã¿à§qUK8|v4'ï­wåø®îðßÇ[›þ4ôÓ?õáSD¹“ŽêðÛ>^y  áð»#Þüzø>4ðp·>9—:C§ö9üiqk™„ï?‚gü×QÖ5Úµ>-T¤ "Z ®"¼M;œßmuAÃÃpóK¸e®hC÷•H:SìV™“ó‹Îë2cáƒf]®Á–7WŸߣ9­Rhõ[Æ"Íiá:Uï'B÷¦«TV ,†bæ”\ô¶ïλþgÈÿà Äxí;ü¶/ãÖDæÏ¾8´k‰E#Ã~qÌ+°¬‘*2íïŽ ¼¡Ò*½"ï ëj000Õ"X”æÏQH㺘÷GÍš–jt¤ÂЇ'ùÞaò«,èÙd$ ‚}óUúÐxA1I`{àN0}ÉîÜWuÈêÈw]”ÄzgÑߺ_e™sàHw4¥Úˆ´N ¶_ö^µ‡T3ê,™3Ñû,ùéE“Ü»5æ÷-ûŽ–K,ÿo…MˆžWßð'b–%'&¥EÇäY«Âè¶Í6ô)|Vÿ‹¼åwx“ƒ%¤>*m¸øÕA›QŒ,,ÑК]ÿ—ÆŽ¨hÙG(P¡*âoòז͇».´€—¸.íׯ} ‰eó¢Ðj”±ÍH«\>x.c’ù²·2µ@Ñ÷ÈÚ„ÉLÕ¦«Ýhoð`ÇÑÔ9ˆ‹a_ˆF½ìRŒ/¦Ñnxî4Šÿ˜6B­&'˜t(m‰w=cSl‹õ^â4˜@T±hGZî^ÊÄq»éîq+iÖ¢ƒ.›($ëh%ñÆ{a0n%­Z“ »Ê}¥8åÃZƒßU²Æàz‚ŸÄõ$ǹòE·‹N¯v™ €%G°z4$UƒaL ÀîY”2MRŒéñêz%šT÷ô_è'¸^–%ßR·ô2éÛêKÈó]Ö…æ´jJæŠa€•3Fªœ$0EÑŸ”3[m× –²ÜºÅÚ/0œ5²‰§+èÚ,xâ '/òæ/9ÏJßž»ˆ×GÈÏ -6GuÈ[­ƒœLá€ËÖè4$ò­…¥"kbŠmÈÍÔD“%™Óiµ˜*g€é4L Šª¸°¤üÝEj]Ñ*NÉL0Fte}\°™nÁD\ÑXMH»½'N‡<(o…¶É›;®=·ÿÆ:¸@`Ãó#\ Ù¡>‚7‹Üõ¶{žÔ@¯ñ´ê––KzsÙà ºá\J¯ÒªÕÿiá‡D2´ð›¹’®RŒD,Ù¤LÓ*1Ä Inô†ú±«®w"ˆ« I©:üæ˜æÆ¾O2À‡ÂARæçÝÿúÅΦ¹'øbÒžÄÁø–'iÅ! íL¤ÀMˆhÏ7$Ss)Ój`,‘^ÌšðT‰ëˆ<Ôg)¦i«-͈°}cPM÷¸I^S(ˆa^&ED›ûÍßç©.ë*u6e‘ý=qÁ%ƒIüý³»øsIï‚uxŒ0©?~8¦we@HIz—¢îÑxÇ0•× ˜\€é§Û“‹â³pOú˜<8›¸Dyu&?tãD@×)n®YânbçVäÊPäA¬JŠ”°mדZ‰2Ä ¡z&πÚ)¹È÷REY@¾J“åáÔ×Å6†S4k6ᙜó©KS§ŒyèæSwÜÁûd’6¬O›äŒvà1ÌVª ë˜ÃìnÚT ‰ãç“:.Š ZÕŸð¦.-Èb8:×4 ™ µûpåcÎ hófö«aBá7Ãâr9W¯ìÚüÓs²*g˜=E•Æ"®¡ÎË1|æ‘)QCÀ%ký‰.Òôž›‘5³-a¦:9`]ŸZb>1g|K½IN9W ò×zù†›ë+£êñì‡8(¶]€ñsˆ¤ˆ‰à÷•Ú÷ûm-Z¢] !z© Cø¡« 4“öWIBWÜ—´$)„kÒ‚`}LX‚ypS6æREÛÔ—¡òA|vO×éOÝaòµ•)¦]ëeƒ­‘Âöyˆuµ­"'` WWÃê R°”d¤U<}€43¥ ë/¦™ãôWÍŒ“Gñ¤¢8#*Üš÷Ï®BMb{òîŒóC6Š!úë}l’„²§8?¢)R"ÜŸ^ªËŒ×\V-aZ3|Ó àb^‹j¤¾vAl–kqGЭÔ';ðaMÑ*Ët`ì\‘¶HHØ®¶ºÌ`^וš×§×¿HRRØÝK«u†º(P]Çò¥Ê‹‰e+•uy ’Yp±¸!ºý®Â=Щ— †ÛÅ´®±D¥‹øFR20ÿ¼4¨&𡞪f¤I[†ô3ïC´š'[¨Ï{0cñB`V¾ﬞ,Êé›–ddrÆCfà¯.WÍ™z_PVÜNÁ®??ŽV¬üÞÆ˜×Ú­´¶¥4Å~Ô £ã+~Á/ŠÔÌh˜˜âsøâ[Ѭëe‰)­Ý45yû.(+C>‰;R¦A¼H/a—l®: ¦!Õ;=HÞÓH2H=a‹ƒä2sæR–’{’õWI4HŸ$‘Ãüuae–ŽIaÉcµ¸¦EÚ&LE|f±§v ´ŠSC|,Í@³—mEEÆÃ‚oW_k…F„@È…­pe1¡ ý€Ç˜DË ñÁÄt&ۃ߸©skW„€Ìá§„åKH|_äIUFªê°\h‚à(#Ê ¡GE¢6—9Í]Õ\¦îÿ#Iƒ:Ü”7ÅÑé08Vý$¼ˆxÙ%|ˆdJe ¯Þ.ŠÞ¹/ÆÊF~¯èô¾mþß5~Àó´4ÐfÓȯѽΚ­n^tÐgFjÅ'4“×ý FÝðFZöz·6Íìf+M¯ôhDÐ\¾ÓƒÇ¿¸üˆhoý³-ÿPëÄl± ¯¶m·°vX\¶—Ý¥å‚Úf!â3ãB”ÊD=›žtœúyÌŒ^‘÷Aî³(ß´>\ ‹n 3[cH—‹RÉÙ)mÀR˜…9ë@„ª`¡iUi‡H ð¦8•Émæ-%1plŠd·ñ½”â2 е’6¼íz6LCÒµ‰1™–†ûï 7Éø}{§÷Á‹4«SºZ:6B†wæ$LcÉF|ÙþKQ)ã?K‚CÈ”,‚¹lw‰Þà4b¦ÖT)µí§•8uBðueW&xxðQ#IšŒ*ãvÅöÊæ5Ì |g¿jJŒãûnþ«9ïЮ9r$=QG×LÍÝBü‡ÅØ xc®%lAþu(¤”x E¡Ò Î äÂÆ˜ ‡£%äUäJ.é¶‚;ÐÛ0Öá~SÚAq-ÄaÜÂݨ[SÚÖksÑP—W©Íf“Ø^¸3{*S+5Wêt]-?„£)O§xã’ÀmÓÊÓ$Oþ¦±1W=“j1ŠÓ`¼xòQˆb®ä`¼“A'PÊ#C,Š’Ø qú‘-cñ­0Kª&‚~_1Î)çðÔê\~vãW®#¿ræo)ˆ÷aò0ar^‰Ì{%]¼¦ ™^—„—Ïh(b8ryßE†Ö*}·ðyœ!…´hàlYý ÞÂ)f¬Lk ŒÙZaÁ°³.Žo̺׻¤Hõ‡ÆÀÏIHB$_S²>é"üê;|ÀziÛ cà6ˆdŒüN™JæNF`æ×2úp”¾º“n°èy}w'ïD’0‘$1¹ “…ÛÈY4„0ŠÝL$Òô?/¨>3’—†‡d_ö@ì²þ*Ô¤Æz\ÿ\n˜$öxø—Y D}R/@µš0ìŒ0`ÌÆª¤)*Òü³5‹ÿfpS¼ÈÀº@DÌšt$bô÷ýòžzÃ=Û'6\|Cyí2êñ³{N.‡,Š™àf€f7—ë[†$íÌãÕ€€×k‰t—¾ZrÚæ"ØtÂõ!i·œiùŠŸqÌ8?³´xx‹QÛšˆ]있ç7äþ@Ì;X½v£¦Ë$ª0 Â'ÀÎ8¤Ì;=„èºÌ÷ø«Þ=Ñ‹jýv†‘p¨‹a¤‚Ù³W*ÂÄ{¨ð9¾ yì[!"kãq~ñyñ20ª–’/©dôýfù¥üDÆúˆ4æUUzÞ"˜›L]åYC;¢œáˆ5ÉGá씼Ûž1—ASv ZOë4FL–Ísƒ¹XQû=ìHÁ—«P×±êKÿî\õ¬Ã]]D¦¢j›¤UwS¸”HÍ) {{ÇÇák—-‰>'£TÔ[›õJQ}•¥Â•Y3CÙB¢ÃîöÚˆåh±ôVÉæ#Ó²°{KbÍÙ½…ð²™m“æå}&P¥p4Ó°Œy K4’"FEFãè´”`äÅãAÓÃèEªëH ¾²Ýd ßÛÊÁ›³dëYÅFãSÐpApä3ÛT®žH}«;¬æ7ß%Ò™HÛÛeK"øo³áÁè[*!?´$DJÝÑO®-ŸÁ‹?º ϲ(íöÙ ŠNkLIŒ‡ÃD¿&!œ[ÄѮ ¹% %å Ž§Lµ ¿×ÃA*¡Ûñ©e­ ²á:Pm ÜGñ…l‘Ï?ÅgªH!£‚_Ù•;¢=•ŸØ¼&KªïÞ²3-^Ý…¿OI%ßÊõiŒï‡õÛPÊEþC:¤c³…¬Ùñ¾Ø¤Ò¸I†­H~|jGÂç —K~ J\;3 Ù-bv×è­qƒšŽ'ä{›'(ËRœZ‚á.é#KDÉù¬)T,|’ý†kÒ´ ¾“†xàf ®ìf_gíPË¥‹u=áìY št·•‚Ô‚ˆÏøEÑêÿ?Â}~M€ö\ÎäZ pë\ú˜€ò #…Yò²°ÊŒ4¿lHõeÉt¥µ´ÁçUêžÚ‡Ìü 𠀿•@»´:Ï:@åÞ=JX3Dw9”7FU£‘šcÕ’ ·¬ƒu§š¡ éu¹¿#¾%Ú’a70Ö%‰…1óDT!u‡ÅUÐ:™E±±­» ü'@D kàñ-%Égc(X{9‘ñã9J_Ô¬TŸ}¦0Xš´­fdÚ–n¤´>×Qz8@s,ËÏ¢‰ªJØœI“y›aŒhhlZf +qd»=Tˆ”DZÖd —\¸‚’rÕQ1ÓÕúnI;. ïâs-{Ø…„ÅJé qödbgŽ6•4ó1$×&xàssÞÀuI‡°£®j¦2ŽÒ³Ðú ?C*§\œSî+¦¨ÀÓibÖÔ&‘½þ„Ù‹dä^¿Åó5&Úk¢Ð[y¿å¬•ãâ¬Dî44VÖþ^³g9`íÅH­jƒ½>à cÃ…£ÑO+îðèëûâ é&ªç‹€w»ˆ>{ªVwc$.Ÿ4w¾ÏUÄ*<ƲÀÈ-i“Ž¢{²^Í’ÚÖ™äÙ¬~WäC¸CL$6pµ‹:§2×mpF³ùÝãË„#)ÆLi³S Ãi/¨iŽ• Ûòa^´ „k¢ƒ ˆáÄÝ‹*ýŽêÇ(°ïÕ²Hb¾KÐ{jÉÈÞæmÓ:ÁS]â¶ý|V¿KÚt®C>€‰†VCGkBðÏ1+r]šÉýy¼Qê´B‧0ß–e¹€ù/*¯ŽEe]W<ÇätT œ¦êé{ W–ÁÂÃÕ)8¬b½=b²írOåI¹%­.ÞPç-Ba-y®ŸÓ+“úIÁ¸¸e âÍ0HPtf` 8<á’=Ï®>¦‚)_jØåC¦ï¿Â!Wmc¶çäoˆ'¶((ã¥ã¬5h`âU&„ØOšéúœ©\—ãW¨t”ó&Îy÷ãG³å­¤6п ÚÅ©ZnQ𴆛q¶p”)S£­€qqnïã0±ŽËoŸ¢ƒ­ËddzñWeÞViÚ8»—lÇ`öÅžŸšOh=š”s9çu ? ¾¶×÷¿¤í ·f ¹%$Ù'÷Ö*mΨ%ôÇ;UÚb<ÎÞ2,º)’Ó’™ŠŠÄÞ¤Vjg~mÍ“ q.ŽvÅé Ħ1Nˆ}ÒfÖ“±ój„Å:–”&rG…ø¸5ôüFÚÏCEû4c)wø=noîƒ oÑ*Q挫7xröZï´Š „ØBd3±ÿhø¼|†¢“é5d…+GÂõß9 ª@øÐÅÐH£ÊñÉ(t•yµRx°X‹t^5s S›6ÙwRàxR?8^+"ä×yH294ÁæÕÛ<-IP—ÝÿSš^n­È‡@@vEü ™žgJ;éH¦4‘Ÿê¨êËqˆI<ÐZíPŒ‚Ôµ ßÖão2éýIWaÚ=%˜ã8D›Hƒm‘F³èÑ­‘ó•?õÛå?IŸþö¦…Ÿ-ðÖ;†¦:ÅTŸR[î&׉ˆ1B7±œŒ­†“§EˆJú'»]lÝŒ¬†¤ ŠyŒÄ ”*qïÍ-°Y(-ušRwU3È,@Ì…©å#Ÿ_Û‹§ê¤5­wk‚ĉ/Åóñ7x˜g*àQ½KùŽ©à¬ƒnG7p{›îrjmrNýQú ²úÃi¿Ë§…¢'Ms³.Õ™‰@:1ÉL¤”‡J£Í%î½°*ÿÒ/¹à)¬2áö¥X½.m ={i:f^P+Þh}bØWໞϽó®N(ÅCÙEP´øÔ!‰®•¸Þʇ+¶î¸mTby{>Þ¿iÊÆO¾ûF~½­õÑ*¡cC¯¹ð|ÍyèpàÓ/a˜°YHPo,«ÖVo¯—ÌmV—dÒé…]³½–ª-½‹*é|RŸØ/RÊÏØŽ4f9p^HwñÖα ¼´ÅÔÕ-ä½—Åòï Dm4–$q+Aoy6T˜Õ2tR¥N^óžNG!•¸²–Ü?ý~IÿPƒ(ñÝIYàVÆž.–ÆÜ„$¥ùè3¶Æ2§W8\fÅRT®ô > stream xœÅ]Û’ÇqõóšáoØGÌ8°Ã®{·v)Q’,’õ úaÉA]€(SþygÖ5³*«g¤l2ìötW×%/'3OÕ¼¾^NêzÁÿó¿_¾¼zÿÓpýüÍÕrýkøóüêõ•Š7\ç¾|yýáS¸Ii¸rÚ–M]?ýê*=­®ƒ¾ö«=Á‡O_^ýù îàþ;áÅ“ÖÚûÃïk÷þ³þDºóû£¦ïè®mèÓ²8xÇgø6 Ϫ8Z|ú—pÉø“ZÜá×8åuøc}"µ¸£àN mCoKp–~{¼Ñô&l’|œ­ƒJ‹Â—ñ&¯ÊYàÅÛ–ç >îÜìá¯G “«ôáæúUjË9U~ĹüîxcO0‚Å /æºñå1Žúz‚¡À²¸cwÐðVÞ¼†gÜámjÍ/¾´f7Mšx–Ÿ„FÞk/~Q~Vo|‚7è°‡žÇEQ‹9|Ýšÿ¦uÆ„¬`üÔøÜ¬ù™(õÆí‡Ú6NƋᆇ£YO‹‚&±çN:ùXÒu ¦ö{^ÆãÊ,j$tþ¿ÉM|.µp‹¿~½Àq€¯_“$¥oÚÅ7õâéâ³vÑ”‹²ûC‡ªÍ¶¦¡¢ÿ~¨Æ­sov±*˜,? +Ë©‰.·g$+A$›TÞO4´ÜÀYÕ ugh]pŽ¿oNVꀽ¶Äý÷ñfÁ„Í“«Mé‰Z7Ɔ¿Ì‹ŽÚ.ãìut¢1`ƒôÜDÌp7MÖúÝ{Ërý;kŒž$ºÛ-#0xÄ6‡Å!ú•8ÄÁ€•w†Ê@á}Dé±s¢£{V´5@4˜Núq~¤cðƒu­• 5Ep'¢pÕ·Ñîù!ŠŒÚŒN潫­ªC(ÔoëOÖ™Ò´q—„Ø-œ¢„5ü&¹0"ÞMp|ÎD¿¶«=`¹”Vtâ%@ïÎ H¥®Q+îŸú3h ñãÕñG‚0z1 (ʳüÞl”7»5¢zéãAð°ã#ÂÂ[›Žµ;¿iàÚñf“[]Š:!tÚtDçÄw—ɇØê,¶·`: qm¤“}Edè‰jsˆ³/ºÖª‰E¢¼’Ý:“¨âTñƒ‡u#é0ç}‹ÚòÓЭeÛ(}Ë„ð2y\l”jQò›Žä9YaJ$ˆxi¢{ÿíÕÓù3 ¯MyhZ^ˆ #Ýlìd;†ïeŽ-2S7p‹1lÙ5'+ay¬‰äAxlš£_Xþf©.†­HÀ¶Äò{âתœ±‰+¢ý–Û‰1žD¿¹º(”Ý ð6ýrÌ‹®)÷’ ë³i`€@(Ð%Y–?5ÎçÁõ"‡’ѵîT³ZžtE»|ÙÐ^ÀZc,‰3f"8b;aÿï™àÇûAù›L{ ]ˆÿzÕî/2½h*Ó¨åM¯bºÃçǪ«OÊâD´RT§#ú*[´òû£³§à3¨!ž« Ím ö¢!ÓàѦ½Œ+*°d{Ch‡Â÷æ“Êx<±UpèòH-*´†\ö¤/?­¡x죋•Á#Ek£§!ÑC€ ¤+{H²¦u¨–5?väžË­ŒM#ð 4¼ÃYß@;䃋0ù®7¤ø®l }¶Fo…w¡”ÐU§1¾ÆŠ†»õÑÓ«O®^_sò1¡ «µ^ ‚±¯×N{ q1GüáÇWïü»ë¿|÷öÙÕûºVWïÿÿúð¿€>þåõ?\}ôñõ'ÌèÇiw 9}œ –K6V/ŽÆJû” :#k€ÃðžÜr1ŽË²–µâ.¹>›7Ä𠽩+óáXÝ"ÌÏS¡ óh@‚5”f¦ñ²HgAh¼uŠn²ñÆ[o¹Ýå¼³Ùxx\¹aÉÙ„WßËÍÙ¸øƒÿ’ÅJ²³s:¦œ©^$ÖJC씊g²Üœ²  ða+êù?³œéùN4ÄAf1ÿØ­vÅ|„þ‡zϹs©ùA{ø<,Ý×мÏ)mpr2“øO‚Bg™Y þºs"-Ë™fŽCÎlm š g­ õ“£³€ò?cðÀc h·ÞN­M™û_´‚¬Ž…T¾iV—àTJPôtŒ£rÀ‚*½É†¥K8ì–ìò1Dw©aáP–r'¢³F˜ð¸l„ñqÚ:ßu¦ˆâø¯Î¡ø8¢±LáB5Õºª¢ØR5« y¦Õ ɲÐÒÞƒú١ȉ#*:Ön›bŽÛã½ÎѼ€tsô&WWª ¸ãŠjÜ¡;gÆí¤Yb¬q×âÅæoº0Œ¤/(øÀ®©ZkI’YjkD½RšÝ»šEß`âŸ¶Ï ü$7z*Š£òQ‰V‘Nåt Nw<¤C_PeËÕ¥Gc;ê|°]¯&0õ•ð¸à;£‚B=¸H#æ2D½ü‰¸ûL;&ØõbJ.äÕ/H©oX1ò¦Ôó§ñ¾7õ¯–`×5m.%Ëk–<õ·Øhå)ôj;Î2Q½Ë²ÖvµÄäq&â³ Ô³à$ÑùKûN¬M—·4ƒßÞž­¬ÝüÙ Únj/e(Ûl6Zg½4h}, ÀÓ†5æÊ. »¬¥ ªmÉa”*ZË+ð,û*„S‡`)ï ù£™ƒÈIƒs É‚«YRÔÿ:ˆ¸Êžd%oG –§…C0bÝHžäbR ^½É$‹—ýýiÌ7 ?°^{áj dêP»»0ƒˆY³ u3)Ê}q^Í«:$ßÅ[ªôÕX‘ y9i\0×gš½€ÕË­ZÔðôÊWÌÓÍçƒÔt³ï°úX*„_ üùg¼dŸGã ˆÕ;!.ÿ°›òj²Ú¯M KÚ~ ”ÃÔ…áy@¼ØÃÂØ-ÄäeoêW]„­T†Ll‹• 5bK™6Î}ýÆ0¬Òƒ`K™6ÕTß¹JÛÿ'9w¥Ï$Msô' Åü{¶ä)Al%·ú·Ie´ÏòÁ-1'ñ2£uj_wÌs&g›–Gn]H!Ž$ØÑ>Ñ#V›beÌ,[·ÕŽåÔvΨ0×qbÖ½ýVií”i‹YÇG²¡ÖäN&äŽÔ•\³ÆÍ‹™lVð£¯FÕ€[ó'ߪӭ%Qdìyò&¤üÃù!eŸ0í§Ï9©¯¬ÀÍ ³_£dŒø^Þ;]fÔ%h1RQÃòèºh; 7`Ò:n?©È KLÀÊâû,Î뜊0 ¤óC_eoÁ"E"êÔþÑPߟ8\Æù=©E¹qbÆ”-Cr½ÑkYÓY}ëcêkÀªMKt¿þ,‚"!ô>¯VÇ s,ÚpË&PûÚÅ÷¨iNñ·N~Ã6L°;=“´wf h'¥—Ó,\ò±<û÷å ¤h~m8H~ÏϵðQP2IË89uÞu–é“‘!Críâß(º¿€Wƒù Cì°eóÚ¦^ÏÖ(±epˆ$‹Õ‰×¤ÿoGYæE_Â5½ÉüÁŠPªŽîÆm !Z*ª»ÊT–‚rœ‘“óYÙ k¸  %ªP.÷‚îFÈ4Á7=\GDýÅseF¶°5•ë3bL(Q÷6µQ’JÁ•HÀ'DhX¿ƒÎ{ïB8|p4øNP£´×e³Ñ» ûÑ·œ;•j²9Ÿ©Â“äÀÖ½¬³¦¢y± övƒØÊ¶¬¢÷Oíîjy[«¤@uqkñÌBÝÅCZsV â.K‡Þ:4•¬x%·áDÚòÝήƒàE®qÍžTIîÄ eÒm¶Üæ×ÕÀpöe‘þo ó çרS!¥!XE` £òû¤¸³%6òm¶¢q >o[£ésá+yœÐ º–„pYà9«FJ»—äqÐÃ8-–²û^‚/3-}[Ó¢nÛ±8N- è_sÎM5v˜I›Šk/ŽÈøb$‡ˆGJ·ª\ÉŽ„2,á8ßæC@JS )…4’kVg…ÇÙ(-.íñó>n¶i'ó°ÊX{ý"s^¢åð'¿ÊÅbÆâóXqëóH¦ RüÈw ݃¿ù3ÞÆèTd‘\ö‡…ÚäÇñò¾Ìq¿V®M ‹Ÿ…Ü”_(ð¹Ì.”K Ê|ëÀ4"ÐøýUЏµ§ÁuFÚ8Ã(ô˜P‰9d:‹ØAšoy]>-`¨Ñã}Txxp›`ÛV©~ìÓ~«’{‘‘Qšî6X>W_èEâæà)ÒðuYîèÝc–³æ_¬(ÈEà<.¼šI¡ã7`}fUŽ&ûFq@F1;Kú–)\—„m2KøkB")šX-9Î-*Ü”öù€BXi™‚(’ôŽÔ×P7¬då ¯¦Ïs\C°DÄN°š½n•Ðý‘™hýo³ «©€¥Dß4ñj#ª™5#ÁÿLÜ]4%Ï w+Ä/dß…œ)ëûèMªö åãîfr §7Ûg‡ºÒEX߯Ђg)¤ö“TàŠÆZÂä¤LNŠ×[Ú ²— Å|5 Z+Ÿ¥WbÎBôBÐÇz/>tÇL|ÌÎó "÷y¥¬=7Ýg¦ :y[]H¯](3$Dw á“HL¢qNbJF2Æ) z?îˆwøqqGÜÀ±uqˆ7&,vüFœ0ת}‹:Gmé«”ÞåÕ‹<¡ÜñD驵ÀJqÇx#õÄCf!k"åš|4á:û¤·ã“Ø"BSYyäýŒ”Sã›yû¯‡HõYVWÉš+ùÆ2[9 zEíƒëœÅ)ïóš ÓJí–2Ýl³HÉ-iiï39¬¡ö†,ƹ“:ÌÜÍNdúïS§¡ƒè¡óv¬Ì­î"<¬`£»»î0‘ÙÝÌEƒ–[ݾ žÉúT¢î8>¦Ó}‚¯¼×Ñ|bÀõY°±0U•—CV”Ä/ºEÕÈ‘XR‚Ìe»žºp6ͱ…Úðš Òí˜`ðÿÙvŸ8ŠpÛršý’S „x­ìœ3ékèÞ-•Pâ§bÅY>‰ó´öæƒwš…‘2ðN1$QªdÀ6²Õ­”Œê7H ZB°9†'›„ 2OsÔõô“Rð1ùGp‹9ÉGEHæM$î<Ï4$ *+"äždc'†Û²f¼눰 F›TΓp-ó÷I+!7Ã6“²Î|ÿ­kÁÏ- \9~¸Í›Š»­ Ò~à±]{I*<6·ÎŽóÈ-IoÇÔ@æêíÔg“ùÎñŒ«ß9‚Â5ôoߊÞÒw%âN8™–ª/e>' T¤:ô½>ªdqU€-`~}¥¥ÃC8÷Ž¢ÝQGEÆp|µ3T÷«i$ܲ&…Dè+[ù3:kcd4Äþ×Áû‹¼TZçБçí"D“í¯³4Ü'<ò5‡ ã"òfIu|»Z)3d'}='ä/zî+²Võ‰‘…º—¡ì”„Ué\-¢’÷ÓÓ˜ãlqóÏÏvÛYוÀžà&iMøÀÓã7Êp³UöÝ쨀°ôÛ.Ú‘8ßæsúáð¡=MÀóìNl„ÛìÑiëcÏ'+½~¬ä S4’ÕJ·ˆ{ˆ3_)•0up%qn*5Ópe'oÞÊ1ÐD°ŽYºAn†>Ê>ù‡¨ûíÜÀ>¶(©n²C˜ˆ1SÌ"’b¾®4ÑqLÔh@T5»nz§IrFqËk y´Œtع¥¯vñì·83Â$èSÌNN0JíM ;·pp‹ÉRQ*ç5pñ˜8­t¸ פĵ´ó°voÖÒèf§nH!ñt€¾¦1ö™D0)ÃîN¾žj? –é६Óe¾HJÿýc, jbö§Iï@Âl[äu›cC11öj)¥$¢º§¼$žOÏ8ªPI‡täQµîüDÁ9æ¤9Î?P¦ÄÓãçE_ûƒËrÕP”nVÐ4Ö&EÎa3L>¥,¼S\*ìÅ)—Ëtå';ÈŽßK¸œù ˆ³í+&n0Ëb SÁ‹Z*ˆyub‚Åé¶ÚkòñC=£¢ÔË÷¼Çó×Äh§mÄádŽ>cIdfb "3Ù“"V‚'„о|…r¿_¾ªîÝVvµ9}ØÛ7™g´ß/$Ò9J“Š0›8ûÏ't!â1úT9.ºW4Ø.‡~(–ˆ"®¤õê¶Iv¯äÎcOé³wâ äºÕl L+ËE ¥Øé‘½±ìºŒ}®ì‰~ŠÙ¤|Â0§(tÒXS©2eIeª41H¬'¬¥BÅŒfØ×Ü•6q[Õcê¡yiž?C^ñ`ृ—ʉcA xIé‹LòC­þu,O‹œsgÅ9!çžµôIÜYꩬڻž§Íå¢a·÷%GHd‡‡teGvSD×J‹å$ì|L›N±;{£Ë¤–i‡†COŠˆ þLNaNüî&^1Q M-¾)Ÿ’‚çÔ8]í’Î!» ô••â ]Iÿ Ê! ¢G9i¤;{.yKN¤ÚzÉ‘ד ªdQÕkݺu6(ë(ÍçnÑŠœ²Br«!d\Ì­ž­ZHµ¥D"žð¨ —™]˜ÕNë®çqinð Â.¶ãƆ%J9Hý.»m‰{ÏŽîbRœ Ó¦hàcw|Æ2¶ßDÄK³ïCÓÂ^{9ê+=W¤û|É1‰[aˆXK•cil8\pž<Þ©w˜Ù¹Ž½KHÍ ðùÍ8_èQùýù˜á鋺B*£ D‚ã:’ÆÃ{[³”Ì’*L¾?ô—ƒ…Ì«?Lj6sŽ{^’–.ƒ€v BŠ(Zêbº@KËỚә¨—žŸÜyåhiB=šùöš°‡9”©$4!9ªÁ»qRgWuç—ynã÷Ó¾÷}{ìòÕ®ûŒ m/KÇò_y†úí;©„±øwt,),xÛ´&wy¥Y+²\ Û-“ãÊ ±Ðòò£dÒeþ ?MˆEzç@uÆ<Ýš˜LCðÅ!D!kéû‡ö£™7D'¸6…( ëÃ# ‘›5Û×?Ùþ‰Ó¹,5°>yé‘+…+ŠÖß9Æêòi[J 5·ƒ¤ z;{xÅ‚çxiÝ!°4s"x?ûc€X¢ kZû_ë7¨Z€'Ômì§ÏjÄ"¨]Õ¸+dŽõ„¦b௽­ÑßäŒáæ¹MΤOJy"¯úÑ%<^*…Ž^³ðèšHn¥%ÜíB¾ëß oÝ>XŽ[nÛ:Ÿ’CˆK6äáÄÍ3ü¥¥ ¾Û"rh·ýø4kƒ65ìò± n{ç„ùîSei>Lj†lz _× +#‚!lL`±EÑòqCÌåï`Áñ:ºëTÄô¬¶“C5p¾”Žd£N.A™ºÿRB—ÛMe…Wì‚#ÃÈ™çÙ䌼Ç&è’VäsšéyÞF9¢sõlÊsÛÉ2×`M¢]•Âñ’„R2@u¥õ{dx/æQ‰I˃¹q #œ“L´¹ig©¨Ì¨y¬þ”(<³ÑEBªÊ¹Wß5UÕÕv£ö̹µ„g0gáŒË¾ŽP 2ÿQáñdŠžÎ$…ûåÌ1ëİaø*:<oü2S”LrCwFn> stream xœ½][\Çq~§ü†}ÓŒÁŸ¾žsäÁNdÆœ8ƒ±ò°"¥¥ rwu¡eæ×§ª»«»ªOõ™Ò A£Ùsé®®{}UóÝÍt27þSþûòí³_þi¾¹ÿáÙtó[ø÷þÙwÏLºà¦üçåÛ›_¿€‹œoNë´š›_?Ëw››ÙÞÄÅŸŒ½yñöÙ_þ§£=ÍóìþÇ¥/n—i:Y7þíxëNÖÚ<Þš“÷a¶‡øí¼˜É~‡ß.«™æÃŽî£¡|¹¬k8ü×ñÖ§Žû¯G{ø-<Ä„“]ÌáŸÛóÊ Ý<þåˆwÎq=| _:xyX¿9º—Ç—ö'øèqkY„ƒ¿ÿ Þñç£9­ëâWzù²8vÉÀ%ÀgÏ'gíÐùžèìÉ/(—9¯«Á1>?Þøèa[ì#£ mÖÆ“]#¿ˆ‘ôÓönö1“ÀYûß/~G §ÆŽî;M œê‹Wp’n>¼ð¶üåÖM§Ù¬k¾àáhçSð@ãwy!˜ÃÛ#\ã,èKXá$¶ñð¼Õ{cíá{ør2'ðø¯q°4gÒÿþt\–hÍáuÛ’¼×Ø“s èƒà ÆDŸã¥.=øçíQoˆ/Û3Àõ¬§–òöÙ9þö»´¬ÄWƸô¿ß#:çW Ï¿øt7®ÿ©ß±u¨”—œx˜ÕßÇžøî,„9ÚtãÛã­.›£oöohsÚ…Ëá‹C½’=¸ÞôЖð².ý«#¾3æ=qîóA]/cÐ_ÂEÈæp§"r^?›…8ÅÎæð³#0 ¨™ µ&ÃØ#¯l >‘N!&2¼©ßÿt´+<>ÑÈ>ïï·Sv‹²Œ‡8Ó‘Í&¶W1*ð×ÓuEy£c‹{U·‘d¢Ðå7ÄÉfò|ÄGÒ̉R¸ŸyÁý4–Ã]¼<‚†y xön€S,„w Í+ ØEŒ— ÿ‹c6ÐÎaAí O_ <ÈZ<1zc³wí©½˜Ð5ùë‹ß—Èiüá9´?#×,1ÉVc«¿ƒ‡Õ[\r‰ ÖfI$ê½u·HŽ/UòÃa×y_V¦•¤¥ƒÄbNäæ§Fƒ&oØ'` 0³ª ÞÞÀ„Ž]H\6P] Q§)7úK»¼-«hÇ!Ä4‹J¦W•°.g>BäæcމÙ €l­K°D?” <Ö9¤cŠè]Þð ìþÈX"«‚¨§Šdã±ñ±“<ü#üÜ ÐPLÍ6z%‚mÛtEYhœVöŽ{)˜L‹ýO} Óõº¸Ö­µç>/ï…—± 7d]Ù~j^ {ýsâÆÈ¿ý1É‹á¯Dê ¶@v[ÑNxj'8k=·0(%ótšà…èâGÚòêc)¸ øKEÕ7&Ö»Þ‘)SÉpñzÌjì]{©°-À± ,Ê4Éü³RÙlD¶I93iI–2-¥Õ)ޏ¸¯›(á›=HØ\õWaÑÊkï¤*Lû*Y«pCœ…UiŒ÷Ù?·N÷¢KlWt¥‘ ±B÷™‘Œøì§¾v¥hçÝgªN&ôw(nT"¿%/¿Ʋ ê£H®Q‹¯†‡vç=q¼_ÀËœÙú9ÛU–ûjó î¾w³* @CxN v6¾$^ÌÄï>ŸÞºÄ¤^ËÇ^£Jy¤Ãµ¤_"j¥‘Ù˜šL"ik®€×œ–Í–$oÓs~Ö ™GbM.ßC!k”K`|̪bÏHqØð®Wõgé.p˜óXX2r>€a5z„ƒYÎ dÅd_2€Ó“Àm 8þ]Z=]ùÓQÄXuQð©}]äŒ*LŠ™ï&©Ûî&Ò,šþ9Ò+Q¢fºÑÆlXÞæ¥ÅàÆ.TYPãWC"·£Añú7àoÜ#|`q–eK]!CE2u¤­èÔ{¡û|ÏNãËfFt½‰š»©ó‘s"õ„7w™=¥ŽpîæÅgÏ^üâ/<Äé¢eô§‹æ}êuºX[aße& ÌqˆÛR@ލÂÇEÌý4%"‚®é¢=O”\&?-‰»7FySu¤Û¾5M¯JéCg$×xúO–ˆvÅ Kš–=[ ±ã¬—Âb€F¨¥:+Ç¢Á¼2ëŠ]Ìy šÛ0ïØT\³©y]a,‚%亓QÌS‹Ššpü>Í1,ëú'-ÁžÜi‰{)ð,™Ƭ¤òÖ¥ÑÚ8¶aåÄ@á,DZ²Ñ\¶êz•F¢« ì}rc“!áq2æâ1° "Fzà>+R4û̵‘AÀ]ަ0§ËA‰‘a¦¬„§Œu‹uóaQN}úÏGR„A[¯ ê0BYMâæ_ÕôpV*0<™Ù§Èêñ¨Û°•™0f£Ü²& 3 ·9‹MT"â‹­×Ç,|Êšã…–é긿”‘…Æ’ËcdÅkšÒÒª [{ &b…Á7Yc |öŽùp]ð†©.» ÑÚz*h1¿Âgۤ˻÷k²¦ÈI§ÛŠ]²‹A6*Û±˜ $ã|øV¦=-˜¢PS$à-$ô'}¸i”PáVZ`jüRÀ[;OIè„~V©_D ã…Ê!EÉådY~¹¾w$övÉú|›p¶ †göº„3ée$ÜÓÞÿ‹<4Ó2[Æ’¶ †p÷yíÓdw%,†ß÷;‹'^R‰‚æŠSÆœû¦Í!r’¹¯‡ÆÇ”ÿ€Ó³Õ‘@nÞ×(AÏËmÅú=9IÕ/²F¯Û[UIEºâÒ§ãOÌ5¢—r§D|k#~‹—RŠìïº'6²v°*púÎÖw^jሒ™«_q35qX›ÃT‰|.ÆûFÑ&tÁqoUKªp]ÉÍXó—Ý^¤ùa9G+«?X -§…<ä,kšÄqmÂ; ÿï"Šœˆ²ÒÛºAÁ/õ>Ïì“H!yŒƒ±M.™ƒ#™|u–U!V ¨7gÑÉ';ã÷x£k)²}IÍ/µÐV\ÒE–íÈ}Gl½#Ó†Ú5æÃe‹”†h‹¶µËé«~eQ(6fÇ­y`¬lÄêì¿ÃÐKàø Â;0 9{…@Ü­äù4­øõPÌ[<Å…¥ì6µ×1¥¶¹˜L Uš„µOÜÎñHÞ|ýîZ>G±[õ2fÀêeÈ\‘`*”©^·+ùÝÖÏIÁ¿âŠA$Õ·Ñ—°š¡X¹DHiå˜L*‚øºD¢Á²/»3f Q¿C.µ6ñê9‘<äFPˆmÙ&)ð©_•hœDV³-‹7ÀB&HÇËÃ1 »Š—Ñw_ÖùªÈƒg“ÙZúø]99æíuÑà:ƒDó ‹^‘þóYïÂËrb®Zjbàk¤g_z“&6ÝÃNPº~ã+áZ‰.»]ÒÌAcF´.Uª‰æÈr¥ÃŸT³D„f驹wÌ iÒÔ2KÜg{‹ùæò&çrÐ}Úð`’yɃvò{“Ü+ôî78Ú”7ŠsVv.ú‘p¢Ö®šYü¶Ê;—Üõu’g§f¯”<*L)˜¢Du_““x#ÇàˆúUœMkb¯'`"÷áòÙ‡IT}jbš S©Ïå©G·1‡NUâÝÃ0'â¸æ»(%À«dUnSq±E >ÙHÏëø«eŽÕQõ[¹Âgld©jAK¤Šgd\›¿o³æmlÿÚeÓ]‚îå„zȦkžRµ #g²¨iû’ót¹#ŠWb㉗ÕÎ,é²etos,*‹`ð­® <Æ„›~¼pOÂÔ©õ.9QÞ‚GöãdR2nÖ}×aZ„9ß*õ)cËô³³`&Ü ¾¥oŠÉÏŸÔ%©Ã ZÎ6ÌÒ2MÝNËw–‰Öa{ÛjL‚jJÃiy„Ù;<ùŽ©-—2r훳y¤¨OVWTC"@Ò Ž %«‰¶ä^ûÄPH˜{3[~ÉGcA0¸±µ ¹®³¼ÃtqÁý'|9ÏËä·ìC £ép.©¯…"û>ÿ½ÛbÄûLóGøBŽ!6XL¶ŠÂ~&n^-j"ÈÞR-hÞ«ó›·P…=ˆª¤´QÌÏ;ïÎeê‡,"—B‡(ð iÝÇ0‘UAþõžëê…ä%“红ˆ—¹’Cb6,‡Lûž¥ Ë•\uw )=³îZDÀcúWÚþÊTÃP+cêÅåœ&Ë(4Ý‹Ba·‡ÏÍ\jç8æÒâöK 9ws ]:üüðq%£6°O„*jhÖ‘½r †µ[ÇRÛ‹-ÉV] â‘vÄ¨¦Üeî<'Vç±”Êõ\W­ÃŽžë %¬'UFs_šH WèIsQ˜$Ù‘ÙÂCÆ[à<~ÛJŠMõRa¯Ë´pdÓq¹´m1`‘5 îBá«8ý³ývMJÌU#õþs$1²EíLPBX&à2Ó'?isÂÊT'=чSSTW^‚Û…•èø“…#ŠŸŒfÖÎÕ´x¶+ÖP8£éæ>«”IºÈV·Ò¡•Z´ä´dü%uß©Zf¼W70²ˆ„7‹$d±b×äÊsjP¸2õ?‘v;#”©çiCga4s"°ÕvU#§#`ã±…*67#SâØt¾JxF-Iȯ¬9§²~¨Q†]³7Ãö1õj•i´pDïc­I¨:- ¹ gæû‡–ØÚ®;]´SÎhýúH±¶žÉo™þÏð}ùã§ÇÜf¬æ—"ê¼ödÖ’ÎZ­eÇ·IyVVæ×mŸgùOýªµÒÅÊ,xÜŸ¥sà+B:Ôn÷Ë’J¯;õ„§%M«u,5móB.1¯³tnUW°ìh€le ÏÞ“IƯëlE….½ÆœüŠS‚ZqäCK—Œö$€¼Cx‚–‡âCXÄP ™²’€‘èÃ-õ1Ó¹t(4¦¹u¤3œxæûÚhž}BÇÂ%=9vÞ,nv»Ú¸´ \*%l^Jìáƒ1mE^d0®0U,‘§™S"hõŸ¹ëâº3USöJ–veÜ„Àƒñ^2‚Gž:@ –•Ø%oÂÞ"QÔ± J.±ZWé~P„ûßUzç?áIŠi»Jp‰Æ`¨Šso"¨¹•‰f)H‰-m7³51y·¼Î Ø:ޏó‰C$õVŽÜ¾µÍé÷ý Ÿñ¨†±M¢Ðl¹âíúTÏ@jðüɳñ®yu˜ÔF]6 D[é“jêò¨ïfqHÄÖB–7;æ¸4f®Çö(·BN*öt/É,#¡R5Þ+Ä”ª-) t0›ÂØïžÈœXñçr‚!yVÉc€m߬z#bz8K³8 ¦@° à€A×Ï0ÑVÒÜÂÔ‹ˆ}¼»ßÃ:‡cœÞHë³;^AîÑh^õmyòmv¯ñéóUÎõ”Ð?ºï<°þÍU;ãŸl<©‘ÈoÙzïExbþçð?”Býl£púŠþƒÖz7ÌÄž‰…/À<~rLIC„æËlÓ“\»eäȨh´~Ä6e{k2ðÀk4ŸQêNpæ#j˜e–Ó©õm”1*ÍÝ7§ªÓa™Q™Ë‡çD0{ ÷vmÈ-4~A`fÒJå.µ„\â¾ÛÓhìË(£ÜÞö€Àþ ÿ“¥þŽI4›f–ÙÒˆ!ƒÖü—À®ÕXòG¼×&ïè‹ïy —À‘¶‚v‰}µ}–ž2@OÊ8:¹‰¥Ösˆm<¯AÖX°WD¥3öêÌ}îhÛî›ÝÏ©>æ‹Êµj‰Câ…eþª¬AoЬ‚ @ Õ71Ío«¥Àm»Ù®Ø²dïñZ vix¾*íL]òšØ7ÁJë&ñVQ*± ÇÒâ*æ&Q¾4ͦW)É3)Ù+w3Ùðfë(=¶œ™R·Zœëõ×’³ÛÓiy’ƒÈªpuT ¤½Óù±­x9h¬9*îߥ”) q"°÷GÅïùKØM[ ƒ°ÎÆÙ´0QÙí2ëF°!jÉ®½ž9ßc'ËazeK:ªíHL¶ÐÝÄç œåªogfIgwõ!‡l'±§I½xÞÏåZѦ@v ç´ÿa›“ÏÈ/¼ØÑ/«zœæ…=÷¯F­Ð7¿cyWp &­9òMq lWÈÆ-£~þ¤ò‘i:mÖ'øJ\Ø¢(úD0Pôòî¢5p*Hûó`J†ü¿ÞùÀ:ì÷jÜ´­s#Ó»vÉÅJW£ gv*×µCeè@$tPÔ€qÒvoÊY‚8ùËÒw©6ºôÚªÚÔuë?ëÔ–sH(–!Ùg2 #¡Œ±× +iîi2œg;´\Y‡Ø(ZJ“æž\Ž«PÀ¶D×å„K©î.¿õŸðc´ds»ŸÅv4Iš< üY?ëêœFëTô"*žoûaÎ…h}£¢Ü5jÃÊ“¸ÖAåS«£œUãyø™2º–ÊdÚ,°u[!`Eqš§FLæ•ÍL*xü‘Þë\kZRyn³Fy{~]Å´þw ÀüSEÍ ;3 —e¦BÖÑi˜l%ÒÄ”KŒ C¹ÇÍ©¿± vjX;ý¥y-,¶ïÊhEúvª]6Oêæ´su­©¨ÜºSfÇU__žÃ^¨4Ö…F/Ö¼©ÌP…±ôY^«LÌx¾dˆˆý5 éÚ*ñ„ýRÙ3ýfÇ|؉4Š6ú:˜³–FŸí·÷vº%joöŽ£Ã:Öt„üÍ“<‰WiâÎñçÊÆh±ð÷eì®·ÝŸî_v€ æÈ0¾cý6Å—†»Z‡Q‘)Ú;®h=/»˜á¸S‚+(³z†vͯ*mÜŸ¾xöïðÏÿÖn Úendstream endobj 181 0 obj 6876 endobj 185 0 obj <> stream xœ½[Ys$Å~Wþ zœqhš®»êÉa0Æ80Æ ûü ¤EÚØC ˲À¯wf™ÕU3Ò.aÄtuYy|ùeöçë"ÎWü'ÿûúÅÙ‡_¹óÛ×gëù§ðÿÛ³ÎDpžÿuýâü£K$$ü²„5ˆóËïÏÒÛâÜÉsëõ/_œ}³“{³ó{óßË¿ÃJ°7¬^V /]ÞÀÀ÷µ8‚Øým/–¼»?ïåîËýA,Z'w—mÌ'éW¥ýî+øU˜Öí4¬¶ì·E®~÷×=wÖí>Ãáþ§ò$^ ½ûz00‰†ø' r‘‚î \¤”ÖÛûOý‹l狽¤kt×9ä²®ÖøWÓ𮈧ŷÿ?)»ˆÕì>ųŠÝ¿ëiÆ ”€‘æ†Ý–  ”>ß$„S’ÇùÐÒ‰t)üùVj……CH—srý¦õ~ÑFî~Üô[\õîÉ>îvpcnš@ŸÂ~Aöj÷²ýv‹S8†ÛýóÞÂqîÚó6¼$ìØîÞ&QŠUÑeëìmž ò^£ƒË«UâJ×q„T:÷y™îM›îL·X묎ô+Š´ '„øŸiGN)~²¸£5yŽù®©+>©]Ö°Q),Õýn^·.Ƽ‡²KçA+ÕîõB­¨(Å*ÉáóNðå"tñðdP;\ où` Ì¯qU»+ɶÉ^›Úçcãóàm%}²™$ü$×mg7Yo˜<ÈÄg3+i}L…²8da„‚½®2ÉäÛ]Ò9çâµÇ“»(ˆÑÉím™HücæT´ZüKVJ´ø¸N ú¾Æ#À…;½ûv_ß»@7â¢×#"Á)n²‚•EbAë/›U%Yð\DÅšD>Â3éÅÂr§&n²Žs|Ù|âFÖ¨:efX$‹õ&‹Ô®‹”JedêWip™üW”-ÈC…G\¶aë‹ €”aüqñFñxuiOŸã@ æv¯àÏè,mÓú¼=ÖœO©¼)§,O^$7kȃ &[èûÛ&ÉœK©n¼ ¬ký¼Wð›'«ãæ`)]®>&îMõ5^n=ÓÝ“]$E»0Á'9m=µ«ï=µs\—•3à«UýrȺm4Ì÷+ŽÓ Ý!{i|ùž ‚[î›:W…kƒ†ˆÆDo:Ç)žà®Öè»Ë&Áwiˆ¬ßÑ ®èD]°Dߨ^Áèð4S^cÆU\âAššöb™ü—‹¿d‡FçáÀñÖ}Üó#/ÑÐx‚-&0 >äx"jB’–ÅÑr&P»Ò. \çÓªºÄ‹Ó8õœÏ5UT]€ Œfb±‚<@å´k­{?ÚŠé_β‹˜Œù³¢C0Å.{@a¡‘@Î!„q´õíoµ±(„WÅõ í® v!‰éN€Á‰"µŠmAö“Ô^6ÑaÈ?:S¥ÔdÜ7NÉfcdO•–Ón@ okJŠØ‹ ÁS5%ºÿ ¾\¬nØ‘€f¾ÕB,[NÇ Â#u^ ¥‘ø쫣B!›ª¿ýV—œ$H ©u=°…zj¿uÙ:å…·9HÕùúÖ&¥6¢2•6ô ã3YÖR/u›)1+I”‡¢„wÔIWÍ3†€ŸRtÑö! ÄÙ„¤ÑÃ,X³¨…Ùùœnc —‹+¸­sGóÝÜx¯.ÅEãñ.Æ]B/1ÑÄ“`ü‚§¤u6Œþ„¸ÀÔ$£•¶1¥ùM4¯qàZ‹;ÍšnZIsFS•"æÂù÷”Bl…dÙÌçÐsBW5’ÒVí9Ég¬ÖÑÔÆˆ©¬‚¶³¯£Á©¢åôyiX Õ6,÷Cþ„E³Gý$x†±Æ3þJ©š”vn^YÊô5ÞÕï1ŸšyD˜ÓŽB&V1“ǃÔmìÚH¿£dEX@šŸŸ]þñ›€g"uu$rÓÄÒjG?ld‚'`Á¸ltcøR¬)/_¦À=ÑJ5*üâzp¶Î)¥ ÑîIÆ+’ÔBÏ2ßähC,Ê,¢§œù¡Ò+Ënïyq/«`Üú„©)E&_óÀÒ cW²½ÈuM°Tâ ZpÍ÷ „#?6ÖüŠ\Ÿá„žfÊ‚$dæi@'®ˆÔaûû-Pœ'®4ÈÈ‹òn->ùžE¡Ù›2Š: çâq´4c‡]:Öž“”yå6ää(”o¬ ‹D5ºVLļK¨:2šHñ@Ät´ó‚˜~Zó ŽE#}ëÆqtˆ„3°P¨›ÁXpD.ZH¾¤èX+íHý"ÙF‚Ä”ÖJí¬8†/»Ž«§¥9cÐ.ÚˆA÷kJ0°(ûü(~Õ.mPÈò+Ľ8C™Ê¾Lˆ:!—9‚à¤ÞÅ(v‹ºÇâz(ëW-ÁèØÙ-CÁiAcB—‰Å®ÔŠT–õ¬÷©ôãÄ¢ö”ƒ$¬„²>ö;|Âô‘§™E"ãr}¬2 úþ>nQMIÜÜqºÜ›OJL±=•q0´±/å!±%òg!Pažq™uK¬Ä0SjºÁnƒox<)Ý苽pn¹H9KY¾÷ƒõFÀ|T&H°5¡„x¼!, Io°Ã!‡\¿©ƒ’Ðí˯©õJ*¹ëh°§[|’743& År' é6Þd Iμº~\ ÷8³®ÜüœcJhÍ@ä*fr’m* Aµà 'mDC{¤“¹š¬5Uù—#»ûÄó7Có H‘X@ËžSÛÌÞ¨ÃgmHÑie¶Üx ,I€<°B¥ ¥ñ1L:V³škšêLn›E ¢ ?•“Fb“¤Àöîq®Ì@”â"¯àq#-N(Ž+ ¹@{ªé–Ьøõëyþg©!’51”&G{¤kÉ'ÃÙómÝP²p!-WôV„µ$h4¾eÇ üm¦¶þ¸G+6 –%Þ'ÍA„ùfh0£&’à é–A¿õ´;uo2(,‹<Èna-­Ë€²L·(„%Ü Ñ¹R ³ƒ¨Ô) Éá'ZOcIê¿ç±d¦!y(Ó.ð¤ }:Oó“a*ÒT§v.6UÿžU*ÒÆ"mD|$S ß+ÖÛú™íƒ÷YÃunxù³†ÓYZŠM¡uQ”¯ x›Ê„ÙRž÷qñž§Æ[±ŽÅÛ½ l5sš¨©£F¡¢ŠzŠk÷Q$&!­íì#º8†t[ۋ‘ŒûDPb×È´-#fßš|N@Êd׉„Ž`øb/‹ÅW`$ù¤R‚… ”‰ 4¾ïš}0Ÿ`Ð_井Z¤aˆ7°°úŽ]×?IÉþ ­¥}ôS08jùõ³„KA¿ûN™Í·xÎú±]Vg\墨G8™¼ yÌßúÚ`6æ>v75â¬#ÜÁÛ?”7Q©9Üc_ÐmË¥çužƒÅ Èaf<4·¢w¥—× ²CîÞqóÁæÛCŽgóŠrn^GD™µºÚ\i`GjmyÖ®™*å(…µÐµz7h5Ý€>–t ìŽ$kÊŒº=F¥@Þ¸iEiÐ.)‹´#‰éñÜhXA. d Ñ•°³Ð´BÃïd«³çï¾ÂkóauàR°ôô”b¨Ø ÔT—6-=Ýcß-d.»‚ñcàÓ%Øw†‡x.„‡<Å"+÷½ë)Qãd…:¦&› QþÔ‡]쨿@ƒß[Rw·xÚ"¯ëT½­…ßX †=â‡ÕµÎÒÊ`£Ë¶t\,=i>„1HÅìq&o“Í­”³è[Ê1A«Ãf kÕ% J2áP.wuêJĈǪ9›©½¦ÐdÎD¸¤Üÿƒ%ÈmžqÅ\PG€°ôÝ5ßcbÄøÍŽâ¡ÈÞ•#}1D¼± dwãŽæJ ²¥có™æëÛ©†åãö3ïAæî$¤¯Òçíæ†d4ìÛ!ÒèYvM§ËAM:7êëx5!}òJ\;i_–}5‘/™û²y3GPÛÆó,Bú®RÞ˜Cš³EÕ7ÆGîO‹XØ~·Šm¬ä ›ÕÆß²–C¥v'’pw£¡þÝh!§(bчX~ü]ë“lÚ'—gÿ‚þw„Cendstream endobj 186 0 obj 4137 endobj 190 0 obj <> stream xœµZ[“µ~ßâGœÇ9)Πûå!T©WÌV^ Ë®½ëJìƒ1¿>Ý­[K£Y_bpÇ3©Õúú뛞Ä*ÿäÿ_?½øì¡?Üþz!ß¿·Ï/$ 8äÿ]?=|y ƒÂA‰Õ9å—/ÒÇòàÕÁz}¸|zñãòÕñ$VëŒn¹;žÔª”Ôz¹:Š5:áD\~ÉO£Z^åU4qyt„gÚZ¹¼8ž´wkX,δ÷Êýûòoim³úà%®míjt ‡Ë¿_\þåÇåKš_©èa)øN#A‚_'¹:£âòW•Aȸ\ã r5J-ß‘,Âù°<;ª¸Z4IåC”¤‚™´1Æ¡X> Æšå1<J9«c·Ú5|¨­Ö >„%Ôê`ÀCxhƒñq9£ŒÒ a—WðÓéŒÌ«糈¶ðŒ^ g‹:ZÝ6“Ô!ÎELúˆ+L­Š>.A˜V §º2&ZXA­Þ{šJŰZÓ¬Öo`-•6°ü%‘^A:%ÛÇç£ OZê5sÓæT?û$=„Ç¡Û÷U‰ÔB¯Bšåç6ô a¢ÕůÓh&¹wŠIþß›U*ó1Š ºÔ~Õ–É+zð„ͪµ‰éS6(éÀŒ«›MáÚ¸©àW°öÉ]¿§&ßuýîŠ)ÎdÒ~)<}P“Z­Ñ\žnãxlñòLð—Pt6MŒsÓò/|þ"ÛýcÄ!žBÖ®BáË{Vñ·VgežßÂÈ»¦ÈGùˆœ¥¡@ÞÒ)¼èAº¬!iû"ÿÔÒw›‚e!b4Ë4?¥´®ì öž÷S¦d4§¬¨“$…¤¯ å=|cËN0 ¯xD7¸oAcò‰•Á7.’h¯›á±‰*nš9áÑzA@F6‡‚«²CIØÙ³Åbkˆ@ O°™ò¦Hü | _Í|‡* ð.,¡?ä-€8Ÿ´ý·¬Ó¼œá â)·*8à “Ç@L^F¾FaÌ¿‹Ý|.ܳ`C’eF4Øf•°œ“=Ì’}x°¸b¨J¦Ù—(¦$ê|x>F9žX¶ä¢ÍÜw Ë{L§ì‹ø°ê„” |ø¦­–¤Šàƒžµ9øº¤;Xg¨uoMûiY+[©,‡üLÑ$,ª‡•é‘Ô†Û¯©£`?M~5ÔÞÿž \9ïÑF6Ç~>{Ò60 Fk¹ã ƒ´‘¬nà¦É$6»/Ÿÿv´‚¸¸a€Fæåcg?ŽG!å»ÕÞ`Œ×3kª³ÿs¨Kîg'!&]zýAÔ`"„-¡ŸÎ`Þf¸²Î9ÿ3B)Ÿ÷½Eó«Þ¶þô ªHS Ô™M¼¨^ºsÁ.`áPOÂÌN¬­Ý˜–Ÿ5iií× }äÐ!@Àj }+ŽŸ“jeԊ͇⳺|}‰§ Y±’ò•ÕÚ,%áØÆ¹E_ñÑÙ]“ÊúÐv×F²RXm¢ í“4†WăÕÄEs¢CG5e¾Ó¹_mE3Ô íba2H-kÙ!ÿõýHý” “D˜¦sãä»ñïþ Öèð¬µÚíÁAxmIÜdì2ΡzòÅB‡Õs‹hg ]o\íùøßd†„cþ+jØøE$eÇà¸Çaî¢MÙÇ·dY1}a¤ûœTQ‹+çä4ƒÑm²I êv³2²«R§pàr"Â{VÍü¡}•D ›€ˆTĈÛ: «,~”¬l'’­õׇT¼ŽÂ‹3û‡ BzK¦˜>2åœÛi~µ)åâ†X>ÔDßR„Ò«¶KlÇ—E0Ñw …¹'_Î'3M@ß)*˜edi‹è‹´¢ÚÓ€©êYw}TÎþœðÉÔ¾¥ò jU¼òš#ðŸS’"’·Æn§(<…UQ»·•”)÷ãÂ!“m!†hÞË)>šÙ@ŸXO9lVãZy¡Û4å¦8§¬ D!Þ-ÎÕÂÂÖ¤%`_„­ü|ƒˆÒʾ;ŠÕ[%ƒI$úP,VÂÊD>àA*Dg—¯ø^ø˜ú6°e,}ñßç$Bêì`Ã)ºXæ•ÑAŽT¢õ*±”Ÿ)C +'Á`ߌQ&©øZf5N‰Ÿ?¡]cÙõY{ý:‡ÈÃN“—Æ&…*ÓFDm[ãKõ,µ„Ì#¢º30çt´ Uz|VjÂûä  ºFrh^a;Æ6lÖFP ÐŽ¼B®Ášå·£&ó˜¬|=ë k¶ŠGI7ka%¿èý63ð”°’­M@ƒvù'•ðçÁ6”Ù“•t†®pë2ç^j ´7ÇàÁ–¤©õw½“Ý0ù~KlâêX oÒü™ËlïÕ,CÖl[Í&v*Š}ÝzaxVúÁÜÆŒ}0+~NK× ò’Ü4³ÎЃ,lÂ¥7}M x<$¬Ñ3I‚ïZ,y_¢›jlÓi)V¹07žI±pè™V'¢ÇÜû«—±/DáƒÓ&Þ¢ÆÑƒT×2!vÐgMèX(¬î.‘ê\ImÈí4ÿò/üÏ×8Ø®DŠ¢èŽ*l'+?ŸÃO%¾§T€"¶&ÎM_=Á¿¢Ma÷)*óª¦ÑÏ‹žŒ]DP:gÊ¡ª?—M­kkËnÙÔJÅ 0›–y9Ùë3VNÃÂú6ñ«‹º.hæ±Ðï¬øñ‡‚”ªÏ‚ÊW31úZ€í:Þçã¬ZÛΡ,ïìž79Û&èì°íÐ ·R¼®ÚÏwh6CH¹$up¡T¶´ŠQÖÐÜ{ë »Yq¤QQW¤àáÙ¯ø!¶]$o›Ÿ¨bn4c®®Z=vi#ßÎ/—0%›Öðï ÖÖZˆL€à6âXDìˆìžŠÆì*ɶŒ¡§Ýî$gU ·…#¾žu†tò¼ ÑCrŒ°½NM“Ù$¥¤ãE%½š{ð'ýÖp¹’óÌ.мWgocí»Ù–±c¶µÕP¨àk™÷wUö¢»ÁeêÁL*ë¹–6Kb¶SÞ éFïq L€T‰Ö+V›Óùvât§“ wèLÓ¯Wu4½ýKÊ.DSœÓ£:àEsD/ê×íaù{{øòC\–¥–îMÿ¹. Ps¯Ë‚w”ðÒ¶±©ò×úe}wøm>®Mˆj16P50t¥´*<äü•zViï©:`«dr-eðPŽ“¾It9X/sc(ÆmÍUPy6ªïíOAȽî÷Ü’'R«´±œ5c«-M½ë¤ ìÙÖ+F­åÄ+â—lzC5q‚]÷–Î hfùŒvx%´n\ËûC®åÌÃPÇœÕÔØiå#êÇi%ˆÖ&õâ|r{U ktõ XÑ­Þÿ+µs^&‚ Wµ-öáÛÄžKÚ ½¿ÿ©ü> )ÃTÏ’/-îèòMÀiظÁÄ€Ïéè—´\cˆý øé¤ ø‡(°3àQK71…¶XbtËGÅÒBvl@aóÿa¬!Ç"ð[d~-«ì¾ÏM{OÓË!Jëî%¦6¾Üê;]Fõ5~ÇXony7©òmÝ„>ÉÝô!2öï#$qwr– øj¶³fþƒÃ`™ò¦4-ìnQwsÑÚ¹‘ÙߣïPn_9!'Ýî>G(÷lï-q0h½9Ò5?D^ƒ*_n°²ÞoàøfŽt{«°Ã¬³9{r=³ U.W`ZÒ]Z£bKèãÑ‚õçì!ë M-¤¥+íuÁƒˆ“{õi¦Ôˆ0fka›ÛH­ébå»Ò¢MîqÖézˆ>)pkð1y˜Ì¯ì2Þ´Q4êÒõ|eybS`ð‡…¿•ùÐ"&xUovû©C|‰zÚM‡Íõ ¤ãyˆ33‚·$AcÝ´¯ IÅ÷5Œÿ¡>›T²Z‹þó´O.n[Z0&Cx°ˆs8Õn@ª^a«º__^üþüWsendstream endobj 191 0 obj 3469 endobj 197 0 obj <> stream xœÕ\[sÅ~Wü#ô泉ϲsŸyHª¸ÙI †Ø¢R) *²eË”-É`¿>Ý=·žÝÙsŽ$óXšë×Ý__Ö?O£8žðßôçÓ‹£¹ãó7GÓñøïüèÇ#AŽÓO/Ž?9NBB˦ ŽOžŷű“ÇÖëž\}»QƒÙLƒùþäŸð†ü )§Qkxéä :~:lÕè\bó÷AŒ!x6róõ°ÐÏ8¹9©}>­JûÍ#hU0ìÆÀ\#´KáG)7Ÿ zTJZOÃ<¶^pÂoþïzøGѬ Æ´6µ¥ÄæáPærÖå¹p0׌ðrs»àøÊ¤ x)4¾ÃŒÚxAÉQLBn¾ÂçRJ˜ê›AŽÓd¤H³ÐK³ùÙ¤iéÒ‰xŒRócܦsÜÂ8B€«RÏW-žó‰ÀØMkžæiù©¶¥¬&˜ßJCfvMø«†>[P}“åi„3è6¯E†óù`*ࡳ¶#³üµw‰€~Q DÞ²Ö×Åþ=x3È×ú¤Ž·èŸ½ŽxMä6o‚Àl‚{YÜVi¼T2ã ·×SgÔgM¤ «øÛsüMá@ëS*KšöÚú/?í Ý„»gª‹ÍÁ•²Ò’$‘Y€.Ó†ƒ_™ógZ’›fP¢áµ^Ê„Òt=x$E®ºR‡J€‡v(¼á—%¼ñêeУ¬ð] v‡+[™Øt;€1s¥®}Tê‡ëlƹàKÂLDa¶y³­Îîá6“w Ê­ÀeIØ?\VÕÖ3U˜8»‹7ø–&;¾†s©=A«õŒŽ,µúRš@ƒˆ Wru Êã@)¼*SêFö«þß}­Ð.aö¾8®Y<³bf[~Ö7³„y—`䥎X>]˜ x†Y›Ó"ÁhöS‘ Xi#Ëz_ÑùCé¸ä&lÛ·8s‘i-´OX¾X¿ž×pÀÅ¥ÂÊâ0V:¶&c^bdðÚ·tß ‡'ºŠ…¸¤Dr®@a¿€ AÎñ%«HÛ—G'æ/}ºã¥=ã¯RÏ…g„Å+X"˜µqò“ˆk5¹&ÙÉ€M‡k'=gôV ж@ZG!ô‚ nݸJØŠ1«B¾”Sœ•ënðJW* I6Þ5"»SR¿@+ŽgtkŸK¶^MEãç uŒ({|Žç+¶¥•à”­\õDTdB½1×\³x#Ò¯«£úÛ»dþÆ ª*ȶÿç45¼ï™À;ŧck<­'‚Ò{w§eXh ?€5³ëv2 Éœ¦"âW©gÖ«î’Ö¥)OÝ¢‰Ñë™…Ì67¥ÖWÆuõÞ“CBãÈ/A›"/k š=ˆ ýgt} eéÄ0˜"5‘žG“cPs›-ôÉR2™‹Á‹ñk$cÑüdÚÅçá$Πò“·r©hÕMˆö*6âu®Ù5MöÚ,‚µ‹e:j5X«:g|¹»Ãe`©•ìXê½~Ÿ’ü¾K¶å5WVÉð€›ž/¼¨–rÉO³ž6²V,Û”&7ìu•·…:o}¨d5ñê”p¾àßÂ&˜µZ÷Ú*ÑÃXª@íVUC49 õ<îÆôÒU ÂYø« L-‚u¾¯„«çÉ4’BºOkÖx9BðvÝê%—×ÅÀ½D‚Abž¬Ú&àñSû,Dë«çM4‡+)“,¼6£<´‰Æc¸L+ÀÑŒ­$lºv²5 óÐgµ¦ÑÒL£*ш÷‹pHL],½f²º\«Š³m#"möà&·Ø*¾3•'u8ȳ氇U«6 '?Ù³gÙ”Åÿ]d{ŸSÇ¡„`fô ­l£Ù ¥è€'§ABF8L”›„3@È@oâÊF/¬ÄÛÌÏ_ÑO¨V)s&F¹M£3@7õæ£8&œ0RPg)÷h@`Mq–¿C´<-J Þ‰$2—G¿¬Ÿa£µ¨&-¡MÏÂWñ9Ü"2«,Mœ"í6< Yr‡Ù…‘ÒÚç—(åÒ:×Mr®§À0A·°!s€I‹±«NWˆpgÒÔØyb݉:kuñeg>T-ÁŽRÁ0Žþ AÙ ™tu›we£"k‰°%ÕÀdzݕÉz‚ÒÜŽ/Y>ÿž¾äZ%®ÝÚY@äý 1bÐ^æ&¡é8‹­@ <ù’g` 'Ô,ÓàR½e†lÅMM¹à\~fy—ŸÆf®gŸ Êr„¥Ï‹Ö(ܰ»‘¸ËìÞ£TìsïîtWǸd‰€YVÌRÝÒoJ)G¤Ý \'r’8}‰ËÀCãW”Ï¡ fo®‘©èW9Û¢7çÈfT(…V‘4™ãlåSÆ-%ûqÅz J¤æ´º¡ÏSYÂ4 îðõÃü0—ïÇõ/«8 2̘þ ]‘9‡0¾Éxæ‚ÎfgU˜ö)7hæÝÔç]¶ñ½$†:ŽÑ žeëúa2ÔøÕ!Z“áS̉€жLàÝïë–31X£‹ ®¯Hjõ9¾ãw"T‚c¸¡—íŒ]O ÓS’4z™¦f"ε^F“—2ÏY’š}XÆdF÷ëZXö·Šîž¸M8 *\Žþè\ÙÑú óÓyÞ‰UpWhÍÓj\±ž¼dÅ(uGb™I줨°€/ƒ€SÝ]*=m­ÅvŸžôü÷†™—¬ÊyÏ™éRQÀËÙÏ,+ Öò–»Ëƒré’ŠåA=JÃüÀ¤\ë6Þ )ÆI˜¾IÍ‘· fzʬÞûý¨’¥2«v²æ²v·1 ÎBÛãÂËgƒ¼r¹ª:±ÈV®aiɘžÍþ6š: ½ÓóÕ{.O¶BªÉÆÊ€Æû1f„¡y)N×LÌ2¸YT„áY+y§©`'o±®U¦/R"xS`L™0Ü àL’¢g,ε®•i$Ŧ`,*ýrðdjõæ¿8P4»×e±hº0qð¤I†G"¸¤F©à‚Q#2'BÎr ¼F³ª¢N„a·ÆE“w‚Þ´@x†@i™œWãµëÌkб½ï~ª¨øµp½ÌÑÌKF’"Åq€awjQ™o‘±úÖ»‡¯âí¡¬/ªB±€¸ 4Ò¶”cs¬ê…VúšÈÁ6n²Uê{$àÖ3£·dÒùùÿò 2_Ã<,вÇÑÖ¡rbþëREã*9X0‘¸Rݤš¸c”ê´á œiÞM%o"Gâ ÜÖ,ÀýºÇ(Zø;G‘Þ…æ…%‚#)ÝžN+º»ulíÚ—g•d”’N0»ë±°¸­boË|©ê€Ü-«Zê ¤½.×!bˆˆ‡¸{YŸÛ¸¾œ L5¹^|Λ•ŸéÉ‘™ïÚð%›!/z—`xÙ ÿAyq €µ¢É‹½!îÿµQbÐpTÓÍ…ÿÚ«¸o6.ajÞ¿ª"þ5 I3.ƒ1L[уk "­ßŒæZ ;žÝ”eF&f*DĪ6¦Ä»QÝ6¿®'¹FµË¢nàØöb̵­DdðZU¿îÍ1”#ƒ^@¦Ìl×»th.2ᆠÓÒ^ [øÑÎR˜5€ýU›–ÅOsPŸä6fMÉôÃ=äÔì½Òûyyð*E»sbõ²ô9­Ë鿯:ÚOµñ}i¼(-1ƒØvV;>(¢2Ѫð;›”~R:¿ªëOkãËÒÈòÂ?”Æßv¯™½ó¶·åÚx@þ¹¨ÛyýágC*8Œ”;ÛsS±7.¶½©zx¹Ïe/y~Ñëy¯6ÖýûrIõНjdzrIÍ8p]¤ÁþÈW¶£¦“'Œä‡ÊmäŠÝäìQ°JqöwëÜFcÛ~¢Å¬XNŠì’ÜÈãÜ2¹!=OnÈ0Q1Ô‡NnЮnÜ P%%r(À„Åm9{ AîCQøNÛÖ}ÂÓŒ~k¹Ëĉ½’·Žã”Óô;ÆŒ¹K%½‚;œñÐr-Ï1ús{3T0¢¸S¥„52dL;5fœgèÇŒ£‹9aç¬ÖÍȉú 1c&úà‘…µøó4l-ùrѺ ÕzS Õß–ž¸¶ïËowÓW$²/`q,E7p-ÍÜŸN"ä7Q±«¹ ÑIÝQ"ÚÐ÷è ¨g1×­1O—ãfÖ`}*ŒhçþGì»VùŒ8û™Ti£­[ >2ÖcÖ D-OÊoâ°f¥è,…VÉ£YÉÉ4ðàæßr^7£—ºüi€;U¢~n<óÍò („Cgb´5f<« CºvÅÚ~¡.ø¼‰(ŠÐÚVá·9s°ò‰’ãa³YÍXZy‹ß]9ÕôH,VüTYNU´—»#£ºí©"lÁ ’BÏtˆÝz?ªÖ~ô”‹•e÷ëx¶ÝæzÙ,,¿1^‘>Ž™“óž]E›\ȉÇpûŸP=Ì~cäÆ8"—ñw.%î~ë¥>XÍSJƒåš'Pšš‹Õ­Ýü &*0Û_ò„“«5®R 4ö×<á8fLJ#Ö> stream xœí\Y·~_øGì[fm«y“ `;Ž¥X–yˆdµ« :v­Ã–üëSU¼ŠÝäÌHZ9y0I3l6b_œŸŽçIÏø'ýþüèæ=wüèÕÑ|ü5ü}tôÓ‘ Çé¿óçÇ_œB'% e sǧâÛâØÉcëõ$äñéó£mÌÖl¦­œœsj#éˉóa’³ßüu« Ý³¹½=“÷!˜Íü‚×aóÕöD)1ix‡›0ÈwðDëIJµ¹·Ur³ÔÔMÒÚÍ?·rsŠ_³âoß…'_áW­“›ï·'>ê`þ}ú7Ø,›í ºL³‡m^ÀVL,¶ÔñDË0y}|¢æÉ‰b‡3èð W&'£õ檌MO^nOô¤”õæ5nÌüæž<ÄwÔ¤„' j¥Ø<®o?ÀîÆ4›Ïjë³LÕ[ MBÊÍ‹øÔΖf|¾=‘“µÎêÔG*½¹“ý`ØçEð§/Jlî×Ö·q±s›'yÊÕŠRÝëtÈκ| Þ«|6Rh<š†êo®Œt^öpI —šátë pCelgx(FMÆ"]`åv Þ²Þt&~á¹–äË-¿š€:óEœ1Í ÎN\Z¿y‡Û˜a4þÀÁجÏÙÈ‚ÔÛHbï7´;36ÏT>Åsk¶0•ŠÌþ9üýγÙã«Bx+6*’C̶w"d³Œ»œ·Ä ™=AŒµö°¡Fxæ2 lÙ>'—ÃÁYŒñéX‘}“ühvV2¾Æ- Kô(#  Íšdè—*éOêñ±sœ £6]Â*ý4 ­ˆ“žbO'ý(Г—øDLÀc6Ÿ‘H`¦#ÕAæÝop½Òƒ¦Y™1»Í·0¬µÆ98'8Œy†Óø%FíIÊ$rsk›•â_€*°@ÉÁìöa0'[±ša_FGäq"_äoL6¿,.Âdfñ?G9gˆndššB&!'Ð{iRäÖD&'<’IЉ®ˆ8¶2Îd²^C2dÒl,dŒûõÍgŒýËtgÆ˃ÈÛq_ÄÛp.q{õðoÌÎ2þËÜj}yIƒ'.Œ{êÉ&ÑçêI E‡2TúsÔYL&ê¡2.[ª<Üù£-r“ðUÔÀzü'w¬,vZ9‡±åò»¬€pÊú£¦‹Äg–Z×X£¸7ÓÈB$™m„­Ú-¶ßŸ·FO Ñ®±&K% Æ’+˾¿#Þ–©$2s±Í|XÑì@ 0¤'A©]ždafY%-SÏ/ Fâ™–!‘*dA³x·¨lœ?ª ¡Ø ÄÍy'­ª~Šö+ ƒI™IŃªùe+˜"½™°p€Ð™x2ÑXú–Æo8ƒæ±ÁXë‘Z Ò1øÅ>2Œö÷º÷»Ð40ÑÂBG†Ÿñ›Ö:ÿ¬Ý¨+--ßÊNo#=” –‹úœÙü×HXð·> ÛÔÖÓ½ÜúhÐ(HlÅ—dé½AV®G‹ÔL•!û_âë‚ÐÊÈé9kÖ¨¶=C&C«@£Îb­•}UX(`˜ò>ϸã¬èº(¸D*!ÃÚ;¯þ09·l2)k_€HQÖI!Ù²|bŒ§Œ¿Ë1\U<|Õ!L—?B-&ˆáp’>û¹#G/Ñ>Í øÖQÍ¿ÃìÄ!Ê"]™)ì›ôÜÆ¶†zl¢tÍÚ¥ŸQ~†œBñÀêü˜ƒzé·³8zŠ/h¤)=”*zîsVŸ—FÖ³Žö²6þRŸoQŒpį±í¢v|°%fŸiUl0x ‚8MJ•ƒ|f ¼¯ìä] ª iÔ¢˜´Éa3O‰áoÒçøN ûÜsxû‹k|þÚ «‘¸§U´ÁÌ&¾n4’œŒŽ‚Í•óg¨ç2‘ÚëYÅ)ìõ$¢hãJ\ÖS¾è¼óYU/Ö#¼’²ã1#06P”bÁ®, ÿ†#Þ̵ç›îÁ—šÊY‹râ÷.gÄáÊàG? ¤Oþ% é¬Â­Ñ N3ùþó ù+éL` ð%nô:ÿ“¾èPÆ@0`B (³èÑbÿ¸˜4²®²!vÿ¦ê*&­wY°3ñ¦pã@ÖNˆâXt7ó¦2UeÄ&ØÃ;´BÙw¬“è)° W=L–ÃþÊV!a‹yÀ}䔷 ¯âN\âî[1Øåë!GWÞîùzµË$X‘<ÙuLVÜþ;;‰“‰4±é†DßõPùv/"-Ù‹aý×)¦n@òj%ßõ¼¢˜ÄÕŠ0v‘R’k·õØå$Gš¶1º^ä¬ ÓK3Û)2 Þ¯³Y&ú+ìÇÐ:üÈbH=e]˜ÄsýßñPØ8MãªlctâÙ‹PDÛˆ.ŽÁW¾ÇëE(ìÐí¹gÄb·Ëƒß‡Þ¯ÏJãeÁ¡ç¥íiíøªàÐ'åñ¯¦æF„©F§ TU%6ô©>ù“ß´„½[(>$q™8Ò¹xM™¦v&,'véx^û´·sNmÊ£h± ¶5…Ø¿­_ g™Üä|Yø3’æñ®J)VR»ÝÂÚ*5jŸýXkÞˆ¬²%ú¹^ئ$Ë9_/#6»Ú."ˆ e\™éÛŸ”MYÖ™¤2­še;mÖ›9Í¥4:ûãàsA·žîÃÜP÷áÑc>,ñzˆtr»uŸý?™9ÐëµqwÌ»¡ƒŽÁ¹÷ˆ„žÕŸT± ð1^F±»,à^ö®‡hr©¢ªQÁ¬£õM[[ZÕ¾èï5T¥‘˜øšÍÊúÈ2R—2pjÑ÷õ|:5(OTÌ@~@eÂe¼?ØUØô÷Æ ?ËÏZD$¬ßZET@Nr´RD'¶ë&E„de!éßâ?ŸÙ»U ô!(‡ ¶#ÆÎÌšjg¡WÈvîqyë¢'ôL¼+W¼²V¯{v¾6¾á¸(7~étïk:ÓùÍCuó¬…Ù´&å‚ éÙ ìß(ÝÑ:HTô$WOØ8‰—€•³=l Bšz@……Mlb‘·y—âÒöØÜUa&Å™õÕ(‡ÏëÖÅ2m65·²„N–|©XJpUD¸…0DF‚žƒË0çEò©Ji¬‘1¹« ÔA,º1`1s9¬a>Öá.X7"‘ƒ5 Ot•‹Z,³—¨Ãê;ƒ°DßHŽY,^ÙwËR¬¤up´8–Ì+àMõ󙬸³ùn†Ñ¤Ž1c&€«údiãK²Ù8² ÈRƒ#9R=šò|Ã0ž4—•s¹J{>ÖaÂ-u¬ý¼Øñµˆãdz’tÄ—L´Žg)ãmg,¦ÖèN\¥×qÚZ·p“-²°‚£‹`ž¡r92* ¶Ë ÓRv°fUÄb-,ªªe+lë‰ÿ¼’Œÿp”gLh*¢m_-ÅíQ*O›nãlUÇ¿eþ ×õ‹Šî´[[Y¬E Û4Ä?Ú å!jå0D]© q_¡S.Ñm“ô¶“\DzÁ]ߥu«Ò.šbÍœÀ`kË…•ÚnÚð^2™ ±‰År^18ç¹€4¥Ž}R`Ò­3=àˆæCƒ|QÐW )hc¸!p7×­çóT( “PMA8q‰ Ç å,rŠÏš¹ÿV)TŒúÌZ­ßJ›Eî×W6%~J»Y3ùùMÚ«1ñ±`εªp +D_EúV ÔžìJÚÜçcp¸Ü=GNU;b½i¤a'!ƒ}U+d[)ê[¬Uê&Ñi¯¼§âš~yf¾'¡]q†IDvÀ6 ÅÇa£«ÃÞì¥k³ºª&Ò9°M%Ö @‡ÓÓ힣\—À]¶:>§ôwŽ;LçgbðÝ{09fÁo–ˆgˆ‡%ÇÚû9§ÍZ1Ç `ãŠlô2ü%v?*ȆÑ0ä‹÷ ²E§6R©µûÊo±[«ÁÀ…](ôöbÑ <=sHÏÈ7tšKG—ñÒ^ð6[Œ\Yþ>Õ0uŒáÍëF#¹KÁ¬v\)æ‡6K:Çpý€)^öa±Ë‚õ«ÃËêÕ?Ž;­þÐp¹Z×õ^¹¯›XRw-V)N¹ì]2.&zíøQ`ëÝ™i[êÔY®ðq ‚R¢qT1¯ÈEáiÇÈØÊðëmtÉëNôNB EÞSïÆ™Ð:=é‚xi»èñkt×›cigÒß%(ÚW–ŸÊÞ»åTKb-´À×[JÉ^½TÌšØIÞ? p*Õqt Aa¸òôŠeÁB=¸€¡oe2ZKw؇–(CoûNAª¤]µ@h|Ï¿{ ¿…<íÍ"˜~fù½a 3‡ñ¯Dl±ˆúDÍnKXÍF碌Ÿ£þÐè{=®¶`Y6Ó ¸“ŠqóçéE½œÍ‹ eÈ¿t¦$âÙš-|Åê8î>‡,%ÃM×®›_/è×uEŒƒ :smô³;õ^lKÍ¢;œÓ8¢ùÒ‘\”æôQv¹v)ü%¹èJ—§_¯…\XtÌî…T©loK'z´J|HÇ–Ÿ+õÀ„2s1h/) NÇžº«Û%KG JTIe$ï·X±Öå¼íý¼è•'¼í½þª” ÞÎåAoËcVfTÓ¿yÝÕ°wÊ?‡Ô]e¯³¬MíLØ'½­Ý(„íuqj纫JÌg½:±Å ü.iøƒ2ÊÉRÏ5¶ˆ¾WSŠÕuJ µùu”N âF­©J3(ì¾<‹7È ˜ÂtŸ^ËÁ}zÄDZ]?47¡y/’Úýuœ=‰Ív Mµ±ÚZ®½ùË6´º h·¸ò8ùà|éšP.¸åË:d…Î)OÐôG©uæ+ݼ¾Ä†Þ>$sQ,Súi˜Æ.ƒN{Åí¡K¼Ö|¤ß½ÎXáðËŒ†S®v†Nd¬Öw¹/·å ö®ŒÝ&תuQ–+ÄÖúNÆŠ<Òæ"Çÿ…G]þÈó3O#0¤à›=W8XÊWßÝ Q±KñÍõïx^§›à{æ‰ þ:*g’çNšáS¦’ÓOf \6.U;ï~˜J “™QÕØÄ—“¾ûD–boÒKÇ4Ìžß$Y¥º\½Ÿ=ûeª}_Ã]éâøú×RIQГK®¡>È墖_/«}úÁMVq•ø¢£6õwë öÚ‘0n¯µì(ÌÁ“"ð,DǃJ–!!^¡<•¼vAÉYµ½?­@‘™u­–þæ_´[\lI)£að&]ækì~[³‹wá²õ¯“vµŽi܈ã$ÅólÍ¡é)3K!â œ¥›tM@Ù˜~’bLšÝàëÝ1Jjè§ š±Á£ò˜Zˆ‹ ”2x:¦%Ý2®ÙµJ7†q_ýþü휚dendstream endobj 203 0 obj 4720 endobj 207 0 obj <> stream xœÝ\Ys·Î3Ë?bß<“âŽp¦RqUäC–íø™J¥l?Ð$u”H.%Š:òëÓ³1ì.Ié%vi¹;Àh Ï¯{æÕŠ |Åðÿð÷äâàÁ“qõìú€­Á¿g¯¸ë° N.V pe˜ØÄWGOüÝ|5Š•±j€Æ£‹ƒß:ÙëNôú£ïàÉéB°A)¸éè:~Ù¯å0ŽÓÄ»o{>L“US÷^t?÷kýô(º£ÜçkU*Û=«†í4Ì5ÀuÁí D÷°Wƒ”ÂX7̯ýZà #·Ýc¼×ÂÒÍ*aLcÂÕIJÞýا¹F3ƹp0ƒNš[Ñ}ÓsŽ]p|©Vp…7À0ƒÒÜ ÅÀÝOØ.„€©þÕ‹1-x˜ÅÝ4›ŸL–.Fî·±Üø5Ÿ`ÜÕ¶`äÓäwóu¿FâÕ$º ìÊÁ0Ó½é%Ðn`î° Pv—¾UMº;ƒõL|аÈ3Ø>¥8lä{$W>ŽÝIºšÛ¯òýoð~ èÉ=ÏíÇ}îSï+°lК#ßеâ}À2°AÇÍä7B”—Z²>"ĪàÎãIãén!H¸Õb¦ìjOh]+§·½V`‰…c«<âMa £ÓNA™)4³0ƒŸƒŸ`W„Ô™ø¦f<XÎFêHüš‡'~ÁOH`{Þ安ÏóèfÜ”Çå†dŽÝ”‡‘u 6¦!O¼j眪ö¼OtP{yپɌv…º}"…¯æùûq"mëÿ¸ÃY‘9.zp3¤°NuãlZ˜,{È@B R‰x>¬^“âJM^x*‘K‚xp˜¬Êâví]+\àéܼFŽ>Æ>F2yã0ÀÐdp"3DÇqj2réÇF§Gì'œšvÚ›¼ÔdV$(kã!\ò^Ÿ²…»m>ŒeÜïä70‹ãlddÿ •3÷~>ÄpSÖî<Ó‡ì·væG¢® ½_ãO¤Èm²¸@ëa½)÷}.óÅÃÚÅ×éâ&_|—.^÷ý_>’»ßäŽO{Ç̯Ï7ŸåæótñÔ3*§õõÃÜñ böN*}ß”tØ4µSvqh‚0î+X_áÝëb¯ÖÕÀy†c*O¡åm,ôRy‘æBˆUnmä̪,³ÁÁñØNSó5e£eÚë¾'Ì$–É®-À»qpœð=YÏ‚1o—ðÚŸ‡CBîtÁ‹”…}ê쓱ðƒ' hÁ*(#\M‚3jµÖˆÁEÏHcZ ºÅÅNþþŽسï¡Y3ív𠨵s©\ XI=t1Ý0ÊmCËjp¤…q F-¸U݃Ô“ÑW>éÑ­à‹ÍŽJ©¸Á #/¡0ÈÀe¢­½ÌÍiq×0 ‚yJ׉ge~88úëoß+‹¯¹‰„w@|D/Rák4…WU§¦ ’f_ÔÅœ03™ÂXdçná'+b®t=`z´ÍÂÀ“@€( NœÜ×ÂØfÅÎuÛû[ÔU±8Àµ]8N;N£÷ðËLIÿŒO’øcIº›h/ï᤹jçBœŠ@×2ðÝP|#º”ÜåÅ›šºugï®V³ßJåµt’Ä=™—)G}<æÅ¹rdsŸ–k&ÌžiÌÓe ›?àí]‹°h…(ýsá‹ ›|Æs¨[ÒX—5 WIKb÷e`Â}𱼄_XV˜H¦K»„?û×v·d ¢ ˆï™ïH7y2ãÛôäE@¸%7.B'@ìsšÁ$5VÌ:´¢œ*«#IþÊ“z¶ÂöýsØX‰1ÏoÄ2KcÌâZQ{àÅò{ ˜i' pƒûyº­ÕB"ZF’§>+ÂíÌ"7UÖNKÒuQ ˆ¯0`â9QïO]zbðnÈö´ÊçFYQÕfÂ99«È Ÿ{ÏmDêIfï6p8£0åG‡„ªÒÓ%EŠ… ³eŸoõ‡o –p J­é¨eÆÑÑÖÉP3yRl1Î÷A!®áöt-T{¸­*Q°Óº@Ä<ÙÐó¬çàı‘"5u8ÕŽ¦Èxp5?™ÝØ4ø8›^pÉD+ÐTû.JS+û(©ÊpW jwª[ ZÏ’ÕÁLé$l^ȺS¨r¢mßQxl>Ô™EBÊ”™Õˆj¾Éêÿd)<‹" äÎgÑ"5Ò0ÁÍM>ã…) ,¸ WtÜaðUkè*.æ¦"S‡³ì8nG™8)a¬—ÄûhT9´óµfjŽŠ9+ŠÞ@«Géü0ºNíKÆÚ7òx›£S}*MìÕ™P©s•=Mêðên×Ö¥…%€…-ê BÚ†0âªÖ$‚ãÞj€÷¨p ìèìô.©ŽR€G„…8WùjQ@U<¢eÂPÂÌ“”äžã”u-k£¶•’g—Ž×¦/4†< ñx^ñê¸Á¦¸,mÊÎ ÂPñ³Tx¾öÖ—¹8¸ÜÈ`þä³Ü—æáËÒA,¦íxƒ„g²©ñ¸cÓÌ`oÎ\o»L—aA)vw%_´`å}Ý៕•Q­¾¨ë*‚¸µ¬Z´Ø²^q¨Ã($uÕpâŠTJÒ¨hŠ\×´–¹¼Æ¦Ø”]O³U?Ë[TΕǹ©®*©³bÈ£XlHl¯ÌØïá¼{g<fñ}B þƒ?ÃïbƒG—Å?˜Ajé Dc‰è¾¬¡üÒÍÏ„”Ï%,2!#욟2z[ÃDÎ+xqñ@“ôŸG÷8;‡»£Ìüíû>Œ_›¡‹g6U ˜”ö)«IezûU{–‰Á'rŒFæbº«Œ?mŠHrÇÐ^)9 ¿|I|¢8ó¨én³vþêŽEÝU|YMí´Èc”­‡]¨1{ÃØi«ìl³LÒNƒÔÅ;V6^¿NvK€^ø„Å;Yº ¾òú#û,"Ž0¢iƹ,w å\Ó`dž„šR“aËG0šQ4Ág<iZ ¤3 u™=áUT‘J|Á£uq³ŠnRO_®%éÎs¶ÛúQþvD{—Lµã ·€4š€4fC·‹Õ–/Y »‹å ÒÆ$åc·ÔÅä»J/ªtÙHæ‹ôœ”`¥‰)ýZÉ߬ÂùeH5« år]¡ß³n6T P=+%vš÷Þ5_MUàhï¬ñ/ÿ#óuendstream endobj 208 0 obj 4716 endobj 212 0 obj <> stream xœí\[sÅ~Wøzc7åú~I© „$ÄIQ@%¶dÉ.¤•Á–Áÿ>çôõtOÏj-/© .Ö»===ݧÏå;_ŸñÏÇlâÇ ÿ¤¿O¯Ž>zd/^±ã‡ðÿÅÑÏG‚;ÿ­ z¹z´–bâL¨ÐM˜շkcÀOë8“ôî¿Á•Ïð§RR¹ÕãõFÃWËÝ'_ÁB`®d!JÛ‰9XËÉÌ_ƒáÿØQ9Úq£8Ÿ„:ÞH6Yî}¼ás˜A˜Æê!~< 1Æ9N@®îãÇ+ü¼Á-~¼À×øq¯ôþ >÷øñïõFLÞ;gÂ-±Ïum„•ÑÐìW†ÕÁŒ¼—«ÓÒõIíúKiIºII–7@H÷v€³8жŽ{7DIŠ˜û㔯P]Œ±FÁWÜxÉìäË>×Á·kaa²Ò†}VžÂWçx·RNм`a\~ÀÈ.­Gƒ9<¯ò!â½·IpµúD؆½2´saÝÄTÐY«AyGvþ—b ßáÏïñ#Xüüø*wY}Kççþ [Ò‹‘Í5"7>+okã¯ÄM8\ ·‹¦¯´¢nã§ÒíYíö¶4¾©Õ/\Žæxº¸ª«Òx5ZÂvänwOóÆ›ÚØù§ôý”ÞËA=Å#ªn§xŽªÕ¯‹³ÀU+\H²h0Ž ðñ[Ū_a0Óü­\M6h˜Y]D‡ãaåpФ±.§µíö¾ì 2™ ÚzÛI¼š×ƒÖ¼‚Q}wÇ0úkU„ëÒç—ÚxF5N‚³Ô2^lòîÁäÂRF´ª'=ÁÝ“ULá^Î…‡x¹¿Áé*‚­=ÎCN°ÎCLZ ¥ÃܨŠÓ€‡ '¸9§M…1aG>ê2^RA×É,†•|9ØTÜ(2æ‹0tÛzù6ƒ¶Æ&%ÀôÈb@Ž<,í룓?~OáZÑ,`´äì•·A»Š5•/×k°–QÐíŒÀ¸°]𼩖í(N)› ª€–!ˆÌ̯£!ŸÅ¢“MHm&©ÓD­÷|¬Û@­<ÅïŠÔ¡$½ZÉVŠ ÍÖÚ5+•{wáœÑÄÚo†$}µ}:j€ð|²‚gCº%¤3ï s´å³ 5‚ñFZ-Ê𧀶˱=MñsĉÖ›R/œÔ€ÿ8-`Åu€(4¯³ó¤©Š ŒO ƒH Ý&SèðLÝ!¼ø¢ŒyšÆD‰l²H6ôãGLÚç þ’>‚c¦ˆ¬ñØñ¨/ F³2= Uñ:Ä”·Ëx3ðÿdãRHqVUµ¸NAI¨€âFfF,օ²«§q^Z„¸.<:Õ)/Uõ¬QDŽïŽz¢ð”ôÙC˜´hkœ’ +'šJQG#:[ÖUõæ.ÛÕ% µ?|&à0Í0„Ñh”‚µF‰+óUbÑ*ƒl­ x ¯¤©Šœµ(äÔtÒU”*ajž×‡—[•Þ3=HÚ¨È1z°P«éèõú pü1^Ö5Þ$µÕ}-³ŠV¥¼‰z‘P:‰i,ÃÔ8Y@‹åbÑ¥Ÿ’”3Š›V .Ñ¡ù`CõÀ[ˆøÀí0fŒJ×'q[ü²wƤº÷®þ“½ëCcÖq#ç~¿>AZB”˜IqXQ1- „ëôýi »q  œ-@'b•Û%ÐØâô‚#Žà{áó­}Qì¾–Ò¸ßylš9lLêiÉx2XA#n«ÅØïº2µq´ÑK|@=Í @'q_Ępc9¨*ßI„d\ï­+€îPû³² •OuqòbÝènu†¿¯2òþDGˆã#Q+âU1Ç^‰ÈF˜À[.%"ßäˆë•<ÿSüø²ÍóKîÿ¾yþň¹»%/Kž_ï>¯_®a§À[JòÄßFøeÇ*švoww¬mMNŸ¸-±æR÷Ê8oF)ý%Iéç|Õ­a2ðb¤—äd²2´‰~Å|»ÍÜvðÐyÈ çW‰#*Nìå–¡º;Ï,ËQ²¸’G !îú`Ž¡¿ÑûFÿ?ê…Úˆµ§J±ê€N¡sÔ>NÈÍ u4‚„oKÖ³­™ÅÙ—¬Fz6°- tAE„&üh+"-Â1JbüÌtªB// ,Á-g·hTXw9ÿ–’ 6•’ Âª¶©CäªÅ8Ñžá0ÌâIÏaöž-J™L}RøDz=©Ú~‡)ž}¼ŽÇUÌS‘9—‘†/p25£61²’Û·CÐEò Ä´`0zu×yDXË]«RiX”YIÑA\É®$&à ql´ Êm¤¤+øø¸ƒÏ$vº­&‘Q“SiXþóÅ«Â"Zm;ûD¥éÉõ•ëè,p‡­âåíàòY¹Œ ­»%^FYàA(ÈF+¿-I—`_(ÌÎÒBªãs[,Á<ÛΡc˜Y7pr|™‹é•#Ï"QUWi’™i 8U2šp°èüxÙå–^—*²Ä·Óqâi”°dÈëjµ‘Ìjà%¬ÌG‡Ø÷ãV8 gB‡KüûÍ LÅß"dQÆO¼ðØŠT"k=sŽ 9ëLý ·äéFYz½‡L’t\dä\~“$шC'dñÔ‹†úNÀÎÜ÷bÀ9E™†]Ìb9!á`ëR6ò°ÍFþùÿläàÙHíx3ÊF.oK[òcqä%Ù¾U!ß̲‘ôŒœ˜Ü4K$&÷j_2‘9>ÞÖ©¦3OŽºÛn;TEü E—Ƀs6ž”³QÌíÇÙøx8˜pá'Êç“ïWs¿_Cš(vDc5ñkÆÎžíé lãzp§!Ÿ²«ýº °þ÷]º†!Ä®ˆîXxÄ(©Dõ‡—É2 €ÎË@ÈÓ?ÄY‡‚/ZøBäsAüobRC030©¸Á1_ÖUS˜ó< ‡3!ÿ¹®õ/í‰RÞA S®cU€Ó…¹Ña͈‚nÛ£Ÿé¬éؘ"´j–‹vh!ƵYnŸuéÀ=u‘žƒ ò²ÅœÕD NÃykÒvÑÞÖÕ$´GH˜¬h¹¬4©~N°÷>À™ëEx`û:q” Yß û‹§«þ‘b¥ì4tô ±A<ótç¡&´*.T=™ð#¡÷KÜûºÀéS¯CS©ÉÞFT*· Æú L¨Rå)×!7e`‡¹sÆŒÁ‡›p2<œD¯LÖXïl14%@C$vÚŠBÄóH) òÌi.ÜWö„Uw"1„dä´.–óî­!L ÝXs/CÎ"èŠIe+ô\ci¼—kDÃn•ª‰Eñ\aC£ÕÌà‘JšE4Ï‹ø£‚ÙâbH•1 äíÈ$Ž’¢ó6?ǸáñEÕŸÌ¥BÊ&‚ê—Õ-&‰´‘ޏëë"íÑÈBµp"š†…!QâÛ`;kã³/q$B§zBˆ¼o-oÅFÉ ¡ØˆŽVMLzê9‚^è¶ 7WÔ #}Iøaø"JÐ"ËN@)3K’”ÓÇ·±Œì èÄ3ï=«”¿Ýùf?•΢½-ÊŽôT2˜ê =€¶KŸ©{í’'qUƒR¹¯l ÷®y]XSé“b"ÅÒ¹ù›„r¤iWqNˆ}9ˆ´¶7®ŸÚurŽÇP:3¨„uQ÷E]JÛ³xBs‡åW<Æ~8ˆAò»‡—%–v“ÜzõùkT$mT4 ªXý;„øÂÇË4y‚/V½Å!bîÞÄš'h$)(Ž…´.Ã%¢,)j˜¥YàéëMóŽÚí9 T-xWÿœO4ò1 n¨ÿa^˜¬>- K³bÌd-ä3\±|r¨'ùý*CJ§ÈŸÒì#ïâ’ä- ï ÔW±À!§ß„PA³PŒªùì%SÆ0˜Þ1µá.’€p/!+f»Ì*Zf¢®L©›*>Ÿ cØ4þQ€»¼GK ã^ÞVK@׬¶«A°?Jâ›\4º]P«f›¤DÒ¢GO~ê}ax|¸ª…>>h첦ñ<¯ñÅ©å“â”´]uIß!¨Ïÿ<ù\S|Ãzì/ &Q0ÁqN½GN‘18ì†R«ÝÞ +oC@—4pÈÖaJM‹&ªK¶p÷›°9ÁÚ§”6Ÿî((çñ…Ô=N²$|¬€Ç9KÝ&I±Ú×—Wƒã–„ÎíÐQÃiG¢í|+¹ ƒÓ`®é£×Õ Ôäu1—$Ç?ßÔÆfKê9 m¤×Ìt¯ΓÏëó > stream xœåXYoE~_ñ#öäôÝ=BBÊa;,òï©ê³ÚÛë ±2öt×}t}Óï§làS†?ñ÷b=yðÂNϯ'lz ÿÏ'ï'ÜLã¯ÅzúhD\ÀÊ0²‘Oçg“ÀͧVLSlÎדWìu§zýfþ 8$§B°A)`šŸáã~&kÇ‘wO{>Œ£Sc÷°Ý/ýŒ¶¢›šÃ°*•ë^Àª±]¬ î!ºG½¤Æy1/û™Ë]÷=ò:ø'½V 2‰«£”¼{Þg]ÖØ¤ -] ˆ4w¢;ê9G”/utÀ ®Ä JÀ ÅÀÝϸ/„U¿õb`L µx¦;ú‰Òhº°<„Q9Æ·ln:ƒX>Ž!œ Mvñ1àc Ò´Ñãagƒ|,ÑÆ8ïÎÓkwTîià “?Næß¼ò´eúE–y’e®Àt>£3ÝEÔ+0·ð~“‰–eñ¼µx•Ñ&4但<Í>üUrš7¼™yc]ôTf«Ñ@E(ÿÛjÛO‹íGɰ`û’Úž‚x†;«"~›‰NZÖ]”Šͳw޹î2/n åý'?÷úq˜]@ñÄÄMÎA.¿3›98£‹_èºfã—¸ýäÿéöñ^·kïJÕ^¥Dëe÷m°á6ï_uKºTÞû£¼ø±PUSÀaÌÎâ"°_·BrÞr¶bß]\´¾¡ÛÄ 5ZxQd[EÕ÷ñB²³_L¾)‹/‚+«Š ÿTÒ!AŠÉa!¨Ã—hOój*õ4Ÿ ØLâT åc˜TœÉî]˜G†¡Ë þâ0m!Ý8nU´SƒVÚë¶ù ¢ç©ôCíhíÀO ƒØÀ Œ2Õ¨=;Œ4 Ó“(Íì§E{Å.Ì8(Iôl☱襅q ³œè9¸@¬Æ×…wGHE[)£‹¸FˆÑg½[àñ­"Œ-—\2WiD8lZ#°GLYùíQ+0MbY9Û}B8<œ˜…™tÌûù¡× ÀŒpÞ›U’K-IlD)Ô˜Õ d‡Æ PÓE•!F@ºm I]ÃOÌ<ìû¹jŒ5*ú‰Žl2’!‹ë  0‘ìDç“Ú“€H+&ë}dÎuo¡F$W¤jdþìÜBuNS2WŠ(œ÷š¼Ïð°*!ÂHÌB(f€Š@‰¹'Ϊ”NÜÎÙ€lºDb Yˆ Å‚˜ÉMÙA #€CŽþO ëÒUº¥`÷6—”A¥vãŠû1®JîÆ5¶€äbJ¤ÀBÞ<Ðm¢ÄÕJR0×£ eqœÁÃq_iI§§}X©z²~|AÇp¦ïZù9ѧ­NYÄF€4©²bRç¥ç°Œà¬U R( EùïJ Z®@-Ò–fð¶°õ«Rª¹°‹ø”|1’ÒM‘ÕÒ;N“RÔ…z[* í¹k~ü«ùÍ!ì8HÓ±~ÀÇa&~’x»Ÿðñ¦Œ®×]&ºmÍዾ†ÊbãÛÁ¯æ–Lan{È3DʧvWNeW^ŽUœ`22k¬H„è¾¼_aqq™å¬ÈZ&\7 3×Yá @¨q1¸Tâ·,¬¨æ$æC_wIA¸2 )ºï*°1Ì@1ú“&¨ ê>´pÖª•ô .î†û¤•ÕO-wÐtÓtCË£Á󺧀ùÁ ¡ê/th[u‹îe vq8ñƒ;fàšš×Cª4$À¥ÝÀ…Ý{À+ Ç Ud[ûmc!1ÌImL„>¨a»:Ä“ÎY_“€¦p8üÛ)¢´Þ˜n^° iB˜7RÁÙ®U<]… ì(È)Ƥ9€‰@iß…~. ø™h Œ† è/VCE£Œ Nô¤Ç˜Øv8êµà)íÄ §TöÂÝ6åP°YR[M Э¬" Y*ÂX3b«áþe·‘â{ZBÅCS›J – &N\,Oà‘®Ø ~˜Ï ¬e?bÃTüSäÏÕ †ñ.¸I7ie¼£=¨B‡&Ø Lµ&ó%A }|³•jªP»„Öâ‰7œ%¬krsïý!íQ¸$kËe%³,ÔÿNîPz3áͯ„¯Q2@c÷}Oùâží±” þÝã„ÏC)²CN†w §¤ð§°Î"‰æ¶”dÁ,«h!sçÓ6H¾,È—†ÔrC"AêýÜäÓgx†˜yÚ V!´ê“"D«n’f’¶úƒ·U쥤‡¸ÛÂnÜ ÿ ¸=ÇWÿðØËO¾pÉs‘î±È]äëžëx´{­±l¡š=­n2p+€\ß^fXSXšwdË¢h„'Z°Ï©ßTxgWÿ’º´{;T@⪂oÖ A5@I`+´œdj`¹åj¬Ò¸%B°BÐØá|ò+üü š|]endstream endobj 218 0 obj 1886 endobj 222 0 obj <> stream xœí[Is\·¾3úsÓL"¾`_rHUb+¶â”œX““ìEZ”Ê\´Ëò¯Owck¼Á›¡$Vª\%«, 1@£Ñýõ ðåJLr%ðOþ÷ôòèÏ?øÕùë#±úþ??zy$iÂ*ÿsz¹úû&…•“sÊ­¶OÒb¹òje½^m/¯¿Ú‹É:ãƒ[?Û«I)©õúd#¦è„qý"Fµ~³‘STÑÄõÏÓÖÊõ«Í±ön k‡”‚ö^¹Ÿ¶ÿL{›É/qok'£cXmÿu´ýããõß`½–1Èõìd‚”@ôÝÆÉII‰Û-Œ®®h‚pÖ­OamµV°?|¯1~’F­«Â©«Tœ¬ò‘˜ö!8Ÿéh5r TU0Ö¬ŸÂ°PÊY»ùn°…šLxÔ¸y›8wF®Ÿ´QNù¥(]Œy.MhüñdcQÓø#¨˜Ôð¨$°c`L*Eš¶nÒÚ¢ÌËÂöý¶üjô}aÁÚí¢°vãôضÏ8øÞOÖX§Ã$¤Ñ€ àr*ÑzÞhå8ú¤Ñ¨ãHÌEb‚¤k-õÔ™y‘—lภ䨤ħC©;ïYiSìû‰Ú8°ÉÈŒŽ«Öÿ€ïa @åòà? ŠF4¨¦`Àœ·g`ÅÚr6ó{ ¤5Øi༳c7FQ·ÆNÚtŒ*`àŸVļBÈ"/ØÀØŠNË”:w‚Íð¡ðDѯI ¸©ó°©j‹pü :ç)T^fF0«JxÀ×US_c'N‚%÷ =çq–ç±Ô0ýŠ5ÃÑû¢tx ãYÒ“6Š'Ïûjâižmãoh* ¤c¼õ渌·lbÆ&¼ M”qxÊíº¨²R®ÀÒŒ$gH=!—³±܉^D³± Í/†'mäß¡çTJûÈ™Ð2ßìÆœ_pc½vP7/´Š4»c…,+†IÃêSàuR«a|–I~Æ2"­bÏšŸ À›É+:ƒ Æ€¬RX A!ôˆ¶r¾A7O†L؆¸ÑŸW°m®Q°1ʸ~ŸbŠ’ÙFH2d"xP@ Q’þ €{0a-À°,H²Ù®I˜ÇZ:ðI}hà’Ý\Ó…pÃ/ÆzØ|M±”0äF%"E2ë¹NƒBø]7ˆëYœÉ~„e2èSÇZY²¶EO.XGfËpÚ…†™$°ø¢Ç5ÚIï%î–ŸO¢V‚D½6fx3¿s‰lCÖÔÒ± Z@šRíd1>.RÚI–¯ñ숈ÂáÇ>Ÿ­ªŒÌ®2j,d­U= ,ðN‹A,º4òfCy\Õud=Y`Ç„ßapÞS ƒ–@ݘ")KÔÀ-¢?ùDŒ× ð㬠u¦kõ<›úÀyq~䜠M:rÎ<c×›LxK1z¼¿íåb'#ü€û[ô<Ëv…Û˜Ûȹf <'“¥“ELÍÏv¹iàœÈ´—$SuU{‡QÌqþ¥®Æº‹ÌB²É7I!h™1>k˜Ï™4¥QŽ ±Áþ”Ç:Ô°—¥Úm.KÅ*©fŒ™Å™“fPèÒ1hK©ÈOÍŠ¸ÆµHúÀ²ÅU««ú58I?¾`Á¸`ÕÔ0>µ€ò©Žœj©Þx´¤€wÎK¢wMŸ¸x \NJ`%TÐÂ.ÜÎ3#Q¾gÊ(b3ènâã¸ZŠŽÅT†èü\s…ü”ÇK<ø…%óqÙëXÇÉ¥ýLÞ€F& -$æFx { P°€„"ÜÆ(̽U2˜äƒCÄ(;³¹Ï+­ ú)‰1@=#Tfb03$ˆ€ð̆0×9Â, XÈêIúÉÆE:“zaòƯ¿ÚÈIê`ÊNÂ`ô¡3Ä 6#¼4¶mO<JoÛÇ'íã«ÔÒ*xFŒÍ}ƒÖ(cóIñ|Œ¿z¶ÿ_ÊĤex3ClÅÒÌ=jy@ÊÑ#d¨`}‹ 'ìSòmãY+æ¬Cqômʯ9gÅïù Ï_™èZÎS)ƒË¥: ¢àÁ¢ç£âtCñM;m pÑ”—’n øÜ_e;":©‡µ[xàAÏúØy5؃¡Å^¬•8¶v*³QÆá¨vìdleØYÔnŸºVI_¤ÓÇ©æšÑµoÛö3'…ZÛd[ ˜õ×°pñõ;l úU пqOˆ"P§>Ä0,Á9wË¥0*Ž¢_×{HÜ Ô8צfŸ¯¥çQ·…I–Båö8¬0‹‰×©Ø-YU|VFQ†æÜr¬ÊÍ5&öò©¶ŽAUõÍ }u9W ªÃÂÜ;x*Yº ^AyÊç9ùS\"È¥| •dR†¨Œˆršõõ‚£²aß®}B°Zršú :–†»Žž²¦ý5=ä½"ÆZd -"4J¢ùžx¡ÞtD70󤄢û¸œ‹šó=„m0FåkÅT…âÆ™OJH#‡yhi+ò›§¢´_U‡²˜6ØœwO-Á7³ÞÃwœ7(î4hs @4- ˜e6¹²³\žÓÀ™xéz£{ß½W¼ÀyŠæô”À¢¾w*2“%ð)Ÿ|êÜ£ƒ22rW»çÚ³^ð¥*$7—ËQoz«Øiqt|å„1Ñ2v/‘WtÏ@õc¹'¸þÅÈOt-§êIGÙ÷šG föh]"RNØ'"¥Ö«V%YzÉ’ÛÔ1UFóŽi ¯t¯ÖúôM±µs+É}ñÀÊtûP=°rÞ×bí¦ÛðÀ¼dB×N“[b!c„ˆJ ÂùNr•è$Ñ1J¹¾?¢§\ÿ¸Æ¿ßâ_ØQÀWšŽHÐJ³ŸÖ/°WH†‚¦Rg'Í9iƒ—uÍlÔ^µÁ÷uðrƒ×VzŠîiì¬MüyCIWÒ­¿‚°” L¥Émr£pÚ©ƒ¯Ûàó:øÛ~žÙš7£#·Á·£5?nÊ(*®^™¤îPSÒ×ø×w•@ÕÙM¥ÙÈl¯©&¼2çª ž0ÑfÞkƒ¯êàûª¤¦âë6ñ¬*©£ꢊá÷¬2ìž*¡Tö}%pmý.ìêuüf6x3¼§˜1Þö‹ð ¯—؃/;(±y3þÒ“€þ¶ê¶šòÊ¥«ìÜ£PPbàÝÑ-vå‘ä »ò˜#3 ý”’àlU:ŸÙ•W/jk%Š·Ý•O…‰ÿè¶<ÞŸa+¹Üq›É¶,¾o7‘VÝ HòvV$EÌyóUI'M—ùÁJÐ*¿Ø-8a‡À--¶tpK|ºõ MÌaÌô‰uÁüe!dëjVð†Q‚î…f¨À—s2uîßã…F•œÛÈô^ê[ö m´Ÿù{³z¨\ø[‰rŇ€ÊÌKÛÏè«D|áÑïvæKÖOejý]¨M÷öwâøÌ H•»*íú¾#2ÇTõ§MíÂ( z¥MS²Õ¥èQìÝQ7ñ“zã™IFª¿Ãb¨~\g"o?ÕŸK°_ËÐÀæX_=8ú~ÏáÎ !¿{¨qÅr+'÷ªìZ÷@Ep rF;=K#ÝüÂ'ÍÝó8Ûuƒ{ˆ°e9‚Õzê~<¬-‘ëMÿ:5‘µ móÜË2Òà¨C¯*RSÔwWbù€=³y€©3ÿ°j©jÏcvVÛ²è´S3^N®5ã»·¦é½!ķо7Fï÷=Òˆw®wø½"gWYE¢äÁxû²‹T8ï½wÊ)Iž÷hnÐé”;4ºi3{ОŸíäìFÓ!¦õ>Bspñ‹Î|-1ì#²ã¶÷׿°è¹s½‹~cyÀ8?ïá9t´ùêDðKÛOnï<üRÜV] oTü@¿…ÕR|à—¢Ýó׫œÐ}%{“TžV襮!R!ƒÙw[`À¨ðÐrÆ•¯K12Éžoé—ŠðÔßà–ù Ý¡‹âþ—2rêv°F1:un‡wQ{ý¬6ÌCÚU(C_ý0¹{ƒUK_îÜ9an•¬µ¯é±ªÝ³ùeòÓý^T4•ŒÊòQö¦µoÕƒÜÅü½éða4Ë|Æ^•‰=…á?µÉoD*ýº{—( ZÄâ%&à P$CêvJÞp€,™£·/g M³Šá¤%j÷œãŠbÏïXP.h%\÷r~šèÌB]Á¬P«%*$%*qò®ýòO)X™¼.BI!ð—6»9gã{ˆÙ#îM˜˜¦ÔàQ~]pVI²%øi6àO×Ü“c»±øýýíÑàÏÿsgº[endstream endobj 223 0 obj 3679 endobj 227 0 obj <> stream xœÍ\I—Çöy¬ÑÇn?uQ¹g^üžY$cËhad,f3ƒ`ÀÒ¯wD®UYÝ=#,Ëz†¦*×ÈX¾X²Þ®ÆA¬Fü/ÿ}öæèÞwnõâÝѸúþÿâè푈 Vù¯³7«ûÇÐHHx2„1ˆÕñó£Ô[¬œ\Y¯xyüæèŸkµ1k»1ÿ:þ ôP‚õ°a=t:>‡†6[58‚Xÿy#†¼ë?mäú›ÍV Z'×Ç­Í£ôTi¿þžŠÃ:œi=À)à t/=Ü(7xìúï!à©7äí˜æÁllœñ!<ÕnB¯ãSLƒíçkÁö°–áåú ˜ ›x˜I™<—0tP º˜°~ºÙèë„_¿‘Ã8X÷ý”„¦0ž’@Ke×_cw)¥µ¤áq3/ÆË#kÊSH'Ò)ðsÛ ýôj«ÆÁ‰Òi\!Ülõ8ÂBÄúcšGŒ*>”²£^¿„u8çÔúýF Þ[hø 1öð ÂŒA­eûùÚ4`³½Ùlå`­³º¾É3>ÂÀN”^ÿ°Á‘6~}ž6¨ƒiKúýÆRB G:å‘täáåFºÁèWœ† yýÝ öê1íYç-îÚÛÈf|JÂtmÒú#e£Îò8a#KƒÁÀñp}Ý:uô‘À—‘O%PÖÙ§Wœ¾d¹ŒFNR%¢_·cLÓŒ‚rg}†lj4E¨ðu5˜$t`ÄŒñù¸ðaáK¹¥ÙÚ‘ _db€â¹åòˆbßfªDi0Á'âà¾Ø˜øwë?Gãi‘¼TFñ n~”° ªÊgŒÌ~ÙZ’)šVmÆ¡ô ç|Ùä4^-pùèáý²@@ -ÜL§DÞ̦yt0QRs-†˜‚i1‰T’!ña/´k#è·Ñ/ððU&>yDÔvðG“Þ¡@q ‘'¼ý:±tãEáÿrPLÒNÚ´ÒžiÌûîÉECÐc.&ñtE>J=ÊÖ…n ©¥¼®¬Ifl¼6‡66["";TmµG;slQ% È„á¡Ë½•QQ\µŒÊþ—[Ž!¿M@K{w%À,X¬rU‘Ï/`úÈ¥ÆFdˆ2 "_"G¦gÑ–¢5‚?oð”9XLiйTƒNA¯ÿ«“cl•ß.çÀ¡HçþÃG°Á5Ã]™¨%X)5ÑxÉ€ÿ) ¨ž¦éqû{á¡–É0xHѨtc´y]5û†9Ðø×v$dQOª×Eªãºû¾ 6ÜÄ ÑeF­Ð„¢Ö²¾¤R-j¸¦g2Qè”ëžM'D­:‡!¢‡šÎª‘ÛƒGÞÞ^Pýítóqy…e™ £#?ÛÔfj¢û'.(â7C»³_4-8;-Ø–èµæäü~Jö@Zçf’…Ã!êQ&Š÷óÃE,Á±,™qn…Û‘%°›Wl—=-•@ín)!"ÜñÃpk0é”ÿÁ‰aPbߺî䘞gØ0Â69) ÏÉÑÿ\@¹ƒ¢Q_Þ5áêÄ"(™Ð:Š!p º‰Úò©õ¡tƒZ¶ž‹‘LFçq}ѳ™Õ\æÖÏë ‘q7Ä ž4ö¦gOÛ8§íáëúðªþ:Û8x+œ^¿êYÇ—ø(ƒ¤?6ɲ«dH>©5®ã«£ã?PÊb,éòFÙ'•ä‹4æ¸DMh<ÛÝɽ®”¥Ô®]^UÊ6’˜CÉ^˜Óðhk ŽúµpåmsîyДwVyF{‚+š™Êá9iÐaMd†Ÿ°Ûe@b,‡lç-8)ÙŽhyÜ&Fpî«Vb‡ÚÄ1Ñr2‚‹[)G©ñx%]sOãõñÒkŠÖh·Šì£ÔhÇiŸ«Ø§f!ƒ\r´¤Ð¿ SÛšC.Ò?Ø =ô9É*] U£¿nÔí‘ôçºT²õy\.ž$G'Meò¦õªH¥5¼i¦¢že"P@@êEëTU÷@Öü ¹£ÙÇf9H2F3êNëXNE]á‹Æ4ŒÀ9[ªÒÍâ%WLÒlâa¥bŒû™‚. SޤC¶v6¬¿ÇÅ9„PCä8°ªÞ t È´$ÇÓ¶T’ë@%ŽƒFu®G€ü“È–D±G¸QD–%ÞÀs\þH"s8¤¥ž„Ýž \ú÷§bDö}òÀíŸÀ¡;ðVÞ©]ŒFv±LÌzR1A‘÷CC$Mþ®‹å±½Ó…ƒ ûÁàŸ·Ùá½½Á“âíÜ%xR$=Ȩ!gñRd2m“ÍiȽD¤Ç0ÑØÇ'rrOeŒ4.¡ï¸?'ûÎî$'È=ÚÒhÈÁÃÑïp©}ÊÝ´Ø&1„´?&ÎÇÁI1‡òfKGX”‡Ó0†*J'ªúšÉž°ÍÁ¡ïèãó]ˆ0C‘^±~h0f™  ˆã˜Bò±ä6^¶Ï½\ÌÏt\I6‡Th7,=—}äߎ’+X ùÉÚEý‰¸8WC¾<›ú·Hú:Ði;æÇ•aéâôÔ&\àtµCÙ–€Ù&Ã0yÍx6޾=z»[dc=,ݯ”°Àþ~¥Q ¬Çƒûî=þÛêý7ÏŽîýc%Žîýÿ¸ÿÍøëñÃÕïŽ=^}{ËÒŒ[pžT|pMu“£¼jô¸+—×*éWY?Î@ÖÿI@nÖ,ûk†EÉXF |ž³¡³¦Cý/F¼mÚ˜ Ù™Ð"Ú"…V“â”±6¢»Î^r¡×ŽÆç»ÆÀúabXgOTgõWÇ ]q³ _i‚V&‘ŠškfcLj a¿­Å¢Ä%¼ª´À‰Îð™6`ª.¸]Î"·´¨ OšÖ™±íEŠÁQÇ‹åæLr<ùh3§»ÉÞHÜ™ƒÖI¢õ²b.“ƒ¯°db;H¸:ç4Àâ]ÉС ×sxªú-ˆr\²9)6ðÕaá)\ÌæÌãS‡‡MZ'Žæ Éê\÷âUÏiDªXêÃ6æ­b6Ú£»"þgñ«£*ö ¨JcšÊý€˜²è0Ûåpõ©ïxX˜U‘jš¤RSŸ²5e“_TäÐ*æs®š`"µ-õø®âƒIˆeŠÎ%‹ù™ëÙêKºì€8$WiºTÉTp»Â¢©ÙY&@-0*P)D±Y‹n[6bSåcÛVÏ@]´–8Ó4»¡HœÎ »ŠP/£leÝʰ?ÌÌ®#Øï­‡…à·˜0õf“‹qÔò³»gÑAd“#8—5ï˜G´»ªU4px¼F¯<·GZÀá›~†®ÉšbŸµ\pÐÓÇŠ.Št1{˸º3}Þ²±s•P„j^yµPìó"‘ VxK|* -åzÙV˜$6ª‰5Æžr]Q £“ «GIt±²³‡6Ò^E¥¸fmF.r’z³dæIMN©•iá˜ìb¦íÆ8¡êàBÂÖ§3nåÀñ-QC7S&Ká–èµ ê]2¦{‰”žU 2½×ú™Aô)]Œ=,¨s’.T¬ÅŽÔ¨41spˆþÆ|"à°%žG곩炭Êv¾Ë1 „cuÐÑÅ2Þýh27FøÝ ?=«qöPAãå¦&LÏæÀõªNÃ+Ì* ›áêpfQö`N¥±ÀSÎïÏš*D»K°4þúª‚«ïñŸO÷ÃÒ_Ê™Á£r(çn› ëQ’’½v IsHt>±ø2F‰,Þ+Ihuì(ûzEV´¢ZºM&l_ü˜ð—†TØ‘#Å6)š$‹G'*ÞgèsXæ«ÇÝÀ Þ·Xð€s÷׿yîöC£JÛ💻mÉùÎ*|³ó’2KÖÔÊWx”cåü„ÿ%OkæNšÃðö}¡Ù…çw M¦Ô~¡É o/4ØÑ¨*4ÎÇ„Þ󄿤"W3îí·@ZT5 )W^ÁnS>ŠØB_Éêx–¢†©Ò_v¢UÎÄ£ð)Õ)“Ï·;æ)¯¾gÐÔi&ºŽ—M×"wvë†ñR-ÑÅp$øFÊ哼•c“˜–Ý""u¼¶$#‚f>I\ЈyÒ€‹ÍRLŽ;tU–ÐA"Ç,»ygÙZbó<ôpÓm\"‡JF-4r–X̾Ñ#NËòå÷``Dd ÃëÜÃ5KÒ$‘ôy³QX×£Uß‹+zG™…Ûjä¶]Ôšà_¿/ßr€gô$2$Síדݷƒ­j2›ª¤úUß/Âðºír¡'×]ßý²gTèŠ&8d[nÀÆSš›E°%ñ¸ZMuÀp9€fTP1VÞH2óˆÝÌÝ&2™‚U¶Ïà“Ü2c¡n’ë¬p4éhv-³ø3j{YmFͤ‘âJšÙ²§ù²Eñ3©$xÂOø¼™v%¹nn 7'JzÁ›Këv.kØ)Ëš÷Ý«ÇD> {X&*åf~¾òLÊ…ò~Æy%E-PLûçÞÚ¬:F‘ƒ \Pë èm!âÚ¥Í{-'^Z7û#Aѧ±˜~ycz-m¼‡‘úô1ÔI[tÃYËõQ_l@Á8oT?4'7/÷•lQ5 ¼GÏ9¹”“¯P°7«ç$B×WS¥j.óÁõòÚ÷|ñ4Rxv¨Ö”7Ž_vv¸,4?m<ÇŠhKÒ~­\ ÷Ô"‘ï®<óMªD%4-1 /°Çu\1QJR‘ˆÄÍAQ6ÞEˆ}@°¹œÁÏ‘j#ÄEÀ­Va¢kö‹úÝT™(Žøi ‘•pKÝ0˜êˆMFÛ5<ÝÒÈYbdvÅ­‹¼qßF-V-á7!òM´¹BÙ£ÄK¡;¢] ¯‹R.©hTÏ ê€·,I©¯Ü±>bì©[+÷|²·ÂQñc/F€£òWa2,©÷NÃTÿoñÊøî N $Á?- rîXëoRÑÖÞò7,Ãü¥:ÝRœ «'yùI~Lâ(&WÊ^&·Cp†¥H4Ø r"À¦KÅ1w8ú¾ájµ aôý¥%âÁië»BÅ‘»‘3-ÁñwŽóóÉÁèt@v1mªâå¿ÐI àí‚4Ã\‘Òz¹^=quÚWß ˆ\1™ï}¨gÊgo‘sÛ $_3ùxQ]1ù ²\ªKGv•«$wrÔùjTZ˜„u€Žš†Öê»áä…º†:r·YV—ÇOøÄû®Càœb)€ôw %d¯È׆H&`—Œg`Ÿƒ5§Ì0¤¨Ñ4?ÝÆS…oIƒ2SS½)bè7)x}ôÌš-àÿŒìUý®P‚ÞŽ®_þ´Z‰5ûßýf¹Çendstream endobj 228 0 obj 4716 endobj 232 0 obj <> stream xœÅ\éÇÿ¾Bùö›ç!ï¸ï#‘#ùÂvDǬsȶ` kv±Çä¯OUŸU3=ï=Ù€Ø}ÌôY]ǯŽ~?ŠYž ü[~?|zòÞWþôñóqú)ü{|òÓ‰L N˯‡OO?<‡FZ“9Š(OÏäÞòÔ«SÌ,ÕéùÓ“o&·³Ó¼S³÷^O2ýç̇8+¦;; ϵÓç»39‡£Îwgð4H¡§{ðQÛÙX=nz?ÆLœ>Á¦r6:NÔRÎM_bc¬WØ ~ü¨0 i§vø_5}ŒÝÝ,…Ÿ>Jóû%ޝèp°X105ΧÌçéÓ¯wu=î̬µraúj§PC;:RoxÞ§Ë;‹¸\SY±6¡Náe˜þXhùÝù_à€Êä`w³p ç@y Äö;›š@ž)geNÏ´˜½Œ1w¸KIë™>ÅŸãÊ„2-– ?¾`%"Ì1¸éÏðQ‰é|~?^â«Ö+½x$ÄBûwkW?=oÈûû£‡/ÛÃçýá·»ú4ovÂ6gç cH»Sø!íNîô$vCºÉF³;»(ùŒŸ~Þá :a¦ïá,Q?igk#RB:%§‹Î¹©T vc§'•ïÛ ržðnzÈš¾h£õ!Ò6£J\‰m´.$q Bð¼Ár.ÉÔ˾˜«þñ‡º -0ð£„×ÊÏÖMû<ÝÑ´2zz-q2å€*ÚºYÛé¿o/ó<ÜiÒã\bøì ‹B¹‡åãnœ™­³Ó³>@!»‰ŠÌúËî NRi]ŸáÆ Ž±Ö;Õ©ý §‘Ó¡¾Šé[O|y4Òèr48s?+bY‘H'®#J(tJš²´h érYÎ̘¢Â¼óUÅaŸOñ¡´¢J?üÑ\Q(Ô˜À‡³’*é«'mš'ýų®! Q÷´ŸÁ4Z °O<yz&5¾V™…ÊÊyˆÊÁNek%Ý~¦ï”ÝÇôEçë+;á+«¨ß„•+§¡j 0 úµŒsÞáÙ Ç`Ý! æW0­^k€Ê;GhÎf^k2!Fnë@ÓêÓ¹ù~ÈT”4xF°ÖJ•W…óAE„Æù÷­Ù«óóUç®Ç8¾FEÂ-(“6>F˜×¥!y„}ËÚ@ƒ6ÚˆµºÌ‚€ìîª Œ8Y ´˜u 7\3LyÙHÒÝÒý!³# ø‚6Tµ¨©.Á©ú€þña¿–E'~uÕ†‘S%üõ`“f7cBå]‚%Ã÷ ª 6Ql<†Œ1»J¥Àg¡Bq;8-à}<-Ex )Â…˜­`o·(7ÍW' n@ª'–s²í TI·õÖ”Ý3>Û; ªCQùÿ)ž›F­ßÂÂ×èÂPÝ2‹)jpEHÎÃ]Úvˆõ¦·:c3ÉËÛ³7VÅJd ›æpe·<3ûÍ’F®“+^é:¹òá@«s ˜6QaË 0I WЋzµíc\ư\ü+ÐÙëûú1§?Æu›$7ïPµ[ Ï³‘Ä í¥LŠÿ}\±­M#Ì=<ÖÕqÔÎn)ó6 —à$öÌÊ0s»Ÿ›ÿžae”wah^ÈdXÎ)Úi\Ùx*ŒS‰Ï2©­¢x„Èvìl9 *ÐqŒÉd8ª X†ŒMV|©SÀ´°;îškø£¾:¢¸“GY; Vÿ߀¹™®ÉÊ58f›AïØLD ê ‡ æFï=èæ×X9TöOcÏ›¸•û˜?bø¡,PÃ9­dââóÈ “☵Aû[¢,!P/ÚC ŽÔ§ö7íÁGýu¡<é‘'’.N·Ûûg£1K¦?µ§H¤Æ;wOÎo“VÙ’š¯ª¼@ß'ñNìšrM1’,c?jB:ï‹»7$XãŠm.G‘, ]:½8bó« raM¯4úr‡‘ S¸5wbX¹ºånOˆß{3TÒÏ:ˆb ¯KŸmbH¢E”Q ïó¢@>7èt%¾–Ì¢³r’Smc ´a5}Ö¬ÅÇ0<´´òuŽ`Ví¦±¬/ÙËJ9#OR8 ØhÙ©ñ yÉ`þº›œ«e¡ö댈3Åàˆ%íÕõÿuž¦ëY´(MMÛmüUH¹åäÔ°XßèØ±Ïϲ…‘´¦Zؘ¡CDXŒùºGSQt -€@‘„Ú°§ÄI¼ Çãøyj>I ,çnÎÒk·ˆy@ð@¶øØ«¤²ß,19|ýxg‡ê¢&!m8ì½TºKœ*à ÿ‚VÅALÓ‡¦ó6Ñšû\$î:O³¥mjvSYúéÏB@(YQFh®z’,ôƒš*O0îºâ¥¼zî!”}šè[‰­(‚ù•¤Çá Ôª[#¸"pÈdM G¼0Ñ.­@ ûoù ÄY¦úoàkºœZ²9 óŸ:DfRé 5 •G‡ÂïßÔ†è |WÿóNæÍH?dÅ|ÉlׂP9À’#Dz–®in&‹`N%Dv*ØIw•< ëð¼u‰Ùóˆs5 7Äþ+7å¢ï cs^¤…S”ÄáY$Ë ¸z'E?¤l5oÉÃ$”%)_æëè“­¹¢M3›bÕÇ^’âÁzÛƒNqg{Ã9®¯YÊÇÄÓ˵è3d¤üZÁn~Dw+çř䯰ΔÉÇ¡ÐQœkì*¬H¡§x€xh«ÆNÿ«²<ÉK˾s-Ú¢¥,Z—Ó´ž­µœð€›XJH»®ÉÀ9„Ã‰âæ¹ñN†•E)(V4„µ™EŠò¦¹-hTG_ÝçB…°˜«è Û#B? ´ƒAÕP€¼¥’(‘b'$"ØërʸY—J‹ÆfhIÃ×`%ŸçmõWÖ ŽzW8mÀ6#î٧Ξ£àðšä¢ì•¼²ý-IÂ@‚vW!²òzµÃÄòÒ-€;ìN›1_=mM¸¨ÅO;g´ÝÞòÒª5û\5UBYLZ 6á:äc@l]1Ä6%K³Ä\³×r;ßA\Zk­YkRxúÝ¢U-ª]ëÄ̺c€_™-MOl ãT»?æ^ Œy£˜Êõë!j&šµ¥'˜KY3ÏÔÙ+¶QÄ ìØ V@£(FÜNȃ¹@Ò`iL·=Ä2æ:G›éïHsªÃmüˆ» 2®<‡ì†µí0”yI€¡%Ø#WÅ‚´ü—[GK¼Ó¨lœ6Cô%0ÖŽašÂ7v¯¢æ…€kE(Ú_TÄ`é”ɶû0†ßÉ“¨áNÒVž¡²x ÍP‹îoxš5¶®ô†ÓÍlÆÀ­Z?sv€ÄšÀ1c”ŒKÿ³†06½Ö¥pƒla6™´RcKxê{ òÎü’lÕ ¦Ì“g ð.8§—½ozµ<枱Ωۮ ©gEgðÙ8î³*8¯U²p —Kð¶¤!œlŠ©zÊׅæGõbÊ.T襦gá¸!56ª·o-ò1¹ ï0·gŸ‰‹¹ž—&úJõZ•€U-SBgNaWÄ7DŸ&xb[Ú™û[KÆ_#øA`¡” §µzŽtŒæ8:*¬¨¨°üž2ŸcQ: 7 ¢«þK±¾c>ªa!×VSµ½:ÒHtzó5ÛF²¢ƒðK’ Ÿ)ÕR¼¿iL§Í’ò/¸}qT)GAzÇFr¼$•j<£bœS G¦ôt/‡Ž@’¸kÕ"GDuQ+¹RXîüoÕi¥P–×çµN´ð3ÝHQ)”[8wéÇ#ŒÊÈ(S,]Ð{AjuVn/„Þ,›! >µb¹áŸˆ¼¨»œÎŽå–Ð0«ÕËCà`°JjY-Ä1Ì„Ã8å—±@,œ@,„·Ú=?kü‘€'áWvéµ< ¨/0“ö6a·E}4B½äç&(í0$¥ÂÈlÔ܆q#`ž,ìˆâ¬¢"a´¦WrÞI•:„jµãJë0{µ.#'`ÚÄÝr#ñ`p@ký c»9xµJ¤E™o¹òu(xODŠ{bÒBç>Yò 8… +‹,W¹È6·[|©å™Ð‘RMœz¹!öÂíZÍ™Ïêet¥†wK6u—øur¼¤,9·6½˜¶x #UoþP>©ZbéÏËÙF:‹êbÔù *QéTïâ1dU‰!e¥ùœo²žµ]ZW}ºÐoÎÀÊùàj|ä¡VÔ¬Â4βܖ£|T»$Žcþ¡7`$ ’J÷-[ –¡“˜K€ —á^Ì¢äö6C-¨|ö…Z‚Øji¶ù^öq37QF:œ-$^ÞCK]zº;§Ãe¶Éép+Rì qµÂlhNÚj¼ u kÛ1Í­â&× sðÖçgm9®U¾Ÿ^,ž<Ôül^(×ÚÃ+È<[ùotcäsž–$û,w} Øþ,ݪÇ-9PS˜ÝW[ˆ#cw[\R^/jUHtsX0 îãû¡kJ¢Nò²B ~›sˆáë2µ‘%cu‚ríÅJµºƒÅ•ÞæÝÍTœ¸Á–$6ý¯›Æ7õ+Īæa4ùõ.]Œ^UÐÔÚ ØÑvQ~Ù×Τf_!f¡‰REÀD/åÍjuÜMP©„^ÞÅ/‡ ’2>(Xn‚Žê{•$n5¡êüC>>oï„ê¬Õ{óË^ÃwѾ\ëB4oí[ÔÛ»Lš”Ä ÁE‚Ôíò@-ô-¥º‡.¨¾¶Ò¨Nû1²eñ'H×àjïâ²òÝv̉;ÿÚY”_Q&·“=¶§œ8¬Ù}Ò~ß2¯ŸÒ–åNSŠè­ÝÖoeßð¡>s@Ù K.†ƒ,j×Ý>&ÕöÆÜÛ,7 ÇQj#ôAÃí$Šºƒ»»»”£™þ^ŒHA$˜d±ËZ畽“‚ ^øéŸ0÷6°ÖŸg£‹eV-R &Õ½Á[¦ÏnR „ܲ`׆WßÇ“”Îþoèšäôã›k/ý¾‰àõÈ–|¿¶%¿ë7øpÁ4o]0·¸º˜…ˆ˜šzŃáé*¿$Çâ¹5óF=Ø^‹Sàão"³¯BßoÆê7Z%=‡ÿZ¿v·ßo\½È± tÁeóÜHDçðÀ’]Þ«¢Úâk½ÎdK?9?ù;üý?EÔBRendstream endobj 233 0 obj 4556 endobj 237 0 obj <> stream xœÕ\Yo]·~Wó#ôæ{ ë„û⢒¸©Sd«­´E“>È’m ±%EK–þúÎpòð\]9J"ˆ,s’ÃY?Îñûlæû ÿK¿Ûûð¹Ýs½Çöÿÿ¿Ùûa‡ûéãwû . eöÌóýÃ×{q6ß·bß85Cçỽo7rÒ7éþfHÞÌ0~f&žÀÀO¦9[ë=ß<›øì½S~óÑ$6_O|VJ[±9¬cþ[¥r›çÐÊ=µ«ÍÐ#„Ÿ‡é™ÐÓIÚÙYo6Ÿ8‡V§Iï—°Ì' Ú¸âShUvæ\m>ÃVç9,ƒã—{Áñ°ƒ4wbó)¬„C¬$uZÀ ¤„)Úo^LæZî6ßLbfLþ?žÔ, zR/¥Ù|…Ó…Ƈ•fÚÐ Û#{JKËã-(Go˜tÕþd³åÞÇÛøê°ü@Ã’œo>/ßmðç-þ8Çgøã<ž”³8~ó'X{GFWÓ@Î;³y[ojã/¥ñ²6¾*HÞ;øÝm®GÓFuõëÚøÝ”[#g€ ”3JÏNz¬á³qŒGÖðInô$ãŒNŠ4=Á­¬„Ýh<0\¨T^àêСUx"áŬáFo&9ÆàFOãe)¯C¿C*x+@làt¿—[ñÈ–ý ¶¾Íó_d)ú‘)átÜâ;äŠ1ÖÔ}t^ÄÍ Ï@9ÈBÖ˜$çÌÂôÏqŸp°$Ù§°°s&ÓѬ”@ ¡ê™:®öâµÀ­¢À‡M ©ÂúdgpdéPª]è9§¼ÊSÒÊ6pÂò°Â*Ø]G³>^ †'Ð/Ì,˜%ý£‹A£H¦g-òÝf—q@Ç¿¼Báf ÇmQ:d¢0]T,\T3Ÿ¯­C¤êµJgåzRš>„Sáÿ ¸°›×È6¥œÌ‡Dz—Ål™ zuÚ]Î]PÁ]¨¤d œ ø†yT…°Êýqi¥Ì¸#f!W³]zÙÞp«ea1÷Ó" À…[Ñ¢´° ¤j”E¡À!I¾*O»+ç@Ù‡ë•ÐwÒÄáÍÙòp¢ÝÙÁYràõg.ŒÛFÊ T ¨  f 9­DÈY:¯ýDbokër½Š@¿ šW©¢³Ð ‡VY¾ÀõM0J/£6jaÊ|-“`‚¶!‰äŸ-õñ¤q´ùÐAø ñìU’ai]h7ÉM$ãd±¦É +fX‰Ž‹&5m¯ž 3ôH»W”ú7QóG³!VM1.é ©Þ¾ñ"(¦`¶Ù)Ш:ð31{Un¨Ù.«%åµF´8G³,áx’!>¡R«¤P ²\{£°æÝô«åñ“?àfU×2{²?P$²}Û:;”º"2é¶…qcñ§ŸÉà¢â™ˆ8œYšJ©Èi¥óU³å‚åÖ9ÙY«šùX/Gr^UóüŽþ718HŒAP2»ƒm—‰\]Ãè2ë8¢9hqÁ÷£+;jïtT\b=è’ŽÁvèº(剩$æC`ëáTâW gGÂÈiÀ›q17÷WvÔñ{ÜŠšQPÈVªäº½Aˆ"§1$vAˤÕÁ¿þT³2çmý%r›/l¨ŽY±/z -ʪr»°ƒˆ.â<äg¾HÃi¨“ì´,¥OœÉ±Ì/•1UD˜ÒP#ÐhP¢çi\•9eÆšTÍ t¤¸(»u ]lZœXs»SuÑ+~£ª¹êð†×0§Ü6•n]AÒ®¶ÄSƒ˜LÍzD‘œõ.ÑÔœæ’Y.f6«ËØj2ûYÎhc*ˆimÌhc2ûºä±(Òacq4數¥Ôæîcz’å¾.ÃÏFYî«ÚxS©—t$Íwm€,ÎJãy³û’@I3—uî¿méum¬k¾]ÉÆ£GË ?è]¯17Ç_QêHzßì"8VVšh•I7ÍÖò¯WÍÑÓØ¨`ãMŸ—¼,× .\–K?Î7Ÿvx\Æ\Œx¿Ã±[6þ¶€†qEˆÕ£š4Ì | Ö|=Œ ýþ~©˜2HC2¾b<2Í­¹“_ƒ–ဲ1XqRÙk®º¦0_®G†awŽ’GQAñ±&[sâÈÅêqïFïhœ‹‘A(»-%^sä-i•¶´Mq¢mç­?K«Knë)Õ8ˆ-ζ&h·56<øØk¤¨‚“Y M_·B$1è”b‰A@ÆÃ3 #Œµá²‚DXÑÒ:pÛ‡ ZOªÐcÐê%\Í))ÍŽ/¤lpÏ$À‹?"Û–ß “ü'y`ÆjÅÄ ‰äÀÉyDž+Í B’»O h”€@€ÑxˆšýªþÄKàôp·5É1¨Àì(–\fÞ6Ñ;EN3¼ç;uŠñz/4º»ˆ$Ðå¯IhÞy!´Ì›\0Åe4‰ c+™YÆX‡1†(6zÄ<]‹{¤Ä1º¾È˜6ô|@qFŒWµ`zÛŠT `nD>­ºŸW¸æîp…m63æ÷ô'ÃÇÜgÑw1Ýu>:`gû6™v$ÂüØãÕLp”]ž´ [¢Pï29B¹Œ(7?f4,„>?¸má†ÊÎAV õ°º`Aál šPë?$€©ÔiZ™áiç@)Ò?šÝ¡äƒÁÕŠ]¦Êû%¸& q%Ù![éÁ-CS"ÕÛȪ ?“p¹ðu3¢`¶$¿Xøžx¶žÚÅïÉ炬aPœŠ8+²J“QjóþÜzÅ´™þã¤Õ ‹Q×ÈO¿Šï8˜¡%aV‚m r—GËx…^í:{Ƀ56>JLwyújô3z¹Jج%:±k0ø˜`Ú@U¢¹‡H‚ ‹€•òúF§V#êÌfU'vØoÞq‡«ˆ»•2[_(Ò™Ûdqè|Êñ“mþÝÎÜÿÎfW苟Àt¦€i>ÖÒœ&/­±ÂÉ»ž!…V9øgâp¯s·%Nš¸ó›-àÝÙÈïÞP_¤CÌ7‘ìQ &†8Y HO ;NvM÷²ì>É€ªë ÿjt”³Ñ–Î3BŒ‰z:tµû:œ2H!Y«å`œŒn˜¬P5Ɖv7v¶v—ï"'E&;h>³L´ÒRø’eâdÄ‚Vzêï+!x¨¢EŸïþþÛ ëNs^BÐR<é–Ž«|!f]¶ƒß[àªR:Šý'©ËŽËUËLr·„qœ&Îe‘%¬ÛA¼ÉýiÖ³®á:ÀÛ«2 Î!@ƒ{­0|ßkp“Ƥ‡õkO’{wr’OÙˆsfãªÙl¥æd$†U¾¯«ì.°!“‹­Ç£ ìv4ÿ$æ¿\Lˆ[o^WHºuÙ¼Ä作ÇÞÔ±D/ÇàÁEÕ_äÚ4ó¬÷ð¸^ëEÖû°eÝß]ïûG/¯ï®ê /µÃÝ$©º>ñœäƒQ;¯Ë_ŒïRÞ¥ÿ°ö?­¿~Vý2_tVº{$K*ORq¢,4í¦ÏhR®Xã¼ùgÙgxy}QzWQŠÂ 9D) ô{ŠR¼Oèr½¸C$6 .ðÃç÷A®ŒЄ„ßÜbD/ –t[2G l¹ðŸ'FPOj&ñ’±L4 ËÀa¤H„bo¦Å×l¸&ƒÕ†~yÄÞÍá§&ä·Ç7'¹ùjB°„§#þ¥gÇBAjz…‰6R8„ïåÌ­óÈ,V…˜f E9B™ø:-7&@H¶Ò#Ün‘‡¢ó üÂhˆ˜•ËÅÏS)[¨MP:\ŒÔA>0/1Z'øÖyÈI²ø"ÍÒr=:TüЄK*ѤĢC„Bmð¯Ã [%ÔYðáÈPõOp›aBÛ>e4IÁÚ§MyäJÅöÓéd”$I.I~ %á¡pˆeº¤š£b”xËD<ݲs’~ÿP¿r ŸBàWB„Rî£ZKHëSNóšÙëd±¼b­ä™¹¼Hr*Hfœ•Ë©ö¦­F­8uÿD“€k[ÝHÂ[Jkð×Ä]­MGIQó³I¤ç£](ˆ‘.…]÷(JZ³ý;|\Q.]-œL‰«þ¯)¹+¿T¾"ˆPbɤ²!ýiÞÜWŠ G$(T ÙRð$Ápv¼s*Ô»Ê7<‘i–\…R‘͆jêEµmé}†;’7^”ÕP%,wO”‰ÌQ‹ø]Lƒwua ˜͑æDVÒSR++ Gi…eðšìÍö/ µ »Åbð㦺T¤n<)èD5¿–êP޽.ÎX¬þn©†§T {ýŠ% áõKÉåë©IÕZv²Ú¢õu­Â>²Õ=¾ÞÕÕn¨-j]«üØfvµºH @«« Tí#æÀ!^tÞ,‹»råkÔA£‚©¹ëSRŸ?|ltXÓ1¨È…´b2(ê½ç> 72”¼¦ïMÂ]W‹x>n‘àôm¡hæEë ˆNÂ%|{œÜ0ßRלÊ6wŠh’£ãþu…ágÄç,¤R™òŒüÌQp)»ˆ\ çV륲G…s«”æ u¤×ͦ~O¡åøÝ=·‘ë”À¤8¬mwH‡c壯¼¡+ÆBí+r÷š§-B‡ ° ŽIk|¬2F…gî©/*\agú¥z›òëÖ•d.‘Ú(dåË¡Ü]”"öZ?ŠpCþ–¾)Z©¡ˆŽ¯«•N}—\=œT“'N"§D‘0|S/þˆ D‹ÅëýtWvûá#£(v‚¿òáÖÊÙBä=>Û¯3п궻èòŽÖ>p.>€Æ'åVŒPUñQIîŸá_ŸV cåh dló$ &È…3 à ˆ·Äîõô6øãhÔHvV{|]‹øŸ—EÄŽ–â§(ç¤aXE¹ûûõÚ×r+Ò0ïî²KõÊÑàOþR5rŽë¸@÷ë1Ê:Dí&¿—Yt…µºÄNw¸ödÞ|X4ˆ0ãe9Y¿ÞTíwÞù“O[Ö]8ùמMùŸ7ˆ<…C$úçý¿ÁÿqÆendstream endobj 238 0 obj 4135 endobj 242 0 obj <> stream xœÅ\Y“Çöó†~Ä<Î8´MÝǃ’,pH²„V²–±„Ù]Ä!áï̬+«»zf@,‚Ùž>ª+³òøò¨ùe#&¹ø/ÿ}|urç¡ß<}u"6_Âÿ§'¿œHºa“ÿ<¾ÚÜ;ƒ›´„3SQnÎ~>IOËWÌ$Õæìêä_[·³Ûi§&ï½Þ*úrêCœ”Ûû;µý|g¦œ ÛàÛéNOZ+­¶_íNÕö‹Ý©œŒ1nûã®~³ž®j£¦Üöop8)¥œÛ~Ûn`÷>ÜŠ)Dá…ÛÞÝE1 iôö ó>F¹}€÷†(…çƒ}³“SŒÁÄí÷»S‹³ˆößgº4F7¼cH?»r5PwùFø§FÊI™Í©“—1¦þo¤Él¿Æ‡8!¤æÀ×Ïñã§-~¾Áküx†¯ñãÓz7]¸Âüø¸‡³þ<©÷ÀÝÆ[bÚŸ$%¶—õÚE{àM=ùºüo=ùbeè|ôª]~]OžN¾i'_Õ“?íÊab!ð«c¡‚Žasªâ$ð 3]VF­N¨²4_ƒl9gœé,Ò$•ÉPÚOÖ˜FiTÙ¨ 5;yY%‚X«p}Ê Ÿ´^·A–0Hž„;½Sl,¤T)Š"нú·&¥ìÝÏŠ>=ÞÁ¼q¾LÓ5@»ñ¤DIF×zHˆäó„UÖ(À ”6ðºrTgð ¨\½(“Qìä[TCŒŽŽM¤]¿n#±yÔÝ)׸PÆEÑ„ƒ($If7ÏZ ÕÈ À”ÃŒ,ÒÀ^Ǧ›Í†6aûX“d$‚’̱´°XwáB’%©ñä.>›ÅÀŠH“}‰“µ“î–×»HvFcãXïó›-Ì#ƒÓ>UDSÆÍ©Ô“Eq¦éŸ'v0€0È-#A =·¡hjwëÑÃ]@O¥ÝöŸåÜ*O” G·Ïeåätp…LH£­r¥ÚhTaÕ¸‚_WŠÓˆE-ãZíÃôk#ÄÇ pû î=ý÷ë\¹²œÀü#¿!í,§`G&)ì æHÌD6”^þ3¨z69³Äžì&WÙc,Læ#ˆ‡±4}Î5bŒ_š{!¹‹UžÀJ‘5>ûtô—Íãí¯;Ï­­O¦É zÓ{íê$ÑIh4L«XS«„5›~Ëüs{êº÷j™. — Àƒ2Áµä­ÐÞštÞ€Ñ"\Ê$®â½çífKòö(9r«5Ò€Õ·|t†+:4šÈSŒŒ’t‚÷Ïİ•¢Ã†tÛ²&¿Ÿ™¸Š¥ÓBIœ·h D[~¦>ùMTºÇåã$ðüR·kË%A¬—{Y>8—ŸU°À„åuʯGˆÏ®I9£°ÌF}Ñ&Ñã2®‰)½×>Ft êS€ÝLA8*4TŠ,µ$6åN”Z˜‡fÑFJ!Åžè…-*ÃÜzt’”w±E1ÓÌaýXO²;âó€ic\€t|;‡¹¤åKž§8"µž{Ú[…Ù }t‡ÃY=0$ûyA*j+,:ñI“¦L€1 áå$¥]šo ¥3~kð­Ie'¿¸šÀQÊDÀñ¡®3Û£j6“ þBÚQÄŸ¦LÏi¡ EÚÔ´Äz$Ö‡˜’À82b*Cny ² .Óeª•Ñ´Õ\€(¡"0÷»‚'šÜ!S+‚øº7Õ¤Ieá½.GÈL·{!*‡h¢0ÐÀS1%g]^h<lÜ`“÷ª~˜£ª)Ïf"E’,â[ÑŽ±ÙlÑÙ¦« N/Å»@l•r(%%©E~Û>Ï‚²Þå 'Ï¢<ÑJ,¥^KˆhõÓûê'«‘M΀f [òÎó¤«|Ÿ­>Ðɪ#Õs±‘X:æÅÎ:½ìÎ@HÐS „͹P"Ì“Ù]^;áïÈòÉ5óàɽ€=FXÆ0m‹b¦ÂBªÙ`ÄÅÌ/ñã~•ñÏ‹ 9Îh0º®c\6=¹ßEyª™³G)/!gùöai‘g«w#C°yMàÁ4“Àçr–°]Ù¥.( è KÁï¡¡[*ã}uÉ轺„Y4ƒ\— êÙ«KirGé eÕŠ.• cWŒ«e$z©×…­h¬nv]ÒhQxD/þˆíT‘æk%GÓ#’‹:MN×`>Ñ*zl/àŠt×Fqè±–YÁŠ×¾2(MÎq»ÐÖº …Êg0¤Õ?X š*GŽ’G‰cQ9’Ú[Ìö±¨ºÅB‰‘A Ý|–ÈB‡y}dY%Å [z|•CÓõŠˆ‚™ªÛ'^Û‘€¾9Ö*"˜{ÁrĬ~®ˆ>”<Œ‘Ù­”)Gÿ·Í$$"²÷eÒ¬l´UŸ*T'T«d=r’gïã$?dOÁÇ Êrüàn×'X¶§È¢«7f ¸ö-õª›äÇÇÞµœ+Õ+{ÌjK­W#ŽÁ¬úH? Žj¿ŸMù!™Í%Ý0'ÎWqpG¦p’ïÕ¨µ}: ‘¹G–Ôˉ5¯ÙõéÜæŸ/x©$;ò¡–cvŨ²¦äg%ÿá”üztòj°~Ä(µZ=”jg‹9ò,Ö¦>ç>²Ö æÎñN-:Ùr–s–oÆ hVJSzp†YLû8‡ª3Wöö„Ï|L5^oHsÖ‚Ò@\ÍDÂWI°{U·‰ôСö.õèl×·í1¹{èSá(ÿ~ÐRÀ옥 §/›¶ñÔyJ²ËI/ô:ÌŒŒ÷~ÂÆ¢ÜeÙZEõfÔÖ•€8‚S¤}%çΑ²¦Ôa”™ÔŽssû2ᔼåa–54 [J ÂzÞð5ùaL£WÏ€ç°$¥BWò3úcż…„3ž¼Ø»¢£ö7ÞÂ`°|¤å»é„‘jûËÔ9Œ@òÛ϶9Ý>yν"ËSˆíú"na©V4¬èâh,Ø*UK?9Sd×S)pó˪,ÔÁšÆ_ì eer¾ n÷A}‰ò<5Ò»ˆ/r¼€_–^ø¾6•Ë©¹\IÄôu¡¡Œ¶D“ì&Y(ÒºUí²Ñ}’mÁŠáÃìz¶CÎÚY«þ"ìbM´-$ý4 ¯jmÜó¶ &-Q \î%èälÈK‹Ë¡ÑRü€\d'1óE­%‹•Z”éaAÎ9¹&èË’ÒB¢ËÉ!ÔLFmOZ¿NˆJÓãY³1l©:rRdºypÐ ÚÛwß)1€Tÿt}¸% „’d /4.sÊX•ç” ¾fúP "öd³É8NjaŽZò2 ”ë{XÞÖ^rÝ6tý?ÃÈ€Yh|ß/箇7Kq¸Ôvr–ýÐÉ5 ã¶ Ø5Æ-ɵn=-BÚiSB-XžC”£ðflår 4«kަĆe a¦_¬Xìv N>‡2 œÚ3½ûª÷¶irš2êÔÙ­­z5sQ9Ojbò¦¬ vðéZ”EÕ™/º£§ØO$Ö7õ@tk㠸ܾ¡,õk–Ö“Ã~OÙP&Rëíyz¿fxdÉPYöºa‹ë8åV&u4·V0Ò¹²º5œ²C ¼ÞôFl´KDŽd<íñÚ²Q’?t#OiÇVmÄæx³ÞëTö6ÌÔ^#å(ëÛ ŒôYžžú›Òè•¶€QÛØ¨òP3ãne žÙ÷™…-$ó æÄºœ×¸Ùg­”)4©Ë±Í:3øƒOû®î2ÚæÆúÆFðæ¢QqÁLÙbÃæ†ËVô½ÀÙeÎÔ&û ÇjLArǰð®àc .ÝùE«[q&®iLR̯ËC°”HÍmöëÔ´òŽ}Á$)WIî×MsµE©îÝ)Äö¡4wÕ%áy¨'¾ÊÙùn…S¬ë°Ál½ø¿¦aU O ,—%húæºõŒíšý/È`ÍÒ§fm1øÐû/ ŸŽmÙ u•…=N¦UQ_Œ¬sAv 6£ÞÏs}¹ûœr}Ú-ÄVBåhE§®]&Ø7 £ê€ßÿŽ,å‰ÊÞÆSr¡£”ܾ”<ºL´¹Hð›m_gˆ§lzìZ6s¾…v;‡VÌÆµôKÝ ¸ž-BêHù]-ŽÚÛÕBqˆŒ|«eoÜa¦3ñÉ{@ß®=2ÒÆeò6e ’0հϤ)çqGɈ”fˆõ5„¤­§=o³í «B½’ÿ%óßç;Ϥõf|ÍLf0ñ¨&ñJ¨Ù›ŠQ×c;ZAõhY±X;ÜmßÇË,}Š~F¤ë¯m»ãâ¾xº“fÞ¬¯çøBÙÙž¢eð2ÆBVÜS f{XÒ5×·'G¯èk{èùuàqgL+3x–ãX‹›ì²|Wž†ÑÝÏœæ@"3eC 3On²õ^Í>=M ÁÛr2Œo™ÙÁ{0À턺3H³½\A*óÍ[ù‰K½/…«ÝŽŠ ©ˆ2ÛQáÅÌ ÷Éñ_;ú™„ŒÂ ¶Ë£ÿŒ¼_&{Œ´iÁîMM8Ùwá^£¶Qëá‘rKŬn½*8V}–ò–áÃ&d©ã‰±›Šõ[À‹)„((Áüû¤Óà‚WéL?F5U>7µ'‘4ïUn«Ø?¾m»Ô* 2ž6ýíÍÈL9]תxße‚têÿ›WèÖѶ¶£ª‰3ý0Qé ê¡È;ÚÝD™}ÐcT¿-ïb$¯YÑýès?C @‘¶ûÝ q]­Ö;ö—a¨†£¢ãB˜¸C²õÌAÙa¥dι±#¨W¯²=¨ˆÄL€0޽ «8µ.ø'ÊÌ0»qP›(‰ªÞºe$åÏúÑCžÎtc{¦ŸY§Ãj3;‡A°0ÛÅÔ,{m€(‚¢“>ïžÚh0öºl¾/J¸“‰ñ wûP½Ë¿Ò“Ü‹‹uÈ#¿ò–ê³9㯎áb5÷ˆC–V&WAÑÊ3 ]Ö—ŸdŒƒºHm¿ŒM‘4ûM™…ät(.± “Vj]T ´Ûî}Î.k 6 ÷7©Ê.ìþcMσµÍ?zy_åc/Ï{3`™ÇmXt\=(©`Gû—¨Õò˜R{Ô_`]’Ïê=lÃP÷ lË âÛÑã¯v˜3´à¦Wž¦¼%pîm½ü¤]n5KúÉCÕ‚ÛªiÖµýêäìGñø«ú1âvCbyåörÿÕïf|áñ³•ŸV·ý%ìGê8ã)¿k$ãëóvãóµÅPâÃ.µLwò?‹\"Ïendstream endobj 243 0 obj 4740 endobj 247 0 obj <> stream xœ½\[o·~ò#ôxNá³YÞÉ—uÒô'M¥HÑôA–,;ˆ-)–åØùõáu¸Kî®,©bïryÎõ›!=v<âñï³7GŸgŽ_ÞÇÿ_ýzÄ|ƒãø×Ù›ã§'Јqx2¸Ñ±ã“‹£ð5;6üX[9ÀË“7GÿÙɽÚ{õß“¿Ã‚U_h7Œ>:9‡†_ìb0Æ9¶ûëž ÎYévÚóÝ·û¤T†ïNJ›?‡§BÚÝwð”9èÖì4Œ6ÀÎÝÀ|ž:úr/Ì`ӻ탧V‘·ßÀ0_ÌúÆ¿„§Ò ŒÉÝßð©u †Áöó¹`{˜Ë³|÷Œ„M,Œ$TÀrè >>Qn÷ýþ à[Ãìî‡=ÆQÁ¼Ÿîå 84…þZ ½û~Î9ך4<)}ÆéA¿~zdNqnXØ.é.â6Ä8æ\Ø ·¡ñd“ÕàôÈÓžÅ1GÅv—a?oð©RÖÈÝ Xˆ”°»·û¬IHÇwï`Ò\HÈS$¯†ÝЩéùê7|/Ü7d…ïK›/ª• 9X+ü/ «%P˜’û=AaP»{¶?xâÉ)âP\ÈÝÜ9ÎŽõn/ ?#è{2¿¸@£ùîgØ cŒØ]çA¡Ì uyü†´6ZÒŸ¥×ó²ýá§$PE5§ð:õúÒÀ °×Ø«”zt~ ¹Éë21a=#³æ©‘½ \>Ž–Œûj F5Œ2mø‹Ð¹ª’W¿°gÀ(ƒ°Õ0Aáɹçð‘æÆÏ\2x‘&Ÿ‰ãêË/2u¿Ñ…B—™¥ýÜ•TYcÐ&¿&_à­°h\ç;F³ãȬB÷ ^ØjåÉ®± ·¸<•æÊFQZ“v°i0›çÐ΂øsåf„!ëUé>w &‰ëÒ Š¨œc÷#Š`b*ÜÙ+Ô{ ì8eËÒ´l÷Uxè\Å´ÈŠ¿ 2VX?YÇ‚CäÙ Ìc´' ~m |o§Ìù?ñ«ŠÍˆÜGZع6@þÿ ß[˜Êƒ‹mj2Džâ7Ñr¨¯.ÂÚ 1á­WE†3›Eò ÆÁUYØ(OÍøÆ0ßÈ[­¬§ÚR [™ÕÞ>›Ò™<æI‚àqæ¨õªÈ@j-CX}mºþŠÖØßƒ °›×Øk6FèÍkµãi¤³¼[IQg‡¾s^óö43Yoãš~z°þJêlý C¡^r£;0z_íñ½Ñ†6%7øq t‰»¼94=Þ›{†“/Œee•Ôî¶ Y–Õr€ò„8щ¨’´„Exèí‡UʉTê88:ÁÉM Z:.0xܦ)ݦ1¥ñƒfë¨{›tèží‘Î1¯¸Û,–Ÿ–÷×tcà{î#¬¦>ÎphÓ×øÝ¶ãµQAý‡äí7¢e\ðŠhâ.ðϧøp9üy‹àa²‡0ùÝ“Ü äUŸ·m>NBEo'„6—åá“Ö÷ùáUyø[~x³ÇE1C¾~W^ì}4†ù…×/Êë×ùá¹ïÇHrÄgOJÃw¤óÔðc~vM–lÎçy~x–û¹ÊÏ^·hQ¼h‘âmð ™xðíøA¸8 aÂmîùçj­©é“Ü”ímŠƒ;E{:-?ß”ž^äž`eŒ/´Øý17 î˜&åëu“ùê4ý ‹ô¬çߢÆñœ zgíÌ¡ÛÀÍÏò-¾ÎÛv5óõœ×Xüõò^_fnî°}Úë›V?¯ $jz]T›e!5¤¢Þ,sséücîçº%g-n¦¢^åéb–¸ù‚ÊQ ¬¨’Þß–Ÿ—‰›çÂ1çæͦ—¥éinú¦â Ò«ëã ä|hq˜ÂV `Tö:ôÇöb7v a{o4".ïÿª]ü§m &7q×@s-}@RLðBÌïA®Gˆù9¸5hãæàeò‡C‡‘ öB›”sü.âYۢ‡Ê9Fì§ÿ 1Nldª8 Ûq⦻Là+ܲéA( °±ž˜µÈ]ríY´k$öaÄýÑaàèT,¡Ã~n—±©¤œ~…¥L—Ðalƒ Á": ÐA‡%çƒà»áI¡Õ\9D\Or†kxDtø`x@ðkLXrp‹sD&$‚1W S{¢E¹®Ã É‚#:Œ»ƒ~Ñ&tØ“Vúàè°_OÍàˆ ËÑnĆáoÏæ]¨À‡–}&Îyp¸ma|„eÈF/X˜?‚I‚¼ËQÞ:vº#õt.NBäë„LñÜ)Âêñ„6ÅCÞY7Ï’!‚n O(n,G·ˆ§½ZÃ㣈 ãÒkÇë¤èÑ 8pðήc£6æzlÌU6Æ\‚¹Z†ýº7ÃÆ\¯ÀƉŒk°qˆ'e 1æJ}ZL5ºDfý 6æ*ÁÆéáýÁbnæ`1 ,N›³—òˆºŠ$jz¿Näs˜¿?ZÌ•wh>-FÜk4mŸÐâX_Ò51MÔÀ‹ÁKáûR¡Eß øBÓat®ø¦®1Š“Ü/£›³‰Ë$V©aj^VñÄ«œñc,#Æ –hyx_'ãÖ~œÖ\ç^üâ ÏW¾·–Ç)‡Q$kƒØ+[Ã^cÝñh*ÓÓŠü~'V€ë´N6( ­0›ãA>4ìÉÒ$€ì*ù„@?ç ãõYy6A¥A"­ ö—‡¶­X9d báÖ<šÎÜ<ºÂ’ñ„"ÍäIrÕE£æ ýü|¯rE¤÷: tµ'X† bà$³ž5¥}$B ¿ÅÈ)•¢ïêí®+`s]ÂŽÛò–ÀU>UÅ1ˆÜ¢èq >ûäóâ’M8‹´A^RXê>«—$N=r阣fÁJ,X®íB¤5øQðý*·™è‹gaùLŸÃ’B¼e þ5÷5û}žÉÅêXà#P®¬ˆ*Ýt´b|&XMH§-a®kY€’+]à!»¶ÎVI³*`u.°Z‘£– û¼,*"P3±Ÿ°rÿ#Å8n›„*ÜËN‰n#ÓÃ׃0×–Åø@´[7IêÓªë ¥Ò„LqNz¬\ÊÇ~ý,D¢E™uÄ ï a–~ì!VêÛqUøb1í!Õ>vùeVå …Èã{lŠ’²kUì»\IŒƒïøºeoêìNSš­!ÑIŒ•’ ú?w±‚ø`Åyš`·Xáh¸~Àjí¸9·ÊeèÂÝ¿V»Ø+õõ0°Î`ƒÑðO±IØ,¸?û§¬ôFghnì½7%\|C]¥*»yÿäl•Ú|ø´W:àbÖSÉó™pAR«Ú5L™Ç´u^Rå„HÕF†<4ÌŠŸhIf³«å(p„{s†s“ w¿à ¬`"$á´ÌÎ|§õ¢sÌð²êÐßÌ#Œ"W]“R^|ÜŒ&û¹9/Œ¯Kâ/ºGžfµ°taÒ1Ó¾¼•é-ê#z`:ŸÝXP'é4>úz¼J ¿÷Z·sÍ43}ÀÓ‡ànLõ ª\%èpäìF‹õ;ö+Î)ÂINµEØ=a<³Så–QEcšU#ž9Ƨ“|Áyñ€ÐUýRªµ"çm¤kŸß¨rD(ÉÏÅã,ÛV`óÂa;8THP>=*iÔßGjíÀÉšDÅ©.úOÚõ˜-dòôà²I>›žÓô'Á$•¢H`A˜½Jâu|¨àÞíH$M•“Œ]F‡=‹Ù;¿¶õS­J¿ÐdÉ!¶Û•F7á`Ã=Rƒ Žj:gd ÝI*dîç$]ÓR½Ú4:eôoËu$¡üãžSpé›êÞ‚ó¿H—ä;~hÃ!î†ïˆî¾c©Â<•_ˆWÂð<òÑ% ½……®jã¼Òëáˆs§>¨âS?µ4E›KŽâ›ë2™ÄUi4yÓª‡¤²#¿ìZ§¿ß+ ·µ›qKƒ ¨©ôˆTØ%Jx˜¹ïI6©ÜŠ#¦U@…ú§æ°è:j–?P ˜páׯá3ð0•O€$^Â\ˆó0í½ŽÏÅ3`T#xÊ¢cšGEUùƒâ—Å*É”µº2±*"w`cÉèå±h¨YÑ 2&)‰øzïÏ¡ážOx”¨ÿV1G¥¨C±‘rm+›ŒüöºÑwÔía}œù­u>Ï}¢½j²Ó¶Su³,¢ /Mî»?%WË"HYÁÝÊrF=ù<%Z)fAQÍ^Õ·ZP·ÈÞ© ¹qœkÒÇc­ûþù…j€‘ï§Ø_ÜP´ÉVÐÞSñÛ‘WzUÃÇJ’‰Š÷‘›ë\ßuF¦L©4Ï}†à,Ç”fRt'wv"N¯o[*g+8î'5žˆ³«K6U(¥÷ÖWUƧ>°Ü2ؽZ µ ñ†4²ÆV/„­B]œQþÅšPŸ+9¯z.—âW·w©6;üJîÛÆêšü¥‘H^:I‚&¦ºý%/Êíæ˜lˆ<½ ¤ÄìûBþ¡Ü+hÈ…·WJ1ªèÖNÔy<8šD¢qNtKªŒ»ê|þÿ9ïåÚÖ;iïˆMõMñõ¦]ôëãpññ³5¨ŒM‹%f§`–Où´£{úG$¿à•r?ÍwC¶´&ò~õ˜_’QTþ†4pTÙ ã¢ç¶³äv+DЏè—שVqva4,×e쫬ˆ§°Z4ÓªåæÇEo«¼IùpÜ<öÜ=L9kÌN®Jµ$µ¹T˜SôzX¸žÝàAòFµúõ7S0õp¡ïHÅéÞ…TÁ5#¹6pRXåè¹ö-õ ki5r168ÍC¸'œÞÎ -Á1dbƒÜ…Äæ¬œ+–_<œàU°o V*Ђ _DÚ”Æ T› Xg_¯_ÌlŒLŠ|¼oÕÁN2f Qv=R An¸-³›•ëUE¬Ì€ ûïüd¼ñºtƒöá!NÅÆÜ€uþD$U£Þ4R¾J˜©s.ºá¥ä›…ò‰r_¡måäÂ) Ϻx°Û‹Rż(µ—(ï·ËH$¼6(Æ•Ë^ò¡ã2zKíp²ìÞûV¬Áébãµ?y—ˆôѼ‚ á¬Üpé:J49óç“£Âÿ¥Uù$endstream endobj 248 0 obj 5240 endobj 252 0 obj <> stream xœÅ\K“ǾoèGìM3¶Õõ®:Ø6’,Û²%£å |Öl˜AÀ‚ð¯wfÖ+«ºzfØ]Ù"´ôö«ª²¾ÌüòÑü|>Oâ|Æ?éï'/Ï>{àΟ¾9›Ïÿÿ?=ûùLÐ çé¯'/Ïÿp 7)g¦0q~ùÓY|Zœ;yn½ž„<¿|yöÃÆnÍfÚÊÉ9§6Š~¹p>Lrö›Ï·zòÞ¿ùb{!&­µÝ|¹Up¯5fó'<ç}fó·­Ä[”–“6jó NRJk7àPá$ Γ³›m~Ÿq2 âlà'ã(κ4J³ƒQÄ‚סŽ6—8–s!ˆÍWÍuïRnóÝöÂàÌa–ìÖ[%'!´Û<,ݯ—Ùõz7%g€-öKÄ?nðç5þØáçøã-þ¸·½ÐÞáý›ßLqSƒÚ<+ï¸Ú^H\‡·ôx<ù¶žüPN¾ª'ÿYNÞ+Goêå·åä£ÑÉëzòM9ùã6FÁ€Á˜É«àA2€y;Ë(±Eð«‘ÌE‘wÜ3/fµÙƒè_m¥› @W`ÛÌÒl^dez›5)Þþ'%I“Ò•I);kZ[dÊøÌOø«œK¸¢Páégõi_0 •†ÝÕËlœëzˆcxAcôjÿ©]/…FåQa¦ñ?©/(+,ÃkZù  H·táU3%åQÉ=<­á@*Ý=¨\ uEY(³IRp w€Fˆ|r$½:Pša4n½R°p™·;¾ÖÌ!¿Ö Ï_‹Ï]×+õö´\éD{=m­XZ7° ‡ÅŽ/ˆb&/lµ•1X:{ÓO¨Z{E6€wà…šŒäÓâ>ÍÂe{ÃpG`ÈÞ¡ÕCóæ\ݶt|ð ŽmŒ³Þ{¡Ñ ‹¦$C6¡C+|kƒUR¡Y1xסŸn û g§a~Û±þè é×—¸|kå;_1RÏ¥çÎu‹³³àîÞà¹æ9ppíoq•îæ¯û9J àk¹p¢MˆRÃß"X™Í ×ѶjR3k`f&)‚~D¡f~ˆž%<üÕ–»Wð)eI6Ë•ä ­¯Èz’Ê™«úÀó‚Ä]…úS\£žfaW5¯£4Ë˯‡“`ûRF µÒÕ—GpǸ‹5¯ëFî~M Ó‘$íWbÕ°jx³qúaµ³]1¬+Ö2¾SnÞWïÿ¼º‹ÎoXGki¤-†Ç$é!ö­m}^GÊw •‘”}”éÌí½Þ¾îZ’K Ï p4ß ÀTx)ŸNå_Dàf/2ò?lª8 "¼—T6åÓÛ» ;òð–û?|Yö.†Zí2ɵÚóz´ß*ŸÐAž`EÓL}kÔ‚´úÖÆ_õÍèÈÐ2Ã?’ü®…*1èÅûʆžUu ´0dyL)‰­j`c.6× g…XlW4”u¿¢±– ¦­b>‡HQ-ø€ÍäÃ϶¦°9šþÒƒ)ŸI{Ó~[@ʾ%†Å–Ýnmûi4øÁ»•éGôÛɳ_|Ÿì}Yçæðú*§ÑbIÎVˆ \GËlÆ æ*…¾1zQûÈi‘­©RuØâÈ-ÁèTcˆÛc(i™1PlíñCch+Ÿ¸XÒIÆP;„ v‘úkjTæ)¨PuæwOˆ0ž2 h½°·E rÀŠpÁs'³"Z‹èx}^Õ¥A¯2¸‡³ÝG †ZåÅ’Óh›W)>PÁ9ë_‰*>RaÜ "Ó£*cŸ(OHkì™9R :%aÖ¥í5Ö~¬e´O‰·¶i°2D®Ü,=ÃÒž£ ¬pSEOœ;íÛnŒ¸/¹¤ôc;K ¡õ‹qþèä>.:à­VîôÆ1…Œ c¦Yg}9²õŽÃqŒ'[À£¦ÂƒyÅLCFÑîHÅ»dE$0pš«š—–W±ïˆ¦ÅEôôŸÖz;Ÿ€ÆÀ.ƒ†¸ßꦚE ëNå[0±ÈnÛМÌjT=^<5J] ?Ù.;W󖘂Û|[r}táëš·|¾’¼,)FÊ` C^†§wå¦ç£D#< ˆƒcG ¬xòõ(ù®ž|^NîG©Ñ7ͼ‚ƒMÂØnÛ|}xÈÝúŒ‰E,æð¢œ|QOîËÉ÷£%T=­—i⾤„EÀó]þ6¦nD™)@Š)ɶ6•›1-“ž&s• žÐRda8ΰÂ<³]3FqCæ0ڀ׎¸²Y†3¸ålZÃàô-s‘¤²Œ6}–½TŒ±ù+섵jQPï«èJûÍ_âÚ~öû‚{4ó°!hæ"ºäÖÀ7%¼äøÅ%šÝÍ!ˆ®¹ØšHÛ ζ…Ä ŠÄHD]—¿Šó?`º—¤õÔºÜsX£lA§?å|{ Dú8¤È.çrÖ˸ƒLl^‘fþE£%ä^zÏ®Í p¶&T´ ZPfX*í¬.Æ}ÏR a‡—†ª„஘ÿ7……b ð>ù«ÂùgÌ•á¾mxm:ùrD‡,üß[$ÂF8vî'µDðçØG¦ ³œYÐrååÉ&ràùÔf‡† ›[db–|• ÏŠ’JC„wØk ™-€Õ rÌŒVüÐ ,@do=S$C,j]µ0­·ão$Qk» ¸ô×ÍsÌ{mô;-ì ¿c~­eïc­@OV‹¶Ë!sm’­hìnvóãvÜ|<åXÊGI ÝMͳã6 œÚ¢÷˜eM1 D\†0(!”'²U›CõðËAð‰Ê»TbFÎsŽeࣕ‡ˆ‘u#}l.:® $G¯Öx¡8K¢U‡–ìJºšÀ Nt7i‰ ¥ß«5ØÒ†Ô¯B«Çè{7ò ˜w²(R³L‰H#µc(”e.6®ÈÜ ­e2­ÒxZPS´ÊK;¦™7Ð';¯–x QÚAt…Æ›ä‰0ÞÒjÆ_Ài|EAvç9·áðï …Ù%×´ŸìË±Ò Ì¾t¢•(*Ø“»dÞ±ÓàW±Ì<û°nqZ©to1ûRw.uŸ7hJ[’µ(>¿¬8žj(Âβ>ÙQô{¬6‘߈m£è!U*-´UæÝ˜•`"§aL®J1"'=}ÚtÈ QìÓ¶!+%ïF´pý[’&:ÇYˆ¶‹%ÆÒë%ðKŸX” ÎgÀÎÀ\X~I¡*ëk^½­(j"®¸ÅeI¹Ó;n"îÒûþ EJªë'š"gÃPyñ•‚=¢8i"ÃõÊGãž:^ôŠ­¼CÈvm-–ž*}w™4C©Æ“úŠ´§(¿ë7ÁŒ¡ð·&RU‚3¹˜êB”#ŽÆÚô…£Å‡/ü§/ZÚ›˜;#P¹…Mc¸nO©ä™\ª}êÓ%7ø85¥·âÛ´n…n‡ÇÞíõÉÈØ<kÓ}¡"¥ìÊÁ,&t€Žò¾·í|þ¼\øuú´Å”Zøó°t¡¶²Mè´r‹ÈqzF#ƒù@!~ñ» €õùÿa ØxD\·€»Op0¥eJ×¥CıÆ*½RÇŽj`äâ[ô"³“õ=WñaAßKµïÆs;~™:ñˆnS[Ž Ö~‡6(`Å`Ñ)\É·¾FÓb¬³;ñ±'¤UNY~/»ÎcCÔåa¿æ)¨ê~x^÷!  "LSÀRU”­v0ׇ¸~ð¶v”ÁAãFš÷õÙåo~ÈÆ`6¢6¡¸·xÖRŒëKÉ6\Û6K»òð‘rø³ï-)š°¶]ê–µœP­½´öÔPH×pêC^qÐ5’,.š‰éñ‚iw¨M-¯ Ô¶HŸÎ*’øËgñÝ ™)$7ƒ=Ïì«ÓeøS%q¼¥È„˜r^6I¨nfHÌ}“ò»ªm\6¶šøxíå@aQY|¿?^„DéÚøÕក…ز#Ù¶¤®‹–=&Î-6;"t£eÀM?öýöPcR/«ì·œ§Æ­»Ö2*ÉÀjÑE<³ ìàûkå4åÉVÕùso©g´Uc?‹š]+íéw¡”Q¯ +Î?­í¦!þ¸¦ž#züGg¬¸MDOè‚M9^^¢¦ØÉzã rjÕ0þsKk_Š'ù­*Ïâ[V¼â>2ÕéâúÑ—>¼xôÅåÙßáÏÒnNendstream endobj 253 0 obj 4560 endobj 257 0 obj <> stream xœÕ\[Ç~'þûæs"v2}ï¶äHŒí(vˆ½¹Hq€…v¹xû×§ªúVÝÓsö[ÈòÙ™¾wU}_UWÏË£yG3þKÿøüƾwGg¯oÌG_Ág7^ÞTà(ýïáó£/N ðd sG'oÄÚâÈÉ#ëõ/Ožßø×FoÍFnÍ¿Oþ5”hjØ0Í*œBÁÛÛc59‚Ø|½S^‡Í­­ÜÜÛ‹Ikã俤–ù2>UÚo¾‡§"@³nc¡· ÞH&) znèÎV¹É»`7ß O½ao¿ƒnn/ÚÆïÀSí&!ôæ|ꃀn°ür,XÆ2C!#¼ÜÜ…ž°ˆ‡ž”Ix MA¥ Š ›¶Çê:á7ÛÊiž Œû‹­ž”„¢Ðž’°–Ênþ‚Õ¥”Ö²‚'µÍ4šÓÑ l”@Xý V]°×?£K©P]ÞnQ•¤Ë‹ŽR¡fÏ,¬‡¼èF¦©›9ä¡¡„ã€Ò Œÿ´¾‰ÏbóIÖ,ñuƒaÃlMã¾X9ó¢i!¥õy¥±ÖÃÜi-xY»o?6¯-­B’D¯$®Æ± °ZƒdÔZ–*×íÞâCCŒZe êþ1(üæÇM©Åä‹iËC´c`õH¢”‚Ç*.+êšÆ!êõž¥¡­ù®1¯ÿ,1ág*Ává&¶á@B6Êh~™]kmëµM‚œù¬!¹õS|» Âæ+TSJ‹dZS‹Ú‡A‹ û=X‚Ë®žÖ½fBóã[“/›Çq 8&.¤ÆÂþguH2ŽMÌ!$£Œ¦‡Ò”˜*xi5”¶°‚f«Î[È×gØÂ³òW}þKî"k‰j*Iª þ I ‚$•Ùe´< ½¬Jµ¸ÌnWヶ`•Û<¨=0©þÝvFíD{4l…Û¡ðŠñ`óšIk>´yC{ͤ¡Ì†¨‰y;rÁ‹â>/d° ý l0þËã$‚¦-º§ Xh=IêRë—G °x 5ê‰yîÐ"–3 òdbl|/ÜÈ#œ©PÙ3‘`pg‡óí¨Û+¬tÆaªûÉf£æ‡,Ç ß© £~NÛ$<ˆ¯‚>p<îjz#pU¸ªhâl ƹˆá'déAÉuSï#«õ/êÃý‘¤ž¦%høio‘³\ß *0T lˆyÞJײ—p½Šâ'‡3Ô¤„ÂÒk* ËY¢#ƯYÑÝÈ$hø;¥AºÒáF8cõâÇßvLتÒ"bÇ”êYe?l´ý°È œU†·®†¸´‘D@‰ï'cøh„\µ"3ìËç£êÏ žŽŠ›~â_?,/ 6=cÉ‘&=|\ ^ðyæ‚ÏK‡Cp~5èð-¸¶†²­å|X<µBü Ñh™öØ«ßrf¦?R’ƒ\ÇÀ” òÑ0ú½£ÜHÜØ©ÏƒEèBÌ* )ö†Ü‘ý00%q0 Œx‡n!säyúÑ¡™“Þ>rdUà‘s‚-ùˆý6Ù!dà(ö æu=„¤m1!}`nbDHSOögØmfźãøÿƒÆ÷¸»¸vHü+ÃÆ/®ƒôçãò–yh€NÇnÛ•þÖ«‚ÏGµß¨º¿ ÙS6Œ UCäá@— rœ+ß–#нÈ #´¹½ -‚#hS1ÿ[Œ3`¢›§²¶šq)Oä€<’A’ ÃÊ.±âªvoW£²„AŒí C¾)×;0·Å±Vµ3àhpè"Ôä“ݧì9ƒÎ‡”Gªµ<Z—Ù©ÆÈ¸œ%çEè±!cÙ.ƒ `ÓPvú0Q£Ý“Èp#†û²LÏý¶°Å“Y(Ùkmç5ú¶t)…í²Zб8s±7ŒÔÖ˜Ùî ¶AÒ\3b0¦æ-²å˜‚ -¬J0TÆÑYT›Bc-³[UäsÖ PãNY%”8;S¤uØÔ®¬A, ¢$TEÐ'ãj±@Hà{äÑZM–`ñÌš•hú°OV4Ó写bãcÁ6/–áó(jJ<ödQÀ<Ès^+fP»™N‘þÃ$“‰|´3 :iÖ‚Asë–ÆÖ0´.[ìYÚI9&„,‰½(l£ß+±ö6¥+Íÿ€Sƒ³ô|gÆYް[ž. 4%Ik¸L?åt…?et  ¥ˆZ9ÿïÿÒlr™Sÿ¸­­©Ý#³ M„åÇ™#T¨Ã¸Â½™R ®¤Pôj—ã¤m¶è8ÊQ@“aRÄŽ0Y]†ë<²Æ[b]— ç\™€ÅÑâWÓj*¿+“#¶¦„l«5‹©›Õï0Ÿ·=-^Ýq)i‡7œ³©¸]C€A÷¸<'‘Ð!/š«f]c&Ó©”"ž¶£Äþ¾žØ–0"·ì¤ÔsIyÄQ,ã´3””k#}¼aÒNÒ¡¶·cpI>Ó–¶–ZžsV˜Sôúüåy”"‰Í^¶Í¦$µœÓæQã ß ”Åò›ØeUÜ&7·$8D“¤[$§¿87R¯ 4ñ´=N XÏ`çå‹l"KzZbû"%ÊUúÍm1º–ÚÒÞsä—ÙÞ.õ^™­é´ªÚÙhëùV¹øÁùV1›ù=/×¥|+2Fí—4œrp DwΞ ›;“ežoU mó>Þ»ƒ…e9ã+Ééľš,ÌÖ+¸ÆÉ+Ûqž­uÞçÒÐ" ³vs}.ih¯ººz)/X:ÝûdÚœõ¹VIÞGùåC'wtám‘Y"õr$ÅdY†÷TL‰]Õï2Þqw ÂïB“š2€¢~c~`Ä®¡Ùlûƒ¬öˆd‘CÄÓž ÛÜ >äSƒÆWS—)(׌ø6~jœqë¦îHò®I~Èa £ªÎ.7 C6vÅ}w¥Ò€ÍJL÷W÷å©5î{ç:q_Jú¹¼ØãL”ŽA¢?ì5 1ýM\³°áš…Ú “ßóxèà¶6Rb†ÒÆî8Õªã\a ö+»t$†GfÇ _ºR/“‹.±ÉR— ûøÕŒÌI¡€×FÄyËͧyF«_Û`ÆêSl7Cò¶øÒ˜vAáæV\¿£{kXÂùê¤tt“‡¨™o)‰œÑ’ Qi¼Æ­ò’±ë€ ÿIÔÒ‰•:æÐìu­°ÌbG×´ù E<ã„¢¯-Œ-„cöWÆ2ï·iº] œîÈ*ñ2ùB’2T½¨И{?GÐIÏ•‡r—oó™>ÅVd!Ÿ›·¹æ8¹úm‹6¿w­Ï¥´`Y 7ÔO L›g±ÝuÇÀä0¹>|füøSV‰³ä߈U´.´p¡‹À ÎÚ,ÜgÍŒߥrثӚg÷o§ç/¯î\O¬™>Ó·\!MWJs)8×£u?ØjRς־HÐg!ÀΑ¯·W|8}=;ºäQëìÕ±à^ȵ@áòÛSöÔ¨|Ù‚7«g_ÜPVº[üà…\qw'\‰ûúWïak¡éЯSlyFœÃ{_Ñ—€VkäžÆ–:ûýDµ:´Ö®\ã¨}§¯I|KßÄb÷“.º™òŒBaɈ³l·uF‘h6«ÆRç-æ¶ä '7Ùrú¤ˆ]¹˜içü”ö;§½(Ç\ÝÆŽ5û‹ýló(ûÆ:̼Ơ¥AäÛæ ¢ÈØÓ‘*ÞåqQW b€ª]–·É+Åg¨±€7ë±ýFeñÜT¯£,éÏ\º¯v MY µ¡|ÝAuîk÷Õ'Ì@óšƒ}Û8‹Õ`æRk¼¹.\q1oé+Çy¶DåmuR™° ¾¼Ñܺ“F¯=©Ð(»_ 2²çEÛ©‘¯°Ù–{€»@i ÷cã˜'pÀcîƒuz¶ã“|™H~èô¼Üï¡è‹'·žÛô)}ÅE¸š”ãîMds'‘f⯣@‘æ»}®­f¢½¶J zm•#B^#:&(Á‰=OWñ~üŽÓU:yуOnaý—ÌkeNÀz¨3;µt3sùáÅC¿’äŽò`ZGbåt7~Ä`åƒ1XçË£×=Þ¥ƒ@£‚,ªcljÌ»~R£Ø!&ÓH ¨An²5÷aùñÁÔ“—•Ã)Ì ‘p­ú¼éDmOÏ5|ÔïUJGßžêŽ!ªJ–´!›S# Ä,¤ô°˼w†: –ßg°6À²ò­K1Öê=2|}×"^4Îy“TÞ8ÅÁªÊ€‰³ïE¡ßhuÇãsLA¹Ý™é¶ðèzîuu‘ÖÏvŸ‚ËQr®éC€,”9©‡ø WÝ:@4VcÊ÷ò¯,ýº<Û;—e††ÎoHÖ›Hvq¹?\Úm â~yrã¯ðï¿¡YKXendstream endobj 258 0 obj 5154 endobj 262 0 obj <> stream xœÕiÅñ»å7ìÇ÷"v˜¾»#%‚s‹B”DÑâcaïšØ 8¿>UÕWõLÍ{o½K¤È?ÏôQ]]÷1ßÍ“:›ñOùûÉ‹Gï~Ξ¾z4Ÿ}ÿ=}ôÝ#EÎÊ_O^œýæO¦4'uvñõ£<[}棔>»xñèï;¿w»i¯§‚ÙYúÇyˆiÒsÜývoà¹wn÷»ý¹šbLÉí.öçð4ªÙì>ƒŸÆMÖ™Ýã½Þ}ˆƒ¬uAïÞƒ~°·0Å»X_X¿ûfXX)¾ä»°íŸq-3iZÕáhxñù^M)E›v¿ÅŒÑ>ÂFôÆÓ”Ikí=˜Á )©²CRsØ}ÜÁ36Ö-‚Šÿ¼ø=` Á0'˜æȺ¸!NÌÞåñLÖkw^ž›y *¥<Þ2ç`g ˜4Ó¬”N°Æ9ü&e§_Tú»=ÌsZE›¡\9‚Í„y2püÇp*ãf8êW¸”‡ƒ^Â÷£vWûs  h8s{ûo˜<µ|ñw3D6c,x@¤ÇmpºòvwÛ~ÙÂZóä¼Ñ1ìnÚ lìkxè`·{FÕpºëþºõ ±:(Ûq—åáPgã hÿ㣋_ òðä)ÀMxx•ì-¿S„Q¸éXÜùðÁžð:iøu‰Äçf¸ú+Ó&ØKBÌñÐPÞ¾¤^k6õ P°@u_Á”4ÃmöþºN¾B¼Æ).>Ùk7ãgp´yÖp¥¯})˜*ð¿ÞŸÚ ´glàÑxX6ùGÎ@ûš¸­[K e¸ŒrìÌ †| ÚrŠu½µ7S(7%?ëÊŸ"uÄ4‡‰Ó3UÂ&€0 bº zPÿ!4Æ&½ûy7ødŸvFú±uà.øÒÏHèð_רÜžUauÏ€£­¯Ö@Ôhµû¦ :€y¿Ë¬ÇMR|ŽW ¨4}d‹û&À±#ˆF»?í‘N H8&møá™TùCacâOÿÖ6ü,ÓHÈÝ ÜнٶaA;épÄ„6–ðr%½À5f`kvßšCPìõ„Yk’ßý°× àuËÍÙÂùV¼”€FðÖƒF@á´{L©‘B8¼ÜMrt©&X ò•nûÐ/›® pGxnû›|¯fö•¯ûÈ”„” "2L)‡g¶*NZyÜÎDÐTº’ëLŒ:¦Ù³se`™ó‰:Ý!¶ŸW‚k?:m_I4x“ï˜m¼Ø:éD.!Pa%«OåÂ0Õš¢ (uPE&z`-Û¾eôÚ˜ô ^†E¢ü¦P¿‰õHòù+ƒ1‰ÃÝ\L@MŽoÌÖj÷•ú¯~àëŒW ‘4Üb£è׸¡š”BaßÀxÞHáï¤Yé©q V"á2mSÞÁ)¬C‹–[‹Fo¬_/±¿ý¦s ÃãU:{™-™ó|^"{”êtìÛ~×ÄFhzÅFå´Œ6oûÄ/—„tŠÿŽÝíR¢áPc(A”ëÂ9æÇ<_{ Õ%¶Ê û·ãàÆ!$°‚át\d‰«L™Ù¦¨.³–*¸ïšÊ€äïK­$eœ¦èÙÃQý‘ì°¶ØñÁ7£;‚Sìx´Úªb‚cþ¬p0­­ì ßÍ]t’JË_­l"ðkD²{’ t­àèÿõ°ÞÙú:WºáLR„P0*™ø^v¤7Á`²¸lÔm8`£iª;)Ÿºï;8ß#7mÙB©àhzAK#Ùè„V“,­•`ï“Û£ oDbºÿ0.iûÜdÉgTf•c`@Í:‘¿yw Å"zG?hð•TÓ ÏVW‡ú¬£ŠÒ.S"Iþ¡¿E8££e7ÅEã©—º±0gæ˜Qúãs€–5 äœEË#kâ¨úoöƒUU7ª—¬ˆÎµŸáݶͮ]BŽcï%ô‰ÁÝ7kÛÞìgý)Ï…‚AþÓZ6Mjh§ëÖ@×ëà¾ÂýZz÷ÿàò1±ZÄ?nè&ÃÐáò]2fd?q‘XhwXYƒ1»0+4ÇD7Ŧ8 BÖv… I\v4¬B­¢VLNúedòJÖlÀŸñ–pÍ£œ?ß…Úfɰ\¸Äóú)à{á:àÞ#Ïfs«àed†Á7L0Û AYÉŒA©È:¢Áb–ÒîªÐ¨?Ùõ3c.%¸õŸ ¢<ÌDj#}†ù(mÞYBƒ0®MÑföž\°kiÎ@¼ë×£ÕAÖX7ÍÌžÑì8C|/xSe;Ý ‘W€XNÜ»²%ïBòµèƒÊhcÄÏûè&ÚŸ­„r1¥Qæ´ÝݨZð²^ŠFW[¤ÓÚÈ \Š”ak–Ù #b4ª¶d3Ð"€ìdú;Æ0Ìçh'¡ZÕ–é©î´É^.§6Œ~X§·áÖnÉ:²ý“h*玞}Ëœ£ë#Ê|Ï5Êu Ã5˜lùY\rSÑñ…‹ÙÚO–©™´qˆÆÉŸ2™ûÆà6Ii Êî>@çY)Œ‡™üö;üÿ-þaˆÏ³kI6lýÿ‰æ™dD÷BOçÛ6†=|Ó¾êѳŽšg½û5œQÏ„Ý<ìuv)=¼•üǾ>•"¨ç v¢I1#DÏ&#Dß#˜ÚéëV´NªYà·­’Ê©rÿløJ/ö½wÉ‹-ñ(íŠ}^¥¬ìq"®d/øŒÞžf[C+“"jݰ[5WŽ)¢÷;? !bíñé¶.ðq{ÏbˆîÖ‰xÖÎ[MGßr¥œî µt6˜“ú´˜|j;þSOÃRqS*ŽhA©uøöQLpK›åWC~d†‰±ßó#LûDèð⛕€ú|¡‰7ò]:¯ã75¨Úp·Rø‹@ë  /]fC½,qdqr‘,ÐPxÊEÉBç+èz/™k›\ÌÖ´Êw"i¤4);#€…KG|I²Q³Ÿs»›àx°E:²'½ô‚«ßÃè™+²c]Ф¸6Ä“^I,Å•¹UŸâyµïÃTu÷%[‚FaÈ|ËÄšù2ŽÒCæKƒ@Óäei?i°‹PÃé"±¯TI£ bügU"cé]*29ô·½æ©ý÷šÍuû Ãæ_áÏl‹Ÿpµ O½Œ1PH,û²æ öÞ[ùÖò31<¦É1öµ²`Ð!¿Y“C}«œ”Šâ†zN°¡Ô¬üÑ,ëç5² U‚©ÂüêàðÆ-iƒ›…ž‰eðÄÞó"4š¡Eö µ"[¬.v‚¬´4VŒ´U׬Ãã‡(R§Z&ô˜mß *ŽÏÚ_Þ‡=ñJL<ñµ1Ñ~G'{Û#§Xé`Z¹ºôwUYك̃]X]ÜÏDe³ —uF³ë¦’Ñ<–ß§Ks²ì†õÁ¨ËÌ¥}™ùÎ?Œ>¨ èšÁ’–±ÍUäéð‡\Ò@)-qޝy̧àܹ 3 ¸z‡ÞŒ~Ñ—ý§ù?(íÊvoíï}T¾ì7aFi÷I÷÷žm8}y4új1P%FñÕN÷ó¾jìŸñ‘kÿ®{šßJ ½éûôî(^õ×Wüë9wò3Ë/2óû£~&p¡?óÓú™@&‡üÌjl¼¥Ÿiµæ~fUéäÂ6cge=ýVÃÚŒ§-‡¾¼e—øòm¬¤cÎP¦\‡ng˜*ïÝ7ÙªÀz¹æa2óá$Ë7ÀÂqDäÚ] 2?eqÂ+A‚³¢á‚ñ|ð[Yì«àˆÛÏFŠŒ å!lÜ92‡d»âìmY¡TTTVЇS¢–”»«o[/û…‰Jo;¦%ÿfVó`¥hÛQÖg™E­E"`…xgÖúÇü˜©^!K²à;Á4ëêü8VôÇÑõHÇÑOGÿm åŠ \Ól¤l‹˜ÈW°™Öååjù0£ñ10º\ì"$SË!k@\L ÁmeÉÏo··H.¢R‡ËD+û€Ís”(+T‡h+ïcXZ¦À‚´ÍˆH!œœ^÷­8NÊ×Ü7OËB:õ=ºÛ&yGðy©8KvÆè fkÛ¢ðškÑIÉÔ»vIZ‘u­ò}`,d,p!‘R;±j6ðZÈW¥f¤r‹•OIJ]i%.é“+*$7x'ÃTÌn»èRæä^ÜPåÿ¤DŠWîà6UK»oç­Äâ°§Q¸¹+GŠM14²PBíWI.ÝÝ„¹“+Ð2›®yŸýÿ»ÿj¯Û¯i!Q?×¥ôðVr–y¦¡]‚™ÿnšM僓Û&to›(}º6F(ªÂÖlX;\à]()ƒ™<ŠÉH='öd‘˜Êsg#£lÑxZHT<µQËÎØ¾F¯€9ÔquxT¦´9ô ê+ãYz æmMkÕ¤U8hwÕÚÅ»V=ÓÊ49Ã"}hÛ’/‹ˆ\Æ2ƒ+•*k=\ß-ihÔëa¦B 1mol` ¢‰c"Ø‹aAäÅ8>liÒL3ÖõJ5lJK‹G<‰ òĽ¨œÀ¥kFòØòŠFfÃ<öù‡Ê¾’ãâ†C6vº¢Íá[çN¤R¼Zó‚ßÇø¢ý‹™‚Ÿ ªGǬz˜Y·jŒÀPk7ÿ#þ\ÖàRÉ’ÜfK±Ÿ½Iý“¾+Þ¹ÁJY5IÎXWhµ'íN=Â9b>ŽWBµAßÇc¤ž*Ƽßôˆ„©>”é,¦¯‹¶Ö/Ójf–Ê„£Ðs›”Bãôó,ö}ìíðxÀ€QƒTÔ¤ƒ-JwÊŸá«Ñ},‡iuBAî®aù¢ÃƒrUh¥r‰¾`p_·rѵ¶Ž‹×‚ï­v¨ØÄ[4.†ö9|vè[!¥áLŽÃ.UNŠ$ 0»‡âp̳;Ã÷O/X 6EÊåfkÝiæ?Ršñ‚IPá?œ×]gw‡~#¡œåºB¡Ù ”²÷\Ë™’Ž`”÷píù´Ç+cÖdDÙÄÃɯÞË¡åe¿ï?m±Õ.\ÄêéR{ñR¼ÃyÐï=Ê õD€s­z~<ÑØ=œˆpX©²ð¥‰}ö;eÇ9I²]?Æ|,kýUéE?¨×^Â’Þª ®‹sC¡¡ÑsÙ›¿­ŠÅ‘Ÿßs­+¹¥cl`¡`{b B tH„4ç>°èåàtžW\Œâý¯°@qªžxèÂúÓC sõaÁ ­Ãñ(+K\õ¯Inø‚ð 1þàÎ Og ÜŒ#”ϲ¹Ð›eªžÅ?ÌÙ ëD/‘þ·0O´£îef _¶æ$$ä8t“JŸÚÛ.1Ôù#•ÄÎ Jb ­ ]>ÕÅêC=ËT‡ ôûáÅ£¿ÀŸÿ íÆendstream endobj 263 0 obj 5310 endobj 267 0 obj <> stream xœÍ\io·þ.äGè[Þ·°¶¼-PÇG$vê¨m€º@I–Õè°-ɶúë;Ãs¸Ë}IM ÃòŠKÉáÌ3gý~— |—áŸôïáùÎï_ÙÝ“«¶ûþžì¼ßá¡Ãnúçð|÷ñ>tâZÏ<ßݳGó]+vS¼Ü?ßùÇB-5þýçþ·0Bòf„ñs0hÿ:~µÜ“ƒµÞóÅ×K>xï”_üy)?,÷ø ”¶b±_û<­R¹Å+håÈÚ…Ùx#„‡á™Ð“¥´ƒ³Þ,þ¶äZ&o_À4_MhãŒO UÙsµø[ç0 öŸ®ûÃZtÒ܉Å3˜ »8˜Iê4@ H C´_ü¸ÜÓ0Ör·øëR ŒiX÷㥤€®@O à¥4‹—8\a é¸_i¦åݰ<²¦4…°<ž‚rô€Y@WíîI6Xî}ׯ:ð¢6ôzÖáWK‡Ìàvn´ÅÃfG§×ÇõõUi„ÑJ«+ÿ nx/ÉûëÞŠHã YQi|½Ì­Èz‚„þngÿwëxüjS_•ç#ŸõvÜΔdGïJãiáñgʯÜñ¢ðx£³²Š¯?éÜñ¸ÇÖGeºÆÃúú²4Þ:½ÖUœ”އ¥í’nžÒ gêÅP0,ñDIëÎ 'ÈÔǵëEézÔ,Mi “Ê*Ž ZyÌ´Z$RN%2uŽhªOÑ@J7D“d÷%–2vA¾¼a"ïþù°ˆ;/`s P×£˜Ž aHy½ø­ƒ”†)iƒðŠÁkì§tQ@í ÛÛJ£ÎÝâ à y4¬E$…³Œ$¢šbù÷°jc´µ¥á O;ñ`[žâ ,Y!($–hM®¡§sVÒ÷u‘W8ÖÖˆºQ\Ê’õˆÏ‹_áá'nÉ Ÿ–hˬï²eËQ3 ®R¹7ÈFd„§}qè9rCÆ ²ê†¡Àf7h£[[,ÐÞ€UE ]Äýï°`kµËTDÙ §¬°3-ÄrS_“CÃa‘;^î¡A<ÁâÁÒ¶œ™š0n¼­ƒÈÙ4×»g?ˆÝ=°Ã%5,;¾ó°çxøÊèrøº=| :Ü$B•N_8‘ÈG#8y?=}gÕäô¥2 TœPhOB 8N]l7¶ve–8GßácôgˆAx‚DŽ4,UzêAýT<¡¾WƒzB 0=Ñ䑪ÄÉŠ\%º§'D,І);,¬à•…'Í1Sµ@™8Ž‚ JcMÔ£Ú{È‚Öõ…$¸†Ü úÝ ç÷1ÑÁ0£u ö“Âü)íC±ß 4ú¾+rZ»ž—Æ­ìþ”ÐuÐz'-=Ôן{Ô7«º +‡§£;ú]1É3›Ø× L ÅTµ>@~<©c‹MžÒ¬.(@Ÿ±îÕ•™ZÿÄ…ÜõˆºGé}@1aB@`L{÷pUí ?e§g/JKt?»f¬…Góì¼`2’”ÙùŒ9‘“ëjz›DqFÑ6v}DsÄm©]“kÐf6ˆÇ6ÍOaôøÓ¯ANÇÌÙþ"Ýê>!>8ñó~Þô'œÜÔô373ý ,DXÛ›~˜ð!M°fu.ŒÕk{Îî÷À V笷-ÛÕƒ-kj+ô«:Mô}ZkT©€qÚ›œ¬èˆjƒ:Ôo ôÖÌd„e`ªCHö°bÃå4hi‘°ƒLozAË = ™¦Ã'!S¦4Å@2J"6ñI©ã":×YÎJ´—rÕÇYâF‰ÍiXØ@Üô¤Û<û†§h‡ ÖØgB÷ršê”èzˆMÁïÎquàÜ‹?oø­{»_ÌãÄ ˜_ó ÐMcžè¨IŸÛ;A‡ïì?$·v\´ñs î;Ž7ÁäÊhSêm´³¿QYk²öIsâ­_à4𣔬ÇUÜÔ½'åö¢,ã{²3ÌÈv“Â,‹‡u.MdÔ# í¥-‡ø^e Cñm•árZ‡x篤 oƒê©æF&íTiGäó°<:_ôÀÒÆÄô:лúO‘"ºÈf”tgW‡õ!¯ãFrד×U–#%iëÜ_,G¾jÐ]ÉÇ36W¯l¸¯zl§ö ç9h1úQ…w±·Iâù K:Ÿˆc³­Œ°À»î}Rm¬¢WÛªòâoõ)oøüGœÀÂ#_0èýØ5:h tÏ00²ÖسPk0h‡—‰³Y–±ïigg#mìhñÿ`9B·,•—Uÿ0¡z°¤/‰¶P¿¡ð”¢²ð6ÏMƒ¬Y‡ˆGÐNþ¯rÁ?˜i¡£HÿPï¤HpØ–¾€$·UBèåîåÈãÃØ&@^–Jm¬¬hEõ|cFŽmªªÑçgƒStÇ©- SW± ·­Õ2i"ßoóö_ïÜ„&:+, »¢—f It˵ ÉŠ*ªèÀCø§ •d2EO÷:`|}yÑT²Cê´fÒ; Îèȼ‡ü®Z°’ k¿kZ =N;€îƒ Bø@5‚ ûý2dU±ðà>b²Ä e‰i¾5%éˆD1ä=”¸§ù@òw0e S6’Ëâè–³ûæµ+`£à­gRÕø( ð$DâD7Ðj òEÑÆÁCšY‡ŠÉð¾kÁ°ûAìÃXÁÙzK¡j›Ì Äe…žD¢1ãðfD¶yÜ t=‹nøÒð7 }¯|b¦B ð%Šʼn¦^GmüÏ9³†4’à´6>YbvÖÜ4n;ž|QÌr¿r3à@üÂ{!1Ã;,žN³uzzÖ-±0­ñIºÝ£ÄÆ©„Ñ'†zÅm¯"„5e>…»K A›æ½¼ÐI¢y«–$vT4G+ÓHadøàš é7€º-„óX•ƒÁI!Ó¼n­Cüš$j/ö(°Ï‡HgqÌ&h&'ßhr¹µÑñ2™êT_6ój"§¹w”f“\ØÃ„.çñÎ+EÙ0T`ö\±ÜÊh9EaósÎÒÛÝrš)hž´¤ÂþžÈèM;óc°þ6O‰Þ˜(·ö"¨ÈÜ(Tµ-%K(ëÀñæány+IJÛj¤§)¾ëÈl¸Rjñ»ïhýë[9t)8-ßËW÷’±ÕZˆ¨§üذE‰Wƒ7ÅdtRGénŽø;¯$±¢U¿˜ú,±‘{ÚQ?¦þ3x{†Ï¹A…Ï4´(gë~‘Þó°ŸXÑÂþ!ïšl£!@÷‹i’Ô™ªïZX~)ÆqVÐ6¡¬HS"þ·iJ`l@0’öNA‡˜9r‰(^§yŽŠ¾Y|ëx[4‚‘³¡íß5˜ ƒZ5Íkíy×So-õ·7ÕœNŽ¡­¤\^ï¥(Ù¢I mèøWlm꦳&f8¤ØœY¬Ý¬¬g¶nk„"]¹¶Ñ¸92`K@J7»pJ÷ZÄ´É“’{ˆ‡ê¢ª“! ][ELQã|-3‰ N'ˆz–”RÈqÊqâ¸`÷¨º;³¶"äÜý<10FoL§ÍS“Hfpõ>k}S†€d)W€ ³€J%‘a'‰ Æ×ç1ЧÉÇ)úé¶‘.ÚM¹Ö^Þa+àx)w9Î<ת‘î‘„åÄÀ[7ÝÑ˦yßHgbŒ×GT"òD&ˆ œèJEòÌ8 ^÷š)Æ4¨~U8šL® FŠmŠP1$êüÎrTÁ¸¹åEÌòÎtm\õ©&æ8ß 4[ެ¥Žc¬Œ÷ô5T.¡tW¹—Ôs˜hb^8wc·Ï°&ðO1Q”½ÖŒ=Yê†Õ±#ªÜI±n`Cëó̈í¸âtÕ÷'ÉQß\B¦Ám ~ ’¥BQ=óQl‹9œ¤ù¾$¦%y$pÖ«i°.=½{ºUf°nº“]m<,B9§¬Ù楩\h8݆ßì5x?_[¶%ÞKü€NÞ ïSÀpg¼ï”çŠPí=­x•æ†b·Ë +Þ‹¦>wóš²imÜŠ’ÚÙZ®;õa·õ5­)›~IÛ”øÖ²»Ü±–â5U{Ó ›Ï\ÚO€Óg,Ӆ׺ώÝï±ÏÉfV}Iû±$õ`ŽO? iKÇÆÕ‚ÀþöÕš_£âvûò3î·(?K³l_~†÷8jŠ*w-?Cìoá¸S{+à øoT{»=HííÿeÉì«f>Øp/É.3¶ž÷Ggä©ÿUôØ?êû¤övúm©úc:4eÿ©ö¶ý$3?~¬”(bw>E8êuí~†8_›»ÍO÷wþþ Ë"Îãendstream endobj 268 0 obj 3944 endobj 272 0 obj <> stream xœÝ\YoÇ~'ò#¿h6ÐŽû> €mÉwG¢a¶(R¦K¤,Š–•_Ÿª>«gzöàR±’æèé®®®óëêýõ˜ü˜áŸôÿÙË£Ùã‹ë#vüü½8úõˆ‡Ç鿳—ÇŸ@#ÉáÉè™çÇ'?ůù±ÇÆ©‘‹ã“—G? f¥‡q%Fk­T¸Y[çGÁÜðéJÂs£õðÅjÍGç¼×ÃÉj Ogrx —RJËáó•b#¥´ÃGpû`¥à£]~¡Ìð¾PГµ´ËaØa_r¡W­áÅ·+>zï”>†Î¤ÆARõÒ„OF!„1¤a$ÏzÏÓž3;ü³’'•ËCXî~:ù8Ì œ‚ŒÌ³NÎAȽұ¡;æ0ÖÛ­Sõd£åÞÇöfÅFé½…aF JJÇ9t2yhÍ ˜ÇhýðÝʹ‘I˜ñëÕZ WÃóÐù÷fµ†SÞˆá)Lϲ‘11|…M5WÎÃShê…UÃ;¸ÒÒX>¼] ?jÇåpƒ+øzJÝ[n†sèɸÑ2 죱Z 7áBr=<ÉA¤ŸÚÐö<Ïì2\麆GÌ{É#…¢ ØÈàò룓¿þ0ð•ì- ×£7Läuù&ILå&.§ÖÉ)ùpÈ/ àÃ)¬á«*Vp)~à€B\ º¼?—†™áÇ´…‘9\c/—Iä¥Ü2ø»†a@4¥ÎVÒ‚6€¾<«áW¯‘IR*/ÂíYTHä"‰VÊD>{ cG)<ý®¾¯__µ]ãŠ*ÔñyÖhX ;jÊZ‡ºŠs€Õ  Å(cÒÀWjø¤jÓçEžeÊ&#.”rÍrzPpo'zñ)t´WNKb ºñoq \1ø÷ÿA>Ã,Ö2¬èp¿´>ÃÛSüù„sH–3ØFY­üðw˜Œ` tù«7µÙiïáMyx]†µO{B Ú?:é§ê/^Æß¡ð†N[q˜ Ï‹,x2¡ìñ?`@c”ÑäŠXt´ 'ØLÖêá´Â œæ»Õš…μ‰ÖGèw.¤@ñNBšé]R|¯Ê BºVLõâiNRËÌoìãE& ŽPhzÕi–Çv1‰Š£€É- Q0¤v£< Ba©˜±”ñíM†)6¯b˜‚æ?,²ŽûõZ¥™Ä+WCL}( —y`$l‰âÇëÀfÝ@ðÛ*<‰ÃTeÛ›"¶õªÓh¡Dýâg´6(ž|Ò³Fš U‡,îdeß$«Œ%Ž\{‰ÊmŒ5Š^V Ž‚¨¥ €1çà¯q µ¶à᪜‰žRQÅp‰fz”×h$öÄ«D]E—’ɾXé‰###u_wÄ ·"ò׃ñJ¾ÈØ=|.»{¡Mφ˜üYbˆwz£X +ÁèmvŸËjz³@G† )ãjF«ý´´¹¬ß”‡è%ŒÙà%€6ôƒ„§‡y a #¸;?º A¬ ñ<‰Ðׯ$þ'–ïÑÊA,ìAI¿_……fä$„cHüV'í6E20U·ÑI+¤;s¡~q'k²›“j¢N71qUCä©ÎÜÜñÞÎK”4´í^B8 ,|ã%ÖBCn¶…|ŸÆÂ­vy¦™'W…îj/£¿áàªÝÄÝ4nBÉà:ÝòLÏ òf7‘²ÒµØ¸Î*2æDTß¡ö‹gŽ›ïà(0ýáªuJ„øû}:ДܯQt“–=Ýwãßðy1µ_àíã]}óòâ:½Ívúª´y]¾ûúõgË"À¢Aú¾¬zž‡í “ó  Ϩ¯xˆ§‰óÿ$w`<„A‹ n xc‚[r)u:šªÌðÛJ«,‡ U-ðM5O£c›Níå‡IȤ¾Œ'KÒ2 Í2Ž[ûQ€iV×&Ï(1……¥gB+qÄËãakçÑ€1V@¬*åiרVQƨ8jœÈ¢œÍmr æ_ žë˜ÝÎÌã"¦ƒÙÜ¢‚;¹;²sÛ¤BÙæUȦ@Dïågç3V `ç>`žÂ›ÄVŽaeñ=ä‚ ®ígüÍŸŠ0é¶r'ƒ VÂ*‚Ãf/!œ”ª<ˆ‚ÍJ¸CmŠöø2þH É' ÖOlAâ%t"D»üN­Z3[UÔšøÐˆ,ã0Ï áà!'1.¨gÁF.ZÇBŒÓ<ÍBOèFÃ]_õºŸL‚KcÐdÝ¢Å^0ûM¼â"^H@¬'3À”à 5±Ø,¼¾l§n|ˆäßVs\Z¾¨ÀBÖŠÐRÚi}U‰*_ãJ[dNC>ñ•][•<- _v9é=á˜qÄK³ðï,Î()`IvòÅX7>¿6c.3¥¾öT£?Æ«ÛÓ}çÓx‹Lã‚ !`SfBkû+zC–ƒÞ>å68^Ã{ pƒÈ߬>(±ßGåÅÆ`Ua ýƒ#M} šü½;/áÕB¹]ö¬Ó[|¯AüüÌ'àë¤EÂX›µ\xfÐH› oÐÉiMÌoM6Ó9N¤3¸W]ÓWìÑ̈àœq€EC“îP[„iŒEb´d‚v´?LaÊŒþ!ìPÐéþ䛘YE‡ "l\’cÂñ¥û† N (ö°òiÓÙB>J"€o*ŒþU…J¾‡¡ã‡Ñ±o †ÓU48ц)º=I³Ç`¢[ÙGK Ò~~#2Ð|ݤø!Úë™wÛT5¾Dûù«´b˜hÚ…GwŠ .’ŠÊö>àiuˆ²›@£1Ca³ Â70GWÿ†òšn†H‚Pƒ¥UY¤s .;)D7ŸøÊ‹”) ŸÕ‚l0è*$`-€²$¨Ä»ßT/LF>£áiN#+¨£F47 ã³Ú õ½?mLZK?HßׯA8îh?ÂCó^E)Âc2·gMD‹Â"Tˆþ'X*ÎÅþÎGZd!–b¥˜“%^ä[Ü*P´ŸßûØTÎ6ØèT'Ù˜†ó^tíoTÔÈh‘y⤠|]ž¯\hк ™“¤¢ä·Žÿ"ôcoëçE*/K×åÙÓÚð² 8)oŒõDHm<©±ÃÚ=Ì›#±ñgÿ‡kwÞ#í¬4|NÖ“ô˜|ÑãúýN?W½~¨`䆗½ÅEÁЪî6ápö14ç­SÆË¸BE$_Nd$5îîŠÉlyBáž÷‚Ö?ïSø”?'û›´CªÞé¸À_e&'è–Aåz$¤U ): ’½¼kÃÎ Ë0‡bj›d,pØØn$JŒÐYGÆj?OVdÿ·b'¡bÒ´aê¶Ò¾¼¢¬tØÞ%4äø³=*fÖ v…àn:8ËÍQÖ3º¶YÞ~Kûç“-nu1#Ã_4Äs!æ&¾·¾ð胮—èÁ ËÝæ *Çâfƒ5ÅVX¥h åa8ÔPá&ª½õ´©Úƒ $ØÇÑ ¯ÏÒÞª&yÉlwžÅô¯´ä´d,ʹËͪP0¸ÓfUê/m§êy†×žC[69µ€©šœKÏ&§Ñàx.!¸°®Ë £A™$†©‚{[T°¼ñ‚\œ»`Û.-EŽjCiÎż¨Ææ²£·:qïÈVãžKߤ[ïÈЦ€ØàÆ;äâJbõÉΊñ„:V0Í $ݵÛ9,Õ~ySê*ãßK|MœË"؆Bׄö(Ç¡…oÞ!NˆúvÕȹŸîâëp8GOJ¯:…½€;0¨6ên‰ë/Ðd";!…ÎkîP×a•Äaœ¬ÙÖ&Â[cÛ­†n%€çYO¶Ÿ»¿}ÝJ¡ 7w‚Œ¤ã›ª«nÿÎó¾Tø!í ?"€ç&oòo(ÕWÛ\¸¨ÉIþÝ™=t6׊±ÉÑ®ÜU#×Ä¥“_€!G¡šˆ"}ø6y#£ÞS¥V©—ÎÌdG2/&"å×mõaââ´yY/üÕÁ|¸³âå*ˆé«ºtW«…£êkÉT(þjŠ_S=㢰˜“½¾îŽùR±SÝŠY+@ÜŠœÂâ,”Lo#€DWÉ”áÏMuM~IÜp2eÌ2LÓa3vß%ZiCŽ<–5›¼ R`nwº‹Ç˜-ûò‚tN2¦¥žáíZo:“æÙõCz…Ó{;óJGà ¶w8›%ìô¨ü>g³ÂAûYߤ4^Õ¢‡¥Ð}+ýÈQXÂËÖÌC¿W11º;ÕNjêöãþŒµ÷s¼ ÙbaxI`îæG#²ð7µ³OŽþ þ oîendstream endobj 273 0 obj 4519 endobj 277 0 obj <> stream xœí\YsE~Wð#¼0³aµ»îª6b9ͱf ˆ #Ù’Ã:lË2øßofÖ•Õ]=3²döe!FÕÕYWž_fÍËýqû#þ›þt¾wÿ{·rµ7î ÿì½ÜÔa?ýïè|ÿ“Cè$$´ a bÿðé^|[ì;¹o½àááùÞ/+½6+»6¿~ o(ѼaÃ0zxéð:~º>Pƒs!ˆÕƒµBð:¬þ±–«­Ä µqruXû|[•ö«ï¡U ëp¤ÕO¤ ƒðz&ôÙZ¹Á»`W?®…€VoØÓ‡0̧3Ú8âgÐªÝ „^}…­>ûÏç‚ýa.#t2ÂËÕ0vñ0’2i/¼ ¼bÂêÑúÀÀ»NøÕk9Œ£y²Öƒ’Ðè) {©ìê;|]Ji-ëxXi¦é]š›SB:OA{~ °Y@Wï¨qp"„x_a¢ŽÛ¯Vßà8ã(Äê[üó~üºÂÏkü¸Àgøñ?î•ÞÏñÏ'øñ?þXHÜroW—¥Ï«Úx\ïÕÆç¥ñIm|[߬=n†p«Ç¥í¬v¼·vxØ£Z•Ç—õñyi<':NÓ0©í¢v|ͧ¦FØó¿ÃÎÊquUž½®/<î5^—Æ«Úøë:·âùË;‚ô|»wø·ÙA|[Ðü´õ ´wØŸ¦ '‚ºÛéÞÿx‡³“6ƒWÁïH;˜ÂOn­bï‰Ò0CÀÅ&E]ÐÐÈ´ÆÐ„ÒãRÕ“Ö ¢þ"vÒ¾*/x8? _@àväçÇñ«Ó€à-[ÚÖ¹RøŸƒˆY|¢èœìñ[wJç +*i ð—A®V:Hâjmm‰ZÒÏÖD  Wä”Zƹhw‘^ƒ?¯ëÔæKBÕg„‹ÿ 6Î$•Î/a#Š©°0e•g óE½oJ7=*>òYžqù‚`Óå@ A$œ…wqê¥Ç5Ÿt–к®ýbL¡€!ЍÛq×Hø°ÑÀ8§|Í… S­Šn-‰¶€fú“©ÊÓ¢‰ˆ4@Äv—ŒÎk˜ y…¬j,®½Î.ºnyVÞ¿¨ïŸDCx CŒÜ?@Y7 +´r<ƒ§¸f†A&ªÈé§í&âtáù°c9ÔZÒºÊÑUªOQöq|G¢†TÀ¬~ïpFbÛÜŽš[ᄚ#OLî[ÎÏï4s‰s:*Ü‹Ä7pRŒ­‡ôZÏ ?؉:Z4o?ãŸ?ü•æm'³„æmÁ,eó†ºÞš÷b’6êx«ÑXá¦úÛéx­#cÝ™ŽQœag<ì®b;_“*©ò4`¤e0ÑiÔ(̃”s—_FITèq^÷ô0›veï'q¦Æš¬ ´Ågf&íØû-#I;Èý\Úó8WHŽ4Ǽ!âÍûÕQ6ˮӞ/x· xw\“¾ƒª½È ä@‡'h­³(é 9a™Úa9? :Íü òq‚kÛ|F2,¼¦ÍqŒ4ER “ÞVR‚µÅ}TXårݬ!}õÎ6üŠ;n´'ž¹!UÙãæ‚¬^}çMG׳3ÆíЫ°•O 3ð¾Êˆ§>QèÇqrÚ2.,Ê¿ðÛ®ö3¤Yù aÓcí2³ás'ûþL+’qr-+§Ý<å3 Þ2íÆÆqtY4K¾Ø«È¸‚d›ù–ûH0ˆPŽ"ùThÏj™ßFlKr$cÕúÆQî=8)¢ej{Ÿñ8ÿf¾S®Žxš…,­‹*g:­²fZ°ûçzÒÚæ{iš°Ë–‹Ð´ì†»™ÇÇ`ì‹k> †]4xŒÄ§sV•Hfd0:4Y¢1à«î:æ¬=³A+Óx€¸öEVû¢¹Âóœ>­ˆm;“ؤa3iH{hŒIÜ ;­‹ßý¸Ý£¸é‰u*Kn®  • Ù'SÁ‘½¨j“WǺ:sÉNGáøï ¿~ÔÁ§}ö?±OK’õ~^Ù!òz\òT}3ÞâJŠñ{ÝäÈ*­:º·ç®ÂÈ|ÝŽ7Ÿ9=Ôl]‰$7Í òr˜)f÷ŸÐhõøÍ€80h¨Y=ÊÜ"çã!³2Ybn?’ã𢻕™³kW~æ6aÂã,xVв8ô¶9xt(ÔT0ÎS¼ik¼ù$Î9÷C::ÃqÌÑ=mdízƾÁHà?±$#Õ…!¶ÙjÒ8QËÒ™ï ¯WóyžV{P`%\ô\íRä¯Õ֨󾎣ãü]{Uz\AFŽdôƒtá,E÷bÙwˆówå? Ò„1k #Ã1oéaq/§>‚ÈpNýyF(‚\ãöµ<ª­ Ç@L9VW^ ÜÐú-(SŒ}*Ç^2ìÉT7F¡Ñ•[X·áÇ‚¬°‘ÚuUÐ=gç¢O—Àë¸Ahuã üz¶À d­ç€ƒÃ)7š)Õý}ÝåJJ*øÃ"·§ÖÈŸàLL}®«‚?Îß Ç-°üVŒ~ðz¢ÃNlJ–ˆ1š¸1ìõñ(ÁÈÊ‚€HpZxš µV'îO–~¨­ÇH6æ±n“³#`›}W[}sì§Â §8€—GÑçV ÑìYÄ+8¸ðb‚ᬃ·S¬õíN§Þì$4G&´‹˜AGâÄ[¶‹°%¦ÝÆøÐ…–6Ž-¦ãûÀ‚œ¼=gà˜çÃ’Çõgbáæ 9¾“@sïç y„¤Œ¹Ää?JÜ’ÿXæ7e‘Ql÷Óѱ¬kH nêýM@È&d)($ß  n‹Þ™ÉBv:eæàUžg[úꦜIŒp¿XeçMõB[à,ö'Û”9Z4ËÌÕQkI·¶çßÒqj*g íª$zÌ™w•À§<þ„ü|ÛM¸à{os ‘íýàlÉ.0t\P™`pïc½ ü£Q)Žó\Ë X0Bè"K°W’II!"l2žnHKi¹¸·Ó/ª:nNHh º¬eÒxÖxJp ÔŽO-:ÆÀã–2⦫´‘º»‰Ó€»á©™ðøK Ã}¼&ÈÞX}OîÃÎ!­ImÖ‡8´Ìzª¼ã½`Ö’ªsmzòõ Z4AR­#x¬À¸ ¹a u¡$Ž­Æäì{qx¿4Á/Ó~ËzUªä™ú®Ý_Tåß<ï°N4–)¼Žól}ð?ªk1©oIº³ße}z?!g±úÊ>†Óq §vç(]Õ|z)ƒn:¸ê«Íó篖µì*ï L‚ü ¬Š¦Ž ZCûh[T³²œžRË쓞‰lj›.óP§ï@¥²¬YvŸŒ^5QÊ@L²“tWœx«Rû.,7…sìÃ"ø8cgV¡!ÍnÏ^ÉKßäÚ‘¶`r us}@jî%T ÍE.Æ‚aúF¸2"ã?v\l"$Õ³µê{Öó•Š6„ Ͷ•BÛd"NgÑQdY0V¡Ôõè'GÓ¤(’tël1€Àl Cû4C1*$ÐìçND4‚p‰¡(õ<©ÚÓ’Õ«€‹.»!gE ž-»”5ÏF»è½Îhžó×AðÈ@m™£Y+’X\N”šÛð¬ÌœÏá¶0òypÔ*•*³S…‹™–ÒvYk¦ß?‚aœ ³v› ²~êvË¢pIÕÙêdhhÉ~©, žO²Z8®A8»;ëVææSl)6ÉÐ